diff --git a/.eslintignore b/.eslintignore
index 268232d911bbb5..64f34660d87a8f 100644
--- a/.eslintignore
+++ b/.eslintignore
@@ -9,5 +9,7 @@ tools/github_reporter
 benchmark/tmp
 benchmark/fixtures
 doc/**/*.js
+doc/changelogs/CHANGELOG_v1*.md
+!doc/changelogs/CHANGELOG_v18.md
 !doc/api_assets/*.js
 !.eslintrc.js
diff --git a/.eslintrc.js b/.eslintrc.js
index f46a64bcbf2acd..a154d00794ab4d 100644
--- a/.eslintrc.js
+++ b/.eslintrc.js
@@ -18,7 +18,7 @@ const hacks = [
   'eslint-plugin-jsdoc',
   'eslint-plugin-markdown',
   '@babel/eslint-parser',
-  '@babel/plugin-syntax-import-assertions',
+  '@babel/plugin-syntax-import-attributes',
 ];
 Module._findPath = (request, paths, isMain) => {
   const r = ModuleFindPath(request, paths, isMain);
@@ -44,7 +44,7 @@ module.exports = {
   parserOptions: {
     babelOptions: {
       plugins: [
-        Module._findPath('@babel/plugin-syntax-import-assertions'),
+        Module._findPath('@babel/plugin-syntax-import-attributes'),
       ],
     },
     requireConfigFile: false,
@@ -256,7 +256,6 @@ module.exports = {
         message: 'Use `globalThis.crypto`.',
       },
     ],
-    'no-return-await': 'error',
     'no-self-compare': 'error',
     'no-tabs': 'error',
     'no-template-curly-in-string': 'error',
@@ -361,5 +360,6 @@ module.exports = {
     WritableStream: 'readable',
     WritableStreamDefaultWriter: 'readable',
     WritableStreamDefaultController: 'readable',
+    WebSocket: 'readable',
   },
 };
diff --git a/.github/CODEOWNERS b/.github/CODEOWNERS
index 1a62e3560a23ef..3e7c3f62aa752f 100644
--- a/.github/CODEOWNERS
+++ b/.github/CODEOWNERS
@@ -20,10 +20,10 @@
 /LICENSE @nodejs/tsc
 /onboarding.md @nodejs/tsc
 
-# website
-/doc/api_assets @nodejs/website
-/doc/template.html @nodejs/website
-/tools/doc @nodejs/website
+# nodejs.org website
+/doc/api_assets @nodejs/nodejs-website
+/doc/template.html @nodejs/nodejs-website
+/tools/doc @nodejs/web-infra
 
 # streams
 
diff --git a/.github/label-pr-config.yml b/.github/label-pr-config.yml
index 622d3332899213..3961cda0e38724 100644
--- a/.github/label-pr-config.yml
+++ b/.github/label-pr-config.yml
@@ -47,7 +47,7 @@ subSystemLabels:
   /^\w+\.md$/: doc
   # Different variants of Makefile and build files
   /^(?:tools\/)?(?:Makefile|BSDmakefile|create_android_makefiles)$/: build, needs-ci
-  /^tools\/(?:install\.py|genv8constants\.py|getnodeversion\.py|js2c\.py|utils\.py|configure\.d\/.*)$/: build, python, needs-ci
+  /^tools\/(?:install\.py|getnodeversion\.py|js2c\.py|utils\.py|configure\.d\/.*)$/: build, python, needs-ci
   /^vcbuild\.bat$/: build, windows, needs-ci
   /^(?:android-)?configure|node\.gyp|common\.gypi$/: build, needs-ci
   # More specific tools
diff --git a/.github/workflows/auto-start-ci.yml b/.github/workflows/auto-start-ci.yml
index 6a45b2d692b94e..262c39dc4d3525 100644
--- a/.github/workflows/auto-start-ci.yml
+++ b/.github/workflows/auto-start-ci.yml
@@ -46,7 +46,7 @@ jobs:
     if: needs.get-prs-for-ci.outputs.numbers != ''
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
 
@@ -55,10 +55,10 @@ jobs:
         with:
           node-version: ${{ env.NODE_VERSION }}
 
-      - name: Install node-core-utils
-        run: npm install -g node-core-utils
+      - name: Install @node-core/utils
+        run: npm install -g @node-core/utils
 
-      - name: Setup node-core-utils
+      - name: Setup @node-core/utils
         run: |
           ncu-config set username ${{ secrets.JENKINS_USER }}
           ncu-config set token "${{ secrets.GH_USER_TOKEN }}"
diff --git a/.github/workflows/build-tarball.yml b/.github/workflows/build-tarball.yml
index 7a1789a2f5fa20..56236ced367c19 100644
--- a/.github/workflows/build-tarball.yml
+++ b/.github/workflows/build-tarball.yml
@@ -39,7 +39,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
@@ -57,7 +57,7 @@ jobs:
           mkdir tarballs
           mv *.tar.gz tarballs
       - name: Upload tarball artifact
-        uses: actions/upload-artifact@0b7f8abb1508181956e8e162db84b466c27e18ce  # v3.1.2
+        uses: actions/upload-artifact@a8a3f3ad30e3422c9c7b888a15615d19a852ae32  # v3.1.3
         with:
           name: tarballs
           path: tarballs
@@ -65,7 +65,7 @@ jobs:
     needs: build-tarball
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/build-windows.yml b/.github/workflows/build-windows.yml
index 36205e56752d0f..3c7012017df7d9 100644
--- a/.github/workflows/build-windows.yml
+++ b/.github/workflows/build-windows.yml
@@ -34,11 +34,11 @@ jobs:
     if: github.event.pull_request.draft == false
     strategy:
       matrix:
-        windows: [windows-2019, windows-2022]
+        windows: [windows-2022]
       fail-fast: false
     runs-on: ${{ matrix.windows }}
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/commit-lint.yml b/.github/workflows/commit-lint.yml
index c4836d505804a6..444725e9fe3d53 100644
--- a/.github/workflows/commit-lint.yml
+++ b/.github/workflows/commit-lint.yml
@@ -17,7 +17,7 @@ jobs:
         run: |
           echo "plusOne=$((${{ github.event.pull_request.commits }} + 1))" >> $GITHUB_OUTPUT
           echo "minusOne=$((${{ github.event.pull_request.commits }} - 1))" >> $GITHUB_OUTPUT
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           fetch-depth: ${{ steps.nb-of-commits.outputs.plusOne }}
           persist-credentials: false
diff --git a/.github/workflows/commit-queue.yml b/.github/workflows/commit-queue.yml
index 8cf3978c3f23ef..e5f73519f16a99 100644
--- a/.github/workflows/commit-queue.yml
+++ b/.github/workflows/commit-queue.yml
@@ -58,7 +58,7 @@ jobs:
     if: needs.get_mergeable_prs.outputs.numbers != ''
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           # Needs the whole git history for ncu to work
           # See https://github.com/nodejs/node-core-utils/pull/486
@@ -74,15 +74,15 @@ jobs:
         uses: actions/setup-node@5e21ff4d9bc1a8cf6de233a3057d20ec6b3fb69d  # v3.8.1
         with:
           node-version: ${{ env.NODE_VERSION }}
-      - name: Install node-core-utils
-        run: npm install -g node-core-utils@latest
+      - name: Install @node-core/utils
+        run: npm install -g @node-core/utils
 
       - name: Set variables
         run: |
           echo "REPOSITORY=$(echo ${{ github.repository }} | cut -d/ -f2)" >> $GITHUB_ENV
           echo "OWNER=${{ github.repository_owner }}" >> $GITHUB_ENV
 
-      - name: Configure node-core-utils
+      - name: Configure @node-core/utils
         run: |
           ncu-config set branch ${GITHUB_REF_NAME}
           ncu-config set upstream origin
diff --git a/.github/workflows/coverage-linux-without-intl.yml b/.github/workflows/coverage-linux-without-intl.yml
index a11350f2377d93..7cb41bbb3f6fbe 100644
--- a/.github/workflows/coverage-linux-without-intl.yml
+++ b/.github/workflows/coverage-linux-without-intl.yml
@@ -37,7 +37,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/coverage-linux.yml b/.github/workflows/coverage-linux.yml
index 03300a334eb05f..12ce0ccc262ade 100644
--- a/.github/workflows/coverage-linux.yml
+++ b/.github/workflows/coverage-linux.yml
@@ -37,7 +37,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/coverage-windows.yml b/.github/workflows/coverage-windows.yml
index 0045010df812d5..164e30ab035d7a 100644
--- a/.github/workflows/coverage-windows.yml
+++ b/.github/workflows/coverage-windows.yml
@@ -39,7 +39,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: windows-2022
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/daily-wpt-fyi.yml b/.github/workflows/daily-wpt-fyi.yml
index 37a67296964b46..0fa94da4b015fb 100644
--- a/.github/workflows/daily-wpt-fyi.yml
+++ b/.github/workflows/daily-wpt-fyi.yml
@@ -57,7 +57,7 @@ jobs:
           SHORT_SHA=$(node -p 'process.version.split(/-nightly\d{8}/)[1]')
           echo "NIGHTLY_REF=$(gh api /repos/nodejs/node/commits/$SHORT_SHA --jq '.sha')" >> $GITHUB_ENV
       - name: Checkout ${{ steps.setup-node.outputs.node-version }}
-        uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
           ref: ${{ env.NIGHTLY_REF || steps.setup-node.outputs.node-version }}
@@ -73,7 +73,7 @@ jobs:
         run: rm -rf wpt
         working-directory: test/fixtures
       - name: Checkout epochs/daily WPT
-        uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           repository: web-platform-tests/wpt
           persist-credentials: false
@@ -98,7 +98,7 @@ jobs:
         run: rm -rf deps/undici
       - name: Checkout undici
         if: ${{ env.WPT_REPORT != '' }}
-        uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           repository: nodejs/undici
           persist-credentials: false
@@ -121,7 +121,7 @@ jobs:
         run: cp wptreport.json wptreport-${{ steps.setup-node.outputs.node-version }}.json
       - name: Upload GitHub Actions artifact
         if: ${{ env.WPT_REPORT != '' }}
-        uses: actions/upload-artifact@0b7f8abb1508181956e8e162db84b466c27e18ce  # v3.1.2
+        uses: actions/upload-artifact@a8a3f3ad30e3422c9c7b888a15615d19a852ae32  # v3.1.3
         with:
           path: out/wpt/wptreport-*.json
           name: WPT Reports
diff --git a/.github/workflows/daily.yml b/.github/workflows/daily.yml
index d7c688db158a08..df11560e737837 100644
--- a/.github/workflows/daily.yml
+++ b/.github/workflows/daily.yml
@@ -17,7 +17,7 @@ jobs:
     # not working on gcc-8 and gcc-9 see https://github.com/nodejs/node/issues/38570
     container: gcc:11
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Use Node.js ${{ env.NODE_VERSION }}
diff --git a/.github/workflows/doc.yml b/.github/workflows/doc.yml
index 0efc8cda7ce386..36715798829efb 100644
--- a/.github/workflows/doc.yml
+++ b/.github/workflows/doc.yml
@@ -24,7 +24,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Use Node.js ${{ env.NODE_VERSION }}
@@ -35,7 +35,7 @@ jobs:
         run: npx envinfo
       - name: Build
         run: NODE=$(command -v node) make doc-only
-      - uses: actions/upload-artifact@0b7f8abb1508181956e8e162db84b466c27e18ce  # v3.1.2
+      - uses: actions/upload-artifact@a8a3f3ad30e3422c9c7b888a15615d19a852ae32  # v3.1.3
         with:
           name: docs
           path: out/doc
diff --git a/.github/workflows/find-inactive-collaborators.yml b/.github/workflows/find-inactive-collaborators.yml
index e5b6f2d5d2ffde..badb0866dc23d1 100644
--- a/.github/workflows/find-inactive-collaborators.yml
+++ b/.github/workflows/find-inactive-collaborators.yml
@@ -19,7 +19,7 @@ jobs:
     runs-on: ubuntu-latest
 
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           fetch-depth: 0
           persist-credentials: false
@@ -41,7 +41,10 @@ jobs:
         with:
           author: Node.js GitHub Bot <github-bot@iojs.org>
           branch: actions/inactive-collaborators
-          body: This PR was generated by tools/find-inactive-collaborators.yml.
+          body: |
+            This PR was generated by tools/find-inactive-collaborators.yml.
+
+            @nodejs/tsc Please follow up with the [offboarding tasks](https://github.com/nodejs/node/blob/main/doc/contributing/offboarding.md).
           commit-message: 'meta: move one or more collaborators to emeritus'
           labels: meta
           title: 'meta: move one or more collaborators to emeritus'
diff --git a/.github/workflows/find-inactive-tsc.yml b/.github/workflows/find-inactive-tsc.yml
index b6c1b990041de8..0a14599e776d56 100644
--- a/.github/workflows/find-inactive-tsc.yml
+++ b/.github/workflows/find-inactive-tsc.yml
@@ -20,13 +20,13 @@ jobs:
 
     steps:
       - name: Checkout the repo
-        uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           fetch-depth: 0
           persist-credentials: false
 
       - name: Clone nodejs/TSC repository
-        uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           fetch-depth: 0
           path: .tmp
diff --git a/.github/workflows/license-builder.yml b/.github/workflows/license-builder.yml
index 28429d3fcff96e..724572c044d0c1 100644
--- a/.github/workflows/license-builder.yml
+++ b/.github/workflows/license-builder.yml
@@ -17,7 +17,7 @@ jobs:
     if: github.repository == 'nodejs/node'
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - run: ./tools/license-builder.sh  # Run the license builder tool
diff --git a/.github/workflows/linters.yml b/.github/workflows/linters.yml
index 4770dca2f2834b..ff01e442990582 100644
--- a/.github/workflows/linters.yml
+++ b/.github/workflows/linters.yml
@@ -25,7 +25,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Use Node.js ${{ env.NODE_VERSION }}
@@ -40,7 +40,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
@@ -55,7 +55,7 @@ jobs:
     if: ${{ github.event.pull_request && github.event.pull_request.draft == false && github.base_ref == github.event.repository.default_branch }}
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           fetch-depth: 0
           persist-credentials: false
@@ -93,7 +93,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Use Node.js ${{ env.NODE_VERSION }}
@@ -118,7 +118,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
@@ -135,7 +135,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Use Python ${{ env.PYTHON_VERSION }}
@@ -153,7 +153,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - run: shellcheck -V
@@ -163,7 +163,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - uses: mszostok/codeowners-validator@7f3f5e28c6d7b8dfae5731e54ce2272ca384592f
@@ -173,7 +173,7 @@ jobs:
     if: ${{ github.event.pull_request }}
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           fetch-depth: 2
           persist-credentials: false
diff --git a/.github/workflows/notify-on-push.yml b/.github/workflows/notify-on-push.yml
index 99b0d4938f32cd..45ed957c0acefa 100644
--- a/.github/workflows/notify-on-push.yml
+++ b/.github/workflows/notify-on-push.yml
@@ -34,7 +34,7 @@ jobs:
     permissions:
       pull-requests: write
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Check commit message
diff --git a/.github/workflows/scorecard.yml b/.github/workflows/scorecard.yml
index 64da158ac15173..804b95cb64683c 100644
--- a/.github/workflows/scorecard.yml
+++ b/.github/workflows/scorecard.yml
@@ -38,7 +38,7 @@ jobs:
           egress-policy: audit  # TODO: change to 'egress-policy: block' after couple of runs
 
       - name: Checkout code
-        uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
 
@@ -65,7 +65,7 @@ jobs:
       # Upload the results as artifacts (optional). Commenting out will disable uploads of run results in SARIF
       # format to the repository Actions tab.
       - name: Upload artifact
-        uses: actions/upload-artifact@0b7f8abb1508181956e8e162db84b466c27e18ce  # v3.1.2
+        uses: actions/upload-artifact@a8a3f3ad30e3422c9c7b888a15615d19a852ae32  # v3.1.3
         with:
           name: SARIF file
           path: results.sarif
@@ -73,6 +73,6 @@ jobs:
 
       # Upload the results to GitHub's code scanning dashboard.
       - name: Upload to code-scanning
-        uses: github/codeql-action/upload-sarif@00e563ead9f72a8461b24876bee2d0c2e8bd2ee8  # v2.21.5
+        uses: github/codeql-action/upload-sarif@ddccb873888234080b77e9bc2d4764d5ccaaccf9  # v2.21.9
         with:
           sarif_file: results.sarif
diff --git a/.github/workflows/test-asan.yml b/.github/workflows/test-asan.yml
index 1336abbbdca070..3b869140e39317 100644
--- a/.github/workflows/test-asan.yml
+++ b/.github/workflows/test-asan.yml
@@ -47,7 +47,7 @@ jobs:
       CONFIG_FLAGS: --enable-asan
       ASAN: true
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/test-internet.yml b/.github/workflows/test-internet.yml
index 7f10457e3ad5f6..20a3beb5367e7e 100644
--- a/.github/workflows/test-internet.yml
+++ b/.github/workflows/test-internet.yml
@@ -40,7 +40,7 @@ jobs:
     if: github.repository == 'nodejs/node' || github.event_name != 'schedule'
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/test-linux.yml b/.github/workflows/test-linux.yml
index 76330f37d05ad7..c5838f316c9662 100644
--- a/.github/workflows/test-linux.yml
+++ b/.github/workflows/test-linux.yml
@@ -34,7 +34,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/test-macos.yml b/.github/workflows/test-macos.yml
index c74d3d193bfe4d..d0d9d846156dee 100644
--- a/.github/workflows/test-macos.yml
+++ b/.github/workflows/test-macos.yml
@@ -40,7 +40,7 @@ jobs:
     if: github.event.pull_request.draft == false
     runs-on: macos-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Set up Python ${{ env.PYTHON_VERSION }}
diff --git a/.github/workflows/timezone-update.yml b/.github/workflows/timezone-update.yml
index f48dd8ad0eb3ed..0b1eecde618c7e 100644
--- a/.github/workflows/timezone-update.yml
+++ b/.github/workflows/timezone-update.yml
@@ -20,12 +20,12 @@ jobs:
 
     steps:
       - name: Checkout nodejs/node
-        uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
 
       - name: Checkout unicode-org/icu-data
-        uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+        uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           path: icu-data
           persist-credentials: false
diff --git a/.github/workflows/tools.yml b/.github/workflows/tools.yml
index 880586e2879cbe..852097fa5626cf 100644
--- a/.github/workflows/tools.yml
+++ b/.github/workflows/tools.yml
@@ -23,6 +23,7 @@ on:
           - corepack
           - doc
           - eslint
+          - github_reporter
           - googletest
           - histogram
           - icu
@@ -284,7 +285,7 @@ jobs:
               tail -n1 temp-output | grep "NEW_VERSION=" >> "$GITHUB_ENV" || true
               rm temp-output
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         if: github.event_name == 'schedule' || inputs.id == 'all' || inputs.id == matrix.id
         with:
           persist-credentials: false
diff --git a/.github/workflows/update-openssl.yml b/.github/workflows/update-openssl.yml
index 0586e0b7d5595d..5fdc7ac22a8778 100644
--- a/.github/workflows/update-openssl.yml
+++ b/.github/workflows/update-openssl.yml
@@ -14,7 +14,7 @@ jobs:
     if: github.repository == 'nodejs/node'
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Check and download new OpenSSL version
@@ -62,7 +62,7 @@ jobs:
     if: github.repository == 'nodejs/node'
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
           ref: v16.x-staging
diff --git a/.github/workflows/update-v8.yml b/.github/workflows/update-v8.yml
index fb123a5b069a72..8fe51b944da264 100644
--- a/.github/workflows/update-v8.yml
+++ b/.github/workflows/update-v8.yml
@@ -16,11 +16,11 @@ jobs:
     if: github.repository == 'nodejs/node'
     runs-on: ubuntu-latest
     steps:
-      - uses: actions/checkout@f43a0e5ff2bd294095638e18286ca9a3d1956744  # v3.6.0
+      - uses: actions/checkout@8ade135a41bc03ea155e62e844d188df1ea18608  # v4.1.0
         with:
           persist-credentials: false
       - name: Cache node modules and update-v8
-        uses: actions/cache@88522ab9f39a2ea568f7027eddc7d8d8bc9d59c8  # v3.3.1
+        uses: actions/cache@704facf57e6136b1bc63b828d79edcd491f0ee84  # v3.3.2
         id: cache-v8-npm
         env:
           cache-name: cache-v8-npm
@@ -33,8 +33,8 @@ jobs:
         uses: actions/setup-node@5e21ff4d9bc1a8cf6de233a3057d20ec6b3fb69d  # v3.8.1
         with:
           node-version: ${{ env.NODE_VERSION }}
-      - name: Install node-core-utils
-        run: npm install -g node-core-utils@latest
+      - name: Install @node-core/utils
+        run: npm install -g @node-core/utils
       - name: Check and download new V8 version
         run: |
             ./tools/dep_updaters/update-v8-patch.sh > temp-output
diff --git a/.gitpod.yml b/.gitpod.yml
index b674e800f4c015..1a56acf40f1746 100644
--- a/.gitpod.yml
+++ b/.gitpod.yml
@@ -1,7 +1,7 @@
 # Ref: https://github.com/gitpod-io/gitpod/issues/6283#issuecomment-1001043454
 tasks:
   - init: ./configure && timeout 50m make -j16 || true
-  - init: pnpm i -g node-core-utils
+  - init: pnpm i -g @node-core/utils
 
 # Ref: https://www.gitpod.io/docs/prebuilds#github-specific-configuration
 github:
diff --git a/BUILDING.md b/BUILDING.md
index f95c7637673dc1..983fa9188e5317 100644
--- a/BUILDING.md
+++ b/BUILDING.md
@@ -153,7 +153,7 @@ Depending on the host platform, the selection of toolchains may vary.
 | Operating System | Compiler Versions                                              |
 | ---------------- | -------------------------------------------------------------- |
 | Linux            | GCC >= 10.1                                                    |
-| Windows          | Visual Studio >= 2019 with the Windows 10 SDK on a 64-bit host |
+| Windows          | Visual Studio >= 2022 with the Windows 10 SDK on a 64-bit host |
 | macOS            | Xcode >= 13 (Apple LLVM >= 12)                                 |
 
 ### Official binary platforms and toolchains
@@ -170,7 +170,7 @@ Binaries at <https://nodejs.org/download/release/> are produced on:
 | linux-ppc64le           | RHEL 8 with gcc-toolset-10[^6]                                                                              |
 | linux-s390x             | RHEL 8 with gcc-toolset-10[^6]                                                                              |
 | linux-x64               | RHEL 8 with gcc-toolset-10[^6]                                                                              |
-| win-x64 and win-x86     | Windows 2012 R2 (x64) with Visual Studio 2019                                                               |
+| win-x64 and win-x86     | Windows Server 2022 (x64) with Visual Studio 2022                                                           |
 
 [^6]: Binaries produced on these systems are compatible with glibc >= 2.28
     and libstdc++ >= 6.0.25 (`GLIBCXX_3.4.25`). These are available on
@@ -543,7 +543,8 @@ export CC="ccache cc"    # add to ~/.zshrc or other shell config file
 export CXX="ccache c++"  # add to ~/.zshrc or other shell config file
 ```
 
-This will allow for near-instantaneous rebuilds even when switching branches.
+This will allow for near-instantaneous rebuilds when switching branches back
+and forth that were built with cache.
 
 When modifying only the JS layer in `lib`, it is possible to externally load it
 without modifying the executable:
@@ -576,9 +577,9 @@ to run it again before invoking `make -j4`.
 
 * [Python 3.11](https://apps.microsoft.com/store/detail/python-311/9NRWMJP3717K)
 * The "Desktop development with C++" workload from
-  [Visual Studio 2019](https://visualstudio.microsoft.com/vs/older-downloads/#visual-studio-2019-and-other-products) or
+  [Visual Studio 2022](https://visualstudio.microsoft.com/downloads/) or
   the "C++ build tools" workload from the
-  [Build Tools](https://aka.ms/vs/16/release/vs_buildtools.exe),
+  [Build Tools](https://aka.ms/vs/17/release/vs_buildtools.exe),
   with the default optional components
 * Basic Unix tools required for some tests,
   [Git for Windows](https://git-scm.com/download/win) includes Git Bash
@@ -590,11 +591,12 @@ to run it again before invoking `make -j4`.
 
 Optional requirements to build the MSI installer package:
 
-* The .NET SDK component from [Visual Studio 2019](https://visualstudio.microsoft.com/vs/older-downloads/#visual-studio-2019-and-other-products)
+* The .NET SDK component from [Visual Studio 2022](https://visualstudio.microsoft.com/downloads/)
+  * This component can be installed via the Visual Studio Installer Application
 
 Optional requirements for compiling for Windows 10 on ARM (ARM64):
 
-* Visual Studio 15.9.0 or newer
+* Visual Studio 17.6.0 or newer
 * Visual Studio optional components
   * Visual C++ compilers and libraries for ARM64
   * Visual C++ ATL for ARM64
@@ -610,8 +612,8 @@ packages:
 * [Git for Windows](https://chocolatey.org/packages/git) with the `git` and
   Unix tools added to the `PATH`
 * [Python 3.x](https://chocolatey.org/packages/python)
-* [Visual Studio 2019 Build Tools](https://chocolatey.org/packages/visualstudio2019buildtools)
-  with [Visual C++ workload](https://chocolatey.org/packages/visualstudio2019-workload-vctools)
+* [Visual Studio 2022 Build Tools](https://chocolatey.org/packages/visualstudio2022buildtools)
+  with [Visual C++ workload](https://chocolatey.org/packages/visualstudio2022-workload-vctools)
 * [NetWide Assembler](https://chocolatey.org/packages/nasm)
 
 To install Node.js prerequisites using
@@ -619,8 +621,8 @@ To install Node.js prerequisites using
 <https://boxstarter.org/package/nr/url?https://raw.githubusercontent.com/nodejs/node/HEAD/tools/bootstrap/windows_boxstarter>
 with Internet Explorer or Edge browser on the target machine.
 
-Alternatively, you can use PowerShell. Run those commands from an elevated
-PowerShell terminal:
+Alternatively, you can use PowerShell. Run those commands from
+an elevated (Administrator) PowerShell terminal:
 
 ```powershell
 Set-ExecutionPolicy Unrestricted -Force
@@ -635,8 +637,16 @@ disk space.
 
 #### Building Node.js
 
-If the path to your build directory contains a space or a non-ASCII character,
-the build will likely fail.
+* Remember to first clone the Node.js repository with the Git command
+  and head to the directory that Git created; If you haven't already
+  ```powershell
+  git clone https://github.com/nodejs/node.git
+  cd node
+  ```
+* If the path to your build directory contains a space or a non-ASCII character,
+  the build will likely fail
+
+To start the build process:
 
 ```powershell
 .\vcbuild
@@ -697,7 +707,7 @@ This is the default option.
 ### Trimmed: `small-icu` (English only) support
 
 In this configuration, only English data is included, but
-the full `Intl` (ECMA-402) APIs.  It does not need to download
+the full `Intl` (ECMA-402) APIs. It does not need to download
 any dependencies to function. You can add full data at runtime.
 
 #### Unix/macOS
diff --git a/CHANGELOG.md b/CHANGELOG.md
index b64b324d3c59b6..01b8655f1c5357 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -2,6 +2,7 @@
 
 Select a Node.js version below to view the changelog history:
 
+* [Node.js 21](doc/changelogs/CHANGELOG_V21.md) **Current**
 * [Node.js 20](doc/changelogs/CHANGELOG_V20.md) **Current**
 * [Node.js 19](doc/changelogs/CHANGELOG_V19.md) End-of-Life
 * [Node.js 18](doc/changelogs/CHANGELOG_V18.md) **Long Term Support**
@@ -29,12 +30,19 @@ release.
 
 <table>
 <tr>
+  <th title="Current"><a href="doc/changelogs/CHANGELOG_V21.md">21</a> (Current)</th>
   <th title="Current"><a href="doc/changelogs/CHANGELOG_V20.md">20</a> (Current)</th>
   <th title="LTS Until 2025-04"><a href="doc/changelogs/CHANGELOG_V18.md">18</a> (LTS)</th>
 </tr>
 <tr>
   <td valign="top">
-<b><a href="doc/changelogs/CHANGELOG_V20.md#20.6.1">20.6.1</a></b><br/>
+<b><a href="doc/changelogs/CHANGELOG_V21.md#21.0.0">21.0.0</a></b><br/>
+  </td>
+  <td valign="top">
+<b><a href="doc/changelogs/CHANGELOG_V20.md#20.8.1">20.8.1</a></b><br/>
+<a href="doc/changelogs/CHANGELOG_V20.md#20.8.0">20.8.0</a><br/>
+<a href="doc/changelogs/CHANGELOG_V20.md#20.7.0">20.7.0</a><br/>
+<a href="doc/changelogs/CHANGELOG_V20.md#20.6.1">20.6.1</a><br/>
 <a href="doc/changelogs/CHANGELOG_V20.md#20.6.0">20.6.0</a><br/>
 <a href="doc/changelogs/CHANGELOG_V20.md#20.5.1">20.5.1</a><br/>
 <a href="doc/changelogs/CHANGELOG_V20.md#20.5.0">20.5.0</a><br/>
@@ -46,7 +54,10 @@ release.
 <a href="doc/changelogs/CHANGELOG_V20.md#20.0.0">20.0.0</a><br/>
   </td>
   <td valign="top">
-<b><a href="doc/changelogs/CHANGELOG_V18.md#18.17.1">18.17.1</a></b><br/>
+<b><a href="doc/changelogs/CHANGELOG_V18.md#18.18.2">18.18.2</a></b><br/>
+<a href="doc/changelogs/CHANGELOG_V18.md#18.18.1">18.18.1</a><br/>
+<a href="doc/changelogs/CHANGELOG_V18.md#18.18.0">18.18.0</a><br/>
+<a href="doc/changelogs/CHANGELOG_V18.md#18.17.1">18.17.1</a><br/>
 <a href="doc/changelogs/CHANGELOG_V18.md#18.17.0">18.17.0</a><br/>
 <a href="doc/changelogs/CHANGELOG_V18.md#18.16.1">18.16.1</a><br/>
 <a href="doc/changelogs/CHANGELOG_V18.md#18.16.0">18.16.0</a><br/>
diff --git a/Makefile b/Makefile
index 47eb7288ad36b0..b7871bf218572c 100644
--- a/Makefile
+++ b/Makefile
@@ -286,7 +286,7 @@ coverage-report-js:
 # Runs the C++ tests using the built `cctest` executable.
 cctest: all
 	@out/$(BUILDTYPE)/$@ --gtest_filter=$(GTEST_FILTER)
-	@out/$(BUILDTYPE)/embedtest "require('./test/embedding/test-embedding.js')"
+	$(NODE) ./test/embedding/test-embedding.js
 
 .PHONY: list-gtests
 list-gtests:
@@ -550,7 +550,7 @@ test-ci: | clear-stalled bench-addons-build build-addons build-js-native-api-tes
 	$(PYTHON) tools/test.py $(PARALLEL_ARGS) -p tap --logfile test.tap \
 		--mode=$(BUILDTYPE_LOWER) --flaky-tests=$(FLAKY_TESTS) \
 		$(TEST_CI_ARGS) $(CI_JS_SUITES) $(CI_NATIVE_SUITES) $(CI_DOC)
-	out/Release/embedtest 'require("./test/embedding/test-embedding.js")'
+	$(NODE) ./test/embedding/test-embedding.js
 	$(info Clean up any leftover processes, error if found.)
 	ps awwx | grep Release/node | grep -v grep | cat
 	@PS_OUT=`ps awwx | grep Release/node | grep -v grep | awk '{print $$1}'`; \
diff --git a/README.md b/README.md
index 76eb5c3c60ec6d..1f1027e1b57ecf 100644
--- a/README.md
+++ b/README.md
@@ -174,8 +174,6 @@ For information about the governance of the Node.js project, see
   **Ruben Bridgewater** <<ruben@bridgewater.de>> (he/him)
 * [cjihrig](https://github.com/cjihrig) -
   **Colin Ihrig** <<cjihrig@gmail.com>> (he/him)
-* [danielleadams](https://github.com/danielleadams) -
-  **Danielle Adams** <<adamzdanielle@gmail.com>> (she/her)
 * [GeoffreyBooth](https://github.com/geoffreybooth) -
   **Geoffrey Booth** <<webadmin@geoffreybooth.com>> (he/him)
 * [gireeshpunathil](https://github.com/gireeshpunathil) -
@@ -221,6 +219,8 @@ For information about the governance of the Node.js project, see
   **Shelley Vohr** <<shelley.vohr@gmail.com>> (she/her)
 * [danbev](https://github.com/danbev) -
   **Daniel Bevenius** <<daniel.bevenius@gmail.com>> (he/him)
+* [danielleadams](https://github.com/danielleadams) -
+  **Danielle Adams** <<adamzdanielle@gmail.com>> (she/her)
 * [fhinkel](https://github.com/fhinkel) -
   **Franziska Hinkelmann** <<franziska.hinkelmann@gmail.com>> (she/her)
 * [gabrielschulhof](https://github.com/gabrielschulhof) -
@@ -308,7 +308,7 @@ For information about the governance of the Node.js project, see
 * [bmeck](https://github.com/bmeck) -
   **Bradley Farias** <<bradley.meck@gmail.com>>
 * [bnb](https://github.com/bnb) -
-  **Tierney Cyren** <<hello@bnb.im>> (they/he)
+  **Tierney Cyren** <<hello@bnb.im>> (they/them)
 * [bnoordhuis](https://github.com/bnoordhuis) -
   **Ben Noordhuis** <<info@bnoordhuis.nl>>
 * [BridgeAR](https://github.com/BridgeAR) -
@@ -357,6 +357,8 @@ For information about the governance of the Node.js project, see
   **Gireesh Punathil** <<gpunathi@in.ibm.com>> (he/him)
 * [guybedford](https://github.com/guybedford) -
   **Guy Bedford** <<guybedford@gmail.com>> (he/him)
+* [H4ad](https://github.com/H4ad) -
+  **Vinícius Lourenço Claro Cardoso** <<contact@viniciusl.com.br>> (he/him)
 * [HarshithaKP](https://github.com/HarshithaKP) -
   **Harshitha K P** <<harshitha014@gmail.com>> (she/her)
 * [himself65](https://github.com/himself65) -
@@ -721,6 +723,8 @@ maintaining the Node.js project.
   **Akhil Marsonya** <<akhil.marsonya27@gmail.com>> (he/him)
 * [meixg](https://github.com/meixg) -
   **Xuguang Mei** <<meixuguang@gmail.com>> (he/him)
+* [mertcanaltin](https://github.com/mertcanaltin) -
+  **Mert Can Altin** <<mertgold60@gmail.com>>
 * [Mesteery](https://github.com/Mesteery) -
   **Mestery** <<mestery@protonmail.com>> (he/him)
 * [preveen-stack](https://github.com/preveen-stack) -
diff --git a/android_configure.py b/android_configure.py
index 57d940239150df..a82bb56bc5f5b6 100644
--- a/android_configure.py
+++ b/android_configure.py
@@ -70,6 +70,7 @@ def patch_android():
 GYP_DEFINES += " v8_target_arch=" + arch
 GYP_DEFINES += " android_target_arch=" + arch
 GYP_DEFINES += " host_os=" + host_os + " OS=android"
+GYP_DEFINES += " android_ndk_path=" + android_ndk_path
 os.environ['GYP_DEFINES'] = GYP_DEFINES
 
 if os.path.exists("./configure"):
diff --git a/benchmark/blob/blob.js b/benchmark/blob/blob.js
index 7e5ea5d7cc2fae..4a79a87d27deba 100644
--- a/benchmark/blob/blob.js
+++ b/benchmark/blob/blob.js
@@ -4,7 +4,7 @@ const { Blob } = require('buffer');
 
 const bench = common.createBenchmark(main, {
   bytes: [128, 1024, 1024 ** 2],
-  n: [1e6],
+  n: [1e3],
   operation: ['text', 'arrayBuffer'],
 });
 
diff --git a/benchmark/blob/clone.js b/benchmark/blob/clone.js
new file mode 100644
index 00000000000000..39890672fc66f8
--- /dev/null
+++ b/benchmark/blob/clone.js
@@ -0,0 +1,25 @@
+'use strict';
+const common = require('../common.js');
+const {
+  Blob,
+} = require('node:buffer');
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [50e3],
+  bytes: [128, 1024, 1024 ** 2],
+});
+
+let _cloneResult;
+
+function main({ n, bytes }) {
+  const buff = Buffer.allocUnsafe(bytes);
+  const blob = new Blob(buff);
+  bench.start();
+  for (let i = 0; i < n; ++i)
+    _cloneResult = structuredClone(blob);
+  bench.end(n);
+
+  // Avoid V8 deadcode (elimination)
+  assert.ok(_cloneResult);
+}
diff --git a/benchmark/blob/creation.js b/benchmark/blob/creation.js
new file mode 100644
index 00000000000000..906d301bca850a
--- /dev/null
+++ b/benchmark/blob/creation.js
@@ -0,0 +1,48 @@
+'use strict';
+const common = require('../common.js');
+const {
+  Blob,
+} = require('node:buffer');
+const assert = require('assert');
+
+const options = {
+  flags: ['--expose-internals'],
+};
+
+const bench = common.createBenchmark(main, {
+  n: [50e3],
+  kind: [
+    'Blob',
+    'createBlob',
+  ],
+}, options);
+
+let _blob;
+let _createBlob;
+
+function main({ n, kind }) {
+  switch (kind) {
+    case 'Blob': {
+      bench.start();
+      for (let i = 0; i < n; ++i)
+        _blob = new Blob(['hello']);
+      bench.end(n);
+
+      // Avoid V8 deadcode (elimination)
+      assert.ok(_blob);
+      break;
+    } case 'createBlob': {
+      const { createBlob } = require('internal/blob');
+      const reusableBlob = new Blob(['hello']);
+      bench.start();
+      for (let i = 0; i < n; ++i)
+        _createBlob = createBlob(reusableBlob, reusableBlob.size);
+      bench.end(n);
+
+      // Avoid V8 deadcode (elimination)
+      assert.ok(_createBlob);
+      break;
+    } default:
+      throw new Error('Invalid kind');
+  }
+}
diff --git a/benchmark/blob/file.js b/benchmark/blob/file.js
index 001de1be1157f9..39596f91e397e8 100644
--- a/benchmark/blob/file.js
+++ b/benchmark/blob/file.js
@@ -3,8 +3,8 @@ const common = require('../common.js');
 const { File } = require('buffer');
 
 const bench = common.createBenchmark(main, {
-  bytes: [128, 1024, 1024 ** 2],
-  n: [1e6],
+  bytes: [128, 1024],
+  n: [1e3],
   operation: ['text', 'arrayBuffer'],
 });
 
diff --git a/benchmark/blob/resolveObjectURL.js b/benchmark/blob/resolveObjectURL.js
new file mode 100644
index 00000000000000..3b70c69f66dea6
--- /dev/null
+++ b/benchmark/blob/resolveObjectURL.js
@@ -0,0 +1,22 @@
+'use strict';
+const common = require('../common.js');
+const { Blob, resolveObjectURL } = require('node:buffer');
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [50e3],
+});
+
+let _resolveObjectURL;
+
+function main({ n }) {
+  const blob = new Blob(['hello']);
+  const id = URL.createObjectURL(blob);
+  bench.start();
+  for (let i = 0; i < n; ++i)
+    _resolveObjectURL = resolveObjectURL(id);
+  bench.end(n);
+
+  // Avoid V8 deadcode (elimination)
+  assert.ok(_resolveObjectURL);
+}
diff --git a/benchmark/blob/slice.js b/benchmark/blob/slice.js
new file mode 100644
index 00000000000000..fcad0d68584353
--- /dev/null
+++ b/benchmark/blob/slice.js
@@ -0,0 +1,27 @@
+'use strict';
+const common = require('../common.js');
+const { Blob } = require('node:buffer');
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [50e3],
+  dataSize: [
+    5,
+    30 * 1024,
+  ],
+});
+
+let _sliceResult;
+
+function main({ n, dataSize }) {
+  const data = 'a'.repeat(dataSize);
+  const reusableBlob = new Blob([data]);
+
+  bench.start();
+  for (let i = 0; i < n; ++i)
+    _sliceResult = reusableBlob.slice(0, Math.floor(data.length / 2));
+  bench.end(n);
+
+  // Avoid V8 deadcode (elimination)
+  assert.ok(_sliceResult);
+}
diff --git a/benchmark/error/determine-specific-type.js b/benchmark/error/determine-specific-type.js
new file mode 100644
index 00000000000000..12acab267b725e
--- /dev/null
+++ b/benchmark/error/determine-specific-type.js
@@ -0,0 +1,58 @@
+'use strict';
+
+const common = require('../common');
+
+const bench = common.createBenchmark(main, {
+  n: [1e6],
+  v: [
+    '() => 1n',
+    '() => true',
+    '() => false',
+    '() => 2',
+    '() => +0',
+    '() => -0',
+    '() => NaN',
+    '() => Infinity',
+    '() => ""',
+    '() => "\'"',
+    '() => Symbol("foo")',
+    '() => function foo() {}',
+    '() => null',
+    '() => undefined',
+    '() => new Array()',
+    '() => new BigInt64Array()',
+    '() => new BigUint64Array()',
+    '() => new Int8Array()',
+    '() => new Int16Array()',
+    '() => new Int32Array()',
+    '() => new Float32Array()',
+    '() => new Float64Array()',
+    '() => new Uint8Array()',
+    '() => new Uint8ClampedArray()',
+    '() => new Uint16Array()',
+    '() => new Uint32Array()',
+    '() => new Date()',
+    '() => new Map()',
+    '() => new WeakMap()',
+    '() => new Object()',
+    '() => Promise.resolve("foo")',
+    '() => new Set()',
+    '() => new WeakSet()',
+    '() => ({ __proto__: null })',
+  ],
+}, {
+  flags: ['--expose-internals'],
+});
+
+function main({ n, v }) {
+  const {
+    determineSpecificType,
+  } = require('internal/errors');
+
+  const value = eval(v)();
+
+  bench.start();
+  for (let i = 0; i < n; ++i)
+    determineSpecificType(value);
+  bench.end(n);
+}
diff --git a/benchmark/error/format-list.js b/benchmark/error/format-list.js
new file mode 100644
index 00000000000000..f35ca3593a743c
--- /dev/null
+++ b/benchmark/error/format-list.js
@@ -0,0 +1,44 @@
+'use strict';
+
+const common = require('../common.js');
+
+const bench = common.createBenchmark(main, {
+  n: [1e7],
+  input: [
+    '',
+    'a',
+    'a,b',
+    'a,b,c',
+    'a,b,c,d',
+  ],
+  type: [
+    'undefined',
+    'and',
+    'or',
+  ],
+}, {
+  flags: ['--expose-internals'],
+});
+
+function main({ n, input, type }) {
+  const {
+    formatList,
+  } = require('internal/errors');
+
+  const list = input.split(',');
+
+  if (type === 'undefined') {
+    bench.start();
+    for (let i = 0; i < n; ++i) {
+      formatList(list);
+    }
+    bench.end(n);
+    return;
+  }
+
+  bench.start();
+  for (let i = 0; i < n; ++i) {
+    formatList(list, type);
+  }
+  bench.end(n);
+}
diff --git a/benchmark/misc/hidestackframes.js b/benchmark/error/hidestackframes.js
similarity index 100%
rename from benchmark/misc/hidestackframes.js
rename to benchmark/error/hidestackframes.js
diff --git a/benchmark/error/node-error-instantiation.js b/benchmark/error/node-error-instantiation.js
new file mode 100644
index 00000000000000..333087b9195894
--- /dev/null
+++ b/benchmark/error/node-error-instantiation.js
@@ -0,0 +1,66 @@
+'use strict';
+
+const common = require('../common');
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [1e6],
+  code: [
+    'built-in',
+    'ERR_HTTP2_STREAM_SELF_DEPENDENCY',
+    'ERR_INVALID_STATE',
+    'ERR_INVALID_URL',
+  ],
+  stackTraceLimit: [0, 10],
+}, {
+  flags: ['--expose-internals'],
+});
+
+function getErrorFactory(code) {
+  const {
+    ERR_HTTP2_STREAM_SELF_DEPENDENCY,
+    ERR_INVALID_STATE,
+    ERR_INVALID_URL,
+  } = require('internal/errors').codes;
+
+  switch (code) {
+    case 'built-in':
+      return (n) => new Error();
+    case 'ERR_HTTP2_STREAM_SELF_DEPENDENCY':
+      return (n) => new ERR_HTTP2_STREAM_SELF_DEPENDENCY();
+    case 'ERR_INVALID_STATE':
+      return (n) => new ERR_INVALID_STATE(n + '');
+    case 'ERR_INVALID_URL':
+      return (n) => new ERR_INVALID_URL({ input: n + '' });
+    default:
+      throw new Error(`${code} not supported`);
+  }
+}
+
+function main({ n, code, stackTraceLimit }) {
+  const getError = getErrorFactory(code);
+
+  Error.stackTraceLimit = stackTraceLimit;
+
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  for (let i = 0; i < length; ++i) {
+    array.push(getError(i));
+  }
+
+  bench.start();
+
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    array[index] = getError(index);
+  }
+
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], 'object');
+  }
+}
diff --git a/benchmark/error/node-error-stack.js b/benchmark/error/node-error-stack.js
new file mode 100644
index 00000000000000..06319ccd17105f
--- /dev/null
+++ b/benchmark/error/node-error-stack.js
@@ -0,0 +1,62 @@
+'use strict';
+
+const common = require('../common');
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [1e6],
+  code: [
+    'built-in',
+    'ERR_HTTP2_STREAM_SELF_DEPENDENCY',
+    'ERR_INVALID_STATE',
+  ],
+  stackTraceLimit: [0, 10],
+}, {
+  flags: ['--expose-internals'],
+});
+
+function getErrorStackFactory(code) {
+  const {
+    ERR_INVALID_STATE,
+    ERR_HTTP2_STREAM_SELF_DEPENDENCY,
+  } = require('internal/errors').codes;
+
+  switch (code) {
+    case 'built-in':
+      return (n) => new Error().stack;
+    case 'ERR_HTTP2_STREAM_SELF_DEPENDENCY':
+      return (n) => new ERR_HTTP2_STREAM_SELF_DEPENDENCY().stack;
+    case 'ERR_INVALID_STATE':
+      return (n) => new ERR_INVALID_STATE(n + '').stack;
+    default:
+      throw new Error(`${code} not supported`);
+  }
+}
+
+function main({ n, code, stackTraceLimit }) {
+  const getStack = getErrorStackFactory(code);
+
+  Error.stackTraceLimit = stackTraceLimit;
+
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  for (let i = 0; i < length; ++i) {
+    array.push(getStack(i));
+  }
+
+  bench.start();
+
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    array[index] = getStack(index);
+  }
+
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], 'string');
+  }
+}
diff --git a/benchmark/error/node-error.js b/benchmark/error/node-error.js
deleted file mode 100644
index 3a0aef91f04a06..00000000000000
--- a/benchmark/error/node-error.js
+++ /dev/null
@@ -1,21 +0,0 @@
-'use strict';
-
-const common = require('../common');
-
-const bench = common.createBenchmark(main, {
-  n: [1e7],
-}, {
-  flags: ['--expose-internals'],
-});
-
-function main({ n }) {
-  const {
-    codes: {
-      ERR_INVALID_STATE,
-    },
-  } = require('internal/errors');
-  bench.start();
-  for (let i = 0; i < n; ++i)
-    new ERR_INVALID_STATE.TypeError('test');
-  bench.end(n);
-}
diff --git a/benchmark/fs/bench-accessSync.js b/benchmark/fs/bench-accessSync.js
new file mode 100644
index 00000000000000..bf0718634b1d01
--- /dev/null
+++ b/benchmark/fs/bench-accessSync.js
@@ -0,0 +1,48 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const tmpfile = tmpdir.resolve(`.existing-file-${process.pid}`);
+fs.writeFileSync(tmpfile, 'this-is-for-a-benchmark', 'utf8');
+
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing', 'non-flat-existing'],
+  n: [1e5],
+});
+
+function runBench(n, path) {
+  for (let i = 0; i < n; i++) {
+    try {
+      fs.accessSync(path);
+    } catch {
+      // do nothing
+    }
+  }
+}
+
+function main({ n, type }) {
+  let path;
+
+  switch (type) {
+    case 'existing':
+      path = __filename;
+      break;
+    case 'non-flat-existing':
+      path = tmpfile;
+      break;
+    case 'non-existing':
+      path = tmpdir.resolve(`.non-existing-file-${process.pid}`);
+      break;
+    default:
+      new Error('Invalid type');
+  }
+  // warmup
+  runBench(n, path);
+
+  bench.start();
+  runBench(n, path);
+  bench.end(n);
+}
diff --git a/benchmark/fs/bench-chmodSync.js b/benchmark/fs/bench-chmodSync.js
new file mode 100644
index 00000000000000..87b45c06b507de
--- /dev/null
+++ b/benchmark/fs/bench-chmodSync.js
@@ -0,0 +1,41 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing'],
+  n: [1e3],
+});
+
+function main({ n, type }) {
+  switch (type) {
+    case 'existing': {
+      for (let i = 0; i < n; i++) {
+        fs.writeFileSync(tmpdir.resolve(`chmodsync-bench-file-${i}`), 'bench');
+      }
+
+      bench.start();
+      for (let i = 0; i < n; i++) {
+        fs.chmodSync(tmpdir.resolve(`chmodsync-bench-file-${i}`), 0o666);
+      }
+      bench.end(n);
+      break;
+    }
+    case 'non-existing':
+      bench.start();
+      for (let i = 0; i < n; i++) {
+        try {
+          fs.chmodSync(tmpdir.resolve(`chmod-non-existing-file-${i}`), 0o666);
+        } catch {
+          // do nothing
+        }
+      }
+      bench.end(n);
+      break;
+    default:
+      new Error('Invalid type');
+  }
+}
diff --git a/benchmark/fs/bench-copyFileSync.js b/benchmark/fs/bench-copyFileSync.js
new file mode 100644
index 00000000000000..af77fbaaaaa004
--- /dev/null
+++ b/benchmark/fs/bench-copyFileSync.js
@@ -0,0 +1,37 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const bench = common.createBenchmark(main, {
+  type: ['invalid', 'valid'],
+  n: [1e4],
+});
+
+function main({ n, type }) {
+  tmpdir.refresh();
+  const dest = tmpdir.resolve(`copy-file-bench-${process.pid}`);
+  let path;
+
+  switch (type) {
+    case 'invalid':
+      path = tmpdir.resolve(`.existing-file-${process.pid}`);
+      break;
+    case 'valid':
+      path = __filename;
+      break;
+    default:
+      throw new Error('Invalid type');
+  }
+  bench.start();
+  for (let i = 0; i < n; i++) {
+    try {
+      fs.copyFileSync(path, dest);
+    } catch {
+      // do nothing
+    }
+  }
+  bench.end(n);
+}
diff --git a/benchmark/fs/bench-existsSync.js b/benchmark/fs/bench-existsSync.js
new file mode 100644
index 00000000000000..f9da2765b130f7
--- /dev/null
+++ b/benchmark/fs/bench-existsSync.js
@@ -0,0 +1,38 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const tmpfile = tmpdir.resolve(`.existing-file-${process.pid}`);
+fs.writeFileSync(tmpfile, 'this-is-for-a-benchmark', 'utf8');
+
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing', 'non-flat-existing'],
+  n: [1e6],
+});
+
+function main({ n, type }) {
+  let path;
+
+  switch (type) {
+    case 'existing':
+      path = __filename;
+      break;
+    case 'non-flat-existing':
+      path = tmpfile;
+      break;
+    case 'non-existing':
+      path = tmpdir.resolve(`.non-existing-file-${process.pid}`);
+      break;
+    default:
+      new Error('Invalid type');
+  }
+
+  bench.start();
+  for (let i = 0; i < n; i++) {
+    fs.existsSync(path);
+  }
+  bench.end(n);
+}
diff --git a/benchmark/fs/bench-fchmodSync.js b/benchmark/fs/bench-fchmodSync.js
new file mode 100644
index 00000000000000..4ada8a6f5d8bf9
--- /dev/null
+++ b/benchmark/fs/bench-fchmodSync.js
@@ -0,0 +1,60 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing'],
+  n: [1e3],
+});
+
+function main({ n, type }) {
+  let files;
+
+  switch (type) {
+    case 'existing':
+      files = [];
+
+      // Populate tmpdir with mock files
+      for (let i = 0; i < n; i++) {
+        const path = tmpdir.resolve(`fchmodsync-bench-file-${i}`);
+        fs.writeFileSync(path, 'bench');
+        files.push(path);
+      }
+      break;
+    case 'non-existing':
+      files = new Array(n).fill(tmpdir.resolve(`.non-existing-file-${Date.now()}`));
+      break;
+    default:
+      new Error('Invalid type');
+  }
+
+  const fds = files.map((x) => {
+    // Try to open, if not return likely invalid fd (1 << 30)
+    try {
+      return fs.openSync(x, 'r');
+    } catch {
+      return 1 << 30;
+    }
+  });
+
+  bench.start();
+  for (let i = 0; i < n; i++) {
+    try {
+      fs.fchmodSync(fds[i], 0o666);
+    } catch {
+      // do nothing
+    }
+  }
+  bench.end(n);
+
+  for (const x of fds) {
+    try {
+      fs.closeSync(x);
+    } catch {
+      // do nothing
+    }
+  }
+}
diff --git a/benchmark/fs/bench-ftruncateSync.js b/benchmark/fs/bench-ftruncateSync.js
new file mode 100644
index 00000000000000..a02686ffd901b3
--- /dev/null
+++ b/benchmark/fs/bench-ftruncateSync.js
@@ -0,0 +1,40 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const path = tmpdir.resolve(`new-file-${process.pid}`);
+fs.appendFileSync(path, 'Some content.');
+
+const bench = common.createBenchmark(main, {
+  type: ['invalid', 'valid'],
+  n: [1e4],
+});
+
+function main({ n, type }) {
+  let fd;
+
+  switch (type) {
+    case 'invalid':
+      fd = 1 << 30;
+      break;
+    case 'valid':
+      fd = fs.openSync(path, 'r+');
+      break;
+    default:
+      throw new Error('Invalid type');
+  }
+
+  bench.start();
+  for (let i = 0; i < n; i++) {
+    try {
+      fs.ftruncateSync(fd, 4);
+    } catch {
+      // do nothing
+    }
+  }
+  bench.end(n);
+  if (type === 'valid') fs.closeSync(fd);
+}
diff --git a/benchmark/fs/bench-openSync.js b/benchmark/fs/bench-openSync.js
new file mode 100644
index 00000000000000..eaa56139dcbf3c
--- /dev/null
+++ b/benchmark/fs/bench-openSync.js
@@ -0,0 +1,37 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing'],
+  n: [1e5],
+});
+
+function main({ n, type }) {
+  let path;
+
+  switch (type) {
+    case 'existing':
+      path = __filename;
+      break;
+    case 'non-existing':
+      path = tmpdir.resolve(`.non-existing-file-${process.pid}`);
+      break;
+    default:
+      new Error('Invalid type');
+  }
+
+  bench.start();
+  for (let i = 0; i < n; i++) {
+    try {
+      const fd = fs.openSync(path, 'r', 0o666);
+      fs.closeSync(fd);
+    } catch {
+      // do nothing
+    }
+  }
+  bench.end(n);
+}
diff --git a/benchmark/fs/bench-opendirSync.js b/benchmark/fs/bench-opendirSync.js
new file mode 100644
index 00000000000000..206822db139ff7
--- /dev/null
+++ b/benchmark/fs/bench-opendirSync.js
@@ -0,0 +1,43 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const path = require('path');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const testFiles = fs.readdirSync('test', { withFileTypes: true })
+  .filter((f) => f.isDirectory())
+  .map((f) => path.join(f.path, f.name));
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing'],
+  n: [1e3],
+});
+
+function main({ n, type }) {
+  let files;
+
+  switch (type) {
+    case 'existing':
+      files = testFiles;
+      break;
+    case 'non-existing':
+      files = [tmpdir.resolve(`.non-existing-file-${Date.now()}`)];
+      break;
+    default:
+      new Error('Invalid type');
+  }
+
+  bench.start();
+  for (let i = 0; i < n; i++) {
+    for (let j = 0; j < files.length; j++) {
+      try {
+        const dir = fs.opendirSync(files[j]);
+        dir.closeSync();
+      } catch {
+        // do nothing
+      }
+    }
+  }
+  bench.end(n);
+}
diff --git a/benchmark/fs/bench-timesSync.js b/benchmark/fs/bench-timesSync.js
new file mode 100644
index 00000000000000..8ea879a63ef9b7
--- /dev/null
+++ b/benchmark/fs/bench-timesSync.js
@@ -0,0 +1,61 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing'],
+  func: [ 'utimes', 'futimes', 'lutimes' ],
+  n: [1e3],
+});
+
+function main({ n, type, func }) {
+  const useFds = func === 'futimes';
+  const fsFunc = fs[func + 'Sync'];
+
+  switch (type) {
+    case 'existing': {
+      const files = [];
+
+      // Populate tmpdir with mock files
+      for (let i = 0; i < n; i++) {
+        const path = tmpdir.resolve(`timessync-bench-file-${i}`);
+        fs.writeFileSync(path, 'bench');
+        files.push(useFds ? fs.openSync(path, 'r+') : path);
+      }
+
+      bench.start();
+      for (let i = 0; i < n; i++) {
+        fsFunc(files[i], i, i);
+      }
+      bench.end(n);
+
+      if (useFds) files.forEach((x) => {
+        try {
+          fs.closeSync(x);
+        } catch {
+          // do nothing
+        }
+      });
+
+      break;
+    }
+    case 'non-existing': {
+      bench.start();
+      for (let i = 0; i < n; i++) {
+        try {
+          fsFunc(useFds ? (1 << 30) : tmpdir.resolve(`.non-existing-file-${Date.now()}`), i, i);
+        } catch {
+          // do nothing
+        }
+      }
+      bench.end(n);
+
+      break;
+    }
+    default:
+      new Error('Invalid type');
+  }
+}
diff --git a/benchmark/fs/bench-unlinkSync.js b/benchmark/fs/bench-unlinkSync.js
new file mode 100644
index 00000000000000..8b992198c8d368
--- /dev/null
+++ b/benchmark/fs/bench-unlinkSync.js
@@ -0,0 +1,43 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing'],
+  n: [1e3],
+});
+
+function main({ n, type }) {
+  let files;
+
+  switch (type) {
+    case 'existing':
+      files = [];
+
+      // Populate tmpdir with mock files
+      for (let i = 0; i < n; i++) {
+        const path = tmpdir.resolve(`unlinksync-bench-file-${i}`);
+        fs.writeFileSync(path, 'bench');
+        files.push(path);
+      }
+      break;
+    case 'non-existing':
+      files = new Array(n).fill(tmpdir.resolve(`.non-existing-file-${Date.now()}`));
+      break;
+    default:
+      new Error('Invalid type');
+  }
+
+  bench.start();
+  for (let i = 0; i < n; i++) {
+    try {
+      fs.unlinkSync(files[i]);
+    } catch {
+      // do nothing
+    }
+  }
+  bench.end(n);
+}
diff --git a/benchmark/fs/bench-writevSync.js b/benchmark/fs/bench-writevSync.js
new file mode 100644
index 00000000000000..596359c6750011
--- /dev/null
+++ b/benchmark/fs/bench-writevSync.js
@@ -0,0 +1,55 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const assert = require('assert');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const path = tmpdir.resolve(`new-file-${process.pid}`);
+fs.writeFileSync(path, 'Some content.');
+
+const bench = common.createBenchmark(main, {
+  type: ['valid', 'invalid'],
+  n: [1e5],
+});
+
+const buffer = Buffer.from('Benchmark data.');
+
+function main({ n, type }) {
+  let fd;
+  let result;
+
+  switch (type) {
+    case 'valid':
+      fd = fs.openSync(path, 'r+');
+
+      bench.start();
+      for (let i = 0; i < n; i++) {
+        result = fs.writevSync(fd, [buffer]);
+      }
+
+      bench.end(n);
+      assert(result);
+      fs.closeSync(fd);
+      break;
+    case 'invalid': {
+      fd = 1 << 30;
+      let hasError = false;
+      bench.start();
+      for (let i = 0; i < n; i++) {
+        try {
+          result = fs.writevSync(fd, [buffer]);
+        } catch {
+          hasError = true;
+        }
+      }
+
+      bench.end(n);
+      assert(hasError);
+      break;
+    }
+    default:
+      throw new Error('Invalid type');
+  }
+}
diff --git a/benchmark/fs/bench_fdatasyncSync.js b/benchmark/fs/bench_fdatasyncSync.js
new file mode 100644
index 00000000000000..9aedb0a314fb24
--- /dev/null
+++ b/benchmark/fs/bench_fdatasyncSync.js
@@ -0,0 +1,42 @@
+'use strict';
+
+const common = require('../common');
+const fs = require('fs');
+const tmpdir = require('../../test/common/tmpdir');
+tmpdir.refresh();
+
+const tmpfile = tmpdir.resolve(`.existing-file-${process.pid}`);
+fs.writeFileSync(tmpfile, 'this-is-for-a-benchmark', 'utf8');
+
+const bench = common.createBenchmark(main, {
+  type: ['existing', 'non-existing'],
+  n: [1e4],
+});
+
+function main({ n, type }) {
+  let fd;
+
+  switch (type) {
+    case 'existing':
+      fd = fs.openSync(tmpfile, 'r', 0o666);
+      break;
+    case 'non-existing':
+      fd = 1 << 30;
+      break;
+    default:
+      new Error('Invalid type');
+  }
+
+  bench.start();
+  for (let i = 0; i < n; i++) {
+    try {
+      fs.fdatasyncSync(fd);
+    } catch {
+      // do nothing
+    }
+  }
+
+  bench.end(n);
+
+  if (type === 'existing') fs.closeSync(fd);
+}
diff --git a/benchmark/fs/readFileSync.js b/benchmark/fs/readFileSync.js
index b81bdce8f27f69..800ab31450f43a 100644
--- a/benchmark/fs/readFileSync.js
+++ b/benchmark/fs/readFileSync.js
@@ -6,12 +6,21 @@ const fs = require('fs');
 const bench = common.createBenchmark(main, {
   encoding: ['undefined', 'utf8'],
   path: ['existing', 'non-existing'],
-  n: [60e1],
+  hasFileDescriptor: ['true', 'false'],
+  n: [1e4],
 });
 
-function main({ n, encoding, path }) {
+function main({ n, encoding, path, hasFileDescriptor }) {
   const enc = encoding === 'undefined' ? undefined : encoding;
-  const file = path === 'existing' ? __filename : '/tmp/not-found';
+  let file;
+  let shouldClose = false;
+
+  if (hasFileDescriptor === 'true') {
+    shouldClose = path === 'existing';
+    file = path === 'existing' ? fs.openSync(__filename) : -1;
+  } else {
+    file = path === 'existing' ? __filename : '/tmp/not-found';
+  }
   bench.start();
   for (let i = 0; i < n; ++i) {
     try {
@@ -21,4 +30,7 @@ function main({ n, encoding, path }) {
     }
   }
   bench.end(n);
+  if (shouldClose) {
+    fs.closeSync(file);
+  }
 }
diff --git a/benchmark/fs/readfile-partitioned.js b/benchmark/fs/readfile-partitioned.js
index b0183709e9f1e9..5a2004873e9fa0 100644
--- a/benchmark/fs/readfile-partitioned.js
+++ b/benchmark/fs/readfile-partitioned.js
@@ -14,7 +14,6 @@ const filename = path.resolve(__dirname,
                               `.removeme-benchmark-garbage-${process.pid}`);
 const fs = require('fs');
 const zlib = require('zlib');
-const assert = require('assert');
 
 const bench = common.createBenchmark(main, {
   duration: [5],
@@ -35,20 +34,28 @@ function main({ len, duration, concurrent, encoding }) {
 
   const zipData = Buffer.alloc(1024, 'a');
 
+  let waitConcurrent = 0;
+
+  // Plus one because of zip
+  const targetConcurrency = concurrent + 1;
+  const startedAt = Date.now();
+  const endAt = startedAt + (duration * 1000);
+
   let reads = 0;
   let zips = 0;
-  let benchEnded = false;
+
   bench.start();
-  setTimeout(() => {
+
+  function stop() {
     const totalOps = reads + zips;
-    benchEnded = true;
     bench.end(totalOps);
+
     try {
       fs.unlinkSync(filename);
     } catch {
       // Continue regardless of error.
     }
-  }, duration * 1000);
+  }
 
   function read() {
     fs.readFile(filename, encoding, afterRead);
@@ -56,11 +63,6 @@ function main({ len, duration, concurrent, encoding }) {
 
   function afterRead(er, data) {
     if (er) {
-      if (er.code === 'ENOENT') {
-        // Only OK if unlinked by the timer from main.
-        assert.ok(benchEnded);
-        return;
-      }
       throw er;
     }
 
@@ -68,8 +70,13 @@ function main({ len, duration, concurrent, encoding }) {
       throw new Error('wrong number of bytes returned');
 
     reads++;
-    if (!benchEnded)
+    const benchEnded = Date.now() >= endAt;
+
+    if (benchEnded && (++waitConcurrent) === targetConcurrency) {
+      stop();
+    } else if (!benchEnded) {
       read();
+    }
   }
 
   function zip() {
@@ -81,12 +88,17 @@ function main({ len, duration, concurrent, encoding }) {
       throw er;
 
     zips++;
-    if (!benchEnded)
+    const benchEnded = Date.now() >= endAt;
+
+    if (benchEnded && (++waitConcurrent) === targetConcurrency) {
+      stop();
+    } else if (!benchEnded) {
       zip();
+    }
   }
 
   // Start reads
-  while (concurrent-- > 0) read();
+  for (let i = 0; i < concurrent; i++) read();
 
   // Start a competing zip
   zip();
diff --git a/benchmark/fs/readfile-permission-enabled.js b/benchmark/fs/readfile-permission-enabled.js
index 6f762a402dfb5f..46f20be6a0b06e 100644
--- a/benchmark/fs/readfile-permission-enabled.js
+++ b/benchmark/fs/readfile-permission-enabled.js
@@ -5,7 +5,6 @@
 
 const common = require('../common.js');
 const fs = require('fs');
-const assert = require('assert');
 
 const tmpdir = require('../../test/common/tmpdir');
 tmpdir.refresh();
@@ -36,18 +35,24 @@ function main({ len, duration, concurrent, encoding }) {
   data = null;
 
   let reads = 0;
-  let benchEnded = false;
+  let waitConcurrent = 0;
+
+  const startedAt = Date.now();
+  const endAt = startedAt + (duration * 1000);
+
   bench.start();
-  setTimeout(() => {
-    benchEnded = true;
+
+  function stop() {
     bench.end(reads);
+
     try {
       fs.unlinkSync(filename);
     } catch {
       // Continue regardless of error.
     }
+
     process.exit(0);
-  }, duration * 1000);
+  }
 
   function read() {
     fs.readFile(filename, encoding, afterRead);
@@ -55,11 +60,6 @@ function main({ len, duration, concurrent, encoding }) {
 
   function afterRead(er, data) {
     if (er) {
-      if (er.code === 'ENOENT') {
-        // Only OK if unlinked by the timer from main.
-        assert.ok(benchEnded);
-        return;
-      }
       throw er;
     }
 
@@ -67,9 +67,14 @@ function main({ len, duration, concurrent, encoding }) {
       throw new Error('wrong number of bytes returned');
 
     reads++;
-    if (!benchEnded)
+    const benchEnded = Date.now() >= endAt;
+
+    if (benchEnded && (++waitConcurrent) === concurrent) {
+      stop();
+    } else if (!benchEnded) {
       read();
+    }
   }
 
-  while (concurrent--) read();
+  for (let i = 0; i < concurrent; i++) read();
 }
diff --git a/benchmark/fs/readfile-promises.js b/benchmark/fs/readfile-promises.js
index b9fcab00333419..f1df92931b35a0 100644
--- a/benchmark/fs/readfile-promises.js
+++ b/benchmark/fs/readfile-promises.js
@@ -5,7 +5,6 @@
 
 const common = require('../common.js');
 const fs = require('fs');
-const assert = require('assert');
 
 const tmpdir = require('../../test/common/tmpdir');
 tmpdir.refresh();
@@ -35,19 +34,25 @@ function main({ len, duration, concurrent, encoding }) {
   fs.writeFileSync(filename, data);
   data = null;
 
-  let writes = 0;
-  let benchEnded = false;
+  let reads = 0;
+  let waitConcurrent = 0;
+
+  const startedAt = Date.now();
+  const endAt = startedAt + (duration * 1000);
+
   bench.start();
-  setTimeout(() => {
-    benchEnded = true;
-    bench.end(writes);
+
+  function stop() {
+    bench.end(reads);
+
     try {
       fs.unlinkSync(filename);
     } catch {
       // Continue regardless of error.
     }
+
     process.exit(0);
-  }, duration * 1000);
+  }
 
   function read() {
     fs.promises.readFile(filename, encoding)
@@ -57,21 +62,21 @@ function main({ len, duration, concurrent, encoding }) {
 
   function afterRead(er, data) {
     if (er) {
-      if (er.code === 'ENOENT') {
-        // Only OK if unlinked by the timer from main.
-        assert.ok(benchEnded);
-        return;
-      }
       throw er;
     }
 
     if (data.length !== len)
       throw new Error('wrong number of bytes returned');
 
-    writes++;
-    if (!benchEnded)
+    reads++;
+    const benchEnded = Date.now() >= endAt;
+
+    if (benchEnded && (++waitConcurrent) === concurrent) {
+      stop();
+    } else if (!benchEnded) {
       read();
+    }
   }
 
-  while (concurrent--) read();
+  for (let i = 0; i < concurrent; i++) read();
 }
diff --git a/benchmark/fs/readfile.js b/benchmark/fs/readfile.js
index 24c2c5401ecf9c..9f74508042205f 100644
--- a/benchmark/fs/readfile.js
+++ b/benchmark/fs/readfile.js
@@ -5,7 +5,6 @@
 
 const common = require('../common.js');
 const fs = require('fs');
-const assert = require('assert');
 
 const tmpdir = require('../../test/common/tmpdir');
 tmpdir.refresh();
@@ -29,30 +28,31 @@ function main({ len, duration, concurrent, encoding }) {
   data = null;
 
   let reads = 0;
-  let benchEnded = false;
+  let waitConcurrent = 0;
+
+  const startedAt = Date.now();
+  const endAt = startedAt + (duration * 1000);
+
   bench.start();
-  setTimeout(() => {
-    benchEnded = true;
+
+  function read() {
+    fs.readFile(filename, encoding, afterRead);
+  }
+
+  function stop() {
     bench.end(reads);
+
     try {
       fs.unlinkSync(filename);
     } catch {
       // Continue regardless of error.
     }
-    process.exit(0);
-  }, duration * 1000);
 
-  function read() {
-    fs.readFile(filename, encoding, afterRead);
+    process.exit(0);
   }
 
   function afterRead(er, data) {
     if (er) {
-      if (er.code === 'ENOENT') {
-        // Only OK if unlinked by the timer from main.
-        assert.ok(benchEnded);
-        return;
-      }
       throw er;
     }
 
@@ -60,9 +60,14 @@ function main({ len, duration, concurrent, encoding }) {
       throw new Error('wrong number of bytes returned');
 
     reads++;
-    if (!benchEnded)
+    const benchEnded = Date.now() >= endAt;
+
+    if (benchEnded && (++waitConcurrent) === concurrent) {
+      stop();
+    } else if (!benchEnded) {
       read();
+    }
   }
 
-  while (concurrent--) read();
+  for (let i = 0; i < concurrent; i++) read();
 }
diff --git a/benchmark/fs/writefile-promises.js b/benchmark/fs/writefile-promises.js
index 2f3fd352aa886e..41c029051bc04d 100644
--- a/benchmark/fs/writefile-promises.js
+++ b/benchmark/fs/writefile-promises.js
@@ -5,7 +5,6 @@
 
 const common = require('../common.js');
 const fs = require('fs');
-const assert = require('assert');
 const tmpdir = require('../../test/common/tmpdir');
 
 tmpdir.refresh();
@@ -38,11 +37,16 @@ function main({ encodingType, duration, concurrent, size }) {
   }
 
   let writes = 0;
-  let benchEnded = false;
+  let waitConcurrent = 0;
+
+  const startedAt = Date.now();
+  const endAt = startedAt + (duration * 1000);
+
   bench.start();
-  setTimeout(() => {
-    benchEnded = true;
+
+  function stop() {
     bench.end(writes);
+
     for (let i = 0; i < filesWritten; i++) {
       try {
         fs.unlinkSync(`${filename}-${i}`);
@@ -50,8 +54,9 @@ function main({ encodingType, duration, concurrent, size }) {
         // Continue regardless of error.
       }
     }
+
     process.exit(0);
-  }, duration * 1000);
+  }
 
   function write() {
     fs.promises.writeFile(`${filename}-${filesWritten++}`, chunk, encoding)
@@ -61,18 +66,18 @@ function main({ encodingType, duration, concurrent, size }) {
 
   function afterWrite(er) {
     if (er) {
-      if (er.code === 'ENOENT') {
-        // Only OK if unlinked by the timer from main.
-        assert.ok(benchEnded);
-        return;
-      }
       throw er;
     }
 
     writes++;
-    if (!benchEnded)
+    const benchEnded = Date.now() >= endAt;
+
+    if (benchEnded && (++waitConcurrent) === concurrent) {
+      stop();
+    } else if (!benchEnded) {
       write();
+    }
   }
 
-  while (concurrent--) write();
+  for (let i = 0; i < concurrent; i++) write();
 }
diff --git a/benchmark/mime/mimetype-instantiation.js b/benchmark/mime/mimetype-instantiation.js
new file mode 100644
index 00000000000000..ec0f68e819a753
--- /dev/null
+++ b/benchmark/mime/mimetype-instantiation.js
@@ -0,0 +1,53 @@
+'use strict';
+
+const common = require('../common');
+const assert = require('assert');
+const { MIMEType } = require('util');
+
+const bench = common.createBenchmark(main, {
+  n: [1e5],
+  value: [
+    'application/ecmascript; ',
+    'text/html;charset=gbk',
+    `text/html;${'0123456789'.repeat(12)}=x;charset=gbk`,
+    'text/html;test=\u00FF;charset=gbk',
+    'x/x;\n\r\t x=x\n\r\t ;x=y',
+  ],
+}, {
+});
+
+function main({ n, value }) {
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  let errCase = false;
+
+  for (let i = 0; i < length; ++i) {
+    try {
+      array.push(new MIMEType(value));
+    } catch (e) {
+      errCase = true;
+      array.push(e);
+    }
+  }
+
+  // console.log(`errCase: ${errCase}`);
+  bench.start();
+
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    try {
+      array[index] = new MIMEType(value);
+    } catch (e) {
+      array[index] = e;
+    }
+  }
+
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], errCase ? 'object' : 'object');
+  }
+}
diff --git a/benchmark/mime/mimetype-to-string.js b/benchmark/mime/mimetype-to-string.js
new file mode 100644
index 00000000000000..e5cb8d6fae2e60
--- /dev/null
+++ b/benchmark/mime/mimetype-to-string.js
@@ -0,0 +1,55 @@
+'use strict';
+
+const common = require('../common');
+const assert = require('assert');
+const { MIMEType } = require('util');
+
+const bench = common.createBenchmark(main, {
+  n: [1e5],
+  value: [
+    'application/ecmascript; ',
+    'text/html;charset=gbk',
+    `text/html;${'0123456789'.repeat(12)}=x;charset=gbk`,
+    'text/html;test=\u00FF;charset=gbk',
+    'x/x;\n\r\t x=x\n\r\t ;x=y',
+  ],
+}, {
+});
+
+function main({ n, value }) {
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  let errCase = false;
+
+  const mime = new MIMEType(value);
+
+  for (let i = 0; i < length; ++i) {
+    try {
+      array.push(mime.toString());
+    } catch (e) {
+      errCase = true;
+      array.push(e);
+    }
+  }
+
+  // console.log(`errCase: ${errCase}`);
+  bench.start();
+
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    try {
+      array[index] = mime.toString();
+    } catch (e) {
+      array[index] = e;
+    }
+  }
+
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], errCase ? 'object' : 'string');
+  }
+}
diff --git a/benchmark/mime/parse-type-and-subtype.js b/benchmark/mime/parse-type-and-subtype.js
new file mode 100644
index 00000000000000..4b91dc1db6ab24
--- /dev/null
+++ b/benchmark/mime/parse-type-and-subtype.js
@@ -0,0 +1,53 @@
+'use strict';
+
+const common = require('../common');
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [1e7],
+  value: [
+    'application/ecmascript; ',
+    'text/html;charset=gbk',
+    // eslint-disable-next-line max-len
+    'text/html;0123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789012345678901234567890123456789=x;charset=gbk',
+  ],
+}, {
+  flags: ['--expose-internals'],
+});
+
+function main({ n, value }) {
+
+  const parseTypeAndSubtype = require('internal/mime').parseTypeAndSubtype;
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  let errCase = false;
+
+  for (let i = 0; i < length; ++i) {
+    try {
+      array.push(parseTypeAndSubtype(value));
+    } catch (e) {
+      errCase = true;
+      array.push(e);
+    }
+  }
+
+  // console.log(`errCase: ${errCase}`);
+  bench.start();
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    try {
+      array[index] = parseTypeAndSubtype(value);
+    } catch (e) {
+      array[index] = e;
+    }
+  }
+
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], errCase ? 'object' : 'object');
+  }
+}
diff --git a/benchmark/mime/to-ascii-lower.js b/benchmark/mime/to-ascii-lower.js
new file mode 100644
index 00000000000000..93a4a14dc6d96b
--- /dev/null
+++ b/benchmark/mime/to-ascii-lower.js
@@ -0,0 +1,54 @@
+'use strict';
+
+const common = require('../common');
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [1e7],
+  value: [
+    'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
+    'UPPERCASE',
+    'lowercase',
+    'mixedCase',
+  ],
+}, {
+  flags: ['--expose-internals'],
+});
+
+function main({ n, value }) {
+
+  const toASCIILower = require('internal/mime').toASCIILower;
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  let errCase = false;
+
+  for (let i = 0; i < length; ++i) {
+    try {
+      array.push(toASCIILower(value));
+    } catch (e) {
+      errCase = true;
+      array.push(e);
+    }
+  }
+
+  // console.log(`errCase: ${errCase}`);
+  bench.start();
+
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    try {
+      array[index] = toASCIILower(value);
+    } catch (e) {
+      array[index] = e;
+    }
+  }
+
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], errCase ? 'object' : 'string');
+  }
+}
diff --git a/benchmark/os/homedir.js b/benchmark/os/homedir.js
new file mode 100644
index 00000000000000..d48f99dba18a2b
--- /dev/null
+++ b/benchmark/os/homedir.js
@@ -0,0 +1,31 @@
+'use strict';
+
+const common = require('../common.js');
+const homedir = require('os').homedir;
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [1e6],
+});
+
+function main({ n }) {
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  for (let i = 0; i < length; ++i) {
+    array.push(homedir());
+  }
+
+  bench.start();
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    array[index] = homedir();
+  }
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], 'string');
+  }
+}
diff --git a/benchmark/os/hostname.js b/benchmark/os/hostname.js
new file mode 100644
index 00000000000000..9436f23af98c7a
--- /dev/null
+++ b/benchmark/os/hostname.js
@@ -0,0 +1,31 @@
+'use strict';
+
+const common = require('../common.js');
+const hostname = require('os').hostname;
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [1e6],
+});
+
+function main({ n }) {
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  for (let i = 0; i < length; ++i) {
+    array.push(hostname());
+  }
+
+  bench.start();
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    array[index] = hostname();
+  }
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], 'string');
+  }
+}
diff --git a/benchmark/os/uptime.js b/benchmark/os/uptime.js
new file mode 100644
index 00000000000000..2f25dfe670b722
--- /dev/null
+++ b/benchmark/os/uptime.js
@@ -0,0 +1,31 @@
+'use strict';
+
+const common = require('../common.js');
+const uptime = require('os').uptime;
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [1e5],
+});
+
+function main({ n }) {
+  // Warm up.
+  const length = 1024;
+  const array = [];
+  for (let i = 0; i < length; ++i) {
+    array.push(uptime());
+  }
+
+  bench.start();
+  for (let i = 0; i < n; ++i) {
+    const index = i % length;
+    array[index] = uptime();
+  }
+  bench.end(n);
+
+  // Verify the entries to prevent dead code elimination from making
+  // the benchmark invalid.
+  for (let i = 0; i < length; ++i) {
+    assert.strictEqual(typeof array[i], 'number');
+  }
+}
diff --git a/benchmark/perf_hooks/performance-observer.js b/benchmark/perf_hooks/performance-observer.js
new file mode 100644
index 00000000000000..42a94932860c38
--- /dev/null
+++ b/benchmark/perf_hooks/performance-observer.js
@@ -0,0 +1,49 @@
+'use strict';
+
+const assert = require('assert');
+const common = require('../common.js');
+
+const {
+  PerformanceObserver,
+  performance,
+} = require('perf_hooks');
+
+function randomFn() {
+  return Math.random();
+}
+
+const bench = common.createBenchmark(main, {
+  n: [1e5],
+  pending: [1, 10],
+}, {
+  options: ['--expose-internals'],
+});
+
+let _result;
+
+function fillQueue(timerfied, pending) {
+  for (let i = 0; i < pending; i++) {
+    _result = timerfied();
+  }
+  // Avoid V8 deadcode (elimination)
+  assert.ok(_result);
+}
+
+function main({ n, pending }) {
+  const timerfied = performance.timerify(randomFn);
+
+  let count = 0;
+  const obs = new PerformanceObserver((entries) => {
+    count += entries.getEntries().length;
+
+    if (count >= n) {
+      bench.end(count);
+    } else {
+      fillQueue(timerfied, pending);
+    }
+  });
+  obs.observe({ entryTypes: ['function'], buffered: true });
+
+  bench.start();
+  fillQueue(timerfied, pending);
+}
diff --git a/benchmark/perf_hooks/resourcetiming.js b/benchmark/perf_hooks/resourcetiming.js
index ddc40767b16196..51c4778d20065f 100644
--- a/benchmark/perf_hooks/resourcetiming.js
+++ b/benchmark/perf_hooks/resourcetiming.js
@@ -72,6 +72,6 @@ function main({ n, observe }) {
   obs.observe({ entryTypes: [observe], buffered: true });
 
   bench.start();
-  for (let i = 0; i < 1e5; i++)
+  for (let i = 0; i < n; i++)
     test();
 }
diff --git a/benchmark/perf_hooks/timerfied.js b/benchmark/perf_hooks/timerfied.js
new file mode 100644
index 00000000000000..50be0a47fc1b5a
--- /dev/null
+++ b/benchmark/perf_hooks/timerfied.js
@@ -0,0 +1,36 @@
+'use strict';
+
+const assert = require('assert');
+const common = require('../common.js');
+
+const {
+  PerformanceObserver,
+  performance,
+} = require('perf_hooks');
+
+function randomFn() {
+  return Math.random();
+}
+
+const bench = common.createBenchmark(main, {
+  n: [1e5],
+  observe: ['function'],
+});
+
+let _result;
+
+function main({ n, observe }) {
+  const obs = new PerformanceObserver(() => {
+    bench.end(n);
+  });
+  obs.observe({ entryTypes: [observe], buffered: true });
+
+  const timerfied = performance.timerify(randomFn);
+
+  bench.start();
+  for (let i = 0; i < n; i++)
+    _result = timerfied();
+
+  // Avoid V8 deadcode (elimination)
+  assert.ok(_result);
+}
diff --git a/benchmark/readline/readline-iterable.js b/benchmark/readline/readline-iterable.js
index e92e5d005ea1d0..9be4ea1f52b49c 100644
--- a/benchmark/readline/readline-iterable.js
+++ b/benchmark/readline/readline-iterable.js
@@ -5,6 +5,7 @@ const { Readable } = require('stream');
 
 const bench = common.createBenchmark(main, {
   n: [1e1, 1e2, 1e3, 1e4, 1e5, 1e6],
+  type: ['old', 'new'],
 });
 
 const loremIpsum = `Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed
@@ -21,6 +22,37 @@ Condimentum mattis pellentesque id nibh tortor id aliquet lectus proin.
 Diam in arcu cursus euismod quis viverra nibh.
 Rest of line`;
 
+function oldWay() {
+  const readable = new Readable({
+    objectMode: true,
+    read: () => {
+      this.resume();
+    },
+    destroy: (err, cb) => {
+      this.off('line', lineListener);
+      this.off('close', closeListener);
+      this.close();
+      cb(err);
+    },
+  });
+  const lineListener = (input) => {
+    if (!readable.push(input)) {
+      // TODO(rexagod): drain to resume flow
+      this.pause();
+    }
+  };
+  const closeListener = () => {
+    readable.push(null);
+  };
+  const errorListener = (err) => {
+    readable.destroy(err);
+  };
+  this.on('error', errorListener);
+  this.on('line', lineListener);
+  this.on('close', closeListener);
+  return readable[Symbol.asyncIterator]();
+}
+
 function getLoremIpsumStream(repetitions) {
   const readable = Readable({
     objectMode: true,
@@ -32,7 +64,7 @@ function getLoremIpsumStream(repetitions) {
   return readable;
 }
 
-async function main({ n }) {
+async function main({ n, type }) {
   bench.start();
   let lineCount = 0;
 
@@ -40,8 +72,10 @@ async function main({ n }) {
     input: getLoremIpsumStream(n),
   });
 
+  const readlineIterable = type === 'old' ? oldWay.call(iterable) : iterable;
+
   // eslint-disable-next-line no-unused-vars
-  for await (const _ of iterable) {
+  for await (const _ of readlineIterable) {
     lineCount++;
   }
   bench.end(lineCount);
diff --git a/benchmark/streams/writable-manywrites.js b/benchmark/streams/writable-manywrites.js
index e6ab65162c366c..d244c7d606479e 100644
--- a/benchmark/streams/writable-manywrites.js
+++ b/benchmark/streams/writable-manywrites.js
@@ -4,7 +4,7 @@ const common = require('../common');
 const Writable = require('stream').Writable;
 
 const bench = common.createBenchmark(main, {
-  n: [2e6],
+  n: [1e5],
   sync: ['yes', 'no'],
   writev: ['yes', 'no'],
   callback: ['yes', 'no'],
@@ -13,7 +13,7 @@ const bench = common.createBenchmark(main, {
 
 function main({ n, sync, writev, callback, len }) {
   const b = Buffer.allocUnsafe(len);
-  const s = new Writable();
+  const s = new Writable({ highWaterMark: 16 * 1024 });
   sync = sync === 'yes';
 
   const writecb = (cb) => {
diff --git a/benchmark/url/whatwg-url-validity.js b/benchmark/url/whatwg-url-validity.js
new file mode 100644
index 00000000000000..6ba22336408fa1
--- /dev/null
+++ b/benchmark/url/whatwg-url-validity.js
@@ -0,0 +1,23 @@
+'use strict';
+const common = require('../common.js');
+const url = require('url');
+const URL = url.URL;
+
+const bench = common.createBenchmark(main, {
+  type: ['valid', 'invalid'],
+  e: [1e5],
+});
+
+// This benchmark is used to compare the `Invalid URL` path of the URL parser
+function main({ type, e }) {
+  const url = type === 'valid' ? 'https://www.nodejs.org' : 'www.nodejs.org';
+  bench.start();
+  for (let i = 0; i < e; i++) {
+    try {
+      new URL(url);
+    } catch {
+      // do nothing
+    }
+  }
+  bench.end(e);
+}
diff --git a/benchmark/validators/validate-object.js b/benchmark/validators/validate-object.js
new file mode 100644
index 00000000000000..50e722c52426a4
--- /dev/null
+++ b/benchmark/validators/validate-object.js
@@ -0,0 +1,75 @@
+'use strict';
+
+const common = require('../common');
+const assert = require('assert');
+
+const bench = common.createBenchmark(main, {
+  n: [1e5],
+  objectToTest: [
+    'object',
+    'null',
+    'array',
+    'function',
+  ],
+}, {
+  flags: ['--expose-internals'],
+});
+
+function getObjectToTest(objectToTest) {
+  switch (objectToTest) {
+    case 'object':
+      return { foo: 'bar' };
+    case 'null':
+      return null;
+    case 'array':
+      return ['foo', 'bar'];
+    case 'function':
+      return () => 'foo';
+    default:
+      throw new Error(`Value ${objectToTest} is not a valid objectToTest.`);
+  }
+}
+
+function getOptions(objectToTest) {
+  const {
+    kValidateObjectAllowNullable,
+    kValidateObjectAllowArray,
+    kValidateObjectAllowFunction,
+  } = require('internal/validators');
+
+  switch (objectToTest) {
+    case 'object':
+      return 0;
+    case 'null':
+      return kValidateObjectAllowNullable;
+    case 'array':
+      return kValidateObjectAllowArray;
+    case 'function':
+      return kValidateObjectAllowFunction;
+    default:
+      throw new Error(`Value ${objectToTest} is not a valid objectToTest.`);
+  }
+}
+
+let _validateResult;
+
+function main({ n, objectToTest }) {
+  const {
+    validateObject,
+  } = require('internal/validators');
+
+  const value = getObjectToTest(objectToTest);
+  const options = getOptions(objectToTest);
+
+  bench.start();
+  for (let i = 0; i < n; ++i) {
+    try {
+      _validateResult = validateObject(value, 'Object', options);
+    } catch {
+      _validateResult = undefined;
+    }
+  }
+  bench.end(n);
+
+  assert.ok(!_validateResult);
+}
diff --git a/benchmark/vm/compile-script-in-isolate-cache.js b/benchmark/vm/compile-script-in-isolate-cache.js
new file mode 100644
index 00000000000000..7eceb0eba0d215
--- /dev/null
+++ b/benchmark/vm/compile-script-in-isolate-cache.js
@@ -0,0 +1,35 @@
+'use strict';
+
+// This benchmarks compiling scripts that hit the in-isolate compilation
+// cache (by having the same source).
+const common = require('../common.js');
+const fs = require('fs');
+const vm = require('vm');
+const fixtures = require('../../test/common/fixtures.js');
+const scriptPath = fixtures.path('snapshot', 'typescript.js');
+
+const bench = common.createBenchmark(main, {
+  type: ['with-dynamic-import-callback', 'without-dynamic-import-callback'],
+  n: [100],
+});
+
+const scriptSource = fs.readFileSync(scriptPath, 'utf8');
+
+function main({ n, type }) {
+  let script;
+  bench.start();
+  const options = {};
+  switch (type) {
+    case 'with-dynamic-import-callback':
+      // Use a dummy callback for now until we really need to benchmark it.
+      options.importModuleDynamically = async () => {};
+      break;
+    case 'without-dynamic-import-callback':
+      break;
+  }
+  for (let i = 0; i < n; i++) {
+    script = new vm.Script(scriptSource, options);
+  }
+  bench.end(n);
+  script.runInThisContext();
+}
diff --git a/benchmark/webstreams/js_transfer.js b/benchmark/webstreams/js_transfer.js
new file mode 100644
index 00000000000000..fc35175ed50d08
--- /dev/null
+++ b/benchmark/webstreams/js_transfer.js
@@ -0,0 +1,52 @@
+'use strict';
+
+const common = require('../common.js');
+
+const { MessageChannel } = require('worker_threads');
+const { WritableStream, TransformStream, ReadableStream } = require('stream/web');
+
+const bench = common.createBenchmark(main, {
+  payload: ['WritableStream', 'ReadableStream', 'TransformStream'],
+  n: [1e4],
+});
+
+function main({ n, payload: payloadType }) {
+  let createPayload;
+  let messages = 0;
+
+  switch (payloadType) {
+    case 'WritableStream':
+      createPayload = () => new WritableStream();
+      break;
+    case 'ReadableStream':
+      createPayload = () => new ReadableStream();
+      break;
+    case 'TransformStream':
+      createPayload = () => new TransformStream();
+      break;
+    default:
+      throw new Error('Unsupported payload type');
+  }
+
+  const { port1, port2 } = new MessageChannel();
+
+  port2.onmessage = onMessage;
+
+  function onMessage() {
+    if (messages++ === n) {
+      bench.end(n);
+      port1.close();
+    } else {
+      send();
+    }
+  }
+
+  function send() {
+    const stream = createPayload();
+
+    port1.postMessage(stream, [stream]);
+  }
+
+  bench.start();
+  send();
+}
diff --git a/benchmark/webstreams/readable-read.js b/benchmark/webstreams/readable-read.js
new file mode 100644
index 00000000000000..d3d28dd7f50301
--- /dev/null
+++ b/benchmark/webstreams/readable-read.js
@@ -0,0 +1,49 @@
+'use strict';
+const common = require('../common.js');
+const { ReadableStream } = require('node:stream/web');
+
+const bench = common.createBenchmark(main, {
+  n: [1e5],
+  type: ['normal', 'byob'],
+});
+
+async function main({ n, type }) {
+  switch (type) {
+    case 'normal': {
+      const rs = new ReadableStream({
+        pull: function(controller) {
+          controller.enqueue('a');
+        },
+      });
+      const reader = rs.getReader();
+      let x = null;
+      bench.start();
+      for (let i = 0; i < n; i++) {
+        const { value } = await reader.read();
+        x = value;
+      }
+      bench.end(n);
+      console.assert(x);
+      break;
+    }
+    case 'byob': {
+      const encode = new TextEncoder();
+      const rs = new ReadableStream({
+        type: 'bytes',
+        pull: function(controller) {
+          controller.enqueue(encode.encode('a'));
+        },
+      });
+      const reader = rs.getReader({ mode: 'byob' });
+      let x = null;
+      bench.start();
+      for (let i = 0; i < n; i++) {
+        const { value } = await reader.read(new Uint8Array(1));
+        x = value;
+      }
+      bench.end(n);
+      console.assert(x);
+      break;
+    }
+  }
+}
diff --git a/benchmark/worker/atomics-wait.js b/benchmark/worker/atomics-wait.js
index 2e6e01f881c66a..53d71ff9224a11 100644
--- a/benchmark/worker/atomics-wait.js
+++ b/benchmark/worker/atomics-wait.js
@@ -4,10 +4,6 @@ if (typeof SharedArrayBuffer === 'undefined') {
   throw new Error('SharedArrayBuffers must be enabled to run this benchmark');
 }
 
-if (typeof Atomics === 'undefined') {
-  throw new Error('Atomics must be enabled to run this benchmark');
-}
-
 const common = require('../common.js');
 const bench = common.createBenchmark(main, {
   n: [1e7],
diff --git a/common.gypi b/common.gypi
index 132656cf6b7a6b..4c62386f4e8fce 100644
--- a/common.gypi
+++ b/common.gypi
@@ -36,7 +36,7 @@
 
     # Reset this number to 0 on major V8 upgrades.
     # Increment by one for each non-official patch applied to deps/v8.
-    'v8_embedder_string': '-node.17',
+    'v8_embedder_string': '-node.13',
 
     ##### V8 defaults for Node.js #####
 
@@ -230,7 +230,7 @@
             ],
           },],
           ['OS == "android"', {
-            'cflags': [ '-fPIC' ],
+            'cflags': [ '-fPIC', '-I<(android_ndk_path)/sources/android/cpufeatures' ],
             'ldflags': [ '-fPIC' ]
           }],
         ],
diff --git a/configure.py b/configure.py
index 62f041ce52bf85..8be9e9ca5c4af8 100755
--- a/configure.py
+++ b/configure.py
@@ -1498,6 +1498,7 @@ def configure_v8(o):
   o['variables']['v8_enable_pointer_compression'] = 1 if options.enable_pointer_compression else 0
   o['variables']['v8_enable_31bit_smis_on_64bit_arch'] = 1 if options.enable_pointer_compression else 0
   o['variables']['v8_enable_shared_ro_heap'] = 0 if options.enable_pointer_compression or options.disable_shared_ro_heap else 1
+  o['variables']['v8_enable_extensible_ro_snapshot'] = 0
   o['variables']['v8_trace_maps'] = 1 if options.trace_maps else 0
   o['variables']['node_use_v8_platform'] = b(not options.without_v8_platform)
   o['variables']['node_use_bundled_v8'] = b(not options.without_bundled_v8)
diff --git a/deps/ada/ada.cpp b/deps/ada/ada.cpp
index ce4e6302acbe87..1175b114d8addd 100644
--- a/deps/ada/ada.cpp
+++ b/deps/ada/ada.cpp
@@ -1,4 +1,4 @@
-/* auto-generated on 2023-07-23 15:03:22 -0400. Do not edit! */
+/* auto-generated on 2023-09-30 20:34:30 -0400. Do not edit! */
 /* begin file src/ada.cpp */
 #include "ada.h"
 /* begin file src/checkers.cpp */
@@ -116,10 +116,11 @@ ada_really_inline constexpr bool verify_dns_length(
 
 ADA_PUSH_DISABLE_ALL_WARNINGS
 /* begin file src/ada_idna.cpp */
-/* auto-generated on 2023-05-07 19:12:14 -0400. Do not edit! */
+/* auto-generated on 2023-09-19 15:58:51 -0400. Do not edit! */
 /* begin file src/idna.cpp */
 /* begin file src/unicode_transcoding.cpp */
 
+#include <algorithm>
 #include <cstdint>
 #include <cstring>
 
@@ -226,38 +227,22 @@ size_t utf8_length_from_utf32(const char32_t* buf, size_t len) {
   // We are not BOM aware.
   const uint32_t* p = reinterpret_cast<const uint32_t*>(buf);
   size_t counter{0};
-  for (size_t i = 0; i < len; i++) {
-    /** ASCII **/
-    if (p[i] <= 0x7F) {
-      counter++;
-    }
-    /** two-byte **/
-    else if (p[i] <= 0x7FF) {
-      counter += 2;
-    }
-    /** three-byte **/
-    else if (p[i] <= 0xFFFF) {
-      counter += 3;
-    }
-    /** four-bytes **/
-    else {
-      counter += 4;
-    }
+  for (size_t i = 0; i != len; ++i) {
+    ++counter;                                      // ASCII
+    counter += static_cast<size_t>(p[i] > 0x7F);    // two-byte
+    counter += static_cast<size_t>(p[i] > 0x7FF);   // three-byte
+    counter += static_cast<size_t>(p[i] > 0xFFFF);  // four-bytes
   }
   return counter;
 }
 
 size_t utf32_length_from_utf8(const char* buf, size_t len) {
   const int8_t* p = reinterpret_cast<const int8_t*>(buf);
-  size_t counter{0};
-  for (size_t i = 0; i < len; i++) {
+  return std::count_if(p, std::next(p, len), [](int8_t c) {
     // -65 is 0b10111111, anything larger in two-complement's
     // should start a new code point.
-    if (p[i] > -65) {
-      counter++;
-    }
-  }
-  return counter;
+    return c > -65;
+  });
 }
 
 size_t utf32_to_utf8(const char32_t* buf, size_t len, char* utf8_output) {
@@ -9520,19 +9505,20 @@ bool is_label_valid(const std::u32string_view label) {
 
 namespace ada::idna {
 
-bool constexpr begins_with(std::u32string_view view,
-                           std::u32string_view prefix) {
+bool begins_with(std::u32string_view view, std::u32string_view prefix) {
   if (view.size() < prefix.size()) {
     return false;
   }
-  return view.substr(0, prefix.size()) == prefix;
+  // constexpr as of C++20
+  return std::equal(prefix.begin(), prefix.end(), view.begin());
 }
 
-bool constexpr begins_with(std::string_view view, std::string_view prefix) {
+bool begins_with(std::string_view view, std::string_view prefix) {
   if (view.size() < prefix.size()) {
     return false;
   }
-  return view.substr(0, prefix.size()) == prefix;
+  // constexpr as of C++20
+  return std::equal(prefix.begin(), prefix.end(), view.begin());
 }
 
 bool constexpr is_ascii(std::u32string_view view) {
@@ -9824,6 +9810,17 @@ constexpr bool to_lower_ascii(char* input, size_t length) noexcept {
 #if ADA_NEON
 ada_really_inline bool has_tabs_or_newline(
     std::string_view user_input) noexcept {
+  // first check for short strings in which case we do it naively.
+  if (user_input.size() < 16) {  // slow path
+    for (size_t i = 0; i < user_input.size(); i++) {
+      if (user_input[i] == '\r' || user_input[i] == '\n' ||
+          user_input[i] == '\t') {
+        return true;
+      }
+    }
+    return false;
+  }
+  // fast path for long strings (expected to be common)
   size_t i = 0;
   const uint8x16_t mask1 = vmovq_n_u8('\r');
   const uint8x16_t mask2 = vmovq_n_u8('\n');
@@ -9836,9 +9833,8 @@ ada_really_inline bool has_tabs_or_newline(
                        vceqq_u8(word, mask3));
   }
   if (i < user_input.size()) {
-    uint8_t buffer[16]{};
-    memcpy(buffer, user_input.data() + i, user_input.size() - i);
-    uint8x16_t word = vld1q_u8((const uint8_t*)user_input.data() + i);
+    uint8x16_t word =
+        vld1q_u8((const uint8_t*)user_input.data() + user_input.length() - 16);
     running = vorrq_u8(vorrq_u8(running, vorrq_u8(vceqq_u8(word, mask1),
                                                   vceqq_u8(word, mask2))),
                        vceqq_u8(word, mask3));
@@ -9848,6 +9844,17 @@ ada_really_inline bool has_tabs_or_newline(
 #elif ADA_SSE2
 ada_really_inline bool has_tabs_or_newline(
     std::string_view user_input) noexcept {
+  // first check for short strings in which case we do it naively.
+  if (user_input.size() < 16) {  // slow path
+    for (size_t i = 0; i < user_input.size(); i++) {
+      if (user_input[i] == '\r' || user_input[i] == '\n' ||
+          user_input[i] == '\t') {
+        return true;
+      }
+    }
+    return false;
+  }
+  // fast path for long strings (expected to be common)
   size_t i = 0;
   const __m128i mask1 = _mm_set1_epi8('\r');
   const __m128i mask2 = _mm_set1_epi8('\n');
@@ -9861,9 +9868,8 @@ ada_really_inline bool has_tabs_or_newline(
         _mm_cmpeq_epi8(word, mask3));
   }
   if (i < user_input.size()) {
-    alignas(16) uint8_t buffer[16]{};
-    memcpy(buffer, user_input.data() + i, user_input.size() - i);
-    __m128i word = _mm_load_si128((const __m128i*)buffer);
+    __m128i word = _mm_loadu_si128(
+        (const __m128i*)(user_input.data() + user_input.length() - 16));
     running = _mm_or_si128(
         _mm_or_si128(running, _mm_or_si128(_mm_cmpeq_epi8(word, mask1),
                                            _mm_cmpeq_epi8(word, mask2))),
@@ -10144,13 +10150,12 @@ ada_really_inline constexpr bool is_lowercase_hex(const char c) noexcept {
   return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'f');
 }
 
+constexpr static char hex_to_binary_table[] = {
+    0,  1,  2,  3,  4, 5, 6, 7, 8, 9, 0, 0,  0,  0,  0,  0,  0, 10, 11,
+    12, 13, 14, 15, 0, 0, 0, 0, 0, 0, 0, 0,  0,  0,  0,  0,  0, 0,  0,
+    0,  0,  0,  0,  0, 0, 0, 0, 0, 0, 0, 10, 11, 12, 13, 14, 15};
 unsigned constexpr convert_hex_to_binary(const char c) noexcept {
-  // this code can be optimized.
-  if (c <= '9') {
-    return c - '0';
-  }
-  char del = c >= 'a' ? 'a' : 'A';
-  return 10 + (c - del);
+  return hex_to_binary_table[c - '0'];
 }
 
 std::string percent_decode(const std::string_view input, size_t first_percent) {
@@ -10159,8 +10164,9 @@ std::string percent_decode(const std::string_view input, size_t first_percent) {
   if (first_percent == std::string_view::npos) {
     return std::string(input);
   }
-  std::string dest(input.substr(0, first_percent));
+  std::string dest;
   dest.reserve(input.length());
+  dest.append(input.substr(0, first_percent));
   const char* pointer = input.data() + first_percent;
   const char* end = input.data() + input.size();
   // Optimization opportunity: if the following code gets
@@ -10197,9 +10203,10 @@ std::string percent_encode(const std::string_view input,
     return std::string(input);
   }
 
-  std::string result(input.substr(0, std::distance(input.begin(), pointer)));
+  std::string result;
   result.reserve(input.length());  // in the worst case, percent encoding might
                                    // produce 3 characters.
+  result.append(input.substr(0, std::distance(input.begin(), pointer)));
 
   for (; pointer != input.end(); pointer++) {
     if (character_sets::bit_at(character_set, *pointer)) {
@@ -11231,6 +11238,7 @@ bool url::parse_ipv4(std::string_view input) {
   } else {
     host = ada::serializers::ipv4(ipv4);  // We have to reserialize the address.
   }
+  host_type = IPV4;
   return true;
 }
 
@@ -11460,6 +11468,7 @@ bool url::parse_ipv6(std::string_view input) {
   }
   host = ada::serializers::ipv6(address);
   ada_log("parse_ipv6 ", *host);
+  host_type = IPV6;
   return true;
 }
 
@@ -11876,7 +11885,7 @@ bool url::set_host_or_hostname(const std::string_view input) {
     }
 
     // Let host be the result of host parsing host_view with url is not special.
-    if (host_view.empty()) {
+    if (host_view.empty() && !is_special()) {
       host = "";
       return true;
     }
@@ -12569,7 +12578,6 @@ result_type parse_url(std::string_view user_input,
         // If c is U+002F (/) and remaining starts with U+002F (/),
         // then set state to special authority ignore slashes state and increase
         // pointer by 1.
-        state = ada::state::SPECIAL_AUTHORITY_IGNORE_SLASHES;
         std::string_view view = helpers::substring(url_data, input_position);
         if (ada::checkers::begins_with(view, "//")) {
           input_position += 2;
@@ -13638,13 +13646,12 @@ bool url_aggregator::set_host_or_hostname(const std::string_view input) {
     // empty string, and either url includes credentials or url's port is
     // non-null, return.
     else if (host_view.empty() &&
-             (is_special() || has_credentials() ||
-              components.port != url_components::omitted)) {
+             (is_special() || has_credentials() || has_port())) {
       return false;
     }
 
     // Let host be the result of host parsing host_view with url is not special.
-    if (host_view.empty()) {
+    if (host_view.empty() && !is_special()) {
       if (has_hostname()) {
         clear_hostname();  // easy!
       } else if (has_dash_dot()) {
@@ -14021,6 +14028,7 @@ bool url_aggregator::parse_ipv4(std::string_view input) {
     update_base_hostname(
         ada::serializers::ipv4(ipv4));  // We have to reserialize the address.
   }
+  host_type = IPV4;
   ADA_ASSERT_TRUE(validate());
   return true;
 }
@@ -14256,6 +14264,7 @@ bool url_aggregator::parse_ipv6(std::string_view input) {
   update_base_hostname(ada::serializers::ipv6(address));
   ada_log("parse_ipv6 ", get_hostname());
   ADA_ASSERT_TRUE(validate());
+  host_type = IPV6;
   return true;
 }
 
@@ -14890,6 +14899,11 @@ void ada_free(ada_url result) noexcept {
   delete r;
 }
 
+ada_url ada_copy(ada_url input) noexcept {
+  ada::result<ada::url_aggregator>& r = get_instance(input);
+  return new ada::result<ada::url_aggregator>(r);
+}
+
 bool ada_is_valid(ada_url result) noexcept {
   ada::result<ada::url_aggregator>& r = get_instance(result);
   return r.has_value();
@@ -15007,6 +15021,22 @@ ada_string ada_get_protocol(ada_url result) noexcept {
   return ada_string_create(out.data(), out.length());
 }
 
+uint8_t ada_get_host_type(ada_url result) noexcept {
+  ada::result<ada::url_aggregator>& r = get_instance(result);
+  if (!r) {
+    return 0;
+  }
+  return r->host_type;
+}
+
+uint8_t ada_get_scheme_type(ada_url result) noexcept {
+  ada::result<ada::url_aggregator>& r = get_instance(result);
+  if (!r) {
+    return 0;
+  }
+  return r->type;
+}
+
 bool ada_set_href(ada_url result, const char* input, size_t length) noexcept {
   ada::result<ada::url_aggregator>& r = get_instance(result);
   if (!r) {
@@ -15076,6 +15106,13 @@ bool ada_set_pathname(ada_url result, const char* input,
   return r->set_pathname(std::string_view(input, length));
 }
 
+/**
+ * Update the search/query of the URL.
+ *
+ * If a URL has `?` as the search value, passing empty string to this function
+ * does not remove the attribute. If you need to remove it, please use
+ * `ada_clear_search` method.
+ */
 void ada_set_search(ada_url result, const char* input, size_t length) noexcept {
   ada::result<ada::url_aggregator>& r = get_instance(result);
   if (r) {
@@ -15083,6 +15120,13 @@ void ada_set_search(ada_url result, const char* input, size_t length) noexcept {
   }
 }
 
+/**
+ * Update the hash/fragment of the URL.
+ *
+ * If a URL has `#` as the hash value, passing empty string to this function
+ * does not remove the attribute. If you need to remove it, please use
+ * `ada_clear_hash` method.
+ */
 void ada_set_hash(ada_url result, const char* input, size_t length) noexcept {
   ada::result<ada::url_aggregator>& r = get_instance(result);
   if (r) {
@@ -15090,6 +15134,39 @@ void ada_set_hash(ada_url result, const char* input, size_t length) noexcept {
   }
 }
 
+void ada_clear_port(ada_url result) noexcept {
+  ada::result<ada::url_aggregator>& r = get_instance(result);
+  if (r) {
+    r->clear_port();
+  }
+}
+
+/**
+ * Removes the hash of the URL.
+ *
+ * Despite `ada_set_hash` method, this function allows the complete
+ * removal of the hash attribute, even if it has a value of `#`.
+ */
+void ada_clear_hash(ada_url result) noexcept {
+  ada::result<ada::url_aggregator>& r = get_instance(result);
+  if (r) {
+    r->clear_hash();
+  }
+}
+
+/**
+ * Removes the search of the URL.
+ *
+ * Despite `ada_set_search` method, this function allows the complete
+ * removal of the search attribute, even if it has a value of `?`.
+ */
+void ada_clear_search(ada_url result) noexcept {
+  ada::result<ada::url_aggregator>& r = get_instance(result);
+  if (r) {
+    r->clear_search();
+  }
+}
+
 bool ada_has_credentials(ada_url result) noexcept {
   ada::result<ada::url_aggregator>& r = get_instance(result);
   if (!r) {
diff --git a/deps/ada/ada.h b/deps/ada/ada.h
index 3f1531944e96e7..d6f705a5d6db67 100644
--- a/deps/ada/ada.h
+++ b/deps/ada/ada.h
@@ -1,4 +1,4 @@
-/* auto-generated on 2023-07-23 15:03:22 -0400. Do not edit! */
+/* auto-generated on 2023-09-30 20:34:30 -0400. Do not edit! */
 /* begin file include/ada.h */
 /**
  * @file ada.h
@@ -8,7 +8,7 @@
 #define ADA_H
 
 /* begin file include/ada/ada_idna.h */
-/* auto-generated on 2023-05-07 19:12:14 -0400. Do not edit! */
+/* auto-generated on 2023-09-19 15:58:51 -0400. Do not edit! */
 /* begin file include/idna.h */
 #ifndef ADA_IDNA_H
 #define ADA_IDNA_H
@@ -129,9 +129,8 @@ std::string to_ascii(std::string_view ut8_string);
 // https://url.spec.whatwg.org/#forbidden-domain-code-point
 bool contains_forbidden_domain_code_point(std::string_view ascii_string);
 
-bool constexpr begins_with(std::u32string_view view,
-                           std::u32string_view prefix);
-bool constexpr begins_with(std::string_view view, std::string_view prefix);
+bool begins_with(std::u32string_view view, std::u32string_view prefix);
+bool begins_with(std::string_view view, std::string_view prefix);
 
 bool constexpr is_ascii(std::u32string_view view);
 bool constexpr is_ascii(std::string_view view);
@@ -1008,6 +1007,7 @@ ada_really_inline bool bit_at(const uint8_t a[], const uint8_t i) {
 #define ADA_CHECKERS_INL_H
 
 
+#include <algorithm>
 #include <string_view>
 #include <cstring>
 
@@ -1054,11 +1054,12 @@ inline constexpr bool is_normalized_windows_drive_letter(
   return input.size() >= 2 && (is_alpha(input[0]) && (input[1] == ':'));
 }
 
-ada_really_inline constexpr bool begins_with(std::string_view view,
-                                             std::string_view prefix) {
+ada_really_inline bool begins_with(std::string_view view,
+                                   std::string_view prefix) {
   // in C++20, you have view.begins_with(prefix)
+  // std::equal is constexpr in C++20
   return view.size() >= prefix.size() &&
-         (view.substr(0, prefix.size()) == prefix);
+         std::equal(prefix.begin(), prefix.end(), view.begin());
 }
 
 }  // namespace ada::checkers
@@ -1406,6 +1407,25 @@ constexpr ada::scheme::type get_scheme_type(std::string_view scheme) noexcept;
 
 namespace ada {
 
+/**
+ * Type of URL host as an enum.
+ */
+enum url_host_type : uint8_t {
+  /**
+   * Represents common URLs such as "https://www.google.com"
+   */
+  DEFAULT = 0,
+  /**
+   * Represents ipv4 addresses such as "http://127.0.0.1"
+   */
+  IPV4 = 1,
+  /**
+   * Represents ipv6 addresses such as
+   * "http://[2001:db8:3333:4444:5555:6666:7777:8888]"
+   */
+  IPV6 = 2,
+};
+
 /**
  * @brief Base class of URL implementations
  *
@@ -1428,6 +1448,11 @@ struct url_base {
    */
   bool has_opaque_path{false};
 
+  /**
+   * URL hosts type
+   */
+  url_host_type host_type = url_host_type::DEFAULT;
+
   /**
    * @private
    */
@@ -1768,8 +1793,8 @@ inline int fast_digit_count(uint32_t x) noexcept {
 #define TL_EXPECTED_HPP
 
 #define TL_EXPECTED_VERSION_MAJOR 1
-#define TL_EXPECTED_VERSION_MINOR 0
-#define TL_EXPECTED_VERSION_PATCH 1
+#define TL_EXPECTED_VERSION_MINOR 1
+#define TL_EXPECTED_VERSION_PATCH 0
 
 #include <exception>
 #include <functional>
@@ -1802,6 +1827,16 @@ inline int fast_digit_count(uint32_t x) noexcept {
 #define TL_EXPECTED_GCC55
 #endif
 
+#if !defined(TL_ASSERT)
+// can't have assert in constexpr in C++11 and GCC 4.9 has a compiler bug
+#if (__cplusplus > 201103L) && !defined(TL_EXPECTED_GCC49)
+#include <cassert>
+#define TL_ASSERT(x) assert(x)
+#else
+#define TL_ASSERT(x)
+#endif
+#endif
+
 #if (defined(__GNUC__) && __GNUC__ == 4 && __GNUC_MINOR__ <= 9 && \
      !defined(__clang__))
 // GCC < 5 doesn't support overloading on const&& for member functions
@@ -1957,6 +1992,7 @@ template <typename E>
 #ifdef TL_EXPECTED_EXCEPTIONS_ENABLED
   throw std::forward<E>(e);
 #else
+  (void)e;
 #ifdef _MSC_VER
   __assume(0);
 #else
@@ -2597,7 +2633,7 @@ struct expected_operations_base : expected_storage_base<T, E> {
       geterr().~unexpected<E>();
       construct(std::move(rhs).get());
     } else {
-      assign_common(rhs);
+      assign_common(std::move(rhs));
     }
   }
 
@@ -2960,7 +2996,7 @@ struct default_constructor_tag {
 };
 
 // expected_default_ctor_base will ensure that expected has a deleted default
-// constructor if T is not default constructible.
+// consturctor if T is not default constructible.
 // This specialization is for when T is default constructible
 template <class T, class E,
           bool Enable =
@@ -3255,6 +3291,53 @@ class expected : private detail::expected_move_assign_base<T, E>,
     return map_error_impl(std::move(*this), std::forward<F>(f));
   }
 #endif
+#endif
+#if defined(TL_EXPECTED_CXX14) && !defined(TL_EXPECTED_GCC49) && \
+    !defined(TL_EXPECTED_GCC54) && !defined(TL_EXPECTED_GCC55)
+  template <class F>
+  TL_EXPECTED_11_CONSTEXPR auto transform_error(F &&f) & {
+    return map_error_impl(*this, std::forward<F>(f));
+  }
+  template <class F>
+  TL_EXPECTED_11_CONSTEXPR auto transform_error(F &&f) && {
+    return map_error_impl(std::move(*this), std::forward<F>(f));
+  }
+  template <class F>
+  constexpr auto transform_error(F &&f) const & {
+    return map_error_impl(*this, std::forward<F>(f));
+  }
+  template <class F>
+  constexpr auto transform_error(F &&f) const && {
+    return map_error_impl(std::move(*this), std::forward<F>(f));
+  }
+#else
+  template <class F>
+  TL_EXPECTED_11_CONSTEXPR decltype(map_error_impl(std::declval<expected &>(),
+                                                   std::declval<F &&>()))
+  transform_error(F &&f) & {
+    return map_error_impl(*this, std::forward<F>(f));
+  }
+  template <class F>
+  TL_EXPECTED_11_CONSTEXPR decltype(map_error_impl(std::declval<expected &&>(),
+                                                   std::declval<F &&>()))
+  transform_error(F &&f) && {
+    return map_error_impl(std::move(*this), std::forward<F>(f));
+  }
+  template <class F>
+  constexpr decltype(map_error_impl(std::declval<const expected &>(),
+                                    std::declval<F &&>()))
+  transform_error(F &&f) const & {
+    return map_error_impl(*this, std::forward<F>(f));
+  }
+
+#ifndef TL_EXPECTED_NO_CONSTRR
+  template <class F>
+  constexpr decltype(map_error_impl(std::declval<const expected &&>(),
+                                    std::declval<F &&>()))
+  transform_error(F &&f) const && {
+    return map_error_impl(std::move(*this), std::forward<F>(f));
+  }
+#endif
 #endif
   template <class F>
   expected TL_EXPECTED_11_CONSTEXPR or_else(F &&f) & {
@@ -3697,27 +3780,37 @@ class expected : private detail::expected_move_assign_base<T, E>,
     }
   }
 
-  constexpr const T *operator->() const { return valptr(); }
-  TL_EXPECTED_11_CONSTEXPR T *operator->() { return valptr(); }
+  constexpr const T *operator->() const {
+    TL_ASSERT(has_value());
+    return valptr();
+  }
+  TL_EXPECTED_11_CONSTEXPR T *operator->() {
+    TL_ASSERT(has_value());
+    return valptr();
+  }
 
   template <class U = T,
             detail::enable_if_t<!std::is_void<U>::value> * = nullptr>
   constexpr const U &operator*() const & {
+    TL_ASSERT(has_value());
     return val();
   }
   template <class U = T,
             detail::enable_if_t<!std::is_void<U>::value> * = nullptr>
   TL_EXPECTED_11_CONSTEXPR U &operator*() & {
+    TL_ASSERT(has_value());
     return val();
   }
   template <class U = T,
             detail::enable_if_t<!std::is_void<U>::value> * = nullptr>
   constexpr const U &&operator*() const && {
+    TL_ASSERT(has_value());
     return std::move(val());
   }
   template <class U = T,
             detail::enable_if_t<!std::is_void<U>::value> * = nullptr>
   TL_EXPECTED_11_CONSTEXPR U &&operator*() && {
+    TL_ASSERT(has_value());
     return std::move(val());
   }
 
@@ -3753,10 +3846,22 @@ class expected : private detail::expected_move_assign_base<T, E>,
     return std::move(val());
   }
 
-  constexpr const E &error() const & { return err().value(); }
-  TL_EXPECTED_11_CONSTEXPR E &error() & { return err().value(); }
-  constexpr const E &&error() const && { return std::move(err().value()); }
-  TL_EXPECTED_11_CONSTEXPR E &&error() && { return std::move(err().value()); }
+  constexpr const E &error() const & {
+    TL_ASSERT(!has_value());
+    return err().value();
+  }
+  TL_EXPECTED_11_CONSTEXPR E &error() & {
+    TL_ASSERT(!has_value());
+    return err().value();
+  }
+  constexpr const E &&error() const && {
+    TL_ASSERT(!has_value());
+    return std::move(err().value());
+  }
+  TL_EXPECTED_11_CONSTEXPR E &&error() && {
+    TL_ASSERT(!has_value());
+    return std::move(err().value());
+  }
 
   template <class U>
   constexpr T value_or(U &&v) const & {
@@ -4479,9 +4584,10 @@ ada_really_inline constexpr bool is_single_dot_path_segment(
 ada_really_inline constexpr bool is_lowercase_hex(const char c) noexcept;
 
 /**
- * @details Convert hex to binary.
+ * @details Convert hex to binary. Caller is responsible to ensure that
+ * the parameter is an hexadecimal digit (0-9, A-F, a-f).
  */
-unsigned constexpr convert_hex_to_binary(char c) noexcept;
+ada_really_inline unsigned constexpr convert_hex_to_binary(char c) noexcept;
 
 /**
  * first_percent should be  = input.find('%')
@@ -4735,6 +4841,10 @@ struct url_aggregator : url_base {
   /** @return true if the URL has a search component */
   [[nodiscard]] inline bool has_search() const noexcept override;
 
+  inline void clear_port();
+  inline void clear_hash();
+  inline void clear_search() override;
+
  private:
   friend ada::url_aggregator ada::parser::parse_url<ada::url_aggregator>(
       std::string_view, const ada::url_aggregator *);
@@ -4809,12 +4919,9 @@ struct url_aggregator : url_base {
   inline void update_base_port(uint32_t input);
   inline void append_base_pathname(const std::string_view input);
   inline uint32_t retrieve_base_port() const;
-  inline void clear_port();
   inline void clear_hostname();
-  inline void clear_hash();
-  inline void clear_pathname() override;
-  inline void clear_search() override;
   inline void clear_password();
+  inline void clear_pathname() override;
   inline bool has_dash_dot() const noexcept;
   void delete_dash_dot();
   inline void consume_prepared_path(std::string_view input);
@@ -4913,10 +5020,10 @@ inline constexpr bool is_normalized_windows_drive_letter(
     std::string_view input) noexcept;
 
 /**
- * @warning Will be removed when Ada supports C++20.
+ * @warning Will be removed when Ada requires C++20.
  */
-ada_really_inline constexpr bool begins_with(std::string_view view,
-                                             std::string_view prefix);
+ada_really_inline bool begins_with(std::string_view view,
+                                   std::string_view prefix);
 
 /**
  * Returns true if an input is an ipv4 address.
@@ -6343,7 +6450,9 @@ inline void url_aggregator::clear_hostname() {
                        " with " + components.to_string() + "\n" + to_diagram());
 #endif
   ADA_ASSERT_TRUE(has_authority());
-  ADA_ASSERT_TRUE(has_empty_hostname());
+  ADA_ASSERT_EQUAL(has_empty_hostname(), true,
+                   "hostname should have been cleared on buffer=" + buffer +
+                       " with " + components.to_string() + "\n" + to_diagram());
   ADA_ASSERT_TRUE(validate());
 }
 
@@ -6448,7 +6557,9 @@ inline bool url_aggregator::has_hostname() const noexcept {
 
 inline bool url_aggregator::has_port() const noexcept {
   ada_log("url_aggregator::has_port");
-  return components.pathname_start != components.host_end;
+  // A URL cannot have a username/password/port if its host is null or the empty
+  // string, or its scheme is "file".
+  return has_hostname() && components.pathname_start != components.host_end;
 }
 
 inline bool url_aggregator::has_dash_dot() const noexcept {
@@ -6609,6 +6720,7 @@ struct url_search_params {
    * @see https://url.spec.whatwg.org/#dom-urlsearchparams-has
    */
   inline bool has(std::string_view key) noexcept;
+  inline bool has(std::string_view key, std::string_view value) noexcept;
 
   /**
    * @see https://url.spec.whatwg.org/#dom-urlsearchparams-set
@@ -6733,6 +6845,15 @@ inline bool url_search_params::has(const std::string_view key) noexcept {
   return entry != params.end();
 }
 
+inline bool url_search_params::has(std::string_view key,
+                                   std::string_view value) noexcept {
+  auto entry =
+      std::find_if(params.begin(), params.end(), [&key, &value](auto &param) {
+        return param.first == key && param.second == value;
+      });
+  return entry != params.end();
+}
+
 inline std::string url_search_params::to_string() {
   auto character_set = ada::character_sets::WWW_FORM_URLENCODED_PERCENT_ENCODE;
   std::string out{};
@@ -6807,14 +6928,14 @@ inline void url_search_params::sort() {
 #ifndef ADA_ADA_VERSION_H
 #define ADA_ADA_VERSION_H
 
-#define ADA_VERSION "2.6.0"
+#define ADA_VERSION "2.6.10"
 
 namespace ada {
 
 enum {
   ADA_VERSION_MAJOR = 2,
   ADA_VERSION_MINOR = 6,
-  ADA_VERSION_REVISION = 0,
+  ADA_VERSION_REVISION = 10,
 };
 
 }  // namespace ada
diff --git a/deps/ada/ada_c.h b/deps/ada/ada_c.h
index 6e22584f612a75..040915518f32a0 100644
--- a/deps/ada/ada_c.h
+++ b/deps/ada/ada_c.h
@@ -51,6 +51,7 @@ bool ada_can_parse_with_base(const char* input, size_t input_length,
 
 void ada_free(ada_url result);
 void ada_free_owned_string(ada_owned_string owned);
+ada_url ada_copy(ada_url input);
 
 bool ada_is_valid(ada_url result);
 
@@ -67,6 +68,8 @@ ada_string ada_get_hostname(ada_url result);
 ada_string ada_get_pathname(ada_url result);
 ada_string ada_get_search(ada_url result);
 ada_string ada_get_protocol(ada_url result);
+uint8_t ada_get_host_type(ada_url result);
+uint8_t ada_get_scheme_type(ada_url result);
 
 // url_aggregator setters
 // if ada_is_valid(result)) is false, the setters have no effect
@@ -82,6 +85,11 @@ bool ada_set_pathname(ada_url result, const char* input, size_t length);
 void ada_set_search(ada_url result, const char* input, size_t length);
 void ada_set_hash(ada_url result, const char* input, size_t length);
 
+// url_aggregator clear methods
+void ada_clear_port(ada_url result);
+void ada_clear_hash(ada_url result);
+void ada_clear_search(ada_url result);
+
 // url_aggregator functions
 // if ada_is_valid(result) is false, functions below will return false
 bool ada_has_credentials(ada_url result);
diff --git a/deps/corepack/CHANGELOG.md b/deps/corepack/CHANGELOG.md
index 45b5d182594b6e..4c94877b3e6a97 100644
--- a/deps/corepack/CHANGELOG.md
+++ b/deps/corepack/CHANGELOG.md
@@ -1,5 +1,21 @@
 # Changelog
 
+## [0.21.0](https://github.com/nodejs/corepack/compare/v0.20.0...v0.21.0) (2023-10-08)
+
+
+### ⚠ BREAKING CHANGES
+
+* remove support for Node.js 16.x
+
+### Features
+
+* update package manager versions ([#297](https://github.com/nodejs/corepack/issues/297)) ([503e135](https://github.com/nodejs/corepack/commit/503e135878935cc881ebd94b48d5eca94ec4c27b))
+
+
+### Miscellaneous Chores
+
+* update supported Node.js versions ([#309](https://github.com/nodejs/corepack/issues/309)) ([787e24d](https://github.com/nodejs/corepack/commit/787e24df609513702eafcd8c6a5f03544d7d45cc))
+
 ## [0.20.0](https://github.com/nodejs/corepack/compare/v0.19.0...v0.20.0) (2023-08-29)
 
 
diff --git a/deps/corepack/dist/lib/corepack.cjs b/deps/corepack/dist/lib/corepack.cjs
index 69e50a97cccec4..b3c0aae570d24b 100644
--- a/deps/corepack/dist/lib/corepack.cjs
+++ b/deps/corepack/dist/lib/corepack.cjs
@@ -5,6 +5,7 @@ var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
 var __getOwnPropNames = Object.getOwnPropertyNames;
 var __getProtoOf = Object.getPrototypeOf;
 var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
 var __esm = (fn2, res) => function __init() {
   return fn2 && (res = (0, fn2[__getOwnPropNames(fn2)[0]])(fn2 = 0)), res;
 };
@@ -32,8 +33,12 @@ var __toESM = (mod, isNodeMode, target) => (target = mod != null ? __create(__ge
   mod
 ));
 var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+var __publicField = (obj, key, value) => {
+  __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+  return value;
+};
 
-// .yarn/cache/typanion-npm-3.12.1-788497c54f-492540c6ac.zip/node_modules/typanion/lib/index.mjs
+// .yarn/cache/typanion-npm-3.12.1-788497c54f-90cf558a34.zip/node_modules/typanion/lib/index.mjs
 var lib_exports = {};
 __export(lib_exports, {
   KeyRelationship: () => KeyRelationship,
@@ -919,7 +924,7 @@ function hasKeyRelationship(subject, relationship, others, { ignore = [] } = {})
 }
 var simpleKeyRegExp, colorStringRegExp, colorStringAlphaRegExp, base64RegExp, uuid4RegExp, iso8601RegExp, BOOLEAN_COERCIONS, isInstanceOf, isOneOf, TypeAssertionError, checks, KeyRelationship, keyRelationships;
 var init_lib = __esm({
-  ".yarn/cache/typanion-npm-3.12.1-788497c54f-492540c6ac.zip/node_modules/typanion/lib/index.mjs"() {
+  ".yarn/cache/typanion-npm-3.12.1-788497c54f-90cf558a34.zip/node_modules/typanion/lib/index.mjs"() {
     simpleKeyRegExp = /^[a-zA-Z_][a-zA-Z0-9_]*$/;
     colorStringRegExp = /^#[0-9a-f]{6}$/i;
     colorStringAlphaRegExp = /^#[0-9a-f]{6}([0-9a-f]{2})?$/i;
@@ -1010,9 +1015,9 @@ var init_lib = __esm({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/constants.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/constants.js
 var require_constants = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/constants.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/constants.js"(exports, module2) {
     var SEMVER_SPEC_VERSION = "2.0.0";
     var MAX_LENGTH = 256;
     var MAX_SAFE_INTEGER = Number.MAX_SAFE_INTEGER || /* istanbul ignore next */
@@ -1041,18 +1046,18 @@ var require_constants = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/debug.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/debug.js
 var require_debug = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/debug.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/debug.js"(exports, module2) {
     var debug2 = typeof process === "object" && process.env && process.env.NODE_DEBUG && /\bsemver\b/i.test(process.env.NODE_DEBUG) ? (...args) => console.error("SEMVER", ...args) : () => {
     };
     module2.exports = debug2;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/re.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/re.js
 var require_re = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/re.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/re.js"(exports, module2) {
     var { MAX_SAFE_COMPONENT_LENGTH, MAX_SAFE_BUILD_LENGTH } = require_constants();
     var debug2 = require_debug();
     exports = module2.exports = {};
@@ -1128,9 +1133,9 @@ var require_re = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/parse-options.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/parse-options.js
 var require_parse_options = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/parse-options.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/parse-options.js"(exports, module2) {
     var looseOption = Object.freeze({ loose: true });
     var emptyOpts = Object.freeze({});
     var parseOptions = (options) => {
@@ -1146,9 +1151,9 @@ var require_parse_options = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/identifiers.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/identifiers.js
 var require_identifiers = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/internal/identifiers.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/internal/identifiers.js"(exports, module2) {
     var numeric = /^[0-9]+$/;
     var compareIdentifiers = (a, b) => {
       const anum = numeric.test(a);
@@ -1167,9 +1172,9 @@ var require_identifiers = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/classes/semver.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/classes/semver.js
 var require_semver = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/classes/semver.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/classes/semver.js"(exports, module2) {
     var debug2 = require_debug();
     var { MAX_LENGTH, MAX_SAFE_INTEGER } = require_constants();
     var { safeRe: re, t } = require_re();
@@ -1409,9 +1414,9 @@ var require_semver = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/parse.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/parse.js
 var require_parse = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/parse.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/parse.js"(exports, module2) {
     var SemVer = require_semver();
     var parse = (version2, options, throwErrors = false) => {
       if (version2 instanceof SemVer) {
@@ -1430,9 +1435,9 @@ var require_parse = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/valid.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/valid.js
 var require_valid = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/valid.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/valid.js"(exports, module2) {
     var parse = require_parse();
     var valid = (version2, options) => {
       const v = parse(version2, options);
@@ -1442,9 +1447,9 @@ var require_valid = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/clean.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/clean.js
 var require_clean = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/clean.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/clean.js"(exports, module2) {
     var parse = require_parse();
     var clean = (version2, options) => {
       const s = parse(version2.trim().replace(/^[=v]+/, ""), options);
@@ -1454,9 +1459,9 @@ var require_clean = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/inc.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/inc.js
 var require_inc = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/inc.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/inc.js"(exports, module2) {
     var SemVer = require_semver();
     var inc = (version2, release, options, identifier, identifierBase) => {
       if (typeof options === "string") {
@@ -1477,9 +1482,9 @@ var require_inc = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/diff.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/diff.js
 var require_diff = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/diff.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/diff.js"(exports, module2) {
     var parse = require_parse();
     var diff = (version1, version2) => {
       const v1 = parse(version1, null, true);
@@ -1521,36 +1526,36 @@ var require_diff = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/major.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/major.js
 var require_major = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/major.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/major.js"(exports, module2) {
     var SemVer = require_semver();
     var major = (a, loose) => new SemVer(a, loose).major;
     module2.exports = major;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/minor.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/minor.js
 var require_minor = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/minor.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/minor.js"(exports, module2) {
     var SemVer = require_semver();
     var minor = (a, loose) => new SemVer(a, loose).minor;
     module2.exports = minor;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/patch.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/patch.js
 var require_patch = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/patch.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/patch.js"(exports, module2) {
     var SemVer = require_semver();
     var patch = (a, loose) => new SemVer(a, loose).patch;
     module2.exports = patch;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/prerelease.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/prerelease.js
 var require_prerelease = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/prerelease.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/prerelease.js"(exports, module2) {
     var parse = require_parse();
     var prerelease = (version2, options) => {
       const parsed = parse(version2, options);
@@ -1560,36 +1565,36 @@ var require_prerelease = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/compare.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/compare.js
 var require_compare = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/compare.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/compare.js"(exports, module2) {
     var SemVer = require_semver();
     var compare = (a, b, loose) => new SemVer(a, loose).compare(new SemVer(b, loose));
     module2.exports = compare;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/rcompare.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/rcompare.js
 var require_rcompare = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/rcompare.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/rcompare.js"(exports, module2) {
     var compare = require_compare();
     var rcompare = (a, b, loose) => compare(b, a, loose);
     module2.exports = rcompare;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/compare-loose.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/compare-loose.js
 var require_compare_loose = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/compare-loose.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/compare-loose.js"(exports, module2) {
     var compare = require_compare();
     var compareLoose = (a, b) => compare(a, b, true);
     module2.exports = compareLoose;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/compare-build.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/compare-build.js
 var require_compare_build = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/compare-build.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/compare-build.js"(exports, module2) {
     var SemVer = require_semver();
     var compareBuild = (a, b, loose) => {
       const versionA = new SemVer(a, loose);
@@ -1600,81 +1605,81 @@ var require_compare_build = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/sort.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/sort.js
 var require_sort = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/sort.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/sort.js"(exports, module2) {
     var compareBuild = require_compare_build();
     var sort = (list, loose) => list.sort((a, b) => compareBuild(a, b, loose));
     module2.exports = sort;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/rsort.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/rsort.js
 var require_rsort = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/rsort.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/rsort.js"(exports, module2) {
     var compareBuild = require_compare_build();
     var rsort = (list, loose) => list.sort((a, b) => compareBuild(b, a, loose));
     module2.exports = rsort;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/gt.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/gt.js
 var require_gt = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/gt.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/gt.js"(exports, module2) {
     var compare = require_compare();
     var gt = (a, b, loose) => compare(a, b, loose) > 0;
     module2.exports = gt;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/lt.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/lt.js
 var require_lt = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/lt.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/lt.js"(exports, module2) {
     var compare = require_compare();
     var lt = (a, b, loose) => compare(a, b, loose) < 0;
     module2.exports = lt;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/eq.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/eq.js
 var require_eq = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/eq.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/eq.js"(exports, module2) {
     var compare = require_compare();
     var eq = (a, b, loose) => compare(a, b, loose) === 0;
     module2.exports = eq;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/neq.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/neq.js
 var require_neq = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/neq.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/neq.js"(exports, module2) {
     var compare = require_compare();
     var neq = (a, b, loose) => compare(a, b, loose) !== 0;
     module2.exports = neq;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/gte.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/gte.js
 var require_gte = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/gte.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/gte.js"(exports, module2) {
     var compare = require_compare();
     var gte = (a, b, loose) => compare(a, b, loose) >= 0;
     module2.exports = gte;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/lte.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/lte.js
 var require_lte = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/lte.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/lte.js"(exports, module2) {
     var compare = require_compare();
     var lte = (a, b, loose) => compare(a, b, loose) <= 0;
     module2.exports = lte;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/cmp.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/cmp.js
 var require_cmp = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/cmp.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/cmp.js"(exports, module2) {
     var eq = require_eq();
     var neq = require_neq();
     var gt = require_gt();
@@ -1721,9 +1726,9 @@ var require_cmp = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/coerce.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/coerce.js
 var require_coerce = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/coerce.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/coerce.js"(exports, module2) {
     var SemVer = require_semver();
     var parse = require_parse();
     var { safeRe: re, t } = require_re();
@@ -1760,9 +1765,9 @@ var require_coerce = __commonJS({
   }
 });
 
-// .yarn/cache/yallist-npm-4.0.0-b493d9e907-cd7fe32508.zip/node_modules/yallist/iterator.js
+// .yarn/cache/yallist-npm-4.0.0-b493d9e907-2286b5e8db.zip/node_modules/yallist/iterator.js
 var require_iterator = __commonJS({
-  ".yarn/cache/yallist-npm-4.0.0-b493d9e907-cd7fe32508.zip/node_modules/yallist/iterator.js"(exports, module2) {
+  ".yarn/cache/yallist-npm-4.0.0-b493d9e907-2286b5e8db.zip/node_modules/yallist/iterator.js"(exports, module2) {
     "use strict";
     module2.exports = function(Yallist) {
       Yallist.prototype[Symbol.iterator] = function* () {
@@ -1774,9 +1779,9 @@ var require_iterator = __commonJS({
   }
 });
 
-// .yarn/cache/yallist-npm-4.0.0-b493d9e907-cd7fe32508.zip/node_modules/yallist/yallist.js
+// .yarn/cache/yallist-npm-4.0.0-b493d9e907-2286b5e8db.zip/node_modules/yallist/yallist.js
 var require_yallist = __commonJS({
-  ".yarn/cache/yallist-npm-4.0.0-b493d9e907-cd7fe32508.zip/node_modules/yallist/yallist.js"(exports, module2) {
+  ".yarn/cache/yallist-npm-4.0.0-b493d9e907-2286b5e8db.zip/node_modules/yallist/yallist.js"(exports, module2) {
     "use strict";
     module2.exports = Yallist;
     Yallist.Node = Node;
@@ -2143,9 +2148,9 @@ var require_yallist = __commonJS({
   }
 });
 
-// .yarn/cache/lru-cache-npm-6.0.0-b4c8668fe1-b2d72088dd.zip/node_modules/lru-cache/index.js
+// .yarn/cache/lru-cache-npm-6.0.0-b4c8668fe1-cb53e58278.zip/node_modules/lru-cache/index.js
 var require_lru_cache = __commonJS({
-  ".yarn/cache/lru-cache-npm-6.0.0-b4c8668fe1-b2d72088dd.zip/node_modules/lru-cache/index.js"(exports, module2) {
+  ".yarn/cache/lru-cache-npm-6.0.0-b4c8668fe1-cb53e58278.zip/node_modules/lru-cache/index.js"(exports, module2) {
     "use strict";
     var Yallist = require_yallist();
     var MAX = Symbol("max");
@@ -2413,9 +2418,9 @@ var require_lru_cache = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/classes/range.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/classes/range.js
 var require_range = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/classes/range.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/classes/range.js"(exports, module2) {
     var Range = class {
       constructor(range, options) {
         options = parseOptions(options);
@@ -2770,9 +2775,9 @@ var require_range = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/classes/comparator.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/classes/comparator.js
 var require_comparator = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/classes/comparator.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/classes/comparator.js"(exports, module2) {
     var ANY = Symbol("SemVer ANY");
     var Comparator = class {
       static get ANY() {
@@ -2882,9 +2887,9 @@ var require_comparator = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/satisfies.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/satisfies.js
 var require_satisfies = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/functions/satisfies.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/functions/satisfies.js"(exports, module2) {
     var Range = require_range();
     var satisfies = (version2, range, options) => {
       try {
@@ -2898,18 +2903,18 @@ var require_satisfies = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/to-comparators.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/to-comparators.js
 var require_to_comparators = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/to-comparators.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/to-comparators.js"(exports, module2) {
     var Range = require_range();
     var toComparators = (range, options) => new Range(range, options).set.map((comp) => comp.map((c) => c.value).join(" ").trim().split(" "));
     module2.exports = toComparators;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/max-satisfying.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/max-satisfying.js
 var require_max_satisfying = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/max-satisfying.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/max-satisfying.js"(exports, module2) {
     var SemVer = require_semver();
     var Range = require_range();
     var maxSatisfying = (versions, range, options) => {
@@ -2935,9 +2940,9 @@ var require_max_satisfying = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/min-satisfying.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/min-satisfying.js
 var require_min_satisfying = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/min-satisfying.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/min-satisfying.js"(exports, module2) {
     var SemVer = require_semver();
     var Range = require_range();
     var minSatisfying = (versions, range, options) => {
@@ -2963,9 +2968,9 @@ var require_min_satisfying = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/min-version.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/min-version.js
 var require_min_version = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/min-version.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/min-version.js"(exports, module2) {
     var SemVer = require_semver();
     var Range = require_range();
     var gt = require_gt();
@@ -3019,9 +3024,9 @@ var require_min_version = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/valid.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/valid.js
 var require_valid2 = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/valid.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/valid.js"(exports, module2) {
     var Range = require_range();
     var validRange = (range, options) => {
       try {
@@ -3034,9 +3039,9 @@ var require_valid2 = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/outside.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/outside.js
 var require_outside = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/outside.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/outside.js"(exports, module2) {
     var SemVer = require_semver();
     var Comparator = require_comparator();
     var { ANY } = Comparator;
@@ -3102,27 +3107,27 @@ var require_outside = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/gtr.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/gtr.js
 var require_gtr = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/gtr.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/gtr.js"(exports, module2) {
     var outside = require_outside();
     var gtr = (version2, range, options) => outside(version2, range, ">", options);
     module2.exports = gtr;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/ltr.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/ltr.js
 var require_ltr = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/ltr.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/ltr.js"(exports, module2) {
     var outside = require_outside();
     var ltr = (version2, range, options) => outside(version2, range, "<", options);
     module2.exports = ltr;
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/intersects.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/intersects.js
 var require_intersects = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/intersects.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/intersects.js"(exports, module2) {
     var Range = require_range();
     var intersects = (r1, r2, options) => {
       r1 = new Range(r1, options);
@@ -3133,9 +3138,9 @@ var require_intersects = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/simplify.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/simplify.js
 var require_simplify = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/simplify.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/simplify.js"(exports, module2) {
     var satisfies = require_satisfies();
     var compare = require_compare();
     module2.exports = (versions, range, options) => {
@@ -3182,9 +3187,9 @@ var require_simplify = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/subset.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/subset.js
 var require_subset = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/ranges/subset.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/ranges/subset.js"(exports, module2) {
     var Range = require_range();
     var Comparator = require_comparator();
     var { ANY } = Comparator;
@@ -3344,9 +3349,9 @@ var require_subset = __commonJS({
   }
 });
 
-// .yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/index.js
+// .yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/index.js
 var require_semver2 = __commonJS({
-  ".yarn/cache/semver-npm-7.5.3-275095dbf3-9e949f7d57.zip/node_modules/semver/index.js"(exports, module2) {
+  ".yarn/cache/semver-npm-7.5.3-275095dbf3-4cf3bab7e8.zip/node_modules/semver/index.js"(exports, module2) {
     var internalRe = require_re();
     var constants = require_constants();
     var SemVer = require_semver();
@@ -3438,9 +3443,9 @@ var require_semver2 = __commonJS({
   }
 });
 
-// .yarn/cache/ms-npm-2.1.2-ec0c1512ff-3f46af60a0.zip/node_modules/ms/index.js
+// .yarn/cache/ms-npm-2.1.2-ec0c1512ff-a437714e2f.zip/node_modules/ms/index.js
 var require_ms = __commonJS({
-  ".yarn/cache/ms-npm-2.1.2-ec0c1512ff-3f46af60a0.zip/node_modules/ms/index.js"(exports, module2) {
+  ".yarn/cache/ms-npm-2.1.2-ec0c1512ff-a437714e2f.zip/node_modules/ms/index.js"(exports, module2) {
     var s = 1e3;
     var m = s * 60;
     var h = m * 60;
@@ -3554,9 +3559,9 @@ var require_ms = __commonJS({
   }
 });
 
-// .yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/common.js
+// .yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/common.js
 var require_common = __commonJS({
-  ".yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/common.js"(exports, module2) {
+  ".yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/common.js"(exports, module2) {
     function setup(env2) {
       createDebug.debug = createDebug;
       createDebug.default = createDebug;
@@ -3717,9 +3722,9 @@ var require_common = __commonJS({
   }
 });
 
-// .yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/browser.js
+// .yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/browser.js
 var require_browser = __commonJS({
-  ".yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/browser.js"(exports, module2) {
+  ".yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/browser.js"(exports, module2) {
     exports.formatArgs = formatArgs;
     exports.save = save;
     exports.load = load;
@@ -3886,7 +3891,7 @@ var require_browser = __commonJS({
   }
 });
 
-// .yarn/cache/supports-color-npm-9.3.1-08866b3304-4c447d3aff.zip/node_modules/supports-color/index.js
+// .yarn/cache/supports-color-npm-9.3.1-08866b3304-cf142b72de.zip/node_modules/supports-color/index.js
 var supports_color_exports = {};
 __export(supports_color_exports, {
   createSupportsColor: () => createSupportsColor,
@@ -4003,7 +4008,7 @@ function createSupportsColor(stream, options = {}) {
 }
 var import_node_process, import_node_os, import_node_tty, env, flagForceColor, supportsColor, supports_color_default;
 var init_supports_color = __esm({
-  ".yarn/cache/supports-color-npm-9.3.1-08866b3304-4c447d3aff.zip/node_modules/supports-color/index.js"() {
+  ".yarn/cache/supports-color-npm-9.3.1-08866b3304-cf142b72de.zip/node_modules/supports-color/index.js"() {
     import_node_process = __toESM(require("node:process"), 1);
     import_node_os = __toESM(require("node:os"), 1);
     import_node_tty = __toESM(require("node:tty"), 1);
@@ -4021,9 +4026,9 @@ var init_supports_color = __esm({
   }
 });
 
-// .yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/node.js
+// .yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/node.js
 var require_node = __commonJS({
-  ".yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/node.js"(exports, module2) {
+  ".yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/node.js"(exports, module2) {
     var tty3 = require("tty");
     var util = require("util");
     exports.init = init;
@@ -4195,9 +4200,9 @@ var require_node = __commonJS({
   }
 });
 
-// .yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/index.js
+// .yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/index.js
 var require_src = __commonJS({
-  ".yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/index.js"(exports, module2) {
+  ".yarn/__virtual__/debug-virtual-80c19f725b/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/index.js"(exports, module2) {
     if (typeof process === "undefined" || process.type === "renderer" || process.browser === true || process.__nwjs) {
       module2.exports = require_browser();
     } else {
@@ -4206,9 +4211,9 @@ var require_src = __commonJS({
   }
 });
 
-// .yarn/cache/lru-cache-npm-7.18.3-e68be5b11c-884c7cb519.zip/node_modules/lru-cache/index.js
+// .yarn/cache/lru-cache-npm-7.18.3-e68be5b11c-b3a452b491.zip/node_modules/lru-cache/index.js
 var require_lru_cache2 = __commonJS({
-  ".yarn/cache/lru-cache-npm-7.18.3-e68be5b11c-884c7cb519.zip/node_modules/lru-cache/index.js"(exports, module2) {
+  ".yarn/cache/lru-cache-npm-7.18.3-e68be5b11c-b3a452b491.zip/node_modules/lru-cache/index.js"(exports, module2) {
     var perf = typeof performance === "object" && performance && typeof performance.now === "function" ? performance : Date;
     var hasAbortController = typeof AbortController === "function";
     var AC = hasAbortController ? AbortController : class AbortController {
@@ -5223,9 +5228,9 @@ var require_lru_cache2 = __commonJS({
   }
 });
 
-// .yarn/cache/agent-base-npm-7.1.0-4b12ba5111-d1c9dc1b33.zip/node_modules/agent-base/dist/helpers.js
+// .yarn/cache/agent-base-npm-7.1.0-4b12ba5111-fc974ab57f.zip/node_modules/agent-base/dist/helpers.js
 var require_helpers = __commonJS({
-  ".yarn/cache/agent-base-npm-7.1.0-4b12ba5111-d1c9dc1b33.zip/node_modules/agent-base/dist/helpers.js"(exports) {
+  ".yarn/cache/agent-base-npm-7.1.0-4b12ba5111-fc974ab57f.zip/node_modules/agent-base/dist/helpers.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -5298,9 +5303,9 @@ var require_helpers = __commonJS({
   }
 });
 
-// .yarn/cache/agent-base-npm-7.1.0-4b12ba5111-d1c9dc1b33.zip/node_modules/agent-base/dist/index.js
+// .yarn/cache/agent-base-npm-7.1.0-4b12ba5111-fc974ab57f.zip/node_modules/agent-base/dist/index.js
 var require_dist = __commonJS({
-  ".yarn/cache/agent-base-npm-7.1.0-4b12ba5111-d1c9dc1b33.zip/node_modules/agent-base/dist/index.js"(exports) {
+  ".yarn/cache/agent-base-npm-7.1.0-4b12ba5111-fc974ab57f.zip/node_modules/agent-base/dist/index.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -5408,9 +5413,9 @@ var require_dist = __commonJS({
   }
 });
 
-// .yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/common.js
+// .yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/common.js
 var require_common2 = __commonJS({
-  ".yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/common.js"(exports, module2) {
+  ".yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/common.js"(exports, module2) {
     function setup(env2) {
       createDebug.debug = createDebug;
       createDebug.default = createDebug;
@@ -5571,9 +5576,9 @@ var require_common2 = __commonJS({
   }
 });
 
-// .yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/browser.js
+// .yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/browser.js
 var require_browser2 = __commonJS({
-  ".yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/browser.js"(exports, module2) {
+  ".yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/browser.js"(exports, module2) {
     exports.formatArgs = formatArgs;
     exports.save = save;
     exports.load = load;
@@ -5740,9 +5745,9 @@ var require_browser2 = __commonJS({
   }
 });
 
-// .yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/node.js
+// .yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/node.js
 var require_node2 = __commonJS({
-  ".yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/node.js"(exports, module2) {
+  ".yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/node.js"(exports, module2) {
     var tty3 = require("tty");
     var util = require("util");
     exports.init = init;
@@ -5914,9 +5919,9 @@ var require_node2 = __commonJS({
   }
 });
 
-// .yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/index.js
+// .yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/index.js
 var require_src2 = __commonJS({
-  ".yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-ab50d98b6f.zip/node_modules/debug/src/index.js"(exports, module2) {
+  ".yarn/__virtual__/debug-virtual-2eaddcf3b9/0/cache/debug-npm-4.3.4-4513954577-cedbec4529.zip/node_modules/debug/src/index.js"(exports, module2) {
     if (typeof process === "undefined" || process.type === "renderer" || process.browser === true || process.__nwjs) {
       module2.exports = require_browser2();
     } else {
@@ -5925,9 +5930,9 @@ var require_src2 = __commonJS({
   }
 });
 
-// .yarn/cache/proxy-from-env-npm-1.1.0-c13d07f26b-0bba2ef7c8.zip/node_modules/proxy-from-env/index.js
+// .yarn/cache/proxy-from-env-npm-1.1.0-c13d07f26b-fe7dd8b1bd.zip/node_modules/proxy-from-env/index.js
 var require_proxy_from_env = __commonJS({
-  ".yarn/cache/proxy-from-env-npm-1.1.0-c13d07f26b-0bba2ef7c8.zip/node_modules/proxy-from-env/index.js"(exports) {
+  ".yarn/cache/proxy-from-env-npm-1.1.0-c13d07f26b-fe7dd8b1bd.zip/node_modules/proxy-from-env/index.js"(exports) {
     "use strict";
     var parseUrl = require("url").parse;
     var DEFAULT_PORTS = {
@@ -5995,9 +6000,9 @@ var require_proxy_from_env = __commonJS({
   }
 });
 
-// .yarn/cache/http-proxy-agent-npm-7.0.0-106a57cc8c-a028878555.zip/node_modules/http-proxy-agent/dist/index.js
+// .yarn/cache/http-proxy-agent-npm-7.0.0-106a57cc8c-a11574ff39.zip/node_modules/http-proxy-agent/dist/index.js
 var require_dist2 = __commonJS({
-  ".yarn/cache/http-proxy-agent-npm-7.0.0-106a57cc8c-a028878555.zip/node_modules/http-proxy-agent/dist/index.js"(exports) {
+  ".yarn/cache/http-proxy-agent-npm-7.0.0-106a57cc8c-a11574ff39.zip/node_modules/http-proxy-agent/dist/index.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -6129,9 +6134,9 @@ var require_dist2 = __commonJS({
   }
 });
 
-// .yarn/cache/https-proxy-agent-npm-7.0.1-a2d5d93ee0-4fc3e7f50c.zip/node_modules/https-proxy-agent/dist/parse-proxy-response.js
+// .yarn/cache/https-proxy-agent-npm-7.0.1-a2d5d93ee0-f08f646809.zip/node_modules/https-proxy-agent/dist/parse-proxy-response.js
 var require_parse_proxy_response = __commonJS({
-  ".yarn/cache/https-proxy-agent-npm-7.0.1-a2d5d93ee0-4fc3e7f50c.zip/node_modules/https-proxy-agent/dist/parse-proxy-response.js"(exports) {
+  ".yarn/cache/https-proxy-agent-npm-7.0.1-a2d5d93ee0-f08f646809.zip/node_modules/https-proxy-agent/dist/parse-proxy-response.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -6225,9 +6230,9 @@ var require_parse_proxy_response = __commonJS({
   }
 });
 
-// .yarn/cache/https-proxy-agent-npm-7.0.1-a2d5d93ee0-4fc3e7f50c.zip/node_modules/https-proxy-agent/dist/index.js
+// .yarn/cache/https-proxy-agent-npm-7.0.1-a2d5d93ee0-f08f646809.zip/node_modules/https-proxy-agent/dist/index.js
 var require_dist3 = __commonJS({
-  ".yarn/cache/https-proxy-agent-npm-7.0.1-a2d5d93ee0-4fc3e7f50c.zip/node_modules/https-proxy-agent/dist/index.js"(exports) {
+  ".yarn/cache/https-proxy-agent-npm-7.0.1-a2d5d93ee0-f08f646809.zip/node_modules/https-proxy-agent/dist/index.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -6372,9 +6377,9 @@ var require_dist3 = __commonJS({
   }
 });
 
-// .yarn/cache/ip-npm-2.0.0-204facb3cc-42a7cf251b.zip/node_modules/ip/lib/ip.js
+// .yarn/cache/ip-npm-2.0.0-204facb3cc-8d186cc558.zip/node_modules/ip/lib/ip.js
 var require_ip = __commonJS({
-  ".yarn/cache/ip-npm-2.0.0-204facb3cc-42a7cf251b.zip/node_modules/ip/lib/ip.js"(exports) {
+  ".yarn/cache/ip-npm-2.0.0-204facb3cc-8d186cc558.zip/node_modules/ip/lib/ip.js"(exports) {
     var ip = exports;
     var { Buffer: Buffer2 } = require("buffer");
     var os3 = require("os");
@@ -6675,9 +6680,9 @@ var require_ip = __commonJS({
   }
 });
 
-// .yarn/cache/smart-buffer-npm-4.2.0-5ac3f668bb-898a5ce465.zip/node_modules/smart-buffer/build/utils.js
+// .yarn/cache/smart-buffer-npm-4.2.0-5ac3f668bb-a16775323e.zip/node_modules/smart-buffer/build/utils.js
 var require_utils = __commonJS({
-  ".yarn/cache/smart-buffer-npm-4.2.0-5ac3f668bb-898a5ce465.zip/node_modules/smart-buffer/build/utils.js"(exports) {
+  ".yarn/cache/smart-buffer-npm-4.2.0-5ac3f668bb-a16775323e.zip/node_modules/smart-buffer/build/utils.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var buffer_1 = require("buffer");
@@ -6744,9 +6749,9 @@ var require_utils = __commonJS({
   }
 });
 
-// .yarn/cache/smart-buffer-npm-4.2.0-5ac3f668bb-898a5ce465.zip/node_modules/smart-buffer/build/smartbuffer.js
+// .yarn/cache/smart-buffer-npm-4.2.0-5ac3f668bb-a16775323e.zip/node_modules/smart-buffer/build/smartbuffer.js
 var require_smartbuffer = __commonJS({
-  ".yarn/cache/smart-buffer-npm-4.2.0-5ac3f668bb-898a5ce465.zip/node_modules/smart-buffer/build/smartbuffer.js"(exports) {
+  ".yarn/cache/smart-buffer-npm-4.2.0-5ac3f668bb-a16775323e.zip/node_modules/smart-buffer/build/smartbuffer.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var utils_1 = require_utils();
@@ -7902,9 +7907,9 @@ var require_smartbuffer = __commonJS({
   }
 });
 
-// .yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/common/constants.js
+// .yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/common/constants.js
 var require_constants2 = __commonJS({
-  ".yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/common/constants.js"(exports) {
+  ".yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/common/constants.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.SOCKS5_NO_ACCEPTABLE_AUTH = exports.SOCKS5_CUSTOM_AUTH_END = exports.SOCKS5_CUSTOM_AUTH_START = exports.SOCKS_INCOMING_PACKET_SIZES = exports.SocksClientState = exports.Socks5Response = exports.Socks5HostType = exports.Socks5Auth = exports.Socks4Response = exports.SocksCommand = exports.ERRORS = exports.DEFAULT_TIMEOUT = void 0;
@@ -8021,9 +8026,9 @@ var require_constants2 = __commonJS({
   }
 });
 
-// .yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/common/util.js
+// .yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/common/util.js
 var require_util = __commonJS({
-  ".yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/common/util.js"(exports) {
+  ".yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/common/util.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.shuffleArray = exports.SocksClientError = void 0;
@@ -8044,9 +8049,9 @@ var require_util = __commonJS({
   }
 });
 
-// .yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/common/helpers.js
+// .yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/common/helpers.js
 var require_helpers2 = __commonJS({
-  ".yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/common/helpers.js"(exports) {
+  ".yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/common/helpers.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.validateSocksClientChainOptions = exports.validateSocksClientOptions = void 0;
@@ -8124,9 +8129,9 @@ var require_helpers2 = __commonJS({
   }
 });
 
-// .yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/common/receivebuffer.js
+// .yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/common/receivebuffer.js
 var require_receivebuffer = __commonJS({
-  ".yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/common/receivebuffer.js"(exports) {
+  ".yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/common/receivebuffer.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.ReceiveBuffer = void 0;
@@ -8172,9 +8177,9 @@ var require_receivebuffer = __commonJS({
   }
 });
 
-// .yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/client/socksclient.js
+// .yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/client/socksclient.js
 var require_socksclient = __commonJS({
-  ".yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/client/socksclient.js"(exports) {
+  ".yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/client/socksclient.js"(exports) {
     "use strict";
     var __awaiter2 = exports && exports.__awaiter || function(thisArg, _arguments, P, generator) {
       function adopt(value) {
@@ -8851,9 +8856,9 @@ var require_socksclient = __commonJS({
   }
 });
 
-// .yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/index.js
+// .yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/index.js
 var require_build = __commonJS({
-  ".yarn/cache/socks-npm-2.7.1-17f2b53052-a8026d6abf.zip/node_modules/socks/build/index.js"(exports) {
+  ".yarn/cache/socks-npm-2.7.1-17f2b53052-43f69dbc9f.zip/node_modules/socks/build/index.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -8880,9 +8885,9 @@ var require_build = __commonJS({
   }
 });
 
-// .yarn/cache/socks-proxy-agent-npm-8.0.1-646f00d0a1-6df7fae19f.zip/node_modules/socks-proxy-agent/dist/index.js
+// .yarn/cache/socks-proxy-agent-npm-8.0.1-646f00d0a1-3971e6af57.zip/node_modules/socks-proxy-agent/dist/index.js
 var require_dist4 = __commonJS({
-  ".yarn/cache/socks-proxy-agent-npm-8.0.1-646f00d0a1-6df7fae19f.zip/node_modules/socks-proxy-agent/dist/index.js"(exports) {
+  ".yarn/cache/socks-proxy-agent-npm-8.0.1-646f00d0a1-3971e6af57.zip/node_modules/socks-proxy-agent/dist/index.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -9064,9 +9069,9 @@ var require_dist4 = __commonJS({
   }
 });
 
-// .yarn/cache/data-uri-to-buffer-npm-5.0.1-a40e5ac026-ffb32d1944.zip/node_modules/data-uri-to-buffer/dist/index.js
+// .yarn/cache/data-uri-to-buffer-npm-5.0.1-a40e5ac026-08ad2f2cd5.zip/node_modules/data-uri-to-buffer/dist/index.js
 var require_dist5 = __commonJS({
-  ".yarn/cache/data-uri-to-buffer-npm-5.0.1-a40e5ac026-ffb32d1944.zip/node_modules/data-uri-to-buffer/dist/index.js"(exports) {
+  ".yarn/cache/data-uri-to-buffer-npm-5.0.1-a40e5ac026-08ad2f2cd5.zip/node_modules/data-uri-to-buffer/dist/index.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.dataUriToBuffer = void 0;
@@ -9111,9 +9116,9 @@ var require_dist5 = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/notmodified.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/notmodified.js
 var require_notmodified = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/notmodified.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/notmodified.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var NotModifiedError = class extends Error {
@@ -9126,9 +9131,9 @@ var require_notmodified = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/data.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/data.js
 var require_data = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/data.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/data.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -9167,9 +9172,9 @@ var require_data = __commonJS({
   }
 });
 
-// .yarn/cache/universalify-npm-0.1.2-9b22d31d2d-056559913f.zip/node_modules/universalify/index.js
+// .yarn/cache/universalify-npm-0.1.2-9b22d31d2d-e70e0339f6.zip/node_modules/universalify/index.js
 var require_universalify = __commonJS({
-  ".yarn/cache/universalify-npm-0.1.2-9b22d31d2d-056559913f.zip/node_modules/universalify/index.js"(exports) {
+  ".yarn/cache/universalify-npm-0.1.2-9b22d31d2d-e70e0339f6.zip/node_modules/universalify/index.js"(exports) {
     "use strict";
     exports.fromCallback = function(fn2) {
       return Object.defineProperty(function() {
@@ -9200,9 +9205,9 @@ var require_universalify = __commonJS({
   }
 });
 
-// .yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-0228fc1080.zip/node_modules/graceful-fs/polyfills.js
+// .yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-386d011a55.zip/node_modules/graceful-fs/polyfills.js
 var require_polyfills = __commonJS({
-  ".yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-0228fc1080.zip/node_modules/graceful-fs/polyfills.js"(exports, module2) {
+  ".yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-386d011a55.zip/node_modules/graceful-fs/polyfills.js"(exports, module2) {
     var constants = require("constants");
     var origCwd = process.cwd;
     var cwd = null;
@@ -9516,9 +9521,9 @@ var require_polyfills = __commonJS({
   }
 });
 
-// .yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-0228fc1080.zip/node_modules/graceful-fs/legacy-streams.js
+// .yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-386d011a55.zip/node_modules/graceful-fs/legacy-streams.js
 var require_legacy_streams = __commonJS({
-  ".yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-0228fc1080.zip/node_modules/graceful-fs/legacy-streams.js"(exports, module2) {
+  ".yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-386d011a55.zip/node_modules/graceful-fs/legacy-streams.js"(exports, module2) {
     var Stream = require("stream").Stream;
     module2.exports = legacy;
     function legacy(fs8) {
@@ -9615,9 +9620,9 @@ var require_legacy_streams = __commonJS({
   }
 });
 
-// .yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-0228fc1080.zip/node_modules/graceful-fs/clone.js
+// .yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-386d011a55.zip/node_modules/graceful-fs/clone.js
 var require_clone = __commonJS({
-  ".yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-0228fc1080.zip/node_modules/graceful-fs/clone.js"(exports, module2) {
+  ".yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-386d011a55.zip/node_modules/graceful-fs/clone.js"(exports, module2) {
     "use strict";
     module2.exports = clone;
     var getPrototypeOf = Object.getPrototypeOf || function(obj) {
@@ -9638,9 +9643,9 @@ var require_clone = __commonJS({
   }
 });
 
-// .yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-0228fc1080.zip/node_modules/graceful-fs/graceful-fs.js
+// .yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-386d011a55.zip/node_modules/graceful-fs/graceful-fs.js
 var require_graceful_fs = __commonJS({
-  ".yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-0228fc1080.zip/node_modules/graceful-fs/graceful-fs.js"(exports, module2) {
+  ".yarn/cache/graceful-fs-npm-4.2.11-24bb648a68-386d011a55.zip/node_modules/graceful-fs/graceful-fs.js"(exports, module2) {
     var fs8 = require("fs");
     var polyfills = require_polyfills();
     var legacy = require_legacy_streams();
@@ -10008,9 +10013,9 @@ var require_graceful_fs = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/fs/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/fs/index.js
 var require_fs = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/fs/index.js"(exports) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/fs/index.js"(exports) {
     "use strict";
     var u = require_universalify().fromCallback;
     var fs8 = require_graceful_fs();
@@ -10097,9 +10102,9 @@ var require_fs = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/mkdirs/win32.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/mkdirs/win32.js
 var require_win32 = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/mkdirs/win32.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/mkdirs/win32.js"(exports, module2) {
     "use strict";
     var path10 = require("path");
     function getRootPath(p) {
@@ -10121,9 +10126,9 @@ var require_win32 = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/mkdirs/mkdirs.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/mkdirs/mkdirs.js
 var require_mkdirs = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/mkdirs/mkdirs.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/mkdirs/mkdirs.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -10182,9 +10187,9 @@ var require_mkdirs = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/mkdirs/mkdirs-sync.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/mkdirs/mkdirs-sync.js
 var require_mkdirs_sync = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/mkdirs/mkdirs-sync.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/mkdirs/mkdirs-sync.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -10233,9 +10238,9 @@ var require_mkdirs_sync = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/mkdirs/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/mkdirs/index.js
 var require_mkdirs2 = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/mkdirs/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/mkdirs/index.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var mkdirs = u(require_mkdirs());
@@ -10252,9 +10257,9 @@ var require_mkdirs2 = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/util/utimes.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/util/utimes.js
 var require_utimes = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/util/utimes.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/util/utimes.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var os3 = require("os");
@@ -10331,9 +10336,9 @@ var require_utimes = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/util/stat.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/util/stat.js
 var require_stat = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/util/stat.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/util/stat.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -10502,9 +10507,9 @@ var require_stat = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/util/buffer.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/util/buffer.js
 var require_buffer = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/util/buffer.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/util/buffer.js"(exports, module2) {
     "use strict";
     module2.exports = function(size) {
       if (typeof Buffer.allocUnsafe === "function") {
@@ -10519,9 +10524,9 @@ var require_buffer = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/copy-sync/copy-sync.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/copy-sync/copy-sync.js
 var require_copy_sync = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/copy-sync/copy-sync.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/copy-sync/copy-sync.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -10665,9 +10670,9 @@ var require_copy_sync = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/copy-sync/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/copy-sync/index.js
 var require_copy_sync2 = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/copy-sync/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/copy-sync/index.js"(exports, module2) {
     "use strict";
     module2.exports = {
       copySync: require_copy_sync()
@@ -10675,9 +10680,9 @@ var require_copy_sync2 = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/path-exists/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/path-exists/index.js
 var require_path_exists = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/path-exists/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/path-exists/index.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromPromise;
     var fs8 = require_fs();
@@ -10691,9 +10696,9 @@ var require_path_exists = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/copy/copy.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/copy/copy.js
 var require_copy = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/copy/copy.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/copy/copy.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -10901,9 +10906,9 @@ var require_copy = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/copy/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/copy/index.js
 var require_copy2 = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/copy/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/copy/index.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     module2.exports = {
@@ -10912,9 +10917,9 @@ var require_copy2 = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/remove/rimraf.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/remove/rimraf.js
 var require_rimraf = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/remove/rimraf.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/remove/rimraf.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -11163,9 +11168,9 @@ var require_rimraf = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/remove/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/remove/index.js
 var require_remove = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/remove/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/remove/index.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var rimraf2 = require_rimraf();
@@ -11176,9 +11181,9 @@ var require_remove = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/empty/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/empty/index.js
 var require_empty = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/empty/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/empty/index.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var fs8 = require_graceful_fs();
@@ -11226,9 +11231,9 @@ var require_empty = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/file.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/file.js
 var require_file = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/file.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/file.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var path10 = require("path");
@@ -11281,9 +11286,9 @@ var require_file = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/link.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/link.js
 var require_link = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/link.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/link.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var path10 = require("path");
@@ -11347,9 +11352,9 @@ var require_link = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/symlink-paths.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/symlink-paths.js
 var require_symlink_paths = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/symlink-paths.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/symlink-paths.js"(exports, module2) {
     "use strict";
     var path10 = require("path");
     var fs8 = require_graceful_fs();
@@ -11429,9 +11434,9 @@ var require_symlink_paths = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/symlink-type.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/symlink-type.js
 var require_symlink_type = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/symlink-type.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/symlink-type.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     function symlinkType(srcpath, type, callback) {
@@ -11464,9 +11469,9 @@ var require_symlink_type = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/symlink.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/symlink.js
 var require_symlink = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/symlink.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/symlink.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var path10 = require("path");
@@ -11533,9 +11538,9 @@ var require_symlink = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/index.js
 var require_ensure = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/ensure/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/ensure/index.js"(exports, module2) {
     "use strict";
     var file = require_file();
     var link = require_link();
@@ -11560,9 +11565,9 @@ var require_ensure = __commonJS({
   }
 });
 
-// .yarn/cache/jsonfile-npm-4.0.0-10ce3aea15-d85d544514.zip/node_modules/jsonfile/index.js
+// .yarn/cache/jsonfile-npm-4.0.0-10ce3aea15-7dc94b628d.zip/node_modules/jsonfile/index.js
 var require_jsonfile = __commonJS({
-  ".yarn/cache/jsonfile-npm-4.0.0-10ce3aea15-d85d544514.zip/node_modules/jsonfile/index.js"(exports, module2) {
+  ".yarn/cache/jsonfile-npm-4.0.0-10ce3aea15-7dc94b628d.zip/node_modules/jsonfile/index.js"(exports, module2) {
     var _fs;
     try {
       _fs = require_graceful_fs();
@@ -11677,9 +11682,9 @@ var require_jsonfile = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/json/jsonfile.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/json/jsonfile.js
 var require_jsonfile2 = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/json/jsonfile.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/json/jsonfile.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var jsonFile = require_jsonfile();
@@ -11693,9 +11698,9 @@ var require_jsonfile2 = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/json/output-json.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/json/output-json.js
 var require_output_json = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/json/output-json.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/json/output-json.js"(exports, module2) {
     "use strict";
     var path10 = require("path");
     var mkdir4 = require_mkdirs2();
@@ -11723,9 +11728,9 @@ var require_output_json = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/json/output-json-sync.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/json/output-json-sync.js
 var require_output_json_sync = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/json/output-json-sync.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/json/output-json-sync.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -11742,9 +11747,9 @@ var require_output_json_sync = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/json/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/json/index.js
 var require_json = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/json/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/json/index.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var jsonFile = require_jsonfile2();
@@ -11760,9 +11765,9 @@ var require_json = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/move-sync/move-sync.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/move-sync/move-sync.js
 var require_move_sync = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/move-sync/move-sync.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/move-sync/move-sync.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -11808,9 +11813,9 @@ var require_move_sync = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/move-sync/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/move-sync/index.js
 var require_move_sync2 = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/move-sync/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/move-sync/index.js"(exports, module2) {
     "use strict";
     module2.exports = {
       moveSync: require_move_sync()
@@ -11818,9 +11823,9 @@ var require_move_sync2 = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/move/move.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/move/move.js
 var require_move = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/move/move.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/move/move.js"(exports, module2) {
     "use strict";
     var fs8 = require_graceful_fs();
     var path10 = require("path");
@@ -11890,9 +11895,9 @@ var require_move = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/move/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/move/index.js
 var require_move2 = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/move/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/move/index.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     module2.exports = {
@@ -11901,9 +11906,9 @@ var require_move2 = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/output/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/output/index.js
 var require_output = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/output/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/output/index.js"(exports, module2) {
     "use strict";
     var u = require_universalify().fromCallback;
     var fs8 = require_graceful_fs();
@@ -11943,9 +11948,9 @@ var require_output = __commonJS({
   }
 });
 
-// .yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/index.js
+// .yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/index.js
 var require_lib = __commonJS({
-  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-cfdc1f2b8d.zip/node_modules/fs-extra/lib/index.js"(exports, module2) {
+  ".yarn/cache/fs-extra-npm-8.1.0-197473387f-259f7b814d.zip/node_modules/fs-extra/lib/index.js"(exports, module2) {
     "use strict";
     module2.exports = Object.assign(
       {},
@@ -11975,9 +11980,9 @@ var require_lib = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/notfound.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/notfound.js
 var require_notfound = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/notfound.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/notfound.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var NotFoundError = class extends Error {
@@ -11990,9 +11995,9 @@ var require_notfound = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/file.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/file.js
 var require_file2 = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/file.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/file.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -12042,9 +12047,9 @@ var require_file2 = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseControlResponse.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseControlResponse.js
 var require_parseControlResponse = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseControlResponse.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseControlResponse.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.positiveIntermediate = exports.positiveCompletion = exports.isMultiline = exports.isSingleLine = exports.parseControlResponse = void 0;
@@ -12095,9 +12100,9 @@ var require_parseControlResponse = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/FtpContext.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/FtpContext.js
 var require_FtpContext = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/FtpContext.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/FtpContext.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.FTPContext = exports.FTPError = void 0;
@@ -12414,9 +12419,9 @@ Closing reason: ${this._closingError.stack}`;
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/FileInfo.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/FileInfo.js
 var require_FileInfo = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/FileInfo.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/FileInfo.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.FileInfo = exports.FileType = void 0;
@@ -12471,9 +12476,9 @@ var require_FileInfo = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseListDOS.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseListDOS.js
 var require_parseListDOS = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseListDOS.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseListDOS.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.transformList = exports.parseLine = exports.testLine = void 0;
@@ -12515,9 +12520,9 @@ var require_parseListDOS = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseListUnix.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseListUnix.js
 var require_parseListUnix = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseListUnix.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseListUnix.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.transformList = exports.parseLine = exports.testLine = void 0;
@@ -12602,9 +12607,9 @@ var require_parseListUnix = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseListMLSD.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseListMLSD.js
 var require_parseListMLSD = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseListMLSD.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseListMLSD.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.parseMLSxDate = exports.transformList = exports.parseLine = exports.testLine = void 0;
@@ -12764,9 +12769,9 @@ var require_parseListMLSD = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseList.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseList.js
 var require_parseList = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/parseList.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/parseList.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -12838,9 +12843,9 @@ var require_parseList = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/ProgressTracker.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/ProgressTracker.js
 var require_ProgressTracker = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/ProgressTracker.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/ProgressTracker.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.ProgressTracker = void 0;
@@ -12909,9 +12914,9 @@ var require_ProgressTracker = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/StringWriter.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/StringWriter.js
 var require_StringWriter = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/StringWriter.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/StringWriter.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.StringWriter = void 0;
@@ -12937,9 +12942,9 @@ var require_StringWriter = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/netUtils.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/netUtils.js
 var require_netUtils = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/netUtils.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/netUtils.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.ipIsPrivateV4Address = exports.upgradeSocket = exports.describeAddress = exports.describeTLS = void 0;
@@ -12989,9 +12994,9 @@ var require_netUtils = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/transfer.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/transfer.js
 var require_transfer = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/transfer.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/transfer.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.downloadTo = exports.uploadFrom = exports.connectForPassiveTransfer = exports.parsePasvResponse = exports.enterPassiveModeIPv4 = exports.parseEpsvResponse = exports.enterPassiveModeIPv6 = void 0;
@@ -13228,9 +13233,9 @@ var require_transfer = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/Client.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/Client.js
 var require_Client = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/Client.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/Client.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.Client = void 0;
@@ -13947,17 +13952,17 @@ var require_Client = __commonJS({
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/StringEncoding.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/StringEncoding.js
 var require_StringEncoding = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/StringEncoding.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/StringEncoding.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
   }
 });
 
-// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/index.js
+// .yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/index.js
 var require_dist6 = __commonJS({
-  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-3d085eaea5.zip/node_modules/basic-ftp/dist/index.js"(exports) {
+  ".yarn/cache/basic-ftp-npm-5.0.3-95a5b33162-2b960ea976.zip/node_modules/basic-ftp/dist/index.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -13996,9 +14001,9 @@ var require_dist6 = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/ftp.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/ftp.js
 var require_ftp = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/ftp.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/ftp.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -14077,9 +14082,9 @@ var require_ftp = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/http-error.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/http-error.js
 var require_http_error = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/http-error.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/http-error.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var http_1 = require("http");
@@ -14094,9 +14099,9 @@ var require_http_error = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/http.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/http.js
 var require_http = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/http.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/http.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -14247,9 +14252,9 @@ var require_http = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/https.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/https.js
 var require_https = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/https.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/https.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -14265,9 +14270,9 @@ var require_https = __commonJS({
   }
 });
 
-// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/index.js
+// .yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/index.js
 var require_dist7 = __commonJS({
-  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-ffa2b3377c.zip/node_modules/get-uri/dist/index.js"(exports) {
+  ".yarn/cache/get-uri-npm-6.0.1-d4f0bb7365-dde1cd2fa7.zip/node_modules/get-uri/dist/index.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -14310,9 +14315,9 @@ var require_dist7 = __commonJS({
   }
 });
 
-// .yarn/cache/estraverse-npm-4.3.0-920a32f3c6-befc0287c3.zip/node_modules/estraverse/package.json
+// .yarn/cache/estraverse-npm-4.3.0-920a32f3c6-9cb46463ef.zip/node_modules/estraverse/package.json
 var require_package = __commonJS({
-  ".yarn/cache/estraverse-npm-4.3.0-920a32f3c6-befc0287c3.zip/node_modules/estraverse/package.json"(exports, module2) {
+  ".yarn/cache/estraverse-npm-4.3.0-920a32f3c6-9cb46463ef.zip/node_modules/estraverse/package.json"(exports, module2) {
     module2.exports = {
       name: "estraverse",
       description: "ECMAScript JS AST traversal functions",
@@ -14356,9 +14361,9 @@ var require_package = __commonJS({
   }
 });
 
-// .yarn/cache/estraverse-npm-4.3.0-920a32f3c6-befc0287c3.zip/node_modules/estraverse/estraverse.js
+// .yarn/cache/estraverse-npm-4.3.0-920a32f3c6-9cb46463ef.zip/node_modules/estraverse/estraverse.js
 var require_estraverse = __commonJS({
-  ".yarn/cache/estraverse-npm-4.3.0-920a32f3c6-befc0287c3.zip/node_modules/estraverse/estraverse.js"(exports) {
+  ".yarn/cache/estraverse-npm-4.3.0-920a32f3c6-9cb46463ef.zip/node_modules/estraverse/estraverse.js"(exports) {
     (function clone(exports2) {
       "use strict";
       var Syntax, VisitorOption, VisitorKeys, BREAK, SKIP, REMOVE;
@@ -14953,9 +14958,9 @@ var require_estraverse = __commonJS({
   }
 });
 
-// .yarn/cache/esutils-npm-2.0.3-f865beafd5-179e017b58.zip/node_modules/esutils/lib/ast.js
+// .yarn/cache/esutils-npm-2.0.3-f865beafd5-9a2fe69a41.zip/node_modules/esutils/lib/ast.js
 var require_ast = __commonJS({
-  ".yarn/cache/esutils-npm-2.0.3-f865beafd5-179e017b58.zip/node_modules/esutils/lib/ast.js"(exports, module2) {
+  ".yarn/cache/esutils-npm-2.0.3-f865beafd5-9a2fe69a41.zip/node_modules/esutils/lib/ast.js"(exports, module2) {
     (function() {
       "use strict";
       function isExpression(node) {
@@ -15073,9 +15078,9 @@ var require_ast = __commonJS({
   }
 });
 
-// .yarn/cache/esutils-npm-2.0.3-f865beafd5-179e017b58.zip/node_modules/esutils/lib/code.js
+// .yarn/cache/esutils-npm-2.0.3-f865beafd5-9a2fe69a41.zip/node_modules/esutils/lib/code.js
 var require_code = __commonJS({
-  ".yarn/cache/esutils-npm-2.0.3-f865beafd5-179e017b58.zip/node_modules/esutils/lib/code.js"(exports, module2) {
+  ".yarn/cache/esutils-npm-2.0.3-f865beafd5-9a2fe69a41.zip/node_modules/esutils/lib/code.js"(exports, module2) {
     (function() {
       "use strict";
       var ES6Regex, ES5Regex, NON_ASCII_WHITESPACES, IDENTIFIER_START, IDENTIFIER_PART, ch;
@@ -15174,9 +15179,9 @@ var require_code = __commonJS({
   }
 });
 
-// .yarn/cache/esutils-npm-2.0.3-f865beafd5-179e017b58.zip/node_modules/esutils/lib/keyword.js
+// .yarn/cache/esutils-npm-2.0.3-f865beafd5-9a2fe69a41.zip/node_modules/esutils/lib/keyword.js
 var require_keyword = __commonJS({
-  ".yarn/cache/esutils-npm-2.0.3-f865beafd5-179e017b58.zip/node_modules/esutils/lib/keyword.js"(exports, module2) {
+  ".yarn/cache/esutils-npm-2.0.3-f865beafd5-9a2fe69a41.zip/node_modules/esutils/lib/keyword.js"(exports, module2) {
     (function() {
       "use strict";
       var code = require_code();
@@ -15302,9 +15307,9 @@ var require_keyword = __commonJS({
   }
 });
 
-// .yarn/cache/esutils-npm-2.0.3-f865beafd5-179e017b58.zip/node_modules/esutils/lib/utils.js
+// .yarn/cache/esutils-npm-2.0.3-f865beafd5-9a2fe69a41.zip/node_modules/esutils/lib/utils.js
 var require_utils2 = __commonJS({
-  ".yarn/cache/esutils-npm-2.0.3-f865beafd5-179e017b58.zip/node_modules/esutils/lib/utils.js"(exports) {
+  ".yarn/cache/esutils-npm-2.0.3-f865beafd5-9a2fe69a41.zip/node_modules/esutils/lib/utils.js"(exports) {
     (function() {
       "use strict";
       exports.ast = require_ast();
@@ -15314,9 +15319,9 @@ var require_utils2 = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/base64.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/base64.js
 var require_base64 = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/base64.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/base64.js"(exports) {
     var intToCharMap = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".split("");
     exports.encode = function(number) {
       if (0 <= number && number < intToCharMap.length) {
@@ -15355,9 +15360,9 @@ var require_base64 = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/base64-vlq.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/base64-vlq.js
 var require_base64_vlq = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/base64-vlq.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/base64-vlq.js"(exports) {
     var base64 = require_base64();
     var VLQ_BASE_SHIFT = 5;
     var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
@@ -15409,9 +15414,9 @@ var require_base64_vlq = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/util.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/util.js
 var require_util2 = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/util.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/util.js"(exports) {
     function getArg(aArgs, aName, aDefaultValue) {
       if (aName in aArgs) {
         return aArgs[aName];
@@ -15710,9 +15715,9 @@ var require_util2 = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/array-set.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/array-set.js
 var require_array_set = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/array-set.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/array-set.js"(exports) {
     var util = require_util2();
     var has = Object.prototype.hasOwnProperty;
     var hasNativeMap = typeof Map !== "undefined";
@@ -15780,9 +15785,9 @@ var require_array_set = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/mapping-list.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/mapping-list.js
 var require_mapping_list = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/mapping-list.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/mapping-list.js"(exports) {
     var util = require_util2();
     function generatedPositionAfter(mappingA, mappingB) {
       var lineA = mappingA.generatedLine;
@@ -15819,9 +15824,9 @@ var require_mapping_list = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/source-map-generator.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/source-map-generator.js
 var require_source_map_generator = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/source-map-generator.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/source-map-generator.js"(exports) {
     var base64VLQ = require_base64_vlq();
     var util = require_util2();
     var ArraySet = require_array_set().ArraySet;
@@ -16095,9 +16100,9 @@ var require_source_map_generator = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/binary-search.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/binary-search.js
 var require_binary_search = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/binary-search.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/binary-search.js"(exports) {
     exports.GREATEST_LOWER_BOUND = 1;
     exports.LEAST_UPPER_BOUND = 2;
     function recursiveSearch(aLow, aHigh, aNeedle, aHaystack, aCompare, aBias) {
@@ -16151,9 +16156,9 @@ var require_binary_search = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/quick-sort.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/quick-sort.js
 var require_quick_sort = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/quick-sort.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/quick-sort.js"(exports) {
     function swap(ary, x, y) {
       var temp = ary[x];
       ary[x] = ary[y];
@@ -16186,9 +16191,9 @@ var require_quick_sort = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/source-map-consumer.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/source-map-consumer.js
 var require_source_map_consumer = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/source-map-consumer.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/source-map-consumer.js"(exports) {
     var util = require_util2();
     var binarySearch = require_binary_search();
     var ArraySet = require_array_set().ArraySet;
@@ -16787,9 +16792,9 @@ var require_source_map_consumer = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/source-node.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/source-node.js
 var require_source_node = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/lib/source-node.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/lib/source-node.js"(exports) {
     var SourceMapGenerator = require_source_map_generator().SourceMapGenerator;
     var util = require_util2();
     var REGEX_NEWLINE = /(\r?\n)/;
@@ -17053,18 +17058,18 @@ var require_source_node = __commonJS({
   }
 });
 
-// .yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/source-map.js
+// .yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/source-map.js
 var require_source_map = __commonJS({
-  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-cba9f44c3a.zip/node_modules/source-map/source-map.js"(exports) {
+  ".yarn/cache/source-map-npm-0.6.1-1a3621db16-ab55398007.zip/node_modules/source-map/source-map.js"(exports) {
     exports.SourceMapGenerator = require_source_map_generator().SourceMapGenerator;
     exports.SourceMapConsumer = require_source_map_consumer().SourceMapConsumer;
     exports.SourceNode = require_source_node().SourceNode;
   }
 });
 
-// .yarn/cache/escodegen-npm-1.14.3-a4dedc6eeb-14769d3458.zip/node_modules/escodegen/package.json
+// .yarn/cache/escodegen-npm-1.14.3-a4dedc6eeb-30d337803e.zip/node_modules/escodegen/package.json
 var require_package2 = __commonJS({
-  ".yarn/cache/escodegen-npm-1.14.3-a4dedc6eeb-14769d3458.zip/node_modules/escodegen/package.json"(exports, module2) {
+  ".yarn/cache/escodegen-npm-1.14.3-a4dedc6eeb-30d337803e.zip/node_modules/escodegen/package.json"(exports, module2) {
     module2.exports = {
       name: "escodegen",
       description: "ECMAScript code generator",
@@ -17129,9 +17134,9 @@ var require_package2 = __commonJS({
   }
 });
 
-// .yarn/cache/escodegen-npm-1.14.3-a4dedc6eeb-14769d3458.zip/node_modules/escodegen/escodegen.js
+// .yarn/cache/escodegen-npm-1.14.3-a4dedc6eeb-30d337803e.zip/node_modules/escodegen/escodegen.js
 var require_escodegen = __commonJS({
-  ".yarn/cache/escodegen-npm-1.14.3-a4dedc6eeb-14769d3458.zip/node_modules/escodegen/escodegen.js"(exports) {
+  ".yarn/cache/escodegen-npm-1.14.3-a4dedc6eeb-30d337803e.zip/node_modules/escodegen/escodegen.js"(exports) {
     (function() {
       "use strict";
       var Syntax, Precedence, BinaryPrecedence, SourceNode, estraverse, esutils, base, indent, json, renumber, hexadecimal, quotes, escapeless, newline, space, parentheses, semicolons, safeConcatenation, directive, extra, parse, sourceMap, sourceCode, preserveBlankLines, FORMAT_MINIFY, FORMAT_DEFAULTS;
@@ -19185,9 +19190,9 @@ var require_escodegen = __commonJS({
   }
 });
 
-// .yarn/cache/esprima-npm-4.0.1-1084e98778-08b3015538.zip/node_modules/esprima/dist/esprima.js
+// .yarn/cache/esprima-npm-4.0.1-1084e98778-ad4bab9ead.zip/node_modules/esprima/dist/esprima.js
 var require_esprima = __commonJS({
-  ".yarn/cache/esprima-npm-4.0.1-1084e98778-08b3015538.zip/node_modules/esprima/dist/esprima.js"(exports, module2) {
+  ".yarn/cache/esprima-npm-4.0.1-1084e98778-ad4bab9ead.zip/node_modules/esprima/dist/esprima.js"(exports, module2) {
     (function webpackUniversalModuleDefinition(root, factory) {
       if (typeof exports === "object" && typeof module2 === "object")
         module2.exports = factory();
@@ -25421,7 +25426,7 @@ var require_esprima = __commonJS({
   }
 });
 
-// .yarn/cache/tslib-npm-2.6.0-4d336a6824-702dfe42c8.zip/node_modules/tslib/tslib.es6.mjs
+// .yarn/cache/tslib-npm-2.6.0-4d336a6824-8d18020a8b.zip/node_modules/tslib/tslib.es6.mjs
 var tslib_es6_exports = {};
 __export(tslib_es6_exports, {
   __addDisposableResource: () => __addDisposableResource,
@@ -25888,7 +25893,7 @@ function __disposeResources(env2) {
 }
 var extendStatics, __assign, __createBinding, __setModuleDefault, _SuppressedError, tslib_es6_default;
 var init_tslib_es6 = __esm({
-  ".yarn/cache/tslib-npm-2.6.0-4d336a6824-702dfe42c8.zip/node_modules/tslib/tslib.es6.mjs"() {
+  ".yarn/cache/tslib-npm-2.6.0-4d336a6824-8d18020a8b.zip/node_modules/tslib/tslib.es6.mjs"() {
     extendStatics = function(d, b) {
       extendStatics = Object.setPrototypeOf || { __proto__: [] } instanceof Array && function(d2, b2) {
         d2.__proto__ = b2;
@@ -25967,9 +25972,9 @@ var init_tslib_es6 = __esm({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/types.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/types.js
 var require_types = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/types.js"(exports) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/types.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.Def = void 0;
@@ -26652,9 +26657,9 @@ var require_types = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/path.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/path.js
 var require_path = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/path.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/path.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -26955,9 +26960,9 @@ var require_path = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/scope.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/scope.js
 var require_scope = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/scope.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/scope.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -27217,9 +27222,9 @@ var require_scope = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/node-path.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/node-path.js
 var require_node_path = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/node-path.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/node-path.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -27572,9 +27577,9 @@ var require_node_path = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/path-visitor.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/path-visitor.js
 var require_path_visitor = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/path-visitor.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/path-visitor.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -27866,9 +27871,9 @@ var require_path_visitor = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/equiv.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/equiv.js
 var require_equiv = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/equiv.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/equiv.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28017,9 +28022,9 @@ var require_equiv = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/fork.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/fork.js
 var require_fork = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/fork.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/fork.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28075,9 +28080,9 @@ var require_fork = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/shared.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/shared.js
 var require_shared = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/lib/shared.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/lib/shared.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28136,9 +28141,9 @@ var require_shared = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/core.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/core.js
 var require_core = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/core.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/core.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28266,9 +28271,9 @@ var require_core = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/es6.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/es6.js
 var require_es6 = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/es6.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/es6.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28331,9 +28336,9 @@ var require_es6 = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/es7.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/es7.js
 var require_es7 = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/es7.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/es7.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28358,9 +28363,9 @@ var require_es7 = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/es2020.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/es2020.js
 var require_es2020 = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/es2020.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/es2020.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28377,9 +28382,9 @@ var require_es2020 = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/jsx.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/jsx.js
 var require_jsx = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/jsx.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/jsx.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28442,9 +28447,9 @@ var require_jsx = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/type-annotations.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/type-annotations.js
 var require_type_annotations = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/type-annotations.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/type-annotations.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28473,9 +28478,9 @@ var require_type_annotations = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/flow.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/flow.js
 var require_flow = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/flow.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/flow.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28569,9 +28574,9 @@ var require_flow = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/esprima.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/esprima.js
 var require_esprima2 = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/esprima.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/esprima.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28628,9 +28633,9 @@ var require_esprima2 = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/babel-core.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/babel-core.js
 var require_babel_core = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/babel-core.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/babel-core.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28752,9 +28757,9 @@ var require_babel_core = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/babel.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/babel.js
 var require_babel = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/babel.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/babel.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28769,9 +28774,9 @@ var require_babel = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/typescript.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/typescript.js
 var require_typescript = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/typescript.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/typescript.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28928,9 +28933,9 @@ var require_typescript = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/es-proposals.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/es-proposals.js
 var require_es_proposals = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/def/es-proposals.js"(exports, module2) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/def/es-proposals.js"(exports, module2) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var tslib_1 = (init_tslib_es6(), __toCommonJS(tslib_es6_exports));
@@ -28955,9 +28960,9 @@ var require_es_proposals = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/gen/namedTypes.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/gen/namedTypes.js
 var require_namedTypes = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/gen/namedTypes.js"(exports) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/gen/namedTypes.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.namedTypes = void 0;
@@ -28967,9 +28972,9 @@ var require_namedTypes = __commonJS({
   }
 });
 
-// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/main.js
+// .yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/main.js
 var require_main = __commonJS({
-  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-bb0eb8a85e.zip/node_modules/ast-types/main.js"(exports) {
+  ".yarn/cache/ast-types-npm-0.13.4-69f7e68df8-3a1a409764.zip/node_modules/ast-types/main.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.visit = exports.use = exports.Type = exports.someField = exports.PathVisitor = exports.Path = exports.NodePath = exports.namedTypes = exports.getSupertypeNames = exports.getFieldValue = exports.getFieldNames = exports.getBuilderName = exports.finalize = exports.eachField = exports.defineMethod = exports.builtInTypes = exports.builders = exports.astNodesAreEquivalent = void 0;
@@ -29057,9 +29062,9 @@ var require_vm2 = __commonJS({
   }
 });
 
-// .yarn/cache/degenerator-npm-4.0.4-1f9c4b67eb-105bd28952.zip/node_modules/degenerator/dist/index.js
+// .yarn/cache/degenerator-npm-4.0.4-1f9c4b67eb-c859071a75.zip/node_modules/degenerator/dist/index.js
 var require_dist8 = __commonJS({
-  ".yarn/cache/degenerator-npm-4.0.4-1f9c4b67eb-105bd28952.zip/node_modules/degenerator/dist/index.js"(exports) {
+  ".yarn/cache/degenerator-npm-4.0.4-1f9c4b67eb-c859071a75.zip/node_modules/degenerator/dist/index.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.compile = exports.degenerator = void 0;
@@ -29201,9 +29206,9 @@ var require_dist8 = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/dateRange.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/dateRange.js
 var require_dateRange = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/dateRange.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/dateRange.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     function dateRange() {
@@ -29213,9 +29218,9 @@ var require_dateRange = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/dnsDomainIs.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/dnsDomainIs.js
 var require_dnsDomainIs = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/dnsDomainIs.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/dnsDomainIs.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     function dnsDomainIs(host, domain) {
@@ -29227,9 +29232,9 @@ var require_dnsDomainIs = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/dnsDomainLevels.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/dnsDomainLevels.js
 var require_dnsDomainLevels = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/dnsDomainLevels.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/dnsDomainLevels.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     function dnsDomainLevels(host) {
@@ -29244,9 +29249,9 @@ var require_dnsDomainLevels = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/util.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/util.js
 var require_util3 = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/util.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/util.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     exports.isGMT = exports.dnsLookup = void 0;
@@ -29270,9 +29275,9 @@ var require_util3 = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/dnsResolve.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/dnsResolve.js
 var require_dnsResolve = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/dnsResolve.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/dnsResolve.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var util_1 = require_util3();
@@ -29291,9 +29296,9 @@ var require_dnsResolve = __commonJS({
   }
 });
 
-// .yarn/cache/netmask-npm-2.0.2-2299510a4d-ba4edae75a.zip/node_modules/netmask/lib/netmask.js
+// .yarn/cache/netmask-npm-2.0.2-2299510a4d-cafd28388e.zip/node_modules/netmask/lib/netmask.js
 var require_netmask = __commonJS({
-  ".yarn/cache/netmask-npm-2.0.2-2299510a4d-ba4edae75a.zip/node_modules/netmask/lib/netmask.js"(exports) {
+  ".yarn/cache/netmask-npm-2.0.2-2299510a4d-cafd28388e.zip/node_modules/netmask/lib/netmask.js"(exports) {
     (function() {
       var Netmask, atob, chr, chr0, chrA, chra, ip2long, long2ip;
       long2ip = function(long) {
@@ -29486,9 +29491,9 @@ var require_netmask = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/isInNet.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/isInNet.js
 var require_isInNet = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/isInNet.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/isInNet.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var netmask_1 = require_netmask();
@@ -29509,9 +29514,9 @@ var require_isInNet = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/isPlainHostName.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/isPlainHostName.js
 var require_isPlainHostName = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/isPlainHostName.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/isPlainHostName.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     function isPlainHostName(host) {
@@ -29521,9 +29526,9 @@ var require_isPlainHostName = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/isResolvable.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/isResolvable.js
 var require_isResolvable = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/isResolvable.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/isResolvable.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var util_1 = require_util3();
@@ -29541,9 +29546,9 @@ var require_isResolvable = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/localHostOrDomainIs.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/localHostOrDomainIs.js
 var require_localHostOrDomainIs = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/localHostOrDomainIs.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/localHostOrDomainIs.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     function localHostOrDomainIs(host, hostdom) {
@@ -29562,9 +29567,9 @@ var require_localHostOrDomainIs = __commonJS({
   }
 });
 
-// .yarn/cache/ip-npm-1.1.8-abea558b72-bb1850e7b6.zip/node_modules/ip/lib/ip.js
+// .yarn/cache/ip-npm-1.1.8-abea558b72-ab32a5ecfa.zip/node_modules/ip/lib/ip.js
 var require_ip2 = __commonJS({
-  ".yarn/cache/ip-npm-1.1.8-abea558b72-bb1850e7b6.zip/node_modules/ip/lib/ip.js"(exports) {
+  ".yarn/cache/ip-npm-1.1.8-abea558b72-ab32a5ecfa.zip/node_modules/ip/lib/ip.js"(exports) {
     var ip = exports;
     var { Buffer: Buffer2 } = require("buffer");
     var os3 = require("os");
@@ -29868,9 +29873,9 @@ var require_ip2 = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/myIpAddress.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/myIpAddress.js
 var require_myIpAddress = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/myIpAddress.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/myIpAddress.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -29903,9 +29908,9 @@ var require_myIpAddress = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/shExpMatch.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/shExpMatch.js
 var require_shExpMatch = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/shExpMatch.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/shExpMatch.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     function shExpMatch(str, shexp) {
@@ -29920,9 +29925,9 @@ var require_shExpMatch = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/timeRange.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/timeRange.js
 var require_timeRange = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/timeRange.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/timeRange.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     function timeRange() {
@@ -29967,9 +29972,9 @@ var require_timeRange = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/weekdayRange.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/weekdayRange.js
 var require_weekdayRange = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/weekdayRange.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/weekdayRange.js"(exports) {
     "use strict";
     Object.defineProperty(exports, "__esModule", { value: true });
     var util_1 = require_util3();
@@ -30015,9 +30020,9 @@ var require_weekdayRange = __commonJS({
   }
 });
 
-// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/index.js
+// .yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/index.js
 var require_dist9 = __commonJS({
-  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-e77d61b35d.zip/node_modules/pac-resolver/dist/index.js"(exports) {
+  ".yarn/cache/pac-resolver-npm-6.0.2-9e9298321a-7032496b35.zip/node_modules/pac-resolver/dist/index.js"(exports) {
     "use strict";
     var __importDefault2 = exports && exports.__importDefault || function(mod) {
       return mod && mod.__esModule ? mod : { "default": mod };
@@ -30092,9 +30097,9 @@ var require_dist9 = __commonJS({
   }
 });
 
-// .yarn/cache/pac-proxy-agent-npm-6.0.4-fab524db53-26e60ad16f.zip/node_modules/pac-proxy-agent/dist/index.js
+// .yarn/cache/pac-proxy-agent-npm-6.0.4-fab524db53-810aaaac1b.zip/node_modules/pac-proxy-agent/dist/index.js
 var require_dist10 = __commonJS({
-  ".yarn/cache/pac-proxy-agent-npm-6.0.4-fab524db53-26e60ad16f.zip/node_modules/pac-proxy-agent/dist/index.js"(exports) {
+  ".yarn/cache/pac-proxy-agent-npm-6.0.4-fab524db53-810aaaac1b.zip/node_modules/pac-proxy-agent/dist/index.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -30308,9 +30313,9 @@ var require_dist10 = __commonJS({
   }
 });
 
-// .yarn/cache/proxy-agent-npm-6.2.2-678133ab7b-481d168121.zip/node_modules/proxy-agent/dist/index.js
+// .yarn/cache/proxy-agent-npm-6.2.2-678133ab7b-51121cb190.zip/node_modules/proxy-agent/dist/index.js
 var require_dist11 = __commonJS({
-  ".yarn/cache/proxy-agent-npm-6.2.2-678133ab7b-481d168121.zip/node_modules/proxy-agent/dist/index.js"(exports) {
+  ".yarn/cache/proxy-agent-npm-6.2.2-678133ab7b-51121cb190.zip/node_modules/proxy-agent/dist/index.js"(exports) {
     "use strict";
     var __createBinding2 = exports && exports.__createBinding || (Object.create ? function(o, m, k, k2) {
       if (k2 === void 0)
@@ -30432,9 +30437,9 @@ var require_dist11 = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/high-level-opt.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/high-level-opt.js
 var require_high_level_opt = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/high-level-opt.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/high-level-opt.js"(exports, module2) {
     "use strict";
     var argmap = /* @__PURE__ */ new Map([
       ["C", "cwd"],
@@ -30464,9 +30469,9 @@ var require_high_level_opt = __commonJS({
   }
 });
 
-// .yarn/cache/minipass-npm-5.0.0-c64fb63c92-dac2e19609.zip/node_modules/minipass/index.js
+// .yarn/cache/minipass-npm-5.0.0-c64fb63c92-a91d8043f6.zip/node_modules/minipass/index.js
 var require_minipass = __commonJS({
-  ".yarn/cache/minipass-npm-5.0.0-c64fb63c92-dac2e19609.zip/node_modules/minipass/index.js"(exports) {
+  ".yarn/cache/minipass-npm-5.0.0-c64fb63c92-a91d8043f6.zip/node_modules/minipass/index.js"(exports) {
     "use strict";
     var proc = typeof process === "object" && process ? process : {
       stdout: null,
@@ -31071,9 +31076,9 @@ var require_minipass = __commonJS({
   }
 });
 
-// .yarn/cache/minizlib-npm-2.1.2-ea89cd0cfb-c0071edb24.zip/node_modules/minizlib/constants.js
+// .yarn/cache/minizlib-npm-2.1.2-ea89cd0cfb-64fae024e1.zip/node_modules/minizlib/constants.js
 var require_constants3 = __commonJS({
-  ".yarn/cache/minizlib-npm-2.1.2-ea89cd0cfb-c0071edb24.zip/node_modules/minizlib/constants.js"(exports, module2) {
+  ".yarn/cache/minizlib-npm-2.1.2-ea89cd0cfb-64fae024e1.zip/node_modules/minizlib/constants.js"(exports, module2) {
     var realZlibConstants = require("zlib").constants || /* istanbul ignore next */
     { ZLIB_VERNUM: 4736 };
     module2.exports = Object.freeze(Object.assign(/* @__PURE__ */ Object.create(null), {
@@ -31187,9 +31192,9 @@ var require_constants3 = __commonJS({
   }
 });
 
-// .yarn/cache/minipass-npm-3.3.6-b8d93a945b-9704cf677a.zip/node_modules/minipass/index.js
+// .yarn/cache/minipass-npm-3.3.6-b8d93a945b-a114746943.zip/node_modules/minipass/index.js
 var require_minipass2 = __commonJS({
-  ".yarn/cache/minipass-npm-3.3.6-b8d93a945b-9704cf677a.zip/node_modules/minipass/index.js"(exports, module2) {
+  ".yarn/cache/minipass-npm-3.3.6-b8d93a945b-a114746943.zip/node_modules/minipass/index.js"(exports, module2) {
     "use strict";
     var proc = typeof process === "object" && process ? process : {
       stdout: null,
@@ -31711,9 +31716,9 @@ var require_minipass2 = __commonJS({
   }
 });
 
-// .yarn/cache/minizlib-npm-2.1.2-ea89cd0cfb-c0071edb24.zip/node_modules/minizlib/index.js
+// .yarn/cache/minizlib-npm-2.1.2-ea89cd0cfb-64fae024e1.zip/node_modules/minizlib/index.js
 var require_minizlib = __commonJS({
-  ".yarn/cache/minizlib-npm-2.1.2-ea89cd0cfb-c0071edb24.zip/node_modules/minizlib/index.js"(exports) {
+  ".yarn/cache/minizlib-npm-2.1.2-ea89cd0cfb-64fae024e1.zip/node_modules/minizlib/index.js"(exports) {
     "use strict";
     var assert2 = require("assert");
     var Buffer2 = require("buffer").Buffer;
@@ -31975,17 +31980,17 @@ var require_minizlib = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/normalize-windows-path.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/normalize-windows-path.js
 var require_normalize_windows_path = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/normalize-windows-path.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/normalize-windows-path.js"(exports, module2) {
     var platform = process.env.TESTING_TAR_FAKE_PLATFORM || process.platform;
     module2.exports = platform !== "win32" ? (p) => p : (p) => p && p.replace(/\\/g, "/");
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/read-entry.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/read-entry.js
 var require_read_entry = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/read-entry.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/read-entry.js"(exports, module2) {
     "use strict";
     var { Minipass } = require_minipass();
     var normPath = require_normalize_windows_path();
@@ -32077,9 +32082,9 @@ var require_read_entry = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/types.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/types.js
 var require_types2 = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/types.js"(exports) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/types.js"(exports) {
     "use strict";
     exports.name = /* @__PURE__ */ new Map([
       ["0", "File"],
@@ -32124,9 +32129,9 @@ var require_types2 = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/large-numbers.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/large-numbers.js
 var require_large_numbers = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/large-numbers.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/large-numbers.js"(exports, module2) {
     "use strict";
     var encode = (num, buf) => {
       if (!Number.isSafeInteger(num)) {
@@ -32214,9 +32219,9 @@ var require_large_numbers = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/header.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/header.js
 var require_header = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/header.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/header.js"(exports, module2) {
     "use strict";
     var types = require_types2();
     var pathModule = require("path").posix;
@@ -32434,9 +32439,9 @@ var require_header = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/pax.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/pax.js
 var require_pax = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/pax.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/pax.js"(exports, module2) {
     "use strict";
     var Header = require_header();
     var path10 = require("path");
@@ -32535,9 +32540,9 @@ var require_pax = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/strip-trailing-slashes.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/strip-trailing-slashes.js
 var require_strip_trailing_slashes = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/strip-trailing-slashes.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/strip-trailing-slashes.js"(exports, module2) {
     module2.exports = (str) => {
       let i = str.length - 1;
       let slashesStart = -1;
@@ -32550,9 +32555,9 @@ var require_strip_trailing_slashes = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/warn-mixin.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/warn-mixin.js
 var require_warn_mixin = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/warn-mixin.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/warn-mixin.js"(exports, module2) {
     "use strict";
     module2.exports = (Base) => class extends Base {
       warn(code, message, data = {}) {
@@ -32580,9 +32585,9 @@ var require_warn_mixin = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/winchars.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/winchars.js
 var require_winchars = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/winchars.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/winchars.js"(exports, module2) {
     "use strict";
     var raw = [
       "|",
@@ -32601,9 +32606,9 @@ var require_winchars = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/strip-absolute-path.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/strip-absolute-path.js
 var require_strip_absolute_path = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/strip-absolute-path.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/strip-absolute-path.js"(exports, module2) {
     var { isAbsolute, parse } = require("path").win32;
     module2.exports = (path10) => {
       let r = "";
@@ -32619,9 +32624,9 @@ var require_strip_absolute_path = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/mode-fix.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/mode-fix.js
 var require_mode_fix = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/mode-fix.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/mode-fix.js"(exports, module2) {
     "use strict";
     module2.exports = (mode, isDir, portable) => {
       mode &= 4095;
@@ -32644,9 +32649,9 @@ var require_mode_fix = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/write-entry.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/write-entry.js
 var require_write_entry = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/write-entry.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/write-entry.js"(exports, module2) {
     "use strict";
     var { Minipass } = require_minipass();
     var Pax = require_pax();
@@ -33109,9 +33114,9 @@ var require_write_entry = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/pack.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/pack.js
 var require_pack = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/pack.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/pack.js"(exports, module2) {
     "use strict";
     var PackJob = class {
       constructor(path11, absolute) {
@@ -33467,9 +33472,9 @@ var require_pack = __commonJS({
   }
 });
 
-// .yarn/cache/fs-minipass-npm-2.1.0-501ef87306-56d19f9a03.zip/node_modules/fs-minipass/index.js
+// .yarn/cache/fs-minipass-npm-2.1.0-501ef87306-703d16522b.zip/node_modules/fs-minipass/index.js
 var require_fs_minipass = __commonJS({
-  ".yarn/cache/fs-minipass-npm-2.1.0-501ef87306-56d19f9a03.zip/node_modules/fs-minipass/index.js"(exports) {
+  ".yarn/cache/fs-minipass-npm-2.1.0-501ef87306-703d16522b.zip/node_modules/fs-minipass/index.js"(exports) {
     "use strict";
     var MiniPass = require_minipass2();
     var EE = require("events").EventEmitter;
@@ -33842,9 +33847,9 @@ var require_fs_minipass = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/parse.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/parse.js
 var require_parse2 = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/parse.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/parse.js"(exports, module2) {
     "use strict";
     var warner = require_warn_mixin();
     var Header = require_header();
@@ -34243,9 +34248,9 @@ var require_parse2 = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/list.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/list.js
 var require_list = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/list.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/list.js"(exports, module2) {
     "use strict";
     var hlo = require_high_level_opt();
     var Parser = require_parse2();
@@ -34357,9 +34362,9 @@ var require_list = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/create.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/create.js
 var require_create = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/create.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/create.js"(exports, module2) {
     "use strict";
     var hlo = require_high_level_opt();
     var Pack = require_pack();
@@ -34451,9 +34456,9 @@ var require_create = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/replace.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/replace.js
 var require_replace = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/replace.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/replace.js"(exports, module2) {
     "use strict";
     var hlo = require_high_level_opt();
     var Pack = require_pack();
@@ -34667,9 +34672,9 @@ var require_replace = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/update.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/update.js
 var require_update = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/update.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/update.js"(exports, module2) {
     "use strict";
     var hlo = require_high_level_opt();
     var r = require_replace();
@@ -34698,9 +34703,9 @@ var require_update = __commonJS({
   }
 });
 
-// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/opts-arg.js
+// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/opts-arg.js
 var require_opts_arg = __commonJS({
-  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/opts-arg.js"(exports, module2) {
+  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/opts-arg.js"(exports, module2) {
     var { promisify } = require("util");
     var fs8 = require("fs");
     var optsArg = (opts) => {
@@ -34726,9 +34731,9 @@ var require_opts_arg = __commonJS({
   }
 });
 
-// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/path-arg.js
+// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/path-arg.js
 var require_path_arg = __commonJS({
-  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/path-arg.js"(exports, module2) {
+  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/path-arg.js"(exports, module2) {
     var platform = process.env.__TESTING_MKDIRP_PLATFORM__ || process.platform;
     var { resolve, parse } = require("path");
     var pathArg = (path10) => {
@@ -34758,9 +34763,9 @@ var require_path_arg = __commonJS({
   }
 });
 
-// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/find-made.js
+// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/find-made.js
 var require_find_made = __commonJS({
-  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/find-made.js"(exports, module2) {
+  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/find-made.js"(exports, module2) {
     var { dirname } = require("path");
     var findMade = (opts, parent, path10 = void 0) => {
       if (path10 === parent)
@@ -34784,9 +34789,9 @@ var require_find_made = __commonJS({
   }
 });
 
-// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/mkdirp-manual.js
+// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/mkdirp-manual.js
 var require_mkdirp_manual = __commonJS({
-  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/mkdirp-manual.js"(exports, module2) {
+  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/mkdirp-manual.js"(exports, module2) {
     var { dirname } = require("path");
     var mkdirpManual = (path10, opts, made) => {
       opts.recursive = false;
@@ -34845,9 +34850,9 @@ var require_mkdirp_manual = __commonJS({
   }
 });
 
-// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/mkdirp-native.js
+// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/mkdirp-native.js
 var require_mkdirp_native = __commonJS({
-  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/mkdirp-native.js"(exports, module2) {
+  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/mkdirp-native.js"(exports, module2) {
     var { dirname } = require("path");
     var { findMade, findMadeSync } = require_find_made();
     var { mkdirpManual, mkdirpManualSync } = require_mkdirp_manual();
@@ -34883,9 +34888,9 @@ var require_mkdirp_native = __commonJS({
   }
 });
 
-// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/use-native.js
+// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/use-native.js
 var require_use_native = __commonJS({
-  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/lib/use-native.js"(exports, module2) {
+  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/lib/use-native.js"(exports, module2) {
     var fs8 = require("fs");
     var version2 = process.env.__TESTING_MKDIRP_NODE_VERSION__ || process.version;
     var versArr = version2.replace(/^v/, "").split(".");
@@ -34896,9 +34901,9 @@ var require_use_native = __commonJS({
   }
 });
 
-// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/index.js
+// .yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/index.js
 var require_mkdirp = __commonJS({
-  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-1233611198.zip/node_modules/mkdirp/index.js"(exports, module2) {
+  ".yarn/cache/mkdirp-npm-1.0.4-37f6ef56b9-46ea0f3ffa.zip/node_modules/mkdirp/index.js"(exports, module2) {
     var optsArg = require_opts_arg();
     var pathArg = require_path_arg();
     var { mkdirpNative, mkdirpNativeSync } = require_mkdirp_native();
@@ -34923,9 +34928,9 @@ var require_mkdirp = __commonJS({
   }
 });
 
-// .yarn/cache/chownr-npm-2.0.0-638f1c9c61-7b240ff920.zip/node_modules/chownr/chownr.js
+// .yarn/cache/chownr-npm-2.0.0-638f1c9c61-594754e130.zip/node_modules/chownr/chownr.js
 var require_chownr = __commonJS({
-  ".yarn/cache/chownr-npm-2.0.0-638f1c9c61-7b240ff920.zip/node_modules/chownr/chownr.js"(exports, module2) {
+  ".yarn/cache/chownr-npm-2.0.0-638f1c9c61-594754e130.zip/node_modules/chownr/chownr.js"(exports, module2) {
     "use strict";
     var fs8 = require("fs");
     var path10 = require("path");
@@ -35054,9 +35059,9 @@ var require_chownr = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/mkdir.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/mkdir.js
 var require_mkdir = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/mkdir.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/mkdir.js"(exports, module2) {
     "use strict";
     var mkdirp = require_mkdirp();
     var fs8 = require("fs");
@@ -35246,9 +35251,9 @@ var require_mkdir = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/normalize-unicode.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/normalize-unicode.js
 var require_normalize_unicode = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/normalize-unicode.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/normalize-unicode.js"(exports, module2) {
     var normalizeCache = /* @__PURE__ */ Object.create(null);
     var { hasOwnProperty } = Object.prototype;
     module2.exports = (s) => {
@@ -35260,9 +35265,9 @@ var require_normalize_unicode = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/path-reservations.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/path-reservations.js
 var require_path_reservations = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/path-reservations.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/path-reservations.js"(exports, module2) {
     var assert2 = require("assert");
     var normalize = require_normalize_unicode();
     var stripSlashes = require_strip_trailing_slashes();
@@ -35374,9 +35379,9 @@ var require_path_reservations = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/get-write-flag.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/get-write-flag.js
 var require_get_write_flag = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/get-write-flag.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/get-write-flag.js"(exports, module2) {
     var platform = process.env.__FAKE_PLATFORM__ || process.platform;
     var isWindows = platform === "win32";
     var fs8 = global.__FAKE_TESTING_FS__ || require("fs");
@@ -35388,9 +35393,9 @@ var require_get_write_flag = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/unpack.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/unpack.js
 var require_unpack = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/unpack.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/unpack.js"(exports, module2) {
     "use strict";
     var assert2 = require("assert");
     var Parser = require_parse2();
@@ -36070,9 +36075,9 @@ var require_unpack = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/extract.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/extract.js
 var require_extract = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/lib/extract.js"(exports, module2) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/lib/extract.js"(exports, module2) {
     "use strict";
     var hlo = require_high_level_opt();
     var Unpack = require_unpack();
@@ -36155,9 +36160,9 @@ var require_extract = __commonJS({
   }
 });
 
-// .yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/index.js
+// .yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/index.js
 var require_tar = __commonJS({
-  ".yarn/cache/tar-npm-6.1.15-44c3e71720-815c25f881.zip/node_modules/tar/index.js"(exports) {
+  ".yarn/cache/tar-npm-6.1.15-44c3e71720-bb2babe7b1.zip/node_modules/tar/index.js"(exports) {
     "use strict";
     exports.c = exports.create = require_create();
     exports.r = exports.replace = require_replace();
@@ -36175,9 +36180,9 @@ var require_tar = __commonJS({
   }
 });
 
-// .yarn/cache/v8-compile-cache-npm-2.3.0-961375f150-757e7df6b1.zip/node_modules/v8-compile-cache/v8-compile-cache.js
+// .yarn/cache/v8-compile-cache-npm-2.3.0-961375f150-b2d866febf.zip/node_modules/v8-compile-cache/v8-compile-cache.js
 var require_v8_compile_cache = __commonJS({
-  ".yarn/cache/v8-compile-cache-npm-2.3.0-961375f150-757e7df6b1.zip/node_modules/v8-compile-cache/v8-compile-cache.js"(exports, module2) {
+  ".yarn/cache/v8-compile-cache-npm-2.3.0-961375f150-b2d866febf.zip/node_modules/v8-compile-cache/v8-compile-cache.js"(exports, module2) {
     "use strict";
     var Module2 = require("module");
     var crypto = require("crypto");
@@ -36451,9 +36456,9 @@ var require_v8_compile_cache = __commonJS({
   }
 });
 
-// .yarn/cache/isexe-npm-2.0.0-b58870bd2e-b37fe0a798.zip/node_modules/isexe/windows.js
+// .yarn/cache/isexe-npm-2.0.0-b58870bd2e-228cfa503f.zip/node_modules/isexe/windows.js
 var require_windows = __commonJS({
-  ".yarn/cache/isexe-npm-2.0.0-b58870bd2e-b37fe0a798.zip/node_modules/isexe/windows.js"(exports, module2) {
+  ".yarn/cache/isexe-npm-2.0.0-b58870bd2e-228cfa503f.zip/node_modules/isexe/windows.js"(exports, module2) {
     module2.exports = isexe;
     isexe.sync = sync;
     var fs8 = require("fs");
@@ -36491,9 +36496,9 @@ var require_windows = __commonJS({
   }
 });
 
-// .yarn/cache/isexe-npm-2.0.0-b58870bd2e-b37fe0a798.zip/node_modules/isexe/mode.js
+// .yarn/cache/isexe-npm-2.0.0-b58870bd2e-228cfa503f.zip/node_modules/isexe/mode.js
 var require_mode = __commonJS({
-  ".yarn/cache/isexe-npm-2.0.0-b58870bd2e-b37fe0a798.zip/node_modules/isexe/mode.js"(exports, module2) {
+  ".yarn/cache/isexe-npm-2.0.0-b58870bd2e-228cfa503f.zip/node_modules/isexe/mode.js"(exports, module2) {
     module2.exports = isexe;
     isexe.sync = sync;
     var fs8 = require("fs");
@@ -36524,9 +36529,9 @@ var require_mode = __commonJS({
   }
 });
 
-// .yarn/cache/isexe-npm-2.0.0-b58870bd2e-b37fe0a798.zip/node_modules/isexe/index.js
+// .yarn/cache/isexe-npm-2.0.0-b58870bd2e-228cfa503f.zip/node_modules/isexe/index.js
 var require_isexe = __commonJS({
-  ".yarn/cache/isexe-npm-2.0.0-b58870bd2e-b37fe0a798.zip/node_modules/isexe/index.js"(exports, module2) {
+  ".yarn/cache/isexe-npm-2.0.0-b58870bd2e-228cfa503f.zip/node_modules/isexe/index.js"(exports, module2) {
     var fs8 = require("fs");
     var core;
     if (process.platform === "win32" || global.TESTING_WINDOWS) {
@@ -36579,9 +36584,9 @@ var require_isexe = __commonJS({
   }
 });
 
-// .yarn/cache/which-npm-3.0.1-b2b0f09ace-5c5f879943.zip/node_modules/which/lib/index.js
+// .yarn/cache/which-npm-3.0.1-b2b0f09ace-15263b0616.zip/node_modules/which/lib/index.js
 var require_lib2 = __commonJS({
-  ".yarn/cache/which-npm-3.0.1-b2b0f09ace-5c5f879943.zip/node_modules/which/lib/index.js"(exports, module2) {
+  ".yarn/cache/which-npm-3.0.1-b2b0f09ace-15263b0616.zip/node_modules/which/lib/index.js"(exports, module2) {
     var isexe = require_isexe();
     var { join: join2, delimiter, sep, posix } = require("path");
     var isWindows = process.platform === "win32";
@@ -36671,9 +36676,9 @@ var require_lib2 = __commonJS({
   }
 });
 
-// .yarn/cache/is-windows-npm-1.0.2-898cd6f3d7-ba7ae056a6.zip/node_modules/is-windows/index.js
+// .yarn/cache/is-windows-npm-1.0.2-898cd6f3d7-b32f418ab3.zip/node_modules/is-windows/index.js
 var require_is_windows = __commonJS({
-  ".yarn/cache/is-windows-npm-1.0.2-898cd6f3d7-ba7ae056a6.zip/node_modules/is-windows/index.js"(exports, module2) {
+  ".yarn/cache/is-windows-npm-1.0.2-898cd6f3d7-b32f418ab3.zip/node_modules/is-windows/index.js"(exports, module2) {
     (function(factory) {
       if (exports && typeof exports === "object" && typeof module2 !== "undefined") {
         module2.exports = factory();
@@ -36697,9 +36702,9 @@ var require_is_windows = __commonJS({
   }
 });
 
-// .yarn/cache/cmd-extension-npm-1.0.2-11aa204c4b-c0f4db69b5.zip/node_modules/cmd-extension/index.js
+// .yarn/cache/cmd-extension-npm-1.0.2-11aa204c4b-acdb425d51.zip/node_modules/cmd-extension/index.js
 var require_cmd_extension = __commonJS({
-  ".yarn/cache/cmd-extension-npm-1.0.2-11aa204c4b-c0f4db69b5.zip/node_modules/cmd-extension/index.js"(exports, module2) {
+  ".yarn/cache/cmd-extension-npm-1.0.2-11aa204c4b-acdb425d51.zip/node_modules/cmd-extension/index.js"(exports, module2) {
     "use strict";
     var path10 = require("path");
     var cmdExtension;
@@ -36710,9 +36715,9 @@ var require_cmd_extension = __commonJS({
   }
 });
 
-// .yarn/cache/@zkochan-cmd-shim-npm-6.0.0-97792a7373-bd05b9c123.zip/node_modules/@zkochan/cmd-shim/index.js
+// .yarn/cache/@zkochan-cmd-shim-npm-6.0.0-97792a7373-ba1442ba1e.zip/node_modules/@zkochan/cmd-shim/index.js
 var require_cmd_shim = __commonJS({
-  ".yarn/cache/@zkochan-cmd-shim-npm-6.0.0-97792a7373-bd05b9c123.zip/node_modules/@zkochan/cmd-shim/index.js"(exports, module2) {
+  ".yarn/cache/@zkochan-cmd-shim-npm-6.0.0-97792a7373-ba1442ba1e.zip/node_modules/@zkochan/cmd-shim/index.js"(exports, module2) {
     "use strict";
     cmdShim2.ifExists = cmdShimIfExists;
     var util_1 = require("util");
@@ -37061,7 +37066,7 @@ __export(lib_exports2, {
 });
 module.exports = __toCommonJS(lib_exports2);
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/constants.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/constants.mjs
 var NODE_INITIAL = 0;
 var NODE_SUCCESS = 1;
 var NODE_ERRORED = 2;
@@ -37074,7 +37079,7 @@ var BATCH_REGEX = /^-[a-zA-Z]{2,}$/;
 var BINDING_REGEX = /^([^=]+)=([\s\S]*)$/;
 var DEBUG = process.env.DEBUG_CLI === `1`;
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/errors.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/errors.mjs
 var UsageError = class extends Error {
   constructor(message) {
     super(message);
@@ -37143,7 +37148,7 @@ var whileRunning = (input) => `While running ${input.filter((token) => {
   }
 }).join(` `)}`;
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/format.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/format.mjs
 var MAX_LINE_LENGTH = 80;
 var richLine = Array(MAX_LINE_LENGTH).fill(`\u2501`);
 for (let t = 0; t <= 24; ++t)
@@ -37202,7 +37207,7 @@ function formatMarkdownish(text, { format, paragraphs }) {
 ` : ``;
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/options/utils.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/options/utils.mjs
 var isOptionSymbol = Symbol(`clipanion/isOption`);
 function makeCommandOption(spec) {
   return { ...spec, [isOptionSymbol]: true };
@@ -37253,7 +37258,7 @@ function applyValidator(name, value, validator) {
   return value;
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/Command.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/Command.mjs
 var Command = class {
   constructor() {
     this.help = false;
@@ -37300,7 +37305,7 @@ var Command = class {
 Command.isOption = isOptionSymbol;
 Command.Default = [];
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/core.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/core.mjs
 function debug(str) {
   if (DEBUG) {
     console.log(str);
@@ -38049,7 +38054,7 @@ var CliBuilder = class {
   }
 };
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/platform/node.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/platform/node.mjs
 var import_tty = __toESM(require("tty"), 1);
 function getDefaultColorDepth() {
   if (import_tty.default && `getColorDepth` in import_tty.default.WriteStream.prototype)
@@ -38090,7 +38095,7 @@ function getCaptureActivator(context) {
   };
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/HelpCommand.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/HelpCommand.mjs
 var HelpCommand = class extends Command {
   constructor(contexts) {
     super();
@@ -38140,7 +38145,7 @@ var HelpCommand = class extends Command {
   }
 };
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/Cli.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/Cli.mjs
 var errorCommandSymbol = Symbol(`clipanion/errorCommand`);
 var Cli = class {
   constructor({ binaryLabel, binaryName: binaryNameOpt = `...`, binaryVersion, enableCapture = false, enableColors } = {}) {
@@ -38492,7 +38497,7 @@ function noopCaptureActivator(fn2) {
   return fn2();
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/builtins/index.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/builtins/index.mjs
 var builtins_exports = {};
 __export(builtins_exports, {
   DefinitionsCommand: () => DefinitionsCommand,
@@ -38500,7 +38505,7 @@ __export(builtins_exports, {
   VersionCommand: () => VersionCommand
 });
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/builtins/definitions.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/builtins/definitions.mjs
 var DefinitionsCommand = class extends Command {
   async execute() {
     this.context.stdout.write(`${JSON.stringify(this.cli.definitions(), null, 2)}
@@ -38509,7 +38514,7 @@ var DefinitionsCommand = class extends Command {
 };
 DefinitionsCommand.paths = [[`--clipanion=definitions`]];
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/builtins/help.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/builtins/help.mjs
 var HelpCommand2 = class extends Command {
   async execute() {
     this.context.stdout.write(this.cli.usage());
@@ -38517,7 +38522,7 @@ var HelpCommand2 = class extends Command {
 };
 HelpCommand2.paths = [[`-h`], [`--help`]];
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/builtins/version.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/builtins/version.mjs
 var VersionCommand = class extends Command {
   async execute() {
     var _a;
@@ -38527,7 +38532,7 @@ var VersionCommand = class extends Command {
 };
 VersionCommand.paths = [[`-v`], [`--version`]];
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/options/index.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/options/index.mjs
 var options_exports = {};
 __export(options_exports, {
   Array: () => Array2,
@@ -38544,7 +38549,7 @@ __export(options_exports, {
   rerouteArguments: () => rerouteArguments
 });
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/options/Array.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/options/Array.mjs
 function Array2(descriptor, initialValueBase, optsBase) {
   const [initialValue, opts] = rerouteArguments(initialValueBase, optsBase !== null && optsBase !== void 0 ? optsBase : {});
   const { arity = 1 } = opts;
@@ -38579,7 +38584,7 @@ function Array2(descriptor, initialValueBase, optsBase) {
   });
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/options/Boolean.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/options/Boolean.mjs
 function Boolean2(descriptor, initialValueBase, optsBase) {
   const [initialValue, opts] = rerouteArguments(initialValueBase, optsBase !== null && optsBase !== void 0 ? optsBase : {});
   const optNames = descriptor.split(`,`);
@@ -38607,7 +38612,7 @@ function Boolean2(descriptor, initialValueBase, optsBase) {
   });
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/options/Counter.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/options/Counter.mjs
 function Counter(descriptor, initialValueBase, optsBase) {
   const [initialValue, opts] = rerouteArguments(initialValueBase, optsBase !== null && optsBase !== void 0 ? optsBase : {});
   const optNames = descriptor.split(`,`);
@@ -38640,7 +38645,7 @@ function Counter(descriptor, initialValueBase, optsBase) {
   });
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/options/Proxy.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/options/Proxy.mjs
 function Proxy2(opts = {}) {
   return makeCommandOption({
     definition(builder, key) {
@@ -38656,7 +38661,7 @@ function Proxy2(opts = {}) {
   });
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/options/Rest.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/options/Rest.mjs
 function Rest(opts = {}) {
   return makeCommandOption({
     definition(builder, key) {
@@ -38683,7 +38688,7 @@ function Rest(opts = {}) {
   });
 }
 
-// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fb3428b745.zip/node_modules/clipanion/lib/advanced/options/String.mjs
+// .yarn/__virtual__/clipanion-virtual-cc0a4bf4ff/0/cache/clipanion-npm-3.2.0-8b68f8056b-fcc3d44145.zip/node_modules/clipanion/lib/advanced/options/String.mjs
 function StringOption(descriptor, initialValueBase, optsBase) {
   const [initialValue, opts] = rerouteArguments(initialValueBase, optsBase !== null && optsBase !== void 0 ? optsBase : {});
   const { arity = 1 } = opts;
@@ -38755,7 +38760,7 @@ function String2(descriptor, ...args) {
 }
 
 // package.json
-var version = "0.20.0";
+var version = "0.21.0";
 
 // sources/Engine.ts
 var import_fs3 = __toESM(require("fs"));
@@ -38767,7 +38772,7 @@ var import_semver3 = __toESM(require_semver2());
 var config_default = {
   definitions: {
     npm: {
-      default: "9.8.1+sha1.b8f070cc770128b38017160491504184863329f0",
+      default: "10.2.0+sha1.2e4f7aba9cd913de8747d45b3dd5fb43615a4139",
       fetchLatestFrom: {
         type: "npm",
         package: "npm"
@@ -38795,13 +38800,16 @@ var config_default = {
             package: "npm"
           },
           commands: {
-            use: ["npm", "install"]
+            use: [
+              "npm",
+              "install"
+            ]
           }
         }
       }
     },
     pnpm: {
-      default: "8.6.12+sha1.a2f983fbf8f2531dc85db2a5d7f398063d51a6f3",
+      default: "8.8.0+sha1.9922e8b650d393700209ccd81e0ebdbcbe43b0d3",
       fetchLatestFrom: {
         type: "npm",
         package: "pnpm"
@@ -38833,7 +38841,10 @@ var config_default = {
             package: "pnpm"
           },
           commands: {
-            use: ["pnpm", "install"]
+            use: [
+              "pnpm",
+              "install"
+            ]
           }
         },
         ">=6.0.0": {
@@ -38847,7 +38858,10 @@ var config_default = {
             package: "pnpm"
           },
           commands: {
-            use: ["pnpm", "install"]
+            use: [
+              "pnpm",
+              "install"
+            ]
           }
         }
       }
@@ -38859,7 +38873,7 @@ var config_default = {
         package: "yarn"
       },
       transparent: {
-        default: "3.6.3+sha224.524038cfca4ec8b2d45164c9c13f05e57a7d762f30542a8d647f69e3",
+        default: "3.6.4+sha224.4b0b0a9cf41b177779b701850108387d3189ba7c93bd1a535fafbf72",
         commands: [
           [
             "yarn",
@@ -38879,7 +38893,10 @@ var config_default = {
             package: "yarn"
           },
           commands: {
-            use: ["yarn", "install"]
+            use: [
+              "yarn",
+              "install"
+            ]
           }
         },
         ">=2.0.0": {
@@ -38898,7 +38915,10 @@ var config_default = {
             }
           },
           commands: {
-            use: ["yarn", "install"]
+            use: [
+              "yarn",
+              "install"
+            ]
           }
         }
       }
@@ -39400,13 +39420,10 @@ var import_fs4 = __toESM(require("fs"));
 var import_path4 = __toESM(require("path"));
 var import_which = __toESM(require_lib2());
 var DisableCommand = class extends Command {
-  constructor() {
-    super(...arguments);
-    this.installDirectory = options_exports.String(`--install-directory`, {
-      description: `Where the shims are located`
-    });
-    this.names = options_exports.Rest();
-  }
+  installDirectory = options_exports.String(`--install-directory`, {
+    description: `Where the shims are located`
+  });
+  names = options_exports.Rest();
   async execute() {
     let installDirectory = this.installDirectory;
     if (typeof installDirectory === `undefined`)
@@ -39447,10 +39464,10 @@ var DisableCommand = class extends Command {
     }
   }
 };
-DisableCommand.paths = [
+__publicField(DisableCommand, "paths", [
   [`disable`]
-];
-DisableCommand.usage = Command.Usage({
+]);
+__publicField(DisableCommand, "usage", Command.Usage({
   description: `Remove the Corepack shims from the install directory`,
   details: `
       When run, this command will remove the shims for the specified package managers from the install directory, or all shims if no parameters are passed.
@@ -39467,7 +39484,7 @@ DisableCommand.usage = Command.Usage({
     `Disable the Yarn shim only`,
     `$0 disable yarn`
   ]]
-});
+}));
 
 // sources/commands/Enable.ts
 var import_cmd_shim = __toESM(require_cmd_shim());
@@ -39475,13 +39492,10 @@ var import_fs5 = __toESM(require("fs"));
 var import_path5 = __toESM(require("path"));
 var import_which2 = __toESM(require_lib2());
 var EnableCommand = class extends Command {
-  constructor() {
-    super(...arguments);
-    this.installDirectory = options_exports.String(`--install-directory`, {
-      description: `Where the shims are to be installed`
-    });
-    this.names = options_exports.Rest();
-  }
+  installDirectory = options_exports.String(`--install-directory`, {
+    description: `Where the shims are to be installed`
+  });
+  names = options_exports.Rest();
   async execute() {
     let installDirectory = this.installDirectory;
     if (typeof installDirectory === `undefined`)
@@ -39524,10 +39538,10 @@ var EnableCommand = class extends Command {
     });
   }
 };
-EnableCommand.paths = [
+__publicField(EnableCommand, "paths", [
   [`enable`]
-];
-EnableCommand.usage = Command.Usage({
+]);
+__publicField(EnableCommand, "usage", Command.Usage({
   description: `Add the Corepack shims to the install directories`,
   details: `
       When run, this commmand will check whether the shims for the specified package managers can be found with the correct values inside the install directory. If not, or if they don't exist, they will be created.
@@ -39544,7 +39558,7 @@ EnableCommand.usage = Command.Usage({
     `Enable the Yarn shim only`,
     `$0 enable yarn`
   ]]
-});
+}));
 
 // sources/commands/InstallGlobal.ts
 var import_fs8 = __toESM(require("fs"));
@@ -39716,19 +39730,16 @@ var BaseCommand = class extends Command {
 
 // sources/commands/InstallGlobal.ts
 var InstallGlobalCommand = class extends BaseCommand {
-  constructor() {
-    super(...arguments);
-    this.global = options_exports.Boolean(`-g,--global`, {
-      required: true
-    });
-    this.all = options_exports.Boolean(`--all`, false, {
-      description: `If true, all available default package managers will be installed`
-    });
-    this.cacheOnly = options_exports.Boolean(`--cache-only`, false, {
-      description: `If true, the package managers will only be cached, not set as new defaults`
-    });
-    this.args = options_exports.Rest();
-  }
+  global = options_exports.Boolean(`-g,--global`, {
+    required: true
+  });
+  all = options_exports.Boolean(`--all`, false, {
+    description: `If true, all available default package managers will be installed`
+  });
+  cacheOnly = options_exports.Boolean(`--cache-only`, false, {
+    description: `If true, the package managers will only be cached, not set as new defaults`
+  });
+  args = options_exports.Rest();
   async execute() {
     if (this.args.length === 0 && !this.all)
       throw new UsageError(`No package managers specified; use --all to install all available package managers, or specify one or more package managers to proceed`);
@@ -39799,10 +39810,10 @@ var InstallGlobalCommand = class extends BaseCommand {
     }
   }
 };
-InstallGlobalCommand.paths = [
+__publicField(InstallGlobalCommand, "paths", [
   [`install`]
-];
-InstallGlobalCommand.usage = Command.Usage({
+]);
+__publicField(InstallGlobalCommand, "usage", Command.Usage({
   description: `Install package managers on the system`,
   details: `
       Download the selected package managers and install them on the system.
@@ -39816,7 +39827,7 @@ InstallGlobalCommand.usage = Command.Usage({
     `Install the latest version of all available package managers, and make them globally available`,
     `corepack install -g --all`
   ]]
-});
+}));
 
 // sources/commands/InstallLocal.ts
 var InstallLocalCommand = class extends BaseCommand {
@@ -39833,10 +39844,10 @@ var InstallLocalCommand = class extends BaseCommand {
     await this.context.engine.ensurePackageManager(resolved);
   }
 };
-InstallLocalCommand.paths = [
+__publicField(InstallLocalCommand, "paths", [
   [`install`]
-];
-InstallLocalCommand.usage = Command.Usage({
+]);
+__publicField(InstallLocalCommand, "usage", Command.Usage({
   description: `Install the package manager configured in the local project`,
   details: `
       Download and install the package manager configured in the local project. This command doesn't change the global version used when running the package manager from outside the project (use the \`-g,--global\` flag if you wish to do this).
@@ -39845,25 +39856,22 @@ InstallLocalCommand.usage = Command.Usage({
     `Install the project's package manager in the cache`,
     `corepack install`
   ]]
-});
+}));
 
 // sources/commands/Pack.ts
 var import_promises2 = require("fs/promises");
 var import_path8 = __toESM(require("path"));
 var PackCommand = class extends BaseCommand {
-  constructor() {
-    super(...arguments);
-    this.all = options_exports.Boolean(`--all`, false, {
-      description: `If true, all available default package managers will be installed`
-    });
-    this.json = options_exports.Boolean(`--json`, false, {
-      description: `If true, the path to the generated tarball will be printed on stdout`
-    });
-    this.output = options_exports.String(`-o,--output`, {
-      description: `Where the tarball should be generated; by default "corepack.tgz"`
-    });
-    this.patterns = options_exports.Rest();
-  }
+  all = options_exports.Boolean(`--all`, false, {
+    description: `If true, all available default package managers will be installed`
+  });
+  json = options_exports.Boolean(`--json`, false, {
+    description: `If true, the path to the generated tarball will be printed on stdout`
+  });
+  output = options_exports.String(`-o,--output`, {
+    description: `Where the tarball should be generated; by default "corepack.tgz"`
+  });
+  patterns = options_exports.Rest();
   async execute() {
     const descriptors = await this.resolvePatternsToDescriptors({
       all: this.all,
@@ -39902,10 +39910,10 @@ var PackCommand = class extends BaseCommand {
     }
   }
 };
-PackCommand.paths = [
+__publicField(PackCommand, "paths", [
   [`pack`]
-];
-PackCommand.usage = Command.Usage({
+]);
+__publicField(PackCommand, "usage", Command.Usage({
   description: `Store package managers in a tarball`,
   details: `
       Download the selected package managers and store them inside a tarball suitable for use with \`corepack install -g\`.
@@ -39920,7 +39928,7 @@ PackCommand.usage = Command.Usage({
     `Pack the latest versions of all supported package managers inside a file named everything.tgz`,
     `corepack pack --all -o everything.tgz`
   ]]
-});
+}));
 
 // sources/commands/Up.ts
 var import_semver5 = __toESM(require_semver2());
@@ -39946,10 +39954,10 @@ var UpCommand = class extends BaseCommand {
     await this.setLocalPackageManager(packageManagerInfo);
   }
 };
-UpCommand.paths = [
+__publicField(UpCommand, "paths", [
   [`up`]
-];
-UpCommand.usage = Command.Usage({
+]);
+__publicField(UpCommand, "usage", Command.Usage({
   description: `Update the package manager used in the current project`,
   details: `
       Retrieve the latest available version for the current major release line
@@ -39965,14 +39973,11 @@ UpCommand.usage = Command.Usage({
     `Configure the project to use the latest Yarn release`,
     `corepack up`
   ]]
-});
+}));
 
 // sources/commands/Use.ts
 var UseCommand = class extends BaseCommand {
-  constructor() {
-    super(...arguments);
-    this.pattern = options_exports.String();
-  }
+  pattern = options_exports.String();
   async execute() {
     const [descriptor] = await this.resolvePatternsToDescriptors({
       all: false,
@@ -39987,10 +39992,10 @@ var UseCommand = class extends BaseCommand {
     await this.setLocalPackageManager(packageManagerInfo);
   }
 };
-UseCommand.paths = [
+__publicField(UseCommand, "paths", [
   [`use`]
-];
-UseCommand.usage = Command.Usage({
+]);
+__publicField(UseCommand, "usage", Command.Usage({
   description: `Define the package manager to use for the current project`,
   details: `
       When run, this command will retrieve the latest release matching the
@@ -40001,19 +40006,16 @@ UseCommand.usage = Command.Usage({
     `Configure the project to use the latest Yarn release`,
     `corepack use 'yarn@*'`
   ]]
-});
+}));
 
 // sources/commands/deprecated/Hydrate.ts
 var import_promises3 = require("fs/promises");
 var import_path9 = __toESM(require("path"));
 var HydrateCommand = class extends Command {
-  constructor() {
-    super(...arguments);
-    this.activate = options_exports.Boolean(`--activate`, false, {
-      description: `If true, this release will become the default one for this package manager`
-    });
-    this.fileName = options_exports.String();
-  }
+  activate = options_exports.Boolean(`--activate`, false, {
+    description: `If true, this release will become the default one for this package manager`
+  });
+  fileName = options_exports.String();
   async execute() {
     const installFolder = getInstallFolder();
     const fileName = import_path9.default.resolve(this.context.cwd, this.fileName);
@@ -40054,31 +40056,28 @@ var HydrateCommand = class extends Command {
 `);
   }
 };
-HydrateCommand.paths = [
+__publicField(HydrateCommand, "paths", [
   [`hydrate`]
-];
+]);
 
 // sources/commands/deprecated/Prepare.ts
 var import_promises4 = require("fs/promises");
 var import_path10 = __toESM(require("path"));
 var PrepareCommand = class extends Command {
-  constructor() {
-    super(...arguments);
-    this.activate = options_exports.Boolean(`--activate`, false, {
-      description: `If true, this release will become the default one for this package manager`
-    });
-    this.all = options_exports.Boolean(`--all`, false, {
-      description: `If true, all available default package managers will be installed`
-    });
-    this.json = options_exports.Boolean(`--json`, false, {
-      description: `If true, the output will be the path of the generated tarball`
-    });
-    this.output = options_exports.String(`-o,--output`, {
-      description: `If true, the installed package managers will also be stored in a tarball`,
-      tolerateBoolean: true
-    });
-    this.specs = options_exports.Rest();
-  }
+  activate = options_exports.Boolean(`--activate`, false, {
+    description: `If true, this release will become the default one for this package manager`
+  });
+  all = options_exports.Boolean(`--all`, false, {
+    description: `If true, all available default package managers will be installed`
+  });
+  json = options_exports.Boolean(`--json`, false, {
+    description: `If true, the output will be the path of the generated tarball`
+  });
+  output = options_exports.String(`-o,--output`, {
+    description: `If true, the installed package managers will also be stored in a tarball`,
+    tolerateBoolean: true
+  });
+  specs = options_exports.Rest();
   async execute() {
     if (this.all && this.specs.length > 0)
       throw new UsageError(`The --all option cannot be used along with an explicit package manager specification`);
@@ -40138,9 +40137,9 @@ var PrepareCommand = class extends Command {
     }
   }
 };
-PrepareCommand.paths = [
+__publicField(PrepareCommand, "paths", [
   [`prepare`]
-];
+]);
 
 // sources/miscUtils.ts
 var Cancellation = class extends Error {
@@ -40233,10 +40232,7 @@ async function runMain(argv) {
       binaryVersion: `corepack/${version}`
     });
     cli.register(class BinaryCommand extends Command {
-      constructor() {
-        super(...arguments);
-        this.proxy = options_exports.Proxy();
-      }
+      proxy = options_exports.Proxy();
       async execute() {
         return executePackageManagerRequest(request, this.proxy, this.context);
       }
diff --git a/deps/corepack/package.json b/deps/corepack/package.json
index dc168d9389b1aa..8ffbde7ca15efa 100644
--- a/deps/corepack/package.json
+++ b/deps/corepack/package.json
@@ -1,6 +1,6 @@
 {
   "name": "corepack",
-  "version": "0.20.0",
+  "version": "0.21.0",
   "homepage": "https://github.com/nodejs/corepack#readme",
   "bugs": {
     "url": "https://github.com/nodejs/corepack/issues"
@@ -10,13 +10,13 @@
     "url": "https://github.com/nodejs/corepack.git"
   },
   "engines": {
-    "node": ">=16.20.0"
+    "node": ">=18.17.1"
   },
   "exports": {
     "./package.json": "./package.json"
   },
   "license": "MIT",
-  "packageManager": "yarn@4.0.0-rc.44+sha224.6526204ca38ed0105e81ba52d83dc0c7b8ee63600a13dc332914fde0",
+  "packageManager": "yarn@4.0.0-rc.50+sha256.6663791fa05e15176880da500c334caf1699541f834302e6df085d20ef06069d",
   "devDependencies": {
     "@babel/core": "^7.14.3",
     "@babel/plugin-transform-modules-commonjs": "^7.14.0",
@@ -52,7 +52,7 @@
   },
   "scripts": {
     "build": "rm -rf dist shims && run build:bundle && ts-node ./mkshims.ts",
-    "build:bundle": "esbuild ./sources/_lib.ts --bundle --platform=node --target=node16.20.0 --external:corepack --outfile='./dist/lib/corepack.cjs' --resolve-extensions='.ts,.mjs,.js'",
+    "build:bundle": "esbuild ./sources/_lib.ts --bundle --platform=node --target=node18.17.0 --external:corepack --outfile='./dist/lib/corepack.cjs' --resolve-extensions='.ts,.mjs,.js'",
     "corepack": "ts-node ./sources/_cli.ts",
     "lint": "eslint .",
     "prepack": "yarn build",
diff --git a/deps/googletest/include/gtest/gtest-message.h b/deps/googletest/include/gtest/gtest-message.h
index 59b805e4e4622c..448ac6b7ee2e09 100644
--- a/deps/googletest/include/gtest/gtest-message.h
+++ b/deps/googletest/include/gtest/gtest-message.h
@@ -59,7 +59,7 @@
 #ifdef GTEST_HAS_ABSL
 #include <type_traits>
 
-#include "absl/strings/internal/has_absl_stringify.h"
+#include "absl/strings/has_absl_stringify.h"
 #include "absl/strings/str_cat.h"
 #endif  // GTEST_HAS_ABSL
 
@@ -121,14 +121,14 @@ class GTEST_API_ Message {
   // Streams a non-pointer value to this object. If building a version of
   // GoogleTest with ABSL, this overload is only enabled if the value does not
   // have an AbslStringify definition.
-  template <typename T
+  template <
+      typename T
 #ifdef GTEST_HAS_ABSL
-            ,
-            typename std::enable_if<
-                !absl::strings_internal::HasAbslStringify<T>::value,  // NOLINT
-                int>::type = 0
+      ,
+      typename std::enable_if<!absl::HasAbslStringify<T>::value,  // NOLINT
+                              int>::type = 0
 #endif  // GTEST_HAS_ABSL
-            >
+      >
   inline Message& operator<<(const T& val) {
         // Some libraries overload << for STL containers.  These
     // overloads are defined in the global namespace instead of ::std.
@@ -153,9 +153,8 @@ class GTEST_API_ Message {
   // Streams a non-pointer value with an AbslStringify definition to this
   // object.
   template <typename T,
-            typename std::enable_if<
-                absl::strings_internal::HasAbslStringify<T>::value,  // NOLINT
-                int>::type = 0>
+            typename std::enable_if<absl::HasAbslStringify<T>::value,  // NOLINT
+                                    int>::type = 0>
   inline Message& operator<<(const T& val) {
     // ::operator<< is needed here for a similar reason as with the non-Abseil
     // version above
diff --git a/deps/googletest/include/gtest/gtest-printers.h b/deps/googletest/include/gtest/gtest-printers.h
index 9ccbff7da454b5..1b12ef683c13bd 100644
--- a/deps/googletest/include/gtest/gtest-printers.h
+++ b/deps/googletest/include/gtest/gtest-printers.h
@@ -116,7 +116,7 @@
 #include <vector>
 
 #ifdef GTEST_HAS_ABSL
-#include "absl/strings/internal/has_absl_stringify.h"
+#include "absl/strings/has_absl_stringify.h"
 #include "absl/strings/str_cat.h"
 #endif  // GTEST_HAS_ABSL
 #include "gtest/internal/gtest-internal.h"
@@ -292,10 +292,9 @@ struct ConvertibleToStringViewPrinter {
 
 #ifdef GTEST_HAS_ABSL
 struct ConvertibleToAbslStringifyPrinter {
-  template <
-      typename T,
-      typename = typename std::enable_if<
-          absl::strings_internal::HasAbslStringify<T>::value>::type>  // NOLINT
+  template <typename T,
+            typename = typename std::enable_if<
+                absl::HasAbslStringify<T>::value>::type>  // NOLINT
   static void PrintValue(const T& value, ::std::ostream* os) {
     *os << absl::StrCat(value);
   }
diff --git a/deps/googletest/include/gtest/internal/gtest-port.h b/deps/googletest/include/gtest/internal/gtest-port.h
index 35544a08a65aae..d061a49b9f411b 100644
--- a/deps/googletest/include/gtest/internal/gtest-port.h
+++ b/deps/googletest/include/gtest/internal/gtest-port.h
@@ -281,6 +281,22 @@
 #error C++ versions less than C++14 are not supported.
 #endif
 
+// MSVC >= 19.11 (VS 2017 Update 3) supports __has_include.
+#ifdef __has_include
+#define GTEST_INTERNAL_HAS_INCLUDE __has_include
+#else
+#define GTEST_INTERNAL_HAS_INCLUDE(...) 0
+#endif
+
+// Detect C++ feature test macros as gracefully as possible.
+// MSVC >= 19.15, Clang >= 3.4.1, and GCC >= 4.1.2 support feature test macros.
+#if GTEST_INTERNAL_CPLUSPLUS_LANG >= 202002L && \
+    (!defined(__has_include) || GTEST_INTERNAL_HAS_INCLUDE(<version>))
+#include <version>  // C++20 and later
+#elif (!defined(__has_include) || GTEST_INTERNAL_HAS_INCLUDE(<ciso646>))
+#include <ciso646>  // Pre-C++20
+#endif
+
 #include <ctype.h>   // for isspace, etc
 #include <stddef.h>  // for ptrdiff_t
 #include <stdio.h>
@@ -829,9 +845,9 @@ typedef struct _RTL_CRITICAL_SECTION GTEST_CRITICAL_SECTION;
 #ifndef GTEST_API_
 
 #ifdef _MSC_VER
-#if GTEST_LINKED_AS_SHARED_LIBRARY
+#if defined(GTEST_LINKED_AS_SHARED_LIBRARY) && GTEST_LINKED_AS_SHARED_LIBRARY
 #define GTEST_API_ __declspec(dllimport)
-#elif GTEST_CREATE_SHARED_LIBRARY
+#elif defined(GTEST_CREATE_SHARED_LIBRARY) && GTEST_CREATE_SHARED_LIBRARY
 #define GTEST_API_ __declspec(dllexport)
 #endif
 #elif GTEST_HAVE_ATTRIBUTE_(visibility)
@@ -2351,9 +2367,9 @@ using Any = ::absl::any;
 }  // namespace internal
 }  // namespace testing
 #else
-#ifdef __has_include
-#if __has_include(<any>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L && \
-    (!defined(_MSC_VER) || GTEST_HAS_RTTI)
+#if defined(__cpp_lib_any) || (GTEST_INTERNAL_HAS_INCLUDE(<any>) &&        \
+                               GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L && \
+                               (!defined(_MSC_VER) || GTEST_HAS_RTTI))
 // Otherwise for C++17 and higher use std::any for UniversalPrinter<>
 // specializations.
 #define GTEST_INTERNAL_HAS_ANY 1
@@ -2365,8 +2381,7 @@ using Any = ::std::any;
 }  // namespace testing
 // The case where absl is configured NOT to alias std::any is not
 // supported.
-#endif  // __has_include(<any>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L
-#endif  // __has_include
+#endif  // __cpp_lib_any
 #endif  // GTEST_HAS_ABSL
 
 #ifndef GTEST_INTERNAL_HAS_ANY
@@ -2386,8 +2401,8 @@ inline ::absl::nullopt_t Nullopt() { return ::absl::nullopt; }
 }  // namespace internal
 }  // namespace testing
 #else
-#ifdef __has_include
-#if __has_include(<optional>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L
+#if defined(__cpp_lib_optional) || (GTEST_INTERNAL_HAS_INCLUDE(<optional>) && \
+                                    GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L)
 // Otherwise for C++17 and higher use std::optional for UniversalPrinter<>
 // specializations.
 #define GTEST_INTERNAL_HAS_OPTIONAL 1
@@ -2401,19 +2416,17 @@ inline ::std::nullopt_t Nullopt() { return ::std::nullopt; }
 }  // namespace testing
 // The case where absl is configured NOT to alias std::optional is not
 // supported.
-#endif  // __has_include(<optional>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L
-#endif  // __has_include
+#endif  // __cpp_lib_optional
 #endif  // GTEST_HAS_ABSL
 
 #ifndef GTEST_INTERNAL_HAS_OPTIONAL
 #define GTEST_INTERNAL_HAS_OPTIONAL 0
 #endif
 
-#ifdef __has_include
-#if __has_include(<span>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 202002L
+#if defined(__cpp_lib_span) || (GTEST_INTERNAL_HAS_INCLUDE(<span>) && \
+                                GTEST_INTERNAL_CPLUSPLUS_LANG >= 202002L)
 #define GTEST_INTERNAL_HAS_STD_SPAN 1
-#endif  // __has_include(<span>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 202002L
-#endif  // __has_include
+#endif  // __cpp_lib_span
 
 #ifndef GTEST_INTERNAL_HAS_STD_SPAN
 #define GTEST_INTERNAL_HAS_STD_SPAN 0
@@ -2430,8 +2443,9 @@ using StringView = ::absl::string_view;
 }  // namespace internal
 }  // namespace testing
 #else
-#ifdef __has_include
-#if __has_include(<string_view>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L
+#if defined(__cpp_lib_string_view) ||             \
+    (GTEST_INTERNAL_HAS_INCLUDE(<string_view>) && \
+     GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L)
 // Otherwise for C++17 and higher use std::string_view for Matcher<>
 // specializations.
 #define GTEST_INTERNAL_HAS_STRING_VIEW 1
@@ -2443,9 +2457,7 @@ using StringView = ::std::string_view;
 }  // namespace testing
 // The case where absl is configured NOT to alias std::string_view is not
 // supported.
-#endif  // __has_include(<string_view>) && GTEST_INTERNAL_CPLUSPLUS_LANG >=
-        // 201703L
-#endif  // __has_include
+#endif  // __cpp_lib_string_view
 #endif  // GTEST_HAS_ABSL
 
 #ifndef GTEST_INTERNAL_HAS_STRING_VIEW
@@ -2464,8 +2476,8 @@ using Variant = ::absl::variant<T...>;
 }  // namespace internal
 }  // namespace testing
 #else
-#ifdef __has_include
-#if __has_include(<variant>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L
+#if defined(__cpp_lib_variant) || (GTEST_INTERNAL_HAS_INCLUDE(<variant>) && \
+                                   GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L)
 // Otherwise for C++17 and higher use std::variant for UniversalPrinter<>
 // specializations.
 #define GTEST_INTERNAL_HAS_VARIANT 1
@@ -2477,16 +2489,16 @@ using Variant = ::std::variant<T...>;
 }  // namespace internal
 }  // namespace testing
 // The case where absl is configured NOT to alias std::variant is not supported.
-#endif  // __has_include(<variant>) && GTEST_INTERNAL_CPLUSPLUS_LANG >= 201703L
-#endif  // __has_include
+#endif  // __cpp_lib_variant
 #endif  // GTEST_HAS_ABSL
 
 #ifndef GTEST_INTERNAL_HAS_VARIANT
 #define GTEST_INTERNAL_HAS_VARIANT 0
 #endif
 
-#if defined(GTEST_INTERNAL_CPLUSPLUS_LANG) && \
-    GTEST_INTERNAL_CPLUSPLUS_LANG < 201703L
+#if (defined(__cpp_constexpr) && !defined(__cpp_inline_variables)) || \
+    (defined(GTEST_INTERNAL_CPLUSPLUS_LANG) &&                        \
+     GTEST_INTERNAL_CPLUSPLUS_LANG < 201703L)
 #define GTEST_INTERNAL_NEED_REDUNDANT_CONSTEXPR_DECL 1
 #endif
 
diff --git a/deps/googletest/src/gtest-filepath.cc b/deps/googletest/src/gtest-filepath.cc
index 513e947f5703ea..902d8c7f64b7c4 100644
--- a/deps/googletest/src/gtest-filepath.cc
+++ b/deps/googletest/src/gtest-filepath.cc
@@ -336,7 +336,7 @@ bool FilePath::CreateDirectoriesRecursively() const {
     return false;
   }
 
-  if (pathname_.length() == 0 || this->DirectoryExists()) {
+  if (pathname_.empty() || this->DirectoryExists()) {
     return true;
   }
 
diff --git a/deps/googletest/src/gtest-port.cc b/deps/googletest/src/gtest-port.cc
index 2aaf2bcc26c1e6..3bb7dd450812d5 100644
--- a/deps/googletest/src/gtest-port.cc
+++ b/deps/googletest/src/gtest-port.cc
@@ -158,13 +158,13 @@ size_t GetThreadCount() {
 // we cannot detect it.
 size_t GetThreadCount() {
   int mib[] = {
-    CTL_KERN,
-    KERN_PROC,
-    KERN_PROC_PID,
-    getpid(),
+      CTL_KERN,
+      KERN_PROC,
+      KERN_PROC_PID,
+      getpid(),
 #ifdef GTEST_OS_NETBSD
-    sizeof(struct kinfo_proc),
-    1,
+      sizeof(struct kinfo_proc),
+      1,
 #endif
   };
   u_int miblen = sizeof(mib) / sizeof(mib[0]);
@@ -697,13 +697,24 @@ bool RE::PartialMatch(const char* str, const RE& re) {
 void RE::Init(const char* regex) {
   pattern_ = regex;
 
+  // NetBSD (and Android, which takes its regex implemntation from NetBSD) does
+  // not include the GNU regex extensions (such as Perl style character classes
+  // like \w) in REG_EXTENDED. REG_EXTENDED is only specified to include the
+  // [[:alpha:]] style character classes. Enable REG_GNU wherever it is defined
+  // so users can use those extensions.
+#if defined(REG_GNU)
+  constexpr int reg_flags = REG_EXTENDED | REG_GNU;
+#else
+  constexpr int reg_flags = REG_EXTENDED;
+#endif
+
   // Reserves enough bytes to hold the regular expression used for a
   // full match.
   const size_t full_regex_len = strlen(regex) + 10;
   char* const full_pattern = new char[full_regex_len];
 
   snprintf(full_pattern, full_regex_len, "^(%s)$", regex);
-  is_valid_ = regcomp(&full_regex_, full_pattern, REG_EXTENDED) == 0;
+  is_valid_ = regcomp(&full_regex_, full_pattern, reg_flags) == 0;
   // We want to call regcomp(&partial_regex_, ...) even if the
   // previous expression returns false.  Otherwise partial_regex_ may
   // not be properly initialized can may cause trouble when it's
@@ -714,7 +725,7 @@ void RE::Init(const char* regex) {
   // regex.  We change it to an equivalent form "()" to be safe.
   if (is_valid_) {
     const char* const partial_regex = (*regex == '\0') ? "()" : regex;
-    is_valid_ = regcomp(&partial_regex_, partial_regex, REG_EXTENDED) == 0;
+    is_valid_ = regcomp(&partial_regex_, partial_regex, reg_flags) == 0;
   }
   EXPECT_TRUE(is_valid_)
       << "Regular expression \"" << regex
@@ -1028,6 +1039,16 @@ GTEST_DISABLE_MSC_DEPRECATED_PUSH_()
 
 #if GTEST_HAS_STREAM_REDIRECTION
 
+namespace {
+
+#if defined(GTEST_OS_LINUX_ANDROID) || defined(GTEST_OS_IOS)
+bool EndsWithPathSeparator(const std::string& path) {
+  return !path.empty() && path.back() == GTEST_PATH_SEP_[0];
+}
+#endif
+
+}  // namespace
+
 // Object that captures an output stream (stdout/stderr).
 class CapturedStream {
  public:
@@ -1064,7 +1085,13 @@ class CapturedStream {
     // The location /data/local/tmp is directly accessible from native code.
     // '/sdcard' and other variants cannot be relied on, as they are not
     // guaranteed to be mounted, or may have a delay in mounting.
-    name_template = "/data/local/tmp/";
+    //
+    // However, prefer using the TMPDIR environment variable if set, as newer
+    // devices may have /data/local/tmp read-only.
+    name_template = TempDir();
+    if (!EndsWithPathSeparator(name_template))
+      name_template.push_back(GTEST_PATH_SEP_[0]);
+
 #elif defined(GTEST_OS_IOS)
     char user_temp_dir[PATH_MAX + 1];
 
@@ -1084,7 +1111,7 @@ class CapturedStream {
     ::confstr(_CS_DARWIN_USER_TEMP_DIR, user_temp_dir, sizeof(user_temp_dir));
 
     name_template = user_temp_dir;
-    if (name_template.back() != GTEST_PATH_SEP_[0])
+    if (!EndsWithPathSeparator(name_template))
       name_template.push_back(GTEST_PATH_SEP_[0]);
 #else
     name_template = "/tmp/";
diff --git a/deps/googletest/src/gtest.cc b/deps/googletest/src/gtest.cc
index 62dfef664e6836..99b22ed327fd91 100644
--- a/deps/googletest/src/gtest.cc
+++ b/deps/googletest/src/gtest.cc
@@ -5400,7 +5400,7 @@ void UnitTest::RecordProperty(const std::string& key,
 int UnitTest::Run() {
 #ifdef GTEST_HAS_DEATH_TEST
   const bool in_death_test_child_process =
-      GTEST_FLAG_GET(internal_run_death_test).length() > 0;
+      !GTEST_FLAG_GET(internal_run_death_test).empty();
 
   // Google Test implements this protocol for catching that a test
   // program exits before returning control to Google Test:
diff --git a/deps/llhttp/.gitignore b/deps/llhttp/.gitignore
new file mode 100644
index 00000000000000..98438a2cd3230c
--- /dev/null
+++ b/deps/llhttp/.gitignore
@@ -0,0 +1 @@
+libllhttp.pc
diff --git a/deps/llhttp/CMakeLists.txt b/deps/llhttp/CMakeLists.txt
index 1098fb81bba3a9..bdef2880dbb7f7 100644
--- a/deps/llhttp/CMakeLists.txt
+++ b/deps/llhttp/CMakeLists.txt
@@ -1,7 +1,7 @@
 cmake_minimum_required(VERSION 3.5.1)
 cmake_policy(SET CMP0069 NEW)
 
-project(llhttp VERSION 8.1.1)
+project(llhttp VERSION 9.1.2)
 include(GNUInstallDirs)
 
 set(CMAKE_C_STANDARD 99)
@@ -47,8 +47,9 @@ configure_file(
 function(config_library target)
   target_sources(${target} PRIVATE ${LLHTTP_SOURCES} ${LLHTTP_HEADERS})
 
-  target_include_directories(${target} PRIVATE
-      ${CMAKE_CURRENT_SOURCE_DIR}/include
+  target_include_directories(${target} PUBLIC
+    $<BUILD_INTERFACE:${CMAKE_CURRENT_SOURCE_DIR}/include>
+    $<INSTALL_INTERFACE:include>
   )
 
   set_target_properties(${target} PROPERTIES
@@ -72,9 +73,10 @@ function(config_library target)
 
   # This is required to work with FetchContent
   install(EXPORT llhttp
-        FILE llhttp-config.cmake
-        NAMESPACE llhttp::
-        DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/llhttp)
+    FILE llhttp-config.cmake
+    NAMESPACE llhttp::
+    DESTINATION ${CMAKE_INSTALL_LIBDIR}/cmake/llhttp
+  )
 endfunction(config_library target)
 
 if(BUILD_SHARED_LIBS)
diff --git a/deps/llhttp/README.md b/deps/llhttp/README.md
index e227b174acdc3d..4960dbb5a87b5a 100644
--- a/deps/llhttp/README.md
+++ b/deps/llhttp/README.md
@@ -61,33 +61,41 @@ checks could be performed to get even stricter verification of the llhttp.
 ## Usage
 
 ```C
+#include "stdio.h"
 #include "llhttp.h"
+#include "string.h"
 
-llhttp_t parser;
-llhttp_settings_t settings;
+int handle_on_message_complete(llhttp_t* parser) {
+	fprintf(stdout, "Message completed!\n");
+	return 0;
+}
+
+int main() {
+	llhttp_t parser;
+	llhttp_settings_t settings;
 
-/* Initialize user callbacks and settings */
-llhttp_settings_init(&settings);
+	/*Initialize user callbacks and settings */
+	llhttp_settings_init(&settings);
 
-/* Set user callback */
-settings.on_message_complete = handle_on_message_complete;
+	/*Set user callback */
+	settings.on_message_complete = handle_on_message_complete;
 
-/* Initialize the parser in HTTP_BOTH mode, meaning that it will select between
- * HTTP_REQUEST and HTTP_RESPONSE parsing automatically while reading the first
- * input.
- */
-llhttp_init(&parser, HTTP_BOTH, &settings);
+	/*Initialize the parser in HTTP_BOTH mode, meaning that it will select between
+	*HTTP_REQUEST and HTTP_RESPONSE parsing automatically while reading the first
+	*input.
+	*/
+	llhttp_init(&parser, HTTP_BOTH, &settings);
 
-/* Parse request! */
-const char* request = "GET / HTTP/1.1\r\n\r\n";
-int request_len = strlen(request);
+	/*Parse request! */
+	const char* request = "GET / HTTP/1.1\r\n\r\n";
+	int request_len = strlen(request);
 
-enum llhttp_errno err = llhttp_execute(&parser, request, request_len);
-if (err == HPE_OK) {
-  /* Successfully parsed! */
-} else {
-  fprintf(stderr, "Parse error: %s %s\n", llhttp_errno_name(err),
-          parser.reason);
+	enum llhttp_errno err = llhttp_execute(&parser, request, request_len);
+	if (err == HPE_OK) {
+		fprintf(stdout, "Successfully parsed!\n");
+	} else {
+		fprintf(stderr, "Parse error: %s %s\n", llhttp_errno_name(err), parser.reason);
+	}
 }
 ```
 For more information on API usage, please refer to [src/native/api.h](https://github.com/nodejs/llhttp/blob/main/src/native/api.h).
@@ -279,7 +287,7 @@ protocol support to highly non-compliant clients/server.
 No `HPE_INVALID_HEADER_TOKEN` will be raised for incorrect header values when
 lenient parsing is "on".
 
-**USE AT YOUR OWN RISK!**
+**Enabling this flag can pose a security issue since you will be exposed to request smuggling attacks. USE WITH CAUTION!**
 
 ### `void llhttp_set_lenient_chunked_length(llhttp_t* parser, int enabled)`
 
@@ -292,23 +300,22 @@ conjunction with `Content-Length`.
 This error is important to prevent HTTP request smuggling, but may be less desirable
 for small number of cases involving legacy servers.
 
-**USE AT YOUR OWN RISK!**
+**Enabling this flag can pose a security issue since you will be exposed to request smuggling attacks. USE WITH CAUTION!**
 
 ### `void llhttp_set_lenient_keep_alive(llhttp_t* parser, int enabled)`
 
 Enables/disables lenient handling of `Connection: close` and HTTP/1.0
 requests responses.
 
-Normally `llhttp` would error on (in strict mode) or discard (in loose mode)
-the HTTP request/response after the request/response with `Connection: close`
-and `Content-Length`. 
+Normally `llhttp` would error the HTTP request/response 
+after the request/response with `Connection: close` and `Content-Length`. 
 
 This is important to prevent cache poisoning attacks,
 but might interact badly with outdated and insecure clients. 
 
 With this flag the extra request/response will be parsed normally.
 
-**USE AT YOUR OWN RISK!**
+**Enabling this flag can pose a security issue since you will be exposed to poisoning attacks. USE WITH CAUTION!**
 
 ### `void llhttp_set_lenient_transfer_encoding(llhttp_t* parser, int enabled)`
 
@@ -323,7 +330,67 @@ avoid request smuggling.
 
 With this flag the extra value will be parsed normally.
 
-**USE AT YOUR OWN RISK!**
+**Enabling this flag can pose a security issue since you will be exposed to request smuggling attacks. USE WITH CAUTION!**
+
+### `void llhttp_set_lenient_version(llhttp_t* parser, int enabled)`
+
+Enables/disables lenient handling of HTTP version.
+
+Normally `llhttp` would error when the HTTP version in the request or status line
+is not `0.9`, `1.0`, `1.1` or `2.0`.
+With this flag the extra value will be parsed normally.
+
+**Enabling this flag can pose a security issue since you will allow unsupported HTTP versions. USE WITH CAUTION!**
+
+### `void llhttp_set_lenient_data_after_close(llhttp_t* parser, int enabled)`
+
+Enables/disables lenient handling of additional data received after a message ends
+and keep-alive is disabled.
+
+Normally `llhttp` would error when additional unexpected data is received if the message
+contains the `Connection` header with `close` value.
+With this flag the extra data will discarded without throwing an error.
+
+**Enabling this flag can pose a security issue since you will be exposed to poisoning attacks. USE WITH CAUTION!**
+
+### `void llhttp_set_lenient_optional_lf_after_cr(llhttp_t* parser, int enabled)`
+
+Enables/disables lenient handling of incomplete CRLF sequences.
+
+Normally `llhttp` would error when a CR is not followed by LF when terminating the
+request line, the status line, the headers or a chunk header.
+With this flag only a CR is required to terminate such sections.
+
+**Enabling this flag can pose a security issue since you will be exposed to request smuggling attacks. USE WITH CAUTION!**
+
+### `void llhttp_set_lenient_optional_cr_before_lf(llhttp_t* parser, int enabled)`
+
+Enables/disables lenient handling of line separators.
+
+Normally `llhttp` would error when a LF is not preceded by CR when terminating the
+request line, the status line, the headers, a chunk header or a chunk data.
+With this flag only a LF is required to terminate such sections.
+
+**Enabling this flag can pose a security issue since you will be exposed to request smuggling attacks. USE WITH CAUTION!**
+
+### `void llhttp_set_lenient_optional_crlf_after_chunk(llhttp_t* parser, int enabled)`
+
+Enables/disables lenient handling of chunks not separated via CRLF.
+
+Normally `llhttp` would error when after a chunk data a CRLF is missing before
+starting a new chunk.
+With this flag the new chunk can start immediately after the previous one.
+
+**Enabling this flag can pose a security issue since you will be exposed to request smuggling attacks. USE WITH CAUTION!**
+
+### `void llhttp_set_lenient_spaces_after_chunk_size(llhttp_t* parser, int enabled)`
+
+Enables/disables lenient handling of spaces after chunk size.
+
+Normally `llhttp` would error when after a chunk size is followed by one or more spaces are present instead of a CRLF or `;`.
+With this flag this check is disabled.
+
+**Enabling this flag can pose a security issue since you will be exposed to request smuggling attacks. USE WITH CAUTION!**
 
 ## Build Instructions
 
@@ -345,17 +412,34 @@ make
 
 ### Using with CMake
 
-If you want to use this library in a CMake project you can use the snippet below.
+If you want to use this library in a CMake project as a shared library, you can use the snippet below.
 
 ```
 FetchContent_Declare(llhttp
-  URL "https://github.com/nodejs/llhttp/archive/refs/tags/v6.0.5.tar.gz")  # Using version 6.0.5
+  URL "https://github.com/nodejs/llhttp/archive/refs/tags/release/v8.1.0.tar.gz")
 
 FetchContent_MakeAvailable(llhttp)
 
-target_link_libraries(${EXAMPLE_PROJECT_NAME} ${PROJECT_LIBRARIES} llhttp ${PROJECT_NAME})
+# Link with the llhttp_shared target
+target_link_libraries(${EXAMPLE_PROJECT_NAME} ${PROJECT_LIBRARIES} llhttp_shared ${PROJECT_NAME})
 ```
 
+If you want to use this library in a CMake project as a static library, you can set some cache variables first.
+
+```
+FetchContent_Declare(llhttp
+  URL "https://github.com/nodejs/llhttp/archive/refs/tags/release/v8.1.0.tar.gz")
+
+set(BUILD_SHARED_LIBS OFF CACHE INTERNAL "")
+set(BUILD_STATIC_LIBS ON CACHE INTERNAL "")
+FetchContent_MakeAvailable(llhttp)
+
+# Link with the llhttp_static target
+target_link_libraries(${EXAMPLE_PROJECT_NAME} ${PROJECT_LIBRARIES} llhttp_static ${PROJECT_NAME})
+```
+
+_Note that using the git repo directly (e.g., via a git repo url and tag) will not work with FetchContent_Declare because [CMakeLists.txt](./CMakeLists.txt) requires string replacements (e.g., `_RELEASE_`) before it will build._
+
 ## Building on Windows
 
 ### Installation
diff --git a/deps/llhttp/include/llhttp.h b/deps/llhttp/include/llhttp.h
index 557e1b33a7600c..fcd3349c91eead 100644
--- a/deps/llhttp/include/llhttp.h
+++ b/deps/llhttp/include/llhttp.h
@@ -1,13 +1,10 @@
+
 #ifndef INCLUDE_LLHTTP_H_
 #define INCLUDE_LLHTTP_H_
 
-#define LLHTTP_VERSION_MAJOR 8
+#define LLHTTP_VERSION_MAJOR 9
 #define LLHTTP_VERSION_MINOR 1
-#define LLHTTP_VERSION_PATCH 1
-
-#ifndef LLHTTP_STRICT_MODE
-# define LLHTTP_STRICT_MODE 0
-#endif
+#define LLHTTP_VERSION_PATCH 2
 
 #ifndef INCLUDE_LLHTTP_ITSELF_H_
 #define INCLUDE_LLHTTP_ITSELF_H_
@@ -33,7 +30,7 @@ struct llhttp__internal_s {
   uint8_t http_major;
   uint8_t http_minor;
   uint8_t header_state;
-  uint8_t lenient_flags;
+  uint16_t lenient_flags;
   uint8_t upgrade;
   uint8_t finish;
   uint16_t flags;
@@ -50,6 +47,7 @@ int llhttp__internal_execute(llhttp__internal_t* s, const char* p, const char* e
 #endif
 #endif  /* INCLUDE_LLHTTP_ITSELF_H_ */
 
+
 #ifndef LLLLHTTP_C_HEADERS_
 #define LLLLHTTP_C_HEADERS_
 #ifdef __cplusplus
@@ -114,7 +112,12 @@ enum llhttp_lenient_flags {
   LENIENT_CHUNKED_LENGTH = 0x2,
   LENIENT_KEEP_ALIVE = 0x4,
   LENIENT_TRANSFER_ENCODING = 0x8,
-  LENIENT_VERSION = 0x10
+  LENIENT_VERSION = 0x10,
+  LENIENT_DATA_AFTER_CLOSE = 0x20,
+  LENIENT_OPTIONAL_LF_AFTER_CR = 0x40,
+  LENIENT_OPTIONAL_CRLF_AFTER_CHUNK = 0x80,
+  LENIENT_OPTIONAL_CR_BEFORE_LF = 0x100,
+  LENIENT_SPACES_AFTER_CHUNK_SIZE = 0x200
 };
 typedef enum llhttp_lenient_flags llhttp_lenient_flags_t;
 
@@ -534,6 +537,7 @@ typedef enum llhttp_status llhttp_status_t;
 #endif
 #endif  /* LLLLHTTP_C_HEADERS_ */
 
+
 #ifndef INCLUDE_LLHTTP_API_H_
 #define INCLUDE_LLHTTP_API_H_
 #ifdef __cplusplus
@@ -759,7 +763,8 @@ const char* llhttp_status_name(llhttp_status_t status);
  * `HPE_INVALID_HEADER_TOKEN` will be raised for incorrect header values when
  * lenient parsing is "on".
  *
- * **(USE AT YOUR OWN RISK)**
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * request smuggling attacks. USE WITH CAUTION!**
  */
 LLHTTP_EXPORT
 void llhttp_set_lenient_headers(llhttp_t* parser, int enabled);
@@ -773,7 +778,8 @@ void llhttp_set_lenient_headers(llhttp_t* parser, int enabled);
  * request smuggling, but may be less desirable for small number of cases
  * involving legacy servers.
  *
- * **(USE AT YOUR OWN RISK)**
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * request smuggling attacks. USE WITH CAUTION!**
  */
 LLHTTP_EXPORT
 void llhttp_set_lenient_chunked_length(llhttp_t* parser, int enabled);
@@ -788,7 +794,8 @@ void llhttp_set_lenient_chunked_length(llhttp_t* parser, int enabled);
  * but might interact badly with outdated and insecure clients. With this flag
  * the extra request/response will be parsed normally.
  *
- * **(USE AT YOUR OWN RISK)**
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * poisoning attacks. USE WITH CAUTION!**
  */
 LLHTTP_EXPORT
 void llhttp_set_lenient_keep_alive(llhttp_t* parser, int enabled);
@@ -802,14 +809,90 @@ void llhttp_set_lenient_keep_alive(llhttp_t* parser, int enabled);
  * avoid request smuggling.
  * With this flag the extra value will be parsed normally.
  *
- * **(USE AT YOUR OWN RISK)**
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * request smuggling attacks. USE WITH CAUTION!**
  */
 LLHTTP_EXPORT
 void llhttp_set_lenient_transfer_encoding(llhttp_t* parser, int enabled);
 
+/* Enables/disables lenient handling of HTTP version.
+ *
+ * Normally `llhttp` would error when the HTTP version in the request or status line
+ * is not `0.9`, `1.0`, `1.1` or `2.0`.
+ * With this flag the invalid value will be parsed normally.
+ *
+ * **Enabling this flag can pose a security issue since you will allow unsupported
+ * HTTP versions. USE WITH CAUTION!**
+ */
+LLHTTP_EXPORT
+void llhttp_set_lenient_version(llhttp_t* parser, int enabled);
+
+/* Enables/disables lenient handling of additional data received after a message ends
+ * and keep-alive is disabled.
+ *
+ * Normally `llhttp` would error when additional unexpected data is received if the message
+ * contains the `Connection` header with `close` value.
+ * With this flag the extra data will discarded without throwing an error.
+ *
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * poisoning attacks. USE WITH CAUTION!**
+ */
+LLHTTP_EXPORT
+void llhttp_set_lenient_data_after_close(llhttp_t* parser, int enabled);
+
+/* Enables/disables lenient handling of incomplete CRLF sequences.
+ *
+ * Normally `llhttp` would error when a CR is not followed by LF when terminating the
+ * request line, the status line, the headers or a chunk header.
+ * With this flag only a CR is required to terminate such sections.
+ *
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * request smuggling attacks. USE WITH CAUTION!**
+ */
+LLHTTP_EXPORT
+void llhttp_set_lenient_optional_lf_after_cr(llhttp_t* parser, int enabled);
+
+/*
+ * Enables/disables lenient handling of line separators.
+ *
+ * Normally `llhttp` would error when a LF is not preceded by CR when terminating the
+ * request line, the status line, the headers, a chunk header or a chunk data.
+ * With this flag only a LF is required to terminate such sections.
+ *
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * request smuggling attacks. USE WITH CAUTION!**
+ */
+LLHTTP_EXPORT
+void llhttp_set_lenient_optional_cr_before_lf(llhttp_t* parser, int enabled);
+
+/* Enables/disables lenient handling of chunks not separated via CRLF.
+ *
+ * Normally `llhttp` would error when after a chunk data a CRLF is missing before
+ * starting a new chunk.
+ * With this flag the new chunk can start immediately after the previous one.
+ *
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * request smuggling attacks. USE WITH CAUTION!**
+ */
+LLHTTP_EXPORT
+void llhttp_set_lenient_optional_crlf_after_chunk(llhttp_t* parser, int enabled);
+
+/* Enables/disables lenient handling of spaces after chunk size.
+ *
+ * Normally `llhttp` would error when after a chunk size is followed by one or more
+ * spaces are present instead of a CRLF or `;`.
+ * With this flag this check is disabled.
+ *
+ * **Enabling this flag can pose a security issue since you will be exposed to
+ * request smuggling attacks. USE WITH CAUTION!**
+ */
+LLHTTP_EXPORT
+void llhttp_set_lenient_spaces_after_chunk_size(llhttp_t* parser, int enabled);
+
 #ifdef __cplusplus
 }  /* extern "C" */
 #endif
 #endif  /* INCLUDE_LLHTTP_API_H_ */
 
+
 #endif  /* INCLUDE_LLHTTP_H_ */
diff --git a/deps/llhttp/src/api.c b/deps/llhttp/src/api.c
index 4b687a5d990d0d..8c4d008acbae9c 100644
--- a/deps/llhttp/src/api.c
+++ b/deps/llhttp/src/api.c
@@ -283,6 +283,54 @@ void llhttp_set_lenient_transfer_encoding(llhttp_t* parser, int enabled) {
   }
 }
 
+void llhttp_set_lenient_version(llhttp_t* parser, int enabled) {
+  if (enabled) {
+    parser->lenient_flags |= LENIENT_VERSION;
+  } else {
+    parser->lenient_flags &= ~LENIENT_VERSION;
+  }
+}
+
+void llhttp_set_lenient_data_after_close(llhttp_t* parser, int enabled) {
+  if (enabled) {
+    parser->lenient_flags |= LENIENT_DATA_AFTER_CLOSE;
+  } else {
+    parser->lenient_flags &= ~LENIENT_DATA_AFTER_CLOSE;
+  }
+}
+
+void llhttp_set_lenient_optional_lf_after_cr(llhttp_t* parser, int enabled) {
+  if (enabled) {
+    parser->lenient_flags |= LENIENT_OPTIONAL_LF_AFTER_CR;
+  } else {
+    parser->lenient_flags &= ~LENIENT_OPTIONAL_LF_AFTER_CR;
+  }
+}
+
+void llhttp_set_lenient_optional_crlf_after_chunk(llhttp_t* parser, int enabled) {
+  if (enabled) {
+    parser->lenient_flags |= LENIENT_OPTIONAL_CRLF_AFTER_CHUNK;
+  } else {
+    parser->lenient_flags &= ~LENIENT_OPTIONAL_CRLF_AFTER_CHUNK;
+  }
+}
+
+void llhttp_set_lenient_optional_cr_before_lf(llhttp_t* parser, int enabled) {
+  if (enabled) {
+    parser->lenient_flags |= LENIENT_OPTIONAL_CR_BEFORE_LF;
+  } else {
+    parser->lenient_flags &= ~LENIENT_OPTIONAL_CR_BEFORE_LF;
+  }
+}
+
+void llhttp_set_lenient_spaces_after_chunk_size(llhttp_t* parser, int enabled) {
+  if (enabled) {
+    parser->lenient_flags |= LENIENT_SPACES_AFTER_CHUNK_SIZE;
+  } else {
+    parser->lenient_flags &= ~LENIENT_SPACES_AFTER_CHUNK_SIZE;
+  }
+}
+
 /* Callbacks */
 
 
diff --git a/deps/llhttp/src/http.c b/deps/llhttp/src/http.c
index 3a66044f5fb716..e44f36e316e872 100644
--- a/deps/llhttp/src/http.c
+++ b/deps/llhttp/src/http.c
@@ -39,13 +39,31 @@ int llhttp__after_headers_complete(llhttp_t* parser, const char* p,
   int hasBody;
 
   hasBody = parser->flags & F_CHUNKED || parser->content_length > 0;
-  if (parser->upgrade && (parser->method == HTTP_CONNECT ||
-                          (parser->flags & F_SKIPBODY) || !hasBody)) {
+  if (
+      (parser->upgrade && (parser->method == HTTP_CONNECT ||
+                          (parser->flags & F_SKIPBODY) || !hasBody)) ||
+      /* See RFC 2616 section 4.4 - 1xx e.g. Continue */
+      (
+        parser->type == HTTP_RESPONSE &&
+        (parser->status_code == 100 || parser->status_code == 101)
+      )
+  ) {
     /* Exit, the rest of the message is in a different protocol. */
     return 1;
   }
 
-  if (parser->flags & F_SKIPBODY) {
+  /* See RFC 2616 section 4.4 */
+  if (
+    parser->flags & F_SKIPBODY ||         /* response to a HEAD request */
+    (
+      parser->type == HTTP_RESPONSE && (
+        parser->status_code == 102 ||     /* Processing */
+        parser->status_code == 103 ||     /* Early Hints */
+        parser->status_code == 204 ||     /* No Content */
+        parser->status_code == 304        /* Not Modified */
+      )
+    )
+  ) {
     return 0;
   } else if (parser->flags & F_CHUNKED) {
     /* chunked encoding - ignore Content-Length header, prepare for a chunk */
diff --git a/deps/llhttp/src/llhttp.c b/deps/llhttp/src/llhttp.c
index f0e8df9152cf41..dfc1c414f8c3f0 100644
--- a/deps/llhttp/src/llhttp.c
+++ b/deps/llhttp/src/llhttp.c
@@ -1,5 +1,3 @@
-#if LLHTTP_STRICT_MODE
-
 #include <stdlib.h>
 #include <stdint.h>
 #include <string.h>
@@ -24,197 +22,194 @@ typedef int (*llhttp__internal__span_cb)(
              llhttp__internal_t*, const char*, const char*);
 
 static const unsigned char llparse_blob0[] = {
-  0xd, 0xa
-};
-static const unsigned char llparse_blob1[] = {
   'o', 'n'
 };
-static const unsigned char llparse_blob2[] = {
+static const unsigned char llparse_blob1[] = {
   'e', 'c', 't', 'i', 'o', 'n'
 };
-static const unsigned char llparse_blob3[] = {
+static const unsigned char llparse_blob2[] = {
   'l', 'o', 's', 'e'
 };
-static const unsigned char llparse_blob4[] = {
+static const unsigned char llparse_blob3[] = {
   'e', 'e', 'p', '-', 'a', 'l', 'i', 'v', 'e'
 };
-static const unsigned char llparse_blob5[] = {
+static const unsigned char llparse_blob4[] = {
   'p', 'g', 'r', 'a', 'd', 'e'
 };
-static const unsigned char llparse_blob6[] = {
+static const unsigned char llparse_blob5[] = {
   'c', 'h', 'u', 'n', 'k', 'e', 'd'
 };
 #ifdef __SSE4_2__
-static const unsigned char ALIGN(16) llparse_blob7[] = {
+static const unsigned char ALIGN(16) llparse_blob6[] = {
   0x9, 0x9, ' ', '~', 0x80, 0xff, 0x0, 0x0, 0x0, 0x0, 0x0,
   0x0, 0x0, 0x0, 0x0, 0x0
 };
 #endif  /* __SSE4_2__ */
 #ifdef __SSE4_2__
-static const unsigned char ALIGN(16) llparse_blob8[] = {
+static const unsigned char ALIGN(16) llparse_blob7[] = {
   '!', '!', '#', '\'', '*', '+', '-', '.', '0', '9', 'A',
   'Z', '^', 'z', '|', '|'
 };
 #endif  /* __SSE4_2__ */
 #ifdef __SSE4_2__
-static const unsigned char ALIGN(16) llparse_blob9[] = {
+static const unsigned char ALIGN(16) llparse_blob8[] = {
   '~', '~', 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
   0x0, 0x0, 0x0, 0x0, 0x0
 };
 #endif  /* __SSE4_2__ */
-static const unsigned char llparse_blob10[] = {
+static const unsigned char llparse_blob9[] = {
   'e', 'n', 't', '-', 'l', 'e', 'n', 'g', 't', 'h'
 };
-static const unsigned char llparse_blob11[] = {
+static const unsigned char llparse_blob10[] = {
   'r', 'o', 'x', 'y', '-', 'c', 'o', 'n', 'n', 'e', 'c',
   't', 'i', 'o', 'n'
 };
-static const unsigned char llparse_blob12[] = {
+static const unsigned char llparse_blob11[] = {
   'r', 'a', 'n', 's', 'f', 'e', 'r', '-', 'e', 'n', 'c',
   'o', 'd', 'i', 'n', 'g'
 };
-static const unsigned char llparse_blob13[] = {
+static const unsigned char llparse_blob12[] = {
   'p', 'g', 'r', 'a', 'd', 'e'
 };
-static const unsigned char llparse_blob14[] = {
+static const unsigned char llparse_blob13[] = {
   'T', 'T', 'P', '/'
 };
-static const unsigned char llparse_blob15[] = {
+static const unsigned char llparse_blob14[] = {
   0xd, 0xa, 0xd, 0xa, 'S', 'M', 0xd, 0xa, 0xd, 0xa
 };
-static const unsigned char llparse_blob16[] = {
+static const unsigned char llparse_blob15[] = {
   'C', 'E', '/'
 };
-static const unsigned char llparse_blob17[] = {
+static const unsigned char llparse_blob16[] = {
   'T', 'S', 'P', '/'
 };
-static const unsigned char llparse_blob18[] = {
+static const unsigned char llparse_blob17[] = {
   'N', 'O', 'U', 'N', 'C', 'E'
 };
-static const unsigned char llparse_blob19[] = {
+static const unsigned char llparse_blob18[] = {
   'I', 'N', 'D'
 };
-static const unsigned char llparse_blob20[] = {
+static const unsigned char llparse_blob19[] = {
   'E', 'C', 'K', 'O', 'U', 'T'
 };
-static const unsigned char llparse_blob21[] = {
+static const unsigned char llparse_blob20[] = {
   'N', 'E', 'C', 'T'
 };
-static const unsigned char llparse_blob22[] = {
+static const unsigned char llparse_blob21[] = {
   'E', 'T', 'E'
 };
-static const unsigned char llparse_blob23[] = {
+static const unsigned char llparse_blob22[] = {
   'C', 'R', 'I', 'B', 'E'
 };
-static const unsigned char llparse_blob24[] = {
+static const unsigned char llparse_blob23[] = {
   'L', 'U', 'S', 'H'
 };
-static const unsigned char llparse_blob25[] = {
+static const unsigned char llparse_blob24[] = {
   'E', 'T'
 };
-static const unsigned char llparse_blob26[] = {
+static const unsigned char llparse_blob25[] = {
   'P', 'A', 'R', 'A', 'M', 'E', 'T', 'E', 'R'
 };
-static const unsigned char llparse_blob27[] = {
+static const unsigned char llparse_blob26[] = {
   'E', 'A', 'D'
 };
-static const unsigned char llparse_blob28[] = {
+static const unsigned char llparse_blob27[] = {
   'N', 'K'
 };
-static const unsigned char llparse_blob29[] = {
+static const unsigned char llparse_blob28[] = {
   'C', 'K'
 };
-static const unsigned char llparse_blob30[] = {
+static const unsigned char llparse_blob29[] = {
   'S', 'E', 'A', 'R', 'C', 'H'
 };
-static const unsigned char llparse_blob31[] = {
+static const unsigned char llparse_blob30[] = {
   'R', 'G', 'E'
 };
-static const unsigned char llparse_blob32[] = {
+static const unsigned char llparse_blob31[] = {
   'C', 'T', 'I', 'V', 'I', 'T', 'Y'
 };
-static const unsigned char llparse_blob33[] = {
+static const unsigned char llparse_blob32[] = {
   'L', 'E', 'N', 'D', 'A', 'R'
 };
-static const unsigned char llparse_blob34[] = {
+static const unsigned char llparse_blob33[] = {
   'V', 'E'
 };
-static const unsigned char llparse_blob35[] = {
+static const unsigned char llparse_blob34[] = {
   'O', 'T', 'I', 'F', 'Y'
 };
-static const unsigned char llparse_blob36[] = {
+static const unsigned char llparse_blob35[] = {
   'P', 'T', 'I', 'O', 'N', 'S'
 };
-static const unsigned char llparse_blob37[] = {
+static const unsigned char llparse_blob36[] = {
   'C', 'H'
 };
-static const unsigned char llparse_blob38[] = {
+static const unsigned char llparse_blob37[] = {
   'S', 'E'
 };
-static const unsigned char llparse_blob39[] = {
+static const unsigned char llparse_blob38[] = {
   'A', 'Y'
 };
-static const unsigned char llparse_blob40[] = {
+static const unsigned char llparse_blob39[] = {
   'S', 'T'
 };
-static const unsigned char llparse_blob41[] = {
+static const unsigned char llparse_blob40[] = {
   'I', 'N', 'D'
 };
-static const unsigned char llparse_blob42[] = {
+static const unsigned char llparse_blob41[] = {
   'A', 'T', 'C', 'H'
 };
-static const unsigned char llparse_blob43[] = {
+static const unsigned char llparse_blob42[] = {
   'G', 'E'
 };
-static const unsigned char llparse_blob44[] = {
+static const unsigned char llparse_blob43[] = {
   'I', 'N', 'D'
 };
-static const unsigned char llparse_blob45[] = {
+static const unsigned char llparse_blob44[] = {
   'O', 'R', 'D'
 };
-static const unsigned char llparse_blob46[] = {
+static const unsigned char llparse_blob45[] = {
   'I', 'R', 'E', 'C', 'T'
 };
-static const unsigned char llparse_blob47[] = {
+static const unsigned char llparse_blob46[] = {
   'O', 'R', 'T'
 };
-static const unsigned char llparse_blob48[] = {
+static const unsigned char llparse_blob47[] = {
   'R', 'C', 'H'
 };
-static const unsigned char llparse_blob49[] = {
+static const unsigned char llparse_blob48[] = {
   'P', 'A', 'R', 'A', 'M', 'E', 'T', 'E', 'R'
 };
-static const unsigned char llparse_blob50[] = {
+static const unsigned char llparse_blob49[] = {
   'U', 'R', 'C', 'E'
 };
-static const unsigned char llparse_blob51[] = {
+static const unsigned char llparse_blob50[] = {
   'B', 'S', 'C', 'R', 'I', 'B', 'E'
 };
-static const unsigned char llparse_blob52[] = {
+static const unsigned char llparse_blob51[] = {
   'A', 'R', 'D', 'O', 'W', 'N'
 };
-static const unsigned char llparse_blob53[] = {
+static const unsigned char llparse_blob52[] = {
   'A', 'C', 'E'
 };
-static const unsigned char llparse_blob54[] = {
+static const unsigned char llparse_blob53[] = {
   'I', 'N', 'D'
 };
-static const unsigned char llparse_blob55[] = {
+static const unsigned char llparse_blob54[] = {
   'N', 'K'
 };
-static const unsigned char llparse_blob56[] = {
+static const unsigned char llparse_blob55[] = {
   'C', 'K'
 };
-static const unsigned char llparse_blob57[] = {
+static const unsigned char llparse_blob56[] = {
   'U', 'B', 'S', 'C', 'R', 'I', 'B', 'E'
 };
-static const unsigned char llparse_blob58[] = {
+static const unsigned char llparse_blob57[] = {
   'H', 'T', 'T', 'P', '/'
 };
-static const unsigned char llparse_blob59[] = {
+static const unsigned char llparse_blob58[] = {
   'A', 'D'
 };
-static const unsigned char llparse_blob60[] = {
+static const unsigned char llparse_blob59[] = {
   'T', 'P', '/'
 };
 
@@ -231,7 +226,7 @@ struct llparse_match_s {
 };
 typedef struct llparse_match_s llparse_match_t;
 
-static llparse_match_t llparse__match_sequence_id(
+static llparse_match_t llparse__match_sequence_to_lower(
     llhttp__internal_t* s, const unsigned char* p,
     const unsigned char* endp,
     const unsigned char* seq, uint32_t seq_len) {
@@ -242,7 +237,7 @@ static llparse_match_t llparse__match_sequence_id(
   for (; p != endp; p++) {
     unsigned char current;
 
-    current = *p;
+    current = ((*p) >= 'A' && (*p) <= 'Z' ? (*p | 0x20) : (*p));
     if (current == seq[index]) {
       if (++index == seq_len) {
         res.status = kMatchComplete;
@@ -263,7 +258,7 @@ static llparse_match_t llparse__match_sequence_id(
   return res;
 }
 
-static llparse_match_t llparse__match_sequence_to_lower(
+static llparse_match_t llparse__match_sequence_to_lower_unsafe(
     llhttp__internal_t* s, const unsigned char* p,
     const unsigned char* endp,
     const unsigned char* seq, uint32_t seq_len) {
@@ -274,7 +269,7 @@ static llparse_match_t llparse__match_sequence_to_lower(
   for (; p != endp; p++) {
     unsigned char current;
 
-    current = ((*p) >= 'A' && (*p) <= 'Z' ? (*p | 0x20) : (*p));
+    current = ((*p) | 0x20);
     if (current == seq[index]) {
       if (++index == seq_len) {
         res.status = kMatchComplete;
@@ -295,7 +290,7 @@ static llparse_match_t llparse__match_sequence_to_lower(
   return res;
 }
 
-static llparse_match_t llparse__match_sequence_to_lower_unsafe(
+static llparse_match_t llparse__match_sequence_id(
     llhttp__internal_t* s, const unsigned char* p,
     const unsigned char* endp,
     const unsigned char* seq, uint32_t seq_len) {
@@ -306,7 +301,7 @@ static llparse_match_t llparse__match_sequence_to_lower_unsafe(
   for (; p != endp; p++) {
     unsigned char current;
 
-    current = ((*p) | 0x20);
+    current = *p;
     if (current == seq[index]) {
       if (++index == seq_len) {
         res.status = kMatchComplete;
@@ -334,23 +329,28 @@ enum llparse_state_e {
   s_n_llhttp__internal__n_pause_1,
   s_n_llhttp__internal__n_invoke_is_equal_upgrade,
   s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2,
+  s_n_llhttp__internal__n_chunk_data_almost_done_1,
   s_n_llhttp__internal__n_chunk_data_almost_done,
   s_n_llhttp__internal__n_consume_content_length,
   s_n_llhttp__internal__n_span_start_llhttp__on_body,
   s_n_llhttp__internal__n_invoke_is_equal_content_length,
   s_n_llhttp__internal__n_chunk_size_almost_done,
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_9,
   s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete,
   s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_1,
+  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2,
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_10,
   s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete,
-  s_n_llhttp__internal__n_chunk_extension_quoted_value_done,
   s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1,
-  s_n_llhttp__internal__n_error_21,
-  s_n_llhttp__internal__n_chunk_extension_quoted_value,
+  s_n_llhttp__internal__n_chunk_extension_quoted_value_done,
   s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2,
-  s_n_llhttp__internal__n_error_23,
+  s_n_llhttp__internal__n_error_30,
+  s_n_llhttp__internal__n_chunk_extension_quoted_value,
+  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_3,
+  s_n_llhttp__internal__n_error_32,
   s_n_llhttp__internal__n_chunk_extension_value,
   s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_value,
-  s_n_llhttp__internal__n_error_24,
+  s_n_llhttp__internal__n_error_33,
   s_n_llhttp__internal__n_chunk_extension_name,
   s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_name,
   s_n_llhttp__internal__n_chunk_extensions,
@@ -363,17 +363,18 @@ enum llparse_state_e {
   s_n_llhttp__internal__n_eof,
   s_n_llhttp__internal__n_span_start_llhttp__on_body_2,
   s_n_llhttp__internal__n_invoke_llhttp__after_headers_complete,
+  s_n_llhttp__internal__n_error_5,
   s_n_llhttp__internal__n_headers_almost_done,
   s_n_llhttp__internal__n_header_field_colon_discard_ws,
-  s_n_llhttp__internal__n_error_33,
   s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete,
   s_n_llhttp__internal__n_span_start_llhttp__on_header_value,
   s_n_llhttp__internal__n_header_value_discard_lws,
   s_n_llhttp__internal__n_header_value_discard_ws_almost_done,
   s_n_llhttp__internal__n_header_value_lws,
   s_n_llhttp__internal__n_header_value_almost_done,
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_17,
   s_n_llhttp__internal__n_header_value_lenient,
-  s_n_llhttp__internal__n_error_41,
+  s_n_llhttp__internal__n_error_51,
   s_n_llhttp__internal__n_header_value_otherwise,
   s_n_llhttp__internal__n_header_value_connection_token,
   s_n_llhttp__internal__n_header_value_connection_ws,
@@ -381,12 +382,12 @@ enum llparse_state_e {
   s_n_llhttp__internal__n_header_value_connection_2,
   s_n_llhttp__internal__n_header_value_connection_3,
   s_n_llhttp__internal__n_header_value_connection,
-  s_n_llhttp__internal__n_error_43,
-  s_n_llhttp__internal__n_error_44,
+  s_n_llhttp__internal__n_error_53,
+  s_n_llhttp__internal__n_error_54,
   s_n_llhttp__internal__n_header_value_content_length_ws,
   s_n_llhttp__internal__n_header_value_content_length,
-  s_n_llhttp__internal__n_error_46,
-  s_n_llhttp__internal__n_error_45,
+  s_n_llhttp__internal__n_error_56,
+  s_n_llhttp__internal__n_error_55,
   s_n_llhttp__internal__n_header_value_te_token_ows,
   s_n_llhttp__internal__n_header_value,
   s_n_llhttp__internal__n_header_value_te_token,
@@ -394,6 +395,7 @@ enum llparse_state_e {
   s_n_llhttp__internal__n_header_value_te_chunked,
   s_n_llhttp__internal__n_span_start_llhttp__on_header_value_1,
   s_n_llhttp__internal__n_header_value_discard_ws,
+  s_n_llhttp__internal__n_invoke_load_header_state,
   s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete,
   s_n_llhttp__internal__n_header_field_general_otherwise,
   s_n_llhttp__internal__n_header_field_general,
@@ -414,16 +416,16 @@ enum llparse_state_e {
   s_n_llhttp__internal__n_url_skip_lf_to_http09_1,
   s_n_llhttp__internal__n_url_skip_lf_to_http09,
   s_n_llhttp__internal__n_req_pri_upgrade,
-  s_n_llhttp__internal__n_req_http_complete_1,
+  s_n_llhttp__internal__n_req_http_complete_crlf,
   s_n_llhttp__internal__n_req_http_complete,
   s_n_llhttp__internal__n_invoke_load_method_1,
   s_n_llhttp__internal__n_invoke_llhttp__on_version_complete,
-  s_n_llhttp__internal__n_error_51,
-  s_n_llhttp__internal__n_error_56,
+  s_n_llhttp__internal__n_error_63,
+  s_n_llhttp__internal__n_error_70,
   s_n_llhttp__internal__n_req_http_minor,
-  s_n_llhttp__internal__n_error_57,
+  s_n_llhttp__internal__n_error_71,
   s_n_llhttp__internal__n_req_http_dot,
-  s_n_llhttp__internal__n_error_58,
+  s_n_llhttp__internal__n_error_72,
   s_n_llhttp__internal__n_req_http_major,
   s_n_llhttp__internal__n_span_start_llhttp__on_version,
   s_n_llhttp__internal__n_req_http_start_1,
@@ -525,21 +527,22 @@ enum llparse_state_e {
   s_n_llhttp__internal__n_after_start_req_63,
   s_n_llhttp__internal__n_after_start_req,
   s_n_llhttp__internal__n_span_start_llhttp__on_method_1,
-  s_n_llhttp__internal__n_invoke_llhttp__on_status_complete,
   s_n_llhttp__internal__n_res_line_almost_done,
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_29,
   s_n_llhttp__internal__n_res_status,
   s_n_llhttp__internal__n_span_start_llhttp__on_status,
-  s_n_llhttp__internal__n_res_status_start,
   s_n_llhttp__internal__n_res_status_code_otherwise,
-  s_n_llhttp__internal__n_res_status_code,
+  s_n_llhttp__internal__n_res_status_code_digit_3,
+  s_n_llhttp__internal__n_res_status_code_digit_2,
+  s_n_llhttp__internal__n_res_status_code_digit_1,
   s_n_llhttp__internal__n_res_after_version,
   s_n_llhttp__internal__n_invoke_llhttp__on_version_complete_1,
-  s_n_llhttp__internal__n_error_73,
-  s_n_llhttp__internal__n_error_80,
+  s_n_llhttp__internal__n_error_86,
+  s_n_llhttp__internal__n_error_100,
   s_n_llhttp__internal__n_res_http_minor,
-  s_n_llhttp__internal__n_error_81,
+  s_n_llhttp__internal__n_error_101,
   s_n_llhttp__internal__n_res_http_dot,
-  s_n_llhttp__internal__n_error_82,
+  s_n_llhttp__internal__n_error_102,
   s_n_llhttp__internal__n_res_http_major,
   s_n_llhttp__internal__n_span_start_llhttp__on_version_1,
   s_n_llhttp__internal__n_start_res,
@@ -670,6 +673,13 @@ int llhttp__internal__c_test_lenient_flags(
   return (state->lenient_flags & 1) == 1;
 }
 
+int llhttp__internal__c_test_lenient_flags_1(
+    llhttp__internal_t* state,
+    const unsigned char* p,
+    const unsigned char* endp) {
+  return (state->lenient_flags & 256) == 256;
+}
+
 int llhttp__internal__c_test_flags(
     llhttp__internal_t* state,
     const unsigned char* p,
@@ -720,25 +730,18 @@ int llhttp__internal__c_update_finish_1(
   return 0;
 }
 
-int llhttp__internal__c_test_lenient_flags_1(
+int llhttp__internal__c_test_lenient_flags_2(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
   return (state->lenient_flags & 4) == 4;
 }
 
-int llhttp__internal__c_test_flags_1(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->flags & 544) == 544;
-}
-
-int llhttp__internal__c_test_lenient_flags_2(
+int llhttp__internal__c_test_lenient_flags_3(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
-  return (state->lenient_flags & 2) == 2;
+  return (state->lenient_flags & 32) == 32;
 }
 
 int llhttp__before_headers_complete(
@@ -779,6 +782,13 @@ int llhttp__internal__c_mul_add_content_length(
   return 0;
 }
 
+int llhttp__internal__c_test_lenient_flags_4(
+    llhttp__internal_t* state,
+    const unsigned char* p,
+    const unsigned char* endp) {
+  return (state->lenient_flags & 512) == 512;
+}
+
 int llhttp__on_chunk_header(
     llhttp__internal_t* s, const unsigned char* p,
     const unsigned char* endp);
@@ -790,6 +800,13 @@ int llhttp__internal__c_is_equal_content_length(
   return state->content_length == 0;
 }
 
+int llhttp__internal__c_test_lenient_flags_7(
+    llhttp__internal_t* state,
+    const unsigned char* p,
+    const unsigned char* endp) {
+  return (state->lenient_flags & 128) == 128;
+}
+
 int llhttp__internal__c_or_flags(
     llhttp__internal_t* state,
     const unsigned char* p,
@@ -798,6 +815,13 @@ int llhttp__internal__c_or_flags(
   return 0;
 }
 
+int llhttp__internal__c_test_lenient_flags_8(
+    llhttp__internal_t* state,
+    const unsigned char* p,
+    const unsigned char* endp) {
+  return (state->lenient_flags & 64) == 64;
+}
+
 int llhttp__on_chunk_extension_name_complete(
     llhttp__internal_t* s, const unsigned char* p,
     const unsigned char* endp);
@@ -850,7 +874,21 @@ int llhttp__internal__c_load_header_state(
   return state->header_state;
 }
 
-int llhttp__internal__c_or_flags_3(
+int llhttp__internal__c_test_flags_4(
+    llhttp__internal_t* state,
+    const unsigned char* p,
+    const unsigned char* endp) {
+  return (state->flags & 512) == 512;
+}
+
+int llhttp__internal__c_test_lenient_flags_21(
+    llhttp__internal_t* state,
+    const unsigned char* p,
+    const unsigned char* endp) {
+  return (state->lenient_flags & 2) == 2;
+}
+
+int llhttp__internal__c_or_flags_5(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
@@ -870,7 +908,7 @@ int llhttp__on_header_value_complete(
     llhttp__internal_t* s, const unsigned char* p,
     const unsigned char* endp);
 
-int llhttp__internal__c_or_flags_4(
+int llhttp__internal__c_or_flags_6(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
@@ -878,7 +916,7 @@ int llhttp__internal__c_or_flags_4(
   return 0;
 }
 
-int llhttp__internal__c_or_flags_5(
+int llhttp__internal__c_or_flags_7(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
@@ -886,7 +924,7 @@ int llhttp__internal__c_or_flags_5(
   return 0;
 }
 
-int llhttp__internal__c_or_flags_6(
+int llhttp__internal__c_or_flags_8(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
@@ -959,7 +997,7 @@ int llhttp__internal__c_mul_add_content_length_1(
   return 0;
 }
 
-int llhttp__internal__c_or_flags_15(
+int llhttp__internal__c_or_flags_17(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
@@ -974,14 +1012,14 @@ int llhttp__internal__c_test_flags_3(
   return (state->flags & 8) == 8;
 }
 
-int llhttp__internal__c_test_lenient_flags_8(
+int llhttp__internal__c_test_lenient_flags_19(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
   return (state->lenient_flags & 8) == 8;
 }
 
-int llhttp__internal__c_or_flags_16(
+int llhttp__internal__c_or_flags_18(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
@@ -1005,7 +1043,7 @@ int llhttp__internal__c_update_header_state_8(
   return 0;
 }
 
-int llhttp__internal__c_or_flags_18(
+int llhttp__internal__c_or_flags_20(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
@@ -1038,7 +1076,7 @@ int llhttp__internal__c_store_http_minor(
   return 0;
 }
 
-int llhttp__internal__c_test_lenient_flags_10(
+int llhttp__internal__c_test_lenient_flags_23(
     llhttp__internal_t* state,
     const unsigned char* p,
     const unsigned char* endp) {
@@ -1094,11 +1132,6 @@ int llhttp__internal__c_mul_add_status_code(
     }
   }
   state->status_code += match;
-  
-  /* Enforce maximum */
-  if (state->status_code > 999) {
-    return 1;
-  }
   return 0;
 }
 
@@ -1150,7 +1183,7 @@ static llparse_state_t llhttp__internal__run(
         }
         default: {
           p++;
-          goto s_n_llhttp__internal__n_error_7;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_3;
         }
       }
       /* UNREACHABLE */;
@@ -1194,32 +1227,46 @@ static llparse_state_t llhttp__internal__run(
         case 0:
           goto s_n_llhttp__internal__n_invoke_is_equal_upgrade;
         case 21:
-          goto s_n_llhttp__internal__n_pause_11;
+          goto s_n_llhttp__internal__n_pause_13;
         default:
-          goto s_n_llhttp__internal__n_error_28;
+          goto s_n_llhttp__internal__n_error_37;
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
+    case s_n_llhttp__internal__n_chunk_data_almost_done_1:
+    s_n_llhttp__internal__n_chunk_data_almost_done_1: {
+      if (p == endp) {
+        return s_n_llhttp__internal__n_chunk_data_almost_done_1;
+      }
+      switch (*p) {
+        case 10: {
+          p++;
+          goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete;
+        }
+        default: {
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_7;
+        }
       }
       /* UNREACHABLE */;
       abort();
     }
     case s_n_llhttp__internal__n_chunk_data_almost_done:
     s_n_llhttp__internal__n_chunk_data_almost_done: {
-      llparse_match_t match_seq;
-      
       if (p == endp) {
         return s_n_llhttp__internal__n_chunk_data_almost_done;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob0, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
+      switch (*p) {
+        case 10: {
           p++;
-          goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_6;
         }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_chunk_data_almost_done;
+        case 13: {
+          p++;
+          goto s_n_llhttp__internal__n_chunk_data_almost_done_1;
         }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_11;
+        default: {
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_7;
         }
       }
       /* UNREACHABLE */;
@@ -1276,21 +1323,32 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_header;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_12;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_8;
         }
       }
       /* UNREACHABLE */;
       abort();
     }
+    case s_n_llhttp__internal__n_invoke_test_lenient_flags_9:
+    s_n_llhttp__internal__n_invoke_test_lenient_flags_9: {
+      switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+        case 1:
+          goto s_n_llhttp__internal__n_chunk_size_almost_done;
+        default:
+          goto s_n_llhttp__internal__n_error_20;
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
     case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete:
     s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete: {
       switch (llhttp__on_chunk_extension_name_complete(state, p, endp)) {
         case 0:
-          goto s_n_llhttp__internal__n_chunk_size_almost_done;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_9;
         case 21:
           goto s_n_llhttp__internal__n_pause_5;
         default:
-          goto s_n_llhttp__internal__n_error_15;
+          goto s_n_llhttp__internal__n_error_19;
       }
       /* UNREACHABLE */;
       abort();
@@ -1299,64 +1357,104 @@ static llparse_state_t llhttp__internal__run(
     s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_1: {
       switch (llhttp__on_chunk_extension_name_complete(state, p, endp)) {
         case 0:
-          goto s_n_llhttp__internal__n_chunk_extensions;
+          goto s_n_llhttp__internal__n_chunk_size_almost_done;
         case 21:
           goto s_n_llhttp__internal__n_pause_6;
         default:
-          goto s_n_llhttp__internal__n_error_16;
+          goto s_n_llhttp__internal__n_error_21;
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete: {
-      switch (llhttp__on_chunk_extension_value_complete(state, p, endp)) {
+    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2:
+    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2: {
+      switch (llhttp__on_chunk_extension_name_complete(state, p, endp)) {
         case 0:
-          goto s_n_llhttp__internal__n_chunk_size_almost_done;
+          goto s_n_llhttp__internal__n_chunk_extensions;
         case 21:
           goto s_n_llhttp__internal__n_pause_7;
         default:
-          goto s_n_llhttp__internal__n_error_18;
+          goto s_n_llhttp__internal__n_error_22;
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_chunk_extension_quoted_value_done:
-    s_n_llhttp__internal__n_chunk_extension_quoted_value_done: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_extension_quoted_value_done;
-      }
-      switch (*p) {
-        case 13: {
-          p++;
+    case s_n_llhttp__internal__n_invoke_test_lenient_flags_10:
+    s_n_llhttp__internal__n_invoke_test_lenient_flags_10: {
+      switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+        case 1:
           goto s_n_llhttp__internal__n_chunk_size_almost_done;
-        }
-        case ';': {
-          p++;
+        default:
+          goto s_n_llhttp__internal__n_error_25;
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
+    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete:
+    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete: {
+      switch (llhttp__on_chunk_extension_value_complete(state, p, endp)) {
+        case 0:
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_10;
+        case 21:
+          goto s_n_llhttp__internal__n_pause_8;
+        default:
+          goto s_n_llhttp__internal__n_error_24;
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
+    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1:
+    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1: {
+      switch (llhttp__on_chunk_extension_value_complete(state, p, endp)) {
+        case 0:
+          goto s_n_llhttp__internal__n_chunk_size_almost_done;
+        case 21:
+          goto s_n_llhttp__internal__n_pause_9;
+        default:
+          goto s_n_llhttp__internal__n_error_26;
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
+    case s_n_llhttp__internal__n_chunk_extension_quoted_value_done:
+    s_n_llhttp__internal__n_chunk_extension_quoted_value_done: {
+      if (p == endp) {
+        return s_n_llhttp__internal__n_chunk_extension_quoted_value_done;
+      }
+      switch (*p) {
+        case 10: {
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_11;
+        }
+        case 13: {
+          p++;
+          goto s_n_llhttp__internal__n_chunk_size_almost_done;
+        }
+        case ';': {
+          p++;
           goto s_n_llhttp__internal__n_chunk_extensions;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_20;
+          goto s_n_llhttp__internal__n_error_29;
         }
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1:
-    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1: {
+    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2:
+    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2: {
       switch (llhttp__on_chunk_extension_value_complete(state, p, endp)) {
         case 0:
           goto s_n_llhttp__internal__n_chunk_extension_quoted_value_done;
         case 21:
-          goto s_n_llhttp__internal__n_pause_8;
+          goto s_n_llhttp__internal__n_pause_10;
         default:
-          goto s_n_llhttp__internal__n_error_19;
+          goto s_n_llhttp__internal__n_error_27;
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_21:
-    s_n_llhttp__internal__n_error_21: {
+    case s_n_llhttp__internal__n_error_30:
+    s_n_llhttp__internal__n_error_30: {
       state->error = 0x2;
       state->reason = "Invalid character in chunk extensions quoted value";
       state->error_pos = (const char*) p;
@@ -1395,30 +1493,30 @@ static llparse_state_t llhttp__internal__run(
         }
         case 2: {
           p++;
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_1;
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_2;
         }
         default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_2;
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_3;
         }
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2:
-    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2: {
+    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_3:
+    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_3: {
       switch (llhttp__on_chunk_extension_value_complete(state, p, endp)) {
         case 0:
           goto s_n_llhttp__internal__n_chunk_size_otherwise;
         case 21:
-          goto s_n_llhttp__internal__n_pause_9;
+          goto s_n_llhttp__internal__n_pause_11;
         default:
-          goto s_n_llhttp__internal__n_error_22;
+          goto s_n_llhttp__internal__n_error_31;
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_23:
-    s_n_llhttp__internal__n_error_23: {
+    case s_n_llhttp__internal__n_error_32:
+    s_n_llhttp__internal__n_error_32: {
       state->error = 0x2;
       state->reason = "Invalid character in chunk extensions value";
       state->error_pos = (const char*) p;
@@ -1430,14 +1528,14 @@ static llparse_state_t llhttp__internal__run(
     case s_n_llhttp__internal__n_chunk_extension_value:
     s_n_llhttp__internal__n_chunk_extension_value: {
       static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 2, 3, 2, 2, 2, 2, 2, 0, 0, 2, 2, 0, 2, 2, 0,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 4, 0, 0, 0, 0,
-        0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 0, 2, 0,
+        0, 3, 4, 3, 3, 3, 3, 3, 0, 0, 3, 3, 0, 3, 3, 0,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 5, 0, 0, 0, 0,
+        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 0, 3, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
@@ -1455,18 +1553,21 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value;
         }
         case 2: {
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_1;
+        }
+        case 3: {
           p++;
           goto s_n_llhttp__internal__n_chunk_extension_value;
         }
-        case 3: {
+        case 4: {
           p++;
           goto s_n_llhttp__internal__n_chunk_extension_quoted_value;
         }
-        case 4: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_3;
+        case 5: {
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_4;
         }
         default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_4;
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_5;
         }
       }
       /* UNREACHABLE */;
@@ -1479,12 +1580,12 @@ static llparse_state_t llhttp__internal__run(
       }
       state->_span_pos0 = (void*) p;
       state->_span_cb0 = llhttp__on_chunk_extension_value;
-      goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2;
+      goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_3;
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_24:
-    s_n_llhttp__internal__n_error_24: {
+    case s_n_llhttp__internal__n_error_33:
+    s_n_llhttp__internal__n_error_33: {
       state->error = 0x2;
       state->reason = "Invalid character in chunk extensions name";
       state->error_pos = (const char*) p;
@@ -1496,14 +1597,14 @@ static llparse_state_t llhttp__internal__run(
     case s_n_llhttp__internal__n_chunk_extension_name:
     s_n_llhttp__internal__n_chunk_extension_name: {
       static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 2, 0, 2, 2, 2, 2, 2, 0, 0, 2, 2, 0, 2, 2, 0,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 3, 0, 4, 0, 0,
-        0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 0, 2, 0,
+        0, 3, 0, 3, 3, 3, 3, 3, 0, 0, 3, 3, 0, 3, 3, 0,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 4, 0, 5, 0, 0,
+        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 3, 0, 3, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
@@ -1521,18 +1622,21 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name;
         }
         case 2: {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_extension_name;
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_1;
         }
         case 3: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_1;
+          p++;
+          goto s_n_llhttp__internal__n_chunk_extension_name;
         }
         case 4: {
           goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_2;
         }
-        default: {
+        case 5: {
           goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_3;
         }
+        default: {
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_4;
+        }
       }
       /* UNREACHABLE */;
       abort();
@@ -1556,11 +1660,11 @@ static llparse_state_t llhttp__internal__run(
       switch (*p) {
         case 13: {
           p++;
-          goto s_n_llhttp__internal__n_error_13;
+          goto s_n_llhttp__internal__n_error_17;
         }
         case ' ': {
           p++;
-          goto s_n_llhttp__internal__n_error_14;
+          goto s_n_llhttp__internal__n_error_18;
         }
         default: {
           goto s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_name;
@@ -1575,16 +1679,28 @@ static llparse_state_t llhttp__internal__run(
         return s_n_llhttp__internal__n_chunk_size_otherwise;
       }
       switch (*p) {
+        case 9: {
+          p++;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_4;
+        }
+        case 10: {
+          p++;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_5;
+        }
         case 13: {
           p++;
           goto s_n_llhttp__internal__n_chunk_size_almost_done;
         }
+        case ' ': {
+          p++;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_4;
+        }
         case ';': {
           p++;
           goto s_n_llhttp__internal__n_chunk_extensions;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_25;
+          goto s_n_llhttp__internal__n_error_34;
         }
       }
       /* UNREACHABLE */;
@@ -1830,7 +1946,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_27;
+          goto s_n_llhttp__internal__n_error_36;
         }
       }
       /* UNREACHABLE */;
@@ -1907,13 +2023,23 @@ static llparse_state_t llhttp__internal__run(
         case 4:
           goto s_n_llhttp__internal__n_invoke_update_finish_3;
         case 5:
-          goto s_n_llhttp__internal__n_error_29;
+          goto s_n_llhttp__internal__n_error_38;
         default:
           goto s_n_llhttp__internal__n_invoke_llhttp__on_message_complete;
       }
       /* UNREACHABLE */;
       abort();
     }
+    case s_n_llhttp__internal__n_error_5:
+    s_n_llhttp__internal__n_error_5: {
+      state->error = 0xa;
+      state->reason = "Invalid header field char";
+      state->error_pos = (const char*) p;
+      state->_current = (void*) (intptr_t) s_error;
+      return s_error;
+      /* UNREACHABLE */;
+      abort();
+    }
     case s_n_llhttp__internal__n_headers_almost_done:
     s_n_llhttp__internal__n_headers_almost_done: {
       if (p == endp) {
@@ -1922,10 +2048,10 @@ static llparse_state_t llhttp__internal__run(
       switch (*p) {
         case 10: {
           p++;
-          goto s_n_llhttp__internal__n_invoke_test_flags;
+          goto s_n_llhttp__internal__n_invoke_test_flags_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_32;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_12;
         }
       }
       /* UNREACHABLE */;
@@ -1948,25 +2074,15 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_33:
-    s_n_llhttp__internal__n_error_33: {
-      state->error = 0xa;
-      state->reason = "Invalid header field char";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
     case s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete:
     s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete: {
       switch (llhttp__on_header_value_complete(state, p, endp)) {
         case 0:
           goto s_n_llhttp__internal__n_header_field_start;
         case 21:
-          goto s_n_llhttp__internal__n_pause_14;
+          goto s_n_llhttp__internal__n_pause_18;
         default:
-          goto s_n_llhttp__internal__n_error_37;
+          goto s_n_llhttp__internal__n_error_46;
       }
       /* UNREACHABLE */;
       abort();
@@ -1990,14 +2106,14 @@ static llparse_state_t llhttp__internal__run(
       switch (*p) {
         case 9: {
           p++;
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_5;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_15;
         }
         case ' ': {
           p++;
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_5;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_15;
         }
         default: {
-          goto s_n_llhttp__internal__n_invoke_load_header_state;
+          goto s_n_llhttp__internal__n_invoke_load_header_state_1;
         }
       }
       /* UNREACHABLE */;
@@ -2014,7 +2130,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_header_value_discard_lws;
         }
         default: {
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_6;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_16;
         }
       }
       /* UNREACHABLE */;
@@ -2027,13 +2143,13 @@ static llparse_state_t llhttp__internal__run(
       }
       switch (*p) {
         case 9: {
-          goto s_n_llhttp__internal__n_invoke_load_header_state_3;
+          goto s_n_llhttp__internal__n_invoke_load_header_state_4;
         }
         case ' ': {
-          goto s_n_llhttp__internal__n_invoke_load_header_state_3;
+          goto s_n_llhttp__internal__n_invoke_load_header_state_4;
         }
         default: {
-          goto s_n_llhttp__internal__n_invoke_load_header_state_4;
+          goto s_n_llhttp__internal__n_invoke_load_header_state_5;
         }
       }
       /* UNREACHABLE */;
@@ -2050,12 +2166,23 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_header_value_lws;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_40;
+          goto s_n_llhttp__internal__n_error_50;
         }
       }
       /* UNREACHABLE */;
       abort();
     }
+    case s_n_llhttp__internal__n_invoke_test_lenient_flags_17:
+    s_n_llhttp__internal__n_invoke_test_lenient_flags_17: {
+      switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+        case 1:
+          goto s_n_llhttp__internal__n_header_value_almost_done;
+        default:
+          goto s_n_llhttp__internal__n_error_49;
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
     case s_n_llhttp__internal__n_header_value_lenient:
     s_n_llhttp__internal__n_header_value_lenient: {
       if (p == endp) {
@@ -2063,10 +2190,10 @@ static llparse_state_t llhttp__internal__run(
       }
       switch (*p) {
         case 10: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_3;
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_4;
         }
         case 13: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_4;
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_5;
         }
         default: {
           p++;
@@ -2076,8 +2203,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_41:
-    s_n_llhttp__internal__n_error_41: {
+    case s_n_llhttp__internal__n_error_51:
+    s_n_llhttp__internal__n_error_51: {
       state->error = 0xa;
       state->reason = "Invalid header value char";
       state->error_pos = (const char*) p;
@@ -2092,11 +2219,14 @@ static llparse_state_t llhttp__internal__run(
         return s_n_llhttp__internal__n_header_value_otherwise;
       }
       switch (*p) {
-        case 13: {
+        case 10: {
           goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_1;
         }
+        case 13: {
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_2;
+        }
         default: {
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_7;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_18;
         }
       }
       /* UNREACHABLE */;
@@ -2159,7 +2289,7 @@ static llparse_state_t llhttp__internal__run(
         }
         case ',': {
           p++;
-          goto s_n_llhttp__internal__n_invoke_load_header_state_5;
+          goto s_n_llhttp__internal__n_invoke_load_header_state_6;
         }
         default: {
           goto s_n_llhttp__internal__n_invoke_update_header_state_5;
@@ -2175,7 +2305,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_value_connection_1;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob3, 4);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob2, 4);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2199,7 +2329,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_value_connection_2;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob4, 9);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob3, 9);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2223,7 +2353,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_value_connection_3;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob5, 6);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob4, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2273,8 +2403,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_43:
-    s_n_llhttp__internal__n_error_43: {
+    case s_n_llhttp__internal__n_error_53:
+    s_n_llhttp__internal__n_error_53: {
       state->error = 0xb;
       state->reason = "Content-Length overflow";
       state->error_pos = (const char*) p;
@@ -2283,8 +2413,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_44:
-    s_n_llhttp__internal__n_error_44: {
+    case s_n_llhttp__internal__n_error_54:
+    s_n_llhttp__internal__n_error_54: {
       state->error = 0xb;
       state->reason = "Invalid character in Content-Length";
       state->error_pos = (const char*) p;
@@ -2300,17 +2430,17 @@ static llparse_state_t llhttp__internal__run(
       }
       switch (*p) {
         case 10: {
-          goto s_n_llhttp__internal__n_invoke_or_flags_15;
+          goto s_n_llhttp__internal__n_invoke_or_flags_17;
         }
         case 13: {
-          goto s_n_llhttp__internal__n_invoke_or_flags_15;
+          goto s_n_llhttp__internal__n_invoke_or_flags_17;
         }
         case ' ': {
           p++;
           goto s_n_llhttp__internal__n_header_value_content_length_ws;
         }
         default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_6;
+          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_7;
         }
       }
       /* UNREACHABLE */;
@@ -2379,8 +2509,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_46:
-    s_n_llhttp__internal__n_error_46: {
+    case s_n_llhttp__internal__n_error_56:
+    s_n_llhttp__internal__n_error_56: {
       state->error = 0xf;
       state->reason = "Invalid `Transfer-Encoding` header value";
       state->error_pos = (const char*) p;
@@ -2389,8 +2519,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_45:
-    s_n_llhttp__internal__n_error_45: {
+    case s_n_llhttp__internal__n_error_55:
+    s_n_llhttp__internal__n_error_55: {
       state->error = 0xf;
       state->reason = "Invalid `Transfer-Encoding` header value";
       state->error_pos = (const char*) p;
@@ -2452,7 +2582,7 @@ static llparse_state_t llhttp__internal__run(
       
         /* Load input */
         input = _mm_loadu_si128((__m128i const*) p);
-        ranges = _mm_loadu_si128((__m128i const*) llparse_blob7);
+        ranges = _mm_loadu_si128((__m128i const*) llparse_blob6);
       
         /* Find first character that does not match `ranges` */
         match_len = _mm_cmpestri(ranges, 6,
@@ -2551,7 +2681,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_value_te_chunked;
       }
-      match_seq = llparse__match_sequence_to_lower_unsafe(state, p, endp, llparse_blob6, 7);
+      match_seq = llparse__match_sequence_to_lower_unsafe(state, p, endp, llparse_blob5, 7);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2575,7 +2705,7 @@ static llparse_state_t llhttp__internal__run(
       }
       state->_span_pos0 = (void*) p;
       state->_span_cb0 = llhttp__on_header_value;
-      goto s_n_llhttp__internal__n_invoke_load_header_state_2;
+      goto s_n_llhttp__internal__n_invoke_load_header_state_3;
       /* UNREACHABLE */;
       abort();
     }
@@ -2591,7 +2721,7 @@ static llparse_state_t llhttp__internal__run(
         }
         case 10: {
           p++;
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_4;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_14;
         }
         case 13: {
           p++;
@@ -2608,15 +2738,28 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
+    case s_n_llhttp__internal__n_invoke_load_header_state:
+    s_n_llhttp__internal__n_invoke_load_header_state: {
+      switch (llhttp__internal__c_load_header_state(state, p, endp)) {
+        case 2:
+          goto s_n_llhttp__internal__n_invoke_test_flags_4;
+        case 3:
+          goto s_n_llhttp__internal__n_invoke_test_flags_5;
+        default:
+          goto s_n_llhttp__internal__n_header_value_discard_ws;
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
     case s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete:
     s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete: {
       switch (llhttp__on_header_field_complete(state, p, endp)) {
         case 0:
-          goto s_n_llhttp__internal__n_header_value_discard_ws;
+          goto s_n_llhttp__internal__n_invoke_load_header_state;
         case 21:
-          goto s_n_llhttp__internal__n_pause_15;
+          goto s_n_llhttp__internal__n_pause_19;
         default:
-          goto s_n_llhttp__internal__n_error_34;
+          goto s_n_llhttp__internal__n_error_43;
       }
       /* UNREACHABLE */;
       abort();
@@ -2631,7 +2774,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_span_end_llhttp__on_header_field_2;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_47;
+          goto s_n_llhttp__internal__n_error_59;
         }
       }
       /* UNREACHABLE */;
@@ -2669,7 +2812,7 @@ static llparse_state_t llhttp__internal__run(
       
         /* Load input */
         input = _mm_loadu_si128((__m128i const*) p);
-        ranges = _mm_loadu_si128((__m128i const*) llparse_blob8);
+        ranges = _mm_loadu_si128((__m128i const*) llparse_blob7);
       
         /* Find first character that does not match `ranges` */
         match_len = _mm_cmpestri(ranges, 16,
@@ -2681,7 +2824,7 @@ static llparse_state_t llhttp__internal__run(
           p += match_len;
           goto s_n_llhttp__internal__n_header_field_general;
         }
-        ranges = _mm_loadu_si128((__m128i const*) llparse_blob9);
+        ranges = _mm_loadu_si128((__m128i const*) llparse_blob8);
       
         /* Find first character that does not match `ranges` */
         match_len = _mm_cmpestri(ranges, 2,
@@ -2715,7 +2858,7 @@ static llparse_state_t llhttp__internal__run(
       }
       switch (*p) {
         case ' ': {
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_3;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_13;
         }
         case ':': {
           goto s_n_llhttp__internal__n_span_end_llhttp__on_header_field_1;
@@ -2734,7 +2877,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_field_3;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob2, 6);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob1, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2759,7 +2902,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_field_4;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob10, 10);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob9, 10);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2805,7 +2948,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_field_1;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob1, 2);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob0, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2829,7 +2972,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_field_5;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob11, 15);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob10, 15);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2854,7 +2997,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_field_6;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob12, 16);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob11, 16);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2879,7 +3022,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_header_field_7;
       }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob13, 6);
+      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob12, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -2944,7 +3087,8 @@ static llparse_state_t llhttp__internal__run(
       }
       switch (*p) {
         case 10: {
-          goto s_n_llhttp__internal__n_headers_almost_done;
+          p++;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_1;
         }
         case 13: {
           p++;
@@ -3028,7 +3172,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_url_to_http_09;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_48;
+          goto s_n_llhttp__internal__n_error_60;
         }
       }
       /* UNREACHABLE */;
@@ -3053,7 +3197,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_url_skip_lf_to_http09_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_48;
+          goto s_n_llhttp__internal__n_error_60;
         }
       }
       /* UNREACHABLE */;
@@ -3066,27 +3210,27 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_req_pri_upgrade;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob15, 10);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob14, 10);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
           p++;
-          goto s_n_llhttp__internal__n_error_54;
+          goto s_n_llhttp__internal__n_error_68;
         }
         case kMatchPause: {
           return s_n_llhttp__internal__n_req_pri_upgrade;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_55;
+          goto s_n_llhttp__internal__n_error_69;
         }
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_req_http_complete_1:
-    s_n_llhttp__internal__n_req_http_complete_1: {
+    case s_n_llhttp__internal__n_req_http_complete_crlf:
+    s_n_llhttp__internal__n_req_http_complete_crlf: {
       if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_complete_1;
+        return s_n_llhttp__internal__n_req_http_complete_crlf;
       }
       switch (*p) {
         case 10: {
@@ -3094,7 +3238,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_headers_start;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_53;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_25;
         }
       }
       /* UNREACHABLE */;
@@ -3108,14 +3252,14 @@ static llparse_state_t llhttp__internal__run(
       switch (*p) {
         case 10: {
           p++;
-          goto s_n_llhttp__internal__n_headers_start;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_24;
         }
         case 13: {
           p++;
-          goto s_n_llhttp__internal__n_req_http_complete_1;
+          goto s_n_llhttp__internal__n_req_http_complete_crlf;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_53;
+          goto s_n_llhttp__internal__n_error_67;
         }
       }
       /* UNREACHABLE */;
@@ -3138,15 +3282,15 @@ static llparse_state_t llhttp__internal__run(
         case 0:
           goto s_n_llhttp__internal__n_invoke_load_method_1;
         case 21:
-          goto s_n_llhttp__internal__n_pause_17;
+          goto s_n_llhttp__internal__n_pause_21;
         default:
-          goto s_n_llhttp__internal__n_error_52;
+          goto s_n_llhttp__internal__n_error_64;
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_51:
-    s_n_llhttp__internal__n_error_51: {
+    case s_n_llhttp__internal__n_error_63:
+    s_n_llhttp__internal__n_error_63: {
       state->error = 0x9;
       state->reason = "Invalid HTTP version";
       state->error_pos = (const char*) p;
@@ -3155,8 +3299,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_56:
-    s_n_llhttp__internal__n_error_56: {
+    case s_n_llhttp__internal__n_error_70:
+    s_n_llhttp__internal__n_error_70: {
       state->error = 0x9;
       state->reason = "Invalid minor version";
       state->error_pos = (const char*) p;
@@ -3228,8 +3372,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_57:
-    s_n_llhttp__internal__n_error_57: {
+    case s_n_llhttp__internal__n_error_71:
+    s_n_llhttp__internal__n_error_71: {
       state->error = 0x9;
       state->reason = "Expected dot";
       state->error_pos = (const char*) p;
@@ -3255,8 +3399,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_58:
-    s_n_llhttp__internal__n_error_58: {
+    case s_n_llhttp__internal__n_error_72:
+    s_n_llhttp__internal__n_error_72: {
       state->error = 0x9;
       state->reason = "Invalid major version";
       state->error_pos = (const char*) p;
@@ -3346,7 +3490,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_req_http_start_1;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob14, 4);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob13, 4);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -3357,7 +3501,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_req_http_start_1;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_61;
+          goto s_n_llhttp__internal__n_error_75;
         }
       }
       /* UNREACHABLE */;
@@ -3370,7 +3514,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_req_http_start_2;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob16, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob15, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -3381,7 +3525,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_req_http_start_2;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_61;
+          goto s_n_llhttp__internal__n_error_75;
         }
       }
       /* UNREACHABLE */;
@@ -3394,7 +3538,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_req_http_start_3;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob17, 4);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob16, 4);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -3405,7 +3549,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_req_http_start_3;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_61;
+          goto s_n_llhttp__internal__n_error_75;
         }
       }
       /* UNREACHABLE */;
@@ -3434,7 +3578,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_req_http_start_3;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_61;
+          goto s_n_llhttp__internal__n_error_75;
         }
       }
       /* UNREACHABLE */;
@@ -3525,7 +3669,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_url_fragment;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_62;
+          goto s_n_llhttp__internal__n_error_76;
         }
       }
       /* UNREACHABLE */;
@@ -3586,7 +3730,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_span_end_stub_query_3;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_63;
+          goto s_n_llhttp__internal__n_error_77;
         }
       }
       /* UNREACHABLE */;
@@ -3624,7 +3768,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_url_query;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_64;
+          goto s_n_llhttp__internal__n_error_78;
         }
       }
       /* UNREACHABLE */;
@@ -3749,10 +3893,10 @@ static llparse_state_t llhttp__internal__run(
         }
         case 8: {
           p++;
-          goto s_n_llhttp__internal__n_error_65;
+          goto s_n_llhttp__internal__n_error_79;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_66;
+          goto s_n_llhttp__internal__n_error_80;
         }
       }
       /* UNREACHABLE */;
@@ -3811,7 +3955,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_url_server_with_at;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_67;
+          goto s_n_llhttp__internal__n_error_81;
         }
       }
       /* UNREACHABLE */;
@@ -3828,7 +3972,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_url_server;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_69;
+          goto s_n_llhttp__internal__n_error_82;
         }
       }
       /* UNREACHABLE */;
@@ -3846,7 +3990,7 @@ static llparse_state_t llhttp__internal__run(
         }
         case 10: {
           p++;
-          goto s_n_llhttp__internal__n_error_68;
+          goto s_n_llhttp__internal__n_error_2;
         }
         case 12: {
           p++;
@@ -3854,18 +3998,18 @@ static llparse_state_t llhttp__internal__run(
         }
         case 13: {
           p++;
-          goto s_n_llhttp__internal__n_error_68;
+          goto s_n_llhttp__internal__n_error_2;
         }
         case ' ': {
           p++;
-          goto s_n_llhttp__internal__n_error_68;
+          goto s_n_llhttp__internal__n_error_2;
         }
         case '/': {
           p++;
           goto s_n_llhttp__internal__n_url_schema_delim_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_69;
+          goto s_n_llhttp__internal__n_error_82;
         }
       }
       /* UNREACHABLE */;
@@ -3884,14 +4028,14 @@ static llparse_state_t llhttp__internal__run(
     case s_n_llhttp__internal__n_url_schema:
     s_n_llhttp__internal__n_url_schema: {
       static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 2, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0,
-        0, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0,
-        0, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0,
+        1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0,
+        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0,
+        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
@@ -3910,18 +4054,14 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_error_2;
         }
         case 2: {
-          p++;
-          goto s_n_llhttp__internal__n_error_68;
-        }
-        case 3: {
           goto s_n_llhttp__internal__n_span_end_stub_schema;
         }
-        case 4: {
+        case 3: {
           p++;
           goto s_n_llhttp__internal__n_url_schema;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_70;
+          goto s_n_llhttp__internal__n_error_83;
         }
       }
       /* UNREACHABLE */;
@@ -3930,14 +4070,14 @@ static llparse_state_t llhttp__internal__run(
     case s_n_llhttp__internal__n_url_start:
     s_n_llhttp__internal__n_url_start: {
       static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 2, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 3,
+        1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0,
-        0, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0,
+        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0,
+        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
+        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
         0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
@@ -3956,17 +4096,13 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_error_2;
         }
         case 2: {
-          p++;
-          goto s_n_llhttp__internal__n_error_68;
-        }
-        case 3: {
           goto s_n_llhttp__internal__n_span_start_stub_path_2;
         }
-        case 4: {
+        case 3: {
           goto s_n_llhttp__internal__n_url_schema;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_71;
+          goto s_n_llhttp__internal__n_error_84;
         }
       }
       /* UNREACHABLE */;
@@ -4064,7 +4200,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_req_spaces_before_url;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_72;
+          goto s_n_llhttp__internal__n_error_85;
         }
       }
       /* UNREACHABLE */;
@@ -4076,9 +4212,9 @@ static llparse_state_t llhttp__internal__run(
         case 0:
           goto s_n_llhttp__internal__n_req_first_space_before_url;
         case 21:
-          goto s_n_llhttp__internal__n_pause_22;
+          goto s_n_llhttp__internal__n_pause_26;
         default:
-          goto s_n_llhttp__internal__n_error_84;
+          goto s_n_llhttp__internal__n_error_104;
       }
       /* UNREACHABLE */;
       abort();
@@ -4095,7 +4231,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_store_method_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4108,7 +4244,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_3;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob18, 6);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob17, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4120,7 +4256,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_3;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4141,7 +4277,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_3;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4154,7 +4290,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_4;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob19, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob18, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4166,7 +4302,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_4;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4179,7 +4315,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_6;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob20, 6);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob19, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4191,7 +4327,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_6;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4204,7 +4340,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_8;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob21, 4);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob20, 4);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4216,7 +4352,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_8;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4234,7 +4370,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_store_method_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4255,7 +4391,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_9;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4276,7 +4412,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_7;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4289,7 +4425,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_12;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob22, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob21, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4301,7 +4437,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_12;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4314,7 +4450,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_13;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob23, 5);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob22, 5);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4326,7 +4462,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_13;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4347,7 +4483,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_13;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4364,7 +4500,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_11;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4377,7 +4513,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_14;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob24, 4);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob23, 4);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4389,7 +4525,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_14;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4402,7 +4538,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_17;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob26, 9);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob25, 9);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4414,7 +4550,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_17;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4445,7 +4581,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_15;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob25, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob24, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4456,7 +4592,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_15;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4469,7 +4605,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_18;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob27, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob26, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4481,7 +4617,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_18;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4494,7 +4630,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_20;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob28, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob27, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4506,7 +4642,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_20;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4519,7 +4655,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_21;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob29, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob28, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4531,7 +4667,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_21;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4552,7 +4688,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_21;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4565,7 +4701,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_23;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob30, 6);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob29, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4577,7 +4713,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_23;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4590,7 +4726,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_24;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob31, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob30, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4602,7 +4738,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_24;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4615,7 +4751,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_26;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob32, 7);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob31, 7);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4627,7 +4763,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_26;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4640,7 +4776,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_28;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob33, 6);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob32, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4652,7 +4788,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_28;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4670,7 +4806,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_store_method_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4691,7 +4827,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_29;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4712,7 +4848,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_27;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4725,7 +4861,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_30;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob34, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob33, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4737,7 +4873,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_30;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4766,7 +4902,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_30;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4779,7 +4915,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_31;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob35, 5);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob34, 5);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4791,7 +4927,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_31;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4804,7 +4940,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_32;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob36, 6);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob35, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4816,7 +4952,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_32;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4829,7 +4965,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_35;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob37, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob36, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4841,7 +4977,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_35;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4854,7 +4990,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_36;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob38, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob37, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4866,7 +5002,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_36;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4887,7 +5023,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_36;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4900,7 +5036,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_37;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob39, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob38, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4912,7 +5048,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_37;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4925,7 +5061,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_38;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob40, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob39, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4937,7 +5073,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_38;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4950,7 +5086,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_42;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob41, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob40, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4962,7 +5098,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_42;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -4975,7 +5111,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_43;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob42, 4);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob41, 4);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -4987,7 +5123,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_43;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5008,7 +5144,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_43;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5025,7 +5161,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_41;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5047,7 +5183,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_40;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5060,7 +5196,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_45;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob43, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob42, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5072,7 +5208,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_45;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5094,7 +5230,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_store_method_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5127,7 +5263,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_44;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5140,7 +5276,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_48;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob44, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob43, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5152,7 +5288,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_48;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5165,7 +5301,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_49;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob45, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob44, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5177,7 +5313,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_49;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5190,7 +5326,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_50;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob46, 5);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob45, 5);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5202,7 +5338,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_50;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5215,7 +5351,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_51;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob47, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob46, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5227,7 +5363,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_51;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5256,7 +5392,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_51;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5273,7 +5409,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_47;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5286,7 +5422,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_54;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob48, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob47, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5298,7 +5434,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_54;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5316,7 +5452,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_store_method_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5329,7 +5465,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_57;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob49, 9);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob48, 9);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5341,7 +5477,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_57;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5362,7 +5498,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_57;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5383,7 +5519,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_55;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5396,7 +5532,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_58;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob50, 4);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob49, 4);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5408,7 +5544,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_58;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5421,7 +5557,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_59;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob51, 7);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob50, 7);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5433,7 +5569,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_59;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5458,7 +5594,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_59;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5471,7 +5607,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_61;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob52, 6);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob51, 6);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5483,7 +5619,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_61;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5496,7 +5632,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_62;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob53, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob52, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5508,7 +5644,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_62;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5529,7 +5665,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_62;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5542,7 +5678,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_65;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob54, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob53, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5554,7 +5690,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_65;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5567,7 +5703,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_67;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob55, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob54, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5579,7 +5715,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_67;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5592,7 +5728,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_68;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob56, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob55, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5604,7 +5740,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_68;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5625,7 +5761,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_68;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5638,7 +5774,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_after_start_req_69;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob57, 8);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob56, 8);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -5650,7 +5786,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_after_start_req_69;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5675,7 +5811,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_69;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5692,7 +5828,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_64;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5769,7 +5905,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_after_start_req_63;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_85;
+          goto s_n_llhttp__internal__n_error_105;
         }
       }
       /* UNREACHABLE */;
@@ -5786,19 +5922,6 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_status_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_status_complete: {
-      switch (llhttp__on_status_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_headers_start;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_20;
-        default:
-          goto s_n_llhttp__internal__n_error_76;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
     case s_n_llhttp__internal__n_res_line_almost_done:
     s_n_llhttp__internal__n_res_line_almost_done: {
       if (p == endp) {
@@ -5809,13 +5932,28 @@ static llparse_state_t llhttp__internal__run(
           p++;
           goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
         }
+        case 13: {
+          p++;
+          goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
+        }
         default: {
-          goto s_n_llhttp__internal__n_error_77;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_28;
         }
       }
       /* UNREACHABLE */;
       abort();
     }
+    case s_n_llhttp__internal__n_invoke_test_lenient_flags_29:
+    s_n_llhttp__internal__n_invoke_test_lenient_flags_29: {
+      switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+        case 1:
+          goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
+        default:
+          goto s_n_llhttp__internal__n_error_91;
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
     case s_n_llhttp__internal__n_res_status:
     s_n_llhttp__internal__n_res_status: {
       if (p == endp) {
@@ -5847,54 +5985,161 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_res_status_start:
-    s_n_llhttp__internal__n_res_status_start: {
+    case s_n_llhttp__internal__n_res_status_code_otherwise:
+    s_n_llhttp__internal__n_res_status_code_otherwise: {
       if (p == endp) {
-        return s_n_llhttp__internal__n_res_status_start;
+        return s_n_llhttp__internal__n_res_status_code_otherwise;
       }
       switch (*p) {
         case 10: {
           p++;
-          goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
+          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_27;
         }
         case 13: {
           p++;
           goto s_n_llhttp__internal__n_res_line_almost_done;
         }
-        default: {
+        case ' ': {
+          p++;
           goto s_n_llhttp__internal__n_span_start_llhttp__on_status;
         }
+        default: {
+          goto s_n_llhttp__internal__n_error_92;
+        }
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_res_status_code_otherwise:
-    s_n_llhttp__internal__n_res_status_code_otherwise: {
+    case s_n_llhttp__internal__n_res_status_code_digit_3:
+    s_n_llhttp__internal__n_res_status_code_digit_3: {
       if (p == endp) {
-        return s_n_llhttp__internal__n_res_status_code_otherwise;
+        return s_n_llhttp__internal__n_res_status_code_digit_3;
       }
       switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_res_status_start;
+        case '0': {
+          p++;
+          match = 0;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
         }
-        case 13: {
-          goto s_n_llhttp__internal__n_res_status_start;
+        case '1': {
+          p++;
+          match = 1;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
         }
-        case ' ': {
+        case '2': {
+          p++;
+          match = 2;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
+        }
+        case '3': {
+          p++;
+          match = 3;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
+        }
+        case '4': {
+          p++;
+          match = 4;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
+        }
+        case '5': {
+          p++;
+          match = 5;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
+        }
+        case '6': {
+          p++;
+          match = 6;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
+        }
+        case '7': {
+          p++;
+          match = 7;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
+        }
+        case '8': {
+          p++;
+          match = 8;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
+        }
+        case '9': {
           p++;
-          goto s_n_llhttp__internal__n_res_status_start;
+          match = 9;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_2;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_78;
+          goto s_n_llhttp__internal__n_error_94;
+        }
+      }
+      /* UNREACHABLE */;
+      abort();
+    }
+    case s_n_llhttp__internal__n_res_status_code_digit_2:
+    s_n_llhttp__internal__n_res_status_code_digit_2: {
+      if (p == endp) {
+        return s_n_llhttp__internal__n_res_status_code_digit_2;
+      }
+      switch (*p) {
+        case '0': {
+          p++;
+          match = 0;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '1': {
+          p++;
+          match = 1;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '2': {
+          p++;
+          match = 2;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '3': {
+          p++;
+          match = 3;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '4': {
+          p++;
+          match = 4;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '5': {
+          p++;
+          match = 5;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '6': {
+          p++;
+          match = 6;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '7': {
+          p++;
+          match = 7;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '8': {
+          p++;
+          match = 8;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        case '9': {
+          p++;
+          match = 9;
+          goto s_n_llhttp__internal__n_invoke_mul_add_status_code_1;
+        }
+        default: {
+          goto s_n_llhttp__internal__n_error_96;
         }
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_res_status_code:
-    s_n_llhttp__internal__n_res_status_code: {
+    case s_n_llhttp__internal__n_res_status_code_digit_1:
+    s_n_llhttp__internal__n_res_status_code_digit_1: {
       if (p == endp) {
-        return s_n_llhttp__internal__n_res_status_code;
+        return s_n_llhttp__internal__n_res_status_code_digit_1;
       }
       switch (*p) {
         case '0': {
@@ -5948,7 +6193,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
         }
         default: {
-          goto s_n_llhttp__internal__n_res_status_code_otherwise;
+          goto s_n_llhttp__internal__n_error_98;
         }
       }
       /* UNREACHABLE */;
@@ -5965,7 +6210,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_invoke_update_status_code;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_79;
+          goto s_n_llhttp__internal__n_error_99;
         }
       }
       /* UNREACHABLE */;
@@ -5977,15 +6222,15 @@ static llparse_state_t llhttp__internal__run(
         case 0:
           goto s_n_llhttp__internal__n_res_after_version;
         case 21:
-          goto s_n_llhttp__internal__n_pause_21;
+          goto s_n_llhttp__internal__n_pause_25;
         default:
-          goto s_n_llhttp__internal__n_error_74;
+          goto s_n_llhttp__internal__n_error_87;
       }
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_73:
-    s_n_llhttp__internal__n_error_73: {
+    case s_n_llhttp__internal__n_error_86:
+    s_n_llhttp__internal__n_error_86: {
       state->error = 0x9;
       state->reason = "Invalid HTTP version";
       state->error_pos = (const char*) p;
@@ -5994,8 +6239,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_80:
-    s_n_llhttp__internal__n_error_80: {
+    case s_n_llhttp__internal__n_error_100:
+    s_n_llhttp__internal__n_error_100: {
       state->error = 0x9;
       state->reason = "Invalid minor version";
       state->error_pos = (const char*) p;
@@ -6067,8 +6312,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_81:
-    s_n_llhttp__internal__n_error_81: {
+    case s_n_llhttp__internal__n_error_101:
+    s_n_llhttp__internal__n_error_101: {
       state->error = 0x9;
       state->reason = "Expected dot";
       state->error_pos = (const char*) p;
@@ -6094,8 +6339,8 @@ static llparse_state_t llhttp__internal__run(
       /* UNREACHABLE */;
       abort();
     }
-    case s_n_llhttp__internal__n_error_82:
-    s_n_llhttp__internal__n_error_82: {
+    case s_n_llhttp__internal__n_error_102:
+    s_n_llhttp__internal__n_error_102: {
       state->error = 0x9;
       state->reason = "Invalid major version";
       state->error_pos = (const char*) p;
@@ -6185,7 +6430,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_start_res;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob58, 5);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob57, 5);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -6196,7 +6441,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_start_res;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_86;
+          goto s_n_llhttp__internal__n_error_106;
         }
       }
       /* UNREACHABLE */;
@@ -6208,7 +6453,7 @@ static llparse_state_t llhttp__internal__run(
         case 0:
           goto s_n_llhttp__internal__n_req_first_space_before_url;
         case 21:
-          goto s_n_llhttp__internal__n_pause_19;
+          goto s_n_llhttp__internal__n_pause_23;
         default:
           goto s_n_llhttp__internal__n_error_1;
       }
@@ -6222,7 +6467,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_req_or_res_method_2;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob59, 2);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob58, 2);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -6234,7 +6479,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_req_or_res_method_2;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_83;
+          goto s_n_llhttp__internal__n_error_103;
         }
       }
       /* UNREACHABLE */;
@@ -6256,7 +6501,7 @@ static llparse_state_t llhttp__internal__run(
       if (p == endp) {
         return s_n_llhttp__internal__n_req_or_res_method_3;
       }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob60, 3);
+      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob59, 3);
       p = match_seq.current;
       switch (match_seq.status) {
         case kMatchComplete: {
@@ -6267,7 +6512,7 @@ static llparse_state_t llhttp__internal__run(
           return s_n_llhttp__internal__n_req_or_res_method_3;
         }
         case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_83;
+          goto s_n_llhttp__internal__n_error_103;
         }
       }
       /* UNREACHABLE */;
@@ -6288,7 +6533,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_req_or_res_method_3;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_83;
+          goto s_n_llhttp__internal__n_error_103;
         }
       }
       /* UNREACHABLE */;
@@ -6305,7 +6550,7 @@ static llparse_state_t llhttp__internal__run(
           goto s_n_llhttp__internal__n_req_or_res_method_1;
         }
         default: {
-          goto s_n_llhttp__internal__n_error_83;
+          goto s_n_llhttp__internal__n_error_103;
         }
       }
       /* UNREACHABLE */;
@@ -6386,15 +6631,6 @@ static llparse_state_t llhttp__internal__run(
       abort();
   }
   s_n_llhttp__internal__n_error_2: {
-    state->error = 0x7;
-    state->reason = "Invalid characters in url (strict mode)";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_68: {
     state->error = 0x7;
     state->reason = "Invalid characters in url";
     state->error_pos = (const char*) p;
@@ -6427,7 +6663,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_7: {
+  s_n_llhttp__internal__n_error_8: {
     state->error = 0x5;
     state->reason = "Data after `Connection: close`";
     state->error_pos = (const char*) p;
@@ -6436,8 +6672,18 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_1: {
-    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_3: {
+    switch (llhttp__internal__c_test_lenient_flags_3(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_closed;
+      default:
+        goto s_n_llhttp__internal__n_error_8;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_2: {
+    switch (llhttp__internal__c_test_lenient_flags_2(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_invoke_update_initial_message_completed;
       default:
@@ -6449,12 +6695,12 @@ static llparse_state_t llhttp__internal__run(
   s_n_llhttp__internal__n_invoke_update_finish_1: {
     switch (llhttp__internal__c_update_finish_1(state, p, endp)) {
       default:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_1;
+        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_2;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_11: {
+  s_n_llhttp__internal__n_pause_13: {
     state->error = 0x15;
     state->reason = "on_message_complete pause";
     state->error_pos = (const char*) p;
@@ -6463,7 +6709,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_28: {
+  s_n_llhttp__internal__n_error_37: {
     state->error = 0x12;
     state->reason = "`on_message_complete` callback error";
     state->error_pos = (const char*) p;
@@ -6472,7 +6718,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_13: {
+  s_n_llhttp__internal__n_pause_15: {
     state->error = 0x15;
     state->reason = "on_chunk_complete pause";
     state->error_pos = (const char*) p;
@@ -6481,7 +6727,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_31: {
+  s_n_llhttp__internal__n_error_39: {
     state->error = 0x14;
     state->reason = "`on_chunk_complete` callback error";
     state->error_pos = (const char*) p;
@@ -6495,22 +6741,13 @@ static llparse_state_t llhttp__internal__run(
       case 0:
         goto s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2;
       case 21:
-        goto s_n_llhttp__internal__n_pause_13;
+        goto s_n_llhttp__internal__n_pause_15;
       default:
-        goto s_n_llhttp__internal__n_error_31;
+        goto s_n_llhttp__internal__n_error_39;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_30: {
-    state->error = 0x4;
-    state->reason = "Content-Length can't be present with Transfer-Encoding";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
   s_n_llhttp__internal__n_pause_2: {
     state->error = 0x15;
     state->reason = "on_message_complete pause";
@@ -6520,7 +6757,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_8: {
+  s_n_llhttp__internal__n_error_9: {
     state->error = 0x12;
     state->reason = "`on_message_complete` callback error";
     state->error_pos = (const char*) p;
@@ -6536,12 +6773,12 @@ static llparse_state_t llhttp__internal__run(
       case 21:
         goto s_n_llhttp__internal__n_pause_2;
       default:
-        goto s_n_llhttp__internal__n_error_8;
+        goto s_n_llhttp__internal__n_error_9;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_26: {
+  s_n_llhttp__internal__n_error_35: {
     state->error = 0xc;
     state->reason = "Chunk size overflow";
     state->error_pos = (const char*) p;
@@ -6550,6 +6787,25 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
+  s_n_llhttp__internal__n_error_10: {
+    state->error = 0xc;
+    state->reason = "Invalid character in chunk size";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_4: {
+    switch (llhttp__internal__c_test_lenient_flags_4(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_chunk_size_otherwise;
+      default:
+        goto s_n_llhttp__internal__n_error_10;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
   s_n_llhttp__internal__n_pause_3: {
     state->error = 0x15;
     state->reason = "on_chunk_complete pause";
@@ -6559,7 +6815,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_10: {
+  s_n_llhttp__internal__n_error_14: {
     state->error = 0x14;
     state->reason = "`on_chunk_complete` callback error";
     state->error_pos = (const char*) p;
@@ -6575,20 +6831,49 @@ static llparse_state_t llhttp__internal__run(
       case 21:
         goto s_n_llhttp__internal__n_pause_3;
       default:
-        goto s_n_llhttp__internal__n_error_10;
+        goto s_n_llhttp__internal__n_error_14;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_11: {
+  s_n_llhttp__internal__n_error_13: {
+    state->error = 0x19;
+    state->reason = "Missing expected CR after chunk data";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_6: {
+    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete;
+      default:
+        goto s_n_llhttp__internal__n_error_13;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_15: {
     state->error = 0x2;
-    state->reason = "Expected CRLF after chunk";
+    state->reason = "Expected LF after chunk data";
     state->error_pos = (const char*) p;
     state->_current = (void*) (intptr_t) s_error;
     return s_error;
     /* UNREACHABLE */;
     abort();
   }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_7: {
+    switch (llhttp__internal__c_test_lenient_flags_7(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete;
+      default:
+        goto s_n_llhttp__internal__n_error_15;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
   s_n_llhttp__internal__n_span_end_llhttp__on_body: {
     const unsigned char* start;
     int err;
@@ -6623,7 +6908,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_9: {
+  s_n_llhttp__internal__n_error_12: {
     state->error = 0x13;
     state->reason = "`on_chunk_header` callback error";
     state->error_pos = (const char*) p;
@@ -6639,12 +6924,12 @@ static llparse_state_t llhttp__internal__run(
       case 21:
         goto s_n_llhttp__internal__n_pause_4;
       default:
-        goto s_n_llhttp__internal__n_error_9;
+        goto s_n_llhttp__internal__n_error_12;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_12: {
+  s_n_llhttp__internal__n_error_16: {
     state->error = 0x2;
     state->reason = "Expected LF after chunk size";
     state->error_pos = (const char*) p;
@@ -6653,7 +6938,36 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_13: {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_8: {
+    switch (llhttp__internal__c_test_lenient_flags_8(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_header;
+      default:
+        goto s_n_llhttp__internal__n_error_16;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_11: {
+    state->error = 0x19;
+    state->reason = "Missing expected CR after chunk size";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_5: {
+    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_chunk_size_almost_done;
+      default:
+        goto s_n_llhttp__internal__n_error_11;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_17: {
     state->error = 0x2;
     state->reason = "Invalid character in chunk extensions";
     state->error_pos = (const char*) p;
@@ -6662,7 +6976,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_14: {
+  s_n_llhttp__internal__n_error_18: {
     state->error = 0x2;
     state->reason = "Invalid character in chunk extensions";
     state->error_pos = (const char*) p;
@@ -6671,16 +6985,25 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
+  s_n_llhttp__internal__n_error_20: {
+    state->error = 0x19;
+    state->reason = "Missing expected CR after chunk extension name";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
   s_n_llhttp__internal__n_pause_5: {
     state->error = 0x15;
     state->reason = "on_chunk_extension_name pause";
     state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_size_almost_done;
+    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_test_lenient_flags_9;
     return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_15: {
+  s_n_llhttp__internal__n_error_19: {
     state->error = 0x22;
     state->reason = "`on_chunk_extension_name` callback error";
     state->error_pos = (const char*) p;
@@ -6698,11 +7021,10 @@ static llparse_state_t llhttp__internal__run(
     err = llhttp__on_chunk_extension_name(state, start, p);
     if (err != 0) {
       state->error = err;
-      state->error_pos = (const char*) (p + 1);
+      state->error_pos = (const char*) p;
       state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete;
       return s_error;
     }
-    p++;
     goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete;
     /* UNREACHABLE */;
     abort();
@@ -6711,12 +7033,12 @@ static llparse_state_t llhttp__internal__run(
     state->error = 0x15;
     state->reason = "on_chunk_extension_name pause";
     state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_extensions;
+    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_size_almost_done;
     return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_16: {
+  s_n_llhttp__internal__n_error_21: {
     state->error = 0x22;
     state->reason = "`on_chunk_extension_name` callback error";
     state->error_pos = (const char*) p;
@@ -6744,15 +7066,60 @@ static llparse_state_t llhttp__internal__run(
     abort();
   }
   s_n_llhttp__internal__n_pause_7: {
+    state->error = 0x15;
+    state->reason = "on_chunk_extension_name pause";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_extensions;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_22: {
+    state->error = 0x22;
+    state->reason = "`on_chunk_extension_name` callback error";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_2: {
+    const unsigned char* start;
+    int err;
+    
+    start = state->_span_pos0;
+    state->_span_pos0 = NULL;
+    err = llhttp__on_chunk_extension_name(state, start, p);
+    if (err != 0) {
+      state->error = err;
+      state->error_pos = (const char*) (p + 1);
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2;
+      return s_error;
+    }
+    p++;
+    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_25: {
+    state->error = 0x19;
+    state->reason = "Missing expected CR after chunk extension value";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_pause_8: {
     state->error = 0x15;
     state->reason = "on_chunk_extension_value pause";
     state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_size_almost_done;
+    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_test_lenient_flags_10;
     return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_18: {
+  s_n_llhttp__internal__n_error_24: {
     state->error = 0x23;
     state->reason = "`on_chunk_extension_value` callback error";
     state->error_pos = (const char*) p;
@@ -6770,16 +7137,70 @@ static llparse_state_t llhttp__internal__run(
     err = llhttp__on_chunk_extension_value(state, start, p);
     if (err != 0) {
       state->error = err;
-      state->error_pos = (const char*) (p + 1);
+      state->error_pos = (const char*) p;
       state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete;
       return s_error;
     }
-    p++;
     goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_20: {
+  s_n_llhttp__internal__n_pause_9: {
+    state->error = 0x15;
+    state->reason = "on_chunk_extension_value pause";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_size_almost_done;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_26: {
+    state->error = 0x23;
+    state->reason = "`on_chunk_extension_value` callback error";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_1: {
+    const unsigned char* start;
+    int err;
+    
+    start = state->_span_pos0;
+    state->_span_pos0 = NULL;
+    err = llhttp__on_chunk_extension_value(state, start, p);
+    if (err != 0) {
+      state->error = err;
+      state->error_pos = (const char*) (p + 1);
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1;
+      return s_error;
+    }
+    p++;
+    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_28: {
+    state->error = 0x19;
+    state->reason = "Missing expected CR after chunk extension value";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_11: {
+    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_chunk_size_almost_done;
+      default:
+        goto s_n_llhttp__internal__n_error_28;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_29: {
     state->error = 0x2;
     state->reason = "Invalid character in chunk extensions quote value";
     state->error_pos = (const char*) p;
@@ -6788,7 +7209,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_8: {
+  s_n_llhttp__internal__n_pause_10: {
     state->error = 0x15;
     state->reason = "on_chunk_extension_value pause";
     state->error_pos = (const char*) p;
@@ -6797,7 +7218,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_19: {
+  s_n_llhttp__internal__n_error_27: {
     state->error = 0x23;
     state->reason = "`on_chunk_extension_value` callback error";
     state->error_pos = (const char*) p;
@@ -6806,7 +7227,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_1: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_2: {
     const unsigned char* start;
     int err;
     
@@ -6816,14 +7237,14 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1;
+    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_2: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_3: {
     const unsigned char* start;
     int err;
     
@@ -6833,15 +7254,15 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_21;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_30;
       return s_error;
     }
     p++;
-    goto s_n_llhttp__internal__n_error_21;
+    goto s_n_llhttp__internal__n_error_30;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_9: {
+  s_n_llhttp__internal__n_pause_11: {
     state->error = 0x15;
     state->reason = "on_chunk_extension_value pause";
     state->error_pos = (const char*) p;
@@ -6850,7 +7271,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_22: {
+  s_n_llhttp__internal__n_error_31: {
     state->error = 0x23;
     state->reason = "`on_chunk_extension_value` callback error";
     state->error_pos = (const char*) p;
@@ -6859,7 +7280,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_3: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_4: {
     const unsigned char* start;
     int err;
     
@@ -6869,15 +7290,15 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_3;
       return s_error;
     }
     p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2;
+    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_3;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_4: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_5: {
     const unsigned char* start;
     int err;
     
@@ -6887,15 +7308,15 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_23;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_32;
       return s_error;
     }
     p++;
-    goto s_n_llhttp__internal__n_error_23;
+    goto s_n_llhttp__internal__n_error_32;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_10: {
+  s_n_llhttp__internal__n_pause_12: {
     state->error = 0x15;
     state->reason = "on_chunk_extension_name pause";
     state->error_pos = (const char*) p;
@@ -6904,7 +7325,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_17: {
+  s_n_llhttp__internal__n_error_23: {
     state->error = 0x22;
     state->reason = "`on_chunk_extension_name` callback error";
     state->error_pos = (const char*) p;
@@ -6913,19 +7334,19 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2: {
+  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_3: {
     switch (llhttp__on_chunk_extension_name_complete(state, p, endp)) {
       case 0:
         goto s_n_llhttp__internal__n_chunk_extension_value;
       case 21:
-        goto s_n_llhttp__internal__n_pause_10;
+        goto s_n_llhttp__internal__n_pause_12;
       default:
-        goto s_n_llhttp__internal__n_error_17;
+        goto s_n_llhttp__internal__n_error_23;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_2: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_3: {
     const unsigned char* start;
     int err;
     
@@ -6943,7 +7364,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_3: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_4: {
     const unsigned char* start;
     int err;
     
@@ -6953,15 +7374,15 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_24;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_33;
       return s_error;
     }
     p++;
-    goto s_n_llhttp__internal__n_error_24;
+    goto s_n_llhttp__internal__n_error_33;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_25: {
+  s_n_llhttp__internal__n_error_34: {
     state->error = 0xc;
     state->reason = "Invalid character in chunk size";
     state->error_pos = (const char*) p;
@@ -6973,14 +7394,14 @@ static llparse_state_t llhttp__internal__run(
   s_n_llhttp__internal__n_invoke_mul_add_content_length: {
     switch (llhttp__internal__c_mul_add_content_length(state, p, endp, match)) {
       case 1:
-        goto s_n_llhttp__internal__n_error_26;
+        goto s_n_llhttp__internal__n_error_35;
       default:
         goto s_n_llhttp__internal__n_chunk_size;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_27: {
+  s_n_llhttp__internal__n_error_36: {
     state->error = 0xc;
     state->reason = "Invalid character in chunk size";
     state->error_pos = (const char*) p;
@@ -7014,7 +7435,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_29: {
+  s_n_llhttp__internal__n_error_38: {
     state->error = 0xf;
     state->reason = "Request has invalid `Transfer-Encoding`";
     state->error_pos = (const char*) p;
@@ -7032,7 +7453,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_6: {
+  s_n_llhttp__internal__n_error_7: {
     state->error = 0x12;
     state->reason = "`on_message_complete` callback error";
     state->error_pos = (const char*) p;
@@ -7048,7 +7469,7 @@ static llparse_state_t llhttp__internal__run(
       case 21:
         goto s_n_llhttp__internal__n_pause;
       default:
-        goto s_n_llhttp__internal__n_error_6;
+        goto s_n_llhttp__internal__n_error_7;
     }
     /* UNREACHABLE */;
     abort();
@@ -7077,7 +7498,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_12: {
+  s_n_llhttp__internal__n_pause_14: {
     state->error = 0x15;
     state->reason = "Paused by on_headers_complete";
     state->error_pos = (const char*) p;
@@ -7086,7 +7507,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_5: {
+  s_n_llhttp__internal__n_error_6: {
     state->error = 0x11;
     state->reason = "User callback error";
     state->error_pos = (const char*) p;
@@ -7104,9 +7525,9 @@ static llparse_state_t llhttp__internal__run(
       case 2:
         goto s_n_llhttp__internal__n_invoke_update_upgrade;
       case 21:
-        goto s_n_llhttp__internal__n_pause_12;
+        goto s_n_llhttp__internal__n_pause_14;
       default:
-        goto s_n_llhttp__internal__n_error_5;
+        goto s_n_llhttp__internal__n_error_6;
     }
     /* UNREACHABLE */;
     abort();
@@ -7119,8994 +7540,57 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_2: {
-    switch (llhttp__internal__c_test_lenient_flags_2(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_error_30;
-      default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__before_headers_complete;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_flags_1: {
-    switch (llhttp__internal__c_test_flags_1(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_2;
-      default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__before_headers_complete;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
   s_n_llhttp__internal__n_invoke_test_flags: {
     switch (llhttp__internal__c_test_flags(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete_1;
       default:
-        goto s_n_llhttp__internal__n_invoke_test_flags_1;
+        goto s_n_llhttp__internal__n_invoke_llhttp__before_headers_complete;
     }
     /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_32: {
-    state->error = 0x2;
-    state->reason = "Expected LF after headers";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_field: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_field(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_33;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_error_33;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_3: {
-    switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_header_field_colon_discard_ws;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_field;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_36: {
-    state->error = 0xa;
-    state->reason = "Invalid header value char";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_5: {
-    switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_header_value_discard_ws;
-      default:
-        goto s_n_llhttp__internal__n_error_36;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_38: {
-    state->error = 0xb;
-    state->reason = "Empty Content-Length";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_14: {
-    state->error = 0x15;
-    state->reason = "on_header_value_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_header_field_start;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_37: {
-    state->error = 0x1d;
-    state->reason = "`on_header_value_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state: {
-    switch (llhttp__internal__c_update_header_state(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_header_value;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_3: {
-    switch (llhttp__internal__c_or_flags_3(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_4: {
-    switch (llhttp__internal__c_or_flags_4(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_5: {
-    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_6: {
-    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_header_value;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_header_state_1: {
-    switch (llhttp__internal__c_load_header_state(state, p, endp)) {
-      case 5:
-        goto s_n_llhttp__internal__n_invoke_or_flags_3;
-      case 6:
-        goto s_n_llhttp__internal__n_invoke_or_flags_4;
-      case 7:
-        goto s_n_llhttp__internal__n_invoke_or_flags_5;
-      case 8:
-        goto s_n_llhttp__internal__n_invoke_or_flags_6;
-      default:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_header_value;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_header_state: {
-    switch (llhttp__internal__c_load_header_state(state, p, endp)) {
-      case 2:
-        goto s_n_llhttp__internal__n_error_38;
-      default:
-        goto s_n_llhttp__internal__n_invoke_load_header_state_1;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_35: {
-    state->error = 0xa;
-    state->reason = "Invalid header value char";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_4: {
-    switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_header_value_discard_lws;
-      default:
-        goto s_n_llhttp__internal__n_error_35;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_39: {
-    state->error = 0x2;
-    state->reason = "Expected LF after CR";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_6: {
-    switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_header_value_discard_lws;
-      default:
-        goto s_n_llhttp__internal__n_error_39;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_1: {
-    switch (llhttp__internal__c_update_header_state_1(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_header_value_1;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_header_state_3: {
-    switch (llhttp__internal__c_load_header_state(state, p, endp)) {
-      case 8:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_1;
-      default:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_header_value_1;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_2: {
-    switch (llhttp__internal__c_update_header_state(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_7: {
-    switch (llhttp__internal__c_or_flags_3(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_2;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_8: {
-    switch (llhttp__internal__c_or_flags_4(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_2;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_9: {
-    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_2;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_10: {
-    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_header_state_4: {
-    switch (llhttp__internal__c_load_header_state(state, p, endp)) {
-      case 5:
-        goto s_n_llhttp__internal__n_invoke_or_flags_7;
-      case 6:
-        goto s_n_llhttp__internal__n_invoke_or_flags_8;
-      case 7:
-        goto s_n_llhttp__internal__n_invoke_or_flags_9;
-      case 8:
-        goto s_n_llhttp__internal__n_invoke_or_flags_10;
-      default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_40: {
-    state->error = 0x3;
-    state->reason = "Missing expected LF after header value";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_header_value_almost_done;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_header_value_almost_done;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_3: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_header_value_almost_done;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_header_value_almost_done;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_4: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_header_value_almost_done;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_header_value_almost_done;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_2: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_41;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_41;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_7: {
-    switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_header_value_lenient;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_2;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_4: {
-    switch (llhttp__internal__c_update_header_state(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_connection;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_11: {
-    switch (llhttp__internal__c_or_flags_3(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_4;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_12: {
-    switch (llhttp__internal__c_or_flags_4(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_4;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_13: {
-    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_4;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_14: {
-    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_connection;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_header_state_5: {
-    switch (llhttp__internal__c_load_header_state(state, p, endp)) {
-      case 5:
-        goto s_n_llhttp__internal__n_invoke_or_flags_11;
-      case 6:
-        goto s_n_llhttp__internal__n_invoke_or_flags_12;
-      case 7:
-        goto s_n_llhttp__internal__n_invoke_or_flags_13;
-      case 8:
-        goto s_n_llhttp__internal__n_invoke_or_flags_14;
-      default:
-        goto s_n_llhttp__internal__n_header_value_connection;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_5: {
-    switch (llhttp__internal__c_update_header_state_1(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_connection_token;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_3: {
-    switch (llhttp__internal__c_update_header_state_3(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_connection_ws;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_6: {
-    switch (llhttp__internal__c_update_header_state_6(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_connection_ws;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_7: {
-    switch (llhttp__internal__c_update_header_state_7(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_connection_ws;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_5: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_43;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_43;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_mul_add_content_length_1: {
-    switch (llhttp__internal__c_mul_add_content_length_1(state, p, endp, match)) {
-      case 1:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_5;
-      default:
-        goto s_n_llhttp__internal__n_header_value_content_length;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_15: {
-    switch (llhttp__internal__c_or_flags_15(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_otherwise;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_6: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_44;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_44;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_42: {
-    state->error = 0x4;
-    state->reason = "Duplicate Content-Length";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_flags_2: {
-    switch (llhttp__internal__c_test_flags_2(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_header_value_content_length;
-      default:
-        goto s_n_llhttp__internal__n_error_42;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_8: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_46;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_error_46;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_8: {
-    switch (llhttp__internal__c_update_header_state_8(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_otherwise;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_7: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_45;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_error_45;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_8: {
-    switch (llhttp__internal__c_test_lenient_flags_8(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_7;
-      default:
-        goto s_n_llhttp__internal__n_header_value_te_chunked;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_type_1: {
-    switch (llhttp__internal__c_load_type(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_8;
-      default:
-        goto s_n_llhttp__internal__n_header_value_te_chunked;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_9: {
-    switch (llhttp__internal__c_update_header_state_1(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_and_flags: {
-    switch (llhttp__internal__c_and_flags(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_value_te_chunked;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_17: {
-    switch (llhttp__internal__c_or_flags_16(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_and_flags;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_9: {
-    switch (llhttp__internal__c_test_lenient_flags_8(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_8;
-      default:
-        goto s_n_llhttp__internal__n_invoke_or_flags_17;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_type_2: {
-    switch (llhttp__internal__c_load_type(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_9;
-      default:
-        goto s_n_llhttp__internal__n_invoke_or_flags_17;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_16: {
-    switch (llhttp__internal__c_or_flags_16(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_and_flags;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_flags_3: {
-    switch (llhttp__internal__c_test_flags_3(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_load_type_2;
-      default:
-        goto s_n_llhttp__internal__n_invoke_or_flags_16;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags_18: {
-    switch (llhttp__internal__c_or_flags_18(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_9;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_header_state_2: {
-    switch (llhttp__internal__c_load_header_state(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_header_value_connection;
-      case 2:
-        goto s_n_llhttp__internal__n_invoke_test_flags_2;
-      case 3:
-        goto s_n_llhttp__internal__n_invoke_test_flags_3;
-      case 4:
-        goto s_n_llhttp__internal__n_invoke_or_flags_18;
-      default:
-        goto s_n_llhttp__internal__n_header_value;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_15: {
-    state->error = 0x15;
-    state->reason = "on_header_field_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_header_value_discard_ws;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_34: {
-    state->error = 0x1c;
-    state->reason = "`on_header_field_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_field_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_field(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_field_2: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_header_field(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_47: {
-    state->error = 0xa;
-    state->reason = "Invalid header token";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_10: {
-    switch (llhttp__internal__c_update_header_state_1(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_field_general;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_store_header_state: {
-    switch (llhttp__internal__c_store_header_state(state, p, endp, match)) {
-      default:
-        goto s_n_llhttp__internal__n_header_field_colon;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_header_state_11: {
-    switch (llhttp__internal__c_update_header_state_1(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_field_general;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_4: {
-    state->error = 0x1e;
-    state->reason = "Unexpected space after start line";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags: {
-    switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_header_field_start;
-      default:
-        goto s_n_llhttp__internal__n_error_4;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_16: {
-    state->error = 0x15;
-    state->reason = "on_url_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_headers_start;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_3: {
-    state->error = 0x1a;
-    state->reason = "`on_url_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_url_complete: {
-    switch (llhttp__on_url_complete(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_headers_start;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_16;
-      default:
-        goto s_n_llhttp__internal__n_error_3;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_http_minor: {
-    switch (llhttp__internal__c_update_http_minor(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__on_url_complete;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_http_major: {
-    switch (llhttp__internal__c_update_http_major(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_http_minor;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_3: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_48: {
-    state->error = 0x7;
-    state->reason = "Expected CRLF";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_4: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_lf_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_lf_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_54: {
-    state->error = 0x17;
-    state->reason = "Pause on PRI/Upgrade";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_55: {
-    state->error = 0x9;
-    state->reason = "Expected HTTP/2 Connection Preface";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_53: {
-    state->error = 0x9;
-    state->reason = "Expected CRLF after version";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_17: {
-    state->error = 0x15;
-    state->reason = "on_version_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_load_method_1;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_52: {
-    state->error = 0x21;
-    state->reason = "`on_version_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_version_complete;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_version_complete;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_51;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_51;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_http_minor: {
-    switch (llhttp__internal__c_load_http_minor(state, p, endp)) {
-      case 9:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_1;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_http_minor_1: {
-    switch (llhttp__internal__c_load_http_minor(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_1;
-      case 1:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_1;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_http_minor_2: {
-    switch (llhttp__internal__c_load_http_minor(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_1;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_http_major: {
-    switch (llhttp__internal__c_load_http_major(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_invoke_load_http_minor;
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_load_http_minor_1;
-      case 2:
-        goto s_n_llhttp__internal__n_invoke_load_http_minor_2;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_10: {
-    switch (llhttp__internal__c_test_lenient_flags_10(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_1;
-      default:
-        goto s_n_llhttp__internal__n_invoke_load_http_major;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_store_http_minor: {
-    switch (llhttp__internal__c_store_http_minor(state, p, endp, match)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_10;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_2: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_56;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_56;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_3: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_57;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_57;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_store_http_major: {
-    switch (llhttp__internal__c_store_http_major(state, p, endp, match)) {
-      default:
-        goto s_n_llhttp__internal__n_req_http_dot;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_4: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_58;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_58;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_50: {
-    state->error = 0x8;
-    state->reason = "Invalid method for HTTP/x.x request";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_method: {
-    switch (llhttp__internal__c_load_method(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 1:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 2:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 3:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 4:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 5:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 6:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 7:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 8:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 9:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 10:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 11:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 12:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 13:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 14:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 15:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 16:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 17:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 18:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 19:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 20:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 21:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 22:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 23:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 24:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 25:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 26:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 27:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 28:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 29:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 30:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 31:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 32:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 33:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 34:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      default:
-        goto s_n_llhttp__internal__n_error_50;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_61: {
-    state->error = 0x8;
-    state->reason = "Expected HTTP/";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_59: {
-    state->error = 0x8;
-    state->reason = "Expected SOURCE method for ICE/x.x request";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_method_2: {
-    switch (llhttp__internal__c_load_method(state, p, endp)) {
-      case 33:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      default:
-        goto s_n_llhttp__internal__n_error_59;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_60: {
-    state->error = 0x8;
-    state->reason = "Invalid method for RTSP/x.x request";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_method_3: {
-    switch (llhttp__internal__c_load_method(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 3:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 6:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 35:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 36:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 37:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 38:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 39:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 40:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 41:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 42:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 43:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 44:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      case 45:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      default:
-        goto s_n_llhttp__internal__n_error_60;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_18: {
-    state->error = 0x15;
-    state->reason = "on_url_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_req_http_start;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_49: {
-    state->error = 0x1a;
-    state->reason = "`on_url_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_url_complete_1: {
-    switch (llhttp__on_url_complete(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_req_http_start;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_18;
-      default:
-        goto s_n_llhttp__internal__n_error_49;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_5: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_6: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_7: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_lf_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_lf_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_8: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_62: {
-    state->error = 0x7;
-    state->reason = "Invalid char in url fragment start";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_9: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_10: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_lf_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_lf_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_11: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_63: {
-    state->error = 0x7;
-    state->reason = "Invalid char in url query";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_64: {
-    state->error = 0x7;
-    state->reason = "Invalid char in url path";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_lf_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_lf_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_2: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_12: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_13: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_lf_to_http09;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_lf_to_http09;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_url_14: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_url(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_url_skip_to_http;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_url_skip_to_http;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_65: {
-    state->error = 0x7;
-    state->reason = "Double @ in url";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_66: {
-    state->error = 0x7;
-    state->reason = "Unexpected char in url server";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_67: {
-    state->error = 0x7;
-    state->reason = "Unexpected char in url server";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_69: {
-    state->error = 0x7;
-    state->reason = "Unexpected char in url schema";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_70: {
-    state->error = 0x7;
-    state->reason = "Unexpected char in url schema";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_71: {
-    state->error = 0x7;
-    state->reason = "Unexpected start char in url";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_is_equal_method: {
-    switch (llhttp__internal__c_is_equal_method(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_url_entry_normal;
-      default:
-        goto s_n_llhttp__internal__n_url_entry_connect;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_72: {
-    state->error = 0x6;
-    state->reason = "Expected space after method";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_22: {
-    state->error = 0x15;
-    state->reason = "on_method_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_req_first_space_before_url;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_84: {
-    state->error = 0x20;
-    state->reason = "`on_method_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_method_2: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_method(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_method_complete_1;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_method_complete_1;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_store_method_1: {
-    switch (llhttp__internal__c_store_method(state, p, endp, match)) {
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_method_2;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_85: {
-    state->error = 0x6;
-    state->reason = "Invalid method encountered";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_75: {
-    state->error = 0xd;
-    state->reason = "Response overflow";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_mul_add_status_code: {
-    switch (llhttp__internal__c_mul_add_status_code(state, p, endp, match)) {
-      case 1:
-        goto s_n_llhttp__internal__n_error_75;
-      default:
-        goto s_n_llhttp__internal__n_res_status_code;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_20: {
-    state->error = 0x15;
-    state->reason = "on_status_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_headers_start;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_76: {
-    state->error = 0x1b;
-    state->reason = "`on_status_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_77: {
-    state->error = 0x2;
-    state->reason = "Expected LF after CR";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_status: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_status(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_status_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_status(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_res_line_almost_done;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_res_line_almost_done;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_78: {
-    state->error = 0xd;
-    state->reason = "Invalid response status";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_status_code: {
-    switch (llhttp__internal__c_update_status_code(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_res_status_code;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_79: {
-    state->error = 0x9;
-    state->reason = "Expected space after version";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_21: {
-    state->error = 0x15;
-    state->reason = "on_version_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_res_after_version;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_74: {
-    state->error = 0x21;
-    state->reason = "`on_version_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_6: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_version_complete_1;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_version_complete_1;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_5: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_73;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_73;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_http_minor_3: {
-    switch (llhttp__internal__c_load_http_minor(state, p, endp)) {
-      case 9:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_6;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_5;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_http_minor_4: {
-    switch (llhttp__internal__c_load_http_minor(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_6;
-      case 1:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_6;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_5;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_http_minor_5: {
-    switch (llhttp__internal__c_load_http_minor(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_6;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_5;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_http_major_1: {
-    switch (llhttp__internal__c_load_http_major(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_invoke_load_http_minor_3;
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_load_http_minor_4;
-      case 2:
-        goto s_n_llhttp__internal__n_invoke_load_http_minor_5;
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_5;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_11: {
-    switch (llhttp__internal__c_test_lenient_flags_10(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_version_6;
-      default:
-        goto s_n_llhttp__internal__n_invoke_load_http_major_1;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_store_http_minor_1: {
-    switch (llhttp__internal__c_store_http_minor(state, p, endp, match)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_11;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_7: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_80;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_80;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_8: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_81;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_81;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_store_http_major_1: {
-    switch (llhttp__internal__c_store_http_major(state, p, endp, match)) {
-      default:
-        goto s_n_llhttp__internal__n_res_http_dot;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_version_9: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_version(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_82;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_error_82;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_86: {
-    state->error = 0x8;
-    state->reason = "Expected HTTP/";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_19: {
-    state->error = 0x15;
-    state->reason = "on_method_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_req_first_space_before_url;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_1: {
-    state->error = 0x20;
-    state->reason = "`on_method_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_method: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_method(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_method_complete;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_method_complete;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_type: {
-    switch (llhttp__internal__c_update_type(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_method;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_store_method: {
-    switch (llhttp__internal__c_store_method(state, p, endp, match)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_type;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_83: {
-    state->error = 0x8;
-    state->reason = "Invalid word encountered";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_method_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_method(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_update_type_1;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_invoke_update_type_1;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_type_2: {
-    switch (llhttp__internal__c_update_type(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_method_1;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_23: {
-    state->error = 0x15;
-    state->reason = "on_message_begin pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_load_type;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error: {
-    state->error = 0x10;
-    state->reason = "`on_message_begin` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_message_begin: {
-    switch (llhttp__on_message_begin(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_invoke_load_type;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_23;
-      default:
-        goto s_n_llhttp__internal__n_error;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_24: {
-    state->error = 0x15;
-    state->reason = "on_reset pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_update_finish;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_87: {
-    state->error = 0x1f;
-    state->reason = "`on_reset` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_reset: {
-    switch (llhttp__on_reset(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_invoke_update_finish;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_24;
-      default:
-        goto s_n_llhttp__internal__n_error_87;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_load_initial_message_completed: {
-    switch (llhttp__internal__c_load_initial_message_completed(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_llhttp__on_reset;
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_finish;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-}
-
-int llhttp__internal_execute(llhttp__internal_t* state, const char* p, const char* endp) {
-  llparse_state_t next;
-
-  /* check lingering errors */
-  if (state->error != 0) {
-    return state->error;
-  }
-
-  /* restart spans */
-  if (state->_span_pos0 != NULL) {
-    state->_span_pos0 = (void*) p;
-  }
-  
-  next = llhttp__internal__run(state, (const unsigned char*) p, (const unsigned char*) endp);
-  if (next == s_error) {
-    return state->error;
-  }
-  state->_current = (void*) (intptr_t) next;
-
-  /* execute spans */
-  if (state->_span_pos0 != NULL) {
-    int error;
-  
-    error = ((llhttp__internal__span_cb) state->_span_cb0)(state, state->_span_pos0, (const char*) endp);
-    if (error != 0) {
-      state->error = error;
-      state->error_pos = endp;
-      return error;
-    }
-  }
-  
-  return 0;
-}
-
-#else  /* !LLHTTP_STRICT_MODE */
-
-#include <stdlib.h>
-#include <stdint.h>
-#include <string.h>
-
-#ifdef __SSE4_2__
- #ifdef _MSC_VER
-  #include <nmmintrin.h>
- #else  /* !_MSC_VER */
-  #include <x86intrin.h>
- #endif  /* _MSC_VER */
-#endif  /* __SSE4_2__ */
-
-#ifdef _MSC_VER
- #define ALIGN(n) _declspec(align(n))
-#else  /* !_MSC_VER */
- #define ALIGN(n) __attribute__((aligned(n)))
-#endif  /* _MSC_VER */
-
-#include "llhttp.h"
-
-typedef int (*llhttp__internal__span_cb)(
-             llhttp__internal_t*, const char*, const char*);
-
-#ifdef __SSE4_2__
-static const unsigned char ALIGN(16) llparse_blob0[] = {
-  0x9, 0x9, 0xc, 0xc, '!', '"', '$', '>', '@', '~', 0x80,
-  0xff, 0x0, 0x0, 0x0, 0x0
-};
-#endif  /* __SSE4_2__ */
-static const unsigned char llparse_blob1[] = {
-  'o', 'n'
-};
-static const unsigned char llparse_blob2[] = {
-  'e', 'c', 't', 'i', 'o', 'n'
-};
-static const unsigned char llparse_blob3[] = {
-  'l', 'o', 's', 'e'
-};
-static const unsigned char llparse_blob4[] = {
-  'e', 'e', 'p', '-', 'a', 'l', 'i', 'v', 'e'
-};
-static const unsigned char llparse_blob5[] = {
-  'p', 'g', 'r', 'a', 'd', 'e'
-};
-static const unsigned char llparse_blob6[] = {
-  'c', 'h', 'u', 'n', 'k', 'e', 'd'
-};
-#ifdef __SSE4_2__
-static const unsigned char ALIGN(16) llparse_blob7[] = {
-  0x9, 0x9, ' ', '~', 0x80, 0xff, 0x0, 0x0, 0x0, 0x0, 0x0,
-  0x0, 0x0, 0x0, 0x0, 0x0
-};
-#endif  /* __SSE4_2__ */
-#ifdef __SSE4_2__
-static const unsigned char ALIGN(16) llparse_blob8[] = {
-  ' ', '!', '#', '\'', '*', '+', '-', '.', '0', '9', 'A',
-  'Z', '^', 'z', '|', '|'
-};
-#endif  /* __SSE4_2__ */
-#ifdef __SSE4_2__
-static const unsigned char ALIGN(16) llparse_blob9[] = {
-  '~', '~', 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
-  0x0, 0x0, 0x0, 0x0, 0x0
-};
-#endif  /* __SSE4_2__ */
-static const unsigned char llparse_blob10[] = {
-  'e', 'n', 't', '-', 'l', 'e', 'n', 'g', 't', 'h'
-};
-static const unsigned char llparse_blob11[] = {
-  'r', 'o', 'x', 'y', '-', 'c', 'o', 'n', 'n', 'e', 'c',
-  't', 'i', 'o', 'n'
-};
-static const unsigned char llparse_blob12[] = {
-  'r', 'a', 'n', 's', 'f', 'e', 'r', '-', 'e', 'n', 'c',
-  'o', 'd', 'i', 'n', 'g'
-};
-static const unsigned char llparse_blob13[] = {
-  'p', 'g', 'r', 'a', 'd', 'e'
-};
-static const unsigned char llparse_blob14[] = {
-  0xd, 0xa
-};
-static const unsigned char llparse_blob15[] = {
-  'T', 'T', 'P', '/'
-};
-static const unsigned char llparse_blob16[] = {
-  0xd, 0xa, 0xd, 0xa, 'S', 'M', 0xd, 0xa, 0xd, 0xa
-};
-static const unsigned char llparse_blob17[] = {
-  'C', 'E', '/'
-};
-static const unsigned char llparse_blob18[] = {
-  'T', 'S', 'P', '/'
-};
-static const unsigned char llparse_blob19[] = {
-  'N', 'O', 'U', 'N', 'C', 'E'
-};
-static const unsigned char llparse_blob20[] = {
-  'I', 'N', 'D'
-};
-static const unsigned char llparse_blob21[] = {
-  'E', 'C', 'K', 'O', 'U', 'T'
-};
-static const unsigned char llparse_blob22[] = {
-  'N', 'E', 'C', 'T'
-};
-static const unsigned char llparse_blob23[] = {
-  'E', 'T', 'E'
-};
-static const unsigned char llparse_blob24[] = {
-  'C', 'R', 'I', 'B', 'E'
-};
-static const unsigned char llparse_blob25[] = {
-  'L', 'U', 'S', 'H'
-};
-static const unsigned char llparse_blob26[] = {
-  'E', 'T'
-};
-static const unsigned char llparse_blob27[] = {
-  'P', 'A', 'R', 'A', 'M', 'E', 'T', 'E', 'R'
-};
-static const unsigned char llparse_blob28[] = {
-  'E', 'A', 'D'
-};
-static const unsigned char llparse_blob29[] = {
-  'N', 'K'
-};
-static const unsigned char llparse_blob30[] = {
-  'C', 'K'
-};
-static const unsigned char llparse_blob31[] = {
-  'S', 'E', 'A', 'R', 'C', 'H'
-};
-static const unsigned char llparse_blob32[] = {
-  'R', 'G', 'E'
-};
-static const unsigned char llparse_blob33[] = {
-  'C', 'T', 'I', 'V', 'I', 'T', 'Y'
-};
-static const unsigned char llparse_blob34[] = {
-  'L', 'E', 'N', 'D', 'A', 'R'
-};
-static const unsigned char llparse_blob35[] = {
-  'V', 'E'
-};
-static const unsigned char llparse_blob36[] = {
-  'O', 'T', 'I', 'F', 'Y'
-};
-static const unsigned char llparse_blob37[] = {
-  'P', 'T', 'I', 'O', 'N', 'S'
-};
-static const unsigned char llparse_blob38[] = {
-  'C', 'H'
-};
-static const unsigned char llparse_blob39[] = {
-  'S', 'E'
-};
-static const unsigned char llparse_blob40[] = {
-  'A', 'Y'
-};
-static const unsigned char llparse_blob41[] = {
-  'S', 'T'
-};
-static const unsigned char llparse_blob42[] = {
-  'I', 'N', 'D'
-};
-static const unsigned char llparse_blob43[] = {
-  'A', 'T', 'C', 'H'
-};
-static const unsigned char llparse_blob44[] = {
-  'G', 'E'
-};
-static const unsigned char llparse_blob45[] = {
-  'I', 'N', 'D'
-};
-static const unsigned char llparse_blob46[] = {
-  'O', 'R', 'D'
-};
-static const unsigned char llparse_blob47[] = {
-  'I', 'R', 'E', 'C', 'T'
-};
-static const unsigned char llparse_blob48[] = {
-  'O', 'R', 'T'
-};
-static const unsigned char llparse_blob49[] = {
-  'R', 'C', 'H'
-};
-static const unsigned char llparse_blob50[] = {
-  'P', 'A', 'R', 'A', 'M', 'E', 'T', 'E', 'R'
-};
-static const unsigned char llparse_blob51[] = {
-  'U', 'R', 'C', 'E'
-};
-static const unsigned char llparse_blob52[] = {
-  'B', 'S', 'C', 'R', 'I', 'B', 'E'
-};
-static const unsigned char llparse_blob53[] = {
-  'A', 'R', 'D', 'O', 'W', 'N'
-};
-static const unsigned char llparse_blob54[] = {
-  'A', 'C', 'E'
-};
-static const unsigned char llparse_blob55[] = {
-  'I', 'N', 'D'
-};
-static const unsigned char llparse_blob56[] = {
-  'N', 'K'
-};
-static const unsigned char llparse_blob57[] = {
-  'C', 'K'
-};
-static const unsigned char llparse_blob58[] = {
-  'U', 'B', 'S', 'C', 'R', 'I', 'B', 'E'
-};
-static const unsigned char llparse_blob59[] = {
-  'H', 'T', 'T', 'P', '/'
-};
-static const unsigned char llparse_blob60[] = {
-  'A', 'D'
-};
-static const unsigned char llparse_blob61[] = {
-  'T', 'P', '/'
-};
-
-enum llparse_match_status_e {
-  kMatchComplete,
-  kMatchPause,
-  kMatchMismatch
-};
-typedef enum llparse_match_status_e llparse_match_status_t;
-
-struct llparse_match_s {
-  llparse_match_status_t status;
-  const unsigned char* current;
-};
-typedef struct llparse_match_s llparse_match_t;
-
-static llparse_match_t llparse__match_sequence_to_lower(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp,
-    const unsigned char* seq, uint32_t seq_len) {
-  uint32_t index;
-  llparse_match_t res;
-
-  index = s->_index;
-  for (; p != endp; p++) {
-    unsigned char current;
-
-    current = ((*p) >= 'A' && (*p) <= 'Z' ? (*p | 0x20) : (*p));
-    if (current == seq[index]) {
-      if (++index == seq_len) {
-        res.status = kMatchComplete;
-        goto reset;
-      }
-    } else {
-      res.status = kMatchMismatch;
-      goto reset;
-    }
-  }
-  s->_index = index;
-  res.status = kMatchPause;
-  res.current = p;
-  return res;
-reset:
-  s->_index = 0;
-  res.current = p;
-  return res;
-}
-
-static llparse_match_t llparse__match_sequence_to_lower_unsafe(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp,
-    const unsigned char* seq, uint32_t seq_len) {
-  uint32_t index;
-  llparse_match_t res;
-
-  index = s->_index;
-  for (; p != endp; p++) {
-    unsigned char current;
-
-    current = ((*p) | 0x20);
-    if (current == seq[index]) {
-      if (++index == seq_len) {
-        res.status = kMatchComplete;
-        goto reset;
-      }
-    } else {
-      res.status = kMatchMismatch;
-      goto reset;
-    }
-  }
-  s->_index = index;
-  res.status = kMatchPause;
-  res.current = p;
-  return res;
-reset:
-  s->_index = 0;
-  res.current = p;
-  return res;
-}
-
-static llparse_match_t llparse__match_sequence_id(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp,
-    const unsigned char* seq, uint32_t seq_len) {
-  uint32_t index;
-  llparse_match_t res;
-
-  index = s->_index;
-  for (; p != endp; p++) {
-    unsigned char current;
-
-    current = *p;
-    if (current == seq[index]) {
-      if (++index == seq_len) {
-        res.status = kMatchComplete;
-        goto reset;
-      }
-    } else {
-      res.status = kMatchMismatch;
-      goto reset;
-    }
-  }
-  s->_index = index;
-  res.status = kMatchPause;
-  res.current = p;
-  return res;
-reset:
-  s->_index = 0;
-  res.current = p;
-  return res;
-}
-
-enum llparse_state_e {
-  s_error,
-  s_n_llhttp__internal__n_closed,
-  s_n_llhttp__internal__n_invoke_llhttp__after_message_complete,
-  s_n_llhttp__internal__n_pause_1,
-  s_n_llhttp__internal__n_invoke_is_equal_upgrade,
-  s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2,
-  s_n_llhttp__internal__n_chunk_data_almost_done_skip,
-  s_n_llhttp__internal__n_chunk_data_almost_done,
-  s_n_llhttp__internal__n_consume_content_length,
-  s_n_llhttp__internal__n_span_start_llhttp__on_body,
-  s_n_llhttp__internal__n_invoke_is_equal_content_length,
-  s_n_llhttp__internal__n_chunk_size_almost_done,
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete,
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_1,
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete,
-  s_n_llhttp__internal__n_chunk_extension_quoted_value_done,
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1,
-  s_n_llhttp__internal__n_error_17,
-  s_n_llhttp__internal__n_chunk_extension_quoted_value,
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2,
-  s_n_llhttp__internal__n_error_19,
-  s_n_llhttp__internal__n_chunk_extension_value,
-  s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_value,
-  s_n_llhttp__internal__n_error_20,
-  s_n_llhttp__internal__n_chunk_extension_name,
-  s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_name,
-  s_n_llhttp__internal__n_chunk_extensions,
-  s_n_llhttp__internal__n_chunk_size_otherwise,
-  s_n_llhttp__internal__n_chunk_size,
-  s_n_llhttp__internal__n_chunk_size_digit,
-  s_n_llhttp__internal__n_invoke_update_content_length_1,
-  s_n_llhttp__internal__n_consume_content_length_1,
-  s_n_llhttp__internal__n_span_start_llhttp__on_body_1,
-  s_n_llhttp__internal__n_eof,
-  s_n_llhttp__internal__n_span_start_llhttp__on_body_2,
-  s_n_llhttp__internal__n_invoke_llhttp__after_headers_complete,
-  s_n_llhttp__internal__n_headers_almost_done,
-  s_n_llhttp__internal__n_header_field_colon_discard_ws,
-  s_n_llhttp__internal__n_error_28,
-  s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete,
-  s_n_llhttp__internal__n_span_start_llhttp__on_header_value,
-  s_n_llhttp__internal__n_header_value_discard_lws,
-  s_n_llhttp__internal__n_header_value_discard_ws_almost_done,
-  s_n_llhttp__internal__n_header_value_lws,
-  s_n_llhttp__internal__n_header_value_almost_done,
-  s_n_llhttp__internal__n_header_value_lenient,
-  s_n_llhttp__internal__n_error_36,
-  s_n_llhttp__internal__n_header_value_otherwise,
-  s_n_llhttp__internal__n_header_value_connection_token,
-  s_n_llhttp__internal__n_header_value_connection_ws,
-  s_n_llhttp__internal__n_header_value_connection_1,
-  s_n_llhttp__internal__n_header_value_connection_2,
-  s_n_llhttp__internal__n_header_value_connection_3,
-  s_n_llhttp__internal__n_header_value_connection,
-  s_n_llhttp__internal__n_error_38,
-  s_n_llhttp__internal__n_error_39,
-  s_n_llhttp__internal__n_header_value_content_length_ws,
-  s_n_llhttp__internal__n_header_value_content_length,
-  s_n_llhttp__internal__n_error_41,
-  s_n_llhttp__internal__n_error_40,
-  s_n_llhttp__internal__n_header_value_te_token_ows,
-  s_n_llhttp__internal__n_header_value,
-  s_n_llhttp__internal__n_header_value_te_token,
-  s_n_llhttp__internal__n_header_value_te_chunked_last,
-  s_n_llhttp__internal__n_header_value_te_chunked,
-  s_n_llhttp__internal__n_span_start_llhttp__on_header_value_1,
-  s_n_llhttp__internal__n_header_value_discard_ws,
-  s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete,
-  s_n_llhttp__internal__n_header_field_general_otherwise,
-  s_n_llhttp__internal__n_header_field_general,
-  s_n_llhttp__internal__n_header_field_colon,
-  s_n_llhttp__internal__n_header_field_3,
-  s_n_llhttp__internal__n_header_field_4,
-  s_n_llhttp__internal__n_header_field_2,
-  s_n_llhttp__internal__n_header_field_1,
-  s_n_llhttp__internal__n_header_field_5,
-  s_n_llhttp__internal__n_header_field_6,
-  s_n_llhttp__internal__n_header_field_7,
-  s_n_llhttp__internal__n_header_field,
-  s_n_llhttp__internal__n_span_start_llhttp__on_header_field,
-  s_n_llhttp__internal__n_header_field_start,
-  s_n_llhttp__internal__n_headers_start,
-  s_n_llhttp__internal__n_url_skip_to_http09,
-  s_n_llhttp__internal__n_url_skip_lf_to_http09,
-  s_n_llhttp__internal__n_req_pri_upgrade,
-  s_n_llhttp__internal__n_req_http_complete_1,
-  s_n_llhttp__internal__n_req_http_complete,
-  s_n_llhttp__internal__n_invoke_load_method_1,
-  s_n_llhttp__internal__n_invoke_llhttp__on_version_complete,
-  s_n_llhttp__internal__n_error_46,
-  s_n_llhttp__internal__n_error_51,
-  s_n_llhttp__internal__n_req_http_minor,
-  s_n_llhttp__internal__n_error_52,
-  s_n_llhttp__internal__n_req_http_dot,
-  s_n_llhttp__internal__n_error_53,
-  s_n_llhttp__internal__n_req_http_major,
-  s_n_llhttp__internal__n_span_start_llhttp__on_version,
-  s_n_llhttp__internal__n_req_http_start_1,
-  s_n_llhttp__internal__n_req_http_start_2,
-  s_n_llhttp__internal__n_req_http_start_3,
-  s_n_llhttp__internal__n_req_http_start,
-  s_n_llhttp__internal__n_url_skip_to_http,
-  s_n_llhttp__internal__n_url_fragment,
-  s_n_llhttp__internal__n_span_end_stub_query_3,
-  s_n_llhttp__internal__n_url_query,
-  s_n_llhttp__internal__n_url_query_or_fragment,
-  s_n_llhttp__internal__n_url_path,
-  s_n_llhttp__internal__n_span_start_stub_path_2,
-  s_n_llhttp__internal__n_span_start_stub_path,
-  s_n_llhttp__internal__n_span_start_stub_path_1,
-  s_n_llhttp__internal__n_url_server_with_at,
-  s_n_llhttp__internal__n_url_server,
-  s_n_llhttp__internal__n_url_schema_delim_1,
-  s_n_llhttp__internal__n_url_schema_delim,
-  s_n_llhttp__internal__n_span_end_stub_schema,
-  s_n_llhttp__internal__n_url_schema,
-  s_n_llhttp__internal__n_url_start,
-  s_n_llhttp__internal__n_span_start_llhttp__on_url_1,
-  s_n_llhttp__internal__n_span_start_llhttp__on_url,
-  s_n_llhttp__internal__n_req_spaces_before_url,
-  s_n_llhttp__internal__n_req_first_space_before_url,
-  s_n_llhttp__internal__n_invoke_llhttp__on_method_complete_1,
-  s_n_llhttp__internal__n_after_start_req_2,
-  s_n_llhttp__internal__n_after_start_req_3,
-  s_n_llhttp__internal__n_after_start_req_1,
-  s_n_llhttp__internal__n_after_start_req_4,
-  s_n_llhttp__internal__n_after_start_req_6,
-  s_n_llhttp__internal__n_after_start_req_8,
-  s_n_llhttp__internal__n_after_start_req_9,
-  s_n_llhttp__internal__n_after_start_req_7,
-  s_n_llhttp__internal__n_after_start_req_5,
-  s_n_llhttp__internal__n_after_start_req_12,
-  s_n_llhttp__internal__n_after_start_req_13,
-  s_n_llhttp__internal__n_after_start_req_11,
-  s_n_llhttp__internal__n_after_start_req_10,
-  s_n_llhttp__internal__n_after_start_req_14,
-  s_n_llhttp__internal__n_after_start_req_17,
-  s_n_llhttp__internal__n_after_start_req_16,
-  s_n_llhttp__internal__n_after_start_req_15,
-  s_n_llhttp__internal__n_after_start_req_18,
-  s_n_llhttp__internal__n_after_start_req_20,
-  s_n_llhttp__internal__n_after_start_req_21,
-  s_n_llhttp__internal__n_after_start_req_19,
-  s_n_llhttp__internal__n_after_start_req_23,
-  s_n_llhttp__internal__n_after_start_req_24,
-  s_n_llhttp__internal__n_after_start_req_26,
-  s_n_llhttp__internal__n_after_start_req_28,
-  s_n_llhttp__internal__n_after_start_req_29,
-  s_n_llhttp__internal__n_after_start_req_27,
-  s_n_llhttp__internal__n_after_start_req_25,
-  s_n_llhttp__internal__n_after_start_req_30,
-  s_n_llhttp__internal__n_after_start_req_22,
-  s_n_llhttp__internal__n_after_start_req_31,
-  s_n_llhttp__internal__n_after_start_req_32,
-  s_n_llhttp__internal__n_after_start_req_35,
-  s_n_llhttp__internal__n_after_start_req_36,
-  s_n_llhttp__internal__n_after_start_req_34,
-  s_n_llhttp__internal__n_after_start_req_37,
-  s_n_llhttp__internal__n_after_start_req_38,
-  s_n_llhttp__internal__n_after_start_req_42,
-  s_n_llhttp__internal__n_after_start_req_43,
-  s_n_llhttp__internal__n_after_start_req_41,
-  s_n_llhttp__internal__n_after_start_req_40,
-  s_n_llhttp__internal__n_after_start_req_39,
-  s_n_llhttp__internal__n_after_start_req_45,
-  s_n_llhttp__internal__n_after_start_req_44,
-  s_n_llhttp__internal__n_after_start_req_33,
-  s_n_llhttp__internal__n_after_start_req_48,
-  s_n_llhttp__internal__n_after_start_req_49,
-  s_n_llhttp__internal__n_after_start_req_50,
-  s_n_llhttp__internal__n_after_start_req_51,
-  s_n_llhttp__internal__n_after_start_req_47,
-  s_n_llhttp__internal__n_after_start_req_46,
-  s_n_llhttp__internal__n_after_start_req_54,
-  s_n_llhttp__internal__n_after_start_req_56,
-  s_n_llhttp__internal__n_after_start_req_57,
-  s_n_llhttp__internal__n_after_start_req_55,
-  s_n_llhttp__internal__n_after_start_req_53,
-  s_n_llhttp__internal__n_after_start_req_58,
-  s_n_llhttp__internal__n_after_start_req_59,
-  s_n_llhttp__internal__n_after_start_req_52,
-  s_n_llhttp__internal__n_after_start_req_61,
-  s_n_llhttp__internal__n_after_start_req_62,
-  s_n_llhttp__internal__n_after_start_req_60,
-  s_n_llhttp__internal__n_after_start_req_65,
-  s_n_llhttp__internal__n_after_start_req_67,
-  s_n_llhttp__internal__n_after_start_req_68,
-  s_n_llhttp__internal__n_after_start_req_66,
-  s_n_llhttp__internal__n_after_start_req_69,
-  s_n_llhttp__internal__n_after_start_req_64,
-  s_n_llhttp__internal__n_after_start_req_63,
-  s_n_llhttp__internal__n_after_start_req,
-  s_n_llhttp__internal__n_span_start_llhttp__on_method_1,
-  s_n_llhttp__internal__n_invoke_llhttp__on_status_complete,
-  s_n_llhttp__internal__n_res_line_almost_done,
-  s_n_llhttp__internal__n_res_status,
-  s_n_llhttp__internal__n_span_start_llhttp__on_status,
-  s_n_llhttp__internal__n_res_status_start,
-  s_n_llhttp__internal__n_res_status_code_otherwise,
-  s_n_llhttp__internal__n_res_status_code,
-  s_n_llhttp__internal__n_res_after_version,
-  s_n_llhttp__internal__n_invoke_llhttp__on_version_complete_1,
-  s_n_llhttp__internal__n_error_68,
-  s_n_llhttp__internal__n_error_74,
-  s_n_llhttp__internal__n_res_http_minor,
-  s_n_llhttp__internal__n_error_75,
-  s_n_llhttp__internal__n_res_http_dot,
-  s_n_llhttp__internal__n_error_76,
-  s_n_llhttp__internal__n_res_http_major,
-  s_n_llhttp__internal__n_span_start_llhttp__on_version_1,
-  s_n_llhttp__internal__n_start_res,
-  s_n_llhttp__internal__n_invoke_llhttp__on_method_complete,
-  s_n_llhttp__internal__n_req_or_res_method_2,
-  s_n_llhttp__internal__n_invoke_update_type_1,
-  s_n_llhttp__internal__n_req_or_res_method_3,
-  s_n_llhttp__internal__n_req_or_res_method_1,
-  s_n_llhttp__internal__n_req_or_res_method,
-  s_n_llhttp__internal__n_span_start_llhttp__on_method,
-  s_n_llhttp__internal__n_start_req_or_res,
-  s_n_llhttp__internal__n_invoke_load_type,
-  s_n_llhttp__internal__n_invoke_update_finish,
-  s_n_llhttp__internal__n_start,
-};
-typedef enum llparse_state_e llparse_state_t;
-
-int llhttp__on_method(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_url(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_version(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_header_field(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_header_value(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_body(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_chunk_extension_name(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_chunk_extension_value(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_status(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_load_initial_message_completed(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->initial_message_completed;
-}
-
-int llhttp__on_reset(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_update_finish(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->finish = 2;
-  return 0;
-}
-
-int llhttp__on_message_begin(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_load_type(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->type;
-}
-
-int llhttp__internal__c_store_method(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp,
-    int match) {
-  state->method = match;
-  return 0;
-}
-
-int llhttp__on_method_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_is_equal_method(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->method == 5;
-}
-
-int llhttp__internal__c_update_http_major(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->http_major = 0;
-  return 0;
-}
-
-int llhttp__internal__c_update_http_minor(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->http_minor = 9;
-  return 0;
-}
-
-int llhttp__on_url_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_test_lenient_flags(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->lenient_flags & 1) == 1;
-}
-
-int llhttp__internal__c_test_flags(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->flags & 128) == 128;
-}
-
-int llhttp__on_chunk_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_message_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_is_equal_upgrade(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->upgrade == 1;
-}
-
-int llhttp__after_message_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_update_content_length(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->content_length = 0;
-  return 0;
-}
-
-int llhttp__internal__c_update_initial_message_completed(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->initial_message_completed = 1;
-  return 0;
-}
-
-int llhttp__internal__c_update_finish_1(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->finish = 0;
-  return 0;
-}
-
-int llhttp__internal__c_test_lenient_flags_1(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->lenient_flags & 4) == 4;
-}
-
-int llhttp__internal__c_test_flags_1(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->flags & 544) == 544;
-}
-
-int llhttp__internal__c_test_lenient_flags_2(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->lenient_flags & 2) == 2;
-}
-
-int llhttp__before_headers_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_headers_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__after_headers_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_mul_add_content_length(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp,
-    int match) {
-  /* Multiplication overflow */
-  if (state->content_length > 0xffffffffffffffffULL / 16) {
-    return 1;
-  }
-  
-  state->content_length *= 16;
-  
-  /* Addition overflow */
-  if (match >= 0) {
-    if (state->content_length > 0xffffffffffffffffULL - match) {
-      return 1;
-    }
-  } else {
-    if (state->content_length < 0ULL - match) {
-      return 1;
-    }
-  }
-  state->content_length += match;
-  return 0;
-}
-
-int llhttp__on_chunk_header(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_is_equal_content_length(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->content_length == 0;
-}
-
-int llhttp__internal__c_or_flags(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 128;
-  return 0;
-}
-
-int llhttp__on_chunk_extension_name_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__on_chunk_extension_value_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_update_finish_3(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->finish = 1;
-  return 0;
-}
-
-int llhttp__internal__c_or_flags_1(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 64;
-  return 0;
-}
-
-int llhttp__internal__c_update_upgrade(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->upgrade = 1;
-  return 0;
-}
-
-int llhttp__internal__c_store_header_state(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp,
-    int match) {
-  state->header_state = match;
-  return 0;
-}
-
-int llhttp__on_header_field_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_load_header_state(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->header_state;
-}
-
-int llhttp__internal__c_or_flags_3(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 1;
-  return 0;
-}
-
-int llhttp__internal__c_update_header_state(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->header_state = 1;
-  return 0;
-}
-
-int llhttp__on_header_value_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_or_flags_4(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 2;
-  return 0;
-}
-
-int llhttp__internal__c_or_flags_5(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 4;
-  return 0;
-}
-
-int llhttp__internal__c_or_flags_6(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 8;
-  return 0;
-}
-
-int llhttp__internal__c_update_header_state_3(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->header_state = 6;
-  return 0;
-}
-
-int llhttp__internal__c_update_header_state_1(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->header_state = 0;
-  return 0;
-}
-
-int llhttp__internal__c_update_header_state_6(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->header_state = 5;
-  return 0;
-}
-
-int llhttp__internal__c_update_header_state_7(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->header_state = 7;
-  return 0;
-}
-
-int llhttp__internal__c_test_flags_2(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->flags & 32) == 32;
-}
-
-int llhttp__internal__c_mul_add_content_length_1(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp,
-    int match) {
-  /* Multiplication overflow */
-  if (state->content_length > 0xffffffffffffffffULL / 10) {
-    return 1;
-  }
-  
-  state->content_length *= 10;
-  
-  /* Addition overflow */
-  if (match >= 0) {
-    if (state->content_length > 0xffffffffffffffffULL - match) {
-      return 1;
-    }
-  } else {
-    if (state->content_length < 0ULL - match) {
-      return 1;
-    }
-  }
-  state->content_length += match;
-  return 0;
-}
-
-int llhttp__internal__c_or_flags_15(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 32;
-  return 0;
-}
-
-int llhttp__internal__c_test_flags_3(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->flags & 8) == 8;
-}
-
-int llhttp__internal__c_test_lenient_flags_8(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->lenient_flags & 8) == 8;
-}
-
-int llhttp__internal__c_or_flags_16(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 512;
-  return 0;
-}
-
-int llhttp__internal__c_and_flags(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags &= -9;
-  return 0;
-}
-
-int llhttp__internal__c_update_header_state_8(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->header_state = 8;
-  return 0;
-}
-
-int llhttp__internal__c_or_flags_18(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->flags |= 16;
-  return 0;
-}
-
-int llhttp__internal__c_load_method(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->method;
-}
-
-int llhttp__internal__c_store_http_major(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp,
-    int match) {
-  state->http_major = match;
-  return 0;
-}
-
-int llhttp__internal__c_store_http_minor(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp,
-    int match) {
-  state->http_minor = match;
-  return 0;
-}
-
-int llhttp__internal__c_test_lenient_flags_10(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return (state->lenient_flags & 16) == 16;
-}
-
-int llhttp__on_version_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_load_http_major(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->http_major;
-}
-
-int llhttp__internal__c_load_http_minor(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  return state->http_minor;
-}
-
-int llhttp__internal__c_update_status_code(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->status_code = 0;
-  return 0;
-}
-
-int llhttp__internal__c_mul_add_status_code(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp,
-    int match) {
-  /* Multiplication overflow */
-  if (state->status_code > 0xffff / 10) {
-    return 1;
-  }
-  
-  state->status_code *= 10;
-  
-  /* Addition overflow */
-  if (match >= 0) {
-    if (state->status_code > 0xffff - match) {
-      return 1;
-    }
-  } else {
-    if (state->status_code < 0 - match) {
-      return 1;
-    }
-  }
-  state->status_code += match;
-  
-  /* Enforce maximum */
-  if (state->status_code > 999) {
-    return 1;
-  }
-  return 0;
-}
-
-int llhttp__on_status_complete(
-    llhttp__internal_t* s, const unsigned char* p,
-    const unsigned char* endp);
-
-int llhttp__internal__c_update_type(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->type = 1;
-  return 0;
-}
-
-int llhttp__internal__c_update_type_1(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  state->type = 2;
-  return 0;
-}
-
-int llhttp__internal_init(llhttp__internal_t* state) {
-  memset(state, 0, sizeof(*state));
-  state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_start;
-  return 0;
-}
-
-static llparse_state_t llhttp__internal__run(
-    llhttp__internal_t* state,
-    const unsigned char* p,
-    const unsigned char* endp) {
-  int match;
-  switch ((llparse_state_t) (intptr_t) state->_current) {
-    case s_n_llhttp__internal__n_closed:
-    s_n_llhttp__internal__n_closed: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_closed;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_closed;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__after_message_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__after_message_complete: {
-      switch (llhttp__after_message_complete(state, p, endp)) {
-        case 1:
-          goto s_n_llhttp__internal__n_invoke_update_content_length;
-        default:
-          goto s_n_llhttp__internal__n_invoke_update_finish_1;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_pause_1:
-    s_n_llhttp__internal__n_pause_1: {
-      state->error = 0x16;
-      state->reason = "Pause on CONNECT/Upgrade";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__after_message_complete;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_is_equal_upgrade:
-    s_n_llhttp__internal__n_invoke_is_equal_upgrade: {
-      switch (llhttp__internal__c_is_equal_upgrade(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_invoke_llhttp__after_message_complete;
-        default:
-          goto s_n_llhttp__internal__n_pause_1;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2:
-    s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2: {
-      switch (llhttp__on_message_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_invoke_is_equal_upgrade;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_11;
-        default:
-          goto s_n_llhttp__internal__n_error_24;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_data_almost_done_skip:
-    s_n_llhttp__internal__n_chunk_data_almost_done_skip: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_data_almost_done_skip;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_data_almost_done:
-    s_n_llhttp__internal__n_chunk_data_almost_done: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_data_almost_done;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_chunk_data_almost_done_skip;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_consume_content_length:
-    s_n_llhttp__internal__n_consume_content_length: {
-      size_t avail;
-      uint64_t need;
-      
-      avail = endp - p;
-      need = state->content_length;
-      if (avail >= need) {
-        p += need;
-        state->content_length = 0;
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_body;
-      }
-      
-      state->content_length -= avail;
-      return s_n_llhttp__internal__n_consume_content_length;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_body:
-    s_n_llhttp__internal__n_span_start_llhttp__on_body: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_body;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_body;
-      goto s_n_llhttp__internal__n_consume_content_length;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_is_equal_content_length:
-    s_n_llhttp__internal__n_invoke_is_equal_content_length: {
-      switch (llhttp__internal__c_is_equal_content_length(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_body;
-        default:
-          goto s_n_llhttp__internal__n_invoke_or_flags;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_size_almost_done:
-    s_n_llhttp__internal__n_chunk_size_almost_done: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_size_almost_done;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_header;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete: {
-      switch (llhttp__on_chunk_extension_name_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_chunk_size_almost_done;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_5;
-        default:
-          goto s_n_llhttp__internal__n_error_11;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_1:
-    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_1: {
-      switch (llhttp__on_chunk_extension_name_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_chunk_extensions;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_6;
-        default:
-          goto s_n_llhttp__internal__n_error_12;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete: {
-      switch (llhttp__on_chunk_extension_value_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_chunk_size_almost_done;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_7;
-        default:
-          goto s_n_llhttp__internal__n_error_14;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_extension_quoted_value_done:
-    s_n_llhttp__internal__n_chunk_extension_quoted_value_done: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_extension_quoted_value_done;
-      }
-      switch (*p) {
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_size_almost_done;
-        }
-        case ';': {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_extensions;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_16;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1:
-    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1: {
-      switch (llhttp__on_chunk_extension_value_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_chunk_extension_quoted_value_done;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_8;
-        default:
-          goto s_n_llhttp__internal__n_error_15;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_17:
-    s_n_llhttp__internal__n_error_17: {
-      state->error = 0x2;
-      state->reason = "Invalid character in chunk extensions quoted value";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_extension_quoted_value:
-    s_n_llhttp__internal__n_chunk_extension_quoted_value: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_extension_quoted_value;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_extension_quoted_value;
-        }
-        case 2: {
-          p++;
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_2;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2:
-    s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2: {
-      switch (llhttp__on_chunk_extension_value_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_chunk_size_otherwise;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_9;
-        default:
-          goto s_n_llhttp__internal__n_error_18;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_19:
-    s_n_llhttp__internal__n_error_19: {
-      state->error = 0x2;
-      state->reason = "Invalid character in chunk extensions value";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_extension_value:
-    s_n_llhttp__internal__n_chunk_extension_value: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 2, 3, 2, 2, 2, 2, 2, 0, 0, 2, 2, 0, 2, 2, 0,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 4, 0, 0, 0, 0,
-        0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 0, 2, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_extension_value;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value;
-        }
-        case 2: {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_extension_value;
-        }
-        case 3: {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_extension_quoted_value;
-        }
-        case 4: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_3;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_4;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_value:
-    s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_value: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_value;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_chunk_extension_value;
-      goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_20:
-    s_n_llhttp__internal__n_error_20: {
-      state->error = 0x2;
-      state->reason = "Invalid character in chunk extensions name";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_extension_name:
-    s_n_llhttp__internal__n_chunk_extension_name: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 2, 0, 2, 2, 2, 2, 2, 0, 0, 2, 2, 0, 2, 2, 0,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 3, 0, 4, 0, 0,
-        0, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 0, 0, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
-        2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 0, 2, 0, 2, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_extension_name;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name;
-        }
-        case 2: {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_extension_name;
-        }
-        case 3: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_1;
-        }
-        case 4: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_2;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_3;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_name:
-    s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_name: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_name;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_chunk_extension_name;
-      goto s_n_llhttp__internal__n_chunk_extension_name;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_extensions:
-    s_n_llhttp__internal__n_chunk_extensions: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_extensions;
-      }
-      switch (*p) {
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_error_9;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_error_10;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_name;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_size_otherwise:
-    s_n_llhttp__internal__n_chunk_size_otherwise: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_size_otherwise;
-      }
-      switch (*p) {
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_size_almost_done;
-        }
-        case ';': {
-          p++;
-          goto s_n_llhttp__internal__n_chunk_extensions;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_21;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_size:
-    s_n_llhttp__internal__n_chunk_size: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_size;
-      }
-      switch (*p) {
-        case '0': {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '1': {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '2': {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '3': {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '4': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '5': {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '6': {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '7': {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '8': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '9': {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'A': {
-          p++;
-          match = 10;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'B': {
-          p++;
-          match = 11;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'C': {
-          p++;
-          match = 12;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'D': {
-          p++;
-          match = 13;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'E': {
-          p++;
-          match = 14;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'F': {
-          p++;
-          match = 15;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'a': {
-          p++;
-          match = 10;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'b': {
-          p++;
-          match = 11;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'c': {
-          p++;
-          match = 12;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'd': {
-          p++;
-          match = 13;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'e': {
-          p++;
-          match = 14;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'f': {
-          p++;
-          match = 15;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_chunk_size_otherwise;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_chunk_size_digit:
-    s_n_llhttp__internal__n_chunk_size_digit: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_chunk_size_digit;
-      }
-      switch (*p) {
-        case '0': {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '1': {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '2': {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '3': {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '4': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '5': {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '6': {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '7': {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '8': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case '9': {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'A': {
-          p++;
-          match = 10;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'B': {
-          p++;
-          match = 11;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'C': {
-          p++;
-          match = 12;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'D': {
-          p++;
-          match = 13;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'E': {
-          p++;
-          match = 14;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'F': {
-          p++;
-          match = 15;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'a': {
-          p++;
-          match = 10;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'b': {
-          p++;
-          match = 11;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'c': {
-          p++;
-          match = 12;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'd': {
-          p++;
-          match = 13;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'e': {
-          p++;
-          match = 14;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        case 'f': {
-          p++;
-          match = 15;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_23;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_update_content_length_1:
-    s_n_llhttp__internal__n_invoke_update_content_length_1: {
-      switch (llhttp__internal__c_update_content_length(state, p, endp)) {
-        default:
-          goto s_n_llhttp__internal__n_chunk_size_digit;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_consume_content_length_1:
-    s_n_llhttp__internal__n_consume_content_length_1: {
-      size_t avail;
-      uint64_t need;
-      
-      avail = endp - p;
-      need = state->content_length;
-      if (avail >= need) {
-        p += need;
-        state->content_length = 0;
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_body_1;
-      }
-      
-      state->content_length -= avail;
-      return s_n_llhttp__internal__n_consume_content_length_1;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_body_1:
-    s_n_llhttp__internal__n_span_start_llhttp__on_body_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_body_1;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_body;
-      goto s_n_llhttp__internal__n_consume_content_length_1;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_eof:
-    s_n_llhttp__internal__n_eof: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_eof;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_eof;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_body_2:
-    s_n_llhttp__internal__n_span_start_llhttp__on_body_2: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_body_2;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_body;
-      goto s_n_llhttp__internal__n_eof;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__after_headers_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__after_headers_complete: {
-      switch (llhttp__after_headers_complete(state, p, endp)) {
-        case 1:
-          goto s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_1;
-        case 2:
-          goto s_n_llhttp__internal__n_invoke_update_content_length_1;
-        case 3:
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_body_1;
-        case 4:
-          goto s_n_llhttp__internal__n_invoke_update_finish_3;
-        case 5:
-          goto s_n_llhttp__internal__n_error_25;
-        default:
-          goto s_n_llhttp__internal__n_invoke_llhttp__on_message_complete;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_headers_almost_done:
-    s_n_llhttp__internal__n_headers_almost_done: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_headers_almost_done;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_invoke_test_flags;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_colon_discard_ws:
-    s_n_llhttp__internal__n_header_field_colon_discard_ws: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_colon_discard_ws;
-      }
-      switch (*p) {
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_colon_discard_ws;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_field_colon;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_28:
-    s_n_llhttp__internal__n_error_28: {
-      state->error = 0xa;
-      state->reason = "Invalid header field char";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete: {
-      switch (llhttp__on_header_value_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_header_field_start;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_14;
-        default:
-          goto s_n_llhttp__internal__n_error_32;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_header_value:
-    s_n_llhttp__internal__n_span_start_llhttp__on_header_value: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_header_value;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_header_value;
-      goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_discard_lws:
-    s_n_llhttp__internal__n_header_value_discard_lws: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_discard_lws;
-      }
-      switch (*p) {
-        case 9: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_5;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_5;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_load_header_state;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_discard_ws_almost_done:
-    s_n_llhttp__internal__n_header_value_discard_ws_almost_done: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_discard_ws_almost_done;
-      }
-      switch (*p) {
-        case 10: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_discard_lws;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_6;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_lws:
-    s_n_llhttp__internal__n_header_value_lws: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_lws;
-      }
-      switch (*p) {
-        case 9: {
-          goto s_n_llhttp__internal__n_invoke_load_header_state_3;
-        }
-        case ' ': {
-          goto s_n_llhttp__internal__n_invoke_load_header_state_3;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_load_header_state_4;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_almost_done:
-    s_n_llhttp__internal__n_header_value_almost_done: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_almost_done;
-      }
-      switch (*p) {
-        case 10: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_lws;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_35;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_lenient:
-    s_n_llhttp__internal__n_header_value_lenient: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_lenient;
-      }
-      switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_3;
-        }
-        case 13: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_4;
-        }
-        default: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_lenient;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_36:
-    s_n_llhttp__internal__n_error_36: {
-      state->error = 0xa;
-      state->reason = "Invalid header value char";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_otherwise:
-    s_n_llhttp__internal__n_header_value_otherwise: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_otherwise;
-      }
-      switch (*p) {
-        case 13: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_7;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_connection_token:
-    s_n_llhttp__internal__n_header_value_connection_token: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_connection_token;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_connection_token;
-        }
-        case 2: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_connection;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_value_otherwise;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_connection_ws:
-    s_n_llhttp__internal__n_header_value_connection_ws: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_connection_ws;
-      }
-      switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_header_value_otherwise;
-        }
-        case 13: {
-          goto s_n_llhttp__internal__n_header_value_otherwise;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_connection_ws;
-        }
-        case ',': {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_load_header_state_5;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_5;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_connection_1:
-    s_n_llhttp__internal__n_header_value_connection_1: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_connection_1;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob3, 4);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_update_header_state_3;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_value_connection_1;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_header_value_connection_token;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_connection_2:
-    s_n_llhttp__internal__n_header_value_connection_2: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_connection_2;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob4, 9);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_update_header_state_6;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_value_connection_2;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_header_value_connection_token;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_connection_3:
-    s_n_llhttp__internal__n_header_value_connection_3: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_connection_3;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob5, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_update_header_state_7;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_value_connection_3;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_header_value_connection_token;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_connection:
-    s_n_llhttp__internal__n_header_value_connection: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_connection;
-      }
-      switch (((*p) >= 'A' && (*p) <= 'Z' ? (*p | 0x20) : (*p))) {
-        case 9: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_connection;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_connection;
-        }
-        case 'c': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_connection_1;
-        }
-        case 'k': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_connection_2;
-        }
-        case 'u': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_connection_3;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_value_connection_token;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_38:
-    s_n_llhttp__internal__n_error_38: {
-      state->error = 0xb;
-      state->reason = "Content-Length overflow";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_39:
-    s_n_llhttp__internal__n_error_39: {
-      state->error = 0xb;
-      state->reason = "Invalid character in Content-Length";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_content_length_ws:
-    s_n_llhttp__internal__n_header_value_content_length_ws: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_content_length_ws;
-      }
-      switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_invoke_or_flags_15;
-        }
-        case 13: {
-          goto s_n_llhttp__internal__n_invoke_or_flags_15;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_content_length_ws;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_6;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_content_length:
-    s_n_llhttp__internal__n_header_value_content_length: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_content_length;
-      }
-      switch (*p) {
-        case '0': {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '1': {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '2': {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '3': {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '4': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '5': {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '6': {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '7': {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '8': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        case '9': {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_mul_add_content_length_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_value_content_length_ws;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_41:
-    s_n_llhttp__internal__n_error_41: {
-      state->error = 0xf;
-      state->reason = "Invalid `Transfer-Encoding` header value";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_40:
-    s_n_llhttp__internal__n_error_40: {
-      state->error = 0xf;
-      state->reason = "Invalid `Transfer-Encoding` header value";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_te_token_ows:
-    s_n_llhttp__internal__n_header_value_te_token_ows: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_te_token_ows;
-      }
-      switch (*p) {
-        case 9: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_te_token_ows;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_te_token_ows;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_value_te_chunked;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value:
-    s_n_llhttp__internal__n_header_value: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value;
-      }
-      #ifdef __SSE4_2__
-      if (endp - p >= 16) {
-        __m128i ranges;
-        __m128i input;
-        int avail;
-        int match_len;
-      
-        /* Load input */
-        input = _mm_loadu_si128((__m128i const*) p);
-        ranges = _mm_loadu_si128((__m128i const*) llparse_blob7);
-      
-        /* Find first character that does not match `ranges` */
-        match_len = _mm_cmpestri(ranges, 6,
-            input, 16,
-            _SIDD_UBYTE_OPS | _SIDD_CMP_RANGES |
-              _SIDD_NEGATIVE_POLARITY);
-      
-        if (match_len != 0) {
-          p += match_len;
-          goto s_n_llhttp__internal__n_header_value;
-        }
-        goto s_n_llhttp__internal__n_header_value_otherwise;
-      }
-      #endif  /* __SSE4_2__ */
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_value_otherwise;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_te_token:
-    s_n_llhttp__internal__n_header_value_te_token: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_te_token;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_te_token;
-        }
-        case 2: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_te_token_ows;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_9;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_te_chunked_last:
-    s_n_llhttp__internal__n_header_value_te_chunked_last: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_te_chunked_last;
-      }
-      switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_8;
-        }
-        case 13: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_8;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_te_chunked_last;
-        }
-        case ',': {
-          goto s_n_llhttp__internal__n_invoke_load_type_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_value_te_token;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_te_chunked:
-    s_n_llhttp__internal__n_header_value_te_chunked: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_te_chunked;
-      }
-      match_seq = llparse__match_sequence_to_lower_unsafe(state, p, endp, llparse_blob6, 7);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_te_chunked_last;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_value_te_chunked;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_header_value_te_token;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_header_value_1:
-    s_n_llhttp__internal__n_span_start_llhttp__on_header_value_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_header_value_1;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_header_value;
-      goto s_n_llhttp__internal__n_invoke_load_header_state_2;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_value_discard_ws:
-    s_n_llhttp__internal__n_header_value_discard_ws: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_value_discard_ws;
-      }
-      switch (*p) {
-        case 9: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_discard_ws;
-        }
-        case 10: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_4;
-        }
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_discard_ws_almost_done;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_header_value_discard_ws;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_header_value_1;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_header_field_complete: {
-      switch (llhttp__on_header_field_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_header_value_discard_ws;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_15;
-        default:
-          goto s_n_llhttp__internal__n_error_29;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_general_otherwise:
-    s_n_llhttp__internal__n_header_field_general_otherwise: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_general_otherwise;
-      }
-      switch (*p) {
-        case ':': {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_field_2;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_42;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_general:
-    s_n_llhttp__internal__n_header_field_general: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
-        0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_general;
-      }
-      #ifdef __SSE4_2__
-      if (endp - p >= 16) {
-        __m128i ranges;
-        __m128i input;
-        int avail;
-        int match_len;
-      
-        /* Load input */
-        input = _mm_loadu_si128((__m128i const*) p);
-        ranges = _mm_loadu_si128((__m128i const*) llparse_blob8);
-      
-        /* Find first character that does not match `ranges` */
-        match_len = _mm_cmpestri(ranges, 16,
-            input, 16,
-            _SIDD_UBYTE_OPS | _SIDD_CMP_RANGES |
-              _SIDD_NEGATIVE_POLARITY);
-      
-        if (match_len != 0) {
-          p += match_len;
-          goto s_n_llhttp__internal__n_header_field_general;
-        }
-        ranges = _mm_loadu_si128((__m128i const*) llparse_blob9);
-      
-        /* Find first character that does not match `ranges` */
-        match_len = _mm_cmpestri(ranges, 2,
-            input, 16,
-            _SIDD_UBYTE_OPS | _SIDD_CMP_RANGES |
-              _SIDD_NEGATIVE_POLARITY);
-      
-        if (match_len != 0) {
-          p += match_len;
-          goto s_n_llhttp__internal__n_header_field_general;
-        }
-        goto s_n_llhttp__internal__n_header_field_general_otherwise;
-      }
-      #endif  /* __SSE4_2__ */
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_general;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_field_general_otherwise;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_colon:
-    s_n_llhttp__internal__n_header_field_colon: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_colon;
-      }
-      switch (*p) {
-        case ' ': {
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags_3;
-        }
-        case ':': {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_header_field_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_10;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_3:
-    s_n_llhttp__internal__n_header_field_3: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_3;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob2, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_store_header_state;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_field_3;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_11;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_4:
-    s_n_llhttp__internal__n_header_field_4: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_4;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob10, 10);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_store_header_state;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_field_4;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_11;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_2:
-    s_n_llhttp__internal__n_header_field_2: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_2;
-      }
-      switch (((*p) >= 'A' && (*p) <= 'Z' ? (*p | 0x20) : (*p))) {
-        case 'n': {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_3;
-        }
-        case 't': {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_4;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_11;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_1:
-    s_n_llhttp__internal__n_header_field_1: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_1;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob1, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_2;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_field_1;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_11;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_5:
-    s_n_llhttp__internal__n_header_field_5: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_5;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob11, 15);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_store_header_state;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_field_5;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_11;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_6:
-    s_n_llhttp__internal__n_header_field_6: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_6;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob12, 16);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_store_header_state;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_field_6;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_11;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_7:
-    s_n_llhttp__internal__n_header_field_7: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_7;
-      }
-      match_seq = llparse__match_sequence_to_lower(state, p, endp, llparse_blob13, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_store_header_state;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_header_field_7;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_11;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field:
-    s_n_llhttp__internal__n_header_field: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field;
-      }
-      switch (((*p) >= 'A' && (*p) <= 'Z' ? (*p | 0x20) : (*p))) {
-        case 'c': {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_1;
-        }
-        case 'p': {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_5;
-        }
-        case 't': {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_6;
-        }
-        case 'u': {
-          p++;
-          goto s_n_llhttp__internal__n_header_field_7;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_update_header_state_11;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_header_field:
-    s_n_llhttp__internal__n_span_start_llhttp__on_header_field: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_header_field;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_header_field;
-      goto s_n_llhttp__internal__n_header_field;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_header_field_start:
-    s_n_llhttp__internal__n_header_field_start: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_header_field_start;
-      }
-      switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_headers_almost_done;
-        }
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_headers_almost_done;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_header_field;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_headers_start:
-    s_n_llhttp__internal__n_headers_start: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_headers_start;
-      }
-      switch (*p) {
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_test_lenient_flags;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_header_field_start;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_skip_to_http09:
-    s_n_llhttp__internal__n_url_skip_to_http09: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_skip_to_http09;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_invoke_update_http_major;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_skip_lf_to_http09:
-    s_n_llhttp__internal__n_url_skip_lf_to_http09: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_skip_lf_to_http09;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob14, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_update_http_major;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_url_skip_lf_to_http09;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_43;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_pri_upgrade:
-    s_n_llhttp__internal__n_req_pri_upgrade: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_pri_upgrade;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob16, 10);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_error_49;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_req_pri_upgrade;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_50;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_complete_1:
-    s_n_llhttp__internal__n_req_http_complete_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_complete_1;
-      }
-      switch (*p) {
-        case 10: {
-          p++;
-          goto s_n_llhttp__internal__n_headers_start;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_48;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_complete:
-    s_n_llhttp__internal__n_req_http_complete: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_complete;
-      }
-      switch (*p) {
-        case 10: {
-          p++;
-          goto s_n_llhttp__internal__n_headers_start;
-        }
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_req_http_complete_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_48;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_load_method_1:
-    s_n_llhttp__internal__n_invoke_load_method_1: {
-      switch (llhttp__internal__c_load_method(state, p, endp)) {
-        case 34:
-          goto s_n_llhttp__internal__n_req_pri_upgrade;
-        default:
-          goto s_n_llhttp__internal__n_req_http_complete;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_version_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_version_complete: {
-      switch (llhttp__on_version_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_invoke_load_method_1;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_17;
-        default:
-          goto s_n_llhttp__internal__n_error_47;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_46:
-    s_n_llhttp__internal__n_error_46: {
-      state->error = 0x9;
-      state->reason = "Invalid HTTP version";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_51:
-    s_n_llhttp__internal__n_error_51: {
-      state->error = 0x9;
-      state->reason = "Invalid minor version";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_minor:
-    s_n_llhttp__internal__n_req_http_minor: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_minor;
-      }
-      switch (*p) {
-        case '0': {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '1': {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '2': {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '3': {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '4': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '5': {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '6': {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '7': {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '8': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        case '9': {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_version_2;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_52:
-    s_n_llhttp__internal__n_error_52: {
-      state->error = 0x9;
-      state->reason = "Expected dot";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_dot:
-    s_n_llhttp__internal__n_req_http_dot: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_dot;
-      }
-      switch (*p) {
-        case '.': {
-          p++;
-          goto s_n_llhttp__internal__n_req_http_minor;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_version_3;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_53:
-    s_n_llhttp__internal__n_error_53: {
-      state->error = 0x9;
-      state->reason = "Invalid major version";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_major:
-    s_n_llhttp__internal__n_req_http_major: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_major;
-      }
-      switch (*p) {
-        case '0': {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '1': {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '2': {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '3': {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '4': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '5': {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '6': {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '7': {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '8': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        case '9': {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_store_http_major;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_version_4;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_version:
-    s_n_llhttp__internal__n_span_start_llhttp__on_version: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_version;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_version;
-      goto s_n_llhttp__internal__n_req_http_major;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_start_1:
-    s_n_llhttp__internal__n_req_http_start_1: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_start_1;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob15, 4);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_load_method;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_req_http_start_1;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_56;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_start_2:
-    s_n_llhttp__internal__n_req_http_start_2: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_start_2;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob17, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_load_method_2;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_req_http_start_2;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_56;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_start_3:
-    s_n_llhttp__internal__n_req_http_start_3: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_start_3;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob18, 4);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_load_method_3;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_req_http_start_3;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_56;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_http_start:
-    s_n_llhttp__internal__n_req_http_start: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_http_start;
-      }
-      switch (*p) {
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_req_http_start;
-        }
-        case 'H': {
-          p++;
-          goto s_n_llhttp__internal__n_req_http_start_1;
-        }
-        case 'I': {
-          p++;
-          goto s_n_llhttp__internal__n_req_http_start_2;
-        }
-        case 'R': {
-          p++;
-          goto s_n_llhttp__internal__n_req_http_start_3;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_56;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_skip_to_http:
-    s_n_llhttp__internal__n_url_skip_to_http: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_skip_to_http;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_invoke_llhttp__on_url_complete_1;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_fragment:
-    s_n_llhttp__internal__n_url_fragment: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 3, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_fragment;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_url_fragment;
-        }
-        case 2: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_6;
-        }
-        case 3: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_7;
-        }
-        case 4: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_8;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_57;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_end_stub_query_3:
-    s_n_llhttp__internal__n_span_end_stub_query_3: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_end_stub_query_3;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_url_fragment;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_query:
-    s_n_llhttp__internal__n_url_query: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 1, 3, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        4, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_query;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_url_query;
-        }
-        case 2: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_9;
-        }
-        case 3: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_10;
-        }
-        case 4: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_11;
-        }
-        case 5: {
-          goto s_n_llhttp__internal__n_span_end_stub_query_3;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_58;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_query_or_fragment:
-    s_n_llhttp__internal__n_url_query_or_fragment: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_query_or_fragment;
-      }
-      switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_3;
-        }
-        case 13: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_4;
-        }
-        case ' ': {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_5;
-        }
-        case '#': {
-          p++;
-          goto s_n_llhttp__internal__n_url_fragment;
-        }
-        case '?': {
-          p++;
-          goto s_n_llhttp__internal__n_url_query;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_59;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_path:
-    s_n_llhttp__internal__n_url_path: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-        1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_path;
-      }
-      #ifdef __SSE4_2__
-      if (endp - p >= 16) {
-        __m128i ranges;
-        __m128i input;
-        int avail;
-        int match_len;
-      
-        /* Load input */
-        input = _mm_loadu_si128((__m128i const*) p);
-        ranges = _mm_loadu_si128((__m128i const*) llparse_blob0);
-      
-        /* Find first character that does not match `ranges` */
-        match_len = _mm_cmpestri(ranges, 12,
-            input, 16,
-            _SIDD_UBYTE_OPS | _SIDD_CMP_RANGES |
-              _SIDD_NEGATIVE_POLARITY);
-      
-        if (match_len != 0) {
-          p += match_len;
-          goto s_n_llhttp__internal__n_url_path;
-        }
-        goto s_n_llhttp__internal__n_url_query_or_fragment;
-      }
-      #endif  /* __SSE4_2__ */
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_url_path;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_url_query_or_fragment;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_stub_path_2:
-    s_n_llhttp__internal__n_span_start_stub_path_2: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_stub_path_2;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_url_path;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_stub_path:
-    s_n_llhttp__internal__n_span_start_stub_path: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_stub_path;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_url_path;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_stub_path_1:
-    s_n_llhttp__internal__n_span_start_stub_path_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_stub_path_1;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_url_path;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_server_with_at:
-    s_n_llhttp__internal__n_url_server_with_at: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        3, 4, 0, 0, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 4, 0, 6,
-        7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 4, 0, 4,
-        0, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 4, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_server_with_at;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_12;
-        }
-        case 2: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_13;
-        }
-        case 3: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_14;
-        }
-        case 4: {
-          p++;
-          goto s_n_llhttp__internal__n_url_server;
-        }
-        case 5: {
-          goto s_n_llhttp__internal__n_span_start_stub_path_1;
-        }
-        case 6: {
-          p++;
-          goto s_n_llhttp__internal__n_url_query;
-        }
-        case 7: {
-          p++;
-          goto s_n_llhttp__internal__n_error_60;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_61;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_server:
-    s_n_llhttp__internal__n_url_server: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 2, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        3, 4, 0, 0, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 4, 0, 6,
-        7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 4, 0, 4,
-        0, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
-        4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 4, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_server;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url;
-        }
-        case 2: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_1;
-        }
-        case 3: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_url_2;
-        }
-        case 4: {
-          p++;
-          goto s_n_llhttp__internal__n_url_server;
-        }
-        case 5: {
-          goto s_n_llhttp__internal__n_span_start_stub_path;
-        }
-        case 6: {
-          p++;
-          goto s_n_llhttp__internal__n_url_query;
-        }
-        case 7: {
-          p++;
-          goto s_n_llhttp__internal__n_url_server_with_at;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_62;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_schema_delim_1:
-    s_n_llhttp__internal__n_url_schema_delim_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_schema_delim_1;
-      }
-      switch (*p) {
-        case '/': {
-          p++;
-          goto s_n_llhttp__internal__n_url_server;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_64;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_schema_delim:
-    s_n_llhttp__internal__n_url_schema_delim: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_schema_delim;
-      }
-      switch (*p) {
-        case 10: {
-          p++;
-          goto s_n_llhttp__internal__n_error_63;
-        }
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_error_63;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_error_63;
-        }
-        case '/': {
-          p++;
-          goto s_n_llhttp__internal__n_url_schema_delim_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_64;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_end_stub_schema:
-    s_n_llhttp__internal__n_span_end_stub_schema: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_end_stub_schema;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_url_schema_delim;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_schema:
-    s_n_llhttp__internal__n_url_schema: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0,
-        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
-        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0,
-        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
-        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_schema;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_error_63;
-        }
-        case 2: {
-          goto s_n_llhttp__internal__n_span_end_stub_schema;
-        }
-        case 3: {
-          p++;
-          goto s_n_llhttp__internal__n_url_schema;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_65;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_url_start:
-    s_n_llhttp__internal__n_url_start: {
-      static uint8_t lookup_table[] = {
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
-        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0,
-        0, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
-        3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
-      };
-      if (p == endp) {
-        return s_n_llhttp__internal__n_url_start;
-      }
-      switch (lookup_table[(uint8_t) *p]) {
-        case 1: {
-          p++;
-          goto s_n_llhttp__internal__n_error_63;
-        }
-        case 2: {
-          goto s_n_llhttp__internal__n_span_start_stub_path_2;
-        }
-        case 3: {
-          goto s_n_llhttp__internal__n_url_schema;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_66;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_url_1:
-    s_n_llhttp__internal__n_span_start_llhttp__on_url_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_url_1;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_url;
-      goto s_n_llhttp__internal__n_url_start;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_url:
-    s_n_llhttp__internal__n_span_start_llhttp__on_url: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_url;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_url;
-      goto s_n_llhttp__internal__n_url_server;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_spaces_before_url:
-    s_n_llhttp__internal__n_req_spaces_before_url: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_spaces_before_url;
-      }
-      switch (*p) {
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_req_spaces_before_url;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_is_equal_method;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_first_space_before_url:
-    s_n_llhttp__internal__n_req_first_space_before_url: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_first_space_before_url;
-      }
-      switch (*p) {
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_req_spaces_before_url;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_67;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_method_complete_1:
-    s_n_llhttp__internal__n_invoke_llhttp__on_method_complete_1: {
-      switch (llhttp__on_method_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_req_first_space_before_url;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_22;
-        default:
-          goto s_n_llhttp__internal__n_error_78;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_2:
-    s_n_llhttp__internal__n_after_start_req_2: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_2;
-      }
-      switch (*p) {
-        case 'L': {
-          p++;
-          match = 19;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_3:
-    s_n_llhttp__internal__n_after_start_req_3: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_3;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob19, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 36;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_3;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_1:
-    s_n_llhttp__internal__n_after_start_req_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_1;
-      }
-      switch (*p) {
-        case 'C': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_2;
-        }
-        case 'N': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_3;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_4:
-    s_n_llhttp__internal__n_after_start_req_4: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_4;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob20, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 16;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_4;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_6:
-    s_n_llhttp__internal__n_after_start_req_6: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_6;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob21, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 22;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_6;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_8:
-    s_n_llhttp__internal__n_after_start_req_8: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_8;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob22, 4);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_8;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_9:
-    s_n_llhttp__internal__n_after_start_req_9: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_9;
-      }
-      switch (*p) {
-        case 'Y': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_7:
-    s_n_llhttp__internal__n_after_start_req_7: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_7;
-      }
-      switch (*p) {
-        case 'N': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_8;
-        }
-        case 'P': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_9;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_5:
-    s_n_llhttp__internal__n_after_start_req_5: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_5;
-      }
-      switch (*p) {
-        case 'H': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_6;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_7;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_12:
-    s_n_llhttp__internal__n_after_start_req_12: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_12;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob23, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_12;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_13:
-    s_n_llhttp__internal__n_after_start_req_13: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_13;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob24, 5);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 35;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_13;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_11:
-    s_n_llhttp__internal__n_after_start_req_11: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_11;
-      }
-      switch (*p) {
-        case 'L': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_12;
-        }
-        case 'S': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_13;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_10:
-    s_n_llhttp__internal__n_after_start_req_10: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_10;
-      }
-      switch (*p) {
-        case 'E': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_11;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_14:
-    s_n_llhttp__internal__n_after_start_req_14: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_14;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob25, 4);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 45;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_14;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_17:
-    s_n_llhttp__internal__n_after_start_req_17: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_17;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob27, 9);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 41;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_17;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_16:
-    s_n_llhttp__internal__n_after_start_req_16: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_16;
-      }
-      switch (*p) {
-        case '_': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_17;
-        }
-        default: {
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_15:
-    s_n_llhttp__internal__n_after_start_req_15: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_15;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob26, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_16;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_15;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_18:
-    s_n_llhttp__internal__n_after_start_req_18: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_18;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob28, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_18;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_20:
-    s_n_llhttp__internal__n_after_start_req_20: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_20;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob29, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 31;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_20;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_21:
-    s_n_llhttp__internal__n_after_start_req_21: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_21;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob30, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_21;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_19:
-    s_n_llhttp__internal__n_after_start_req_19: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_19;
-      }
-      switch (*p) {
-        case 'I': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_20;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_21;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_23:
-    s_n_llhttp__internal__n_after_start_req_23: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_23;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob31, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 24;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_23;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_24:
-    s_n_llhttp__internal__n_after_start_req_24: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_24;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob32, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 23;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_24;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_26:
-    s_n_llhttp__internal__n_after_start_req_26: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_26;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob33, 7);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 21;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_26;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_28:
-    s_n_llhttp__internal__n_after_start_req_28: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_28;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob34, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 30;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_28;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_29:
-    s_n_llhttp__internal__n_after_start_req_29: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_29;
-      }
-      switch (*p) {
-        case 'L': {
-          p++;
-          match = 10;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_27:
-    s_n_llhttp__internal__n_after_start_req_27: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_27;
-      }
-      switch (*p) {
-        case 'A': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_28;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_29;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_25:
-    s_n_llhttp__internal__n_after_start_req_25: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_25;
-      }
-      switch (*p) {
-        case 'A': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_26;
-        }
-        case 'C': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_27;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_30:
-    s_n_llhttp__internal__n_after_start_req_30: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_30;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob35, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 11;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_30;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_22:
-    s_n_llhttp__internal__n_after_start_req_22: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_22;
-      }
-      switch (*p) {
-        case '-': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_23;
-        }
-        case 'E': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_24;
-        }
-        case 'K': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_25;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_30;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_31:
-    s_n_llhttp__internal__n_after_start_req_31: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_31;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob36, 5);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 25;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_31;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_32:
-    s_n_llhttp__internal__n_after_start_req_32: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_32;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob37, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_32;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_35:
-    s_n_llhttp__internal__n_after_start_req_35: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_35;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob38, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 28;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_35;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_36:
-    s_n_llhttp__internal__n_after_start_req_36: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_36;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob39, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 39;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_36;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_34:
-    s_n_llhttp__internal__n_after_start_req_34: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_34;
-      }
-      switch (*p) {
-        case 'T': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_35;
-        }
-        case 'U': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_36;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_37:
-    s_n_llhttp__internal__n_after_start_req_37: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_37;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob40, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 38;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_37;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_38:
-    s_n_llhttp__internal__n_after_start_req_38: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_38;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob41, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_38;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_42:
-    s_n_llhttp__internal__n_after_start_req_42: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_42;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob42, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 12;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_42;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_43:
-    s_n_llhttp__internal__n_after_start_req_43: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_43;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob43, 4);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 13;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_43;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_41:
-    s_n_llhttp__internal__n_after_start_req_41: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_41;
-      }
-      switch (*p) {
-        case 'F': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_42;
-        }
-        case 'P': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_43;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_40:
-    s_n_llhttp__internal__n_after_start_req_40: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_40;
-      }
-      switch (*p) {
-        case 'P': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_41;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_39:
-    s_n_llhttp__internal__n_after_start_req_39: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_39;
-      }
-      switch (*p) {
-        case 'I': {
-          p++;
-          match = 34;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_40;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_45:
-    s_n_llhttp__internal__n_after_start_req_45: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_45;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob44, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 29;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_45;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_44:
-    s_n_llhttp__internal__n_after_start_req_44: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_44;
-      }
-      switch (*p) {
-        case 'R': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_45;
-        }
-        case 'T': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_33:
-    s_n_llhttp__internal__n_after_start_req_33: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_33;
-      }
-      switch (*p) {
-        case 'A': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_34;
-        }
-        case 'L': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_37;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_38;
-        }
-        case 'R': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_39;
-        }
-        case 'U': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_44;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_48:
-    s_n_llhttp__internal__n_after_start_req_48: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_48;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob45, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 17;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_48;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_49:
-    s_n_llhttp__internal__n_after_start_req_49: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_49;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob46, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 44;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_49;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_50:
-    s_n_llhttp__internal__n_after_start_req_50: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_50;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob47, 5);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 43;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_50;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_51:
-    s_n_llhttp__internal__n_after_start_req_51: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_51;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob48, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 20;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_51;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_47:
-    s_n_llhttp__internal__n_after_start_req_47: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_47;
-      }
-      switch (*p) {
-        case 'B': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_48;
-        }
-        case 'C': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_49;
-        }
-        case 'D': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_50;
-        }
-        case 'P': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_51;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_46:
-    s_n_llhttp__internal__n_after_start_req_46: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_46;
-      }
-      switch (*p) {
-        case 'E': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_47;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_54:
-    s_n_llhttp__internal__n_after_start_req_54: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_54;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob49, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 14;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_54;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_56:
-    s_n_llhttp__internal__n_after_start_req_56: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_56;
-      }
-      switch (*p) {
-        case 'P': {
-          p++;
-          match = 37;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_57:
-    s_n_llhttp__internal__n_after_start_req_57: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_57;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob50, 9);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 42;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_57;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_55:
-    s_n_llhttp__internal__n_after_start_req_55: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_55;
-      }
-      switch (*p) {
-        case 'U': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_56;
-        }
-        case '_': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_57;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_53:
-    s_n_llhttp__internal__n_after_start_req_53: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_53;
-      }
-      switch (*p) {
-        case 'A': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_54;
-        }
-        case 'T': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_55;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_58:
-    s_n_llhttp__internal__n_after_start_req_58: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_58;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob51, 4);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 33;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_58;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_59:
-    s_n_llhttp__internal__n_after_start_req_59: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_59;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob52, 7);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 26;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_59;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_52:
-    s_n_llhttp__internal__n_after_start_req_52: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_52;
-      }
-      switch (*p) {
-        case 'E': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_53;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_58;
-        }
-        case 'U': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_59;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_61:
-    s_n_llhttp__internal__n_after_start_req_61: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_61;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob53, 6);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 40;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_61;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_62:
-    s_n_llhttp__internal__n_after_start_req_62: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_62;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob54, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_62;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_60:
-    s_n_llhttp__internal__n_after_start_req_60: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_60;
-      }
-      switch (*p) {
-        case 'E': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_61;
-        }
-        case 'R': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_62;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_65:
-    s_n_llhttp__internal__n_after_start_req_65: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_65;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob55, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 18;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_65;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_67:
-    s_n_llhttp__internal__n_after_start_req_67: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_67;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob56, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 32;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_67;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_68:
-    s_n_llhttp__internal__n_after_start_req_68: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_68;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob57, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 15;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_68;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_66:
-    s_n_llhttp__internal__n_after_start_req_66: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_66;
-      }
-      switch (*p) {
-        case 'I': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_67;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_68;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_69:
-    s_n_llhttp__internal__n_after_start_req_69: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_69;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob58, 8);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 27;
-          goto s_n_llhttp__internal__n_invoke_store_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_after_start_req_69;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_64:
-    s_n_llhttp__internal__n_after_start_req_64: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_64;
-      }
-      switch (*p) {
-        case 'B': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_65;
-        }
-        case 'L': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_66;
-        }
-        case 'S': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_69;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req_63:
-    s_n_llhttp__internal__n_after_start_req_63: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req_63;
-      }
-      switch (*p) {
-        case 'N': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_64;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_after_start_req:
-    s_n_llhttp__internal__n_after_start_req: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_after_start_req;
-      }
-      switch (*p) {
-        case 'A': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_1;
-        }
-        case 'B': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_4;
-        }
-        case 'C': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_5;
-        }
-        case 'D': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_10;
-        }
-        case 'F': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_14;
-        }
-        case 'G': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_15;
-        }
-        case 'H': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_18;
-        }
-        case 'L': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_19;
-        }
-        case 'M': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_22;
-        }
-        case 'N': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_31;
-        }
-        case 'O': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_32;
-        }
-        case 'P': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_33;
-        }
-        case 'R': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_46;
-        }
-        case 'S': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_52;
-        }
-        case 'T': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_60;
-        }
-        case 'U': {
-          p++;
-          goto s_n_llhttp__internal__n_after_start_req_63;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_79;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_method_1:
-    s_n_llhttp__internal__n_span_start_llhttp__on_method_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_method_1;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_method;
-      goto s_n_llhttp__internal__n_after_start_req;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_status_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_status_complete: {
-      switch (llhttp__on_status_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_headers_start;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_20;
-        default:
-          goto s_n_llhttp__internal__n_error_71;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_line_almost_done:
-    s_n_llhttp__internal__n_res_line_almost_done: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_line_almost_done;
-      }
-      p++;
-      goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_status:
-    s_n_llhttp__internal__n_res_status: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_status;
-      }
-      switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_status;
-        }
-        case 13: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_status_1;
-        }
-        default: {
-          p++;
-          goto s_n_llhttp__internal__n_res_status;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_status:
-    s_n_llhttp__internal__n_span_start_llhttp__on_status: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_status;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_status;
-      goto s_n_llhttp__internal__n_res_status;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_status_start:
-    s_n_llhttp__internal__n_res_status_start: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_status_start;
-      }
-      switch (*p) {
-        case 10: {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
-        }
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_res_line_almost_done;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_status;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_status_code_otherwise:
-    s_n_llhttp__internal__n_res_status_code_otherwise: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_status_code_otherwise;
-      }
-      switch (*p) {
-        case 10: {
-          goto s_n_llhttp__internal__n_res_status_start;
-        }
-        case 13: {
-          goto s_n_llhttp__internal__n_res_status_start;
-        }
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_res_status_start;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_72;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_status_code:
-    s_n_llhttp__internal__n_res_status_code: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_status_code;
-      }
-      switch (*p) {
-        case '0': {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '1': {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '2': {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '3': {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '4': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '5': {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '6': {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '7': {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '8': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        case '9': {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_mul_add_status_code;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_res_status_code_otherwise;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_after_version:
-    s_n_llhttp__internal__n_res_after_version: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_after_version;
-      }
-      switch (*p) {
-        case ' ': {
-          p++;
-          goto s_n_llhttp__internal__n_invoke_update_status_code;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_73;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_version_complete_1:
-    s_n_llhttp__internal__n_invoke_llhttp__on_version_complete_1: {
-      switch (llhttp__on_version_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_res_after_version;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_21;
-        default:
-          goto s_n_llhttp__internal__n_error_69;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_68:
-    s_n_llhttp__internal__n_error_68: {
-      state->error = 0x9;
-      state->reason = "Invalid HTTP version";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_74:
-    s_n_llhttp__internal__n_error_74: {
-      state->error = 0x9;
-      state->reason = "Invalid minor version";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_http_minor:
-    s_n_llhttp__internal__n_res_http_minor: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_http_minor;
-      }
-      switch (*p) {
-        case '0': {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '1': {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '2': {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '3': {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '4': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '5': {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '6': {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '7': {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '8': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        case '9': {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_store_http_minor_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_version_7;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_75:
-    s_n_llhttp__internal__n_error_75: {
-      state->error = 0x9;
-      state->reason = "Expected dot";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_http_dot:
-    s_n_llhttp__internal__n_res_http_dot: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_http_dot;
-      }
-      switch (*p) {
-        case '.': {
-          p++;
-          goto s_n_llhttp__internal__n_res_http_minor;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_version_8;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_error_76:
-    s_n_llhttp__internal__n_error_76: {
-      state->error = 0x9;
-      state->reason = "Invalid major version";
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_error;
-      return s_error;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_res_http_major:
-    s_n_llhttp__internal__n_res_http_major: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_res_http_major;
-      }
-      switch (*p) {
-        case '0': {
-          p++;
-          match = 0;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '1': {
-          p++;
-          match = 1;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '2': {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '3': {
-          p++;
-          match = 3;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '4': {
-          p++;
-          match = 4;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '5': {
-          p++;
-          match = 5;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '6': {
-          p++;
-          match = 6;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '7': {
-          p++;
-          match = 7;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '8': {
-          p++;
-          match = 8;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        case '9': {
-          p++;
-          match = 9;
-          goto s_n_llhttp__internal__n_invoke_store_http_major_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_version_9;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_version_1:
-    s_n_llhttp__internal__n_span_start_llhttp__on_version_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_version_1;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_version;
-      goto s_n_llhttp__internal__n_res_http_major;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_start_res:
-    s_n_llhttp__internal__n_start_res: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_start_res;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob59, 5);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_version_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_start_res;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_80;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_llhttp__on_method_complete:
-    s_n_llhttp__internal__n_invoke_llhttp__on_method_complete: {
-      switch (llhttp__on_method_complete(state, p, endp)) {
-        case 0:
-          goto s_n_llhttp__internal__n_req_first_space_before_url;
-        case 21:
-          goto s_n_llhttp__internal__n_pause_19;
-        default:
-          goto s_n_llhttp__internal__n_error_1;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_or_res_method_2:
-    s_n_llhttp__internal__n_req_or_res_method_2: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_or_res_method_2;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob60, 2);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          match = 2;
-          goto s_n_llhttp__internal__n_invoke_store_method;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_req_or_res_method_2;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_77;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_update_type_1:
-    s_n_llhttp__internal__n_invoke_update_type_1: {
-      switch (llhttp__internal__c_update_type_1(state, p, endp)) {
-        default:
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_version_1;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_or_res_method_3:
-    s_n_llhttp__internal__n_req_or_res_method_3: {
-      llparse_match_t match_seq;
-      
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_or_res_method_3;
-      }
-      match_seq = llparse__match_sequence_id(state, p, endp, llparse_blob61, 3);
-      p = match_seq.current;
-      switch (match_seq.status) {
-        case kMatchComplete: {
-          p++;
-          goto s_n_llhttp__internal__n_span_end_llhttp__on_method_1;
-        }
-        case kMatchPause: {
-          return s_n_llhttp__internal__n_req_or_res_method_3;
-        }
-        case kMatchMismatch: {
-          goto s_n_llhttp__internal__n_error_77;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_or_res_method_1:
-    s_n_llhttp__internal__n_req_or_res_method_1: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_or_res_method_1;
-      }
-      switch (*p) {
-        case 'E': {
-          p++;
-          goto s_n_llhttp__internal__n_req_or_res_method_2;
-        }
-        case 'T': {
-          p++;
-          goto s_n_llhttp__internal__n_req_or_res_method_3;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_77;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_req_or_res_method:
-    s_n_llhttp__internal__n_req_or_res_method: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_req_or_res_method;
-      }
-      switch (*p) {
-        case 'H': {
-          p++;
-          goto s_n_llhttp__internal__n_req_or_res_method_1;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_error_77;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_span_start_llhttp__on_method:
-    s_n_llhttp__internal__n_span_start_llhttp__on_method: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_span_start_llhttp__on_method;
-      }
-      state->_span_pos0 = (void*) p;
-      state->_span_cb0 = llhttp__on_method;
-      goto s_n_llhttp__internal__n_req_or_res_method;
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_start_req_or_res:
-    s_n_llhttp__internal__n_start_req_or_res: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_start_req_or_res;
-      }
-      switch (*p) {
-        case 'H': {
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_method;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_update_type_2;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_load_type:
-    s_n_llhttp__internal__n_invoke_load_type: {
-      switch (llhttp__internal__c_load_type(state, p, endp)) {
-        case 1:
-          goto s_n_llhttp__internal__n_span_start_llhttp__on_method_1;
-        case 2:
-          goto s_n_llhttp__internal__n_start_res;
-        default:
-          goto s_n_llhttp__internal__n_start_req_or_res;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_invoke_update_finish:
-    s_n_llhttp__internal__n_invoke_update_finish: {
-      switch (llhttp__internal__c_update_finish(state, p, endp)) {
-        default:
-          goto s_n_llhttp__internal__n_invoke_llhttp__on_message_begin;
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    case s_n_llhttp__internal__n_start:
-    s_n_llhttp__internal__n_start: {
-      if (p == endp) {
-        return s_n_llhttp__internal__n_start;
-      }
-      switch (*p) {
-        case 10: {
-          p++;
-          goto s_n_llhttp__internal__n_start;
-        }
-        case 13: {
-          p++;
-          goto s_n_llhttp__internal__n_start;
-        }
-        default: {
-          goto s_n_llhttp__internal__n_invoke_load_initial_message_completed;
-        }
-      }
-      /* UNREACHABLE */;
-      abort();
-    }
-    default:
-      /* UNREACHABLE */
-      abort();
-  }
-  s_n_llhttp__internal__n_error_63: {
-    state->error = 0x7;
-    state->reason = "Invalid characters in url";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_finish_2: {
-    switch (llhttp__internal__c_update_finish_1(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_start;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_initial_message_completed: {
-    switch (llhttp__internal__c_update_initial_message_completed(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_finish_2;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_content_length: {
-    switch (llhttp__internal__c_update_content_length(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_update_initial_message_completed;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_1: {
-    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_update_initial_message_completed;
-      default:
-        goto s_n_llhttp__internal__n_closed;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_finish_1: {
-    switch (llhttp__internal__c_update_finish_1(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_1;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_11: {
-    state->error = 0x15;
-    state->reason = "on_message_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_is_equal_upgrade;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_24: {
-    state->error = 0x12;
-    state->reason = "`on_message_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_13: {
-    state->error = 0x15;
-    state->reason = "on_chunk_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_27: {
-    state->error = 0x14;
-    state->reason = "`on_chunk_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete_1: {
-    switch (llhttp__on_chunk_complete(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_13;
-      default:
-        goto s_n_llhttp__internal__n_error_27;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_26: {
-    state->error = 0x4;
-    state->reason = "Content-Length can't be present with Transfer-Encoding";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_2: {
-    state->error = 0x15;
-    state->reason = "on_message_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_pause_1;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_6: {
-    state->error = 0x12;
-    state->reason = "`on_message_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_1: {
-    switch (llhttp__on_message_complete(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_pause_1;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_2;
-      default:
-        goto s_n_llhttp__internal__n_error_6;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_22: {
-    state->error = 0xc;
-    state->reason = "Chunk size overflow";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_3: {
-    state->error = 0x15;
-    state->reason = "on_chunk_complete pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_update_content_length_1;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_8: {
-    state->error = 0x14;
-    state->reason = "`on_chunk_complete` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete: {
-    switch (llhttp__on_chunk_complete(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_invoke_update_content_length_1;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_3;
-      default:
-        goto s_n_llhttp__internal__n_error_8;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_body: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_body(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_data_almost_done;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_chunk_data_almost_done;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_or_flags: {
-    switch (llhttp__internal__c_or_flags(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_header_field_start;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_4: {
-    state->error = 0x15;
-    state->reason = "on_chunk_header pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_is_equal_content_length;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_7: {
-    state->error = 0x13;
-    state->reason = "`on_chunk_header` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_header: {
-    switch (llhttp__on_chunk_header(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_invoke_is_equal_content_length;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_4;
-      default:
-        goto s_n_llhttp__internal__n_error_7;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_9: {
-    state->error = 0x2;
-    state->reason = "Invalid character in chunk extensions";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_10: {
-    state->error = 0x2;
-    state->reason = "Invalid character in chunk extensions";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_5: {
-    state->error = 0x15;
-    state->reason = "on_chunk_extension_name pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_size_almost_done;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_11: {
-    state->error = 0x22;
-    state->reason = "`on_chunk_extension_name` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_name(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_6: {
-    state->error = 0x15;
-    state->reason = "on_chunk_extension_name pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_extensions;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_12: {
-    state->error = 0x22;
-    state->reason = "`on_chunk_extension_name` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_name(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_1;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_1;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_7: {
-    state->error = 0x15;
-    state->reason = "on_chunk_extension_value pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_size_almost_done;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_14: {
-    state->error = 0x23;
-    state->reason = "`on_chunk_extension_value` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_16: {
-    state->error = 0x2;
-    state->reason = "Invalid character in chunk extensions quote value";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_8: {
-    state->error = 0x15;
-    state->reason = "on_chunk_extension_value pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_extension_quoted_value_done;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_15: {
-    state->error = 0x23;
-    state->reason = "`on_chunk_extension_value` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_1;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_2: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_17;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_error_17;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_9: {
-    state->error = 0x15;
-    state->reason = "on_chunk_extension_value pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_size_otherwise;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_18: {
-    state->error = 0x23;
-    state->reason = "`on_chunk_extension_value` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_3: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_value_complete_2;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_value_4: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_value(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_19;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_error_19;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_pause_10: {
-    state->error = 0x15;
-    state->reason = "on_chunk_extension_name pause";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_chunk_extension_value;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_13: {
-    state->error = 0x22;
-    state->reason = "`on_chunk_extension_name` callback error";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_extension_name_complete_2: {
-    switch (llhttp__on_chunk_extension_name_complete(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_chunk_extension_value;
-      case 21:
-        goto s_n_llhttp__internal__n_pause_10;
-      default:
-        goto s_n_llhttp__internal__n_error_13;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_2: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_name(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_value;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_span_start_llhttp__on_chunk_extension_value;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_chunk_extension_name_3: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_chunk_extension_name(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_20;
-      return s_error;
-    }
-    p++;
-    goto s_n_llhttp__internal__n_error_20;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_21: {
-    state->error = 0xc;
-    state->reason = "Invalid character in chunk size";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_mul_add_content_length: {
-    switch (llhttp__internal__c_mul_add_content_length(state, p, endp, match)) {
-      case 1:
-        goto s_n_llhttp__internal__n_error_22;
-      default:
-        goto s_n_llhttp__internal__n_chunk_size;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_23: {
-    state->error = 0xc;
-    state->reason = "Invalid character in chunk size";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_span_end_llhttp__on_body_1: {
-    const unsigned char* start;
-    int err;
-    
-    start = state->_span_pos0;
-    state->_span_pos0 = NULL;
-    err = llhttp__on_body(state, start, p);
-    if (err != 0) {
-      state->error = err;
-      state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2;
-      return s_error;
-    }
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2;
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_invoke_update_finish_3: {
-    switch (llhttp__internal__c_update_finish_3(state, p, endp)) {
-      default:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_body_2;
-    }
-    /* UNREACHABLE */;
-    abort();
-  }
-  s_n_llhttp__internal__n_error_25: {
-    state->error = 0xf;
-    state->reason = "Request has invalid `Transfer-Encoding`";
-    state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_error;
-    return s_error;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_1: {
+    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_invoke_test_flags;
+      default:
+        goto s_n_llhttp__internal__n_error_5;
+    }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause: {
+  s_n_llhttp__internal__n_pause_17: {
     state->error = 0x15;
-    state->reason = "on_message_complete pause";
+    state->reason = "on_chunk_complete pause";
     state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__after_message_complete;
+    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2;
     return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_5: {
-    state->error = 0x12;
-    state->reason = "`on_message_complete` callback error";
+  s_n_llhttp__internal__n_error_41: {
+    state->error = 0x14;
+    state->reason = "`on_chunk_complete` callback error";
     state->error_pos = (const char*) p;
     state->_current = (void*) (intptr_t) s_error;
     return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_llhttp__on_message_complete: {
-    switch (llhttp__on_message_complete(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete_2: {
+    switch (llhttp__on_chunk_complete(state, p, endp)) {
       case 0:
-        goto s_n_llhttp__internal__n_invoke_llhttp__after_message_complete;
+        goto s_n_llhttp__internal__n_invoke_llhttp__on_message_complete_2;
       case 21:
-        goto s_n_llhttp__internal__n_pause;
+        goto s_n_llhttp__internal__n_pause_17;
       default:
-        goto s_n_llhttp__internal__n_error_5;
+        goto s_n_llhttp__internal__n_error_41;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_1: {
+  s_n_llhttp__internal__n_invoke_or_flags_3: {
     switch (llhttp__internal__c_or_flags_1(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_llhttp__after_headers_complete;
@@ -16114,7 +7598,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_2: {
+  s_n_llhttp__internal__n_invoke_or_flags_4: {
     switch (llhttp__internal__c_or_flags_1(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_llhttp__after_headers_complete;
@@ -16122,15 +7606,15 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_update_upgrade: {
+  s_n_llhttp__internal__n_invoke_update_upgrade_1: {
     switch (llhttp__internal__c_update_upgrade(state, p, endp)) {
       default:
-        goto s_n_llhttp__internal__n_invoke_or_flags_2;
+        goto s_n_llhttp__internal__n_invoke_or_flags_4;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_12: {
+  s_n_llhttp__internal__n_pause_16: {
     state->error = 0x15;
     state->reason = "Paused by on_headers_complete";
     state->error_pos = (const char*) p;
@@ -16139,7 +7623,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_4: {
+  s_n_llhttp__internal__n_error_40: {
     state->error = 0x11;
     state->reason = "User callback error";
     state->error_pos = (const char*) p;
@@ -16148,56 +7632,55 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_llhttp__on_headers_complete: {
+  s_n_llhttp__internal__n_invoke_llhttp__on_headers_complete_1: {
     switch (llhttp__on_headers_complete(state, p, endp)) {
       case 0:
         goto s_n_llhttp__internal__n_invoke_llhttp__after_headers_complete;
       case 1:
-        goto s_n_llhttp__internal__n_invoke_or_flags_1;
+        goto s_n_llhttp__internal__n_invoke_or_flags_3;
       case 2:
-        goto s_n_llhttp__internal__n_invoke_update_upgrade;
+        goto s_n_llhttp__internal__n_invoke_update_upgrade_1;
       case 21:
-        goto s_n_llhttp__internal__n_pause_12;
+        goto s_n_llhttp__internal__n_pause_16;
       default:
-        goto s_n_llhttp__internal__n_error_4;
+        goto s_n_llhttp__internal__n_error_40;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_llhttp__before_headers_complete: {
+  s_n_llhttp__internal__n_invoke_llhttp__before_headers_complete_1: {
     switch (llhttp__before_headers_complete(state, p, endp)) {
       default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__on_headers_complete;
+        goto s_n_llhttp__internal__n_invoke_llhttp__on_headers_complete_1;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_2: {
-    switch (llhttp__internal__c_test_lenient_flags_2(state, p, endp)) {
-      case 0:
-        goto s_n_llhttp__internal__n_error_26;
+  s_n_llhttp__internal__n_invoke_test_flags_1: {
+    switch (llhttp__internal__c_test_flags(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete_2;
       default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__before_headers_complete;
+        goto s_n_llhttp__internal__n_invoke_llhttp__before_headers_complete_1;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_flags_1: {
-    switch (llhttp__internal__c_test_flags_1(state, p, endp)) {
-      case 1:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_2;
-      default:
-        goto s_n_llhttp__internal__n_invoke_llhttp__before_headers_complete;
-    }
+  s_n_llhttp__internal__n_error_42: {
+    state->error = 0x2;
+    state->reason = "Expected LF after headers";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_flags: {
-    switch (llhttp__internal__c_test_flags(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_12: {
+    switch (llhttp__internal__c_test_lenient_flags_8(state, p, endp)) {
       case 1:
-        goto s_n_llhttp__internal__n_invoke_llhttp__on_chunk_complete_1;
-      default:
         goto s_n_llhttp__internal__n_invoke_test_flags_1;
+      default:
+        goto s_n_llhttp__internal__n_error_42;
     }
     /* UNREACHABLE */;
     abort();
@@ -16212,15 +7695,15 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_28;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_5;
       return s_error;
     }
     p++;
-    goto s_n_llhttp__internal__n_error_28;
+    goto s_n_llhttp__internal__n_error_5;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_3: {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_13: {
     switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_header_field_colon_discard_ws;
@@ -16230,7 +7713,16 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_31: {
+  s_n_llhttp__internal__n_error_57: {
+    state->error = 0xb;
+    state->reason = "Content-Length can't be present with Transfer-Encoding";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_45: {
     state->error = 0xa;
     state->reason = "Invalid header value char";
     state->error_pos = (const char*) p;
@@ -16239,17 +7731,17 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_5: {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_15: {
     switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_header_value_discard_ws;
       default:
-        goto s_n_llhttp__internal__n_error_31;
+        goto s_n_llhttp__internal__n_error_45;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_33: {
+  s_n_llhttp__internal__n_error_47: {
     state->error = 0xb;
     state->reason = "Empty Content-Length";
     state->error_pos = (const char*) p;
@@ -16258,7 +7750,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_14: {
+  s_n_llhttp__internal__n_pause_18: {
     state->error = 0x15;
     state->reason = "on_header_value_complete pause";
     state->error_pos = (const char*) p;
@@ -16267,7 +7759,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_32: {
+  s_n_llhttp__internal__n_error_46: {
     state->error = 0x1d;
     state->reason = "`on_header_value_complete` callback error";
     state->error_pos = (const char*) p;
@@ -16301,65 +7793,65 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_3: {
-    switch (llhttp__internal__c_or_flags_3(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_5: {
+    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_4: {
-    switch (llhttp__internal__c_or_flags_4(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_6: {
+    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_5: {
-    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_7: {
+    switch (llhttp__internal__c_or_flags_7(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_6: {
-    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_8: {
+    switch (llhttp__internal__c_or_flags_8(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_span_start_llhttp__on_header_value;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_load_header_state_1: {
+  s_n_llhttp__internal__n_invoke_load_header_state_2: {
     switch (llhttp__internal__c_load_header_state(state, p, endp)) {
       case 5:
-        goto s_n_llhttp__internal__n_invoke_or_flags_3;
+        goto s_n_llhttp__internal__n_invoke_or_flags_5;
       case 6:
-        goto s_n_llhttp__internal__n_invoke_or_flags_4;
+        goto s_n_llhttp__internal__n_invoke_or_flags_6;
       case 7:
-        goto s_n_llhttp__internal__n_invoke_or_flags_5;
+        goto s_n_llhttp__internal__n_invoke_or_flags_7;
       case 8:
-        goto s_n_llhttp__internal__n_invoke_or_flags_6;
+        goto s_n_llhttp__internal__n_invoke_or_flags_8;
       default:
         goto s_n_llhttp__internal__n_span_start_llhttp__on_header_value;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_load_header_state: {
+  s_n_llhttp__internal__n_invoke_load_header_state_1: {
     switch (llhttp__internal__c_load_header_state(state, p, endp)) {
       case 2:
-        goto s_n_llhttp__internal__n_error_33;
+        goto s_n_llhttp__internal__n_error_47;
       default:
-        goto s_n_llhttp__internal__n_invoke_load_header_state_1;
+        goto s_n_llhttp__internal__n_invoke_load_header_state_2;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_30: {
+  s_n_llhttp__internal__n_error_44: {
     state->error = 0xa;
     state->reason = "Invalid header value char";
     state->error_pos = (const char*) p;
@@ -16368,17 +7860,17 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_4: {
-    switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_14: {
+    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_header_value_discard_lws;
       default:
-        goto s_n_llhttp__internal__n_error_30;
+        goto s_n_llhttp__internal__n_error_44;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_34: {
+  s_n_llhttp__internal__n_error_48: {
     state->error = 0x2;
     state->reason = "Expected LF after CR";
     state->error_pos = (const char*) p;
@@ -16387,12 +7879,12 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_6: {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_16: {
     switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_header_value_discard_lws;
       default:
-        goto s_n_llhttp__internal__n_error_34;
+        goto s_n_llhttp__internal__n_error_48;
     }
     /* UNREACHABLE */;
     abort();
@@ -16405,7 +7897,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_load_header_state_3: {
+  s_n_llhttp__internal__n_invoke_load_header_state_4: {
     switch (llhttp__internal__c_load_header_state(state, p, endp)) {
       case 8:
         goto s_n_llhttp__internal__n_invoke_update_header_state_1;
@@ -16423,55 +7915,55 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_7: {
-    switch (llhttp__internal__c_or_flags_3(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_9: {
+    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state_2;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_8: {
-    switch (llhttp__internal__c_or_flags_4(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_10: {
+    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state_2;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_9: {
-    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_11: {
+    switch (llhttp__internal__c_or_flags_7(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state_2;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_10: {
-    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_12: {
+    switch (llhttp__internal__c_or_flags_8(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_load_header_state_4: {
+  s_n_llhttp__internal__n_invoke_load_header_state_5: {
     switch (llhttp__internal__c_load_header_state(state, p, endp)) {
       case 5:
-        goto s_n_llhttp__internal__n_invoke_or_flags_7;
+        goto s_n_llhttp__internal__n_invoke_or_flags_9;
       case 6:
-        goto s_n_llhttp__internal__n_invoke_or_flags_8;
+        goto s_n_llhttp__internal__n_invoke_or_flags_10;
       case 7:
-        goto s_n_llhttp__internal__n_invoke_or_flags_9;
+        goto s_n_llhttp__internal__n_invoke_or_flags_11;
       case 8:
-        goto s_n_llhttp__internal__n_invoke_or_flags_10;
+        goto s_n_llhttp__internal__n_invoke_or_flags_12;
       default:
         goto s_n_llhttp__internal__n_invoke_llhttp__on_header_value_complete;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_35: {
+  s_n_llhttp__internal__n_error_50: {
     state->error = 0x3;
     state->reason = "Missing expected LF after header value";
     state->error_pos = (const char*) p;
@@ -16480,10 +7972,36 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
+  s_n_llhttp__internal__n_error_49: {
+    state->error = 0x19;
+    state->reason = "Missing expected CR after header value";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
   s_n_llhttp__internal__n_span_end_llhttp__on_header_value_1: {
     const unsigned char* start;
     int err;
     
+    start = state->_span_pos0;
+    state->_span_pos0 = NULL;
+    err = llhttp__on_header_value(state, start, p);
+    if (err != 0) {
+      state->error = err;
+      state->error_pos = (const char*) p;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_test_lenient_flags_17;
+      return s_error;
+    }
+    goto s_n_llhttp__internal__n_invoke_test_lenient_flags_17;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_2: {
+    const unsigned char* start;
+    int err;
+    
     start = state->_span_pos0;
     state->_span_pos0 = NULL;
     err = llhttp__on_header_value(state, start, p);
@@ -16498,7 +8016,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_3: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_4: {
     const unsigned char* start;
     int err;
     
@@ -16515,7 +8033,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_4: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_5: {
     const unsigned char* start;
     int err;
     
@@ -16533,7 +8051,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_2: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_3: {
     const unsigned char* start;
     int err;
     
@@ -16543,19 +8061,19 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_36;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_51;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_36;
+    goto s_n_llhttp__internal__n_error_51;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_7: {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_18: {
     switch (llhttp__internal__c_test_lenient_flags(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_header_value_lenient;
       default:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_2;
+        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_3;
     }
     /* UNREACHABLE */;
     abort();
@@ -16568,48 +8086,48 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_11: {
-    switch (llhttp__internal__c_or_flags_3(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_13: {
+    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state_4;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_12: {
-    switch (llhttp__internal__c_or_flags_4(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_14: {
+    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state_4;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_13: {
-    switch (llhttp__internal__c_or_flags_5(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_15: {
+    switch (llhttp__internal__c_or_flags_7(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_update_header_state_4;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_14: {
-    switch (llhttp__internal__c_or_flags_6(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_16: {
+    switch (llhttp__internal__c_or_flags_8(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_header_value_connection;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_load_header_state_5: {
+  s_n_llhttp__internal__n_invoke_load_header_state_6: {
     switch (llhttp__internal__c_load_header_state(state, p, endp)) {
       case 5:
-        goto s_n_llhttp__internal__n_invoke_or_flags_11;
+        goto s_n_llhttp__internal__n_invoke_or_flags_13;
       case 6:
-        goto s_n_llhttp__internal__n_invoke_or_flags_12;
+        goto s_n_llhttp__internal__n_invoke_or_flags_14;
       case 7:
-        goto s_n_llhttp__internal__n_invoke_or_flags_13;
+        goto s_n_llhttp__internal__n_invoke_or_flags_15;
       case 8:
-        goto s_n_llhttp__internal__n_invoke_or_flags_14;
+        goto s_n_llhttp__internal__n_invoke_or_flags_16;
       default:
         goto s_n_llhttp__internal__n_header_value_connection;
     }
@@ -16648,7 +8166,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_5: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_6: {
     const unsigned char* start;
     int err;
     
@@ -16658,32 +8176,32 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_38;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_53;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_38;
+    goto s_n_llhttp__internal__n_error_53;
     /* UNREACHABLE */;
     abort();
   }
   s_n_llhttp__internal__n_invoke_mul_add_content_length_1: {
     switch (llhttp__internal__c_mul_add_content_length_1(state, p, endp, match)) {
       case 1:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_5;
+        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_6;
       default:
         goto s_n_llhttp__internal__n_header_value_content_length;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_15: {
-    switch (llhttp__internal__c_or_flags_15(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_17: {
+    switch (llhttp__internal__c_or_flags_17(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_header_value_otherwise;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_6: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_7: {
     const unsigned char* start;
     int err;
     
@@ -16693,14 +8211,14 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_39;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_54;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_39;
+    goto s_n_llhttp__internal__n_error_54;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_37: {
+  s_n_llhttp__internal__n_error_52: {
     state->error = 0x4;
     state->reason = "Duplicate Content-Length";
     state->error_pos = (const char*) p;
@@ -16714,12 +8232,12 @@ static llparse_state_t llhttp__internal__run(
       case 0:
         goto s_n_llhttp__internal__n_header_value_content_length;
       default:
-        goto s_n_llhttp__internal__n_error_37;
+        goto s_n_llhttp__internal__n_error_52;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_8: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_9: {
     const unsigned char* start;
     int err;
     
@@ -16729,11 +8247,11 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_41;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_56;
       return s_error;
     }
     p++;
-    goto s_n_llhttp__internal__n_error_41;
+    goto s_n_llhttp__internal__n_error_56;
     /* UNREACHABLE */;
     abort();
   }
@@ -16745,7 +8263,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_7: {
+  s_n_llhttp__internal__n_span_end_llhttp__on_header_value_8: {
     const unsigned char* start;
     int err;
     
@@ -16755,18 +8273,18 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_40;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_55;
       return s_error;
     }
     p++;
-    goto s_n_llhttp__internal__n_error_40;
+    goto s_n_llhttp__internal__n_error_55;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_8: {
-    switch (llhttp__internal__c_test_lenient_flags_8(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_19: {
+    switch (llhttp__internal__c_test_lenient_flags_19(state, p, endp)) {
       case 0:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_7;
+        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_8;
       default:
         goto s_n_llhttp__internal__n_header_value_te_chunked;
     }
@@ -16776,7 +8294,7 @@ static llparse_state_t llhttp__internal__run(
   s_n_llhttp__internal__n_invoke_load_type_1: {
     switch (llhttp__internal__c_load_type(state, p, endp)) {
       case 1:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_8;
+        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_19;
       default:
         goto s_n_llhttp__internal__n_header_value_te_chunked;
     }
@@ -16799,20 +8317,20 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_17: {
-    switch (llhttp__internal__c_or_flags_16(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_or_flags_19: {
+    switch (llhttp__internal__c_or_flags_18(state, p, endp)) {
       default:
         goto s_n_llhttp__internal__n_invoke_and_flags;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_9: {
-    switch (llhttp__internal__c_test_lenient_flags_8(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_20: {
+    switch (llhttp__internal__c_test_lenient_flags_19(state, p, endp)) {
       case 0:
-        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_8;
+        goto s_n_llhttp__internal__n_span_end_llhttp__on_header_value_9;
       default:
-        goto s_n_llhttp__internal__n_invoke_or_flags_17;
+        goto s_n_llhttp__internal__n_invoke_or_flags_19;
     }
     /* UNREACHABLE */;
     abort();
@@ -16820,65 +8338,114 @@ static llparse_state_t llhttp__internal__run(
   s_n_llhttp__internal__n_invoke_load_type_2: {
     switch (llhttp__internal__c_load_type(state, p, endp)) {
       case 1:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_9;
+        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_20;
+      default:
+        goto s_n_llhttp__internal__n_invoke_or_flags_19;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_or_flags_18: {
+    switch (llhttp__internal__c_or_flags_18(state, p, endp)) {
+      default:
+        goto s_n_llhttp__internal__n_invoke_and_flags;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_flags_3: {
+    switch (llhttp__internal__c_test_flags_3(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_invoke_load_type_2;
+      default:
+        goto s_n_llhttp__internal__n_invoke_or_flags_18;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_or_flags_20: {
+    switch (llhttp__internal__c_or_flags_20(state, p, endp)) {
+      default:
+        goto s_n_llhttp__internal__n_invoke_update_header_state_9;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_load_header_state_3: {
+    switch (llhttp__internal__c_load_header_state(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_header_value_connection;
+      case 2:
+        goto s_n_llhttp__internal__n_invoke_test_flags_2;
+      case 3:
+        goto s_n_llhttp__internal__n_invoke_test_flags_3;
+      case 4:
+        goto s_n_llhttp__internal__n_invoke_or_flags_20;
       default:
-        goto s_n_llhttp__internal__n_invoke_or_flags_17;
+        goto s_n_llhttp__internal__n_header_value;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_16: {
-    switch (llhttp__internal__c_or_flags_16(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_21: {
+    switch (llhttp__internal__c_test_lenient_flags_21(state, p, endp)) {
+      case 0:
+        goto s_n_llhttp__internal__n_error_57;
       default:
-        goto s_n_llhttp__internal__n_invoke_and_flags;
+        goto s_n_llhttp__internal__n_header_value_discard_ws;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_flags_3: {
-    switch (llhttp__internal__c_test_flags_3(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_flags_4: {
+    switch (llhttp__internal__c_test_flags_4(state, p, endp)) {
       case 1:
-        goto s_n_llhttp__internal__n_invoke_load_type_2;
+        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_21;
       default:
-        goto s_n_llhttp__internal__n_invoke_or_flags_16;
+        goto s_n_llhttp__internal__n_header_value_discard_ws;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_or_flags_18: {
-    switch (llhttp__internal__c_or_flags_18(state, p, endp)) {
+  s_n_llhttp__internal__n_error_58: {
+    state->error = 0xf;
+    state->reason = "Transfer-Encoding can't be present with Content-Length";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_22: {
+    switch (llhttp__internal__c_test_lenient_flags_21(state, p, endp)) {
+      case 0:
+        goto s_n_llhttp__internal__n_error_58;
       default:
-        goto s_n_llhttp__internal__n_invoke_update_header_state_9;
+        goto s_n_llhttp__internal__n_header_value_discard_ws;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_load_header_state_2: {
-    switch (llhttp__internal__c_load_header_state(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_flags_5: {
+    switch (llhttp__internal__c_test_flags_2(state, p, endp)) {
       case 1:
-        goto s_n_llhttp__internal__n_header_value_connection;
-      case 2:
-        goto s_n_llhttp__internal__n_invoke_test_flags_2;
-      case 3:
-        goto s_n_llhttp__internal__n_invoke_test_flags_3;
-      case 4:
-        goto s_n_llhttp__internal__n_invoke_or_flags_18;
+        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_22;
       default:
-        goto s_n_llhttp__internal__n_header_value;
+        goto s_n_llhttp__internal__n_header_value_discard_ws;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_15: {
+  s_n_llhttp__internal__n_pause_19: {
     state->error = 0x15;
     state->reason = "on_header_field_complete pause";
     state->error_pos = (const char*) p;
-    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_header_value_discard_ws;
+    state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_load_header_state;
     return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_29: {
+  s_n_llhttp__internal__n_error_43: {
     state->error = 0x1c;
     state->reason = "`on_header_field_complete` callback error";
     state->error_pos = (const char*) p;
@@ -16923,7 +8490,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_42: {
+  s_n_llhttp__internal__n_error_59: {
     state->error = 0xa;
     state->reason = "Invalid header token";
     state->error_pos = (const char*) p;
@@ -16956,7 +8523,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_3: {
+  s_n_llhttp__internal__n_error_4: {
     state->error = 0x1e;
     state->reason = "Unexpected space after start line";
     state->error_pos = (const char*) p;
@@ -16970,12 +8537,12 @@ static llparse_state_t llhttp__internal__run(
       case 1:
         goto s_n_llhttp__internal__n_header_field_start;
       default:
-        goto s_n_llhttp__internal__n_error_3;
+        goto s_n_llhttp__internal__n_error_4;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_16: {
+  s_n_llhttp__internal__n_pause_20: {
     state->error = 0x15;
     state->reason = "on_url_complete pause";
     state->error_pos = (const char*) p;
@@ -16984,7 +8551,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_2: {
+  s_n_llhttp__internal__n_error_3: {
     state->error = 0x1a;
     state->reason = "`on_url_complete` callback error";
     state->error_pos = (const char*) p;
@@ -16998,9 +8565,9 @@ static llparse_state_t llhttp__internal__run(
       case 0:
         goto s_n_llhttp__internal__n_headers_start;
       case 21:
-        goto s_n_llhttp__internal__n_pause_16;
+        goto s_n_llhttp__internal__n_pause_20;
       default:
-        goto s_n_llhttp__internal__n_error_2;
+        goto s_n_llhttp__internal__n_error_3;
     }
     /* UNREACHABLE */;
     abort();
@@ -17038,7 +8605,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_43: {
+  s_n_llhttp__internal__n_error_60: {
     state->error = 0x7;
     state->reason = "Expected CRLF";
     state->error_pos = (const char*) p;
@@ -17064,7 +8631,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_49: {
+  s_n_llhttp__internal__n_error_68: {
     state->error = 0x17;
     state->reason = "Pause on PRI/Upgrade";
     state->error_pos = (const char*) p;
@@ -17073,7 +8640,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_50: {
+  s_n_llhttp__internal__n_error_69: {
     state->error = 0x9;
     state->reason = "Expected HTTP/2 Connection Preface";
     state->error_pos = (const char*) p;
@@ -17082,7 +8649,26 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_48: {
+  s_n_llhttp__internal__n_error_66: {
+    state->error = 0x2;
+    state->reason = "Expected CRLF after version";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_25: {
+    switch (llhttp__internal__c_test_lenient_flags_8(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_headers_start;
+      default:
+        goto s_n_llhttp__internal__n_error_66;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_65: {
     state->error = 0x9;
     state->reason = "Expected CRLF after version";
     state->error_pos = (const char*) p;
@@ -17091,7 +8677,26 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_17: {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_24: {
+    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_req_http_complete_crlf;
+      default:
+        goto s_n_llhttp__internal__n_error_65;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_67: {
+    state->error = 0x9;
+    state->reason = "Expected CRLF after version";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_pause_21: {
     state->error = 0x15;
     state->reason = "on_version_complete pause";
     state->error_pos = (const char*) p;
@@ -17100,7 +8705,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_47: {
+  s_n_llhttp__internal__n_error_64: {
     state->error = 0x21;
     state->reason = "`on_version_complete` callback error";
     state->error_pos = (const char*) p;
@@ -17136,10 +8741,10 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_46;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_63;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_46;
+    goto s_n_llhttp__internal__n_error_63;
     /* UNREACHABLE */;
     abort();
   }
@@ -17189,8 +8794,8 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_10: {
-    switch (llhttp__internal__c_test_lenient_flags_10(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_23: {
+    switch (llhttp__internal__c_test_lenient_flags_23(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_span_end_llhttp__on_version_1;
       default:
@@ -17202,7 +8807,7 @@ static llparse_state_t llhttp__internal__run(
   s_n_llhttp__internal__n_invoke_store_http_minor: {
     switch (llhttp__internal__c_store_http_minor(state, p, endp, match)) {
       default:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_10;
+        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_23;
     }
     /* UNREACHABLE */;
     abort();
@@ -17217,10 +8822,10 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_51;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_70;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_51;
+    goto s_n_llhttp__internal__n_error_70;
     /* UNREACHABLE */;
     abort();
   }
@@ -17234,10 +8839,10 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_52;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_71;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_52;
+    goto s_n_llhttp__internal__n_error_71;
     /* UNREACHABLE */;
     abort();
   }
@@ -17259,14 +8864,14 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_53;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_72;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_53;
+    goto s_n_llhttp__internal__n_error_72;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_45: {
+  s_n_llhttp__internal__n_error_62: {
     state->error = 0x8;
     state->reason = "Invalid method for HTTP/x.x request";
     state->error_pos = (const char*) p;
@@ -17348,12 +8953,12 @@ static llparse_state_t llhttp__internal__run(
       case 34:
         goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
       default:
-        goto s_n_llhttp__internal__n_error_45;
+        goto s_n_llhttp__internal__n_error_62;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_56: {
+  s_n_llhttp__internal__n_error_75: {
     state->error = 0x8;
     state->reason = "Expected HTTP/";
     state->error_pos = (const char*) p;
@@ -17362,7 +8967,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_54: {
+  s_n_llhttp__internal__n_error_73: {
     state->error = 0x8;
     state->reason = "Expected SOURCE method for ICE/x.x request";
     state->error_pos = (const char*) p;
@@ -17376,12 +8981,12 @@ static llparse_state_t llhttp__internal__run(
       case 33:
         goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
       default:
-        goto s_n_llhttp__internal__n_error_54;
+        goto s_n_llhttp__internal__n_error_73;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_55: {
+  s_n_llhttp__internal__n_error_74: {
     state->error = 0x8;
     state->reason = "Invalid method for RTSP/x.x request";
     state->error_pos = (const char*) p;
@@ -17421,12 +9026,12 @@ static llparse_state_t llhttp__internal__run(
       case 45:
         goto s_n_llhttp__internal__n_span_start_llhttp__on_version;
       default:
-        goto s_n_llhttp__internal__n_error_55;
+        goto s_n_llhttp__internal__n_error_74;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_18: {
+  s_n_llhttp__internal__n_pause_22: {
     state->error = 0x15;
     state->reason = "on_url_complete pause";
     state->error_pos = (const char*) p;
@@ -17435,7 +9040,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_44: {
+  s_n_llhttp__internal__n_error_61: {
     state->error = 0x1a;
     state->reason = "`on_url_complete` callback error";
     state->error_pos = (const char*) p;
@@ -17449,9 +9054,9 @@ static llparse_state_t llhttp__internal__run(
       case 0:
         goto s_n_llhttp__internal__n_req_http_start;
       case 21:
-        goto s_n_llhttp__internal__n_pause_18;
+        goto s_n_llhttp__internal__n_pause_22;
       default:
-        goto s_n_llhttp__internal__n_error_44;
+        goto s_n_llhttp__internal__n_error_61;
     }
     /* UNREACHABLE */;
     abort();
@@ -17524,7 +9129,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_57: {
+  s_n_llhttp__internal__n_error_76: {
     state->error = 0x7;
     state->reason = "Invalid char in url fragment start";
     state->error_pos = (const char*) p;
@@ -17584,7 +9189,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_58: {
+  s_n_llhttp__internal__n_error_77: {
     state->error = 0x7;
     state->reason = "Invalid char in url query";
     state->error_pos = (const char*) p;
@@ -17593,7 +9198,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_59: {
+  s_n_llhttp__internal__n_error_78: {
     state->error = 0x7;
     state->reason = "Invalid char in url path";
     state->error_pos = (const char*) p;
@@ -17704,7 +9309,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_60: {
+  s_n_llhttp__internal__n_error_79: {
     state->error = 0x7;
     state->reason = "Double @ in url";
     state->error_pos = (const char*) p;
@@ -17713,7 +9318,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_61: {
+  s_n_llhttp__internal__n_error_80: {
     state->error = 0x7;
     state->reason = "Unexpected char in url server";
     state->error_pos = (const char*) p;
@@ -17722,7 +9327,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_62: {
+  s_n_llhttp__internal__n_error_81: {
     state->error = 0x7;
     state->reason = "Unexpected char in url server";
     state->error_pos = (const char*) p;
@@ -17731,7 +9336,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_64: {
+  s_n_llhttp__internal__n_error_82: {
     state->error = 0x7;
     state->reason = "Unexpected char in url schema";
     state->error_pos = (const char*) p;
@@ -17740,7 +9345,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_65: {
+  s_n_llhttp__internal__n_error_83: {
     state->error = 0x7;
     state->reason = "Unexpected char in url schema";
     state->error_pos = (const char*) p;
@@ -17749,7 +9354,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_66: {
+  s_n_llhttp__internal__n_error_84: {
     state->error = 0x7;
     state->reason = "Unexpected start char in url";
     state->error_pos = (const char*) p;
@@ -17761,14 +9366,14 @@ static llparse_state_t llhttp__internal__run(
   s_n_llhttp__internal__n_invoke_is_equal_method: {
     switch (llhttp__internal__c_is_equal_method(state, p, endp)) {
       case 0:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_url_1;
+        goto s_n_llhttp__internal__n_url_entry_normal;
       default:
-        goto s_n_llhttp__internal__n_span_start_llhttp__on_url;
+        goto s_n_llhttp__internal__n_url_entry_connect;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_67: {
+  s_n_llhttp__internal__n_error_85: {
     state->error = 0x6;
     state->reason = "Expected space after method";
     state->error_pos = (const char*) p;
@@ -17777,7 +9382,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_22: {
+  s_n_llhttp__internal__n_pause_26: {
     state->error = 0x15;
     state->reason = "on_method_complete pause";
     state->error_pos = (const char*) p;
@@ -17786,7 +9391,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_78: {
+  s_n_llhttp__internal__n_error_104: {
     state->error = 0x20;
     state->reason = "`on_method_complete` callback error";
     state->error_pos = (const char*) p;
@@ -17820,7 +9425,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_79: {
+  s_n_llhttp__internal__n_error_105: {
     state->error = 0x6;
     state->reason = "Invalid method encountered";
     state->error_pos = (const char*) p;
@@ -17829,26 +9434,34 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_70: {
+  s_n_llhttp__internal__n_error_97: {
     state->error = 0xd;
-    state->reason = "Response overflow";
+    state->reason = "Invalid status code";
     state->error_pos = (const char*) p;
     state->_current = (void*) (intptr_t) s_error;
     return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_mul_add_status_code: {
-    switch (llhttp__internal__c_mul_add_status_code(state, p, endp, match)) {
-      case 1:
-        goto s_n_llhttp__internal__n_error_70;
-      default:
-        goto s_n_llhttp__internal__n_res_status_code;
-    }
+  s_n_llhttp__internal__n_error_95: {
+    state->error = 0xd;
+    state->reason = "Invalid status code";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_20: {
+  s_n_llhttp__internal__n_error_93: {
+    state->error = 0xd;
+    state->reason = "Invalid status code";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_pause_24: {
     state->error = 0x15;
     state->reason = "on_status_complete pause";
     state->error_pos = (const char*) p;
@@ -17857,7 +9470,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_71: {
+  s_n_llhttp__internal__n_error_89: {
     state->error = 0x1b;
     state->reason = "`on_status_complete` callback error";
     state->error_pos = (const char*) p;
@@ -17866,6 +9479,65 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
+  s_n_llhttp__internal__n_invoke_llhttp__on_status_complete: {
+    switch (llhttp__on_status_complete(state, p, endp)) {
+      case 0:
+        goto s_n_llhttp__internal__n_headers_start;
+      case 21:
+        goto s_n_llhttp__internal__n_pause_24;
+      default:
+        goto s_n_llhttp__internal__n_error_89;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_88: {
+    state->error = 0xd;
+    state->reason = "Invalid response status";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_27: {
+    switch (llhttp__internal__c_test_lenient_flags_1(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
+      default:
+        goto s_n_llhttp__internal__n_error_88;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_90: {
+    state->error = 0x2;
+    state->reason = "Expected LF after CR";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_28: {
+    switch (llhttp__internal__c_test_lenient_flags_8(state, p, endp)) {
+      case 1:
+        goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
+      default:
+        goto s_n_llhttp__internal__n_error_90;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_91: {
+    state->error = 0x19;
+    state->reason = "Missing expected CR after response line";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
   s_n_llhttp__internal__n_span_end_llhttp__on_status: {
     const unsigned char* start;
     int err;
@@ -17876,11 +9548,11 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) (p + 1);
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_invoke_test_lenient_flags_29;
       return s_error;
     }
     p++;
-    goto s_n_llhttp__internal__n_invoke_llhttp__on_status_complete;
+    goto s_n_llhttp__internal__n_invoke_test_lenient_flags_29;
     /* UNREACHABLE */;
     abort();
   }
@@ -17902,7 +9574,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_72: {
+  s_n_llhttp__internal__n_error_92: {
     state->error = 0xd;
     state->reason = "Invalid response status";
     state->error_pos = (const char*) p;
@@ -17911,15 +9583,72 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
+  s_n_llhttp__internal__n_invoke_mul_add_status_code_2: {
+    switch (llhttp__internal__c_mul_add_status_code(state, p, endp, match)) {
+      case 1:
+        goto s_n_llhttp__internal__n_error_93;
+      default:
+        goto s_n_llhttp__internal__n_res_status_code_otherwise;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_94: {
+    state->error = 0xd;
+    state->reason = "Invalid status code";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_mul_add_status_code_1: {
+    switch (llhttp__internal__c_mul_add_status_code(state, p, endp, match)) {
+      case 1:
+        goto s_n_llhttp__internal__n_error_95;
+      default:
+        goto s_n_llhttp__internal__n_res_status_code_digit_3;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_96: {
+    state->error = 0xd;
+    state->reason = "Invalid status code";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_invoke_mul_add_status_code: {
+    switch (llhttp__internal__c_mul_add_status_code(state, p, endp, match)) {
+      case 1:
+        goto s_n_llhttp__internal__n_error_97;
+      default:
+        goto s_n_llhttp__internal__n_res_status_code_digit_2;
+    }
+    /* UNREACHABLE */;
+    abort();
+  }
+  s_n_llhttp__internal__n_error_98: {
+    state->error = 0xd;
+    state->reason = "Invalid status code";
+    state->error_pos = (const char*) p;
+    state->_current = (void*) (intptr_t) s_error;
+    return s_error;
+    /* UNREACHABLE */;
+    abort();
+  }
   s_n_llhttp__internal__n_invoke_update_status_code: {
     switch (llhttp__internal__c_update_status_code(state, p, endp)) {
       default:
-        goto s_n_llhttp__internal__n_res_status_code;
+        goto s_n_llhttp__internal__n_res_status_code_digit_1;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_73: {
+  s_n_llhttp__internal__n_error_99: {
     state->error = 0x9;
     state->reason = "Expected space after version";
     state->error_pos = (const char*) p;
@@ -17928,7 +9657,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_21: {
+  s_n_llhttp__internal__n_pause_25: {
     state->error = 0x15;
     state->reason = "on_version_complete pause";
     state->error_pos = (const char*) p;
@@ -17937,7 +9666,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_69: {
+  s_n_llhttp__internal__n_error_87: {
     state->error = 0x21;
     state->reason = "`on_version_complete` callback error";
     state->error_pos = (const char*) p;
@@ -17973,10 +9702,10 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_68;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_86;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_68;
+    goto s_n_llhttp__internal__n_error_86;
     /* UNREACHABLE */;
     abort();
   }
@@ -18026,8 +9755,8 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_invoke_test_lenient_flags_11: {
-    switch (llhttp__internal__c_test_lenient_flags_10(state, p, endp)) {
+  s_n_llhttp__internal__n_invoke_test_lenient_flags_26: {
+    switch (llhttp__internal__c_test_lenient_flags_23(state, p, endp)) {
       case 1:
         goto s_n_llhttp__internal__n_span_end_llhttp__on_version_6;
       default:
@@ -18039,7 +9768,7 @@ static llparse_state_t llhttp__internal__run(
   s_n_llhttp__internal__n_invoke_store_http_minor_1: {
     switch (llhttp__internal__c_store_http_minor(state, p, endp, match)) {
       default:
-        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_11;
+        goto s_n_llhttp__internal__n_invoke_test_lenient_flags_26;
     }
     /* UNREACHABLE */;
     abort();
@@ -18054,10 +9783,10 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_74;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_100;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_74;
+    goto s_n_llhttp__internal__n_error_100;
     /* UNREACHABLE */;
     abort();
   }
@@ -18071,10 +9800,10 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_75;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_101;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_75;
+    goto s_n_llhttp__internal__n_error_101;
     /* UNREACHABLE */;
     abort();
   }
@@ -18096,14 +9825,14 @@ static llparse_state_t llhttp__internal__run(
     if (err != 0) {
       state->error = err;
       state->error_pos = (const char*) p;
-      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_76;
+      state->_current = (void*) (intptr_t) s_n_llhttp__internal__n_error_102;
       return s_error;
     }
-    goto s_n_llhttp__internal__n_error_76;
+    goto s_n_llhttp__internal__n_error_102;
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_80: {
+  s_n_llhttp__internal__n_error_106: {
     state->error = 0x8;
     state->reason = "Expected HTTP/";
     state->error_pos = (const char*) p;
@@ -18112,7 +9841,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_19: {
+  s_n_llhttp__internal__n_pause_23: {
     state->error = 0x15;
     state->reason = "on_method_complete pause";
     state->error_pos = (const char*) p;
@@ -18163,7 +9892,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_77: {
+  s_n_llhttp__internal__n_error_103: {
     state->error = 0x8;
     state->reason = "Invalid word encountered";
     state->error_pos = (const char*) p;
@@ -18197,7 +9926,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_23: {
+  s_n_llhttp__internal__n_pause_27: {
     state->error = 0x15;
     state->reason = "on_message_begin pause";
     state->error_pos = (const char*) p;
@@ -18220,14 +9949,14 @@ static llparse_state_t llhttp__internal__run(
       case 0:
         goto s_n_llhttp__internal__n_invoke_load_type;
       case 21:
-        goto s_n_llhttp__internal__n_pause_23;
+        goto s_n_llhttp__internal__n_pause_27;
       default:
         goto s_n_llhttp__internal__n_error;
     }
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_pause_24: {
+  s_n_llhttp__internal__n_pause_28: {
     state->error = 0x15;
     state->reason = "on_reset pause";
     state->error_pos = (const char*) p;
@@ -18236,7 +9965,7 @@ static llparse_state_t llhttp__internal__run(
     /* UNREACHABLE */;
     abort();
   }
-  s_n_llhttp__internal__n_error_81: {
+  s_n_llhttp__internal__n_error_107: {
     state->error = 0x1f;
     state->reason = "`on_reset` callback error";
     state->error_pos = (const char*) p;
@@ -18250,9 +9979,9 @@ static llparse_state_t llhttp__internal__run(
       case 0:
         goto s_n_llhttp__internal__n_invoke_update_finish;
       case 21:
-        goto s_n_llhttp__internal__n_pause_24;
+        goto s_n_llhttp__internal__n_pause_28;
       default:
-        goto s_n_llhttp__internal__n_error_81;
+        goto s_n_llhttp__internal__n_error_107;
     }
     /* UNREACHABLE */;
     abort();
@@ -18301,6 +10030,4 @@ int llhttp__internal_execute(llhttp__internal_t* state, const char* p, const cha
   }
   
   return 0;
-}
-
-#endif  /* LLHTTP_STRICT_MODE */
+}
\ No newline at end of file
diff --git a/deps/nghttp2/lib/CMakeLists.txt b/deps/nghttp2/lib/CMakeLists.txt
index fad04716ffafb7..7adba3a3ffa2da 100644
--- a/deps/nghttp2/lib/CMakeLists.txt
+++ b/deps/nghttp2/lib/CMakeLists.txt
@@ -24,6 +24,8 @@ set(NGHTTP2_SOURCES
   nghttp2_http.c
   nghttp2_rcbuf.c
   nghttp2_extpri.c
+  nghttp2_ratelim.c
+  nghttp2_time.c
   nghttp2_debug.c
   sfparse.c
 )
diff --git a/deps/nghttp2/lib/Makefile.am b/deps/nghttp2/lib/Makefile.am
index cd928ae465501f..c3ace4029a69b8 100644
--- a/deps/nghttp2/lib/Makefile.am
+++ b/deps/nghttp2/lib/Makefile.am
@@ -51,6 +51,8 @@ OBJECTS = nghttp2_pq.c nghttp2_map.c nghttp2_queue.c \
 	nghttp2_http.c \
 	nghttp2_rcbuf.c \
 	nghttp2_extpri.c \
+	nghttp2_ratelim.c \
+	nghttp2_time.c \
 	nghttp2_debug.c \
 	sfparse.c
 
@@ -69,6 +71,8 @@ HFILES = nghttp2_pq.h nghttp2_int.h nghttp2_map.h nghttp2_queue.h \
 	nghttp2_http.h \
 	nghttp2_rcbuf.h \
 	nghttp2_extpri.h \
+	nghttp2_ratelim.h \
+	nghttp2_time.h \
 	nghttp2_debug.h \
 	sfparse.h
 
diff --git a/deps/nghttp2/lib/Makefile.in b/deps/nghttp2/lib/Makefile.in
index 24a6cc468ed773..0b95613bc21808 100644
--- a/deps/nghttp2/lib/Makefile.in
+++ b/deps/nghttp2/lib/Makefile.in
@@ -157,7 +157,8 @@ am__objects_2 = nghttp2_pq.lo nghttp2_map.lo nghttp2_queue.lo \
 	nghttp2_hd_huffman.lo nghttp2_hd_huffman_data.lo \
 	nghttp2_version.lo nghttp2_priority_spec.lo nghttp2_option.lo \
 	nghttp2_callbacks.lo nghttp2_mem.lo nghttp2_http.lo \
-	nghttp2_rcbuf.lo nghttp2_extpri.lo nghttp2_debug.lo sfparse.lo
+	nghttp2_rcbuf.lo nghttp2_extpri.lo nghttp2_ratelim.lo \
+	nghttp2_time.lo nghttp2_debug.lo sfparse.lo
 am_libnghttp2_la_OBJECTS = $(am__objects_1) $(am__objects_2)
 libnghttp2_la_OBJECTS = $(am_libnghttp2_la_OBJECTS)
 AM_V_lt = $(am__v_lt_@AM_V@)
@@ -194,9 +195,10 @@ am__depfiles_remade = ./$(DEPDIR)/nghttp2_buf.Plo \
 	./$(DEPDIR)/nghttp2_outbound_item.Plo \
 	./$(DEPDIR)/nghttp2_pq.Plo \
 	./$(DEPDIR)/nghttp2_priority_spec.Plo \
-	./$(DEPDIR)/nghttp2_queue.Plo ./$(DEPDIR)/nghttp2_rcbuf.Plo \
-	./$(DEPDIR)/nghttp2_session.Plo ./$(DEPDIR)/nghttp2_stream.Plo \
-	./$(DEPDIR)/nghttp2_submit.Plo ./$(DEPDIR)/nghttp2_version.Plo \
+	./$(DEPDIR)/nghttp2_queue.Plo ./$(DEPDIR)/nghttp2_ratelim.Plo \
+	./$(DEPDIR)/nghttp2_rcbuf.Plo ./$(DEPDIR)/nghttp2_session.Plo \
+	./$(DEPDIR)/nghttp2_stream.Plo ./$(DEPDIR)/nghttp2_submit.Plo \
+	./$(DEPDIR)/nghttp2_time.Plo ./$(DEPDIR)/nghttp2_version.Plo \
 	./$(DEPDIR)/sfparse.Plo
 am__mv = mv -f
 COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
@@ -510,6 +512,8 @@ OBJECTS = nghttp2_pq.c nghttp2_map.c nghttp2_queue.c \
 	nghttp2_http.c \
 	nghttp2_rcbuf.c \
 	nghttp2_extpri.c \
+	nghttp2_ratelim.c \
+	nghttp2_time.c \
 	nghttp2_debug.c \
 	sfparse.c
 
@@ -528,6 +532,8 @@ HFILES = nghttp2_pq.h nghttp2_int.h nghttp2_map.h nghttp2_queue.h \
 	nghttp2_http.h \
 	nghttp2_rcbuf.h \
 	nghttp2_extpri.h \
+	nghttp2_ratelim.h \
+	nghttp2_time.h \
 	nghttp2_debug.h \
 	sfparse.h
 
@@ -633,10 +639,12 @@ distclean-compile:
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_pq.Plo@am__quote@ # am--include-marker
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_priority_spec.Plo@am__quote@ # am--include-marker
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_queue.Plo@am__quote@ # am--include-marker
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_ratelim.Plo@am__quote@ # am--include-marker
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_rcbuf.Plo@am__quote@ # am--include-marker
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_session.Plo@am__quote@ # am--include-marker
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_stream.Plo@am__quote@ # am--include-marker
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_submit.Plo@am__quote@ # am--include-marker
+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_time.Plo@am__quote@ # am--include-marker
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/nghttp2_version.Plo@am__quote@ # am--include-marker
 @AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/sfparse.Plo@am__quote@ # am--include-marker
 
@@ -916,10 +924,12 @@ distclean: distclean-recursive
 	-rm -f ./$(DEPDIR)/nghttp2_pq.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_priority_spec.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_queue.Plo
+	-rm -f ./$(DEPDIR)/nghttp2_ratelim.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_rcbuf.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_session.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_stream.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_submit.Plo
+	-rm -f ./$(DEPDIR)/nghttp2_time.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_version.Plo
 	-rm -f ./$(DEPDIR)/sfparse.Plo
 	-rm -f Makefile
@@ -985,10 +995,12 @@ maintainer-clean: maintainer-clean-recursive
 	-rm -f ./$(DEPDIR)/nghttp2_pq.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_priority_spec.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_queue.Plo
+	-rm -f ./$(DEPDIR)/nghttp2_ratelim.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_rcbuf.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_session.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_stream.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_submit.Plo
+	-rm -f ./$(DEPDIR)/nghttp2_time.Plo
 	-rm -f ./$(DEPDIR)/nghttp2_version.Plo
 	-rm -f ./$(DEPDIR)/sfparse.Plo
 	-rm -f Makefile
diff --git a/deps/nghttp2/lib/includes/nghttp2/nghttp2.h b/deps/nghttp2/lib/includes/nghttp2/nghttp2.h
index 65077dd51613c1..fa22081c517497 100644
--- a/deps/nghttp2/lib/includes/nghttp2/nghttp2.h
+++ b/deps/nghttp2/lib/includes/nghttp2/nghttp2.h
@@ -2756,6 +2756,23 @@ NGHTTP2_EXTERN void
 nghttp2_option_set_no_rfc9113_leading_and_trailing_ws_validation(
     nghttp2_option *option, int val);
 
+/**
+ * @function
+ *
+ * This function sets the rate limit for the incoming stream reset
+ * (RST_STREAM frame).  It is server use only.  It is a token-bucket
+ * based rate limiter.  |burst| specifies the number of tokens that is
+ * initially available.  The maximum number of tokens is capped to
+ * this value.  |rate| specifies the number of tokens that are
+ * regenerated per second.  An incoming RST_STREAM consumes one token.
+ * If there is no token available, GOAWAY is sent to tear down the
+ * connection.  |burst| and |rate| default to 1000 and 33
+ * respectively.
+ */
+NGHTTP2_EXTERN void
+nghttp2_option_set_stream_reset_rate_limit(nghttp2_option *option,
+                                           uint64_t burst, uint64_t rate);
+
 /**
  * @function
  *
diff --git a/deps/nghttp2/lib/includes/nghttp2/nghttp2ver.h b/deps/nghttp2/lib/includes/nghttp2/nghttp2ver.h
index fba310c7888d0c..f56954e7fded45 100644
--- a/deps/nghttp2/lib/includes/nghttp2/nghttp2ver.h
+++ b/deps/nghttp2/lib/includes/nghttp2/nghttp2ver.h
@@ -29,7 +29,7 @@
  * @macro
  * Version number of the nghttp2 library release
  */
-#define NGHTTP2_VERSION "1.55.1"
+#define NGHTTP2_VERSION "1.57.0"
 
 /**
  * @macro
@@ -37,6 +37,6 @@
  * release. This is a 24 bit number with 8 bits for major number, 8 bits
  * for minor and 8 bits for patch. Version 1.2.3 becomes 0x010203.
  */
-#define NGHTTP2_VERSION_NUM 0x013701
+#define NGHTTP2_VERSION_NUM 0x013900
 
 #endif /* NGHTTP2VER_H */
diff --git a/deps/nghttp2/lib/nghttp2_frame.c b/deps/nghttp2/lib/nghttp2_frame.c
index 35072c15fc18e6..77cb463df5441f 100644
--- a/deps/nghttp2/lib/nghttp2_frame.c
+++ b/deps/nghttp2/lib/nghttp2_frame.c
@@ -418,8 +418,8 @@ void nghttp2_frame_unpack_priority_spec(nghttp2_priority_spec *pri_spec,
   nghttp2_priority_spec_init(pri_spec, dep_stream_id, weight, exclusive);
 }
 
-int nghttp2_frame_unpack_headers_payload(nghttp2_headers *frame,
-                                         const uint8_t *payload) {
+void nghttp2_frame_unpack_headers_payload(nghttp2_headers *frame,
+                                          const uint8_t *payload) {
   if (frame->hd.flags & NGHTTP2_FLAG_PRIORITY) {
     nghttp2_frame_unpack_priority_spec(&frame->pri_spec, payload);
   } else {
@@ -428,11 +428,9 @@ int nghttp2_frame_unpack_headers_payload(nghttp2_headers *frame,
 
   frame->nva = NULL;
   frame->nvlen = 0;
-
-  return 0;
 }
 
-int nghttp2_frame_pack_priority(nghttp2_bufs *bufs, nghttp2_priority *frame) {
+void nghttp2_frame_pack_priority(nghttp2_bufs *bufs, nghttp2_priority *frame) {
   nghttp2_buf *buf;
 
   assert(bufs->head == bufs->cur);
@@ -448,8 +446,6 @@ int nghttp2_frame_pack_priority(nghttp2_bufs *bufs, nghttp2_priority *frame) {
   nghttp2_frame_pack_priority_spec(buf->last, &frame->pri_spec);
 
   buf->last += NGHTTP2_PRIORITY_SPECLEN;
-
-  return 0;
 }
 
 void nghttp2_frame_unpack_priority_payload(nghttp2_priority *frame,
@@ -457,8 +453,8 @@ void nghttp2_frame_unpack_priority_payload(nghttp2_priority *frame,
   nghttp2_frame_unpack_priority_spec(&frame->pri_spec, payload);
 }
 
-int nghttp2_frame_pack_rst_stream(nghttp2_bufs *bufs,
-                                  nghttp2_rst_stream *frame) {
+void nghttp2_frame_pack_rst_stream(nghttp2_bufs *bufs,
+                                   nghttp2_rst_stream *frame) {
   nghttp2_buf *buf;
 
   assert(bufs->head == bufs->cur);
@@ -473,8 +469,6 @@ int nghttp2_frame_pack_rst_stream(nghttp2_bufs *bufs,
 
   nghttp2_put_uint32be(buf->last, frame->error_code);
   buf->last += 4;
-
-  return 0;
 }
 
 void nghttp2_frame_unpack_rst_stream_payload(nghttp2_rst_stream *frame,
@@ -592,16 +586,15 @@ int nghttp2_frame_pack_push_promise(nghttp2_bufs *bufs,
   return frame_pack_headers_shared(bufs, &frame->hd);
 }
 
-int nghttp2_frame_unpack_push_promise_payload(nghttp2_push_promise *frame,
-                                              const uint8_t *payload) {
+void nghttp2_frame_unpack_push_promise_payload(nghttp2_push_promise *frame,
+                                               const uint8_t *payload) {
   frame->promised_stream_id =
       nghttp2_get_uint32(payload) & NGHTTP2_STREAM_ID_MASK;
   frame->nva = NULL;
   frame->nvlen = 0;
-  return 0;
 }
 
-int nghttp2_frame_pack_ping(nghttp2_bufs *bufs, nghttp2_ping *frame) {
+void nghttp2_frame_pack_ping(nghttp2_bufs *bufs, nghttp2_ping *frame) {
   nghttp2_buf *buf;
 
   assert(bufs->head == bufs->cur);
@@ -616,8 +609,6 @@ int nghttp2_frame_pack_ping(nghttp2_bufs *bufs, nghttp2_ping *frame) {
 
   buf->last =
       nghttp2_cpymem(buf->last, frame->opaque_data, sizeof(frame->opaque_data));
-
-  return 0;
 }
 
 void nghttp2_frame_unpack_ping_payload(nghttp2_ping *frame,
@@ -697,8 +688,8 @@ int nghttp2_frame_unpack_goaway_payload2(nghttp2_goaway *frame,
   return 0;
 }
 
-int nghttp2_frame_pack_window_update(nghttp2_bufs *bufs,
-                                     nghttp2_window_update *frame) {
+void nghttp2_frame_pack_window_update(nghttp2_bufs *bufs,
+                                      nghttp2_window_update *frame) {
   nghttp2_buf *buf;
 
   assert(bufs->head == bufs->cur);
@@ -713,8 +704,6 @@ int nghttp2_frame_pack_window_update(nghttp2_bufs *bufs,
 
   nghttp2_put_uint32be(buf->last, (uint32_t)frame->window_size_increment);
   buf->last += 4;
-
-  return 0;
 }
 
 void nghttp2_frame_unpack_window_update_payload(nghttp2_window_update *frame,
@@ -723,7 +712,7 @@ void nghttp2_frame_unpack_window_update_payload(nghttp2_window_update *frame,
       nghttp2_get_uint32(payload) & NGHTTP2_WINDOW_SIZE_INCREMENT_MASK;
 }
 
-int nghttp2_frame_pack_altsvc(nghttp2_bufs *bufs, nghttp2_extension *frame) {
+void nghttp2_frame_pack_altsvc(nghttp2_bufs *bufs, nghttp2_extension *frame) {
   int rv;
   nghttp2_buf *buf;
   nghttp2_ext_altsvc *altsvc;
@@ -752,8 +741,6 @@ int nghttp2_frame_pack_altsvc(nghttp2_bufs *bufs, nghttp2_extension *frame) {
   rv = nghttp2_bufs_add(bufs, altsvc->field_value, altsvc->field_value_len);
 
   assert(rv == 0);
-
-  return 0;
 }
 
 void nghttp2_frame_unpack_altsvc_payload(nghttp2_extension *frame,
@@ -901,8 +888,8 @@ int nghttp2_frame_unpack_origin_payload(nghttp2_extension *frame,
   return 0;
 }
 
-int nghttp2_frame_pack_priority_update(nghttp2_bufs *bufs,
-                                       nghttp2_extension *frame) {
+void nghttp2_frame_pack_priority_update(nghttp2_bufs *bufs,
+                                        nghttp2_extension *frame) {
   int rv;
   nghttp2_buf *buf;
   nghttp2_ext_priority_update *priority_update;
@@ -927,8 +914,6 @@ int nghttp2_frame_pack_priority_update(nghttp2_bufs *bufs,
                         priority_update->field_value_len);
 
   assert(rv == 0);
-
-  return 0;
 }
 
 void nghttp2_frame_unpack_priority_update_payload(nghttp2_extension *frame,
@@ -1186,14 +1171,14 @@ static void frame_set_pad(nghttp2_buf *buf, size_t padlen, int framehd_only) {
   buf->last += trail_padlen;
 }
 
-int nghttp2_frame_add_pad(nghttp2_bufs *bufs, nghttp2_frame_hd *hd,
-                          size_t padlen, int framehd_only) {
+void nghttp2_frame_add_pad(nghttp2_bufs *bufs, nghttp2_frame_hd *hd,
+                           size_t padlen, int framehd_only) {
   nghttp2_buf *buf;
 
   if (padlen == 0) {
     DEBUGF("send: padlen = 0, nothing to do\n");
 
-    return 0;
+    return;
   }
 
   /*
@@ -1226,6 +1211,4 @@ int nghttp2_frame_add_pad(nghttp2_bufs *bufs, nghttp2_frame_hd *hd,
   hd->flags |= NGHTTP2_FLAG_PADDED;
 
   DEBUGF("send: final payloadlen=%zu, padlen=%zu\n", hd->length, padlen);
-
-  return 0;
 }
diff --git a/deps/nghttp2/lib/nghttp2_frame.h b/deps/nghttp2/lib/nghttp2_frame.h
index 5f6152b74587ae..d58668806c432a 100644
--- a/deps/nghttp2/lib/nghttp2_frame.h
+++ b/deps/nghttp2/lib/nghttp2_frame.h
@@ -143,11 +143,9 @@ int nghttp2_frame_pack_headers(nghttp2_bufs *bufs, nghttp2_headers *frame,
  * Unpacks HEADERS frame byte sequence into |frame|.  This function
  * only unapcks bytes that come before name/value header block and
  * after possible Pad Length field.
- *
- * This function always succeeds and returns 0.
  */
-int nghttp2_frame_unpack_headers_payload(nghttp2_headers *frame,
-                                         const uint8_t *payload);
+void nghttp2_frame_unpack_headers_payload(nghttp2_headers *frame,
+                                          const uint8_t *payload);
 
 /*
  * Packs PRIORITY frame |frame| in wire format and store it in
@@ -155,10 +153,8 @@ int nghttp2_frame_unpack_headers_payload(nghttp2_headers *frame,
  *
  * The caller must make sure that nghttp2_bufs_reset(bufs) is called
  * before calling this function.
- *
- * This function always succeeds and returns 0.
  */
-int nghttp2_frame_pack_priority(nghttp2_bufs *bufs, nghttp2_priority *frame);
+void nghttp2_frame_pack_priority(nghttp2_bufs *bufs, nghttp2_priority *frame);
 
 /*
  * Unpacks PRIORITY wire format into |frame|.
@@ -172,11 +168,9 @@ void nghttp2_frame_unpack_priority_payload(nghttp2_priority *frame,
  *
  * The caller must make sure that nghttp2_bufs_reset(bufs) is called
  * before calling this function.
- *
- * This function always succeeds and returns 0.
  */
-int nghttp2_frame_pack_rst_stream(nghttp2_bufs *bufs,
-                                  nghttp2_rst_stream *frame);
+void nghttp2_frame_pack_rst_stream(nghttp2_bufs *bufs,
+                                   nghttp2_rst_stream *frame);
 
 /*
  * Unpacks RST_STREAM frame byte sequence into |frame|.
@@ -265,15 +259,9 @@ int nghttp2_frame_pack_push_promise(nghttp2_bufs *bufs,
  * Unpacks PUSH_PROMISE frame byte sequence into |frame|.  This
  * function only unapcks bytes that come before name/value header
  * block and after possible Pad Length field.
- *
- * This function returns 0 if it succeeds or one of the following
- * negative error codes:
- *
- * NGHTTP2_ERR_PROTO
- *     TODO END_HEADERS flag is not set
  */
-int nghttp2_frame_unpack_push_promise_payload(nghttp2_push_promise *frame,
-                                              const uint8_t *payload);
+void nghttp2_frame_unpack_push_promise_payload(nghttp2_push_promise *frame,
+                                               const uint8_t *payload);
 
 /*
  * Packs PING frame |frame| in wire format and store it in
@@ -281,10 +269,8 @@ int nghttp2_frame_unpack_push_promise_payload(nghttp2_push_promise *frame,
  *
  * The caller must make sure that nghttp2_bufs_reset(bufs) is called
  * before calling this function.
- *
- * This function always succeeds and returns 0.
  */
-int nghttp2_frame_pack_ping(nghttp2_bufs *bufs, nghttp2_ping *frame);
+void nghttp2_frame_pack_ping(nghttp2_bufs *bufs, nghttp2_ping *frame);
 
 /*
  * Unpacks PING wire format into |frame|.
@@ -343,11 +329,9 @@ int nghttp2_frame_unpack_goaway_payload2(nghttp2_goaway *frame,
  *
  * The caller must make sure that nghttp2_bufs_reset(bufs) is called
  * before calling this function.
- *
- * This function always succeeds and returns 0.
  */
-int nghttp2_frame_pack_window_update(nghttp2_bufs *bufs,
-                                     nghttp2_window_update *frame);
+void nghttp2_frame_pack_window_update(nghttp2_bufs *bufs,
+                                      nghttp2_window_update *frame);
 
 /*
  * Unpacks WINDOW_UPDATE frame byte sequence into |frame|.
@@ -361,17 +345,13 @@ void nghttp2_frame_unpack_window_update_payload(nghttp2_window_update *frame,
  *
  * The caller must make sure that nghttp2_bufs_reset(bufs) is called
  * before calling this function.
- *
- * This function always succeeds and returns 0.
  */
-int nghttp2_frame_pack_altsvc(nghttp2_bufs *bufs, nghttp2_extension *ext);
+void nghttp2_frame_pack_altsvc(nghttp2_bufs *bufs, nghttp2_extension *ext);
 
 /*
  * Unpacks ALTSVC wire format into |frame|.  The |payload| of
  * |payloadlen| bytes contains frame payload.  This function assumes
  * that frame->payload points to the nghttp2_ext_altsvc object.
- *
- * This function always succeeds and returns 0.
  */
 void nghttp2_frame_unpack_altsvc_payload(nghttp2_extension *frame,
                                          size_t origin_len, uint8_t *payload,
@@ -431,19 +411,15 @@ int nghttp2_frame_unpack_origin_payload(nghttp2_extension *frame,
  *
  * The caller must make sure that nghttp2_bufs_reset(bufs) is called
  * before calling this function.
- *
- * This function always succeeds and returns 0.
  */
-int nghttp2_frame_pack_priority_update(nghttp2_bufs *bufs,
-                                       nghttp2_extension *ext);
+void nghttp2_frame_pack_priority_update(nghttp2_bufs *bufs,
+                                        nghttp2_extension *ext);
 
 /*
  * Unpacks PRIORITY_UPDATE wire format into |frame|.  The |payload| of
  * |payloadlen| bytes contains frame payload.  This function assumes
  * that frame->payload points to the nghttp2_ext_priority_update
  * object.
- *
- * This function always succeeds and returns 0.
  */
 void nghttp2_frame_unpack_priority_update_payload(nghttp2_extension *frame,
                                                   uint8_t *payload,
@@ -654,16 +630,8 @@ int nghttp2_iv_check(const nghttp2_settings_entry *iv, size_t niv);
  * |padlen| including Pad Length field.  The |hd| is the frame header
  * for the serialized data.  This function fills zeros padding region
  * unless framehd_only is nonzero.
- *
- * This function returns 0 if it succeeds, or one of the following
- * negative error codes:
- *
- * NGHTTP2_ERR_NOMEM
- *     Out of memory.
- * NGHTTP2_ERR_FRAME_SIZE_ERROR
- *     The length of the resulting frame is too large.
  */
-int nghttp2_frame_add_pad(nghttp2_bufs *bufs, nghttp2_frame_hd *hd,
-                          size_t padlen, int framehd_only);
+void nghttp2_frame_add_pad(nghttp2_bufs *bufs, nghttp2_frame_hd *hd,
+                           size_t padlen, int framehd_only);
 
 #endif /* NGHTTP2_FRAME_H */
diff --git a/deps/nghttp2/lib/nghttp2_option.c b/deps/nghttp2/lib/nghttp2_option.c
index ee0cd0f0226db9..43d4e952291ba4 100644
--- a/deps/nghttp2/lib/nghttp2_option.c
+++ b/deps/nghttp2/lib/nghttp2_option.c
@@ -143,3 +143,10 @@ void nghttp2_option_set_no_rfc9113_leading_and_trailing_ws_validation(
       NGHTTP2_OPT_NO_RFC9113_LEADING_AND_TRAILING_WS_VALIDATION;
   option->no_rfc9113_leading_and_trailing_ws_validation = val;
 }
+
+void nghttp2_option_set_stream_reset_rate_limit(nghttp2_option *option,
+                                                uint64_t burst, uint64_t rate) {
+  option->opt_set_mask |= NGHTTP2_OPT_STREAM_RESET_RATE_LIMIT;
+  option->stream_reset_burst = burst;
+  option->stream_reset_rate = rate;
+}
diff --git a/deps/nghttp2/lib/nghttp2_option.h b/deps/nghttp2/lib/nghttp2_option.h
index b228a0754c989e..2259e1849d810f 100644
--- a/deps/nghttp2/lib/nghttp2_option.h
+++ b/deps/nghttp2/lib/nghttp2_option.h
@@ -70,12 +70,18 @@ typedef enum {
   NGHTTP2_OPT_MAX_SETTINGS = 1 << 12,
   NGHTTP2_OPT_SERVER_FALLBACK_RFC7540_PRIORITIES = 1 << 13,
   NGHTTP2_OPT_NO_RFC9113_LEADING_AND_TRAILING_WS_VALIDATION = 1 << 14,
+  NGHTTP2_OPT_STREAM_RESET_RATE_LIMIT = 1 << 15,
 } nghttp2_option_flag;
 
 /**
  * Struct to store option values for nghttp2_session.
  */
 struct nghttp2_option {
+  /**
+   * NGHTTP2_OPT_STREAM_RESET_RATE_LIMIT
+   */
+  uint64_t stream_reset_burst;
+  uint64_t stream_reset_rate;
   /**
    * NGHTTP2_OPT_MAX_SEND_HEADER_BLOCK_LENGTH
    */
diff --git a/deps/nghttp2/lib/nghttp2_ratelim.c b/deps/nghttp2/lib/nghttp2_ratelim.c
new file mode 100644
index 00000000000000..7011655b006f7c
--- /dev/null
+++ b/deps/nghttp2/lib/nghttp2_ratelim.c
@@ -0,0 +1,75 @@
+/*
+ * nghttp2 - HTTP/2 C Library
+ *
+ * Copyright (c) 2023 nghttp2 contributors
+ *
+ * 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 "nghttp2_ratelim.h"
+#include "nghttp2_helper.h"
+
+void nghttp2_ratelim_init(nghttp2_ratelim *rl, uint64_t burst, uint64_t rate) {
+  rl->val = rl->burst = burst;
+  rl->rate = rate;
+  rl->tstamp = 0;
+}
+
+void nghttp2_ratelim_update(nghttp2_ratelim *rl, uint64_t tstamp) {
+  uint64_t d, gain;
+
+  if (tstamp == rl->tstamp) {
+    return;
+  }
+
+  if (tstamp > rl->tstamp) {
+    d = tstamp - rl->tstamp;
+  } else {
+    d = 1;
+  }
+
+  rl->tstamp = tstamp;
+
+  if (UINT64_MAX / d < rl->rate) {
+    rl->val = rl->burst;
+
+    return;
+  }
+
+  gain = rl->rate * d;
+
+  if (UINT64_MAX - gain < rl->val) {
+    rl->val = rl->burst;
+
+    return;
+  }
+
+  rl->val += gain;
+  rl->val = nghttp2_min(rl->val, rl->burst);
+}
+
+int nghttp2_ratelim_drain(nghttp2_ratelim *rl, uint64_t n) {
+  if (rl->val < n) {
+    return -1;
+  }
+
+  rl->val -= n;
+
+  return 0;
+}
diff --git a/deps/nghttp2/lib/nghttp2_ratelim.h b/deps/nghttp2/lib/nghttp2_ratelim.h
new file mode 100644
index 00000000000000..866ed3f00aed4c
--- /dev/null
+++ b/deps/nghttp2/lib/nghttp2_ratelim.h
@@ -0,0 +1,57 @@
+/*
+ * nghttp2 - HTTP/2 C Library
+ *
+ * Copyright (c) 2023 nghttp2 contributors
+ *
+ * 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 NGHTTP2_RATELIM_H
+#define NGHTTP2_RATELIM_H
+
+#ifdef HAVE_CONFIG_H
+#  include <config.h>
+#endif /* HAVE_CONFIG_H */
+
+#include <nghttp2/nghttp2.h>
+
+typedef struct nghttp2_ratelim {
+  /* burst is the maximum value of val. */
+  uint64_t burst;
+  /* rate is the amount of value that is regenerated per 1 tstamp. */
+  uint64_t rate;
+  /* val is the amount of value available to drain. */
+  uint64_t val;
+  /* tstamp is the last timestamp in second resolution that is known
+     to this object. */
+  uint64_t tstamp;
+} nghttp2_ratelim;
+
+/* nghttp2_ratelim_init initializes |rl| with the given parameters. */
+void nghttp2_ratelim_init(nghttp2_ratelim *rl, uint64_t burst, uint64_t rate);
+
+/* nghttp2_ratelim_update updates rl->val with the current |tstamp|
+   given in second resolution. */
+void nghttp2_ratelim_update(nghttp2_ratelim *rl, uint64_t tstamp);
+
+/* nghttp2_ratelim_drain drains |n| from rl->val.  It returns 0 if it
+   succeeds, or -1. */
+int nghttp2_ratelim_drain(nghttp2_ratelim *rl, uint64_t n);
+
+#endif /* NGHTTP2_RATELIM_H */
diff --git a/deps/nghttp2/lib/nghttp2_session.c b/deps/nghttp2/lib/nghttp2_session.c
index 71858a39e07db7..ec5024d0f2168e 100644
--- a/deps/nghttp2/lib/nghttp2_session.c
+++ b/deps/nghttp2/lib/nghttp2_session.c
@@ -37,6 +37,7 @@
 #include "nghttp2_http.h"
 #include "nghttp2_pq.h"
 #include "nghttp2_extpri.h"
+#include "nghttp2_time.h"
 #include "nghttp2_debug.h"
 
 /*
@@ -475,6 +476,10 @@ static int session_new(nghttp2_session **session_ptr,
   (*session_ptr)->pending_enable_push = 1;
   (*session_ptr)->pending_no_rfc7540_priorities = UINT8_MAX;
 
+  nghttp2_ratelim_init(&(*session_ptr)->stream_reset_ratelim,
+                       NGHTTP2_DEFAULT_STREAM_RESET_BURST,
+                       NGHTTP2_DEFAULT_STREAM_RESET_RATE);
+
   if (server) {
     (*session_ptr)->server = 1;
   }
@@ -573,6 +578,12 @@ static int session_new(nghttp2_session **session_ptr,
       (*session_ptr)->opt_flags |=
           NGHTTP2_OPTMASK_NO_RFC9113_LEADING_AND_TRAILING_WS_VALIDATION;
     }
+
+    if (option->opt_set_mask & NGHTTP2_OPT_STREAM_RESET_RATE_LIMIT) {
+      nghttp2_ratelim_init(&(*session_ptr)->stream_reset_ratelim,
+                           option->stream_reset_burst,
+                           option->stream_reset_rate);
+    }
   }
 
   rv = nghttp2_hd_deflate_init2(&(*session_ptr)->hd_deflater,
@@ -937,8 +948,8 @@ static int session_ob_data_push(nghttp2_session *session,
   return 0;
 }
 
-static int session_ob_data_remove(nghttp2_session *session,
-                                  nghttp2_stream *stream) {
+static void session_ob_data_remove(nghttp2_session *session,
+                                   nghttp2_stream *stream) {
   uint32_t urgency;
 
   assert(stream->flags & NGHTTP2_STREAM_FLAG_NO_RFC7540_PRIORITIES);
@@ -951,8 +962,6 @@ static int session_ob_data_remove(nghttp2_session *session,
   nghttp2_pq_remove(&session->sched[urgency].ob_data, &stream->pq_entry);
 
   stream->queued = 0;
-
-  return 0;
 }
 
 static int session_attach_stream_item(nghttp2_session *session,
@@ -972,38 +981,28 @@ static int session_attach_stream_item(nghttp2_session *session,
   return session_ob_data_push(session, stream);
 }
 
-static int session_detach_stream_item(nghttp2_session *session,
-                                      nghttp2_stream *stream) {
-  int rv;
-
-  rv = nghttp2_stream_detach_item(stream);
-  if (rv != 0) {
-    return rv;
-  }
+static void session_detach_stream_item(nghttp2_session *session,
+                                       nghttp2_stream *stream) {
+  nghttp2_stream_detach_item(stream);
 
   if (!(stream->flags & NGHTTP2_STREAM_FLAG_NO_RFC7540_PRIORITIES) ||
       !stream->queued) {
-    return 0;
+    return;
   }
 
-  return session_ob_data_remove(session, stream);
+  session_ob_data_remove(session, stream);
 }
 
-static int session_defer_stream_item(nghttp2_session *session,
-                                     nghttp2_stream *stream, uint8_t flags) {
-  int rv;
-
-  rv = nghttp2_stream_defer_item(stream, flags);
-  if (rv != 0) {
-    return rv;
-  }
+static void session_defer_stream_item(nghttp2_session *session,
+                                      nghttp2_stream *stream, uint8_t flags) {
+  nghttp2_stream_defer_item(stream, flags);
 
   if (!(stream->flags & NGHTTP2_STREAM_FLAG_NO_RFC7540_PRIORITIES) ||
       !stream->queued) {
-    return 0;
+    return;
   }
 
-  return session_ob_data_remove(session, stream);
+  session_ob_data_remove(session, stream);
 }
 
 static int session_resume_deferred_stream_item(nghttp2_session *session,
@@ -1476,11 +1475,7 @@ int nghttp2_session_close_stream(nghttp2_session *session, int32_t stream_id,
 
     item = stream->item;
 
-    rv = session_detach_stream_item(session, stream);
-
-    if (rv != 0) {
-      return rv;
-    }
+    session_detach_stream_item(session, stream);
 
     /* If item is queued, it will be deleted when it is popped
        (nghttp2_session_prep_frame() will fail).  If session->aob.item
@@ -2221,7 +2216,6 @@ static ssize_t session_call_select_padding(nghttp2_session *session,
    frame->push_promise has also padlen in the same position. */
 static int session_headers_add_pad(nghttp2_session *session,
                                    nghttp2_frame *frame) {
-  int rv;
   ssize_t padded_payloadlen;
   nghttp2_active_outbound_item *aob;
   nghttp2_bufs *framebufs;
@@ -2246,11 +2240,7 @@ static int session_headers_add_pad(nghttp2_session *session,
   DEBUGF("send: padding selected: payloadlen=%zd, padlen=%zu\n",
          padded_payloadlen, padlen);
 
-  rv = nghttp2_frame_add_pad(framebufs, &frame->hd, padlen, 0);
-
-  if (rv != 0) {
-    return rv;
-  }
+  nghttp2_frame_add_pad(framebufs, &frame->hd, padlen, 0);
 
   frame->headers.padlen = padlen;
 
@@ -2333,13 +2323,7 @@ static int session_prep_frame(nghttp2_session *session,
       // Search stream including closed again.
       stream = nghttp2_session_get_stream_raw(session, frame->hd.stream_id);
       if (stream) {
-        int rv2;
-
-        rv2 = session_detach_stream_item(session, stream);
-
-        if (nghttp2_is_fatal(rv2)) {
-          return rv2;
-        }
+        session_detach_stream_item(session, stream);
       }
 
       return rv;
@@ -2354,12 +2338,8 @@ static int session_prep_frame(nghttp2_session *session,
          queue when session->remote_window_size > 0 */
       assert(session->remote_window_size > 0);
 
-      rv = session_defer_stream_item(session, stream,
-                                     NGHTTP2_STREAM_FLAG_DEFERRED_FLOW_CONTROL);
-
-      if (nghttp2_is_fatal(rv)) {
-        return rv;
-      }
+      session_defer_stream_item(session, stream,
+                                NGHTTP2_STREAM_FLAG_DEFERRED_FLOW_CONTROL);
 
       session->aob.item = NULL;
       active_outbound_item_reset(&session->aob, mem);
@@ -2373,23 +2353,15 @@ static int session_prep_frame(nghttp2_session *session,
       return rv;
     }
     if (rv == NGHTTP2_ERR_DEFERRED) {
-      rv = session_defer_stream_item(session, stream,
-                                     NGHTTP2_STREAM_FLAG_DEFERRED_USER);
-
-      if (nghttp2_is_fatal(rv)) {
-        return rv;
-      }
+      session_defer_stream_item(session, stream,
+                                NGHTTP2_STREAM_FLAG_DEFERRED_USER);
 
       session->aob.item = NULL;
       active_outbound_item_reset(&session->aob, mem);
       return NGHTTP2_ERR_DEFERRED;
     }
     if (rv == NGHTTP2_ERR_TEMPORAL_CALLBACK_FAILURE) {
-      rv = session_detach_stream_item(session, stream);
-
-      if (nghttp2_is_fatal(rv)) {
-        return rv;
-      }
+      session_detach_stream_item(session, stream);
 
       rv = nghttp2_session_add_rst_stream(session, frame->hd.stream_id,
                                           NGHTTP2_INTERNAL_ERROR);
@@ -2399,13 +2371,7 @@ static int session_prep_frame(nghttp2_session *session,
       return NGHTTP2_ERR_TEMPORAL_CALLBACK_FAILURE;
     }
     if (rv != 0) {
-      int rv2;
-
-      rv2 = session_detach_stream_item(session, stream);
-
-      if (nghttp2_is_fatal(rv2)) {
-        return rv2;
-      }
+      session_detach_stream_item(session, stream);
 
       return rv;
     }
@@ -2907,10 +2873,7 @@ static int session_after_frame_sent1(nghttp2_session *session) {
     }
 
     if (stream && aux_data->eof) {
-      rv = session_detach_stream_item(session, stream);
-      if (nghttp2_is_fatal(rv)) {
-        return rv;
-      }
+      session_detach_stream_item(session, stream);
 
       /* Call on_frame_send_callback after
          nghttp2_stream_detach_item(), so that application can issue
@@ -3143,17 +3106,8 @@ static int session_after_frame_sent1(nghttp2_session *session) {
 /*
  * Called after a frame is sent and session_after_frame_sent1.  This
  * function is responsible to reset session->aob.
- *
- * This function returns 0 if it succeeds, or one of the following
- * negative error codes:
- *
- * NGHTTP2_ERR_NOMEM
- *     Out of memory.
- * NGHTTP2_ERR_CALLBACK_FAILURE
- *     The callback function failed.
  */
-static int session_after_frame_sent2(nghttp2_session *session) {
-  int rv;
+static void session_after_frame_sent2(nghttp2_session *session) {
   nghttp2_active_outbound_item *aob = &session->aob;
   nghttp2_outbound_item *item = aob->item;
   nghttp2_bufs *framebufs = &aob->framebufs;
@@ -3176,13 +3130,13 @@ static int session_after_frame_sent2(nghttp2_session *session) {
         DEBUGF("send: next CONTINUATION frame, %zu bytes\n",
                nghttp2_buf_len(&framebufs->cur->buf));
 
-        return 0;
+        return;
       }
     }
 
     active_outbound_item_reset(&session->aob, mem);
 
-    return 0;
+    return;
   }
 
   /* DATA frame */
@@ -3196,7 +3150,7 @@ static int session_after_frame_sent2(nghttp2_session *session) {
   if (aux_data->eof) {
     active_outbound_item_reset(aob, mem);
 
-    return 0;
+    return;
   }
 
   /* Reset no_copy here because next write may not use this. */
@@ -3208,22 +3162,18 @@ static int session_after_frame_sent2(nghttp2_session *session) {
      further data. */
   if (nghttp2_session_predicate_data_send(session, stream) != 0) {
     if (stream) {
-      rv = session_detach_stream_item(session, stream);
-
-      if (nghttp2_is_fatal(rv)) {
-        return rv;
-      }
+      session_detach_stream_item(session, stream);
     }
 
     active_outbound_item_reset(aob, mem);
 
-    return 0;
+    return;
   }
 
   aob->item = NULL;
   active_outbound_item_reset(&session->aob, mem);
 
-  return 0;
+  return;
 }
 
 static int session_call_send_data(nghttp2_session *session,
@@ -3454,7 +3404,7 @@ static ssize_t nghttp2_session_mem_send_internal(nghttp2_session *session,
 
         /* Frame has completely sent */
         if (fast_cb) {
-          rv = session_after_frame_sent2(session);
+          session_after_frame_sent2(session);
         } else {
           rv = session_after_frame_sent1(session);
           if (rv < 0) {
@@ -3462,12 +3412,7 @@ static ssize_t nghttp2_session_mem_send_internal(nghttp2_session *session,
             assert(nghttp2_is_fatal(rv));
             return rv;
           }
-          rv = session_after_frame_sent2(session);
-        }
-        if (rv < 0) {
-          /* FATAL */
-          assert(nghttp2_is_fatal(rv));
-          return rv;
+          session_after_frame_sent2(session);
         }
         /* We have already adjusted the next state */
         break;
@@ -3506,11 +3451,7 @@ static ssize_t nghttp2_session_mem_send_internal(nghttp2_session *session,
       }
 
       if (rv == NGHTTP2_ERR_TEMPORAL_CALLBACK_FAILURE) {
-        rv = session_detach_stream_item(session, stream);
-
-        if (nghttp2_is_fatal(rv)) {
-          return rv;
-        }
+        session_detach_stream_item(session, stream);
 
         rv = nghttp2_session_add_rst_stream(session, frame->hd.stream_id,
                                             NGHTTP2_INTERNAL_ERROR);
@@ -3534,11 +3475,7 @@ static ssize_t nghttp2_session_mem_send_internal(nghttp2_session *session,
         assert(nghttp2_is_fatal(rv));
         return rv;
       }
-      rv = session_after_frame_sent2(session);
-      if (rv < 0) {
-        assert(nghttp2_is_fatal(rv));
-        return rv;
-      }
+      session_after_frame_sent2(session);
 
       /* We have already adjusted the next state */
 
@@ -4424,17 +4361,12 @@ int nghttp2_session_on_headers_received(nghttp2_session *session,
 }
 
 static int session_process_headers_frame(nghttp2_session *session) {
-  int rv;
   nghttp2_inbound_frame *iframe = &session->iframe;
   nghttp2_frame *frame = &iframe->frame;
   nghttp2_stream *stream;
 
-  rv = nghttp2_frame_unpack_headers_payload(&frame->headers, iframe->sbuf.pos);
+  nghttp2_frame_unpack_headers_payload(&frame->headers, iframe->sbuf.pos);
 
-  if (rv != 0) {
-    return nghttp2_session_terminate_session_with_reason(
-        session, NGHTTP2_PROTOCOL_ERROR, "HEADERS: could not unpack");
-  }
   stream = nghttp2_session_get_stream(session, frame->hd.stream_id);
   if (!stream) {
     frame->headers.cat = NGHTTP2_HCAT_REQUEST;
@@ -4528,6 +4460,23 @@ static int session_process_priority_frame(nghttp2_session *session) {
   return nghttp2_session_on_priority_received(session, frame);
 }
 
+static int session_update_stream_reset_ratelim(nghttp2_session *session) {
+  if (!session->server || (session->goaway_flags & NGHTTP2_GOAWAY_SUBMITTED)) {
+    return 0;
+  }
+
+  nghttp2_ratelim_update(&session->stream_reset_ratelim,
+                         nghttp2_time_now_sec());
+
+  if (nghttp2_ratelim_drain(&session->stream_reset_ratelim, 1) == 0) {
+    return 0;
+  }
+
+  return nghttp2_session_add_goaway(session, session->last_recv_stream_id,
+                                    NGHTTP2_INTERNAL_ERROR, NULL, 0,
+                                    NGHTTP2_GOAWAY_AUX_NONE);
+}
+
 int nghttp2_session_on_rst_stream_received(nghttp2_session *session,
                                            nghttp2_frame *frame) {
   int rv;
@@ -4557,7 +4506,8 @@ int nghttp2_session_on_rst_stream_received(nghttp2_session *session,
   if (nghttp2_is_fatal(rv)) {
     return rv;
   }
-  return 0;
+
+  return session_update_stream_reset_ratelim(session);
 }
 
 static int session_process_rst_stream_frame(nghttp2_session *session) {
@@ -5097,17 +5047,11 @@ int nghttp2_session_on_push_promise_received(nghttp2_session *session,
 }
 
 static int session_process_push_promise_frame(nghttp2_session *session) {
-  int rv;
   nghttp2_inbound_frame *iframe = &session->iframe;
   nghttp2_frame *frame = &iframe->frame;
 
-  rv = nghttp2_frame_unpack_push_promise_payload(&frame->push_promise,
-                                                 iframe->sbuf.pos);
-
-  if (rv != 0) {
-    return nghttp2_session_terminate_session_with_reason(
-        session, NGHTTP2_PROTOCOL_ERROR, "PUSH_PROMISE: could not unpack");
-  }
+  nghttp2_frame_unpack_push_promise_payload(&frame->push_promise,
+                                            iframe->sbuf.pos);
 
   return nghttp2_session_on_push_promise_received(session, frame);
 }
@@ -7519,6 +7463,9 @@ int nghttp2_session_add_goaway(nghttp2_session *session, int32_t last_stream_id,
     nghttp2_mem_free(mem, item);
     return rv;
   }
+
+  session->goaway_flags |= NGHTTP2_GOAWAY_SUBMITTED;
+
   return 0;
 }
 
@@ -7808,11 +7755,8 @@ int nghttp2_session_pack_data(nghttp2_session *session, nghttp2_bufs *bufs,
 
   nghttp2_frame_pack_frame_hd(buf->pos, &frame->hd);
 
-  rv = nghttp2_frame_add_pad(bufs, &frame->hd, frame->data.padlen,
-                             aux_data->no_copy);
-  if (rv != 0) {
-    return rv;
-  }
+  nghttp2_frame_add_pad(bufs, &frame->hd, frame->data.padlen,
+                        aux_data->no_copy);
 
   session_reschedule_stream(session, stream);
 
diff --git a/deps/nghttp2/lib/nghttp2_session.h b/deps/nghttp2/lib/nghttp2_session.h
index 34d2d58528a796..b119329a04da45 100644
--- a/deps/nghttp2/lib/nghttp2_session.h
+++ b/deps/nghttp2/lib/nghttp2_session.h
@@ -39,6 +39,7 @@
 #include "nghttp2_buf.h"
 #include "nghttp2_callbacks.h"
 #include "nghttp2_mem.h"
+#include "nghttp2_ratelim.h"
 
 /* The global variable for tests where we want to disable strict
    preface handling. */
@@ -105,6 +106,10 @@ typedef struct {
 /* The default value of maximum number of concurrent streams. */
 #define NGHTTP2_DEFAULT_MAX_CONCURRENT_STREAMS 0xffffffffu
 
+/* The default values for stream reset rate limiter. */
+#define NGHTTP2_DEFAULT_STREAM_RESET_BURST 1000
+#define NGHTTP2_DEFAULT_STREAM_RESET_RATE 33
+
 /* Internal state when receiving incoming frame */
 typedef enum {
   /* Receiving frame header */
@@ -178,7 +183,9 @@ typedef enum {
   /* Flag means GOAWAY was sent */
   NGHTTP2_GOAWAY_SENT = 0x4,
   /* Flag means GOAWAY was received */
-  NGHTTP2_GOAWAY_RECV = 0x8
+  NGHTTP2_GOAWAY_RECV = 0x8,
+  /* Flag means GOAWAY has been submitted at least once */
+  NGHTTP2_GOAWAY_SUBMITTED = 0x10
 } nghttp2_goaway_flag;
 
 /* nghttp2_inflight_settings stores the SETTINGS entries which local
@@ -235,6 +242,9 @@ struct nghttp2_session {
   /* Queue of In-flight SETTINGS values.  SETTINGS bearing ACK is not
      considered as in-flight. */
   nghttp2_inflight_settings *inflight_settings_head;
+  /* Stream reset rate limiter.  If receiving excessive amount of
+     stream resets, GOAWAY will be sent. */
+  nghttp2_ratelim stream_reset_ratelim;
   /* Sequential number across all streams to process streams in
      FIFO. */
   uint64_t stream_seq;
diff --git a/deps/nghttp2/lib/nghttp2_stream.c b/deps/nghttp2/lib/nghttp2_stream.c
index b3614a0b02761e..f1951f879d7927 100644
--- a/deps/nghttp2/lib/nghttp2_stream.c
+++ b/deps/nghttp2/lib/nghttp2_stream.c
@@ -465,14 +465,12 @@ static int stream_update_dep_on_attach_item(nghttp2_stream *stream) {
   return 0;
 }
 
-static int stream_update_dep_on_detach_item(nghttp2_stream *stream) {
+static void stream_update_dep_on_detach_item(nghttp2_stream *stream) {
   if (nghttp2_pq_empty(&stream->obq)) {
     stream_obq_remove(stream);
   }
 
   validate_tree(stream);
-
-  return 0;
 }
 
 int nghttp2_stream_attach_item(nghttp2_stream *stream,
@@ -503,20 +501,20 @@ int nghttp2_stream_attach_item(nghttp2_stream *stream,
   return 0;
 }
 
-int nghttp2_stream_detach_item(nghttp2_stream *stream) {
+void nghttp2_stream_detach_item(nghttp2_stream *stream) {
   DEBUGF("stream: stream=%d detach item=%p\n", stream->stream_id, stream->item);
 
   stream->item = NULL;
   stream->flags = (uint8_t)(stream->flags & ~NGHTTP2_STREAM_FLAG_DEFERRED_ALL);
 
   if (stream->flags & NGHTTP2_STREAM_FLAG_NO_RFC7540_PRIORITIES) {
-    return 0;
+    return;
   }
 
-  return stream_update_dep_on_detach_item(stream);
+  stream_update_dep_on_detach_item(stream);
 }
 
-int nghttp2_stream_defer_item(nghttp2_stream *stream, uint8_t flags) {
+void nghttp2_stream_defer_item(nghttp2_stream *stream, uint8_t flags) {
   assert(stream->item);
 
   DEBUGF("stream: stream=%d defer item=%p cause=%02x\n", stream->stream_id,
@@ -525,10 +523,10 @@ int nghttp2_stream_defer_item(nghttp2_stream *stream, uint8_t flags) {
   stream->flags |= flags;
 
   if (stream->flags & NGHTTP2_STREAM_FLAG_NO_RFC7540_PRIORITIES) {
-    return 0;
+    return;
   }
 
-  return stream_update_dep_on_detach_item(stream);
+  stream_update_dep_on_detach_item(stream);
 }
 
 int nghttp2_stream_resume_deferred_item(nghttp2_stream *stream, uint8_t flags) {
diff --git a/deps/nghttp2/lib/nghttp2_stream.h b/deps/nghttp2/lib/nghttp2_stream.h
index 7a8e4c6c1ddb08..71b9fb1140c932 100644
--- a/deps/nghttp2/lib/nghttp2_stream.h
+++ b/deps/nghttp2/lib/nghttp2_stream.h
@@ -258,14 +258,8 @@ void nghttp2_stream_shutdown(nghttp2_stream *stream, nghttp2_shut_flag flag);
  * more of NGHTTP2_STREAM_FLAG_DEFERRED_USER and
  * NGHTTP2_STREAM_FLAG_DEFERRED_FLOW_CONTROL.  The |flags| indicates
  * the reason of this action.
- *
- * This function returns 0 if it succeeds, or one of the following
- * negative error codes:
- *
- * NGHTTP2_ERR_NOMEM
- *     Out of memory
  */
-int nghttp2_stream_defer_item(nghttp2_stream *stream, uint8_t flags);
+void nghttp2_stream_defer_item(nghttp2_stream *stream, uint8_t flags);
 
 /*
  * Put back deferred data in this stream to active state.  The |flags|
@@ -379,14 +373,8 @@ int nghttp2_stream_attach_item(nghttp2_stream *stream,
 /*
  * Detaches |stream->item|.  This function does not free
  * |stream->item|.  The caller must free it.
- *
- * This function returns 0 if it succeeds, or one of the following
- * negative error codes:
- *
- * NGHTTP2_ERR_NOMEM
- *     Out of memory
  */
-int nghttp2_stream_detach_item(nghttp2_stream *stream);
+void nghttp2_stream_detach_item(nghttp2_stream *stream);
 
 /*
  * Makes the |stream| depend on the |dep_stream|.  This dependency is
diff --git a/deps/nghttp2/lib/nghttp2_time.c b/deps/nghttp2/lib/nghttp2_time.c
new file mode 100644
index 00000000000000..2a5f1a6ff524df
--- /dev/null
+++ b/deps/nghttp2/lib/nghttp2_time.c
@@ -0,0 +1,62 @@
+/*
+ * nghttp2 - HTTP/2 C Library
+ *
+ * Copyright (c) 2023 nghttp2 contributors
+ *
+ * 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 "nghttp2_time.h"
+
+#ifdef HAVE_TIME_H
+#  include <time.h>
+#endif /* HAVE_TIME_H */
+
+#ifdef HAVE_SYSINFOAPI_H
+#  include <sysinfoapi.h>
+#endif /* HAVE_SYSINFOAPI_H */
+
+#ifndef HAVE_GETTICKCOUNT64
+static uint64_t time_now_sec(void) {
+  time_t t = time(NULL);
+
+  if (t == -1) {
+    return 0;
+  }
+
+  return (uint64_t)t;
+}
+#endif /* HAVE_GETTICKCOUNT64 */
+
+#ifdef HAVE_CLOCK_GETTIME
+uint64_t nghttp2_time_now_sec(void) {
+  struct timespec tp;
+  int rv = clock_gettime(CLOCK_MONOTONIC, &tp);
+
+  if (rv == -1) {
+    return time_now_sec();
+  }
+
+  return (uint64_t)tp.tv_sec;
+}
+#elif defined(HAVE_GETTICKCOUNT64)
+uint64_t nghttp2_time_now_sec(void) { return GetTickCount64() / 1000; }
+#else  /* !HAVE_CLOCK_GETTIME && !HAVE_GETTICKCOUNT64 */
+uint64_t nghttp2_time_now_sec(void) { return time_now_sec(); }
+#endif /* !HAVE_CLOCK_GETTIME && !HAVE_GETTICKCOUNT64 */
diff --git a/deps/nghttp2/lib/nghttp2_time.h b/deps/nghttp2/lib/nghttp2_time.h
new file mode 100644
index 00000000000000..03c0bbe944ee3b
--- /dev/null
+++ b/deps/nghttp2/lib/nghttp2_time.h
@@ -0,0 +1,38 @@
+/*
+ * nghttp2 - HTTP/2 C Library
+ *
+ * Copyright (c) 2023 nghttp2 contributors
+ *
+ * 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 NGHTTP2_TIME_H
+#define NGHTTP2_TIME_H
+
+#ifdef HAVE_CONFIG_H
+#  include <config.h>
+#endif /* HAVE_CONFIG_H */
+
+#include <nghttp2/nghttp2.h>
+
+/* nghttp2_time_now_sec returns seconds from implementation-specific
+   timepoint.  If it is unable to get seconds, it returns 0. */
+uint64_t nghttp2_time_now_sec(void);
+
+#endif /* NGHTTP2_TIME_H */
diff --git a/deps/nghttp2/nghttp2.gyp b/deps/nghttp2/nghttp2.gyp
index 8a3ee0dbc4e2ee..87909c5f296a2c 100644
--- a/deps/nghttp2/nghttp2.gyp
+++ b/deps/nghttp2/nghttp2.gyp
@@ -19,10 +19,12 @@
       'lib/nghttp2_pq.c',
       'lib/nghttp2_priority_spec.c',
       'lib/nghttp2_queue.c',
+      'lib/nghttp2_ratelim.c',
       'lib/nghttp2_rcbuf.c',
       'lib/nghttp2_session.c',
       'lib/nghttp2_stream.c',
       'lib/nghttp2_submit.c',
+      'lib/nghttp2_time.c',
       'lib/nghttp2_version.c',
       'lib/sfparse.c',
     ]
diff --git a/deps/ngtcp2/ngtcp2.gyp b/deps/ngtcp2/ngtcp2.gyp
index a47a791610e86a..e53b7f61ea387b 100644
--- a/deps/ngtcp2/ngtcp2.gyp
+++ b/deps/ngtcp2/ngtcp2.gyp
@@ -112,7 +112,7 @@
             },
           },
         }],
-        ['OS=="linux"', {
+        ['OS=="linux" or OS=="android"', {
           'defines': [
             'HAVE_ARPA_INET_H',
             'HAVE_NETINET_IN_H',
@@ -162,7 +162,7 @@
             },
           },
         }],
-        ['OS=="linux"', {
+        ['OS=="linux" or OS=="android"', {
           'defines': [
             'HAVE_ARPA_INET_H',
             'HAVE_NETINET_IN_H',
diff --git a/deps/npm/docs/content/commands/npm-audit.md b/deps/npm/docs/content/commands/npm-audit.md
index 62f93448c2457b..c36683cf10e073 100644
--- a/deps/npm/docs/content/commands/npm-audit.md
+++ b/deps/npm/docs/content/commands/npm-audit.md
@@ -32,6 +32,13 @@ vulnerability is found. It may be useful in CI environments to include the
 will cause the command to fail. This option does not filter the report
 output, it simply changes the command's failure threshold.
 
+### Package lock
+
+By default npm requires a package-lock or shrinkwrap in order to run the
+audit.  You can bypass the package lock with `--no-package-lock` but be
+aware the results may be different with every run, since npm will
+re-build the dependency tree each time.
+
 ### Audit Signatures
 
 To ensure the integrity of packages you download from the public npm registry, or any registry that supports signatures, you can verify the registry signatures of downloaded packages using the npm CLI.
@@ -321,6 +328,16 @@ For `list` this means the output will be based on the tree described by the
 
 
 
+#### `package-lock`
+
+* Default: true
+* Type: Boolean
+
+If set to false, then ignore `package-lock.json` files when installing. This
+will also prevent _writing_ `package-lock.json` if `save` is true.
+
+
+
 #### `omit`
 
 * Default: 'dev' if the `NODE_ENV` environment variable is set to
@@ -341,6 +358,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `foreground-scripts`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-ci.md b/deps/npm/docs/content/commands/npm-ci.md
index 2a1f39a00f9c81..57f6555975b260 100644
--- a/deps/npm/docs/content/commands/npm-ci.md
+++ b/deps/npm/docs/content/commands/npm-ci.md
@@ -132,6 +132,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `strict-peer-deps`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-dedupe.md b/deps/npm/docs/content/commands/npm-dedupe.md
index 592d76973cff08..1e8a4bc5d0262a 100644
--- a/deps/npm/docs/content/commands/npm-dedupe.md
+++ b/deps/npm/docs/content/commands/npm-dedupe.md
@@ -168,6 +168,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `ignore-scripts`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-doctor.md b/deps/npm/docs/content/commands/npm-doctor.md
index e72d273ac8172e..b36ec3883be03a 100644
--- a/deps/npm/docs/content/commands/npm-doctor.md
+++ b/deps/npm/docs/content/commands/npm-doctor.md
@@ -1,7 +1,7 @@
 ---
 title: npm-doctor
 section: 1
-description: Check your npm environment
+description: Check the health of your npm environment
 ---
 
 ### Synopsis
diff --git a/deps/npm/docs/content/commands/npm-find-dupes.md b/deps/npm/docs/content/commands/npm-find-dupes.md
index b326b9236153d1..6710760471824e 100644
--- a/deps/npm/docs/content/commands/npm-find-dupes.md
+++ b/deps/npm/docs/content/commands/npm-find-dupes.md
@@ -108,6 +108,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `ignore-scripts`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-init.md b/deps/npm/docs/content/commands/npm-init.md
index b0efecdb7e6798..c4b39e6397019c 100644
--- a/deps/npm/docs/content/commands/npm-init.md
+++ b/deps/npm/docs/content/commands/npm-init.md
@@ -156,6 +156,56 @@ dot to represent the current directory in that context, e.g: `react-app .`:
 
 ### Configuration
 
+#### `init-author-name`
+
+* Default: ""
+* Type: String
+
+The value `npm init` should use by default for the package author's name.
+
+
+
+#### `init-author-url`
+
+* Default: ""
+* Type: "" or URL
+
+The value `npm init` should use by default for the package author's
+homepage.
+
+
+
+#### `init-license`
+
+* Default: "ISC"
+* Type: String
+
+The value `npm init` should use by default for the package license.
+
+
+
+#### `init-module`
+
+* Default: "~/.npm-init.js"
+* Type: Path
+
+A module that will be loaded by the `npm init` command. See the
+documentation for the
+[init-package-json](https://github.com/npm/init-package-json) module for
+more information, or [npm init](/commands/npm-init).
+
+
+
+#### `init-version`
+
+* Default: "1.0.0"
+* Type: SemVer string
+
+The value that `npm init` should use by default for the package version
+number, if not already set in package.json.
+
+
+
 #### `yes`
 
 * Default: null
diff --git a/deps/npm/docs/content/commands/npm-install-ci-test.md b/deps/npm/docs/content/commands/npm-install-ci-test.md
index b38f4917708326..f01b9979635deb 100644
--- a/deps/npm/docs/content/commands/npm-install-ci-test.md
+++ b/deps/npm/docs/content/commands/npm-install-ci-test.md
@@ -78,6 +78,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `strict-peer-deps`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-install-test.md b/deps/npm/docs/content/commands/npm-install-test.md
index 443ccd670daa1f..3b94ea27763f8f 100644
--- a/deps/npm/docs/content/commands/npm-install-test.md
+++ b/deps/npm/docs/content/commands/npm-install-test.md
@@ -119,6 +119,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `strict-peer-deps`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-install.md b/deps/npm/docs/content/commands/npm-install.md
index 6be022c8f2340c..738ca3372c8e9f 100644
--- a/deps/npm/docs/content/commands/npm-install.md
+++ b/deps/npm/docs/content/commands/npm-install.md
@@ -509,6 +509,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `strict-peer-deps`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-link.md b/deps/npm/docs/content/commands/npm-link.md
index 607dc60b190dc5..34b893e471afa1 100644
--- a/deps/npm/docs/content/commands/npm-link.md
+++ b/deps/npm/docs/content/commands/npm-link.md
@@ -241,6 +241,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `ignore-scripts`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-ls.md b/deps/npm/docs/content/commands/npm-ls.md
index c7b8f674862a9c..791e5f88b082bb 100644
--- a/deps/npm/docs/content/commands/npm-ls.md
+++ b/deps/npm/docs/content/commands/npm-ls.md
@@ -27,7 +27,7 @@ packages will *also* show the paths to the specified packages.  For
 example, running `npm ls promzard` in npm's source tree will show:
 
 ```bash
-npm@10.1.0 /path/to/npm
+npm@10.2.0 /path/to/npm
 └─┬ init-package-json@0.0.4
   └── promzard@0.1.5
 ```
@@ -165,6 +165,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `link`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-prune.md b/deps/npm/docs/content/commands/npm-prune.md
index 071258e78471ba..ec6aa1ee454d64 100644
--- a/deps/npm/docs/content/commands/npm-prune.md
+++ b/deps/npm/docs/content/commands/npm-prune.md
@@ -55,6 +55,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `dry-run`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm-query.md b/deps/npm/docs/content/commands/npm-query.md
index ec9cc2c5752f92..196d7d6559acf2 100644
--- a/deps/npm/docs/content/commands/npm-query.md
+++ b/deps/npm/docs/content/commands/npm-query.md
@@ -135,6 +135,19 @@ npm query ":type(git)" | jq 'map(.name)' | xargs -I {} npm why {}
   },
   ...
 ```
+### Package lock only mode
+
+If package-lock-only is enabled, only the information in the package
+lock (or shrinkwrap) is loaded.  This means that information from the
+package.json files of your dependencies will not be included in the
+result set (e.g. description, homepage, engines).
+
+### Package lock only mode
+
+If package-lock-only is enabled, only the information in the package
+lock (or shrinkwrap) is loaded.  This means that information from the
+package.json files of your dependencies will not be included in the
+result set (e.g. description, homepage, engines).
 
 ### Configuration
 
@@ -206,6 +219,22 @@ all workspaces via the `workspaces` flag, will cause npm to operate only on
 the specified workspaces, and not on the root project.
 
 This value is not exported to the environment for child processes.
+
+#### `package-lock-only`
+
+* Default: false
+* Type: Boolean
+
+If set to true, the current operation will only use the `package-lock.json`,
+ignoring `node_modules`.
+
+For `update` this means only the `package-lock.json` will be updated,
+instead of checking `node_modules` and downloading dependencies.
+
+For `list` this means the output will be based on the tree described by the
+`package-lock.json`, rather than the contents of `node_modules`.
+
+
 ## See Also
 
 * [dependency selectors](/using-npm/dependency-selectors)
diff --git a/deps/npm/docs/content/commands/npm-sbom.md b/deps/npm/docs/content/commands/npm-sbom.md
new file mode 100644
index 00000000000000..ee0d60c6fde790
--- /dev/null
+++ b/deps/npm/docs/content/commands/npm-sbom.md
@@ -0,0 +1,318 @@
+---
+title: npm-sbom
+section: 1
+description: Generate a Software Bill of Materials (SBOM)
+---
+
+### Synopsis
+
+```bash
+npm sbom
+```
+
+### Description
+
+The `npm sbom` command generates a Software Bill of Materials (SBOM) listing the
+dependencies for the current project. SBOMs can be generated in either
+[SPDX](https://spdx.dev/) or [CycloneDX](https://cyclonedx.org/) format.
+
+### Example CycloneDX SBOM
+
+```json
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:09f55116-97e1-49cf-b3b8-44d0207e7730",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2023-09-01T00:00:00.001Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.1.0"
+      }
+    ],
+    "component": {
+      "bom-ref": "simple@1.0.0",
+      "type": "library",
+      "name": "simple",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "John Doe",
+      "description": "simple react app",
+      "purl": "pkg:npm/simple@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [],
+      "licenses": [
+        {
+          "license": {
+            "id": "MIT"
+          }
+        }
+      ]
+    }
+  },
+  "components": [
+    {
+      "bom-ref": "lodash@4.17.21",
+      "type": "library",
+      "name": "lodash",
+      "version": "4.17.21",
+      "scope": "required",
+      "author": "John-David Dalton",
+      "description": "Lodash modular utilities.",
+      "purl": "pkg:npm/lodash@4.17.21",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": "node_modules/lodash"
+        }
+      ],
+      "externalReferences": [
+        {
+          "type": "distribution",
+          "url": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz"
+        },
+        {
+          "type": "vcs",
+          "url": "git+https://github.com/lodash/lodash.git"
+        },
+        {
+          "type": "website",
+          "url": "https://lodash.com/"
+        },
+        {
+          "type": "issue-tracker",
+          "url": "https://github.com/lodash/lodash/issues"
+        }
+      ],
+      "hashes": [
+        {
+          "alg": "SHA-512",
+          "content": "bf690311ee7b95e713ba568322e3533f2dd1cb880b189e99d4edef13592b81764daec43e2c54c61d5c558dc5cfb35ecb85b65519e74026ff17675b6f8f916f4a"
+        }
+      ],
+      "licenses": [
+        {
+          "license": {
+            "id": "MIT"
+          }
+        }
+      ]
+    }
+  ],
+  "dependencies": [
+    {
+      "ref": "simple@1.0.0",
+      "dependsOn": [
+        "lodash@4.17.21"
+      ]
+    },
+    {
+      "ref": "lodash@4.17.21",
+      "dependsOn": []
+    }
+  ]
+}
+```
+
+### Example SPDX SBOM
+
+```json
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "simple@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/simple-1.0.0-bf81090e-8bbc-459d-bec9-abeb794e096a",
+  "creationInfo": {
+    "created": "2023-09-01T00:00:00.001Z",
+    "creators": [
+      "Tool: npm/cli-10.1.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-simple-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "simple",
+      "SPDXID": "SPDXRef-Package-simple-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "description": "simple react app",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "MIT",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/simple@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "lodash",
+      "SPDXID": "SPDXRef-Package-lodash-4.17.21",
+      "versionInfo": "4.17.21",
+      "packageFileName": "node_modules/lodash",
+      "description": "Lodash modular utilities.",
+      "downloadLocation": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
+      "filesAnalyzed": false,
+      "homepage": "https://lodash.com/",
+      "licenseDeclared": "MIT",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/lodash@4.17.21"
+        }
+      ],
+      "checksums": [
+        {
+          "algorithm": "SHA512",
+          "checksumValue": "bf690311ee7b95e713ba568322e3533f2dd1cb880b189e99d4edef13592b81764daec43e2c54c61d5c558dc5cfb35ecb85b65519e74026ff17675b6f8f916f4a"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-simple-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-simple-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-lodash-4.17.21",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+```
+
+### Package lock only mode
+
+If package-lock-only is enabled, only the information in the package
+lock (or shrinkwrap) is loaded.  This means that information from the
+package.json files of your dependencies will not be included in the
+result set (e.g. description, homepage, engines).
+
+### Configuration
+
+#### `omit`
+
+* Default: 'dev' if the `NODE_ENV` environment variable is set to
+  'production', otherwise empty.
+* Type: "dev", "optional", or "peer" (can be set multiple times)
+
+Dependency types to omit from the installation tree on disk.
+
+Note that these dependencies _are_ still resolved and added to the
+`package-lock.json` or `npm-shrinkwrap.json` file. They are just not
+physically installed on disk.
+
+If a package type appears in both the `--include` and `--omit` lists, then
+it will be included.
+
+If the resulting omit list includes `'dev'`, then the `NODE_ENV` environment
+variable will be set to `'production'` for all lifecycle scripts.
+
+
+
+#### `package-lock-only`
+
+* Default: false
+* Type: Boolean
+
+If set to true, the current operation will only use the `package-lock.json`,
+ignoring `node_modules`.
+
+For `update` this means only the `package-lock.json` will be updated,
+instead of checking `node_modules` and downloading dependencies.
+
+For `list` this means the output will be based on the tree described by the
+`package-lock.json`, rather than the contents of `node_modules`.
+
+
+
+#### `sbom-format`
+
+* Default: null
+* Type: "cyclonedx" or "spdx"
+
+SBOM format to use when generating SBOMs.
+
+
+
+#### `sbom-type`
+
+* Default: "library"
+* Type: "library", "application", or "framework"
+
+The type of package described by the generated SBOM. For SPDX, this is the
+value for the `primaryPackagePurpose` fieled. For CycloneDX, this is the
+value for the `type` field.
+
+
+
+#### `workspace`
+
+* Default:
+* Type: String (can be set multiple times)
+
+Enable running a command in the context of the configured workspaces of the
+current project while filtering by running only the workspaces defined by
+this configuration option.
+
+Valid values for the `workspace` config are either:
+
+* Workspace names
+* Path to a workspace directory
+* Path to a parent workspace directory (will result in selecting all
+  workspaces within that folder)
+
+When set for the `npm init` command, this may be set to the folder of a
+workspace which does not yet exist, to create the folder and set it up as a
+brand new workspace within the project.
+
+This value is not exported to the environment for child processes.
+
+#### `workspaces`
+
+* Default: null
+* Type: null or Boolean
+
+Set to true to run the command in the context of **all** configured
+workspaces.
+
+Explicitly setting this to false will cause commands like `install` to
+ignore workspaces altogether. When not set explicitly:
+
+- Commands that operate on the `node_modules` tree (install, update, etc.)
+will link workspaces into the `node_modules` folder. - Commands that do
+other things (test, exec, publish, etc.) will operate on the root project,
+_unless_ one or more workspaces are specified in the `workspace` config.
+
+This value is not exported to the environment for child processes.
+## See Also
+
+* [package spec](/using-npm/package-spec)
+* [dependency selectors](/using-npm/dependency-selectors)
+* [package.json](/configuring-npm/package-json)
+* [workspaces](/using-npm/workspaces)
diff --git a/deps/npm/docs/content/commands/npm-update.md b/deps/npm/docs/content/commands/npm-update.md
index 7a8adb62bbb27f..ea0bcdd00d9fbd 100644
--- a/deps/npm/docs/content/commands/npm-update.md
+++ b/deps/npm/docs/content/commands/npm-update.md
@@ -247,6 +247,20 @@ variable will be set to `'production'` for all lifecycle scripts.
 
 
 
+#### `include`
+
+* Default:
+* Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+
+Option that allows for defining which types of dependencies to install.
+
+This is the inverse of `--omit=<type>`.
+
+Dependency types specified in `--include` will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.
+
+
+
 #### `strict-peer-deps`
 
 * Default: false
diff --git a/deps/npm/docs/content/commands/npm.md b/deps/npm/docs/content/commands/npm.md
index e7ad76c74cf65e..0a5b88d7083c8a 100644
--- a/deps/npm/docs/content/commands/npm.md
+++ b/deps/npm/docs/content/commands/npm.md
@@ -14,7 +14,7 @@ Note: This command is unaware of workspaces.
 
 ### Version
 
-10.1.0
+10.2.0
 
 ### Description
 
diff --git a/deps/npm/docs/content/using-npm/config.md b/deps/npm/docs/content/using-npm/config.md
index 253cd3dffd1d1d..80969ee23e5355 100644
--- a/deps/npm/docs/content/using-npm/config.md
+++ b/deps/npm/docs/content/using-npm/config.md
@@ -1358,6 +1358,26 @@ or `--save-optional` are true.
 
 
 
+#### `sbom-format`
+
+* Default: null
+* Type: "cyclonedx" or "spdx"
+
+SBOM format to use when generating SBOMs.
+
+
+
+#### `sbom-type`
+
+* Default: "library"
+* Type: "library", "application", or "framework"
+
+The type of package described by the generated SBOM. For SPDX, this is the
+value for the `primaryPackagePurpose` fieled. For CycloneDX, this is the
+value for the `type` field.
+
+
+
 #### `scope`
 
 * Default: the scope of the current project, if any, or ""
diff --git a/deps/npm/docs/output/commands/npm-audit.html b/deps/npm/docs/output/commands/npm-audit.html
index eda45d9bd23db3..8ac632d7336589 100644
--- a/deps/npm/docs/output/commands/npm-audit.html
+++ b/deps/npm/docs/output/commands/npm-audit.html
@@ -142,7 +142,7 @@ <h1 id="npm-audit">npm-audit</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#audit-signatures">Audit Signatures</a></li><li><a href="#audit-endpoints">Audit Endpoints</a></li><ul><li><a href="#bulk-advisory-endpoint">Bulk Advisory Endpoint</a></li><li><a href="#quick-audit-endpoint">Quick Audit Endpoint</a></li><li><a href="#scrubbing">Scrubbing</a></li><li><a href="#calculating-meta-vulnerabilities-and-remediations">Calculating Meta-Vulnerabilities and Remediations</a></li></ul><li><a href="#exit-code">Exit Code</a></li><li><a href="#examples">Examples</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#audit-level"><code>audit-level</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#force"><code>force</code></a></li><li><a href="#json"><code>json</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#package-lock">Package lock</a></li><li><a href="#audit-signatures">Audit Signatures</a></li><li><a href="#audit-endpoints">Audit Endpoints</a></li><ul><li><a href="#bulk-advisory-endpoint">Bulk Advisory Endpoint</a></li><li><a href="#quick-audit-endpoint">Quick Audit Endpoint</a></li><li><a href="#scrubbing">Scrubbing</a></li><li><a href="#calculating-meta-vulnerabilities-and-remediations">Calculating Meta-Vulnerabilities and Remediations</a></li></ul><li><a href="#exit-code">Exit Code</a></li><li><a href="#examples">Examples</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#audit-level"><code>audit-level</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#force"><code>force</code></a></li><li><a href="#json"><code>json</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#package-lock2"><code>package-lock</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -164,6 +164,11 @@ <h3 id="description">Description</h3>
 <code>--audit-level</code> parameter to specify the minimum vulnerability level that
 will cause the command to fail. This option does not filter the report
 output, it simply changes the command's failure threshold.</p>
+<h3 id="package-lock">Package lock</h3>
+<p>By default npm requires a package-lock or shrinkwrap in order to run the
+audit.  You can bypass the package lock with <code>--no-package-lock</code> but be
+aware the results may be different with every run, since npm will
+re-build the dependency tree each time.</p>
 <h3 id="audit-signatures">Audit Signatures</h3>
 <p>To ensure the integrity of packages you download from the public npm registry, or any registry that supports signatures, you can verify the registry signatures of downloaded packages using the npm CLI.</p>
 <p>Registry signatures can be verified using the following <code>audit</code> command:</p>
@@ -373,6 +378,13 @@ <h4 id="package-lock-only"><code>package-lock-only</code></h4>
 instead of checking <code>node_modules</code> and downloading dependencies.</p>
 <p>For <code>list</code> this means the output will be based on the tree described by the
 <code>package-lock.json</code>, rather than the contents of <code>node_modules</code>.</p>
+<h4 id="package-lock2"><code>package-lock</code></h4>
+<ul>
+<li>Default: true</li>
+<li>Type: Boolean</li>
+</ul>
+<p>If set to false, then ignore <code>package-lock.json</code> files when installing. This
+will also prevent <em>writing</em> <code>package-lock.json</code> if <code>save</code> is true.</p>
 <h4 id="omit"><code>omit</code></h4>
 <ul>
 <li>Default: 'dev' if the <code>NODE_ENV</code> environment variable is set to
@@ -387,6 +399,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="foreground-scripts"><code>foreground-scripts</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-ci.html b/deps/npm/docs/output/commands/npm-ci.html
index 9fed910b2eba08..2349e46dd1c608 100644
--- a/deps/npm/docs/output/commands/npm-ci.html
+++ b/deps/npm/docs/output/commands/npm-ci.html
@@ -142,7 +142,7 @@ <h1 id="npm-ci">npm-ci</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#example">Example</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#example">Example</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -241,6 +241,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="strict-peer-deps"><code>strict-peer-deps</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-dedupe.html b/deps/npm/docs/output/commands/npm-dedupe.html
index 46db8279fb0412..625fe39bbd36c7 100644
--- a/deps/npm/docs/output/commands/npm-dedupe.html
+++ b/deps/npm/docs/output/commands/npm-dedupe.html
@@ -142,7 +142,7 @@ <h1 id="npm-dedupe">npm-dedupe</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -263,6 +263,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="ignore-scripts"><code>ignore-scripts</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-doctor.html b/deps/npm/docs/output/commands/npm-doctor.html
index 7635c0188a2a09..d63f33389af97e 100644
--- a/deps/npm/docs/output/commands/npm-doctor.html
+++ b/deps/npm/docs/output/commands/npm-doctor.html
@@ -137,7 +137,7 @@
 <section id="content">
 <header class="title">
 <h1 id="npm-doctor">npm-doctor</h1>
-<span class="description">Check your npm environment</span>
+<span class="description">Check the health of your npm environment</span>
 </header>
 
 <section id="table_of_contents">
diff --git a/deps/npm/docs/output/commands/npm-find-dupes.html b/deps/npm/docs/output/commands/npm-find-dupes.html
index 725f197e8503d4..86546d345d46cc 100644
--- a/deps/npm/docs/output/commands/npm-find-dupes.html
+++ b/deps/npm/docs/output/commands/npm-find-dupes.html
@@ -142,7 +142,7 @@ <h1 id="npm-find-dupes">npm-find-dupes</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -220,6 +220,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="ignore-scripts"><code>ignore-scripts</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-init.html b/deps/npm/docs/output/commands/npm-init.html
index e515d36c85d2ea..9094984dd20efa 100644
--- a/deps/npm/docs/output/commands/npm-init.html
+++ b/deps/npm/docs/output/commands/npm-init.html
@@ -142,7 +142,7 @@ <h1 id="npm-init">npm-init</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><ul><li><a href="#forwarding-additional-options">Forwarding additional options</a></li></ul><li><a href="#examples">Examples</a></li><li><a href="#workspaces-support">Workspaces support</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#yes"><code>yes</code></a></li><li><a href="#force"><code>force</code></a></li><li><a href="#scope"><code>scope</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#workspaces-update"><code>workspaces-update</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><ul><li><a href="#forwarding-additional-options">Forwarding additional options</a></li></ul><li><a href="#examples">Examples</a></li><li><a href="#workspaces-support">Workspaces support</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#init-author-name"><code>init-author-name</code></a></li><li><a href="#init-author-url"><code>init-author-url</code></a></li><li><a href="#init-license"><code>init-license</code></a></li><li><a href="#init-module"><code>init-module</code></a></li><li><a href="#init-version"><code>init-version</code></a></li><li><a href="#yes"><code>yes</code></a></li><li><a href="#force"><code>force</code></a></li><li><a href="#scope"><code>scope</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#workspaces-update"><code>workspaces-update</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -256,6 +256,41 @@ <h3 id="workspaces-support">Workspaces support</h3>
        `-- ...
 </code></pre>
 <h3 id="configuration">Configuration</h3>
+<h4 id="init-author-name"><code>init-author-name</code></h4>
+<ul>
+<li>Default: ""</li>
+<li>Type: String</li>
+</ul>
+<p>The value <code>npm init</code> should use by default for the package author's name.</p>
+<h4 id="init-author-url"><code>init-author-url</code></h4>
+<ul>
+<li>Default: ""</li>
+<li>Type: "" or URL</li>
+</ul>
+<p>The value <code>npm init</code> should use by default for the package author's
+homepage.</p>
+<h4 id="init-license"><code>init-license</code></h4>
+<ul>
+<li>Default: "ISC"</li>
+<li>Type: String</li>
+</ul>
+<p>The value <code>npm init</code> should use by default for the package license.</p>
+<h4 id="init-module"><code>init-module</code></h4>
+<ul>
+<li>Default: "~/.npm-init.js"</li>
+<li>Type: Path</li>
+</ul>
+<p>A module that will be loaded by the <code>npm init</code> command. See the
+documentation for the
+<a href="https://github.com/npm/init-package-json">init-package-json</a> module for
+more information, or <a href="../commands/npm-init.html">npm init</a>.</p>
+<h4 id="init-version"><code>init-version</code></h4>
+<ul>
+<li>Default: "1.0.0"</li>
+<li>Type: SemVer string</li>
+</ul>
+<p>The value that <code>npm init</code> should use by default for the package version
+number, if not already set in package.json.</p>
 <h4 id="yes"><code>yes</code></h4>
 <ul>
 <li>Default: null</li>
diff --git a/deps/npm/docs/output/commands/npm-install-ci-test.html b/deps/npm/docs/output/commands/npm-install-ci-test.html
index f87de26e312b18..635b59bbb32040 100644
--- a/deps/npm/docs/output/commands/npm-install-ci-test.html
+++ b/deps/npm/docs/output/commands/npm-install-ci-test.html
@@ -142,7 +142,7 @@ <h1 id="npm-install-ci-test">npm-install-ci-test</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -198,6 +198,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="strict-peer-deps"><code>strict-peer-deps</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-install-test.html b/deps/npm/docs/output/commands/npm-install-test.html
index 1afefac3e93869..dd78090d2a5db3 100644
--- a/deps/npm/docs/output/commands/npm-install-test.html
+++ b/deps/npm/docs/output/commands/npm-install-test.html
@@ -142,7 +142,7 @@ <h1 id="npm-install-test">npm-install-test</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#save"><code>save</code></a></li><li><a href="#save-exact"><code>save-exact</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#prefer-dedupe"><code>prefer-dedupe</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#cpu"><code>cpu</code></a></li><li><a href="#os"><code>os</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#save"><code>save</code></a></li><li><a href="#save-exact"><code>save-exact</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#prefer-dedupe"><code>prefer-dedupe</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#cpu"><code>cpu</code></a></li><li><a href="#os"><code>os</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -229,6 +229,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="strict-peer-deps"><code>strict-peer-deps</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-install.html b/deps/npm/docs/output/commands/npm-install.html
index 54d8b5e31a28de..91e88eb32a9e08 100644
--- a/deps/npm/docs/output/commands/npm-install.html
+++ b/deps/npm/docs/output/commands/npm-install.html
@@ -142,7 +142,7 @@ <h1 id="npm-install">npm-install</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#save"><code>save</code></a></li><li><a href="#save-exact"><code>save-exact</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#prefer-dedupe"><code>prefer-dedupe</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#cpu"><code>cpu</code></a></li><li><a href="#os"><code>os</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#algorithm">Algorithm</a></li><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#save"><code>save</code></a></li><li><a href="#save-exact"><code>save-exact</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#prefer-dedupe"><code>prefer-dedupe</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#cpu"><code>cpu</code></a></li><li><a href="#os"><code>os</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#algorithm">Algorithm</a></li><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -555,6 +555,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="strict-peer-deps"><code>strict-peer-deps</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-link.html b/deps/npm/docs/output/commands/npm-link.html
index ac36e1beb56884..93ec04390fc5b2 100644
--- a/deps/npm/docs/output/commands/npm-link.html
+++ b/deps/npm/docs/output/commands/npm-link.html
@@ -142,7 +142,7 @@ <h1 id="npm-link">npm-link</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#caveat">Caveat</a></li><li><a href="#workspace-usage">Workspace Usage</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#save"><code>save</code></a></li><li><a href="#save-exact"><code>save-exact</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#caveat">Caveat</a></li><li><a href="#workspace-usage">Workspace Usage</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#save"><code>save</code></a></li><li><a href="#save-exact"><code>save-exact</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -315,6 +315,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="ignore-scripts"><code>ignore-scripts</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-ls.html b/deps/npm/docs/output/commands/npm-ls.html
index c8ec1e95924dc6..fda40e2beabf14 100644
--- a/deps/npm/docs/output/commands/npm-ls.html
+++ b/deps/npm/docs/output/commands/npm-ls.html
@@ -142,7 +142,7 @@ <h1 id="npm-ls">npm-ls</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#note-design-changes-pending">Note: Design Changes Pending</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#all"><code>all</code></a></li><li><a href="#json"><code>json</code></a></li><li><a href="#long"><code>long</code></a></li><li><a href="#parseable"><code>parseable</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#depth"><code>depth</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#link"><code>link</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#unicode"><code>unicode</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#note-design-changes-pending">Note: Design Changes Pending</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#all"><code>all</code></a></li><li><a href="#json"><code>json</code></a></li><li><a href="#long"><code>long</code></a></li><li><a href="#parseable"><code>parseable</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#depth"><code>depth</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#link"><code>link</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#unicode"><code>unicode</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -160,7 +160,7 @@ <h3 id="description">Description</h3>
 the results to only the paths to the packages named.  Note that nested
 packages will <em>also</em> show the paths to the specified packages.  For
 example, running <code>npm ls promzard</code> in npm's source tree will show:</p>
-<pre><code class="language-bash">npm@10.1.0 /path/to/npm
+<pre><code class="language-bash">npm@10.2.0 /path/to/npm
 └─┬ init-package-json@0.0.4
   └── promzard@0.1.5
 </code></pre>
@@ -261,6 +261,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="link"><code>link</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-prune.html b/deps/npm/docs/output/commands/npm-prune.html
index 9ca44c4474052e..acb24ea8023cee 100644
--- a/deps/npm/docs/output/commands/npm-prune.html
+++ b/deps/npm/docs/output/commands/npm-prune.html
@@ -142,7 +142,7 @@ <h1 id="npm-prune">npm-prune</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#omit"><code>omit</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#json"><code>json</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#configuration">Configuration</a></li><ul><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#json"><code>json</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -179,6 +179,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="dry-run"><code>dry-run</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm-query.html b/deps/npm/docs/output/commands/npm-query.html
index ac23d6ccaaa1ce..cbfccc03e15fce 100644
--- a/deps/npm/docs/output/commands/npm-query.html
+++ b/deps/npm/docs/output/commands/npm-query.html
@@ -264,6 +264,16 @@ <h3 id="example-response-output">Example Response Output</h3>
   },
   ...
 </code></pre>
+<h3 id="package-lock-only-mode">Package lock only mode</h3>
+<p>If package-lock-only is enabled, only the information in the package
+lock (or shrinkwrap) is loaded.  This means that information from the
+package.json files of your dependencies will not be included in the
+result set (e.g. description, homepage, engines).</p>
+<h3 id="package-lock-only-mode2">Package lock only mode</h3>
+<p>If package-lock-only is enabled, only the information in the package
+lock (or shrinkwrap) is loaded.  This means that information from the
+package.json files of your dependencies will not be included in the
+result set (e.g. description, homepage, engines).</p>
 <h3 id="configuration">Configuration</h3>
 <h4 id="global"><code>global</code></h4>
 <ul>
@@ -324,6 +334,17 @@ <h4 id="include-workspace-root"><code>include-workspace-root</code></h4>
 all workspaces via the <code>workspaces</code> flag, will cause npm to operate only on
 the specified workspaces, and not on the root project.</p>
 <p>This value is not exported to the environment for child processes.</p>
+<h4 id="package-lock-only"><code>package-lock-only</code></h4>
+<ul>
+<li>Default: false</li>
+<li>Type: Boolean</li>
+</ul>
+<p>If set to true, the current operation will only use the <code>package-lock.json</code>,
+ignoring <code>node_modules</code>.</p>
+<p>For <code>update</code> this means only the <code>package-lock.json</code> will be updated,
+instead of checking <code>node_modules</code> and downloading dependencies.</p>
+<p>For <code>list</code> this means the output will be based on the tree described by the
+<code>package-lock.json</code>, rather than the contents of <code>node_modules</code>.</p>
 <h2 id="see-also">See Also</h2>
 <ul>
 <li><a href="../using-npm/dependency-selectors.html">dependency selectors</a></li>
diff --git a/deps/npm/docs/output/commands/npm-sbom.html b/deps/npm/docs/output/commands/npm-sbom.html
new file mode 100644
index 00000000000000..56b146680100d1
--- /dev/null
+++ b/deps/npm/docs/output/commands/npm-sbom.html
@@ -0,0 +1,439 @@
+<!DOCTYPE html><html><head>
+<meta charset="utf-8">
+<title>npm-sbom</title>
+<style>
+body {
+    background-color: #ffffff;
+    color: #24292e;
+
+    margin: 0;
+
+    line-height: 1.5;
+
+    font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Helvetica, Arial, sans-serif, "Apple Color Emoji", "Segoe UI Emoji";
+}
+#rainbar {
+    height: 10px;
+    background-image: linear-gradient(139deg, #fb8817, #ff4b01, #c12127, #e02aff);
+}
+
+a {
+    text-decoration: none;
+    color: #0366d6;
+}
+a:hover {
+    text-decoration: underline;
+}
+
+pre {
+    margin: 1em 0px;
+    padding: 1em;
+    border: solid 1px #e1e4e8;
+    border-radius: 6px;
+
+    display: block;
+    overflow: auto;
+
+    white-space: pre;
+
+    background-color: #f6f8fa;
+    color: #393a34;
+}
+code {
+    font-family: SFMono-Regular, Consolas, "Liberation Mono", Menlo, Courier, monospace;
+    font-size: 85%;
+    padding: 0.2em 0.4em;
+    background-color: #f6f8fa;
+    color: #393a34;
+}
+pre > code {
+    padding: 0;
+    background-color: inherit;
+    color: inherit;
+}
+h1, h2, h3 {
+    font-weight: 600;
+}
+
+#logobar {
+    background-color: #333333;
+    margin: 0 auto;
+    padding: 1em 4em;
+}
+#logobar .logo {
+    float: left;
+}
+#logobar .title {
+    font-weight: 600;
+    color: #dddddd;
+    float: left;
+    margin: 5px 0 0 1em;
+}
+#logobar:after {
+    content: "";
+    display: block;
+    clear: both;
+}
+
+#content {
+    margin: 0 auto;
+    padding: 0 4em;
+}
+
+#table_of_contents > h2 {
+    font-size: 1.17em;
+}
+#table_of_contents ul:first-child {
+    border: solid 1px #e1e4e8;
+    border-radius: 6px;
+    padding: 1em;
+    background-color: #f6f8fa;
+    color: #393a34;
+}
+#table_of_contents ul {
+    list-style-type: none;
+    padding-left: 1.5em;
+}
+#table_of_contents li {
+    font-size: 0.9em;
+}
+#table_of_contents li a {
+    color: #000000;
+}
+
+header.title {
+    border-bottom: solid 1px #e1e4e8;
+}
+header.title > h1 {
+    margin-bottom: 0.25em;
+}
+header.title > .description {
+    display: block;
+    margin-bottom: 0.5em;
+    line-height: 1;
+}
+
+footer#edit {
+    border-top: solid 1px #e1e4e8;
+    margin: 3em 0 4em 0;
+    padding-top: 2em;
+}
+</style>
+</head>
+<body>
+<div id="banner">
+<div id="rainbar"></div>
+<div id="logobar">
+<svg class="logo" role="img" height="32" width="32" viewBox="0 0 700 700">
+<polygon fill="#cb0000" points="0,700 700,700 700,0 0,0"></polygon>
+<polygon fill="#ffffff" points="150,550 350,550 350,250 450,250 450,550 550,550 550,150 150,150"></polygon>
+</svg>
+<div class="title">
+npm command-line interface
+</div>
+</div>
+</div>
+
+<section id="content">
+<header class="title">
+<h1 id="npm-sbom">npm-sbom</h1>
+<span class="description">Generate a Software Bill of Materials (SBOM)</span>
+</header>
+
+<section id="table_of_contents">
+<h2 id="table-of-contents">Table of contents</h2>
+<div id="_table_of_contents"><ul><li><a href="#see-also">See Also</a></li></ul></div>
+</section>
+
+<div id="_content"><h3 id="synopsis">Synopsis</h3>
+<pre><code class="language-bash">npm sbom
+</code></pre>
+<h3 id="description">Description</h3>
+<p>The <code>npm sbom</code> command generates a Software Bill of Materials (SBOM) listing the
+dependencies for the current project. SBOMs can be generated in either
+<a href="https://spdx.dev/">SPDX</a> or <a href="https://cyclonedx.org/">CycloneDX</a> format.</p>
+<h3 id="example-cyclonedx-sbom">Example CycloneDX SBOM</h3>
+<pre><code class="language-json">{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:09f55116-97e1-49cf-b3b8-44d0207e7730",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2023-09-01T00:00:00.001Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.1.0"
+      }
+    ],
+    "component": {
+      "bom-ref": "simple@1.0.0",
+      "type": "library",
+      "name": "simple",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "John Doe",
+      "description": "simple react app",
+      "purl": "pkg:npm/simple@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [],
+      "licenses": [
+        {
+          "license": {
+            "id": "MIT"
+          }
+        }
+      ]
+    }
+  },
+  "components": [
+    {
+      "bom-ref": "lodash@4.17.21",
+      "type": "library",
+      "name": "lodash",
+      "version": "4.17.21",
+      "scope": "required",
+      "author": "John-David Dalton",
+      "description": "Lodash modular utilities.",
+      "purl": "pkg:npm/lodash@4.17.21",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": "node_modules/lodash"
+        }
+      ],
+      "externalReferences": [
+        {
+          "type": "distribution",
+          "url": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz"
+        },
+        {
+          "type": "vcs",
+          "url": "git+https://github.com/lodash/lodash.git"
+        },
+        {
+          "type": "website",
+          "url": "https://lodash.com/"
+        },
+        {
+          "type": "issue-tracker",
+          "url": "https://github.com/lodash/lodash/issues"
+        }
+      ],
+      "hashes": [
+        {
+          "alg": "SHA-512",
+          "content": "bf690311ee7b95e713ba568322e3533f2dd1cb880b189e99d4edef13592b81764daec43e2c54c61d5c558dc5cfb35ecb85b65519e74026ff17675b6f8f916f4a"
+        }
+      ],
+      "licenses": [
+        {
+          "license": {
+            "id": "MIT"
+          }
+        }
+      ]
+    }
+  ],
+  "dependencies": [
+    {
+      "ref": "simple@1.0.0",
+      "dependsOn": [
+        "lodash@4.17.21"
+      ]
+    },
+    {
+      "ref": "lodash@4.17.21",
+      "dependsOn": []
+    }
+  ]
+}
+</code></pre>
+<h3 id="example-spdx-sbom">Example SPDX SBOM</h3>
+<pre><code class="language-json">{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "simple@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/simple-1.0.0-bf81090e-8bbc-459d-bec9-abeb794e096a",
+  "creationInfo": {
+    "created": "2023-09-01T00:00:00.001Z",
+    "creators": [
+      "Tool: npm/cli-10.1.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-simple-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "simple",
+      "SPDXID": "SPDXRef-Package-simple-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "description": "simple react app",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "MIT",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/simple@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "lodash",
+      "SPDXID": "SPDXRef-Package-lodash-4.17.21",
+      "versionInfo": "4.17.21",
+      "packageFileName": "node_modules/lodash",
+      "description": "Lodash modular utilities.",
+      "downloadLocation": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
+      "filesAnalyzed": false,
+      "homepage": "https://lodash.com/",
+      "licenseDeclared": "MIT",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/lodash@4.17.21"
+        }
+      ],
+      "checksums": [
+        {
+          "algorithm": "SHA512",
+          "checksumValue": "bf690311ee7b95e713ba568322e3533f2dd1cb880b189e99d4edef13592b81764daec43e2c54c61d5c558dc5cfb35ecb85b65519e74026ff17675b6f8f916f4a"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-simple-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-simple-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-lodash-4.17.21",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+</code></pre>
+<h3 id="package-lock-only-mode">Package lock only mode</h3>
+<p>If package-lock-only is enabled, only the information in the package
+lock (or shrinkwrap) is loaded.  This means that information from the
+package.json files of your dependencies will not be included in the
+result set (e.g. description, homepage, engines).</p>
+<h3 id="configuration">Configuration</h3>
+<h4 id="omit"><code>omit</code></h4>
+<ul>
+<li>Default: 'dev' if the <code>NODE_ENV</code> environment variable is set to
+'production', otherwise empty.</li>
+<li>Type: "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Dependency types to omit from the installation tree on disk.</p>
+<p>Note that these dependencies <em>are</em> still resolved and added to the
+<code>package-lock.json</code> or <code>npm-shrinkwrap.json</code> file. They are just not
+physically installed on disk.</p>
+<p>If a package type appears in both the <code>--include</code> and <code>--omit</code> lists, then
+it will be included.</p>
+<p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
+variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="package-lock-only"><code>package-lock-only</code></h4>
+<ul>
+<li>Default: false</li>
+<li>Type: Boolean</li>
+</ul>
+<p>If set to true, the current operation will only use the <code>package-lock.json</code>,
+ignoring <code>node_modules</code>.</p>
+<p>For <code>update</code> this means only the <code>package-lock.json</code> will be updated,
+instead of checking <code>node_modules</code> and downloading dependencies.</p>
+<p>For <code>list</code> this means the output will be based on the tree described by the
+<code>package-lock.json</code>, rather than the contents of <code>node_modules</code>.</p>
+<h4 id="sbom-format"><code>sbom-format</code></h4>
+<ul>
+<li>Default: null</li>
+<li>Type: "cyclonedx" or "spdx"</li>
+</ul>
+<p>SBOM format to use when generating SBOMs.</p>
+<h4 id="sbom-type"><code>sbom-type</code></h4>
+<ul>
+<li>Default: "library"</li>
+<li>Type: "library", "application", or "framework"</li>
+</ul>
+<p>The type of package described by the generated SBOM. For SPDX, this is the
+value for the <code>primaryPackagePurpose</code> fieled. For CycloneDX, this is the
+value for the <code>type</code> field.</p>
+<h4 id="workspace"><code>workspace</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: String (can be set multiple times)</li>
+</ul>
+<p>Enable running a command in the context of the configured workspaces of the
+current project while filtering by running only the workspaces defined by
+this configuration option.</p>
+<p>Valid values for the <code>workspace</code> config are either:</p>
+<ul>
+<li>Workspace names</li>
+<li>Path to a workspace directory</li>
+<li>Path to a parent workspace directory (will result in selecting all
+workspaces within that folder)</li>
+</ul>
+<p>When set for the <code>npm init</code> command, this may be set to the folder of a
+workspace which does not yet exist, to create the folder and set it up as a
+brand new workspace within the project.</p>
+<p>This value is not exported to the environment for child processes.</p>
+<h4 id="workspaces"><code>workspaces</code></h4>
+<ul>
+<li>Default: null</li>
+<li>Type: null or Boolean</li>
+</ul>
+<p>Set to true to run the command in the context of <strong>all</strong> configured
+workspaces.</p>
+<p>Explicitly setting this to false will cause commands like <code>install</code> to
+ignore workspaces altogether. When not set explicitly:</p>
+<ul>
+<li>Commands that operate on the <code>node_modules</code> tree (install, update, etc.)
+will link workspaces into the <code>node_modules</code> folder. - Commands that do
+other things (test, exec, publish, etc.) will operate on the root project,
+<em>unless</em> one or more workspaces are specified in the <code>workspace</code> config.</li>
+</ul>
+<p>This value is not exported to the environment for child processes.</p>
+<h2 id="see-also">See Also</h2>
+<ul>
+<li><a href="../using-npm/package-spec.html">package spec</a></li>
+<li><a href="../using-npm/dependency-selectors.html">dependency selectors</a></li>
+<li><a href="../configuring-npm/package-json.html">package.json</a></li>
+<li><a href="../using-npm/workspaces.html">workspaces</a></li>
+</ul></div>
+
+<footer id="edit">
+<a href="https://github.com/npm/cli/edit/latest/docs/content/commands/npm-sbom.md">
+<svg role="img" viewBox="0 0 16 16" width="16" height="16" fill="currentcolor" style="vertical-align: text-bottom; margin-right: 0.3em;">
+<path fill-rule="evenodd" d="M11.013 1.427a1.75 1.75 0 012.474 0l1.086 1.086a1.75 1.75 0 010 2.474l-8.61 8.61c-.21.21-.47.364-.756.445l-3.251.93a.75.75 0 01-.927-.928l.929-3.25a1.75 1.75 0 01.445-.758l8.61-8.61zm1.414 1.06a.25.25 0 00-.354 0L10.811 3.75l1.439 1.44 1.263-1.263a.25.25 0 000-.354l-1.086-1.086zM11.189 6.25L9.75 4.81l-6.286 6.287a.25.25 0 00-.064.108l-.558 1.953 1.953-.558a.249.249 0 00.108-.064l6.286-6.286z"></path>
+</svg>
+Edit this page on GitHub
+</a>
+</footer>
+</section>
+
+
+
+</body></html>
\ No newline at end of file
diff --git a/deps/npm/docs/output/commands/npm-update.html b/deps/npm/docs/output/commands/npm-update.html
index 373a2ae22f9235..f471762ff30b87 100644
--- a/deps/npm/docs/output/commands/npm-update.html
+++ b/deps/npm/docs/output/commands/npm-update.html
@@ -142,7 +142,7 @@ <h1 id="npm-update">npm-update</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#example">Example</a></li><ul><li><a href="#caret-dependencies">Caret Dependencies</a></li><li><a href="#tilde-dependencies">Tilde Dependencies</a></li><li><a href="#caret-dependencies-below-100">Caret Dependencies below 1.0.0</a></li><li><a href="#subdependencies">Subdependencies</a></li><li><a href="#updating-globally-installed-packages">Updating Globally-Installed Packages</a></li></ul><li><a href="#configuration">Configuration</a></li><ul><li><a href="#save"><code>save</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#synopsis">Synopsis</a></li><li><a href="#description">Description</a></li><li><a href="#example">Example</a></li><ul><li><a href="#caret-dependencies">Caret Dependencies</a></li><li><a href="#tilde-dependencies">Tilde Dependencies</a></li><li><a href="#caret-dependencies-below-100">Caret Dependencies below 1.0.0</a></li><li><a href="#subdependencies">Subdependencies</a></li><li><a href="#updating-globally-installed-packages">Updating Globally-Installed Packages</a></li></ul><li><a href="#configuration">Configuration</a></li><ul><li><a href="#save"><code>save</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#install-links"><code>install-links</code></a></li></ul><li><a href="#see-also">See Also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="synopsis">Synopsis</h3>
@@ -319,6 +319,15 @@ <h4 id="omit"><code>omit</code></h4>
 it will be included.</p>
 <p>If the resulting omit list includes <code>'dev'</code>, then the <code>NODE_ENV</code> environment
 variable will be set to <code>'production'</code> for all lifecycle scripts.</p>
+<h4 id="include"><code>include</code></h4>
+<ul>
+<li>Default:</li>
+<li>Type: "prod", "dev", "optional", or "peer" (can be set multiple times)</li>
+</ul>
+<p>Option that allows for defining which types of dependencies to install.</p>
+<p>This is the inverse of <code>--omit=&lt;type&gt;</code>.</p>
+<p>Dependency types specified in <code>--include</code> will not be omitted, regardless of
+the order in which omit/include are specified on the command-line.</p>
 <h4 id="strict-peer-deps"><code>strict-peer-deps</code></h4>
 <ul>
 <li>Default: false</li>
diff --git a/deps/npm/docs/output/commands/npm.html b/deps/npm/docs/output/commands/npm.html
index f9b1b53685768c..dafc8c4f92c3e5 100644
--- a/deps/npm/docs/output/commands/npm.html
+++ b/deps/npm/docs/output/commands/npm.html
@@ -150,7 +150,7 @@ <h2 id="table-of-contents">Table of contents</h2>
 </code></pre>
 <p>Note: This command is unaware of workspaces.</p>
 <h3 id="version">Version</h3>
-<p>10.1.0</p>
+<p>10.2.0</p>
 <h3 id="description">Description</h3>
 <p>npm is the package manager for the Node JavaScript platform.  It puts
 modules in place so that node can find them, and manages dependency
diff --git a/deps/npm/docs/output/using-npm/config.html b/deps/npm/docs/output/using-npm/config.html
index 5942cf2118fae3..c80d3342fc9049 100644
--- a/deps/npm/docs/output/using-npm/config.html
+++ b/deps/npm/docs/output/using-npm/config.html
@@ -142,7 +142,7 @@ <h1 id="config">config</h1>
 
 <section id="table_of_contents">
 <h2 id="table-of-contents">Table of contents</h2>
-<div id="_table_of_contents"><ul><li><a href="#description">Description</a></li><ul><li><a href="#command-line-flags">Command Line Flags</a></li><li><a href="#environment-variables">Environment Variables</a></li><li><a href="#npmrc-files">npmrc Files</a></li><li><a href="#default-configs">Default Configs</a></li></ul><li><a href="#shorthands-and-other-cli-niceties">Shorthands and Other CLI Niceties</a></li><li><a href="#config-settings">Config Settings</a></li><ul><li><a href="#auth"><code>_auth</code></a></li><li><a href="#access"><code>access</code></a></li><li><a href="#all"><code>all</code></a></li><li><a href="#allow-same-version"><code>allow-same-version</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#audit-level"><code>audit-level</code></a></li><li><a href="#auth-type"><code>auth-type</code></a></li><li><a href="#before"><code>before</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#browser"><code>browser</code></a></li><li><a href="#ca"><code>ca</code></a></li><li><a href="#cache"><code>cache</code></a></li><li><a href="#cafile"><code>cafile</code></a></li><li><a href="#call"><code>call</code></a></li><li><a href="#cidr"><code>cidr</code></a></li><li><a href="#color"><code>color</code></a></li><li><a href="#commit-hooks"><code>commit-hooks</code></a></li><li><a href="#cpu"><code>cpu</code></a></li><li><a href="#depth"><code>depth</code></a></li><li><a href="#description2"><code>description</code></a></li><li><a href="#diff"><code>diff</code></a></li><li><a href="#diff-dst-prefix"><code>diff-dst-prefix</code></a></li><li><a href="#diff-ignore-all-space"><code>diff-ignore-all-space</code></a></li><li><a href="#diff-name-only"><code>diff-name-only</code></a></li><li><a href="#diff-no-prefix"><code>diff-no-prefix</code></a></li><li><a href="#diff-src-prefix"><code>diff-src-prefix</code></a></li><li><a href="#diff-text"><code>diff-text</code></a></li><li><a href="#diff-unified"><code>diff-unified</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#editor"><code>editor</code></a></li><li><a href="#engine-strict"><code>engine-strict</code></a></li><li><a href="#fetch-retries"><code>fetch-retries</code></a></li><li><a href="#fetch-retry-factor"><code>fetch-retry-factor</code></a></li><li><a href="#fetch-retry-maxtimeout"><code>fetch-retry-maxtimeout</code></a></li><li><a href="#fetch-retry-mintimeout"><code>fetch-retry-mintimeout</code></a></li><li><a href="#fetch-timeout"><code>fetch-timeout</code></a></li><li><a href="#force"><code>force</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#format-package-lock"><code>format-package-lock</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#git"><code>git</code></a></li><li><a href="#git-tag-version"><code>git-tag-version</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#globalconfig"><code>globalconfig</code></a></li><li><a href="#heading"><code>heading</code></a></li><li><a href="#https-proxy"><code>https-proxy</code></a></li><li><a href="#if-present"><code>if-present</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#include-staged"><code>include-staged</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#init-author-email"><code>init-author-email</code></a></li><li><a href="#init-author-name"><code>init-author-name</code></a></li><li><a href="#init-author-url"><code>init-author-url</code></a></li><li><a href="#init-license"><code>init-license</code></a></li><li><a href="#init-module"><code>init-module</code></a></li><li><a href="#init-version"><code>init-version</code></a></li><li><a href="#install-links"><code>install-links</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#json"><code>json</code></a></li><li><a href="#legacy-peer-deps"><code>legacy-peer-deps</code></a></li><li><a href="#link"><code>link</code></a></li><li><a href="#local-address"><code>local-address</code></a></li><li><a href="#location"><code>location</code></a></li><li><a href="#lockfile-version"><code>lockfile-version</code></a></li><li><a href="#loglevel"><code>loglevel</code></a></li><li><a href="#logs-dir"><code>logs-dir</code></a></li><li><a href="#logs-max"><code>logs-max</code></a></li><li><a href="#long"><code>long</code></a></li><li><a href="#maxsockets"><code>maxsockets</code></a></li><li><a href="#message"><code>message</code></a></li><li><a href="#node-options"><code>node-options</code></a></li><li><a href="#noproxy"><code>noproxy</code></a></li><li><a href="#offline"><code>offline</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#omit-lockfile-registry-resolved"><code>omit-lockfile-registry-resolved</code></a></li><li><a href="#os"><code>os</code></a></li><li><a href="#otp"><code>otp</code></a></li><li><a href="#pack-destination"><code>pack-destination</code></a></li><li><a href="#package"><code>package</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#parseable"><code>parseable</code></a></li><li><a href="#prefer-dedupe"><code>prefer-dedupe</code></a></li><li><a href="#prefer-offline"><code>prefer-offline</code></a></li><li><a href="#prefer-online"><code>prefer-online</code></a></li><li><a href="#prefix"><code>prefix</code></a></li><li><a href="#preid"><code>preid</code></a></li><li><a href="#progress"><code>progress</code></a></li><li><a href="#provenance"><code>provenance</code></a></li><li><a href="#provenance-file"><code>provenance-file</code></a></li><li><a href="#proxy"><code>proxy</code></a></li><li><a href="#read-only"><code>read-only</code></a></li><li><a href="#rebuild-bundle"><code>rebuild-bundle</code></a></li><li><a href="#registry"><code>registry</code></a></li><li><a href="#replace-registry-host"><code>replace-registry-host</code></a></li><li><a href="#save"><code>save</code></a></li><li><a href="#save-bundle"><code>save-bundle</code></a></li><li><a href="#save-dev"><code>save-dev</code></a></li><li><a href="#save-exact"><code>save-exact</code></a></li><li><a href="#save-optional"><code>save-optional</code></a></li><li><a href="#save-peer"><code>save-peer</code></a></li><li><a href="#save-prefix"><code>save-prefix</code></a></li><li><a href="#save-prod"><code>save-prod</code></a></li><li><a href="#scope"><code>scope</code></a></li><li><a href="#script-shell"><code>script-shell</code></a></li><li><a href="#searchexclude"><code>searchexclude</code></a></li><li><a href="#searchlimit"><code>searchlimit</code></a></li><li><a href="#searchopts"><code>searchopts</code></a></li><li><a href="#searchstaleness"><code>searchstaleness</code></a></li><li><a href="#shell"><code>shell</code></a></li><li><a href="#sign-git-commit"><code>sign-git-commit</code></a></li><li><a href="#sign-git-tag"><code>sign-git-tag</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#strict-ssl"><code>strict-ssl</code></a></li><li><a href="#tag"><code>tag</code></a></li><li><a href="#tag-version-prefix"><code>tag-version-prefix</code></a></li><li><a href="#timing"><code>timing</code></a></li><li><a href="#umask"><code>umask</code></a></li><li><a href="#unicode"><code>unicode</code></a></li><li><a href="#update-notifier"><code>update-notifier</code></a></li><li><a href="#usage"><code>usage</code></a></li><li><a href="#user-agent"><code>user-agent</code></a></li><li><a href="#userconfig"><code>userconfig</code></a></li><li><a href="#version"><code>version</code></a></li><li><a href="#versions"><code>versions</code></a></li><li><a href="#viewer"><code>viewer</code></a></li><li><a href="#which"><code>which</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#workspaces-update"><code>workspaces-update</code></a></li><li><a href="#yes"><code>yes</code></a></li><li><a href="#also"><code>also</code></a></li><li><a href="#cache-max"><code>cache-max</code></a></li><li><a href="#cache-min"><code>cache-min</code></a></li><li><a href="#cert"><code>cert</code></a></li><li><a href="#dev"><code>dev</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#initauthoremail"><code>init.author.email</code></a></li><li><a href="#initauthorname"><code>init.author.name</code></a></li><li><a href="#initauthorurl"><code>init.author.url</code></a></li><li><a href="#initlicense"><code>init.license</code></a></li><li><a href="#initmodule"><code>init.module</code></a></li><li><a href="#initversion"><code>init.version</code></a></li><li><a href="#key"><code>key</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#only"><code>only</code></a></li><li><a href="#optional"><code>optional</code></a></li><li><a href="#production"><code>production</code></a></li><li><a href="#shrinkwrap"><code>shrinkwrap</code></a></li></ul><li><a href="#see-also">See also</a></li></ul></div>
+<div id="_table_of_contents"><ul><li><a href="#description">Description</a></li><ul><li><a href="#command-line-flags">Command Line Flags</a></li><li><a href="#environment-variables">Environment Variables</a></li><li><a href="#npmrc-files">npmrc Files</a></li><li><a href="#default-configs">Default Configs</a></li></ul><li><a href="#shorthands-and-other-cli-niceties">Shorthands and Other CLI Niceties</a></li><li><a href="#config-settings">Config Settings</a></li><ul><li><a href="#auth"><code>_auth</code></a></li><li><a href="#access"><code>access</code></a></li><li><a href="#all"><code>all</code></a></li><li><a href="#allow-same-version"><code>allow-same-version</code></a></li><li><a href="#audit"><code>audit</code></a></li><li><a href="#audit-level"><code>audit-level</code></a></li><li><a href="#auth-type"><code>auth-type</code></a></li><li><a href="#before"><code>before</code></a></li><li><a href="#bin-links"><code>bin-links</code></a></li><li><a href="#browser"><code>browser</code></a></li><li><a href="#ca"><code>ca</code></a></li><li><a href="#cache"><code>cache</code></a></li><li><a href="#cafile"><code>cafile</code></a></li><li><a href="#call"><code>call</code></a></li><li><a href="#cidr"><code>cidr</code></a></li><li><a href="#color"><code>color</code></a></li><li><a href="#commit-hooks"><code>commit-hooks</code></a></li><li><a href="#cpu"><code>cpu</code></a></li><li><a href="#depth"><code>depth</code></a></li><li><a href="#description2"><code>description</code></a></li><li><a href="#diff"><code>diff</code></a></li><li><a href="#diff-dst-prefix"><code>diff-dst-prefix</code></a></li><li><a href="#diff-ignore-all-space"><code>diff-ignore-all-space</code></a></li><li><a href="#diff-name-only"><code>diff-name-only</code></a></li><li><a href="#diff-no-prefix"><code>diff-no-prefix</code></a></li><li><a href="#diff-src-prefix"><code>diff-src-prefix</code></a></li><li><a href="#diff-text"><code>diff-text</code></a></li><li><a href="#diff-unified"><code>diff-unified</code></a></li><li><a href="#dry-run"><code>dry-run</code></a></li><li><a href="#editor"><code>editor</code></a></li><li><a href="#engine-strict"><code>engine-strict</code></a></li><li><a href="#fetch-retries"><code>fetch-retries</code></a></li><li><a href="#fetch-retry-factor"><code>fetch-retry-factor</code></a></li><li><a href="#fetch-retry-maxtimeout"><code>fetch-retry-maxtimeout</code></a></li><li><a href="#fetch-retry-mintimeout"><code>fetch-retry-mintimeout</code></a></li><li><a href="#fetch-timeout"><code>fetch-timeout</code></a></li><li><a href="#force"><code>force</code></a></li><li><a href="#foreground-scripts"><code>foreground-scripts</code></a></li><li><a href="#format-package-lock"><code>format-package-lock</code></a></li><li><a href="#fund"><code>fund</code></a></li><li><a href="#git"><code>git</code></a></li><li><a href="#git-tag-version"><code>git-tag-version</code></a></li><li><a href="#global"><code>global</code></a></li><li><a href="#globalconfig"><code>globalconfig</code></a></li><li><a href="#heading"><code>heading</code></a></li><li><a href="#https-proxy"><code>https-proxy</code></a></li><li><a href="#if-present"><code>if-present</code></a></li><li><a href="#ignore-scripts"><code>ignore-scripts</code></a></li><li><a href="#include"><code>include</code></a></li><li><a href="#include-staged"><code>include-staged</code></a></li><li><a href="#include-workspace-root"><code>include-workspace-root</code></a></li><li><a href="#init-author-email"><code>init-author-email</code></a></li><li><a href="#init-author-name"><code>init-author-name</code></a></li><li><a href="#init-author-url"><code>init-author-url</code></a></li><li><a href="#init-license"><code>init-license</code></a></li><li><a href="#init-module"><code>init-module</code></a></li><li><a href="#init-version"><code>init-version</code></a></li><li><a href="#install-links"><code>install-links</code></a></li><li><a href="#install-strategy"><code>install-strategy</code></a></li><li><a href="#json"><code>json</code></a></li><li><a href="#legacy-peer-deps"><code>legacy-peer-deps</code></a></li><li><a href="#link"><code>link</code></a></li><li><a href="#local-address"><code>local-address</code></a></li><li><a href="#location"><code>location</code></a></li><li><a href="#lockfile-version"><code>lockfile-version</code></a></li><li><a href="#loglevel"><code>loglevel</code></a></li><li><a href="#logs-dir"><code>logs-dir</code></a></li><li><a href="#logs-max"><code>logs-max</code></a></li><li><a href="#long"><code>long</code></a></li><li><a href="#maxsockets"><code>maxsockets</code></a></li><li><a href="#message"><code>message</code></a></li><li><a href="#node-options"><code>node-options</code></a></li><li><a href="#noproxy"><code>noproxy</code></a></li><li><a href="#offline"><code>offline</code></a></li><li><a href="#omit"><code>omit</code></a></li><li><a href="#omit-lockfile-registry-resolved"><code>omit-lockfile-registry-resolved</code></a></li><li><a href="#os"><code>os</code></a></li><li><a href="#otp"><code>otp</code></a></li><li><a href="#pack-destination"><code>pack-destination</code></a></li><li><a href="#package"><code>package</code></a></li><li><a href="#package-lock"><code>package-lock</code></a></li><li><a href="#package-lock-only"><code>package-lock-only</code></a></li><li><a href="#parseable"><code>parseable</code></a></li><li><a href="#prefer-dedupe"><code>prefer-dedupe</code></a></li><li><a href="#prefer-offline"><code>prefer-offline</code></a></li><li><a href="#prefer-online"><code>prefer-online</code></a></li><li><a href="#prefix"><code>prefix</code></a></li><li><a href="#preid"><code>preid</code></a></li><li><a href="#progress"><code>progress</code></a></li><li><a href="#provenance"><code>provenance</code></a></li><li><a href="#provenance-file"><code>provenance-file</code></a></li><li><a href="#proxy"><code>proxy</code></a></li><li><a href="#read-only"><code>read-only</code></a></li><li><a href="#rebuild-bundle"><code>rebuild-bundle</code></a></li><li><a href="#registry"><code>registry</code></a></li><li><a href="#replace-registry-host"><code>replace-registry-host</code></a></li><li><a href="#save"><code>save</code></a></li><li><a href="#save-bundle"><code>save-bundle</code></a></li><li><a href="#save-dev"><code>save-dev</code></a></li><li><a href="#save-exact"><code>save-exact</code></a></li><li><a href="#save-optional"><code>save-optional</code></a></li><li><a href="#save-peer"><code>save-peer</code></a></li><li><a href="#save-prefix"><code>save-prefix</code></a></li><li><a href="#save-prod"><code>save-prod</code></a></li><li><a href="#sbom-format"><code>sbom-format</code></a></li><li><a href="#sbom-type"><code>sbom-type</code></a></li><li><a href="#scope"><code>scope</code></a></li><li><a href="#script-shell"><code>script-shell</code></a></li><li><a href="#searchexclude"><code>searchexclude</code></a></li><li><a href="#searchlimit"><code>searchlimit</code></a></li><li><a href="#searchopts"><code>searchopts</code></a></li><li><a href="#searchstaleness"><code>searchstaleness</code></a></li><li><a href="#shell"><code>shell</code></a></li><li><a href="#sign-git-commit"><code>sign-git-commit</code></a></li><li><a href="#sign-git-tag"><code>sign-git-tag</code></a></li><li><a href="#strict-peer-deps"><code>strict-peer-deps</code></a></li><li><a href="#strict-ssl"><code>strict-ssl</code></a></li><li><a href="#tag"><code>tag</code></a></li><li><a href="#tag-version-prefix"><code>tag-version-prefix</code></a></li><li><a href="#timing"><code>timing</code></a></li><li><a href="#umask"><code>umask</code></a></li><li><a href="#unicode"><code>unicode</code></a></li><li><a href="#update-notifier"><code>update-notifier</code></a></li><li><a href="#usage"><code>usage</code></a></li><li><a href="#user-agent"><code>user-agent</code></a></li><li><a href="#userconfig"><code>userconfig</code></a></li><li><a href="#version"><code>version</code></a></li><li><a href="#versions"><code>versions</code></a></li><li><a href="#viewer"><code>viewer</code></a></li><li><a href="#which"><code>which</code></a></li><li><a href="#workspace"><code>workspace</code></a></li><li><a href="#workspaces"><code>workspaces</code></a></li><li><a href="#workspaces-update"><code>workspaces-update</code></a></li><li><a href="#yes"><code>yes</code></a></li><li><a href="#also"><code>also</code></a></li><li><a href="#cache-max"><code>cache-max</code></a></li><li><a href="#cache-min"><code>cache-min</code></a></li><li><a href="#cert"><code>cert</code></a></li><li><a href="#dev"><code>dev</code></a></li><li><a href="#global-style"><code>global-style</code></a></li><li><a href="#initauthoremail"><code>init.author.email</code></a></li><li><a href="#initauthorname"><code>init.author.name</code></a></li><li><a href="#initauthorurl"><code>init.author.url</code></a></li><li><a href="#initlicense"><code>init.license</code></a></li><li><a href="#initmodule"><code>init.module</code></a></li><li><a href="#initversion"><code>init.version</code></a></li><li><a href="#key"><code>key</code></a></li><li><a href="#legacy-bundling"><code>legacy-bundling</code></a></li><li><a href="#only"><code>only</code></a></li><li><a href="#optional"><code>optional</code></a></li><li><a href="#production"><code>production</code></a></li><li><a href="#shrinkwrap"><code>shrinkwrap</code></a></li></ul><li><a href="#see-also">See also</a></li></ul></div>
 </section>
 
 <div id="_content"><h3 id="description">Description</h3>
@@ -1117,6 +1117,20 @@ <h4 id="save-prod"><code>save-prod</code></h4>
 you want to move it to be a non-optional production dependency.</p>
 <p>This is the default behavior if <code>--save</code> is true, and neither <code>--save-dev</code>
 or <code>--save-optional</code> are true.</p>
+<h4 id="sbom-format"><code>sbom-format</code></h4>
+<ul>
+<li>Default: null</li>
+<li>Type: "cyclonedx" or "spdx"</li>
+</ul>
+<p>SBOM format to use when generating SBOMs.</p>
+<h4 id="sbom-type"><code>sbom-type</code></h4>
+<ul>
+<li>Default: "library"</li>
+<li>Type: "library", "application", or "framework"</li>
+</ul>
+<p>The type of package described by the generated SBOM. For SPDX, this is the
+value for the <code>primaryPackagePurpose</code> fieled. For CycloneDX, this is the
+value for the <code>type</code> field.</p>
 <h4 id="scope"><code>scope</code></h4>
 <ul>
 <li>Default: the scope of the current project, if any, or ""</li>
diff --git a/deps/npm/lib/commands/audit.js b/deps/npm/lib/commands/audit.js
index de5483109d598e..c95d992c05c99f 100644
--- a/deps/npm/lib/commands/audit.js
+++ b/deps/npm/lib/commands/audit.js
@@ -404,7 +404,9 @@ class Audit extends ArboristWorkspaceCmd {
     'force',
     'json',
     'package-lock-only',
+    'package-lock',
     'omit',
+    'include',
     'foreground-scripts',
     'ignore-scripts',
     ...super.params,
@@ -439,6 +441,10 @@ class Audit extends ArboristWorkspaceCmd {
   }
 
   async auditAdvisories (args) {
+    const fix = args[0] === 'fix'
+    if (this.npm.config.get('package-lock') === false && fix) {
+      throw this.usageError('fix can not be used without a package-lock')
+    }
     const reporter = this.npm.config.get('json') ? 'json' : 'detail'
     const Arborist = require('@npmcli/arborist')
     const opts = {
@@ -450,7 +456,6 @@ class Audit extends ArboristWorkspaceCmd {
     }
 
     const arb = new Arborist(opts)
-    const fix = args[0] === 'fix'
     await arb.audit({ fix })
     if (fix) {
       await reifyFinish(this.npm, arb)
diff --git a/deps/npm/lib/commands/bugs.js b/deps/npm/lib/commands/bugs.js
index 17cbd96649b871..44926afbc9a0a9 100644
--- a/deps/npm/lib/commands/bugs.js
+++ b/deps/npm/lib/commands/bugs.js
@@ -21,8 +21,9 @@ class Bugs extends PackageUrlCmd {
 
     // try to get it from the repo, if possible
     const info = this.hostedFromMani(mani)
-    if (info) {
-      return info.bugs()
+    const infoUrl = info?.bugs()
+    if (infoUrl) {
+      return infoUrl
     }
 
     // just send them to the website, hopefully that has some info!
diff --git a/deps/npm/lib/commands/ci.js b/deps/npm/lib/commands/ci.js
index e662379278e031..706b77ac361cf2 100644
--- a/deps/npm/lib/commands/ci.js
+++ b/deps/npm/lib/commands/ci.js
@@ -16,6 +16,7 @@ class CI extends ArboristWorkspaceCmd {
     'legacy-bundling',
     'global-style',
     'omit',
+    'include',
     'strict-peer-deps',
     'foreground-scripts',
     'ignore-scripts',
diff --git a/deps/npm/lib/commands/dedupe.js b/deps/npm/lib/commands/dedupe.js
index d4e8d0e8c80c3c..0d0e26621b2275 100644
--- a/deps/npm/lib/commands/dedupe.js
+++ b/deps/npm/lib/commands/dedupe.js
@@ -13,6 +13,7 @@ class Dedupe extends ArboristWorkspaceCmd {
     'strict-peer-deps',
     'package-lock',
     'omit',
+    'include',
     'ignore-scripts',
     'audit',
     'bin-links',
diff --git a/deps/npm/lib/commands/deprecate.js b/deps/npm/lib/commands/deprecate.js
index ada2bac40f2fd6..bdce313923cff8 100644
--- a/deps/npm/lib/commands/deprecate.js
+++ b/deps/npm/lib/commands/deprecate.js
@@ -15,7 +15,7 @@ class Deprecate extends BaseCommand {
     'otp',
   ]
 
-  static ignoreImplicitWorkspace = false
+  static ignoreImplicitWorkspace = true
 
   static async completion (opts, npm) {
     if (opts.conf.argv.remain.length > 1) {
diff --git a/deps/npm/lib/commands/doctor.js b/deps/npm/lib/commands/doctor.js
index 96e343701d1d56..2a528d46ddb8dc 100644
--- a/deps/npm/lib/commands/doctor.js
+++ b/deps/npm/lib/commands/doctor.js
@@ -99,7 +99,7 @@ const subcommands = [
 ]
 const BaseCommand = require('../base-command.js')
 class Doctor extends BaseCommand {
-  static description = 'Check your npm environment'
+  static description = 'Check the health of your npm environment'
   static name = 'doctor'
   static params = ['registry']
   static ignoreImplicitWorkspace = false
diff --git a/deps/npm/lib/commands/find-dupes.js b/deps/npm/lib/commands/find-dupes.js
index b1a31208603663..2e06e8b6bd93f4 100644
--- a/deps/npm/lib/commands/find-dupes.js
+++ b/deps/npm/lib/commands/find-dupes.js
@@ -11,6 +11,7 @@ class FindDupes extends ArboristWorkspaceCmd {
     'strict-peer-deps',
     'package-lock',
     'omit',
+    'include',
     'ignore-scripts',
     'audit',
     'bin-links',
diff --git a/deps/npm/lib/commands/init.js b/deps/npm/lib/commands/init.js
index 539fba885deef3..030c97356edb83 100644
--- a/deps/npm/lib/commands/init.js
+++ b/deps/npm/lib/commands/init.js
@@ -16,6 +16,11 @@ const BaseCommand = require('../base-command.js')
 class Init extends BaseCommand {
   static description = 'Create a package.json file'
   static params = [
+    'init-author-name',
+    'init-author-url',
+    'init-license',
+    'init-module',
+    'init-version',
     'yes',
     'force',
     'scope',
diff --git a/deps/npm/lib/commands/install.js b/deps/npm/lib/commands/install.js
index 3983c8d26c841b..6687ec4371dd82 100644
--- a/deps/npm/lib/commands/install.js
+++ b/deps/npm/lib/commands/install.js
@@ -24,6 +24,7 @@ class Install extends ArboristWorkspaceCmd {
     'legacy-bundling',
     'global-style',
     'omit',
+    'include',
     'strict-peer-deps',
     'prefer-dedupe',
     'package-lock',
diff --git a/deps/npm/lib/commands/link.js b/deps/npm/lib/commands/link.js
index a81450a247ed64..0c0929115a557f 100644
--- a/deps/npm/lib/commands/link.js
+++ b/deps/npm/lib/commands/link.js
@@ -27,6 +27,7 @@ class Link extends ArboristWorkspaceCmd {
     'strict-peer-deps',
     'package-lock',
     'omit',
+    'include',
     'ignore-scripts',
     'audit',
     'bin-links',
diff --git a/deps/npm/lib/commands/ls.js b/deps/npm/lib/commands/ls.js
index 92300b1c404a35..3f9775cf125040 100644
--- a/deps/npm/lib/commands/ls.js
+++ b/deps/npm/lib/commands/ls.js
@@ -32,6 +32,7 @@ class LS extends ArboristWorkspaceCmd {
     'global',
     'depth',
     'omit',
+    'include',
     'link',
     'package-lock-only',
     'unicode',
diff --git a/deps/npm/lib/commands/outdated.js b/deps/npm/lib/commands/outdated.js
index 419fb5f5c76acb..7e5805d41806c3 100644
--- a/deps/npm/lib/commands/outdated.js
+++ b/deps/npm/lib/commands/outdated.js
@@ -6,7 +6,7 @@ const npa = require('npm-package-arg')
 const pickManifest = require('npm-pick-manifest')
 const localeCompare = require('@isaacs/string-locale-compare')('en')
 
-const ansiTrim = require('../utils/ansi-trim.js')
+const ansiTrim = require('strip-ansi')
 const ArboristWorkspaceCmd = require('../arborist-cmd.js')
 
 class Outdated extends ArboristWorkspaceCmd {
diff --git a/deps/npm/lib/commands/prune.js b/deps/npm/lib/commands/prune.js
index 12136e20e4943a..189fc29cb8bc35 100644
--- a/deps/npm/lib/commands/prune.js
+++ b/deps/npm/lib/commands/prune.js
@@ -7,6 +7,7 @@ class Prune extends ArboristWorkspaceCmd {
   static name = 'prune'
   static params = [
     'omit',
+    'include',
     'dry-run',
     'json',
     'foreground-scripts',
diff --git a/deps/npm/lib/commands/query.js b/deps/npm/lib/commands/query.js
index ba39f004fae237..68aa1fa2c06a5b 100644
--- a/deps/npm/lib/commands/query.js
+++ b/deps/npm/lib/commands/query.js
@@ -2,6 +2,7 @@
 
 const { resolve } = require('path')
 const BaseCommand = require('../base-command.js')
+const log = require('../utils/log-shim.js')
 
 class QuerySelectorItem {
   constructor (node) {
@@ -48,6 +49,7 @@ class Query extends BaseCommand {
     'workspace',
     'workspaces',
     'include-workspace-root',
+    'package-lock-only',
   ]
 
   get parsedResponse () {
@@ -64,7 +66,18 @@ class Query extends BaseCommand {
       forceActual: true,
     }
     const arb = new Arborist(opts)
-    const tree = await arb.loadActual(opts)
+    let tree
+    if (this.npm.config.get('package-lock-only')) {
+      try {
+        tree = await arb.loadVirtual()
+      } catch (err) {
+        log.verbose('loadVirtual', err.stack)
+        /* eslint-disable-next-line max-len */
+        throw this.usageError('A package lock or shrinkwrap file is required in package-lock-only mode')
+      }
+    } else {
+      tree = await arb.loadActual(opts)
+    }
     const items = await tree.querySelectorAll(args[0], this.npm.flatOptions)
     this.buildResponse(items)
 
diff --git a/deps/npm/lib/commands/sbom.js b/deps/npm/lib/commands/sbom.js
new file mode 100644
index 00000000000000..311dfbc852406d
--- /dev/null
+++ b/deps/npm/lib/commands/sbom.js
@@ -0,0 +1,155 @@
+'use strict'
+
+const { EOL } = require('os')
+const localeCompare = require('@isaacs/string-locale-compare')('en')
+const BaseCommand = require('../base-command.js')
+const log = require('../utils/log-shim.js')
+const { cyclonedxOutput } = require('../utils/sbom-cyclonedx.js')
+const { spdxOutput } = require('../utils/sbom-spdx.js')
+
+const SBOM_FORMATS = ['cyclonedx', 'spdx']
+
+class SBOM extends BaseCommand {
+  #response = {} // response is the sbom response
+
+  static description = 'Generate a Software Bill of Materials (SBOM)'
+  static name = 'sbom'
+  static workspaces = true
+
+  static params = [
+    'omit',
+    'package-lock-only',
+    'sbom-format',
+    'sbom-type',
+    'workspace',
+    'workspaces',
+  ]
+
+  get #parsedResponse () {
+    return JSON.stringify(this.#response, null, 2)
+  }
+
+  async exec () {
+    const sbomFormat = this.npm.config.get('sbom-format')
+    const packageLockOnly = this.npm.config.get('package-lock-only')
+
+    if (!sbomFormat) {
+      /* eslint-disable-next-line max-len */
+      throw this.usageError(`Must specify --sbom-format flag with one of: ${SBOM_FORMATS.join(', ')}.`)
+    }
+
+    const Arborist = require('@npmcli/arborist')
+
+    const opts = {
+      ...this.npm.flatOptions,
+      path: this.npm.prefix,
+      forceActual: true,
+    }
+    const arb = new Arborist(opts)
+
+    let tree
+    if (packageLockOnly) {
+      try {
+        tree = await arb.loadVirtual(opts)
+      } catch (err) {
+        /* eslint-disable-next-line max-len */
+        throw this.usageError('A package lock or shrinkwrap file is required in package-lock-only mode')
+      }
+    } else {
+      tree = await arb.loadActual(opts)
+    }
+
+    // Collect the list of selected workspaces in the project
+    let wsNodes
+    if (this.workspaceNames && this.workspaceNames.length) {
+      wsNodes = arb.workspaceNodes(tree, this.workspaceNames)
+    }
+
+    // Build the selector and query the tree for the list of nodes
+    const selector = this.#buildSelector({ wsNodes })
+    log.info('sbom', `Using dependency selector: ${selector}`)
+    const items = await tree.querySelectorAll(selector)
+
+    const errors = new Set()
+    for (const node of items) {
+      detectErrors(node).forEach(error => errors.add(error))
+    }
+
+    if (errors.size > 0) {
+      throw Object.assign(
+        new Error([...errors].join(EOL)),
+        { code: 'ESBOMPROBLEMS' }
+      )
+    }
+
+    // Populate the response with the list of unique nodes (sorted by location)
+    this.#buildResponse(
+      items
+        .sort((a, b) => localeCompare(a.location, b.location))
+    )
+    this.npm.output(this.#parsedResponse)
+  }
+
+  async execWorkspaces (args) {
+    await this.setWorkspaces()
+    return this.exec(args)
+  }
+
+  // Build the selector from all of the specified filter options
+  #buildSelector ({ wsNodes }) {
+    let selector
+    const omit = this.npm.flatOptions.omit
+    const workspacesEnabled = this.npm.flatOptions.workspacesEnabled
+
+    // If omit is specified, omit all nodes and their children which match the
+    // specified selectors
+    const omits = omit.reduce((acc, o) => `${acc}:not(.${o})`, '')
+
+    if (!workspacesEnabled) {
+      // If workspaces are disabled, omit all workspace nodes and their children
+      selector = `:root > :not(.workspace)${omits},:root > :not(.workspace) *${omits},:extraneous`
+    } else if (wsNodes && wsNodes.length > 0) {
+      // If one or more workspaces are selected, select only those workspaces and their children
+      selector = wsNodes.map(ws => `#${ws.name},#${ws.name} *${omits}`).join(',')
+    } else {
+      selector = `:root *${omits},:extraneous`
+    }
+
+    // Always include the root node
+    return `:root,${selector}`
+  }
+
+  // builds a normalized inventory
+  #buildResponse (items) {
+    const sbomFormat = this.npm.config.get('sbom-format')
+    const packageType = this.npm.config.get('sbom-type')
+    const packageLockOnly = this.npm.config.get('package-lock-only')
+
+    this.#response =
+        sbomFormat === 'cyclonedx'
+          ? cyclonedxOutput({ npm: this.npm, nodes: items, packageType, packageLockOnly })
+          : spdxOutput({ npm: this.npm, nodes: items, packageType })
+  }
+}
+
+const detectErrors = (node) => {
+  const errors = []
+
+  // Look for missing dependencies (that are NOT optional), or invalid dependencies
+  for (const edge of node.edgesOut.values()) {
+    if (edge.missing && !(edge.type === 'optional' || edge.type === 'peerOptional')) {
+      errors.push(`missing: ${edge.name}@${edge.spec}, required by ${edge.from.pkgid}`)
+    }
+
+    if (edge.invalid) {
+      /* istanbul ignore next */
+      const spec = edge.spec || '*'
+      const from = edge.from.pkgid
+      errors.push(`invalid: ${edge.to.pkgid}, ${spec} required by ${from}`)
+    }
+  }
+
+  return errors
+}
+
+module.exports = SBOM
diff --git a/deps/npm/lib/commands/update.js b/deps/npm/lib/commands/update.js
index caa69dd317ca6b..43d031c7ada3f3 100644
--- a/deps/npm/lib/commands/update.js
+++ b/deps/npm/lib/commands/update.js
@@ -16,6 +16,7 @@ class Update extends ArboristWorkspaceCmd {
     'legacy-bundling',
     'global-style',
     'omit',
+    'include',
     'strict-peer-deps',
     'package-lock',
     'foreground-scripts',
diff --git a/deps/npm/lib/utils/ansi-trim.js b/deps/npm/lib/utils/ansi-trim.js
deleted file mode 100644
index e35a1baf633352..00000000000000
--- a/deps/npm/lib/utils/ansi-trim.js
+++ /dev/null
@@ -1,3 +0,0 @@
-const r = new RegExp('\x1b(?:\\[(?:\\d+[ABCDEFGJKSTm]|\\d+;\\d+[Hfm]|' +
-          '\\d+;\\d+;\\d+m|6n|s|u|\\?25[lh])|\\w)', 'g')
-module.exports = str => str.replace(r, '')
diff --git a/deps/npm/lib/utils/cmd-list.js b/deps/npm/lib/utils/cmd-list.js
index 9bd252bc3facce..9017b2b80ce527 100644
--- a/deps/npm/lib/utils/cmd-list.js
+++ b/deps/npm/lib/utils/cmd-list.js
@@ -52,6 +52,7 @@ const commands = [
   'restart',
   'root',
   'run-script',
+  'sbom',
   'search',
   'set',
   'shrinkwrap',
diff --git a/deps/npm/lib/utils/format-search-stream.js b/deps/npm/lib/utils/format-search-stream.js
index ed753c27aabc83..280e96b13fa8bd 100644
--- a/deps/npm/lib/utils/format-search-stream.js
+++ b/deps/npm/lib/utils/format-search-stream.js
@@ -1,6 +1,6 @@
 const { Minipass } = require('minipass')
 const columnify = require('columnify')
-const ansiTrim = require('../utils/ansi-trim.js')
+const ansiTrim = require('strip-ansi')
 
 // This module consumes package data in the following format:
 //
diff --git a/deps/npm/lib/utils/sbom-cyclonedx.js b/deps/npm/lib/utils/sbom-cyclonedx.js
new file mode 100644
index 00000000000000..3088068ad3b5f2
--- /dev/null
+++ b/deps/npm/lib/utils/sbom-cyclonedx.js
@@ -0,0 +1,194 @@
+const crypto = require('crypto')
+const normalizeData = require('normalize-package-data')
+const parseLicense = require('spdx-expression-parse')
+const npa = require('npm-package-arg')
+const ssri = require('ssri')
+
+const CYCLONEDX_SCHEMA = 'http://cyclonedx.org/schema/bom-1.5.schema.json'
+const CYCLONEDX_FORMAT = 'CycloneDX'
+const CYCLONEDX_SCHEMA_VERSION = '1.5'
+
+const PROP_PATH = 'cdx:npm:package:path'
+const PROP_BUNDLED = 'cdx:npm:package:bundled'
+const PROP_DEVELOPMENT = 'cdx:npm:package:development'
+const PROP_EXTRANEOUS = 'cdx:npm:package:extraneous'
+const PROP_PRIVATE = 'cdx:npm:package:private'
+
+const REF_VCS = 'vcs'
+const REF_WEBSITE = 'website'
+const REF_ISSUE_TRACKER = 'issue-tracker'
+const REF_DISTRIBUTION = 'distribution'
+
+const ALGO_MAP = {
+  sha1: 'SHA-1',
+  sha256: 'SHA-256',
+  sha384: 'SHA-384',
+  sha512: 'SHA-512',
+}
+
+const cyclonedxOutput = ({ npm, nodes, packageType, packageLockOnly }) => {
+  const rootNode = nodes.find(node => node.isRoot)
+  const childNodes = nodes.filter(node => !node.isRoot && !node.isLink)
+  const uuid = crypto.randomUUID()
+
+  const deps = []
+  const seen = new Set()
+  for (let node of nodes) {
+    if (node.isLink) {
+      node = node.target
+    }
+
+    if (seen.has(node)) {
+      continue
+    }
+    seen.add(node)
+    deps.push(toCyclonedxDependency(node, nodes))
+  }
+
+  const bom = {
+    $schema: CYCLONEDX_SCHEMA,
+    bomFormat: CYCLONEDX_FORMAT,
+    specVersion: CYCLONEDX_SCHEMA_VERSION,
+    serialNumber: `urn:uuid:${uuid}`,
+    version: 1,
+    metadata: {
+      timestamp: new Date().toISOString(),
+      lifecycles: [
+        { phase: packageLockOnly ? 'pre-build' : 'build' },
+      ],
+      tools: [
+        {
+          vendor: 'npm',
+          name: 'cli',
+          version: npm.version,
+        },
+      ],
+      component: toCyclonedxItem(rootNode, { packageType }),
+    },
+    components: childNodes.map(toCyclonedxItem),
+    dependencies: deps,
+  }
+
+  return bom
+}
+
+const toCyclonedxItem = (node, { packageType }) => {
+  packageType = packageType || 'library'
+
+  // Calculate purl from package spec
+  let spec = npa(node.pkgid)
+  spec = (spec.type === 'alias') ? spec.subSpec : spec
+  const purl = npa.toPurl(spec) + (isGitNode(node) ? `?vcs_url=${node.resolved}` : '')
+
+  if (node.package) {
+    normalizeData(node.package)
+  }
+
+  let parsedLicense
+  try {
+    parsedLicense = parseLicense(node.package?.license)
+  } catch (err) {
+    parsedLicense = null
+  }
+
+  const component = {
+    'bom-ref': toCyclonedxID(node),
+    type: packageType,
+    name: node.name,
+    version: node.version,
+    scope: (node.optional || node.devOptional) ? 'optional' : 'required',
+    author: (typeof node.package?.author === 'object')
+      ? node.package.author.name
+      : (node.package?.author || undefined),
+    description: node.package?.description || undefined,
+    purl: purl,
+    properties: [{
+      name: PROP_PATH,
+      value: node.location,
+    }],
+    externalReferences: [],
+  }
+
+  if (node.integrity) {
+    const integrity = ssri.parse(node.integrity, { single: true })
+    component.hashes = [{
+      alg: ALGO_MAP[integrity.algorithm] || /* istanbul ignore next */ 'SHA-512',
+      content: integrity.hexDigest(),
+    }]
+  }
+
+  if (node.dev === true) {
+    component.properties.push(prop(PROP_DEVELOPMENT))
+  }
+
+  if (node.package?.private === true) {
+    component.properties.push(prop(PROP_PRIVATE))
+  }
+
+  if (node.extraneous === true) {
+    component.properties.push(prop(PROP_EXTRANEOUS))
+  }
+
+  if (node.inBundle === true) {
+    component.properties.push(prop(PROP_BUNDLED))
+  }
+
+  if (!node.isLink && node.resolved) {
+    component.externalReferences.push(extRef(REF_DISTRIBUTION, node.resolved))
+  }
+
+  if (node.package?.repository?.url) {
+    component.externalReferences.push(extRef(REF_VCS, node.package.repository.url))
+  }
+
+  if (node.package?.homepage) {
+    component.externalReferences.push(extRef(REF_WEBSITE, node.package.homepage))
+  }
+
+  if (node.package?.bugs?.url) {
+    component.externalReferences.push(extRef(REF_ISSUE_TRACKER, node.package.bugs.url))
+  }
+
+  // If license is a single SPDX license, use the license field
+  if (parsedLicense?.license) {
+    component.licenses = [{ license: { id: parsedLicense.license } }]
+  // If license is a conjunction, use the expression field
+  } else if (parsedLicense?.conjunction) {
+    component.licenses = [{ expression: node.package.license }]
+  }
+
+  return component
+}
+
+const toCyclonedxDependency = (node, nodes) => {
+  return {
+    ref: toCyclonedxID(node),
+    dependsOn: [...node.edgesOut.values()]
+      // Filter out edges that are linking to nodes not in the list
+      .filter(edge => nodes.find(n => n === edge.to))
+      .map(edge => toCyclonedxID(edge.to))
+      .filter(id => id),
+  }
+}
+
+const toCyclonedxID = (node) => `${node.packageName}@${node.version}`
+
+const prop = (name) => ({ name, value: 'true' })
+
+const extRef = (type, url) => ({ type, url })
+
+const isGitNode = (node) => {
+  if (!node.resolved) {
+    return
+  }
+
+  try {
+    const { type } = npa(node.resolved)
+    return type === 'git' || type === 'hosted'
+  } catch (err) {
+    /* istanbul ignore next */
+    return false
+  }
+}
+
+module.exports = { cyclonedxOutput }
diff --git a/deps/npm/lib/utils/sbom-spdx.js b/deps/npm/lib/utils/sbom-spdx.js
new file mode 100644
index 00000000000000..890ee3310fa789
--- /dev/null
+++ b/deps/npm/lib/utils/sbom-spdx.js
@@ -0,0 +1,175 @@
+
+const crypto = require('crypto')
+const normalizeData = require('normalize-package-data')
+const npa = require('npm-package-arg')
+const ssri = require('ssri')
+
+const SPDX_SCHEMA_VERSION = 'SPDX-2.3'
+const SPDX_DATA_LICENSE = 'CC0-1.0'
+const SPDX_IDENTIFER = 'SPDXRef-DOCUMENT'
+
+const NO_ASSERTION = 'NOASSERTION'
+
+const REL_DESCRIBES = 'DESCRIBES'
+const REL_PREREQ = 'HAS_PREREQUISITE'
+const REL_OPTIONAL = 'OPTIONAL_DEPENDENCY_OF'
+const REL_DEV = 'DEV_DEPENDENCY_OF'
+const REL_DEP = 'DEPENDS_ON'
+
+const REF_CAT_PACKAGE_MANAGER = 'PACKAGE-MANAGER'
+const REF_TYPE_PURL = 'purl'
+
+const spdxOutput = ({ npm, nodes, packageType }) => {
+  const rootNode = nodes.find(node => node.isRoot)
+  const childNodes = nodes.filter(node => !node.isRoot && !node.isLink)
+  const rootID = rootNode.pkgid
+  const uuid = crypto.randomUUID()
+  const ns = `http://spdx.org/spdxdocs/${npa(rootID).escapedName}-${rootNode.version}-${uuid}`
+
+  const relationships = []
+  const seen = new Set()
+  for (let node of nodes) {
+    if (node.isLink) {
+      node = node.target
+    }
+
+    if (seen.has(node)) {
+      continue
+    }
+    seen.add(node)
+
+    const rels = [...node.edgesOut.values()]
+      // Filter out edges that are linking to nodes not in the list
+      .filter(edge => nodes.find(n => n === edge.to))
+      .map(edge => toSpdxRelationship(node, edge))
+      .filter(rel => rel)
+
+    relationships.push(...rels)
+  }
+
+  const extraRelationships = nodes.filter(node => node.extraneous)
+    .map(node => toSpdxRelationship(rootNode, { to: node, type: 'optional' }))
+
+  relationships.push(...extraRelationships)
+
+  const bom = {
+    spdxVersion: SPDX_SCHEMA_VERSION,
+    dataLicense: SPDX_DATA_LICENSE,
+    SPDXID: SPDX_IDENTIFER,
+    name: rootID,
+    documentNamespace: ns,
+    creationInfo: {
+      created: new Date().toISOString(),
+      creators: [
+        `Tool: npm/cli-${npm.version}`,
+      ],
+    },
+    documentDescribes: [toSpdxID(rootNode)],
+    packages: [toSpdxItem(rootNode, { packageType }), ...childNodes.map(toSpdxItem)],
+    relationships: [
+      {
+        spdxElementId: SPDX_IDENTIFER,
+        relatedSpdxElement: toSpdxID(rootNode),
+        relationshipType: REL_DESCRIBES,
+      },
+      ...relationships,
+    ],
+  }
+
+  return bom
+}
+
+const toSpdxItem = (node, { packageType }) => {
+  normalizeData(node.package)
+
+  // Calculate purl from package spec
+  let spec = npa(node.pkgid)
+  spec = (spec.type === 'alias') ? spec.subSpec : spec
+  const purl = npa.toPurl(spec) + (isGitNode(node) ? `?vcs_url=${node.resolved}` : '')
+
+  /* For workspace nodes, use the location from their linkNode */
+  let location = node.location
+  if (node.isWorkspace && node.linksIn.size > 0) {
+    location = node.linksIn.values().next().value.location
+  }
+
+  const pkg = {
+    name: node.packageName,
+    SPDXID: toSpdxID(node),
+    versionInfo: node.version,
+    packageFileName: location,
+    description: node.package?.description || undefined,
+    primaryPackagePurpose: packageType ? packageType.toUpperCase() : undefined,
+    downloadLocation: (node.isLink ? undefined : node.resolved) || NO_ASSERTION,
+    filesAnalyzed: false,
+    homepage: node.package?.homepage || NO_ASSERTION,
+    licenseDeclared: node.package?.license || NO_ASSERTION,
+    externalRefs: [
+      {
+        referenceCategory: REF_CAT_PACKAGE_MANAGER,
+        referenceType: REF_TYPE_PURL,
+        referenceLocator: purl,
+      },
+    ],
+  }
+
+  if (node.integrity) {
+    const integrity = ssri.parse(node.integrity, { single: true })
+    pkg.checksums = [{
+      algorithm: integrity.algorithm.toUpperCase(),
+      checksumValue: integrity.hexDigest(),
+    }]
+  }
+  return pkg
+}
+
+const toSpdxRelationship = (node, edge) => {
+  let type
+  switch (edge.type) {
+    case 'peer':
+      type = REL_PREREQ
+      break
+    case 'optional':
+      type = REL_OPTIONAL
+      break
+    case 'dev':
+      type = REL_DEV
+      break
+    default:
+      type = REL_DEP
+  }
+
+  return {
+    spdxElementId: toSpdxID(node),
+    relatedSpdxElement: toSpdxID(edge.to),
+    relationshipType: type,
+  }
+}
+
+const toSpdxID = (node) => {
+  let name = node.packageName
+
+  // Strip leading @ for scoped packages
+  name = name.replace(/^@/, '')
+
+  // Replace slashes with dots
+  name = name.replace(/\//g, '.')
+
+  return `SPDXRef-Package-${name}-${node.version}`
+}
+
+const isGitNode = (node) => {
+  if (!node.resolved) {
+    return
+  }
+
+  try {
+    const { type } = npa(node.resolved)
+    return type === 'git' || type === 'hosted'
+  } catch (err) {
+    /* istanbul ignore next */
+    return false
+  }
+}
+
+module.exports = { spdxOutput }
diff --git a/deps/npm/man/man1/npm-access.1 b/deps/npm/man/man1/npm-access.1
index dc455d4a5f23b2..3973970b33e774 100644
--- a/deps/npm/man/man1/npm-access.1
+++ b/deps/npm/man/man1/npm-access.1
@@ -1,4 +1,4 @@
-.TH "NPM-ACCESS" "1" "September 2023" "" ""
+.TH "NPM-ACCESS" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-access\fR - Set access level on published packages
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-adduser.1 b/deps/npm/man/man1/npm-adduser.1
index 81807af54a8cdf..bed0126358ba71 100644
--- a/deps/npm/man/man1/npm-adduser.1
+++ b/deps/npm/man/man1/npm-adduser.1
@@ -1,4 +1,4 @@
-.TH "NPM-ADDUSER" "1" "September 2023" "" ""
+.TH "NPM-ADDUSER" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-adduser\fR - Add a registry user account
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-audit.1 b/deps/npm/man/man1/npm-audit.1
index 84e580c7e5b17a..2b354792825a2a 100644
--- a/deps/npm/man/man1/npm-audit.1
+++ b/deps/npm/man/man1/npm-audit.1
@@ -1,4 +1,4 @@
-.TH "NPM-AUDIT" "1" "September 2023" "" ""
+.TH "NPM-AUDIT" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-audit\fR - Run a security audit
 .SS "Synopsis"
@@ -18,6 +18,9 @@ Note that some vulnerabilities cannot be fixed automatically and will require ma
 fix\fR runs a full-fledged \fBnpm install\fR under the hood, all configs that apply to the installer will also apply to \fBnpm install\fR -- so things like \fBnpm audit fix --package-lock-only\fR will work as expected.
 .P
 By default, the audit command will exit with a non-zero code if any vulnerability is found. It may be useful in CI environments to include the \fB--audit-level\fR parameter to specify the minimum vulnerability level that will cause the command to fail. This option does not filter the report output, it simply changes the command's failure threshold.
+.SS "Package lock"
+.P
+By default npm requires a package-lock or shrinkwrap in order to run the audit. You can bypass the package lock with \fB--no-package-lock\fR but be aware the results may be different with every run, since npm will re-build the dependency tree each time.
 .SS "Audit Signatures"
 .P
 To ensure the integrity of packages you download from the public npm registry, or any registry that supports signatures, you can verify the registry signatures of downloaded packages using the npm CLI.
@@ -302,6 +305,16 @@ If set to true, the current operation will only use the \fBpackage-lock.json\fR,
 For \fBupdate\fR this means only the \fBpackage-lock.json\fR will be updated, instead of checking \fBnode_modules\fR and downloading dependencies.
 .P
 For \fBlist\fR this means the output will be based on the tree described by the \fBpackage-lock.json\fR, rather than the contents of \fBnode_modules\fR.
+.SS "\fBpackage-lock\fR"
+.RS 0
+.IP \(bu 4
+Default: true
+.IP \(bu 4
+Type: Boolean
+.RE 0
+
+.P
+If set to false, then ignore \fBpackage-lock.json\fR files when installing. This will also prevent \fIwriting\fR \fBpackage-lock.json\fR if \fBsave\fR is true.
 .SS "\fBomit\fR"
 .RS 0
 .IP \(bu 4
@@ -318,6 +331,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBforeground-scripts\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-bugs.1 b/deps/npm/man/man1/npm-bugs.1
index bbf9f8d979fd18..16fee0af9cf066 100644
--- a/deps/npm/man/man1/npm-bugs.1
+++ b/deps/npm/man/man1/npm-bugs.1
@@ -1,4 +1,4 @@
-.TH "NPM-BUGS" "1" "September 2023" "" ""
+.TH "NPM-BUGS" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-bugs\fR - Report bugs for a package in a web browser
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-cache.1 b/deps/npm/man/man1/npm-cache.1
index a58256bf8d4585..a0faa423af17a6 100644
--- a/deps/npm/man/man1/npm-cache.1
+++ b/deps/npm/man/man1/npm-cache.1
@@ -1,4 +1,4 @@
-.TH "NPM-CACHE" "1" "September 2023" "" ""
+.TH "NPM-CACHE" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-cache\fR - Manipulates packages cache
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-ci.1 b/deps/npm/man/man1/npm-ci.1
index 59b0de021df4e5..e22f3bd8ce4134 100644
--- a/deps/npm/man/man1/npm-ci.1
+++ b/deps/npm/man/man1/npm-ci.1
@@ -1,4 +1,4 @@
-.TH "NPM-CI" "1" "September 2023" "" ""
+.TH "NPM-CI" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-ci\fR - Clean install a project
 .SS "Synopsis"
@@ -116,6 +116,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBstrict-peer-deps\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-completion.1 b/deps/npm/man/man1/npm-completion.1
index e420854773c247..b8f80ed6090c85 100644
--- a/deps/npm/man/man1/npm-completion.1
+++ b/deps/npm/man/man1/npm-completion.1
@@ -1,4 +1,4 @@
-.TH "NPM-COMPLETION" "1" "September 2023" "" ""
+.TH "NPM-COMPLETION" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-completion\fR - Tab Completion for npm
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-config.1 b/deps/npm/man/man1/npm-config.1
index dba3356299a4f2..bdf56c7bdb49eb 100644
--- a/deps/npm/man/man1/npm-config.1
+++ b/deps/npm/man/man1/npm-config.1
@@ -1,4 +1,4 @@
-.TH "NPM-CONFIG" "1" "September 2023" "" ""
+.TH "NPM-CONFIG" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-config\fR - Manage the npm configuration files
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-dedupe.1 b/deps/npm/man/man1/npm-dedupe.1
index 8dba928a3d78aa..7857da24d22227 100644
--- a/deps/npm/man/man1/npm-dedupe.1
+++ b/deps/npm/man/man1/npm-dedupe.1
@@ -1,4 +1,4 @@
-.TH "NPM-DEDUPE" "1" "September 2023" "" ""
+.TH "NPM-DEDUPE" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-dedupe\fR - Reduce duplication in the package tree
 .SS "Synopsis"
@@ -139,6 +139,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBignore-scripts\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-deprecate.1 b/deps/npm/man/man1/npm-deprecate.1
index 85447f708de39d..b58987d3afad92 100644
--- a/deps/npm/man/man1/npm-deprecate.1
+++ b/deps/npm/man/man1/npm-deprecate.1
@@ -1,4 +1,4 @@
-.TH "NPM-DEPRECATE" "1" "September 2023" "" ""
+.TH "NPM-DEPRECATE" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-deprecate\fR - Deprecate a version of a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-diff.1 b/deps/npm/man/man1/npm-diff.1
index cb21d2b1bfd135..70227dc7aaff32 100644
--- a/deps/npm/man/man1/npm-diff.1
+++ b/deps/npm/man/man1/npm-diff.1
@@ -1,4 +1,4 @@
-.TH "NPM-DIFF" "1" "September 2023" "" ""
+.TH "NPM-DIFF" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-diff\fR - The registry diff command
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-dist-tag.1 b/deps/npm/man/man1/npm-dist-tag.1
index ab3c4bec4b6838..a02570f24a6f9f 100644
--- a/deps/npm/man/man1/npm-dist-tag.1
+++ b/deps/npm/man/man1/npm-dist-tag.1
@@ -1,4 +1,4 @@
-.TH "NPM-DIST-TAG" "1" "September 2023" "" ""
+.TH "NPM-DIST-TAG" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-dist-tag\fR - Modify package distribution tags
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-docs.1 b/deps/npm/man/man1/npm-docs.1
index 32492edbf9d8f1..81f53336cdb779 100644
--- a/deps/npm/man/man1/npm-docs.1
+++ b/deps/npm/man/man1/npm-docs.1
@@ -1,4 +1,4 @@
-.TH "NPM-DOCS" "1" "September 2023" "" ""
+.TH "NPM-DOCS" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-docs\fR - Open documentation for a package in a web browser
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-doctor.1 b/deps/npm/man/man1/npm-doctor.1
index 7bbae5311478b2..17978d0d5e532a 100644
--- a/deps/npm/man/man1/npm-doctor.1
+++ b/deps/npm/man/man1/npm-doctor.1
@@ -1,6 +1,6 @@
-.TH "NPM-DOCTOR" "1" "September 2023" "" ""
+.TH "NPM-DOCTOR" "1" "October 2023" "" ""
 .SH "NAME"
-\fBnpm-doctor\fR - Check your npm environment
+\fBnpm-doctor\fR - Check the health of your npm environment
 .SS "Synopsis"
 .P
 .RS 2
diff --git a/deps/npm/man/man1/npm-edit.1 b/deps/npm/man/man1/npm-edit.1
index 97274222f7b744..012aabad9f2858 100644
--- a/deps/npm/man/man1/npm-edit.1
+++ b/deps/npm/man/man1/npm-edit.1
@@ -1,4 +1,4 @@
-.TH "NPM-EDIT" "1" "September 2023" "" ""
+.TH "NPM-EDIT" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-edit\fR - Edit an installed package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-exec.1 b/deps/npm/man/man1/npm-exec.1
index a48b29fd1ab411..92e0cdb11895d7 100644
--- a/deps/npm/man/man1/npm-exec.1
+++ b/deps/npm/man/man1/npm-exec.1
@@ -1,4 +1,4 @@
-.TH "NPM-EXEC" "1" "September 2023" "" ""
+.TH "NPM-EXEC" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-exec\fR - Run a command from a local or remote npm package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-explain.1 b/deps/npm/man/man1/npm-explain.1
index 08aa51b4748f9d..667d46df151f40 100644
--- a/deps/npm/man/man1/npm-explain.1
+++ b/deps/npm/man/man1/npm-explain.1
@@ -1,4 +1,4 @@
-.TH "NPM-EXPLAIN" "1" "September 2023" "" ""
+.TH "NPM-EXPLAIN" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-explain\fR - Explain installed packages
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-explore.1 b/deps/npm/man/man1/npm-explore.1
index bf87dc4c66d3d9..f30ffd4a5e27af 100644
--- a/deps/npm/man/man1/npm-explore.1
+++ b/deps/npm/man/man1/npm-explore.1
@@ -1,4 +1,4 @@
-.TH "NPM-EXPLORE" "1" "September 2023" "" ""
+.TH "NPM-EXPLORE" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-explore\fR - Browse an installed package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-find-dupes.1 b/deps/npm/man/man1/npm-find-dupes.1
index 3310201661f1b1..e4bcc8b85db3dd 100644
--- a/deps/npm/man/man1/npm-find-dupes.1
+++ b/deps/npm/man/man1/npm-find-dupes.1
@@ -1,4 +1,4 @@
-.TH "NPM-FIND-DUPES" "1" "September 2023" "" ""
+.TH "NPM-FIND-DUPES" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-find-dupes\fR - Find duplication in the package tree
 .SS "Synopsis"
@@ -86,6 +86,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBignore-scripts\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-fund.1 b/deps/npm/man/man1/npm-fund.1
index 7f70ab3c45c058..afcbcfbbc85f41 100644
--- a/deps/npm/man/man1/npm-fund.1
+++ b/deps/npm/man/man1/npm-fund.1
@@ -1,4 +1,4 @@
-.TH "NPM-FUND" "1" "September 2023" "" ""
+.TH "NPM-FUND" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-fund\fR - Retrieve funding information
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-help-search.1 b/deps/npm/man/man1/npm-help-search.1
index e1bd049796d950..2c5effe6c6e186 100644
--- a/deps/npm/man/man1/npm-help-search.1
+++ b/deps/npm/man/man1/npm-help-search.1
@@ -1,4 +1,4 @@
-.TH "NPM-HELP-SEARCH" "1" "September 2023" "" ""
+.TH "NPM-HELP-SEARCH" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-help-search\fR - Search npm help documentation
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-help.1 b/deps/npm/man/man1/npm-help.1
index c7b63df80ca5b2..b5f7e3bdd959ef 100644
--- a/deps/npm/man/man1/npm-help.1
+++ b/deps/npm/man/man1/npm-help.1
@@ -1,4 +1,4 @@
-.TH "NPM-HELP" "1" "September 2023" "" ""
+.TH "NPM-HELP" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-help\fR - Get help on npm
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-hook.1 b/deps/npm/man/man1/npm-hook.1
index 345fa4bf0fa339..db68ce36d4d88a 100644
--- a/deps/npm/man/man1/npm-hook.1
+++ b/deps/npm/man/man1/npm-hook.1
@@ -1,4 +1,4 @@
-.TH "NPM-HOOK" "1" "September 2023" "" ""
+.TH "NPM-HOOK" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-hook\fR - Manage registry hooks
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-init.1 b/deps/npm/man/man1/npm-init.1
index 733d132e56f283..f2e0a289b88561 100644
--- a/deps/npm/man/man1/npm-init.1
+++ b/deps/npm/man/man1/npm-init.1
@@ -1,4 +1,4 @@
-.TH "NPM-INIT" "1" "September 2023" "" ""
+.TH "NPM-INIT" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-init\fR - Create a package.json file
 .SS "Synopsis"
@@ -148,6 +148,56 @@ This will make sure to generate your react app as expected, one important consid
 .fi
 .RE
 .SS "Configuration"
+.SS "\fBinit-author-name\fR"
+.RS 0
+.IP \(bu 4
+Default: ""
+.IP \(bu 4
+Type: String
+.RE 0
+
+.P
+The value \fBnpm init\fR should use by default for the package author's name.
+.SS "\fBinit-author-url\fR"
+.RS 0
+.IP \(bu 4
+Default: ""
+.IP \(bu 4
+Type: "" or URL
+.RE 0
+
+.P
+The value \fBnpm init\fR should use by default for the package author's homepage.
+.SS "\fBinit-license\fR"
+.RS 0
+.IP \(bu 4
+Default: "ISC"
+.IP \(bu 4
+Type: String
+.RE 0
+
+.P
+The value \fBnpm init\fR should use by default for the package license.
+.SS "\fBinit-module\fR"
+.RS 0
+.IP \(bu 4
+Default: "~/.npm-init.js"
+.IP \(bu 4
+Type: Path
+.RE 0
+
+.P
+A module that will be loaded by the \fBnpm init\fR command. See the documentation for the \fBinit-package-json\fR \fI\(lahttps://github.com/npm/init-package-json\(ra\fR module for more information, or npm help init.
+.SS "\fBinit-version\fR"
+.RS 0
+.IP \(bu 4
+Default: "1.0.0"
+.IP \(bu 4
+Type: SemVer string
+.RE 0
+
+.P
+The value that \fBnpm init\fR should use by default for the package version number, if not already set in package.json.
 .SS "\fByes\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-install-ci-test.1 b/deps/npm/man/man1/npm-install-ci-test.1
index 291242bcc5551a..9f7c1a222ef31f 100644
--- a/deps/npm/man/man1/npm-install-ci-test.1
+++ b/deps/npm/man/man1/npm-install-ci-test.1
@@ -1,4 +1,4 @@
-.TH "NPM-INSTALL-CI-TEST" "1" "September 2023" "" ""
+.TH "NPM-INSTALL-CI-TEST" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-install-ci-test\fR - Install a project with a clean slate and run tests
 .SS "Synopsis"
@@ -64,6 +64,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBstrict-peer-deps\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-install-test.1 b/deps/npm/man/man1/npm-install-test.1
index 7a7db04ce9af80..c7361dcd7ac767 100644
--- a/deps/npm/man/man1/npm-install-test.1
+++ b/deps/npm/man/man1/npm-install-test.1
@@ -1,4 +1,4 @@
-.TH "NPM-INSTALL-TEST" "1" "September 2023" "" ""
+.TH "NPM-INSTALL-TEST" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-install-test\fR - Install package(s) and run tests
 .SS "Synopsis"
@@ -107,6 +107,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBstrict-peer-deps\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-install.1 b/deps/npm/man/man1/npm-install.1
index 2e55418c2cbdba..0d202d94814425 100644
--- a/deps/npm/man/man1/npm-install.1
+++ b/deps/npm/man/man1/npm-install.1
@@ -1,4 +1,4 @@
-.TH "NPM-INSTALL" "1" "September 2023" "" ""
+.TH "NPM-INSTALL" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-install\fR - Install a package
 .SS "Synopsis"
@@ -469,6 +469,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBstrict-peer-deps\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-link.1 b/deps/npm/man/man1/npm-link.1
index d07195da001f1b..13c26b8b4043de 100644
--- a/deps/npm/man/man1/npm-link.1
+++ b/deps/npm/man/man1/npm-link.1
@@ -1,4 +1,4 @@
-.TH "NPM-LINK" "1" "September 2023" "" ""
+.TH "NPM-LINK" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-link\fR - Symlink a package folder
 .SS "Synopsis"
@@ -198,6 +198,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBignore-scripts\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-login.1 b/deps/npm/man/man1/npm-login.1
index 54c612b86dd6a9..86bc0a1f6162f3 100644
--- a/deps/npm/man/man1/npm-login.1
+++ b/deps/npm/man/man1/npm-login.1
@@ -1,4 +1,4 @@
-.TH "NPM-LOGIN" "1" "September 2023" "" ""
+.TH "NPM-LOGIN" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-login\fR - Login to a registry user account
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-logout.1 b/deps/npm/man/man1/npm-logout.1
index 3bab9b35c7866a..58c7f047db0086 100644
--- a/deps/npm/man/man1/npm-logout.1
+++ b/deps/npm/man/man1/npm-logout.1
@@ -1,4 +1,4 @@
-.TH "NPM-LOGOUT" "1" "September 2023" "" ""
+.TH "NPM-LOGOUT" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-logout\fR - Log out of the registry
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-ls.1 b/deps/npm/man/man1/npm-ls.1
index 7254629646d7a9..385138d4876f99 100644
--- a/deps/npm/man/man1/npm-ls.1
+++ b/deps/npm/man/man1/npm-ls.1
@@ -1,4 +1,4 @@
-.TH "NPM-LS" "1" "September 2023" "" ""
+.TH "NPM-LS" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-ls\fR - List installed packages
 .SS "Synopsis"
@@ -20,7 +20,7 @@ Positional arguments are \fBname@version-range\fR identifiers, which will limit
 .P
 .RS 2
 .nf
-npm@10.1.0 /path/to/npm
+npm@10.2.0 /path/to/npm
 └─┬ init-package-json@0.0.4
   └── promzard@0.1.5
 .fi
@@ -140,6 +140,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBlink\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-org.1 b/deps/npm/man/man1/npm-org.1
index e1b45b50b6765f..df0495c6c6aeea 100644
--- a/deps/npm/man/man1/npm-org.1
+++ b/deps/npm/man/man1/npm-org.1
@@ -1,4 +1,4 @@
-.TH "NPM-ORG" "1" "September 2023" "" ""
+.TH "NPM-ORG" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-org\fR - Manage orgs
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-outdated.1 b/deps/npm/man/man1/npm-outdated.1
index 887c252ff38778..2935461bbedd0a 100644
--- a/deps/npm/man/man1/npm-outdated.1
+++ b/deps/npm/man/man1/npm-outdated.1
@@ -1,4 +1,4 @@
-.TH "NPM-OUTDATED" "1" "September 2023" "" ""
+.TH "NPM-OUTDATED" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-outdated\fR - Check for outdated packages
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-owner.1 b/deps/npm/man/man1/npm-owner.1
index 01c2050f00068e..288c891617d867 100644
--- a/deps/npm/man/man1/npm-owner.1
+++ b/deps/npm/man/man1/npm-owner.1
@@ -1,4 +1,4 @@
-.TH "NPM-OWNER" "1" "September 2023" "" ""
+.TH "NPM-OWNER" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-owner\fR - Manage package owners
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-pack.1 b/deps/npm/man/man1/npm-pack.1
index a5fc8234152216..b6d8a6bff2d275 100644
--- a/deps/npm/man/man1/npm-pack.1
+++ b/deps/npm/man/man1/npm-pack.1
@@ -1,4 +1,4 @@
-.TH "NPM-PACK" "1" "September 2023" "" ""
+.TH "NPM-PACK" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-pack\fR - Create a tarball from a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-ping.1 b/deps/npm/man/man1/npm-ping.1
index 92f76c66dc5a2e..f5e3cc536030e8 100644
--- a/deps/npm/man/man1/npm-ping.1
+++ b/deps/npm/man/man1/npm-ping.1
@@ -1,4 +1,4 @@
-.TH "NPM-PING" "1" "September 2023" "" ""
+.TH "NPM-PING" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-ping\fR - Ping npm registry
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-pkg.1 b/deps/npm/man/man1/npm-pkg.1
index d13bcd64cef703..75d0791abbfed6 100644
--- a/deps/npm/man/man1/npm-pkg.1
+++ b/deps/npm/man/man1/npm-pkg.1
@@ -1,4 +1,4 @@
-.TH "NPM-PKG" "1" "September 2023" "" ""
+.TH "NPM-PKG" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-pkg\fR - Manages your package.json
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-prefix.1 b/deps/npm/man/man1/npm-prefix.1
index 909e5b709787bc..c63af6e4d99fbd 100644
--- a/deps/npm/man/man1/npm-prefix.1
+++ b/deps/npm/man/man1/npm-prefix.1
@@ -1,4 +1,4 @@
-.TH "NPM-PREFIX" "1" "September 2023" "" ""
+.TH "NPM-PREFIX" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-prefix\fR - Display prefix
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-profile.1 b/deps/npm/man/man1/npm-profile.1
index 4941380ad2ef58..acc437b9b904f2 100644
--- a/deps/npm/man/man1/npm-profile.1
+++ b/deps/npm/man/man1/npm-profile.1
@@ -1,4 +1,4 @@
-.TH "NPM-PROFILE" "1" "September 2023" "" ""
+.TH "NPM-PROFILE" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-profile\fR - Change settings on your registry profile
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-prune.1 b/deps/npm/man/man1/npm-prune.1
index eea4ee41da6a23..1ccd763e2372f6 100644
--- a/deps/npm/man/man1/npm-prune.1
+++ b/deps/npm/man/man1/npm-prune.1
@@ -1,4 +1,4 @@
-.TH "NPM-PRUNE" "1" "September 2023" "" ""
+.TH "NPM-PRUNE" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-prune\fR - Remove extraneous packages
 .SS "Synopsis"
@@ -38,6 +38,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBdry-run\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-publish.1 b/deps/npm/man/man1/npm-publish.1
index b167ed8a60677a..9d580de01e5ec5 100644
--- a/deps/npm/man/man1/npm-publish.1
+++ b/deps/npm/man/man1/npm-publish.1
@@ -1,4 +1,4 @@
-.TH "NPM-PUBLISH" "1" "September 2023" "" ""
+.TH "NPM-PUBLISH" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-publish\fR - Publish a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-query.1 b/deps/npm/man/man1/npm-query.1
index c5ff8ec3bffd66..5a79a5c2fac37d 100644
--- a/deps/npm/man/man1/npm-query.1
+++ b/deps/npm/man/man1/npm-query.1
@@ -1,4 +1,4 @@
-.TH "NPM-QUERY" "1" "September 2023" "" ""
+.TH "NPM-QUERY" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-query\fR - Dependency selector query
 .SS "Synopsis"
@@ -138,6 +138,12 @@ an array of dependency objects is returned which can contain multiple copies of
   ...
 .fi
 .RE
+.SS "Package lock only mode"
+.P
+If package-lock-only is enabled, only the information in the package lock (or shrinkwrap) is loaded. This means that information from the package.json files of your dependencies will not be included in the result set (e.g. description, homepage, engines).
+.SS "Package lock only mode"
+.P
+If package-lock-only is enabled, only the information in the package lock (or shrinkwrap) is loaded. This means that information from the package.json files of your dependencies will not be included in the result set (e.g. description, homepage, engines).
 .SS "Configuration"
 .SS "\fBglobal\fR"
 .RS 0
@@ -216,6 +222,20 @@ Include the workspace root when workspaces are enabled for a command.
 When false, specifying individual workspaces via the \fBworkspace\fR config, or all workspaces via the \fBworkspaces\fR flag, will cause npm to operate only on the specified workspaces, and not on the root project.
 .P
 This value is not exported to the environment for child processes.
+.SS "\fBpackage-lock-only\fR"
+.RS 0
+.IP \(bu 4
+Default: false
+.IP \(bu 4
+Type: Boolean
+.RE 0
+
+.P
+If set to true, the current operation will only use the \fBpackage-lock.json\fR, ignoring \fBnode_modules\fR.
+.P
+For \fBupdate\fR this means only the \fBpackage-lock.json\fR will be updated, instead of checking \fBnode_modules\fR and downloading dependencies.
+.P
+For \fBlist\fR this means the output will be based on the tree described by the \fBpackage-lock.json\fR, rather than the contents of \fBnode_modules\fR.
 .SH "SEE ALSO"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-rebuild.1 b/deps/npm/man/man1/npm-rebuild.1
index d22edac3427f53..882b27fa6e0722 100644
--- a/deps/npm/man/man1/npm-rebuild.1
+++ b/deps/npm/man/man1/npm-rebuild.1
@@ -1,4 +1,4 @@
-.TH "NPM-REBUILD" "1" "September 2023" "" ""
+.TH "NPM-REBUILD" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-rebuild\fR - Rebuild a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-repo.1 b/deps/npm/man/man1/npm-repo.1
index 8562592255a21a..85805cb46b07fc 100644
--- a/deps/npm/man/man1/npm-repo.1
+++ b/deps/npm/man/man1/npm-repo.1
@@ -1,4 +1,4 @@
-.TH "NPM-REPO" "1" "September 2023" "" ""
+.TH "NPM-REPO" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-repo\fR - Open package repository page in the browser
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-restart.1 b/deps/npm/man/man1/npm-restart.1
index 50f86f5aedc763..eea0fa265c0260 100644
--- a/deps/npm/man/man1/npm-restart.1
+++ b/deps/npm/man/man1/npm-restart.1
@@ -1,4 +1,4 @@
-.TH "NPM-RESTART" "1" "September 2023" "" ""
+.TH "NPM-RESTART" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-restart\fR - Restart a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-root.1 b/deps/npm/man/man1/npm-root.1
index 6d66168523776a..eb0cfdb848c9ef 100644
--- a/deps/npm/man/man1/npm-root.1
+++ b/deps/npm/man/man1/npm-root.1
@@ -1,4 +1,4 @@
-.TH "NPM-ROOT" "1" "September 2023" "" ""
+.TH "NPM-ROOT" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-root\fR - Display npm root
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-run-script.1 b/deps/npm/man/man1/npm-run-script.1
index 4a3cf441d72dd7..df369cd43a6a7c 100644
--- a/deps/npm/man/man1/npm-run-script.1
+++ b/deps/npm/man/man1/npm-run-script.1
@@ -1,4 +1,4 @@
-.TH "NPM-RUN-SCRIPT" "1" "September 2023" "" ""
+.TH "NPM-RUN-SCRIPT" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-run-script\fR - Run arbitrary package scripts
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-sbom.1 b/deps/npm/man/man1/npm-sbom.1
new file mode 100644
index 00000000000000..f9f14670f55a67
--- /dev/null
+++ b/deps/npm/man/man1/npm-sbom.1
@@ -0,0 +1,314 @@
+.TH "NPM-SBOM" "1" "October 2023" "" ""
+.SH "NAME"
+\fBnpm-sbom\fR - Generate a Software Bill of Materials (SBOM)
+.SS "Synopsis"
+.P
+.RS 2
+.nf
+npm sbom
+.fi
+.RE
+.SS "Description"
+.P
+The \fBnpm sbom\fR command generates a Software Bill of Materials (SBOM) listing the dependencies for the current project. SBOMs can be generated in either \fBSPDX\fR \fI\(lahttps://spdx.dev/\(ra\fR or \fBCycloneDX\fR \fI\(lahttps://cyclonedx.org/\(ra\fR format.
+.SS "Example CycloneDX SBOM"
+.P
+.RS 2
+.nf
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:09f55116-97e1-49cf-b3b8-44d0207e7730",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2023-09-01T00:00:00.001Z",
+    "lifecycles": \[lB]
+      {
+        "phase": "build"
+      }
+    \[rB],
+    "tools": \[lB]
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.1.0"
+      }
+    \[rB],
+    "component": {
+      "bom-ref": "simple@1.0.0",
+      "type": "library",
+      "name": "simple",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "John Doe",
+      "description": "simple react app",
+      "purl": "pkg:npm/simple@1.0.0",
+      "properties": \[lB]
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      \[rB],
+      "externalReferences": \[lB]\[rB],
+      "licenses": \[lB]
+        {
+          "license": {
+            "id": "MIT"
+          }
+        }
+      \[rB]
+    }
+  },
+  "components": \[lB]
+    {
+      "bom-ref": "lodash@4.17.21",
+      "type": "library",
+      "name": "lodash",
+      "version": "4.17.21",
+      "scope": "required",
+      "author": "John-David Dalton",
+      "description": "Lodash modular utilities.",
+      "purl": "pkg:npm/lodash@4.17.21",
+      "properties": \[lB]
+        {
+          "name": "cdx:npm:package:path",
+          "value": "node_modules/lodash"
+        }
+      \[rB],
+      "externalReferences": \[lB]
+        {
+          "type": "distribution",
+          "url": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz"
+        },
+        {
+          "type": "vcs",
+          "url": "git+https://github.com/lodash/lodash.git"
+        },
+        {
+          "type": "website",
+          "url": "https://lodash.com/"
+        },
+        {
+          "type": "issue-tracker",
+          "url": "https://github.com/lodash/lodash/issues"
+        }
+      \[rB],
+      "hashes": \[lB]
+        {
+          "alg": "SHA-512",
+          "content": "bf690311ee7b95e713ba568322e3533f2dd1cb880b189e99d4edef13592b81764daec43e2c54c61d5c558dc5cfb35ecb85b65519e74026ff17675b6f8f916f4a"
+        }
+      \[rB],
+      "licenses": \[lB]
+        {
+          "license": {
+            "id": "MIT"
+          }
+        }
+      \[rB]
+    }
+  \[rB],
+  "dependencies": \[lB]
+    {
+      "ref": "simple@1.0.0",
+      "dependsOn": \[lB]
+        "lodash@4.17.21"
+      \[rB]
+    },
+    {
+      "ref": "lodash@4.17.21",
+      "dependsOn": \[lB]\[rB]
+    }
+  \[rB]
+}
+.fi
+.RE
+.SS "Example SPDX SBOM"
+.P
+.RS 2
+.nf
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "simple@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/simple-1.0.0-bf81090e-8bbc-459d-bec9-abeb794e096a",
+  "creationInfo": {
+    "created": "2023-09-01T00:00:00.001Z",
+    "creators": \[lB]
+      "Tool: npm/cli-10.1.0"
+    \[rB]
+  },
+  "documentDescribes": \[lB]
+    "SPDXRef-Package-simple-1.0.0"
+  \[rB],
+  "packages": \[lB]
+    {
+      "name": "simple",
+      "SPDXID": "SPDXRef-Package-simple-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "description": "simple react app",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "MIT",
+      "externalRefs": \[lB]
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/simple@1.0.0"
+        }
+      \[rB]
+    },
+    {
+      "name": "lodash",
+      "SPDXID": "SPDXRef-Package-lodash-4.17.21",
+      "versionInfo": "4.17.21",
+      "packageFileName": "node_modules/lodash",
+      "description": "Lodash modular utilities.",
+      "downloadLocation": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
+      "filesAnalyzed": false,
+      "homepage": "https://lodash.com/",
+      "licenseDeclared": "MIT",
+      "externalRefs": \[lB]
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/lodash@4.17.21"
+        }
+      \[rB],
+      "checksums": \[lB]
+        {
+          "algorithm": "SHA512",
+          "checksumValue": "bf690311ee7b95e713ba568322e3533f2dd1cb880b189e99d4edef13592b81764daec43e2c54c61d5c558dc5cfb35ecb85b65519e74026ff17675b6f8f916f4a"
+        }
+      \[rB]
+    }
+  \[rB],
+  "relationships": \[lB]
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-simple-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-simple-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-lodash-4.17.21",
+      "relationshipType": "DEPENDS_ON"
+    }
+  \[rB]
+}
+.fi
+.RE
+.SS "Package lock only mode"
+.P
+If package-lock-only is enabled, only the information in the package lock (or shrinkwrap) is loaded. This means that information from the package.json files of your dependencies will not be included in the result set (e.g. description, homepage, engines).
+.SS "Configuration"
+.SS "\fBomit\fR"
+.RS 0
+.IP \(bu 4
+Default: 'dev' if the \fBNODE_ENV\fR environment variable is set to 'production', otherwise empty.
+.IP \(bu 4
+Type: "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Dependency types to omit from the installation tree on disk.
+.P
+Note that these dependencies \fIare\fR still resolved and added to the \fBpackage-lock.json\fR or \fBnpm-shrinkwrap.json\fR file. They are just not physically installed on disk.
+.P
+If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
+.P
+If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBpackage-lock-only\fR"
+.RS 0
+.IP \(bu 4
+Default: false
+.IP \(bu 4
+Type: Boolean
+.RE 0
+
+.P
+If set to true, the current operation will only use the \fBpackage-lock.json\fR, ignoring \fBnode_modules\fR.
+.P
+For \fBupdate\fR this means only the \fBpackage-lock.json\fR will be updated, instead of checking \fBnode_modules\fR and downloading dependencies.
+.P
+For \fBlist\fR this means the output will be based on the tree described by the \fBpackage-lock.json\fR, rather than the contents of \fBnode_modules\fR.
+.SS "\fBsbom-format\fR"
+.RS 0
+.IP \(bu 4
+Default: null
+.IP \(bu 4
+Type: "cyclonedx" or "spdx"
+.RE 0
+
+.P
+SBOM format to use when generating SBOMs.
+.SS "\fBsbom-type\fR"
+.RS 0
+.IP \(bu 4
+Default: "library"
+.IP \(bu 4
+Type: "library", "application", or "framework"
+.RE 0
+
+.P
+The type of package described by the generated SBOM. For SPDX, this is the value for the \fBprimaryPackagePurpose\fR fieled. For CycloneDX, this is the value for the \fBtype\fR field.
+.SS "\fBworkspace\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: String (can be set multiple times)
+.RE 0
+
+.P
+Enable running a command in the context of the configured workspaces of the current project while filtering by running only the workspaces defined by this configuration option.
+.P
+Valid values for the \fBworkspace\fR config are either:
+.RS 0
+.IP \(bu 4
+Workspace names
+.IP \(bu 4
+Path to a workspace directory
+.IP \(bu 4
+Path to a parent workspace directory (will result in selecting all workspaces within that folder)
+.RE 0
+
+.P
+When set for the \fBnpm init\fR command, this may be set to the folder of a workspace which does not yet exist, to create the folder and set it up as a brand new workspace within the project.
+.P
+This value is not exported to the environment for child processes.
+.SS "\fBworkspaces\fR"
+.RS 0
+.IP \(bu 4
+Default: null
+.IP \(bu 4
+Type: null or Boolean
+.RE 0
+
+.P
+Set to true to run the command in the context of \fBall\fR configured workspaces.
+.P
+Explicitly setting this to false will cause commands like \fBinstall\fR to ignore workspaces altogether. When not set explicitly:
+.RS 0
+.IP \(bu 4
+Commands that operate on the \fBnode_modules\fR tree (install, update, etc.) will link workspaces into the \fBnode_modules\fR folder. - Commands that do other things (test, exec, publish, etc.) will operate on the root project, \fIunless\fR one or more workspaces are specified in the \fBworkspace\fR config.
+.RE 0
+
+.P
+This value is not exported to the environment for child processes.
+.SH "SEE ALSO"
+.RS 0
+.IP \(bu 4
+npm help "package spec"
+.IP \(bu 4
+npm help "dependency selectors"
+.IP \(bu 4
+\fBpackage.json\fR \fI\(la/configuring-npm/package-json\(ra\fR
+.IP \(bu 4
+npm help workspaces
+.RE 0
diff --git a/deps/npm/man/man1/npm-search.1 b/deps/npm/man/man1/npm-search.1
index b21ea554562f9f..0dfb654fadf452 100644
--- a/deps/npm/man/man1/npm-search.1
+++ b/deps/npm/man/man1/npm-search.1
@@ -1,4 +1,4 @@
-.TH "NPM-SEARCH" "1" "September 2023" "" ""
+.TH "NPM-SEARCH" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-search\fR - Search for packages
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-shrinkwrap.1 b/deps/npm/man/man1/npm-shrinkwrap.1
index 7ed46091e5f6ea..6457db0d7ecd7f 100644
--- a/deps/npm/man/man1/npm-shrinkwrap.1
+++ b/deps/npm/man/man1/npm-shrinkwrap.1
@@ -1,4 +1,4 @@
-.TH "NPM-SHRINKWRAP" "1" "September 2023" "" ""
+.TH "NPM-SHRINKWRAP" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-shrinkwrap\fR - Lock down dependency versions for publication
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-star.1 b/deps/npm/man/man1/npm-star.1
index 4a890b37a86170..5656bc38c20ce6 100644
--- a/deps/npm/man/man1/npm-star.1
+++ b/deps/npm/man/man1/npm-star.1
@@ -1,4 +1,4 @@
-.TH "NPM-STAR" "1" "September 2023" "" ""
+.TH "NPM-STAR" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-star\fR - Mark your favorite packages
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-stars.1 b/deps/npm/man/man1/npm-stars.1
index de27ac0866449a..e57b1311062b70 100644
--- a/deps/npm/man/man1/npm-stars.1
+++ b/deps/npm/man/man1/npm-stars.1
@@ -1,4 +1,4 @@
-.TH "NPM-STARS" "1" "September 2023" "" ""
+.TH "NPM-STARS" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-stars\fR - View packages marked as favorites
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-start.1 b/deps/npm/man/man1/npm-start.1
index ac0a839b353884..d88f1e2478ec73 100644
--- a/deps/npm/man/man1/npm-start.1
+++ b/deps/npm/man/man1/npm-start.1
@@ -1,4 +1,4 @@
-.TH "NPM-START" "1" "September 2023" "" ""
+.TH "NPM-START" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-start\fR - Start a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-stop.1 b/deps/npm/man/man1/npm-stop.1
index 98f444f0863835..4980c16fc6ea90 100644
--- a/deps/npm/man/man1/npm-stop.1
+++ b/deps/npm/man/man1/npm-stop.1
@@ -1,4 +1,4 @@
-.TH "NPM-STOP" "1" "September 2023" "" ""
+.TH "NPM-STOP" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-stop\fR - Stop a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-team.1 b/deps/npm/man/man1/npm-team.1
index 355b25afeb6427..28b7b904fe0456 100644
--- a/deps/npm/man/man1/npm-team.1
+++ b/deps/npm/man/man1/npm-team.1
@@ -1,4 +1,4 @@
-.TH "NPM-TEAM" "1" "September 2023" "" ""
+.TH "NPM-TEAM" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-team\fR - Manage organization teams and team memberships
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-test.1 b/deps/npm/man/man1/npm-test.1
index e9c3734c91912d..f2da6368450065 100644
--- a/deps/npm/man/man1/npm-test.1
+++ b/deps/npm/man/man1/npm-test.1
@@ -1,4 +1,4 @@
-.TH "NPM-TEST" "1" "September 2023" "" ""
+.TH "NPM-TEST" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-test\fR - Test a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-token.1 b/deps/npm/man/man1/npm-token.1
index be7912f43ca11b..8bbfaac64962aa 100644
--- a/deps/npm/man/man1/npm-token.1
+++ b/deps/npm/man/man1/npm-token.1
@@ -1,4 +1,4 @@
-.TH "NPM-TOKEN" "1" "September 2023" "" ""
+.TH "NPM-TOKEN" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-token\fR - Manage your authentication tokens
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-uninstall.1 b/deps/npm/man/man1/npm-uninstall.1
index a8a3ec892d8eee..17e906228b57d2 100644
--- a/deps/npm/man/man1/npm-uninstall.1
+++ b/deps/npm/man/man1/npm-uninstall.1
@@ -1,4 +1,4 @@
-.TH "NPM-UNINSTALL" "1" "September 2023" "" ""
+.TH "NPM-UNINSTALL" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-uninstall\fR - Remove a package
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-unpublish.1 b/deps/npm/man/man1/npm-unpublish.1
index 96d28182b1d468..77eeb843b363b9 100644
--- a/deps/npm/man/man1/npm-unpublish.1
+++ b/deps/npm/man/man1/npm-unpublish.1
@@ -1,4 +1,4 @@
-.TH "NPM-UNPUBLISH" "1" "September 2023" "" ""
+.TH "NPM-UNPUBLISH" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-unpublish\fR - Remove a package from the registry
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-unstar.1 b/deps/npm/man/man1/npm-unstar.1
index 7e9a57782a8e1e..d77464de965580 100644
--- a/deps/npm/man/man1/npm-unstar.1
+++ b/deps/npm/man/man1/npm-unstar.1
@@ -1,4 +1,4 @@
-.TH "NPM-UNSTAR" "1" "September 2023" "" ""
+.TH "NPM-UNSTAR" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-unstar\fR - Remove an item from your favorite packages
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-update.1 b/deps/npm/man/man1/npm-update.1
index 73608d675a64cf..4b59f8600e0a67 100644
--- a/deps/npm/man/man1/npm-update.1
+++ b/deps/npm/man/man1/npm-update.1
@@ -1,4 +1,4 @@
-.TH "NPM-UPDATE" "1" "September 2023" "" ""
+.TH "NPM-UPDATE" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-update\fR - Update packages
 .SS "Synopsis"
@@ -215,6 +215,20 @@ Note that these dependencies \fIare\fR still resolved and added to the \fBpackag
 If a package type appears in both the \fB--include\fR and \fB--omit\fR lists, then it will be included.
 .P
 If the resulting omit list includes \fB'dev'\fR, then the \fBNODE_ENV\fR environment variable will be set to \fB'production'\fR for all lifecycle scripts.
+.SS "\fBinclude\fR"
+.RS 0
+.IP \(bu 4
+Default:
+.IP \(bu 4
+Type: "prod", "dev", "optional", or "peer" (can be set multiple times)
+.RE 0
+
+.P
+Option that allows for defining which types of dependencies to install.
+.P
+This is the inverse of \fB--omit=<type>\fR.
+.P
+Dependency types specified in \fB--include\fR will not be omitted, regardless of the order in which omit/include are specified on the command-line.
 .SS "\fBstrict-peer-deps\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man1/npm-version.1 b/deps/npm/man/man1/npm-version.1
index 3c05ff3809d0c7..03dd68d3e0956a 100644
--- a/deps/npm/man/man1/npm-version.1
+++ b/deps/npm/man/man1/npm-version.1
@@ -1,4 +1,4 @@
-.TH "NPM-VERSION" "1" "September 2023" "" ""
+.TH "NPM-VERSION" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-version\fR - Bump a package version
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-view.1 b/deps/npm/man/man1/npm-view.1
index c1c4d6f199e0ae..73512687904971 100644
--- a/deps/npm/man/man1/npm-view.1
+++ b/deps/npm/man/man1/npm-view.1
@@ -1,4 +1,4 @@
-.TH "NPM-VIEW" "1" "September 2023" "" ""
+.TH "NPM-VIEW" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-view\fR - View registry info
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm-whoami.1 b/deps/npm/man/man1/npm-whoami.1
index 296ee8d5cff88b..67735a171494e1 100644
--- a/deps/npm/man/man1/npm-whoami.1
+++ b/deps/npm/man/man1/npm-whoami.1
@@ -1,4 +1,4 @@
-.TH "NPM-WHOAMI" "1" "September 2023" "" ""
+.TH "NPM-WHOAMI" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-whoami\fR - Display npm username
 .SS "Synopsis"
diff --git a/deps/npm/man/man1/npm.1 b/deps/npm/man/man1/npm.1
index 824d4b8719fce3..740c99ee0be370 100644
--- a/deps/npm/man/man1/npm.1
+++ b/deps/npm/man/man1/npm.1
@@ -1,4 +1,4 @@
-.TH "NPM" "1" "September 2023" "" ""
+.TH "NPM" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpm\fR - javascript package manager
 .SS "Synopsis"
@@ -12,7 +12,7 @@ npm
 Note: This command is unaware of workspaces.
 .SS "Version"
 .P
-10.1.0
+10.2.0
 .SS "Description"
 .P
 npm is the package manager for the Node JavaScript platform. It puts modules in place so that node can find them, and manages dependency conflicts intelligently.
diff --git a/deps/npm/man/man1/npx.1 b/deps/npm/man/man1/npx.1
index d6d0e0d88e0f64..a280ca57f7a7ad 100644
--- a/deps/npm/man/man1/npx.1
+++ b/deps/npm/man/man1/npx.1
@@ -1,4 +1,4 @@
-.TH "NPX" "1" "September 2023" "" ""
+.TH "NPX" "1" "October 2023" "" ""
 .SH "NAME"
 \fBnpx\fR - Run a command from a local or remote npm package
 .SS "Synopsis"
diff --git a/deps/npm/man/man5/folders.5 b/deps/npm/man/man5/folders.5
index 023a0ec693adfd..d3e9e6fc78dffc 100644
--- a/deps/npm/man/man5/folders.5
+++ b/deps/npm/man/man5/folders.5
@@ -1,4 +1,4 @@
-.TH "FOLDERS" "5" "September 2023" "" ""
+.TH "FOLDERS" "5" "October 2023" "" ""
 .SH "NAME"
 \fBfolders\fR - Folder Structures Used by npm
 .SS "Description"
diff --git a/deps/npm/man/man5/install.5 b/deps/npm/man/man5/install.5
index 8343669c716873..3a8da18ba18544 100644
--- a/deps/npm/man/man5/install.5
+++ b/deps/npm/man/man5/install.5
@@ -1,4 +1,4 @@
-.TH "INSTALL" "5" "September 2023" "" ""
+.TH "INSTALL" "5" "October 2023" "" ""
 .SH "NAME"
 \fBinstall\fR - Download and install node and npm
 .SS "Description"
diff --git a/deps/npm/man/man5/npm-global.5 b/deps/npm/man/man5/npm-global.5
index 023a0ec693adfd..d3e9e6fc78dffc 100644
--- a/deps/npm/man/man5/npm-global.5
+++ b/deps/npm/man/man5/npm-global.5
@@ -1,4 +1,4 @@
-.TH "FOLDERS" "5" "September 2023" "" ""
+.TH "FOLDERS" "5" "October 2023" "" ""
 .SH "NAME"
 \fBfolders\fR - Folder Structures Used by npm
 .SS "Description"
diff --git a/deps/npm/man/man5/npm-json.5 b/deps/npm/man/man5/npm-json.5
index 2e6402de50d69e..71d630e750e645 100644
--- a/deps/npm/man/man5/npm-json.5
+++ b/deps/npm/man/man5/npm-json.5
@@ -1,4 +1,4 @@
-.TH "PACKAGE.JSON" "5" "September 2023" "" ""
+.TH "PACKAGE.JSON" "5" "October 2023" "" ""
 .SH "NAME"
 \fBpackage.json\fR - Specifics of npm's package.json handling
 .SS "Description"
diff --git a/deps/npm/man/man5/npm-shrinkwrap-json.5 b/deps/npm/man/man5/npm-shrinkwrap-json.5
index 3f0af1837befc3..8346df052db259 100644
--- a/deps/npm/man/man5/npm-shrinkwrap-json.5
+++ b/deps/npm/man/man5/npm-shrinkwrap-json.5
@@ -1,4 +1,4 @@
-.TH "NPM-SHRINKWRAP.JSON" "5" "September 2023" "" ""
+.TH "NPM-SHRINKWRAP.JSON" "5" "October 2023" "" ""
 .SH "NAME"
 \fBnpm-shrinkwrap.json\fR - A publishable lockfile
 .SS "Description"
diff --git a/deps/npm/man/man5/npmrc.5 b/deps/npm/man/man5/npmrc.5
index 60b1794712d0b6..d7dc344865c4a0 100644
--- a/deps/npm/man/man5/npmrc.5
+++ b/deps/npm/man/man5/npmrc.5
@@ -1,4 +1,4 @@
-.TH "NPMRC" "5" "September 2023" "" ""
+.TH "NPMRC" "5" "October 2023" "" ""
 .SH "NAME"
 \fBnpmrc\fR - The npm config files
 .SS "Description"
diff --git a/deps/npm/man/man5/package-json.5 b/deps/npm/man/man5/package-json.5
index 2e6402de50d69e..71d630e750e645 100644
--- a/deps/npm/man/man5/package-json.5
+++ b/deps/npm/man/man5/package-json.5
@@ -1,4 +1,4 @@
-.TH "PACKAGE.JSON" "5" "September 2023" "" ""
+.TH "PACKAGE.JSON" "5" "October 2023" "" ""
 .SH "NAME"
 \fBpackage.json\fR - Specifics of npm's package.json handling
 .SS "Description"
diff --git a/deps/npm/man/man5/package-lock-json.5 b/deps/npm/man/man5/package-lock-json.5
index bbff439d118161..22ae8cd1dd2d87 100644
--- a/deps/npm/man/man5/package-lock-json.5
+++ b/deps/npm/man/man5/package-lock-json.5
@@ -1,4 +1,4 @@
-.TH "PACKAGE-LOCK.JSON" "5" "September 2023" "" ""
+.TH "PACKAGE-LOCK.JSON" "5" "October 2023" "" ""
 .SH "NAME"
 \fBpackage-lock.json\fR - A manifestation of the manifest
 .SS "Description"
diff --git a/deps/npm/man/man7/config.7 b/deps/npm/man/man7/config.7
index 13acb13c238167..496cfcb4ba71a2 100644
--- a/deps/npm/man/man7/config.7
+++ b/deps/npm/man/man7/config.7
@@ -1,4 +1,4 @@
-.TH "CONFIG" "7" "September 2023" "" ""
+.TH "CONFIG" "7" "October 2023" "" ""
 .SH "NAME"
 \fBconfig\fR - More than you probably want to know about npm configuration
 .SS "Description"
@@ -1355,6 +1355,26 @@ Type: Boolean
 Save installed packages into \fBdependencies\fR specifically. This is useful if a package already exists in \fBdevDependencies\fR or \fBoptionalDependencies\fR, but you want to move it to be a non-optional production dependency.
 .P
 This is the default behavior if \fB--save\fR is true, and neither \fB--save-dev\fR or \fB--save-optional\fR are true.
+.SS "\fBsbom-format\fR"
+.RS 0
+.IP \(bu 4
+Default: null
+.IP \(bu 4
+Type: "cyclonedx" or "spdx"
+.RE 0
+
+.P
+SBOM format to use when generating SBOMs.
+.SS "\fBsbom-type\fR"
+.RS 0
+.IP \(bu 4
+Default: "library"
+.IP \(bu 4
+Type: "library", "application", or "framework"
+.RE 0
+
+.P
+The type of package described by the generated SBOM. For SPDX, this is the value for the \fBprimaryPackagePurpose\fR fieled. For CycloneDX, this is the value for the \fBtype\fR field.
 .SS "\fBscope\fR"
 .RS 0
 .IP \(bu 4
diff --git a/deps/npm/man/man7/dependency-selectors.7 b/deps/npm/man/man7/dependency-selectors.7
index 51b2052587fc57..fe78a200cb682f 100644
--- a/deps/npm/man/man7/dependency-selectors.7
+++ b/deps/npm/man/man7/dependency-selectors.7
@@ -1,4 +1,4 @@
-.TH "QUERYING" "7" "September 2023" "" ""
+.TH "QUERYING" "7" "October 2023" "" ""
 .SH "NAME"
 \fBQuerying\fR - Dependency Selector Syntax & Querying
 .SS "Description"
diff --git a/deps/npm/man/man7/developers.7 b/deps/npm/man/man7/developers.7
index 7902f7258f5776..e0748fe1960c7d 100644
--- a/deps/npm/man/man7/developers.7
+++ b/deps/npm/man/man7/developers.7
@@ -1,4 +1,4 @@
-.TH "DEVELOPERS" "7" "September 2023" "" ""
+.TH "DEVELOPERS" "7" "October 2023" "" ""
 .SH "NAME"
 \fBdevelopers\fR - Developer Guide
 .SS "Description"
diff --git a/deps/npm/man/man7/logging.7 b/deps/npm/man/man7/logging.7
index 81a09df41eb3ce..767759fbb8249d 100644
--- a/deps/npm/man/man7/logging.7
+++ b/deps/npm/man/man7/logging.7
@@ -1,4 +1,4 @@
-.TH "LOGGING" "7" "September 2023" "" ""
+.TH "LOGGING" "7" "October 2023" "" ""
 .SH "NAME"
 \fBLogging\fR - Why, What & How We Log
 .SS "Description"
diff --git a/deps/npm/man/man7/orgs.7 b/deps/npm/man/man7/orgs.7
index 02fa92a4519625..68410b66be297b 100644
--- a/deps/npm/man/man7/orgs.7
+++ b/deps/npm/man/man7/orgs.7
@@ -1,4 +1,4 @@
-.TH "ORGS" "7" "September 2023" "" ""
+.TH "ORGS" "7" "October 2023" "" ""
 .SH "NAME"
 \fBorgs\fR - Working with Teams & Orgs
 .SS "Description"
diff --git a/deps/npm/man/man7/package-spec.7 b/deps/npm/man/man7/package-spec.7
index 67846da9dbe210..212d78dd71bf0b 100644
--- a/deps/npm/man/man7/package-spec.7
+++ b/deps/npm/man/man7/package-spec.7
@@ -1,4 +1,4 @@
-.TH "PACKAGE-SPEC" "7" "September 2023" "" ""
+.TH "PACKAGE-SPEC" "7" "October 2023" "" ""
 .SH "NAME"
 \fBpackage-spec\fR - Package name specifier
 .SS "Description"
diff --git a/deps/npm/man/man7/registry.7 b/deps/npm/man/man7/registry.7
index f0a8460b65464e..f1133f43666af7 100644
--- a/deps/npm/man/man7/registry.7
+++ b/deps/npm/man/man7/registry.7
@@ -1,4 +1,4 @@
-.TH "REGISTRY" "7" "September 2023" "" ""
+.TH "REGISTRY" "7" "October 2023" "" ""
 .SH "NAME"
 \fBregistry\fR - The JavaScript Package Registry
 .SS "Description"
diff --git a/deps/npm/man/man7/removal.7 b/deps/npm/man/man7/removal.7
index d1e3149c6be142..f96bbe84a4ea5a 100644
--- a/deps/npm/man/man7/removal.7
+++ b/deps/npm/man/man7/removal.7
@@ -1,4 +1,4 @@
-.TH "REMOVAL" "7" "September 2023" "" ""
+.TH "REMOVAL" "7" "October 2023" "" ""
 .SH "NAME"
 \fBremoval\fR - Cleaning the Slate
 .SS "Synopsis"
diff --git a/deps/npm/man/man7/scope.7 b/deps/npm/man/man7/scope.7
index 1f2a9565a792c4..c2a6ecd8d25342 100644
--- a/deps/npm/man/man7/scope.7
+++ b/deps/npm/man/man7/scope.7
@@ -1,4 +1,4 @@
-.TH "SCOPE" "7" "September 2023" "" ""
+.TH "SCOPE" "7" "October 2023" "" ""
 .SH "NAME"
 \fBscope\fR - Scoped packages
 .SS "Description"
diff --git a/deps/npm/man/man7/scripts.7 b/deps/npm/man/man7/scripts.7
index 6fdf8c7a903d15..8306b12e37fa8a 100644
--- a/deps/npm/man/man7/scripts.7
+++ b/deps/npm/man/man7/scripts.7
@@ -1,4 +1,4 @@
-.TH "SCRIPTS" "7" "September 2023" "" ""
+.TH "SCRIPTS" "7" "October 2023" "" ""
 .SH "NAME"
 \fBscripts\fR - How npm handles the "scripts" field
 .SS "Description"
diff --git a/deps/npm/man/man7/workspaces.7 b/deps/npm/man/man7/workspaces.7
index cac34f55ad07d4..0558c8446399f6 100644
--- a/deps/npm/man/man7/workspaces.7
+++ b/deps/npm/man/man7/workspaces.7
@@ -1,4 +1,4 @@
-.TH "WORKSPACES" "7" "September 2023" "" ""
+.TH "WORKSPACES" "7" "October 2023" "" ""
 .SH "NAME"
 \fBworkspaces\fR - Working with workspaces
 .SS "Description"
diff --git a/deps/npm/node_modules/@npmcli/agent/lib/agents.js b/deps/npm/node_modules/@npmcli/agent/lib/agents.js
index 7d32768817c18f..15aa8e8764b4d6 100644
--- a/deps/npm/node_modules/@npmcli/agent/lib/agents.js
+++ b/deps/npm/node_modules/@npmcli/agent/lib/agents.js
@@ -1,199 +1,202 @@
 'use strict'
 
-const http = require('http')
-const https = require('https')
 const net = require('net')
 const tls = require('tls')
 const { once } = require('events')
-const { createTimeout, abortRace, urlify, appendPort, cacheAgent } = require('./util')
+const timers = require('timers/promises')
 const { normalizeOptions, cacheOptions } = require('./options')
-const { getProxy, getProxyType, proxyCache } = require('./proxy.js')
+const { getProxy, getProxyAgent, proxyCache } = require('./proxy.js')
 const Errors = require('./errors.js')
+const { Agent: AgentBase } = require('agent-base')
 
-const createAgent = (base, name) => {
-  const SECURE = base === https
-  const SOCKET_TYPE = SECURE ? tls : net
+module.exports = class Agent extends AgentBase {
+  #options
+  #timeouts
+  #proxy
+  #noProxy
+  #ProxyAgent
 
-  const agent = class extends base.Agent {
-    #options
-    #timeouts
-    #proxy
-    #socket
+  constructor (options = {}) {
+    const { timeouts, proxy, noProxy, ...normalizedOptions } = normalizeOptions(options)
 
-    constructor (_options) {
-      const { timeouts, proxy, noProxy, ...options } = normalizeOptions(_options)
+    super(normalizedOptions)
 
-      super(options)
+    this.#options = normalizedOptions
+    this.#timeouts = timeouts
 
-      this.#options = options
-      this.#timeouts = timeouts
-      this.#proxy = proxy ? { proxies: getProxyType(proxy), proxy: urlify(proxy), noProxy } : null
+    if (proxy) {
+      this.#proxy = new URL(proxy)
+      this.#noProxy = noProxy
+      this.#ProxyAgent = getProxyAgent(proxy)
     }
+  }
 
-    get proxy () {
-      return this.#proxy ? { url: this.#proxy.proxy } : {}
-    }
+  get proxy () {
+    return this.#proxy ? { url: this.#proxy } : {}
+  }
 
-    #getProxy (options) {
-      const proxy = this.#proxy
-        ? getProxy(appendPort(`${options.protocol}//${options.host}`, options.port), this.#proxy)
-        : null
+  #getProxy (options) {
+    if (!this.#proxy) {
+      return
+    }
 
-      if (!proxy) {
-        return
-      }
+    const proxy = getProxy(`${options.protocol}//${options.host}:${options.port}`, {
+      proxy: this.#proxy,
+      noProxy: this.#noProxy,
+    })
 
-      return cacheAgent({
-        key: cacheOptions({
-          ...options,
-          ...this.#options,
-          secure: SECURE,
-          timeouts: this.#timeouts,
-          proxy,
-        }),
-        cache: proxyCache,
-        secure: SECURE,
-        proxies: this.#proxy.proxies,
-      }, proxy, this.#options)
+    if (!proxy) {
+      return
     }
 
-    #setKeepAlive (socket) {
-      socket.setKeepAlive(this.keepAlive, this.keepAliveMsecs)
-      socket.setNoDelay(this.keepAlive)
-    }
+    const cacheKey = cacheOptions({
+      ...options,
+      ...this.#options,
+      timeouts: this.#timeouts,
+      proxy,
+    })
 
-    #setIdleTimeout (socket, options) {
-      if (this.#timeouts.idle) {
-        socket.setTimeout(this.#timeouts.idle, () => {
-          socket.destroy(new Errors.IdleTimeoutError(options))
-        })
-      }
+    if (proxyCache.has(cacheKey)) {
+      return proxyCache.get(cacheKey)
     }
 
-    async #proxyConnect (proxy, request, options) {
-      // socks-proxy-agent accepts a dns lookup function
-      options.lookup ??= this.#options.lookup
-
-      // all the proxy agents use this secureEndpoint option to determine
-      // if the proxy should connect over tls or not. we can set it based
-      // on if the HttpAgent or HttpsAgent is used.
-      options.secureEndpoint = SECURE
+    let ProxyAgent = this.#ProxyAgent
+    if (Array.isArray(ProxyAgent)) {
+      ProxyAgent = options.secureEndpoint ? ProxyAgent[1] : ProxyAgent[0]
+    }
 
-      const socket = await abortRace([
-        (ac) => createTimeout(this.#timeouts.connection, ac).catch(() => {
-          throw new Errors.ConnectionTimeoutError(options)
-        }),
-        (ac) => proxy.connect(request, options).then((s) => {
-          this.#setKeepAlive(s)
+    const proxyAgent = new ProxyAgent(proxy, this.#options)
+    proxyCache.set(cacheKey, proxyAgent)
 
-          const connectEvent = SECURE ? 'secureConnect' : 'connect'
-          const connectingEvent = SECURE ? 'secureConnecting' : 'connecting'
+    return proxyAgent
+  }
 
-          if (!s[connectingEvent]) {
-            return s
+  // takes an array of promises and races them against the connection timeout
+  // which will throw the necessary error if it is hit. This will return the
+  // result of the promise race.
+  async #timeoutConnection ({ promises, options, timeout }, ac = new AbortController()) {
+    if (timeout) {
+      const connectionTimeout = timers.setTimeout(timeout, null, { signal: ac.signal })
+        .then(() => {
+          throw new Errors.ConnectionTimeoutError(`${options.host}:${options.port}`)
+        }).catch((err) => {
+          if (err.name === 'AbortError') {
+            return
           }
+          throw err
+        })
+      promises.push(connectionTimeout)
+    }
 
-          return abortRace([
-            () => once(s, 'error', ac).then((err) => {
-              throw err
-            }),
-            () => once(s, connectEvent, ac).then(() => s),
-          ], ac)
-        }),
-      ])
-
-      this.#setIdleTimeout(socket, options)
-
-      return socket
+    let result
+    try {
+      result = await Promise.race(promises)
+      ac.abort()
+    } catch (err) {
+      ac.abort()
+      throw err
     }
+    return result
+  }
 
-    async connect (request, options) {
-      const proxy = this.#getProxy(options)
-      if (proxy) {
-        return this.#proxyConnect(proxy, request, options)
+  async connect (request, options) {
+    // if the connection does not have its own lookup function
+    // set, then use the one from our options
+    options.lookup ??= this.#options.lookup
+
+    let socket
+    let timeout = this.#timeouts.connection
+
+    const proxy = this.#getProxy(options)
+    if (proxy) {
+      // some of the proxies will wait for the socket to fully connect before
+      // returning so we have to await this while also racing it against the
+      // connection timeout.
+      const start = Date.now()
+      socket = await this.#timeoutConnection({
+        options,
+        timeout,
+        promises: [proxy.connect(request, options)],
+      })
+      // see how much time proxy.connect took and subtract it from
+      // the timeout
+      if (timeout) {
+        timeout = timeout - (Date.now() - start)
       }
+    } else {
+      socket = (options.secureEndpoint ? tls : net).connect(options)
+    }
 
-      const socket = SOCKET_TYPE.connect(options)
+    socket.setKeepAlive(this.keepAlive, this.keepAliveMsecs)
+    socket.setNoDelay(this.keepAlive)
 
-      this.#setKeepAlive(socket)
+    const abortController = new AbortController()
+    const { signal } = abortController
 
-      await abortRace([
-        (s) => createTimeout(this.#timeouts.connection, s).catch(() => {
-          throw new Errors.ConnectionTimeoutError(options)
-        }),
-        (s) => once(socket, 'error', s).then((err) => {
-          throw err
-        }),
-        (s) => once(socket, 'connect', s),
-      ])
+    const connectPromise = socket[options.secureEndpoint ? 'secureConnecting' : 'connecting']
+      ? once(socket, options.secureEndpoint ? 'secureConnect' : 'connect', { signal })
+      : Promise.resolve()
 
-      this.#setIdleTimeout(socket, options)
+    await this.#timeoutConnection({
+      options,
+      timeout,
+      promises: [
+        connectPromise,
+        once(socket, 'error', { signal }).then((err) => {
+          throw err[0]
+        }),
+      ],
+    }, abortController)
 
-      return socket
+    if (this.#timeouts.idle) {
+      socket.setTimeout(this.#timeouts.idle, () => {
+        socket.destroy(new Errors.IdleTimeoutError(`${options.host}:${options.port}`))
+      })
     }
 
-    addRequest (request, options) {
-      const proxy = this.#getProxy(options)
-      // it would be better to call proxy.addRequest here but this causes the
-      // http-proxy-agent to call its super.addRequest which causes the request
-      // to be added to the agent twice. since we only support 3 agents
-      // currently (see the required agents in proxy.js) we have manually
-      // checked that the only public methods we need to call are called in the
-      // next block. this could change in the future and presumably we would get
-      // failing tests until we have properly called the necessary methods on
-      // each of our proxy agents
-      if (proxy?.setRequestProps) {
-        proxy.setRequestProps(request, options)
-      }
-
-      request.setHeader('connection', this.keepAlive ? 'keep-alive' : 'close')
-
-      const responseTimeout = createTimeout(this.#timeouts.response)
-      if (responseTimeout) {
-        request.once('finish', () => {
-          responseTimeout.start(() => {
-            request.destroy(new Errors.ResponseTimeoutError(request, this.proxy?.url))
-          })
-        })
-        request.once('response', () => {
-          responseTimeout.clear()
-        })
-      }
-
-      const transferTimeout = createTimeout(this.#timeouts.transfer)
-      if (transferTimeout) {
-        request.once('response', (res) => {
-          transferTimeout.start(() => {
-            res.destroy(new Errors.TransferTimeoutError(request, this.proxy?.url))
-          })
-          res.once('close', () => {
-            transferTimeout.clear()
-          })
-        })
-      }
+    return socket
+  }
 
-      return super.addRequest(request, options)
+  addRequest (request, options) {
+    const proxy = this.#getProxy(options)
+    // it would be better to call proxy.addRequest here but this causes the
+    // http-proxy-agent to call its super.addRequest which causes the request
+    // to be added to the agent twice. since we only support 3 agents
+    // currently (see the required agents in proxy.js) we have manually
+    // checked that the only public methods we need to call are called in the
+    // next block. this could change in the future and presumably we would get
+    // failing tests until we have properly called the necessary methods on
+    // each of our proxy agents
+    if (proxy?.setRequestProps) {
+      proxy.setRequestProps(request, options)
     }
 
-    createSocket (req, options, cb) {
-      return Promise.resolve()
-        .then(() => this.connect(req, options))
-        .then((socket) => {
-          this.#socket = socket
-          return super.createSocket(req, options, cb)
-        }, cb)
+    request.setHeader('connection', this.keepAlive ? 'keep-alive' : 'close')
+
+    if (this.#timeouts.response) {
+      let responseTimeout
+      request.once('finish', () => {
+        setTimeout(() => {
+          request.destroy(new Errors.ResponseTimeoutError(request, this.#proxy))
+        }, this.#timeouts.response)
+      })
+      request.once('response', () => {
+        clearTimeout(responseTimeout)
+      })
     }
 
-    createConnection () {
-      return this.#socket
+    if (this.#timeouts.transfer) {
+      let transferTimeout
+      request.once('response', (res) => {
+        setTimeout(() => {
+          res.destroy(new Errors.TransferTimeoutError(request, this.#proxy))
+        }, this.#timeouts.transfer)
+        res.once('close', () => {
+          clearTimeout(transferTimeout)
+        })
+      })
     }
-  }
 
-  Object.defineProperty(agent, 'name', { value: name })
-  return agent
-}
-
-module.exports = {
-  HttpAgent: createAgent(http, 'HttpAgent'),
-  HttpsAgent: createAgent(https, 'HttpsAgent'),
+    return super.addRequest(request, options)
+  }
 }
diff --git a/deps/npm/node_modules/@npmcli/agent/lib/errors.js b/deps/npm/node_modules/@npmcli/agent/lib/errors.js
index f41b4a065d713e..70475aec8eb357 100644
--- a/deps/npm/node_modules/@npmcli/agent/lib/errors.js
+++ b/deps/npm/node_modules/@npmcli/agent/lib/errors.js
@@ -1,7 +1,5 @@
 'use strict'
 
-const { appendPort } = require('./util')
-
 class InvalidProxyProtocolError extends Error {
   constructor (url) {
     super(`Invalid protocol \`${url.protocol}\` connecting to proxy \`${url.host}\``)
@@ -11,8 +9,7 @@ class InvalidProxyProtocolError extends Error {
 }
 
 class ConnectionTimeoutError extends Error {
-  constructor ({ host, port }) {
-    host = appendPort(host, port)
+  constructor (host) {
     super(`Timeout connecting to host \`${host}\``)
     this.code = 'ECONNECTIONTIMEOUT'
     this.host = host
@@ -20,8 +17,7 @@ class ConnectionTimeoutError extends Error {
 }
 
 class IdleTimeoutError extends Error {
-  constructor ({ host, port }) {
-    host = appendPort(host, port)
+  constructor (host) {
     super(`Idle timeout reached for host \`${host}\``)
     this.code = 'EIDLETIMEOUT'
     this.host = host
diff --git a/deps/npm/node_modules/@npmcli/agent/lib/index.js b/deps/npm/node_modules/@npmcli/agent/lib/index.js
index 2cd69390ea77e9..b33d6eaef07a21 100644
--- a/deps/npm/node_modules/@npmcli/agent/lib/index.js
+++ b/deps/npm/node_modules/@npmcli/agent/lib/index.js
@@ -1,38 +1,48 @@
 'use strict'
 
 const { LRUCache } = require('lru-cache')
-const { urlify, cacheAgent } = require('./util')
 const { normalizeOptions, cacheOptions } = require('./options')
 const { getProxy, proxyCache } = require('./proxy.js')
 const dns = require('./dns.js')
-const { HttpAgent, HttpsAgent } = require('./agents.js')
+const Agent = require('./agents.js')
 
 const agentCache = new LRUCache({ max: 20 })
 
-const getAgent = (url, { agent: _agent, proxy: _proxy, noProxy, ..._options } = {}) => {
+const getAgent = (url, { agent, proxy, noProxy, ...options } = {}) => {
   // false has meaning so this can't be a simple truthiness check
-  if (_agent != null) {
-    return _agent
+  if (agent != null) {
+    return agent
   }
 
-  url = urlify(url)
+  url = new URL(url)
 
-  const secure = url.protocol === 'https:'
-  const proxy = getProxy(url, { proxy: _proxy, noProxy })
-  const options = { ...normalizeOptions(_options), proxy }
+  const proxyForUrl = getProxy(url, { proxy, noProxy })
+  const normalizedOptions = {
+    ...normalizeOptions(options),
+    proxy: proxyForUrl,
+  }
+
+  const cacheKey = cacheOptions({
+    ...normalizedOptions,
+    secureEndpoint: url.protocol === 'https:',
+  })
+
+  if (agentCache.has(cacheKey)) {
+    return agentCache.get(cacheKey)
+  }
+
+  const newAgent = new Agent(normalizedOptions)
+  agentCache.set(cacheKey, newAgent)
 
-  return cacheAgent({
-    key: cacheOptions({ ...options, secure }),
-    cache: agentCache,
-    secure,
-    proxies: [HttpAgent, HttpsAgent],
-  }, options)
+  return newAgent
 }
 
 module.exports = {
   getAgent,
-  HttpAgent,
-  HttpsAgent,
+  Agent,
+  // these are exported for backwards compatability
+  HttpAgent: Agent,
+  HttpsAgent: Agent,
   cache: {
     proxy: proxyCache,
     agent: agentCache,
diff --git a/deps/npm/node_modules/@npmcli/agent/lib/options.js b/deps/npm/node_modules/@npmcli/agent/lib/options.js
index cd87c09d6a25ad..0bf53f725f0846 100644
--- a/deps/npm/node_modules/@npmcli/agent/lib/options.js
+++ b/deps/npm/node_modules/@npmcli/agent/lib/options.js
@@ -1,7 +1,6 @@
 'use strict'
 
 const dns = require('./dns')
-const { createKey } = require('./util')
 
 const normalizeOptions = (opts) => {
   const family = parseInt(opts.family ?? '0', 10)
@@ -41,33 +40,46 @@ const normalizeOptions = (opts) => {
   return normalized
 }
 
-const cacheOptions = (options) => {
-  const { secure } = options
-  return createKey({
-    secure: !!secure,
-    // socket connect options
-    family: options.family,
-    hints: options.hints,
-    localAddress: options.localAddress,
-    // tls specific connect options
-    strictSsl: secure ? !!options.rejectUnauthorized : false,
-    ca: secure ? options.ca : null,
-    cert: secure ? options.cert : null,
-    key: secure ? options.key : null,
-    // http agent options
-    keepAlive: options.keepAlive,
-    keepAliveMsecs: options.keepAliveMsecs,
-    maxSockets: options.maxSockets,
-    maxTotalSockets: options.maxTotalSockets,
-    maxFreeSockets: options.maxFreeSockets,
-    scheduling: options.scheduling,
-    // timeout options
-    timeouts: options.timeouts,
-    // proxy
-    proxy: options.proxy,
-  })
+const createKey = (obj) => {
+  let key = ''
+  const sorted = Object.entries(obj).sort((a, b) => a[0] - b[0])
+  for (let [k, v] of sorted) {
+    if (v == null) {
+      v = 'null'
+    } else if (v instanceof URL) {
+      v = v.toString()
+    } else if (typeof v === 'object') {
+      v = createKey(v)
+    }
+    key += `${k}:${v}:`
+  }
+  return key
 }
 
+const cacheOptions = ({ secureEndpoint, ...options }) => createKey({
+  secureEndpoint: !!secureEndpoint,
+  // socket connect options
+  family: options.family,
+  hints: options.hints,
+  localAddress: options.localAddress,
+  // tls specific connect options
+  strictSsl: secureEndpoint ? !!options.rejectUnauthorized : false,
+  ca: secureEndpoint ? options.ca : null,
+  cert: secureEndpoint ? options.cert : null,
+  key: secureEndpoint ? options.key : null,
+  // http agent options
+  keepAlive: options.keepAlive,
+  keepAliveMsecs: options.keepAliveMsecs,
+  maxSockets: options.maxSockets,
+  maxTotalSockets: options.maxTotalSockets,
+  maxFreeSockets: options.maxFreeSockets,
+  scheduling: options.scheduling,
+  // timeout options
+  timeouts: options.timeouts,
+  // proxy
+  proxy: options.proxy,
+})
+
 module.exports = {
   normalizeOptions,
   cacheOptions,
diff --git a/deps/npm/node_modules/@npmcli/agent/lib/proxy.js b/deps/npm/node_modules/@npmcli/agent/lib/proxy.js
index babedad45ff99f..6272e929e57bcf 100644
--- a/deps/npm/node_modules/@npmcli/agent/lib/proxy.js
+++ b/deps/npm/node_modules/@npmcli/agent/lib/proxy.js
@@ -5,30 +5,27 @@ const { HttpsProxyAgent } = require('https-proxy-agent')
 const { SocksProxyAgent } = require('socks-proxy-agent')
 const { LRUCache } = require('lru-cache')
 const { InvalidProxyProtocolError } = require('./errors.js')
-const { urlify } = require('./util.js')
 
 const PROXY_CACHE = new LRUCache({ max: 20 })
 
-const PROXY_ENV = (() => {
-  const keys = new Set(['https_proxy', 'http_proxy', 'proxy', 'no_proxy'])
-  const values = {}
-  for (let [key, value] of Object.entries(process.env)) {
-    key = key.toLowerCase()
-    if (keys.has(key)) {
-      values[key] = value
-    }
-  }
-  return values
-})()
-
 const SOCKS_PROTOCOLS = new Set(SocksProxyAgent.protocols)
 
-const getProxyType = (url) => {
-  url = urlify(url)
+const PROXY_ENV_KEYS = new Set(['https_proxy', 'http_proxy', 'proxy', 'no_proxy'])
+
+const PROXY_ENV = Object.entries(process.env).reduce((acc, [key, value]) => {
+  key = key.toLowerCase()
+  if (PROXY_ENV_KEYS.has(key)) {
+    acc[key] = value
+  }
+  return acc
+}, {})
+
+const getProxyAgent = (url) => {
+  url = new URL(url)
 
   const protocol = url.protocol.slice(0, -1)
   if (SOCKS_PROTOCOLS.has(protocol)) {
-    return [SocksProxyAgent]
+    return SocksProxyAgent
   }
   if (protocol === 'https' || protocol === 'http') {
     return [HttpProxyAgent, HttpsProxyAgent]
@@ -64,25 +61,28 @@ const isNoProxy = (url, noProxy) => {
   })
 }
 
-const getProxy = (url, {
-  proxy = PROXY_ENV.https_proxy,
-  noProxy = PROXY_ENV.no_proxy,
-}) => {
-  url = urlify(url)
+const getProxy = (url, { proxy, noProxy }) => {
+  url = new URL(url)
+
+  if (!proxy) {
+    proxy = url.protocol === 'https:'
+      ? PROXY_ENV.https_proxy
+      : PROXY_ENV.https_proxy || PROXY_ENV.http_proxy || PROXY_ENV.proxy
+  }
 
-  if (!proxy && url.protocol !== 'https:') {
-    proxy = PROXY_ENV.http_proxy || PROXY_ENV.proxy
+  if (!noProxy) {
+    noProxy = PROXY_ENV.no_proxy
   }
 
   if (!proxy || isNoProxy(url, noProxy)) {
     return null
   }
 
-  return urlify(proxy)
+  return new URL(proxy)
 }
 
 module.exports = {
-  getProxyType,
+  getProxyAgent,
   getProxy,
   proxyCache: PROXY_CACHE,
 }
diff --git a/deps/npm/node_modules/@npmcli/agent/lib/util.js b/deps/npm/node_modules/@npmcli/agent/lib/util.js
deleted file mode 100644
index 6d42a2e202c1f9..00000000000000
--- a/deps/npm/node_modules/@npmcli/agent/lib/util.js
+++ /dev/null
@@ -1,84 +0,0 @@
-'use strict'
-
-const timers = require('timers/promises')
-
-const createKey = (obj) => {
-  let key = ''
-  const sorted = Object.entries(obj).sort((a, b) => a[0] - b[0])
-  for (let [k, v] of sorted) {
-    if (v == null) {
-      v = 'null'
-    } else if (v instanceof URL) {
-      v = v.toString()
-    } else if (typeof v === 'object') {
-      v = createKey(v)
-    }
-    key += `${k}:${v}:`
-  }
-  return key
-}
-
-const createTimeout = (delay, signal) => {
-  if (!delay) {
-    return signal ? new Promise(() => {}) : null
-  }
-
-  if (!signal) {
-    let timeout
-    return {
-      start: (cb) => (timeout = setTimeout(cb, delay)),
-      clear: () => clearTimeout(timeout),
-    }
-  }
-
-  return timers.setTimeout(delay, null, signal)
-    .then(() => {
-      throw new Error()
-    }).catch((err) => {
-      if (err.name === 'AbortError') {
-        return
-      }
-      throw err
-    })
-}
-
-const abortRace = async (promises, ac = new AbortController()) => {
-  let res
-  try {
-    res = await Promise.race(promises.map((p) => p(ac)))
-    ac.abort()
-  } catch (err) {
-    ac.abort()
-    throw err
-  }
-  return res
-}
-
-const urlify = (url) => typeof url === 'string' ? new URL(url) : url
-
-const appendPort = (host, port) => {
-  // istanbul ignore next
-  if (port) {
-    host += `:${port}`
-  }
-  return host
-}
-
-const cacheAgent = ({ key, cache, secure, proxies }, ...args) => {
-  if (cache.has(key)) {
-    return cache.get(key)
-  }
-  const Ctor = (secure ? proxies[1] : proxies[0]) ?? proxies[0]
-  const agent = new Ctor(...args)
-  cache.set(key, agent)
-  return agent
-}
-
-module.exports = {
-  createKey,
-  createTimeout,
-  abortRace,
-  urlify,
-  cacheAgent,
-  appendPort,
-}
diff --git a/deps/npm/node_modules/@npmcli/agent/package.json b/deps/npm/node_modules/@npmcli/agent/package.json
index 32379b39b5b560..7d3d6802947d99 100644
--- a/deps/npm/node_modules/@npmcli/agent/package.json
+++ b/deps/npm/node_modules/@npmcli/agent/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@npmcli/agent",
-  "version": "2.1.1",
+  "version": "2.2.0",
   "description": "the http/https agent used by the npm cli",
   "main": "lib/index.js",
   "scripts": {
@@ -28,17 +28,11 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "publish": "true",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ],
-    "npmSpec": "next-9"
+    "version": "4.19.0",
+    "publish": "true"
   },
   "dependencies": {
+    "agent-base": "^7.1.0",
     "http-proxy-agent": "^7.0.0",
     "https-proxy-agent": "^7.0.1",
     "lru-cache": "^10.0.1",
@@ -46,10 +40,11 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "minipass-fetch": "^3.0.3",
     "nock": "^13.2.7",
-    "simple-socks": "^2.2.2",
+    "semver": "^7.5.4",
+    "simple-socks": "^3.1.0",
     "tap": "^16.3.0"
   },
   "repository": {
diff --git a/deps/npm/node_modules/@npmcli/arborist/lib/arborist/audit.js b/deps/npm/node_modules/@npmcli/arborist/lib/arborist/audit.js
index eb4a3565531cc9..af260bdc996fc7 100644
--- a/deps/npm/node_modules/@npmcli/arborist/lib/arborist/audit.js
+++ b/deps/npm/node_modules/@npmcli/arborist/lib/arborist/audit.js
@@ -22,7 +22,15 @@ module.exports = cls => class Auditor extends cls {
     options = { ...this.options, ...options }
 
     process.emit('time', 'audit')
-    const tree = await this.loadVirtual()
+    let tree
+    if (options.packageLock === false) {
+      // build ideal tree
+      await this.loadActual(options)
+      await this.buildIdealTree()
+      tree = this.idealTree
+    } else {
+      tree = await this.loadVirtual()
+    }
     if (this[_workspaces] && this[_workspaces].length) {
       options.filterSet = this.workspaceDependencySet(
         tree,
diff --git a/deps/npm/node_modules/@npmcli/arborist/lib/query-selector-all.js b/deps/npm/node_modules/@npmcli/arborist/lib/query-selector-all.js
index 36334e5a859f1d..96c52144060b80 100644
--- a/deps/npm/node_modules/@npmcli/arborist/lib/query-selector-all.js
+++ b/deps/npm/node_modules/@npmcli/arborist/lib/query-selector-all.js
@@ -695,7 +695,11 @@ const depTypes = {
 // the compare nodes array
 const hasParent = (node, compareNodes) => {
   // All it takes is one so we loop and return on the first hit
-  for (const compareNode of compareNodes) {
+  for (let compareNode of compareNodes) {
+    if (compareNode.isLink) {
+      compareNode = compareNode.target
+    }
+
     // follows logical parent for link anscestors
     if (node.isTop && (node.resolveParent === compareNode)) {
       return true
@@ -719,7 +723,10 @@ const hasAscendant = (node, compareNodes, seen = new Set()) => {
   }
 
   if (node.isTop && node.resolveParent) {
-    return hasAscendant(node.resolveParent, compareNodes)
+    /* istanbul ignore if - investigate if linksIn check obviates need for this */
+    if (hasAscendant(node.resolveParent, compareNodes)) {
+      return true
+    }
   }
   for (const edge of node.edgesIn) {
     // TODO Need a test with an infinite loop
@@ -731,6 +738,11 @@ const hasAscendant = (node, compareNodes, seen = new Set()) => {
       return true
     }
   }
+  for (const linkNode of node.linksIn) {
+    if (hasAscendant(linkNode, compareNodes, seen)) {
+      return true
+    }
+  }
   return false
 }
 
diff --git a/deps/npm/node_modules/@npmcli/arborist/package.json b/deps/npm/node_modules/@npmcli/arborist/package.json
index 24a442a7d88500..95d9bc7416905b 100644
--- a/deps/npm/node_modules/@npmcli/arborist/package.json
+++ b/deps/npm/node_modules/@npmcli/arborist/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@npmcli/arborist",
-  "version": "7.1.0",
+  "version": "7.2.0",
   "description": "Manage node_modules trees",
   "dependencies": {
     "@isaacs/string-locale-compare": "^1.1.0",
@@ -11,18 +11,18 @@
     "@npmcli/name-from-folder": "^2.0.0",
     "@npmcli/node-gyp": "^3.0.0",
     "@npmcli/package-json": "^5.0.0",
-    "@npmcli/query": "^3.0.0",
+    "@npmcli/query": "^3.0.1",
     "@npmcli/run-script": "^7.0.1",
     "bin-links": "^4.0.1",
     "cacache": "^18.0.0",
     "common-ancestor-path": "^1.0.1",
-    "hosted-git-info": "^7.0.0",
+    "hosted-git-info": "^7.0.1",
     "json-parse-even-better-errors": "^3.0.0",
     "json-stringify-nice": "^1.1.4",
     "minimatch": "^9.0.0",
     "nopt": "^7.0.0",
     "npm-install-checks": "^6.2.0",
-    "npm-package-arg": "^11.0.0",
+    "npm-package-arg": "^11.0.1",
     "npm-pick-manifest": "^9.0.0",
     "npm-registry-fetch": "^16.0.0",
     "npmlog": "^7.0.1",
@@ -39,7 +39,7 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "benchmark": "^2.1.4",
     "minify-registry-metadata": "^3.0.0",
     "nock": "^13.3.3",
@@ -90,13 +90,7 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   }
 }
diff --git a/deps/npm/node_modules/@npmcli/config/lib/definitions/definitions.js b/deps/npm/node_modules/@npmcli/config/lib/definitions/definitions.js
index e6b9859dc1dfb9..c5b8d4f779b92b 100644
--- a/deps/npm/node_modules/@npmcli/config/lib/definitions/definitions.js
+++ b/deps/npm/node_modules/@npmcli/config/lib/definitions/definitions.js
@@ -963,6 +963,7 @@ define('include-workspace-root', {
 
 define('init-author-email', {
   default: '',
+  hint: '<email>',
   type: String,
   description: `
     The value \`npm init\` should use by default for the package author's
@@ -972,6 +973,7 @@ define('init-author-email', {
 
 define('init-author-name', {
   default: '',
+  hint: '<name>',
   type: String,
   description: `
     The value \`npm init\` should use by default for the package author's name.
@@ -981,6 +983,7 @@ define('init-author-name', {
 define('init-author-url', {
   default: '',
   type: ['', url],
+  hint: '<url>',
   description: `
     The value \`npm init\` should use by default for the package author's homepage.
   `,
@@ -988,6 +991,7 @@ define('init-author-url', {
 
 define('init-license', {
   default: 'ISC',
+  hint: '<license>',
   type: String,
   description: `
     The value \`npm init\` should use by default for the package license.
@@ -997,6 +1001,7 @@ define('init-license', {
 define('init-module', {
   default: '~/.npm-init.js',
   type: path,
+  hint: '<module>',
   description: `
     A module that will be loaded by the \`npm init\` command.  See the
     documentation for the
@@ -1008,6 +1013,7 @@ define('init-module', {
 define('init-version', {
   default: '1.0.0',
   type: semver,
+  hint: '<version>',
   description: `
     The value that \`npm init\` should use by default for the package
     version number, if not already set in package.json.
@@ -1207,6 +1213,33 @@ define('local-address', {
   flatten,
 })
 
+define('sbom-format', {
+  default: null,
+  type: [
+    'cyclonedx',
+    'spdx',
+  ],
+  description: `
+    SBOM format to use when generating SBOMs.
+  `,
+  flatten,
+})
+
+define('sbom-type', {
+  default: 'library',
+  type: [
+    'library',
+    'application',
+    'framework',
+  ],
+  description: `
+    The type of package described by the generated SBOM. For SPDX, this is the
+    value for the \`primaryPackagePurpose\` fieled. For CycloneDX, this is the
+    value for the \`type\` field.
+  `,
+  flatten,
+})
+
 define('location', {
   default: 'user',
   short: 'L',
diff --git a/deps/npm/node_modules/@npmcli/config/package.json b/deps/npm/node_modules/@npmcli/config/package.json
index d2e7066b654d1b..85af7ee1c7d405 100644
--- a/deps/npm/node_modules/@npmcli/config/package.json
+++ b/deps/npm/node_modules/@npmcli/config/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@npmcli/config",
-  "version": "7.2.0",
+  "version": "8.0.0",
   "files": [
     "bin/",
     "lib/"
@@ -19,8 +19,8 @@
     "snap": "tap",
     "lint": "eslint \"**/*.js\"",
     "postlint": "template-oss-check",
-    "lintfix": "node ../.. run lint -- --fix",
-    "posttest": "node ../.. run lint",
+    "lintfix": "npm run lint -- --fix",
+    "posttest": "npm run lint",
     "template-oss-apply": "template-oss-apply --force"
   },
   "tap": {
@@ -32,7 +32,7 @@
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
     "@npmcli/mock-globals": "^1.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "tap": "^16.3.8"
   },
   "dependencies": {
@@ -46,10 +46,12 @@
     "walk-up-path": "^3.0.1"
   },
   "engines": {
-    "node": "^14.17.0 || ^16.13.0 || >=18.0.0"
+    "node": "^16.14.0 || >=18.0.0"
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0"
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js",
+    "npm": "npm"
   }
 }
diff --git a/deps/npm/node_modules/@npmcli/query/lib/index.js b/deps/npm/node_modules/@npmcli/query/lib/index.js
index 9373a4f7adbf0d..c7888d5bb5de6d 100644
--- a/deps/npm/node_modules/@npmcli/query/lib/index.js
+++ b/deps/npm/node_modules/@npmcli/query/lib/index.js
@@ -85,31 +85,57 @@ const fixupNestedPseudo = astNode => {
   transformAst(newRootNode)
 }
 
-// :semver(<version|range>, [selector], [function])
+// :semver(<version|range|selector>, [version|range|selector], [function])
+// note: the first or second parameter must be a static version or range
 const fixupSemverSpecs = astNode => {
-  // the first child node contains the version or range, most likely as a tag and a series of
-  // classes. we combine them into a single string here. this is the only required input.
-  const children = astNode.nodes.shift().nodes
-  const value = children.reduce((res, i) => `${res}${String(i)}`, '')
-
-  // next, if we have 2 nodes left then the user called us with a total of 3. that means the
-  // last one tells us what specific semver function the user is requesting, so we pull that out
-  let semverFunc
-  if (astNode.nodes.length === 2) {
+  // if we have three nodes, the last is the semver function to use, pull that out first
+  if (astNode.nodes.length === 3) {
     const funcNode = astNode.nodes.pop().nodes[0]
     if (funcNode.type === 'tag') {
-      semverFunc = funcNode.value
+      astNode.semverFunc = funcNode.value
+    } else if (funcNode.type === 'string') {
+      // a string is always in some type of quotes, we don't want those so slice them off
+      astNode.semverFunc = funcNode.value.slice(1, -1)
+    } else {
+      // anything that isn't a tag or a string isn't a function name
+      throw Object.assign(
+        new Error('`:semver` pseudo-class expects a function name as last value'),
+        { code: 'ESEMVERFUNC' }
+      )
+    }
+  }
+
+  // now if we have 1 node, it's a static value
+  // istanbul ignore else
+  if (astNode.nodes.length === 1) {
+    const semverNode = astNode.nodes.pop()
+    astNode.semverValue = semverNode.nodes.reduce((res, next) => `${res}${String(next)}`, '')
+  } else if (astNode.nodes.length === 2) {
+    // and if we have two nodes, one of them is a static value and we need to determine which it is
+    for (let i = 0; i < astNode.nodes.length; ++i) {
+      const type = astNode.nodes[i].nodes[0].type
+      // the type of the first child may be combinator for ranges, such as >14
+      if (type === 'tag' || type === 'combinator') {
+        const semverNode = astNode.nodes.splice(i, 1)[0]
+        astNode.semverValue = semverNode.nodes.reduce((res, next) => `${res}${String(next)}`, '')
+        astNode.semverPosition = i
+        break
+      }
+    }
+
+    if (typeof astNode.semverValue === 'undefined') {
+      throw Object.assign(
+        new Error('`:semver` pseudo-class expects a static value in the first or second position'),
+        { code: 'ESEMVERVALUE' }
+      )
     }
   }
 
-  // now if there's a node left, that node is our selector. since that is the last remaining
-  // child node, we call fixupAttr on ourselves so that the attribute selectors get parsed
+  // if we got here, the last remaining child should be attribute selector
   if (astNode.nodes.length === 1) {
     fixupAttr(astNode)
   } else {
-    // we weren't provided a selector, so we default to `[version]`. note, there's no default
-    // operator here. that's because we don't know yet if the user has provided us a version
-    // or range to assert against
+    // if we don't have a selector, we default to `[version]`
     astNode.attributeMatcher = {
       insensitive: false,
       attribute: 'version',
@@ -118,8 +144,6 @@ const fixupSemverSpecs = astNode => {
     astNode.lookupProperties = []
   }
 
-  astNode.semverFunc = semverFunc
-  astNode.semverValue = value
   astNode.nodes.length = 0
 }
 
diff --git a/deps/npm/node_modules/@npmcli/query/package.json b/deps/npm/node_modules/@npmcli/query/package.json
index 1e4abd37656f62..5f9fb2744538a2 100644
--- a/deps/npm/node_modules/@npmcli/query/package.json
+++ b/deps/npm/node_modules/@npmcli/query/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@npmcli/query",
-  "version": "3.0.0",
+  "version": "3.0.1",
   "description": "npm query parser and tools",
   "main": "lib/index.js",
   "scripts": {
@@ -39,11 +39,12 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.5.1"
+    "version": "4.18.0",
+    "publish": true
   },
   "devDependencies": {
-    "@npmcli/eslint-config": "^3.0.1",
-    "@npmcli/template-oss": "4.5.1",
+    "@npmcli/eslint-config": "^4.0.0",
+    "@npmcli/template-oss": "4.18.0",
     "tap": "^16.2.0"
   },
   "dependencies": {
diff --git a/deps/npm/node_modules/glob/README.md b/deps/npm/node_modules/glob/README.md
index 1bde1494664d4d..9f6e80fe665672 100644
--- a/deps/npm/node_modules/glob/README.md
+++ b/deps/npm/node_modules/glob/README.md
@@ -89,7 +89,7 @@ g3.stream().on('data', path => {
 const results = await glob('**', { stat: true, withFileTypes: true })
 
 const timeSortedFiles = results
-  .sort((a, b) => a.mtimeMS - b.mtimeMS)
+  .sort((a, b) => a.mtimeMs - b.mtimeMs)
   .map(path => path.fullpath())
 
 const groupReadableFiles = results
diff --git a/deps/npm/node_modules/glob/dist/cjs/package.json b/deps/npm/node_modules/glob/dist/cjs/package.json
deleted file mode 100644
index c15df94a3582bf..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/package.json
+++ /dev/null
@@ -1,4 +0,0 @@
-{
-  "version": "10.3.3",
-  "type": "commonjs"
-}
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/bin.d.ts b/deps/npm/node_modules/glob/dist/cjs/src/bin.d.ts
deleted file mode 100644
index 34e005228653c8..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/bin.d.ts
+++ /dev/null
@@ -1,3 +0,0 @@
-#!/usr/bin/env node
-export {};
-//# sourceMappingURL=bin.d.ts.map
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/bin.d.ts.map b/deps/npm/node_modules/glob/dist/cjs/src/bin.d.ts.map
deleted file mode 100644
index c10c656ec75109..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/bin.d.ts.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"bin.d.ts","sourceRoot":"","sources":["../../../src/bin.ts"],"names":[],"mappings":""}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/bin.js.map b/deps/npm/node_modules/glob/dist/cjs/src/bin.js.map
deleted file mode 100644
index e189acfd01b1a7..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/bin.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"bin.js","sourceRoot":"","sources":["../../../src/bin.ts"],"names":[],"mappings":";;;AACA,uDAAkD;AAClD,2BAA+B;AAC/B,yCAAgC;AAChC,kDAAyC;AACzC,yCAAuC;AAEvC,MAAM,CAAC,GAAG,IAAA,gBAAI,EAAC;IACb,KAAK,EAAE,4CAA4C;CACpD,CAAC;KACC,WAAW,CACV;YACQ,sBAAO;;;;GAIhB,CACA;KACA,GAAG,CAAC;IACH,GAAG,EAAE;QACH,KAAK,EAAE,GAAG;QACV,IAAI,EAAE,SAAS;QACf,WAAW,EAAE;0CACuB;KACrC;CACF,CAAC;KACD,GAAG,CAAC;IACH,OAAO,EAAE;QACP,KAAK,EAAE,GAAG;QACV,IAAI,EAAE,SAAS;QACf,WAAW,EAAE;iCACc;KAC5B;CACF,CAAC;KACD,IAAI,CAAC;IACJ,GAAG,EAAE;QACH,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;;;;;;;;;;;;;;;;;;;OAqBZ;KACF;IACD,QAAQ,EAAE;QACR,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,0BAA0B;KACxC;IACD,cAAc,EAAE;QACd,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,kCAAkC;KAChD;IACD,IAAI,EAAE;QACJ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,uCAAuC;KACrD;IACD,KAAK,EAAE;QACL,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;;;OAKZ;KACF;IAED,MAAM,EAAE;QACN,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,kDAAkD;KAChE;IACD,QAAQ,EAAE;QACR,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;+DAG4C;KAC1D;IACD,IAAI,EAAE;QACJ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;wDACqC;KACnD;IACD,YAAY,EAAE;QACZ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;;OAIZ;KACF;IAED,GAAG,EAAE;QACH,WAAW,EAAE;;OAEZ;KACF;IACD,OAAO,EAAE;QACP,WAAW,EAAE,8BAA8B;KAC5C;IACD,MAAM,EAAE;QACN,WAAW,EAAE;;;;;;;;;OASZ;KACF;IACD,KAAK,EAAE;QACL,WAAW,EAAE;;;;OAIZ;KACF;IACD,KAAK,EAAE;QACL,WAAW,EAAE,kDAAkD;KAChE;IACD,UAAU,EAAE;QACV,WAAW,EAAE;0DACuC;KACrD;IACD,wBAAwB,EAAE;QACxB,WAAW,EAAE;;sDAEmC;KACjD;CACF,CAAC;KACD,GAAG,CAAC;IACH,WAAW,EAAE;QACX,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;sCACmB;KACjC;CACF,CAAC;KACD,GAAG,CAAC;IACH,GAAG,EAAE;QACH,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,+CAA+C;QAC5D,OAAO,EAAE,OAAO,CAAC,GAAG,EAAE;KACvB;IACD,IAAI,EAAE;QACJ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;;;;;;;;;;;;;;;;;OAmBZ;KACF;IACD,QAAQ,EAAE;QACR,WAAW,EAAE;;uEAEoD;QACjE,QAAQ,EAAE,CAAC,CAAC,EAAE,CACZ,IAAI,GAAG,CAAC;YACN,KAAK;YACL,SAAS;YACT,QAAQ;YACR,SAAS;YACT,OAAO;YACP,OAAO;YACP,SAAS;YACT,OAAO;YACP,OAAO;YACP,QAAQ;YACR,QAAQ;SACT,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACZ;CACF,CAAC;KACD,OAAO,CAAC;IACP,MAAM,EAAE;QACN,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,yBAAyB;KACvC;CACF,CAAC;KACD,IAAI,CAAC;IACJ,KAAK,EAAE;QACL,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;yEACsD;KACpE;CACF,CAAC;KACD,IAAI,CAAC;IACJ,IAAI,EAAE;QACJ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,6BAA6B;KAC3C;CACF,CAAC,CAAA;AAEJ,IAAI;IACF,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,CAAA;IACzC,IAAI,MAAM,CAAC,IAAI,EAAE;QACf,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;QACtB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;KAChB;IACD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO;QAC7C,MAAM,sBAAsB,CAAA;IAC9B,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO;QAC5C,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG;QACzB,CAAC,CAAC,WAAW;QACb,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAA,eAAU,EAAC,CAAC,CAAC,CAAC,CAAA;IAC3C,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,eAAU,EAAC,CAAC,CAAC,CAAC,CAAA;IACxE,MAAM,MAAM,GAAG,IAAA,qBAAU,EAAC,QAAQ,EAAE;QAClC,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC;QACnC,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,SAAS,EAAE,MAAM,CAAC,YAAY,CAAC;QAC/B,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC;QAC7B,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,UAAU,EAAE,MAAM,CAAC,UAAU;QAC7B,QAAQ,EAAE,MAAM,CAAC,QAAuC;QACxD,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,KAAK,EAAE,MAAM,CAAC,KAAK;KACpB,CAAC,CAAA;IAEF,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAA;IACtB,IAAI,CAAC,GAAG,EAAE;QACR,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;KACvC;SAAM;QACL,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,IAAA,kCAAe,EAAC,GAAG,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;KACvE;CACF;AAAC,OAAO,CAAC,EAAE;IACV,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;IACxB,OAAO,CAAC,KAAK,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IACzD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;CAChB","sourcesContent":["#!/usr/bin/env node\nimport { foregroundChild } from 'foreground-child'\nimport { existsSync } from 'fs'\nimport { jack } from 'jackspeak'\nimport { version } from '../package.json'\nimport { globStream } from './index.js'\n\nconst j = jack({\n  usage: 'glob [options] [<pattern> [<pattern> ...]]',\n})\n  .description(\n    `\n    Glob v${version}\n\n    Expand the positional glob expression arguments into any matching file\n    system paths found.\n  `\n  )\n  .opt({\n    cmd: {\n      short: 'c',\n      hint: 'command',\n      description: `Run the command provided, passing the glob expression\n                    matches as arguments.`,\n    },\n  })\n  .opt({\n    default: {\n      short: 'p',\n      hint: 'pattern',\n      description: `If no positional arguments are provided, glob will use\n                    this pattern`,\n    },\n  })\n  .flag({\n    all: {\n      short: 'A',\n      description: `By default, the glob cli command will not expand any\n                    arguments that are an exact match to a file on disk.\n\n                    This prevents double-expanding, in case the shell expands\n                    an argument whose filename is a glob expression.\n\n                    For example, if 'app/*.ts' would match 'app/[id].ts', then\n                    on Windows powershell or cmd.exe, 'glob app/*.ts' will\n                    expand to 'app/[id].ts', as expected. However, in posix\n                    shells such as bash or zsh, the shell will first expand\n                    'app/*.ts' to a list of filenames. Then glob will look\n                    for a file matching 'app/[id].ts' (ie, 'app/i.ts' or\n                    'app/d.ts'), which is unexpected.\n\n                    Setting '--all' prevents this behavior, causing glob\n                    to treat ALL patterns as glob expressions to be expanded,\n                    even if they are an exact match to a file on disk.\n\n                    When setting this option, be sure to enquote arguments\n                    so that the shell will not expand them prior to passing\n                    them to the glob command process.\n      `,\n    },\n    absolute: {\n      short: 'a',\n      description: 'Expand to absolute paths',\n    },\n    'dot-relative': {\n      short: 'd',\n      description: `Prepend './' on relative matches`,\n    },\n    mark: {\n      short: 'm',\n      description: `Append a / on any directories matched`,\n    },\n    posix: {\n      short: 'x',\n      description: `Always resolve to posix style paths, using '/' as the\n                    directory separator, even on Windows. Drive letter\n                    absolute matches on Windows will be expanded to their\n                    full resolved UNC maths, eg instead of 'C:\\\\foo\\\\bar',\n                    it will expand to '//?/C:/foo/bar'.\n      `,\n    },\n\n    follow: {\n      short: 'f',\n      description: `Follow symlinked directories when expanding '**'`,\n    },\n    realpath: {\n      short: 'R',\n      description: `Call 'fs.realpath' on all of the results. In the case\n                    of an entry that cannot be resolved, the entry is\n                    omitted. This incurs a slight performance penalty, of\n                    course, because of the added system calls.`,\n    },\n    stat: {\n      short: 's',\n      description: `Call 'fs.lstat' on all entries, whether required or not\n                    to determine if it's a valid match.`,\n    },\n    'match-base': {\n      short: 'b',\n      description: `Perform a basename-only match if the pattern does not\n                    contain any slash characters. That is, '*.js' would be\n                    treated as equivalent to '**/*.js', matching js files\n                    in all directories.\n      `,\n    },\n\n    dot: {\n      description: `Allow patterns to match files/directories that start\n                    with '.', even if the pattern does not start with '.'\n      `,\n    },\n    nobrace: {\n      description: 'Do not expand {...} patterns',\n    },\n    nocase: {\n      description: `Perform a case-insensitive match. This defaults to\n                    'true' on macOS and Windows platforms, and false on\n                    all others.\n\n                    Note: 'nocase' should only be explicitly set when it is\n                    known that the filesystem's case sensitivity differs\n                    from the platform default. If set 'true' on\n                    case-insensitive file systems, then the walk may return\n                    more or less results than expected.\n      `,\n    },\n    nodir: {\n      description: `Do not match directories, only files.\n\n                    Note: to *only* match directories, append a '/' at the\n                    end of the pattern.\n      `,\n    },\n    noext: {\n      description: `Do not expand extglob patterns, such as '+(a|b)'`,\n    },\n    noglobstar: {\n      description: `Do not expand '**' against multiple path portions.\n                    Ie, treat it as a normal '*' instead.`,\n    },\n    'windows-path-no-escape': {\n      description: `Use '\\\\' as a path separator *only*, and *never* as an\n                    escape character. If set, all '\\\\' characters are\n                    replaced with '/' in the pattern.`,\n    },\n  })\n  .num({\n    'max-depth': {\n      short: 'D',\n      description: `Maximum depth to traverse from the current\n                    working directory`,\n    },\n  })\n  .opt({\n    cwd: {\n      short: 'C',\n      description: 'Current working directory to execute/match in',\n      default: process.cwd(),\n    },\n    root: {\n      short: 'r',\n      description: `A string path resolved against the 'cwd', which is\n                    used as the starting point for absolute patterns that\n                    start with '/' (but not drive letters or UNC paths\n                    on Windows).\n\n                    Note that this *doesn't* necessarily limit the walk to\n                    the 'root' directory, and doesn't affect the cwd\n                    starting point for non-absolute patterns. A pattern\n                    containing '..' will still be able to traverse out of\n                    the root directory, if it is not an actual root directory\n                    on the filesystem, and any non-absolute patterns will\n                    still be matched in the 'cwd'.\n\n                    To start absolute and non-absolute patterns in the same\n                    path, you can use '--root=' to set it to the empty\n                    string. However, be aware that on Windows systems, a\n                    pattern like 'x:/*' or '//host/share/*' will *always*\n                    start in the 'x:/' or '//host/share/' directory,\n                    regardless of the --root setting.\n      `,\n    },\n    platform: {\n      description: `Defaults to the value of 'process.platform' if\n                    available, or 'linux' if not. Setting --platform=win32\n                    on non-Windows systems may cause strange behavior!`,\n      validate: v =>\n        new Set([\n          'aix',\n          'android',\n          'darwin',\n          'freebsd',\n          'haiku',\n          'linux',\n          'openbsd',\n          'sunos',\n          'win32',\n          'cygwin',\n          'netbsd',\n        ]).has(v),\n    },\n  })\n  .optList({\n    ignore: {\n      short: 'i',\n      description: `Glob patterns to ignore`,\n    },\n  })\n  .flag({\n    debug: {\n      short: 'v',\n      description: `Output a huge amount of noisy debug information about\n                    patterns as they are parsed and used to match files.`,\n    },\n  })\n  .flag({\n    help: {\n      short: 'h',\n      description: 'Show this usage information',\n    },\n  })\n\ntry {\n  const { positionals, values } = j.parse()\n  if (values.help) {\n    console.log(j.usage())\n    process.exit(0)\n  }\n  if (positionals.length === 0 && !values.default)\n    throw 'No patterns provided'\n  if (positionals.length === 0 && values.default)\n    positionals.push(values.default)\n  const patterns = values.all\n    ? positionals\n    : positionals.filter(p => !existsSync(p))\n  const matches = values.all ? [] : positionals.filter(p => existsSync(p))\n  const stream = globStream(patterns, {\n    absolute: values.absolute,\n    cwd: values.cwd,\n    dot: values.dot,\n    dotRelative: values['dot-relative'],\n    follow: values.follow,\n    ignore: values.ignore,\n    mark: values.mark,\n    matchBase: values['match-base'],\n    maxDepth: values['max-depth'],\n    nobrace: values.nobrace,\n    nocase: values.nocase,\n    nodir: values.nodir,\n    noext: values.noext,\n    noglobstar: values.noglobstar,\n    platform: values.platform as undefined | NodeJS.Platform,\n    realpath: values.realpath,\n    root: values.root,\n    stat: values.stat,\n    debug: values.debug,\n    posix: values.posix,\n  })\n\n  const cmd = values.cmd\n  if (!cmd) {\n    matches.forEach(m => console.log(m))\n    stream.on('data', f => console.log(f))\n  } else {\n    stream.on('data', f => matches.push(f))\n    stream.on('end', () => foregroundChild(cmd, matches, { shell: true }))\n  }\n} catch (e) {\n  console.error(j.usage())\n  console.error(e instanceof Error ? e.message : String(e))\n  process.exit(1)\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/glob.d.ts.map b/deps/npm/node_modules/glob/dist/cjs/src/glob.d.ts.map
deleted file mode 100644
index 6353d8b3c47126..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/glob.d.ts.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"glob.d.ts","sourceRoot":"","sources":["../../../src/glob.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,SAAS,EAAoB,MAAM,WAAW,CAAA;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EACL,QAAQ,EACR,IAAI,EACJ,UAAU,EAIX,MAAM,aAAa,CAAA;AAEpB,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAGtC,MAAM,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;AACvC,MAAM,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,SAAS,CAAC,CAAA;AAWlE;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAElB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAE5B;;;;;OAKG;IACH,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,CAAA;IAElB;;;;OAIG;IACH,GAAG,CAAC,EAAE,OAAO,CAAA;IAEb;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,OAAO,CAAA;IAErB;;;;;;;;OAQG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IAEvC;;;;;OAKG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;OAGG;IACH,IAAI,CAAC,EAAE,OAAO,CAAA;IAEd;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,CAAA;IAEnB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;IAEjB;;;;;;;;;OASG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;OAEG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;;;;OAKG;IACH,UAAU,CAAC,EAAE,OAAO,CAAA;IAEpB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAA;IAE1B;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAElB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,IAAI,CAAC,EAAE,MAAM,CAAA;IAEb;;;;;OAKG;IACH,MAAM,CAAC,EAAE,UAAU,CAAA;IAEnB;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,OAAO,CAAA;IAEd;;;OAGG;IACH,MAAM,CAAC,EAAE,WAAW,CAAA;IAEpB;;;;;;;;;;;;;OAaG;IACH,oBAAoB,CAAC,EAAE,OAAO,CAAA;IAE9B;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;OAGG;IACH,EAAE,CAAC,EAAE,QAAQ,CAAA;IAEb;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;;;;;;OAOG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;CAChB;AAED,MAAM,MAAM,4BAA4B,GAAG,WAAW,GAAG;IACvD,aAAa,EAAE,IAAI,CAAA;IAEnB,QAAQ,CAAC,EAAE,SAAS,CAAA;IACpB,IAAI,CAAC,EAAE,SAAS,CAAA;IAChB,KAAK,CAAC,EAAE,SAAS,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG,WAAW,GAAG;IACxD,aAAa,CAAC,EAAE,KAAK,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG,WAAW,GAAG;IACxD,aAAa,CAAC,EAAE,SAAS,CAAA;CAC1B,CAAA;AAED,MAAM,MAAM,MAAM,CAAC,IAAI,IAAI,IAAI,SAAS,4BAA4B,GAChE,IAAI,GACJ,IAAI,SAAS,6BAA6B,GAC1C,MAAM,GACN,IAAI,SAAS,6BAA6B,GAC1C,MAAM,GACN,MAAM,GAAG,IAAI,CAAA;AACjB,MAAM,MAAM,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAA;AAE1C,MAAM,MAAM,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,4BAA4B,GACnE,IAAI,GACJ,IAAI,SAAS,6BAA6B,GAC1C,KAAK,GACL,IAAI,SAAS,6BAA6B,GAC1C,KAAK,GACL,OAAO,CAAA;AAEX;;GAEG;AACH,qBAAa,IAAI,CAAC,IAAI,SAAS,WAAW,CAAE,YAAW,WAAW;IAChE,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,GAAG,EAAE,MAAM,CAAA;IACX,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,OAAO,CAAA;IACZ,WAAW,EAAE,OAAO,CAAA;IACpB,MAAM,EAAE,OAAO,CAAA;IACf,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IACvC,aAAa,EAAE,OAAO,CAAA;IACtB,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,SAAS,EAAE,OAAO,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,OAAO,EAAE,OAAO,CAAA;IAChB,MAAM,EAAE,OAAO,CAAA;IACf,KAAK,EAAE,OAAO,CAAA;IACd,KAAK,EAAE,OAAO,CAAA;IACd,UAAU,EAAE,OAAO,CAAA;IACnB,OAAO,EAAE,MAAM,EAAE,CAAA;IACjB,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAA;IACzB,QAAQ,EAAE,OAAO,CAAA;IACjB,MAAM,EAAE,UAAU,CAAA;IAClB,IAAI,EAAE,OAAO,CAAA;IACb,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,oBAAoB,EAAE,OAAO,CAAA;IAC7B,aAAa,EAAE,SAAS,CAAC,IAAI,CAAC,CAAA;IAE9B;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;IAEV;;OAEG;IACH,QAAQ,EAAE,OAAO,EAAE,CAAA;IAEnB;;;;;;;;;;;OAWG;gBACS,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,IAAI,EAAE,IAAI;IAwHlD;;OAEG;IACG,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAmBpC;;OAEG;IACH,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAezB;;OAEG;IACH,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAa9C;;OAEG;IACH,UAAU,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAalD;;;OAGG;IACH,WAAW,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IAGlD,CAAC,MAAM,CAAC,QAAQ,CAAC;IAIjB;;;OAGG;IACH,OAAO,IAAI,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IAGnD,CAAC,MAAM,CAAC,aAAa,CAAC;CAGvB"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/glob.js.map b/deps/npm/node_modules/glob/dist/cjs/src/glob.js.map
deleted file mode 100644
index 7a7a9b28627480..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/glob.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"glob.js","sourceRoot":"","sources":["../../../src/glob.ts"],"names":[],"mappings":";;;AAAA,yCAAuD;AAEvD,6CAOoB;AACpB,6BAAmC;AAEnC,6CAAsC;AACtC,2CAAoD;AAKpD,4CAA4C;AAC5C,gDAAgD;AAChD,MAAM,eAAe,GACnB,OAAO,OAAO,KAAK,QAAQ;IAC3B,OAAO;IACP,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;IAClC,CAAC,CAAC,OAAO,CAAC,QAAQ;IAClB,CAAC,CAAC,OAAO,CAAA;AAgTb;;GAEG;AACH,MAAa,IAAI;IACf,QAAQ,CAAU;IAClB,GAAG,CAAQ;IACX,IAAI,CAAS;IACb,GAAG,CAAS;IACZ,WAAW,CAAS;IACpB,MAAM,CAAS;IACf,MAAM,CAAiC;IACvC,aAAa,CAAS;IACtB,IAAI,CAAU;IACd,SAAS,CAAS;IAClB,QAAQ,CAAQ;IAChB,OAAO,CAAS;IAChB,MAAM,CAAS;IACf,KAAK,CAAS;IACd,KAAK,CAAS;IACd,UAAU,CAAS;IACnB,OAAO,CAAU;IACjB,QAAQ,CAAiB;IACzB,QAAQ,CAAS;IACjB,MAAM,CAAY;IAClB,IAAI,CAAS;IACb,MAAM,CAAc;IACpB,oBAAoB,CAAS;IAC7B,aAAa,CAAiB;IAE9B;;OAEG;IACH,IAAI,CAAM;IAEV;;OAEG;IACH,QAAQ,CAAW;IAEnB;;;;;;;;;;;OAWG;IACH,YAAY,OAA0B,EAAE,IAAU;QAChD,qBAAqB;QACrB,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,SAAS,CAAC,uBAAuB,CAAC,CAAA;QACvD,oBAAoB;QACpB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAgC,CAAA;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;QACrB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAA;QACrC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QACvB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YACb,IAAI,CAAC,GAAG,GAAG,EAAE,CAAA;SACd;aAAM,IAAI,IAAI,CAAC,GAAG,YAAY,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE;YACpE,IAAI,CAAC,GAAG,GAAG,IAAA,mBAAa,EAAC,IAAI,CAAC,GAAG,CAAC,CAAA;SACnC;QACD,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,EAAE,CAAA;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAa,CAAA;QACzC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAA;QAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAE7B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAA;QACnC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAA;QACjC,IAAI,CAAC,QAAQ;YACX,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAA;QAC9D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAEzB,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YACrD,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;SAC9D;QAED,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;YAC/B,OAAO,GAAG,CAAC,OAAO,CAAC,CAAA;SACpB;QAED,IAAI,CAAC,oBAAoB;YACvB,CAAC,CAAC,IAAI,CAAC,oBAAoB;gBAC1B,IAAoB,CAAC,kBAAkB,KAAK,KAAK,CAAA;QAEpD,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC7B,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;SAClD;QAED,IAAI,IAAI,CAAC,SAAS,EAAE;YAClB,IAAI,IAAI,CAAC,UAAU,EAAE;gBACnB,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAA;aACvD;YACD,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAA;SAChE;QAED,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAEtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,eAAe,CAAA;QAChD,IAAI,CAAC,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAA;QAChD,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YACzB,IACE,IAAI,CAAC,MAAM,KAAK,SAAS;gBACzB,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAClC;gBACA,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAA;aACpE;SACF;aAAM;YACL,MAAM,MAAM,GACV,IAAI,CAAC,QAAQ,KAAK,OAAO;gBACvB,CAAC,CAAC,6BAAe;gBACjB,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBAC5B,CAAC,CAAC,8BAAgB;oBAClB,CAAC,CAAC,IAAI,CAAC,QAAQ;wBACf,CAAC,CAAC,6BAAe;wBACjB,CAAC,CAAC,wBAAU,CAAA;YAChB,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;gBACjC,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,EAAE,EAAE,IAAI,CAAC,EAAE;aACZ,CAAC,CAAA;SACH;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QAEhC,8DAA8D;QAC9D,0DAA0D;QAC1D,6DAA6D;QAC7D,kCAAkC;QAClC,MAAM,eAAe,GACnB,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAA;QAEzD,MAAM,GAAG,GAAqB;YAC5B,mCAAmC;YACnC,GAAG,IAAI;YACP,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,eAAe;YACf,SAAS,EAAE,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI;YACd,iBAAiB,EAAE,CAAC;YACpB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,oBAAoB,EAAE,IAAI,CAAC,oBAAoB;YAC/C,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;SACzB,CAAA;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,qBAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QACxD,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,GAAG,CAAC,MAAM,CACtC,CAAC,GAA0B,EAAE,CAAC,EAAE,EAAE;YAChC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YACrB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAA;YAC3B,OAAO,GAAG,CAAA;QACZ,CAAC,EACD,CAAC,EAAE,EAAE,EAAE,CAAC,CACT,CAAA;QACD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACtC,OAAO,IAAI,oBAAO,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QACzD,CAAC,CAAC,CAAA;IACJ,CAAC;IAMD,KAAK,CAAC,IAAI;QACR,kEAAkE;QAClE,iEAAiE;QACjE,uEAAuE;QACvE,sCAAsC;QACtC,OAAO;YACL,GAAG,CAAC,MAAM,IAAI,sBAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;gBACvD,GAAG,IAAI,CAAC,IAAI;gBACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;oBACzC,CAAC,CAAC,QAAQ;gBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC,IAAI,EAAE,CAAC;SACX,CAAA;IACH,CAAC;IAMD,QAAQ;QACN,OAAO;YACL,GAAG,IAAI,sBAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;gBAChD,GAAG,IAAI,CAAC,IAAI;gBACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;oBACzC,CAAC,CAAC,QAAQ;gBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC,QAAQ,EAAE;SACd,CAAA;IACH,CAAC;IAMD,MAAM;QACJ,OAAO,IAAI,sBAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpD,GAAG,IAAI,CAAC,IAAI;YACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;gBACzC,CAAC,CAAC,QAAQ;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,MAAM,EAAE,CAAA;IACb,CAAC;IAMD,UAAU;QACR,OAAO,IAAI,sBAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpD,GAAG,IAAI,CAAC,IAAI;YACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;gBACzC,CAAC,CAAC,QAAQ;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,UAAU,EAAE,CAAA;IACjB,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IACD,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,WAAW,EAAE,CAAA;IAC3B,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAA;IAC9C,CAAC;IACD,CAAC,MAAM,CAAC,aAAa,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;IACvB,CAAC;CACF;AArQD,oBAqQC","sourcesContent":["import { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport {\n  FSOption,\n  Path,\n  PathScurry,\n  PathScurryDarwin,\n  PathScurryPosix,\n  PathScurryWin32,\n} from 'path-scurry'\nimport { fileURLToPath } from 'url'\nimport { IgnoreLike } from './ignore.js'\nimport { Pattern } from './pattern.js'\nimport { GlobStream, GlobWalker } from './walker.js'\n\nexport type MatchSet = Minimatch['set']\nexport type GlobParts = Exclude<Minimatch['globParts'], undefined>\n\n// if no process global, just call it linux.\n// so we default to case-sensitive, / separators\nconst defaultPlatform: NodeJS.Platform =\n  typeof process === 'object' &&\n  process &&\n  typeof process.platform === 'string'\n    ? process.platform\n    : 'linux'\n\n/**\n * A `GlobOptions` object may be provided to any of the exported methods, and\n * must be provided to the `Glob` constructor.\n *\n * All options are optional, boolean, and false by default, unless otherwise\n * noted.\n *\n * All resolved options are added to the Glob object as properties.\n *\n * If you are running many `glob` operations, you can pass a Glob object as the\n * `options` argument to a subsequent operation to share the previously loaded\n * cache.\n */\nexport interface GlobOptions {\n  /**\n   * Set to `true` to always receive absolute paths for\n   * matched files. Set to `false` to always return relative paths.\n   *\n   * When this option is not set, absolute paths are returned for patterns\n   * that are absolute, and otherwise paths are returned that are relative\n   * to the `cwd` setting.\n   *\n   * This does _not_ make an extra system call to get\n   * the realpath, it only does string path resolution.\n   *\n   * Conflicts with {@link withFileTypes}\n   */\n  absolute?: boolean\n\n  /**\n   * Set to false to enable {@link windowsPathsNoEscape}\n   *\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n\n  /**\n   * The current working directory in which to search. Defaults to\n   * `process.cwd()`.\n   *\n   * May be eiher a string path or a `file://` URL object or string.\n   */\n  cwd?: string | URL\n\n  /**\n   * Include `.dot` files in normal matches and `globstar`\n   * matches. Note that an explicit dot in a portion of the pattern\n   * will always match dot files.\n   */\n  dot?: boolean\n\n  /**\n   * Prepend all relative path strings with `./` (or `.\\` on Windows).\n   *\n   * Without this option, returned relative paths are \"bare\", so instead of\n   * returning `'./foo/bar'`, they are returned as `'foo/bar'`.\n   *\n   * Relative patterns starting with `'../'` are not prepended with `./`, even\n   * if this option is set.\n   */\n  dotRelative?: boolean\n\n  /**\n   * Follow symlinked directories when expanding `**`\n   * patterns. This can result in a lot of duplicate references in\n   * the presence of cyclic links, and make performance quite bad.\n   *\n   * By default, a `**` in a pattern will follow 1 symbolic link if\n   * it is not the first item in the pattern, or none if it is the\n   * first item in the pattern, following the same behavior as Bash.\n   */\n  follow?: boolean\n\n  /**\n   * string or string[], or an object with `ignore` and `ignoreChildren`\n   * methods.\n   *\n   * If a string or string[] is provided, then this is treated as a glob\n   * pattern or array of glob patterns to exclude from matches. To ignore all\n   * children within a directory, as well as the entry itself, append `'/**'`\n   * to the ignore pattern.\n   *\n   * **Note** `ignore` patterns are _always_ in `dot:true` mode, regardless of\n   * any other settings.\n   *\n   * If an object is provided that has `ignored(path)` and/or\n   * `childrenIgnored(path)` methods, then these methods will be called to\n   * determine whether any Path is a match or if its children should be\n   * traversed, respectively.\n   */\n  ignore?: string | string[] | IgnoreLike\n\n  /**\n   * Treat brace expansion like `{a,b}` as a \"magic\" pattern. Has no\n   * effect if {@link nobrace} is set.\n   *\n   * Only has effect on the {@link hasMagic} function.\n   */\n  magicalBraces?: boolean\n\n  /**\n   * Add a `/` character to directory matches. Note that this requires\n   * additional stat calls in some cases.\n   */\n  mark?: boolean\n\n  /**\n   * Perform a basename-only match if the pattern does not contain any slash\n   * characters. That is, `*.js` would be treated as equivalent to\n   * `**\\/*.js`, matching all js files in all directories.\n   */\n  matchBase?: boolean\n\n  /**\n   * Limit the directory traversal to a given depth below the cwd.\n   * Note that this does NOT prevent traversal to sibling folders,\n   * root patterns, and so on. It only limits the maximum folder depth\n   * that the walk will descend, relative to the cwd.\n   */\n  maxDepth?: number\n\n  /**\n   * Do not expand `{a,b}` and `{1..3}` brace sets.\n   */\n  nobrace?: boolean\n\n  /**\n   * Perform a case-insensitive match. This defaults to `true` on macOS and\n   * Windows systems, and `false` on all others.\n   *\n   * **Note** `nocase` should only be explicitly set when it is\n   * known that the filesystem's case sensitivity differs from the\n   * platform default. If set `true` on case-sensitive file\n   * systems, or `false` on case-insensitive file systems, then the\n   * walk may return more or less results than expected.\n   */\n  nocase?: boolean\n\n  /**\n   * Do not match directories, only files. (Note: to match\n   * _only_ directories, put a `/` at the end of the pattern.)\n   */\n  nodir?: boolean\n\n  /**\n   * Do not match \"extglob\" patterns such as `+(a|b)`.\n   */\n  noext?: boolean\n\n  /**\n   * Do not match `**` against multiple filenames. (Ie, treat it as a normal\n   * `*` instead.)\n   *\n   * Conflicts with {@link matchBase}\n   */\n  noglobstar?: boolean\n\n  /**\n   * Defaults to value of `process.platform` if available, or `'linux'` if\n   * not. Setting `platform:'win32'` on non-Windows systems may cause strange\n   * behavior.\n   */\n  platform?: NodeJS.Platform\n\n  /**\n   * Set to true to call `fs.realpath` on all of the\n   * results. In the case of an entry that cannot be resolved, the\n   * entry is omitted. This incurs a slight performance penalty, of\n   * course, because of the added system calls.\n   */\n  realpath?: boolean\n\n  /**\n   *\n   * A string path resolved against the `cwd` option, which\n   * is used as the starting point for absolute patterns that start\n   * with `/`, (but not drive letters or UNC paths on Windows).\n   *\n   * Note that this _doesn't_ necessarily limit the walk to the\n   * `root` directory, and doesn't affect the cwd starting point for\n   * non-absolute patterns. A pattern containing `..` will still be\n   * able to traverse out of the root directory, if it is not an\n   * actual root directory on the filesystem, and any non-absolute\n   * patterns will be matched in the `cwd`. For example, the\n   * pattern `/../*` with `{root:'/some/path'}` will return all\n   * files in `/some`, not all files in `/some/path`. The pattern\n   * `*` with `{root:'/some/path'}` will return all the entries in\n   * the cwd, not the entries in `/some/path`.\n   *\n   * To start absolute and non-absolute patterns in the same\n   * path, you can use `{root:''}`. However, be aware that on\n   * Windows systems, a pattern like `x:/*` or `//host/share/*` will\n   * _always_ start in the `x:/` or `//host/share` directory,\n   * regardless of the `root` setting.\n   */\n  root?: string\n\n  /**\n   * A [PathScurry](http://npm.im/path-scurry) object used\n   * to traverse the file system. If the `nocase` option is set\n   * explicitly, then any provided `scurry` object must match this\n   * setting.\n   */\n  scurry?: PathScurry\n\n  /**\n   * Call `lstat()` on all entries, whether required or not to determine\n   * if it's a valid match. When used with {@link withFileTypes}, this means\n   * that matches will include data such as modified time, permissions, and\n   * so on.  Note that this will incur a performance cost due to the added\n   * system calls.\n   */\n  stat?: boolean\n\n  /**\n   * An AbortSignal which will cancel the Glob walk when\n   * triggered.\n   */\n  signal?: AbortSignal\n\n  /**\n   * Use `\\\\` as a path separator _only_, and\n   *  _never_ as an escape character. If set, all `\\\\` characters are\n   *  replaced with `/` in the pattern.\n   *\n   *  Note that this makes it **impossible** to match against paths\n   *  containing literal glob pattern characters, but allows matching\n   *  with patterns constructed using `path.join()` and\n   *  `path.resolve()` on Windows platforms, mimicking the (buggy!)\n   *  behavior of Glob v7 and before on Windows. Please use with\n   *  caution, and be mindful of [the caveat below about Windows\n   *  paths](#windows). (For legacy reasons, this is also set if\n   *  `allowWindowsEscape` is set to the exact value `false`.)\n   */\n  windowsPathsNoEscape?: boolean\n\n  /**\n   * Return [PathScurry](http://npm.im/path-scurry)\n   * `Path` objects instead of strings. These are similar to a\n   * NodeJS `Dirent` object, but with additional methods and\n   * properties.\n   *\n   * Conflicts with {@link absolute}\n   */\n  withFileTypes?: boolean\n\n  /**\n   * An fs implementation to override some or all of the defaults.  See\n   * http://npm.im/path-scurry for details about what can be overridden.\n   */\n  fs?: FSOption\n\n  /**\n   * Just passed along to Minimatch.  Note that this makes all pattern\n   * matching operations slower and *extremely* noisy.\n   */\n  debug?: boolean\n\n  /**\n   * Return `/` delimited paths, even on Windows.\n   *\n   * On posix systems, this has no effect.  But, on Windows, it means that\n   * paths will be `/` delimited, and absolute paths will be their full\n   * resolved UNC forms, eg instead of `'C:\\\\foo\\\\bar'`, it would return\n   * `'//?/C:/foo/bar'`\n   */\n  posix?: boolean\n}\n\nexport type GlobOptionsWithFileTypesTrue = GlobOptions & {\n  withFileTypes: true\n  // string options not relevant if returning Path objects.\n  absolute?: undefined\n  mark?: undefined\n  posix?: undefined\n}\n\nexport type GlobOptionsWithFileTypesFalse = GlobOptions & {\n  withFileTypes?: false\n}\n\nexport type GlobOptionsWithFileTypesUnset = GlobOptions & {\n  withFileTypes?: undefined\n}\n\nexport type Result<Opts> = Opts extends GlobOptionsWithFileTypesTrue\n  ? Path\n  : Opts extends GlobOptionsWithFileTypesFalse\n  ? string\n  : Opts extends GlobOptionsWithFileTypesUnset\n  ? string\n  : string | Path\nexport type Results<Opts> = Result<Opts>[]\n\nexport type FileTypes<Opts> = Opts extends GlobOptionsWithFileTypesTrue\n  ? true\n  : Opts extends GlobOptionsWithFileTypesFalse\n  ? false\n  : Opts extends GlobOptionsWithFileTypesUnset\n  ? false\n  : boolean\n\n/**\n * An object that can perform glob pattern traversals.\n */\nexport class Glob<Opts extends GlobOptions> implements GlobOptions {\n  absolute?: boolean\n  cwd: string\n  root?: string\n  dot: boolean\n  dotRelative: boolean\n  follow: boolean\n  ignore?: string | string[] | IgnoreLike\n  magicalBraces: boolean\n  mark?: boolean\n  matchBase: boolean\n  maxDepth: number\n  nobrace: boolean\n  nocase: boolean\n  nodir: boolean\n  noext: boolean\n  noglobstar: boolean\n  pattern: string[]\n  platform: NodeJS.Platform\n  realpath: boolean\n  scurry: PathScurry\n  stat: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape: boolean\n  withFileTypes: FileTypes<Opts>\n\n  /**\n   * The options provided to the constructor.\n   */\n  opts: Opts\n\n  /**\n   * An array of parsed immutable {@link Pattern} objects.\n   */\n  patterns: Pattern[]\n\n  /**\n   * All options are stored as properties on the `Glob` object.\n   *\n   * See {@link GlobOptions} for full options descriptions.\n   *\n   * Note that a previous `Glob` object can be passed as the\n   * `GlobOptions` to another `Glob` instantiation to re-use settings\n   * and caches with a new pattern.\n   *\n   * Traversal functions can be called multiple times to run the walk\n   * again.\n   */\n  constructor(pattern: string | string[], opts: Opts) {\n    /* c8 ignore start */\n    if (!opts) throw new TypeError('glob options required')\n    /* c8 ignore stop */\n    this.withFileTypes = !!opts.withFileTypes as FileTypes<Opts>\n    this.signal = opts.signal\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.dotRelative = !!opts.dotRelative\n    this.nodir = !!opts.nodir\n    this.mark = !!opts.mark\n    if (!opts.cwd) {\n      this.cwd = ''\n    } else if (opts.cwd instanceof URL || opts.cwd.startsWith('file://')) {\n      opts.cwd = fileURLToPath(opts.cwd)\n    }\n    this.cwd = opts.cwd || ''\n    this.root = opts.root\n    this.magicalBraces = !!opts.magicalBraces\n    this.nobrace = !!opts.nobrace\n    this.noext = !!opts.noext\n    this.realpath = !!opts.realpath\n    this.absolute = opts.absolute\n\n    this.noglobstar = !!opts.noglobstar\n    this.matchBase = !!opts.matchBase\n    this.maxDepth =\n      typeof opts.maxDepth === 'number' ? opts.maxDepth : Infinity\n    this.stat = !!opts.stat\n    this.ignore = opts.ignore\n\n    if (this.withFileTypes && this.absolute !== undefined) {\n      throw new Error('cannot set absolute and withFileTypes:true')\n    }\n\n    if (typeof pattern === 'string') {\n      pattern = [pattern]\n    }\n\n    this.windowsPathsNoEscape =\n      !!opts.windowsPathsNoEscape ||\n      (opts as GlobOptions).allowWindowsEscape === false\n\n    if (this.windowsPathsNoEscape) {\n      pattern = pattern.map(p => p.replace(/\\\\/g, '/'))\n    }\n\n    if (this.matchBase) {\n      if (opts.noglobstar) {\n        throw new TypeError('base matching requires globstar')\n      }\n      pattern = pattern.map(p => (p.includes('/') ? p : `./**/${p}`))\n    }\n\n    this.pattern = pattern\n\n    this.platform = opts.platform || defaultPlatform\n    this.opts = { ...opts, platform: this.platform }\n    if (opts.scurry) {\n      this.scurry = opts.scurry\n      if (\n        opts.nocase !== undefined &&\n        opts.nocase !== opts.scurry.nocase\n      ) {\n        throw new Error('nocase option contradicts provided scurry option')\n      }\n    } else {\n      const Scurry =\n        opts.platform === 'win32'\n          ? PathScurryWin32\n          : opts.platform === 'darwin'\n          ? PathScurryDarwin\n          : opts.platform\n          ? PathScurryPosix\n          : PathScurry\n      this.scurry = new Scurry(this.cwd, {\n        nocase: opts.nocase,\n        fs: opts.fs,\n      })\n    }\n    this.nocase = this.scurry.nocase\n\n    // If you do nocase:true on a case-sensitive file system, then\n    // we need to use regexps instead of strings for non-magic\n    // path portions, because statting `aBc` won't return results\n    // for the file `AbC` for example.\n    const nocaseMagicOnly =\n      this.platform === 'darwin' || this.platform === 'win32'\n\n    const mmo: MinimatchOptions = {\n      // default nocase based on platform\n      ...opts,\n      dot: this.dot,\n      matchBase: this.matchBase,\n      nobrace: this.nobrace,\n      nocase: this.nocase,\n      nocaseMagicOnly,\n      nocomment: true,\n      noext: this.noext,\n      nonegate: true,\n      optimizationLevel: 2,\n      platform: this.platform,\n      windowsPathsNoEscape: this.windowsPathsNoEscape,\n      debug: !!this.opts.debug,\n    }\n\n    const mms = this.pattern.map(p => new Minimatch(p, mmo))\n    const [matchSet, globParts] = mms.reduce(\n      (set: [MatchSet, GlobParts], m) => {\n        set[0].push(...m.set)\n        set[1].push(...m.globParts)\n        return set\n      },\n      [[], []]\n    )\n    this.patterns = matchSet.map((set, i) => {\n      return new Pattern(set, globParts[i], 0, this.platform)\n    })\n  }\n\n  /**\n   * Returns a Promise that resolves to the results array.\n   */\n  async walk(): Promise<Results<Opts>>\n  async walk(): Promise<(string | Path)[]> {\n    // Walkers always return array of Path objects, so we just have to\n    // coerce them into the right shape.  It will have already called\n    // realpath() if the option was set to do so, so we know that's cached.\n    // start out knowing the cwd, at least\n    return [\n      ...(await new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity\n            ? this.maxDepth + this.scurry.cwd.depth()\n            : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n      }).walk()),\n    ]\n  }\n\n  /**\n   * synchronous {@link Glob.walk}\n   */\n  walkSync(): Results<Opts>\n  walkSync(): (string | Path)[] {\n    return [\n      ...new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity\n            ? this.maxDepth + this.scurry.cwd.depth()\n            : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n      }).walkSync(),\n    ]\n  }\n\n  /**\n   * Stream results asynchronously.\n   */\n  stream(): Minipass<Result<Opts>, Result<Opts>>\n  stream(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity\n          ? this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n    }).stream()\n  }\n\n  /**\n   * Stream results synchronously.\n   */\n  streamSync(): Minipass<Result<Opts>, Result<Opts>>\n  streamSync(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity\n          ? this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n    }).streamSync()\n  }\n\n  /**\n   * Default sync iteration function. Returns a Generator that\n   * iterates over the results.\n   */\n  iterateSync(): Generator<Result<Opts>, void, void> {\n    return this.streamSync()[Symbol.iterator]()\n  }\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  /**\n   * Default async iteration function. Returns an AsyncGenerator that\n   * iterates over the results.\n   */\n  iterate(): AsyncGenerator<Result<Opts>, void, void> {\n    return this.stream()[Symbol.asyncIterator]()\n  }\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/has-magic.d.ts.map b/deps/npm/node_modules/glob/dist/cjs/src/has-magic.d.ts.map
deleted file mode 100644
index dd5053f80b44c3..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/has-magic.d.ts.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"has-magic.d.ts","sourceRoot":"","sources":["../../../src/has-magic.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA;AAEvC;;;;;;;;;;GAUG;AACH,eAAO,MAAM,QAAQ,YACV,MAAM,GAAG,MAAM,EAAE,YACjB,WAAW,KACnB,OAQF,CAAA"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/has-magic.js.map b/deps/npm/node_modules/glob/dist/cjs/src/has-magic.js.map
deleted file mode 100644
index 9b73cfad7d05e4..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/has-magic.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"has-magic.js","sourceRoot":"","sources":["../../../src/has-magic.ts"],"names":[],"mappings":";;;AAAA,yCAAqC;AAGrC;;;;;;;;;;GAUG;AACI,MAAM,QAAQ,GAAG,CACtB,OAA0B,EAC1B,UAAuB,EAAE,EAChB,EAAE;IACX,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;QAC3B,OAAO,GAAG,CAAC,OAAO,CAAC,CAAA;KACpB;IACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;QACvB,IAAI,IAAI,qBAAS,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,QAAQ,EAAE;YAAE,OAAO,IAAI,CAAA;KACtD;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAXY,QAAA,QAAQ,YAWpB","sourcesContent":["import { Minimatch } from 'minimatch'\nimport { GlobOptions } from './glob.js'\n\n/**\n * Return true if the patterns provided contain any magic glob characters,\n * given the options provided.\n *\n * Brace expansion is not considered \"magic\" unless the `magicalBraces` option\n * is set, as brace expansion just turns one string into an array of strings.\n * So a pattern like `'x{a,b}y'` would return `false`, because `'xay'` and\n * `'xby'` both do not contain any magic glob characters, and it's treated the\n * same as if you had called it on `['xay', 'xby']`. When `magicalBraces:true`\n * is in the options, brace expansion _is_ treated as a pattern having magic.\n */\nexport const hasMagic = (\n  pattern: string | string[],\n  options: GlobOptions = {}\n): boolean => {\n  if (!Array.isArray(pattern)) {\n    pattern = [pattern]\n  }\n  for (const p of pattern) {\n    if (new Minimatch(p, options).hasMagic()) return true\n  }\n  return false\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/ignore.d.ts.map b/deps/npm/node_modules/glob/dist/cjs/src/ignore.d.ts.map
deleted file mode 100644
index 3d604838d1eed2..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/ignore.d.ts.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ignore.d.ts","sourceRoot":"","sources":["../../../src/ignore.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAElC,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAE5C,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAA;IAC9B,eAAe,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAA;CACvC;AASD;;GAEG;AACH,qBAAa,MAAO,YAAW,UAAU;IACvC,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,gBAAgB,EAAE,SAAS,EAAE,CAAA;IAC7B,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,gBAAgB,EAAE,SAAS,EAAE,CAAA;gBAG3B,OAAO,EAAE,MAAM,EAAE,EACjB,EACE,OAAO,EACP,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAA0B,GAC3B,EAAE,cAAc;IAiDnB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO;IAczB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO;CAWlC"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/ignore.js.map b/deps/npm/node_modules/glob/dist/cjs/src/ignore.js.map
deleted file mode 100644
index 7595b4c68f79ed..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/ignore.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ignore.js","sourceRoot":"","sources":["../../../src/ignore.ts"],"names":[],"mappings":";AAAA,sDAAsD;AACtD,kCAAkC;AAClC,kEAAkE;AAClE,6CAA6C;;;AAE7C,yCAAqC;AAErC,6CAAsC;AAQtC,MAAM,eAAe,GACnB,OAAO,OAAO,KAAK,QAAQ;IAC3B,OAAO;IACP,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;IAClC,CAAC,CAAC,OAAO,CAAC,QAAQ;IAClB,CAAC,CAAC,OAAO,CAAA;AAEb;;GAEG;AACH,MAAa,MAAM;IACjB,QAAQ,CAAa;IACrB,gBAAgB,CAAa;IAC7B,QAAQ,CAAa;IACrB,gBAAgB,CAAa;IAE7B,YACE,OAAiB,EACjB,EACE,OAAO,EACP,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAAQ,GAAG,eAAe,GACX;QAEjB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;QAC1B,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;QAC1B,MAAM,MAAM,GAAG;YACb,GAAG,EAAE,IAAI;YACT,OAAO;YACP,MAAM;YACN,KAAK;YACL,UAAU;YACV,iBAAiB,EAAE,CAAC;YACpB,QAAQ;YACR,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,IAAI;SACf,CAAA;QAED,mEAAmE;QACnE,gEAAgE;QAChE,mEAAmE;QACnE,uCAAuC;QACvC,mEAAmE;QACnE,qEAAqE;QACrE,uBAAuB;QACvB,uEAAuE;QACvE,oEAAoE;QACpE,qBAAqB;QACrB,sEAAsE;QACtE,wCAAwC;QACxC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;YACzB,MAAM,EAAE,GAAG,IAAI,qBAAS,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACxB,MAAM,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;gBACjC,MAAM,CAAC,GAAG,IAAI,oBAAO,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;gBACrD,MAAM,CAAC,GAAG,IAAI,qBAAS,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,MAAM,CAAC,CAAA;gBAC/C,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAA;gBACzD,MAAM,QAAQ,GAAG,CAAC,CAAC,UAAU,EAAE,CAAA;gBAC/B,IAAI,QAAQ;oBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;oBAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBAC1B,IAAI,QAAQ,EAAE;oBACZ,IAAI,QAAQ;wBAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;wBACtC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;iBACnC;aACF;SACF;IACH,CAAC;IAED,OAAO,CAAC,CAAO;QACb,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAA;QAC7B,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,CAAA;QAChC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAA;QACpC,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,CAAA;QAChC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;SACzD;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;SACzD;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,eAAe,CAAC,CAAO;QACrB,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAA;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,GAAG,GAAG,CAAA;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACrC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;gBAAE,OAAO,IAAI,CAAA;SACnC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACrC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAA;SAC5B;QACD,OAAO,KAAK,CAAA;IACd,CAAC;CACF;AAxFD,wBAwFC","sourcesContent":["// give it a pattern, and it'll be able to tell you if\n// a given path should be ignored.\n// Ignoring a path ignores its children if the pattern ends in /**\n// Ignores are always parsed in dot:true mode\n\nimport { Minimatch } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\nexport interface IgnoreLike {\n  ignored?: (p: Path) => boolean\n  childrenIgnored?: (p: Path) => boolean\n}\n\nconst defaultPlatform: NodeJS.Platform =\n  typeof process === 'object' &&\n  process &&\n  typeof process.platform === 'string'\n    ? process.platform\n    : 'linux'\n\n/**\n * Class used to process ignored patterns\n */\nexport class Ignore implements IgnoreLike {\n  relative: Minimatch[]\n  relativeChildren: Minimatch[]\n  absolute: Minimatch[]\n  absoluteChildren: Minimatch[]\n\n  constructor(\n    ignored: string[],\n    {\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      platform = defaultPlatform,\n    }: GlobWalkerOpts\n  ) {\n    this.relative = []\n    this.absolute = []\n    this.relativeChildren = []\n    this.absoluteChildren = []\n    const mmopts = {\n      dot: true,\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      optimizationLevel: 2,\n      platform,\n      nocomment: true,\n      nonegate: true,\n    }\n\n    // this is a little weird, but it gives us a clean set of optimized\n    // minimatch matchers, without getting tripped up if one of them\n    // ends in /** inside a brace section, and it's only inefficient at\n    // the start of the walk, not along it.\n    // It'd be nice if the Pattern class just had a .test() method, but\n    // handling globstars is a bit of a pita, and that code already lives\n    // in minimatch anyway.\n    // Another way would be if maybe Minimatch could take its set/globParts\n    // as an option, and then we could at least just use Pattern to test\n    // for absolute-ness.\n    // Yet another way, Minimatch could take an array of glob strings, and\n    // a cwd option, and do the right thing.\n    for (const ign of ignored) {\n      const mm = new Minimatch(ign, mmopts)\n      for (let i = 0; i < mm.set.length; i++) {\n        const parsed = mm.set[i]\n        const globParts = mm.globParts[i]\n        const p = new Pattern(parsed, globParts, 0, platform)\n        const m = new Minimatch(p.globString(), mmopts)\n        const children = globParts[globParts.length - 1] === '**'\n        const absolute = p.isAbsolute()\n        if (absolute) this.absolute.push(m)\n        else this.relative.push(m)\n        if (children) {\n          if (absolute) this.absoluteChildren.push(m)\n          else this.relativeChildren.push(m)\n        }\n      }\n    }\n  }\n\n  ignored(p: Path): boolean {\n    const fullpath = p.fullpath()\n    const fullpaths = `${fullpath}/`\n    const relative = p.relative() || '.'\n    const relatives = `${relative}/`\n    for (const m of this.relative) {\n      if (m.match(relative) || m.match(relatives)) return true\n    }\n    for (const m of this.absolute) {\n      if (m.match(fullpath) || m.match(fullpaths)) return true\n    }\n    return false\n  }\n\n  childrenIgnored(p: Path): boolean {\n    const fullpath = p.fullpath() + '/'\n    const relative = (p.relative() || '.') + '/'\n    for (const m of this.relativeChildren) {\n      if (m.match(relative)) return true\n    }\n    for (const m of this.absoluteChildren) {\n      if (m.match(fullpath)) true\n    }\n    return false\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/index.d.ts.map b/deps/npm/node_modules/glob/dist/cjs/src/index.d.ts.map
deleted file mode 100644
index 4e9ba085ce45b2..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/index.d.ts.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,KAAK,EACV,WAAW,EACX,6BAA6B,EAC7B,4BAA4B,EAC5B,6BAA6B,EAC9B,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAGhC;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACvB,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAQlD;;;GAGG;AACH,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACvB,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAQlD;;GAEG;AACH,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,MAAM,EAAE,CAAA;AACX,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,IAAI,EAAE,CAAA;AACT,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,MAAM,EAAE,CAAA;AACX,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,IAAI,EAAE,GAAG,MAAM,EAAE,CAAA;AAQpB;;;;;GAKG;AACH,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACpB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAA;AAClB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACpB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,OAAO,CAAC,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC,CAAA;AAQ7B;;GAEG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAChC,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAC9B,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAChC,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAQ9D;;GAEG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACrC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACnC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACrC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AASxE,eAAO,MAAM,UAAU,uBAAiB,CAAA;AACxC,eAAO,MAAM,MAAM;;CAAsD,CAAA;AACzE,eAAO,MAAM,WAAW,wBAAkB,CAAA;AAC1C,eAAO,MAAM,OAAO;;CAElB,CAAA;AACF,eAAO,MAAM,IAAI;;;CAGf,CAAA;AAGF,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,YAAY,EACV,WAAW,EACX,6BAA6B,EAC7B,4BAA4B,EAC5B,6BAA6B,GAC9B,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,YAAY,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAG9C,eAAO,MAAM,IAAI;;;;;;;;;;;;;;;;;;;;;;;CAgBf,CAAA"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/index.js.map b/deps/npm/node_modules/glob/dist/cjs/src/index.js.map
deleted file mode 100644
index 060338fbd1b94b..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/index.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/index.ts"],"names":[],"mappings":";;;AAAA,yCAA4C;AAS5C,uCAAgC;AAChC,iDAAyC;AAuBzC,SAAgB,cAAc,CAC5B,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,UAAU,EAAE,CAAA;AAChD,CAAC;AALD,wCAKC;AAsBD,SAAgB,UAAU,CACxB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,MAAM,EAAE,CAAA;AAC5C,CAAC;AALD,gCAKC;AAqBD,SAAgB,QAAQ,CACtB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAA;AAC9C,CAAC;AALD,4BAKC;AAwBD,KAAK,UAAU,KAAK,CAClB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAA;AAC1C,CAAC;AAqBD,SAAgB,eAAe,CAC7B,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;AACjD,CAAC;AALD,0CAKC;AAqBD,SAAgB,WAAW,CACzB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAA;AAC7C,CAAC;AALD,kCAKC;AAED,iEAAiE;AACpD,QAAA,UAAU,GAAG,cAAc,CAAA;AAC3B,QAAA,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAA;AAC5D,QAAA,WAAW,GAAG,eAAe,CAAA;AAC7B,QAAA,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE;IAChD,IAAI,EAAE,eAAe;CACtB,CAAC,CAAA;AACW,QAAA,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE;IAC1C,MAAM,EAAE,cAAc;IACtB,OAAO,EAAE,eAAe;CACzB,CAAC,CAAA;AAEF,qBAAqB;AACrB,uCAA4C;AAAnC,mGAAA,MAAM,OAAA;AAAE,qGAAA,QAAQ,OAAA;AACzB,qCAAgC;AAAvB,+FAAA,IAAI,OAAA;AAOb,+CAAyC;AAAhC,wGAAA,QAAQ,OAAA;AAGjB,oBAAoB;AAEP,QAAA,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE;IACvC,IAAI,EAAE,KAAK;IACX,QAAQ;IACR,IAAI,EAAJ,YAAI;IACJ,UAAU;IACV,MAAM,EAAN,cAAM;IACN,cAAc;IACd,UAAU,EAAV,kBAAU;IACV,WAAW;IACX,OAAO,EAAP,eAAO;IACP,eAAe;IACf,WAAW,EAAX,mBAAW;IACX,IAAI,EAAJ,cAAI;IACJ,QAAQ,EAAR,uBAAQ;IACR,MAAM,EAAN,kBAAM;IACN,QAAQ,EAAR,oBAAQ;CACT,CAAC,CAAA;AACF,YAAI,CAAC,IAAI,GAAG,YAAI,CAAA","sourcesContent":["import { escape, unescape } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nimport { Glob } from './glob.js'\nimport { hasMagic } from './has-magic.js'\n\n/**\n * Syncronous form of {@link globStream}. Will read all the matches as fast as\n * you consume them, even all in a single tick if you consume them immediately,\n * but will still respond to backpressure if they're not consumed immediately.\n */\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Minipass<Path, Path>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesUnset\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).streamSync()\n}\n\n/**\n * Return a stream that emits all the strings or `Path` objects and\n * then emits `end` when completed.\n */\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Minipass<Path, Path>\nexport function globStream(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).stream()\n}\n\n/**\n * Synchronous form of {@link glob}\n */\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Path[]\nexport function globSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Path[] | string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).walkSync()\n}\n\n/**\n * Perform an asynchronous glob search for the pattern(s) specified. Returns\n * [Path](https://isaacs.github.io/path-scurry/classes/PathBase) objects if the\n * {@link withFileTypes} option is set to `true`. See {@link GlobOptions} for\n * full option descriptions.\n */\nasync function glob_(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Promise<Path[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions\n): Promise<Path[] | string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).walk()\n}\n\n/**\n * Return a sync iterator for walking glob pattern matches.\n */\nexport function globIterateSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Generator<Path, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Generator<Path, void, void> | Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).iterateSync()\n}\n\n/**\n * Return an async iterator for walking glob pattern matches.\n */\nexport function globIterate(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): AsyncGenerator<Path, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions\n): AsyncGenerator<Path, void, void> | AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).iterate()\n}\n\n// aliases: glob.sync.stream() glob.stream.sync() glob.sync() etc\nexport const streamSync = globStreamSync\nexport const stream = Object.assign(globStream, { sync: globStreamSync })\nexport const iterateSync = globIterateSync\nexport const iterate = Object.assign(globIterate, {\n  sync: globIterateSync,\n})\nexport const sync = Object.assign(globSync, {\n  stream: globStreamSync,\n  iterate: globIterateSync,\n})\n\n/* c8 ignore start */\nexport { escape, unescape } from 'minimatch'\nexport { Glob } from './glob.js'\nexport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nexport { hasMagic } from './has-magic.js'\nexport type { IgnoreLike } from './ignore.js'\nexport type { MatchStream } from './walker.js'\n/* c8 ignore stop */\n\nexport const glob = Object.assign(glob_, {\n  glob: glob_,\n  globSync,\n  sync,\n  globStream,\n  stream,\n  globStreamSync,\n  streamSync,\n  globIterate,\n  iterate,\n  globIterateSync,\n  iterateSync,\n  Glob,\n  hasMagic,\n  escape,\n  unescape,\n})\nglob.glob = glob\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/pattern.d.ts.map b/deps/npm/node_modules/glob/dist/cjs/src/pattern.d.ts.map
deleted file mode 100644
index 48430f63db0947..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/pattern.d.ts.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"pattern.d.ts","sourceRoot":"","sources":["../../../src/pattern.ts"],"names":[],"mappings":";AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AACpC,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,QAAQ,CAAA;AAGzD,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;AAC9D,MAAM,MAAM,cAAc,GAAG;IAC3B,EAAE,EAAE,EAAE;IACN,EAAE,EAAE,EAAE;IACN,EAAE,EAAE,MAAM;IACV,EAAE,EAAE,MAAM;IACV,GAAG,IAAI,EAAE,SAAS,EAAE;CACrB,CAAA;AACD,MAAM,MAAM,gBAAgB,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;AACjE,MAAM,MAAM,mBAAmB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;AAChE,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC,CAAA;AAMrD;;;GAGG;AACH,qBAAa,OAAO;;IAIlB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;gBAUrB,WAAW,EAAE,SAAS,EAAE,EACxB,QAAQ,EAAE,MAAM,EAAE,EAClB,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,CAAC,QAAQ;IA6D3B;;OAEG;IACH,OAAO,IAAI,SAAS;IAIpB;;OAEG;IACH,QAAQ,IAAI,OAAO;IAGnB;;OAEG;IACH,UAAU,IAAI,OAAO;IAGrB;;OAEG;IACH,QAAQ,IAAI,OAAO;IAInB;;OAEG;IACH,UAAU,IAAI,MAAM;IAUpB;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,IAAI,IAAI,OAAO,GAAG,IAAI;IAetB;;OAEG;IACH,KAAK,IAAI,OAAO;IAoBhB;;OAEG;IACH,OAAO,IAAI,OAAO;IAelB;;OAEG;IACH,UAAU,IAAI,OAAO;IAUrB;;OAEG;IACH,IAAI,IAAI,MAAM;IAOd;;;OAGG;IACH,mBAAmB,IAAI,OAAO;IAQ9B;;OAEG;IACH,kBAAkB,IAAI,OAAO;CAM9B"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/pattern.js.map b/deps/npm/node_modules/glob/dist/cjs/src/pattern.js.map
deleted file mode 100644
index ba5293ff9f2489..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/pattern.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"pattern.js","sourceRoot":"","sources":["../../../src/pattern.ts"],"names":[],"mappings":";AAAA,yEAAyE;;;AAEzE,yCAAoC;AAgBpC,MAAM,aAAa,GAAG,CAAC,EAAe,EAAqB,EAAE,CAC3D,EAAE,CAAC,MAAM,IAAI,CAAC,CAAA;AAChB,MAAM,UAAU,GAAG,CAAC,EAAY,EAAkB,EAAE,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,CAAA;AAEnE;;;GAGG;AACH,MAAa,OAAO;IACT,YAAY,CAAa;IACzB,SAAS,CAAU;IACnB,MAAM,CAAQ;IACd,MAAM,CAAQ;IACd,SAAS,CAAiB;IACnC,KAAK,CAAiB;IACtB,WAAW,CAAS;IACpB,QAAQ,CAAU;IAClB,MAAM,CAAU;IAChB,WAAW,CAAU;IACrB,eAAe,GAAY,IAAI,CAAA;IAE/B,YACE,WAAwB,EACxB,QAAkB,EAClB,KAAa,EACb,QAAyB;QAEzB,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,EAAE;YAC/B,MAAM,IAAI,SAAS,CAAC,oBAAoB,CAAC,CAAA;SAC1C;QACD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE;YACzB,MAAM,IAAI,SAAS,CAAC,iBAAiB,CAAC,CAAA;SACvC;QACD,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,EAAE;YAC1C,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAA;SACrE;QACD,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAA;QAChC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YACrC,MAAM,IAAI,SAAS,CAAC,oBAAoB,CAAC,CAAA;SAC1C;QACD,IAAI,CAAC,YAAY,GAAG,WAAW,CAAA;QAC/B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;QACnB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QAEzB,mEAAmE;QACnE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACrB,gBAAgB;YAChB,iBAAiB;YACjB,uBAAuB;YACvB,oCAAoC;YACpC,qCAAqC;YACrC,2CAA2C;YAC3C,uBAAuB;YACvB,aAAa;YACb,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE;gBAChB,6BAA6B;gBAC7B,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAA;gBACpD,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;gBACjD,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;oBACnB,YAAY;oBACZ,KAAK,CAAC,KAAK,EAAE,CAAA;oBACb,KAAK,CAAC,KAAK,EAAE,CAAA;iBACd;gBACD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACxC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACxC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;aACvC;iBAAM,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;gBAC9C,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAA;gBACxC,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;gBACrC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;oBACnB,YAAY;oBACZ,KAAK,CAAC,KAAK,EAAE,CAAA;oBACb,KAAK,CAAC,KAAK,EAAE,CAAA;iBACd;gBACD,MAAM,CAAC,GAAI,EAAa,GAAG,GAAG,CAAA;gBAC9B,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,CAAA;gBAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;aACvC;SACF;IACH,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACvC,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAA;IAC3D,CAAC;IACD;;OAEG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,oBAAQ,CAAA;IACpD,CAAC;IACD;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,MAAM,CAAA;IACzD,CAAC;IAED;;OAEG;IACH,UAAU;QACR,OAAO,CAAC,IAAI,CAAC,WAAW;YACtB,IAAI,CAAC,WAAW;gBAChB,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;oBAChB,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE;wBACjB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;wBACvD,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC;oBAC5B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACrD,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACtC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QAC/C,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAA;QAC/C,IAAI,CAAC,KAAK,GAAG,IAAI,OAAO,CACtB,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,MAAM,GAAG,CAAC,EACf,IAAI,CAAC,SAAS,CACf,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;QACzC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAC/B,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QACnC,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,MAAM,KAAK,SAAS;YAC9B,CAAC,CAAC,IAAI,CAAC,MAAM;YACb,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;gBACV,IAAI,CAAC,SAAS,KAAK,OAAO;oBAC1B,IAAI,CAAC,MAAM,KAAK,CAAC;oBACjB,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBACZ,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBACZ,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACP,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC;IAED,sBAAsB;IACtB,sBAAsB;IACtB,mEAAmE;IACnE,sEAAsE;IACtE,6CAA6C;IAC7C;;OAEG;IACH,OAAO;QACL,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS;YAChC,CAAC,CAAC,IAAI,CAAC,QAAQ;YACf,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ;gBACZ,IAAI,CAAC,SAAS,KAAK,OAAO;oBAC1B,IAAI,CAAC,MAAM,KAAK,CAAC;oBACjB,IAAI,CAAC,MAAM,GAAG,CAAC;oBACf,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChC,CAAC;IAED,sCAAsC;IACtC,kDAAkD;IAClD,oDAAoD;IACpD;;OAEG;IACH,UAAU;QACR,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS;YACnC,CAAC,CAAC,IAAI,CAAC,WAAW;YAClB,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW;gBACf,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;oBAC/B,IAAI,CAAC,OAAO,EAAE;oBACd,IAAI,CAAC,KAAK,EAAE,CAAC,CAAA;IACrB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC9B,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACpE,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,CAAA;IACR,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACjB,OAAO,CAAC,CACN,IAAI,CAAC,MAAM,KAAK,CAAC;YACjB,CAAC,IAAI,CAAC,UAAU,EAAE;YAClB,CAAC,IAAI,CAAC,eAAe,CACtB,CAAA;IACH,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe;YAClE,OAAO,KAAK,CAAA;QACd,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;QAC5B,OAAO,IAAI,CAAA;IACb,CAAC;CACF;AAnOD,0BAmOC","sourcesContent":["// this is just a very light wrapper around 2 arrays with an offset index\n\nimport { GLOBSTAR } from 'minimatch'\nexport type MMPattern = string | RegExp | typeof GLOBSTAR\n\n// an array of length >= 1\nexport type PatternList = [p: MMPattern, ...rest: MMPattern[]]\nexport type UNCPatternList = [\n  p0: '',\n  p1: '',\n  p2: string,\n  p3: string,\n  ...rest: MMPattern[]\n]\nexport type DrivePatternList = [p0: string, ...rest: MMPattern[]]\nexport type AbsolutePatternList = [p0: '', ...rest: MMPattern[]]\nexport type GlobList = [p: string, ...rest: string[]]\n\nconst isPatternList = (pl: MMPattern[]): pl is PatternList =>\n  pl.length >= 1\nconst isGlobList = (gl: string[]): gl is GlobList => gl.length >= 1\n\n/**\n * An immutable-ish view on an array of glob parts and their parsed\n * results\n */\nexport class Pattern {\n  readonly #patternList: PatternList\n  readonly #globList: GlobList\n  readonly #index: number\n  readonly length: number\n  readonly #platform: NodeJS.Platform\n  #rest?: Pattern | null\n  #globString?: string\n  #isDrive?: boolean\n  #isUNC?: boolean\n  #isAbsolute?: boolean\n  #followGlobstar: boolean = true\n\n  constructor(\n    patternList: MMPattern[],\n    globList: string[],\n    index: number,\n    platform: NodeJS.Platform\n  ) {\n    if (!isPatternList(patternList)) {\n      throw new TypeError('empty pattern list')\n    }\n    if (!isGlobList(globList)) {\n      throw new TypeError('empty glob list')\n    }\n    if (globList.length !== patternList.length) {\n      throw new TypeError('mismatched pattern list and glob list lengths')\n    }\n    this.length = patternList.length\n    if (index < 0 || index >= this.length) {\n      throw new TypeError('index out of range')\n    }\n    this.#patternList = patternList\n    this.#globList = globList\n    this.#index = index\n    this.#platform = platform\n\n    // normalize root entries of absolute patterns on initial creation.\n    if (this.#index === 0) {\n      // c: => ['c:/']\n      // C:/ => ['C:/']\n      // C:/x => ['C:/', 'x']\n      // //host/share => ['//host/share/']\n      // //host/share/ => ['//host/share/']\n      // //host/share/x => ['//host/share/', 'x']\n      // /etc => ['/', 'etc']\n      // / => ['/']\n      if (this.isUNC()) {\n        // '' / '' / 'host' / 'share'\n        const [p0, p1, p2, p3, ...prest] = this.#patternList\n        const [g0, g1, g2, g3, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = [p0, p1, p2, p3, ''].join('/')\n        const g = [g0, g1, g2, g3, ''].join('/')\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      } else if (this.isDrive() || this.isAbsolute()) {\n        const [p1, ...prest] = this.#patternList\n        const [g1, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = (p1 as string) + '/'\n        const g = g1 + '/'\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      }\n    }\n  }\n\n  /**\n   * The first entry in the parsed list of patterns\n   */\n  pattern(): MMPattern {\n    return this.#patternList[this.#index]\n  }\n\n  /**\n   * true of if pattern() returns a string\n   */\n  isString(): boolean {\n    return typeof this.#patternList[this.#index] === 'string'\n  }\n  /**\n   * true of if pattern() returns GLOBSTAR\n   */\n  isGlobstar(): boolean {\n    return this.#patternList[this.#index] === GLOBSTAR\n  }\n  /**\n   * true if pattern() returns a regexp\n   */\n  isRegExp(): boolean {\n    return this.#patternList[this.#index] instanceof RegExp\n  }\n\n  /**\n   * The /-joined set of glob parts that make up this pattern\n   */\n  globString(): string {\n    return (this.#globString =\n      this.#globString ||\n      (this.#index === 0\n        ? this.isAbsolute()\n          ? this.#globList[0] + this.#globList.slice(1).join('/')\n          : this.#globList.join('/')\n        : this.#globList.slice(this.#index).join('/')))\n  }\n\n  /**\n   * true if there are more pattern parts after this one\n   */\n  hasMore(): boolean {\n    return this.length > this.#index + 1\n  }\n\n  /**\n   * The rest of the pattern after this part, or null if this is the end\n   */\n  rest(): Pattern | null {\n    if (this.#rest !== undefined) return this.#rest\n    if (!this.hasMore()) return (this.#rest = null)\n    this.#rest = new Pattern(\n      this.#patternList,\n      this.#globList,\n      this.#index + 1,\n      this.#platform\n    )\n    this.#rest.#isAbsolute = this.#isAbsolute\n    this.#rest.#isUNC = this.#isUNC\n    this.#rest.#isDrive = this.#isDrive\n    return this.#rest\n  }\n\n  /**\n   * true if the pattern represents a //unc/path/ on windows\n   */\n  isUNC(): boolean {\n    const pl = this.#patternList\n    return this.#isUNC !== undefined\n      ? this.#isUNC\n      : (this.#isUNC =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          pl[0] === '' &&\n          pl[1] === '' &&\n          typeof pl[2] === 'string' &&\n          !!pl[2] &&\n          typeof pl[3] === 'string' &&\n          !!pl[3])\n  }\n\n  // pattern like C:/...\n  // split = ['C:', ...]\n  // XXX: would be nice to handle patterns like `c:*` to test the cwd\n  // in c: for *, but I don't know of a way to even figure out what that\n  // cwd is without actually chdir'ing into it?\n  /**\n   * True if the pattern starts with a drive letter on Windows\n   */\n  isDrive(): boolean {\n    const pl = this.#patternList\n    return this.#isDrive !== undefined\n      ? this.#isDrive\n      : (this.#isDrive =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          this.length > 1 &&\n          typeof pl[0] === 'string' &&\n          /^[a-z]:$/i.test(pl[0]))\n  }\n\n  // pattern = '/' or '/...' or '/x/...'\n  // split = ['', ''] or ['', ...] or ['', 'x', ...]\n  // Drive and UNC both considered absolute on windows\n  /**\n   * True if the pattern is rooted on an absolute path\n   */\n  isAbsolute(): boolean {\n    const pl = this.#patternList\n    return this.#isAbsolute !== undefined\n      ? this.#isAbsolute\n      : (this.#isAbsolute =\n          (pl[0] === '' && pl.length > 1) ||\n          this.isDrive() ||\n          this.isUNC())\n  }\n\n  /**\n   * consume the root of the pattern, and return it\n   */\n  root(): string {\n    const p = this.#patternList[0]\n    return typeof p === 'string' && this.isAbsolute() && this.#index === 0\n      ? p\n      : ''\n  }\n\n  /**\n   * Check to see if the current globstar pattern is allowed to follow\n   * a symbolic link.\n   */\n  checkFollowGlobstar(): boolean {\n    return !(\n      this.#index === 0 ||\n      !this.isGlobstar() ||\n      !this.#followGlobstar\n    )\n  }\n\n  /**\n   * Mark that the current globstar pattern is following a symbolic link\n   */\n  markFollowGlobstar(): boolean {\n    if (this.#index === 0 || !this.isGlobstar() || !this.#followGlobstar)\n      return false\n    this.#followGlobstar = false\n    return true\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/processor.d.ts.map b/deps/npm/node_modules/glob/dist/cjs/src/processor.d.ts.map
deleted file mode 100644
index ca6c63ca264b27..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/processor.d.ts.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"processor.d.ts","sourceRoot":"","sources":["../../../src/processor.ts"],"names":[],"mappings":"AAEA,OAAO,EAAY,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,EAAa,OAAO,EAAE,MAAM,cAAc,CAAA;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAE5C;;GAEG;AACH,qBAAa,cAAc;IACzB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;gBACnB,KAAK,GAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAGvD,IAAI;IAGJ,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;IAGxC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;CAM3C;AAED;;;;GAIG;AACH,qBAAa,WAAW;IACtB,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAY;IACpC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO;IAMnD,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE;CAOtC;AAED;;;GAGG;AACH,qBAAa,QAAQ;IACnB,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAY;IACvC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;IAWlC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,OAAO,EAAE;IAS5B,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE;IAG9B,IAAI,IAAI,IAAI,EAAE;CAGf;AAED;;;;;GAKG;AACH,qBAAa,SAAS;IACpB,cAAc,EAAE,cAAc,CAAA;IAC9B,OAAO,cAAoB;IAC3B,QAAQ,WAAiB;IACzB,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAA;IACpB,MAAM,EAAE,OAAO,CAAA;IACf,GAAG,EAAE,OAAO,CAAA;IACZ,IAAI,EAAE,cAAc,CAAA;gBAER,IAAI,EAAE,cAAc,EAAE,cAAc,CAAC,EAAE,cAAc;IASjE,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE;IAwGjD,cAAc,IAAI,IAAI,EAAE;IAIxB,KAAK;IAQL,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,SAAS;IAqBvD,YAAY,CACV,CAAC,EAAE,IAAI,EACP,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,QAAQ,EAAE,OAAO;IA8CnB,UAAU,CACR,CAAC,EAAE,IAAI,EACP,CAAC,EAAE,QAAQ,EACX,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,QAAQ,EAAE,OAAO;IAUnB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,QAAQ,EAAE,OAAO;CASvE"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/processor.js.map b/deps/npm/node_modules/glob/dist/cjs/src/processor.js.map
deleted file mode 100644
index bcbac1f723f983..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/processor.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"processor.js","sourceRoot":"","sources":["../../../src/processor.ts"],"names":[],"mappings":";AAAA,qEAAqE;;;AAErE,yCAA8C;AAK9C;;GAEG;AACH,MAAa,cAAc;IACzB,KAAK,CAA0B;IAC/B,YAAY,QAAkC,IAAI,GAAG,EAAE;QACrD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,CAAC;IACD,IAAI;QACF,OAAO,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IAChD,CAAC;IACD,SAAS,CAAC,MAAY,EAAE,OAAgB;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;IACrE,CAAC;IACD,WAAW,CAAC,MAAY,EAAE,OAAgB;QACxC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACvC,IAAI,MAAM;YAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;;YACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAA;IAChE,CAAC;CACF;AAjBD,wCAiBC;AAED;;;;GAIG;AACH,MAAa,WAAW;IACtB,KAAK,GAAsB,IAAI,GAAG,EAAE,CAAA;IACpC,GAAG,CAAC,MAAY,EAAE,QAAiB,EAAE,KAAc;QACjD,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAA;IACjE,CAAC;IACD,yBAAyB;IACzB,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI;YACJ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACV,CAAC,CAAA;IACJ,CAAC;CACF;AAfD,kCAeC;AAED;;;GAGG;AACH,MAAa,QAAQ;IACnB,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAA;IACvC,GAAG,CAAC,MAAY,EAAE,OAAgB;QAChC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE;YACxB,OAAM;SACP;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE;gBAC5D,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;aACnB;SACF;;YAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC,CAAA;IAC1C,CAAC;IACD,GAAG,CAAC,MAAY;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,qBAAqB;QACrB,IAAI,CAAC,IAAI,EAAE;YACT,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAA;SACnD;QACD,oBAAoB;QACpB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAc,CAAC,CAAC,CAAA;IAClE,CAAC;IACD,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAA;IAC3D,CAAC;CACF;AA5BD,4BA4BC;AAED;;;;;GAKG;AACH,MAAa,SAAS;IACpB,cAAc,CAAgB;IAC9B,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;IAC3B,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAA;IACzB,QAAQ,CAAY;IACpB,MAAM,CAAS;IACf,GAAG,CAAS;IACZ,IAAI,CAAgB;IAEpB,YAAY,IAAoB,EAAE,cAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;QACrB,IAAI,CAAC,cAAc,GAAG,cAAc;YAClC,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE;YACvB,CAAC,CAAC,IAAI,cAAc,EAAE,CAAA;IAC1B,CAAC;IAED,eAAe,CAAC,MAAY,EAAE,QAAmB;QAC/C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,MAAM,aAAa,GAAsB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAA;QAEvE,gEAAgE;QAChE,uCAAuC;QAEvC,KAAK,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE;YACtC,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAE3C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;YAC3B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAA;YAErE,kCAAkC;YAClC,IAAI,IAAI,EAAE;gBACR,CAAC,GAAG,CAAC,CAAC,OAAO,CACX,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS;oBAC1C,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;oBAChB,CAAC,CAAC,IAAI,CACT,CAAA;gBACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;gBAC3B,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;oBAChC,SAAQ;iBACT;qBAAM;oBACL,OAAO,GAAG,IAAI,CAAA;iBACf;aACF;YAED,IAAI,CAAC,CAAC,QAAQ,EAAE;gBAAE,SAAQ;YAE1B,IAAI,CAAY,CAAA;YAChB,IAAI,IAAoB,CAAA;YACxB,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,OACE,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,KAAK,QAAQ;gBAC3C,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EACvB;gBACA,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;gBACtB,sDAAsD;gBACtD,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,IAAI;oBAAE,MAAK;gBACtC,CAAC,GAAG,CAAC,CAAA;gBACL,OAAO,GAAG,IAAI,CAAA;gBACd,OAAO,GAAG,IAAI,CAAA;aACf;YACD,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;YACrB,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;YACrB,IAAI,OAAO,EAAE;gBACX,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC;oBAAE,SAAQ;gBACvD,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;aAC5C;YAED,uDAAuD;YACvD,qCAAqC;YACrC,kDAAkD;YAClD,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;gBACzB,sBAAsB;gBACtB,IAAI,CAAC,IAAI,EAAE;oBACT,MAAM,KAAK,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAA;oBACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;iBAChD;qBAAM;oBACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;gBACD,SAAQ;aACT;iBAAM,IAAI,CAAC,KAAK,oBAAQ,EAAE;gBACzB,wCAAwC;gBACxC,4CAA4C;gBAC5C,wDAAwD;gBACxD,4DAA4D;gBAC5D,gEAAgE;gBAChE,IACE,CAAC,CAAC,CAAC,cAAc,EAAE;oBACnB,IAAI,CAAC,MAAM;oBACX,OAAO,CAAC,mBAAmB,EAAE,EAC7B;oBACA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;gBACD,MAAM,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,CAAA;gBAC1B,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,EAAE,CAAA;gBAC1B,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;oBAClD,iDAAiD;oBACjD,6CAA6C;oBAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAA;iBACvD;qBAAM;oBACL,IAAI,EAAE,KAAK,IAAI,EAAE;wBACf,wDAAwD;wBACxD,wDAAwD;wBACxD,qBAAqB;wBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;wBACxB,oBAAoB;wBACpB,IAAI,CAAC,KAAK;4BAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;6BAC3C,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE;4BAClD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;yBAC7B;qBACF;iBACF;aACF;iBAAM,IAAI,CAAC,YAAY,MAAM,EAAE;gBAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;aAC9B;SACF;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;IAC7B,CAAC;IAED,KAAK;QACH,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAA;IACtD,CAAC;IAED,0DAA0D;IAC1D,yCAAyC;IACzC,6CAA6C;IAC7C,2BAA2B;IAC3B,aAAa,CAAC,MAAY,EAAE,OAAe;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC1C,yDAAyD;QACzD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAA;QAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;YACvB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;gBAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAA;gBACrC,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;gBAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;gBAC3B,IAAI,CAAC,KAAK,oBAAQ,EAAE;oBAClB,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACjD;qBAAM,IAAI,CAAC,YAAY,MAAM,EAAE;oBAC9B,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACzC;qBAAM;oBACL,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACzC;aACF;SACF;QACD,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,YAAY,CACV,CAAO,EACP,OAAgB,EAChB,IAAoB,EACpB,QAAiB;QAEjB,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;YACvC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;gBACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;aACrC;YACD,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,2DAA2D;gBAC3D,gEAAgE;gBAChE,+DAA+D;gBAC/D,iEAAiE;gBACjE,uDAAuD;gBACvD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,cAAc,EAAE,EAAE;oBACtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;qBAAM,IAAI,CAAC,CAAC,cAAc,EAAE,EAAE;oBAC7B,IAAI,IAAI,IAAI,OAAO,CAAC,mBAAmB,EAAE,EAAE;wBACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;qBAC3B;yBAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,EAAE;wBACvC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;qBAC9B;iBACF;aACF;SACF;QACD,sDAAsD;QACtD,YAAY;QACZ,IAAI,IAAI,EAAE;YACR,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;YACzB,IACE,OAAO,EAAE,KAAK,QAAQ;gBACtB,sCAAsC;gBACtC,EAAE,KAAK,IAAI;gBACX,EAAE,KAAK,EAAE;gBACT,EAAE,KAAK,GAAG,EACV;gBACA,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAA;aAC9C;iBAAM,IAAI,EAAE,KAAK,IAAI,EAAE;gBACtB,qBAAqB;gBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;gBACxB,oBAAoB;gBACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;aAC5B;iBAAM,IAAI,EAAE,YAAY,MAAM,EAAE;gBAC/B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAA;aAC9C;SACF;IACH,CAAC;IAED,UAAU,CACR,CAAO,EACP,CAAW,EACX,IAAoB,EACpB,QAAiB;QAEjB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAM;QAC3B,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACrC;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;IAED,UAAU,CAAC,CAAO,EAAE,CAAS,EAAE,IAAoB,EAAE,QAAiB;QACpE,uBAAuB;QACvB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAM;QACzB,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACrC;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;CACF;AApOD,8BAoOC","sourcesContent":["// synchronous utility for filtering entries and calculating subwalks\n\nimport { GLOBSTAR, MMRegExp } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { MMPattern, Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\n/**\n * A cache of which patterns have been processed for a given Path\n */\nexport class HasWalkedCache {\n  store: Map<string, Set<string>>\n  constructor(store: Map<string, Set<string>> = new Map()) {\n    this.store = store\n  }\n  copy() {\n    return new HasWalkedCache(new Map(this.store))\n  }\n  hasWalked(target: Path, pattern: Pattern) {\n    return this.store.get(target.fullpath())?.has(pattern.globString())\n  }\n  storeWalked(target: Path, pattern: Pattern) {\n    const fullpath = target.fullpath()\n    const cached = this.store.get(fullpath)\n    if (cached) cached.add(pattern.globString())\n    else this.store.set(fullpath, new Set([pattern.globString()]))\n  }\n}\n\n/**\n * A record of which paths have been matched in a given walk step,\n * and whether they only are considered a match if they are a directory,\n * and whether their absolute or relative path should be returned.\n */\nexport class MatchRecord {\n  store: Map<Path, number> = new Map()\n  add(target: Path, absolute: boolean, ifDir: boolean) {\n    const n = (absolute ? 2 : 0) | (ifDir ? 1 : 0)\n    const current = this.store.get(target)\n    this.store.set(target, current === undefined ? n : n & current)\n  }\n  // match, absolute, ifdir\n  entries(): [Path, boolean, boolean][] {\n    return [...this.store.entries()].map(([path, n]) => [\n      path,\n      !!(n & 2),\n      !!(n & 1),\n    ])\n  }\n}\n\n/**\n * A collection of patterns that must be processed in a subsequent step\n * for a given path.\n */\nexport class SubWalks {\n  store: Map<Path, Pattern[]> = new Map()\n  add(target: Path, pattern: Pattern) {\n    if (!target.canReaddir()) {\n      return\n    }\n    const subs = this.store.get(target)\n    if (subs) {\n      if (!subs.find(p => p.globString() === pattern.globString())) {\n        subs.push(pattern)\n      }\n    } else this.store.set(target, [pattern])\n  }\n  get(target: Path): Pattern[] {\n    const subs = this.store.get(target)\n    /* c8 ignore start */\n    if (!subs) {\n      throw new Error('attempting to walk unknown path')\n    }\n    /* c8 ignore stop */\n    return subs\n  }\n  entries(): [Path, Pattern[]][] {\n    return this.keys().map(k => [k, this.store.get(k) as Pattern[]])\n  }\n  keys(): Path[] {\n    return [...this.store.keys()].filter(t => t.canReaddir())\n  }\n}\n\n/**\n * The class that processes patterns for a given path.\n *\n * Handles child entry filtering, and determining whether a path's\n * directory contents must be read.\n */\nexport class Processor {\n  hasWalkedCache: HasWalkedCache\n  matches = new MatchRecord()\n  subwalks = new SubWalks()\n  patterns?: Pattern[]\n  follow: boolean\n  dot: boolean\n  opts: GlobWalkerOpts\n\n  constructor(opts: GlobWalkerOpts, hasWalkedCache?: HasWalkedCache) {\n    this.opts = opts\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.hasWalkedCache = hasWalkedCache\n      ? hasWalkedCache.copy()\n      : new HasWalkedCache()\n  }\n\n  processPatterns(target: Path, patterns: Pattern[]) {\n    this.patterns = patterns\n    const processingSet: [Path, Pattern][] = patterns.map(p => [target, p])\n\n    // map of paths to the magic-starting subwalks they need to walk\n    // first item in patterns is the filter\n\n    for (let [t, pattern] of processingSet) {\n      this.hasWalkedCache.storeWalked(t, pattern)\n\n      const root = pattern.root()\n      const absolute = pattern.isAbsolute() && this.opts.absolute !== false\n\n      // start absolute patterns at root\n      if (root) {\n        t = t.resolve(\n          root === '/' && this.opts.root !== undefined\n            ? this.opts.root\n            : root\n        )\n        const rest = pattern.rest()\n        if (!rest) {\n          this.matches.add(t, true, false)\n          continue\n        } else {\n          pattern = rest\n        }\n      }\n\n      if (t.isENOENT()) continue\n\n      let p: MMPattern\n      let rest: Pattern | null\n      let changed = false\n      while (\n        typeof (p = pattern.pattern()) === 'string' &&\n        (rest = pattern.rest())\n      ) {\n        const c = t.resolve(p)\n        // we can be reasonably sure that .. is a readable dir\n        if (c.isUnknown() && p !== '..') break\n        t = c\n        pattern = rest\n        changed = true\n      }\n      p = pattern.pattern()\n      rest = pattern.rest()\n      if (changed) {\n        if (this.hasWalkedCache.hasWalked(t, pattern)) continue\n        this.hasWalkedCache.storeWalked(t, pattern)\n      }\n\n      // now we have either a final string for a known entry,\n      // more strings for an unknown entry,\n      // or a pattern starting with magic, mounted on t.\n      if (typeof p === 'string') {\n        // must be final entry\n        if (!rest) {\n          const ifDir = p === '..' || p === '' || p === '.'\n          this.matches.add(t.resolve(p), absolute, ifDir)\n        } else {\n          this.subwalks.add(t, pattern)\n        }\n        continue\n      } else if (p === GLOBSTAR) {\n        // if no rest, match and subwalk pattern\n        // if rest, process rest and subwalk pattern\n        // if it's a symlink, but we didn't get here by way of a\n        // globstar match (meaning it's the first time THIS globstar\n        // has traversed a symlink), then we follow it. Otherwise, stop.\n        if (\n          !t.isSymbolicLink() ||\n          this.follow ||\n          pattern.checkFollowGlobstar()\n        ) {\n          this.subwalks.add(t, pattern)\n        }\n        const rp = rest?.pattern()\n        const rrest = rest?.rest()\n        if (!rest || ((rp === '' || rp === '.') && !rrest)) {\n          // only HAS to be a dir if it ends in **/ or **/.\n          // but ending in ** will match files as well.\n          this.matches.add(t, absolute, rp === '' || rp === '.')\n        } else {\n          if (rp === '..') {\n            // this would mean you're matching **/.. at the fs root,\n            // and no thanks, I'm not gonna test that specific case.\n            /* c8 ignore start */\n            const tp = t.parent || t\n            /* c8 ignore stop */\n            if (!rrest) this.matches.add(tp, absolute, true)\n            else if (!this.hasWalkedCache.hasWalked(tp, rrest)) {\n              this.subwalks.add(tp, rrest)\n            }\n          }\n        }\n      } else if (p instanceof RegExp) {\n        this.subwalks.add(t, pattern)\n      }\n    }\n\n    return this\n  }\n\n  subwalkTargets(): Path[] {\n    return this.subwalks.keys()\n  }\n\n  child() {\n    return new Processor(this.opts, this.hasWalkedCache)\n  }\n\n  // return a new Processor containing the subwalks for each\n  // child entry, and a set of matches, and\n  // a hasWalkedCache that's a copy of this one\n  // then we're going to call\n  filterEntries(parent: Path, entries: Path[]): Processor {\n    const patterns = this.subwalks.get(parent)\n    // put matches and entry walks into the results processor\n    const results = this.child()\n    for (const e of entries) {\n      for (const pattern of patterns) {\n        const absolute = pattern.isAbsolute()\n        const p = pattern.pattern()\n        const rest = pattern.rest()\n        if (p === GLOBSTAR) {\n          results.testGlobstar(e, pattern, rest, absolute)\n        } else if (p instanceof RegExp) {\n          results.testRegExp(e, p, rest, absolute)\n        } else {\n          results.testString(e, p, rest, absolute)\n        }\n      }\n    }\n    return results\n  }\n\n  testGlobstar(\n    e: Path,\n    pattern: Pattern,\n    rest: Pattern | null,\n    absolute: boolean\n  ) {\n    if (this.dot || !e.name.startsWith('.')) {\n      if (!pattern.hasMore()) {\n        this.matches.add(e, absolute, false)\n      }\n      if (e.canReaddir()) {\n        // if we're in follow mode or it's not a symlink, just keep\n        // testing the same pattern. If there's more after the globstar,\n        // then this symlink consumes the globstar. If not, then we can\n        // follow at most ONE symlink along the way, so we mark it, which\n        // also checks to ensure that it wasn't already marked.\n        if (this.follow || !e.isSymbolicLink()) {\n          this.subwalks.add(e, pattern)\n        } else if (e.isSymbolicLink()) {\n          if (rest && pattern.checkFollowGlobstar()) {\n            this.subwalks.add(e, rest)\n          } else if (pattern.markFollowGlobstar()) {\n            this.subwalks.add(e, pattern)\n          }\n        }\n      }\n    }\n    // if the NEXT thing matches this entry, then also add\n    // the rest.\n    if (rest) {\n      const rp = rest.pattern()\n      if (\n        typeof rp === 'string' &&\n        // dots and empty were handled already\n        rp !== '..' &&\n        rp !== '' &&\n        rp !== '.'\n      ) {\n        this.testString(e, rp, rest.rest(), absolute)\n      } else if (rp === '..') {\n        /* c8 ignore start */\n        const ep = e.parent || e\n        /* c8 ignore stop */\n        this.subwalks.add(ep, rest)\n      } else if (rp instanceof RegExp) {\n        this.testRegExp(e, rp, rest.rest(), absolute)\n      }\n    }\n  }\n\n  testRegExp(\n    e: Path,\n    p: MMRegExp,\n    rest: Pattern | null,\n    absolute: boolean\n  ) {\n    if (!p.test(e.name)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n\n  testString(e: Path, p: string, rest: Pattern | null, absolute: boolean) {\n    // should never happen?\n    if (!e.isNamed(p)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/walker.d.ts.map b/deps/npm/node_modules/glob/dist/cjs/src/walker.d.ts.map
deleted file mode 100644
index dda062358f1998..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/walker.d.ts.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"walker.d.ts","sourceRoot":"","sources":["../../../src/walker.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,EAAU,UAAU,EAAE,MAAM,aAAa,CAAA;AAOhD,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AACtC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAE1C,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAC5B,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,CAAA;IAClB,GAAG,CAAC,EAAE,OAAO,CAAA;IACb,WAAW,CAAC,EAAE,OAAO,CAAA;IACrB,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IACvC,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,SAAS,CAAC,EAAE,OAAO,CAAA;IAGnB,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAA;IAC1B,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,oBAAoB,CAAC,EAAE,OAAO,CAAA;IAC9B,aAAa,CAAC,EAAE,OAAO,CAAA;CACxB;AAED,MAAM,MAAM,gBAAgB,GAAG,cAAc,GAAG;IAC9C,aAAa,EAAE,IAAI,CAAA;CACpB,CAAA;AACD,MAAM,MAAM,iBAAiB,GAAG,cAAc,GAAG;IAC/C,aAAa,EAAE,KAAK,CAAA;CACrB,CAAA;AACD,MAAM,MAAM,iBAAiB,GAAG,cAAc,GAAG;IAC/C,aAAa,CAAC,EAAE,SAAS,CAAA;CAC1B,CAAA;AAED,MAAM,MAAM,MAAM,CAAC,CAAC,SAAS,cAAc,IAAI,CAAC,SAAS,gBAAgB,GACrE,IAAI,GACJ,CAAC,SAAS,iBAAiB,GAC3B,MAAM,GACN,CAAC,SAAS,iBAAiB,GAC3B,MAAM,GACN,IAAI,GAAG,MAAM,CAAA;AAEjB,MAAM,MAAM,OAAO,CAAC,CAAC,SAAS,cAAc,IAAI,CAAC,SAAS,gBAAgB,GACtE,GAAG,CAAC,IAAI,CAAC,GACT,CAAC,SAAS,iBAAiB,GAC3B,GAAG,CAAC,MAAM,CAAC,GACX,CAAC,SAAS,iBAAiB,GAC3B,GAAG,CAAC,MAAM,CAAC,GACX,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAA;AAEtB,MAAM,MAAM,WAAW,CAAC,CAAC,SAAS,cAAc,IAC9C,CAAC,SAAS,gBAAgB,GACtB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GACpB,CAAC,SAAS,iBAAiB,GAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB,CAAC,SAAS,iBAAiB,GAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB,QAAQ,CAAC,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,MAAM,CAAC,CAAA;AAY5C;;GAEG;AACH,8BAAsB,QAAQ,CAAC,CAAC,SAAS,cAAc,GAAG,cAAc;;IACtE,IAAI,EAAE,IAAI,CAAA;IACV,QAAQ,EAAE,OAAO,EAAE,CAAA;IACnB,IAAI,EAAE,CAAC,CAAA;IACP,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAkB;IACjC,MAAM,EAAE,OAAO,CAAQ;IACvB,OAAO,EAAE,OAAO,CAAQ;IAIxB,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,QAAQ,EAAE,MAAM,CAAA;gBAEJ,QAAQ,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IA8BpD,KAAK;IAGL,MAAM;IAUN,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG;IAahB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC;IAYpE,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS;IAUrE,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS;IAYzD,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI;IACtC,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAE1C,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO;IAsBhC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAKtE,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAK3D,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,MAAM,GAAG;IAOvD,OAAO,CACL,MAAM,EAAE,IAAI,EACZ,QAAQ,EAAE,OAAO,EAAE,EACnB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,MAAM,GAAG;IA2Cf,OAAO,CACL,MAAM,EAAE,IAAI,EACZ,OAAO,EAAE,IAAI,EAAE,EACf,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,MAAM,GAAG;IAsBf,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,MAAM,GAAG;IAO3D,WAAW,CACT,MAAM,EAAE,IAAI,EACZ,QAAQ,EAAE,OAAO,EAAE,EACnB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,MAAM,GAAG;IAqCf,WAAW,CACT,MAAM,EAAE,IAAI,EACZ,OAAO,EAAE,IAAI,EAAE,EACf,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,MAAM,GAAG;CAoBhB;AAED,qBAAa,UAAU,CACrB,CAAC,SAAS,cAAc,GAAG,cAAc,CACzC,SAAQ,QAAQ,CAAC,CAAC,CAAC;IACnB,OAAO,EAAE,CAAC,SAAS,gBAAgB,GAC/B,GAAG,CAAC,IAAI,CAAC,GACT,CAAC,SAAS,iBAAiB,GAC3B,GAAG,CAAC,MAAM,CAAC,GACX,CAAC,SAAS,iBAAiB,GAC3B,GAAG,CAAC,MAAM,CAAC,GACX,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAA;gBAEV,QAAQ,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAKpD,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI;IAKvB,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAiBjC,QAAQ,IAAI,OAAO,CAAC,CAAC,CAAC;CAWvB;AAED,qBAAa,UAAU,CACrB,CAAC,SAAS,cAAc,GAAG,cAAc,CACzC,SAAQ,QAAQ,CAAC,CAAC,CAAC;IACnB,OAAO,EAAE,CAAC,SAAS,gBAAgB,GAC/B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GACpB,CAAC,SAAS,iBAAiB,GAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB,CAAC,SAAS,iBAAiB,GAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB,QAAQ,CAAC,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,MAAM,CAAC,CAAA;gBAE9B,QAAQ,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAUpD,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI;IAM7B,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;IAYxB,UAAU,IAAI,WAAW,CAAC,CAAC,CAAC;CAO7B"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/walker.js.map b/deps/npm/node_modules/glob/dist/cjs/src/walker.js.map
deleted file mode 100644
index a7af398939ae48..00000000000000
--- a/deps/npm/node_modules/glob/dist/cjs/src/walker.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"walker.js","sourceRoot":"","sources":["../../../src/walker.ts"],"names":[],"mappings":";;;AAAA;;;;;GAKG;AACH,uCAAmC;AAEnC,2CAAgD;AAQhD,iDAA0C;AAiE1C,MAAM,UAAU,GAAG,CACjB,MAAsC,EACtC,IAAoB,EACR,EAAE,CACd,OAAO,MAAM,KAAK,QAAQ;IACxB,CAAC,CAAC,IAAI,kBAAM,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;IAC5B,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QACvB,CAAC,CAAC,IAAI,kBAAM,CAAC,MAAM,EAAE,IAAI,CAAC;QAC1B,CAAC,CAAC,MAAM,CAAA;AAEZ;;GAEG;AACH,MAAsB,QAAQ;IAC5B,IAAI,CAAM;IACV,QAAQ,CAAW;IACnB,IAAI,CAAG;IACP,IAAI,GAAc,IAAI,GAAG,EAAQ,CAAA;IACjC,MAAM,GAAY,KAAK,CAAA;IACvB,OAAO,GAAY,KAAK,CAAA;IACxB,SAAS,GAAkB,EAAE,CAAA;IAC7B,OAAO,CAAa;IACpB,IAAI,CAAY;IAChB,MAAM,CAAc;IACpB,QAAQ,CAAQ;IAGhB,YAAY,QAAmB,EAAE,IAAU,EAAE,IAAO;QAClD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAA;QACjE,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;SAC7C;QACD,6DAA6D;QAC7D,mBAAmB;QACnB,qBAAqB;QACrB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAA;QACzC,oBAAoB;QACpB,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YACzB,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE;gBACzC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;YAC3B,CAAC,CAAC,CAAA;SACH;IACH,CAAC;IAED,QAAQ,CAAC,IAAU;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,IAAI,CAAC,CAAA;IAC/D,CAAC;IACD,gBAAgB,CAAC,IAAU;QACzB,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,eAAe,EAAE,CAAC,IAAI,CAAC,CAAA;IAChD,CAAC;IAED,yBAAyB;IACzB,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAA;IACpB,CAAC;IACD,MAAM;QACJ,qBAAqB;QACrB,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,OAAM;QAChC,oBAAoB;QACpB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;QACnB,IAAI,EAAE,GAA4B,SAAS,CAAA;QAC3C,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE;YACpD,EAAE,EAAE,CAAA;SACL;IACH,CAAC;IACD,QAAQ,CAAC,EAAa;QACpB,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,OAAM;QAChC,qBAAqB;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,EAAE,EAAE,CAAA;SACL;aAAM;YACL,oBAAoB;YACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;SACxB;IACH,CAAC;IAED,+DAA+D;IAC/D,wCAAwC;IACxC,KAAK,CAAC,UAAU,CAAC,CAAO,EAAE,KAAc;QACtC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAA;QAC9C,IAAI,GAAqB,CAAA;QACzB,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YACtB,GAAG,GAAG,CAAC,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAA;YAChD,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAA;YAC1B,CAAC,GAAG,GAAG,CAAA;SACR;QACD,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;QAChD,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACnE,CAAC;IAED,cAAc,CAAC,CAAmB,EAAE,KAAc;QAChD,OAAO,CAAC;YACN,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC;YAC1D,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;YAC1B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACtC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACjB,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,SAAS,CAAA;IACf,CAAC;IAED,cAAc,CAAC,CAAO,EAAE,KAAc;QACpC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAA;QAC9C,IAAI,GAAqB,CAAA;QACzB,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YACtB,GAAG,GAAG,CAAC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC,YAAY,EAAE,CAAA;YAC5C,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAA;YAC1B,CAAC,GAAG,GAAG,CAAA;SACR;QACD,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;QAChD,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACjE,CAAC;IAKD,WAAW,CAAC,CAAO,EAAE,QAAiB;QACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAM;QAC5B,MAAM,GAAG,GACP,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAA;QAClE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;QAC/D,4BAA4B;QAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;YAC3B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;SAClB;aAAM,IAAI,GAAG,EAAE;YACd,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;YAC9D,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,IAAI,CAAC,CAAA;SAC3B;aAAM;YACL,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;YAC9D,MAAM,GAAG,GACP,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACxD,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI;gBACjB,CAAC,CAAC,EAAE,CAAA;YACR,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,CAAA;SACrD;IACH,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,CAAO,EAAE,QAAiB,EAAE,KAAc;QACpD,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QACzC,IAAI,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IACtC,CAAC;IAED,SAAS,CAAC,CAAO,EAAE,QAAiB,EAAE,KAAc;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QACvC,IAAI,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IACtC,CAAC;IAED,MAAM,CAAC,MAAY,EAAE,QAAmB,EAAE,EAAa;QACrD,qBAAqB;QACrB,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,EAAE,EAAE,CAAA;QAC9B,oBAAoB;QACpB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,wBAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;IAC9D,CAAC;IAED,OAAO,CACL,MAAY,EACZ,QAAmB,EACnB,SAAoB,EACpB,EAAa;QAEb,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,EAAE,CAAA;QAC9C,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,EAAE,EAAE,CAAA;QAC9B,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAA;YAClE,OAAM;SACP;QACD,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QAE3C,qEAAqE;QACrE,4DAA4D;QAC5D,yDAAyD;QACzD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,IAAI,EAAE,KAAK,KAAK,CAAC;gBAAE,EAAE,EAAE,CAAA;QACzB,CAAC,CAAA;QAED,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC9B,KAAK,EAAE,CAAA;YACP,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;SAClD;QAED,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,cAAc,EAAE,EAAE;YAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC5D,SAAQ;aACT;YACD,KAAK,EAAE,CAAA;YACP,MAAM,cAAc,GAAG,CAAC,CAAC,aAAa,EAAE,CAAA;YACxC,IAAI,CAAC,CAAC,aAAa,EAAE;gBACnB,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,CAAC,CAAA;iBAC7C;gBACH,CAAC,CAAC,SAAS,CACT,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,EACzD,IAAI,CACL,CAAA;aACF;SACF;QAED,IAAI,EAAE,CAAA;IACR,CAAC;IAED,OAAO,CACL,MAAY,EACZ,OAAe,EACf,SAAoB,EACpB,EAAa;QAEb,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAEpD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,IAAI,EAAE,KAAK,KAAK,CAAC;gBAAE,EAAE,EAAE,CAAA;QACzB,CAAC,CAAA;QAED,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC9B,KAAK,EAAE,CAAA;YACP,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;SAClD;QACD,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE;YAC7D,KAAK,EAAE,CAAA;YACP,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;SACxD;QAED,IAAI,EAAE,CAAA;IACR,CAAC;IAED,UAAU,CAAC,MAAY,EAAE,QAAmB,EAAE,EAAa;QACzD,qBAAqB;QACrB,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,EAAE,EAAE,CAAA;QAC9B,oBAAoB;QACpB,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,wBAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;IAClE,CAAC;IAED,WAAW,CACT,MAAY,EACZ,QAAmB,EACnB,SAAoB,EACpB,EAAa;QAEb,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,EAAE,CAAA;QAC9C,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,EAAE,EAAE,CAAA;QAC9B,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CACjB,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,CAAC,CAClD,CAAA;YACD,OAAM;SACP;QACD,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QAE3C,qEAAqE;QACrE,4DAA4D;QAC5D,yDAAyD;QACzD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,IAAI,EAAE,KAAK,KAAK,CAAC;gBAAE,EAAE,EAAE,CAAA;QACzB,CAAC,CAAA;QAED,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACnC;QAED,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,cAAc,EAAE,EAAE;YAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC5D,SAAQ;aACT;YACD,KAAK,EAAE,CAAA;YACP,MAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,EAAE,CAAA;YAChC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,CAAA;SAC/C;QAED,IAAI,EAAE,CAAA;IACR,CAAC;IAED,WAAW,CACT,MAAY,EACZ,OAAe,EACf,SAAoB,EACpB,EAAa;QAEb,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAEpD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,IAAI,EAAE,KAAK,KAAK,CAAC;gBAAE,EAAE,EAAE,CAAA;QACzB,CAAC,CAAA;QAED,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACnC;QACD,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE;YAC7D,KAAK,EAAE,CAAA;YACP,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;SAC5D;QAED,IAAI,EAAE,CAAA;IACR,CAAC;CACF;AAlSD,4BAkSC;AAED,MAAa,UAEX,SAAQ,QAAW;IACnB,OAAO,CAMe;IAEtB,YAAY,QAAmB,EAAE,IAAU,EAAE,IAAO;QAClD,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC3B,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAA;IACxC,CAAC;IAGD,SAAS,CAAC,CAAgB;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACrB,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QAClD,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE;YACzB,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;SACxB;QACD,MAAM,IAAI,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;YAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;gBACzC,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE;oBACxB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;iBACxB;qBAAM;oBACL,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;iBAClB;YACH,CAAC,CAAC,CAAA;QACJ,CAAC,CAAC,CAAA;QACF,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,QAAQ;QACN,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QAClD,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE;YACzB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAA;SACtB;QACD,4DAA4D;QAC5D,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;YAC7C,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;gBAAE,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QACpD,CAAC,CAAC,CAAA;QACF,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;CACF;AAjDD,gCAiDC;AAED,MAAa,UAEX,SAAQ,QAAW;IACnB,OAAO,CAMmC;IAE1C,YAAY,QAAmB,EAAE,IAAU,EAAE,IAAO;QAClD,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC3B,IAAI,CAAC,OAAO,GAAG,IAAI,mBAAQ,CAAC;YAC1B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,UAAU,EAAE,IAAI;SACjB,CAAmB,CAAA;QACpB,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QAC7C,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;IAChD,CAAC;IAGD,SAAS,CAAC,CAAgB;QACxB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QACrB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO;YAAE,IAAI,CAAC,KAAK,EAAE,CAAA;IACzC,CAAC;IAED,MAAM;QACJ,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAA;QACxB,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE;YACtB,MAAM,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;gBACvB,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;YAC9D,CAAC,CAAC,CAAA;SACH;aAAM;YACL,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;SAC7D;QACD,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,UAAU;QACR,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE;YACzB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAA;SACtB;QACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;QACnE,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;CACF;AA9CD,gCA8CC","sourcesContent":["/**\n * Single-use utility classes to provide functionality to the {@link Glob}\n * methods.\n *\n * @module\n */\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport { Ignore, IgnoreLike } from './ignore.js'\n\n// XXX can we somehow make it so that it NEVER processes a given path more than\n// once, enough that the match set tracking is no longer needed?  that'd speed\n// things up a lot.  Or maybe bring back nounique, and skip it in that case?\n\n// a single minimatch set entry with 1 or more parts\nimport { Pattern } from './pattern.js'\nimport { Processor } from './processor.js'\n\nexport interface GlobWalkerOpts {\n  absolute?: boolean\n  allowWindowsEscape?: boolean\n  cwd?: string | URL\n  dot?: boolean\n  dotRelative?: boolean\n  follow?: boolean\n  ignore?: string | string[] | IgnoreLike\n  mark?: boolean\n  matchBase?: boolean\n  // Note: maxDepth here means \"maximum actual Path.depth()\",\n  // not \"maximum depth beyond cwd\"\n  maxDepth?: number\n  nobrace?: boolean\n  nocase?: boolean\n  nodir?: boolean\n  noext?: boolean\n  noglobstar?: boolean\n  platform?: NodeJS.Platform\n  posix?: boolean\n  realpath?: boolean\n  root?: string\n  stat?: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape?: boolean\n  withFileTypes?: boolean\n}\n\nexport type GWOFileTypesTrue = GlobWalkerOpts & {\n  withFileTypes: true\n}\nexport type GWOFileTypesFalse = GlobWalkerOpts & {\n  withFileTypes: false\n}\nexport type GWOFileTypesUnset = GlobWalkerOpts & {\n  withFileTypes?: undefined\n}\n\nexport type Result<O extends GlobWalkerOpts> = O extends GWOFileTypesTrue\n  ? Path\n  : O extends GWOFileTypesFalse\n  ? string\n  : O extends GWOFileTypesUnset\n  ? string\n  : Path | string\n\nexport type Matches<O extends GlobWalkerOpts> = O extends GWOFileTypesTrue\n  ? Set<Path>\n  : O extends GWOFileTypesFalse\n  ? Set<string>\n  : O extends GWOFileTypesUnset\n  ? Set<string>\n  : Set<Path | string>\n\nexport type MatchStream<O extends GlobWalkerOpts> =\n  O extends GWOFileTypesTrue\n    ? Minipass<Path, Path>\n    : O extends GWOFileTypesFalse\n    ? Minipass<string, string>\n    : O extends GWOFileTypesUnset\n    ? Minipass<string, string>\n    : Minipass<Path | string, Path | string>\n\nconst makeIgnore = (\n  ignore: string | string[] | IgnoreLike,\n  opts: GlobWalkerOpts\n): IgnoreLike =>\n  typeof ignore === 'string'\n    ? new Ignore([ignore], opts)\n    : Array.isArray(ignore)\n    ? new Ignore(ignore, opts)\n    : ignore\n\n/**\n * basic walking utilities that all the glob walker types use\n */\nexport abstract class GlobUtil<O extends GlobWalkerOpts = GlobWalkerOpts> {\n  path: Path\n  patterns: Pattern[]\n  opts: O\n  seen: Set<Path> = new Set<Path>()\n  paused: boolean = false\n  aborted: boolean = false\n  #onResume: (() => any)[] = []\n  #ignore?: IgnoreLike\n  #sep: '\\\\' | '/'\n  signal?: AbortSignal\n  maxDepth: number\n\n  constructor(patterns: Pattern[], path: Path, opts: O)\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    this.patterns = patterns\n    this.path = path\n    this.opts = opts\n    this.#sep = !opts.posix && opts.platform === 'win32' ? '\\\\' : '/'\n    if (opts.ignore) {\n      this.#ignore = makeIgnore(opts.ignore, opts)\n    }\n    // ignore, always set with maxDepth, but it's optional on the\n    // GlobOptions type\n    /* c8 ignore start */\n    this.maxDepth = opts.maxDepth || Infinity\n    /* c8 ignore stop */\n    if (opts.signal) {\n      this.signal = opts.signal\n      this.signal.addEventListener('abort', () => {\n        this.#onResume.length = 0\n      })\n    }\n  }\n\n  #ignored(path: Path): boolean {\n    return this.seen.has(path) || !!this.#ignore?.ignored?.(path)\n  }\n  #childrenIgnored(path: Path): boolean {\n    return !!this.#ignore?.childrenIgnored?.(path)\n  }\n\n  // backpressure mechanism\n  pause() {\n    this.paused = true\n  }\n  resume() {\n    /* c8 ignore start */\n    if (this.signal?.aborted) return\n    /* c8 ignore stop */\n    this.paused = false\n    let fn: (() => any) | undefined = undefined\n    while (!this.paused && (fn = this.#onResume.shift())) {\n      fn()\n    }\n  }\n  onResume(fn: () => any) {\n    if (this.signal?.aborted) return\n    /* c8 ignore start */\n    if (!this.paused) {\n      fn()\n    } else {\n      /* c8 ignore stop */\n      this.#onResume.push(fn)\n    }\n  }\n\n  // do the requisite realpath/stat checking, and return the path\n  // to add or undefined to filter it out.\n  async matchCheck(e: Path, ifDir: boolean): Promise<Path | undefined> {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || (await e.realpath())\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    return this.matchCheckTest(needStat ? await e.lstat() : e, ifDir)\n  }\n\n  matchCheckTest(e: Path | undefined, ifDir: boolean): Path | undefined {\n    return e &&\n      (this.maxDepth === Infinity || e.depth() <= this.maxDepth) &&\n      (!ifDir || e.canReaddir()) &&\n      (!this.opts.nodir || !e.isDirectory()) &&\n      !this.#ignored(e)\n      ? e\n      : undefined\n  }\n\n  matchCheckSync(e: Path, ifDir: boolean): Path | undefined {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || e.realpathSync()\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    return this.matchCheckTest(needStat ? e.lstatSync() : e, ifDir)\n  }\n\n  abstract matchEmit(p: Result<O>): void\n  abstract matchEmit(p: string | Path): void\n\n  matchFinish(e: Path, absolute: boolean) {\n    if (this.#ignored(e)) return\n    const abs =\n      this.opts.absolute === undefined ? absolute : this.opts.absolute\n    this.seen.add(e)\n    const mark = this.opts.mark && e.isDirectory() ? this.#sep : ''\n    // ok, we have what we need!\n    if (this.opts.withFileTypes) {\n      this.matchEmit(e)\n    } else if (abs) {\n      const abs = this.opts.posix ? e.fullpathPosix() : e.fullpath()\n      this.matchEmit(abs + mark)\n    } else {\n      const rel = this.opts.posix ? e.relativePosix() : e.relative()\n      const pre =\n        this.opts.dotRelative && !rel.startsWith('..' + this.#sep)\n          ? '.' + this.#sep\n          : ''\n      this.matchEmit(!rel ? '.' + mark : pre + rel + mark)\n    }\n  }\n\n  async match(e: Path, absolute: boolean, ifDir: boolean): Promise<void> {\n    const p = await this.matchCheck(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  matchSync(e: Path, absolute: boolean, ifDir: boolean): void {\n    const p = this.matchCheckSync(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  walkCB(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() => this.walkCB2(target, patterns, processor, cb))\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const childrenCached = t.readdirCached()\n      if (t.calledReaddir())\n        this.walkCB3(t, childrenCached, processor, next)\n      else {\n        t.readdirCB(\n          (_, entries) => this.walkCB3(t, entries, processor, next),\n          true\n        )\n      }\n    }\n\n    next()\n  }\n\n  walkCB3(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n\n  walkCBSync(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2Sync(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2Sync(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() =>\n        this.walkCB2Sync(target, patterns, processor, cb)\n      )\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const children = t.readdirSync()\n      this.walkCB3Sync(t, children, processor, next)\n    }\n\n    next()\n  }\n\n  walkCB3Sync(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2Sync(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n}\n\nexport class GlobWalker<\n  O extends GlobWalkerOpts = GlobWalkerOpts\n> extends GlobUtil<O> {\n  matches: O extends GWOFileTypesTrue\n    ? Set<Path>\n    : O extends GWOFileTypesFalse\n    ? Set<string>\n    : O extends GWOFileTypesUnset\n    ? Set<string>\n    : Set<Path | string>\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n    this.matches = new Set() as Matches<O>\n  }\n\n  matchEmit(e: Result<O>): void\n  matchEmit(e: Path | string): void {\n    this.matches.add(e)\n  }\n\n  async walk(): Promise<Matches<O>> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      await this.path.lstat()\n    }\n    await new Promise((res, rej) => {\n      this.walkCB(this.path, this.patterns, () => {\n        if (this.signal?.aborted) {\n          rej(this.signal.reason)\n        } else {\n          res(this.matches)\n        }\n      })\n    })\n    return this.matches\n  }\n\n  walkSync(): Matches<O> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    // nothing for the callback to do, because this never pauses\n    this.walkCBSync(this.path, this.patterns, () => {\n      if (this.signal?.aborted) throw this.signal.reason\n    })\n    return this.matches\n  }\n}\n\nexport class GlobStream<\n  O extends GlobWalkerOpts = GlobWalkerOpts\n> extends GlobUtil<O> {\n  results: O extends GWOFileTypesTrue\n    ? Minipass<Path, Path>\n    : O extends GWOFileTypesFalse\n    ? Minipass<string, string>\n    : O extends GWOFileTypesUnset\n    ? Minipass<string, string>\n    : Minipass<Path | string, Path | string>\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n    this.results = new Minipass({\n      signal: this.signal,\n      objectMode: true,\n    }) as MatchStream<O>\n    this.results.on('drain', () => this.resume())\n    this.results.on('resume', () => this.resume())\n  }\n\n  matchEmit(e: Result<O>): void\n  matchEmit(e: Path | string): void {\n    this.results.write(e)\n    if (!this.results.flowing) this.pause()\n  }\n\n  stream(): MatchStream<O> {\n    const target = this.path\n    if (target.isUnknown()) {\n      target.lstat().then(() => {\n        this.walkCB(target, this.patterns, () => this.results.end())\n      })\n    } else {\n      this.walkCB(target, this.patterns, () => this.results.end())\n    }\n    return this.results\n  }\n\n  streamSync(): MatchStream<O> {\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    this.walkCBSync(this.path, this.patterns, () => this.results.end())\n    return this.results\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/glob.d.ts b/deps/npm/node_modules/glob/dist/commonjs/glob.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/glob.d.ts
rename to deps/npm/node_modules/glob/dist/commonjs/glob.d.ts
diff --git a/deps/npm/node_modules/glob/dist/mjs/glob.d.ts.map b/deps/npm/node_modules/glob/dist/commonjs/glob.d.ts.map
similarity index 98%
rename from deps/npm/node_modules/glob/dist/mjs/glob.d.ts.map
rename to deps/npm/node_modules/glob/dist/commonjs/glob.d.ts.map
index d45258ac24a580..5216438a25086b 100644
--- a/deps/npm/node_modules/glob/dist/mjs/glob.d.ts.map
+++ b/deps/npm/node_modules/glob/dist/commonjs/glob.d.ts.map
@@ -1 +1 @@
-{"version":3,"file":"glob.d.ts","sourceRoot":"","sources":["../../src/glob.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,SAAS,EAAoB,MAAM,WAAW,CAAA;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EACL,QAAQ,EACR,IAAI,EACJ,UAAU,EAIX,MAAM,aAAa,CAAA;AAEpB,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAGtC,MAAM,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;AACvC,MAAM,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,SAAS,CAAC,CAAA;AAWlE;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAElB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAE5B;;;;;OAKG;IACH,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,CAAA;IAElB;;;;OAIG;IACH,GAAG,CAAC,EAAE,OAAO,CAAA;IAEb;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,OAAO,CAAA;IAErB;;;;;;;;OAQG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IAEvC;;;;;OAKG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;OAGG;IACH,IAAI,CAAC,EAAE,OAAO,CAAA;IAEd;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,CAAA;IAEnB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;IAEjB;;;;;;;;;OASG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;OAEG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;;;;OAKG;IACH,UAAU,CAAC,EAAE,OAAO,CAAA;IAEpB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAA;IAE1B;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAElB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,IAAI,CAAC,EAAE,MAAM,CAAA;IAEb;;;;;OAKG;IACH,MAAM,CAAC,EAAE,UAAU,CAAA;IAEnB;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,OAAO,CAAA;IAEd;;;OAGG;IACH,MAAM,CAAC,EAAE,WAAW,CAAA;IAEpB;;;;;;;;;;;;;OAaG;IACH,oBAAoB,CAAC,EAAE,OAAO,CAAA;IAE9B;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;OAGG;IACH,EAAE,CAAC,EAAE,QAAQ,CAAA;IAEb;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;;;;;;OAOG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;CAChB;AAED,MAAM,MAAM,4BAA4B,GAAG,WAAW,GAAG;IACvD,aAAa,EAAE,IAAI,CAAA;IAEnB,QAAQ,CAAC,EAAE,SAAS,CAAA;IACpB,IAAI,CAAC,EAAE,SAAS,CAAA;IAChB,KAAK,CAAC,EAAE,SAAS,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG,WAAW,GAAG;IACxD,aAAa,CAAC,EAAE,KAAK,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG,WAAW,GAAG;IACxD,aAAa,CAAC,EAAE,SAAS,CAAA;CAC1B,CAAA;AAED,MAAM,MAAM,MAAM,CAAC,IAAI,IAAI,IAAI,SAAS,4BAA4B,GAChE,IAAI,GACJ,IAAI,SAAS,6BAA6B,GAC1C,MAAM,GACN,IAAI,SAAS,6BAA6B,GAC1C,MAAM,GACN,MAAM,GAAG,IAAI,CAAA;AACjB,MAAM,MAAM,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAA;AAE1C,MAAM,MAAM,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,4BAA4B,GACnE,IAAI,GACJ,IAAI,SAAS,6BAA6B,GAC1C,KAAK,GACL,IAAI,SAAS,6BAA6B,GAC1C,KAAK,GACL,OAAO,CAAA;AAEX;;GAEG;AACH,qBAAa,IAAI,CAAC,IAAI,SAAS,WAAW,CAAE,YAAW,WAAW;IAChE,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,GAAG,EAAE,MAAM,CAAA;IACX,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,OAAO,CAAA;IACZ,WAAW,EAAE,OAAO,CAAA;IACpB,MAAM,EAAE,OAAO,CAAA;IACf,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IACvC,aAAa,EAAE,OAAO,CAAA;IACtB,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,SAAS,EAAE,OAAO,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,OAAO,EAAE,OAAO,CAAA;IAChB,MAAM,EAAE,OAAO,CAAA;IACf,KAAK,EAAE,OAAO,CAAA;IACd,KAAK,EAAE,OAAO,CAAA;IACd,UAAU,EAAE,OAAO,CAAA;IACnB,OAAO,EAAE,MAAM,EAAE,CAAA;IACjB,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAA;IACzB,QAAQ,EAAE,OAAO,CAAA;IACjB,MAAM,EAAE,UAAU,CAAA;IAClB,IAAI,EAAE,OAAO,CAAA;IACb,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,oBAAoB,EAAE,OAAO,CAAA;IAC7B,aAAa,EAAE,SAAS,CAAC,IAAI,CAAC,CAAA;IAE9B;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;IAEV;;OAEG;IACH,QAAQ,EAAE,OAAO,EAAE,CAAA;IAEnB;;;;;;;;;;;OAWG;gBACS,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,IAAI,EAAE,IAAI;IAwHlD;;OAEG;IACG,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAmBpC;;OAEG;IACH,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAezB;;OAEG;IACH,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAa9C;;OAEG;IACH,UAAU,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAalD;;;OAGG;IACH,WAAW,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IAGlD,CAAC,MAAM,CAAC,QAAQ,CAAC;IAIjB;;;OAGG;IACH,OAAO,IAAI,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IAGnD,CAAC,MAAM,CAAC,aAAa,CAAC;CAGvB"}
\ No newline at end of file
+{"version":3,"file":"glob.d.ts","sourceRoot":"","sources":["../../src/glob.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,SAAS,EAAoB,MAAM,WAAW,CAAA;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EACL,QAAQ,EACR,IAAI,EACJ,UAAU,EAIX,MAAM,aAAa,CAAA;AAEpB,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAGtC,MAAM,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;AACvC,MAAM,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,SAAS,CAAC,CAAA;AAWlE;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAElB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAE5B;;;;;OAKG;IACH,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,CAAA;IAElB;;;;OAIG;IACH,GAAG,CAAC,EAAE,OAAO,CAAA;IAEb;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,OAAO,CAAA;IAErB;;;;;;;;OAQG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IAEvC;;;;;OAKG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;OAGG;IACH,IAAI,CAAC,EAAE,OAAO,CAAA;IAEd;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,CAAA;IAEnB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;IAEjB;;;;;;;;;OASG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;OAEG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;;;;OAKG;IACH,UAAU,CAAC,EAAE,OAAO,CAAA;IAEpB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAA;IAE1B;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAElB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,IAAI,CAAC,EAAE,MAAM,CAAA;IAEb;;;;;OAKG;IACH,MAAM,CAAC,EAAE,UAAU,CAAA;IAEnB;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,OAAO,CAAA;IAEd;;;OAGG;IACH,MAAM,CAAC,EAAE,WAAW,CAAA;IAEpB;;;;;;;;;;;;;OAaG;IACH,oBAAoB,CAAC,EAAE,OAAO,CAAA;IAE9B;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;OAGG;IACH,EAAE,CAAC,EAAE,QAAQ,CAAA;IAEb;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;;;;;;OAOG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;CAChB;AAED,MAAM,MAAM,4BAA4B,GAAG,WAAW,GAAG;IACvD,aAAa,EAAE,IAAI,CAAA;IAEnB,QAAQ,CAAC,EAAE,SAAS,CAAA;IACpB,IAAI,CAAC,EAAE,SAAS,CAAA;IAChB,KAAK,CAAC,EAAE,SAAS,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG,WAAW,GAAG;IACxD,aAAa,CAAC,EAAE,KAAK,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG,WAAW,GAAG;IACxD,aAAa,CAAC,EAAE,SAAS,CAAA;CAC1B,CAAA;AAED,MAAM,MAAM,MAAM,CAAC,IAAI,IAAI,IAAI,SAAS,4BAA4B,GAChE,IAAI,GACJ,IAAI,SAAS,6BAA6B,GAC1C,MAAM,GACN,IAAI,SAAS,6BAA6B,GAC1C,MAAM,GACN,MAAM,GAAG,IAAI,CAAA;AACjB,MAAM,MAAM,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAA;AAE1C,MAAM,MAAM,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,4BAA4B,GACnE,IAAI,GACJ,IAAI,SAAS,6BAA6B,GAC1C,KAAK,GACL,IAAI,SAAS,6BAA6B,GAC1C,KAAK,GACL,OAAO,CAAA;AAEX;;GAEG;AACH,qBAAa,IAAI,CAAC,IAAI,SAAS,WAAW,CAAE,YAAW,WAAW;IAChE,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,GAAG,EAAE,MAAM,CAAA;IACX,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,OAAO,CAAA;IACZ,WAAW,EAAE,OAAO,CAAA;IACpB,MAAM,EAAE,OAAO,CAAA;IACf,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IACvC,aAAa,EAAE,OAAO,CAAA;IACtB,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,SAAS,EAAE,OAAO,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,OAAO,EAAE,OAAO,CAAA;IAChB,MAAM,EAAE,OAAO,CAAA;IACf,KAAK,EAAE,OAAO,CAAA;IACd,KAAK,EAAE,OAAO,CAAA;IACd,UAAU,EAAE,OAAO,CAAA;IACnB,OAAO,EAAE,MAAM,EAAE,CAAA;IACjB,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAA;IACzB,QAAQ,EAAE,OAAO,CAAA;IACjB,MAAM,EAAE,UAAU,CAAA;IAClB,IAAI,EAAE,OAAO,CAAA;IACb,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,oBAAoB,EAAE,OAAO,CAAA;IAC7B,aAAa,EAAE,SAAS,CAAC,IAAI,CAAC,CAAA;IAE9B;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;IAEV;;OAEG;IACH,QAAQ,EAAE,OAAO,EAAE,CAAA;IAEnB;;;;;;;;;;;OAWG;gBACS,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,IAAI,EAAE,IAAI;IA4HlD;;OAEG;IACG,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAmBpC;;OAEG;IACH,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAezB;;OAEG;IACH,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAa9C;;OAEG;IACH,UAAU,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAalD;;;OAGG;IACH,WAAW,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IAGlD,CAAC,MAAM,CAAC,QAAQ,CAAC;IAIjB;;;OAGG;IACH,OAAO,IAAI,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IAGnD,CAAC,MAAM,CAAC,aAAa,CAAC;CAGvB"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/glob.js b/deps/npm/node_modules/glob/dist/commonjs/glob.js
similarity index 96%
rename from deps/npm/node_modules/glob/dist/cjs/src/glob.js
rename to deps/npm/node_modules/glob/dist/commonjs/glob.js
index eb37c6b9a6601e..5e37335c4426f1 100644
--- a/deps/npm/node_modules/glob/dist/cjs/src/glob.js
+++ b/deps/npm/node_modules/glob/dist/commonjs/glob.js
@@ -162,7 +162,12 @@ class Glob {
             return set;
         }, [[], []]);
         this.patterns = matchSet.map((set, i) => {
-            return new pattern_js_1.Pattern(set, globParts[i], 0, this.platform);
+            const g = globParts[i];
+            /* c8 ignore start */
+            if (!g)
+                throw new Error('invalid pattern object');
+            /* c8 ignore stop */
+            return new pattern_js_1.Pattern(set, g, 0, this.platform);
         });
     }
     async walk() {
diff --git a/deps/npm/node_modules/glob/dist/commonjs/glob.js.map b/deps/npm/node_modules/glob/dist/commonjs/glob.js.map
new file mode 100644
index 00000000000000..98601fe30edf96
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/commonjs/glob.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"glob.js","sourceRoot":"","sources":["../../src/glob.ts"],"names":[],"mappings":";;;AAAA,yCAAuD;AAEvD,6CAOoB;AACpB,6BAAmC;AAEnC,6CAAsC;AACtC,2CAAoD;AAKpD,4CAA4C;AAC5C,gDAAgD;AAChD,MAAM,eAAe,GACnB,OAAO,OAAO,KAAK,QAAQ;IAC3B,OAAO;IACP,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;IAClC,CAAC,CAAC,OAAO,CAAC,QAAQ;IAClB,CAAC,CAAC,OAAO,CAAA;AAgTb;;GAEG;AACH,MAAa,IAAI;IACf,QAAQ,CAAU;IAClB,GAAG,CAAQ;IACX,IAAI,CAAS;IACb,GAAG,CAAS;IACZ,WAAW,CAAS;IACpB,MAAM,CAAS;IACf,MAAM,CAAiC;IACvC,aAAa,CAAS;IACtB,IAAI,CAAU;IACd,SAAS,CAAS;IAClB,QAAQ,CAAQ;IAChB,OAAO,CAAS;IAChB,MAAM,CAAS;IACf,KAAK,CAAS;IACd,KAAK,CAAS;IACd,UAAU,CAAS;IACnB,OAAO,CAAU;IACjB,QAAQ,CAAiB;IACzB,QAAQ,CAAS;IACjB,MAAM,CAAY;IAClB,IAAI,CAAS;IACb,MAAM,CAAc;IACpB,oBAAoB,CAAS;IAC7B,aAAa,CAAiB;IAE9B;;OAEG;IACH,IAAI,CAAM;IAEV;;OAEG;IACH,QAAQ,CAAW;IAEnB;;;;;;;;;;;OAWG;IACH,YAAY,OAA0B,EAAE,IAAU;QAChD,qBAAqB;QACrB,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,SAAS,CAAC,uBAAuB,CAAC,CAAA;QACvD,oBAAoB;QACpB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAgC,CAAA;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;QACrB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAA;QACrC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QACvB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YACb,IAAI,CAAC,GAAG,GAAG,EAAE,CAAA;SACd;aAAM,IAAI,IAAI,CAAC,GAAG,YAAY,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE;YACpE,IAAI,CAAC,GAAG,GAAG,IAAA,mBAAa,EAAC,IAAI,CAAC,GAAG,CAAC,CAAA;SACnC;QACD,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,EAAE,CAAA;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAa,CAAA;QACzC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAA;QAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAE7B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAA;QACnC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAA;QACjC,IAAI,CAAC,QAAQ;YACX,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAA;QAC9D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAEzB,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YACrD,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;SAC9D;QAED,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;YAC/B,OAAO,GAAG,CAAC,OAAO,CAAC,CAAA;SACpB;QAED,IAAI,CAAC,oBAAoB;YACvB,CAAC,CAAC,IAAI,CAAC,oBAAoB;gBAC1B,IAAoB,CAAC,kBAAkB,KAAK,KAAK,CAAA;QAEpD,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC7B,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;SAClD;QAED,IAAI,IAAI,CAAC,SAAS,EAAE;YAClB,IAAI,IAAI,CAAC,UAAU,EAAE;gBACnB,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAA;aACvD;YACD,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAA;SAChE;QAED,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAEtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,eAAe,CAAA;QAChD,IAAI,CAAC,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAA;QAChD,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YACzB,IACE,IAAI,CAAC,MAAM,KAAK,SAAS;gBACzB,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAClC;gBACA,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAA;aACpE;SACF;aAAM;YACL,MAAM,MAAM,GACV,IAAI,CAAC,QAAQ,KAAK,OAAO;gBACvB,CAAC,CAAC,6BAAe;gBACjB,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBAC5B,CAAC,CAAC,8BAAgB;oBAClB,CAAC,CAAC,IAAI,CAAC,QAAQ;wBACf,CAAC,CAAC,6BAAe;wBACjB,CAAC,CAAC,wBAAU,CAAA;YAChB,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;gBACjC,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,EAAE,EAAE,IAAI,CAAC,EAAE;aACZ,CAAC,CAAA;SACH;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QAEhC,8DAA8D;QAC9D,0DAA0D;QAC1D,6DAA6D;QAC7D,kCAAkC;QAClC,MAAM,eAAe,GACnB,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAA;QAEzD,MAAM,GAAG,GAAqB;YAC5B,mCAAmC;YACnC,GAAG,IAAI;YACP,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,eAAe;YACf,SAAS,EAAE,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI;YACd,iBAAiB,EAAE,CAAC;YACpB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,oBAAoB,EAAE,IAAI,CAAC,oBAAoB;YAC/C,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;SACzB,CAAA;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,qBAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QACxD,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,GAAG,CAAC,MAAM,CACtC,CAAC,GAA0B,EAAE,CAAC,EAAE,EAAE;YAChC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YACrB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAA;YAC3B,OAAO,GAAG,CAAA;QACZ,CAAC,EACD,CAAC,EAAE,EAAE,EAAE,CAAC,CACT,CAAA;QACD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;YACtB,qBAAqB;YACrB,IAAI,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;YACjD,oBAAoB;YACpB,OAAO,IAAI,oBAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC9C,CAAC,CAAC,CAAA;IACJ,CAAC;IAMD,KAAK,CAAC,IAAI;QACR,kEAAkE;QAClE,iEAAiE;QACjE,uEAAuE;QACvE,sCAAsC;QACtC,OAAO;YACL,GAAG,CAAC,MAAM,IAAI,sBAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;gBACvD,GAAG,IAAI,CAAC,IAAI;gBACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;oBACzC,CAAC,CAAC,QAAQ;gBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC,IAAI,EAAE,CAAC;SACX,CAAA;IACH,CAAC;IAMD,QAAQ;QACN,OAAO;YACL,GAAG,IAAI,sBAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;gBAChD,GAAG,IAAI,CAAC,IAAI;gBACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;oBACzC,CAAC,CAAC,QAAQ;gBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC,QAAQ,EAAE;SACd,CAAA;IACH,CAAC;IAMD,MAAM;QACJ,OAAO,IAAI,sBAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpD,GAAG,IAAI,CAAC,IAAI;YACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;gBACzC,CAAC,CAAC,QAAQ;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,MAAM,EAAE,CAAA;IACb,CAAC;IAMD,UAAU;QACR,OAAO,IAAI,sBAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpD,GAAG,IAAI,CAAC,IAAI;YACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;gBACzC,CAAC,CAAC,QAAQ;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,UAAU,EAAE,CAAA;IACjB,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IACD,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,WAAW,EAAE,CAAA;IAC3B,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAA;IAC9C,CAAC;IACD,CAAC,MAAM,CAAC,aAAa,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;IACvB,CAAC;CACF;AAzQD,oBAyQC","sourcesContent":["import { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport {\n  FSOption,\n  Path,\n  PathScurry,\n  PathScurryDarwin,\n  PathScurryPosix,\n  PathScurryWin32,\n} from 'path-scurry'\nimport { fileURLToPath } from 'url'\nimport { IgnoreLike } from './ignore.js'\nimport { Pattern } from './pattern.js'\nimport { GlobStream, GlobWalker } from './walker.js'\n\nexport type MatchSet = Minimatch['set']\nexport type GlobParts = Exclude<Minimatch['globParts'], undefined>\n\n// if no process global, just call it linux.\n// so we default to case-sensitive, / separators\nconst defaultPlatform: NodeJS.Platform =\n  typeof process === 'object' &&\n  process &&\n  typeof process.platform === 'string'\n    ? process.platform\n    : 'linux'\n\n/**\n * A `GlobOptions` object may be provided to any of the exported methods, and\n * must be provided to the `Glob` constructor.\n *\n * All options are optional, boolean, and false by default, unless otherwise\n * noted.\n *\n * All resolved options are added to the Glob object as properties.\n *\n * If you are running many `glob` operations, you can pass a Glob object as the\n * `options` argument to a subsequent operation to share the previously loaded\n * cache.\n */\nexport interface GlobOptions {\n  /**\n   * Set to `true` to always receive absolute paths for\n   * matched files. Set to `false` to always return relative paths.\n   *\n   * When this option is not set, absolute paths are returned for patterns\n   * that are absolute, and otherwise paths are returned that are relative\n   * to the `cwd` setting.\n   *\n   * This does _not_ make an extra system call to get\n   * the realpath, it only does string path resolution.\n   *\n   * Conflicts with {@link withFileTypes}\n   */\n  absolute?: boolean\n\n  /**\n   * Set to false to enable {@link windowsPathsNoEscape}\n   *\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n\n  /**\n   * The current working directory in which to search. Defaults to\n   * `process.cwd()`.\n   *\n   * May be eiher a string path or a `file://` URL object or string.\n   */\n  cwd?: string | URL\n\n  /**\n   * Include `.dot` files in normal matches and `globstar`\n   * matches. Note that an explicit dot in a portion of the pattern\n   * will always match dot files.\n   */\n  dot?: boolean\n\n  /**\n   * Prepend all relative path strings with `./` (or `.\\` on Windows).\n   *\n   * Without this option, returned relative paths are \"bare\", so instead of\n   * returning `'./foo/bar'`, they are returned as `'foo/bar'`.\n   *\n   * Relative patterns starting with `'../'` are not prepended with `./`, even\n   * if this option is set.\n   */\n  dotRelative?: boolean\n\n  /**\n   * Follow symlinked directories when expanding `**`\n   * patterns. This can result in a lot of duplicate references in\n   * the presence of cyclic links, and make performance quite bad.\n   *\n   * By default, a `**` in a pattern will follow 1 symbolic link if\n   * it is not the first item in the pattern, or none if it is the\n   * first item in the pattern, following the same behavior as Bash.\n   */\n  follow?: boolean\n\n  /**\n   * string or string[], or an object with `ignore` and `ignoreChildren`\n   * methods.\n   *\n   * If a string or string[] is provided, then this is treated as a glob\n   * pattern or array of glob patterns to exclude from matches. To ignore all\n   * children within a directory, as well as the entry itself, append `'/**'`\n   * to the ignore pattern.\n   *\n   * **Note** `ignore` patterns are _always_ in `dot:true` mode, regardless of\n   * any other settings.\n   *\n   * If an object is provided that has `ignored(path)` and/or\n   * `childrenIgnored(path)` methods, then these methods will be called to\n   * determine whether any Path is a match or if its children should be\n   * traversed, respectively.\n   */\n  ignore?: string | string[] | IgnoreLike\n\n  /**\n   * Treat brace expansion like `{a,b}` as a \"magic\" pattern. Has no\n   * effect if {@link nobrace} is set.\n   *\n   * Only has effect on the {@link hasMagic} function.\n   */\n  magicalBraces?: boolean\n\n  /**\n   * Add a `/` character to directory matches. Note that this requires\n   * additional stat calls in some cases.\n   */\n  mark?: boolean\n\n  /**\n   * Perform a basename-only match if the pattern does not contain any slash\n   * characters. That is, `*.js` would be treated as equivalent to\n   * `**\\/*.js`, matching all js files in all directories.\n   */\n  matchBase?: boolean\n\n  /**\n   * Limit the directory traversal to a given depth below the cwd.\n   * Note that this does NOT prevent traversal to sibling folders,\n   * root patterns, and so on. It only limits the maximum folder depth\n   * that the walk will descend, relative to the cwd.\n   */\n  maxDepth?: number\n\n  /**\n   * Do not expand `{a,b}` and `{1..3}` brace sets.\n   */\n  nobrace?: boolean\n\n  /**\n   * Perform a case-insensitive match. This defaults to `true` on macOS and\n   * Windows systems, and `false` on all others.\n   *\n   * **Note** `nocase` should only be explicitly set when it is\n   * known that the filesystem's case sensitivity differs from the\n   * platform default. If set `true` on case-sensitive file\n   * systems, or `false` on case-insensitive file systems, then the\n   * walk may return more or less results than expected.\n   */\n  nocase?: boolean\n\n  /**\n   * Do not match directories, only files. (Note: to match\n   * _only_ directories, put a `/` at the end of the pattern.)\n   */\n  nodir?: boolean\n\n  /**\n   * Do not match \"extglob\" patterns such as `+(a|b)`.\n   */\n  noext?: boolean\n\n  /**\n   * Do not match `**` against multiple filenames. (Ie, treat it as a normal\n   * `*` instead.)\n   *\n   * Conflicts with {@link matchBase}\n   */\n  noglobstar?: boolean\n\n  /**\n   * Defaults to value of `process.platform` if available, or `'linux'` if\n   * not. Setting `platform:'win32'` on non-Windows systems may cause strange\n   * behavior.\n   */\n  platform?: NodeJS.Platform\n\n  /**\n   * Set to true to call `fs.realpath` on all of the\n   * results. In the case of an entry that cannot be resolved, the\n   * entry is omitted. This incurs a slight performance penalty, of\n   * course, because of the added system calls.\n   */\n  realpath?: boolean\n\n  /**\n   *\n   * A string path resolved against the `cwd` option, which\n   * is used as the starting point for absolute patterns that start\n   * with `/`, (but not drive letters or UNC paths on Windows).\n   *\n   * Note that this _doesn't_ necessarily limit the walk to the\n   * `root` directory, and doesn't affect the cwd starting point for\n   * non-absolute patterns. A pattern containing `..` will still be\n   * able to traverse out of the root directory, if it is not an\n   * actual root directory on the filesystem, and any non-absolute\n   * patterns will be matched in the `cwd`. For example, the\n   * pattern `/../*` with `{root:'/some/path'}` will return all\n   * files in `/some`, not all files in `/some/path`. The pattern\n   * `*` with `{root:'/some/path'}` will return all the entries in\n   * the cwd, not the entries in `/some/path`.\n   *\n   * To start absolute and non-absolute patterns in the same\n   * path, you can use `{root:''}`. However, be aware that on\n   * Windows systems, a pattern like `x:/*` or `//host/share/*` will\n   * _always_ start in the `x:/` or `//host/share` directory,\n   * regardless of the `root` setting.\n   */\n  root?: string\n\n  /**\n   * A [PathScurry](http://npm.im/path-scurry) object used\n   * to traverse the file system. If the `nocase` option is set\n   * explicitly, then any provided `scurry` object must match this\n   * setting.\n   */\n  scurry?: PathScurry\n\n  /**\n   * Call `lstat()` on all entries, whether required or not to determine\n   * if it's a valid match. When used with {@link withFileTypes}, this means\n   * that matches will include data such as modified time, permissions, and\n   * so on.  Note that this will incur a performance cost due to the added\n   * system calls.\n   */\n  stat?: boolean\n\n  /**\n   * An AbortSignal which will cancel the Glob walk when\n   * triggered.\n   */\n  signal?: AbortSignal\n\n  /**\n   * Use `\\\\` as a path separator _only_, and\n   *  _never_ as an escape character. If set, all `\\\\` characters are\n   *  replaced with `/` in the pattern.\n   *\n   *  Note that this makes it **impossible** to match against paths\n   *  containing literal glob pattern characters, but allows matching\n   *  with patterns constructed using `path.join()` and\n   *  `path.resolve()` on Windows platforms, mimicking the (buggy!)\n   *  behavior of Glob v7 and before on Windows. Please use with\n   *  caution, and be mindful of [the caveat below about Windows\n   *  paths](#windows). (For legacy reasons, this is also set if\n   *  `allowWindowsEscape` is set to the exact value `false`.)\n   */\n  windowsPathsNoEscape?: boolean\n\n  /**\n   * Return [PathScurry](http://npm.im/path-scurry)\n   * `Path` objects instead of strings. These are similar to a\n   * NodeJS `Dirent` object, but with additional methods and\n   * properties.\n   *\n   * Conflicts with {@link absolute}\n   */\n  withFileTypes?: boolean\n\n  /**\n   * An fs implementation to override some or all of the defaults.  See\n   * http://npm.im/path-scurry for details about what can be overridden.\n   */\n  fs?: FSOption\n\n  /**\n   * Just passed along to Minimatch.  Note that this makes all pattern\n   * matching operations slower and *extremely* noisy.\n   */\n  debug?: boolean\n\n  /**\n   * Return `/` delimited paths, even on Windows.\n   *\n   * On posix systems, this has no effect.  But, on Windows, it means that\n   * paths will be `/` delimited, and absolute paths will be their full\n   * resolved UNC forms, eg instead of `'C:\\\\foo\\\\bar'`, it would return\n   * `'//?/C:/foo/bar'`\n   */\n  posix?: boolean\n}\n\nexport type GlobOptionsWithFileTypesTrue = GlobOptions & {\n  withFileTypes: true\n  // string options not relevant if returning Path objects.\n  absolute?: undefined\n  mark?: undefined\n  posix?: undefined\n}\n\nexport type GlobOptionsWithFileTypesFalse = GlobOptions & {\n  withFileTypes?: false\n}\n\nexport type GlobOptionsWithFileTypesUnset = GlobOptions & {\n  withFileTypes?: undefined\n}\n\nexport type Result<Opts> = Opts extends GlobOptionsWithFileTypesTrue\n  ? Path\n  : Opts extends GlobOptionsWithFileTypesFalse\n  ? string\n  : Opts extends GlobOptionsWithFileTypesUnset\n  ? string\n  : string | Path\nexport type Results<Opts> = Result<Opts>[]\n\nexport type FileTypes<Opts> = Opts extends GlobOptionsWithFileTypesTrue\n  ? true\n  : Opts extends GlobOptionsWithFileTypesFalse\n  ? false\n  : Opts extends GlobOptionsWithFileTypesUnset\n  ? false\n  : boolean\n\n/**\n * An object that can perform glob pattern traversals.\n */\nexport class Glob<Opts extends GlobOptions> implements GlobOptions {\n  absolute?: boolean\n  cwd: string\n  root?: string\n  dot: boolean\n  dotRelative: boolean\n  follow: boolean\n  ignore?: string | string[] | IgnoreLike\n  magicalBraces: boolean\n  mark?: boolean\n  matchBase: boolean\n  maxDepth: number\n  nobrace: boolean\n  nocase: boolean\n  nodir: boolean\n  noext: boolean\n  noglobstar: boolean\n  pattern: string[]\n  platform: NodeJS.Platform\n  realpath: boolean\n  scurry: PathScurry\n  stat: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape: boolean\n  withFileTypes: FileTypes<Opts>\n\n  /**\n   * The options provided to the constructor.\n   */\n  opts: Opts\n\n  /**\n   * An array of parsed immutable {@link Pattern} objects.\n   */\n  patterns: Pattern[]\n\n  /**\n   * All options are stored as properties on the `Glob` object.\n   *\n   * See {@link GlobOptions} for full options descriptions.\n   *\n   * Note that a previous `Glob` object can be passed as the\n   * `GlobOptions` to another `Glob` instantiation to re-use settings\n   * and caches with a new pattern.\n   *\n   * Traversal functions can be called multiple times to run the walk\n   * again.\n   */\n  constructor(pattern: string | string[], opts: Opts) {\n    /* c8 ignore start */\n    if (!opts) throw new TypeError('glob options required')\n    /* c8 ignore stop */\n    this.withFileTypes = !!opts.withFileTypes as FileTypes<Opts>\n    this.signal = opts.signal\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.dotRelative = !!opts.dotRelative\n    this.nodir = !!opts.nodir\n    this.mark = !!opts.mark\n    if (!opts.cwd) {\n      this.cwd = ''\n    } else if (opts.cwd instanceof URL || opts.cwd.startsWith('file://')) {\n      opts.cwd = fileURLToPath(opts.cwd)\n    }\n    this.cwd = opts.cwd || ''\n    this.root = opts.root\n    this.magicalBraces = !!opts.magicalBraces\n    this.nobrace = !!opts.nobrace\n    this.noext = !!opts.noext\n    this.realpath = !!opts.realpath\n    this.absolute = opts.absolute\n\n    this.noglobstar = !!opts.noglobstar\n    this.matchBase = !!opts.matchBase\n    this.maxDepth =\n      typeof opts.maxDepth === 'number' ? opts.maxDepth : Infinity\n    this.stat = !!opts.stat\n    this.ignore = opts.ignore\n\n    if (this.withFileTypes && this.absolute !== undefined) {\n      throw new Error('cannot set absolute and withFileTypes:true')\n    }\n\n    if (typeof pattern === 'string') {\n      pattern = [pattern]\n    }\n\n    this.windowsPathsNoEscape =\n      !!opts.windowsPathsNoEscape ||\n      (opts as GlobOptions).allowWindowsEscape === false\n\n    if (this.windowsPathsNoEscape) {\n      pattern = pattern.map(p => p.replace(/\\\\/g, '/'))\n    }\n\n    if (this.matchBase) {\n      if (opts.noglobstar) {\n        throw new TypeError('base matching requires globstar')\n      }\n      pattern = pattern.map(p => (p.includes('/') ? p : `./**/${p}`))\n    }\n\n    this.pattern = pattern\n\n    this.platform = opts.platform || defaultPlatform\n    this.opts = { ...opts, platform: this.platform }\n    if (opts.scurry) {\n      this.scurry = opts.scurry\n      if (\n        opts.nocase !== undefined &&\n        opts.nocase !== opts.scurry.nocase\n      ) {\n        throw new Error('nocase option contradicts provided scurry option')\n      }\n    } else {\n      const Scurry =\n        opts.platform === 'win32'\n          ? PathScurryWin32\n          : opts.platform === 'darwin'\n          ? PathScurryDarwin\n          : opts.platform\n          ? PathScurryPosix\n          : PathScurry\n      this.scurry = new Scurry(this.cwd, {\n        nocase: opts.nocase,\n        fs: opts.fs,\n      })\n    }\n    this.nocase = this.scurry.nocase\n\n    // If you do nocase:true on a case-sensitive file system, then\n    // we need to use regexps instead of strings for non-magic\n    // path portions, because statting `aBc` won't return results\n    // for the file `AbC` for example.\n    const nocaseMagicOnly =\n      this.platform === 'darwin' || this.platform === 'win32'\n\n    const mmo: MinimatchOptions = {\n      // default nocase based on platform\n      ...opts,\n      dot: this.dot,\n      matchBase: this.matchBase,\n      nobrace: this.nobrace,\n      nocase: this.nocase,\n      nocaseMagicOnly,\n      nocomment: true,\n      noext: this.noext,\n      nonegate: true,\n      optimizationLevel: 2,\n      platform: this.platform,\n      windowsPathsNoEscape: this.windowsPathsNoEscape,\n      debug: !!this.opts.debug,\n    }\n\n    const mms = this.pattern.map(p => new Minimatch(p, mmo))\n    const [matchSet, globParts] = mms.reduce(\n      (set: [MatchSet, GlobParts], m) => {\n        set[0].push(...m.set)\n        set[1].push(...m.globParts)\n        return set\n      },\n      [[], []]\n    )\n    this.patterns = matchSet.map((set, i) => {\n      const g = globParts[i]\n      /* c8 ignore start */\n      if (!g) throw new Error('invalid pattern object')\n      /* c8 ignore stop */\n      return new Pattern(set, g, 0, this.platform)\n    })\n  }\n\n  /**\n   * Returns a Promise that resolves to the results array.\n   */\n  async walk(): Promise<Results<Opts>>\n  async walk(): Promise<(string | Path)[]> {\n    // Walkers always return array of Path objects, so we just have to\n    // coerce them into the right shape.  It will have already called\n    // realpath() if the option was set to do so, so we know that's cached.\n    // start out knowing the cwd, at least\n    return [\n      ...(await new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity\n            ? this.maxDepth + this.scurry.cwd.depth()\n            : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n      }).walk()),\n    ]\n  }\n\n  /**\n   * synchronous {@link Glob.walk}\n   */\n  walkSync(): Results<Opts>\n  walkSync(): (string | Path)[] {\n    return [\n      ...new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity\n            ? this.maxDepth + this.scurry.cwd.depth()\n            : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n      }).walkSync(),\n    ]\n  }\n\n  /**\n   * Stream results asynchronously.\n   */\n  stream(): Minipass<Result<Opts>, Result<Opts>>\n  stream(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity\n          ? this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n    }).stream()\n  }\n\n  /**\n   * Stream results synchronously.\n   */\n  streamSync(): Minipass<Result<Opts>, Result<Opts>>\n  streamSync(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity\n          ? this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n    }).streamSync()\n  }\n\n  /**\n   * Default sync iteration function. Returns a Generator that\n   * iterates over the results.\n   */\n  iterateSync(): Generator<Result<Opts>, void, void> {\n    return this.streamSync()[Symbol.iterator]()\n  }\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  /**\n   * Default async iteration function. Returns an AsyncGenerator that\n   * iterates over the results.\n   */\n  iterate(): AsyncGenerator<Result<Opts>, void, void> {\n    return this.stream()[Symbol.asyncIterator]()\n  }\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/has-magic.d.ts b/deps/npm/node_modules/glob/dist/commonjs/has-magic.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/has-magic.d.ts
rename to deps/npm/node_modules/glob/dist/commonjs/has-magic.d.ts
diff --git a/deps/npm/node_modules/glob/dist/mjs/has-magic.d.ts.map b/deps/npm/node_modules/glob/dist/commonjs/has-magic.d.ts.map
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/has-magic.d.ts.map
rename to deps/npm/node_modules/glob/dist/commonjs/has-magic.d.ts.map
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/has-magic.js b/deps/npm/node_modules/glob/dist/commonjs/has-magic.js
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/has-magic.js
rename to deps/npm/node_modules/glob/dist/commonjs/has-magic.js
diff --git a/deps/npm/node_modules/glob/dist/commonjs/has-magic.js.map b/deps/npm/node_modules/glob/dist/commonjs/has-magic.js.map
new file mode 100644
index 00000000000000..5e71e3a58a2d6e
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/commonjs/has-magic.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"has-magic.js","sourceRoot":"","sources":["../../src/has-magic.ts"],"names":[],"mappings":";;;AAAA,yCAAqC;AAGrC;;;;;;;;;;GAUG;AACI,MAAM,QAAQ,GAAG,CACtB,OAA0B,EAC1B,UAAuB,EAAE,EAChB,EAAE;IACX,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE;QAC3B,OAAO,GAAG,CAAC,OAAO,CAAC,CAAA;KACpB;IACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;QACvB,IAAI,IAAI,qBAAS,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,QAAQ,EAAE;YAAE,OAAO,IAAI,CAAA;KACtD;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAXY,QAAA,QAAQ,YAWpB","sourcesContent":["import { Minimatch } from 'minimatch'\nimport { GlobOptions } from './glob.js'\n\n/**\n * Return true if the patterns provided contain any magic glob characters,\n * given the options provided.\n *\n * Brace expansion is not considered \"magic\" unless the `magicalBraces` option\n * is set, as brace expansion just turns one string into an array of strings.\n * So a pattern like `'x{a,b}y'` would return `false`, because `'xay'` and\n * `'xby'` both do not contain any magic glob characters, and it's treated the\n * same as if you had called it on `['xay', 'xby']`. When `magicalBraces:true`\n * is in the options, brace expansion _is_ treated as a pattern having magic.\n */\nexport const hasMagic = (\n  pattern: string | string[],\n  options: GlobOptions = {}\n): boolean => {\n  if (!Array.isArray(pattern)) {\n    pattern = [pattern]\n  }\n  for (const p of pattern) {\n    if (new Minimatch(p, options).hasMagic()) return true\n  }\n  return false\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/ignore.d.ts b/deps/npm/node_modules/glob/dist/commonjs/ignore.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/ignore.d.ts
rename to deps/npm/node_modules/glob/dist/commonjs/ignore.d.ts
diff --git a/deps/npm/node_modules/glob/dist/mjs/ignore.d.ts.map b/deps/npm/node_modules/glob/dist/commonjs/ignore.d.ts.map
similarity index 91%
rename from deps/npm/node_modules/glob/dist/mjs/ignore.d.ts.map
rename to deps/npm/node_modules/glob/dist/commonjs/ignore.d.ts.map
index e0018cf935b046..be7831769d33ed 100644
--- a/deps/npm/node_modules/glob/dist/mjs/ignore.d.ts.map
+++ b/deps/npm/node_modules/glob/dist/commonjs/ignore.d.ts.map
@@ -1 +1 @@
-{"version":3,"file":"ignore.d.ts","sourceRoot":"","sources":["../../src/ignore.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAElC,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAE5C,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAA;IAC9B,eAAe,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAA;CACvC;AASD;;GAEG;AACH,qBAAa,MAAO,YAAW,UAAU;IACvC,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,gBAAgB,EAAE,SAAS,EAAE,CAAA;IAC7B,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,gBAAgB,EAAE,SAAS,EAAE,CAAA;gBAG3B,OAAO,EAAE,MAAM,EAAE,EACjB,EACE,OAAO,EACP,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAA0B,GAC3B,EAAE,cAAc;IAiDnB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO;IAczB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO;CAWlC"}
\ No newline at end of file
+{"version":3,"file":"ignore.d.ts","sourceRoot":"","sources":["../../src/ignore.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAElC,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAE5C,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAA;IAC9B,eAAe,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAA;CACvC;AASD;;GAEG;AACH,qBAAa,MAAO,YAAW,UAAU;IACvC,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,gBAAgB,EAAE,SAAS,EAAE,CAAA;IAC7B,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,gBAAgB,EAAE,SAAS,EAAE,CAAA;gBAG3B,OAAO,EAAE,MAAM,EAAE,EACjB,EACE,OAAO,EACP,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAA0B,GAC3B,EAAE,cAAc;IAsDnB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO;IAczB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO;CAWlC"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/ignore.js b/deps/npm/node_modules/glob/dist/commonjs/ignore.js
similarity index 94%
rename from deps/npm/node_modules/glob/dist/cjs/src/ignore.js
rename to deps/npm/node_modules/glob/dist/commonjs/ignore.js
index 0cbcca335e1cca..6cffb49f8ed27c 100644
--- a/deps/npm/node_modules/glob/dist/cjs/src/ignore.js
+++ b/deps/npm/node_modules/glob/dist/commonjs/ignore.js
@@ -53,6 +53,11 @@ class Ignore {
             for (let i = 0; i < mm.set.length; i++) {
                 const parsed = mm.set[i];
                 const globParts = mm.globParts[i];
+                /* c8 ignore start */
+                if (!parsed || !globParts) {
+                    throw new Error('invalid pattern object');
+                }
+                /* c8 ignore stop */
                 const p = new pattern_js_1.Pattern(parsed, globParts, 0, platform);
                 const m = new minimatch_1.Minimatch(p.globString(), mmopts);
                 const children = globParts[globParts.length - 1] === '**';
@@ -94,7 +99,7 @@ class Ignore {
         }
         for (const m of this.absoluteChildren) {
             if (m.match(fullpath))
-                true;
+                return true;
         }
         return false;
     }
diff --git a/deps/npm/node_modules/glob/dist/commonjs/ignore.js.map b/deps/npm/node_modules/glob/dist/commonjs/ignore.js.map
new file mode 100644
index 00000000000000..3533cfc8811e90
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/commonjs/ignore.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"ignore.js","sourceRoot":"","sources":["../../src/ignore.ts"],"names":[],"mappings":";AAAA,sDAAsD;AACtD,kCAAkC;AAClC,kEAAkE;AAClE,6CAA6C;;;AAE7C,yCAAqC;AAErC,6CAAsC;AAQtC,MAAM,eAAe,GACnB,OAAO,OAAO,KAAK,QAAQ;IAC3B,OAAO;IACP,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;IAClC,CAAC,CAAC,OAAO,CAAC,QAAQ;IAClB,CAAC,CAAC,OAAO,CAAA;AAEb;;GAEG;AACH,MAAa,MAAM;IACjB,QAAQ,CAAa;IACrB,gBAAgB,CAAa;IAC7B,QAAQ,CAAa;IACrB,gBAAgB,CAAa;IAE7B,YACE,OAAiB,EACjB,EACE,OAAO,EACP,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAAQ,GAAG,eAAe,GACX;QAEjB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;QAC1B,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;QAC1B,MAAM,MAAM,GAAG;YACb,GAAG,EAAE,IAAI;YACT,OAAO;YACP,MAAM;YACN,KAAK;YACL,UAAU;YACV,iBAAiB,EAAE,CAAC;YACpB,QAAQ;YACR,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,IAAI;SACf,CAAA;QAED,mEAAmE;QACnE,gEAAgE;QAChE,mEAAmE;QACnE,uCAAuC;QACvC,mEAAmE;QACnE,qEAAqE;QACrE,uBAAuB;QACvB,uEAAuE;QACvE,oEAAoE;QACpE,qBAAqB;QACrB,sEAAsE;QACtE,wCAAwC;QACxC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;YACzB,MAAM,EAAE,GAAG,IAAI,qBAAS,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACxB,MAAM,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;gBACjC,qBAAqB;gBACrB,IAAI,CAAC,MAAM,IAAI,CAAC,SAAS,EAAE;oBACzB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;iBAC1C;gBACD,oBAAoB;gBACpB,MAAM,CAAC,GAAG,IAAI,oBAAO,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;gBACrD,MAAM,CAAC,GAAG,IAAI,qBAAS,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,MAAM,CAAC,CAAA;gBAC/C,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAA;gBACzD,MAAM,QAAQ,GAAG,CAAC,CAAC,UAAU,EAAE,CAAA;gBAC/B,IAAI,QAAQ;oBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;oBAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBAC1B,IAAI,QAAQ,EAAE;oBACZ,IAAI,QAAQ;wBAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;wBACtC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;iBACnC;aACF;SACF;IACH,CAAC;IAED,OAAO,CAAC,CAAO;QACb,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAA;QAC7B,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,CAAA;QAChC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAA;QACpC,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,CAAA;QAChC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;SACzD;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;SACzD;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,eAAe,CAAC,CAAO;QACrB,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAA;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,GAAG,GAAG,CAAA;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACrC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;gBAAE,OAAO,IAAI,CAAA;SACnC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACrC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;gBAAE,OAAO,IAAI,CAAA;SACnC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;CACF;AA7FD,wBA6FC","sourcesContent":["// give it a pattern, and it'll be able to tell you if\n// a given path should be ignored.\n// Ignoring a path ignores its children if the pattern ends in /**\n// Ignores are always parsed in dot:true mode\n\nimport { Minimatch } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\nexport interface IgnoreLike {\n  ignored?: (p: Path) => boolean\n  childrenIgnored?: (p: Path) => boolean\n}\n\nconst defaultPlatform: NodeJS.Platform =\n  typeof process === 'object' &&\n  process &&\n  typeof process.platform === 'string'\n    ? process.platform\n    : 'linux'\n\n/**\n * Class used to process ignored patterns\n */\nexport class Ignore implements IgnoreLike {\n  relative: Minimatch[]\n  relativeChildren: Minimatch[]\n  absolute: Minimatch[]\n  absoluteChildren: Minimatch[]\n\n  constructor(\n    ignored: string[],\n    {\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      platform = defaultPlatform,\n    }: GlobWalkerOpts\n  ) {\n    this.relative = []\n    this.absolute = []\n    this.relativeChildren = []\n    this.absoluteChildren = []\n    const mmopts = {\n      dot: true,\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      optimizationLevel: 2,\n      platform,\n      nocomment: true,\n      nonegate: true,\n    }\n\n    // this is a little weird, but it gives us a clean set of optimized\n    // minimatch matchers, without getting tripped up if one of them\n    // ends in /** inside a brace section, and it's only inefficient at\n    // the start of the walk, not along it.\n    // It'd be nice if the Pattern class just had a .test() method, but\n    // handling globstars is a bit of a pita, and that code already lives\n    // in minimatch anyway.\n    // Another way would be if maybe Minimatch could take its set/globParts\n    // as an option, and then we could at least just use Pattern to test\n    // for absolute-ness.\n    // Yet another way, Minimatch could take an array of glob strings, and\n    // a cwd option, and do the right thing.\n    for (const ign of ignored) {\n      const mm = new Minimatch(ign, mmopts)\n      for (let i = 0; i < mm.set.length; i++) {\n        const parsed = mm.set[i]\n        const globParts = mm.globParts[i]\n        /* c8 ignore start */\n        if (!parsed || !globParts) {\n          throw new Error('invalid pattern object')\n        }\n        /* c8 ignore stop */\n        const p = new Pattern(parsed, globParts, 0, platform)\n        const m = new Minimatch(p.globString(), mmopts)\n        const children = globParts[globParts.length - 1] === '**'\n        const absolute = p.isAbsolute()\n        if (absolute) this.absolute.push(m)\n        else this.relative.push(m)\n        if (children) {\n          if (absolute) this.absoluteChildren.push(m)\n          else this.relativeChildren.push(m)\n        }\n      }\n    }\n  }\n\n  ignored(p: Path): boolean {\n    const fullpath = p.fullpath()\n    const fullpaths = `${fullpath}/`\n    const relative = p.relative() || '.'\n    const relatives = `${relative}/`\n    for (const m of this.relative) {\n      if (m.match(relative) || m.match(relatives)) return true\n    }\n    for (const m of this.absolute) {\n      if (m.match(fullpath) || m.match(fullpaths)) return true\n    }\n    return false\n  }\n\n  childrenIgnored(p: Path): boolean {\n    const fullpath = p.fullpath() + '/'\n    const relative = (p.relative() || '.') + '/'\n    for (const m of this.relativeChildren) {\n      if (m.match(relative)) return true\n    }\n    for (const m of this.absoluteChildren) {\n      if (m.match(fullpath)) return true\n    }\n    return false\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/index.d.ts b/deps/npm/node_modules/glob/dist/commonjs/index.d.ts
similarity index 97%
rename from deps/npm/node_modules/glob/dist/mjs/index.d.ts
rename to deps/npm/node_modules/glob/dist/commonjs/index.d.ts
index 669bf12e6d5916..048e584715b772 100644
--- a/deps/npm/node_modules/glob/dist/mjs/index.d.ts
+++ b/deps/npm/node_modules/glob/dist/commonjs/index.d.ts
@@ -68,6 +68,7 @@ export type { GlobOptions, GlobOptionsWithFileTypesFalse, GlobOptionsWithFileTyp
 export { hasMagic } from './has-magic.js';
 export type { IgnoreLike } from './ignore.js';
 export type { MatchStream } from './walker.js';
+export type { Path, WalkOptionsWithFileTypesTrue, WalkOptionsWithFileTypesUnset, WalkOptions, FSOption, } from 'path-scurry';
 export declare const glob: typeof glob_ & {
     glob: typeof glob_;
     globSync: typeof globSync;
diff --git a/deps/npm/node_modules/glob/dist/mjs/index.d.ts.map b/deps/npm/node_modules/glob/dist/commonjs/index.d.ts.map
similarity index 96%
rename from deps/npm/node_modules/glob/dist/mjs/index.d.ts.map
rename to deps/npm/node_modules/glob/dist/commonjs/index.d.ts.map
index c60290eb118a91..3e263fb5e2dbed 100644
--- a/deps/npm/node_modules/glob/dist/mjs/index.d.ts.map
+++ b/deps/npm/node_modules/glob/dist/commonjs/index.d.ts.map
@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,KAAK,EACV,WAAW,EACX,6BAA6B,EAC7B,4BAA4B,EAC5B,6BAA6B,EAC9B,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAGhC;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACvB,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAQlD;;;GAGG;AACH,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACvB,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAQlD;;GAEG;AACH,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,MAAM,EAAE,CAAA;AACX,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,IAAI,EAAE,CAAA;AACT,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,MAAM,EAAE,CAAA;AACX,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,IAAI,EAAE,GAAG,MAAM,EAAE,CAAA;AAQpB;;;;;GAKG;AACH,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACpB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAA;AAClB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACpB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,OAAO,CAAC,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC,CAAA;AAQ7B;;GAEG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAChC,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAC9B,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAChC,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAQ9D;;GAEG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACrC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACnC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACrC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AASxE,eAAO,MAAM,UAAU,uBAAiB,CAAA;AACxC,eAAO,MAAM,MAAM;;CAAsD,CAAA;AACzE,eAAO,MAAM,WAAW,wBAAkB,CAAA;AAC1C,eAAO,MAAM,OAAO;;CAElB,CAAA;AACF,eAAO,MAAM,IAAI;;;CAGf,CAAA;AAGF,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,YAAY,EACV,WAAW,EACX,6BAA6B,EAC7B,4BAA4B,EAC5B,6BAA6B,GAC9B,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,YAAY,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAG9C,eAAO,MAAM,IAAI;;;;;;;;;;;;;;;;;;;;;;;CAgBf,CAAA"}
\ No newline at end of file
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,KAAK,EACV,WAAW,EACX,6BAA6B,EAC7B,4BAA4B,EAC5B,6BAA6B,EAC9B,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAGhC;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACvB,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAQlD;;;GAGG;AACH,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACvB,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAQlD;;GAEG;AACH,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,MAAM,EAAE,CAAA;AACX,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,IAAI,EAAE,CAAA;AACT,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,MAAM,EAAE,CAAA;AACX,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,IAAI,EAAE,GAAG,MAAM,EAAE,CAAA;AAQpB;;;;;GAKG;AACH,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACpB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAA;AAClB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACpB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,OAAO,CAAC,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC,CAAA;AAQ7B;;GAEG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAChC,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAC9B,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAChC,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAQ9D;;GAEG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACrC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACnC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACrC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AASxE,eAAO,MAAM,UAAU,uBAAiB,CAAA;AACxC,eAAO,MAAM,MAAM;;CAAsD,CAAA;AACzE,eAAO,MAAM,WAAW,wBAAkB,CAAA;AAC1C,eAAO,MAAM,OAAO;;CAElB,CAAA;AACF,eAAO,MAAM,IAAI;;;CAGf,CAAA;AAGF,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,YAAY,EACV,WAAW,EACX,6BAA6B,EAC7B,4BAA4B,EAC5B,6BAA6B,GAC9B,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,YAAY,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAC9C,YAAY,EACV,IAAI,EACJ,4BAA4B,EAC5B,6BAA6B,EAC7B,WAAW,EACX,QAAQ,GACT,MAAM,aAAa,CAAA;AAIpB,eAAO,MAAM,IAAI;;;;;;;;;;;;;;;;;;;;;;;CAgBf,CAAA"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/index.js b/deps/npm/node_modules/glob/dist/commonjs/index.js
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/index.js
rename to deps/npm/node_modules/glob/dist/commonjs/index.js
diff --git a/deps/npm/node_modules/glob/dist/commonjs/index.js.map b/deps/npm/node_modules/glob/dist/commonjs/index.js.map
new file mode 100644
index 00000000000000..e8c568acf837a5
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/commonjs/index.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;AAAA,yCAA4C;AAS5C,uCAAgC;AAChC,iDAAyC;AAuBzC,SAAgB,cAAc,CAC5B,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,UAAU,EAAE,CAAA;AAChD,CAAC;AALD,wCAKC;AAsBD,SAAgB,UAAU,CACxB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,MAAM,EAAE,CAAA;AAC5C,CAAC;AALD,gCAKC;AAqBD,SAAgB,QAAQ,CACtB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAA;AAC9C,CAAC;AALD,4BAKC;AAwBD,KAAK,UAAU,KAAK,CAClB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAA;AAC1C,CAAC;AAqBD,SAAgB,eAAe,CAC7B,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;AACjD,CAAC;AALD,0CAKC;AAqBD,SAAgB,WAAW,CACzB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,cAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAA;AAC7C,CAAC;AALD,kCAKC;AAED,iEAAiE;AACpD,QAAA,UAAU,GAAG,cAAc,CAAA;AAC3B,QAAA,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAA;AAC5D,QAAA,WAAW,GAAG,eAAe,CAAA;AAC7B,QAAA,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE;IAChD,IAAI,EAAE,eAAe;CACtB,CAAC,CAAA;AACW,QAAA,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE;IAC1C,MAAM,EAAE,cAAc;IACtB,OAAO,EAAE,eAAe;CACzB,CAAC,CAAA;AAEF,qBAAqB;AACrB,uCAA4C;AAAnC,mGAAA,MAAM,OAAA;AAAE,qGAAA,QAAQ,OAAA;AACzB,qCAAgC;AAAvB,+FAAA,IAAI,OAAA;AAOb,+CAAyC;AAAhC,wGAAA,QAAQ,OAAA;AAWjB,oBAAoB;AAEP,QAAA,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE;IACvC,IAAI,EAAE,KAAK;IACX,QAAQ;IACR,IAAI,EAAJ,YAAI;IACJ,UAAU;IACV,MAAM,EAAN,cAAM;IACN,cAAc;IACd,UAAU,EAAV,kBAAU;IACV,WAAW;IACX,OAAO,EAAP,eAAO;IACP,eAAe;IACf,WAAW,EAAX,mBAAW;IACX,IAAI,EAAJ,cAAI;IACJ,QAAQ,EAAR,uBAAQ;IACR,MAAM,EAAN,kBAAM;IACN,QAAQ,EAAR,oBAAQ;CACT,CAAC,CAAA;AACF,YAAI,CAAC,IAAI,GAAG,YAAI,CAAA","sourcesContent":["import { escape, unescape } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nimport { Glob } from './glob.js'\nimport { hasMagic } from './has-magic.js'\n\n/**\n * Syncronous form of {@link globStream}. Will read all the matches as fast as\n * you consume them, even all in a single tick if you consume them immediately,\n * but will still respond to backpressure if they're not consumed immediately.\n */\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Minipass<Path, Path>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesUnset\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).streamSync()\n}\n\n/**\n * Return a stream that emits all the strings or `Path` objects and\n * then emits `end` when completed.\n */\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Minipass<Path, Path>\nexport function globStream(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).stream()\n}\n\n/**\n * Synchronous form of {@link glob}\n */\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Path[]\nexport function globSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Path[] | string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).walkSync()\n}\n\n/**\n * Perform an asynchronous glob search for the pattern(s) specified. Returns\n * [Path](https://isaacs.github.io/path-scurry/classes/PathBase) objects if the\n * {@link withFileTypes} option is set to `true`. See {@link GlobOptions} for\n * full option descriptions.\n */\nasync function glob_(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Promise<Path[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions\n): Promise<Path[] | string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).walk()\n}\n\n/**\n * Return a sync iterator for walking glob pattern matches.\n */\nexport function globIterateSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Generator<Path, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Generator<Path, void, void> | Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).iterateSync()\n}\n\n/**\n * Return an async iterator for walking glob pattern matches.\n */\nexport function globIterate(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): AsyncGenerator<Path, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions\n): AsyncGenerator<Path, void, void> | AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).iterate()\n}\n\n// aliases: glob.sync.stream() glob.stream.sync() glob.sync() etc\nexport const streamSync = globStreamSync\nexport const stream = Object.assign(globStream, { sync: globStreamSync })\nexport const iterateSync = globIterateSync\nexport const iterate = Object.assign(globIterate, {\n  sync: globIterateSync,\n})\nexport const sync = Object.assign(globSync, {\n  stream: globStreamSync,\n  iterate: globIterateSync,\n})\n\n/* c8 ignore start */\nexport { escape, unescape } from 'minimatch'\nexport { Glob } from './glob.js'\nexport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nexport { hasMagic } from './has-magic.js'\nexport type { IgnoreLike } from './ignore.js'\nexport type { MatchStream } from './walker.js'\nexport type {\n  Path,\n  WalkOptionsWithFileTypesTrue,\n  WalkOptionsWithFileTypesUnset,\n  WalkOptions,\n  FSOption,\n} from 'path-scurry'\n\n/* c8 ignore stop */\n\nexport const glob = Object.assign(glob_, {\n  glob: glob_,\n  globSync,\n  sync,\n  globStream,\n  stream,\n  globStreamSync,\n  streamSync,\n  globIterate,\n  iterate,\n  globIterateSync,\n  iterateSync,\n  Glob,\n  hasMagic,\n  escape,\n  unescape,\n})\nglob.glob = glob\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/commonjs/package.json b/deps/npm/node_modules/glob/dist/commonjs/package.json
new file mode 100644
index 00000000000000..0292b9956f2e40
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/commonjs/package.json
@@ -0,0 +1 @@
+{"type":"commonjs"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/pattern.d.ts b/deps/npm/node_modules/glob/dist/commonjs/pattern.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/pattern.d.ts
rename to deps/npm/node_modules/glob/dist/commonjs/pattern.d.ts
diff --git a/deps/npm/node_modules/glob/dist/mjs/pattern.d.ts.map b/deps/npm/node_modules/glob/dist/commonjs/pattern.d.ts.map
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/pattern.d.ts.map
rename to deps/npm/node_modules/glob/dist/commonjs/pattern.d.ts.map
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/pattern.js b/deps/npm/node_modules/glob/dist/commonjs/pattern.js
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/pattern.js
rename to deps/npm/node_modules/glob/dist/commonjs/pattern.js
diff --git a/deps/npm/node_modules/glob/dist/commonjs/pattern.js.map b/deps/npm/node_modules/glob/dist/commonjs/pattern.js.map
new file mode 100644
index 00000000000000..d14f76b335cbc0
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/commonjs/pattern.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"pattern.js","sourceRoot":"","sources":["../../src/pattern.ts"],"names":[],"mappings":";AAAA,yEAAyE;;;AAEzE,yCAAoC;AAgBpC,MAAM,aAAa,GAAG,CAAC,EAAe,EAAqB,EAAE,CAC3D,EAAE,CAAC,MAAM,IAAI,CAAC,CAAA;AAChB,MAAM,UAAU,GAAG,CAAC,EAAY,EAAkB,EAAE,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,CAAA;AAEnE;;;GAGG;AACH,MAAa,OAAO;IACT,YAAY,CAAa;IACzB,SAAS,CAAU;IACnB,MAAM,CAAQ;IACd,MAAM,CAAQ;IACd,SAAS,CAAiB;IACnC,KAAK,CAAiB;IACtB,WAAW,CAAS;IACpB,QAAQ,CAAU;IAClB,MAAM,CAAU;IAChB,WAAW,CAAU;IACrB,eAAe,GAAY,IAAI,CAAA;IAE/B,YACE,WAAwB,EACxB,QAAkB,EAClB,KAAa,EACb,QAAyB;QAEzB,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,EAAE;YAC/B,MAAM,IAAI,SAAS,CAAC,oBAAoB,CAAC,CAAA;SAC1C;QACD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE;YACzB,MAAM,IAAI,SAAS,CAAC,iBAAiB,CAAC,CAAA;SACvC;QACD,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,EAAE;YAC1C,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAA;SACrE;QACD,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAA;QAChC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YACrC,MAAM,IAAI,SAAS,CAAC,oBAAoB,CAAC,CAAA;SAC1C;QACD,IAAI,CAAC,YAAY,GAAG,WAAW,CAAA;QAC/B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;QACnB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QAEzB,mEAAmE;QACnE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACrB,gBAAgB;YAChB,iBAAiB;YACjB,uBAAuB;YACvB,oCAAoC;YACpC,qCAAqC;YACrC,2CAA2C;YAC3C,uBAAuB;YACvB,aAAa;YACb,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE;gBAChB,6BAA6B;gBAC7B,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAA;gBACpD,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;gBACjD,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;oBACnB,YAAY;oBACZ,KAAK,CAAC,KAAK,EAAE,CAAA;oBACb,KAAK,CAAC,KAAK,EAAE,CAAA;iBACd;gBACD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACxC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACxC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;aACvC;iBAAM,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;gBAC9C,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAA;gBACxC,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;gBACrC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;oBACnB,YAAY;oBACZ,KAAK,CAAC,KAAK,EAAE,CAAA;oBACb,KAAK,CAAC,KAAK,EAAE,CAAA;iBACd;gBACD,MAAM,CAAC,GAAI,EAAa,GAAG,GAAG,CAAA;gBAC9B,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,CAAA;gBAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;aACvC;SACF;IACH,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAc,CAAA;IACpD,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAA;IAC3D,CAAC;IACD;;OAEG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,oBAAQ,CAAA;IACpD,CAAC;IACD;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,MAAM,CAAA;IACzD,CAAC;IAED;;OAEG;IACH,UAAU;QACR,OAAO,CAAC,IAAI,CAAC,WAAW;YACtB,IAAI,CAAC,WAAW;gBAChB,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;oBAChB,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE;wBACjB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;wBACvD,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC;oBAC5B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACrD,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACtC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QAC/C,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAA;QAC/C,IAAI,CAAC,KAAK,GAAG,IAAI,OAAO,CACtB,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,MAAM,GAAG,CAAC,EACf,IAAI,CAAC,SAAS,CACf,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;QACzC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAC/B,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QACnC,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,MAAM,KAAK,SAAS;YAC9B,CAAC,CAAC,IAAI,CAAC,MAAM;YACb,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;gBACV,IAAI,CAAC,SAAS,KAAK,OAAO;oBAC1B,IAAI,CAAC,MAAM,KAAK,CAAC;oBACjB,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBACZ,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBACZ,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACP,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC;IAED,sBAAsB;IACtB,sBAAsB;IACtB,mEAAmE;IACnE,sEAAsE;IACtE,6CAA6C;IAC7C;;OAEG;IACH,OAAO;QACL,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS;YAChC,CAAC,CAAC,IAAI,CAAC,QAAQ;YACf,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ;gBACZ,IAAI,CAAC,SAAS,KAAK,OAAO;oBAC1B,IAAI,CAAC,MAAM,KAAK,CAAC;oBACjB,IAAI,CAAC,MAAM,GAAG,CAAC;oBACf,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChC,CAAC;IAED,sCAAsC;IACtC,kDAAkD;IAClD,oDAAoD;IACpD;;OAEG;IACH,UAAU;QACR,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS;YACnC,CAAC,CAAC,IAAI,CAAC,WAAW;YAClB,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW;gBACf,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;oBAC/B,IAAI,CAAC,OAAO,EAAE;oBACd,IAAI,CAAC,KAAK,EAAE,CAAC,CAAA;IACrB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC9B,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACpE,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,CAAA;IACR,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACjB,OAAO,CAAC,CACN,IAAI,CAAC,MAAM,KAAK,CAAC;YACjB,CAAC,IAAI,CAAC,UAAU,EAAE;YAClB,CAAC,IAAI,CAAC,eAAe,CACtB,CAAA;IACH,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe;YAClE,OAAO,KAAK,CAAA;QACd,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;QAC5B,OAAO,IAAI,CAAA;IACb,CAAC;CACF;AAnOD,0BAmOC","sourcesContent":["// this is just a very light wrapper around 2 arrays with an offset index\n\nimport { GLOBSTAR } from 'minimatch'\nexport type MMPattern = string | RegExp | typeof GLOBSTAR\n\n// an array of length >= 1\nexport type PatternList = [p: MMPattern, ...rest: MMPattern[]]\nexport type UNCPatternList = [\n  p0: '',\n  p1: '',\n  p2: string,\n  p3: string,\n  ...rest: MMPattern[]\n]\nexport type DrivePatternList = [p0: string, ...rest: MMPattern[]]\nexport type AbsolutePatternList = [p0: '', ...rest: MMPattern[]]\nexport type GlobList = [p: string, ...rest: string[]]\n\nconst isPatternList = (pl: MMPattern[]): pl is PatternList =>\n  pl.length >= 1\nconst isGlobList = (gl: string[]): gl is GlobList => gl.length >= 1\n\n/**\n * An immutable-ish view on an array of glob parts and their parsed\n * results\n */\nexport class Pattern {\n  readonly #patternList: PatternList\n  readonly #globList: GlobList\n  readonly #index: number\n  readonly length: number\n  readonly #platform: NodeJS.Platform\n  #rest?: Pattern | null\n  #globString?: string\n  #isDrive?: boolean\n  #isUNC?: boolean\n  #isAbsolute?: boolean\n  #followGlobstar: boolean = true\n\n  constructor(\n    patternList: MMPattern[],\n    globList: string[],\n    index: number,\n    platform: NodeJS.Platform\n  ) {\n    if (!isPatternList(patternList)) {\n      throw new TypeError('empty pattern list')\n    }\n    if (!isGlobList(globList)) {\n      throw new TypeError('empty glob list')\n    }\n    if (globList.length !== patternList.length) {\n      throw new TypeError('mismatched pattern list and glob list lengths')\n    }\n    this.length = patternList.length\n    if (index < 0 || index >= this.length) {\n      throw new TypeError('index out of range')\n    }\n    this.#patternList = patternList\n    this.#globList = globList\n    this.#index = index\n    this.#platform = platform\n\n    // normalize root entries of absolute patterns on initial creation.\n    if (this.#index === 0) {\n      // c: => ['c:/']\n      // C:/ => ['C:/']\n      // C:/x => ['C:/', 'x']\n      // //host/share => ['//host/share/']\n      // //host/share/ => ['//host/share/']\n      // //host/share/x => ['//host/share/', 'x']\n      // /etc => ['/', 'etc']\n      // / => ['/']\n      if (this.isUNC()) {\n        // '' / '' / 'host' / 'share'\n        const [p0, p1, p2, p3, ...prest] = this.#patternList\n        const [g0, g1, g2, g3, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = [p0, p1, p2, p3, ''].join('/')\n        const g = [g0, g1, g2, g3, ''].join('/')\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      } else if (this.isDrive() || this.isAbsolute()) {\n        const [p1, ...prest] = this.#patternList\n        const [g1, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = (p1 as string) + '/'\n        const g = g1 + '/'\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      }\n    }\n  }\n\n  /**\n   * The first entry in the parsed list of patterns\n   */\n  pattern(): MMPattern {\n    return this.#patternList[this.#index] as MMPattern\n  }\n\n  /**\n   * true of if pattern() returns a string\n   */\n  isString(): boolean {\n    return typeof this.#patternList[this.#index] === 'string'\n  }\n  /**\n   * true of if pattern() returns GLOBSTAR\n   */\n  isGlobstar(): boolean {\n    return this.#patternList[this.#index] === GLOBSTAR\n  }\n  /**\n   * true if pattern() returns a regexp\n   */\n  isRegExp(): boolean {\n    return this.#patternList[this.#index] instanceof RegExp\n  }\n\n  /**\n   * The /-joined set of glob parts that make up this pattern\n   */\n  globString(): string {\n    return (this.#globString =\n      this.#globString ||\n      (this.#index === 0\n        ? this.isAbsolute()\n          ? this.#globList[0] + this.#globList.slice(1).join('/')\n          : this.#globList.join('/')\n        : this.#globList.slice(this.#index).join('/')))\n  }\n\n  /**\n   * true if there are more pattern parts after this one\n   */\n  hasMore(): boolean {\n    return this.length > this.#index + 1\n  }\n\n  /**\n   * The rest of the pattern after this part, or null if this is the end\n   */\n  rest(): Pattern | null {\n    if (this.#rest !== undefined) return this.#rest\n    if (!this.hasMore()) return (this.#rest = null)\n    this.#rest = new Pattern(\n      this.#patternList,\n      this.#globList,\n      this.#index + 1,\n      this.#platform\n    )\n    this.#rest.#isAbsolute = this.#isAbsolute\n    this.#rest.#isUNC = this.#isUNC\n    this.#rest.#isDrive = this.#isDrive\n    return this.#rest\n  }\n\n  /**\n   * true if the pattern represents a //unc/path/ on windows\n   */\n  isUNC(): boolean {\n    const pl = this.#patternList\n    return this.#isUNC !== undefined\n      ? this.#isUNC\n      : (this.#isUNC =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          pl[0] === '' &&\n          pl[1] === '' &&\n          typeof pl[2] === 'string' &&\n          !!pl[2] &&\n          typeof pl[3] === 'string' &&\n          !!pl[3])\n  }\n\n  // pattern like C:/...\n  // split = ['C:', ...]\n  // XXX: would be nice to handle patterns like `c:*` to test the cwd\n  // in c: for *, but I don't know of a way to even figure out what that\n  // cwd is without actually chdir'ing into it?\n  /**\n   * True if the pattern starts with a drive letter on Windows\n   */\n  isDrive(): boolean {\n    const pl = this.#patternList\n    return this.#isDrive !== undefined\n      ? this.#isDrive\n      : (this.#isDrive =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          this.length > 1 &&\n          typeof pl[0] === 'string' &&\n          /^[a-z]:$/i.test(pl[0]))\n  }\n\n  // pattern = '/' or '/...' or '/x/...'\n  // split = ['', ''] or ['', ...] or ['', 'x', ...]\n  // Drive and UNC both considered absolute on windows\n  /**\n   * True if the pattern is rooted on an absolute path\n   */\n  isAbsolute(): boolean {\n    const pl = this.#patternList\n    return this.#isAbsolute !== undefined\n      ? this.#isAbsolute\n      : (this.#isAbsolute =\n          (pl[0] === '' && pl.length > 1) ||\n          this.isDrive() ||\n          this.isUNC())\n  }\n\n  /**\n   * consume the root of the pattern, and return it\n   */\n  root(): string {\n    const p = this.#patternList[0]\n    return typeof p === 'string' && this.isAbsolute() && this.#index === 0\n      ? p\n      : ''\n  }\n\n  /**\n   * Check to see if the current globstar pattern is allowed to follow\n   * a symbolic link.\n   */\n  checkFollowGlobstar(): boolean {\n    return !(\n      this.#index === 0 ||\n      !this.isGlobstar() ||\n      !this.#followGlobstar\n    )\n  }\n\n  /**\n   * Mark that the current globstar pattern is following a symbolic link\n   */\n  markFollowGlobstar(): boolean {\n    if (this.#index === 0 || !this.isGlobstar() || !this.#followGlobstar)\n      return false\n    this.#followGlobstar = false\n    return true\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/processor.d.ts b/deps/npm/node_modules/glob/dist/commonjs/processor.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/processor.d.ts
rename to deps/npm/node_modules/glob/dist/commonjs/processor.d.ts
diff --git a/deps/npm/node_modules/glob/dist/mjs/processor.d.ts.map b/deps/npm/node_modules/glob/dist/commonjs/processor.d.ts.map
similarity index 96%
rename from deps/npm/node_modules/glob/dist/mjs/processor.d.ts.map
rename to deps/npm/node_modules/glob/dist/commonjs/processor.d.ts.map
index 75d92efe28cb1d..33a39b2a8be3bf 100644
--- a/deps/npm/node_modules/glob/dist/mjs/processor.d.ts.map
+++ b/deps/npm/node_modules/glob/dist/commonjs/processor.d.ts.map
@@ -1 +1 @@
-{"version":3,"file":"processor.d.ts","sourceRoot":"","sources":["../../src/processor.ts"],"names":[],"mappings":"AAEA,OAAO,EAAY,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,EAAa,OAAO,EAAE,MAAM,cAAc,CAAA;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAE5C;;GAEG;AACH,qBAAa,cAAc;IACzB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;gBACnB,KAAK,GAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAGvD,IAAI;IAGJ,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;IAGxC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;CAM3C;AAED;;;;GAIG;AACH,qBAAa,WAAW;IACtB,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAY;IACpC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO;IAMnD,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE;CAOtC;AAED;;;GAGG;AACH,qBAAa,QAAQ;IACnB,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAY;IACvC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;IAWlC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,OAAO,EAAE;IAS5B,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE;IAG9B,IAAI,IAAI,IAAI,EAAE;CAGf;AAED;;;;;GAKG;AACH,qBAAa,SAAS;IACpB,cAAc,EAAE,cAAc,CAAA;IAC9B,OAAO,cAAoB;IAC3B,QAAQ,WAAiB;IACzB,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAA;IACpB,MAAM,EAAE,OAAO,CAAA;IACf,GAAG,EAAE,OAAO,CAAA;IACZ,IAAI,EAAE,cAAc,CAAA;gBAER,IAAI,EAAE,cAAc,EAAE,cAAc,CAAC,EAAE,cAAc;IASjE,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE;IAwGjD,cAAc,IAAI,IAAI,EAAE;IAIxB,KAAK;IAQL,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,SAAS;IAqBvD,YAAY,CACV,CAAC,EAAE,IAAI,EACP,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,QAAQ,EAAE,OAAO;IA8CnB,UAAU,CACR,CAAC,EAAE,IAAI,EACP,CAAC,EAAE,QAAQ,EACX,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,QAAQ,EAAE,OAAO;IAUnB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,QAAQ,EAAE,OAAO;CASvE"}
\ No newline at end of file
+{"version":3,"file":"processor.d.ts","sourceRoot":"","sources":["../../src/processor.ts"],"names":[],"mappings":"AAEA,OAAO,EAAY,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,EAAa,OAAO,EAAE,MAAM,cAAc,CAAA;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAE5C;;GAEG;AACH,qBAAa,cAAc;IACzB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;gBACnB,KAAK,GAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAGvD,IAAI;IAGJ,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;IAGxC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;CAM3C;AAED;;;;GAIG;AACH,qBAAa,WAAW;IACtB,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAY;IACpC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO;IAMnD,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE;CAOtC;AAED;;;GAGG;AACH,qBAAa,QAAQ;IACnB,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAY;IACvC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;IAWlC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,OAAO,EAAE;IAS5B,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE;IAG9B,IAAI,IAAI,IAAI,EAAE;CAGf;AAED;;;;;GAKG;AACH,qBAAa,SAAS;IACpB,cAAc,EAAE,cAAc,CAAA;IAC9B,OAAO,cAAoB;IAC3B,QAAQ,WAAiB;IACzB,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAA;IACpB,MAAM,EAAE,OAAO,CAAA;IACf,GAAG,EAAE,OAAO,CAAA;IACZ,IAAI,EAAE,cAAc,CAAA;gBAER,IAAI,EAAE,cAAc,EAAE,cAAc,CAAC,EAAE,cAAc;IASjE,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE;IAmGjD,cAAc,IAAI,IAAI,EAAE;IAIxB,KAAK;IAQL,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,SAAS;IAqBvD,YAAY,CACV,CAAC,EAAE,IAAI,EACP,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,QAAQ,EAAE,OAAO;IA8CnB,UAAU,CACR,CAAC,EAAE,IAAI,EACP,CAAC,EAAE,QAAQ,EACX,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,QAAQ,EAAE,OAAO;IAUnB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,QAAQ,EAAE,OAAO;CASvE"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/processor.js b/deps/npm/node_modules/glob/dist/commonjs/processor.js
similarity index 95%
rename from deps/npm/node_modules/glob/dist/cjs/src/processor.js
rename to deps/npm/node_modules/glob/dist/commonjs/processor.js
index bd067e9b9033dc..7d30a3b6650005 100644
--- a/deps/npm/node_modules/glob/dist/cjs/src/processor.js
+++ b/deps/npm/node_modules/glob/dist/commonjs/processor.js
@@ -138,9 +138,6 @@ class Processor {
             while (typeof (p = pattern.pattern()) === 'string' &&
                 (rest = pattern.rest())) {
                 const c = t.resolve(p);
-                // we can be reasonably sure that .. is a readable dir
-                if (c.isUnknown() && p !== '..')
-                    break;
                 t = c;
                 pattern = rest;
                 changed = true;
@@ -156,14 +153,10 @@ class Processor {
             // more strings for an unknown entry,
             // or a pattern starting with magic, mounted on t.
             if (typeof p === 'string') {
-                // must be final entry
-                if (!rest) {
-                    const ifDir = p === '..' || p === '' || p === '.';
-                    this.matches.add(t.resolve(p), absolute, ifDir);
-                }
-                else {
-                    this.subwalks.add(t, pattern);
-                }
+                // must not be final entry, otherwise we would have
+                // concatenated it earlier.
+                const ifDir = p === '..' || p === '' || p === '.';
+                this.matches.add(t.resolve(p), absolute, ifDir);
                 continue;
             }
             else if (p === minimatch_1.GLOBSTAR) {
diff --git a/deps/npm/node_modules/glob/dist/commonjs/processor.js.map b/deps/npm/node_modules/glob/dist/commonjs/processor.js.map
new file mode 100644
index 00000000000000..51b21438a9b746
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/commonjs/processor.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"processor.js","sourceRoot":"","sources":["../../src/processor.ts"],"names":[],"mappings":";AAAA,qEAAqE;;;AAErE,yCAA8C;AAK9C;;GAEG;AACH,MAAa,cAAc;IACzB,KAAK,CAA0B;IAC/B,YAAY,QAAkC,IAAI,GAAG,EAAE;QACrD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,CAAC;IACD,IAAI;QACF,OAAO,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IAChD,CAAC;IACD,SAAS,CAAC,MAAY,EAAE,OAAgB;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;IACrE,CAAC;IACD,WAAW,CAAC,MAAY,EAAE,OAAgB;QACxC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACvC,IAAI,MAAM;YAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;;YACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAA;IAChE,CAAC;CACF;AAjBD,wCAiBC;AAED;;;;GAIG;AACH,MAAa,WAAW;IACtB,KAAK,GAAsB,IAAI,GAAG,EAAE,CAAA;IACpC,GAAG,CAAC,MAAY,EAAE,QAAiB,EAAE,KAAc;QACjD,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAA;IACjE,CAAC;IACD,yBAAyB;IACzB,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI;YACJ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACV,CAAC,CAAA;IACJ,CAAC;CACF;AAfD,kCAeC;AAED;;;GAGG;AACH,MAAa,QAAQ;IACnB,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAA;IACvC,GAAG,CAAC,MAAY,EAAE,OAAgB;QAChC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE;YACxB,OAAM;SACP;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE;gBAC5D,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;aACnB;SACF;;YAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC,CAAA;IAC1C,CAAC;IACD,GAAG,CAAC,MAAY;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,qBAAqB;QACrB,IAAI,CAAC,IAAI,EAAE;YACT,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAA;SACnD;QACD,oBAAoB;QACpB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAc,CAAC,CAAC,CAAA;IAClE,CAAC;IACD,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAA;IAC3D,CAAC;CACF;AA5BD,4BA4BC;AAED;;;;;GAKG;AACH,MAAa,SAAS;IACpB,cAAc,CAAgB;IAC9B,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;IAC3B,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAA;IACzB,QAAQ,CAAY;IACpB,MAAM,CAAS;IACf,GAAG,CAAS;IACZ,IAAI,CAAgB;IAEpB,YAAY,IAAoB,EAAE,cAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;QACrB,IAAI,CAAC,cAAc,GAAG,cAAc;YAClC,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE;YACvB,CAAC,CAAC,IAAI,cAAc,EAAE,CAAA;IAC1B,CAAC;IAED,eAAe,CAAC,MAAY,EAAE,QAAmB;QAC/C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,MAAM,aAAa,GAAsB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAA;QAEvE,gEAAgE;QAChE,uCAAuC;QAEvC,KAAK,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE;YACtC,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAE3C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;YAC3B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAA;YAErE,kCAAkC;YAClC,IAAI,IAAI,EAAE;gBACR,CAAC,GAAG,CAAC,CAAC,OAAO,CACX,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS;oBAC1C,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;oBAChB,CAAC,CAAC,IAAI,CACT,CAAA;gBACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;gBAC3B,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;oBAChC,SAAQ;iBACT;qBAAM;oBACL,OAAO,GAAG,IAAI,CAAA;iBACf;aACF;YAED,IAAI,CAAC,CAAC,QAAQ,EAAE;gBAAE,SAAQ;YAE1B,IAAI,CAAY,CAAA;YAChB,IAAI,IAAoB,CAAA;YACxB,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,OACE,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,KAAK,QAAQ;gBAC3C,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EACvB;gBACA,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;gBACtB,CAAC,GAAG,CAAC,CAAA;gBACL,OAAO,GAAG,IAAI,CAAA;gBACd,OAAO,GAAG,IAAI,CAAA;aACf;YACD,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;YACrB,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;YACrB,IAAI,OAAO,EAAE;gBACX,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC;oBAAE,SAAQ;gBACvD,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;aAC5C;YAED,uDAAuD;YACvD,qCAAqC;YACrC,kDAAkD;YAClD,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;gBACzB,mDAAmD;gBACnD,2BAA2B;gBAC3B,MAAM,KAAK,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAA;gBACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;gBAC/C,SAAQ;aACT;iBAAM,IAAI,CAAC,KAAK,oBAAQ,EAAE;gBACzB,wCAAwC;gBACxC,4CAA4C;gBAC5C,wDAAwD;gBACxD,4DAA4D;gBAC5D,gEAAgE;gBAChE,IACE,CAAC,CAAC,CAAC,cAAc,EAAE;oBACnB,IAAI,CAAC,MAAM;oBACX,OAAO,CAAC,mBAAmB,EAAE,EAC7B;oBACA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;gBACD,MAAM,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,CAAA;gBAC1B,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,EAAE,CAAA;gBAC1B,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;oBAClD,iDAAiD;oBACjD,6CAA6C;oBAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAA;iBACvD;qBAAM;oBACL,IAAI,EAAE,KAAK,IAAI,EAAE;wBACf,wDAAwD;wBACxD,wDAAwD;wBACxD,qBAAqB;wBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;wBACxB,oBAAoB;wBACpB,IAAI,CAAC,KAAK;4BAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;6BAC3C,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE;4BAClD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;yBAC7B;qBACF;iBACF;aACF;iBAAM,IAAI,CAAC,YAAY,MAAM,EAAE;gBAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;aAC9B;SACF;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;IAC7B,CAAC;IAED,KAAK;QACH,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAA;IACtD,CAAC;IAED,0DAA0D;IAC1D,yCAAyC;IACzC,6CAA6C;IAC7C,2BAA2B;IAC3B,aAAa,CAAC,MAAY,EAAE,OAAe;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC1C,yDAAyD;QACzD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAA;QAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;YACvB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;gBAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAA;gBACrC,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;gBAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;gBAC3B,IAAI,CAAC,KAAK,oBAAQ,EAAE;oBAClB,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACjD;qBAAM,IAAI,CAAC,YAAY,MAAM,EAAE;oBAC9B,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACzC;qBAAM;oBACL,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACzC;aACF;SACF;QACD,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,YAAY,CACV,CAAO,EACP,OAAgB,EAChB,IAAoB,EACpB,QAAiB;QAEjB,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;YACvC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;gBACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;aACrC;YACD,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,2DAA2D;gBAC3D,gEAAgE;gBAChE,+DAA+D;gBAC/D,iEAAiE;gBACjE,uDAAuD;gBACvD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,cAAc,EAAE,EAAE;oBACtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;qBAAM,IAAI,CAAC,CAAC,cAAc,EAAE,EAAE;oBAC7B,IAAI,IAAI,IAAI,OAAO,CAAC,mBAAmB,EAAE,EAAE;wBACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;qBAC3B;yBAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,EAAE;wBACvC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;qBAC9B;iBACF;aACF;SACF;QACD,sDAAsD;QACtD,YAAY;QACZ,IAAI,IAAI,EAAE;YACR,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;YACzB,IACE,OAAO,EAAE,KAAK,QAAQ;gBACtB,sCAAsC;gBACtC,EAAE,KAAK,IAAI;gBACX,EAAE,KAAK,EAAE;gBACT,EAAE,KAAK,GAAG,EACV;gBACA,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAA;aAC9C;iBAAM,IAAI,EAAE,KAAK,IAAI,EAAE;gBACtB,qBAAqB;gBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;gBACxB,oBAAoB;gBACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;aAC5B;iBAAM,IAAI,EAAE,YAAY,MAAM,EAAE;gBAC/B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAA;aAC9C;SACF;IACH,CAAC;IAED,UAAU,CACR,CAAO,EACP,CAAW,EACX,IAAoB,EACpB,QAAiB;QAEjB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAM;QAC3B,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACrC;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;IAED,UAAU,CAAC,CAAO,EAAE,CAAS,EAAE,IAAoB,EAAE,QAAiB;QACpE,uBAAuB;QACvB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAM;QACzB,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACrC;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;CACF;AA/ND,8BA+NC","sourcesContent":["// synchronous utility for filtering entries and calculating subwalks\n\nimport { GLOBSTAR, MMRegExp } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { MMPattern, Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\n/**\n * A cache of which patterns have been processed for a given Path\n */\nexport class HasWalkedCache {\n  store: Map<string, Set<string>>\n  constructor(store: Map<string, Set<string>> = new Map()) {\n    this.store = store\n  }\n  copy() {\n    return new HasWalkedCache(new Map(this.store))\n  }\n  hasWalked(target: Path, pattern: Pattern) {\n    return this.store.get(target.fullpath())?.has(pattern.globString())\n  }\n  storeWalked(target: Path, pattern: Pattern) {\n    const fullpath = target.fullpath()\n    const cached = this.store.get(fullpath)\n    if (cached) cached.add(pattern.globString())\n    else this.store.set(fullpath, new Set([pattern.globString()]))\n  }\n}\n\n/**\n * A record of which paths have been matched in a given walk step,\n * and whether they only are considered a match if they are a directory,\n * and whether their absolute or relative path should be returned.\n */\nexport class MatchRecord {\n  store: Map<Path, number> = new Map()\n  add(target: Path, absolute: boolean, ifDir: boolean) {\n    const n = (absolute ? 2 : 0) | (ifDir ? 1 : 0)\n    const current = this.store.get(target)\n    this.store.set(target, current === undefined ? n : n & current)\n  }\n  // match, absolute, ifdir\n  entries(): [Path, boolean, boolean][] {\n    return [...this.store.entries()].map(([path, n]) => [\n      path,\n      !!(n & 2),\n      !!(n & 1),\n    ])\n  }\n}\n\n/**\n * A collection of patterns that must be processed in a subsequent step\n * for a given path.\n */\nexport class SubWalks {\n  store: Map<Path, Pattern[]> = new Map()\n  add(target: Path, pattern: Pattern) {\n    if (!target.canReaddir()) {\n      return\n    }\n    const subs = this.store.get(target)\n    if (subs) {\n      if (!subs.find(p => p.globString() === pattern.globString())) {\n        subs.push(pattern)\n      }\n    } else this.store.set(target, [pattern])\n  }\n  get(target: Path): Pattern[] {\n    const subs = this.store.get(target)\n    /* c8 ignore start */\n    if (!subs) {\n      throw new Error('attempting to walk unknown path')\n    }\n    /* c8 ignore stop */\n    return subs\n  }\n  entries(): [Path, Pattern[]][] {\n    return this.keys().map(k => [k, this.store.get(k) as Pattern[]])\n  }\n  keys(): Path[] {\n    return [...this.store.keys()].filter(t => t.canReaddir())\n  }\n}\n\n/**\n * The class that processes patterns for a given path.\n *\n * Handles child entry filtering, and determining whether a path's\n * directory contents must be read.\n */\nexport class Processor {\n  hasWalkedCache: HasWalkedCache\n  matches = new MatchRecord()\n  subwalks = new SubWalks()\n  patterns?: Pattern[]\n  follow: boolean\n  dot: boolean\n  opts: GlobWalkerOpts\n\n  constructor(opts: GlobWalkerOpts, hasWalkedCache?: HasWalkedCache) {\n    this.opts = opts\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.hasWalkedCache = hasWalkedCache\n      ? hasWalkedCache.copy()\n      : new HasWalkedCache()\n  }\n\n  processPatterns(target: Path, patterns: Pattern[]) {\n    this.patterns = patterns\n    const processingSet: [Path, Pattern][] = patterns.map(p => [target, p])\n\n    // map of paths to the magic-starting subwalks they need to walk\n    // first item in patterns is the filter\n\n    for (let [t, pattern] of processingSet) {\n      this.hasWalkedCache.storeWalked(t, pattern)\n\n      const root = pattern.root()\n      const absolute = pattern.isAbsolute() && this.opts.absolute !== false\n\n      // start absolute patterns at root\n      if (root) {\n        t = t.resolve(\n          root === '/' && this.opts.root !== undefined\n            ? this.opts.root\n            : root\n        )\n        const rest = pattern.rest()\n        if (!rest) {\n          this.matches.add(t, true, false)\n          continue\n        } else {\n          pattern = rest\n        }\n      }\n\n      if (t.isENOENT()) continue\n\n      let p: MMPattern\n      let rest: Pattern | null\n      let changed = false\n      while (\n        typeof (p = pattern.pattern()) === 'string' &&\n        (rest = pattern.rest())\n      ) {\n        const c = t.resolve(p)\n        t = c\n        pattern = rest\n        changed = true\n      }\n      p = pattern.pattern()\n      rest = pattern.rest()\n      if (changed) {\n        if (this.hasWalkedCache.hasWalked(t, pattern)) continue\n        this.hasWalkedCache.storeWalked(t, pattern)\n      }\n\n      // now we have either a final string for a known entry,\n      // more strings for an unknown entry,\n      // or a pattern starting with magic, mounted on t.\n      if (typeof p === 'string') {\n        // must not be final entry, otherwise we would have\n        // concatenated it earlier.\n        const ifDir = p === '..' || p === '' || p === '.'\n        this.matches.add(t.resolve(p), absolute, ifDir)\n        continue\n      } else if (p === GLOBSTAR) {\n        // if no rest, match and subwalk pattern\n        // if rest, process rest and subwalk pattern\n        // if it's a symlink, but we didn't get here by way of a\n        // globstar match (meaning it's the first time THIS globstar\n        // has traversed a symlink), then we follow it. Otherwise, stop.\n        if (\n          !t.isSymbolicLink() ||\n          this.follow ||\n          pattern.checkFollowGlobstar()\n        ) {\n          this.subwalks.add(t, pattern)\n        }\n        const rp = rest?.pattern()\n        const rrest = rest?.rest()\n        if (!rest || ((rp === '' || rp === '.') && !rrest)) {\n          // only HAS to be a dir if it ends in **/ or **/.\n          // but ending in ** will match files as well.\n          this.matches.add(t, absolute, rp === '' || rp === '.')\n        } else {\n          if (rp === '..') {\n            // this would mean you're matching **/.. at the fs root,\n            // and no thanks, I'm not gonna test that specific case.\n            /* c8 ignore start */\n            const tp = t.parent || t\n            /* c8 ignore stop */\n            if (!rrest) this.matches.add(tp, absolute, true)\n            else if (!this.hasWalkedCache.hasWalked(tp, rrest)) {\n              this.subwalks.add(tp, rrest)\n            }\n          }\n        }\n      } else if (p instanceof RegExp) {\n        this.subwalks.add(t, pattern)\n      }\n    }\n\n    return this\n  }\n\n  subwalkTargets(): Path[] {\n    return this.subwalks.keys()\n  }\n\n  child() {\n    return new Processor(this.opts, this.hasWalkedCache)\n  }\n\n  // return a new Processor containing the subwalks for each\n  // child entry, and a set of matches, and\n  // a hasWalkedCache that's a copy of this one\n  // then we're going to call\n  filterEntries(parent: Path, entries: Path[]): Processor {\n    const patterns = this.subwalks.get(parent)\n    // put matches and entry walks into the results processor\n    const results = this.child()\n    for (const e of entries) {\n      for (const pattern of patterns) {\n        const absolute = pattern.isAbsolute()\n        const p = pattern.pattern()\n        const rest = pattern.rest()\n        if (p === GLOBSTAR) {\n          results.testGlobstar(e, pattern, rest, absolute)\n        } else if (p instanceof RegExp) {\n          results.testRegExp(e, p, rest, absolute)\n        } else {\n          results.testString(e, p, rest, absolute)\n        }\n      }\n    }\n    return results\n  }\n\n  testGlobstar(\n    e: Path,\n    pattern: Pattern,\n    rest: Pattern | null,\n    absolute: boolean\n  ) {\n    if (this.dot || !e.name.startsWith('.')) {\n      if (!pattern.hasMore()) {\n        this.matches.add(e, absolute, false)\n      }\n      if (e.canReaddir()) {\n        // if we're in follow mode or it's not a symlink, just keep\n        // testing the same pattern. If there's more after the globstar,\n        // then this symlink consumes the globstar. If not, then we can\n        // follow at most ONE symlink along the way, so we mark it, which\n        // also checks to ensure that it wasn't already marked.\n        if (this.follow || !e.isSymbolicLink()) {\n          this.subwalks.add(e, pattern)\n        } else if (e.isSymbolicLink()) {\n          if (rest && pattern.checkFollowGlobstar()) {\n            this.subwalks.add(e, rest)\n          } else if (pattern.markFollowGlobstar()) {\n            this.subwalks.add(e, pattern)\n          }\n        }\n      }\n    }\n    // if the NEXT thing matches this entry, then also add\n    // the rest.\n    if (rest) {\n      const rp = rest.pattern()\n      if (\n        typeof rp === 'string' &&\n        // dots and empty were handled already\n        rp !== '..' &&\n        rp !== '' &&\n        rp !== '.'\n      ) {\n        this.testString(e, rp, rest.rest(), absolute)\n      } else if (rp === '..') {\n        /* c8 ignore start */\n        const ep = e.parent || e\n        /* c8 ignore stop */\n        this.subwalks.add(ep, rest)\n      } else if (rp instanceof RegExp) {\n        this.testRegExp(e, rp, rest.rest(), absolute)\n      }\n    }\n  }\n\n  testRegExp(\n    e: Path,\n    p: MMRegExp,\n    rest: Pattern | null,\n    absolute: boolean\n  ) {\n    if (!p.test(e.name)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n\n  testString(e: Path, p: string, rest: Pattern | null, absolute: boolean) {\n    // should never happen?\n    if (!e.isNamed(p)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/walker.d.ts b/deps/npm/node_modules/glob/dist/commonjs/walker.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/walker.d.ts
rename to deps/npm/node_modules/glob/dist/commonjs/walker.d.ts
diff --git a/deps/npm/node_modules/glob/dist/mjs/walker.d.ts.map b/deps/npm/node_modules/glob/dist/commonjs/walker.d.ts.map
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/walker.d.ts.map
rename to deps/npm/node_modules/glob/dist/commonjs/walker.d.ts.map
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/walker.js b/deps/npm/node_modules/glob/dist/commonjs/walker.js
similarity index 100%
rename from deps/npm/node_modules/glob/dist/cjs/src/walker.js
rename to deps/npm/node_modules/glob/dist/commonjs/walker.js
diff --git a/deps/npm/node_modules/glob/dist/commonjs/walker.js.map b/deps/npm/node_modules/glob/dist/commonjs/walker.js.map
new file mode 100644
index 00000000000000..ad1cd5f8379893
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/commonjs/walker.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"walker.js","sourceRoot":"","sources":["../../src/walker.ts"],"names":[],"mappings":";;;AAAA;;;;;GAKG;AACH,uCAAmC;AAEnC,2CAAgD;AAQhD,iDAA0C;AAiE1C,MAAM,UAAU,GAAG,CACjB,MAAsC,EACtC,IAAoB,EACR,EAAE,CACd,OAAO,MAAM,KAAK,QAAQ;IACxB,CAAC,CAAC,IAAI,kBAAM,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;IAC5B,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QACvB,CAAC,CAAC,IAAI,kBAAM,CAAC,MAAM,EAAE,IAAI,CAAC;QAC1B,CAAC,CAAC,MAAM,CAAA;AAEZ;;GAEG;AACH,MAAsB,QAAQ;IAC5B,IAAI,CAAM;IACV,QAAQ,CAAW;IACnB,IAAI,CAAG;IACP,IAAI,GAAc,IAAI,GAAG,EAAQ,CAAA;IACjC,MAAM,GAAY,KAAK,CAAA;IACvB,OAAO,GAAY,KAAK,CAAA;IACxB,SAAS,GAAkB,EAAE,CAAA;IAC7B,OAAO,CAAa;IACpB,IAAI,CAAY;IAChB,MAAM,CAAc;IACpB,QAAQ,CAAQ;IAGhB,YAAY,QAAmB,EAAE,IAAU,EAAE,IAAO;QAClD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAA;QACjE,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;SAC7C;QACD,6DAA6D;QAC7D,mBAAmB;QACnB,qBAAqB;QACrB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAA;QACzC,oBAAoB;QACpB,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YACzB,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,OAAO,EAAE,GAAG,EAAE;gBACzC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAA;YAC3B,CAAC,CAAC,CAAA;SACH;IACH,CAAC;IAED,QAAQ,CAAC,IAAU;QACjB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,IAAI,CAAC,CAAA;IAC/D,CAAC;IACD,gBAAgB,CAAC,IAAU;QACzB,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,eAAe,EAAE,CAAC,IAAI,CAAC,CAAA;IAChD,CAAC;IAED,yBAAyB;IACzB,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAA;IACpB,CAAC;IACD,MAAM;QACJ,qBAAqB;QACrB,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,OAAM;QAChC,oBAAoB;QACpB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;QACnB,IAAI,EAAE,GAA4B,SAAS,CAAA;QAC3C,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE;YACpD,EAAE,EAAE,CAAA;SACL;IACH,CAAC;IACD,QAAQ,CAAC,EAAa;QACpB,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,OAAM;QAChC,qBAAqB;QACrB,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YAChB,EAAE,EAAE,CAAA;SACL;aAAM;YACL,oBAAoB;YACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;SACxB;IACH,CAAC;IAED,+DAA+D;IAC/D,wCAAwC;IACxC,KAAK,CAAC,UAAU,CAAC,CAAO,EAAE,KAAc;QACtC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAA;QAC9C,IAAI,GAAqB,CAAA;QACzB,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YACtB,GAAG,GAAG,CAAC,CAAC,cAAc,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAA;YAChD,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAA;YAC1B,CAAC,GAAG,GAAG,CAAA;SACR;QACD,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;QAChD,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACnE,CAAC;IAED,cAAc,CAAC,CAAmB,EAAE,KAAc;QAChD,OAAO,CAAC;YACN,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC;YAC1D,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;YAC1B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;YACtC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YACjB,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,SAAS,CAAA;IACf,CAAC;IAED,cAAc,CAAC,CAAO,EAAE,KAAc;QACpC,IAAI,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK;YAAE,OAAO,SAAS,CAAA;QAC9C,IAAI,GAAqB,CAAA;QACzB,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YACtB,GAAG,GAAG,CAAC,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC,YAAY,EAAE,CAAA;YAC5C,IAAI,CAAC,GAAG;gBAAE,OAAO,SAAS,CAAA;YAC1B,CAAC,GAAG,GAAG,CAAA;SACR;QACD,MAAM,QAAQ,GAAG,CAAC,CAAC,SAAS,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;QAChD,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IACjE,CAAC;IAKD,WAAW,CAAC,CAAO,EAAE,QAAiB;QACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAM;QAC5B,MAAM,GAAG,GACP,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAA;QAClE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;QAC/D,4BAA4B;QAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE;YAC3B,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;SAClB;aAAM,IAAI,GAAG,EAAE;YACd,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;YAC9D,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,IAAI,CAAC,CAAA;SAC3B;aAAM;YACL,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAA;YAC9D,MAAM,GAAG,GACP,IAAI,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACxD,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI;gBACjB,CAAC,CAAC,EAAE,CAAA;YACR,IAAI,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,CAAA;SACrD;IACH,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,CAAO,EAAE,QAAiB,EAAE,KAAc;QACpD,MAAM,CAAC,GAAG,MAAM,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QACzC,IAAI,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IACtC,CAAC;IAED,SAAS,CAAC,CAAO,EAAE,QAAiB,EAAE,KAAc;QAClD,MAAM,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QACvC,IAAI,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;IACtC,CAAC;IAED,MAAM,CAAC,MAAY,EAAE,QAAmB,EAAE,EAAa;QACrD,qBAAqB;QACrB,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,EAAE,EAAE,CAAA;QAC9B,oBAAoB;QACpB,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,wBAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;IAC9D,CAAC;IAED,OAAO,CACL,MAAY,EACZ,QAAmB,EACnB,SAAoB,EACpB,EAAa;QAEb,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,EAAE,CAAA;QAC9C,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,EAAE,EAAE,CAAA;QAC9B,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,CAAA;YAClE,OAAM;SACP;QACD,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QAE3C,qEAAqE;QACrE,4DAA4D;QAC5D,yDAAyD;QACzD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,IAAI,EAAE,KAAK,KAAK,CAAC;gBAAE,EAAE,EAAE,CAAA;QACzB,CAAC,CAAA;QAED,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC9B,KAAK,EAAE,CAAA;YACP,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;SAClD;QAED,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,cAAc,EAAE,EAAE;YAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC5D,SAAQ;aACT;YACD,KAAK,EAAE,CAAA;YACP,MAAM,cAAc,GAAG,CAAC,CAAC,aAAa,EAAE,CAAA;YACxC,IAAI,CAAC,CAAC,aAAa,EAAE;gBACnB,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,cAAc,EAAE,SAAS,EAAE,IAAI,CAAC,CAAA;iBAC7C;gBACH,CAAC,CAAC,SAAS,CACT,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,EACzD,IAAI,CACL,CAAA;aACF;SACF;QAED,IAAI,EAAE,CAAA;IACR,CAAC;IAED,OAAO,CACL,MAAY,EACZ,OAAe,EACf,SAAoB,EACpB,EAAa;QAEb,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAEpD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,IAAI,EAAE,KAAK,KAAK,CAAC;gBAAE,EAAE,EAAE,CAAA;QACzB,CAAC,CAAA;QAED,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC9B,KAAK,EAAE,CAAA;YACP,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;SAClD;QACD,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE;YAC7D,KAAK,EAAE,CAAA;YACP,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;SACxD;QAED,IAAI,EAAE,CAAA;IACR,CAAC;IAED,UAAU,CAAC,MAAY,EAAE,QAAmB,EAAE,EAAa;QACzD,qBAAqB;QACrB,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,EAAE,EAAE,CAAA;QAC9B,oBAAoB;QACpB,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,wBAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;IAClE,CAAC;IAED,WAAW,CACT,MAAY,EACZ,QAAmB,EACnB,SAAoB,EACpB,EAAa;QAEb,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC;YAAE,OAAO,EAAE,EAAE,CAAA;QAC9C,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,EAAE,EAAE,CAAA;QAC9B,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CACjB,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,CAAC,CAClD,CAAA;YACD,OAAM;SACP;QACD,SAAS,CAAC,eAAe,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;QAE3C,qEAAqE;QACrE,4DAA4D;QAC5D,yDAAyD;QACzD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,IAAI,EAAE,KAAK,KAAK,CAAC;gBAAE,EAAE,EAAE,CAAA;QACzB,CAAC,CAAA;QAED,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACnC;QAED,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,cAAc,EAAE,EAAE;YAC1C,IAAI,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAC5D,SAAQ;aACT;YACD,KAAK,EAAE,CAAA;YACP,MAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,EAAE,CAAA;YAChC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,CAAA;SAC/C;QAED,IAAI,EAAE,CAAA;IACR,CAAC;IAED,WAAW,CACT,MAAY,EACZ,OAAe,EACf,SAAoB,EACpB,EAAa;QAEb,SAAS,GAAG,SAAS,CAAC,aAAa,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;QAEpD,IAAI,KAAK,GAAG,CAAC,CAAA;QACb,MAAM,IAAI,GAAG,GAAG,EAAE;YAChB,IAAI,EAAE,KAAK,KAAK,CAAC;gBAAE,EAAE,EAAE,CAAA;QACzB,CAAC,CAAA;QAED,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAQ;YAC9B,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACnC;QACD,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE;YAC7D,KAAK,EAAE,CAAA;YACP,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,CAAA;SAC5D;QAED,IAAI,EAAE,CAAA;IACR,CAAC;CACF;AAlSD,4BAkSC;AAED,MAAa,UAEX,SAAQ,QAAW;IACnB,OAAO,CAMe;IAEtB,YAAY,QAAmB,EAAE,IAAU,EAAE,IAAO;QAClD,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC3B,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAA;IACxC,CAAC;IAGD,SAAS,CAAC,CAAgB;QACxB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACrB,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QAClD,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE;YACzB,MAAM,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAA;SACxB;QACD,MAAM,IAAI,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;YAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;gBACzC,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,EAAE;oBACxB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;iBACxB;qBAAM;oBACL,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;iBAClB;YACH,CAAC,CAAC,CAAA;QACJ,CAAC,CAAC,CAAA;QACF,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,QAAQ;QACN,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;YAAE,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QAClD,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE;YACzB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAA;SACtB;QACD,4DAA4D;QAC5D,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE;YAC7C,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO;gBAAE,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QACpD,CAAC,CAAC,CAAA;QACF,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;CACF;AAjDD,gCAiDC;AAED,MAAa,UAEX,SAAQ,QAAW;IACnB,OAAO,CAMmC;IAE1C,YAAY,QAAmB,EAAE,IAAU,EAAE,IAAO;QAClD,KAAK,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC3B,IAAI,CAAC,OAAO,GAAG,IAAI,mBAAQ,CAAC;YAC1B,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,UAAU,EAAE,IAAI;SACjB,CAAmB,CAAA;QACpB,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;QAC7C,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;IAChD,CAAC;IAGD,SAAS,CAAC,CAAgB;QACxB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QACrB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO;YAAE,IAAI,CAAC,KAAK,EAAE,CAAA;IACzC,CAAC;IAED,MAAM;QACJ,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAA;QACxB,IAAI,MAAM,CAAC,SAAS,EAAE,EAAE;YACtB,MAAM,CAAC,KAAK,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;gBACvB,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;YAC9D,CAAC,CAAC,CAAA;SACH;aAAM;YACL,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;SAC7D;QACD,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;IAED,UAAU;QACR,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE;YACzB,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAA;SACtB;QACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;QACnE,OAAO,IAAI,CAAC,OAAO,CAAA;IACrB,CAAC;CACF;AA9CD,gCA8CC","sourcesContent":["/**\n * Single-use utility classes to provide functionality to the {@link Glob}\n * methods.\n *\n * @module\n */\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport { Ignore, IgnoreLike } from './ignore.js'\n\n// XXX can we somehow make it so that it NEVER processes a given path more than\n// once, enough that the match set tracking is no longer needed?  that'd speed\n// things up a lot.  Or maybe bring back nounique, and skip it in that case?\n\n// a single minimatch set entry with 1 or more parts\nimport { Pattern } from './pattern.js'\nimport { Processor } from './processor.js'\n\nexport interface GlobWalkerOpts {\n  absolute?: boolean\n  allowWindowsEscape?: boolean\n  cwd?: string | URL\n  dot?: boolean\n  dotRelative?: boolean\n  follow?: boolean\n  ignore?: string | string[] | IgnoreLike\n  mark?: boolean\n  matchBase?: boolean\n  // Note: maxDepth here means \"maximum actual Path.depth()\",\n  // not \"maximum depth beyond cwd\"\n  maxDepth?: number\n  nobrace?: boolean\n  nocase?: boolean\n  nodir?: boolean\n  noext?: boolean\n  noglobstar?: boolean\n  platform?: NodeJS.Platform\n  posix?: boolean\n  realpath?: boolean\n  root?: string\n  stat?: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape?: boolean\n  withFileTypes?: boolean\n}\n\nexport type GWOFileTypesTrue = GlobWalkerOpts & {\n  withFileTypes: true\n}\nexport type GWOFileTypesFalse = GlobWalkerOpts & {\n  withFileTypes: false\n}\nexport type GWOFileTypesUnset = GlobWalkerOpts & {\n  withFileTypes?: undefined\n}\n\nexport type Result<O extends GlobWalkerOpts> = O extends GWOFileTypesTrue\n  ? Path\n  : O extends GWOFileTypesFalse\n  ? string\n  : O extends GWOFileTypesUnset\n  ? string\n  : Path | string\n\nexport type Matches<O extends GlobWalkerOpts> = O extends GWOFileTypesTrue\n  ? Set<Path>\n  : O extends GWOFileTypesFalse\n  ? Set<string>\n  : O extends GWOFileTypesUnset\n  ? Set<string>\n  : Set<Path | string>\n\nexport type MatchStream<O extends GlobWalkerOpts> =\n  O extends GWOFileTypesTrue\n    ? Minipass<Path, Path>\n    : O extends GWOFileTypesFalse\n    ? Minipass<string, string>\n    : O extends GWOFileTypesUnset\n    ? Minipass<string, string>\n    : Minipass<Path | string, Path | string>\n\nconst makeIgnore = (\n  ignore: string | string[] | IgnoreLike,\n  opts: GlobWalkerOpts\n): IgnoreLike =>\n  typeof ignore === 'string'\n    ? new Ignore([ignore], opts)\n    : Array.isArray(ignore)\n    ? new Ignore(ignore, opts)\n    : ignore\n\n/**\n * basic walking utilities that all the glob walker types use\n */\nexport abstract class GlobUtil<O extends GlobWalkerOpts = GlobWalkerOpts> {\n  path: Path\n  patterns: Pattern[]\n  opts: O\n  seen: Set<Path> = new Set<Path>()\n  paused: boolean = false\n  aborted: boolean = false\n  #onResume: (() => any)[] = []\n  #ignore?: IgnoreLike\n  #sep: '\\\\' | '/'\n  signal?: AbortSignal\n  maxDepth: number\n\n  constructor(patterns: Pattern[], path: Path, opts: O)\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    this.patterns = patterns\n    this.path = path\n    this.opts = opts\n    this.#sep = !opts.posix && opts.platform === 'win32' ? '\\\\' : '/'\n    if (opts.ignore) {\n      this.#ignore = makeIgnore(opts.ignore, opts)\n    }\n    // ignore, always set with maxDepth, but it's optional on the\n    // GlobOptions type\n    /* c8 ignore start */\n    this.maxDepth = opts.maxDepth || Infinity\n    /* c8 ignore stop */\n    if (opts.signal) {\n      this.signal = opts.signal\n      this.signal.addEventListener('abort', () => {\n        this.#onResume.length = 0\n      })\n    }\n  }\n\n  #ignored(path: Path): boolean {\n    return this.seen.has(path) || !!this.#ignore?.ignored?.(path)\n  }\n  #childrenIgnored(path: Path): boolean {\n    return !!this.#ignore?.childrenIgnored?.(path)\n  }\n\n  // backpressure mechanism\n  pause() {\n    this.paused = true\n  }\n  resume() {\n    /* c8 ignore start */\n    if (this.signal?.aborted) return\n    /* c8 ignore stop */\n    this.paused = false\n    let fn: (() => any) | undefined = undefined\n    while (!this.paused && (fn = this.#onResume.shift())) {\n      fn()\n    }\n  }\n  onResume(fn: () => any) {\n    if (this.signal?.aborted) return\n    /* c8 ignore start */\n    if (!this.paused) {\n      fn()\n    } else {\n      /* c8 ignore stop */\n      this.#onResume.push(fn)\n    }\n  }\n\n  // do the requisite realpath/stat checking, and return the path\n  // to add or undefined to filter it out.\n  async matchCheck(e: Path, ifDir: boolean): Promise<Path | undefined> {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || (await e.realpath())\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    return this.matchCheckTest(needStat ? await e.lstat() : e, ifDir)\n  }\n\n  matchCheckTest(e: Path | undefined, ifDir: boolean): Path | undefined {\n    return e &&\n      (this.maxDepth === Infinity || e.depth() <= this.maxDepth) &&\n      (!ifDir || e.canReaddir()) &&\n      (!this.opts.nodir || !e.isDirectory()) &&\n      !this.#ignored(e)\n      ? e\n      : undefined\n  }\n\n  matchCheckSync(e: Path, ifDir: boolean): Path | undefined {\n    if (ifDir && this.opts.nodir) return undefined\n    let rpc: Path | undefined\n    if (this.opts.realpath) {\n      rpc = e.realpathCached() || e.realpathSync()\n      if (!rpc) return undefined\n      e = rpc\n    }\n    const needStat = e.isUnknown() || this.opts.stat\n    return this.matchCheckTest(needStat ? e.lstatSync() : e, ifDir)\n  }\n\n  abstract matchEmit(p: Result<O>): void\n  abstract matchEmit(p: string | Path): void\n\n  matchFinish(e: Path, absolute: boolean) {\n    if (this.#ignored(e)) return\n    const abs =\n      this.opts.absolute === undefined ? absolute : this.opts.absolute\n    this.seen.add(e)\n    const mark = this.opts.mark && e.isDirectory() ? this.#sep : ''\n    // ok, we have what we need!\n    if (this.opts.withFileTypes) {\n      this.matchEmit(e)\n    } else if (abs) {\n      const abs = this.opts.posix ? e.fullpathPosix() : e.fullpath()\n      this.matchEmit(abs + mark)\n    } else {\n      const rel = this.opts.posix ? e.relativePosix() : e.relative()\n      const pre =\n        this.opts.dotRelative && !rel.startsWith('..' + this.#sep)\n          ? '.' + this.#sep\n          : ''\n      this.matchEmit(!rel ? '.' + mark : pre + rel + mark)\n    }\n  }\n\n  async match(e: Path, absolute: boolean, ifDir: boolean): Promise<void> {\n    const p = await this.matchCheck(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  matchSync(e: Path, absolute: boolean, ifDir: boolean): void {\n    const p = this.matchCheckSync(e, ifDir)\n    if (p) this.matchFinish(p, absolute)\n  }\n\n  walkCB(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() => this.walkCB2(target, patterns, processor, cb))\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const childrenCached = t.readdirCached()\n      if (t.calledReaddir())\n        this.walkCB3(t, childrenCached, processor, next)\n      else {\n        t.readdirCB(\n          (_, entries) => this.walkCB3(t, entries, processor, next),\n          true\n        )\n      }\n    }\n\n    next()\n  }\n\n  walkCB3(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      tasks++\n      this.match(m, absolute, ifDir).then(() => next())\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n\n  walkCBSync(target: Path, patterns: Pattern[], cb: () => any) {\n    /* c8 ignore start */\n    if (this.signal?.aborted) cb()\n    /* c8 ignore stop */\n    this.walkCB2Sync(target, patterns, new Processor(this.opts), cb)\n  }\n\n  walkCB2Sync(\n    target: Path,\n    patterns: Pattern[],\n    processor: Processor,\n    cb: () => any\n  ) {\n    if (this.#childrenIgnored(target)) return cb()\n    if (this.signal?.aborted) cb()\n    if (this.paused) {\n      this.onResume(() =>\n        this.walkCB2Sync(target, patterns, processor, cb)\n      )\n      return\n    }\n    processor.processPatterns(target, patterns)\n\n    // done processing.  all of the above is sync, can be abstracted out.\n    // subwalks is a map of paths to the entry filters they need\n    // matches is a map of paths to [absolute, ifDir] tuples.\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n\n    for (const t of processor.subwalkTargets()) {\n      if (this.maxDepth !== Infinity && t.depth() >= this.maxDepth) {\n        continue\n      }\n      tasks++\n      const children = t.readdirSync()\n      this.walkCB3Sync(t, children, processor, next)\n    }\n\n    next()\n  }\n\n  walkCB3Sync(\n    target: Path,\n    entries: Path[],\n    processor: Processor,\n    cb: () => any\n  ) {\n    processor = processor.filterEntries(target, entries)\n\n    let tasks = 1\n    const next = () => {\n      if (--tasks === 0) cb()\n    }\n\n    for (const [m, absolute, ifDir] of processor.matches.entries()) {\n      if (this.#ignored(m)) continue\n      this.matchSync(m, absolute, ifDir)\n    }\n    for (const [target, patterns] of processor.subwalks.entries()) {\n      tasks++\n      this.walkCB2Sync(target, patterns, processor.child(), next)\n    }\n\n    next()\n  }\n}\n\nexport class GlobWalker<\n  O extends GlobWalkerOpts = GlobWalkerOpts\n> extends GlobUtil<O> {\n  matches: O extends GWOFileTypesTrue\n    ? Set<Path>\n    : O extends GWOFileTypesFalse\n    ? Set<string>\n    : O extends GWOFileTypesUnset\n    ? Set<string>\n    : Set<Path | string>\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n    this.matches = new Set() as Matches<O>\n  }\n\n  matchEmit(e: Result<O>): void\n  matchEmit(e: Path | string): void {\n    this.matches.add(e)\n  }\n\n  async walk(): Promise<Matches<O>> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      await this.path.lstat()\n    }\n    await new Promise((res, rej) => {\n      this.walkCB(this.path, this.patterns, () => {\n        if (this.signal?.aborted) {\n          rej(this.signal.reason)\n        } else {\n          res(this.matches)\n        }\n      })\n    })\n    return this.matches\n  }\n\n  walkSync(): Matches<O> {\n    if (this.signal?.aborted) throw this.signal.reason\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    // nothing for the callback to do, because this never pauses\n    this.walkCBSync(this.path, this.patterns, () => {\n      if (this.signal?.aborted) throw this.signal.reason\n    })\n    return this.matches\n  }\n}\n\nexport class GlobStream<\n  O extends GlobWalkerOpts = GlobWalkerOpts\n> extends GlobUtil<O> {\n  results: O extends GWOFileTypesTrue\n    ? Minipass<Path, Path>\n    : O extends GWOFileTypesFalse\n    ? Minipass<string, string>\n    : O extends GWOFileTypesUnset\n    ? Minipass<string, string>\n    : Minipass<Path | string, Path | string>\n\n  constructor(patterns: Pattern[], path: Path, opts: O) {\n    super(patterns, path, opts)\n    this.results = new Minipass({\n      signal: this.signal,\n      objectMode: true,\n    }) as MatchStream<O>\n    this.results.on('drain', () => this.resume())\n    this.results.on('resume', () => this.resume())\n  }\n\n  matchEmit(e: Result<O>): void\n  matchEmit(e: Path | string): void {\n    this.results.write(e)\n    if (!this.results.flowing) this.pause()\n  }\n\n  stream(): MatchStream<O> {\n    const target = this.path\n    if (target.isUnknown()) {\n      target.lstat().then(() => {\n        this.walkCB(target, this.patterns, () => this.results.end())\n      })\n    } else {\n      this.walkCB(target, this.patterns, () => this.results.end())\n    }\n    return this.results\n  }\n\n  streamSync(): MatchStream<O> {\n    if (this.path.isUnknown()) {\n      this.path.lstatSync()\n    }\n    this.walkCBSync(this.path, this.patterns, () => this.results.end())\n    return this.results\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/esm/bin.d.mts b/deps/npm/node_modules/glob/dist/esm/bin.d.mts
new file mode 100644
index 00000000000000..77298e47708175
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/bin.d.mts
@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=bin.d.mts.map
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/esm/bin.d.mts.map b/deps/npm/node_modules/glob/dist/esm/bin.d.mts.map
new file mode 100644
index 00000000000000..ec64bdda861bc9
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/bin.d.mts.map
@@ -0,0 +1 @@
+{"version":3,"file":"bin.d.mts","sourceRoot":"","sources":["../../src/bin.mts"],"names":[],"mappings":""}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/bin.js b/deps/npm/node_modules/glob/dist/esm/bin.mjs
similarity index 91%
rename from deps/npm/node_modules/glob/dist/cjs/src/bin.js
rename to deps/npm/node_modules/glob/dist/esm/bin.mjs
index 4a8a88f2734d2e..9d57d4a943b26b 100755
--- a/deps/npm/node_modules/glob/dist/cjs/src/bin.js
+++ b/deps/npm/node_modules/glob/dist/esm/bin.mjs
@@ -1,16 +1,19 @@
 #!/usr/bin/env node
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const foreground_child_1 = require("foreground-child");
-const fs_1 = require("fs");
-const jackspeak_1 = require("jackspeak");
-const package_json_1 = require("../package.json");
-const index_js_1 = require("./index.js");
-const j = (0, jackspeak_1.jack)({
+import { foregroundChild } from 'foreground-child';
+import { existsSync } from 'fs';
+import { readFile } from 'fs/promises';
+import { jack } from 'jackspeak';
+import { join } from 'path';
+import { fileURLToPath } from 'url';
+import { globStream } from './index.js';
+/* c8 ignore start */
+const { version } = JSON.parse(await readFile(fileURLToPath(new URL('../../package.json', import.meta.url)), 'utf8').catch(() => readFile(fileURLToPath(new URL('../../package.json', import.meta.url)), 'utf8')));
+/* c8 ignore stop */
+const j = jack({
     usage: 'glob [options] [<pattern> [<pattern> ...]]',
 })
     .description(`
-    Glob v${package_json_1.version}
+    Glob v${version}
 
     Expand the positional glob expression arguments into any matching file
     system paths found.
@@ -228,9 +231,11 @@ try {
         positionals.push(values.default);
     const patterns = values.all
         ? positionals
-        : positionals.filter(p => !(0, fs_1.existsSync)(p));
-    const matches = values.all ? [] : positionals.filter(p => (0, fs_1.existsSync)(p));
-    const stream = (0, index_js_1.globStream)(patterns, {
+        : positionals.filter(p => !existsSync(p));
+    const matches = values.all
+        ? []
+        : positionals.filter(p => existsSync(p)).map(p => join(p));
+    const stream = globStream(patterns, {
         absolute: values.absolute,
         cwd: values.cwd,
         dot: values.dot,
@@ -259,7 +264,7 @@ try {
     }
     else {
         stream.on('data', f => matches.push(f));
-        stream.on('end', () => (0, foreground_child_1.foregroundChild)(cmd, matches, { shell: true }));
+        stream.on('end', () => foregroundChild(cmd, matches, { shell: true }));
     }
 }
 catch (e) {
@@ -267,4 +272,4 @@ catch (e) {
     console.error(e instanceof Error ? e.message : String(e));
     process.exit(1);
 }
-//# sourceMappingURL=bin.js.map
\ No newline at end of file
+//# sourceMappingURL=bin.mjs.map
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/esm/bin.mjs.map b/deps/npm/node_modules/glob/dist/esm/bin.mjs.map
new file mode 100644
index 00000000000000..bcf08f762f710c
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/bin.mjs.map
@@ -0,0 +1 @@
+{"version":3,"file":"bin.mjs","sourceRoot":"","sources":["../../src/bin.mts"],"names":[],"mappings":";AACA,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAA;AAClD,OAAO,EAAE,UAAU,EAAE,MAAM,IAAI,CAAA;AAC/B,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AACtC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAA;AAC3B,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAA;AACnC,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AAEvC,qBAAqB;AACrB,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,CAC5B,MAAM,QAAQ,CACZ,aAAa,CAAC,IAAI,GAAG,CAAC,oBAAoB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAC7D,MAAM,CACP,CAAC,KAAK,CAAC,GAAG,EAAE,CACX,QAAQ,CACN,aAAa,CAAC,IAAI,GAAG,CAAC,oBAAoB,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAC7D,MAAM,CACP,CACF,CACqB,CAAA;AACxB,oBAAoB;AAEpB,MAAM,CAAC,GAAG,IAAI,CAAC;IACb,KAAK,EAAE,4CAA4C;CACpD,CAAC;KACC,WAAW,CACV;YACQ,OAAO;;;;GAIhB,CACA;KACA,GAAG,CAAC;IACH,GAAG,EAAE;QACH,KAAK,EAAE,GAAG;QACV,IAAI,EAAE,SAAS;QACf,WAAW,EAAE;0CACuB;KACrC;CACF,CAAC;KACD,GAAG,CAAC;IACH,OAAO,EAAE;QACP,KAAK,EAAE,GAAG;QACV,IAAI,EAAE,SAAS;QACf,WAAW,EAAE;iCACc;KAC5B;CACF,CAAC;KACD,IAAI,CAAC;IACJ,GAAG,EAAE;QACH,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;;;;;;;;;;;;;;;;;;;OAqBZ;KACF;IACD,QAAQ,EAAE;QACR,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,0BAA0B;KACxC;IACD,cAAc,EAAE;QACd,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,kCAAkC;KAChD;IACD,IAAI,EAAE;QACJ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,uCAAuC;KACrD;IACD,KAAK,EAAE;QACL,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;;;OAKZ;KACF;IAED,MAAM,EAAE;QACN,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,kDAAkD;KAChE;IACD,QAAQ,EAAE;QACR,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;+DAG4C;KAC1D;IACD,IAAI,EAAE;QACJ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;wDACqC;KACnD;IACD,YAAY,EAAE;QACZ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;;OAIZ;KACF;IAED,GAAG,EAAE;QACH,WAAW,EAAE;;OAEZ;KACF;IACD,OAAO,EAAE;QACP,WAAW,EAAE,8BAA8B;KAC5C;IACD,MAAM,EAAE;QACN,WAAW,EAAE;;;;;;;;;OASZ;KACF;IACD,KAAK,EAAE;QACL,WAAW,EAAE;;;;OAIZ;KACF;IACD,KAAK,EAAE;QACL,WAAW,EAAE,kDAAkD;KAChE;IACD,UAAU,EAAE;QACV,WAAW,EAAE;0DACuC;KACrD;IACD,wBAAwB,EAAE;QACxB,WAAW,EAAE;;sDAEmC;KACjD;CACF,CAAC;KACD,GAAG,CAAC;IACH,WAAW,EAAE;QACX,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;sCACmB;KACjC;CACF,CAAC;KACD,GAAG,CAAC;IACH,GAAG,EAAE;QACH,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,+CAA+C;QAC5D,OAAO,EAAE,OAAO,CAAC,GAAG,EAAE;KACvB;IACD,IAAI,EAAE;QACJ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;;;;;;;;;;;;;;;;;;;OAmBZ;KACF;IACD,QAAQ,EAAE;QACR,WAAW,EAAE;;uEAEoD;QACjE,QAAQ,EAAE,CAAC,CAAC,EAAE,CACZ,IAAI,GAAG,CAAC;YACN,KAAK;YACL,SAAS;YACT,QAAQ;YACR,SAAS;YACT,OAAO;YACP,OAAO;YACP,SAAS;YACT,OAAO;YACP,OAAO;YACP,QAAQ;YACR,QAAQ;SACT,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;KACZ;CACF,CAAC;KACD,OAAO,CAAC;IACP,MAAM,EAAE;QACN,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,yBAAyB;KACvC;CACF,CAAC;KACD,IAAI,CAAC;IACJ,KAAK,EAAE;QACL,KAAK,EAAE,GAAG;QACV,WAAW,EAAE;yEACsD;KACpE;CACF,CAAC;KACD,IAAI,CAAC;IACJ,IAAI,EAAE;QACJ,KAAK,EAAE,GAAG;QACV,WAAW,EAAE,6BAA6B;KAC3C;CACF,CAAC,CAAA;AAEJ,IAAI;IACF,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,EAAE,CAAA;IACzC,IAAI,MAAM,CAAC,IAAI,EAAE;QACf,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;QACtB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;KAChB;IACD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO;QAC7C,MAAM,sBAAsB,CAAA;IAC9B,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO;QAC5C,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG;QACzB,CAAC,CAAC,WAAW;QACb,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3C,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG;QACxB,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAC5D,MAAM,MAAM,GAAG,UAAU,CAAC,QAAQ,EAAE;QAClC,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,GAAG,EAAE,MAAM,CAAC,GAAG;QACf,WAAW,EAAE,MAAM,CAAC,cAAc,CAAC;QACnC,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,SAAS,EAAE,MAAM,CAAC,YAAY,CAAC;QAC/B,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC;QAC7B,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,MAAM,EAAE,MAAM,CAAC,MAAM;QACrB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,UAAU,EAAE,MAAM,CAAC,UAAU;QAC7B,QAAQ,EAAE,MAAM,CAAC,QAAuC;QACxD,QAAQ,EAAE,MAAM,CAAC,QAAQ;QACzB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,KAAK,EAAE,MAAM,CAAC,KAAK;QACnB,KAAK,EAAE,MAAM,CAAC,KAAK;KACpB,CAAC,CAAA;IAEF,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAA;IACtB,IAAI,CAAC,GAAG,EAAE;QACR,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACpC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;KACvC;SAAM;QACL,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QACvC,MAAM,CAAC,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,eAAe,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAA;KACvE;CACF;AAAC,OAAO,CAAC,EAAE;IACV,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAA;IACxB,OAAO,CAAC,KAAK,CAAC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;IACzD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;CAChB","sourcesContent":["#!/usr/bin/env node\nimport { foregroundChild } from 'foreground-child'\nimport { existsSync } from 'fs'\nimport { readFile } from 'fs/promises'\nimport { jack } from 'jackspeak'\nimport { join } from 'path'\nimport { fileURLToPath } from 'url'\nimport { globStream } from './index.js'\n\n/* c8 ignore start */\nconst { version } = JSON.parse(\n  await readFile(\n    fileURLToPath(new URL('../../package.json', import.meta.url)),\n    'utf8'\n  ).catch(() =>\n    readFile(\n      fileURLToPath(new URL('../../package.json', import.meta.url)),\n      'utf8'\n    )\n  )\n) as { version: string }\n/* c8 ignore stop */\n\nconst j = jack({\n  usage: 'glob [options] [<pattern> [<pattern> ...]]',\n})\n  .description(\n    `\n    Glob v${version}\n\n    Expand the positional glob expression arguments into any matching file\n    system paths found.\n  `\n  )\n  .opt({\n    cmd: {\n      short: 'c',\n      hint: 'command',\n      description: `Run the command provided, passing the glob expression\n                    matches as arguments.`,\n    },\n  })\n  .opt({\n    default: {\n      short: 'p',\n      hint: 'pattern',\n      description: `If no positional arguments are provided, glob will use\n                    this pattern`,\n    },\n  })\n  .flag({\n    all: {\n      short: 'A',\n      description: `By default, the glob cli command will not expand any\n                    arguments that are an exact match to a file on disk.\n\n                    This prevents double-expanding, in case the shell expands\n                    an argument whose filename is a glob expression.\n\n                    For example, if 'app/*.ts' would match 'app/[id].ts', then\n                    on Windows powershell or cmd.exe, 'glob app/*.ts' will\n                    expand to 'app/[id].ts', as expected. However, in posix\n                    shells such as bash or zsh, the shell will first expand\n                    'app/*.ts' to a list of filenames. Then glob will look\n                    for a file matching 'app/[id].ts' (ie, 'app/i.ts' or\n                    'app/d.ts'), which is unexpected.\n\n                    Setting '--all' prevents this behavior, causing glob\n                    to treat ALL patterns as glob expressions to be expanded,\n                    even if they are an exact match to a file on disk.\n\n                    When setting this option, be sure to enquote arguments\n                    so that the shell will not expand them prior to passing\n                    them to the glob command process.\n      `,\n    },\n    absolute: {\n      short: 'a',\n      description: 'Expand to absolute paths',\n    },\n    'dot-relative': {\n      short: 'd',\n      description: `Prepend './' on relative matches`,\n    },\n    mark: {\n      short: 'm',\n      description: `Append a / on any directories matched`,\n    },\n    posix: {\n      short: 'x',\n      description: `Always resolve to posix style paths, using '/' as the\n                    directory separator, even on Windows. Drive letter\n                    absolute matches on Windows will be expanded to their\n                    full resolved UNC maths, eg instead of 'C:\\\\foo\\\\bar',\n                    it will expand to '//?/C:/foo/bar'.\n      `,\n    },\n\n    follow: {\n      short: 'f',\n      description: `Follow symlinked directories when expanding '**'`,\n    },\n    realpath: {\n      short: 'R',\n      description: `Call 'fs.realpath' on all of the results. In the case\n                    of an entry that cannot be resolved, the entry is\n                    omitted. This incurs a slight performance penalty, of\n                    course, because of the added system calls.`,\n    },\n    stat: {\n      short: 's',\n      description: `Call 'fs.lstat' on all entries, whether required or not\n                    to determine if it's a valid match.`,\n    },\n    'match-base': {\n      short: 'b',\n      description: `Perform a basename-only match if the pattern does not\n                    contain any slash characters. That is, '*.js' would be\n                    treated as equivalent to '**/*.js', matching js files\n                    in all directories.\n      `,\n    },\n\n    dot: {\n      description: `Allow patterns to match files/directories that start\n                    with '.', even if the pattern does not start with '.'\n      `,\n    },\n    nobrace: {\n      description: 'Do not expand {...} patterns',\n    },\n    nocase: {\n      description: `Perform a case-insensitive match. This defaults to\n                    'true' on macOS and Windows platforms, and false on\n                    all others.\n\n                    Note: 'nocase' should only be explicitly set when it is\n                    known that the filesystem's case sensitivity differs\n                    from the platform default. If set 'true' on\n                    case-insensitive file systems, then the walk may return\n                    more or less results than expected.\n      `,\n    },\n    nodir: {\n      description: `Do not match directories, only files.\n\n                    Note: to *only* match directories, append a '/' at the\n                    end of the pattern.\n      `,\n    },\n    noext: {\n      description: `Do not expand extglob patterns, such as '+(a|b)'`,\n    },\n    noglobstar: {\n      description: `Do not expand '**' against multiple path portions.\n                    Ie, treat it as a normal '*' instead.`,\n    },\n    'windows-path-no-escape': {\n      description: `Use '\\\\' as a path separator *only*, and *never* as an\n                    escape character. If set, all '\\\\' characters are\n                    replaced with '/' in the pattern.`,\n    },\n  })\n  .num({\n    'max-depth': {\n      short: 'D',\n      description: `Maximum depth to traverse from the current\n                    working directory`,\n    },\n  })\n  .opt({\n    cwd: {\n      short: 'C',\n      description: 'Current working directory to execute/match in',\n      default: process.cwd(),\n    },\n    root: {\n      short: 'r',\n      description: `A string path resolved against the 'cwd', which is\n                    used as the starting point for absolute patterns that\n                    start with '/' (but not drive letters or UNC paths\n                    on Windows).\n\n                    Note that this *doesn't* necessarily limit the walk to\n                    the 'root' directory, and doesn't affect the cwd\n                    starting point for non-absolute patterns. A pattern\n                    containing '..' will still be able to traverse out of\n                    the root directory, if it is not an actual root directory\n                    on the filesystem, and any non-absolute patterns will\n                    still be matched in the 'cwd'.\n\n                    To start absolute and non-absolute patterns in the same\n                    path, you can use '--root=' to set it to the empty\n                    string. However, be aware that on Windows systems, a\n                    pattern like 'x:/*' or '//host/share/*' will *always*\n                    start in the 'x:/' or '//host/share/' directory,\n                    regardless of the --root setting.\n      `,\n    },\n    platform: {\n      description: `Defaults to the value of 'process.platform' if\n                    available, or 'linux' if not. Setting --platform=win32\n                    on non-Windows systems may cause strange behavior!`,\n      validate: v =>\n        new Set([\n          'aix',\n          'android',\n          'darwin',\n          'freebsd',\n          'haiku',\n          'linux',\n          'openbsd',\n          'sunos',\n          'win32',\n          'cygwin',\n          'netbsd',\n        ]).has(v),\n    },\n  })\n  .optList({\n    ignore: {\n      short: 'i',\n      description: `Glob patterns to ignore`,\n    },\n  })\n  .flag({\n    debug: {\n      short: 'v',\n      description: `Output a huge amount of noisy debug information about\n                    patterns as they are parsed and used to match files.`,\n    },\n  })\n  .flag({\n    help: {\n      short: 'h',\n      description: 'Show this usage information',\n    },\n  })\n\ntry {\n  const { positionals, values } = j.parse()\n  if (values.help) {\n    console.log(j.usage())\n    process.exit(0)\n  }\n  if (positionals.length === 0 && !values.default)\n    throw 'No patterns provided'\n  if (positionals.length === 0 && values.default)\n    positionals.push(values.default)\n  const patterns = values.all\n    ? positionals\n    : positionals.filter(p => !existsSync(p))\n  const matches = values.all\n    ? []\n    : positionals.filter(p => existsSync(p)).map(p => join(p))\n  const stream = globStream(patterns, {\n    absolute: values.absolute,\n    cwd: values.cwd,\n    dot: values.dot,\n    dotRelative: values['dot-relative'],\n    follow: values.follow,\n    ignore: values.ignore,\n    mark: values.mark,\n    matchBase: values['match-base'],\n    maxDepth: values['max-depth'],\n    nobrace: values.nobrace,\n    nocase: values.nocase,\n    nodir: values.nodir,\n    noext: values.noext,\n    noglobstar: values.noglobstar,\n    platform: values.platform as undefined | NodeJS.Platform,\n    realpath: values.realpath,\n    root: values.root,\n    stat: values.stat,\n    debug: values.debug,\n    posix: values.posix,\n  })\n\n  const cmd = values.cmd\n  if (!cmd) {\n    matches.forEach(m => console.log(m))\n    stream.on('data', f => console.log(f))\n  } else {\n    stream.on('data', f => matches.push(f))\n    stream.on('end', () => foregroundChild(cmd, matches, { shell: true }))\n  }\n} catch (e) {\n  console.error(j.usage())\n  console.error(e instanceof Error ? e.message : String(e))\n  process.exit(1)\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/glob.d.ts b/deps/npm/node_modules/glob/dist/esm/glob.d.ts
similarity index 99%
rename from deps/npm/node_modules/glob/dist/mjs/glob.d.ts
rename to deps/npm/node_modules/glob/dist/esm/glob.d.ts
index a8b3da7722b652..55674de4490de9 100644
--- a/deps/npm/node_modules/glob/dist/mjs/glob.d.ts
+++ b/deps/npm/node_modules/glob/dist/esm/glob.d.ts
@@ -1,4 +1,4 @@
-/// <reference types="node" />
+/// <reference types="node" resolution-mode="require"/>
 import { Minimatch } from 'minimatch';
 import { Minipass } from 'minipass';
 import { FSOption, Path, PathScurry } from 'path-scurry';
diff --git a/deps/npm/node_modules/glob/dist/esm/glob.d.ts.map b/deps/npm/node_modules/glob/dist/esm/glob.d.ts.map
new file mode 100644
index 00000000000000..5216438a25086b
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/glob.d.ts.map
@@ -0,0 +1 @@
+{"version":3,"file":"glob.d.ts","sourceRoot":"","sources":["../../src/glob.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,SAAS,EAAoB,MAAM,WAAW,CAAA;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EACL,QAAQ,EACR,IAAI,EACJ,UAAU,EAIX,MAAM,aAAa,CAAA;AAEpB,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAGtC,MAAM,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,CAAC,CAAA;AACvC,MAAM,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,SAAS,CAAC,CAAA;AAWlE;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,WAAW;IAC1B;;;;;;;;;;;;OAYG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAElB;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAE5B;;;;;OAKG;IACH,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,CAAA;IAElB;;;;OAIG;IACH,GAAG,CAAC,EAAE,OAAO,CAAA;IAEb;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,OAAO,CAAA;IAErB;;;;;;;;OAQG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IAEvC;;;;;OAKG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;OAGG;IACH,IAAI,CAAC,EAAE,OAAO,CAAA;IAEd;;;;OAIG;IACH,SAAS,CAAC,EAAE,OAAO,CAAA;IAEnB;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;OAEG;IACH,OAAO,CAAC,EAAE,OAAO,CAAA;IAEjB;;;;;;;;;OASG;IACH,MAAM,CAAC,EAAE,OAAO,CAAA;IAEhB;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;OAEG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;;;;OAKG;IACH,UAAU,CAAC,EAAE,OAAO,CAAA;IAEpB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAA;IAE1B;;;;;OAKG;IACH,QAAQ,CAAC,EAAE,OAAO,CAAA;IAElB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,IAAI,CAAC,EAAE,MAAM,CAAA;IAEb;;;;;OAKG;IACH,MAAM,CAAC,EAAE,UAAU,CAAA;IAEnB;;;;;;OAMG;IACH,IAAI,CAAC,EAAE,OAAO,CAAA;IAEd;;;OAGG;IACH,MAAM,CAAC,EAAE,WAAW,CAAA;IAEpB;;;;;;;;;;;;;OAaG;IACH,oBAAoB,CAAC,EAAE,OAAO,CAAA;IAE9B;;;;;;;OAOG;IACH,aAAa,CAAC,EAAE,OAAO,CAAA;IAEvB;;;OAGG;IACH,EAAE,CAAC,EAAE,QAAQ,CAAA;IAEb;;;OAGG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;IAEf;;;;;;;OAOG;IACH,KAAK,CAAC,EAAE,OAAO,CAAA;CAChB;AAED,MAAM,MAAM,4BAA4B,GAAG,WAAW,GAAG;IACvD,aAAa,EAAE,IAAI,CAAA;IAEnB,QAAQ,CAAC,EAAE,SAAS,CAAA;IACpB,IAAI,CAAC,EAAE,SAAS,CAAA;IAChB,KAAK,CAAC,EAAE,SAAS,CAAA;CAClB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG,WAAW,GAAG;IACxD,aAAa,CAAC,EAAE,KAAK,CAAA;CACtB,CAAA;AAED,MAAM,MAAM,6BAA6B,GAAG,WAAW,GAAG;IACxD,aAAa,CAAC,EAAE,SAAS,CAAA;CAC1B,CAAA;AAED,MAAM,MAAM,MAAM,CAAC,IAAI,IAAI,IAAI,SAAS,4BAA4B,GAChE,IAAI,GACJ,IAAI,SAAS,6BAA6B,GAC1C,MAAM,GACN,IAAI,SAAS,6BAA6B,GAC1C,MAAM,GACN,MAAM,GAAG,IAAI,CAAA;AACjB,MAAM,MAAM,OAAO,CAAC,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAA;AAE1C,MAAM,MAAM,SAAS,CAAC,IAAI,IAAI,IAAI,SAAS,4BAA4B,GACnE,IAAI,GACJ,IAAI,SAAS,6BAA6B,GAC1C,KAAK,GACL,IAAI,SAAS,6BAA6B,GAC1C,KAAK,GACL,OAAO,CAAA;AAEX;;GAEG;AACH,qBAAa,IAAI,CAAC,IAAI,SAAS,WAAW,CAAE,YAAW,WAAW;IAChE,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,GAAG,EAAE,MAAM,CAAA;IACX,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,GAAG,EAAE,OAAO,CAAA;IACZ,WAAW,EAAE,OAAO,CAAA;IACpB,MAAM,EAAE,OAAO,CAAA;IACf,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IACvC,aAAa,EAAE,OAAO,CAAA;IACtB,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,SAAS,EAAE,OAAO,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,OAAO,EAAE,OAAO,CAAA;IAChB,MAAM,EAAE,OAAO,CAAA;IACf,KAAK,EAAE,OAAO,CAAA;IACd,KAAK,EAAE,OAAO,CAAA;IACd,UAAU,EAAE,OAAO,CAAA;IACnB,OAAO,EAAE,MAAM,EAAE,CAAA;IACjB,QAAQ,EAAE,MAAM,CAAC,QAAQ,CAAA;IACzB,QAAQ,EAAE,OAAO,CAAA;IACjB,MAAM,EAAE,UAAU,CAAA;IAClB,IAAI,EAAE,OAAO,CAAA;IACb,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,oBAAoB,EAAE,OAAO,CAAA;IAC7B,aAAa,EAAE,SAAS,CAAC,IAAI,CAAC,CAAA;IAE9B;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;IAEV;;OAEG;IACH,QAAQ,EAAE,OAAO,EAAE,CAAA;IAEnB;;;;;;;;;;;OAWG;gBACS,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,IAAI,EAAE,IAAI;IA4HlD;;OAEG;IACG,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAmBpC;;OAEG;IACH,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAezB;;OAEG;IACH,MAAM,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAa9C;;OAEG;IACH,UAAU,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IAalD;;;OAGG;IACH,WAAW,IAAI,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IAGlD,CAAC,MAAM,CAAC,QAAQ,CAAC;IAIjB;;;OAGG;IACH,OAAO,IAAI,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC;IAGnD,CAAC,MAAM,CAAC,aAAa,CAAC;CAGvB"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/glob.js b/deps/npm/node_modules/glob/dist/esm/glob.js
similarity index 97%
rename from deps/npm/node_modules/glob/dist/mjs/glob.js
rename to deps/npm/node_modules/glob/dist/esm/glob.js
index 8ff26154427be9..2a2b15d3685b88 100644
--- a/deps/npm/node_modules/glob/dist/mjs/glob.js
+++ b/deps/npm/node_modules/glob/dist/esm/glob.js
@@ -159,7 +159,12 @@ export class Glob {
             return set;
         }, [[], []]);
         this.patterns = matchSet.map((set, i) => {
-            return new Pattern(set, globParts[i], 0, this.platform);
+            const g = globParts[i];
+            /* c8 ignore start */
+            if (!g)
+                throw new Error('invalid pattern object');
+            /* c8 ignore stop */
+            return new Pattern(set, g, 0, this.platform);
         });
     }
     async walk() {
diff --git a/deps/npm/node_modules/glob/dist/esm/glob.js.map b/deps/npm/node_modules/glob/dist/esm/glob.js.map
new file mode 100644
index 00000000000000..d08e810250ec64
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/glob.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"glob.js","sourceRoot":"","sources":["../../src/glob.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAoB,MAAM,WAAW,CAAA;AAEvD,OAAO,EAGL,UAAU,EACV,gBAAgB,EAChB,eAAe,EACf,eAAe,GAChB,MAAM,aAAa,CAAA;AACpB,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAA;AAEnC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AACtC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAKpD,4CAA4C;AAC5C,gDAAgD;AAChD,MAAM,eAAe,GACnB,OAAO,OAAO,KAAK,QAAQ;IAC3B,OAAO;IACP,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;IAClC,CAAC,CAAC,OAAO,CAAC,QAAQ;IAClB,CAAC,CAAC,OAAO,CAAA;AAgTb;;GAEG;AACH,MAAM,OAAO,IAAI;IACf,QAAQ,CAAU;IAClB,GAAG,CAAQ;IACX,IAAI,CAAS;IACb,GAAG,CAAS;IACZ,WAAW,CAAS;IACpB,MAAM,CAAS;IACf,MAAM,CAAiC;IACvC,aAAa,CAAS;IACtB,IAAI,CAAU;IACd,SAAS,CAAS;IAClB,QAAQ,CAAQ;IAChB,OAAO,CAAS;IAChB,MAAM,CAAS;IACf,KAAK,CAAS;IACd,KAAK,CAAS;IACd,UAAU,CAAS;IACnB,OAAO,CAAU;IACjB,QAAQ,CAAiB;IACzB,QAAQ,CAAS;IACjB,MAAM,CAAY;IAClB,IAAI,CAAS;IACb,MAAM,CAAc;IACpB,oBAAoB,CAAS;IAC7B,aAAa,CAAiB;IAE9B;;OAEG;IACH,IAAI,CAAM;IAEV;;OAEG;IACH,QAAQ,CAAW;IAEnB;;;;;;;;;;;OAWG;IACH,YAAY,OAA0B,EAAE,IAAU;QAChD,qBAAqB;QACrB,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,SAAS,CAAC,uBAAuB,CAAC,CAAA;QACvD,oBAAoB;QACpB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAgC,CAAA;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;QACrB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAA;QACrC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QACvB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YACb,IAAI,CAAC,GAAG,GAAG,EAAE,CAAA;SACd;aAAM,IAAI,IAAI,CAAC,GAAG,YAAY,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE;YACpE,IAAI,CAAC,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;SACnC;QACD,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,EAAE,CAAA;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAa,CAAA;QACzC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAA;QAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAE7B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAA;QACnC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAA;QACjC,IAAI,CAAC,QAAQ;YACX,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAA;QAC9D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAEzB,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YACrD,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;SAC9D;QAED,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;YAC/B,OAAO,GAAG,CAAC,OAAO,CAAC,CAAA;SACpB;QAED,IAAI,CAAC,oBAAoB;YACvB,CAAC,CAAC,IAAI,CAAC,oBAAoB;gBAC1B,IAAoB,CAAC,kBAAkB,KAAK,KAAK,CAAA;QAEpD,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC7B,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;SAClD;QAED,IAAI,IAAI,CAAC,SAAS,EAAE;YAClB,IAAI,IAAI,CAAC,UAAU,EAAE;gBACnB,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAA;aACvD;YACD,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAA;SAChE;QAED,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAEtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,eAAe,CAAA;QAChD,IAAI,CAAC,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAA;QAChD,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YACzB,IACE,IAAI,CAAC,MAAM,KAAK,SAAS;gBACzB,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAClC;gBACA,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAA;aACpE;SACF;aAAM;YACL,MAAM,MAAM,GACV,IAAI,CAAC,QAAQ,KAAK,OAAO;gBACvB,CAAC,CAAC,eAAe;gBACjB,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBAC5B,CAAC,CAAC,gBAAgB;oBAClB,CAAC,CAAC,IAAI,CAAC,QAAQ;wBACf,CAAC,CAAC,eAAe;wBACjB,CAAC,CAAC,UAAU,CAAA;YAChB,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;gBACjC,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,EAAE,EAAE,IAAI,CAAC,EAAE;aACZ,CAAC,CAAA;SACH;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QAEhC,8DAA8D;QAC9D,0DAA0D;QAC1D,6DAA6D;QAC7D,kCAAkC;QAClC,MAAM,eAAe,GACnB,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAA;QAEzD,MAAM,GAAG,GAAqB;YAC5B,mCAAmC;YACnC,GAAG,IAAI;YACP,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,eAAe;YACf,SAAS,EAAE,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI;YACd,iBAAiB,EAAE,CAAC;YACpB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,oBAAoB,EAAE,IAAI,CAAC,oBAAoB;YAC/C,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;SACzB,CAAA;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QACxD,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,GAAG,CAAC,MAAM,CACtC,CAAC,GAA0B,EAAE,CAAC,EAAE,EAAE;YAChC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YACrB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAA;YAC3B,OAAO,GAAG,CAAA;QACZ,CAAC,EACD,CAAC,EAAE,EAAE,EAAE,CAAC,CACT,CAAA;QACD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAA;YACtB,qBAAqB;YACrB,IAAI,CAAC,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;YACjD,oBAAoB;YACpB,OAAO,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC9C,CAAC,CAAC,CAAA;IACJ,CAAC;IAMD,KAAK,CAAC,IAAI;QACR,kEAAkE;QAClE,iEAAiE;QACjE,uEAAuE;QACvE,sCAAsC;QACtC,OAAO;YACL,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;gBACvD,GAAG,IAAI,CAAC,IAAI;gBACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;oBACzC,CAAC,CAAC,QAAQ;gBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC,IAAI,EAAE,CAAC;SACX,CAAA;IACH,CAAC;IAMD,QAAQ;QACN,OAAO;YACL,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;gBAChD,GAAG,IAAI,CAAC,IAAI;gBACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;oBACzC,CAAC,CAAC,QAAQ;gBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC,QAAQ,EAAE;SACd,CAAA;IACH,CAAC;IAMD,MAAM;QACJ,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpD,GAAG,IAAI,CAAC,IAAI;YACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;gBACzC,CAAC,CAAC,QAAQ;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,MAAM,EAAE,CAAA;IACb,CAAC;IAMD,UAAU;QACR,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpD,GAAG,IAAI,CAAC,IAAI;YACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;gBACzC,CAAC,CAAC,QAAQ;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,UAAU,EAAE,CAAA;IACjB,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IACD,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,WAAW,EAAE,CAAA;IAC3B,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAA;IAC9C,CAAC;IACD,CAAC,MAAM,CAAC,aAAa,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;IACvB,CAAC;CACF","sourcesContent":["import { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport {\n  FSOption,\n  Path,\n  PathScurry,\n  PathScurryDarwin,\n  PathScurryPosix,\n  PathScurryWin32,\n} from 'path-scurry'\nimport { fileURLToPath } from 'url'\nimport { IgnoreLike } from './ignore.js'\nimport { Pattern } from './pattern.js'\nimport { GlobStream, GlobWalker } from './walker.js'\n\nexport type MatchSet = Minimatch['set']\nexport type GlobParts = Exclude<Minimatch['globParts'], undefined>\n\n// if no process global, just call it linux.\n// so we default to case-sensitive, / separators\nconst defaultPlatform: NodeJS.Platform =\n  typeof process === 'object' &&\n  process &&\n  typeof process.platform === 'string'\n    ? process.platform\n    : 'linux'\n\n/**\n * A `GlobOptions` object may be provided to any of the exported methods, and\n * must be provided to the `Glob` constructor.\n *\n * All options are optional, boolean, and false by default, unless otherwise\n * noted.\n *\n * All resolved options are added to the Glob object as properties.\n *\n * If you are running many `glob` operations, you can pass a Glob object as the\n * `options` argument to a subsequent operation to share the previously loaded\n * cache.\n */\nexport interface GlobOptions {\n  /**\n   * Set to `true` to always receive absolute paths for\n   * matched files. Set to `false` to always return relative paths.\n   *\n   * When this option is not set, absolute paths are returned for patterns\n   * that are absolute, and otherwise paths are returned that are relative\n   * to the `cwd` setting.\n   *\n   * This does _not_ make an extra system call to get\n   * the realpath, it only does string path resolution.\n   *\n   * Conflicts with {@link withFileTypes}\n   */\n  absolute?: boolean\n\n  /**\n   * Set to false to enable {@link windowsPathsNoEscape}\n   *\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n\n  /**\n   * The current working directory in which to search. Defaults to\n   * `process.cwd()`.\n   *\n   * May be eiher a string path or a `file://` URL object or string.\n   */\n  cwd?: string | URL\n\n  /**\n   * Include `.dot` files in normal matches and `globstar`\n   * matches. Note that an explicit dot in a portion of the pattern\n   * will always match dot files.\n   */\n  dot?: boolean\n\n  /**\n   * Prepend all relative path strings with `./` (or `.\\` on Windows).\n   *\n   * Without this option, returned relative paths are \"bare\", so instead of\n   * returning `'./foo/bar'`, they are returned as `'foo/bar'`.\n   *\n   * Relative patterns starting with `'../'` are not prepended with `./`, even\n   * if this option is set.\n   */\n  dotRelative?: boolean\n\n  /**\n   * Follow symlinked directories when expanding `**`\n   * patterns. This can result in a lot of duplicate references in\n   * the presence of cyclic links, and make performance quite bad.\n   *\n   * By default, a `**` in a pattern will follow 1 symbolic link if\n   * it is not the first item in the pattern, or none if it is the\n   * first item in the pattern, following the same behavior as Bash.\n   */\n  follow?: boolean\n\n  /**\n   * string or string[], or an object with `ignore` and `ignoreChildren`\n   * methods.\n   *\n   * If a string or string[] is provided, then this is treated as a glob\n   * pattern or array of glob patterns to exclude from matches. To ignore all\n   * children within a directory, as well as the entry itself, append `'/**'`\n   * to the ignore pattern.\n   *\n   * **Note** `ignore` patterns are _always_ in `dot:true` mode, regardless of\n   * any other settings.\n   *\n   * If an object is provided that has `ignored(path)` and/or\n   * `childrenIgnored(path)` methods, then these methods will be called to\n   * determine whether any Path is a match or if its children should be\n   * traversed, respectively.\n   */\n  ignore?: string | string[] | IgnoreLike\n\n  /**\n   * Treat brace expansion like `{a,b}` as a \"magic\" pattern. Has no\n   * effect if {@link nobrace} is set.\n   *\n   * Only has effect on the {@link hasMagic} function.\n   */\n  magicalBraces?: boolean\n\n  /**\n   * Add a `/` character to directory matches. Note that this requires\n   * additional stat calls in some cases.\n   */\n  mark?: boolean\n\n  /**\n   * Perform a basename-only match if the pattern does not contain any slash\n   * characters. That is, `*.js` would be treated as equivalent to\n   * `**\\/*.js`, matching all js files in all directories.\n   */\n  matchBase?: boolean\n\n  /**\n   * Limit the directory traversal to a given depth below the cwd.\n   * Note that this does NOT prevent traversal to sibling folders,\n   * root patterns, and so on. It only limits the maximum folder depth\n   * that the walk will descend, relative to the cwd.\n   */\n  maxDepth?: number\n\n  /**\n   * Do not expand `{a,b}` and `{1..3}` brace sets.\n   */\n  nobrace?: boolean\n\n  /**\n   * Perform a case-insensitive match. This defaults to `true` on macOS and\n   * Windows systems, and `false` on all others.\n   *\n   * **Note** `nocase` should only be explicitly set when it is\n   * known that the filesystem's case sensitivity differs from the\n   * platform default. If set `true` on case-sensitive file\n   * systems, or `false` on case-insensitive file systems, then the\n   * walk may return more or less results than expected.\n   */\n  nocase?: boolean\n\n  /**\n   * Do not match directories, only files. (Note: to match\n   * _only_ directories, put a `/` at the end of the pattern.)\n   */\n  nodir?: boolean\n\n  /**\n   * Do not match \"extglob\" patterns such as `+(a|b)`.\n   */\n  noext?: boolean\n\n  /**\n   * Do not match `**` against multiple filenames. (Ie, treat it as a normal\n   * `*` instead.)\n   *\n   * Conflicts with {@link matchBase}\n   */\n  noglobstar?: boolean\n\n  /**\n   * Defaults to value of `process.platform` if available, or `'linux'` if\n   * not. Setting `platform:'win32'` on non-Windows systems may cause strange\n   * behavior.\n   */\n  platform?: NodeJS.Platform\n\n  /**\n   * Set to true to call `fs.realpath` on all of the\n   * results. In the case of an entry that cannot be resolved, the\n   * entry is omitted. This incurs a slight performance penalty, of\n   * course, because of the added system calls.\n   */\n  realpath?: boolean\n\n  /**\n   *\n   * A string path resolved against the `cwd` option, which\n   * is used as the starting point for absolute patterns that start\n   * with `/`, (but not drive letters or UNC paths on Windows).\n   *\n   * Note that this _doesn't_ necessarily limit the walk to the\n   * `root` directory, and doesn't affect the cwd starting point for\n   * non-absolute patterns. A pattern containing `..` will still be\n   * able to traverse out of the root directory, if it is not an\n   * actual root directory on the filesystem, and any non-absolute\n   * patterns will be matched in the `cwd`. For example, the\n   * pattern `/../*` with `{root:'/some/path'}` will return all\n   * files in `/some`, not all files in `/some/path`. The pattern\n   * `*` with `{root:'/some/path'}` will return all the entries in\n   * the cwd, not the entries in `/some/path`.\n   *\n   * To start absolute and non-absolute patterns in the same\n   * path, you can use `{root:''}`. However, be aware that on\n   * Windows systems, a pattern like `x:/*` or `//host/share/*` will\n   * _always_ start in the `x:/` or `//host/share` directory,\n   * regardless of the `root` setting.\n   */\n  root?: string\n\n  /**\n   * A [PathScurry](http://npm.im/path-scurry) object used\n   * to traverse the file system. If the `nocase` option is set\n   * explicitly, then any provided `scurry` object must match this\n   * setting.\n   */\n  scurry?: PathScurry\n\n  /**\n   * Call `lstat()` on all entries, whether required or not to determine\n   * if it's a valid match. When used with {@link withFileTypes}, this means\n   * that matches will include data such as modified time, permissions, and\n   * so on.  Note that this will incur a performance cost due to the added\n   * system calls.\n   */\n  stat?: boolean\n\n  /**\n   * An AbortSignal which will cancel the Glob walk when\n   * triggered.\n   */\n  signal?: AbortSignal\n\n  /**\n   * Use `\\\\` as a path separator _only_, and\n   *  _never_ as an escape character. If set, all `\\\\` characters are\n   *  replaced with `/` in the pattern.\n   *\n   *  Note that this makes it **impossible** to match against paths\n   *  containing literal glob pattern characters, but allows matching\n   *  with patterns constructed using `path.join()` and\n   *  `path.resolve()` on Windows platforms, mimicking the (buggy!)\n   *  behavior of Glob v7 and before on Windows. Please use with\n   *  caution, and be mindful of [the caveat below about Windows\n   *  paths](#windows). (For legacy reasons, this is also set if\n   *  `allowWindowsEscape` is set to the exact value `false`.)\n   */\n  windowsPathsNoEscape?: boolean\n\n  /**\n   * Return [PathScurry](http://npm.im/path-scurry)\n   * `Path` objects instead of strings. These are similar to a\n   * NodeJS `Dirent` object, but with additional methods and\n   * properties.\n   *\n   * Conflicts with {@link absolute}\n   */\n  withFileTypes?: boolean\n\n  /**\n   * An fs implementation to override some or all of the defaults.  See\n   * http://npm.im/path-scurry for details about what can be overridden.\n   */\n  fs?: FSOption\n\n  /**\n   * Just passed along to Minimatch.  Note that this makes all pattern\n   * matching operations slower and *extremely* noisy.\n   */\n  debug?: boolean\n\n  /**\n   * Return `/` delimited paths, even on Windows.\n   *\n   * On posix systems, this has no effect.  But, on Windows, it means that\n   * paths will be `/` delimited, and absolute paths will be their full\n   * resolved UNC forms, eg instead of `'C:\\\\foo\\\\bar'`, it would return\n   * `'//?/C:/foo/bar'`\n   */\n  posix?: boolean\n}\n\nexport type GlobOptionsWithFileTypesTrue = GlobOptions & {\n  withFileTypes: true\n  // string options not relevant if returning Path objects.\n  absolute?: undefined\n  mark?: undefined\n  posix?: undefined\n}\n\nexport type GlobOptionsWithFileTypesFalse = GlobOptions & {\n  withFileTypes?: false\n}\n\nexport type GlobOptionsWithFileTypesUnset = GlobOptions & {\n  withFileTypes?: undefined\n}\n\nexport type Result<Opts> = Opts extends GlobOptionsWithFileTypesTrue\n  ? Path\n  : Opts extends GlobOptionsWithFileTypesFalse\n  ? string\n  : Opts extends GlobOptionsWithFileTypesUnset\n  ? string\n  : string | Path\nexport type Results<Opts> = Result<Opts>[]\n\nexport type FileTypes<Opts> = Opts extends GlobOptionsWithFileTypesTrue\n  ? true\n  : Opts extends GlobOptionsWithFileTypesFalse\n  ? false\n  : Opts extends GlobOptionsWithFileTypesUnset\n  ? false\n  : boolean\n\n/**\n * An object that can perform glob pattern traversals.\n */\nexport class Glob<Opts extends GlobOptions> implements GlobOptions {\n  absolute?: boolean\n  cwd: string\n  root?: string\n  dot: boolean\n  dotRelative: boolean\n  follow: boolean\n  ignore?: string | string[] | IgnoreLike\n  magicalBraces: boolean\n  mark?: boolean\n  matchBase: boolean\n  maxDepth: number\n  nobrace: boolean\n  nocase: boolean\n  nodir: boolean\n  noext: boolean\n  noglobstar: boolean\n  pattern: string[]\n  platform: NodeJS.Platform\n  realpath: boolean\n  scurry: PathScurry\n  stat: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape: boolean\n  withFileTypes: FileTypes<Opts>\n\n  /**\n   * The options provided to the constructor.\n   */\n  opts: Opts\n\n  /**\n   * An array of parsed immutable {@link Pattern} objects.\n   */\n  patterns: Pattern[]\n\n  /**\n   * All options are stored as properties on the `Glob` object.\n   *\n   * See {@link GlobOptions} for full options descriptions.\n   *\n   * Note that a previous `Glob` object can be passed as the\n   * `GlobOptions` to another `Glob` instantiation to re-use settings\n   * and caches with a new pattern.\n   *\n   * Traversal functions can be called multiple times to run the walk\n   * again.\n   */\n  constructor(pattern: string | string[], opts: Opts) {\n    /* c8 ignore start */\n    if (!opts) throw new TypeError('glob options required')\n    /* c8 ignore stop */\n    this.withFileTypes = !!opts.withFileTypes as FileTypes<Opts>\n    this.signal = opts.signal\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.dotRelative = !!opts.dotRelative\n    this.nodir = !!opts.nodir\n    this.mark = !!opts.mark\n    if (!opts.cwd) {\n      this.cwd = ''\n    } else if (opts.cwd instanceof URL || opts.cwd.startsWith('file://')) {\n      opts.cwd = fileURLToPath(opts.cwd)\n    }\n    this.cwd = opts.cwd || ''\n    this.root = opts.root\n    this.magicalBraces = !!opts.magicalBraces\n    this.nobrace = !!opts.nobrace\n    this.noext = !!opts.noext\n    this.realpath = !!opts.realpath\n    this.absolute = opts.absolute\n\n    this.noglobstar = !!opts.noglobstar\n    this.matchBase = !!opts.matchBase\n    this.maxDepth =\n      typeof opts.maxDepth === 'number' ? opts.maxDepth : Infinity\n    this.stat = !!opts.stat\n    this.ignore = opts.ignore\n\n    if (this.withFileTypes && this.absolute !== undefined) {\n      throw new Error('cannot set absolute and withFileTypes:true')\n    }\n\n    if (typeof pattern === 'string') {\n      pattern = [pattern]\n    }\n\n    this.windowsPathsNoEscape =\n      !!opts.windowsPathsNoEscape ||\n      (opts as GlobOptions).allowWindowsEscape === false\n\n    if (this.windowsPathsNoEscape) {\n      pattern = pattern.map(p => p.replace(/\\\\/g, '/'))\n    }\n\n    if (this.matchBase) {\n      if (opts.noglobstar) {\n        throw new TypeError('base matching requires globstar')\n      }\n      pattern = pattern.map(p => (p.includes('/') ? p : `./**/${p}`))\n    }\n\n    this.pattern = pattern\n\n    this.platform = opts.platform || defaultPlatform\n    this.opts = { ...opts, platform: this.platform }\n    if (opts.scurry) {\n      this.scurry = opts.scurry\n      if (\n        opts.nocase !== undefined &&\n        opts.nocase !== opts.scurry.nocase\n      ) {\n        throw new Error('nocase option contradicts provided scurry option')\n      }\n    } else {\n      const Scurry =\n        opts.platform === 'win32'\n          ? PathScurryWin32\n          : opts.platform === 'darwin'\n          ? PathScurryDarwin\n          : opts.platform\n          ? PathScurryPosix\n          : PathScurry\n      this.scurry = new Scurry(this.cwd, {\n        nocase: opts.nocase,\n        fs: opts.fs,\n      })\n    }\n    this.nocase = this.scurry.nocase\n\n    // If you do nocase:true on a case-sensitive file system, then\n    // we need to use regexps instead of strings for non-magic\n    // path portions, because statting `aBc` won't return results\n    // for the file `AbC` for example.\n    const nocaseMagicOnly =\n      this.platform === 'darwin' || this.platform === 'win32'\n\n    const mmo: MinimatchOptions = {\n      // default nocase based on platform\n      ...opts,\n      dot: this.dot,\n      matchBase: this.matchBase,\n      nobrace: this.nobrace,\n      nocase: this.nocase,\n      nocaseMagicOnly,\n      nocomment: true,\n      noext: this.noext,\n      nonegate: true,\n      optimizationLevel: 2,\n      platform: this.platform,\n      windowsPathsNoEscape: this.windowsPathsNoEscape,\n      debug: !!this.opts.debug,\n    }\n\n    const mms = this.pattern.map(p => new Minimatch(p, mmo))\n    const [matchSet, globParts] = mms.reduce(\n      (set: [MatchSet, GlobParts], m) => {\n        set[0].push(...m.set)\n        set[1].push(...m.globParts)\n        return set\n      },\n      [[], []]\n    )\n    this.patterns = matchSet.map((set, i) => {\n      const g = globParts[i]\n      /* c8 ignore start */\n      if (!g) throw new Error('invalid pattern object')\n      /* c8 ignore stop */\n      return new Pattern(set, g, 0, this.platform)\n    })\n  }\n\n  /**\n   * Returns a Promise that resolves to the results array.\n   */\n  async walk(): Promise<Results<Opts>>\n  async walk(): Promise<(string | Path)[]> {\n    // Walkers always return array of Path objects, so we just have to\n    // coerce them into the right shape.  It will have already called\n    // realpath() if the option was set to do so, so we know that's cached.\n    // start out knowing the cwd, at least\n    return [\n      ...(await new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity\n            ? this.maxDepth + this.scurry.cwd.depth()\n            : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n      }).walk()),\n    ]\n  }\n\n  /**\n   * synchronous {@link Glob.walk}\n   */\n  walkSync(): Results<Opts>\n  walkSync(): (string | Path)[] {\n    return [\n      ...new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity\n            ? this.maxDepth + this.scurry.cwd.depth()\n            : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n      }).walkSync(),\n    ]\n  }\n\n  /**\n   * Stream results asynchronously.\n   */\n  stream(): Minipass<Result<Opts>, Result<Opts>>\n  stream(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity\n          ? this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n    }).stream()\n  }\n\n  /**\n   * Stream results synchronously.\n   */\n  streamSync(): Minipass<Result<Opts>, Result<Opts>>\n  streamSync(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity\n          ? this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n    }).streamSync()\n  }\n\n  /**\n   * Default sync iteration function. Returns a Generator that\n   * iterates over the results.\n   */\n  iterateSync(): Generator<Result<Opts>, void, void> {\n    return this.streamSync()[Symbol.iterator]()\n  }\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  /**\n   * Default async iteration function. Returns an AsyncGenerator that\n   * iterates over the results.\n   */\n  iterate(): AsyncGenerator<Result<Opts>, void, void> {\n    return this.stream()[Symbol.asyncIterator]()\n  }\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/has-magic.d.ts b/deps/npm/node_modules/glob/dist/esm/has-magic.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/has-magic.d.ts
rename to deps/npm/node_modules/glob/dist/esm/has-magic.d.ts
diff --git a/deps/npm/node_modules/glob/dist/esm/has-magic.d.ts.map b/deps/npm/node_modules/glob/dist/esm/has-magic.d.ts.map
new file mode 100644
index 00000000000000..b24dd4ec47e0bb
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/has-magic.d.ts.map
@@ -0,0 +1 @@
+{"version":3,"file":"has-magic.d.ts","sourceRoot":"","sources":["../../src/has-magic.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAA;AAEvC;;;;;;;;;;GAUG;AACH,eAAO,MAAM,QAAQ,YACV,MAAM,GAAG,MAAM,EAAE,YACjB,WAAW,KACnB,OAQF,CAAA"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/has-magic.js b/deps/npm/node_modules/glob/dist/esm/has-magic.js
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/has-magic.js
rename to deps/npm/node_modules/glob/dist/esm/has-magic.js
diff --git a/deps/npm/node_modules/glob/dist/mjs/has-magic.js.map b/deps/npm/node_modules/glob/dist/esm/has-magic.js.map
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/has-magic.js.map
rename to deps/npm/node_modules/glob/dist/esm/has-magic.js.map
diff --git a/deps/npm/node_modules/glob/dist/mjs/ignore.d.ts b/deps/npm/node_modules/glob/dist/esm/ignore.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/ignore.d.ts
rename to deps/npm/node_modules/glob/dist/esm/ignore.d.ts
diff --git a/deps/npm/node_modules/glob/dist/esm/ignore.d.ts.map b/deps/npm/node_modules/glob/dist/esm/ignore.d.ts.map
new file mode 100644
index 00000000000000..be7831769d33ed
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/ignore.d.ts.map
@@ -0,0 +1 @@
+{"version":3,"file":"ignore.d.ts","sourceRoot":"","sources":["../../src/ignore.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAElC,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAE5C,MAAM,WAAW,UAAU;IACzB,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAA;IAC9B,eAAe,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,KAAK,OAAO,CAAA;CACvC;AASD;;GAEG;AACH,qBAAa,MAAO,YAAW,UAAU;IACvC,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,gBAAgB,EAAE,SAAS,EAAE,CAAA;IAC7B,QAAQ,EAAE,SAAS,EAAE,CAAA;IACrB,gBAAgB,EAAE,SAAS,EAAE,CAAA;gBAG3B,OAAO,EAAE,MAAM,EAAE,EACjB,EACE,OAAO,EACP,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAA0B,GAC3B,EAAE,cAAc;IAsDnB,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO;IAczB,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,OAAO;CAWlC"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/ignore.js b/deps/npm/node_modules/glob/dist/esm/ignore.js
similarity index 93%
rename from deps/npm/node_modules/glob/dist/mjs/ignore.js
rename to deps/npm/node_modules/glob/dist/esm/ignore.js
index 2dbaa16a11460e..e8cbaf96b3a809 100644
--- a/deps/npm/node_modules/glob/dist/mjs/ignore.js
+++ b/deps/npm/node_modules/glob/dist/esm/ignore.js
@@ -50,6 +50,11 @@ export class Ignore {
             for (let i = 0; i < mm.set.length; i++) {
                 const parsed = mm.set[i];
                 const globParts = mm.globParts[i];
+                /* c8 ignore start */
+                if (!parsed || !globParts) {
+                    throw new Error('invalid pattern object');
+                }
+                /* c8 ignore stop */
                 const p = new Pattern(parsed, globParts, 0, platform);
                 const m = new Minimatch(p.globString(), mmopts);
                 const children = globParts[globParts.length - 1] === '**';
@@ -91,7 +96,7 @@ export class Ignore {
         }
         for (const m of this.absoluteChildren) {
             if (m.match(fullpath))
-                true;
+                return true;
         }
         return false;
     }
diff --git a/deps/npm/node_modules/glob/dist/esm/ignore.js.map b/deps/npm/node_modules/glob/dist/esm/ignore.js.map
new file mode 100644
index 00000000000000..736e4466180177
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/ignore.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"ignore.js","sourceRoot":"","sources":["../../src/ignore.ts"],"names":[],"mappings":"AAAA,sDAAsD;AACtD,kCAAkC;AAClC,kEAAkE;AAClE,6CAA6C;AAE7C,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AAErC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAQtC,MAAM,eAAe,GACnB,OAAO,OAAO,KAAK,QAAQ;IAC3B,OAAO;IACP,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;IAClC,CAAC,CAAC,OAAO,CAAC,QAAQ;IAClB,CAAC,CAAC,OAAO,CAAA;AAEb;;GAEG;AACH,MAAM,OAAO,MAAM;IACjB,QAAQ,CAAa;IACrB,gBAAgB,CAAa;IAC7B,QAAQ,CAAa;IACrB,gBAAgB,CAAa;IAE7B,YACE,OAAiB,EACjB,EACE,OAAO,EACP,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAAQ,GAAG,eAAe,GACX;QAEjB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;QAC1B,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;QAC1B,MAAM,MAAM,GAAG;YACb,GAAG,EAAE,IAAI;YACT,OAAO;YACP,MAAM;YACN,KAAK;YACL,UAAU;YACV,iBAAiB,EAAE,CAAC;YACpB,QAAQ;YACR,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,IAAI;SACf,CAAA;QAED,mEAAmE;QACnE,gEAAgE;QAChE,mEAAmE;QACnE,uCAAuC;QACvC,mEAAmE;QACnE,qEAAqE;QACrE,uBAAuB;QACvB,uEAAuE;QACvE,oEAAoE;QACpE,qBAAqB;QACrB,sEAAsE;QACtE,wCAAwC;QACxC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;YACzB,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACxB,MAAM,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;gBACjC,qBAAqB;gBACrB,IAAI,CAAC,MAAM,IAAI,CAAC,SAAS,EAAE;oBACzB,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAA;iBAC1C;gBACD,oBAAoB;gBACpB,MAAM,CAAC,GAAG,IAAI,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;gBACrD,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,MAAM,CAAC,CAAA;gBAC/C,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAA;gBACzD,MAAM,QAAQ,GAAG,CAAC,CAAC,UAAU,EAAE,CAAA;gBAC/B,IAAI,QAAQ;oBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;oBAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBAC1B,IAAI,QAAQ,EAAE;oBACZ,IAAI,QAAQ;wBAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;wBACtC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;iBACnC;aACF;SACF;IACH,CAAC;IAED,OAAO,CAAC,CAAO;QACb,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAA;QAC7B,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,CAAA;QAChC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAA;QACpC,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,CAAA;QAChC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;SACzD;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;SACzD;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,eAAe,CAAC,CAAO;QACrB,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAA;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,GAAG,GAAG,CAAA;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACrC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;gBAAE,OAAO,IAAI,CAAA;SACnC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACrC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;gBAAE,OAAO,IAAI,CAAA;SACnC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;CACF","sourcesContent":["// give it a pattern, and it'll be able to tell you if\n// a given path should be ignored.\n// Ignoring a path ignores its children if the pattern ends in /**\n// Ignores are always parsed in dot:true mode\n\nimport { Minimatch } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\nexport interface IgnoreLike {\n  ignored?: (p: Path) => boolean\n  childrenIgnored?: (p: Path) => boolean\n}\n\nconst defaultPlatform: NodeJS.Platform =\n  typeof process === 'object' &&\n  process &&\n  typeof process.platform === 'string'\n    ? process.platform\n    : 'linux'\n\n/**\n * Class used to process ignored patterns\n */\nexport class Ignore implements IgnoreLike {\n  relative: Minimatch[]\n  relativeChildren: Minimatch[]\n  absolute: Minimatch[]\n  absoluteChildren: Minimatch[]\n\n  constructor(\n    ignored: string[],\n    {\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      platform = defaultPlatform,\n    }: GlobWalkerOpts\n  ) {\n    this.relative = []\n    this.absolute = []\n    this.relativeChildren = []\n    this.absoluteChildren = []\n    const mmopts = {\n      dot: true,\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      optimizationLevel: 2,\n      platform,\n      nocomment: true,\n      nonegate: true,\n    }\n\n    // this is a little weird, but it gives us a clean set of optimized\n    // minimatch matchers, without getting tripped up if one of them\n    // ends in /** inside a brace section, and it's only inefficient at\n    // the start of the walk, not along it.\n    // It'd be nice if the Pattern class just had a .test() method, but\n    // handling globstars is a bit of a pita, and that code already lives\n    // in minimatch anyway.\n    // Another way would be if maybe Minimatch could take its set/globParts\n    // as an option, and then we could at least just use Pattern to test\n    // for absolute-ness.\n    // Yet another way, Minimatch could take an array of glob strings, and\n    // a cwd option, and do the right thing.\n    for (const ign of ignored) {\n      const mm = new Minimatch(ign, mmopts)\n      for (let i = 0; i < mm.set.length; i++) {\n        const parsed = mm.set[i]\n        const globParts = mm.globParts[i]\n        /* c8 ignore start */\n        if (!parsed || !globParts) {\n          throw new Error('invalid pattern object')\n        }\n        /* c8 ignore stop */\n        const p = new Pattern(parsed, globParts, 0, platform)\n        const m = new Minimatch(p.globString(), mmopts)\n        const children = globParts[globParts.length - 1] === '**'\n        const absolute = p.isAbsolute()\n        if (absolute) this.absolute.push(m)\n        else this.relative.push(m)\n        if (children) {\n          if (absolute) this.absoluteChildren.push(m)\n          else this.relativeChildren.push(m)\n        }\n      }\n    }\n  }\n\n  ignored(p: Path): boolean {\n    const fullpath = p.fullpath()\n    const fullpaths = `${fullpath}/`\n    const relative = p.relative() || '.'\n    const relatives = `${relative}/`\n    for (const m of this.relative) {\n      if (m.match(relative) || m.match(relatives)) return true\n    }\n    for (const m of this.absolute) {\n      if (m.match(fullpath) || m.match(fullpaths)) return true\n    }\n    return false\n  }\n\n  childrenIgnored(p: Path): boolean {\n    const fullpath = p.fullpath() + '/'\n    const relative = (p.relative() || '.') + '/'\n    for (const m of this.relativeChildren) {\n      if (m.match(relative)) return true\n    }\n    for (const m of this.absoluteChildren) {\n      if (m.match(fullpath)) return true\n    }\n    return false\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/cjs/src/index.d.ts b/deps/npm/node_modules/glob/dist/esm/index.d.ts
similarity index 97%
rename from deps/npm/node_modules/glob/dist/cjs/src/index.d.ts
rename to deps/npm/node_modules/glob/dist/esm/index.d.ts
index 669bf12e6d5916..048e584715b772 100644
--- a/deps/npm/node_modules/glob/dist/cjs/src/index.d.ts
+++ b/deps/npm/node_modules/glob/dist/esm/index.d.ts
@@ -68,6 +68,7 @@ export type { GlobOptions, GlobOptionsWithFileTypesFalse, GlobOptionsWithFileTyp
 export { hasMagic } from './has-magic.js';
 export type { IgnoreLike } from './ignore.js';
 export type { MatchStream } from './walker.js';
+export type { Path, WalkOptionsWithFileTypesTrue, WalkOptionsWithFileTypesUnset, WalkOptions, FSOption, } from 'path-scurry';
 export declare const glob: typeof glob_ & {
     glob: typeof glob_;
     globSync: typeof globSync;
diff --git a/deps/npm/node_modules/glob/dist/esm/index.d.ts.map b/deps/npm/node_modules/glob/dist/esm/index.d.ts.map
new file mode 100644
index 00000000000000..3e263fb5e2dbed
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/index.d.ts.map
@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,KAAK,EACV,WAAW,EACX,6BAA6B,EAC7B,4BAA4B,EAC5B,6BAA6B,EAC9B,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAGhC;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACvB,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAQlD;;;GAGG;AACH,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACvB,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAC3B,wBAAgB,UAAU,CACxB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAQlD;;GAEG;AACH,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,MAAM,EAAE,CAAA;AACX,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,IAAI,EAAE,CAAA;AACT,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,MAAM,EAAE,CAAA;AACX,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,IAAI,EAAE,GAAG,MAAM,EAAE,CAAA;AAQpB;;;;;GAKG;AACH,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACpB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAA;AAClB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAA;AACpB,iBAAe,KAAK,CAClB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,OAAO,CAAC,IAAI,EAAE,GAAG,MAAM,EAAE,CAAC,CAAA;AAQ7B;;GAEG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAChC,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAC9B,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAChC,wBAAgB,eAAe,CAC7B,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AAQ9D;;GAEG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,CAAC,EAAE,6BAA6B,GAAG,SAAS,GAClD,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACrC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,4BAA4B,GACpC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACnC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,6BAA6B,GACrC,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AACrC,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,GAAG,MAAM,EAAE,EAC1B,OAAO,EAAE,WAAW,GACnB,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;AASxE,eAAO,MAAM,UAAU,uBAAiB,CAAA;AACxC,eAAO,MAAM,MAAM;;CAAsD,CAAA;AACzE,eAAO,MAAM,WAAW,wBAAkB,CAAA;AAC1C,eAAO,MAAM,OAAO;;CAElB,CAAA;AACF,eAAO,MAAM,IAAI;;;CAGf,CAAA;AAGF,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,YAAY,EACV,WAAW,EACX,6BAA6B,EAC7B,4BAA4B,EAC5B,6BAA6B,GAC9B,MAAM,WAAW,CAAA;AAClB,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,YAAY,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAA;AAC9C,YAAY,EACV,IAAI,EACJ,4BAA4B,EAC5B,6BAA6B,EAC7B,WAAW,EACX,QAAQ,GACT,MAAM,aAAa,CAAA;AAIpB,eAAO,MAAM,IAAI;;;;;;;;;;;;;;;;;;;;;;;CAgBf,CAAA"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/index.js b/deps/npm/node_modules/glob/dist/esm/index.js
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/index.js
rename to deps/npm/node_modules/glob/dist/esm/index.js
diff --git a/deps/npm/node_modules/glob/dist/mjs/index.js.map b/deps/npm/node_modules/glob/dist/esm/index.js.map
similarity index 93%
rename from deps/npm/node_modules/glob/dist/mjs/index.js.map
rename to deps/npm/node_modules/glob/dist/esm/index.js.map
index 2d4fc077271b15..d857e6b0f2d2ab 100644
--- a/deps/npm/node_modules/glob/dist/mjs/index.js.map
+++ b/deps/npm/node_modules/glob/dist/esm/index.js.map
@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAS5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAuBzC,MAAM,UAAU,cAAc,CAC5B,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,UAAU,EAAE,CAAA;AAChD,CAAC;AAsBD,MAAM,UAAU,UAAU,CACxB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,MAAM,EAAE,CAAA;AAC5C,CAAC;AAqBD,MAAM,UAAU,QAAQ,CACtB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAA;AAC9C,CAAC;AAwBD,KAAK,UAAU,KAAK,CAClB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAA;AAC1C,CAAC;AAqBD,MAAM,UAAU,eAAe,CAC7B,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;AACjD,CAAC;AAqBD,MAAM,UAAU,WAAW,CACzB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAA;AAC7C,CAAC;AAED,iEAAiE;AACjE,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,CAAA;AACxC,MAAM,CAAC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAA;AACzE,MAAM,CAAC,MAAM,WAAW,GAAG,eAAe,CAAA;AAC1C,MAAM,CAAC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE;IAChD,IAAI,EAAE,eAAe;CACtB,CAAC,CAAA;AACF,MAAM,CAAC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE;IAC1C,MAAM,EAAE,cAAc;IACtB,OAAO,EAAE,eAAe;CACzB,CAAC,CAAA;AAEF,qBAAqB;AACrB,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAOhC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAGzC,oBAAoB;AAEpB,MAAM,CAAC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE;IACvC,IAAI,EAAE,KAAK;IACX,QAAQ;IACR,IAAI;IACJ,UAAU;IACV,MAAM;IACN,cAAc;IACd,UAAU;IACV,WAAW;IACX,OAAO;IACP,eAAe;IACf,WAAW;IACX,IAAI;IACJ,QAAQ;IACR,MAAM;IACN,QAAQ;CACT,CAAC,CAAA;AACF,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA","sourcesContent":["import { escape, unescape } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nimport { Glob } from './glob.js'\nimport { hasMagic } from './has-magic.js'\n\n/**\n * Syncronous form of {@link globStream}. Will read all the matches as fast as\n * you consume them, even all in a single tick if you consume them immediately,\n * but will still respond to backpressure if they're not consumed immediately.\n */\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Minipass<Path, Path>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesUnset\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).streamSync()\n}\n\n/**\n * Return a stream that emits all the strings or `Path` objects and\n * then emits `end` when completed.\n */\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Minipass<Path, Path>\nexport function globStream(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).stream()\n}\n\n/**\n * Synchronous form of {@link glob}\n */\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Path[]\nexport function globSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Path[] | string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).walkSync()\n}\n\n/**\n * Perform an asynchronous glob search for the pattern(s) specified. Returns\n * [Path](https://isaacs.github.io/path-scurry/classes/PathBase) objects if the\n * {@link withFileTypes} option is set to `true`. See {@link GlobOptions} for\n * full option descriptions.\n */\nasync function glob_(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Promise<Path[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions\n): Promise<Path[] | string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).walk()\n}\n\n/**\n * Return a sync iterator for walking glob pattern matches.\n */\nexport function globIterateSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Generator<Path, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Generator<Path, void, void> | Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).iterateSync()\n}\n\n/**\n * Return an async iterator for walking glob pattern matches.\n */\nexport function globIterate(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): AsyncGenerator<Path, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions\n): AsyncGenerator<Path, void, void> | AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).iterate()\n}\n\n// aliases: glob.sync.stream() glob.stream.sync() glob.sync() etc\nexport const streamSync = globStreamSync\nexport const stream = Object.assign(globStream, { sync: globStreamSync })\nexport const iterateSync = globIterateSync\nexport const iterate = Object.assign(globIterate, {\n  sync: globIterateSync,\n})\nexport const sync = Object.assign(globSync, {\n  stream: globStreamSync,\n  iterate: globIterateSync,\n})\n\n/* c8 ignore start */\nexport { escape, unescape } from 'minimatch'\nexport { Glob } from './glob.js'\nexport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nexport { hasMagic } from './has-magic.js'\nexport type { IgnoreLike } from './ignore.js'\nexport type { MatchStream } from './walker.js'\n/* c8 ignore stop */\n\nexport const glob = Object.assign(glob_, {\n  glob: glob_,\n  globSync,\n  sync,\n  globStream,\n  stream,\n  globStreamSync,\n  streamSync,\n  globIterate,\n  iterate,\n  globIterateSync,\n  iterateSync,\n  Glob,\n  hasMagic,\n  escape,\n  unescape,\n})\nglob.glob = glob\n"]}
\ No newline at end of file
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAS5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAuBzC,MAAM,UAAU,cAAc,CAC5B,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,UAAU,EAAE,CAAA;AAChD,CAAC;AAsBD,MAAM,UAAU,UAAU,CACxB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,MAAM,EAAE,CAAA;AAC5C,CAAC;AAqBD,MAAM,UAAU,QAAQ,CACtB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,QAAQ,EAAE,CAAA;AAC9C,CAAC;AAwBD,KAAK,UAAU,KAAK,CAClB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,IAAI,EAAE,CAAA;AAC1C,CAAC;AAqBD,MAAM,UAAU,eAAe,CAC7B,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,WAAW,EAAE,CAAA;AACjD,CAAC;AAqBD,MAAM,UAAU,WAAW,CACzB,OAA0B,EAC1B,UAAuB,EAAE;IAEzB,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,OAAO,EAAE,CAAA;AAC7C,CAAC;AAED,iEAAiE;AACjE,MAAM,CAAC,MAAM,UAAU,GAAG,cAAc,CAAA;AACxC,MAAM,CAAC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC,CAAA;AACzE,MAAM,CAAC,MAAM,WAAW,GAAG,eAAe,CAAA;AAC1C,MAAM,CAAC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE;IAChD,IAAI,EAAE,eAAe;CACtB,CAAC,CAAA;AACF,MAAM,CAAC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE;IAC1C,MAAM,EAAE,cAAc;IACtB,OAAO,EAAE,eAAe;CACzB,CAAC,CAAA;AAEF,qBAAqB;AACrB,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC5C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAOhC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAWzC,oBAAoB;AAEpB,MAAM,CAAC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE;IACvC,IAAI,EAAE,KAAK;IACX,QAAQ;IACR,IAAI;IACJ,UAAU;IACV,MAAM;IACN,cAAc;IACd,UAAU;IACV,WAAW;IACX,OAAO;IACP,eAAe;IACf,WAAW;IACX,IAAI;IACJ,QAAQ;IACR,MAAM;IACN,QAAQ;CACT,CAAC,CAAA;AACF,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA","sourcesContent":["import { escape, unescape } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport { Path } from 'path-scurry'\nimport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nimport { Glob } from './glob.js'\nimport { hasMagic } from './has-magic.js'\n\n/**\n * Syncronous form of {@link globStream}. Will read all the matches as fast as\n * you consume them, even all in a single tick if you consume them immediately,\n * but will still respond to backpressure if they're not consumed immediately.\n */\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Minipass<Path, Path>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesUnset\n): Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStreamSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).streamSync()\n}\n\n/**\n * Return a stream that emits all the strings or `Path` objects and\n * then emits `end` when completed.\n */\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Minipass<Path, Path>\nexport function globStream(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions\n): Minipass<Path, Path> | Minipass<string, string>\nexport function globStream(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).stream()\n}\n\n/**\n * Synchronous form of {@link glob}\n */\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Path[]\nexport function globSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Path[] | string[]\nexport function globSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).walkSync()\n}\n\n/**\n * Perform an asynchronous glob search for the pattern(s) specified. Returns\n * [Path](https://isaacs.github.io/path-scurry/classes/PathBase) objects if the\n * {@link withFileTypes} option is set to `true`. See {@link GlobOptions} for\n * full option descriptions.\n */\nasync function glob_(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Promise<Path[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Promise<string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions\n): Promise<Path[] | string[]>\nasync function glob_(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).walk()\n}\n\n/**\n * Return a sync iterator for walking glob pattern matches.\n */\nexport function globIterateSync(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): Generator<Path, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions\n): Generator<Path, void, void> | Generator<string, void, void>\nexport function globIterateSync(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).iterateSync()\n}\n\n/**\n * Return an async iterator for walking glob pattern matches.\n */\nexport function globIterate(\n  pattern: string | string[],\n  options?: GlobOptionsWithFileTypesUnset | undefined\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesTrue\n): AsyncGenerator<Path, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptionsWithFileTypesFalse\n): AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions\n): AsyncGenerator<Path, void, void> | AsyncGenerator<string, void, void>\nexport function globIterate(\n  pattern: string | string[],\n  options: GlobOptions = {}\n) {\n  return new Glob(pattern, options).iterate()\n}\n\n// aliases: glob.sync.stream() glob.stream.sync() glob.sync() etc\nexport const streamSync = globStreamSync\nexport const stream = Object.assign(globStream, { sync: globStreamSync })\nexport const iterateSync = globIterateSync\nexport const iterate = Object.assign(globIterate, {\n  sync: globIterateSync,\n})\nexport const sync = Object.assign(globSync, {\n  stream: globStreamSync,\n  iterate: globIterateSync,\n})\n\n/* c8 ignore start */\nexport { escape, unescape } from 'minimatch'\nexport { Glob } from './glob.js'\nexport type {\n  GlobOptions,\n  GlobOptionsWithFileTypesFalse,\n  GlobOptionsWithFileTypesTrue,\n  GlobOptionsWithFileTypesUnset,\n} from './glob.js'\nexport { hasMagic } from './has-magic.js'\nexport type { IgnoreLike } from './ignore.js'\nexport type { MatchStream } from './walker.js'\nexport type {\n  Path,\n  WalkOptionsWithFileTypesTrue,\n  WalkOptionsWithFileTypesUnset,\n  WalkOptions,\n  FSOption,\n} from 'path-scurry'\n\n/* c8 ignore stop */\n\nexport const glob = Object.assign(glob_, {\n  glob: glob_,\n  globSync,\n  sync,\n  globStream,\n  stream,\n  globStreamSync,\n  streamSync,\n  globIterate,\n  iterate,\n  globIterateSync,\n  iterateSync,\n  Glob,\n  hasMagic,\n  escape,\n  unescape,\n})\nglob.glob = glob\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/esm/package.json b/deps/npm/node_modules/glob/dist/esm/package.json
new file mode 100644
index 00000000000000..7c34deb5837d8d
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/package.json
@@ -0,0 +1 @@
+{"type":"module"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/pattern.d.ts b/deps/npm/node_modules/glob/dist/esm/pattern.d.ts
similarity index 97%
rename from deps/npm/node_modules/glob/dist/mjs/pattern.d.ts
rename to deps/npm/node_modules/glob/dist/esm/pattern.d.ts
index 109cc4e7a5dae3..da675f9322c64f 100644
--- a/deps/npm/node_modules/glob/dist/mjs/pattern.d.ts
+++ b/deps/npm/node_modules/glob/dist/esm/pattern.d.ts
@@ -1,4 +1,4 @@
-/// <reference types="node" />
+/// <reference types="node" resolution-mode="require"/>
 import { GLOBSTAR } from 'minimatch';
 export type MMPattern = string | RegExp | typeof GLOBSTAR;
 export type PatternList = [p: MMPattern, ...rest: MMPattern[]];
diff --git a/deps/npm/node_modules/glob/dist/esm/pattern.d.ts.map b/deps/npm/node_modules/glob/dist/esm/pattern.d.ts.map
new file mode 100644
index 00000000000000..1430a77dadbbe4
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/pattern.d.ts.map
@@ -0,0 +1 @@
+{"version":3,"file":"pattern.d.ts","sourceRoot":"","sources":["../../src/pattern.ts"],"names":[],"mappings":";AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AACpC,MAAM,MAAM,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,QAAQ,CAAA;AAGzD,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;AAC9D,MAAM,MAAM,cAAc,GAAG;IAC3B,EAAE,EAAE,EAAE;IACN,EAAE,EAAE,EAAE;IACN,EAAE,EAAE,MAAM;IACV,EAAE,EAAE,MAAM;IACV,GAAG,IAAI,EAAE,SAAS,EAAE;CACrB,CAAA;AACD,MAAM,MAAM,gBAAgB,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;AACjE,MAAM,MAAM,mBAAmB,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,SAAS,EAAE,CAAC,CAAA;AAChE,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,CAAC,CAAA;AAMrD;;;GAGG;AACH,qBAAa,OAAO;;IAIlB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;gBAUrB,WAAW,EAAE,SAAS,EAAE,EACxB,QAAQ,EAAE,MAAM,EAAE,EAClB,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,CAAC,QAAQ;IA6D3B;;OAEG;IACH,OAAO,IAAI,SAAS;IAIpB;;OAEG;IACH,QAAQ,IAAI,OAAO;IAGnB;;OAEG;IACH,UAAU,IAAI,OAAO;IAGrB;;OAEG;IACH,QAAQ,IAAI,OAAO;IAInB;;OAEG;IACH,UAAU,IAAI,MAAM;IAUpB;;OAEG;IACH,OAAO,IAAI,OAAO;IAIlB;;OAEG;IACH,IAAI,IAAI,OAAO,GAAG,IAAI;IAetB;;OAEG;IACH,KAAK,IAAI,OAAO;IAoBhB;;OAEG;IACH,OAAO,IAAI,OAAO;IAelB;;OAEG;IACH,UAAU,IAAI,OAAO;IAUrB;;OAEG;IACH,IAAI,IAAI,MAAM;IAOd;;;OAGG;IACH,mBAAmB,IAAI,OAAO;IAQ9B;;OAEG;IACH,kBAAkB,IAAI,OAAO;CAM9B"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/pattern.js b/deps/npm/node_modules/glob/dist/esm/pattern.js
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/pattern.js
rename to deps/npm/node_modules/glob/dist/esm/pattern.js
diff --git a/deps/npm/node_modules/glob/dist/mjs/pattern.js.map b/deps/npm/node_modules/glob/dist/esm/pattern.js.map
similarity index 69%
rename from deps/npm/node_modules/glob/dist/mjs/pattern.js.map
rename to deps/npm/node_modules/glob/dist/esm/pattern.js.map
index bb039c142107fc..267a339ee5ab61 100644
--- a/deps/npm/node_modules/glob/dist/mjs/pattern.js.map
+++ b/deps/npm/node_modules/glob/dist/esm/pattern.js.map
@@ -1 +1 @@
-{"version":3,"file":"pattern.js","sourceRoot":"","sources":["../../src/pattern.ts"],"names":[],"mappings":"AAAA,yEAAyE;AAEzE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAgBpC,MAAM,aAAa,GAAG,CAAC,EAAe,EAAqB,EAAE,CAC3D,EAAE,CAAC,MAAM,IAAI,CAAC,CAAA;AAChB,MAAM,UAAU,GAAG,CAAC,EAAY,EAAkB,EAAE,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,CAAA;AAEnE;;;GAGG;AACH,MAAM,OAAO,OAAO;IACT,YAAY,CAAa;IACzB,SAAS,CAAU;IACnB,MAAM,CAAQ;IACd,MAAM,CAAQ;IACd,SAAS,CAAiB;IACnC,KAAK,CAAiB;IACtB,WAAW,CAAS;IACpB,QAAQ,CAAU;IAClB,MAAM,CAAU;IAChB,WAAW,CAAU;IACrB,eAAe,GAAY,IAAI,CAAA;IAE/B,YACE,WAAwB,EACxB,QAAkB,EAClB,KAAa,EACb,QAAyB;QAEzB,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,EAAE;YAC/B,MAAM,IAAI,SAAS,CAAC,oBAAoB,CAAC,CAAA;SAC1C;QACD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE;YACzB,MAAM,IAAI,SAAS,CAAC,iBAAiB,CAAC,CAAA;SACvC;QACD,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,EAAE;YAC1C,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAA;SACrE;QACD,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAA;QAChC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YACrC,MAAM,IAAI,SAAS,CAAC,oBAAoB,CAAC,CAAA;SAC1C;QACD,IAAI,CAAC,YAAY,GAAG,WAAW,CAAA;QAC/B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;QACnB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QAEzB,mEAAmE;QACnE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACrB,gBAAgB;YAChB,iBAAiB;YACjB,uBAAuB;YACvB,oCAAoC;YACpC,qCAAqC;YACrC,2CAA2C;YAC3C,uBAAuB;YACvB,aAAa;YACb,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE;gBAChB,6BAA6B;gBAC7B,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAA;gBACpD,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;gBACjD,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;oBACnB,YAAY;oBACZ,KAAK,CAAC,KAAK,EAAE,CAAA;oBACb,KAAK,CAAC,KAAK,EAAE,CAAA;iBACd;gBACD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACxC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACxC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;aACvC;iBAAM,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;gBAC9C,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAA;gBACxC,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;gBACrC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;oBACnB,YAAY;oBACZ,KAAK,CAAC,KAAK,EAAE,CAAA;oBACb,KAAK,CAAC,KAAK,EAAE,CAAA;iBACd;gBACD,MAAM,CAAC,GAAI,EAAa,GAAG,GAAG,CAAA;gBAC9B,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,CAAA;gBAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;aACvC;SACF;IACH,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IACvC,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAA;IAC3D,CAAC;IACD;;OAEG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAA;IACpD,CAAC;IACD;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,MAAM,CAAA;IACzD,CAAC;IAED;;OAEG;IACH,UAAU;QACR,OAAO,CAAC,IAAI,CAAC,WAAW;YACtB,IAAI,CAAC,WAAW;gBAChB,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;oBAChB,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE;wBACjB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;wBACvD,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC;oBAC5B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACrD,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACtC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QAC/C,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAA;QAC/C,IAAI,CAAC,KAAK,GAAG,IAAI,OAAO,CACtB,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,MAAM,GAAG,CAAC,EACf,IAAI,CAAC,SAAS,CACf,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;QACzC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAC/B,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QACnC,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,MAAM,KAAK,SAAS;YAC9B,CAAC,CAAC,IAAI,CAAC,MAAM;YACb,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;gBACV,IAAI,CAAC,SAAS,KAAK,OAAO;oBAC1B,IAAI,CAAC,MAAM,KAAK,CAAC;oBACjB,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBACZ,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBACZ,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACP,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC;IAED,sBAAsB;IACtB,sBAAsB;IACtB,mEAAmE;IACnE,sEAAsE;IACtE,6CAA6C;IAC7C;;OAEG;IACH,OAAO;QACL,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS;YAChC,CAAC,CAAC,IAAI,CAAC,QAAQ;YACf,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ;gBACZ,IAAI,CAAC,SAAS,KAAK,OAAO;oBAC1B,IAAI,CAAC,MAAM,KAAK,CAAC;oBACjB,IAAI,CAAC,MAAM,GAAG,CAAC;oBACf,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChC,CAAC;IAED,sCAAsC;IACtC,kDAAkD;IAClD,oDAAoD;IACpD;;OAEG;IACH,UAAU;QACR,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS;YACnC,CAAC,CAAC,IAAI,CAAC,WAAW;YAClB,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW;gBACf,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;oBAC/B,IAAI,CAAC,OAAO,EAAE;oBACd,IAAI,CAAC,KAAK,EAAE,CAAC,CAAA;IACrB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC9B,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACpE,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,CAAA;IACR,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACjB,OAAO,CAAC,CACN,IAAI,CAAC,MAAM,KAAK,CAAC;YACjB,CAAC,IAAI,CAAC,UAAU,EAAE;YAClB,CAAC,IAAI,CAAC,eAAe,CACtB,CAAA;IACH,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe;YAClE,OAAO,KAAK,CAAA;QACd,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;QAC5B,OAAO,IAAI,CAAA;IACb,CAAC;CACF","sourcesContent":["// this is just a very light wrapper around 2 arrays with an offset index\n\nimport { GLOBSTAR } from 'minimatch'\nexport type MMPattern = string | RegExp | typeof GLOBSTAR\n\n// an array of length >= 1\nexport type PatternList = [p: MMPattern, ...rest: MMPattern[]]\nexport type UNCPatternList = [\n  p0: '',\n  p1: '',\n  p2: string,\n  p3: string,\n  ...rest: MMPattern[]\n]\nexport type DrivePatternList = [p0: string, ...rest: MMPattern[]]\nexport type AbsolutePatternList = [p0: '', ...rest: MMPattern[]]\nexport type GlobList = [p: string, ...rest: string[]]\n\nconst isPatternList = (pl: MMPattern[]): pl is PatternList =>\n  pl.length >= 1\nconst isGlobList = (gl: string[]): gl is GlobList => gl.length >= 1\n\n/**\n * An immutable-ish view on an array of glob parts and their parsed\n * results\n */\nexport class Pattern {\n  readonly #patternList: PatternList\n  readonly #globList: GlobList\n  readonly #index: number\n  readonly length: number\n  readonly #platform: NodeJS.Platform\n  #rest?: Pattern | null\n  #globString?: string\n  #isDrive?: boolean\n  #isUNC?: boolean\n  #isAbsolute?: boolean\n  #followGlobstar: boolean = true\n\n  constructor(\n    patternList: MMPattern[],\n    globList: string[],\n    index: number,\n    platform: NodeJS.Platform\n  ) {\n    if (!isPatternList(patternList)) {\n      throw new TypeError('empty pattern list')\n    }\n    if (!isGlobList(globList)) {\n      throw new TypeError('empty glob list')\n    }\n    if (globList.length !== patternList.length) {\n      throw new TypeError('mismatched pattern list and glob list lengths')\n    }\n    this.length = patternList.length\n    if (index < 0 || index >= this.length) {\n      throw new TypeError('index out of range')\n    }\n    this.#patternList = patternList\n    this.#globList = globList\n    this.#index = index\n    this.#platform = platform\n\n    // normalize root entries of absolute patterns on initial creation.\n    if (this.#index === 0) {\n      // c: => ['c:/']\n      // C:/ => ['C:/']\n      // C:/x => ['C:/', 'x']\n      // //host/share => ['//host/share/']\n      // //host/share/ => ['//host/share/']\n      // //host/share/x => ['//host/share/', 'x']\n      // /etc => ['/', 'etc']\n      // / => ['/']\n      if (this.isUNC()) {\n        // '' / '' / 'host' / 'share'\n        const [p0, p1, p2, p3, ...prest] = this.#patternList\n        const [g0, g1, g2, g3, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = [p0, p1, p2, p3, ''].join('/')\n        const g = [g0, g1, g2, g3, ''].join('/')\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      } else if (this.isDrive() || this.isAbsolute()) {\n        const [p1, ...prest] = this.#patternList\n        const [g1, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = (p1 as string) + '/'\n        const g = g1 + '/'\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      }\n    }\n  }\n\n  /**\n   * The first entry in the parsed list of patterns\n   */\n  pattern(): MMPattern {\n    return this.#patternList[this.#index]\n  }\n\n  /**\n   * true of if pattern() returns a string\n   */\n  isString(): boolean {\n    return typeof this.#patternList[this.#index] === 'string'\n  }\n  /**\n   * true of if pattern() returns GLOBSTAR\n   */\n  isGlobstar(): boolean {\n    return this.#patternList[this.#index] === GLOBSTAR\n  }\n  /**\n   * true if pattern() returns a regexp\n   */\n  isRegExp(): boolean {\n    return this.#patternList[this.#index] instanceof RegExp\n  }\n\n  /**\n   * The /-joined set of glob parts that make up this pattern\n   */\n  globString(): string {\n    return (this.#globString =\n      this.#globString ||\n      (this.#index === 0\n        ? this.isAbsolute()\n          ? this.#globList[0] + this.#globList.slice(1).join('/')\n          : this.#globList.join('/')\n        : this.#globList.slice(this.#index).join('/')))\n  }\n\n  /**\n   * true if there are more pattern parts after this one\n   */\n  hasMore(): boolean {\n    return this.length > this.#index + 1\n  }\n\n  /**\n   * The rest of the pattern after this part, or null if this is the end\n   */\n  rest(): Pattern | null {\n    if (this.#rest !== undefined) return this.#rest\n    if (!this.hasMore()) return (this.#rest = null)\n    this.#rest = new Pattern(\n      this.#patternList,\n      this.#globList,\n      this.#index + 1,\n      this.#platform\n    )\n    this.#rest.#isAbsolute = this.#isAbsolute\n    this.#rest.#isUNC = this.#isUNC\n    this.#rest.#isDrive = this.#isDrive\n    return this.#rest\n  }\n\n  /**\n   * true if the pattern represents a //unc/path/ on windows\n   */\n  isUNC(): boolean {\n    const pl = this.#patternList\n    return this.#isUNC !== undefined\n      ? this.#isUNC\n      : (this.#isUNC =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          pl[0] === '' &&\n          pl[1] === '' &&\n          typeof pl[2] === 'string' &&\n          !!pl[2] &&\n          typeof pl[3] === 'string' &&\n          !!pl[3])\n  }\n\n  // pattern like C:/...\n  // split = ['C:', ...]\n  // XXX: would be nice to handle patterns like `c:*` to test the cwd\n  // in c: for *, but I don't know of a way to even figure out what that\n  // cwd is without actually chdir'ing into it?\n  /**\n   * True if the pattern starts with a drive letter on Windows\n   */\n  isDrive(): boolean {\n    const pl = this.#patternList\n    return this.#isDrive !== undefined\n      ? this.#isDrive\n      : (this.#isDrive =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          this.length > 1 &&\n          typeof pl[0] === 'string' &&\n          /^[a-z]:$/i.test(pl[0]))\n  }\n\n  // pattern = '/' or '/...' or '/x/...'\n  // split = ['', ''] or ['', ...] or ['', 'x', ...]\n  // Drive and UNC both considered absolute on windows\n  /**\n   * True if the pattern is rooted on an absolute path\n   */\n  isAbsolute(): boolean {\n    const pl = this.#patternList\n    return this.#isAbsolute !== undefined\n      ? this.#isAbsolute\n      : (this.#isAbsolute =\n          (pl[0] === '' && pl.length > 1) ||\n          this.isDrive() ||\n          this.isUNC())\n  }\n\n  /**\n   * consume the root of the pattern, and return it\n   */\n  root(): string {\n    const p = this.#patternList[0]\n    return typeof p === 'string' && this.isAbsolute() && this.#index === 0\n      ? p\n      : ''\n  }\n\n  /**\n   * Check to see if the current globstar pattern is allowed to follow\n   * a symbolic link.\n   */\n  checkFollowGlobstar(): boolean {\n    return !(\n      this.#index === 0 ||\n      !this.isGlobstar() ||\n      !this.#followGlobstar\n    )\n  }\n\n  /**\n   * Mark that the current globstar pattern is following a symbolic link\n   */\n  markFollowGlobstar(): boolean {\n    if (this.#index === 0 || !this.isGlobstar() || !this.#followGlobstar)\n      return false\n    this.#followGlobstar = false\n    return true\n  }\n}\n"]}
\ No newline at end of file
+{"version":3,"file":"pattern.js","sourceRoot":"","sources":["../../src/pattern.ts"],"names":[],"mappings":"AAAA,yEAAyE;AAEzE,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAA;AAgBpC,MAAM,aAAa,GAAG,CAAC,EAAe,EAAqB,EAAE,CAC3D,EAAE,CAAC,MAAM,IAAI,CAAC,CAAA;AAChB,MAAM,UAAU,GAAG,CAAC,EAAY,EAAkB,EAAE,CAAC,EAAE,CAAC,MAAM,IAAI,CAAC,CAAA;AAEnE;;;GAGG;AACH,MAAM,OAAO,OAAO;IACT,YAAY,CAAa;IACzB,SAAS,CAAU;IACnB,MAAM,CAAQ;IACd,MAAM,CAAQ;IACd,SAAS,CAAiB;IACnC,KAAK,CAAiB;IACtB,WAAW,CAAS;IACpB,QAAQ,CAAU;IAClB,MAAM,CAAU;IAChB,WAAW,CAAU;IACrB,eAAe,GAAY,IAAI,CAAA;IAE/B,YACE,WAAwB,EACxB,QAAkB,EAClB,KAAa,EACb,QAAyB;QAEzB,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,EAAE;YAC/B,MAAM,IAAI,SAAS,CAAC,oBAAoB,CAAC,CAAA;SAC1C;QACD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE;YACzB,MAAM,IAAI,SAAS,CAAC,iBAAiB,CAAC,CAAA;SACvC;QACD,IAAI,QAAQ,CAAC,MAAM,KAAK,WAAW,CAAC,MAAM,EAAE;YAC1C,MAAM,IAAI,SAAS,CAAC,+CAA+C,CAAC,CAAA;SACrE;QACD,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,CAAA;QAChC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE;YACrC,MAAM,IAAI,SAAS,CAAC,oBAAoB,CAAC,CAAA;SAC1C;QACD,IAAI,CAAC,YAAY,GAAG,WAAW,CAAA;QAC/B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAA;QACnB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QAEzB,mEAAmE;QACnE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;YACrB,gBAAgB;YAChB,iBAAiB;YACjB,uBAAuB;YACvB,oCAAoC;YACpC,qCAAqC;YACrC,2CAA2C;YAC3C,uBAAuB;YACvB,aAAa;YACb,IAAI,IAAI,CAAC,KAAK,EAAE,EAAE;gBAChB,6BAA6B;gBAC7B,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAA;gBACpD,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;gBACjD,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;oBACnB,YAAY;oBACZ,KAAK,CAAC,KAAK,EAAE,CAAA;oBACb,KAAK,CAAC,KAAK,EAAE,CAAA;iBACd;gBACD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACxC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBACxC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;aACvC;iBAAM,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE;gBAC9C,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,YAAY,CAAA;gBACxC,MAAM,CAAC,EAAE,EAAE,GAAG,KAAK,CAAC,GAAG,IAAI,CAAC,SAAS,CAAA;gBACrC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;oBACnB,YAAY;oBACZ,KAAK,CAAC,KAAK,EAAE,CAAA;oBACb,KAAK,CAAC,KAAK,EAAE,CAAA;iBACd;gBACD,MAAM,CAAC,GAAI,EAAa,GAAG,GAAG,CAAA;gBAC9B,MAAM,CAAC,GAAG,EAAE,GAAG,GAAG,CAAA;gBAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBACjC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;gBAC9B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAA;aACvC;SACF;IACH,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAc,CAAA;IACpD,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAA;IAC3D,CAAC;IACD;;OAEG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,QAAQ,CAAA;IACpD,CAAC;IACD;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,YAAY,MAAM,CAAA;IACzD,CAAC;IAED;;OAEG;IACH,UAAU;QACR,OAAO,CAAC,IAAI,CAAC,WAAW;YACtB,IAAI,CAAC,WAAW;gBAChB,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;oBAChB,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE;wBACjB,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;wBACvD,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC;oBAC5B,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACrD,CAAC;IAED;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAA;IACtC,CAAC;IAED;;OAEG;IACH,IAAI;QACF,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QAC/C,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YAAE,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAA;QAC/C,IAAI,CAAC,KAAK,GAAG,IAAI,OAAO,CACtB,IAAI,CAAC,YAAY,EACjB,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,MAAM,GAAG,CAAC,EACf,IAAI,CAAC,SAAS,CACf,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;QACzC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAC/B,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QACnC,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,MAAM,KAAK,SAAS;YAC9B,CAAC,CAAC,IAAI,CAAC,MAAM;YACb,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;gBACV,IAAI,CAAC,SAAS,KAAK,OAAO;oBAC1B,IAAI,CAAC,MAAM,KAAK,CAAC;oBACjB,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBACZ,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE;oBACZ,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACP,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;IAChB,CAAC;IAED,sBAAsB;IACtB,sBAAsB;IACtB,mEAAmE;IACnE,sEAAsE;IACtE,6CAA6C;IAC7C;;OAEG;IACH,OAAO;QACL,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS;YAChC,CAAC,CAAC,IAAI,CAAC,QAAQ;YACf,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ;gBACZ,IAAI,CAAC,SAAS,KAAK,OAAO;oBAC1B,IAAI,CAAC,MAAM,KAAK,CAAC;oBACjB,IAAI,CAAC,MAAM,GAAG,CAAC;oBACf,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,QAAQ;oBACzB,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChC,CAAC;IAED,sCAAsC;IACtC,kDAAkD;IAClD,oDAAoD;IACpD;;OAEG;IACH,UAAU;QACR,MAAM,EAAE,GAAG,IAAI,CAAC,YAAY,CAAA;QAC5B,OAAO,IAAI,CAAC,WAAW,KAAK,SAAS;YACnC,CAAC,CAAC,IAAI,CAAC,WAAW;YAClB,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW;gBACf,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;oBAC/B,IAAI,CAAC,OAAO,EAAE;oBACd,IAAI,CAAC,KAAK,EAAE,CAAC,CAAA;IACrB,CAAC;IAED;;OAEG;IACH,IAAI;QACF,MAAM,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAA;QAC9B,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACpE,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,EAAE,CAAA;IACR,CAAC;IAED;;;OAGG;IACH,mBAAmB;QACjB,OAAO,CAAC,CACN,IAAI,CAAC,MAAM,KAAK,CAAC;YACjB,CAAC,IAAI,CAAC,UAAU,EAAE;YAClB,CAAC,IAAI,CAAC,eAAe,CACtB,CAAA;IACH,CAAC;IAED;;OAEG;IACH,kBAAkB;QAChB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,eAAe;YAClE,OAAO,KAAK,CAAA;QACd,IAAI,CAAC,eAAe,GAAG,KAAK,CAAA;QAC5B,OAAO,IAAI,CAAA;IACb,CAAC;CACF","sourcesContent":["// this is just a very light wrapper around 2 arrays with an offset index\n\nimport { GLOBSTAR } from 'minimatch'\nexport type MMPattern = string | RegExp | typeof GLOBSTAR\n\n// an array of length >= 1\nexport type PatternList = [p: MMPattern, ...rest: MMPattern[]]\nexport type UNCPatternList = [\n  p0: '',\n  p1: '',\n  p2: string,\n  p3: string,\n  ...rest: MMPattern[]\n]\nexport type DrivePatternList = [p0: string, ...rest: MMPattern[]]\nexport type AbsolutePatternList = [p0: '', ...rest: MMPattern[]]\nexport type GlobList = [p: string, ...rest: string[]]\n\nconst isPatternList = (pl: MMPattern[]): pl is PatternList =>\n  pl.length >= 1\nconst isGlobList = (gl: string[]): gl is GlobList => gl.length >= 1\n\n/**\n * An immutable-ish view on an array of glob parts and their parsed\n * results\n */\nexport class Pattern {\n  readonly #patternList: PatternList\n  readonly #globList: GlobList\n  readonly #index: number\n  readonly length: number\n  readonly #platform: NodeJS.Platform\n  #rest?: Pattern | null\n  #globString?: string\n  #isDrive?: boolean\n  #isUNC?: boolean\n  #isAbsolute?: boolean\n  #followGlobstar: boolean = true\n\n  constructor(\n    patternList: MMPattern[],\n    globList: string[],\n    index: number,\n    platform: NodeJS.Platform\n  ) {\n    if (!isPatternList(patternList)) {\n      throw new TypeError('empty pattern list')\n    }\n    if (!isGlobList(globList)) {\n      throw new TypeError('empty glob list')\n    }\n    if (globList.length !== patternList.length) {\n      throw new TypeError('mismatched pattern list and glob list lengths')\n    }\n    this.length = patternList.length\n    if (index < 0 || index >= this.length) {\n      throw new TypeError('index out of range')\n    }\n    this.#patternList = patternList\n    this.#globList = globList\n    this.#index = index\n    this.#platform = platform\n\n    // normalize root entries of absolute patterns on initial creation.\n    if (this.#index === 0) {\n      // c: => ['c:/']\n      // C:/ => ['C:/']\n      // C:/x => ['C:/', 'x']\n      // //host/share => ['//host/share/']\n      // //host/share/ => ['//host/share/']\n      // //host/share/x => ['//host/share/', 'x']\n      // /etc => ['/', 'etc']\n      // / => ['/']\n      if (this.isUNC()) {\n        // '' / '' / 'host' / 'share'\n        const [p0, p1, p2, p3, ...prest] = this.#patternList\n        const [g0, g1, g2, g3, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = [p0, p1, p2, p3, ''].join('/')\n        const g = [g0, g1, g2, g3, ''].join('/')\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      } else if (this.isDrive() || this.isAbsolute()) {\n        const [p1, ...prest] = this.#patternList\n        const [g1, ...grest] = this.#globList\n        if (prest[0] === '') {\n          // ends in /\n          prest.shift()\n          grest.shift()\n        }\n        const p = (p1 as string) + '/'\n        const g = g1 + '/'\n        this.#patternList = [p, ...prest]\n        this.#globList = [g, ...grest]\n        this.length = this.#patternList.length\n      }\n    }\n  }\n\n  /**\n   * The first entry in the parsed list of patterns\n   */\n  pattern(): MMPattern {\n    return this.#patternList[this.#index] as MMPattern\n  }\n\n  /**\n   * true of if pattern() returns a string\n   */\n  isString(): boolean {\n    return typeof this.#patternList[this.#index] === 'string'\n  }\n  /**\n   * true of if pattern() returns GLOBSTAR\n   */\n  isGlobstar(): boolean {\n    return this.#patternList[this.#index] === GLOBSTAR\n  }\n  /**\n   * true if pattern() returns a regexp\n   */\n  isRegExp(): boolean {\n    return this.#patternList[this.#index] instanceof RegExp\n  }\n\n  /**\n   * The /-joined set of glob parts that make up this pattern\n   */\n  globString(): string {\n    return (this.#globString =\n      this.#globString ||\n      (this.#index === 0\n        ? this.isAbsolute()\n          ? this.#globList[0] + this.#globList.slice(1).join('/')\n          : this.#globList.join('/')\n        : this.#globList.slice(this.#index).join('/')))\n  }\n\n  /**\n   * true if there are more pattern parts after this one\n   */\n  hasMore(): boolean {\n    return this.length > this.#index + 1\n  }\n\n  /**\n   * The rest of the pattern after this part, or null if this is the end\n   */\n  rest(): Pattern | null {\n    if (this.#rest !== undefined) return this.#rest\n    if (!this.hasMore()) return (this.#rest = null)\n    this.#rest = new Pattern(\n      this.#patternList,\n      this.#globList,\n      this.#index + 1,\n      this.#platform\n    )\n    this.#rest.#isAbsolute = this.#isAbsolute\n    this.#rest.#isUNC = this.#isUNC\n    this.#rest.#isDrive = this.#isDrive\n    return this.#rest\n  }\n\n  /**\n   * true if the pattern represents a //unc/path/ on windows\n   */\n  isUNC(): boolean {\n    const pl = this.#patternList\n    return this.#isUNC !== undefined\n      ? this.#isUNC\n      : (this.#isUNC =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          pl[0] === '' &&\n          pl[1] === '' &&\n          typeof pl[2] === 'string' &&\n          !!pl[2] &&\n          typeof pl[3] === 'string' &&\n          !!pl[3])\n  }\n\n  // pattern like C:/...\n  // split = ['C:', ...]\n  // XXX: would be nice to handle patterns like `c:*` to test the cwd\n  // in c: for *, but I don't know of a way to even figure out what that\n  // cwd is without actually chdir'ing into it?\n  /**\n   * True if the pattern starts with a drive letter on Windows\n   */\n  isDrive(): boolean {\n    const pl = this.#patternList\n    return this.#isDrive !== undefined\n      ? this.#isDrive\n      : (this.#isDrive =\n          this.#platform === 'win32' &&\n          this.#index === 0 &&\n          this.length > 1 &&\n          typeof pl[0] === 'string' &&\n          /^[a-z]:$/i.test(pl[0]))\n  }\n\n  // pattern = '/' or '/...' or '/x/...'\n  // split = ['', ''] or ['', ...] or ['', 'x', ...]\n  // Drive and UNC both considered absolute on windows\n  /**\n   * True if the pattern is rooted on an absolute path\n   */\n  isAbsolute(): boolean {\n    const pl = this.#patternList\n    return this.#isAbsolute !== undefined\n      ? this.#isAbsolute\n      : (this.#isAbsolute =\n          (pl[0] === '' && pl.length > 1) ||\n          this.isDrive() ||\n          this.isUNC())\n  }\n\n  /**\n   * consume the root of the pattern, and return it\n   */\n  root(): string {\n    const p = this.#patternList[0]\n    return typeof p === 'string' && this.isAbsolute() && this.#index === 0\n      ? p\n      : ''\n  }\n\n  /**\n   * Check to see if the current globstar pattern is allowed to follow\n   * a symbolic link.\n   */\n  checkFollowGlobstar(): boolean {\n    return !(\n      this.#index === 0 ||\n      !this.isGlobstar() ||\n      !this.#followGlobstar\n    )\n  }\n\n  /**\n   * Mark that the current globstar pattern is following a symbolic link\n   */\n  markFollowGlobstar(): boolean {\n    if (this.#index === 0 || !this.isGlobstar() || !this.#followGlobstar)\n      return false\n    this.#followGlobstar = false\n    return true\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/processor.d.ts b/deps/npm/node_modules/glob/dist/esm/processor.d.ts
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/processor.d.ts
rename to deps/npm/node_modules/glob/dist/esm/processor.d.ts
diff --git a/deps/npm/node_modules/glob/dist/esm/processor.d.ts.map b/deps/npm/node_modules/glob/dist/esm/processor.d.ts.map
new file mode 100644
index 00000000000000..33a39b2a8be3bf
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/processor.d.ts.map
@@ -0,0 +1 @@
+{"version":3,"file":"processor.d.ts","sourceRoot":"","sources":["../../src/processor.ts"],"names":[],"mappings":"AAEA,OAAO,EAAY,QAAQ,EAAE,MAAM,WAAW,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,EAAa,OAAO,EAAE,MAAM,cAAc,CAAA;AACjD,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAA;AAE5C;;GAEG;AACH,qBAAa,cAAc;IACzB,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAA;gBACnB,KAAK,GAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAGvD,IAAI;IAGJ,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;IAGxC,WAAW,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;CAM3C;AAED;;;;GAIG;AACH,qBAAa,WAAW;IACtB,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAY;IACpC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO;IAMnD,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE;CAOtC;AAED;;;GAGG;AACH,qBAAa,QAAQ;IACnB,KAAK,EAAE,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAY;IACvC,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO;IAWlC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,OAAO,EAAE;IAS5B,OAAO,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE;IAG9B,IAAI,IAAI,IAAI,EAAE;CAGf;AAED;;;;;GAKG;AACH,qBAAa,SAAS;IACpB,cAAc,EAAE,cAAc,CAAA;IAC9B,OAAO,cAAoB;IAC3B,QAAQ,WAAiB;IACzB,QAAQ,CAAC,EAAE,OAAO,EAAE,CAAA;IACpB,MAAM,EAAE,OAAO,CAAA;IACf,GAAG,EAAE,OAAO,CAAA;IACZ,IAAI,EAAE,cAAc,CAAA;gBAER,IAAI,EAAE,cAAc,EAAE,cAAc,CAAC,EAAE,cAAc;IASjE,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE;IAmGjD,cAAc,IAAI,IAAI,EAAE;IAIxB,KAAK;IAQL,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,SAAS;IAqBvD,YAAY,CACV,CAAC,EAAE,IAAI,EACP,OAAO,EAAE,OAAO,EAChB,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,QAAQ,EAAE,OAAO;IA8CnB,UAAU,CACR,CAAC,EAAE,IAAI,EACP,CAAC,EAAE,QAAQ,EACX,IAAI,EAAE,OAAO,GAAG,IAAI,EACpB,QAAQ,EAAE,OAAO;IAUnB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,QAAQ,EAAE,OAAO;CASvE"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/processor.js b/deps/npm/node_modules/glob/dist/esm/processor.js
similarity index 95%
rename from deps/npm/node_modules/glob/dist/mjs/processor.js
rename to deps/npm/node_modules/glob/dist/esm/processor.js
index dd2228ad6761a5..b5b2de2d314ca7 100644
--- a/deps/npm/node_modules/glob/dist/mjs/processor.js
+++ b/deps/npm/node_modules/glob/dist/esm/processor.js
@@ -132,9 +132,6 @@ export class Processor {
             while (typeof (p = pattern.pattern()) === 'string' &&
                 (rest = pattern.rest())) {
                 const c = t.resolve(p);
-                // we can be reasonably sure that .. is a readable dir
-                if (c.isUnknown() && p !== '..')
-                    break;
                 t = c;
                 pattern = rest;
                 changed = true;
@@ -150,14 +147,10 @@ export class Processor {
             // more strings for an unknown entry,
             // or a pattern starting with magic, mounted on t.
             if (typeof p === 'string') {
-                // must be final entry
-                if (!rest) {
-                    const ifDir = p === '..' || p === '' || p === '.';
-                    this.matches.add(t.resolve(p), absolute, ifDir);
-                }
-                else {
-                    this.subwalks.add(t, pattern);
-                }
+                // must not be final entry, otherwise we would have
+                // concatenated it earlier.
+                const ifDir = p === '..' || p === '' || p === '.';
+                this.matches.add(t.resolve(p), absolute, ifDir);
                 continue;
             }
             else if (p === GLOBSTAR) {
diff --git a/deps/npm/node_modules/glob/dist/esm/processor.js.map b/deps/npm/node_modules/glob/dist/esm/processor.js.map
new file mode 100644
index 00000000000000..9e4673a5324637
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/processor.js.map
@@ -0,0 +1 @@
+{"version":3,"file":"processor.js","sourceRoot":"","sources":["../../src/processor.ts"],"names":[],"mappings":"AAAA,qEAAqE;AAErE,OAAO,EAAE,QAAQ,EAAY,MAAM,WAAW,CAAA;AAK9C;;GAEG;AACH,MAAM,OAAO,cAAc;IACzB,KAAK,CAA0B;IAC/B,YAAY,QAAkC,IAAI,GAAG,EAAE;QACrD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,CAAC;IACD,IAAI;QACF,OAAO,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IAChD,CAAC;IACD,SAAS,CAAC,MAAY,EAAE,OAAgB;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;IACrE,CAAC;IACD,WAAW,CAAC,MAAY,EAAE,OAAgB;QACxC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACvC,IAAI,MAAM;YAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;;YACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAA;IAChE,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,WAAW;IACtB,KAAK,GAAsB,IAAI,GAAG,EAAE,CAAA;IACpC,GAAG,CAAC,MAAY,EAAE,QAAiB,EAAE,KAAc;QACjD,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAA;IACjE,CAAC;IACD,yBAAyB;IACzB,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI;YACJ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACV,CAAC,CAAA;IACJ,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,QAAQ;IACnB,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAA;IACvC,GAAG,CAAC,MAAY,EAAE,OAAgB;QAChC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE;YACxB,OAAM;SACP;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE;gBAC5D,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;aACnB;SACF;;YAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC,CAAA;IAC1C,CAAC;IACD,GAAG,CAAC,MAAY;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,qBAAqB;QACrB,IAAI,CAAC,IAAI,EAAE;YACT,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAA;SACnD;QACD,oBAAoB;QACpB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAc,CAAC,CAAC,CAAA;IAClE,CAAC;IACD,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAA;IAC3D,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,SAAS;IACpB,cAAc,CAAgB;IAC9B,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;IAC3B,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAA;IACzB,QAAQ,CAAY;IACpB,MAAM,CAAS;IACf,GAAG,CAAS;IACZ,IAAI,CAAgB;IAEpB,YAAY,IAAoB,EAAE,cAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;QACrB,IAAI,CAAC,cAAc,GAAG,cAAc;YAClC,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE;YACvB,CAAC,CAAC,IAAI,cAAc,EAAE,CAAA;IAC1B,CAAC;IAED,eAAe,CAAC,MAAY,EAAE,QAAmB;QAC/C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,MAAM,aAAa,GAAsB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAA;QAEvE,gEAAgE;QAChE,uCAAuC;QAEvC,KAAK,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE;YACtC,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAE3C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;YAC3B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAA;YAErE,kCAAkC;YAClC,IAAI,IAAI,EAAE;gBACR,CAAC,GAAG,CAAC,CAAC,OAAO,CACX,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS;oBAC1C,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;oBAChB,CAAC,CAAC,IAAI,CACT,CAAA;gBACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;gBAC3B,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;oBAChC,SAAQ;iBACT;qBAAM;oBACL,OAAO,GAAG,IAAI,CAAA;iBACf;aACF;YAED,IAAI,CAAC,CAAC,QAAQ,EAAE;gBAAE,SAAQ;YAE1B,IAAI,CAAY,CAAA;YAChB,IAAI,IAAoB,CAAA;YACxB,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,OACE,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,KAAK,QAAQ;gBAC3C,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EACvB;gBACA,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;gBACtB,CAAC,GAAG,CAAC,CAAA;gBACL,OAAO,GAAG,IAAI,CAAA;gBACd,OAAO,GAAG,IAAI,CAAA;aACf;YACD,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;YACrB,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;YACrB,IAAI,OAAO,EAAE;gBACX,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC;oBAAE,SAAQ;gBACvD,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;aAC5C;YAED,uDAAuD;YACvD,qCAAqC;YACrC,kDAAkD;YAClD,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;gBACzB,mDAAmD;gBACnD,2BAA2B;gBAC3B,MAAM,KAAK,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAA;gBACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;gBAC/C,SAAQ;aACT;iBAAM,IAAI,CAAC,KAAK,QAAQ,EAAE;gBACzB,wCAAwC;gBACxC,4CAA4C;gBAC5C,wDAAwD;gBACxD,4DAA4D;gBAC5D,gEAAgE;gBAChE,IACE,CAAC,CAAC,CAAC,cAAc,EAAE;oBACnB,IAAI,CAAC,MAAM;oBACX,OAAO,CAAC,mBAAmB,EAAE,EAC7B;oBACA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;gBACD,MAAM,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,CAAA;gBAC1B,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,EAAE,CAAA;gBAC1B,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;oBAClD,iDAAiD;oBACjD,6CAA6C;oBAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAA;iBACvD;qBAAM;oBACL,IAAI,EAAE,KAAK,IAAI,EAAE;wBACf,wDAAwD;wBACxD,wDAAwD;wBACxD,qBAAqB;wBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;wBACxB,oBAAoB;wBACpB,IAAI,CAAC,KAAK;4BAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;6BAC3C,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE;4BAClD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;yBAC7B;qBACF;iBACF;aACF;iBAAM,IAAI,CAAC,YAAY,MAAM,EAAE;gBAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;aAC9B;SACF;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;IAC7B,CAAC;IAED,KAAK;QACH,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAA;IACtD,CAAC;IAED,0DAA0D;IAC1D,yCAAyC;IACzC,6CAA6C;IAC7C,2BAA2B;IAC3B,aAAa,CAAC,MAAY,EAAE,OAAe;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC1C,yDAAyD;QACzD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAA;QAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;YACvB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;gBAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAA;gBACrC,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;gBAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;gBAC3B,IAAI,CAAC,KAAK,QAAQ,EAAE;oBAClB,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACjD;qBAAM,IAAI,CAAC,YAAY,MAAM,EAAE;oBAC9B,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACzC;qBAAM;oBACL,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACzC;aACF;SACF;QACD,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,YAAY,CACV,CAAO,EACP,OAAgB,EAChB,IAAoB,EACpB,QAAiB;QAEjB,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;YACvC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;gBACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;aACrC;YACD,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,2DAA2D;gBAC3D,gEAAgE;gBAChE,+DAA+D;gBAC/D,iEAAiE;gBACjE,uDAAuD;gBACvD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,cAAc,EAAE,EAAE;oBACtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;qBAAM,IAAI,CAAC,CAAC,cAAc,EAAE,EAAE;oBAC7B,IAAI,IAAI,IAAI,OAAO,CAAC,mBAAmB,EAAE,EAAE;wBACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;qBAC3B;yBAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,EAAE;wBACvC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;qBAC9B;iBACF;aACF;SACF;QACD,sDAAsD;QACtD,YAAY;QACZ,IAAI,IAAI,EAAE;YACR,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;YACzB,IACE,OAAO,EAAE,KAAK,QAAQ;gBACtB,sCAAsC;gBACtC,EAAE,KAAK,IAAI;gBACX,EAAE,KAAK,EAAE;gBACT,EAAE,KAAK,GAAG,EACV;gBACA,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAA;aAC9C;iBAAM,IAAI,EAAE,KAAK,IAAI,EAAE;gBACtB,qBAAqB;gBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;gBACxB,oBAAoB;gBACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;aAC5B;iBAAM,IAAI,EAAE,YAAY,MAAM,EAAE;gBAC/B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAA;aAC9C;SACF;IACH,CAAC;IAED,UAAU,CACR,CAAO,EACP,CAAW,EACX,IAAoB,EACpB,QAAiB;QAEjB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAM;QAC3B,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACrC;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;IAED,UAAU,CAAC,CAAO,EAAE,CAAS,EAAE,IAAoB,EAAE,QAAiB;QACpE,uBAAuB;QACvB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAM;QACzB,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACrC;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;CACF","sourcesContent":["// synchronous utility for filtering entries and calculating subwalks\n\nimport { GLOBSTAR, MMRegExp } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { MMPattern, Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\n/**\n * A cache of which patterns have been processed for a given Path\n */\nexport class HasWalkedCache {\n  store: Map<string, Set<string>>\n  constructor(store: Map<string, Set<string>> = new Map()) {\n    this.store = store\n  }\n  copy() {\n    return new HasWalkedCache(new Map(this.store))\n  }\n  hasWalked(target: Path, pattern: Pattern) {\n    return this.store.get(target.fullpath())?.has(pattern.globString())\n  }\n  storeWalked(target: Path, pattern: Pattern) {\n    const fullpath = target.fullpath()\n    const cached = this.store.get(fullpath)\n    if (cached) cached.add(pattern.globString())\n    else this.store.set(fullpath, new Set([pattern.globString()]))\n  }\n}\n\n/**\n * A record of which paths have been matched in a given walk step,\n * and whether they only are considered a match if they are a directory,\n * and whether their absolute or relative path should be returned.\n */\nexport class MatchRecord {\n  store: Map<Path, number> = new Map()\n  add(target: Path, absolute: boolean, ifDir: boolean) {\n    const n = (absolute ? 2 : 0) | (ifDir ? 1 : 0)\n    const current = this.store.get(target)\n    this.store.set(target, current === undefined ? n : n & current)\n  }\n  // match, absolute, ifdir\n  entries(): [Path, boolean, boolean][] {\n    return [...this.store.entries()].map(([path, n]) => [\n      path,\n      !!(n & 2),\n      !!(n & 1),\n    ])\n  }\n}\n\n/**\n * A collection of patterns that must be processed in a subsequent step\n * for a given path.\n */\nexport class SubWalks {\n  store: Map<Path, Pattern[]> = new Map()\n  add(target: Path, pattern: Pattern) {\n    if (!target.canReaddir()) {\n      return\n    }\n    const subs = this.store.get(target)\n    if (subs) {\n      if (!subs.find(p => p.globString() === pattern.globString())) {\n        subs.push(pattern)\n      }\n    } else this.store.set(target, [pattern])\n  }\n  get(target: Path): Pattern[] {\n    const subs = this.store.get(target)\n    /* c8 ignore start */\n    if (!subs) {\n      throw new Error('attempting to walk unknown path')\n    }\n    /* c8 ignore stop */\n    return subs\n  }\n  entries(): [Path, Pattern[]][] {\n    return this.keys().map(k => [k, this.store.get(k) as Pattern[]])\n  }\n  keys(): Path[] {\n    return [...this.store.keys()].filter(t => t.canReaddir())\n  }\n}\n\n/**\n * The class that processes patterns for a given path.\n *\n * Handles child entry filtering, and determining whether a path's\n * directory contents must be read.\n */\nexport class Processor {\n  hasWalkedCache: HasWalkedCache\n  matches = new MatchRecord()\n  subwalks = new SubWalks()\n  patterns?: Pattern[]\n  follow: boolean\n  dot: boolean\n  opts: GlobWalkerOpts\n\n  constructor(opts: GlobWalkerOpts, hasWalkedCache?: HasWalkedCache) {\n    this.opts = opts\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.hasWalkedCache = hasWalkedCache\n      ? hasWalkedCache.copy()\n      : new HasWalkedCache()\n  }\n\n  processPatterns(target: Path, patterns: Pattern[]) {\n    this.patterns = patterns\n    const processingSet: [Path, Pattern][] = patterns.map(p => [target, p])\n\n    // map of paths to the magic-starting subwalks they need to walk\n    // first item in patterns is the filter\n\n    for (let [t, pattern] of processingSet) {\n      this.hasWalkedCache.storeWalked(t, pattern)\n\n      const root = pattern.root()\n      const absolute = pattern.isAbsolute() && this.opts.absolute !== false\n\n      // start absolute patterns at root\n      if (root) {\n        t = t.resolve(\n          root === '/' && this.opts.root !== undefined\n            ? this.opts.root\n            : root\n        )\n        const rest = pattern.rest()\n        if (!rest) {\n          this.matches.add(t, true, false)\n          continue\n        } else {\n          pattern = rest\n        }\n      }\n\n      if (t.isENOENT()) continue\n\n      let p: MMPattern\n      let rest: Pattern | null\n      let changed = false\n      while (\n        typeof (p = pattern.pattern()) === 'string' &&\n        (rest = pattern.rest())\n      ) {\n        const c = t.resolve(p)\n        t = c\n        pattern = rest\n        changed = true\n      }\n      p = pattern.pattern()\n      rest = pattern.rest()\n      if (changed) {\n        if (this.hasWalkedCache.hasWalked(t, pattern)) continue\n        this.hasWalkedCache.storeWalked(t, pattern)\n      }\n\n      // now we have either a final string for a known entry,\n      // more strings for an unknown entry,\n      // or a pattern starting with magic, mounted on t.\n      if (typeof p === 'string') {\n        // must not be final entry, otherwise we would have\n        // concatenated it earlier.\n        const ifDir = p === '..' || p === '' || p === '.'\n        this.matches.add(t.resolve(p), absolute, ifDir)\n        continue\n      } else if (p === GLOBSTAR) {\n        // if no rest, match and subwalk pattern\n        // if rest, process rest and subwalk pattern\n        // if it's a symlink, but we didn't get here by way of a\n        // globstar match (meaning it's the first time THIS globstar\n        // has traversed a symlink), then we follow it. Otherwise, stop.\n        if (\n          !t.isSymbolicLink() ||\n          this.follow ||\n          pattern.checkFollowGlobstar()\n        ) {\n          this.subwalks.add(t, pattern)\n        }\n        const rp = rest?.pattern()\n        const rrest = rest?.rest()\n        if (!rest || ((rp === '' || rp === '.') && !rrest)) {\n          // only HAS to be a dir if it ends in **/ or **/.\n          // but ending in ** will match files as well.\n          this.matches.add(t, absolute, rp === '' || rp === '.')\n        } else {\n          if (rp === '..') {\n            // this would mean you're matching **/.. at the fs root,\n            // and no thanks, I'm not gonna test that specific case.\n            /* c8 ignore start */\n            const tp = t.parent || t\n            /* c8 ignore stop */\n            if (!rrest) this.matches.add(tp, absolute, true)\n            else if (!this.hasWalkedCache.hasWalked(tp, rrest)) {\n              this.subwalks.add(tp, rrest)\n            }\n          }\n        }\n      } else if (p instanceof RegExp) {\n        this.subwalks.add(t, pattern)\n      }\n    }\n\n    return this\n  }\n\n  subwalkTargets(): Path[] {\n    return this.subwalks.keys()\n  }\n\n  child() {\n    return new Processor(this.opts, this.hasWalkedCache)\n  }\n\n  // return a new Processor containing the subwalks for each\n  // child entry, and a set of matches, and\n  // a hasWalkedCache that's a copy of this one\n  // then we're going to call\n  filterEntries(parent: Path, entries: Path[]): Processor {\n    const patterns = this.subwalks.get(parent)\n    // put matches and entry walks into the results processor\n    const results = this.child()\n    for (const e of entries) {\n      for (const pattern of patterns) {\n        const absolute = pattern.isAbsolute()\n        const p = pattern.pattern()\n        const rest = pattern.rest()\n        if (p === GLOBSTAR) {\n          results.testGlobstar(e, pattern, rest, absolute)\n        } else if (p instanceof RegExp) {\n          results.testRegExp(e, p, rest, absolute)\n        } else {\n          results.testString(e, p, rest, absolute)\n        }\n      }\n    }\n    return results\n  }\n\n  testGlobstar(\n    e: Path,\n    pattern: Pattern,\n    rest: Pattern | null,\n    absolute: boolean\n  ) {\n    if (this.dot || !e.name.startsWith('.')) {\n      if (!pattern.hasMore()) {\n        this.matches.add(e, absolute, false)\n      }\n      if (e.canReaddir()) {\n        // if we're in follow mode or it's not a symlink, just keep\n        // testing the same pattern. If there's more after the globstar,\n        // then this symlink consumes the globstar. If not, then we can\n        // follow at most ONE symlink along the way, so we mark it, which\n        // also checks to ensure that it wasn't already marked.\n        if (this.follow || !e.isSymbolicLink()) {\n          this.subwalks.add(e, pattern)\n        } else if (e.isSymbolicLink()) {\n          if (rest && pattern.checkFollowGlobstar()) {\n            this.subwalks.add(e, rest)\n          } else if (pattern.markFollowGlobstar()) {\n            this.subwalks.add(e, pattern)\n          }\n        }\n      }\n    }\n    // if the NEXT thing matches this entry, then also add\n    // the rest.\n    if (rest) {\n      const rp = rest.pattern()\n      if (\n        typeof rp === 'string' &&\n        // dots and empty were handled already\n        rp !== '..' &&\n        rp !== '' &&\n        rp !== '.'\n      ) {\n        this.testString(e, rp, rest.rest(), absolute)\n      } else if (rp === '..') {\n        /* c8 ignore start */\n        const ep = e.parent || e\n        /* c8 ignore stop */\n        this.subwalks.add(ep, rest)\n      } else if (rp instanceof RegExp) {\n        this.testRegExp(e, rp, rest.rest(), absolute)\n      }\n    }\n  }\n\n  testRegExp(\n    e: Path,\n    p: MMRegExp,\n    rest: Pattern | null,\n    absolute: boolean\n  ) {\n    if (!p.test(e.name)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n\n  testString(e: Path, p: string, rest: Pattern | null, absolute: boolean) {\n    // should never happen?\n    if (!e.isNamed(p)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/walker.d.ts b/deps/npm/node_modules/glob/dist/esm/walker.d.ts
similarity index 98%
rename from deps/npm/node_modules/glob/dist/mjs/walker.d.ts
rename to deps/npm/node_modules/glob/dist/esm/walker.d.ts
index 5c1a0414971b3a..dfbaf9b8681a55 100644
--- a/deps/npm/node_modules/glob/dist/mjs/walker.d.ts
+++ b/deps/npm/node_modules/glob/dist/esm/walker.d.ts
@@ -1,4 +1,4 @@
-/// <reference types="node" />
+/// <reference types="node" resolution-mode="require"/>
 /**
  * Single-use utility classes to provide functionality to the {@link Glob}
  * methods.
diff --git a/deps/npm/node_modules/glob/dist/esm/walker.d.ts.map b/deps/npm/node_modules/glob/dist/esm/walker.d.ts.map
new file mode 100644
index 00000000000000..7c8df20b2f323c
--- /dev/null
+++ b/deps/npm/node_modules/glob/dist/esm/walker.d.ts.map
@@ -0,0 +1 @@
+{"version":3,"file":"walker.d.ts","sourceRoot":"","sources":["../../src/walker.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAA;AAClC,OAAO,EAAU,UAAU,EAAE,MAAM,aAAa,CAAA;AAOhD,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AACtC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAE1C,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,kBAAkB,CAAC,EAAE,OAAO,CAAA;IAC5B,GAAG,CAAC,EAAE,MAAM,GAAG,GAAG,CAAA;IAClB,GAAG,CAAC,EAAE,OAAO,CAAA;IACb,WAAW,CAAC,EAAE,OAAO,CAAA;IACrB,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,UAAU,CAAA;IACvC,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,SAAS,CAAC,EAAE,OAAO,CAAA;IAGnB,QAAQ,CAAC,EAAE,MAAM,CAAA;IACjB,OAAO,CAAC,EAAE,OAAO,CAAA;IACjB,MAAM,CAAC,EAAE,OAAO,CAAA;IAChB,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,UAAU,CAAC,EAAE,OAAO,CAAA;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAA;IAC1B,KAAK,CAAC,EAAE,OAAO,CAAA;IACf,QAAQ,CAAC,EAAE,OAAO,CAAA;IAClB,IAAI,CAAC,EAAE,MAAM,CAAA;IACb,IAAI,CAAC,EAAE,OAAO,CAAA;IACd,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,oBAAoB,CAAC,EAAE,OAAO,CAAA;IAC9B,aAAa,CAAC,EAAE,OAAO,CAAA;CACxB;AAED,MAAM,MAAM,gBAAgB,GAAG,cAAc,GAAG;IAC9C,aAAa,EAAE,IAAI,CAAA;CACpB,CAAA;AACD,MAAM,MAAM,iBAAiB,GAAG,cAAc,GAAG;IAC/C,aAAa,EAAE,KAAK,CAAA;CACrB,CAAA;AACD,MAAM,MAAM,iBAAiB,GAAG,cAAc,GAAG;IAC/C,aAAa,CAAC,EAAE,SAAS,CAAA;CAC1B,CAAA;AAED,MAAM,MAAM,MAAM,CAAC,CAAC,SAAS,cAAc,IAAI,CAAC,SAAS,gBAAgB,GACrE,IAAI,GACJ,CAAC,SAAS,iBAAiB,GAC3B,MAAM,GACN,CAAC,SAAS,iBAAiB,GAC3B,MAAM,GACN,IAAI,GAAG,MAAM,CAAA;AAEjB,MAAM,MAAM,OAAO,CAAC,CAAC,SAAS,cAAc,IAAI,CAAC,SAAS,gBAAgB,GACtE,GAAG,CAAC,IAAI,CAAC,GACT,CAAC,SAAS,iBAAiB,GAC3B,GAAG,CAAC,MAAM,CAAC,GACX,CAAC,SAAS,iBAAiB,GAC3B,GAAG,CAAC,MAAM,CAAC,GACX,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAA;AAEtB,MAAM,MAAM,WAAW,CAAC,CAAC,SAAS,cAAc,IAC9C,CAAC,SAAS,gBAAgB,GACtB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GACpB,CAAC,SAAS,iBAAiB,GAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB,CAAC,SAAS,iBAAiB,GAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB,QAAQ,CAAC,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,MAAM,CAAC,CAAA;AAY5C;;GAEG;AACH,8BAAsB,QAAQ,CAAC,CAAC,SAAS,cAAc,GAAG,cAAc;;IACtE,IAAI,EAAE,IAAI,CAAA;IACV,QAAQ,EAAE,OAAO,EAAE,CAAA;IACnB,IAAI,EAAE,CAAC,CAAA;IACP,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAkB;IACjC,MAAM,EAAE,OAAO,CAAQ;IACvB,OAAO,EAAE,OAAO,CAAQ;IAIxB,MAAM,CAAC,EAAE,WAAW,CAAA;IACpB,QAAQ,EAAE,MAAM,CAAA;gBAEJ,QAAQ,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IA8BpD,KAAK;IAGL,MAAM;IAUN,QAAQ,CAAC,EAAE,EAAE,MAAM,GAAG;IAahB,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC;IAYpE,cAAc,CAAC,CAAC,EAAE,IAAI,GAAG,SAAS,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS;IAUrE,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,GAAG,SAAS;IAYzD,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI;IACtC,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI;IAE1C,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO;IAsBhC,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;IAKtE,SAAS,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI;IAK3D,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,MAAM,GAAG;IAOvD,OAAO,CACL,MAAM,EAAE,IAAI,EACZ,QAAQ,EAAE,OAAO,EAAE,EACnB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,MAAM,GAAG;IA2Cf,OAAO,CACL,MAAM,EAAE,IAAI,EACZ,OAAO,EAAE,IAAI,EAAE,EACf,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,MAAM,GAAG;IAsBf,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,MAAM,GAAG;IAO3D,WAAW,CACT,MAAM,EAAE,IAAI,EACZ,QAAQ,EAAE,OAAO,EAAE,EACnB,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,MAAM,GAAG;IAqCf,WAAW,CACT,MAAM,EAAE,IAAI,EACZ,OAAO,EAAE,IAAI,EAAE,EACf,SAAS,EAAE,SAAS,EACpB,EAAE,EAAE,MAAM,GAAG;CAoBhB;AAED,qBAAa,UAAU,CACrB,CAAC,SAAS,cAAc,GAAG,cAAc,CACzC,SAAQ,QAAQ,CAAC,CAAC,CAAC;IACnB,OAAO,EAAE,CAAC,SAAS,gBAAgB,GAC/B,GAAG,CAAC,IAAI,CAAC,GACT,CAAC,SAAS,iBAAiB,GAC3B,GAAG,CAAC,MAAM,CAAC,GACX,CAAC,SAAS,iBAAiB,GAC3B,GAAG,CAAC,MAAM,CAAC,GACX,GAAG,CAAC,IAAI,GAAG,MAAM,CAAC,CAAA;gBAEV,QAAQ,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAKpD,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI;IAKvB,IAAI,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAiBjC,QAAQ,IAAI,OAAO,CAAC,CAAC,CAAC;CAWvB;AAED,qBAAa,UAAU,CACrB,CAAC,SAAS,cAAc,GAAG,cAAc,CACzC,SAAQ,QAAQ,CAAC,CAAC,CAAC;IACnB,OAAO,EAAE,CAAC,SAAS,gBAAgB,GAC/B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,GACpB,CAAC,SAAS,iBAAiB,GAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB,CAAC,SAAS,iBAAiB,GAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,GACxB,QAAQ,CAAC,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,MAAM,CAAC,CAAA;gBAE9B,QAAQ,EAAE,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IAUpD,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI;IAM7B,MAAM,IAAI,WAAW,CAAC,CAAC,CAAC;IAYxB,UAAU,IAAI,WAAW,CAAC,CAAC,CAAC;CAO7B"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/walker.js b/deps/npm/node_modules/glob/dist/esm/walker.js
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/walker.js
rename to deps/npm/node_modules/glob/dist/esm/walker.js
diff --git a/deps/npm/node_modules/glob/dist/mjs/walker.js.map b/deps/npm/node_modules/glob/dist/esm/walker.js.map
similarity index 100%
rename from deps/npm/node_modules/glob/dist/mjs/walker.js.map
rename to deps/npm/node_modules/glob/dist/esm/walker.js.map
diff --git a/deps/npm/node_modules/glob/dist/mjs/glob.js.map b/deps/npm/node_modules/glob/dist/mjs/glob.js.map
deleted file mode 100644
index 94558c1d2c66a4..00000000000000
--- a/deps/npm/node_modules/glob/dist/mjs/glob.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"glob.js","sourceRoot":"","sources":["../../src/glob.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAoB,MAAM,WAAW,CAAA;AAEvD,OAAO,EAGL,UAAU,EACV,gBAAgB,EAChB,eAAe,EACf,eAAe,GAChB,MAAM,aAAa,CAAA;AACpB,OAAO,EAAE,aAAa,EAAE,MAAM,KAAK,CAAA;AAEnC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AACtC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAKpD,4CAA4C;AAC5C,gDAAgD;AAChD,MAAM,eAAe,GACnB,OAAO,OAAO,KAAK,QAAQ;IAC3B,OAAO;IACP,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;IAClC,CAAC,CAAC,OAAO,CAAC,QAAQ;IAClB,CAAC,CAAC,OAAO,CAAA;AAgTb;;GAEG;AACH,MAAM,OAAO,IAAI;IACf,QAAQ,CAAU;IAClB,GAAG,CAAQ;IACX,IAAI,CAAS;IACb,GAAG,CAAS;IACZ,WAAW,CAAS;IACpB,MAAM,CAAS;IACf,MAAM,CAAiC;IACvC,aAAa,CAAS;IACtB,IAAI,CAAU;IACd,SAAS,CAAS;IAClB,QAAQ,CAAQ;IAChB,OAAO,CAAS;IAChB,MAAM,CAAS;IACf,KAAK,CAAS;IACd,KAAK,CAAS;IACd,UAAU,CAAS;IACnB,OAAO,CAAU;IACjB,QAAQ,CAAiB;IACzB,QAAQ,CAAS;IACjB,MAAM,CAAY;IAClB,IAAI,CAAS;IACb,MAAM,CAAc;IACpB,oBAAoB,CAAS;IAC7B,aAAa,CAAiB;IAE9B;;OAEG;IACH,IAAI,CAAM;IAEV;;OAEG;IACH,QAAQ,CAAW;IAEnB;;;;;;;;;;;OAWG;IACH,YAAY,OAA0B,EAAE,IAAU;QAChD,qBAAqB;QACrB,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,SAAS,CAAC,uBAAuB,CAAC,CAAA;QACvD,oBAAoB;QACpB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAgC,CAAA;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QACzB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;QACrB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,CAAA;QACrC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QACvB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE;YACb,IAAI,CAAC,GAAG,GAAG,EAAE,CAAA;SACd;aAAM,IAAI,IAAI,CAAC,GAAG,YAAY,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE;YACpE,IAAI,CAAC,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;SACnC;QACD,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,EAAE,CAAA;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACrB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,aAAa,CAAA;QACzC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAA;QAC7B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;QACzB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAA;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAE7B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,UAAU,CAAA;QACnC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,CAAA;QACjC,IAAI,CAAC,QAAQ;YACX,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAA;QAC9D,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;QAEzB,IAAI,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE;YACrD,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;SAC9D;QAED,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;YAC/B,OAAO,GAAG,CAAC,OAAO,CAAC,CAAA;SACpB;QAED,IAAI,CAAC,oBAAoB;YACvB,CAAC,CAAC,IAAI,CAAC,oBAAoB;gBAC1B,IAAoB,CAAC,kBAAkB,KAAK,KAAK,CAAA;QAEpD,IAAI,IAAI,CAAC,oBAAoB,EAAE;YAC7B,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAA;SAClD;QAED,IAAI,IAAI,CAAC,SAAS,EAAE;YAClB,IAAI,IAAI,CAAC,UAAU,EAAE;gBACnB,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAA;aACvD;YACD,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAA;SAChE;QAED,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QAEtB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,IAAI,eAAe,CAAA;QAChD,IAAI,CAAC,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAA;QAChD,IAAI,IAAI,CAAC,MAAM,EAAE;YACf,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YACzB,IACE,IAAI,CAAC,MAAM,KAAK,SAAS;gBACzB,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,CAAC,MAAM,EAClC;gBACA,MAAM,IAAI,KAAK,CAAC,kDAAkD,CAAC,CAAA;aACpE;SACF;aAAM;YACL,MAAM,MAAM,GACV,IAAI,CAAC,QAAQ,KAAK,OAAO;gBACvB,CAAC,CAAC,eAAe;gBACjB,CAAC,CAAC,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBAC5B,CAAC,CAAC,gBAAgB;oBAClB,CAAC,CAAC,IAAI,CAAC,QAAQ;wBACf,CAAC,CAAC,eAAe;wBACjB,CAAC,CAAC,UAAU,CAAA;YAChB,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE;gBACjC,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,EAAE,EAAE,IAAI,CAAC,EAAE;aACZ,CAAC,CAAA;SACH;QACD,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAA;QAEhC,8DAA8D;QAC9D,0DAA0D;QAC1D,6DAA6D;QAC7D,kCAAkC;QAClC,MAAM,eAAe,GACnB,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,IAAI,CAAC,QAAQ,KAAK,OAAO,CAAA;QAEzD,MAAM,GAAG,GAAqB;YAC5B,mCAAmC;YACnC,GAAG,IAAI;YACP,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,eAAe;YACf,SAAS,EAAE,IAAI;YACf,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,QAAQ,EAAE,IAAI;YACd,iBAAiB,EAAE,CAAC;YACpB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,oBAAoB,EAAE,IAAI,CAAC,oBAAoB;YAC/C,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;SACzB,CAAA;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;QACxD,MAAM,CAAC,QAAQ,EAAE,SAAS,CAAC,GAAG,GAAG,CAAC,MAAM,CACtC,CAAC,GAA0B,EAAE,CAAC,EAAE,EAAE;YAChC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;YACrB,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,SAAS,CAAC,CAAA;YAC3B,OAAO,GAAG,CAAA;QACZ,CAAC,EACD,CAAC,EAAE,EAAE,EAAE,CAAC,CACT,CAAA;QACD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;YACtC,OAAO,IAAI,OAAO,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QACzD,CAAC,CAAC,CAAA;IACJ,CAAC;IAMD,KAAK,CAAC,IAAI;QACR,kEAAkE;QAClE,iEAAiE;QACjE,uEAAuE;QACvE,sCAAsC;QACtC,OAAO;YACL,GAAG,CAAC,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;gBACvD,GAAG,IAAI,CAAC,IAAI;gBACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;oBACzC,CAAC,CAAC,QAAQ;gBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC,IAAI,EAAE,CAAC;SACX,CAAA;IACH,CAAC;IAMD,QAAQ;QACN,OAAO;YACL,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;gBAChD,GAAG,IAAI,CAAC,IAAI;gBACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;oBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;oBACzC,CAAC,CAAC,QAAQ;gBACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,MAAM,EAAE,IAAI,CAAC,MAAM;aACpB,CAAC,CAAC,QAAQ,EAAE;SACd,CAAA;IACH,CAAC;IAMD,MAAM;QACJ,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpD,GAAG,IAAI,CAAC,IAAI;YACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;gBACzC,CAAC,CAAC,QAAQ;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,MAAM,EAAE,CAAA;IACb,CAAC;IAMD,UAAU;QACR,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE;YACpD,GAAG,IAAI,CAAC,IAAI;YACZ,QAAQ,EACN,IAAI,CAAC,QAAQ,KAAK,QAAQ;gBACxB,CAAC,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE;gBACzC,CAAC,CAAC,QAAQ;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,MAAM,EAAE,IAAI,CAAC,MAAM;SACpB,CAAC,CAAC,UAAU,EAAE,CAAA;IACjB,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAA;IAC7C,CAAC;IACD,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,WAAW,EAAE,CAAA;IAC3B,CAAC;IAED;;;OAGG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAA;IAC9C,CAAC;IACD,CAAC,MAAM,CAAC,aAAa,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,EAAE,CAAA;IACvB,CAAC;CACF","sourcesContent":["import { Minimatch, MinimatchOptions } from 'minimatch'\nimport { Minipass } from 'minipass'\nimport {\n  FSOption,\n  Path,\n  PathScurry,\n  PathScurryDarwin,\n  PathScurryPosix,\n  PathScurryWin32,\n} from 'path-scurry'\nimport { fileURLToPath } from 'url'\nimport { IgnoreLike } from './ignore.js'\nimport { Pattern } from './pattern.js'\nimport { GlobStream, GlobWalker } from './walker.js'\n\nexport type MatchSet = Minimatch['set']\nexport type GlobParts = Exclude<Minimatch['globParts'], undefined>\n\n// if no process global, just call it linux.\n// so we default to case-sensitive, / separators\nconst defaultPlatform: NodeJS.Platform =\n  typeof process === 'object' &&\n  process &&\n  typeof process.platform === 'string'\n    ? process.platform\n    : 'linux'\n\n/**\n * A `GlobOptions` object may be provided to any of the exported methods, and\n * must be provided to the `Glob` constructor.\n *\n * All options are optional, boolean, and false by default, unless otherwise\n * noted.\n *\n * All resolved options are added to the Glob object as properties.\n *\n * If you are running many `glob` operations, you can pass a Glob object as the\n * `options` argument to a subsequent operation to share the previously loaded\n * cache.\n */\nexport interface GlobOptions {\n  /**\n   * Set to `true` to always receive absolute paths for\n   * matched files. Set to `false` to always return relative paths.\n   *\n   * When this option is not set, absolute paths are returned for patterns\n   * that are absolute, and otherwise paths are returned that are relative\n   * to the `cwd` setting.\n   *\n   * This does _not_ make an extra system call to get\n   * the realpath, it only does string path resolution.\n   *\n   * Conflicts with {@link withFileTypes}\n   */\n  absolute?: boolean\n\n  /**\n   * Set to false to enable {@link windowsPathsNoEscape}\n   *\n   * @deprecated\n   */\n  allowWindowsEscape?: boolean\n\n  /**\n   * The current working directory in which to search. Defaults to\n   * `process.cwd()`.\n   *\n   * May be eiher a string path or a `file://` URL object or string.\n   */\n  cwd?: string | URL\n\n  /**\n   * Include `.dot` files in normal matches and `globstar`\n   * matches. Note that an explicit dot in a portion of the pattern\n   * will always match dot files.\n   */\n  dot?: boolean\n\n  /**\n   * Prepend all relative path strings with `./` (or `.\\` on Windows).\n   *\n   * Without this option, returned relative paths are \"bare\", so instead of\n   * returning `'./foo/bar'`, they are returned as `'foo/bar'`.\n   *\n   * Relative patterns starting with `'../'` are not prepended with `./`, even\n   * if this option is set.\n   */\n  dotRelative?: boolean\n\n  /**\n   * Follow symlinked directories when expanding `**`\n   * patterns. This can result in a lot of duplicate references in\n   * the presence of cyclic links, and make performance quite bad.\n   *\n   * By default, a `**` in a pattern will follow 1 symbolic link if\n   * it is not the first item in the pattern, or none if it is the\n   * first item in the pattern, following the same behavior as Bash.\n   */\n  follow?: boolean\n\n  /**\n   * string or string[], or an object with `ignore` and `ignoreChildren`\n   * methods.\n   *\n   * If a string or string[] is provided, then this is treated as a glob\n   * pattern or array of glob patterns to exclude from matches. To ignore all\n   * children within a directory, as well as the entry itself, append `'/**'`\n   * to the ignore pattern.\n   *\n   * **Note** `ignore` patterns are _always_ in `dot:true` mode, regardless of\n   * any other settings.\n   *\n   * If an object is provided that has `ignored(path)` and/or\n   * `childrenIgnored(path)` methods, then these methods will be called to\n   * determine whether any Path is a match or if its children should be\n   * traversed, respectively.\n   */\n  ignore?: string | string[] | IgnoreLike\n\n  /**\n   * Treat brace expansion like `{a,b}` as a \"magic\" pattern. Has no\n   * effect if {@link nobrace} is set.\n   *\n   * Only has effect on the {@link hasMagic} function.\n   */\n  magicalBraces?: boolean\n\n  /**\n   * Add a `/` character to directory matches. Note that this requires\n   * additional stat calls in some cases.\n   */\n  mark?: boolean\n\n  /**\n   * Perform a basename-only match if the pattern does not contain any slash\n   * characters. That is, `*.js` would be treated as equivalent to\n   * `**\\/*.js`, matching all js files in all directories.\n   */\n  matchBase?: boolean\n\n  /**\n   * Limit the directory traversal to a given depth below the cwd.\n   * Note that this does NOT prevent traversal to sibling folders,\n   * root patterns, and so on. It only limits the maximum folder depth\n   * that the walk will descend, relative to the cwd.\n   */\n  maxDepth?: number\n\n  /**\n   * Do not expand `{a,b}` and `{1..3}` brace sets.\n   */\n  nobrace?: boolean\n\n  /**\n   * Perform a case-insensitive match. This defaults to `true` on macOS and\n   * Windows systems, and `false` on all others.\n   *\n   * **Note** `nocase` should only be explicitly set when it is\n   * known that the filesystem's case sensitivity differs from the\n   * platform default. If set `true` on case-sensitive file\n   * systems, or `false` on case-insensitive file systems, then the\n   * walk may return more or less results than expected.\n   */\n  nocase?: boolean\n\n  /**\n   * Do not match directories, only files. (Note: to match\n   * _only_ directories, put a `/` at the end of the pattern.)\n   */\n  nodir?: boolean\n\n  /**\n   * Do not match \"extglob\" patterns such as `+(a|b)`.\n   */\n  noext?: boolean\n\n  /**\n   * Do not match `**` against multiple filenames. (Ie, treat it as a normal\n   * `*` instead.)\n   *\n   * Conflicts with {@link matchBase}\n   */\n  noglobstar?: boolean\n\n  /**\n   * Defaults to value of `process.platform` if available, or `'linux'` if\n   * not. Setting `platform:'win32'` on non-Windows systems may cause strange\n   * behavior.\n   */\n  platform?: NodeJS.Platform\n\n  /**\n   * Set to true to call `fs.realpath` on all of the\n   * results. In the case of an entry that cannot be resolved, the\n   * entry is omitted. This incurs a slight performance penalty, of\n   * course, because of the added system calls.\n   */\n  realpath?: boolean\n\n  /**\n   *\n   * A string path resolved against the `cwd` option, which\n   * is used as the starting point for absolute patterns that start\n   * with `/`, (but not drive letters or UNC paths on Windows).\n   *\n   * Note that this _doesn't_ necessarily limit the walk to the\n   * `root` directory, and doesn't affect the cwd starting point for\n   * non-absolute patterns. A pattern containing `..` will still be\n   * able to traverse out of the root directory, if it is not an\n   * actual root directory on the filesystem, and any non-absolute\n   * patterns will be matched in the `cwd`. For example, the\n   * pattern `/../*` with `{root:'/some/path'}` will return all\n   * files in `/some`, not all files in `/some/path`. The pattern\n   * `*` with `{root:'/some/path'}` will return all the entries in\n   * the cwd, not the entries in `/some/path`.\n   *\n   * To start absolute and non-absolute patterns in the same\n   * path, you can use `{root:''}`. However, be aware that on\n   * Windows systems, a pattern like `x:/*` or `//host/share/*` will\n   * _always_ start in the `x:/` or `//host/share` directory,\n   * regardless of the `root` setting.\n   */\n  root?: string\n\n  /**\n   * A [PathScurry](http://npm.im/path-scurry) object used\n   * to traverse the file system. If the `nocase` option is set\n   * explicitly, then any provided `scurry` object must match this\n   * setting.\n   */\n  scurry?: PathScurry\n\n  /**\n   * Call `lstat()` on all entries, whether required or not to determine\n   * if it's a valid match. When used with {@link withFileTypes}, this means\n   * that matches will include data such as modified time, permissions, and\n   * so on.  Note that this will incur a performance cost due to the added\n   * system calls.\n   */\n  stat?: boolean\n\n  /**\n   * An AbortSignal which will cancel the Glob walk when\n   * triggered.\n   */\n  signal?: AbortSignal\n\n  /**\n   * Use `\\\\` as a path separator _only_, and\n   *  _never_ as an escape character. If set, all `\\\\` characters are\n   *  replaced with `/` in the pattern.\n   *\n   *  Note that this makes it **impossible** to match against paths\n   *  containing literal glob pattern characters, but allows matching\n   *  with patterns constructed using `path.join()` and\n   *  `path.resolve()` on Windows platforms, mimicking the (buggy!)\n   *  behavior of Glob v7 and before on Windows. Please use with\n   *  caution, and be mindful of [the caveat below about Windows\n   *  paths](#windows). (For legacy reasons, this is also set if\n   *  `allowWindowsEscape` is set to the exact value `false`.)\n   */\n  windowsPathsNoEscape?: boolean\n\n  /**\n   * Return [PathScurry](http://npm.im/path-scurry)\n   * `Path` objects instead of strings. These are similar to a\n   * NodeJS `Dirent` object, but with additional methods and\n   * properties.\n   *\n   * Conflicts with {@link absolute}\n   */\n  withFileTypes?: boolean\n\n  /**\n   * An fs implementation to override some or all of the defaults.  See\n   * http://npm.im/path-scurry for details about what can be overridden.\n   */\n  fs?: FSOption\n\n  /**\n   * Just passed along to Minimatch.  Note that this makes all pattern\n   * matching operations slower and *extremely* noisy.\n   */\n  debug?: boolean\n\n  /**\n   * Return `/` delimited paths, even on Windows.\n   *\n   * On posix systems, this has no effect.  But, on Windows, it means that\n   * paths will be `/` delimited, and absolute paths will be their full\n   * resolved UNC forms, eg instead of `'C:\\\\foo\\\\bar'`, it would return\n   * `'//?/C:/foo/bar'`\n   */\n  posix?: boolean\n}\n\nexport type GlobOptionsWithFileTypesTrue = GlobOptions & {\n  withFileTypes: true\n  // string options not relevant if returning Path objects.\n  absolute?: undefined\n  mark?: undefined\n  posix?: undefined\n}\n\nexport type GlobOptionsWithFileTypesFalse = GlobOptions & {\n  withFileTypes?: false\n}\n\nexport type GlobOptionsWithFileTypesUnset = GlobOptions & {\n  withFileTypes?: undefined\n}\n\nexport type Result<Opts> = Opts extends GlobOptionsWithFileTypesTrue\n  ? Path\n  : Opts extends GlobOptionsWithFileTypesFalse\n  ? string\n  : Opts extends GlobOptionsWithFileTypesUnset\n  ? string\n  : string | Path\nexport type Results<Opts> = Result<Opts>[]\n\nexport type FileTypes<Opts> = Opts extends GlobOptionsWithFileTypesTrue\n  ? true\n  : Opts extends GlobOptionsWithFileTypesFalse\n  ? false\n  : Opts extends GlobOptionsWithFileTypesUnset\n  ? false\n  : boolean\n\n/**\n * An object that can perform glob pattern traversals.\n */\nexport class Glob<Opts extends GlobOptions> implements GlobOptions {\n  absolute?: boolean\n  cwd: string\n  root?: string\n  dot: boolean\n  dotRelative: boolean\n  follow: boolean\n  ignore?: string | string[] | IgnoreLike\n  magicalBraces: boolean\n  mark?: boolean\n  matchBase: boolean\n  maxDepth: number\n  nobrace: boolean\n  nocase: boolean\n  nodir: boolean\n  noext: boolean\n  noglobstar: boolean\n  pattern: string[]\n  platform: NodeJS.Platform\n  realpath: boolean\n  scurry: PathScurry\n  stat: boolean\n  signal?: AbortSignal\n  windowsPathsNoEscape: boolean\n  withFileTypes: FileTypes<Opts>\n\n  /**\n   * The options provided to the constructor.\n   */\n  opts: Opts\n\n  /**\n   * An array of parsed immutable {@link Pattern} objects.\n   */\n  patterns: Pattern[]\n\n  /**\n   * All options are stored as properties on the `Glob` object.\n   *\n   * See {@link GlobOptions} for full options descriptions.\n   *\n   * Note that a previous `Glob` object can be passed as the\n   * `GlobOptions` to another `Glob` instantiation to re-use settings\n   * and caches with a new pattern.\n   *\n   * Traversal functions can be called multiple times to run the walk\n   * again.\n   */\n  constructor(pattern: string | string[], opts: Opts) {\n    /* c8 ignore start */\n    if (!opts) throw new TypeError('glob options required')\n    /* c8 ignore stop */\n    this.withFileTypes = !!opts.withFileTypes as FileTypes<Opts>\n    this.signal = opts.signal\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.dotRelative = !!opts.dotRelative\n    this.nodir = !!opts.nodir\n    this.mark = !!opts.mark\n    if (!opts.cwd) {\n      this.cwd = ''\n    } else if (opts.cwd instanceof URL || opts.cwd.startsWith('file://')) {\n      opts.cwd = fileURLToPath(opts.cwd)\n    }\n    this.cwd = opts.cwd || ''\n    this.root = opts.root\n    this.magicalBraces = !!opts.magicalBraces\n    this.nobrace = !!opts.nobrace\n    this.noext = !!opts.noext\n    this.realpath = !!opts.realpath\n    this.absolute = opts.absolute\n\n    this.noglobstar = !!opts.noglobstar\n    this.matchBase = !!opts.matchBase\n    this.maxDepth =\n      typeof opts.maxDepth === 'number' ? opts.maxDepth : Infinity\n    this.stat = !!opts.stat\n    this.ignore = opts.ignore\n\n    if (this.withFileTypes && this.absolute !== undefined) {\n      throw new Error('cannot set absolute and withFileTypes:true')\n    }\n\n    if (typeof pattern === 'string') {\n      pattern = [pattern]\n    }\n\n    this.windowsPathsNoEscape =\n      !!opts.windowsPathsNoEscape ||\n      (opts as GlobOptions).allowWindowsEscape === false\n\n    if (this.windowsPathsNoEscape) {\n      pattern = pattern.map(p => p.replace(/\\\\/g, '/'))\n    }\n\n    if (this.matchBase) {\n      if (opts.noglobstar) {\n        throw new TypeError('base matching requires globstar')\n      }\n      pattern = pattern.map(p => (p.includes('/') ? p : `./**/${p}`))\n    }\n\n    this.pattern = pattern\n\n    this.platform = opts.platform || defaultPlatform\n    this.opts = { ...opts, platform: this.platform }\n    if (opts.scurry) {\n      this.scurry = opts.scurry\n      if (\n        opts.nocase !== undefined &&\n        opts.nocase !== opts.scurry.nocase\n      ) {\n        throw new Error('nocase option contradicts provided scurry option')\n      }\n    } else {\n      const Scurry =\n        opts.platform === 'win32'\n          ? PathScurryWin32\n          : opts.platform === 'darwin'\n          ? PathScurryDarwin\n          : opts.platform\n          ? PathScurryPosix\n          : PathScurry\n      this.scurry = new Scurry(this.cwd, {\n        nocase: opts.nocase,\n        fs: opts.fs,\n      })\n    }\n    this.nocase = this.scurry.nocase\n\n    // If you do nocase:true on a case-sensitive file system, then\n    // we need to use regexps instead of strings for non-magic\n    // path portions, because statting `aBc` won't return results\n    // for the file `AbC` for example.\n    const nocaseMagicOnly =\n      this.platform === 'darwin' || this.platform === 'win32'\n\n    const mmo: MinimatchOptions = {\n      // default nocase based on platform\n      ...opts,\n      dot: this.dot,\n      matchBase: this.matchBase,\n      nobrace: this.nobrace,\n      nocase: this.nocase,\n      nocaseMagicOnly,\n      nocomment: true,\n      noext: this.noext,\n      nonegate: true,\n      optimizationLevel: 2,\n      platform: this.platform,\n      windowsPathsNoEscape: this.windowsPathsNoEscape,\n      debug: !!this.opts.debug,\n    }\n\n    const mms = this.pattern.map(p => new Minimatch(p, mmo))\n    const [matchSet, globParts] = mms.reduce(\n      (set: [MatchSet, GlobParts], m) => {\n        set[0].push(...m.set)\n        set[1].push(...m.globParts)\n        return set\n      },\n      [[], []]\n    )\n    this.patterns = matchSet.map((set, i) => {\n      return new Pattern(set, globParts[i], 0, this.platform)\n    })\n  }\n\n  /**\n   * Returns a Promise that resolves to the results array.\n   */\n  async walk(): Promise<Results<Opts>>\n  async walk(): Promise<(string | Path)[]> {\n    // Walkers always return array of Path objects, so we just have to\n    // coerce them into the right shape.  It will have already called\n    // realpath() if the option was set to do so, so we know that's cached.\n    // start out knowing the cwd, at least\n    return [\n      ...(await new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity\n            ? this.maxDepth + this.scurry.cwd.depth()\n            : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n      }).walk()),\n    ]\n  }\n\n  /**\n   * synchronous {@link Glob.walk}\n   */\n  walkSync(): Results<Opts>\n  walkSync(): (string | Path)[] {\n    return [\n      ...new GlobWalker(this.patterns, this.scurry.cwd, {\n        ...this.opts,\n        maxDepth:\n          this.maxDepth !== Infinity\n            ? this.maxDepth + this.scurry.cwd.depth()\n            : Infinity,\n        platform: this.platform,\n        nocase: this.nocase,\n      }).walkSync(),\n    ]\n  }\n\n  /**\n   * Stream results asynchronously.\n   */\n  stream(): Minipass<Result<Opts>, Result<Opts>>\n  stream(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity\n          ? this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n    }).stream()\n  }\n\n  /**\n   * Stream results synchronously.\n   */\n  streamSync(): Minipass<Result<Opts>, Result<Opts>>\n  streamSync(): Minipass<string | Path, string | Path> {\n    return new GlobStream(this.patterns, this.scurry.cwd, {\n      ...this.opts,\n      maxDepth:\n        this.maxDepth !== Infinity\n          ? this.maxDepth + this.scurry.cwd.depth()\n          : Infinity,\n      platform: this.platform,\n      nocase: this.nocase,\n    }).streamSync()\n  }\n\n  /**\n   * Default sync iteration function. Returns a Generator that\n   * iterates over the results.\n   */\n  iterateSync(): Generator<Result<Opts>, void, void> {\n    return this.streamSync()[Symbol.iterator]()\n  }\n  [Symbol.iterator]() {\n    return this.iterateSync()\n  }\n\n  /**\n   * Default async iteration function. Returns an AsyncGenerator that\n   * iterates over the results.\n   */\n  iterate(): AsyncGenerator<Result<Opts>, void, void> {\n    return this.stream()[Symbol.asyncIterator]()\n  }\n  [Symbol.asyncIterator]() {\n    return this.iterate()\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/ignore.js.map b/deps/npm/node_modules/glob/dist/mjs/ignore.js.map
deleted file mode 100644
index 1038b712396eaf..00000000000000
--- a/deps/npm/node_modules/glob/dist/mjs/ignore.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"ignore.js","sourceRoot":"","sources":["../../src/ignore.ts"],"names":[],"mappings":"AAAA,sDAAsD;AACtD,kCAAkC;AAClC,kEAAkE;AAClE,6CAA6C;AAE7C,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAA;AAErC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAA;AAQtC,MAAM,eAAe,GACnB,OAAO,OAAO,KAAK,QAAQ;IAC3B,OAAO;IACP,OAAO,OAAO,CAAC,QAAQ,KAAK,QAAQ;IAClC,CAAC,CAAC,OAAO,CAAC,QAAQ;IAClB,CAAC,CAAC,OAAO,CAAA;AAEb;;GAEG;AACH,MAAM,OAAO,MAAM;IACjB,QAAQ,CAAa;IACrB,gBAAgB,CAAa;IAC7B,QAAQ,CAAa;IACrB,gBAAgB,CAAa;IAE7B,YACE,OAAiB,EACjB,EACE,OAAO,EACP,MAAM,EACN,KAAK,EACL,UAAU,EACV,QAAQ,GAAG,eAAe,GACX;QAEjB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAA;QAClB,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;QAC1B,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;QAC1B,MAAM,MAAM,GAAG;YACb,GAAG,EAAE,IAAI;YACT,OAAO;YACP,MAAM;YACN,KAAK;YACL,UAAU;YACV,iBAAiB,EAAE,CAAC;YACpB,QAAQ;YACR,SAAS,EAAE,IAAI;YACf,QAAQ,EAAE,IAAI;SACf,CAAA;QAED,mEAAmE;QACnE,gEAAgE;QAChE,mEAAmE;QACnE,uCAAuC;QACvC,mEAAmE;QACnE,qEAAqE;QACrE,uBAAuB;QACvB,uEAAuE;QACvE,oEAAoE;QACpE,qBAAqB;QACrB,sEAAsE;QACtE,wCAAwC;QACxC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE;YACzB,MAAM,EAAE,GAAG,IAAI,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;YACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACxB,MAAM,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;gBACjC,MAAM,CAAC,GAAG,IAAI,OAAO,CAAC,MAAM,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAA;gBACrD,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,EAAE,MAAM,CAAC,CAAA;gBAC/C,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAA;gBACzD,MAAM,QAAQ,GAAG,CAAC,CAAC,UAAU,EAAE,CAAA;gBAC/B,IAAI,QAAQ;oBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;oBAC9B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBAC1B,IAAI,QAAQ,EAAE;oBACZ,IAAI,QAAQ;wBAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;wBACtC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;iBACnC;aACF;SACF;IACH,CAAC;IAED,OAAO,CAAC,CAAO;QACb,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAA;QAC7B,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,CAAA;QAChC,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAA;QACpC,MAAM,SAAS,GAAG,GAAG,QAAQ,GAAG,CAAA;QAChC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;SACzD;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE;YAC7B,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC;gBAAE,OAAO,IAAI,CAAA;SACzD;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED,eAAe,CAAC,CAAO;QACrB,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAA;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,GAAG,GAAG,CAAA;QAC5C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACrC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;gBAAE,OAAO,IAAI,CAAA;SACnC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE;YACrC,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC;gBAAE,IAAI,CAAA;SAC5B;QACD,OAAO,KAAK,CAAA;IACd,CAAC;CACF","sourcesContent":["// give it a pattern, and it'll be able to tell you if\n// a given path should be ignored.\n// Ignoring a path ignores its children if the pattern ends in /**\n// Ignores are always parsed in dot:true mode\n\nimport { Minimatch } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\nexport interface IgnoreLike {\n  ignored?: (p: Path) => boolean\n  childrenIgnored?: (p: Path) => boolean\n}\n\nconst defaultPlatform: NodeJS.Platform =\n  typeof process === 'object' &&\n  process &&\n  typeof process.platform === 'string'\n    ? process.platform\n    : 'linux'\n\n/**\n * Class used to process ignored patterns\n */\nexport class Ignore implements IgnoreLike {\n  relative: Minimatch[]\n  relativeChildren: Minimatch[]\n  absolute: Minimatch[]\n  absoluteChildren: Minimatch[]\n\n  constructor(\n    ignored: string[],\n    {\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      platform = defaultPlatform,\n    }: GlobWalkerOpts\n  ) {\n    this.relative = []\n    this.absolute = []\n    this.relativeChildren = []\n    this.absoluteChildren = []\n    const mmopts = {\n      dot: true,\n      nobrace,\n      nocase,\n      noext,\n      noglobstar,\n      optimizationLevel: 2,\n      platform,\n      nocomment: true,\n      nonegate: true,\n    }\n\n    // this is a little weird, but it gives us a clean set of optimized\n    // minimatch matchers, without getting tripped up if one of them\n    // ends in /** inside a brace section, and it's only inefficient at\n    // the start of the walk, not along it.\n    // It'd be nice if the Pattern class just had a .test() method, but\n    // handling globstars is a bit of a pita, and that code already lives\n    // in minimatch anyway.\n    // Another way would be if maybe Minimatch could take its set/globParts\n    // as an option, and then we could at least just use Pattern to test\n    // for absolute-ness.\n    // Yet another way, Minimatch could take an array of glob strings, and\n    // a cwd option, and do the right thing.\n    for (const ign of ignored) {\n      const mm = new Minimatch(ign, mmopts)\n      for (let i = 0; i < mm.set.length; i++) {\n        const parsed = mm.set[i]\n        const globParts = mm.globParts[i]\n        const p = new Pattern(parsed, globParts, 0, platform)\n        const m = new Minimatch(p.globString(), mmopts)\n        const children = globParts[globParts.length - 1] === '**'\n        const absolute = p.isAbsolute()\n        if (absolute) this.absolute.push(m)\n        else this.relative.push(m)\n        if (children) {\n          if (absolute) this.absoluteChildren.push(m)\n          else this.relativeChildren.push(m)\n        }\n      }\n    }\n  }\n\n  ignored(p: Path): boolean {\n    const fullpath = p.fullpath()\n    const fullpaths = `${fullpath}/`\n    const relative = p.relative() || '.'\n    const relatives = `${relative}/`\n    for (const m of this.relative) {\n      if (m.match(relative) || m.match(relatives)) return true\n    }\n    for (const m of this.absolute) {\n      if (m.match(fullpath) || m.match(fullpaths)) return true\n    }\n    return false\n  }\n\n  childrenIgnored(p: Path): boolean {\n    const fullpath = p.fullpath() + '/'\n    const relative = (p.relative() || '.') + '/'\n    for (const m of this.relativeChildren) {\n      if (m.match(relative)) return true\n    }\n    for (const m of this.absoluteChildren) {\n      if (m.match(fullpath)) true\n    }\n    return false\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/dist/mjs/package.json b/deps/npm/node_modules/glob/dist/mjs/package.json
deleted file mode 100644
index 5cc80943d565b7..00000000000000
--- a/deps/npm/node_modules/glob/dist/mjs/package.json
+++ /dev/null
@@ -1,4 +0,0 @@
-{
-  "version": "10.3.3",
-  "type": "module"
-}
diff --git a/deps/npm/node_modules/glob/dist/mjs/processor.js.map b/deps/npm/node_modules/glob/dist/mjs/processor.js.map
deleted file mode 100644
index bf17d8e99b04a6..00000000000000
--- a/deps/npm/node_modules/glob/dist/mjs/processor.js.map
+++ /dev/null
@@ -1 +0,0 @@
-{"version":3,"file":"processor.js","sourceRoot":"","sources":["../../src/processor.ts"],"names":[],"mappings":"AAAA,qEAAqE;AAErE,OAAO,EAAE,QAAQ,EAAY,MAAM,WAAW,CAAA;AAK9C;;GAEG;AACH,MAAM,OAAO,cAAc;IACzB,KAAK,CAA0B;IAC/B,YAAY,QAAkC,IAAI,GAAG,EAAE;QACrD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,CAAC;IACD,IAAI;QACF,OAAO,IAAI,cAAc,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;IAChD,CAAC;IACD,SAAS,CAAC,MAAY,EAAE,OAAgB;QACtC,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;IACrE,CAAC;IACD,WAAW,CAAC,MAAY,EAAE,OAAgB;QACxC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAA;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACvC,IAAI,MAAM;YAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAA;;YACvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAA;IAChE,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,WAAW;IACtB,KAAK,GAAsB,IAAI,GAAG,EAAE,CAAA;IACpC,GAAG,CAAC,MAAY,EAAE,QAAiB,EAAE,KAAc;QACjD,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAA;IACjE,CAAC;IACD,yBAAyB;IACzB,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI;YACJ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACT,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACV,CAAC,CAAA;IACJ,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,QAAQ;IACnB,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAA;IACvC,GAAG,CAAC,MAAY,EAAE,OAAgB;QAChC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE;YACxB,OAAM;SACP;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,IAAI,IAAI,EAAE;YACR,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE;gBAC5D,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;aACnB;SACF;;YAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC,CAAA;IAC1C,CAAC;IACD,GAAG,CAAC,MAAY;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACnC,qBAAqB;QACrB,IAAI,CAAC,IAAI,EAAE;YACT,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAA;SACnD;QACD,oBAAoB;QACpB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAc,CAAC,CAAC,CAAA;IAClE,CAAC;IACD,IAAI;QACF,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAA;IAC3D,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,OAAO,SAAS;IACpB,cAAc,CAAgB;IAC9B,OAAO,GAAG,IAAI,WAAW,EAAE,CAAA;IAC3B,QAAQ,GAAG,IAAI,QAAQ,EAAE,CAAA;IACzB,QAAQ,CAAY;IACpB,MAAM,CAAS;IACf,GAAG,CAAS;IACZ,IAAI,CAAgB;IAEpB,YAAY,IAAoB,EAAE,cAA+B;QAC/D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAA;QAC3B,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAA;QACrB,IAAI,CAAC,cAAc,GAAG,cAAc;YAClC,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE;YACvB,CAAC,CAAC,IAAI,cAAc,EAAE,CAAA;IAC1B,CAAC;IAED,eAAe,CAAC,MAAY,EAAE,QAAmB;QAC/C,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,MAAM,aAAa,GAAsB,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAA;QAEvE,gEAAgE;QAChE,uCAAuC;QAEvC,KAAK,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,aAAa,EAAE;YACtC,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAE3C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;YAC3B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAA;YAErE,kCAAkC;YAClC,IAAI,IAAI,EAAE;gBACR,CAAC,GAAG,CAAC,CAAC,OAAO,CACX,IAAI,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS;oBAC1C,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;oBAChB,CAAC,CAAC,IAAI,CACT,CAAA;gBACD,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;gBAC3B,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;oBAChC,SAAQ;iBACT;qBAAM;oBACL,OAAO,GAAG,IAAI,CAAA;iBACf;aACF;YAED,IAAI,CAAC,CAAC,QAAQ,EAAE;gBAAE,SAAQ;YAE1B,IAAI,CAAY,CAAA;YAChB,IAAI,IAAoB,CAAA;YACxB,IAAI,OAAO,GAAG,KAAK,CAAA;YACnB,OACE,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAC,KAAK,QAAQ;gBAC3C,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EACvB;gBACA,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;gBACtB,sDAAsD;gBACtD,IAAI,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,IAAI;oBAAE,MAAK;gBACtC,CAAC,GAAG,CAAC,CAAA;gBACL,OAAO,GAAG,IAAI,CAAA;gBACd,OAAO,GAAG,IAAI,CAAA;aACf;YACD,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;YACrB,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;YACrB,IAAI,OAAO,EAAE;gBACX,IAAI,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC;oBAAE,SAAQ;gBACvD,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;aAC5C;YAED,uDAAuD;YACvD,qCAAqC;YACrC,kDAAkD;YAClD,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;gBACzB,sBAAsB;gBACtB,IAAI,CAAC,IAAI,EAAE;oBACT,MAAM,KAAK,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,GAAG,CAAA;oBACjD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;iBAChD;qBAAM;oBACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;gBACD,SAAQ;aACT;iBAAM,IAAI,CAAC,KAAK,QAAQ,EAAE;gBACzB,wCAAwC;gBACxC,4CAA4C;gBAC5C,wDAAwD;gBACxD,4DAA4D;gBAC5D,gEAAgE;gBAChE,IACE,CAAC,CAAC,CAAC,cAAc,EAAE;oBACnB,IAAI,CAAC,MAAM;oBACX,OAAO,CAAC,mBAAmB,EAAE,EAC7B;oBACA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;gBACD,MAAM,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,CAAA;gBAC1B,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,EAAE,CAAA;gBAC1B,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;oBAClD,iDAAiD;oBACjD,6CAA6C;oBAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,CAAC,CAAA;iBACvD;qBAAM;oBACL,IAAI,EAAE,KAAK,IAAI,EAAE;wBACf,wDAAwD;wBACxD,wDAAwD;wBACxD,qBAAqB;wBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;wBACxB,oBAAoB;wBACpB,IAAI,CAAC,KAAK;4BAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;6BAC3C,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE;4BAClD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAA;yBAC7B;qBACF;iBACF;aACF;iBAAM,IAAI,CAAC,YAAY,MAAM,EAAE;gBAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;aAC9B;SACF;QAED,OAAO,IAAI,CAAA;IACb,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAA;IAC7B,CAAC;IAED,KAAK;QACH,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,CAAA;IACtD,CAAC;IAED,0DAA0D;IAC1D,yCAAyC;IACzC,6CAA6C;IAC7C,2BAA2B;IAC3B,aAAa,CAAC,MAAY,EAAE,OAAe;QACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC1C,yDAAyD;QACzD,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAA;QAC5B,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE;YACvB,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;gBAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,EAAE,CAAA;gBACrC,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;gBAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAA;gBAC3B,IAAI,CAAC,KAAK,QAAQ,EAAE;oBAClB,OAAO,CAAC,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACjD;qBAAM,IAAI,CAAC,YAAY,MAAM,EAAE;oBAC9B,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACzC;qBAAM;oBACL,OAAO,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;iBACzC;aACF;SACF;QACD,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,YAAY,CACV,CAAO,EACP,OAAgB,EAChB,IAAoB,EACpB,QAAiB;QAEjB,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;YACvC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE;gBACtB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;aACrC;YACD,IAAI,CAAC,CAAC,UAAU,EAAE,EAAE;gBAClB,2DAA2D;gBAC3D,gEAAgE;gBAChE,+DAA+D;gBAC/D,iEAAiE;gBACjE,uDAAuD;gBACvD,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,cAAc,EAAE,EAAE;oBACtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;iBAC9B;qBAAM,IAAI,CAAC,CAAC,cAAc,EAAE,EAAE;oBAC7B,IAAI,IAAI,IAAI,OAAO,CAAC,mBAAmB,EAAE,EAAE;wBACzC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;qBAC3B;yBAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,EAAE;wBACvC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;qBAC9B;iBACF;aACF;SACF;QACD,sDAAsD;QACtD,YAAY;QACZ,IAAI,IAAI,EAAE;YACR,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAA;YACzB,IACE,OAAO,EAAE,KAAK,QAAQ;gBACtB,sCAAsC;gBACtC,EAAE,KAAK,IAAI;gBACX,EAAE,KAAK,EAAE;gBACT,EAAE,KAAK,GAAG,EACV;gBACA,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAA;aAC9C;iBAAM,IAAI,EAAE,KAAK,IAAI,EAAE;gBACtB,qBAAqB;gBACrB,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAA;gBACxB,oBAAoB;gBACpB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;aAC5B;iBAAM,IAAI,EAAE,YAAY,MAAM,EAAE;gBAC/B,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,QAAQ,CAAC,CAAA;aAC9C;SACF;IACH,CAAC;IAED,UAAU,CACR,CAAO,EACP,CAAW,EACX,IAAoB,EACpB,QAAiB;QAEjB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAM;QAC3B,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACrC;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;IAED,UAAU,CAAC,CAAO,EAAE,CAAS,EAAE,IAAoB,EAAE,QAAiB;QACpE,uBAAuB;QACvB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAM;QACzB,IAAI,CAAC,IAAI,EAAE;YACT,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAA;SACrC;aAAM;YACL,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;CACF","sourcesContent":["// synchronous utility for filtering entries and calculating subwalks\n\nimport { GLOBSTAR, MMRegExp } from 'minimatch'\nimport { Path } from 'path-scurry'\nimport { MMPattern, Pattern } from './pattern.js'\nimport { GlobWalkerOpts } from './walker.js'\n\n/**\n * A cache of which patterns have been processed for a given Path\n */\nexport class HasWalkedCache {\n  store: Map<string, Set<string>>\n  constructor(store: Map<string, Set<string>> = new Map()) {\n    this.store = store\n  }\n  copy() {\n    return new HasWalkedCache(new Map(this.store))\n  }\n  hasWalked(target: Path, pattern: Pattern) {\n    return this.store.get(target.fullpath())?.has(pattern.globString())\n  }\n  storeWalked(target: Path, pattern: Pattern) {\n    const fullpath = target.fullpath()\n    const cached = this.store.get(fullpath)\n    if (cached) cached.add(pattern.globString())\n    else this.store.set(fullpath, new Set([pattern.globString()]))\n  }\n}\n\n/**\n * A record of which paths have been matched in a given walk step,\n * and whether they only are considered a match if they are a directory,\n * and whether their absolute or relative path should be returned.\n */\nexport class MatchRecord {\n  store: Map<Path, number> = new Map()\n  add(target: Path, absolute: boolean, ifDir: boolean) {\n    const n = (absolute ? 2 : 0) | (ifDir ? 1 : 0)\n    const current = this.store.get(target)\n    this.store.set(target, current === undefined ? n : n & current)\n  }\n  // match, absolute, ifdir\n  entries(): [Path, boolean, boolean][] {\n    return [...this.store.entries()].map(([path, n]) => [\n      path,\n      !!(n & 2),\n      !!(n & 1),\n    ])\n  }\n}\n\n/**\n * A collection of patterns that must be processed in a subsequent step\n * for a given path.\n */\nexport class SubWalks {\n  store: Map<Path, Pattern[]> = new Map()\n  add(target: Path, pattern: Pattern) {\n    if (!target.canReaddir()) {\n      return\n    }\n    const subs = this.store.get(target)\n    if (subs) {\n      if (!subs.find(p => p.globString() === pattern.globString())) {\n        subs.push(pattern)\n      }\n    } else this.store.set(target, [pattern])\n  }\n  get(target: Path): Pattern[] {\n    const subs = this.store.get(target)\n    /* c8 ignore start */\n    if (!subs) {\n      throw new Error('attempting to walk unknown path')\n    }\n    /* c8 ignore stop */\n    return subs\n  }\n  entries(): [Path, Pattern[]][] {\n    return this.keys().map(k => [k, this.store.get(k) as Pattern[]])\n  }\n  keys(): Path[] {\n    return [...this.store.keys()].filter(t => t.canReaddir())\n  }\n}\n\n/**\n * The class that processes patterns for a given path.\n *\n * Handles child entry filtering, and determining whether a path's\n * directory contents must be read.\n */\nexport class Processor {\n  hasWalkedCache: HasWalkedCache\n  matches = new MatchRecord()\n  subwalks = new SubWalks()\n  patterns?: Pattern[]\n  follow: boolean\n  dot: boolean\n  opts: GlobWalkerOpts\n\n  constructor(opts: GlobWalkerOpts, hasWalkedCache?: HasWalkedCache) {\n    this.opts = opts\n    this.follow = !!opts.follow\n    this.dot = !!opts.dot\n    this.hasWalkedCache = hasWalkedCache\n      ? hasWalkedCache.copy()\n      : new HasWalkedCache()\n  }\n\n  processPatterns(target: Path, patterns: Pattern[]) {\n    this.patterns = patterns\n    const processingSet: [Path, Pattern][] = patterns.map(p => [target, p])\n\n    // map of paths to the magic-starting subwalks they need to walk\n    // first item in patterns is the filter\n\n    for (let [t, pattern] of processingSet) {\n      this.hasWalkedCache.storeWalked(t, pattern)\n\n      const root = pattern.root()\n      const absolute = pattern.isAbsolute() && this.opts.absolute !== false\n\n      // start absolute patterns at root\n      if (root) {\n        t = t.resolve(\n          root === '/' && this.opts.root !== undefined\n            ? this.opts.root\n            : root\n        )\n        const rest = pattern.rest()\n        if (!rest) {\n          this.matches.add(t, true, false)\n          continue\n        } else {\n          pattern = rest\n        }\n      }\n\n      if (t.isENOENT()) continue\n\n      let p: MMPattern\n      let rest: Pattern | null\n      let changed = false\n      while (\n        typeof (p = pattern.pattern()) === 'string' &&\n        (rest = pattern.rest())\n      ) {\n        const c = t.resolve(p)\n        // we can be reasonably sure that .. is a readable dir\n        if (c.isUnknown() && p !== '..') break\n        t = c\n        pattern = rest\n        changed = true\n      }\n      p = pattern.pattern()\n      rest = pattern.rest()\n      if (changed) {\n        if (this.hasWalkedCache.hasWalked(t, pattern)) continue\n        this.hasWalkedCache.storeWalked(t, pattern)\n      }\n\n      // now we have either a final string for a known entry,\n      // more strings for an unknown entry,\n      // or a pattern starting with magic, mounted on t.\n      if (typeof p === 'string') {\n        // must be final entry\n        if (!rest) {\n          const ifDir = p === '..' || p === '' || p === '.'\n          this.matches.add(t.resolve(p), absolute, ifDir)\n        } else {\n          this.subwalks.add(t, pattern)\n        }\n        continue\n      } else if (p === GLOBSTAR) {\n        // if no rest, match and subwalk pattern\n        // if rest, process rest and subwalk pattern\n        // if it's a symlink, but we didn't get here by way of a\n        // globstar match (meaning it's the first time THIS globstar\n        // has traversed a symlink), then we follow it. Otherwise, stop.\n        if (\n          !t.isSymbolicLink() ||\n          this.follow ||\n          pattern.checkFollowGlobstar()\n        ) {\n          this.subwalks.add(t, pattern)\n        }\n        const rp = rest?.pattern()\n        const rrest = rest?.rest()\n        if (!rest || ((rp === '' || rp === '.') && !rrest)) {\n          // only HAS to be a dir if it ends in **/ or **/.\n          // but ending in ** will match files as well.\n          this.matches.add(t, absolute, rp === '' || rp === '.')\n        } else {\n          if (rp === '..') {\n            // this would mean you're matching **/.. at the fs root,\n            // and no thanks, I'm not gonna test that specific case.\n            /* c8 ignore start */\n            const tp = t.parent || t\n            /* c8 ignore stop */\n            if (!rrest) this.matches.add(tp, absolute, true)\n            else if (!this.hasWalkedCache.hasWalked(tp, rrest)) {\n              this.subwalks.add(tp, rrest)\n            }\n          }\n        }\n      } else if (p instanceof RegExp) {\n        this.subwalks.add(t, pattern)\n      }\n    }\n\n    return this\n  }\n\n  subwalkTargets(): Path[] {\n    return this.subwalks.keys()\n  }\n\n  child() {\n    return new Processor(this.opts, this.hasWalkedCache)\n  }\n\n  // return a new Processor containing the subwalks for each\n  // child entry, and a set of matches, and\n  // a hasWalkedCache that's a copy of this one\n  // then we're going to call\n  filterEntries(parent: Path, entries: Path[]): Processor {\n    const patterns = this.subwalks.get(parent)\n    // put matches and entry walks into the results processor\n    const results = this.child()\n    for (const e of entries) {\n      for (const pattern of patterns) {\n        const absolute = pattern.isAbsolute()\n        const p = pattern.pattern()\n        const rest = pattern.rest()\n        if (p === GLOBSTAR) {\n          results.testGlobstar(e, pattern, rest, absolute)\n        } else if (p instanceof RegExp) {\n          results.testRegExp(e, p, rest, absolute)\n        } else {\n          results.testString(e, p, rest, absolute)\n        }\n      }\n    }\n    return results\n  }\n\n  testGlobstar(\n    e: Path,\n    pattern: Pattern,\n    rest: Pattern | null,\n    absolute: boolean\n  ) {\n    if (this.dot || !e.name.startsWith('.')) {\n      if (!pattern.hasMore()) {\n        this.matches.add(e, absolute, false)\n      }\n      if (e.canReaddir()) {\n        // if we're in follow mode or it's not a symlink, just keep\n        // testing the same pattern. If there's more after the globstar,\n        // then this symlink consumes the globstar. If not, then we can\n        // follow at most ONE symlink along the way, so we mark it, which\n        // also checks to ensure that it wasn't already marked.\n        if (this.follow || !e.isSymbolicLink()) {\n          this.subwalks.add(e, pattern)\n        } else if (e.isSymbolicLink()) {\n          if (rest && pattern.checkFollowGlobstar()) {\n            this.subwalks.add(e, rest)\n          } else if (pattern.markFollowGlobstar()) {\n            this.subwalks.add(e, pattern)\n          }\n        }\n      }\n    }\n    // if the NEXT thing matches this entry, then also add\n    // the rest.\n    if (rest) {\n      const rp = rest.pattern()\n      if (\n        typeof rp === 'string' &&\n        // dots and empty were handled already\n        rp !== '..' &&\n        rp !== '' &&\n        rp !== '.'\n      ) {\n        this.testString(e, rp, rest.rest(), absolute)\n      } else if (rp === '..') {\n        /* c8 ignore start */\n        const ep = e.parent || e\n        /* c8 ignore stop */\n        this.subwalks.add(ep, rest)\n      } else if (rp instanceof RegExp) {\n        this.testRegExp(e, rp, rest.rest(), absolute)\n      }\n    }\n  }\n\n  testRegExp(\n    e: Path,\n    p: MMRegExp,\n    rest: Pattern | null,\n    absolute: boolean\n  ) {\n    if (!p.test(e.name)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n\n  testString(e: Path, p: string, rest: Pattern | null, absolute: boolean) {\n    // should never happen?\n    if (!e.isNamed(p)) return\n    if (!rest) {\n      this.matches.add(e, absolute, false)\n    } else {\n      this.subwalks.add(e, rest)\n    }\n  }\n}\n"]}
\ No newline at end of file
diff --git a/deps/npm/node_modules/glob/package.json b/deps/npm/node_modules/glob/package.json
index 2d25985d2bbb5d..ae0dfae17460bc 100644
--- a/deps/npm/node_modules/glob/package.json
+++ b/deps/npm/node_modules/glob/package.json
@@ -2,27 +2,35 @@
   "author": "Isaac Z. Schlueter <i@izs.me> (https://blog.izs.me/)",
   "name": "glob",
   "description": "the most correct and second fastest glob implementation in JavaScript",
-  "version": "10.3.3",
-  "bin": "./dist/cjs/src/bin.js",
-  "repository": {
-    "type": "git",
-    "url": "git://github.com/isaacs/node-glob.git"
+  "version": "10.3.10",
+  "type": "module",
+  "tshy": {
+    "main": true,
+    "exports": {
+      "./package.json": "./package.json",
+      ".": "./src/index.ts"
+    }
   },
-  "main": "./dist/cjs/src/index.js",
-  "module": "./dist/mjs/index.js",
-  "types": "./dist/mjs/index.d.ts",
+  "bin": "./dist/esm/bin.mjs",
+  "main": "./dist/commonjs/index.js",
+  "types": "./dist/commonjs/index.d.ts",
   "exports": {
+    "./package.json": "./package.json",
     ".": {
       "import": {
-        "types": "./dist/mjs/index.d.ts",
-        "default": "./dist/mjs/index.js"
+        "types": "./dist/esm/index.d.ts",
+        "default": "./dist/esm/index.js"
       },
       "require": {
-        "types": "./dist/cjs/src/index.d.ts",
-        "default": "./dist/cjs/src/index.js"
+        "types": "./dist/commonjs/index.d.ts",
+        "default": "./dist/commonjs/index.js"
       }
     }
   },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/isaacs/node-glob.git"
+  },
   "files": [
     "dist"
   ],
@@ -30,14 +38,13 @@
     "preversion": "npm test",
     "postversion": "npm publish",
     "prepublishOnly": "git push origin --follow-tags",
-    "preprepare": "rm -rf dist",
-    "prepare": "tsc -p tsconfig.json && tsc -p tsconfig-esm.json && bash fixup.sh",
+    "prepare": "tshy",
     "pretest": "npm run prepare",
     "presnap": "npm run prepare",
-    "test": "c8 tap",
-    "snap": "c8 tap",
+    "test": "tap",
+    "snap": "tap",
     "format": "prettier --write . --loglevel warn",
-    "typedoc": "typedoc --tsconfig tsconfig-esm.json ./src/*.ts",
+    "typedoc": "typedoc --tsconfig .tshy/esm.json ./src/*.ts",
     "prepublish": "npm run benchclean",
     "profclean": "rm -f v8.log profile.txt",
     "test-regen": "npm run profclean && TEST_REGEN=1 node --no-warnings --loader ts-node/esm test/00-setup.ts",
@@ -45,7 +52,7 @@
     "bench": "bash benchmark.sh",
     "preprof": "npm run prepare",
     "prof": "bash prof.sh",
-    "benchclean": "node benchclean.js"
+    "benchclean": "node benchclean.cjs"
   },
   "prettier": {
     "semi": false,
@@ -60,33 +67,25 @@
   },
   "dependencies": {
     "foreground-child": "^3.1.0",
-    "jackspeak": "^2.0.3",
+    "jackspeak": "^2.3.5",
     "minimatch": "^9.0.1",
     "minipass": "^5.0.0 || ^6.0.2 || ^7.0.0",
     "path-scurry": "^1.10.1"
   },
   "devDependencies": {
     "@types/node": "^20.3.2",
-    "@types/tap": "^15.0.7",
-    "c8": "^7.12.0",
     "memfs": "^3.4.13",
-    "mkdirp": "^2.1.4",
+    "mkdirp": "^3.0.1",
     "prettier": "^2.8.3",
-    "rimraf": "^4.1.3",
-    "tap": "^16.3.4",
-    "ts-node": "^10.9.1",
-    "typedoc": "^0.23.24",
-    "typescript": "^4.9.4"
+    "rimraf": "^5.0.1",
+    "sync-content": "^1.0.2",
+    "tap": "^18.1.4",
+    "tshy": "^1.2.2",
+    "typedoc": "^0.25.1",
+    "typescript": "^5.2.2"
   },
   "tap": {
-    "before": "test/00-setup.ts",
-    "coverage": false,
-    "node-arg": [
-      "--no-warnings",
-      "--loader",
-      "ts-node/esm"
-    ],
-    "ts": false
+    "before": "test/00-setup.ts"
   },
   "license": "ISC",
   "funding": {
diff --git a/deps/npm/node_modules/hosted-git-info/lib/hosts.js b/deps/npm/node_modules/hosted-git-info/lib/hosts.js
index 013712b7842c8f..6dac685f42cef3 100644
--- a/deps/npm/node_modules/hosted-git-info/lib/hosts.js
+++ b/deps/npm/node_modules/hosted-git-info/lib/hosts.js
@@ -199,8 +199,7 @@ hosts.sourcehut = {
     `https://${domain}/${user}/${project}.git${maybeJoin('#', committish)}`,
   tarballtemplate: ({ domain, user, project, committish }) =>
     `https://${domain}/${user}/${project}/archive/${maybeEncode(committish) || 'HEAD'}.tar.gz`,
-  bugstemplate: ({ user, project }) =>
-    `https://todo.sr.ht/${user}/${project}`,
+  bugstemplate: ({ user, project }) => null,
   extract: (url) => {
     let [, user, project, aux] = url.pathname.split('/', 4)
 
diff --git a/deps/npm/node_modules/hosted-git-info/package.json b/deps/npm/node_modules/hosted-git-info/package.json
index 262a6c20fcf00b..c2e31fa52676a0 100644
--- a/deps/npm/node_modules/hosted-git-info/package.json
+++ b/deps/npm/node_modules/hosted-git-info/package.json
@@ -1,6 +1,6 @@
 {
   "name": "hosted-git-info",
-  "version": "7.0.0",
+  "version": "7.0.1",
   "description": "Provides metadata and conversions from repository urls for GitHub, Bitbucket and GitLab",
   "main": "./lib/index.js",
   "repository": {
diff --git a/deps/npm/node_modules/jackspeak/dist/cjs/index.js b/deps/npm/node_modules/jackspeak/dist/commonjs/index.js
similarity index 81%
rename from deps/npm/node_modules/jackspeak/dist/cjs/index.js
rename to deps/npm/node_modules/jackspeak/dist/commonjs/index.js
index f268e40e05afa9..956d6a275c3634 100644
--- a/deps/npm/node_modules/jackspeak/dist/cjs/index.js
+++ b/deps/npm/node_modules/jackspeak/dist/commonjs/index.js
@@ -42,7 +42,9 @@ const toEnvVal = (value, delim = '\n') => {
     return str;
 };
 const fromEnvVal = (env, type, multiple, delim = '\n') => (multiple
-    ? env.split(delim).map(v => fromEnvVal(v, type, false))
+    ? env
+        ? env.split(delim).map(v => fromEnvVal(v, type, false))
+        : []
     : type === 'string'
         ? env
         : type === 'boolean'
@@ -62,7 +64,9 @@ const valueType = (v) => typeof v === 'string'
             : Array.isArray(v)
                 ? joinTypes([...new Set(v.map(v => valueType(v)))]) + '[]'
                 : `${v.type}${v.multiple ? '[]' : ''}`;
-const joinTypes = (types) => types.length === 1 ? types[0] : `(${types.join('|')})`;
+const joinTypes = (types) => types.length === 1 && typeof types[0] === 'string'
+    ? types[0]
+    : `(${types.join('|')})`;
 const isValidValue = (v, type, multi) => {
     if (multi) {
         if (!Array.isArray(v))
@@ -190,6 +194,11 @@ const toParseArgsOptionsConfig = (options) => {
     const c = {};
     for (const longOption in options) {
         const config = options[longOption];
+        /* c8 ignore start */
+        if (!config) {
+            throw new Error('config must be an object: ' + longOption);
+        }
+        /* c8 ignore start */
         if ((0, exports.isConfigOption)(config, 'number', true)) {
             c[longOption] = {
                 type: 'string',
@@ -214,8 +223,9 @@ const toParseArgsOptionsConfig = (options) => {
                 default: conf.default,
             };
         }
+        const clo = c[longOption];
         if (typeof config.short === 'string') {
-            c[longOption].short = config.short;
+            clo.short = config.short;
         }
         if (config.type === 'boolean' &&
             !longOption.startsWith('no-') &&
@@ -243,6 +253,7 @@ class Jack {
     #envPrefix;
     #allowPositionals;
     #usage;
+    #usageMarkdown;
     constructor(options = {}) {
         this.#options = options;
         this.#allowPositionals = options.allowPositionals !== false;
@@ -270,6 +281,12 @@ class Jack {
         }
         for (const [field, value] of Object.entries(values)) {
             const my = this.#configSet[field];
+            // already validated, just for TS's benefit
+            /* c8 ignore start */
+            if (!my) {
+                throw new Error('unexpected field in config set: ' + field);
+            }
+            /* c8 ignore stop */
             my.default = value;
         }
         return this;
@@ -365,8 +382,9 @@ class Jack {
                 }
                 if (my.multiple) {
                     const pv = p.values;
-                    pv[token.name] = pv[token.name] ?? [];
-                    pv[token.name].push(value);
+                    const tn = pv[token.name] ?? [];
+                    pv[token.name] = tn;
+                    tn.push(value);
                 }
                 else {
                     const pv = p.values;
@@ -381,7 +399,7 @@ class Jack {
             }
         }
         for (const [field, value] of Object.entries(p.values)) {
-            const valid = this.#configSet[field].validate;
+            const valid = this.#configSet[field]?.validate;
             if (valid && !valid(value)) {
                 throw new Error(`Invalid value provided for --${field}: ${JSON.stringify(value)}`);
             }
@@ -389,6 +407,20 @@ class Jack {
         this.#writeEnv(p);
         return p;
     }
+    /**
+     * do not set fields as 'no-foo' if 'foo' exists and both are bools
+     * just set foo.
+     */
+    #noNoFields(f, val, s = f) {
+        if (!f.startsWith('no-') || typeof val !== 'boolean')
+            return;
+        const yes = f.substring('no-'.length);
+        // recurse so we get the core config key we care about.
+        this.#noNoFields(yes, val, s);
+        if (this.#configSet[yes]?.type === 'boolean') {
+            throw new Error(`do not set '${s}', instead set '${yes}' as desired.`);
+        }
+    }
     /**
      * Validate that any arbitrary object is a valid configuration `values`
      * object.  Useful when loading config files or other sources.
@@ -398,6 +430,7 @@ class Jack {
             throw new Error('Invalid config: not an object');
         }
         for (const field in o) {
+            this.#noNoFields(field, o[field]);
             const config = this.#configSet[field];
             if (!config) {
                 throw new Error(`Unknown config option: ${field}`);
@@ -418,17 +451,17 @@ class Jack {
             return;
         for (const [field, value] of Object.entries(p.values)) {
             const my = this.#configSet[field];
-            this.#env[toEnvKey(this.#envPrefix, field)] = toEnvVal(value, my.delim);
+            this.#env[toEnvKey(this.#envPrefix, field)] = toEnvVal(value, my?.delim);
         }
     }
     /**
      * Add a heading to the usage output banner
      */
-    heading(text, level) {
+    heading(text, level, { pre = false } = {}) {
         if (level === undefined) {
             level = this.#fields.some(r => isHeading(r)) ? 2 : 1;
         }
-        this.#fields.push({ type: 'heading', text, level });
+        this.#fields.push({ type: 'heading', text, level, pre });
         return this;
     }
     /**
@@ -555,7 +588,7 @@ class Jack {
             });
         }
         else {
-            const cmd = (0, node_path_1.basename)(process.argv[1]);
+            const cmd = (0, node_path_1.basename)(String(process.argv[1]));
             const shortFlags = [];
             const shorts = [];
             const flags = [];
@@ -586,12 +619,122 @@ class Jack {
         }
         ui.div({ padding: [0, 0, 0, 0], text: '' });
         const maybeDesc = this.#fields[start];
-        if (isDescription(maybeDesc)) {
+        if (maybeDesc && isDescription(maybeDesc)) {
             const print = normalize(maybeDesc.text, maybeDesc.pre);
             start++;
             ui.div({ padding: [0, 0, 0, 0], text: print });
             ui.div({ padding: [0, 0, 0, 0], text: '' });
         }
+        const { rows, maxWidth } = this.#usageRows(start);
+        // every heading/description after the first gets indented by 2
+        // extra spaces.
+        for (const row of rows) {
+            if (row.left) {
+                // If the row is too long, don't wrap it
+                // Bump the right-hand side down a line to make room
+                const configIndent = indent(Math.max(headingLevel, 2));
+                if (row.left.length > maxWidth - 3) {
+                    ui.div({ text: row.left, padding: [0, 0, 0, configIndent] });
+                    ui.div({ text: row.text, padding: [0, 0, 0, maxWidth] });
+                }
+                else {
+                    ui.div({
+                        text: row.left,
+                        padding: [0, 1, 0, configIndent],
+                        width: maxWidth,
+                    }, { padding: [0, 0, 0, 0], text: row.text });
+                }
+                if (row.skipLine) {
+                    ui.div({ padding: [0, 0, 0, 0], text: '' });
+                }
+            }
+            else {
+                if (isHeading(row)) {
+                    const { level } = row;
+                    headingLevel = level;
+                    // only h1 and h2 have bottom padding
+                    // h3-h6 do not
+                    const b = level <= 2 ? 1 : 0;
+                    ui.div({ ...row, padding: [0, 0, b, indent(level)] });
+                }
+                else {
+                    ui.div({ ...row, padding: [0, 0, 1, indent(headingLevel + 1)] });
+                }
+            }
+        }
+        return (this.#usage = ui.toString());
+    }
+    /**
+     * Return the usage banner markdown for the given configuration
+     */
+    usageMarkdown() {
+        if (this.#usageMarkdown)
+            return this.#usageMarkdown;
+        const out = [];
+        let headingLevel = 1;
+        const first = this.#fields[0];
+        let start = first?.type === 'heading' ? 1 : 0;
+        if (first?.type === 'heading') {
+            out.push(`# ${normalizeOneLine(first.text)}`);
+        }
+        out.push('Usage:');
+        if (this.#options.usage) {
+            out.push(normalizeMarkdown(this.#options.usage, true));
+        }
+        else {
+            const cmd = (0, node_path_1.basename)(String(process.argv[1]));
+            const shortFlags = [];
+            const shorts = [];
+            const flags = [];
+            const opts = [];
+            for (const [field, config] of Object.entries(this.#configSet)) {
+                if (config.short) {
+                    if (config.type === 'boolean')
+                        shortFlags.push(config.short);
+                    else
+                        shorts.push([config.short, config.hint || field]);
+                }
+                else {
+                    if (config.type === 'boolean')
+                        flags.push(field);
+                    else
+                        opts.push([field, config.hint || field]);
+                }
+            }
+            const sf = shortFlags.length ? ' -' + shortFlags.join('') : '';
+            const so = shorts.map(([k, v]) => ` --${k}=<${v}>`).join('');
+            const lf = flags.map(k => ` --${k}`).join('');
+            const lo = opts.map(([k, v]) => ` --${k}=<${v}>`).join('');
+            const usage = `${cmd}${sf}${so}${lf}${lo}`.trim();
+            out.push(normalizeMarkdown(usage, true));
+        }
+        const maybeDesc = this.#fields[start];
+        if (maybeDesc && isDescription(maybeDesc)) {
+            out.push(normalizeMarkdown(maybeDesc.text, maybeDesc.pre));
+            start++;
+        }
+        const { rows } = this.#usageRows(start);
+        // heading level in markdown is number of # ahead of text
+        for (const row of rows) {
+            if (row.left) {
+                out.push('#'.repeat(headingLevel + 1) +
+                    ' ' +
+                    normalizeOneLine(row.left, true));
+                if (row.text)
+                    out.push(normalizeMarkdown(row.text));
+            }
+            else if (isHeading(row)) {
+                const { level } = row;
+                headingLevel = level;
+                out.push(`${'#'.repeat(headingLevel)} ${normalizeOneLine(row.text, row.pre)}`);
+            }
+            else {
+                out.push(normalizeMarkdown(row.text, !!row.pre));
+            }
+        }
+        return (this.#usageMarkdown = out.join('\n\n') + '\n');
+    }
+    #usageRows(start) {
         // turn each config type into a row, and figure out the width of the
         // left hand indentation for the option descriptions.
         let maxMax = Math.max(12, Math.min(26, Math.floor(width / 3)));
@@ -639,43 +782,7 @@ class Jack {
             }
             rows.push(row);
         }
-        // every heading/description after the first gets indented by 2
-        // extra spaces.
-        for (const row of rows) {
-            if (row.left) {
-                // If the row is too long, don't wrap it
-                // Bump the right-hand side down a line to make room
-                const configIndent = indent(Math.max(headingLevel, 2));
-                if (row.left.length > maxWidth - 2) {
-                    ui.div({ text: row.left, padding: [0, 0, 0, configIndent] });
-                    ui.div({ text: row.text, padding: [0, 0, 0, maxWidth] });
-                }
-                else {
-                    ui.div({
-                        text: row.left,
-                        padding: [0, 1, 0, configIndent],
-                        width: maxWidth,
-                    }, { padding: [0, 0, 0, 0], text: row.text });
-                }
-                if (row.skipLine) {
-                    ui.div({ padding: [0, 0, 0, 0], text: '' });
-                }
-            }
-            else {
-                if (isHeading(row)) {
-                    const { level } = row;
-                    headingLevel = level;
-                    // only h1 and h2 have bottom padding
-                    // h3-h6 do not
-                    const b = level <= 2 ? 1 : 0;
-                    ui.div({ ...row, padding: [0, 0, b, indent(level)] });
-                }
-                else {
-                    ui.div({ ...row, padding: [0, 0, 1, indent(headingLevel + 1)] });
-                }
-            }
-        }
-        return (this.#usage = ui.toString());
+        return { rows, maxWidth };
     }
     /**
      * Return the configuration options as a plain object
@@ -688,7 +795,9 @@ class Jack {
                 ...(def.multiple ? { multiple: true } : {}),
                 ...(def.delim ? { delim: def.delim } : {}),
                 ...(def.short ? { short: def.short } : {}),
-                ...(def.description ? { description: def.description } : {}),
+                ...(def.description
+                    ? { description: normalize(def.description) }
+                    : {}),
                 ...(def.validate ? { validate: def.validate } : {}),
                 ...(def.default !== undefined ? { default: def.default } : {}),
             },
@@ -705,8 +814,11 @@ exports.Jack = Jack;
 // Unwrap and un-indent, so we can wrap description
 // strings however makes them look nice in the code.
 const normalize = (s, pre = false) => pre
-    // prepend a ZWSP to each line so cliui doesn't strip it.
-    ? s.split('\n').map(l => `\u200b${l}`).join('\n')
+    ? // prepend a ZWSP to each line so cliui doesn't strip it.
+        s
+            .split('\n')
+            .map(l => `\u200b${l}`)
+            .join('\n')
     : s
         // remove single line breaks, except for lists
         .replace(/([^\n])\n[ \t]*([^\n])/g, (_, $1, $2) => !/^[-*]/.test($2) ? `${$1} ${$2}` : `${$1}\n${$2}`)
@@ -714,7 +826,22 @@ const normalize = (s, pre = false) => pre
         .replace(/([^\n])[ \t]+([^\n])/g, '$1 $2')
         // two line breaks are enough
         .replace(/\n{3,}/g, '\n\n')
+        // remove any spaces at the start of a line
+        .replace(/\n[ \t]+/g, '\n')
+        .trim();
+// normalize for markdown printing, remove leading spaces on lines
+const normalizeMarkdown = (s, pre = false) => {
+    const n = normalize(s, pre).replace(/\\/g, '\\\\');
+    return pre
+        ? `\`\`\`\n${n.replace(/\u200b/g, '')}\n\`\`\``
+        : n.replace(/\n +/g, '\n').trim();
+};
+const normalizeOneLine = (s, pre = false) => {
+    const n = normalize(s, pre)
+        .replace(/[\s\u200b]+/g, ' ')
         .trim();
+    return pre ? `\`${n}\`` : n;
+};
 /**
  * Main entry point. Create and return a {@link Jack} object.
  */
diff --git a/deps/npm/node_modules/jackspeak/dist/commonjs/package.json b/deps/npm/node_modules/jackspeak/dist/commonjs/package.json
new file mode 100644
index 00000000000000..0292b9956f2e40
--- /dev/null
+++ b/deps/npm/node_modules/jackspeak/dist/commonjs/package.json
@@ -0,0 +1 @@
+{"type":"commonjs"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/jackspeak/dist/cjs/parse-args.js b/deps/npm/node_modules/jackspeak/dist/commonjs/parse-args.js
similarity index 84%
rename from deps/npm/node_modules/jackspeak/dist/cjs/parse-args.js
rename to deps/npm/node_modules/jackspeak/dist/commonjs/parse-args.js
index 471b4d97dc9960..ab628be8c9d5cc 100644
--- a/deps/npm/node_modules/jackspeak/dist/cjs/parse-args.js
+++ b/deps/npm/node_modules/jackspeak/dist/commonjs/parse-args.js
@@ -34,9 +34,17 @@ const pvs = pv
     .replace(/^v/, '')
     .split('.')
     .map(s => parseInt(s, 10));
+/* c8 ignore start */
+const [major = 0, minor = 0] = pvs;
+/* c8 ignore stop */
 let { parseArgs: pa } = util;
-if (!pa || pvs[0] > 18 || pvs[1] < 11) {
+/* c8 ignore start */
+if (!pa ||
+    major < 16 ||
+    (major === 18 && minor < 11) ||
+    (major === 16 && minor < 19)) {
+    /* c8 ignore stop */
     pa = require('@pkgjs/parseargs').parseArgs;
 }
 exports.parseArgs = pa;
-//# sourceMappingURL=parse-args-cjs.js.map
\ No newline at end of file
+//# sourceMappingURL=parse-args-cjs.cjs.map
\ No newline at end of file
diff --git a/deps/npm/node_modules/jackspeak/dist/mjs/index.js b/deps/npm/node_modules/jackspeak/dist/esm/index.js
similarity index 81%
rename from deps/npm/node_modules/jackspeak/dist/mjs/index.js
rename to deps/npm/node_modules/jackspeak/dist/esm/index.js
index a3e2b6bab7cbb9..9914049f890269 100644
--- a/deps/npm/node_modules/jackspeak/dist/mjs/index.js
+++ b/deps/npm/node_modules/jackspeak/dist/esm/index.js
@@ -36,7 +36,9 @@ const toEnvVal = (value, delim = '\n') => {
     return str;
 };
 const fromEnvVal = (env, type, multiple, delim = '\n') => (multiple
-    ? env.split(delim).map(v => fromEnvVal(v, type, false))
+    ? env
+        ? env.split(delim).map(v => fromEnvVal(v, type, false))
+        : []
     : type === 'string'
         ? env
         : type === 'boolean'
@@ -55,7 +57,9 @@ const valueType = (v) => typeof v === 'string'
             : Array.isArray(v)
                 ? joinTypes([...new Set(v.map(v => valueType(v)))]) + '[]'
                 : `${v.type}${v.multiple ? '[]' : ''}`;
-const joinTypes = (types) => types.length === 1 ? types[0] : `(${types.join('|')})`;
+const joinTypes = (types) => types.length === 1 && typeof types[0] === 'string'
+    ? types[0]
+    : `(${types.join('|')})`;
 const isValidValue = (v, type, multi) => {
     if (multi) {
         if (!Array.isArray(v))
@@ -182,6 +186,11 @@ const toParseArgsOptionsConfig = (options) => {
     const c = {};
     for (const longOption in options) {
         const config = options[longOption];
+        /* c8 ignore start */
+        if (!config) {
+            throw new Error('config must be an object: ' + longOption);
+        }
+        /* c8 ignore start */
         if (isConfigOption(config, 'number', true)) {
             c[longOption] = {
                 type: 'string',
@@ -206,8 +215,9 @@ const toParseArgsOptionsConfig = (options) => {
                 default: conf.default,
             };
         }
+        const clo = c[longOption];
         if (typeof config.short === 'string') {
-            c[longOption].short = config.short;
+            clo.short = config.short;
         }
         if (config.type === 'boolean' &&
             !longOption.startsWith('no-') &&
@@ -235,6 +245,7 @@ export class Jack {
     #envPrefix;
     #allowPositionals;
     #usage;
+    #usageMarkdown;
     constructor(options = {}) {
         this.#options = options;
         this.#allowPositionals = options.allowPositionals !== false;
@@ -262,6 +273,12 @@ export class Jack {
         }
         for (const [field, value] of Object.entries(values)) {
             const my = this.#configSet[field];
+            // already validated, just for TS's benefit
+            /* c8 ignore start */
+            if (!my) {
+                throw new Error('unexpected field in config set: ' + field);
+            }
+            /* c8 ignore stop */
             my.default = value;
         }
         return this;
@@ -357,8 +374,9 @@ export class Jack {
                 }
                 if (my.multiple) {
                     const pv = p.values;
-                    pv[token.name] = pv[token.name] ?? [];
-                    pv[token.name].push(value);
+                    const tn = pv[token.name] ?? [];
+                    pv[token.name] = tn;
+                    tn.push(value);
                 }
                 else {
                     const pv = p.values;
@@ -373,7 +391,7 @@ export class Jack {
             }
         }
         for (const [field, value] of Object.entries(p.values)) {
-            const valid = this.#configSet[field].validate;
+            const valid = this.#configSet[field]?.validate;
             if (valid && !valid(value)) {
                 throw new Error(`Invalid value provided for --${field}: ${JSON.stringify(value)}`);
             }
@@ -381,6 +399,20 @@ export class Jack {
         this.#writeEnv(p);
         return p;
     }
+    /**
+     * do not set fields as 'no-foo' if 'foo' exists and both are bools
+     * just set foo.
+     */
+    #noNoFields(f, val, s = f) {
+        if (!f.startsWith('no-') || typeof val !== 'boolean')
+            return;
+        const yes = f.substring('no-'.length);
+        // recurse so we get the core config key we care about.
+        this.#noNoFields(yes, val, s);
+        if (this.#configSet[yes]?.type === 'boolean') {
+            throw new Error(`do not set '${s}', instead set '${yes}' as desired.`);
+        }
+    }
     /**
      * Validate that any arbitrary object is a valid configuration `values`
      * object.  Useful when loading config files or other sources.
@@ -390,6 +422,7 @@ export class Jack {
             throw new Error('Invalid config: not an object');
         }
         for (const field in o) {
+            this.#noNoFields(field, o[field]);
             const config = this.#configSet[field];
             if (!config) {
                 throw new Error(`Unknown config option: ${field}`);
@@ -410,17 +443,17 @@ export class Jack {
             return;
         for (const [field, value] of Object.entries(p.values)) {
             const my = this.#configSet[field];
-            this.#env[toEnvKey(this.#envPrefix, field)] = toEnvVal(value, my.delim);
+            this.#env[toEnvKey(this.#envPrefix, field)] = toEnvVal(value, my?.delim);
         }
     }
     /**
      * Add a heading to the usage output banner
      */
-    heading(text, level) {
+    heading(text, level, { pre = false } = {}) {
         if (level === undefined) {
             level = this.#fields.some(r => isHeading(r)) ? 2 : 1;
         }
-        this.#fields.push({ type: 'heading', text, level });
+        this.#fields.push({ type: 'heading', text, level, pre });
         return this;
     }
     /**
@@ -547,7 +580,7 @@ export class Jack {
             });
         }
         else {
-            const cmd = basename(process.argv[1]);
+            const cmd = basename(String(process.argv[1]));
             const shortFlags = [];
             const shorts = [];
             const flags = [];
@@ -578,12 +611,122 @@ export class Jack {
         }
         ui.div({ padding: [0, 0, 0, 0], text: '' });
         const maybeDesc = this.#fields[start];
-        if (isDescription(maybeDesc)) {
+        if (maybeDesc && isDescription(maybeDesc)) {
             const print = normalize(maybeDesc.text, maybeDesc.pre);
             start++;
             ui.div({ padding: [0, 0, 0, 0], text: print });
             ui.div({ padding: [0, 0, 0, 0], text: '' });
         }
+        const { rows, maxWidth } = this.#usageRows(start);
+        // every heading/description after the first gets indented by 2
+        // extra spaces.
+        for (const row of rows) {
+            if (row.left) {
+                // If the row is too long, don't wrap it
+                // Bump the right-hand side down a line to make room
+                const configIndent = indent(Math.max(headingLevel, 2));
+                if (row.left.length > maxWidth - 3) {
+                    ui.div({ text: row.left, padding: [0, 0, 0, configIndent] });
+                    ui.div({ text: row.text, padding: [0, 0, 0, maxWidth] });
+                }
+                else {
+                    ui.div({
+                        text: row.left,
+                        padding: [0, 1, 0, configIndent],
+                        width: maxWidth,
+                    }, { padding: [0, 0, 0, 0], text: row.text });
+                }
+                if (row.skipLine) {
+                    ui.div({ padding: [0, 0, 0, 0], text: '' });
+                }
+            }
+            else {
+                if (isHeading(row)) {
+                    const { level } = row;
+                    headingLevel = level;
+                    // only h1 and h2 have bottom padding
+                    // h3-h6 do not
+                    const b = level <= 2 ? 1 : 0;
+                    ui.div({ ...row, padding: [0, 0, b, indent(level)] });
+                }
+                else {
+                    ui.div({ ...row, padding: [0, 0, 1, indent(headingLevel + 1)] });
+                }
+            }
+        }
+        return (this.#usage = ui.toString());
+    }
+    /**
+     * Return the usage banner markdown for the given configuration
+     */
+    usageMarkdown() {
+        if (this.#usageMarkdown)
+            return this.#usageMarkdown;
+        const out = [];
+        let headingLevel = 1;
+        const first = this.#fields[0];
+        let start = first?.type === 'heading' ? 1 : 0;
+        if (first?.type === 'heading') {
+            out.push(`# ${normalizeOneLine(first.text)}`);
+        }
+        out.push('Usage:');
+        if (this.#options.usage) {
+            out.push(normalizeMarkdown(this.#options.usage, true));
+        }
+        else {
+            const cmd = basename(String(process.argv[1]));
+            const shortFlags = [];
+            const shorts = [];
+            const flags = [];
+            const opts = [];
+            for (const [field, config] of Object.entries(this.#configSet)) {
+                if (config.short) {
+                    if (config.type === 'boolean')
+                        shortFlags.push(config.short);
+                    else
+                        shorts.push([config.short, config.hint || field]);
+                }
+                else {
+                    if (config.type === 'boolean')
+                        flags.push(field);
+                    else
+                        opts.push([field, config.hint || field]);
+                }
+            }
+            const sf = shortFlags.length ? ' -' + shortFlags.join('') : '';
+            const so = shorts.map(([k, v]) => ` --${k}=<${v}>`).join('');
+            const lf = flags.map(k => ` --${k}`).join('');
+            const lo = opts.map(([k, v]) => ` --${k}=<${v}>`).join('');
+            const usage = `${cmd}${sf}${so}${lf}${lo}`.trim();
+            out.push(normalizeMarkdown(usage, true));
+        }
+        const maybeDesc = this.#fields[start];
+        if (maybeDesc && isDescription(maybeDesc)) {
+            out.push(normalizeMarkdown(maybeDesc.text, maybeDesc.pre));
+            start++;
+        }
+        const { rows } = this.#usageRows(start);
+        // heading level in markdown is number of # ahead of text
+        for (const row of rows) {
+            if (row.left) {
+                out.push('#'.repeat(headingLevel + 1) +
+                    ' ' +
+                    normalizeOneLine(row.left, true));
+                if (row.text)
+                    out.push(normalizeMarkdown(row.text));
+            }
+            else if (isHeading(row)) {
+                const { level } = row;
+                headingLevel = level;
+                out.push(`${'#'.repeat(headingLevel)} ${normalizeOneLine(row.text, row.pre)}`);
+            }
+            else {
+                out.push(normalizeMarkdown(row.text, !!row.pre));
+            }
+        }
+        return (this.#usageMarkdown = out.join('\n\n') + '\n');
+    }
+    #usageRows(start) {
         // turn each config type into a row, and figure out the width of the
         // left hand indentation for the option descriptions.
         let maxMax = Math.max(12, Math.min(26, Math.floor(width / 3)));
@@ -631,43 +774,7 @@ export class Jack {
             }
             rows.push(row);
         }
-        // every heading/description after the first gets indented by 2
-        // extra spaces.
-        for (const row of rows) {
-            if (row.left) {
-                // If the row is too long, don't wrap it
-                // Bump the right-hand side down a line to make room
-                const configIndent = indent(Math.max(headingLevel, 2));
-                if (row.left.length > maxWidth - 2) {
-                    ui.div({ text: row.left, padding: [0, 0, 0, configIndent] });
-                    ui.div({ text: row.text, padding: [0, 0, 0, maxWidth] });
-                }
-                else {
-                    ui.div({
-                        text: row.left,
-                        padding: [0, 1, 0, configIndent],
-                        width: maxWidth,
-                    }, { padding: [0, 0, 0, 0], text: row.text });
-                }
-                if (row.skipLine) {
-                    ui.div({ padding: [0, 0, 0, 0], text: '' });
-                }
-            }
-            else {
-                if (isHeading(row)) {
-                    const { level } = row;
-                    headingLevel = level;
-                    // only h1 and h2 have bottom padding
-                    // h3-h6 do not
-                    const b = level <= 2 ? 1 : 0;
-                    ui.div({ ...row, padding: [0, 0, b, indent(level)] });
-                }
-                else {
-                    ui.div({ ...row, padding: [0, 0, 1, indent(headingLevel + 1)] });
-                }
-            }
-        }
-        return (this.#usage = ui.toString());
+        return { rows, maxWidth };
     }
     /**
      * Return the configuration options as a plain object
@@ -680,7 +787,9 @@ export class Jack {
                 ...(def.multiple ? { multiple: true } : {}),
                 ...(def.delim ? { delim: def.delim } : {}),
                 ...(def.short ? { short: def.short } : {}),
-                ...(def.description ? { description: def.description } : {}),
+                ...(def.description
+                    ? { description: normalize(def.description) }
+                    : {}),
                 ...(def.validate ? { validate: def.validate } : {}),
                 ...(def.default !== undefined ? { default: def.default } : {}),
             },
@@ -696,8 +805,11 @@ export class Jack {
 // Unwrap and un-indent, so we can wrap description
 // strings however makes them look nice in the code.
 const normalize = (s, pre = false) => pre
-    // prepend a ZWSP to each line so cliui doesn't strip it.
-    ? s.split('\n').map(l => `\u200b${l}`).join('\n')
+    ? // prepend a ZWSP to each line so cliui doesn't strip it.
+        s
+            .split('\n')
+            .map(l => `\u200b${l}`)
+            .join('\n')
     : s
         // remove single line breaks, except for lists
         .replace(/([^\n])\n[ \t]*([^\n])/g, (_, $1, $2) => !/^[-*]/.test($2) ? `${$1} ${$2}` : `${$1}\n${$2}`)
@@ -705,7 +817,22 @@ const normalize = (s, pre = false) => pre
         .replace(/([^\n])[ \t]+([^\n])/g, '$1 $2')
         // two line breaks are enough
         .replace(/\n{3,}/g, '\n\n')
+        // remove any spaces at the start of a line
+        .replace(/\n[ \t]+/g, '\n')
+        .trim();
+// normalize for markdown printing, remove leading spaces on lines
+const normalizeMarkdown = (s, pre = false) => {
+    const n = normalize(s, pre).replace(/\\/g, '\\\\');
+    return pre
+        ? `\`\`\`\n${n.replace(/\u200b/g, '')}\n\`\`\``
+        : n.replace(/\n +/g, '\n').trim();
+};
+const normalizeOneLine = (s, pre = false) => {
+    const n = normalize(s, pre)
+        .replace(/[\s\u200b]+/g, ' ')
         .trim();
+    return pre ? `\`${n}\`` : n;
+};
 /**
  * Main entry point. Create and return a {@link Jack} object.
  */
diff --git a/deps/npm/node_modules/jackspeak/dist/esm/package.json b/deps/npm/node_modules/jackspeak/dist/esm/package.json
new file mode 100644
index 00000000000000..7c34deb5837d8d
--- /dev/null
+++ b/deps/npm/node_modules/jackspeak/dist/esm/package.json
@@ -0,0 +1 @@
+{"type":"module"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/jackspeak/dist/esm/parse-args.js b/deps/npm/node_modules/jackspeak/dist/esm/parse-args.js
new file mode 100644
index 00000000000000..6dbb4d813ceeb9
--- /dev/null
+++ b/deps/npm/node_modules/jackspeak/dist/esm/parse-args.js
@@ -0,0 +1,26 @@
+import * as util from 'util';
+const pv = typeof process === 'object' &&
+    !!process &&
+    typeof process.version === 'string'
+    ? process.version
+    : 'v0.0.0';
+const pvs = pv
+    .replace(/^v/, '')
+    .split('.')
+    .map(s => parseInt(s, 10));
+/* c8 ignore start */
+const [major = 0, minor = 0] = pvs;
+/* c8 ignore stop */
+let { parseArgs: pa, } = util;
+/* c8 ignore start */
+if (!pa ||
+    major < 16 ||
+    (major === 18 && minor < 11) ||
+    (major === 16 && minor < 19)) {
+    /* c8 ignore stop */
+    // Ignore because we will clobber it for commonjs
+    //@ts-ignore
+    pa = (await import('@pkgjs/parseargs')).parseArgs;
+}
+export const parseArgs = pa;
+//# sourceMappingURL=parse-args.js.map
\ No newline at end of file
diff --git a/deps/npm/node_modules/jackspeak/dist/mjs/package.json b/deps/npm/node_modules/jackspeak/dist/mjs/package.json
deleted file mode 100644
index 3dbc1ca591c055..00000000000000
--- a/deps/npm/node_modules/jackspeak/dist/mjs/package.json
+++ /dev/null
@@ -1,3 +0,0 @@
-{
-  "type": "module"
-}
diff --git a/deps/npm/node_modules/jackspeak/dist/mjs/parse-args.js b/deps/npm/node_modules/jackspeak/dist/mjs/parse-args.js
deleted file mode 100644
index 24ec319d38199c..00000000000000
--- a/deps/npm/node_modules/jackspeak/dist/mjs/parse-args.js
+++ /dev/null
@@ -1,19 +0,0 @@
-// polyfill that overwrites parse-args.ts in the mjs build
-import { createRequire } from 'module';
-import * as util from 'util';
-const pv = typeof process === 'object' &&
-    !!process &&
-    typeof process.version === 'string'
-    ? process.version
-    : 'v0.0.0';
-const pvs = pv
-    .replace(/^v/, '')
-    .split('.')
-    .map(s => parseInt(s, 10));
-let { parseArgs: pa } = util;
-if (!pa || pvs[0] > 18 || pvs[1] < 11) {
-    const require = createRequire(import.meta.url);
-    pa = require('@pkgjs/parseargs').parseArgs;
-}
-export const parseArgs = pa;
-//# sourceMappingURL=parse-args-esm.js.map
\ No newline at end of file
diff --git a/deps/npm/node_modules/jackspeak/package.json b/deps/npm/node_modules/jackspeak/package.json
index afaa43e20ae4a3..e5e4752ae66368 100644
--- a/deps/npm/node_modules/jackspeak/package.json
+++ b/deps/npm/node_modules/jackspeak/package.json
@@ -1,19 +1,27 @@
 {
   "name": "jackspeak",
-  "version": "2.2.1",
+  "version": "2.3.6",
   "description": "A very strict and proper argument parser.",
-  "main": "./dist/cjs/index.js",
-  "module": "./dist/mjs/index.js",
-  "types": "./dist/mjs/index.js",
+  "tshy": {
+    "main": true,
+    "exports": {
+      "./package.json": "./package.json",
+      ".": "./src/index.js"
+    }
+  },
+  "main": "./dist/commonjs/index.js",
+  "types": "./dist/commonjs/index.d.ts",
+  "type": "module",
   "exports": {
+    "./package.json": "./package.json",
     ".": {
       "import": {
-        "types": "./dist/mjs/index.d.ts",
-        "default": "./dist/mjs/index.js"
+        "types": "./dist/esm/index.d.ts",
+        "default": "./dist/esm/index.js"
       },
       "require": {
-        "types": "./dist/cjs/index.d.ts",
-        "default": "./dist/cjs/index.js"
+        "types": "./dist/commonjs/index.d.ts",
+        "default": "./dist/commonjs/index.js"
       }
     }
   },
@@ -25,13 +33,13 @@
     "preversion": "npm test",
     "postversion": "npm publish",
     "prepublishOnly": "git push origin --follow-tags",
-    "prepare": "tsc -p tsconfig.json && tsc -p tsconfig-esm.json && bash ./scripts/fixup.sh",
+    "prepare": "tshy",
     "pretest": "npm run prepare",
     "presnap": "npm run prepare",
-    "test": "c8 tap",
-    "snap": "c8 tap",
+    "test": "tap",
+    "snap": "tap",
     "format": "prettier --write . --loglevel warn",
-    "typedoc": "typedoc --tsconfig tsconfig-esm.json ./src/*.ts"
+    "typedoc": "typedoc --tsconfig .tshy/esm.json ./src/*.ts"
   },
   "license": "BlueOak-1.0.0",
   "prettier": {
@@ -45,26 +53,14 @@
     "arrowParens": "avoid",
     "endOfLine": "lf"
   },
-  "tap": {
-    "coverage": false,
-    "node-arg": [
-      "--no-warnings",
-      "--loader",
-      "ts-node/esm"
-    ],
-    "ts": false
-  },
   "devDependencies": {
-    "@types/node": "^18.15.11",
-    "@types/pkgjs__parseargs": "^0.10.0",
-    "@types/tap": "^15.0.8",
-    "c8": "^7.13.0",
-    "eslint-config-prettier": "^8.8.0",
+    "@types/node": "^20.7.0",
+    "@types/pkgjs__parseargs": "^0.10.1",
     "prettier": "^2.8.6",
-    "tap": "^16.3.4",
-    "ts-node": "^10.9.1",
-    "typedoc": "^0.23.28",
-    "typescript": "^5.0.2"
+    "tap": "^18.1.4",
+    "tshy": "^1.2.2",
+    "typedoc": "^0.25.1",
+    "typescript": "^5.2.2"
   },
   "dependencies": {
     "@isaacs/cliui": "^8.0.2"
diff --git a/deps/npm/node_modules/libnpmaccess/package.json b/deps/npm/node_modules/libnpmaccess/package.json
index 9185e364a37600..78b60c3d62fe6c 100644
--- a/deps/npm/node_modules/libnpmaccess/package.json
+++ b/deps/npm/node_modules/libnpmaccess/package.json
@@ -1,6 +1,6 @@
 {
   "name": "libnpmaccess",
-  "version": "8.0.0",
+  "version": "8.0.1",
   "description": "programmatic library for `npm access` commands",
   "author": "GitHub Inc.",
   "license": "ISC",
@@ -17,7 +17,7 @@
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
     "@npmcli/mock-registry": "^1.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "nock": "^13.3.3",
     "tap": "^16.3.8"
   },
@@ -29,7 +29,7 @@
   "bugs": "https://github.com/npm/libnpmaccess/issues",
   "homepage": "https://npmjs.com/package/libnpmaccess",
   "dependencies": {
-    "npm-package-arg": "^11.0.0",
+    "npm-package-arg": "^11.0.1",
     "npm-registry-fetch": "^16.0.0"
   },
   "engines": {
@@ -41,14 +41,8 @@
   ],
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmdiff/package.json b/deps/npm/node_modules/libnpmdiff/package.json
index 9e8a7b62949bc1..f54a35ff5f868d 100644
--- a/deps/npm/node_modules/libnpmdiff/package.json
+++ b/deps/npm/node_modules/libnpmdiff/package.json
@@ -1,6 +1,6 @@
 {
   "name": "libnpmdiff",
-  "version": "6.0.1",
+  "version": "6.0.2",
   "description": "The registry diff",
   "repository": {
     "type": "git",
@@ -42,30 +42,24 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "tap": "^16.3.8"
   },
   "dependencies": {
-    "@npmcli/arborist": "^7.1.0",
+    "@npmcli/arborist": "^7.2.0",
     "@npmcli/disparity-colors": "^3.0.0",
     "@npmcli/installed-package-contents": "^2.0.2",
     "binary-extensions": "^2.2.0",
     "diff": "^5.1.0",
     "minimatch": "^9.0.0",
-    "npm-package-arg": "^11.0.0",
+    "npm-package-arg": "^11.0.1",
     "pacote": "^17.0.4",
-    "tar": "^6.1.13"
+    "tar": "^6.2.0"
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmexec/package.json b/deps/npm/node_modules/libnpmexec/package.json
index 5e49fe5264a3ae..5ab1484e216aba 100644
--- a/deps/npm/node_modules/libnpmexec/package.json
+++ b/deps/npm/node_modules/libnpmexec/package.json
@@ -1,6 +1,6 @@
 {
   "name": "libnpmexec",
-  "version": "7.0.1",
+  "version": "7.0.2",
   "files": [
     "bin/",
     "lib/"
@@ -51,7 +51,7 @@
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
     "@npmcli/mock-registry": "^1.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "bin-links": "^4.0.1",
     "chalk": "^5.2.0",
     "just-extend": "^6.2.0",
@@ -59,10 +59,10 @@
     "tap": "^16.3.8"
   },
   "dependencies": {
-    "@npmcli/arborist": "^7.1.0",
+    "@npmcli/arborist": "^7.2.0",
     "@npmcli/run-script": "^7.0.1",
     "ci-info": "^3.7.1",
-    "npm-package-arg": "^11.0.0",
+    "npm-package-arg": "^11.0.1",
     "npmlog": "^7.0.1",
     "pacote": "^17.0.4",
     "proc-log": "^3.0.0",
@@ -73,13 +73,7 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   }
 }
diff --git a/deps/npm/node_modules/libnpmfund/package.json b/deps/npm/node_modules/libnpmfund/package.json
index b20bfec92346b6..034e39c60d277d 100644
--- a/deps/npm/node_modules/libnpmfund/package.json
+++ b/deps/npm/node_modules/libnpmfund/package.json
@@ -1,6 +1,6 @@
 {
   "name": "libnpmfund",
-  "version": "4.1.1",
+  "version": "5.0.0",
   "main": "lib/index.js",
   "files": [
     "bin/",
@@ -32,8 +32,8 @@
   "license": "ISC",
   "scripts": {
     "lint": "eslint \"**/*.js\"",
-    "lintfix": "node ../.. run lint -- --fix",
-    "posttest": "node ../.. run lint",
+    "lintfix": "npm run lint -- --fix",
+    "posttest": "npm run lint",
     "test": "tap",
     "snap": "tap",
     "postlint": "template-oss-check",
@@ -41,19 +41,20 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "tap": "^16.3.8"
   },
   "dependencies": {
-    "@npmcli/arborist": "^7.1.0"
+    "@npmcli/arborist": "^7.2.0"
   },
   "engines": {
-    "node": "^14.17.0 || ^16.13.0 || >=18.0.0"
+    "node": "^16.14.0 || >=18.0.0"
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js"
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js",
+    "npm": "npm"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmhook/package.json b/deps/npm/node_modules/libnpmhook/package.json
index a45f37652a804b..b59524f57b695f 100644
--- a/deps/npm/node_modules/libnpmhook/package.json
+++ b/deps/npm/node_modules/libnpmhook/package.json
@@ -35,7 +35,7 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "nock": "^13.3.3",
     "tap": "^16.3.8"
   },
@@ -44,14 +44,8 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmorg/package.json b/deps/npm/node_modules/libnpmorg/package.json
index f1964bca7eeb9b..596854acfc2a8c 100644
--- a/deps/npm/node_modules/libnpmorg/package.json
+++ b/deps/npm/node_modules/libnpmorg/package.json
@@ -1,6 +1,6 @@
 {
   "name": "libnpmorg",
-  "version": "6.0.0",
+  "version": "6.0.1",
   "description": "Programmatic api for `npm org` commands",
   "author": "GitHub Inc.",
   "main": "lib/index.js",
@@ -28,8 +28,8 @@
   ],
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
-    "minipass": "^7.0.3",
+    "@npmcli/template-oss": "4.19.0",
+    "minipass": "^7.0.4",
     "nock": "^13.3.3",
     "tap": "^16.3.8"
   },
@@ -49,14 +49,8 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmpack/package.json b/deps/npm/node_modules/libnpmpack/package.json
index 88a80e95226183..d3ceea0882fc3b 100644
--- a/deps/npm/node_modules/libnpmpack/package.json
+++ b/deps/npm/node_modules/libnpmpack/package.json
@@ -1,6 +1,6 @@
 {
   "name": "libnpmpack",
-  "version": "6.0.1",
+  "version": "6.0.2",
   "description": "Programmatic API for the bits behind npm pack",
   "author": "GitHub Inc.",
   "main": "lib/index.js",
@@ -23,7 +23,7 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "nock": "^13.3.3",
     "spawk": "^1.7.1",
     "tap": "^16.3.8"
@@ -36,9 +36,9 @@
   "bugs": "https://github.com/npm/libnpmpack/issues",
   "homepage": "https://npmjs.com/package/libnpmpack",
   "dependencies": {
-    "@npmcli/arborist": "^7.1.0",
+    "@npmcli/arborist": "^7.2.0",
     "@npmcli/run-script": "^7.0.1",
-    "npm-package-arg": "^11.0.0",
+    "npm-package-arg": "^11.0.1",
     "pacote": "^17.0.4"
   },
   "engines": {
@@ -46,14 +46,8 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmpublish/package.json b/deps/npm/node_modules/libnpmpublish/package.json
index 3dcaf98e84782d..f5081a05188660 100644
--- a/deps/npm/node_modules/libnpmpublish/package.json
+++ b/deps/npm/node_modules/libnpmpublish/package.json
@@ -1,6 +1,6 @@
 {
   "name": "libnpmpublish",
-  "version": "9.0.0",
+  "version": "9.0.1",
   "description": "Programmatic API for the bits behind npm publish and unpublish",
   "author": "GitHub Inc.",
   "main": "lib/index.js",
@@ -26,7 +26,7 @@
     "@npmcli/eslint-config": "^4.0.0",
     "@npmcli/mock-globals": "^1.0.0",
     "@npmcli/mock-registry": "^1.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "nock": "^13.3.3",
     "tap": "^16.3.8"
   },
@@ -40,7 +40,7 @@
   "dependencies": {
     "ci-info": "^3.6.1",
     "normalize-package-data": "^6.0.0",
-    "npm-package-arg": "^11.0.0",
+    "npm-package-arg": "^11.0.1",
     "npm-registry-fetch": "^16.0.0",
     "proc-log": "^3.0.0",
     "semver": "^7.3.7",
@@ -52,14 +52,8 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmsearch/package.json b/deps/npm/node_modules/libnpmsearch/package.json
index 9bd45de5f62cdb..1a1e06bb569bae 100644
--- a/deps/npm/node_modules/libnpmsearch/package.json
+++ b/deps/npm/node_modules/libnpmsearch/package.json
@@ -26,7 +26,7 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "nock": "^13.3.3",
     "tap": "^16.3.8"
   },
@@ -45,14 +45,8 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmteam/package.json b/deps/npm/node_modules/libnpmteam/package.json
index ca153ac301bf45..3b9ab774711858 100644
--- a/deps/npm/node_modules/libnpmteam/package.json
+++ b/deps/npm/node_modules/libnpmteam/package.json
@@ -16,7 +16,7 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "nock": "^13.3.3",
     "tap": "^16.3.8"
   },
@@ -39,14 +39,8 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   },
   "tap": {
     "nyc-arg": [
diff --git a/deps/npm/node_modules/libnpmversion/package.json b/deps/npm/node_modules/libnpmversion/package.json
index 6f3a5bd0b5155a..a440ee75cec7fc 100644
--- a/deps/npm/node_modules/libnpmversion/package.json
+++ b/deps/npm/node_modules/libnpmversion/package.json
@@ -32,7 +32,7 @@
   },
   "devDependencies": {
     "@npmcli/eslint-config": "^4.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "require-inject": "^1.4.4",
     "tap": "^16.3.8"
   },
@@ -48,13 +48,7 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
-    "content": "../../scripts/template-oss/index.js",
-    "ciVersions": [
-      "16.14.0",
-      "16.x",
-      "18.0.0",
-      "18.x"
-    ]
+    "version": "4.19.0",
+    "content": "../../scripts/template-oss/index.js"
   }
 }
diff --git a/deps/npm/node_modules/minipass/dist/cjs/package.json b/deps/npm/node_modules/minipass/dist/cjs/package.json
deleted file mode 100644
index 5bbefffbabee39..00000000000000
--- a/deps/npm/node_modules/minipass/dist/cjs/package.json
+++ /dev/null
@@ -1,3 +0,0 @@
-{
-  "type": "commonjs"
-}
diff --git a/deps/npm/node_modules/minipass/dist/cjs/index.js b/deps/npm/node_modules/minipass/dist/commonjs/index.js
similarity index 100%
rename from deps/npm/node_modules/minipass/dist/cjs/index.js
rename to deps/npm/node_modules/minipass/dist/commonjs/index.js
diff --git a/deps/npm/node_modules/minipass/dist/commonjs/package.json b/deps/npm/node_modules/minipass/dist/commonjs/package.json
new file mode 100644
index 00000000000000..0292b9956f2e40
--- /dev/null
+++ b/deps/npm/node_modules/minipass/dist/commonjs/package.json
@@ -0,0 +1 @@
+{"type":"commonjs"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/minipass/dist/mjs/index.js b/deps/npm/node_modules/minipass/dist/esm/index.js
similarity index 100%
rename from deps/npm/node_modules/minipass/dist/mjs/index.js
rename to deps/npm/node_modules/minipass/dist/esm/index.js
diff --git a/deps/npm/node_modules/minipass/dist/esm/package.json b/deps/npm/node_modules/minipass/dist/esm/package.json
new file mode 100644
index 00000000000000..7c34deb5837d8d
--- /dev/null
+++ b/deps/npm/node_modules/minipass/dist/esm/package.json
@@ -0,0 +1 @@
+{"type":"module"}
\ No newline at end of file
diff --git a/deps/npm/node_modules/minipass/dist/mjs/package.json b/deps/npm/node_modules/minipass/dist/mjs/package.json
deleted file mode 100644
index 3dbc1ca591c055..00000000000000
--- a/deps/npm/node_modules/minipass/dist/mjs/package.json
+++ /dev/null
@@ -1,3 +0,0 @@
-{
-  "type": "module"
-}
diff --git a/deps/npm/node_modules/minipass/package.json b/deps/npm/node_modules/minipass/package.json
index 6faaa247a5bc66..4398347289164c 100644
--- a/deps/npm/node_modules/minipass/package.json
+++ b/deps/npm/node_modules/minipass/package.json
@@ -1,22 +1,29 @@
 {
   "name": "minipass",
-  "version": "7.0.3",
+  "version": "7.0.4",
   "description": "minimal implementation of a PassThrough stream",
-  "main": "./dist/cjs/index.js",
-  "module": "./dist/mjs/index.js",
-  "types": "./dist/cjs/index.js",
+  "main": "./dist/commonjs/index.js",
+  "types": "./dist/commonjs/index.d.ts",
+  "type": "module",
+  "tshy": {
+    "main": true,
+    "exports": {
+      "./package.json": "./package.json",
+      ".": "./src/index.ts"
+    }
+  },
   "exports": {
+    "./package.json": "./package.json",
     ".": {
       "import": {
-        "types": "./dist/mjs/index.d.ts",
-        "default": "./dist/mjs/index.js"
+        "types": "./dist/esm/index.d.ts",
+        "default": "./dist/esm/index.js"
       },
       "require": {
-        "types": "./dist/cjs/index.d.ts",
-        "default": "./dist/cjs/index.js"
+        "types": "./dist/commonjs/index.d.ts",
+        "default": "./dist/commonjs/index.js"
       }
-    },
-    "./package.json": "./package.json"
+    }
   },
   "files": [
     "dist"
@@ -25,24 +32,13 @@
     "preversion": "npm test",
     "postversion": "npm publish",
     "prepublishOnly": "git push origin --follow-tags",
-    "preprepare": "rm -rf dist",
-    "prepare": "tsc -p tsconfig.json && tsc -p tsconfig-esm.json && bash ./scripts/fixup.sh",
+    "prepare": "tshy",
     "pretest": "npm run prepare",
     "presnap": "npm run prepare",
-    "test": "c8 tap",
-    "snap": "c8 tap",
+    "test": "tap",
+    "snap": "tap",
     "format": "prettier --write . --loglevel warn",
-    "typedoc": "typedoc --tsconfig tsconfig-esm.json ./src/*.ts"
-  },
-  "tap": {
-    "coverage": false,
-    "node-arg": [
-      "--enable-source-maps",
-      "--no-warnings",
-      "--loader",
-      "ts-node/esm"
-    ],
-    "ts": false
+    "typedoc": "typedoc --tsconfig .tshy/esm.json ./src/*.ts"
   },
   "prettier": {
     "semi": false,
@@ -56,18 +52,17 @@
     "endOfLine": "lf"
   },
   "devDependencies": {
+    "@types/end-of-stream": "^1.4.2",
     "@types/node": "^20.1.2",
-    "@types/tap": "^15.0.8",
-    "c8": "^7.13.0",
-    "prettier": "^2.6.2",
-    "tap": "^16.3.0",
-    "ts-node": "^10.9.1",
-    "typedoc": "^0.24.8",
-    "typescript": "^5.1.3",
     "end-of-stream": "^1.4.0",
     "node-abort-controller": "^3.1.1",
+    "prettier": "^2.6.2",
     "sync-content": "^1.0.2",
-    "through2": "^2.0.3"
+    "tap": "^18.3.0",
+    "through2": "^2.0.3",
+    "tshy": "^1.2.2",
+    "typedoc": "^0.25.1",
+    "typescript": "^5.2.2"
   },
   "repository": "https://github.com/isaacs/minipass",
   "keywords": [
@@ -78,5 +73,10 @@
   "license": "ISC",
   "engines": {
     "node": ">=16 || 14 >=14.17"
+  },
+  "tap": {
+    "include": [
+      "test/*.ts"
+    ]
   }
 }
diff --git a/deps/npm/node_modules/npm-package-arg/lib/npa.js b/deps/npm/node_modules/npm-package-arg/lib/npa.js
index f5ede2326e7b47..23bf68d2e04a39 100644
--- a/deps/npm/node_modules/npm-package-arg/lib/npa.js
+++ b/deps/npm/node_modules/npm-package-arg/lib/npa.js
@@ -4,7 +4,7 @@ module.exports.resolve = resolve
 module.exports.toPurl = toPurl
 module.exports.Result = Result
 
-const url = require('url')
+const { URL } = require('url')
 const HostedGit = require('hosted-git-info')
 const semver = require('semver')
 const path = global.FAKE_WINDOWS ? require('path').win32 : require('path')
@@ -183,10 +183,11 @@ Result.prototype.toJSON = function () {
   return result
 }
 
-function setGitCommittish (res, committish) {
+// sets res.gitCommittish, res.gitRange, and res.gitSubdir
+function setGitAttrs (res, committish) {
   if (!committish) {
     res.gitCommittish = null
-    return res
+    return
   }
 
   // for each :: separated item:
@@ -224,8 +225,6 @@ function setGitCommittish (res, committish) {
     }
     log.warn('npm-package-arg', `ignoring unknown key "${name}"`)
   }
-
-  return res
 }
 
 function fromFile (res, where) {
@@ -245,10 +244,10 @@ function fromFile (res, where) {
   const rawWithPrefix = prefix + res.rawSpec
   let rawNoPrefix = rawWithPrefix.replace(/^file:/, '')
   try {
-    resolvedUrl = new url.URL(rawWithPrefix, `file://${path.resolve(where)}/`)
-    specUrl = new url.URL(rawWithPrefix)
+    resolvedUrl = new URL(rawWithPrefix, `file://${path.resolve(where)}/`)
+    specUrl = new URL(rawWithPrefix)
   } catch (originalError) {
-    const er = new Error('Invalid file: URL, must comply with RFC 8909')
+    const er = new Error('Invalid file: URL, must comply with RFC 8089')
     throw Object.assign(er, {
       raw: res.rawSpec,
       spec: res,
@@ -257,11 +256,11 @@ function fromFile (res, where) {
     })
   }
 
-  // XXX backwards compatibility lack of compliance with RFC 8909
+  // XXX backwards compatibility lack of compliance with RFC 8089
   if (resolvedUrl.host && resolvedUrl.host !== 'localhost') {
     const rawSpec = res.rawSpec.replace(/^file:\/\//, 'file:///')
-    resolvedUrl = new url.URL(rawSpec, `file://${path.resolve(where)}/`)
-    specUrl = new url.URL(rawSpec)
+    resolvedUrl = new URL(rawSpec, `file://${path.resolve(where)}/`)
+    specUrl = new URL(rawSpec)
     rawNoPrefix = rawSpec.replace(/^file:/, '')
   }
   // turn file:/../foo into file:../foo
@@ -269,11 +268,11 @@ function fromFile (res, where) {
   // in the previous step to make it a file protocol url with a leading slash
   if (/^\/{1,3}\.\.?(\/|$)/.test(rawNoPrefix)) {
     const rawSpec = res.rawSpec.replace(/^file:\/{1,3}/, 'file:')
-    resolvedUrl = new url.URL(rawSpec, `file://${path.resolve(where)}/`)
-    specUrl = new url.URL(rawSpec)
+    resolvedUrl = new URL(rawSpec, `file://${path.resolve(where)}/`)
+    specUrl = new URL(rawSpec)
     rawNoPrefix = rawSpec.replace(/^file:/, '')
   }
-  // XXX end RFC 8909 violation backwards compatibility section
+  // XXX end RFC 8089 violation backwards compatibility section
 
   // turn /C:/blah into just C:/blah on windows
   let specPath = decodeURIComponent(specUrl.pathname)
@@ -303,7 +302,8 @@ function fromHostedGit (res, hosted) {
   res.hosted = hosted
   res.saveSpec = hosted.toString({ noGitPlus: false, noCommittish: false })
   res.fetchSpec = hosted.getDefaultRepresentation() === 'shortcut' ? null : hosted.toString()
-  return setGitCommittish(res, hosted.committish)
+  setGitAttrs(res, hosted.committish)
+  return res
 }
 
 function unsupportedURLType (protocol, spec) {
@@ -312,54 +312,51 @@ function unsupportedURLType (protocol, spec) {
   return err
 }
 
-function matchGitScp (spec) {
-  // git ssh specifiers are overloaded to also use scp-style git
-  // specifiers, so we have to parse those out and treat them special.
-  // They are NOT true URIs, so we can't hand them to `url.parse`.
-  //
-  // This regex looks for things that look like:
-  // git+ssh://git@my.custom.git.com:username/project.git#deadbeef
-  //
-  // ...and various combinations. The username in the beginning is *required*.
-  const matched = spec.match(/^git\+ssh:\/\/([^:#]+:[^#]+(?:\.git)?)(?:#(.*))?$/i)
-  return matched && !matched[1].match(/:[0-9]+\/?.*$/i) && {
-    fetchSpec: matched[1],
-    gitCommittish: matched[2] == null ? null : matched[2],
-  }
-}
-
 function fromURL (res) {
-  // eslint-disable-next-line node/no-deprecated-api
-  const urlparse = url.parse(res.rawSpec)
-  res.saveSpec = res.rawSpec
+  let rawSpec = res.rawSpec
+  res.saveSpec = rawSpec
+  if (rawSpec.startsWith('git+ssh:')) {
+    // git ssh specifiers are overloaded to also use scp-style git
+    // specifiers, so we have to parse those out and treat them special.
+    // They are NOT true URIs, so we can't hand them to URL.
+
+    // This regex looks for things that look like:
+    // git+ssh://git@my.custom.git.com:username/project.git#deadbeef
+    // ...and various combinations. The username in the beginning is *required*.
+    const matched = rawSpec.match(/^git\+ssh:\/\/([^:#]+:[^#]+(?:\.git)?)(?:#(.*))?$/i)
+    if (matched && !matched[1].match(/:[0-9]+\/?.*$/i)) {
+      res.type = 'git'
+      setGitAttrs(res, matched[2])
+      res.fetchSpec = matched[1]
+      return res
+    }
+  } else if (rawSpec.startsWith('git+file://')) {
+    // URL can't handle windows paths
+    rawSpec = rawSpec.replace(/\\/g, '/')
+  }
+  const parsedUrl = new URL(rawSpec)
   // check the protocol, and then see if it's git or not
-  switch (urlparse.protocol) {
+  switch (parsedUrl.protocol) {
     case 'git:':
     case 'git+http:':
     case 'git+https:':
     case 'git+rsync:':
     case 'git+ftp:':
     case 'git+file:':
-    case 'git+ssh:': {
+    case 'git+ssh:':
       res.type = 'git'
-      const match = urlparse.protocol === 'git+ssh:' ? matchGitScp(res.rawSpec)
-        : null
-      if (match) {
-        setGitCommittish(res, match.gitCommittish)
-        res.fetchSpec = match.fetchSpec
+      setGitAttrs(res, parsedUrl.hash.slice(1))
+      if (parsedUrl.protocol === 'git+file:' && /^git\+file:\/\/[a-z]:/i.test(rawSpec)) {
+        // URL can't handle drive letters on windows file paths, the host can't contain a :
+        res.fetchSpec = `git+file://${parsedUrl.host.toLowerCase()}:${parsedUrl.pathname}`
       } else {
-        setGitCommittish(res, urlparse.hash != null ? urlparse.hash.slice(1) : '')
-        urlparse.protocol = urlparse.protocol.replace(/^git[+]/, '')
-        if (urlparse.protocol === 'file:' && /^git\+file:\/\/[a-z]:/i.test(res.rawSpec)) {
-          // keep the drive letter : on windows file paths
-          urlparse.host += ':'
-          urlparse.hostname += ':'
-        }
-        delete urlparse.hash
-        res.fetchSpec = url.format(urlparse)
+        parsedUrl.hash = ''
+        res.fetchSpec = parsedUrl.toString()
+      }
+      if (res.fetchSpec.startsWith('git+')) {
+        res.fetchSpec = res.fetchSpec.slice(4)
       }
       break
-    }
     case 'http:':
     case 'https:':
       res.type = 'remote'
@@ -367,7 +364,7 @@ function fromURL (res) {
       break
 
     default:
-      throw unsupportedURLType(urlparse.protocol, res.rawSpec)
+      throw unsupportedURLType(parsedUrl.protocol, rawSpec)
   }
 
   return res
diff --git a/deps/npm/node_modules/npm-package-arg/package.json b/deps/npm/node_modules/npm-package-arg/package.json
index 9ba1d135f3ebf0..f7965d5a007c9d 100644
--- a/deps/npm/node_modules/npm-package-arg/package.json
+++ b/deps/npm/node_modules/npm-package-arg/package.json
@@ -1,6 +1,6 @@
 {
   "name": "npm-package-arg",
-  "version": "11.0.0",
+  "version": "11.0.1",
   "description": "Parse the things that can be arguments to `npm install`",
   "main": "./lib/npa.js",
   "directories": {
@@ -61,6 +61,7 @@
       "16.x",
       "18.0.0",
       "18.x"
-    ]
+    ],
+    "npmSpec": "next-9"
   }
 }
diff --git a/deps/npm/node_modules/tar/lib/pack.js b/deps/npm/node_modules/tar/lib/pack.js
index 938ece8e731458..d533a068f579f7 100644
--- a/deps/npm/node_modules/tar/lib/pack.js
+++ b/deps/npm/node_modules/tar/lib/pack.js
@@ -79,14 +79,26 @@ const Pack = warner(class Pack extends Minipass {
 
     this.portable = !!opt.portable
     this.zip = null
-    if (opt.gzip) {
-      if (typeof opt.gzip !== 'object') {
-        opt.gzip = {}
+
+    if (opt.gzip || opt.brotli) {
+      if (opt.gzip && opt.brotli) {
+        throw new TypeError('gzip and brotli are mutually exclusive')
       }
-      if (this.portable) {
-        opt.gzip.portable = true
+      if (opt.gzip) {
+        if (typeof opt.gzip !== 'object') {
+          opt.gzip = {}
+        }
+        if (this.portable) {
+          opt.gzip.portable = true
+        }
+        this.zip = new zlib.Gzip(opt.gzip)
+      }
+      if (opt.brotli) {
+        if (typeof opt.brotli !== 'object') {
+          opt.brotli = {}
+        }
+        this.zip = new zlib.BrotliCompress(opt.brotli)
       }
-      this.zip = new zlib.Gzip(opt.gzip)
       this.zip.on('data', chunk => super.write(chunk))
       this.zip.on('end', _ => super.end())
       this.zip.on('drain', _ => this[ONDRAIN]())
diff --git a/deps/npm/node_modules/tar/lib/parse.js b/deps/npm/node_modules/tar/lib/parse.js
index 4b85915cbe01ee..94e53042fad560 100644
--- a/deps/npm/node_modules/tar/lib/parse.js
+++ b/deps/npm/node_modules/tar/lib/parse.js
@@ -97,6 +97,16 @@ module.exports = warner(class Parser extends EE {
     this.strict = !!opt.strict
     this.maxMetaEntrySize = opt.maxMetaEntrySize || maxMetaEntrySize
     this.filter = typeof opt.filter === 'function' ? opt.filter : noop
+    // Unlike gzip, brotli doesn't have any magic bytes to identify it
+    // Users need to explicitly tell us they're extracting a brotli file
+    // Or we infer from the file extension
+    const isTBR = (opt.file && (
+        opt.file.endsWith('.tar.br') || opt.file.endsWith('.tbr')))
+    // if it's a tbr file it MIGHT be brotli, but we don't know until
+    // we look at it and verify it's not a valid tar file.
+    this.brotli = !opt.gzip && opt.brotli !== undefined ? opt.brotli
+      : isTBR ? undefined
+      : false
 
     // have to set this so that streams are ok piping into it
     this.writable = true
@@ -347,7 +357,9 @@ module.exports = warner(class Parser extends EE {
     }
 
     // first write, might be gzipped
-    if (this[UNZIP] === null && chunk) {
+    const needSniff = this[UNZIP] === null ||
+      this.brotli === undefined && this[UNZIP] === false
+    if (needSniff && chunk) {
       if (this[BUFFER]) {
         chunk = Buffer.concat([this[BUFFER], chunk])
         this[BUFFER] = null
@@ -356,15 +368,45 @@ module.exports = warner(class Parser extends EE {
         this[BUFFER] = chunk
         return true
       }
+
+      // look for gzip header
       for (let i = 0; this[UNZIP] === null && i < gzipHeader.length; i++) {
         if (chunk[i] !== gzipHeader[i]) {
           this[UNZIP] = false
         }
       }
-      if (this[UNZIP] === null) {
+
+      const maybeBrotli = this.brotli === undefined
+      if (this[UNZIP] === false && maybeBrotli) {
+        // read the first header to see if it's a valid tar file. If so,
+        // we can safely assume that it's not actually brotli, despite the
+        // .tbr or .tar.br file extension.
+        // if we ended before getting a full chunk, yes, def brotli
+        if (chunk.length < 512) {
+          if (this[ENDED]) {
+            this.brotli = true
+          } else {
+            this[BUFFER] = chunk
+            return true
+          }
+        } else {
+          // if it's tar, it's pretty reliably not brotli, chances of
+          // that happening are astronomical.
+          try {
+            new Header(chunk.slice(0, 512))
+            this.brotli = false
+          } catch (_) {
+            this.brotli = true
+          }
+        }
+      }
+
+      if (this[UNZIP] === null || (this[UNZIP] === false && this.brotli)) {
         const ended = this[ENDED]
         this[ENDED] = false
-        this[UNZIP] = new zlib.Unzip()
+        this[UNZIP] = this[UNZIP] === null
+          ? new zlib.Unzip()
+          : new zlib.BrotliDecompress()
         this[UNZIP].on('data', chunk => this[CONSUMECHUNK](chunk))
         this[UNZIP].on('error', er => this.abort(er))
         this[UNZIP].on('end', _ => {
@@ -502,6 +544,7 @@ module.exports = warner(class Parser extends EE {
         this[UNZIP].end(chunk)
       } else {
         this[ENDED] = true
+        if (this.brotli === undefined) chunk = chunk || Buffer.alloc(0)
         this.write(chunk)
       }
     }
diff --git a/deps/npm/node_modules/tar/lib/replace.js b/deps/npm/node_modules/tar/lib/replace.js
index c6e619be6f0326..8db6800bdf4644 100644
--- a/deps/npm/node_modules/tar/lib/replace.js
+++ b/deps/npm/node_modules/tar/lib/replace.js
@@ -23,7 +23,7 @@ module.exports = (opt_, files, cb) => {
     throw new TypeError('file is required')
   }
 
-  if (opt.gzip) {
+  if (opt.gzip || opt.brotli || opt.file.endsWith('.br') || opt.file.endsWith('.tbr')) {
     throw new TypeError('cannot append to compressed archives')
   }
 
diff --git a/deps/npm/node_modules/tar/lib/update.js b/deps/npm/node_modules/tar/lib/update.js
index ded977dc1dec0f..4d328543b315e4 100644
--- a/deps/npm/node_modules/tar/lib/update.js
+++ b/deps/npm/node_modules/tar/lib/update.js
@@ -13,7 +13,7 @@ module.exports = (opt_, files, cb) => {
     throw new TypeError('file is required')
   }
 
-  if (opt.gzip) {
+  if (opt.gzip || opt.brotli || opt.file.endsWith('.br') || opt.file.endsWith('.tbr')) {
     throw new TypeError('cannot append to compressed archives')
   }
 
diff --git a/deps/npm/node_modules/tar/package.json b/deps/npm/node_modules/tar/package.json
index f59f54ae837bd2..46d91ee1b299cf 100644
--- a/deps/npm/node_modules/tar/package.json
+++ b/deps/npm/node_modules/tar/package.json
@@ -2,20 +2,15 @@
   "author": "GitHub Inc.",
   "name": "tar",
   "description": "tar for node",
-  "version": "6.1.15",
+  "version": "6.2.0",
   "repository": {
     "type": "git",
     "url": "https://github.com/isaacs/node-tar.git"
   },
   "scripts": {
     "genparse": "node scripts/generate-parse-fixtures.js",
-    "template-oss-apply": "template-oss-apply --force",
-    "lint": "eslint \"**/*.js\"",
-    "postlint": "template-oss-check",
-    "lintfix": "npm run lint -- --fix",
     "snap": "tap",
-    "test": "tap",
-    "posttest": "npm run lint"
+    "test": "tap"
   },
   "dependencies": {
     "chownr": "^2.0.0",
diff --git a/deps/npm/package.json b/deps/npm/package.json
index a95496f1a3eb01..3246377f0cb725 100644
--- a/deps/npm/package.json
+++ b/deps/npm/package.json
@@ -1,5 +1,5 @@
 {
-  "version": "10.1.0",
+  "version": "10.2.0",
   "name": "npm",
   "description": "a package manager for JavaScript",
   "workspaces": [
@@ -52,8 +52,8 @@
   },
   "dependencies": {
     "@isaacs/string-locale-compare": "^1.1.0",
-    "@npmcli/arborist": "^7.1.0",
-    "@npmcli/config": "^7.2.0",
+    "@npmcli/arborist": "^7.2.0",
+    "@npmcli/config": "^8.0.0",
     "@npmcli/fs": "^3.1.0",
     "@npmcli/map-workspaces": "^3.0.4",
     "@npmcli/package-json": "^5.0.0",
@@ -70,34 +70,35 @@
     "columnify": "^1.6.0",
     "fastest-levenshtein": "^1.0.16",
     "fs-minipass": "^3.0.3",
-    "glob": "^10.3.3",
+    "glob": "^10.3.10",
     "graceful-fs": "^4.2.11",
-    "hosted-git-info": "^7.0.0",
+    "hosted-git-info": "^7.0.1",
     "ini": "^4.1.1",
     "init-package-json": "^6.0.0",
     "is-cidr": "^4.0.2",
     "json-parse-even-better-errors": "^3.0.0",
-    "libnpmaccess": "^8.0.0",
-    "libnpmdiff": "^6.0.1",
-    "libnpmexec": "^7.0.1",
-    "libnpmfund": "^4.1.1",
+    "libnpmaccess": "^8.0.1",
+    "libnpmdiff": "^6.0.2",
+    "libnpmexec": "^7.0.2",
+    "libnpmfund": "^5.0.0",
     "libnpmhook": "^10.0.0",
-    "libnpmorg": "^6.0.0",
-    "libnpmpack": "^6.0.1",
-    "libnpmpublish": "^9.0.0",
+    "libnpmorg": "^6.0.1",
+    "libnpmpack": "^6.0.2",
+    "libnpmpublish": "^9.0.1",
     "libnpmsearch": "^7.0.0",
     "libnpmteam": "^6.0.0",
     "libnpmversion": "^5.0.0",
     "make-fetch-happen": "^13.0.0",
     "minimatch": "^9.0.3",
-    "minipass": "^7.0.3",
+    "minipass": "^7.0.4",
     "minipass-pipeline": "^1.2.4",
     "ms": "^2.1.2",
     "node-gyp": "^9.4.0",
     "nopt": "^7.2.0",
+    "normalize-package-data": "^6.0.0",
     "npm-audit-report": "^5.0.0",
     "npm-install-checks": "^6.2.0",
-    "npm-package-arg": "^11.0.0",
+    "npm-package-arg": "^11.0.1",
     "npm-pick-manifest": "^9.0.0",
     "npm-profile": "^9.0.0",
     "npm-registry-fetch": "^16.0.0",
@@ -110,9 +111,11 @@
     "qrcode-terminal": "^0.12.0",
     "read": "^2.1.0",
     "semver": "^7.5.4",
+    "spdx-expression-parse": "^3.0.1",
     "ssri": "^10.0.5",
+    "strip-ansi": "^6.0.1",
     "supports-color": "^9.4.0",
-    "tar": "^6.1.15",
+    "tar": "^6.2.0",
     "text-table": "~0.2.0",
     "tiny-relative-date": "^1.3.0",
     "treeverse": "^3.0.0",
@@ -165,6 +168,7 @@
     "ms",
     "node-gyp",
     "nopt",
+    "normalize-package-data",
     "npm-audit-report",
     "npm-install-checks",
     "npm-package-arg",
@@ -180,7 +184,9 @@
     "qrcode-terminal",
     "read",
     "semver",
+    "spdx-expression-parse",
     "ssri",
+    "strip-ansi",
     "supports-color",
     "tar",
     "text-table",
@@ -196,8 +202,11 @@
     "@npmcli/git": "^5.0.3",
     "@npmcli/mock-globals": "^1.0.0",
     "@npmcli/mock-registry": "^1.0.0",
-    "@npmcli/template-oss": "4.18.0",
+    "@npmcli/template-oss": "4.19.0",
     "@tufjs/repo-mock": "^2.0.0",
+    "ajv": "^8.12.0",
+    "ajv-formats": "^2.1.1",
+    "ajv-formats-draft2019": "^1.6.1",
     "diff": "^5.1.0",
     "licensee": "^10.0.0",
     "nock": "^13.3.3",
@@ -249,7 +258,7 @@
   },
   "templateOSS": {
     "//@npmcli/template-oss": "This file is partially managed by @npmcli/template-oss. Edits may be overwritten.",
-    "version": "4.18.0",
+    "version": "4.19.0",
     "content": "./scripts/template-oss/root.js"
   },
   "license": "Artistic-2.0",
diff --git a/deps/npm/tap-snapshots/test/lib/commands/completion.js.test.cjs b/deps/npm/tap-snapshots/test/lib/commands/completion.js.test.cjs
index b21e378b1cfbe8..089d92440f653f 100644
--- a/deps/npm/tap-snapshots/test/lib/commands/completion.js.test.cjs
+++ b/deps/npm/tap-snapshots/test/lib/commands/completion.js.test.cjs
@@ -93,6 +93,7 @@ Array [
       restart
       root
       run-script
+      sbom
       search
       set
       shrinkwrap
diff --git a/deps/npm/tap-snapshots/test/lib/commands/config.js.test.cjs b/deps/npm/tap-snapshots/test/lib/commands/config.js.test.cjs
index 3001c98b3e03d8..b210601e9118b9 100644
--- a/deps/npm/tap-snapshots/test/lib/commands/config.js.test.cjs
+++ b/deps/npm/tap-snapshots/test/lib/commands/config.js.test.cjs
@@ -89,6 +89,8 @@ exports[`test/lib/commands/config.js TAP config list --json > output matches sna
   "legacy-peer-deps": false,
   "link": false,
   "local-address": null,
+  "sbom-format": null,
+  "sbom-type": "library",
   "location": "user",
   "lockfile-version": null,
   "loglevel": "notice",
@@ -290,6 +292,8 @@ save-optional = false
 save-peer = false
 save-prefix = "^"
 save-prod = false
+sbom-format = null
+sbom-type = "library"
 scope = ""
 script-shell = null
 searchexclude = ""
diff --git a/deps/npm/tap-snapshots/test/lib/commands/publish.js.test.cjs b/deps/npm/tap-snapshots/test/lib/commands/publish.js.test.cjs
index 7a5c2ddcc3882b..0055c59c3641cf 100644
--- a/deps/npm/tap-snapshots/test/lib/commands/publish.js.test.cjs
+++ b/deps/npm/tap-snapshots/test/lib/commands/publish.js.test.cjs
@@ -191,6 +191,7 @@ Object {
     "man/man1/npm-restart.1",
     "man/man1/npm-root.1",
     "man/man1/npm-run-script.1",
+    "man/man1/npm-sbom.1",
     "man/man1/npm-search.1",
     "man/man1/npm-shrinkwrap.1",
     "man/man1/npm-star.1",
diff --git a/deps/npm/tap-snapshots/test/lib/commands/query.js.test.cjs b/deps/npm/tap-snapshots/test/lib/commands/query.js.test.cjs
index a6dbfcf7c693c8..e7321354689653 100644
--- a/deps/npm/tap-snapshots/test/lib/commands/query.js.test.cjs
+++ b/deps/npm/tap-snapshots/test/lib/commands/query.js.test.cjs
@@ -99,6 +99,54 @@ exports[`test/lib/commands/query.js TAP linked node > should return linked node
 ]
 `
 
+exports[`test/lib/commands/query.js TAP package-lock-only with package lock > should return valid response with only lock info 1`] = `
+[
+  {
+    "name": "project",
+    "dependencies": {
+      "a": "^1.0.0"
+    },
+    "pkgid": "project@",
+    "location": "",
+    "path": "{CWD}/prefix",
+    "realpath": "{CWD}/prefix",
+    "resolved": null,
+    "from": [],
+    "to": [
+      "node_modules/a"
+    ],
+    "dev": false,
+    "inBundle": false,
+    "deduped": false,
+    "overridden": false,
+    "queryContext": {}
+  },
+  {
+    "version": "1.2.3",
+    "resolved": "https://dummy.npmjs.org/a/-/a-1.2.3.tgz",
+    "integrity": "sha512-dummy",
+    "engines": {
+      "node": ">=14.17"
+    },
+    "name": "a",
+    "_id": "a@1.2.3",
+    "pkgid": "a@1.2.3",
+    "location": "node_modules/a",
+    "path": "{CWD}/prefix/node_modules/a",
+    "realpath": "{CWD}/prefix/node_modules/a",
+    "from": [
+      ""
+    ],
+    "to": [],
+    "dev": false,
+    "inBundle": false,
+    "deduped": false,
+    "overridden": false,
+    "queryContext": {}
+  }
+]
+`
+
 exports[`test/lib/commands/query.js TAP recursive tree > should return everything in the tree, accounting for recursion 1`] = `
 [
   {
diff --git a/deps/npm/tap-snapshots/test/lib/commands/sbom.js.test.cjs b/deps/npm/tap-snapshots/test/lib/commands/sbom.js.test.cjs
new file mode 100644
index 00000000000000..0079832f7427fb
--- /dev/null
+++ b/deps/npm/tap-snapshots/test/lib/commands/sbom.js.test.cjs
@@ -0,0 +1,1410 @@
+/* IMPORTANT
+ * This snapshot file is auto-generated, but designed for humans.
+ * It should be checked into source control and tracked carefully.
+ * Re-generate by setting TAP_SNAPSHOT=1 and running tests.
+ * Make sure to inspect the output below.  Do not ignore changes!
+ */
+'use strict'
+exports[`test/lib/commands/sbom.js TAP sbom --omit dev > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "test-npm-sbom@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-test-npm-sbom-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "test-npm-sbom",
+      "SPDXID": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/test-npm-sbom@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "foo",
+      "SPDXID": "SPDXRef-Package-foo-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/foo@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "dog",
+      "SPDXID": "SPDXRef-Package-dog-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo/node_modules/dog",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dog@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-foo-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-foo-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dog-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom --omit optional > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "test-npm-sbom@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-test-npm-sbom-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "test-npm-sbom",
+      "SPDXID": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/test-npm-sbom@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "chai",
+      "SPDXID": "SPDXRef-Package-chai-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/chai",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/chai@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-chai-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom --omit peer > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "test-npm-sbom@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-test-npm-sbom-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "test-npm-sbom",
+      "SPDXID": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/test-npm-sbom@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "chai",
+      "SPDXID": "SPDXRef-Package-chai-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/chai",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/chai@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-chai-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom basic sbom - cyclonedx > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0"
+      }
+    ],
+    "component": {
+      "bom-ref": "test-npm-sbom@1.0.0",
+      "type": "application",
+      "name": "prefix",
+      "version": "1.0.0",
+      "scope": "required",
+      "purl": "pkg:npm/test-npm-sbom@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [
+    {
+      "bom-ref": "chai@1.0.0",
+      "type": "library",
+      "name": "chai",
+      "version": "1.0.0",
+      "scope": "required",
+      "purl": "pkg:npm/chai@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": "node_modules/chai"
+        }
+      ],
+      "externalReferences": []
+    },
+    {
+      "bom-ref": "foo@1.0.0",
+      "type": "library",
+      "name": "foo",
+      "version": "1.0.0",
+      "scope": "required",
+      "purl": "pkg:npm/foo@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": "node_modules/foo"
+        }
+      ],
+      "externalReferences": []
+    },
+    {
+      "bom-ref": "dog@1.0.0",
+      "type": "library",
+      "name": "dog",
+      "version": "1.0.0",
+      "scope": "required",
+      "purl": "pkg:npm/dog@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": "node_modules/foo/node_modules/dog"
+        }
+      ],
+      "externalReferences": []
+    }
+  ],
+  "dependencies": [
+    {
+      "ref": "test-npm-sbom@1.0.0",
+      "dependsOn": [
+        "foo@1.0.0",
+        "chai@1.0.0"
+      ]
+    },
+    {
+      "ref": "chai@1.0.0",
+      "dependsOn": []
+    },
+    {
+      "ref": "foo@1.0.0",
+      "dependsOn": [
+        "dog@1.0.0"
+      ]
+    },
+    {
+      "ref": "dog@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom basic sbom - spdx > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "test-npm-sbom@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-test-npm-sbom-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "test-npm-sbom",
+      "SPDXID": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/test-npm-sbom@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "chai",
+      "SPDXID": "SPDXRef-Package-chai-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/chai",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/chai@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "foo",
+      "SPDXID": "SPDXRef-Package-foo-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/foo@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "dog",
+      "SPDXID": "SPDXRef-Package-dog-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo/node_modules/dog",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dog@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-foo-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-sbom-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-chai-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-foo-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dog-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom extraneous dep > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "test-npm-ls@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-test-npm-ls-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "test-npm-ls",
+      "SPDXID": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/test-npm-ls@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "chai",
+      "SPDXID": "SPDXRef-Package-chai-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/chai",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/chai@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "foo",
+      "SPDXID": "SPDXRef-Package-foo-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/foo@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "dog",
+      "SPDXID": "SPDXRef-Package-dog-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo/node_modules/dog",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dog@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-foo-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-foo-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dog-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-chai-1.0.0",
+      "relationshipType": "OPTIONAL_DEPENDENCY_OF"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom loading a tree containing workspaces should filter worksapces with --workspace > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "workspaces-tree@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-workspaces-tree-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "workspaces-tree",
+      "SPDXID": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/workspaces-tree@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "a",
+      "SPDXID": "SPDXRef-Package-a-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/a",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/a@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "d",
+      "SPDXID": "SPDXRef-Package-d-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/d",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/d@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "bar",
+      "SPDXID": "SPDXRef-Package-bar-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/bar",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/bar@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "baz",
+      "SPDXID": "SPDXRef-Package-baz-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/baz",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/baz@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "c",
+      "SPDXID": "SPDXRef-Package-c-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/c",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/c@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "foo",
+      "SPDXID": "SPDXRef-Package-foo-1.1.1",
+      "versionInfo": "1.1.1",
+      "packageFileName": "node_modules/foo",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/foo@1.1.1"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-a-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-d-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-a-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-c-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-a-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-d-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-a-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-baz-1.0.0",
+      "relationshipType": "DEV_DEPENDENCY_OF"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-d-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-foo-1.1.1",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-foo-1.1.1",
+      "relatedSpdxElement": "SPDXRef-Package-bar-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom loading a tree containing workspaces should filter workspaces with multiple --workspace flags > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "workspaces-tree@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-workspaces-tree-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "workspaces-tree",
+      "SPDXID": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/workspaces-tree@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "e",
+      "SPDXID": "SPDXRef-Package-e-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/e",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/e@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "f",
+      "SPDXID": "SPDXRef-Package-f-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/f",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/f@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-e-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-f-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom loading a tree containing workspaces should list workspaces properly with default configs > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "workspaces-tree@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-workspaces-tree-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "workspaces-tree",
+      "SPDXID": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/workspaces-tree@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "a",
+      "SPDXID": "SPDXRef-Package-a-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/a",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/a@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "b",
+      "SPDXID": "SPDXRef-Package-b-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/b",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/b@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "d",
+      "SPDXID": "SPDXRef-Package-d-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/d",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/d@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "e",
+      "SPDXID": "SPDXRef-Package-e-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/e",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/e@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "f",
+      "SPDXID": "SPDXRef-Package-f-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/f",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/f@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "bar",
+      "SPDXID": "SPDXRef-Package-bar-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/bar",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/bar@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "baz",
+      "SPDXID": "SPDXRef-Package-baz-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/baz",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/baz@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "c",
+      "SPDXID": "SPDXRef-Package-c-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/c",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/c@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "foo",
+      "SPDXID": "SPDXRef-Package-foo-1.1.1",
+      "versionInfo": "1.1.1",
+      "packageFileName": "node_modules/foo",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/foo@1.1.1"
+        }
+      ]
+    },
+    {
+      "name": "pacote",
+      "SPDXID": "SPDXRef-Package-pacote-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/pacote",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/pacote@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-a-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-b-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-d-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-e-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-f-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-pacote-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-a-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-c-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-a-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-d-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-a-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-baz-1.0.0",
+      "relationshipType": "DEV_DEPENDENCY_OF"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-d-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-foo-1.1.1",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-foo-1.1.1",
+      "relatedSpdxElement": "SPDXRef-Package-bar-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom loading a tree containing workspaces should not list workspaces with --no-workspaces > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "workspaces-tree@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-workspaces-tree-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "workspaces-tree",
+      "SPDXID": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/workspaces-tree@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "pacote",
+      "SPDXID": "SPDXRef-Package-pacote-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/pacote",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/pacote@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-workspaces-tree-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-pacote-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom lock file only - missing lock file > must match snapshot 1`] = `
+
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom lock file only > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "test-npm-ls@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-test-npm-ls-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "test-npm-ls",
+      "SPDXID": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/test-npm-ls@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "chai",
+      "SPDXID": "SPDXRef-Package-chai-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/chai",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/chai@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "dog",
+      "SPDXID": "SPDXRef-Package-dog-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/dog",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dog@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "foo",
+      "SPDXID": "SPDXRef-Package-foo-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/foo@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-foo-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-chai-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-foo-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dog-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom missing (optional) dep > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "test-npm-ls@1.0.0",
+  "documentNamespace": "http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-00000000-0000-0000-0000-000000000000",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0"
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-test-npm-ls-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "test-npm-ls",
+      "SPDXID": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "LIBRARY",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/test-npm-ls@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "chai",
+      "SPDXID": "SPDXRef-Package-chai-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/chai",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/chai@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "foo",
+      "SPDXID": "SPDXRef-Package-foo-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/foo@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "dog",
+      "SPDXID": "SPDXRef-Package-dog-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "node_modules/foo/node_modules/dog",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dog@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-foo-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-test-npm-ls-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-chai-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-foo-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dog-1.0.0",
+      "relationshipType": "DEPENDS_ON"
+    }
+  ]
+}
+`
+
+exports[`test/lib/commands/sbom.js TAP sbom missing format > must match snapshot 1`] = `
+
+`
diff --git a/deps/npm/tap-snapshots/test/lib/commands/search.js.test.cjs b/deps/npm/tap-snapshots/test/lib/commands/search.js.test.cjs
index a47cdba22003fe..50032deb745739 100644
--- a/deps/npm/tap-snapshots/test/lib/commands/search.js.test.cjs
+++ b/deps/npm/tap-snapshots/test/lib/commands/search.js.test.cjs
@@ -21,7 +21,7 @@ NAME                      | DESCRIPTION          | AUTHOR          | DATE
 libnpmhook                | programmatic API…    | =nlf…           | 2020-11-03 | 6.0.1    | npm hooks registry npm api
 libnpmpublish             | Programmatic API…    | =nlf…           | 2020-11-03 | 4.0.0    |
 libnpmfund                | Programmatic API…    | =nlf…           | 2020-12-08 | 1.0.2    | npm npmcli libnpm cli git fund gitfund
-@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm npmcli libnpm cli workspaces map-workspaces
+@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm  bad map npmcli libnpm cli workspaces map-workspaces
 libnpmversion             | library to do the…   | =nlf…           | 2020-11-04 | 1.0.7    |
 @types/libnpmsearch       | TypeScript…          | =types          | 2019-09-26 | 2.0.1    |
 pkg-no-desc               |                      | =lukekarrys     | 2019-09-26 | 1.0.0    |
@@ -39,7 +39,7 @@ NAME                      | DESCRIPTION          | AUTHOR          | DATE
 libnpmhook                | programmatic API…    | =nlf…           | 2020-11-03 | 6.0.1    | npm hooks registry npm api
 libnpmpublish             | Programmatic API…    | =nlf…           | 2020-11-03 | 4.0.0    | 
 libnpmfund                | Programmatic API…    | =nlf…           | 2020-12-08 | 1.0.2    | npm npmcli libnpm cli git fund gitfund
-@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm npmcli libnpm cli workspaces map-workspaces
+@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm  bad map npmcli libnpm cli workspaces map-workspaces
 libnpmversion             | library to do the…   | =nlf…           | 2020-11-04 | 1.0.7    | 
 @types/libnpmsearch       | TypeScript…          | =types          | 2019-09-26 | 2.0.1    | 
 pkg-no-desc               |                      | =lukekarrys     | 2019-09-26 | 1.0.0    | 
@@ -56,7 +56,7 @@ libnpmteam	npm Team management APIs	=nlf =ruyadorno =darcyclarke =isaacs	2020-11
 libnpmhook	programmatic API for managing npm registry hooks	=nlf =ruyadorno =darcyclarke =isaacs	2020-11-03 	6.0.1	npm hooks registry npm api
 libnpmpublish	Programmatic API for the bits behind npm publish and unpublish	=nlf =ruyadorno =darcyclarke =isaacs	2020-11-03 	4.0.0
 libnpmfund	Programmatic API for npm fund	=nlf =ruyadorno =darcyclarke =isaacs	2020-12-08 	1.0.2	npm npmcli libnpm cli git fund gitfund
-@npmcli/map-workspaces	Retrieves a name:pathname Map for a given workspaces config	=nlf =ruyadorno =darcyclarke =isaacs	2020-09-30 	1.0.1	npm npmcli libnpm cli workspaces map-workspaces
+@npmcli/map-workspaces	Retrieves a name:pathname Map for a given workspaces config	=nlf =ruyadorno =darcyclarke =isaacs	2020-09-30 	1.0.1	npm  bad map npmcli libnpm cli workspaces map-workspaces
 libnpmversion	library to do the things that 'npm version' does	=nlf =ruyadorno =darcyclarke =isaacs	2020-11-04 	1.0.7
 @types/libnpmsearch	TypeScript definitions for libnpmsearch	=types	2019-09-26 	2.0.1
 pkg-no-desc		=lukekarrys	2019-09-26 	1.0.0
@@ -80,7 +80,7 @@ libnpmteam                | npm Team management… | =nlf…           | 2020-11
 libnpmhook                | programmatic API…    | =nlf…           | 2020-11-03 | 6.0.1    | npm hooks registry npm api
 libnpmpublish             | Programmatic API…    | =nlf…           | 2020-11-03 | 4.0.0    |
 libnpmfund                | Programmatic API…    | =nlf…           | 2020-12-08 | 1.0.2    | npm npmcli libnpm cli git fund gitfund
-@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm npmcli libnpm cli workspaces map-workspaces
+@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm  bad map npmcli libnpm cli workspaces map-workspaces
 libnpmversion             | library to do the…   | =nlf…           | 2020-11-04 | 1.0.7    |
 @types/libnpmsearch       | TypeScript…          | =types          | 2019-09-26 | 2.0.1    |
 pkg-no-desc               |                      | =lukekarrys     | 2019-09-26 | 1.0.0    |
@@ -98,7 +98,7 @@ libnpmteam                | npm Team management… | =nlf…           | 2020-11
 libnpmhook                | programmatic API…    | =nlf…           | 2020-11-03 | 6.0.1    | npm hooks registry npm api
 libnpmpublish             | Programmatic API…    | =nlf…           | 2020-11-03 | 4.0.0    |
 libnpmfund                | Programmatic API…    | =nlf…           | 2020-12-08 | 1.0.2    | npm npmcli libnpm cli git fund gitfund
-@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm npmcli libnpm cli workspaces map-workspaces
+@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm  bad map npmcli libnpm cli workspaces map-workspaces
 @types/libnpmsearch       | TypeScript…          | =types          | 2019-09-26 | 2.0.1    |
 pkg-no-desc               |                      | =lukekarrys     | 2019-09-26 | 1.0.0    |
 `
@@ -115,7 +115,7 @@ libnpmteam                | npm Team management… | =nlf…           | 2020-11
 libnpmhook                | programmatic API…    | =nlf…           | 2020-11-03 | 6.0.1    | npm hooks registry npm api
 libnpmpublish             | Programmatic API…    | =nlf…           | 2020-11-03 | 4.0.0    |
 libnpmfund                | Programmatic API…    | =nlf…           | 2020-12-08 | 1.0.2    | npm npmcli libnpm cli git fund gitfund
-@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm npmcli libnpm cli workspaces map-workspaces
+@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm  bad map npmcli libnpm cli workspaces map-workspaces
 @types/libnpmsearch       | TypeScript…          | =types          | 2019-09-26 | 2.0.1    |
 pkg-no-desc               |                      | =lukekarrys     | 2019-09-26 | 1.0.0    |
 `
@@ -132,7 +132,7 @@ libnpmteam                | npm Team management… | =nlf…           | 2020-11
 libnpmhook                | programmatic API…    | =nlf…           | 2020-11-03 | 6.0.1    | npm hooks registry npm api
 libnpmpublish             | Programmatic API…    | =nlf…           | 2020-11-03 | 4.0.0    |
 libnpmfund                | Programmatic API…    | =nlf…           | 2020-12-08 | 1.0.2    | npm npmcli libnpm cli git fund gitfund
-@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm npmcli libnpm cli workspaces map-workspaces
+@npmcli/map-workspaces    | Retrieves a…         | =nlf…           | 2020-09-30 | 1.0.1    | npm  bad map npmcli libnpm cli workspaces map-workspaces
 @types/libnpmsearch       | TypeScript…          | =types          | 2019-09-26 | 2.0.1    |
 pkg-no-desc               |                      | =lukekarrys     | 2019-09-26 | 1.0.0    |
 `
diff --git a/deps/npm/tap-snapshots/test/lib/docs.js.test.cjs b/deps/npm/tap-snapshots/test/lib/docs.js.test.cjs
index a7e3e6f665af18..55397121bc0da8 100644
--- a/deps/npm/tap-snapshots/test/lib/docs.js.test.cjs
+++ b/deps/npm/tap-snapshots/test/lib/docs.js.test.cjs
@@ -145,6 +145,7 @@ Array [
   "restart",
   "root",
   "run-script",
+  "sbom",
   "search",
   "set",
   "shrinkwrap",
@@ -1405,6 +1406,26 @@ or \`--save-optional\` are true.
 
 
 
+#### \`sbom-format\`
+
+* Default: null
+* Type: "cyclonedx" or "spdx"
+
+SBOM format to use when generating SBOMs.
+
+
+
+#### \`sbom-type\`
+
+* Default: "library"
+* Type: "library", "application", or "framework"
+
+The type of package described by the generated SBOM. For SPDX, this is the
+value for the \`primaryPackagePurpose\` fieled. For CycloneDX, this is the
+value for the \`type\` field.
+
+
+
 #### \`scope\`
 
 * Default: the scope of the current project, if any, or ""
@@ -2083,6 +2104,8 @@ Array [
   "legacy-peer-deps",
   "link",
   "local-address",
+  "sbom-format",
+  "sbom-type",
   "location",
   "lockfile-version",
   "loglevel",
@@ -2225,6 +2248,8 @@ Array [
   "legacy-bundling",
   "legacy-peer-deps",
   "local-address",
+  "sbom-format",
+  "sbom-type",
   "location",
   "lockfile-version",
   "loglevel",
@@ -2415,6 +2440,8 @@ Object {
   "save": true,
   "saveBundle": false,
   "savePrefix": "^",
+  "sbomFormat": null,
+  "sbomType": "library",
   "scope": "",
   "scriptShell": undefined,
   "search": Object {
@@ -2552,8 +2579,9 @@ npm audit [fix|signatures]
 
 Options:
 [--audit-level <info|low|moderate|high|critical|none>] [--dry-run] [-f|--force]
-[--json] [--package-lock-only]
+[--json] [--package-lock-only] [--no-package-lock]
 [--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
 [--foreground-scripts] [--ignore-scripts]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
 [-ws|--workspaces] [--include-workspace-root] [--install-links]
@@ -2569,7 +2597,9 @@ npm audit [fix|signatures]
 #### \`force\`
 #### \`json\`
 #### \`package-lock-only\`
+#### \`package-lock\`
 #### \`omit\`
+#### \`include\`
 #### \`foreground-scripts\`
 #### \`ignore-scripts\`
 #### \`workspace\`
@@ -2641,6 +2671,7 @@ npm ci
 Options:
 [--install-strategy <hoisted|nested|shallow|linked>] [--legacy-bundling]
 [--global-style] [--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
 [--strict-peer-deps] [--foreground-scripts] [--ignore-scripts] [--no-audit]
 [--no-bin-links] [--no-fund] [--dry-run]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
@@ -2660,6 +2691,7 @@ aliases: clean-install, ic, install-clean, isntall-clean
 #### \`legacy-bundling\`
 #### \`global-style\`
 #### \`omit\`
+#### \`include\`
 #### \`strict-peer-deps\`
 #### \`foreground-scripts\`
 #### \`ignore-scripts\`
@@ -2738,8 +2770,9 @@ npm dedupe
 Options:
 [--install-strategy <hoisted|nested|shallow|linked>] [--legacy-bundling]
 [--global-style] [--strict-peer-deps] [--no-package-lock]
-[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]] [--ignore-scripts]
-[--no-audit] [--no-bin-links] [--no-fund] [--dry-run]
+[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
+[--ignore-scripts] [--no-audit] [--no-bin-links] [--no-fund] [--dry-run]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
 [-ws|--workspaces] [--include-workspace-root] [--install-links]
 
@@ -2759,6 +2792,7 @@ alias: ddp
 #### \`strict-peer-deps\`
 #### \`package-lock\`
 #### \`omit\`
+#### \`include\`
 #### \`ignore-scripts\`
 #### \`audit\`
 #### \`bin-links\`
@@ -2884,7 +2918,7 @@ alias: home
 `
 
 exports[`test/lib/docs.js TAP usage doctor > must match snapshot 1`] = `
-Check your npm environment
+Check the health of your npm environment
 
 Usage:
 npm doctor [ping] [registry] [versions] [environment] [permissions] [cache]
@@ -3009,8 +3043,9 @@ npm find-dupes
 Options:
 [--install-strategy <hoisted|nested|shallow|linked>] [--legacy-bundling]
 [--global-style] [--strict-peer-deps] [--no-package-lock]
-[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]] [--ignore-scripts]
-[--no-audit] [--no-bin-links] [--no-fund]
+[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
+[--ignore-scripts] [--no-audit] [--no-bin-links] [--no-fund]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
 [-ws|--workspaces] [--include-workspace-root] [--install-links]
 
@@ -3026,6 +3061,7 @@ npm find-dupes
 #### \`strict-peer-deps\`
 #### \`package-lock\`
 #### \`omit\`
+#### \`include\`
 #### \`ignore-scripts\`
 #### \`audit\`
 #### \`bin-links\`
@@ -3159,7 +3195,9 @@ npm init <package-spec> (same as \`npx <package-spec>\`)
 npm init <@scope> (same as \`npx <@scope>/create\`)
 
 Options:
-[-y|--yes] [-f|--force] [--scope <@scope>]
+[--init-author-name <name>] [--init-author-url <url>] [--init-license <license>]
+[--init-module <module>] [--init-version <version>] [-y|--yes] [-f|--force]
+[--scope <@scope>]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
 [-ws|--workspaces] [--no-workspaces-update] [--include-workspace-root]
 
@@ -3174,6 +3212,11 @@ npm init <@scope> (same as \`npx <@scope>/create\`)
 aliases: create, innit
 \`\`\`
 
+#### \`init-author-name\`
+#### \`init-author-url\`
+#### \`init-license\`
+#### \`init-module\`
+#### \`init-version\`
 #### \`yes\`
 #### \`force\`
 #### \`scope\`
@@ -3194,6 +3237,7 @@ Options:
 [-E|--save-exact] [-g|--global]
 [--install-strategy <hoisted|nested|shallow|linked>] [--legacy-bundling]
 [--global-style] [--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
 [--strict-peer-deps] [--prefer-dedupe] [--no-package-lock] [--package-lock-only]
 [--foreground-scripts] [--ignore-scripts] [--no-audit] [--no-bin-links]
 [--no-fund] [--dry-run] [--cpu <cpu>] [--os <os>]
@@ -3217,6 +3261,7 @@ aliases: add, i, in, ins, inst, insta, instal, isnt, isnta, isntal, isntall
 #### \`legacy-bundling\`
 #### \`global-style\`
 #### \`omit\`
+#### \`include\`
 #### \`strict-peer-deps\`
 #### \`prefer-dedupe\`
 #### \`package-lock\`
@@ -3244,6 +3289,7 @@ npm install-ci-test
 Options:
 [--install-strategy <hoisted|nested|shallow|linked>] [--legacy-bundling]
 [--global-style] [--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
 [--strict-peer-deps] [--foreground-scripts] [--ignore-scripts] [--no-audit]
 [--no-bin-links] [--no-fund] [--dry-run]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
@@ -3263,6 +3309,7 @@ aliases: cit, clean-install-test, sit
 #### \`legacy-bundling\`
 #### \`global-style\`
 #### \`omit\`
+#### \`include\`
 #### \`strict-peer-deps\`
 #### \`foreground-scripts\`
 #### \`ignore-scripts\`
@@ -3287,6 +3334,7 @@ Options:
 [-E|--save-exact] [-g|--global]
 [--install-strategy <hoisted|nested|shallow|linked>] [--legacy-bundling]
 [--global-style] [--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
 [--strict-peer-deps] [--prefer-dedupe] [--no-package-lock] [--package-lock-only]
 [--foreground-scripts] [--ignore-scripts] [--no-audit] [--no-bin-links]
 [--no-fund] [--dry-run] [--cpu <cpu>] [--os <os>]
@@ -3310,6 +3358,7 @@ alias: it
 #### \`legacy-bundling\`
 #### \`global-style\`
 #### \`omit\`
+#### \`include\`
 #### \`strict-peer-deps\`
 #### \`prefer-dedupe\`
 #### \`package-lock\`
@@ -3339,8 +3388,9 @@ Options:
 [-E|--save-exact] [-g|--global]
 [--install-strategy <hoisted|nested|shallow|linked>] [--legacy-bundling]
 [--global-style] [--strict-peer-deps] [--no-package-lock]
-[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]] [--ignore-scripts]
-[--no-audit] [--no-bin-links] [--no-fund] [--dry-run]
+[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
+[--ignore-scripts] [--no-audit] [--no-bin-links] [--no-fund] [--dry-run]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
 [-ws|--workspaces] [--include-workspace-root] [--install-links]
 
@@ -3363,6 +3413,7 @@ alias: ln
 #### \`strict-peer-deps\`
 #### \`package-lock\`
 #### \`omit\`
+#### \`include\`
 #### \`ignore-scripts\`
 #### \`audit\`
 #### \`bin-links\`
@@ -3382,8 +3433,9 @@ npm ll [[<@scope>/]<pkg> ...]
 
 Options:
 [-a|--all] [--json] [-l|--long] [-p|--parseable] [-g|--global] [--depth <depth>]
-[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]] [--link]
-[--package-lock-only] [--unicode]
+[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
+[--link] [--package-lock-only] [--unicode]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
 [-ws|--workspaces] [--include-workspace-root] [--install-links]
 
@@ -3404,6 +3456,7 @@ alias: la
 #### \`global\`
 #### \`depth\`
 #### \`omit\`
+#### \`include\`
 #### \`link\`
 #### \`package-lock-only\`
 #### \`unicode\`
@@ -3464,8 +3517,9 @@ npm ls <package-spec>
 
 Options:
 [-a|--all] [--json] [-l|--long] [-p|--parseable] [-g|--global] [--depth <depth>]
-[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]] [--link]
-[--package-lock-only] [--unicode]
+[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
+[--link] [--package-lock-only] [--unicode]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
 [-ws|--workspaces] [--include-workspace-root] [--install-links]
 
@@ -3486,6 +3540,7 @@ alias: list
 #### \`global\`
 #### \`depth\`
 #### \`omit\`
+#### \`include\`
 #### \`link\`
 #### \`package-lock-only\`
 #### \`unicode\`
@@ -3736,8 +3791,9 @@ Usage:
 npm prune [[<@scope>/]<pkg>...]
 
 Options:
-[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]] [--dry-run]
-[--json] [--foreground-scripts] [--ignore-scripts]
+[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
+[--dry-run] [--json] [--foreground-scripts] [--ignore-scripts]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
 [-ws|--workspaces] [--include-workspace-root] [--install-links]
 
@@ -3748,6 +3804,7 @@ npm prune [[<@scope>/]<pkg>...]
 \`\`\`
 
 #### \`omit\`
+#### \`include\`
 #### \`dry-run\`
 #### \`json\`
 #### \`foreground-scripts\`
@@ -3796,7 +3853,7 @@ npm query <selector>
 Options:
 [-g|--global]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
-[-ws|--workspaces] [--include-workspace-root]
+[-ws|--workspaces] [--include-workspace-root] [--package-lock-only]
 
 Run "npm help query" for more info
 
@@ -3808,6 +3865,7 @@ npm query <selector>
 #### \`workspace\`
 #### \`workspaces\`
 #### \`include-workspace-root\`
+#### \`package-lock-only\`
 `
 
 exports[`test/lib/docs.js TAP usage rebuild > must match snapshot 1`] = `
@@ -3934,6 +3992,33 @@ aliases: run, rum, urn
 #### \`script-shell\`
 `
 
+exports[`test/lib/docs.js TAP usage sbom > must match snapshot 1`] = `
+Generate a Software Bill of Materials (SBOM)
+
+Usage:
+npm sbom
+
+Options:
+[--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--package-lock-only] [--sbom-format <cyclonedx|spdx>]
+[--sbom-type <library|application|framework>]
+[-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
+[-ws|--workspaces]
+
+Run "npm help sbom" for more info
+
+\`\`\`bash
+npm sbom
+\`\`\`
+
+#### \`omit\`
+#### \`package-lock-only\`
+#### \`sbom-format\`
+#### \`sbom-type\`
+#### \`workspace\`
+#### \`workspaces\`
+`
+
 exports[`test/lib/docs.js TAP usage search > must match snapshot 1`] = `
 Search for packages
 
@@ -4256,6 +4341,7 @@ Options:
 [-g|--global] [--install-strategy <hoisted|nested|shallow|linked>]
 [--legacy-bundling] [--global-style]
 [--omit <dev|optional|peer> [--omit <dev|optional|peer> ...]]
+[--include <prod|dev|optional|peer> [--include <prod|dev|optional|peer> ...]]
 [--strict-peer-deps] [--no-package-lock] [--foreground-scripts]
 [--ignore-scripts] [--no-audit] [--no-bin-links] [--no-fund] [--dry-run]
 [-w|--workspace <workspace-name> [-w|--workspace <workspace-name> ...]]
@@ -4277,6 +4363,7 @@ aliases: up, upgrade, udpate
 #### \`legacy-bundling\`
 #### \`global-style\`
 #### \`omit\`
+#### \`include\`
 #### \`strict-peer-deps\`
 #### \`package-lock\`
 #### \`foreground-scripts\`
diff --git a/deps/npm/tap-snapshots/test/lib/npm.js.test.cjs b/deps/npm/tap-snapshots/test/lib/npm.js.test.cjs
index 7bebf9b78f2bb4..e29061291137eb 100644
--- a/deps/npm/tap-snapshots/test/lib/npm.js.test.cjs
+++ b/deps/npm/tap-snapshots/test/lib/npm.js.test.cjs
@@ -27,10 +27,10 @@ All commands:
     help-search, hook, init, install, install-ci-test,
     install-test, link, ll, login, logout, ls, org, outdated,
     owner, pack, ping, pkg, prefix, profile, prune, publish,
-    query, rebuild, repo, restart, root, run-script, search,
-    set, shrinkwrap, star, stars, start, stop, team, test,
-    token, uninstall, unpublish, unstar, update, version, view,
-    whoami
+    query, rebuild, repo, restart, root, run-script, sbom,
+    search, set, shrinkwrap, star, stars, start, stop, team,
+    test, token, uninstall, unpublish, unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
@@ -76,13 +76,13 @@ All commands:
     profile, prune, publish,
     query, rebuild, repo,
     restart, root,
-    run-script, search, set,
-    shrinkwrap, star, stars,
-    start, stop, team, test,
-    token, uninstall,
-    unpublish, unstar,
-    update, version, view,
-    whoami
+    run-script, sbom,
+    search, set, shrinkwrap,
+    star, stars, start,
+    stop, team, test, token,
+    uninstall, unpublish,
+    unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
@@ -128,13 +128,13 @@ All commands:
     profile, prune, publish,
     query, rebuild, repo,
     restart, root,
-    run-script, search, set,
-    shrinkwrap, star, stars,
-    start, stop, team, test,
-    token, uninstall,
-    unpublish, unstar,
-    update, version, view,
-    whoami
+    run-script, sbom,
+    search, set, shrinkwrap,
+    star, stars, start,
+    stop, team, test, token,
+    uninstall, unpublish,
+    unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
@@ -168,10 +168,10 @@ All commands:
     help-search, hook, init, install, install-ci-test,
     install-test, link, ll, login, logout, ls, org, outdated,
     owner, pack, ping, pkg, prefix, profile, prune, publish,
-    query, rebuild, repo, restart, root, run-script, search,
-    set, shrinkwrap, star, stars, start, stop, team, test,
-    token, uninstall, unpublish, unstar, update, version, view,
-    whoami
+    query, rebuild, repo, restart, root, run-script, sbom,
+    search, set, shrinkwrap, star, stars, start, stop, team,
+    test, token, uninstall, unpublish, unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
@@ -217,13 +217,13 @@ All commands:
     profile, prune, publish,
     query, rebuild, repo,
     restart, root,
-    run-script, search, set,
-    shrinkwrap, star, stars,
-    start, stop, team, test,
-    token, uninstall,
-    unpublish, unstar,
-    update, version, view,
-    whoami
+    run-script, sbom,
+    search, set, shrinkwrap,
+    star, stars, start,
+    stop, team, test, token,
+    uninstall, unpublish,
+    unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
@@ -269,13 +269,13 @@ All commands:
     profile, prune, publish,
     query, rebuild, repo,
     restart, root,
-    run-script, search, set,
-    shrinkwrap, star, stars,
-    start, stop, team, test,
-    token, uninstall,
-    unpublish, unstar,
-    update, version, view,
-    whoami
+    run-script, sbom,
+    search, set, shrinkwrap,
+    star, stars, start,
+    stop, team, test, token,
+    uninstall, unpublish,
+    unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
@@ -320,10 +320,10 @@ All commands:
     profile, prune, publish,
     query, rebuild, repo,
     restart, root,
-    run-script, search, set,
-    shrinkwrap, star, stars,
-    start, stop, team, test,
-    token, uninstall,
+    run-script, sbom, search,
+    set, shrinkwrap, star,
+    stars, start, stop, team,
+    test, token, uninstall,
     unpublish, unstar,
     update, version, view,
     whoami
@@ -360,10 +360,10 @@ All commands:
     help-search, hook, init, install, install-ci-test,
     install-test, link, ll, login, logout, ls, org, outdated,
     owner, pack, ping, pkg, prefix, profile, prune, publish,
-    query, rebuild, repo, restart, root, run-script, search,
-    set, shrinkwrap, star, stars, start, stop, team, test,
-    token, uninstall, unpublish, unstar, update, version, view,
-    whoami
+    query, rebuild, repo, restart, root, run-script, sbom,
+    search, set, shrinkwrap, star, stars, start, stop, team,
+    test, token, uninstall, unpublish, unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
@@ -397,10 +397,10 @@ All commands:
     help-search, hook, init, install, install-ci-test,
     install-test, link, ll, login, logout, ls, org, outdated,
     owner, pack, ping, pkg, prefix, profile, prune, publish,
-    query, rebuild, repo, restart, root, run-script, search,
-    set, shrinkwrap, star, stars, start, stop, team, test,
-    token, uninstall, unpublish, unstar, update, version, view,
-    whoami
+    query, rebuild, repo, restart, root, run-script, sbom,
+    search, set, shrinkwrap, star, stars, start, stop, team,
+    test, token, uninstall, unpublish, unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
@@ -434,10 +434,10 @@ All commands:
     help-search, hook, init, install, install-ci-test,
     install-test, link, ll, login, logout, ls, org, outdated,
     owner, pack, ping, pkg, prefix, profile, prune, publish,
-    query, rebuild, repo, restart, root, run-script, search,
-    set, shrinkwrap, star, stars, start, stop, team, test,
-    token, uninstall, unpublish, unstar, update, version, view,
-    whoami
+    query, rebuild, repo, restart, root, run-script, sbom,
+    search, set, shrinkwrap, star, stars, start, stop, team,
+    test, token, uninstall, unpublish, unstar, update, version,
+    view, whoami
 
 Specify configs in the ini-formatted file:
     {USERCONFIG}
diff --git a/deps/npm/tap-snapshots/test/lib/utils/sbom-cyclonedx.js.test.cjs b/deps/npm/tap-snapshots/test/lib/utils/sbom-cyclonedx.js.test.cjs
new file mode 100644
index 00000000000000..878dfd4be4705b
--- /dev/null
+++ b/deps/npm/tap-snapshots/test/lib/utils/sbom-cyclonedx.js.test.cjs
@@ -0,0 +1,1021 @@
+/* IMPORTANT
+ * This snapshot file is auto-generated, but designed for humans.
+ * It should be checked into source control and tracked carefully.
+ * Re-generate by setting TAP_SNAPSHOT=1 and running tests.
+ * Make sure to inspect the output below.  Do not ignore changes!
+ */
+'use strict'
+exports[`test/lib/utils/sbom-cyclonedx.js TAP node - with deps > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [
+    {
+      "bom-ref": "dep1@0.0.1",
+      "type": "library",
+      "name": "dep1",
+      "version": "0.0.1",
+      "scope": "required",
+      "purl": "pkg:npm/dep1@0.0.1",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": "node_modules/dep1"
+        }
+      ],
+      "externalReferences": []
+    },
+    {
+      "bom-ref": "dep2@0.0.2",
+      "type": "library",
+      "name": "dep2",
+      "version": "0.0.2",
+      "scope": "required",
+      "purl": "pkg:npm/dep2@0.0.2",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": "node_modules/dep2"
+        }
+      ],
+      "externalReferences": []
+    }
+  ],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": [
+        "dep1@0.0.1",
+        "dep2@0.0.2"
+      ]
+    },
+    {
+      "ref": "dep1@0.0.1",
+      "dependsOn": []
+    },
+    {
+      "ref": "dep2@0.0.2",
+      "dependsOn": [
+        "dep1@0.0.1"
+      ]
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - application package type > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "application",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - bundled > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        },
+        {
+          "name": "cdx:npm:package:bundled",
+          "value": "true"
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - development > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        },
+        {
+          "name": "cdx:npm:package:development",
+          "value": "true"
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - extraneous > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        },
+        {
+          "name": "cdx:npm:package:extraneous",
+          "value": "true"
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - from git url > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0?vcs_url=https://github.com/foo/bar#1234",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [
+        {
+          "type": "distribution",
+          "url": "https://github.com/foo/bar#1234"
+        }
+      ]
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - no package info > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - optional > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "optional",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - package lock only > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "pre-build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - private > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        },
+        {
+          "name": "cdx:npm:package:private",
+          "value": "true"
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with author object > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Arthur",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with description > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "description": "Package description",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": []
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with distribution url > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [
+        {
+          "type": "distribution",
+          "url": "https://registry.npmjs.org/root/-/root-1.0.0.tgz"
+        }
+      ]
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with homepage > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [
+        {
+          "type": "website",
+          "url": "https://foo.bar/README.md"
+        }
+      ]
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with integrity > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [],
+      "hashes": [
+        {
+          "alg": "SHA-512",
+          "content": "d5191b14650a7b1e25bec07dca121f5a5b493397192947ed07678d6a3683bf7742304a78f62046d0ad78b87f0d9d7f483eec76fa62bb24610e0748e7e3cfc9eb"
+        }
+      ]
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with issue tracker > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [
+        {
+          "type": "issue-tracker",
+          "url": "https://foo.bar/issues"
+        }
+      ]
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with license expression > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [],
+      "licenses": [
+        {
+          "expression": "(MIT OR Apache-2.0)"
+        }
+      ]
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with repository url > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [
+        {
+          "type": "vcs",
+          "url": "https://foo.bar"
+        }
+      ]
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-cyclonedx.js TAP single node - with single license > must match snapshot 1`] = `
+{
+  "$schema": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "bomFormat": "CycloneDX",
+  "specVersion": "1.5",
+  "serialNumber": "urn:uuid:00000000-0000-0000-0000-000000000000",
+  "version": 1,
+  "metadata": {
+    "timestamp": "2020-01-01T00:00:00.000Z",
+    "lifecycles": [
+      {
+        "phase": "build"
+      }
+    ],
+    "tools": [
+      {
+        "vendor": "npm",
+        "name": "cli",
+        "version": "10.0.0 "
+      }
+    ],
+    "component": {
+      "bom-ref": "root@1.0.0",
+      "type": "library",
+      "name": "root",
+      "version": "1.0.0",
+      "scope": "required",
+      "author": "Author",
+      "purl": "pkg:npm/root@1.0.0",
+      "properties": [
+        {
+          "name": "cdx:npm:package:path",
+          "value": ""
+        }
+      ],
+      "externalReferences": [],
+      "licenses": [
+        {
+          "license": {
+            "id": "ISC"
+          }
+        }
+      ]
+    }
+  },
+  "components": [],
+  "dependencies": [
+    {
+      "ref": "root@1.0.0",
+      "dependsOn": []
+    }
+  ]
+}
+`
diff --git a/deps/npm/tap-snapshots/test/lib/utils/sbom-spdx.js.test.cjs b/deps/npm/tap-snapshots/test/lib/utils/sbom-spdx.js.test.cjs
new file mode 100644
index 00000000000000..890bd29b7d2639
--- /dev/null
+++ b/deps/npm/tap-snapshots/test/lib/utils/sbom-spdx.js.test.cjs
@@ -0,0 +1,506 @@
+/* IMPORTANT
+ * This snapshot file is auto-generated, but designed for humans.
+ * It should be checked into source control and tracked carefully.
+ * Re-generate by setting TAP_SNAPSHOT=1 and running tests.
+ * Make sure to inspect the output below.  Do not ignore changes!
+ */
+'use strict'
+exports[`test/lib/utils/sbom-spdx.js TAP node - with deps > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "root@1.0.0",
+  "documentNamespace": "docns",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0 "
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-root-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "root",
+      "SPDXID": "SPDXRef-Package-root-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/root@1.0.0"
+        }
+      ]
+    },
+    {
+      "name": "dep1",
+      "SPDXID": "SPDXRef-Package-dep1-0.0.1",
+      "versionInfo": "0.0.1",
+      "packageFileName": "node_modules/dep1",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dep1@0.0.1"
+        }
+      ]
+    },
+    {
+      "name": "dep2",
+      "SPDXID": "SPDXRef-Package-dep2-0.0.2",
+      "versionInfo": "0.0.2",
+      "packageFileName": "node_modules/dep2",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dep2@0.0.2"
+        }
+      ]
+    },
+    {
+      "name": "dep3",
+      "SPDXID": "SPDXRef-Package-dep3-0.0.3",
+      "versionInfo": "0.0.3",
+      "packageFileName": "node_modules/dep3",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dep3@0.0.3"
+        }
+      ]
+    },
+    {
+      "name": "dep4",
+      "SPDXID": "SPDXRef-Package-dep4-0.0.4",
+      "versionInfo": "0.0.4",
+      "packageFileName": "node_modules/dep4",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dep4@0.0.4"
+        }
+      ]
+    },
+    {
+      "name": "dep5",
+      "SPDXID": "SPDXRef-Package-dep5-0.0.5",
+      "versionInfo": "0.0.5",
+      "packageFileName": "node_modules/dep5",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dep5@0.0.5"
+        }
+      ]
+    },
+    {
+      "name": "dep6",
+      "SPDXID": "SPDXRef-Package-dep6-0.0.6",
+      "versionInfo": "0.0.6",
+      "packageFileName": "node_modules/dep6",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/dep6@0.0.6"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-root-1.0.0",
+      "relationshipType": "DESCRIBES"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-root-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dep1-0.0.1",
+      "relationshipType": "HAS_PREREQUISITE"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-root-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dep2-0.0.2",
+      "relationshipType": "OPTIONAL_DEPENDENCY_OF"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-root-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dep3-0.0.3",
+      "relationshipType": "DEV_DEPENDENCY_OF"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-root-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dep4-0.0.4",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-dep4-0.0.4",
+      "relatedSpdxElement": "SPDXRef-Package-dep5-0.0.5",
+      "relationshipType": "DEPENDS_ON"
+    },
+    {
+      "spdxElementId": "SPDXRef-Package-root-1.0.0",
+      "relatedSpdxElement": "SPDXRef-Package-dep6-0.0.6",
+      "relationshipType": "OPTIONAL_DEPENDENCY_OF"
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-spdx.js TAP single node - application package type > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "root@1.0.0",
+  "documentNamespace": "docns",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0 "
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-root-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "root",
+      "SPDXID": "SPDXRef-Package-root-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "primaryPackagePurpose": "APPLICATION",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/root@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-root-1.0.0",
+      "relationshipType": "DESCRIBES"
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-spdx.js TAP single node - from git url > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "root@1.0.0",
+  "documentNamespace": "docns",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0 "
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-root-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "root",
+      "SPDXID": "SPDXRef-Package-root-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "downloadLocation": "https://github.com/foo/bar#1234",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/root@1.0.0?vcs_url=https://github.com/foo/bar#1234"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-root-1.0.0",
+      "relationshipType": "DESCRIBES"
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-spdx.js TAP single node - linked > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "root@1.0.0",
+  "documentNamespace": "docns",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0 "
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-root-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "root",
+      "SPDXID": "SPDXRef-Package-root-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/root@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-root-1.0.0",
+      "relationshipType": "DESCRIBES"
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-spdx.js TAP single node - with description > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "root@1.0.0",
+  "documentNamespace": "docns",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0 "
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-root-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "root",
+      "SPDXID": "SPDXRef-Package-root-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "description": "Package description",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/root@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-root-1.0.0",
+      "relationshipType": "DESCRIBES"
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-spdx.js TAP single node - with distribution url > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "root@1.0.0",
+  "documentNamespace": "docns",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0 "
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-root-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "root",
+      "SPDXID": "SPDXRef-Package-root-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "downloadLocation": "https://registry.npmjs.org/root/-/root-1.0.0.tgz",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/root@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-root-1.0.0",
+      "relationshipType": "DESCRIBES"
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-spdx.js TAP single node - with homepage > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "root@1.0.0",
+  "documentNamespace": "docns",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0 "
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-root-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "root",
+      "SPDXID": "SPDXRef-Package-root-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "https://foo.bar/README.md",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/root@1.0.0"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-root-1.0.0",
+      "relationshipType": "DESCRIBES"
+    }
+  ]
+}
+`
+
+exports[`test/lib/utils/sbom-spdx.js TAP single node - with integrity > must match snapshot 1`] = `
+{
+  "spdxVersion": "SPDX-2.3",
+  "dataLicense": "CC0-1.0",
+  "SPDXID": "SPDXRef-DOCUMENT",
+  "name": "root@1.0.0",
+  "documentNamespace": "docns",
+  "creationInfo": {
+    "created": "2020-01-01T00:00:00.000Z",
+    "creators": [
+      "Tool: npm/cli-10.0.0 "
+    ]
+  },
+  "documentDescribes": [
+    "SPDXRef-Package-root-1.0.0"
+  ],
+  "packages": [
+    {
+      "name": "root",
+      "SPDXID": "SPDXRef-Package-root-1.0.0",
+      "versionInfo": "1.0.0",
+      "packageFileName": "",
+      "downloadLocation": "NOASSERTION",
+      "filesAnalyzed": false,
+      "homepage": "NOASSERTION",
+      "licenseDeclared": "NOASSERTION",
+      "externalRefs": [
+        {
+          "referenceCategory": "PACKAGE-MANAGER",
+          "referenceType": "purl",
+          "referenceLocator": "pkg:npm/root@1.0.0"
+        }
+      ],
+      "checksums": [
+        {
+          "algorithm": "SHA512",
+          "checksumValue": "d5191b14650a7b1e25bec07dca121f5a5b493397192947ed07678d6a3683bf7742304a78f62046d0ad78b87f0d9d7f483eec76fa62bb24610e0748e7e3cfc9eb"
+        }
+      ]
+    }
+  ],
+  "relationships": [
+    {
+      "spdxElementId": "SPDXRef-DOCUMENT",
+      "relatedSpdxElement": "SPDXRef-Package-root-1.0.0",
+      "relationshipType": "DESCRIBES"
+    }
+  ]
+}
+`
diff --git a/deps/npm/test/bin/windows-shims.js b/deps/npm/test/bin/windows-shims.js
index 29c257fc7954d3..5e8a75842293d7 100644
--- a/deps/npm/test/bin/windows-shims.js
+++ b/deps/npm/test/bin/windows-shims.js
@@ -1,14 +1,13 @@
 const t = require('tap')
 const { spawnSync } = require('child_process')
 const { resolve, join, extname, basename, sep } = require('path')
-const { readFileSync, chmodSync, readdirSync } = require('fs')
+const { copyFileSync, readFileSync, chmodSync, readdirSync, rmSync } = require('fs')
 const Diff = require('diff')
 const { sync: which } = require('which')
 const { version } = require('../../package.json')
 
 const ROOT = resolve(__dirname, '../..')
 const BIN = join(ROOT, 'bin')
-const NODE = readFileSync(process.execPath)
 const SHIMS = readdirSync(BIN).reduce((acc, shim) => {
   if (extname(shim) !== '.js') {
     acc[shim] = readFileSync(join(BIN, shim), 'utf-8')
@@ -67,7 +66,6 @@ t.test('shim contents', t => {
 t.test('run shims', t => {
   const path = t.testdir({
     ...SHIMS,
-    'node.exe': NODE,
     // simulate the state where one version of npm is installed
     // with node, but we should load the globally installed one
     'global-prefix': {
@@ -92,6 +90,16 @@ t.test('run shims', t => {
     },
   })
 
+  // hacky fix to decrease flakes of this test from `NOTEMPTY: directory not empty, rmdir`
+  // this should get better in tap@18 and we can try removing it then
+  copyFileSync(process.execPath, join(path, 'node.exe'))
+  t.teardown(async () => {
+    rmSync(join(path, 'node.exe'))
+    await new Promise(res => setTimeout(res, 100))
+    // this is superstition
+    rmSync(join(path, 'node.exe'), { force: true })
+  })
+
   const spawnPath = (cmd, args, { log, stdioString = true, ...opts } = {}) => {
     if (cmd.endsWith('bash.exe')) {
       // only cygwin *requires* the -l, but the others are ok with it
diff --git a/deps/npm/test/fixtures/libnpmsearch-stream-result.js b/deps/npm/test/fixtures/libnpmsearch-stream-result.js
index ac792b1c087c8f..68245beff6e46f 100644
--- a/deps/npm/test/fixtures/libnpmsearch-stream-result.js
+++ b/deps/npm/test/fixtures/libnpmsearch-stream-result.js
@@ -217,6 +217,9 @@ module.exports = [
     description: 'Retrieves a name:pathname Map for a given workspaces config',
     keywords: [
       '\x1B[33mnpm\x1B[39m',
+      // eslint-disable-next-line no-octal-escape
+      '\x1b]4;0;?\007',
+      '\u001b[Hbad map',
       'npmcli',
       'libnpm',
       'cli',
diff --git a/deps/npm/test/lib/commands/audit.js b/deps/npm/test/lib/commands/audit.js
index 4a776e89bd9e9c..25ced6655e654a 100644
--- a/deps/npm/test/lib/commands/audit.js
+++ b/deps/npm/test/lib/commands/audit.js
@@ -210,6 +210,18 @@ t.test('audit fix - bulk endpoint', async t => {
   )
 })
 
+t.test('audit fix no package lock', async t => {
+  const { npm } = await loadMockNpm(t, {
+    config: {
+      'package-lock': false,
+    },
+  })
+  await t.rejects(
+    npm.exec('audit', ['fix']),
+    { code: 'EUSAGE' }
+  )
+})
+
 t.test('completion', async t => {
   const { audit } = await loadMockNpm(t, { command: 'audit' })
   t.test('fix', async t => {
diff --git a/deps/npm/test/lib/commands/bugs.js b/deps/npm/test/lib/commands/bugs.js
index 953c8e6345a2a7..e2ebfb53065748 100644
--- a/deps/npm/test/lib/commands/bugs.js
+++ b/deps/npm/test/lib/commands/bugs.js
@@ -6,6 +6,10 @@ const pacote = {
     return spec === 'nobugs' ? {
       name: 'nobugs',
       version: '1.2.3',
+    } : spec === 'nullbugs' ? {
+      name: 'nullbugs',
+      version: '1.2.3',
+      bugs: null,
     } : spec === 'bugsurl' ? {
       name: 'bugsurl',
       version: '1.2.3',
@@ -66,6 +70,7 @@ t.test('open bugs urls & emails', async t => {
   const expected = {
     '.': 'https://example.com',
     nobugs: 'https://www.npmjs.com/package/nobugs',
+    nullbugs: 'https://www.npmjs.com/package/nullbugs',
     'bugsobj-nourl': 'https://www.npmjs.com/package/bugsobj-nourl',
     bugsurl: 'https://bugzilla.localhost/bugsurl',
     bugsobj: 'https://bugzilla.localhost/bugsobj',
diff --git a/deps/npm/test/lib/commands/hook.js b/deps/npm/test/lib/commands/hook.js
index e4e1214b812f3b..d3de4f5c55efad 100644
--- a/deps/npm/test/lib/commands/hook.js
+++ b/deps/npm/test/lib/commands/hook.js
@@ -243,7 +243,7 @@ t.test('npm hook ls', async t => {
     'received the correct arguments'
   )
   t.equal(outputs[0][0], 'You have 3 hooks configured.', 'prints the correct header')
-  const out = require('../../../lib/utils/ansi-trim')(outputs[1][0])
+  const out = require('strip-ansi')(outputs[1][0])
   t.match(out, /semver.*https:\/\/google.com.*\n.*\n.*never triggered/, 'prints package hook')
   t.match(out, /@npmcli.*https:\/\/google.com.*\n.*\n.*triggered just now/, 'prints scope hook')
   t.match(out, /~npm.*https:\/\/google.com.*\n.*\n.*never triggered/, 'prints owner hook')
@@ -292,7 +292,7 @@ t.test('npm hook ls, single result', async t => {
     'received the correct arguments'
   )
   t.equal(outputs[0][0], 'You have one hook configured.', 'prints the correct header')
-  const out = require('../../../lib/utils/ansi-trim')(outputs[1][0])
+  const out = require('strip-ansi')(outputs[1][0])
   t.match(out, /semver.*https:\/\/google.com.*\n.*\n.*never triggered/, 'prints package hook')
 })
 
diff --git a/deps/npm/test/lib/commands/org.js b/deps/npm/test/lib/commands/org.js
index 511251e1bb096e..5c239295c33432 100644
--- a/deps/npm/test/lib/commands/org.js
+++ b/deps/npm/test/lib/commands/org.js
@@ -1,5 +1,5 @@
 const t = require('tap')
-const ansiTrim = require('../../../lib/utils/ansi-trim.js')
+const ansiTrim = require('strip-ansi')
 const mockNpm = require('../../fixtures/mock-npm')
 
 const mockOrg = async (t, { orgSize = 1, orgList = {}, ...npmOpts } = {}) => {
diff --git a/deps/npm/test/lib/commands/query.js b/deps/npm/test/lib/commands/query.js
index 2b9a5b49763235..adf617316772e5 100644
--- a/deps/npm/test/lib/commands/query.js
+++ b/deps/npm/test/lib/commands/query.js
@@ -179,3 +179,61 @@ t.test('global', async t => {
   await npm.exec('query', ['[name=lorem]'])
   t.matchSnapshot(joinedOutput(), 'should return global package')
 })
+
+t.test('package-lock-only', t => {
+  t.test('no package lock', async t => {
+    const { npm } = await loadMockNpm(t, {
+      config: {
+        'package-lock-only': true,
+      },
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'project',
+          dependencies: {
+            a: '^1.0.0',
+          },
+        }),
+      },
+    })
+    await t.rejects(npm.exec('query', [':root, :root > *']), { code: 'EUSAGE' })
+  })
+
+  t.test('with package lock', async t => {
+    const { npm, joinedOutput } = await loadMockNpm(t, {
+      config: {
+        'package-lock-only': true,
+      },
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'project',
+          dependencies: {
+            a: '^1.0.0',
+          },
+        }),
+        'package-lock.json': JSON.stringify({
+          name: 'project',
+          lockfileVersion: 3,
+          requires: true,
+          packages: {
+            '': {
+              dependencies: {
+                a: '^1.0.0',
+              },
+            },
+            'node_modules/a': {
+              version: '1.2.3',
+              resolved: 'https://dummy.npmjs.org/a/-/a-1.2.3.tgz',
+              integrity: 'sha512-dummy',
+              engines: {
+                node: '>=14.17',
+              },
+            },
+          },
+        }),
+      },
+    })
+    await npm.exec('query', ['*'])
+    t.matchSnapshot(joinedOutput(), 'should return valid response with only lock info')
+  })
+  t.end()
+})
diff --git a/deps/npm/test/lib/commands/sbom.js b/deps/npm/test/lib/commands/sbom.js
new file mode 100644
index 00000000000000..3c79ed82cf8370
--- /dev/null
+++ b/deps/npm/test/lib/commands/sbom.js
@@ -0,0 +1,503 @@
+const t = require('tap')
+const mockNpm = require('../../fixtures/mock-npm.js')
+
+const FAKE_TIMESTAMP = '2020-01-01T00:00:00.000Z'
+const FAKE_UUID = '00000000-0000-0000-0000-000000000000'
+
+t.cleanSnapshot = s => {
+  let sbom
+
+  try {
+    sbom = JSON.parse(s)
+  } catch (e) {
+    return s
+  }
+
+  // Clean dynamic values from snapshots. SPDX and CycloneDX have different
+  // formats for these values, so we need to do it separately.
+  if (sbom.SPDXID) {
+    sbom.documentNamespace = `http://spdx.org/spdxdocs/test-npm-sbom-1.0.0-${FAKE_UUID}`
+
+    if (sbom.creationInfo) {
+      sbom.creationInfo.created = FAKE_TIMESTAMP
+      sbom.creationInfo.creators = ['Tool: npm/cli-10.0.0']
+    }
+  } else {
+    sbom.serialNumber = `urn:uuid:${FAKE_UUID}`
+
+    if (sbom.metadata) {
+      sbom.metadata.timestamp = FAKE_TIMESTAMP
+      sbom.metadata.tools[0].version = '10.0.0'
+    }
+  }
+
+  return JSON.stringify(sbom, null, 2)
+}
+
+const simpleNmFixture = {
+  node_modules: {
+    foo: {
+      'package.json': JSON.stringify({
+        name: 'foo',
+        version: '1.0.0',
+        dependencies: {
+          dog: '^1.0.0',
+        },
+      }),
+      node_modules: {
+        dog: {
+          'package.json': JSON.stringify({
+            name: 'dog',
+            version: '1.0.0',
+          }),
+        },
+      },
+    },
+    chai: {
+      'package.json': JSON.stringify({
+        name: 'chai',
+        version: '1.0.0',
+      }),
+    },
+  },
+}
+
+const mockSbom = async (t, { mocks, config, ...opts } = {}) => {
+  const mock = await mockNpm(t, {
+    ...opts,
+    config: {
+      ...config,
+    },
+    command: 'sbom',
+    mocks: {
+      path: {
+        ...require('path'),
+        sep: '/',
+      },
+      ...mocks,
+    },
+  })
+
+  return {
+    ...mock,
+    result: () => mock.joinedOutput(),
+  }
+}
+
+t.test('sbom', async t => {
+  t.test('basic sbom - spdx', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-sbom',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^1.0.0',
+            chai: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await sbom.exec([])
+    t.matchSnapshot(result())
+  })
+
+  t.test('basic sbom - cyclonedx', async t => {
+    const config = {
+      'sbom-format': 'cyclonedx',
+      'sbom-type': 'application',
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-sbom',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^1.0.0',
+            chai: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await sbom.exec([])
+    t.matchSnapshot(result())
+  })
+
+  t.test('--omit dev', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+      omit: ['dev'],
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-sbom',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^1.0.0',
+          },
+          devDependencies: {
+            chai: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await sbom.exec([])
+    t.matchSnapshot(result())
+  })
+
+  t.test('--omit optional', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+      omit: ['optional'],
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-sbom',
+          version: '1.0.0',
+          dependencies: {
+            chai: '^1.0.0',
+          },
+          optionalDependencies: {
+            foo: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await sbom.exec([])
+    t.matchSnapshot(result())
+  })
+
+  t.test('--omit peer', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+      omit: ['peer'],
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-sbom',
+          version: '1.0.0',
+          dependencies: {
+            chai: '^1.0.0',
+          },
+          peerDependencies: {
+            foo: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await sbom.exec([])
+    t.matchSnapshot(result())
+  })
+
+  t.test('missing format', async t => {
+    const config = {}
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-sbom',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^1.0.0',
+            chai: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await t.rejects(sbom.exec([]), {
+      code: 'EUSAGE',
+      message: 'Must specify --sbom-format flag with one of: cyclonedx, spdx.',
+    },
+    'should throw error')
+
+    t.matchSnapshot(result())
+  })
+
+  t.test('invalid dep', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+    }
+    const { sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-ls',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^2.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await t.rejects(
+      sbom.exec([]),
+      { code: 'ESBOMPROBLEMS', message: /invalid: foo@1.0.0/ },
+      'should list dep problems'
+    )
+  })
+
+  t.test('missing dep', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+    }
+    const { sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-ls',
+          version: '1.0.0',
+          dependencies: {
+            ipsum: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await t.rejects(
+      sbom.exec([]),
+      { code: 'ESBOMPROBLEMS', message: /missing: ipsum@\^1.0.0/ },
+      'should list dep problems'
+    )
+  })
+
+  t.test('missing (optional) dep', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-ls',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^1.0.0',
+            chai: '^1.0.0',
+          },
+          optionalDependencies: {
+            ipsum: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await sbom.exec([])
+    t.matchSnapshot(result())
+  })
+
+  t.test('extraneous dep', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-ls',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^1.0.0',
+          },
+        }),
+        ...simpleNmFixture,
+      },
+    })
+    await sbom.exec([])
+    t.matchSnapshot(result())
+  })
+
+  t.test('lock file only', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+      'package-lock-only': true,
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-ls',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^1.0.0',
+            chai: '^1.0.0',
+          },
+        }),
+        'package-lock.json': JSON.stringify({
+          dependencies: {
+            foo: {
+              version: '1.0.0',
+              requires: {
+                dog: '^1.0.0',
+              },
+            },
+            dog: {
+              version: '1.0.0',
+            },
+            chai: {
+              version: '1.0.0',
+            },
+          },
+        }),
+      },
+    })
+    await sbom.exec([])
+    t.matchSnapshot(result())
+  })
+
+  t.test('lock file only - missing lock file', async t => {
+    const config = {
+      'sbom-format': 'spdx',
+      'package-lock-only': true,
+    }
+    const { result, sbom } = await mockSbom(t, {
+      config,
+      prefixDir: {
+        'package.json': JSON.stringify({
+          name: 'test-npm-ls',
+          version: '1.0.0',
+          dependencies: {
+            foo: '^1.0.0',
+            chai: '^1.0.0',
+          },
+        }),
+      },
+    })
+    await t.rejects(sbom.exec([]), {
+      code: 'EUSAGE',
+      message: 'A package lock or shrinkwrap file is required in package-lock-only mode',
+    },
+    'should throw error')
+
+    t.matchSnapshot(result())
+  })
+
+  t.test('loading a tree containing workspaces', async t => {
+    const mockWorkspaces = async (t, exec = [], config = {}) => {
+      const { result, sbom } = await mockSbom(t, {
+        config,
+        prefixDir: {
+          'package.json': JSON.stringify({
+            name: 'workspaces-tree',
+            version: '1.0.0',
+            workspaces: ['./a', './b', './d', './group/*'],
+            dependencies: { pacote: '1.0.0' },
+          }),
+          node_modules: {
+            a: t.fixture('symlink', '../a'),
+            b: t.fixture('symlink', '../b'),
+            c: {
+              'package.json': JSON.stringify({
+                name: 'c',
+                version: '1.0.0',
+              }),
+            },
+            d: t.fixture('symlink', '../d'),
+            e: t.fixture('symlink', '../group/e'),
+            f: t.fixture('symlink', '../group/f'),
+            foo: {
+              'package.json': JSON.stringify({
+                name: 'foo',
+                version: '1.1.1',
+                dependencies: {
+                  bar: '^1.0.0',
+                },
+              }),
+            },
+            bar: {
+              'package.json': JSON.stringify({ name: 'bar', version: '1.0.0' }),
+            },
+            baz: {
+              'package.json': JSON.stringify({ name: 'baz', version: '1.0.0' }),
+            },
+            pacote: {
+              'package.json': JSON.stringify({ name: 'pacote', version: '1.0.0' }),
+            },
+          },
+          a: {
+            'package.json': JSON.stringify({
+              name: 'a',
+              version: '1.0.0',
+              dependencies: {
+                c: '^1.0.0',
+                d: '^1.0.0',
+              },
+              devDependencies: {
+                baz: '^1.0.0',
+              },
+            }),
+          },
+          b: {
+            'package.json': JSON.stringify({
+              name: 'b',
+              version: '1.0.0',
+            }),
+          },
+          d: {
+            'package.json': JSON.stringify({
+              name: 'd',
+              version: '1.0.0',
+              dependencies: {
+                foo: '^1.1.1',
+              },
+            }),
+          },
+          group: {
+            e: {
+              'package.json': JSON.stringify({
+                name: 'e',
+                version: '1.0.0',
+              }),
+            },
+            f: {
+              'package.json': JSON.stringify({
+                name: 'f',
+                version: '1.0.0',
+              }),
+            },
+          },
+        },
+      })
+
+      await sbom.exec(exec)
+
+      t.matchSnapshot(result())
+    }
+
+    t.test('should list workspaces properly with default configs', t => mockWorkspaces(t, [], {
+      'sbom-format': 'spdx',
+    }))
+
+    t.test('should not list workspaces with --no-workspaces', t => mockWorkspaces(t, [], {
+      'sbom-format': 'spdx',
+      workspaces: false,
+    }))
+
+    t.test('should filter worksapces with --workspace', t => mockWorkspaces(t, [], {
+      'sbom-format': 'spdx',
+      workspace: 'a',
+    }))
+
+    t.test('should filter workspaces with multiple --workspace flags', t => mockWorkspaces(t, [], {
+      'sbom-format': 'spdx',
+      workspace: ['e', 'f'],
+    }))
+  })
+})
diff --git a/deps/npm/test/lib/utils/ansi-trim.js b/deps/npm/test/lib/utils/ansi-trim.js
deleted file mode 100644
index 5a9e3b0c87cba7..00000000000000
--- a/deps/npm/test/lib/utils/ansi-trim.js
+++ /dev/null
@@ -1,8 +0,0 @@
-const t = require('tap')
-const ansiTrim = require('../../../lib/utils/ansi-trim.js')
-
-t.test('basic', async t => {
-  const chalk = await import('chalk').then(v => v.default)
-  t.equal(ansiTrim('foo'), 'foo', 'does nothing if no ansis')
-  t.equal(ansiTrim(chalk.red('foo')), 'foo', 'strips out ansis')
-})
diff --git a/deps/npm/test/lib/utils/sbom-cyclonedx.js b/deps/npm/test/lib/utils/sbom-cyclonedx.js
new file mode 100644
index 00000000000000..540feb9eb0ee34
--- /dev/null
+++ b/deps/npm/test/lib/utils/sbom-cyclonedx.js
@@ -0,0 +1,245 @@
+const t = require('tap')
+const Ajv = require('ajv')
+const applyFormats = require('ajv-formats')
+const applyDraftFormats = require('ajv-formats-draft2019')
+const { cyclonedxOutput } = require('../../../lib/utils/sbom-cyclonedx.js')
+
+const FAKE_UUID = 'urn:uuid:00000000-0000-0000-0000-000000000000'
+
+t.cleanSnapshot = s => {
+  let sbom
+  try {
+    sbom = JSON.parse(s)
+  } catch (e) {
+    return s
+  }
+
+  sbom.serialNumber = FAKE_UUID
+  if (sbom.metadata) {
+    sbom.metadata.timestamp = '2020-01-01T00:00:00.000Z'
+  }
+
+  return JSON.stringify(sbom, null, 2)
+}
+
+const npm = { version: '10.0.0 ' }
+
+const rootPkg = {
+  author: 'Author',
+}
+
+const root = {
+  name: 'root',
+  packageName: 'root',
+  version: '1.0.0',
+  pkgid: 'root@1.0.0',
+  isRoot: true,
+  package: rootPkg,
+  location: '',
+  edgesOut: [],
+}
+
+const dep1 = {
+  name: 'dep1',
+  packageName: 'dep1',
+  version: '0.0.1',
+  pkgid: 'dep1@0.0.1',
+  package: {},
+  location: 'node_modules/dep1',
+  edgesOut: [],
+}
+
+const dep2 = {
+  name: 'dep2',
+  packageName: 'dep2',
+  version: '0.0.2',
+  pkgid: 'npm@npm:dep2@0.0.2',
+  package: {},
+  location: 'node_modules/dep2',
+  edgesOut: [{ to: dep1 }],
+}
+
+const dep2Link = {
+  name: 'dep2',
+  packageName: 'dep2',
+  version: '0.0.2',
+  pkgid: 'dep2@0.0.2',
+  package: {},
+  location: 'node_modules/dep2',
+  edgesOut: [],
+  isLink: true,
+  target: dep2,
+}
+
+t.test('single node - application package type', t => {
+  const res = cyclonedxOutput({ npm, nodes: [root], packageType: 'application' })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - package lock only', t => {
+  const res = cyclonedxOutput({ npm, nodes: [root], packageLockOnly: true })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - optional ', t => {
+  const node = { ...root, optional: true }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with description', t => {
+  const pkg = { ...rootPkg, description: 'Package description' }
+  const node = { ...root, package: pkg }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with author object', t => {
+  const pkg = { ...rootPkg, author: { name: 'Arthur' } }
+  const node = { ...root, package: pkg }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with integrity', t => {
+  /* eslint-disable-next-line max-len */
+  const node = { ...root, integrity: 'sha512-1RkbFGUKex4lvsB9yhIfWltJM5cZKUftB2eNajaDv3dCMEp49iBG0K14uH8NnX9IPux2+mK7JGEOB0jn48/J6w==' }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - development', t => {
+  const node = { ...root, dev: true }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - extraneous', t => {
+  const node = { ...root, extraneous: true }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - bundled', t => {
+  const node = { ...root, inBundle: true }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - private', t => {
+  const pkg = { ...rootPkg, private: true }
+  const node = { ...root, package: pkg }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with repository url', t => {
+  const pkg = { ...rootPkg, repository: { url: 'https://foo.bar' } }
+  const node = { ...root, package: pkg }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with homepage', t => {
+  const pkg = { ...rootPkg, homepage: 'https://foo.bar/README.md' }
+  const node = { ...root, package: pkg }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with issue tracker', t => {
+  const pkg = { ...rootPkg, bugs: { url: 'https://foo.bar/issues' } }
+  const node = { ...root, package: pkg }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with distribution url', t => {
+  const node = { ...root, resolved: 'https://registry.npmjs.org/root/-/root-1.0.0.tgz' }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with single license', t => {
+  const pkg = { ...rootPkg, license: 'ISC' }
+  const node = { ...root, package: pkg }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with license expression', t => {
+  const pkg = { ...rootPkg, license: '(MIT OR Apache-2.0)' }
+  const node = { ...root, package: pkg }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - from git url', t => {
+  const node = { ...root, type: 'git', resolved: 'https://github.com/foo/bar#1234' }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - no package info', t => {
+  const node = { ...root, package: undefined }
+  const res = cyclonedxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('node - with deps', t => {
+  const node = { ...root,
+    edgesOut: [
+      { to: dep1 },
+      { to: dep2 },
+      { to: undefined },
+      { to: { pkgid: 'foo' } },
+    ] }
+  const res = cyclonedxOutput({ npm, nodes: [node, dep1, dep2, dep2Link] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+// Check that all of the generated test snapshots validate against the CycloneDX schema
+t.test('schema validation', t => {
+  // Load schemas
+  const cdxSchema = require('../../schemas/cyclonedx/bom-1.5.schema.json')
+  const spdxLicenseSchema = require('../../schemas/cyclonedx/spdx.schema.json')
+  const jsfSchema = require('../../schemas/cyclonedx/jsf-0.82.schema.json')
+
+  const ajv = new Ajv({
+    strict: false,
+    schemas: [spdxLicenseSchema, jsfSchema, cdxSchema],
+  })
+  applyFormats(ajv)
+  applyDraftFormats(ajv)
+
+  // Retrieve compiled schema
+  const validate = ajv.getSchema('http://cyclonedx.org/schema/bom-1.5.schema.json')
+
+  // Load snapshots for all tests in this file
+  const sboms = require('../../../tap-snapshots/test/lib/utils/sbom-cyclonedx.js.test.cjs')
+
+  // Check that all snapshots validate against the CycloneDX schema
+  Object.entries(sboms).forEach(([name, sbom]) => {
+    t.ok(validate(JSON.parse(sbom)), { snapshot: name, error: validate.errors?.[0] })
+  })
+  t.end()
+})
diff --git a/deps/npm/test/lib/utils/sbom-spdx.js b/deps/npm/test/lib/utils/sbom-spdx.js
new file mode 100644
index 00000000000000..74f6c3f34e71c4
--- /dev/null
+++ b/deps/npm/test/lib/utils/sbom-spdx.js
@@ -0,0 +1,188 @@
+const t = require('tap')
+const Ajv = require('ajv')
+const { spdxOutput } = require('../../../lib/utils/sbom-spdx.js')
+
+t.cleanSnapshot = s => {
+  let sbom
+  try {
+    sbom = JSON.parse(s)
+  } catch (e) {
+    return s
+  }
+
+  sbom.documentNamespace = 'docns'
+
+  if (sbom.creationInfo) {
+    sbom.creationInfo.created = '2020-01-01T00:00:00.000Z'
+  }
+
+  return JSON.stringify(sbom, null, 2)
+}
+
+const npm = { version: '10.0.0 ' }
+
+const rootPkg = {
+  author: 'Author',
+}
+
+const root = {
+  packageName: 'root',
+  version: '1.0.0',
+  pkgid: 'root@1.0.0',
+  isRoot: true,
+  package: rootPkg,
+  location: '',
+  edgesOut: [],
+}
+
+const dep1 = {
+  packageName: 'dep1',
+  version: '0.0.1',
+  pkgid: 'dep1@0.0.1',
+  package: {},
+  location: 'node_modules/dep1',
+  edgesOut: [],
+}
+
+const dep2 = {
+  packageName: 'dep2',
+  version: '0.0.2',
+  pkgid: 'dep2@0.0.2',
+  package: {},
+  location: 'node_modules/dep2',
+  edgesOut: [],
+}
+
+const dep3 = {
+  packageName: 'dep3',
+  version: '0.0.3',
+  pkgid: 'dep3@0.0.3',
+  package: {},
+  location: 'node_modules/dep3',
+  edgesOut: [],
+}
+
+const dep5 = {
+  packageName: 'dep5',
+  version: '0.0.5',
+  pkgid: 'dep5@0.0.5',
+  package: {},
+  location: 'node_modules/dep5',
+  edgesOut: [],
+}
+
+const dep4 = {
+  packageName: 'dep4',
+  version: '0.0.4',
+  pkgid: 'npm@npm:dep4@0.0.4',
+  package: {},
+  location: 'dep4',
+  isWorkspace: true,
+  edgesOut: [{ to: dep5 }],
+}
+
+const dep4Link = {
+  packageName: 'dep4',
+  version: '0.0.4',
+  pkgid: 'dep4@0.0.4',
+  package: {},
+  location: 'node_modules/dep4',
+  isLink: true,
+  target: dep4,
+}
+
+dep4.linksIn = new Set([dep4Link])
+
+const dep6 = {
+  packageName: 'dep6',
+  version: '0.0.6',
+  pkgid: 'dep6@0.0.6',
+  extraneous: true,
+  package: {},
+  location: 'node_modules/dep6',
+  edgesOut: [],
+}
+
+t.test('single node - application package type', t => {
+  const res = spdxOutput({ npm, nodes: [root], packageType: 'application' })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with description', t => {
+  const pkg = { ...rootPkg, description: 'Package description' }
+  const node = { ...root, package: pkg }
+  const res = spdxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with distribution url', t => {
+  const node = { ...root, resolved: 'https://registry.npmjs.org/root/-/root-1.0.0.tgz' }
+  const res = spdxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with homepage', t => {
+  const pkg = { ...rootPkg, homepage: 'https://foo.bar/README.md' }
+  const node = { ...root, package: pkg }
+  const res = spdxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - with integrity', t => {
+  /* eslint-disable-next-line max-len */
+  const node = { ...root, integrity: 'sha512-1RkbFGUKex4lvsB9yhIfWltJM5cZKUftB2eNajaDv3dCMEp49iBG0K14uH8NnX9IPux2+mK7JGEOB0jn48/J6w==' }
+  const res = spdxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - from git url', t => {
+  const node = { ...root, type: 'git', resolved: 'https://github.com/foo/bar#1234' }
+  const res = spdxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('single node - linked', t => {
+  const node = { ...root, isLink: true, target: { edgesOut: [] } }
+  const res = spdxOutput({ npm, nodes: [node] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+t.test('node - with deps', t => {
+  const node = { ...root,
+    edgesOut: [
+      { to: dep1, type: 'peer' },
+      { to: dep2, type: 'optional' },
+      { to: dep3, type: 'dev' },
+      { to: dep4 },
+      { to: undefined },
+      { to: { packageName: 'foo' } },
+    ] }
+  const res = spdxOutput({ npm, nodes: [node, dep1, dep2, dep3, dep4Link, dep4, dep5, dep6] })
+  t.matchSnapshot(JSON.stringify(res))
+  t.end()
+})
+
+// Check that all of the generated test snapshots validate against the SPDX schema
+t.test('schema validation', t => {
+  const ajv = new Ajv()
+
+  // Compile schema
+  const spdxSchema = require('../../schemas/spdx/spdx-2.3.schema.json')
+  const validate = ajv.compile(spdxSchema)
+
+  // Load snapshots for all tests in this file
+  const sboms = require('../../../tap-snapshots/test/lib/utils/sbom-spdx.js.test.cjs')
+
+  // Check that all snapshots validate against the SPDX schema
+  Object.entries(sboms).forEach(([name, sbom]) => {
+    t.ok(validate(JSON.parse(sbom)), { snapshot: name, error: validate.errors?.[0] })
+  })
+  t.end()
+})
diff --git a/deps/npm/test/schemas/cyclonedx/bom-1.5.schema.json b/deps/npm/test/schemas/cyclonedx/bom-1.5.schema.json
new file mode 100644
index 00000000000000..3ecc1dcdb47557
--- /dev/null
+++ b/deps/npm/test/schemas/cyclonedx/bom-1.5.schema.json
@@ -0,0 +1,3799 @@
+{
+  "$schema": "http://json-schema.org/draft-07/schema#",
+  "$id": "http://cyclonedx.org/schema/bom-1.5.schema.json",
+  "type": "object",
+  "title": "CycloneDX Software Bill of Materials Standard",
+  "$comment" : "CycloneDX JSON schema is published under the terms of the Apache License 2.0.",
+  "required": [
+    "bomFormat",
+    "specVersion"
+  ],
+  "additionalProperties": false,
+  "properties": {
+    "$schema": {
+      "type": "string",
+      "enum": [
+        "http://cyclonedx.org/schema/bom-1.5.schema.json"
+      ]
+    },
+    "bomFormat": {
+      "type": "string",
+      "title": "BOM Format",
+      "description": "Specifies the format of the BOM. This helps to identify the file as CycloneDX since BOMs do not have a filename convention nor does JSON schema support namespaces. This value MUST be \"CycloneDX\".",
+      "enum": [
+        "CycloneDX"
+      ]
+    },
+    "specVersion": {
+      "type": "string",
+      "title": "CycloneDX Specification Version",
+      "description": "The version of the CycloneDX specification a BOM conforms to (starting at version 1.2).",
+      "examples": ["1.5"]
+    },
+    "serialNumber": {
+      "type": "string",
+      "title": "BOM Serial Number",
+      "description": "Every BOM generated SHOULD have a unique serial number, even if the contents of the BOM have not changed over time. If specified, the serial number MUST conform to RFC-4122. Use of serial numbers are RECOMMENDED.",
+      "examples": ["urn:uuid:3e671687-395b-41f5-a30f-a58921a69b79"],
+      "pattern": "^urn:uuid:[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$"
+    },
+    "version": {
+      "type": "integer",
+      "title": "BOM Version",
+      "description": "Whenever an existing BOM is modified, either manually or through automated processes, the version of the BOM SHOULD be incremented by 1. When a system is presented with multiple BOMs with identical serial numbers, the system SHOULD use the most recent version of the BOM. The default version is '1'.",
+      "minimum": 1,
+      "default": 1,
+      "examples": [1]
+    },
+    "metadata": {
+      "$ref": "#/definitions/metadata",
+      "title": "BOM Metadata",
+      "description": "Provides additional information about a BOM."
+    },
+    "components": {
+      "type": "array",
+      "items": {"$ref": "#/definitions/component"},
+      "uniqueItems": true,
+      "title": "Components",
+      "description": "A list of software and hardware components."
+    },
+    "services": {
+      "type": "array",
+      "items": {"$ref": "#/definitions/service"},
+      "uniqueItems": true,
+      "title": "Services",
+      "description": "A list of services. This may include microservices, function-as-a-service, and other types of network or intra-process services."
+    },
+    "externalReferences": {
+      "type": "array",
+      "items": {"$ref": "#/definitions/externalReference"},
+      "title": "External References",
+      "description": "External references provide a way to document systems, sites, and information that may be relevant, but are not included with the BOM. They may also establish specific relationships within or external to the BOM."
+    },
+    "dependencies": {
+      "type": "array",
+      "items": {"$ref": "#/definitions/dependency"},
+      "uniqueItems": true,
+      "title": "Dependencies",
+      "description": "Provides the ability to document dependency relationships."
+    },
+    "compositions": {
+      "type": "array",
+      "items": {"$ref": "#/definitions/compositions"},
+      "uniqueItems": true,
+      "title": "Compositions",
+      "description": "Compositions describe constituent parts (including components, services, and dependency relationships) and their completeness. The completeness of vulnerabilities expressed in a BOM may also be described."
+    },
+    "vulnerabilities": {
+      "type": "array",
+      "items": {"$ref": "#/definitions/vulnerability"},
+      "uniqueItems": true,
+      "title": "Vulnerabilities",
+      "description": "Vulnerabilities identified in components or services."
+    },
+    "annotations": {
+      "type": "array",
+      "items": {"$ref": "#/definitions/annotations"},
+      "uniqueItems": true,
+      "title": "Annotations",
+      "description": "Comments made by people, organizations, or tools about any object with a bom-ref, such as components, services, vulnerabilities, or the BOM itself. Unlike inventory information, annotations may contain opinion or commentary from various stakeholders. Annotations may be inline (with inventory) or externalized via BOM-Link, and may optionally be signed."
+    },
+    "formulation": {
+      "type": "array",
+      "items": {"$ref": "#/definitions/formula"},
+      "uniqueItems": true,
+      "title": "Formulation",
+      "description": "Describes how a component or service was manufactured or deployed. This is achieved through the use of formulas, workflows, tasks, and steps, which declare the precise steps to reproduce along with the observed formulas describing the steps which transpired in the manufacturing process."
+    },
+    "properties": {
+      "type": "array",
+      "title": "Properties",
+      "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+      "items": {
+        "$ref": "#/definitions/property"
+      }
+    },
+    "signature": {
+      "$ref": "#/definitions/signature",
+      "title": "Signature",
+      "description": "Enveloped signature in [JSON Signature Format (JSF)](https://cyberphone.github.io/doc/security/jsf.html)."
+    }
+  },
+  "definitions": {
+    "refType": {
+      "description": "Identifier for referable and therefore interlink-able elements.",
+      "type": "string",
+      "minLength": 1,
+      "$comment": "value SHOULD not start with the BOM-Link intro 'urn:cdx:'"
+    },
+    "refLinkType": {
+      "description": "Descriptor for an element identified by the attribute 'bom-ref' in the same BOM document.\nIn contrast to `bomLinkElementType`.",
+      "allOf": [{"$ref": "#/definitions/refType"}]
+    },
+    "bomLinkDocumentType": {
+      "title": "BOM-Link Document",
+      "description": "Descriptor for another BOM document. See https://cyclonedx.org/capabilities/bomlink/",
+      "type": "string",
+      "format": "iri-reference",
+      "pattern": "^urn:cdx:[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}/[1-9][0-9]*$",
+      "$comment": "part of the pattern is based on `bom.serialNumber`'s pattern"
+    },
+    "bomLinkElementType": {
+      "title": "BOM-Link Element",
+      "description": "Descriptor for an element in a BOM document. See https://cyclonedx.org/capabilities/bomlink/",
+      "type": "string",
+      "format": "iri-reference",
+      "pattern": "^urn:cdx:[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}/[1-9][0-9]*#.+$",
+      "$comment": "part of the pattern is based on `bom.serialNumber`'s pattern"
+    },
+    "bomLink": {
+      "anyOf": [
+        {
+          "title": "BOM-Link Document",
+          "$ref": "#/definitions/bomLinkDocumentType"
+        },
+        {
+          "title": "BOM-Link Element",
+          "$ref": "#/definitions/bomLinkElementType"
+        }
+      ]
+    },
+    "metadata": {
+      "type": "object",
+      "title": "BOM Metadata Object",
+      "additionalProperties": false,
+      "properties": {
+        "timestamp": {
+          "type": "string",
+          "format": "date-time",
+          "title": "Timestamp",
+          "description": "The date and time (timestamp) when the BOM was created."
+        },
+        "lifecycles": {
+          "type": "array",
+          "title": "Lifecycles",
+          "description": "",
+          "items": {
+            "type": "object",
+            "title": "Lifecycle",
+            "description": "The product lifecycle(s) that this BOM represents.",
+            "oneOf": [
+              {
+                "required": ["phase"],
+                "additionalProperties": false,
+                "properties": {
+                  "phase": {
+                    "type": "string",
+                    "title": "Phase",
+                    "description": "A pre-defined phase in the product lifecycle.\n\n* __design__ = BOM produced early in the development lifecycle containing inventory of components and services that are proposed or planned to be used. The inventory may need to be procured, retrieved, or resourced prior to use.\n* __pre-build__ = BOM consisting of information obtained prior to a build process and may contain source files and development artifacts and manifests. The inventory may need to be resolved and retrieved prior to use.\n* __build__ = BOM consisting of information obtained during a build process where component inventory is available for use. The precise versions of resolved components are usually available at this time as well as the provenance of where the components were retrieved from.\n* __post-build__ = BOM consisting of information obtained after a build process has completed and the resulting components(s) are available for further analysis. Built components may exist as the result of a CI/CD process, may have been installed or deployed to a system or device, and may need to be retrieved or extracted from the system or device.\n* __operations__ = BOM produced that represents inventory that is running and operational. This may include staging or production environments and will generally encompass multiple SBOMs describing the applications and operating system, along with HBOMs describing the hardware that makes up the system. Operations Bill of Materials (OBOM) can provide full-stack inventory of runtime environments, configurations, and additional dependencies.\n* __discovery__ = BOM consisting of information observed through network discovery providing point-in-time enumeration of embedded, on-premise, and cloud-native services such as server applications, connected devices, microservices, and serverless functions.\n* __decommission__ = BOM containing inventory that will be, or has been retired from operations.",
+                    "enum": [
+                      "design",
+                      "pre-build",
+                      "build",
+                      "post-build",
+                      "operations",
+                      "discovery",
+                      "decommission"
+                    ]
+                  }
+                }
+              },
+              {
+                "required": ["name"],
+                "additionalProperties": false,
+                "properties": {
+                  "name": {
+                    "type": "string",
+                    "title": "Name",
+                    "description": "The name of the lifecycle phase"
+                  },
+                  "description": {
+                    "type": "string",
+                    "title": "Description",
+                    "description": "The description of the lifecycle phase"
+                  }
+                }
+              }
+            ]
+          }
+      },
+        "tools": {
+          "oneOf": [
+            {
+              "type": "object",
+              "title": "Creation Tools",
+              "description": "The tool(s) used in the creation of the BOM.",
+              "additionalProperties": false,
+              "properties": {
+                "components": {
+                  "type": "array",
+                  "items": {"$ref": "#/definitions/component"},
+                  "uniqueItems": true,
+                  "title": "Components",
+                  "description": "A list of software and hardware components used as tools"
+                },
+                "services": {
+                  "type": "array",
+                  "items": {"$ref": "#/definitions/service"},
+                  "uniqueItems": true,
+                  "title": "Services",
+                  "description": "A list of services used as tools. This may include microservices, function-as-a-service, and other types of network or intra-process services."
+                }
+              }
+            },
+            {
+              "type": "array",
+              "title": "Creation Tools (legacy)",
+              "description": "[Deprecated] The tool(s) used in the creation of the BOM.",
+              "items": {"$ref": "#/definitions/tool"}
+            }
+          ]
+        },
+        "authors" :{
+          "type": "array",
+          "title": "Authors",
+          "description": "The person(s) who created the BOM. Authors are common in BOMs created through manual processes. BOMs created through automated means may not have authors.",
+          "items": {"$ref": "#/definitions/organizationalContact"}
+        },
+        "component": {
+          "title": "Component",
+          "description": "The component that the BOM describes.",
+          "$ref": "#/definitions/component"
+        },
+        "manufacture": {
+          "title": "Manufacture",
+          "description": "The organization that manufactured the component that the BOM describes.",
+          "$ref": "#/definitions/organizationalEntity"
+        },
+        "supplier": {
+          "title": "Supplier",
+          "description": " The organization that supplied the component that the BOM describes. The supplier may often be the manufacturer, but may also be a distributor or repackager.",
+          "$ref": "#/definitions/organizationalEntity"
+        },
+        "licenses": {
+          "title": "BOM License(s)",
+          "$ref": "#/definitions/licenseChoice"
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+          "items": {"$ref": "#/definitions/property"}
+        }
+      }
+    },
+    "tool": {
+      "type": "object",
+      "title": "Tool",
+      "description": "[Deprecated] - DO NOT USE. This will be removed in a future version. This will be removed in a future version. Use component or service instead. Information about the automated or manual tool used",
+      "additionalProperties": false,
+      "properties": {
+        "vendor": {
+          "type": "string",
+          "title": "Tool Vendor",
+          "description": "The name of the vendor who created the tool"
+        },
+        "name": {
+          "type": "string",
+          "title": "Tool Name",
+          "description": "The name of the tool"
+        },
+        "version": {
+          "type": "string",
+          "title": "Tool Version",
+          "description": "The version of the tool"
+        },
+        "hashes": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/hash"},
+          "title": "Hashes",
+          "description": "The hashes of the tool (if applicable)."
+        },
+        "externalReferences": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/externalReference"},
+          "title": "External References",
+          "description": "External references provide a way to document systems, sites, and information that may be relevant, but are not included with the BOM. They may also establish specific relationships within or external to the BOM."
+        }
+      }
+    },
+    "organizationalEntity": {
+      "type": "object",
+      "title": "Organizational Entity Object",
+      "description": "",
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the object elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "name": {
+          "type": "string",
+          "title": "Name",
+          "description": "The name of the organization",
+          "examples": [
+            "Example Inc."
+          ]
+        },
+        "url": {
+          "type": "array",
+          "items": {
+            "type": "string",
+            "format": "iri-reference"
+          },
+          "title": "URL",
+          "description": "The URL of the organization. Multiple URLs are allowed.",
+          "examples": ["https://example.com"]
+        },
+        "contact": {
+          "type": "array",
+          "title": "Contact",
+          "description": "A contact at the organization. Multiple contacts are allowed.",
+          "items": {"$ref": "#/definitions/organizationalContact"}
+        }
+      }
+    },
+    "organizationalContact": {
+      "type": "object",
+      "title": "Organizational Contact Object",
+      "description": "",
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the object elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "name": {
+          "type": "string",
+          "title": "Name",
+          "description": "The name of a contact",
+          "examples": ["Contact name"]
+        },
+        "email": {
+          "type": "string",
+          "format": "idn-email",
+          "title": "Email Address",
+          "description": "The email address of the contact.",
+          "examples": ["firstname.lastname@example.com"]
+        },
+        "phone": {
+          "type": "string",
+          "title": "Phone",
+          "description": "The phone number of the contact.",
+          "examples": ["800-555-1212"]
+        }
+      }
+    },
+    "component": {
+      "type": "object",
+      "title": "Component Object",
+      "required": [
+        "type",
+        "name"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "type": {
+          "type": "string",
+          "enum": [
+            "application",
+            "framework",
+            "library",
+            "container",
+            "platform",
+            "operating-system",
+            "device",
+            "device-driver",
+            "firmware",
+            "file",
+            "machine-learning-model",
+            "data"
+          ],
+          "title": "Component Type",
+          "description": "Specifies the type of component. For software components, classify as application if no more specific appropriate classification is available or cannot be determined for the component. Types include:\n\n* __application__ = A software application. Refer to [https://en.wikipedia.org/wiki/Application_software](https://en.wikipedia.org/wiki/Application_software) for information about applications.\n* __framework__ = A software framework. Refer to [https://en.wikipedia.org/wiki/Software_framework](https://en.wikipedia.org/wiki/Software_framework) for information on how frameworks vary slightly from libraries.\n* __library__ = A software library. Refer to [https://en.wikipedia.org/wiki/Library_(computing)](https://en.wikipedia.org/wiki/Library_(computing))\n for information about libraries. All third-party and open source reusable components will likely be a library. If the library also has key features of a framework, then it should be classified as a framework. If not, or is unknown, then specifying library is RECOMMENDED.\n* __container__ = A packaging and/or runtime format, not specific to any particular technology, which isolates software inside the container from software outside of a container through virtualization technology. Refer to [https://en.wikipedia.org/wiki/OS-level_virtualization](https://en.wikipedia.org/wiki/OS-level_virtualization)\n* __platform__ = A runtime environment which interprets or executes software. This may include runtimes such as those that execute bytecode or low-code/no-code application platforms.\n* __operating-system__ = A software operating system without regard to deployment model (i.e. installed on physical hardware, virtual machine, image, etc) Refer to [https://en.wikipedia.org/wiki/Operating_system](https://en.wikipedia.org/wiki/Operating_system)\n* __device__ = A hardware device such as a processor, or chip-set. A hardware device containing firmware SHOULD include a component for the physical hardware itself, and another component of type 'firmware' or 'operating-system' (whichever is relevant), describing information about the software running on the device.\n  See also the list of [known device properties](https://github.com/CycloneDX/cyclonedx-property-taxonomy/blob/main/cdx/device.md).\n* __device-driver__ = A special type of software that operates or controls a particular type of device. Refer to [https://en.wikipedia.org/wiki/Device_driver](https://en.wikipedia.org/wiki/Device_driver)\n* __firmware__ = A special type of software that provides low-level control over a devices hardware. Refer to [https://en.wikipedia.org/wiki/Firmware](https://en.wikipedia.org/wiki/Firmware)\n* __file__ = A computer file. Refer to [https://en.wikipedia.org/wiki/Computer_file](https://en.wikipedia.org/wiki/Computer_file) for information about files.\n* __machine-learning-model__ = A model based on training data that can make predictions or decisions without being explicitly programmed to do so.\n* __data__ = A collection of discrete values that convey information.",
+          "examples": ["library"]
+        },
+        "mime-type": {
+          "type": "string",
+          "title": "Mime-Type",
+          "description": "The optional mime-type of the component. When used on file components, the mime-type can provide additional context about the kind of file being represented such as an image, font, or executable. Some library or framework components may also have an associated mime-type.",
+          "examples": ["image/jpeg"],
+          "pattern": "^[-+a-z0-9.]+/[-+a-z0-9.]+$"
+        },
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the component elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "supplier": {
+          "title": "Component Supplier",
+          "description": " The organization that supplied the component. The supplier may often be the manufacturer, but may also be a distributor or repackager.",
+          "$ref": "#/definitions/organizationalEntity"
+        },
+        "author": {
+          "type": "string",
+          "title": "Component Author",
+          "description": "The person(s) or organization(s) that authored the component",
+          "examples": ["Acme Inc"]
+        },
+        "publisher": {
+          "type": "string",
+          "title": "Component Publisher",
+          "description": "The person(s) or organization(s) that published the component",
+          "examples": ["Acme Inc"]
+        },
+        "group": {
+          "type": "string",
+          "title": "Component Group",
+          "description": "The grouping name or identifier. This will often be a shortened, single name of the company or project that produced the component, or the source package or domain name. Whitespace and special characters should be avoided. Examples include: apache, org.apache.commons, and apache.org.",
+          "examples": ["com.acme"]
+        },
+        "name": {
+          "type": "string",
+          "title": "Component Name",
+          "description": "The name of the component. This will often be a shortened, single name of the component. Examples: commons-lang3 and jquery",
+          "examples": ["tomcat-catalina"]
+        },
+        "version": {
+          "type": "string",
+          "title": "Component Version",
+          "description": "The component version. The version should ideally comply with semantic versioning but is not enforced.",
+          "examples": ["9.0.14"]
+        },
+        "description": {
+          "type": "string",
+          "title": "Component Description",
+          "description": "Specifies a description for the component"
+        },
+        "scope": {
+          "type": "string",
+          "enum": [
+            "required",
+            "optional",
+            "excluded"
+          ],
+          "title": "Component Scope",
+          "description": "Specifies the scope of the component. If scope is not specified, 'required' scope SHOULD be assumed by the consumer of the BOM.",
+          "default": "required"
+        },
+        "hashes": {
+          "type": "array",
+          "title": "Component Hashes",
+          "items": {"$ref": "#/definitions/hash"}
+        },
+        "licenses": {
+          "$ref": "#/definitions/licenseChoice",
+          "title": "Component License(s)"
+        },
+        "copyright": {
+          "type": "string",
+          "title": "Component Copyright",
+          "description": "A copyright notice informing users of the underlying claims to copyright ownership in a published work.",
+          "examples": ["Acme Inc"]
+        },
+        "cpe": {
+          "type": "string",
+          "title": "Component Common Platform Enumeration (CPE)",
+          "description": "Specifies a well-formed CPE name that conforms to the CPE 2.2 or 2.3 specification. See [https://nvd.nist.gov/products/cpe](https://nvd.nist.gov/products/cpe)",
+          "examples": ["cpe:2.3:a:acme:component_framework:-:*:*:*:*:*:*:*"]
+        },
+        "purl": {
+          "type": "string",
+          "title": "Component Package URL (purl)",
+          "description": "Specifies the package-url (purl). The purl, if specified, MUST be valid and conform to the specification defined at: [https://github.com/package-url/purl-spec](https://github.com/package-url/purl-spec)",
+          "examples": ["pkg:maven/com.acme/tomcat-catalina@9.0.14?packaging=jar"]
+        },
+        "swid": {
+          "$ref": "#/definitions/swid",
+          "title": "SWID Tag",
+          "description": "Specifies metadata and content for [ISO-IEC 19770-2 Software Identification (SWID) Tags](https://www.iso.org/standard/65666.html)."
+        },
+        "modified": {
+          "type": "boolean",
+          "title": "Component Modified From Original",
+          "description": "[Deprecated] - DO NOT USE. This will be removed in a future version. Use the pedigree element instead to supply information on exactly how the component was modified. A boolean value indicating if the component has been modified from the original. A value of true indicates the component is a derivative of the original. A value of false indicates the component has not been modified from the original."
+        },
+        "pedigree": {
+          "type": "object",
+          "title": "Component Pedigree",
+          "description": "Component pedigree is a way to document complex supply chain scenarios where components are created, distributed, modified, redistributed, combined with other components, etc. Pedigree supports viewing this complex chain from the beginning, the end, or anywhere in the middle. It also provides a way to document variants where the exact relation may not be known.",
+          "additionalProperties": false,
+          "properties": {
+            "ancestors": {
+              "type": "array",
+              "title": "Ancestors",
+              "description": "Describes zero or more components in which a component is derived from. This is commonly used to describe forks from existing projects where the forked version contains a ancestor node containing the original component it was forked from. For example, Component A is the original component. Component B is the component being used and documented in the BOM. However, Component B contains a pedigree node with a single ancestor documenting Component A - the original component from which Component B is derived from.",
+              "items": {"$ref": "#/definitions/component"}
+            },
+            "descendants": {
+              "type": "array",
+              "title": "Descendants",
+              "description": "Descendants are the exact opposite of ancestors. This provides a way to document all forks (and their forks) of an original or root component.",
+              "items": {"$ref": "#/definitions/component"}
+            },
+            "variants": {
+              "type": "array",
+              "title": "Variants",
+              "description": "Variants describe relations where the relationship between the components are not known. For example, if Component A contains nearly identical code to Component B. They are both related, but it is unclear if one is derived from the other, or if they share a common ancestor.",
+              "items": {"$ref": "#/definitions/component"}
+            },
+            "commits": {
+              "type": "array",
+              "title": "Commits",
+              "description": "A list of zero or more commits which provide a trail describing how the component deviates from an ancestor, descendant, or variant.",
+              "items": {"$ref": "#/definitions/commit"}
+            },
+            "patches": {
+              "type": "array",
+              "title": "Patches",
+              "description": ">A list of zero or more patches describing how the component deviates from an ancestor, descendant, or variant. Patches may be complimentary to commits or may be used in place of commits.",
+              "items": {"$ref": "#/definitions/patch"}
+            },
+            "notes": {
+              "type": "string",
+              "title": "Notes",
+              "description": "Notes, observations, and other non-structured commentary describing the components pedigree."
+            }
+          }
+        },
+        "externalReferences": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/externalReference"},
+          "title": "External References",
+          "description": "External references provide a way to document systems, sites, and information that may be relevant, but are not included with the BOM. They may also establish specific relationships within or external to the BOM."
+        },
+        "components": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/component"},
+          "uniqueItems": true,
+          "title": "Components",
+          "description": "A list of software and hardware components included in the parent component. This is not a dependency tree. It provides a way to specify a hierarchical representation of component assemblies, similar to system &#8594; subsystem &#8594; parts assembly in physical supply chains."
+        },
+        "evidence": {
+          "$ref": "#/definitions/componentEvidence",
+          "title": "Evidence",
+          "description": "Provides the ability to document evidence collected through various forms of extraction or analysis."
+        },
+        "releaseNotes": {
+          "$ref": "#/definitions/releaseNotes",
+          "title": "Release notes",
+          "description": "Specifies optional release notes."
+        },
+         "modelCard": {
+          "$ref": "#/definitions/modelCard",
+          "title": "Machine Learning Model Card"
+        },
+        "data": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/componentData"},
+          "title": "Data",
+          "description": "This object SHOULD be specified for any component of type `data` and MUST NOT be specified for other component types."
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+          "items": {"$ref": "#/definitions/property"}
+        },
+        "signature": {
+          "$ref": "#/definitions/signature",
+          "title": "Signature",
+          "description": "Enveloped signature in [JSON Signature Format (JSF)](https://cyberphone.github.io/doc/security/jsf.html)."
+        }
+      }
+    },
+    "swid": {
+      "type": "object",
+      "title": "SWID Tag",
+      "description": "Specifies metadata and content for ISO-IEC 19770-2 Software Identification (SWID) Tags.",
+      "required": [
+        "tagId",
+        "name"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "tagId": {
+          "type": "string",
+          "title": "Tag ID",
+          "description": "Maps to the tagId of a SoftwareIdentity."
+        },
+        "name": {
+          "type": "string",
+          "title": "Name",
+          "description": "Maps to the name of a SoftwareIdentity."
+        },
+        "version": {
+          "type": "string",
+          "title": "Version",
+          "default": "0.0",
+          "description": "Maps to the version of a SoftwareIdentity."
+        },
+        "tagVersion": {
+          "type": "integer",
+          "title": "Tag Version",
+          "default": 0,
+          "description": "Maps to the tagVersion of a SoftwareIdentity."
+        },
+        "patch": {
+          "type": "boolean",
+          "title": "Patch",
+          "default": false,
+          "description": "Maps to the patch of a SoftwareIdentity."
+        },
+        "text": {
+          "title": "Attachment text",
+          "description": "Specifies the metadata and content of the SWID tag.",
+          "$ref": "#/definitions/attachment"
+        },
+        "url": {
+          "type": "string",
+          "title": "URL",
+          "description": "The URL to the SWID file.",
+          "format": "iri-reference"
+        }
+      }
+    },
+    "attachment": {
+      "type": "object",
+      "title": "Attachment",
+      "description": "Specifies the metadata and content for an attachment.",
+      "required": [
+        "content"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "contentType": {
+          "type": "string",
+          "title": "Content-Type",
+          "description": "Specifies the content type of the text. Defaults to text/plain if not specified.",
+          "default": "text/plain"
+        },
+        "encoding": {
+          "type": "string",
+          "title": "Encoding",
+          "description": "Specifies the optional encoding the text is represented in.",
+          "enum": [
+            "base64"
+          ]
+        },
+        "content": {
+          "type": "string",
+          "title": "Attachment Text",
+          "description": "The attachment data. Proactive controls such as input validation and sanitization should be employed to prevent misuse of attachment text."
+        }
+      }
+    },
+    "hash": {
+      "type": "object",
+      "title": "Hash Objects",
+      "required": [
+        "alg",
+        "content"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "alg": {
+          "$ref": "#/definitions/hash-alg"
+        },
+        "content": {
+          "$ref": "#/definitions/hash-content"
+        }
+      }
+    },
+    "hash-alg": {
+      "type": "string",
+      "enum": [
+        "MD5",
+        "SHA-1",
+        "SHA-256",
+        "SHA-384",
+        "SHA-512",
+        "SHA3-256",
+        "SHA3-384",
+        "SHA3-512",
+        "BLAKE2b-256",
+        "BLAKE2b-384",
+        "BLAKE2b-512",
+        "BLAKE3"
+      ],
+      "title": "Hash Algorithm"
+    },
+    "hash-content": {
+      "type": "string",
+      "title": "Hash Content (value)",
+      "examples": ["3942447fac867ae5cdb3229b658f4d48"],
+      "pattern": "^([a-fA-F0-9]{32}|[a-fA-F0-9]{40}|[a-fA-F0-9]{64}|[a-fA-F0-9]{96}|[a-fA-F0-9]{128})$"
+    },
+    "license": {
+      "type": "object",
+      "title": "License Object",
+      "oneOf": [
+        {
+          "required": ["id"]
+        },
+        {
+          "required": ["name"]
+        }
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the license elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "id": {
+          "$ref": "spdx.schema.json",
+          "title": "License ID (SPDX)",
+          "description": "A valid SPDX license ID",
+          "examples": ["Apache-2.0"]
+        },
+        "name": {
+          "type": "string",
+          "title": "License Name",
+          "description": "If SPDX does not define the license used, this field may be used to provide the license name",
+          "examples": ["Acme Software License"]
+        },
+        "text": {
+          "title": "License text",
+          "description": "An optional way to include the textual content of a license.",
+          "$ref": "#/definitions/attachment"
+        },
+        "url": {
+          "type": "string",
+          "title": "License URL",
+          "description": "The URL to the license file. If specified, a 'license' externalReference should also be specified for completeness",
+          "examples": ["https://www.apache.org/licenses/LICENSE-2.0.txt"],
+          "format": "iri-reference"
+        },
+        "licensing": {
+          "type": "object",
+          "title": "Licensing information",
+          "description": "Licensing details describing the licensor/licensee, license type, renewal and expiration dates, and other important metadata",
+          "additionalProperties": false,
+          "properties": {
+            "altIds": {
+              "type": "array",
+              "title": "Alternate License Identifiers",
+              "description": "License identifiers that may be used to manage licenses and their lifecycle",
+              "items": {
+                "type": "string"
+              }
+            },
+            "licensor": {
+              "title": "Licensor",
+              "description": "The individual or organization that grants a license to another individual or organization",
+              "type": "object",
+              "additionalProperties": false,
+              "properties": {
+                "organization": {
+                  "title": "Licensor (Organization)",
+                  "description": "The organization that granted the license",
+                  "$ref": "#/definitions/organizationalEntity"
+                },
+                "individual": {
+                  "title": "Licensor (Individual)",
+                  "description": "The individual, not associated with an organization, that granted the license",
+                  "$ref": "#/definitions/organizationalContact"
+                }
+              },
+              "oneOf":[
+                {
+                  "required": ["organization"]
+                },
+                {
+                  "required": ["individual"]
+                }
+              ]
+            },
+            "licensee": {
+              "title": "Licensee",
+              "description": "The individual or organization for which a license was granted to",
+              "type": "object",
+              "additionalProperties": false,
+              "properties": {
+                "organization": {
+                  "title": "Licensee (Organization)",
+                  "description": "The organization that was granted the license",
+                  "$ref": "#/definitions/organizationalEntity"
+                },
+                "individual": {
+                  "title": "Licensee (Individual)",
+                  "description": "The individual, not associated with an organization, that was granted the license",
+                  "$ref": "#/definitions/organizationalContact"
+                }
+              },
+              "oneOf":[
+                {
+                  "required": ["organization"]
+                },
+                {
+                  "required": ["individual"]
+                }
+              ]
+            },
+            "purchaser": {
+              "title": "Purchaser",
+              "description": "The individual or organization that purchased the license",
+              "type": "object",
+              "additionalProperties": false,
+              "properties": {
+                "organization": {
+                  "title": "Purchaser (Organization)",
+                  "description": "The organization that purchased the license",
+                  "$ref": "#/definitions/organizationalEntity"
+                },
+                "individual": {
+                  "title": "Purchaser (Individual)",
+                  "description": "The individual, not associated with an organization, that purchased the license",
+                  "$ref": "#/definitions/organizationalContact"
+                }
+              },
+              "oneOf":[
+                {
+                  "required": ["organization"]
+                },
+                {
+                  "required": ["individual"]
+                }
+              ]
+            },
+            "purchaseOrder": {
+              "type": "string",
+              "title": "Purchase Order",
+              "description": "The purchase order identifier the purchaser sent to a supplier or vendor to authorize a purchase"
+            },
+            "licenseTypes": {
+              "type": "array",
+              "title": "License Type",
+              "description": "The type of license(s) that was granted to the licensee\n\n* __academic__ = A license that grants use of software solely for the purpose of education or research.\n* __appliance__ = A license covering use of software embedded in a specific piece of hardware.\n* __client-access__ = A Client Access License (CAL) allows client computers to access services provided by server software.\n* __concurrent-user__ = A Concurrent User license (aka floating license) limits the number of licenses for a software application and licenses are shared among a larger number of users.\n* __core-points__ = A license where the core of a computer's processor is assigned a specific number of points.\n* __custom-metric__ = A license for which consumption is measured by non-standard metrics.\n* __device__ = A license that covers a defined number of installations on computers and other types of devices.\n* __evaluation__ = A license that grants permission to install and use software for trial purposes.\n* __named-user__ = A license that grants access to the software to one or more pre-defined users.\n* __node-locked__ = A license that grants access to the software on one or more pre-defined computers or devices.\n* __oem__ = An Original Equipment Manufacturer license that is delivered with hardware, cannot be transferred to other hardware, and is valid for the life of the hardware.\n* __perpetual__ = A license where the software is sold on a one-time basis and the licensee can use a copy of the software indefinitely.\n* __processor-points__ = A license where each installation consumes points per processor.\n* __subscription__ = A license where the licensee pays a fee to use the software or service.\n* __user__ = A license that grants access to the software or service by a specified number of users.\n* __other__ = Another license type.\n",
+              "items": {
+                "type": "string",
+                "enum": [
+                  "academic",
+                  "appliance",
+                  "client-access",
+                  "concurrent-user",
+                  "core-points",
+                  "custom-metric",
+                  "device",
+                  "evaluation",
+                  "named-user",
+                  "node-locked",
+                  "oem",
+                  "perpetual",
+                  "processor-points",
+                  "subscription",
+                  "user",
+                  "other"
+                ]
+              }
+            },
+            "lastRenewal": {
+              "type": "string",
+              "format": "date-time",
+              "title": "Last Renewal",
+              "description": "The timestamp indicating when the license was last renewed. For new purchases, this is often the purchase or acquisition date. For non-perpetual licenses or subscriptions, this is the timestamp of when the license was last renewed."
+            },
+            "expiration": {
+              "type": "string",
+              "format": "date-time",
+              "title": "Expiration",
+              "description": "The timestamp indicating when the current license expires (if applicable)."
+            }
+          }
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+          "items": {"$ref": "#/definitions/property"}
+        }
+      }
+    },
+    "licenseChoice": {
+      "title": "License Choice",
+      "description": "EITHER (list of SPDX licenses and/or named licenses) OR (tuple of one SPDX License Expression)",
+      "type": "array",
+      "oneOf": [
+        {
+          "title": "Multiple licenses",
+          "description": "A list of SPDX licenses and/or named licenses.",
+          "type": "array",
+          "items": {
+            "type": "object",
+            "required": ["license"],
+            "additionalProperties": false,
+            "properties": {
+              "license": {"$ref": "#/definitions/license"}
+            }
+          }
+        },
+        {
+          "title": "SPDX License Expression",
+          "description": "A tuple of exactly one SPDX License Expression.",
+          "type": "array",
+          "additionalItems": false,
+          "minItems": 1,
+          "maxItems": 1,
+          "items": [{
+            "type": "object",
+            "additionalProperties": false,
+            "required": ["expression"],
+            "properties": {
+              "expression": {
+                "type": "string",
+                "title": "SPDX License Expression",
+                "examples": [
+                  "Apache-2.0 AND (MIT OR GPL-2.0-only)",
+                  "GPL-3.0-only WITH Classpath-exception-2.0"
+                ]
+              },
+              "bom-ref": {
+                "$ref": "#/definitions/refType",
+                "title": "BOM Reference",
+                "description": "An optional identifier which can be used to reference the license elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+              }
+            }
+          }]
+        }
+      ]
+    },
+    "commit": {
+      "type": "object",
+      "title": "Commit",
+      "description": "Specifies an individual commit",
+      "additionalProperties": false,
+      "properties": {
+        "uid": {
+          "type": "string",
+          "title": "UID",
+          "description": "A unique identifier of the commit. This may be version control specific. For example, Subversion uses revision numbers whereas git uses commit hashes."
+        },
+        "url": {
+          "type": "string",
+          "title": "URL",
+          "description": "The URL to the commit. This URL will typically point to a commit in a version control system.",
+          "format": "iri-reference"
+        },
+        "author": {
+          "title": "Author",
+          "description": "The author who created the changes in the commit",
+          "$ref": "#/definitions/identifiableAction"
+        },
+        "committer": {
+          "title": "Committer",
+          "description": "The person who committed or pushed the commit",
+          "$ref": "#/definitions/identifiableAction"
+        },
+        "message": {
+          "type": "string",
+          "title": "Message",
+          "description": "The text description of the contents of the commit"
+        }
+      }
+    },
+    "patch": {
+      "type": "object",
+      "title": "Patch",
+      "description": "Specifies an individual patch",
+      "required": [
+        "type"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "type": {
+          "type": "string",
+          "enum": [
+            "unofficial",
+            "monkey",
+            "backport",
+            "cherry-pick"
+          ],
+          "title": "Type",
+          "description": "Specifies the purpose for the patch including the resolution of defects, security issues, or new behavior or functionality.\n\n* __unofficial__ = A patch which is not developed by the creators or maintainers of the software being patched. Refer to [https://en.wikipedia.org/wiki/Unofficial_patch](https://en.wikipedia.org/wiki/Unofficial_patch)\n* __monkey__ = A patch which dynamically modifies runtime behavior. Refer to [https://en.wikipedia.org/wiki/Monkey_patch](https://en.wikipedia.org/wiki/Monkey_patch)\n* __backport__ = A patch which takes code from a newer version of software and applies it to older versions of the same software. Refer to [https://en.wikipedia.org/wiki/Backporting](https://en.wikipedia.org/wiki/Backporting)\n* __cherry-pick__ = A patch created by selectively applying commits from other versions or branches of the same software."
+        },
+        "diff": {
+          "title": "Diff",
+          "description": "The patch file (or diff) that show changes. Refer to [https://en.wikipedia.org/wiki/Diff](https://en.wikipedia.org/wiki/Diff)",
+          "$ref": "#/definitions/diff"
+        },
+        "resolves": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/issue"},
+          "title": "Resolves",
+          "description": "A collection of issues the patch resolves"
+        }
+      }
+    },
+    "diff": {
+      "type": "object",
+      "title": "Diff",
+      "description": "The patch file (or diff) that show changes. Refer to https://en.wikipedia.org/wiki/Diff",
+      "additionalProperties": false,
+      "properties": {
+        "text": {
+          "title": "Diff text",
+          "description": "Specifies the optional text of the diff",
+          "$ref": "#/definitions/attachment"
+        },
+        "url": {
+          "type": "string",
+          "title": "URL",
+          "description": "Specifies the URL to the diff",
+          "format": "iri-reference"
+        }
+      }
+    },
+    "issue": {
+      "type": "object",
+      "title": "Diff",
+      "description": "An individual issue that has been resolved.",
+      "required": [
+        "type"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "type": {
+          "type": "string",
+          "enum": [
+            "defect",
+            "enhancement",
+            "security"
+          ],
+          "title": "Type",
+          "description": "Specifies the type of issue"
+        },
+        "id": {
+          "type": "string",
+          "title": "ID",
+          "description": "The identifier of the issue assigned by the source of the issue"
+        },
+        "name": {
+          "type": "string",
+          "title": "Name",
+          "description": "The name of the issue"
+        },
+        "description": {
+          "type": "string",
+          "title": "Description",
+          "description": "A description of the issue"
+        },
+        "source": {
+          "type": "object",
+          "title": "Source",
+          "description": "The source of the issue where it is documented",
+          "additionalProperties": false,
+          "properties": {
+            "name": {
+              "type": "string",
+              "title": "Name",
+              "description": "The name of the source. For example 'National Vulnerability Database', 'NVD', and 'Apache'"
+            },
+            "url": {
+              "type": "string",
+              "title": "URL",
+              "description": "The url of the issue documentation as provided by the source",
+              "format": "iri-reference"
+            }
+          }
+        },
+        "references": {
+          "type": "array",
+          "items": {
+            "type": "string",
+            "format": "iri-reference"
+          },
+          "title": "References",
+          "description": "A collection of URL's for reference. Multiple URLs are allowed.",
+          "examples": ["https://example.com"]
+        }
+      }
+    },
+    "identifiableAction": {
+      "type": "object",
+      "title": "Identifiable Action",
+      "description": "Specifies an individual commit",
+      "additionalProperties": false,
+      "properties": {
+        "timestamp": {
+          "type": "string",
+          "format": "date-time",
+          "title": "Timestamp",
+          "description": "The timestamp in which the action occurred"
+        },
+        "name": {
+          "type": "string",
+          "title": "Name",
+          "description": "The name of the individual who performed the action"
+        },
+        "email": {
+          "type": "string",
+          "format": "idn-email",
+          "title": "E-mail",
+          "description": "The email address of the individual who performed the action"
+        }
+      }
+    },
+    "externalReference": {
+      "type": "object",
+      "title": "External Reference",
+      "description": "External references provide a way to document systems, sites, and information that may be relevant, but are not included with the BOM. They may also establish specific relationships within or external to the BOM.",
+      "required": [
+        "url",
+        "type"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "url": {
+          "anyOf": [
+            {
+              "title": "URL",
+              "type": "string",
+              "format": "iri-reference"
+            },
+            {
+              "title": "BOM-Link",
+              "$ref": "#/definitions/bomLink"
+            }
+          ],
+          "title": "URL",
+          "description": "The URI (URL or URN) to the external reference. External references are URIs and therefore can accept any URL scheme including https ([RFC-7230](https://www.ietf.org/rfc/rfc7230.txt)), mailto ([RFC-2368](https://www.ietf.org/rfc/rfc2368.txt)), tel ([RFC-3966](https://www.ietf.org/rfc/rfc3966.txt)), and dns ([RFC-4501](https://www.ietf.org/rfc/rfc4501.txt)). External references may also include formally registered URNs such as [CycloneDX BOM-Link](https://cyclonedx.org/capabilities/bomlink/) to reference CycloneDX BOMs or any object within a BOM. BOM-Link transforms applicable external references into relationships that can be expressed in a BOM or across BOMs."
+        },
+        "comment": {
+          "type": "string",
+          "title": "Comment",
+          "description": "An optional comment describing the external reference"
+        },
+        "type": {
+          "type": "string",
+          "title": "Type",
+          "description": "Specifies the type of external reference.\n\n* __vcs__ = Version Control System\n* __issue-tracker__ = Issue or defect tracking system, or an Application Lifecycle Management (ALM) system\n* __website__ = Website\n* __advisories__ = Security advisories\n* __bom__ = Bill of Materials (SBOM, OBOM, HBOM, SaaSBOM, etc)\n* __mailing-list__ = Mailing list or discussion group\n* __social__ = Social media account\n* __chat__ = Real-time chat platform\n* __documentation__ = Documentation, guides, or how-to instructions\n* __support__ = Community or commercial support\n* __distribution__ = Direct or repository download location\n* __distribution-intake__ = The location where a component was published to. This is often the same as \"distribution\" but may also include specialized publishing processes that act as an intermediary\n* __license__ = The URL to the license file. If a license URL has been defined in the license node, it should also be defined as an external reference for completeness\n* __build-meta__ = Build-system specific meta file (i.e. pom.xml, package.json, .nuspec, etc)\n* __build-system__ = URL to an automated build system\n* __release-notes__ = URL to release notes\n* __security-contact__ = Specifies a way to contact the maintainer, supplier, or provider in the event of a security incident. Common URIs include links to a disclosure procedure, a mailto (RFC-2368) that specifies an email address, a tel (RFC-3966) that specifies a phone number, or dns (RFC-4501) that specifies the records containing DNS Security TXT\n* __model-card__ = A model card describes the intended uses of a machine learning model, potential limitations, biases, ethical considerations, training parameters, datasets used to train the model, performance metrics, and other relevant data useful for ML transparency\n* __log__ = A record of events that occurred in a computer system or application, such as problems, errors, or information on current operations\n* __configuration__ = Parameters or settings that may be used by other components or services\n* __evidence__ = Information used to substantiate a claim\n* __formulation__ = Describes how a component or service was manufactured or deployed\n* __attestation__ = Human or machine-readable statements containing facts, evidence, or testimony\n* __threat-model__ = An enumeration of identified weaknesses, threats, and countermeasures, dataflow diagram (DFD), attack tree, and other supporting documentation in human-readable or machine-readable format\n* __adversary-model__ = The defined assumptions, goals, and capabilities of an adversary.\n* __risk-assessment__ = Identifies and analyzes the potential of future events that may negatively impact individuals, assets, and/or the environment. Risk assessments may also include judgments on the tolerability of each risk.\n* __vulnerability-assertion__ = A Vulnerability Disclosure Report (VDR) which asserts the known and previously unknown vulnerabilities that affect a component, service, or product including the analysis and findings describing the impact (or lack of impact) that the reported vulnerability has on a component, service, or product.\n* __exploitability-statement__ = A Vulnerability Exploitability eXchange (VEX) which asserts the known vulnerabilities that do not affect a product, product family, or organization, and optionally the ones that do. The VEX should include the analysis and findings describing the impact (or lack of impact) that the reported vulnerability has on the product, product family, or organization.\n* __pentest-report__ = Results from an authorized simulated cyberattack on a component or service, otherwise known as a penetration test\n* __static-analysis-report__ = SARIF or proprietary machine or human-readable report for which static analysis has identified code quality, security, and other potential issues with the source code\n* __dynamic-analysis-report__ = Dynamic analysis report that has identified issues such as vulnerabilities and misconfigurations\n* __runtime-analysis-report__ = Report generated by analyzing the call stack of a running application\n* __component-analysis-report__ = Report generated by Software Composition Analysis (SCA), container analysis, or other forms of component analysis\n* __maturity-report__ = Report containing a formal assessment of an organization, business unit, or team against a maturity model\n* __certification-report__ = Industry, regulatory, or other certification from an accredited (if applicable) certification body\n* __quality-metrics__ = Report or system in which quality metrics can be obtained\n* __codified-infrastructure__ = Code or configuration that defines and provisions virtualized infrastructure, commonly referred to as Infrastructure as Code (IaC)\n* __poam__ = Plans of Action and Milestones (POAM) compliment an \"attestation\" external reference. POAM is defined by NIST as a \"document that identifies tasks needing to be accomplished. It details resources required to accomplish the elements of the plan, any milestones in meeting the tasks and scheduled completion dates for the milestones\".\n* __other__ = Use this if no other types accurately describe the purpose of the external reference",
+          "enum": [
+            "vcs",
+            "issue-tracker",
+            "website",
+            "advisories",
+            "bom",
+            "mailing-list",
+            "social",
+            "chat",
+            "documentation",
+            "support",
+            "distribution",
+            "distribution-intake",
+            "license",
+            "build-meta",
+            "build-system",
+            "release-notes",
+            "security-contact",
+            "model-card",
+            "log",
+            "configuration",
+            "evidence",
+            "formulation",
+            "attestation",
+            "threat-model",
+            "adversary-model",
+            "risk-assessment",
+            "vulnerability-assertion",
+            "exploitability-statement",
+            "pentest-report",
+            "static-analysis-report",
+            "dynamic-analysis-report",
+            "runtime-analysis-report",
+            "component-analysis-report",
+            "maturity-report",
+            "certification-report",
+            "codified-infrastructure",
+            "quality-metrics",
+            "poam",
+            "other"
+          ]
+        },
+        "hashes": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/hash"},
+          "title": "Hashes",
+          "description": "The hashes of the external reference (if applicable)."
+        }
+      }
+    },
+    "dependency": {
+      "type": "object",
+      "title": "Dependency",
+      "description": "Defines the direct dependencies of a component or service. Components or services that do not have their own dependencies MUST be declared as empty elements within the graph. Components or services that are not represented in the dependency graph MAY have unknown dependencies. It is RECOMMENDED that implementations assume this to be opaque and not an indicator of a object being dependency-free. It is RECOMMENDED to leverage compositions to indicate unknown dependency graphs.",
+      "required": [
+        "ref"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "ref": {
+          "$ref": "#/definitions/refLinkType",
+          "title": "Reference",
+          "description": "References a component or service by its bom-ref attribute"
+        },
+        "dependsOn": {
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/refLinkType"
+          },
+          "title": "Depends On",
+          "description": "The bom-ref identifiers of the components or services that are dependencies of this dependency object."
+        }
+      }
+    },
+    "service": {
+      "type": "object",
+      "title": "Service Object",
+      "required": [
+        "name"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the service elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "provider": {
+          "title": "Provider",
+          "description": "The organization that provides the service.",
+          "$ref": "#/definitions/organizationalEntity"
+        },
+        "group": {
+          "type": "string",
+          "title": "Service Group",
+          "description": "The grouping name, namespace, or identifier. This will often be a shortened, single name of the company or project that produced the service or domain name. Whitespace and special characters should be avoided.",
+          "examples": ["com.acme"]
+        },
+        "name": {
+          "type": "string",
+          "title": "Service Name",
+          "description": "The name of the service. This will often be a shortened, single name of the service.",
+          "examples": ["ticker-service"]
+        },
+        "version": {
+          "type": "string",
+          "title": "Service Version",
+          "description": "The service version.",
+          "examples": ["1.0.0"]
+        },
+        "description": {
+          "type": "string",
+          "title": "Service Description",
+          "description": "Specifies a description for the service"
+        },
+        "endpoints": {
+          "type": "array",
+          "items": {
+            "type": "string",
+            "format": "iri-reference"
+          },
+          "title": "Endpoints",
+          "description": "The endpoint URIs of the service. Multiple endpoints are allowed.",
+          "examples": ["https://example.com/api/v1/ticker"]
+        },
+        "authenticated": {
+          "type": "boolean",
+          "title": "Authentication Required",
+          "description": "A boolean value indicating if the service requires authentication. A value of true indicates the service requires authentication prior to use. A value of false indicates the service does not require authentication."
+        },
+        "x-trust-boundary": {
+          "type": "boolean",
+          "title": "Crosses Trust Boundary",
+          "description": "A boolean value indicating if use of the service crosses a trust zone or boundary. A value of true indicates that by using the service, a trust boundary is crossed. A value of false indicates that by using the service, a trust boundary is not crossed."
+        },
+        "trustZone": {
+          "type": "string",
+          "title": "Trust Zone",
+          "description": "The name of the trust zone the service resides in."
+        },
+        "data": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/serviceData"},
+          "title": "Data",
+          "description": "Specifies information about the data including the directional flow of data and the data classification."
+        },
+        "licenses": {
+          "$ref": "#/definitions/licenseChoice",
+          "title": "Component License(s)"
+        },
+        "externalReferences": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/externalReference"},
+          "title": "External References",
+          "description": "External references provide a way to document systems, sites, and information that may be relevant, but are not included with the BOM. They may also establish specific relationships within or external to the BOM."
+        },
+        "services": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/service"},
+          "uniqueItems": true,
+          "title": "Services",
+          "description": "A list of services included or deployed behind the parent service. This is not a dependency tree. It provides a way to specify a hierarchical representation of service assemblies."
+        },
+        "releaseNotes": {
+          "$ref": "#/definitions/releaseNotes",
+          "title": "Release notes",
+          "description": "Specifies optional release notes."
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+          "items": {"$ref": "#/definitions/property"}
+        },
+        "signature": {
+          "$ref": "#/definitions/signature",
+          "title": "Signature",
+          "description": "Enveloped signature in [JSON Signature Format (JSF)](https://cyberphone.github.io/doc/security/jsf.html)."
+        }
+      }
+    },
+    "serviceData": {
+      "type": "object",
+      "title": "Hash Objects",
+      "required": [
+        "flow",
+        "classification"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "flow": {
+          "$ref": "#/definitions/dataFlowDirection",
+          "title": "Directional Flow",
+          "description": "Specifies the flow direction of the data. Direction is relative to the service. Inbound flow states that data enters the service. Outbound flow states that data leaves the service. Bi-directional states that data flows both ways, and unknown states that the direction is not known."
+        },
+        "classification": {
+          "$ref": "#/definitions/dataClassification"
+        },
+        "name": {
+          "type": "string",
+          "title": "Name",
+          "description": "Name for the defined data",
+          "examples": [
+            "Credit card reporting"
+          ]
+        },
+        "description": {
+          "type": "string",
+          "title": "Description",
+          "description": "Short description of the data content and usage",
+          "examples": [
+            "Credit card information being exchanged in between the web app and the database"
+          ]
+        },
+        "governance": {
+          "type": "object",
+          "title": "Data Governance",
+          "$ref": "#/definitions/dataGovernance"
+        },
+        "source": {
+          "type": "array",
+          "items": {
+            "anyOf": [
+              {
+                "title": "URL",
+                "type": "string",
+                "format": "iri-reference"
+              },
+              {
+                "title": "BOM-Link Element",
+                "$ref": "#/definitions/bomLinkElementType"
+              }
+            ]
+          },
+          "title": "Source",
+          "description": "The URI, URL, or BOM-Link of the components or services the data came in from"
+        },
+        "destination": {
+          "type": "array",
+          "items": {
+            "anyOf": [
+              {
+                "title": "URL",
+                "type": "string",
+                "format": "iri-reference"
+              },
+              {
+                "title": "BOM-Link Element",
+                "$ref": "#/definitions/bomLinkElementType"
+              }
+            ]
+          },
+          "title": "Destination",
+          "description": "The URI, URL, or BOM-Link of the components or services the data is sent to"
+        }
+      }
+    },
+    "dataFlowDirection": {
+      "type": "string",
+      "enum": [
+        "inbound",
+        "outbound",
+        "bi-directional",
+        "unknown"
+      ],
+      "title": "Data flow direction",
+      "description": "Specifies the flow direction of the data. Direction is relative to the service. Inbound flow states that data enters the service. Outbound flow states that data leaves the service. Bi-directional states that data flows both ways, and unknown states that the direction is not known."
+    },
+
+    "copyright": {
+      "type": "object",
+      "title": "Copyright",
+      "required": [
+        "text"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "text": {
+          "type": "string",
+          "title": "Copyright Text"
+        }
+      }
+    },
+    "componentEvidence": {
+      "type": "object",
+      "title": "Evidence",
+      "description": "Provides the ability to document evidence collected through various forms of extraction or analysis.",
+      "additionalProperties": false,
+      "properties": {
+        "identity": {
+          "type": "object",
+          "description": "Evidence that substantiates the identity of a component.",
+          "required": [ "field" ],
+          "additionalProperties": false,
+          "properties": {
+            "field": {
+              "type": "string",
+              "enum": [
+                "group", "name", "version", "purl", "cpe", "swid", "hash"
+              ],
+              "title": "Field",
+              "description": "The identity field of the component which the evidence describes."
+            },
+            "confidence": {
+              "type": "number",
+              "minimum": 0,
+              "maximum": 1,
+              "title": "Confidence",
+              "description": "The overall confidence of the evidence from 0 - 1, where 1 is 100% confidence."
+            },
+            "methods": {
+              "type": "array",
+              "title": "Methods",
+              "description": "The methods used to extract and/or analyze the evidence.",
+              "items": {
+                "type": "object",
+                "required": [
+                  "technique" ,
+                  "confidence"
+                ],
+                "additionalProperties": false,
+                "properties": {
+                  "technique": {
+                    "title": "Technique",
+                    "description": "The technique used in this method of analysis.",
+                    "type": "string",
+                    "enum": [
+                      "source-code-analysis",
+                      "binary-analysis",
+                      "manifest-analysis",
+                      "ast-fingerprint",
+                      "hash-comparison",
+                      "instrumentation",
+                      "dynamic-analysis",
+                      "filename",
+                      "attestation",
+                      "other"
+                    ]
+                  },
+                  "confidence": {
+                    "type": "number",
+                    "minimum": 0,
+                    "maximum": 1,
+                    "title": "Confidence",
+                    "description": "The confidence of the evidence from 0 - 1, where 1 is 100% confidence. Confidence is specific to the technique used. Each technique of analysis can have independent confidence."
+                  },
+                  "value": {
+                    "type": "string",
+                    "title": "Value",
+                    "description": "The value or contents of the evidence."
+                  }
+                }
+              }
+            },
+            "tools": {
+              "type": "array",
+              "uniqueItems": true,
+              "items": {
+                "anyOf": [
+                  {
+                    "title": "Ref",
+                    "$ref": "#/definitions/refLinkType"
+                  },
+                  {
+                    "title": "BOM-Link Element",
+                    "$ref": "#/definitions/bomLinkElementType"
+                  }
+                ]
+              },
+              "title": "BOM References",
+              "description": "The object in the BOM identified by its bom-ref. This is often a component or service, but may be any object type supporting bom-refs. Tools used for analysis should already be defined in the BOM, either in the metadata/tools, components, or formulation."
+            }
+          }
+        },
+        "occurrences": {
+          "type": "array",
+          "title": "Occurrences",
+          "description": "Evidence of individual instances of a component spread across multiple locations.",
+          "items": {
+            "type": "object",
+            "required": [ "location" ],
+            "additionalProperties": false,
+            "properties": {
+              "bom-ref": {
+                "$ref": "#/definitions/refType",
+                "title": "BOM Reference",
+                "description": "An optional identifier which can be used to reference the occurrence elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+              },
+              "location": {
+                "type": "string",
+                "title": "Location",
+                "description": "The location or path to where the component was found."
+              }
+            }
+          }
+        },
+        "callstack": {
+          "type": "object",
+          "description": "Evidence of the components use through the callstack.",
+          "additionalProperties": false,
+          "properties": {
+            "frames": {
+              "type": "array",
+              "title": "Methods",
+              "items": {
+                "type": "object",
+                "required": [
+                  "module"
+                ],
+                "additionalProperties": false,
+                "properties": {
+                  "package": {
+                    "title": "Package",
+                    "description": "A package organizes modules into namespaces, providing a unique namespace for each type it contains.",
+                    "type": "string"
+                  },
+                  "module": {
+                    "title": "Module",
+                    "description": "A module or class that encloses functions/methods and other code.",
+                    "type": "string"
+                  },
+                  "function": {
+                    "title": "Function",
+                    "description": "A block of code designed to perform a particular task.",
+                    "type": "string"
+                  },
+                  "parameters": {
+                    "title": "Parameters",
+                    "description": "Optional arguments that are passed to the module or function.",
+                    "type": "array",
+                    "items": {
+                      "type": "string"
+                    }
+                  },
+                  "line": {
+                    "title": "Line",
+                    "description": "The line number the code that is called resides on.",
+                    "type": "integer"
+                  },
+                  "column": {
+                    "title": "Column",
+                    "description": "The column the code that is called resides.",
+                    "type": "integer"
+                  },
+                  "fullFilename": {
+                    "title": "Full Filename",
+                    "description": "The full path and filename of the module.",
+                    "type": "string"
+                  }
+                }
+              }
+            }
+          }
+        },
+        "licenses": {
+          "$ref": "#/definitions/licenseChoice",
+          "title": "Component License(s)"
+        },
+        "copyright": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/copyright"},
+          "title": "Copyright"
+        }
+      }
+    },
+    "compositions": {
+      "type": "object",
+      "title": "Compositions",
+      "required": [
+        "aggregate"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the composition elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "aggregate": {
+          "$ref": "#/definitions/aggregateType",
+          "title": "Aggregate",
+          "description": "Specifies an aggregate type that describe how complete a relationship is.\n\n* __complete__ = The relationship is complete. No further relationships including constituent components, services, or dependencies are known to exist.\n* __incomplete__ = The relationship is incomplete. Additional relationships exist and may include constituent components, services, or dependencies.\n* __incomplete&#95;first&#95;party&#95;only__ = The relationship is incomplete. Only relationships for first-party components, services, or their dependencies are represented.\n* __incomplete&#95;first&#95;party&#95;proprietary&#95;only__ = The relationship is incomplete. Only relationships for first-party components, services, or their dependencies are represented, limited specifically to those that are proprietary.\n* __incomplete&#95;first&#95;party&#95;opensource&#95;only__ = The relationship is incomplete. Only relationships for first-party components, services, or their dependencies are represented, limited specifically to those that are opensource.\n* __incomplete&#95;third&#95;party&#95;only__ = The relationship is incomplete. Only relationships for third-party components, services, or their dependencies are represented.\n* __incomplete&#95;third&#95;party&#95;proprietary&#95;only__ = The relationship is incomplete. Only relationships for third-party components, services, or their dependencies are represented, limited specifically to those that are proprietary.\n* __incomplete&#95;third&#95;party&#95;opensource&#95;only__ = The relationship is incomplete. Only relationships for third-party components, services, or their dependencies are represented, limited specifically to those that are opensource.\n* __unknown__ = The relationship may be complete or incomplete. This usually signifies a 'best-effort' to obtain constituent components, services, or dependencies but the completeness is inconclusive.\n* __not&#95;specified__ = The relationship completeness is not specified.\n"
+        },
+        "assemblies": {
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "anyOf": [
+              {
+                "title": "Ref",
+                "$ref": "#/definitions/refLinkType"
+              },
+              {
+                "title": "BOM-Link Element",
+                "$ref": "#/definitions/bomLinkElementType"
+              }
+            ]
+          },
+          "title": "BOM references",
+          "description": "The bom-ref identifiers of the components or services being described. Assemblies refer to nested relationships whereby a constituent part may include other constituent parts. References do not cascade to child parts. References are explicit for the specified constituent part only."
+        },
+        "dependencies": {
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "type": "string"
+          },
+          "title": "BOM references",
+          "description": "The bom-ref identifiers of the components or services being described. Dependencies refer to a relationship whereby an independent constituent part requires another independent constituent part. References do not cascade to transitive dependencies. References are explicit for the specified dependency only."
+        },
+        "vulnerabilities": {
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "type": "string"
+          },
+          "title": "BOM references",
+          "description": "The bom-ref identifiers of the vulnerabilities being described."
+        },
+        "signature": {
+          "$ref": "#/definitions/signature",
+          "title": "Signature",
+          "description": "Enveloped signature in [JSON Signature Format (JSF)](https://cyberphone.github.io/doc/security/jsf.html)."
+        }
+      }
+    },
+    "aggregateType": {
+      "type": "string",
+      "default": "not_specified",
+      "enum": [
+        "complete",
+        "incomplete",
+        "incomplete_first_party_only",
+        "incomplete_first_party_proprietary_only",
+        "incomplete_first_party_opensource_only",
+        "incomplete_third_party_only",
+        "incomplete_third_party_proprietary_only",
+        "incomplete_third_party_opensource_only",
+        "unknown",
+        "not_specified"
+      ]
+    },
+    "property": {
+      "type": "object",
+      "title": "Lightweight name-value pair",
+      "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+      "properties": {
+        "name": {
+          "type": "string",
+          "title": "Name",
+          "description": "The name of the property. Duplicate names are allowed, each potentially having a different value."
+        },
+        "value": {
+          "type": "string",
+          "title": "Value",
+          "description": "The value of the property."
+        }
+      }
+    },
+    "localeType": {
+      "type": "string",
+      "pattern": "^([a-z]{2})(-[A-Z]{2})?$",
+      "title": "Locale",
+      "description": "Defines a syntax for representing two character language code (ISO-639) followed by an optional two character country code. The language code MUST be lower case. If the country code is specified, the country code MUST be upper case. The language code and country code MUST be separated by a minus sign. Examples: en, en-US, fr, fr-CA"
+    },
+    "releaseType": {
+      "type": "string",
+      "examples": [
+        "major",
+        "minor",
+        "patch",
+        "pre-release",
+        "internal"
+      ],
+      "description": "The software versioning type. It is RECOMMENDED that the release type use one of 'major', 'minor', 'patch', 'pre-release', or 'internal'. Representing all possible software release types is not practical, so standardizing on the recommended values, whenever possible, is strongly encouraged.\n\n* __major__ = A major release may contain significant changes or may introduce breaking changes.\n* __minor__ = A minor release, also known as an update, may contain a smaller number of changes than major releases.\n* __patch__ = Patch releases are typically unplanned and may resolve defects or important security issues.\n* __pre-release__ = A pre-release may include alpha, beta, or release candidates and typically have limited support. They provide the ability to preview a release prior to its general availability.\n* __internal__ = Internal releases are not for public consumption and are intended to be used exclusively by the project or manufacturer that produced it."
+    },
+    "note": {
+      "type": "object",
+      "title": "Note",
+      "description": "A note containing the locale and content.",
+      "required": [
+        "text"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "locale": {
+          "$ref": "#/definitions/localeType",
+          "title": "Locale",
+          "description": "The ISO-639 (or higher) language code and optional ISO-3166 (or higher) country code. Examples include: \"en\", \"en-US\", \"fr\" and \"fr-CA\""
+        },
+        "text": {
+          "title": "Release note content",
+          "description": "Specifies the full content of the release note.",
+          "$ref": "#/definitions/attachment"
+        }
+      }
+    },
+    "releaseNotes": {
+      "type": "object",
+      "title": "Release notes",
+      "required": [
+        "type"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "type": {
+          "$ref": "#/definitions/releaseType",
+          "title": "Type",
+          "description": "The software versioning type the release note describes."
+        },
+        "title": {
+          "type": "string",
+          "title": "Title",
+          "description": "The title of the release."
+        },
+        "featuredImage": {
+          "type": "string",
+          "format": "iri-reference",
+          "title": "Featured image",
+          "description": "The URL to an image that may be prominently displayed with the release note."
+        },
+        "socialImage": {
+          "type": "string",
+          "format": "iri-reference",
+          "title": "Social image",
+          "description": "The URL to an image that may be used in messaging on social media platforms."
+        },
+        "description": {
+          "type": "string",
+          "title": "Description",
+          "description": "A short description of the release."
+        },
+        "timestamp": {
+          "type": "string",
+          "format": "date-time",
+          "title": "Timestamp",
+          "description": "The date and time (timestamp) when the release note was created."
+        },
+        "aliases": {
+          "type": "array",
+          "items": {
+            "type": "string"
+          },
+          "title": "Aliases",
+          "description": "One or more alternate names the release may be referred to. This may include unofficial terms used by development and marketing teams (e.g. code names)."
+        },
+        "tags": {
+          "type": "array",
+          "items": {
+            "type": "string"
+          },
+          "title": "Tags",
+          "description": "One or more tags that may aid in search or retrieval of the release note."
+        },
+        "resolves": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/issue"},
+          "title": "Resolves",
+          "description": "A collection of issues that have been resolved."
+        },
+        "notes": {
+          "type": "array",
+          "items": {"$ref": "#/definitions/note"},
+          "title": "Notes",
+          "description": "Zero or more release notes containing the locale and content. Multiple note objects may be specified to support release notes in a wide variety of languages."
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+          "items": {"$ref": "#/definitions/property"}
+        }
+      }
+    },
+    "advisory": {
+      "type": "object",
+      "title": "Advisory",
+      "description": "Title and location where advisory information can be obtained. An advisory is a notification of a threat to a component, service, or system.",
+      "required": ["url"],
+      "additionalProperties": false,
+      "properties": {
+        "title": {
+          "type": "string",
+          "title": "Title",
+          "description": "An optional name of the advisory."
+        },
+        "url": {
+          "type": "string",
+          "title": "URL",
+          "format": "iri-reference",
+          "description": "Location where the advisory can be obtained."
+        }
+      }
+    },
+    "cwe": {
+      "type": "integer",
+      "minimum": 1,
+      "title": "CWE",
+      "description": "Integer representation of a Common Weaknesses Enumerations (CWE). For example 399 (of https://cwe.mitre.org/data/definitions/399.html)"
+    },
+    "severity": {
+      "type": "string",
+      "title": "Severity",
+      "description": "Textual representation of the severity of the vulnerability adopted by the analysis method. If the analysis method uses values other than what is provided, the user is expected to translate appropriately.",
+      "enum": [
+        "critical",
+        "high",
+        "medium",
+        "low",
+        "info",
+        "none",
+        "unknown"
+      ]
+    },
+    "scoreMethod": {
+      "type": "string",
+      "title": "Method",
+      "description": "Specifies the severity or risk scoring methodology or standard used.\n\n* CVSSv2 - [Common Vulnerability Scoring System v2](https://www.first.org/cvss/v2/)\n* CVSSv3 - [Common Vulnerability Scoring System v3](https://www.first.org/cvss/v3-0/)\n* CVSSv31 - [Common Vulnerability Scoring System v3.1](https://www.first.org/cvss/v3-1/)\n* CVSSv4 - [Common Vulnerability Scoring System v4](https://www.first.org/cvss/v4-0/)\n* OWASP - [OWASP Risk Rating Methodology](https://owasp.org/www-community/OWASP_Risk_Rating_Methodology)\n* SSVC - [Stakeholder Specific Vulnerability Categorization](https://github.com/CERTCC/SSVC) (all versions)",
+      "enum": [
+        "CVSSv2",
+        "CVSSv3",
+        "CVSSv31",
+        "CVSSv4",
+        "OWASP",
+        "SSVC",
+        "other"
+      ]
+    },
+    "impactAnalysisState": {
+      "type": "string",
+      "title": "Impact Analysis State",
+      "description": "Declares the current state of an occurrence of a vulnerability, after automated or manual analysis. \n\n* __resolved__ = the vulnerability has been remediated. \n* __resolved\\_with\\_pedigree__ = the vulnerability has been remediated and evidence of the changes are provided in the affected components pedigree containing verifiable commit history and/or diff(s). \n* __exploitable__ = the vulnerability may be directly or indirectly exploitable. \n* __in\\_triage__ = the vulnerability is being investigated. \n* __false\\_positive__ = the vulnerability is not specific to the component or service and was falsely identified or associated. \n* __not\\_affected__ = the component or service is not affected by the vulnerability. Justification should be specified for all not_affected cases.",
+      "enum": [
+        "resolved",
+        "resolved_with_pedigree",
+        "exploitable",
+        "in_triage",
+        "false_positive",
+        "not_affected"
+      ]
+    },
+    "impactAnalysisJustification": {
+      "type": "string",
+      "title": "Impact Analysis Justification",
+      "description": "The rationale of why the impact analysis state was asserted. \n\n* __code\\_not\\_present__ = the code has been removed or tree-shaked. \n* __code\\_not\\_reachable__ = the vulnerable code is not invoked at runtime. \n* __requires\\_configuration__ = exploitability requires a configurable option to be set/unset. \n* __requires\\_dependency__ = exploitability requires a dependency that is not present. \n* __requires\\_environment__ = exploitability requires a certain environment which is not present. \n* __protected\\_by\\_compiler__ = exploitability requires a compiler flag to be set/unset. \n* __protected\\_at\\_runtime__ = exploits are prevented at runtime. \n* __protected\\_at\\_perimeter__ = attacks are blocked at physical, logical, or network perimeter. \n* __protected\\_by\\_mitigating\\_control__ = preventative measures have been implemented that reduce the likelihood and/or impact of the vulnerability.",
+      "enum": [
+        "code_not_present",
+        "code_not_reachable",
+        "requires_configuration",
+        "requires_dependency",
+        "requires_environment",
+        "protected_by_compiler",
+        "protected_at_runtime",
+        "protected_at_perimeter",
+        "protected_by_mitigating_control"
+      ]
+    },
+    "rating": {
+      "type": "object",
+      "title": "Rating",
+      "description": "Defines the severity or risk ratings of a vulnerability.",
+      "additionalProperties": false,
+      "properties": {
+        "source": {
+          "$ref": "#/definitions/vulnerabilitySource",
+          "description": "The source that calculated the severity or risk rating of the vulnerability."
+        },
+        "score": {
+          "type": "number",
+          "title": "Score",
+          "description": "The numerical score of the rating."
+        },
+        "severity": {
+          "$ref": "#/definitions/severity",
+          "description": "Textual representation of the severity that corresponds to the numerical score of the rating."
+        },
+        "method": {
+          "$ref": "#/definitions/scoreMethod"
+        },
+        "vector": {
+          "type": "string",
+          "title": "Vector",
+          "description": "Textual representation of the metric values used to score the vulnerability"
+        },
+        "justification": {
+          "type": "string",
+          "title": "Justification",
+          "description": "An optional reason for rating the vulnerability as it was"
+        }
+      }
+    },
+    "vulnerabilitySource": {
+      "type": "object",
+      "title": "Source",
+      "description": "The source of vulnerability information. This is often the organization that published the vulnerability.",
+      "additionalProperties": false,
+      "properties": {
+        "url": {
+          "type": "string",
+          "title": "URL",
+          "description": "The url of the vulnerability documentation as provided by the source.",
+          "examples": [
+            "https://nvd.nist.gov/vuln/detail/CVE-2021-39182"
+          ]
+        },
+        "name": {
+          "type": "string",
+          "title": "Name",
+          "description": "The name of the source.",
+          "examples": [
+            "NVD",
+            "National Vulnerability Database",
+            "OSS Index",
+            "VulnDB",
+            "GitHub Advisories"
+          ]
+        }
+      }
+    },
+    "vulnerability": {
+      "type": "object",
+      "title": "Vulnerability",
+      "description": "Defines a weakness in a component or service that could be exploited or triggered by a threat source.",
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the vulnerability elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "id": {
+          "type": "string",
+          "title": "ID",
+          "description": "The identifier that uniquely identifies the vulnerability.",
+          "examples": [
+            "CVE-2021-39182",
+            "GHSA-35m5-8cvj-8783",
+            "SNYK-PYTHON-ENROCRYPT-1912876"
+          ]
+        },
+        "source": {
+          "$ref": "#/definitions/vulnerabilitySource",
+          "description": "The source that published the vulnerability."
+        },
+        "references": {
+          "type": "array",
+          "title": "References",
+          "description": "Zero or more pointers to vulnerabilities that are the equivalent of the vulnerability specified. Often times, the same vulnerability may exist in multiple sources of vulnerability intelligence, but have different identifiers. References provide a way to correlate vulnerabilities across multiple sources of vulnerability intelligence.",
+          "items": {
+            "type": "object",
+            "required": [
+              "id",
+              "source"
+            ],
+            "additionalProperties": false,
+            "properties": {
+              "id": {
+                "type": "string",
+                "title": "ID",
+                "description": "An identifier that uniquely identifies the vulnerability.",
+                "examples": [
+                  "CVE-2021-39182",
+                  "GHSA-35m5-8cvj-8783",
+                  "SNYK-PYTHON-ENROCRYPT-1912876"
+                ]
+              },
+              "source": {
+                "$ref": "#/definitions/vulnerabilitySource",
+                "description": "The source that published the vulnerability."
+              }
+            }
+          }
+        },
+        "ratings": {
+          "type": "array",
+          "title": "Ratings",
+          "description": "List of vulnerability ratings",
+          "items": {
+            "$ref": "#/definitions/rating"
+          }
+        },
+        "cwes": {
+          "type": "array",
+          "title": "CWEs",
+          "description": "List of Common Weaknesses Enumerations (CWEs) codes that describes this vulnerability. For example 399 (of https://cwe.mitre.org/data/definitions/399.html)",
+          "examples": [399],
+          "items": {
+            "$ref": "#/definitions/cwe"
+          }
+        },
+        "description": {
+          "type": "string",
+          "title": "Description",
+          "description": "A description of the vulnerability as provided by the source."
+        },
+        "detail": {
+          "type": "string",
+          "title": "Details",
+          "description": "If available, an in-depth description of the vulnerability as provided by the source organization. Details often include information useful in understanding root cause."
+        },
+        "recommendation": {
+          "type": "string",
+          "title": "Recommendation",
+          "description": "Recommendations of how the vulnerability can be remediated or mitigated."
+        },
+        "workaround": {
+          "type": "string",
+          "title": "Workarounds",
+          "description": "A bypass, usually temporary, of the vulnerability that reduces its likelihood and/or impact. Workarounds often involve changes to configuration or deployments."
+        },
+        "proofOfConcept": {
+          "type": "object",
+          "title": "Proof of Concept",
+          "description": "Evidence used to reproduce the vulnerability.",
+          "properties": {
+            "reproductionSteps": {
+              "type": "string",
+              "title": "Steps to Reproduce",
+              "description": "Precise steps to reproduce the vulnerability."
+            },
+            "environment": {
+              "type": "string",
+              "title": "Environment",
+              "description": "A description of the environment in which reproduction was possible."
+            },
+            "supportingMaterial": {
+              "type": "array",
+              "title": "Supporting Material",
+              "description": "Supporting material that helps in reproducing or understanding how reproduction is possible. This may include screenshots, payloads, and PoC exploit code.",
+              "items": { "$ref": "#/definitions/attachment" }
+            }
+          }
+        },
+        "advisories": {
+          "type": "array",
+          "title": "Advisories",
+          "description": "Published advisories of the vulnerability if provided.",
+          "items": {
+            "$ref": "#/definitions/advisory"
+          }
+        },
+        "created": {
+          "type": "string",
+          "format": "date-time",
+          "title": "Created",
+          "description": "The date and time (timestamp) when the vulnerability record was created in the vulnerability database."
+        },
+        "published": {
+          "type": "string",
+          "format": "date-time",
+          "title": "Published",
+          "description": "The date and time (timestamp) when the vulnerability record was first published."
+        },
+        "updated": {
+          "type": "string",
+          "format": "date-time",
+          "title": "Updated",
+          "description": "The date and time (timestamp) when the vulnerability record was last updated."
+        },
+        "rejected": {
+          "type": "string",
+          "format": "date-time",
+          "title": "Rejected",
+          "description": "The date and time (timestamp) when the vulnerability record was rejected (if applicable)."
+        },
+        "credits": {
+          "type": "object",
+          "title": "Credits",
+          "description": "Individuals or organizations credited with the discovery of the vulnerability.",
+          "additionalProperties": false,
+          "properties": {
+            "organizations": {
+              "type": "array",
+              "title": "Organizations",
+              "description": "The organizations credited with vulnerability discovery.",
+              "items": {
+                "$ref": "#/definitions/organizationalEntity"
+              }
+            },
+            "individuals": {
+              "type": "array",
+              "title": "Individuals",
+              "description": "The individuals, not associated with organizations, that are credited with vulnerability discovery.",
+              "items": {
+                "$ref": "#/definitions/organizationalContact"
+              }
+            }
+          }
+        },
+        "tools": {
+          "oneOf": [
+            {
+              "type": "object",
+              "title": "Tools",
+              "description": "The tool(s) used to identify, confirm, or score the vulnerability.",
+              "additionalProperties": false,
+              "properties": {
+                "components": {
+                  "type": "array",
+                  "items": {"$ref": "#/definitions/component"},
+                  "uniqueItems": true,
+                  "title": "Components",
+                  "description": "A list of software and hardware components used as tools"
+                },
+                "services": {
+                  "type": "array",
+                  "items": {"$ref": "#/definitions/service"},
+                  "uniqueItems": true,
+                  "title": "Services",
+                  "description": "A list of services used as tools. This may include microservices, function-as-a-service, and other types of network or intra-process services."
+                }
+              }
+            },
+            {
+              "type": "array",
+              "title": "Tools (legacy)",
+              "description": "[Deprecated] The tool(s) used to identify, confirm, or score the vulnerability.",
+              "items": {"$ref": "#/definitions/tool"}
+            }
+          ]
+        },
+        "analysis": {
+          "type": "object",
+          "title": "Impact Analysis",
+          "description": "An assessment of the impact and exploitability of the vulnerability.",
+          "additionalProperties": false,
+          "properties": {
+            "state": {
+              "$ref": "#/definitions/impactAnalysisState"
+            },
+            "justification": {
+              "$ref": "#/definitions/impactAnalysisJustification"
+            },
+            "response": {
+              "type": "array",
+              "title": "Response",
+              "description": "A response to the vulnerability by the manufacturer, supplier, or project responsible for the affected component or service. More than one response is allowed. Responses are strongly encouraged for vulnerabilities where the analysis state is exploitable.",
+              "items": {
+                "type": "string",
+                "enum": [
+                  "can_not_fix",
+                  "will_not_fix",
+                  "update",
+                  "rollback",
+                  "workaround_available"
+                ]
+              }
+            },
+            "detail": {
+              "type": "string",
+              "title": "Detail",
+              "description": "Detailed description of the impact including methods used during assessment. If a vulnerability is not exploitable, this field should include specific details on why the component or service is not impacted by this vulnerability."
+            },
+            "firstIssued": {
+              "type": "string",
+              "format": "date-time",
+              "title": "First Issued",
+              "description": "The date and time (timestamp) when the analysis was first issued."
+            },
+            "lastUpdated": {
+              "type": "string",
+              "format": "date-time",
+              "title": "Last Updated",
+              "description": "The date and time (timestamp) when the analysis was last updated."
+            }
+          }
+        },
+        "affects": {
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "type": "object",
+            "required": [
+              "ref"
+            ],
+            "additionalProperties": false,
+            "properties": {
+              "ref": {
+                "anyOf": [
+                  {
+                    "title": "Ref",
+                    "$ref": "#/definitions/refLinkType"
+                  },
+                  {
+                    "title": "BOM-Link Element",
+                    "$ref": "#/definitions/bomLinkElementType"
+                  }
+                ],
+                "title": "Reference",
+                "description": "References a component or service by the objects bom-ref"
+              },
+              "versions": {
+                "type": "array",
+                "title": "Versions",
+                "description": "Zero or more individual versions or range of versions.",
+                "items": {
+                  "type": "object",
+                  "oneOf": [
+                    {
+                      "required": ["version"]
+                    },
+                    {
+                      "required": ["range"]
+                    }
+                  ],
+                  "additionalProperties": false,
+                  "properties": {
+                    "version": {
+                      "description": "A single version of a component or service.",
+                      "$ref": "#/definitions/version"
+                    },
+                    "range": {
+                      "description": "A version range specified in Package URL Version Range syntax (vers) which is defined at https://github.com/package-url/purl-spec/VERSION-RANGE-SPEC.rst",
+                      "$ref": "#/definitions/range"
+                    },
+                    "status": {
+                      "description": "The vulnerability status for the version or range of versions.",
+                      "$ref": "#/definitions/affectedStatus",
+                      "default": "affected"
+                    }
+                  }
+                }
+              }
+            }
+          },
+          "title": "Affects",
+          "description": "The components or services that are affected by the vulnerability."
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "affectedStatus": {
+      "description": "The vulnerability status of a given version or range of versions of a product. The statuses 'affected' and 'unaffected' indicate that the version is affected or unaffected by the vulnerability. The status 'unknown' indicates that it is unknown or unspecified whether the given version is affected. There can be many reasons for an 'unknown' status, including that an investigation has not been undertaken or that a vendor has not disclosed the status.",
+      "type": "string",
+      "enum": [
+        "affected",
+        "unaffected",
+        "unknown"
+      ]
+    },
+    "version": {
+      "description": "A single version of a component or service.",
+      "type": "string",
+      "minLength": 1,
+      "maxLength": 1024
+    },
+    "range": {
+      "description": "A version range specified in Package URL Version Range syntax (vers) which is defined at https://github.com/package-url/purl-spec/VERSION-RANGE-SPEC.rst",
+      "type": "string",
+      "minLength": 1,
+      "maxLength": 1024
+    },
+    "annotations": {
+      "type": "object",
+      "title": "Annotations",
+      "description": "A comment, note, explanation, or similar textual content which provides additional context to the object(s) being annotated.",
+      "required": [
+        "subjects",
+        "annotator",
+        "timestamp",
+        "text"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the annotation elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "subjects": {
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "anyOf": [
+              {
+                "title": "Ref",
+                "$ref": "#/definitions/refLinkType"
+              },
+              {
+                "title": "BOM-Link Element",
+                "$ref": "#/definitions/bomLinkElementType"
+              }
+            ]
+          },
+          "title": "BOM References",
+          "description": "The object in the BOM identified by its bom-ref. This is often a component or service, but may be any object type supporting bom-refs."
+        },
+        "annotator": {
+          "type": "object",
+          "title": "Annotator",
+          "description": "The organization, person, component, or service which created the textual content of the annotation.",
+          "oneOf": [
+            {
+              "required": [
+                "organization"
+              ]
+            },
+            {
+              "required": [
+                "individual"
+              ]
+            },
+            {
+              "required": [
+                "component"
+              ]
+            },
+            {
+              "required": [
+                "service"
+              ]
+            }
+          ],
+          "additionalProperties": false,
+          "properties": {
+            "organization": {
+              "description": "The organization that created the annotation",
+              "$ref": "#/definitions/organizationalEntity"
+            },
+            "individual": {
+              "description": "The person that created the annotation",
+              "$ref": "#/definitions/organizationalContact"
+            },
+            "component": {
+              "description": "The tool or component that created the annotation",
+              "$ref": "#/definitions/component"
+            },
+            "service": {
+              "description": "The service that created the annotation",
+              "$ref": "#/definitions/service"
+            }
+          }
+        },
+        "timestamp": {
+          "type": "string",
+          "format": "date-time",
+          "title": "Timestamp",
+          "description": "The date and time (timestamp) when the annotation was created."
+        },
+        "text": {
+          "type": "string",
+          "title": "Text",
+          "description": "The textual content of the annotation."
+        },
+        "signature": {
+          "$ref": "#/definitions/signature",
+          "title": "Signature",
+          "description": "Enveloped signature in [JSON Signature Format (JSF)](https://cyberphone.github.io/doc/security/jsf.html)."
+        }
+      }
+    },
+    "modelCard": {
+      "$comment": "Model card support in CycloneDX is derived from TensorFlow Model Card Toolkit released under the Apache 2.0 license and available from https://github.com/tensorflow/model-card-toolkit/blob/main/model_card_toolkit/schema/v0.0.2/model_card.schema.json. In addition, CycloneDX model card support includes portions of VerifyML, also released under the Apache 2.0 license and available from https://github.com/cylynx/verifyml/blob/main/verifyml/model_card_toolkit/schema/v0.0.4/model_card.schema.json.",
+      "type": "object",
+      "title": "Model Card",
+      "description": "A model card describes the intended uses of a machine learning model and potential limitations, including biases and ethical considerations. Model cards typically contain the training parameters, which datasets were used to train the model, performance metrics, and other relevant data useful for ML transparency. This object SHOULD be specified for any component of type `machine-learning-model` and MUST NOT be specified for other component types.",
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the model card elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "modelParameters": {
+          "type": "object",
+          "title": "Model Parameters",
+          "description": "Hyper-parameters for construction of the model.",
+          "additionalProperties": false,
+          "properties": {
+            "approach": {
+              "type": "object",
+              "title": "Approach",
+              "description": "The overall approach to learning used by the model for problem solving.",
+              "additionalProperties": false,
+              "properties": {
+                "type": {
+                  "type": "string",
+                  "title": "Learning Type",
+                  "description": "Learning types describing the learning problem or hybrid learning problem.",
+                  "enum": [
+                    "supervised",
+                    "unsupervised",
+                    "reinforcement-learning",
+                    "semi-supervised",
+                    "self-supervised"
+                  ]
+                }
+              }
+            },
+            "task": {
+              "type": "string",
+              "title": "Task",
+              "description": "Directly influences the input and/or output. Examples include classification, regression, clustering, etc."
+            },
+            "architectureFamily": {
+              "type": "string",
+              "title": "Architecture Family",
+              "description": "The model architecture family such as transformer network, convolutional neural network, residual neural network, LSTM neural network, etc."
+            },
+            "modelArchitecture": {
+              "type": "string",
+              "title": "Model Architecture",
+              "description": "The specific architecture of the model such as GPT-1, ResNet-50, YOLOv3, etc."
+            },
+            "datasets": {
+              "type": "array",
+              "title": "Datasets",
+              "description": "The datasets used to train and evaluate the model.",
+              "items" : {
+                "oneOf" : [
+                  {
+                    "title": "Inline Component Data",
+                    "$ref": "#/definitions/componentData"
+                  },
+                  {
+                    "type": "object",
+                    "title": "Data Component Reference",
+                    "additionalProperties": false,
+                    "properties": {
+                      "ref": {
+                        "anyOf": [
+                          {
+                            "title": "Ref",
+                            "$ref": "#/definitions/refLinkType"
+                          },
+                          {
+                            "title": "BOM-Link Element",
+                            "$ref": "#/definitions/bomLinkElementType"
+                          }
+                        ],
+                        "title": "Reference",
+                        "description": "References a data component by the components bom-ref attribute"
+                      }
+                    }
+                  }
+                ]
+              }
+            },
+            "inputs": {
+              "type": "array",
+              "title": "Inputs",
+              "description": "The input format(s) of the model",
+              "items": { "$ref": "#/definitions/inputOutputMLParameters" }
+            },
+            "outputs": {
+              "type": "array",
+              "title": "Outputs",
+              "description": "The output format(s) from the model",
+              "items": { "$ref": "#/definitions/inputOutputMLParameters" }
+            }
+          }
+        },
+        "quantitativeAnalysis": {
+          "type": "object",
+          "title": "Quantitative Analysis",
+          "description": "A quantitative analysis of the model",
+          "additionalProperties": false,
+          "properties": {
+            "performanceMetrics": {
+              "type": "array",
+              "title": "Performance Metrics",
+              "description": "The model performance metrics being reported. Examples may include accuracy, F1 score, precision, top-3 error rates, MSC, etc.",
+              "items": { "$ref": "#/definitions/performanceMetric" }
+            },
+            "graphics": { "$ref": "#/definitions/graphicsCollection" }
+          }
+        },
+        "considerations": {
+          "type": "object",
+          "title": "Considerations",
+          "description": "What considerations should be taken into account regarding the model's construction, training, and application?",
+          "additionalProperties": false,
+          "properties": {
+            "users": {
+              "type": "array",
+              "title": "Users",
+              "description": "Who are the intended users of the model?",
+              "items": {
+                "type": "string"
+              }
+            },
+            "useCases": {
+              "type": "array",
+              "title": "Use Cases",
+              "description": "What are the intended use cases of the model?",
+              "items": {
+                "type": "string"
+              }
+            },
+            "technicalLimitations": {
+              "type": "array",
+              "title": "Technical Limitations",
+              "description": "What are the known technical limitations of the model? E.g. What kind(s) of data should the model be expected not to perform well on? What are the factors that might degrade model performance?",
+              "items": {
+                "type": "string"
+              }
+            },
+            "performanceTradeoffs": {
+              "type": "array",
+              "title": "Performance Tradeoffs",
+              "description": "What are the known tradeoffs in accuracy/performance of the model?",
+              "items": {
+                "type": "string"
+              }
+            },
+            "ethicalConsiderations": {
+              "type": "array",
+              "title": "Ethical Considerations",
+              "description": "What are the ethical (or environmental) risks involved in the application of this model?",
+              "items": { "$ref": "#/definitions/risk" }
+            },
+            "fairnessAssessments": {
+              "type": "array",
+              "title": "Fairness Assessments",
+              "description": "How does the model affect groups at risk of being systematically disadvantaged? What are the harms and benefits to the various affected groups?",
+              "items": {
+                "$ref": "#/definitions/fairnessAssessment"
+              }
+            }
+          }
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "description": "Provides the ability to document properties in a name-value store. This provides flexibility to include data not officially supported in the standard without having to use additional namespaces or create extensions. Unlike key-value stores, properties support duplicate names, each potentially having different values. Property names of interest to the general public are encouraged to be registered in the [CycloneDX Property Taxonomy](https://github.com/CycloneDX/cyclonedx-property-taxonomy). Formal registration is OPTIONAL.",
+          "items": {"$ref": "#/definitions/property"}
+        }
+      }
+    },
+    "inputOutputMLParameters": {
+      "type": "object",
+      "title": "Input and Output Parameters",
+      "additionalProperties": false,
+      "properties": {
+        "format": {
+          "description": "The data format for input/output to the model. Example formats include string, image, time-series",
+          "type": "string"
+        }
+      }
+    },
+    "componentData": {
+      "type": "object",
+      "additionalProperties": false,
+      "required": [
+        "type"
+      ],
+      "properties": {
+        "bom-ref": {
+          "$ref": "#/definitions/refType",
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the dataset elsewhere in the BOM. Every bom-ref MUST be unique within the BOM."
+        },
+        "type": {
+          "type": "string",
+          "title": "Type of Data",
+          "description": "The general theme or subject matter of the data being specified.\n\n* __source-code__ = Any type of code, code snippet, or data-as-code.\n* __configuration__ = Parameters or settings that may be used by other components.\n* __dataset__ = A collection of data.\n* __definition__ = Data that can be used to create new instances of what the definition defines.\n* __other__ = Any other type of data that does not fit into existing definitions.",
+          "enum": [
+            "source-code",
+            "configuration",
+            "dataset",
+            "definition",
+            "other"
+          ]
+        },
+        "name": {
+          "description": "The name of the dataset.",
+          "type": "string"
+        },
+        "contents": {
+          "type": "object",
+          "title": "Data Contents",
+          "description": "The contents or references to the contents of the data being described.",
+          "additionalProperties": false,
+          "properties": {
+            "attachment": {
+              "title": "Data Attachment",
+              "description": "An optional way to include textual or encoded data.",
+              "$ref": "#/definitions/attachment"
+            },
+            "url": {
+              "type": "string",
+              "title": "Data URL",
+              "description": "The URL to where the data can be retrieved.",
+              "format": "iri-reference"
+            },
+            "properties": {
+              "type": "array",
+              "title": "Configuration Properties",
+              "description": "Provides the ability to document name-value parameters used for configuration.",
+              "items": {
+                "$ref": "#/definitions/property"
+              }
+            }
+          }
+        },
+        "classification": {
+          "$ref": "#/definitions/dataClassification"
+        },
+        "sensitiveData": {
+          "type": "array",
+          "description": "A description of any sensitive data in a dataset.",
+          "items": {
+            "type": "string"
+          }
+        },
+        "graphics": { "$ref": "#/definitions/graphicsCollection" },
+        "description": {
+          "description": "A description of the dataset. Can describe size of dataset, whether it's used for source code, training, testing, or validation, etc.",
+          "type": "string"
+        },
+        "governance": {
+          "type": "object",
+          "title": "Data Governance",
+          "$ref": "#/definitions/dataGovernance"
+        }
+      }
+    },
+    "dataGovernance": {
+      "type": "object",
+      "title": "Data Governance",
+      "additionalProperties": false,
+      "properties": {
+        "custodians": {
+          "type": "array",
+          "title": "Data Custodians",
+          "description": "Data custodians are responsible for the safe custody, transport, and storage of data.",
+          "items": { "$ref": "#/definitions/dataGovernanceResponsibleParty" }
+        },
+        "stewards": {
+          "type": "array",
+          "title": "Data Stewards",
+          "description": "Data stewards are responsible for data content, context, and associated business rules.",
+          "items": { "$ref": "#/definitions/dataGovernanceResponsibleParty" }
+        },
+        "owners": {
+          "type": "array",
+          "title": "Data Owners",
+          "description": "Data owners are concerned with risk and appropriate access to data.",
+          "items": { "$ref": "#/definitions/dataGovernanceResponsibleParty" }
+        }
+      }
+    },
+    "dataGovernanceResponsibleParty": {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "organization": {
+          "title": "Organization",
+          "$ref": "#/definitions/organizationalEntity"
+        },
+        "contact": {
+          "title": "Individual",
+          "$ref": "#/definitions/organizationalContact"
+        }
+      },
+      "oneOf":[
+        {
+          "required": ["organization"]
+        },
+        {
+          "required": ["contact"]
+        }
+      ]
+    },
+    "graphicsCollection": {
+      "type": "object",
+      "title": "Graphics Collection",
+      "description": "A collection of graphics that represent various measurements.",
+      "additionalProperties": false,
+      "properties": {
+        "description": {
+          "description": "A description of this collection of graphics.",
+          "type": "string"
+        },
+        "collection": {
+          "description": "A collection of graphics.",
+          "type": "array",
+          "items": { "$ref": "#/definitions/graphic" }
+        }
+      }
+    },
+    "graphic": {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "name": {
+          "description": "The name of the graphic.",
+          "type": "string"
+        },
+        "image": {
+          "title": "Graphic Image",
+          "description": "The graphic (vector or raster). Base64 encoding MUST be specified for binary images.",
+          "$ref": "#/definitions/attachment"
+        }
+      }
+    },
+    "performanceMetric": {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "type": {
+          "description": "The type of performance metric.",
+          "type": "string"
+        },
+        "value": {
+          "description": "The value of the performance metric.",
+          "type": "string"
+        },
+        "slice": {
+          "description": "The name of the slice this metric was computed on. By default, assume this metric is not sliced.",
+          "type": "string"
+        },
+        "confidenceInterval": {
+          "description": "The confidence interval of the metric.",
+          "type": "object",
+          "additionalProperties": false,
+          "properties": {
+            "lowerBound": {
+              "description": "The lower bound of the confidence interval.",
+              "type": "string"
+            },
+            "upperBound": {
+              "description": "The upper bound of the confidence interval.",
+              "type": "string"
+            }
+          }
+        }
+      }
+    },
+    "risk": {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "name": {
+          "description": "The name of the risk.",
+          "type": "string"
+        },
+        "mitigationStrategy": {
+          "description": "Strategy used to address this risk.",
+          "type": "string"
+        }
+      }
+    },
+    "fairnessAssessment": {
+      "type": "object",
+      "title": "Fairness Assessment",
+      "description": "Information about the benefits and harms of the model to an identified at risk group.",
+      "additionalProperties": false,
+      "properties": {
+        "groupAtRisk": {
+          "type": "string",
+          "description": "The groups or individuals at risk of being systematically disadvantaged by the model."
+        },
+        "benefits": {
+          "type": "string",
+          "description": "Expected benefits to the identified groups."
+        },
+        "harms": {
+          "type": "string",
+          "description": "Expected harms to the identified groups."
+        },
+        "mitigationStrategy": {
+          "type": "string",
+          "description": "With respect to the benefits and harms outlined, please describe any mitigation strategy implemented."
+        }
+      }
+    },
+    "dataClassification": {
+      "type": "string",
+      "title": "Data Classification",
+      "description": "Data classification tags data according to its type, sensitivity, and value if altered, stolen, or destroyed."
+    },
+    "formula": {
+      "title": "Formula",
+      "description": "Describes workflows and resources that captures rules and other aspects of how the associated BOM component or service was formed.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the formula elsewhere in the BOM. Every bom-ref MUST be unique within the BOM.",
+          "$ref": "#/definitions/refType"
+        },
+        "components": {
+          "title": "Components",
+          "description": "Transient components that are used in tasks that constitute one or more of this formula's workflows",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/component"
+          },
+          "uniqueItems": true
+        },
+        "services": {
+          "title": "Services",
+          "description": "Transient services that are used in tasks that constitute one or more of this formula's workflows",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/service"
+          },
+          "uniqueItems": true
+        },
+        "workflows": {
+          "title": "Workflows",
+          "description": "List of workflows that can be declared to accomplish specific orchestrated goals and independently triggered.",
+          "$comment": "Different workflows can be designed to work together to perform end-to-end CI/CD builds and deployments.",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/workflow"
+          },
+          "uniqueItems": true
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "workflow": {
+      "title": "Workflow",
+      "description": "A specialized orchestration task.",
+      "$comment": "Workflow are as task themselves and can trigger other workflow tasks.  These relationships can be modeled in the taskDependencies graph.",
+      "type": "object",
+      "required": [
+        "bom-ref",
+        "uid",
+        "taskTypes"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the workflow elsewhere in the BOM. Every bom-ref MUST be unique within the BOM.",
+          "$ref": "#/definitions/refType"
+        },
+        "uid": {
+          "title": "Unique Identifier (UID)",
+          "description": "The unique identifier for the resource instance within its deployment context.",
+          "type": "string"
+        },
+        "name": {
+          "title": "Name",
+          "description": "The name of the resource instance.",
+          "type": "string"
+        },
+        "description": {
+          "title": "Description",
+          "description": "A description of the resource instance.",
+          "type": "string"
+        },
+        "resourceReferences": {
+          "title": "Resource references",
+          "description": "References to component or service resources that are used to realize the resource instance.",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/resourceReferenceChoice"
+          }
+        },
+        "tasks": {
+          "title": "Tasks",
+          "description": "The tasks that comprise the workflow.",
+          "$comment": "Note that tasks can appear more than once as different instances (by name or UID).",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/task"
+          }
+        },
+        "taskDependencies": {
+          "title": "Task dependency graph",
+          "description": "The graph of dependencies between tasks within the workflow.",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/dependency"
+          }
+        },
+        "taskTypes": {
+          "title": "Task types",
+          "description": "Indicates the types of activities performed by the set of workflow tasks.",
+          "$comment": "Currently, these types reflect common CI/CD actions.",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/taskType"
+          }
+        },
+        "trigger": {
+          "title": "Trigger",
+          "description": "The trigger that initiated the task.",
+          "$ref": "#/definitions/trigger"
+        },
+        "steps": {
+          "title": "Steps",
+          "description": "The sequence of steps for the task.",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/step"
+          },
+          "uniqueItems": true
+        },
+        "inputs": {
+          "title": "Inputs",
+          "description": "Represents resources and data brought into a task at runtime by executor or task commands",
+          "examples": ["a `configuration` file which was declared as a local `component` or `externalReference`"],
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/inputType"
+          },
+          "uniqueItems": true
+        },
+        "outputs": {
+          "title": "Outputs",
+          "description": "Represents resources and data output from a task at runtime by executor or task commands",
+          "examples": ["a log file or metrics data produced by the task"],
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/outputType"
+          },
+          "uniqueItems": true
+        },
+        "timeStart": {
+          "title": "Time start",
+          "description": "The date and time (timestamp) when the task started.",
+          "type": "string",
+          "format": "date-time"
+        },
+        "timeEnd": {
+          "title": "Time end",
+          "description": "The date and time (timestamp) when the task ended.",
+          "type": "string",
+          "format": "date-time"
+        },
+        "workspaces": {
+          "title": "Workspaces",
+          "description": "A set of named filesystem or data resource shareable by workflow tasks.",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/workspace"
+          }
+        },
+        "runtimeTopology": {
+          "title": "Runtime topology",
+          "description": "A graph of the component runtime topology for workflow's instance.",
+          "$comment": "A description of the runtime component and service topology.  This can describe a partial or complete topology used to host and execute the task (e.g., hardware, operating systems, configurations, etc.),",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/dependency"
+          }
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "task": {
+      "title": "Task",
+      "description": "Describes the inputs, sequence of steps and resources used to accomplish a task and its output.",
+      "$comment": "Tasks are building blocks for constructing assemble CI/CD workflows or pipelines.",
+      "type": "object",
+      "required": [
+        "bom-ref",
+        "uid",
+        "taskTypes"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the task elsewhere in the BOM. Every bom-ref MUST be unique within the BOM.",
+          "$ref": "#/definitions/refType"
+        },
+        "uid": {
+          "title": "Unique Identifier (UID)",
+          "description": "The unique identifier for the resource instance within its deployment context.",
+          "type": "string"
+        },
+        "name": {
+          "title": "Name",
+          "description": "The name of the resource instance.",
+          "type": "string"
+        },
+        "description": {
+          "title": "Description",
+          "description": "A description of the resource instance.",
+          "type": "string"
+        },
+        "resourceReferences": {
+          "title": "Resource references",
+          "description": "References to component or service resources that are used to realize the resource instance.",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/resourceReferenceChoice"
+          }
+        },
+        "taskTypes": {
+          "title": "Task types",
+          "description": "Indicates the types of activities performed by the set of workflow tasks.",
+          "$comment": "Currently, these types reflect common CI/CD actions.",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/taskType"
+          }
+        },
+        "trigger": {
+          "title": "Trigger",
+          "description": "The trigger that initiated the task.",
+          "$ref": "#/definitions/trigger"
+        },
+        "steps": {
+          "title": "Steps",
+          "description": "The sequence of steps for the task.",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/step"
+          },
+          "uniqueItems": true
+        },
+        "inputs": {
+          "title": "Inputs",
+          "description": "Represents resources and data brought into a task at runtime by executor or task commands",
+          "examples": ["a `configuration` file which was declared as a local `component` or `externalReference`"],
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/inputType"
+          },
+          "uniqueItems": true
+        },
+        "outputs": {
+          "title": "Outputs",
+          "description": "Represents resources and data output from a task at runtime by executor or task commands",
+          "examples": ["a log file or metrics data produced by the task"],
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/outputType"
+          },
+          "uniqueItems": true
+        },
+        "timeStart": {
+          "title": "Time start",
+          "description": "The date and time (timestamp) when the task started.",
+          "type": "string",
+          "format": "date-time"
+        },
+        "timeEnd": {
+          "title": "Time end",
+          "description": "The date and time (timestamp) when the task ended.",
+          "type": "string",
+          "format": "date-time"
+        },
+        "workspaces": {
+          "title": "Workspaces",
+          "description": "A set of named filesystem or data resource shareable by workflow tasks.",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/workspace"
+          },
+          "uniqueItems": true
+        },
+        "runtimeTopology": {
+          "title": "Runtime topology",
+          "description": "A graph of the component runtime topology for task's instance.",
+          "$comment": "A description of the runtime component and service topology.  This can describe a partial or complete topology used to host and execute the task (e.g., hardware, operating systems, configurations, etc.),",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/dependency"
+          },
+          "uniqueItems": true
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "step": {
+      "type": "object",
+      "description": "Executes specific commands or tools in order to accomplish its owning task as part of a sequence.",
+      "additionalProperties": false,
+      "properties": {
+        "name": {
+          "title": "Name",
+          "description": "A name for the step.",
+          "type": "string"
+        },
+        "description": {
+          "title": "Description",
+          "description": "A description of the step.",
+          "type": "string"
+        },
+        "commands": {
+          "title": "Commands",
+          "description": "Ordered list of commands or directives for the step",
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/command"
+          }
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "command": {
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "executed": {
+          "title": "Executed",
+          "description": "A text representation of the executed command.",
+          "type": "string"
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "workspace": {
+      "title": "Workspace",
+      "description": "A named filesystem or data resource shareable by workflow tasks.",
+      "type": "object",
+      "required": [
+        "bom-ref",
+        "uid"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "bom-ref": {
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the workspace elsewhere in the BOM. Every bom-ref MUST be unique within the BOM.",
+          "$ref": "#/definitions/refType"
+        },
+        "uid": {
+          "title": "Unique Identifier (UID)",
+          "description": "The unique identifier for the resource instance within its deployment context.",
+          "type": "string"
+        },
+        "name": {
+          "title": "Name",
+          "description": "The name of the resource instance.",
+          "type": "string"
+        },
+        "aliases": {
+          "title": "Aliases",
+          "description": "The names for the workspace as referenced by other workflow tasks. Effectively, a name mapping so other tasks can use their own local name in their steps.",
+          "type": "array",
+          "items": {"type": "string"}
+        },
+        "description": {
+          "title": "Description",
+          "description": "A description of the resource instance.",
+          "type": "string"
+        },
+        "resourceReferences": {
+          "title": "Resource references",
+          "description": "References to component or service resources that are used to realize the resource instance.",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/resourceReferenceChoice"
+          }
+        },
+        "accessMode": {
+          "title": "Access mode",
+          "description": "Describes the read-write access control for the workspace relative to the owning resource instance.",
+          "type": "string",
+          "enum": [
+            "read-only",
+            "read-write",
+            "read-write-once",
+            "write-once",
+            "write-only"
+          ]
+        },
+        "mountPath": {
+          "title": "Mount path",
+          "description": "A path to a location on disk where the workspace will be available to the associated task's steps.",
+          "type": "string"
+        },
+        "managedDataType": {
+          "title": "Managed data type",
+          "description": "The name of a domain-specific data type the workspace represents.",
+          "$comment": "This property is for CI/CD frameworks that are able to provide access to structured, managed data at a more granular level than a filesystem.",
+          "examples": ["ConfigMap","Secret"],
+          "type": "string"
+        },
+        "volumeRequest": {
+          "title": "Volume request",
+          "description": "Identifies the reference to the request for a specific volume type and parameters.",
+          "examples": ["a kubernetes Persistent Volume Claim (PVC) name"],
+          "type": "string"
+        },
+        "volume": {
+          "title": "Volume",
+          "description": "Information about the actual volume instance allocated to the workspace.",
+          "$comment": "The actual volume allocated may be different than the request.",
+          "examples": ["see https://kubernetes.io/docs/concepts/storage/persistent-volumes/"],
+          "$ref": "#/definitions/volume"
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "volume": {
+      "title": "Volume",
+      "description": "An identifiable, logical unit of data storage tied to a physical device.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "uid": {
+          "title": "Unique Identifier (UID)",
+          "description": "The unique identifier for the volume instance within its deployment context.",
+          "type": "string"
+        },
+        "name": {
+          "title": "Name",
+          "description": "The name of the volume instance",
+          "type": "string"
+        },
+        "mode": {
+          "title": "Mode",
+          "description": "The mode for the volume instance.",
+          "type": "string",
+          "enum": [
+            "filesystem", "block"
+          ],
+          "default": "filesystem"
+        },
+        "path": {
+          "title": "Path",
+          "description": "The underlying path created from the actual volume.",
+          "type": "string"
+        },
+        "sizeAllocated": {
+          "title": "Size allocated",
+          "description": "The allocated size of the volume accessible to the associated workspace. This should include the scalar size as well as IEC standard unit in either decimal or binary form.",
+          "examples": ["10GB", "2Ti", "1Pi"],
+          "type": "string"
+        },
+        "persistent": {
+          "title": "Persistent",
+          "description": "Indicates if the volume persists beyond the life of the resource it is associated with.",
+          "type": "boolean"
+        },
+        "remote": {
+          "title": "Remote",
+          "description": "Indicates if the volume is remotely (i.e., network) attached.",
+          "type": "boolean"
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "trigger": {
+      "title": "Trigger",
+      "description": "Represents a resource that can conditionally activate (or fire) tasks based upon associated events and their data.",
+      "type": "object",
+      "additionalProperties": false,
+      "required": [
+        "type",
+        "bom-ref",
+        "uid"
+      ],
+      "properties": {
+        "bom-ref": {
+          "title": "BOM Reference",
+          "description": "An optional identifier which can be used to reference the trigger elsewhere in the BOM. Every bom-ref MUST be unique within the BOM.",
+          "$ref": "#/definitions/refType"
+        },
+        "uid": {
+          "title": "Unique Identifier (UID)",
+          "description": "The unique identifier for the resource instance within its deployment context.",
+          "type": "string"
+        },
+        "name": {
+          "title": "Name",
+          "description": "The name of the resource instance.",
+          "type": "string"
+        },
+        "description": {
+          "title": "Description",
+          "description": "A description of the resource instance.",
+          "type": "string"
+        },
+        "resourceReferences": {
+          "title": "Resource references",
+          "description": "References to component or service resources that are used to realize the resource instance.",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/resourceReferenceChoice"
+          }
+        },
+        "type": {
+          "title": "Type",
+          "description": "The source type of event which caused the trigger to fire.",
+          "type": "string",
+          "enum": [
+            "manual",
+            "api",
+            "webhook",
+            "scheduled"
+          ]
+        },
+        "event": {
+          "title": "Event",
+          "description": "The event data that caused the associated trigger to activate.",
+          "$ref": "#/definitions/event"
+        },
+        "conditions": {
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/condition"
+          }
+        },
+        "timeActivated": {
+          "title": "Time activated",
+          "description": "The date and time (timestamp) when the trigger was activated.",
+          "type": "string",
+          "format": "date-time"
+        },
+        "inputs": {
+          "title": "Inputs",
+          "description": "Represents resources and data brought into a task at runtime by executor or task commands",
+          "examples": ["a `configuration` file which was declared as a local `component` or `externalReference`"],
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/inputType"
+          },
+          "uniqueItems": true
+        },
+        "outputs": {
+          "title": "Outputs",
+          "description": "Represents resources and data output from a task at runtime by executor or task commands",
+          "examples": ["a log file or metrics data produced by the task"],
+          "type": "array",
+          "items": {
+            "$ref": "#/definitions/outputType"
+          },
+          "uniqueItems": true
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "event": {
+      "title": "Event",
+      "description": "Represents something that happened that may trigger a response.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "uid": {
+          "title": "Unique Identifier (UID)",
+          "description": "The unique identifier of the event.",
+          "type": "string"
+        },
+        "description": {
+          "title": "Description",
+          "description": "A description of the event.",
+          "type": "string"
+        },
+        "timeReceived": {
+          "title": "Time Received",
+          "description": "The date and time (timestamp) when the event was received.",
+          "type": "string",
+          "format": "date-time"
+        },
+        "data": {
+          "title": "Data",
+          "description": "Encoding of the raw event data.",
+          "$ref": "#/definitions/attachment"
+        },
+        "source": {
+          "title": "Source",
+          "description": "References the component or service that was the source of the event",
+          "$ref": "#/definitions/resourceReferenceChoice"
+        },
+        "target": {
+          "title": "Target",
+          "description": "References the component or service that was the target of the event",
+          "$ref": "#/definitions/resourceReferenceChoice"
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "inputType": {
+      "title": "Input type",
+      "description": "Type that represents various input data types and formats.",
+      "type": "object",
+      "oneOf": [
+        {
+          "required": [
+            "resource"
+          ]
+        },
+        {
+          "required": [
+            "parameters"
+          ]
+        },
+        {
+          "required": [
+            "environmentVars"
+          ]
+        },
+        {
+          "required": [
+            "data"
+          ]
+        }
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "source": {
+          "title": "Source",
+          "description": "A references to the component or service that provided the input to the task (e.g., reference to a service with data flow value of `inbound`)",
+          "examples": [
+            "source code repository",
+            "database"
+          ],
+          "$ref": "#/definitions/resourceReferenceChoice"
+        },
+        "target": {
+          "title": "Target",
+          "description": "A reference to the component or service that received or stored the input if not the task itself (e.g., a local, named storage workspace)",
+          "examples": [
+            "workspace",
+            "directory"
+          ],
+          "$ref": "#/definitions/resourceReferenceChoice"
+        },
+        "resource": {
+          "title": "Resource",
+          "description": "A reference to an independent resource provided as an input to a task by the workflow runtime.",
+          "examples": [
+            "reference to a configuration file in a repository (i.e., a bom-ref)",
+            "reference to a scanning service used in a task (i.e., a bom-ref)"
+          ],
+          "$ref": "#/definitions/resourceReferenceChoice"
+        },
+        "parameters": {
+          "title": "Parameters",
+          "description": "Inputs that have the form of parameters with names and values.",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "$ref": "#/definitions/parameter"
+          }
+        },
+        "environmentVars": {
+          "title": "Environment variables",
+          "description": "Inputs that have the form of parameters with names and values.",
+          "type": "array",
+          "uniqueItems": true,
+          "items": {
+            "oneOf": [
+              {
+                "$ref": "#/definitions/property"
+              },
+              {
+                "type": "string"
+              }
+            ]
+          }
+        },
+        "data": {
+          "title": "Data",
+          "description": "Inputs that have the form of data.",
+          "$ref": "#/definitions/attachment"
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "outputType": {
+      "type": "object",
+      "oneOf": [
+        {
+          "required": [
+            "resource"
+          ]
+        },
+        {
+          "required": [
+            "environmentVars"
+          ]
+        },
+        {
+          "required": [
+            "data"
+          ]
+        }
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "type": {
+          "title": "Type",
+          "description": "Describes the type of data output.",
+          "type": "string",
+          "enum": [
+            "artifact",
+            "attestation",
+            "log",
+            "evidence",
+            "metrics",
+            "other"
+          ]
+        },
+        "source": {
+          "title": "Source",
+          "description": "Component or service that generated or provided the output from the task (e.g., a build tool)",
+          "$ref": "#/definitions/resourceReferenceChoice"
+        },
+        "target": {
+          "title": "Target",
+          "description": "Component or service that received the output from the task (e.g., reference to an artifactory service with data flow value of `outbound`)",
+          "examples": ["a log file described as an `externalReference` within its target domain."],
+          "$ref": "#/definitions/resourceReferenceChoice"
+        },
+        "resource": {
+          "title": "Resource",
+          "description": "A reference to an independent resource generated as output by the task.",
+          "examples": [
+            "configuration file",
+            "source code",
+            "scanning service"
+          ],
+          "$ref": "#/definitions/resourceReferenceChoice"
+        },
+        "data": {
+          "title": "Data",
+          "description": "Outputs that have the form of data.",
+          "$ref": "#/definitions/attachment"
+        },
+        "environmentVars": {
+          "title": "Environment variables",
+          "description": "Outputs that have the form of environment variables.",
+          "type": "array",
+          "items": {
+            "oneOf": [
+              {
+                "$ref": "#/definitions/property"
+              },
+              {
+                "type": "string"
+              }
+            ]
+          },
+          "uniqueItems": true
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "resourceReferenceChoice": {
+      "title": "Resource reference choice",
+      "description": "A reference to a locally defined resource (e.g., a bom-ref) or an externally accessible resource.",
+      "$comment": "Enables reference to a resource that participates in a workflow; using either internal (bom-ref) or external (externalReference) types.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "ref": {
+          "title": "BOM Reference",
+          "description": "References an object by its bom-ref attribute",
+          "anyOf": [
+            {
+              "title": "Ref",
+              "$ref": "#/definitions/refLinkType"
+            },
+            {
+              "title": "BOM-Link Element",
+              "$ref": "#/definitions/bomLinkElementType"
+            }
+          ]
+        },
+        "externalReference": {
+          "title": "External reference",
+          "description": "Reference to an externally accessible resource.",
+          "$ref": "#/definitions/externalReference"
+        }
+      },
+      "oneOf": [
+        {
+          "required": [
+            "ref"
+          ]
+        },
+        {
+          "required": [
+            "externalReference"
+          ]
+        }
+      ]
+    },
+    "condition": {
+      "title": "Condition",
+      "description": "A condition that was used to determine a trigger should be activated.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "description": {
+          "title": "Description",
+          "description": "Describes the set of conditions which cause the trigger to activate.",
+          "type": "string"
+        },
+        "expression": {
+          "title": "Expression",
+          "description": "The logical expression that was evaluated that determined the trigger should be fired.",
+          "type": "string"
+        },
+        "properties": {
+          "type": "array",
+          "title": "Properties",
+          "items": {
+            "$ref": "#/definitions/property"
+          }
+        }
+      }
+    },
+    "taskType": {
+      "type": "string",
+      "enum": [
+        "copy",
+        "clone",
+        "lint",
+        "scan",
+        "merge",
+        "build",
+        "test",
+        "deliver",
+        "deploy",
+        "release",
+        "clean",
+        "other"
+      ]
+    },
+    "parameter": {
+      "title": "Parameter",
+      "description": "A representation of a functional parameter.",
+      "type": "object",
+      "additionalProperties": false,
+      "properties": {
+        "name": {
+          "title": "Name",
+          "description": "The name of the parameter.",
+          "type": "string"
+        },
+        "value": {
+          "title": "Value",
+          "description": "The value of the parameter.",
+          "type": "string"
+        },
+        "dataType": {
+          "title": "Data type",
+          "description": "The data type of the parameter.",
+          "type": "string"
+        }
+      }
+    },
+    "signature": {
+      "$ref": "jsf-0.82.schema.json#/definitions/signature",
+      "title": "Signature",
+      "description": "Enveloped signature in [JSON Signature Format (JSF)](https://cyberphone.github.io/doc/security/jsf.html)."
+    }
+  }
+}
diff --git a/deps/npm/test/schemas/cyclonedx/jsf-0.82.schema.json b/deps/npm/test/schemas/cyclonedx/jsf-0.82.schema.json
new file mode 100644
index 00000000000000..f46bfb1e52731a
--- /dev/null
+++ b/deps/npm/test/schemas/cyclonedx/jsf-0.82.schema.json
@@ -0,0 +1,240 @@
+{
+  "$schema": "http://json-schema.org/draft-07/schema#",
+  "$id": "http://cyclonedx.org/schema/jsf-0.82.schema.json",
+  "type": "object",
+  "title": "JSON Signature Format (JSF) standard",
+  "$comment" : "JSON Signature Format schema is published under the terms of the Apache License 2.0. JSF was developed by Anders Rundgren (anders.rundgren.net@gmail.com) as a part of the OpenKeyStore project. This schema supports the entirely of the JSF standard excluding 'extensions'.",
+  "definitions": {
+    "signature": {
+      "type": "object",
+      "title": "Signature",
+      "oneOf": [
+        {
+          "additionalProperties": false,
+          "properties": {
+            "signers": {
+              "type": "array",
+              "title": "Signature",
+              "description": "Unique top level property for Multiple Signatures. (multisignature)",
+              "items": {"$ref": "#/definitions/signer"}
+            }
+          }
+        },
+        {
+          "additionalProperties": false,
+          "properties": {
+            "chain": {
+              "type": "array",
+              "title": "Signature",
+              "description": "Unique top level property for Signature Chains. (signaturechain)",
+              "items": {"$ref": "#/definitions/signer"}
+            }
+          }
+        },
+        {
+          "title": "Signature",
+          "description": "Unique top level property for simple signatures. (signaturecore)",
+          "$ref": "#/definitions/signer"
+        }
+      ]
+    },
+    "signer": {
+      "type": "object",
+      "title": "Signature",
+      "required": [
+        "algorithm",
+        "value"
+      ],
+      "additionalProperties": false,
+      "properties": {
+        "algorithm": {
+          "oneOf": [
+            {
+              "type": "string",
+              "title": "Algorithm",
+              "description": "Signature algorithm. The currently recognized JWA [RFC7518] and RFC8037 [RFC8037] asymmetric key algorithms. Note: Unlike RFC8037 [RFC8037] JSF requires explicit Ed* algorithm names instead of \"EdDSA\".",
+              "enum": [
+                "RS256",
+                "RS384",
+                "RS512",
+                "PS256",
+                "PS384",
+                "PS512",
+                "ES256",
+                "ES384",
+                "ES512",
+                "Ed25519",
+                "Ed448",
+                "HS256",
+                "HS384",
+                "HS512"
+              ]
+            },
+            {
+              "type": "string",
+              "title": "Algorithm",
+              "description": "Signature algorithm. Note: If proprietary signature algorithms are added, they must be expressed as URIs.",
+              "format": "uri"
+            }
+          ]
+        },
+        "keyId": {
+          "type": "string",
+          "title": "Key ID",
+          "description": "Optional. Application specific string identifying the signature key."
+        },
+        "publicKey": {
+          "title": "Public key",
+          "description": "Optional. Public key object.",
+          "$ref": "#/definitions/publicKey"
+        },
+        "certificatePath": {
+          "type": "array",
+          "title": "Certificate path",
+          "description": "Optional. Sorted array of X.509 [RFC5280] certificates, where the first element must contain the signature certificate. The certificate path must be contiguous but is not required to be complete.",
+          "items": {
+            "type": "string"
+          }
+        },
+        "excludes": {
+          "type": "array",
+          "title": "Excludes",
+          "description": "Optional. Array holding the names of one or more application level properties that must be excluded from the signature process. Note that the \"excludes\" property itself, must also be excluded from the signature process. Since both the \"excludes\" property and the associated data it points to are unsigned, a conforming JSF implementation must provide options for specifying which properties to accept.",
+          "items": {
+            "type": "string"
+          }
+        },
+        "value": {
+          "type": "string",
+          "title": "Signature",
+          "description": "The signature data. Note that the binary representation must follow the JWA [RFC7518] specifications."
+        }
+      }
+    },
+    "keyType": {
+      "type": "string",
+      "title": "Key type",
+      "description": "Key type indicator.",
+      "enum": [
+        "EC",
+        "OKP",
+        "RSA"
+      ]
+    },
+    "publicKey": {
+      "title": "Public key",
+      "description": "Optional. Public key object.",
+      "type": "object",
+      "required": [
+        "kty"
+      ],
+      "additionalProperties": true,
+      "properties": {
+        "kty": {
+          "$ref": "#/definitions/keyType"
+        }
+      },
+      "allOf": [
+        {
+          "if": {
+            "properties": { "kty": { "const": "EC" } }
+          },
+          "then": {
+            "required": [
+              "kty",
+              "crv",
+              "x",
+              "y"
+            ],
+            "additionalProperties": false,
+            "properties": {
+              "kty": {
+                "$ref": "#/definitions/keyType"
+              },
+              "crv": {
+                "type": "string",
+                "title": "Curve name",
+                "description": "EC curve name.",
+                "enum": [
+                  "P-256",
+                  "P-384",
+                  "P-521"
+                ]
+              },
+              "x": {
+                "type": "string",
+                "title": "Coordinate",
+                "description": "EC curve point X. The length of this field must be the full size of a coordinate for the curve specified in the \"crv\" parameter. For example, if the value of \"crv\" is \"P-521\", the decoded argument must be 66 bytes."
+              },
+              "y": {
+                "type": "string",
+                "title": "Coordinate",
+                "description": "EC curve point Y. The length of this field must be the full size of a coordinate for the curve specified in the \"crv\" parameter. For example, if the value of \"crv\" is \"P-256\", the decoded argument must be 32 bytes."
+              }
+            }
+          }
+        },
+        {
+          "if": {
+            "properties": { "kty": { "const": "OKP" } }
+          },
+          "then": {
+            "required": [
+              "kty",
+              "crv",
+              "x"
+            ],
+            "additionalProperties": false,
+            "properties": {
+              "kty": {
+                "$ref": "#/definitions/keyType"
+              },
+              "crv": {
+                "type": "string",
+                "title": "Curve name",
+                "description": "EdDSA curve name.",
+                "enum": [
+                  "Ed25519",
+                  "Ed448"
+                ]
+              },
+              "x": {
+                "type": "string",
+                "title": "Coordinate",
+                "description": "EdDSA curve point X. The length of this field must be the full size of a coordinate for the curve specified in the \"crv\" parameter. For example, if the value of \"crv\" is \"Ed25519\", the decoded argument must be 32 bytes."
+              }
+            }
+          }
+        },
+        {
+          "if": {
+            "properties": { "kty": { "const": "RSA" } }
+          },
+          "then": {
+            "required": [
+              "kty",
+              "n",
+              "e"
+            ],
+            "additionalProperties": false,
+            "properties": {
+              "kty": {
+                "$ref": "#/definitions/keyType"
+              },
+              "n": {
+                "type": "string",
+                "title": "Modulus",
+                "description": "RSA modulus."
+              },
+              "e": {
+                "type": "string",
+                "title": "Exponent",
+                "description": "RSA exponent."
+              }
+            }
+          }
+        }
+      ]
+    }
+  }
+}
diff --git a/deps/npm/test/schemas/cyclonedx/spdx.schema.json b/deps/npm/test/schemas/cyclonedx/spdx.schema.json
new file mode 100644
index 00000000000000..f04d013c74c48d
--- /dev/null
+++ b/deps/npm/test/schemas/cyclonedx/spdx.schema.json
@@ -0,0 +1,621 @@
+{
+  "$schema": "http://json-schema.org/draft-07/schema#",
+  "$id": "http://cyclonedx.org/schema/spdx.schema.json",
+  "$comment": "v1.0-3.21",
+  "type": "string",
+  "enum": [
+    "0BSD",
+    "AAL",
+    "Abstyles",
+    "AdaCore-doc",
+    "Adobe-2006",
+    "Adobe-Glyph",
+    "ADSL",
+    "AFL-1.1",
+    "AFL-1.2",
+    "AFL-2.0",
+    "AFL-2.1",
+    "AFL-3.0",
+    "Afmparse",
+    "AGPL-1.0",
+    "AGPL-1.0-only",
+    "AGPL-1.0-or-later",
+    "AGPL-3.0",
+    "AGPL-3.0-only",
+    "AGPL-3.0-or-later",
+    "Aladdin",
+    "AMDPLPA",
+    "AML",
+    "AMPAS",
+    "ANTLR-PD",
+    "ANTLR-PD-fallback",
+    "Apache-1.0",
+    "Apache-1.1",
+    "Apache-2.0",
+    "APAFML",
+    "APL-1.0",
+    "App-s2p",
+    "APSL-1.0",
+    "APSL-1.1",
+    "APSL-1.2",
+    "APSL-2.0",
+    "Arphic-1999",
+    "Artistic-1.0",
+    "Artistic-1.0-cl8",
+    "Artistic-1.0-Perl",
+    "Artistic-2.0",
+    "ASWF-Digital-Assets-1.0",
+    "ASWF-Digital-Assets-1.1",
+    "Baekmuk",
+    "Bahyph",
+    "Barr",
+    "Beerware",
+    "Bitstream-Charter",
+    "Bitstream-Vera",
+    "BitTorrent-1.0",
+    "BitTorrent-1.1",
+    "blessing",
+    "BlueOak-1.0.0",
+    "Boehm-GC",
+    "Borceux",
+    "Brian-Gladman-3-Clause",
+    "BSD-1-Clause",
+    "BSD-2-Clause",
+    "BSD-2-Clause-FreeBSD",
+    "BSD-2-Clause-NetBSD",
+    "BSD-2-Clause-Patent",
+    "BSD-2-Clause-Views",
+    "BSD-3-Clause",
+    "BSD-3-Clause-Attribution",
+    "BSD-3-Clause-Clear",
+    "BSD-3-Clause-LBNL",
+    "BSD-3-Clause-Modification",
+    "BSD-3-Clause-No-Military-License",
+    "BSD-3-Clause-No-Nuclear-License",
+    "BSD-3-Clause-No-Nuclear-License-2014",
+    "BSD-3-Clause-No-Nuclear-Warranty",
+    "BSD-3-Clause-Open-MPI",
+    "BSD-4-Clause",
+    "BSD-4-Clause-Shortened",
+    "BSD-4-Clause-UC",
+    "BSD-4.3RENO",
+    "BSD-4.3TAHOE",
+    "BSD-Advertising-Acknowledgement",
+    "BSD-Attribution-HPND-disclaimer",
+    "BSD-Protection",
+    "BSD-Source-Code",
+    "BSL-1.0",
+    "BUSL-1.1",
+    "bzip2-1.0.5",
+    "bzip2-1.0.6",
+    "C-UDA-1.0",
+    "CAL-1.0",
+    "CAL-1.0-Combined-Work-Exception",
+    "Caldera",
+    "CATOSL-1.1",
+    "CC-BY-1.0",
+    "CC-BY-2.0",
+    "CC-BY-2.5",
+    "CC-BY-2.5-AU",
+    "CC-BY-3.0",
+    "CC-BY-3.0-AT",
+    "CC-BY-3.0-DE",
+    "CC-BY-3.0-IGO",
+    "CC-BY-3.0-NL",
+    "CC-BY-3.0-US",
+    "CC-BY-4.0",
+    "CC-BY-NC-1.0",
+    "CC-BY-NC-2.0",
+    "CC-BY-NC-2.5",
+    "CC-BY-NC-3.0",
+    "CC-BY-NC-3.0-DE",
+    "CC-BY-NC-4.0",
+    "CC-BY-NC-ND-1.0",
+    "CC-BY-NC-ND-2.0",
+    "CC-BY-NC-ND-2.5",
+    "CC-BY-NC-ND-3.0",
+    "CC-BY-NC-ND-3.0-DE",
+    "CC-BY-NC-ND-3.0-IGO",
+    "CC-BY-NC-ND-4.0",
+    "CC-BY-NC-SA-1.0",
+    "CC-BY-NC-SA-2.0",
+    "CC-BY-NC-SA-2.0-DE",
+    "CC-BY-NC-SA-2.0-FR",
+    "CC-BY-NC-SA-2.0-UK",
+    "CC-BY-NC-SA-2.5",
+    "CC-BY-NC-SA-3.0",
+    "CC-BY-NC-SA-3.0-DE",
+    "CC-BY-NC-SA-3.0-IGO",
+    "CC-BY-NC-SA-4.0",
+    "CC-BY-ND-1.0",
+    "CC-BY-ND-2.0",
+    "CC-BY-ND-2.5",
+    "CC-BY-ND-3.0",
+    "CC-BY-ND-3.0-DE",
+    "CC-BY-ND-4.0",
+    "CC-BY-SA-1.0",
+    "CC-BY-SA-2.0",
+    "CC-BY-SA-2.0-UK",
+    "CC-BY-SA-2.1-JP",
+    "CC-BY-SA-2.5",
+    "CC-BY-SA-3.0",
+    "CC-BY-SA-3.0-AT",
+    "CC-BY-SA-3.0-DE",
+    "CC-BY-SA-3.0-IGO",
+    "CC-BY-SA-4.0",
+    "CC-PDDC",
+    "CC0-1.0",
+    "CDDL-1.0",
+    "CDDL-1.1",
+    "CDL-1.0",
+    "CDLA-Permissive-1.0",
+    "CDLA-Permissive-2.0",
+    "CDLA-Sharing-1.0",
+    "CECILL-1.0",
+    "CECILL-1.1",
+    "CECILL-2.0",
+    "CECILL-2.1",
+    "CECILL-B",
+    "CECILL-C",
+    "CERN-OHL-1.1",
+    "CERN-OHL-1.2",
+    "CERN-OHL-P-2.0",
+    "CERN-OHL-S-2.0",
+    "CERN-OHL-W-2.0",
+    "CFITSIO",
+    "checkmk",
+    "ClArtistic",
+    "Clips",
+    "CMU-Mach",
+    "CNRI-Jython",
+    "CNRI-Python",
+    "CNRI-Python-GPL-Compatible",
+    "COIL-1.0",
+    "Community-Spec-1.0",
+    "Condor-1.1",
+    "copyleft-next-0.3.0",
+    "copyleft-next-0.3.1",
+    "Cornell-Lossless-JPEG",
+    "CPAL-1.0",
+    "CPL-1.0",
+    "CPOL-1.02",
+    "Crossword",
+    "CrystalStacker",
+    "CUA-OPL-1.0",
+    "Cube",
+    "curl",
+    "D-FSL-1.0",
+    "diffmark",
+    "DL-DE-BY-2.0",
+    "DOC",
+    "Dotseqn",
+    "DRL-1.0",
+    "DSDP",
+    "dtoa",
+    "dvipdfm",
+    "ECL-1.0",
+    "ECL-2.0",
+    "eCos-2.0",
+    "EFL-1.0",
+    "EFL-2.0",
+    "eGenix",
+    "Elastic-2.0",
+    "Entessa",
+    "EPICS",
+    "EPL-1.0",
+    "EPL-2.0",
+    "ErlPL-1.1",
+    "etalab-2.0",
+    "EUDatagrid",
+    "EUPL-1.0",
+    "EUPL-1.1",
+    "EUPL-1.2",
+    "Eurosym",
+    "Fair",
+    "FDK-AAC",
+    "Frameworx-1.0",
+    "FreeBSD-DOC",
+    "FreeImage",
+    "FSFAP",
+    "FSFUL",
+    "FSFULLR",
+    "FSFULLRWD",
+    "FTL",
+    "GD",
+    "GFDL-1.1",
+    "GFDL-1.1-invariants-only",
+    "GFDL-1.1-invariants-or-later",
+    "GFDL-1.1-no-invariants-only",
+    "GFDL-1.1-no-invariants-or-later",
+    "GFDL-1.1-only",
+    "GFDL-1.1-or-later",
+    "GFDL-1.2",
+    "GFDL-1.2-invariants-only",
+    "GFDL-1.2-invariants-or-later",
+    "GFDL-1.2-no-invariants-only",
+    "GFDL-1.2-no-invariants-or-later",
+    "GFDL-1.2-only",
+    "GFDL-1.2-or-later",
+    "GFDL-1.3",
+    "GFDL-1.3-invariants-only",
+    "GFDL-1.3-invariants-or-later",
+    "GFDL-1.3-no-invariants-only",
+    "GFDL-1.3-no-invariants-or-later",
+    "GFDL-1.3-only",
+    "GFDL-1.3-or-later",
+    "Giftware",
+    "GL2PS",
+    "Glide",
+    "Glulxe",
+    "GLWTPL",
+    "gnuplot",
+    "GPL-1.0",
+    "GPL-1.0+",
+    "GPL-1.0-only",
+    "GPL-1.0-or-later",
+    "GPL-2.0",
+    "GPL-2.0+",
+    "GPL-2.0-only",
+    "GPL-2.0-or-later",
+    "GPL-2.0-with-autoconf-exception",
+    "GPL-2.0-with-bison-exception",
+    "GPL-2.0-with-classpath-exception",
+    "GPL-2.0-with-font-exception",
+    "GPL-2.0-with-GCC-exception",
+    "GPL-3.0",
+    "GPL-3.0+",
+    "GPL-3.0-only",
+    "GPL-3.0-or-later",
+    "GPL-3.0-with-autoconf-exception",
+    "GPL-3.0-with-GCC-exception",
+    "Graphics-Gems",
+    "gSOAP-1.3b",
+    "HaskellReport",
+    "Hippocratic-2.1",
+    "HP-1986",
+    "HPND",
+    "HPND-export-US",
+    "HPND-Markus-Kuhn",
+    "HPND-sell-variant",
+    "HPND-sell-variant-MIT-disclaimer",
+    "HTMLTIDY",
+    "IBM-pibs",
+    "ICU",
+    "IEC-Code-Components-EULA",
+    "IJG",
+    "IJG-short",
+    "ImageMagick",
+    "iMatix",
+    "Imlib2",
+    "Info-ZIP",
+    "Inner-Net-2.0",
+    "Intel",
+    "Intel-ACPI",
+    "Interbase-1.0",
+    "IPA",
+    "IPL-1.0",
+    "ISC",
+    "Jam",
+    "JasPer-2.0",
+    "JPL-image",
+    "JPNIC",
+    "JSON",
+    "Kazlib",
+    "Knuth-CTAN",
+    "LAL-1.2",
+    "LAL-1.3",
+    "Latex2e",
+    "Latex2e-translated-notice",
+    "Leptonica",
+    "LGPL-2.0",
+    "LGPL-2.0+",
+    "LGPL-2.0-only",
+    "LGPL-2.0-or-later",
+    "LGPL-2.1",
+    "LGPL-2.1+",
+    "LGPL-2.1-only",
+    "LGPL-2.1-or-later",
+    "LGPL-3.0",
+    "LGPL-3.0+",
+    "LGPL-3.0-only",
+    "LGPL-3.0-or-later",
+    "LGPLLR",
+    "Libpng",
+    "libpng-2.0",
+    "libselinux-1.0",
+    "libtiff",
+    "libutil-David-Nugent",
+    "LiLiQ-P-1.1",
+    "LiLiQ-R-1.1",
+    "LiLiQ-Rplus-1.1",
+    "Linux-man-pages-1-para",
+    "Linux-man-pages-copyleft",
+    "Linux-man-pages-copyleft-2-para",
+    "Linux-man-pages-copyleft-var",
+    "Linux-OpenIB",
+    "LOOP",
+    "LPL-1.0",
+    "LPL-1.02",
+    "LPPL-1.0",
+    "LPPL-1.1",
+    "LPPL-1.2",
+    "LPPL-1.3a",
+    "LPPL-1.3c",
+    "LZMA-SDK-9.11-to-9.20",
+    "LZMA-SDK-9.22",
+    "MakeIndex",
+    "Martin-Birgmeier",
+    "metamail",
+    "Minpack",
+    "MirOS",
+    "MIT",
+    "MIT-0",
+    "MIT-advertising",
+    "MIT-CMU",
+    "MIT-enna",
+    "MIT-feh",
+    "MIT-Festival",
+    "MIT-Modern-Variant",
+    "MIT-open-group",
+    "MIT-Wu",
+    "MITNFA",
+    "Motosoto",
+    "mpi-permissive",
+    "mpich2",
+    "MPL-1.0",
+    "MPL-1.1",
+    "MPL-2.0",
+    "MPL-2.0-no-copyleft-exception",
+    "mplus",
+    "MS-LPL",
+    "MS-PL",
+    "MS-RL",
+    "MTLL",
+    "MulanPSL-1.0",
+    "MulanPSL-2.0",
+    "Multics",
+    "Mup",
+    "NAIST-2003",
+    "NASA-1.3",
+    "Naumen",
+    "NBPL-1.0",
+    "NCGL-UK-2.0",
+    "NCSA",
+    "Net-SNMP",
+    "NetCDF",
+    "Newsletr",
+    "NGPL",
+    "NICTA-1.0",
+    "NIST-PD",
+    "NIST-PD-fallback",
+    "NIST-Software",
+    "NLOD-1.0",
+    "NLOD-2.0",
+    "NLPL",
+    "Nokia",
+    "NOSL",
+    "Noweb",
+    "NPL-1.0",
+    "NPL-1.1",
+    "NPOSL-3.0",
+    "NRL",
+    "NTP",
+    "NTP-0",
+    "Nunit",
+    "O-UDA-1.0",
+    "OCCT-PL",
+    "OCLC-2.0",
+    "ODbL-1.0",
+    "ODC-By-1.0",
+    "OFFIS",
+    "OFL-1.0",
+    "OFL-1.0-no-RFN",
+    "OFL-1.0-RFN",
+    "OFL-1.1",
+    "OFL-1.1-no-RFN",
+    "OFL-1.1-RFN",
+    "OGC-1.0",
+    "OGDL-Taiwan-1.0",
+    "OGL-Canada-2.0",
+    "OGL-UK-1.0",
+    "OGL-UK-2.0",
+    "OGL-UK-3.0",
+    "OGTSL",
+    "OLDAP-1.1",
+    "OLDAP-1.2",
+    "OLDAP-1.3",
+    "OLDAP-1.4",
+    "OLDAP-2.0",
+    "OLDAP-2.0.1",
+    "OLDAP-2.1",
+    "OLDAP-2.2",
+    "OLDAP-2.2.1",
+    "OLDAP-2.2.2",
+    "OLDAP-2.3",
+    "OLDAP-2.4",
+    "OLDAP-2.5",
+    "OLDAP-2.6",
+    "OLDAP-2.7",
+    "OLDAP-2.8",
+    "OLFL-1.3",
+    "OML",
+    "OpenPBS-2.3",
+    "OpenSSL",
+    "OPL-1.0",
+    "OPL-UK-3.0",
+    "OPUBL-1.0",
+    "OSET-PL-2.1",
+    "OSL-1.0",
+    "OSL-1.1",
+    "OSL-2.0",
+    "OSL-2.1",
+    "OSL-3.0",
+    "Parity-6.0.0",
+    "Parity-7.0.0",
+    "PDDL-1.0",
+    "PHP-3.0",
+    "PHP-3.01",
+    "Plexus",
+    "PolyForm-Noncommercial-1.0.0",
+    "PolyForm-Small-Business-1.0.0",
+    "PostgreSQL",
+    "PSF-2.0",
+    "psfrag",
+    "psutils",
+    "Python-2.0",
+    "Python-2.0.1",
+    "Qhull",
+    "QPL-1.0",
+    "QPL-1.0-INRIA-2004",
+    "Rdisc",
+    "RHeCos-1.1",
+    "RPL-1.1",
+    "RPL-1.5",
+    "RPSL-1.0",
+    "RSA-MD",
+    "RSCPL",
+    "Ruby",
+    "SAX-PD",
+    "Saxpath",
+    "SCEA",
+    "SchemeReport",
+    "Sendmail",
+    "Sendmail-8.23",
+    "SGI-B-1.0",
+    "SGI-B-1.1",
+    "SGI-B-2.0",
+    "SGP4",
+    "SHL-0.5",
+    "SHL-0.51",
+    "SimPL-2.0",
+    "SISSL",
+    "SISSL-1.2",
+    "Sleepycat",
+    "SMLNJ",
+    "SMPPL",
+    "SNIA",
+    "snprintf",
+    "Spencer-86",
+    "Spencer-94",
+    "Spencer-99",
+    "SPL-1.0",
+    "SSH-OpenSSH",
+    "SSH-short",
+    "SSPL-1.0",
+    "StandardML-NJ",
+    "SugarCRM-1.1.3",
+    "SunPro",
+    "SWL",
+    "Symlinks",
+    "TAPR-OHL-1.0",
+    "TCL",
+    "TCP-wrappers",
+    "TermReadKey",
+    "TMate",
+    "TORQUE-1.1",
+    "TOSL",
+    "TPDL",
+    "TPL-1.0",
+    "TTWL",
+    "TU-Berlin-1.0",
+    "TU-Berlin-2.0",
+    "UCAR",
+    "UCL-1.0",
+    "Unicode-DFS-2015",
+    "Unicode-DFS-2016",
+    "Unicode-TOU",
+    "UnixCrypt",
+    "Unlicense",
+    "UPL-1.0",
+    "Vim",
+    "VOSTROM",
+    "VSL-1.0",
+    "W3C",
+    "W3C-19980720",
+    "W3C-20150513",
+    "w3m",
+    "Watcom-1.0",
+    "Widget-Workshop",
+    "Wsuipa",
+    "WTFPL",
+    "wxWindows",
+    "X11",
+    "X11-distribute-modifications-variant",
+    "Xdebug-1.03",
+    "Xerox",
+    "Xfig",
+    "XFree86-1.1",
+    "xinetd",
+    "xlock",
+    "Xnet",
+    "xpp",
+    "XSkat",
+    "YPL-1.0",
+    "YPL-1.1",
+    "Zed",
+    "Zend-2.0",
+    "Zimbra-1.3",
+    "Zimbra-1.4",
+    "Zlib",
+    "zlib-acknowledgement",
+    "ZPL-1.1",
+    "ZPL-2.0",
+    "ZPL-2.1",
+    "389-exception",
+    "Asterisk-exception",
+    "Autoconf-exception-2.0",
+    "Autoconf-exception-3.0",
+    "Autoconf-exception-generic",
+    "Autoconf-exception-macro",
+    "Bison-exception-2.2",
+    "Bootloader-exception",
+    "Classpath-exception-2.0",
+    "CLISP-exception-2.0",
+    "cryptsetup-OpenSSL-exception",
+    "DigiRule-FOSS-exception",
+    "eCos-exception-2.0",
+    "Fawkes-Runtime-exception",
+    "FLTK-exception",
+    "Font-exception-2.0",
+    "freertos-exception-2.0",
+    "GCC-exception-2.0",
+    "GCC-exception-3.1",
+    "GNAT-exception",
+    "gnu-javamail-exception",
+    "GPL-3.0-interface-exception",
+    "GPL-3.0-linking-exception",
+    "GPL-3.0-linking-source-exception",
+    "GPL-CC-1.0",
+    "GStreamer-exception-2005",
+    "GStreamer-exception-2008",
+    "i2p-gpl-java-exception",
+    "KiCad-libraries-exception",
+    "LGPL-3.0-linking-exception",
+    "libpri-OpenH323-exception",
+    "Libtool-exception",
+    "Linux-syscall-note",
+    "LLGPL",
+    "LLVM-exception",
+    "LZMA-exception",
+    "mif-exception",
+    "Nokia-Qt-exception-1.1",
+    "OCaml-LGPL-linking-exception",
+    "OCCT-exception-1.0",
+    "OpenJDK-assembly-exception-1.0",
+    "openvpn-openssl-exception",
+    "PS-or-PDF-font-exception-20170817",
+    "QPL-1.0-INRIA-2004-exception",
+    "Qt-GPL-exception-1.0",
+    "Qt-LGPL-exception-1.1",
+    "Qwt-exception-1.0",
+    "SHL-2.0",
+    "SHL-2.1",
+    "SWI-exception",
+    "Swift-exception",
+    "u-boot-exception-2.0",
+    "Universal-FOSS-exception-1.0",
+    "vsftpd-openssl-exception",
+    "WxWindows-exception-3.1",
+    "x11vnc-openssl-exception"
+  ]
+}
diff --git a/deps/npm/test/schemas/spdx/spdx-2.3.schema.json b/deps/npm/test/schemas/spdx/spdx-2.3.schema.json
new file mode 100644
index 00000000000000..ee61e6686e885f
--- /dev/null
+++ b/deps/npm/test/schemas/spdx/spdx-2.3.schema.json
@@ -0,0 +1,740 @@
+{
+  "$schema" : "http://json-schema.org/draft-07/schema#",
+  "$id" : "http://spdx.org/rdf/terms/2.3",
+  "title" : "SPDX 2.3",
+  "type" : "object",
+  "properties" : {
+    "SPDXID" : {
+      "type" : "string",
+      "description" : "Uniquely identify any element in an SPDX document which may be referenced by other elements."
+    },
+    "annotations" : {
+      "description" : "Provide additional information about an SpdxElement.",
+      "type" : "array",
+      "items" : {
+        "type" : "object",
+        "properties" : {
+          "annotationDate" : {
+            "description" : "Identify when the comment was made. This is to be specified according to the combined date and time in the UTC format, as specified in the ISO 8601 standard.",
+            "type" : "string"
+          },
+          "annotationType" : {
+            "description" : "Type of the annotation.",
+            "type" : "string",
+            "enum" : [ "OTHER", "REVIEW" ]
+          },
+          "annotator" : {
+            "description" : "This field identifies the person, organization, or tool that has commented on a file, package, snippet, or the entire document.",
+            "type" : "string"
+          },
+          "comment" : {
+            "type" : "string"
+          }
+        },
+        "required" : [ "annotationDate", "annotationType", "annotator", "comment" ],
+        "additionalProperties" : false,
+        "description" : "An Annotation is a comment on an SpdxItem by an agent."
+      }
+    },
+    "comment" : {
+      "type" : "string"
+    },
+    "creationInfo" : {
+      "type" : "object",
+      "properties" : {
+        "comment" : {
+          "type" : "string"
+        },
+        "created" : {
+          "description" : "Identify when the SPDX document was originally created. The date is to be specified according to combined date and time in UTC format as specified in ISO 8601 standard.",
+          "type" : "string"
+        },
+        "creators" : {
+          "description" : "Identify who (or what, in the case of a tool) created the SPDX document. If the SPDX document was created by an individual, indicate the person's name. If the SPDX document was created on behalf of a company or organization, indicate the entity name. If the SPDX document was created using a software tool, indicate the name and version for that tool. If multiple participants or tools were involved, use multiple instances of this field. Person name or organization name may be designated as “anonymous” if appropriate.",
+          "minItems" : 1,
+          "type" : "array",
+          "items" : {
+            "description" : "Identify who (or what, in the case of a tool) created the SPDX document. If the SPDX document was created by an individual, indicate the person's name. If the SPDX document was created on behalf of a company or organization, indicate the entity name. If the SPDX document was created using a software tool, indicate the name and version for that tool. If multiple participants or tools were involved, use multiple instances of this field. Person name or organization name may be designated as “anonymous” if appropriate.",
+            "type" : "string"
+          }
+        },
+        "licenseListVersion" : {
+          "description" : "An optional field for creators of the SPDX file to provide the version of the SPDX License List used when the SPDX file was created.",
+          "type" : "string"
+        }
+      },
+      "required" : [ "created", "creators" ],
+      "additionalProperties" : false,
+      "description" : "One instance is required for each SPDX file produced. It provides the necessary information for forward and backward compatibility for processing tools."
+    },
+    "dataLicense" : {
+      "description" : "License expression for dataLicense. See SPDX Annex D for the license expression syntax.  Compliance with the SPDX specification includes populating the SPDX fields therein with data related to such fields (\"SPDX-Metadata\"). The SPDX specification contains numerous fields where an SPDX document creator may provide relevant explanatory text in SPDX-Metadata. Without opining on the lawfulness of \"database rights\" (in jurisdictions where applicable), such explanatory text is copyrightable subject matter in most Berne Convention countries. By using the SPDX specification, or any portion hereof, you hereby agree that any copyright rights (as determined by your jurisdiction) in any SPDX-Metadata, including without limitation explanatory text, shall be subject to the terms of the Creative Commons CC0 1.0 Universal license. For SPDX-Metadata not containing any copyright rights, you hereby agree and acknowledge that the SPDX-Metadata is provided to you \"as-is\" and without any representations or warranties of any kind concerning the SPDX-Metadata, express, implied, statutory or otherwise, including without limitation warranties of title, merchantability, fitness for a particular purpose, non-infringement, or the absence of latent or other defects, accuracy, or the presence or absence of errors, whether or not discoverable, all to the greatest extent permissible under applicable law.",
+      "type" : "string"
+    },
+    "externalDocumentRefs" : {
+      "description" : "Identify any external SPDX documents referenced within this SPDX document.",
+      "type" : "array",
+      "items" : {
+        "type" : "object",
+        "properties" : {
+          "checksum" : {
+            "type" : "object",
+            "properties" : {
+              "algorithm" : {
+                "description" : "Identifies the algorithm used to produce the subject Checksum. Currently, SHA-1 is the only supported algorithm. It is anticipated that other algorithms will be supported at a later time.",
+                "type" : "string",
+                "enum" : [ "SHA1", "BLAKE3", "SHA3-384", "SHA256", "SHA384", "BLAKE2b-512", "BLAKE2b-256", "SHA3-512", "MD2", "ADLER32", "MD4", "SHA3-256", "BLAKE2b-384", "SHA512", "MD6", "MD5", "SHA224" ]
+              },
+              "checksumValue" : {
+                "description" : "The checksumValue property provides a lower case hexidecimal encoded digest value produced using a specific algorithm.",
+                "type" : "string"
+              }
+            },
+            "required" : [ "algorithm", "checksumValue" ],
+            "additionalProperties" : false,
+            "description" : "A Checksum is value that allows the contents of a file to be authenticated. Even small changes to the content of the file will change its checksum. This class allows the results of a variety of checksum and cryptographic message digest algorithms to be represented."
+          },
+          "externalDocumentId" : {
+            "description" : "externalDocumentId is a string containing letters, numbers, ., - and/or + which uniquely identifies an external document within this document.",
+            "type" : "string"
+          },
+          "spdxDocument" : {
+            "description" : "SPDX ID for SpdxDocument.  A property containing an SPDX document.",
+            "type" : "string"
+          }
+        },
+        "required" : [ "checksum", "externalDocumentId", "spdxDocument" ],
+        "additionalProperties" : false,
+        "description" : "Information about an external SPDX document reference including the checksum. This allows for verification of the external references."
+      }
+    },
+    "hasExtractedLicensingInfos" : {
+      "description" : "Indicates that a particular ExtractedLicensingInfo was defined in the subject SpdxDocument.",
+      "type" : "array",
+      "items" : {
+        "type" : "object",
+        "properties" : {
+          "comment" : {
+            "type" : "string"
+          },
+          "crossRefs" : {
+            "description" : "Cross Reference Detail for a license SeeAlso URL",
+            "type" : "array",
+            "items" : {
+              "type" : "object",
+              "properties" : {
+                "isLive" : {
+                  "description" : "Indicate a URL is still a live accessible location on the public internet",
+                  "type" : "boolean"
+                },
+                "isValid" : {
+                  "description" : "True if the URL is a valid well formed URL",
+                  "type" : "boolean"
+                },
+                "isWayBackLink" : {
+                  "description" : "True if the License SeeAlso URL points to a Wayback archive",
+                  "type" : "boolean"
+                },
+                "match" : {
+                  "description" : "Status of a License List SeeAlso URL reference if it refers to a website that matches the license text.",
+                  "type" : "string"
+                },
+                "order" : {
+                  "description" : "The ordinal order of this element within a list",
+                  "type" : "integer"
+                },
+                "timestamp" : {
+                  "description" : "Timestamp",
+                  "type" : "string"
+                },
+                "url" : {
+                  "description" : "URL Reference",
+                  "type" : "string"
+                }
+              },
+              "required" : [ "url" ],
+              "additionalProperties" : false,
+              "description" : "Cross reference details for the a URL reference"
+            }
+          },
+          "extractedText" : {
+            "description" : "Provide a copy of the actual text of the license reference extracted from the package, file or snippet that is associated with the License Identifier to aid in future analysis.",
+            "type" : "string"
+          },
+          "licenseId" : {
+            "description" : "A human readable short form license identifier for a license. The license ID is either on the standard license list or the form \"LicenseRef-[idString]\" where [idString] is a unique string containing letters, numbers, \".\" or \"-\".  When used within a license expression, the license ID can optionally include a reference to an external document in the form \"DocumentRef-[docrefIdString]:LicenseRef-[idString]\" where docRefIdString is an ID for an external document reference.",
+            "type" : "string"
+          },
+          "name" : {
+            "description" : "Identify name of this SpdxElement.",
+            "type" : "string"
+          },
+          "seeAlsos" : {
+            "type" : "array",
+            "items" : {
+              "type" : "string"
+            }
+          }
+        },
+        "required" : [ "extractedText", "licenseId" ],
+        "additionalProperties" : false,
+        "description" : "An ExtractedLicensingInfo represents a license or licensing notice that was found in a package, file or snippet. Any license text that is recognized as a license may be represented as a License rather than an ExtractedLicensingInfo."
+      }
+    },
+    "name" : {
+      "description" : "Identify name of this SpdxElement.",
+      "type" : "string"
+    },
+    "revieweds" : {
+      "description" : "Reviewed",
+      "type" : "array",
+      "items" : {
+        "type" : "object",
+        "properties" : {
+          "comment" : {
+            "type" : "string"
+          },
+          "reviewDate" : {
+            "description" : "The date and time at which the SpdxDocument was reviewed. This value must be in UTC and have 'Z' as its timezone indicator.",
+            "type" : "string"
+          },
+          "reviewer" : {
+            "description" : "The name and, optionally, contact information of the person who performed the review. Values of this property must conform to the agent and tool syntax.  The reviewer property is deprecated in favor of Annotation with an annotationType review.",
+            "type" : "string"
+          }
+        },
+        "required" : [ "reviewDate" ],
+        "additionalProperties" : false,
+        "description" : "This class has been deprecated in favor of an Annotation with an Annotation type of review."
+      }
+    },
+    "spdxVersion" : {
+      "description" : "Provide a reference number that can be used to understand how to parse and interpret the rest of the file. It will enable both future changes to the specification and to support backward compatibility. The version number consists of a major and minor version indicator. The major field will be incremented when incompatible changes between versions are made (one or more sections are created, modified or deleted). The minor field will be incremented when backwards compatible changes are made.",
+      "type" : "string"
+    },
+    "documentNamespace" : {
+      "type" : "string",
+      "description" : "The URI provides an unambiguous mechanism for other SPDX documents to reference SPDX elements within this SPDX document."
+    },
+    "documentDescribes" : {
+      "description" : "Packages, files and/or Snippets described by this SPDX document",
+      "type" : "array",
+      "items" : {
+        "type" : "string",
+        "description" : "SPDX ID for each Package, File, or Snippet."
+      }
+    },
+    "packages" : {
+      "description" : "Packages referenced in the SPDX document",
+      "type" : "array",
+      "items" : {
+        "type" : "object",
+        "properties" : {
+          "SPDXID" : {
+            "type" : "string",
+            "description" : "Uniquely identify any element in an SPDX document which may be referenced by other elements."
+          },
+          "annotations" : {
+            "description" : "Provide additional information about an SpdxElement.",
+            "type" : "array",
+            "items" : {
+              "type" : "object",
+              "properties" : {
+                "annotationDate" : {
+                  "description" : "Identify when the comment was made. This is to be specified according to the combined date and time in the UTC format, as specified in the ISO 8601 standard.",
+                  "type" : "string"
+                },
+                "annotationType" : {
+                  "description" : "Type of the annotation.",
+                  "type" : "string",
+                  "enum" : [ "OTHER", "REVIEW" ]
+                },
+                "annotator" : {
+                  "description" : "This field identifies the person, organization, or tool that has commented on a file, package, snippet, or the entire document.",
+                  "type" : "string"
+                },
+                "comment" : {
+                  "type" : "string"
+                }
+              },
+              "required" : [ "annotationDate", "annotationType", "annotator", "comment" ],
+              "additionalProperties" : false,
+              "description" : "An Annotation is a comment on an SpdxItem by an agent."
+            }
+          },
+          "attributionTexts" : {
+            "description" : "This field provides a place for the SPDX data creator to record acknowledgements that may be required to be communicated in some contexts. This is not meant to include the actual complete license text (see licenseConculded and licenseDeclared), and may or may not include copyright notices (see also copyrightText). The SPDX data creator may use this field to record other acknowledgements, such as particular clauses from license texts, which may be necessary or desirable to reproduce.",
+            "type" : "array",
+            "items" : {
+              "description" : "This field provides a place for the SPDX data creator to record acknowledgements that may be required to be communicated in some contexts. This is not meant to include the actual complete license text (see licenseConculded and licenseDeclared), and may or may not include copyright notices (see also copyrightText). The SPDX data creator may use this field to record other acknowledgements, such as particular clauses from license texts, which may be necessary or desirable to reproduce.",
+              "type" : "string"
+            }
+          },
+          "builtDate" : {
+            "description" : "This field provides a place for recording the actual date the package was built.",
+            "type" : "string"
+          },
+          "checksums" : {
+            "description" : "The checksum property provides a mechanism that can be used to verify that the contents of a File or Package have not changed.",
+            "type" : "array",
+            "items" : {
+              "type" : "object",
+              "properties" : {
+                "algorithm" : {
+                  "description" : "Identifies the algorithm used to produce the subject Checksum. Currently, SHA-1 is the only supported algorithm. It is anticipated that other algorithms will be supported at a later time.",
+                  "type" : "string",
+                  "enum" : [ "SHA1", "BLAKE3", "SHA3-384", "SHA256", "SHA384", "BLAKE2b-512", "BLAKE2b-256", "SHA3-512", "MD2", "ADLER32", "MD4", "SHA3-256", "BLAKE2b-384", "SHA512", "MD6", "MD5", "SHA224" ]
+                },
+                "checksumValue" : {
+                  "description" : "The checksumValue property provides a lower case hexidecimal encoded digest value produced using a specific algorithm.",
+                  "type" : "string"
+                }
+              },
+              "required" : [ "algorithm", "checksumValue" ],
+              "additionalProperties" : false,
+              "description" : "A Checksum is value that allows the contents of a file to be authenticated. Even small changes to the content of the file will change its checksum. This class allows the results of a variety of checksum and cryptographic message digest algorithms to be represented."
+            }
+          },
+          "comment" : {
+            "type" : "string"
+          },
+          "copyrightText" : {
+            "description" : "The text of copyright declarations recited in the package, file or snippet.\n\nIf the copyrightText field is not present, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "string"
+          },
+          "description" : {
+            "description" : "Provides a detailed description of the package.",
+            "type" : "string"
+          },
+          "downloadLocation" : {
+            "description" : "The URI at which this package is available for download. Private (i.e., not publicly reachable) URIs are acceptable as values of this property. The values http://spdx.org/rdf/terms#none and http://spdx.org/rdf/terms#noassertion may be used to specify that the package is not downloadable or that no attempt was made to determine its download location, respectively.",
+            "type" : "string"
+          },
+          "externalRefs" : {
+            "description" : "An External Reference allows a Package to reference an external source of additional information, metadata, enumerations, asset identifiers, or downloadable content believed to be relevant to the Package.",
+            "type" : "array",
+            "items" : {
+              "type" : "object",
+              "properties" : {
+                "comment" : {
+                  "type" : "string"
+                },
+                "referenceCategory" : {
+                  "description" : "Category for the external reference",
+                  "type" : "string",
+                  "enum" : [ "OTHER", "PERSISTENT-ID", "SECURITY", "PACKAGE-MANAGER" ]
+                },
+                "referenceLocator" : {
+                  "description" : "The unique string with no spaces necessary to access the package-specific information, metadata, or content within the target location. The format of the locator is subject to constraints defined by the <type>.",
+                  "type" : "string"
+                },
+                "referenceType" : {
+                  "description" : "Type of the external reference. These are definined in an appendix in the SPDX specification.",
+                  "type" : "string"
+                }
+              },
+              "required" : [ "referenceCategory", "referenceLocator", "referenceType" ],
+              "additionalProperties" : false,
+              "description" : "An External Reference allows a Package to reference an external source of additional information, metadata, enumerations, asset identifiers, or downloadable content believed to be relevant to the Package."
+            }
+          },
+          "filesAnalyzed" : {
+            "description" : "Indicates whether the file content of this package has been available for or subjected to analysis when creating the SPDX document. If false indicates packages that represent metadata or URI references to a project, product, artifact, distribution or a component. If set to false, the package must not contain any files.",
+            "type" : "boolean"
+          },
+          "hasFiles" : {
+            "description" : "Indicates that a particular file belongs to a package.",
+            "type" : "array",
+            "items" : {
+              "description" : "SPDX ID for File.  Indicates that a particular file belongs to a package.",
+              "type" : "string"
+            }
+          },
+          "homepage" : {
+            "type" : "string"
+          },
+          "licenseComments" : {
+            "description" : "The licenseComments property allows the preparer of the SPDX document to describe why the licensing in spdx:licenseConcluded was chosen.",
+            "type" : "string"
+          },
+          "licenseConcluded" : {
+            "description" : "License expression for licenseConcluded. See SPDX Annex D for the license expression syntax.  The licensing that the preparer of this SPDX document has concluded, based on the evidence, actually applies to the SPDX Item.\n\nIf the licenseConcluded field is not present for an SPDX Item, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "string"
+          },
+          "licenseDeclared" : {
+            "description" : "License expression for licenseDeclared. See SPDX Annex D for the license expression syntax.  The licensing that the creators of the software in the package, or the packager, have declared. Declarations by the original software creator should be preferred, if they exist.",
+            "type" : "string"
+          },
+          "licenseInfoFromFiles" : {
+            "description" : "The licensing information that was discovered directly within the package. There will be an instance of this property for each distinct value of alllicenseInfoInFile properties of all files contained in the package.\n\nIf the licenseInfoFromFiles field is not present for a package and filesAnalyzed property for that same pacakge is true or omitted, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "array",
+            "items" : {
+              "description" : "License expression for licenseInfoFromFiles. See SPDX Annex D for the license expression syntax.  The licensing information that was discovered directly within the package. There will be an instance of this property for each distinct value of alllicenseInfoInFile properties of all files contained in the package.\n\nIf the licenseInfoFromFiles field is not present for a package and filesAnalyzed property for that same pacakge is true or omitted, it implies an equivalent meaning to NOASSERTION.",
+              "type" : "string"
+            }
+          },
+          "name" : {
+            "description" : "Identify name of this SpdxElement.",
+            "type" : "string"
+          },
+          "originator" : {
+            "description" : "The name and, optionally, contact information of the person or organization that originally created the package. Values of this property must conform to the agent and tool syntax.",
+            "type" : "string"
+          },
+          "packageFileName" : {
+            "description" : "The base name of the package file name. For example, zlib-1.2.5.tar.gz.",
+            "type" : "string"
+          },
+          "packageVerificationCode" : {
+            "type" : "object",
+            "properties" : {
+              "packageVerificationCodeExcludedFiles" : {
+                "description" : "A file that was excluded when calculating the package verification code. This is usually a file containing SPDX data regarding the package. If a package contains more than one SPDX file all SPDX files must be excluded from the package verification code. If this is not done it would be impossible to correctly calculate the verification codes in both files.",
+                "type" : "array",
+                "items" : {
+                  "description" : "A file that was excluded when calculating the package verification code. This is usually a file containing SPDX data regarding the package. If a package contains more than one SPDX file all SPDX files must be excluded from the package verification code. If this is not done it would be impossible to correctly calculate the verification codes in both files.",
+                  "type" : "string"
+                }
+              },
+              "packageVerificationCodeValue" : {
+                "description" : "The actual package verification code as a hex encoded value.",
+                "type" : "string"
+              }
+            },
+            "required" : [ "packageVerificationCodeValue" ],
+            "additionalProperties" : false,
+            "description" : "A manifest based verification code (the algorithm is defined in section 4.7 of the full specification) of the SPDX Item. This allows consumers of this data and/or database to determine if an SPDX item they have in hand is identical to the SPDX item from which the data was produced. This algorithm works even if the SPDX document is included in the SPDX item."
+          },
+          "primaryPackagePurpose" : {
+            "description" : "This field provides information about the primary purpose of the identified package. Package Purpose is intrinsic to how the package is being used rather than the content of the package.",
+            "type" : "string",
+            "enum" : [ "OTHER", "INSTALL", "ARCHIVE", "FIRMWARE", "APPLICATION", "FRAMEWORK", "LIBRARY", "CONTAINER", "SOURCE", "DEVICE", "OPERATING_SYSTEM", "FILE" ]
+          },
+          "releaseDate" : {
+            "description" : "This field provides a place for recording the date the package was released.",
+            "type" : "string"
+          },
+          "sourceInfo" : {
+            "description" : "Allows the producer(s) of the SPDX document to describe how the package was acquired and/or changed from the original source.",
+            "type" : "string"
+          },
+          "summary" : {
+            "description" : "Provides a short description of the package.",
+            "type" : "string"
+          },
+          "supplier" : {
+            "description" : "The name and, optionally, contact information of the person or organization who was the immediate supplier of this package to the recipient. The supplier may be different than originator when the software has been repackaged. Values of this property must conform to the agent and tool syntax.",
+            "type" : "string"
+          },
+          "validUntilDate" : {
+            "description" : "This field provides a place for recording the end of the support period for a package from the supplier.",
+            "type" : "string"
+          },
+          "versionInfo" : {
+            "description" : "Provides an indication of the version of the package that is described by this SpdxDocument.",
+            "type" : "string"
+          }
+        },
+        "required" : [ "SPDXID", "downloadLocation", "name" ],
+        "additionalProperties" : false
+      }
+    },
+    "files" : {
+      "description" : "Files referenced in the SPDX document",
+      "type" : "array",
+      "items" : {
+        "type" : "object",
+        "properties" : {
+          "SPDXID" : {
+            "type" : "string",
+            "description" : "Uniquely identify any element in an SPDX document which may be referenced by other elements."
+          },
+          "annotations" : {
+            "description" : "Provide additional information about an SpdxElement.",
+            "type" : "array",
+            "items" : {
+              "type" : "object",
+              "properties" : {
+                "annotationDate" : {
+                  "description" : "Identify when the comment was made. This is to be specified according to the combined date and time in the UTC format, as specified in the ISO 8601 standard.",
+                  "type" : "string"
+                },
+                "annotationType" : {
+                  "description" : "Type of the annotation.",
+                  "type" : "string",
+                  "enum" : [ "OTHER", "REVIEW" ]
+                },
+                "annotator" : {
+                  "description" : "This field identifies the person, organization, or tool that has commented on a file, package, snippet, or the entire document.",
+                  "type" : "string"
+                },
+                "comment" : {
+                  "type" : "string"
+                }
+              },
+              "required" : [ "annotationDate", "annotationType", "annotator", "comment" ],
+              "additionalProperties" : false,
+              "description" : "An Annotation is a comment on an SpdxItem by an agent."
+            }
+          },
+          "artifactOfs" : {
+            "description" : "Indicates the project in which the SpdxElement originated. Tools must preserve doap:homepage and doap:name properties and the URI (if one is known) of doap:Project resources that are values of this property. All other properties of doap:Projects are not directly supported by SPDX and may be dropped when translating to or from some SPDX formats.",
+            "type" : "array",
+            "items" : {
+              "type" : "object"
+            }
+          },
+          "attributionTexts" : {
+            "description" : "This field provides a place for the SPDX data creator to record acknowledgements that may be required to be communicated in some contexts. This is not meant to include the actual complete license text (see licenseConculded and licenseDeclared), and may or may not include copyright notices (see also copyrightText). The SPDX data creator may use this field to record other acknowledgements, such as particular clauses from license texts, which may be necessary or desirable to reproduce.",
+            "type" : "array",
+            "items" : {
+              "description" : "This field provides a place for the SPDX data creator to record acknowledgements that may be required to be communicated in some contexts. This is not meant to include the actual complete license text (see licenseConculded and licenseDeclared), and may or may not include copyright notices (see also copyrightText). The SPDX data creator may use this field to record other acknowledgements, such as particular clauses from license texts, which may be necessary or desirable to reproduce.",
+              "type" : "string"
+            }
+          },
+          "checksums" : {
+            "description" : "The checksum property provides a mechanism that can be used to verify that the contents of a File or Package have not changed.",
+            "minItems" : 1,
+            "type" : "array",
+            "items" : {
+              "type" : "object",
+              "properties" : {
+                "algorithm" : {
+                  "description" : "Identifies the algorithm used to produce the subject Checksum. Currently, SHA-1 is the only supported algorithm. It is anticipated that other algorithms will be supported at a later time.",
+                  "type" : "string",
+                  "enum" : [ "SHA1", "BLAKE3", "SHA3-384", "SHA256", "SHA384", "BLAKE2b-512", "BLAKE2b-256", "SHA3-512", "MD2", "ADLER32", "MD4", "SHA3-256", "BLAKE2b-384", "SHA512", "MD6", "MD5", "SHA224" ]
+                },
+                "checksumValue" : {
+                  "description" : "The checksumValue property provides a lower case hexidecimal encoded digest value produced using a specific algorithm.",
+                  "type" : "string"
+                }
+              },
+              "required" : [ "algorithm", "checksumValue" ],
+              "additionalProperties" : false,
+              "description" : "A Checksum is value that allows the contents of a file to be authenticated. Even small changes to the content of the file will change its checksum. This class allows the results of a variety of checksum and cryptographic message digest algorithms to be represented."
+            }
+          },
+          "comment" : {
+            "type" : "string"
+          },
+          "copyrightText" : {
+            "description" : "The text of copyright declarations recited in the package, file or snippet.\n\nIf the copyrightText field is not present, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "string"
+          },
+          "fileContributors" : {
+            "description" : "This field provides a place for the SPDX file creator to record file contributors. Contributors could include names of copyright holders and/or authors who may not be copyright holders yet contributed to the file content.",
+            "type" : "array",
+            "items" : {
+              "description" : "This field provides a place for the SPDX file creator to record file contributors. Contributors could include names of copyright holders and/or authors who may not be copyright holders yet contributed to the file content.",
+              "type" : "string"
+            }
+          },
+          "fileDependencies" : {
+            "description" : "This field is deprecated since SPDX 2.0 in favor of using Section 7 which provides more granularity about relationships.",
+            "type" : "array",
+            "items" : {
+              "description" : "SPDX ID for File.  This field is deprecated since SPDX 2.0 in favor of using Section 7 which provides more granularity about relationships.",
+              "type" : "string"
+            }
+          },
+          "fileName" : {
+            "description" : "The name of the file relative to the root of the package.",
+            "type" : "string"
+          },
+          "fileTypes" : {
+            "description" : "The type of the file.",
+            "type" : "array",
+            "items" : {
+              "description" : "The type of the file.",
+              "type" : "string",
+              "enum" : [ "OTHER", "DOCUMENTATION", "IMAGE", "VIDEO", "ARCHIVE", "SPDX", "APPLICATION", "SOURCE", "BINARY", "TEXT", "AUDIO" ]
+            }
+          },
+          "licenseComments" : {
+            "description" : "The licenseComments property allows the preparer of the SPDX document to describe why the licensing in spdx:licenseConcluded was chosen.",
+            "type" : "string"
+          },
+          "licenseConcluded" : {
+            "description" : "License expression for licenseConcluded. See SPDX Annex D for the license expression syntax.  The licensing that the preparer of this SPDX document has concluded, based on the evidence, actually applies to the SPDX Item.\n\nIf the licenseConcluded field is not present for an SPDX Item, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "string"
+          },
+          "licenseInfoInFiles" : {
+            "description" : "Licensing information that was discovered directly in the subject file. This is also considered a declared license for the file.\n\nIf the licenseInfoInFile field is not present for a file, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "array",
+            "items" : {
+              "description" : "License expression for licenseInfoInFile. See SPDX Annex D for the license expression syntax.  Licensing information that was discovered directly in the subject file. This is also considered a declared license for the file.\n\nIf the licenseInfoInFile field is not present for a file, it implies an equivalent meaning to NOASSERTION.",
+              "type" : "string"
+            }
+          },
+          "noticeText" : {
+            "description" : "This field provides a place for the SPDX file creator to record potential legal notices found in the file. This may or may not include copyright statements.",
+            "type" : "string"
+          }
+        },
+        "required" : [ "SPDXID", "checksums", "fileName" ],
+        "additionalProperties" : false
+      }
+    },
+    "snippets" : {
+      "description" : "Snippets referenced in the SPDX document",
+      "type" : "array",
+      "items" : {
+        "type" : "object",
+        "properties" : {
+          "SPDXID" : {
+            "type" : "string",
+            "description" : "Uniquely identify any element in an SPDX document which may be referenced by other elements."
+          },
+          "annotations" : {
+            "description" : "Provide additional information about an SpdxElement.",
+            "type" : "array",
+            "items" : {
+              "type" : "object",
+              "properties" : {
+                "annotationDate" : {
+                  "description" : "Identify when the comment was made. This is to be specified according to the combined date and time in the UTC format, as specified in the ISO 8601 standard.",
+                  "type" : "string"
+                },
+                "annotationType" : {
+                  "description" : "Type of the annotation.",
+                  "type" : "string",
+                  "enum" : [ "OTHER", "REVIEW" ]
+                },
+                "annotator" : {
+                  "description" : "This field identifies the person, organization, or tool that has commented on a file, package, snippet, or the entire document.",
+                  "type" : "string"
+                },
+                "comment" : {
+                  "type" : "string"
+                }
+              },
+              "required" : [ "annotationDate", "annotationType", "annotator", "comment" ],
+              "additionalProperties" : false,
+              "description" : "An Annotation is a comment on an SpdxItem by an agent."
+            }
+          },
+          "attributionTexts" : {
+            "description" : "This field provides a place for the SPDX data creator to record acknowledgements that may be required to be communicated in some contexts. This is not meant to include the actual complete license text (see licenseConculded and licenseDeclared), and may or may not include copyright notices (see also copyrightText). The SPDX data creator may use this field to record other acknowledgements, such as particular clauses from license texts, which may be necessary or desirable to reproduce.",
+            "type" : "array",
+            "items" : {
+              "description" : "This field provides a place for the SPDX data creator to record acknowledgements that may be required to be communicated in some contexts. This is not meant to include the actual complete license text (see licenseConculded and licenseDeclared), and may or may not include copyright notices (see also copyrightText). The SPDX data creator may use this field to record other acknowledgements, such as particular clauses from license texts, which may be necessary or desirable to reproduce.",
+              "type" : "string"
+            }
+          },
+          "comment" : {
+            "type" : "string"
+          },
+          "copyrightText" : {
+            "description" : "The text of copyright declarations recited in the package, file or snippet.\n\nIf the copyrightText field is not present, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "string"
+          },
+          "licenseComments" : {
+            "description" : "The licenseComments property allows the preparer of the SPDX document to describe why the licensing in spdx:licenseConcluded was chosen.",
+            "type" : "string"
+          },
+          "licenseConcluded" : {
+            "description" : "License expression for licenseConcluded. See SPDX Annex D for the license expression syntax.  The licensing that the preparer of this SPDX document has concluded, based on the evidence, actually applies to the SPDX Item.\n\nIf the licenseConcluded field is not present for an SPDX Item, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "string"
+          },
+          "licenseInfoInSnippets" : {
+            "description" : "Licensing information that was discovered directly in the subject snippet. This is also considered a declared license for the snippet.\n\nIf the licenseInfoInSnippet field is not present for a snippet, it implies an equivalent meaning to NOASSERTION.",
+            "type" : "array",
+            "items" : {
+              "description" : "License expression for licenseInfoInSnippet. See SPDX Annex D for the license expression syntax.  Licensing information that was discovered directly in the subject snippet. This is also considered a declared license for the snippet.\n\nIf the licenseInfoInSnippet field is not present for a snippet, it implies an equivalent meaning to NOASSERTION.",
+              "type" : "string"
+            }
+          },
+          "name" : {
+            "description" : "Identify name of this SpdxElement.",
+            "type" : "string"
+          },
+          "ranges" : {
+            "description" : "This field defines the byte range in the original host file (in X.2) that the snippet information applies to",
+            "minItems" : 1,
+            "type" : "array",
+            "items" : {
+              "type" : "object",
+              "properties" : {
+                "endPointer" : {
+                  "type" : "object",
+                  "properties" : {
+                    "reference" : {
+                      "description" : "SPDX ID for File",
+                      "type" : "string"
+                    },
+                    "offset" : {
+                      "type" : "integer",
+                      "description" : "Byte offset in the file"
+                    },
+                    "lineNumber" : {
+                      "type" : "integer",
+                      "description" : "line number offset in the file"
+                    }
+                  },
+                  "required" : [ "reference" ],
+                  "additionalProperties" : false
+                },
+                "startPointer" : {
+                  "type" : "object",
+                  "properties" : {
+                    "reference" : {
+                      "description" : "SPDX ID for File",
+                      "type" : "string"
+                    },
+                    "offset" : {
+                      "type" : "integer",
+                      "description" : "Byte offset in the file"
+                    },
+                    "lineNumber" : {
+                      "type" : "integer",
+                      "description" : "line number offset in the file"
+                    }
+                  },
+                  "required" : [ "reference" ],
+                  "additionalProperties" : false
+                }
+              },
+              "required" : [ "endPointer", "startPointer" ],
+              "additionalProperties" : false
+            }
+          },
+          "snippetFromFile" : {
+            "description" : "SPDX ID for File.  File containing the SPDX element (e.g. the file contaning a snippet).",
+            "type" : "string"
+          }
+        },
+        "required" : [ "SPDXID", "name", "ranges", "snippetFromFile" ],
+        "additionalProperties" : false
+      }
+    },
+    "relationships" : {
+      "description" : "Relationships referenced in the SPDX document",
+      "type" : "array",
+      "items" : {
+        "type" : "object",
+        "properties" : {
+          "spdxElementId" : {
+            "type" : "string",
+            "description" : "Id to which the SPDX element is related"
+          },
+          "comment" : {
+            "type" : "string"
+          },
+          "relatedSpdxElement" : {
+            "description" : "SPDX ID for SpdxElement.  A related SpdxElement.",
+            "type" : "string"
+          },
+          "relationshipType" : {
+            "description" : "Describes the type of relationship between two SPDX elements.",
+            "type" : "string",
+            "enum" : [ "VARIANT_OF", "COPY_OF", "PATCH_FOR", "TEST_DEPENDENCY_OF", "CONTAINED_BY", "DATA_FILE_OF", "OPTIONAL_COMPONENT_OF", "ANCESTOR_OF", "GENERATES", "CONTAINS", "OPTIONAL_DEPENDENCY_OF", "FILE_ADDED", "REQUIREMENT_DESCRIPTION_FOR", "DEV_DEPENDENCY_OF", "DEPENDENCY_OF", "BUILD_DEPENDENCY_OF", "DESCRIBES", "PREREQUISITE_FOR", "HAS_PREREQUISITE", "PROVIDED_DEPENDENCY_OF", "DYNAMIC_LINK", "DESCRIBED_BY", "METAFILE_OF", "DEPENDENCY_MANIFEST_OF", "PATCH_APPLIED", "RUNTIME_DEPENDENCY_OF", "TEST_OF", "TEST_TOOL_OF", "DEPENDS_ON", "SPECIFICATION_FOR", "FILE_MODIFIED", "DISTRIBUTION_ARTIFACT", "AMENDS", "DOCUMENTATION_OF", "GENERATED_FROM", "STATIC_LINK", "OTHER", "BUILD_TOOL_OF", "TEST_CASE_OF", "PACKAGE_OF", "DESCENDANT_OF", "FILE_DELETED", "EXPANDED_FROM_ARCHIVE", "DEV_TOOL_OF", "EXAMPLE_OF" ]
+          }
+        },
+        "required" : [ "spdxElementId", "relatedSpdxElement", "relationshipType" ],
+        "additionalProperties" : false
+      }
+    }
+  },
+  "required" : [ "SPDXID", "creationInfo", "dataLicense", "name", "spdxVersion" ],
+  "additionalProperties" : false
+}
\ No newline at end of file
diff --git a/deps/openssl/openssl-cl_asm.gypi b/deps/openssl/openssl-cl_asm.gypi
index 8791e005bf0f41..cd10355c171228 100644
--- a/deps/openssl/openssl-cl_asm.gypi
+++ b/deps/openssl/openssl-cl_asm.gypi
@@ -1,6 +1,6 @@
 {
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/asm/openssl-cl.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/asm/openssl-cl.gypi'],
diff --git a/deps/openssl/openssl-cl_asm_avx2.gypi b/deps/openssl/openssl-cl_asm_avx2.gypi
index 815598676770c6..50b5a9c375bd8d 100644
--- a/deps/openssl/openssl-cl_asm_avx2.gypi
+++ b/deps/openssl/openssl-cl_asm_avx2.gypi
@@ -1,6 +1,6 @@
 {
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/asm_avx2/openssl-cl.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/asm_avx2/openssl-cl.gypi'],
diff --git a/deps/openssl/openssl-cl_no_asm.gypi b/deps/openssl/openssl-cl_no_asm.gypi
index 22bcf1c3c77d84..0964fb36739b3a 100644
--- a/deps/openssl/openssl-cl_no_asm.gypi
+++ b/deps/openssl/openssl-cl_no_asm.gypi
@@ -1,6 +1,6 @@
 {
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/no-asm/openssl-cl.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/no-asm/openssl-cl.gypi'],
diff --git a/deps/openssl/openssl-fips_asm.gypi b/deps/openssl/openssl-fips_asm.gypi
index d0717df2a5094f..631df9eb893288 100644
--- a/deps/openssl/openssl-fips_asm.gypi
+++ b/deps/openssl/openssl-fips_asm.gypi
@@ -1,6 +1,6 @@
 {
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/asm/openssl-fips.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/asm/openssl-fips.gypi'],
diff --git a/deps/openssl/openssl-fips_asm_avx2.gypi b/deps/openssl/openssl-fips_asm_avx2.gypi
index d2a2a4bc11413f..4d63cacf29d040 100644
--- a/deps/openssl/openssl-fips_asm_avx2.gypi
+++ b/deps/openssl/openssl-fips_asm_avx2.gypi
@@ -1,6 +1,6 @@
 {
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/asm_avx2/openssl-fips.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/asm_avx2/openssl-fips.gypi'],
diff --git a/deps/openssl/openssl-fips_no_asm.gypi b/deps/openssl/openssl-fips_no_asm.gypi
index d598bde68c783d..7fdfd772abbce8 100644
--- a/deps/openssl/openssl-fips_no_asm.gypi
+++ b/deps/openssl/openssl-fips_no_asm.gypi
@@ -1,7 +1,7 @@
 {
   'defines': ['OPENSSL_NO_ASM'],
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/no-asm/openssl-fips.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/no-asm/openssl-fips.gypi'],
diff --git a/deps/openssl/openssl_asm.gypi b/deps/openssl/openssl_asm.gypi
index dbd5a5f69ff8d9..dd7e636eb08893 100644
--- a/deps/openssl/openssl_asm.gypi
+++ b/deps/openssl/openssl_asm.gypi
@@ -1,6 +1,6 @@
 {
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/asm/openssl.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/asm/openssl.gypi'],
diff --git a/deps/openssl/openssl_asm_avx2.gypi b/deps/openssl/openssl_asm_avx2.gypi
index 2883f83d694394..6a9c56d76a211a 100644
--- a/deps/openssl/openssl_asm_avx2.gypi
+++ b/deps/openssl/openssl_asm_avx2.gypi
@@ -1,6 +1,6 @@
 {
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/asm_avx2/openssl.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/asm_avx2/openssl.gypi'],
diff --git a/deps/openssl/openssl_common.gypi b/deps/openssl/openssl_common.gypi
index 256eb7d1808db3..1290fff251fc5b 100644
--- a/deps/openssl/openssl_common.gypi
+++ b/deps/openssl/openssl_common.gypi
@@ -13,7 +13,7 @@
   ],
   # build options specific to OS
   'conditions': [
-    [ 'OS=="aix"', {
+    [ 'OS in ("aix", "os400")', {
       # AIX is missing /usr/include/endian.h
       'defines': [
         '__LITTLE_ENDIAN=1234',
diff --git a/deps/openssl/openssl_no_asm.gypi b/deps/openssl/openssl_no_asm.gypi
index de0e486f67e90e..20663decabba23 100644
--- a/deps/openssl/openssl_no_asm.gypi
+++ b/deps/openssl/openssl_no_asm.gypi
@@ -1,7 +1,7 @@
 {
   'defines': ['OPENSSL_NO_ASM'],
   'conditions': [
-    ['target_arch=="ppc64" and OS=="aix"', {
+    ['target_arch=="ppc64" and OS in ("aix", "os400")', {
       'includes': ['config/archs/aix64-gcc-as/no-asm/openssl.gypi'],
     }, 'target_arch=="ppc64" and OS=="linux" and node_byteorder =="little"', {
       'includes': ['config/archs/linux-ppc64le/no-asm/openssl.gypi'],
diff --git a/deps/simdutf/simdutf.cpp b/deps/simdutf/simdutf.cpp
index eb3c53ba069ede..70b461ab550b46 100644
--- a/deps/simdutf/simdutf.cpp
+++ b/deps/simdutf/simdutf.cpp
@@ -1,4 +1,4 @@
-/* auto-generated on 2023-08-11 13:30:54 -0400. Do not edit! */
+/* auto-generated on 2023-10-08 13:48:09 -0400. Do not edit! */
 // dofile: invoked with prepath=/Users/dlemire/CVS/github/simdutf/src, filename=simdutf.cpp
 /* begin file src/simdutf.cpp */
 #include "simdutf.h"
@@ -1119,9 +1119,12 @@ simdutf_really_inline simd16<int16_t>::operator simd16<uint16_t>() const { retur
 #endif
 
 #ifdef _MSC_VER
-#if _MSC_VER >= 1920
-// Visual Studio 2019 and up support VBMI2 under x64 even if the header
+#if _MSC_VER >= 1930
+// Visual Studio 2022 and up support VBMI2 under x64 even if the header
 // avx512vbmi2intrin.h is not found.
+// Visual Studio 2019 technically supports VBMI2, but the implementation
+// might be unreliable. Search for visualstudio2019icelakeissue in our
+// tests.
 #define SIMDUTF_COMPILER_SUPPORTS_VBMI2 1
 #endif
 #endif
diff --git a/deps/simdutf/simdutf.h b/deps/simdutf/simdutf.h
index 22a49f48c6bc95..6ab1c34d7b30a7 100644
--- a/deps/simdutf/simdutf.h
+++ b/deps/simdutf/simdutf.h
@@ -1,4 +1,4 @@
-/* auto-generated on 2023-08-11 13:30:54 -0400. Do not edit! */
+/* auto-generated on 2023-10-08 13:48:09 -0400. Do not edit! */
 // dofile: invoked with prepath=/Users/dlemire/CVS/github/simdutf/include, filename=simdutf.h
 /* begin file include/simdutf.h */
 #ifndef SIMDUTF_H
@@ -576,7 +576,7 @@ SIMDUTF_DISABLE_UNDESIRED_WARNINGS
 #define SIMDUTF_SIMDUTF_VERSION_H
 
 /** The version of simdutf being used (major.minor.revision) */
-#define SIMDUTF_VERSION "3.2.17"
+#define SIMDUTF_VERSION "3.2.18"
 
 namespace simdutf {
 enum {
@@ -591,7 +591,7 @@ enum {
   /**
    * The revision (major.minor.REVISION) of simdutf being used.
    */
-  SIMDUTF_VERSION_REVISION = 17
+  SIMDUTF_VERSION_REVISION = 18
 };
 } // namespace simdutf
 
diff --git a/deps/undici/src/README.md b/deps/undici/src/README.md
index 05a5d21ed1195c..3ba89890df6f69 100644
--- a/deps/undici/src/README.md
+++ b/deps/undici/src/README.md
@@ -18,30 +18,34 @@ npm i undici
 ## Benchmarks
 
 The benchmark is a simple `hello world` [example](benchmarks/benchmark.js) using a
-number of unix sockets (connections) with a pipelining depth of 10 running on Node 16.
-The benchmarks below have the [simd](https://github.com/WebAssembly/simd) feature enabled.
+number of unix sockets (connections) with a pipelining depth of 10 running on Node 20.6.0.
 
 ### Connections 1
 
+
 | Tests               | Samples |        Result | Tolerance | Difference with slowest |
 |---------------------|---------|---------------|-----------|-------------------------|
-| http - no keepalive |      15 |  4.63 req/sec |  ± 2.77 % |                       - |
-| http - keepalive    |      10 |  4.81 req/sec |  ± 2.16 % |                + 3.94 % |
-| undici - stream     |      25 | 62.22 req/sec |  ± 2.67 % |             + 1244.58 % |
-| undici - dispatch   |      15 | 64.33 req/sec |  ± 2.47 % |             + 1290.24 % |
-| undici - request    |      15 | 66.08 req/sec |  ± 2.48 % |             + 1327.88 % |
-| undici - pipeline   |      10 | 66.13 req/sec |  ± 1.39 % |             + 1329.08 % |
+| http - no keepalive |      15 |  5.32 req/sec |  ± 2.61 % |                       - |
+| http - keepalive    |      10 |  5.35 req/sec |  ± 2.47 % |                + 0.44 % |
+| undici - fetch      |      15 | 41.85 req/sec |  ± 2.49 % |              + 686.04 % |
+| undici - pipeline   |      40 | 50.36 req/sec |  ± 2.77 % |              + 845.92 % |
+| undici - stream     |      15 | 60.58 req/sec |  ± 2.75 % |             + 1037.72 % |
+| undici - request    |      10 | 61.19 req/sec |  ± 2.60 % |             + 1049.24 % |
+| undici - dispatch   |      20 | 64.84 req/sec |  ± 2.81 % |             + 1117.81 % |
+
 
 ### Connections 50
 
 | Tests               | Samples |           Result | Tolerance | Difference with slowest |
 |---------------------|---------|------------------|-----------|-------------------------|
-| http - no keepalive |      50 |  3546.49 req/sec |  ± 2.90 % |                       - |
-| http - keepalive    |      15 |  5692.67 req/sec |  ± 2.48 % |               + 60.52 % |
-| undici - pipeline   |      25 |  8478.71 req/sec |  ± 2.62 % |              + 139.07 % |
-| undici - request    |      20 |  9766.66 req/sec |  ± 2.79 % |              + 175.39 % |
-| undici - stream     |      15 | 10109.74 req/sec |  ± 2.94 % |              + 185.06 % |
-| undici - dispatch   |      25 | 10949.73 req/sec |  ± 2.54 % |              + 208.75 % |
+| undici - fetch      |      30 |  2107.19 req/sec |  ± 2.69 % |                       - |
+| http - no keepalive |      10 |  2698.90 req/sec |  ± 2.68 % |               + 28.08 % |
+| http - keepalive    |      10 |  4639.49 req/sec |  ± 2.55 % |              + 120.17 % |
+| undici - pipeline   |      40 |  6123.33 req/sec |  ± 2.97 % |              + 190.59 % |
+| undici - stream     |      50 |  9426.51 req/sec |  ± 2.92 % |              + 347.35 % |
+| undici - request    |      10 | 10162.88 req/sec |  ± 2.13 % |              + 382.29 % |
+| undici - dispatch   |      50 | 11191.11 req/sec |  ± 2.98 % |              + 431.09 % |
+
 
 ## Quick Start
 
@@ -432,6 +436,7 @@ and `undici.Agent`) which will enable the family autoselection algorithm when es
 * [__Ethan Arrowood__](https://github.com/ethan-arrowood), <https://www.npmjs.com/~ethan_arrowood>
 * [__Matteo Collina__](https://github.com/mcollina), <https://www.npmjs.com/~matteo.collina>
 * [__Robert Nagy__](https://github.com/ronag), <https://www.npmjs.com/~ronag>
+* [__Matthew Aitken__](https://github.com/KhafraDev), <https://www.npmjs.com/~khaf>
 
 ## License
 
diff --git a/deps/undici/src/docs/api/Client.md b/deps/undici/src/docs/api/Client.md
index fc7c5d26e8f799..42668389a94225 100644
--- a/deps/undici/src/docs/api/Client.md
+++ b/deps/undici/src/docs/api/Client.md
@@ -17,12 +17,14 @@ Returns: `Client`
 
 ### Parameter: `ClientOptions`
 
+> ⚠️ Warning: The `H2` support is experimental.
+
 * **bodyTimeout** `number | null` (optional) - Default: `300e3` - The timeout after which a request will time out, in milliseconds. Monitors time between receiving body data. Use `0` to disable it entirely. Defaults to 300 seconds.
-* **headersTimeout** `number | null` (optional) - Default: `300e3` - The amount of time the parser will wait to receive the complete HTTP headers while not sending the request. Defaults to 300 seconds.
-* **keepAliveMaxTimeout** `number | null` (optional) - Default: `600e3` - The maximum allowed `keepAliveTimeout` when overridden by *keep-alive* hints from the server. Defaults to 10 minutes.
-* **keepAliveTimeout** `number | null` (optional) - Default: `4e3` - The timeout after which a socket without active requests will time out. Monitors time between activity on a connected socket. This value may be overridden by *keep-alive* hints from the server. See [MDN: HTTP - Headers - Keep-Alive directives](https://developer.mozilla.org/en-US/docs/Web/HTTP/Headers/Keep-Alive#directives) for more details. Defaults to 4 seconds.
-* **keepAliveTimeoutThreshold** `number | null` (optional) - Default: `1e3` - A number subtracted from server *keep-alive* hints when overriding `keepAliveTimeout` to account for timing inaccuracies caused by e.g. transport latency. Defaults to 1 second.
-* **maxHeaderSize** `number | null` (optional) - Default: `16384` - The maximum length of request headers in bytes. Defaults to 16KiB.
+* **headersTimeout** `number | null` (optional) - Default: `300e3` - The amount of time, in milliseconds, the parser will wait to receive the complete HTTP headers while not sending the request. Defaults to 300 seconds.
+* **keepAliveMaxTimeout** `number | null` (optional) - Default: `600e3` - The maximum allowed `keepAliveTimeout`, in milliseconds, when overridden by *keep-alive* hints from the server. Defaults to 10 minutes.
+* **keepAliveTimeout** `number | null` (optional) - Default: `4e3` - The timeout, in milliseconds, after which a socket without active requests will time out. Monitors time between activity on a connected socket. This value may be overridden by *keep-alive* hints from the server. See [MDN: HTTP - Headers - Keep-Alive directives](https://developer.mozilla.org/en-US/docs/Web/HTTP/Headers/Keep-Alive#directives) for more details. Defaults to 4 seconds.
+* **keepAliveTimeoutThreshold** `number | null` (optional) - Default: `1e3` - A number of milliseconds subtracted from server *keep-alive* hints when overriding `keepAliveTimeout` to account for timing inaccuracies caused by e.g. transport latency. Defaults to 1 second.
+* **maxHeaderSize** `number | null` (optional) - Default: `--max-http-header-size` or `16384` - The maximum length of request headers in bytes. Defaults to Node.js' --max-http-header-size or 16KiB.
 * **maxResponseSize** `number | null` (optional) - Default: `-1` - The maximum length of response body in bytes. Set to `-1` to disable.
 * **pipelining** `number | null` (optional) - Default: `1` - The amount of concurrent requests to be sent over the single TCP/TLS connection according to [RFC7230](https://tools.ietf.org/html/rfc7230#section-6.3.2). Carefully consider your workload and environment before enabling concurrent requests as pipelining may reduce performance if used incorrectly. Pipelining is sensitive to network stack settings as well as head of line blocking caused by e.g. long running requests. Set to `0` to disable keep-alive connections.
 * **connect** `ConnectOptions | Function | null` (optional) - Default: `null`.
@@ -30,6 +32,8 @@ Returns: `Client`
 * **interceptors** `{ Client: DispatchInterceptor[] }` - Default: `[RedirectInterceptor]` - A list of interceptors that are applied to the dispatch method. Additional logic can be applied (such as, but not limited to: 302 status code handling, authentication, cookies, compression and caching). Note that the behavior of interceptors is Experimental and might change at any given time.
 * **autoSelectFamily**: `boolean` (optional) - Default: depends on local Node version, on Node 18.13.0 and above is `false`. Enables a family autodetection algorithm that loosely implements section 5 of [RFC 8305](https://tools.ietf.org/html/rfc8305#section-5). See [here](https://nodejs.org/api/net.html#socketconnectoptions-connectlistener) for more details. This option is ignored if not supported by the current Node version.
 * **autoSelectFamilyAttemptTimeout**: `number` - Default: depends on local Node version, on Node 18.13.0 and above is `250`. The amount of time in milliseconds to wait for a connection attempt to finish before trying the next address when using the `autoSelectFamily` option. See [here](https://nodejs.org/api/net.html#socketconnectoptions-connectlistener) for more details.
+* **allowH2**: `boolean` - Default: `false`. Enables support for H2 if the server has assigned bigger priority to it through ALPN negotiation.
+* **maxConcurrentStreams**: `number` - Default: `100`. Dictates the maximum number of concurrent streams for a single H2 session. It can be overriden by a SETTINGS remote frame.
 
 #### Parameter: `ConnectOptions`
 
@@ -38,7 +42,7 @@ Furthermore, the following options can be passed:
 
 * **socketPath** `string | null` (optional) - Default: `null` - An IPC endpoint, either Unix domain socket or Windows named pipe.
 * **maxCachedSessions** `number | null` (optional) - Default: `100` - Maximum number of TLS cached sessions. Use 0 to disable TLS session caching. Default: 100.
-* **timeout** `number | null` (optional) -  Default `10e3`
+* **timeout** `number | null` (optional) -  In milliseconds, Default `10e3`.
 * **servername** `string | null` (optional)
 * **keepAlive** `boolean | null` (optional) - Default: `true` - TCP keep-alive enabled
 * **keepAliveInitialDelay** `number | null` (optional) - Default: `60000` - TCP keep-alive interval for the socket in milliseconds
diff --git a/deps/undici/src/docs/api/Connector.md b/deps/undici/src/docs/api/Connector.md
index 7c966507e5fceb..56821bd6430279 100644
--- a/deps/undici/src/docs/api/Connector.md
+++ b/deps/undici/src/docs/api/Connector.md
@@ -13,8 +13,8 @@ Every Tls option, see [here](https://nodejs.org/api/tls.html#tls_tls_connect_opt
 Furthermore, the following options can be passed:
 
 * **socketPath** `string | null` (optional) - Default: `null` - An IPC endpoint, either Unix domain socket or Windows named pipe.
-* **maxCachedSessions** `number | null` (optional) - Default: `100` - Maximum number of TLS cached sessions. Use 0 to disable TLS session caching. Default: 100.
-* **timeout** `number | null` (optional) -  Default `10e3`
+* **maxCachedSessions** `number | null` (optional) - Default: `100` - Maximum number of TLS cached sessions. Use 0 to disable TLS session caching. Default: `100`.
+* **timeout** `number | null` (optional) -  In milliseconds. Default `10e3`.
 * **servername** `string | null` (optional)
 
 Once you call `buildConnector`, it will return a connector function, which takes the following parameters.
diff --git a/deps/undici/src/docs/api/Dispatcher.md b/deps/undici/src/docs/api/Dispatcher.md
index a50642948aaca1..fd463bfea16737 100644
--- a/deps/undici/src/docs/api/Dispatcher.md
+++ b/deps/undici/src/docs/api/Dispatcher.md
@@ -200,8 +200,9 @@ Returns: `Boolean` - `false` if dispatcher is busy and further dispatch calls wo
 * **blocking** `boolean` (optional) - Default: `false` - Whether the response is expected to take a long time and would end up blocking the pipeline. When this is set to `true` further pipelining will be avoided on the same connection until headers have been received.
 * **upgrade** `string | null` (optional) - Default: `null` - Upgrade the request. Should be used to specify the kind of upgrade i.e. `'Websocket'`.
 * **bodyTimeout** `number | null` (optional) - The timeout after which a request will time out, in milliseconds. Monitors time between receiving body data. Use `0` to disable it entirely. Defaults to 300 seconds.
-* **headersTimeout** `number | null` (optional) - The amount of time the parser will wait to receive the complete HTTP headers while not sending the request. Defaults to 300 seconds.
+* **headersTimeout** `number | null` (optional) - The amount of time, in milliseconds, the parser will wait to receive the complete HTTP headers while not sending the request. Defaults to 300 seconds.
 * **throwOnError** `boolean` (optional) - Default: `false` - Whether Undici should throw an error upon receiving a 4xx or 5xx response from the server.
+* **expectContinue** `boolean` (optional) - Default: `false` - For H2, it appends the expect: 100-continue header, and halts the request body until a 100-continue is received from the remote server
 
 #### Parameter: `DispatchHandler`
 
diff --git a/deps/undici/src/docs/api/MockPool.md b/deps/undici/src/docs/api/MockPool.md
index 923c157aa64657..de53914002eca3 100644
--- a/deps/undici/src/docs/api/MockPool.md
+++ b/deps/undici/src/docs/api/MockPool.md
@@ -35,7 +35,8 @@ const mockPool = mockAgent.get('http://localhost:3000')
 
 ### `MockPool.intercept(options)`
 
-This method defines the interception rules for matching against requests for a MockPool or MockPool. We can intercept multiple times on a single instance.
+This method defines the interception rules for matching against requests for a MockPool or MockPool. We can intercept multiple times on a single instance, but each intercept is only used once. 
+For example if you expect to make 2 requests inside a test, you need to call `intercept()` twice. Assuming you use `disableNetConnect()` you will get `MockNotMatchedError` on the second request when you only call `intercept()` once.
 
 When defining interception rules, all the rules must pass for a request to be intercepted. If a request is not intercepted, a real request will be attempted.
 
diff --git a/deps/undici/src/index-fetch.js b/deps/undici/src/index-fetch.js
index 0d59d254f7d548..23ac530600769e 100644
--- a/deps/undici/src/index-fetch.js
+++ b/deps/undici/src/index-fetch.js
@@ -2,9 +2,9 @@
 
 const fetchImpl = require('./lib/fetch').fetch
 
-module.exports.fetch = async function fetch (resource) {
+module.exports.fetch = async function fetch (resource, init = undefined) {
   try {
-    return await fetchImpl(...arguments)
+    return await fetchImpl(resource, init)
   } catch (err) {
     Error.captureStackTrace(err, this)
     throw err
@@ -14,3 +14,4 @@ module.exports.FormData = require('./lib/fetch/formdata').FormData
 module.exports.Headers = require('./lib/fetch/headers').Headers
 module.exports.Response = require('./lib/fetch/response').Response
 module.exports.Request = require('./lib/fetch/request').Request
+module.exports.WebSocket = require('./lib/websocket/websocket').WebSocket
diff --git a/deps/undici/src/index.d.ts b/deps/undici/src/index.d.ts
index 0730677b29e419..83a786d6a03131 100644
--- a/deps/undici/src/index.d.ts
+++ b/deps/undici/src/index.d.ts
@@ -1,57 +1,3 @@
-import Dispatcher from'./types/dispatcher'
-import { setGlobalDispatcher, getGlobalDispatcher } from './types/global-dispatcher'
-import { setGlobalOrigin, getGlobalOrigin } from './types/global-origin'
-import Pool from'./types/pool'
-import { RedirectHandler, DecoratorHandler } from './types/handlers'
-
-import BalancedPool from './types/balanced-pool'
-import Client from'./types/client'
-import buildConnector from'./types/connector'
-import errors from'./types/errors'
-import Agent from'./types/agent'
-import MockClient from'./types/mock-client'
-import MockPool from'./types/mock-pool'
-import MockAgent from'./types/mock-agent'
-import mockErrors from'./types/mock-errors'
-import ProxyAgent from'./types/proxy-agent'
-import { request, pipeline, stream, connect, upgrade } from './types/api'
-
-export * from './types/cookies'
-export * from './types/fetch'
-export * from './types/file'
-export * from './types/filereader'
-export * from './types/formdata'
-export * from './types/diagnostics-channel'
-export * from './types/websocket'
-export * from './types/content-type'
-export * from './types/cache'
-export { Interceptable } from './types/mock-interceptor'
-
-export { Dispatcher, BalancedPool, Pool, Client, buildConnector, errors, Agent, request, stream, pipeline, connect, upgrade, setGlobalDispatcher, getGlobalDispatcher, setGlobalOrigin, getGlobalOrigin, MockClient, MockPool, MockAgent, mockErrors, ProxyAgent, RedirectHandler, DecoratorHandler }
+export * from './types/index'
+import Undici from './types/index'
 export default Undici
-
-declare namespace Undici {
-  var Dispatcher: typeof import('./types/dispatcher').default
-  var Pool: typeof import('./types/pool').default;
-  var RedirectHandler: typeof import ('./types/handlers').RedirectHandler
-  var DecoratorHandler: typeof import ('./types/handlers').DecoratorHandler
-  var createRedirectInterceptor: typeof import ('./types/interceptors').createRedirectInterceptor
-  var BalancedPool: typeof import('./types/balanced-pool').default;
-  var Client: typeof import('./types/client').default;
-  var buildConnector: typeof import('./types/connector').default;
-  var errors: typeof import('./types/errors').default;
-  var Agent: typeof import('./types/agent').default;
-  var setGlobalDispatcher: typeof import('./types/global-dispatcher').setGlobalDispatcher;
-  var getGlobalDispatcher: typeof import('./types/global-dispatcher').getGlobalDispatcher;
-  var request: typeof import('./types/api').request;
-  var stream: typeof import('./types/api').stream;
-  var pipeline: typeof import('./types/api').pipeline;
-  var connect: typeof import('./types/api').connect;
-  var upgrade: typeof import('./types/api').upgrade;
-  var MockClient: typeof import('./types/mock-client').default;
-  var MockPool: typeof import('./types/mock-pool').default;
-  var MockAgent: typeof import('./types/mock-agent').default;
-  var mockErrors: typeof import('./types/mock-errors').default;
-  var fetch: typeof import('./types/fetch').fetch;
-  var caches: typeof import('./types/cache').caches;
-}
diff --git a/deps/undici/src/index.js b/deps/undici/src/index.js
index 7e8831ceeea3ea..7c0c8adcd6c809 100644
--- a/deps/undici/src/index.js
+++ b/deps/undici/src/index.js
@@ -106,7 +106,10 @@ if (util.nodeMajor > 16 || (util.nodeMajor === 16 && util.nodeMinor >= 8)) {
     try {
       return await fetchImpl(...arguments)
     } catch (err) {
-      Error.captureStackTrace(err, this)
+      if (typeof err === 'object') {
+        Error.captureStackTrace(err, this)
+      }
+
       throw err
     }
   }
diff --git a/deps/undici/src/lib/api/api-connect.js b/deps/undici/src/lib/api/api-connect.js
index 0503b1a2f0eb10..fd2b6ad97a52d5 100644
--- a/deps/undici/src/lib/api/api-connect.js
+++ b/deps/undici/src/lib/api/api-connect.js
@@ -1,7 +1,7 @@
 'use strict'
 
-const { InvalidArgumentError, RequestAbortedError, SocketError } = require('../core/errors')
 const { AsyncResource } = require('async_hooks')
+const { InvalidArgumentError, RequestAbortedError, SocketError } = require('../core/errors')
 const util = require('../core/util')
 const { addSignal, removeSignal } = require('./abort-signal')
 
@@ -50,7 +50,13 @@ class ConnectHandler extends AsyncResource {
     removeSignal(this)
 
     this.callback = null
-    const headers = this.responseHeaders === 'raw' ? util.parseRawHeaders(rawHeaders) : util.parseHeaders(rawHeaders)
+
+    let headers = rawHeaders
+    // Indicates is an HTTP2Session
+    if (headers != null) {
+      headers = this.responseHeaders === 'raw' ? util.parseRawHeaders(rawHeaders) : util.parseHeaders(rawHeaders)
+    }
+
     this.runInAsyncScope(callback, null, null, {
       statusCode,
       headers,
diff --git a/deps/undici/src/lib/api/api-request.js b/deps/undici/src/lib/api/api-request.js
index 71d7e926b4c395..f130ecc9867a88 100644
--- a/deps/undici/src/lib/api/api-request.js
+++ b/deps/undici/src/lib/api/api-request.js
@@ -95,7 +95,6 @@ class RequestHandler extends AsyncResource {
 
     this.callback = null
     this.res = body
-
     if (callback !== null) {
       if (this.throwOnError && statusCode >= 400) {
         this.runInAsyncScope(getResolveErrorBodyCallback, null,
diff --git a/deps/undici/src/lib/cache/cache.js b/deps/undici/src/lib/cache/cache.js
index 18f06a348a0a88..9b3110860cd6b8 100644
--- a/deps/undici/src/lib/cache/cache.js
+++ b/deps/undici/src/lib/cache/cache.js
@@ -379,11 +379,7 @@ class Cache {
       const reader = stream.getReader()
 
       // 11.3
-      readAllBytes(
-        reader,
-        (bytes) => bodyReadPromise.resolve(bytes),
-        (error) => bodyReadPromise.reject(error)
-      )
+      readAllBytes(reader).then(bodyReadPromise.resolve, bodyReadPromise.reject)
     } else {
       bodyReadPromise.resolve(undefined)
     }
diff --git a/deps/undici/src/lib/client.js b/deps/undici/src/lib/client.js
index 7d9ec8d7c272b3..065fb563380dcc 100644
--- a/deps/undici/src/lib/client.js
+++ b/deps/undici/src/lib/client.js
@@ -6,6 +6,8 @@
 
 const assert = require('assert')
 const net = require('net')
+const http = require('http')
+const { pipeline } = require('stream')
 const util = require('./core/util')
 const timers = require('./timers')
 const Request = require('./core/request')
@@ -67,8 +69,41 @@ const {
   kDispatch,
   kInterceptors,
   kLocalAddress,
-  kMaxResponseSize
+  kMaxResponseSize,
+  kHTTPConnVersion,
+  // HTTP2
+  kHost,
+  kHTTP2Session,
+  kHTTP2SessionState,
+  kHTTP2BuildRequest,
+  kHTTP2CopyHeaders,
+  kHTTP1BuildRequest
 } = require('./core/symbols')
+
+/** @type {import('http2')} */
+let http2
+try {
+  http2 = require('http2')
+} catch {
+  // @ts-ignore
+  http2 = { constants: {} }
+}
+
+const {
+  constants: {
+    HTTP2_HEADER_AUTHORITY,
+    HTTP2_HEADER_METHOD,
+    HTTP2_HEADER_PATH,
+    HTTP2_HEADER_SCHEME,
+    HTTP2_HEADER_CONTENT_LENGTH,
+    HTTP2_HEADER_EXPECT,
+    HTTP2_HEADER_STATUS
+  }
+} = http2
+
+// Experimental
+let h2ExperimentalWarned = false
+
 const FastBuffer = Buffer[Symbol.species]
 
 const kClosedResolve = Symbol('kClosedResolve')
@@ -122,7 +157,10 @@ class Client extends DispatcherBase {
     localAddress,
     maxResponseSize,
     autoSelectFamily,
-    autoSelectFamilyAttemptTimeout
+    autoSelectFamilyAttemptTimeout,
+    // h2
+    allowH2,
+    maxConcurrentStreams
   } = {}) {
     super()
 
@@ -205,10 +243,20 @@ class Client extends DispatcherBase {
       throw new InvalidArgumentError('autoSelectFamilyAttemptTimeout must be a positive number')
     }
 
+    // h2
+    if (allowH2 != null && typeof allowH2 !== 'boolean') {
+      throw new InvalidArgumentError('allowH2 must be a valid boolean value')
+    }
+
+    if (maxConcurrentStreams != null && (typeof maxConcurrentStreams !== 'number' || maxConcurrentStreams < 1)) {
+      throw new InvalidArgumentError('maxConcurrentStreams must be a possitive integer, greater than 0')
+    }
+
     if (typeof connect !== 'function') {
       connect = buildConnector({
         ...tls,
         maxCachedSessions,
+        allowH2,
         socketPath,
         timeout: connectTimeout,
         ...(util.nodeHasAutoSelectFamily && autoSelectFamily ? { autoSelectFamily, autoSelectFamilyAttemptTimeout } : undefined),
@@ -223,7 +271,7 @@ class Client extends DispatcherBase {
     this[kConnector] = connect
     this[kSocket] = null
     this[kPipelining] = pipelining != null ? pipelining : 1
-    this[kMaxHeadersSize] = maxHeaderSize || 16384
+    this[kMaxHeadersSize] = maxHeaderSize || http.maxHeaderSize
     this[kKeepAliveDefaultTimeout] = keepAliveTimeout == null ? 4e3 : keepAliveTimeout
     this[kKeepAliveMaxTimeout] = keepAliveMaxTimeout == null ? 600e3 : keepAliveMaxTimeout
     this[kKeepAliveTimeoutThreshold] = keepAliveTimeoutThreshold == null ? 1e3 : keepAliveTimeoutThreshold
@@ -240,6 +288,18 @@ class Client extends DispatcherBase {
     this[kMaxRequests] = maxRequestsPerClient
     this[kClosedResolve] = null
     this[kMaxResponseSize] = maxResponseSize > -1 ? maxResponseSize : -1
+    this[kHTTPConnVersion] = 'h1'
+
+    // HTTP/2
+    this[kHTTP2Session] = null
+    this[kHTTP2SessionState] = !allowH2
+      ? null
+      : {
+        // streams: null, // Fixed queue of streams - For future support of `push`
+          openStreams: 0, // Keep track of them to decide wether or not unref the session
+          maxConcurrentStreams: maxConcurrentStreams != null ? maxConcurrentStreams : 100 // Max peerConcurrentStreams for a Node h2 server
+        }
+    this[kHost] = `${this[kUrl].hostname}${this[kUrl].port ? `:${this[kUrl].port}` : ''}`
 
     // kQueue is built up of 3 sections separated by
     // the kRunningIdx and kPendingIdx indices.
@@ -298,7 +358,9 @@ class Client extends DispatcherBase {
   [kDispatch] (opts, handler) {
     const origin = opts.origin || this[kUrl].origin
 
-    const request = new Request(origin, opts, handler)
+    const request = this[kHTTPConnVersion] === 'h2'
+      ? Request[kHTTP2BuildRequest](origin, opts, handler)
+      : Request[kHTTP1BuildRequest](origin, opts, handler)
 
     this[kQueue].push(request)
     if (this[kResuming]) {
@@ -319,6 +381,8 @@ class Client extends DispatcherBase {
   }
 
   async [kClose] () {
+    // TODO: for H2 we need to gracefully flush the remaining enqueued
+    // request and close each stream.
     return new Promise((resolve) => {
       if (!this[kSize]) {
         resolve(null)
@@ -345,6 +409,12 @@ class Client extends DispatcherBase {
         resolve()
       }
 
+      if (this[kHTTP2Session] != null) {
+        util.destroy(this[kHTTP2Session], err)
+        this[kHTTP2Session] = null
+        this[kHTTP2SessionState] = null
+      }
+
       if (!this[kSocket]) {
         queueMicrotask(callback)
       } else {
@@ -356,6 +426,64 @@ class Client extends DispatcherBase {
   }
 }
 
+function onHttp2SessionError (err) {
+  assert(err.code !== 'ERR_TLS_CERT_ALTNAME_INVALID')
+
+  this[kSocket][kError] = err
+
+  onError(this[kClient], err)
+}
+
+function onHttp2FrameError (type, code, id) {
+  const err = new InformationalError(`HTTP/2: "frameError" received - type ${type}, code ${code}`)
+
+  if (id === 0) {
+    this[kSocket][kError] = err
+    onError(this[kClient], err)
+  }
+}
+
+function onHttp2SessionEnd () {
+  util.destroy(this, new SocketError('other side closed'))
+  util.destroy(this[kSocket], new SocketError('other side closed'))
+}
+
+function onHTTP2GoAway (code) {
+  const client = this[kClient]
+  const err = new InformationalError(`HTTP/2: "GOAWAY" frame received with code ${code}`)
+  client[kSocket] = null
+  client[kHTTP2Session] = null
+
+  if (client.destroyed) {
+    assert(this[kPending] === 0)
+
+    // Fail entire queue.
+    const requests = client[kQueue].splice(client[kRunningIdx])
+    for (let i = 0; i < requests.length; i++) {
+      const request = requests[i]
+      errorRequest(this, request, err)
+    }
+  } else if (client[kRunning] > 0) {
+    // Fail head of pipeline.
+    const request = client[kQueue][client[kRunningIdx]]
+    client[kQueue][client[kRunningIdx]++] = null
+
+    errorRequest(client, request, err)
+  }
+
+  client[kPendingIdx] = client[kRunningIdx]
+
+  assert(client[kRunning] === 0)
+
+  client.emit('disconnect',
+    client[kUrl],
+    [client],
+    err
+  )
+
+  resume(client)
+}
+
 const constants = require('./llhttp/constants')
 const createRedirectInterceptor = require('./interceptor/redirectInterceptor')
 const EMPTY_BUF = Buffer.alloc(0)
@@ -946,16 +1074,18 @@ function onSocketReadable () {
 }
 
 function onSocketError (err) {
-  const { [kParser]: parser } = this
+  const { [kClient]: client, [kParser]: parser } = this
 
   assert(err.code !== 'ERR_TLS_CERT_ALTNAME_INVALID')
 
-  // On Mac OS, we get an ECONNRESET even if there is a full body to be forwarded
-  // to the user.
-  if (err.code === 'ECONNRESET' && parser.statusCode && !parser.shouldKeepAlive) {
-    // We treat all incoming data so for as a valid response.
-    parser.onMessageComplete()
-    return
+  if (client[kHTTPConnVersion] !== 'h2') {
+    // On Mac OS, we get an ECONNRESET even if there is a full body to be forwarded
+    // to the user.
+    if (err.code === 'ECONNRESET' && parser.statusCode && !parser.shouldKeepAlive) {
+      // We treat all incoming data so for as a valid response.
+      parser.onMessageComplete()
+      return
+    }
   }
 
   this[kError] = err
@@ -984,27 +1114,31 @@ function onError (client, err) {
 }
 
 function onSocketEnd () {
-  const { [kParser]: parser } = this
+  const { [kParser]: parser, [kClient]: client } = this
 
-  if (parser.statusCode && !parser.shouldKeepAlive) {
-    // We treat all incoming data so far as a valid response.
-    parser.onMessageComplete()
-    return
+  if (client[kHTTPConnVersion] !== 'h2') {
+    if (parser.statusCode && !parser.shouldKeepAlive) {
+      // We treat all incoming data so far as a valid response.
+      parser.onMessageComplete()
+      return
+    }
   }
 
   util.destroy(this, new SocketError('other side closed', util.getSocketInfo(this)))
 }
 
 function onSocketClose () {
-  const { [kClient]: client } = this
+  const { [kClient]: client, [kParser]: parser } = this
 
-  if (!this[kError] && this[kParser].statusCode && !this[kParser].shouldKeepAlive) {
-    // We treat all incoming data so far as a valid response.
-    this[kParser].onMessageComplete()
-  }
+  if (client[kHTTPConnVersion] === 'h1' && parser) {
+    if (!this[kError] && parser.statusCode && !parser.shouldKeepAlive) {
+      // We treat all incoming data so far as a valid response.
+      parser.onMessageComplete()
+    }
 
-  this[kParser].destroy()
-  this[kParser] = null
+    this[kParser].destroy()
+    this[kParser] = null
+  }
 
   const err = this[kError] || new SocketError('closed', util.getSocketInfo(this))
 
@@ -1092,24 +1226,54 @@ async function connect (client) {
       return
     }
 
-    if (!llhttpInstance) {
-      llhttpInstance = await llhttpPromise
-      llhttpPromise = null
-    }
-
     client[kConnecting] = false
 
     assert(socket)
 
-    socket[kNoRef] = false
-    socket[kWriting] = false
-    socket[kReset] = false
-    socket[kBlocking] = false
-    socket[kError] = null
-    socket[kParser] = new Parser(client, socket, llhttpInstance)
-    socket[kClient] = client
+    const isH2 = socket.alpnProtocol === 'h2'
+    if (isH2) {
+      if (!h2ExperimentalWarned) {
+        h2ExperimentalWarned = true
+        process.emitWarning('H2 support is experimental, expect them to change at any time.', {
+          code: 'UNDICI-H2'
+        })
+      }
+
+      const session = http2.connect(client[kUrl], {
+        createConnection: () => socket,
+        peerMaxConcurrentStreams: client[kHTTP2SessionState].maxConcurrentStreams
+      })
+
+      client[kHTTPConnVersion] = 'h2'
+      session[kClient] = client
+      session[kSocket] = socket
+      session.on('error', onHttp2SessionError)
+      session.on('frameError', onHttp2FrameError)
+      session.on('end', onHttp2SessionEnd)
+      session.on('goaway', onHTTP2GoAway)
+      session.on('close', onSocketClose)
+      session.unref()
+
+      client[kHTTP2Session] = session
+      socket[kHTTP2Session] = session
+    } else {
+      if (!llhttpInstance) {
+        llhttpInstance = await llhttpPromise
+        llhttpPromise = null
+      }
+
+      socket[kNoRef] = false
+      socket[kWriting] = false
+      socket[kReset] = false
+      socket[kBlocking] = false
+      socket[kParser] = new Parser(client, socket, llhttpInstance)
+    }
+
     socket[kCounter] = 0
     socket[kMaxRequests] = client[kMaxRequests]
+    socket[kClient] = client
+    socket[kError] = null
+
     socket
       .on('error', onSocketError)
       .on('readable', onSocketReadable)
@@ -1208,7 +1372,7 @@ function _resume (client, sync) {
 
     const socket = client[kSocket]
 
-    if (socket && !socket.destroyed) {
+    if (socket && !socket.destroyed && socket.alpnProtocol !== 'h2') {
       if (client[kSize] === 0) {
         if (!socket[kNoRef] && socket.unref) {
           socket.unref()
@@ -1273,7 +1437,7 @@ function _resume (client, sync) {
       return
     }
 
-    if (!socket) {
+    if (!socket && !client[kHTTP2Session]) {
       connect(client)
       return
     }
@@ -1334,6 +1498,11 @@ function _resume (client, sync) {
 }
 
 function write (client, request) {
+  if (client[kHTTPConnVersion] === 'h2') {
+    writeH2(client, client[kHTTP2Session], request)
+    return
+  }
+
   const { body, method, path, host, upgrade, headers, blocking, reset } = request
 
   // https://tools.ietf.org/html/rfc7231#section-4.3.1
@@ -1489,9 +1658,296 @@ function write (client, request) {
   return true
 }
 
-function writeStream ({ body, client, request, socket, contentLength, header, expectsPayload }) {
+function writeH2 (client, session, request) {
+  const { body, method, path, host, upgrade, expectContinue, signal, headers: reqHeaders } = request
+
+  let headers
+  if (typeof reqHeaders === 'string') headers = Request[kHTTP2CopyHeaders](reqHeaders.trim())
+  else headers = reqHeaders
+
+  if (upgrade) {
+    errorRequest(client, request, new Error('Upgrade not supported for H2'))
+    return false
+  }
+
+  try {
+    // TODO(HTTP/2): Should we call onConnect immediately or on stream ready event?
+    request.onConnect((err) => {
+      if (request.aborted || request.completed) {
+        return
+      }
+
+      errorRequest(client, request, err || new RequestAbortedError())
+    })
+  } catch (err) {
+    errorRequest(client, request, err)
+  }
+
+  if (request.aborted) {
+    return false
+  }
+
+  let stream
+  const h2State = client[kHTTP2SessionState]
+
+  headers[HTTP2_HEADER_AUTHORITY] = host || client[kHost]
+  headers[HTTP2_HEADER_METHOD] = method
+
+  if (method === 'CONNECT') {
+    session.ref()
+    // we are already connected, streams are pending, first request
+    // will create a new stream. We trigger a request to create the stream and wait until
+    // `ready` event is triggered
+    // We disabled endStream to allow the user to write to the stream
+    stream = session.request(headers, { endStream: false, signal })
+
+    if (stream.id && !stream.pending) {
+      request.onUpgrade(null, null, stream)
+      ++h2State.openStreams
+    } else {
+      stream.once('ready', () => {
+        request.onUpgrade(null, null, stream)
+        ++h2State.openStreams
+      })
+    }
+
+    stream.once('close', () => {
+      h2State.openStreams -= 1
+      // TODO(HTTP/2): unref only if current streams count is 0
+      if (h2State.openStreams === 0) session.unref()
+    })
+
+    return true
+  }
+
+  // https://tools.ietf.org/html/rfc7540#section-8.3
+  // :path and :scheme headers must be omited when sending CONNECT
+
+  headers[HTTP2_HEADER_PATH] = path
+  headers[HTTP2_HEADER_SCHEME] = 'https'
+
+  // https://tools.ietf.org/html/rfc7231#section-4.3.1
+  // https://tools.ietf.org/html/rfc7231#section-4.3.2
+  // https://tools.ietf.org/html/rfc7231#section-4.3.5
+
+  // Sending a payload body on a request that does not
+  // expect it can cause undefined behavior on some
+  // servers and corrupt connection state. Do not
+  // re-use the connection for further requests.
+
+  const expectsPayload = (
+    method === 'PUT' ||
+    method === 'POST' ||
+    method === 'PATCH'
+  )
+
+  if (body && typeof body.read === 'function') {
+    // Try to read EOF in order to get length.
+    body.read(0)
+  }
+
+  let contentLength = util.bodyLength(body)
+
+  if (contentLength == null) {
+    contentLength = request.contentLength
+  }
+
+  if (contentLength === 0 || !expectsPayload) {
+    // https://tools.ietf.org/html/rfc7230#section-3.3.2
+    // A user agent SHOULD NOT send a Content-Length header field when
+    // the request message does not contain a payload body and the method
+    // semantics do not anticipate such a body.
+
+    contentLength = null
+  }
+
+  if (request.contentLength != null && request.contentLength !== contentLength) {
+    if (client[kStrictContentLength]) {
+      errorRequest(client, request, new RequestContentLengthMismatchError())
+      return false
+    }
+
+    process.emitWarning(new RequestContentLengthMismatchError())
+  }
+
+  if (contentLength != null) {
+    assert(body, 'no body must not have content length')
+    headers[HTTP2_HEADER_CONTENT_LENGTH] = `${contentLength}`
+  }
+
+  session.ref()
+
+  const shouldEndStream = method === 'GET' || method === 'HEAD'
+  if (expectContinue) {
+    headers[HTTP2_HEADER_EXPECT] = '100-continue'
+    /**
+     * @type {import('node:http2').ClientHttp2Stream}
+     */
+    stream = session.request(headers, { endStream: shouldEndStream, signal })
+
+    stream.once('continue', writeBodyH2)
+  } else {
+    /** @type {import('node:http2').ClientHttp2Stream} */
+    stream = session.request(headers, {
+      endStream: shouldEndStream,
+      signal
+    })
+    writeBodyH2()
+  }
+
+  // Increment counter as we have new several streams open
+  ++h2State.openStreams
+
+  stream.once('response', headers => {
+    if (request.onHeaders(Number(headers[HTTP2_HEADER_STATUS]), headers, stream.resume.bind(stream), '') === false) {
+      stream.pause()
+    }
+  })
+
+  stream.once('end', () => {
+    request.onComplete([])
+  })
+
+  stream.on('data', (chunk) => {
+    if (request.onData(chunk) === false) stream.pause()
+  })
+
+  stream.once('close', () => {
+    h2State.openStreams -= 1
+    // TODO(HTTP/2): unref only if current streams count is 0
+    if (h2State.openStreams === 0) session.unref()
+  })
+
+  stream.once('error', function (err) {
+    if (client[kHTTP2Session] && !client[kHTTP2Session].destroyed && !this.closed && !this.destroyed) {
+      h2State.streams -= 1
+      util.destroy(stream, err)
+    }
+  })
+
+  stream.once('frameError', (type, code) => {
+    const err = new InformationalError(`HTTP/2: "frameError" received - type ${type}, code ${code}`)
+    errorRequest(client, request, err)
+
+    if (client[kHTTP2Session] && !client[kHTTP2Session].destroyed && !this.closed && !this.destroyed) {
+      h2State.streams -= 1
+      util.destroy(stream, err)
+    }
+  })
+
+  // stream.on('aborted', () => {
+  //   // TODO(HTTP/2): Support aborted
+  // })
+
+  // stream.on('timeout', () => {
+  //   // TODO(HTTP/2): Support timeout
+  // })
+
+  // stream.on('push', headers => {
+  //   // TODO(HTTP/2): Suppor push
+  // })
+
+  // stream.on('trailers', headers => {
+  //   // TODO(HTTP/2): Support trailers
+  // })
+
+  return true
+
+  function writeBodyH2 () {
+    /* istanbul ignore else: assertion */
+    if (!body) {
+      request.onRequestSent()
+    } else if (util.isBuffer(body)) {
+      assert(contentLength === body.byteLength, 'buffer body must have content length')
+      stream.cork()
+      stream.write(body)
+      stream.uncork()
+      stream.end()
+      request.onBodySent(body)
+      request.onRequestSent()
+    } else if (util.isBlobLike(body)) {
+      if (typeof body.stream === 'function') {
+        writeIterable({
+          client,
+          request,
+          contentLength,
+          h2stream: stream,
+          expectsPayload,
+          body: body.stream(),
+          socket: client[kSocket],
+          header: ''
+        })
+      } else {
+        writeBlob({
+          body,
+          client,
+          request,
+          contentLength,
+          expectsPayload,
+          h2stream: stream,
+          header: '',
+          socket: client[kSocket]
+        })
+      }
+    } else if (util.isStream(body)) {
+      writeStream({
+        body,
+        client,
+        request,
+        contentLength,
+        expectsPayload,
+        socket: client[kSocket],
+        h2stream: stream,
+        header: ''
+      })
+    } else if (util.isIterable(body)) {
+      writeIterable({
+        body,
+        client,
+        request,
+        contentLength,
+        expectsPayload,
+        header: '',
+        h2stream: stream,
+        socket: client[kSocket]
+      })
+    } else {
+      assert(false)
+    }
+  }
+}
+
+function writeStream ({ h2stream, body, client, request, socket, contentLength, header, expectsPayload }) {
   assert(contentLength !== 0 || client[kRunning] === 0, 'stream body cannot be pipelined')
 
+  if (client[kHTTPConnVersion] === 'h2') {
+    // For HTTP/2, is enough to pipe the stream
+    const pipe = pipeline(
+      body,
+      h2stream,
+      (err) => {
+        if (err) {
+          util.destroy(body, err)
+          util.destroy(h2stream, err)
+        } else {
+          request.onRequestSent()
+        }
+      }
+    )
+
+    pipe.on('data', onPipeData)
+    pipe.once('end', () => {
+      pipe.removeListener('data', onPipeData)
+      util.destroy(pipe)
+    })
+
+    function onPipeData (chunk) {
+      request.onBodySent(chunk)
+    }
+
+    return
+  }
+
   let finished = false
 
   const writer = new AsyncWriter({ socket, request, contentLength, client, expectsPayload, header })
@@ -1572,9 +2028,10 @@ function writeStream ({ body, client, request, socket, contentLength, header, ex
     .on('error', onFinished)
 }
 
-async function writeBlob ({ body, client, request, socket, contentLength, header, expectsPayload }) {
+async function writeBlob ({ h2stream, body, client, request, socket, contentLength, header, expectsPayload }) {
   assert(contentLength === body.size, 'blob body must have content length')
 
+  const isH2 = client[kHTTPConnVersion] === 'h2'
   try {
     if (contentLength != null && contentLength !== body.size) {
       throw new RequestContentLengthMismatchError()
@@ -1582,10 +2039,16 @@ async function writeBlob ({ body, client, request, socket, contentLength, header
 
     const buffer = Buffer.from(await body.arrayBuffer())
 
-    socket.cork()
-    socket.write(`${header}content-length: ${contentLength}\r\n\r\n`, 'latin1')
-    socket.write(buffer)
-    socket.uncork()
+    if (isH2) {
+      h2stream.cork()
+      h2stream.write(buffer)
+      h2stream.uncork()
+    } else {
+      socket.cork()
+      socket.write(`${header}content-length: ${contentLength}\r\n\r\n`, 'latin1')
+      socket.write(buffer)
+      socket.uncork()
+    }
 
     request.onBodySent(buffer)
     request.onRequestSent()
@@ -1596,11 +2059,11 @@ async function writeBlob ({ body, client, request, socket, contentLength, header
 
     resume(client)
   } catch (err) {
-    util.destroy(socket, err)
+    util.destroy(isH2 ? h2stream : socket, err)
   }
 }
 
-async function writeIterable ({ body, client, request, socket, contentLength, header, expectsPayload }) {
+async function writeIterable ({ h2stream, body, client, request, socket, contentLength, header, expectsPayload }) {
   assert(contentLength !== 0 || client[kRunning] === 0, 'iterator body cannot be pipelined')
 
   let callback = null
@@ -1622,6 +2085,37 @@ async function writeIterable ({ body, client, request, socket, contentLength, he
     }
   })
 
+  if (client[kHTTPConnVersion] === 'h2') {
+    h2stream
+      .on('close', onDrain)
+      .on('drain', onDrain)
+
+    try {
+      // It's up to the user to somehow abort the async iterable.
+      for await (const chunk of body) {
+        if (socket[kError]) {
+          throw socket[kError]
+        }
+
+        const res = h2stream.write(chunk)
+        request.onBodySent(chunk)
+        if (!res) {
+          await waitForDrain()
+        }
+      }
+    } catch (err) {
+      h2stream.destroy(err)
+    } finally {
+      request.onRequestSent()
+      h2stream.end()
+      h2stream
+        .off('close', onDrain)
+        .off('drain', onDrain)
+    }
+
+    return
+  }
+
   socket
     .on('close', onDrain)
     .on('drain', onDrain)
diff --git a/deps/undici/src/lib/compat/dispatcher-weakref.js b/deps/undici/src/lib/compat/dispatcher-weakref.js
index dbca8580404ebf..8cb99e21501dea 100644
--- a/deps/undici/src/lib/compat/dispatcher-weakref.js
+++ b/deps/undici/src/lib/compat/dispatcher-weakref.js
@@ -22,15 +22,25 @@ class CompatFinalizer {
   }
 
   register (dispatcher, key) {
-    dispatcher.on('disconnect', () => {
-      if (dispatcher[kConnected] === 0 && dispatcher[kSize] === 0) {
-        this.finalizer(key)
-      }
-    })
+    if (dispatcher.on) {
+      dispatcher.on('disconnect', () => {
+        if (dispatcher[kConnected] === 0 && dispatcher[kSize] === 0) {
+          this.finalizer(key)
+        }
+      })
+    }
   }
 }
 
 module.exports = function () {
+  // FIXME: remove workaround when the Node bug is fixed
+  // https://github.com/nodejs/node/issues/49344#issuecomment-1741776308
+  if (process.env.NODE_V8_COVERAGE) {
+    return {
+      WeakRef: CompatWeakRef,
+      FinalizationRegistry: CompatFinalizer
+    }
+  }
   return {
     WeakRef: global.WeakRef || CompatWeakRef,
     FinalizationRegistry: global.FinalizationRegistry || CompatFinalizer
diff --git a/deps/undici/src/lib/core/connect.js b/deps/undici/src/lib/core/connect.js
index f3b5cc33edd6cf..33091173fa8dbc 100644
--- a/deps/undici/src/lib/core/connect.js
+++ b/deps/undici/src/lib/core/connect.js
@@ -13,7 +13,9 @@ let tls // include tls conditionally since it is not always available
 // re-use is enabled.
 
 let SessionCache
-if (global.FinalizationRegistry) {
+// FIXME: remove workaround when the Node bug is fixed
+// https://github.com/nodejs/node/issues/49344#issuecomment-1741776308
+if (global.FinalizationRegistry && !process.env.NODE_V8_COVERAGE) {
   SessionCache = class WeakSessionCache {
     constructor (maxCachedSessions) {
       this._maxCachedSessions = maxCachedSessions
@@ -71,7 +73,7 @@ if (global.FinalizationRegistry) {
   }
 }
 
-function buildConnector ({ maxCachedSessions, socketPath, timeout, ...opts }) {
+function buildConnector ({ allowH2, maxCachedSessions, socketPath, timeout, ...opts }) {
   if (maxCachedSessions != null && (!Number.isInteger(maxCachedSessions) || maxCachedSessions < 0)) {
     throw new InvalidArgumentError('maxCachedSessions must be a positive integer or zero')
   }
@@ -79,7 +81,7 @@ function buildConnector ({ maxCachedSessions, socketPath, timeout, ...opts }) {
   const options = { path: socketPath, ...opts }
   const sessionCache = new SessionCache(maxCachedSessions == null ? 100 : maxCachedSessions)
   timeout = timeout == null ? 10e3 : timeout
-
+  allowH2 = allowH2 != null ? allowH2 : false
   return function connect ({ hostname, host, protocol, port, servername, localAddress, httpSocket }, callback) {
     let socket
     if (protocol === 'https:') {
@@ -99,6 +101,8 @@ function buildConnector ({ maxCachedSessions, socketPath, timeout, ...opts }) {
         servername,
         session,
         localAddress,
+        // TODO(HTTP/2): Add support for h2c
+        ALPNProtocols: allowH2 ? ['http/1.1', 'h2'] : ['http/1.1'],
         socket: httpSocket, // upgrade socket connection
         port: port || 443,
         host: hostname
diff --git a/deps/undici/src/lib/core/request.js b/deps/undici/src/lib/core/request.js
index 6c9a24d5d590d7..50be01c0dc8355 100644
--- a/deps/undici/src/lib/core/request.js
+++ b/deps/undici/src/lib/core/request.js
@@ -5,6 +5,7 @@ const {
   NotSupportedError
 } = require('./errors')
 const assert = require('assert')
+const { kHTTP2BuildRequest, kHTTP2CopyHeaders, kHTTP1BuildRequest } = require('./symbols')
 const util = require('./util')
 
 // tokenRegExp and headerCharRegex have been lifted from
@@ -62,7 +63,8 @@ class Request {
     headersTimeout,
     bodyTimeout,
     reset,
-    throwOnError
+    throwOnError,
+    expectContinue
   }, handler) {
     if (typeof path !== 'string') {
       throw new InvalidArgumentError('path must be a string')
@@ -98,6 +100,10 @@ class Request {
       throw new InvalidArgumentError('invalid reset')
     }
 
+    if (expectContinue != null && typeof expectContinue !== 'boolean') {
+      throw new InvalidArgumentError('invalid expectContinue')
+    }
+
     this.headersTimeout = headersTimeout
 
     this.bodyTimeout = bodyTimeout
@@ -150,6 +156,9 @@ class Request {
 
     this.headers = ''
 
+    // Only for H2
+    this.expectContinue = expectContinue != null ? expectContinue : false
+
     if (Array.isArray(headers)) {
       if (headers.length % 2 !== 0) {
         throw new InvalidArgumentError('headers array must be even')
@@ -269,13 +278,64 @@ class Request {
     return this[kHandler].onError(error)
   }
 
+  // TODO: adjust to support H2
   addHeader (key, value) {
     processHeader(this, key, value)
     return this
   }
+
+  static [kHTTP1BuildRequest] (origin, opts, handler) {
+    // TODO: Migrate header parsing here, to make Requests
+    // HTTP agnostic
+    return new Request(origin, opts, handler)
+  }
+
+  static [kHTTP2BuildRequest] (origin, opts, handler) {
+    const headers = opts.headers
+    opts = { ...opts, headers: null }
+
+    const request = new Request(origin, opts, handler)
+
+    request.headers = {}
+
+    if (Array.isArray(headers)) {
+      if (headers.length % 2 !== 0) {
+        throw new InvalidArgumentError('headers array must be even')
+      }
+      for (let i = 0; i < headers.length; i += 2) {
+        processHeader(request, headers[i], headers[i + 1], true)
+      }
+    } else if (headers && typeof headers === 'object') {
+      const keys = Object.keys(headers)
+      for (let i = 0; i < keys.length; i++) {
+        const key = keys[i]
+        processHeader(request, key, headers[key], true)
+      }
+    } else if (headers != null) {
+      throw new InvalidArgumentError('headers must be an object or an array')
+    }
+
+    return request
+  }
+
+  static [kHTTP2CopyHeaders] (raw) {
+    const rawHeaders = raw.split('\r\n')
+    const headers = {}
+
+    for (const header of rawHeaders) {
+      const [key, value] = header.split(': ')
+
+      if (value == null || value.length === 0) continue
+
+      if (headers[key]) headers[key] += `,${value}`
+      else headers[key] = value
+    }
+
+    return headers
+  }
 }
 
-function processHeaderValue (key, val) {
+function processHeaderValue (key, val, skipAppend) {
   if (val && typeof val === 'object') {
     throw new InvalidArgumentError(`invalid ${key} header`)
   }
@@ -286,10 +346,10 @@ function processHeaderValue (key, val) {
     throw new InvalidArgumentError(`invalid ${key} header`)
   }
 
-  return `${key}: ${val}\r\n`
+  return skipAppend ? val : `${key}: ${val}\r\n`
 }
 
-function processHeader (request, key, val) {
+function processHeader (request, key, val, skipAppend = false) {
   if (val && (typeof val === 'object' && !Array.isArray(val))) {
     throw new InvalidArgumentError(`invalid ${key} header`)
   } else if (val === undefined) {
@@ -321,7 +381,8 @@ function processHeader (request, key, val) {
     key.toLowerCase() === 'content-type'
   ) {
     request.contentType = val
-    request.headers += processHeaderValue(key, val)
+    if (skipAppend) request.headers[key] = processHeaderValue(key, val, skipAppend)
+    else request.headers += processHeaderValue(key, val)
   } else if (
     key.length === 17 &&
     key.toLowerCase() === 'transfer-encoding'
@@ -357,10 +418,16 @@ function processHeader (request, key, val) {
   } else {
     if (Array.isArray(val)) {
       for (let i = 0; i < val.length; i++) {
-        request.headers += processHeaderValue(key, val[i])
+        if (skipAppend) {
+          if (request.headers[key]) request.headers[key] += `,${processHeaderValue(key, val[i], skipAppend)}`
+          else request.headers[key] = processHeaderValue(key, val[i], skipAppend)
+        } else {
+          request.headers += processHeaderValue(key, val[i])
+        }
       }
     } else {
-      request.headers += processHeaderValue(key, val)
+      if (skipAppend) request.headers[key] = processHeaderValue(key, val, skipAppend)
+      else request.headers += processHeaderValue(key, val)
     }
   }
 }
diff --git a/deps/undici/src/lib/core/symbols.js b/deps/undici/src/lib/core/symbols.js
index c852107a72af26..c2492f4355fd2a 100644
--- a/deps/undici/src/lib/core/symbols.js
+++ b/deps/undici/src/lib/core/symbols.js
@@ -51,5 +51,11 @@ module.exports = {
   kProxy: Symbol('proxy agent options'),
   kCounter: Symbol('socket request counter'),
   kInterceptors: Symbol('dispatch interceptors'),
-  kMaxResponseSize: Symbol('max response size')
+  kMaxResponseSize: Symbol('max response size'),
+  kHTTP2Session: Symbol('http2Session'),
+  kHTTP2SessionState: Symbol('http2Session state'),
+  kHTTP2BuildRequest: Symbol('http2 build request'),
+  kHTTP1BuildRequest: Symbol('http1 build request'),
+  kHTTP2CopyHeaders: Symbol('http2 copy headers'),
+  kHTTPConnVersion: Symbol('http connection version')
 }
diff --git a/deps/undici/src/lib/core/util.js b/deps/undici/src/lib/core/util.js
index 4f8c1f8f1a1a4a..769811f57f7b8c 100644
--- a/deps/undici/src/lib/core/util.js
+++ b/deps/undici/src/lib/core/util.js
@@ -58,31 +58,31 @@ function parseURL (url) {
     throw new InvalidArgumentError('Invalid URL: The URL argument must be a non-null object.')
   }
 
-  if (url.port != null && url.port !== '' && !Number.isFinite(parseInt(url.port))) {
-    throw new InvalidArgumentError('Invalid URL: port must be a valid integer or a string representation of an integer.')
+  if (!/^https?:/.test(url.origin || url.protocol)) {
+    throw new InvalidArgumentError('Invalid URL protocol: the URL must start with `http:` or `https:`.')
   }
 
-  if (url.path != null && typeof url.path !== 'string') {
-    throw new InvalidArgumentError('Invalid URL path: the path must be a string or null/undefined.')
-  }
+  if (!(url instanceof URL)) {
+    if (url.port != null && url.port !== '' && !Number.isFinite(parseInt(url.port))) {
+      throw new InvalidArgumentError('Invalid URL: port must be a valid integer or a string representation of an integer.')
+    }
 
-  if (url.pathname != null && typeof url.pathname !== 'string') {
-    throw new InvalidArgumentError('Invalid URL pathname: the pathname must be a string or null/undefined.')
-  }
+    if (url.path != null && typeof url.path !== 'string') {
+      throw new InvalidArgumentError('Invalid URL path: the path must be a string or null/undefined.')
+    }
 
-  if (url.hostname != null && typeof url.hostname !== 'string') {
-    throw new InvalidArgumentError('Invalid URL hostname: the hostname must be a string or null/undefined.')
-  }
+    if (url.pathname != null && typeof url.pathname !== 'string') {
+      throw new InvalidArgumentError('Invalid URL pathname: the pathname must be a string or null/undefined.')
+    }
 
-  if (url.origin != null && typeof url.origin !== 'string') {
-    throw new InvalidArgumentError('Invalid URL origin: the origin must be a string or null/undefined.')
-  }
+    if (url.hostname != null && typeof url.hostname !== 'string') {
+      throw new InvalidArgumentError('Invalid URL hostname: the hostname must be a string or null/undefined.')
+    }
 
-  if (!/^https?:/.test(url.origin || url.protocol)) {
-    throw new InvalidArgumentError('Invalid URL protocol: the URL must start with `http:` or `https:`.')
-  }
+    if (url.origin != null && typeof url.origin !== 'string') {
+      throw new InvalidArgumentError('Invalid URL origin: the origin must be a string or null/undefined.')
+    }
 
-  if (!(url instanceof URL)) {
     const port = url.port != null
       ? url.port
       : (url.protocol === 'https:' ? 443 : 80)
@@ -168,7 +168,7 @@ function bodyLength (body) {
     return 0
   } else if (isStream(body)) {
     const state = body._readableState
-    return state && state.ended === true && Number.isFinite(state.length)
+    return state && state.objectMode === false && state.ended === true && Number.isFinite(state.length)
       ? state.length
       : null
   } else if (isBlobLike(body)) {
@@ -199,6 +199,7 @@ function destroy (stream, err) {
       // See: https://github.com/nodejs/node/pull/38505/files
       stream.socket = null
     }
+
     stream.destroy(err)
   } else if (err) {
     process.nextTick((stream, err) => {
@@ -218,6 +219,9 @@ function parseKeepAliveTimeout (val) {
 }
 
 function parseHeaders (headers, obj = {}) {
+  // For H2 support
+  if (!Array.isArray(headers)) return headers
+
   for (let i = 0; i < headers.length; i += 2) {
     const key = headers[i].toString().toLowerCase()
     let val = obj[key]
@@ -355,6 +359,12 @@ function getSocketInfo (socket) {
   }
 }
 
+async function * convertIterableToBuffer (iterable) {
+  for await (const chunk of iterable) {
+    yield Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk)
+  }
+}
+
 let ReadableStream
 function ReadableStreamFrom (iterable) {
   if (!ReadableStream) {
@@ -362,8 +372,7 @@ function ReadableStreamFrom (iterable) {
   }
 
   if (ReadableStream.from) {
-    // https://github.com/whatwg/streams/pull/1083
-    return ReadableStream.from(iterable)
+    return ReadableStream.from(convertIterableToBuffer(iterable))
   }
 
   let iterator
diff --git a/deps/undici/src/lib/fetch/body.js b/deps/undici/src/lib/fetch/body.js
index 0c7b8b65363f43..1d9f17d7e330c6 100644
--- a/deps/undici/src/lib/fetch/body.js
+++ b/deps/undici/src/lib/fetch/body.js
@@ -1,6 +1,6 @@
 'use strict'
 
-const Busboy = require('busboy')
+const Busboy = require('@fastify/busboy')
 const util = require('../core/util')
 const {
   ReadableStreamFrom,
@@ -385,9 +385,9 @@ function bodyMixinMethods (instance) {
         let busboy
 
         try {
-          busboy = Busboy({
+          busboy = new Busboy({
             headers,
-            defParamCharset: 'utf8'
+            preservePath: true
           })
         } catch (err) {
           throw new DOMException(`${err}`, 'AbortError')
@@ -396,8 +396,7 @@ function bodyMixinMethods (instance) {
         busboy.on('field', (name, value) => {
           responseFormData.append(name, value)
         })
-        busboy.on('file', (name, value, info) => {
-          const { filename, encoding, mimeType } = info
+        busboy.on('file', (name, value, filename, encoding, mimeType) => {
           const chunks = []
 
           if (encoding === 'base64' || encoding.toLowerCase() === 'base64') {
@@ -532,7 +531,7 @@ async function specConsumeBody (object, convertBytesToJSValue, instance) {
 
   // 6. Otherwise, fully read object’s body given successSteps,
   //    errorSteps, and object’s relevant global object.
-  fullyReadBody(object[kState].body, successSteps, errorSteps)
+  await fullyReadBody(object[kState].body, successSteps, errorSteps)
 
   // 7. Return promise.
   return promise.promise
diff --git a/deps/undici/src/lib/fetch/global.js b/deps/undici/src/lib/fetch/global.js
index 42282acdfe2572..1df6f1227bc265 100644
--- a/deps/undici/src/lib/fetch/global.js
+++ b/deps/undici/src/lib/fetch/global.js
@@ -9,14 +9,6 @@ function getGlobalOrigin () {
 }
 
 function setGlobalOrigin (newOrigin) {
-  if (
-    newOrigin !== undefined &&
-    typeof newOrigin !== 'string' &&
-    !(newOrigin instanceof URL)
-  ) {
-    throw new Error('Invalid base url')
-  }
-
   if (newOrigin === undefined) {
     Object.defineProperty(globalThis, globalOrigin, {
       value: undefined,
diff --git a/deps/undici/src/lib/fetch/index.js b/deps/undici/src/lib/fetch/index.js
index d615f07ea272d1..5323c30abc8791 100644
--- a/deps/undici/src/lib/fetch/index.js
+++ b/deps/undici/src/lib/fetch/index.js
@@ -1200,6 +1200,10 @@ async function httpRedirectFetch (fetchParams, response) {
   if (!sameOrigin(requestCurrentURL(request), locationURL)) {
     // https://fetch.spec.whatwg.org/#cors-non-wildcard-request-header-name
     request.headersList.delete('authorization')
+
+    // "Cookie" and "Host" are forbidden request-headers, which undici doesn't implement.
+    request.headersList.delete('cookie')
+    request.headersList.delete('host')
   }
 
   // 14. If request’s body is non-null, then set request’s body to the first return
@@ -1344,7 +1348,7 @@ async function httpNetworkOrCacheFetch (
   //    user agents should append `User-Agent`/default `User-Agent` value to
   //    httpRequest’s header list.
   if (!httpRequest.headersList.contains('user-agent')) {
-    httpRequest.headersList.append('user-agent', 'undici')
+    httpRequest.headersList.append('user-agent', typeof esbuildDetection === 'undefined' ? 'undici' : 'node')
   }
 
   //    15. If httpRequest’s cache mode is "default" and httpRequest’s header
@@ -1406,6 +1410,8 @@ async function httpNetworkOrCacheFetch (
     }
   }
 
+  httpRequest.headersList.delete('host')
+
   //    20. If includeCredentials is true, then:
   if (includeCredentials) {
     // 1. If the user agent is not configured to block cookies for httpRequest
@@ -1760,7 +1766,7 @@ async function httpNetworkFetch (
       fetchParams.controller.connection.destroy()
 
       // 2. Return the appropriate network error for fetchParams.
-      return makeAppropriateNetworkError(fetchParams)
+      return makeAppropriateNetworkError(fetchParams, err)
     }
 
     return makeNetworkError(err)
@@ -1979,19 +1985,37 @@ async function httpNetworkFetch (
           let location = ''
 
           const headers = new Headers()
-          for (let n = 0; n < headersList.length; n += 2) {
-            const key = headersList[n + 0].toString('latin1')
-            const val = headersList[n + 1].toString('latin1')
 
-            if (key.toLowerCase() === 'content-encoding') {
-              // https://www.rfc-editor.org/rfc/rfc7231#section-3.1.2.1
-              // "All content-coding values are case-insensitive..."
-              codings = val.toLowerCase().split(',').map((x) => x.trim()).reverse()
-            } else if (key.toLowerCase() === 'location') {
-              location = val
+          // For H2, the headers are a plain JS object
+          // We distinguish between them and iterate accordingly
+          if (Array.isArray(headersList)) {
+            for (let n = 0; n < headersList.length; n += 2) {
+              const key = headersList[n + 0].toString('latin1')
+              const val = headersList[n + 1].toString('latin1')
+              if (key.toLowerCase() === 'content-encoding') {
+                // https://www.rfc-editor.org/rfc/rfc7231#section-3.1.2.1
+                // "All content-coding values are case-insensitive..."
+                codings = val.toLowerCase().split(',').map((x) => x.trim())
+              } else if (key.toLowerCase() === 'location') {
+                location = val
+              }
+
+              headers.append(key, val)
             }
+          } else {
+            const keys = Object.keys(headersList)
+            for (const key of keys) {
+              const val = headersList[key]
+              if (key.toLowerCase() === 'content-encoding') {
+                // https://www.rfc-editor.org/rfc/rfc7231#section-3.1.2.1
+                // "All content-coding values are case-insensitive..."
+                codings = val.toLowerCase().split(',').map((x) => x.trim()).reverse()
+              } else if (key.toLowerCase() === 'location') {
+                location = val
+              }
 
-            headers.append(key, val)
+              headers.append(key, val)
+            }
           }
 
           this.body = new Readable({ read: resume })
diff --git a/deps/undici/src/lib/fetch/response.js b/deps/undici/src/lib/fetch/response.js
index 1029dbef53371f..88deb71a06285e 100644
--- a/deps/undici/src/lib/fetch/response.js
+++ b/deps/undici/src/lib/fetch/response.js
@@ -49,7 +49,7 @@ class Response {
   }
 
   // https://fetch.spec.whatwg.org/#dom-response-json
-  static json (data = undefined, init = {}) {
+  static json (data, init = {}) {
     webidl.argumentLengthCheck(arguments, 1, { header: 'Response.json' })
 
     if (init !== null) {
@@ -426,15 +426,15 @@ function filterResponse (response, type) {
 }
 
 // https://fetch.spec.whatwg.org/#appropriate-network-error
-function makeAppropriateNetworkError (fetchParams) {
+function makeAppropriateNetworkError (fetchParams, err = null) {
   // 1. Assert: fetchParams is canceled.
   assert(isCancelled(fetchParams))
 
   // 2. Return an aborted network error if fetchParams is aborted;
   // otherwise return a network error.
   return isAborted(fetchParams)
-    ? makeNetworkError(new DOMException('The operation was aborted.', 'AbortError'))
-    : makeNetworkError('Request was cancelled.')
+    ? makeNetworkError(Object.assign(new DOMException('The operation was aborted.', 'AbortError'), { cause: err }))
+    : makeNetworkError(Object.assign(new DOMException('Request was cancelled.'), { cause: err }))
 }
 
 // https://whatpr.org/fetch/1392.html#initialize-a-response
diff --git a/deps/undici/src/lib/fetch/util.js b/deps/undici/src/lib/fetch/util.js
index 400687ba2e7d23..fcbba84bc9a8b0 100644
--- a/deps/undici/src/lib/fetch/util.js
+++ b/deps/undici/src/lib/fetch/util.js
@@ -556,16 +556,37 @@ function bytesMatch (bytes, metadataList) {
     const algorithm = item.algo
 
     // 2. Let expectedValue be the val component of item.
-    const expectedValue = item.hash
+    let expectedValue = item.hash
+
+    // See https://github.com/web-platform-tests/wpt/commit/e4c5cc7a5e48093220528dfdd1c4012dc3837a0e
+    // "be liberal with padding". This is annoying, and it's not even in the spec.
+
+    if (expectedValue.endsWith('==')) {
+      expectedValue = expectedValue.slice(0, -2)
+    }
 
     // 3. Let actualValue be the result of applying algorithm to bytes.
-    const actualValue = crypto.createHash(algorithm).update(bytes).digest('base64')
+    let actualValue = crypto.createHash(algorithm).update(bytes).digest('base64')
+
+    if (actualValue.endsWith('==')) {
+      actualValue = actualValue.slice(0, -2)
+    }
 
     // 4. If actualValue is a case-sensitive match for expectedValue,
     //    return true.
     if (actualValue === expectedValue) {
       return true
     }
+
+    let actualBase64URL = crypto.createHash(algorithm).update(bytes).digest('base64url')
+
+    if (actualBase64URL.endsWith('==')) {
+      actualBase64URL = actualBase64URL.slice(0, -2)
+    }
+
+    if (actualBase64URL === expectedValue) {
+      return true
+    }
   }
 
   // 6. Return false.
@@ -812,17 +833,17 @@ function iteratorResult (pair, kind) {
 /**
  * @see https://fetch.spec.whatwg.org/#body-fully-read
  */
-function fullyReadBody (body, processBody, processBodyError) {
+async function fullyReadBody (body, processBody, processBodyError) {
   // 1. If taskDestination is null, then set taskDestination to
   //    the result of starting a new parallel queue.
 
   // 2. Let successSteps given a byte sequence bytes be to queue a
   //    fetch task to run processBody given bytes, with taskDestination.
-  const successSteps = (bytes) => queueMicrotask(() => processBody(bytes))
+  const successSteps = processBody
 
   // 3. Let errorSteps be to queue a fetch task to run processBodyError,
   //    with taskDestination.
-  const errorSteps = (error) => queueMicrotask(() => processBodyError(error))
+  const errorSteps = processBodyError
 
   // 4. Let reader be the result of getting a reader for body’s stream.
   //    If that threw an exception, then run errorSteps with that
@@ -837,7 +858,12 @@ function fullyReadBody (body, processBody, processBodyError) {
   }
 
   // 5. Read all bytes from reader, given successSteps and errorSteps.
-  readAllBytes(reader, successSteps, errorSteps)
+  try {
+    const result = await readAllBytes(reader)
+    successSteps(result)
+  } catch (e) {
+    errorSteps(e)
+  }
 }
 
 /** @type {ReadableStream} */
@@ -906,36 +932,23 @@ function isomorphicEncode (input) {
  * @see https://streams.spec.whatwg.org/#readablestreamdefaultreader-read-all-bytes
  * @see https://streams.spec.whatwg.org/#read-loop
  * @param {ReadableStreamDefaultReader} reader
- * @param {(bytes: Uint8Array) => void} successSteps
- * @param {(error: Error) => void} failureSteps
  */
-async function readAllBytes (reader, successSteps, failureSteps) {
+async function readAllBytes (reader) {
   const bytes = []
   let byteLength = 0
 
   while (true) {
-    let done
-    let chunk
-
-    try {
-      ({ done, value: chunk } = await reader.read())
-    } catch (e) {
-      // 1. Call failureSteps with e.
-      failureSteps(e)
-      return
-    }
+    const { done, value: chunk } = await reader.read()
 
     if (done) {
       // 1. Call successSteps with bytes.
-      successSteps(Buffer.concat(bytes, byteLength))
-      return
+      return Buffer.concat(bytes, byteLength)
     }
 
     // 1. If chunk is not a Uint8Array object, call failureSteps
     //    with a TypeError and abort these steps.
     if (!isUint8Array(chunk)) {
-      failureSteps(new TypeError('Received non-Uint8Array chunk'))
-      return
+      throw new TypeError('Received non-Uint8Array chunk')
     }
 
     // 2. Append the bytes represented by chunk to bytes.
diff --git a/deps/undici/src/lib/pool.js b/deps/undici/src/lib/pool.js
index 93b3158f21a131..08509958069a4f 100644
--- a/deps/undici/src/lib/pool.js
+++ b/deps/undici/src/lib/pool.js
@@ -34,6 +34,7 @@ class Pool extends PoolBase {
     socketPath,
     autoSelectFamily,
     autoSelectFamilyAttemptTimeout,
+    allowH2,
     ...options
   } = {}) {
     super()
@@ -54,6 +55,7 @@ class Pool extends PoolBase {
       connect = buildConnector({
         ...tls,
         maxCachedSessions,
+        allowH2,
         socketPath,
         timeout: connectTimeout == null ? 10e3 : connectTimeout,
         ...(util.nodeHasAutoSelectFamily && autoSelectFamily ? { autoSelectFamily, autoSelectFamilyAttemptTimeout } : undefined),
@@ -66,7 +68,7 @@ class Pool extends PoolBase {
       : []
     this[kConnections] = connections || null
     this[kUrl] = util.parseOrigin(origin)
-    this[kOptions] = { ...util.deepClone(options), connect }
+    this[kOptions] = { ...util.deepClone(options), connect, allowH2 }
     this[kOptions].interceptors = options.interceptors
       ? { ...options.interceptors }
       : undefined
diff --git a/deps/undici/src/lib/websocket/connection.js b/deps/undici/src/lib/websocket/connection.js
index 8c821899f6553e..e0fa69726b4054 100644
--- a/deps/undici/src/lib/websocket/connection.js
+++ b/deps/undici/src/lib/websocket/connection.js
@@ -1,6 +1,5 @@
 'use strict'
 
-const { randomBytes, createHash } = require('crypto')
 const diagnosticsChannel = require('diagnostics_channel')
 const { uid, states } = require('./constants')
 const {
@@ -22,6 +21,14 @@ channels.open = diagnosticsChannel.channel('undici:websocket:open')
 channels.close = diagnosticsChannel.channel('undici:websocket:close')
 channels.socketError = diagnosticsChannel.channel('undici:websocket:socket_error')
 
+/** @type {import('crypto')} */
+let crypto
+try {
+  crypto = require('crypto')
+} catch {
+
+}
+
 /**
  * @see https://websockets.spec.whatwg.org/#concept-websocket-establish
  * @param {URL} url
@@ -66,7 +73,7 @@ function establishWebSocketConnection (url, protocols, ws, onEstablish, options)
   // 5. Let keyValue be a nonce consisting of a randomly selected
   //    16-byte value that has been forgiving-base64-encoded and
   //    isomorphic encoded.
-  const keyValue = randomBytes(16).toString('base64')
+  const keyValue = crypto.randomBytes(16).toString('base64')
 
   // 6. Append (`Sec-WebSocket-Key`, keyValue) to request’s
   //    header list.
@@ -148,7 +155,7 @@ function establishWebSocketConnection (url, protocols, ws, onEstablish, options)
       //    trailing whitespace, the client MUST _Fail the WebSocket
       //    Connection_.
       const secWSAccept = response.headersList.get('Sec-WebSocket-Accept')
-      const digest = createHash('sha1').update(keyValue + uid).digest('base64')
+      const digest = crypto.createHash('sha1').update(keyValue + uid).digest('base64')
       if (secWSAccept !== digest) {
         failWebsocketConnection(ws, 'Incorrect hash received in Sec-WebSocket-Accept header.')
         return
diff --git a/deps/undici/src/lib/websocket/frame.js b/deps/undici/src/lib/websocket/frame.js
index 61bfd3915cecc5..d867ad118b29b8 100644
--- a/deps/undici/src/lib/websocket/frame.js
+++ b/deps/undici/src/lib/websocket/frame.js
@@ -1,15 +1,22 @@
 'use strict'
 
-const { randomBytes } = require('crypto')
 const { maxUnsigned16Bit } = require('./constants')
 
+/** @type {import('crypto')} */
+let crypto
+try {
+  crypto = require('crypto')
+} catch {
+
+}
+
 class WebsocketFrameSend {
   /**
    * @param {Buffer|undefined} data
    */
   constructor (data) {
     this.frameData = data
-    this.maskKey = randomBytes(4)
+    this.maskKey = crypto.randomBytes(4)
   }
 
   createFrame (opcode) {
diff --git a/deps/undici/src/lib/websocket/websocket.js b/deps/undici/src/lib/websocket/websocket.js
index 22ad2fb11a1910..e4aa58f52fc589 100644
--- a/deps/undici/src/lib/websocket/websocket.js
+++ b/deps/undici/src/lib/websocket/websocket.js
@@ -3,6 +3,7 @@
 const { webidl } = require('../fetch/webidl')
 const { DOMException } = require('../fetch/constants')
 const { URLSerializer } = require('../fetch/dataURL')
+const { getGlobalOrigin } = require('../fetch/global')
 const { staticPropertyDescriptors, states, opcodes, emptyBuffer } = require('./constants')
 const {
   kWebSocketURL,
@@ -57,18 +58,28 @@ class WebSocket extends EventTarget {
     url = webidl.converters.USVString(url)
     protocols = options.protocols
 
-    // 1. Let urlRecord be the result of applying the URL parser to url.
+    // 1. Let baseURL be this's relevant settings object's API base URL.
+    const baseURL = getGlobalOrigin()
+
+    // 1. Let urlRecord be the result of applying the URL parser to url with baseURL.
     let urlRecord
 
     try {
-      urlRecord = new URL(url)
+      urlRecord = new URL(url, baseURL)
     } catch (e) {
-      // 2. If urlRecord is failure, then throw a "SyntaxError" DOMException.
+      // 3. If urlRecord is failure, then throw a "SyntaxError" DOMException.
       throw new DOMException(e, 'SyntaxError')
     }
 
-    // 3. If urlRecord’s scheme is not "ws" or "wss", then throw a
-    //    "SyntaxError" DOMException.
+    // 4. If urlRecord’s scheme is "http", then set urlRecord’s scheme to "ws".
+    if (urlRecord.protocol === 'http:') {
+      urlRecord.protocol = 'ws:'
+    } else if (urlRecord.protocol === 'https:') {
+      // 5. Otherwise, if urlRecord’s scheme is "https", set urlRecord’s scheme to "wss".
+      urlRecord.protocol = 'wss:'
+    }
+
+    // 6. If urlRecord’s scheme is not "ws" or "wss", then throw a "SyntaxError" DOMException.
     if (urlRecord.protocol !== 'ws:' && urlRecord.protocol !== 'wss:') {
       throw new DOMException(
         `Expected a ws: or wss: protocol, got ${urlRecord.protocol}`,
@@ -76,19 +87,19 @@ class WebSocket extends EventTarget {
       )
     }
 
-    // 4. If urlRecord’s fragment is non-null, then throw a "SyntaxError"
+    // 7. If urlRecord’s fragment is non-null, then throw a "SyntaxError"
     //    DOMException.
-    if (urlRecord.hash) {
+    if (urlRecord.hash || urlRecord.href.endsWith('#')) {
       throw new DOMException('Got fragment', 'SyntaxError')
     }
 
-    // 5. If protocols is a string, set protocols to a sequence consisting
+    // 8. If protocols is a string, set protocols to a sequence consisting
     //    of just that string.
     if (typeof protocols === 'string') {
       protocols = [protocols]
     }
 
-    // 6. If any of the values in protocols occur more than once or otherwise
+    // 9. If any of the values in protocols occur more than once or otherwise
     //    fail to match the requirements for elements that comprise the value
     //    of `Sec-WebSocket-Protocol` fields as defined by The WebSocket
     //    protocol, then throw a "SyntaxError" DOMException.
@@ -100,12 +111,12 @@ class WebSocket extends EventTarget {
       throw new DOMException('Invalid Sec-WebSocket-Protocol value', 'SyntaxError')
     }
 
-    // 7. Set this's url to urlRecord.
-    this[kWebSocketURL] = urlRecord
+    // 10. Set this's url to urlRecord.
+    this[kWebSocketURL] = new URL(urlRecord.href)
 
-    // 8. Let client be this's relevant settings object.
+    // 11. Let client be this's relevant settings object.
 
-    // 9. Run this step in parallel:
+    // 12. Run this step in parallel:
 
     //    1. Establish a WebSocket connection given urlRecord, protocols,
     //       and client.
diff --git a/deps/undici/src/node_modules/busboy/LICENSE b/deps/undici/src/node_modules/@fastify/busboy/LICENSE
similarity index 100%
rename from deps/undici/src/node_modules/busboy/LICENSE
rename to deps/undici/src/node_modules/@fastify/busboy/LICENSE
diff --git a/deps/undici/src/node_modules/@fastify/busboy/README.md b/deps/undici/src/node_modules/@fastify/busboy/README.md
new file mode 100644
index 00000000000000..c74e618b6d6044
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/README.md
@@ -0,0 +1,271 @@
+# busboy
+
+<div align="center">
+
+[![Build Status](https://github.com/fastify/busboy/workflows/ci/badge.svg)](https://github.com/fastify/busboy/actions)
+[![Coverage Status](https://coveralls.io/repos/fastify/busboy/badge.svg?branch=master)](https://coveralls.io/r/fastify/busboy?branch=master)
+[![js-standard-style](https://img.shields.io/badge/code%20style-standard-brightgreen.svg?style=flat)](https://standardjs.com/)
+[![Security Responsible Disclosure](https://img.shields.io/badge/Security-Responsible%20Disclosure-yellow.svg)](https://github.com/nodejs/security-wg/blob/HEAD/processes/responsible_disclosure_template.md)
+
+</div>
+
+<div align="center">
+
+[![NPM version](https://img.shields.io/npm/v/@fastify/busboy.svg?style=flat)](https://www.npmjs.com/package/@fastify/busboy)
+[![NPM downloads](https://img.shields.io/npm/dm/@fastify/busboy.svg?style=flat)](https://www.npmjs.com/package/@fastify/busboy)
+
+</div>
+
+Description
+===========
+
+A Node.js module for parsing incoming HTML form data.
+
+This is an officially supported fork by [fastify](https://github.com/fastify/) organization of the amazing library [originally created](https://github.com/mscdex/busboy) by Brian White,
+aimed at addressing long-standing issues with it.
+
+Benchmark (Mean time for 500 Kb payload, 2000 cycles, 1000 cycle warmup):
+
+| Library               | Version | Mean time in nanoseconds (less is better) |
+|-----------------------|---------|-------------------------------------------|
+| busboy                | 0.3.1   | `340114`                                  |
+| @fastify/busboy       | 1.0.0   | `270984`                                  |
+
+[Changelog](https://github.com/fastify/busboy/blob/master/CHANGELOG.md) since busboy 0.31.
+
+Requirements
+============
+
+* [Node.js](http://nodejs.org/) 10+
+
+
+Install
+=======
+
+    npm i @fastify/busboy
+
+
+Examples
+========
+
+* Parsing (multipart) with default options:
+
+```javascript
+const http = require('node:http');
+const { inspect } = require('node:util');
+const Busboy = require('busboy');
+
+http.createServer((req, res) => {
+  if (req.method === 'POST') {
+    const busboy = new Busboy({ headers: req.headers });
+    busboy.on('file', (fieldname, file, filename, encoding, mimetype) => {
+      console.log(`File [${fieldname}]: filename: ${filename}, encoding: ${encoding}, mimetype: ${mimetype}`);
+      file.on('data', data => {
+        console.log(`File [${fieldname}] got ${data.length} bytes`);
+      });
+      file.on('end', () => {
+        console.log(`File [${fieldname}] Finished`);
+      });
+    });
+    busboy.on('field', (fieldname, val, fieldnameTruncated, valTruncated, encoding, mimetype) => {
+      console.log(`Field [${fieldname}]: value: ${inspect(val)}`);
+    });
+    busboy.on('finish', () => {
+      console.log('Done parsing form!');
+      res.writeHead(303, { Connection: 'close', Location: '/' });
+      res.end();
+    });
+    req.pipe(busboy);
+  } else if (req.method === 'GET') {
+    res.writeHead(200, { Connection: 'close' });
+    res.end(`<html><head></head><body>
+               <form method="POST" enctype="multipart/form-data">
+                <input type="text" name="textfield"><br>
+                <input type="file" name="filefield"><br>
+                <input type="submit">
+              </form>
+            </body></html>`);
+  }
+}).listen(8000, () => {
+  console.log('Listening for requests');
+});
+
+// Example output, using http://nodejs.org/images/ryan-speaker.jpg as the file:
+//
+// Listening for requests
+// File [filefield]: filename: ryan-speaker.jpg, encoding: binary
+// File [filefield] got 11971 bytes
+// Field [textfield]: value: 'testing! :-)'
+// File [filefield] Finished
+// Done parsing form!
+```
+
+* Save all incoming files to disk:
+
+```javascript
+const http = require('node:http');
+const path = require('node:path');
+const os = require('node:os');
+const fs = require('node:fs');
+
+const Busboy = require('busboy');
+
+http.createServer(function(req, res) {
+  if (req.method === 'POST') {
+    const busboy = new Busboy({ headers: req.headers });
+    busboy.on('file', function(fieldname, file, filename, encoding, mimetype) {
+      var saveTo = path.join(os.tmpdir(), path.basename(fieldname));
+      file.pipe(fs.createWriteStream(saveTo));
+    });
+    busboy.on('finish', function() {
+      res.writeHead(200, { 'Connection': 'close' });
+      res.end("That's all folks!");
+    });
+    return req.pipe(busboy);
+  }
+  res.writeHead(404);
+  res.end();
+}).listen(8000, function() {
+  console.log('Listening for requests');
+});
+```
+
+* Parsing (urlencoded) with default options:
+
+```javascript
+const http = require('node:http');
+const { inspect } = require('node:util');
+
+const Busboy = require('busboy');
+
+http.createServer(function(req, res) {
+  if (req.method === 'POST') {
+    const busboy = new Busboy({ headers: req.headers });
+    busboy.on('file', function(fieldname, file, filename, encoding, mimetype) {
+      console.log('File [' + fieldname + ']: filename: ' + filename);
+      file.on('data', function(data) {
+        console.log('File [' + fieldname + '] got ' + data.length + ' bytes');
+      });
+      file.on('end', function() {
+        console.log('File [' + fieldname + '] Finished');
+      });
+    });
+    busboy.on('field', function(fieldname, val, fieldnameTruncated, valTruncated) {
+      console.log('Field [' + fieldname + ']: value: ' + inspect(val));
+    });
+    busboy.on('finish', function() {
+      console.log('Done parsing form!');
+      res.writeHead(303, { Connection: 'close', Location: '/' });
+      res.end();
+    });
+    req.pipe(busboy);
+  } else if (req.method === 'GET') {
+    res.writeHead(200, { Connection: 'close' });
+    res.end('<html><head></head><body>\
+               <form method="POST">\
+                <input type="text" name="textfield"><br />\
+                <select name="selectfield">\
+                  <option value="1">1</option>\
+                  <option value="10">10</option>\
+                  <option value="100">100</option>\
+                  <option value="9001">9001</option>\
+                </select><br />\
+                <input type="checkbox" name="checkfield">Node.js rules!<br />\
+                <input type="submit">\
+              </form>\
+            </body></html>');
+  }
+}).listen(8000, function() {
+  console.log('Listening for requests');
+});
+
+// Example output:
+//
+// Listening for requests
+// Field [textfield]: value: 'testing! :-)'
+// Field [selectfield]: value: '9001'
+// Field [checkfield]: value: 'on'
+// Done parsing form!
+```
+
+
+API
+===
+
+_Busboy_ is a _Writable_ stream
+
+Busboy (special) events
+-----------------------
+
+* **file**(< _string_ >fieldname, < _ReadableStream_ >stream, < _string_ >filename, < _string_ >transferEncoding, < _string_ >mimeType) - Emitted for each new file form field found. `transferEncoding` contains the 'Content-Transfer-Encoding' value for the file stream. `mimeType` contains the 'Content-Type' value for the file stream.
+    * Note: if you listen for this event, you should always handle the `stream` no matter if you care about the file contents or not (e.g. you can simply just do `stream.resume();` if you want to discard the contents), otherwise the 'finish' event will never fire on the Busboy instance. However, if you don't care about **any** incoming files, you can simply not listen for the 'file' event at all and any/all files will be automatically and safely discarded (these discarded files do still count towards `files` and `parts` limits).
+    * If a configured file size limit was reached, `stream` will both have a boolean property `truncated` (best checked at the end of the stream) and emit a 'limit' event to notify you when this happens.
+    * The property `bytesRead` informs about the number of bytes that have been read so far.
+
+* **field**(< _string_ >fieldname, < _string_ >value, < _boolean_ >fieldnameTruncated, < _boolean_ >valueTruncated, < _string_ >transferEncoding, < _string_ >mimeType) - Emitted for each new non-file field found.
+
+* **partsLimit**() - Emitted when specified `parts` limit has been reached. No more 'file' or 'field' events will be emitted.
+
+* **filesLimit**() - Emitted when specified `files` limit has been reached. No more 'file' events will be emitted.
+
+* **fieldsLimit**() - Emitted when specified `fields` limit has been reached. No more 'field' events will be emitted.
+
+
+Busboy methods
+--------------
+
+* **(constructor)**(< _object_ >config) - Creates and returns a new Busboy instance.
+
+    * The constructor takes the following valid `config` settings:
+
+        * **headers** - _object_ - These are the HTTP headers of the incoming request, which are used by individual parsers.
+
+        * **autoDestroy** - _boolean_ - Whether this stream should automatically call .destroy() on itself after ending. (Default: false).
+
+        * **highWaterMark** - _integer_ - highWaterMark to use for this Busboy instance (Default: WritableStream default).
+
+        * **fileHwm** - _integer_ - highWaterMark to use for file streams (Default: ReadableStream default).
+
+        * **defCharset** - _string_ - Default character set to use when one isn't defined (Default: 'utf8').
+
+        * **preservePath** - _boolean_ - If paths in the multipart 'filename' field shall be preserved. (Default: false).
+
+        * **isPartAFile** - __function__ - Use this function to override the default file detection functionality. It has following parameters:
+
+            * fieldName - __string__ The name of the field.
+
+            * contentType - __string__ The content-type of the part, e.g. `text/plain`, `image/jpeg`, `application/octet-stream`
+
+            * fileName - __string__ The name of a file supplied by the part.
+
+          (Default: `(fieldName, contentType, fileName) => (contentType === 'application/octet-stream' || fileName !== undefined)`)
+
+        * **limits** - _object_ - Various limits on incoming data. Valid properties are:
+
+            * **fieldNameSize** - _integer_ - Max field name size (in bytes) (Default: 100 bytes).
+
+            * **fieldSize** - _integer_ - Max field value size (in bytes) (Default: 1 MiB, which is 1024 x 1024 bytes).
+
+            * **fields** - _integer_ - Max number of non-file fields (Default: Infinity).
+
+            * **fileSize** - _integer_ - For multipart forms, the max file size (in bytes) (Default: Infinity).
+
+            * **files** - _integer_ - For multipart forms, the max number of file fields (Default: Infinity).
+
+            * **parts** - _integer_ - For multipart forms, the max number of parts (fields + files) (Default: Infinity).
+
+            * **headerPairs** - _integer_ - For multipart forms, the max number of header key=>value pairs to parse **Default:** 2000
+
+            * **headerSize** - _integer_ - For multipart forms, the max size of a multipart header **Default:** 81920.
+
+    * The constructor can throw errors:
+
+        * **Busboy expected an options-Object.** - Busboy expected an Object as first parameters.
+
+        * **Busboy expected an options-Object with headers-attribute.** - The first parameter is lacking of a headers-attribute.
+
+        * **Limit $limit is not a valid number** - Busboy expected the desired limit to be of type number. Busboy throws this Error to prevent a potential security issue by falling silently back to the Busboy-defaults. Potential source for this Error can be the direct use of environment variables without transforming them to the type number. 
+
+        * **Unsupported Content-Type.** - The `Content-Type` isn't one Busboy can parse.
+
+        * **Missing Content-Type-header.** - The provided headers don't include `Content-Type` at all.
diff --git a/deps/undici/src/node_modules/streamsearch/LICENSE b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/LICENSE
similarity index 98%
rename from deps/undici/src/node_modules/streamsearch/LICENSE
rename to deps/undici/src/node_modules/@fastify/busboy/deps/dicer/LICENSE
index 9ea90e03922d5e..290762e94f4e2f 100644
--- a/deps/undici/src/node_modules/streamsearch/LICENSE
+++ b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/LICENSE
@@ -1,19 +1,19 @@
-Copyright Brian White. All rights reserved.
-
-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
+Copyright Brian White. All rights reserved.
+
+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.
\ No newline at end of file
diff --git a/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/Dicer.js b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/Dicer.js
new file mode 100644
index 00000000000000..79da160c34238f
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/Dicer.js
@@ -0,0 +1,207 @@
+'use strict'
+
+const WritableStream = require('node:stream').Writable
+const inherits = require('node:util').inherits
+
+const StreamSearch = require('../../streamsearch/sbmh')
+
+const PartStream = require('./PartStream')
+const HeaderParser = require('./HeaderParser')
+
+const DASH = 45
+const B_ONEDASH = Buffer.from('-')
+const B_CRLF = Buffer.from('\r\n')
+const EMPTY_FN = function () {}
+
+function Dicer (cfg) {
+  if (!(this instanceof Dicer)) { return new Dicer(cfg) }
+  WritableStream.call(this, cfg)
+
+  if (!cfg || (!cfg.headerFirst && typeof cfg.boundary !== 'string')) { throw new TypeError('Boundary required') }
+
+  if (typeof cfg.boundary === 'string') { this.setBoundary(cfg.boundary) } else { this._bparser = undefined }
+
+  this._headerFirst = cfg.headerFirst
+
+  this._dashes = 0
+  this._parts = 0
+  this._finished = false
+  this._realFinish = false
+  this._isPreamble = true
+  this._justMatched = false
+  this._firstWrite = true
+  this._inHeader = true
+  this._part = undefined
+  this._cb = undefined
+  this._ignoreData = false
+  this._partOpts = { highWaterMark: cfg.partHwm }
+  this._pause = false
+
+  const self = this
+  this._hparser = new HeaderParser(cfg)
+  this._hparser.on('header', function (header) {
+    self._inHeader = false
+    self._part.emit('header', header)
+  })
+}
+inherits(Dicer, WritableStream)
+
+Dicer.prototype.emit = function (ev) {
+  if (ev === 'finish' && !this._realFinish) {
+    if (!this._finished) {
+      const self = this
+      process.nextTick(function () {
+        self.emit('error', new Error('Unexpected end of multipart data'))
+        if (self._part && !self._ignoreData) {
+          const type = (self._isPreamble ? 'Preamble' : 'Part')
+          self._part.emit('error', new Error(type + ' terminated early due to unexpected end of multipart data'))
+          self._part.push(null)
+          process.nextTick(function () {
+            self._realFinish = true
+            self.emit('finish')
+            self._realFinish = false
+          })
+          return
+        }
+        self._realFinish = true
+        self.emit('finish')
+        self._realFinish = false
+      })
+    }
+  } else { WritableStream.prototype.emit.apply(this, arguments) }
+}
+
+Dicer.prototype._write = function (data, encoding, cb) {
+  // ignore unexpected data (e.g. extra trailer data after finished)
+  if (!this._hparser && !this._bparser) { return cb() }
+
+  if (this._headerFirst && this._isPreamble) {
+    if (!this._part) {
+      this._part = new PartStream(this._partOpts)
+      if (this._events.preamble) { this.emit('preamble', this._part) } else { this._ignore() }
+    }
+    const r = this._hparser.push(data)
+    if (!this._inHeader && r !== undefined && r < data.length) { data = data.slice(r) } else { return cb() }
+  }
+
+  // allows for "easier" testing
+  if (this._firstWrite) {
+    this._bparser.push(B_CRLF)
+    this._firstWrite = false
+  }
+
+  this._bparser.push(data)
+
+  if (this._pause) { this._cb = cb } else { cb() }
+}
+
+Dicer.prototype.reset = function () {
+  this._part = undefined
+  this._bparser = undefined
+  this._hparser = undefined
+}
+
+Dicer.prototype.setBoundary = function (boundary) {
+  const self = this
+  this._bparser = new StreamSearch('\r\n--' + boundary)
+  this._bparser.on('info', function (isMatch, data, start, end) {
+    self._oninfo(isMatch, data, start, end)
+  })
+}
+
+Dicer.prototype._ignore = function () {
+  if (this._part && !this._ignoreData) {
+    this._ignoreData = true
+    this._part.on('error', EMPTY_FN)
+    // we must perform some kind of read on the stream even though we are
+    // ignoring the data, otherwise node's Readable stream will not emit 'end'
+    // after pushing null to the stream
+    this._part.resume()
+  }
+}
+
+Dicer.prototype._oninfo = function (isMatch, data, start, end) {
+  let buf; const self = this; let i = 0; let r; let shouldWriteMore = true
+
+  if (!this._part && this._justMatched && data) {
+    while (this._dashes < 2 && (start + i) < end) {
+      if (data[start + i] === DASH) {
+        ++i
+        ++this._dashes
+      } else {
+        if (this._dashes) { buf = B_ONEDASH }
+        this._dashes = 0
+        break
+      }
+    }
+    if (this._dashes === 2) {
+      if ((start + i) < end && this._events.trailer) { this.emit('trailer', data.slice(start + i, end)) }
+      this.reset()
+      this._finished = true
+      // no more parts will be added
+      if (self._parts === 0) {
+        self._realFinish = true
+        self.emit('finish')
+        self._realFinish = false
+      }
+    }
+    if (this._dashes) { return }
+  }
+  if (this._justMatched) { this._justMatched = false }
+  if (!this._part) {
+    this._part = new PartStream(this._partOpts)
+    this._part._read = function (n) {
+      self._unpause()
+    }
+    if (this._isPreamble && this._events.preamble) { this.emit('preamble', this._part) } else if (this._isPreamble !== true && this._events.part) { this.emit('part', this._part) } else { this._ignore() }
+    if (!this._isPreamble) { this._inHeader = true }
+  }
+  if (data && start < end && !this._ignoreData) {
+    if (this._isPreamble || !this._inHeader) {
+      if (buf) { shouldWriteMore = this._part.push(buf) }
+      shouldWriteMore = this._part.push(data.slice(start, end))
+      if (!shouldWriteMore) { this._pause = true }
+    } else if (!this._isPreamble && this._inHeader) {
+      if (buf) { this._hparser.push(buf) }
+      r = this._hparser.push(data.slice(start, end))
+      if (!this._inHeader && r !== undefined && r < end) { this._oninfo(false, data, start + r, end) }
+    }
+  }
+  if (isMatch) {
+    this._hparser.reset()
+    if (this._isPreamble) { this._isPreamble = false } else {
+      if (start !== end) {
+        ++this._parts
+        this._part.on('end', function () {
+          if (--self._parts === 0) {
+            if (self._finished) {
+              self._realFinish = true
+              self.emit('finish')
+              self._realFinish = false
+            } else {
+              self._unpause()
+            }
+          }
+        })
+      }
+    }
+    this._part.push(null)
+    this._part = undefined
+    this._ignoreData = false
+    this._justMatched = true
+    this._dashes = 0
+  }
+}
+
+Dicer.prototype._unpause = function () {
+  if (!this._pause) { return }
+
+  this._pause = false
+  if (this._cb) {
+    const cb = this._cb
+    this._cb = undefined
+    cb()
+  }
+}
+
+module.exports = Dicer
diff --git a/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/HeaderParser.js b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/HeaderParser.js
new file mode 100644
index 00000000000000..65f667b59be8e7
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/HeaderParser.js
@@ -0,0 +1,100 @@
+'use strict'
+
+const EventEmitter = require('node:events').EventEmitter
+const inherits = require('node:util').inherits
+const getLimit = require('../../../lib/utils/getLimit')
+
+const StreamSearch = require('../../streamsearch/sbmh')
+
+const B_DCRLF = Buffer.from('\r\n\r\n')
+const RE_CRLF = /\r\n/g
+const RE_HDR = /^([^:]+):[ \t]?([\x00-\xFF]+)?$/ // eslint-disable-line no-control-regex
+
+function HeaderParser (cfg) {
+  EventEmitter.call(this)
+
+  cfg = cfg || {}
+  const self = this
+  this.nread = 0
+  this.maxed = false
+  this.npairs = 0
+  this.maxHeaderPairs = getLimit(cfg, 'maxHeaderPairs', 2000)
+  this.maxHeaderSize = getLimit(cfg, 'maxHeaderSize', 80 * 1024)
+  this.buffer = ''
+  this.header = {}
+  this.finished = false
+  this.ss = new StreamSearch(B_DCRLF)
+  this.ss.on('info', function (isMatch, data, start, end) {
+    if (data && !self.maxed) {
+      if (self.nread + end - start >= self.maxHeaderSize) {
+        end = self.maxHeaderSize - self.nread + start
+        self.nread = self.maxHeaderSize
+        self.maxed = true
+      } else { self.nread += (end - start) }
+
+      self.buffer += data.toString('binary', start, end)
+    }
+    if (isMatch) { self._finish() }
+  })
+}
+inherits(HeaderParser, EventEmitter)
+
+HeaderParser.prototype.push = function (data) {
+  const r = this.ss.push(data)
+  if (this.finished) { return r }
+}
+
+HeaderParser.prototype.reset = function () {
+  this.finished = false
+  this.buffer = ''
+  this.header = {}
+  this.ss.reset()
+}
+
+HeaderParser.prototype._finish = function () {
+  if (this.buffer) { this._parseHeader() }
+  this.ss.matches = this.ss.maxMatches
+  const header = this.header
+  this.header = {}
+  this.buffer = ''
+  this.finished = true
+  this.nread = this.npairs = 0
+  this.maxed = false
+  this.emit('header', header)
+}
+
+HeaderParser.prototype._parseHeader = function () {
+  if (this.npairs === this.maxHeaderPairs) { return }
+
+  const lines = this.buffer.split(RE_CRLF)
+  const len = lines.length
+  let m, h
+
+  for (var i = 0; i < len; ++i) { // eslint-disable-line no-var
+    if (lines[i].length === 0) { continue }
+    if (lines[i][0] === '\t' || lines[i][0] === ' ') {
+      // folded header content
+      // RFC2822 says to just remove the CRLF and not the whitespace following
+      // it, so we follow the RFC and include the leading whitespace ...
+      if (h) {
+        this.header[h][this.header[h].length - 1] += lines[i]
+        continue
+      }
+    }
+
+    const posColon = lines[i].indexOf(':')
+    if (
+      posColon === -1 ||
+      posColon === 0
+    ) {
+      return
+    }
+    m = RE_HDR.exec(lines[i])
+    h = m[1].toLowerCase()
+    this.header[h] = this.header[h] || []
+    this.header[h].push((m[2] || ''))
+    if (++this.npairs === this.maxHeaderPairs) { break }
+  }
+}
+
+module.exports = HeaderParser
diff --git a/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/PartStream.js b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/PartStream.js
new file mode 100644
index 00000000000000..c91da1c4132129
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/PartStream.js
@@ -0,0 +1,13 @@
+'use strict'
+
+const inherits = require('node:util').inherits
+const ReadableStream = require('node:stream').Readable
+
+function PartStream (opts) {
+  ReadableStream.call(this, opts)
+}
+inherits(PartStream, ReadableStream)
+
+PartStream.prototype._read = function (n) {}
+
+module.exports = PartStream
diff --git a/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/dicer.d.ts b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/dicer.d.ts
new file mode 100644
index 00000000000000..3c5b8962d99b33
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/deps/dicer/lib/dicer.d.ts
@@ -0,0 +1,164 @@
+// Type definitions for dicer 0.2
+// Project: https://github.com/mscdex/dicer
+// Definitions by: BendingBender <https://github.com/BendingBender>
+// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped
+// TypeScript Version: 2.2
+/// <reference types="node" />
+
+import stream = require("stream");
+
+// tslint:disable:unified-signatures
+
+/**
+ * A very fast streaming multipart parser for node.js.
+ * Dicer is a WritableStream
+ *
+ * Dicer (special) events:
+ * - on('finish', ()) - Emitted when all parts have been parsed and the Dicer instance has been ended.
+ * - on('part', (stream: PartStream)) - Emitted when a new part has been found.
+ * - on('preamble', (stream: PartStream)) - Emitted for preamble if you should happen to need it (can usually be ignored).
+ * - on('trailer', (data: Buffer)) - Emitted when trailing data was found after the terminating boundary (as with the preamble, this can usually be ignored too).
+ */
+export class Dicer extends stream.Writable {
+    /**
+     * Creates and returns a new Dicer instance with the following valid config settings:
+     *
+     * @param config The configuration to use
+     */
+    constructor(config: Dicer.Config);
+    /**
+     * Sets the boundary to use for parsing and performs some initialization needed for parsing.
+     * You should only need to use this if you set headerFirst to true in the constructor and are parsing the boundary from the preamble header.
+     *
+     * @param boundary The boundary to use
+     */
+    setBoundary(boundary: string): void;
+    addListener(event: "finish", listener: () => void): this;
+    addListener(event: "part", listener: (stream: Dicer.PartStream) => void): this;
+    addListener(event: "preamble", listener: (stream: Dicer.PartStream) => void): this;
+    addListener(event: "trailer", listener: (data: Buffer) => void): this;
+    addListener(event: "close", listener: () => void): this;
+    addListener(event: "drain", listener: () => void): this;
+    addListener(event: "error", listener: (err: Error) => void): this;
+    addListener(event: "pipe", listener: (src: stream.Readable) => void): this;
+    addListener(event: "unpipe", listener: (src: stream.Readable) => void): this;
+    addListener(event: string, listener: (...args: any[]) => void): this;
+    on(event: "finish", listener: () => void): this;
+    on(event: "part", listener: (stream: Dicer.PartStream) => void): this;
+    on(event: "preamble", listener: (stream: Dicer.PartStream) => void): this;
+    on(event: "trailer", listener: (data: Buffer) => void): this;
+    on(event: "close", listener: () => void): this;
+    on(event: "drain", listener: () => void): this;
+    on(event: "error", listener: (err: Error) => void): this;
+    on(event: "pipe", listener: (src: stream.Readable) => void): this;
+    on(event: "unpipe", listener: (src: stream.Readable) => void): this;
+    on(event: string, listener: (...args: any[]) => void): this;
+    once(event: "finish", listener: () => void): this;
+    once(event: "part", listener: (stream: Dicer.PartStream) => void): this;
+    once(event: "preamble", listener: (stream: Dicer.PartStream) => void): this;
+    once(event: "trailer", listener: (data: Buffer) => void): this;
+    once(event: "close", listener: () => void): this;
+    once(event: "drain", listener: () => void): this;
+    once(event: "error", listener: (err: Error) => void): this;
+    once(event: "pipe", listener: (src: stream.Readable) => void): this;
+    once(event: "unpipe", listener: (src: stream.Readable) => void): this;
+    once(event: string, listener: (...args: any[]) => void): this;
+    prependListener(event: "finish", listener: () => void): this;
+    prependListener(event: "part", listener: (stream: Dicer.PartStream) => void): this;
+    prependListener(event: "preamble", listener: (stream: Dicer.PartStream) => void): this;
+    prependListener(event: "trailer", listener: (data: Buffer) => void): this;
+    prependListener(event: "close", listener: () => void): this;
+    prependListener(event: "drain", listener: () => void): this;
+    prependListener(event: "error", listener: (err: Error) => void): this;
+    prependListener(event: "pipe", listener: (src: stream.Readable) => void): this;
+    prependListener(event: "unpipe", listener: (src: stream.Readable) => void): this;
+    prependListener(event: string, listener: (...args: any[]) => void): this;
+    prependOnceListener(event: "finish", listener: () => void): this;
+    prependOnceListener(event: "part", listener: (stream: Dicer.PartStream) => void): this;
+    prependOnceListener(event: "preamble", listener: (stream: Dicer.PartStream) => void): this;
+    prependOnceListener(event: "trailer", listener: (data: Buffer) => void): this;
+    prependOnceListener(event: "close", listener: () => void): this;
+    prependOnceListener(event: "drain", listener: () => void): this;
+    prependOnceListener(event: "error", listener: (err: Error) => void): this;
+    prependOnceListener(event: "pipe", listener: (src: stream.Readable) => void): this;
+    prependOnceListener(event: "unpipe", listener: (src: stream.Readable) => void): this;
+    prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+    removeListener(event: "finish", listener: () => void): this;
+    removeListener(event: "part", listener: (stream: Dicer.PartStream) => void): this;
+    removeListener(event: "preamble", listener: (stream: Dicer.PartStream) => void): this;
+    removeListener(event: "trailer", listener: (data: Buffer) => void): this;
+    removeListener(event: "close", listener: () => void): this;
+    removeListener(event: "drain", listener: () => void): this;
+    removeListener(event: "error", listener: (err: Error) => void): this;
+    removeListener(event: "pipe", listener: (src: stream.Readable) => void): this;
+    removeListener(event: "unpipe", listener: (src: stream.Readable) => void): this;
+    removeListener(event: string, listener: (...args: any[]) => void): this;
+}
+
+declare namespace Dicer {
+    interface Config {
+        /**
+         * This is the boundary used to detect the beginning of a new part.
+         */
+        boundary?: string | undefined;
+        /**
+         * If true, preamble header parsing will be performed first.
+         */
+        headerFirst?: boolean | undefined;
+        /**
+         * The maximum number of header key=>value pairs to parse Default: 2000 (same as node's http).
+         */
+        maxHeaderPairs?: number | undefined;
+    }
+
+    /**
+     * PartStream is a _ReadableStream_
+     *
+     * PartStream (special) events:
+     * - on('header', (header: object)) - An object containing the header for this particular part. Each property value is an array of one or more string values.
+     */
+    interface PartStream extends stream.Readable {
+        addListener(event: "header", listener: (header: object) => void): this;
+        addListener(event: "close", listener: () => void): this;
+        addListener(event: "data", listener: (chunk: Buffer | string) => void): this;
+        addListener(event: "end", listener: () => void): this;
+        addListener(event: "readable", listener: () => void): this;
+        addListener(event: "error", listener: (err: Error) => void): this;
+        addListener(event: string, listener: (...args: any[]) => void): this;
+        on(event: "header", listener: (header: object) => void): this;
+        on(event: "close", listener: () => void): this;
+        on(event: "data", listener: (chunk: Buffer | string) => void): this;
+        on(event: "end", listener: () => void): this;
+        on(event: "readable", listener: () => void): this;
+        on(event: "error", listener: (err: Error) => void): this;
+        on(event: string, listener: (...args: any[]) => void): this;
+        once(event: "header", listener: (header: object) => void): this;
+        once(event: "close", listener: () => void): this;
+        once(event: "data", listener: (chunk: Buffer | string) => void): this;
+        once(event: "end", listener: () => void): this;
+        once(event: "readable", listener: () => void): this;
+        once(event: "error", listener: (err: Error) => void): this;
+        once(event: string, listener: (...args: any[]) => void): this;
+        prependListener(event: "header", listener: (header: object) => void): this;
+        prependListener(event: "close", listener: () => void): this;
+        prependListener(event: "data", listener: (chunk: Buffer | string) => void): this;
+        prependListener(event: "end", listener: () => void): this;
+        prependListener(event: "readable", listener: () => void): this;
+        prependListener(event: "error", listener: (err: Error) => void): this;
+        prependListener(event: string, listener: (...args: any[]) => void): this;
+        prependOnceListener(event: "header", listener: (header: object) => void): this;
+        prependOnceListener(event: "close", listener: () => void): this;
+        prependOnceListener(event: "data", listener: (chunk: Buffer | string) => void): this;
+        prependOnceListener(event: "end", listener: () => void): this;
+        prependOnceListener(event: "readable", listener: () => void): this;
+        prependOnceListener(event: "error", listener: (err: Error) => void): this;
+        prependOnceListener(event: string, listener: (...args: any[]) => void): this;
+        removeListener(event: "header", listener: (header: object) => void): this;
+        removeListener(event: "close", listener: () => void): this;
+        removeListener(event: "data", listener: (chunk: Buffer | string) => void): this;
+        removeListener(event: "end", listener: () => void): this;
+        removeListener(event: "readable", listener: () => void): this;
+        removeListener(event: "error", listener: (err: Error) => void): this;
+        removeListener(event: string, listener: (...args: any[]) => void): this;
+    }
+}
\ No newline at end of file
diff --git a/deps/undici/src/node_modules/@fastify/busboy/deps/streamsearch/sbmh.js b/deps/undici/src/node_modules/@fastify/busboy/deps/streamsearch/sbmh.js
new file mode 100644
index 00000000000000..b90c0e862b4062
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/deps/streamsearch/sbmh.js
@@ -0,0 +1,228 @@
+'use strict'
+
+/**
+ * Copyright Brian White. All rights reserved.
+ *
+ * @see https://github.com/mscdex/streamsearch
+ *
+ * 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.
+ *
+ * Based heavily on the Streaming Boyer-Moore-Horspool C++ implementation
+ * by Hongli Lai at: https://github.com/FooBarWidget/boyer-moore-horspool
+ */
+const EventEmitter = require('node:events').EventEmitter
+const inherits = require('node:util').inherits
+
+function SBMH (needle) {
+  if (typeof needle === 'string') {
+    needle = Buffer.from(needle)
+  }
+
+  if (!Buffer.isBuffer(needle)) {
+    throw new TypeError('The needle has to be a String or a Buffer.')
+  }
+
+  const needleLength = needle.length
+
+  if (needleLength === 0) {
+    throw new Error('The needle cannot be an empty String/Buffer.')
+  }
+
+  if (needleLength > 256) {
+    throw new Error('The needle cannot have a length bigger than 256.')
+  }
+
+  this.maxMatches = Infinity
+  this.matches = 0
+
+  this._occ = new Array(256)
+    .fill(needleLength) // Initialize occurrence table.
+  this._lookbehind_size = 0
+  this._needle = needle
+  this._bufpos = 0
+
+  this._lookbehind = Buffer.alloc(needleLength)
+
+  // Populate occurrence table with analysis of the needle,
+  // ignoring last letter.
+  for (var i = 0; i < needleLength - 1; ++i) { // eslint-disable-line no-var
+    this._occ[needle[i]] = needleLength - 1 - i
+  }
+}
+inherits(SBMH, EventEmitter)
+
+SBMH.prototype.reset = function () {
+  this._lookbehind_size = 0
+  this.matches = 0
+  this._bufpos = 0
+}
+
+SBMH.prototype.push = function (chunk, pos) {
+  if (!Buffer.isBuffer(chunk)) {
+    chunk = Buffer.from(chunk, 'binary')
+  }
+  const chlen = chunk.length
+  this._bufpos = pos || 0
+  let r
+  while (r !== chlen && this.matches < this.maxMatches) { r = this._sbmh_feed(chunk) }
+  return r
+}
+
+SBMH.prototype._sbmh_feed = function (data) {
+  const len = data.length
+  const needle = this._needle
+  const needleLength = needle.length
+  const lastNeedleChar = needle[needleLength - 1]
+
+  // Positive: points to a position in `data`
+  //           pos == 3 points to data[3]
+  // Negative: points to a position in the lookbehind buffer
+  //           pos == -2 points to lookbehind[lookbehind_size - 2]
+  let pos = -this._lookbehind_size
+  let ch
+
+  if (pos < 0) {
+    // Lookbehind buffer is not empty. Perform Boyer-Moore-Horspool
+    // search with character lookup code that considers both the
+    // lookbehind buffer and the current round's haystack data.
+    //
+    // Loop until
+    //   there is a match.
+    // or until
+    //   we've moved past the position that requires the
+    //   lookbehind buffer. In this case we switch to the
+    //   optimized loop.
+    // or until
+    //   the character to look at lies outside the haystack.
+    while (pos < 0 && pos <= len - needleLength) {
+      ch = this._sbmh_lookup_char(data, pos + needleLength - 1)
+
+      if (
+        ch === lastNeedleChar &&
+        this._sbmh_memcmp(data, pos, needleLength - 1)
+      ) {
+        this._lookbehind_size = 0
+        ++this.matches
+        this.emit('info', true)
+
+        return (this._bufpos = pos + needleLength)
+      }
+      pos += this._occ[ch]
+    }
+
+    // No match.
+
+    if (pos < 0) {
+      // There's too few data for Boyer-Moore-Horspool to run,
+      // so let's use a different algorithm to skip as much as
+      // we can.
+      // Forward pos until
+      //   the trailing part of lookbehind + data
+      //   looks like the beginning of the needle
+      // or until
+      //   pos == 0
+      while (pos < 0 && !this._sbmh_memcmp(data, pos, len - pos)) { ++pos }
+    }
+
+    if (pos >= 0) {
+      // Discard lookbehind buffer.
+      this.emit('info', false, this._lookbehind, 0, this._lookbehind_size)
+      this._lookbehind_size = 0
+    } else {
+      // Cut off part of the lookbehind buffer that has
+      // been processed and append the entire haystack
+      // into it.
+      const bytesToCutOff = this._lookbehind_size + pos
+      if (bytesToCutOff > 0) {
+        // The cut off data is guaranteed not to contain the needle.
+        this.emit('info', false, this._lookbehind, 0, bytesToCutOff)
+      }
+
+      this._lookbehind.copy(this._lookbehind, 0, bytesToCutOff,
+        this._lookbehind_size - bytesToCutOff)
+      this._lookbehind_size -= bytesToCutOff
+
+      data.copy(this._lookbehind, this._lookbehind_size)
+      this._lookbehind_size += len
+
+      this._bufpos = len
+      return len
+    }
+  }
+
+  pos += (pos >= 0) * this._bufpos
+
+  // Lookbehind buffer is now empty. We only need to check if the
+  // needle is in the haystack.
+  if (data.indexOf(needle, pos) !== -1) {
+    pos = data.indexOf(needle, pos)
+    ++this.matches
+    if (pos > 0) { this.emit('info', true, data, this._bufpos, pos) } else { this.emit('info', true) }
+
+    return (this._bufpos = pos + needleLength)
+  } else {
+    pos = len - needleLength
+  }
+
+  // There was no match. If there's trailing haystack data that we cannot
+  // match yet using the Boyer-Moore-Horspool algorithm (because the trailing
+  // data is less than the needle size) then match using a modified
+  // algorithm that starts matching from the beginning instead of the end.
+  // Whatever trailing data is left after running this algorithm is added to
+  // the lookbehind buffer.
+  while (
+    pos < len &&
+    (
+      data[pos] !== needle[0] ||
+      (
+        (Buffer.compare(
+          data.subarray(pos, pos + len - pos),
+          needle.subarray(0, len - pos)
+        ) !== 0)
+      )
+    )
+  ) {
+    ++pos
+  }
+  if (pos < len) {
+    data.copy(this._lookbehind, 0, pos, pos + (len - pos))
+    this._lookbehind_size = len - pos
+  }
+
+  // Everything until pos is guaranteed not to contain needle data.
+  if (pos > 0) { this.emit('info', false, data, this._bufpos, pos < len ? pos : len) }
+
+  this._bufpos = len
+  return len
+}
+
+SBMH.prototype._sbmh_lookup_char = function (data, pos) {
+  return (pos < 0)
+    ? this._lookbehind[this._lookbehind_size + pos]
+    : data[pos]
+}
+
+SBMH.prototype._sbmh_memcmp = function (data, pos, len) {
+  for (var i = 0; i < len; ++i) { // eslint-disable-line no-var
+    if (this._sbmh_lookup_char(data, pos + i) !== this._needle[i]) { return false }
+  }
+  return true
+}
+
+module.exports = SBMH
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/main.d.ts b/deps/undici/src/node_modules/@fastify/busboy/lib/main.d.ts
new file mode 100644
index 00000000000000..91b6448363a712
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/main.d.ts
@@ -0,0 +1,196 @@
+// Definitions by: Jacob Baskin <https://github.com/jacobbaskin>
+//                 BendingBender <https://github.com/BendingBender>
+//                 Igor Savin <https://github.com/kibertoad>
+
+/// <reference types="node" />
+
+import * as http from 'http';
+import { Readable, Writable } from 'stream';
+export { Dicer } from "../deps/dicer/lib/dicer";
+
+export const Busboy: BusboyConstructor;
+export default Busboy;
+
+export interface BusboyConfig {
+    /**
+     * These are the HTTP headers of the incoming request, which are used by individual parsers.
+     */
+    headers: BusboyHeaders;
+    /**
+     * `highWaterMark` to use for this Busboy instance.
+     * @default WritableStream default.
+     */
+    highWaterMark?: number | undefined;
+    /**
+     * highWaterMark to use for file streams.
+     * @default ReadableStream default.
+     */
+    fileHwm?: number | undefined;
+    /**
+     * Default character set to use when one isn't defined.
+     * @default 'utf8'
+     */
+    defCharset?: string | undefined;
+    /**
+     * Detect if a Part is a file.
+     * 
+     * By default a file is detected if contentType 
+     * is application/octet-stream or fileName is not
+     * undefined.
+     * 
+     * Modify this to handle e.g. Blobs.
+     */
+    isPartAFile?: (fieldName: string | undefined, contentType: string | undefined, fileName: string | undefined) => boolean;
+    /**
+     * If paths in the multipart 'filename' field shall be preserved.
+     * @default false
+     */
+    preservePath?: boolean | undefined;
+    /**
+     * Various limits on incoming data.
+     */
+    limits?:
+    | {
+        /**
+         * Max field name size (in bytes)
+         * @default 100 bytes
+         */
+        fieldNameSize?: number | undefined;
+        /**
+         * Max field value size (in bytes)
+         * @default 1MB
+         */
+        fieldSize?: number | undefined;
+        /**
+         * Max number of non-file fields
+         * @default Infinity
+         */
+        fields?: number | undefined;
+        /**
+         * For multipart forms, the max file size (in bytes)
+         * @default Infinity
+         */
+        fileSize?: number | undefined;
+        /**
+         * For multipart forms, the max number of file fields
+         * @default Infinity
+         */
+        files?: number | undefined;
+        /**
+         * For multipart forms, the max number of parts (fields + files)
+         * @default Infinity
+         */
+        parts?: number | undefined;
+        /**
+         * For multipart forms, the max number of header key=>value pairs to parse
+         * @default 2000
+         */
+        headerPairs?: number | undefined;
+
+        /**
+         * For multipart forms, the max size of a header part
+         * @default 81920
+         */
+        headerSize?: number | undefined;
+    }
+    | undefined;
+}
+
+export type BusboyHeaders = { 'content-type': string } & http.IncomingHttpHeaders;
+
+export interface BusboyFileStream extends
+    Readable {
+
+        truncated: boolean;
+
+        /**
+         * The number of bytes that have been read so far.
+         */
+        bytesRead: number;
+}
+
+export interface Busboy extends Writable {
+    addListener<Event extends keyof BusboyEvents>(event: Event, listener: BusboyEvents[Event]): this;
+
+    addListener(event: string | symbol, listener: (...args: any[]) => void): this;
+
+    on<Event extends keyof BusboyEvents>(event: Event, listener: BusboyEvents[Event]): this;
+
+    on(event: string | symbol, listener: (...args: any[]) => void): this;
+
+    once<Event extends keyof BusboyEvents>(event: Event, listener: BusboyEvents[Event]): this;
+
+    once(event: string | symbol, listener: (...args: any[]) => void): this;
+
+    removeListener<Event extends keyof BusboyEvents>(event: Event, listener: BusboyEvents[Event]): this;
+
+    removeListener(event: string | symbol, listener: (...args: any[]) => void): this;
+
+    off<Event extends keyof BusboyEvents>(event: Event, listener: BusboyEvents[Event]): this;
+
+    off(event: string | symbol, listener: (...args: any[]) => void): this;
+
+    prependListener<Event extends keyof BusboyEvents>(event: Event, listener: BusboyEvents[Event]): this;
+
+    prependListener(event: string | symbol, listener: (...args: any[]) => void): this;
+
+    prependOnceListener<Event extends keyof BusboyEvents>(event: Event, listener: BusboyEvents[Event]): this;
+
+    prependOnceListener(event: string | symbol, listener: (...args: any[]) => void): this;
+}
+
+export interface BusboyEvents {
+    /**
+     * Emitted for each new file form field found.
+     *
+     * * Note: if you listen for this event, you should always handle the `stream` no matter if you care about the
+     * file contents or not (e.g. you can simply just do `stream.resume();` if you want to discard the contents),
+     * otherwise the 'finish' event will never fire on the Busboy instance. However, if you don't care about **any**
+     * incoming files, you can simply not listen for the 'file' event at all and any/all files will be automatically
+     * and safely discarded (these discarded files do still count towards `files` and `parts` limits).
+     * * If a configured file size limit was reached, `stream` will both have a boolean property `truncated`
+     * (best checked at the end of the stream) and emit a 'limit' event to notify you when this happens.
+     *
+     * @param listener.transferEncoding Contains the 'Content-Transfer-Encoding' value for the file stream.
+     * @param listener.mimeType Contains the 'Content-Type' value for the file stream.
+     */
+    file: (
+        fieldname: string,
+        stream: BusboyFileStream,
+        filename: string,
+        transferEncoding: string,
+        mimeType: string,
+    ) => void;
+    /**
+     * Emitted for each new non-file field found.
+     */
+    field: (
+        fieldname: string,
+        value: string,
+        fieldnameTruncated: boolean,
+        valueTruncated: boolean,
+        transferEncoding: string,
+        mimeType: string,
+    ) => void;
+    finish: () => void;
+    /**
+     * Emitted when specified `parts` limit has been reached. No more 'file' or 'field' events will be emitted.
+     */
+    partsLimit: () => void;
+    /**
+     *  Emitted when specified `files` limit has been reached. No more 'file' events will be emitted.
+     */
+    filesLimit: () => void;
+    /**
+     * Emitted when specified `fields` limit has been reached. No more 'field' events will be emitted.
+     */
+    fieldsLimit: () => void;
+    error: (error: unknown) => void;
+}
+
+export interface BusboyConstructor {
+    (options: BusboyConfig): Busboy;
+
+    new(options: BusboyConfig): Busboy;
+}
+
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/main.js b/deps/undici/src/node_modules/@fastify/busboy/lib/main.js
new file mode 100644
index 00000000000000..8794bebf2296b5
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/main.js
@@ -0,0 +1,85 @@
+'use strict'
+
+const WritableStream = require('node:stream').Writable
+const { inherits } = require('node:util')
+const Dicer = require('../deps/dicer/lib/Dicer')
+
+const MultipartParser = require('./types/multipart')
+const UrlencodedParser = require('./types/urlencoded')
+const parseParams = require('./utils/parseParams')
+
+function Busboy (opts) {
+  if (!(this instanceof Busboy)) { return new Busboy(opts) }
+
+  if (typeof opts !== 'object') {
+    throw new TypeError('Busboy expected an options-Object.')
+  }
+  if (typeof opts.headers !== 'object') {
+    throw new TypeError('Busboy expected an options-Object with headers-attribute.')
+  }
+  if (typeof opts.headers['content-type'] !== 'string') {
+    throw new TypeError('Missing Content-Type-header.')
+  }
+
+  const {
+    headers,
+    ...streamOptions
+  } = opts
+
+  this.opts = {
+    autoDestroy: false,
+    ...streamOptions
+  }
+  WritableStream.call(this, this.opts)
+
+  this._done = false
+  this._parser = this.getParserByHeaders(headers)
+  this._finished = false
+}
+inherits(Busboy, WritableStream)
+
+Busboy.prototype.emit = function (ev) {
+  if (ev === 'finish') {
+    if (!this._done) {
+      this._parser?.end()
+      return
+    } else if (this._finished) {
+      return
+    }
+    this._finished = true
+  }
+  WritableStream.prototype.emit.apply(this, arguments)
+}
+
+Busboy.prototype.getParserByHeaders = function (headers) {
+  const parsed = parseParams(headers['content-type'])
+
+  const cfg = {
+    defCharset: this.opts.defCharset,
+    fileHwm: this.opts.fileHwm,
+    headers,
+    highWaterMark: this.opts.highWaterMark,
+    isPartAFile: this.opts.isPartAFile,
+    limits: this.opts.limits,
+    parsedConType: parsed,
+    preservePath: this.opts.preservePath
+  }
+
+  if (MultipartParser.detect.test(parsed[0])) {
+    return new MultipartParser(this, cfg)
+  }
+  if (UrlencodedParser.detect.test(parsed[0])) {
+    return new UrlencodedParser(this, cfg)
+  }
+  throw new Error('Unsupported Content-Type.')
+}
+
+Busboy.prototype._write = function (chunk, encoding, cb) {
+  this._parser.write(chunk, cb)
+}
+
+module.exports = Busboy
+module.exports.default = Busboy
+module.exports.Busboy = Busboy
+
+module.exports.Dicer = Dicer
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/types/multipart.js b/deps/undici/src/node_modules/@fastify/busboy/lib/types/multipart.js
new file mode 100644
index 00000000000000..ad242db27a78e3
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/types/multipart.js
@@ -0,0 +1,306 @@
+'use strict'
+
+// TODO:
+//  * support 1 nested multipart level
+//    (see second multipart example here:
+//     http://www.w3.org/TR/html401/interact/forms.html#didx-multipartform-data)
+//  * support limits.fieldNameSize
+//     -- this will require modifications to utils.parseParams
+
+const { Readable } = require('node:stream')
+const { inherits } = require('node:util')
+
+const Dicer = require('../../deps/dicer/lib/Dicer')
+
+const parseParams = require('../utils/parseParams')
+const decodeText = require('../utils/decodeText')
+const basename = require('../utils/basename')
+const getLimit = require('../utils/getLimit')
+
+const RE_BOUNDARY = /^boundary$/i
+const RE_FIELD = /^form-data$/i
+const RE_CHARSET = /^charset$/i
+const RE_FILENAME = /^filename$/i
+const RE_NAME = /^name$/i
+
+Multipart.detect = /^multipart\/form-data/i
+function Multipart (boy, cfg) {
+  let i
+  let len
+  const self = this
+  let boundary
+  const limits = cfg.limits
+  const isPartAFile = cfg.isPartAFile || ((fieldName, contentType, fileName) => (contentType === 'application/octet-stream' || fileName !== undefined))
+  const parsedConType = cfg.parsedConType || []
+  const defCharset = cfg.defCharset || 'utf8'
+  const preservePath = cfg.preservePath
+  const fileOpts = { highWaterMark: cfg.fileHwm }
+
+  for (i = 0, len = parsedConType.length; i < len; ++i) {
+    if (Array.isArray(parsedConType[i]) &&
+      RE_BOUNDARY.test(parsedConType[i][0])) {
+      boundary = parsedConType[i][1]
+      break
+    }
+  }
+
+  function checkFinished () {
+    if (nends === 0 && finished && !boy._done) {
+      finished = false
+      self.end()
+    }
+  }
+
+  if (typeof boundary !== 'string') { throw new Error('Multipart: Boundary not found') }
+
+  const fieldSizeLimit = getLimit(limits, 'fieldSize', 1 * 1024 * 1024)
+  const fileSizeLimit = getLimit(limits, 'fileSize', Infinity)
+  const filesLimit = getLimit(limits, 'files', Infinity)
+  const fieldsLimit = getLimit(limits, 'fields', Infinity)
+  const partsLimit = getLimit(limits, 'parts', Infinity)
+  const headerPairsLimit = getLimit(limits, 'headerPairs', 2000)
+  const headerSizeLimit = getLimit(limits, 'headerSize', 80 * 1024)
+
+  let nfiles = 0
+  let nfields = 0
+  let nends = 0
+  let curFile
+  let curField
+  let finished = false
+
+  this._needDrain = false
+  this._pause = false
+  this._cb = undefined
+  this._nparts = 0
+  this._boy = boy
+
+  const parserCfg = {
+    boundary,
+    maxHeaderPairs: headerPairsLimit,
+    maxHeaderSize: headerSizeLimit,
+    partHwm: fileOpts.highWaterMark,
+    highWaterMark: cfg.highWaterMark
+  }
+
+  this.parser = new Dicer(parserCfg)
+  this.parser.on('drain', function () {
+    self._needDrain = false
+    if (self._cb && !self._pause) {
+      const cb = self._cb
+      self._cb = undefined
+      cb()
+    }
+  }).on('part', function onPart (part) {
+    if (++self._nparts > partsLimit) {
+      self.parser.removeListener('part', onPart)
+      self.parser.on('part', skipPart)
+      boy.hitPartsLimit = true
+      boy.emit('partsLimit')
+      return skipPart(part)
+    }
+
+    // hack because streams2 _always_ doesn't emit 'end' until nextTick, so let
+    // us emit 'end' early since we know the part has ended if we are already
+    // seeing the next part
+    if (curField) {
+      const field = curField
+      field.emit('end')
+      field.removeAllListeners('end')
+    }
+
+    part.on('header', function (header) {
+      let contype
+      let fieldname
+      let parsed
+      let charset
+      let encoding
+      let filename
+      let nsize = 0
+
+      if (header['content-type']) {
+        parsed = parseParams(header['content-type'][0])
+        if (parsed[0]) {
+          contype = parsed[0].toLowerCase()
+          for (i = 0, len = parsed.length; i < len; ++i) {
+            if (RE_CHARSET.test(parsed[i][0])) {
+              charset = parsed[i][1].toLowerCase()
+              break
+            }
+          }
+        }
+      }
+
+      if (contype === undefined) { contype = 'text/plain' }
+      if (charset === undefined) { charset = defCharset }
+
+      if (header['content-disposition']) {
+        parsed = parseParams(header['content-disposition'][0])
+        if (!RE_FIELD.test(parsed[0])) { return skipPart(part) }
+        for (i = 0, len = parsed.length; i < len; ++i) {
+          if (RE_NAME.test(parsed[i][0])) {
+            fieldname = parsed[i][1]
+          } else if (RE_FILENAME.test(parsed[i][0])) {
+            filename = parsed[i][1]
+            if (!preservePath) { filename = basename(filename) }
+          }
+        }
+      } else { return skipPart(part) }
+
+      if (header['content-transfer-encoding']) { encoding = header['content-transfer-encoding'][0].toLowerCase() } else { encoding = '7bit' }
+
+      let onData,
+        onEnd
+
+      if (isPartAFile(fieldname, contype, filename)) {
+        // file/binary field
+        if (nfiles === filesLimit) {
+          if (!boy.hitFilesLimit) {
+            boy.hitFilesLimit = true
+            boy.emit('filesLimit')
+          }
+          return skipPart(part)
+        }
+
+        ++nfiles
+
+        if (!boy._events.file) {
+          self.parser._ignore()
+          return
+        }
+
+        ++nends
+        const file = new FileStream(fileOpts)
+        curFile = file
+        file.on('end', function () {
+          --nends
+          self._pause = false
+          checkFinished()
+          if (self._cb && !self._needDrain) {
+            const cb = self._cb
+            self._cb = undefined
+            cb()
+          }
+        })
+        file._read = function (n) {
+          if (!self._pause) { return }
+          self._pause = false
+          if (self._cb && !self._needDrain) {
+            const cb = self._cb
+            self._cb = undefined
+            cb()
+          }
+        }
+        boy.emit('file', fieldname, file, filename, encoding, contype)
+
+        onData = function (data) {
+          if ((nsize += data.length) > fileSizeLimit) {
+            const extralen = fileSizeLimit - nsize + data.length
+            if (extralen > 0) { file.push(data.slice(0, extralen)) }
+            file.truncated = true
+            file.bytesRead = fileSizeLimit
+            part.removeAllListeners('data')
+            file.emit('limit')
+            return
+          } else if (!file.push(data)) { self._pause = true }
+
+          file.bytesRead = nsize
+        }
+
+        onEnd = function () {
+          curFile = undefined
+          file.push(null)
+        }
+      } else {
+        // non-file field
+        if (nfields === fieldsLimit) {
+          if (!boy.hitFieldsLimit) {
+            boy.hitFieldsLimit = true
+            boy.emit('fieldsLimit')
+          }
+          return skipPart(part)
+        }
+
+        ++nfields
+        ++nends
+        let buffer = ''
+        let truncated = false
+        curField = part
+
+        onData = function (data) {
+          if ((nsize += data.length) > fieldSizeLimit) {
+            const extralen = (fieldSizeLimit - (nsize - data.length))
+            buffer += data.toString('binary', 0, extralen)
+            truncated = true
+            part.removeAllListeners('data')
+          } else { buffer += data.toString('binary') }
+        }
+
+        onEnd = function () {
+          curField = undefined
+          if (buffer.length) { buffer = decodeText(buffer, 'binary', charset) }
+          boy.emit('field', fieldname, buffer, false, truncated, encoding, contype)
+          --nends
+          checkFinished()
+        }
+      }
+
+      /* As of node@2efe4ab761666 (v0.10.29+/v0.11.14+), busboy had become
+         broken. Streams2/streams3 is a huge black box of confusion, but
+         somehow overriding the sync state seems to fix things again (and still
+         seems to work for previous node versions).
+      */
+      part._readableState.sync = false
+
+      part.on('data', onData)
+      part.on('end', onEnd)
+    }).on('error', function (err) {
+      if (curFile) { curFile.emit('error', err) }
+    })
+  }).on('error', function (err) {
+    boy.emit('error', err)
+  }).on('finish', function () {
+    finished = true
+    checkFinished()
+  })
+}
+
+Multipart.prototype.write = function (chunk, cb) {
+  const r = this.parser.write(chunk)
+  if (r && !this._pause) {
+    cb()
+  } else {
+    this._needDrain = !r
+    this._cb = cb
+  }
+}
+
+Multipart.prototype.end = function () {
+  const self = this
+
+  if (self.parser.writable) {
+    self.parser.end()
+  } else if (!self._boy._done) {
+    process.nextTick(function () {
+      self._boy._done = true
+      self._boy.emit('finish')
+    })
+  }
+}
+
+function skipPart (part) {
+  part.resume()
+}
+
+function FileStream (opts) {
+  Readable.call(this, opts)
+
+  this.bytesRead = 0
+
+  this.truncated = false
+}
+
+inherits(FileStream, Readable)
+
+FileStream.prototype._read = function (n) {}
+
+module.exports = Multipart
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/types/urlencoded.js b/deps/undici/src/node_modules/@fastify/busboy/lib/types/urlencoded.js
new file mode 100644
index 00000000000000..6f5f7846d8b14f
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/types/urlencoded.js
@@ -0,0 +1,190 @@
+'use strict'
+
+const Decoder = require('../utils/Decoder')
+const decodeText = require('../utils/decodeText')
+const getLimit = require('../utils/getLimit')
+
+const RE_CHARSET = /^charset$/i
+
+UrlEncoded.detect = /^application\/x-www-form-urlencoded/i
+function UrlEncoded (boy, cfg) {
+  const limits = cfg.limits
+  const parsedConType = cfg.parsedConType
+  this.boy = boy
+
+  this.fieldSizeLimit = getLimit(limits, 'fieldSize', 1 * 1024 * 1024)
+  this.fieldNameSizeLimit = getLimit(limits, 'fieldNameSize', 100)
+  this.fieldsLimit = getLimit(limits, 'fields', Infinity)
+
+  let charset
+  for (var i = 0, len = parsedConType.length; i < len; ++i) { // eslint-disable-line no-var
+    if (Array.isArray(parsedConType[i]) &&
+        RE_CHARSET.test(parsedConType[i][0])) {
+      charset = parsedConType[i][1].toLowerCase()
+      break
+    }
+  }
+
+  if (charset === undefined) { charset = cfg.defCharset || 'utf8' }
+
+  this.decoder = new Decoder()
+  this.charset = charset
+  this._fields = 0
+  this._state = 'key'
+  this._checkingBytes = true
+  this._bytesKey = 0
+  this._bytesVal = 0
+  this._key = ''
+  this._val = ''
+  this._keyTrunc = false
+  this._valTrunc = false
+  this._hitLimit = false
+}
+
+UrlEncoded.prototype.write = function (data, cb) {
+  if (this._fields === this.fieldsLimit) {
+    if (!this.boy.hitFieldsLimit) {
+      this.boy.hitFieldsLimit = true
+      this.boy.emit('fieldsLimit')
+    }
+    return cb()
+  }
+
+  let idxeq; let idxamp; let i; let p = 0; const len = data.length
+
+  while (p < len) {
+    if (this._state === 'key') {
+      idxeq = idxamp = undefined
+      for (i = p; i < len; ++i) {
+        if (!this._checkingBytes) { ++p }
+        if (data[i] === 0x3D/* = */) {
+          idxeq = i
+          break
+        } else if (data[i] === 0x26/* & */) {
+          idxamp = i
+          break
+        }
+        if (this._checkingBytes && this._bytesKey === this.fieldNameSizeLimit) {
+          this._hitLimit = true
+          break
+        } else if (this._checkingBytes) { ++this._bytesKey }
+      }
+
+      if (idxeq !== undefined) {
+        // key with assignment
+        if (idxeq > p) { this._key += this.decoder.write(data.toString('binary', p, idxeq)) }
+        this._state = 'val'
+
+        this._hitLimit = false
+        this._checkingBytes = true
+        this._val = ''
+        this._bytesVal = 0
+        this._valTrunc = false
+        this.decoder.reset()
+
+        p = idxeq + 1
+      } else if (idxamp !== undefined) {
+        // key with no assignment
+        ++this._fields
+        let key; const keyTrunc = this._keyTrunc
+        if (idxamp > p) { key = (this._key += this.decoder.write(data.toString('binary', p, idxamp))) } else { key = this._key }
+
+        this._hitLimit = false
+        this._checkingBytes = true
+        this._key = ''
+        this._bytesKey = 0
+        this._keyTrunc = false
+        this.decoder.reset()
+
+        if (key.length) {
+          this.boy.emit('field', decodeText(key, 'binary', this.charset),
+            '',
+            keyTrunc,
+            false)
+        }
+
+        p = idxamp + 1
+        if (this._fields === this.fieldsLimit) { return cb() }
+      } else if (this._hitLimit) {
+        // we may not have hit the actual limit if there are encoded bytes...
+        if (i > p) { this._key += this.decoder.write(data.toString('binary', p, i)) }
+        p = i
+        if ((this._bytesKey = this._key.length) === this.fieldNameSizeLimit) {
+          // yep, we actually did hit the limit
+          this._checkingBytes = false
+          this._keyTrunc = true
+        }
+      } else {
+        if (p < len) { this._key += this.decoder.write(data.toString('binary', p)) }
+        p = len
+      }
+    } else {
+      idxamp = undefined
+      for (i = p; i < len; ++i) {
+        if (!this._checkingBytes) { ++p }
+        if (data[i] === 0x26/* & */) {
+          idxamp = i
+          break
+        }
+        if (this._checkingBytes && this._bytesVal === this.fieldSizeLimit) {
+          this._hitLimit = true
+          break
+        } else if (this._checkingBytes) { ++this._bytesVal }
+      }
+
+      if (idxamp !== undefined) {
+        ++this._fields
+        if (idxamp > p) { this._val += this.decoder.write(data.toString('binary', p, idxamp)) }
+        this.boy.emit('field', decodeText(this._key, 'binary', this.charset),
+          decodeText(this._val, 'binary', this.charset),
+          this._keyTrunc,
+          this._valTrunc)
+        this._state = 'key'
+
+        this._hitLimit = false
+        this._checkingBytes = true
+        this._key = ''
+        this._bytesKey = 0
+        this._keyTrunc = false
+        this.decoder.reset()
+
+        p = idxamp + 1
+        if (this._fields === this.fieldsLimit) { return cb() }
+      } else if (this._hitLimit) {
+        // we may not have hit the actual limit if there are encoded bytes...
+        if (i > p) { this._val += this.decoder.write(data.toString('binary', p, i)) }
+        p = i
+        if ((this._val === '' && this.fieldSizeLimit === 0) ||
+            (this._bytesVal = this._val.length) === this.fieldSizeLimit) {
+          // yep, we actually did hit the limit
+          this._checkingBytes = false
+          this._valTrunc = true
+        }
+      } else {
+        if (p < len) { this._val += this.decoder.write(data.toString('binary', p)) }
+        p = len
+      }
+    }
+  }
+  cb()
+}
+
+UrlEncoded.prototype.end = function () {
+  if (this.boy._done) { return }
+
+  if (this._state === 'key' && this._key.length > 0) {
+    this.boy.emit('field', decodeText(this._key, 'binary', this.charset),
+      '',
+      this._keyTrunc,
+      false)
+  } else if (this._state === 'val') {
+    this.boy.emit('field', decodeText(this._key, 'binary', this.charset),
+      decodeText(this._val, 'binary', this.charset),
+      this._keyTrunc,
+      this._valTrunc)
+  }
+  this.boy._done = true
+  this.boy.emit('finish')
+}
+
+module.exports = UrlEncoded
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/utils/Decoder.js b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/Decoder.js
new file mode 100644
index 00000000000000..7917678c746538
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/Decoder.js
@@ -0,0 +1,54 @@
+'use strict'
+
+const RE_PLUS = /\+/g
+
+const HEX = [
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
+  0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
+]
+
+function Decoder () {
+  this.buffer = undefined
+}
+Decoder.prototype.write = function (str) {
+  // Replace '+' with ' ' before decoding
+  str = str.replace(RE_PLUS, ' ')
+  let res = ''
+  let i = 0; let p = 0; const len = str.length
+  for (; i < len; ++i) {
+    if (this.buffer !== undefined) {
+      if (!HEX[str.charCodeAt(i)]) {
+        res += '%' + this.buffer
+        this.buffer = undefined
+        --i // retry character
+      } else {
+        this.buffer += str[i]
+        ++p
+        if (this.buffer.length === 2) {
+          res += String.fromCharCode(parseInt(this.buffer, 16))
+          this.buffer = undefined
+        }
+      }
+    } else if (str[i] === '%') {
+      if (i > p) {
+        res += str.substring(p, i)
+        p = i
+      }
+      this.buffer = ''
+      ++p
+    }
+  }
+  if (p < len && this.buffer === undefined) { res += str.substring(p) }
+  return res
+}
+Decoder.prototype.reset = function () {
+  this.buffer = undefined
+}
+
+module.exports = Decoder
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/utils/basename.js b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/basename.js
new file mode 100644
index 00000000000000..db588199db051d
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/basename.js
@@ -0,0 +1,14 @@
+'use strict'
+
+module.exports = function basename (path) {
+  if (typeof path !== 'string') { return '' }
+  for (var i = path.length - 1; i >= 0; --i) { // eslint-disable-line no-var
+    switch (path.charCodeAt(i)) {
+      case 0x2F: // '/'
+      case 0x5C: // '\'
+        path = path.slice(i + 1)
+        return (path === '..' || path === '.' ? '' : path)
+    }
+  }
+  return (path === '..' || path === '.' ? '' : path)
+}
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/utils/decodeText.js b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/decodeText.js
new file mode 100644
index 00000000000000..ee376062c1843f
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/decodeText.js
@@ -0,0 +1,26 @@
+'use strict'
+
+// Node has always utf-8
+const utf8Decoder = new TextDecoder('utf-8')
+const textDecoders = new Map([
+  ['utf-8', utf8Decoder],
+  ['utf8', utf8Decoder]
+])
+
+function decodeText (text, textEncoding, destEncoding) {
+  if (text) {
+    if (textDecoders.has(destEncoding)) {
+      try {
+        return textDecoders.get(destEncoding).decode(Buffer.from(text, textEncoding))
+      } catch (e) { }
+    } else {
+      try {
+        textDecoders.set(destEncoding, new TextDecoder(destEncoding))
+        return textDecoders.get(destEncoding).decode(Buffer.from(text, textEncoding))
+      } catch (e) { }
+    }
+  }
+  return text
+}
+
+module.exports = decodeText
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/utils/getLimit.js b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/getLimit.js
new file mode 100644
index 00000000000000..cb64fd6721aacc
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/getLimit.js
@@ -0,0 +1,16 @@
+'use strict'
+
+module.exports = function getLimit (limits, name, defaultLimit) {
+  if (
+    !limits ||
+    limits[name] === undefined ||
+    limits[name] === null
+  ) { return defaultLimit }
+
+  if (
+    typeof limits[name] !== 'number' ||
+    isNaN(limits[name])
+  ) { throw new TypeError('Limit ' + name + ' is not a valid number') }
+
+  return limits[name]
+}
diff --git a/deps/undici/src/node_modules/@fastify/busboy/lib/utils/parseParams.js b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/parseParams.js
new file mode 100644
index 00000000000000..f9214180fa79d5
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/lib/utils/parseParams.js
@@ -0,0 +1,87 @@
+'use strict'
+
+const decodeText = require('./decodeText')
+
+const RE_ENCODED = /%([a-fA-F0-9]{2})/g
+
+function encodedReplacer (match, byte) {
+  return String.fromCharCode(parseInt(byte, 16))
+}
+
+function parseParams (str) {
+  const res = []
+  let state = 'key'
+  let charset = ''
+  let inquote = false
+  let escaping = false
+  let p = 0
+  let tmp = ''
+
+  for (var i = 0, len = str.length; i < len; ++i) { // eslint-disable-line no-var
+    const char = str[i]
+    if (char === '\\' && inquote) {
+      if (escaping) { escaping = false } else {
+        escaping = true
+        continue
+      }
+    } else if (char === '"') {
+      if (!escaping) {
+        if (inquote) {
+          inquote = false
+          state = 'key'
+        } else { inquote = true }
+        continue
+      } else { escaping = false }
+    } else {
+      if (escaping && inquote) { tmp += '\\' }
+      escaping = false
+      if ((state === 'charset' || state === 'lang') && char === "'") {
+        if (state === 'charset') {
+          state = 'lang'
+          charset = tmp.substring(1)
+        } else { state = 'value' }
+        tmp = ''
+        continue
+      } else if (state === 'key' &&
+        (char === '*' || char === '=') &&
+        res.length) {
+        if (char === '*') { state = 'charset' } else { state = 'value' }
+        res[p] = [tmp, undefined]
+        tmp = ''
+        continue
+      } else if (!inquote && char === ';') {
+        state = 'key'
+        if (charset) {
+          if (tmp.length) {
+            tmp = decodeText(tmp.replace(RE_ENCODED, encodedReplacer),
+              'binary',
+              charset)
+          }
+          charset = ''
+        } else if (tmp.length) {
+          tmp = decodeText(tmp, 'binary', 'utf8')
+        }
+        if (res[p] === undefined) { res[p] = tmp } else { res[p][1] = tmp }
+        tmp = ''
+        ++p
+        continue
+      } else if (!inquote && (char === ' ' || char === '\t')) { continue }
+    }
+    tmp += char
+  }
+  if (charset && tmp.length) {
+    tmp = decodeText(tmp.replace(RE_ENCODED, encodedReplacer),
+      'binary',
+      charset)
+  } else if (tmp) {
+    tmp = decodeText(tmp, 'binary', 'utf8')
+  }
+
+  if (res[p] === undefined) {
+    if (tmp) { res[p] = tmp }
+  } else { res[p][1] = tmp }
+
+  return res
+}
+
+module.exports = parseParams
diff --git a/deps/undici/src/node_modules/@fastify/busboy/package.json b/deps/undici/src/node_modules/@fastify/busboy/package.json
new file mode 100644
index 00000000000000..3288ee06872612
--- /dev/null
+++ b/deps/undici/src/node_modules/@fastify/busboy/package.json
@@ -0,0 +1,89 @@
+{
+  "name": "@fastify/busboy",
+  "version": "2.0.0",
+  "private": false,
+  "author": "Brian White <mscdex@mscdex.net>",
+  "contributors": [
+    {
+      "name": "Igor Savin",
+      "email": "kibertoad@gmail.com",
+      "url": "https://github.com/kibertoad"
+    },
+    {
+      "name": "Aras Abbasi",
+      "email": "aras.abbasi@gmail.com",
+      "url": "https://github.com/uzlopak"
+    }
+  ],
+  "description": "A streaming parser for HTML form data for node.js",
+  "main": "lib/main",
+  "types": "lib/main.d.ts",
+  "scripts": {
+    "bench:busboy": "cd benchmarks && npm install && npm run benchmark-fastify",
+    "bench:dicer": "node bench/dicer/dicer-bench-multipart-parser.js",
+    "coveralls": "nyc report --reporter=lcov",
+    "lint": "npm run lint:standard",
+    "lint:everything": "npm run lint && npm run test:types",
+    "lint:fix": "standard --fix",
+    "lint:standard": "standard --verbose | snazzy",
+    "test:mocha": "mocha test",
+    "test:types": "tsd",
+    "test:coverage": "nyc npm run test",
+    "test": "npm run test:mocha"
+  },
+  "engines": {
+    "node": ">=14"
+  },
+  "devDependencies": {
+    "@types/node": "^20.1.0",
+    "busboy": "^1.0.0",
+    "chai": "^4.3.6",
+    "eslint": "^8.23.0",
+    "eslint-config-standard": "^17.0.0",
+    "eslint-plugin-n": "^16.0.0",
+    "mocha": "^10.0.0",
+    "nyc": "^15.1.0",
+    "photofinish": "^1.8.0",
+    "snazzy": "^9.0.0",
+    "standard": "^17.0.0",
+    "tsd": "^0.29.0",
+    "typescript": "^5.0.2"
+  },
+  "keywords": [
+    "uploads",
+    "forms",
+    "multipart",
+    "form-data"
+  ],
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/fastify/busboy.git"
+  },
+  "tsd": {
+    "directory": "test/types",
+    "compilerOptions": {
+      "esModuleInterop": false,
+      "module": "commonjs",
+      "target": "ES2017"
+    }
+  },
+  "standard": {
+    "globals": [
+      "describe",
+      "it"
+    ],
+    "ignore": [
+      "bench"
+    ]
+  },
+  "files": [
+    "README.md",
+    "LICENSE",
+    "lib/*",
+    "deps/encoding/*",
+    "deps/dicer/lib",
+    "deps/streamsearch/",
+    "deps/dicer/LICENSE"
+  ]
+}
diff --git a/deps/undici/src/node_modules/busboy/.eslintrc.js b/deps/undici/src/node_modules/busboy/.eslintrc.js
deleted file mode 100644
index be9311d02655a2..00000000000000
--- a/deps/undici/src/node_modules/busboy/.eslintrc.js
+++ /dev/null
@@ -1,5 +0,0 @@
-'use strict';
-
-module.exports = {
-  extends: '@mscdex/eslint-config',
-};
diff --git a/deps/undici/src/node_modules/busboy/.github/workflows/ci.yml b/deps/undici/src/node_modules/busboy/.github/workflows/ci.yml
deleted file mode 100644
index 799bae04adb62a..00000000000000
--- a/deps/undici/src/node_modules/busboy/.github/workflows/ci.yml
+++ /dev/null
@@ -1,24 +0,0 @@
-name: CI
-
-on:
-  pull_request:
-  push:
-    branches: [ master ]
-
-jobs:
-  tests-linux:
-    runs-on: ubuntu-latest
-    strategy:
-      fail-fast: false
-      matrix:
-        node-version: [10.16.0, 10.x, 12.x, 14.x, 16.x]
-    steps:
-      - uses: actions/checkout@v2
-      - name: Use Node.js ${{ matrix.node-version }}
-        uses: actions/setup-node@v1
-        with:
-          node-version: ${{ matrix.node-version }}
-      - name: Install module
-        run: npm install
-      - name: Run tests
-        run: npm test
diff --git a/deps/undici/src/node_modules/busboy/.github/workflows/lint.yml b/deps/undici/src/node_modules/busboy/.github/workflows/lint.yml
deleted file mode 100644
index 9f9e1f589a30be..00000000000000
--- a/deps/undici/src/node_modules/busboy/.github/workflows/lint.yml
+++ /dev/null
@@ -1,23 +0,0 @@
-name: lint
-
-on:
-  pull_request:
-  push:
-    branches: [ master ]
-
-env:
-  NODE_VERSION: 16.x
-
-jobs:
-  lint-js:
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v2
-      - name: Use Node.js ${{ env.NODE_VERSION }}
-        uses: actions/setup-node@v1
-        with:
-          node-version: ${{ env.NODE_VERSION }}
-      - name: Install ESLint + ESLint configs/plugins
-        run: npm install --only=dev
-      - name: Lint files
-        run: npm run lint
diff --git a/deps/undici/src/node_modules/busboy/README.md b/deps/undici/src/node_modules/busboy/README.md
deleted file mode 100644
index 654af30455614e..00000000000000
--- a/deps/undici/src/node_modules/busboy/README.md
+++ /dev/null
@@ -1,191 +0,0 @@
-# Description
-
-A node.js module for parsing incoming HTML form data.
-
-Changes (breaking or otherwise) in v1.0.0 can be found [here](https://github.com/mscdex/busboy/issues/266).
-
-# Requirements
-
-* [node.js](http://nodejs.org/) -- v10.16.0 or newer
-
-
-# Install
-
-    npm install busboy
-
-
-# Examples
-
-* Parsing (multipart) with default options:
-
-```js
-const http = require('http');
-
-const busboy = require('busboy');
-
-http.createServer((req, res) => {
-  if (req.method === 'POST') {
-    console.log('POST request');
-    const bb = busboy({ headers: req.headers });
-    bb.on('file', (name, file, info) => {
-      const { filename, encoding, mimeType } = info;
-      console.log(
-        `File [${name}]: filename: %j, encoding: %j, mimeType: %j`,
-        filename,
-        encoding,
-        mimeType
-      );
-      file.on('data', (data) => {
-        console.log(`File [${name}] got ${data.length} bytes`);
-      }).on('close', () => {
-        console.log(`File [${name}] done`);
-      });
-    });
-    bb.on('field', (name, val, info) => {
-      console.log(`Field [${name}]: value: %j`, val);
-    });
-    bb.on('close', () => {
-      console.log('Done parsing form!');
-      res.writeHead(303, { Connection: 'close', Location: '/' });
-      res.end();
-    });
-    req.pipe(bb);
-  } else if (req.method === 'GET') {
-    res.writeHead(200, { Connection: 'close' });
-    res.end(`
-      <html>
-        <head></head>
-        <body>
-          <form method="POST" enctype="multipart/form-data">
-            <input type="file" name="filefield"><br />
-            <input type="text" name="textfield"><br />
-            <input type="submit">
-          </form>
-        </body>
-      </html>
-    `);
-  }
-}).listen(8000, () => {
-  console.log('Listening for requests');
-});
-
-// Example output:
-//
-// Listening for requests
-//   < ... form submitted ... >
-// POST request
-// File [filefield]: filename: "logo.jpg", encoding: "binary", mime: "image/jpeg"
-// File [filefield] got 11912 bytes
-// Field [textfield]: value: "testing! :-)"
-// File [filefield] done
-// Done parsing form!
-```
-
-* Save all incoming files to disk:
-
-```js
-const { randomFillSync } = require('crypto');
-const fs = require('fs');
-const http = require('http');
-const os = require('os');
-const path = require('path');
-
-const busboy = require('busboy');
-
-const random = (() => {
-  const buf = Buffer.alloc(16);
-  return () => randomFillSync(buf).toString('hex');
-})();
-
-http.createServer((req, res) => {
-  if (req.method === 'POST') {
-    const bb = busboy({ headers: req.headers });
-    bb.on('file', (name, file, info) => {
-      const saveTo = path.join(os.tmpdir(), `busboy-upload-${random()}`);
-      file.pipe(fs.createWriteStream(saveTo));
-    });
-    bb.on('close', () => {
-      res.writeHead(200, { 'Connection': 'close' });
-      res.end(`That's all folks!`);
-    });
-    req.pipe(bb);
-    return;
-  }
-  res.writeHead(404);
-  res.end();
-}).listen(8000, () => {
-  console.log('Listening for requests');
-});
-```
-
-
-# API
-
-## Exports
-
-`busboy` exports a single function:
-
-**( _function_ )**(< _object_ >config) - Creates and returns a new _Writable_ form parser stream.
-
-* Valid `config` properties:
-
-    * **headers** - _object_ - These are the HTTP headers of the incoming request, which are used by individual parsers.
-
-    * **highWaterMark** - _integer_ - highWaterMark to use for the parser stream. **Default:** node's _stream.Writable_ default.
-
-    * **fileHwm** - _integer_ - highWaterMark to use for individual file streams. **Default:** node's _stream.Readable_ default.
-
-    * **defCharset** - _string_ - Default character set to use when one isn't defined. **Default:** `'utf8'`.
-
-    * **defParamCharset** - _string_ - For multipart forms, the default character set to use for values of part header parameters (e.g. filename) that are not extended parameters (that contain an explicit charset). **Default:** `'latin1'`.
-
-    * **preservePath** - _boolean_ - If paths in filenames from file parts in a `'multipart/form-data'` request shall be preserved. **Default:** `false`.
-
-    * **limits** - _object_ - Various limits on incoming data. Valid properties are:
-
-        * **fieldNameSize** - _integer_ - Max field name size (in bytes). **Default:** `100`.
-
-        * **fieldSize** - _integer_ - Max field value size (in bytes). **Default:** `1048576` (1MB).
-
-        * **fields** - _integer_ - Max number of non-file fields. **Default:** `Infinity`.
-
-        * **fileSize** - _integer_ - For multipart forms, the max file size (in bytes). **Default:** `Infinity`.
-
-        * **files** - _integer_ - For multipart forms, the max number of file fields. **Default:** `Infinity`.
-
-        * **parts** - _integer_ - For multipart forms, the max number of parts (fields + files). **Default:** `Infinity`.
-
-        * **headerPairs** - _integer_ - For multipart forms, the max number of header key-value pairs to parse. **Default:** `2000` (same as node's http module).
-
-This function can throw exceptions if there is something wrong with the values in `config`. For example, if the Content-Type in `headers` is missing entirely, is not a supported type, or is missing the boundary for `'multipart/form-data'` requests.
-
-## (Special) Parser stream events
-
-* **file**(< _string_ >name, < _Readable_ >stream, < _object_ >info) - Emitted for each new file found. `name` contains the form field name. `stream` is a _Readable_ stream containing the file's data. No transformations/conversions (e.g. base64 to raw binary) are done on the file's data. `info` contains the following properties:
-
-    * `filename` - _string_ - If supplied, this contains the file's filename. **WARNING:** You should almost _never_ use this value as-is (especially if you are using `preservePath: true` in your `config`) as it could contain malicious input. You are better off generating your own (safe) filenames, or at the very least using a hash of the filename.
-
-    * `encoding` - _string_ - The file's `'Content-Transfer-Encoding'` value.
-
-    * `mimeType` - _string_ - The file's `'Content-Type'` value.
-
-    **Note:** If you listen for this event, you should always consume the `stream` whether you care about its contents or not (you can simply do `stream.resume();` if you want to discard/skip the contents), otherwise the `'finish'`/`'close'` event will never fire on the busboy parser stream.
-    However, if you aren't accepting files, you can either simply not listen for the `'file'` event at all or set `limits.files` to `0`, and any/all files will be automatically skipped (these skipped files will still count towards any configured `limits.files` and `limits.parts` limits though).
-
-    **Note:** If a configured `limits.fileSize` limit was reached for a file, `stream` will both have a boolean property `truncated` set to `true` (best checked at the end of the stream) and emit a `'limit'` event to notify you when this happens.
-
-* **field**(< _string_ >name, < _string_ >value, < _object_ >info) - Emitted for each new non-file field found. `name` contains the form field name. `value` contains the string value of the field. `info` contains the following properties:
-
-    * `nameTruncated` - _boolean_ - Whether `name` was truncated or not (due to a configured `limits.fieldNameSize` limit)
-
-    * `valueTruncated` - _boolean_ - Whether `value` was truncated or not (due to a configured `limits.fieldSize` limit)
-
-    * `encoding` - _string_ - The field's `'Content-Transfer-Encoding'` value.
-
-    * `mimeType` - _string_ - The field's `'Content-Type'` value.
-
-* **partsLimit**() - Emitted when the configured `limits.parts` limit has been reached. No more `'file'` or `'field'` events will be emitted.
-
-* **filesLimit**() - Emitted when the configured `limits.files` limit has been reached. No more `'file'` events will be emitted.
-
-* **fieldsLimit**() - Emitted when the configured `limits.fields` limit has been reached. No more `'field'` events will be emitted.
diff --git a/deps/undici/src/node_modules/busboy/bench/bench-multipart-fields-100mb-big.js b/deps/undici/src/node_modules/busboy/bench/bench-multipart-fields-100mb-big.js
deleted file mode 100644
index ef15729ea65c38..00000000000000
--- a/deps/undici/src/node_modules/busboy/bench/bench-multipart-fields-100mb-big.js
+++ /dev/null
@@ -1,149 +0,0 @@
-'use strict';
-
-function createMultipartBuffers(boundary, sizes) {
-  const bufs = [];
-  for (let i = 0; i < sizes.length; ++i) {
-    const mb = sizes[i] * 1024 * 1024;
-    bufs.push(Buffer.from([
-      `--${boundary}`,
-      `content-disposition: form-data; name="field${i + 1}"`,
-      '',
-      '0'.repeat(mb),
-      '',
-    ].join('\r\n')));
-  }
-  bufs.push(Buffer.from([
-    `--${boundary}--`,
-    '',
-  ].join('\r\n')));
-  return bufs;
-}
-
-const boundary = '-----------------------------168072824752491622650073';
-const buffers = createMultipartBuffers(boundary, [
-  10,
-  10,
-  10,
-  20,
-  50,
-]);
-const calls = {
-  partBegin: 0,
-  headerField: 0,
-  headerValue: 0,
-  headerEnd: 0,
-  headersEnd: 0,
-  partData: 0,
-  partEnd: 0,
-  end: 0,
-};
-
-const moduleName = process.argv[2];
-switch (moduleName) {
-  case 'busboy': {
-    const busboy = require('busboy');
-
-    const parser = busboy({
-      limits: {
-        fieldSizeLimit: Infinity,
-      },
-      headers: {
-        'content-type': `multipart/form-data; boundary=${boundary}`,
-      },
-    });
-    parser.on('field', (name, val, info) => {
-      ++calls.partBegin;
-      ++calls.partData;
-      ++calls.partEnd;
-    }).on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    });
-
-    console.time(moduleName);
-    for (const buf of buffers)
-      parser.write(buf);
-    break;
-  }
-
-  case 'formidable': {
-    const { MultipartParser } = require('formidable');
-
-    const parser = new MultipartParser();
-    parser.initWithBoundary(boundary);
-    parser.on('data', ({ name }) => {
-      ++calls[name];
-      if (name === 'end')
-        console.timeEnd(moduleName);
-    });
-
-    console.time(moduleName);
-    for (const buf of buffers)
-      parser.write(buf);
-
-    break;
-  }
-
-  case 'multiparty': {
-    const { Readable } = require('stream');
-
-    const { Form } = require('multiparty');
-
-    const form = new Form({
-      maxFieldsSize: Infinity,
-      maxFields: Infinity,
-      maxFilesSize: Infinity,
-      autoFields: false,
-      autoFiles: false,
-    });
-
-    const req = new Readable({ read: () => {} });
-    req.headers = {
-      'content-type': `multipart/form-data; boundary=${boundary}`,
-    };
-
-    function hijack(name, fn) {
-      const oldFn = form[name];
-      form[name] = function() {
-        fn();
-        return oldFn.apply(this, arguments);
-      };
-    }
-
-    hijack('onParseHeaderField', () => {
-      ++calls.headerField;
-    });
-    hijack('onParseHeaderValue', () => {
-      ++calls.headerValue;
-    });
-    hijack('onParsePartBegin', () => {
-      ++calls.partBegin;
-    });
-    hijack('onParsePartData', () => {
-      ++calls.partData;
-    });
-    hijack('onParsePartEnd', () => {
-      ++calls.partEnd;
-    });
-
-    form.on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    }).on('part', (p) => p.resume());
-
-    console.time(moduleName);
-    form.parse(req);
-    for (const buf of buffers)
-      req.push(buf);
-    req.push(null);
-
-    break;
-  }
-
-  default:
-    if (moduleName === undefined)
-      console.error('Missing parser module name');
-    else
-      console.error(`Invalid parser module name: ${moduleName}`);
-    process.exit(1);
-}
diff --git a/deps/undici/src/node_modules/busboy/bench/bench-multipart-fields-100mb-small.js b/deps/undici/src/node_modules/busboy/bench/bench-multipart-fields-100mb-small.js
deleted file mode 100644
index f32d421c735d32..00000000000000
--- a/deps/undici/src/node_modules/busboy/bench/bench-multipart-fields-100mb-small.js
+++ /dev/null
@@ -1,143 +0,0 @@
-'use strict';
-
-function createMultipartBuffers(boundary, sizes) {
-  const bufs = [];
-  for (let i = 0; i < sizes.length; ++i) {
-    const mb = sizes[i] * 1024 * 1024;
-    bufs.push(Buffer.from([
-      `--${boundary}`,
-      `content-disposition: form-data; name="field${i + 1}"`,
-      '',
-      '0'.repeat(mb),
-      '',
-    ].join('\r\n')));
-  }
-  bufs.push(Buffer.from([
-    `--${boundary}--`,
-    '',
-  ].join('\r\n')));
-  return bufs;
-}
-
-const boundary = '-----------------------------168072824752491622650073';
-const buffers = createMultipartBuffers(boundary, (new Array(100)).fill(1));
-const calls = {
-  partBegin: 0,
-  headerField: 0,
-  headerValue: 0,
-  headerEnd: 0,
-  headersEnd: 0,
-  partData: 0,
-  partEnd: 0,
-  end: 0,
-};
-
-const moduleName = process.argv[2];
-switch (moduleName) {
-  case 'busboy': {
-    const busboy = require('busboy');
-
-    const parser = busboy({
-      limits: {
-        fieldSizeLimit: Infinity,
-      },
-      headers: {
-        'content-type': `multipart/form-data; boundary=${boundary}`,
-      },
-    });
-    parser.on('field', (name, val, info) => {
-      ++calls.partBegin;
-      ++calls.partData;
-      ++calls.partEnd;
-    }).on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    });
-
-    console.time(moduleName);
-    for (const buf of buffers)
-      parser.write(buf);
-    break;
-  }
-
-  case 'formidable': {
-    const { MultipartParser } = require('formidable');
-
-    const parser = new MultipartParser();
-    parser.initWithBoundary(boundary);
-    parser.on('data', ({ name }) => {
-      ++calls[name];
-      if (name === 'end')
-        console.timeEnd(moduleName);
-    });
-
-    console.time(moduleName);
-    for (const buf of buffers)
-      parser.write(buf);
-
-    break;
-  }
-
-  case 'multiparty': {
-    const { Readable } = require('stream');
-
-    const { Form } = require('multiparty');
-
-    const form = new Form({
-      maxFieldsSize: Infinity,
-      maxFields: Infinity,
-      maxFilesSize: Infinity,
-      autoFields: false,
-      autoFiles: false,
-    });
-
-    const req = new Readable({ read: () => {} });
-    req.headers = {
-      'content-type': `multipart/form-data; boundary=${boundary}`,
-    };
-
-    function hijack(name, fn) {
-      const oldFn = form[name];
-      form[name] = function() {
-        fn();
-        return oldFn.apply(this, arguments);
-      };
-    }
-
-    hijack('onParseHeaderField', () => {
-      ++calls.headerField;
-    });
-    hijack('onParseHeaderValue', () => {
-      ++calls.headerValue;
-    });
-    hijack('onParsePartBegin', () => {
-      ++calls.partBegin;
-    });
-    hijack('onParsePartData', () => {
-      ++calls.partData;
-    });
-    hijack('onParsePartEnd', () => {
-      ++calls.partEnd;
-    });
-
-    form.on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    }).on('part', (p) => p.resume());
-
-    console.time(moduleName);
-    form.parse(req);
-    for (const buf of buffers)
-      req.push(buf);
-    req.push(null);
-
-    break;
-  }
-
-  default:
-    if (moduleName === undefined)
-      console.error('Missing parser module name');
-    else
-      console.error(`Invalid parser module name: ${moduleName}`);
-    process.exit(1);
-}
diff --git a/deps/undici/src/node_modules/busboy/bench/bench-multipart-files-100mb-big.js b/deps/undici/src/node_modules/busboy/bench/bench-multipart-files-100mb-big.js
deleted file mode 100644
index b46bdee02cdded..00000000000000
--- a/deps/undici/src/node_modules/busboy/bench/bench-multipart-files-100mb-big.js
+++ /dev/null
@@ -1,154 +0,0 @@
-'use strict';
-
-function createMultipartBuffers(boundary, sizes) {
-  const bufs = [];
-  for (let i = 0; i < sizes.length; ++i) {
-    const mb = sizes[i] * 1024 * 1024;
-    bufs.push(Buffer.from([
-      `--${boundary}`,
-      `content-disposition: form-data; name="file${i + 1}"; `
-        + `filename="random${i + 1}.bin"`,
-      'content-type: application/octet-stream',
-      '',
-      '0'.repeat(mb),
-      '',
-    ].join('\r\n')));
-  }
-  bufs.push(Buffer.from([
-    `--${boundary}--`,
-    '',
-  ].join('\r\n')));
-  return bufs;
-}
-
-const boundary = '-----------------------------168072824752491622650073';
-const buffers = createMultipartBuffers(boundary, [
-  10,
-  10,
-  10,
-  20,
-  50,
-]);
-const calls = {
-  partBegin: 0,
-  headerField: 0,
-  headerValue: 0,
-  headerEnd: 0,
-  headersEnd: 0,
-  partData: 0,
-  partEnd: 0,
-  end: 0,
-};
-
-const moduleName = process.argv[2];
-switch (moduleName) {
-  case 'busboy': {
-    const busboy = require('busboy');
-
-    const parser = busboy({
-      limits: {
-        fieldSizeLimit: Infinity,
-      },
-      headers: {
-        'content-type': `multipart/form-data; boundary=${boundary}`,
-      },
-    });
-    parser.on('file', (name, stream, info) => {
-      ++calls.partBegin;
-      stream.on('data', (chunk) => {
-        ++calls.partData;
-      }).on('end', () => {
-        ++calls.partEnd;
-      });
-    }).on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    });
-
-    console.time(moduleName);
-    for (const buf of buffers)
-      parser.write(buf);
-    break;
-  }
-
-  case 'formidable': {
-    const { MultipartParser } = require('formidable');
-
-    const parser = new MultipartParser();
-    parser.initWithBoundary(boundary);
-    parser.on('data', ({ name }) => {
-      ++calls[name];
-      if (name === 'end')
-        console.timeEnd(moduleName);
-    });
-
-    console.time(moduleName);
-    for (const buf of buffers)
-      parser.write(buf);
-
-    break;
-  }
-
-  case 'multiparty': {
-    const { Readable } = require('stream');
-
-    const { Form } = require('multiparty');
-
-    const form = new Form({
-      maxFieldsSize: Infinity,
-      maxFields: Infinity,
-      maxFilesSize: Infinity,
-      autoFields: false,
-      autoFiles: false,
-    });
-
-    const req = new Readable({ read: () => {} });
-    req.headers = {
-      'content-type': `multipart/form-data; boundary=${boundary}`,
-    };
-
-    function hijack(name, fn) {
-      const oldFn = form[name];
-      form[name] = function() {
-        fn();
-        return oldFn.apply(this, arguments);
-      };
-    }
-
-    hijack('onParseHeaderField', () => {
-      ++calls.headerField;
-    });
-    hijack('onParseHeaderValue', () => {
-      ++calls.headerValue;
-    });
-    hijack('onParsePartBegin', () => {
-      ++calls.partBegin;
-    });
-    hijack('onParsePartData', () => {
-      ++calls.partData;
-    });
-    hijack('onParsePartEnd', () => {
-      ++calls.partEnd;
-    });
-
-    form.on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    }).on('part', (p) => p.resume());
-
-    console.time(moduleName);
-    form.parse(req);
-    for (const buf of buffers)
-      req.push(buf);
-    req.push(null);
-
-    break;
-  }
-
-  default:
-    if (moduleName === undefined)
-      console.error('Missing parser module name');
-    else
-      console.error(`Invalid parser module name: ${moduleName}`);
-    process.exit(1);
-}
diff --git a/deps/undici/src/node_modules/busboy/bench/bench-multipart-files-100mb-small.js b/deps/undici/src/node_modules/busboy/bench/bench-multipart-files-100mb-small.js
deleted file mode 100644
index 46b5dffb0c74d8..00000000000000
--- a/deps/undici/src/node_modules/busboy/bench/bench-multipart-files-100mb-small.js
+++ /dev/null
@@ -1,148 +0,0 @@
-'use strict';
-
-function createMultipartBuffers(boundary, sizes) {
-  const bufs = [];
-  for (let i = 0; i < sizes.length; ++i) {
-    const mb = sizes[i] * 1024 * 1024;
-    bufs.push(Buffer.from([
-      `--${boundary}`,
-      `content-disposition: form-data; name="file${i + 1}"; `
-        + `filename="random${i + 1}.bin"`,
-      'content-type: application/octet-stream',
-      '',
-      '0'.repeat(mb),
-      '',
-    ].join('\r\n')));
-  }
-  bufs.push(Buffer.from([
-    `--${boundary}--`,
-    '',
-  ].join('\r\n')));
-  return bufs;
-}
-
-const boundary = '-----------------------------168072824752491622650073';
-const buffers = createMultipartBuffers(boundary, (new Array(100)).fill(1));
-const calls = {
-  partBegin: 0,
-  headerField: 0,
-  headerValue: 0,
-  headerEnd: 0,
-  headersEnd: 0,
-  partData: 0,
-  partEnd: 0,
-  end: 0,
-};
-
-const moduleName = process.argv[2];
-switch (moduleName) {
-  case 'busboy': {
-    const busboy = require('busboy');
-
-    const parser = busboy({
-      limits: {
-        fieldSizeLimit: Infinity,
-      },
-      headers: {
-        'content-type': `multipart/form-data; boundary=${boundary}`,
-      },
-    });
-    parser.on('file', (name, stream, info) => {
-      ++calls.partBegin;
-      stream.on('data', (chunk) => {
-        ++calls.partData;
-      }).on('end', () => {
-        ++calls.partEnd;
-      });
-    }).on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    });
-
-    console.time(moduleName);
-    for (const buf of buffers)
-      parser.write(buf);
-    break;
-  }
-
-  case 'formidable': {
-    const { MultipartParser } = require('formidable');
-
-    const parser = new MultipartParser();
-    parser.initWithBoundary(boundary);
-    parser.on('data', ({ name }) => {
-      ++calls[name];
-      if (name === 'end')
-        console.timeEnd(moduleName);
-    });
-
-    console.time(moduleName);
-    for (const buf of buffers)
-      parser.write(buf);
-
-    break;
-  }
-
-  case 'multiparty': {
-    const { Readable } = require('stream');
-
-    const { Form } = require('multiparty');
-
-    const form = new Form({
-      maxFieldsSize: Infinity,
-      maxFields: Infinity,
-      maxFilesSize: Infinity,
-      autoFields: false,
-      autoFiles: false,
-    });
-
-    const req = new Readable({ read: () => {} });
-    req.headers = {
-      'content-type': `multipart/form-data; boundary=${boundary}`,
-    };
-
-    function hijack(name, fn) {
-      const oldFn = form[name];
-      form[name] = function() {
-        fn();
-        return oldFn.apply(this, arguments);
-      };
-    }
-
-    hijack('onParseHeaderField', () => {
-      ++calls.headerField;
-    });
-    hijack('onParseHeaderValue', () => {
-      ++calls.headerValue;
-    });
-    hijack('onParsePartBegin', () => {
-      ++calls.partBegin;
-    });
-    hijack('onParsePartData', () => {
-      ++calls.partData;
-    });
-    hijack('onParsePartEnd', () => {
-      ++calls.partEnd;
-    });
-
-    form.on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    }).on('part', (p) => p.resume());
-
-    console.time(moduleName);
-    form.parse(req);
-    for (const buf of buffers)
-      req.push(buf);
-    req.push(null);
-
-    break;
-  }
-
-  default:
-    if (moduleName === undefined)
-      console.error('Missing parser module name');
-    else
-      console.error(`Invalid parser module name: ${moduleName}`);
-    process.exit(1);
-}
diff --git a/deps/undici/src/node_modules/busboy/bench/bench-urlencoded-fields-100pairs-small.js b/deps/undici/src/node_modules/busboy/bench/bench-urlencoded-fields-100pairs-small.js
deleted file mode 100644
index 5c337df2ef951f..00000000000000
--- a/deps/undici/src/node_modules/busboy/bench/bench-urlencoded-fields-100pairs-small.js
+++ /dev/null
@@ -1,101 +0,0 @@
-'use strict';
-
-const buffers = [
-  Buffer.from(
-    (new Array(100)).fill('').map((_, i) => `key${i}=value${i}`).join('&')
-  ),
-];
-const calls = {
-  field: 0,
-  end: 0,
-};
-
-let n = 3e3;
-
-const moduleName = process.argv[2];
-switch (moduleName) {
-  case 'busboy': {
-    const busboy = require('busboy');
-
-    console.time(moduleName);
-    (function next() {
-      const parser = busboy({
-        limits: {
-          fieldSizeLimit: Infinity,
-        },
-        headers: {
-          'content-type': 'application/x-www-form-urlencoded; charset=utf-8',
-        },
-      });
-      parser.on('field', (name, val, info) => {
-        ++calls.field;
-      }).on('close', () => {
-        ++calls.end;
-        if (--n === 0)
-          console.timeEnd(moduleName);
-        else
-          process.nextTick(next);
-      });
-
-      for (const buf of buffers)
-        parser.write(buf);
-      parser.end();
-    })();
-    break;
-  }
-
-  case 'formidable': {
-    const QuerystringParser =
-      require('formidable/src/parsers/Querystring.js');
-
-    console.time(moduleName);
-    (function next() {
-      const parser = new QuerystringParser();
-      parser.on('data', (obj) => {
-        ++calls.field;
-      }).on('end', () => {
-        ++calls.end;
-        if (--n === 0)
-          console.timeEnd(moduleName);
-        else
-          process.nextTick(next);
-      });
-
-      for (const buf of buffers)
-        parser.write(buf);
-      parser.end();
-    })();
-    break;
-  }
-
-  case 'formidable-streaming': {
-    const QuerystringParser =
-      require('formidable/src/parsers/StreamingQuerystring.js');
-
-    console.time(moduleName);
-    (function next() {
-      const parser = new QuerystringParser();
-      parser.on('data', (obj) => {
-        ++calls.field;
-      }).on('end', () => {
-        ++calls.end;
-        if (--n === 0)
-          console.timeEnd(moduleName);
-        else
-          process.nextTick(next);
-      });
-
-      for (const buf of buffers)
-        parser.write(buf);
-      parser.end();
-    })();
-    break;
-  }
-
-  default:
-    if (moduleName === undefined)
-      console.error('Missing parser module name');
-    else
-      console.error(`Invalid parser module name: ${moduleName}`);
-    process.exit(1);
-}
diff --git a/deps/undici/src/node_modules/busboy/bench/bench-urlencoded-fields-900pairs-small-alt.js b/deps/undici/src/node_modules/busboy/bench/bench-urlencoded-fields-900pairs-small-alt.js
deleted file mode 100644
index 1f5645cb8cc43f..00000000000000
--- a/deps/undici/src/node_modules/busboy/bench/bench-urlencoded-fields-900pairs-small-alt.js
+++ /dev/null
@@ -1,84 +0,0 @@
-'use strict';
-
-const buffers = [
-  Buffer.from(
-    (new Array(900)).fill('').map((_, i) => `key${i}=value${i}`).join('&')
-  ),
-];
-const calls = {
-  field: 0,
-  end: 0,
-};
-
-const moduleName = process.argv[2];
-switch (moduleName) {
-  case 'busboy': {
-    const busboy = require('busboy');
-
-    console.time(moduleName);
-    const parser = busboy({
-      limits: {
-        fieldSizeLimit: Infinity,
-      },
-      headers: {
-        'content-type': 'application/x-www-form-urlencoded; charset=utf-8',
-      },
-    });
-    parser.on('field', (name, val, info) => {
-      ++calls.field;
-    }).on('close', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    });
-
-    for (const buf of buffers)
-      parser.write(buf);
-    parser.end();
-    break;
-  }
-
-  case 'formidable': {
-    const QuerystringParser =
-      require('formidable/src/parsers/Querystring.js');
-
-    console.time(moduleName);
-    const parser = new QuerystringParser();
-    parser.on('data', (obj) => {
-      ++calls.field;
-    }).on('end', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    });
-
-    for (const buf of buffers)
-      parser.write(buf);
-    parser.end();
-    break;
-  }
-
-  case 'formidable-streaming': {
-    const QuerystringParser =
-      require('formidable/src/parsers/StreamingQuerystring.js');
-
-    console.time(moduleName);
-    const parser = new QuerystringParser();
-    parser.on('data', (obj) => {
-      ++calls.field;
-    }).on('end', () => {
-      ++calls.end;
-      console.timeEnd(moduleName);
-    });
-
-    for (const buf of buffers)
-      parser.write(buf);
-    parser.end();
-    break;
-  }
-
-  default:
-    if (moduleName === undefined)
-      console.error('Missing parser module name');
-    else
-      console.error(`Invalid parser module name: ${moduleName}`);
-    process.exit(1);
-}
diff --git a/deps/undici/src/node_modules/busboy/lib/index.js b/deps/undici/src/node_modules/busboy/lib/index.js
deleted file mode 100644
index 873272d93cf34c..00000000000000
--- a/deps/undici/src/node_modules/busboy/lib/index.js
+++ /dev/null
@@ -1,57 +0,0 @@
-'use strict';
-
-const { parseContentType } = require('./utils.js');
-
-function getInstance(cfg) {
-  const headers = cfg.headers;
-  const conType = parseContentType(headers['content-type']);
-  if (!conType)
-    throw new Error('Malformed content type');
-
-  for (const type of TYPES) {
-    const matched = type.detect(conType);
-    if (!matched)
-      continue;
-
-    const instanceCfg = {
-      limits: cfg.limits,
-      headers,
-      conType,
-      highWaterMark: undefined,
-      fileHwm: undefined,
-      defCharset: undefined,
-      defParamCharset: undefined,
-      preservePath: false,
-    };
-    if (cfg.highWaterMark)
-      instanceCfg.highWaterMark = cfg.highWaterMark;
-    if (cfg.fileHwm)
-      instanceCfg.fileHwm = cfg.fileHwm;
-    instanceCfg.defCharset = cfg.defCharset;
-    instanceCfg.defParamCharset = cfg.defParamCharset;
-    instanceCfg.preservePath = cfg.preservePath;
-    return new type(instanceCfg);
-  }
-
-  throw new Error(`Unsupported content type: ${headers['content-type']}`);
-}
-
-// Note: types are explicitly listed here for easier bundling
-// See: https://github.com/mscdex/busboy/issues/121
-const TYPES = [
-  require('./types/multipart'),
-  require('./types/urlencoded'),
-].filter(function(typemod) { return typeof typemod.detect === 'function'; });
-
-module.exports = (cfg) => {
-  if (typeof cfg !== 'object' || cfg === null)
-    cfg = {};
-
-  if (typeof cfg.headers !== 'object'
-      || cfg.headers === null
-      || typeof cfg.headers['content-type'] !== 'string') {
-    throw new Error('Missing Content-Type');
-  }
-
-  return getInstance(cfg);
-};
diff --git a/deps/undici/src/node_modules/busboy/lib/types/multipart.js b/deps/undici/src/node_modules/busboy/lib/types/multipart.js
deleted file mode 100644
index cc0d7bb6638a12..00000000000000
--- a/deps/undici/src/node_modules/busboy/lib/types/multipart.js
+++ /dev/null
@@ -1,653 +0,0 @@
-'use strict';
-
-const { Readable, Writable } = require('stream');
-
-const StreamSearch = require('streamsearch');
-
-const {
-  basename,
-  convertToUTF8,
-  getDecoder,
-  parseContentType,
-  parseDisposition,
-} = require('../utils.js');
-
-const BUF_CRLF = Buffer.from('\r\n');
-const BUF_CR = Buffer.from('\r');
-const BUF_DASH = Buffer.from('-');
-
-function noop() {}
-
-const MAX_HEADER_PAIRS = 2000; // From node
-const MAX_HEADER_SIZE = 16 * 1024; // From node (its default value)
-
-const HPARSER_NAME = 0;
-const HPARSER_PRE_OWS = 1;
-const HPARSER_VALUE = 2;
-class HeaderParser {
-  constructor(cb) {
-    this.header = Object.create(null);
-    this.pairCount = 0;
-    this.byteCount = 0;
-    this.state = HPARSER_NAME;
-    this.name = '';
-    this.value = '';
-    this.crlf = 0;
-    this.cb = cb;
-  }
-
-  reset() {
-    this.header = Object.create(null);
-    this.pairCount = 0;
-    this.byteCount = 0;
-    this.state = HPARSER_NAME;
-    this.name = '';
-    this.value = '';
-    this.crlf = 0;
-  }
-
-  push(chunk, pos, end) {
-    let start = pos;
-    while (pos < end) {
-      switch (this.state) {
-        case HPARSER_NAME: {
-          let done = false;
-          for (; pos < end; ++pos) {
-            if (this.byteCount === MAX_HEADER_SIZE)
-              return -1;
-            ++this.byteCount;
-            const code = chunk[pos];
-            if (TOKEN[code] !== 1) {
-              if (code !== 58/* ':' */)
-                return -1;
-              this.name += chunk.latin1Slice(start, pos);
-              if (this.name.length === 0)
-                return -1;
-              ++pos;
-              done = true;
-              this.state = HPARSER_PRE_OWS;
-              break;
-            }
-          }
-          if (!done) {
-            this.name += chunk.latin1Slice(start, pos);
-            break;
-          }
-          // FALLTHROUGH
-        }
-        case HPARSER_PRE_OWS: {
-          // Skip optional whitespace
-          let done = false;
-          for (; pos < end; ++pos) {
-            if (this.byteCount === MAX_HEADER_SIZE)
-              return -1;
-            ++this.byteCount;
-            const code = chunk[pos];
-            if (code !== 32/* ' ' */ && code !== 9/* '\t' */) {
-              start = pos;
-              done = true;
-              this.state = HPARSER_VALUE;
-              break;
-            }
-          }
-          if (!done)
-            break;
-          // FALLTHROUGH
-        }
-        case HPARSER_VALUE:
-          switch (this.crlf) {
-            case 0: // Nothing yet
-              for (; pos < end; ++pos) {
-                if (this.byteCount === MAX_HEADER_SIZE)
-                  return -1;
-                ++this.byteCount;
-                const code = chunk[pos];
-                if (FIELD_VCHAR[code] !== 1) {
-                  if (code !== 13/* '\r' */)
-                    return -1;
-                  ++this.crlf;
-                  break;
-                }
-              }
-              this.value += chunk.latin1Slice(start, pos++);
-              break;
-            case 1: // Received CR
-              if (this.byteCount === MAX_HEADER_SIZE)
-                return -1;
-              ++this.byteCount;
-              if (chunk[pos++] !== 10/* '\n' */)
-                return -1;
-              ++this.crlf;
-              break;
-            case 2: { // Received CR LF
-              if (this.byteCount === MAX_HEADER_SIZE)
-                return -1;
-              ++this.byteCount;
-              const code = chunk[pos];
-              if (code === 32/* ' ' */ || code === 9/* '\t' */) {
-                // Folded value
-                start = pos;
-                this.crlf = 0;
-              } else {
-                if (++this.pairCount < MAX_HEADER_PAIRS) {
-                  this.name = this.name.toLowerCase();
-                  if (this.header[this.name] === undefined)
-                    this.header[this.name] = [this.value];
-                  else
-                    this.header[this.name].push(this.value);
-                }
-                if (code === 13/* '\r' */) {
-                  ++this.crlf;
-                  ++pos;
-                } else {
-                  // Assume start of next header field name
-                  start = pos;
-                  this.crlf = 0;
-                  this.state = HPARSER_NAME;
-                  this.name = '';
-                  this.value = '';
-                }
-              }
-              break;
-            }
-            case 3: { // Received CR LF CR
-              if (this.byteCount === MAX_HEADER_SIZE)
-                return -1;
-              ++this.byteCount;
-              if (chunk[pos++] !== 10/* '\n' */)
-                return -1;
-              // End of header
-              const header = this.header;
-              this.reset();
-              this.cb(header);
-              return pos;
-            }
-          }
-          break;
-      }
-    }
-
-    return pos;
-  }
-}
-
-class FileStream extends Readable {
-  constructor(opts, owner) {
-    super(opts);
-    this.truncated = false;
-    this._readcb = null;
-    this.once('end', () => {
-      // We need to make sure that we call any outstanding _writecb() that is
-      // associated with this file so that processing of the rest of the form
-      // can continue. This may not happen if the file stream ends right after
-      // backpressure kicks in, so we force it here.
-      this._read();
-      if (--owner._fileEndsLeft === 0 && owner._finalcb) {
-        const cb = owner._finalcb;
-        owner._finalcb = null;
-        // Make sure other 'end' event handlers get a chance to be executed
-        // before busboy's 'finish' event is emitted
-        process.nextTick(cb);
-      }
-    });
-  }
-  _read(n) {
-    const cb = this._readcb;
-    if (cb) {
-      this._readcb = null;
-      cb();
-    }
-  }
-}
-
-const ignoreData = {
-  push: (chunk, pos) => {},
-  destroy: () => {},
-};
-
-function callAndUnsetCb(self, err) {
-  const cb = self._writecb;
-  self._writecb = null;
-  if (err)
-    self.destroy(err);
-  else if (cb)
-    cb();
-}
-
-function nullDecoder(val, hint) {
-  return val;
-}
-
-class Multipart extends Writable {
-  constructor(cfg) {
-    const streamOpts = {
-      autoDestroy: true,
-      emitClose: true,
-      highWaterMark: (typeof cfg.highWaterMark === 'number'
-                      ? cfg.highWaterMark
-                      : undefined),
-    };
-    super(streamOpts);
-
-    if (!cfg.conType.params || typeof cfg.conType.params.boundary !== 'string')
-      throw new Error('Multipart: Boundary not found');
-
-    const boundary = cfg.conType.params.boundary;
-    const paramDecoder = (typeof cfg.defParamCharset === 'string'
-                            && cfg.defParamCharset
-                          ? getDecoder(cfg.defParamCharset)
-                          : nullDecoder);
-    const defCharset = (cfg.defCharset || 'utf8');
-    const preservePath = cfg.preservePath;
-    const fileOpts = {
-      autoDestroy: true,
-      emitClose: true,
-      highWaterMark: (typeof cfg.fileHwm === 'number'
-                      ? cfg.fileHwm
-                      : undefined),
-    };
-
-    const limits = cfg.limits;
-    const fieldSizeLimit = (limits && typeof limits.fieldSize === 'number'
-                            ? limits.fieldSize
-                            : 1 * 1024 * 1024);
-    const fileSizeLimit = (limits && typeof limits.fileSize === 'number'
-                           ? limits.fileSize
-                           : Infinity);
-    const filesLimit = (limits && typeof limits.files === 'number'
-                        ? limits.files
-                        : Infinity);
-    const fieldsLimit = (limits && typeof limits.fields === 'number'
-                         ? limits.fields
-                         : Infinity);
-    const partsLimit = (limits && typeof limits.parts === 'number'
-                        ? limits.parts
-                        : Infinity);
-
-    let parts = -1; // Account for initial boundary
-    let fields = 0;
-    let files = 0;
-    let skipPart = false;
-
-    this._fileEndsLeft = 0;
-    this._fileStream = undefined;
-    this._complete = false;
-    let fileSize = 0;
-
-    let field;
-    let fieldSize = 0;
-    let partCharset;
-    let partEncoding;
-    let partType;
-    let partName;
-    let partTruncated = false;
-
-    let hitFilesLimit = false;
-    let hitFieldsLimit = false;
-
-    this._hparser = null;
-    const hparser = new HeaderParser((header) => {
-      this._hparser = null;
-      skipPart = false;
-
-      partType = 'text/plain';
-      partCharset = defCharset;
-      partEncoding = '7bit';
-      partName = undefined;
-      partTruncated = false;
-
-      let filename;
-      if (!header['content-disposition']) {
-        skipPart = true;
-        return;
-      }
-
-      const disp = parseDisposition(header['content-disposition'][0],
-                                    paramDecoder);
-      if (!disp || disp.type !== 'form-data') {
-        skipPart = true;
-        return;
-      }
-
-      if (disp.params) {
-        if (disp.params.name)
-          partName = disp.params.name;
-
-        if (disp.params['filename*'])
-          filename = disp.params['filename*'];
-        else if (disp.params.filename)
-          filename = disp.params.filename;
-
-        if (filename !== undefined && !preservePath)
-          filename = basename(filename);
-      }
-
-      if (header['content-type']) {
-        const conType = parseContentType(header['content-type'][0]);
-        if (conType) {
-          partType = `${conType.type}/${conType.subtype}`;
-          if (conType.params && typeof conType.params.charset === 'string')
-            partCharset = conType.params.charset.toLowerCase();
-        }
-      }
-
-      if (header['content-transfer-encoding'])
-        partEncoding = header['content-transfer-encoding'][0].toLowerCase();
-
-      if (partType === 'application/octet-stream' || filename !== undefined) {
-        // File
-
-        if (files === filesLimit) {
-          if (!hitFilesLimit) {
-            hitFilesLimit = true;
-            this.emit('filesLimit');
-          }
-          skipPart = true;
-          return;
-        }
-        ++files;
-
-        if (this.listenerCount('file') === 0) {
-          skipPart = true;
-          return;
-        }
-
-        fileSize = 0;
-        this._fileStream = new FileStream(fileOpts, this);
-        ++this._fileEndsLeft;
-        this.emit(
-          'file',
-          partName,
-          this._fileStream,
-          { filename,
-            encoding: partEncoding,
-            mimeType: partType }
-        );
-      } else {
-        // Non-file
-
-        if (fields === fieldsLimit) {
-          if (!hitFieldsLimit) {
-            hitFieldsLimit = true;
-            this.emit('fieldsLimit');
-          }
-          skipPart = true;
-          return;
-        }
-        ++fields;
-
-        if (this.listenerCount('field') === 0) {
-          skipPart = true;
-          return;
-        }
-
-        field = [];
-        fieldSize = 0;
-      }
-    });
-
-    let matchPostBoundary = 0;
-    const ssCb = (isMatch, data, start, end, isDataSafe) => {
-retrydata:
-      while (data) {
-        if (this._hparser !== null) {
-          const ret = this._hparser.push(data, start, end);
-          if (ret === -1) {
-            this._hparser = null;
-            hparser.reset();
-            this.emit('error', new Error('Malformed part header'));
-            break;
-          }
-          start = ret;
-        }
-
-        if (start === end)
-          break;
-
-        if (matchPostBoundary !== 0) {
-          if (matchPostBoundary === 1) {
-            switch (data[start]) {
-              case 45: // '-'
-                // Try matching '--' after boundary
-                matchPostBoundary = 2;
-                ++start;
-                break;
-              case 13: // '\r'
-                // Try matching CR LF before header
-                matchPostBoundary = 3;
-                ++start;
-                break;
-              default:
-                matchPostBoundary = 0;
-            }
-            if (start === end)
-              return;
-          }
-
-          if (matchPostBoundary === 2) {
-            matchPostBoundary = 0;
-            if (data[start] === 45/* '-' */) {
-              // End of multipart data
-              this._complete = true;
-              this._bparser = ignoreData;
-              return;
-            }
-            // We saw something other than '-', so put the dash we consumed
-            // "back"
-            const writecb = this._writecb;
-            this._writecb = noop;
-            ssCb(false, BUF_DASH, 0, 1, false);
-            this._writecb = writecb;
-          } else if (matchPostBoundary === 3) {
-            matchPostBoundary = 0;
-            if (data[start] === 10/* '\n' */) {
-              ++start;
-              if (parts >= partsLimit)
-                break;
-              // Prepare the header parser
-              this._hparser = hparser;
-              if (start === end)
-                break;
-              // Process the remaining data as a header
-              continue retrydata;
-            } else {
-              // We saw something other than LF, so put the CR we consumed
-              // "back"
-              const writecb = this._writecb;
-              this._writecb = noop;
-              ssCb(false, BUF_CR, 0, 1, false);
-              this._writecb = writecb;
-            }
-          }
-        }
-
-        if (!skipPart) {
-          if (this._fileStream) {
-            let chunk;
-            const actualLen = Math.min(end - start, fileSizeLimit - fileSize);
-            if (!isDataSafe) {
-              chunk = Buffer.allocUnsafe(actualLen);
-              data.copy(chunk, 0, start, start + actualLen);
-            } else {
-              chunk = data.slice(start, start + actualLen);
-            }
-
-            fileSize += chunk.length;
-            if (fileSize === fileSizeLimit) {
-              if (chunk.length > 0)
-                this._fileStream.push(chunk);
-              this._fileStream.emit('limit');
-              this._fileStream.truncated = true;
-              skipPart = true;
-            } else if (!this._fileStream.push(chunk)) {
-              if (this._writecb)
-                this._fileStream._readcb = this._writecb;
-              this._writecb = null;
-            }
-          } else if (field !== undefined) {
-            let chunk;
-            const actualLen = Math.min(
-              end - start,
-              fieldSizeLimit - fieldSize
-            );
-            if (!isDataSafe) {
-              chunk = Buffer.allocUnsafe(actualLen);
-              data.copy(chunk, 0, start, start + actualLen);
-            } else {
-              chunk = data.slice(start, start + actualLen);
-            }
-
-            fieldSize += actualLen;
-            field.push(chunk);
-            if (fieldSize === fieldSizeLimit) {
-              skipPart = true;
-              partTruncated = true;
-            }
-          }
-        }
-
-        break;
-      }
-
-      if (isMatch) {
-        matchPostBoundary = 1;
-
-        if (this._fileStream) {
-          // End the active file stream if the previous part was a file
-          this._fileStream.push(null);
-          this._fileStream = null;
-        } else if (field !== undefined) {
-          let data;
-          switch (field.length) {
-            case 0:
-              data = '';
-              break;
-            case 1:
-              data = convertToUTF8(field[0], partCharset, 0);
-              break;
-            default:
-              data = convertToUTF8(
-                Buffer.concat(field, fieldSize),
-                partCharset,
-                0
-              );
-          }
-          field = undefined;
-          fieldSize = 0;
-          this.emit(
-            'field',
-            partName,
-            data,
-            { nameTruncated: false,
-              valueTruncated: partTruncated,
-              encoding: partEncoding,
-              mimeType: partType }
-          );
-        }
-
-        if (++parts === partsLimit)
-          this.emit('partsLimit');
-      }
-    };
-    this._bparser = new StreamSearch(`\r\n--${boundary}`, ssCb);
-
-    this._writecb = null;
-    this._finalcb = null;
-
-    // Just in case there is no preamble
-    this.write(BUF_CRLF);
-  }
-
-  static detect(conType) {
-    return (conType.type === 'multipart' && conType.subtype === 'form-data');
-  }
-
-  _write(chunk, enc, cb) {
-    this._writecb = cb;
-    this._bparser.push(chunk, 0);
-    if (this._writecb)
-      callAndUnsetCb(this);
-  }
-
-  _destroy(err, cb) {
-    this._hparser = null;
-    this._bparser = ignoreData;
-    if (!err)
-      err = checkEndState(this);
-    const fileStream = this._fileStream;
-    if (fileStream) {
-      this._fileStream = null;
-      fileStream.destroy(err);
-    }
-    cb(err);
-  }
-
-  _final(cb) {
-    this._bparser.destroy();
-    if (!this._complete)
-      return cb(new Error('Unexpected end of form'));
-    if (this._fileEndsLeft)
-      this._finalcb = finalcb.bind(null, this, cb);
-    else
-      finalcb(this, cb);
-  }
-}
-
-function finalcb(self, cb, err) {
-  if (err)
-    return cb(err);
-  err = checkEndState(self);
-  cb(err);
-}
-
-function checkEndState(self) {
-  if (self._hparser)
-    return new Error('Malformed part header');
-  const fileStream = self._fileStream;
-  if (fileStream) {
-    self._fileStream = null;
-    fileStream.destroy(new Error('Unexpected end of file'));
-  }
-  if (!self._complete)
-    return new Error('Unexpected end of form');
-}
-
-const TOKEN = [
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
-  0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-];
-
-const FIELD_VCHAR = [
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-];
-
-module.exports = Multipart;
diff --git a/deps/undici/src/node_modules/busboy/lib/types/urlencoded.js b/deps/undici/src/node_modules/busboy/lib/types/urlencoded.js
deleted file mode 100644
index 5c463a25899a72..00000000000000
--- a/deps/undici/src/node_modules/busboy/lib/types/urlencoded.js
+++ /dev/null
@@ -1,350 +0,0 @@
-'use strict';
-
-const { Writable } = require('stream');
-
-const { getDecoder } = require('../utils.js');
-
-class URLEncoded extends Writable {
-  constructor(cfg) {
-    const streamOpts = {
-      autoDestroy: true,
-      emitClose: true,
-      highWaterMark: (typeof cfg.highWaterMark === 'number'
-                      ? cfg.highWaterMark
-                      : undefined),
-    };
-    super(streamOpts);
-
-    let charset = (cfg.defCharset || 'utf8');
-    if (cfg.conType.params && typeof cfg.conType.params.charset === 'string')
-      charset = cfg.conType.params.charset;
-
-    this.charset = charset;
-
-    const limits = cfg.limits;
-    this.fieldSizeLimit = (limits && typeof limits.fieldSize === 'number'
-                           ? limits.fieldSize
-                           : 1 * 1024 * 1024);
-    this.fieldsLimit = (limits && typeof limits.fields === 'number'
-                        ? limits.fields
-                        : Infinity);
-    this.fieldNameSizeLimit = (
-      limits && typeof limits.fieldNameSize === 'number'
-      ? limits.fieldNameSize
-      : 100
-    );
-
-    this._inKey = true;
-    this._keyTrunc = false;
-    this._valTrunc = false;
-    this._bytesKey = 0;
-    this._bytesVal = 0;
-    this._fields = 0;
-    this._key = '';
-    this._val = '';
-    this._byte = -2;
-    this._lastPos = 0;
-    this._encode = 0;
-    this._decoder = getDecoder(charset);
-  }
-
-  static detect(conType) {
-    return (conType.type === 'application'
-            && conType.subtype === 'x-www-form-urlencoded');
-  }
-
-  _write(chunk, enc, cb) {
-    if (this._fields >= this.fieldsLimit)
-      return cb();
-
-    let i = 0;
-    const len = chunk.length;
-    this._lastPos = 0;
-
-    // Check if we last ended mid-percent-encoded byte
-    if (this._byte !== -2) {
-      i = readPctEnc(this, chunk, i, len);
-      if (i === -1)
-        return cb(new Error('Malformed urlencoded form'));
-      if (i >= len)
-        return cb();
-      if (this._inKey)
-        ++this._bytesKey;
-      else
-        ++this._bytesVal;
-    }
-
-main:
-    while (i < len) {
-      if (this._inKey) {
-        // Parsing key
-
-        i = skipKeyBytes(this, chunk, i, len);
-
-        while (i < len) {
-          switch (chunk[i]) {
-            case 61: // '='
-              if (this._lastPos < i)
-                this._key += chunk.latin1Slice(this._lastPos, i);
-              this._lastPos = ++i;
-              this._key = this._decoder(this._key, this._encode);
-              this._encode = 0;
-              this._inKey = false;
-              continue main;
-            case 38: // '&'
-              if (this._lastPos < i)
-                this._key += chunk.latin1Slice(this._lastPos, i);
-              this._lastPos = ++i;
-              this._key = this._decoder(this._key, this._encode);
-              this._encode = 0;
-              if (this._bytesKey > 0) {
-                this.emit(
-                  'field',
-                  this._key,
-                  '',
-                  { nameTruncated: this._keyTrunc,
-                    valueTruncated: false,
-                    encoding: this.charset,
-                    mimeType: 'text/plain' }
-                );
-              }
-              this._key = '';
-              this._val = '';
-              this._keyTrunc = false;
-              this._valTrunc = false;
-              this._bytesKey = 0;
-              this._bytesVal = 0;
-              if (++this._fields >= this.fieldsLimit) {
-                this.emit('fieldsLimit');
-                return cb();
-              }
-              continue;
-            case 43: // '+'
-              if (this._lastPos < i)
-                this._key += chunk.latin1Slice(this._lastPos, i);
-              this._key += ' ';
-              this._lastPos = i + 1;
-              break;
-            case 37: // '%'
-              if (this._encode === 0)
-                this._encode = 1;
-              if (this._lastPos < i)
-                this._key += chunk.latin1Slice(this._lastPos, i);
-              this._lastPos = i + 1;
-              this._byte = -1;
-              i = readPctEnc(this, chunk, i + 1, len);
-              if (i === -1)
-                return cb(new Error('Malformed urlencoded form'));
-              if (i >= len)
-                return cb();
-              ++this._bytesKey;
-              i = skipKeyBytes(this, chunk, i, len);
-              continue;
-          }
-          ++i;
-          ++this._bytesKey;
-          i = skipKeyBytes(this, chunk, i, len);
-        }
-        if (this._lastPos < i)
-          this._key += chunk.latin1Slice(this._lastPos, i);
-      } else {
-        // Parsing value
-
-        i = skipValBytes(this, chunk, i, len);
-
-        while (i < len) {
-          switch (chunk[i]) {
-            case 38: // '&'
-              if (this._lastPos < i)
-                this._val += chunk.latin1Slice(this._lastPos, i);
-              this._lastPos = ++i;
-              this._inKey = true;
-              this._val = this._decoder(this._val, this._encode);
-              this._encode = 0;
-              if (this._bytesKey > 0 || this._bytesVal > 0) {
-                this.emit(
-                  'field',
-                  this._key,
-                  this._val,
-                  { nameTruncated: this._keyTrunc,
-                    valueTruncated: this._valTrunc,
-                    encoding: this.charset,
-                    mimeType: 'text/plain' }
-                );
-              }
-              this._key = '';
-              this._val = '';
-              this._keyTrunc = false;
-              this._valTrunc = false;
-              this._bytesKey = 0;
-              this._bytesVal = 0;
-              if (++this._fields >= this.fieldsLimit) {
-                this.emit('fieldsLimit');
-                return cb();
-              }
-              continue main;
-            case 43: // '+'
-              if (this._lastPos < i)
-                this._val += chunk.latin1Slice(this._lastPos, i);
-              this._val += ' ';
-              this._lastPos = i + 1;
-              break;
-            case 37: // '%'
-              if (this._encode === 0)
-                this._encode = 1;
-              if (this._lastPos < i)
-                this._val += chunk.latin1Slice(this._lastPos, i);
-              this._lastPos = i + 1;
-              this._byte = -1;
-              i = readPctEnc(this, chunk, i + 1, len);
-              if (i === -1)
-                return cb(new Error('Malformed urlencoded form'));
-              if (i >= len)
-                return cb();
-              ++this._bytesVal;
-              i = skipValBytes(this, chunk, i, len);
-              continue;
-          }
-          ++i;
-          ++this._bytesVal;
-          i = skipValBytes(this, chunk, i, len);
-        }
-        if (this._lastPos < i)
-          this._val += chunk.latin1Slice(this._lastPos, i);
-      }
-    }
-
-    cb();
-  }
-
-  _final(cb) {
-    if (this._byte !== -2)
-      return cb(new Error('Malformed urlencoded form'));
-    if (!this._inKey || this._bytesKey > 0 || this._bytesVal > 0) {
-      if (this._inKey)
-        this._key = this._decoder(this._key, this._encode);
-      else
-        this._val = this._decoder(this._val, this._encode);
-      this.emit(
-        'field',
-        this._key,
-        this._val,
-        { nameTruncated: this._keyTrunc,
-          valueTruncated: this._valTrunc,
-          encoding: this.charset,
-          mimeType: 'text/plain' }
-      );
-    }
-    cb();
-  }
-}
-
-function readPctEnc(self, chunk, pos, len) {
-  if (pos >= len)
-    return len;
-
-  if (self._byte === -1) {
-    // We saw a '%' but no hex characters yet
-    const hexUpper = HEX_VALUES[chunk[pos++]];
-    if (hexUpper === -1)
-      return -1;
-
-    if (hexUpper >= 8)
-      self._encode = 2; // Indicate high bits detected
-
-    if (pos < len) {
-      // Both hex characters are in this chunk
-      const hexLower = HEX_VALUES[chunk[pos++]];
-      if (hexLower === -1)
-        return -1;
-
-      if (self._inKey)
-        self._key += String.fromCharCode((hexUpper << 4) + hexLower);
-      else
-        self._val += String.fromCharCode((hexUpper << 4) + hexLower);
-
-      self._byte = -2;
-      self._lastPos = pos;
-    } else {
-      // Only one hex character was available in this chunk
-      self._byte = hexUpper;
-    }
-  } else {
-    // We saw only one hex character so far
-    const hexLower = HEX_VALUES[chunk[pos++]];
-    if (hexLower === -1)
-      return -1;
-
-    if (self._inKey)
-      self._key += String.fromCharCode((self._byte << 4) + hexLower);
-    else
-      self._val += String.fromCharCode((self._byte << 4) + hexLower);
-
-    self._byte = -2;
-    self._lastPos = pos;
-  }
-
-  return pos;
-}
-
-function skipKeyBytes(self, chunk, pos, len) {
-  // Skip bytes if we've truncated
-  if (self._bytesKey > self.fieldNameSizeLimit) {
-    if (!self._keyTrunc) {
-      if (self._lastPos < pos)
-        self._key += chunk.latin1Slice(self._lastPos, pos - 1);
-    }
-    self._keyTrunc = true;
-    for (; pos < len; ++pos) {
-      const code = chunk[pos];
-      if (code === 61/* '=' */ || code === 38/* '&' */)
-        break;
-      ++self._bytesKey;
-    }
-    self._lastPos = pos;
-  }
-
-  return pos;
-}
-
-function skipValBytes(self, chunk, pos, len) {
-  // Skip bytes if we've truncated
-  if (self._bytesVal > self.fieldSizeLimit) {
-    if (!self._valTrunc) {
-      if (self._lastPos < pos)
-        self._val += chunk.latin1Slice(self._lastPos, pos - 1);
-    }
-    self._valTrunc = true;
-    for (; pos < len; ++pos) {
-      if (chunk[pos] === 38/* '&' */)
-        break;
-      ++self._bytesVal;
-    }
-    self._lastPos = pos;
-  }
-
-  return pos;
-}
-
-/* eslint-disable no-multi-spaces */
-const HEX_VALUES = [
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-   0,  1,  2,  3,  4,  5,  6,  7,  8,  9, -1, -1, -1, -1, -1, -1,
-  -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-];
-/* eslint-enable no-multi-spaces */
-
-module.exports = URLEncoded;
diff --git a/deps/undici/src/node_modules/busboy/lib/utils.js b/deps/undici/src/node_modules/busboy/lib/utils.js
deleted file mode 100644
index 8274f6c3aef47a..00000000000000
--- a/deps/undici/src/node_modules/busboy/lib/utils.js
+++ /dev/null
@@ -1,596 +0,0 @@
-'use strict';
-
-function parseContentType(str) {
-  if (str.length === 0)
-    return;
-
-  const params = Object.create(null);
-  let i = 0;
-
-  // Parse type
-  for (; i < str.length; ++i) {
-    const code = str.charCodeAt(i);
-    if (TOKEN[code] !== 1) {
-      if (code !== 47/* '/' */ || i === 0)
-        return;
-      break;
-    }
-  }
-  // Check for type without subtype
-  if (i === str.length)
-    return;
-
-  const type = str.slice(0, i).toLowerCase();
-
-  // Parse subtype
-  const subtypeStart = ++i;
-  for (; i < str.length; ++i) {
-    const code = str.charCodeAt(i);
-    if (TOKEN[code] !== 1) {
-      // Make sure we have a subtype
-      if (i === subtypeStart)
-        return;
-
-      if (parseContentTypeParams(str, i, params) === undefined)
-        return;
-      break;
-    }
-  }
-  // Make sure we have a subtype
-  if (i === subtypeStart)
-    return;
-
-  const subtype = str.slice(subtypeStart, i).toLowerCase();
-
-  return { type, subtype, params };
-}
-
-function parseContentTypeParams(str, i, params) {
-  while (i < str.length) {
-    // Consume whitespace
-    for (; i < str.length; ++i) {
-      const code = str.charCodeAt(i);
-      if (code !== 32/* ' ' */ && code !== 9/* '\t' */)
-        break;
-    }
-
-    // Ended on whitespace
-    if (i === str.length)
-      break;
-
-    // Check for malformed parameter
-    if (str.charCodeAt(i++) !== 59/* ';' */)
-      return;
-
-    // Consume whitespace
-    for (; i < str.length; ++i) {
-      const code = str.charCodeAt(i);
-      if (code !== 32/* ' ' */ && code !== 9/* '\t' */)
-        break;
-    }
-
-    // Ended on whitespace (malformed)
-    if (i === str.length)
-      return;
-
-    let name;
-    const nameStart = i;
-    // Parse parameter name
-    for (; i < str.length; ++i) {
-      const code = str.charCodeAt(i);
-      if (TOKEN[code] !== 1) {
-        if (code !== 61/* '=' */)
-          return;
-        break;
-      }
-    }
-
-    // No value (malformed)
-    if (i === str.length)
-      return;
-
-    name = str.slice(nameStart, i);
-    ++i; // Skip over '='
-
-    // No value (malformed)
-    if (i === str.length)
-      return;
-
-    let value = '';
-    let valueStart;
-    if (str.charCodeAt(i) === 34/* '"' */) {
-      valueStart = ++i;
-      let escaping = false;
-      // Parse quoted value
-      for (; i < str.length; ++i) {
-        const code = str.charCodeAt(i);
-        if (code === 92/* '\\' */) {
-          if (escaping) {
-            valueStart = i;
-            escaping = false;
-          } else {
-            value += str.slice(valueStart, i);
-            escaping = true;
-          }
-          continue;
-        }
-        if (code === 34/* '"' */) {
-          if (escaping) {
-            valueStart = i;
-            escaping = false;
-            continue;
-          }
-          value += str.slice(valueStart, i);
-          break;
-        }
-        if (escaping) {
-          valueStart = i - 1;
-          escaping = false;
-        }
-        // Invalid unescaped quoted character (malformed)
-        if (QDTEXT[code] !== 1)
-          return;
-      }
-
-      // No end quote (malformed)
-      if (i === str.length)
-        return;
-
-      ++i; // Skip over double quote
-    } else {
-      valueStart = i;
-      // Parse unquoted value
-      for (; i < str.length; ++i) {
-        const code = str.charCodeAt(i);
-        if (TOKEN[code] !== 1) {
-          // No value (malformed)
-          if (i === valueStart)
-            return;
-          break;
-        }
-      }
-      value = str.slice(valueStart, i);
-    }
-
-    name = name.toLowerCase();
-    if (params[name] === undefined)
-      params[name] = value;
-  }
-
-  return params;
-}
-
-function parseDisposition(str, defDecoder) {
-  if (str.length === 0)
-    return;
-
-  const params = Object.create(null);
-  let i = 0;
-
-  for (; i < str.length; ++i) {
-    const code = str.charCodeAt(i);
-    if (TOKEN[code] !== 1) {
-      if (parseDispositionParams(str, i, params, defDecoder) === undefined)
-        return;
-      break;
-    }
-  }
-
-  const type = str.slice(0, i).toLowerCase();
-
-  return { type, params };
-}
-
-function parseDispositionParams(str, i, params, defDecoder) {
-  while (i < str.length) {
-    // Consume whitespace
-    for (; i < str.length; ++i) {
-      const code = str.charCodeAt(i);
-      if (code !== 32/* ' ' */ && code !== 9/* '\t' */)
-        break;
-    }
-
-    // Ended on whitespace
-    if (i === str.length)
-      break;
-
-    // Check for malformed parameter
-    if (str.charCodeAt(i++) !== 59/* ';' */)
-      return;
-
-    // Consume whitespace
-    for (; i < str.length; ++i) {
-      const code = str.charCodeAt(i);
-      if (code !== 32/* ' ' */ && code !== 9/* '\t' */)
-        break;
-    }
-
-    // Ended on whitespace (malformed)
-    if (i === str.length)
-      return;
-
-    let name;
-    const nameStart = i;
-    // Parse parameter name
-    for (; i < str.length; ++i) {
-      const code = str.charCodeAt(i);
-      if (TOKEN[code] !== 1) {
-        if (code === 61/* '=' */)
-          break;
-        return;
-      }
-    }
-
-    // No value (malformed)
-    if (i === str.length)
-      return;
-
-    let value = '';
-    let valueStart;
-    let charset;
-    //~ let lang;
-    name = str.slice(nameStart, i);
-    if (name.charCodeAt(name.length - 1) === 42/* '*' */) {
-      // Extended value
-
-      const charsetStart = ++i;
-      // Parse charset name
-      for (; i < str.length; ++i) {
-        const code = str.charCodeAt(i);
-        if (CHARSET[code] !== 1) {
-          if (code !== 39/* '\'' */)
-            return;
-          break;
-        }
-      }
-
-      // Incomplete charset (malformed)
-      if (i === str.length)
-        return;
-
-      charset = str.slice(charsetStart, i);
-      ++i; // Skip over the '\''
-
-      //~ const langStart = ++i;
-      // Parse language name
-      for (; i < str.length; ++i) {
-        const code = str.charCodeAt(i);
-        if (code === 39/* '\'' */)
-          break;
-      }
-
-      // Incomplete language (malformed)
-      if (i === str.length)
-        return;
-
-      //~ lang = str.slice(langStart, i);
-      ++i; // Skip over the '\''
-
-      // No value (malformed)
-      if (i === str.length)
-        return;
-
-      valueStart = i;
-
-      let encode = 0;
-      // Parse value
-      for (; i < str.length; ++i) {
-        const code = str.charCodeAt(i);
-        if (EXTENDED_VALUE[code] !== 1) {
-          if (code === 37/* '%' */) {
-            let hexUpper;
-            let hexLower;
-            if (i + 2 < str.length
-                && (hexUpper = HEX_VALUES[str.charCodeAt(i + 1)]) !== -1
-                && (hexLower = HEX_VALUES[str.charCodeAt(i + 2)]) !== -1) {
-              const byteVal = (hexUpper << 4) + hexLower;
-              value += str.slice(valueStart, i);
-              value += String.fromCharCode(byteVal);
-              i += 2;
-              valueStart = i + 1;
-              if (byteVal >= 128)
-                encode = 2;
-              else if (encode === 0)
-                encode = 1;
-              continue;
-            }
-            // '%' disallowed in non-percent encoded contexts (malformed)
-            return;
-          }
-          break;
-        }
-      }
-
-      value += str.slice(valueStart, i);
-      value = convertToUTF8(value, charset, encode);
-      if (value === undefined)
-        return;
-    } else {
-      // Non-extended value
-
-      ++i; // Skip over '='
-
-      // No value (malformed)
-      if (i === str.length)
-        return;
-
-      if (str.charCodeAt(i) === 34/* '"' */) {
-        valueStart = ++i;
-        let escaping = false;
-        // Parse quoted value
-        for (; i < str.length; ++i) {
-          const code = str.charCodeAt(i);
-          if (code === 92/* '\\' */) {
-            if (escaping) {
-              valueStart = i;
-              escaping = false;
-            } else {
-              value += str.slice(valueStart, i);
-              escaping = true;
-            }
-            continue;
-          }
-          if (code === 34/* '"' */) {
-            if (escaping) {
-              valueStart = i;
-              escaping = false;
-              continue;
-            }
-            value += str.slice(valueStart, i);
-            break;
-          }
-          if (escaping) {
-            valueStart = i - 1;
-            escaping = false;
-          }
-          // Invalid unescaped quoted character (malformed)
-          if (QDTEXT[code] !== 1)
-            return;
-        }
-
-        // No end quote (malformed)
-        if (i === str.length)
-          return;
-
-        ++i; // Skip over double quote
-      } else {
-        valueStart = i;
-        // Parse unquoted value
-        for (; i < str.length; ++i) {
-          const code = str.charCodeAt(i);
-          if (TOKEN[code] !== 1) {
-            // No value (malformed)
-            if (i === valueStart)
-              return;
-            break;
-          }
-        }
-        value = str.slice(valueStart, i);
-      }
-
-      value = defDecoder(value, 2);
-      if (value === undefined)
-        return;
-    }
-
-    name = name.toLowerCase();
-    if (params[name] === undefined)
-      params[name] = value;
-  }
-
-  return params;
-}
-
-function getDecoder(charset) {
-  let lc;
-  while (true) {
-    switch (charset) {
-      case 'utf-8':
-      case 'utf8':
-        return decoders.utf8;
-      case 'latin1':
-      case 'ascii': // TODO: Make these a separate, strict decoder?
-      case 'us-ascii':
-      case 'iso-8859-1':
-      case 'iso8859-1':
-      case 'iso88591':
-      case 'iso_8859-1':
-      case 'windows-1252':
-      case 'iso_8859-1:1987':
-      case 'cp1252':
-      case 'x-cp1252':
-        return decoders.latin1;
-      case 'utf16le':
-      case 'utf-16le':
-      case 'ucs2':
-      case 'ucs-2':
-        return decoders.utf16le;
-      case 'base64':
-        return decoders.base64;
-      default:
-        if (lc === undefined) {
-          lc = true;
-          charset = charset.toLowerCase();
-          continue;
-        }
-        return decoders.other.bind(charset);
-    }
-  }
-}
-
-const decoders = {
-  utf8: (data, hint) => {
-    if (data.length === 0)
-      return '';
-    if (typeof data === 'string') {
-      // If `data` never had any percent-encoded bytes or never had any that
-      // were outside of the ASCII range, then we can safely just return the
-      // input since UTF-8 is ASCII compatible
-      if (hint < 2)
-        return data;
-
-      data = Buffer.from(data, 'latin1');
-    }
-    return data.utf8Slice(0, data.length);
-  },
-
-  latin1: (data, hint) => {
-    if (data.length === 0)
-      return '';
-    if (typeof data === 'string')
-      return data;
-    return data.latin1Slice(0, data.length);
-  },
-
-  utf16le: (data, hint) => {
-    if (data.length === 0)
-      return '';
-    if (typeof data === 'string')
-      data = Buffer.from(data, 'latin1');
-    return data.ucs2Slice(0, data.length);
-  },
-
-  base64: (data, hint) => {
-    if (data.length === 0)
-      return '';
-    if (typeof data === 'string')
-      data = Buffer.from(data, 'latin1');
-    return data.base64Slice(0, data.length);
-  },
-
-  other: (data, hint) => {
-    if (data.length === 0)
-      return '';
-    if (typeof data === 'string')
-      data = Buffer.from(data, 'latin1');
-    try {
-      const decoder = new TextDecoder(this);
-      return decoder.decode(data);
-    } catch {}
-  },
-};
-
-function convertToUTF8(data, charset, hint) {
-  const decode = getDecoder(charset);
-  if (decode)
-    return decode(data, hint);
-}
-
-function basename(path) {
-  if (typeof path !== 'string')
-    return '';
-  for (let i = path.length - 1; i >= 0; --i) {
-    switch (path.charCodeAt(i)) {
-      case 0x2F: // '/'
-      case 0x5C: // '\'
-        path = path.slice(i + 1);
-        return (path === '..' || path === '.' ? '' : path);
-    }
-  }
-  return (path === '..' || path === '.' ? '' : path);
-}
-
-const TOKEN = [
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
-  0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-];
-
-const QDTEXT = [
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-];
-
-const CHARSET = [
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
-  0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-];
-
-const EXTENDED_VALUE = [
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
-  0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
-  1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-  0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
-];
-
-/* eslint-disable no-multi-spaces */
-const HEX_VALUES = [
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-   0,  1,  2,  3,  4,  5,  6,  7,  8,  9, -1, -1, -1, -1, -1, -1,
-  -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-  -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
-];
-/* eslint-enable no-multi-spaces */
-
-module.exports = {
-  basename,
-  convertToUTF8,
-  getDecoder,
-  parseContentType,
-  parseDisposition,
-};
diff --git a/deps/undici/src/node_modules/busboy/package.json b/deps/undici/src/node_modules/busboy/package.json
deleted file mode 100644
index ac2577fe2c5873..00000000000000
--- a/deps/undici/src/node_modules/busboy/package.json
+++ /dev/null
@@ -1,22 +0,0 @@
-{ "name": "busboy",
-  "version": "1.6.0",
-  "author": "Brian White <mscdex@mscdex.net>",
-  "description": "A streaming parser for HTML form data for node.js",
-  "main": "./lib/index.js",
-  "dependencies": {
-    "streamsearch": "^1.1.0"
-  },
-  "devDependencies": {
-    "@mscdex/eslint-config": "^1.1.0",
-    "eslint": "^7.32.0"
-  },
-  "scripts": {
-    "test": "node test/test.js",
-    "lint": "eslint --cache --report-unused-disable-directives --ext=.js .eslintrc.js lib test bench",
-    "lint:fix": "npm run lint -- --fix"
-  },
-  "engines": { "node": ">=10.16.0" },
-  "keywords": [ "uploads", "forms", "multipart", "form-data" ],
-  "licenses": [ { "type": "MIT", "url": "http://github.com/mscdex/busboy/raw/master/LICENSE" } ],
-  "repository": { "type": "git", "url": "http://github.com/mscdex/busboy.git" }
-}
diff --git a/deps/undici/src/node_modules/busboy/test/common.js b/deps/undici/src/node_modules/busboy/test/common.js
deleted file mode 100644
index fb82ad81b1b9ef..00000000000000
--- a/deps/undici/src/node_modules/busboy/test/common.js
+++ /dev/null
@@ -1,109 +0,0 @@
-'use strict';
-
-const assert = require('assert');
-const { inspect } = require('util');
-
-const mustCallChecks = [];
-
-function noop() {}
-
-function runCallChecks(exitCode) {
-  if (exitCode !== 0) return;
-
-  const failed = mustCallChecks.filter((context) => {
-    if ('minimum' in context) {
-      context.messageSegment = `at least ${context.minimum}`;
-      return context.actual < context.minimum;
-    }
-    context.messageSegment = `exactly ${context.exact}`;
-    return context.actual !== context.exact;
-  });
-
-  failed.forEach((context) => {
-    console.error('Mismatched %s function calls. Expected %s, actual %d.',
-                  context.name,
-                  context.messageSegment,
-                  context.actual);
-    console.error(context.stack.split('\n').slice(2).join('\n'));
-  });
-
-  if (failed.length)
-    process.exit(1);
-}
-
-function mustCall(fn, exact) {
-  return _mustCallInner(fn, exact, 'exact');
-}
-
-function mustCallAtLeast(fn, minimum) {
-  return _mustCallInner(fn, minimum, 'minimum');
-}
-
-function _mustCallInner(fn, criteria = 1, field) {
-  if (process._exiting)
-    throw new Error('Cannot use common.mustCall*() in process exit handler');
-
-  if (typeof fn === 'number') {
-    criteria = fn;
-    fn = noop;
-  } else if (fn === undefined) {
-    fn = noop;
-  }
-
-  if (typeof criteria !== 'number')
-    throw new TypeError(`Invalid ${field} value: ${criteria}`);
-
-  const context = {
-    [field]: criteria,
-    actual: 0,
-    stack: inspect(new Error()),
-    name: fn.name || '<anonymous>'
-  };
-
-  // Add the exit listener only once to avoid listener leak warnings
-  if (mustCallChecks.length === 0)
-    process.on('exit', runCallChecks);
-
-  mustCallChecks.push(context);
-
-  function wrapped(...args) {
-    ++context.actual;
-    return fn.call(this, ...args);
-  }
-  // TODO: remove origFn?
-  wrapped.origFn = fn;
-
-  return wrapped;
-}
-
-function getCallSite(top) {
-  const originalStackFormatter = Error.prepareStackTrace;
-  Error.prepareStackTrace = (err, stack) =>
-    `${stack[0].getFileName()}:${stack[0].getLineNumber()}`;
-  const err = new Error();
-  Error.captureStackTrace(err, top);
-  // With the V8 Error API, the stack is not formatted until it is accessed
-  // eslint-disable-next-line no-unused-expressions
-  err.stack;
-  Error.prepareStackTrace = originalStackFormatter;
-  return err.stack;
-}
-
-function mustNotCall(msg) {
-  const callSite = getCallSite(mustNotCall);
-  return function mustNotCall(...args) {
-    args = args.map(inspect).join(', ');
-    const argsInfo = (args.length > 0
-                      ? `\ncalled with arguments: ${args}`
-                      : '');
-    assert.fail(
-      `${msg || 'function should not have been called'} at ${callSite}`
-        + argsInfo);
-  };
-}
-
-module.exports = {
-  mustCall,
-  mustCallAtLeast,
-  mustNotCall,
-};
diff --git a/deps/undici/src/node_modules/busboy/test/test-types-multipart-charsets.js b/deps/undici/src/node_modules/busboy/test/test-types-multipart-charsets.js
deleted file mode 100644
index ed9c38aeb6c1f3..00000000000000
--- a/deps/undici/src/node_modules/busboy/test/test-types-multipart-charsets.js
+++ /dev/null
@@ -1,94 +0,0 @@
-'use strict';
-
-const assert = require('assert');
-const { inspect } = require('util');
-
-const { mustCall } = require(`${__dirname}/common.js`);
-
-const busboy = require('..');
-
-const input = Buffer.from([
-  '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
- 'Content-Disposition: form-data; '
-   + 'name="upload_file_0"; filename="テスト.dat"',
- 'Content-Type: application/octet-stream',
- '',
- 'A'.repeat(1023),
- '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--'
-].join('\r\n'));
-const boundary = '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k';
-const expected = [
-  { type: 'file',
-    name: 'upload_file_0',
-    data: Buffer.from('A'.repeat(1023)),
-    info: {
-      filename: 'テスト.dat',
-      encoding: '7bit',
-      mimeType: 'application/octet-stream',
-    },
-    limited: false,
-  },
-];
-const bb = busboy({
-  defParamCharset: 'utf8',
-  headers: {
-    'content-type': `multipart/form-data; boundary=${boundary}`,
-  }
-});
-const results = [];
-
-bb.on('field', (name, val, info) => {
-  results.push({ type: 'field', name, val, info });
-});
-
-bb.on('file', (name, stream, info) => {
-  const data = [];
-  let nb = 0;
-  const file = {
-    type: 'file',
-    name,
-    data: null,
-    info,
-    limited: false,
-  };
-  results.push(file);
-  stream.on('data', (d) => {
-    data.push(d);
-    nb += d.length;
-  }).on('limit', () => {
-    file.limited = true;
-  }).on('close', () => {
-    file.data = Buffer.concat(data, nb);
-    assert.strictEqual(stream.truncated, file.limited);
-  }).once('error', (err) => {
-    file.err = err.message;
-  });
-});
-
-bb.on('error', (err) => {
-  results.push({ error: err.message });
-});
-
-bb.on('partsLimit', () => {
-  results.push('partsLimit');
-});
-
-bb.on('filesLimit', () => {
-  results.push('filesLimit');
-});
-
-bb.on('fieldsLimit', () => {
-  results.push('fieldsLimit');
-});
-
-bb.on('close', mustCall(() => {
-  assert.deepStrictEqual(
-    results,
-    expected,
-    'Results mismatch.\n'
-      + `Parsed: ${inspect(results)}\n`
-      + `Expected: ${inspect(expected)}`
-  );
-}));
-
-bb.end(input);
diff --git a/deps/undici/src/node_modules/busboy/test/test-types-multipart-stream-pause.js b/deps/undici/src/node_modules/busboy/test/test-types-multipart-stream-pause.js
deleted file mode 100644
index df7268a4b17f73..00000000000000
--- a/deps/undici/src/node_modules/busboy/test/test-types-multipart-stream-pause.js
+++ /dev/null
@@ -1,102 +0,0 @@
-'use strict';
-
-const assert = require('assert');
-const { randomFillSync } = require('crypto');
-const { inspect } = require('util');
-
-const busboy = require('..');
-
-const { mustCall } = require('./common.js');
-
-const BOUNDARY = 'u2KxIV5yF1y+xUspOQCCZopaVgeV6Jxihv35XQJmuTx8X3sh';
-
-function formDataSection(key, value) {
-  return Buffer.from(
-    `\r\n--${BOUNDARY}`
-      + `\r\nContent-Disposition: form-data; name="${key}"`
-      + `\r\n\r\n${value}`
-  );
-}
-
-function formDataFile(key, filename, contentType) {
-  const buf = Buffer.allocUnsafe(100000);
-  return Buffer.concat([
-    Buffer.from(`\r\n--${BOUNDARY}\r\n`),
-    Buffer.from(`Content-Disposition: form-data; name="${key}"`
-                  + `; filename="${filename}"\r\n`),
-    Buffer.from(`Content-Type: ${contentType}\r\n\r\n`),
-    randomFillSync(buf)
-  ]);
-}
-
-const reqChunks = [
-  Buffer.concat([
-    formDataFile('file', 'file.bin', 'application/octet-stream'),
-    formDataSection('foo', 'foo value'),
-  ]),
-  formDataSection('bar', 'bar value'),
-  Buffer.from(`\r\n--${BOUNDARY}--\r\n`)
-];
-const bb = busboy({
-  headers: {
-    'content-type': `multipart/form-data; boundary=${BOUNDARY}`
-  }
-});
-const expected = [
-  { type: 'file',
-    name: 'file',
-    info: {
-      filename: 'file.bin',
-      encoding: '7bit',
-      mimeType: 'application/octet-stream',
-    },
-  },
-  { type: 'field',
-    name: 'foo',
-    val: 'foo value',
-    info: {
-      nameTruncated: false,
-      valueTruncated: false,
-      encoding: '7bit',
-      mimeType: 'text/plain',
-    },
-  },
-  { type: 'field',
-    name: 'bar',
-    val: 'bar value',
-    info: {
-      nameTruncated: false,
-      valueTruncated: false,
-      encoding: '7bit',
-      mimeType: 'text/plain',
-    },
-  },
-];
-const results = [];
-
-bb.on('field', (name, val, info) => {
-  results.push({ type: 'field', name, val, info });
-});
-
-bb.on('file', (name, stream, info) => {
-  results.push({ type: 'file', name, info });
-  // Simulate a pipe where the destination is pausing (perhaps due to waiting
-  // for file system write to finish)
-  setTimeout(() => {
-    stream.resume();
-  }, 10);
-});
-
-bb.on('close', mustCall(() => {
-  assert.deepStrictEqual(
-    results,
-    expected,
-    'Results mismatch.\n'
-      + `Parsed: ${inspect(results)}\n`
-      + `Expected: ${inspect(expected)}`
-  );
-}));
-
-for (const chunk of reqChunks)
-  bb.write(chunk);
-bb.end();
diff --git a/deps/undici/src/node_modules/busboy/test/test-types-multipart.js b/deps/undici/src/node_modules/busboy/test/test-types-multipart.js
deleted file mode 100644
index 9755642ad9060c..00000000000000
--- a/deps/undici/src/node_modules/busboy/test/test-types-multipart.js
+++ /dev/null
@@ -1,1053 +0,0 @@
-'use strict';
-
-const assert = require('assert');
-const { inspect } = require('util');
-
-const busboy = require('..');
-
-const active = new Map();
-
-const tests = [
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_0"',
-       '',
-       'super alpha file',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_1"',
-       '',
-       'super beta file',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="1k_a.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'A'.repeat(1023),
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_1"; filename="1k_b.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'B'.repeat(1023),
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--'
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'field',
-        name: 'file_name_0',
-        val: 'super alpha file',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      { type: 'field',
-        name: 'file_name_1',
-        val: 'super beta file',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('A'.repeat(1023)),
-        info: {
-          filename: '1k_a.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-      { type: 'file',
-        name: 'upload_file_1',
-        data: Buffer.from('B'.repeat(1023)),
-        info: {
-          filename: '1k_b.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Fields and files'
-  },
-  { source: [
-      ['------WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-       'Content-Disposition: form-data; name="cont"',
-       '',
-       'some random content',
-       '------WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-       'Content-Disposition: form-data; name="pass"',
-       '',
-       'some random pass',
-       '------WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-       'Content-Disposition: form-data; name=bit',
-       '',
-       '2',
-       '------WebKitFormBoundaryTB2MiQ36fnSJlrhY--'
-      ].join('\r\n')
-    ],
-    boundary: '----WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-    expected: [
-      { type: 'field',
-        name: 'cont',
-        val: 'some random content',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      { type: 'field',
-        name: 'pass',
-        val: 'some random pass',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      { type: 'field',
-        name: 'bit',
-        val: '2',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-    ],
-    what: 'Fields only'
-  },
-  { source: [
-      ''
-    ],
-    boundary: '----WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-    expected: [
-      { error: 'Unexpected end of form' },
-    ],
-    what: 'No fields and no files'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_0"',
-       '',
-       'super alpha file',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="1k_a.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--'
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    limits: {
-      fileSize: 13,
-      fieldSize: 5
-    },
-    expected: [
-      { type: 'field',
-        name: 'file_name_0',
-        val: 'super',
-        info: {
-          nameTruncated: false,
-          valueTruncated: true,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('ABCDEFGHIJKLM'),
-        info: {
-          filename: '1k_a.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: true,
-      },
-    ],
-    what: 'Fields and files (limits)'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_0"',
-       '',
-       'super alpha file',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="1k_a.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--'
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    limits: {
-      files: 0
-    },
-    expected: [
-      { type: 'field',
-        name: 'file_name_0',
-        val: 'super alpha file',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      'filesLimit',
-    ],
-    what: 'Fields and files (limits: 0 files)'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_0"',
-       '',
-       'super alpha file',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_1"',
-       '',
-       'super beta file',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="1k_a.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'A'.repeat(1023),
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_1"; filename="1k_b.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'B'.repeat(1023),
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--'
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'field',
-        name: 'file_name_0',
-        val: 'super alpha file',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      { type: 'field',
-        name: 'file_name_1',
-        val: 'super beta file',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-    ],
-    events: ['field'],
-    what: 'Fields and (ignored) files'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="/tmp/1k_a.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_1"; filename="C:\\files\\1k_b.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_2"; filename="relative/1k_c.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--'
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('ABCDEFGHIJKLMNOPQRSTUVWXYZ'),
-        info: {
-          filename: '1k_a.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-      { type: 'file',
-        name: 'upload_file_1',
-        data: Buffer.from('ABCDEFGHIJKLMNOPQRSTUVWXYZ'),
-        info: {
-          filename: '1k_b.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-      { type: 'file',
-        name: 'upload_file_2',
-        data: Buffer.from('ABCDEFGHIJKLMNOPQRSTUVWXYZ'),
-        info: {
-          filename: '1k_c.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Files with filenames containing paths'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="/absolute/1k_a.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_1"; filename="C:\\absolute\\1k_b.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_2"; filename="relative/1k_c.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--'
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    preservePath: true,
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('ABCDEFGHIJKLMNOPQRSTUVWXYZ'),
-        info: {
-          filename: '/absolute/1k_a.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-      { type: 'file',
-        name: 'upload_file_1',
-        data: Buffer.from('ABCDEFGHIJKLMNOPQRSTUVWXYZ'),
-        info: {
-          filename: 'C:\\absolute\\1k_b.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-      { type: 'file',
-        name: 'upload_file_2',
-        data: Buffer.from('ABCDEFGHIJKLMNOPQRSTUVWXYZ'),
-        info: {
-          filename: 'relative/1k_c.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Paths to be preserved through the preservePath option'
-  },
-  { source: [
-      ['------WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-       'Content-Disposition: form-data; name="cont"',
-       'Content-Type: ',
-       '',
-       'some random content',
-       '------WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-       'Content-Disposition: ',
-       '',
-       'some random pass',
-       '------WebKitFormBoundaryTB2MiQ36fnSJlrhY--'
-      ].join('\r\n')
-    ],
-    boundary: '----WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-    expected: [
-      { type: 'field',
-        name: 'cont',
-        val: 'some random content',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-    ],
-    what: 'Empty content-type and empty content-disposition'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="file"; filename*=utf-8\'\'n%C3%A4me.txt',
-       'Content-Type: application/octet-stream',
-       '',
-       'ABCDEFGHIJKLMNOPQRSTUVWXYZ',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--'
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'file',
-        name: 'file',
-        data: Buffer.from('ABCDEFGHIJKLMNOPQRSTUVWXYZ'),
-        info: {
-          filename: 'näme.txt',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Unicode filenames'
-  },
-  { source: [
-      ['--asdasdasdasd\r\n',
-       'Content-Type: text/plain\r\n',
-       'Content-Disposition: form-data; name="foo"\r\n',
-       '\r\n',
-       'asd\r\n',
-       '--asdasdasdasd--'
-      ].join(':)')
-    ],
-    boundary: 'asdasdasdasd',
-    expected: [
-      { error: 'Malformed part header' },
-      { error: 'Unexpected end of form' },
-    ],
-    what: 'Stopped mid-header'
-  },
-  { source: [
-      ['------WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-       'Content-Disposition: form-data; name="cont"',
-       'Content-Type: application/json',
-       '',
-       '{}',
-       '------WebKitFormBoundaryTB2MiQ36fnSJlrhY--',
-      ].join('\r\n')
-    ],
-    boundary: '----WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-    expected: [
-      { type: 'field',
-        name: 'cont',
-        val: '{}',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'application/json',
-        },
-      },
-    ],
-    what: 'content-type for fields'
-  },
-  { source: [
-      '------WebKitFormBoundaryTB2MiQ36fnSJlrhY--',
-    ],
-    boundary: '----WebKitFormBoundaryTB2MiQ36fnSJlrhY',
-    expected: [],
-    what: 'empty form'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name=upload_file_0; filename="1k_a.dat"',
-       'Content-Type: application/octet-stream',
-       'Content-Transfer-Encoding: binary',
-       '',
-       '',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.alloc(0),
-        info: {
-          filename: '1k_a.dat',
-          encoding: 'binary',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-        err: 'Unexpected end of form',
-      },
-      { error: 'Unexpected end of form' },
-    ],
-    what: 'Stopped mid-file #1'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name=upload_file_0; filename="1k_a.dat"',
-       'Content-Type: application/octet-stream',
-       '',
-       'a',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('a'),
-        info: {
-          filename: '1k_a.dat',
-          encoding: '7bit',
-          mimeType: 'application/octet-stream',
-        },
-        limited: false,
-        err: 'Unexpected end of form',
-      },
-      { error: 'Unexpected end of form' },
-    ],
-    what: 'Stopped mid-file #2'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="notes.txt"',
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'a',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('a'),
-        info: {
-          filename: 'notes.txt',
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Text file with charset'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="notes.txt"',
-       'Content-Type: ',
-       ' text/plain; charset=utf8',
-       '',
-       'a',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('a'),
-        info: {
-          filename: 'notes.txt',
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Folded header value'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'a',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [],
-    what: 'No Content-Disposition'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_0"',
-       '',
-       'a'.repeat(64 * 1024),
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="notes.txt"',
-       'Content-Type: ',
-       ' text/plain; charset=utf8',
-       '',
-       'bc',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    limits: {
-      fieldSize: Infinity,
-    },
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('bc'),
-        info: {
-          filename: 'notes.txt',
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-    ],
-    events: [ 'file' ],
-    what: 'Skip field parts if no listener'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_0"',
-       '',
-       'a',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="notes.txt"',
-       'Content-Type: ',
-       ' text/plain; charset=utf8',
-       '',
-       'bc',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    limits: {
-      parts: 1,
-    },
-    expected: [
-      { type: 'field',
-        name: 'file_name_0',
-        val: 'a',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      'partsLimit',
-    ],
-    what: 'Parts limit'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_0"',
-       '',
-       'a',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; name="file_name_1"',
-       '',
-       'b',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    limits: {
-      fields: 1,
-    },
-    expected: [
-      { type: 'field',
-        name: 'file_name_0',
-        val: 'a',
-        info: {
-          nameTruncated: false,
-          valueTruncated: false,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-      },
-      'fieldsLimit',
-    ],
-    what: 'Fields limit'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="notes.txt"',
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'ab',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_1"; filename="notes2.txt"',
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'cd',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    limits: {
-      files: 1,
-    },
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('ab'),
-        info: {
-          filename: 'notes.txt',
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-      'filesLimit',
-    ],
-    what: 'Files limit'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + `name="upload_file_0"; filename="${'a'.repeat(64 * 1024)}.txt"`,
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'ab',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_1"; filename="notes2.txt"',
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'cd',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { error: 'Malformed part header' },
-      { type: 'file',
-        name: 'upload_file_1',
-        data: Buffer.from('cd'),
-        info: {
-          filename: 'notes2.txt',
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Oversized part header'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + 'name="upload_file_0"; filename="notes.txt"',
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'a'.repeat(31) + '\r',
-      ].join('\r\n'),
-      'b'.repeat(40),
-      '\r\n-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    fileHwm: 32,
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('a'.repeat(31) + '\r' + 'b'.repeat(40)),
-        info: {
-          filename: 'notes.txt',
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Lookbehind data should not stall file streams'
-  },
-  { source: [
-      ['-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + `name="upload_file_0"; filename="${'a'.repeat(8 * 1024)}.txt"`,
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'ab',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + `name="upload_file_1"; filename="${'b'.repeat(8 * 1024)}.txt"`,
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'cd',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-       'Content-Disposition: form-data; '
-         + `name="upload_file_2"; filename="${'c'.repeat(8 * 1024)}.txt"`,
-       'Content-Type: text/plain; charset=utf8',
-       '',
-       'ef',
-       '-----------------------------paZqsnEHRufoShdX6fh0lUhXBP4k--',
-      ].join('\r\n')
-    ],
-    boundary: '---------------------------paZqsnEHRufoShdX6fh0lUhXBP4k',
-    expected: [
-      { type: 'file',
-        name: 'upload_file_0',
-        data: Buffer.from('ab'),
-        info: {
-          filename: `${'a'.repeat(8 * 1024)}.txt`,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-      { type: 'file',
-        name: 'upload_file_1',
-        data: Buffer.from('cd'),
-        info: {
-          filename: `${'b'.repeat(8 * 1024)}.txt`,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-      { type: 'file',
-        name: 'upload_file_2',
-        data: Buffer.from('ef'),
-        info: {
-          filename: `${'c'.repeat(8 * 1024)}.txt`,
-          encoding: '7bit',
-          mimeType: 'text/plain',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Header size limit should be per part'
-  },
-  { source: [
-      '\r\n--d1bf46b3-aa33-4061-b28d-6c5ced8b08ee\r\n',
-      'Content-Type: application/gzip\r\n'
-        + 'Content-Encoding: gzip\r\n'
-        + 'Content-Disposition: form-data; name=batch-1; filename=batch-1'
-        + '\r\n\r\n',
-      '\r\n--d1bf46b3-aa33-4061-b28d-6c5ced8b08ee--',
-    ],
-    boundary: 'd1bf46b3-aa33-4061-b28d-6c5ced8b08ee',
-    expected: [
-      { type: 'file',
-        name: 'batch-1',
-        data: Buffer.alloc(0),
-        info: {
-          filename: 'batch-1',
-          encoding: '7bit',
-          mimeType: 'application/gzip',
-        },
-        limited: false,
-      },
-    ],
-    what: 'Empty part'
-  },
-];
-
-for (const test of tests) {
-  active.set(test, 1);
-
-  const { what, boundary, events, limits, preservePath, fileHwm } = test;
-  const bb = busboy({
-    fileHwm,
-    limits,
-    preservePath,
-    headers: {
-      'content-type': `multipart/form-data; boundary=${boundary}`,
-    }
-  });
-  const results = [];
-
-  if (events === undefined || events.includes('field')) {
-    bb.on('field', (name, val, info) => {
-      results.push({ type: 'field', name, val, info });
-    });
-  }
-
-  if (events === undefined || events.includes('file')) {
-    bb.on('file', (name, stream, info) => {
-      const data = [];
-      let nb = 0;
-      const file = {
-        type: 'file',
-        name,
-        data: null,
-        info,
-        limited: false,
-      };
-      results.push(file);
-      stream.on('data', (d) => {
-        data.push(d);
-        nb += d.length;
-      }).on('limit', () => {
-        file.limited = true;
-      }).on('close', () => {
-        file.data = Buffer.concat(data, nb);
-        assert.strictEqual(stream.truncated, file.limited);
-      }).once('error', (err) => {
-        file.err = err.message;
-      });
-    });
-  }
-
-  bb.on('error', (err) => {
-    results.push({ error: err.message });
-  });
-
-  bb.on('partsLimit', () => {
-    results.push('partsLimit');
-  });
-
-  bb.on('filesLimit', () => {
-    results.push('filesLimit');
-  });
-
-  bb.on('fieldsLimit', () => {
-    results.push('fieldsLimit');
-  });
-
-  bb.on('close', () => {
-    active.delete(test);
-
-    assert.deepStrictEqual(
-      results,
-      test.expected,
-      `[${what}] Results mismatch.\n`
-        + `Parsed: ${inspect(results)}\n`
-        + `Expected: ${inspect(test.expected)}`
-    );
-  });
-
-  for (const src of test.source) {
-    const buf = (typeof src === 'string' ? Buffer.from(src, 'utf8') : src);
-    bb.write(buf);
-  }
-  bb.end();
-}
-
-// Byte-by-byte versions
-for (let test of tests) {
-  test = { ...test };
-  test.what += ' (byte-by-byte)';
-  active.set(test, 1);
-
-  const { what, boundary, events, limits, preservePath, fileHwm } = test;
-  const bb = busboy({
-    fileHwm,
-    limits,
-    preservePath,
-    headers: {
-      'content-type': `multipart/form-data; boundary=${boundary}`,
-    }
-  });
-  const results = [];
-
-  if (events === undefined || events.includes('field')) {
-    bb.on('field', (name, val, info) => {
-      results.push({ type: 'field', name, val, info });
-    });
-  }
-
-  if (events === undefined || events.includes('file')) {
-    bb.on('file', (name, stream, info) => {
-      const data = [];
-      let nb = 0;
-      const file = {
-        type: 'file',
-        name,
-        data: null,
-        info,
-        limited: false,
-      };
-      results.push(file);
-      stream.on('data', (d) => {
-        data.push(d);
-        nb += d.length;
-      }).on('limit', () => {
-        file.limited = true;
-      }).on('close', () => {
-        file.data = Buffer.concat(data, nb);
-        assert.strictEqual(stream.truncated, file.limited);
-      }).once('error', (err) => {
-        file.err = err.message;
-      });
-    });
-  }
-
-  bb.on('error', (err) => {
-    results.push({ error: err.message });
-  });
-
-  bb.on('partsLimit', () => {
-    results.push('partsLimit');
-  });
-
-  bb.on('filesLimit', () => {
-    results.push('filesLimit');
-  });
-
-  bb.on('fieldsLimit', () => {
-    results.push('fieldsLimit');
-  });
-
-  bb.on('close', () => {
-    active.delete(test);
-
-    assert.deepStrictEqual(
-      results,
-      test.expected,
-      `[${what}] Results mismatch.\n`
-        + `Parsed: ${inspect(results)}\n`
-        + `Expected: ${inspect(test.expected)}`
-    );
-  });
-
-  for (const src of test.source) {
-    const buf = (typeof src === 'string' ? Buffer.from(src, 'utf8') : src);
-    for (let i = 0; i < buf.length; ++i)
-      bb.write(buf.slice(i, i + 1));
-  }
-  bb.end();
-}
-
-{
-  let exception = false;
-  process.once('uncaughtException', (ex) => {
-    exception = true;
-    throw ex;
-  });
-  process.on('exit', () => {
-    if (exception || active.size === 0)
-      return;
-    process.exitCode = 1;
-    console.error('==========================');
-    console.error(`${active.size} test(s) did not finish:`);
-    console.error('==========================');
-    console.error(Array.from(active.keys()).map((v) => v.what).join('\n'));
-  });
-}
diff --git a/deps/undici/src/node_modules/busboy/test/test-types-urlencoded.js b/deps/undici/src/node_modules/busboy/test/test-types-urlencoded.js
deleted file mode 100644
index c35962b973f29a..00000000000000
--- a/deps/undici/src/node_modules/busboy/test/test-types-urlencoded.js
+++ /dev/null
@@ -1,488 +0,0 @@
-'use strict';
-
-const assert = require('assert');
-const { transcode } = require('buffer');
-const { inspect } = require('util');
-
-const busboy = require('..');
-
-const active = new Map();
-
-const tests = [
-  { source: ['foo'],
-    expected: [
-      ['foo',
-       '',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Unassigned value'
-  },
-  { source: ['foo=bar'],
-    expected: [
-      ['foo',
-       'bar',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Assigned value'
-  },
-  { source: ['foo&bar=baz'],
-    expected: [
-      ['foo',
-       '',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['bar',
-       'baz',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Unassigned and assigned value'
-  },
-  { source: ['foo=bar&baz'],
-    expected: [
-      ['foo',
-       'bar',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['baz',
-       '',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Assigned and unassigned value'
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [
-      ['foo',
-       'bar',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['baz',
-       'bla',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Two assigned values'
-  },
-  { source: ['foo&bar'],
-    expected: [
-      ['foo',
-       '',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['bar',
-       '',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Two unassigned values'
-  },
-  { source: ['foo&bar&'],
-    expected: [
-      ['foo',
-       '',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['bar',
-       '',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Two unassigned values and ampersand'
-  },
-  { source: ['foo+1=bar+baz%2Bquux'],
-    expected: [
-      ['foo 1',
-       'bar baz+quux',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Assigned key and value with (plus) space'
-  },
-  { source: ['foo=bar%20baz%21'],
-    expected: [
-      ['foo',
-       'bar baz!',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Assigned value with encoded bytes'
-  },
-  { source: ['foo%20bar=baz%20bla%21'],
-    expected: [
-      ['foo bar',
-       'baz bla!',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Assigned value with encoded bytes #2'
-  },
-  { source: ['foo=bar%20baz%21&num=1000'],
-    expected: [
-      ['foo',
-       'bar baz!',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['num',
-       '1000',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Two assigned values, one with encoded bytes'
-  },
-  { source: [
-      Array.from(transcode(Buffer.from('foo'), 'utf8', 'utf16le')).map(
-        (n) => `%${n.toString(16).padStart(2, '0')}`
-      ).join(''),
-      '=',
-      Array.from(transcode(Buffer.from('😀!'), 'utf8', 'utf16le')).map(
-        (n) => `%${n.toString(16).padStart(2, '0')}`
-      ).join(''),
-    ],
-    expected: [
-      ['foo',
-       '😀!',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'UTF-16LE',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    charset: 'UTF-16LE',
-    what: 'Encoded value with multi-byte charset'
-  },
-  { source: [
-      'foo=<',
-      Array.from(transcode(Buffer.from('©:^þ'), 'utf8', 'latin1')).map(
-        (n) => `%${n.toString(16).padStart(2, '0')}`
-      ).join(''),
-    ],
-    expected: [
-      ['foo',
-       '<©:^þ',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'ISO-8859-1',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    charset: 'ISO-8859-1',
-    what: 'Encoded value with single-byte, ASCII-compatible, non-UTF8 charset'
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [],
-    what: 'Limits: zero fields',
-    limits: { fields: 0 }
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [
-      ['foo',
-       'bar',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Limits: one field',
-    limits: { fields: 1 }
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [
-      ['foo',
-       'bar',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['baz',
-       'bla',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Limits: field part lengths match limits',
-    limits: { fieldNameSize: 3, fieldSize: 3 }
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [
-      ['fo',
-       'bar',
-       { nameTruncated: true,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['ba',
-       'bla',
-       { nameTruncated: true,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Limits: truncated field name',
-    limits: { fieldNameSize: 2 }
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [
-      ['foo',
-       'ba',
-       { nameTruncated: false,
-         valueTruncated: true,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['baz',
-       'bl',
-       { nameTruncated: false,
-         valueTruncated: true,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Limits: truncated field value',
-    limits: { fieldSize: 2 }
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [
-      ['fo',
-       'ba',
-       { nameTruncated: true,
-         valueTruncated: true,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['ba',
-       'bl',
-       { nameTruncated: true,
-         valueTruncated: true,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Limits: truncated field name and value',
-    limits: { fieldNameSize: 2, fieldSize: 2 }
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [
-      ['fo',
-       '',
-       { nameTruncated: true,
-         valueTruncated: true,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['ba',
-       '',
-       { nameTruncated: true,
-         valueTruncated: true,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Limits: truncated field name and zero value limit',
-    limits: { fieldNameSize: 2, fieldSize: 0 }
-  },
-  { source: ['foo=bar&baz=bla'],
-    expected: [
-      ['',
-       '',
-       { nameTruncated: true,
-         valueTruncated: true,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-      ['',
-       '',
-       { nameTruncated: true,
-         valueTruncated: true,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Limits: truncated zero field name and zero value limit',
-    limits: { fieldNameSize: 0, fieldSize: 0 }
-  },
-  { source: ['&'],
-    expected: [],
-    what: 'Ampersand'
-  },
-  { source: ['&&&&&'],
-    expected: [],
-    what: 'Many ampersands'
-  },
-  { source: ['='],
-    expected: [
-      ['',
-       '',
-       { nameTruncated: false,
-         valueTruncated: false,
-         encoding: 'utf-8',
-         mimeType: 'text/plain' },
-      ],
-    ],
-    what: 'Assigned value, empty name and value'
-  },
-  { source: [''],
-    expected: [],
-    what: 'Nothing'
-  },
-];
-
-for (const test of tests) {
-  active.set(test, 1);
-
-  const { what } = test;
-  const charset = test.charset || 'utf-8';
-  const bb = busboy({
-    limits: test.limits,
-    headers: {
-      'content-type': `application/x-www-form-urlencoded; charset=${charset}`,
-    },
-  });
-  const results = [];
-
-  bb.on('field', (key, val, info) => {
-    results.push([key, val, info]);
-  });
-
-  bb.on('file', () => {
-    throw new Error(`[${what}] Unexpected file`);
-  });
-
-  bb.on('close', () => {
-    active.delete(test);
-
-    assert.deepStrictEqual(
-      results,
-      test.expected,
-      `[${what}] Results mismatch.\n`
-        + `Parsed: ${inspect(results)}\n`
-        + `Expected: ${inspect(test.expected)}`
-    );
-  });
-
-  for (const src of test.source) {
-    const buf = (typeof src === 'string' ? Buffer.from(src, 'utf8') : src);
-    bb.write(buf);
-  }
-  bb.end();
-}
-
-// Byte-by-byte versions
-for (let test of tests) {
-  test = { ...test };
-  test.what += ' (byte-by-byte)';
-  active.set(test, 1);
-
-  const { what } = test;
-  const charset = test.charset || 'utf-8';
-  const bb = busboy({
-    limits: test.limits,
-    headers: {
-      'content-type': `application/x-www-form-urlencoded; charset="${charset}"`,
-    },
-  });
-  const results = [];
-
-  bb.on('field', (key, val, info) => {
-    results.push([key, val, info]);
-  });
-
-  bb.on('file', () => {
-    throw new Error(`[${what}] Unexpected file`);
-  });
-
-  bb.on('close', () => {
-    active.delete(test);
-
-    assert.deepStrictEqual(
-      results,
-      test.expected,
-      `[${what}] Results mismatch.\n`
-        + `Parsed: ${inspect(results)}\n`
-        + `Expected: ${inspect(test.expected)}`
-    );
-  });
-
-  for (const src of test.source) {
-    const buf = (typeof src === 'string' ? Buffer.from(src, 'utf8') : src);
-    for (let i = 0; i < buf.length; ++i)
-      bb.write(buf.slice(i, i + 1));
-  }
-  bb.end();
-}
-
-{
-  let exception = false;
-  process.once('uncaughtException', (ex) => {
-    exception = true;
-    throw ex;
-  });
-  process.on('exit', () => {
-    if (exception || active.size === 0)
-      return;
-    process.exitCode = 1;
-    console.error('==========================');
-    console.error(`${active.size} test(s) did not finish:`);
-    console.error('==========================');
-    console.error(Array.from(active.keys()).map((v) => v.what).join('\n'));
-  });
-}
diff --git a/deps/undici/src/node_modules/busboy/test/test.js b/deps/undici/src/node_modules/busboy/test/test.js
deleted file mode 100644
index d0380f29de7842..00000000000000
--- a/deps/undici/src/node_modules/busboy/test/test.js
+++ /dev/null
@@ -1,20 +0,0 @@
-'use strict';
-
-const { spawnSync } = require('child_process');
-const { readdirSync } = require('fs');
-const { join } = require('path');
-
-const files = readdirSync(__dirname).sort();
-for (const filename of files) {
-  if (filename.startsWith('test-')) {
-    const path = join(__dirname, filename);
-    console.log(`> Running ${filename} ...`);
-    const result = spawnSync(`${process.argv0} ${path}`, {
-      shell: true,
-      stdio: 'inherit',
-      windowsHide: true
-    });
-    if (result.status !== 0)
-      process.exitCode = 1;
-  }
-}
diff --git a/deps/undici/src/node_modules/streamsearch/.eslintrc.js b/deps/undici/src/node_modules/streamsearch/.eslintrc.js
deleted file mode 100644
index be9311d02655a2..00000000000000
--- a/deps/undici/src/node_modules/streamsearch/.eslintrc.js
+++ /dev/null
@@ -1,5 +0,0 @@
-'use strict';
-
-module.exports = {
-  extends: '@mscdex/eslint-config',
-};
diff --git a/deps/undici/src/node_modules/streamsearch/.github/workflows/ci.yml b/deps/undici/src/node_modules/streamsearch/.github/workflows/ci.yml
deleted file mode 100644
index 29d51782c77a93..00000000000000
--- a/deps/undici/src/node_modules/streamsearch/.github/workflows/ci.yml
+++ /dev/null
@@ -1,24 +0,0 @@
-name: CI
-
-on:
-  pull_request:
-  push:
-    branches: [ master ]
-
-jobs:
-  tests-linux:
-    runs-on: ubuntu-latest
-    strategy:
-      fail-fast: false
-      matrix:
-        node-version: [10.x, 12.x, 14.x, 16.x]
-    steps:
-      - uses: actions/checkout@v2
-      - name: Use Node.js ${{ matrix.node-version }}
-        uses: actions/setup-node@v1
-        with:
-          node-version: ${{ matrix.node-version }}
-      - name: Install module
-        run: npm install
-      - name: Run tests
-        run: npm test
diff --git a/deps/undici/src/node_modules/streamsearch/.github/workflows/lint.yml b/deps/undici/src/node_modules/streamsearch/.github/workflows/lint.yml
deleted file mode 100644
index 9f9e1f589a30be..00000000000000
--- a/deps/undici/src/node_modules/streamsearch/.github/workflows/lint.yml
+++ /dev/null
@@ -1,23 +0,0 @@
-name: lint
-
-on:
-  pull_request:
-  push:
-    branches: [ master ]
-
-env:
-  NODE_VERSION: 16.x
-
-jobs:
-  lint-js:
-    runs-on: ubuntu-latest
-    steps:
-      - uses: actions/checkout@v2
-      - name: Use Node.js ${{ env.NODE_VERSION }}
-        uses: actions/setup-node@v1
-        with:
-          node-version: ${{ env.NODE_VERSION }}
-      - name: Install ESLint + ESLint configs/plugins
-        run: npm install --only=dev
-      - name: Lint files
-        run: npm run lint
diff --git a/deps/undici/src/node_modules/streamsearch/README.md b/deps/undici/src/node_modules/streamsearch/README.md
deleted file mode 100644
index c3934d1c7d5711..00000000000000
--- a/deps/undici/src/node_modules/streamsearch/README.md
+++ /dev/null
@@ -1,95 +0,0 @@
-Description
-===========
-
-streamsearch is a module for [node.js](http://nodejs.org/) that allows searching a stream using the Boyer-Moore-Horspool algorithm.
-
-This module is based heavily on the Streaming Boyer-Moore-Horspool C++ implementation by Hongli Lai [here](https://github.com/FooBarWidget/boyer-moore-horspool).
-
-
-Requirements
-============
-
-* [node.js](http://nodejs.org/) -- v10.0.0 or newer
-
-
-Installation
-============
-
-    npm install streamsearch
-
-Example
-=======
-
-```js
-  const { inspect } = require('util');
-
-  const StreamSearch = require('streamsearch');
-
-  const needle = Buffer.from('\r\n');
-  const ss = new StreamSearch(needle, (isMatch, data, start, end) => {
-    if (data)
-      console.log('data: ' + inspect(data.toString('latin1', start, end)));
-    if (isMatch)
-      console.log('match!');
-  });
-
-  const chunks = [
-    'foo',
-    ' bar',
-    '\r',
-    '\n',
-    'baz, hello\r',
-    '\n world.',
-    '\r\n Node.JS rules!!\r\n\r\n',
-  ];
-  for (const chunk of chunks)
-    ss.push(Buffer.from(chunk));
-
-  // output:
-  //
-  // data: 'foo'
-  // data: ' bar'
-  // match!
-  // data: 'baz, hello'
-  // match!
-  // data: ' world.'
-  // match!
-  // data: ' Node.JS rules!!'
-  // match!
-  // data: ''
-  // match!
-```
-
-
-API
-===
-
-Properties
-----------
-
-* **maxMatches** - < _integer_ > - The maximum number of matches. Defaults to `Infinity`.
-
-* **matches** - < _integer_ > - The current match count.
-
-
-Functions
----------
-
-* **(constructor)**(< _mixed_ >needle, < _function_ >callback) - Creates and returns a new instance for searching for a _Buffer_ or _string_ `needle`. `callback` is called any time there is non-matching data and/or there is a needle match. `callback` will be called with the following arguments:
-
-  1. `isMatch` - _boolean_ - Indicates whether a match has been found
-
-  2. `data` - _mixed_ - If set, this contains data that did not match the needle.
-
-  3. `start` - _integer_ - The index in `data` where the non-matching data begins (inclusive).
-
-  4. `end` - _integer_ - The index in `data` where the non-matching data ends (exclusive).
-
-  5. `isSafeData` - _boolean_ - Indicates if it is safe to store a reference to `data` (e.g. as-is or via `data.slice()`) or not, as in some cases `data` may point to a Buffer whose contents change over time.
-
-* **destroy**() - _(void)_ - Emits any last remaining unmatched data that may still be buffered and then resets internal state.
-
-* **push**(< _Buffer_ >chunk) - _integer_ - Processes `chunk`, searching for a match. The return value is the last processed index in `chunk` + 1.
-
-* **reset**() - _(void)_ - Resets internal state. Useful for when you wish to start searching a new/different stream for example.
-
diff --git a/deps/undici/src/node_modules/streamsearch/lib/sbmh.js b/deps/undici/src/node_modules/streamsearch/lib/sbmh.js
deleted file mode 100644
index 510cae26e67a58..00000000000000
--- a/deps/undici/src/node_modules/streamsearch/lib/sbmh.js
+++ /dev/null
@@ -1,267 +0,0 @@
-'use strict';
-/*
-  Based heavily on the Streaming Boyer-Moore-Horspool C++ implementation
-  by Hongli Lai at: https://github.com/FooBarWidget/boyer-moore-horspool
-*/
-function memcmp(buf1, pos1, buf2, pos2, num) {
-  for (let i = 0; i < num; ++i) {
-    if (buf1[pos1 + i] !== buf2[pos2 + i])
-      return false;
-  }
-  return true;
-}
-
-class SBMH {
-  constructor(needle, cb) {
-    if (typeof cb !== 'function')
-      throw new Error('Missing match callback');
-
-    if (typeof needle === 'string')
-      needle = Buffer.from(needle);
-    else if (!Buffer.isBuffer(needle))
-      throw new Error(`Expected Buffer for needle, got ${typeof needle}`);
-
-    const needleLen = needle.length;
-
-    this.maxMatches = Infinity;
-    this.matches = 0;
-
-    this._cb = cb;
-    this._lookbehindSize = 0;
-    this._needle = needle;
-    this._bufPos = 0;
-
-    this._lookbehind = Buffer.allocUnsafe(needleLen);
-
-    // Initialize occurrence table.
-    this._occ = [
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen, needleLen, needleLen,
-      needleLen, needleLen, needleLen, needleLen
-    ];
-
-    // Populate occurrence table with analysis of the needle, ignoring the last
-    // letter.
-    if (needleLen > 1) {
-      for (let i = 0; i < needleLen - 1; ++i)
-        this._occ[needle[i]] = needleLen - 1 - i;
-    }
-  }
-
-  reset() {
-    this.matches = 0;
-    this._lookbehindSize = 0;
-    this._bufPos = 0;
-  }
-
-  push(chunk, pos) {
-    let result;
-    if (!Buffer.isBuffer(chunk))
-      chunk = Buffer.from(chunk, 'latin1');
-    const chunkLen = chunk.length;
-    this._bufPos = pos || 0;
-    while (result !== chunkLen && this.matches < this.maxMatches)
-      result = feed(this, chunk);
-    return result;
-  }
-
-  destroy() {
-    const lbSize = this._lookbehindSize;
-    if (lbSize)
-      this._cb(false, this._lookbehind, 0, lbSize, false);
-    this.reset();
-  }
-}
-
-function feed(self, data) {
-  const len = data.length;
-  const needle = self._needle;
-  const needleLen = needle.length;
-
-  // Positive: points to a position in `data`
-  //           pos == 3 points to data[3]
-  // Negative: points to a position in the lookbehind buffer
-  //           pos == -2 points to lookbehind[lookbehindSize - 2]
-  let pos = -self._lookbehindSize;
-  const lastNeedleCharPos = needleLen - 1;
-  const lastNeedleChar = needle[lastNeedleCharPos];
-  const end = len - needleLen;
-  const occ = self._occ;
-  const lookbehind = self._lookbehind;
-
-  if (pos < 0) {
-    // Lookbehind buffer is not empty. Perform Boyer-Moore-Horspool
-    // search with character lookup code that considers both the
-    // lookbehind buffer and the current round's haystack data.
-    //
-    // Loop until
-    //   there is a match.
-    // or until
-    //   we've moved past the position that requires the
-    //   lookbehind buffer. In this case we switch to the
-    //   optimized loop.
-    // or until
-    //   the character to look at lies outside the haystack.
-    while (pos < 0 && pos <= end) {
-      const nextPos = pos + lastNeedleCharPos;
-      const ch = (nextPos < 0
-                  ? lookbehind[self._lookbehindSize + nextPos]
-                  : data[nextPos]);
-
-      if (ch === lastNeedleChar
-          && matchNeedle(self, data, pos, lastNeedleCharPos)) {
-        self._lookbehindSize = 0;
-        ++self.matches;
-        if (pos > -self._lookbehindSize)
-          self._cb(true, lookbehind, 0, self._lookbehindSize + pos, false);
-        else
-          self._cb(true, undefined, 0, 0, true);
-
-        return (self._bufPos = pos + needleLen);
-      }
-
-      pos += occ[ch];
-    }
-
-    // No match.
-
-    // There's too few data for Boyer-Moore-Horspool to run,
-    // so let's use a different algorithm to skip as much as
-    // we can.
-    // Forward pos until
-    //   the trailing part of lookbehind + data
-    //   looks like the beginning of the needle
-    // or until
-    //   pos == 0
-    while (pos < 0 && !matchNeedle(self, data, pos, len - pos))
-      ++pos;
-
-    if (pos < 0) {
-      // Cut off part of the lookbehind buffer that has
-      // been processed and append the entire haystack
-      // into it.
-      const bytesToCutOff = self._lookbehindSize + pos;
-
-      if (bytesToCutOff > 0) {
-        // The cut off data is guaranteed not to contain the needle.
-        self._cb(false, lookbehind, 0, bytesToCutOff, false);
-      }
-
-      self._lookbehindSize -= bytesToCutOff;
-      lookbehind.copy(lookbehind, 0, bytesToCutOff, self._lookbehindSize);
-      lookbehind.set(data, self._lookbehindSize);
-      self._lookbehindSize += len;
-
-      self._bufPos = len;
-      return len;
-    }
-
-    // Discard lookbehind buffer.
-    self._cb(false, lookbehind, 0, self._lookbehindSize, false);
-    self._lookbehindSize = 0;
-  }
-
-  pos += self._bufPos;
-
-  const firstNeedleChar = needle[0];
-
-  // Lookbehind buffer is now empty. Perform Boyer-Moore-Horspool
-  // search with optimized character lookup code that only considers
-  // the current round's haystack data.
-  while (pos <= end) {
-    const ch = data[pos + lastNeedleCharPos];
-
-    if (ch === lastNeedleChar
-        && data[pos] === firstNeedleChar
-        && memcmp(needle, 0, data, pos, lastNeedleCharPos)) {
-      ++self.matches;
-      if (pos > 0)
-        self._cb(true, data, self._bufPos, pos, true);
-      else
-        self._cb(true, undefined, 0, 0, true);
-
-      return (self._bufPos = pos + needleLen);
-    }
-
-    pos += occ[ch];
-  }
-
-  // There was no match. If there's trailing haystack data that we cannot
-  // match yet using the Boyer-Moore-Horspool algorithm (because the trailing
-  // data is less than the needle size) then match using a modified
-  // algorithm that starts matching from the beginning instead of the end.
-  // Whatever trailing data is left after running this algorithm is added to
-  // the lookbehind buffer.
-  while (pos < len) {
-    if (data[pos] !== firstNeedleChar
-        || !memcmp(data, pos, needle, 0, len - pos)) {
-      ++pos;
-      continue;
-    }
-    data.copy(lookbehind, 0, pos, len);
-    self._lookbehindSize = len - pos;
-    break;
-  }
-
-  // Everything until `pos` is guaranteed not to contain needle data.
-  if (pos > 0)
-    self._cb(false, data, self._bufPos, pos < len ? pos : len, true);
-
-  self._bufPos = len;
-  return len;
-}
-
-function matchNeedle(self, data, pos, len) {
-  const lb = self._lookbehind;
-  const lbSize = self._lookbehindSize;
-  const needle = self._needle;
-
-  for (let i = 0; i < len; ++i, ++pos) {
-    const ch = (pos < 0 ? lb[lbSize + pos] : data[pos]);
-    if (ch !== needle[i])
-      return false;
-  }
-  return true;
-}
-
-module.exports = SBMH;
diff --git a/deps/undici/src/node_modules/streamsearch/package.json b/deps/undici/src/node_modules/streamsearch/package.json
deleted file mode 100644
index 51df8f9707cebd..00000000000000
--- a/deps/undici/src/node_modules/streamsearch/package.json
+++ /dev/null
@@ -1,34 +0,0 @@
-{
-  "name": "streamsearch",
-  "version": "1.1.0",
-  "author": "Brian White <mscdex@mscdex.net>",
-  "description": "Streaming Boyer-Moore-Horspool searching for node.js",
-  "main": "./lib/sbmh.js",
-  "engines": {
-    "node": ">=10.0.0"
-  },
-  "devDependencies": {
-    "@mscdex/eslint-config": "^1.1.0",
-    "eslint": "^7.32.0"
-  },
-  "scripts": {
-    "test": "node test/test.js",
-    "lint": "eslint --cache --report-unused-disable-directives --ext=.js .eslintrc.js lib test",
-    "lint:fix": "npm run lint -- --fix"
-  },
-  "keywords": [
-    "stream",
-    "horspool",
-    "boyer-moore-horspool",
-    "boyer-moore",
-    "search"
-  ],
-  "licenses": [{
-    "type": "MIT",
-    "url": "http://github.com/mscdex/streamsearch/raw/master/LICENSE"
-  }],
-  "repository": {
-    "type": "git",
-    "url": "http://github.com/mscdex/streamsearch.git"
-  }
-}
diff --git a/deps/undici/src/node_modules/streamsearch/test/test.js b/deps/undici/src/node_modules/streamsearch/test/test.js
deleted file mode 100644
index 39a04d7f834bea..00000000000000
--- a/deps/undici/src/node_modules/streamsearch/test/test.js
+++ /dev/null
@@ -1,70 +0,0 @@
-'use strict';
-
-const assert = require('assert');
-
-const StreamSearch = require('../lib/sbmh.js');
-
-[
-  {
-    needle: '\r\n',
-    chunks: [
-      'foo',
-      ' bar',
-      '\r',
-      '\n',
-      'baz, hello\r',
-      '\n world.',
-      '\r\n Node.JS rules!!\r\n\r\n',
-    ],
-    expect: [
-      [false, 'foo'],
-      [false, ' bar'],
-      [ true, null],
-      [false, 'baz, hello'],
-      [ true, null],
-      [false, ' world.'],
-      [ true, null],
-      [ true, ' Node.JS rules!!'],
-      [ true, ''],
-    ],
-  },
-  {
-    needle: '---foobarbaz',
-    chunks: [
-      '---foobarbaz',
-      'asdf',
-      '\r\n',
-      '---foobarba',
-      '---foobar',
-      'ba',
-      '\r\n---foobarbaz--\r\n',
-    ],
-    expect: [
-      [ true, null],
-      [false, 'asdf'],
-      [false, '\r\n'],
-      [false, '---foobarba'],
-      [false, '---foobarba'],
-      [ true, '\r\n'],
-      [false, '--\r\n'],
-    ],
-  },
-].forEach((test, i) => {
-  console.log(`Running test #${i + 1}`);
-  const { needle, chunks, expect } = test;
-
-  const results = [];
-  const ss = new StreamSearch(Buffer.from(needle),
-                              (isMatch, data, start, end) => {
-    if (data)
-      data = data.toString('latin1', start, end);
-    else
-      data = null;
-    results.push([isMatch, data]);
-  });
-
-  for (const chunk of chunks)
-    ss.push(Buffer.from(chunk));
-
-  assert.deepStrictEqual(results, expect);
-});
diff --git a/deps/undici/src/package.json b/deps/undici/src/package.json
index 598a78654a9845..67046ad68a3541 100644
--- a/deps/undici/src/package.json
+++ b/deps/undici/src/package.json
@@ -1,6 +1,6 @@
 {
   "name": "undici",
-  "version": "5.23.0",
+  "version": "5.26.3",
   "description": "An HTTP/1.1 client, written from scratch for Node.js",
   "homepage": "https://undici.nodejs.org",
   "bugs": {
@@ -11,12 +11,41 @@
     "url": "git+https://github.com/nodejs/undici.git"
   },
   "license": "MIT",
-  "author": "Matteo Collina <hello@matteocollina.com>",
   "contributors": [
+    {
+      "name": "Daniele Belardi",
+      "url": "https://github.com/dnlup",
+      "author": true
+    },
+    {
+      "name": "Ethan Arrowood",
+      "url": "https://github.com/ethan-arrowood",
+      "author": true
+    },
+    {
+      "name": "Matteo Collina",
+      "url": "https://github.com/mcollina",
+      "author": true
+    },
+    {
+      "name": "Matthew Aitken",
+      "url": "https://github.com/KhafraDev",
+      "author": true
+    },
     {
       "name": "Robert Nagy",
       "url": "https://github.com/ronag",
       "author": true
+    },
+    {
+      "name": "Szymon Marczak",
+      "url": "https://github.com/szmarczak",
+      "author": true
+    },
+    {
+      "name": "Tomas Della Vedova",
+      "url": "https://github.com/delvedor",
+      "author": true
     }
   ],
   "keywords": [
@@ -38,15 +67,16 @@
     "index-fetch.js",
     "lib",
     "types",
-    "docs"
+    "docs",
+    "scripts/esbuild-build.mjs"
   ],
   "scripts": {
-    "build:node": "npx esbuild@0.14.38 index-fetch.js --bundle --platform=node --outfile=undici-fetch.js",
+    "build:node": "node scripts/esbuild-build.mjs",
     "prebuild:wasm": "node build/wasm.js --prebuild",
     "build:wasm": "node build/wasm.js --docker",
     "lint": "standard | snazzy",
     "lint:fix": "standard --fix | snazzy",
-    "test": "npm run test:tap && npm run test:node-fetch && npm run test:fetch && npm run test:cookies && npm run test:wpt && npm run test:websocket && npm run test:jest && npm run test:typescript",
+    "test": "node scripts/generate-pem && npm run test:tap && npm run test:node-fetch && npm run test:fetch && npm run test:cookies && npm run test:wpt && npm run test:websocket && npm run test:jest && npm run test:typescript",
     "test:cookies": "node scripts/verifyVersion 16 || tap test/cookie/*.js",
     "test:node-fetch": "node scripts/verifyVersion.js 16 || mocha --exit test/node-fetch",
     "test:fetch": "node scripts/verifyVersion.js 16 || (npm run build:node && tap --expose-gc test/fetch/*.js && tap test/webidl/*.js)",
@@ -67,7 +97,7 @@
     "fuzz": "jsfuzz test/fuzzing/fuzz.js corpus"
   },
   "devDependencies": {
-    "@sinonjs/fake-timers": "^10.0.2",
+    "@sinonjs/fake-timers": "^11.1.0",
     "@types/node": "^18.0.3",
     "abort-controller": "^3.0.0",
     "atomic-sleep": "^1.0.0",
@@ -80,6 +110,7 @@
     "delay": "^5.0.0",
     "dns-packet": "^5.4.0",
     "docsify-cli": "^4.4.3",
+    "esbuild": "^0.19.4",
     "form-data": "^4.0.0",
     "formdata-node": "^4.3.1",
     "https-pem": "^3.0.0",
@@ -93,12 +124,13 @@
     "pre-commit": "^1.2.2",
     "proxy": "^1.0.2",
     "proxyquire": "^2.1.3",
-    "sinon": "^15.0.0",
+    "semver": "^7.5.4",
+    "sinon": "^16.1.0",
     "snazzy": "^9.0.0",
     "standard": "^17.0.0",
     "table": "^6.8.0",
     "tap": "^16.1.0",
-    "tsd": "^0.28.1",
+    "tsd": "^0.29.0",
     "typescript": "^5.0.2",
     "wait-on": "^7.0.1",
     "ws": "^8.11.0"
@@ -131,6 +163,6 @@
     ]
   },
   "dependencies": {
-    "busboy": "^1.6.0"
+    "@fastify/busboy": "^2.0.0"
   }
 }
diff --git a/deps/undici/src/scripts/esbuild-build.mjs b/deps/undici/src/scripts/esbuild-build.mjs
new file mode 100644
index 00000000000000..ca5886c1a2b861
--- /dev/null
+++ b/deps/undici/src/scripts/esbuild-build.mjs
@@ -0,0 +1,24 @@
+import * as esbuild from 'esbuild'
+import fs from 'node:fs'
+
+const bundle = {
+  name: 'bundle',
+  setup (build) {
+    build.onLoad({ filter: /lib(\/|\\)fetch(\/|\\)index.js/ }, async (args) => {
+      const text = await fs.promises.readFile(args.path, 'utf8')
+
+      return {
+        contents: `var esbuildDetection = 1;${text}`,
+        loader: 'js'
+      }
+    })
+  }
+}
+
+await esbuild.build({
+  entryPoints: ['index-fetch.js'],
+  bundle: true,
+  outfile: 'undici-fetch.js',
+  plugins: [bundle],
+  platform: 'node'
+})
diff --git a/deps/undici/src/types/README.md b/deps/undici/src/types/README.md
new file mode 100644
index 00000000000000..20a721c445a21b
--- /dev/null
+++ b/deps/undici/src/types/README.md
@@ -0,0 +1,6 @@
+# undici-types
+
+This package is a dual-publish of the [undici](https://www.npmjs.com/package/undici) library types. The `undici` package **still contains types**. This package is for users who _only_ need undici types (such as for `@types/node`). It is published alongside every release of `undici`, so you can always use the same version.
+
+- [GitHub nodejs/undici](https://github.com/nodejs/undici)
+- [Undici Documentation](https://undici.nodejs.org/#/)
diff --git a/deps/undici/src/types/agent.d.ts b/deps/undici/src/types/agent.d.ts
index 0813735805824e..58081ce9372633 100644
--- a/deps/undici/src/types/agent.d.ts
+++ b/deps/undici/src/types/agent.d.ts
@@ -17,7 +17,7 @@ declare class Agent extends Dispatcher{
 declare namespace Agent {
   export interface Options extends Pool.Options {
     /** Default: `(origin, opts) => new Pool(origin, opts)`. */
-    factory?(origin: URL, opts: Object): Dispatcher;
+    factory?(origin: string | URL, opts: Object): Dispatcher;
     /** Integer. Default: `0` */
     maxRedirections?: number;
 
diff --git a/deps/undici/src/types/client.d.ts b/deps/undici/src/types/client.d.ts
index 56074a15ae7a13..74948b15f3841f 100644
--- a/deps/undici/src/types/client.d.ts
+++ b/deps/undici/src/types/client.d.ts
@@ -1,7 +1,6 @@
 import { URL } from 'url'
 import { TlsOptions } from 'tls'
 import Dispatcher from './dispatcher'
-import DispatchInterceptor from './dispatcher'
 import buildConnector from "./connector";
 
 /**
@@ -19,14 +18,14 @@ export class Client extends Dispatcher {
 
 export declare namespace Client {
   export interface OptionsInterceptors {
-    Client: readonly DispatchInterceptor[];
+    Client: readonly Dispatcher.DispatchInterceptor[];
   }
   export interface Options {
     /** TODO */
     interceptors?: OptionsInterceptors;
-    /** The maximum length of request headers in bytes. Default: `16384` (16KiB). */
+    /** The maximum length of request headers in bytes. Default: Node.js' `--max-http-header-size` or `16384` (16KiB). */
     maxHeaderSize?: number;
-    /** The amount of time the parser will wait to receive the complete HTTP headers (Node 14 and above only). Default: `300e3` milliseconds (300s). */
+    /** The amount of time, in milliseconds, the parser will wait to receive the complete HTTP headers (Node 14 and above only). Default: `300e3` milliseconds (300s). */
     headersTimeout?: number;
     /** @deprecated unsupported socketTimeout, use headersTimeout & bodyTimeout instead */
     socketTimeout?: never;
@@ -40,13 +39,13 @@ export declare namespace Client {
     idleTimeout?: never;
     /** @deprecated unsupported keepAlive, use pipelining=0 instead */
     keepAlive?: never;
-    /** the timeout after which a socket without active requests will time out. Monitors time between activity on a connected socket. This value may be overridden by *keep-alive* hints from the server. Default: `4e3` milliseconds (4s). */
+    /** the timeout, in milliseconds, after which a socket without active requests will time out. Monitors time between activity on a connected socket. This value may be overridden by *keep-alive* hints from the server. Default: `4e3` milliseconds (4s). */
     keepAliveTimeout?: number;
     /** @deprecated unsupported maxKeepAliveTimeout, use keepAliveMaxTimeout instead */
     maxKeepAliveTimeout?: never;
-    /** the maximum allowed `idleTimeout` when overridden by *keep-alive* hints from the server. Default: `600e3` milliseconds (10min). */
+    /** the maximum allowed `idleTimeout`, in milliseconds, when overridden by *keep-alive* hints from the server. Default: `600e3` milliseconds (10min). */
     keepAliveMaxTimeout?: number;
-    /** A number subtracted from server *keep-alive* hints when overriding `idleTimeout` to account for timing inaccuracies caused by e.g. transport latency. Default: `1e3` milliseconds (1s). */
+    /** A number of milliseconds subtracted from server *keep-alive* hints when overriding `idleTimeout` to account for timing inaccuracies caused by e.g. transport latency. Default: `1e3` milliseconds (1s). */
     keepAliveTimeoutThreshold?: number;
     /** TODO */
     socketPath?: string;
@@ -71,7 +70,17 @@ export declare namespace Client {
     /** Enables a family autodetection algorithm that loosely implements section 5 of RFC 8305. */
     autoSelectFamily?: boolean;
     /** The amount of time in milliseconds to wait for a connection attempt to finish before trying the next address when using the `autoSelectFamily` option. */
-    autoSelectFamilyAttemptTimeout?: number; 
+    autoSelectFamilyAttemptTimeout?: number;
+    /**
+     * @description Enables support for H2 if the server has assigned bigger priority to it through ALPN negotiation.
+     * @default false
+    */
+    allowH2?: boolean;
+    /**
+     * @description Dictates the maximum number of concurrent streams for a single H2 session. It can be overriden by a SETTINGS remote frame.
+     * @default 100
+    */
+    maxConcurrentStreams?: number
   }
   export interface SocketInfo {
     localAddress?: string
diff --git a/deps/undici/src/types/connector.d.ts b/deps/undici/src/types/connector.d.ts
index 847284a1f2b503..bd924339eb3986 100644
--- a/deps/undici/src/types/connector.d.ts
+++ b/deps/undici/src/types/connector.d.ts
@@ -6,6 +6,7 @@ declare function buildConnector (options?: buildConnector.BuildOptions): buildCo
 
 declare namespace buildConnector {
   export type BuildOptions = (ConnectionOptions | TcpNetConnectOpts | IpcNetConnectOpts) & {
+    allowH2?: boolean;
     maxCachedSessions?: number | null;
     socketPath?: string | null;
     timeout?: number | null;
diff --git a/deps/undici/src/types/dispatcher.d.ts b/deps/undici/src/types/dispatcher.d.ts
index 7f621371f86ec1..816db19d20d878 100644
--- a/deps/undici/src/types/dispatcher.d.ts
+++ b/deps/undici/src/types/dispatcher.d.ts
@@ -109,7 +109,7 @@ declare namespace Dispatcher {
     blocking?: boolean;
     /** Upgrade the request. Should be used to specify the kind of upgrade i.e. `'Websocket'`. Default: `method === 'CONNECT' || null`. */
     upgrade?: boolean | string | null;
-    /** The amount of time the parser will wait to receive the complete HTTP headers. Defaults to 300 seconds. */
+    /** The amount of time, in milliseconds, the parser will wait to receive the complete HTTP headers. Defaults to 300 seconds. */
     headersTimeout?: number | null;
     /** The timeout after which a request will time out, in milliseconds. Monitors time between receiving body data. Use 0 to disable it entirely. Defaults to 300 seconds. */
     bodyTimeout?: number | null;
@@ -117,6 +117,8 @@ declare namespace Dispatcher {
     reset?: boolean;
     /** Whether Undici should throw an error upon receiving a 4xx or 5xx response from the server. Defaults to false */
     throwOnError?: boolean;
+    /** For H2, it appends the expect: 100-continue header, and halts the request body until a 100-continue is received from the remote server*/
+    expectContinue?: boolean;
   }
   export interface ConnectOptions {
     path: string;
diff --git a/deps/undici/src/types/index.d.ts b/deps/undici/src/types/index.d.ts
new file mode 100644
index 00000000000000..c7532d69a073cc
--- /dev/null
+++ b/deps/undici/src/types/index.d.ts
@@ -0,0 +1,57 @@
+import Dispatcher from'./dispatcher'
+import { setGlobalDispatcher, getGlobalDispatcher } from './global-dispatcher'
+import { setGlobalOrigin, getGlobalOrigin } from './global-origin'
+import Pool from'./pool'
+import { RedirectHandler, DecoratorHandler } from './handlers'
+
+import BalancedPool from './balanced-pool'
+import Client from'./client'
+import buildConnector from'./connector'
+import errors from'./errors'
+import Agent from'./agent'
+import MockClient from'./mock-client'
+import MockPool from'./mock-pool'
+import MockAgent from'./mock-agent'
+import mockErrors from'./mock-errors'
+import ProxyAgent from'./proxy-agent'
+import { request, pipeline, stream, connect, upgrade } from './api'
+
+export * from './cookies'
+export * from './fetch'
+export * from './file'
+export * from './filereader'
+export * from './formdata'
+export * from './diagnostics-channel'
+export * from './websocket'
+export * from './content-type'
+export * from './cache'
+export { Interceptable } from './mock-interceptor'
+
+export { Dispatcher, BalancedPool, Pool, Client, buildConnector, errors, Agent, request, stream, pipeline, connect, upgrade, setGlobalDispatcher, getGlobalDispatcher, setGlobalOrigin, getGlobalOrigin, MockClient, MockPool, MockAgent, mockErrors, ProxyAgent, RedirectHandler, DecoratorHandler }
+export default Undici
+
+declare namespace Undici {
+  var Dispatcher: typeof import('./dispatcher').default
+  var Pool: typeof import('./pool').default;
+  var RedirectHandler: typeof import ('./handlers').RedirectHandler
+  var DecoratorHandler: typeof import ('./handlers').DecoratorHandler
+  var createRedirectInterceptor: typeof import ('./interceptors').createRedirectInterceptor
+  var BalancedPool: typeof import('./balanced-pool').default;
+  var Client: typeof import('./client').default;
+  var buildConnector: typeof import('./connector').default;
+  var errors: typeof import('./errors').default;
+  var Agent: typeof import('./agent').default;
+  var setGlobalDispatcher: typeof import('./global-dispatcher').setGlobalDispatcher;
+  var getGlobalDispatcher: typeof import('./global-dispatcher').getGlobalDispatcher;
+  var request: typeof import('./api').request;
+  var stream: typeof import('./api').stream;
+  var pipeline: typeof import('./api').pipeline;
+  var connect: typeof import('./api').connect;
+  var upgrade: typeof import('./api').upgrade;
+  var MockClient: typeof import('./mock-client').default;
+  var MockPool: typeof import('./mock-pool').default;
+  var MockAgent: typeof import('./mock-agent').default;
+  var mockErrors: typeof import('./mock-errors').default;
+  var fetch: typeof import('./fetch').fetch;
+  var caches: typeof import('./cache').caches;
+}
diff --git a/deps/undici/undici.js b/deps/undici/undici.js
index bea59e571c8772..0c3dc7ebfc149b 100644
--- a/deps/undici/undici.js
+++ b/deps/undici/undici.js
@@ -60,7 +60,13 @@ var require_symbols = __commonJS({
       kProxy: Symbol("proxy agent options"),
       kCounter: Symbol("socket request counter"),
       kInterceptors: Symbol("dispatch interceptors"),
-      kMaxResponseSize: Symbol("max response size")
+      kMaxResponseSize: Symbol("max response size"),
+      kHTTP2Session: Symbol("http2Session"),
+      kHTTP2SessionState: Symbol("http2Session state"),
+      kHTTP2BuildRequest: Symbol("http2 build request"),
+      kHTTP1BuildRequest: Symbol("http1 build request"),
+      kHTTP2CopyHeaders: Symbol("http2 copy headers"),
+      kHTTPConnVersion: Symbol("http connection version")
     };
   }
 });
@@ -91,46 +97,46 @@ var require_errors = __commonJS({
         this.code = "UND_ERR";
       }
     };
-    var ConnectTimeoutError = class extends UndiciError {
+    var ConnectTimeoutError = class _ConnectTimeoutError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, ConnectTimeoutError);
+        Error.captureStackTrace(this, _ConnectTimeoutError);
         this.name = "ConnectTimeoutError";
         this.message = message || "Connect Timeout Error";
         this.code = "UND_ERR_CONNECT_TIMEOUT";
       }
     };
-    var HeadersTimeoutError = class extends UndiciError {
+    var HeadersTimeoutError = class _HeadersTimeoutError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, HeadersTimeoutError);
+        Error.captureStackTrace(this, _HeadersTimeoutError);
         this.name = "HeadersTimeoutError";
         this.message = message || "Headers Timeout Error";
         this.code = "UND_ERR_HEADERS_TIMEOUT";
       }
     };
-    var HeadersOverflowError = class extends UndiciError {
+    var HeadersOverflowError = class _HeadersOverflowError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, HeadersOverflowError);
+        Error.captureStackTrace(this, _HeadersOverflowError);
         this.name = "HeadersOverflowError";
         this.message = message || "Headers Overflow Error";
         this.code = "UND_ERR_HEADERS_OVERFLOW";
       }
     };
-    var BodyTimeoutError = class extends UndiciError {
+    var BodyTimeoutError = class _BodyTimeoutError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, BodyTimeoutError);
+        Error.captureStackTrace(this, _BodyTimeoutError);
         this.name = "BodyTimeoutError";
         this.message = message || "Body Timeout Error";
         this.code = "UND_ERR_BODY_TIMEOUT";
       }
     };
-    var ResponseStatusCodeError = class extends UndiciError {
+    var ResponseStatusCodeError = class _ResponseStatusCodeError extends UndiciError {
       constructor(message, statusCode, headers, body) {
         super(message);
-        Error.captureStackTrace(this, ResponseStatusCodeError);
+        Error.captureStackTrace(this, _ResponseStatusCodeError);
         this.name = "ResponseStatusCodeError";
         this.message = message || "Response Status Code Error";
         this.code = "UND_ERR_RESPONSE_STATUS_CODE";
@@ -140,92 +146,92 @@ var require_errors = __commonJS({
         this.headers = headers;
       }
     };
-    var InvalidArgumentError = class extends UndiciError {
+    var InvalidArgumentError = class _InvalidArgumentError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, InvalidArgumentError);
+        Error.captureStackTrace(this, _InvalidArgumentError);
         this.name = "InvalidArgumentError";
         this.message = message || "Invalid Argument Error";
         this.code = "UND_ERR_INVALID_ARG";
       }
     };
-    var InvalidReturnValueError = class extends UndiciError {
+    var InvalidReturnValueError = class _InvalidReturnValueError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, InvalidReturnValueError);
+        Error.captureStackTrace(this, _InvalidReturnValueError);
         this.name = "InvalidReturnValueError";
         this.message = message || "Invalid Return Value Error";
         this.code = "UND_ERR_INVALID_RETURN_VALUE";
       }
     };
-    var RequestAbortedError = class extends UndiciError {
+    var RequestAbortedError = class _RequestAbortedError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, RequestAbortedError);
+        Error.captureStackTrace(this, _RequestAbortedError);
         this.name = "AbortError";
         this.message = message || "Request aborted";
         this.code = "UND_ERR_ABORTED";
       }
     };
-    var InformationalError = class extends UndiciError {
+    var InformationalError = class _InformationalError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, InformationalError);
+        Error.captureStackTrace(this, _InformationalError);
         this.name = "InformationalError";
         this.message = message || "Request information";
         this.code = "UND_ERR_INFO";
       }
     };
-    var RequestContentLengthMismatchError = class extends UndiciError {
+    var RequestContentLengthMismatchError = class _RequestContentLengthMismatchError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, RequestContentLengthMismatchError);
+        Error.captureStackTrace(this, _RequestContentLengthMismatchError);
         this.name = "RequestContentLengthMismatchError";
         this.message = message || "Request body length does not match content-length header";
         this.code = "UND_ERR_REQ_CONTENT_LENGTH_MISMATCH";
       }
     };
-    var ResponseContentLengthMismatchError = class extends UndiciError {
+    var ResponseContentLengthMismatchError = class _ResponseContentLengthMismatchError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, ResponseContentLengthMismatchError);
+        Error.captureStackTrace(this, _ResponseContentLengthMismatchError);
         this.name = "ResponseContentLengthMismatchError";
         this.message = message || "Response body length does not match content-length header";
         this.code = "UND_ERR_RES_CONTENT_LENGTH_MISMATCH";
       }
     };
-    var ClientDestroyedError = class extends UndiciError {
+    var ClientDestroyedError = class _ClientDestroyedError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, ClientDestroyedError);
+        Error.captureStackTrace(this, _ClientDestroyedError);
         this.name = "ClientDestroyedError";
         this.message = message || "The client is destroyed";
         this.code = "UND_ERR_DESTROYED";
       }
     };
-    var ClientClosedError = class extends UndiciError {
+    var ClientClosedError = class _ClientClosedError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, ClientClosedError);
+        Error.captureStackTrace(this, _ClientClosedError);
         this.name = "ClientClosedError";
         this.message = message || "The client is closed";
         this.code = "UND_ERR_CLOSED";
       }
     };
-    var SocketError = class extends UndiciError {
+    var SocketError = class _SocketError extends UndiciError {
       constructor(message, socket) {
         super(message);
-        Error.captureStackTrace(this, SocketError);
+        Error.captureStackTrace(this, _SocketError);
         this.name = "SocketError";
         this.message = message || "Socket error";
         this.code = "UND_ERR_SOCKET";
         this.socket = socket;
       }
     };
-    var NotSupportedError = class extends UndiciError {
+    var NotSupportedError = class _NotSupportedError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, NotSupportedError);
+        Error.captureStackTrace(this, _NotSupportedError);
         this.name = "NotSupportedError";
         this.message = message || "Not supported error";
         this.code = "UND_ERR_NOT_SUPPORTED";
@@ -240,19 +246,19 @@ var require_errors = __commonJS({
         this.code = "UND_ERR_BPL_MISSING_UPSTREAM";
       }
     };
-    var HTTPParserError = class extends Error {
+    var HTTPParserError = class _HTTPParserError extends Error {
       constructor(message, code, data) {
         super(message);
-        Error.captureStackTrace(this, HTTPParserError);
+        Error.captureStackTrace(this, _HTTPParserError);
         this.name = "HTTPParserError";
         this.code = code ? `HPE_${code}` : void 0;
         this.data = data ? data.toString() : void 0;
       }
     };
-    var ResponseExceededMaxSizeError = class extends UndiciError {
+    var ResponseExceededMaxSizeError = class _ResponseExceededMaxSizeError extends UndiciError {
       constructor(message) {
         super(message);
-        Error.captureStackTrace(this, ResponseExceededMaxSizeError);
+        Error.captureStackTrace(this, _ResponseExceededMaxSizeError);
         this.name = "ResponseExceededMaxSizeError";
         this.message = message || "Response content exceeded max size";
         this.code = "UND_ERR_RES_EXCEEDED_MAX_SIZE";
@@ -292,7 +298,7 @@ var require_util = __commonJS({
     var stream = require("stream");
     var net = require("net");
     var { InvalidArgumentError } = require_errors();
-    var { Blob } = require("buffer");
+    var { Blob: Blob2 } = require("buffer");
     var nodeUtil = require("util");
     var { stringify } = require("querystring");
     var [nodeMajor, nodeMinor] = process.versions.node.split(".").map((v) => Number(v));
@@ -302,7 +308,7 @@ var require_util = __commonJS({
       return obj && typeof obj === "object" && typeof obj.pipe === "function" && typeof obj.on === "function";
     }
     function isBlobLike(object) {
-      return Blob && object instanceof Blob || object && typeof object === "object" && (typeof object.stream === "function" || typeof object.arrayBuffer === "function") && /^(Blob|File)$/.test(object[Symbol.toStringTag]);
+      return Blob2 && object instanceof Blob2 || object && typeof object === "object" && (typeof object.stream === "function" || typeof object.arrayBuffer === "function") && /^(Blob|File)$/.test(object[Symbol.toStringTag]);
     }
     function buildURL(url, queryParams) {
       if (url.includes("?") || url.includes("#")) {
@@ -325,25 +331,25 @@ var require_util = __commonJS({
       if (!url || typeof url !== "object") {
         throw new InvalidArgumentError("Invalid URL: The URL argument must be a non-null object.");
       }
-      if (url.port != null && url.port !== "" && !Number.isFinite(parseInt(url.port))) {
-        throw new InvalidArgumentError("Invalid URL: port must be a valid integer or a string representation of an integer.");
-      }
-      if (url.path != null && typeof url.path !== "string") {
-        throw new InvalidArgumentError("Invalid URL path: the path must be a string or null/undefined.");
-      }
-      if (url.pathname != null && typeof url.pathname !== "string") {
-        throw new InvalidArgumentError("Invalid URL pathname: the pathname must be a string or null/undefined.");
-      }
-      if (url.hostname != null && typeof url.hostname !== "string") {
-        throw new InvalidArgumentError("Invalid URL hostname: the hostname must be a string or null/undefined.");
-      }
-      if (url.origin != null && typeof url.origin !== "string") {
-        throw new InvalidArgumentError("Invalid URL origin: the origin must be a string or null/undefined.");
-      }
       if (!/^https?:/.test(url.origin || url.protocol)) {
         throw new InvalidArgumentError("Invalid URL protocol: the URL must start with `http:` or `https:`.");
       }
       if (!(url instanceof URL)) {
+        if (url.port != null && url.port !== "" && !Number.isFinite(parseInt(url.port))) {
+          throw new InvalidArgumentError("Invalid URL: port must be a valid integer or a string representation of an integer.");
+        }
+        if (url.path != null && typeof url.path !== "string") {
+          throw new InvalidArgumentError("Invalid URL path: the path must be a string or null/undefined.");
+        }
+        if (url.pathname != null && typeof url.pathname !== "string") {
+          throw new InvalidArgumentError("Invalid URL pathname: the pathname must be a string or null/undefined.");
+        }
+        if (url.hostname != null && typeof url.hostname !== "string") {
+          throw new InvalidArgumentError("Invalid URL hostname: the hostname must be a string or null/undefined.");
+        }
+        if (url.origin != null && typeof url.origin !== "string") {
+          throw new InvalidArgumentError("Invalid URL origin: the origin must be a string or null/undefined.");
+        }
         const port = url.port != null ? url.port : url.protocol === "https:" ? 443 : 80;
         let origin = url.origin != null ? url.origin : `${url.protocol}//${url.hostname}:${port}`;
         let path = url.path != null ? url.path : `${url.pathname || ""}${url.search || ""}`;
@@ -400,7 +406,7 @@ var require_util = __commonJS({
         return 0;
       } else if (isStream(body)) {
         const state = body._readableState;
-        return state && state.ended === true && Number.isFinite(state.length) ? state.length : null;
+        return state && state.objectMode === false && state.ended === true && Number.isFinite(state.length) ? state.length : null;
       } else if (isBlobLike(body)) {
         return body.size != null ? body.size : null;
       } else if (isBuffer(body)) {
@@ -439,6 +445,8 @@ var require_util = __commonJS({
       return m ? parseInt(m[1], 10) * 1e3 : null;
     }
     function parseHeaders(headers, obj = {}) {
+      if (!Array.isArray(headers))
+        return headers;
       for (let i = 0; i < headers.length; i += 2) {
         const key = headers[i].toString().toLowerCase();
         let val = obj[key];
@@ -518,10 +526,14 @@ var require_util = __commonJS({
       return !!(body && (stream.isDisturbed ? stream.isDisturbed(body) || body[kBodyUsed] : body[kBodyUsed] || body.readableDidRead || body._readableState && body._readableState.dataEmitted || isReadableAborted(body)));
     }
     function isErrored(body) {
-      return !!(body && (stream.isErrored ? stream.isErrored(body) : /state: 'errored'/.test(nodeUtil.inspect(body))));
+      return !!(body && (stream.isErrored ? stream.isErrored(body) : /state: 'errored'/.test(
+        nodeUtil.inspect(body)
+      )));
     }
     function isReadable(body) {
-      return !!(body && (stream.isReadable ? stream.isReadable(body) : /state: 'readable'/.test(nodeUtil.inspect(body))));
+      return !!(body && (stream.isReadable ? stream.isReadable(body) : /state: 'readable'/.test(
+        nodeUtil.inspect(body)
+      )));
     }
     function getSocketInfo(socket) {
       return {
@@ -535,35 +547,43 @@ var require_util = __commonJS({
         bytesRead: socket.bytesRead
       };
     }
+    async function* convertIterableToBuffer(iterable) {
+      for await (const chunk of iterable) {
+        yield Buffer.isBuffer(chunk) ? chunk : Buffer.from(chunk);
+      }
+    }
     var ReadableStream;
     function ReadableStreamFrom(iterable) {
       if (!ReadableStream) {
         ReadableStream = require("stream/web").ReadableStream;
       }
       if (ReadableStream.from) {
-        return ReadableStream.from(iterable);
+        return ReadableStream.from(convertIterableToBuffer(iterable));
       }
       let iterator;
-      return new ReadableStream({
-        async start() {
-          iterator = iterable[Symbol.asyncIterator]();
-        },
-        async pull(controller) {
-          const { done, value } = await iterator.next();
-          if (done) {
-            queueMicrotask(() => {
-              controller.close();
-            });
-          } else {
-            const buf = Buffer.isBuffer(value) ? value : Buffer.from(value);
-            controller.enqueue(new Uint8Array(buf));
+      return new ReadableStream(
+        {
+          async start() {
+            iterator = iterable[Symbol.asyncIterator]();
+          },
+          async pull(controller) {
+            const { done, value } = await iterator.next();
+            if (done) {
+              queueMicrotask(() => {
+                controller.close();
+              });
+            } else {
+              const buf = Buffer.isBuffer(value) ? value : Buffer.from(value);
+              controller.enqueue(new Uint8Array(buf));
+            }
+            return controller.desiredSize > 0;
+          },
+          async cancel(reason) {
+            await iterator.return();
           }
-          return controller.desiredSize > 0;
         },
-        async cancel(reason) {
-          await iterator.return();
-        }
-      }, 0);
+        0
+      );
     }
     function isFormDataLike(object) {
       return object && typeof object === "object" && typeof object.append === "function" && typeof object.delete === "function" && typeof object.get === "function" && typeof object.getAll === "function" && typeof object.has === "function" && typeof object.set === "function" && object[Symbol.toStringTag] === "FormData";
@@ -765,6 +785,10 @@ var require_constants = __commonJS({
       "content-language",
       "content-location",
       "content-type",
+      // See https://github.com/nodejs/undici/issues/2021
+      // 'Content-Length' is a forbidden header name, which is typically
+      // removed in the Headers implementation. However, undici doesn't
+      // filter out headers, so we add it here.
       "content-length"
     ];
     var requestDuplex = [
@@ -793,7 +817,9 @@ var require_constants = __commonJS({
       }
     })();
     var channel;
-    var structuredClone = globalThis.structuredClone ?? function structuredClone2(value, options = void 0) {
+    var structuredClone = globalThis.structuredClone ?? // https://github.com/nodejs/node/blob/b27ae24dcc4251bad726d9d84baf678d1f707fed/lib/internal/structured_clone.js
+    // structuredClone was added in v17.0.0, but fetch supports v16.8
+    function structuredClone2(value, options = void 0) {
       if (arguments.length === 0) {
         throw new TypeError("missing argument");
       }
@@ -835,9 +861,6 @@ var require_global = __commonJS({
       return globalThis[globalOrigin];
     }
     function setGlobalOrigin(newOrigin) {
-      if (newOrigin !== void 0 && typeof newOrigin !== "string" && !(newOrigin instanceof URL)) {
-        throw new Error("Invalid base url");
-      }
       if (newOrigin === void 0) {
         Object.defineProperty(globalThis, globalOrigin, {
           value: void 0,
@@ -914,7 +937,9 @@ var require_util2 = __commonJS({
     function isValidReasonPhrase(statusText) {
       for (let i = 0; i < statusText.length; ++i) {
         const c = statusText.charCodeAt(i);
-        if (!(c === 9 || c >= 32 && c <= 126 || c >= 128 && c <= 255)) {
+        if (!(c === 9 || // HTAB
+        c >= 32 && c <= 126 || // SP / VCHAR
+        c >= 128 && c <= 255)) {
           return false;
         }
       }
@@ -1139,11 +1164,24 @@ var require_util2 = __commonJS({
       const metadata = list.filter((item) => item.algo === strongest);
       for (const item of metadata) {
         const algorithm = item.algo;
-        const expectedValue = item.hash;
-        const actualValue = crypto.createHash(algorithm).update(bytes).digest("base64");
+        let expectedValue = item.hash;
+        if (expectedValue.endsWith("==")) {
+          expectedValue = expectedValue.slice(0, -2);
+        }
+        let actualValue = crypto.createHash(algorithm).update(bytes).digest("base64");
+        if (actualValue.endsWith("==")) {
+          actualValue = actualValue.slice(0, -2);
+        }
         if (actualValue === expectedValue) {
           return true;
         }
+        let actualBase64URL = crypto.createHash(algorithm).update(bytes).digest("base64url");
+        if (actualBase64URL.endsWith("==")) {
+          actualBase64URL = actualBase64URL.slice(0, -2);
+        }
+        if (actualBase64URL === expectedValue) {
+          return true;
+        }
       }
       return false;
     }
@@ -1215,7 +1253,9 @@ var require_util2 = __commonJS({
       const i = {
         next() {
           if (Object.getPrototypeOf(this) !== i) {
-            throw new TypeError(`'next' called on an object that does not implement interface ${name} Iterator.`);
+            throw new TypeError(
+              `'next' called on an object that does not implement interface ${name} Iterator.`
+            );
           }
           const { index, kind: kind2, target } = object;
           const values = target();
@@ -1227,6 +1267,8 @@ var require_util2 = __commonJS({
           object.index = index + 1;
           return iteratorResult(pair, kind2);
         },
+        // The class string of an iterator prototype object for a given interface is the
+        // result of concatenating the identifier of the interface and the string " Iterator".
         [Symbol.toStringTag]: `${name} Iterator`
       };
       Object.setPrototypeOf(i, esIteratorPrototype);
@@ -1250,9 +1292,9 @@ var require_util2 = __commonJS({
       }
       return { value: result, done: false };
     }
-    function fullyReadBody(body, processBody, processBodyError) {
-      const successSteps = (bytes) => queueMicrotask(() => processBody(bytes));
-      const errorSteps = (error) => queueMicrotask(() => processBodyError(error));
+    async function fullyReadBody(body, processBody, processBodyError) {
+      const successSteps = processBody;
+      const errorSteps = processBodyError;
       let reader;
       try {
         reader = body.stream.getReader();
@@ -1260,7 +1302,12 @@ var require_util2 = __commonJS({
         errorSteps(e);
         return;
       }
-      readAllBytes(reader, successSteps, errorSteps);
+      try {
+        const result = await readAllBytes(reader);
+        successSteps(result);
+      } catch (e) {
+        errorSteps(e);
+      }
     }
     var ReadableStream = globalThis.ReadableStream;
     function isReadableStreamLike(stream) {
@@ -1291,25 +1338,16 @@ var require_util2 = __commonJS({
       }
       return input;
     }
-    async function readAllBytes(reader, successSteps, failureSteps) {
+    async function readAllBytes(reader) {
       const bytes = [];
       let byteLength = 0;
       while (true) {
-        let done;
-        let chunk;
-        try {
-          ({ done, value: chunk } = await reader.read());
-        } catch (e) {
-          failureSteps(e);
-          return;
-        }
+        const { done, value: chunk } = await reader.read();
         if (done) {
-          successSteps(Buffer.concat(bytes, byteLength));
-          return;
+          return Buffer.concat(bytes, byteLength);
         }
         if (!isUint8Array(chunk)) {
-          failureSteps(new TypeError("Received non-Uint8Array chunk"));
-          return;
+          throw new TypeError("Received non-Uint8Array chunk");
         }
         bytes.push(chunk);
         byteLength += chunk.length;
@@ -1644,7 +1682,9 @@ var require_webidl = __commonJS({
       for (let index = 0; index < x.length; index++) {
         const charCode = x.charCodeAt(index);
         if (charCode > 255) {
-          throw new TypeError(`Cannot convert argument to a ByteString because the character at index ${index} has a value of ${charCode} which is greater than 255.`);
+          throw new TypeError(
+            `Cannot convert argument to a ByteString because the character at index ${index} has a value of ${charCode} which is greater than 255.`
+          );
         }
       }
       return x;
@@ -1732,9 +1772,16 @@ var require_webidl = __commonJS({
       }
       throw new TypeError(`Could not convert ${V} to a BufferSource.`);
     };
-    webidl.converters["sequence<ByteString>"] = webidl.sequenceConverter(webidl.converters.ByteString);
-    webidl.converters["sequence<sequence<ByteString>>"] = webidl.sequenceConverter(webidl.converters["sequence<ByteString>"]);
-    webidl.converters["record<ByteString, ByteString>"] = webidl.recordConverter(webidl.converters.ByteString, webidl.converters.ByteString);
+    webidl.converters["sequence<ByteString>"] = webidl.sequenceConverter(
+      webidl.converters.ByteString
+    );
+    webidl.converters["sequence<sequence<ByteString>>"] = webidl.sequenceConverter(
+      webidl.converters["sequence<ByteString>"]
+    );
+    webidl.converters["record<ByteString, ByteString>"] = webidl.recordConverter(
+      webidl.converters.ByteString,
+      webidl.converters.ByteString
+    );
     module2.exports = {
       webidl
     };
@@ -1786,10 +1833,11 @@ var require_headers = __commonJS({
         });
       }
     }
-    var HeadersList = class {
+    var HeadersList = class _HeadersList {
+      /** @type {[string, string][]|null} */
       cookies = null;
       constructor(init) {
-        if (init instanceof HeadersList) {
+        if (init instanceof _HeadersList) {
           this[kHeadersMap] = new Map(init[kHeadersMap]);
           this[kHeadersSortedMap] = init[kHeadersSortedMap];
           this.cookies = init.cookies;
@@ -1798,6 +1846,7 @@ var require_headers = __commonJS({
           this[kHeadersSortedMap] = null;
         }
       }
+      // https://fetch.spec.whatwg.org/#header-list-contains
       contains(name) {
         name = name.toLowerCase();
         return this[kHeadersMap].has(name);
@@ -1807,6 +1856,7 @@ var require_headers = __commonJS({
         this[kHeadersSortedMap] = null;
         this.cookies = null;
       }
+      // https://fetch.spec.whatwg.org/#concept-header-list-append
       append(name, value) {
         this[kHeadersSortedMap] = null;
         const lowercaseName = name.toLowerCase();
@@ -1825,6 +1875,7 @@ var require_headers = __commonJS({
           this.cookies.push(value);
         }
       }
+      // https://fetch.spec.whatwg.org/#concept-header-list-set
       set(name, value) {
         this[kHeadersSortedMap] = null;
         const lowercaseName = name.toLowerCase();
@@ -1833,6 +1884,7 @@ var require_headers = __commonJS({
         }
         return this[kHeadersMap].set(lowercaseName, { name, value });
       }
+      // https://fetch.spec.whatwg.org/#concept-header-list-delete
       delete(name) {
         this[kHeadersSortedMap] = null;
         name = name.toLowerCase();
@@ -1841,6 +1893,7 @@ var require_headers = __commonJS({
         }
         return this[kHeadersMap].delete(name);
       }
+      // https://fetch.spec.whatwg.org/#concept-header-list-get
       get(name) {
         if (!this.contains(name)) {
           return null;
@@ -1862,7 +1915,7 @@ var require_headers = __commonJS({
         return headers;
       }
     };
-    var Headers = class {
+    var Headers = class _Headers {
       constructor(init = void 0) {
         this[kHeadersList] = new HeadersList();
         this[kGuard] = "none";
@@ -1871,8 +1924,9 @@ var require_headers = __commonJS({
           fill(this, init);
         }
       }
+      // https://fetch.spec.whatwg.org/#dom-headers-append
       append(name, value) {
-        webidl.brandCheck(this, Headers);
+        webidl.brandCheck(this, _Headers);
         webidl.argumentLengthCheck(arguments, 2, { header: "Headers.append" });
         name = webidl.converters.ByteString(name);
         value = webidl.converters.ByteString(value);
@@ -1896,8 +1950,9 @@ var require_headers = __commonJS({
         }
         return this[kHeadersList].append(name, value);
       }
+      // https://fetch.spec.whatwg.org/#dom-headers-delete
       delete(name) {
-        webidl.brandCheck(this, Headers);
+        webidl.brandCheck(this, _Headers);
         webidl.argumentLengthCheck(arguments, 1, { header: "Headers.delete" });
         name = webidl.converters.ByteString(name);
         if (!isValidHeaderName(name)) {
@@ -1916,8 +1971,9 @@ var require_headers = __commonJS({
         }
         return this[kHeadersList].delete(name);
       }
+      // https://fetch.spec.whatwg.org/#dom-headers-get
       get(name) {
-        webidl.brandCheck(this, Headers);
+        webidl.brandCheck(this, _Headers);
         webidl.argumentLengthCheck(arguments, 1, { header: "Headers.get" });
         name = webidl.converters.ByteString(name);
         if (!isValidHeaderName(name)) {
@@ -1929,8 +1985,9 @@ var require_headers = __commonJS({
         }
         return this[kHeadersList].get(name);
       }
+      // https://fetch.spec.whatwg.org/#dom-headers-has
       has(name) {
-        webidl.brandCheck(this, Headers);
+        webidl.brandCheck(this, _Headers);
         webidl.argumentLengthCheck(arguments, 1, { header: "Headers.has" });
         name = webidl.converters.ByteString(name);
         if (!isValidHeaderName(name)) {
@@ -1942,8 +1999,9 @@ var require_headers = __commonJS({
         }
         return this[kHeadersList].contains(name);
       }
+      // https://fetch.spec.whatwg.org/#dom-headers-set
       set(name, value) {
-        webidl.brandCheck(this, Headers);
+        webidl.brandCheck(this, _Headers);
         webidl.argumentLengthCheck(arguments, 2, { header: "Headers.set" });
         name = webidl.converters.ByteString(name);
         value = webidl.converters.ByteString(value);
@@ -1967,14 +2025,16 @@ var require_headers = __commonJS({
         }
         return this[kHeadersList].set(name, value);
       }
+      // https://fetch.spec.whatwg.org/#dom-headers-getsetcookie
       getSetCookie() {
-        webidl.brandCheck(this, Headers);
+        webidl.brandCheck(this, _Headers);
         const list = this[kHeadersList].cookies;
         if (list) {
           return [...list];
         }
         return [];
       }
+      // https://fetch.spec.whatwg.org/#concept-header-list-sort-and-combine
       get [kHeadersSortedMap]() {
         if (this[kHeadersList][kHeadersSortedMap]) {
           return this[kHeadersList][kHeadersSortedMap];
@@ -1996,29 +2056,47 @@ var require_headers = __commonJS({
         return headers;
       }
       keys() {
-        webidl.brandCheck(this, Headers);
-        return makeIterator(() => [...this[kHeadersSortedMap].values()], "Headers", "key");
+        webidl.brandCheck(this, _Headers);
+        return makeIterator(
+          () => [...this[kHeadersSortedMap].values()],
+          "Headers",
+          "key"
+        );
       }
       values() {
-        webidl.brandCheck(this, Headers);
-        return makeIterator(() => [...this[kHeadersSortedMap].values()], "Headers", "value");
+        webidl.brandCheck(this, _Headers);
+        return makeIterator(
+          () => [...this[kHeadersSortedMap].values()],
+          "Headers",
+          "value"
+        );
       }
       entries() {
-        webidl.brandCheck(this, Headers);
-        return makeIterator(() => [...this[kHeadersSortedMap].values()], "Headers", "key+value");
-      }
+        webidl.brandCheck(this, _Headers);
+        return makeIterator(
+          () => [...this[kHeadersSortedMap].values()],
+          "Headers",
+          "key+value"
+        );
+      }
+      /**
+       * @param {(value: string, key: string, self: Headers) => void} callbackFn
+       * @param {unknown} thisArg
+       */
       forEach(callbackFn, thisArg = globalThis) {
-        webidl.brandCheck(this, Headers);
+        webidl.brandCheck(this, _Headers);
         webidl.argumentLengthCheck(arguments, 1, { header: "Headers.forEach" });
         if (typeof callbackFn !== "function") {
-          throw new TypeError("Failed to execute 'forEach' on 'Headers': parameter 1 is not of type 'Function'.");
+          throw new TypeError(
+            "Failed to execute 'forEach' on 'Headers': parameter 1 is not of type 'Function'."
+          );
         }
         for (const [key, value] of this) {
           callbackFn.apply(thisArg, [value, key, this]);
         }
       }
       [Symbol.for("nodejs.util.inspect.custom")]() {
-        webidl.brandCheck(this, Headers);
+        webidl.brandCheck(this, _Headers);
         return this[kHeadersList];
       }
     };
@@ -2061,382 +2139,665 @@ var require_headers = __commonJS({
   }
 });
 
-// node_modules/busboy/lib/utils.js
-var require_utils = __commonJS({
-  "node_modules/busboy/lib/utils.js"(exports2, module2) {
+// node_modules/@fastify/busboy/deps/streamsearch/sbmh.js
+var require_sbmh = __commonJS({
+  "node_modules/@fastify/busboy/deps/streamsearch/sbmh.js"(exports2, module2) {
     "use strict";
-    function parseContentType(str) {
-      if (str.length === 0)
-        return;
-      const params = /* @__PURE__ */ Object.create(null);
-      let i = 0;
-      for (; i < str.length; ++i) {
-        const code = str.charCodeAt(i);
-        if (TOKEN[code] !== 1) {
-          if (code !== 47 || i === 0)
-            return;
-          break;
-        }
+    var EventEmitter = require("node:events").EventEmitter;
+    var inherits = require("node:util").inherits;
+    function SBMH(needle) {
+      if (typeof needle === "string") {
+        needle = Buffer.from(needle);
+      }
+      if (!Buffer.isBuffer(needle)) {
+        throw new TypeError("The needle has to be a String or a Buffer.");
+      }
+      const needleLength = needle.length;
+      if (needleLength === 0) {
+        throw new Error("The needle cannot be an empty String/Buffer.");
+      }
+      if (needleLength > 256) {
+        throw new Error("The needle cannot have a length bigger than 256.");
+      }
+      this.maxMatches = Infinity;
+      this.matches = 0;
+      this._occ = new Array(256).fill(needleLength);
+      this._lookbehind_size = 0;
+      this._needle = needle;
+      this._bufpos = 0;
+      this._lookbehind = Buffer.alloc(needleLength);
+      for (var i = 0; i < needleLength - 1; ++i) {
+        this._occ[needle[i]] = needleLength - 1 - i;
+      }
+    }
+    inherits(SBMH, EventEmitter);
+    SBMH.prototype.reset = function() {
+      this._lookbehind_size = 0;
+      this.matches = 0;
+      this._bufpos = 0;
+    };
+    SBMH.prototype.push = function(chunk, pos) {
+      if (!Buffer.isBuffer(chunk)) {
+        chunk = Buffer.from(chunk, "binary");
       }
-      if (i === str.length)
-        return;
-      const type = str.slice(0, i).toLowerCase();
-      const subtypeStart = ++i;
-      for (; i < str.length; ++i) {
-        const code = str.charCodeAt(i);
-        if (TOKEN[code] !== 1) {
-          if (i === subtypeStart)
-            return;
-          if (parseContentTypeParams(str, i, params) === void 0)
-            return;
-          break;
-        }
+      const chlen = chunk.length;
+      this._bufpos = pos || 0;
+      let r;
+      while (r !== chlen && this.matches < this.maxMatches) {
+        r = this._sbmh_feed(chunk);
       }
-      if (i === subtypeStart)
-        return;
-      const subtype = str.slice(subtypeStart, i).toLowerCase();
-      return { type, subtype, params };
-    }
-    function parseContentTypeParams(str, i, params) {
-      while (i < str.length) {
-        for (; i < str.length; ++i) {
-          const code = str.charCodeAt(i);
-          if (code !== 32 && code !== 9)
-            break;
-        }
-        if (i === str.length)
-          break;
-        if (str.charCodeAt(i++) !== 59)
-          return;
-        for (; i < str.length; ++i) {
-          const code = str.charCodeAt(i);
-          if (code !== 32 && code !== 9)
-            break;
-        }
-        if (i === str.length)
-          return;
-        let name;
-        const nameStart = i;
-        for (; i < str.length; ++i) {
-          const code = str.charCodeAt(i);
-          if (TOKEN[code] !== 1) {
-            if (code !== 61)
-              return;
-            break;
+      return r;
+    };
+    SBMH.prototype._sbmh_feed = function(data) {
+      const len = data.length;
+      const needle = this._needle;
+      const needleLength = needle.length;
+      const lastNeedleChar = needle[needleLength - 1];
+      let pos = -this._lookbehind_size;
+      let ch;
+      if (pos < 0) {
+        while (pos < 0 && pos <= len - needleLength) {
+          ch = this._sbmh_lookup_char(data, pos + needleLength - 1);
+          if (ch === lastNeedleChar && this._sbmh_memcmp(data, pos, needleLength - 1)) {
+            this._lookbehind_size = 0;
+            ++this.matches;
+            this.emit("info", true);
+            return this._bufpos = pos + needleLength;
           }
+          pos += this._occ[ch];
         }
-        if (i === str.length)
-          return;
-        name = str.slice(nameStart, i);
-        ++i;
-        if (i === str.length)
-          return;
-        let value = "";
-        let valueStart;
-        if (str.charCodeAt(i) === 34) {
-          valueStart = ++i;
-          let escaping = false;
-          for (; i < str.length; ++i) {
-            const code = str.charCodeAt(i);
-            if (code === 92) {
-              if (escaping) {
-                valueStart = i;
-                escaping = false;
-              } else {
-                value += str.slice(valueStart, i);
-                escaping = true;
-              }
-              continue;
-            }
-            if (code === 34) {
-              if (escaping) {
-                valueStart = i;
-                escaping = false;
-                continue;
-              }
-              value += str.slice(valueStart, i);
-              break;
-            }
-            if (escaping) {
-              valueStart = i - 1;
-              escaping = false;
-            }
-            if (QDTEXT[code] !== 1)
-              return;
+        if (pos < 0) {
+          while (pos < 0 && !this._sbmh_memcmp(data, pos, len - pos)) {
+            ++pos;
           }
-          if (i === str.length)
-            return;
-          ++i;
+        }
+        if (pos >= 0) {
+          this.emit("info", false, this._lookbehind, 0, this._lookbehind_size);
+          this._lookbehind_size = 0;
         } else {
-          valueStart = i;
-          for (; i < str.length; ++i) {
-            const code = str.charCodeAt(i);
-            if (TOKEN[code] !== 1) {
-              if (i === valueStart)
-                return;
-              break;
-            }
-          }
-          value = str.slice(valueStart, i);
+          const bytesToCutOff = this._lookbehind_size + pos;
+          if (bytesToCutOff > 0) {
+            this.emit("info", false, this._lookbehind, 0, bytesToCutOff);
+          }
+          this._lookbehind.copy(
+            this._lookbehind,
+            0,
+            bytesToCutOff,
+            this._lookbehind_size - bytesToCutOff
+          );
+          this._lookbehind_size -= bytesToCutOff;
+          data.copy(this._lookbehind, this._lookbehind_size);
+          this._lookbehind_size += len;
+          this._bufpos = len;
+          return len;
         }
-        name = name.toLowerCase();
-        if (params[name] === void 0)
-          params[name] = value;
       }
-      return params;
+      pos += (pos >= 0) * this._bufpos;
+      if (data.indexOf(needle, pos) !== -1) {
+        pos = data.indexOf(needle, pos);
+        ++this.matches;
+        if (pos > 0) {
+          this.emit("info", true, data, this._bufpos, pos);
+        } else {
+          this.emit("info", true);
+        }
+        return this._bufpos = pos + needleLength;
+      } else {
+        pos = len - needleLength;
+      }
+      while (pos < len && (data[pos] !== needle[0] || Buffer.compare(
+        data.subarray(pos, pos + len - pos),
+        needle.subarray(0, len - pos)
+      ) !== 0)) {
+        ++pos;
+      }
+      if (pos < len) {
+        data.copy(this._lookbehind, 0, pos, pos + (len - pos));
+        this._lookbehind_size = len - pos;
+      }
+      if (pos > 0) {
+        this.emit("info", false, data, this._bufpos, pos < len ? pos : len);
+      }
+      this._bufpos = len;
+      return len;
+    };
+    SBMH.prototype._sbmh_lookup_char = function(data, pos) {
+      return pos < 0 ? this._lookbehind[this._lookbehind_size + pos] : data[pos];
+    };
+    SBMH.prototype._sbmh_memcmp = function(data, pos, len) {
+      for (var i = 0; i < len; ++i) {
+        if (this._sbmh_lookup_char(data, pos + i) !== this._needle[i]) {
+          return false;
+        }
+      }
+      return true;
+    };
+    module2.exports = SBMH;
+  }
+});
+
+// node_modules/@fastify/busboy/deps/dicer/lib/PartStream.js
+var require_PartStream = __commonJS({
+  "node_modules/@fastify/busboy/deps/dicer/lib/PartStream.js"(exports2, module2) {
+    "use strict";
+    var inherits = require("node:util").inherits;
+    var ReadableStream = require("node:stream").Readable;
+    function PartStream(opts) {
+      ReadableStream.call(this, opts);
+    }
+    inherits(PartStream, ReadableStream);
+    PartStream.prototype._read = function(n) {
+    };
+    module2.exports = PartStream;
+  }
+});
+
+// node_modules/@fastify/busboy/lib/utils/getLimit.js
+var require_getLimit = __commonJS({
+  "node_modules/@fastify/busboy/lib/utils/getLimit.js"(exports2, module2) {
+    "use strict";
+    module2.exports = function getLimit(limits, name, defaultLimit) {
+      if (!limits || limits[name] === void 0 || limits[name] === null) {
+        return defaultLimit;
+      }
+      if (typeof limits[name] !== "number" || isNaN(limits[name])) {
+        throw new TypeError("Limit " + name + " is not a valid number");
+      }
+      return limits[name];
+    };
+  }
+});
+
+// node_modules/@fastify/busboy/deps/dicer/lib/HeaderParser.js
+var require_HeaderParser = __commonJS({
+  "node_modules/@fastify/busboy/deps/dicer/lib/HeaderParser.js"(exports2, module2) {
+    "use strict";
+    var EventEmitter = require("node:events").EventEmitter;
+    var inherits = require("node:util").inherits;
+    var getLimit = require_getLimit();
+    var StreamSearch = require_sbmh();
+    var B_DCRLF = Buffer.from("\r\n\r\n");
+    var RE_CRLF = /\r\n/g;
+    var RE_HDR = /^([^:]+):[ \t]?([\x00-\xFF]+)?$/;
+    function HeaderParser(cfg) {
+      EventEmitter.call(this);
+      cfg = cfg || {};
+      const self = this;
+      this.nread = 0;
+      this.maxed = false;
+      this.npairs = 0;
+      this.maxHeaderPairs = getLimit(cfg, "maxHeaderPairs", 2e3);
+      this.maxHeaderSize = getLimit(cfg, "maxHeaderSize", 80 * 1024);
+      this.buffer = "";
+      this.header = {};
+      this.finished = false;
+      this.ss = new StreamSearch(B_DCRLF);
+      this.ss.on("info", function(isMatch, data, start, end) {
+        if (data && !self.maxed) {
+          if (self.nread + end - start >= self.maxHeaderSize) {
+            end = self.maxHeaderSize - self.nread + start;
+            self.nread = self.maxHeaderSize;
+            self.maxed = true;
+          } else {
+            self.nread += end - start;
+          }
+          self.buffer += data.toString("binary", start, end);
+        }
+        if (isMatch) {
+          self._finish();
+        }
+      });
     }
-    function parseDisposition(str, defDecoder) {
-      if (str.length === 0)
+    inherits(HeaderParser, EventEmitter);
+    HeaderParser.prototype.push = function(data) {
+      const r = this.ss.push(data);
+      if (this.finished) {
+        return r;
+      }
+    };
+    HeaderParser.prototype.reset = function() {
+      this.finished = false;
+      this.buffer = "";
+      this.header = {};
+      this.ss.reset();
+    };
+    HeaderParser.prototype._finish = function() {
+      if (this.buffer) {
+        this._parseHeader();
+      }
+      this.ss.matches = this.ss.maxMatches;
+      const header = this.header;
+      this.header = {};
+      this.buffer = "";
+      this.finished = true;
+      this.nread = this.npairs = 0;
+      this.maxed = false;
+      this.emit("header", header);
+    };
+    HeaderParser.prototype._parseHeader = function() {
+      if (this.npairs === this.maxHeaderPairs) {
         return;
-      const params = /* @__PURE__ */ Object.create(null);
-      let i = 0;
-      for (; i < str.length; ++i) {
-        const code = str.charCodeAt(i);
-        if (TOKEN[code] !== 1) {
-          if (parseDispositionParams(str, i, params, defDecoder) === void 0)
-            return;
+      }
+      const lines = this.buffer.split(RE_CRLF);
+      const len = lines.length;
+      let m, h;
+      for (var i = 0; i < len; ++i) {
+        if (lines[i].length === 0) {
+          continue;
+        }
+        if (lines[i][0] === "	" || lines[i][0] === " ") {
+          if (h) {
+            this.header[h][this.header[h].length - 1] += lines[i];
+            continue;
+          }
+        }
+        const posColon = lines[i].indexOf(":");
+        if (posColon === -1 || posColon === 0) {
+          return;
+        }
+        m = RE_HDR.exec(lines[i]);
+        h = m[1].toLowerCase();
+        this.header[h] = this.header[h] || [];
+        this.header[h].push(m[2] || "");
+        if (++this.npairs === this.maxHeaderPairs) {
           break;
         }
       }
-      const type = str.slice(0, i).toLowerCase();
-      return { type, params };
+    };
+    module2.exports = HeaderParser;
+  }
+});
+
+// node_modules/@fastify/busboy/deps/dicer/lib/Dicer.js
+var require_Dicer = __commonJS({
+  "node_modules/@fastify/busboy/deps/dicer/lib/Dicer.js"(exports2, module2) {
+    "use strict";
+    var WritableStream = require("node:stream").Writable;
+    var inherits = require("node:util").inherits;
+    var StreamSearch = require_sbmh();
+    var PartStream = require_PartStream();
+    var HeaderParser = require_HeaderParser();
+    var DASH = 45;
+    var B_ONEDASH = Buffer.from("-");
+    var B_CRLF = Buffer.from("\r\n");
+    var EMPTY_FN = function() {
+    };
+    function Dicer(cfg) {
+      if (!(this instanceof Dicer)) {
+        return new Dicer(cfg);
+      }
+      WritableStream.call(this, cfg);
+      if (!cfg || !cfg.headerFirst && typeof cfg.boundary !== "string") {
+        throw new TypeError("Boundary required");
+      }
+      if (typeof cfg.boundary === "string") {
+        this.setBoundary(cfg.boundary);
+      } else {
+        this._bparser = void 0;
+      }
+      this._headerFirst = cfg.headerFirst;
+      this._dashes = 0;
+      this._parts = 0;
+      this._finished = false;
+      this._realFinish = false;
+      this._isPreamble = true;
+      this._justMatched = false;
+      this._firstWrite = true;
+      this._inHeader = true;
+      this._part = void 0;
+      this._cb = void 0;
+      this._ignoreData = false;
+      this._partOpts = { highWaterMark: cfg.partHwm };
+      this._pause = false;
+      const self = this;
+      this._hparser = new HeaderParser(cfg);
+      this._hparser.on("header", function(header) {
+        self._inHeader = false;
+        self._part.emit("header", header);
+      });
     }
-    function parseDispositionParams(str, i, params, defDecoder) {
-      while (i < str.length) {
-        for (; i < str.length; ++i) {
-          const code = str.charCodeAt(i);
-          if (code !== 32 && code !== 9)
-            break;
+    inherits(Dicer, WritableStream);
+    Dicer.prototype.emit = function(ev) {
+      if (ev === "finish" && !this._realFinish) {
+        if (!this._finished) {
+          const self = this;
+          process.nextTick(function() {
+            self.emit("error", new Error("Unexpected end of multipart data"));
+            if (self._part && !self._ignoreData) {
+              const type = self._isPreamble ? "Preamble" : "Part";
+              self._part.emit("error", new Error(type + " terminated early due to unexpected end of multipart data"));
+              self._part.push(null);
+              process.nextTick(function() {
+                self._realFinish = true;
+                self.emit("finish");
+                self._realFinish = false;
+              });
+              return;
+            }
+            self._realFinish = true;
+            self.emit("finish");
+            self._realFinish = false;
+          });
         }
-        if (i === str.length)
-          break;
-        if (str.charCodeAt(i++) !== 59)
-          return;
-        for (; i < str.length; ++i) {
-          const code = str.charCodeAt(i);
-          if (code !== 32 && code !== 9)
+      } else {
+        WritableStream.prototype.emit.apply(this, arguments);
+      }
+    };
+    Dicer.prototype._write = function(data, encoding, cb) {
+      if (!this._hparser && !this._bparser) {
+        return cb();
+      }
+      if (this._headerFirst && this._isPreamble) {
+        if (!this._part) {
+          this._part = new PartStream(this._partOpts);
+          if (this._events.preamble) {
+            this.emit("preamble", this._part);
+          } else {
+            this._ignore();
+          }
+        }
+        const r = this._hparser.push(data);
+        if (!this._inHeader && r !== void 0 && r < data.length) {
+          data = data.slice(r);
+        } else {
+          return cb();
+        }
+      }
+      if (this._firstWrite) {
+        this._bparser.push(B_CRLF);
+        this._firstWrite = false;
+      }
+      this._bparser.push(data);
+      if (this._pause) {
+        this._cb = cb;
+      } else {
+        cb();
+      }
+    };
+    Dicer.prototype.reset = function() {
+      this._part = void 0;
+      this._bparser = void 0;
+      this._hparser = void 0;
+    };
+    Dicer.prototype.setBoundary = function(boundary) {
+      const self = this;
+      this._bparser = new StreamSearch("\r\n--" + boundary);
+      this._bparser.on("info", function(isMatch, data, start, end) {
+        self._oninfo(isMatch, data, start, end);
+      });
+    };
+    Dicer.prototype._ignore = function() {
+      if (this._part && !this._ignoreData) {
+        this._ignoreData = true;
+        this._part.on("error", EMPTY_FN);
+        this._part.resume();
+      }
+    };
+    Dicer.prototype._oninfo = function(isMatch, data, start, end) {
+      let buf;
+      const self = this;
+      let i = 0;
+      let r;
+      let shouldWriteMore = true;
+      if (!this._part && this._justMatched && data) {
+        while (this._dashes < 2 && start + i < end) {
+          if (data[start + i] === DASH) {
+            ++i;
+            ++this._dashes;
+          } else {
+            if (this._dashes) {
+              buf = B_ONEDASH;
+            }
+            this._dashes = 0;
             break;
+          }
         }
-        if (i === str.length)
-          return;
-        let name;
-        const nameStart = i;
-        for (; i < str.length; ++i) {
-          const code = str.charCodeAt(i);
-          if (TOKEN[code] !== 1) {
-            if (code === 61)
-              break;
-            return;
+        if (this._dashes === 2) {
+          if (start + i < end && this._events.trailer) {
+            this.emit("trailer", data.slice(start + i, end));
+          }
+          this.reset();
+          this._finished = true;
+          if (self._parts === 0) {
+            self._realFinish = true;
+            self.emit("finish");
+            self._realFinish = false;
           }
         }
-        if (i === str.length)
+        if (this._dashes) {
           return;
-        let value = "";
-        let valueStart;
-        let charset;
-        name = str.slice(nameStart, i);
-        if (name.charCodeAt(name.length - 1) === 42) {
-          const charsetStart = ++i;
-          for (; i < str.length; ++i) {
-            const code = str.charCodeAt(i);
-            if (CHARSET[code] !== 1) {
-              if (code !== 39)
-                return;
-              break;
-            }
+        }
+      }
+      if (this._justMatched) {
+        this._justMatched = false;
+      }
+      if (!this._part) {
+        this._part = new PartStream(this._partOpts);
+        this._part._read = function(n) {
+          self._unpause();
+        };
+        if (this._isPreamble && this._events.preamble) {
+          this.emit("preamble", this._part);
+        } else if (this._isPreamble !== true && this._events.part) {
+          this.emit("part", this._part);
+        } else {
+          this._ignore();
+        }
+        if (!this._isPreamble) {
+          this._inHeader = true;
+        }
+      }
+      if (data && start < end && !this._ignoreData) {
+        if (this._isPreamble || !this._inHeader) {
+          if (buf) {
+            shouldWriteMore = this._part.push(buf);
           }
-          if (i === str.length)
-            return;
-          charset = str.slice(charsetStart, i);
-          ++i;
-          for (; i < str.length; ++i) {
-            const code = str.charCodeAt(i);
-            if (code === 39)
-              break;
+          shouldWriteMore = this._part.push(data.slice(start, end));
+          if (!shouldWriteMore) {
+            this._pause = true;
           }
-          if (i === str.length)
-            return;
-          ++i;
-          if (i === str.length)
-            return;
-          valueStart = i;
-          let encode = 0;
-          for (; i < str.length; ++i) {
-            const code = str.charCodeAt(i);
-            if (EXTENDED_VALUE[code] !== 1) {
-              if (code === 37) {
-                let hexUpper;
-                let hexLower;
-                if (i + 2 < str.length && (hexUpper = HEX_VALUES[str.charCodeAt(i + 1)]) !== -1 && (hexLower = HEX_VALUES[str.charCodeAt(i + 2)]) !== -1) {
-                  const byteVal = (hexUpper << 4) + hexLower;
-                  value += str.slice(valueStart, i);
-                  value += String.fromCharCode(byteVal);
-                  i += 2;
-                  valueStart = i + 1;
-                  if (byteVal >= 128)
-                    encode = 2;
-                  else if (encode === 0)
-                    encode = 1;
-                  continue;
-                }
-                return;
-              }
-              break;
-            }
+        } else if (!this._isPreamble && this._inHeader) {
+          if (buf) {
+            this._hparser.push(buf);
           }
-          value += str.slice(valueStart, i);
-          value = convertToUTF8(value, charset, encode);
-          if (value === void 0)
-            return;
+          r = this._hparser.push(data.slice(start, end));
+          if (!this._inHeader && r !== void 0 && r < end) {
+            this._oninfo(false, data, start + r, end);
+          }
+        }
+      }
+      if (isMatch) {
+        this._hparser.reset();
+        if (this._isPreamble) {
+          this._isPreamble = false;
         } else {
-          ++i;
-          if (i === str.length)
-            return;
-          if (str.charCodeAt(i) === 34) {
-            valueStart = ++i;
-            let escaping = false;
-            for (; i < str.length; ++i) {
-              const code = str.charCodeAt(i);
-              if (code === 92) {
-                if (escaping) {
-                  valueStart = i;
-                  escaping = false;
+          if (start !== end) {
+            ++this._parts;
+            this._part.on("end", function() {
+              if (--self._parts === 0) {
+                if (self._finished) {
+                  self._realFinish = true;
+                  self.emit("finish");
+                  self._realFinish = false;
                 } else {
-                  value += str.slice(valueStart, i);
-                  escaping = true;
-                }
-                continue;
-              }
-              if (code === 34) {
-                if (escaping) {
-                  valueStart = i;
-                  escaping = false;
-                  continue;
+                  self._unpause();
                 }
-                value += str.slice(valueStart, i);
-                break;
-              }
-              if (escaping) {
-                valueStart = i - 1;
-                escaping = false;
-              }
-              if (QDTEXT[code] !== 1)
-                return;
-            }
-            if (i === str.length)
-              return;
-            ++i;
-          } else {
-            valueStart = i;
-            for (; i < str.length; ++i) {
-              const code = str.charCodeAt(i);
-              if (TOKEN[code] !== 1) {
-                if (i === valueStart)
-                  return;
-                break;
               }
-            }
-            value = str.slice(valueStart, i);
+            });
           }
-          value = defDecoder(value, 2);
-          if (value === void 0)
-            return;
         }
-        name = name.toLowerCase();
-        if (params[name] === void 0)
-          params[name] = value;
+        this._part.push(null);
+        this._part = void 0;
+        this._ignoreData = false;
+        this._justMatched = true;
+        this._dashes = 0;
       }
-      return params;
-    }
-    function getDecoder(charset) {
-      let lc;
-      while (true) {
-        switch (charset) {
-          case "utf-8":
-          case "utf8":
-            return decoders.utf8;
-          case "latin1":
-          case "ascii":
-          case "us-ascii":
-          case "iso-8859-1":
-          case "iso8859-1":
-          case "iso88591":
-          case "iso_8859-1":
-          case "windows-1252":
-          case "iso_8859-1:1987":
-          case "cp1252":
-          case "x-cp1252":
-            return decoders.latin1;
-          case "utf16le":
-          case "utf-16le":
-          case "ucs2":
-          case "ucs-2":
-            return decoders.utf16le;
-          case "base64":
-            return decoders.base64;
-          default:
-            if (lc === void 0) {
-              lc = true;
-              charset = charset.toLowerCase();
-              continue;
-            }
-            return decoders.other.bind(charset);
-        }
+    };
+    Dicer.prototype._unpause = function() {
+      if (!this._pause) {
+        return;
       }
-    }
-    var decoders = {
-      utf8: (data, hint) => {
-        if (data.length === 0)
-          return "";
-        if (typeof data === "string") {
-          if (hint < 2)
-            return data;
-          data = Buffer.from(data, "latin1");
-        }
-        return data.utf8Slice(0, data.length);
-      },
-      latin1: (data, hint) => {
-        if (data.length === 0)
-          return "";
-        if (typeof data === "string")
-          return data;
-        return data.latin1Slice(0, data.length);
-      },
-      utf16le: (data, hint) => {
-        if (data.length === 0)
-          return "";
-        if (typeof data === "string")
-          data = Buffer.from(data, "latin1");
-        return data.ucs2Slice(0, data.length);
-      },
-      base64: (data, hint) => {
-        if (data.length === 0)
-          return "";
-        if (typeof data === "string")
-          data = Buffer.from(data, "latin1");
-        return data.base64Slice(0, data.length);
-      },
-      other: (data, hint) => {
-        if (data.length === 0)
-          return "";
-        if (typeof data === "string")
-          data = Buffer.from(data, "latin1");
-        try {
-          const decoder = new TextDecoder(exports2);
-          return decoder.decode(data);
-        } catch {
-        }
+      this._pause = false;
+      if (this._cb) {
+        const cb = this._cb;
+        this._cb = void 0;
+        cb();
       }
     };
-    function convertToUTF8(data, charset, hint) {
-      const decode = getDecoder(charset);
-      if (decode)
-        return decode(data, hint);
+    module2.exports = Dicer;
+  }
+});
+
+// node_modules/@fastify/busboy/lib/utils/decodeText.js
+var require_decodeText = __commonJS({
+  "node_modules/@fastify/busboy/lib/utils/decodeText.js"(exports2, module2) {
+    "use strict";
+    var utf8Decoder = new TextDecoder("utf-8");
+    var textDecoders = /* @__PURE__ */ new Map([
+      ["utf-8", utf8Decoder],
+      ["utf8", utf8Decoder]
+    ]);
+    function decodeText(text, textEncoding, destEncoding) {
+      if (text) {
+        if (textDecoders.has(destEncoding)) {
+          try {
+            return textDecoders.get(destEncoding).decode(Buffer.from(text, textEncoding));
+          } catch (e) {
+          }
+        } else {
+          try {
+            textDecoders.set(destEncoding, new TextDecoder(destEncoding));
+            return textDecoders.get(destEncoding).decode(Buffer.from(text, textEncoding));
+          } catch (e) {
+          }
+        }
+      }
+      return text;
+    }
+    module2.exports = decodeText;
+  }
+});
+
+// node_modules/@fastify/busboy/lib/utils/parseParams.js
+var require_parseParams = __commonJS({
+  "node_modules/@fastify/busboy/lib/utils/parseParams.js"(exports2, module2) {
+    "use strict";
+    var decodeText = require_decodeText();
+    var RE_ENCODED = /%([a-fA-F0-9]{2})/g;
+    function encodedReplacer(match, byte) {
+      return String.fromCharCode(parseInt(byte, 16));
+    }
+    function parseParams(str) {
+      const res = [];
+      let state = "key";
+      let charset = "";
+      let inquote = false;
+      let escaping = false;
+      let p = 0;
+      let tmp = "";
+      for (var i = 0, len = str.length; i < len; ++i) {
+        const char = str[i];
+        if (char === "\\" && inquote) {
+          if (escaping) {
+            escaping = false;
+          } else {
+            escaping = true;
+            continue;
+          }
+        } else if (char === '"') {
+          if (!escaping) {
+            if (inquote) {
+              inquote = false;
+              state = "key";
+            } else {
+              inquote = true;
+            }
+            continue;
+          } else {
+            escaping = false;
+          }
+        } else {
+          if (escaping && inquote) {
+            tmp += "\\";
+          }
+          escaping = false;
+          if ((state === "charset" || state === "lang") && char === "'") {
+            if (state === "charset") {
+              state = "lang";
+              charset = tmp.substring(1);
+            } else {
+              state = "value";
+            }
+            tmp = "";
+            continue;
+          } else if (state === "key" && (char === "*" || char === "=") && res.length) {
+            if (char === "*") {
+              state = "charset";
+            } else {
+              state = "value";
+            }
+            res[p] = [tmp, void 0];
+            tmp = "";
+            continue;
+          } else if (!inquote && char === ";") {
+            state = "key";
+            if (charset) {
+              if (tmp.length) {
+                tmp = decodeText(
+                  tmp.replace(RE_ENCODED, encodedReplacer),
+                  "binary",
+                  charset
+                );
+              }
+              charset = "";
+            } else if (tmp.length) {
+              tmp = decodeText(tmp, "binary", "utf8");
+            }
+            if (res[p] === void 0) {
+              res[p] = tmp;
+            } else {
+              res[p][1] = tmp;
+            }
+            tmp = "";
+            ++p;
+            continue;
+          } else if (!inquote && (char === " " || char === "	")) {
+            continue;
+          }
+        }
+        tmp += char;
+      }
+      if (charset && tmp.length) {
+        tmp = decodeText(
+          tmp.replace(RE_ENCODED, encodedReplacer),
+          "binary",
+          charset
+        );
+      } else if (tmp) {
+        tmp = decodeText(tmp, "binary", "utf8");
+      }
+      if (res[p] === void 0) {
+        if (tmp) {
+          res[p] = tmp;
+        }
+      } else {
+        res[p][1] = tmp;
+      }
+      return res;
     }
-    function basename(path) {
-      if (typeof path !== "string")
+    module2.exports = parseParams;
+  }
+});
+
+// node_modules/@fastify/busboy/lib/utils/basename.js
+var require_basename = __commonJS({
+  "node_modules/@fastify/busboy/lib/utils/basename.js"(exports2, module2) {
+    "use strict";
+    module2.exports = function basename(path) {
+      if (typeof path !== "string") {
         return "";
-      for (let i = path.length - 1; i >= 0; --i) {
+      }
+      for (var i = path.length - 1; i >= 0; --i) {
         switch (path.charCodeAt(i)) {
           case 47:
           case 92:
@@ -2445,8 +2806,296 @@ var require_utils = __commonJS({
         }
       }
       return path === ".." || path === "." ? "" : path;
+    };
+  }
+});
+
+// node_modules/@fastify/busboy/lib/types/multipart.js
+var require_multipart = __commonJS({
+  "node_modules/@fastify/busboy/lib/types/multipart.js"(exports2, module2) {
+    "use strict";
+    var { Readable } = require("node:stream");
+    var { inherits } = require("node:util");
+    var Dicer = require_Dicer();
+    var parseParams = require_parseParams();
+    var decodeText = require_decodeText();
+    var basename = require_basename();
+    var getLimit = require_getLimit();
+    var RE_BOUNDARY = /^boundary$/i;
+    var RE_FIELD = /^form-data$/i;
+    var RE_CHARSET = /^charset$/i;
+    var RE_FILENAME = /^filename$/i;
+    var RE_NAME = /^name$/i;
+    Multipart.detect = /^multipart\/form-data/i;
+    function Multipart(boy, cfg) {
+      let i;
+      let len;
+      const self = this;
+      let boundary;
+      const limits = cfg.limits;
+      const isPartAFile = cfg.isPartAFile || ((fieldName, contentType, fileName) => contentType === "application/octet-stream" || fileName !== void 0);
+      const parsedConType = cfg.parsedConType || [];
+      const defCharset = cfg.defCharset || "utf8";
+      const preservePath = cfg.preservePath;
+      const fileOpts = { highWaterMark: cfg.fileHwm };
+      for (i = 0, len = parsedConType.length; i < len; ++i) {
+        if (Array.isArray(parsedConType[i]) && RE_BOUNDARY.test(parsedConType[i][0])) {
+          boundary = parsedConType[i][1];
+          break;
+        }
+      }
+      function checkFinished() {
+        if (nends === 0 && finished && !boy._done) {
+          finished = false;
+          self.end();
+        }
+      }
+      if (typeof boundary !== "string") {
+        throw new Error("Multipart: Boundary not found");
+      }
+      const fieldSizeLimit = getLimit(limits, "fieldSize", 1 * 1024 * 1024);
+      const fileSizeLimit = getLimit(limits, "fileSize", Infinity);
+      const filesLimit = getLimit(limits, "files", Infinity);
+      const fieldsLimit = getLimit(limits, "fields", Infinity);
+      const partsLimit = getLimit(limits, "parts", Infinity);
+      const headerPairsLimit = getLimit(limits, "headerPairs", 2e3);
+      const headerSizeLimit = getLimit(limits, "headerSize", 80 * 1024);
+      let nfiles = 0;
+      let nfields = 0;
+      let nends = 0;
+      let curFile;
+      let curField;
+      let finished = false;
+      this._needDrain = false;
+      this._pause = false;
+      this._cb = void 0;
+      this._nparts = 0;
+      this._boy = boy;
+      const parserCfg = {
+        boundary,
+        maxHeaderPairs: headerPairsLimit,
+        maxHeaderSize: headerSizeLimit,
+        partHwm: fileOpts.highWaterMark,
+        highWaterMark: cfg.highWaterMark
+      };
+      this.parser = new Dicer(parserCfg);
+      this.parser.on("drain", function() {
+        self._needDrain = false;
+        if (self._cb && !self._pause) {
+          const cb = self._cb;
+          self._cb = void 0;
+          cb();
+        }
+      }).on("part", function onPart(part) {
+        if (++self._nparts > partsLimit) {
+          self.parser.removeListener("part", onPart);
+          self.parser.on("part", skipPart);
+          boy.hitPartsLimit = true;
+          boy.emit("partsLimit");
+          return skipPart(part);
+        }
+        if (curField) {
+          const field = curField;
+          field.emit("end");
+          field.removeAllListeners("end");
+        }
+        part.on("header", function(header) {
+          let contype;
+          let fieldname;
+          let parsed;
+          let charset;
+          let encoding;
+          let filename;
+          let nsize = 0;
+          if (header["content-type"]) {
+            parsed = parseParams(header["content-type"][0]);
+            if (parsed[0]) {
+              contype = parsed[0].toLowerCase();
+              for (i = 0, len = parsed.length; i < len; ++i) {
+                if (RE_CHARSET.test(parsed[i][0])) {
+                  charset = parsed[i][1].toLowerCase();
+                  break;
+                }
+              }
+            }
+          }
+          if (contype === void 0) {
+            contype = "text/plain";
+          }
+          if (charset === void 0) {
+            charset = defCharset;
+          }
+          if (header["content-disposition"]) {
+            parsed = parseParams(header["content-disposition"][0]);
+            if (!RE_FIELD.test(parsed[0])) {
+              return skipPart(part);
+            }
+            for (i = 0, len = parsed.length; i < len; ++i) {
+              if (RE_NAME.test(parsed[i][0])) {
+                fieldname = parsed[i][1];
+              } else if (RE_FILENAME.test(parsed[i][0])) {
+                filename = parsed[i][1];
+                if (!preservePath) {
+                  filename = basename(filename);
+                }
+              }
+            }
+          } else {
+            return skipPart(part);
+          }
+          if (header["content-transfer-encoding"]) {
+            encoding = header["content-transfer-encoding"][0].toLowerCase();
+          } else {
+            encoding = "7bit";
+          }
+          let onData, onEnd;
+          if (isPartAFile(fieldname, contype, filename)) {
+            if (nfiles === filesLimit) {
+              if (!boy.hitFilesLimit) {
+                boy.hitFilesLimit = true;
+                boy.emit("filesLimit");
+              }
+              return skipPart(part);
+            }
+            ++nfiles;
+            if (!boy._events.file) {
+              self.parser._ignore();
+              return;
+            }
+            ++nends;
+            const file = new FileStream(fileOpts);
+            curFile = file;
+            file.on("end", function() {
+              --nends;
+              self._pause = false;
+              checkFinished();
+              if (self._cb && !self._needDrain) {
+                const cb = self._cb;
+                self._cb = void 0;
+                cb();
+              }
+            });
+            file._read = function(n) {
+              if (!self._pause) {
+                return;
+              }
+              self._pause = false;
+              if (self._cb && !self._needDrain) {
+                const cb = self._cb;
+                self._cb = void 0;
+                cb();
+              }
+            };
+            boy.emit("file", fieldname, file, filename, encoding, contype);
+            onData = function(data) {
+              if ((nsize += data.length) > fileSizeLimit) {
+                const extralen = fileSizeLimit - nsize + data.length;
+                if (extralen > 0) {
+                  file.push(data.slice(0, extralen));
+                }
+                file.truncated = true;
+                file.bytesRead = fileSizeLimit;
+                part.removeAllListeners("data");
+                file.emit("limit");
+                return;
+              } else if (!file.push(data)) {
+                self._pause = true;
+              }
+              file.bytesRead = nsize;
+            };
+            onEnd = function() {
+              curFile = void 0;
+              file.push(null);
+            };
+          } else {
+            if (nfields === fieldsLimit) {
+              if (!boy.hitFieldsLimit) {
+                boy.hitFieldsLimit = true;
+                boy.emit("fieldsLimit");
+              }
+              return skipPart(part);
+            }
+            ++nfields;
+            ++nends;
+            let buffer = "";
+            let truncated = false;
+            curField = part;
+            onData = function(data) {
+              if ((nsize += data.length) > fieldSizeLimit) {
+                const extralen = fieldSizeLimit - (nsize - data.length);
+                buffer += data.toString("binary", 0, extralen);
+                truncated = true;
+                part.removeAllListeners("data");
+              } else {
+                buffer += data.toString("binary");
+              }
+            };
+            onEnd = function() {
+              curField = void 0;
+              if (buffer.length) {
+                buffer = decodeText(buffer, "binary", charset);
+              }
+              boy.emit("field", fieldname, buffer, false, truncated, encoding, contype);
+              --nends;
+              checkFinished();
+            };
+          }
+          part._readableState.sync = false;
+          part.on("data", onData);
+          part.on("end", onEnd);
+        }).on("error", function(err) {
+          if (curFile) {
+            curFile.emit("error", err);
+          }
+        });
+      }).on("error", function(err) {
+        boy.emit("error", err);
+      }).on("finish", function() {
+        finished = true;
+        checkFinished();
+      });
+    }
+    Multipart.prototype.write = function(chunk, cb) {
+      const r = this.parser.write(chunk);
+      if (r && !this._pause) {
+        cb();
+      } else {
+        this._needDrain = !r;
+        this._cb = cb;
+      }
+    };
+    Multipart.prototype.end = function() {
+      const self = this;
+      if (self.parser.writable) {
+        self.parser.end();
+      } else if (!self._boy._done) {
+        process.nextTick(function() {
+          self._boy._done = true;
+          self._boy.emit("finish");
+        });
+      }
+    };
+    function skipPart(part) {
+      part.resume();
+    }
+    function FileStream(opts) {
+      Readable.call(this, opts);
+      this.bytesRead = 0;
+      this.truncated = false;
     }
-    var TOKEN = [
+    inherits(FileStream, Readable);
+    FileStream.prototype._read = function(n) {
+    };
+    module2.exports = Multipart;
+  }
+});
+
+// node_modules/@fastify/busboy/lib/utils/Decoder.js
+var require_Decoder = __commonJS({
+  "node_modules/@fastify/busboy/lib/utils/Decoder.js"(exports2, module2) {
+    "use strict";
+    var RE_PLUS = /\+/g;
+    var HEX = [
       0,
       0,
       0,
@@ -2480,31 +3129,11 @@ var require_utils = __commonJS({
       0,
       0,
       0,
-      1,
       0,
-      1,
-      1,
-      1,
-      1,
-      1,
       0,
       0,
-      1,
-      1,
       0,
-      1,
-      1,
       0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
       0,
       0,
       0,
@@ -2512,32 +3141,6 @@ var require_utils = __commonJS({
       0,
       0,
       0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
       0,
       0,
       0,
@@ -2551,100 +3154,6 @@ var require_utils = __commonJS({
       1,
       1,
       1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      1,
-      0,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
       0,
       0,
       0,
@@ -2652,6 +3161,12 @@ var require_utils = __commonJS({
       0,
       0,
       0,
+      1,
+      1,
+      1,
+      1,
+      1,
+      1,
       0,
       0,
       0,
@@ -2678,6 +3193,12 @@ var require_utils = __commonJS({
       0,
       0,
       0,
+      1,
+      1,
+      1,
+      1,
+      1,
+      1,
       0,
       0,
       0,
@@ -2704,3053 +3225,341 @@ var require_utils = __commonJS({
       0,
       0
     ];
-    var QDTEXT = [
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      1,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1
-    ];
-    var CHARSET = [
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      0,
-      1,
-      1,
-      1,
-      1,
-      0,
-      0,
-      0,
-      0,
-      1,
-      0,
-      1,
-      0,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      0,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      1,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0
-    ];
-    var EXTENDED_VALUE = [
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      0,
-      1,
-      1,
-      0,
-      1,
-      0,
-      0,
-      0,
-      0,
-      1,
-      0,
-      1,
-      1,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      0,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      1,
-      0,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0
-    ];
-    var HEX_VALUES = [
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      0,
-      1,
-      2,
-      3,
-      4,
-      5,
-      6,
-      7,
-      8,
-      9,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      10,
-      11,
-      12,
-      13,
-      14,
-      15,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      10,
-      11,
-      12,
-      13,
-      14,
-      15,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1
-    ];
-    module2.exports = {
-      basename,
-      convertToUTF8,
-      getDecoder,
-      parseContentType,
-      parseDisposition
-    };
-  }
-});
-
-// node_modules/streamsearch/lib/sbmh.js
-var require_sbmh = __commonJS({
-  "node_modules/streamsearch/lib/sbmh.js"(exports2, module2) {
-    "use strict";
-    function memcmp(buf1, pos1, buf2, pos2, num) {
-      for (let i = 0; i < num; ++i) {
-        if (buf1[pos1 + i] !== buf2[pos2 + i])
-          return false;
-      }
-      return true;
-    }
-    var SBMH = class {
-      constructor(needle, cb) {
-        if (typeof cb !== "function")
-          throw new Error("Missing match callback");
-        if (typeof needle === "string")
-          needle = Buffer.from(needle);
-        else if (!Buffer.isBuffer(needle))
-          throw new Error(`Expected Buffer for needle, got ${typeof needle}`);
-        const needleLen = needle.length;
-        this.maxMatches = Infinity;
-        this.matches = 0;
-        this._cb = cb;
-        this._lookbehindSize = 0;
-        this._needle = needle;
-        this._bufPos = 0;
-        this._lookbehind = Buffer.allocUnsafe(needleLen);
-        this._occ = [
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen,
-          needleLen
-        ];
-        if (needleLen > 1) {
-          for (let i = 0; i < needleLen - 1; ++i)
-            this._occ[needle[i]] = needleLen - 1 - i;
-        }
-      }
-      reset() {
-        this.matches = 0;
-        this._lookbehindSize = 0;
-        this._bufPos = 0;
-      }
-      push(chunk, pos) {
-        let result;
-        if (!Buffer.isBuffer(chunk))
-          chunk = Buffer.from(chunk, "latin1");
-        const chunkLen = chunk.length;
-        this._bufPos = pos || 0;
-        while (result !== chunkLen && this.matches < this.maxMatches)
-          result = feed(this, chunk);
-        return result;
-      }
-      destroy() {
-        const lbSize = this._lookbehindSize;
-        if (lbSize)
-          this._cb(false, this._lookbehind, 0, lbSize, false);
-        this.reset();
-      }
-    };
-    function feed(self, data) {
-      const len = data.length;
-      const needle = self._needle;
-      const needleLen = needle.length;
-      let pos = -self._lookbehindSize;
-      const lastNeedleCharPos = needleLen - 1;
-      const lastNeedleChar = needle[lastNeedleCharPos];
-      const end = len - needleLen;
-      const occ = self._occ;
-      const lookbehind = self._lookbehind;
-      if (pos < 0) {
-        while (pos < 0 && pos <= end) {
-          const nextPos = pos + lastNeedleCharPos;
-          const ch = nextPos < 0 ? lookbehind[self._lookbehindSize + nextPos] : data[nextPos];
-          if (ch === lastNeedleChar && matchNeedle(self, data, pos, lastNeedleCharPos)) {
-            self._lookbehindSize = 0;
-            ++self.matches;
-            if (pos > -self._lookbehindSize)
-              self._cb(true, lookbehind, 0, self._lookbehindSize + pos, false);
-            else
-              self._cb(true, void 0, 0, 0, true);
-            return self._bufPos = pos + needleLen;
-          }
-          pos += occ[ch];
-        }
-        while (pos < 0 && !matchNeedle(self, data, pos, len - pos))
-          ++pos;
-        if (pos < 0) {
-          const bytesToCutOff = self._lookbehindSize + pos;
-          if (bytesToCutOff > 0) {
-            self._cb(false, lookbehind, 0, bytesToCutOff, false);
-          }
-          self._lookbehindSize -= bytesToCutOff;
-          lookbehind.copy(lookbehind, 0, bytesToCutOff, self._lookbehindSize);
-          lookbehind.set(data, self._lookbehindSize);
-          self._lookbehindSize += len;
-          self._bufPos = len;
-          return len;
-        }
-        self._cb(false, lookbehind, 0, self._lookbehindSize, false);
-        self._lookbehindSize = 0;
-      }
-      pos += self._bufPos;
-      const firstNeedleChar = needle[0];
-      while (pos <= end) {
-        const ch = data[pos + lastNeedleCharPos];
-        if (ch === lastNeedleChar && data[pos] === firstNeedleChar && memcmp(needle, 0, data, pos, lastNeedleCharPos)) {
-          ++self.matches;
-          if (pos > 0)
-            self._cb(true, data, self._bufPos, pos, true);
-          else
-            self._cb(true, void 0, 0, 0, true);
-          return self._bufPos = pos + needleLen;
-        }
-        pos += occ[ch];
-      }
-      while (pos < len) {
-        if (data[pos] !== firstNeedleChar || !memcmp(data, pos, needle, 0, len - pos)) {
-          ++pos;
-          continue;
-        }
-        data.copy(lookbehind, 0, pos, len);
-        self._lookbehindSize = len - pos;
-        break;
-      }
-      if (pos > 0)
-        self._cb(false, data, self._bufPos, pos < len ? pos : len, true);
-      self._bufPos = len;
-      return len;
-    }
-    function matchNeedle(self, data, pos, len) {
-      const lb = self._lookbehind;
-      const lbSize = self._lookbehindSize;
-      const needle = self._needle;
-      for (let i = 0; i < len; ++i, ++pos) {
-        const ch = pos < 0 ? lb[lbSize + pos] : data[pos];
-        if (ch !== needle[i])
-          return false;
-      }
-      return true;
-    }
-    module2.exports = SBMH;
-  }
-});
-
-// node_modules/busboy/lib/types/multipart.js
-var require_multipart = __commonJS({
-  "node_modules/busboy/lib/types/multipart.js"(exports2, module2) {
-    "use strict";
-    var { Readable, Writable } = require("stream");
-    var StreamSearch = require_sbmh();
-    var {
-      basename,
-      convertToUTF8,
-      getDecoder,
-      parseContentType,
-      parseDisposition
-    } = require_utils();
-    var BUF_CRLF = Buffer.from("\r\n");
-    var BUF_CR = Buffer.from("\r");
-    var BUF_DASH = Buffer.from("-");
-    function noop() {
-    }
-    var MAX_HEADER_PAIRS = 2e3;
-    var MAX_HEADER_SIZE = 16 * 1024;
-    var HPARSER_NAME = 0;
-    var HPARSER_PRE_OWS = 1;
-    var HPARSER_VALUE = 2;
-    var HeaderParser = class {
-      constructor(cb) {
-        this.header = /* @__PURE__ */ Object.create(null);
-        this.pairCount = 0;
-        this.byteCount = 0;
-        this.state = HPARSER_NAME;
-        this.name = "";
-        this.value = "";
-        this.crlf = 0;
-        this.cb = cb;
-      }
-      reset() {
-        this.header = /* @__PURE__ */ Object.create(null);
-        this.pairCount = 0;
-        this.byteCount = 0;
-        this.state = HPARSER_NAME;
-        this.name = "";
-        this.value = "";
-        this.crlf = 0;
-      }
-      push(chunk, pos, end) {
-        let start = pos;
-        while (pos < end) {
-          switch (this.state) {
-            case HPARSER_NAME: {
-              let done = false;
-              for (; pos < end; ++pos) {
-                if (this.byteCount === MAX_HEADER_SIZE)
-                  return -1;
-                ++this.byteCount;
-                const code = chunk[pos];
-                if (TOKEN[code] !== 1) {
-                  if (code !== 58)
-                    return -1;
-                  this.name += chunk.latin1Slice(start, pos);
-                  if (this.name.length === 0)
-                    return -1;
-                  ++pos;
-                  done = true;
-                  this.state = HPARSER_PRE_OWS;
-                  break;
-                }
-              }
-              if (!done) {
-                this.name += chunk.latin1Slice(start, pos);
-                break;
-              }
-            }
-            case HPARSER_PRE_OWS: {
-              let done = false;
-              for (; pos < end; ++pos) {
-                if (this.byteCount === MAX_HEADER_SIZE)
-                  return -1;
-                ++this.byteCount;
-                const code = chunk[pos];
-                if (code !== 32 && code !== 9) {
-                  start = pos;
-                  done = true;
-                  this.state = HPARSER_VALUE;
-                  break;
-                }
-              }
-              if (!done)
-                break;
-            }
-            case HPARSER_VALUE:
-              switch (this.crlf) {
-                case 0:
-                  for (; pos < end; ++pos) {
-                    if (this.byteCount === MAX_HEADER_SIZE)
-                      return -1;
-                    ++this.byteCount;
-                    const code = chunk[pos];
-                    if (FIELD_VCHAR[code] !== 1) {
-                      if (code !== 13)
-                        return -1;
-                      ++this.crlf;
-                      break;
-                    }
-                  }
-                  this.value += chunk.latin1Slice(start, pos++);
-                  break;
-                case 1:
-                  if (this.byteCount === MAX_HEADER_SIZE)
-                    return -1;
-                  ++this.byteCount;
-                  if (chunk[pos++] !== 10)
-                    return -1;
-                  ++this.crlf;
-                  break;
-                case 2: {
-                  if (this.byteCount === MAX_HEADER_SIZE)
-                    return -1;
-                  ++this.byteCount;
-                  const code = chunk[pos];
-                  if (code === 32 || code === 9) {
-                    start = pos;
-                    this.crlf = 0;
-                  } else {
-                    if (++this.pairCount < MAX_HEADER_PAIRS) {
-                      this.name = this.name.toLowerCase();
-                      if (this.header[this.name] === void 0)
-                        this.header[this.name] = [this.value];
-                      else
-                        this.header[this.name].push(this.value);
-                    }
-                    if (code === 13) {
-                      ++this.crlf;
-                      ++pos;
-                    } else {
-                      start = pos;
-                      this.crlf = 0;
-                      this.state = HPARSER_NAME;
-                      this.name = "";
-                      this.value = "";
-                    }
-                  }
-                  break;
-                }
-                case 3: {
-                  if (this.byteCount === MAX_HEADER_SIZE)
-                    return -1;
-                  ++this.byteCount;
-                  if (chunk[pos++] !== 10)
-                    return -1;
-                  const header = this.header;
-                  this.reset();
-                  this.cb(header);
-                  return pos;
-                }
-              }
-              break;
-          }
-        }
-        return pos;
-      }
-    };
-    var FileStream = class extends Readable {
-      constructor(opts, owner) {
-        super(opts);
-        this.truncated = false;
-        this._readcb = null;
-        this.once("end", () => {
-          this._read();
-          if (--owner._fileEndsLeft === 0 && owner._finalcb) {
-            const cb = owner._finalcb;
-            owner._finalcb = null;
-            process.nextTick(cb);
-          }
-        });
-      }
-      _read(n) {
-        const cb = this._readcb;
-        if (cb) {
-          this._readcb = null;
-          cb();
-        }
-      }
-    };
-    var ignoreData = {
-      push: (chunk, pos) => {
-      },
-      destroy: () => {
-      }
-    };
-    function callAndUnsetCb(self, err) {
-      const cb = self._writecb;
-      self._writecb = null;
-      if (err)
-        self.destroy(err);
-      else if (cb)
-        cb();
-    }
-    function nullDecoder(val, hint) {
-      return val;
-    }
-    var Multipart = class extends Writable {
-      constructor(cfg) {
-        const streamOpts = {
-          autoDestroy: true,
-          emitClose: true,
-          highWaterMark: typeof cfg.highWaterMark === "number" ? cfg.highWaterMark : void 0
-        };
-        super(streamOpts);
-        if (!cfg.conType.params || typeof cfg.conType.params.boundary !== "string")
-          throw new Error("Multipart: Boundary not found");
-        const boundary = cfg.conType.params.boundary;
-        const paramDecoder = typeof cfg.defParamCharset === "string" && cfg.defParamCharset ? getDecoder(cfg.defParamCharset) : nullDecoder;
-        const defCharset = cfg.defCharset || "utf8";
-        const preservePath = cfg.preservePath;
-        const fileOpts = {
-          autoDestroy: true,
-          emitClose: true,
-          highWaterMark: typeof cfg.fileHwm === "number" ? cfg.fileHwm : void 0
-        };
-        const limits = cfg.limits;
-        const fieldSizeLimit = limits && typeof limits.fieldSize === "number" ? limits.fieldSize : 1 * 1024 * 1024;
-        const fileSizeLimit = limits && typeof limits.fileSize === "number" ? limits.fileSize : Infinity;
-        const filesLimit = limits && typeof limits.files === "number" ? limits.files : Infinity;
-        const fieldsLimit = limits && typeof limits.fields === "number" ? limits.fields : Infinity;
-        const partsLimit = limits && typeof limits.parts === "number" ? limits.parts : Infinity;
-        let parts = -1;
-        let fields = 0;
-        let files = 0;
-        let skipPart = false;
-        this._fileEndsLeft = 0;
-        this._fileStream = void 0;
-        this._complete = false;
-        let fileSize = 0;
-        let field;
-        let fieldSize = 0;
-        let partCharset;
-        let partEncoding;
-        let partType;
-        let partName;
-        let partTruncated = false;
-        let hitFilesLimit = false;
-        let hitFieldsLimit = false;
-        this._hparser = null;
-        const hparser = new HeaderParser((header) => {
-          this._hparser = null;
-          skipPart = false;
-          partType = "text/plain";
-          partCharset = defCharset;
-          partEncoding = "7bit";
-          partName = void 0;
-          partTruncated = false;
-          let filename;
-          if (!header["content-disposition"]) {
-            skipPart = true;
-            return;
-          }
-          const disp = parseDisposition(header["content-disposition"][0], paramDecoder);
-          if (!disp || disp.type !== "form-data") {
-            skipPart = true;
-            return;
-          }
-          if (disp.params) {
-            if (disp.params.name)
-              partName = disp.params.name;
-            if (disp.params["filename*"])
-              filename = disp.params["filename*"];
-            else if (disp.params.filename)
-              filename = disp.params.filename;
-            if (filename !== void 0 && !preservePath)
-              filename = basename(filename);
-          }
-          if (header["content-type"]) {
-            const conType = parseContentType(header["content-type"][0]);
-            if (conType) {
-              partType = `${conType.type}/${conType.subtype}`;
-              if (conType.params && typeof conType.params.charset === "string")
-                partCharset = conType.params.charset.toLowerCase();
-            }
-          }
-          if (header["content-transfer-encoding"])
-            partEncoding = header["content-transfer-encoding"][0].toLowerCase();
-          if (partType === "application/octet-stream" || filename !== void 0) {
-            if (files === filesLimit) {
-              if (!hitFilesLimit) {
-                hitFilesLimit = true;
-                this.emit("filesLimit");
-              }
-              skipPart = true;
-              return;
-            }
-            ++files;
-            if (this.listenerCount("file") === 0) {
-              skipPart = true;
-              return;
-            }
-            fileSize = 0;
-            this._fileStream = new FileStream(fileOpts, this);
-            ++this._fileEndsLeft;
-            this.emit("file", partName, this._fileStream, {
-              filename,
-              encoding: partEncoding,
-              mimeType: partType
-            });
-          } else {
-            if (fields === fieldsLimit) {
-              if (!hitFieldsLimit) {
-                hitFieldsLimit = true;
-                this.emit("fieldsLimit");
-              }
-              skipPart = true;
-              return;
-            }
-            ++fields;
-            if (this.listenerCount("field") === 0) {
-              skipPart = true;
-              return;
-            }
-            field = [];
-            fieldSize = 0;
-          }
-        });
-        let matchPostBoundary = 0;
-        const ssCb = (isMatch, data, start, end, isDataSafe) => {
-          retrydata:
-            while (data) {
-              if (this._hparser !== null) {
-                const ret = this._hparser.push(data, start, end);
-                if (ret === -1) {
-                  this._hparser = null;
-                  hparser.reset();
-                  this.emit("error", new Error("Malformed part header"));
-                  break;
-                }
-                start = ret;
-              }
-              if (start === end)
-                break;
-              if (matchPostBoundary !== 0) {
-                if (matchPostBoundary === 1) {
-                  switch (data[start]) {
-                    case 45:
-                      matchPostBoundary = 2;
-                      ++start;
-                      break;
-                    case 13:
-                      matchPostBoundary = 3;
-                      ++start;
-                      break;
-                    default:
-                      matchPostBoundary = 0;
-                  }
-                  if (start === end)
-                    return;
-                }
-                if (matchPostBoundary === 2) {
-                  matchPostBoundary = 0;
-                  if (data[start] === 45) {
-                    this._complete = true;
-                    this._bparser = ignoreData;
-                    return;
-                  }
-                  const writecb = this._writecb;
-                  this._writecb = noop;
-                  ssCb(false, BUF_DASH, 0, 1, false);
-                  this._writecb = writecb;
-                } else if (matchPostBoundary === 3) {
-                  matchPostBoundary = 0;
-                  if (data[start] === 10) {
-                    ++start;
-                    if (parts >= partsLimit)
-                      break;
-                    this._hparser = hparser;
-                    if (start === end)
-                      break;
-                    continue retrydata;
-                  } else {
-                    const writecb = this._writecb;
-                    this._writecb = noop;
-                    ssCb(false, BUF_CR, 0, 1, false);
-                    this._writecb = writecb;
-                  }
-                }
-              }
-              if (!skipPart) {
-                if (this._fileStream) {
-                  let chunk;
-                  const actualLen = Math.min(end - start, fileSizeLimit - fileSize);
-                  if (!isDataSafe) {
-                    chunk = Buffer.allocUnsafe(actualLen);
-                    data.copy(chunk, 0, start, start + actualLen);
-                  } else {
-                    chunk = data.slice(start, start + actualLen);
-                  }
-                  fileSize += chunk.length;
-                  if (fileSize === fileSizeLimit) {
-                    if (chunk.length > 0)
-                      this._fileStream.push(chunk);
-                    this._fileStream.emit("limit");
-                    this._fileStream.truncated = true;
-                    skipPart = true;
-                  } else if (!this._fileStream.push(chunk)) {
-                    if (this._writecb)
-                      this._fileStream._readcb = this._writecb;
-                    this._writecb = null;
-                  }
-                } else if (field !== void 0) {
-                  let chunk;
-                  const actualLen = Math.min(end - start, fieldSizeLimit - fieldSize);
-                  if (!isDataSafe) {
-                    chunk = Buffer.allocUnsafe(actualLen);
-                    data.copy(chunk, 0, start, start + actualLen);
-                  } else {
-                    chunk = data.slice(start, start + actualLen);
-                  }
-                  fieldSize += actualLen;
-                  field.push(chunk);
-                  if (fieldSize === fieldSizeLimit) {
-                    skipPart = true;
-                    partTruncated = true;
-                  }
-                }
-              }
-              break;
-            }
-          if (isMatch) {
-            matchPostBoundary = 1;
-            if (this._fileStream) {
-              this._fileStream.push(null);
-              this._fileStream = null;
-            } else if (field !== void 0) {
-              let data2;
-              switch (field.length) {
-                case 0:
-                  data2 = "";
-                  break;
-                case 1:
-                  data2 = convertToUTF8(field[0], partCharset, 0);
-                  break;
-                default:
-                  data2 = convertToUTF8(Buffer.concat(field, fieldSize), partCharset, 0);
-              }
-              field = void 0;
-              fieldSize = 0;
-              this.emit("field", partName, data2, {
-                nameTruncated: false,
-                valueTruncated: partTruncated,
-                encoding: partEncoding,
-                mimeType: partType
-              });
-            }
-            if (++parts === partsLimit)
-              this.emit("partsLimit");
-          }
-        };
-        this._bparser = new StreamSearch(`\r
---${boundary}`, ssCb);
-        this._writecb = null;
-        this._finalcb = null;
-        this.write(BUF_CRLF);
-      }
-      static detect(conType) {
-        return conType.type === "multipart" && conType.subtype === "form-data";
-      }
-      _write(chunk, enc, cb) {
-        this._writecb = cb;
-        this._bparser.push(chunk, 0);
-        if (this._writecb)
-          callAndUnsetCb(this);
-      }
-      _destroy(err, cb) {
-        this._hparser = null;
-        this._bparser = ignoreData;
-        if (!err)
-          err = checkEndState(this);
-        const fileStream = this._fileStream;
-        if (fileStream) {
-          this._fileStream = null;
-          fileStream.destroy(err);
-        }
-        cb(err);
-      }
-      _final(cb) {
-        this._bparser.destroy();
-        if (!this._complete)
-          return cb(new Error("Unexpected end of form"));
-        if (this._fileEndsLeft)
-          this._finalcb = finalcb.bind(null, this, cb);
-        else
-          finalcb(this, cb);
-      }
-    };
-    function finalcb(self, cb, err) {
-      if (err)
-        return cb(err);
-      err = checkEndState(self);
-      cb(err);
-    }
-    function checkEndState(self) {
-      if (self._hparser)
-        return new Error("Malformed part header");
-      const fileStream = self._fileStream;
-      if (fileStream) {
-        self._fileStream = null;
-        fileStream.destroy(new Error("Unexpected end of file"));
-      }
-      if (!self._complete)
-        return new Error("Unexpected end of form");
-    }
-    var TOKEN = [
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      0,
-      1,
-      1,
-      0,
-      1,
-      1,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      0,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      1,
-      0,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0
-    ];
-    var FIELD_VCHAR = [
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      0,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1,
-      1
-    ];
-    module2.exports = Multipart;
+    function Decoder() {
+      this.buffer = void 0;
+    }
+    Decoder.prototype.write = function(str) {
+      str = str.replace(RE_PLUS, " ");
+      let res = "";
+      let i = 0;
+      let p = 0;
+      const len = str.length;
+      for (; i < len; ++i) {
+        if (this.buffer !== void 0) {
+          if (!HEX[str.charCodeAt(i)]) {
+            res += "%" + this.buffer;
+            this.buffer = void 0;
+            --i;
+          } else {
+            this.buffer += str[i];
+            ++p;
+            if (this.buffer.length === 2) {
+              res += String.fromCharCode(parseInt(this.buffer, 16));
+              this.buffer = void 0;
+            }
+          }
+        } else if (str[i] === "%") {
+          if (i > p) {
+            res += str.substring(p, i);
+            p = i;
+          }
+          this.buffer = "";
+          ++p;
+        }
+      }
+      if (p < len && this.buffer === void 0) {
+        res += str.substring(p);
+      }
+      return res;
+    };
+    Decoder.prototype.reset = function() {
+      this.buffer = void 0;
+    };
+    module2.exports = Decoder;
   }
 });
 
-// node_modules/busboy/lib/types/urlencoded.js
+// node_modules/@fastify/busboy/lib/types/urlencoded.js
 var require_urlencoded = __commonJS({
-  "node_modules/busboy/lib/types/urlencoded.js"(exports2, module2) {
+  "node_modules/@fastify/busboy/lib/types/urlencoded.js"(exports2, module2) {
     "use strict";
-    var { Writable } = require("stream");
-    var { getDecoder } = require_utils();
-    var URLEncoded = class extends Writable {
-      constructor(cfg) {
-        const streamOpts = {
-          autoDestroy: true,
-          emitClose: true,
-          highWaterMark: typeof cfg.highWaterMark === "number" ? cfg.highWaterMark : void 0
-        };
-        super(streamOpts);
-        let charset = cfg.defCharset || "utf8";
-        if (cfg.conType.params && typeof cfg.conType.params.charset === "string")
-          charset = cfg.conType.params.charset;
-        this.charset = charset;
-        const limits = cfg.limits;
-        this.fieldSizeLimit = limits && typeof limits.fieldSize === "number" ? limits.fieldSize : 1 * 1024 * 1024;
-        this.fieldsLimit = limits && typeof limits.fields === "number" ? limits.fields : Infinity;
-        this.fieldNameSizeLimit = limits && typeof limits.fieldNameSize === "number" ? limits.fieldNameSize : 100;
-        this._inKey = true;
-        this._keyTrunc = false;
-        this._valTrunc = false;
-        this._bytesKey = 0;
-        this._bytesVal = 0;
-        this._fields = 0;
-        this._key = "";
-        this._val = "";
-        this._byte = -2;
-        this._lastPos = 0;
-        this._encode = 0;
-        this._decoder = getDecoder(charset);
-      }
-      static detect(conType) {
-        return conType.type === "application" && conType.subtype === "x-www-form-urlencoded";
-      }
-      _write(chunk, enc, cb) {
-        if (this._fields >= this.fieldsLimit)
-          return cb();
-        let i = 0;
-        const len = chunk.length;
-        this._lastPos = 0;
-        if (this._byte !== -2) {
-          i = readPctEnc(this, chunk, i, len);
-          if (i === -1)
-            return cb(new Error("Malformed urlencoded form"));
-          if (i >= len)
-            return cb();
-          if (this._inKey)
-            ++this._bytesKey;
-          else
-            ++this._bytesVal;
-        }
-        main:
-          while (i < len) {
-            if (this._inKey) {
-              i = skipKeyBytes(this, chunk, i, len);
-              while (i < len) {
-                switch (chunk[i]) {
-                  case 61:
-                    if (this._lastPos < i)
-                      this._key += chunk.latin1Slice(this._lastPos, i);
-                    this._lastPos = ++i;
-                    this._key = this._decoder(this._key, this._encode);
-                    this._encode = 0;
-                    this._inKey = false;
-                    continue main;
-                  case 38:
-                    if (this._lastPos < i)
-                      this._key += chunk.latin1Slice(this._lastPos, i);
-                    this._lastPos = ++i;
-                    this._key = this._decoder(this._key, this._encode);
-                    this._encode = 0;
-                    if (this._bytesKey > 0) {
-                      this.emit("field", this._key, "", {
-                        nameTruncated: this._keyTrunc,
-                        valueTruncated: false,
-                        encoding: this.charset,
-                        mimeType: "text/plain"
-                      });
-                    }
-                    this._key = "";
-                    this._val = "";
-                    this._keyTrunc = false;
-                    this._valTrunc = false;
-                    this._bytesKey = 0;
-                    this._bytesVal = 0;
-                    if (++this._fields >= this.fieldsLimit) {
-                      this.emit("fieldsLimit");
-                      return cb();
-                    }
-                    continue;
-                  case 43:
-                    if (this._lastPos < i)
-                      this._key += chunk.latin1Slice(this._lastPos, i);
-                    this._key += " ";
-                    this._lastPos = i + 1;
-                    break;
-                  case 37:
-                    if (this._encode === 0)
-                      this._encode = 1;
-                    if (this._lastPos < i)
-                      this._key += chunk.latin1Slice(this._lastPos, i);
-                    this._lastPos = i + 1;
-                    this._byte = -1;
-                    i = readPctEnc(this, chunk, i + 1, len);
-                    if (i === -1)
-                      return cb(new Error("Malformed urlencoded form"));
-                    if (i >= len)
-                      return cb();
-                    ++this._bytesKey;
-                    i = skipKeyBytes(this, chunk, i, len);
-                    continue;
-                }
-                ++i;
-                ++this._bytesKey;
-                i = skipKeyBytes(this, chunk, i, len);
-              }
-              if (this._lastPos < i)
-                this._key += chunk.latin1Slice(this._lastPos, i);
+    var Decoder = require_Decoder();
+    var decodeText = require_decodeText();
+    var getLimit = require_getLimit();
+    var RE_CHARSET = /^charset$/i;
+    UrlEncoded.detect = /^application\/x-www-form-urlencoded/i;
+    function UrlEncoded(boy, cfg) {
+      const limits = cfg.limits;
+      const parsedConType = cfg.parsedConType;
+      this.boy = boy;
+      this.fieldSizeLimit = getLimit(limits, "fieldSize", 1 * 1024 * 1024);
+      this.fieldNameSizeLimit = getLimit(limits, "fieldNameSize", 100);
+      this.fieldsLimit = getLimit(limits, "fields", Infinity);
+      let charset;
+      for (var i = 0, len = parsedConType.length; i < len; ++i) {
+        if (Array.isArray(parsedConType[i]) && RE_CHARSET.test(parsedConType[i][0])) {
+          charset = parsedConType[i][1].toLowerCase();
+          break;
+        }
+      }
+      if (charset === void 0) {
+        charset = cfg.defCharset || "utf8";
+      }
+      this.decoder = new Decoder();
+      this.charset = charset;
+      this._fields = 0;
+      this._state = "key";
+      this._checkingBytes = true;
+      this._bytesKey = 0;
+      this._bytesVal = 0;
+      this._key = "";
+      this._val = "";
+      this._keyTrunc = false;
+      this._valTrunc = false;
+      this._hitLimit = false;
+    }
+    UrlEncoded.prototype.write = function(data, cb) {
+      if (this._fields === this.fieldsLimit) {
+        if (!this.boy.hitFieldsLimit) {
+          this.boy.hitFieldsLimit = true;
+          this.boy.emit("fieldsLimit");
+        }
+        return cb();
+      }
+      let idxeq;
+      let idxamp;
+      let i;
+      let p = 0;
+      const len = data.length;
+      while (p < len) {
+        if (this._state === "key") {
+          idxeq = idxamp = void 0;
+          for (i = p; i < len; ++i) {
+            if (!this._checkingBytes) {
+              ++p;
+            }
+            if (data[i] === 61) {
+              idxeq = i;
+              break;
+            } else if (data[i] === 38) {
+              idxamp = i;
+              break;
+            }
+            if (this._checkingBytes && this._bytesKey === this.fieldNameSizeLimit) {
+              this._hitLimit = true;
+              break;
+            } else if (this._checkingBytes) {
+              ++this._bytesKey;
+            }
+          }
+          if (idxeq !== void 0) {
+            if (idxeq > p) {
+              this._key += this.decoder.write(data.toString("binary", p, idxeq));
+            }
+            this._state = "val";
+            this._hitLimit = false;
+            this._checkingBytes = true;
+            this._val = "";
+            this._bytesVal = 0;
+            this._valTrunc = false;
+            this.decoder.reset();
+            p = idxeq + 1;
+          } else if (idxamp !== void 0) {
+            ++this._fields;
+            let key;
+            const keyTrunc = this._keyTrunc;
+            if (idxamp > p) {
+              key = this._key += this.decoder.write(data.toString("binary", p, idxamp));
             } else {
-              i = skipValBytes(this, chunk, i, len);
-              while (i < len) {
-                switch (chunk[i]) {
-                  case 38:
-                    if (this._lastPos < i)
-                      this._val += chunk.latin1Slice(this._lastPos, i);
-                    this._lastPos = ++i;
-                    this._inKey = true;
-                    this._val = this._decoder(this._val, this._encode);
-                    this._encode = 0;
-                    if (this._bytesKey > 0 || this._bytesVal > 0) {
-                      this.emit("field", this._key, this._val, {
-                        nameTruncated: this._keyTrunc,
-                        valueTruncated: this._valTrunc,
-                        encoding: this.charset,
-                        mimeType: "text/plain"
-                      });
-                    }
-                    this._key = "";
-                    this._val = "";
-                    this._keyTrunc = false;
-                    this._valTrunc = false;
-                    this._bytesKey = 0;
-                    this._bytesVal = 0;
-                    if (++this._fields >= this.fieldsLimit) {
-                      this.emit("fieldsLimit");
-                      return cb();
-                    }
-                    continue main;
-                  case 43:
-                    if (this._lastPos < i)
-                      this._val += chunk.latin1Slice(this._lastPos, i);
-                    this._val += " ";
-                    this._lastPos = i + 1;
-                    break;
-                  case 37:
-                    if (this._encode === 0)
-                      this._encode = 1;
-                    if (this._lastPos < i)
-                      this._val += chunk.latin1Slice(this._lastPos, i);
-                    this._lastPos = i + 1;
-                    this._byte = -1;
-                    i = readPctEnc(this, chunk, i + 1, len);
-                    if (i === -1)
-                      return cb(new Error("Malformed urlencoded form"));
-                    if (i >= len)
-                      return cb();
-                    ++this._bytesVal;
-                    i = skipValBytes(this, chunk, i, len);
-                    continue;
-                }
-                ++i;
-                ++this._bytesVal;
-                i = skipValBytes(this, chunk, i, len);
-              }
-              if (this._lastPos < i)
-                this._val += chunk.latin1Slice(this._lastPos, i);
+              key = this._key;
+            }
+            this._hitLimit = false;
+            this._checkingBytes = true;
+            this._key = "";
+            this._bytesKey = 0;
+            this._keyTrunc = false;
+            this.decoder.reset();
+            if (key.length) {
+              this.boy.emit(
+                "field",
+                decodeText(key, "binary", this.charset),
+                "",
+                keyTrunc,
+                false
+              );
+            }
+            p = idxamp + 1;
+            if (this._fields === this.fieldsLimit) {
+              return cb();
+            }
+          } else if (this._hitLimit) {
+            if (i > p) {
+              this._key += this.decoder.write(data.toString("binary", p, i));
+            }
+            p = i;
+            if ((this._bytesKey = this._key.length) === this.fieldNameSizeLimit) {
+              this._checkingBytes = false;
+              this._keyTrunc = true;
             }
+          } else {
+            if (p < len) {
+              this._key += this.decoder.write(data.toString("binary", p));
+            }
+            p = len;
+          }
+        } else {
+          idxamp = void 0;
+          for (i = p; i < len; ++i) {
+            if (!this._checkingBytes) {
+              ++p;
+            }
+            if (data[i] === 38) {
+              idxamp = i;
+              break;
+            }
+            if (this._checkingBytes && this._bytesVal === this.fieldSizeLimit) {
+              this._hitLimit = true;
+              break;
+            } else if (this._checkingBytes) {
+              ++this._bytesVal;
+            }
+          }
+          if (idxamp !== void 0) {
+            ++this._fields;
+            if (idxamp > p) {
+              this._val += this.decoder.write(data.toString("binary", p, idxamp));
+            }
+            this.boy.emit(
+              "field",
+              decodeText(this._key, "binary", this.charset),
+              decodeText(this._val, "binary", this.charset),
+              this._keyTrunc,
+              this._valTrunc
+            );
+            this._state = "key";
+            this._hitLimit = false;
+            this._checkingBytes = true;
+            this._key = "";
+            this._bytesKey = 0;
+            this._keyTrunc = false;
+            this.decoder.reset();
+            p = idxamp + 1;
+            if (this._fields === this.fieldsLimit) {
+              return cb();
+            }
+          } else if (this._hitLimit) {
+            if (i > p) {
+              this._val += this.decoder.write(data.toString("binary", p, i));
+            }
+            p = i;
+            if (this._val === "" && this.fieldSizeLimit === 0 || (this._bytesVal = this._val.length) === this.fieldSizeLimit) {
+              this._checkingBytes = false;
+              this._valTrunc = true;
+            }
+          } else {
+            if (p < len) {
+              this._val += this.decoder.write(data.toString("binary", p));
+            }
+            p = len;
           }
-        cb();
-      }
-      _final(cb) {
-        if (this._byte !== -2)
-          return cb(new Error("Malformed urlencoded form"));
-        if (!this._inKey || this._bytesKey > 0 || this._bytesVal > 0) {
-          if (this._inKey)
-            this._key = this._decoder(this._key, this._encode);
-          else
-            this._val = this._decoder(this._val, this._encode);
-          this.emit("field", this._key, this._val, {
-            nameTruncated: this._keyTrunc,
-            valueTruncated: this._valTrunc,
-            encoding: this.charset,
-            mimeType: "text/plain"
-          });
         }
-        cb();
       }
+      cb();
     };
-    function readPctEnc(self, chunk, pos, len) {
-      if (pos >= len)
-        return len;
-      if (self._byte === -1) {
-        const hexUpper = HEX_VALUES[chunk[pos++]];
-        if (hexUpper === -1)
-          return -1;
-        if (hexUpper >= 8)
-          self._encode = 2;
-        if (pos < len) {
-          const hexLower = HEX_VALUES[chunk[pos++]];
-          if (hexLower === -1)
-            return -1;
-          if (self._inKey)
-            self._key += String.fromCharCode((hexUpper << 4) + hexLower);
-          else
-            self._val += String.fromCharCode((hexUpper << 4) + hexLower);
-          self._byte = -2;
-          self._lastPos = pos;
-        } else {
-          self._byte = hexUpper;
-        }
-      } else {
-        const hexLower = HEX_VALUES[chunk[pos++]];
-        if (hexLower === -1)
-          return -1;
-        if (self._inKey)
-          self._key += String.fromCharCode((self._byte << 4) + hexLower);
-        else
-          self._val += String.fromCharCode((self._byte << 4) + hexLower);
-        self._byte = -2;
-        self._lastPos = pos;
-      }
-      return pos;
-    }
-    function skipKeyBytes(self, chunk, pos, len) {
-      if (self._bytesKey > self.fieldNameSizeLimit) {
-        if (!self._keyTrunc) {
-          if (self._lastPos < pos)
-            self._key += chunk.latin1Slice(self._lastPos, pos - 1);
-        }
-        self._keyTrunc = true;
-        for (; pos < len; ++pos) {
-          const code = chunk[pos];
-          if (code === 61 || code === 38)
-            break;
-          ++self._bytesKey;
-        }
-        self._lastPos = pos;
+    UrlEncoded.prototype.end = function() {
+      if (this.boy._done) {
+        return;
       }
-      return pos;
-    }
-    function skipValBytes(self, chunk, pos, len) {
-      if (self._bytesVal > self.fieldSizeLimit) {
-        if (!self._valTrunc) {
-          if (self._lastPos < pos)
-            self._val += chunk.latin1Slice(self._lastPos, pos - 1);
-        }
-        self._valTrunc = true;
-        for (; pos < len; ++pos) {
-          if (chunk[pos] === 38)
-            break;
-          ++self._bytesVal;
-        }
-        self._lastPos = pos;
-      }
-      return pos;
-    }
-    var HEX_VALUES = [
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      0,
-      1,
-      2,
-      3,
-      4,
-      5,
-      6,
-      7,
-      8,
-      9,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      10,
-      11,
-      12,
-      13,
-      14,
-      15,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      10,
-      11,
-      12,
-      13,
-      14,
-      15,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1,
-      -1
-    ];
-    module2.exports = URLEncoded;
+      if (this._state === "key" && this._key.length > 0) {
+        this.boy.emit(
+          "field",
+          decodeText(this._key, "binary", this.charset),
+          "",
+          this._keyTrunc,
+          false
+        );
+      } else if (this._state === "val") {
+        this.boy.emit(
+          "field",
+          decodeText(this._key, "binary", this.charset),
+          decodeText(this._val, "binary", this.charset),
+          this._keyTrunc,
+          this._valTrunc
+        );
+      }
+      this.boy._done = true;
+      this.boy.emit("finish");
+    };
+    module2.exports = UrlEncoded;
   }
 });
 
-// node_modules/busboy/lib/index.js
-var require_lib = __commonJS({
-  "node_modules/busboy/lib/index.js"(exports2, module2) {
+// node_modules/@fastify/busboy/lib/main.js
+var require_main = __commonJS({
+  "node_modules/@fastify/busboy/lib/main.js"(exports2, module2) {
     "use strict";
-    var { parseContentType } = require_utils();
-    function getInstance(cfg) {
-      const headers = cfg.headers;
-      const conType = parseContentType(headers["content-type"]);
-      if (!conType)
-        throw new Error("Malformed content type");
-      for (const type of TYPES) {
-        const matched = type.detect(conType);
-        if (!matched)
-          continue;
-        const instanceCfg = {
-          limits: cfg.limits,
-          headers,
-          conType,
-          highWaterMark: void 0,
-          fileHwm: void 0,
-          defCharset: void 0,
-          defParamCharset: void 0,
-          preservePath: false
-        };
-        if (cfg.highWaterMark)
-          instanceCfg.highWaterMark = cfg.highWaterMark;
-        if (cfg.fileHwm)
-          instanceCfg.fileHwm = cfg.fileHwm;
-        instanceCfg.defCharset = cfg.defCharset;
-        instanceCfg.defParamCharset = cfg.defParamCharset;
-        instanceCfg.preservePath = cfg.preservePath;
-        return new type(instanceCfg);
-      }
-      throw new Error(`Unsupported content type: ${headers["content-type"]}`);
-    }
-    var TYPES = [
-      require_multipart(),
-      require_urlencoded()
-    ].filter(function(typemod) {
-      return typeof typemod.detect === "function";
-    });
-    module2.exports = (cfg) => {
-      if (typeof cfg !== "object" || cfg === null)
-        cfg = {};
-      if (typeof cfg.headers !== "object" || cfg.headers === null || typeof cfg.headers["content-type"] !== "string") {
-        throw new Error("Missing Content-Type");
+    var WritableStream = require("node:stream").Writable;
+    var { inherits } = require("node:util");
+    var Dicer = require_Dicer();
+    var MultipartParser = require_multipart();
+    var UrlencodedParser = require_urlencoded();
+    var parseParams = require_parseParams();
+    function Busboy(opts) {
+      if (!(this instanceof Busboy)) {
+        return new Busboy(opts);
+      }
+      if (typeof opts !== "object") {
+        throw new TypeError("Busboy expected an options-Object.");
+      }
+      if (typeof opts.headers !== "object") {
+        throw new TypeError("Busboy expected an options-Object with headers-attribute.");
+      }
+      if (typeof opts.headers["content-type"] !== "string") {
+        throw new TypeError("Missing Content-Type-header.");
+      }
+      const {
+        headers,
+        ...streamOptions
+      } = opts;
+      this.opts = {
+        autoDestroy: false,
+        ...streamOptions
+      };
+      WritableStream.call(this, this.opts);
+      this._done = false;
+      this._parser = this.getParserByHeaders(headers);
+      this._finished = false;
+    }
+    inherits(Busboy, WritableStream);
+    Busboy.prototype.emit = function(ev) {
+      if (ev === "finish") {
+        if (!this._done) {
+          this._parser?.end();
+          return;
+        } else if (this._finished) {
+          return;
+        }
+        this._finished = true;
+      }
+      WritableStream.prototype.emit.apply(this, arguments);
+    };
+    Busboy.prototype.getParserByHeaders = function(headers) {
+      const parsed = parseParams(headers["content-type"]);
+      const cfg = {
+        defCharset: this.opts.defCharset,
+        fileHwm: this.opts.fileHwm,
+        headers,
+        highWaterMark: this.opts.highWaterMark,
+        isPartAFile: this.opts.isPartAFile,
+        limits: this.opts.limits,
+        parsedConType: parsed,
+        preservePath: this.opts.preservePath
+      };
+      if (MultipartParser.detect.test(parsed[0])) {
+        return new MultipartParser(this, cfg);
       }
-      return getInstance(cfg);
+      if (UrlencodedParser.detect.test(parsed[0])) {
+        return new UrlencodedParser(this, cfg);
+      }
+      throw new Error("Unsupported Content-Type.");
+    };
+    Busboy.prototype._write = function(chunk, encoding, cb) {
+      this._parser.write(chunk, cb);
     };
+    module2.exports = Busboy;
+    module2.exports.default = Busboy;
+    module2.exports.Busboy = Busboy;
+    module2.exports.Dicer = Dicer;
   }
 });
 
@@ -5769,7 +3578,11 @@ var require_dataURL = __commonJS({
       let input = URLSerializer(dataURL, true);
       input = input.slice(5);
       const position = { position: 0 };
-      let mimeType = collectASequenceOfCodePointsFast(",", input, position);
+      let mimeType = collectASequenceOfCodePointsFast(
+        ",",
+        input,
+        position
+      );
       const mimeTypeLength = mimeType.length;
       mimeType = removeASCIIWhitespace(mimeType, true, true);
       if (position.position >= input.length) {
@@ -5850,7 +3663,11 @@ var require_dataURL = __commonJS({
     function parseMIMEType(input) {
       input = removeHTTPWhitespace(input, true, true);
       const position = { position: 0 };
-      const type = collectASequenceOfCodePointsFast("/", input, position);
+      const type = collectASequenceOfCodePointsFast(
+        "/",
+        input,
+        position
+      );
       if (type.length === 0 || !HTTP_TOKEN_CODEPOINTS.test(type)) {
         return "failure";
       }
@@ -5858,7 +3675,11 @@ var require_dataURL = __commonJS({
         return "failure";
       }
       position.position++;
-      let subtype = collectASequenceOfCodePointsFast(";", input, position);
+      let subtype = collectASequenceOfCodePointsFast(
+        ";",
+        input,
+        position
+      );
       subtype = removeHTTPWhitespace(subtype, false, true);
       if (subtype.length === 0 || !HTTP_TOKEN_CODEPOINTS.test(subtype)) {
         return "failure";
@@ -5868,13 +3689,24 @@ var require_dataURL = __commonJS({
       const mimeType = {
         type: typeLowercase,
         subtype: subtypeLowercase,
+        /** @type {Map<string, string>} */
         parameters: /* @__PURE__ */ new Map(),
+        // https://mimesniff.spec.whatwg.org/#mime-type-essence
         essence: `${typeLowercase}/${subtypeLowercase}`
       };
       while (position.position < input.length) {
         position.position++;
-        collectASequenceOfCodePoints((char) => HTTP_WHITESPACE_REGEX.test(char), input, position);
-        let parameterName = collectASequenceOfCodePoints((char) => char !== ";" && char !== "=", input, position);
+        collectASequenceOfCodePoints(
+          // https://fetch.spec.whatwg.org/#http-whitespace
+          (char) => HTTP_WHITESPACE_REGEX.test(char),
+          input,
+          position
+        );
+        let parameterName = collectASequenceOfCodePoints(
+          (char) => char !== ";" && char !== "=",
+          input,
+          position
+        );
         parameterName = parameterName.toLowerCase();
         if (position.position < input.length) {
           if (input[position.position] === ";") {
@@ -5888,9 +3720,17 @@ var require_dataURL = __commonJS({
         let parameterValue = null;
         if (input[position.position] === '"') {
           parameterValue = collectAnHTTPQuotedString(input, position, true);
-          collectASequenceOfCodePointsFast(";", input, position);
+          collectASequenceOfCodePointsFast(
+            ";",
+            input,
+            position
+          );
         } else {
-          parameterValue = collectASequenceOfCodePointsFast(";", input, position);
+          parameterValue = collectASequenceOfCodePointsFast(
+            ";",
+            input,
+            position
+          );
           parameterValue = removeHTTPWhitespace(parameterValue, false, true);
           if (parameterValue.length === 0) {
             continue;
@@ -5926,7 +3766,11 @@ var require_dataURL = __commonJS({
       assert(input[position.position] === '"');
       position.position++;
       while (true) {
-        value += collectASequenceOfCodePoints((char) => char !== '"' && char !== "\\", input, position);
+        value += collectASequenceOfCodePoints(
+          (char) => char !== '"' && char !== "\\",
+          input,
+          position
+        );
         if (position.position >= input.length) {
           break;
         }
@@ -6015,14 +3859,14 @@ var require_dataURL = __commonJS({
 var require_file = __commonJS({
   "lib/fetch/file.js"(exports2, module2) {
     "use strict";
-    var { Blob, File: NativeFile } = require("buffer");
+    var { Blob: Blob2, File: NativeFile } = require("buffer");
     var { types } = require("util");
     var { kState } = require_symbols2();
     var { isBlobLike } = require_util2();
     var { webidl } = require_webidl();
     var { parseMIMEType, serializeAMimeType } = require_dataURL();
     var { kEnumerableProperty } = require_util();
-    var File = class extends Blob {
+    var File = class _File extends Blob2 {
       constructor(fileBits, fileName, options = {}) {
         webidl.argumentLengthCheck(arguments, 2, { header: "File constructor" });
         fileBits = webidl.converters["sequence<BlobPart>"](fileBits);
@@ -6050,19 +3894,19 @@ var require_file = __commonJS({
         };
       }
       get name() {
-        webidl.brandCheck(this, File);
+        webidl.brandCheck(this, _File);
         return this[kState].name;
       }
       get lastModified() {
-        webidl.brandCheck(this, File);
+        webidl.brandCheck(this, _File);
         return this[kState].lastModified;
       }
       get type() {
-        webidl.brandCheck(this, File);
+        webidl.brandCheck(this, _File);
         return this[kState].type;
       }
     };
-    var FileLike = class {
+    var FileLike = class _FileLike {
       constructor(blobLike, fileName, options = {}) {
         const n = fileName;
         const t = options.type;
@@ -6075,35 +3919,35 @@ var require_file = __commonJS({
         };
       }
       stream(...args) {
-        webidl.brandCheck(this, FileLike);
+        webidl.brandCheck(this, _FileLike);
         return this[kState].blobLike.stream(...args);
       }
       arrayBuffer(...args) {
-        webidl.brandCheck(this, FileLike);
+        webidl.brandCheck(this, _FileLike);
         return this[kState].blobLike.arrayBuffer(...args);
       }
       slice(...args) {
-        webidl.brandCheck(this, FileLike);
+        webidl.brandCheck(this, _FileLike);
         return this[kState].blobLike.slice(...args);
       }
       text(...args) {
-        webidl.brandCheck(this, FileLike);
+        webidl.brandCheck(this, _FileLike);
         return this[kState].blobLike.text(...args);
       }
       get size() {
-        webidl.brandCheck(this, FileLike);
+        webidl.brandCheck(this, _FileLike);
         return this[kState].blobLike.size;
       }
       get type() {
-        webidl.brandCheck(this, FileLike);
+        webidl.brandCheck(this, _FileLike);
         return this[kState].blobLike.type;
       }
       get name() {
-        webidl.brandCheck(this, FileLike);
+        webidl.brandCheck(this, _FileLike);
         return this[kState].name;
       }
       get lastModified() {
-        webidl.brandCheck(this, FileLike);
+        webidl.brandCheck(this, _FileLike);
         return this[kState].lastModified;
       }
       get [Symbol.toStringTag]() {
@@ -6118,7 +3962,7 @@ var require_file = __commonJS({
       name: kEnumerableProperty,
       lastModified: kEnumerableProperty
     });
-    webidl.converters.Blob = webidl.interfaceConverter(Blob);
+    webidl.converters.Blob = webidl.interfaceConverter(Blob2);
     webidl.converters.BlobPart = function(V, opts) {
       if (webidl.util.Type(V) === "Object") {
         if (isBlobLike(V)) {
@@ -6130,7 +3974,9 @@ var require_file = __commonJS({
       }
       return webidl.converters.USVString(V, opts);
     };
-    webidl.converters["sequence<BlobPart>"] = webidl.sequenceConverter(webidl.converters.BlobPart);
+    webidl.converters["sequence<BlobPart>"] = webidl.sequenceConverter(
+      webidl.converters.BlobPart
+    );
     webidl.converters.FilePropertyBag = webidl.dictionaryConverter([
       {
         key: "lastModified",
@@ -6170,7 +4016,9 @@ var require_file = __commonJS({
           if (!element.buffer) {
             bytes.push(new Uint8Array(element));
           } else {
-            bytes.push(new Uint8Array(element.buffer, element.byteOffset, element.byteLength));
+            bytes.push(
+              new Uint8Array(element.buffer, element.byteOffset, element.byteLength)
+            );
           }
         } else if (isBlobLike(element)) {
           bytes.push(element);
@@ -6200,9 +4048,9 @@ var require_formdata = __commonJS({
     var { kState } = require_symbols2();
     var { File: UndiciFile, FileLike, isFileLike } = require_file();
     var { webidl } = require_webidl();
-    var { Blob, File: NativeFile } = require("buffer");
+    var { Blob: Blob2, File: NativeFile } = require("buffer");
     var File = NativeFile ?? UndiciFile;
-    var FormData = class {
+    var FormData = class _FormData {
       constructor(form) {
         if (form !== void 0) {
           throw webidl.errors.conversionFailed({
@@ -6214,10 +4062,12 @@ var require_formdata = __commonJS({
         this[kState] = [];
       }
       append(name, value, filename = void 0) {
-        webidl.brandCheck(this, FormData);
+        webidl.brandCheck(this, _FormData);
         webidl.argumentLengthCheck(arguments, 2, { header: "FormData.append" });
         if (arguments.length === 3 && !isBlobLike(value)) {
-          throw new TypeError("Failed to execute 'append' on 'FormData': parameter 2 is not of type 'Blob'");
+          throw new TypeError(
+            "Failed to execute 'append' on 'FormData': parameter 2 is not of type 'Blob'"
+          );
         }
         name = webidl.converters.USVString(name);
         value = isBlobLike(value) ? webidl.converters.Blob(value, { strict: false }) : webidl.converters.USVString(value);
@@ -6226,13 +4076,13 @@ var require_formdata = __commonJS({
         this[kState].push(entry);
       }
       delete(name) {
-        webidl.brandCheck(this, FormData);
+        webidl.brandCheck(this, _FormData);
         webidl.argumentLengthCheck(arguments, 1, { header: "FormData.delete" });
         name = webidl.converters.USVString(name);
         this[kState] = this[kState].filter((entry) => entry.name !== name);
       }
       get(name) {
-        webidl.brandCheck(this, FormData);
+        webidl.brandCheck(this, _FormData);
         webidl.argumentLengthCheck(arguments, 1, { header: "FormData.get" });
         name = webidl.converters.USVString(name);
         const idx = this[kState].findIndex((entry) => entry.name === name);
@@ -6242,22 +4092,24 @@ var require_formdata = __commonJS({
         return this[kState][idx].value;
       }
       getAll(name) {
-        webidl.brandCheck(this, FormData);
+        webidl.brandCheck(this, _FormData);
         webidl.argumentLengthCheck(arguments, 1, { header: "FormData.getAll" });
         name = webidl.converters.USVString(name);
         return this[kState].filter((entry) => entry.name === name).map((entry) => entry.value);
       }
       has(name) {
-        webidl.brandCheck(this, FormData);
+        webidl.brandCheck(this, _FormData);
         webidl.argumentLengthCheck(arguments, 1, { header: "FormData.has" });
         name = webidl.converters.USVString(name);
         return this[kState].findIndex((entry) => entry.name === name) !== -1;
       }
       set(name, value, filename = void 0) {
-        webidl.brandCheck(this, FormData);
+        webidl.brandCheck(this, _FormData);
         webidl.argumentLengthCheck(arguments, 2, { header: "FormData.set" });
         if (arguments.length === 3 && !isBlobLike(value)) {
-          throw new TypeError("Failed to execute 'set' on 'FormData': parameter 2 is not of type 'Blob'");
+          throw new TypeError(
+            "Failed to execute 'set' on 'FormData': parameter 2 is not of type 'Blob'"
+          );
         }
         name = webidl.converters.USVString(name);
         value = isBlobLike(value) ? webidl.converters.Blob(value, { strict: false }) : webidl.converters.USVString(value);
@@ -6275,22 +4127,40 @@ var require_formdata = __commonJS({
         }
       }
       entries() {
-        webidl.brandCheck(this, FormData);
-        return makeIterator(() => this[kState].map((pair) => [pair.name, pair.value]), "FormData", "key+value");
+        webidl.brandCheck(this, _FormData);
+        return makeIterator(
+          () => this[kState].map((pair) => [pair.name, pair.value]),
+          "FormData",
+          "key+value"
+        );
       }
       keys() {
-        webidl.brandCheck(this, FormData);
-        return makeIterator(() => this[kState].map((pair) => [pair.name, pair.value]), "FormData", "key");
+        webidl.brandCheck(this, _FormData);
+        return makeIterator(
+          () => this[kState].map((pair) => [pair.name, pair.value]),
+          "FormData",
+          "key"
+        );
       }
       values() {
-        webidl.brandCheck(this, FormData);
-        return makeIterator(() => this[kState].map((pair) => [pair.name, pair.value]), "FormData", "value");
-      }
+        webidl.brandCheck(this, _FormData);
+        return makeIterator(
+          () => this[kState].map((pair) => [pair.name, pair.value]),
+          "FormData",
+          "value"
+        );
+      }
+      /**
+       * @param {(value: string, key: string, self: FormData) => void} callbackFn
+       * @param {unknown} thisArg
+       */
       forEach(callbackFn, thisArg = globalThis) {
-        webidl.brandCheck(this, FormData);
+        webidl.brandCheck(this, _FormData);
         webidl.argumentLengthCheck(arguments, 1, { header: "FormData.forEach" });
         if (typeof callbackFn !== "function") {
-          throw new TypeError("Failed to execute 'forEach' on 'FormData': parameter 1 is not of type 'Function'.");
+          throw new TypeError(
+            "Failed to execute 'forEach' on 'FormData': parameter 1 is not of type 'Function'."
+          );
         }
         for (const [key, value] of this) {
           callbackFn.apply(thisArg, [value, key, this]);
@@ -6310,7 +4180,7 @@ var require_formdata = __commonJS({
         value = Buffer.from(value).toString("utf8");
       } else {
         if (!isFileLike(value)) {
-          value = value instanceof Blob ? new File([value], "blob", { type: value.type }) : new FileLike(value, "blob", { type: value.type });
+          value = value instanceof Blob2 ? new File([value], "blob", { type: value.type }) : new FileLike(value, "blob", { type: value.type });
         }
         if (filename !== void 0) {
           const options = {
@@ -6330,7 +4200,7 @@ var require_formdata = __commonJS({
 var require_body = __commonJS({
   "lib/fetch/body.js"(exports2, module2) {
     "use strict";
-    var Busboy = require_lib();
+    var Busboy = require_main();
     var util = require_util();
     var {
       ReadableStreamFrom,
@@ -6344,7 +4214,7 @@ var require_body = __commonJS({
     var { kState } = require_symbols2();
     var { webidl } = require_webidl();
     var { DOMException, structuredClone } = require_constants();
-    var { Blob, File: NativeFile } = require("buffer");
+    var { Blob: Blob2, File: NativeFile } = require("buffer");
     var { kBodyUsed } = require_symbols();
     var assert = require("assert");
     var { isErrored } = require_util();
@@ -6365,7 +4235,9 @@ var require_body = __commonJS({
       } else {
         stream = new ReadableStream({
           async pull(controller) {
-            controller.enqueue(typeof source === "string" ? new TextEncoder().encode(source) : source);
+            controller.enqueue(
+              typeof source === "string" ? new TextEncoder().encode(source) : source
+            );
             queueMicrotask(() => readableStreamClose(controller));
           },
           start() {
@@ -6448,7 +4320,9 @@ Content-Type: ${value.type || "application/octet-stream"}\r
           throw new TypeError("keepalive");
         }
         if (util.isDisturbed(object) || object.locked) {
-          throw new TypeError("Response body object should not be disturbed or locked");
+          throw new TypeError(
+            "Response body object should not be disturbed or locked"
+          );
         }
         stream = object instanceof ReadableStream ? object : ReadableStreamFrom(object);
       }
@@ -6536,7 +4410,7 @@ Content-Type: ${value.type || "application/octet-stream"}\r
             } else if (mimeType) {
               mimeType = serializeAMimeType(mimeType);
             }
-            return new Blob([bytes], { type: mimeType });
+            return new Blob2([bytes], { type: mimeType });
           }, instance);
         },
         arrayBuffer() {
@@ -6561,9 +4435,9 @@ Content-Type: ${value.type || "application/octet-stream"}\r
             const responseFormData = new FormData();
             let busboy;
             try {
-              busboy = Busboy({
+              busboy = new Busboy({
                 headers,
-                defParamCharset: "utf8"
+                preservePath: true
               });
             } catch (err) {
               throw new DOMException(`${err}`, "AbortError");
@@ -6571,8 +4445,7 @@ Content-Type: ${value.type || "application/octet-stream"}\r
             busboy.on("field", (name, value) => {
               responseFormData.append(name, value);
             });
-            busboy.on("file", (name, value, info) => {
-              const { filename, encoding, mimeType } = info;
+            busboy.on("file", (name, value, filename, encoding, mimeType) => {
               const chunks = [];
               if (encoding === "base64" || encoding.toLowerCase() === "base64") {
                 let base64chunk = "";
@@ -6660,7 +4533,7 @@ Content-Type: ${value.type || "application/octet-stream"}\r
         successSteps(new Uint8Array());
         return promise.promise;
       }
-      fullyReadBody(object[kState].body, successSteps, errorSteps);
+      await fullyReadBody(object[kState].body, successSteps, errorSteps);
       return promise.promise;
     }
     function bodyUnusable(body) {
@@ -6727,10 +4600,11 @@ var require_response = __commonJS({
     var assert = require("assert");
     var { types } = require("util");
     var ReadableStream = globalThis.ReadableStream || require("stream/web").ReadableStream;
-    var Response = class {
+    var Response = class _Response {
+      // Creates network error Response.
       static error() {
         const relevantRealm = { settingsObject: {} };
-        const responseObject = new Response();
+        const responseObject = new _Response();
         responseObject[kState] = makeNetworkError();
         responseObject[kRealm] = relevantRealm;
         responseObject[kHeaders][kHeadersList] = responseObject[kState].headersList;
@@ -6738,21 +4612,25 @@ var require_response = __commonJS({
         responseObject[kHeaders][kRealm] = relevantRealm;
         return responseObject;
       }
-      static json(data = void 0, init = {}) {
+      // https://fetch.spec.whatwg.org/#dom-response-json
+      static json(data, init = {}) {
         webidl.argumentLengthCheck(arguments, 1, { header: "Response.json" });
         if (init !== null) {
           init = webidl.converters.ResponseInit(init);
         }
-        const bytes = new TextEncoder("utf-8").encode(serializeJavascriptValueToJSONString(data));
+        const bytes = new TextEncoder("utf-8").encode(
+          serializeJavascriptValueToJSONString(data)
+        );
         const body = extractBody(bytes);
         const relevantRealm = { settingsObject: {} };
-        const responseObject = new Response();
+        const responseObject = new _Response();
         responseObject[kRealm] = relevantRealm;
         responseObject[kHeaders][kGuard] = "response";
         responseObject[kHeaders][kRealm] = relevantRealm;
         initializeResponse(responseObject, init, { body: body[0], type: "application/json" });
         return responseObject;
       }
+      // Creates a redirect Response that redirects to url with status status.
       static redirect(url, status = 302) {
         const relevantRealm = { settingsObject: {} };
         webidl.argumentLengthCheck(arguments, 1, { header: "Response.redirect" });
@@ -6769,7 +4647,7 @@ var require_response = __commonJS({
         if (!redirectStatus.includes(status)) {
           throw new RangeError("Invalid status code " + status);
         }
-        const responseObject = new Response();
+        const responseObject = new _Response();
         responseObject[kRealm] = relevantRealm;
         responseObject[kHeaders][kGuard] = "immutable";
         responseObject[kHeaders][kRealm] = relevantRealm;
@@ -6778,6 +4656,7 @@ var require_response = __commonJS({
         responseObject[kState].headersList.append("location", value);
         return responseObject;
       }
+      // https://fetch.spec.whatwg.org/#dom-response
       constructor(body = null, init = {}) {
         if (body !== null) {
           body = webidl.converters.BodyInit(body);
@@ -6796,12 +4675,14 @@ var require_response = __commonJS({
         }
         initializeResponse(this, init, bodyWithType);
       }
+      // Returns response’s type, e.g., "cors".
       get type() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         return this[kState].type;
       }
+      // Returns response’s URL, if it has one; otherwise the empty string.
       get url() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         const urlList = this[kState].urlList;
         const url = urlList[urlList.length - 1] ?? null;
         if (url === null) {
@@ -6809,36 +4690,42 @@ var require_response = __commonJS({
         }
         return URLSerializer(url, true);
       }
+      // Returns whether response was obtained through a redirect.
       get redirected() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         return this[kState].urlList.length > 1;
       }
+      // Returns response’s status.
       get status() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         return this[kState].status;
       }
+      // Returns whether response’s status is an ok status.
       get ok() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         return this[kState].status >= 200 && this[kState].status <= 299;
       }
+      // Returns response’s status message.
       get statusText() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         return this[kState].statusText;
       }
+      // Returns response’s headers as Headers.
       get headers() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         return this[kHeaders];
       }
       get body() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         return this[kState].body ? this[kState].body.stream : null;
       }
       get bodyUsed() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         return !!this[kState].body && util.isDisturbed(this[kState].body.stream);
       }
+      // Returns a clone of response.
       clone() {
-        webidl.brandCheck(this, Response);
+        webidl.brandCheck(this, _Response);
         if (this.bodyUsed || this.body && this.body.locked) {
           throw webidl.errors.exception({
             header: "Response.clone",
@@ -6846,7 +4733,7 @@ var require_response = __commonJS({
           });
         }
         const clonedResponse = cloneResponse(this[kState]);
-        const clonedResponseObject = new Response();
+        const clonedResponseObject = new _Response();
         clonedResponseObject[kState] = clonedResponse;
         clonedResponseObject[kRealm] = this[kRealm];
         clonedResponseObject[kHeaders][kHeadersList] = clonedResponse.headersList;
@@ -6879,7 +4766,10 @@ var require_response = __commonJS({
     });
     function cloneResponse(response) {
       if (response.internalResponse) {
-        return filterResponse(cloneResponse(response.internalResponse), response.type);
+        return filterResponse(
+          cloneResponse(response.internalResponse),
+          response.type
+        );
       }
       const newResponse = makeResponse({ ...response, body: null });
       if (response.body != null) {
@@ -6959,9 +4849,9 @@ var require_response = __commonJS({
         assert(false);
       }
     }
-    function makeAppropriateNetworkError(fetchParams) {
+    function makeAppropriateNetworkError(fetchParams, err = null) {
       assert(isCancelled(fetchParams));
-      return isAborted(fetchParams) ? makeNetworkError(new DOMException("The operation was aborted.", "AbortError")) : makeNetworkError("Request was cancelled.");
+      return isAborted(fetchParams) ? makeNetworkError(Object.assign(new DOMException("The operation was aborted.", "AbortError"), { cause: err })) : makeNetworkError(Object.assign(new DOMException("Request was cancelled."), { cause: err }));
     }
     function initializeResponse(response, init, body) {
       if (init.status !== null && (init.status < 200 || init.status > 599)) {
@@ -6994,9 +4884,15 @@ var require_response = __commonJS({
         }
       }
     }
-    webidl.converters.ReadableStream = webidl.interfaceConverter(ReadableStream);
-    webidl.converters.FormData = webidl.interfaceConverter(FormData);
-    webidl.converters.URLSearchParams = webidl.interfaceConverter(URLSearchParams);
+    webidl.converters.ReadableStream = webidl.interfaceConverter(
+      ReadableStream
+    );
+    webidl.converters.FormData = webidl.interfaceConverter(
+      FormData
+    );
+    webidl.converters.URLSearchParams = webidl.interfaceConverter(
+      URLSearchParams
+    );
     webidl.converters.XMLHttpRequestBodyInit = function(V) {
       if (typeof V === "string") {
         return webidl.converters.USVString(V);
@@ -7069,14 +4965,22 @@ var require_dispatcher_weakref = __commonJS({
         this.finalizer = finalizer;
       }
       register(dispatcher, key) {
-        dispatcher.on("disconnect", () => {
-          if (dispatcher[kConnected] === 0 && dispatcher[kSize] === 0) {
-            this.finalizer(key);
-          }
-        });
+        if (dispatcher.on) {
+          dispatcher.on("disconnect", () => {
+            if (dispatcher[kConnected] === 0 && dispatcher[kSize] === 0) {
+              this.finalizer(key);
+            }
+          });
+        }
       }
     };
     module2.exports = function() {
+      if (process.env.NODE_V8_COVERAGE) {
+        return {
+          WeakRef: CompatWeakRef,
+          FinalizationRegistry: CompatFinalizer
+        };
+      }
       return {
         WeakRef: global.WeakRef || CompatWeakRef,
         FinalizationRegistry: global.FinalizationRegistry || CompatFinalizer
@@ -7123,7 +5027,8 @@ var require_request = __commonJS({
     var requestFinalizer = new FinalizationRegistry(({ signal, abort }) => {
       signal.removeEventListener("abort", abort);
     });
-    var Request = class {
+    var Request = class _Request {
+      // https://fetch.spec.whatwg.org/#dom-request
       constructor(input, init = {}) {
         if (input === kInit) {
           return;
@@ -7152,12 +5057,14 @@ var require_request = __commonJS({
             throw new TypeError("Failed to parse URL from " + input, { cause: err });
           }
           if (parsedURL.username || parsedURL.password) {
-            throw new TypeError("Request cannot be constructed from a URL that includes credentials: " + input);
+            throw new TypeError(
+              "Request cannot be constructed from a URL that includes credentials: " + input
+            );
           }
           request = makeRequest({ urlList: [parsedURL] });
           fallbackMode = "cors";
         } else {
-          assert(input instanceof Request);
+          assert(input instanceof _Request);
           request = input[kState];
           signal = input[kSignal];
         }
@@ -7173,23 +5080,46 @@ var require_request = __commonJS({
           window = "no-window";
         }
         request = makeRequest({
+          // URL request’s URL.
+          // undici implementation note: this is set as the first item in request's urlList in makeRequest
+          // method request’s method.
           method: request.method,
+          // header list A copy of request’s header list.
+          // undici implementation note: headersList is cloned in makeRequest
           headersList: request.headersList,
+          // unsafe-request flag Set.
           unsafeRequest: request.unsafeRequest,
+          // client This’s relevant settings object.
           client: this[kRealm].settingsObject,
+          // window window.
           window,
+          // priority request’s priority.
           priority: request.priority,
+          // origin request’s origin. The propagation of the origin is only significant for navigation requests
+          // being handled by a service worker. In this scenario a request can have an origin that is different
+          // from the current client.
           origin: request.origin,
+          // referrer request’s referrer.
           referrer: request.referrer,
+          // referrer policy request’s referrer policy.
           referrerPolicy: request.referrerPolicy,
+          // mode request’s mode.
           mode: request.mode,
+          // credentials mode request’s credentials mode.
           credentials: request.credentials,
+          // cache mode request’s cache mode.
           cache: request.cache,
+          // redirect mode request’s redirect mode.
           redirect: request.redirect,
+          // integrity metadata request’s integrity metadata.
           integrity: request.integrity,
+          // keepalive request’s keepalive.
           keepalive: request.keepalive,
+          // reload-navigation flag request’s reload-navigation flag.
           reloadNavigation: request.reloadNavigation,
+          // history-navigation flag request’s history-navigation flag.
           historyNavigation: request.historyNavigation,
+          // URL list A clone of request’s URL list.
           urlList: [...request.urlList]
         });
         if (Object.keys(init).length > 0) {
@@ -7247,7 +5177,9 @@ var require_request = __commonJS({
           request.cache = init.cache;
         }
         if (request.cache === "only-if-cached" && request.mode !== "same-origin") {
-          throw new TypeError("'only-if-cached' can be set only with 'same-origin' mode");
+          throw new TypeError(
+            "'only-if-cached' can be set only with 'same-origin' mode"
+          );
         }
         if (init.redirect !== void 0) {
           request.redirect = init.redirect;
@@ -7278,7 +5210,9 @@ var require_request = __commonJS({
         this[kSignal][kRealm] = this[kRealm];
         if (signal != null) {
           if (!signal || typeof signal.aborted !== "boolean" || typeof signal.addEventListener !== "function") {
-            throw new TypeError("Failed to construct 'Request': member signal is not of type AbortSignal.");
+            throw new TypeError(
+              "Failed to construct 'Request': member signal is not of type AbortSignal."
+            );
           }
           if (signal.aborted) {
             ac.abort(signal.reason);
@@ -7309,7 +5243,9 @@ var require_request = __commonJS({
         this[kHeaders][kRealm] = this[kRealm];
         if (mode === "no-cors") {
           if (!corsSafeListedMethods.includes(request.method)) {
-            throw new TypeError(`'${request.method} is unsupported in no-cors mode.`);
+            throw new TypeError(
+              `'${request.method} is unsupported in no-cors mode.`
+            );
           }
           this[kHeaders][kGuard] = "request-no-cors";
         }
@@ -7327,13 +5263,16 @@ var require_request = __commonJS({
             fillHeaders(this[kHeaders], headers);
           }
         }
-        const inputBody = input instanceof Request ? input[kState].body : null;
+        const inputBody = input instanceof _Request ? input[kState].body : null;
         if ((init.body != null || inputBody != null) && (request.method === "GET" || request.method === "HEAD")) {
           throw new TypeError("Request with GET/HEAD method cannot have body.");
         }
         let initBody = null;
         if (init.body != null) {
-          const [extractedBody, contentType] = extractBody(init.body, request.keepalive);
+          const [extractedBody, contentType] = extractBody(
+            init.body,
+            request.keepalive
+          );
           initBody = extractedBody;
           if (contentType && !this[kHeaders][kHeadersList].contains("content-type")) {
             this[kHeaders].append("content-type", contentType);
@@ -7345,14 +5284,18 @@ var require_request = __commonJS({
             throw new TypeError("RequestInit: duplex option is required when sending a body.");
           }
           if (request.mode !== "same-origin" && request.mode !== "cors") {
-            throw new TypeError('If request is made from ReadableStream, mode should be "same-origin" or "cors"');
+            throw new TypeError(
+              'If request is made from ReadableStream, mode should be "same-origin" or "cors"'
+            );
           }
           request.useCORSPreflightFlag = true;
         }
         let finalBody = inputOrInitBody;
         if (initBody == null && inputBody != null) {
           if (util.isDisturbed(inputBody.stream) || inputBody.stream.locked) {
-            throw new TypeError("Cannot construct a Request with a Request object that has already been used.");
+            throw new TypeError(
+              "Cannot construct a Request with a Request object that has already been used."
+            );
           }
           if (!TransformStream) {
             TransformStream = require("stream/web").TransformStream;
@@ -7367,24 +5310,36 @@ var require_request = __commonJS({
         }
         this[kState].body = finalBody;
       }
+      // Returns request’s HTTP method, which is "GET" by default.
       get method() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].method;
       }
+      // Returns the URL of request as a string.
       get url() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return URLSerializer(this[kState].url);
       }
+      // Returns a Headers object consisting of the headers associated with request.
+      // Note that headers added in the network layer by the user agent will not
+      // be accounted for in this object, e.g., the "Host" header.
       get headers() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kHeaders];
       }
+      // Returns the kind of resource requested by request, e.g., "document"
+      // or "script".
       get destination() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].destination;
       }
+      // Returns the referrer of request. Its value can be a same-origin URL if
+      // explicitly set in init, the empty string to indicate no referrer, and
+      // "about:client" when defaulting to the global’s default. This is used
+      // during fetching to determine the value of the `Referer` header of the
+      // request being made.
       get referrer() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         if (this[kState].referrer === "no-referrer") {
           return "";
         }
@@ -7393,64 +5348,93 @@ var require_request = __commonJS({
         }
         return this[kState].referrer.toString();
       }
+      // Returns the referrer policy associated with request.
+      // This is used during fetching to compute the value of the request’s
+      // referrer.
       get referrerPolicy() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].referrerPolicy;
       }
+      // Returns the mode associated with request, which is a string indicating
+      // whether the request will use CORS, or will be restricted to same-origin
+      // URLs.
       get mode() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].mode;
       }
+      // Returns the credentials mode associated with request,
+      // which is a string indicating whether credentials will be sent with the
+      // request always, never, or only when sent to a same-origin URL.
       get credentials() {
         return this[kState].credentials;
       }
+      // Returns the cache mode associated with request,
+      // which is a string indicating how the request will
+      // interact with the browser’s cache when fetching.
       get cache() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].cache;
       }
+      // Returns the redirect mode associated with request,
+      // which is a string indicating how redirects for the
+      // request will be handled during fetching. A request
+      // will follow redirects by default.
       get redirect() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].redirect;
       }
+      // Returns request’s subresource integrity metadata, which is a
+      // cryptographic hash of the resource being fetched. Its value
+      // consists of multiple hashes separated by whitespace. [SRI]
       get integrity() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].integrity;
       }
+      // Returns a boolean indicating whether or not request can outlive the
+      // global in which it was created.
       get keepalive() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].keepalive;
       }
+      // Returns a boolean indicating whether or not request is for a reload
+      // navigation.
       get isReloadNavigation() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].reloadNavigation;
       }
+      // Returns a boolean indicating whether or not request is for a history
+      // navigation (a.k.a. back-foward navigation).
       get isHistoryNavigation() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].historyNavigation;
       }
+      // Returns the signal associated with request, which is an AbortSignal
+      // object indicating whether or not request has been aborted, and its
+      // abort event handler.
       get signal() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kSignal];
       }
       get body() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return this[kState].body ? this[kState].body.stream : null;
       }
       get bodyUsed() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return !!this[kState].body && util.isDisturbed(this[kState].body.stream);
       }
       get duplex() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         return "half";
       }
+      // Returns a clone of request.
       clone() {
-        webidl.brandCheck(this, Request);
+        webidl.brandCheck(this, _Request);
         if (this.bodyUsed || this.body?.locked) {
           throw new TypeError("unusable");
         }
         const clonedRequest = cloneRequest(this[kState]);
-        const clonedRequestObject = new Request(kInit);
+        const clonedRequestObject = new _Request(kInit);
         clonedRequestObject[kState] = clonedRequest;
         clonedRequestObject[kRealm] = this[kRealm];
         clonedRequestObject[kHeaders] = new Headers();
@@ -7461,9 +5445,12 @@ var require_request = __commonJS({
         if (this.signal.aborted) {
           ac.abort(this.signal.reason);
         } else {
-          util.addAbortListener(this.signal, () => {
-            ac.abort(this.signal.reason);
-          });
+          util.addAbortListener(
+            this.signal,
+            () => {
+              ac.abort(this.signal.reason);
+            }
+          );
         }
         clonedRequestObject[kSignal] = ac.signal;
         return clonedRequestObject;
@@ -7546,7 +5533,9 @@ var require_request = __commonJS({
         configurable: true
       }
     });
-    webidl.converters.Request = webidl.interfaceConverter(Request);
+    webidl.converters.Request = webidl.interfaceConverter(
+      Request
+    );
     webidl.converters.RequestInfo = function(V) {
       if (typeof V === "string") {
         return webidl.converters.USVString(V);
@@ -7556,7 +5545,9 @@ var require_request = __commonJS({
       }
       return webidl.converters.USVString(V);
     };
-    webidl.converters.AbortSignal = webidl.interfaceConverter(AbortSignal);
+    webidl.converters.AbortSignal = webidl.interfaceConverter(
+      AbortSignal
+    );
     webidl.converters.RequestInit = webidl.dictionaryConverter([
       {
         key: "method",
@@ -7568,7 +5559,9 @@ var require_request = __commonJS({
       },
       {
         key: "body",
-        converter: webidl.nullableConverter(webidl.converters.BodyInit)
+        converter: webidl.nullableConverter(
+          webidl.converters.BodyInit
+        )
       },
       {
         key: "referrer",
@@ -7577,26 +5570,31 @@ var require_request = __commonJS({
       {
         key: "referrerPolicy",
         converter: webidl.converters.DOMString,
+        // https://w3c.github.io/webappsec-referrer-policy/#referrer-policy
         allowedValues: referrerPolicy
       },
       {
         key: "mode",
         converter: webidl.converters.DOMString,
+        // https://fetch.spec.whatwg.org/#concept-request-mode
         allowedValues: requestMode
       },
       {
         key: "credentials",
         converter: webidl.converters.DOMString,
+        // https://fetch.spec.whatwg.org/#requestcredentials
         allowedValues: requestCredentials
       },
       {
         key: "cache",
         converter: webidl.converters.DOMString,
+        // https://fetch.spec.whatwg.org/#requestcache
         allowedValues: requestCache
       },
       {
         key: "redirect",
         converter: webidl.converters.DOMString,
+        // https://fetch.spec.whatwg.org/#requestredirect
         allowedValues: requestRedirect
       },
       {
@@ -7609,7 +5607,12 @@ var require_request = __commonJS({
       },
       {
         key: "signal",
-        converter: webidl.nullableConverter((signal) => webidl.converters.AbortSignal(signal, { strict: false }))
+        converter: webidl.nullableConverter(
+          (signal) => webidl.converters.AbortSignal(
+            signal,
+            { strict: false }
+          )
+        )
       },
       {
         key: "window",
@@ -7733,7 +5736,10 @@ var require_dispatcher_base = __commonJS({
         if (callback === void 0) {
           return new Promise((resolve, reject) => {
             this.destroy(err, (err2, data) => {
-              return err2 ? reject(err2) : resolve(data);
+              return err2 ? (
+                /* istanbul ignore next: should never error */
+                reject(err2)
+              ) : resolve(data);
             });
           });
         }
@@ -8140,6 +6146,7 @@ var require_request2 = __commonJS({
       NotSupportedError
     } = require_errors();
     var assert = require("assert");
+    var { kHTTP2BuildRequest, kHTTP2CopyHeaders, kHTTP1BuildRequest } = require_symbols();
     var util = require_util();
     var tokenRegExp = /^[\^_`a-zA-Z\-0-9!#$%&'*+.|~]+$/;
     var headerCharRegex = /[^\t\x20-\x7e\x80-\xff]/;
@@ -8161,7 +6168,7 @@ var require_request2 = __commonJS({
       channels.trailers = { hasSubscribers: false };
       channels.error = { hasSubscribers: false };
     }
-    var Request = class {
+    var Request = class _Request {
       constructor(origin, {
         path,
         method,
@@ -8174,7 +6181,8 @@ var require_request2 = __commonJS({
         headersTimeout,
         bodyTimeout,
         reset,
-        throwOnError
+        throwOnError,
+        expectContinue
       }, handler) {
         if (typeof path !== "string") {
           throw new InvalidArgumentError("path must be a string");
@@ -8200,6 +6208,9 @@ var require_request2 = __commonJS({
         if (reset != null && typeof reset !== "boolean") {
           throw new InvalidArgumentError("invalid reset");
         }
+        if (expectContinue != null && typeof expectContinue !== "boolean") {
+          throw new InvalidArgumentError("invalid expectContinue");
+        }
         this.headersTimeout = headersTimeout;
         this.bodyTimeout = bodyTimeout;
         this.throwOnError = throwOnError === true;
@@ -8233,6 +6244,7 @@ var require_request2 = __commonJS({
         this.contentLength = null;
         this.contentType = null;
         this.headers = "";
+        this.expectContinue = expectContinue != null ? expectContinue : false;
         if (Array.isArray(headers)) {
           if (headers.length % 2 !== 0) {
             throw new InvalidArgumentError("headers array must be even");
@@ -8331,12 +6343,53 @@ var require_request2 = __commonJS({
         this.aborted = true;
         return this[kHandler].onError(error);
       }
+      // TODO: adjust to support H2
       addHeader(key, value) {
         processHeader(this, key, value);
         return this;
       }
+      static [kHTTP1BuildRequest](origin, opts, handler) {
+        return new _Request(origin, opts, handler);
+      }
+      static [kHTTP2BuildRequest](origin, opts, handler) {
+        const headers = opts.headers;
+        opts = { ...opts, headers: null };
+        const request = new _Request(origin, opts, handler);
+        request.headers = {};
+        if (Array.isArray(headers)) {
+          if (headers.length % 2 !== 0) {
+            throw new InvalidArgumentError("headers array must be even");
+          }
+          for (let i = 0; i < headers.length; i += 2) {
+            processHeader(request, headers[i], headers[i + 1], true);
+          }
+        } else if (headers && typeof headers === "object") {
+          const keys = Object.keys(headers);
+          for (let i = 0; i < keys.length; i++) {
+            const key = keys[i];
+            processHeader(request, key, headers[key], true);
+          }
+        } else if (headers != null) {
+          throw new InvalidArgumentError("headers must be an object or an array");
+        }
+        return request;
+      }
+      static [kHTTP2CopyHeaders](raw) {
+        const rawHeaders = raw.split("\r\n");
+        const headers = {};
+        for (const header of rawHeaders) {
+          const [key, value] = header.split(": ");
+          if (value == null || value.length === 0)
+            continue;
+          if (headers[key])
+            headers[key] += `,${value}`;
+          else
+            headers[key] = value;
+        }
+        return headers;
+      }
     };
-    function processHeaderValue(key, val) {
+    function processHeaderValue(key, val, skipAppend) {
       if (val && typeof val === "object") {
         throw new InvalidArgumentError(`invalid ${key} header`);
       }
@@ -8344,10 +6397,10 @@ var require_request2 = __commonJS({
       if (headerCharRegex.exec(val) !== null) {
         throw new InvalidArgumentError(`invalid ${key} header`);
       }
-      return `${key}: ${val}\r
+      return skipAppend ? val : `${key}: ${val}\r
 `;
     }
-    function processHeader(request, key, val) {
+    function processHeader(request, key, val, skipAppend = false) {
       if (val && (typeof val === "object" && !Array.isArray(val))) {
         throw new InvalidArgumentError(`invalid ${key} header`);
       } else if (val === void 0) {
@@ -8365,7 +6418,10 @@ var require_request2 = __commonJS({
         }
       } else if (request.contentType === null && key.length === 12 && key.toLowerCase() === "content-type") {
         request.contentType = val;
-        request.headers += processHeaderValue(key, val);
+        if (skipAppend)
+          request.headers[key] = processHeaderValue(key, val, skipAppend);
+        else
+          request.headers += processHeaderValue(key, val);
       } else if (key.length === 17 && key.toLowerCase() === "transfer-encoding") {
         throw new InvalidArgumentError("invalid transfer-encoding header");
       } else if (key.length === 10 && key.toLowerCase() === "connection") {
@@ -8386,10 +6442,20 @@ var require_request2 = __commonJS({
       } else {
         if (Array.isArray(val)) {
           for (let i = 0; i < val.length; i++) {
-            request.headers += processHeaderValue(key, val[i]);
+            if (skipAppend) {
+              if (request.headers[key])
+                request.headers[key] += `,${processHeaderValue(key, val[i], skipAppend)}`;
+              else
+                request.headers[key] = processHeaderValue(key, val[i], skipAppend);
+            } else {
+              request.headers += processHeaderValue(key, val[i]);
+            }
           }
         } else {
-          request.headers += processHeaderValue(key, val);
+          if (skipAppend)
+            request.headers[key] = processHeaderValue(key, val, skipAppend);
+          else
+            request.headers += processHeaderValue(key, val);
         }
       }
     }
@@ -8407,7 +6473,7 @@ var require_connect = __commonJS({
     var { InvalidArgumentError, ConnectTimeoutError } = require_errors();
     var tls;
     var SessionCache;
-    if (global.FinalizationRegistry) {
+    if (global.FinalizationRegistry && !process.env.NODE_V8_COVERAGE) {
       SessionCache = class WeakSessionCache {
         constructor(maxCachedSessions) {
           this._maxCachedSessions = maxCachedSessions;
@@ -8455,13 +6521,14 @@ var require_connect = __commonJS({
         }
       };
     }
-    function buildConnector({ maxCachedSessions, socketPath, timeout, ...opts }) {
+    function buildConnector({ allowH2, maxCachedSessions, socketPath, timeout, ...opts }) {
       if (maxCachedSessions != null && (!Number.isInteger(maxCachedSessions) || maxCachedSessions < 0)) {
         throw new InvalidArgumentError("maxCachedSessions must be a positive integer or zero");
       }
       const options = { path: socketPath, ...opts };
       const sessionCache = new SessionCache(maxCachedSessions == null ? 100 : maxCachedSessions);
       timeout = timeout == null ? 1e4 : timeout;
+      allowH2 = allowH2 != null ? allowH2 : false;
       return function connect({ hostname, host, protocol, port, servername, localAddress, httpSocket }, callback) {
         let socket;
         if (protocol === "https:") {
@@ -8474,11 +6541,15 @@ var require_connect = __commonJS({
           assert(sessionKey);
           socket = tls.connect({
             highWaterMark: 16384,
+            // TLS in node can't have bigger HWM anyway...
             ...options,
             servername,
             session,
             localAddress,
+            // TODO(HTTP/2): Add support for h2c
+            ALPNProtocols: allowH2 ? ["http/1.1", "h2"] : ["http/1.1"],
             socket: httpSocket,
+            // upgrade socket connection
             port: port || 443,
             host: hostname
           });
@@ -8489,6 +6560,7 @@ var require_connect = __commonJS({
           assert(!httpSocket, "httpSocket can only be sent on TLS update");
           socket = net.connect({
             highWaterMark: 64 * 1024,
+            // Same as nodejs fs streams.
             ...options,
             localAddress,
             port: port || 80,
@@ -8548,7 +6620,7 @@ var require_connect = __commonJS({
 });
 
 // lib/llhttp/utils.js
-var require_utils2 = __commonJS({
+var require_utils = __commonJS({
   "lib/llhttp/utils.js"(exports2) {
     "use strict";
     Object.defineProperty(exports2, "__esModule", { value: true });
@@ -8573,7 +6645,7 @@ var require_constants2 = __commonJS({
     "use strict";
     Object.defineProperty(exports2, "__esModule", { value: true });
     exports2.SPECIAL_HEADERS = exports2.HEADER_STATE = exports2.MINOR = exports2.MAJOR = exports2.CONNECTION_TOKEN_CHARS = exports2.HEADER_CHARS = exports2.TOKEN = exports2.STRICT_TOKEN = exports2.HEX = exports2.URL_CHAR = exports2.STRICT_URL_CHAR = exports2.USERINFO_CHARS = exports2.MARK = exports2.ALPHANUM = exports2.NUM = exports2.HEX_MAP = exports2.NUM_MAP = exports2.ALPHA = exports2.FINISH = exports2.H_METHOD_MAP = exports2.METHOD_MAP = exports2.METHODS_RTSP = exports2.METHODS_ICE = exports2.METHODS_HTTP = exports2.METHODS = exports2.LENIENT_FLAGS = exports2.FLAGS = exports2.TYPE = exports2.ERROR = void 0;
-    var utils_1 = require_utils2();
+    var utils_1 = require_utils();
     var ERROR;
     (function(ERROR2) {
       ERROR2[ERROR2["OK"] = 0] = "OK";
@@ -8710,6 +6782,7 @@ var require_constants2 = __commonJS({
       METHODS.LINK,
       METHODS.UNLINK,
       METHODS.PRI,
+      // TODO(indutny): should we allow it with HTTP?
       METHODS.SOURCE
     ];
     exports2.METHODS_ICE = [
@@ -8728,6 +6801,7 @@ var require_constants2 = __commonJS({
       METHODS.REDIRECT,
       METHODS.RECORD,
       METHODS.FLUSH,
+      // For AirPlay
       METHODS.GET,
       METHODS.POST
     ];
@@ -8861,2741 +6935,4439 @@ var require_constants2 = __commonJS({
         exports2.HEADER_CHARS.push(i);
       }
     }
-    exports2.CONNECTION_TOKEN_CHARS = exports2.HEADER_CHARS.filter((c) => c !== 44);
-    exports2.MAJOR = exports2.NUM_MAP;
-    exports2.MINOR = exports2.MAJOR;
-    var HEADER_STATE;
-    (function(HEADER_STATE2) {
-      HEADER_STATE2[HEADER_STATE2["GENERAL"] = 0] = "GENERAL";
-      HEADER_STATE2[HEADER_STATE2["CONNECTION"] = 1] = "CONNECTION";
-      HEADER_STATE2[HEADER_STATE2["CONTENT_LENGTH"] = 2] = "CONTENT_LENGTH";
-      HEADER_STATE2[HEADER_STATE2["TRANSFER_ENCODING"] = 3] = "TRANSFER_ENCODING";
-      HEADER_STATE2[HEADER_STATE2["UPGRADE"] = 4] = "UPGRADE";
-      HEADER_STATE2[HEADER_STATE2["CONNECTION_KEEP_ALIVE"] = 5] = "CONNECTION_KEEP_ALIVE";
-      HEADER_STATE2[HEADER_STATE2["CONNECTION_CLOSE"] = 6] = "CONNECTION_CLOSE";
-      HEADER_STATE2[HEADER_STATE2["CONNECTION_UPGRADE"] = 7] = "CONNECTION_UPGRADE";
-      HEADER_STATE2[HEADER_STATE2["TRANSFER_ENCODING_CHUNKED"] = 8] = "TRANSFER_ENCODING_CHUNKED";
-    })(HEADER_STATE = exports2.HEADER_STATE || (exports2.HEADER_STATE = {}));
-    exports2.SPECIAL_HEADERS = {
-      "connection": HEADER_STATE.CONNECTION,
-      "content-length": HEADER_STATE.CONTENT_LENGTH,
-      "proxy-connection": HEADER_STATE.CONNECTION,
-      "transfer-encoding": HEADER_STATE.TRANSFER_ENCODING,
-      "upgrade": HEADER_STATE.UPGRADE
-    };
+    exports2.CONNECTION_TOKEN_CHARS = exports2.HEADER_CHARS.filter((c) => c !== 44);
+    exports2.MAJOR = exports2.NUM_MAP;
+    exports2.MINOR = exports2.MAJOR;
+    var HEADER_STATE;
+    (function(HEADER_STATE2) {
+      HEADER_STATE2[HEADER_STATE2["GENERAL"] = 0] = "GENERAL";
+      HEADER_STATE2[HEADER_STATE2["CONNECTION"] = 1] = "CONNECTION";
+      HEADER_STATE2[HEADER_STATE2["CONTENT_LENGTH"] = 2] = "CONTENT_LENGTH";
+      HEADER_STATE2[HEADER_STATE2["TRANSFER_ENCODING"] = 3] = "TRANSFER_ENCODING";
+      HEADER_STATE2[HEADER_STATE2["UPGRADE"] = 4] = "UPGRADE";
+      HEADER_STATE2[HEADER_STATE2["CONNECTION_KEEP_ALIVE"] = 5] = "CONNECTION_KEEP_ALIVE";
+      HEADER_STATE2[HEADER_STATE2["CONNECTION_CLOSE"] = 6] = "CONNECTION_CLOSE";
+      HEADER_STATE2[HEADER_STATE2["CONNECTION_UPGRADE"] = 7] = "CONNECTION_UPGRADE";
+      HEADER_STATE2[HEADER_STATE2["TRANSFER_ENCODING_CHUNKED"] = 8] = "TRANSFER_ENCODING_CHUNKED";
+    })(HEADER_STATE = exports2.HEADER_STATE || (exports2.HEADER_STATE = {}));
+    exports2.SPECIAL_HEADERS = {
+      "connection": HEADER_STATE.CONNECTION,
+      "content-length": HEADER_STATE.CONTENT_LENGTH,
+      "proxy-connection": HEADER_STATE.CONNECTION,
+      "transfer-encoding": HEADER_STATE.TRANSFER_ENCODING,
+      "upgrade": HEADER_STATE.UPGRADE
+    };
+  }
+});
+
+// lib/handler/RedirectHandler.js
+var require_RedirectHandler = __commonJS({
+  "lib/handler/RedirectHandler.js"(exports2, module2) {
+    "use strict";
+    var util = require_util();
+    var { kBodyUsed } = require_symbols();
+    var assert = require("assert");
+    var { InvalidArgumentError } = require_errors();
+    var EE = require("events");
+    var redirectableStatusCodes = [300, 301, 302, 303, 307, 308];
+    var kBody = Symbol("body");
+    var BodyAsyncIterable = class {
+      constructor(body) {
+        this[kBody] = body;
+        this[kBodyUsed] = false;
+      }
+      async *[Symbol.asyncIterator]() {
+        assert(!this[kBodyUsed], "disturbed");
+        this[kBodyUsed] = true;
+        yield* this[kBody];
+      }
+    };
+    var RedirectHandler = class {
+      constructor(dispatch, maxRedirections, opts, handler) {
+        if (maxRedirections != null && (!Number.isInteger(maxRedirections) || maxRedirections < 0)) {
+          throw new InvalidArgumentError("maxRedirections must be a positive number");
+        }
+        util.validateHandler(handler, opts.method, opts.upgrade);
+        this.dispatch = dispatch;
+        this.location = null;
+        this.abort = null;
+        this.opts = { ...opts, maxRedirections: 0 };
+        this.maxRedirections = maxRedirections;
+        this.handler = handler;
+        this.history = [];
+        if (util.isStream(this.opts.body)) {
+          if (util.bodyLength(this.opts.body) === 0) {
+            this.opts.body.on("data", function() {
+              assert(false);
+            });
+          }
+          if (typeof this.opts.body.readableDidRead !== "boolean") {
+            this.opts.body[kBodyUsed] = false;
+            EE.prototype.on.call(this.opts.body, "data", function() {
+              this[kBodyUsed] = true;
+            });
+          }
+        } else if (this.opts.body && typeof this.opts.body.pipeTo === "function") {
+          this.opts.body = new BodyAsyncIterable(this.opts.body);
+        } else if (this.opts.body && typeof this.opts.body !== "string" && !ArrayBuffer.isView(this.opts.body) && util.isIterable(this.opts.body)) {
+          this.opts.body = new BodyAsyncIterable(this.opts.body);
+        }
+      }
+      onConnect(abort) {
+        this.abort = abort;
+        this.handler.onConnect(abort, { history: this.history });
+      }
+      onUpgrade(statusCode, headers, socket) {
+        this.handler.onUpgrade(statusCode, headers, socket);
+      }
+      onError(error) {
+        this.handler.onError(error);
+      }
+      onHeaders(statusCode, headers, resume, statusText) {
+        this.location = this.history.length >= this.maxRedirections || util.isDisturbed(this.opts.body) ? null : parseLocation(statusCode, headers);
+        if (this.opts.origin) {
+          this.history.push(new URL(this.opts.path, this.opts.origin));
+        }
+        if (!this.location) {
+          return this.handler.onHeaders(statusCode, headers, resume, statusText);
+        }
+        const { origin, pathname, search } = util.parseURL(new URL(this.location, this.opts.origin && new URL(this.opts.path, this.opts.origin)));
+        const path = search ? `${pathname}${search}` : pathname;
+        this.opts.headers = cleanRequestHeaders(this.opts.headers, statusCode === 303, this.opts.origin !== origin);
+        this.opts.path = path;
+        this.opts.origin = origin;
+        this.opts.maxRedirections = 0;
+        this.opts.query = null;
+        if (statusCode === 303 && this.opts.method !== "HEAD") {
+          this.opts.method = "GET";
+          this.opts.body = null;
+        }
+      }
+      onData(chunk) {
+        if (this.location) {
+        } else {
+          return this.handler.onData(chunk);
+        }
+      }
+      onComplete(trailers) {
+        if (this.location) {
+          this.location = null;
+          this.abort = null;
+          this.dispatch(this.opts, this);
+        } else {
+          this.handler.onComplete(trailers);
+        }
+      }
+      onBodySent(chunk) {
+        if (this.handler.onBodySent) {
+          this.handler.onBodySent(chunk);
+        }
+      }
+    };
+    function parseLocation(statusCode, headers) {
+      if (redirectableStatusCodes.indexOf(statusCode) === -1) {
+        return null;
+      }
+      for (let i = 0; i < headers.length; i += 2) {
+        if (headers[i].toString().toLowerCase() === "location") {
+          return headers[i + 1];
+        }
+      }
+    }
+    function shouldRemoveHeader(header, removeContent, unknownOrigin) {
+      return header.length === 4 && header.toString().toLowerCase() === "host" || removeContent && header.toString().toLowerCase().indexOf("content-") === 0 || unknownOrigin && header.length === 13 && header.toString().toLowerCase() === "authorization" || unknownOrigin && header.length === 6 && header.toString().toLowerCase() === "cookie";
+    }
+    function cleanRequestHeaders(headers, removeContent, unknownOrigin) {
+      const ret = [];
+      if (Array.isArray(headers)) {
+        for (let i = 0; i < headers.length; i += 2) {
+          if (!shouldRemoveHeader(headers[i], removeContent, unknownOrigin)) {
+            ret.push(headers[i], headers[i + 1]);
+          }
+        }
+      } else if (headers && typeof headers === "object") {
+        for (const key of Object.keys(headers)) {
+          if (!shouldRemoveHeader(key, removeContent, unknownOrigin)) {
+            ret.push(key, headers[key]);
+          }
+        }
+      } else {
+        assert(headers == null, "headers must be an object or an array");
+      }
+      return ret;
+    }
+    module2.exports = RedirectHandler;
   }
 });
 
-// lib/handler/RedirectHandler.js
-var require_RedirectHandler = __commonJS({
-  "lib/handler/RedirectHandler.js"(exports2, module2) {
+// lib/interceptor/redirectInterceptor.js
+var require_redirectInterceptor = __commonJS({
+  "lib/interceptor/redirectInterceptor.js"(exports2, module2) {
+    "use strict";
+    var RedirectHandler = require_RedirectHandler();
+    function createRedirectInterceptor({ maxRedirections: defaultMaxRedirections }) {
+      return (dispatch) => {
+        return function Intercept(opts, handler) {
+          const { maxRedirections = defaultMaxRedirections } = opts;
+          if (!maxRedirections) {
+            return dispatch(opts, handler);
+          }
+          const redirectHandler = new RedirectHandler(dispatch, maxRedirections, opts, handler);
+          opts = { ...opts, maxRedirections: 0 };
+          return dispatch(opts, redirectHandler);
+        };
+      };
+    }
+    module2.exports = createRedirectInterceptor;
+  }
+});
+
+// lib/llhttp/llhttp-wasm.js
+var require_llhttp_wasm = __commonJS({
+  "lib/llhttp/llhttp-wasm.js"(exports2, module2) {
+    module2.exports = "AGFzbQEAAAABMAhgAX8Bf2ADf39/AX9gBH9/f38Bf2AAAGADf39/AGABfwBgAn9/AGAGf39/f39/AALLAQgDZW52GHdhc21fb25faGVhZGVyc19jb21wbGV0ZQACA2VudhV3YXNtX29uX21lc3NhZ2VfYmVnaW4AAANlbnYLd2FzbV9vbl91cmwAAQNlbnYOd2FzbV9vbl9zdGF0dXMAAQNlbnYUd2FzbV9vbl9oZWFkZXJfZmllbGQAAQNlbnYUd2FzbV9vbl9oZWFkZXJfdmFsdWUAAQNlbnYMd2FzbV9vbl9ib2R5AAEDZW52GHdhc21fb25fbWVzc2FnZV9jb21wbGV0ZQAAA0ZFAwMEAAAFAAAAAAAABQEFAAUFBQAABgAAAAAGBgYGAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAAABAQcAAAUFAwABBAUBcAESEgUDAQACBggBfwFBgNQECwfRBSIGbWVtb3J5AgALX2luaXRpYWxpemUACRlfX2luZGlyZWN0X2Z1bmN0aW9uX3RhYmxlAQALbGxodHRwX2luaXQAChhsbGh0dHBfc2hvdWxkX2tlZXBfYWxpdmUAQQxsbGh0dHBfYWxsb2MADAZtYWxsb2MARgtsbGh0dHBfZnJlZQANBGZyZWUASA9sbGh0dHBfZ2V0X3R5cGUADhVsbGh0dHBfZ2V0X2h0dHBfbWFqb3IADxVsbGh0dHBfZ2V0X2h0dHBfbWlub3IAEBFsbGh0dHBfZ2V0X21ldGhvZAARFmxsaHR0cF9nZXRfc3RhdHVzX2NvZGUAEhJsbGh0dHBfZ2V0X3VwZ3JhZGUAEwxsbGh0dHBfcmVzZXQAFA5sbGh0dHBfZXhlY3V0ZQAVFGxsaHR0cF9zZXR0aW5nc19pbml0ABYNbGxodHRwX2ZpbmlzaAAXDGxsaHR0cF9wYXVzZQAYDWxsaHR0cF9yZXN1bWUAGRtsbGh0dHBfcmVzdW1lX2FmdGVyX3VwZ3JhZGUAGhBsbGh0dHBfZ2V0X2Vycm5vABsXbGxodHRwX2dldF9lcnJvcl9yZWFzb24AHBdsbGh0dHBfc2V0X2Vycm9yX3JlYXNvbgAdFGxsaHR0cF9nZXRfZXJyb3JfcG9zAB4RbGxodHRwX2Vycm5vX25hbWUAHxJsbGh0dHBfbWV0aG9kX25hbWUAIBJsbGh0dHBfc3RhdHVzX25hbWUAIRpsbGh0dHBfc2V0X2xlbmllbnRfaGVhZGVycwAiIWxsaHR0cF9zZXRfbGVuaWVudF9jaHVua2VkX2xlbmd0aAAjHWxsaHR0cF9zZXRfbGVuaWVudF9rZWVwX2FsaXZlACQkbGxodHRwX3NldF9sZW5pZW50X3RyYW5zZmVyX2VuY29kaW5nACUYbGxodHRwX21lc3NhZ2VfbmVlZHNfZW9mAD8JFwEAQQELEQECAwQFCwYHNTk3MS8tJyspCsLgAkUCAAsIABCIgICAAAsZACAAEMKAgIAAGiAAIAI2AjggACABOgAoCxwAIAAgAC8BMiAALQAuIAAQwYCAgAAQgICAgAALKgEBf0HAABDGgICAACIBEMKAgIAAGiABQYCIgIAANgI4IAEgADoAKCABCwoAIAAQyICAgAALBwAgAC0AKAsHACAALQAqCwcAIAAtACsLBwAgAC0AKQsHACAALwEyCwcAIAAtAC4LRQEEfyAAKAIYIQEgAC0ALSECIAAtACghAyAAKAI4IQQgABDCgICAABogACAENgI4IAAgAzoAKCAAIAI6AC0gACABNgIYCxEAIAAgASABIAJqEMOAgIAACxAAIABBAEHcABDMgICAABoLZwEBf0EAIQECQCAAKAIMDQACQAJAAkACQCAALQAvDgMBAAMCCyAAKAI4IgFFDQAgASgCLCIBRQ0AIAAgARGAgICAAAAiAQ0DC0EADwsQyoCAgAAACyAAQcOWgIAANgIQQQ4hAQsgAQseAAJAIAAoAgwNACAAQdGbgIAANgIQIABBFTYCDAsLFgACQCAAKAIMQRVHDQAgAEEANgIMCwsWAAJAIAAoAgxBFkcNACAAQQA2AgwLCwcAIAAoAgwLBwAgACgCEAsJACAAIAE2AhALBwAgACgCFAsiAAJAIABBJEkNABDKgICAAAALIABBAnRBoLOAgABqKAIACyIAAkAgAEEuSQ0AEMqAgIAAAAsgAEECdEGwtICAAGooAgAL7gsBAX9B66iAgAAhAQJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIABBnH9qDvQDY2IAAWFhYWFhYQIDBAVhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhBgcICQoLDA0OD2FhYWFhEGFhYWFhYWFhYWFhEWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYRITFBUWFxgZGhthYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhHB0eHyAhIiMkJSYnKCkqKywtLi8wMTIzNDU2YTc4OTphYWFhYWFhYTthYWE8YWFhYT0+P2FhYWFhYWFhQGFhQWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYUJDREVGR0hJSktMTU5PUFFSU2FhYWFhYWFhVFVWV1hZWlthXF1hYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFeYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhX2BhC0Hhp4CAAA8LQaShgIAADwtBy6yAgAAPC0H+sYCAAA8LQcCkgIAADwtBq6SAgAAPC0GNqICAAA8LQeKmgIAADwtBgLCAgAAPC0G5r4CAAA8LQdekgIAADwtB75+AgAAPC0Hhn4CAAA8LQfqfgIAADwtB8qCAgAAPC0Gor4CAAA8LQa6ygIAADwtBiLCAgAAPC0Hsp4CAAA8LQYKigIAADwtBjp2AgAAPC0HQroCAAA8LQcqjgIAADwtBxbKAgAAPC0HfnICAAA8LQdKcgIAADwtBxKCAgAAPC0HXoICAAA8LQaKfgIAADwtB7a6AgAAPC0GrsICAAA8LQdSlgIAADwtBzK6AgAAPC0H6roCAAA8LQfyrgIAADwtB0rCAgAAPC0HxnYCAAA8LQbuggIAADwtB96uAgAAPC0GQsYCAAA8LQdexgIAADwtBoq2AgAAPC0HUp4CAAA8LQeCrgIAADwtBn6yAgAAPC0HrsYCAAA8LQdWfgIAADwtByrGAgAAPC0HepYCAAA8LQdSegIAADwtB9JyAgAAPC0GnsoCAAA8LQbGdgIAADwtBoJ2AgAAPC0G5sYCAAA8LQbywgIAADwtBkqGAgAAPC0GzpoCAAA8LQemsgIAADwtBrJ6AgAAPC0HUq4CAAA8LQfemgIAADwtBgKaAgAAPC0GwoYCAAA8LQf6egIAADwtBjaOAgAAPC0GJrYCAAA8LQfeigIAADwtBoLGAgAAPC0Gun4CAAA8LQcalgIAADwtB6J6AgAAPC0GTooCAAA8LQcKvgIAADwtBw52AgAAPC0GLrICAAA8LQeGdgIAADwtBja+AgAAPC0HqoYCAAA8LQbStgIAADwtB0q+AgAAPC0HfsoCAAA8LQdKygIAADwtB8LCAgAAPC0GpooCAAA8LQfmjgIAADwtBmZ6AgAAPC0G1rICAAA8LQZuwgIAADwtBkrKAgAAPC0G2q4CAAA8LQcKigIAADwtB+LKAgAAPC0GepYCAAA8LQdCigIAADwtBup6AgAAPC0GBnoCAAA8LEMqAgIAAAAtB1qGAgAAhAQsgAQsWACAAIAAtAC1B/gFxIAFBAEdyOgAtCxkAIAAgAC0ALUH9AXEgAUEAR0EBdHI6AC0LGQAgACAALQAtQfsBcSABQQBHQQJ0cjoALQsZACAAIAAtAC1B9wFxIAFBAEdBA3RyOgAtCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAgAiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCBCIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQcaRgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIwIgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAggiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEH2ioCAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCNCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIMIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABB7ZqAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAjgiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCECIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQZWQgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAI8IgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAhQiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEGqm4CAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCQCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIYIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABB7ZOAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAkQiBEUNACAAIAQRgICAgAAAIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCJCIERQ0AIAAgBBGAgICAAAAhAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIsIgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAigiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEH2iICAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCUCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIcIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABBwpmAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAkgiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCICIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQZSUgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAJMIgRFDQAgACAEEYCAgIAAACEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAlQiBEUNACAAIAQRgICAgAAAIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCWCIERQ0AIAAgBBGAgICAAAAhAwsgAwtFAQF/AkACQCAALwEwQRRxQRRHDQBBASEDIAAtAChBAUYNASAALwEyQeUARiEDDAELIAAtAClBBUYhAwsgACADOgAuQQAL/gEBA39BASEDAkAgAC8BMCIEQQhxDQAgACkDIEIAUiEDCwJAAkAgAC0ALkUNAEEBIQUgAC0AKUEFRg0BQQEhBSAEQcAAcUUgA3FBAUcNAQtBACEFIARBwABxDQBBAiEFIARB//8DcSIDQQhxDQACQCADQYAEcUUNAAJAIAAtAChBAUcNACAALQAtQQpxDQBBBQ8LQQQPCwJAIANBIHENAAJAIAAtAChBAUYNACAALwEyQf//A3EiAEGcf2pB5ABJDQAgAEHMAUYNACAAQbACRg0AQQQhBSAEQShxRQ0CIANBiARxQYAERg0CC0EADwtBAEEDIAApAyBQGyEFCyAFC2IBAn9BACEBAkAgAC0AKEEBRg0AIAAvATJB//8DcSICQZx/akHkAEkNACACQcwBRg0AIAJBsAJGDQAgAC8BMCIAQcAAcQ0AQQEhASAAQYgEcUGABEYNACAAQShxRSEBCyABC6cBAQN/AkACQAJAIAAtACpFDQAgAC0AK0UNAEEAIQMgAC8BMCIEQQJxRQ0BDAILQQAhAyAALwEwIgRBAXFFDQELQQEhAyAALQAoQQFGDQAgAC8BMkH//wNxIgVBnH9qQeQASQ0AIAVBzAFGDQAgBUGwAkYNACAEQcAAcQ0AQQAhAyAEQYgEcUGABEYNACAEQShxQQBHIQMLIABBADsBMCAAQQA6AC8gAwuZAQECfwJAAkACQCAALQAqRQ0AIAAtACtFDQBBACEBIAAvATAiAkECcUUNAQwCC0EAIQEgAC8BMCICQQFxRQ0BC0EBIQEgAC0AKEEBRg0AIAAvATJB//8DcSIAQZx/akHkAEkNACAAQcwBRg0AIABBsAJGDQAgAkHAAHENAEEAIQEgAkGIBHFBgARGDQAgAkEocUEARyEBCyABC1kAIABBGGpCADcDACAAQgA3AwAgAEE4akIANwMAIABBMGpCADcDACAAQShqQgA3AwAgAEEgakIANwMAIABBEGpCADcDACAAQQhqQgA3AwAgAEHdATYCHEEAC3sBAX8CQCAAKAIMIgMNAAJAIAAoAgRFDQAgACABNgIECwJAIAAgASACEMSAgIAAIgMNACAAKAIMDwsgACADNgIcQQAhAyAAKAIEIgFFDQAgACABIAIgACgCCBGBgICAAAAiAUUNACAAIAI2AhQgACABNgIMIAEhAwsgAwvk8wEDDn8DfgR/I4CAgIAAQRBrIgMkgICAgAAgASEEIAEhBSABIQYgASEHIAEhCCABIQkgASEKIAEhCyABIQwgASENIAEhDiABIQ8CQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkAgACgCHCIQQX9qDt0B2gEB2QECAwQFBgcICQoLDA0O2AEPENcBERLWARMUFRYXGBkaG+AB3wEcHR7VAR8gISIjJCXUASYnKCkqKyzTAdIBLS7RAdABLzAxMjM0NTY3ODk6Ozw9Pj9AQUJDREVG2wFHSElKzwHOAUvNAUzMAU1OT1BRUlNUVVZXWFlaW1xdXl9gYWJjZGVmZ2hpamtsbW5vcHFyc3R1dnd4eXp7fH1+f4ABgQGCAYMBhAGFAYYBhwGIAYkBigGLAYwBjQGOAY8BkAGRAZIBkwGUAZUBlgGXAZgBmQGaAZsBnAGdAZ4BnwGgAaEBogGjAaQBpQGmAacBqAGpAaoBqwGsAa0BrgGvAbABsQGyAbMBtAG1AbYBtwHLAcoBuAHJAbkByAG6AbsBvAG9Ab4BvwHAAcEBwgHDAcQBxQHGAQDcAQtBACEQDMYBC0EOIRAMxQELQQ0hEAzEAQtBDyEQDMMBC0EQIRAMwgELQRMhEAzBAQtBFCEQDMABC0EVIRAMvwELQRYhEAy+AQtBFyEQDL0BC0EYIRAMvAELQRkhEAy7AQtBGiEQDLoBC0EbIRAMuQELQRwhEAy4AQtBCCEQDLcBC0EdIRAMtgELQSAhEAy1AQtBHyEQDLQBC0EHIRAMswELQSEhEAyyAQtBIiEQDLEBC0EeIRAMsAELQSMhEAyvAQtBEiEQDK4BC0ERIRAMrQELQSQhEAysAQtBJSEQDKsBC0EmIRAMqgELQSchEAypAQtBwwEhEAyoAQtBKSEQDKcBC0ErIRAMpgELQSwhEAylAQtBLSEQDKQBC0EuIRAMowELQS8hEAyiAQtBxAEhEAyhAQtBMCEQDKABC0E0IRAMnwELQQwhEAyeAQtBMSEQDJ0BC0EyIRAMnAELQTMhEAybAQtBOSEQDJoBC0E1IRAMmQELQcUBIRAMmAELQQshEAyXAQtBOiEQDJYBC0E2IRAMlQELQQohEAyUAQtBNyEQDJMBC0E4IRAMkgELQTwhEAyRAQtBOyEQDJABC0E9IRAMjwELQQkhEAyOAQtBKCEQDI0BC0E+IRAMjAELQT8hEAyLAQtBwAAhEAyKAQtBwQAhEAyJAQtBwgAhEAyIAQtBwwAhEAyHAQtBxAAhEAyGAQtBxQAhEAyFAQtBxgAhEAyEAQtBKiEQDIMBC0HHACEQDIIBC0HIACEQDIEBC0HJACEQDIABC0HKACEQDH8LQcsAIRAMfgtBzQAhEAx9C0HMACEQDHwLQc4AIRAMewtBzwAhEAx6C0HQACEQDHkLQdEAIRAMeAtB0gAhEAx3C0HTACEQDHYLQdQAIRAMdQtB1gAhEAx0C0HVACEQDHMLQQYhEAxyC0HXACEQDHELQQUhEAxwC0HYACEQDG8LQQQhEAxuC0HZACEQDG0LQdoAIRAMbAtB2wAhEAxrC0HcACEQDGoLQQMhEAxpC0HdACEQDGgLQd4AIRAMZwtB3wAhEAxmC0HhACEQDGULQeAAIRAMZAtB4gAhEAxjC0HjACEQDGILQQIhEAxhC0HkACEQDGALQeUAIRAMXwtB5gAhEAxeC0HnACEQDF0LQegAIRAMXAtB6QAhEAxbC0HqACEQDFoLQesAIRAMWQtB7AAhEAxYC0HtACEQDFcLQe4AIRAMVgtB7wAhEAxVC0HwACEQDFQLQfEAIRAMUwtB8gAhEAxSC0HzACEQDFELQfQAIRAMUAtB9QAhEAxPC0H2ACEQDE4LQfcAIRAMTQtB+AAhEAxMC0H5ACEQDEsLQfoAIRAMSgtB+wAhEAxJC0H8ACEQDEgLQf0AIRAMRwtB/gAhEAxGC0H/ACEQDEULQYABIRAMRAtBgQEhEAxDC0GCASEQDEILQYMBIRAMQQtBhAEhEAxAC0GFASEQDD8LQYYBIRAMPgtBhwEhEAw9C0GIASEQDDwLQYkBIRAMOwtBigEhEAw6C0GLASEQDDkLQYwBIRAMOAtBjQEhEAw3C0GOASEQDDYLQY8BIRAMNQtBkAEhEAw0C0GRASEQDDMLQZIBIRAMMgtBkwEhEAwxC0GUASEQDDALQZUBIRAMLwtBlgEhEAwuC0GXASEQDC0LQZgBIRAMLAtBmQEhEAwrC0GaASEQDCoLQZsBIRAMKQtBnAEhEAwoC0GdASEQDCcLQZ4BIRAMJgtBnwEhEAwlC0GgASEQDCQLQaEBIRAMIwtBogEhEAwiC0GjASEQDCELQaQBIRAMIAtBpQEhEAwfC0GmASEQDB4LQacBIRAMHQtBqAEhEAwcC0GpASEQDBsLQaoBIRAMGgtBqwEhEAwZC0GsASEQDBgLQa0BIRAMFwtBrgEhEAwWC0EBIRAMFQtBrwEhEAwUC0GwASEQDBMLQbEBIRAMEgtBswEhEAwRC0GyASEQDBALQbQBIRAMDwtBtQEhEAwOC0G2ASEQDA0LQbcBIRAMDAtBuAEhEAwLC0G5ASEQDAoLQboBIRAMCQtBuwEhEAwIC0HGASEQDAcLQbwBIRAMBgtBvQEhEAwFC0G+ASEQDAQLQb8BIRAMAwtBwAEhEAwCC0HCASEQDAELQcEBIRALA0ACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAQDscBAAECAwQFBgcICQoLDA0ODxAREhMUFRYXGBkaGxweHyAhIyUoP0BBREVGR0hJSktMTU9QUVJT3gNXWVtcXWBiZWZnaGlqa2xtb3BxcnN0dXZ3eHl6e3x9foABggGFAYYBhwGJAYsBjAGNAY4BjwGQAZEBlAGVAZYBlwGYAZkBmgGbAZwBnQGeAZ8BoAGhAaIBowGkAaUBpgGnAagBqQGqAasBrAGtAa4BrwGwAbEBsgGzAbQBtQG2AbcBuAG5AboBuwG8Ab0BvgG/AcABwQHCAcMBxAHFAcYBxwHIAckBygHLAcwBzQHOAc8B0AHRAdIB0wHUAdUB1gHXAdgB2QHaAdsB3AHdAd4B4AHhAeIB4wHkAeUB5gHnAegB6QHqAesB7AHtAe4B7wHwAfEB8gHzAZkCpAKwAv4C/gILIAEiBCACRw3zAUHdASEQDP8DCyABIhAgAkcN3QFBwwEhEAz+AwsgASIBIAJHDZABQfcAIRAM/QMLIAEiASACRw2GAUHvACEQDPwDCyABIgEgAkcNf0HqACEQDPsDCyABIgEgAkcNe0HoACEQDPoDCyABIgEgAkcNeEHmACEQDPkDCyABIgEgAkcNGkEYIRAM+AMLIAEiASACRw0UQRIhEAz3AwsgASIBIAJHDVlBxQAhEAz2AwsgASIBIAJHDUpBPyEQDPUDCyABIgEgAkcNSEE8IRAM9AMLIAEiASACRw1BQTEhEAzzAwsgAC0ALkEBRg3rAwyHAgsgACABIgEgAhDAgICAAEEBRw3mASAAQgA3AyAM5wELIAAgASIBIAIQtICAgAAiEA3nASABIQEM9QILAkAgASIBIAJHDQBBBiEQDPADCyAAIAFBAWoiASACELuAgIAAIhAN6AEgASEBDDELIABCADcDIEESIRAM1QMLIAEiECACRw0rQR0hEAztAwsCQCABIgEgAkYNACABQQFqIQFBECEQDNQDC0EHIRAM7AMLIABCACAAKQMgIhEgAiABIhBrrSISfSITIBMgEVYbNwMgIBEgElYiFEUN5QFBCCEQDOsDCwJAIAEiASACRg0AIABBiYCAgAA2AgggACABNgIEIAEhAUEUIRAM0gMLQQkhEAzqAwsgASEBIAApAyBQDeQBIAEhAQzyAgsCQCABIgEgAkcNAEELIRAM6QMLIAAgAUEBaiIBIAIQtoCAgAAiEA3lASABIQEM8gILIAAgASIBIAIQuICAgAAiEA3lASABIQEM8gILIAAgASIBIAIQuICAgAAiEA3mASABIQEMDQsgACABIgEgAhC6gICAACIQDecBIAEhAQzwAgsCQCABIgEgAkcNAEEPIRAM5QMLIAEtAAAiEEE7Rg0IIBBBDUcN6AEgAUEBaiEBDO8CCyAAIAEiASACELqAgIAAIhAN6AEgASEBDPICCwNAAkAgAS0AAEHwtYCAAGotAAAiEEEBRg0AIBBBAkcN6wEgACgCBCEQIABBADYCBCAAIBAgAUEBaiIBELmAgIAAIhAN6gEgASEBDPQCCyABQQFqIgEgAkcNAAtBEiEQDOIDCyAAIAEiASACELqAgIAAIhAN6QEgASEBDAoLIAEiASACRw0GQRshEAzgAwsCQCABIgEgAkcNAEEWIRAM4AMLIABBioCAgAA2AgggACABNgIEIAAgASACELiAgIAAIhAN6gEgASEBQSAhEAzGAwsCQCABIgEgAkYNAANAAkAgAS0AAEHwt4CAAGotAAAiEEECRg0AAkAgEEF/ag4E5QHsAQDrAewBCyABQQFqIQFBCCEQDMgDCyABQQFqIgEgAkcNAAtBFSEQDN8DC0EVIRAM3gMLA0ACQCABLQAAQfC5gIAAai0AACIQQQJGDQAgEEF/ag4E3gHsAeAB6wHsAQsgAUEBaiIBIAJHDQALQRghEAzdAwsCQCABIgEgAkYNACAAQYuAgIAANgIIIAAgATYCBCABIQFBByEQDMQDC0EZIRAM3AMLIAFBAWohAQwCCwJAIAEiFCACRw0AQRohEAzbAwsgFCEBAkAgFC0AAEFzag4U3QLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gIA7gILQQAhECAAQQA2AhwgAEGvi4CAADYCECAAQQI2AgwgACAUQQFqNgIUDNoDCwJAIAEtAAAiEEE7Rg0AIBBBDUcN6AEgAUEBaiEBDOUCCyABQQFqIQELQSIhEAy/AwsCQCABIhAgAkcNAEEcIRAM2AMLQgAhESAQIQEgEC0AAEFQag435wHmAQECAwQFBgcIAAAAAAAAAAkKCwwNDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADxAREhMUAAtBHiEQDL0DC0ICIREM5QELQgMhEQzkAQtCBCERDOMBC0IFIREM4gELQgYhEQzhAQtCByERDOABC0IIIREM3wELQgkhEQzeAQtCCiERDN0BC0ILIREM3AELQgwhEQzbAQtCDSERDNoBC0IOIREM2QELQg8hEQzYAQtCCiERDNcBC0ILIREM1gELQgwhEQzVAQtCDSERDNQBC0IOIREM0wELQg8hEQzSAQtCACERAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAQLQAAQVBqDjflAeQBAAECAwQFBgfmAeYB5gHmAeYB5gHmAQgJCgsMDeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gEODxAREhPmAQtCAiERDOQBC0IDIREM4wELQgQhEQziAQtCBSERDOEBC0IGIREM4AELQgchEQzfAQtCCCERDN4BC0IJIREM3QELQgohEQzcAQtCCyERDNsBC0IMIREM2gELQg0hEQzZAQtCDiERDNgBC0IPIREM1wELQgohEQzWAQtCCyERDNUBC0IMIREM1AELQg0hEQzTAQtCDiERDNIBC0IPIREM0QELIABCACAAKQMgIhEgAiABIhBrrSISfSITIBMgEVYbNwMgIBEgElYiFEUN0gFBHyEQDMADCwJAIAEiASACRg0AIABBiYCAgAA2AgggACABNgIEIAEhAUEkIRAMpwMLQSAhEAy/AwsgACABIhAgAhC+gICAAEF/ag4FtgEAxQIB0QHSAQtBESEQDKQDCyAAQQE6AC8gECEBDLsDCyABIgEgAkcN0gFBJCEQDLsDCyABIg0gAkcNHkHGACEQDLoDCyAAIAEiASACELKAgIAAIhAN1AEgASEBDLUBCyABIhAgAkcNJkHQACEQDLgDCwJAIAEiASACRw0AQSghEAy4AwsgAEEANgIEIABBjICAgAA2AgggACABIAEQsYCAgAAiEA3TASABIQEM2AELAkAgASIQIAJHDQBBKSEQDLcDCyAQLQAAIgFBIEYNFCABQQlHDdMBIBBBAWohAQwVCwJAIAEiASACRg0AIAFBAWohAQwXC0EqIRAMtQMLAkAgASIQIAJHDQBBKyEQDLUDCwJAIBAtAAAiAUEJRg0AIAFBIEcN1QELIAAtACxBCEYN0wEgECEBDJEDCwJAIAEiASACRw0AQSwhEAy0AwsgAS0AAEEKRw3VASABQQFqIQEMyQILIAEiDiACRw3VAUEvIRAMsgMLA0ACQCABLQAAIhBBIEYNAAJAIBBBdmoOBADcAdwBANoBCyABIQEM4AELIAFBAWoiASACRw0AC0ExIRAMsQMLQTIhECABIhQgAkYNsAMgAiAUayAAKAIAIgFqIRUgFCABa0EDaiEWAkADQCAULQAAIhdBIHIgFyAXQb9/akH/AXFBGkkbQf8BcSABQfC7gIAAai0AAEcNAQJAIAFBA0cNAEEGIQEMlgMLIAFBAWohASAUQQFqIhQgAkcNAAsgACAVNgIADLEDCyAAQQA2AgAgFCEBDNkBC0EzIRAgASIUIAJGDa8DIAIgFGsgACgCACIBaiEVIBQgAWtBCGohFgJAA0AgFC0AACIXQSByIBcgF0G/f2pB/wFxQRpJG0H/AXEgAUH0u4CAAGotAABHDQECQCABQQhHDQBBBSEBDJUDCyABQQFqIQEgFEEBaiIUIAJHDQALIAAgFTYCAAywAwsgAEEANgIAIBQhAQzYAQtBNCEQIAEiFCACRg2uAyACIBRrIAAoAgAiAWohFSAUIAFrQQVqIRYCQANAIBQtAAAiF0EgciAXIBdBv39qQf8BcUEaSRtB/wFxIAFB0MKAgABqLQAARw0BAkAgAUEFRw0AQQchAQyUAwsgAUEBaiEBIBRBAWoiFCACRw0ACyAAIBU2AgAMrwMLIABBADYCACAUIQEM1wELAkAgASIBIAJGDQADQAJAIAEtAABBgL6AgABqLQAAIhBBAUYNACAQQQJGDQogASEBDN0BCyABQQFqIgEgAkcNAAtBMCEQDK4DC0EwIRAMrQMLAkAgASIBIAJGDQADQAJAIAEtAAAiEEEgRg0AIBBBdmoOBNkB2gHaAdkB2gELIAFBAWoiASACRw0AC0E4IRAMrQMLQTghEAysAwsDQAJAIAEtAAAiEEEgRg0AIBBBCUcNAwsgAUEBaiIBIAJHDQALQTwhEAyrAwsDQAJAIAEtAAAiEEEgRg0AAkACQCAQQXZqDgTaAQEB2gEACyAQQSxGDdsBCyABIQEMBAsgAUEBaiIBIAJHDQALQT8hEAyqAwsgASEBDNsBC0HAACEQIAEiFCACRg2oAyACIBRrIAAoAgAiAWohFiAUIAFrQQZqIRcCQANAIBQtAABBIHIgAUGAwICAAGotAABHDQEgAUEGRg2OAyABQQFqIQEgFEEBaiIUIAJHDQALIAAgFjYCAAypAwsgAEEANgIAIBQhAQtBNiEQDI4DCwJAIAEiDyACRw0AQcEAIRAMpwMLIABBjICAgAA2AgggACAPNgIEIA8hASAALQAsQX9qDgTNAdUB1wHZAYcDCyABQQFqIQEMzAELAkAgASIBIAJGDQADQAJAIAEtAAAiEEEgciAQIBBBv39qQf8BcUEaSRtB/wFxIhBBCUYNACAQQSBGDQACQAJAAkACQCAQQZ1/ag4TAAMDAwMDAwMBAwMDAwMDAwMDAgMLIAFBAWohAUExIRAMkQMLIAFBAWohAUEyIRAMkAMLIAFBAWohAUEzIRAMjwMLIAEhAQzQAQsgAUEBaiIBIAJHDQALQTUhEAylAwtBNSEQDKQDCwJAIAEiASACRg0AA0ACQCABLQAAQYC8gIAAai0AAEEBRg0AIAEhAQzTAQsgAUEBaiIBIAJHDQALQT0hEAykAwtBPSEQDKMDCyAAIAEiASACELCAgIAAIhAN1gEgASEBDAELIBBBAWohAQtBPCEQDIcDCwJAIAEiASACRw0AQcIAIRAMoAMLAkADQAJAIAEtAABBd2oOGAAC/gL+AoQD/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4CAP4CCyABQQFqIgEgAkcNAAtBwgAhEAygAwsgAUEBaiEBIAAtAC1BAXFFDb0BIAEhAQtBLCEQDIUDCyABIgEgAkcN0wFBxAAhEAydAwsDQAJAIAEtAABBkMCAgABqLQAAQQFGDQAgASEBDLcCCyABQQFqIgEgAkcNAAtBxQAhEAycAwsgDS0AACIQQSBGDbMBIBBBOkcNgQMgACgCBCEBIABBADYCBCAAIAEgDRCvgICAACIBDdABIA1BAWohAQyzAgtBxwAhECABIg0gAkYNmgMgAiANayAAKAIAIgFqIRYgDSABa0EFaiEXA0AgDS0AACIUQSByIBQgFEG/f2pB/wFxQRpJG0H/AXEgAUGQwoCAAGotAABHDYADIAFBBUYN9AIgAUEBaiEBIA1BAWoiDSACRw0ACyAAIBY2AgAMmgMLQcgAIRAgASINIAJGDZkDIAIgDWsgACgCACIBaiEWIA0gAWtBCWohFwNAIA0tAAAiFEEgciAUIBRBv39qQf8BcUEaSRtB/wFxIAFBlsKAgABqLQAARw3/AgJAIAFBCUcNAEECIQEM9QILIAFBAWohASANQQFqIg0gAkcNAAsgACAWNgIADJkDCwJAIAEiDSACRw0AQckAIRAMmQMLAkACQCANLQAAIgFBIHIgASABQb9/akH/AXFBGkkbQf8BcUGSf2oOBwCAA4ADgAOAA4ADAYADCyANQQFqIQFBPiEQDIADCyANQQFqIQFBPyEQDP8CC0HKACEQIAEiDSACRg2XAyACIA1rIAAoAgAiAWohFiANIAFrQQFqIRcDQCANLQAAIhRBIHIgFCAUQb9/akH/AXFBGkkbQf8BcSABQaDCgIAAai0AAEcN/QIgAUEBRg3wAiABQQFqIQEgDUEBaiINIAJHDQALIAAgFjYCAAyXAwtBywAhECABIg0gAkYNlgMgAiANayAAKAIAIgFqIRYgDSABa0EOaiEXA0AgDS0AACIUQSByIBQgFEG/f2pB/wFxQRpJG0H/AXEgAUGiwoCAAGotAABHDfwCIAFBDkYN8AIgAUEBaiEBIA1BAWoiDSACRw0ACyAAIBY2AgAMlgMLQcwAIRAgASINIAJGDZUDIAIgDWsgACgCACIBaiEWIA0gAWtBD2ohFwNAIA0tAAAiFEEgciAUIBRBv39qQf8BcUEaSRtB/wFxIAFBwMKAgABqLQAARw37AgJAIAFBD0cNAEEDIQEM8QILIAFBAWohASANQQFqIg0gAkcNAAsgACAWNgIADJUDC0HNACEQIAEiDSACRg2UAyACIA1rIAAoAgAiAWohFiANIAFrQQVqIRcDQCANLQAAIhRBIHIgFCAUQb9/akH/AXFBGkkbQf8BcSABQdDCgIAAai0AAEcN+gICQCABQQVHDQBBBCEBDPACCyABQQFqIQEgDUEBaiINIAJHDQALIAAgFjYCAAyUAwsCQCABIg0gAkcNAEHOACEQDJQDCwJAAkACQAJAIA0tAAAiAUEgciABIAFBv39qQf8BcUEaSRtB/wFxQZ1/ag4TAP0C/QL9Av0C/QL9Av0C/QL9Av0C/QL9AgH9Av0C/QICA/0CCyANQQFqIQFBwQAhEAz9AgsgDUEBaiEBQcIAIRAM/AILIA1BAWohAUHDACEQDPsCCyANQQFqIQFBxAAhEAz6AgsCQCABIgEgAkYNACAAQY2AgIAANgIIIAAgATYCBCABIQFBxQAhEAz6AgtBzwAhEAySAwsgECEBAkACQCAQLQAAQXZqDgQBqAKoAgCoAgsgEEEBaiEBC0EnIRAM+AILAkAgASIBIAJHDQBB0QAhEAyRAwsCQCABLQAAQSBGDQAgASEBDI0BCyABQQFqIQEgAC0ALUEBcUUNxwEgASEBDIwBCyABIhcgAkcNyAFB0gAhEAyPAwtB0wAhECABIhQgAkYNjgMgAiAUayAAKAIAIgFqIRYgFCABa0EBaiEXA0AgFC0AACABQdbCgIAAai0AAEcNzAEgAUEBRg3HASABQQFqIQEgFEEBaiIUIAJHDQALIAAgFjYCAAyOAwsCQCABIgEgAkcNAEHVACEQDI4DCyABLQAAQQpHDcwBIAFBAWohAQzHAQsCQCABIgEgAkcNAEHWACEQDI0DCwJAAkAgAS0AAEF2ag4EAM0BzQEBzQELIAFBAWohAQzHAQsgAUEBaiEBQcoAIRAM8wILIAAgASIBIAIQroCAgAAiEA3LASABIQFBzQAhEAzyAgsgAC0AKUEiRg2FAwymAgsCQCABIgEgAkcNAEHbACEQDIoDC0EAIRRBASEXQQEhFkEAIRACQAJAAkACQAJAAkACQAJAAkAgAS0AAEFQag4K1AHTAQABAgMEBQYI1QELQQIhEAwGC0EDIRAMBQtBBCEQDAQLQQUhEAwDC0EGIRAMAgtBByEQDAELQQghEAtBACEXQQAhFkEAIRQMzAELQQkhEEEBIRRBACEXQQAhFgzLAQsCQCABIgEgAkcNAEHdACEQDIkDCyABLQAAQS5HDcwBIAFBAWohAQymAgsgASIBIAJHDcwBQd8AIRAMhwMLAkAgASIBIAJGDQAgAEGOgICAADYCCCAAIAE2AgQgASEBQdAAIRAM7gILQeAAIRAMhgMLQeEAIRAgASIBIAJGDYUDIAIgAWsgACgCACIUaiEWIAEgFGtBA2ohFwNAIAEtAAAgFEHiwoCAAGotAABHDc0BIBRBA0YNzAEgFEEBaiEUIAFBAWoiASACRw0ACyAAIBY2AgAMhQMLQeIAIRAgASIBIAJGDYQDIAIgAWsgACgCACIUaiEWIAEgFGtBAmohFwNAIAEtAAAgFEHmwoCAAGotAABHDcwBIBRBAkYNzgEgFEEBaiEUIAFBAWoiASACRw0ACyAAIBY2AgAMhAMLQeMAIRAgASIBIAJGDYMDIAIgAWsgACgCACIUaiEWIAEgFGtBA2ohFwNAIAEtAAAgFEHpwoCAAGotAABHDcsBIBRBA0YNzgEgFEEBaiEUIAFBAWoiASACRw0ACyAAIBY2AgAMgwMLAkAgASIBIAJHDQBB5QAhEAyDAwsgACABQQFqIgEgAhCogICAACIQDc0BIAEhAUHWACEQDOkCCwJAIAEiASACRg0AA0ACQCABLQAAIhBBIEYNAAJAAkACQCAQQbh/ag4LAAHPAc8BzwHPAc8BzwHPAc8BAs8BCyABQQFqIQFB0gAhEAztAgsgAUEBaiEBQdMAIRAM7AILIAFBAWohAUHUACEQDOsCCyABQQFqIgEgAkcNAAtB5AAhEAyCAwtB5AAhEAyBAwsDQAJAIAEtAABB8MKAgABqLQAAIhBBAUYNACAQQX5qDgPPAdAB0QHSAQsgAUEBaiIBIAJHDQALQeYAIRAMgAMLAkAgASIBIAJGDQAgAUEBaiEBDAMLQecAIRAM/wILA0ACQCABLQAAQfDEgIAAai0AACIQQQFGDQACQCAQQX5qDgTSAdMB1AEA1QELIAEhAUHXACEQDOcCCyABQQFqIgEgAkcNAAtB6AAhEAz+AgsCQCABIgEgAkcNAEHpACEQDP4CCwJAIAEtAAAiEEF2ag4augHVAdUBvAHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHKAdUB1QEA0wELIAFBAWohAQtBBiEQDOMCCwNAAkAgAS0AAEHwxoCAAGotAABBAUYNACABIQEMngILIAFBAWoiASACRw0AC0HqACEQDPsCCwJAIAEiASACRg0AIAFBAWohAQwDC0HrACEQDPoCCwJAIAEiASACRw0AQewAIRAM+gILIAFBAWohAQwBCwJAIAEiASACRw0AQe0AIRAM+QILIAFBAWohAQtBBCEQDN4CCwJAIAEiFCACRw0AQe4AIRAM9wILIBQhAQJAAkACQCAULQAAQfDIgIAAai0AAEF/ag4H1AHVAdYBAJwCAQLXAQsgFEEBaiEBDAoLIBRBAWohAQzNAQtBACEQIABBADYCHCAAQZuSgIAANgIQIABBBzYCDCAAIBRBAWo2AhQM9gILAkADQAJAIAEtAABB8MiAgABqLQAAIhBBBEYNAAJAAkAgEEF/ag4H0gHTAdQB2QEABAHZAQsgASEBQdoAIRAM4AILIAFBAWohAUHcACEQDN8CCyABQQFqIgEgAkcNAAtB7wAhEAz2AgsgAUEBaiEBDMsBCwJAIAEiFCACRw0AQfAAIRAM9QILIBQtAABBL0cN1AEgFEEBaiEBDAYLAkAgASIUIAJHDQBB8QAhEAz0AgsCQCAULQAAIgFBL0cNACAUQQFqIQFB3QAhEAzbAgsgAUF2aiIEQRZLDdMBQQEgBHRBiYCAAnFFDdMBDMoCCwJAIAEiASACRg0AIAFBAWohAUHeACEQDNoCC0HyACEQDPICCwJAIAEiFCACRw0AQfQAIRAM8gILIBQhAQJAIBQtAABB8MyAgABqLQAAQX9qDgPJApQCANQBC0HhACEQDNgCCwJAIAEiFCACRg0AA0ACQCAULQAAQfDKgIAAai0AACIBQQNGDQACQCABQX9qDgLLAgDVAQsgFCEBQd8AIRAM2gILIBRBAWoiFCACRw0AC0HzACEQDPECC0HzACEQDPACCwJAIAEiASACRg0AIABBj4CAgAA2AgggACABNgIEIAEhAUHgACEQDNcCC0H1ACEQDO8CCwJAIAEiASACRw0AQfYAIRAM7wILIABBj4CAgAA2AgggACABNgIEIAEhAQtBAyEQDNQCCwNAIAEtAABBIEcNwwIgAUEBaiIBIAJHDQALQfcAIRAM7AILAkAgASIBIAJHDQBB+AAhEAzsAgsgAS0AAEEgRw3OASABQQFqIQEM7wELIAAgASIBIAIQrICAgAAiEA3OASABIQEMjgILAkAgASIEIAJHDQBB+gAhEAzqAgsgBC0AAEHMAEcN0QEgBEEBaiEBQRMhEAzPAQsCQCABIgQgAkcNAEH7ACEQDOkCCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRADQCAELQAAIAFB8M6AgABqLQAARw3QASABQQVGDc4BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQfsAIRAM6AILAkAgASIEIAJHDQBB/AAhEAzoAgsCQAJAIAQtAABBvX9qDgwA0QHRAdEB0QHRAdEB0QHRAdEB0QEB0QELIARBAWohAUHmACEQDM8CCyAEQQFqIQFB5wAhEAzOAgsCQCABIgQgAkcNAEH9ACEQDOcCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHtz4CAAGotAABHDc8BIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEH9ACEQDOcCCyAAQQA2AgAgEEEBaiEBQRAhEAzMAQsCQCABIgQgAkcNAEH+ACEQDOYCCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUH2zoCAAGotAABHDc4BIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEH+ACEQDOYCCyAAQQA2AgAgEEEBaiEBQRYhEAzLAQsCQCABIgQgAkcNAEH/ACEQDOUCCyACIARrIAAoAgAiAWohFCAEIAFrQQNqIRACQANAIAQtAAAgAUH8zoCAAGotAABHDc0BIAFBA0YNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEH/ACEQDOUCCyAAQQA2AgAgEEEBaiEBQQUhEAzKAQsCQCABIgQgAkcNAEGAASEQDOQCCyAELQAAQdkARw3LASAEQQFqIQFBCCEQDMkBCwJAIAEiBCACRw0AQYEBIRAM4wILAkACQCAELQAAQbJ/ag4DAMwBAcwBCyAEQQFqIQFB6wAhEAzKAgsgBEEBaiEBQewAIRAMyQILAkAgASIEIAJHDQBBggEhEAziAgsCQAJAIAQtAABBuH9qDggAywHLAcsBywHLAcsBAcsBCyAEQQFqIQFB6gAhEAzJAgsgBEEBaiEBQe0AIRAMyAILAkAgASIEIAJHDQBBgwEhEAzhAgsgAiAEayAAKAIAIgFqIRAgBCABa0ECaiEUAkADQCAELQAAIAFBgM+AgABqLQAARw3JASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBA2AgBBgwEhEAzhAgtBACEQIABBADYCACAUQQFqIQEMxgELAkAgASIEIAJHDQBBhAEhEAzgAgsgAiAEayAAKAIAIgFqIRQgBCABa0EEaiEQAkADQCAELQAAIAFBg8+AgABqLQAARw3IASABQQRGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBhAEhEAzgAgsgAEEANgIAIBBBAWohAUEjIRAMxQELAkAgASIEIAJHDQBBhQEhEAzfAgsCQAJAIAQtAABBtH9qDggAyAHIAcgByAHIAcgBAcgBCyAEQQFqIQFB7wAhEAzGAgsgBEEBaiEBQfAAIRAMxQILAkAgASIEIAJHDQBBhgEhEAzeAgsgBC0AAEHFAEcNxQEgBEEBaiEBDIMCCwJAIAEiBCACRw0AQYcBIRAM3QILIAIgBGsgACgCACIBaiEUIAQgAWtBA2ohEAJAA0AgBC0AACABQYjPgIAAai0AAEcNxQEgAUEDRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYcBIRAM3QILIABBADYCACAQQQFqIQFBLSEQDMIBCwJAIAEiBCACRw0AQYgBIRAM3AILIAIgBGsgACgCACIBaiEUIAQgAWtBCGohEAJAA0AgBC0AACABQdDPgIAAai0AAEcNxAEgAUEIRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYgBIRAM3AILIABBADYCACAQQQFqIQFBKSEQDMEBCwJAIAEiASACRw0AQYkBIRAM2wILQQEhECABLQAAQd8ARw3AASABQQFqIQEMgQILAkAgASIEIAJHDQBBigEhEAzaAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQA0AgBC0AACABQYzPgIAAai0AAEcNwQEgAUEBRg2vAiABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGKASEQDNkCCwJAIAEiBCACRw0AQYsBIRAM2QILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQY7PgIAAai0AAEcNwQEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYsBIRAM2QILIABBADYCACAQQQFqIQFBAiEQDL4BCwJAIAEiBCACRw0AQYwBIRAM2AILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQfDPgIAAai0AAEcNwAEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYwBIRAM2AILIABBADYCACAQQQFqIQFBHyEQDL0BCwJAIAEiBCACRw0AQY0BIRAM1wILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQfLPgIAAai0AAEcNvwEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQY0BIRAM1wILIABBADYCACAQQQFqIQFBCSEQDLwBCwJAIAEiBCACRw0AQY4BIRAM1gILAkACQCAELQAAQbd/ag4HAL8BvwG/Ab8BvwEBvwELIARBAWohAUH4ACEQDL0CCyAEQQFqIQFB+QAhEAy8AgsCQCABIgQgAkcNAEGPASEQDNUCCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUGRz4CAAGotAABHDb0BIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGPASEQDNUCCyAAQQA2AgAgEEEBaiEBQRghEAy6AQsCQCABIgQgAkcNAEGQASEQDNQCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUGXz4CAAGotAABHDbwBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGQASEQDNQCCyAAQQA2AgAgEEEBaiEBQRchEAy5AQsCQCABIgQgAkcNAEGRASEQDNMCCyACIARrIAAoAgAiAWohFCAEIAFrQQZqIRACQANAIAQtAAAgAUGaz4CAAGotAABHDbsBIAFBBkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGRASEQDNMCCyAAQQA2AgAgEEEBaiEBQRUhEAy4AQsCQCABIgQgAkcNAEGSASEQDNICCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUGhz4CAAGotAABHDboBIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGSASEQDNICCyAAQQA2AgAgEEEBaiEBQR4hEAy3AQsCQCABIgQgAkcNAEGTASEQDNECCyAELQAAQcwARw24ASAEQQFqIQFBCiEQDLYBCwJAIAQgAkcNAEGUASEQDNACCwJAAkAgBC0AAEG/f2oODwC5AbkBuQG5AbkBuQG5AbkBuQG5AbkBuQG5AQG5AQsgBEEBaiEBQf4AIRAMtwILIARBAWohAUH/ACEQDLYCCwJAIAQgAkcNAEGVASEQDM8CCwJAAkAgBC0AAEG/f2oOAwC4AQG4AQsgBEEBaiEBQf0AIRAMtgILIARBAWohBEGAASEQDLUCCwJAIAQgAkcNAEGWASEQDM4CCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUGnz4CAAGotAABHDbYBIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGWASEQDM4CCyAAQQA2AgAgEEEBaiEBQQshEAyzAQsCQCAEIAJHDQBBlwEhEAzNAgsCQAJAAkACQCAELQAAQVNqDiMAuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AQG4AbgBuAG4AbgBArgBuAG4AQO4AQsgBEEBaiEBQfsAIRAMtgILIARBAWohAUH8ACEQDLUCCyAEQQFqIQRBgQEhEAy0AgsgBEEBaiEEQYIBIRAMswILAkAgBCACRw0AQZgBIRAMzAILIAIgBGsgACgCACIBaiEUIAQgAWtBBGohEAJAA0AgBC0AACABQanPgIAAai0AAEcNtAEgAUEERg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZgBIRAMzAILIABBADYCACAQQQFqIQFBGSEQDLEBCwJAIAQgAkcNAEGZASEQDMsCCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUGuz4CAAGotAABHDbMBIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGZASEQDMsCCyAAQQA2AgAgEEEBaiEBQQYhEAywAQsCQCAEIAJHDQBBmgEhEAzKAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFBtM+AgABqLQAARw2yASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBmgEhEAzKAgsgAEEANgIAIBBBAWohAUEcIRAMrwELAkAgBCACRw0AQZsBIRAMyQILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQbbPgIAAai0AAEcNsQEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZsBIRAMyQILIABBADYCACAQQQFqIQFBJyEQDK4BCwJAIAQgAkcNAEGcASEQDMgCCwJAAkAgBC0AAEGsf2oOAgABsQELIARBAWohBEGGASEQDK8CCyAEQQFqIQRBhwEhEAyuAgsCQCAEIAJHDQBBnQEhEAzHAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFBuM+AgABqLQAARw2vASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBnQEhEAzHAgsgAEEANgIAIBBBAWohAUEmIRAMrAELAkAgBCACRw0AQZ4BIRAMxgILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQbrPgIAAai0AAEcNrgEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZ4BIRAMxgILIABBADYCACAQQQFqIQFBAyEQDKsBCwJAIAQgAkcNAEGfASEQDMUCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHtz4CAAGotAABHDa0BIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGfASEQDMUCCyAAQQA2AgAgEEEBaiEBQQwhEAyqAQsCQCAEIAJHDQBBoAEhEAzEAgsgAiAEayAAKAIAIgFqIRQgBCABa0EDaiEQAkADQCAELQAAIAFBvM+AgABqLQAARw2sASABQQNGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBoAEhEAzEAgsgAEEANgIAIBBBAWohAUENIRAMqQELAkAgBCACRw0AQaEBIRAMwwILAkACQCAELQAAQbp/ag4LAKwBrAGsAawBrAGsAawBrAGsAQGsAQsgBEEBaiEEQYsBIRAMqgILIARBAWohBEGMASEQDKkCCwJAIAQgAkcNAEGiASEQDMICCyAELQAAQdAARw2pASAEQQFqIQQM6QELAkAgBCACRw0AQaMBIRAMwQILAkACQCAELQAAQbd/ag4HAaoBqgGqAaoBqgEAqgELIARBAWohBEGOASEQDKgCCyAEQQFqIQFBIiEQDKYBCwJAIAQgAkcNAEGkASEQDMACCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUHAz4CAAGotAABHDagBIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGkASEQDMACCyAAQQA2AgAgEEEBaiEBQR0hEAylAQsCQCAEIAJHDQBBpQEhEAy/AgsCQAJAIAQtAABBrn9qDgMAqAEBqAELIARBAWohBEGQASEQDKYCCyAEQQFqIQFBBCEQDKQBCwJAIAQgAkcNAEGmASEQDL4CCwJAAkACQAJAAkAgBC0AAEG/f2oOFQCqAaoBqgGqAaoBqgGqAaoBqgGqAQGqAaoBAqoBqgEDqgGqAQSqAQsgBEEBaiEEQYgBIRAMqAILIARBAWohBEGJASEQDKcCCyAEQQFqIQRBigEhEAymAgsgBEEBaiEEQY8BIRAMpQILIARBAWohBEGRASEQDKQCCwJAIAQgAkcNAEGnASEQDL0CCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHtz4CAAGotAABHDaUBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGnASEQDL0CCyAAQQA2AgAgEEEBaiEBQREhEAyiAQsCQCAEIAJHDQBBqAEhEAy8AgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFBws+AgABqLQAARw2kASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBqAEhEAy8AgsgAEEANgIAIBBBAWohAUEsIRAMoQELAkAgBCACRw0AQakBIRAMuwILIAIgBGsgACgCACIBaiEUIAQgAWtBBGohEAJAA0AgBC0AACABQcXPgIAAai0AAEcNowEgAUEERg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQakBIRAMuwILIABBADYCACAQQQFqIQFBKyEQDKABCwJAIAQgAkcNAEGqASEQDLoCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHKz4CAAGotAABHDaIBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGqASEQDLoCCyAAQQA2AgAgEEEBaiEBQRQhEAyfAQsCQCAEIAJHDQBBqwEhEAy5AgsCQAJAAkACQCAELQAAQb5/ag4PAAECpAGkAaQBpAGkAaQBpAGkAaQBpAGkAQOkAQsgBEEBaiEEQZMBIRAMogILIARBAWohBEGUASEQDKECCyAEQQFqIQRBlQEhEAygAgsgBEEBaiEEQZYBIRAMnwILAkAgBCACRw0AQawBIRAMuAILIAQtAABBxQBHDZ8BIARBAWohBAzgAQsCQCAEIAJHDQBBrQEhEAy3AgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFBzc+AgABqLQAARw2fASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBrQEhEAy3AgsgAEEANgIAIBBBAWohAUEOIRAMnAELAkAgBCACRw0AQa4BIRAMtgILIAQtAABB0ABHDZ0BIARBAWohAUElIRAMmwELAkAgBCACRw0AQa8BIRAMtQILIAIgBGsgACgCACIBaiEUIAQgAWtBCGohEAJAA0AgBC0AACABQdDPgIAAai0AAEcNnQEgAUEIRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQa8BIRAMtQILIABBADYCACAQQQFqIQFBKiEQDJoBCwJAIAQgAkcNAEGwASEQDLQCCwJAAkAgBC0AAEGrf2oOCwCdAZ0BnQGdAZ0BnQGdAZ0BnQEBnQELIARBAWohBEGaASEQDJsCCyAEQQFqIQRBmwEhEAyaAgsCQCAEIAJHDQBBsQEhEAyzAgsCQAJAIAQtAABBv39qDhQAnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBAZwBCyAEQQFqIQRBmQEhEAyaAgsgBEEBaiEEQZwBIRAMmQILAkAgBCACRw0AQbIBIRAMsgILIAIgBGsgACgCACIBaiEUIAQgAWtBA2ohEAJAA0AgBC0AACABQdnPgIAAai0AAEcNmgEgAUEDRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbIBIRAMsgILIABBADYCACAQQQFqIQFBISEQDJcBCwJAIAQgAkcNAEGzASEQDLECCyACIARrIAAoAgAiAWohFCAEIAFrQQZqIRACQANAIAQtAAAgAUHdz4CAAGotAABHDZkBIAFBBkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGzASEQDLECCyAAQQA2AgAgEEEBaiEBQRohEAyWAQsCQCAEIAJHDQBBtAEhEAywAgsCQAJAAkAgBC0AAEG7f2oOEQCaAZoBmgGaAZoBmgGaAZoBmgEBmgGaAZoBmgGaAQKaAQsgBEEBaiEEQZ0BIRAMmAILIARBAWohBEGeASEQDJcCCyAEQQFqIQRBnwEhEAyWAgsCQCAEIAJHDQBBtQEhEAyvAgsgAiAEayAAKAIAIgFqIRQgBCABa0EFaiEQAkADQCAELQAAIAFB5M+AgABqLQAARw2XASABQQVGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBtQEhEAyvAgsgAEEANgIAIBBBAWohAUEoIRAMlAELAkAgBCACRw0AQbYBIRAMrgILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQerPgIAAai0AAEcNlgEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbYBIRAMrgILIABBADYCACAQQQFqIQFBByEQDJMBCwJAIAQgAkcNAEG3ASEQDK0CCwJAAkAgBC0AAEG7f2oODgCWAZYBlgGWAZYBlgGWAZYBlgGWAZYBlgEBlgELIARBAWohBEGhASEQDJQCCyAEQQFqIQRBogEhEAyTAgsCQCAEIAJHDQBBuAEhEAysAgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFB7c+AgABqLQAARw2UASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBuAEhEAysAgsgAEEANgIAIBBBAWohAUESIRAMkQELAkAgBCACRw0AQbkBIRAMqwILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQfDPgIAAai0AAEcNkwEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbkBIRAMqwILIABBADYCACAQQQFqIQFBICEQDJABCwJAIAQgAkcNAEG6ASEQDKoCCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUHyz4CAAGotAABHDZIBIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEG6ASEQDKoCCyAAQQA2AgAgEEEBaiEBQQ8hEAyPAQsCQCAEIAJHDQBBuwEhEAypAgsCQAJAIAQtAABBt39qDgcAkgGSAZIBkgGSAQGSAQsgBEEBaiEEQaUBIRAMkAILIARBAWohBEGmASEQDI8CCwJAIAQgAkcNAEG8ASEQDKgCCyACIARrIAAoAgAiAWohFCAEIAFrQQdqIRACQANAIAQtAAAgAUH0z4CAAGotAABHDZABIAFBB0YNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEG8ASEQDKgCCyAAQQA2AgAgEEEBaiEBQRshEAyNAQsCQCAEIAJHDQBBvQEhEAynAgsCQAJAAkAgBC0AAEG+f2oOEgCRAZEBkQGRAZEBkQGRAZEBkQEBkQGRAZEBkQGRAZEBApEBCyAEQQFqIQRBpAEhEAyPAgsgBEEBaiEEQacBIRAMjgILIARBAWohBEGoASEQDI0CCwJAIAQgAkcNAEG+ASEQDKYCCyAELQAAQc4ARw2NASAEQQFqIQQMzwELAkAgBCACRw0AQb8BIRAMpQILAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkAgBC0AAEG/f2oOFQABAgOcAQQFBpwBnAGcAQcICQoLnAEMDQ4PnAELIARBAWohAUHoACEQDJoCCyAEQQFqIQFB6QAhEAyZAgsgBEEBaiEBQe4AIRAMmAILIARBAWohAUHyACEQDJcCCyAEQQFqIQFB8wAhEAyWAgsgBEEBaiEBQfYAIRAMlQILIARBAWohAUH3ACEQDJQCCyAEQQFqIQFB+gAhEAyTAgsgBEEBaiEEQYMBIRAMkgILIARBAWohBEGEASEQDJECCyAEQQFqIQRBhQEhEAyQAgsgBEEBaiEEQZIBIRAMjwILIARBAWohBEGYASEQDI4CCyAEQQFqIQRBoAEhEAyNAgsgBEEBaiEEQaMBIRAMjAILIARBAWohBEGqASEQDIsCCwJAIAQgAkYNACAAQZCAgIAANgIIIAAgBDYCBEGrASEQDIsCC0HAASEQDKMCCyAAIAUgAhCqgICAACIBDYsBIAUhAQxcCwJAIAYgAkYNACAGQQFqIQUMjQELQcIBIRAMoQILA0ACQCAQLQAAQXZqDgSMAQAAjwEACyAQQQFqIhAgAkcNAAtBwwEhEAygAgsCQCAHIAJGDQAgAEGRgICAADYCCCAAIAc2AgQgByEBQQEhEAyHAgtBxAEhEAyfAgsCQCAHIAJHDQBBxQEhEAyfAgsCQAJAIActAABBdmoOBAHOAc4BAM4BCyAHQQFqIQYMjQELIAdBAWohBQyJAQsCQCAHIAJHDQBBxgEhEAyeAgsCQAJAIActAABBdmoOFwGPAY8BAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAQCPAQsgB0EBaiEHC0GwASEQDIQCCwJAIAggAkcNAEHIASEQDJ0CCyAILQAAQSBHDY0BIABBADsBMiAIQQFqIQFBswEhEAyDAgsgASEXAkADQCAXIgcgAkYNASAHLQAAQVBqQf8BcSIQQQpPDcwBAkAgAC8BMiIUQZkzSw0AIAAgFEEKbCIUOwEyIBBB//8DcyAUQf7/A3FJDQAgB0EBaiEXIAAgFCAQaiIQOwEyIBBB//8DcUHoB0kNAQsLQQAhECAAQQA2AhwgAEHBiYCAADYCECAAQQ02AgwgACAHQQFqNgIUDJwCC0HHASEQDJsCCyAAIAggAhCugICAACIQRQ3KASAQQRVHDYwBIABByAE2AhwgACAINgIUIABByZeAgAA2AhAgAEEVNgIMQQAhEAyaAgsCQCAJIAJHDQBBzAEhEAyaAgtBACEUQQEhF0EBIRZBACEQAkACQAJAAkACQAJAAkACQAJAIAktAABBUGoOCpYBlQEAAQIDBAUGCJcBC0ECIRAMBgtBAyEQDAULQQQhEAwEC0EFIRAMAwtBBiEQDAILQQchEAwBC0EIIRALQQAhF0EAIRZBACEUDI4BC0EJIRBBASEUQQAhF0EAIRYMjQELAkAgCiACRw0AQc4BIRAMmQILIAotAABBLkcNjgEgCkEBaiEJDMoBCyALIAJHDY4BQdABIRAMlwILAkAgCyACRg0AIABBjoCAgAA2AgggACALNgIEQbcBIRAM/gELQdEBIRAMlgILAkAgBCACRw0AQdIBIRAMlgILIAIgBGsgACgCACIQaiEUIAQgEGtBBGohCwNAIAQtAAAgEEH8z4CAAGotAABHDY4BIBBBBEYN6QEgEEEBaiEQIARBAWoiBCACRw0ACyAAIBQ2AgBB0gEhEAyVAgsgACAMIAIQrICAgAAiAQ2NASAMIQEMuAELAkAgBCACRw0AQdQBIRAMlAILIAIgBGsgACgCACIQaiEUIAQgEGtBAWohDANAIAQtAAAgEEGB0ICAAGotAABHDY8BIBBBAUYNjgEgEEEBaiEQIARBAWoiBCACRw0ACyAAIBQ2AgBB1AEhEAyTAgsCQCAEIAJHDQBB1gEhEAyTAgsgAiAEayAAKAIAIhBqIRQgBCAQa0ECaiELA0AgBC0AACAQQYPQgIAAai0AAEcNjgEgEEECRg2QASAQQQFqIRAgBEEBaiIEIAJHDQALIAAgFDYCAEHWASEQDJICCwJAIAQgAkcNAEHXASEQDJICCwJAAkAgBC0AAEG7f2oOEACPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BAY8BCyAEQQFqIQRBuwEhEAz5AQsgBEEBaiEEQbwBIRAM+AELAkAgBCACRw0AQdgBIRAMkQILIAQtAABByABHDYwBIARBAWohBAzEAQsCQCAEIAJGDQAgAEGQgICAADYCCCAAIAQ2AgRBvgEhEAz3AQtB2QEhEAyPAgsCQCAEIAJHDQBB2gEhEAyPAgsgBC0AAEHIAEYNwwEgAEEBOgAoDLkBCyAAQQI6AC8gACAEIAIQpoCAgAAiEA2NAUHCASEQDPQBCyAALQAoQX9qDgK3AbkBuAELA0ACQCAELQAAQXZqDgQAjgGOAQCOAQsgBEEBaiIEIAJHDQALQd0BIRAMiwILIABBADoALyAALQAtQQRxRQ2EAgsgAEEAOgAvIABBAToANCABIQEMjAELIBBBFUYN2gEgAEEANgIcIAAgATYCFCAAQaeOgIAANgIQIABBEjYCDEEAIRAMiAILAkAgACAQIAIQtICAgAAiBA0AIBAhAQyBAgsCQCAEQRVHDQAgAEEDNgIcIAAgEDYCFCAAQbCYgIAANgIQIABBFTYCDEEAIRAMiAILIABBADYCHCAAIBA2AhQgAEGnjoCAADYCECAAQRI2AgxBACEQDIcCCyAQQRVGDdYBIABBADYCHCAAIAE2AhQgAEHajYCAADYCECAAQRQ2AgxBACEQDIYCCyAAKAIEIRcgAEEANgIEIBAgEadqIhYhASAAIBcgECAWIBQbIhAQtYCAgAAiFEUNjQEgAEEHNgIcIAAgEDYCFCAAIBQ2AgxBACEQDIUCCyAAIAAvATBBgAFyOwEwIAEhAQtBKiEQDOoBCyAQQRVGDdEBIABBADYCHCAAIAE2AhQgAEGDjICAADYCECAAQRM2AgxBACEQDIICCyAQQRVGDc8BIABBADYCHCAAIAE2AhQgAEGaj4CAADYCECAAQSI2AgxBACEQDIECCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQt4CAgAAiEA0AIAFBAWohAQyNAQsgAEEMNgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDIACCyAQQRVGDcwBIABBADYCHCAAIAE2AhQgAEGaj4CAADYCECAAQSI2AgxBACEQDP8BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQt4CAgAAiEA0AIAFBAWohAQyMAQsgAEENNgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDP4BCyAQQRVGDckBIABBADYCHCAAIAE2AhQgAEHGjICAADYCECAAQSM2AgxBACEQDP0BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQuYCAgAAiEA0AIAFBAWohAQyLAQsgAEEONgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDPwBCyAAQQA2AhwgACABNgIUIABBwJWAgAA2AhAgAEECNgIMQQAhEAz7AQsgEEEVRg3FASAAQQA2AhwgACABNgIUIABBxoyAgAA2AhAgAEEjNgIMQQAhEAz6AQsgAEEQNgIcIAAgATYCFCAAIBA2AgxBACEQDPkBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQuYCAgAAiBA0AIAFBAWohAQzxAQsgAEERNgIcIAAgBDYCDCAAIAFBAWo2AhRBACEQDPgBCyAQQRVGDcEBIABBADYCHCAAIAE2AhQgAEHGjICAADYCECAAQSM2AgxBACEQDPcBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQuYCAgAAiEA0AIAFBAWohAQyIAQsgAEETNgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDPYBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQuYCAgAAiBA0AIAFBAWohAQztAQsgAEEUNgIcIAAgBDYCDCAAIAFBAWo2AhRBACEQDPUBCyAQQRVGDb0BIABBADYCHCAAIAE2AhQgAEGaj4CAADYCECAAQSI2AgxBACEQDPQBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQt4CAgAAiEA0AIAFBAWohAQyGAQsgAEEWNgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDPMBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQt4CAgAAiBA0AIAFBAWohAQzpAQsgAEEXNgIcIAAgBDYCDCAAIAFBAWo2AhRBACEQDPIBCyAAQQA2AhwgACABNgIUIABBzZOAgAA2AhAgAEEMNgIMQQAhEAzxAQtCASERCyAQQQFqIQECQCAAKQMgIhJC//////////8PVg0AIAAgEkIEhiARhDcDICABIQEMhAELIABBADYCHCAAIAE2AhQgAEGtiYCAADYCECAAQQw2AgxBACEQDO8BCyAAQQA2AhwgACAQNgIUIABBzZOAgAA2AhAgAEEMNgIMQQAhEAzuAQsgACgCBCEXIABBADYCBCAQIBGnaiIWIQEgACAXIBAgFiAUGyIQELWAgIAAIhRFDXMgAEEFNgIcIAAgEDYCFCAAIBQ2AgxBACEQDO0BCyAAQQA2AhwgACAQNgIUIABBqpyAgAA2AhAgAEEPNgIMQQAhEAzsAQsgACAQIAIQtICAgAAiAQ0BIBAhAQtBDiEQDNEBCwJAIAFBFUcNACAAQQI2AhwgACAQNgIUIABBsJiAgAA2AhAgAEEVNgIMQQAhEAzqAQsgAEEANgIcIAAgEDYCFCAAQaeOgIAANgIQIABBEjYCDEEAIRAM6QELIAFBAWohEAJAIAAvATAiAUGAAXFFDQACQCAAIBAgAhC7gICAACIBDQAgECEBDHALIAFBFUcNugEgAEEFNgIcIAAgEDYCFCAAQfmXgIAANgIQIABBFTYCDEEAIRAM6QELAkAgAUGgBHFBoARHDQAgAC0ALUECcQ0AIABBADYCHCAAIBA2AhQgAEGWk4CAADYCECAAQQQ2AgxBACEQDOkBCyAAIBAgAhC9gICAABogECEBAkACQAJAAkACQCAAIBAgAhCzgICAAA4WAgEABAQEBAQEBAQEBAQEBAQEBAQEAwQLIABBAToALgsgACAALwEwQcAAcjsBMCAQIQELQSYhEAzRAQsgAEEjNgIcIAAgEDYCFCAAQaWWgIAANgIQIABBFTYCDEEAIRAM6QELIABBADYCHCAAIBA2AhQgAEHVi4CAADYCECAAQRE2AgxBACEQDOgBCyAALQAtQQFxRQ0BQcMBIRAMzgELAkAgDSACRg0AA0ACQCANLQAAQSBGDQAgDSEBDMQBCyANQQFqIg0gAkcNAAtBJSEQDOcBC0ElIRAM5gELIAAoAgQhBCAAQQA2AgQgACAEIA0Qr4CAgAAiBEUNrQEgAEEmNgIcIAAgBDYCDCAAIA1BAWo2AhRBACEQDOUBCyAQQRVGDasBIABBADYCHCAAIAE2AhQgAEH9jYCAADYCECAAQR02AgxBACEQDOQBCyAAQSc2AhwgACABNgIUIAAgEDYCDEEAIRAM4wELIBAhAUEBIRQCQAJAAkACQAJAAkACQCAALQAsQX5qDgcGBQUDAQIABQsgACAALwEwQQhyOwEwDAMLQQIhFAwBC0EEIRQLIABBAToALCAAIAAvATAgFHI7ATALIBAhAQtBKyEQDMoBCyAAQQA2AhwgACAQNgIUIABBq5KAgAA2AhAgAEELNgIMQQAhEAziAQsgAEEANgIcIAAgATYCFCAAQeGPgIAANgIQIABBCjYCDEEAIRAM4QELIABBADoALCAQIQEMvQELIBAhAUEBIRQCQAJAAkACQAJAIAAtACxBe2oOBAMBAgAFCyAAIAAvATBBCHI7ATAMAwtBAiEUDAELQQQhFAsgAEEBOgAsIAAgAC8BMCAUcjsBMAsgECEBC0EpIRAMxQELIABBADYCHCAAIAE2AhQgAEHwlICAADYCECAAQQM2AgxBACEQDN0BCwJAIA4tAABBDUcNACAAKAIEIQEgAEEANgIEAkAgACABIA4QsYCAgAAiAQ0AIA5BAWohAQx1CyAAQSw2AhwgACABNgIMIAAgDkEBajYCFEEAIRAM3QELIAAtAC1BAXFFDQFBxAEhEAzDAQsCQCAOIAJHDQBBLSEQDNwBCwJAAkADQAJAIA4tAABBdmoOBAIAAAMACyAOQQFqIg4gAkcNAAtBLSEQDN0BCyAAKAIEIQEgAEEANgIEAkAgACABIA4QsYCAgAAiAQ0AIA4hAQx0CyAAQSw2AhwgACAONgIUIAAgATYCDEEAIRAM3AELIAAoAgQhASAAQQA2AgQCQCAAIAEgDhCxgICAACIBDQAgDkEBaiEBDHMLIABBLDYCHCAAIAE2AgwgACAOQQFqNgIUQQAhEAzbAQsgACgCBCEEIABBADYCBCAAIAQgDhCxgICAACIEDaABIA4hAQzOAQsgEEEsRw0BIAFBAWohEEEBIQECQAJAAkACQAJAIAAtACxBe2oOBAMBAgQACyAQIQEMBAtBAiEBDAELQQQhAQsgAEEBOgAsIAAgAC8BMCABcjsBMCAQIQEMAQsgACAALwEwQQhyOwEwIBAhAQtBOSEQDL8BCyAAQQA6ACwgASEBC0E0IRAMvQELIAAgAC8BMEEgcjsBMCABIQEMAgsgACgCBCEEIABBADYCBAJAIAAgBCABELGAgIAAIgQNACABIQEMxwELIABBNzYCHCAAIAE2AhQgACAENgIMQQAhEAzUAQsgAEEIOgAsIAEhAQtBMCEQDLkBCwJAIAAtAChBAUYNACABIQEMBAsgAC0ALUEIcUUNkwEgASEBDAMLIAAtADBBIHENlAFBxQEhEAy3AQsCQCAPIAJGDQACQANAAkAgDy0AAEFQaiIBQf8BcUEKSQ0AIA8hAUE1IRAMugELIAApAyAiEUKZs+bMmbPmzBlWDQEgACARQgp+IhE3AyAgESABrUL/AYMiEkJ/hVYNASAAIBEgEnw3AyAgD0EBaiIPIAJHDQALQTkhEAzRAQsgACgCBCECIABBADYCBCAAIAIgD0EBaiIEELGAgIAAIgINlQEgBCEBDMMBC0E5IRAMzwELAkAgAC8BMCIBQQhxRQ0AIAAtAChBAUcNACAALQAtQQhxRQ2QAQsgACABQff7A3FBgARyOwEwIA8hAQtBNyEQDLQBCyAAIAAvATBBEHI7ATAMqwELIBBBFUYNiwEgAEEANgIcIAAgATYCFCAAQfCOgIAANgIQIABBHDYCDEEAIRAMywELIABBwwA2AhwgACABNgIMIAAgDUEBajYCFEEAIRAMygELAkAgAS0AAEE6Rw0AIAAoAgQhECAAQQA2AgQCQCAAIBAgARCvgICAACIQDQAgAUEBaiEBDGMLIABBwwA2AhwgACAQNgIMIAAgAUEBajYCFEEAIRAMygELIABBADYCHCAAIAE2AhQgAEGxkYCAADYCECAAQQo2AgxBACEQDMkBCyAAQQA2AhwgACABNgIUIABBoJmAgAA2AhAgAEEeNgIMQQAhEAzIAQsgAEEANgIACyAAQYASOwEqIAAgF0EBaiIBIAIQqICAgAAiEA0BIAEhAQtBxwAhEAysAQsgEEEVRw2DASAAQdEANgIcIAAgATYCFCAAQeOXgIAANgIQIABBFTYCDEEAIRAMxAELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDF4LIABB0gA2AhwgACABNgIUIAAgEDYCDEEAIRAMwwELIABBADYCHCAAIBQ2AhQgAEHBqICAADYCECAAQQc2AgwgAEEANgIAQQAhEAzCAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMXQsgAEHTADYCHCAAIAE2AhQgACAQNgIMQQAhEAzBAQtBACEQIABBADYCHCAAIAE2AhQgAEGAkYCAADYCECAAQQk2AgwMwAELIBBBFUYNfSAAQQA2AhwgACABNgIUIABBlI2AgAA2AhAgAEEhNgIMQQAhEAy/AQtBASEWQQAhF0EAIRRBASEQCyAAIBA6ACsgAUEBaiEBAkACQCAALQAtQRBxDQACQAJAAkAgAC0AKg4DAQACBAsgFkUNAwwCCyAUDQEMAgsgF0UNAQsgACgCBCEQIABBADYCBAJAIAAgECABEK2AgIAAIhANACABIQEMXAsgAEHYADYCHCAAIAE2AhQgACAQNgIMQQAhEAy+AQsgACgCBCEEIABBADYCBAJAIAAgBCABEK2AgIAAIgQNACABIQEMrQELIABB2QA2AhwgACABNgIUIAAgBDYCDEEAIRAMvQELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARCtgICAACIEDQAgASEBDKsBCyAAQdoANgIcIAAgATYCFCAAIAQ2AgxBACEQDLwBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQrYCAgAAiBA0AIAEhAQypAQsgAEHcADYCHCAAIAE2AhQgACAENgIMQQAhEAy7AQsCQCABLQAAQVBqIhBB/wFxQQpPDQAgACAQOgAqIAFBAWohAUHPACEQDKIBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQrYCAgAAiBA0AIAEhAQynAQsgAEHeADYCHCAAIAE2AhQgACAENgIMQQAhEAy6AQsgAEEANgIAIBdBAWohAQJAIAAtAClBI08NACABIQEMWQsgAEEANgIcIAAgATYCFCAAQdOJgIAANgIQIABBCDYCDEEAIRAMuQELIABBADYCAAtBACEQIABBADYCHCAAIAE2AhQgAEGQs4CAADYCECAAQQg2AgwMtwELIABBADYCACAXQQFqIQECQCAALQApQSFHDQAgASEBDFYLIABBADYCHCAAIAE2AhQgAEGbioCAADYCECAAQQg2AgxBACEQDLYBCyAAQQA2AgAgF0EBaiEBAkAgAC0AKSIQQV1qQQtPDQAgASEBDFULAkAgEEEGSw0AQQEgEHRBygBxRQ0AIAEhAQxVC0EAIRAgAEEANgIcIAAgATYCFCAAQfeJgIAANgIQIABBCDYCDAy1AQsgEEEVRg1xIABBADYCHCAAIAE2AhQgAEG5jYCAADYCECAAQRo2AgxBACEQDLQBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxUCyAAQeUANgIcIAAgATYCFCAAIBA2AgxBACEQDLMBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxNCyAAQdIANgIcIAAgATYCFCAAIBA2AgxBACEQDLIBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxNCyAAQdMANgIcIAAgATYCFCAAIBA2AgxBACEQDLEBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxRCyAAQeUANgIcIAAgATYCFCAAIBA2AgxBACEQDLABCyAAQQA2AhwgACABNgIUIABBxoqAgAA2AhAgAEEHNgIMQQAhEAyvAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMSQsgAEHSADYCHCAAIAE2AhQgACAQNgIMQQAhEAyuAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMSQsgAEHTADYCHCAAIAE2AhQgACAQNgIMQQAhEAytAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMTQsgAEHlADYCHCAAIAE2AhQgACAQNgIMQQAhEAysAQsgAEEANgIcIAAgATYCFCAAQdyIgIAANgIQIABBBzYCDEEAIRAMqwELIBBBP0cNASABQQFqIQELQQUhEAyQAQtBACEQIABBADYCHCAAIAE2AhQgAEH9koCAADYCECAAQQc2AgwMqAELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDEILIABB0gA2AhwgACABNgIUIAAgEDYCDEEAIRAMpwELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDEILIABB0wA2AhwgACABNgIUIAAgEDYCDEEAIRAMpgELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDEYLIABB5QA2AhwgACABNgIUIAAgEDYCDEEAIRAMpQELIAAoAgQhASAAQQA2AgQCQCAAIAEgFBCngICAACIBDQAgFCEBDD8LIABB0gA2AhwgACAUNgIUIAAgATYCDEEAIRAMpAELIAAoAgQhASAAQQA2AgQCQCAAIAEgFBCngICAACIBDQAgFCEBDD8LIABB0wA2AhwgACAUNgIUIAAgATYCDEEAIRAMowELIAAoAgQhASAAQQA2AgQCQCAAIAEgFBCngICAACIBDQAgFCEBDEMLIABB5QA2AhwgACAUNgIUIAAgATYCDEEAIRAMogELIABBADYCHCAAIBQ2AhQgAEHDj4CAADYCECAAQQc2AgxBACEQDKEBCyAAQQA2AhwgACABNgIUIABBw4+AgAA2AhAgAEEHNgIMQQAhEAygAQtBACEQIABBADYCHCAAIBQ2AhQgAEGMnICAADYCECAAQQc2AgwMnwELIABBADYCHCAAIBQ2AhQgAEGMnICAADYCECAAQQc2AgxBACEQDJ4BCyAAQQA2AhwgACAUNgIUIABB/pGAgAA2AhAgAEEHNgIMQQAhEAydAQsgAEEANgIcIAAgATYCFCAAQY6bgIAANgIQIABBBjYCDEEAIRAMnAELIBBBFUYNVyAAQQA2AhwgACABNgIUIABBzI6AgAA2AhAgAEEgNgIMQQAhEAybAQsgAEEANgIAIBBBAWohAUEkIRALIAAgEDoAKSAAKAIEIRAgAEEANgIEIAAgECABEKuAgIAAIhANVCABIQEMPgsgAEEANgIAC0EAIRAgAEEANgIcIAAgBDYCFCAAQfGbgIAANgIQIABBBjYCDAyXAQsgAUEVRg1QIABBADYCHCAAIAU2AhQgAEHwjICAADYCECAAQRs2AgxBACEQDJYBCyAAKAIEIQUgAEEANgIEIAAgBSAQEKmAgIAAIgUNASAQQQFqIQULQa0BIRAMewsgAEHBATYCHCAAIAU2AgwgACAQQQFqNgIUQQAhEAyTAQsgACgCBCEGIABBADYCBCAAIAYgEBCpgICAACIGDQEgEEEBaiEGC0GuASEQDHgLIABBwgE2AhwgACAGNgIMIAAgEEEBajYCFEEAIRAMkAELIABBADYCHCAAIAc2AhQgAEGXi4CAADYCECAAQQ02AgxBACEQDI8BCyAAQQA2AhwgACAINgIUIABB45CAgAA2AhAgAEEJNgIMQQAhEAyOAQsgAEEANgIcIAAgCDYCFCAAQZSNgIAANgIQIABBITYCDEEAIRAMjQELQQEhFkEAIRdBACEUQQEhEAsgACAQOgArIAlBAWohCAJAAkAgAC0ALUEQcQ0AAkACQAJAIAAtACoOAwEAAgQLIBZFDQMMAgsgFA0BDAILIBdFDQELIAAoAgQhECAAQQA2AgQgACAQIAgQrYCAgAAiEEUNPSAAQckBNgIcIAAgCDYCFCAAIBA2AgxBACEQDIwBCyAAKAIEIQQgAEEANgIEIAAgBCAIEK2AgIAAIgRFDXYgAEHKATYCHCAAIAg2AhQgACAENgIMQQAhEAyLAQsgACgCBCEEIABBADYCBCAAIAQgCRCtgICAACIERQ10IABBywE2AhwgACAJNgIUIAAgBDYCDEEAIRAMigELIAAoAgQhBCAAQQA2AgQgACAEIAoQrYCAgAAiBEUNciAAQc0BNgIcIAAgCjYCFCAAIAQ2AgxBACEQDIkBCwJAIAstAABBUGoiEEH/AXFBCk8NACAAIBA6ACogC0EBaiEKQbYBIRAMcAsgACgCBCEEIABBADYCBCAAIAQgCxCtgICAACIERQ1wIABBzwE2AhwgACALNgIUIAAgBDYCDEEAIRAMiAELIABBADYCHCAAIAQ2AhQgAEGQs4CAADYCECAAQQg2AgwgAEEANgIAQQAhEAyHAQsgAUEVRg0/IABBADYCHCAAIAw2AhQgAEHMjoCAADYCECAAQSA2AgxBACEQDIYBCyAAQYEEOwEoIAAoAgQhECAAQgA3AwAgACAQIAxBAWoiDBCrgICAACIQRQ04IABB0wE2AhwgACAMNgIUIAAgEDYCDEEAIRAMhQELIABBADYCAAtBACEQIABBADYCHCAAIAQ2AhQgAEHYm4CAADYCECAAQQg2AgwMgwELIAAoAgQhECAAQgA3AwAgACAQIAtBAWoiCxCrgICAACIQDQFBxgEhEAxpCyAAQQI6ACgMVQsgAEHVATYCHCAAIAs2AhQgACAQNgIMQQAhEAyAAQsgEEEVRg03IABBADYCHCAAIAQ2AhQgAEGkjICAADYCECAAQRA2AgxBACEQDH8LIAAtADRBAUcNNCAAIAQgAhC8gICAACIQRQ00IBBBFUcNNSAAQdwBNgIcIAAgBDYCFCAAQdWWgIAANgIQIABBFTYCDEEAIRAMfgtBACEQIABBADYCHCAAQa+LgIAANgIQIABBAjYCDCAAIBRBAWo2AhQMfQtBACEQDGMLQQIhEAxiC0ENIRAMYQtBDyEQDGALQSUhEAxfC0ETIRAMXgtBFSEQDF0LQRYhEAxcC0EXIRAMWwtBGCEQDFoLQRkhEAxZC0EaIRAMWAtBGyEQDFcLQRwhEAxWC0EdIRAMVQtBHyEQDFQLQSEhEAxTC0EjIRAMUgtBxgAhEAxRC0EuIRAMUAtBLyEQDE8LQTshEAxOC0E9IRAMTQtByAAhEAxMC0HJACEQDEsLQcsAIRAMSgtBzAAhEAxJC0HOACEQDEgLQdEAIRAMRwtB1QAhEAxGC0HYACEQDEULQdkAIRAMRAtB2wAhEAxDC0HkACEQDEILQeUAIRAMQQtB8QAhEAxAC0H0ACEQDD8LQY0BIRAMPgtBlwEhEAw9C0GpASEQDDwLQawBIRAMOwtBwAEhEAw6C0G5ASEQDDkLQa8BIRAMOAtBsQEhEAw3C0GyASEQDDYLQbQBIRAMNQtBtQEhEAw0C0G6ASEQDDMLQb0BIRAMMgtBvwEhEAwxC0HBASEQDDALIABBADYCHCAAIAQ2AhQgAEHpi4CAADYCECAAQR82AgxBACEQDEgLIABB2wE2AhwgACAENgIUIABB+paAgAA2AhAgAEEVNgIMQQAhEAxHCyAAQfgANgIcIAAgDDYCFCAAQcqYgIAANgIQIABBFTYCDEEAIRAMRgsgAEHRADYCHCAAIAU2AhQgAEGwl4CAADYCECAAQRU2AgxBACEQDEULIABB+QA2AhwgACABNgIUIAAgEDYCDEEAIRAMRAsgAEH4ADYCHCAAIAE2AhQgAEHKmICAADYCECAAQRU2AgxBACEQDEMLIABB5AA2AhwgACABNgIUIABB45eAgAA2AhAgAEEVNgIMQQAhEAxCCyAAQdcANgIcIAAgATYCFCAAQcmXgIAANgIQIABBFTYCDEEAIRAMQQsgAEEANgIcIAAgATYCFCAAQbmNgIAANgIQIABBGjYCDEEAIRAMQAsgAEHCADYCHCAAIAE2AhQgAEHjmICAADYCECAAQRU2AgxBACEQDD8LIABBADYCBCAAIA8gDxCxgICAACIERQ0BIABBOjYCHCAAIAQ2AgwgACAPQQFqNgIUQQAhEAw+CyAAKAIEIQQgAEEANgIEAkAgACAEIAEQsYCAgAAiBEUNACAAQTs2AhwgACAENgIMIAAgAUEBajYCFEEAIRAMPgsgAUEBaiEBDC0LIA9BAWohAQwtCyAAQQA2AhwgACAPNgIUIABB5JKAgAA2AhAgAEEENgIMQQAhEAw7CyAAQTY2AhwgACAENgIUIAAgAjYCDEEAIRAMOgsgAEEuNgIcIAAgDjYCFCAAIAQ2AgxBACEQDDkLIABB0AA2AhwgACABNgIUIABBkZiAgAA2AhAgAEEVNgIMQQAhEAw4CyANQQFqIQEMLAsgAEEVNgIcIAAgATYCFCAAQYKZgIAANgIQIABBFTYCDEEAIRAMNgsgAEEbNgIcIAAgATYCFCAAQZGXgIAANgIQIABBFTYCDEEAIRAMNQsgAEEPNgIcIAAgATYCFCAAQZGXgIAANgIQIABBFTYCDEEAIRAMNAsgAEELNgIcIAAgATYCFCAAQZGXgIAANgIQIABBFTYCDEEAIRAMMwsgAEEaNgIcIAAgATYCFCAAQYKZgIAANgIQIABBFTYCDEEAIRAMMgsgAEELNgIcIAAgATYCFCAAQYKZgIAANgIQIABBFTYCDEEAIRAMMQsgAEEKNgIcIAAgATYCFCAAQeSWgIAANgIQIABBFTYCDEEAIRAMMAsgAEEeNgIcIAAgATYCFCAAQfmXgIAANgIQIABBFTYCDEEAIRAMLwsgAEEANgIcIAAgEDYCFCAAQdqNgIAANgIQIABBFDYCDEEAIRAMLgsgAEEENgIcIAAgATYCFCAAQbCYgIAANgIQIABBFTYCDEEAIRAMLQsgAEEANgIAIAtBAWohCwtBuAEhEAwSCyAAQQA2AgAgEEEBaiEBQfUAIRAMEQsgASEBAkAgAC0AKUEFRw0AQeMAIRAMEQtB4gAhEAwQC0EAIRAgAEEANgIcIABB5JGAgAA2AhAgAEEHNgIMIAAgFEEBajYCFAwoCyAAQQA2AgAgF0EBaiEBQcAAIRAMDgtBASEBCyAAIAE6ACwgAEEANgIAIBdBAWohAQtBKCEQDAsLIAEhAQtBOCEQDAkLAkAgASIPIAJGDQADQAJAIA8tAABBgL6AgABqLQAAIgFBAUYNACABQQJHDQMgD0EBaiEBDAQLIA9BAWoiDyACRw0AC0E+IRAMIgtBPiEQDCELIABBADoALCAPIQEMAQtBCyEQDAYLQTohEAwFCyABQQFqIQFBLSEQDAQLIAAgAToALCAAQQA2AgAgFkEBaiEBQQwhEAwDCyAAQQA2AgAgF0EBaiEBQQohEAwCCyAAQQA2AgALIABBADoALCANIQFBCSEQDAALC0EAIRAgAEEANgIcIAAgCzYCFCAAQc2QgIAANgIQIABBCTYCDAwXC0EAIRAgAEEANgIcIAAgCjYCFCAAQemKgIAANgIQIABBCTYCDAwWC0EAIRAgAEEANgIcIAAgCTYCFCAAQbeQgIAANgIQIABBCTYCDAwVC0EAIRAgAEEANgIcIAAgCDYCFCAAQZyRgIAANgIQIABBCTYCDAwUC0EAIRAgAEEANgIcIAAgATYCFCAAQc2QgIAANgIQIABBCTYCDAwTC0EAIRAgAEEANgIcIAAgATYCFCAAQemKgIAANgIQIABBCTYCDAwSC0EAIRAgAEEANgIcIAAgATYCFCAAQbeQgIAANgIQIABBCTYCDAwRC0EAIRAgAEEANgIcIAAgATYCFCAAQZyRgIAANgIQIABBCTYCDAwQC0EAIRAgAEEANgIcIAAgATYCFCAAQZeVgIAANgIQIABBDzYCDAwPC0EAIRAgAEEANgIcIAAgATYCFCAAQZeVgIAANgIQIABBDzYCDAwOC0EAIRAgAEEANgIcIAAgATYCFCAAQcCSgIAANgIQIABBCzYCDAwNC0EAIRAgAEEANgIcIAAgATYCFCAAQZWJgIAANgIQIABBCzYCDAwMC0EAIRAgAEEANgIcIAAgATYCFCAAQeGPgIAANgIQIABBCjYCDAwLC0EAIRAgAEEANgIcIAAgATYCFCAAQfuPgIAANgIQIABBCjYCDAwKC0EAIRAgAEEANgIcIAAgATYCFCAAQfGZgIAANgIQIABBAjYCDAwJC0EAIRAgAEEANgIcIAAgATYCFCAAQcSUgIAANgIQIABBAjYCDAwIC0EAIRAgAEEANgIcIAAgATYCFCAAQfKVgIAANgIQIABBAjYCDAwHCyAAQQI2AhwgACABNgIUIABBnJqAgAA2AhAgAEEWNgIMQQAhEAwGC0EBIRAMBQtB1AAhECABIgQgAkYNBCADQQhqIAAgBCACQdjCgIAAQQoQxYCAgAAgAygCDCEEIAMoAggOAwEEAgALEMqAgIAAAAsgAEEANgIcIABBtZqAgAA2AhAgAEEXNgIMIAAgBEEBajYCFEEAIRAMAgsgAEEANgIcIAAgBDYCFCAAQcqagIAANgIQIABBCTYCDEEAIRAMAQsCQCABIgQgAkcNAEEiIRAMAQsgAEGJgICAADYCCCAAIAQ2AgRBISEQCyADQRBqJICAgIAAIBALrwEBAn8gASgCACEGAkACQCACIANGDQAgBCAGaiEEIAYgA2ogAmshByACIAZBf3MgBWoiBmohBQNAAkAgAi0AACAELQAARg0AQQIhBAwDCwJAIAYNAEEAIQQgBSECDAMLIAZBf2ohBiAEQQFqIQQgAkEBaiICIANHDQALIAchBiADIQILIABBATYCACABIAY2AgAgACACNgIEDwsgAUEANgIAIAAgBDYCACAAIAI2AgQLCgAgABDHgICAAAvyNgELfyOAgICAAEEQayIBJICAgIAAAkBBACgCoNCAgAANAEEAEMuAgIAAQYDUhIAAayICQdkASQ0AQQAhAwJAQQAoAuDTgIAAIgQNAEEAQn83AuzTgIAAQQBCgICEgICAwAA3AuTTgIAAQQAgAUEIakFwcUHYqtWqBXMiBDYC4NOAgABBAEEANgL004CAAEEAQQA2AsTTgIAAC0EAIAI2AszTgIAAQQBBgNSEgAA2AsjTgIAAQQBBgNSEgAA2ApjQgIAAQQAgBDYCrNCAgABBAEF/NgKo0ICAAANAIANBxNCAgABqIANBuNCAgABqIgQ2AgAgBCADQbDQgIAAaiIFNgIAIANBvNCAgABqIAU2AgAgA0HM0ICAAGogA0HA0ICAAGoiBTYCACAFIAQ2AgAgA0HU0ICAAGogA0HI0ICAAGoiBDYCACAEIAU2AgAgA0HQ0ICAAGogBDYCACADQSBqIgNBgAJHDQALQYDUhIAAQXhBgNSEgABrQQ9xQQBBgNSEgABBCGpBD3EbIgNqIgRBBGogAkFIaiIFIANrIgNBAXI2AgBBAEEAKALw04CAADYCpNCAgABBACADNgKU0ICAAEEAIAQ2AqDQgIAAQYDUhIAAIAVqQTg2AgQLAkACQAJAAkACQAJAAkACQAJAAkACQAJAIABB7AFLDQACQEEAKAKI0ICAACIGQRAgAEETakFwcSAAQQtJGyICQQN2IgR2IgNBA3FFDQACQAJAIANBAXEgBHJBAXMiBUEDdCIEQbDQgIAAaiIDIARBuNCAgABqKAIAIgQoAggiAkcNAEEAIAZBfiAFd3E2AojQgIAADAELIAMgAjYCCCACIAM2AgwLIARBCGohAyAEIAVBA3QiBUEDcjYCBCAEIAVqIgQgBCgCBEEBcjYCBAwMCyACQQAoApDQgIAAIgdNDQECQCADRQ0AAkACQCADIAR0QQIgBHQiA0EAIANrcnEiA0EAIANrcUF/aiIDIANBDHZBEHEiA3YiBEEFdkEIcSIFIANyIAQgBXYiA0ECdkEEcSIEciADIAR2IgNBAXZBAnEiBHIgAyAEdiIDQQF2QQFxIgRyIAMgBHZqIgRBA3QiA0Gw0ICAAGoiBSADQbjQgIAAaigCACIDKAIIIgBHDQBBACAGQX4gBHdxIgY2AojQgIAADAELIAUgADYCCCAAIAU2AgwLIAMgAkEDcjYCBCADIARBA3QiBGogBCACayIFNgIAIAMgAmoiACAFQQFyNgIEAkAgB0UNACAHQXhxQbDQgIAAaiECQQAoApzQgIAAIQQCQAJAIAZBASAHQQN2dCIIcQ0AQQAgBiAIcjYCiNCAgAAgAiEIDAELIAIoAgghCAsgCCAENgIMIAIgBDYCCCAEIAI2AgwgBCAINgIICyADQQhqIQNBACAANgKc0ICAAEEAIAU2ApDQgIAADAwLQQAoAozQgIAAIglFDQEgCUEAIAlrcUF/aiIDIANBDHZBEHEiA3YiBEEFdkEIcSIFIANyIAQgBXYiA0ECdkEEcSIEciADIAR2IgNBAXZBAnEiBHIgAyAEdiIDQQF2QQFxIgRyIAMgBHZqQQJ0QbjSgIAAaigCACIAKAIEQXhxIAJrIQQgACEFAkADQAJAIAUoAhAiAw0AIAVBFGooAgAiA0UNAgsgAygCBEF4cSACayIFIAQgBSAESSIFGyEEIAMgACAFGyEAIAMhBQwACwsgACgCGCEKAkAgACgCDCIIIABGDQAgACgCCCIDQQAoApjQgIAASRogCCADNgIIIAMgCDYCDAwLCwJAIABBFGoiBSgCACIDDQAgACgCECIDRQ0DIABBEGohBQsDQCAFIQsgAyIIQRRqIgUoAgAiAw0AIAhBEGohBSAIKAIQIgMNAAsgC0EANgIADAoLQX8hAiAAQb9/Sw0AIABBE2oiA0FwcSECQQAoAozQgIAAIgdFDQBBACELAkAgAkGAAkkNAEEfIQsgAkH///8HSw0AIANBCHYiAyADQYD+P2pBEHZBCHEiA3QiBCAEQYDgH2pBEHZBBHEiBHQiBSAFQYCAD2pBEHZBAnEiBXRBD3YgAyAEciAFcmsiA0EBdCACIANBFWp2QQFxckEcaiELC0EAIAJrIQQCQAJAAkACQCALQQJ0QbjSgIAAaigCACIFDQBBACEDQQAhCAwBC0EAIQMgAkEAQRkgC0EBdmsgC0EfRht0IQBBACEIA0ACQCAFKAIEQXhxIAJrIgYgBE8NACAGIQQgBSEIIAYNAEEAIQQgBSEIIAUhAwwDCyADIAVBFGooAgAiBiAGIAUgAEEddkEEcWpBEGooAgAiBUYbIAMgBhshAyAAQQF0IQAgBQ0ACwsCQCADIAhyDQBBACEIQQIgC3QiA0EAIANrciAHcSIDRQ0DIANBACADa3FBf2oiAyADQQx2QRBxIgN2IgVBBXZBCHEiACADciAFIAB2IgNBAnZBBHEiBXIgAyAFdiIDQQF2QQJxIgVyIAMgBXYiA0EBdkEBcSIFciADIAV2akECdEG40oCAAGooAgAhAwsgA0UNAQsDQCADKAIEQXhxIAJrIgYgBEkhAAJAIAMoAhAiBQ0AIANBFGooAgAhBQsgBiAEIAAbIQQgAyAIIAAbIQggBSEDIAUNAAsLIAhFDQAgBEEAKAKQ0ICAACACa08NACAIKAIYIQsCQCAIKAIMIgAgCEYNACAIKAIIIgNBACgCmNCAgABJGiAAIAM2AgggAyAANgIMDAkLAkAgCEEUaiIFKAIAIgMNACAIKAIQIgNFDQMgCEEQaiEFCwNAIAUhBiADIgBBFGoiBSgCACIDDQAgAEEQaiEFIAAoAhAiAw0ACyAGQQA2AgAMCAsCQEEAKAKQ0ICAACIDIAJJDQBBACgCnNCAgAAhBAJAAkAgAyACayIFQRBJDQAgBCACaiIAIAVBAXI2AgRBACAFNgKQ0ICAAEEAIAA2ApzQgIAAIAQgA2ogBTYCACAEIAJBA3I2AgQMAQsgBCADQQNyNgIEIAQgA2oiAyADKAIEQQFyNgIEQQBBADYCnNCAgABBAEEANgKQ0ICAAAsgBEEIaiEDDAoLAkBBACgClNCAgAAiACACTQ0AQQAoAqDQgIAAIgMgAmoiBCAAIAJrIgVBAXI2AgRBACAFNgKU0ICAAEEAIAQ2AqDQgIAAIAMgAkEDcjYCBCADQQhqIQMMCgsCQAJAQQAoAuDTgIAARQ0AQQAoAujTgIAAIQQMAQtBAEJ/NwLs04CAAEEAQoCAhICAgMAANwLk04CAAEEAIAFBDGpBcHFB2KrVqgVzNgLg04CAAEEAQQA2AvTTgIAAQQBBADYCxNOAgABBgIAEIQQLQQAhAwJAIAQgAkHHAGoiB2oiBkEAIARrIgtxIgggAksNAEEAQTA2AvjTgIAADAoLAkBBACgCwNOAgAAiA0UNAAJAQQAoArjTgIAAIgQgCGoiBSAETQ0AIAUgA00NAQtBACEDQQBBMDYC+NOAgAAMCgtBAC0AxNOAgABBBHENBAJAAkACQEEAKAKg0ICAACIERQ0AQcjTgIAAIQMDQAJAIAMoAgAiBSAESw0AIAUgAygCBGogBEsNAwsgAygCCCIDDQALC0EAEMuAgIAAIgBBf0YNBSAIIQYCQEEAKALk04CAACIDQX9qIgQgAHFFDQAgCCAAayAEIABqQQAgA2txaiEGCyAGIAJNDQUgBkH+////B0sNBQJAQQAoAsDTgIAAIgNFDQBBACgCuNOAgAAiBCAGaiIFIARNDQYgBSADSw0GCyAGEMuAgIAAIgMgAEcNAQwHCyAGIABrIAtxIgZB/v///wdLDQQgBhDLgICAACIAIAMoAgAgAygCBGpGDQMgACEDCwJAIANBf0YNACACQcgAaiAGTQ0AAkAgByAGa0EAKALo04CAACIEakEAIARrcSIEQf7///8HTQ0AIAMhAAwHCwJAIAQQy4CAgABBf0YNACAEIAZqIQYgAyEADAcLQQAgBmsQy4CAgAAaDAQLIAMhACADQX9HDQUMAwtBACEIDAcLQQAhAAwFCyAAQX9HDQILQQBBACgCxNOAgABBBHI2AsTTgIAACyAIQf7///8HSw0BIAgQy4CAgAAhAEEAEMuAgIAAIQMgAEF/Rg0BIANBf0YNASAAIANPDQEgAyAAayIGIAJBOGpNDQELQQBBACgCuNOAgAAgBmoiAzYCuNOAgAACQCADQQAoArzTgIAATQ0AQQAgAzYCvNOAgAALAkACQAJAAkBBACgCoNCAgAAiBEUNAEHI04CAACEDA0AgACADKAIAIgUgAygCBCIIakYNAiADKAIIIgMNAAwDCwsCQAJAQQAoApjQgIAAIgNFDQAgACADTw0BC0EAIAA2ApjQgIAAC0EAIQNBACAGNgLM04CAAEEAIAA2AsjTgIAAQQBBfzYCqNCAgABBAEEAKALg04CAADYCrNCAgABBAEEANgLU04CAAANAIANBxNCAgABqIANBuNCAgABqIgQ2AgAgBCADQbDQgIAAaiIFNgIAIANBvNCAgABqIAU2AgAgA0HM0ICAAGogA0HA0ICAAGoiBTYCACAFIAQ2AgAgA0HU0ICAAGogA0HI0ICAAGoiBDYCACAEIAU2AgAgA0HQ0ICAAGogBDYCACADQSBqIgNBgAJHDQALIABBeCAAa0EPcUEAIABBCGpBD3EbIgNqIgQgBkFIaiIFIANrIgNBAXI2AgRBAEEAKALw04CAADYCpNCAgABBACADNgKU0ICAAEEAIAQ2AqDQgIAAIAAgBWpBODYCBAwCCyADLQAMQQhxDQAgBCAFSQ0AIAQgAE8NACAEQXggBGtBD3FBACAEQQhqQQ9xGyIFaiIAQQAoApTQgIAAIAZqIgsgBWsiBUEBcjYCBCADIAggBmo2AgRBAEEAKALw04CAADYCpNCAgABBACAFNgKU0ICAAEEAIAA2AqDQgIAAIAQgC2pBODYCBAwBCwJAIABBACgCmNCAgAAiCE8NAEEAIAA2ApjQgIAAIAAhCAsgACAGaiEFQcjTgIAAIQMCQAJAAkACQAJAAkACQANAIAMoAgAgBUYNASADKAIIIgMNAAwCCwsgAy0ADEEIcUUNAQtByNOAgAAhAwNAAkAgAygCACIFIARLDQAgBSADKAIEaiIFIARLDQMLIAMoAgghAwwACwsgAyAANgIAIAMgAygCBCAGajYCBCAAQXggAGtBD3FBACAAQQhqQQ9xG2oiCyACQQNyNgIEIAVBeCAFa0EPcUEAIAVBCGpBD3EbaiIGIAsgAmoiAmshAwJAIAYgBEcNAEEAIAI2AqDQgIAAQQBBACgClNCAgAAgA2oiAzYClNCAgAAgAiADQQFyNgIEDAMLAkAgBkEAKAKc0ICAAEcNAEEAIAI2ApzQgIAAQQBBACgCkNCAgAAgA2oiAzYCkNCAgAAgAiADQQFyNgIEIAIgA2ogAzYCAAwDCwJAIAYoAgQiBEEDcUEBRw0AIARBeHEhBwJAAkAgBEH/AUsNACAGKAIIIgUgBEEDdiIIQQN0QbDQgIAAaiIARhoCQCAGKAIMIgQgBUcNAEEAQQAoAojQgIAAQX4gCHdxNgKI0ICAAAwCCyAEIABGGiAEIAU2AgggBSAENgIMDAELIAYoAhghCQJAAkAgBigCDCIAIAZGDQAgBigCCCIEIAhJGiAAIAQ2AgggBCAANgIMDAELAkAgBkEUaiIEKAIAIgUNACAGQRBqIgQoAgAiBQ0AQQAhAAwBCwNAIAQhCCAFIgBBFGoiBCgCACIFDQAgAEEQaiEEIAAoAhAiBQ0ACyAIQQA2AgALIAlFDQACQAJAIAYgBigCHCIFQQJ0QbjSgIAAaiIEKAIARw0AIAQgADYCACAADQFBAEEAKAKM0ICAAEF+IAV3cTYCjNCAgAAMAgsgCUEQQRQgCSgCECAGRhtqIAA2AgAgAEUNAQsgACAJNgIYAkAgBigCECIERQ0AIAAgBDYCECAEIAA2AhgLIAYoAhQiBEUNACAAQRRqIAQ2AgAgBCAANgIYCyAHIANqIQMgBiAHaiIGKAIEIQQLIAYgBEF+cTYCBCACIANqIAM2AgAgAiADQQFyNgIEAkAgA0H/AUsNACADQXhxQbDQgIAAaiEEAkACQEEAKAKI0ICAACIFQQEgA0EDdnQiA3ENAEEAIAUgA3I2AojQgIAAIAQhAwwBCyAEKAIIIQMLIAMgAjYCDCAEIAI2AgggAiAENgIMIAIgAzYCCAwDC0EfIQQCQCADQf///wdLDQAgA0EIdiIEIARBgP4/akEQdkEIcSIEdCIFIAVBgOAfakEQdkEEcSIFdCIAIABBgIAPakEQdkECcSIAdEEPdiAEIAVyIAByayIEQQF0IAMgBEEVanZBAXFyQRxqIQQLIAIgBDYCHCACQgA3AhAgBEECdEG40oCAAGohBQJAQQAoAozQgIAAIgBBASAEdCIIcQ0AIAUgAjYCAEEAIAAgCHI2AozQgIAAIAIgBTYCGCACIAI2AgggAiACNgIMDAMLIANBAEEZIARBAXZrIARBH0YbdCEEIAUoAgAhAANAIAAiBSgCBEF4cSADRg0CIARBHXYhACAEQQF0IQQgBSAAQQRxakEQaiIIKAIAIgANAAsgCCACNgIAIAIgBTYCGCACIAI2AgwgAiACNgIIDAILIABBeCAAa0EPcUEAIABBCGpBD3EbIgNqIgsgBkFIaiIIIANrIgNBAXI2AgQgACAIakE4NgIEIAQgBUE3IAVrQQ9xQQAgBUFJakEPcRtqQUFqIgggCCAEQRBqSRsiCEEjNgIEQQBBACgC8NOAgAA2AqTQgIAAQQAgAzYClNCAgABBACALNgKg0ICAACAIQRBqQQApAtDTgIAANwIAIAhBACkCyNOAgAA3AghBACAIQQhqNgLQ04CAAEEAIAY2AszTgIAAQQAgADYCyNOAgABBAEEANgLU04CAACAIQSRqIQMDQCADQQc2AgAgA0EEaiIDIAVJDQALIAggBEYNAyAIIAgoAgRBfnE2AgQgCCAIIARrIgA2AgAgBCAAQQFyNgIEAkAgAEH/AUsNACAAQXhxQbDQgIAAaiEDAkACQEEAKAKI0ICAACIFQQEgAEEDdnQiAHENAEEAIAUgAHI2AojQgIAAIAMhBQwBCyADKAIIIQULIAUgBDYCDCADIAQ2AgggBCADNgIMIAQgBTYCCAwEC0EfIQMCQCAAQf///wdLDQAgAEEIdiIDIANBgP4/akEQdkEIcSIDdCIFIAVBgOAfakEQdkEEcSIFdCIIIAhBgIAPakEQdkECcSIIdEEPdiADIAVyIAhyayIDQQF0IAAgA0EVanZBAXFyQRxqIQMLIAQgAzYCHCAEQgA3AhAgA0ECdEG40oCAAGohBQJAQQAoAozQgIAAIghBASADdCIGcQ0AIAUgBDYCAEEAIAggBnI2AozQgIAAIAQgBTYCGCAEIAQ2AgggBCAENgIMDAQLIABBAEEZIANBAXZrIANBH0YbdCEDIAUoAgAhCANAIAgiBSgCBEF4cSAARg0DIANBHXYhCCADQQF0IQMgBSAIQQRxakEQaiIGKAIAIggNAAsgBiAENgIAIAQgBTYCGCAEIAQ2AgwgBCAENgIIDAMLIAUoAggiAyACNgIMIAUgAjYCCCACQQA2AhggAiAFNgIMIAIgAzYCCAsgC0EIaiEDDAULIAUoAggiAyAENgIMIAUgBDYCCCAEQQA2AhggBCAFNgIMIAQgAzYCCAtBACgClNCAgAAiAyACTQ0AQQAoAqDQgIAAIgQgAmoiBSADIAJrIgNBAXI2AgRBACADNgKU0ICAAEEAIAU2AqDQgIAAIAQgAkEDcjYCBCAEQQhqIQMMAwtBACEDQQBBMDYC+NOAgAAMAgsCQCALRQ0AAkACQCAIIAgoAhwiBUECdEG40oCAAGoiAygCAEcNACADIAA2AgAgAA0BQQAgB0F+IAV3cSIHNgKM0ICAAAwCCyALQRBBFCALKAIQIAhGG2ogADYCACAARQ0BCyAAIAs2AhgCQCAIKAIQIgNFDQAgACADNgIQIAMgADYCGAsgCEEUaigCACIDRQ0AIABBFGogAzYCACADIAA2AhgLAkACQCAEQQ9LDQAgCCAEIAJqIgNBA3I2AgQgCCADaiIDIAMoAgRBAXI2AgQMAQsgCCACaiIAIARBAXI2AgQgCCACQQNyNgIEIAAgBGogBDYCAAJAIARB/wFLDQAgBEF4cUGw0ICAAGohAwJAAkBBACgCiNCAgAAiBUEBIARBA3Z0IgRxDQBBACAFIARyNgKI0ICAACADIQQMAQsgAygCCCEECyAEIAA2AgwgAyAANgIIIAAgAzYCDCAAIAQ2AggMAQtBHyEDAkAgBEH///8HSw0AIARBCHYiAyADQYD+P2pBEHZBCHEiA3QiBSAFQYDgH2pBEHZBBHEiBXQiAiACQYCAD2pBEHZBAnEiAnRBD3YgAyAFciACcmsiA0EBdCAEIANBFWp2QQFxckEcaiEDCyAAIAM2AhwgAEIANwIQIANBAnRBuNKAgABqIQUCQCAHQQEgA3QiAnENACAFIAA2AgBBACAHIAJyNgKM0ICAACAAIAU2AhggACAANgIIIAAgADYCDAwBCyAEQQBBGSADQQF2ayADQR9GG3QhAyAFKAIAIQICQANAIAIiBSgCBEF4cSAERg0BIANBHXYhAiADQQF0IQMgBSACQQRxakEQaiIGKAIAIgINAAsgBiAANgIAIAAgBTYCGCAAIAA2AgwgACAANgIIDAELIAUoAggiAyAANgIMIAUgADYCCCAAQQA2AhggACAFNgIMIAAgAzYCCAsgCEEIaiEDDAELAkAgCkUNAAJAAkAgACAAKAIcIgVBAnRBuNKAgABqIgMoAgBHDQAgAyAINgIAIAgNAUEAIAlBfiAFd3E2AozQgIAADAILIApBEEEUIAooAhAgAEYbaiAINgIAIAhFDQELIAggCjYCGAJAIAAoAhAiA0UNACAIIAM2AhAgAyAINgIYCyAAQRRqKAIAIgNFDQAgCEEUaiADNgIAIAMgCDYCGAsCQAJAIARBD0sNACAAIAQgAmoiA0EDcjYCBCAAIANqIgMgAygCBEEBcjYCBAwBCyAAIAJqIgUgBEEBcjYCBCAAIAJBA3I2AgQgBSAEaiAENgIAAkAgB0UNACAHQXhxQbDQgIAAaiECQQAoApzQgIAAIQMCQAJAQQEgB0EDdnQiCCAGcQ0AQQAgCCAGcjYCiNCAgAAgAiEIDAELIAIoAgghCAsgCCADNgIMIAIgAzYCCCADIAI2AgwgAyAINgIIC0EAIAU2ApzQgIAAQQAgBDYCkNCAgAALIABBCGohAwsgAUEQaiSAgICAACADCwoAIAAQyYCAgAAL4g0BB38CQCAARQ0AIABBeGoiASAAQXxqKAIAIgJBeHEiAGohAwJAIAJBAXENACACQQNxRQ0BIAEgASgCACICayIBQQAoApjQgIAAIgRJDQEgAiAAaiEAAkAgAUEAKAKc0ICAAEYNAAJAIAJB/wFLDQAgASgCCCIEIAJBA3YiBUEDdEGw0ICAAGoiBkYaAkAgASgCDCICIARHDQBBAEEAKAKI0ICAAEF+IAV3cTYCiNCAgAAMAwsgAiAGRhogAiAENgIIIAQgAjYCDAwCCyABKAIYIQcCQAJAIAEoAgwiBiABRg0AIAEoAggiAiAESRogBiACNgIIIAIgBjYCDAwBCwJAIAFBFGoiAigCACIEDQAgAUEQaiICKAIAIgQNAEEAIQYMAQsDQCACIQUgBCIGQRRqIgIoAgAiBA0AIAZBEGohAiAGKAIQIgQNAAsgBUEANgIACyAHRQ0BAkACQCABIAEoAhwiBEECdEG40oCAAGoiAigCAEcNACACIAY2AgAgBg0BQQBBACgCjNCAgABBfiAEd3E2AozQgIAADAMLIAdBEEEUIAcoAhAgAUYbaiAGNgIAIAZFDQILIAYgBzYCGAJAIAEoAhAiAkUNACAGIAI2AhAgAiAGNgIYCyABKAIUIgJFDQEgBkEUaiACNgIAIAIgBjYCGAwBCyADKAIEIgJBA3FBA0cNACADIAJBfnE2AgRBACAANgKQ0ICAACABIABqIAA2AgAgASAAQQFyNgIEDwsgASADTw0AIAMoAgQiAkEBcUUNAAJAAkAgAkECcQ0AAkAgA0EAKAKg0ICAAEcNAEEAIAE2AqDQgIAAQQBBACgClNCAgAAgAGoiADYClNCAgAAgASAAQQFyNgIEIAFBACgCnNCAgABHDQNBAEEANgKQ0ICAAEEAQQA2ApzQgIAADwsCQCADQQAoApzQgIAARw0AQQAgATYCnNCAgABBAEEAKAKQ0ICAACAAaiIANgKQ0ICAACABIABBAXI2AgQgASAAaiAANgIADwsgAkF4cSAAaiEAAkACQCACQf8BSw0AIAMoAggiBCACQQN2IgVBA3RBsNCAgABqIgZGGgJAIAMoAgwiAiAERw0AQQBBACgCiNCAgABBfiAFd3E2AojQgIAADAILIAIgBkYaIAIgBDYCCCAEIAI2AgwMAQsgAygCGCEHAkACQCADKAIMIgYgA0YNACADKAIIIgJBACgCmNCAgABJGiAGIAI2AgggAiAGNgIMDAELAkAgA0EUaiICKAIAIgQNACADQRBqIgIoAgAiBA0AQQAhBgwBCwNAIAIhBSAEIgZBFGoiAigCACIEDQAgBkEQaiECIAYoAhAiBA0ACyAFQQA2AgALIAdFDQACQAJAIAMgAygCHCIEQQJ0QbjSgIAAaiICKAIARw0AIAIgBjYCACAGDQFBAEEAKAKM0ICAAEF+IAR3cTYCjNCAgAAMAgsgB0EQQRQgBygCECADRhtqIAY2AgAgBkUNAQsgBiAHNgIYAkAgAygCECICRQ0AIAYgAjYCECACIAY2AhgLIAMoAhQiAkUNACAGQRRqIAI2AgAgAiAGNgIYCyABIABqIAA2AgAgASAAQQFyNgIEIAFBACgCnNCAgABHDQFBACAANgKQ0ICAAA8LIAMgAkF+cTYCBCABIABqIAA2AgAgASAAQQFyNgIECwJAIABB/wFLDQAgAEF4cUGw0ICAAGohAgJAAkBBACgCiNCAgAAiBEEBIABBA3Z0IgBxDQBBACAEIAByNgKI0ICAACACIQAMAQsgAigCCCEACyAAIAE2AgwgAiABNgIIIAEgAjYCDCABIAA2AggPC0EfIQICQCAAQf///wdLDQAgAEEIdiICIAJBgP4/akEQdkEIcSICdCIEIARBgOAfakEQdkEEcSIEdCIGIAZBgIAPakEQdkECcSIGdEEPdiACIARyIAZyayICQQF0IAAgAkEVanZBAXFyQRxqIQILIAEgAjYCHCABQgA3AhAgAkECdEG40oCAAGohBAJAAkBBACgCjNCAgAAiBkEBIAJ0IgNxDQAgBCABNgIAQQAgBiADcjYCjNCAgAAgASAENgIYIAEgATYCCCABIAE2AgwMAQsgAEEAQRkgAkEBdmsgAkEfRht0IQIgBCgCACEGAkADQCAGIgQoAgRBeHEgAEYNASACQR12IQYgAkEBdCECIAQgBkEEcWpBEGoiAygCACIGDQALIAMgATYCACABIAQ2AhggASABNgIMIAEgATYCCAwBCyAEKAIIIgAgATYCDCAEIAE2AgggAUEANgIYIAEgBDYCDCABIAA2AggLQQBBACgCqNCAgABBf2oiAUF/IAEbNgKo0ICAAAsLBAAAAAtOAAJAIAANAD8AQRB0DwsCQCAAQf//A3ENACAAQX9MDQACQCAAQRB2QAAiAEF/Rw0AQQBBMDYC+NOAgABBfw8LIABBEHQPCxDKgICAAAAL8gICA38BfgJAIAJFDQAgACABOgAAIAIgAGoiA0F/aiABOgAAIAJBA0kNACAAIAE6AAIgACABOgABIANBfWogAToAACADQX5qIAE6AAAgAkEHSQ0AIAAgAToAAyADQXxqIAE6AAAgAkEJSQ0AIABBACAAa0EDcSIEaiIDIAFB/wFxQYGChAhsIgE2AgAgAyACIARrQXxxIgRqIgJBfGogATYCACAEQQlJDQAgAyABNgIIIAMgATYCBCACQXhqIAE2AgAgAkF0aiABNgIAIARBGUkNACADIAE2AhggAyABNgIUIAMgATYCECADIAE2AgwgAkFwaiABNgIAIAJBbGogATYCACACQWhqIAE2AgAgAkFkaiABNgIAIAQgA0EEcUEYciIFayICQSBJDQAgAa1CgYCAgBB+IQYgAyAFaiEBA0AgASAGNwMYIAEgBjcDECABIAY3AwggASAGNwMAIAFBIGohASACQWBqIgJBH0sNAAsLIAALC45IAQBBgAgLhkgBAAAAAgAAAAMAAAAAAAAAAAAAAAQAAAAFAAAAAAAAAAAAAAAGAAAABwAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEludmFsaWQgY2hhciBpbiB1cmwgcXVlcnkAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9ib2R5AENvbnRlbnQtTGVuZ3RoIG92ZXJmbG93AENodW5rIHNpemUgb3ZlcmZsb3cAUmVzcG9uc2Ugb3ZlcmZsb3cASW52YWxpZCBtZXRob2QgZm9yIEhUVFAveC54IHJlcXVlc3QASW52YWxpZCBtZXRob2QgZm9yIFJUU1AveC54IHJlcXVlc3QARXhwZWN0ZWQgU09VUkNFIG1ldGhvZCBmb3IgSUNFL3gueCByZXF1ZXN0AEludmFsaWQgY2hhciBpbiB1cmwgZnJhZ21lbnQgc3RhcnQARXhwZWN0ZWQgZG90AFNwYW4gY2FsbGJhY2sgZXJyb3IgaW4gb25fc3RhdHVzAEludmFsaWQgcmVzcG9uc2Ugc3RhdHVzAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMAVXNlciBjYWxsYmFjayBlcnJvcgBgb25fcmVzZXRgIGNhbGxiYWNrIGVycm9yAGBvbl9jaHVua19oZWFkZXJgIGNhbGxiYWNrIGVycm9yAGBvbl9tZXNzYWdlX2JlZ2luYCBjYWxsYmFjayBlcnJvcgBgb25fY2h1bmtfZXh0ZW5zaW9uX3ZhbHVlYCBjYWxsYmFjayBlcnJvcgBgb25fc3RhdHVzX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fdmVyc2lvbl9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX3VybF9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX2NodW5rX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25faGVhZGVyX3ZhbHVlX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fbWVzc2FnZV9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX21ldGhvZF9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX2hlYWRlcl9maWVsZF9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX2NodW5rX2V4dGVuc2lvbl9uYW1lYCBjYWxsYmFjayBlcnJvcgBVbmV4cGVjdGVkIGNoYXIgaW4gdXJsIHNlcnZlcgBJbnZhbGlkIGhlYWRlciB2YWx1ZSBjaGFyAEludmFsaWQgaGVhZGVyIGZpZWxkIGNoYXIAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl92ZXJzaW9uAEludmFsaWQgbWlub3IgdmVyc2lvbgBJbnZhbGlkIG1ham9yIHZlcnNpb24ARXhwZWN0ZWQgc3BhY2UgYWZ0ZXIgdmVyc2lvbgBFeHBlY3RlZCBDUkxGIGFmdGVyIHZlcnNpb24ASW52YWxpZCBIVFRQIHZlcnNpb24ASW52YWxpZCBoZWFkZXIgdG9rZW4AU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl91cmwASW52YWxpZCBjaGFyYWN0ZXJzIGluIHVybABVbmV4cGVjdGVkIHN0YXJ0IGNoYXIgaW4gdXJsAERvdWJsZSBAIGluIHVybABFbXB0eSBDb250ZW50LUxlbmd0aABJbnZhbGlkIGNoYXJhY3RlciBpbiBDb250ZW50LUxlbmd0aABEdXBsaWNhdGUgQ29udGVudC1MZW5ndGgASW52YWxpZCBjaGFyIGluIHVybCBwYXRoAENvbnRlbnQtTGVuZ3RoIGNhbid0IGJlIHByZXNlbnQgd2l0aCBUcmFuc2Zlci1FbmNvZGluZwBJbnZhbGlkIGNoYXJhY3RlciBpbiBjaHVuayBzaXplAFNwYW4gY2FsbGJhY2sgZXJyb3IgaW4gb25faGVhZGVyX3ZhbHVlAFNwYW4gY2FsbGJhY2sgZXJyb3IgaW4gb25fY2h1bmtfZXh0ZW5zaW9uX3ZhbHVlAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMgdmFsdWUATWlzc2luZyBleHBlY3RlZCBMRiBhZnRlciBoZWFkZXIgdmFsdWUASW52YWxpZCBgVHJhbnNmZXItRW5jb2RpbmdgIGhlYWRlciB2YWx1ZQBJbnZhbGlkIGNoYXJhY3RlciBpbiBjaHVuayBleHRlbnNpb25zIHF1b3RlIHZhbHVlAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMgcXVvdGVkIHZhbHVlAFBhdXNlZCBieSBvbl9oZWFkZXJzX2NvbXBsZXRlAEludmFsaWQgRU9GIHN0YXRlAG9uX3Jlc2V0IHBhdXNlAG9uX2NodW5rX2hlYWRlciBwYXVzZQBvbl9tZXNzYWdlX2JlZ2luIHBhdXNlAG9uX2NodW5rX2V4dGVuc2lvbl92YWx1ZSBwYXVzZQBvbl9zdGF0dXNfY29tcGxldGUgcGF1c2UAb25fdmVyc2lvbl9jb21wbGV0ZSBwYXVzZQBvbl91cmxfY29tcGxldGUgcGF1c2UAb25fY2h1bmtfY29tcGxldGUgcGF1c2UAb25faGVhZGVyX3ZhbHVlX2NvbXBsZXRlIHBhdXNlAG9uX21lc3NhZ2VfY29tcGxldGUgcGF1c2UAb25fbWV0aG9kX2NvbXBsZXRlIHBhdXNlAG9uX2hlYWRlcl9maWVsZF9jb21wbGV0ZSBwYXVzZQBvbl9jaHVua19leHRlbnNpb25fbmFtZSBwYXVzZQBVbmV4cGVjdGVkIHNwYWNlIGFmdGVyIHN0YXJ0IGxpbmUAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9jaHVua19leHRlbnNpb25fbmFtZQBJbnZhbGlkIGNoYXJhY3RlciBpbiBjaHVuayBleHRlbnNpb25zIG5hbWUAUGF1c2Ugb24gQ09OTkVDVC9VcGdyYWRlAFBhdXNlIG9uIFBSSS9VcGdyYWRlAEV4cGVjdGVkIEhUVFAvMiBDb25uZWN0aW9uIFByZWZhY2UAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9tZXRob2QARXhwZWN0ZWQgc3BhY2UgYWZ0ZXIgbWV0aG9kAFNwYW4gY2FsbGJhY2sgZXJyb3IgaW4gb25faGVhZGVyX2ZpZWxkAFBhdXNlZABJbnZhbGlkIHdvcmQgZW5jb3VudGVyZWQASW52YWxpZCBtZXRob2QgZW5jb3VudGVyZWQAVW5leHBlY3RlZCBjaGFyIGluIHVybCBzY2hlbWEAUmVxdWVzdCBoYXMgaW52YWxpZCBgVHJhbnNmZXItRW5jb2RpbmdgAFNXSVRDSF9QUk9YWQBVU0VfUFJPWFkATUtBQ1RJVklUWQBVTlBST0NFU1NBQkxFX0VOVElUWQBDT1BZAE1PVkVEX1BFUk1BTkVOVExZAFRPT19FQVJMWQBOT1RJRlkARkFJTEVEX0RFUEVOREVOQ1kAQkFEX0dBVEVXQVkAUExBWQBQVVQAQ0hFQ0tPVVQAR0FURVdBWV9USU1FT1VUAFJFUVVFU1RfVElNRU9VVABORVRXT1JLX0NPTk5FQ1RfVElNRU9VVABDT05ORUNUSU9OX1RJTUVPVVQATE9HSU5fVElNRU9VVABORVRXT1JLX1JFQURfVElNRU9VVABQT1NUAE1JU0RJUkVDVEVEX1JFUVVFU1QAQ0xJRU5UX0NMT1NFRF9SRVFVRVNUAENMSUVOVF9DTE9TRURfTE9BRF9CQUxBTkNFRF9SRVFVRVNUAEJBRF9SRVFVRVNUAEhUVFBfUkVRVUVTVF9TRU5UX1RPX0hUVFBTX1BPUlQAUkVQT1JUAElNX0FfVEVBUE9UAFJFU0VUX0NPTlRFTlQATk9fQ09OVEVOVABQQVJUSUFMX0NPTlRFTlQASFBFX0lOVkFMSURfQ09OU1RBTlQASFBFX0NCX1JFU0VUAEdFVABIUEVfU1RSSUNUAENPTkZMSUNUAFRFTVBPUkFSWV9SRURJUkVDVABQRVJNQU5FTlRfUkVESVJFQ1QAQ09OTkVDVABNVUxUSV9TVEFUVVMASFBFX0lOVkFMSURfU1RBVFVTAFRPT19NQU5ZX1JFUVVFU1RTAEVBUkxZX0hJTlRTAFVOQVZBSUxBQkxFX0ZPUl9MRUdBTF9SRUFTT05TAE9QVElPTlMAU1dJVENISU5HX1BST1RPQ09MUwBWQVJJQU5UX0FMU09fTkVHT1RJQVRFUwBNVUxUSVBMRV9DSE9JQ0VTAElOVEVSTkFMX1NFUlZFUl9FUlJPUgBXRUJfU0VSVkVSX1VOS05PV05fRVJST1IAUkFJTEdVTl9FUlJPUgBJREVOVElUWV9QUk9WSURFUl9BVVRIRU5USUNBVElPTl9FUlJPUgBTU0xfQ0VSVElGSUNBVEVfRVJST1IASU5WQUxJRF9YX0ZPUldBUkRFRF9GT1IAU0VUX1BBUkFNRVRFUgBHRVRfUEFSQU1FVEVSAEhQRV9VU0VSAFNFRV9PVEhFUgBIUEVfQ0JfQ0hVTktfSEVBREVSAE1LQ0FMRU5EQVIAU0VUVVAAV0VCX1NFUlZFUl9JU19ET1dOAFRFQVJET1dOAEhQRV9DTE9TRURfQ09OTkVDVElPTgBIRVVSSVNUSUNfRVhQSVJBVElPTgBESVNDT05ORUNURURfT1BFUkFUSU9OAE5PTl9BVVRIT1JJVEFUSVZFX0lORk9STUFUSU9OAEhQRV9JTlZBTElEX1ZFUlNJT04ASFBFX0NCX01FU1NBR0VfQkVHSU4AU0lURV9JU19GUk9aRU4ASFBFX0lOVkFMSURfSEVBREVSX1RPS0VOAElOVkFMSURfVE9LRU4ARk9SQklEREVOAEVOSEFOQ0VfWU9VUl9DQUxNAEhQRV9JTlZBTElEX1VSTABCTE9DS0VEX0JZX1BBUkVOVEFMX0NPTlRST0wATUtDT0wAQUNMAEhQRV9JTlRFUk5BTABSRVFVRVNUX0hFQURFUl9GSUVMRFNfVE9PX0xBUkdFX1VOT0ZGSUNJQUwASFBFX09LAFVOTElOSwBVTkxPQ0sAUFJJAFJFVFJZX1dJVEgASFBFX0lOVkFMSURfQ09OVEVOVF9MRU5HVEgASFBFX1VORVhQRUNURURfQ09OVEVOVF9MRU5HVEgARkxVU0gAUFJPUFBBVENIAE0tU0VBUkNIAFVSSV9UT09fTE9ORwBQUk9DRVNTSU5HAE1JU0NFTExBTkVPVVNfUEVSU0lTVEVOVF9XQVJOSU5HAE1JU0NFTExBTkVPVVNfV0FSTklORwBIUEVfSU5WQUxJRF9UUkFOU0ZFUl9FTkNPRElORwBFeHBlY3RlZCBDUkxGAEhQRV9JTlZBTElEX0NIVU5LX1NJWkUATU9WRQBDT05USU5VRQBIUEVfQ0JfU1RBVFVTX0NPTVBMRVRFAEhQRV9DQl9IRUFERVJTX0NPTVBMRVRFAEhQRV9DQl9WRVJTSU9OX0NPTVBMRVRFAEhQRV9DQl9VUkxfQ09NUExFVEUASFBFX0NCX0NIVU5LX0NPTVBMRVRFAEhQRV9DQl9IRUFERVJfVkFMVUVfQ09NUExFVEUASFBFX0NCX0NIVU5LX0VYVEVOU0lPTl9WQUxVRV9DT01QTEVURQBIUEVfQ0JfQ0hVTktfRVhURU5TSU9OX05BTUVfQ09NUExFVEUASFBFX0NCX01FU1NBR0VfQ09NUExFVEUASFBFX0NCX01FVEhPRF9DT01QTEVURQBIUEVfQ0JfSEVBREVSX0ZJRUxEX0NPTVBMRVRFAERFTEVURQBIUEVfSU5WQUxJRF9FT0ZfU1RBVEUASU5WQUxJRF9TU0xfQ0VSVElGSUNBVEUAUEFVU0UATk9fUkVTUE9OU0UAVU5TVVBQT1JURURfTUVESUFfVFlQRQBHT05FAE5PVF9BQ0NFUFRBQkxFAFNFUlZJQ0VfVU5BVkFJTEFCTEUAUkFOR0VfTk9UX1NBVElTRklBQkxFAE9SSUdJTl9JU19VTlJFQUNIQUJMRQBSRVNQT05TRV9JU19TVEFMRQBQVVJHRQBNRVJHRQBSRVFVRVNUX0hFQURFUl9GSUVMRFNfVE9PX0xBUkdFAFJFUVVFU1RfSEVBREVSX1RPT19MQVJHRQBQQVlMT0FEX1RPT19MQVJHRQBJTlNVRkZJQ0lFTlRfU1RPUkFHRQBIUEVfUEFVU0VEX1VQR1JBREUASFBFX1BBVVNFRF9IMl9VUEdSQURFAFNPVVJDRQBBTk5PVU5DRQBUUkFDRQBIUEVfVU5FWFBFQ1RFRF9TUEFDRQBERVNDUklCRQBVTlNVQlNDUklCRQBSRUNPUkQASFBFX0lOVkFMSURfTUVUSE9EAE5PVF9GT1VORABQUk9QRklORABVTkJJTkQAUkVCSU5EAFVOQVVUSE9SSVpFRABNRVRIT0RfTk9UX0FMTE9XRUQASFRUUF9WRVJTSU9OX05PVF9TVVBQT1JURUQAQUxSRUFEWV9SRVBPUlRFRABBQ0NFUFRFRABOT1RfSU1QTEVNRU5URUQATE9PUF9ERVRFQ1RFRABIUEVfQ1JfRVhQRUNURUQASFBFX0xGX0VYUEVDVEVEAENSRUFURUQASU1fVVNFRABIUEVfUEFVU0VEAFRJTUVPVVRfT0NDVVJFRABQQVlNRU5UX1JFUVVJUkVEAFBSRUNPTkRJVElPTl9SRVFVSVJFRABQUk9YWV9BVVRIRU5USUNBVElPTl9SRVFVSVJFRABORVRXT1JLX0FVVEhFTlRJQ0FUSU9OX1JFUVVJUkVEAExFTkdUSF9SRVFVSVJFRABTU0xfQ0VSVElGSUNBVEVfUkVRVUlSRUQAVVBHUkFERV9SRVFVSVJFRABQQUdFX0VYUElSRUQAUFJFQ09ORElUSU9OX0ZBSUxFRABFWFBFQ1RBVElPTl9GQUlMRUQAUkVWQUxJREFUSU9OX0ZBSUxFRABTU0xfSEFORFNIQUtFX0ZBSUxFRABMT0NLRUQAVFJBTlNGT1JNQVRJT05fQVBQTElFRABOT1RfTU9ESUZJRUQATk9UX0VYVEVOREVEAEJBTkRXSURUSF9MSU1JVF9FWENFRURFRABTSVRFX0lTX09WRVJMT0FERUQASEVBRABFeHBlY3RlZCBIVFRQLwAAXhMAACYTAAAwEAAA8BcAAJ0TAAAVEgAAORcAAPASAAAKEAAAdRIAAK0SAACCEwAATxQAAH8QAACgFQAAIxQAAIkSAACLFAAATRUAANQRAADPFAAAEBgAAMkWAADcFgAAwREAAOAXAAC7FAAAdBQAAHwVAADlFAAACBcAAB8QAABlFQAAoxQAACgVAAACFQAAmRUAACwQAACLGQAATw8AANQOAABqEAAAzhAAAAIXAACJDgAAbhMAABwTAABmFAAAVhcAAMETAADNEwAAbBMAAGgXAABmFwAAXxcAACITAADODwAAaQ4AANgOAABjFgAAyxMAAKoOAAAoFwAAJhcAAMUTAABdFgAA6BEAAGcTAABlEwAA8hYAAHMTAAAdFwAA+RYAAPMRAADPDgAAzhUAAAwSAACzEQAApREAAGEQAAAyFwAAuxMAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQIBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAIDAgICAgIAAAICAAICAAICAgICAgICAgIABAAAAAAAAgICAgICAgICAgICAgICAgICAgICAgICAgIAAAACAgICAgICAgICAgICAgICAgICAgICAgICAgICAgACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAACAAICAgICAAACAgACAgACAgICAgICAgICAAMABAAAAAICAgICAgICAgICAgICAgICAgICAgICAgICAAAAAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIAAgACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbG9zZWVlcC1hbGl2ZQAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEBAQEBAQEBAQEBAQIBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBY2h1bmtlZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQEAAQEBAQEAAAEBAAEBAAEBAQEBAQEBAQEAAAAAAAAAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABlY3Rpb25lbnQtbGVuZ3Rob25yb3h5LWNvbm5lY3Rpb24AAAAAAAAAAAAAAAAAAAByYW5zZmVyLWVuY29kaW5ncGdyYWRlDQoNCg0KU00NCg0KVFRQL0NFL1RTUC8AAAAAAAAAAAAAAAABAgABAwAAAAAAAAAAAAAAAAAAAAAAAAQBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAAAAAAAAAQIAAQMAAAAAAAAAAAAAAAAAAAAAAAAEAQEFAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAAAAAAAAAEAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAAAAAAAAAAAAAQAAAgAAAAAAAAAAAAAAAAAAAAAAAAMEAAAEBAQEBAQEBAQEBAUEBAQEBAQEBAQEBAQABAAGBwQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEAAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAEAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAADAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwAAAAAAAAMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAABAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAIAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMAAAAAAAADAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABOT1VOQ0VFQ0tPVVRORUNURVRFQ1JJQkVMVVNIRVRFQURTRUFSQ0hSR0VDVElWSVRZTEVOREFSVkVPVElGWVBUSU9OU0NIU0VBWVNUQVRDSEdFT1JESVJFQ1RPUlRSQ0hQQVJBTUVURVJVUkNFQlNDUklCRUFSRE9XTkFDRUlORE5LQ0tVQlNDUklCRUhUVFAvQURUUC8=";
+  }
+});
+
+// lib/llhttp/llhttp_simd-wasm.js
+var require_llhttp_simd_wasm = __commonJS({
+  "lib/llhttp/llhttp_simd-wasm.js"(exports2, module2) {
+    module2.exports = "AGFzbQEAAAABMAhgAX8Bf2ADf39/AX9gBH9/f38Bf2AAAGADf39/AGABfwBgAn9/AGAGf39/f39/AALLAQgDZW52GHdhc21fb25faGVhZGVyc19jb21wbGV0ZQACA2VudhV3YXNtX29uX21lc3NhZ2VfYmVnaW4AAANlbnYLd2FzbV9vbl91cmwAAQNlbnYOd2FzbV9vbl9zdGF0dXMAAQNlbnYUd2FzbV9vbl9oZWFkZXJfZmllbGQAAQNlbnYUd2FzbV9vbl9oZWFkZXJfdmFsdWUAAQNlbnYMd2FzbV9vbl9ib2R5AAEDZW52GHdhc21fb25fbWVzc2FnZV9jb21wbGV0ZQAAA0ZFAwMEAAAFAAAAAAAABQEFAAUFBQAABgAAAAAGBgYGAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAAABAQcAAAUFAwABBAUBcAESEgUDAQACBggBfwFBgNQECwfRBSIGbWVtb3J5AgALX2luaXRpYWxpemUACRlfX2luZGlyZWN0X2Z1bmN0aW9uX3RhYmxlAQALbGxodHRwX2luaXQAChhsbGh0dHBfc2hvdWxkX2tlZXBfYWxpdmUAQQxsbGh0dHBfYWxsb2MADAZtYWxsb2MARgtsbGh0dHBfZnJlZQANBGZyZWUASA9sbGh0dHBfZ2V0X3R5cGUADhVsbGh0dHBfZ2V0X2h0dHBfbWFqb3IADxVsbGh0dHBfZ2V0X2h0dHBfbWlub3IAEBFsbGh0dHBfZ2V0X21ldGhvZAARFmxsaHR0cF9nZXRfc3RhdHVzX2NvZGUAEhJsbGh0dHBfZ2V0X3VwZ3JhZGUAEwxsbGh0dHBfcmVzZXQAFA5sbGh0dHBfZXhlY3V0ZQAVFGxsaHR0cF9zZXR0aW5nc19pbml0ABYNbGxodHRwX2ZpbmlzaAAXDGxsaHR0cF9wYXVzZQAYDWxsaHR0cF9yZXN1bWUAGRtsbGh0dHBfcmVzdW1lX2FmdGVyX3VwZ3JhZGUAGhBsbGh0dHBfZ2V0X2Vycm5vABsXbGxodHRwX2dldF9lcnJvcl9yZWFzb24AHBdsbGh0dHBfc2V0X2Vycm9yX3JlYXNvbgAdFGxsaHR0cF9nZXRfZXJyb3JfcG9zAB4RbGxodHRwX2Vycm5vX25hbWUAHxJsbGh0dHBfbWV0aG9kX25hbWUAIBJsbGh0dHBfc3RhdHVzX25hbWUAIRpsbGh0dHBfc2V0X2xlbmllbnRfaGVhZGVycwAiIWxsaHR0cF9zZXRfbGVuaWVudF9jaHVua2VkX2xlbmd0aAAjHWxsaHR0cF9zZXRfbGVuaWVudF9rZWVwX2FsaXZlACQkbGxodHRwX3NldF9sZW5pZW50X3RyYW5zZmVyX2VuY29kaW5nACUYbGxodHRwX21lc3NhZ2VfbmVlZHNfZW9mAD8JFwEAQQELEQECAwQFCwYHNTk3MS8tJyspCrLgAkUCAAsIABCIgICAAAsZACAAEMKAgIAAGiAAIAI2AjggACABOgAoCxwAIAAgAC8BMiAALQAuIAAQwYCAgAAQgICAgAALKgEBf0HAABDGgICAACIBEMKAgIAAGiABQYCIgIAANgI4IAEgADoAKCABCwoAIAAQyICAgAALBwAgAC0AKAsHACAALQAqCwcAIAAtACsLBwAgAC0AKQsHACAALwEyCwcAIAAtAC4LRQEEfyAAKAIYIQEgAC0ALSECIAAtACghAyAAKAI4IQQgABDCgICAABogACAENgI4IAAgAzoAKCAAIAI6AC0gACABNgIYCxEAIAAgASABIAJqEMOAgIAACxAAIABBAEHcABDMgICAABoLZwEBf0EAIQECQCAAKAIMDQACQAJAAkACQCAALQAvDgMBAAMCCyAAKAI4IgFFDQAgASgCLCIBRQ0AIAAgARGAgICAAAAiAQ0DC0EADwsQyoCAgAAACyAAQcOWgIAANgIQQQ4hAQsgAQseAAJAIAAoAgwNACAAQdGbgIAANgIQIABBFTYCDAsLFgACQCAAKAIMQRVHDQAgAEEANgIMCwsWAAJAIAAoAgxBFkcNACAAQQA2AgwLCwcAIAAoAgwLBwAgACgCEAsJACAAIAE2AhALBwAgACgCFAsiAAJAIABBJEkNABDKgICAAAALIABBAnRBoLOAgABqKAIACyIAAkAgAEEuSQ0AEMqAgIAAAAsgAEECdEGwtICAAGooAgAL7gsBAX9B66iAgAAhAQJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIABBnH9qDvQDY2IAAWFhYWFhYQIDBAVhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhBgcICQoLDA0OD2FhYWFhEGFhYWFhYWFhYWFhEWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYRITFBUWFxgZGhthYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhHB0eHyAhIiMkJSYnKCkqKywtLi8wMTIzNDU2YTc4OTphYWFhYWFhYTthYWE8YWFhYT0+P2FhYWFhYWFhQGFhQWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYUJDREVGR0hJSktMTU5PUFFSU2FhYWFhYWFhVFVWV1hZWlthXF1hYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFeYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhX2BhC0Hhp4CAAA8LQaShgIAADwtBy6yAgAAPC0H+sYCAAA8LQcCkgIAADwtBq6SAgAAPC0GNqICAAA8LQeKmgIAADwtBgLCAgAAPC0G5r4CAAA8LQdekgIAADwtB75+AgAAPC0Hhn4CAAA8LQfqfgIAADwtB8qCAgAAPC0Gor4CAAA8LQa6ygIAADwtBiLCAgAAPC0Hsp4CAAA8LQYKigIAADwtBjp2AgAAPC0HQroCAAA8LQcqjgIAADwtBxbKAgAAPC0HfnICAAA8LQdKcgIAADwtBxKCAgAAPC0HXoICAAA8LQaKfgIAADwtB7a6AgAAPC0GrsICAAA8LQdSlgIAADwtBzK6AgAAPC0H6roCAAA8LQfyrgIAADwtB0rCAgAAPC0HxnYCAAA8LQbuggIAADwtB96uAgAAPC0GQsYCAAA8LQdexgIAADwtBoq2AgAAPC0HUp4CAAA8LQeCrgIAADwtBn6yAgAAPC0HrsYCAAA8LQdWfgIAADwtByrGAgAAPC0HepYCAAA8LQdSegIAADwtB9JyAgAAPC0GnsoCAAA8LQbGdgIAADwtBoJ2AgAAPC0G5sYCAAA8LQbywgIAADwtBkqGAgAAPC0GzpoCAAA8LQemsgIAADwtBrJ6AgAAPC0HUq4CAAA8LQfemgIAADwtBgKaAgAAPC0GwoYCAAA8LQf6egIAADwtBjaOAgAAPC0GJrYCAAA8LQfeigIAADwtBoLGAgAAPC0Gun4CAAA8LQcalgIAADwtB6J6AgAAPC0GTooCAAA8LQcKvgIAADwtBw52AgAAPC0GLrICAAA8LQeGdgIAADwtBja+AgAAPC0HqoYCAAA8LQbStgIAADwtB0q+AgAAPC0HfsoCAAA8LQdKygIAADwtB8LCAgAAPC0GpooCAAA8LQfmjgIAADwtBmZ6AgAAPC0G1rICAAA8LQZuwgIAADwtBkrKAgAAPC0G2q4CAAA8LQcKigIAADwtB+LKAgAAPC0GepYCAAA8LQdCigIAADwtBup6AgAAPC0GBnoCAAA8LEMqAgIAAAAtB1qGAgAAhAQsgAQsWACAAIAAtAC1B/gFxIAFBAEdyOgAtCxkAIAAgAC0ALUH9AXEgAUEAR0EBdHI6AC0LGQAgACAALQAtQfsBcSABQQBHQQJ0cjoALQsZACAAIAAtAC1B9wFxIAFBAEdBA3RyOgAtCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAgAiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCBCIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQcaRgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIwIgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAggiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEH2ioCAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCNCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIMIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABB7ZqAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAjgiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCECIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQZWQgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAI8IgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAhQiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEGqm4CAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCQCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIYIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABB7ZOAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAkQiBEUNACAAIAQRgICAgAAAIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCJCIERQ0AIAAgBBGAgICAAAAhAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIsIgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAigiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEH2iICAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCUCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIcIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABBwpmAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAkgiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCICIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQZSUgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAJMIgRFDQAgACAEEYCAgIAAACEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAlQiBEUNACAAIAQRgICAgAAAIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCWCIERQ0AIAAgBBGAgICAAAAhAwsgAwtFAQF/AkACQCAALwEwQRRxQRRHDQBBASEDIAAtAChBAUYNASAALwEyQeUARiEDDAELIAAtAClBBUYhAwsgACADOgAuQQAL/gEBA39BASEDAkAgAC8BMCIEQQhxDQAgACkDIEIAUiEDCwJAAkAgAC0ALkUNAEEBIQUgAC0AKUEFRg0BQQEhBSAEQcAAcUUgA3FBAUcNAQtBACEFIARBwABxDQBBAiEFIARB//8DcSIDQQhxDQACQCADQYAEcUUNAAJAIAAtAChBAUcNACAALQAtQQpxDQBBBQ8LQQQPCwJAIANBIHENAAJAIAAtAChBAUYNACAALwEyQf//A3EiAEGcf2pB5ABJDQAgAEHMAUYNACAAQbACRg0AQQQhBSAEQShxRQ0CIANBiARxQYAERg0CC0EADwtBAEEDIAApAyBQGyEFCyAFC2IBAn9BACEBAkAgAC0AKEEBRg0AIAAvATJB//8DcSICQZx/akHkAEkNACACQcwBRg0AIAJBsAJGDQAgAC8BMCIAQcAAcQ0AQQEhASAAQYgEcUGABEYNACAAQShxRSEBCyABC6cBAQN/AkACQAJAIAAtACpFDQAgAC0AK0UNAEEAIQMgAC8BMCIEQQJxRQ0BDAILQQAhAyAALwEwIgRBAXFFDQELQQEhAyAALQAoQQFGDQAgAC8BMkH//wNxIgVBnH9qQeQASQ0AIAVBzAFGDQAgBUGwAkYNACAEQcAAcQ0AQQAhAyAEQYgEcUGABEYNACAEQShxQQBHIQMLIABBADsBMCAAQQA6AC8gAwuZAQECfwJAAkACQCAALQAqRQ0AIAAtACtFDQBBACEBIAAvATAiAkECcUUNAQwCC0EAIQEgAC8BMCICQQFxRQ0BC0EBIQEgAC0AKEEBRg0AIAAvATJB//8DcSIAQZx/akHkAEkNACAAQcwBRg0AIABBsAJGDQAgAkHAAHENAEEAIQEgAkGIBHFBgARGDQAgAkEocUEARyEBCyABC0kBAXsgAEEQav0MAAAAAAAAAAAAAAAAAAAAACIB/QsDACAAIAH9CwMAIABBMGogAf0LAwAgAEEgaiAB/QsDACAAQd0BNgIcQQALewEBfwJAIAAoAgwiAw0AAkAgACgCBEUNACAAIAE2AgQLAkAgACABIAIQxICAgAAiAw0AIAAoAgwPCyAAIAM2AhxBACEDIAAoAgQiAUUNACAAIAEgAiAAKAIIEYGAgIAAACIBRQ0AIAAgAjYCFCAAIAE2AgwgASEDCyADC+TzAQMOfwN+BH8jgICAgABBEGsiAySAgICAACABIQQgASEFIAEhBiABIQcgASEIIAEhCSABIQogASELIAEhDCABIQ0gASEOIAEhDwJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAAKAIcIhBBf2oO3QHaAQHZAQIDBAUGBwgJCgsMDQ7YAQ8Q1wEREtYBExQVFhcYGRob4AHfARwdHtUBHyAhIiMkJdQBJicoKSorLNMB0gEtLtEB0AEvMDEyMzQ1Njc4OTo7PD0+P0BBQkNERUbbAUdISUrPAc4BS80BTMwBTU5PUFFSU1RVVldYWVpbXF1eX2BhYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ent8fX5/gAGBAYIBgwGEAYUBhgGHAYgBiQGKAYsBjAGNAY4BjwGQAZEBkgGTAZQBlQGWAZcBmAGZAZoBmwGcAZ0BngGfAaABoQGiAaMBpAGlAaYBpwGoAakBqgGrAawBrQGuAa8BsAGxAbIBswG0AbUBtgG3AcsBygG4AckBuQHIAboBuwG8Ab0BvgG/AcABwQHCAcMBxAHFAcYBANwBC0EAIRAMxgELQQ4hEAzFAQtBDSEQDMQBC0EPIRAMwwELQRAhEAzCAQtBEyEQDMEBC0EUIRAMwAELQRUhEAy/AQtBFiEQDL4BC0EXIRAMvQELQRghEAy8AQtBGSEQDLsBC0EaIRAMugELQRshEAy5AQtBHCEQDLgBC0EIIRAMtwELQR0hEAy2AQtBICEQDLUBC0EfIRAMtAELQQchEAyzAQtBISEQDLIBC0EiIRAMsQELQR4hEAywAQtBIyEQDK8BC0ESIRAMrgELQREhEAytAQtBJCEQDKwBC0ElIRAMqwELQSYhEAyqAQtBJyEQDKkBC0HDASEQDKgBC0EpIRAMpwELQSshEAymAQtBLCEQDKUBC0EtIRAMpAELQS4hEAyjAQtBLyEQDKIBC0HEASEQDKEBC0EwIRAMoAELQTQhEAyfAQtBDCEQDJ4BC0ExIRAMnQELQTIhEAycAQtBMyEQDJsBC0E5IRAMmgELQTUhEAyZAQtBxQEhEAyYAQtBCyEQDJcBC0E6IRAMlgELQTYhEAyVAQtBCiEQDJQBC0E3IRAMkwELQTghEAySAQtBPCEQDJEBC0E7IRAMkAELQT0hEAyPAQtBCSEQDI4BC0EoIRAMjQELQT4hEAyMAQtBPyEQDIsBC0HAACEQDIoBC0HBACEQDIkBC0HCACEQDIgBC0HDACEQDIcBC0HEACEQDIYBC0HFACEQDIUBC0HGACEQDIQBC0EqIRAMgwELQccAIRAMggELQcgAIRAMgQELQckAIRAMgAELQcoAIRAMfwtBywAhEAx+C0HNACEQDH0LQcwAIRAMfAtBzgAhEAx7C0HPACEQDHoLQdAAIRAMeQtB0QAhEAx4C0HSACEQDHcLQdMAIRAMdgtB1AAhEAx1C0HWACEQDHQLQdUAIRAMcwtBBiEQDHILQdcAIRAMcQtBBSEQDHALQdgAIRAMbwtBBCEQDG4LQdkAIRAMbQtB2gAhEAxsC0HbACEQDGsLQdwAIRAMagtBAyEQDGkLQd0AIRAMaAtB3gAhEAxnC0HfACEQDGYLQeEAIRAMZQtB4AAhEAxkC0HiACEQDGMLQeMAIRAMYgtBAiEQDGELQeQAIRAMYAtB5QAhEAxfC0HmACEQDF4LQecAIRAMXQtB6AAhEAxcC0HpACEQDFsLQeoAIRAMWgtB6wAhEAxZC0HsACEQDFgLQe0AIRAMVwtB7gAhEAxWC0HvACEQDFULQfAAIRAMVAtB8QAhEAxTC0HyACEQDFILQfMAIRAMUQtB9AAhEAxQC0H1ACEQDE8LQfYAIRAMTgtB9wAhEAxNC0H4ACEQDEwLQfkAIRAMSwtB+gAhEAxKC0H7ACEQDEkLQfwAIRAMSAtB/QAhEAxHC0H+ACEQDEYLQf8AIRAMRQtBgAEhEAxEC0GBASEQDEMLQYIBIRAMQgtBgwEhEAxBC0GEASEQDEALQYUBIRAMPwtBhgEhEAw+C0GHASEQDD0LQYgBIRAMPAtBiQEhEAw7C0GKASEQDDoLQYsBIRAMOQtBjAEhEAw4C0GNASEQDDcLQY4BIRAMNgtBjwEhEAw1C0GQASEQDDQLQZEBIRAMMwtBkgEhEAwyC0GTASEQDDELQZQBIRAMMAtBlQEhEAwvC0GWASEQDC4LQZcBIRAMLQtBmAEhEAwsC0GZASEQDCsLQZoBIRAMKgtBmwEhEAwpC0GcASEQDCgLQZ0BIRAMJwtBngEhEAwmC0GfASEQDCULQaABIRAMJAtBoQEhEAwjC0GiASEQDCILQaMBIRAMIQtBpAEhEAwgC0GlASEQDB8LQaYBIRAMHgtBpwEhEAwdC0GoASEQDBwLQakBIRAMGwtBqgEhEAwaC0GrASEQDBkLQawBIRAMGAtBrQEhEAwXC0GuASEQDBYLQQEhEAwVC0GvASEQDBQLQbABIRAMEwtBsQEhEAwSC0GzASEQDBELQbIBIRAMEAtBtAEhEAwPC0G1ASEQDA4LQbYBIRAMDQtBtwEhEAwMC0G4ASEQDAsLQbkBIRAMCgtBugEhEAwJC0G7ASEQDAgLQcYBIRAMBwtBvAEhEAwGC0G9ASEQDAULQb4BIRAMBAtBvwEhEAwDC0HAASEQDAILQcIBIRAMAQtBwQEhEAsDQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIBAOxwEAAQIDBAUGBwgJCgsMDQ4PEBESExQVFhcYGRobHB4fICEjJSg/QEFERUZHSElKS0xNT1BRUlPeA1dZW1xdYGJlZmdoaWprbG1vcHFyc3R1dnd4eXp7fH1+gAGCAYUBhgGHAYkBiwGMAY0BjgGPAZABkQGUAZUBlgGXAZgBmQGaAZsBnAGdAZ4BnwGgAaEBogGjAaQBpQGmAacBqAGpAaoBqwGsAa0BrgGvAbABsQGyAbMBtAG1AbYBtwG4AbkBugG7AbwBvQG+Ab8BwAHBAcIBwwHEAcUBxgHHAcgByQHKAcsBzAHNAc4BzwHQAdEB0gHTAdQB1QHWAdcB2AHZAdoB2wHcAd0B3gHgAeEB4gHjAeQB5QHmAecB6AHpAeoB6wHsAe0B7gHvAfAB8QHyAfMBmQKkArAC/gL+AgsgASIEIAJHDfMBQd0BIRAM/wMLIAEiECACRw3dAUHDASEQDP4DCyABIgEgAkcNkAFB9wAhEAz9AwsgASIBIAJHDYYBQe8AIRAM/AMLIAEiASACRw1/QeoAIRAM+wMLIAEiASACRw17QegAIRAM+gMLIAEiASACRw14QeYAIRAM+QMLIAEiASACRw0aQRghEAz4AwsgASIBIAJHDRRBEiEQDPcDCyABIgEgAkcNWUHFACEQDPYDCyABIgEgAkcNSkE/IRAM9QMLIAEiASACRw1IQTwhEAz0AwsgASIBIAJHDUFBMSEQDPMDCyAALQAuQQFGDesDDIcCCyAAIAEiASACEMCAgIAAQQFHDeYBIABCADcDIAznAQsgACABIgEgAhC0gICAACIQDecBIAEhAQz1AgsCQCABIgEgAkcNAEEGIRAM8AMLIAAgAUEBaiIBIAIQu4CAgAAiEA3oASABIQEMMQsgAEIANwMgQRIhEAzVAwsgASIQIAJHDStBHSEQDO0DCwJAIAEiASACRg0AIAFBAWohAUEQIRAM1AMLQQchEAzsAwsgAEIAIAApAyAiESACIAEiEGutIhJ9IhMgEyARVhs3AyAgESASViIURQ3lAUEIIRAM6wMLAkAgASIBIAJGDQAgAEGJgICAADYCCCAAIAE2AgQgASEBQRQhEAzSAwtBCSEQDOoDCyABIQEgACkDIFAN5AEgASEBDPICCwJAIAEiASACRw0AQQshEAzpAwsgACABQQFqIgEgAhC2gICAACIQDeUBIAEhAQzyAgsgACABIgEgAhC4gICAACIQDeUBIAEhAQzyAgsgACABIgEgAhC4gICAACIQDeYBIAEhAQwNCyAAIAEiASACELqAgIAAIhAN5wEgASEBDPACCwJAIAEiASACRw0AQQ8hEAzlAwsgAS0AACIQQTtGDQggEEENRw3oASABQQFqIQEM7wILIAAgASIBIAIQuoCAgAAiEA3oASABIQEM8gILA0ACQCABLQAAQfC1gIAAai0AACIQQQFGDQAgEEECRw3rASAAKAIEIRAgAEEANgIEIAAgECABQQFqIgEQuYCAgAAiEA3qASABIQEM9AILIAFBAWoiASACRw0AC0ESIRAM4gMLIAAgASIBIAIQuoCAgAAiEA3pASABIQEMCgsgASIBIAJHDQZBGyEQDOADCwJAIAEiASACRw0AQRYhEAzgAwsgAEGKgICAADYCCCAAIAE2AgQgACABIAIQuICAgAAiEA3qASABIQFBICEQDMYDCwJAIAEiASACRg0AA0ACQCABLQAAQfC3gIAAai0AACIQQQJGDQACQCAQQX9qDgTlAewBAOsB7AELIAFBAWohAUEIIRAMyAMLIAFBAWoiASACRw0AC0EVIRAM3wMLQRUhEAzeAwsDQAJAIAEtAABB8LmAgABqLQAAIhBBAkYNACAQQX9qDgTeAewB4AHrAewBCyABQQFqIgEgAkcNAAtBGCEQDN0DCwJAIAEiASACRg0AIABBi4CAgAA2AgggACABNgIEIAEhAUEHIRAMxAMLQRkhEAzcAwsgAUEBaiEBDAILAkAgASIUIAJHDQBBGiEQDNsDCyAUIQECQCAULQAAQXNqDhTdAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAgDuAgtBACEQIABBADYCHCAAQa+LgIAANgIQIABBAjYCDCAAIBRBAWo2AhQM2gMLAkAgAS0AACIQQTtGDQAgEEENRw3oASABQQFqIQEM5QILIAFBAWohAQtBIiEQDL8DCwJAIAEiECACRw0AQRwhEAzYAwtCACERIBAhASAQLQAAQVBqDjfnAeYBAQIDBAUGBwgAAAAAAAAACQoLDA0OAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPEBESExQAC0EeIRAMvQMLQgIhEQzlAQtCAyERDOQBC0IEIREM4wELQgUhEQziAQtCBiERDOEBC0IHIREM4AELQgghEQzfAQtCCSERDN4BC0IKIREM3QELQgshEQzcAQtCDCERDNsBC0INIREM2gELQg4hEQzZAQtCDyERDNgBC0IKIREM1wELQgshEQzWAQtCDCERDNUBC0INIREM1AELQg4hEQzTAQtCDyERDNIBC0IAIRECQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIBAtAABBUGoON+UB5AEAAQIDBAUGB+YB5gHmAeYB5gHmAeYBCAkKCwwN5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAQ4PEBESE+YBC0ICIREM5AELQgMhEQzjAQtCBCERDOIBC0IFIREM4QELQgYhEQzgAQtCByERDN8BC0IIIREM3gELQgkhEQzdAQtCCiERDNwBC0ILIREM2wELQgwhEQzaAQtCDSERDNkBC0IOIREM2AELQg8hEQzXAQtCCiERDNYBC0ILIREM1QELQgwhEQzUAQtCDSERDNMBC0IOIREM0gELQg8hEQzRAQsgAEIAIAApAyAiESACIAEiEGutIhJ9IhMgEyARVhs3AyAgESASViIURQ3SAUEfIRAMwAMLAkAgASIBIAJGDQAgAEGJgICAADYCCCAAIAE2AgQgASEBQSQhEAynAwtBICEQDL8DCyAAIAEiECACEL6AgIAAQX9qDgW2AQDFAgHRAdIBC0ERIRAMpAMLIABBAToALyAQIQEMuwMLIAEiASACRw3SAUEkIRAMuwMLIAEiDSACRw0eQcYAIRAMugMLIAAgASIBIAIQsoCAgAAiEA3UASABIQEMtQELIAEiECACRw0mQdAAIRAMuAMLAkAgASIBIAJHDQBBKCEQDLgDCyAAQQA2AgQgAEGMgICAADYCCCAAIAEgARCxgICAACIQDdMBIAEhAQzYAQsCQCABIhAgAkcNAEEpIRAMtwMLIBAtAAAiAUEgRg0UIAFBCUcN0wEgEEEBaiEBDBULAkAgASIBIAJGDQAgAUEBaiEBDBcLQSohEAy1AwsCQCABIhAgAkcNAEErIRAMtQMLAkAgEC0AACIBQQlGDQAgAUEgRw3VAQsgAC0ALEEIRg3TASAQIQEMkQMLAkAgASIBIAJHDQBBLCEQDLQDCyABLQAAQQpHDdUBIAFBAWohAQzJAgsgASIOIAJHDdUBQS8hEAyyAwsDQAJAIAEtAAAiEEEgRg0AAkAgEEF2ag4EANwB3AEA2gELIAEhAQzgAQsgAUEBaiIBIAJHDQALQTEhEAyxAwtBMiEQIAEiFCACRg2wAyACIBRrIAAoAgAiAWohFSAUIAFrQQNqIRYCQANAIBQtAAAiF0EgciAXIBdBv39qQf8BcUEaSRtB/wFxIAFB8LuAgABqLQAARw0BAkAgAUEDRw0AQQYhAQyWAwsgAUEBaiEBIBRBAWoiFCACRw0ACyAAIBU2AgAMsQMLIABBADYCACAUIQEM2QELQTMhECABIhQgAkYNrwMgAiAUayAAKAIAIgFqIRUgFCABa0EIaiEWAkADQCAULQAAIhdBIHIgFyAXQb9/akH/AXFBGkkbQf8BcSABQfS7gIAAai0AAEcNAQJAIAFBCEcNAEEFIQEMlQMLIAFBAWohASAUQQFqIhQgAkcNAAsgACAVNgIADLADCyAAQQA2AgAgFCEBDNgBC0E0IRAgASIUIAJGDa4DIAIgFGsgACgCACIBaiEVIBQgAWtBBWohFgJAA0AgFC0AACIXQSByIBcgF0G/f2pB/wFxQRpJG0H/AXEgAUHQwoCAAGotAABHDQECQCABQQVHDQBBByEBDJQDCyABQQFqIQEgFEEBaiIUIAJHDQALIAAgFTYCAAyvAwsgAEEANgIAIBQhAQzXAQsCQCABIgEgAkYNAANAAkAgAS0AAEGAvoCAAGotAAAiEEEBRg0AIBBBAkYNCiABIQEM3QELIAFBAWoiASACRw0AC0EwIRAMrgMLQTAhEAytAwsCQCABIgEgAkYNAANAAkAgAS0AACIQQSBGDQAgEEF2ag4E2QHaAdoB2QHaAQsgAUEBaiIBIAJHDQALQTghEAytAwtBOCEQDKwDCwNAAkAgAS0AACIQQSBGDQAgEEEJRw0DCyABQQFqIgEgAkcNAAtBPCEQDKsDCwNAAkAgAS0AACIQQSBGDQACQAJAIBBBdmoOBNoBAQHaAQALIBBBLEYN2wELIAEhAQwECyABQQFqIgEgAkcNAAtBPyEQDKoDCyABIQEM2wELQcAAIRAgASIUIAJGDagDIAIgFGsgACgCACIBaiEWIBQgAWtBBmohFwJAA0AgFC0AAEEgciABQYDAgIAAai0AAEcNASABQQZGDY4DIAFBAWohASAUQQFqIhQgAkcNAAsgACAWNgIADKkDCyAAQQA2AgAgFCEBC0E2IRAMjgMLAkAgASIPIAJHDQBBwQAhEAynAwsgAEGMgICAADYCCCAAIA82AgQgDyEBIAAtACxBf2oOBM0B1QHXAdkBhwMLIAFBAWohAQzMAQsCQCABIgEgAkYNAANAAkAgAS0AACIQQSByIBAgEEG/f2pB/wFxQRpJG0H/AXEiEEEJRg0AIBBBIEYNAAJAAkACQAJAIBBBnX9qDhMAAwMDAwMDAwEDAwMDAwMDAwMCAwsgAUEBaiEBQTEhEAyRAwsgAUEBaiEBQTIhEAyQAwsgAUEBaiEBQTMhEAyPAwsgASEBDNABCyABQQFqIgEgAkcNAAtBNSEQDKUDC0E1IRAMpAMLAkAgASIBIAJGDQADQAJAIAEtAABBgLyAgABqLQAAQQFGDQAgASEBDNMBCyABQQFqIgEgAkcNAAtBPSEQDKQDC0E9IRAMowMLIAAgASIBIAIQsICAgAAiEA3WASABIQEMAQsgEEEBaiEBC0E8IRAMhwMLAkAgASIBIAJHDQBBwgAhEAygAwsCQANAAkAgAS0AAEF3ag4YAAL+Av4ChAP+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gIA/gILIAFBAWoiASACRw0AC0HCACEQDKADCyABQQFqIQEgAC0ALUEBcUUNvQEgASEBC0EsIRAMhQMLIAEiASACRw3TAUHEACEQDJ0DCwNAAkAgAS0AAEGQwICAAGotAABBAUYNACABIQEMtwILIAFBAWoiASACRw0AC0HFACEQDJwDCyANLQAAIhBBIEYNswEgEEE6Rw2BAyAAKAIEIQEgAEEANgIEIAAgASANEK+AgIAAIgEN0AEgDUEBaiEBDLMCC0HHACEQIAEiDSACRg2aAyACIA1rIAAoAgAiAWohFiANIAFrQQVqIRcDQCANLQAAIhRBIHIgFCAUQb9/akH/AXFBGkkbQf8BcSABQZDCgIAAai0AAEcNgAMgAUEFRg30AiABQQFqIQEgDUEBaiINIAJHDQALIAAgFjYCAAyaAwtByAAhECABIg0gAkYNmQMgAiANayAAKAIAIgFqIRYgDSABa0EJaiEXA0AgDS0AACIUQSByIBQgFEG/f2pB/wFxQRpJG0H/AXEgAUGWwoCAAGotAABHDf8CAkAgAUEJRw0AQQIhAQz1AgsgAUEBaiEBIA1BAWoiDSACRw0ACyAAIBY2AgAMmQMLAkAgASINIAJHDQBByQAhEAyZAwsCQAJAIA0tAAAiAUEgciABIAFBv39qQf8BcUEaSRtB/wFxQZJ/ag4HAIADgAOAA4ADgAMBgAMLIA1BAWohAUE+IRAMgAMLIA1BAWohAUE/IRAM/wILQcoAIRAgASINIAJGDZcDIAIgDWsgACgCACIBaiEWIA0gAWtBAWohFwNAIA0tAAAiFEEgciAUIBRBv39qQf8BcUEaSRtB/wFxIAFBoMKAgABqLQAARw39AiABQQFGDfACIAFBAWohASANQQFqIg0gAkcNAAsgACAWNgIADJcDC0HLACEQIAEiDSACRg2WAyACIA1rIAAoAgAiAWohFiANIAFrQQ5qIRcDQCANLQAAIhRBIHIgFCAUQb9/akH/AXFBGkkbQf8BcSABQaLCgIAAai0AAEcN/AIgAUEORg3wAiABQQFqIQEgDUEBaiINIAJHDQALIAAgFjYCAAyWAwtBzAAhECABIg0gAkYNlQMgAiANayAAKAIAIgFqIRYgDSABa0EPaiEXA0AgDS0AACIUQSByIBQgFEG/f2pB/wFxQRpJG0H/AXEgAUHAwoCAAGotAABHDfsCAkAgAUEPRw0AQQMhAQzxAgsgAUEBaiEBIA1BAWoiDSACRw0ACyAAIBY2AgAMlQMLQc0AIRAgASINIAJGDZQDIAIgDWsgACgCACIBaiEWIA0gAWtBBWohFwNAIA0tAAAiFEEgciAUIBRBv39qQf8BcUEaSRtB/wFxIAFB0MKAgABqLQAARw36AgJAIAFBBUcNAEEEIQEM8AILIAFBAWohASANQQFqIg0gAkcNAAsgACAWNgIADJQDCwJAIAEiDSACRw0AQc4AIRAMlAMLAkACQAJAAkAgDS0AACIBQSByIAEgAUG/f2pB/wFxQRpJG0H/AXFBnX9qDhMA/QL9Av0C/QL9Av0C/QL9Av0C/QL9Av0CAf0C/QL9AgID/QILIA1BAWohAUHBACEQDP0CCyANQQFqIQFBwgAhEAz8AgsgDUEBaiEBQcMAIRAM+wILIA1BAWohAUHEACEQDPoCCwJAIAEiASACRg0AIABBjYCAgAA2AgggACABNgIEIAEhAUHFACEQDPoCC0HPACEQDJIDCyAQIQECQAJAIBAtAABBdmoOBAGoAqgCAKgCCyAQQQFqIQELQSchEAz4AgsCQCABIgEgAkcNAEHRACEQDJEDCwJAIAEtAABBIEYNACABIQEMjQELIAFBAWohASAALQAtQQFxRQ3HASABIQEMjAELIAEiFyACRw3IAUHSACEQDI8DC0HTACEQIAEiFCACRg2OAyACIBRrIAAoAgAiAWohFiAUIAFrQQFqIRcDQCAULQAAIAFB1sKAgABqLQAARw3MASABQQFGDccBIAFBAWohASAUQQFqIhQgAkcNAAsgACAWNgIADI4DCwJAIAEiASACRw0AQdUAIRAMjgMLIAEtAABBCkcNzAEgAUEBaiEBDMcBCwJAIAEiASACRw0AQdYAIRAMjQMLAkACQCABLQAAQXZqDgQAzQHNAQHNAQsgAUEBaiEBDMcBCyABQQFqIQFBygAhEAzzAgsgACABIgEgAhCugICAACIQDcsBIAEhAUHNACEQDPICCyAALQApQSJGDYUDDKYCCwJAIAEiASACRw0AQdsAIRAMigMLQQAhFEEBIRdBASEWQQAhEAJAAkACQAJAAkACQAJAAkACQCABLQAAQVBqDgrUAdMBAAECAwQFBgjVAQtBAiEQDAYLQQMhEAwFC0EEIRAMBAtBBSEQDAMLQQYhEAwCC0EHIRAMAQtBCCEQC0EAIRdBACEWQQAhFAzMAQtBCSEQQQEhFEEAIRdBACEWDMsBCwJAIAEiASACRw0AQd0AIRAMiQMLIAEtAABBLkcNzAEgAUEBaiEBDKYCCyABIgEgAkcNzAFB3wAhEAyHAwsCQCABIgEgAkYNACAAQY6AgIAANgIIIAAgATYCBCABIQFB0AAhEAzuAgtB4AAhEAyGAwtB4QAhECABIgEgAkYNhQMgAiABayAAKAIAIhRqIRYgASAUa0EDaiEXA0AgAS0AACAUQeLCgIAAai0AAEcNzQEgFEEDRg3MASAUQQFqIRQgAUEBaiIBIAJHDQALIAAgFjYCAAyFAwtB4gAhECABIgEgAkYNhAMgAiABayAAKAIAIhRqIRYgASAUa0ECaiEXA0AgAS0AACAUQebCgIAAai0AAEcNzAEgFEECRg3OASAUQQFqIRQgAUEBaiIBIAJHDQALIAAgFjYCAAyEAwtB4wAhECABIgEgAkYNgwMgAiABayAAKAIAIhRqIRYgASAUa0EDaiEXA0AgAS0AACAUQenCgIAAai0AAEcNywEgFEEDRg3OASAUQQFqIRQgAUEBaiIBIAJHDQALIAAgFjYCAAyDAwsCQCABIgEgAkcNAEHlACEQDIMDCyAAIAFBAWoiASACEKiAgIAAIhANzQEgASEBQdYAIRAM6QILAkAgASIBIAJGDQADQAJAIAEtAAAiEEEgRg0AAkACQAJAIBBBuH9qDgsAAc8BzwHPAc8BzwHPAc8BzwECzwELIAFBAWohAUHSACEQDO0CCyABQQFqIQFB0wAhEAzsAgsgAUEBaiEBQdQAIRAM6wILIAFBAWoiASACRw0AC0HkACEQDIIDC0HkACEQDIEDCwNAAkAgAS0AAEHwwoCAAGotAAAiEEEBRg0AIBBBfmoOA88B0AHRAdIBCyABQQFqIgEgAkcNAAtB5gAhEAyAAwsCQCABIgEgAkYNACABQQFqIQEMAwtB5wAhEAz/AgsDQAJAIAEtAABB8MSAgABqLQAAIhBBAUYNAAJAIBBBfmoOBNIB0wHUAQDVAQsgASEBQdcAIRAM5wILIAFBAWoiASACRw0AC0HoACEQDP4CCwJAIAEiASACRw0AQekAIRAM/gILAkAgAS0AACIQQXZqDhq6AdUB1QG8AdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAcoB1QHVAQDTAQsgAUEBaiEBC0EGIRAM4wILA0ACQCABLQAAQfDGgIAAai0AAEEBRg0AIAEhAQyeAgsgAUEBaiIBIAJHDQALQeoAIRAM+wILAkAgASIBIAJGDQAgAUEBaiEBDAMLQesAIRAM+gILAkAgASIBIAJHDQBB7AAhEAz6AgsgAUEBaiEBDAELAkAgASIBIAJHDQBB7QAhEAz5AgsgAUEBaiEBC0EEIRAM3gILAkAgASIUIAJHDQBB7gAhEAz3AgsgFCEBAkACQAJAIBQtAABB8MiAgABqLQAAQX9qDgfUAdUB1gEAnAIBAtcBCyAUQQFqIQEMCgsgFEEBaiEBDM0BC0EAIRAgAEEANgIcIABBm5KAgAA2AhAgAEEHNgIMIAAgFEEBajYCFAz2AgsCQANAAkAgAS0AAEHwyICAAGotAAAiEEEERg0AAkACQCAQQX9qDgfSAdMB1AHZAQAEAdkBCyABIQFB2gAhEAzgAgsgAUEBaiEBQdwAIRAM3wILIAFBAWoiASACRw0AC0HvACEQDPYCCyABQQFqIQEMywELAkAgASIUIAJHDQBB8AAhEAz1AgsgFC0AAEEvRw3UASAUQQFqIQEMBgsCQCABIhQgAkcNAEHxACEQDPQCCwJAIBQtAAAiAUEvRw0AIBRBAWohAUHdACEQDNsCCyABQXZqIgRBFksN0wFBASAEdEGJgIACcUUN0wEMygILAkAgASIBIAJGDQAgAUEBaiEBQd4AIRAM2gILQfIAIRAM8gILAkAgASIUIAJHDQBB9AAhEAzyAgsgFCEBAkAgFC0AAEHwzICAAGotAABBf2oOA8kClAIA1AELQeEAIRAM2AILAkAgASIUIAJGDQADQAJAIBQtAABB8MqAgABqLQAAIgFBA0YNAAJAIAFBf2oOAssCANUBCyAUIQFB3wAhEAzaAgsgFEEBaiIUIAJHDQALQfMAIRAM8QILQfMAIRAM8AILAkAgASIBIAJGDQAgAEGPgICAADYCCCAAIAE2AgQgASEBQeAAIRAM1wILQfUAIRAM7wILAkAgASIBIAJHDQBB9gAhEAzvAgsgAEGPgICAADYCCCAAIAE2AgQgASEBC0EDIRAM1AILA0AgAS0AAEEgRw3DAiABQQFqIgEgAkcNAAtB9wAhEAzsAgsCQCABIgEgAkcNAEH4ACEQDOwCCyABLQAAQSBHDc4BIAFBAWohAQzvAQsgACABIgEgAhCsgICAACIQDc4BIAEhAQyOAgsCQCABIgQgAkcNAEH6ACEQDOoCCyAELQAAQcwARw3RASAEQQFqIQFBEyEQDM8BCwJAIAEiBCACRw0AQfsAIRAM6QILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEANAIAQtAAAgAUHwzoCAAGotAABHDdABIAFBBUYNzgEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBB+wAhEAzoAgsCQCABIgQgAkcNAEH8ACEQDOgCCwJAAkAgBC0AAEG9f2oODADRAdEB0QHRAdEB0QHRAdEB0QHRAQHRAQsgBEEBaiEBQeYAIRAMzwILIARBAWohAUHnACEQDM4CCwJAIAEiBCACRw0AQf0AIRAM5wILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQe3PgIAAai0AAEcNzwEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQf0AIRAM5wILIABBADYCACAQQQFqIQFBECEQDMwBCwJAIAEiBCACRw0AQf4AIRAM5gILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEAJAA0AgBC0AACABQfbOgIAAai0AAEcNzgEgAUEFRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQf4AIRAM5gILIABBADYCACAQQQFqIQFBFiEQDMsBCwJAIAEiBCACRw0AQf8AIRAM5QILIAIgBGsgACgCACIBaiEUIAQgAWtBA2ohEAJAA0AgBC0AACABQfzOgIAAai0AAEcNzQEgAUEDRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQf8AIRAM5QILIABBADYCACAQQQFqIQFBBSEQDMoBCwJAIAEiBCACRw0AQYABIRAM5AILIAQtAABB2QBHDcsBIARBAWohAUEIIRAMyQELAkAgASIEIAJHDQBBgQEhEAzjAgsCQAJAIAQtAABBsn9qDgMAzAEBzAELIARBAWohAUHrACEQDMoCCyAEQQFqIQFB7AAhEAzJAgsCQCABIgQgAkcNAEGCASEQDOICCwJAAkAgBC0AAEG4f2oOCADLAcsBywHLAcsBywEBywELIARBAWohAUHqACEQDMkCCyAEQQFqIQFB7QAhEAzIAgsCQCABIgQgAkcNAEGDASEQDOECCyACIARrIAAoAgAiAWohECAEIAFrQQJqIRQCQANAIAQtAAAgAUGAz4CAAGotAABHDckBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgEDYCAEGDASEQDOECC0EAIRAgAEEANgIAIBRBAWohAQzGAQsCQCABIgQgAkcNAEGEASEQDOACCyACIARrIAAoAgAiAWohFCAEIAFrQQRqIRACQANAIAQtAAAgAUGDz4CAAGotAABHDcgBIAFBBEYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGEASEQDOACCyAAQQA2AgAgEEEBaiEBQSMhEAzFAQsCQCABIgQgAkcNAEGFASEQDN8CCwJAAkAgBC0AAEG0f2oOCADIAcgByAHIAcgByAEByAELIARBAWohAUHvACEQDMYCCyAEQQFqIQFB8AAhEAzFAgsCQCABIgQgAkcNAEGGASEQDN4CCyAELQAAQcUARw3FASAEQQFqIQEMgwILAkAgASIEIAJHDQBBhwEhEAzdAgsgAiAEayAAKAIAIgFqIRQgBCABa0EDaiEQAkADQCAELQAAIAFBiM+AgABqLQAARw3FASABQQNGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBhwEhEAzdAgsgAEEANgIAIBBBAWohAUEtIRAMwgELAkAgASIEIAJHDQBBiAEhEAzcAgsgAiAEayAAKAIAIgFqIRQgBCABa0EIaiEQAkADQCAELQAAIAFB0M+AgABqLQAARw3EASABQQhGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBiAEhEAzcAgsgAEEANgIAIBBBAWohAUEpIRAMwQELAkAgASIBIAJHDQBBiQEhEAzbAgtBASEQIAEtAABB3wBHDcABIAFBAWohAQyBAgsCQCABIgQgAkcNAEGKASEQDNoCCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRADQCAELQAAIAFBjM+AgABqLQAARw3BASABQQFGDa8CIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYoBIRAM2QILAkAgASIEIAJHDQBBiwEhEAzZAgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFBjs+AgABqLQAARw3BASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBiwEhEAzZAgsgAEEANgIAIBBBAWohAUECIRAMvgELAkAgASIEIAJHDQBBjAEhEAzYAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFB8M+AgABqLQAARw3AASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBjAEhEAzYAgsgAEEANgIAIBBBAWohAUEfIRAMvQELAkAgASIEIAJHDQBBjQEhEAzXAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFB8s+AgABqLQAARw2/ASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBjQEhEAzXAgsgAEEANgIAIBBBAWohAUEJIRAMvAELAkAgASIEIAJHDQBBjgEhEAzWAgsCQAJAIAQtAABBt39qDgcAvwG/Ab8BvwG/AQG/AQsgBEEBaiEBQfgAIRAMvQILIARBAWohAUH5ACEQDLwCCwJAIAEiBCACRw0AQY8BIRAM1QILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEAJAA0AgBC0AACABQZHPgIAAai0AAEcNvQEgAUEFRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQY8BIRAM1QILIABBADYCACAQQQFqIQFBGCEQDLoBCwJAIAEiBCACRw0AQZABIRAM1AILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQZfPgIAAai0AAEcNvAEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZABIRAM1AILIABBADYCACAQQQFqIQFBFyEQDLkBCwJAIAEiBCACRw0AQZEBIRAM0wILIAIgBGsgACgCACIBaiEUIAQgAWtBBmohEAJAA0AgBC0AACABQZrPgIAAai0AAEcNuwEgAUEGRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZEBIRAM0wILIABBADYCACAQQQFqIQFBFSEQDLgBCwJAIAEiBCACRw0AQZIBIRAM0gILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEAJAA0AgBC0AACABQaHPgIAAai0AAEcNugEgAUEFRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZIBIRAM0gILIABBADYCACAQQQFqIQFBHiEQDLcBCwJAIAEiBCACRw0AQZMBIRAM0QILIAQtAABBzABHDbgBIARBAWohAUEKIRAMtgELAkAgBCACRw0AQZQBIRAM0AILAkACQCAELQAAQb9/ag4PALkBuQG5AbkBuQG5AbkBuQG5AbkBuQG5AbkBAbkBCyAEQQFqIQFB/gAhEAy3AgsgBEEBaiEBQf8AIRAMtgILAkAgBCACRw0AQZUBIRAMzwILAkACQCAELQAAQb9/ag4DALgBAbgBCyAEQQFqIQFB/QAhEAy2AgsgBEEBaiEEQYABIRAMtQILAkAgBCACRw0AQZYBIRAMzgILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQafPgIAAai0AAEcNtgEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZYBIRAMzgILIABBADYCACAQQQFqIQFBCyEQDLMBCwJAIAQgAkcNAEGXASEQDM0CCwJAAkACQAJAIAQtAABBU2oOIwC4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBAbgBuAG4AbgBuAECuAG4AbgBA7gBCyAEQQFqIQFB+wAhEAy2AgsgBEEBaiEBQfwAIRAMtQILIARBAWohBEGBASEQDLQCCyAEQQFqIQRBggEhEAyzAgsCQCAEIAJHDQBBmAEhEAzMAgsgAiAEayAAKAIAIgFqIRQgBCABa0EEaiEQAkADQCAELQAAIAFBqc+AgABqLQAARw20ASABQQRGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBmAEhEAzMAgsgAEEANgIAIBBBAWohAUEZIRAMsQELAkAgBCACRw0AQZkBIRAMywILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEAJAA0AgBC0AACABQa7PgIAAai0AAEcNswEgAUEFRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZkBIRAMywILIABBADYCACAQQQFqIQFBBiEQDLABCwJAIAQgAkcNAEGaASEQDMoCCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUG0z4CAAGotAABHDbIBIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGaASEQDMoCCyAAQQA2AgAgEEEBaiEBQRwhEAyvAQsCQCAEIAJHDQBBmwEhEAzJAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFBts+AgABqLQAARw2xASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBmwEhEAzJAgsgAEEANgIAIBBBAWohAUEnIRAMrgELAkAgBCACRw0AQZwBIRAMyAILAkACQCAELQAAQax/ag4CAAGxAQsgBEEBaiEEQYYBIRAMrwILIARBAWohBEGHASEQDK4CCwJAIAQgAkcNAEGdASEQDMcCCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUG4z4CAAGotAABHDa8BIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGdASEQDMcCCyAAQQA2AgAgEEEBaiEBQSYhEAysAQsCQCAEIAJHDQBBngEhEAzGAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFBus+AgABqLQAARw2uASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBngEhEAzGAgsgAEEANgIAIBBBAWohAUEDIRAMqwELAkAgBCACRw0AQZ8BIRAMxQILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQe3PgIAAai0AAEcNrQEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZ8BIRAMxQILIABBADYCACAQQQFqIQFBDCEQDKoBCwJAIAQgAkcNAEGgASEQDMQCCyACIARrIAAoAgAiAWohFCAEIAFrQQNqIRACQANAIAQtAAAgAUG8z4CAAGotAABHDawBIAFBA0YNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGgASEQDMQCCyAAQQA2AgAgEEEBaiEBQQ0hEAypAQsCQCAEIAJHDQBBoQEhEAzDAgsCQAJAIAQtAABBun9qDgsArAGsAawBrAGsAawBrAGsAawBAawBCyAEQQFqIQRBiwEhEAyqAgsgBEEBaiEEQYwBIRAMqQILAkAgBCACRw0AQaIBIRAMwgILIAQtAABB0ABHDakBIARBAWohBAzpAQsCQCAEIAJHDQBBowEhEAzBAgsCQAJAIAQtAABBt39qDgcBqgGqAaoBqgGqAQCqAQsgBEEBaiEEQY4BIRAMqAILIARBAWohAUEiIRAMpgELAkAgBCACRw0AQaQBIRAMwAILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQcDPgIAAai0AAEcNqAEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQaQBIRAMwAILIABBADYCACAQQQFqIQFBHSEQDKUBCwJAIAQgAkcNAEGlASEQDL8CCwJAAkAgBC0AAEGuf2oOAwCoAQGoAQsgBEEBaiEEQZABIRAMpgILIARBAWohAUEEIRAMpAELAkAgBCACRw0AQaYBIRAMvgILAkACQAJAAkACQCAELQAAQb9/ag4VAKoBqgGqAaoBqgGqAaoBqgGqAaoBAaoBqgECqgGqAQOqAaoBBKoBCyAEQQFqIQRBiAEhEAyoAgsgBEEBaiEEQYkBIRAMpwILIARBAWohBEGKASEQDKYCCyAEQQFqIQRBjwEhEAylAgsgBEEBaiEEQZEBIRAMpAILAkAgBCACRw0AQacBIRAMvQILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQe3PgIAAai0AAEcNpQEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQacBIRAMvQILIABBADYCACAQQQFqIQFBESEQDKIBCwJAIAQgAkcNAEGoASEQDLwCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHCz4CAAGotAABHDaQBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGoASEQDLwCCyAAQQA2AgAgEEEBaiEBQSwhEAyhAQsCQCAEIAJHDQBBqQEhEAy7AgsgAiAEayAAKAIAIgFqIRQgBCABa0EEaiEQAkADQCAELQAAIAFBxc+AgABqLQAARw2jASABQQRGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBqQEhEAy7AgsgAEEANgIAIBBBAWohAUErIRAMoAELAkAgBCACRw0AQaoBIRAMugILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQcrPgIAAai0AAEcNogEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQaoBIRAMugILIABBADYCACAQQQFqIQFBFCEQDJ8BCwJAIAQgAkcNAEGrASEQDLkCCwJAAkACQAJAIAQtAABBvn9qDg8AAQKkAaQBpAGkAaQBpAGkAaQBpAGkAaQBA6QBCyAEQQFqIQRBkwEhEAyiAgsgBEEBaiEEQZQBIRAMoQILIARBAWohBEGVASEQDKACCyAEQQFqIQRBlgEhEAyfAgsCQCAEIAJHDQBBrAEhEAy4AgsgBC0AAEHFAEcNnwEgBEEBaiEEDOABCwJAIAQgAkcNAEGtASEQDLcCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHNz4CAAGotAABHDZ8BIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGtASEQDLcCCyAAQQA2AgAgEEEBaiEBQQ4hEAycAQsCQCAEIAJHDQBBrgEhEAy2AgsgBC0AAEHQAEcNnQEgBEEBaiEBQSUhEAybAQsCQCAEIAJHDQBBrwEhEAy1AgsgAiAEayAAKAIAIgFqIRQgBCABa0EIaiEQAkADQCAELQAAIAFB0M+AgABqLQAARw2dASABQQhGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBrwEhEAy1AgsgAEEANgIAIBBBAWohAUEqIRAMmgELAkAgBCACRw0AQbABIRAMtAILAkACQCAELQAAQat/ag4LAJ0BnQGdAZ0BnQGdAZ0BnQGdAQGdAQsgBEEBaiEEQZoBIRAMmwILIARBAWohBEGbASEQDJoCCwJAIAQgAkcNAEGxASEQDLMCCwJAAkAgBC0AAEG/f2oOFACcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAEBnAELIARBAWohBEGZASEQDJoCCyAEQQFqIQRBnAEhEAyZAgsCQCAEIAJHDQBBsgEhEAyyAgsgAiAEayAAKAIAIgFqIRQgBCABa0EDaiEQAkADQCAELQAAIAFB2c+AgABqLQAARw2aASABQQNGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBsgEhEAyyAgsgAEEANgIAIBBBAWohAUEhIRAMlwELAkAgBCACRw0AQbMBIRAMsQILIAIgBGsgACgCACIBaiEUIAQgAWtBBmohEAJAA0AgBC0AACABQd3PgIAAai0AAEcNmQEgAUEGRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbMBIRAMsQILIABBADYCACAQQQFqIQFBGiEQDJYBCwJAIAQgAkcNAEG0ASEQDLACCwJAAkACQCAELQAAQbt/ag4RAJoBmgGaAZoBmgGaAZoBmgGaAQGaAZoBmgGaAZoBApoBCyAEQQFqIQRBnQEhEAyYAgsgBEEBaiEEQZ4BIRAMlwILIARBAWohBEGfASEQDJYCCwJAIAQgAkcNAEG1ASEQDK8CCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUHkz4CAAGotAABHDZcBIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEG1ASEQDK8CCyAAQQA2AgAgEEEBaiEBQSghEAyUAQsCQCAEIAJHDQBBtgEhEAyuAgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFB6s+AgABqLQAARw2WASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBtgEhEAyuAgsgAEEANgIAIBBBAWohAUEHIRAMkwELAkAgBCACRw0AQbcBIRAMrQILAkACQCAELQAAQbt/ag4OAJYBlgGWAZYBlgGWAZYBlgGWAZYBlgGWAQGWAQsgBEEBaiEEQaEBIRAMlAILIARBAWohBEGiASEQDJMCCwJAIAQgAkcNAEG4ASEQDKwCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHtz4CAAGotAABHDZQBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEG4ASEQDKwCCyAAQQA2AgAgEEEBaiEBQRIhEAyRAQsCQCAEIAJHDQBBuQEhEAyrAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFB8M+AgABqLQAARw2TASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBuQEhEAyrAgsgAEEANgIAIBBBAWohAUEgIRAMkAELAkAgBCACRw0AQboBIRAMqgILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQfLPgIAAai0AAEcNkgEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQboBIRAMqgILIABBADYCACAQQQFqIQFBDyEQDI8BCwJAIAQgAkcNAEG7ASEQDKkCCwJAAkAgBC0AAEG3f2oOBwCSAZIBkgGSAZIBAZIBCyAEQQFqIQRBpQEhEAyQAgsgBEEBaiEEQaYBIRAMjwILAkAgBCACRw0AQbwBIRAMqAILIAIgBGsgACgCACIBaiEUIAQgAWtBB2ohEAJAA0AgBC0AACABQfTPgIAAai0AAEcNkAEgAUEHRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbwBIRAMqAILIABBADYCACAQQQFqIQFBGyEQDI0BCwJAIAQgAkcNAEG9ASEQDKcCCwJAAkACQCAELQAAQb5/ag4SAJEBkQGRAZEBkQGRAZEBkQGRAQGRAZEBkQGRAZEBkQECkQELIARBAWohBEGkASEQDI8CCyAEQQFqIQRBpwEhEAyOAgsgBEEBaiEEQagBIRAMjQILAkAgBCACRw0AQb4BIRAMpgILIAQtAABBzgBHDY0BIARBAWohBAzPAQsCQCAEIAJHDQBBvwEhEAylAgsCQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAELQAAQb9/ag4VAAECA5wBBAUGnAGcAZwBBwgJCgucAQwNDg+cAQsgBEEBaiEBQegAIRAMmgILIARBAWohAUHpACEQDJkCCyAEQQFqIQFB7gAhEAyYAgsgBEEBaiEBQfIAIRAMlwILIARBAWohAUHzACEQDJYCCyAEQQFqIQFB9gAhEAyVAgsgBEEBaiEBQfcAIRAMlAILIARBAWohAUH6ACEQDJMCCyAEQQFqIQRBgwEhEAySAgsgBEEBaiEEQYQBIRAMkQILIARBAWohBEGFASEQDJACCyAEQQFqIQRBkgEhEAyPAgsgBEEBaiEEQZgBIRAMjgILIARBAWohBEGgASEQDI0CCyAEQQFqIQRBowEhEAyMAgsgBEEBaiEEQaoBIRAMiwILAkAgBCACRg0AIABBkICAgAA2AgggACAENgIEQasBIRAMiwILQcABIRAMowILIAAgBSACEKqAgIAAIgENiwEgBSEBDFwLAkAgBiACRg0AIAZBAWohBQyNAQtBwgEhEAyhAgsDQAJAIBAtAABBdmoOBIwBAACPAQALIBBBAWoiECACRw0AC0HDASEQDKACCwJAIAcgAkYNACAAQZGAgIAANgIIIAAgBzYCBCAHIQFBASEQDIcCC0HEASEQDJ8CCwJAIAcgAkcNAEHFASEQDJ8CCwJAAkAgBy0AAEF2ag4EAc4BzgEAzgELIAdBAWohBgyNAQsgB0EBaiEFDIkBCwJAIAcgAkcNAEHGASEQDJ4CCwJAAkAgBy0AAEF2ag4XAY8BjwEBjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BAI8BCyAHQQFqIQcLQbABIRAMhAILAkAgCCACRw0AQcgBIRAMnQILIAgtAABBIEcNjQEgAEEAOwEyIAhBAWohAUGzASEQDIMCCyABIRcCQANAIBciByACRg0BIActAABBUGpB/wFxIhBBCk8NzAECQCAALwEyIhRBmTNLDQAgACAUQQpsIhQ7ATIgEEH//wNzIBRB/v8DcUkNACAHQQFqIRcgACAUIBBqIhA7ATIgEEH//wNxQegHSQ0BCwtBACEQIABBADYCHCAAQcGJgIAANgIQIABBDTYCDCAAIAdBAWo2AhQMnAILQccBIRAMmwILIAAgCCACEK6AgIAAIhBFDcoBIBBBFUcNjAEgAEHIATYCHCAAIAg2AhQgAEHJl4CAADYCECAAQRU2AgxBACEQDJoCCwJAIAkgAkcNAEHMASEQDJoCC0EAIRRBASEXQQEhFkEAIRACQAJAAkACQAJAAkACQAJAAkAgCS0AAEFQag4KlgGVAQABAgMEBQYIlwELQQIhEAwGC0EDIRAMBQtBBCEQDAQLQQUhEAwDC0EGIRAMAgtBByEQDAELQQghEAtBACEXQQAhFkEAIRQMjgELQQkhEEEBIRRBACEXQQAhFgyNAQsCQCAKIAJHDQBBzgEhEAyZAgsgCi0AAEEuRw2OASAKQQFqIQkMygELIAsgAkcNjgFB0AEhEAyXAgsCQCALIAJGDQAgAEGOgICAADYCCCAAIAs2AgRBtwEhEAz+AQtB0QEhEAyWAgsCQCAEIAJHDQBB0gEhEAyWAgsgAiAEayAAKAIAIhBqIRQgBCAQa0EEaiELA0AgBC0AACAQQfzPgIAAai0AAEcNjgEgEEEERg3pASAQQQFqIRAgBEEBaiIEIAJHDQALIAAgFDYCAEHSASEQDJUCCyAAIAwgAhCsgICAACIBDY0BIAwhAQy4AQsCQCAEIAJHDQBB1AEhEAyUAgsgAiAEayAAKAIAIhBqIRQgBCAQa0EBaiEMA0AgBC0AACAQQYHQgIAAai0AAEcNjwEgEEEBRg2OASAQQQFqIRAgBEEBaiIEIAJHDQALIAAgFDYCAEHUASEQDJMCCwJAIAQgAkcNAEHWASEQDJMCCyACIARrIAAoAgAiEGohFCAEIBBrQQJqIQsDQCAELQAAIBBBg9CAgABqLQAARw2OASAQQQJGDZABIBBBAWohECAEQQFqIgQgAkcNAAsgACAUNgIAQdYBIRAMkgILAkAgBCACRw0AQdcBIRAMkgILAkACQCAELQAAQbt/ag4QAI8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwEBjwELIARBAWohBEG7ASEQDPkBCyAEQQFqIQRBvAEhEAz4AQsCQCAEIAJHDQBB2AEhEAyRAgsgBC0AAEHIAEcNjAEgBEEBaiEEDMQBCwJAIAQgAkYNACAAQZCAgIAANgIIIAAgBDYCBEG+ASEQDPcBC0HZASEQDI8CCwJAIAQgAkcNAEHaASEQDI8CCyAELQAAQcgARg3DASAAQQE6ACgMuQELIABBAjoALyAAIAQgAhCmgICAACIQDY0BQcIBIRAM9AELIAAtAChBf2oOArcBuQG4AQsDQAJAIAQtAABBdmoOBACOAY4BAI4BCyAEQQFqIgQgAkcNAAtB3QEhEAyLAgsgAEEAOgAvIAAtAC1BBHFFDYQCCyAAQQA6AC8gAEEBOgA0IAEhAQyMAQsgEEEVRg3aASAAQQA2AhwgACABNgIUIABBp46AgAA2AhAgAEESNgIMQQAhEAyIAgsCQCAAIBAgAhC0gICAACIEDQAgECEBDIECCwJAIARBFUcNACAAQQM2AhwgACAQNgIUIABBsJiAgAA2AhAgAEEVNgIMQQAhEAyIAgsgAEEANgIcIAAgEDYCFCAAQaeOgIAANgIQIABBEjYCDEEAIRAMhwILIBBBFUYN1gEgAEEANgIcIAAgATYCFCAAQdqNgIAANgIQIABBFDYCDEEAIRAMhgILIAAoAgQhFyAAQQA2AgQgECARp2oiFiEBIAAgFyAQIBYgFBsiEBC1gICAACIURQ2NASAAQQc2AhwgACAQNgIUIAAgFDYCDEEAIRAMhQILIAAgAC8BMEGAAXI7ATAgASEBC0EqIRAM6gELIBBBFUYN0QEgAEEANgIcIAAgATYCFCAAQYOMgIAANgIQIABBEzYCDEEAIRAMggILIBBBFUYNzwEgAEEANgIcIAAgATYCFCAAQZqPgIAANgIQIABBIjYCDEEAIRAMgQILIAAoAgQhECAAQQA2AgQCQCAAIBAgARC3gICAACIQDQAgAUEBaiEBDI0BCyAAQQw2AhwgACAQNgIMIAAgAUEBajYCFEEAIRAMgAILIBBBFUYNzAEgAEEANgIcIAAgATYCFCAAQZqPgIAANgIQIABBIjYCDEEAIRAM/wELIAAoAgQhECAAQQA2AgQCQCAAIBAgARC3gICAACIQDQAgAUEBaiEBDIwBCyAAQQ02AhwgACAQNgIMIAAgAUEBajYCFEEAIRAM/gELIBBBFUYNyQEgAEEANgIcIAAgATYCFCAAQcaMgIAANgIQIABBIzYCDEEAIRAM/QELIAAoAgQhECAAQQA2AgQCQCAAIBAgARC5gICAACIQDQAgAUEBaiEBDIsBCyAAQQ42AhwgACAQNgIMIAAgAUEBajYCFEEAIRAM/AELIABBADYCHCAAIAE2AhQgAEHAlYCAADYCECAAQQI2AgxBACEQDPsBCyAQQRVGDcUBIABBADYCHCAAIAE2AhQgAEHGjICAADYCECAAQSM2AgxBACEQDPoBCyAAQRA2AhwgACABNgIUIAAgEDYCDEEAIRAM+QELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARC5gICAACIEDQAgAUEBaiEBDPEBCyAAQRE2AhwgACAENgIMIAAgAUEBajYCFEEAIRAM+AELIBBBFUYNwQEgAEEANgIcIAAgATYCFCAAQcaMgIAANgIQIABBIzYCDEEAIRAM9wELIAAoAgQhECAAQQA2AgQCQCAAIBAgARC5gICAACIQDQAgAUEBaiEBDIgBCyAAQRM2AhwgACAQNgIMIAAgAUEBajYCFEEAIRAM9gELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARC5gICAACIEDQAgAUEBaiEBDO0BCyAAQRQ2AhwgACAENgIMIAAgAUEBajYCFEEAIRAM9QELIBBBFUYNvQEgAEEANgIcIAAgATYCFCAAQZqPgIAANgIQIABBIjYCDEEAIRAM9AELIAAoAgQhECAAQQA2AgQCQCAAIBAgARC3gICAACIQDQAgAUEBaiEBDIYBCyAAQRY2AhwgACAQNgIMIAAgAUEBajYCFEEAIRAM8wELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARC3gICAACIEDQAgAUEBaiEBDOkBCyAAQRc2AhwgACAENgIMIAAgAUEBajYCFEEAIRAM8gELIABBADYCHCAAIAE2AhQgAEHNk4CAADYCECAAQQw2AgxBACEQDPEBC0IBIRELIBBBAWohAQJAIAApAyAiEkL//////////w9WDQAgACASQgSGIBGENwMgIAEhAQyEAQsgAEEANgIcIAAgATYCFCAAQa2JgIAANgIQIABBDDYCDEEAIRAM7wELIABBADYCHCAAIBA2AhQgAEHNk4CAADYCECAAQQw2AgxBACEQDO4BCyAAKAIEIRcgAEEANgIEIBAgEadqIhYhASAAIBcgECAWIBQbIhAQtYCAgAAiFEUNcyAAQQU2AhwgACAQNgIUIAAgFDYCDEEAIRAM7QELIABBADYCHCAAIBA2AhQgAEGqnICAADYCECAAQQ82AgxBACEQDOwBCyAAIBAgAhC0gICAACIBDQEgECEBC0EOIRAM0QELAkAgAUEVRw0AIABBAjYCHCAAIBA2AhQgAEGwmICAADYCECAAQRU2AgxBACEQDOoBCyAAQQA2AhwgACAQNgIUIABBp46AgAA2AhAgAEESNgIMQQAhEAzpAQsgAUEBaiEQAkAgAC8BMCIBQYABcUUNAAJAIAAgECACELuAgIAAIgENACAQIQEMcAsgAUEVRw26ASAAQQU2AhwgACAQNgIUIABB+ZeAgAA2AhAgAEEVNgIMQQAhEAzpAQsCQCABQaAEcUGgBEcNACAALQAtQQJxDQAgAEEANgIcIAAgEDYCFCAAQZaTgIAANgIQIABBBDYCDEEAIRAM6QELIAAgECACEL2AgIAAGiAQIQECQAJAAkACQAJAIAAgECACELOAgIAADhYCAQAEBAQEBAQEBAQEBAQEBAQEBAQDBAsgAEEBOgAuCyAAIAAvATBBwAByOwEwIBAhAQtBJiEQDNEBCyAAQSM2AhwgACAQNgIUIABBpZaAgAA2AhAgAEEVNgIMQQAhEAzpAQsgAEEANgIcIAAgEDYCFCAAQdWLgIAANgIQIABBETYCDEEAIRAM6AELIAAtAC1BAXFFDQFBwwEhEAzOAQsCQCANIAJGDQADQAJAIA0tAABBIEYNACANIQEMxAELIA1BAWoiDSACRw0AC0ElIRAM5wELQSUhEAzmAQsgACgCBCEEIABBADYCBCAAIAQgDRCvgICAACIERQ2tASAAQSY2AhwgACAENgIMIAAgDUEBajYCFEEAIRAM5QELIBBBFUYNqwEgAEEANgIcIAAgATYCFCAAQf2NgIAANgIQIABBHTYCDEEAIRAM5AELIABBJzYCHCAAIAE2AhQgACAQNgIMQQAhEAzjAQsgECEBQQEhFAJAAkACQAJAAkACQAJAIAAtACxBfmoOBwYFBQMBAgAFCyAAIAAvATBBCHI7ATAMAwtBAiEUDAELQQQhFAsgAEEBOgAsIAAgAC8BMCAUcjsBMAsgECEBC0ErIRAMygELIABBADYCHCAAIBA2AhQgAEGrkoCAADYCECAAQQs2AgxBACEQDOIBCyAAQQA2AhwgACABNgIUIABB4Y+AgAA2AhAgAEEKNgIMQQAhEAzhAQsgAEEAOgAsIBAhAQy9AQsgECEBQQEhFAJAAkACQAJAAkAgAC0ALEF7ag4EAwECAAULIAAgAC8BMEEIcjsBMAwDC0ECIRQMAQtBBCEUCyAAQQE6ACwgACAALwEwIBRyOwEwCyAQIQELQSkhEAzFAQsgAEEANgIcIAAgATYCFCAAQfCUgIAANgIQIABBAzYCDEEAIRAM3QELAkAgDi0AAEENRw0AIAAoAgQhASAAQQA2AgQCQCAAIAEgDhCxgICAACIBDQAgDkEBaiEBDHULIABBLDYCHCAAIAE2AgwgACAOQQFqNgIUQQAhEAzdAQsgAC0ALUEBcUUNAUHEASEQDMMBCwJAIA4gAkcNAEEtIRAM3AELAkACQANAAkAgDi0AAEF2ag4EAgAAAwALIA5BAWoiDiACRw0AC0EtIRAM3QELIAAoAgQhASAAQQA2AgQCQCAAIAEgDhCxgICAACIBDQAgDiEBDHQLIABBLDYCHCAAIA42AhQgACABNgIMQQAhEAzcAQsgACgCBCEBIABBADYCBAJAIAAgASAOELGAgIAAIgENACAOQQFqIQEMcwsgAEEsNgIcIAAgATYCDCAAIA5BAWo2AhRBACEQDNsBCyAAKAIEIQQgAEEANgIEIAAgBCAOELGAgIAAIgQNoAEgDiEBDM4BCyAQQSxHDQEgAUEBaiEQQQEhAQJAAkACQAJAAkAgAC0ALEF7ag4EAwECBAALIBAhAQwEC0ECIQEMAQtBBCEBCyAAQQE6ACwgACAALwEwIAFyOwEwIBAhAQwBCyAAIAAvATBBCHI7ATAgECEBC0E5IRAMvwELIABBADoALCABIQELQTQhEAy9AQsgACAALwEwQSByOwEwIAEhAQwCCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQsYCAgAAiBA0AIAEhAQzHAQsgAEE3NgIcIAAgATYCFCAAIAQ2AgxBACEQDNQBCyAAQQg6ACwgASEBC0EwIRAMuQELAkAgAC0AKEEBRg0AIAEhAQwECyAALQAtQQhxRQ2TASABIQEMAwsgAC0AMEEgcQ2UAUHFASEQDLcBCwJAIA8gAkYNAAJAA0ACQCAPLQAAQVBqIgFB/wFxQQpJDQAgDyEBQTUhEAy6AQsgACkDICIRQpmz5syZs+bMGVYNASAAIBFCCn4iETcDICARIAGtQv8BgyISQn+FVg0BIAAgESASfDcDICAPQQFqIg8gAkcNAAtBOSEQDNEBCyAAKAIEIQIgAEEANgIEIAAgAiAPQQFqIgQQsYCAgAAiAg2VASAEIQEMwwELQTkhEAzPAQsCQCAALwEwIgFBCHFFDQAgAC0AKEEBRw0AIAAtAC1BCHFFDZABCyAAIAFB9/sDcUGABHI7ATAgDyEBC0E3IRAMtAELIAAgAC8BMEEQcjsBMAyrAQsgEEEVRg2LASAAQQA2AhwgACABNgIUIABB8I6AgAA2AhAgAEEcNgIMQQAhEAzLAQsgAEHDADYCHCAAIAE2AgwgACANQQFqNgIUQQAhEAzKAQsCQCABLQAAQTpHDQAgACgCBCEQIABBADYCBAJAIAAgECABEK+AgIAAIhANACABQQFqIQEMYwsgAEHDADYCHCAAIBA2AgwgACABQQFqNgIUQQAhEAzKAQsgAEEANgIcIAAgATYCFCAAQbGRgIAANgIQIABBCjYCDEEAIRAMyQELIABBADYCHCAAIAE2AhQgAEGgmYCAADYCECAAQR42AgxBACEQDMgBCyAAQQA2AgALIABBgBI7ASogACAXQQFqIgEgAhCogICAACIQDQEgASEBC0HHACEQDKwBCyAQQRVHDYMBIABB0QA2AhwgACABNgIUIABB45eAgAA2AhAgAEEVNgIMQQAhEAzEAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMXgsgAEHSADYCHCAAIAE2AhQgACAQNgIMQQAhEAzDAQsgAEEANgIcIAAgFDYCFCAAQcGogIAANgIQIABBBzYCDCAAQQA2AgBBACEQDMIBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxdCyAAQdMANgIcIAAgATYCFCAAIBA2AgxBACEQDMEBC0EAIRAgAEEANgIcIAAgATYCFCAAQYCRgIAANgIQIABBCTYCDAzAAQsgEEEVRg19IABBADYCHCAAIAE2AhQgAEGUjYCAADYCECAAQSE2AgxBACEQDL8BC0EBIRZBACEXQQAhFEEBIRALIAAgEDoAKyABQQFqIQECQAJAIAAtAC1BEHENAAJAAkACQCAALQAqDgMBAAIECyAWRQ0DDAILIBQNAQwCCyAXRQ0BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQrYCAgAAiEA0AIAEhAQxcCyAAQdgANgIcIAAgATYCFCAAIBA2AgxBACEQDL4BCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQrYCAgAAiBA0AIAEhAQytAQsgAEHZADYCHCAAIAE2AhQgACAENgIMQQAhEAy9AQsgACgCBCEEIABBADYCBAJAIAAgBCABEK2AgIAAIgQNACABIQEMqwELIABB2gA2AhwgACABNgIUIAAgBDYCDEEAIRAMvAELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARCtgICAACIEDQAgASEBDKkBCyAAQdwANgIcIAAgATYCFCAAIAQ2AgxBACEQDLsBCwJAIAEtAABBUGoiEEH/AXFBCk8NACAAIBA6ACogAUEBaiEBQc8AIRAMogELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARCtgICAACIEDQAgASEBDKcBCyAAQd4ANgIcIAAgATYCFCAAIAQ2AgxBACEQDLoBCyAAQQA2AgAgF0EBaiEBAkAgAC0AKUEjTw0AIAEhAQxZCyAAQQA2AhwgACABNgIUIABB04mAgAA2AhAgAEEINgIMQQAhEAy5AQsgAEEANgIAC0EAIRAgAEEANgIcIAAgATYCFCAAQZCzgIAANgIQIABBCDYCDAy3AQsgAEEANgIAIBdBAWohAQJAIAAtAClBIUcNACABIQEMVgsgAEEANgIcIAAgATYCFCAAQZuKgIAANgIQIABBCDYCDEEAIRAMtgELIABBADYCACAXQQFqIQECQCAALQApIhBBXWpBC08NACABIQEMVQsCQCAQQQZLDQBBASAQdEHKAHFFDQAgASEBDFULQQAhECAAQQA2AhwgACABNgIUIABB94mAgAA2AhAgAEEINgIMDLUBCyAQQRVGDXEgAEEANgIcIAAgATYCFCAAQbmNgIAANgIQIABBGjYCDEEAIRAMtAELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDFQLIABB5QA2AhwgACABNgIUIAAgEDYCDEEAIRAMswELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDE0LIABB0gA2AhwgACABNgIUIAAgEDYCDEEAIRAMsgELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDE0LIABB0wA2AhwgACABNgIUIAAgEDYCDEEAIRAMsQELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDFELIABB5QA2AhwgACABNgIUIAAgEDYCDEEAIRAMsAELIABBADYCHCAAIAE2AhQgAEHGioCAADYCECAAQQc2AgxBACEQDK8BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxJCyAAQdIANgIcIAAgATYCFCAAIBA2AgxBACEQDK4BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxJCyAAQdMANgIcIAAgATYCFCAAIBA2AgxBACEQDK0BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxNCyAAQeUANgIcIAAgATYCFCAAIBA2AgxBACEQDKwBCyAAQQA2AhwgACABNgIUIABB3IiAgAA2AhAgAEEHNgIMQQAhEAyrAQsgEEE/Rw0BIAFBAWohAQtBBSEQDJABC0EAIRAgAEEANgIcIAAgATYCFCAAQf2SgIAANgIQIABBBzYCDAyoAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMQgsgAEHSADYCHCAAIAE2AhQgACAQNgIMQQAhEAynAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMQgsgAEHTADYCHCAAIAE2AhQgACAQNgIMQQAhEAymAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMRgsgAEHlADYCHCAAIAE2AhQgACAQNgIMQQAhEAylAQsgACgCBCEBIABBADYCBAJAIAAgASAUEKeAgIAAIgENACAUIQEMPwsgAEHSADYCHCAAIBQ2AhQgACABNgIMQQAhEAykAQsgACgCBCEBIABBADYCBAJAIAAgASAUEKeAgIAAIgENACAUIQEMPwsgAEHTADYCHCAAIBQ2AhQgACABNgIMQQAhEAyjAQsgACgCBCEBIABBADYCBAJAIAAgASAUEKeAgIAAIgENACAUIQEMQwsgAEHlADYCHCAAIBQ2AhQgACABNgIMQQAhEAyiAQsgAEEANgIcIAAgFDYCFCAAQcOPgIAANgIQIABBBzYCDEEAIRAMoQELIABBADYCHCAAIAE2AhQgAEHDj4CAADYCECAAQQc2AgxBACEQDKABC0EAIRAgAEEANgIcIAAgFDYCFCAAQYycgIAANgIQIABBBzYCDAyfAQsgAEEANgIcIAAgFDYCFCAAQYycgIAANgIQIABBBzYCDEEAIRAMngELIABBADYCHCAAIBQ2AhQgAEH+kYCAADYCECAAQQc2AgxBACEQDJ0BCyAAQQA2AhwgACABNgIUIABBjpuAgAA2AhAgAEEGNgIMQQAhEAycAQsgEEEVRg1XIABBADYCHCAAIAE2AhQgAEHMjoCAADYCECAAQSA2AgxBACEQDJsBCyAAQQA2AgAgEEEBaiEBQSQhEAsgACAQOgApIAAoAgQhECAAQQA2AgQgACAQIAEQq4CAgAAiEA1UIAEhAQw+CyAAQQA2AgALQQAhECAAQQA2AhwgACAENgIUIABB8ZuAgAA2AhAgAEEGNgIMDJcBCyABQRVGDVAgAEEANgIcIAAgBTYCFCAAQfCMgIAANgIQIABBGzYCDEEAIRAMlgELIAAoAgQhBSAAQQA2AgQgACAFIBAQqYCAgAAiBQ0BIBBBAWohBQtBrQEhEAx7CyAAQcEBNgIcIAAgBTYCDCAAIBBBAWo2AhRBACEQDJMBCyAAKAIEIQYgAEEANgIEIAAgBiAQEKmAgIAAIgYNASAQQQFqIQYLQa4BIRAMeAsgAEHCATYCHCAAIAY2AgwgACAQQQFqNgIUQQAhEAyQAQsgAEEANgIcIAAgBzYCFCAAQZeLgIAANgIQIABBDTYCDEEAIRAMjwELIABBADYCHCAAIAg2AhQgAEHjkICAADYCECAAQQk2AgxBACEQDI4BCyAAQQA2AhwgACAINgIUIABBlI2AgAA2AhAgAEEhNgIMQQAhEAyNAQtBASEWQQAhF0EAIRRBASEQCyAAIBA6ACsgCUEBaiEIAkACQCAALQAtQRBxDQACQAJAAkAgAC0AKg4DAQACBAsgFkUNAwwCCyAUDQEMAgsgF0UNAQsgACgCBCEQIABBADYCBCAAIBAgCBCtgICAACIQRQ09IABByQE2AhwgACAINgIUIAAgEDYCDEEAIRAMjAELIAAoAgQhBCAAQQA2AgQgACAEIAgQrYCAgAAiBEUNdiAAQcoBNgIcIAAgCDYCFCAAIAQ2AgxBACEQDIsBCyAAKAIEIQQgAEEANgIEIAAgBCAJEK2AgIAAIgRFDXQgAEHLATYCHCAAIAk2AhQgACAENgIMQQAhEAyKAQsgACgCBCEEIABBADYCBCAAIAQgChCtgICAACIERQ1yIABBzQE2AhwgACAKNgIUIAAgBDYCDEEAIRAMiQELAkAgCy0AAEFQaiIQQf8BcUEKTw0AIAAgEDoAKiALQQFqIQpBtgEhEAxwCyAAKAIEIQQgAEEANgIEIAAgBCALEK2AgIAAIgRFDXAgAEHPATYCHCAAIAs2AhQgACAENgIMQQAhEAyIAQsgAEEANgIcIAAgBDYCFCAAQZCzgIAANgIQIABBCDYCDCAAQQA2AgBBACEQDIcBCyABQRVGDT8gAEEANgIcIAAgDDYCFCAAQcyOgIAANgIQIABBIDYCDEEAIRAMhgELIABBgQQ7ASggACgCBCEQIABCADcDACAAIBAgDEEBaiIMEKuAgIAAIhBFDTggAEHTATYCHCAAIAw2AhQgACAQNgIMQQAhEAyFAQsgAEEANgIAC0EAIRAgAEEANgIcIAAgBDYCFCAAQdibgIAANgIQIABBCDYCDAyDAQsgACgCBCEQIABCADcDACAAIBAgC0EBaiILEKuAgIAAIhANAUHGASEQDGkLIABBAjoAKAxVCyAAQdUBNgIcIAAgCzYCFCAAIBA2AgxBACEQDIABCyAQQRVGDTcgAEEANgIcIAAgBDYCFCAAQaSMgIAANgIQIABBEDYCDEEAIRAMfwsgAC0ANEEBRw00IAAgBCACELyAgIAAIhBFDTQgEEEVRw01IABB3AE2AhwgACAENgIUIABB1ZaAgAA2AhAgAEEVNgIMQQAhEAx+C0EAIRAgAEEANgIcIABBr4uAgAA2AhAgAEECNgIMIAAgFEEBajYCFAx9C0EAIRAMYwtBAiEQDGILQQ0hEAxhC0EPIRAMYAtBJSEQDF8LQRMhEAxeC0EVIRAMXQtBFiEQDFwLQRchEAxbC0EYIRAMWgtBGSEQDFkLQRohEAxYC0EbIRAMVwtBHCEQDFYLQR0hEAxVC0EfIRAMVAtBISEQDFMLQSMhEAxSC0HGACEQDFELQS4hEAxQC0EvIRAMTwtBOyEQDE4LQT0hEAxNC0HIACEQDEwLQckAIRAMSwtBywAhEAxKC0HMACEQDEkLQc4AIRAMSAtB0QAhEAxHC0HVACEQDEYLQdgAIRAMRQtB2QAhEAxEC0HbACEQDEMLQeQAIRAMQgtB5QAhEAxBC0HxACEQDEALQfQAIRAMPwtBjQEhEAw+C0GXASEQDD0LQakBIRAMPAtBrAEhEAw7C0HAASEQDDoLQbkBIRAMOQtBrwEhEAw4C0GxASEQDDcLQbIBIRAMNgtBtAEhEAw1C0G1ASEQDDQLQboBIRAMMwtBvQEhEAwyC0G/ASEQDDELQcEBIRAMMAsgAEEANgIcIAAgBDYCFCAAQemLgIAANgIQIABBHzYCDEEAIRAMSAsgAEHbATYCHCAAIAQ2AhQgAEH6loCAADYCECAAQRU2AgxBACEQDEcLIABB+AA2AhwgACAMNgIUIABBypiAgAA2AhAgAEEVNgIMQQAhEAxGCyAAQdEANgIcIAAgBTYCFCAAQbCXgIAANgIQIABBFTYCDEEAIRAMRQsgAEH5ADYCHCAAIAE2AhQgACAQNgIMQQAhEAxECyAAQfgANgIcIAAgATYCFCAAQcqYgIAANgIQIABBFTYCDEEAIRAMQwsgAEHkADYCHCAAIAE2AhQgAEHjl4CAADYCECAAQRU2AgxBACEQDEILIABB1wA2AhwgACABNgIUIABByZeAgAA2AhAgAEEVNgIMQQAhEAxBCyAAQQA2AhwgACABNgIUIABBuY2AgAA2AhAgAEEaNgIMQQAhEAxACyAAQcIANgIcIAAgATYCFCAAQeOYgIAANgIQIABBFTYCDEEAIRAMPwsgAEEANgIEIAAgDyAPELGAgIAAIgRFDQEgAEE6NgIcIAAgBDYCDCAAIA9BAWo2AhRBACEQDD4LIAAoAgQhBCAAQQA2AgQCQCAAIAQgARCxgICAACIERQ0AIABBOzYCHCAAIAQ2AgwgACABQQFqNgIUQQAhEAw+CyABQQFqIQEMLQsgD0EBaiEBDC0LIABBADYCHCAAIA82AhQgAEHkkoCAADYCECAAQQQ2AgxBACEQDDsLIABBNjYCHCAAIAQ2AhQgACACNgIMQQAhEAw6CyAAQS42AhwgACAONgIUIAAgBDYCDEEAIRAMOQsgAEHQADYCHCAAIAE2AhQgAEGRmICAADYCECAAQRU2AgxBACEQDDgLIA1BAWohAQwsCyAAQRU2AhwgACABNgIUIABBgpmAgAA2AhAgAEEVNgIMQQAhEAw2CyAAQRs2AhwgACABNgIUIABBkZeAgAA2AhAgAEEVNgIMQQAhEAw1CyAAQQ82AhwgACABNgIUIABBkZeAgAA2AhAgAEEVNgIMQQAhEAw0CyAAQQs2AhwgACABNgIUIABBkZeAgAA2AhAgAEEVNgIMQQAhEAwzCyAAQRo2AhwgACABNgIUIABBgpmAgAA2AhAgAEEVNgIMQQAhEAwyCyAAQQs2AhwgACABNgIUIABBgpmAgAA2AhAgAEEVNgIMQQAhEAwxCyAAQQo2AhwgACABNgIUIABB5JaAgAA2AhAgAEEVNgIMQQAhEAwwCyAAQR42AhwgACABNgIUIABB+ZeAgAA2AhAgAEEVNgIMQQAhEAwvCyAAQQA2AhwgACAQNgIUIABB2o2AgAA2AhAgAEEUNgIMQQAhEAwuCyAAQQQ2AhwgACABNgIUIABBsJiAgAA2AhAgAEEVNgIMQQAhEAwtCyAAQQA2AgAgC0EBaiELC0G4ASEQDBILIABBADYCACAQQQFqIQFB9QAhEAwRCyABIQECQCAALQApQQVHDQBB4wAhEAwRC0HiACEQDBALQQAhECAAQQA2AhwgAEHkkYCAADYCECAAQQc2AgwgACAUQQFqNgIUDCgLIABBADYCACAXQQFqIQFBwAAhEAwOC0EBIQELIAAgAToALCAAQQA2AgAgF0EBaiEBC0EoIRAMCwsgASEBC0E4IRAMCQsCQCABIg8gAkYNAANAAkAgDy0AAEGAvoCAAGotAAAiAUEBRg0AIAFBAkcNAyAPQQFqIQEMBAsgD0EBaiIPIAJHDQALQT4hEAwiC0E+IRAMIQsgAEEAOgAsIA8hAQwBC0ELIRAMBgtBOiEQDAULIAFBAWohAUEtIRAMBAsgACABOgAsIABBADYCACAWQQFqIQFBDCEQDAMLIABBADYCACAXQQFqIQFBCiEQDAILIABBADYCAAsgAEEAOgAsIA0hAUEJIRAMAAsLQQAhECAAQQA2AhwgACALNgIUIABBzZCAgAA2AhAgAEEJNgIMDBcLQQAhECAAQQA2AhwgACAKNgIUIABB6YqAgAA2AhAgAEEJNgIMDBYLQQAhECAAQQA2AhwgACAJNgIUIABBt5CAgAA2AhAgAEEJNgIMDBULQQAhECAAQQA2AhwgACAINgIUIABBnJGAgAA2AhAgAEEJNgIMDBQLQQAhECAAQQA2AhwgACABNgIUIABBzZCAgAA2AhAgAEEJNgIMDBMLQQAhECAAQQA2AhwgACABNgIUIABB6YqAgAA2AhAgAEEJNgIMDBILQQAhECAAQQA2AhwgACABNgIUIABBt5CAgAA2AhAgAEEJNgIMDBELQQAhECAAQQA2AhwgACABNgIUIABBnJGAgAA2AhAgAEEJNgIMDBALQQAhECAAQQA2AhwgACABNgIUIABBl5WAgAA2AhAgAEEPNgIMDA8LQQAhECAAQQA2AhwgACABNgIUIABBl5WAgAA2AhAgAEEPNgIMDA4LQQAhECAAQQA2AhwgACABNgIUIABBwJKAgAA2AhAgAEELNgIMDA0LQQAhECAAQQA2AhwgACABNgIUIABBlYmAgAA2AhAgAEELNgIMDAwLQQAhECAAQQA2AhwgACABNgIUIABB4Y+AgAA2AhAgAEEKNgIMDAsLQQAhECAAQQA2AhwgACABNgIUIABB+4+AgAA2AhAgAEEKNgIMDAoLQQAhECAAQQA2AhwgACABNgIUIABB8ZmAgAA2AhAgAEECNgIMDAkLQQAhECAAQQA2AhwgACABNgIUIABBxJSAgAA2AhAgAEECNgIMDAgLQQAhECAAQQA2AhwgACABNgIUIABB8pWAgAA2AhAgAEECNgIMDAcLIABBAjYCHCAAIAE2AhQgAEGcmoCAADYCECAAQRY2AgxBACEQDAYLQQEhEAwFC0HUACEQIAEiBCACRg0EIANBCGogACAEIAJB2MKAgABBChDFgICAACADKAIMIQQgAygCCA4DAQQCAAsQyoCAgAAACyAAQQA2AhwgAEG1moCAADYCECAAQRc2AgwgACAEQQFqNgIUQQAhEAwCCyAAQQA2AhwgACAENgIUIABBypqAgAA2AhAgAEEJNgIMQQAhEAwBCwJAIAEiBCACRw0AQSIhEAwBCyAAQYmAgIAANgIIIAAgBDYCBEEhIRALIANBEGokgICAgAAgEAuvAQECfyABKAIAIQYCQAJAIAIgA0YNACAEIAZqIQQgBiADaiACayEHIAIgBkF/cyAFaiIGaiEFA0ACQCACLQAAIAQtAABGDQBBAiEEDAMLAkAgBg0AQQAhBCAFIQIMAwsgBkF/aiEGIARBAWohBCACQQFqIgIgA0cNAAsgByEGIAMhAgsgAEEBNgIAIAEgBjYCACAAIAI2AgQPCyABQQA2AgAgACAENgIAIAAgAjYCBAsKACAAEMeAgIAAC/I2AQt/I4CAgIAAQRBrIgEkgICAgAACQEEAKAKg0ICAAA0AQQAQy4CAgABBgNSEgABrIgJB2QBJDQBBACEDAkBBACgC4NOAgAAiBA0AQQBCfzcC7NOAgABBAEKAgISAgIDAADcC5NOAgABBACABQQhqQXBxQdiq1aoFcyIENgLg04CAAEEAQQA2AvTTgIAAQQBBADYCxNOAgAALQQAgAjYCzNOAgABBAEGA1ISAADYCyNOAgABBAEGA1ISAADYCmNCAgABBACAENgKs0ICAAEEAQX82AqjQgIAAA0AgA0HE0ICAAGogA0G40ICAAGoiBDYCACAEIANBsNCAgABqIgU2AgAgA0G80ICAAGogBTYCACADQczQgIAAaiADQcDQgIAAaiIFNgIAIAUgBDYCACADQdTQgIAAaiADQcjQgIAAaiIENgIAIAQgBTYCACADQdDQgIAAaiAENgIAIANBIGoiA0GAAkcNAAtBgNSEgABBeEGA1ISAAGtBD3FBAEGA1ISAAEEIakEPcRsiA2oiBEEEaiACQUhqIgUgA2siA0EBcjYCAEEAQQAoAvDTgIAANgKk0ICAAEEAIAM2ApTQgIAAQQAgBDYCoNCAgABBgNSEgAAgBWpBODYCBAsCQAJAAkACQAJAAkACQAJAAkACQAJAAkAgAEHsAUsNAAJAQQAoAojQgIAAIgZBECAAQRNqQXBxIABBC0kbIgJBA3YiBHYiA0EDcUUNAAJAAkAgA0EBcSAEckEBcyIFQQN0IgRBsNCAgABqIgMgBEG40ICAAGooAgAiBCgCCCICRw0AQQAgBkF+IAV3cTYCiNCAgAAMAQsgAyACNgIIIAIgAzYCDAsgBEEIaiEDIAQgBUEDdCIFQQNyNgIEIAQgBWoiBCAEKAIEQQFyNgIEDAwLIAJBACgCkNCAgAAiB00NAQJAIANFDQACQAJAIAMgBHRBAiAEdCIDQQAgA2tycSIDQQAgA2txQX9qIgMgA0EMdkEQcSIDdiIEQQV2QQhxIgUgA3IgBCAFdiIDQQJ2QQRxIgRyIAMgBHYiA0EBdkECcSIEciADIAR2IgNBAXZBAXEiBHIgAyAEdmoiBEEDdCIDQbDQgIAAaiIFIANBuNCAgABqKAIAIgMoAggiAEcNAEEAIAZBfiAEd3EiBjYCiNCAgAAMAQsgBSAANgIIIAAgBTYCDAsgAyACQQNyNgIEIAMgBEEDdCIEaiAEIAJrIgU2AgAgAyACaiIAIAVBAXI2AgQCQCAHRQ0AIAdBeHFBsNCAgABqIQJBACgCnNCAgAAhBAJAAkAgBkEBIAdBA3Z0IghxDQBBACAGIAhyNgKI0ICAACACIQgMAQsgAigCCCEICyAIIAQ2AgwgAiAENgIIIAQgAjYCDCAEIAg2AggLIANBCGohA0EAIAA2ApzQgIAAQQAgBTYCkNCAgAAMDAtBACgCjNCAgAAiCUUNASAJQQAgCWtxQX9qIgMgA0EMdkEQcSIDdiIEQQV2QQhxIgUgA3IgBCAFdiIDQQJ2QQRxIgRyIAMgBHYiA0EBdkECcSIEciADIAR2IgNBAXZBAXEiBHIgAyAEdmpBAnRBuNKAgABqKAIAIgAoAgRBeHEgAmshBCAAIQUCQANAAkAgBSgCECIDDQAgBUEUaigCACIDRQ0CCyADKAIEQXhxIAJrIgUgBCAFIARJIgUbIQQgAyAAIAUbIQAgAyEFDAALCyAAKAIYIQoCQCAAKAIMIgggAEYNACAAKAIIIgNBACgCmNCAgABJGiAIIAM2AgggAyAINgIMDAsLAkAgAEEUaiIFKAIAIgMNACAAKAIQIgNFDQMgAEEQaiEFCwNAIAUhCyADIghBFGoiBSgCACIDDQAgCEEQaiEFIAgoAhAiAw0ACyALQQA2AgAMCgtBfyECIABBv39LDQAgAEETaiIDQXBxIQJBACgCjNCAgAAiB0UNAEEAIQsCQCACQYACSQ0AQR8hCyACQf///wdLDQAgA0EIdiIDIANBgP4/akEQdkEIcSIDdCIEIARBgOAfakEQdkEEcSIEdCIFIAVBgIAPakEQdkECcSIFdEEPdiADIARyIAVyayIDQQF0IAIgA0EVanZBAXFyQRxqIQsLQQAgAmshBAJAAkACQAJAIAtBAnRBuNKAgABqKAIAIgUNAEEAIQNBACEIDAELQQAhAyACQQBBGSALQQF2ayALQR9GG3QhAEEAIQgDQAJAIAUoAgRBeHEgAmsiBiAETw0AIAYhBCAFIQggBg0AQQAhBCAFIQggBSEDDAMLIAMgBUEUaigCACIGIAYgBSAAQR12QQRxakEQaigCACIFRhsgAyAGGyEDIABBAXQhACAFDQALCwJAIAMgCHINAEEAIQhBAiALdCIDQQAgA2tyIAdxIgNFDQMgA0EAIANrcUF/aiIDIANBDHZBEHEiA3YiBUEFdkEIcSIAIANyIAUgAHYiA0ECdkEEcSIFciADIAV2IgNBAXZBAnEiBXIgAyAFdiIDQQF2QQFxIgVyIAMgBXZqQQJ0QbjSgIAAaigCACEDCyADRQ0BCwNAIAMoAgRBeHEgAmsiBiAESSEAAkAgAygCECIFDQAgA0EUaigCACEFCyAGIAQgABshBCADIAggABshCCAFIQMgBQ0ACwsgCEUNACAEQQAoApDQgIAAIAJrTw0AIAgoAhghCwJAIAgoAgwiACAIRg0AIAgoAggiA0EAKAKY0ICAAEkaIAAgAzYCCCADIAA2AgwMCQsCQCAIQRRqIgUoAgAiAw0AIAgoAhAiA0UNAyAIQRBqIQULA0AgBSEGIAMiAEEUaiIFKAIAIgMNACAAQRBqIQUgACgCECIDDQALIAZBADYCAAwICwJAQQAoApDQgIAAIgMgAkkNAEEAKAKc0ICAACEEAkACQCADIAJrIgVBEEkNACAEIAJqIgAgBUEBcjYCBEEAIAU2ApDQgIAAQQAgADYCnNCAgAAgBCADaiAFNgIAIAQgAkEDcjYCBAwBCyAEIANBA3I2AgQgBCADaiIDIAMoAgRBAXI2AgRBAEEANgKc0ICAAEEAQQA2ApDQgIAACyAEQQhqIQMMCgsCQEEAKAKU0ICAACIAIAJNDQBBACgCoNCAgAAiAyACaiIEIAAgAmsiBUEBcjYCBEEAIAU2ApTQgIAAQQAgBDYCoNCAgAAgAyACQQNyNgIEIANBCGohAwwKCwJAAkBBACgC4NOAgABFDQBBACgC6NOAgAAhBAwBC0EAQn83AuzTgIAAQQBCgICEgICAwAA3AuTTgIAAQQAgAUEMakFwcUHYqtWqBXM2AuDTgIAAQQBBADYC9NOAgABBAEEANgLE04CAAEGAgAQhBAtBACEDAkAgBCACQccAaiIHaiIGQQAgBGsiC3EiCCACSw0AQQBBMDYC+NOAgAAMCgsCQEEAKALA04CAACIDRQ0AAkBBACgCuNOAgAAiBCAIaiIFIARNDQAgBSADTQ0BC0EAIQNBAEEwNgL404CAAAwKC0EALQDE04CAAEEEcQ0EAkACQAJAQQAoAqDQgIAAIgRFDQBByNOAgAAhAwNAAkAgAygCACIFIARLDQAgBSADKAIEaiAESw0DCyADKAIIIgMNAAsLQQAQy4CAgAAiAEF/Rg0FIAghBgJAQQAoAuTTgIAAIgNBf2oiBCAAcUUNACAIIABrIAQgAGpBACADa3FqIQYLIAYgAk0NBSAGQf7///8HSw0FAkBBACgCwNOAgAAiA0UNAEEAKAK404CAACIEIAZqIgUgBE0NBiAFIANLDQYLIAYQy4CAgAAiAyAARw0BDAcLIAYgAGsgC3EiBkH+////B0sNBCAGEMuAgIAAIgAgAygCACADKAIEakYNAyAAIQMLAkAgA0F/Rg0AIAJByABqIAZNDQACQCAHIAZrQQAoAujTgIAAIgRqQQAgBGtxIgRB/v///wdNDQAgAyEADAcLAkAgBBDLgICAAEF/Rg0AIAQgBmohBiADIQAMBwtBACAGaxDLgICAABoMBAsgAyEAIANBf0cNBQwDC0EAIQgMBwtBACEADAULIABBf0cNAgtBAEEAKALE04CAAEEEcjYCxNOAgAALIAhB/v///wdLDQEgCBDLgICAACEAQQAQy4CAgAAhAyAAQX9GDQEgA0F/Rg0BIAAgA08NASADIABrIgYgAkE4ak0NAQtBAEEAKAK404CAACAGaiIDNgK404CAAAJAIANBACgCvNOAgABNDQBBACADNgK804CAAAsCQAJAAkACQEEAKAKg0ICAACIERQ0AQcjTgIAAIQMDQCAAIAMoAgAiBSADKAIEIghqRg0CIAMoAggiAw0ADAMLCwJAAkBBACgCmNCAgAAiA0UNACAAIANPDQELQQAgADYCmNCAgAALQQAhA0EAIAY2AszTgIAAQQAgADYCyNOAgABBAEF/NgKo0ICAAEEAQQAoAuDTgIAANgKs0ICAAEEAQQA2AtTTgIAAA0AgA0HE0ICAAGogA0G40ICAAGoiBDYCACAEIANBsNCAgABqIgU2AgAgA0G80ICAAGogBTYCACADQczQgIAAaiADQcDQgIAAaiIFNgIAIAUgBDYCACADQdTQgIAAaiADQcjQgIAAaiIENgIAIAQgBTYCACADQdDQgIAAaiAENgIAIANBIGoiA0GAAkcNAAsgAEF4IABrQQ9xQQAgAEEIakEPcRsiA2oiBCAGQUhqIgUgA2siA0EBcjYCBEEAQQAoAvDTgIAANgKk0ICAAEEAIAM2ApTQgIAAQQAgBDYCoNCAgAAgACAFakE4NgIEDAILIAMtAAxBCHENACAEIAVJDQAgBCAATw0AIARBeCAEa0EPcUEAIARBCGpBD3EbIgVqIgBBACgClNCAgAAgBmoiCyAFayIFQQFyNgIEIAMgCCAGajYCBEEAQQAoAvDTgIAANgKk0ICAAEEAIAU2ApTQgIAAQQAgADYCoNCAgAAgBCALakE4NgIEDAELAkAgAEEAKAKY0ICAACIITw0AQQAgADYCmNCAgAAgACEICyAAIAZqIQVByNOAgAAhAwJAAkACQAJAAkACQAJAA0AgAygCACAFRg0BIAMoAggiAw0ADAILCyADLQAMQQhxRQ0BC0HI04CAACEDA0ACQCADKAIAIgUgBEsNACAFIAMoAgRqIgUgBEsNAwsgAygCCCEDDAALCyADIAA2AgAgAyADKAIEIAZqNgIEIABBeCAAa0EPcUEAIABBCGpBD3EbaiILIAJBA3I2AgQgBUF4IAVrQQ9xQQAgBUEIakEPcRtqIgYgCyACaiICayEDAkAgBiAERw0AQQAgAjYCoNCAgABBAEEAKAKU0ICAACADaiIDNgKU0ICAACACIANBAXI2AgQMAwsCQCAGQQAoApzQgIAARw0AQQAgAjYCnNCAgABBAEEAKAKQ0ICAACADaiIDNgKQ0ICAACACIANBAXI2AgQgAiADaiADNgIADAMLAkAgBigCBCIEQQNxQQFHDQAgBEF4cSEHAkACQCAEQf8BSw0AIAYoAggiBSAEQQN2IghBA3RBsNCAgABqIgBGGgJAIAYoAgwiBCAFRw0AQQBBACgCiNCAgABBfiAId3E2AojQgIAADAILIAQgAEYaIAQgBTYCCCAFIAQ2AgwMAQsgBigCGCEJAkACQCAGKAIMIgAgBkYNACAGKAIIIgQgCEkaIAAgBDYCCCAEIAA2AgwMAQsCQCAGQRRqIgQoAgAiBQ0AIAZBEGoiBCgCACIFDQBBACEADAELA0AgBCEIIAUiAEEUaiIEKAIAIgUNACAAQRBqIQQgACgCECIFDQALIAhBADYCAAsgCUUNAAJAAkAgBiAGKAIcIgVBAnRBuNKAgABqIgQoAgBHDQAgBCAANgIAIAANAUEAQQAoAozQgIAAQX4gBXdxNgKM0ICAAAwCCyAJQRBBFCAJKAIQIAZGG2ogADYCACAARQ0BCyAAIAk2AhgCQCAGKAIQIgRFDQAgACAENgIQIAQgADYCGAsgBigCFCIERQ0AIABBFGogBDYCACAEIAA2AhgLIAcgA2ohAyAGIAdqIgYoAgQhBAsgBiAEQX5xNgIEIAIgA2ogAzYCACACIANBAXI2AgQCQCADQf8BSw0AIANBeHFBsNCAgABqIQQCQAJAQQAoAojQgIAAIgVBASADQQN2dCIDcQ0AQQAgBSADcjYCiNCAgAAgBCEDDAELIAQoAgghAwsgAyACNgIMIAQgAjYCCCACIAQ2AgwgAiADNgIIDAMLQR8hBAJAIANB////B0sNACADQQh2IgQgBEGA/j9qQRB2QQhxIgR0IgUgBUGA4B9qQRB2QQRxIgV0IgAgAEGAgA9qQRB2QQJxIgB0QQ92IAQgBXIgAHJrIgRBAXQgAyAEQRVqdkEBcXJBHGohBAsgAiAENgIcIAJCADcCECAEQQJ0QbjSgIAAaiEFAkBBACgCjNCAgAAiAEEBIAR0IghxDQAgBSACNgIAQQAgACAIcjYCjNCAgAAgAiAFNgIYIAIgAjYCCCACIAI2AgwMAwsgA0EAQRkgBEEBdmsgBEEfRht0IQQgBSgCACEAA0AgACIFKAIEQXhxIANGDQIgBEEddiEAIARBAXQhBCAFIABBBHFqQRBqIggoAgAiAA0ACyAIIAI2AgAgAiAFNgIYIAIgAjYCDCACIAI2AggMAgsgAEF4IABrQQ9xQQAgAEEIakEPcRsiA2oiCyAGQUhqIgggA2siA0EBcjYCBCAAIAhqQTg2AgQgBCAFQTcgBWtBD3FBACAFQUlqQQ9xG2pBQWoiCCAIIARBEGpJGyIIQSM2AgRBAEEAKALw04CAADYCpNCAgABBACADNgKU0ICAAEEAIAs2AqDQgIAAIAhBEGpBACkC0NOAgAA3AgAgCEEAKQLI04CAADcCCEEAIAhBCGo2AtDTgIAAQQAgBjYCzNOAgABBACAANgLI04CAAEEAQQA2AtTTgIAAIAhBJGohAwNAIANBBzYCACADQQRqIgMgBUkNAAsgCCAERg0DIAggCCgCBEF+cTYCBCAIIAggBGsiADYCACAEIABBAXI2AgQCQCAAQf8BSw0AIABBeHFBsNCAgABqIQMCQAJAQQAoAojQgIAAIgVBASAAQQN2dCIAcQ0AQQAgBSAAcjYCiNCAgAAgAyEFDAELIAMoAgghBQsgBSAENgIMIAMgBDYCCCAEIAM2AgwgBCAFNgIIDAQLQR8hAwJAIABB////B0sNACAAQQh2IgMgA0GA/j9qQRB2QQhxIgN0IgUgBUGA4B9qQRB2QQRxIgV0IgggCEGAgA9qQRB2QQJxIgh0QQ92IAMgBXIgCHJrIgNBAXQgACADQRVqdkEBcXJBHGohAwsgBCADNgIcIARCADcCECADQQJ0QbjSgIAAaiEFAkBBACgCjNCAgAAiCEEBIAN0IgZxDQAgBSAENgIAQQAgCCAGcjYCjNCAgAAgBCAFNgIYIAQgBDYCCCAEIAQ2AgwMBAsgAEEAQRkgA0EBdmsgA0EfRht0IQMgBSgCACEIA0AgCCIFKAIEQXhxIABGDQMgA0EddiEIIANBAXQhAyAFIAhBBHFqQRBqIgYoAgAiCA0ACyAGIAQ2AgAgBCAFNgIYIAQgBDYCDCAEIAQ2AggMAwsgBSgCCCIDIAI2AgwgBSACNgIIIAJBADYCGCACIAU2AgwgAiADNgIICyALQQhqIQMMBQsgBSgCCCIDIAQ2AgwgBSAENgIIIARBADYCGCAEIAU2AgwgBCADNgIIC0EAKAKU0ICAACIDIAJNDQBBACgCoNCAgAAiBCACaiIFIAMgAmsiA0EBcjYCBEEAIAM2ApTQgIAAQQAgBTYCoNCAgAAgBCACQQNyNgIEIARBCGohAwwDC0EAIQNBAEEwNgL404CAAAwCCwJAIAtFDQACQAJAIAggCCgCHCIFQQJ0QbjSgIAAaiIDKAIARw0AIAMgADYCACAADQFBACAHQX4gBXdxIgc2AozQgIAADAILIAtBEEEUIAsoAhAgCEYbaiAANgIAIABFDQELIAAgCzYCGAJAIAgoAhAiA0UNACAAIAM2AhAgAyAANgIYCyAIQRRqKAIAIgNFDQAgAEEUaiADNgIAIAMgADYCGAsCQAJAIARBD0sNACAIIAQgAmoiA0EDcjYCBCAIIANqIgMgAygCBEEBcjYCBAwBCyAIIAJqIgAgBEEBcjYCBCAIIAJBA3I2AgQgACAEaiAENgIAAkAgBEH/AUsNACAEQXhxQbDQgIAAaiEDAkACQEEAKAKI0ICAACIFQQEgBEEDdnQiBHENAEEAIAUgBHI2AojQgIAAIAMhBAwBCyADKAIIIQQLIAQgADYCDCADIAA2AgggACADNgIMIAAgBDYCCAwBC0EfIQMCQCAEQf///wdLDQAgBEEIdiIDIANBgP4/akEQdkEIcSIDdCIFIAVBgOAfakEQdkEEcSIFdCICIAJBgIAPakEQdkECcSICdEEPdiADIAVyIAJyayIDQQF0IAQgA0EVanZBAXFyQRxqIQMLIAAgAzYCHCAAQgA3AhAgA0ECdEG40oCAAGohBQJAIAdBASADdCICcQ0AIAUgADYCAEEAIAcgAnI2AozQgIAAIAAgBTYCGCAAIAA2AgggACAANgIMDAELIARBAEEZIANBAXZrIANBH0YbdCEDIAUoAgAhAgJAA0AgAiIFKAIEQXhxIARGDQEgA0EddiECIANBAXQhAyAFIAJBBHFqQRBqIgYoAgAiAg0ACyAGIAA2AgAgACAFNgIYIAAgADYCDCAAIAA2AggMAQsgBSgCCCIDIAA2AgwgBSAANgIIIABBADYCGCAAIAU2AgwgACADNgIICyAIQQhqIQMMAQsCQCAKRQ0AAkACQCAAIAAoAhwiBUECdEG40oCAAGoiAygCAEcNACADIAg2AgAgCA0BQQAgCUF+IAV3cTYCjNCAgAAMAgsgCkEQQRQgCigCECAARhtqIAg2AgAgCEUNAQsgCCAKNgIYAkAgACgCECIDRQ0AIAggAzYCECADIAg2AhgLIABBFGooAgAiA0UNACAIQRRqIAM2AgAgAyAINgIYCwJAAkAgBEEPSw0AIAAgBCACaiIDQQNyNgIEIAAgA2oiAyADKAIEQQFyNgIEDAELIAAgAmoiBSAEQQFyNgIEIAAgAkEDcjYCBCAFIARqIAQ2AgACQCAHRQ0AIAdBeHFBsNCAgABqIQJBACgCnNCAgAAhAwJAAkBBASAHQQN2dCIIIAZxDQBBACAIIAZyNgKI0ICAACACIQgMAQsgAigCCCEICyAIIAM2AgwgAiADNgIIIAMgAjYCDCADIAg2AggLQQAgBTYCnNCAgABBACAENgKQ0ICAAAsgAEEIaiEDCyABQRBqJICAgIAAIAMLCgAgABDJgICAAAviDQEHfwJAIABFDQAgAEF4aiIBIABBfGooAgAiAkF4cSIAaiEDAkAgAkEBcQ0AIAJBA3FFDQEgASABKAIAIgJrIgFBACgCmNCAgAAiBEkNASACIABqIQACQCABQQAoApzQgIAARg0AAkAgAkH/AUsNACABKAIIIgQgAkEDdiIFQQN0QbDQgIAAaiIGRhoCQCABKAIMIgIgBEcNAEEAQQAoAojQgIAAQX4gBXdxNgKI0ICAAAwDCyACIAZGGiACIAQ2AgggBCACNgIMDAILIAEoAhghBwJAAkAgASgCDCIGIAFGDQAgASgCCCICIARJGiAGIAI2AgggAiAGNgIMDAELAkAgAUEUaiICKAIAIgQNACABQRBqIgIoAgAiBA0AQQAhBgwBCwNAIAIhBSAEIgZBFGoiAigCACIEDQAgBkEQaiECIAYoAhAiBA0ACyAFQQA2AgALIAdFDQECQAJAIAEgASgCHCIEQQJ0QbjSgIAAaiICKAIARw0AIAIgBjYCACAGDQFBAEEAKAKM0ICAAEF+IAR3cTYCjNCAgAAMAwsgB0EQQRQgBygCECABRhtqIAY2AgAgBkUNAgsgBiAHNgIYAkAgASgCECICRQ0AIAYgAjYCECACIAY2AhgLIAEoAhQiAkUNASAGQRRqIAI2AgAgAiAGNgIYDAELIAMoAgQiAkEDcUEDRw0AIAMgAkF+cTYCBEEAIAA2ApDQgIAAIAEgAGogADYCACABIABBAXI2AgQPCyABIANPDQAgAygCBCICQQFxRQ0AAkACQCACQQJxDQACQCADQQAoAqDQgIAARw0AQQAgATYCoNCAgABBAEEAKAKU0ICAACAAaiIANgKU0ICAACABIABBAXI2AgQgAUEAKAKc0ICAAEcNA0EAQQA2ApDQgIAAQQBBADYCnNCAgAAPCwJAIANBACgCnNCAgABHDQBBACABNgKc0ICAAEEAQQAoApDQgIAAIABqIgA2ApDQgIAAIAEgAEEBcjYCBCABIABqIAA2AgAPCyACQXhxIABqIQACQAJAIAJB/wFLDQAgAygCCCIEIAJBA3YiBUEDdEGw0ICAAGoiBkYaAkAgAygCDCICIARHDQBBAEEAKAKI0ICAAEF+IAV3cTYCiNCAgAAMAgsgAiAGRhogAiAENgIIIAQgAjYCDAwBCyADKAIYIQcCQAJAIAMoAgwiBiADRg0AIAMoAggiAkEAKAKY0ICAAEkaIAYgAjYCCCACIAY2AgwMAQsCQCADQRRqIgIoAgAiBA0AIANBEGoiAigCACIEDQBBACEGDAELA0AgAiEFIAQiBkEUaiICKAIAIgQNACAGQRBqIQIgBigCECIEDQALIAVBADYCAAsgB0UNAAJAAkAgAyADKAIcIgRBAnRBuNKAgABqIgIoAgBHDQAgAiAGNgIAIAYNAUEAQQAoAozQgIAAQX4gBHdxNgKM0ICAAAwCCyAHQRBBFCAHKAIQIANGG2ogBjYCACAGRQ0BCyAGIAc2AhgCQCADKAIQIgJFDQAgBiACNgIQIAIgBjYCGAsgAygCFCICRQ0AIAZBFGogAjYCACACIAY2AhgLIAEgAGogADYCACABIABBAXI2AgQgAUEAKAKc0ICAAEcNAUEAIAA2ApDQgIAADwsgAyACQX5xNgIEIAEgAGogADYCACABIABBAXI2AgQLAkAgAEH/AUsNACAAQXhxQbDQgIAAaiECAkACQEEAKAKI0ICAACIEQQEgAEEDdnQiAHENAEEAIAQgAHI2AojQgIAAIAIhAAwBCyACKAIIIQALIAAgATYCDCACIAE2AgggASACNgIMIAEgADYCCA8LQR8hAgJAIABB////B0sNACAAQQh2IgIgAkGA/j9qQRB2QQhxIgJ0IgQgBEGA4B9qQRB2QQRxIgR0IgYgBkGAgA9qQRB2QQJxIgZ0QQ92IAIgBHIgBnJrIgJBAXQgACACQRVqdkEBcXJBHGohAgsgASACNgIcIAFCADcCECACQQJ0QbjSgIAAaiEEAkACQEEAKAKM0ICAACIGQQEgAnQiA3ENACAEIAE2AgBBACAGIANyNgKM0ICAACABIAQ2AhggASABNgIIIAEgATYCDAwBCyAAQQBBGSACQQF2ayACQR9GG3QhAiAEKAIAIQYCQANAIAYiBCgCBEF4cSAARg0BIAJBHXYhBiACQQF0IQIgBCAGQQRxakEQaiIDKAIAIgYNAAsgAyABNgIAIAEgBDYCGCABIAE2AgwgASABNgIIDAELIAQoAggiACABNgIMIAQgATYCCCABQQA2AhggASAENgIMIAEgADYCCAtBAEEAKAKo0ICAAEF/aiIBQX8gARs2AqjQgIAACwsEAAAAC04AAkAgAA0APwBBEHQPCwJAIABB//8DcQ0AIABBf0wNAAJAIABBEHZAACIAQX9HDQBBAEEwNgL404CAAEF/DwsgAEEQdA8LEMqAgIAAAAvyAgIDfwF+AkAgAkUNACAAIAE6AAAgAiAAaiIDQX9qIAE6AAAgAkEDSQ0AIAAgAToAAiAAIAE6AAEgA0F9aiABOgAAIANBfmogAToAACACQQdJDQAgACABOgADIANBfGogAToAACACQQlJDQAgAEEAIABrQQNxIgRqIgMgAUH/AXFBgYKECGwiATYCACADIAIgBGtBfHEiBGoiAkF8aiABNgIAIARBCUkNACADIAE2AgggAyABNgIEIAJBeGogATYCACACQXRqIAE2AgAgBEEZSQ0AIAMgATYCGCADIAE2AhQgAyABNgIQIAMgATYCDCACQXBqIAE2AgAgAkFsaiABNgIAIAJBaGogATYCACACQWRqIAE2AgAgBCADQQRxQRhyIgVrIgJBIEkNACABrUKBgICAEH4hBiADIAVqIQEDQCABIAY3AxggASAGNwMQIAEgBjcDCCABIAY3AwAgAUEgaiEBIAJBYGoiAkEfSw0ACwsgAAsLjkgBAEGACAuGSAEAAAACAAAAAwAAAAAAAAAAAAAABAAAAAUAAAAAAAAAAAAAAAYAAAAHAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASW52YWxpZCBjaGFyIGluIHVybCBxdWVyeQBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX2JvZHkAQ29udGVudC1MZW5ndGggb3ZlcmZsb3cAQ2h1bmsgc2l6ZSBvdmVyZmxvdwBSZXNwb25zZSBvdmVyZmxvdwBJbnZhbGlkIG1ldGhvZCBmb3IgSFRUUC94LnggcmVxdWVzdABJbnZhbGlkIG1ldGhvZCBmb3IgUlRTUC94LnggcmVxdWVzdABFeHBlY3RlZCBTT1VSQ0UgbWV0aG9kIGZvciBJQ0UveC54IHJlcXVlc3QASW52YWxpZCBjaGFyIGluIHVybCBmcmFnbWVudCBzdGFydABFeHBlY3RlZCBkb3QAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9zdGF0dXMASW52YWxpZCByZXNwb25zZSBzdGF0dXMASW52YWxpZCBjaGFyYWN0ZXIgaW4gY2h1bmsgZXh0ZW5zaW9ucwBVc2VyIGNhbGxiYWNrIGVycm9yAGBvbl9yZXNldGAgY2FsbGJhY2sgZXJyb3IAYG9uX2NodW5rX2hlYWRlcmAgY2FsbGJhY2sgZXJyb3IAYG9uX21lc3NhZ2VfYmVnaW5gIGNhbGxiYWNrIGVycm9yAGBvbl9jaHVua19leHRlbnNpb25fdmFsdWVgIGNhbGxiYWNrIGVycm9yAGBvbl9zdGF0dXNfY29tcGxldGVgIGNhbGxiYWNrIGVycm9yAGBvbl92ZXJzaW9uX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fdXJsX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fY2h1bmtfY29tcGxldGVgIGNhbGxiYWNrIGVycm9yAGBvbl9oZWFkZXJfdmFsdWVfY29tcGxldGVgIGNhbGxiYWNrIGVycm9yAGBvbl9tZXNzYWdlX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fbWV0aG9kX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25faGVhZGVyX2ZpZWxkX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fY2h1bmtfZXh0ZW5zaW9uX25hbWVgIGNhbGxiYWNrIGVycm9yAFVuZXhwZWN0ZWQgY2hhciBpbiB1cmwgc2VydmVyAEludmFsaWQgaGVhZGVyIHZhbHVlIGNoYXIASW52YWxpZCBoZWFkZXIgZmllbGQgY2hhcgBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX3ZlcnNpb24ASW52YWxpZCBtaW5vciB2ZXJzaW9uAEludmFsaWQgbWFqb3IgdmVyc2lvbgBFeHBlY3RlZCBzcGFjZSBhZnRlciB2ZXJzaW9uAEV4cGVjdGVkIENSTEYgYWZ0ZXIgdmVyc2lvbgBJbnZhbGlkIEhUVFAgdmVyc2lvbgBJbnZhbGlkIGhlYWRlciB0b2tlbgBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX3VybABJbnZhbGlkIGNoYXJhY3RlcnMgaW4gdXJsAFVuZXhwZWN0ZWQgc3RhcnQgY2hhciBpbiB1cmwARG91YmxlIEAgaW4gdXJsAEVtcHR5IENvbnRlbnQtTGVuZ3RoAEludmFsaWQgY2hhcmFjdGVyIGluIENvbnRlbnQtTGVuZ3RoAER1cGxpY2F0ZSBDb250ZW50LUxlbmd0aABJbnZhbGlkIGNoYXIgaW4gdXJsIHBhdGgAQ29udGVudC1MZW5ndGggY2FuJ3QgYmUgcHJlc2VudCB3aXRoIFRyYW5zZmVyLUVuY29kaW5nAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIHNpemUAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9oZWFkZXJfdmFsdWUAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9jaHVua19leHRlbnNpb25fdmFsdWUASW52YWxpZCBjaGFyYWN0ZXIgaW4gY2h1bmsgZXh0ZW5zaW9ucyB2YWx1ZQBNaXNzaW5nIGV4cGVjdGVkIExGIGFmdGVyIGhlYWRlciB2YWx1ZQBJbnZhbGlkIGBUcmFuc2Zlci1FbmNvZGluZ2AgaGVhZGVyIHZhbHVlAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMgcXVvdGUgdmFsdWUASW52YWxpZCBjaGFyYWN0ZXIgaW4gY2h1bmsgZXh0ZW5zaW9ucyBxdW90ZWQgdmFsdWUAUGF1c2VkIGJ5IG9uX2hlYWRlcnNfY29tcGxldGUASW52YWxpZCBFT0Ygc3RhdGUAb25fcmVzZXQgcGF1c2UAb25fY2h1bmtfaGVhZGVyIHBhdXNlAG9uX21lc3NhZ2VfYmVnaW4gcGF1c2UAb25fY2h1bmtfZXh0ZW5zaW9uX3ZhbHVlIHBhdXNlAG9uX3N0YXR1c19jb21wbGV0ZSBwYXVzZQBvbl92ZXJzaW9uX2NvbXBsZXRlIHBhdXNlAG9uX3VybF9jb21wbGV0ZSBwYXVzZQBvbl9jaHVua19jb21wbGV0ZSBwYXVzZQBvbl9oZWFkZXJfdmFsdWVfY29tcGxldGUgcGF1c2UAb25fbWVzc2FnZV9jb21wbGV0ZSBwYXVzZQBvbl9tZXRob2RfY29tcGxldGUgcGF1c2UAb25faGVhZGVyX2ZpZWxkX2NvbXBsZXRlIHBhdXNlAG9uX2NodW5rX2V4dGVuc2lvbl9uYW1lIHBhdXNlAFVuZXhwZWN0ZWQgc3BhY2UgYWZ0ZXIgc3RhcnQgbGluZQBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX2NodW5rX2V4dGVuc2lvbl9uYW1lAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMgbmFtZQBQYXVzZSBvbiBDT05ORUNUL1VwZ3JhZGUAUGF1c2Ugb24gUFJJL1VwZ3JhZGUARXhwZWN0ZWQgSFRUUC8yIENvbm5lY3Rpb24gUHJlZmFjZQBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX21ldGhvZABFeHBlY3RlZCBzcGFjZSBhZnRlciBtZXRob2QAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9oZWFkZXJfZmllbGQAUGF1c2VkAEludmFsaWQgd29yZCBlbmNvdW50ZXJlZABJbnZhbGlkIG1ldGhvZCBlbmNvdW50ZXJlZABVbmV4cGVjdGVkIGNoYXIgaW4gdXJsIHNjaGVtYQBSZXF1ZXN0IGhhcyBpbnZhbGlkIGBUcmFuc2Zlci1FbmNvZGluZ2AAU1dJVENIX1BST1hZAFVTRV9QUk9YWQBNS0FDVElWSVRZAFVOUFJPQ0VTU0FCTEVfRU5USVRZAENPUFkATU9WRURfUEVSTUFORU5UTFkAVE9PX0VBUkxZAE5PVElGWQBGQUlMRURfREVQRU5ERU5DWQBCQURfR0FURVdBWQBQTEFZAFBVVABDSEVDS09VVABHQVRFV0FZX1RJTUVPVVQAUkVRVUVTVF9USU1FT1VUAE5FVFdPUktfQ09OTkVDVF9USU1FT1VUAENPTk5FQ1RJT05fVElNRU9VVABMT0dJTl9USU1FT1VUAE5FVFdPUktfUkVBRF9USU1FT1VUAFBPU1QATUlTRElSRUNURURfUkVRVUVTVABDTElFTlRfQ0xPU0VEX1JFUVVFU1QAQ0xJRU5UX0NMT1NFRF9MT0FEX0JBTEFOQ0VEX1JFUVVFU1QAQkFEX1JFUVVFU1QASFRUUF9SRVFVRVNUX1NFTlRfVE9fSFRUUFNfUE9SVABSRVBPUlQASU1fQV9URUFQT1QAUkVTRVRfQ09OVEVOVABOT19DT05URU5UAFBBUlRJQUxfQ09OVEVOVABIUEVfSU5WQUxJRF9DT05TVEFOVABIUEVfQ0JfUkVTRVQAR0VUAEhQRV9TVFJJQ1QAQ09ORkxJQ1QAVEVNUE9SQVJZX1JFRElSRUNUAFBFUk1BTkVOVF9SRURJUkVDVABDT05ORUNUAE1VTFRJX1NUQVRVUwBIUEVfSU5WQUxJRF9TVEFUVVMAVE9PX01BTllfUkVRVUVTVFMARUFSTFlfSElOVFMAVU5BVkFJTEFCTEVfRk9SX0xFR0FMX1JFQVNPTlMAT1BUSU9OUwBTV0lUQ0hJTkdfUFJPVE9DT0xTAFZBUklBTlRfQUxTT19ORUdPVElBVEVTAE1VTFRJUExFX0NIT0lDRVMASU5URVJOQUxfU0VSVkVSX0VSUk9SAFdFQl9TRVJWRVJfVU5LTk9XTl9FUlJPUgBSQUlMR1VOX0VSUk9SAElERU5USVRZX1BST1ZJREVSX0FVVEhFTlRJQ0FUSU9OX0VSUk9SAFNTTF9DRVJUSUZJQ0FURV9FUlJPUgBJTlZBTElEX1hfRk9SV0FSREVEX0ZPUgBTRVRfUEFSQU1FVEVSAEdFVF9QQVJBTUVURVIASFBFX1VTRVIAU0VFX09USEVSAEhQRV9DQl9DSFVOS19IRUFERVIATUtDQUxFTkRBUgBTRVRVUABXRUJfU0VSVkVSX0lTX0RPV04AVEVBUkRPV04ASFBFX0NMT1NFRF9DT05ORUNUSU9OAEhFVVJJU1RJQ19FWFBJUkFUSU9OAERJU0NPTk5FQ1RFRF9PUEVSQVRJT04ATk9OX0FVVEhPUklUQVRJVkVfSU5GT1JNQVRJT04ASFBFX0lOVkFMSURfVkVSU0lPTgBIUEVfQ0JfTUVTU0FHRV9CRUdJTgBTSVRFX0lTX0ZST1pFTgBIUEVfSU5WQUxJRF9IRUFERVJfVE9LRU4ASU5WQUxJRF9UT0tFTgBGT1JCSURERU4ARU5IQU5DRV9ZT1VSX0NBTE0ASFBFX0lOVkFMSURfVVJMAEJMT0NLRURfQllfUEFSRU5UQUxfQ09OVFJPTABNS0NPTABBQ0wASFBFX0lOVEVSTkFMAFJFUVVFU1RfSEVBREVSX0ZJRUxEU19UT09fTEFSR0VfVU5PRkZJQ0lBTABIUEVfT0sAVU5MSU5LAFVOTE9DSwBQUkkAUkVUUllfV0lUSABIUEVfSU5WQUxJRF9DT05URU5UX0xFTkdUSABIUEVfVU5FWFBFQ1RFRF9DT05URU5UX0xFTkdUSABGTFVTSABQUk9QUEFUQ0gATS1TRUFSQ0gAVVJJX1RPT19MT05HAFBST0NFU1NJTkcATUlTQ0VMTEFORU9VU19QRVJTSVNURU5UX1dBUk5JTkcATUlTQ0VMTEFORU9VU19XQVJOSU5HAEhQRV9JTlZBTElEX1RSQU5TRkVSX0VOQ09ESU5HAEV4cGVjdGVkIENSTEYASFBFX0lOVkFMSURfQ0hVTktfU0laRQBNT1ZFAENPTlRJTlVFAEhQRV9DQl9TVEFUVVNfQ09NUExFVEUASFBFX0NCX0hFQURFUlNfQ09NUExFVEUASFBFX0NCX1ZFUlNJT05fQ09NUExFVEUASFBFX0NCX1VSTF9DT01QTEVURQBIUEVfQ0JfQ0hVTktfQ09NUExFVEUASFBFX0NCX0hFQURFUl9WQUxVRV9DT01QTEVURQBIUEVfQ0JfQ0hVTktfRVhURU5TSU9OX1ZBTFVFX0NPTVBMRVRFAEhQRV9DQl9DSFVOS19FWFRFTlNJT05fTkFNRV9DT01QTEVURQBIUEVfQ0JfTUVTU0FHRV9DT01QTEVURQBIUEVfQ0JfTUVUSE9EX0NPTVBMRVRFAEhQRV9DQl9IRUFERVJfRklFTERfQ09NUExFVEUAREVMRVRFAEhQRV9JTlZBTElEX0VPRl9TVEFURQBJTlZBTElEX1NTTF9DRVJUSUZJQ0FURQBQQVVTRQBOT19SRVNQT05TRQBVTlNVUFBPUlRFRF9NRURJQV9UWVBFAEdPTkUATk9UX0FDQ0VQVEFCTEUAU0VSVklDRV9VTkFWQUlMQUJMRQBSQU5HRV9OT1RfU0FUSVNGSUFCTEUAT1JJR0lOX0lTX1VOUkVBQ0hBQkxFAFJFU1BPTlNFX0lTX1NUQUxFAFBVUkdFAE1FUkdFAFJFUVVFU1RfSEVBREVSX0ZJRUxEU19UT09fTEFSR0UAUkVRVUVTVF9IRUFERVJfVE9PX0xBUkdFAFBBWUxPQURfVE9PX0xBUkdFAElOU1VGRklDSUVOVF9TVE9SQUdFAEhQRV9QQVVTRURfVVBHUkFERQBIUEVfUEFVU0VEX0gyX1VQR1JBREUAU09VUkNFAEFOTk9VTkNFAFRSQUNFAEhQRV9VTkVYUEVDVEVEX1NQQUNFAERFU0NSSUJFAFVOU1VCU0NSSUJFAFJFQ09SRABIUEVfSU5WQUxJRF9NRVRIT0QATk9UX0ZPVU5EAFBST1BGSU5EAFVOQklORABSRUJJTkQAVU5BVVRIT1JJWkVEAE1FVEhPRF9OT1RfQUxMT1dFRABIVFRQX1ZFUlNJT05fTk9UX1NVUFBPUlRFRABBTFJFQURZX1JFUE9SVEVEAEFDQ0VQVEVEAE5PVF9JTVBMRU1FTlRFRABMT09QX0RFVEVDVEVEAEhQRV9DUl9FWFBFQ1RFRABIUEVfTEZfRVhQRUNURUQAQ1JFQVRFRABJTV9VU0VEAEhQRV9QQVVTRUQAVElNRU9VVF9PQ0NVUkVEAFBBWU1FTlRfUkVRVUlSRUQAUFJFQ09ORElUSU9OX1JFUVVJUkVEAFBST1hZX0FVVEhFTlRJQ0FUSU9OX1JFUVVJUkVEAE5FVFdPUktfQVVUSEVOVElDQVRJT05fUkVRVUlSRUQATEVOR1RIX1JFUVVJUkVEAFNTTF9DRVJUSUZJQ0FURV9SRVFVSVJFRABVUEdSQURFX1JFUVVJUkVEAFBBR0VfRVhQSVJFRABQUkVDT05ESVRJT05fRkFJTEVEAEVYUEVDVEFUSU9OX0ZBSUxFRABSRVZBTElEQVRJT05fRkFJTEVEAFNTTF9IQU5EU0hBS0VfRkFJTEVEAExPQ0tFRABUUkFOU0ZPUk1BVElPTl9BUFBMSUVEAE5PVF9NT0RJRklFRABOT1RfRVhURU5ERUQAQkFORFdJRFRIX0xJTUlUX0VYQ0VFREVEAFNJVEVfSVNfT1ZFUkxPQURFRABIRUFEAEV4cGVjdGVkIEhUVFAvAABeEwAAJhMAADAQAADwFwAAnRMAABUSAAA5FwAA8BIAAAoQAAB1EgAArRIAAIITAABPFAAAfxAAAKAVAAAjFAAAiRIAAIsUAABNFQAA1BEAAM8UAAAQGAAAyRYAANwWAADBEQAA4BcAALsUAAB0FAAAfBUAAOUUAAAIFwAAHxAAAGUVAACjFAAAKBUAAAIVAACZFQAALBAAAIsZAABPDwAA1A4AAGoQAADOEAAAAhcAAIkOAABuEwAAHBMAAGYUAABWFwAAwRMAAM0TAABsEwAAaBcAAGYXAABfFwAAIhMAAM4PAABpDgAA2A4AAGMWAADLEwAAqg4AACgXAAAmFwAAxRMAAF0WAADoEQAAZxMAAGUTAADyFgAAcxMAAB0XAAD5FgAA8xEAAM8OAADOFQAADBIAALMRAAClEQAAYRAAADIXAAC7EwAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEBAgEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAgMCAgICAgAAAgIAAgIAAgICAgICAgICAgAEAAAAAAACAgICAgICAgICAgICAgICAgICAgICAgICAgAAAAICAgICAgICAgICAgICAgICAgICAgICAgICAgICAAIAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAIAAgICAgIAAAICAAICAAICAgICAgICAgIAAwAEAAAAAgICAgICAgICAgICAgICAgICAgICAgICAgIAAAACAgICAgICAgICAgICAgICAgICAgICAgICAgICAgACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABsb3NlZWVwLWFsaXZlAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQEBAQEBAQEBAQEBAgEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQFjaHVua2VkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQABAQEBAQAAAQEAAQEAAQEBAQEBAQEBAQAAAAAAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGVjdGlvbmVudC1sZW5ndGhvbnJveHktY29ubmVjdGlvbgAAAAAAAAAAAAAAAAAAAHJhbnNmZXItZW5jb2RpbmdwZ3JhZGUNCg0KDQpTTQ0KDQpUVFAvQ0UvVFNQLwAAAAAAAAAAAAAAAAECAAEDAAAAAAAAAAAAAAAAAAAAAAAABAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAAAAAAAAAAABAgABAwAAAAAAAAAAAAAAAAAAAAAAAAQBAQUBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAAAAAAAAAQAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAAAAAAAAAABAAACAAAAAAAAAAAAAAAAAAAAAAAAAwQAAAQEBAQEBAQEBAQEBQQEBAQEBAQEBAQEBAAEAAYHBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQABAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAQAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAAAAAAAAAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAEAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAgAAAAACAAAAAAAAAAAAAAAAAAAAAAADAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwAAAAAAAAMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAE5PVU5DRUVDS09VVE5FQ1RFVEVDUklCRUxVU0hFVEVBRFNFQVJDSFJHRUNUSVZJVFlMRU5EQVJWRU9USUZZUFRJT05TQ0hTRUFZU1RBVENIR0VPUkRJUkVDVE9SVFJDSFBBUkFNRVRFUlVSQ0VCU0NSSUJFQVJET1dOQUNFSU5ETktDS1VCU0NSSUJFSFRUUC9BRFRQLw==";
+  }
+});
+
+// lib/client.js
+var require_client = __commonJS({
+  "lib/client.js"(exports2, module2) {
     "use strict";
-    var util = require_util();
-    var { kBodyUsed } = require_symbols();
     var assert = require("assert");
-    var { InvalidArgumentError } = require_errors();
-    var EE = require("events");
-    var redirectableStatusCodes = [300, 301, 302, 303, 307, 308];
-    var kBody = Symbol("body");
-    var BodyAsyncIterable = class {
-      constructor(body) {
-        this[kBody] = body;
-        this[kBodyUsed] = false;
-      }
-      async *[Symbol.asyncIterator]() {
-        assert(!this[kBodyUsed], "disturbed");
-        this[kBodyUsed] = true;
-        yield* this[kBody];
-      }
-    };
-    var RedirectHandler = class {
-      constructor(dispatch, maxRedirections, opts, handler) {
+    var net = require("net");
+    var http = require("http");
+    var { pipeline } = require("stream");
+    var util = require_util();
+    var timers = require_timers();
+    var Request = require_request2();
+    var DispatcherBase = require_dispatcher_base();
+    var {
+      RequestContentLengthMismatchError,
+      ResponseContentLengthMismatchError,
+      InvalidArgumentError,
+      RequestAbortedError,
+      HeadersTimeoutError,
+      HeadersOverflowError,
+      SocketError,
+      InformationalError,
+      BodyTimeoutError,
+      HTTPParserError,
+      ResponseExceededMaxSizeError,
+      ClientDestroyedError
+    } = require_errors();
+    var buildConnector = require_connect();
+    var {
+      kUrl,
+      kReset,
+      kServerName,
+      kClient,
+      kBusy,
+      kParser,
+      kConnect,
+      kBlocking,
+      kResuming,
+      kRunning,
+      kPending,
+      kSize,
+      kWriting,
+      kQueue,
+      kConnected,
+      kConnecting,
+      kNeedDrain,
+      kNoRef,
+      kKeepAliveDefaultTimeout,
+      kHostHeader,
+      kPendingIdx,
+      kRunningIdx,
+      kError,
+      kPipelining,
+      kSocket,
+      kKeepAliveTimeoutValue,
+      kMaxHeadersSize,
+      kKeepAliveMaxTimeout,
+      kKeepAliveTimeoutThreshold,
+      kHeadersTimeout,
+      kBodyTimeout,
+      kStrictContentLength,
+      kConnector,
+      kMaxRedirections,
+      kMaxRequests,
+      kCounter,
+      kClose,
+      kDestroy,
+      kDispatch,
+      kInterceptors,
+      kLocalAddress,
+      kMaxResponseSize,
+      kHTTPConnVersion,
+      // HTTP2
+      kHost,
+      kHTTP2Session,
+      kHTTP2SessionState,
+      kHTTP2BuildRequest,
+      kHTTP2CopyHeaders,
+      kHTTP1BuildRequest
+    } = require_symbols();
+    var http2;
+    try {
+      http2 = require("http2");
+    } catch {
+      http2 = { constants: {} };
+    }
+    var {
+      constants: {
+        HTTP2_HEADER_AUTHORITY,
+        HTTP2_HEADER_METHOD,
+        HTTP2_HEADER_PATH,
+        HTTP2_HEADER_SCHEME,
+        HTTP2_HEADER_CONTENT_LENGTH,
+        HTTP2_HEADER_EXPECT,
+        HTTP2_HEADER_STATUS
+      }
+    } = http2;
+    var h2ExperimentalWarned = false;
+    var FastBuffer = Buffer[Symbol.species];
+    var kClosedResolve = Symbol("kClosedResolve");
+    var channels = {};
+    try {
+      const diagnosticsChannel = require("diagnostics_channel");
+      channels.sendHeaders = diagnosticsChannel.channel("undici:client:sendHeaders");
+      channels.beforeConnect = diagnosticsChannel.channel("undici:client:beforeConnect");
+      channels.connectError = diagnosticsChannel.channel("undici:client:connectError");
+      channels.connected = diagnosticsChannel.channel("undici:client:connected");
+    } catch {
+      channels.sendHeaders = { hasSubscribers: false };
+      channels.beforeConnect = { hasSubscribers: false };
+      channels.connectError = { hasSubscribers: false };
+      channels.connected = { hasSubscribers: false };
+    }
+    var Client = class extends DispatcherBase {
+      /**
+       *
+       * @param {string|URL} url
+       * @param {import('../types/client').Client.Options} options
+       */
+      constructor(url, {
+        interceptors,
+        maxHeaderSize,
+        headersTimeout,
+        socketTimeout,
+        requestTimeout,
+        connectTimeout,
+        bodyTimeout,
+        idleTimeout,
+        keepAlive,
+        keepAliveTimeout,
+        maxKeepAliveTimeout,
+        keepAliveMaxTimeout,
+        keepAliveTimeoutThreshold,
+        socketPath,
+        pipelining,
+        tls,
+        strictContentLength,
+        maxCachedSessions,
+        maxRedirections,
+        connect: connect2,
+        maxRequestsPerClient,
+        localAddress,
+        maxResponseSize,
+        autoSelectFamily,
+        autoSelectFamilyAttemptTimeout,
+        // h2
+        allowH2,
+        maxConcurrentStreams
+      } = {}) {
+        super();
+        if (keepAlive !== void 0) {
+          throw new InvalidArgumentError("unsupported keepAlive, use pipelining=0 instead");
+        }
+        if (socketTimeout !== void 0) {
+          throw new InvalidArgumentError("unsupported socketTimeout, use headersTimeout & bodyTimeout instead");
+        }
+        if (requestTimeout !== void 0) {
+          throw new InvalidArgumentError("unsupported requestTimeout, use headersTimeout & bodyTimeout instead");
+        }
+        if (idleTimeout !== void 0) {
+          throw new InvalidArgumentError("unsupported idleTimeout, use keepAliveTimeout instead");
+        }
+        if (maxKeepAliveTimeout !== void 0) {
+          throw new InvalidArgumentError("unsupported maxKeepAliveTimeout, use keepAliveMaxTimeout instead");
+        }
+        if (maxHeaderSize != null && !Number.isFinite(maxHeaderSize)) {
+          throw new InvalidArgumentError("invalid maxHeaderSize");
+        }
+        if (socketPath != null && typeof socketPath !== "string") {
+          throw new InvalidArgumentError("invalid socketPath");
+        }
+        if (connectTimeout != null && (!Number.isFinite(connectTimeout) || connectTimeout < 0)) {
+          throw new InvalidArgumentError("invalid connectTimeout");
+        }
+        if (keepAliveTimeout != null && (!Number.isFinite(keepAliveTimeout) || keepAliveTimeout <= 0)) {
+          throw new InvalidArgumentError("invalid keepAliveTimeout");
+        }
+        if (keepAliveMaxTimeout != null && (!Number.isFinite(keepAliveMaxTimeout) || keepAliveMaxTimeout <= 0)) {
+          throw new InvalidArgumentError("invalid keepAliveMaxTimeout");
+        }
+        if (keepAliveTimeoutThreshold != null && !Number.isFinite(keepAliveTimeoutThreshold)) {
+          throw new InvalidArgumentError("invalid keepAliveTimeoutThreshold");
+        }
+        if (headersTimeout != null && (!Number.isInteger(headersTimeout) || headersTimeout < 0)) {
+          throw new InvalidArgumentError("headersTimeout must be a positive integer or zero");
+        }
+        if (bodyTimeout != null && (!Number.isInteger(bodyTimeout) || bodyTimeout < 0)) {
+          throw new InvalidArgumentError("bodyTimeout must be a positive integer or zero");
+        }
+        if (connect2 != null && typeof connect2 !== "function" && typeof connect2 !== "object") {
+          throw new InvalidArgumentError("connect must be a function or an object");
+        }
         if (maxRedirections != null && (!Number.isInteger(maxRedirections) || maxRedirections < 0)) {
           throw new InvalidArgumentError("maxRedirections must be a positive number");
         }
-        util.validateHandler(handler, opts.method, opts.upgrade);
-        this.dispatch = dispatch;
-        this.location = null;
-        this.abort = null;
-        this.opts = { ...opts, maxRedirections: 0 };
-        this.maxRedirections = maxRedirections;
-        this.handler = handler;
-        this.history = [];
-        if (util.isStream(this.opts.body)) {
-          if (util.bodyLength(this.opts.body) === 0) {
-            this.opts.body.on("data", function() {
-              assert(false);
-            });
-          }
-          if (typeof this.opts.body.readableDidRead !== "boolean") {
-            this.opts.body[kBodyUsed] = false;
-            EE.prototype.on.call(this.opts.body, "data", function() {
-              this[kBodyUsed] = true;
-            });
-          }
-        } else if (this.opts.body && typeof this.opts.body.pipeTo === "function") {
-          this.opts.body = new BodyAsyncIterable(this.opts.body);
-        } else if (this.opts.body && typeof this.opts.body !== "string" && !ArrayBuffer.isView(this.opts.body) && util.isIterable(this.opts.body)) {
-          this.opts.body = new BodyAsyncIterable(this.opts.body);
+        if (maxRequestsPerClient != null && (!Number.isInteger(maxRequestsPerClient) || maxRequestsPerClient < 0)) {
+          throw new InvalidArgumentError("maxRequestsPerClient must be a positive number");
+        }
+        if (localAddress != null && (typeof localAddress !== "string" || net.isIP(localAddress) === 0)) {
+          throw new InvalidArgumentError("localAddress must be valid string IP address");
+        }
+        if (maxResponseSize != null && (!Number.isInteger(maxResponseSize) || maxResponseSize < -1)) {
+          throw new InvalidArgumentError("maxResponseSize must be a positive number");
+        }
+        if (autoSelectFamilyAttemptTimeout != null && (!Number.isInteger(autoSelectFamilyAttemptTimeout) || autoSelectFamilyAttemptTimeout < -1)) {
+          throw new InvalidArgumentError("autoSelectFamilyAttemptTimeout must be a positive number");
+        }
+        if (allowH2 != null && typeof allowH2 !== "boolean") {
+          throw new InvalidArgumentError("allowH2 must be a valid boolean value");
+        }
+        if (maxConcurrentStreams != null && (typeof maxConcurrentStreams !== "number" || maxConcurrentStreams < 1)) {
+          throw new InvalidArgumentError("maxConcurrentStreams must be a possitive integer, greater than 0");
+        }
+        if (typeof connect2 !== "function") {
+          connect2 = buildConnector({
+            ...tls,
+            maxCachedSessions,
+            allowH2,
+            socketPath,
+            timeout: connectTimeout,
+            ...util.nodeHasAutoSelectFamily && autoSelectFamily ? { autoSelectFamily, autoSelectFamilyAttemptTimeout } : void 0,
+            ...connect2
+          });
         }
+        this[kInterceptors] = interceptors && interceptors.Client && Array.isArray(interceptors.Client) ? interceptors.Client : [createRedirectInterceptor({ maxRedirections })];
+        this[kUrl] = util.parseOrigin(url);
+        this[kConnector] = connect2;
+        this[kSocket] = null;
+        this[kPipelining] = pipelining != null ? pipelining : 1;
+        this[kMaxHeadersSize] = maxHeaderSize || http.maxHeaderSize;
+        this[kKeepAliveDefaultTimeout] = keepAliveTimeout == null ? 4e3 : keepAliveTimeout;
+        this[kKeepAliveMaxTimeout] = keepAliveMaxTimeout == null ? 6e5 : keepAliveMaxTimeout;
+        this[kKeepAliveTimeoutThreshold] = keepAliveTimeoutThreshold == null ? 1e3 : keepAliveTimeoutThreshold;
+        this[kKeepAliveTimeoutValue] = this[kKeepAliveDefaultTimeout];
+        this[kServerName] = null;
+        this[kLocalAddress] = localAddress != null ? localAddress : null;
+        this[kResuming] = 0;
+        this[kNeedDrain] = 0;
+        this[kHostHeader] = `host: ${this[kUrl].hostname}${this[kUrl].port ? `:${this[kUrl].port}` : ""}\r
+`;
+        this[kBodyTimeout] = bodyTimeout != null ? bodyTimeout : 3e5;
+        this[kHeadersTimeout] = headersTimeout != null ? headersTimeout : 3e5;
+        this[kStrictContentLength] = strictContentLength == null ? true : strictContentLength;
+        this[kMaxRedirections] = maxRedirections;
+        this[kMaxRequests] = maxRequestsPerClient;
+        this[kClosedResolve] = null;
+        this[kMaxResponseSize] = maxResponseSize > -1 ? maxResponseSize : -1;
+        this[kHTTPConnVersion] = "h1";
+        this[kHTTP2Session] = null;
+        this[kHTTP2SessionState] = !allowH2 ? null : {
+          // streams: null, // Fixed queue of streams - For future support of `push`
+          openStreams: 0,
+          // Keep track of them to decide wether or not unref the session
+          maxConcurrentStreams: maxConcurrentStreams != null ? maxConcurrentStreams : 100
+          // Max peerConcurrentStreams for a Node h2 server
+        };
+        this[kHost] = `${this[kUrl].hostname}${this[kUrl].port ? `:${this[kUrl].port}` : ""}`;
+        this[kQueue] = [];
+        this[kRunningIdx] = 0;
+        this[kPendingIdx] = 0;
       }
-      onConnect(abort) {
-        this.abort = abort;
-        this.handler.onConnect(abort, { history: this.history });
+      get pipelining() {
+        return this[kPipelining];
       }
-      onUpgrade(statusCode, headers, socket) {
-        this.handler.onUpgrade(statusCode, headers, socket);
+      set pipelining(value) {
+        this[kPipelining] = value;
+        resume(this, true);
       }
-      onError(error) {
-        this.handler.onError(error);
+      get [kPending]() {
+        return this[kQueue].length - this[kPendingIdx];
       }
-      onHeaders(statusCode, headers, resume, statusText) {
-        this.location = this.history.length >= this.maxRedirections || util.isDisturbed(this.opts.body) ? null : parseLocation(statusCode, headers);
-        if (this.opts.origin) {
-          this.history.push(new URL(this.opts.path, this.opts.origin));
-        }
-        if (!this.location) {
-          return this.handler.onHeaders(statusCode, headers, resume, statusText);
-        }
-        const { origin, pathname, search } = util.parseURL(new URL(this.location, this.opts.origin && new URL(this.opts.path, this.opts.origin)));
-        const path = search ? `${pathname}${search}` : pathname;
-        this.opts.headers = cleanRequestHeaders(this.opts.headers, statusCode === 303, this.opts.origin !== origin);
-        this.opts.path = path;
-        this.opts.origin = origin;
-        this.opts.maxRedirections = 0;
-        this.opts.query = null;
-        if (statusCode === 303 && this.opts.method !== "HEAD") {
-          this.opts.method = "GET";
-          this.opts.body = null;
-        }
+      get [kRunning]() {
+        return this[kPendingIdx] - this[kRunningIdx];
       }
-      onData(chunk) {
-        if (this.location) {
-        } else {
-          return this.handler.onData(chunk);
-        }
+      get [kSize]() {
+        return this[kQueue].length - this[kRunningIdx];
       }
-      onComplete(trailers) {
-        if (this.location) {
-          this.location = null;
-          this.abort = null;
-          this.dispatch(this.opts, this);
+      get [kConnected]() {
+        return !!this[kSocket] && !this[kConnecting] && !this[kSocket].destroyed;
+      }
+      get [kBusy]() {
+        const socket = this[kSocket];
+        return socket && (socket[kReset] || socket[kWriting] || socket[kBlocking]) || this[kSize] >= (this[kPipelining] || 1) || this[kPending] > 0;
+      }
+      /* istanbul ignore: only used for test */
+      [kConnect](cb) {
+        connect(this);
+        this.once("connect", cb);
+      }
+      [kDispatch](opts, handler) {
+        const origin = opts.origin || this[kUrl].origin;
+        const request = this[kHTTPConnVersion] === "h2" ? Request[kHTTP2BuildRequest](origin, opts, handler) : Request[kHTTP1BuildRequest](origin, opts, handler);
+        this[kQueue].push(request);
+        if (this[kResuming]) {
+        } else if (util.bodyLength(request.body) == null && util.isIterable(request.body)) {
+          this[kResuming] = 1;
+          process.nextTick(resume, this);
         } else {
-          this.handler.onComplete(trailers);
+          resume(this, true);
         }
-      }
-      onBodySent(chunk) {
-        if (this.handler.onBodySent) {
-          this.handler.onBodySent(chunk);
+        if (this[kResuming] && this[kNeedDrain] !== 2 && this[kBusy]) {
+          this[kNeedDrain] = 2;
         }
+        return this[kNeedDrain] < 2;
+      }
+      async [kClose]() {
+        return new Promise((resolve) => {
+          if (!this[kSize]) {
+            resolve(null);
+          } else {
+            this[kClosedResolve] = resolve;
+          }
+        });
+      }
+      async [kDestroy](err) {
+        return new Promise((resolve) => {
+          const requests = this[kQueue].splice(this[kPendingIdx]);
+          for (let i = 0; i < requests.length; i++) {
+            const request = requests[i];
+            errorRequest(this, request, err);
+          }
+          const callback = () => {
+            if (this[kClosedResolve]) {
+              this[kClosedResolve]();
+              this[kClosedResolve] = null;
+            }
+            resolve();
+          };
+          if (this[kHTTP2Session] != null) {
+            util.destroy(this[kHTTP2Session], err);
+            this[kHTTP2Session] = null;
+            this[kHTTP2SessionState] = null;
+          }
+          if (!this[kSocket]) {
+            queueMicrotask(callback);
+          } else {
+            util.destroy(this[kSocket].on("close", callback), err);
+          }
+          resume(this);
+        });
       }
     };
-    function parseLocation(statusCode, headers) {
-      if (redirectableStatusCodes.indexOf(statusCode) === -1) {
-        return null;
+    function onHttp2SessionError(err) {
+      assert(err.code !== "ERR_TLS_CERT_ALTNAME_INVALID");
+      this[kSocket][kError] = err;
+      onError(this[kClient], err);
+    }
+    function onHttp2FrameError(type, code, id) {
+      const err = new InformationalError(`HTTP/2: "frameError" received - type ${type}, code ${code}`);
+      if (id === 0) {
+        this[kSocket][kError] = err;
+        onError(this[kClient], err);
       }
-      for (let i = 0; i < headers.length; i += 2) {
-        if (headers[i].toString().toLowerCase() === "location") {
-          return headers[i + 1];
+    }
+    function onHttp2SessionEnd() {
+      util.destroy(this, new SocketError("other side closed"));
+      util.destroy(this[kSocket], new SocketError("other side closed"));
+    }
+    function onHTTP2GoAway(code) {
+      const client = this[kClient];
+      const err = new InformationalError(`HTTP/2: "GOAWAY" frame received with code ${code}`);
+      client[kSocket] = null;
+      client[kHTTP2Session] = null;
+      if (client.destroyed) {
+        assert(this[kPending] === 0);
+        const requests = client[kQueue].splice(client[kRunningIdx]);
+        for (let i = 0; i < requests.length; i++) {
+          const request = requests[i];
+          errorRequest(this, request, err);
+        }
+      } else if (client[kRunning] > 0) {
+        const request = client[kQueue][client[kRunningIdx]];
+        client[kQueue][client[kRunningIdx]++] = null;
+        errorRequest(client, request, err);
+      }
+      client[kPendingIdx] = client[kRunningIdx];
+      assert(client[kRunning] === 0);
+      client.emit(
+        "disconnect",
+        client[kUrl],
+        [client],
+        err
+      );
+      resume(client);
+    }
+    var constants = require_constants2();
+    var createRedirectInterceptor = require_redirectInterceptor();
+    var EMPTY_BUF = Buffer.alloc(0);
+    async function lazyllhttp() {
+      const llhttpWasmData = process.env.JEST_WORKER_ID ? require_llhttp_wasm() : void 0;
+      let mod;
+      try {
+        mod = await WebAssembly.compile(Buffer.from(require_llhttp_simd_wasm(), "base64"));
+      } catch (e) {
+        mod = await WebAssembly.compile(Buffer.from(llhttpWasmData || require_llhttp_wasm(), "base64"));
+      }
+      return await WebAssembly.instantiate(mod, {
+        env: {
+          /* eslint-disable camelcase */
+          wasm_on_url: (p, at, len) => {
+            return 0;
+          },
+          wasm_on_status: (p, at, len) => {
+            assert.strictEqual(currentParser.ptr, p);
+            const start = at - currentBufferPtr + currentBufferRef.byteOffset;
+            return currentParser.onStatus(new FastBuffer(currentBufferRef.buffer, start, len)) || 0;
+          },
+          wasm_on_message_begin: (p) => {
+            assert.strictEqual(currentParser.ptr, p);
+            return currentParser.onMessageBegin() || 0;
+          },
+          wasm_on_header_field: (p, at, len) => {
+            assert.strictEqual(currentParser.ptr, p);
+            const start = at - currentBufferPtr + currentBufferRef.byteOffset;
+            return currentParser.onHeaderField(new FastBuffer(currentBufferRef.buffer, start, len)) || 0;
+          },
+          wasm_on_header_value: (p, at, len) => {
+            assert.strictEqual(currentParser.ptr, p);
+            const start = at - currentBufferPtr + currentBufferRef.byteOffset;
+            return currentParser.onHeaderValue(new FastBuffer(currentBufferRef.buffer, start, len)) || 0;
+          },
+          wasm_on_headers_complete: (p, statusCode, upgrade, shouldKeepAlive) => {
+            assert.strictEqual(currentParser.ptr, p);
+            return currentParser.onHeadersComplete(statusCode, Boolean(upgrade), Boolean(shouldKeepAlive)) || 0;
+          },
+          wasm_on_body: (p, at, len) => {
+            assert.strictEqual(currentParser.ptr, p);
+            const start = at - currentBufferPtr + currentBufferRef.byteOffset;
+            return currentParser.onBody(new FastBuffer(currentBufferRef.buffer, start, len)) || 0;
+          },
+          wasm_on_message_complete: (p) => {
+            assert.strictEqual(currentParser.ptr, p);
+            return currentParser.onMessageComplete() || 0;
+          }
+          /* eslint-enable camelcase */
         }
-      }
-    }
-    function shouldRemoveHeader(header, removeContent, unknownOrigin) {
-      return header.length === 4 && header.toString().toLowerCase() === "host" || removeContent && header.toString().toLowerCase().indexOf("content-") === 0 || unknownOrigin && header.length === 13 && header.toString().toLowerCase() === "authorization" || unknownOrigin && header.length === 6 && header.toString().toLowerCase() === "cookie";
+      });
     }
-    function cleanRequestHeaders(headers, removeContent, unknownOrigin) {
-      const ret = [];
-      if (Array.isArray(headers)) {
-        for (let i = 0; i < headers.length; i += 2) {
-          if (!shouldRemoveHeader(headers[i], removeContent, unknownOrigin)) {
-            ret.push(headers[i], headers[i + 1]);
+    var llhttpInstance = null;
+    var llhttpPromise = lazyllhttp();
+    llhttpPromise.catch();
+    var currentParser = null;
+    var currentBufferRef = null;
+    var currentBufferSize = 0;
+    var currentBufferPtr = null;
+    var TIMEOUT_HEADERS = 1;
+    var TIMEOUT_BODY = 2;
+    var TIMEOUT_IDLE = 3;
+    var Parser = class {
+      constructor(client, socket, { exports: exports3 }) {
+        assert(Number.isFinite(client[kMaxHeadersSize]) && client[kMaxHeadersSize] > 0);
+        this.llhttp = exports3;
+        this.ptr = this.llhttp.llhttp_alloc(constants.TYPE.RESPONSE);
+        this.client = client;
+        this.socket = socket;
+        this.timeout = null;
+        this.timeoutValue = null;
+        this.timeoutType = null;
+        this.statusCode = null;
+        this.statusText = "";
+        this.upgrade = false;
+        this.headers = [];
+        this.headersSize = 0;
+        this.headersMaxSize = client[kMaxHeadersSize];
+        this.shouldKeepAlive = false;
+        this.paused = false;
+        this.resume = this.resume.bind(this);
+        this.bytesRead = 0;
+        this.keepAlive = "";
+        this.contentLength = "";
+        this.connection = "";
+        this.maxResponseSize = client[kMaxResponseSize];
+      }
+      setTimeout(value, type) {
+        this.timeoutType = type;
+        if (value !== this.timeoutValue) {
+          timers.clearTimeout(this.timeout);
+          if (value) {
+            this.timeout = timers.setTimeout(onParserTimeout, value, this);
+            if (this.timeout.unref) {
+              this.timeout.unref();
+            }
+          } else {
+            this.timeout = null;
           }
-        }
-      } else if (headers && typeof headers === "object") {
-        for (const key of Object.keys(headers)) {
-          if (!shouldRemoveHeader(key, removeContent, unknownOrigin)) {
-            ret.push(key, headers[key]);
+          this.timeoutValue = value;
+        } else if (this.timeout) {
+          if (this.timeout.refresh) {
+            this.timeout.refresh();
           }
         }
-      } else {
-        assert(headers == null, "headers must be an object or an array");
       }
-      return ret;
-    }
-    module2.exports = RedirectHandler;
-  }
-});
-
-// lib/interceptor/redirectInterceptor.js
-var require_redirectInterceptor = __commonJS({
-  "lib/interceptor/redirectInterceptor.js"(exports2, module2) {
-    "use strict";
-    var RedirectHandler = require_RedirectHandler();
-    function createRedirectInterceptor({ maxRedirections: defaultMaxRedirections }) {
-      return (dispatch) => {
-        return function Intercept(opts, handler) {
-          const { maxRedirections = defaultMaxRedirections } = opts;
-          if (!maxRedirections) {
-            return dispatch(opts, handler);
-          }
-          const redirectHandler = new RedirectHandler(dispatch, maxRedirections, opts, handler);
-          opts = { ...opts, maxRedirections: 0 };
-          return dispatch(opts, redirectHandler);
-        };
-      };
-    }
-    module2.exports = createRedirectInterceptor;
-  }
-});
-
-// lib/llhttp/llhttp-wasm.js
-var require_llhttp_wasm = __commonJS({
-  "lib/llhttp/llhttp-wasm.js"(exports2, module2) {
-    module2.exports = "AGFzbQEAAAABMAhgAX8Bf2ADf39/AX9gBH9/f38Bf2AAAGADf39/AGABfwBgAn9/AGAGf39/f39/AALLAQgDZW52GHdhc21fb25faGVhZGVyc19jb21wbGV0ZQACA2VudhV3YXNtX29uX21lc3NhZ2VfYmVnaW4AAANlbnYLd2FzbV9vbl91cmwAAQNlbnYOd2FzbV9vbl9zdGF0dXMAAQNlbnYUd2FzbV9vbl9oZWFkZXJfZmllbGQAAQNlbnYUd2FzbV9vbl9oZWFkZXJfdmFsdWUAAQNlbnYMd2FzbV9vbl9ib2R5AAEDZW52GHdhc21fb25fbWVzc2FnZV9jb21wbGV0ZQAAA0ZFAwMEAAAFAAAAAAAABQEFAAUFBQAABgAAAAAGBgYGAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAAABAQcAAAUFAwABBAUBcAESEgUDAQACBggBfwFBgNQECwfRBSIGbWVtb3J5AgALX2luaXRpYWxpemUACRlfX2luZGlyZWN0X2Z1bmN0aW9uX3RhYmxlAQALbGxodHRwX2luaXQAChhsbGh0dHBfc2hvdWxkX2tlZXBfYWxpdmUAQQxsbGh0dHBfYWxsb2MADAZtYWxsb2MARgtsbGh0dHBfZnJlZQANBGZyZWUASA9sbGh0dHBfZ2V0X3R5cGUADhVsbGh0dHBfZ2V0X2h0dHBfbWFqb3IADxVsbGh0dHBfZ2V0X2h0dHBfbWlub3IAEBFsbGh0dHBfZ2V0X21ldGhvZAARFmxsaHR0cF9nZXRfc3RhdHVzX2NvZGUAEhJsbGh0dHBfZ2V0X3VwZ3JhZGUAEwxsbGh0dHBfcmVzZXQAFA5sbGh0dHBfZXhlY3V0ZQAVFGxsaHR0cF9zZXR0aW5nc19pbml0ABYNbGxodHRwX2ZpbmlzaAAXDGxsaHR0cF9wYXVzZQAYDWxsaHR0cF9yZXN1bWUAGRtsbGh0dHBfcmVzdW1lX2FmdGVyX3VwZ3JhZGUAGhBsbGh0dHBfZ2V0X2Vycm5vABsXbGxodHRwX2dldF9lcnJvcl9yZWFzb24AHBdsbGh0dHBfc2V0X2Vycm9yX3JlYXNvbgAdFGxsaHR0cF9nZXRfZXJyb3JfcG9zAB4RbGxodHRwX2Vycm5vX25hbWUAHxJsbGh0dHBfbWV0aG9kX25hbWUAIBJsbGh0dHBfc3RhdHVzX25hbWUAIRpsbGh0dHBfc2V0X2xlbmllbnRfaGVhZGVycwAiIWxsaHR0cF9zZXRfbGVuaWVudF9jaHVua2VkX2xlbmd0aAAjHWxsaHR0cF9zZXRfbGVuaWVudF9rZWVwX2FsaXZlACQkbGxodHRwX3NldF9sZW5pZW50X3RyYW5zZmVyX2VuY29kaW5nACUYbGxodHRwX21lc3NhZ2VfbmVlZHNfZW9mAD8JFwEAQQELEQECAwQFCwYHNTk3MS8tJyspCsLgAkUCAAsIABCIgICAAAsZACAAEMKAgIAAGiAAIAI2AjggACABOgAoCxwAIAAgAC8BMiAALQAuIAAQwYCAgAAQgICAgAALKgEBf0HAABDGgICAACIBEMKAgIAAGiABQYCIgIAANgI4IAEgADoAKCABCwoAIAAQyICAgAALBwAgAC0AKAsHACAALQAqCwcAIAAtACsLBwAgAC0AKQsHACAALwEyCwcAIAAtAC4LRQEEfyAAKAIYIQEgAC0ALSECIAAtACghAyAAKAI4IQQgABDCgICAABogACAENgI4IAAgAzoAKCAAIAI6AC0gACABNgIYCxEAIAAgASABIAJqEMOAgIAACxAAIABBAEHcABDMgICAABoLZwEBf0EAIQECQCAAKAIMDQACQAJAAkACQCAALQAvDgMBAAMCCyAAKAI4IgFFDQAgASgCLCIBRQ0AIAAgARGAgICAAAAiAQ0DC0EADwsQyoCAgAAACyAAQcOWgIAANgIQQQ4hAQsgAQseAAJAIAAoAgwNACAAQdGbgIAANgIQIABBFTYCDAsLFgACQCAAKAIMQRVHDQAgAEEANgIMCwsWAAJAIAAoAgxBFkcNACAAQQA2AgwLCwcAIAAoAgwLBwAgACgCEAsJACAAIAE2AhALBwAgACgCFAsiAAJAIABBJEkNABDKgICAAAALIABBAnRBoLOAgABqKAIACyIAAkAgAEEuSQ0AEMqAgIAAAAsgAEECdEGwtICAAGooAgAL7gsBAX9B66iAgAAhAQJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIABBnH9qDvQDY2IAAWFhYWFhYQIDBAVhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhBgcICQoLDA0OD2FhYWFhEGFhYWFhYWFhYWFhEWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYRITFBUWFxgZGhthYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhHB0eHyAhIiMkJSYnKCkqKywtLi8wMTIzNDU2YTc4OTphYWFhYWFhYTthYWE8YWFhYT0+P2FhYWFhYWFhQGFhQWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYUJDREVGR0hJSktMTU5PUFFSU2FhYWFhYWFhVFVWV1hZWlthXF1hYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFeYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhX2BhC0Hhp4CAAA8LQaShgIAADwtBy6yAgAAPC0H+sYCAAA8LQcCkgIAADwtBq6SAgAAPC0GNqICAAA8LQeKmgIAADwtBgLCAgAAPC0G5r4CAAA8LQdekgIAADwtB75+AgAAPC0Hhn4CAAA8LQfqfgIAADwtB8qCAgAAPC0Gor4CAAA8LQa6ygIAADwtBiLCAgAAPC0Hsp4CAAA8LQYKigIAADwtBjp2AgAAPC0HQroCAAA8LQcqjgIAADwtBxbKAgAAPC0HfnICAAA8LQdKcgIAADwtBxKCAgAAPC0HXoICAAA8LQaKfgIAADwtB7a6AgAAPC0GrsICAAA8LQdSlgIAADwtBzK6AgAAPC0H6roCAAA8LQfyrgIAADwtB0rCAgAAPC0HxnYCAAA8LQbuggIAADwtB96uAgAAPC0GQsYCAAA8LQdexgIAADwtBoq2AgAAPC0HUp4CAAA8LQeCrgIAADwtBn6yAgAAPC0HrsYCAAA8LQdWfgIAADwtByrGAgAAPC0HepYCAAA8LQdSegIAADwtB9JyAgAAPC0GnsoCAAA8LQbGdgIAADwtBoJ2AgAAPC0G5sYCAAA8LQbywgIAADwtBkqGAgAAPC0GzpoCAAA8LQemsgIAADwtBrJ6AgAAPC0HUq4CAAA8LQfemgIAADwtBgKaAgAAPC0GwoYCAAA8LQf6egIAADwtBjaOAgAAPC0GJrYCAAA8LQfeigIAADwtBoLGAgAAPC0Gun4CAAA8LQcalgIAADwtB6J6AgAAPC0GTooCAAA8LQcKvgIAADwtBw52AgAAPC0GLrICAAA8LQeGdgIAADwtBja+AgAAPC0HqoYCAAA8LQbStgIAADwtB0q+AgAAPC0HfsoCAAA8LQdKygIAADwtB8LCAgAAPC0GpooCAAA8LQfmjgIAADwtBmZ6AgAAPC0G1rICAAA8LQZuwgIAADwtBkrKAgAAPC0G2q4CAAA8LQcKigIAADwtB+LKAgAAPC0GepYCAAA8LQdCigIAADwtBup6AgAAPC0GBnoCAAA8LEMqAgIAAAAtB1qGAgAAhAQsgAQsWACAAIAAtAC1B/gFxIAFBAEdyOgAtCxkAIAAgAC0ALUH9AXEgAUEAR0EBdHI6AC0LGQAgACAALQAtQfsBcSABQQBHQQJ0cjoALQsZACAAIAAtAC1B9wFxIAFBAEdBA3RyOgAtCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAgAiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCBCIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQcaRgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIwIgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAggiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEH2ioCAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCNCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIMIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABB7ZqAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAjgiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCECIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQZWQgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAI8IgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAhQiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEGqm4CAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCQCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIYIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABB7ZOAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAkQiBEUNACAAIAQRgICAgAAAIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCJCIERQ0AIAAgBBGAgICAAAAhAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIsIgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAigiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEH2iICAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCUCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIcIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABBwpmAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAkgiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCICIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQZSUgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAJMIgRFDQAgACAEEYCAgIAAACEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAlQiBEUNACAAIAQRgICAgAAAIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCWCIERQ0AIAAgBBGAgICAAAAhAwsgAwtFAQF/AkACQCAALwEwQRRxQRRHDQBBASEDIAAtAChBAUYNASAALwEyQeUARiEDDAELIAAtAClBBUYhAwsgACADOgAuQQAL/gEBA39BASEDAkAgAC8BMCIEQQhxDQAgACkDIEIAUiEDCwJAAkAgAC0ALkUNAEEBIQUgAC0AKUEFRg0BQQEhBSAEQcAAcUUgA3FBAUcNAQtBACEFIARBwABxDQBBAiEFIARB//8DcSIDQQhxDQACQCADQYAEcUUNAAJAIAAtAChBAUcNACAALQAtQQpxDQBBBQ8LQQQPCwJAIANBIHENAAJAIAAtAChBAUYNACAALwEyQf//A3EiAEGcf2pB5ABJDQAgAEHMAUYNACAAQbACRg0AQQQhBSAEQShxRQ0CIANBiARxQYAERg0CC0EADwtBAEEDIAApAyBQGyEFCyAFC2IBAn9BACEBAkAgAC0AKEEBRg0AIAAvATJB//8DcSICQZx/akHkAEkNACACQcwBRg0AIAJBsAJGDQAgAC8BMCIAQcAAcQ0AQQEhASAAQYgEcUGABEYNACAAQShxRSEBCyABC6cBAQN/AkACQAJAIAAtACpFDQAgAC0AK0UNAEEAIQMgAC8BMCIEQQJxRQ0BDAILQQAhAyAALwEwIgRBAXFFDQELQQEhAyAALQAoQQFGDQAgAC8BMkH//wNxIgVBnH9qQeQASQ0AIAVBzAFGDQAgBUGwAkYNACAEQcAAcQ0AQQAhAyAEQYgEcUGABEYNACAEQShxQQBHIQMLIABBADsBMCAAQQA6AC8gAwuZAQECfwJAAkACQCAALQAqRQ0AIAAtACtFDQBBACEBIAAvATAiAkECcUUNAQwCC0EAIQEgAC8BMCICQQFxRQ0BC0EBIQEgAC0AKEEBRg0AIAAvATJB//8DcSIAQZx/akHkAEkNACAAQcwBRg0AIABBsAJGDQAgAkHAAHENAEEAIQEgAkGIBHFBgARGDQAgAkEocUEARyEBCyABC1kAIABBGGpCADcDACAAQgA3AwAgAEE4akIANwMAIABBMGpCADcDACAAQShqQgA3AwAgAEEgakIANwMAIABBEGpCADcDACAAQQhqQgA3AwAgAEHdATYCHEEAC3sBAX8CQCAAKAIMIgMNAAJAIAAoAgRFDQAgACABNgIECwJAIAAgASACEMSAgIAAIgMNACAAKAIMDwsgACADNgIcQQAhAyAAKAIEIgFFDQAgACABIAIgACgCCBGBgICAAAAiAUUNACAAIAI2AhQgACABNgIMIAEhAwsgAwvk8wEDDn8DfgR/I4CAgIAAQRBrIgMkgICAgAAgASEEIAEhBSABIQYgASEHIAEhCCABIQkgASEKIAEhCyABIQwgASENIAEhDiABIQ8CQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkAgACgCHCIQQX9qDt0B2gEB2QECAwQFBgcICQoLDA0O2AEPENcBERLWARMUFRYXGBkaG+AB3wEcHR7VAR8gISIjJCXUASYnKCkqKyzTAdIBLS7RAdABLzAxMjM0NTY3ODk6Ozw9Pj9AQUJDREVG2wFHSElKzwHOAUvNAUzMAU1OT1BRUlNUVVZXWFlaW1xdXl9gYWJjZGVmZ2hpamtsbW5vcHFyc3R1dnd4eXp7fH1+f4ABgQGCAYMBhAGFAYYBhwGIAYkBigGLAYwBjQGOAY8BkAGRAZIBkwGUAZUBlgGXAZgBmQGaAZsBnAGdAZ4BnwGgAaEBogGjAaQBpQGmAacBqAGpAaoBqwGsAa0BrgGvAbABsQGyAbMBtAG1AbYBtwHLAcoBuAHJAbkByAG6AbsBvAG9Ab4BvwHAAcEBwgHDAcQBxQHGAQDcAQtBACEQDMYBC0EOIRAMxQELQQ0hEAzEAQtBDyEQDMMBC0EQIRAMwgELQRMhEAzBAQtBFCEQDMABC0EVIRAMvwELQRYhEAy+AQtBFyEQDL0BC0EYIRAMvAELQRkhEAy7AQtBGiEQDLoBC0EbIRAMuQELQRwhEAy4AQtBCCEQDLcBC0EdIRAMtgELQSAhEAy1AQtBHyEQDLQBC0EHIRAMswELQSEhEAyyAQtBIiEQDLEBC0EeIRAMsAELQSMhEAyvAQtBEiEQDK4BC0ERIRAMrQELQSQhEAysAQtBJSEQDKsBC0EmIRAMqgELQSchEAypAQtBwwEhEAyoAQtBKSEQDKcBC0ErIRAMpgELQSwhEAylAQtBLSEQDKQBC0EuIRAMowELQS8hEAyiAQtBxAEhEAyhAQtBMCEQDKABC0E0IRAMnwELQQwhEAyeAQtBMSEQDJ0BC0EyIRAMnAELQTMhEAybAQtBOSEQDJoBC0E1IRAMmQELQcUBIRAMmAELQQshEAyXAQtBOiEQDJYBC0E2IRAMlQELQQohEAyUAQtBNyEQDJMBC0E4IRAMkgELQTwhEAyRAQtBOyEQDJABC0E9IRAMjwELQQkhEAyOAQtBKCEQDI0BC0E+IRAMjAELQT8hEAyLAQtBwAAhEAyKAQtBwQAhEAyJAQtBwgAhEAyIAQtBwwAhEAyHAQtBxAAhEAyGAQtBxQAhEAyFAQtBxgAhEAyEAQtBKiEQDIMBC0HHACEQDIIBC0HIACEQDIEBC0HJACEQDIABC0HKACEQDH8LQcsAIRAMfgtBzQAhEAx9C0HMACEQDHwLQc4AIRAMewtBzwAhEAx6C0HQACEQDHkLQdEAIRAMeAtB0gAhEAx3C0HTACEQDHYLQdQAIRAMdQtB1gAhEAx0C0HVACEQDHMLQQYhEAxyC0HXACEQDHELQQUhEAxwC0HYACEQDG8LQQQhEAxuC0HZACEQDG0LQdoAIRAMbAtB2wAhEAxrC0HcACEQDGoLQQMhEAxpC0HdACEQDGgLQd4AIRAMZwtB3wAhEAxmC0HhACEQDGULQeAAIRAMZAtB4gAhEAxjC0HjACEQDGILQQIhEAxhC0HkACEQDGALQeUAIRAMXwtB5gAhEAxeC0HnACEQDF0LQegAIRAMXAtB6QAhEAxbC0HqACEQDFoLQesAIRAMWQtB7AAhEAxYC0HtACEQDFcLQe4AIRAMVgtB7wAhEAxVC0HwACEQDFQLQfEAIRAMUwtB8gAhEAxSC0HzACEQDFELQfQAIRAMUAtB9QAhEAxPC0H2ACEQDE4LQfcAIRAMTQtB+AAhEAxMC0H5ACEQDEsLQfoAIRAMSgtB+wAhEAxJC0H8ACEQDEgLQf0AIRAMRwtB/gAhEAxGC0H/ACEQDEULQYABIRAMRAtBgQEhEAxDC0GCASEQDEILQYMBIRAMQQtBhAEhEAxAC0GFASEQDD8LQYYBIRAMPgtBhwEhEAw9C0GIASEQDDwLQYkBIRAMOwtBigEhEAw6C0GLASEQDDkLQYwBIRAMOAtBjQEhEAw3C0GOASEQDDYLQY8BIRAMNQtBkAEhEAw0C0GRASEQDDMLQZIBIRAMMgtBkwEhEAwxC0GUASEQDDALQZUBIRAMLwtBlgEhEAwuC0GXASEQDC0LQZgBIRAMLAtBmQEhEAwrC0GaASEQDCoLQZsBIRAMKQtBnAEhEAwoC0GdASEQDCcLQZ4BIRAMJgtBnwEhEAwlC0GgASEQDCQLQaEBIRAMIwtBogEhEAwiC0GjASEQDCELQaQBIRAMIAtBpQEhEAwfC0GmASEQDB4LQacBIRAMHQtBqAEhEAwcC0GpASEQDBsLQaoBIRAMGgtBqwEhEAwZC0GsASEQDBgLQa0BIRAMFwtBrgEhEAwWC0EBIRAMFQtBrwEhEAwUC0GwASEQDBMLQbEBIRAMEgtBswEhEAwRC0GyASEQDBALQbQBIRAMDwtBtQEhEAwOC0G2ASEQDA0LQbcBIRAMDAtBuAEhEAwLC0G5ASEQDAoLQboBIRAMCQtBuwEhEAwIC0HGASEQDAcLQbwBIRAMBgtBvQEhEAwFC0G+ASEQDAQLQb8BIRAMAwtBwAEhEAwCC0HCASEQDAELQcEBIRALA0ACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAQDscBAAECAwQFBgcICQoLDA0ODxAREhMUFRYXGBkaGxweHyAhIyUoP0BBREVGR0hJSktMTU9QUVJT3gNXWVtcXWBiZWZnaGlqa2xtb3BxcnN0dXZ3eHl6e3x9foABggGFAYYBhwGJAYsBjAGNAY4BjwGQAZEBlAGVAZYBlwGYAZkBmgGbAZwBnQGeAZ8BoAGhAaIBowGkAaUBpgGnAagBqQGqAasBrAGtAa4BrwGwAbEBsgGzAbQBtQG2AbcBuAG5AboBuwG8Ab0BvgG/AcABwQHCAcMBxAHFAcYBxwHIAckBygHLAcwBzQHOAc8B0AHRAdIB0wHUAdUB1gHXAdgB2QHaAdsB3AHdAd4B4AHhAeIB4wHkAeUB5gHnAegB6QHqAesB7AHtAe4B7wHwAfEB8gHzAZkCpAKwAv4C/gILIAEiBCACRw3zAUHdASEQDP8DCyABIhAgAkcN3QFBwwEhEAz+AwsgASIBIAJHDZABQfcAIRAM/QMLIAEiASACRw2GAUHvACEQDPwDCyABIgEgAkcNf0HqACEQDPsDCyABIgEgAkcNe0HoACEQDPoDCyABIgEgAkcNeEHmACEQDPkDCyABIgEgAkcNGkEYIRAM+AMLIAEiASACRw0UQRIhEAz3AwsgASIBIAJHDVlBxQAhEAz2AwsgASIBIAJHDUpBPyEQDPUDCyABIgEgAkcNSEE8IRAM9AMLIAEiASACRw1BQTEhEAzzAwsgAC0ALkEBRg3rAwyHAgsgACABIgEgAhDAgICAAEEBRw3mASAAQgA3AyAM5wELIAAgASIBIAIQtICAgAAiEA3nASABIQEM9QILAkAgASIBIAJHDQBBBiEQDPADCyAAIAFBAWoiASACELuAgIAAIhAN6AEgASEBDDELIABCADcDIEESIRAM1QMLIAEiECACRw0rQR0hEAztAwsCQCABIgEgAkYNACABQQFqIQFBECEQDNQDC0EHIRAM7AMLIABCACAAKQMgIhEgAiABIhBrrSISfSITIBMgEVYbNwMgIBEgElYiFEUN5QFBCCEQDOsDCwJAIAEiASACRg0AIABBiYCAgAA2AgggACABNgIEIAEhAUEUIRAM0gMLQQkhEAzqAwsgASEBIAApAyBQDeQBIAEhAQzyAgsCQCABIgEgAkcNAEELIRAM6QMLIAAgAUEBaiIBIAIQtoCAgAAiEA3lASABIQEM8gILIAAgASIBIAIQuICAgAAiEA3lASABIQEM8gILIAAgASIBIAIQuICAgAAiEA3mASABIQEMDQsgACABIgEgAhC6gICAACIQDecBIAEhAQzwAgsCQCABIgEgAkcNAEEPIRAM5QMLIAEtAAAiEEE7Rg0IIBBBDUcN6AEgAUEBaiEBDO8CCyAAIAEiASACELqAgIAAIhAN6AEgASEBDPICCwNAAkAgAS0AAEHwtYCAAGotAAAiEEEBRg0AIBBBAkcN6wEgACgCBCEQIABBADYCBCAAIBAgAUEBaiIBELmAgIAAIhAN6gEgASEBDPQCCyABQQFqIgEgAkcNAAtBEiEQDOIDCyAAIAEiASACELqAgIAAIhAN6QEgASEBDAoLIAEiASACRw0GQRshEAzgAwsCQCABIgEgAkcNAEEWIRAM4AMLIABBioCAgAA2AgggACABNgIEIAAgASACELiAgIAAIhAN6gEgASEBQSAhEAzGAwsCQCABIgEgAkYNAANAAkAgAS0AAEHwt4CAAGotAAAiEEECRg0AAkAgEEF/ag4E5QHsAQDrAewBCyABQQFqIQFBCCEQDMgDCyABQQFqIgEgAkcNAAtBFSEQDN8DC0EVIRAM3gMLA0ACQCABLQAAQfC5gIAAai0AACIQQQJGDQAgEEF/ag4E3gHsAeAB6wHsAQsgAUEBaiIBIAJHDQALQRghEAzdAwsCQCABIgEgAkYNACAAQYuAgIAANgIIIAAgATYCBCABIQFBByEQDMQDC0EZIRAM3AMLIAFBAWohAQwCCwJAIAEiFCACRw0AQRohEAzbAwsgFCEBAkAgFC0AAEFzag4U3QLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gIA7gILQQAhECAAQQA2AhwgAEGvi4CAADYCECAAQQI2AgwgACAUQQFqNgIUDNoDCwJAIAEtAAAiEEE7Rg0AIBBBDUcN6AEgAUEBaiEBDOUCCyABQQFqIQELQSIhEAy/AwsCQCABIhAgAkcNAEEcIRAM2AMLQgAhESAQIQEgEC0AAEFQag435wHmAQECAwQFBgcIAAAAAAAAAAkKCwwNDgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADxAREhMUAAtBHiEQDL0DC0ICIREM5QELQgMhEQzkAQtCBCERDOMBC0IFIREM4gELQgYhEQzhAQtCByERDOABC0IIIREM3wELQgkhEQzeAQtCCiERDN0BC0ILIREM3AELQgwhEQzbAQtCDSERDNoBC0IOIREM2QELQg8hEQzYAQtCCiERDNcBC0ILIREM1gELQgwhEQzVAQtCDSERDNQBC0IOIREM0wELQg8hEQzSAQtCACERAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAQLQAAQVBqDjflAeQBAAECAwQFBgfmAeYB5gHmAeYB5gHmAQgJCgsMDeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gEODxAREhPmAQtCAiERDOQBC0IDIREM4wELQgQhEQziAQtCBSERDOEBC0IGIREM4AELQgchEQzfAQtCCCERDN4BC0IJIREM3QELQgohEQzcAQtCCyERDNsBC0IMIREM2gELQg0hEQzZAQtCDiERDNgBC0IPIREM1wELQgohEQzWAQtCCyERDNUBC0IMIREM1AELQg0hEQzTAQtCDiERDNIBC0IPIREM0QELIABCACAAKQMgIhEgAiABIhBrrSISfSITIBMgEVYbNwMgIBEgElYiFEUN0gFBHyEQDMADCwJAIAEiASACRg0AIABBiYCAgAA2AgggACABNgIEIAEhAUEkIRAMpwMLQSAhEAy/AwsgACABIhAgAhC+gICAAEF/ag4FtgEAxQIB0QHSAQtBESEQDKQDCyAAQQE6AC8gECEBDLsDCyABIgEgAkcN0gFBJCEQDLsDCyABIg0gAkcNHkHGACEQDLoDCyAAIAEiASACELKAgIAAIhAN1AEgASEBDLUBCyABIhAgAkcNJkHQACEQDLgDCwJAIAEiASACRw0AQSghEAy4AwsgAEEANgIEIABBjICAgAA2AgggACABIAEQsYCAgAAiEA3TASABIQEM2AELAkAgASIQIAJHDQBBKSEQDLcDCyAQLQAAIgFBIEYNFCABQQlHDdMBIBBBAWohAQwVCwJAIAEiASACRg0AIAFBAWohAQwXC0EqIRAMtQMLAkAgASIQIAJHDQBBKyEQDLUDCwJAIBAtAAAiAUEJRg0AIAFBIEcN1QELIAAtACxBCEYN0wEgECEBDJEDCwJAIAEiASACRw0AQSwhEAy0AwsgAS0AAEEKRw3VASABQQFqIQEMyQILIAEiDiACRw3VAUEvIRAMsgMLA0ACQCABLQAAIhBBIEYNAAJAIBBBdmoOBADcAdwBANoBCyABIQEM4AELIAFBAWoiASACRw0AC0ExIRAMsQMLQTIhECABIhQgAkYNsAMgAiAUayAAKAIAIgFqIRUgFCABa0EDaiEWAkADQCAULQAAIhdBIHIgFyAXQb9/akH/AXFBGkkbQf8BcSABQfC7gIAAai0AAEcNAQJAIAFBA0cNAEEGIQEMlgMLIAFBAWohASAUQQFqIhQgAkcNAAsgACAVNgIADLEDCyAAQQA2AgAgFCEBDNkBC0EzIRAgASIUIAJGDa8DIAIgFGsgACgCACIBaiEVIBQgAWtBCGohFgJAA0AgFC0AACIXQSByIBcgF0G/f2pB/wFxQRpJG0H/AXEgAUH0u4CAAGotAABHDQECQCABQQhHDQBBBSEBDJUDCyABQQFqIQEgFEEBaiIUIAJHDQALIAAgFTYCAAywAwsgAEEANgIAIBQhAQzYAQtBNCEQIAEiFCACRg2uAyACIBRrIAAoAgAiAWohFSAUIAFrQQVqIRYCQANAIBQtAAAiF0EgciAXIBdBv39qQf8BcUEaSRtB/wFxIAFB0MKAgABqLQAARw0BAkAgAUEFRw0AQQchAQyUAwsgAUEBaiEBIBRBAWoiFCACRw0ACyAAIBU2AgAMrwMLIABBADYCACAUIQEM1wELAkAgASIBIAJGDQADQAJAIAEtAABBgL6AgABqLQAAIhBBAUYNACAQQQJGDQogASEBDN0BCyABQQFqIgEgAkcNAAtBMCEQDK4DC0EwIRAMrQMLAkAgASIBIAJGDQADQAJAIAEtAAAiEEEgRg0AIBBBdmoOBNkB2gHaAdkB2gELIAFBAWoiASACRw0AC0E4IRAMrQMLQTghEAysAwsDQAJAIAEtAAAiEEEgRg0AIBBBCUcNAwsgAUEBaiIBIAJHDQALQTwhEAyrAwsDQAJAIAEtAAAiEEEgRg0AAkACQCAQQXZqDgTaAQEB2gEACyAQQSxGDdsBCyABIQEMBAsgAUEBaiIBIAJHDQALQT8hEAyqAwsgASEBDNsBC0HAACEQIAEiFCACRg2oAyACIBRrIAAoAgAiAWohFiAUIAFrQQZqIRcCQANAIBQtAABBIHIgAUGAwICAAGotAABHDQEgAUEGRg2OAyABQQFqIQEgFEEBaiIUIAJHDQALIAAgFjYCAAypAwsgAEEANgIAIBQhAQtBNiEQDI4DCwJAIAEiDyACRw0AQcEAIRAMpwMLIABBjICAgAA2AgggACAPNgIEIA8hASAALQAsQX9qDgTNAdUB1wHZAYcDCyABQQFqIQEMzAELAkAgASIBIAJGDQADQAJAIAEtAAAiEEEgciAQIBBBv39qQf8BcUEaSRtB/wFxIhBBCUYNACAQQSBGDQACQAJAAkACQCAQQZ1/ag4TAAMDAwMDAwMBAwMDAwMDAwMDAgMLIAFBAWohAUExIRAMkQMLIAFBAWohAUEyIRAMkAMLIAFBAWohAUEzIRAMjwMLIAEhAQzQAQsgAUEBaiIBIAJHDQALQTUhEAylAwtBNSEQDKQDCwJAIAEiASACRg0AA0ACQCABLQAAQYC8gIAAai0AAEEBRg0AIAEhAQzTAQsgAUEBaiIBIAJHDQALQT0hEAykAwtBPSEQDKMDCyAAIAEiASACELCAgIAAIhAN1gEgASEBDAELIBBBAWohAQtBPCEQDIcDCwJAIAEiASACRw0AQcIAIRAMoAMLAkADQAJAIAEtAABBd2oOGAAC/gL+AoQD/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4CAP4CCyABQQFqIgEgAkcNAAtBwgAhEAygAwsgAUEBaiEBIAAtAC1BAXFFDb0BIAEhAQtBLCEQDIUDCyABIgEgAkcN0wFBxAAhEAydAwsDQAJAIAEtAABBkMCAgABqLQAAQQFGDQAgASEBDLcCCyABQQFqIgEgAkcNAAtBxQAhEAycAwsgDS0AACIQQSBGDbMBIBBBOkcNgQMgACgCBCEBIABBADYCBCAAIAEgDRCvgICAACIBDdABIA1BAWohAQyzAgtBxwAhECABIg0gAkYNmgMgAiANayAAKAIAIgFqIRYgDSABa0EFaiEXA0AgDS0AACIUQSByIBQgFEG/f2pB/wFxQRpJG0H/AXEgAUGQwoCAAGotAABHDYADIAFBBUYN9AIgAUEBaiEBIA1BAWoiDSACRw0ACyAAIBY2AgAMmgMLQcgAIRAgASINIAJGDZkDIAIgDWsgACgCACIBaiEWIA0gAWtBCWohFwNAIA0tAAAiFEEgciAUIBRBv39qQf8BcUEaSRtB/wFxIAFBlsKAgABqLQAARw3/AgJAIAFBCUcNAEECIQEM9QILIAFBAWohASANQQFqIg0gAkcNAAsgACAWNgIADJkDCwJAIAEiDSACRw0AQckAIRAMmQMLAkACQCANLQAAIgFBIHIgASABQb9/akH/AXFBGkkbQf8BcUGSf2oOBwCAA4ADgAOAA4ADAYADCyANQQFqIQFBPiEQDIADCyANQQFqIQFBPyEQDP8CC0HKACEQIAEiDSACRg2XAyACIA1rIAAoAgAiAWohFiANIAFrQQFqIRcDQCANLQAAIhRBIHIgFCAUQb9/akH/AXFBGkkbQf8BcSABQaDCgIAAai0AAEcN/QIgAUEBRg3wAiABQQFqIQEgDUEBaiINIAJHDQALIAAgFjYCAAyXAwtBywAhECABIg0gAkYNlgMgAiANayAAKAIAIgFqIRYgDSABa0EOaiEXA0AgDS0AACIUQSByIBQgFEG/f2pB/wFxQRpJG0H/AXEgAUGiwoCAAGotAABHDfwCIAFBDkYN8AIgAUEBaiEBIA1BAWoiDSACRw0ACyAAIBY2AgAMlgMLQcwAIRAgASINIAJGDZUDIAIgDWsgACgCACIBaiEWIA0gAWtBD2ohFwNAIA0tAAAiFEEgciAUIBRBv39qQf8BcUEaSRtB/wFxIAFBwMKAgABqLQAARw37AgJAIAFBD0cNAEEDIQEM8QILIAFBAWohASANQQFqIg0gAkcNAAsgACAWNgIADJUDC0HNACEQIAEiDSACRg2UAyACIA1rIAAoAgAiAWohFiANIAFrQQVqIRcDQCANLQAAIhRBIHIgFCAUQb9/akH/AXFBGkkbQf8BcSABQdDCgIAAai0AAEcN+gICQCABQQVHDQBBBCEBDPACCyABQQFqIQEgDUEBaiINIAJHDQALIAAgFjYCAAyUAwsCQCABIg0gAkcNAEHOACEQDJQDCwJAAkACQAJAIA0tAAAiAUEgciABIAFBv39qQf8BcUEaSRtB/wFxQZ1/ag4TAP0C/QL9Av0C/QL9Av0C/QL9Av0C/QL9AgH9Av0C/QICA/0CCyANQQFqIQFBwQAhEAz9AgsgDUEBaiEBQcIAIRAM/AILIA1BAWohAUHDACEQDPsCCyANQQFqIQFBxAAhEAz6AgsCQCABIgEgAkYNACAAQY2AgIAANgIIIAAgATYCBCABIQFBxQAhEAz6AgtBzwAhEAySAwsgECEBAkACQCAQLQAAQXZqDgQBqAKoAgCoAgsgEEEBaiEBC0EnIRAM+AILAkAgASIBIAJHDQBB0QAhEAyRAwsCQCABLQAAQSBGDQAgASEBDI0BCyABQQFqIQEgAC0ALUEBcUUNxwEgASEBDIwBCyABIhcgAkcNyAFB0gAhEAyPAwtB0wAhECABIhQgAkYNjgMgAiAUayAAKAIAIgFqIRYgFCABa0EBaiEXA0AgFC0AACABQdbCgIAAai0AAEcNzAEgAUEBRg3HASABQQFqIQEgFEEBaiIUIAJHDQALIAAgFjYCAAyOAwsCQCABIgEgAkcNAEHVACEQDI4DCyABLQAAQQpHDcwBIAFBAWohAQzHAQsCQCABIgEgAkcNAEHWACEQDI0DCwJAAkAgAS0AAEF2ag4EAM0BzQEBzQELIAFBAWohAQzHAQsgAUEBaiEBQcoAIRAM8wILIAAgASIBIAIQroCAgAAiEA3LASABIQFBzQAhEAzyAgsgAC0AKUEiRg2FAwymAgsCQCABIgEgAkcNAEHbACEQDIoDC0EAIRRBASEXQQEhFkEAIRACQAJAAkACQAJAAkACQAJAAkAgAS0AAEFQag4K1AHTAQABAgMEBQYI1QELQQIhEAwGC0EDIRAMBQtBBCEQDAQLQQUhEAwDC0EGIRAMAgtBByEQDAELQQghEAtBACEXQQAhFkEAIRQMzAELQQkhEEEBIRRBACEXQQAhFgzLAQsCQCABIgEgAkcNAEHdACEQDIkDCyABLQAAQS5HDcwBIAFBAWohAQymAgsgASIBIAJHDcwBQd8AIRAMhwMLAkAgASIBIAJGDQAgAEGOgICAADYCCCAAIAE2AgQgASEBQdAAIRAM7gILQeAAIRAMhgMLQeEAIRAgASIBIAJGDYUDIAIgAWsgACgCACIUaiEWIAEgFGtBA2ohFwNAIAEtAAAgFEHiwoCAAGotAABHDc0BIBRBA0YNzAEgFEEBaiEUIAFBAWoiASACRw0ACyAAIBY2AgAMhQMLQeIAIRAgASIBIAJGDYQDIAIgAWsgACgCACIUaiEWIAEgFGtBAmohFwNAIAEtAAAgFEHmwoCAAGotAABHDcwBIBRBAkYNzgEgFEEBaiEUIAFBAWoiASACRw0ACyAAIBY2AgAMhAMLQeMAIRAgASIBIAJGDYMDIAIgAWsgACgCACIUaiEWIAEgFGtBA2ohFwNAIAEtAAAgFEHpwoCAAGotAABHDcsBIBRBA0YNzgEgFEEBaiEUIAFBAWoiASACRw0ACyAAIBY2AgAMgwMLAkAgASIBIAJHDQBB5QAhEAyDAwsgACABQQFqIgEgAhCogICAACIQDc0BIAEhAUHWACEQDOkCCwJAIAEiASACRg0AA0ACQCABLQAAIhBBIEYNAAJAAkACQCAQQbh/ag4LAAHPAc8BzwHPAc8BzwHPAc8BAs8BCyABQQFqIQFB0gAhEAztAgsgAUEBaiEBQdMAIRAM7AILIAFBAWohAUHUACEQDOsCCyABQQFqIgEgAkcNAAtB5AAhEAyCAwtB5AAhEAyBAwsDQAJAIAEtAABB8MKAgABqLQAAIhBBAUYNACAQQX5qDgPPAdAB0QHSAQsgAUEBaiIBIAJHDQALQeYAIRAMgAMLAkAgASIBIAJGDQAgAUEBaiEBDAMLQecAIRAM/wILA0ACQCABLQAAQfDEgIAAai0AACIQQQFGDQACQCAQQX5qDgTSAdMB1AEA1QELIAEhAUHXACEQDOcCCyABQQFqIgEgAkcNAAtB6AAhEAz+AgsCQCABIgEgAkcNAEHpACEQDP4CCwJAIAEtAAAiEEF2ag4augHVAdUBvAHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHKAdUB1QEA0wELIAFBAWohAQtBBiEQDOMCCwNAAkAgAS0AAEHwxoCAAGotAABBAUYNACABIQEMngILIAFBAWoiASACRw0AC0HqACEQDPsCCwJAIAEiASACRg0AIAFBAWohAQwDC0HrACEQDPoCCwJAIAEiASACRw0AQewAIRAM+gILIAFBAWohAQwBCwJAIAEiASACRw0AQe0AIRAM+QILIAFBAWohAQtBBCEQDN4CCwJAIAEiFCACRw0AQe4AIRAM9wILIBQhAQJAAkACQCAULQAAQfDIgIAAai0AAEF/ag4H1AHVAdYBAJwCAQLXAQsgFEEBaiEBDAoLIBRBAWohAQzNAQtBACEQIABBADYCHCAAQZuSgIAANgIQIABBBzYCDCAAIBRBAWo2AhQM9gILAkADQAJAIAEtAABB8MiAgABqLQAAIhBBBEYNAAJAAkAgEEF/ag4H0gHTAdQB2QEABAHZAQsgASEBQdoAIRAM4AILIAFBAWohAUHcACEQDN8CCyABQQFqIgEgAkcNAAtB7wAhEAz2AgsgAUEBaiEBDMsBCwJAIAEiFCACRw0AQfAAIRAM9QILIBQtAABBL0cN1AEgFEEBaiEBDAYLAkAgASIUIAJHDQBB8QAhEAz0AgsCQCAULQAAIgFBL0cNACAUQQFqIQFB3QAhEAzbAgsgAUF2aiIEQRZLDdMBQQEgBHRBiYCAAnFFDdMBDMoCCwJAIAEiASACRg0AIAFBAWohAUHeACEQDNoCC0HyACEQDPICCwJAIAEiFCACRw0AQfQAIRAM8gILIBQhAQJAIBQtAABB8MyAgABqLQAAQX9qDgPJApQCANQBC0HhACEQDNgCCwJAIAEiFCACRg0AA0ACQCAULQAAQfDKgIAAai0AACIBQQNGDQACQCABQX9qDgLLAgDVAQsgFCEBQd8AIRAM2gILIBRBAWoiFCACRw0AC0HzACEQDPECC0HzACEQDPACCwJAIAEiASACRg0AIABBj4CAgAA2AgggACABNgIEIAEhAUHgACEQDNcCC0H1ACEQDO8CCwJAIAEiASACRw0AQfYAIRAM7wILIABBj4CAgAA2AgggACABNgIEIAEhAQtBAyEQDNQCCwNAIAEtAABBIEcNwwIgAUEBaiIBIAJHDQALQfcAIRAM7AILAkAgASIBIAJHDQBB+AAhEAzsAgsgAS0AAEEgRw3OASABQQFqIQEM7wELIAAgASIBIAIQrICAgAAiEA3OASABIQEMjgILAkAgASIEIAJHDQBB+gAhEAzqAgsgBC0AAEHMAEcN0QEgBEEBaiEBQRMhEAzPAQsCQCABIgQgAkcNAEH7ACEQDOkCCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRADQCAELQAAIAFB8M6AgABqLQAARw3QASABQQVGDc4BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQfsAIRAM6AILAkAgASIEIAJHDQBB/AAhEAzoAgsCQAJAIAQtAABBvX9qDgwA0QHRAdEB0QHRAdEB0QHRAdEB0QEB0QELIARBAWohAUHmACEQDM8CCyAEQQFqIQFB5wAhEAzOAgsCQCABIgQgAkcNAEH9ACEQDOcCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHtz4CAAGotAABHDc8BIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEH9ACEQDOcCCyAAQQA2AgAgEEEBaiEBQRAhEAzMAQsCQCABIgQgAkcNAEH+ACEQDOYCCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUH2zoCAAGotAABHDc4BIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEH+ACEQDOYCCyAAQQA2AgAgEEEBaiEBQRYhEAzLAQsCQCABIgQgAkcNAEH/ACEQDOUCCyACIARrIAAoAgAiAWohFCAEIAFrQQNqIRACQANAIAQtAAAgAUH8zoCAAGotAABHDc0BIAFBA0YNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEH/ACEQDOUCCyAAQQA2AgAgEEEBaiEBQQUhEAzKAQsCQCABIgQgAkcNAEGAASEQDOQCCyAELQAAQdkARw3LASAEQQFqIQFBCCEQDMkBCwJAIAEiBCACRw0AQYEBIRAM4wILAkACQCAELQAAQbJ/ag4DAMwBAcwBCyAEQQFqIQFB6wAhEAzKAgsgBEEBaiEBQewAIRAMyQILAkAgASIEIAJHDQBBggEhEAziAgsCQAJAIAQtAABBuH9qDggAywHLAcsBywHLAcsBAcsBCyAEQQFqIQFB6gAhEAzJAgsgBEEBaiEBQe0AIRAMyAILAkAgASIEIAJHDQBBgwEhEAzhAgsgAiAEayAAKAIAIgFqIRAgBCABa0ECaiEUAkADQCAELQAAIAFBgM+AgABqLQAARw3JASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBA2AgBBgwEhEAzhAgtBACEQIABBADYCACAUQQFqIQEMxgELAkAgASIEIAJHDQBBhAEhEAzgAgsgAiAEayAAKAIAIgFqIRQgBCABa0EEaiEQAkADQCAELQAAIAFBg8+AgABqLQAARw3IASABQQRGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBhAEhEAzgAgsgAEEANgIAIBBBAWohAUEjIRAMxQELAkAgASIEIAJHDQBBhQEhEAzfAgsCQAJAIAQtAABBtH9qDggAyAHIAcgByAHIAcgBAcgBCyAEQQFqIQFB7wAhEAzGAgsgBEEBaiEBQfAAIRAMxQILAkAgASIEIAJHDQBBhgEhEAzeAgsgBC0AAEHFAEcNxQEgBEEBaiEBDIMCCwJAIAEiBCACRw0AQYcBIRAM3QILIAIgBGsgACgCACIBaiEUIAQgAWtBA2ohEAJAA0AgBC0AACABQYjPgIAAai0AAEcNxQEgAUEDRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYcBIRAM3QILIABBADYCACAQQQFqIQFBLSEQDMIBCwJAIAEiBCACRw0AQYgBIRAM3AILIAIgBGsgACgCACIBaiEUIAQgAWtBCGohEAJAA0AgBC0AACABQdDPgIAAai0AAEcNxAEgAUEIRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYgBIRAM3AILIABBADYCACAQQQFqIQFBKSEQDMEBCwJAIAEiASACRw0AQYkBIRAM2wILQQEhECABLQAAQd8ARw3AASABQQFqIQEMgQILAkAgASIEIAJHDQBBigEhEAzaAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQA0AgBC0AACABQYzPgIAAai0AAEcNwQEgAUEBRg2vAiABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGKASEQDNkCCwJAIAEiBCACRw0AQYsBIRAM2QILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQY7PgIAAai0AAEcNwQEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYsBIRAM2QILIABBADYCACAQQQFqIQFBAiEQDL4BCwJAIAEiBCACRw0AQYwBIRAM2AILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQfDPgIAAai0AAEcNwAEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYwBIRAM2AILIABBADYCACAQQQFqIQFBHyEQDL0BCwJAIAEiBCACRw0AQY0BIRAM1wILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQfLPgIAAai0AAEcNvwEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQY0BIRAM1wILIABBADYCACAQQQFqIQFBCSEQDLwBCwJAIAEiBCACRw0AQY4BIRAM1gILAkACQCAELQAAQbd/ag4HAL8BvwG/Ab8BvwEBvwELIARBAWohAUH4ACEQDL0CCyAEQQFqIQFB+QAhEAy8AgsCQCABIgQgAkcNAEGPASEQDNUCCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUGRz4CAAGotAABHDb0BIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGPASEQDNUCCyAAQQA2AgAgEEEBaiEBQRghEAy6AQsCQCABIgQgAkcNAEGQASEQDNQCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUGXz4CAAGotAABHDbwBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGQASEQDNQCCyAAQQA2AgAgEEEBaiEBQRchEAy5AQsCQCABIgQgAkcNAEGRASEQDNMCCyACIARrIAAoAgAiAWohFCAEIAFrQQZqIRACQANAIAQtAAAgAUGaz4CAAGotAABHDbsBIAFBBkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGRASEQDNMCCyAAQQA2AgAgEEEBaiEBQRUhEAy4AQsCQCABIgQgAkcNAEGSASEQDNICCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUGhz4CAAGotAABHDboBIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGSASEQDNICCyAAQQA2AgAgEEEBaiEBQR4hEAy3AQsCQCABIgQgAkcNAEGTASEQDNECCyAELQAAQcwARw24ASAEQQFqIQFBCiEQDLYBCwJAIAQgAkcNAEGUASEQDNACCwJAAkAgBC0AAEG/f2oODwC5AbkBuQG5AbkBuQG5AbkBuQG5AbkBuQG5AQG5AQsgBEEBaiEBQf4AIRAMtwILIARBAWohAUH/ACEQDLYCCwJAIAQgAkcNAEGVASEQDM8CCwJAAkAgBC0AAEG/f2oOAwC4AQG4AQsgBEEBaiEBQf0AIRAMtgILIARBAWohBEGAASEQDLUCCwJAIAQgAkcNAEGWASEQDM4CCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUGnz4CAAGotAABHDbYBIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGWASEQDM4CCyAAQQA2AgAgEEEBaiEBQQshEAyzAQsCQCAEIAJHDQBBlwEhEAzNAgsCQAJAAkACQCAELQAAQVNqDiMAuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AQG4AbgBuAG4AbgBArgBuAG4AQO4AQsgBEEBaiEBQfsAIRAMtgILIARBAWohAUH8ACEQDLUCCyAEQQFqIQRBgQEhEAy0AgsgBEEBaiEEQYIBIRAMswILAkAgBCACRw0AQZgBIRAMzAILIAIgBGsgACgCACIBaiEUIAQgAWtBBGohEAJAA0AgBC0AACABQanPgIAAai0AAEcNtAEgAUEERg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZgBIRAMzAILIABBADYCACAQQQFqIQFBGSEQDLEBCwJAIAQgAkcNAEGZASEQDMsCCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUGuz4CAAGotAABHDbMBIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGZASEQDMsCCyAAQQA2AgAgEEEBaiEBQQYhEAywAQsCQCAEIAJHDQBBmgEhEAzKAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFBtM+AgABqLQAARw2yASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBmgEhEAzKAgsgAEEANgIAIBBBAWohAUEcIRAMrwELAkAgBCACRw0AQZsBIRAMyQILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQbbPgIAAai0AAEcNsQEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZsBIRAMyQILIABBADYCACAQQQFqIQFBJyEQDK4BCwJAIAQgAkcNAEGcASEQDMgCCwJAAkAgBC0AAEGsf2oOAgABsQELIARBAWohBEGGASEQDK8CCyAEQQFqIQRBhwEhEAyuAgsCQCAEIAJHDQBBnQEhEAzHAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFBuM+AgABqLQAARw2vASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBnQEhEAzHAgsgAEEANgIAIBBBAWohAUEmIRAMrAELAkAgBCACRw0AQZ4BIRAMxgILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQbrPgIAAai0AAEcNrgEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZ4BIRAMxgILIABBADYCACAQQQFqIQFBAyEQDKsBCwJAIAQgAkcNAEGfASEQDMUCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHtz4CAAGotAABHDa0BIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGfASEQDMUCCyAAQQA2AgAgEEEBaiEBQQwhEAyqAQsCQCAEIAJHDQBBoAEhEAzEAgsgAiAEayAAKAIAIgFqIRQgBCABa0EDaiEQAkADQCAELQAAIAFBvM+AgABqLQAARw2sASABQQNGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBoAEhEAzEAgsgAEEANgIAIBBBAWohAUENIRAMqQELAkAgBCACRw0AQaEBIRAMwwILAkACQCAELQAAQbp/ag4LAKwBrAGsAawBrAGsAawBrAGsAQGsAQsgBEEBaiEEQYsBIRAMqgILIARBAWohBEGMASEQDKkCCwJAIAQgAkcNAEGiASEQDMICCyAELQAAQdAARw2pASAEQQFqIQQM6QELAkAgBCACRw0AQaMBIRAMwQILAkACQCAELQAAQbd/ag4HAaoBqgGqAaoBqgEAqgELIARBAWohBEGOASEQDKgCCyAEQQFqIQFBIiEQDKYBCwJAIAQgAkcNAEGkASEQDMACCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUHAz4CAAGotAABHDagBIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGkASEQDMACCyAAQQA2AgAgEEEBaiEBQR0hEAylAQsCQCAEIAJHDQBBpQEhEAy/AgsCQAJAIAQtAABBrn9qDgMAqAEBqAELIARBAWohBEGQASEQDKYCCyAEQQFqIQFBBCEQDKQBCwJAIAQgAkcNAEGmASEQDL4CCwJAAkACQAJAAkAgBC0AAEG/f2oOFQCqAaoBqgGqAaoBqgGqAaoBqgGqAQGqAaoBAqoBqgEDqgGqAQSqAQsgBEEBaiEEQYgBIRAMqAILIARBAWohBEGJASEQDKcCCyAEQQFqIQRBigEhEAymAgsgBEEBaiEEQY8BIRAMpQILIARBAWohBEGRASEQDKQCCwJAIAQgAkcNAEGnASEQDL0CCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHtz4CAAGotAABHDaUBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGnASEQDL0CCyAAQQA2AgAgEEEBaiEBQREhEAyiAQsCQCAEIAJHDQBBqAEhEAy8AgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFBws+AgABqLQAARw2kASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBqAEhEAy8AgsgAEEANgIAIBBBAWohAUEsIRAMoQELAkAgBCACRw0AQakBIRAMuwILIAIgBGsgACgCACIBaiEUIAQgAWtBBGohEAJAA0AgBC0AACABQcXPgIAAai0AAEcNowEgAUEERg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQakBIRAMuwILIABBADYCACAQQQFqIQFBKyEQDKABCwJAIAQgAkcNAEGqASEQDLoCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHKz4CAAGotAABHDaIBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGqASEQDLoCCyAAQQA2AgAgEEEBaiEBQRQhEAyfAQsCQCAEIAJHDQBBqwEhEAy5AgsCQAJAAkACQCAELQAAQb5/ag4PAAECpAGkAaQBpAGkAaQBpAGkAaQBpAGkAQOkAQsgBEEBaiEEQZMBIRAMogILIARBAWohBEGUASEQDKECCyAEQQFqIQRBlQEhEAygAgsgBEEBaiEEQZYBIRAMnwILAkAgBCACRw0AQawBIRAMuAILIAQtAABBxQBHDZ8BIARBAWohBAzgAQsCQCAEIAJHDQBBrQEhEAy3AgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFBzc+AgABqLQAARw2fASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBrQEhEAy3AgsgAEEANgIAIBBBAWohAUEOIRAMnAELAkAgBCACRw0AQa4BIRAMtgILIAQtAABB0ABHDZ0BIARBAWohAUElIRAMmwELAkAgBCACRw0AQa8BIRAMtQILIAIgBGsgACgCACIBaiEUIAQgAWtBCGohEAJAA0AgBC0AACABQdDPgIAAai0AAEcNnQEgAUEIRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQa8BIRAMtQILIABBADYCACAQQQFqIQFBKiEQDJoBCwJAIAQgAkcNAEGwASEQDLQCCwJAAkAgBC0AAEGrf2oOCwCdAZ0BnQGdAZ0BnQGdAZ0BnQEBnQELIARBAWohBEGaASEQDJsCCyAEQQFqIQRBmwEhEAyaAgsCQCAEIAJHDQBBsQEhEAyzAgsCQAJAIAQtAABBv39qDhQAnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBAZwBCyAEQQFqIQRBmQEhEAyaAgsgBEEBaiEEQZwBIRAMmQILAkAgBCACRw0AQbIBIRAMsgILIAIgBGsgACgCACIBaiEUIAQgAWtBA2ohEAJAA0AgBC0AACABQdnPgIAAai0AAEcNmgEgAUEDRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbIBIRAMsgILIABBADYCACAQQQFqIQFBISEQDJcBCwJAIAQgAkcNAEGzASEQDLECCyACIARrIAAoAgAiAWohFCAEIAFrQQZqIRACQANAIAQtAAAgAUHdz4CAAGotAABHDZkBIAFBBkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGzASEQDLECCyAAQQA2AgAgEEEBaiEBQRohEAyWAQsCQCAEIAJHDQBBtAEhEAywAgsCQAJAAkAgBC0AAEG7f2oOEQCaAZoBmgGaAZoBmgGaAZoBmgEBmgGaAZoBmgGaAQKaAQsgBEEBaiEEQZ0BIRAMmAILIARBAWohBEGeASEQDJcCCyAEQQFqIQRBnwEhEAyWAgsCQCAEIAJHDQBBtQEhEAyvAgsgAiAEayAAKAIAIgFqIRQgBCABa0EFaiEQAkADQCAELQAAIAFB5M+AgABqLQAARw2XASABQQVGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBtQEhEAyvAgsgAEEANgIAIBBBAWohAUEoIRAMlAELAkAgBCACRw0AQbYBIRAMrgILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQerPgIAAai0AAEcNlgEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbYBIRAMrgILIABBADYCACAQQQFqIQFBByEQDJMBCwJAIAQgAkcNAEG3ASEQDK0CCwJAAkAgBC0AAEG7f2oODgCWAZYBlgGWAZYBlgGWAZYBlgGWAZYBlgEBlgELIARBAWohBEGhASEQDJQCCyAEQQFqIQRBogEhEAyTAgsCQCAEIAJHDQBBuAEhEAysAgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFB7c+AgABqLQAARw2UASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBuAEhEAysAgsgAEEANgIAIBBBAWohAUESIRAMkQELAkAgBCACRw0AQbkBIRAMqwILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQfDPgIAAai0AAEcNkwEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbkBIRAMqwILIABBADYCACAQQQFqIQFBICEQDJABCwJAIAQgAkcNAEG6ASEQDKoCCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUHyz4CAAGotAABHDZIBIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEG6ASEQDKoCCyAAQQA2AgAgEEEBaiEBQQ8hEAyPAQsCQCAEIAJHDQBBuwEhEAypAgsCQAJAIAQtAABBt39qDgcAkgGSAZIBkgGSAQGSAQsgBEEBaiEEQaUBIRAMkAILIARBAWohBEGmASEQDI8CCwJAIAQgAkcNAEG8ASEQDKgCCyACIARrIAAoAgAiAWohFCAEIAFrQQdqIRACQANAIAQtAAAgAUH0z4CAAGotAABHDZABIAFBB0YNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEG8ASEQDKgCCyAAQQA2AgAgEEEBaiEBQRshEAyNAQsCQCAEIAJHDQBBvQEhEAynAgsCQAJAAkAgBC0AAEG+f2oOEgCRAZEBkQGRAZEBkQGRAZEBkQEBkQGRAZEBkQGRAZEBApEBCyAEQQFqIQRBpAEhEAyPAgsgBEEBaiEEQacBIRAMjgILIARBAWohBEGoASEQDI0CCwJAIAQgAkcNAEG+ASEQDKYCCyAELQAAQc4ARw2NASAEQQFqIQQMzwELAkAgBCACRw0AQb8BIRAMpQILAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkAgBC0AAEG/f2oOFQABAgOcAQQFBpwBnAGcAQcICQoLnAEMDQ4PnAELIARBAWohAUHoACEQDJoCCyAEQQFqIQFB6QAhEAyZAgsgBEEBaiEBQe4AIRAMmAILIARBAWohAUHyACEQDJcCCyAEQQFqIQFB8wAhEAyWAgsgBEEBaiEBQfYAIRAMlQILIARBAWohAUH3ACEQDJQCCyAEQQFqIQFB+gAhEAyTAgsgBEEBaiEEQYMBIRAMkgILIARBAWohBEGEASEQDJECCyAEQQFqIQRBhQEhEAyQAgsgBEEBaiEEQZIBIRAMjwILIARBAWohBEGYASEQDI4CCyAEQQFqIQRBoAEhEAyNAgsgBEEBaiEEQaMBIRAMjAILIARBAWohBEGqASEQDIsCCwJAIAQgAkYNACAAQZCAgIAANgIIIAAgBDYCBEGrASEQDIsCC0HAASEQDKMCCyAAIAUgAhCqgICAACIBDYsBIAUhAQxcCwJAIAYgAkYNACAGQQFqIQUMjQELQcIBIRAMoQILA0ACQCAQLQAAQXZqDgSMAQAAjwEACyAQQQFqIhAgAkcNAAtBwwEhEAygAgsCQCAHIAJGDQAgAEGRgICAADYCCCAAIAc2AgQgByEBQQEhEAyHAgtBxAEhEAyfAgsCQCAHIAJHDQBBxQEhEAyfAgsCQAJAIActAABBdmoOBAHOAc4BAM4BCyAHQQFqIQYMjQELIAdBAWohBQyJAQsCQCAHIAJHDQBBxgEhEAyeAgsCQAJAIActAABBdmoOFwGPAY8BAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAQCPAQsgB0EBaiEHC0GwASEQDIQCCwJAIAggAkcNAEHIASEQDJ0CCyAILQAAQSBHDY0BIABBADsBMiAIQQFqIQFBswEhEAyDAgsgASEXAkADQCAXIgcgAkYNASAHLQAAQVBqQf8BcSIQQQpPDcwBAkAgAC8BMiIUQZkzSw0AIAAgFEEKbCIUOwEyIBBB//8DcyAUQf7/A3FJDQAgB0EBaiEXIAAgFCAQaiIQOwEyIBBB//8DcUHoB0kNAQsLQQAhECAAQQA2AhwgAEHBiYCAADYCECAAQQ02AgwgACAHQQFqNgIUDJwCC0HHASEQDJsCCyAAIAggAhCugICAACIQRQ3KASAQQRVHDYwBIABByAE2AhwgACAINgIUIABByZeAgAA2AhAgAEEVNgIMQQAhEAyaAgsCQCAJIAJHDQBBzAEhEAyaAgtBACEUQQEhF0EBIRZBACEQAkACQAJAAkACQAJAAkACQAJAIAktAABBUGoOCpYBlQEAAQIDBAUGCJcBC0ECIRAMBgtBAyEQDAULQQQhEAwEC0EFIRAMAwtBBiEQDAILQQchEAwBC0EIIRALQQAhF0EAIRZBACEUDI4BC0EJIRBBASEUQQAhF0EAIRYMjQELAkAgCiACRw0AQc4BIRAMmQILIAotAABBLkcNjgEgCkEBaiEJDMoBCyALIAJHDY4BQdABIRAMlwILAkAgCyACRg0AIABBjoCAgAA2AgggACALNgIEQbcBIRAM/gELQdEBIRAMlgILAkAgBCACRw0AQdIBIRAMlgILIAIgBGsgACgCACIQaiEUIAQgEGtBBGohCwNAIAQtAAAgEEH8z4CAAGotAABHDY4BIBBBBEYN6QEgEEEBaiEQIARBAWoiBCACRw0ACyAAIBQ2AgBB0gEhEAyVAgsgACAMIAIQrICAgAAiAQ2NASAMIQEMuAELAkAgBCACRw0AQdQBIRAMlAILIAIgBGsgACgCACIQaiEUIAQgEGtBAWohDANAIAQtAAAgEEGB0ICAAGotAABHDY8BIBBBAUYNjgEgEEEBaiEQIARBAWoiBCACRw0ACyAAIBQ2AgBB1AEhEAyTAgsCQCAEIAJHDQBB1gEhEAyTAgsgAiAEayAAKAIAIhBqIRQgBCAQa0ECaiELA0AgBC0AACAQQYPQgIAAai0AAEcNjgEgEEECRg2QASAQQQFqIRAgBEEBaiIEIAJHDQALIAAgFDYCAEHWASEQDJICCwJAIAQgAkcNAEHXASEQDJICCwJAAkAgBC0AAEG7f2oOEACPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BAY8BCyAEQQFqIQRBuwEhEAz5AQsgBEEBaiEEQbwBIRAM+AELAkAgBCACRw0AQdgBIRAMkQILIAQtAABByABHDYwBIARBAWohBAzEAQsCQCAEIAJGDQAgAEGQgICAADYCCCAAIAQ2AgRBvgEhEAz3AQtB2QEhEAyPAgsCQCAEIAJHDQBB2gEhEAyPAgsgBC0AAEHIAEYNwwEgAEEBOgAoDLkBCyAAQQI6AC8gACAEIAIQpoCAgAAiEA2NAUHCASEQDPQBCyAALQAoQX9qDgK3AbkBuAELA0ACQCAELQAAQXZqDgQAjgGOAQCOAQsgBEEBaiIEIAJHDQALQd0BIRAMiwILIABBADoALyAALQAtQQRxRQ2EAgsgAEEAOgAvIABBAToANCABIQEMjAELIBBBFUYN2gEgAEEANgIcIAAgATYCFCAAQaeOgIAANgIQIABBEjYCDEEAIRAMiAILAkAgACAQIAIQtICAgAAiBA0AIBAhAQyBAgsCQCAEQRVHDQAgAEEDNgIcIAAgEDYCFCAAQbCYgIAANgIQIABBFTYCDEEAIRAMiAILIABBADYCHCAAIBA2AhQgAEGnjoCAADYCECAAQRI2AgxBACEQDIcCCyAQQRVGDdYBIABBADYCHCAAIAE2AhQgAEHajYCAADYCECAAQRQ2AgxBACEQDIYCCyAAKAIEIRcgAEEANgIEIBAgEadqIhYhASAAIBcgECAWIBQbIhAQtYCAgAAiFEUNjQEgAEEHNgIcIAAgEDYCFCAAIBQ2AgxBACEQDIUCCyAAIAAvATBBgAFyOwEwIAEhAQtBKiEQDOoBCyAQQRVGDdEBIABBADYCHCAAIAE2AhQgAEGDjICAADYCECAAQRM2AgxBACEQDIICCyAQQRVGDc8BIABBADYCHCAAIAE2AhQgAEGaj4CAADYCECAAQSI2AgxBACEQDIECCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQt4CAgAAiEA0AIAFBAWohAQyNAQsgAEEMNgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDIACCyAQQRVGDcwBIABBADYCHCAAIAE2AhQgAEGaj4CAADYCECAAQSI2AgxBACEQDP8BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQt4CAgAAiEA0AIAFBAWohAQyMAQsgAEENNgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDP4BCyAQQRVGDckBIABBADYCHCAAIAE2AhQgAEHGjICAADYCECAAQSM2AgxBACEQDP0BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQuYCAgAAiEA0AIAFBAWohAQyLAQsgAEEONgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDPwBCyAAQQA2AhwgACABNgIUIABBwJWAgAA2AhAgAEECNgIMQQAhEAz7AQsgEEEVRg3FASAAQQA2AhwgACABNgIUIABBxoyAgAA2AhAgAEEjNgIMQQAhEAz6AQsgAEEQNgIcIAAgATYCFCAAIBA2AgxBACEQDPkBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQuYCAgAAiBA0AIAFBAWohAQzxAQsgAEERNgIcIAAgBDYCDCAAIAFBAWo2AhRBACEQDPgBCyAQQRVGDcEBIABBADYCHCAAIAE2AhQgAEHGjICAADYCECAAQSM2AgxBACEQDPcBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQuYCAgAAiEA0AIAFBAWohAQyIAQsgAEETNgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDPYBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQuYCAgAAiBA0AIAFBAWohAQztAQsgAEEUNgIcIAAgBDYCDCAAIAFBAWo2AhRBACEQDPUBCyAQQRVGDb0BIABBADYCHCAAIAE2AhQgAEGaj4CAADYCECAAQSI2AgxBACEQDPQBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQt4CAgAAiEA0AIAFBAWohAQyGAQsgAEEWNgIcIAAgEDYCDCAAIAFBAWo2AhRBACEQDPMBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQt4CAgAAiBA0AIAFBAWohAQzpAQsgAEEXNgIcIAAgBDYCDCAAIAFBAWo2AhRBACEQDPIBCyAAQQA2AhwgACABNgIUIABBzZOAgAA2AhAgAEEMNgIMQQAhEAzxAQtCASERCyAQQQFqIQECQCAAKQMgIhJC//////////8PVg0AIAAgEkIEhiARhDcDICABIQEMhAELIABBADYCHCAAIAE2AhQgAEGtiYCAADYCECAAQQw2AgxBACEQDO8BCyAAQQA2AhwgACAQNgIUIABBzZOAgAA2AhAgAEEMNgIMQQAhEAzuAQsgACgCBCEXIABBADYCBCAQIBGnaiIWIQEgACAXIBAgFiAUGyIQELWAgIAAIhRFDXMgAEEFNgIcIAAgEDYCFCAAIBQ2AgxBACEQDO0BCyAAQQA2AhwgACAQNgIUIABBqpyAgAA2AhAgAEEPNgIMQQAhEAzsAQsgACAQIAIQtICAgAAiAQ0BIBAhAQtBDiEQDNEBCwJAIAFBFUcNACAAQQI2AhwgACAQNgIUIABBsJiAgAA2AhAgAEEVNgIMQQAhEAzqAQsgAEEANgIcIAAgEDYCFCAAQaeOgIAANgIQIABBEjYCDEEAIRAM6QELIAFBAWohEAJAIAAvATAiAUGAAXFFDQACQCAAIBAgAhC7gICAACIBDQAgECEBDHALIAFBFUcNugEgAEEFNgIcIAAgEDYCFCAAQfmXgIAANgIQIABBFTYCDEEAIRAM6QELAkAgAUGgBHFBoARHDQAgAC0ALUECcQ0AIABBADYCHCAAIBA2AhQgAEGWk4CAADYCECAAQQQ2AgxBACEQDOkBCyAAIBAgAhC9gICAABogECEBAkACQAJAAkACQCAAIBAgAhCzgICAAA4WAgEABAQEBAQEBAQEBAQEBAQEBAQEAwQLIABBAToALgsgACAALwEwQcAAcjsBMCAQIQELQSYhEAzRAQsgAEEjNgIcIAAgEDYCFCAAQaWWgIAANgIQIABBFTYCDEEAIRAM6QELIABBADYCHCAAIBA2AhQgAEHVi4CAADYCECAAQRE2AgxBACEQDOgBCyAALQAtQQFxRQ0BQcMBIRAMzgELAkAgDSACRg0AA0ACQCANLQAAQSBGDQAgDSEBDMQBCyANQQFqIg0gAkcNAAtBJSEQDOcBC0ElIRAM5gELIAAoAgQhBCAAQQA2AgQgACAEIA0Qr4CAgAAiBEUNrQEgAEEmNgIcIAAgBDYCDCAAIA1BAWo2AhRBACEQDOUBCyAQQRVGDasBIABBADYCHCAAIAE2AhQgAEH9jYCAADYCECAAQR02AgxBACEQDOQBCyAAQSc2AhwgACABNgIUIAAgEDYCDEEAIRAM4wELIBAhAUEBIRQCQAJAAkACQAJAAkACQCAALQAsQX5qDgcGBQUDAQIABQsgACAALwEwQQhyOwEwDAMLQQIhFAwBC0EEIRQLIABBAToALCAAIAAvATAgFHI7ATALIBAhAQtBKyEQDMoBCyAAQQA2AhwgACAQNgIUIABBq5KAgAA2AhAgAEELNgIMQQAhEAziAQsgAEEANgIcIAAgATYCFCAAQeGPgIAANgIQIABBCjYCDEEAIRAM4QELIABBADoALCAQIQEMvQELIBAhAUEBIRQCQAJAAkACQAJAIAAtACxBe2oOBAMBAgAFCyAAIAAvATBBCHI7ATAMAwtBAiEUDAELQQQhFAsgAEEBOgAsIAAgAC8BMCAUcjsBMAsgECEBC0EpIRAMxQELIABBADYCHCAAIAE2AhQgAEHwlICAADYCECAAQQM2AgxBACEQDN0BCwJAIA4tAABBDUcNACAAKAIEIQEgAEEANgIEAkAgACABIA4QsYCAgAAiAQ0AIA5BAWohAQx1CyAAQSw2AhwgACABNgIMIAAgDkEBajYCFEEAIRAM3QELIAAtAC1BAXFFDQFBxAEhEAzDAQsCQCAOIAJHDQBBLSEQDNwBCwJAAkADQAJAIA4tAABBdmoOBAIAAAMACyAOQQFqIg4gAkcNAAtBLSEQDN0BCyAAKAIEIQEgAEEANgIEAkAgACABIA4QsYCAgAAiAQ0AIA4hAQx0CyAAQSw2AhwgACAONgIUIAAgATYCDEEAIRAM3AELIAAoAgQhASAAQQA2AgQCQCAAIAEgDhCxgICAACIBDQAgDkEBaiEBDHMLIABBLDYCHCAAIAE2AgwgACAOQQFqNgIUQQAhEAzbAQsgACgCBCEEIABBADYCBCAAIAQgDhCxgICAACIEDaABIA4hAQzOAQsgEEEsRw0BIAFBAWohEEEBIQECQAJAAkACQAJAIAAtACxBe2oOBAMBAgQACyAQIQEMBAtBAiEBDAELQQQhAQsgAEEBOgAsIAAgAC8BMCABcjsBMCAQIQEMAQsgACAALwEwQQhyOwEwIBAhAQtBOSEQDL8BCyAAQQA6ACwgASEBC0E0IRAMvQELIAAgAC8BMEEgcjsBMCABIQEMAgsgACgCBCEEIABBADYCBAJAIAAgBCABELGAgIAAIgQNACABIQEMxwELIABBNzYCHCAAIAE2AhQgACAENgIMQQAhEAzUAQsgAEEIOgAsIAEhAQtBMCEQDLkBCwJAIAAtAChBAUYNACABIQEMBAsgAC0ALUEIcUUNkwEgASEBDAMLIAAtADBBIHENlAFBxQEhEAy3AQsCQCAPIAJGDQACQANAAkAgDy0AAEFQaiIBQf8BcUEKSQ0AIA8hAUE1IRAMugELIAApAyAiEUKZs+bMmbPmzBlWDQEgACARQgp+IhE3AyAgESABrUL/AYMiEkJ/hVYNASAAIBEgEnw3AyAgD0EBaiIPIAJHDQALQTkhEAzRAQsgACgCBCECIABBADYCBCAAIAIgD0EBaiIEELGAgIAAIgINlQEgBCEBDMMBC0E5IRAMzwELAkAgAC8BMCIBQQhxRQ0AIAAtAChBAUcNACAALQAtQQhxRQ2QAQsgACABQff7A3FBgARyOwEwIA8hAQtBNyEQDLQBCyAAIAAvATBBEHI7ATAMqwELIBBBFUYNiwEgAEEANgIcIAAgATYCFCAAQfCOgIAANgIQIABBHDYCDEEAIRAMywELIABBwwA2AhwgACABNgIMIAAgDUEBajYCFEEAIRAMygELAkAgAS0AAEE6Rw0AIAAoAgQhECAAQQA2AgQCQCAAIBAgARCvgICAACIQDQAgAUEBaiEBDGMLIABBwwA2AhwgACAQNgIMIAAgAUEBajYCFEEAIRAMygELIABBADYCHCAAIAE2AhQgAEGxkYCAADYCECAAQQo2AgxBACEQDMkBCyAAQQA2AhwgACABNgIUIABBoJmAgAA2AhAgAEEeNgIMQQAhEAzIAQsgAEEANgIACyAAQYASOwEqIAAgF0EBaiIBIAIQqICAgAAiEA0BIAEhAQtBxwAhEAysAQsgEEEVRw2DASAAQdEANgIcIAAgATYCFCAAQeOXgIAANgIQIABBFTYCDEEAIRAMxAELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDF4LIABB0gA2AhwgACABNgIUIAAgEDYCDEEAIRAMwwELIABBADYCHCAAIBQ2AhQgAEHBqICAADYCECAAQQc2AgwgAEEANgIAQQAhEAzCAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMXQsgAEHTADYCHCAAIAE2AhQgACAQNgIMQQAhEAzBAQtBACEQIABBADYCHCAAIAE2AhQgAEGAkYCAADYCECAAQQk2AgwMwAELIBBBFUYNfSAAQQA2AhwgACABNgIUIABBlI2AgAA2AhAgAEEhNgIMQQAhEAy/AQtBASEWQQAhF0EAIRRBASEQCyAAIBA6ACsgAUEBaiEBAkACQCAALQAtQRBxDQACQAJAAkAgAC0AKg4DAQACBAsgFkUNAwwCCyAUDQEMAgsgF0UNAQsgACgCBCEQIABBADYCBAJAIAAgECABEK2AgIAAIhANACABIQEMXAsgAEHYADYCHCAAIAE2AhQgACAQNgIMQQAhEAy+AQsgACgCBCEEIABBADYCBAJAIAAgBCABEK2AgIAAIgQNACABIQEMrQELIABB2QA2AhwgACABNgIUIAAgBDYCDEEAIRAMvQELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARCtgICAACIEDQAgASEBDKsBCyAAQdoANgIcIAAgATYCFCAAIAQ2AgxBACEQDLwBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQrYCAgAAiBA0AIAEhAQypAQsgAEHcADYCHCAAIAE2AhQgACAENgIMQQAhEAy7AQsCQCABLQAAQVBqIhBB/wFxQQpPDQAgACAQOgAqIAFBAWohAUHPACEQDKIBCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQrYCAgAAiBA0AIAEhAQynAQsgAEHeADYCHCAAIAE2AhQgACAENgIMQQAhEAy6AQsgAEEANgIAIBdBAWohAQJAIAAtAClBI08NACABIQEMWQsgAEEANgIcIAAgATYCFCAAQdOJgIAANgIQIABBCDYCDEEAIRAMuQELIABBADYCAAtBACEQIABBADYCHCAAIAE2AhQgAEGQs4CAADYCECAAQQg2AgwMtwELIABBADYCACAXQQFqIQECQCAALQApQSFHDQAgASEBDFYLIABBADYCHCAAIAE2AhQgAEGbioCAADYCECAAQQg2AgxBACEQDLYBCyAAQQA2AgAgF0EBaiEBAkAgAC0AKSIQQV1qQQtPDQAgASEBDFULAkAgEEEGSw0AQQEgEHRBygBxRQ0AIAEhAQxVC0EAIRAgAEEANgIcIAAgATYCFCAAQfeJgIAANgIQIABBCDYCDAy1AQsgEEEVRg1xIABBADYCHCAAIAE2AhQgAEG5jYCAADYCECAAQRo2AgxBACEQDLQBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxUCyAAQeUANgIcIAAgATYCFCAAIBA2AgxBACEQDLMBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxNCyAAQdIANgIcIAAgATYCFCAAIBA2AgxBACEQDLIBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxNCyAAQdMANgIcIAAgATYCFCAAIBA2AgxBACEQDLEBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxRCyAAQeUANgIcIAAgATYCFCAAIBA2AgxBACEQDLABCyAAQQA2AhwgACABNgIUIABBxoqAgAA2AhAgAEEHNgIMQQAhEAyvAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMSQsgAEHSADYCHCAAIAE2AhQgACAQNgIMQQAhEAyuAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMSQsgAEHTADYCHCAAIAE2AhQgACAQNgIMQQAhEAytAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMTQsgAEHlADYCHCAAIAE2AhQgACAQNgIMQQAhEAysAQsgAEEANgIcIAAgATYCFCAAQdyIgIAANgIQIABBBzYCDEEAIRAMqwELIBBBP0cNASABQQFqIQELQQUhEAyQAQtBACEQIABBADYCHCAAIAE2AhQgAEH9koCAADYCECAAQQc2AgwMqAELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDEILIABB0gA2AhwgACABNgIUIAAgEDYCDEEAIRAMpwELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDEILIABB0wA2AhwgACABNgIUIAAgEDYCDEEAIRAMpgELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDEYLIABB5QA2AhwgACABNgIUIAAgEDYCDEEAIRAMpQELIAAoAgQhASAAQQA2AgQCQCAAIAEgFBCngICAACIBDQAgFCEBDD8LIABB0gA2AhwgACAUNgIUIAAgATYCDEEAIRAMpAELIAAoAgQhASAAQQA2AgQCQCAAIAEgFBCngICAACIBDQAgFCEBDD8LIABB0wA2AhwgACAUNgIUIAAgATYCDEEAIRAMowELIAAoAgQhASAAQQA2AgQCQCAAIAEgFBCngICAACIBDQAgFCEBDEMLIABB5QA2AhwgACAUNgIUIAAgATYCDEEAIRAMogELIABBADYCHCAAIBQ2AhQgAEHDj4CAADYCECAAQQc2AgxBACEQDKEBCyAAQQA2AhwgACABNgIUIABBw4+AgAA2AhAgAEEHNgIMQQAhEAygAQtBACEQIABBADYCHCAAIBQ2AhQgAEGMnICAADYCECAAQQc2AgwMnwELIABBADYCHCAAIBQ2AhQgAEGMnICAADYCECAAQQc2AgxBACEQDJ4BCyAAQQA2AhwgACAUNgIUIABB/pGAgAA2AhAgAEEHNgIMQQAhEAydAQsgAEEANgIcIAAgATYCFCAAQY6bgIAANgIQIABBBjYCDEEAIRAMnAELIBBBFUYNVyAAQQA2AhwgACABNgIUIABBzI6AgAA2AhAgAEEgNgIMQQAhEAybAQsgAEEANgIAIBBBAWohAUEkIRALIAAgEDoAKSAAKAIEIRAgAEEANgIEIAAgECABEKuAgIAAIhANVCABIQEMPgsgAEEANgIAC0EAIRAgAEEANgIcIAAgBDYCFCAAQfGbgIAANgIQIABBBjYCDAyXAQsgAUEVRg1QIABBADYCHCAAIAU2AhQgAEHwjICAADYCECAAQRs2AgxBACEQDJYBCyAAKAIEIQUgAEEANgIEIAAgBSAQEKmAgIAAIgUNASAQQQFqIQULQa0BIRAMewsgAEHBATYCHCAAIAU2AgwgACAQQQFqNgIUQQAhEAyTAQsgACgCBCEGIABBADYCBCAAIAYgEBCpgICAACIGDQEgEEEBaiEGC0GuASEQDHgLIABBwgE2AhwgACAGNgIMIAAgEEEBajYCFEEAIRAMkAELIABBADYCHCAAIAc2AhQgAEGXi4CAADYCECAAQQ02AgxBACEQDI8BCyAAQQA2AhwgACAINgIUIABB45CAgAA2AhAgAEEJNgIMQQAhEAyOAQsgAEEANgIcIAAgCDYCFCAAQZSNgIAANgIQIABBITYCDEEAIRAMjQELQQEhFkEAIRdBACEUQQEhEAsgACAQOgArIAlBAWohCAJAAkAgAC0ALUEQcQ0AAkACQAJAIAAtACoOAwEAAgQLIBZFDQMMAgsgFA0BDAILIBdFDQELIAAoAgQhECAAQQA2AgQgACAQIAgQrYCAgAAiEEUNPSAAQckBNgIcIAAgCDYCFCAAIBA2AgxBACEQDIwBCyAAKAIEIQQgAEEANgIEIAAgBCAIEK2AgIAAIgRFDXYgAEHKATYCHCAAIAg2AhQgACAENgIMQQAhEAyLAQsgACgCBCEEIABBADYCBCAAIAQgCRCtgICAACIERQ10IABBywE2AhwgACAJNgIUIAAgBDYCDEEAIRAMigELIAAoAgQhBCAAQQA2AgQgACAEIAoQrYCAgAAiBEUNciAAQc0BNgIcIAAgCjYCFCAAIAQ2AgxBACEQDIkBCwJAIAstAABBUGoiEEH/AXFBCk8NACAAIBA6ACogC0EBaiEKQbYBIRAMcAsgACgCBCEEIABBADYCBCAAIAQgCxCtgICAACIERQ1wIABBzwE2AhwgACALNgIUIAAgBDYCDEEAIRAMiAELIABBADYCHCAAIAQ2AhQgAEGQs4CAADYCECAAQQg2AgwgAEEANgIAQQAhEAyHAQsgAUEVRg0/IABBADYCHCAAIAw2AhQgAEHMjoCAADYCECAAQSA2AgxBACEQDIYBCyAAQYEEOwEoIAAoAgQhECAAQgA3AwAgACAQIAxBAWoiDBCrgICAACIQRQ04IABB0wE2AhwgACAMNgIUIAAgEDYCDEEAIRAMhQELIABBADYCAAtBACEQIABBADYCHCAAIAQ2AhQgAEHYm4CAADYCECAAQQg2AgwMgwELIAAoAgQhECAAQgA3AwAgACAQIAtBAWoiCxCrgICAACIQDQFBxgEhEAxpCyAAQQI6ACgMVQsgAEHVATYCHCAAIAs2AhQgACAQNgIMQQAhEAyAAQsgEEEVRg03IABBADYCHCAAIAQ2AhQgAEGkjICAADYCECAAQRA2AgxBACEQDH8LIAAtADRBAUcNNCAAIAQgAhC8gICAACIQRQ00IBBBFUcNNSAAQdwBNgIcIAAgBDYCFCAAQdWWgIAANgIQIABBFTYCDEEAIRAMfgtBACEQIABBADYCHCAAQa+LgIAANgIQIABBAjYCDCAAIBRBAWo2AhQMfQtBACEQDGMLQQIhEAxiC0ENIRAMYQtBDyEQDGALQSUhEAxfC0ETIRAMXgtBFSEQDF0LQRYhEAxcC0EXIRAMWwtBGCEQDFoLQRkhEAxZC0EaIRAMWAtBGyEQDFcLQRwhEAxWC0EdIRAMVQtBHyEQDFQLQSEhEAxTC0EjIRAMUgtBxgAhEAxRC0EuIRAMUAtBLyEQDE8LQTshEAxOC0E9IRAMTQtByAAhEAxMC0HJACEQDEsLQcsAIRAMSgtBzAAhEAxJC0HOACEQDEgLQdEAIRAMRwtB1QAhEAxGC0HYACEQDEULQdkAIRAMRAtB2wAhEAxDC0HkACEQDEILQeUAIRAMQQtB8QAhEAxAC0H0ACEQDD8LQY0BIRAMPgtBlwEhEAw9C0GpASEQDDwLQawBIRAMOwtBwAEhEAw6C0G5ASEQDDkLQa8BIRAMOAtBsQEhEAw3C0GyASEQDDYLQbQBIRAMNQtBtQEhEAw0C0G6ASEQDDMLQb0BIRAMMgtBvwEhEAwxC0HBASEQDDALIABBADYCHCAAIAQ2AhQgAEHpi4CAADYCECAAQR82AgxBACEQDEgLIABB2wE2AhwgACAENgIUIABB+paAgAA2AhAgAEEVNgIMQQAhEAxHCyAAQfgANgIcIAAgDDYCFCAAQcqYgIAANgIQIABBFTYCDEEAIRAMRgsgAEHRADYCHCAAIAU2AhQgAEGwl4CAADYCECAAQRU2AgxBACEQDEULIABB+QA2AhwgACABNgIUIAAgEDYCDEEAIRAMRAsgAEH4ADYCHCAAIAE2AhQgAEHKmICAADYCECAAQRU2AgxBACEQDEMLIABB5AA2AhwgACABNgIUIABB45eAgAA2AhAgAEEVNgIMQQAhEAxCCyAAQdcANgIcIAAgATYCFCAAQcmXgIAANgIQIABBFTYCDEEAIRAMQQsgAEEANgIcIAAgATYCFCAAQbmNgIAANgIQIABBGjYCDEEAIRAMQAsgAEHCADYCHCAAIAE2AhQgAEHjmICAADYCECAAQRU2AgxBACEQDD8LIABBADYCBCAAIA8gDxCxgICAACIERQ0BIABBOjYCHCAAIAQ2AgwgACAPQQFqNgIUQQAhEAw+CyAAKAIEIQQgAEEANgIEAkAgACAEIAEQsYCAgAAiBEUNACAAQTs2AhwgACAENgIMIAAgAUEBajYCFEEAIRAMPgsgAUEBaiEBDC0LIA9BAWohAQwtCyAAQQA2AhwgACAPNgIUIABB5JKAgAA2AhAgAEEENgIMQQAhEAw7CyAAQTY2AhwgACAENgIUIAAgAjYCDEEAIRAMOgsgAEEuNgIcIAAgDjYCFCAAIAQ2AgxBACEQDDkLIABB0AA2AhwgACABNgIUIABBkZiAgAA2AhAgAEEVNgIMQQAhEAw4CyANQQFqIQEMLAsgAEEVNgIcIAAgATYCFCAAQYKZgIAANgIQIABBFTYCDEEAIRAMNgsgAEEbNgIcIAAgATYCFCAAQZGXgIAANgIQIABBFTYCDEEAIRAMNQsgAEEPNgIcIAAgATYCFCAAQZGXgIAANgIQIABBFTYCDEEAIRAMNAsgAEELNgIcIAAgATYCFCAAQZGXgIAANgIQIABBFTYCDEEAIRAMMwsgAEEaNgIcIAAgATYCFCAAQYKZgIAANgIQIABBFTYCDEEAIRAMMgsgAEELNgIcIAAgATYCFCAAQYKZgIAANgIQIABBFTYCDEEAIRAMMQsgAEEKNgIcIAAgATYCFCAAQeSWgIAANgIQIABBFTYCDEEAIRAMMAsgAEEeNgIcIAAgATYCFCAAQfmXgIAANgIQIABBFTYCDEEAIRAMLwsgAEEANgIcIAAgEDYCFCAAQdqNgIAANgIQIABBFDYCDEEAIRAMLgsgAEEENgIcIAAgATYCFCAAQbCYgIAANgIQIABBFTYCDEEAIRAMLQsgAEEANgIAIAtBAWohCwtBuAEhEAwSCyAAQQA2AgAgEEEBaiEBQfUAIRAMEQsgASEBAkAgAC0AKUEFRw0AQeMAIRAMEQtB4gAhEAwQC0EAIRAgAEEANgIcIABB5JGAgAA2AhAgAEEHNgIMIAAgFEEBajYCFAwoCyAAQQA2AgAgF0EBaiEBQcAAIRAMDgtBASEBCyAAIAE6ACwgAEEANgIAIBdBAWohAQtBKCEQDAsLIAEhAQtBOCEQDAkLAkAgASIPIAJGDQADQAJAIA8tAABBgL6AgABqLQAAIgFBAUYNACABQQJHDQMgD0EBaiEBDAQLIA9BAWoiDyACRw0AC0E+IRAMIgtBPiEQDCELIABBADoALCAPIQEMAQtBCyEQDAYLQTohEAwFCyABQQFqIQFBLSEQDAQLIAAgAToALCAAQQA2AgAgFkEBaiEBQQwhEAwDCyAAQQA2AgAgF0EBaiEBQQohEAwCCyAAQQA2AgALIABBADoALCANIQFBCSEQDAALC0EAIRAgAEEANgIcIAAgCzYCFCAAQc2QgIAANgIQIABBCTYCDAwXC0EAIRAgAEEANgIcIAAgCjYCFCAAQemKgIAANgIQIABBCTYCDAwWC0EAIRAgAEEANgIcIAAgCTYCFCAAQbeQgIAANgIQIABBCTYCDAwVC0EAIRAgAEEANgIcIAAgCDYCFCAAQZyRgIAANgIQIABBCTYCDAwUC0EAIRAgAEEANgIcIAAgATYCFCAAQc2QgIAANgIQIABBCTYCDAwTC0EAIRAgAEEANgIcIAAgATYCFCAAQemKgIAANgIQIABBCTYCDAwSC0EAIRAgAEEANgIcIAAgATYCFCAAQbeQgIAANgIQIABBCTYCDAwRC0EAIRAgAEEANgIcIAAgATYCFCAAQZyRgIAANgIQIABBCTYCDAwQC0EAIRAgAEEANgIcIAAgATYCFCAAQZeVgIAANgIQIABBDzYCDAwPC0EAIRAgAEEANgIcIAAgATYCFCAAQZeVgIAANgIQIABBDzYCDAwOC0EAIRAgAEEANgIcIAAgATYCFCAAQcCSgIAANgIQIABBCzYCDAwNC0EAIRAgAEEANgIcIAAgATYCFCAAQZWJgIAANgIQIABBCzYCDAwMC0EAIRAgAEEANgIcIAAgATYCFCAAQeGPgIAANgIQIABBCjYCDAwLC0EAIRAgAEEANgIcIAAgATYCFCAAQfuPgIAANgIQIABBCjYCDAwKC0EAIRAgAEEANgIcIAAgATYCFCAAQfGZgIAANgIQIABBAjYCDAwJC0EAIRAgAEEANgIcIAAgATYCFCAAQcSUgIAANgIQIABBAjYCDAwIC0EAIRAgAEEANgIcIAAgATYCFCAAQfKVgIAANgIQIABBAjYCDAwHCyAAQQI2AhwgACABNgIUIABBnJqAgAA2AhAgAEEWNgIMQQAhEAwGC0EBIRAMBQtB1AAhECABIgQgAkYNBCADQQhqIAAgBCACQdjCgIAAQQoQxYCAgAAgAygCDCEEIAMoAggOAwEEAgALEMqAgIAAAAsgAEEANgIcIABBtZqAgAA2AhAgAEEXNgIMIAAgBEEBajYCFEEAIRAMAgsgAEEANgIcIAAgBDYCFCAAQcqagIAANgIQIABBCTYCDEEAIRAMAQsCQCABIgQgAkcNAEEiIRAMAQsgAEGJgICAADYCCCAAIAQ2AgRBISEQCyADQRBqJICAgIAAIBALrwEBAn8gASgCACEGAkACQCACIANGDQAgBCAGaiEEIAYgA2ogAmshByACIAZBf3MgBWoiBmohBQNAAkAgAi0AACAELQAARg0AQQIhBAwDCwJAIAYNAEEAIQQgBSECDAMLIAZBf2ohBiAEQQFqIQQgAkEBaiICIANHDQALIAchBiADIQILIABBATYCACABIAY2AgAgACACNgIEDwsgAUEANgIAIAAgBDYCACAAIAI2AgQLCgAgABDHgICAAAvyNgELfyOAgICAAEEQayIBJICAgIAAAkBBACgCoNCAgAANAEEAEMuAgIAAQYDUhIAAayICQdkASQ0AQQAhAwJAQQAoAuDTgIAAIgQNAEEAQn83AuzTgIAAQQBCgICEgICAwAA3AuTTgIAAQQAgAUEIakFwcUHYqtWqBXMiBDYC4NOAgABBAEEANgL004CAAEEAQQA2AsTTgIAAC0EAIAI2AszTgIAAQQBBgNSEgAA2AsjTgIAAQQBBgNSEgAA2ApjQgIAAQQAgBDYCrNCAgABBAEF/NgKo0ICAAANAIANBxNCAgABqIANBuNCAgABqIgQ2AgAgBCADQbDQgIAAaiIFNgIAIANBvNCAgABqIAU2AgAgA0HM0ICAAGogA0HA0ICAAGoiBTYCACAFIAQ2AgAgA0HU0ICAAGogA0HI0ICAAGoiBDYCACAEIAU2AgAgA0HQ0ICAAGogBDYCACADQSBqIgNBgAJHDQALQYDUhIAAQXhBgNSEgABrQQ9xQQBBgNSEgABBCGpBD3EbIgNqIgRBBGogAkFIaiIFIANrIgNBAXI2AgBBAEEAKALw04CAADYCpNCAgABBACADNgKU0ICAAEEAIAQ2AqDQgIAAQYDUhIAAIAVqQTg2AgQLAkACQAJAAkACQAJAAkACQAJAAkACQAJAIABB7AFLDQACQEEAKAKI0ICAACIGQRAgAEETakFwcSAAQQtJGyICQQN2IgR2IgNBA3FFDQACQAJAIANBAXEgBHJBAXMiBUEDdCIEQbDQgIAAaiIDIARBuNCAgABqKAIAIgQoAggiAkcNAEEAIAZBfiAFd3E2AojQgIAADAELIAMgAjYCCCACIAM2AgwLIARBCGohAyAEIAVBA3QiBUEDcjYCBCAEIAVqIgQgBCgCBEEBcjYCBAwMCyACQQAoApDQgIAAIgdNDQECQCADRQ0AAkACQCADIAR0QQIgBHQiA0EAIANrcnEiA0EAIANrcUF/aiIDIANBDHZBEHEiA3YiBEEFdkEIcSIFIANyIAQgBXYiA0ECdkEEcSIEciADIAR2IgNBAXZBAnEiBHIgAyAEdiIDQQF2QQFxIgRyIAMgBHZqIgRBA3QiA0Gw0ICAAGoiBSADQbjQgIAAaigCACIDKAIIIgBHDQBBACAGQX4gBHdxIgY2AojQgIAADAELIAUgADYCCCAAIAU2AgwLIAMgAkEDcjYCBCADIARBA3QiBGogBCACayIFNgIAIAMgAmoiACAFQQFyNgIEAkAgB0UNACAHQXhxQbDQgIAAaiECQQAoApzQgIAAIQQCQAJAIAZBASAHQQN2dCIIcQ0AQQAgBiAIcjYCiNCAgAAgAiEIDAELIAIoAgghCAsgCCAENgIMIAIgBDYCCCAEIAI2AgwgBCAINgIICyADQQhqIQNBACAANgKc0ICAAEEAIAU2ApDQgIAADAwLQQAoAozQgIAAIglFDQEgCUEAIAlrcUF/aiIDIANBDHZBEHEiA3YiBEEFdkEIcSIFIANyIAQgBXYiA0ECdkEEcSIEciADIAR2IgNBAXZBAnEiBHIgAyAEdiIDQQF2QQFxIgRyIAMgBHZqQQJ0QbjSgIAAaigCACIAKAIEQXhxIAJrIQQgACEFAkADQAJAIAUoAhAiAw0AIAVBFGooAgAiA0UNAgsgAygCBEF4cSACayIFIAQgBSAESSIFGyEEIAMgACAFGyEAIAMhBQwACwsgACgCGCEKAkAgACgCDCIIIABGDQAgACgCCCIDQQAoApjQgIAASRogCCADNgIIIAMgCDYCDAwLCwJAIABBFGoiBSgCACIDDQAgACgCECIDRQ0DIABBEGohBQsDQCAFIQsgAyIIQRRqIgUoAgAiAw0AIAhBEGohBSAIKAIQIgMNAAsgC0EANgIADAoLQX8hAiAAQb9/Sw0AIABBE2oiA0FwcSECQQAoAozQgIAAIgdFDQBBACELAkAgAkGAAkkNAEEfIQsgAkH///8HSw0AIANBCHYiAyADQYD+P2pBEHZBCHEiA3QiBCAEQYDgH2pBEHZBBHEiBHQiBSAFQYCAD2pBEHZBAnEiBXRBD3YgAyAEciAFcmsiA0EBdCACIANBFWp2QQFxckEcaiELC0EAIAJrIQQCQAJAAkACQCALQQJ0QbjSgIAAaigCACIFDQBBACEDQQAhCAwBC0EAIQMgAkEAQRkgC0EBdmsgC0EfRht0IQBBACEIA0ACQCAFKAIEQXhxIAJrIgYgBE8NACAGIQQgBSEIIAYNAEEAIQQgBSEIIAUhAwwDCyADIAVBFGooAgAiBiAGIAUgAEEddkEEcWpBEGooAgAiBUYbIAMgBhshAyAAQQF0IQAgBQ0ACwsCQCADIAhyDQBBACEIQQIgC3QiA0EAIANrciAHcSIDRQ0DIANBACADa3FBf2oiAyADQQx2QRBxIgN2IgVBBXZBCHEiACADciAFIAB2IgNBAnZBBHEiBXIgAyAFdiIDQQF2QQJxIgVyIAMgBXYiA0EBdkEBcSIFciADIAV2akECdEG40oCAAGooAgAhAwsgA0UNAQsDQCADKAIEQXhxIAJrIgYgBEkhAAJAIAMoAhAiBQ0AIANBFGooAgAhBQsgBiAEIAAbIQQgAyAIIAAbIQggBSEDIAUNAAsLIAhFDQAgBEEAKAKQ0ICAACACa08NACAIKAIYIQsCQCAIKAIMIgAgCEYNACAIKAIIIgNBACgCmNCAgABJGiAAIAM2AgggAyAANgIMDAkLAkAgCEEUaiIFKAIAIgMNACAIKAIQIgNFDQMgCEEQaiEFCwNAIAUhBiADIgBBFGoiBSgCACIDDQAgAEEQaiEFIAAoAhAiAw0ACyAGQQA2AgAMCAsCQEEAKAKQ0ICAACIDIAJJDQBBACgCnNCAgAAhBAJAAkAgAyACayIFQRBJDQAgBCACaiIAIAVBAXI2AgRBACAFNgKQ0ICAAEEAIAA2ApzQgIAAIAQgA2ogBTYCACAEIAJBA3I2AgQMAQsgBCADQQNyNgIEIAQgA2oiAyADKAIEQQFyNgIEQQBBADYCnNCAgABBAEEANgKQ0ICAAAsgBEEIaiEDDAoLAkBBACgClNCAgAAiACACTQ0AQQAoAqDQgIAAIgMgAmoiBCAAIAJrIgVBAXI2AgRBACAFNgKU0ICAAEEAIAQ2AqDQgIAAIAMgAkEDcjYCBCADQQhqIQMMCgsCQAJAQQAoAuDTgIAARQ0AQQAoAujTgIAAIQQMAQtBAEJ/NwLs04CAAEEAQoCAhICAgMAANwLk04CAAEEAIAFBDGpBcHFB2KrVqgVzNgLg04CAAEEAQQA2AvTTgIAAQQBBADYCxNOAgABBgIAEIQQLQQAhAwJAIAQgAkHHAGoiB2oiBkEAIARrIgtxIgggAksNAEEAQTA2AvjTgIAADAoLAkBBACgCwNOAgAAiA0UNAAJAQQAoArjTgIAAIgQgCGoiBSAETQ0AIAUgA00NAQtBACEDQQBBMDYC+NOAgAAMCgtBAC0AxNOAgABBBHENBAJAAkACQEEAKAKg0ICAACIERQ0AQcjTgIAAIQMDQAJAIAMoAgAiBSAESw0AIAUgAygCBGogBEsNAwsgAygCCCIDDQALC0EAEMuAgIAAIgBBf0YNBSAIIQYCQEEAKALk04CAACIDQX9qIgQgAHFFDQAgCCAAayAEIABqQQAgA2txaiEGCyAGIAJNDQUgBkH+////B0sNBQJAQQAoAsDTgIAAIgNFDQBBACgCuNOAgAAiBCAGaiIFIARNDQYgBSADSw0GCyAGEMuAgIAAIgMgAEcNAQwHCyAGIABrIAtxIgZB/v///wdLDQQgBhDLgICAACIAIAMoAgAgAygCBGpGDQMgACEDCwJAIANBf0YNACACQcgAaiAGTQ0AAkAgByAGa0EAKALo04CAACIEakEAIARrcSIEQf7///8HTQ0AIAMhAAwHCwJAIAQQy4CAgABBf0YNACAEIAZqIQYgAyEADAcLQQAgBmsQy4CAgAAaDAQLIAMhACADQX9HDQUMAwtBACEIDAcLQQAhAAwFCyAAQX9HDQILQQBBACgCxNOAgABBBHI2AsTTgIAACyAIQf7///8HSw0BIAgQy4CAgAAhAEEAEMuAgIAAIQMgAEF/Rg0BIANBf0YNASAAIANPDQEgAyAAayIGIAJBOGpNDQELQQBBACgCuNOAgAAgBmoiAzYCuNOAgAACQCADQQAoArzTgIAATQ0AQQAgAzYCvNOAgAALAkACQAJAAkBBACgCoNCAgAAiBEUNAEHI04CAACEDA0AgACADKAIAIgUgAygCBCIIakYNAiADKAIIIgMNAAwDCwsCQAJAQQAoApjQgIAAIgNFDQAgACADTw0BC0EAIAA2ApjQgIAAC0EAIQNBACAGNgLM04CAAEEAIAA2AsjTgIAAQQBBfzYCqNCAgABBAEEAKALg04CAADYCrNCAgABBAEEANgLU04CAAANAIANBxNCAgABqIANBuNCAgABqIgQ2AgAgBCADQbDQgIAAaiIFNgIAIANBvNCAgABqIAU2AgAgA0HM0ICAAGogA0HA0ICAAGoiBTYCACAFIAQ2AgAgA0HU0ICAAGogA0HI0ICAAGoiBDYCACAEIAU2AgAgA0HQ0ICAAGogBDYCACADQSBqIgNBgAJHDQALIABBeCAAa0EPcUEAIABBCGpBD3EbIgNqIgQgBkFIaiIFIANrIgNBAXI2AgRBAEEAKALw04CAADYCpNCAgABBACADNgKU0ICAAEEAIAQ2AqDQgIAAIAAgBWpBODYCBAwCCyADLQAMQQhxDQAgBCAFSQ0AIAQgAE8NACAEQXggBGtBD3FBACAEQQhqQQ9xGyIFaiIAQQAoApTQgIAAIAZqIgsgBWsiBUEBcjYCBCADIAggBmo2AgRBAEEAKALw04CAADYCpNCAgABBACAFNgKU0ICAAEEAIAA2AqDQgIAAIAQgC2pBODYCBAwBCwJAIABBACgCmNCAgAAiCE8NAEEAIAA2ApjQgIAAIAAhCAsgACAGaiEFQcjTgIAAIQMCQAJAAkACQAJAAkACQANAIAMoAgAgBUYNASADKAIIIgMNAAwCCwsgAy0ADEEIcUUNAQtByNOAgAAhAwNAAkAgAygCACIFIARLDQAgBSADKAIEaiIFIARLDQMLIAMoAgghAwwACwsgAyAANgIAIAMgAygCBCAGajYCBCAAQXggAGtBD3FBACAAQQhqQQ9xG2oiCyACQQNyNgIEIAVBeCAFa0EPcUEAIAVBCGpBD3EbaiIGIAsgAmoiAmshAwJAIAYgBEcNAEEAIAI2AqDQgIAAQQBBACgClNCAgAAgA2oiAzYClNCAgAAgAiADQQFyNgIEDAMLAkAgBkEAKAKc0ICAAEcNAEEAIAI2ApzQgIAAQQBBACgCkNCAgAAgA2oiAzYCkNCAgAAgAiADQQFyNgIEIAIgA2ogAzYCAAwDCwJAIAYoAgQiBEEDcUEBRw0AIARBeHEhBwJAAkAgBEH/AUsNACAGKAIIIgUgBEEDdiIIQQN0QbDQgIAAaiIARhoCQCAGKAIMIgQgBUcNAEEAQQAoAojQgIAAQX4gCHdxNgKI0ICAAAwCCyAEIABGGiAEIAU2AgggBSAENgIMDAELIAYoAhghCQJAAkAgBigCDCIAIAZGDQAgBigCCCIEIAhJGiAAIAQ2AgggBCAANgIMDAELAkAgBkEUaiIEKAIAIgUNACAGQRBqIgQoAgAiBQ0AQQAhAAwBCwNAIAQhCCAFIgBBFGoiBCgCACIFDQAgAEEQaiEEIAAoAhAiBQ0ACyAIQQA2AgALIAlFDQACQAJAIAYgBigCHCIFQQJ0QbjSgIAAaiIEKAIARw0AIAQgADYCACAADQFBAEEAKAKM0ICAAEF+IAV3cTYCjNCAgAAMAgsgCUEQQRQgCSgCECAGRhtqIAA2AgAgAEUNAQsgACAJNgIYAkAgBigCECIERQ0AIAAgBDYCECAEIAA2AhgLIAYoAhQiBEUNACAAQRRqIAQ2AgAgBCAANgIYCyAHIANqIQMgBiAHaiIGKAIEIQQLIAYgBEF+cTYCBCACIANqIAM2AgAgAiADQQFyNgIEAkAgA0H/AUsNACADQXhxQbDQgIAAaiEEAkACQEEAKAKI0ICAACIFQQEgA0EDdnQiA3ENAEEAIAUgA3I2AojQgIAAIAQhAwwBCyAEKAIIIQMLIAMgAjYCDCAEIAI2AgggAiAENgIMIAIgAzYCCAwDC0EfIQQCQCADQf///wdLDQAgA0EIdiIEIARBgP4/akEQdkEIcSIEdCIFIAVBgOAfakEQdkEEcSIFdCIAIABBgIAPakEQdkECcSIAdEEPdiAEIAVyIAByayIEQQF0IAMgBEEVanZBAXFyQRxqIQQLIAIgBDYCHCACQgA3AhAgBEECdEG40oCAAGohBQJAQQAoAozQgIAAIgBBASAEdCIIcQ0AIAUgAjYCAEEAIAAgCHI2AozQgIAAIAIgBTYCGCACIAI2AgggAiACNgIMDAMLIANBAEEZIARBAXZrIARBH0YbdCEEIAUoAgAhAANAIAAiBSgCBEF4cSADRg0CIARBHXYhACAEQQF0IQQgBSAAQQRxakEQaiIIKAIAIgANAAsgCCACNgIAIAIgBTYCGCACIAI2AgwgAiACNgIIDAILIABBeCAAa0EPcUEAIABBCGpBD3EbIgNqIgsgBkFIaiIIIANrIgNBAXI2AgQgACAIakE4NgIEIAQgBUE3IAVrQQ9xQQAgBUFJakEPcRtqQUFqIgggCCAEQRBqSRsiCEEjNgIEQQBBACgC8NOAgAA2AqTQgIAAQQAgAzYClNCAgABBACALNgKg0ICAACAIQRBqQQApAtDTgIAANwIAIAhBACkCyNOAgAA3AghBACAIQQhqNgLQ04CAAEEAIAY2AszTgIAAQQAgADYCyNOAgABBAEEANgLU04CAACAIQSRqIQMDQCADQQc2AgAgA0EEaiIDIAVJDQALIAggBEYNAyAIIAgoAgRBfnE2AgQgCCAIIARrIgA2AgAgBCAAQQFyNgIEAkAgAEH/AUsNACAAQXhxQbDQgIAAaiEDAkACQEEAKAKI0ICAACIFQQEgAEEDdnQiAHENAEEAIAUgAHI2AojQgIAAIAMhBQwBCyADKAIIIQULIAUgBDYCDCADIAQ2AgggBCADNgIMIAQgBTYCCAwEC0EfIQMCQCAAQf///wdLDQAgAEEIdiIDIANBgP4/akEQdkEIcSIDdCIFIAVBgOAfakEQdkEEcSIFdCIIIAhBgIAPakEQdkECcSIIdEEPdiADIAVyIAhyayIDQQF0IAAgA0EVanZBAXFyQRxqIQMLIAQgAzYCHCAEQgA3AhAgA0ECdEG40oCAAGohBQJAQQAoAozQgIAAIghBASADdCIGcQ0AIAUgBDYCAEEAIAggBnI2AozQgIAAIAQgBTYCGCAEIAQ2AgggBCAENgIMDAQLIABBAEEZIANBAXZrIANBH0YbdCEDIAUoAgAhCANAIAgiBSgCBEF4cSAARg0DIANBHXYhCCADQQF0IQMgBSAIQQRxakEQaiIGKAIAIggNAAsgBiAENgIAIAQgBTYCGCAEIAQ2AgwgBCAENgIIDAMLIAUoAggiAyACNgIMIAUgAjYCCCACQQA2AhggAiAFNgIMIAIgAzYCCAsgC0EIaiEDDAULIAUoAggiAyAENgIMIAUgBDYCCCAEQQA2AhggBCAFNgIMIAQgAzYCCAtBACgClNCAgAAiAyACTQ0AQQAoAqDQgIAAIgQgAmoiBSADIAJrIgNBAXI2AgRBACADNgKU0ICAAEEAIAU2AqDQgIAAIAQgAkEDcjYCBCAEQQhqIQMMAwtBACEDQQBBMDYC+NOAgAAMAgsCQCALRQ0AAkACQCAIIAgoAhwiBUECdEG40oCAAGoiAygCAEcNACADIAA2AgAgAA0BQQAgB0F+IAV3cSIHNgKM0ICAAAwCCyALQRBBFCALKAIQIAhGG2ogADYCACAARQ0BCyAAIAs2AhgCQCAIKAIQIgNFDQAgACADNgIQIAMgADYCGAsgCEEUaigCACIDRQ0AIABBFGogAzYCACADIAA2AhgLAkACQCAEQQ9LDQAgCCAEIAJqIgNBA3I2AgQgCCADaiIDIAMoAgRBAXI2AgQMAQsgCCACaiIAIARBAXI2AgQgCCACQQNyNgIEIAAgBGogBDYCAAJAIARB/wFLDQAgBEF4cUGw0ICAAGohAwJAAkBBACgCiNCAgAAiBUEBIARBA3Z0IgRxDQBBACAFIARyNgKI0ICAACADIQQMAQsgAygCCCEECyAEIAA2AgwgAyAANgIIIAAgAzYCDCAAIAQ2AggMAQtBHyEDAkAgBEH///8HSw0AIARBCHYiAyADQYD+P2pBEHZBCHEiA3QiBSAFQYDgH2pBEHZBBHEiBXQiAiACQYCAD2pBEHZBAnEiAnRBD3YgAyAFciACcmsiA0EBdCAEIANBFWp2QQFxckEcaiEDCyAAIAM2AhwgAEIANwIQIANBAnRBuNKAgABqIQUCQCAHQQEgA3QiAnENACAFIAA2AgBBACAHIAJyNgKM0ICAACAAIAU2AhggACAANgIIIAAgADYCDAwBCyAEQQBBGSADQQF2ayADQR9GG3QhAyAFKAIAIQICQANAIAIiBSgCBEF4cSAERg0BIANBHXYhAiADQQF0IQMgBSACQQRxakEQaiIGKAIAIgINAAsgBiAANgIAIAAgBTYCGCAAIAA2AgwgACAANgIIDAELIAUoAggiAyAANgIMIAUgADYCCCAAQQA2AhggACAFNgIMIAAgAzYCCAsgCEEIaiEDDAELAkAgCkUNAAJAAkAgACAAKAIcIgVBAnRBuNKAgABqIgMoAgBHDQAgAyAINgIAIAgNAUEAIAlBfiAFd3E2AozQgIAADAILIApBEEEUIAooAhAgAEYbaiAINgIAIAhFDQELIAggCjYCGAJAIAAoAhAiA0UNACAIIAM2AhAgAyAINgIYCyAAQRRqKAIAIgNFDQAgCEEUaiADNgIAIAMgCDYCGAsCQAJAIARBD0sNACAAIAQgAmoiA0EDcjYCBCAAIANqIgMgAygCBEEBcjYCBAwBCyAAIAJqIgUgBEEBcjYCBCAAIAJBA3I2AgQgBSAEaiAENgIAAkAgB0UNACAHQXhxQbDQgIAAaiECQQAoApzQgIAAIQMCQAJAQQEgB0EDdnQiCCAGcQ0AQQAgCCAGcjYCiNCAgAAgAiEIDAELIAIoAgghCAsgCCADNgIMIAIgAzYCCCADIAI2AgwgAyAINgIIC0EAIAU2ApzQgIAAQQAgBDYCkNCAgAALIABBCGohAwsgAUEQaiSAgICAACADCwoAIAAQyYCAgAAL4g0BB38CQCAARQ0AIABBeGoiASAAQXxqKAIAIgJBeHEiAGohAwJAIAJBAXENACACQQNxRQ0BIAEgASgCACICayIBQQAoApjQgIAAIgRJDQEgAiAAaiEAAkAgAUEAKAKc0ICAAEYNAAJAIAJB/wFLDQAgASgCCCIEIAJBA3YiBUEDdEGw0ICAAGoiBkYaAkAgASgCDCICIARHDQBBAEEAKAKI0ICAAEF+IAV3cTYCiNCAgAAMAwsgAiAGRhogAiAENgIIIAQgAjYCDAwCCyABKAIYIQcCQAJAIAEoAgwiBiABRg0AIAEoAggiAiAESRogBiACNgIIIAIgBjYCDAwBCwJAIAFBFGoiAigCACIEDQAgAUEQaiICKAIAIgQNAEEAIQYMAQsDQCACIQUgBCIGQRRqIgIoAgAiBA0AIAZBEGohAiAGKAIQIgQNAAsgBUEANgIACyAHRQ0BAkACQCABIAEoAhwiBEECdEG40oCAAGoiAigCAEcNACACIAY2AgAgBg0BQQBBACgCjNCAgABBfiAEd3E2AozQgIAADAMLIAdBEEEUIAcoAhAgAUYbaiAGNgIAIAZFDQILIAYgBzYCGAJAIAEoAhAiAkUNACAGIAI2AhAgAiAGNgIYCyABKAIUIgJFDQEgBkEUaiACNgIAIAIgBjYCGAwBCyADKAIEIgJBA3FBA0cNACADIAJBfnE2AgRBACAANgKQ0ICAACABIABqIAA2AgAgASAAQQFyNgIEDwsgASADTw0AIAMoAgQiAkEBcUUNAAJAAkAgAkECcQ0AAkAgA0EAKAKg0ICAAEcNAEEAIAE2AqDQgIAAQQBBACgClNCAgAAgAGoiADYClNCAgAAgASAAQQFyNgIEIAFBACgCnNCAgABHDQNBAEEANgKQ0ICAAEEAQQA2ApzQgIAADwsCQCADQQAoApzQgIAARw0AQQAgATYCnNCAgABBAEEAKAKQ0ICAACAAaiIANgKQ0ICAACABIABBAXI2AgQgASAAaiAANgIADwsgAkF4cSAAaiEAAkACQCACQf8BSw0AIAMoAggiBCACQQN2IgVBA3RBsNCAgABqIgZGGgJAIAMoAgwiAiAERw0AQQBBACgCiNCAgABBfiAFd3E2AojQgIAADAILIAIgBkYaIAIgBDYCCCAEIAI2AgwMAQsgAygCGCEHAkACQCADKAIMIgYgA0YNACADKAIIIgJBACgCmNCAgABJGiAGIAI2AgggAiAGNgIMDAELAkAgA0EUaiICKAIAIgQNACADQRBqIgIoAgAiBA0AQQAhBgwBCwNAIAIhBSAEIgZBFGoiAigCACIEDQAgBkEQaiECIAYoAhAiBA0ACyAFQQA2AgALIAdFDQACQAJAIAMgAygCHCIEQQJ0QbjSgIAAaiICKAIARw0AIAIgBjYCACAGDQFBAEEAKAKM0ICAAEF+IAR3cTYCjNCAgAAMAgsgB0EQQRQgBygCECADRhtqIAY2AgAgBkUNAQsgBiAHNgIYAkAgAygCECICRQ0AIAYgAjYCECACIAY2AhgLIAMoAhQiAkUNACAGQRRqIAI2AgAgAiAGNgIYCyABIABqIAA2AgAgASAAQQFyNgIEIAFBACgCnNCAgABHDQFBACAANgKQ0ICAAA8LIAMgAkF+cTYCBCABIABqIAA2AgAgASAAQQFyNgIECwJAIABB/wFLDQAgAEF4cUGw0ICAAGohAgJAAkBBACgCiNCAgAAiBEEBIABBA3Z0IgBxDQBBACAEIAByNgKI0ICAACACIQAMAQsgAigCCCEACyAAIAE2AgwgAiABNgIIIAEgAjYCDCABIAA2AggPC0EfIQICQCAAQf///wdLDQAgAEEIdiICIAJBgP4/akEQdkEIcSICdCIEIARBgOAfakEQdkEEcSIEdCIGIAZBgIAPakEQdkECcSIGdEEPdiACIARyIAZyayICQQF0IAAgAkEVanZBAXFyQRxqIQILIAEgAjYCHCABQgA3AhAgAkECdEG40oCAAGohBAJAAkBBACgCjNCAgAAiBkEBIAJ0IgNxDQAgBCABNgIAQQAgBiADcjYCjNCAgAAgASAENgIYIAEgATYCCCABIAE2AgwMAQsgAEEAQRkgAkEBdmsgAkEfRht0IQIgBCgCACEGAkADQCAGIgQoAgRBeHEgAEYNASACQR12IQYgAkEBdCECIAQgBkEEcWpBEGoiAygCACIGDQALIAMgATYCACABIAQ2AhggASABNgIMIAEgATYCCAwBCyAEKAIIIgAgATYCDCAEIAE2AgggAUEANgIYIAEgBDYCDCABIAA2AggLQQBBACgCqNCAgABBf2oiAUF/IAEbNgKo0ICAAAsLBAAAAAtOAAJAIAANAD8AQRB0DwsCQCAAQf//A3ENACAAQX9MDQACQCAAQRB2QAAiAEF/Rw0AQQBBMDYC+NOAgABBfw8LIABBEHQPCxDKgICAAAAL8gICA38BfgJAIAJFDQAgACABOgAAIAIgAGoiA0F/aiABOgAAIAJBA0kNACAAIAE6AAIgACABOgABIANBfWogAToAACADQX5qIAE6AAAgAkEHSQ0AIAAgAToAAyADQXxqIAE6AAAgAkEJSQ0AIABBACAAa0EDcSIEaiIDIAFB/wFxQYGChAhsIgE2AgAgAyACIARrQXxxIgRqIgJBfGogATYCACAEQQlJDQAgAyABNgIIIAMgATYCBCACQXhqIAE2AgAgAkF0aiABNgIAIARBGUkNACADIAE2AhggAyABNgIUIAMgATYCECADIAE2AgwgAkFwaiABNgIAIAJBbGogATYCACACQWhqIAE2AgAgAkFkaiABNgIAIAQgA0EEcUEYciIFayICQSBJDQAgAa1CgYCAgBB+IQYgAyAFaiEBA0AgASAGNwMYIAEgBjcDECABIAY3AwggASAGNwMAIAFBIGohASACQWBqIgJBH0sNAAsLIAALC45IAQBBgAgLhkgBAAAAAgAAAAMAAAAAAAAAAAAAAAQAAAAFAAAAAAAAAAAAAAAGAAAABwAAAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEludmFsaWQgY2hhciBpbiB1cmwgcXVlcnkAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9ib2R5AENvbnRlbnQtTGVuZ3RoIG92ZXJmbG93AENodW5rIHNpemUgb3ZlcmZsb3cAUmVzcG9uc2Ugb3ZlcmZsb3cASW52YWxpZCBtZXRob2QgZm9yIEhUVFAveC54IHJlcXVlc3QASW52YWxpZCBtZXRob2QgZm9yIFJUU1AveC54IHJlcXVlc3QARXhwZWN0ZWQgU09VUkNFIG1ldGhvZCBmb3IgSUNFL3gueCByZXF1ZXN0AEludmFsaWQgY2hhciBpbiB1cmwgZnJhZ21lbnQgc3RhcnQARXhwZWN0ZWQgZG90AFNwYW4gY2FsbGJhY2sgZXJyb3IgaW4gb25fc3RhdHVzAEludmFsaWQgcmVzcG9uc2Ugc3RhdHVzAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMAVXNlciBjYWxsYmFjayBlcnJvcgBgb25fcmVzZXRgIGNhbGxiYWNrIGVycm9yAGBvbl9jaHVua19oZWFkZXJgIGNhbGxiYWNrIGVycm9yAGBvbl9tZXNzYWdlX2JlZ2luYCBjYWxsYmFjayBlcnJvcgBgb25fY2h1bmtfZXh0ZW5zaW9uX3ZhbHVlYCBjYWxsYmFjayBlcnJvcgBgb25fc3RhdHVzX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fdmVyc2lvbl9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX3VybF9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX2NodW5rX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25faGVhZGVyX3ZhbHVlX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fbWVzc2FnZV9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX21ldGhvZF9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX2hlYWRlcl9maWVsZF9jb21wbGV0ZWAgY2FsbGJhY2sgZXJyb3IAYG9uX2NodW5rX2V4dGVuc2lvbl9uYW1lYCBjYWxsYmFjayBlcnJvcgBVbmV4cGVjdGVkIGNoYXIgaW4gdXJsIHNlcnZlcgBJbnZhbGlkIGhlYWRlciB2YWx1ZSBjaGFyAEludmFsaWQgaGVhZGVyIGZpZWxkIGNoYXIAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl92ZXJzaW9uAEludmFsaWQgbWlub3IgdmVyc2lvbgBJbnZhbGlkIG1ham9yIHZlcnNpb24ARXhwZWN0ZWQgc3BhY2UgYWZ0ZXIgdmVyc2lvbgBFeHBlY3RlZCBDUkxGIGFmdGVyIHZlcnNpb24ASW52YWxpZCBIVFRQIHZlcnNpb24ASW52YWxpZCBoZWFkZXIgdG9rZW4AU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl91cmwASW52YWxpZCBjaGFyYWN0ZXJzIGluIHVybABVbmV4cGVjdGVkIHN0YXJ0IGNoYXIgaW4gdXJsAERvdWJsZSBAIGluIHVybABFbXB0eSBDb250ZW50LUxlbmd0aABJbnZhbGlkIGNoYXJhY3RlciBpbiBDb250ZW50LUxlbmd0aABEdXBsaWNhdGUgQ29udGVudC1MZW5ndGgASW52YWxpZCBjaGFyIGluIHVybCBwYXRoAENvbnRlbnQtTGVuZ3RoIGNhbid0IGJlIHByZXNlbnQgd2l0aCBUcmFuc2Zlci1FbmNvZGluZwBJbnZhbGlkIGNoYXJhY3RlciBpbiBjaHVuayBzaXplAFNwYW4gY2FsbGJhY2sgZXJyb3IgaW4gb25faGVhZGVyX3ZhbHVlAFNwYW4gY2FsbGJhY2sgZXJyb3IgaW4gb25fY2h1bmtfZXh0ZW5zaW9uX3ZhbHVlAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMgdmFsdWUATWlzc2luZyBleHBlY3RlZCBMRiBhZnRlciBoZWFkZXIgdmFsdWUASW52YWxpZCBgVHJhbnNmZXItRW5jb2RpbmdgIGhlYWRlciB2YWx1ZQBJbnZhbGlkIGNoYXJhY3RlciBpbiBjaHVuayBleHRlbnNpb25zIHF1b3RlIHZhbHVlAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMgcXVvdGVkIHZhbHVlAFBhdXNlZCBieSBvbl9oZWFkZXJzX2NvbXBsZXRlAEludmFsaWQgRU9GIHN0YXRlAG9uX3Jlc2V0IHBhdXNlAG9uX2NodW5rX2hlYWRlciBwYXVzZQBvbl9tZXNzYWdlX2JlZ2luIHBhdXNlAG9uX2NodW5rX2V4dGVuc2lvbl92YWx1ZSBwYXVzZQBvbl9zdGF0dXNfY29tcGxldGUgcGF1c2UAb25fdmVyc2lvbl9jb21wbGV0ZSBwYXVzZQBvbl91cmxfY29tcGxldGUgcGF1c2UAb25fY2h1bmtfY29tcGxldGUgcGF1c2UAb25faGVhZGVyX3ZhbHVlX2NvbXBsZXRlIHBhdXNlAG9uX21lc3NhZ2VfY29tcGxldGUgcGF1c2UAb25fbWV0aG9kX2NvbXBsZXRlIHBhdXNlAG9uX2hlYWRlcl9maWVsZF9jb21wbGV0ZSBwYXVzZQBvbl9jaHVua19leHRlbnNpb25fbmFtZSBwYXVzZQBVbmV4cGVjdGVkIHNwYWNlIGFmdGVyIHN0YXJ0IGxpbmUAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9jaHVua19leHRlbnNpb25fbmFtZQBJbnZhbGlkIGNoYXJhY3RlciBpbiBjaHVuayBleHRlbnNpb25zIG5hbWUAUGF1c2Ugb24gQ09OTkVDVC9VcGdyYWRlAFBhdXNlIG9uIFBSSS9VcGdyYWRlAEV4cGVjdGVkIEhUVFAvMiBDb25uZWN0aW9uIFByZWZhY2UAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9tZXRob2QARXhwZWN0ZWQgc3BhY2UgYWZ0ZXIgbWV0aG9kAFNwYW4gY2FsbGJhY2sgZXJyb3IgaW4gb25faGVhZGVyX2ZpZWxkAFBhdXNlZABJbnZhbGlkIHdvcmQgZW5jb3VudGVyZWQASW52YWxpZCBtZXRob2QgZW5jb3VudGVyZWQAVW5leHBlY3RlZCBjaGFyIGluIHVybCBzY2hlbWEAUmVxdWVzdCBoYXMgaW52YWxpZCBgVHJhbnNmZXItRW5jb2RpbmdgAFNXSVRDSF9QUk9YWQBVU0VfUFJPWFkATUtBQ1RJVklUWQBVTlBST0NFU1NBQkxFX0VOVElUWQBDT1BZAE1PVkVEX1BFUk1BTkVOVExZAFRPT19FQVJMWQBOT1RJRlkARkFJTEVEX0RFUEVOREVOQ1kAQkFEX0dBVEVXQVkAUExBWQBQVVQAQ0hFQ0tPVVQAR0FURVdBWV9USU1FT1VUAFJFUVVFU1RfVElNRU9VVABORVRXT1JLX0NPTk5FQ1RfVElNRU9VVABDT05ORUNUSU9OX1RJTUVPVVQATE9HSU5fVElNRU9VVABORVRXT1JLX1JFQURfVElNRU9VVABQT1NUAE1JU0RJUkVDVEVEX1JFUVVFU1QAQ0xJRU5UX0NMT1NFRF9SRVFVRVNUAENMSUVOVF9DTE9TRURfTE9BRF9CQUxBTkNFRF9SRVFVRVNUAEJBRF9SRVFVRVNUAEhUVFBfUkVRVUVTVF9TRU5UX1RPX0hUVFBTX1BPUlQAUkVQT1JUAElNX0FfVEVBUE9UAFJFU0VUX0NPTlRFTlQATk9fQ09OVEVOVABQQVJUSUFMX0NPTlRFTlQASFBFX0lOVkFMSURfQ09OU1RBTlQASFBFX0NCX1JFU0VUAEdFVABIUEVfU1RSSUNUAENPTkZMSUNUAFRFTVBPUkFSWV9SRURJUkVDVABQRVJNQU5FTlRfUkVESVJFQ1QAQ09OTkVDVABNVUxUSV9TVEFUVVMASFBFX0lOVkFMSURfU1RBVFVTAFRPT19NQU5ZX1JFUVVFU1RTAEVBUkxZX0hJTlRTAFVOQVZBSUxBQkxFX0ZPUl9MRUdBTF9SRUFTT05TAE9QVElPTlMAU1dJVENISU5HX1BST1RPQ09MUwBWQVJJQU5UX0FMU09fTkVHT1RJQVRFUwBNVUxUSVBMRV9DSE9JQ0VTAElOVEVSTkFMX1NFUlZFUl9FUlJPUgBXRUJfU0VSVkVSX1VOS05PV05fRVJST1IAUkFJTEdVTl9FUlJPUgBJREVOVElUWV9QUk9WSURFUl9BVVRIRU5USUNBVElPTl9FUlJPUgBTU0xfQ0VSVElGSUNBVEVfRVJST1IASU5WQUxJRF9YX0ZPUldBUkRFRF9GT1IAU0VUX1BBUkFNRVRFUgBHRVRfUEFSQU1FVEVSAEhQRV9VU0VSAFNFRV9PVEhFUgBIUEVfQ0JfQ0hVTktfSEVBREVSAE1LQ0FMRU5EQVIAU0VUVVAAV0VCX1NFUlZFUl9JU19ET1dOAFRFQVJET1dOAEhQRV9DTE9TRURfQ09OTkVDVElPTgBIRVVSSVNUSUNfRVhQSVJBVElPTgBESVNDT05ORUNURURfT1BFUkFUSU9OAE5PTl9BVVRIT1JJVEFUSVZFX0lORk9STUFUSU9OAEhQRV9JTlZBTElEX1ZFUlNJT04ASFBFX0NCX01FU1NBR0VfQkVHSU4AU0lURV9JU19GUk9aRU4ASFBFX0lOVkFMSURfSEVBREVSX1RPS0VOAElOVkFMSURfVE9LRU4ARk9SQklEREVOAEVOSEFOQ0VfWU9VUl9DQUxNAEhQRV9JTlZBTElEX1VSTABCTE9DS0VEX0JZX1BBUkVOVEFMX0NPTlRST0wATUtDT0wAQUNMAEhQRV9JTlRFUk5BTABSRVFVRVNUX0hFQURFUl9GSUVMRFNfVE9PX0xBUkdFX1VOT0ZGSUNJQUwASFBFX09LAFVOTElOSwBVTkxPQ0sAUFJJAFJFVFJZX1dJVEgASFBFX0lOVkFMSURfQ09OVEVOVF9MRU5HVEgASFBFX1VORVhQRUNURURfQ09OVEVOVF9MRU5HVEgARkxVU0gAUFJPUFBBVENIAE0tU0VBUkNIAFVSSV9UT09fTE9ORwBQUk9DRVNTSU5HAE1JU0NFTExBTkVPVVNfUEVSU0lTVEVOVF9XQVJOSU5HAE1JU0NFTExBTkVPVVNfV0FSTklORwBIUEVfSU5WQUxJRF9UUkFOU0ZFUl9FTkNPRElORwBFeHBlY3RlZCBDUkxGAEhQRV9JTlZBTElEX0NIVU5LX1NJWkUATU9WRQBDT05USU5VRQBIUEVfQ0JfU1RBVFVTX0NPTVBMRVRFAEhQRV9DQl9IRUFERVJTX0NPTVBMRVRFAEhQRV9DQl9WRVJTSU9OX0NPTVBMRVRFAEhQRV9DQl9VUkxfQ09NUExFVEUASFBFX0NCX0NIVU5LX0NPTVBMRVRFAEhQRV9DQl9IRUFERVJfVkFMVUVfQ09NUExFVEUASFBFX0NCX0NIVU5LX0VYVEVOU0lPTl9WQUxVRV9DT01QTEVURQBIUEVfQ0JfQ0hVTktfRVhURU5TSU9OX05BTUVfQ09NUExFVEUASFBFX0NCX01FU1NBR0VfQ09NUExFVEUASFBFX0NCX01FVEhPRF9DT01QTEVURQBIUEVfQ0JfSEVBREVSX0ZJRUxEX0NPTVBMRVRFAERFTEVURQBIUEVfSU5WQUxJRF9FT0ZfU1RBVEUASU5WQUxJRF9TU0xfQ0VSVElGSUNBVEUAUEFVU0UATk9fUkVTUE9OU0UAVU5TVVBQT1JURURfTUVESUFfVFlQRQBHT05FAE5PVF9BQ0NFUFRBQkxFAFNFUlZJQ0VfVU5BVkFJTEFCTEUAUkFOR0VfTk9UX1NBVElTRklBQkxFAE9SSUdJTl9JU19VTlJFQUNIQUJMRQBSRVNQT05TRV9JU19TVEFMRQBQVVJHRQBNRVJHRQBSRVFVRVNUX0hFQURFUl9GSUVMRFNfVE9PX0xBUkdFAFJFUVVFU1RfSEVBREVSX1RPT19MQVJHRQBQQVlMT0FEX1RPT19MQVJHRQBJTlNVRkZJQ0lFTlRfU1RPUkFHRQBIUEVfUEFVU0VEX1VQR1JBREUASFBFX1BBVVNFRF9IMl9VUEdSQURFAFNPVVJDRQBBTk5PVU5DRQBUUkFDRQBIUEVfVU5FWFBFQ1RFRF9TUEFDRQBERVNDUklCRQBVTlNVQlNDUklCRQBSRUNPUkQASFBFX0lOVkFMSURfTUVUSE9EAE5PVF9GT1VORABQUk9QRklORABVTkJJTkQAUkVCSU5EAFVOQVVUSE9SSVpFRABNRVRIT0RfTk9UX0FMTE9XRUQASFRUUF9WRVJTSU9OX05PVF9TVVBQT1JURUQAQUxSRUFEWV9SRVBPUlRFRABBQ0NFUFRFRABOT1RfSU1QTEVNRU5URUQATE9PUF9ERVRFQ1RFRABIUEVfQ1JfRVhQRUNURUQASFBFX0xGX0VYUEVDVEVEAENSRUFURUQASU1fVVNFRABIUEVfUEFVU0VEAFRJTUVPVVRfT0NDVVJFRABQQVlNRU5UX1JFUVVJUkVEAFBSRUNPTkRJVElPTl9SRVFVSVJFRABQUk9YWV9BVVRIRU5USUNBVElPTl9SRVFVSVJFRABORVRXT1JLX0FVVEhFTlRJQ0FUSU9OX1JFUVVJUkVEAExFTkdUSF9SRVFVSVJFRABTU0xfQ0VSVElGSUNBVEVfUkVRVUlSRUQAVVBHUkFERV9SRVFVSVJFRABQQUdFX0VYUElSRUQAUFJFQ09ORElUSU9OX0ZBSUxFRABFWFBFQ1RBVElPTl9GQUlMRUQAUkVWQUxJREFUSU9OX0ZBSUxFRABTU0xfSEFORFNIQUtFX0ZBSUxFRABMT0NLRUQAVFJBTlNGT1JNQVRJT05fQVBQTElFRABOT1RfTU9ESUZJRUQATk9UX0VYVEVOREVEAEJBTkRXSURUSF9MSU1JVF9FWENFRURFRABTSVRFX0lTX09WRVJMT0FERUQASEVBRABFeHBlY3RlZCBIVFRQLwAAXhMAACYTAAAwEAAA8BcAAJ0TAAAVEgAAORcAAPASAAAKEAAAdRIAAK0SAACCEwAATxQAAH8QAACgFQAAIxQAAIkSAACLFAAATRUAANQRAADPFAAAEBgAAMkWAADcFgAAwREAAOAXAAC7FAAAdBQAAHwVAADlFAAACBcAAB8QAABlFQAAoxQAACgVAAACFQAAmRUAACwQAACLGQAATw8AANQOAABqEAAAzhAAAAIXAACJDgAAbhMAABwTAABmFAAAVhcAAMETAADNEwAAbBMAAGgXAABmFwAAXxcAACITAADODwAAaQ4AANgOAABjFgAAyxMAAKoOAAAoFwAAJhcAAMUTAABdFgAA6BEAAGcTAABlEwAA8hYAAHMTAAAdFwAA+RYAAPMRAADPDgAAzhUAAAwSAACzEQAApREAAGEQAAAyFwAAuxMAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQIBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAIDAgICAgIAAAICAAICAAICAgICAgICAgIABAAAAAAAAgICAgICAgICAgICAgICAgICAgICAgICAgIAAAACAgICAgICAgICAgICAgICAgICAgICAgICAgICAgACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAACAAICAgICAAACAgACAgACAgICAgICAgICAAMABAAAAAICAgICAgICAgICAgICAgICAgICAgICAgICAAAAAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIAAgACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbG9zZWVlcC1hbGl2ZQAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEBAQEBAQEBAQEBAQIBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBY2h1bmtlZAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQEAAQEBAQEAAAEBAAEBAAEBAQEBAQEBAQEAAAAAAAAAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABlY3Rpb25lbnQtbGVuZ3Rob25yb3h5LWNvbm5lY3Rpb24AAAAAAAAAAAAAAAAAAAByYW5zZmVyLWVuY29kaW5ncGdyYWRlDQoNCg0KU00NCg0KVFRQL0NFL1RTUC8AAAAAAAAAAAAAAAABAgABAwAAAAAAAAAAAAAAAAAAAAAAAAQBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAAAAAAAAAQIAAQMAAAAAAAAAAAAAAAAAAAAAAAAEAQEFAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAAAAAAAAAEAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAAAAAAAAAAAAAQAAAgAAAAAAAAAAAAAAAAAAAAAAAAMEAAAEBAQEBAQEBAQEBAUEBAQEBAQEBAQEBAQABAAGBwQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEAAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAEAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAAAAAAADAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwAAAAAAAAMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAABAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAIAAAAAAgAAAAAAAAAAAAAAAAAAAAAAAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMAAAAAAAADAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABOT1VOQ0VFQ0tPVVRORUNURVRFQ1JJQkVMVVNIRVRFQURTRUFSQ0hSR0VDVElWSVRZTEVOREFSVkVPVElGWVBUSU9OU0NIU0VBWVNUQVRDSEdFT1JESVJFQ1RPUlRSQ0hQQVJBTUVURVJVUkNFQlNDUklCRUFSRE9XTkFDRUlORE5LQ0tVQlNDUklCRUhUVFAvQURUUC8=";
-  }
-});
-
-// lib/llhttp/llhttp_simd-wasm.js
-var require_llhttp_simd_wasm = __commonJS({
-  "lib/llhttp/llhttp_simd-wasm.js"(exports2, module2) {
-    module2.exports = "AGFzbQEAAAABMAhgAX8Bf2ADf39/AX9gBH9/f38Bf2AAAGADf39/AGABfwBgAn9/AGAGf39/f39/AALLAQgDZW52GHdhc21fb25faGVhZGVyc19jb21wbGV0ZQACA2VudhV3YXNtX29uX21lc3NhZ2VfYmVnaW4AAANlbnYLd2FzbV9vbl91cmwAAQNlbnYOd2FzbV9vbl9zdGF0dXMAAQNlbnYUd2FzbV9vbl9oZWFkZXJfZmllbGQAAQNlbnYUd2FzbV9vbl9oZWFkZXJfdmFsdWUAAQNlbnYMd2FzbV9vbl9ib2R5AAEDZW52GHdhc21fb25fbWVzc2FnZV9jb21wbGV0ZQAAA0ZFAwMEAAAFAAAAAAAABQEFAAUFBQAABgAAAAAGBgYGAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAAABAQcAAAUFAwABBAUBcAESEgUDAQACBggBfwFBgNQECwfRBSIGbWVtb3J5AgALX2luaXRpYWxpemUACRlfX2luZGlyZWN0X2Z1bmN0aW9uX3RhYmxlAQALbGxodHRwX2luaXQAChhsbGh0dHBfc2hvdWxkX2tlZXBfYWxpdmUAQQxsbGh0dHBfYWxsb2MADAZtYWxsb2MARgtsbGh0dHBfZnJlZQANBGZyZWUASA9sbGh0dHBfZ2V0X3R5cGUADhVsbGh0dHBfZ2V0X2h0dHBfbWFqb3IADxVsbGh0dHBfZ2V0X2h0dHBfbWlub3IAEBFsbGh0dHBfZ2V0X21ldGhvZAARFmxsaHR0cF9nZXRfc3RhdHVzX2NvZGUAEhJsbGh0dHBfZ2V0X3VwZ3JhZGUAEwxsbGh0dHBfcmVzZXQAFA5sbGh0dHBfZXhlY3V0ZQAVFGxsaHR0cF9zZXR0aW5nc19pbml0ABYNbGxodHRwX2ZpbmlzaAAXDGxsaHR0cF9wYXVzZQAYDWxsaHR0cF9yZXN1bWUAGRtsbGh0dHBfcmVzdW1lX2FmdGVyX3VwZ3JhZGUAGhBsbGh0dHBfZ2V0X2Vycm5vABsXbGxodHRwX2dldF9lcnJvcl9yZWFzb24AHBdsbGh0dHBfc2V0X2Vycm9yX3JlYXNvbgAdFGxsaHR0cF9nZXRfZXJyb3JfcG9zAB4RbGxodHRwX2Vycm5vX25hbWUAHxJsbGh0dHBfbWV0aG9kX25hbWUAIBJsbGh0dHBfc3RhdHVzX25hbWUAIRpsbGh0dHBfc2V0X2xlbmllbnRfaGVhZGVycwAiIWxsaHR0cF9zZXRfbGVuaWVudF9jaHVua2VkX2xlbmd0aAAjHWxsaHR0cF9zZXRfbGVuaWVudF9rZWVwX2FsaXZlACQkbGxodHRwX3NldF9sZW5pZW50X3RyYW5zZmVyX2VuY29kaW5nACUYbGxodHRwX21lc3NhZ2VfbmVlZHNfZW9mAD8JFwEAQQELEQECAwQFCwYHNTk3MS8tJyspCrLgAkUCAAsIABCIgICAAAsZACAAEMKAgIAAGiAAIAI2AjggACABOgAoCxwAIAAgAC8BMiAALQAuIAAQwYCAgAAQgICAgAALKgEBf0HAABDGgICAACIBEMKAgIAAGiABQYCIgIAANgI4IAEgADoAKCABCwoAIAAQyICAgAALBwAgAC0AKAsHACAALQAqCwcAIAAtACsLBwAgAC0AKQsHACAALwEyCwcAIAAtAC4LRQEEfyAAKAIYIQEgAC0ALSECIAAtACghAyAAKAI4IQQgABDCgICAABogACAENgI4IAAgAzoAKCAAIAI6AC0gACABNgIYCxEAIAAgASABIAJqEMOAgIAACxAAIABBAEHcABDMgICAABoLZwEBf0EAIQECQCAAKAIMDQACQAJAAkACQCAALQAvDgMBAAMCCyAAKAI4IgFFDQAgASgCLCIBRQ0AIAAgARGAgICAAAAiAQ0DC0EADwsQyoCAgAAACyAAQcOWgIAANgIQQQ4hAQsgAQseAAJAIAAoAgwNACAAQdGbgIAANgIQIABBFTYCDAsLFgACQCAAKAIMQRVHDQAgAEEANgIMCwsWAAJAIAAoAgxBFkcNACAAQQA2AgwLCwcAIAAoAgwLBwAgACgCEAsJACAAIAE2AhALBwAgACgCFAsiAAJAIABBJEkNABDKgICAAAALIABBAnRBoLOAgABqKAIACyIAAkAgAEEuSQ0AEMqAgIAAAAsgAEECdEGwtICAAGooAgAL7gsBAX9B66iAgAAhAQJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIABBnH9qDvQDY2IAAWFhYWFhYQIDBAVhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhBgcICQoLDA0OD2FhYWFhEGFhYWFhYWFhYWFhEWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYRITFBUWFxgZGhthYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhHB0eHyAhIiMkJSYnKCkqKywtLi8wMTIzNDU2YTc4OTphYWFhYWFhYTthYWE8YWFhYT0+P2FhYWFhYWFhQGFhQWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYUJDREVGR0hJSktMTU5PUFFSU2FhYWFhYWFhVFVWV1hZWlthXF1hYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFeYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhYWFhX2BhC0Hhp4CAAA8LQaShgIAADwtBy6yAgAAPC0H+sYCAAA8LQcCkgIAADwtBq6SAgAAPC0GNqICAAA8LQeKmgIAADwtBgLCAgAAPC0G5r4CAAA8LQdekgIAADwtB75+AgAAPC0Hhn4CAAA8LQfqfgIAADwtB8qCAgAAPC0Gor4CAAA8LQa6ygIAADwtBiLCAgAAPC0Hsp4CAAA8LQYKigIAADwtBjp2AgAAPC0HQroCAAA8LQcqjgIAADwtBxbKAgAAPC0HfnICAAA8LQdKcgIAADwtBxKCAgAAPC0HXoICAAA8LQaKfgIAADwtB7a6AgAAPC0GrsICAAA8LQdSlgIAADwtBzK6AgAAPC0H6roCAAA8LQfyrgIAADwtB0rCAgAAPC0HxnYCAAA8LQbuggIAADwtB96uAgAAPC0GQsYCAAA8LQdexgIAADwtBoq2AgAAPC0HUp4CAAA8LQeCrgIAADwtBn6yAgAAPC0HrsYCAAA8LQdWfgIAADwtByrGAgAAPC0HepYCAAA8LQdSegIAADwtB9JyAgAAPC0GnsoCAAA8LQbGdgIAADwtBoJ2AgAAPC0G5sYCAAA8LQbywgIAADwtBkqGAgAAPC0GzpoCAAA8LQemsgIAADwtBrJ6AgAAPC0HUq4CAAA8LQfemgIAADwtBgKaAgAAPC0GwoYCAAA8LQf6egIAADwtBjaOAgAAPC0GJrYCAAA8LQfeigIAADwtBoLGAgAAPC0Gun4CAAA8LQcalgIAADwtB6J6AgAAPC0GTooCAAA8LQcKvgIAADwtBw52AgAAPC0GLrICAAA8LQeGdgIAADwtBja+AgAAPC0HqoYCAAA8LQbStgIAADwtB0q+AgAAPC0HfsoCAAA8LQdKygIAADwtB8LCAgAAPC0GpooCAAA8LQfmjgIAADwtBmZ6AgAAPC0G1rICAAA8LQZuwgIAADwtBkrKAgAAPC0G2q4CAAA8LQcKigIAADwtB+LKAgAAPC0GepYCAAA8LQdCigIAADwtBup6AgAAPC0GBnoCAAA8LEMqAgIAAAAtB1qGAgAAhAQsgAQsWACAAIAAtAC1B/gFxIAFBAEdyOgAtCxkAIAAgAC0ALUH9AXEgAUEAR0EBdHI6AC0LGQAgACAALQAtQfsBcSABQQBHQQJ0cjoALQsZACAAIAAtAC1B9wFxIAFBAEdBA3RyOgAtCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAgAiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCBCIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQcaRgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIwIgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAggiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEH2ioCAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCNCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIMIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABB7ZqAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAjgiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCECIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQZWQgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAI8IgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAhQiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEGqm4CAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCQCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIYIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABB7ZOAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAkQiBEUNACAAIAQRgICAgAAAIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCJCIERQ0AIAAgBBGAgICAAAAhAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIsIgRFDQAgACAEEYCAgIAAACEDCyADC0kBAn9BACEDAkAgACgCOCIERQ0AIAQoAigiBEUNACAAIAEgAiABayAEEYGAgIAAACIDQX9HDQAgAEH2iICAADYCEEEYIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCUCIERQ0AIAAgBBGAgICAAAAhAwsgAwtJAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAIcIgRFDQAgACABIAIgAWsgBBGBgICAAAAiA0F/Rw0AIABBwpmAgAA2AhBBGCEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAkgiBEUNACAAIAQRgICAgAAAIQMLIAMLSQECf0EAIQMCQCAAKAI4IgRFDQAgBCgCICIERQ0AIAAgASACIAFrIAQRgYCAgAAAIgNBf0cNACAAQZSUgIAANgIQQRghAwsgAwsuAQJ/QQAhAwJAIAAoAjgiBEUNACAEKAJMIgRFDQAgACAEEYCAgIAAACEDCyADCy4BAn9BACEDAkAgACgCOCIERQ0AIAQoAlQiBEUNACAAIAQRgICAgAAAIQMLIAMLLgECf0EAIQMCQCAAKAI4IgRFDQAgBCgCWCIERQ0AIAAgBBGAgICAAAAhAwsgAwtFAQF/AkACQCAALwEwQRRxQRRHDQBBASEDIAAtAChBAUYNASAALwEyQeUARiEDDAELIAAtAClBBUYhAwsgACADOgAuQQAL/gEBA39BASEDAkAgAC8BMCIEQQhxDQAgACkDIEIAUiEDCwJAAkAgAC0ALkUNAEEBIQUgAC0AKUEFRg0BQQEhBSAEQcAAcUUgA3FBAUcNAQtBACEFIARBwABxDQBBAiEFIARB//8DcSIDQQhxDQACQCADQYAEcUUNAAJAIAAtAChBAUcNACAALQAtQQpxDQBBBQ8LQQQPCwJAIANBIHENAAJAIAAtAChBAUYNACAALwEyQf//A3EiAEGcf2pB5ABJDQAgAEHMAUYNACAAQbACRg0AQQQhBSAEQShxRQ0CIANBiARxQYAERg0CC0EADwtBAEEDIAApAyBQGyEFCyAFC2IBAn9BACEBAkAgAC0AKEEBRg0AIAAvATJB//8DcSICQZx/akHkAEkNACACQcwBRg0AIAJBsAJGDQAgAC8BMCIAQcAAcQ0AQQEhASAAQYgEcUGABEYNACAAQShxRSEBCyABC6cBAQN/AkACQAJAIAAtACpFDQAgAC0AK0UNAEEAIQMgAC8BMCIEQQJxRQ0BDAILQQAhAyAALwEwIgRBAXFFDQELQQEhAyAALQAoQQFGDQAgAC8BMkH//wNxIgVBnH9qQeQASQ0AIAVBzAFGDQAgBUGwAkYNACAEQcAAcQ0AQQAhAyAEQYgEcUGABEYNACAEQShxQQBHIQMLIABBADsBMCAAQQA6AC8gAwuZAQECfwJAAkACQCAALQAqRQ0AIAAtACtFDQBBACEBIAAvATAiAkECcUUNAQwCC0EAIQEgAC8BMCICQQFxRQ0BC0EBIQEgAC0AKEEBRg0AIAAvATJB//8DcSIAQZx/akHkAEkNACAAQcwBRg0AIABBsAJGDQAgAkHAAHENAEEAIQEgAkGIBHFBgARGDQAgAkEocUEARyEBCyABC0kBAXsgAEEQav0MAAAAAAAAAAAAAAAAAAAAACIB/QsDACAAIAH9CwMAIABBMGogAf0LAwAgAEEgaiAB/QsDACAAQd0BNgIcQQALewEBfwJAIAAoAgwiAw0AAkAgACgCBEUNACAAIAE2AgQLAkAgACABIAIQxICAgAAiAw0AIAAoAgwPCyAAIAM2AhxBACEDIAAoAgQiAUUNACAAIAEgAiAAKAIIEYGAgIAAACIBRQ0AIAAgAjYCFCAAIAE2AgwgASEDCyADC+TzAQMOfwN+BH8jgICAgABBEGsiAySAgICAACABIQQgASEFIAEhBiABIQcgASEIIAEhCSABIQogASELIAEhDCABIQ0gASEOIAEhDwJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAAKAIcIhBBf2oO3QHaAQHZAQIDBAUGBwgJCgsMDQ7YAQ8Q1wEREtYBExQVFhcYGRob4AHfARwdHtUBHyAhIiMkJdQBJicoKSorLNMB0gEtLtEB0AEvMDEyMzQ1Njc4OTo7PD0+P0BBQkNERUbbAUdISUrPAc4BS80BTMwBTU5PUFFSU1RVVldYWVpbXF1eX2BhYmNkZWZnaGlqa2xtbm9wcXJzdHV2d3h5ent8fX5/gAGBAYIBgwGEAYUBhgGHAYgBiQGKAYsBjAGNAY4BjwGQAZEBkgGTAZQBlQGWAZcBmAGZAZoBmwGcAZ0BngGfAaABoQGiAaMBpAGlAaYBpwGoAakBqgGrAawBrQGuAa8BsAGxAbIBswG0AbUBtgG3AcsBygG4AckBuQHIAboBuwG8Ab0BvgG/AcABwQHCAcMBxAHFAcYBANwBC0EAIRAMxgELQQ4hEAzFAQtBDSEQDMQBC0EPIRAMwwELQRAhEAzCAQtBEyEQDMEBC0EUIRAMwAELQRUhEAy/AQtBFiEQDL4BC0EXIRAMvQELQRghEAy8AQtBGSEQDLsBC0EaIRAMugELQRshEAy5AQtBHCEQDLgBC0EIIRAMtwELQR0hEAy2AQtBICEQDLUBC0EfIRAMtAELQQchEAyzAQtBISEQDLIBC0EiIRAMsQELQR4hEAywAQtBIyEQDK8BC0ESIRAMrgELQREhEAytAQtBJCEQDKwBC0ElIRAMqwELQSYhEAyqAQtBJyEQDKkBC0HDASEQDKgBC0EpIRAMpwELQSshEAymAQtBLCEQDKUBC0EtIRAMpAELQS4hEAyjAQtBLyEQDKIBC0HEASEQDKEBC0EwIRAMoAELQTQhEAyfAQtBDCEQDJ4BC0ExIRAMnQELQTIhEAycAQtBMyEQDJsBC0E5IRAMmgELQTUhEAyZAQtBxQEhEAyYAQtBCyEQDJcBC0E6IRAMlgELQTYhEAyVAQtBCiEQDJQBC0E3IRAMkwELQTghEAySAQtBPCEQDJEBC0E7IRAMkAELQT0hEAyPAQtBCSEQDI4BC0EoIRAMjQELQT4hEAyMAQtBPyEQDIsBC0HAACEQDIoBC0HBACEQDIkBC0HCACEQDIgBC0HDACEQDIcBC0HEACEQDIYBC0HFACEQDIUBC0HGACEQDIQBC0EqIRAMgwELQccAIRAMggELQcgAIRAMgQELQckAIRAMgAELQcoAIRAMfwtBywAhEAx+C0HNACEQDH0LQcwAIRAMfAtBzgAhEAx7C0HPACEQDHoLQdAAIRAMeQtB0QAhEAx4C0HSACEQDHcLQdMAIRAMdgtB1AAhEAx1C0HWACEQDHQLQdUAIRAMcwtBBiEQDHILQdcAIRAMcQtBBSEQDHALQdgAIRAMbwtBBCEQDG4LQdkAIRAMbQtB2gAhEAxsC0HbACEQDGsLQdwAIRAMagtBAyEQDGkLQd0AIRAMaAtB3gAhEAxnC0HfACEQDGYLQeEAIRAMZQtB4AAhEAxkC0HiACEQDGMLQeMAIRAMYgtBAiEQDGELQeQAIRAMYAtB5QAhEAxfC0HmACEQDF4LQecAIRAMXQtB6AAhEAxcC0HpACEQDFsLQeoAIRAMWgtB6wAhEAxZC0HsACEQDFgLQe0AIRAMVwtB7gAhEAxWC0HvACEQDFULQfAAIRAMVAtB8QAhEAxTC0HyACEQDFILQfMAIRAMUQtB9AAhEAxQC0H1ACEQDE8LQfYAIRAMTgtB9wAhEAxNC0H4ACEQDEwLQfkAIRAMSwtB+gAhEAxKC0H7ACEQDEkLQfwAIRAMSAtB/QAhEAxHC0H+ACEQDEYLQf8AIRAMRQtBgAEhEAxEC0GBASEQDEMLQYIBIRAMQgtBgwEhEAxBC0GEASEQDEALQYUBIRAMPwtBhgEhEAw+C0GHASEQDD0LQYgBIRAMPAtBiQEhEAw7C0GKASEQDDoLQYsBIRAMOQtBjAEhEAw4C0GNASEQDDcLQY4BIRAMNgtBjwEhEAw1C0GQASEQDDQLQZEBIRAMMwtBkgEhEAwyC0GTASEQDDELQZQBIRAMMAtBlQEhEAwvC0GWASEQDC4LQZcBIRAMLQtBmAEhEAwsC0GZASEQDCsLQZoBIRAMKgtBmwEhEAwpC0GcASEQDCgLQZ0BIRAMJwtBngEhEAwmC0GfASEQDCULQaABIRAMJAtBoQEhEAwjC0GiASEQDCILQaMBIRAMIQtBpAEhEAwgC0GlASEQDB8LQaYBIRAMHgtBpwEhEAwdC0GoASEQDBwLQakBIRAMGwtBqgEhEAwaC0GrASEQDBkLQawBIRAMGAtBrQEhEAwXC0GuASEQDBYLQQEhEAwVC0GvASEQDBQLQbABIRAMEwtBsQEhEAwSC0GzASEQDBELQbIBIRAMEAtBtAEhEAwPC0G1ASEQDA4LQbYBIRAMDQtBtwEhEAwMC0G4ASEQDAsLQbkBIRAMCgtBugEhEAwJC0G7ASEQDAgLQcYBIRAMBwtBvAEhEAwGC0G9ASEQDAULQb4BIRAMBAtBvwEhEAwDC0HAASEQDAILQcIBIRAMAQtBwQEhEAsDQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIBAOxwEAAQIDBAUGBwgJCgsMDQ4PEBESExQVFhcYGRobHB4fICEjJSg/QEFERUZHSElKS0xNT1BRUlPeA1dZW1xdYGJlZmdoaWprbG1vcHFyc3R1dnd4eXp7fH1+gAGCAYUBhgGHAYkBiwGMAY0BjgGPAZABkQGUAZUBlgGXAZgBmQGaAZsBnAGdAZ4BnwGgAaEBogGjAaQBpQGmAacBqAGpAaoBqwGsAa0BrgGvAbABsQGyAbMBtAG1AbYBtwG4AbkBugG7AbwBvQG+Ab8BwAHBAcIBwwHEAcUBxgHHAcgByQHKAcsBzAHNAc4BzwHQAdEB0gHTAdQB1QHWAdcB2AHZAdoB2wHcAd0B3gHgAeEB4gHjAeQB5QHmAecB6AHpAeoB6wHsAe0B7gHvAfAB8QHyAfMBmQKkArAC/gL+AgsgASIEIAJHDfMBQd0BIRAM/wMLIAEiECACRw3dAUHDASEQDP4DCyABIgEgAkcNkAFB9wAhEAz9AwsgASIBIAJHDYYBQe8AIRAM/AMLIAEiASACRw1/QeoAIRAM+wMLIAEiASACRw17QegAIRAM+gMLIAEiASACRw14QeYAIRAM+QMLIAEiASACRw0aQRghEAz4AwsgASIBIAJHDRRBEiEQDPcDCyABIgEgAkcNWUHFACEQDPYDCyABIgEgAkcNSkE/IRAM9QMLIAEiASACRw1IQTwhEAz0AwsgASIBIAJHDUFBMSEQDPMDCyAALQAuQQFGDesDDIcCCyAAIAEiASACEMCAgIAAQQFHDeYBIABCADcDIAznAQsgACABIgEgAhC0gICAACIQDecBIAEhAQz1AgsCQCABIgEgAkcNAEEGIRAM8AMLIAAgAUEBaiIBIAIQu4CAgAAiEA3oASABIQEMMQsgAEIANwMgQRIhEAzVAwsgASIQIAJHDStBHSEQDO0DCwJAIAEiASACRg0AIAFBAWohAUEQIRAM1AMLQQchEAzsAwsgAEIAIAApAyAiESACIAEiEGutIhJ9IhMgEyARVhs3AyAgESASViIURQ3lAUEIIRAM6wMLAkAgASIBIAJGDQAgAEGJgICAADYCCCAAIAE2AgQgASEBQRQhEAzSAwtBCSEQDOoDCyABIQEgACkDIFAN5AEgASEBDPICCwJAIAEiASACRw0AQQshEAzpAwsgACABQQFqIgEgAhC2gICAACIQDeUBIAEhAQzyAgsgACABIgEgAhC4gICAACIQDeUBIAEhAQzyAgsgACABIgEgAhC4gICAACIQDeYBIAEhAQwNCyAAIAEiASACELqAgIAAIhAN5wEgASEBDPACCwJAIAEiASACRw0AQQ8hEAzlAwsgAS0AACIQQTtGDQggEEENRw3oASABQQFqIQEM7wILIAAgASIBIAIQuoCAgAAiEA3oASABIQEM8gILA0ACQCABLQAAQfC1gIAAai0AACIQQQFGDQAgEEECRw3rASAAKAIEIRAgAEEANgIEIAAgECABQQFqIgEQuYCAgAAiEA3qASABIQEM9AILIAFBAWoiASACRw0AC0ESIRAM4gMLIAAgASIBIAIQuoCAgAAiEA3pASABIQEMCgsgASIBIAJHDQZBGyEQDOADCwJAIAEiASACRw0AQRYhEAzgAwsgAEGKgICAADYCCCAAIAE2AgQgACABIAIQuICAgAAiEA3qASABIQFBICEQDMYDCwJAIAEiASACRg0AA0ACQCABLQAAQfC3gIAAai0AACIQQQJGDQACQCAQQX9qDgTlAewBAOsB7AELIAFBAWohAUEIIRAMyAMLIAFBAWoiASACRw0AC0EVIRAM3wMLQRUhEAzeAwsDQAJAIAEtAABB8LmAgABqLQAAIhBBAkYNACAQQX9qDgTeAewB4AHrAewBCyABQQFqIgEgAkcNAAtBGCEQDN0DCwJAIAEiASACRg0AIABBi4CAgAA2AgggACABNgIEIAEhAUEHIRAMxAMLQRkhEAzcAwsgAUEBaiEBDAILAkAgASIUIAJHDQBBGiEQDNsDCyAUIQECQCAULQAAQXNqDhTdAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAu4C7gLuAgDuAgtBACEQIABBADYCHCAAQa+LgIAANgIQIABBAjYCDCAAIBRBAWo2AhQM2gMLAkAgAS0AACIQQTtGDQAgEEENRw3oASABQQFqIQEM5QILIAFBAWohAQtBIiEQDL8DCwJAIAEiECACRw0AQRwhEAzYAwtCACERIBAhASAQLQAAQVBqDjfnAeYBAQIDBAUGBwgAAAAAAAAACQoLDA0OAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPEBESExQAC0EeIRAMvQMLQgIhEQzlAQtCAyERDOQBC0IEIREM4wELQgUhEQziAQtCBiERDOEBC0IHIREM4AELQgghEQzfAQtCCSERDN4BC0IKIREM3QELQgshEQzcAQtCDCERDNsBC0INIREM2gELQg4hEQzZAQtCDyERDNgBC0IKIREM1wELQgshEQzWAQtCDCERDNUBC0INIREM1AELQg4hEQzTAQtCDyERDNIBC0IAIRECQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIBAtAABBUGoON+UB5AEAAQIDBAUGB+YB5gHmAeYB5gHmAeYBCAkKCwwN5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAeYB5gHmAQ4PEBESE+YBC0ICIREM5AELQgMhEQzjAQtCBCERDOIBC0IFIREM4QELQgYhEQzgAQtCByERDN8BC0IIIREM3gELQgkhEQzdAQtCCiERDNwBC0ILIREM2wELQgwhEQzaAQtCDSERDNkBC0IOIREM2AELQg8hEQzXAQtCCiERDNYBC0ILIREM1QELQgwhEQzUAQtCDSERDNMBC0IOIREM0gELQg8hEQzRAQsgAEIAIAApAyAiESACIAEiEGutIhJ9IhMgEyARVhs3AyAgESASViIURQ3SAUEfIRAMwAMLAkAgASIBIAJGDQAgAEGJgICAADYCCCAAIAE2AgQgASEBQSQhEAynAwtBICEQDL8DCyAAIAEiECACEL6AgIAAQX9qDgW2AQDFAgHRAdIBC0ERIRAMpAMLIABBAToALyAQIQEMuwMLIAEiASACRw3SAUEkIRAMuwMLIAEiDSACRw0eQcYAIRAMugMLIAAgASIBIAIQsoCAgAAiEA3UASABIQEMtQELIAEiECACRw0mQdAAIRAMuAMLAkAgASIBIAJHDQBBKCEQDLgDCyAAQQA2AgQgAEGMgICAADYCCCAAIAEgARCxgICAACIQDdMBIAEhAQzYAQsCQCABIhAgAkcNAEEpIRAMtwMLIBAtAAAiAUEgRg0UIAFBCUcN0wEgEEEBaiEBDBULAkAgASIBIAJGDQAgAUEBaiEBDBcLQSohEAy1AwsCQCABIhAgAkcNAEErIRAMtQMLAkAgEC0AACIBQQlGDQAgAUEgRw3VAQsgAC0ALEEIRg3TASAQIQEMkQMLAkAgASIBIAJHDQBBLCEQDLQDCyABLQAAQQpHDdUBIAFBAWohAQzJAgsgASIOIAJHDdUBQS8hEAyyAwsDQAJAIAEtAAAiEEEgRg0AAkAgEEF2ag4EANwB3AEA2gELIAEhAQzgAQsgAUEBaiIBIAJHDQALQTEhEAyxAwtBMiEQIAEiFCACRg2wAyACIBRrIAAoAgAiAWohFSAUIAFrQQNqIRYCQANAIBQtAAAiF0EgciAXIBdBv39qQf8BcUEaSRtB/wFxIAFB8LuAgABqLQAARw0BAkAgAUEDRw0AQQYhAQyWAwsgAUEBaiEBIBRBAWoiFCACRw0ACyAAIBU2AgAMsQMLIABBADYCACAUIQEM2QELQTMhECABIhQgAkYNrwMgAiAUayAAKAIAIgFqIRUgFCABa0EIaiEWAkADQCAULQAAIhdBIHIgFyAXQb9/akH/AXFBGkkbQf8BcSABQfS7gIAAai0AAEcNAQJAIAFBCEcNAEEFIQEMlQMLIAFBAWohASAUQQFqIhQgAkcNAAsgACAVNgIADLADCyAAQQA2AgAgFCEBDNgBC0E0IRAgASIUIAJGDa4DIAIgFGsgACgCACIBaiEVIBQgAWtBBWohFgJAA0AgFC0AACIXQSByIBcgF0G/f2pB/wFxQRpJG0H/AXEgAUHQwoCAAGotAABHDQECQCABQQVHDQBBByEBDJQDCyABQQFqIQEgFEEBaiIUIAJHDQALIAAgFTYCAAyvAwsgAEEANgIAIBQhAQzXAQsCQCABIgEgAkYNAANAAkAgAS0AAEGAvoCAAGotAAAiEEEBRg0AIBBBAkYNCiABIQEM3QELIAFBAWoiASACRw0AC0EwIRAMrgMLQTAhEAytAwsCQCABIgEgAkYNAANAAkAgAS0AACIQQSBGDQAgEEF2ag4E2QHaAdoB2QHaAQsgAUEBaiIBIAJHDQALQTghEAytAwtBOCEQDKwDCwNAAkAgAS0AACIQQSBGDQAgEEEJRw0DCyABQQFqIgEgAkcNAAtBPCEQDKsDCwNAAkAgAS0AACIQQSBGDQACQAJAIBBBdmoOBNoBAQHaAQALIBBBLEYN2wELIAEhAQwECyABQQFqIgEgAkcNAAtBPyEQDKoDCyABIQEM2wELQcAAIRAgASIUIAJGDagDIAIgFGsgACgCACIBaiEWIBQgAWtBBmohFwJAA0AgFC0AAEEgciABQYDAgIAAai0AAEcNASABQQZGDY4DIAFBAWohASAUQQFqIhQgAkcNAAsgACAWNgIADKkDCyAAQQA2AgAgFCEBC0E2IRAMjgMLAkAgASIPIAJHDQBBwQAhEAynAwsgAEGMgICAADYCCCAAIA82AgQgDyEBIAAtACxBf2oOBM0B1QHXAdkBhwMLIAFBAWohAQzMAQsCQCABIgEgAkYNAANAAkAgAS0AACIQQSByIBAgEEG/f2pB/wFxQRpJG0H/AXEiEEEJRg0AIBBBIEYNAAJAAkACQAJAIBBBnX9qDhMAAwMDAwMDAwEDAwMDAwMDAwMCAwsgAUEBaiEBQTEhEAyRAwsgAUEBaiEBQTIhEAyQAwsgAUEBaiEBQTMhEAyPAwsgASEBDNABCyABQQFqIgEgAkcNAAtBNSEQDKUDC0E1IRAMpAMLAkAgASIBIAJGDQADQAJAIAEtAABBgLyAgABqLQAAQQFGDQAgASEBDNMBCyABQQFqIgEgAkcNAAtBPSEQDKQDC0E9IRAMowMLIAAgASIBIAIQsICAgAAiEA3WASABIQEMAQsgEEEBaiEBC0E8IRAMhwMLAkAgASIBIAJHDQBBwgAhEAygAwsCQANAAkAgAS0AAEF3ag4YAAL+Av4ChAP+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gL+Av4C/gIA/gILIAFBAWoiASACRw0AC0HCACEQDKADCyABQQFqIQEgAC0ALUEBcUUNvQEgASEBC0EsIRAMhQMLIAEiASACRw3TAUHEACEQDJ0DCwNAAkAgAS0AAEGQwICAAGotAABBAUYNACABIQEMtwILIAFBAWoiASACRw0AC0HFACEQDJwDCyANLQAAIhBBIEYNswEgEEE6Rw2BAyAAKAIEIQEgAEEANgIEIAAgASANEK+AgIAAIgEN0AEgDUEBaiEBDLMCC0HHACEQIAEiDSACRg2aAyACIA1rIAAoAgAiAWohFiANIAFrQQVqIRcDQCANLQAAIhRBIHIgFCAUQb9/akH/AXFBGkkbQf8BcSABQZDCgIAAai0AAEcNgAMgAUEFRg30AiABQQFqIQEgDUEBaiINIAJHDQALIAAgFjYCAAyaAwtByAAhECABIg0gAkYNmQMgAiANayAAKAIAIgFqIRYgDSABa0EJaiEXA0AgDS0AACIUQSByIBQgFEG/f2pB/wFxQRpJG0H/AXEgAUGWwoCAAGotAABHDf8CAkAgAUEJRw0AQQIhAQz1AgsgAUEBaiEBIA1BAWoiDSACRw0ACyAAIBY2AgAMmQMLAkAgASINIAJHDQBByQAhEAyZAwsCQAJAIA0tAAAiAUEgciABIAFBv39qQf8BcUEaSRtB/wFxQZJ/ag4HAIADgAOAA4ADgAMBgAMLIA1BAWohAUE+IRAMgAMLIA1BAWohAUE/IRAM/wILQcoAIRAgASINIAJGDZcDIAIgDWsgACgCACIBaiEWIA0gAWtBAWohFwNAIA0tAAAiFEEgciAUIBRBv39qQf8BcUEaSRtB/wFxIAFBoMKAgABqLQAARw39AiABQQFGDfACIAFBAWohASANQQFqIg0gAkcNAAsgACAWNgIADJcDC0HLACEQIAEiDSACRg2WAyACIA1rIAAoAgAiAWohFiANIAFrQQ5qIRcDQCANLQAAIhRBIHIgFCAUQb9/akH/AXFBGkkbQf8BcSABQaLCgIAAai0AAEcN/AIgAUEORg3wAiABQQFqIQEgDUEBaiINIAJHDQALIAAgFjYCAAyWAwtBzAAhECABIg0gAkYNlQMgAiANayAAKAIAIgFqIRYgDSABa0EPaiEXA0AgDS0AACIUQSByIBQgFEG/f2pB/wFxQRpJG0H/AXEgAUHAwoCAAGotAABHDfsCAkAgAUEPRw0AQQMhAQzxAgsgAUEBaiEBIA1BAWoiDSACRw0ACyAAIBY2AgAMlQMLQc0AIRAgASINIAJGDZQDIAIgDWsgACgCACIBaiEWIA0gAWtBBWohFwNAIA0tAAAiFEEgciAUIBRBv39qQf8BcUEaSRtB/wFxIAFB0MKAgABqLQAARw36AgJAIAFBBUcNAEEEIQEM8AILIAFBAWohASANQQFqIg0gAkcNAAsgACAWNgIADJQDCwJAIAEiDSACRw0AQc4AIRAMlAMLAkACQAJAAkAgDS0AACIBQSByIAEgAUG/f2pB/wFxQRpJG0H/AXFBnX9qDhMA/QL9Av0C/QL9Av0C/QL9Av0C/QL9Av0CAf0C/QL9AgID/QILIA1BAWohAUHBACEQDP0CCyANQQFqIQFBwgAhEAz8AgsgDUEBaiEBQcMAIRAM+wILIA1BAWohAUHEACEQDPoCCwJAIAEiASACRg0AIABBjYCAgAA2AgggACABNgIEIAEhAUHFACEQDPoCC0HPACEQDJIDCyAQIQECQAJAIBAtAABBdmoOBAGoAqgCAKgCCyAQQQFqIQELQSchEAz4AgsCQCABIgEgAkcNAEHRACEQDJEDCwJAIAEtAABBIEYNACABIQEMjQELIAFBAWohASAALQAtQQFxRQ3HASABIQEMjAELIAEiFyACRw3IAUHSACEQDI8DC0HTACEQIAEiFCACRg2OAyACIBRrIAAoAgAiAWohFiAUIAFrQQFqIRcDQCAULQAAIAFB1sKAgABqLQAARw3MASABQQFGDccBIAFBAWohASAUQQFqIhQgAkcNAAsgACAWNgIADI4DCwJAIAEiASACRw0AQdUAIRAMjgMLIAEtAABBCkcNzAEgAUEBaiEBDMcBCwJAIAEiASACRw0AQdYAIRAMjQMLAkACQCABLQAAQXZqDgQAzQHNAQHNAQsgAUEBaiEBDMcBCyABQQFqIQFBygAhEAzzAgsgACABIgEgAhCugICAACIQDcsBIAEhAUHNACEQDPICCyAALQApQSJGDYUDDKYCCwJAIAEiASACRw0AQdsAIRAMigMLQQAhFEEBIRdBASEWQQAhEAJAAkACQAJAAkACQAJAAkACQCABLQAAQVBqDgrUAdMBAAECAwQFBgjVAQtBAiEQDAYLQQMhEAwFC0EEIRAMBAtBBSEQDAMLQQYhEAwCC0EHIRAMAQtBCCEQC0EAIRdBACEWQQAhFAzMAQtBCSEQQQEhFEEAIRdBACEWDMsBCwJAIAEiASACRw0AQd0AIRAMiQMLIAEtAABBLkcNzAEgAUEBaiEBDKYCCyABIgEgAkcNzAFB3wAhEAyHAwsCQCABIgEgAkYNACAAQY6AgIAANgIIIAAgATYCBCABIQFB0AAhEAzuAgtB4AAhEAyGAwtB4QAhECABIgEgAkYNhQMgAiABayAAKAIAIhRqIRYgASAUa0EDaiEXA0AgAS0AACAUQeLCgIAAai0AAEcNzQEgFEEDRg3MASAUQQFqIRQgAUEBaiIBIAJHDQALIAAgFjYCAAyFAwtB4gAhECABIgEgAkYNhAMgAiABayAAKAIAIhRqIRYgASAUa0ECaiEXA0AgAS0AACAUQebCgIAAai0AAEcNzAEgFEECRg3OASAUQQFqIRQgAUEBaiIBIAJHDQALIAAgFjYCAAyEAwtB4wAhECABIgEgAkYNgwMgAiABayAAKAIAIhRqIRYgASAUa0EDaiEXA0AgAS0AACAUQenCgIAAai0AAEcNywEgFEEDRg3OASAUQQFqIRQgAUEBaiIBIAJHDQALIAAgFjYCAAyDAwsCQCABIgEgAkcNAEHlACEQDIMDCyAAIAFBAWoiASACEKiAgIAAIhANzQEgASEBQdYAIRAM6QILAkAgASIBIAJGDQADQAJAIAEtAAAiEEEgRg0AAkACQAJAIBBBuH9qDgsAAc8BzwHPAc8BzwHPAc8BzwECzwELIAFBAWohAUHSACEQDO0CCyABQQFqIQFB0wAhEAzsAgsgAUEBaiEBQdQAIRAM6wILIAFBAWoiASACRw0AC0HkACEQDIIDC0HkACEQDIEDCwNAAkAgAS0AAEHwwoCAAGotAAAiEEEBRg0AIBBBfmoOA88B0AHRAdIBCyABQQFqIgEgAkcNAAtB5gAhEAyAAwsCQCABIgEgAkYNACABQQFqIQEMAwtB5wAhEAz/AgsDQAJAIAEtAABB8MSAgABqLQAAIhBBAUYNAAJAIBBBfmoOBNIB0wHUAQDVAQsgASEBQdcAIRAM5wILIAFBAWoiASACRw0AC0HoACEQDP4CCwJAIAEiASACRw0AQekAIRAM/gILAkAgAS0AACIQQXZqDhq6AdUB1QG8AdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAdUB1QHVAcoB1QHVAQDTAQsgAUEBaiEBC0EGIRAM4wILA0ACQCABLQAAQfDGgIAAai0AAEEBRg0AIAEhAQyeAgsgAUEBaiIBIAJHDQALQeoAIRAM+wILAkAgASIBIAJGDQAgAUEBaiEBDAMLQesAIRAM+gILAkAgASIBIAJHDQBB7AAhEAz6AgsgAUEBaiEBDAELAkAgASIBIAJHDQBB7QAhEAz5AgsgAUEBaiEBC0EEIRAM3gILAkAgASIUIAJHDQBB7gAhEAz3AgsgFCEBAkACQAJAIBQtAABB8MiAgABqLQAAQX9qDgfUAdUB1gEAnAIBAtcBCyAUQQFqIQEMCgsgFEEBaiEBDM0BC0EAIRAgAEEANgIcIABBm5KAgAA2AhAgAEEHNgIMIAAgFEEBajYCFAz2AgsCQANAAkAgAS0AAEHwyICAAGotAAAiEEEERg0AAkACQCAQQX9qDgfSAdMB1AHZAQAEAdkBCyABIQFB2gAhEAzgAgsgAUEBaiEBQdwAIRAM3wILIAFBAWoiASACRw0AC0HvACEQDPYCCyABQQFqIQEMywELAkAgASIUIAJHDQBB8AAhEAz1AgsgFC0AAEEvRw3UASAUQQFqIQEMBgsCQCABIhQgAkcNAEHxACEQDPQCCwJAIBQtAAAiAUEvRw0AIBRBAWohAUHdACEQDNsCCyABQXZqIgRBFksN0wFBASAEdEGJgIACcUUN0wEMygILAkAgASIBIAJGDQAgAUEBaiEBQd4AIRAM2gILQfIAIRAM8gILAkAgASIUIAJHDQBB9AAhEAzyAgsgFCEBAkAgFC0AAEHwzICAAGotAABBf2oOA8kClAIA1AELQeEAIRAM2AILAkAgASIUIAJGDQADQAJAIBQtAABB8MqAgABqLQAAIgFBA0YNAAJAIAFBf2oOAssCANUBCyAUIQFB3wAhEAzaAgsgFEEBaiIUIAJHDQALQfMAIRAM8QILQfMAIRAM8AILAkAgASIBIAJGDQAgAEGPgICAADYCCCAAIAE2AgQgASEBQeAAIRAM1wILQfUAIRAM7wILAkAgASIBIAJHDQBB9gAhEAzvAgsgAEGPgICAADYCCCAAIAE2AgQgASEBC0EDIRAM1AILA0AgAS0AAEEgRw3DAiABQQFqIgEgAkcNAAtB9wAhEAzsAgsCQCABIgEgAkcNAEH4ACEQDOwCCyABLQAAQSBHDc4BIAFBAWohAQzvAQsgACABIgEgAhCsgICAACIQDc4BIAEhAQyOAgsCQCABIgQgAkcNAEH6ACEQDOoCCyAELQAAQcwARw3RASAEQQFqIQFBEyEQDM8BCwJAIAEiBCACRw0AQfsAIRAM6QILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEANAIAQtAAAgAUHwzoCAAGotAABHDdABIAFBBUYNzgEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBB+wAhEAzoAgsCQCABIgQgAkcNAEH8ACEQDOgCCwJAAkAgBC0AAEG9f2oODADRAdEB0QHRAdEB0QHRAdEB0QHRAQHRAQsgBEEBaiEBQeYAIRAMzwILIARBAWohAUHnACEQDM4CCwJAIAEiBCACRw0AQf0AIRAM5wILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQe3PgIAAai0AAEcNzwEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQf0AIRAM5wILIABBADYCACAQQQFqIQFBECEQDMwBCwJAIAEiBCACRw0AQf4AIRAM5gILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEAJAA0AgBC0AACABQfbOgIAAai0AAEcNzgEgAUEFRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQf4AIRAM5gILIABBADYCACAQQQFqIQFBFiEQDMsBCwJAIAEiBCACRw0AQf8AIRAM5QILIAIgBGsgACgCACIBaiEUIAQgAWtBA2ohEAJAA0AgBC0AACABQfzOgIAAai0AAEcNzQEgAUEDRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQf8AIRAM5QILIABBADYCACAQQQFqIQFBBSEQDMoBCwJAIAEiBCACRw0AQYABIRAM5AILIAQtAABB2QBHDcsBIARBAWohAUEIIRAMyQELAkAgASIEIAJHDQBBgQEhEAzjAgsCQAJAIAQtAABBsn9qDgMAzAEBzAELIARBAWohAUHrACEQDMoCCyAEQQFqIQFB7AAhEAzJAgsCQCABIgQgAkcNAEGCASEQDOICCwJAAkAgBC0AAEG4f2oOCADLAcsBywHLAcsBywEBywELIARBAWohAUHqACEQDMkCCyAEQQFqIQFB7QAhEAzIAgsCQCABIgQgAkcNAEGDASEQDOECCyACIARrIAAoAgAiAWohECAEIAFrQQJqIRQCQANAIAQtAAAgAUGAz4CAAGotAABHDckBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgEDYCAEGDASEQDOECC0EAIRAgAEEANgIAIBRBAWohAQzGAQsCQCABIgQgAkcNAEGEASEQDOACCyACIARrIAAoAgAiAWohFCAEIAFrQQRqIRACQANAIAQtAAAgAUGDz4CAAGotAABHDcgBIAFBBEYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGEASEQDOACCyAAQQA2AgAgEEEBaiEBQSMhEAzFAQsCQCABIgQgAkcNAEGFASEQDN8CCwJAAkAgBC0AAEG0f2oOCADIAcgByAHIAcgByAEByAELIARBAWohAUHvACEQDMYCCyAEQQFqIQFB8AAhEAzFAgsCQCABIgQgAkcNAEGGASEQDN4CCyAELQAAQcUARw3FASAEQQFqIQEMgwILAkAgASIEIAJHDQBBhwEhEAzdAgsgAiAEayAAKAIAIgFqIRQgBCABa0EDaiEQAkADQCAELQAAIAFBiM+AgABqLQAARw3FASABQQNGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBhwEhEAzdAgsgAEEANgIAIBBBAWohAUEtIRAMwgELAkAgASIEIAJHDQBBiAEhEAzcAgsgAiAEayAAKAIAIgFqIRQgBCABa0EIaiEQAkADQCAELQAAIAFB0M+AgABqLQAARw3EASABQQhGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBiAEhEAzcAgsgAEEANgIAIBBBAWohAUEpIRAMwQELAkAgASIBIAJHDQBBiQEhEAzbAgtBASEQIAEtAABB3wBHDcABIAFBAWohAQyBAgsCQCABIgQgAkcNAEGKASEQDNoCCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRADQCAELQAAIAFBjM+AgABqLQAARw3BASABQQFGDa8CIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQYoBIRAM2QILAkAgASIEIAJHDQBBiwEhEAzZAgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFBjs+AgABqLQAARw3BASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBiwEhEAzZAgsgAEEANgIAIBBBAWohAUECIRAMvgELAkAgASIEIAJHDQBBjAEhEAzYAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFB8M+AgABqLQAARw3AASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBjAEhEAzYAgsgAEEANgIAIBBBAWohAUEfIRAMvQELAkAgASIEIAJHDQBBjQEhEAzXAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFB8s+AgABqLQAARw2/ASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBjQEhEAzXAgsgAEEANgIAIBBBAWohAUEJIRAMvAELAkAgASIEIAJHDQBBjgEhEAzWAgsCQAJAIAQtAABBt39qDgcAvwG/Ab8BvwG/AQG/AQsgBEEBaiEBQfgAIRAMvQILIARBAWohAUH5ACEQDLwCCwJAIAEiBCACRw0AQY8BIRAM1QILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEAJAA0AgBC0AACABQZHPgIAAai0AAEcNvQEgAUEFRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQY8BIRAM1QILIABBADYCACAQQQFqIQFBGCEQDLoBCwJAIAEiBCACRw0AQZABIRAM1AILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQZfPgIAAai0AAEcNvAEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZABIRAM1AILIABBADYCACAQQQFqIQFBFyEQDLkBCwJAIAEiBCACRw0AQZEBIRAM0wILIAIgBGsgACgCACIBaiEUIAQgAWtBBmohEAJAA0AgBC0AACABQZrPgIAAai0AAEcNuwEgAUEGRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZEBIRAM0wILIABBADYCACAQQQFqIQFBFSEQDLgBCwJAIAEiBCACRw0AQZIBIRAM0gILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEAJAA0AgBC0AACABQaHPgIAAai0AAEcNugEgAUEFRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZIBIRAM0gILIABBADYCACAQQQFqIQFBHiEQDLcBCwJAIAEiBCACRw0AQZMBIRAM0QILIAQtAABBzABHDbgBIARBAWohAUEKIRAMtgELAkAgBCACRw0AQZQBIRAM0AILAkACQCAELQAAQb9/ag4PALkBuQG5AbkBuQG5AbkBuQG5AbkBuQG5AbkBAbkBCyAEQQFqIQFB/gAhEAy3AgsgBEEBaiEBQf8AIRAMtgILAkAgBCACRw0AQZUBIRAMzwILAkACQCAELQAAQb9/ag4DALgBAbgBCyAEQQFqIQFB/QAhEAy2AgsgBEEBaiEEQYABIRAMtQILAkAgBCACRw0AQZYBIRAMzgILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQafPgIAAai0AAEcNtgEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZYBIRAMzgILIABBADYCACAQQQFqIQFBCyEQDLMBCwJAIAQgAkcNAEGXASEQDM0CCwJAAkACQAJAIAQtAABBU2oOIwC4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBuAG4AbgBAbgBuAG4AbgBuAECuAG4AbgBA7gBCyAEQQFqIQFB+wAhEAy2AgsgBEEBaiEBQfwAIRAMtQILIARBAWohBEGBASEQDLQCCyAEQQFqIQRBggEhEAyzAgsCQCAEIAJHDQBBmAEhEAzMAgsgAiAEayAAKAIAIgFqIRQgBCABa0EEaiEQAkADQCAELQAAIAFBqc+AgABqLQAARw20ASABQQRGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBmAEhEAzMAgsgAEEANgIAIBBBAWohAUEZIRAMsQELAkAgBCACRw0AQZkBIRAMywILIAIgBGsgACgCACIBaiEUIAQgAWtBBWohEAJAA0AgBC0AACABQa7PgIAAai0AAEcNswEgAUEFRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZkBIRAMywILIABBADYCACAQQQFqIQFBBiEQDLABCwJAIAQgAkcNAEGaASEQDMoCCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUG0z4CAAGotAABHDbIBIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGaASEQDMoCCyAAQQA2AgAgEEEBaiEBQRwhEAyvAQsCQCAEIAJHDQBBmwEhEAzJAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFBts+AgABqLQAARw2xASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBmwEhEAzJAgsgAEEANgIAIBBBAWohAUEnIRAMrgELAkAgBCACRw0AQZwBIRAMyAILAkACQCAELQAAQax/ag4CAAGxAQsgBEEBaiEEQYYBIRAMrwILIARBAWohBEGHASEQDK4CCwJAIAQgAkcNAEGdASEQDMcCCyACIARrIAAoAgAiAWohFCAEIAFrQQFqIRACQANAIAQtAAAgAUG4z4CAAGotAABHDa8BIAFBAUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGdASEQDMcCCyAAQQA2AgAgEEEBaiEBQSYhEAysAQsCQCAEIAJHDQBBngEhEAzGAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFBus+AgABqLQAARw2uASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBngEhEAzGAgsgAEEANgIAIBBBAWohAUEDIRAMqwELAkAgBCACRw0AQZ8BIRAMxQILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQe3PgIAAai0AAEcNrQEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQZ8BIRAMxQILIABBADYCACAQQQFqIQFBDCEQDKoBCwJAIAQgAkcNAEGgASEQDMQCCyACIARrIAAoAgAiAWohFCAEIAFrQQNqIRACQANAIAQtAAAgAUG8z4CAAGotAABHDawBIAFBA0YNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGgASEQDMQCCyAAQQA2AgAgEEEBaiEBQQ0hEAypAQsCQCAEIAJHDQBBoQEhEAzDAgsCQAJAIAQtAABBun9qDgsArAGsAawBrAGsAawBrAGsAawBAawBCyAEQQFqIQRBiwEhEAyqAgsgBEEBaiEEQYwBIRAMqQILAkAgBCACRw0AQaIBIRAMwgILIAQtAABB0ABHDakBIARBAWohBAzpAQsCQCAEIAJHDQBBowEhEAzBAgsCQAJAIAQtAABBt39qDgcBqgGqAaoBqgGqAQCqAQsgBEEBaiEEQY4BIRAMqAILIARBAWohAUEiIRAMpgELAkAgBCACRw0AQaQBIRAMwAILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQcDPgIAAai0AAEcNqAEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQaQBIRAMwAILIABBADYCACAQQQFqIQFBHSEQDKUBCwJAIAQgAkcNAEGlASEQDL8CCwJAAkAgBC0AAEGuf2oOAwCoAQGoAQsgBEEBaiEEQZABIRAMpgILIARBAWohAUEEIRAMpAELAkAgBCACRw0AQaYBIRAMvgILAkACQAJAAkACQCAELQAAQb9/ag4VAKoBqgGqAaoBqgGqAaoBqgGqAaoBAaoBqgECqgGqAQOqAaoBBKoBCyAEQQFqIQRBiAEhEAyoAgsgBEEBaiEEQYkBIRAMpwILIARBAWohBEGKASEQDKYCCyAEQQFqIQRBjwEhEAylAgsgBEEBaiEEQZEBIRAMpAILAkAgBCACRw0AQacBIRAMvQILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQe3PgIAAai0AAEcNpQEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQacBIRAMvQILIABBADYCACAQQQFqIQFBESEQDKIBCwJAIAQgAkcNAEGoASEQDLwCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHCz4CAAGotAABHDaQBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGoASEQDLwCCyAAQQA2AgAgEEEBaiEBQSwhEAyhAQsCQCAEIAJHDQBBqQEhEAy7AgsgAiAEayAAKAIAIgFqIRQgBCABa0EEaiEQAkADQCAELQAAIAFBxc+AgABqLQAARw2jASABQQRGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBqQEhEAy7AgsgAEEANgIAIBBBAWohAUErIRAMoAELAkAgBCACRw0AQaoBIRAMugILIAIgBGsgACgCACIBaiEUIAQgAWtBAmohEAJAA0AgBC0AACABQcrPgIAAai0AAEcNogEgAUECRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQaoBIRAMugILIABBADYCACAQQQFqIQFBFCEQDJ8BCwJAIAQgAkcNAEGrASEQDLkCCwJAAkACQAJAIAQtAABBvn9qDg8AAQKkAaQBpAGkAaQBpAGkAaQBpAGkAaQBA6QBCyAEQQFqIQRBkwEhEAyiAgsgBEEBaiEEQZQBIRAMoQILIARBAWohBEGVASEQDKACCyAEQQFqIQRBlgEhEAyfAgsCQCAEIAJHDQBBrAEhEAy4AgsgBC0AAEHFAEcNnwEgBEEBaiEEDOABCwJAIAQgAkcNAEGtASEQDLcCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHNz4CAAGotAABHDZ8BIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEGtASEQDLcCCyAAQQA2AgAgEEEBaiEBQQ4hEAycAQsCQCAEIAJHDQBBrgEhEAy2AgsgBC0AAEHQAEcNnQEgBEEBaiEBQSUhEAybAQsCQCAEIAJHDQBBrwEhEAy1AgsgAiAEayAAKAIAIgFqIRQgBCABa0EIaiEQAkADQCAELQAAIAFB0M+AgABqLQAARw2dASABQQhGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBrwEhEAy1AgsgAEEANgIAIBBBAWohAUEqIRAMmgELAkAgBCACRw0AQbABIRAMtAILAkACQCAELQAAQat/ag4LAJ0BnQGdAZ0BnQGdAZ0BnQGdAQGdAQsgBEEBaiEEQZoBIRAMmwILIARBAWohBEGbASEQDJoCCwJAIAQgAkcNAEGxASEQDLMCCwJAAkAgBC0AAEG/f2oOFACcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAGcAZwBnAEBnAELIARBAWohBEGZASEQDJoCCyAEQQFqIQRBnAEhEAyZAgsCQCAEIAJHDQBBsgEhEAyyAgsgAiAEayAAKAIAIgFqIRQgBCABa0EDaiEQAkADQCAELQAAIAFB2c+AgABqLQAARw2aASABQQNGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBsgEhEAyyAgsgAEEANgIAIBBBAWohAUEhIRAMlwELAkAgBCACRw0AQbMBIRAMsQILIAIgBGsgACgCACIBaiEUIAQgAWtBBmohEAJAA0AgBC0AACABQd3PgIAAai0AAEcNmQEgAUEGRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbMBIRAMsQILIABBADYCACAQQQFqIQFBGiEQDJYBCwJAIAQgAkcNAEG0ASEQDLACCwJAAkACQCAELQAAQbt/ag4RAJoBmgGaAZoBmgGaAZoBmgGaAQGaAZoBmgGaAZoBApoBCyAEQQFqIQRBnQEhEAyYAgsgBEEBaiEEQZ4BIRAMlwILIARBAWohBEGfASEQDJYCCwJAIAQgAkcNAEG1ASEQDK8CCyACIARrIAAoAgAiAWohFCAEIAFrQQVqIRACQANAIAQtAAAgAUHkz4CAAGotAABHDZcBIAFBBUYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEG1ASEQDK8CCyAAQQA2AgAgEEEBaiEBQSghEAyUAQsCQCAEIAJHDQBBtgEhEAyuAgsgAiAEayAAKAIAIgFqIRQgBCABa0ECaiEQAkADQCAELQAAIAFB6s+AgABqLQAARw2WASABQQJGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBtgEhEAyuAgsgAEEANgIAIBBBAWohAUEHIRAMkwELAkAgBCACRw0AQbcBIRAMrQILAkACQCAELQAAQbt/ag4OAJYBlgGWAZYBlgGWAZYBlgGWAZYBlgGWAQGWAQsgBEEBaiEEQaEBIRAMlAILIARBAWohBEGiASEQDJMCCwJAIAQgAkcNAEG4ASEQDKwCCyACIARrIAAoAgAiAWohFCAEIAFrQQJqIRACQANAIAQtAAAgAUHtz4CAAGotAABHDZQBIAFBAkYNASABQQFqIQEgBEEBaiIEIAJHDQALIAAgFDYCAEG4ASEQDKwCCyAAQQA2AgAgEEEBaiEBQRIhEAyRAQsCQCAEIAJHDQBBuQEhEAyrAgsgAiAEayAAKAIAIgFqIRQgBCABa0EBaiEQAkADQCAELQAAIAFB8M+AgABqLQAARw2TASABQQFGDQEgAUEBaiEBIARBAWoiBCACRw0ACyAAIBQ2AgBBuQEhEAyrAgsgAEEANgIAIBBBAWohAUEgIRAMkAELAkAgBCACRw0AQboBIRAMqgILIAIgBGsgACgCACIBaiEUIAQgAWtBAWohEAJAA0AgBC0AACABQfLPgIAAai0AAEcNkgEgAUEBRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQboBIRAMqgILIABBADYCACAQQQFqIQFBDyEQDI8BCwJAIAQgAkcNAEG7ASEQDKkCCwJAAkAgBC0AAEG3f2oOBwCSAZIBkgGSAZIBAZIBCyAEQQFqIQRBpQEhEAyQAgsgBEEBaiEEQaYBIRAMjwILAkAgBCACRw0AQbwBIRAMqAILIAIgBGsgACgCACIBaiEUIAQgAWtBB2ohEAJAA0AgBC0AACABQfTPgIAAai0AAEcNkAEgAUEHRg0BIAFBAWohASAEQQFqIgQgAkcNAAsgACAUNgIAQbwBIRAMqAILIABBADYCACAQQQFqIQFBGyEQDI0BCwJAIAQgAkcNAEG9ASEQDKcCCwJAAkACQCAELQAAQb5/ag4SAJEBkQGRAZEBkQGRAZEBkQGRAQGRAZEBkQGRAZEBkQECkQELIARBAWohBEGkASEQDI8CCyAEQQFqIQRBpwEhEAyOAgsgBEEBaiEEQagBIRAMjQILAkAgBCACRw0AQb4BIRAMpgILIAQtAABBzgBHDY0BIARBAWohBAzPAQsCQCAEIAJHDQBBvwEhEAylAgsCQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAELQAAQb9/ag4VAAECA5wBBAUGnAGcAZwBBwgJCgucAQwNDg+cAQsgBEEBaiEBQegAIRAMmgILIARBAWohAUHpACEQDJkCCyAEQQFqIQFB7gAhEAyYAgsgBEEBaiEBQfIAIRAMlwILIARBAWohAUHzACEQDJYCCyAEQQFqIQFB9gAhEAyVAgsgBEEBaiEBQfcAIRAMlAILIARBAWohAUH6ACEQDJMCCyAEQQFqIQRBgwEhEAySAgsgBEEBaiEEQYQBIRAMkQILIARBAWohBEGFASEQDJACCyAEQQFqIQRBkgEhEAyPAgsgBEEBaiEEQZgBIRAMjgILIARBAWohBEGgASEQDI0CCyAEQQFqIQRBowEhEAyMAgsgBEEBaiEEQaoBIRAMiwILAkAgBCACRg0AIABBkICAgAA2AgggACAENgIEQasBIRAMiwILQcABIRAMowILIAAgBSACEKqAgIAAIgENiwEgBSEBDFwLAkAgBiACRg0AIAZBAWohBQyNAQtBwgEhEAyhAgsDQAJAIBAtAABBdmoOBIwBAACPAQALIBBBAWoiECACRw0AC0HDASEQDKACCwJAIAcgAkYNACAAQZGAgIAANgIIIAAgBzYCBCAHIQFBASEQDIcCC0HEASEQDJ8CCwJAIAcgAkcNAEHFASEQDJ8CCwJAAkAgBy0AAEF2ag4EAc4BzgEAzgELIAdBAWohBgyNAQsgB0EBaiEFDIkBCwJAIAcgAkcNAEHGASEQDJ4CCwJAAkAgBy0AAEF2ag4XAY8BjwEBjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BAI8BCyAHQQFqIQcLQbABIRAMhAILAkAgCCACRw0AQcgBIRAMnQILIAgtAABBIEcNjQEgAEEAOwEyIAhBAWohAUGzASEQDIMCCyABIRcCQANAIBciByACRg0BIActAABBUGpB/wFxIhBBCk8NzAECQCAALwEyIhRBmTNLDQAgACAUQQpsIhQ7ATIgEEH//wNzIBRB/v8DcUkNACAHQQFqIRcgACAUIBBqIhA7ATIgEEH//wNxQegHSQ0BCwtBACEQIABBADYCHCAAQcGJgIAANgIQIABBDTYCDCAAIAdBAWo2AhQMnAILQccBIRAMmwILIAAgCCACEK6AgIAAIhBFDcoBIBBBFUcNjAEgAEHIATYCHCAAIAg2AhQgAEHJl4CAADYCECAAQRU2AgxBACEQDJoCCwJAIAkgAkcNAEHMASEQDJoCC0EAIRRBASEXQQEhFkEAIRACQAJAAkACQAJAAkACQAJAAkAgCS0AAEFQag4KlgGVAQABAgMEBQYIlwELQQIhEAwGC0EDIRAMBQtBBCEQDAQLQQUhEAwDC0EGIRAMAgtBByEQDAELQQghEAtBACEXQQAhFkEAIRQMjgELQQkhEEEBIRRBACEXQQAhFgyNAQsCQCAKIAJHDQBBzgEhEAyZAgsgCi0AAEEuRw2OASAKQQFqIQkMygELIAsgAkcNjgFB0AEhEAyXAgsCQCALIAJGDQAgAEGOgICAADYCCCAAIAs2AgRBtwEhEAz+AQtB0QEhEAyWAgsCQCAEIAJHDQBB0gEhEAyWAgsgAiAEayAAKAIAIhBqIRQgBCAQa0EEaiELA0AgBC0AACAQQfzPgIAAai0AAEcNjgEgEEEERg3pASAQQQFqIRAgBEEBaiIEIAJHDQALIAAgFDYCAEHSASEQDJUCCyAAIAwgAhCsgICAACIBDY0BIAwhAQy4AQsCQCAEIAJHDQBB1AEhEAyUAgsgAiAEayAAKAIAIhBqIRQgBCAQa0EBaiEMA0AgBC0AACAQQYHQgIAAai0AAEcNjwEgEEEBRg2OASAQQQFqIRAgBEEBaiIEIAJHDQALIAAgFDYCAEHUASEQDJMCCwJAIAQgAkcNAEHWASEQDJMCCyACIARrIAAoAgAiEGohFCAEIBBrQQJqIQsDQCAELQAAIBBBg9CAgABqLQAARw2OASAQQQJGDZABIBBBAWohECAEQQFqIgQgAkcNAAsgACAUNgIAQdYBIRAMkgILAkAgBCACRw0AQdcBIRAMkgILAkACQCAELQAAQbt/ag4QAI8BjwGPAY8BjwGPAY8BjwGPAY8BjwGPAY8BjwEBjwELIARBAWohBEG7ASEQDPkBCyAEQQFqIQRBvAEhEAz4AQsCQCAEIAJHDQBB2AEhEAyRAgsgBC0AAEHIAEcNjAEgBEEBaiEEDMQBCwJAIAQgAkYNACAAQZCAgIAANgIIIAAgBDYCBEG+ASEQDPcBC0HZASEQDI8CCwJAIAQgAkcNAEHaASEQDI8CCyAELQAAQcgARg3DASAAQQE6ACgMuQELIABBAjoALyAAIAQgAhCmgICAACIQDY0BQcIBIRAM9AELIAAtAChBf2oOArcBuQG4AQsDQAJAIAQtAABBdmoOBACOAY4BAI4BCyAEQQFqIgQgAkcNAAtB3QEhEAyLAgsgAEEAOgAvIAAtAC1BBHFFDYQCCyAAQQA6AC8gAEEBOgA0IAEhAQyMAQsgEEEVRg3aASAAQQA2AhwgACABNgIUIABBp46AgAA2AhAgAEESNgIMQQAhEAyIAgsCQCAAIBAgAhC0gICAACIEDQAgECEBDIECCwJAIARBFUcNACAAQQM2AhwgACAQNgIUIABBsJiAgAA2AhAgAEEVNgIMQQAhEAyIAgsgAEEANgIcIAAgEDYCFCAAQaeOgIAANgIQIABBEjYCDEEAIRAMhwILIBBBFUYN1gEgAEEANgIcIAAgATYCFCAAQdqNgIAANgIQIABBFDYCDEEAIRAMhgILIAAoAgQhFyAAQQA2AgQgECARp2oiFiEBIAAgFyAQIBYgFBsiEBC1gICAACIURQ2NASAAQQc2AhwgACAQNgIUIAAgFDYCDEEAIRAMhQILIAAgAC8BMEGAAXI7ATAgASEBC0EqIRAM6gELIBBBFUYN0QEgAEEANgIcIAAgATYCFCAAQYOMgIAANgIQIABBEzYCDEEAIRAMggILIBBBFUYNzwEgAEEANgIcIAAgATYCFCAAQZqPgIAANgIQIABBIjYCDEEAIRAMgQILIAAoAgQhECAAQQA2AgQCQCAAIBAgARC3gICAACIQDQAgAUEBaiEBDI0BCyAAQQw2AhwgACAQNgIMIAAgAUEBajYCFEEAIRAMgAILIBBBFUYNzAEgAEEANgIcIAAgATYCFCAAQZqPgIAANgIQIABBIjYCDEEAIRAM/wELIAAoAgQhECAAQQA2AgQCQCAAIBAgARC3gICAACIQDQAgAUEBaiEBDIwBCyAAQQ02AhwgACAQNgIMIAAgAUEBajYCFEEAIRAM/gELIBBBFUYNyQEgAEEANgIcIAAgATYCFCAAQcaMgIAANgIQIABBIzYCDEEAIRAM/QELIAAoAgQhECAAQQA2AgQCQCAAIBAgARC5gICAACIQDQAgAUEBaiEBDIsBCyAAQQ42AhwgACAQNgIMIAAgAUEBajYCFEEAIRAM/AELIABBADYCHCAAIAE2AhQgAEHAlYCAADYCECAAQQI2AgxBACEQDPsBCyAQQRVGDcUBIABBADYCHCAAIAE2AhQgAEHGjICAADYCECAAQSM2AgxBACEQDPoBCyAAQRA2AhwgACABNgIUIAAgEDYCDEEAIRAM+QELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARC5gICAACIEDQAgAUEBaiEBDPEBCyAAQRE2AhwgACAENgIMIAAgAUEBajYCFEEAIRAM+AELIBBBFUYNwQEgAEEANgIcIAAgATYCFCAAQcaMgIAANgIQIABBIzYCDEEAIRAM9wELIAAoAgQhECAAQQA2AgQCQCAAIBAgARC5gICAACIQDQAgAUEBaiEBDIgBCyAAQRM2AhwgACAQNgIMIAAgAUEBajYCFEEAIRAM9gELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARC5gICAACIEDQAgAUEBaiEBDO0BCyAAQRQ2AhwgACAENgIMIAAgAUEBajYCFEEAIRAM9QELIBBBFUYNvQEgAEEANgIcIAAgATYCFCAAQZqPgIAANgIQIABBIjYCDEEAIRAM9AELIAAoAgQhECAAQQA2AgQCQCAAIBAgARC3gICAACIQDQAgAUEBaiEBDIYBCyAAQRY2AhwgACAQNgIMIAAgAUEBajYCFEEAIRAM8wELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARC3gICAACIEDQAgAUEBaiEBDOkBCyAAQRc2AhwgACAENgIMIAAgAUEBajYCFEEAIRAM8gELIABBADYCHCAAIAE2AhQgAEHNk4CAADYCECAAQQw2AgxBACEQDPEBC0IBIRELIBBBAWohAQJAIAApAyAiEkL//////////w9WDQAgACASQgSGIBGENwMgIAEhAQyEAQsgAEEANgIcIAAgATYCFCAAQa2JgIAANgIQIABBDDYCDEEAIRAM7wELIABBADYCHCAAIBA2AhQgAEHNk4CAADYCECAAQQw2AgxBACEQDO4BCyAAKAIEIRcgAEEANgIEIBAgEadqIhYhASAAIBcgECAWIBQbIhAQtYCAgAAiFEUNcyAAQQU2AhwgACAQNgIUIAAgFDYCDEEAIRAM7QELIABBADYCHCAAIBA2AhQgAEGqnICAADYCECAAQQ82AgxBACEQDOwBCyAAIBAgAhC0gICAACIBDQEgECEBC0EOIRAM0QELAkAgAUEVRw0AIABBAjYCHCAAIBA2AhQgAEGwmICAADYCECAAQRU2AgxBACEQDOoBCyAAQQA2AhwgACAQNgIUIABBp46AgAA2AhAgAEESNgIMQQAhEAzpAQsgAUEBaiEQAkAgAC8BMCIBQYABcUUNAAJAIAAgECACELuAgIAAIgENACAQIQEMcAsgAUEVRw26ASAAQQU2AhwgACAQNgIUIABB+ZeAgAA2AhAgAEEVNgIMQQAhEAzpAQsCQCABQaAEcUGgBEcNACAALQAtQQJxDQAgAEEANgIcIAAgEDYCFCAAQZaTgIAANgIQIABBBDYCDEEAIRAM6QELIAAgECACEL2AgIAAGiAQIQECQAJAAkACQAJAIAAgECACELOAgIAADhYCAQAEBAQEBAQEBAQEBAQEBAQEBAQDBAsgAEEBOgAuCyAAIAAvATBBwAByOwEwIBAhAQtBJiEQDNEBCyAAQSM2AhwgACAQNgIUIABBpZaAgAA2AhAgAEEVNgIMQQAhEAzpAQsgAEEANgIcIAAgEDYCFCAAQdWLgIAANgIQIABBETYCDEEAIRAM6AELIAAtAC1BAXFFDQFBwwEhEAzOAQsCQCANIAJGDQADQAJAIA0tAABBIEYNACANIQEMxAELIA1BAWoiDSACRw0AC0ElIRAM5wELQSUhEAzmAQsgACgCBCEEIABBADYCBCAAIAQgDRCvgICAACIERQ2tASAAQSY2AhwgACAENgIMIAAgDUEBajYCFEEAIRAM5QELIBBBFUYNqwEgAEEANgIcIAAgATYCFCAAQf2NgIAANgIQIABBHTYCDEEAIRAM5AELIABBJzYCHCAAIAE2AhQgACAQNgIMQQAhEAzjAQsgECEBQQEhFAJAAkACQAJAAkACQAJAIAAtACxBfmoOBwYFBQMBAgAFCyAAIAAvATBBCHI7ATAMAwtBAiEUDAELQQQhFAsgAEEBOgAsIAAgAC8BMCAUcjsBMAsgECEBC0ErIRAMygELIABBADYCHCAAIBA2AhQgAEGrkoCAADYCECAAQQs2AgxBACEQDOIBCyAAQQA2AhwgACABNgIUIABB4Y+AgAA2AhAgAEEKNgIMQQAhEAzhAQsgAEEAOgAsIBAhAQy9AQsgECEBQQEhFAJAAkACQAJAAkAgAC0ALEF7ag4EAwECAAULIAAgAC8BMEEIcjsBMAwDC0ECIRQMAQtBBCEUCyAAQQE6ACwgACAALwEwIBRyOwEwCyAQIQELQSkhEAzFAQsgAEEANgIcIAAgATYCFCAAQfCUgIAANgIQIABBAzYCDEEAIRAM3QELAkAgDi0AAEENRw0AIAAoAgQhASAAQQA2AgQCQCAAIAEgDhCxgICAACIBDQAgDkEBaiEBDHULIABBLDYCHCAAIAE2AgwgACAOQQFqNgIUQQAhEAzdAQsgAC0ALUEBcUUNAUHEASEQDMMBCwJAIA4gAkcNAEEtIRAM3AELAkACQANAAkAgDi0AAEF2ag4EAgAAAwALIA5BAWoiDiACRw0AC0EtIRAM3QELIAAoAgQhASAAQQA2AgQCQCAAIAEgDhCxgICAACIBDQAgDiEBDHQLIABBLDYCHCAAIA42AhQgACABNgIMQQAhEAzcAQsgACgCBCEBIABBADYCBAJAIAAgASAOELGAgIAAIgENACAOQQFqIQEMcwsgAEEsNgIcIAAgATYCDCAAIA5BAWo2AhRBACEQDNsBCyAAKAIEIQQgAEEANgIEIAAgBCAOELGAgIAAIgQNoAEgDiEBDM4BCyAQQSxHDQEgAUEBaiEQQQEhAQJAAkACQAJAAkAgAC0ALEF7ag4EAwECBAALIBAhAQwEC0ECIQEMAQtBBCEBCyAAQQE6ACwgACAALwEwIAFyOwEwIBAhAQwBCyAAIAAvATBBCHI7ATAgECEBC0E5IRAMvwELIABBADoALCABIQELQTQhEAy9AQsgACAALwEwQSByOwEwIAEhAQwCCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQsYCAgAAiBA0AIAEhAQzHAQsgAEE3NgIcIAAgATYCFCAAIAQ2AgxBACEQDNQBCyAAQQg6ACwgASEBC0EwIRAMuQELAkAgAC0AKEEBRg0AIAEhAQwECyAALQAtQQhxRQ2TASABIQEMAwsgAC0AMEEgcQ2UAUHFASEQDLcBCwJAIA8gAkYNAAJAA0ACQCAPLQAAQVBqIgFB/wFxQQpJDQAgDyEBQTUhEAy6AQsgACkDICIRQpmz5syZs+bMGVYNASAAIBFCCn4iETcDICARIAGtQv8BgyISQn+FVg0BIAAgESASfDcDICAPQQFqIg8gAkcNAAtBOSEQDNEBCyAAKAIEIQIgAEEANgIEIAAgAiAPQQFqIgQQsYCAgAAiAg2VASAEIQEMwwELQTkhEAzPAQsCQCAALwEwIgFBCHFFDQAgAC0AKEEBRw0AIAAtAC1BCHFFDZABCyAAIAFB9/sDcUGABHI7ATAgDyEBC0E3IRAMtAELIAAgAC8BMEEQcjsBMAyrAQsgEEEVRg2LASAAQQA2AhwgACABNgIUIABB8I6AgAA2AhAgAEEcNgIMQQAhEAzLAQsgAEHDADYCHCAAIAE2AgwgACANQQFqNgIUQQAhEAzKAQsCQCABLQAAQTpHDQAgACgCBCEQIABBADYCBAJAIAAgECABEK+AgIAAIhANACABQQFqIQEMYwsgAEHDADYCHCAAIBA2AgwgACABQQFqNgIUQQAhEAzKAQsgAEEANgIcIAAgATYCFCAAQbGRgIAANgIQIABBCjYCDEEAIRAMyQELIABBADYCHCAAIAE2AhQgAEGgmYCAADYCECAAQR42AgxBACEQDMgBCyAAQQA2AgALIABBgBI7ASogACAXQQFqIgEgAhCogICAACIQDQEgASEBC0HHACEQDKwBCyAQQRVHDYMBIABB0QA2AhwgACABNgIUIABB45eAgAA2AhAgAEEVNgIMQQAhEAzEAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMXgsgAEHSADYCHCAAIAE2AhQgACAQNgIMQQAhEAzDAQsgAEEANgIcIAAgFDYCFCAAQcGogIAANgIQIABBBzYCDCAAQQA2AgBBACEQDMIBCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxdCyAAQdMANgIcIAAgATYCFCAAIBA2AgxBACEQDMEBC0EAIRAgAEEANgIcIAAgATYCFCAAQYCRgIAANgIQIABBCTYCDAzAAQsgEEEVRg19IABBADYCHCAAIAE2AhQgAEGUjYCAADYCECAAQSE2AgxBACEQDL8BC0EBIRZBACEXQQAhFEEBIRALIAAgEDoAKyABQQFqIQECQAJAIAAtAC1BEHENAAJAAkACQCAALQAqDgMBAAIECyAWRQ0DDAILIBQNAQwCCyAXRQ0BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQrYCAgAAiEA0AIAEhAQxcCyAAQdgANgIcIAAgATYCFCAAIBA2AgxBACEQDL4BCyAAKAIEIQQgAEEANgIEAkAgACAEIAEQrYCAgAAiBA0AIAEhAQytAQsgAEHZADYCHCAAIAE2AhQgACAENgIMQQAhEAy9AQsgACgCBCEEIABBADYCBAJAIAAgBCABEK2AgIAAIgQNACABIQEMqwELIABB2gA2AhwgACABNgIUIAAgBDYCDEEAIRAMvAELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARCtgICAACIEDQAgASEBDKkBCyAAQdwANgIcIAAgATYCFCAAIAQ2AgxBACEQDLsBCwJAIAEtAABBUGoiEEH/AXFBCk8NACAAIBA6ACogAUEBaiEBQc8AIRAMogELIAAoAgQhBCAAQQA2AgQCQCAAIAQgARCtgICAACIEDQAgASEBDKcBCyAAQd4ANgIcIAAgATYCFCAAIAQ2AgxBACEQDLoBCyAAQQA2AgAgF0EBaiEBAkAgAC0AKUEjTw0AIAEhAQxZCyAAQQA2AhwgACABNgIUIABB04mAgAA2AhAgAEEINgIMQQAhEAy5AQsgAEEANgIAC0EAIRAgAEEANgIcIAAgATYCFCAAQZCzgIAANgIQIABBCDYCDAy3AQsgAEEANgIAIBdBAWohAQJAIAAtAClBIUcNACABIQEMVgsgAEEANgIcIAAgATYCFCAAQZuKgIAANgIQIABBCDYCDEEAIRAMtgELIABBADYCACAXQQFqIQECQCAALQApIhBBXWpBC08NACABIQEMVQsCQCAQQQZLDQBBASAQdEHKAHFFDQAgASEBDFULQQAhECAAQQA2AhwgACABNgIUIABB94mAgAA2AhAgAEEINgIMDLUBCyAQQRVGDXEgAEEANgIcIAAgATYCFCAAQbmNgIAANgIQIABBGjYCDEEAIRAMtAELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDFQLIABB5QA2AhwgACABNgIUIAAgEDYCDEEAIRAMswELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDE0LIABB0gA2AhwgACABNgIUIAAgEDYCDEEAIRAMsgELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDE0LIABB0wA2AhwgACABNgIUIAAgEDYCDEEAIRAMsQELIAAoAgQhECAAQQA2AgQCQCAAIBAgARCngICAACIQDQAgASEBDFELIABB5QA2AhwgACABNgIUIAAgEDYCDEEAIRAMsAELIABBADYCHCAAIAE2AhQgAEHGioCAADYCECAAQQc2AgxBACEQDK8BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxJCyAAQdIANgIcIAAgATYCFCAAIBA2AgxBACEQDK4BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxJCyAAQdMANgIcIAAgATYCFCAAIBA2AgxBACEQDK0BCyAAKAIEIRAgAEEANgIEAkAgACAQIAEQp4CAgAAiEA0AIAEhAQxNCyAAQeUANgIcIAAgATYCFCAAIBA2AgxBACEQDKwBCyAAQQA2AhwgACABNgIUIABB3IiAgAA2AhAgAEEHNgIMQQAhEAyrAQsgEEE/Rw0BIAFBAWohAQtBBSEQDJABC0EAIRAgAEEANgIcIAAgATYCFCAAQf2SgIAANgIQIABBBzYCDAyoAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMQgsgAEHSADYCHCAAIAE2AhQgACAQNgIMQQAhEAynAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMQgsgAEHTADYCHCAAIAE2AhQgACAQNgIMQQAhEAymAQsgACgCBCEQIABBADYCBAJAIAAgECABEKeAgIAAIhANACABIQEMRgsgAEHlADYCHCAAIAE2AhQgACAQNgIMQQAhEAylAQsgACgCBCEBIABBADYCBAJAIAAgASAUEKeAgIAAIgENACAUIQEMPwsgAEHSADYCHCAAIBQ2AhQgACABNgIMQQAhEAykAQsgACgCBCEBIABBADYCBAJAIAAgASAUEKeAgIAAIgENACAUIQEMPwsgAEHTADYCHCAAIBQ2AhQgACABNgIMQQAhEAyjAQsgACgCBCEBIABBADYCBAJAIAAgASAUEKeAgIAAIgENACAUIQEMQwsgAEHlADYCHCAAIBQ2AhQgACABNgIMQQAhEAyiAQsgAEEANgIcIAAgFDYCFCAAQcOPgIAANgIQIABBBzYCDEEAIRAMoQELIABBADYCHCAAIAE2AhQgAEHDj4CAADYCECAAQQc2AgxBACEQDKABC0EAIRAgAEEANgIcIAAgFDYCFCAAQYycgIAANgIQIABBBzYCDAyfAQsgAEEANgIcIAAgFDYCFCAAQYycgIAANgIQIABBBzYCDEEAIRAMngELIABBADYCHCAAIBQ2AhQgAEH+kYCAADYCECAAQQc2AgxBACEQDJ0BCyAAQQA2AhwgACABNgIUIABBjpuAgAA2AhAgAEEGNgIMQQAhEAycAQsgEEEVRg1XIABBADYCHCAAIAE2AhQgAEHMjoCAADYCECAAQSA2AgxBACEQDJsBCyAAQQA2AgAgEEEBaiEBQSQhEAsgACAQOgApIAAoAgQhECAAQQA2AgQgACAQIAEQq4CAgAAiEA1UIAEhAQw+CyAAQQA2AgALQQAhECAAQQA2AhwgACAENgIUIABB8ZuAgAA2AhAgAEEGNgIMDJcBCyABQRVGDVAgAEEANgIcIAAgBTYCFCAAQfCMgIAANgIQIABBGzYCDEEAIRAMlgELIAAoAgQhBSAAQQA2AgQgACAFIBAQqYCAgAAiBQ0BIBBBAWohBQtBrQEhEAx7CyAAQcEBNgIcIAAgBTYCDCAAIBBBAWo2AhRBACEQDJMBCyAAKAIEIQYgAEEANgIEIAAgBiAQEKmAgIAAIgYNASAQQQFqIQYLQa4BIRAMeAsgAEHCATYCHCAAIAY2AgwgACAQQQFqNgIUQQAhEAyQAQsgAEEANgIcIAAgBzYCFCAAQZeLgIAANgIQIABBDTYCDEEAIRAMjwELIABBADYCHCAAIAg2AhQgAEHjkICAADYCECAAQQk2AgxBACEQDI4BCyAAQQA2AhwgACAINgIUIABBlI2AgAA2AhAgAEEhNgIMQQAhEAyNAQtBASEWQQAhF0EAIRRBASEQCyAAIBA6ACsgCUEBaiEIAkACQCAALQAtQRBxDQACQAJAAkAgAC0AKg4DAQACBAsgFkUNAwwCCyAUDQEMAgsgF0UNAQsgACgCBCEQIABBADYCBCAAIBAgCBCtgICAACIQRQ09IABByQE2AhwgACAINgIUIAAgEDYCDEEAIRAMjAELIAAoAgQhBCAAQQA2AgQgACAEIAgQrYCAgAAiBEUNdiAAQcoBNgIcIAAgCDYCFCAAIAQ2AgxBACEQDIsBCyAAKAIEIQQgAEEANgIEIAAgBCAJEK2AgIAAIgRFDXQgAEHLATYCHCAAIAk2AhQgACAENgIMQQAhEAyKAQsgACgCBCEEIABBADYCBCAAIAQgChCtgICAACIERQ1yIABBzQE2AhwgACAKNgIUIAAgBDYCDEEAIRAMiQELAkAgCy0AAEFQaiIQQf8BcUEKTw0AIAAgEDoAKiALQQFqIQpBtgEhEAxwCyAAKAIEIQQgAEEANgIEIAAgBCALEK2AgIAAIgRFDXAgAEHPATYCHCAAIAs2AhQgACAENgIMQQAhEAyIAQsgAEEANgIcIAAgBDYCFCAAQZCzgIAANgIQIABBCDYCDCAAQQA2AgBBACEQDIcBCyABQRVGDT8gAEEANgIcIAAgDDYCFCAAQcyOgIAANgIQIABBIDYCDEEAIRAMhgELIABBgQQ7ASggACgCBCEQIABCADcDACAAIBAgDEEBaiIMEKuAgIAAIhBFDTggAEHTATYCHCAAIAw2AhQgACAQNgIMQQAhEAyFAQsgAEEANgIAC0EAIRAgAEEANgIcIAAgBDYCFCAAQdibgIAANgIQIABBCDYCDAyDAQsgACgCBCEQIABCADcDACAAIBAgC0EBaiILEKuAgIAAIhANAUHGASEQDGkLIABBAjoAKAxVCyAAQdUBNgIcIAAgCzYCFCAAIBA2AgxBACEQDIABCyAQQRVGDTcgAEEANgIcIAAgBDYCFCAAQaSMgIAANgIQIABBEDYCDEEAIRAMfwsgAC0ANEEBRw00IAAgBCACELyAgIAAIhBFDTQgEEEVRw01IABB3AE2AhwgACAENgIUIABB1ZaAgAA2AhAgAEEVNgIMQQAhEAx+C0EAIRAgAEEANgIcIABBr4uAgAA2AhAgAEECNgIMIAAgFEEBajYCFAx9C0EAIRAMYwtBAiEQDGILQQ0hEAxhC0EPIRAMYAtBJSEQDF8LQRMhEAxeC0EVIRAMXQtBFiEQDFwLQRchEAxbC0EYIRAMWgtBGSEQDFkLQRohEAxYC0EbIRAMVwtBHCEQDFYLQR0hEAxVC0EfIRAMVAtBISEQDFMLQSMhEAxSC0HGACEQDFELQS4hEAxQC0EvIRAMTwtBOyEQDE4LQT0hEAxNC0HIACEQDEwLQckAIRAMSwtBywAhEAxKC0HMACEQDEkLQc4AIRAMSAtB0QAhEAxHC0HVACEQDEYLQdgAIRAMRQtB2QAhEAxEC0HbACEQDEMLQeQAIRAMQgtB5QAhEAxBC0HxACEQDEALQfQAIRAMPwtBjQEhEAw+C0GXASEQDD0LQakBIRAMPAtBrAEhEAw7C0HAASEQDDoLQbkBIRAMOQtBrwEhEAw4C0GxASEQDDcLQbIBIRAMNgtBtAEhEAw1C0G1ASEQDDQLQboBIRAMMwtBvQEhEAwyC0G/ASEQDDELQcEBIRAMMAsgAEEANgIcIAAgBDYCFCAAQemLgIAANgIQIABBHzYCDEEAIRAMSAsgAEHbATYCHCAAIAQ2AhQgAEH6loCAADYCECAAQRU2AgxBACEQDEcLIABB+AA2AhwgACAMNgIUIABBypiAgAA2AhAgAEEVNgIMQQAhEAxGCyAAQdEANgIcIAAgBTYCFCAAQbCXgIAANgIQIABBFTYCDEEAIRAMRQsgAEH5ADYCHCAAIAE2AhQgACAQNgIMQQAhEAxECyAAQfgANgIcIAAgATYCFCAAQcqYgIAANgIQIABBFTYCDEEAIRAMQwsgAEHkADYCHCAAIAE2AhQgAEHjl4CAADYCECAAQRU2AgxBACEQDEILIABB1wA2AhwgACABNgIUIABByZeAgAA2AhAgAEEVNgIMQQAhEAxBCyAAQQA2AhwgACABNgIUIABBuY2AgAA2AhAgAEEaNgIMQQAhEAxACyAAQcIANgIcIAAgATYCFCAAQeOYgIAANgIQIABBFTYCDEEAIRAMPwsgAEEANgIEIAAgDyAPELGAgIAAIgRFDQEgAEE6NgIcIAAgBDYCDCAAIA9BAWo2AhRBACEQDD4LIAAoAgQhBCAAQQA2AgQCQCAAIAQgARCxgICAACIERQ0AIABBOzYCHCAAIAQ2AgwgACABQQFqNgIUQQAhEAw+CyABQQFqIQEMLQsgD0EBaiEBDC0LIABBADYCHCAAIA82AhQgAEHkkoCAADYCECAAQQQ2AgxBACEQDDsLIABBNjYCHCAAIAQ2AhQgACACNgIMQQAhEAw6CyAAQS42AhwgACAONgIUIAAgBDYCDEEAIRAMOQsgAEHQADYCHCAAIAE2AhQgAEGRmICAADYCECAAQRU2AgxBACEQDDgLIA1BAWohAQwsCyAAQRU2AhwgACABNgIUIABBgpmAgAA2AhAgAEEVNgIMQQAhEAw2CyAAQRs2AhwgACABNgIUIABBkZeAgAA2AhAgAEEVNgIMQQAhEAw1CyAAQQ82AhwgACABNgIUIABBkZeAgAA2AhAgAEEVNgIMQQAhEAw0CyAAQQs2AhwgACABNgIUIABBkZeAgAA2AhAgAEEVNgIMQQAhEAwzCyAAQRo2AhwgACABNgIUIABBgpmAgAA2AhAgAEEVNgIMQQAhEAwyCyAAQQs2AhwgACABNgIUIABBgpmAgAA2AhAgAEEVNgIMQQAhEAwxCyAAQQo2AhwgACABNgIUIABB5JaAgAA2AhAgAEEVNgIMQQAhEAwwCyAAQR42AhwgACABNgIUIABB+ZeAgAA2AhAgAEEVNgIMQQAhEAwvCyAAQQA2AhwgACAQNgIUIABB2o2AgAA2AhAgAEEUNgIMQQAhEAwuCyAAQQQ2AhwgACABNgIUIABBsJiAgAA2AhAgAEEVNgIMQQAhEAwtCyAAQQA2AgAgC0EBaiELC0G4ASEQDBILIABBADYCACAQQQFqIQFB9QAhEAwRCyABIQECQCAALQApQQVHDQBB4wAhEAwRC0HiACEQDBALQQAhECAAQQA2AhwgAEHkkYCAADYCECAAQQc2AgwgACAUQQFqNgIUDCgLIABBADYCACAXQQFqIQFBwAAhEAwOC0EBIQELIAAgAToALCAAQQA2AgAgF0EBaiEBC0EoIRAMCwsgASEBC0E4IRAMCQsCQCABIg8gAkYNAANAAkAgDy0AAEGAvoCAAGotAAAiAUEBRg0AIAFBAkcNAyAPQQFqIQEMBAsgD0EBaiIPIAJHDQALQT4hEAwiC0E+IRAMIQsgAEEAOgAsIA8hAQwBC0ELIRAMBgtBOiEQDAULIAFBAWohAUEtIRAMBAsgACABOgAsIABBADYCACAWQQFqIQFBDCEQDAMLIABBADYCACAXQQFqIQFBCiEQDAILIABBADYCAAsgAEEAOgAsIA0hAUEJIRAMAAsLQQAhECAAQQA2AhwgACALNgIUIABBzZCAgAA2AhAgAEEJNgIMDBcLQQAhECAAQQA2AhwgACAKNgIUIABB6YqAgAA2AhAgAEEJNgIMDBYLQQAhECAAQQA2AhwgACAJNgIUIABBt5CAgAA2AhAgAEEJNgIMDBULQQAhECAAQQA2AhwgACAINgIUIABBnJGAgAA2AhAgAEEJNgIMDBQLQQAhECAAQQA2AhwgACABNgIUIABBzZCAgAA2AhAgAEEJNgIMDBMLQQAhECAAQQA2AhwgACABNgIUIABB6YqAgAA2AhAgAEEJNgIMDBILQQAhECAAQQA2AhwgACABNgIUIABBt5CAgAA2AhAgAEEJNgIMDBELQQAhECAAQQA2AhwgACABNgIUIABBnJGAgAA2AhAgAEEJNgIMDBALQQAhECAAQQA2AhwgACABNgIUIABBl5WAgAA2AhAgAEEPNgIMDA8LQQAhECAAQQA2AhwgACABNgIUIABBl5WAgAA2AhAgAEEPNgIMDA4LQQAhECAAQQA2AhwgACABNgIUIABBwJKAgAA2AhAgAEELNgIMDA0LQQAhECAAQQA2AhwgACABNgIUIABBlYmAgAA2AhAgAEELNgIMDAwLQQAhECAAQQA2AhwgACABNgIUIABB4Y+AgAA2AhAgAEEKNgIMDAsLQQAhECAAQQA2AhwgACABNgIUIABB+4+AgAA2AhAgAEEKNgIMDAoLQQAhECAAQQA2AhwgACABNgIUIABB8ZmAgAA2AhAgAEECNgIMDAkLQQAhECAAQQA2AhwgACABNgIUIABBxJSAgAA2AhAgAEECNgIMDAgLQQAhECAAQQA2AhwgACABNgIUIABB8pWAgAA2AhAgAEECNgIMDAcLIABBAjYCHCAAIAE2AhQgAEGcmoCAADYCECAAQRY2AgxBACEQDAYLQQEhEAwFC0HUACEQIAEiBCACRg0EIANBCGogACAEIAJB2MKAgABBChDFgICAACADKAIMIQQgAygCCA4DAQQCAAsQyoCAgAAACyAAQQA2AhwgAEG1moCAADYCECAAQRc2AgwgACAEQQFqNgIUQQAhEAwCCyAAQQA2AhwgACAENgIUIABBypqAgAA2AhAgAEEJNgIMQQAhEAwBCwJAIAEiBCACRw0AQSIhEAwBCyAAQYmAgIAANgIIIAAgBDYCBEEhIRALIANBEGokgICAgAAgEAuvAQECfyABKAIAIQYCQAJAIAIgA0YNACAEIAZqIQQgBiADaiACayEHIAIgBkF/cyAFaiIGaiEFA0ACQCACLQAAIAQtAABGDQBBAiEEDAMLAkAgBg0AQQAhBCAFIQIMAwsgBkF/aiEGIARBAWohBCACQQFqIgIgA0cNAAsgByEGIAMhAgsgAEEBNgIAIAEgBjYCACAAIAI2AgQPCyABQQA2AgAgACAENgIAIAAgAjYCBAsKACAAEMeAgIAAC/I2AQt/I4CAgIAAQRBrIgEkgICAgAACQEEAKAKg0ICAAA0AQQAQy4CAgABBgNSEgABrIgJB2QBJDQBBACEDAkBBACgC4NOAgAAiBA0AQQBCfzcC7NOAgABBAEKAgISAgIDAADcC5NOAgABBACABQQhqQXBxQdiq1aoFcyIENgLg04CAAEEAQQA2AvTTgIAAQQBBADYCxNOAgAALQQAgAjYCzNOAgABBAEGA1ISAADYCyNOAgABBAEGA1ISAADYCmNCAgABBACAENgKs0ICAAEEAQX82AqjQgIAAA0AgA0HE0ICAAGogA0G40ICAAGoiBDYCACAEIANBsNCAgABqIgU2AgAgA0G80ICAAGogBTYCACADQczQgIAAaiADQcDQgIAAaiIFNgIAIAUgBDYCACADQdTQgIAAaiADQcjQgIAAaiIENgIAIAQgBTYCACADQdDQgIAAaiAENgIAIANBIGoiA0GAAkcNAAtBgNSEgABBeEGA1ISAAGtBD3FBAEGA1ISAAEEIakEPcRsiA2oiBEEEaiACQUhqIgUgA2siA0EBcjYCAEEAQQAoAvDTgIAANgKk0ICAAEEAIAM2ApTQgIAAQQAgBDYCoNCAgABBgNSEgAAgBWpBODYCBAsCQAJAAkACQAJAAkACQAJAAkACQAJAAkAgAEHsAUsNAAJAQQAoAojQgIAAIgZBECAAQRNqQXBxIABBC0kbIgJBA3YiBHYiA0EDcUUNAAJAAkAgA0EBcSAEckEBcyIFQQN0IgRBsNCAgABqIgMgBEG40ICAAGooAgAiBCgCCCICRw0AQQAgBkF+IAV3cTYCiNCAgAAMAQsgAyACNgIIIAIgAzYCDAsgBEEIaiEDIAQgBUEDdCIFQQNyNgIEIAQgBWoiBCAEKAIEQQFyNgIEDAwLIAJBACgCkNCAgAAiB00NAQJAIANFDQACQAJAIAMgBHRBAiAEdCIDQQAgA2tycSIDQQAgA2txQX9qIgMgA0EMdkEQcSIDdiIEQQV2QQhxIgUgA3IgBCAFdiIDQQJ2QQRxIgRyIAMgBHYiA0EBdkECcSIEciADIAR2IgNBAXZBAXEiBHIgAyAEdmoiBEEDdCIDQbDQgIAAaiIFIANBuNCAgABqKAIAIgMoAggiAEcNAEEAIAZBfiAEd3EiBjYCiNCAgAAMAQsgBSAANgIIIAAgBTYCDAsgAyACQQNyNgIEIAMgBEEDdCIEaiAEIAJrIgU2AgAgAyACaiIAIAVBAXI2AgQCQCAHRQ0AIAdBeHFBsNCAgABqIQJBACgCnNCAgAAhBAJAAkAgBkEBIAdBA3Z0IghxDQBBACAGIAhyNgKI0ICAACACIQgMAQsgAigCCCEICyAIIAQ2AgwgAiAENgIIIAQgAjYCDCAEIAg2AggLIANBCGohA0EAIAA2ApzQgIAAQQAgBTYCkNCAgAAMDAtBACgCjNCAgAAiCUUNASAJQQAgCWtxQX9qIgMgA0EMdkEQcSIDdiIEQQV2QQhxIgUgA3IgBCAFdiIDQQJ2QQRxIgRyIAMgBHYiA0EBdkECcSIEciADIAR2IgNBAXZBAXEiBHIgAyAEdmpBAnRBuNKAgABqKAIAIgAoAgRBeHEgAmshBCAAIQUCQANAAkAgBSgCECIDDQAgBUEUaigCACIDRQ0CCyADKAIEQXhxIAJrIgUgBCAFIARJIgUbIQQgAyAAIAUbIQAgAyEFDAALCyAAKAIYIQoCQCAAKAIMIgggAEYNACAAKAIIIgNBACgCmNCAgABJGiAIIAM2AgggAyAINgIMDAsLAkAgAEEUaiIFKAIAIgMNACAAKAIQIgNFDQMgAEEQaiEFCwNAIAUhCyADIghBFGoiBSgCACIDDQAgCEEQaiEFIAgoAhAiAw0ACyALQQA2AgAMCgtBfyECIABBv39LDQAgAEETaiIDQXBxIQJBACgCjNCAgAAiB0UNAEEAIQsCQCACQYACSQ0AQR8hCyACQf///wdLDQAgA0EIdiIDIANBgP4/akEQdkEIcSIDdCIEIARBgOAfakEQdkEEcSIEdCIFIAVBgIAPakEQdkECcSIFdEEPdiADIARyIAVyayIDQQF0IAIgA0EVanZBAXFyQRxqIQsLQQAgAmshBAJAAkACQAJAIAtBAnRBuNKAgABqKAIAIgUNAEEAIQNBACEIDAELQQAhAyACQQBBGSALQQF2ayALQR9GG3QhAEEAIQgDQAJAIAUoAgRBeHEgAmsiBiAETw0AIAYhBCAFIQggBg0AQQAhBCAFIQggBSEDDAMLIAMgBUEUaigCACIGIAYgBSAAQR12QQRxakEQaigCACIFRhsgAyAGGyEDIABBAXQhACAFDQALCwJAIAMgCHINAEEAIQhBAiALdCIDQQAgA2tyIAdxIgNFDQMgA0EAIANrcUF/aiIDIANBDHZBEHEiA3YiBUEFdkEIcSIAIANyIAUgAHYiA0ECdkEEcSIFciADIAV2IgNBAXZBAnEiBXIgAyAFdiIDQQF2QQFxIgVyIAMgBXZqQQJ0QbjSgIAAaigCACEDCyADRQ0BCwNAIAMoAgRBeHEgAmsiBiAESSEAAkAgAygCECIFDQAgA0EUaigCACEFCyAGIAQgABshBCADIAggABshCCAFIQMgBQ0ACwsgCEUNACAEQQAoApDQgIAAIAJrTw0AIAgoAhghCwJAIAgoAgwiACAIRg0AIAgoAggiA0EAKAKY0ICAAEkaIAAgAzYCCCADIAA2AgwMCQsCQCAIQRRqIgUoAgAiAw0AIAgoAhAiA0UNAyAIQRBqIQULA0AgBSEGIAMiAEEUaiIFKAIAIgMNACAAQRBqIQUgACgCECIDDQALIAZBADYCAAwICwJAQQAoApDQgIAAIgMgAkkNAEEAKAKc0ICAACEEAkACQCADIAJrIgVBEEkNACAEIAJqIgAgBUEBcjYCBEEAIAU2ApDQgIAAQQAgADYCnNCAgAAgBCADaiAFNgIAIAQgAkEDcjYCBAwBCyAEIANBA3I2AgQgBCADaiIDIAMoAgRBAXI2AgRBAEEANgKc0ICAAEEAQQA2ApDQgIAACyAEQQhqIQMMCgsCQEEAKAKU0ICAACIAIAJNDQBBACgCoNCAgAAiAyACaiIEIAAgAmsiBUEBcjYCBEEAIAU2ApTQgIAAQQAgBDYCoNCAgAAgAyACQQNyNgIEIANBCGohAwwKCwJAAkBBACgC4NOAgABFDQBBACgC6NOAgAAhBAwBC0EAQn83AuzTgIAAQQBCgICEgICAwAA3AuTTgIAAQQAgAUEMakFwcUHYqtWqBXM2AuDTgIAAQQBBADYC9NOAgABBAEEANgLE04CAAEGAgAQhBAtBACEDAkAgBCACQccAaiIHaiIGQQAgBGsiC3EiCCACSw0AQQBBMDYC+NOAgAAMCgsCQEEAKALA04CAACIDRQ0AAkBBACgCuNOAgAAiBCAIaiIFIARNDQAgBSADTQ0BC0EAIQNBAEEwNgL404CAAAwKC0EALQDE04CAAEEEcQ0EAkACQAJAQQAoAqDQgIAAIgRFDQBByNOAgAAhAwNAAkAgAygCACIFIARLDQAgBSADKAIEaiAESw0DCyADKAIIIgMNAAsLQQAQy4CAgAAiAEF/Rg0FIAghBgJAQQAoAuTTgIAAIgNBf2oiBCAAcUUNACAIIABrIAQgAGpBACADa3FqIQYLIAYgAk0NBSAGQf7///8HSw0FAkBBACgCwNOAgAAiA0UNAEEAKAK404CAACIEIAZqIgUgBE0NBiAFIANLDQYLIAYQy4CAgAAiAyAARw0BDAcLIAYgAGsgC3EiBkH+////B0sNBCAGEMuAgIAAIgAgAygCACADKAIEakYNAyAAIQMLAkAgA0F/Rg0AIAJByABqIAZNDQACQCAHIAZrQQAoAujTgIAAIgRqQQAgBGtxIgRB/v///wdNDQAgAyEADAcLAkAgBBDLgICAAEF/Rg0AIAQgBmohBiADIQAMBwtBACAGaxDLgICAABoMBAsgAyEAIANBf0cNBQwDC0EAIQgMBwtBACEADAULIABBf0cNAgtBAEEAKALE04CAAEEEcjYCxNOAgAALIAhB/v///wdLDQEgCBDLgICAACEAQQAQy4CAgAAhAyAAQX9GDQEgA0F/Rg0BIAAgA08NASADIABrIgYgAkE4ak0NAQtBAEEAKAK404CAACAGaiIDNgK404CAAAJAIANBACgCvNOAgABNDQBBACADNgK804CAAAsCQAJAAkACQEEAKAKg0ICAACIERQ0AQcjTgIAAIQMDQCAAIAMoAgAiBSADKAIEIghqRg0CIAMoAggiAw0ADAMLCwJAAkBBACgCmNCAgAAiA0UNACAAIANPDQELQQAgADYCmNCAgAALQQAhA0EAIAY2AszTgIAAQQAgADYCyNOAgABBAEF/NgKo0ICAAEEAQQAoAuDTgIAANgKs0ICAAEEAQQA2AtTTgIAAA0AgA0HE0ICAAGogA0G40ICAAGoiBDYCACAEIANBsNCAgABqIgU2AgAgA0G80ICAAGogBTYCACADQczQgIAAaiADQcDQgIAAaiIFNgIAIAUgBDYCACADQdTQgIAAaiADQcjQgIAAaiIENgIAIAQgBTYCACADQdDQgIAAaiAENgIAIANBIGoiA0GAAkcNAAsgAEF4IABrQQ9xQQAgAEEIakEPcRsiA2oiBCAGQUhqIgUgA2siA0EBcjYCBEEAQQAoAvDTgIAANgKk0ICAAEEAIAM2ApTQgIAAQQAgBDYCoNCAgAAgACAFakE4NgIEDAILIAMtAAxBCHENACAEIAVJDQAgBCAATw0AIARBeCAEa0EPcUEAIARBCGpBD3EbIgVqIgBBACgClNCAgAAgBmoiCyAFayIFQQFyNgIEIAMgCCAGajYCBEEAQQAoAvDTgIAANgKk0ICAAEEAIAU2ApTQgIAAQQAgADYCoNCAgAAgBCALakE4NgIEDAELAkAgAEEAKAKY0ICAACIITw0AQQAgADYCmNCAgAAgACEICyAAIAZqIQVByNOAgAAhAwJAAkACQAJAAkACQAJAA0AgAygCACAFRg0BIAMoAggiAw0ADAILCyADLQAMQQhxRQ0BC0HI04CAACEDA0ACQCADKAIAIgUgBEsNACAFIAMoAgRqIgUgBEsNAwsgAygCCCEDDAALCyADIAA2AgAgAyADKAIEIAZqNgIEIABBeCAAa0EPcUEAIABBCGpBD3EbaiILIAJBA3I2AgQgBUF4IAVrQQ9xQQAgBUEIakEPcRtqIgYgCyACaiICayEDAkAgBiAERw0AQQAgAjYCoNCAgABBAEEAKAKU0ICAACADaiIDNgKU0ICAACACIANBAXI2AgQMAwsCQCAGQQAoApzQgIAARw0AQQAgAjYCnNCAgABBAEEAKAKQ0ICAACADaiIDNgKQ0ICAACACIANBAXI2AgQgAiADaiADNgIADAMLAkAgBigCBCIEQQNxQQFHDQAgBEF4cSEHAkACQCAEQf8BSw0AIAYoAggiBSAEQQN2IghBA3RBsNCAgABqIgBGGgJAIAYoAgwiBCAFRw0AQQBBACgCiNCAgABBfiAId3E2AojQgIAADAILIAQgAEYaIAQgBTYCCCAFIAQ2AgwMAQsgBigCGCEJAkACQCAGKAIMIgAgBkYNACAGKAIIIgQgCEkaIAAgBDYCCCAEIAA2AgwMAQsCQCAGQRRqIgQoAgAiBQ0AIAZBEGoiBCgCACIFDQBBACEADAELA0AgBCEIIAUiAEEUaiIEKAIAIgUNACAAQRBqIQQgACgCECIFDQALIAhBADYCAAsgCUUNAAJAAkAgBiAGKAIcIgVBAnRBuNKAgABqIgQoAgBHDQAgBCAANgIAIAANAUEAQQAoAozQgIAAQX4gBXdxNgKM0ICAAAwCCyAJQRBBFCAJKAIQIAZGG2ogADYCACAARQ0BCyAAIAk2AhgCQCAGKAIQIgRFDQAgACAENgIQIAQgADYCGAsgBigCFCIERQ0AIABBFGogBDYCACAEIAA2AhgLIAcgA2ohAyAGIAdqIgYoAgQhBAsgBiAEQX5xNgIEIAIgA2ogAzYCACACIANBAXI2AgQCQCADQf8BSw0AIANBeHFBsNCAgABqIQQCQAJAQQAoAojQgIAAIgVBASADQQN2dCIDcQ0AQQAgBSADcjYCiNCAgAAgBCEDDAELIAQoAgghAwsgAyACNgIMIAQgAjYCCCACIAQ2AgwgAiADNgIIDAMLQR8hBAJAIANB////B0sNACADQQh2IgQgBEGA/j9qQRB2QQhxIgR0IgUgBUGA4B9qQRB2QQRxIgV0IgAgAEGAgA9qQRB2QQJxIgB0QQ92IAQgBXIgAHJrIgRBAXQgAyAEQRVqdkEBcXJBHGohBAsgAiAENgIcIAJCADcCECAEQQJ0QbjSgIAAaiEFAkBBACgCjNCAgAAiAEEBIAR0IghxDQAgBSACNgIAQQAgACAIcjYCjNCAgAAgAiAFNgIYIAIgAjYCCCACIAI2AgwMAwsgA0EAQRkgBEEBdmsgBEEfRht0IQQgBSgCACEAA0AgACIFKAIEQXhxIANGDQIgBEEddiEAIARBAXQhBCAFIABBBHFqQRBqIggoAgAiAA0ACyAIIAI2AgAgAiAFNgIYIAIgAjYCDCACIAI2AggMAgsgAEF4IABrQQ9xQQAgAEEIakEPcRsiA2oiCyAGQUhqIgggA2siA0EBcjYCBCAAIAhqQTg2AgQgBCAFQTcgBWtBD3FBACAFQUlqQQ9xG2pBQWoiCCAIIARBEGpJGyIIQSM2AgRBAEEAKALw04CAADYCpNCAgABBACADNgKU0ICAAEEAIAs2AqDQgIAAIAhBEGpBACkC0NOAgAA3AgAgCEEAKQLI04CAADcCCEEAIAhBCGo2AtDTgIAAQQAgBjYCzNOAgABBACAANgLI04CAAEEAQQA2AtTTgIAAIAhBJGohAwNAIANBBzYCACADQQRqIgMgBUkNAAsgCCAERg0DIAggCCgCBEF+cTYCBCAIIAggBGsiADYCACAEIABBAXI2AgQCQCAAQf8BSw0AIABBeHFBsNCAgABqIQMCQAJAQQAoAojQgIAAIgVBASAAQQN2dCIAcQ0AQQAgBSAAcjYCiNCAgAAgAyEFDAELIAMoAgghBQsgBSAENgIMIAMgBDYCCCAEIAM2AgwgBCAFNgIIDAQLQR8hAwJAIABB////B0sNACAAQQh2IgMgA0GA/j9qQRB2QQhxIgN0IgUgBUGA4B9qQRB2QQRxIgV0IgggCEGAgA9qQRB2QQJxIgh0QQ92IAMgBXIgCHJrIgNBAXQgACADQRVqdkEBcXJBHGohAwsgBCADNgIcIARCADcCECADQQJ0QbjSgIAAaiEFAkBBACgCjNCAgAAiCEEBIAN0IgZxDQAgBSAENgIAQQAgCCAGcjYCjNCAgAAgBCAFNgIYIAQgBDYCCCAEIAQ2AgwMBAsgAEEAQRkgA0EBdmsgA0EfRht0IQMgBSgCACEIA0AgCCIFKAIEQXhxIABGDQMgA0EddiEIIANBAXQhAyAFIAhBBHFqQRBqIgYoAgAiCA0ACyAGIAQ2AgAgBCAFNgIYIAQgBDYCDCAEIAQ2AggMAwsgBSgCCCIDIAI2AgwgBSACNgIIIAJBADYCGCACIAU2AgwgAiADNgIICyALQQhqIQMMBQsgBSgCCCIDIAQ2AgwgBSAENgIIIARBADYCGCAEIAU2AgwgBCADNgIIC0EAKAKU0ICAACIDIAJNDQBBACgCoNCAgAAiBCACaiIFIAMgAmsiA0EBcjYCBEEAIAM2ApTQgIAAQQAgBTYCoNCAgAAgBCACQQNyNgIEIARBCGohAwwDC0EAIQNBAEEwNgL404CAAAwCCwJAIAtFDQACQAJAIAggCCgCHCIFQQJ0QbjSgIAAaiIDKAIARw0AIAMgADYCACAADQFBACAHQX4gBXdxIgc2AozQgIAADAILIAtBEEEUIAsoAhAgCEYbaiAANgIAIABFDQELIAAgCzYCGAJAIAgoAhAiA0UNACAAIAM2AhAgAyAANgIYCyAIQRRqKAIAIgNFDQAgAEEUaiADNgIAIAMgADYCGAsCQAJAIARBD0sNACAIIAQgAmoiA0EDcjYCBCAIIANqIgMgAygCBEEBcjYCBAwBCyAIIAJqIgAgBEEBcjYCBCAIIAJBA3I2AgQgACAEaiAENgIAAkAgBEH/AUsNACAEQXhxQbDQgIAAaiEDAkACQEEAKAKI0ICAACIFQQEgBEEDdnQiBHENAEEAIAUgBHI2AojQgIAAIAMhBAwBCyADKAIIIQQLIAQgADYCDCADIAA2AgggACADNgIMIAAgBDYCCAwBC0EfIQMCQCAEQf///wdLDQAgBEEIdiIDIANBgP4/akEQdkEIcSIDdCIFIAVBgOAfakEQdkEEcSIFdCICIAJBgIAPakEQdkECcSICdEEPdiADIAVyIAJyayIDQQF0IAQgA0EVanZBAXFyQRxqIQMLIAAgAzYCHCAAQgA3AhAgA0ECdEG40oCAAGohBQJAIAdBASADdCICcQ0AIAUgADYCAEEAIAcgAnI2AozQgIAAIAAgBTYCGCAAIAA2AgggACAANgIMDAELIARBAEEZIANBAXZrIANBH0YbdCEDIAUoAgAhAgJAA0AgAiIFKAIEQXhxIARGDQEgA0EddiECIANBAXQhAyAFIAJBBHFqQRBqIgYoAgAiAg0ACyAGIAA2AgAgACAFNgIYIAAgADYCDCAAIAA2AggMAQsgBSgCCCIDIAA2AgwgBSAANgIIIABBADYCGCAAIAU2AgwgACADNgIICyAIQQhqIQMMAQsCQCAKRQ0AAkACQCAAIAAoAhwiBUECdEG40oCAAGoiAygCAEcNACADIAg2AgAgCA0BQQAgCUF+IAV3cTYCjNCAgAAMAgsgCkEQQRQgCigCECAARhtqIAg2AgAgCEUNAQsgCCAKNgIYAkAgACgCECIDRQ0AIAggAzYCECADIAg2AhgLIABBFGooAgAiA0UNACAIQRRqIAM2AgAgAyAINgIYCwJAAkAgBEEPSw0AIAAgBCACaiIDQQNyNgIEIAAgA2oiAyADKAIEQQFyNgIEDAELIAAgAmoiBSAEQQFyNgIEIAAgAkEDcjYCBCAFIARqIAQ2AgACQCAHRQ0AIAdBeHFBsNCAgABqIQJBACgCnNCAgAAhAwJAAkBBASAHQQN2dCIIIAZxDQBBACAIIAZyNgKI0ICAACACIQgMAQsgAigCCCEICyAIIAM2AgwgAiADNgIIIAMgAjYCDCADIAg2AggLQQAgBTYCnNCAgABBACAENgKQ0ICAAAsgAEEIaiEDCyABQRBqJICAgIAAIAMLCgAgABDJgICAAAviDQEHfwJAIABFDQAgAEF4aiIBIABBfGooAgAiAkF4cSIAaiEDAkAgAkEBcQ0AIAJBA3FFDQEgASABKAIAIgJrIgFBACgCmNCAgAAiBEkNASACIABqIQACQCABQQAoApzQgIAARg0AAkAgAkH/AUsNACABKAIIIgQgAkEDdiIFQQN0QbDQgIAAaiIGRhoCQCABKAIMIgIgBEcNAEEAQQAoAojQgIAAQX4gBXdxNgKI0ICAAAwDCyACIAZGGiACIAQ2AgggBCACNgIMDAILIAEoAhghBwJAAkAgASgCDCIGIAFGDQAgASgCCCICIARJGiAGIAI2AgggAiAGNgIMDAELAkAgAUEUaiICKAIAIgQNACABQRBqIgIoAgAiBA0AQQAhBgwBCwNAIAIhBSAEIgZBFGoiAigCACIEDQAgBkEQaiECIAYoAhAiBA0ACyAFQQA2AgALIAdFDQECQAJAIAEgASgCHCIEQQJ0QbjSgIAAaiICKAIARw0AIAIgBjYCACAGDQFBAEEAKAKM0ICAAEF+IAR3cTYCjNCAgAAMAwsgB0EQQRQgBygCECABRhtqIAY2AgAgBkUNAgsgBiAHNgIYAkAgASgCECICRQ0AIAYgAjYCECACIAY2AhgLIAEoAhQiAkUNASAGQRRqIAI2AgAgAiAGNgIYDAELIAMoAgQiAkEDcUEDRw0AIAMgAkF+cTYCBEEAIAA2ApDQgIAAIAEgAGogADYCACABIABBAXI2AgQPCyABIANPDQAgAygCBCICQQFxRQ0AAkACQCACQQJxDQACQCADQQAoAqDQgIAARw0AQQAgATYCoNCAgABBAEEAKAKU0ICAACAAaiIANgKU0ICAACABIABBAXI2AgQgAUEAKAKc0ICAAEcNA0EAQQA2ApDQgIAAQQBBADYCnNCAgAAPCwJAIANBACgCnNCAgABHDQBBACABNgKc0ICAAEEAQQAoApDQgIAAIABqIgA2ApDQgIAAIAEgAEEBcjYCBCABIABqIAA2AgAPCyACQXhxIABqIQACQAJAIAJB/wFLDQAgAygCCCIEIAJBA3YiBUEDdEGw0ICAAGoiBkYaAkAgAygCDCICIARHDQBBAEEAKAKI0ICAAEF+IAV3cTYCiNCAgAAMAgsgAiAGRhogAiAENgIIIAQgAjYCDAwBCyADKAIYIQcCQAJAIAMoAgwiBiADRg0AIAMoAggiAkEAKAKY0ICAAEkaIAYgAjYCCCACIAY2AgwMAQsCQCADQRRqIgIoAgAiBA0AIANBEGoiAigCACIEDQBBACEGDAELA0AgAiEFIAQiBkEUaiICKAIAIgQNACAGQRBqIQIgBigCECIEDQALIAVBADYCAAsgB0UNAAJAAkAgAyADKAIcIgRBAnRBuNKAgABqIgIoAgBHDQAgAiAGNgIAIAYNAUEAQQAoAozQgIAAQX4gBHdxNgKM0ICAAAwCCyAHQRBBFCAHKAIQIANGG2ogBjYCACAGRQ0BCyAGIAc2AhgCQCADKAIQIgJFDQAgBiACNgIQIAIgBjYCGAsgAygCFCICRQ0AIAZBFGogAjYCACACIAY2AhgLIAEgAGogADYCACABIABBAXI2AgQgAUEAKAKc0ICAAEcNAUEAIAA2ApDQgIAADwsgAyACQX5xNgIEIAEgAGogADYCACABIABBAXI2AgQLAkAgAEH/AUsNACAAQXhxQbDQgIAAaiECAkACQEEAKAKI0ICAACIEQQEgAEEDdnQiAHENAEEAIAQgAHI2AojQgIAAIAIhAAwBCyACKAIIIQALIAAgATYCDCACIAE2AgggASACNgIMIAEgADYCCA8LQR8hAgJAIABB////B0sNACAAQQh2IgIgAkGA/j9qQRB2QQhxIgJ0IgQgBEGA4B9qQRB2QQRxIgR0IgYgBkGAgA9qQRB2QQJxIgZ0QQ92IAIgBHIgBnJrIgJBAXQgACACQRVqdkEBcXJBHGohAgsgASACNgIcIAFCADcCECACQQJ0QbjSgIAAaiEEAkACQEEAKAKM0ICAACIGQQEgAnQiA3ENACAEIAE2AgBBACAGIANyNgKM0ICAACABIAQ2AhggASABNgIIIAEgATYCDAwBCyAAQQBBGSACQQF2ayACQR9GG3QhAiAEKAIAIQYCQANAIAYiBCgCBEF4cSAARg0BIAJBHXYhBiACQQF0IQIgBCAGQQRxakEQaiIDKAIAIgYNAAsgAyABNgIAIAEgBDYCGCABIAE2AgwgASABNgIIDAELIAQoAggiACABNgIMIAQgATYCCCABQQA2AhggASAENgIMIAEgADYCCAtBAEEAKAKo0ICAAEF/aiIBQX8gARs2AqjQgIAACwsEAAAAC04AAkAgAA0APwBBEHQPCwJAIABB//8DcQ0AIABBf0wNAAJAIABBEHZAACIAQX9HDQBBAEEwNgL404CAAEF/DwsgAEEQdA8LEMqAgIAAAAvyAgIDfwF+AkAgAkUNACAAIAE6AAAgAiAAaiIDQX9qIAE6AAAgAkEDSQ0AIAAgAToAAiAAIAE6AAEgA0F9aiABOgAAIANBfmogAToAACACQQdJDQAgACABOgADIANBfGogAToAACACQQlJDQAgAEEAIABrQQNxIgRqIgMgAUH/AXFBgYKECGwiATYCACADIAIgBGtBfHEiBGoiAkF8aiABNgIAIARBCUkNACADIAE2AgggAyABNgIEIAJBeGogATYCACACQXRqIAE2AgAgBEEZSQ0AIAMgATYCGCADIAE2AhQgAyABNgIQIAMgATYCDCACQXBqIAE2AgAgAkFsaiABNgIAIAJBaGogATYCACACQWRqIAE2AgAgBCADQQRxQRhyIgVrIgJBIEkNACABrUKBgICAEH4hBiADIAVqIQEDQCABIAY3AxggASAGNwMQIAEgBjcDCCABIAY3AwAgAUEgaiEBIAJBYGoiAkEfSw0ACwsgAAsLjkgBAEGACAuGSAEAAAACAAAAAwAAAAAAAAAAAAAABAAAAAUAAAAAAAAAAAAAAAYAAAAHAAAACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASW52YWxpZCBjaGFyIGluIHVybCBxdWVyeQBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX2JvZHkAQ29udGVudC1MZW5ndGggb3ZlcmZsb3cAQ2h1bmsgc2l6ZSBvdmVyZmxvdwBSZXNwb25zZSBvdmVyZmxvdwBJbnZhbGlkIG1ldGhvZCBmb3IgSFRUUC94LnggcmVxdWVzdABJbnZhbGlkIG1ldGhvZCBmb3IgUlRTUC94LnggcmVxdWVzdABFeHBlY3RlZCBTT1VSQ0UgbWV0aG9kIGZvciBJQ0UveC54IHJlcXVlc3QASW52YWxpZCBjaGFyIGluIHVybCBmcmFnbWVudCBzdGFydABFeHBlY3RlZCBkb3QAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9zdGF0dXMASW52YWxpZCByZXNwb25zZSBzdGF0dXMASW52YWxpZCBjaGFyYWN0ZXIgaW4gY2h1bmsgZXh0ZW5zaW9ucwBVc2VyIGNhbGxiYWNrIGVycm9yAGBvbl9yZXNldGAgY2FsbGJhY2sgZXJyb3IAYG9uX2NodW5rX2hlYWRlcmAgY2FsbGJhY2sgZXJyb3IAYG9uX21lc3NhZ2VfYmVnaW5gIGNhbGxiYWNrIGVycm9yAGBvbl9jaHVua19leHRlbnNpb25fdmFsdWVgIGNhbGxiYWNrIGVycm9yAGBvbl9zdGF0dXNfY29tcGxldGVgIGNhbGxiYWNrIGVycm9yAGBvbl92ZXJzaW9uX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fdXJsX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fY2h1bmtfY29tcGxldGVgIGNhbGxiYWNrIGVycm9yAGBvbl9oZWFkZXJfdmFsdWVfY29tcGxldGVgIGNhbGxiYWNrIGVycm9yAGBvbl9tZXNzYWdlX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fbWV0aG9kX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25faGVhZGVyX2ZpZWxkX2NvbXBsZXRlYCBjYWxsYmFjayBlcnJvcgBgb25fY2h1bmtfZXh0ZW5zaW9uX25hbWVgIGNhbGxiYWNrIGVycm9yAFVuZXhwZWN0ZWQgY2hhciBpbiB1cmwgc2VydmVyAEludmFsaWQgaGVhZGVyIHZhbHVlIGNoYXIASW52YWxpZCBoZWFkZXIgZmllbGQgY2hhcgBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX3ZlcnNpb24ASW52YWxpZCBtaW5vciB2ZXJzaW9uAEludmFsaWQgbWFqb3IgdmVyc2lvbgBFeHBlY3RlZCBzcGFjZSBhZnRlciB2ZXJzaW9uAEV4cGVjdGVkIENSTEYgYWZ0ZXIgdmVyc2lvbgBJbnZhbGlkIEhUVFAgdmVyc2lvbgBJbnZhbGlkIGhlYWRlciB0b2tlbgBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX3VybABJbnZhbGlkIGNoYXJhY3RlcnMgaW4gdXJsAFVuZXhwZWN0ZWQgc3RhcnQgY2hhciBpbiB1cmwARG91YmxlIEAgaW4gdXJsAEVtcHR5IENvbnRlbnQtTGVuZ3RoAEludmFsaWQgY2hhcmFjdGVyIGluIENvbnRlbnQtTGVuZ3RoAER1cGxpY2F0ZSBDb250ZW50LUxlbmd0aABJbnZhbGlkIGNoYXIgaW4gdXJsIHBhdGgAQ29udGVudC1MZW5ndGggY2FuJ3QgYmUgcHJlc2VudCB3aXRoIFRyYW5zZmVyLUVuY29kaW5nAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIHNpemUAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9oZWFkZXJfdmFsdWUAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9jaHVua19leHRlbnNpb25fdmFsdWUASW52YWxpZCBjaGFyYWN0ZXIgaW4gY2h1bmsgZXh0ZW5zaW9ucyB2YWx1ZQBNaXNzaW5nIGV4cGVjdGVkIExGIGFmdGVyIGhlYWRlciB2YWx1ZQBJbnZhbGlkIGBUcmFuc2Zlci1FbmNvZGluZ2AgaGVhZGVyIHZhbHVlAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMgcXVvdGUgdmFsdWUASW52YWxpZCBjaGFyYWN0ZXIgaW4gY2h1bmsgZXh0ZW5zaW9ucyBxdW90ZWQgdmFsdWUAUGF1c2VkIGJ5IG9uX2hlYWRlcnNfY29tcGxldGUASW52YWxpZCBFT0Ygc3RhdGUAb25fcmVzZXQgcGF1c2UAb25fY2h1bmtfaGVhZGVyIHBhdXNlAG9uX21lc3NhZ2VfYmVnaW4gcGF1c2UAb25fY2h1bmtfZXh0ZW5zaW9uX3ZhbHVlIHBhdXNlAG9uX3N0YXR1c19jb21wbGV0ZSBwYXVzZQBvbl92ZXJzaW9uX2NvbXBsZXRlIHBhdXNlAG9uX3VybF9jb21wbGV0ZSBwYXVzZQBvbl9jaHVua19jb21wbGV0ZSBwYXVzZQBvbl9oZWFkZXJfdmFsdWVfY29tcGxldGUgcGF1c2UAb25fbWVzc2FnZV9jb21wbGV0ZSBwYXVzZQBvbl9tZXRob2RfY29tcGxldGUgcGF1c2UAb25faGVhZGVyX2ZpZWxkX2NvbXBsZXRlIHBhdXNlAG9uX2NodW5rX2V4dGVuc2lvbl9uYW1lIHBhdXNlAFVuZXhwZWN0ZWQgc3BhY2UgYWZ0ZXIgc3RhcnQgbGluZQBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX2NodW5rX2V4dGVuc2lvbl9uYW1lAEludmFsaWQgY2hhcmFjdGVyIGluIGNodW5rIGV4dGVuc2lvbnMgbmFtZQBQYXVzZSBvbiBDT05ORUNUL1VwZ3JhZGUAUGF1c2Ugb24gUFJJL1VwZ3JhZGUARXhwZWN0ZWQgSFRUUC8yIENvbm5lY3Rpb24gUHJlZmFjZQBTcGFuIGNhbGxiYWNrIGVycm9yIGluIG9uX21ldGhvZABFeHBlY3RlZCBzcGFjZSBhZnRlciBtZXRob2QAU3BhbiBjYWxsYmFjayBlcnJvciBpbiBvbl9oZWFkZXJfZmllbGQAUGF1c2VkAEludmFsaWQgd29yZCBlbmNvdW50ZXJlZABJbnZhbGlkIG1ldGhvZCBlbmNvdW50ZXJlZABVbmV4cGVjdGVkIGNoYXIgaW4gdXJsIHNjaGVtYQBSZXF1ZXN0IGhhcyBpbnZhbGlkIGBUcmFuc2Zlci1FbmNvZGluZ2AAU1dJVENIX1BST1hZAFVTRV9QUk9YWQBNS0FDVElWSVRZAFVOUFJPQ0VTU0FCTEVfRU5USVRZAENPUFkATU9WRURfUEVSTUFORU5UTFkAVE9PX0VBUkxZAE5PVElGWQBGQUlMRURfREVQRU5ERU5DWQBCQURfR0FURVdBWQBQTEFZAFBVVABDSEVDS09VVABHQVRFV0FZX1RJTUVPVVQAUkVRVUVTVF9USU1FT1VUAE5FVFdPUktfQ09OTkVDVF9USU1FT1VUAENPTk5FQ1RJT05fVElNRU9VVABMT0dJTl9USU1FT1VUAE5FVFdPUktfUkVBRF9USU1FT1VUAFBPU1QATUlTRElSRUNURURfUkVRVUVTVABDTElFTlRfQ0xPU0VEX1JFUVVFU1QAQ0xJRU5UX0NMT1NFRF9MT0FEX0JBTEFOQ0VEX1JFUVVFU1QAQkFEX1JFUVVFU1QASFRUUF9SRVFVRVNUX1NFTlRfVE9fSFRUUFNfUE9SVABSRVBPUlQASU1fQV9URUFQT1QAUkVTRVRfQ09OVEVOVABOT19DT05URU5UAFBBUlRJQUxfQ09OVEVOVABIUEVfSU5WQUxJRF9DT05TVEFOVABIUEVfQ0JfUkVTRVQAR0VUAEhQRV9TVFJJQ1QAQ09ORkxJQ1QAVEVNUE9SQVJZX1JFRElSRUNUAFBFUk1BTkVOVF9SRURJUkVDVABDT05ORUNUAE1VTFRJX1NUQVRVUwBIUEVfSU5WQUxJRF9TVEFUVVMAVE9PX01BTllfUkVRVUVTVFMARUFSTFlfSElOVFMAVU5BVkFJTEFCTEVfRk9SX0xFR0FMX1JFQVNPTlMAT1BUSU9OUwBTV0lUQ0hJTkdfUFJPVE9DT0xTAFZBUklBTlRfQUxTT19ORUdPVElBVEVTAE1VTFRJUExFX0NIT0lDRVMASU5URVJOQUxfU0VSVkVSX0VSUk9SAFdFQl9TRVJWRVJfVU5LTk9XTl9FUlJPUgBSQUlMR1VOX0VSUk9SAElERU5USVRZX1BST1ZJREVSX0FVVEhFTlRJQ0FUSU9OX0VSUk9SAFNTTF9DRVJUSUZJQ0FURV9FUlJPUgBJTlZBTElEX1hfRk9SV0FSREVEX0ZPUgBTRVRfUEFSQU1FVEVSAEdFVF9QQVJBTUVURVIASFBFX1VTRVIAU0VFX09USEVSAEhQRV9DQl9DSFVOS19IRUFERVIATUtDQUxFTkRBUgBTRVRVUABXRUJfU0VSVkVSX0lTX0RPV04AVEVBUkRPV04ASFBFX0NMT1NFRF9DT05ORUNUSU9OAEhFVVJJU1RJQ19FWFBJUkFUSU9OAERJU0NPTk5FQ1RFRF9PUEVSQVRJT04ATk9OX0FVVEhPUklUQVRJVkVfSU5GT1JNQVRJT04ASFBFX0lOVkFMSURfVkVSU0lPTgBIUEVfQ0JfTUVTU0FHRV9CRUdJTgBTSVRFX0lTX0ZST1pFTgBIUEVfSU5WQUxJRF9IRUFERVJfVE9LRU4ASU5WQUxJRF9UT0tFTgBGT1JCSURERU4ARU5IQU5DRV9ZT1VSX0NBTE0ASFBFX0lOVkFMSURfVVJMAEJMT0NLRURfQllfUEFSRU5UQUxfQ09OVFJPTABNS0NPTABBQ0wASFBFX0lOVEVSTkFMAFJFUVVFU1RfSEVBREVSX0ZJRUxEU19UT09fTEFSR0VfVU5PRkZJQ0lBTABIUEVfT0sAVU5MSU5LAFVOTE9DSwBQUkkAUkVUUllfV0lUSABIUEVfSU5WQUxJRF9DT05URU5UX0xFTkdUSABIUEVfVU5FWFBFQ1RFRF9DT05URU5UX0xFTkdUSABGTFVTSABQUk9QUEFUQ0gATS1TRUFSQ0gAVVJJX1RPT19MT05HAFBST0NFU1NJTkcATUlTQ0VMTEFORU9VU19QRVJTSVNURU5UX1dBUk5JTkcATUlTQ0VMTEFORU9VU19XQVJOSU5HAEhQRV9JTlZBTElEX1RSQU5TRkVSX0VOQ09ESU5HAEV4cGVjdGVkIENSTEYASFBFX0lOVkFMSURfQ0hVTktfU0laRQBNT1ZFAENPTlRJTlVFAEhQRV9DQl9TVEFUVVNfQ09NUExFVEUASFBFX0NCX0hFQURFUlNfQ09NUExFVEUASFBFX0NCX1ZFUlNJT05fQ09NUExFVEUASFBFX0NCX1VSTF9DT01QTEVURQBIUEVfQ0JfQ0hVTktfQ09NUExFVEUASFBFX0NCX0hFQURFUl9WQUxVRV9DT01QTEVURQBIUEVfQ0JfQ0hVTktfRVhURU5TSU9OX1ZBTFVFX0NPTVBMRVRFAEhQRV9DQl9DSFVOS19FWFRFTlNJT05fTkFNRV9DT01QTEVURQBIUEVfQ0JfTUVTU0FHRV9DT01QTEVURQBIUEVfQ0JfTUVUSE9EX0NPTVBMRVRFAEhQRV9DQl9IRUFERVJfRklFTERfQ09NUExFVEUAREVMRVRFAEhQRV9JTlZBTElEX0VPRl9TVEFURQBJTlZBTElEX1NTTF9DRVJUSUZJQ0FURQBQQVVTRQBOT19SRVNQT05TRQBVTlNVUFBPUlRFRF9NRURJQV9UWVBFAEdPTkUATk9UX0FDQ0VQVEFCTEUAU0VSVklDRV9VTkFWQUlMQUJMRQBSQU5HRV9OT1RfU0FUSVNGSUFCTEUAT1JJR0lOX0lTX1VOUkVBQ0hBQkxFAFJFU1BPTlNFX0lTX1NUQUxFAFBVUkdFAE1FUkdFAFJFUVVFU1RfSEVBREVSX0ZJRUxEU19UT09fTEFSR0UAUkVRVUVTVF9IRUFERVJfVE9PX0xBUkdFAFBBWUxPQURfVE9PX0xBUkdFAElOU1VGRklDSUVOVF9TVE9SQUdFAEhQRV9QQVVTRURfVVBHUkFERQBIUEVfUEFVU0VEX0gyX1VQR1JBREUAU09VUkNFAEFOTk9VTkNFAFRSQUNFAEhQRV9VTkVYUEVDVEVEX1NQQUNFAERFU0NSSUJFAFVOU1VCU0NSSUJFAFJFQ09SRABIUEVfSU5WQUxJRF9NRVRIT0QATk9UX0ZPVU5EAFBST1BGSU5EAFVOQklORABSRUJJTkQAVU5BVVRIT1JJWkVEAE1FVEhPRF9OT1RfQUxMT1dFRABIVFRQX1ZFUlNJT05fTk9UX1NVUFBPUlRFRABBTFJFQURZX1JFUE9SVEVEAEFDQ0VQVEVEAE5PVF9JTVBMRU1FTlRFRABMT09QX0RFVEVDVEVEAEhQRV9DUl9FWFBFQ1RFRABIUEVfTEZfRVhQRUNURUQAQ1JFQVRFRABJTV9VU0VEAEhQRV9QQVVTRUQAVElNRU9VVF9PQ0NVUkVEAFBBWU1FTlRfUkVRVUlSRUQAUFJFQ09ORElUSU9OX1JFUVVJUkVEAFBST1hZX0FVVEhFTlRJQ0FUSU9OX1JFUVVJUkVEAE5FVFdPUktfQVVUSEVOVElDQVRJT05fUkVRVUlSRUQATEVOR1RIX1JFUVVJUkVEAFNTTF9DRVJUSUZJQ0FURV9SRVFVSVJFRABVUEdSQURFX1JFUVVJUkVEAFBBR0VfRVhQSVJFRABQUkVDT05ESVRJT05fRkFJTEVEAEVYUEVDVEFUSU9OX0ZBSUxFRABSRVZBTElEQVRJT05fRkFJTEVEAFNTTF9IQU5EU0hBS0VfRkFJTEVEAExPQ0tFRABUUkFOU0ZPUk1BVElPTl9BUFBMSUVEAE5PVF9NT0RJRklFRABOT1RfRVhURU5ERUQAQkFORFdJRFRIX0xJTUlUX0VYQ0VFREVEAFNJVEVfSVNfT1ZFUkxPQURFRABIRUFEAEV4cGVjdGVkIEhUVFAvAABeEwAAJhMAADAQAADwFwAAnRMAABUSAAA5FwAA8BIAAAoQAAB1EgAArRIAAIITAABPFAAAfxAAAKAVAAAjFAAAiRIAAIsUAABNFQAA1BEAAM8UAAAQGAAAyRYAANwWAADBEQAA4BcAALsUAAB0FAAAfBUAAOUUAAAIFwAAHxAAAGUVAACjFAAAKBUAAAIVAACZFQAALBAAAIsZAABPDwAA1A4AAGoQAADOEAAAAhcAAIkOAABuEwAAHBMAAGYUAABWFwAAwRMAAM0TAABsEwAAaBcAAGYXAABfFwAAIhMAAM4PAABpDgAA2A4AAGMWAADLEwAAqg4AACgXAAAmFwAAxRMAAF0WAADoEQAAZxMAAGUTAADyFgAAcxMAAB0XAAD5FgAA8xEAAM8OAADOFQAADBIAALMRAAClEQAAYRAAADIXAAC7EwAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEBAgEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAgMCAgICAgAAAgIAAgIAAgICAgICAgICAgAEAAAAAAACAgICAgICAgICAgICAgICAgICAgICAgICAgAAAAICAgICAgICAgICAgICAgICAgICAgICAgICAgICAAIAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAIAAgICAgIAAAICAAICAAICAgICAgICAgIAAwAEAAAAAgICAgICAgICAgICAgICAgICAgICAgICAgIAAAACAgICAgICAgICAgICAgICAgICAgICAgICAgICAgACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABsb3NlZWVwLWFsaXZlAAAAAAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQEBAQEBAQEBAQEBAgEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQFjaHVua2VkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQABAQEBAQAAAQEAAQEAAQEBAQEBAQEBAQAAAAAAAAABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGVjdGlvbmVudC1sZW5ndGhvbnJveHktY29ubmVjdGlvbgAAAAAAAAAAAAAAAAAAAHJhbnNmZXItZW5jb2RpbmdwZ3JhZGUNCg0KDQpTTQ0KDQpUVFAvQ0UvVFNQLwAAAAAAAAAAAAAAAAECAAEDAAAAAAAAAAAAAAAAAAAAAAAABAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAAAAAAAAAAABAgABAwAAAAAAAAAAAAAAAAAAAAAAAAQBAQUBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAAAAAAAAAQAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAQEAAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQABAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQAAAAAAAAAAAAABAAACAAAAAAAAAAAAAAAAAAAAAAAAAwQAAAQEBAQEBAQEBAQEBQQEBAQEBAQEBAQEBAAEAAYHBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEAAQABAAEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAQEBAAAAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAQAAAAAAAAAAAAAAAAAAAAAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAAAAAAAAAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAAEAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAgAAAAACAAAAAAAAAAAAAAAAAAAAAAADAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwAAAAAAAAMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAwMDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAE5PVU5DRUVDS09VVE5FQ1RFVEVDUklCRUxVU0hFVEVBRFNFQVJDSFJHRUNUSVZJVFlMRU5EQVJWRU9USUZZUFRJT05TQ0hTRUFZU1RBVENIR0VPUkRJUkVDVE9SVFJDSFBBUkFNRVRFUlVSQ0VCU0NSSUJFQVJET1dOQUNFSU5ETktDS1VCU0NSSUJFSFRUUC9BRFRQLw==";
-  }
-});
-
-// lib/client.js
-var require_client = __commonJS({
-  "lib/client.js"(exports2, module2) {
-    "use strict";
-    var assert = require("assert");
-    var net = require("net");
-    var util = require_util();
-    var timers = require_timers();
-    var Request = require_request2();
-    var DispatcherBase = require_dispatcher_base();
-    var {
-      RequestContentLengthMismatchError,
-      ResponseContentLengthMismatchError,
-      InvalidArgumentError,
-      RequestAbortedError,
-      HeadersTimeoutError,
-      HeadersOverflowError,
-      SocketError,
-      InformationalError,
-      BodyTimeoutError,
-      HTTPParserError,
-      ResponseExceededMaxSizeError,
-      ClientDestroyedError
-    } = require_errors();
-    var buildConnector = require_connect();
-    var {
-      kUrl,
-      kReset,
-      kServerName,
-      kClient,
-      kBusy,
-      kParser,
-      kConnect,
-      kBlocking,
-      kResuming,
-      kRunning,
-      kPending,
-      kSize,
-      kWriting,
-      kQueue,
-      kConnected,
-      kConnecting,
-      kNeedDrain,
-      kNoRef,
-      kKeepAliveDefaultTimeout,
-      kHostHeader,
-      kPendingIdx,
-      kRunningIdx,
-      kError,
-      kPipelining,
-      kSocket,
-      kKeepAliveTimeoutValue,
-      kMaxHeadersSize,
-      kKeepAliveMaxTimeout,
-      kKeepAliveTimeoutThreshold,
-      kHeadersTimeout,
-      kBodyTimeout,
-      kStrictContentLength,
-      kConnector,
-      kMaxRedirections,
-      kMaxRequests,
-      kCounter,
-      kClose,
-      kDestroy,
-      kDispatch,
-      kInterceptors,
-      kLocalAddress,
-      kMaxResponseSize
-    } = require_symbols();
-    var FastBuffer = Buffer[Symbol.species];
-    var kClosedResolve = Symbol("kClosedResolve");
-    var channels = {};
-    try {
-      const diagnosticsChannel = require("diagnostics_channel");
-      channels.sendHeaders = diagnosticsChannel.channel("undici:client:sendHeaders");
-      channels.beforeConnect = diagnosticsChannel.channel("undici:client:beforeConnect");
-      channels.connectError = diagnosticsChannel.channel("undici:client:connectError");
-      channels.connected = diagnosticsChannel.channel("undici:client:connected");
-    } catch {
-      channels.sendHeaders = { hasSubscribers: false };
-      channels.beforeConnect = { hasSubscribers: false };
-      channels.connectError = { hasSubscribers: false };
-      channels.connected = { hasSubscribers: false };
-    }
-    var Client = class extends DispatcherBase {
-      constructor(url, {
-        interceptors,
-        maxHeaderSize,
-        headersTimeout,
-        socketTimeout,
-        requestTimeout,
-        connectTimeout,
-        bodyTimeout,
-        idleTimeout,
-        keepAlive,
-        keepAliveTimeout,
-        maxKeepAliveTimeout,
-        keepAliveMaxTimeout,
-        keepAliveTimeoutThreshold,
-        socketPath,
-        pipelining,
-        tls,
-        strictContentLength,
-        maxCachedSessions,
-        maxRedirections,
-        connect: connect2,
-        maxRequestsPerClient,
-        localAddress,
-        maxResponseSize,
-        autoSelectFamily,
-        autoSelectFamilyAttemptTimeout
-      } = {}) {
-        super();
-        if (keepAlive !== void 0) {
-          throw new InvalidArgumentError("unsupported keepAlive, use pipelining=0 instead");
-        }
-        if (socketTimeout !== void 0) {
-          throw new InvalidArgumentError("unsupported socketTimeout, use headersTimeout & bodyTimeout instead");
-        }
-        if (requestTimeout !== void 0) {
-          throw new InvalidArgumentError("unsupported requestTimeout, use headersTimeout & bodyTimeout instead");
-        }
-        if (idleTimeout !== void 0) {
-          throw new InvalidArgumentError("unsupported idleTimeout, use keepAliveTimeout instead");
+      resume() {
+        if (this.socket.destroyed || !this.paused) {
+          return;
         }
-        if (maxKeepAliveTimeout !== void 0) {
-          throw new InvalidArgumentError("unsupported maxKeepAliveTimeout, use keepAliveMaxTimeout instead");
+        assert(this.ptr != null);
+        assert(currentParser == null);
+        this.llhttp.llhttp_resume(this.ptr);
+        assert(this.timeoutType === TIMEOUT_BODY);
+        if (this.timeout) {
+          if (this.timeout.refresh) {
+            this.timeout.refresh();
+          }
         }
-        if (maxHeaderSize != null && !Number.isFinite(maxHeaderSize)) {
-          throw new InvalidArgumentError("invalid maxHeaderSize");
+        this.paused = false;
+        this.execute(this.socket.read() || EMPTY_BUF);
+        this.readMore();
+      }
+      readMore() {
+        while (!this.paused && this.ptr) {
+          const chunk = this.socket.read();
+          if (chunk === null) {
+            break;
+          }
+          this.execute(chunk);
         }
-        if (socketPath != null && typeof socketPath !== "string") {
-          throw new InvalidArgumentError("invalid socketPath");
+      }
+      execute(data) {
+        assert(this.ptr != null);
+        assert(currentParser == null);
+        assert(!this.paused);
+        const { socket, llhttp } = this;
+        if (data.length > currentBufferSize) {
+          if (currentBufferPtr) {
+            llhttp.free(currentBufferPtr);
+          }
+          currentBufferSize = Math.ceil(data.length / 4096) * 4096;
+          currentBufferPtr = llhttp.malloc(currentBufferSize);
         }
-        if (connectTimeout != null && (!Number.isFinite(connectTimeout) || connectTimeout < 0)) {
-          throw new InvalidArgumentError("invalid connectTimeout");
+        new Uint8Array(llhttp.memory.buffer, currentBufferPtr, currentBufferSize).set(data);
+        try {
+          let ret;
+          try {
+            currentBufferRef = data;
+            currentParser = this;
+            ret = llhttp.llhttp_execute(this.ptr, currentBufferPtr, data.length);
+          } catch (err) {
+            throw err;
+          } finally {
+            currentParser = null;
+            currentBufferRef = null;
+          }
+          const offset = llhttp.llhttp_get_error_pos(this.ptr) - currentBufferPtr;
+          if (ret === constants.ERROR.PAUSED_UPGRADE) {
+            this.onUpgrade(data.slice(offset));
+          } else if (ret === constants.ERROR.PAUSED) {
+            this.paused = true;
+            socket.unshift(data.slice(offset));
+          } else if (ret !== constants.ERROR.OK) {
+            const ptr = llhttp.llhttp_get_error_reason(this.ptr);
+            let message = "";
+            if (ptr) {
+              const len = new Uint8Array(llhttp.memory.buffer, ptr).indexOf(0);
+              message = "Response does not match the HTTP/1.1 protocol (" + Buffer.from(llhttp.memory.buffer, ptr, len).toString() + ")";
+            }
+            throw new HTTPParserError(message, constants.ERROR[ret], data.slice(offset));
+          }
+        } catch (err) {
+          util.destroy(socket, err);
         }
-        if (keepAliveTimeout != null && (!Number.isFinite(keepAliveTimeout) || keepAliveTimeout <= 0)) {
-          throw new InvalidArgumentError("invalid keepAliveTimeout");
+      }
+      destroy() {
+        assert(this.ptr != null);
+        assert(currentParser == null);
+        this.llhttp.llhttp_free(this.ptr);
+        this.ptr = null;
+        timers.clearTimeout(this.timeout);
+        this.timeout = null;
+        this.timeoutValue = null;
+        this.timeoutType = null;
+        this.paused = false;
+      }
+      onStatus(buf) {
+        this.statusText = buf.toString();
+      }
+      onMessageBegin() {
+        const { socket, client } = this;
+        if (socket.destroyed) {
+          return -1;
         }
-        if (keepAliveMaxTimeout != null && (!Number.isFinite(keepAliveMaxTimeout) || keepAliveMaxTimeout <= 0)) {
-          throw new InvalidArgumentError("invalid keepAliveMaxTimeout");
+        const request = client[kQueue][client[kRunningIdx]];
+        if (!request) {
+          return -1;
         }
-        if (keepAliveTimeoutThreshold != null && !Number.isFinite(keepAliveTimeoutThreshold)) {
-          throw new InvalidArgumentError("invalid keepAliveTimeoutThreshold");
+      }
+      onHeaderField(buf) {
+        const len = this.headers.length;
+        if ((len & 1) === 0) {
+          this.headers.push(buf);
+        } else {
+          this.headers[len - 1] = Buffer.concat([this.headers[len - 1], buf]);
         }
-        if (headersTimeout != null && (!Number.isInteger(headersTimeout) || headersTimeout < 0)) {
-          throw new InvalidArgumentError("headersTimeout must be a positive integer or zero");
+        this.trackHeader(buf.length);
+      }
+      onHeaderValue(buf) {
+        let len = this.headers.length;
+        if ((len & 1) === 1) {
+          this.headers.push(buf);
+          len += 1;
+        } else {
+          this.headers[len - 1] = Buffer.concat([this.headers[len - 1], buf]);
         }
-        if (bodyTimeout != null && (!Number.isInteger(bodyTimeout) || bodyTimeout < 0)) {
-          throw new InvalidArgumentError("bodyTimeout must be a positive integer or zero");
+        const key = this.headers[len - 2];
+        if (key.length === 10 && key.toString().toLowerCase() === "keep-alive") {
+          this.keepAlive += buf.toString();
+        } else if (key.length === 10 && key.toString().toLowerCase() === "connection") {
+          this.connection += buf.toString();
+        } else if (key.length === 14 && key.toString().toLowerCase() === "content-length") {
+          this.contentLength += buf.toString();
         }
-        if (connect2 != null && typeof connect2 !== "function" && typeof connect2 !== "object") {
-          throw new InvalidArgumentError("connect must be a function or an object");
+        this.trackHeader(buf.length);
+      }
+      trackHeader(len) {
+        this.headersSize += len;
+        if (this.headersSize >= this.headersMaxSize) {
+          util.destroy(this.socket, new HeadersOverflowError());
         }
-        if (maxRedirections != null && (!Number.isInteger(maxRedirections) || maxRedirections < 0)) {
-          throw new InvalidArgumentError("maxRedirections must be a positive number");
+      }
+      onUpgrade(head) {
+        const { upgrade, client, socket, headers, statusCode } = this;
+        assert(upgrade);
+        const request = client[kQueue][client[kRunningIdx]];
+        assert(request);
+        assert(!socket.destroyed);
+        assert(socket === client[kSocket]);
+        assert(!this.paused);
+        assert(request.upgrade || request.method === "CONNECT");
+        this.statusCode = null;
+        this.statusText = "";
+        this.shouldKeepAlive = null;
+        assert(this.headers.length % 2 === 0);
+        this.headers = [];
+        this.headersSize = 0;
+        socket.unshift(head);
+        socket[kParser].destroy();
+        socket[kParser] = null;
+        socket[kClient] = null;
+        socket[kError] = null;
+        socket.removeListener("error", onSocketError).removeListener("readable", onSocketReadable).removeListener("end", onSocketEnd).removeListener("close", onSocketClose);
+        client[kSocket] = null;
+        client[kQueue][client[kRunningIdx]++] = null;
+        client.emit("disconnect", client[kUrl], [client], new InformationalError("upgrade"));
+        try {
+          request.onUpgrade(statusCode, headers, socket);
+        } catch (err) {
+          util.destroy(socket, err);
         }
-        if (maxRequestsPerClient != null && (!Number.isInteger(maxRequestsPerClient) || maxRequestsPerClient < 0)) {
-          throw new InvalidArgumentError("maxRequestsPerClient must be a positive number");
+        resume(client);
+      }
+      onHeadersComplete(statusCode, upgrade, shouldKeepAlive) {
+        const { client, socket, headers, statusText } = this;
+        if (socket.destroyed) {
+          return -1;
         }
-        if (localAddress != null && (typeof localAddress !== "string" || net.isIP(localAddress) === 0)) {
-          throw new InvalidArgumentError("localAddress must be valid string IP address");
+        const request = client[kQueue][client[kRunningIdx]];
+        if (!request) {
+          return -1;
         }
-        if (maxResponseSize != null && (!Number.isInteger(maxResponseSize) || maxResponseSize < -1)) {
-          throw new InvalidArgumentError("maxResponseSize must be a positive number");
+        assert(!this.upgrade);
+        assert(this.statusCode < 200);
+        if (statusCode === 100) {
+          util.destroy(socket, new SocketError("bad response", util.getSocketInfo(socket)));
+          return -1;
         }
-        if (autoSelectFamilyAttemptTimeout != null && (!Number.isInteger(autoSelectFamilyAttemptTimeout) || autoSelectFamilyAttemptTimeout < -1)) {
-          throw new InvalidArgumentError("autoSelectFamilyAttemptTimeout must be a positive number");
+        if (upgrade && !request.upgrade) {
+          util.destroy(socket, new SocketError("bad upgrade", util.getSocketInfo(socket)));
+          return -1;
         }
-        if (typeof connect2 !== "function") {
-          connect2 = buildConnector({
-            ...tls,
-            maxCachedSessions,
-            socketPath,
-            timeout: connectTimeout,
-            ...util.nodeHasAutoSelectFamily && autoSelectFamily ? { autoSelectFamily, autoSelectFamilyAttemptTimeout } : void 0,
-            ...connect2
-          });
+        assert.strictEqual(this.timeoutType, TIMEOUT_HEADERS);
+        this.statusCode = statusCode;
+        this.shouldKeepAlive = shouldKeepAlive || // Override llhttp value which does not allow keepAlive for HEAD.
+        request.method === "HEAD" && !socket[kReset] && this.connection.toLowerCase() === "keep-alive";
+        if (this.statusCode >= 200) {
+          const bodyTimeout = request.bodyTimeout != null ? request.bodyTimeout : client[kBodyTimeout];
+          this.setTimeout(bodyTimeout, TIMEOUT_BODY);
+        } else if (this.timeout) {
+          if (this.timeout.refresh) {
+            this.timeout.refresh();
+          }
         }
-        this[kInterceptors] = interceptors && interceptors.Client && Array.isArray(interceptors.Client) ? interceptors.Client : [createRedirectInterceptor({ maxRedirections })];
-        this[kUrl] = util.parseOrigin(url);
-        this[kConnector] = connect2;
-        this[kSocket] = null;
-        this[kPipelining] = pipelining != null ? pipelining : 1;
-        this[kMaxHeadersSize] = maxHeaderSize || 16384;
-        this[kKeepAliveDefaultTimeout] = keepAliveTimeout == null ? 4e3 : keepAliveTimeout;
-        this[kKeepAliveMaxTimeout] = keepAliveMaxTimeout == null ? 6e5 : keepAliveMaxTimeout;
-        this[kKeepAliveTimeoutThreshold] = keepAliveTimeoutThreshold == null ? 1e3 : keepAliveTimeoutThreshold;
-        this[kKeepAliveTimeoutValue] = this[kKeepAliveDefaultTimeout];
-        this[kServerName] = null;
-        this[kLocalAddress] = localAddress != null ? localAddress : null;
-        this[kResuming] = 0;
-        this[kNeedDrain] = 0;
-        this[kHostHeader] = `host: ${this[kUrl].hostname}${this[kUrl].port ? `:${this[kUrl].port}` : ""}\r
-`;
-        this[kBodyTimeout] = bodyTimeout != null ? bodyTimeout : 3e5;
-        this[kHeadersTimeout] = headersTimeout != null ? headersTimeout : 3e5;
-        this[kStrictContentLength] = strictContentLength == null ? true : strictContentLength;
-        this[kMaxRedirections] = maxRedirections;
-        this[kMaxRequests] = maxRequestsPerClient;
-        this[kClosedResolve] = null;
-        this[kMaxResponseSize] = maxResponseSize > -1 ? maxResponseSize : -1;
-        this[kQueue] = [];
-        this[kRunningIdx] = 0;
-        this[kPendingIdx] = 0;
-      }
-      get pipelining() {
-        return this[kPipelining];
-      }
-      set pipelining(value) {
-        this[kPipelining] = value;
-        resume(this, true);
-      }
-      get [kPending]() {
-        return this[kQueue].length - this[kPendingIdx];
-      }
-      get [kRunning]() {
-        return this[kPendingIdx] - this[kRunningIdx];
-      }
-      get [kSize]() {
-        return this[kQueue].length - this[kRunningIdx];
-      }
-      get [kConnected]() {
-        return !!this[kSocket] && !this[kConnecting] && !this[kSocket].destroyed;
-      }
-      get [kBusy]() {
-        const socket = this[kSocket];
-        return socket && (socket[kReset] || socket[kWriting] || socket[kBlocking]) || this[kSize] >= (this[kPipelining] || 1) || this[kPending] > 0;
-      }
-      [kConnect](cb) {
-        connect(this);
-        this.once("connect", cb);
-      }
-      [kDispatch](opts, handler) {
-        const origin = opts.origin || this[kUrl].origin;
-        const request = new Request(origin, opts, handler);
-        this[kQueue].push(request);
-        if (this[kResuming]) {
-        } else if (util.bodyLength(request.body) == null && util.isIterable(request.body)) {
-          this[kResuming] = 1;
-          process.nextTick(resume, this);
-        } else {
-          resume(this, true);
+        if (request.method === "CONNECT") {
+          assert(client[kRunning] === 1);
+          this.upgrade = true;
+          return 2;
         }
-        if (this[kResuming] && this[kNeedDrain] !== 2 && this[kBusy]) {
-          this[kNeedDrain] = 2;
+        if (upgrade) {
+          assert(client[kRunning] === 1);
+          this.upgrade = true;
+          return 2;
         }
-        return this[kNeedDrain] < 2;
-      }
-      async [kClose]() {
-        return new Promise((resolve) => {
-          if (!this[kSize]) {
-            resolve(null);
+        assert(this.headers.length % 2 === 0);
+        this.headers = [];
+        this.headersSize = 0;
+        if (this.shouldKeepAlive && client[kPipelining]) {
+          const keepAliveTimeout = this.keepAlive ? util.parseKeepAliveTimeout(this.keepAlive) : null;
+          if (keepAliveTimeout != null) {
+            const timeout = Math.min(
+              keepAliveTimeout - client[kKeepAliveTimeoutThreshold],
+              client[kKeepAliveMaxTimeout]
+            );
+            if (timeout <= 0) {
+              socket[kReset] = true;
+            } else {
+              client[kKeepAliveTimeoutValue] = timeout;
+            }
           } else {
-            this[kClosedResolve] = resolve;
+            client[kKeepAliveTimeoutValue] = client[kKeepAliveDefaultTimeout];
           }
-        });
+        } else {
+          socket[kReset] = true;
+        }
+        let pause;
+        try {
+          pause = request.onHeaders(statusCode, headers, this.resume, statusText) === false;
+        } catch (err) {
+          util.destroy(socket, err);
+          return -1;
+        }
+        if (request.method === "HEAD") {
+          return 1;
+        }
+        if (statusCode < 200) {
+          return 1;
+        }
+        if (socket[kBlocking]) {
+          socket[kBlocking] = false;
+          resume(client);
+        }
+        return pause ? constants.ERROR.PAUSED : 0;
       }
-      async [kDestroy](err) {
-        return new Promise((resolve) => {
-          const requests = this[kQueue].splice(this[kPendingIdx]);
-          for (let i = 0; i < requests.length; i++) {
-            const request = requests[i];
-            errorRequest(this, request, err);
+      onBody(buf) {
+        const { client, socket, statusCode, maxResponseSize } = this;
+        if (socket.destroyed) {
+          return -1;
+        }
+        const request = client[kQueue][client[kRunningIdx]];
+        assert(request);
+        assert.strictEqual(this.timeoutType, TIMEOUT_BODY);
+        if (this.timeout) {
+          if (this.timeout.refresh) {
+            this.timeout.refresh();
           }
-          const callback = () => {
-            if (this[kClosedResolve]) {
-              this[kClosedResolve]();
-              this[kClosedResolve] = null;
-            }
-            resolve();
-          };
-          if (!this[kSocket]) {
-            queueMicrotask(callback);
-          } else {
-            util.destroy(this[kSocket].on("close", callback), err);
+        }
+        assert(statusCode >= 200);
+        if (maxResponseSize > -1 && this.bytesRead + buf.length > maxResponseSize) {
+          util.destroy(socket, new ResponseExceededMaxSizeError());
+          return -1;
+        }
+        this.bytesRead += buf.length;
+        try {
+          if (request.onData(buf) === false) {
+            return constants.ERROR.PAUSED;
           }
-          resume(this);
-        });
-      }
-    };
-    var constants = require_constants2();
-    var createRedirectInterceptor = require_redirectInterceptor();
-    var EMPTY_BUF = Buffer.alloc(0);
-    async function lazyllhttp() {
-      const llhttpWasmData = process.env.JEST_WORKER_ID ? require_llhttp_wasm() : void 0;
-      let mod;
-      try {
-        mod = await WebAssembly.compile(Buffer.from(require_llhttp_simd_wasm(), "base64"));
-      } catch (e) {
-        mod = await WebAssembly.compile(Buffer.from(llhttpWasmData || require_llhttp_wasm(), "base64"));
+        } catch (err) {
+          util.destroy(socket, err);
+          return -1;
+        }
       }
-      return await WebAssembly.instantiate(mod, {
-        env: {
-          wasm_on_url: (p, at, len) => {
-            return 0;
-          },
-          wasm_on_status: (p, at, len) => {
-            assert.strictEqual(currentParser.ptr, p);
-            const start = at - currentBufferPtr + currentBufferRef.byteOffset;
-            return currentParser.onStatus(new FastBuffer(currentBufferRef.buffer, start, len)) || 0;
-          },
-          wasm_on_message_begin: (p) => {
-            assert.strictEqual(currentParser.ptr, p);
-            return currentParser.onMessageBegin() || 0;
-          },
-          wasm_on_header_field: (p, at, len) => {
-            assert.strictEqual(currentParser.ptr, p);
-            const start = at - currentBufferPtr + currentBufferRef.byteOffset;
-            return currentParser.onHeaderField(new FastBuffer(currentBufferRef.buffer, start, len)) || 0;
-          },
-          wasm_on_header_value: (p, at, len) => {
-            assert.strictEqual(currentParser.ptr, p);
-            const start = at - currentBufferPtr + currentBufferRef.byteOffset;
-            return currentParser.onHeaderValue(new FastBuffer(currentBufferRef.buffer, start, len)) || 0;
-          },
-          wasm_on_headers_complete: (p, statusCode, upgrade, shouldKeepAlive) => {
-            assert.strictEqual(currentParser.ptr, p);
-            return currentParser.onHeadersComplete(statusCode, Boolean(upgrade), Boolean(shouldKeepAlive)) || 0;
-          },
-          wasm_on_body: (p, at, len) => {
-            assert.strictEqual(currentParser.ptr, p);
-            const start = at - currentBufferPtr + currentBufferRef.byteOffset;
-            return currentParser.onBody(new FastBuffer(currentBufferRef.buffer, start, len)) || 0;
-          },
-          wasm_on_message_complete: (p) => {
-            assert.strictEqual(currentParser.ptr, p);
-            return currentParser.onMessageComplete() || 0;
-          }
+      onMessageComplete() {
+        const { client, socket, statusCode, upgrade, headers, contentLength, bytesRead, shouldKeepAlive } = this;
+        if (socket.destroyed && (!statusCode || shouldKeepAlive)) {
+          return -1;
         }
-      });
-    }
-    var llhttpInstance = null;
-    var llhttpPromise = lazyllhttp();
-    llhttpPromise.catch();
-    var currentParser = null;
-    var currentBufferRef = null;
-    var currentBufferSize = 0;
-    var currentBufferPtr = null;
-    var TIMEOUT_HEADERS = 1;
-    var TIMEOUT_BODY = 2;
-    var TIMEOUT_IDLE = 3;
-    var Parser = class {
-      constructor(client, socket, { exports: exports3 }) {
-        assert(Number.isFinite(client[kMaxHeadersSize]) && client[kMaxHeadersSize] > 0);
-        this.llhttp = exports3;
-        this.ptr = this.llhttp.llhttp_alloc(constants.TYPE.RESPONSE);
-        this.client = client;
-        this.socket = socket;
-        this.timeout = null;
-        this.timeoutValue = null;
-        this.timeoutType = null;
+        if (upgrade) {
+          return;
+        }
+        const request = client[kQueue][client[kRunningIdx]];
+        assert(request);
+        assert(statusCode >= 100);
         this.statusCode = null;
         this.statusText = "";
-        this.upgrade = false;
-        this.headers = [];
-        this.headersSize = 0;
-        this.headersMaxSize = client[kMaxHeadersSize];
-        this.shouldKeepAlive = false;
-        this.paused = false;
-        this.resume = this.resume.bind(this);
         this.bytesRead = 0;
-        this.keepAlive = "";
         this.contentLength = "";
+        this.keepAlive = "";
         this.connection = "";
-        this.maxResponseSize = client[kMaxResponseSize];
+        assert(this.headers.length % 2 === 0);
+        this.headers = [];
+        this.headersSize = 0;
+        if (statusCode < 200) {
+          return;
+        }
+        if (request.method !== "HEAD" && contentLength && bytesRead !== parseInt(contentLength, 10)) {
+          util.destroy(socket, new ResponseContentLengthMismatchError());
+          return -1;
+        }
+        try {
+          request.onComplete(headers);
+        } catch (err) {
+          errorRequest(client, request, err);
+        }
+        client[kQueue][client[kRunningIdx]++] = null;
+        if (socket[kWriting]) {
+          assert.strictEqual(client[kRunning], 0);
+          util.destroy(socket, new InformationalError("reset"));
+          return constants.ERROR.PAUSED;
+        } else if (!shouldKeepAlive) {
+          util.destroy(socket, new InformationalError("reset"));
+          return constants.ERROR.PAUSED;
+        } else if (socket[kReset] && client[kRunning] === 0) {
+          util.destroy(socket, new InformationalError("reset"));
+          return constants.ERROR.PAUSED;
+        } else if (client[kPipelining] === 1) {
+          setImmediate(resume, client);
+        } else {
+          resume(client);
+        }
       }
-      setTimeout(value, type) {
-        this.timeoutType = type;
-        if (value !== this.timeoutValue) {
-          timers.clearTimeout(this.timeout);
-          if (value) {
-            this.timeout = timers.setTimeout(onParserTimeout, value, this);
-            if (this.timeout.unref) {
-              this.timeout.unref();
-            }
-          } else {
-            this.timeout = null;
-          }
-          this.timeoutValue = value;
-        } else if (this.timeout) {
-          if (this.timeout.refresh) {
-            this.timeout.refresh();
-          }
+    };
+    function onParserTimeout(parser) {
+      const { socket, timeoutType, client } = parser;
+      if (timeoutType === TIMEOUT_HEADERS) {
+        if (!socket[kWriting] || socket.writableNeedDrain || client[kRunning] > 1) {
+          assert(!parser.paused, "cannot be paused while waiting for headers");
+          util.destroy(socket, new HeadersTimeoutError());
+        }
+      } else if (timeoutType === TIMEOUT_BODY) {
+        if (!parser.paused) {
+          util.destroy(socket, new BodyTimeoutError());
+        }
+      } else if (timeoutType === TIMEOUT_IDLE) {
+        assert(client[kRunning] === 0 && client[kKeepAliveTimeoutValue]);
+        util.destroy(socket, new InformationalError("socket idle timeout"));
+      }
+    }
+    function onSocketReadable() {
+      const { [kParser]: parser } = this;
+      parser.readMore();
+    }
+    function onSocketError(err) {
+      const { [kClient]: client, [kParser]: parser } = this;
+      assert(err.code !== "ERR_TLS_CERT_ALTNAME_INVALID");
+      if (client[kHTTPConnVersion] !== "h2") {
+        if (err.code === "ECONNRESET" && parser.statusCode && !parser.shouldKeepAlive) {
+          parser.onMessageComplete();
+          return;
+        }
+      }
+      this[kError] = err;
+      onError(this[kClient], err);
+    }
+    function onError(client, err) {
+      if (client[kRunning] === 0 && err.code !== "UND_ERR_INFO" && err.code !== "UND_ERR_SOCKET") {
+        assert(client[kPendingIdx] === client[kRunningIdx]);
+        const requests = client[kQueue].splice(client[kRunningIdx]);
+        for (let i = 0; i < requests.length; i++) {
+          const request = requests[i];
+          errorRequest(client, request, err);
         }
+        assert(client[kSize] === 0);
       }
-      resume() {
-        if (this.socket.destroyed || !this.paused) {
+    }
+    function onSocketEnd() {
+      const { [kParser]: parser, [kClient]: client } = this;
+      if (client[kHTTPConnVersion] !== "h2") {
+        if (parser.statusCode && !parser.shouldKeepAlive) {
+          parser.onMessageComplete();
           return;
         }
-        assert(this.ptr != null);
-        assert(currentParser == null);
-        this.llhttp.llhttp_resume(this.ptr);
-        assert(this.timeoutType === TIMEOUT_BODY);
-        if (this.timeout) {
-          if (this.timeout.refresh) {
-            this.timeout.refresh();
-          }
+      }
+      util.destroy(this, new SocketError("other side closed", util.getSocketInfo(this)));
+    }
+    function onSocketClose() {
+      const { [kClient]: client, [kParser]: parser } = this;
+      if (client[kHTTPConnVersion] === "h1" && parser) {
+        if (!this[kError] && parser.statusCode && !parser.shouldKeepAlive) {
+          parser.onMessageComplete();
         }
-        this.paused = false;
-        this.execute(this.socket.read() || EMPTY_BUF);
-        this.readMore();
+        this[kParser].destroy();
+        this[kParser] = null;
       }
-      readMore() {
-        while (!this.paused && this.ptr) {
-          const chunk = this.socket.read();
-          if (chunk === null) {
-            break;
-          }
-          this.execute(chunk);
+      const err = this[kError] || new SocketError("closed", util.getSocketInfo(this));
+      client[kSocket] = null;
+      if (client.destroyed) {
+        assert(client[kPending] === 0);
+        const requests = client[kQueue].splice(client[kRunningIdx]);
+        for (let i = 0; i < requests.length; i++) {
+          const request = requests[i];
+          errorRequest(client, request, err);
         }
+      } else if (client[kRunning] > 0 && err.code !== "UND_ERR_INFO") {
+        const request = client[kQueue][client[kRunningIdx]];
+        client[kQueue][client[kRunningIdx]++] = null;
+        errorRequest(client, request, err);
       }
-      execute(data) {
-        assert(this.ptr != null);
-        assert(currentParser == null);
-        assert(!this.paused);
-        const { socket, llhttp } = this;
-        if (data.length > currentBufferSize) {
-          if (currentBufferPtr) {
-            llhttp.free(currentBufferPtr);
-          }
-          currentBufferSize = Math.ceil(data.length / 4096) * 4096;
-          currentBufferPtr = llhttp.malloc(currentBufferSize);
+      client[kPendingIdx] = client[kRunningIdx];
+      assert(client[kRunning] === 0);
+      client.emit("disconnect", client[kUrl], [client], err);
+      resume(client);
+    }
+    async function connect(client) {
+      assert(!client[kConnecting]);
+      assert(!client[kSocket]);
+      let { host, hostname, protocol, port } = client[kUrl];
+      if (hostname[0] === "[") {
+        const idx = hostname.indexOf("]");
+        assert(idx !== -1);
+        const ip = hostname.substr(1, idx - 1);
+        assert(net.isIP(ip));
+        hostname = ip;
+      }
+      client[kConnecting] = true;
+      if (channels.beforeConnect.hasSubscribers) {
+        channels.beforeConnect.publish({
+          connectParams: {
+            host,
+            hostname,
+            protocol,
+            port,
+            servername: client[kServerName],
+            localAddress: client[kLocalAddress]
+          },
+          connector: client[kConnector]
+        });
+      }
+      try {
+        const socket = await new Promise((resolve, reject) => {
+          client[kConnector]({
+            host,
+            hostname,
+            protocol,
+            port,
+            servername: client[kServerName],
+            localAddress: client[kLocalAddress]
+          }, (err, socket2) => {
+            if (err) {
+              reject(err);
+            } else {
+              resolve(socket2);
+            }
+          });
+        });
+        if (client.destroyed) {
+          util.destroy(socket.on("error", () => {
+          }), new ClientDestroyedError());
+          return;
         }
-        new Uint8Array(llhttp.memory.buffer, currentBufferPtr, currentBufferSize).set(data);
-        try {
-          let ret;
-          try {
-            currentBufferRef = data;
-            currentParser = this;
-            ret = llhttp.llhttp_execute(this.ptr, currentBufferPtr, data.length);
-          } catch (err) {
-            throw err;
-          } finally {
-            currentParser = null;
-            currentBufferRef = null;
+        client[kConnecting] = false;
+        assert(socket);
+        const isH2 = socket.alpnProtocol === "h2";
+        if (isH2) {
+          if (!h2ExperimentalWarned) {
+            h2ExperimentalWarned = true;
+            process.emitWarning("H2 support is experimental, expect them to change at any time.", {
+              code: "UNDICI-H2"
+            });
           }
-          const offset = llhttp.llhttp_get_error_pos(this.ptr) - currentBufferPtr;
-          if (ret === constants.ERROR.PAUSED_UPGRADE) {
-            this.onUpgrade(data.slice(offset));
-          } else if (ret === constants.ERROR.PAUSED) {
-            this.paused = true;
-            socket.unshift(data.slice(offset));
-          } else if (ret !== constants.ERROR.OK) {
-            const ptr = llhttp.llhttp_get_error_reason(this.ptr);
-            let message = "";
-            if (ptr) {
-              const len = new Uint8Array(llhttp.memory.buffer, ptr).indexOf(0);
-              message = "Response does not match the HTTP/1.1 protocol (" + Buffer.from(llhttp.memory.buffer, ptr, len).toString() + ")";
-            }
-            throw new HTTPParserError(message, constants.ERROR[ret], data.slice(offset));
+          const session = http2.connect(client[kUrl], {
+            createConnection: () => socket,
+            peerMaxConcurrentStreams: client[kHTTP2SessionState].maxConcurrentStreams
+          });
+          client[kHTTPConnVersion] = "h2";
+          session[kClient] = client;
+          session[kSocket] = socket;
+          session.on("error", onHttp2SessionError);
+          session.on("frameError", onHttp2FrameError);
+          session.on("end", onHttp2SessionEnd);
+          session.on("goaway", onHTTP2GoAway);
+          session.on("close", onSocketClose);
+          session.unref();
+          client[kHTTP2Session] = session;
+          socket[kHTTP2Session] = session;
+        } else {
+          if (!llhttpInstance) {
+            llhttpInstance = await llhttpPromise;
+            llhttpPromise = null;
           }
-        } catch (err) {
-          util.destroy(socket, err);
+          socket[kNoRef] = false;
+          socket[kWriting] = false;
+          socket[kReset] = false;
+          socket[kBlocking] = false;
+          socket[kParser] = new Parser(client, socket, llhttpInstance);
+        }
+        socket[kCounter] = 0;
+        socket[kMaxRequests] = client[kMaxRequests];
+        socket[kClient] = client;
+        socket[kError] = null;
+        socket.on("error", onSocketError).on("readable", onSocketReadable).on("end", onSocketEnd).on("close", onSocketClose);
+        client[kSocket] = socket;
+        if (channels.connected.hasSubscribers) {
+          channels.connected.publish({
+            connectParams: {
+              host,
+              hostname,
+              protocol,
+              port,
+              servername: client[kServerName],
+              localAddress: client[kLocalAddress]
+            },
+            connector: client[kConnector],
+            socket
+          });
+        }
+        client.emit("connect", client[kUrl], [client]);
+      } catch (err) {
+        if (client.destroyed) {
+          return;
+        }
+        client[kConnecting] = false;
+        if (channels.connectError.hasSubscribers) {
+          channels.connectError.publish({
+            connectParams: {
+              host,
+              hostname,
+              protocol,
+              port,
+              servername: client[kServerName],
+              localAddress: client[kLocalAddress]
+            },
+            connector: client[kConnector],
+            error: err
+          });
+        }
+        if (err.code === "ERR_TLS_CERT_ALTNAME_INVALID") {
+          assert(client[kRunning] === 0);
+          while (client[kPending] > 0 && client[kQueue][client[kPendingIdx]].servername === client[kServerName]) {
+            const request = client[kQueue][client[kPendingIdx]++];
+            errorRequest(client, request, err);
+          }
+        } else {
+          onError(client, err);
         }
+        client.emit("connectionError", client[kUrl], [client], err);
       }
-      destroy() {
-        assert(this.ptr != null);
-        assert(currentParser == null);
-        this.llhttp.llhttp_free(this.ptr);
-        this.ptr = null;
-        timers.clearTimeout(this.timeout);
-        this.timeout = null;
-        this.timeoutValue = null;
-        this.timeoutType = null;
-        this.paused = false;
+      resume(client);
+    }
+    function emitDrain(client) {
+      client[kNeedDrain] = 0;
+      client.emit("drain", client[kUrl], [client]);
+    }
+    function resume(client, sync) {
+      if (client[kResuming] === 2) {
+        return;
       }
-      onStatus(buf) {
-        this.statusText = buf.toString();
+      client[kResuming] = 2;
+      _resume(client, sync);
+      client[kResuming] = 0;
+      if (client[kRunningIdx] > 256) {
+        client[kQueue].splice(0, client[kRunningIdx]);
+        client[kPendingIdx] -= client[kRunningIdx];
+        client[kRunningIdx] = 0;
       }
-      onMessageBegin() {
-        const { socket, client } = this;
-        if (socket.destroyed) {
-          return -1;
+    }
+    function _resume(client, sync) {
+      while (true) {
+        if (client.destroyed) {
+          assert(client[kPending] === 0);
+          return;
+        }
+        if (client[kClosedResolve] && !client[kSize]) {
+          client[kClosedResolve]();
+          client[kClosedResolve] = null;
+          return;
+        }
+        const socket = client[kSocket];
+        if (socket && !socket.destroyed && socket.alpnProtocol !== "h2") {
+          if (client[kSize] === 0) {
+            if (!socket[kNoRef] && socket.unref) {
+              socket.unref();
+              socket[kNoRef] = true;
+            }
+          } else if (socket[kNoRef] && socket.ref) {
+            socket.ref();
+            socket[kNoRef] = false;
+          }
+          if (client[kSize] === 0) {
+            if (socket[kParser].timeoutType !== TIMEOUT_IDLE) {
+              socket[kParser].setTimeout(client[kKeepAliveTimeoutValue], TIMEOUT_IDLE);
+            }
+          } else if (client[kRunning] > 0 && socket[kParser].statusCode < 200) {
+            if (socket[kParser].timeoutType !== TIMEOUT_HEADERS) {
+              const request2 = client[kQueue][client[kRunningIdx]];
+              const headersTimeout = request2.headersTimeout != null ? request2.headersTimeout : client[kHeadersTimeout];
+              socket[kParser].setTimeout(headersTimeout, TIMEOUT_HEADERS);
+            }
+          }
         }
-        const request = client[kQueue][client[kRunningIdx]];
-        if (!request) {
-          return -1;
+        if (client[kBusy]) {
+          client[kNeedDrain] = 2;
+        } else if (client[kNeedDrain] === 2) {
+          if (sync) {
+            client[kNeedDrain] = 1;
+            process.nextTick(emitDrain, client);
+          } else {
+            emitDrain(client);
+          }
+          continue;
         }
-      }
-      onHeaderField(buf) {
-        const len = this.headers.length;
-        if ((len & 1) === 0) {
-          this.headers.push(buf);
-        } else {
-          this.headers[len - 1] = Buffer.concat([this.headers[len - 1], buf]);
+        if (client[kPending] === 0) {
+          return;
         }
-        this.trackHeader(buf.length);
-      }
-      onHeaderValue(buf) {
-        let len = this.headers.length;
-        if ((len & 1) === 1) {
-          this.headers.push(buf);
-          len += 1;
-        } else {
-          this.headers[len - 1] = Buffer.concat([this.headers[len - 1], buf]);
+        if (client[kRunning] >= (client[kPipelining] || 1)) {
+          return;
         }
-        const key = this.headers[len - 2];
-        if (key.length === 10 && key.toString().toLowerCase() === "keep-alive") {
-          this.keepAlive += buf.toString();
-        } else if (key.length === 10 && key.toString().toLowerCase() === "connection") {
-          this.connection += buf.toString();
-        } else if (key.length === 14 && key.toString().toLowerCase() === "content-length") {
-          this.contentLength += buf.toString();
+        const request = client[kQueue][client[kPendingIdx]];
+        if (client[kUrl].protocol === "https:" && client[kServerName] !== request.servername) {
+          if (client[kRunning] > 0) {
+            return;
+          }
+          client[kServerName] = request.servername;
+          if (socket && socket.servername !== request.servername) {
+            util.destroy(socket, new InformationalError("servername changed"));
+            return;
+          }
         }
-        this.trackHeader(buf.length);
-      }
-      trackHeader(len) {
-        this.headersSize += len;
-        if (this.headersSize >= this.headersMaxSize) {
-          util.destroy(this.socket, new HeadersOverflowError());
+        if (client[kConnecting]) {
+          return;
         }
-      }
-      onUpgrade(head) {
-        const { upgrade, client, socket, headers, statusCode } = this;
-        assert(upgrade);
-        const request = client[kQueue][client[kRunningIdx]];
-        assert(request);
-        assert(!socket.destroyed);
-        assert(socket === client[kSocket]);
-        assert(!this.paused);
-        assert(request.upgrade || request.method === "CONNECT");
-        this.statusCode = null;
-        this.statusText = "";
-        this.shouldKeepAlive = null;
-        assert(this.headers.length % 2 === 0);
-        this.headers = [];
-        this.headersSize = 0;
-        socket.unshift(head);
-        socket[kParser].destroy();
-        socket[kParser] = null;
-        socket[kClient] = null;
-        socket[kError] = null;
-        socket.removeListener("error", onSocketError).removeListener("readable", onSocketReadable).removeListener("end", onSocketEnd).removeListener("close", onSocketClose);
-        client[kSocket] = null;
-        client[kQueue][client[kRunningIdx]++] = null;
-        client.emit("disconnect", client[kUrl], [client], new InformationalError("upgrade"));
-        try {
-          request.onUpgrade(statusCode, headers, socket);
-        } catch (err) {
-          util.destroy(socket, err);
+        if (!socket && !client[kHTTP2Session]) {
+          connect(client);
+          return;
         }
-        resume(client);
-      }
-      onHeadersComplete(statusCode, upgrade, shouldKeepAlive) {
-        const { client, socket, headers, statusText } = this;
-        if (socket.destroyed) {
-          return -1;
+        if (socket.destroyed || socket[kWriting] || socket[kReset] || socket[kBlocking]) {
+          return;
         }
-        const request = client[kQueue][client[kRunningIdx]];
-        if (!request) {
-          return -1;
+        if (client[kRunning] > 0 && !request.idempotent) {
+          return;
         }
-        assert(!this.upgrade);
-        assert(this.statusCode < 200);
-        if (statusCode === 100) {
-          util.destroy(socket, new SocketError("bad response", util.getSocketInfo(socket)));
-          return -1;
+        if (client[kRunning] > 0 && (request.upgrade || request.method === "CONNECT")) {
+          return;
         }
-        if (upgrade && !request.upgrade) {
-          util.destroy(socket, new SocketError("bad upgrade", util.getSocketInfo(socket)));
-          return -1;
+        if (util.isStream(request.body) && util.bodyLength(request.body) === 0) {
+          request.body.on(
+            "data",
+            /* istanbul ignore next */
+            function() {
+              assert(false);
+            }
+          ).on("error", function(err) {
+            errorRequest(client, request, err);
+          }).on("end", function() {
+            util.destroy(this);
+          });
+          request.body = null;
         }
-        assert.strictEqual(this.timeoutType, TIMEOUT_HEADERS);
-        this.statusCode = statusCode;
-        this.shouldKeepAlive = shouldKeepAlive || request.method === "HEAD" && !socket[kReset] && this.connection.toLowerCase() === "keep-alive";
-        if (this.statusCode >= 200) {
-          const bodyTimeout = request.bodyTimeout != null ? request.bodyTimeout : client[kBodyTimeout];
-          this.setTimeout(bodyTimeout, TIMEOUT_BODY);
-        } else if (this.timeout) {
-          if (this.timeout.refresh) {
-            this.timeout.refresh();
-          }
+        if (client[kRunning] > 0 && (util.isStream(request.body) || util.isAsyncIterable(request.body))) {
+          return;
         }
-        if (request.method === "CONNECT") {
-          assert(client[kRunning] === 1);
-          this.upgrade = true;
-          return 2;
+        if (!request.aborted && write(client, request)) {
+          client[kPendingIdx]++;
+        } else {
+          client[kQueue].splice(client[kPendingIdx], 1);
         }
-        if (upgrade) {
-          assert(client[kRunning] === 1);
-          this.upgrade = true;
-          return 2;
+      }
+    }
+    function write(client, request) {
+      if (client[kHTTPConnVersion] === "h2") {
+        writeH2(client, client[kHTTP2Session], request);
+        return;
+      }
+      const { body, method, path, host, upgrade, headers, blocking, reset } = request;
+      const expectsPayload = method === "PUT" || method === "POST" || method === "PATCH";
+      if (body && typeof body.read === "function") {
+        body.read(0);
+      }
+      let contentLength = util.bodyLength(body);
+      if (contentLength === null) {
+        contentLength = request.contentLength;
+      }
+      if (contentLength === 0 && !expectsPayload) {
+        contentLength = null;
+      }
+      if (request.contentLength !== null && request.contentLength !== contentLength) {
+        if (client[kStrictContentLength]) {
+          errorRequest(client, request, new RequestContentLengthMismatchError());
+          return false;
         }
-        assert(this.headers.length % 2 === 0);
-        this.headers = [];
-        this.headersSize = 0;
-        if (this.shouldKeepAlive && client[kPipelining]) {
-          const keepAliveTimeout = this.keepAlive ? util.parseKeepAliveTimeout(this.keepAlive) : null;
-          if (keepAliveTimeout != null) {
-            const timeout = Math.min(keepAliveTimeout - client[kKeepAliveTimeoutThreshold], client[kKeepAliveMaxTimeout]);
-            if (timeout <= 0) {
-              socket[kReset] = true;
-            } else {
-              client[kKeepAliveTimeoutValue] = timeout;
-            }
-          } else {
-            client[kKeepAliveTimeoutValue] = client[kKeepAliveDefaultTimeout];
+        process.emitWarning(new RequestContentLengthMismatchError());
+      }
+      const socket = client[kSocket];
+      try {
+        request.onConnect((err) => {
+          if (request.aborted || request.completed) {
+            return;
           }
+          errorRequest(client, request, err || new RequestAbortedError());
+          util.destroy(socket, new InformationalError("aborted"));
+        });
+      } catch (err) {
+        errorRequest(client, request, err);
+      }
+      if (request.aborted) {
+        return false;
+      }
+      if (method === "HEAD") {
+        socket[kReset] = true;
+      }
+      if (upgrade || method === "CONNECT") {
+        socket[kReset] = true;
+      }
+      if (reset != null) {
+        socket[kReset] = reset;
+      }
+      if (client[kMaxRequests] && socket[kCounter]++ >= client[kMaxRequests]) {
+        socket[kReset] = true;
+      }
+      if (blocking) {
+        socket[kBlocking] = true;
+      }
+      let header = `${method} ${path} HTTP/1.1\r
+`;
+      if (typeof host === "string") {
+        header += `host: ${host}\r
+`;
+      } else {
+        header += client[kHostHeader];
+      }
+      if (upgrade) {
+        header += `connection: upgrade\r
+upgrade: ${upgrade}\r
+`;
+      } else if (client[kPipelining] && !socket[kReset]) {
+        header += "connection: keep-alive\r\n";
+      } else {
+        header += "connection: close\r\n";
+      }
+      if (headers) {
+        header += headers;
+      }
+      if (channels.sendHeaders.hasSubscribers) {
+        channels.sendHeaders.publish({ request, headers: header, socket });
+      }
+      if (!body) {
+        if (contentLength === 0) {
+          socket.write(`${header}content-length: 0\r
+\r
+`, "latin1");
         } else {
+          assert(contentLength === null, "no body must not have content length");
+          socket.write(`${header}\r
+`, "latin1");
+        }
+        request.onRequestSent();
+      } else if (util.isBuffer(body)) {
+        assert(contentLength === body.byteLength, "buffer body must have content length");
+        socket.cork();
+        socket.write(`${header}content-length: ${contentLength}\r
+\r
+`, "latin1");
+        socket.write(body);
+        socket.uncork();
+        request.onBodySent(body);
+        request.onRequestSent();
+        if (!expectsPayload) {
           socket[kReset] = true;
         }
-        let pause;
-        try {
-          pause = request.onHeaders(statusCode, headers, this.resume, statusText) === false;
-        } catch (err) {
-          util.destroy(socket, err);
-          return -1;
-        }
-        if (request.method === "HEAD") {
-          return 1;
-        }
-        if (statusCode < 200) {
-          return 1;
-        }
-        if (socket[kBlocking]) {
-          socket[kBlocking] = false;
-          resume(client);
+      } else if (util.isBlobLike(body)) {
+        if (typeof body.stream === "function") {
+          writeIterable({ body: body.stream(), client, request, socket, contentLength, header, expectsPayload });
+        } else {
+          writeBlob({ body, client, request, socket, contentLength, header, expectsPayload });
         }
-        return pause ? constants.ERROR.PAUSED : 0;
+      } else if (util.isStream(body)) {
+        writeStream({ body, client, request, socket, contentLength, header, expectsPayload });
+      } else if (util.isIterable(body)) {
+        writeIterable({ body, client, request, socket, contentLength, header, expectsPayload });
+      } else {
+        assert(false);
       }
-      onBody(buf) {
-        const { client, socket, statusCode, maxResponseSize } = this;
-        if (socket.destroyed) {
-          return -1;
-        }
-        const request = client[kQueue][client[kRunningIdx]];
-        assert(request);
-        assert.strictEqual(this.timeoutType, TIMEOUT_BODY);
-        if (this.timeout) {
-          if (this.timeout.refresh) {
-            this.timeout.refresh();
-          }
-        }
-        assert(statusCode >= 200);
-        if (maxResponseSize > -1 && this.bytesRead + buf.length > maxResponseSize) {
-          util.destroy(socket, new ResponseExceededMaxSizeError());
-          return -1;
-        }
-        this.bytesRead += buf.length;
-        try {
-          if (request.onData(buf) === false) {
-            return constants.ERROR.PAUSED;
+      return true;
+    }
+    function writeH2(client, session, request) {
+      const { body, method, path, host, upgrade, expectContinue, signal, headers: reqHeaders } = request;
+      let headers;
+      if (typeof reqHeaders === "string")
+        headers = Request[kHTTP2CopyHeaders](reqHeaders.trim());
+      else
+        headers = reqHeaders;
+      if (upgrade) {
+        errorRequest(client, request, new Error("Upgrade not supported for H2"));
+        return false;
+      }
+      try {
+        request.onConnect((err) => {
+          if (request.aborted || request.completed) {
+            return;
           }
-        } catch (err) {
-          util.destroy(socket, err);
-          return -1;
-        }
+          errorRequest(client, request, err || new RequestAbortedError());
+        });
+      } catch (err) {
+        errorRequest(client, request, err);
       }
-      onMessageComplete() {
-        const { client, socket, statusCode, upgrade, headers, contentLength, bytesRead, shouldKeepAlive } = this;
-        if (socket.destroyed && (!statusCode || shouldKeepAlive)) {
-          return -1;
-        }
-        if (upgrade) {
-          return;
-        }
-        const request = client[kQueue][client[kRunningIdx]];
-        assert(request);
-        assert(statusCode >= 100);
-        this.statusCode = null;
-        this.statusText = "";
-        this.bytesRead = 0;
-        this.contentLength = "";
-        this.keepAlive = "";
-        this.connection = "";
-        assert(this.headers.length % 2 === 0);
-        this.headers = [];
-        this.headersSize = 0;
-        if (statusCode < 200) {
-          return;
-        }
-        if (request.method !== "HEAD" && contentLength && bytesRead !== parseInt(contentLength, 10)) {
-          util.destroy(socket, new ResponseContentLengthMismatchError());
-          return -1;
-        }
-        try {
-          request.onComplete(headers);
-        } catch (err) {
-          errorRequest(client, request, err);
-        }
-        client[kQueue][client[kRunningIdx]++] = null;
-        if (socket[kWriting]) {
-          assert.strictEqual(client[kRunning], 0);
-          util.destroy(socket, new InformationalError("reset"));
-          return constants.ERROR.PAUSED;
-        } else if (!shouldKeepAlive) {
-          util.destroy(socket, new InformationalError("reset"));
-          return constants.ERROR.PAUSED;
-        } else if (socket[kReset] && client[kRunning] === 0) {
-          util.destroy(socket, new InformationalError("reset"));
-          return constants.ERROR.PAUSED;
-        } else if (client[kPipelining] === 1) {
-          setImmediate(resume, client);
+      if (request.aborted) {
+        return false;
+      }
+      let stream;
+      const h2State = client[kHTTP2SessionState];
+      headers[HTTP2_HEADER_AUTHORITY] = host || client[kHost];
+      headers[HTTP2_HEADER_METHOD] = method;
+      if (method === "CONNECT") {
+        session.ref();
+        stream = session.request(headers, { endStream: false, signal });
+        if (stream.id && !stream.pending) {
+          request.onUpgrade(null, null, stream);
+          ++h2State.openStreams;
         } else {
-          resume(client);
+          stream.once("ready", () => {
+            request.onUpgrade(null, null, stream);
+            ++h2State.openStreams;
+          });
         }
+        stream.once("close", () => {
+          h2State.openStreams -= 1;
+          if (h2State.openStreams === 0)
+            session.unref();
+        });
+        return true;
       }
-    };
-    function onParserTimeout(parser) {
-      const { socket, timeoutType, client } = parser;
-      if (timeoutType === TIMEOUT_HEADERS) {
-        if (!socket[kWriting] || socket.writableNeedDrain || client[kRunning] > 1) {
-          assert(!parser.paused, "cannot be paused while waiting for headers");
-          util.destroy(socket, new HeadersTimeoutError());
-        }
-      } else if (timeoutType === TIMEOUT_BODY) {
-        if (!parser.paused) {
-          util.destroy(socket, new BodyTimeoutError());
-        }
-      } else if (timeoutType === TIMEOUT_IDLE) {
-        assert(client[kRunning] === 0 && client[kKeepAliveTimeoutValue]);
-        util.destroy(socket, new InformationalError("socket idle timeout"));
+      headers[HTTP2_HEADER_PATH] = path;
+      headers[HTTP2_HEADER_SCHEME] = "https";
+      const expectsPayload = method === "PUT" || method === "POST" || method === "PATCH";
+      if (body && typeof body.read === "function") {
+        body.read(0);
       }
-    }
-    function onSocketReadable() {
-      const { [kParser]: parser } = this;
-      parser.readMore();
-    }
-    function onSocketError(err) {
-      const { [kParser]: parser } = this;
-      assert(err.code !== "ERR_TLS_CERT_ALTNAME_INVALID");
-      if (err.code === "ECONNRESET" && parser.statusCode && !parser.shouldKeepAlive) {
-        parser.onMessageComplete();
-        return;
+      let contentLength = util.bodyLength(body);
+      if (contentLength == null) {
+        contentLength = request.contentLength;
       }
-      this[kError] = err;
-      onError(this[kClient], err);
-    }
-    function onError(client, err) {
-      if (client[kRunning] === 0 && err.code !== "UND_ERR_INFO" && err.code !== "UND_ERR_SOCKET") {
-        assert(client[kPendingIdx] === client[kRunningIdx]);
-        const requests = client[kQueue].splice(client[kRunningIdx]);
-        for (let i = 0; i < requests.length; i++) {
-          const request = requests[i];
-          errorRequest(client, request, err);
-        }
-        assert(client[kSize] === 0);
+      if (contentLength === 0 || !expectsPayload) {
+        contentLength = null;
       }
-    }
-    function onSocketEnd() {
-      const { [kParser]: parser } = this;
-      if (parser.statusCode && !parser.shouldKeepAlive) {
-        parser.onMessageComplete();
-        return;
+      if (request.contentLength != null && request.contentLength !== contentLength) {
+        if (client[kStrictContentLength]) {
+          errorRequest(client, request, new RequestContentLengthMismatchError());
+          return false;
+        }
+        process.emitWarning(new RequestContentLengthMismatchError());
       }
-      util.destroy(this, new SocketError("other side closed", util.getSocketInfo(this)));
-    }
-    function onSocketClose() {
-      const { [kClient]: client } = this;
-      if (!this[kError] && this[kParser].statusCode && !this[kParser].shouldKeepAlive) {
-        this[kParser].onMessageComplete();
+      if (contentLength != null) {
+        assert(body, "no body must not have content length");
+        headers[HTTP2_HEADER_CONTENT_LENGTH] = `${contentLength}`;
+      }
+      session.ref();
+      const shouldEndStream = method === "GET" || method === "HEAD";
+      if (expectContinue) {
+        headers[HTTP2_HEADER_EXPECT] = "100-continue";
+        stream = session.request(headers, { endStream: shouldEndStream, signal });
+        stream.once("continue", writeBodyH2);
+      } else {
+        stream = session.request(headers, {
+          endStream: shouldEndStream,
+          signal
+        });
+        writeBodyH2();
       }
-      this[kParser].destroy();
-      this[kParser] = null;
-      const err = this[kError] || new SocketError("closed", util.getSocketInfo(this));
-      client[kSocket] = null;
-      if (client.destroyed) {
-        assert(client[kPending] === 0);
-        const requests = client[kQueue].splice(client[kRunningIdx]);
-        for (let i = 0; i < requests.length; i++) {
-          const request = requests[i];
-          errorRequest(client, request, err);
+      ++h2State.openStreams;
+      stream.once("response", (headers2) => {
+        if (request.onHeaders(Number(headers2[HTTP2_HEADER_STATUS]), headers2, stream.resume.bind(stream), "") === false) {
+          stream.pause();
         }
-      } else if (client[kRunning] > 0 && err.code !== "UND_ERR_INFO") {
-        const request = client[kQueue][client[kRunningIdx]];
-        client[kQueue][client[kRunningIdx]++] = null;
+      });
+      stream.once("end", () => {
+        request.onComplete([]);
+      });
+      stream.on("data", (chunk) => {
+        if (request.onData(chunk) === false)
+          stream.pause();
+      });
+      stream.once("close", () => {
+        h2State.openStreams -= 1;
+        if (h2State.openStreams === 0)
+          session.unref();
+      });
+      stream.once("error", function(err) {
+        if (client[kHTTP2Session] && !client[kHTTP2Session].destroyed && !this.closed && !this.destroyed) {
+          h2State.streams -= 1;
+          util.destroy(stream, err);
+        }
+      });
+      stream.once("frameError", (type, code) => {
+        const err = new InformationalError(`HTTP/2: "frameError" received - type ${type}, code ${code}`);
         errorRequest(client, request, err);
+        if (client[kHTTP2Session] && !client[kHTTP2Session].destroyed && !this.closed && !this.destroyed) {
+          h2State.streams -= 1;
+          util.destroy(stream, err);
+        }
+      });
+      return true;
+      function writeBodyH2() {
+        if (!body) {
+          request.onRequestSent();
+        } else if (util.isBuffer(body)) {
+          assert(contentLength === body.byteLength, "buffer body must have content length");
+          stream.cork();
+          stream.write(body);
+          stream.uncork();
+          stream.end();
+          request.onBodySent(body);
+          request.onRequestSent();
+        } else if (util.isBlobLike(body)) {
+          if (typeof body.stream === "function") {
+            writeIterable({
+              client,
+              request,
+              contentLength,
+              h2stream: stream,
+              expectsPayload,
+              body: body.stream(),
+              socket: client[kSocket],
+              header: ""
+            });
+          } else {
+            writeBlob({
+              body,
+              client,
+              request,
+              contentLength,
+              expectsPayload,
+              h2stream: stream,
+              header: "",
+              socket: client[kSocket]
+            });
+          }
+        } else if (util.isStream(body)) {
+          writeStream({
+            body,
+            client,
+            request,
+            contentLength,
+            expectsPayload,
+            socket: client[kSocket],
+            h2stream: stream,
+            header: ""
+          });
+        } else if (util.isIterable(body)) {
+          writeIterable({
+            body,
+            client,
+            request,
+            contentLength,
+            expectsPayload,
+            header: "",
+            h2stream: stream,
+            socket: client[kSocket]
+          });
+        } else {
+          assert(false);
+        }
       }
-      client[kPendingIdx] = client[kRunningIdx];
-      assert(client[kRunning] === 0);
-      client.emit("disconnect", client[kUrl], [client], err);
-      resume(client);
     }
-    async function connect(client) {
-      assert(!client[kConnecting]);
-      assert(!client[kSocket]);
-      let { host, hostname, protocol, port } = client[kUrl];
-      if (hostname[0] === "[") {
-        const idx = hostname.indexOf("]");
-        assert(idx !== -1);
-        const ip = hostname.substr(1, idx - 1);
-        assert(net.isIP(ip));
-        hostname = ip;
-      }
-      client[kConnecting] = true;
-      if (channels.beforeConnect.hasSubscribers) {
-        channels.beforeConnect.publish({
-          connectParams: {
-            host,
-            hostname,
-            protocol,
-            port,
-            servername: client[kServerName],
-            localAddress: client[kLocalAddress]
-          },
-          connector: client[kConnector]
-        });
-      }
-      try {
-        const socket = await new Promise((resolve, reject) => {
-          client[kConnector]({
-            host,
-            hostname,
-            protocol,
-            port,
-            servername: client[kServerName],
-            localAddress: client[kLocalAddress]
-          }, (err, socket2) => {
+    function writeStream({ h2stream, body, client, request, socket, contentLength, header, expectsPayload }) {
+      assert(contentLength !== 0 || client[kRunning] === 0, "stream body cannot be pipelined");
+      if (client[kHTTPConnVersion] === "h2") {
+        let onPipeData = function(chunk) {
+          request.onBodySent(chunk);
+        };
+        const pipe = pipeline(
+          body,
+          h2stream,
+          (err) => {
             if (err) {
-              reject(err);
+              util.destroy(body, err);
+              util.destroy(h2stream, err);
             } else {
-              resolve(socket2);
+              request.onRequestSent();
             }
-          });
+          }
+        );
+        pipe.on("data", onPipeData);
+        pipe.once("end", () => {
+          pipe.removeListener("data", onPipeData);
+          util.destroy(pipe);
         });
-        if (client.destroyed) {
-          util.destroy(socket.on("error", () => {
-          }), new ClientDestroyedError());
+        return;
+      }
+      let finished = false;
+      const writer = new AsyncWriter({ socket, request, contentLength, client, expectsPayload, header });
+      const onData = function(chunk) {
+        if (finished) {
           return;
         }
-        if (!llhttpInstance) {
-          llhttpInstance = await llhttpPromise;
-          llhttpPromise = null;
-        }
-        client[kConnecting] = false;
-        assert(socket);
-        socket[kNoRef] = false;
-        socket[kWriting] = false;
-        socket[kReset] = false;
-        socket[kBlocking] = false;
-        socket[kError] = null;
-        socket[kParser] = new Parser(client, socket, llhttpInstance);
-        socket[kClient] = client;
-        socket[kCounter] = 0;
-        socket[kMaxRequests] = client[kMaxRequests];
-        socket.on("error", onSocketError).on("readable", onSocketReadable).on("end", onSocketEnd).on("close", onSocketClose);
-        client[kSocket] = socket;
-        if (channels.connected.hasSubscribers) {
-          channels.connected.publish({
-            connectParams: {
-              host,
-              hostname,
-              protocol,
-              port,
-              servername: client[kServerName],
-              localAddress: client[kLocalAddress]
-            },
-            connector: client[kConnector],
-            socket
-          });
+        try {
+          if (!writer.write(chunk) && this.pause) {
+            this.pause();
+          }
+        } catch (err) {
+          util.destroy(this, err);
         }
-        client.emit("connect", client[kUrl], [client]);
-      } catch (err) {
-        if (client.destroyed) {
+      };
+      const onDrain = function() {
+        if (finished) {
           return;
         }
-        client[kConnecting] = false;
-        if (channels.connectError.hasSubscribers) {
-          channels.connectError.publish({
-            connectParams: {
-              host,
-              hostname,
-              protocol,
-              port,
-              servername: client[kServerName],
-              localAddress: client[kLocalAddress]
-            },
-            connector: client[kConnector],
-            error: err
-          });
+        if (body.resume) {
+          body.resume();
         }
-        if (err.code === "ERR_TLS_CERT_ALTNAME_INVALID") {
-          assert(client[kRunning] === 0);
-          while (client[kPending] > 0 && client[kQueue][client[kPendingIdx]].servername === client[kServerName]) {
-            const request = client[kQueue][client[kPendingIdx]++];
-            errorRequest(client, request, err);
+      };
+      const onAbort = function() {
+        onFinished(new RequestAbortedError());
+      };
+      const onFinished = function(err) {
+        if (finished) {
+          return;
+        }
+        finished = true;
+        assert(socket.destroyed || socket[kWriting] && client[kRunning] <= 1);
+        socket.off("drain", onDrain).off("error", onFinished);
+        body.removeListener("data", onData).removeListener("end", onFinished).removeListener("error", onFinished).removeListener("close", onAbort);
+        if (!err) {
+          try {
+            writer.end();
+          } catch (er) {
+            err = er;
           }
+        }
+        writer.destroy(err);
+        if (err && (err.code !== "UND_ERR_INFO" || err.message !== "reset")) {
+          util.destroy(body, err);
         } else {
-          onError(client, err);
+          util.destroy(body);
         }
-        client.emit("connectionError", client[kUrl], [client], err);
+      };
+      body.on("data", onData).on("end", onFinished).on("error", onFinished).on("close", onAbort);
+      if (body.resume) {
+        body.resume();
       }
-      resume(client);
+      socket.on("drain", onDrain).on("error", onFinished);
     }
-    function emitDrain(client) {
-      client[kNeedDrain] = 0;
-      client.emit("drain", client[kUrl], [client]);
+    async function writeBlob({ h2stream, body, client, request, socket, contentLength, header, expectsPayload }) {
+      assert(contentLength === body.size, "blob body must have content length");
+      const isH2 = client[kHTTPConnVersion] === "h2";
+      try {
+        if (contentLength != null && contentLength !== body.size) {
+          throw new RequestContentLengthMismatchError();
+        }
+        const buffer = Buffer.from(await body.arrayBuffer());
+        if (isH2) {
+          h2stream.cork();
+          h2stream.write(buffer);
+          h2stream.uncork();
+        } else {
+          socket.cork();
+          socket.write(`${header}content-length: ${contentLength}\r
+\r
+`, "latin1");
+          socket.write(buffer);
+          socket.uncork();
+        }
+        request.onBodySent(buffer);
+        request.onRequestSent();
+        if (!expectsPayload) {
+          socket[kReset] = true;
+        }
+        resume(client);
+      } catch (err) {
+        util.destroy(isH2 ? h2stream : socket, err);
+      }
     }
-    function resume(client, sync) {
-      if (client[kResuming] === 2) {
+    async function writeIterable({ h2stream, body, client, request, socket, contentLength, header, expectsPayload }) {
+      assert(contentLength !== 0 || client[kRunning] === 0, "iterator body cannot be pipelined");
+      let callback = null;
+      function onDrain() {
+        if (callback) {
+          const cb = callback;
+          callback = null;
+          cb();
+        }
+      }
+      const waitForDrain = () => new Promise((resolve, reject) => {
+        assert(callback === null);
+        if (socket[kError]) {
+          reject(socket[kError]);
+        } else {
+          callback = resolve;
+        }
+      });
+      if (client[kHTTPConnVersion] === "h2") {
+        h2stream.on("close", onDrain).on("drain", onDrain);
+        try {
+          for await (const chunk of body) {
+            if (socket[kError]) {
+              throw socket[kError];
+            }
+            const res = h2stream.write(chunk);
+            request.onBodySent(chunk);
+            if (!res) {
+              await waitForDrain();
+            }
+          }
+        } catch (err) {
+          h2stream.destroy(err);
+        } finally {
+          request.onRequestSent();
+          h2stream.end();
+          h2stream.off("close", onDrain).off("drain", onDrain);
+        }
         return;
       }
-      client[kResuming] = 2;
-      _resume(client, sync);
-      client[kResuming] = 0;
-      if (client[kRunningIdx] > 256) {
-        client[kQueue].splice(0, client[kRunningIdx]);
-        client[kPendingIdx] -= client[kRunningIdx];
-        client[kRunningIdx] = 0;
+      socket.on("close", onDrain).on("drain", onDrain);
+      const writer = new AsyncWriter({ socket, request, contentLength, client, expectsPayload, header });
+      try {
+        for await (const chunk of body) {
+          if (socket[kError]) {
+            throw socket[kError];
+          }
+          if (!writer.write(chunk)) {
+            await waitForDrain();
+          }
+        }
+        writer.end();
+      } catch (err) {
+        writer.destroy(err);
+      } finally {
+        socket.off("close", onDrain).off("drain", onDrain);
       }
     }
-    function _resume(client, sync) {
-      while (true) {
-        if (client.destroyed) {
-          assert(client[kPending] === 0);
-          return;
+    var AsyncWriter = class {
+      constructor({ socket, request, contentLength, client, expectsPayload, header }) {
+        this.socket = socket;
+        this.request = request;
+        this.contentLength = contentLength;
+        this.client = client;
+        this.bytesWritten = 0;
+        this.expectsPayload = expectsPayload;
+        this.header = header;
+        socket[kWriting] = true;
+      }
+      write(chunk) {
+        const { socket, request, contentLength, client, bytesWritten, expectsPayload, header } = this;
+        if (socket[kError]) {
+          throw socket[kError];
         }
-        if (client[kClosedResolve] && !client[kSize]) {
-          client[kClosedResolve]();
-          client[kClosedResolve] = null;
-          return;
+        if (socket.destroyed) {
+          return false;
         }
-        const socket = client[kSocket];
-        if (socket && !socket.destroyed) {
-          if (client[kSize] === 0) {
-            if (!socket[kNoRef] && socket.unref) {
-              socket.unref();
-              socket[kNoRef] = true;
-            }
-          } else if (socket[kNoRef] && socket.ref) {
-            socket.ref();
-            socket[kNoRef] = false;
-          }
-          if (client[kSize] === 0) {
-            if (socket[kParser].timeoutType !== TIMEOUT_IDLE) {
-              socket[kParser].setTimeout(client[kKeepAliveTimeoutValue], TIMEOUT_IDLE);
-            }
-          } else if (client[kRunning] > 0 && socket[kParser].statusCode < 200) {
-            if (socket[kParser].timeoutType !== TIMEOUT_HEADERS) {
-              const request2 = client[kQueue][client[kRunningIdx]];
-              const headersTimeout = request2.headersTimeout != null ? request2.headersTimeout : client[kHeadersTimeout];
-              socket[kParser].setTimeout(headersTimeout, TIMEOUT_HEADERS);
-            }
+        const len = Buffer.byteLength(chunk);
+        if (!len) {
+          return true;
+        }
+        if (contentLength !== null && bytesWritten + len > contentLength) {
+          if (client[kStrictContentLength]) {
+            throw new RequestContentLengthMismatchError();
           }
+          process.emitWarning(new RequestContentLengthMismatchError());
         }
-        if (client[kBusy]) {
-          client[kNeedDrain] = 2;
-        } else if (client[kNeedDrain] === 2) {
-          if (sync) {
-            client[kNeedDrain] = 1;
-            process.nextTick(emitDrain, client);
+        socket.cork();
+        if (bytesWritten === 0) {
+          if (!expectsPayload) {
+            socket[kReset] = true;
+          }
+          if (contentLength === null) {
+            socket.write(`${header}transfer-encoding: chunked\r
+`, "latin1");
           } else {
-            emitDrain(client);
+            socket.write(`${header}content-length: ${contentLength}\r
+\r
+`, "latin1");
           }
-          continue;
         }
-        if (client[kPending] === 0) {
-          return;
+        if (contentLength === null) {
+          socket.write(`\r
+${len.toString(16)}\r
+`, "latin1");
+        }
+        this.bytesWritten += len;
+        const ret = socket.write(chunk);
+        socket.uncork();
+        request.onBodySent(chunk);
+        if (!ret) {
+          if (socket[kParser].timeout && socket[kParser].timeoutType === TIMEOUT_HEADERS) {
+            if (socket[kParser].timeout.refresh) {
+              socket[kParser].timeout.refresh();
+            }
+          }
+        }
+        return ret;
+      }
+      end() {
+        const { socket, contentLength, client, bytesWritten, expectsPayload, header, request } = this;
+        request.onRequestSent();
+        socket[kWriting] = false;
+        if (socket[kError]) {
+          throw socket[kError];
         }
-        if (client[kRunning] >= (client[kPipelining] || 1)) {
+        if (socket.destroyed) {
           return;
         }
-        const request = client[kQueue][client[kPendingIdx]];
-        if (client[kUrl].protocol === "https:" && client[kServerName] !== request.servername) {
-          if (client[kRunning] > 0) {
-            return;
+        if (bytesWritten === 0) {
+          if (expectsPayload) {
+            socket.write(`${header}content-length: 0\r
+\r
+`, "latin1");
+          } else {
+            socket.write(`${header}\r
+`, "latin1");
           }
-          client[kServerName] = request.servername;
-          if (socket && socket.servername !== request.servername) {
-            util.destroy(socket, new InformationalError("servername changed"));
-            return;
+        } else if (contentLength === null) {
+          socket.write("\r\n0\r\n\r\n", "latin1");
+        }
+        if (contentLength !== null && bytesWritten !== contentLength) {
+          if (client[kStrictContentLength]) {
+            throw new RequestContentLengthMismatchError();
+          } else {
+            process.emitWarning(new RequestContentLengthMismatchError());
           }
         }
-        if (client[kConnecting]) {
-          return;
+        if (socket[kParser].timeout && socket[kParser].timeoutType === TIMEOUT_HEADERS) {
+          if (socket[kParser].timeout.refresh) {
+            socket[kParser].timeout.refresh();
+          }
         }
-        if (!socket) {
-          connect(client);
-          return;
+        resume(client);
+      }
+      destroy(err) {
+        const { socket, client } = this;
+        socket[kWriting] = false;
+        if (err) {
+          assert(client[kRunning] <= 1, "pipeline should only contain this request");
+          util.destroy(socket, err);
         }
-        if (socket.destroyed || socket[kWriting] || socket[kReset] || socket[kBlocking]) {
-          return;
+      }
+    };
+    function errorRequest(client, request, err) {
+      try {
+        request.onError(err);
+        assert(request.aborted);
+      } catch (err2) {
+        client.emit("error", err2);
+      }
+    }
+    module2.exports = Client;
+  }
+});
+
+// lib/pool.js
+var require_pool = __commonJS({
+  "lib/pool.js"(exports2, module2) {
+    "use strict";
+    var {
+      PoolBase,
+      kClients,
+      kNeedDrain,
+      kAddClient,
+      kGetDispatcher
+    } = require_pool_base();
+    var Client = require_client();
+    var {
+      InvalidArgumentError
+    } = require_errors();
+    var util = require_util();
+    var { kUrl, kInterceptors } = require_symbols();
+    var buildConnector = require_connect();
+    var kOptions = Symbol("options");
+    var kConnections = Symbol("connections");
+    var kFactory = Symbol("factory");
+    function defaultFactory(origin, opts) {
+      return new Client(origin, opts);
+    }
+    var Pool = class extends PoolBase {
+      constructor(origin, {
+        connections,
+        factory = defaultFactory,
+        connect,
+        connectTimeout,
+        tls,
+        maxCachedSessions,
+        socketPath,
+        autoSelectFamily,
+        autoSelectFamilyAttemptTimeout,
+        allowH2,
+        ...options
+      } = {}) {
+        super();
+        if (connections != null && (!Number.isFinite(connections) || connections < 0)) {
+          throw new InvalidArgumentError("invalid connections");
         }
-        if (client[kRunning] > 0 && !request.idempotent) {
-          return;
+        if (typeof factory !== "function") {
+          throw new InvalidArgumentError("factory must be a function.");
         }
-        if (client[kRunning] > 0 && (request.upgrade || request.method === "CONNECT")) {
-          return;
+        if (connect != null && typeof connect !== "function" && typeof connect !== "object") {
+          throw new InvalidArgumentError("connect must be a function or an object");
         }
-        if (util.isStream(request.body) && util.bodyLength(request.body) === 0) {
-          request.body.on("data", function() {
-            assert(false);
-          }).on("error", function(err) {
-            errorRequest(client, request, err);
-          }).on("end", function() {
-            util.destroy(this);
+        if (typeof connect !== "function") {
+          connect = buildConnector({
+            ...tls,
+            maxCachedSessions,
+            allowH2,
+            socketPath,
+            timeout: connectTimeout == null ? 1e4 : connectTimeout,
+            ...util.nodeHasAutoSelectFamily && autoSelectFamily ? { autoSelectFamily, autoSelectFamilyAttemptTimeout } : void 0,
+            ...connect
           });
-          request.body = null;
         }
-        if (client[kRunning] > 0 && (util.isStream(request.body) || util.isAsyncIterable(request.body))) {
-          return;
+        this[kInterceptors] = options.interceptors && options.interceptors.Pool && Array.isArray(options.interceptors.Pool) ? options.interceptors.Pool : [];
+        this[kConnections] = connections || null;
+        this[kUrl] = util.parseOrigin(origin);
+        this[kOptions] = { ...util.deepClone(options), connect, allowH2 };
+        this[kOptions].interceptors = options.interceptors ? { ...options.interceptors } : void 0;
+        this[kFactory] = factory;
+      }
+      [kGetDispatcher]() {
+        let dispatcher = this[kClients].find((dispatcher2) => !dispatcher2[kNeedDrain]);
+        if (dispatcher) {
+          return dispatcher;
         }
-        if (!request.aborted && write(client, request)) {
-          client[kPendingIdx]++;
-        } else {
-          client[kQueue].splice(client[kPendingIdx], 1);
+        if (!this[kConnections] || this[kClients].length < this[kConnections]) {
+          dispatcher = this[kFactory](this[kUrl], this[kOptions]);
+          this[kAddClient](dispatcher);
         }
+        return dispatcher;
       }
+    };
+    module2.exports = Pool;
+  }
+});
+
+// lib/agent.js
+var require_agent = __commonJS({
+  "lib/agent.js"(exports2, module2) {
+    "use strict";
+    var { InvalidArgumentError } = require_errors();
+    var { kClients, kRunning, kClose, kDestroy, kDispatch, kInterceptors } = require_symbols();
+    var DispatcherBase = require_dispatcher_base();
+    var Pool = require_pool();
+    var Client = require_client();
+    var util = require_util();
+    var createRedirectInterceptor = require_redirectInterceptor();
+    var { WeakRef: WeakRef2, FinalizationRegistry } = require_dispatcher_weakref()();
+    var kOnConnect = Symbol("onConnect");
+    var kOnDisconnect = Symbol("onDisconnect");
+    var kOnConnectionError = Symbol("onConnectionError");
+    var kMaxRedirections = Symbol("maxRedirections");
+    var kOnDrain = Symbol("onDrain");
+    var kFactory = Symbol("factory");
+    var kFinalizer = Symbol("finalizer");
+    var kOptions = Symbol("options");
+    function defaultFactory(origin, opts) {
+      return opts && opts.connections === 1 ? new Client(origin, opts) : new Pool(origin, opts);
     }
-    function write(client, request) {
-      const { body, method, path, host, upgrade, headers, blocking, reset } = request;
-      const expectsPayload = method === "PUT" || method === "POST" || method === "PATCH";
-      if (body && typeof body.read === "function") {
-        body.read(0);
-      }
-      let contentLength = util.bodyLength(body);
-      if (contentLength === null) {
-        contentLength = request.contentLength;
-      }
-      if (contentLength === 0 && !expectsPayload) {
-        contentLength = null;
-      }
-      if (request.contentLength !== null && request.contentLength !== contentLength) {
-        if (client[kStrictContentLength]) {
-          errorRequest(client, request, new RequestContentLengthMismatchError());
-          return false;
+    var Agent = class extends DispatcherBase {
+      constructor({ factory = defaultFactory, maxRedirections = 0, connect, ...options } = {}) {
+        super();
+        if (typeof factory !== "function") {
+          throw new InvalidArgumentError("factory must be a function.");
         }
-        process.emitWarning(new RequestContentLengthMismatchError());
-      }
-      const socket = client[kSocket];
-      try {
-        request.onConnect((err) => {
-          if (request.aborted || request.completed) {
-            return;
-          }
-          errorRequest(client, request, err || new RequestAbortedError());
-          util.destroy(socket, new InformationalError("aborted"));
-        });
-      } catch (err) {
-        errorRequest(client, request, err);
-      }
-      if (request.aborted) {
-        return false;
-      }
-      if (method === "HEAD") {
-        socket[kReset] = true;
-      }
-      if (upgrade || method === "CONNECT") {
-        socket[kReset] = true;
-      }
-      if (reset != null) {
-        socket[kReset] = reset;
-      }
-      if (client[kMaxRequests] && socket[kCounter]++ >= client[kMaxRequests]) {
-        socket[kReset] = true;
-      }
-      if (blocking) {
-        socket[kBlocking] = true;
-      }
-      let header = `${method} ${path} HTTP/1.1\r
-`;
-      if (typeof host === "string") {
-        header += `host: ${host}\r
-`;
-      } else {
-        header += client[kHostHeader];
-      }
-      if (upgrade) {
-        header += `connection: upgrade\r
-upgrade: ${upgrade}\r
-`;
-      } else if (client[kPipelining] && !socket[kReset]) {
-        header += "connection: keep-alive\r\n";
-      } else {
-        header += "connection: close\r\n";
-      }
-      if (headers) {
-        header += headers;
+        if (connect != null && typeof connect !== "function" && typeof connect !== "object") {
+          throw new InvalidArgumentError("connect must be a function or an object");
+        }
+        if (!Number.isInteger(maxRedirections) || maxRedirections < 0) {
+          throw new InvalidArgumentError("maxRedirections must be a positive number");
+        }
+        if (connect && typeof connect !== "function") {
+          connect = { ...connect };
+        }
+        this[kInterceptors] = options.interceptors && options.interceptors.Agent && Array.isArray(options.interceptors.Agent) ? options.interceptors.Agent : [createRedirectInterceptor({ maxRedirections })];
+        this[kOptions] = { ...util.deepClone(options), connect };
+        this[kOptions].interceptors = options.interceptors ? { ...options.interceptors } : void 0;
+        this[kMaxRedirections] = maxRedirections;
+        this[kFactory] = factory;
+        this[kClients] = /* @__PURE__ */ new Map();
+        this[kFinalizer] = new FinalizationRegistry(
+          /* istanbul ignore next: gc is undeterministic */
+          (key) => {
+            const ref = this[kClients].get(key);
+            if (ref !== void 0 && ref.deref() === void 0) {
+              this[kClients].delete(key);
+            }
+          }
+        );
+        const agent = this;
+        this[kOnDrain] = (origin, targets) => {
+          agent.emit("drain", origin, [agent, ...targets]);
+        };
+        this[kOnConnect] = (origin, targets) => {
+          agent.emit("connect", origin, [agent, ...targets]);
+        };
+        this[kOnDisconnect] = (origin, targets, err) => {
+          agent.emit("disconnect", origin, [agent, ...targets], err);
+        };
+        this[kOnConnectionError] = (origin, targets, err) => {
+          agent.emit("connectionError", origin, [agent, ...targets], err);
+        };
       }
-      if (channels.sendHeaders.hasSubscribers) {
-        channels.sendHeaders.publish({ request, headers: header, socket });
+      get [kRunning]() {
+        let ret = 0;
+        for (const ref of this[kClients].values()) {
+          const client = ref.deref();
+          if (client) {
+            ret += client[kRunning];
+          }
+        }
+        return ret;
       }
-      if (!body) {
-        if (contentLength === 0) {
-          socket.write(`${header}content-length: 0\r
-\r
-`, "latin1");
+      [kDispatch](opts, handler) {
+        let key;
+        if (opts.origin && (typeof opts.origin === "string" || opts.origin instanceof URL)) {
+          key = String(opts.origin);
         } else {
-          assert(contentLength === null, "no body must not have content length");
-          socket.write(`${header}\r
-`, "latin1");
+          throw new InvalidArgumentError("opts.origin must be a non-empty string or URL.");
         }
-        request.onRequestSent();
-      } else if (util.isBuffer(body)) {
-        assert(contentLength === body.byteLength, "buffer body must have content length");
-        socket.cork();
-        socket.write(`${header}content-length: ${contentLength}\r
-\r
-`, "latin1");
-        socket.write(body);
-        socket.uncork();
-        request.onBodySent(body);
-        request.onRequestSent();
-        if (!expectsPayload) {
-          socket[kReset] = true;
+        const ref = this[kClients].get(key);
+        let dispatcher = ref ? ref.deref() : null;
+        if (!dispatcher) {
+          dispatcher = this[kFactory](opts.origin, this[kOptions]).on("drain", this[kOnDrain]).on("connect", this[kOnConnect]).on("disconnect", this[kOnDisconnect]).on("connectionError", this[kOnConnectionError]);
+          this[kClients].set(key, new WeakRef2(dispatcher));
+          this[kFinalizer].register(dispatcher, key);
         }
-      } else if (util.isBlobLike(body)) {
-        if (typeof body.stream === "function") {
-          writeIterable({ body: body.stream(), client, request, socket, contentLength, header, expectsPayload });
-        } else {
-          writeBlob({ body, client, request, socket, contentLength, header, expectsPayload });
+        return dispatcher.dispatch(opts, handler);
+      }
+      async [kClose]() {
+        const closePromises = [];
+        for (const ref of this[kClients].values()) {
+          const client = ref.deref();
+          if (client) {
+            closePromises.push(client.close());
+          }
         }
-      } else if (util.isStream(body)) {
-        writeStream({ body, client, request, socket, contentLength, header, expectsPayload });
-      } else if (util.isIterable(body)) {
-        writeIterable({ body, client, request, socket, contentLength, header, expectsPayload });
-      } else {
-        assert(false);
+        await Promise.all(closePromises);
       }
-      return true;
+      async [kDestroy](err) {
+        const destroyPromises = [];
+        for (const ref of this[kClients].values()) {
+          const client = ref.deref();
+          if (client) {
+            destroyPromises.push(client.destroy(err));
+          }
+        }
+        await Promise.all(destroyPromises);
+      }
+    };
+    module2.exports = Agent;
+  }
+});
+
+// lib/global.js
+var require_global2 = __commonJS({
+  "lib/global.js"(exports2, module2) {
+    "use strict";
+    var globalDispatcher = Symbol.for("undici.globalDispatcher.1");
+    var { InvalidArgumentError } = require_errors();
+    var Agent = require_agent();
+    if (getGlobalDispatcher() === void 0) {
+      setGlobalDispatcher(new Agent());
     }
-    function writeStream({ body, client, request, socket, contentLength, header, expectsPayload }) {
-      assert(contentLength !== 0 || client[kRunning] === 0, "stream body cannot be pipelined");
-      let finished = false;
-      const writer = new AsyncWriter({ socket, request, contentLength, client, expectsPayload, header });
-      const onData = function(chunk) {
-        if (finished) {
+    function setGlobalDispatcher(agent) {
+      if (!agent || typeof agent.dispatch !== "function") {
+        throw new InvalidArgumentError("Argument agent must implement Agent");
+      }
+      Object.defineProperty(globalThis, globalDispatcher, {
+        value: agent,
+        writable: true,
+        enumerable: false,
+        configurable: false
+      });
+    }
+    function getGlobalDispatcher() {
+      return globalThis[globalDispatcher];
+    }
+    module2.exports = {
+      setGlobalDispatcher,
+      getGlobalDispatcher
+    };
+  }
+});
+
+// lib/fetch/index.js
+var require_fetch = __commonJS({
+  "lib/fetch/index.js"(exports2, module2) {
+    var esbuildDetection = 1;
+    var {
+      Response,
+      makeNetworkError,
+      makeAppropriateNetworkError,
+      filterResponse,
+      makeResponse
+    } = require_response();
+    var { Headers } = require_headers();
+    var { Request, makeRequest } = require_request();
+    var zlib = require("zlib");
+    var {
+      bytesMatch,
+      makePolicyContainer,
+      clonePolicyContainer,
+      requestBadPort,
+      TAOCheck,
+      appendRequestOriginHeader,
+      responseLocationURL,
+      requestCurrentURL,
+      setRequestReferrerPolicyOnRedirect,
+      tryUpgradeRequestToAPotentiallyTrustworthyURL,
+      createOpaqueTimingInfo,
+      appendFetchMetadata,
+      corsCheck,
+      crossOriginResourcePolicyCheck,
+      determineRequestsReferrer,
+      coarsenedSharedCurrentTime,
+      createDeferredPromise,
+      isBlobLike,
+      sameOrigin,
+      isCancelled,
+      isAborted,
+      isErrorLike,
+      fullyReadBody,
+      readableStreamClose,
+      isomorphicEncode,
+      urlIsLocal,
+      urlIsHttpHttpsScheme,
+      urlHasHttpsScheme
+    } = require_util2();
+    var { kState, kHeaders, kGuard, kRealm } = require_symbols2();
+    var assert = require("assert");
+    var { safelyExtractBody } = require_body();
+    var {
+      redirectStatus,
+      nullBodyStatus,
+      safeMethods,
+      requestBodyHeader,
+      subresource,
+      DOMException
+    } = require_constants();
+    var { kHeadersList } = require_symbols();
+    var EE = require("events");
+    var { Readable, pipeline } = require("stream");
+    var { addAbortListener, isErrored, isReadable, nodeMajor, nodeMinor } = require_util();
+    var { dataURLProcessor, serializeAMimeType } = require_dataURL();
+    var { TransformStream } = require("stream/web");
+    var { getGlobalDispatcher } = require_global2();
+    var { webidl } = require_webidl();
+    var { STATUS_CODES } = require("http");
+    var resolveObjectURL;
+    var ReadableStream = globalThis.ReadableStream;
+    var Fetch = class extends EE {
+      constructor(dispatcher) {
+        super();
+        this.dispatcher = dispatcher;
+        this.connection = null;
+        this.dump = false;
+        this.state = "ongoing";
+        this.setMaxListeners(21);
+      }
+      terminate(reason) {
+        if (this.state !== "ongoing") {
           return;
         }
-        try {
-          if (!writer.write(chunk) && this.pause) {
-            this.pause();
-          }
-        } catch (err) {
-          util.destroy(this, err);
+        this.state = "terminated";
+        this.connection?.destroy(reason);
+        this.emit("terminated", reason);
+      }
+      // https://fetch.spec.whatwg.org/#fetch-controller-abort
+      abort(error) {
+        if (this.state !== "ongoing") {
+          return;
         }
-      };
-      const onDrain = function() {
-        if (finished) {
+        this.state = "aborted";
+        if (!error) {
+          error = new DOMException("The operation was aborted.", "AbortError");
+        }
+        this.serializedAbortReason = error;
+        this.connection?.destroy(error);
+        this.emit("terminated", error);
+      }
+    };
+    async function fetch2(input, init = {}) {
+      webidl.argumentLengthCheck(arguments, 1, { header: "globalThis.fetch" });
+      const p = createDeferredPromise();
+      let requestObject;
+      try {
+        requestObject = new Request(input, init);
+      } catch (e) {
+        p.reject(e);
+        return p.promise;
+      }
+      const request = requestObject[kState];
+      if (requestObject.signal.aborted) {
+        abortFetch(p, request, null, requestObject.signal.reason);
+        return p.promise;
+      }
+      const globalObject = request.client.globalObject;
+      if (globalObject?.constructor?.name === "ServiceWorkerGlobalScope") {
+        request.serviceWorkers = "none";
+      }
+      let responseObject = null;
+      const relevantRealm = null;
+      let locallyAborted = false;
+      let controller = null;
+      addAbortListener(
+        requestObject.signal,
+        () => {
+          locallyAborted = true;
+          assert(controller != null);
+          controller.abort(requestObject.signal.reason);
+          abortFetch(p, request, responseObject, requestObject.signal.reason);
+        }
+      );
+      const handleFetchDone = (response) => finalizeAndReportTiming(response, "fetch");
+      const processResponse = (response) => {
+        if (locallyAborted) {
           return;
         }
-        if (body.resume) {
-          body.resume();
-        }
-      };
-      const onAbort = function() {
-        onFinished(new RequestAbortedError());
-      };
-      const onFinished = function(err) {
-        if (finished) {
+        if (response.aborted) {
+          abortFetch(p, request, responseObject, controller.serializedAbortReason);
           return;
         }
-        finished = true;
-        assert(socket.destroyed || socket[kWriting] && client[kRunning] <= 1);
-        socket.off("drain", onDrain).off("error", onFinished);
-        body.removeListener("data", onData).removeListener("end", onFinished).removeListener("error", onFinished).removeListener("close", onAbort);
-        if (!err) {
-          try {
-            writer.end();
-          } catch (er) {
-            err = er;
-          }
-        }
-        writer.destroy(err);
-        if (err && (err.code !== "UND_ERR_INFO" || err.message !== "reset")) {
-          util.destroy(body, err);
-        } else {
-          util.destroy(body);
+        if (response.type === "error") {
+          p.reject(
+            Object.assign(new TypeError("fetch failed"), { cause: response.error })
+          );
+          return;
         }
+        responseObject = new Response();
+        responseObject[kState] = response;
+        responseObject[kRealm] = relevantRealm;
+        responseObject[kHeaders][kHeadersList] = response.headersList;
+        responseObject[kHeaders][kGuard] = "immutable";
+        responseObject[kHeaders][kRealm] = relevantRealm;
+        p.resolve(responseObject);
       };
-      body.on("data", onData).on("end", onFinished).on("error", onFinished).on("close", onAbort);
-      if (body.resume) {
-        body.resume();
+      controller = fetching({
+        request,
+        processResponseEndOfBody: handleFetchDone,
+        processResponse,
+        dispatcher: init.dispatcher ?? getGlobalDispatcher()
+        // undici
+      });
+      return p.promise;
+    }
+    function finalizeAndReportTiming(response, initiatorType = "other") {
+      if (response.type === "error" && response.aborted) {
+        return;
       }
-      socket.on("drain", onDrain).on("error", onFinished);
+      if (!response.urlList?.length) {
+        return;
+      }
+      const originalURL = response.urlList[0];
+      let timingInfo = response.timingInfo;
+      let cacheState = response.cacheState;
+      if (!urlIsHttpHttpsScheme(originalURL)) {
+        return;
+      }
+      if (timingInfo === null) {
+        return;
+      }
+      if (!timingInfo.timingAllowPassed) {
+        timingInfo = createOpaqueTimingInfo({
+          startTime: timingInfo.startTime
+        });
+        cacheState = "";
+      }
+      timingInfo.endTime = coarsenedSharedCurrentTime();
+      response.timingInfo = timingInfo;
+      markResourceTiming(
+        timingInfo,
+        originalURL,
+        initiatorType,
+        globalThis,
+        cacheState
+      );
     }
-    async function writeBlob({ body, client, request, socket, contentLength, header, expectsPayload }) {
-      assert(contentLength === body.size, "blob body must have content length");
-      try {
-        if (contentLength != null && contentLength !== body.size) {
-          throw new RequestContentLengthMismatchError();
-        }
-        const buffer = Buffer.from(await body.arrayBuffer());
-        socket.cork();
-        socket.write(`${header}content-length: ${contentLength}\r
-\r
-`, "latin1");
-        socket.write(buffer);
-        socket.uncork();
-        request.onBodySent(buffer);
-        request.onRequestSent();
-        if (!expectsPayload) {
-          socket[kReset] = true;
-        }
-        resume(client);
-      } catch (err) {
-        util.destroy(socket, err);
+    function markResourceTiming(timingInfo, originalURL, initiatorType, globalThis2, cacheState) {
+      if (nodeMajor > 18 || nodeMajor === 18 && nodeMinor >= 2) {
+        performance.markResourceTiming(timingInfo, originalURL.href, initiatorType, globalThis2, cacheState);
       }
     }
-    async function writeIterable({ body, client, request, socket, contentLength, header, expectsPayload }) {
-      assert(contentLength !== 0 || client[kRunning] === 0, "iterator body cannot be pipelined");
-      let callback = null;
-      function onDrain() {
-        if (callback) {
-          const cb = callback;
-          callback = null;
-          cb();
-        }
+    function abortFetch(p, request, responseObject, error) {
+      if (!error) {
+        error = new DOMException("The operation was aborted.", "AbortError");
       }
-      const waitForDrain = () => new Promise((resolve, reject) => {
-        assert(callback === null);
-        if (socket[kError]) {
-          reject(socket[kError]);
-        } else {
-          callback = resolve;
-        }
-      });
-      socket.on("close", onDrain).on("drain", onDrain);
-      const writer = new AsyncWriter({ socket, request, contentLength, client, expectsPayload, header });
-      try {
-        for await (const chunk of body) {
-          if (socket[kError]) {
-            throw socket[kError];
+      p.reject(error);
+      if (request.body != null && isReadable(request.body?.stream)) {
+        request.body.stream.cancel(error).catch((err) => {
+          if (err.code === "ERR_INVALID_STATE") {
+            return;
           }
-          if (!writer.write(chunk)) {
-            await waitForDrain();
+          throw err;
+        });
+      }
+      if (responseObject == null) {
+        return;
+      }
+      const response = responseObject[kState];
+      if (response.body != null && isReadable(response.body?.stream)) {
+        response.body.stream.cancel(error).catch((err) => {
+          if (err.code === "ERR_INVALID_STATE") {
+            return;
           }
-        }
-        writer.end();
-      } catch (err) {
-        writer.destroy(err);
-      } finally {
-        socket.off("close", onDrain).off("drain", onDrain);
+          throw err;
+        });
       }
     }
-    var AsyncWriter = class {
-      constructor({ socket, request, contentLength, client, expectsPayload, header }) {
-        this.socket = socket;
-        this.request = request;
-        this.contentLength = contentLength;
-        this.client = client;
-        this.bytesWritten = 0;
-        this.expectsPayload = expectsPayload;
-        this.header = header;
-        socket[kWriting] = true;
+    function fetching({
+      request,
+      processRequestBodyChunkLength,
+      processRequestEndOfBody,
+      processResponse,
+      processResponseEndOfBody,
+      processResponseConsumeBody,
+      useParallelQueue = false,
+      dispatcher
+      // undici
+    }) {
+      let taskDestination = null;
+      let crossOriginIsolatedCapability = false;
+      if (request.client != null) {
+        taskDestination = request.client.globalObject;
+        crossOriginIsolatedCapability = request.client.crossOriginIsolatedCapability;
       }
-      write(chunk) {
-        const { socket, request, contentLength, client, bytesWritten, expectsPayload, header } = this;
-        if (socket[kError]) {
-          throw socket[kError];
-        }
-        if (socket.destroyed) {
-          return false;
-        }
-        const len = Buffer.byteLength(chunk);
-        if (!len) {
-          return true;
-        }
-        if (contentLength !== null && bytesWritten + len > contentLength) {
-          if (client[kStrictContentLength]) {
-            throw new RequestContentLengthMismatchError();
-          }
-          process.emitWarning(new RequestContentLengthMismatchError());
+      const currenTime = coarsenedSharedCurrentTime(crossOriginIsolatedCapability);
+      const timingInfo = createOpaqueTimingInfo({
+        startTime: currenTime
+      });
+      const fetchParams = {
+        controller: new Fetch(dispatcher),
+        request,
+        timingInfo,
+        processRequestBodyChunkLength,
+        processRequestEndOfBody,
+        processResponse,
+        processResponseConsumeBody,
+        processResponseEndOfBody,
+        taskDestination,
+        crossOriginIsolatedCapability
+      };
+      assert(!request.body || request.body.stream);
+      if (request.window === "client") {
+        request.window = request.client?.globalObject?.constructor?.name === "Window" ? request.client : "no-window";
+      }
+      if (request.origin === "client") {
+        request.origin = request.client?.origin;
+      }
+      if (request.policyContainer === "client") {
+        if (request.client != null) {
+          request.policyContainer = clonePolicyContainer(
+            request.client.policyContainer
+          );
+        } else {
+          request.policyContainer = makePolicyContainer();
         }
-        socket.cork();
-        if (bytesWritten === 0) {
-          if (!expectsPayload) {
-            socket[kReset] = true;
+      }
+      if (!request.headersList.contains("accept")) {
+        const value = "*/*";
+        request.headersList.append("accept", value);
+      }
+      if (!request.headersList.contains("accept-language")) {
+        request.headersList.append("accept-language", "*");
+      }
+      if (request.priority === null) {
+      }
+      if (subresource.includes(request.destination)) {
+      }
+      mainFetch(fetchParams).catch((err) => {
+        fetchParams.controller.terminate(err);
+      });
+      return fetchParams.controller;
+    }
+    async function mainFetch(fetchParams, recursive = false) {
+      const request = fetchParams.request;
+      let response = null;
+      if (request.localURLsOnly && !urlIsLocal(requestCurrentURL(request))) {
+        response = makeNetworkError("local URLs only");
+      }
+      tryUpgradeRequestToAPotentiallyTrustworthyURL(request);
+      if (requestBadPort(request) === "blocked") {
+        response = makeNetworkError("bad port");
+      }
+      if (request.referrerPolicy === "") {
+        request.referrerPolicy = request.policyContainer.referrerPolicy;
+      }
+      if (request.referrer !== "no-referrer") {
+        request.referrer = determineRequestsReferrer(request);
+      }
+      if (response === null) {
+        response = await (async () => {
+          const currentURL = requestCurrentURL(request);
+          if (
+            // - request’s current URL’s origin is same origin with request’s origin,
+            //   and request’s response tainting is "basic"
+            sameOrigin(currentURL, request.url) && request.responseTainting === "basic" || // request’s current URL’s scheme is "data"
+            currentURL.protocol === "data:" || // - request’s mode is "navigate" or "websocket"
+            (request.mode === "navigate" || request.mode === "websocket")
+          ) {
+            request.responseTainting = "basic";
+            return await schemeFetch(fetchParams);
           }
-          if (contentLength === null) {
-            socket.write(`${header}transfer-encoding: chunked\r
-`, "latin1");
-          } else {
-            socket.write(`${header}content-length: ${contentLength}\r
-\r
-`, "latin1");
+          if (request.mode === "same-origin") {
+            return makeNetworkError('request mode cannot be "same-origin"');
           }
-        }
-        if (contentLength === null) {
-          socket.write(`\r
-${len.toString(16)}\r
-`, "latin1");
-        }
-        this.bytesWritten += len;
-        const ret = socket.write(chunk);
-        socket.uncork();
-        request.onBodySent(chunk);
-        if (!ret) {
-          if (socket[kParser].timeout && socket[kParser].timeoutType === TIMEOUT_HEADERS) {
-            if (socket[kParser].timeout.refresh) {
-              socket[kParser].timeout.refresh();
+          if (request.mode === "no-cors") {
+            if (request.redirect !== "follow") {
+              return makeNetworkError(
+                'redirect mode cannot be "follow" for "no-cors" request'
+              );
             }
+            request.responseTainting = "opaque";
+            return await schemeFetch(fetchParams);
           }
-        }
-        return ret;
-      }
-      end() {
-        const { socket, contentLength, client, bytesWritten, expectsPayload, header, request } = this;
-        request.onRequestSent();
-        socket[kWriting] = false;
-        if (socket[kError]) {
-          throw socket[kError];
-        }
-        if (socket.destroyed) {
-          return;
-        }
-        if (bytesWritten === 0) {
-          if (expectsPayload) {
-            socket.write(`${header}content-length: 0\r
-\r
-`, "latin1");
-          } else {
-            socket.write(`${header}\r
-`, "latin1");
-          }
-        } else if (contentLength === null) {
-          socket.write("\r\n0\r\n\r\n", "latin1");
-        }
-        if (contentLength !== null && bytesWritten !== contentLength) {
-          if (client[kStrictContentLength]) {
-            throw new RequestContentLengthMismatchError();
-          } else {
-            process.emitWarning(new RequestContentLengthMismatchError());
+          if (!urlIsHttpHttpsScheme(requestCurrentURL(request))) {
+            return makeNetworkError("URL scheme must be a HTTP(S) scheme");
           }
+          request.responseTainting = "cors";
+          return await httpFetch(fetchParams);
+        })();
+      }
+      if (recursive) {
+        return response;
+      }
+      if (response.status !== 0 && !response.internalResponse) {
+        if (request.responseTainting === "cors") {
         }
-        if (socket[kParser].timeout && socket[kParser].timeoutType === TIMEOUT_HEADERS) {
-          if (socket[kParser].timeout.refresh) {
-            socket[kParser].timeout.refresh();
-          }
+        if (request.responseTainting === "basic") {
+          response = filterResponse(response, "basic");
+        } else if (request.responseTainting === "cors") {
+          response = filterResponse(response, "cors");
+        } else if (request.responseTainting === "opaque") {
+          response = filterResponse(response, "opaque");
+        } else {
+          assert(false);
         }
-        resume(client);
       }
-      destroy(err) {
-        const { socket, client } = this;
-        socket[kWriting] = false;
-        if (err) {
-          assert(client[kRunning] <= 1, "pipeline should only contain this request");
-          util.destroy(socket, err);
-        }
+      let internalResponse = response.status === 0 ? response : response.internalResponse;
+      if (internalResponse.urlList.length === 0) {
+        internalResponse.urlList.push(...request.urlList);
       }
-    };
-    function errorRequest(client, request, err) {
-      try {
-        request.onError(err);
-        assert(request.aborted);
-      } catch (err2) {
-        client.emit("error", err2);
+      if (!request.timingAllowFailed) {
+        response.timingAllowPassed = true;
       }
-    }
-    module2.exports = Client;
-  }
-});
-
-// lib/pool.js
-var require_pool = __commonJS({
-  "lib/pool.js"(exports2, module2) {
-    "use strict";
-    var {
-      PoolBase,
-      kClients,
-      kNeedDrain,
-      kAddClient,
-      kGetDispatcher
-    } = require_pool_base();
-    var Client = require_client();
-    var {
-      InvalidArgumentError
-    } = require_errors();
-    var util = require_util();
-    var { kUrl, kInterceptors } = require_symbols();
-    var buildConnector = require_connect();
-    var kOptions = Symbol("options");
-    var kConnections = Symbol("connections");
-    var kFactory = Symbol("factory");
-    function defaultFactory(origin, opts) {
-      return new Client(origin, opts);
-    }
-    var Pool = class extends PoolBase {
-      constructor(origin, {
-        connections,
-        factory = defaultFactory,
-        connect,
-        connectTimeout,
-        tls,
-        maxCachedSessions,
-        socketPath,
-        autoSelectFamily,
-        autoSelectFamilyAttemptTimeout,
-        ...options
-      } = {}) {
-        super();
-        if (connections != null && (!Number.isFinite(connections) || connections < 0)) {
-          throw new InvalidArgumentError("invalid connections");
-        }
-        if (typeof factory !== "function") {
-          throw new InvalidArgumentError("factory must be a function.");
-        }
-        if (connect != null && typeof connect !== "function" && typeof connect !== "object") {
-          throw new InvalidArgumentError("connect must be a function or an object");
-        }
-        if (typeof connect !== "function") {
-          connect = buildConnector({
-            ...tls,
-            maxCachedSessions,
-            socketPath,
-            timeout: connectTimeout == null ? 1e4 : connectTimeout,
-            ...util.nodeHasAutoSelectFamily && autoSelectFamily ? { autoSelectFamily, autoSelectFamilyAttemptTimeout } : void 0,
-            ...connect
-          });
-        }
-        this[kInterceptors] = options.interceptors && options.interceptors.Pool && Array.isArray(options.interceptors.Pool) ? options.interceptors.Pool : [];
-        this[kConnections] = connections || null;
-        this[kUrl] = util.parseOrigin(origin);
-        this[kOptions] = { ...util.deepClone(options), connect };
-        this[kOptions].interceptors = options.interceptors ? { ...options.interceptors } : void 0;
-        this[kFactory] = factory;
+      if (response.type === "opaque" && internalResponse.status === 206 && internalResponse.rangeRequested && !request.headers.contains("range")) {
+        response = internalResponse = makeNetworkError();
       }
-      [kGetDispatcher]() {
-        let dispatcher = this[kClients].find((dispatcher2) => !dispatcher2[kNeedDrain]);
-        if (dispatcher) {
-          return dispatcher;
-        }
-        if (!this[kConnections] || this[kClients].length < this[kConnections]) {
-          dispatcher = this[kFactory](this[kUrl], this[kOptions]);
-          this[kAddClient](dispatcher);
-        }
-        return dispatcher;
+      if (response.status !== 0 && (request.method === "HEAD" || request.method === "CONNECT" || nullBodyStatus.includes(internalResponse.status))) {
+        internalResponse.body = null;
+        fetchParams.controller.dump = true;
       }
-    };
-    module2.exports = Pool;
-  }
-});
-
-// lib/agent.js
-var require_agent = __commonJS({
-  "lib/agent.js"(exports2, module2) {
-    "use strict";
-    var { InvalidArgumentError } = require_errors();
-    var { kClients, kRunning, kClose, kDestroy, kDispatch, kInterceptors } = require_symbols();
-    var DispatcherBase = require_dispatcher_base();
-    var Pool = require_pool();
-    var Client = require_client();
-    var util = require_util();
-    var createRedirectInterceptor = require_redirectInterceptor();
-    var { WeakRef: WeakRef2, FinalizationRegistry } = require_dispatcher_weakref()();
-    var kOnConnect = Symbol("onConnect");
-    var kOnDisconnect = Symbol("onDisconnect");
-    var kOnConnectionError = Symbol("onConnectionError");
-    var kMaxRedirections = Symbol("maxRedirections");
-    var kOnDrain = Symbol("onDrain");
-    var kFactory = Symbol("factory");
-    var kFinalizer = Symbol("finalizer");
-    var kOptions = Symbol("options");
-    function defaultFactory(origin, opts) {
-      return opts && opts.connections === 1 ? new Client(origin, opts) : new Pool(origin, opts);
-    }
-    var Agent = class extends DispatcherBase {
-      constructor({ factory = defaultFactory, maxRedirections = 0, connect, ...options } = {}) {
-        super();
-        if (typeof factory !== "function") {
-          throw new InvalidArgumentError("factory must be a function.");
-        }
-        if (connect != null && typeof connect !== "function" && typeof connect !== "object") {
-          throw new InvalidArgumentError("connect must be a function or an object");
-        }
-        if (!Number.isInteger(maxRedirections) || maxRedirections < 0) {
-          throw new InvalidArgumentError("maxRedirections must be a positive number");
-        }
-        if (connect && typeof connect !== "function") {
-          connect = { ...connect };
+      if (request.integrity) {
+        const processBodyError = (reason) => fetchFinale(fetchParams, makeNetworkError(reason));
+        if (request.responseTainting === "opaque" || response.body == null) {
+          processBodyError(response.error);
+          return;
         }
-        this[kInterceptors] = options.interceptors && options.interceptors.Agent && Array.isArray(options.interceptors.Agent) ? options.interceptors.Agent : [createRedirectInterceptor({ maxRedirections })];
-        this[kOptions] = { ...util.deepClone(options), connect };
-        this[kOptions].interceptors = options.interceptors ? { ...options.interceptors } : void 0;
-        this[kMaxRedirections] = maxRedirections;
-        this[kFactory] = factory;
-        this[kClients] = /* @__PURE__ */ new Map();
-        this[kFinalizer] = new FinalizationRegistry((key) => {
-          const ref = this[kClients].get(key);
-          if (ref !== void 0 && ref.deref() === void 0) {
-            this[kClients].delete(key);
-          }
-        });
-        const agent = this;
-        this[kOnDrain] = (origin, targets) => {
-          agent.emit("drain", origin, [agent, ...targets]);
-        };
-        this[kOnConnect] = (origin, targets) => {
-          agent.emit("connect", origin, [agent, ...targets]);
-        };
-        this[kOnDisconnect] = (origin, targets, err) => {
-          agent.emit("disconnect", origin, [agent, ...targets], err);
-        };
-        this[kOnConnectionError] = (origin, targets, err) => {
-          agent.emit("connectionError", origin, [agent, ...targets], err);
+        const processBody = (bytes) => {
+          if (!bytesMatch(bytes, request.integrity)) {
+            processBodyError("integrity mismatch");
+            return;
+          }
+          response.body = safelyExtractBody(bytes)[0];
+          fetchFinale(fetchParams, response);
         };
+        await fullyReadBody(response.body, processBody, processBodyError);
+      } else {
+        fetchFinale(fetchParams, response);
       }
-      get [kRunning]() {
-        let ret = 0;
-        for (const ref of this[kClients].values()) {
-          const client = ref.deref();
-          if (client) {
-            ret += client[kRunning];
-          }
-        }
-        return ret;
+    }
+    async function schemeFetch(fetchParams) {
+      if (isCancelled(fetchParams) && fetchParams.request.redirectCount === 0) {
+        return makeAppropriateNetworkError(fetchParams);
       }
-      [kDispatch](opts, handler) {
-        let key;
-        if (opts.origin && (typeof opts.origin === "string" || opts.origin instanceof URL)) {
-          key = String(opts.origin);
-        } else {
-          throw new InvalidArgumentError("opts.origin must be a non-empty string or URL.");
-        }
-        const ref = this[kClients].get(key);
-        let dispatcher = ref ? ref.deref() : null;
-        if (!dispatcher) {
-          dispatcher = this[kFactory](opts.origin, this[kOptions]).on("drain", this[kOnDrain]).on("connect", this[kOnConnect]).on("disconnect", this[kOnDisconnect]).on("connectionError", this[kOnConnectionError]);
-          this[kClients].set(key, new WeakRef2(dispatcher));
-          this[kFinalizer].register(dispatcher, key);
+      const { request } = fetchParams;
+      const { protocol: scheme } = requestCurrentURL(request);
+      switch (scheme) {
+        case "about:": {
+          return makeNetworkError("about scheme is not supported");
         }
-        return dispatcher.dispatch(opts, handler);
-      }
-      async [kClose]() {
-        const closePromises = [];
-        for (const ref of this[kClients].values()) {
-          const client = ref.deref();
-          if (client) {
-            closePromises.push(client.close());
+        case "blob:": {
+          if (!resolveObjectURL) {
+            resolveObjectURL = require("buffer").resolveObjectURL;
+          }
+          const blobURLEntry = requestCurrentURL(request);
+          if (blobURLEntry.search.length !== 0) {
+            return makeNetworkError("NetworkError when attempting to fetch resource.");
+          }
+          const blobURLEntryObject = resolveObjectURL(blobURLEntry.toString());
+          if (request.method !== "GET" || !isBlobLike(blobURLEntryObject)) {
+            return makeNetworkError("invalid method");
           }
+          const bodyWithType = safelyExtractBody(blobURLEntryObject);
+          const body = bodyWithType[0];
+          const length = isomorphicEncode(`${body.length}`);
+          const type = bodyWithType[1] ?? "";
+          const response = makeResponse({
+            statusText: "OK",
+            headersList: [
+              ["content-length", { name: "Content-Length", value: length }],
+              ["content-type", { name: "Content-Type", value: type }]
+            ]
+          });
+          response.body = body;
+          return response;
         }
-        await Promise.all(closePromises);
-      }
-      async [kDestroy](err) {
-        const destroyPromises = [];
-        for (const ref of this[kClients].values()) {
-          const client = ref.deref();
-          if (client) {
-            destroyPromises.push(client.destroy(err));
+        case "data:": {
+          const currentURL = requestCurrentURL(request);
+          const dataURLStruct = dataURLProcessor(currentURL);
+          if (dataURLStruct === "failure") {
+            return makeNetworkError("failed to fetch the data URL");
           }
+          const mimeType = serializeAMimeType(dataURLStruct.mimeType);
+          return makeResponse({
+            statusText: "OK",
+            headersList: [
+              ["content-type", { name: "Content-Type", value: mimeType }]
+            ],
+            body: safelyExtractBody(dataURLStruct.body)[0]
+          });
+        }
+        case "file:": {
+          return makeNetworkError("not implemented... yet...");
+        }
+        case "http:":
+        case "https:": {
+          return await httpFetch(fetchParams).catch((err) => makeNetworkError(err));
+        }
+        default: {
+          return makeNetworkError("unknown scheme");
         }
-        await Promise.all(destroyPromises);
       }
-    };
-    module2.exports = Agent;
-  }
-});
-
-// lib/global.js
-var require_global2 = __commonJS({
-  "lib/global.js"(exports2, module2) {
-    "use strict";
-    var globalDispatcher = Symbol.for("undici.globalDispatcher.1");
-    var { InvalidArgumentError } = require_errors();
-    var Agent = require_agent();
-    if (getGlobalDispatcher() === void 0) {
-      setGlobalDispatcher(new Agent());
     }
-    function setGlobalDispatcher(agent) {
-      if (!agent || typeof agent.dispatch !== "function") {
-        throw new InvalidArgumentError("Argument agent must implement Agent");
+    function finalizeResponse(fetchParams, response) {
+      fetchParams.request.done = true;
+      if (fetchParams.processResponseDone != null) {
+        queueMicrotask(() => fetchParams.processResponseDone(response));
       }
-      Object.defineProperty(globalThis, globalDispatcher, {
-        value: agent,
-        writable: true,
-        enumerable: false,
-        configurable: false
-      });
-    }
-    function getGlobalDispatcher() {
-      return globalThis[globalDispatcher];
     }
-    module2.exports = {
-      setGlobalDispatcher,
-      getGlobalDispatcher
-    };
-  }
-});
-
-// lib/fetch/index.js
-var require_fetch = __commonJS({
-  "lib/fetch/index.js"(exports2, module2) {
-    "use strict";
-    var {
-      Response,
-      makeNetworkError,
-      makeAppropriateNetworkError,
-      filterResponse,
-      makeResponse
-    } = require_response();
-    var { Headers } = require_headers();
-    var { Request, makeRequest } = require_request();
-    var zlib = require("zlib");
-    var {
-      bytesMatch,
-      makePolicyContainer,
-      clonePolicyContainer,
-      requestBadPort,
-      TAOCheck,
-      appendRequestOriginHeader,
-      responseLocationURL,
-      requestCurrentURL,
-      setRequestReferrerPolicyOnRedirect,
-      tryUpgradeRequestToAPotentiallyTrustworthyURL,
-      createOpaqueTimingInfo,
-      appendFetchMetadata,
-      corsCheck,
-      crossOriginResourcePolicyCheck,
-      determineRequestsReferrer,
-      coarsenedSharedCurrentTime,
-      createDeferredPromise,
-      isBlobLike,
-      sameOrigin,
-      isCancelled,
-      isAborted,
-      isErrorLike,
-      fullyReadBody,
-      readableStreamClose,
-      isomorphicEncode,
-      urlIsLocal,
-      urlIsHttpHttpsScheme,
-      urlHasHttpsScheme
-    } = require_util2();
-    var { kState, kHeaders, kGuard, kRealm } = require_symbols2();
-    var assert = require("assert");
-    var { safelyExtractBody } = require_body();
-    var {
-      redirectStatus,
-      nullBodyStatus,
-      safeMethods,
-      requestBodyHeader,
-      subresource,
-      DOMException
-    } = require_constants();
-    var { kHeadersList } = require_symbols();
-    var EE = require("events");
-    var { Readable, pipeline } = require("stream");
-    var { addAbortListener, isErrored, isReadable, nodeMajor, nodeMinor } = require_util();
-    var { dataURLProcessor, serializeAMimeType } = require_dataURL();
-    var { TransformStream } = require("stream/web");
-    var { getGlobalDispatcher } = require_global2();
-    var { webidl } = require_webidl();
-    var { STATUS_CODES } = require("http");
-    var resolveObjectURL;
-    var ReadableStream = globalThis.ReadableStream;
-    var Fetch = class extends EE {
-      constructor(dispatcher) {
-        super();
-        this.dispatcher = dispatcher;
-        this.connection = null;
-        this.dump = false;
-        this.state = "ongoing";
-        this.setMaxListeners(21);
+    async function fetchFinale(fetchParams, response) {
+      if (response.type === "error") {
+        response.urlList = [fetchParams.request.urlList[0]];
+        response.timingInfo = createOpaqueTimingInfo({
+          startTime: fetchParams.timingInfo.startTime
+        });
+      }
+      const processResponseEndOfBody = () => {
+        fetchParams.request.done = true;
+        if (fetchParams.processResponseEndOfBody != null) {
+          queueMicrotask(() => fetchParams.processResponseEndOfBody(response));
+        }
+      };
+      if (fetchParams.processResponse != null) {
+        queueMicrotask(() => fetchParams.processResponse(response));
+      }
+      if (response.body == null) {
+        processResponseEndOfBody();
+      } else {
+        const identityTransformAlgorithm = (chunk, controller) => {
+          controller.enqueue(chunk);
+        };
+        const transformStream = new TransformStream({
+          start() {
+          },
+          transform: identityTransformAlgorithm,
+          flush: processResponseEndOfBody
+        }, {
+          size() {
+            return 1;
+          }
+        }, {
+          size() {
+            return 1;
+          }
+        });
+        response.body = { stream: response.body.stream.pipeThrough(transformStream) };
+      }
+      if (fetchParams.processResponseConsumeBody != null) {
+        const processBody = (nullOrBytes) => fetchParams.processResponseConsumeBody(response, nullOrBytes);
+        const processBodyError = (failure) => fetchParams.processResponseConsumeBody(response, failure);
+        if (response.body == null) {
+          queueMicrotask(() => processBody(null));
+        } else {
+          await fullyReadBody(response.body, processBody, processBodyError);
+        }
       }
-      terminate(reason) {
-        if (this.state !== "ongoing") {
-          return;
+    }
+    async function httpFetch(fetchParams) {
+      const request = fetchParams.request;
+      let response = null;
+      let actualResponse = null;
+      const timingInfo = fetchParams.timingInfo;
+      if (request.serviceWorkers === "all") {
+      }
+      if (response === null) {
+        if (request.redirect === "follow") {
+          request.serviceWorkers = "none";
+        }
+        actualResponse = response = await httpNetworkOrCacheFetch(fetchParams);
+        if (request.responseTainting === "cors" && corsCheck(request, response) === "failure") {
+          return makeNetworkError("cors failure");
+        }
+        if (TAOCheck(request, response) === "failure") {
+          request.timingAllowFailed = true;
         }
-        this.state = "terminated";
-        this.connection?.destroy(reason);
-        this.emit("terminated", reason);
       }
-      abort(error) {
-        if (this.state !== "ongoing") {
-          return;
+      if ((request.responseTainting === "opaque" || response.type === "opaque") && crossOriginResourcePolicyCheck(
+        request.origin,
+        request.client,
+        request.destination,
+        actualResponse
+      ) === "blocked") {
+        return makeNetworkError("blocked");
+      }
+      if (redirectStatus.includes(actualResponse.status)) {
+        if (request.redirect !== "manual") {
+          fetchParams.controller.connection.destroy();
         }
-        this.state = "aborted";
-        if (!error) {
-          error = new DOMException("The operation was aborted.", "AbortError");
+        if (request.redirect === "error") {
+          response = makeNetworkError("unexpected redirect");
+        } else if (request.redirect === "manual") {
+          response = actualResponse;
+        } else if (request.redirect === "follow") {
+          response = await httpRedirectFetch(fetchParams, response);
+        } else {
+          assert(false);
         }
-        this.serializedAbortReason = error;
-        this.connection?.destroy(error);
-        this.emit("terminated", error);
       }
-    };
-    async function fetch2(input, init = {}) {
-      webidl.argumentLengthCheck(arguments, 1, { header: "globalThis.fetch" });
-      const p = createDeferredPromise();
-      let requestObject;
+      response.timingInfo = timingInfo;
+      return response;
+    }
+    async function httpRedirectFetch(fetchParams, response) {
+      const request = fetchParams.request;
+      const actualResponse = response.internalResponse ? response.internalResponse : response;
+      let locationURL;
       try {
-        requestObject = new Request(input, init);
-      } catch (e) {
-        p.reject(e);
-        return p.promise;
+        locationURL = responseLocationURL(
+          actualResponse,
+          requestCurrentURL(request).hash
+        );
+        if (locationURL == null) {
+          return response;
+        }
+      } catch (err) {
+        return makeNetworkError(err);
       }
-      const request = requestObject[kState];
-      if (requestObject.signal.aborted) {
-        abortFetch(p, request, null, requestObject.signal.reason);
-        return p.promise;
+      if (!urlIsHttpHttpsScheme(locationURL)) {
+        return makeNetworkError("URL scheme must be a HTTP(S) scheme");
       }
-      const globalObject = request.client.globalObject;
-      if (globalObject?.constructor?.name === "ServiceWorkerGlobalScope") {
-        request.serviceWorkers = "none";
+      if (request.redirectCount === 20) {
+        return makeNetworkError("redirect count exceeded");
       }
-      let responseObject = null;
-      const relevantRealm = null;
-      let locallyAborted = false;
-      let controller = null;
-      addAbortListener(requestObject.signal, () => {
-        locallyAborted = true;
-        assert(controller != null);
-        controller.abort(requestObject.signal.reason);
-        abortFetch(p, request, responseObject, requestObject.signal.reason);
-      });
-      const handleFetchDone = (response) => finalizeAndReportTiming(response, "fetch");
-      const processResponse = (response) => {
-        if (locallyAborted) {
-          return;
-        }
-        if (response.aborted) {
-          abortFetch(p, request, responseObject, controller.serializedAbortReason);
-          return;
-        }
-        if (response.type === "error") {
-          p.reject(Object.assign(new TypeError("fetch failed"), { cause: response.error }));
-          return;
-        }
-        responseObject = new Response();
-        responseObject[kState] = response;
-        responseObject[kRealm] = relevantRealm;
-        responseObject[kHeaders][kHeadersList] = response.headersList;
-        responseObject[kHeaders][kGuard] = "immutable";
-        responseObject[kHeaders][kRealm] = relevantRealm;
-        p.resolve(responseObject);
-      };
-      controller = fetching({
-        request,
-        processResponseEndOfBody: handleFetchDone,
-        processResponse,
-        dispatcher: init.dispatcher ?? getGlobalDispatcher()
-      });
-      return p.promise;
-    }
-    function finalizeAndReportTiming(response, initiatorType = "other") {
-      if (response.type === "error" && response.aborted) {
-        return;
+      request.redirectCount += 1;
+      if (request.mode === "cors" && (locationURL.username || locationURL.password) && !sameOrigin(request, locationURL)) {
+        return makeNetworkError('cross origin not allowed for request mode "cors"');
       }
-      if (!response.urlList?.length) {
-        return;
+      if (request.responseTainting === "cors" && (locationURL.username || locationURL.password)) {
+        return makeNetworkError(
+          'URL cannot contain credentials for request mode "cors"'
+        );
       }
-      const originalURL = response.urlList[0];
-      let timingInfo = response.timingInfo;
-      let cacheState = response.cacheState;
-      if (!urlIsHttpHttpsScheme(originalURL)) {
-        return;
+      if (actualResponse.status !== 303 && request.body != null && request.body.source == null) {
+        return makeNetworkError();
       }
-      if (timingInfo === null) {
-        return;
+      if ([301, 302].includes(actualResponse.status) && request.method === "POST" || actualResponse.status === 303 && !["GET", "HEAD"].includes(request.method)) {
+        request.method = "GET";
+        request.body = null;
+        for (const headerName of requestBodyHeader) {
+          request.headersList.delete(headerName);
+        }
       }
-      if (!timingInfo.timingAllowPassed) {
-        timingInfo = createOpaqueTimingInfo({
-          startTime: timingInfo.startTime
-        });
-        cacheState = "";
+      if (!sameOrigin(requestCurrentURL(request), locationURL)) {
+        request.headersList.delete("authorization");
+        request.headersList.delete("cookie");
+        request.headersList.delete("host");
       }
-      timingInfo.endTime = coarsenedSharedCurrentTime();
-      response.timingInfo = timingInfo;
-      markResourceTiming(timingInfo, originalURL, initiatorType, globalThis, cacheState);
-    }
-    function markResourceTiming(timingInfo, originalURL, initiatorType, globalThis2, cacheState) {
-      if (nodeMajor > 18 || nodeMajor === 18 && nodeMinor >= 2) {
-        performance.markResourceTiming(timingInfo, originalURL.href, initiatorType, globalThis2, cacheState);
+      if (request.body != null) {
+        assert(request.body.source != null);
+        request.body = safelyExtractBody(request.body.source)[0];
+      }
+      const timingInfo = fetchParams.timingInfo;
+      timingInfo.redirectEndTime = timingInfo.postRedirectStartTime = coarsenedSharedCurrentTime(fetchParams.crossOriginIsolatedCapability);
+      if (timingInfo.redirectStartTime === 0) {
+        timingInfo.redirectStartTime = timingInfo.startTime;
       }
+      request.urlList.push(locationURL);
+      setRequestReferrerPolicyOnRedirect(request, actualResponse);
+      return mainFetch(fetchParams, true);
     }
-    function abortFetch(p, request, responseObject, error) {
-      if (!error) {
-        error = new DOMException("The operation was aborted.", "AbortError");
+    async function httpNetworkOrCacheFetch(fetchParams, isAuthenticationFetch = false, isNewConnectionFetch = false) {
+      const request = fetchParams.request;
+      let httpFetchParams = null;
+      let httpRequest = null;
+      let response = null;
+      const httpCache = null;
+      const revalidatingFlag = false;
+      if (request.window === "no-window" && request.redirect === "error") {
+        httpFetchParams = fetchParams;
+        httpRequest = request;
+      } else {
+        httpRequest = makeRequest(request);
+        httpFetchParams = { ...fetchParams };
+        httpFetchParams.request = httpRequest;
       }
-      p.reject(error);
-      if (request.body != null && isReadable(request.body?.stream)) {
-        request.body.stream.cancel(error).catch((err) => {
-          if (err.code === "ERR_INVALID_STATE") {
-            return;
-          }
-          throw err;
-        });
+      const includeCredentials = request.credentials === "include" || request.credentials === "same-origin" && request.responseTainting === "basic";
+      const contentLength = httpRequest.body ? httpRequest.body.length : null;
+      let contentLengthHeaderValue = null;
+      if (httpRequest.body == null && ["POST", "PUT"].includes(httpRequest.method)) {
+        contentLengthHeaderValue = "0";
       }
-      if (responseObject == null) {
-        return;
+      if (contentLength != null) {
+        contentLengthHeaderValue = isomorphicEncode(`${contentLength}`);
       }
-      const response = responseObject[kState];
-      if (response.body != null && isReadable(response.body?.stream)) {
-        response.body.stream.cancel(error).catch((err) => {
-          if (err.code === "ERR_INVALID_STATE") {
-            return;
-          }
-          throw err;
-        });
+      if (contentLengthHeaderValue != null) {
+        httpRequest.headersList.append("content-length", contentLengthHeaderValue);
       }
-    }
-    function fetching({
-      request,
-      processRequestBodyChunkLength,
-      processRequestEndOfBody,
-      processResponse,
-      processResponseEndOfBody,
-      processResponseConsumeBody,
-      useParallelQueue = false,
-      dispatcher
-    }) {
-      let taskDestination = null;
-      let crossOriginIsolatedCapability = false;
-      if (request.client != null) {
-        taskDestination = request.client.globalObject;
-        crossOriginIsolatedCapability = request.client.crossOriginIsolatedCapability;
+      if (contentLength != null && httpRequest.keepalive) {
       }
-      const currenTime = coarsenedSharedCurrentTime(crossOriginIsolatedCapability);
-      const timingInfo = createOpaqueTimingInfo({
-        startTime: currenTime
-      });
-      const fetchParams = {
-        controller: new Fetch(dispatcher),
-        request,
-        timingInfo,
-        processRequestBodyChunkLength,
-        processRequestEndOfBody,
-        processResponse,
-        processResponseConsumeBody,
-        processResponseEndOfBody,
-        taskDestination,
-        crossOriginIsolatedCapability
-      };
-      assert(!request.body || request.body.stream);
-      if (request.window === "client") {
-        request.window = request.client?.globalObject?.constructor?.name === "Window" ? request.client : "no-window";
+      if (httpRequest.referrer instanceof URL) {
+        httpRequest.headersList.append("referer", isomorphicEncode(httpRequest.referrer.href));
+      }
+      appendRequestOriginHeader(httpRequest);
+      appendFetchMetadata(httpRequest);
+      if (!httpRequest.headersList.contains("user-agent")) {
+        httpRequest.headersList.append("user-agent", typeof esbuildDetection === "undefined" ? "undici" : "node");
+      }
+      if (httpRequest.cache === "default" && (httpRequest.headersList.contains("if-modified-since") || httpRequest.headersList.contains("if-none-match") || httpRequest.headersList.contains("if-unmodified-since") || httpRequest.headersList.contains("if-match") || httpRequest.headersList.contains("if-range"))) {
+        httpRequest.cache = "no-store";
+      }
+      if (httpRequest.cache === "no-cache" && !httpRequest.preventNoCacheCacheControlHeaderModification && !httpRequest.headersList.contains("cache-control")) {
+        httpRequest.headersList.append("cache-control", "max-age=0");
+      }
+      if (httpRequest.cache === "no-store" || httpRequest.cache === "reload") {
+        if (!httpRequest.headersList.contains("pragma")) {
+          httpRequest.headersList.append("pragma", "no-cache");
+        }
+        if (!httpRequest.headersList.contains("cache-control")) {
+          httpRequest.headersList.append("cache-control", "no-cache");
+        }
       }
-      if (request.origin === "client") {
-        request.origin = request.client?.origin;
+      if (httpRequest.headersList.contains("range")) {
+        httpRequest.headersList.append("accept-encoding", "identity");
       }
-      if (request.policyContainer === "client") {
-        if (request.client != null) {
-          request.policyContainer = clonePolicyContainer(request.client.policyContainer);
+      if (!httpRequest.headersList.contains("accept-encoding")) {
+        if (urlHasHttpsScheme(requestCurrentURL(httpRequest))) {
+          httpRequest.headersList.append("accept-encoding", "br, gzip, deflate");
         } else {
-          request.policyContainer = makePolicyContainer();
+          httpRequest.headersList.append("accept-encoding", "gzip, deflate");
         }
       }
-      if (!request.headersList.contains("accept")) {
-        const value = "*/*";
-        request.headersList.append("accept", value);
+      httpRequest.headersList.delete("host");
+      if (includeCredentials) {
       }
-      if (!request.headersList.contains("accept-language")) {
-        request.headersList.append("accept-language", "*");
+      if (httpCache == null) {
+        httpRequest.cache = "no-store";
       }
-      if (request.priority === null) {
+      if (httpRequest.mode !== "no-store" && httpRequest.mode !== "reload") {
       }
-      if (subresource.includes(request.destination)) {
+      if (response == null) {
+        if (httpRequest.mode === "only-if-cached") {
+          return makeNetworkError("only if cached");
+        }
+        const forwardResponse = await httpNetworkFetch(
+          httpFetchParams,
+          includeCredentials,
+          isNewConnectionFetch
+        );
+        if (!safeMethods.includes(httpRequest.method) && forwardResponse.status >= 200 && forwardResponse.status <= 399) {
+        }
+        if (revalidatingFlag && forwardResponse.status === 304) {
+        }
+        if (response == null) {
+          response = forwardResponse;
+        }
       }
-      mainFetch(fetchParams).catch((err) => {
-        fetchParams.controller.terminate(err);
-      });
-      return fetchParams.controller;
+      response.urlList = [...httpRequest.urlList];
+      if (httpRequest.headersList.contains("range")) {
+        response.rangeRequested = true;
+      }
+      response.requestIncludesCredentials = includeCredentials;
+      if (response.status === 407) {
+        if (request.window === "no-window") {
+          return makeNetworkError();
+        }
+        if (isCancelled(fetchParams)) {
+          return makeAppropriateNetworkError(fetchParams);
+        }
+        return makeNetworkError("proxy authentication required");
+      }
+      if (
+        // response’s status is 421
+        response.status === 421 && // isNewConnectionFetch is false
+        !isNewConnectionFetch && // request’s body is null, or request’s body is non-null and request’s body’s source is non-null
+        (request.body == null || request.body.source != null)
+      ) {
+        if (isCancelled(fetchParams)) {
+          return makeAppropriateNetworkError(fetchParams);
+        }
+        fetchParams.controller.connection.destroy();
+        response = await httpNetworkOrCacheFetch(
+          fetchParams,
+          isAuthenticationFetch,
+          true
+        );
+      }
+      if (isAuthenticationFetch) {
+      }
+      return response;
     }
-    async function mainFetch(fetchParams, recursive = false) {
+    async function httpNetworkFetch(fetchParams, includeCredentials = false, forceNewConnection = false) {
+      assert(!fetchParams.controller.connection || fetchParams.controller.connection.destroyed);
+      fetchParams.controller.connection = {
+        abort: null,
+        destroyed: false,
+        destroy(err) {
+          if (!this.destroyed) {
+            this.destroyed = true;
+            this.abort?.(err ?? new DOMException("The operation was aborted.", "AbortError"));
+          }
+        }
+      };
       const request = fetchParams.request;
       let response = null;
-      if (request.localURLsOnly && !urlIsLocal(requestCurrentURL(request))) {
-        response = makeNetworkError("local URLs only");
-      }
-      tryUpgradeRequestToAPotentiallyTrustworthyURL(request);
-      if (requestBadPort(request) === "blocked") {
-        response = makeNetworkError("bad port");
-      }
-      if (request.referrerPolicy === "") {
-        request.referrerPolicy = request.policyContainer.referrerPolicy;
+      const timingInfo = fetchParams.timingInfo;
+      const httpCache = null;
+      if (httpCache == null) {
+        request.cache = "no-store";
       }
-      if (request.referrer !== "no-referrer") {
-        request.referrer = determineRequestsReferrer(request);
+      const newConnection = forceNewConnection ? "yes" : "no";
+      if (request.mode === "websocket") {
+      } else {
       }
-      if (response === null) {
-        response = await (async () => {
-          const currentURL = requestCurrentURL(request);
-          if (sameOrigin(currentURL, request.url) && request.responseTainting === "basic" || currentURL.protocol === "data:" || (request.mode === "navigate" || request.mode === "websocket")) {
-            request.responseTainting = "basic";
-            return await schemeFetch(fetchParams);
+      let requestBody = null;
+      if (request.body == null && fetchParams.processRequestEndOfBody) {
+        queueMicrotask(() => fetchParams.processRequestEndOfBody());
+      } else if (request.body != null) {
+        const processBodyChunk = async function* (bytes) {
+          if (isCancelled(fetchParams)) {
+            return;
           }
-          if (request.mode === "same-origin") {
-            return makeNetworkError('request mode cannot be "same-origin"');
+          yield bytes;
+          fetchParams.processRequestBodyChunkLength?.(bytes.byteLength);
+        };
+        const processEndOfBody = () => {
+          if (isCancelled(fetchParams)) {
+            return;
           }
-          if (request.mode === "no-cors") {
-            if (request.redirect !== "follow") {
-              return makeNetworkError('redirect mode cannot be "follow" for "no-cors" request');
-            }
-            request.responseTainting = "opaque";
-            return await schemeFetch(fetchParams);
+          if (fetchParams.processRequestEndOfBody) {
+            fetchParams.processRequestEndOfBody();
           }
-          if (!urlIsHttpHttpsScheme(requestCurrentURL(request))) {
-            return makeNetworkError("URL scheme must be a HTTP(S) scheme");
+        };
+        const processBodyError = (e) => {
+          if (isCancelled(fetchParams)) {
+            return;
           }
-          request.responseTainting = "cors";
-          return await httpFetch(fetchParams);
-        })();
-      }
-      if (recursive) {
-        return response;
+          if (e.name === "AbortError") {
+            fetchParams.controller.abort();
+          } else {
+            fetchParams.controller.terminate(e);
+          }
+        };
+        requestBody = async function* () {
+          try {
+            for await (const bytes of request.body.stream) {
+              yield* processBodyChunk(bytes);
+            }
+            processEndOfBody();
+          } catch (err) {
+            processBodyError(err);
+          }
+        }();
       }
-      if (response.status !== 0 && !response.internalResponse) {
-        if (request.responseTainting === "cors") {
-        }
-        if (request.responseTainting === "basic") {
-          response = filterResponse(response, "basic");
-        } else if (request.responseTainting === "cors") {
-          response = filterResponse(response, "cors");
-        } else if (request.responseTainting === "opaque") {
-          response = filterResponse(response, "opaque");
+      try {
+        const { body, status, statusText, headersList, socket } = await dispatch({ body: requestBody });
+        if (socket) {
+          response = makeResponse({ status, statusText, headersList, socket });
         } else {
-          assert(false);
+          const iterator = body[Symbol.asyncIterator]();
+          fetchParams.controller.next = () => iterator.next();
+          response = makeResponse({ status, statusText, headersList });
         }
+      } catch (err) {
+        if (err.name === "AbortError") {
+          fetchParams.controller.connection.destroy();
+          return makeAppropriateNetworkError(fetchParams, err);
+        }
+        return makeNetworkError(err);
       }
-      let internalResponse = response.status === 0 ? response : response.internalResponse;
-      if (internalResponse.urlList.length === 0) {
-        internalResponse.urlList.push(...request.urlList);
-      }
-      if (!request.timingAllowFailed) {
-        response.timingAllowPassed = true;
-      }
-      if (response.type === "opaque" && internalResponse.status === 206 && internalResponse.rangeRequested && !request.headers.contains("range")) {
-        response = internalResponse = makeNetworkError();
-      }
-      if (response.status !== 0 && (request.method === "HEAD" || request.method === "CONNECT" || nullBodyStatus.includes(internalResponse.status))) {
-        internalResponse.body = null;
-        fetchParams.controller.dump = true;
+      const pullAlgorithm = () => {
+        fetchParams.controller.resume();
+      };
+      const cancelAlgorithm = (reason) => {
+        fetchParams.controller.abort(reason);
+      };
+      if (!ReadableStream) {
+        ReadableStream = require("stream/web").ReadableStream;
       }
-      if (request.integrity) {
-        const processBodyError = (reason) => fetchFinale(fetchParams, makeNetworkError(reason));
-        if (request.responseTainting === "opaque" || response.body == null) {
-          processBodyError(response.error);
-          return;
+      const stream = new ReadableStream(
+        {
+          async start(controller) {
+            fetchParams.controller.controller = controller;
+          },
+          async pull(controller) {
+            await pullAlgorithm(controller);
+          },
+          async cancel(reason) {
+            await cancelAlgorithm(reason);
+          }
+        },
+        {
+          highWaterMark: 0,
+          size() {
+            return 1;
+          }
         }
-        const processBody = (bytes) => {
-          if (!bytesMatch(bytes, request.integrity)) {
-            processBodyError("integrity mismatch");
+      );
+      response.body = { stream };
+      fetchParams.controller.on("terminated", onAborted);
+      fetchParams.controller.resume = async () => {
+        while (true) {
+          let bytes;
+          let isFailure;
+          try {
+            const { done, value } = await fetchParams.controller.next();
+            if (isAborted(fetchParams)) {
+              break;
+            }
+            bytes = done ? void 0 : value;
+          } catch (err) {
+            if (fetchParams.controller.ended && !timingInfo.encodedBodySize) {
+              bytes = void 0;
+            } else {
+              bytes = err;
+              isFailure = true;
+            }
+          }
+          if (bytes === void 0) {
+            readableStreamClose(fetchParams.controller.controller);
+            finalizeResponse(fetchParams, response);
             return;
           }
-          response.body = safelyExtractBody(bytes)[0];
-          fetchFinale(fetchParams, response);
-        };
-        await fullyReadBody(response.body, processBody, processBodyError);
-      } else {
-        fetchFinale(fetchParams, response);
-      }
-    }
-    async function schemeFetch(fetchParams) {
-      if (isCancelled(fetchParams) && fetchParams.request.redirectCount === 0) {
-        return makeAppropriateNetworkError(fetchParams);
-      }
-      const { request } = fetchParams;
-      const { protocol: scheme } = requestCurrentURL(request);
-      switch (scheme) {
-        case "about:": {
-          return makeNetworkError("about scheme is not supported");
-        }
-        case "blob:": {
-          if (!resolveObjectURL) {
-            resolveObjectURL = require("buffer").resolveObjectURL;
+          timingInfo.decodedBodySize += bytes?.byteLength ?? 0;
+          if (isFailure) {
+            fetchParams.controller.terminate(bytes);
+            return;
           }
-          const blobURLEntry = requestCurrentURL(request);
-          if (blobURLEntry.search.length !== 0) {
-            return makeNetworkError("NetworkError when attempting to fetch resource.");
+          fetchParams.controller.controller.enqueue(new Uint8Array(bytes));
+          if (isErrored(stream)) {
+            fetchParams.controller.terminate();
+            return;
           }
-          const blobURLEntryObject = resolveObjectURL(blobURLEntry.toString());
-          if (request.method !== "GET" || !isBlobLike(blobURLEntryObject)) {
-            return makeNetworkError("invalid method");
+          if (!fetchParams.controller.controller.desiredSize) {
+            return;
           }
-          const bodyWithType = safelyExtractBody(blobURLEntryObject);
-          const body = bodyWithType[0];
-          const length = isomorphicEncode(`${body.length}`);
-          const type = bodyWithType[1] ?? "";
-          const response = makeResponse({
-            statusText: "OK",
-            headersList: [
-              ["content-length", { name: "Content-Length", value: length }],
-              ["content-type", { name: "Content-Type", value: type }]
-            ]
-          });
-          response.body = body;
-          return response;
         }
-        case "data:": {
-          const currentURL = requestCurrentURL(request);
-          const dataURLStruct = dataURLProcessor(currentURL);
-          if (dataURLStruct === "failure") {
-            return makeNetworkError("failed to fetch the data URL");
+      };
+      function onAborted(reason) {
+        if (isAborted(fetchParams)) {
+          response.aborted = true;
+          if (isReadable(stream)) {
+            fetchParams.controller.controller.error(
+              fetchParams.controller.serializedAbortReason
+            );
+          }
+        } else {
+          if (isReadable(stream)) {
+            fetchParams.controller.controller.error(new TypeError("terminated", {
+              cause: isErrorLike(reason) ? reason : void 0
+            }));
           }
-          const mimeType = serializeAMimeType(dataURLStruct.mimeType);
-          return makeResponse({
-            statusText: "OK",
-            headersList: [
-              ["content-type", { name: "Content-Type", value: mimeType }]
-            ],
-            body: safelyExtractBody(dataURLStruct.body)[0]
-          });
-        }
-        case "file:": {
-          return makeNetworkError("not implemented... yet...");
-        }
-        case "http:":
-        case "https:": {
-          return await httpFetch(fetchParams).catch((err) => makeNetworkError(err));
-        }
-        default: {
-          return makeNetworkError("unknown scheme");
         }
+        fetchParams.controller.connection.destroy();
       }
-    }
-    function finalizeResponse(fetchParams, response) {
-      fetchParams.request.done = true;
-      if (fetchParams.processResponseDone != null) {
-        queueMicrotask(() => fetchParams.processResponseDone(response));
+      return response;
+      async function dispatch({ body }) {
+        const url = requestCurrentURL(request);
+        const agent = fetchParams.controller.dispatcher;
+        return new Promise((resolve, reject) => agent.dispatch(
+          {
+            path: url.pathname + url.search,
+            origin: url.origin,
+            method: request.method,
+            body: fetchParams.controller.dispatcher.isMockActive ? request.body && request.body.source : body,
+            headers: request.headersList.entries,
+            maxRedirections: 0,
+            upgrade: request.mode === "websocket" ? "websocket" : void 0
+          },
+          {
+            body: null,
+            abort: null,
+            onConnect(abort) {
+              const { connection } = fetchParams.controller;
+              if (connection.destroyed) {
+                abort(new DOMException("The operation was aborted.", "AbortError"));
+              } else {
+                fetchParams.controller.on("terminated", abort);
+                this.abort = connection.abort = abort;
+              }
+            },
+            onHeaders(status, headersList, resume, statusText) {
+              if (status < 200) {
+                return;
+              }
+              let codings = [];
+              let location = "";
+              const headers = new Headers();
+              if (Array.isArray(headersList)) {
+                for (let n = 0; n < headersList.length; n += 2) {
+                  const key = headersList[n + 0].toString("latin1");
+                  const val = headersList[n + 1].toString("latin1");
+                  if (key.toLowerCase() === "content-encoding") {
+                    codings = val.toLowerCase().split(",").map((x) => x.trim());
+                  } else if (key.toLowerCase() === "location") {
+                    location = val;
+                  }
+                  headers.append(key, val);
+                }
+              } else {
+                const keys = Object.keys(headersList);
+                for (const key of keys) {
+                  const val = headersList[key];
+                  if (key.toLowerCase() === "content-encoding") {
+                    codings = val.toLowerCase().split(",").map((x) => x.trim()).reverse();
+                  } else if (key.toLowerCase() === "location") {
+                    location = val;
+                  }
+                  headers.append(key, val);
+                }
+              }
+              this.body = new Readable({ read: resume });
+              const decoders = [];
+              const willFollow = request.redirect === "follow" && location && redirectStatus.includes(status);
+              if (request.method !== "HEAD" && request.method !== "CONNECT" && !nullBodyStatus.includes(status) && !willFollow) {
+                for (const coding of codings) {
+                  if (coding === "x-gzip" || coding === "gzip") {
+                    decoders.push(zlib.createGunzip({
+                      // Be less strict when decoding compressed responses, since sometimes
+                      // servers send slightly invalid responses that are still accepted
+                      // by common browsers.
+                      // Always using Z_SYNC_FLUSH is what cURL does.
+                      flush: zlib.constants.Z_SYNC_FLUSH,
+                      finishFlush: zlib.constants.Z_SYNC_FLUSH
+                    }));
+                  } else if (coding === "deflate") {
+                    decoders.push(zlib.createInflate());
+                  } else if (coding === "br") {
+                    decoders.push(zlib.createBrotliDecompress());
+                  } else {
+                    decoders.length = 0;
+                    break;
+                  }
+                }
+              }
+              resolve({
+                status,
+                statusText,
+                headersList: headers[kHeadersList],
+                body: decoders.length ? pipeline(this.body, ...decoders, () => {
+                }) : this.body.on("error", () => {
+                })
+              });
+              return true;
+            },
+            onData(chunk) {
+              if (fetchParams.controller.dump) {
+                return;
+              }
+              const bytes = chunk;
+              timingInfo.encodedBodySize += bytes.byteLength;
+              return this.body.push(bytes);
+            },
+            onComplete() {
+              if (this.abort) {
+                fetchParams.controller.off("terminated", this.abort);
+              }
+              fetchParams.controller.ended = true;
+              this.body.push(null);
+            },
+            onError(error) {
+              if (this.abort) {
+                fetchParams.controller.off("terminated", this.abort);
+              }
+              this.body?.destroy(error);
+              fetchParams.controller.terminate(error);
+              reject(error);
+            },
+            onUpgrade(status, headersList, socket) {
+              if (status !== 101) {
+                return;
+              }
+              const headers = new Headers();
+              for (let n = 0; n < headersList.length; n += 2) {
+                const key = headersList[n + 0].toString("latin1");
+                const val = headersList[n + 1].toString("latin1");
+                headers.append(key, val);
+              }
+              resolve({
+                status,
+                statusText: STATUS_CODES[status],
+                headersList: headers[kHeadersList],
+                socket
+              });
+              return true;
+            }
+          }
+        ));
       }
     }
-    async function fetchFinale(fetchParams, response) {
-      if (response.type === "error") {
-        response.urlList = [fetchParams.request.urlList[0]];
-        response.timingInfo = createOpaqueTimingInfo({
-          startTime: fetchParams.timingInfo.startTime
+    module2.exports = {
+      fetch: fetch2,
+      Fetch,
+      fetching,
+      finalizeAndReportTiming
+    };
+  }
+});
+
+// lib/websocket/constants.js
+var require_constants3 = __commonJS({
+  "lib/websocket/constants.js"(exports2, module2) {
+    "use strict";
+    var uid = "258EAFA5-E914-47DA-95CA-C5AB0DC85B11";
+    var staticPropertyDescriptors = {
+      enumerable: true,
+      writable: false,
+      configurable: false
+    };
+    var states = {
+      CONNECTING: 0,
+      OPEN: 1,
+      CLOSING: 2,
+      CLOSED: 3
+    };
+    var opcodes = {
+      CONTINUATION: 0,
+      TEXT: 1,
+      BINARY: 2,
+      CLOSE: 8,
+      PING: 9,
+      PONG: 10
+    };
+    var maxUnsigned16Bit = 2 ** 16 - 1;
+    var parserStates = {
+      INFO: 0,
+      PAYLOADLENGTH_16: 2,
+      PAYLOADLENGTH_64: 3,
+      READ_DATA: 4
+    };
+    var emptyBuffer = Buffer.allocUnsafe(0);
+    module2.exports = {
+      uid,
+      staticPropertyDescriptors,
+      states,
+      opcodes,
+      maxUnsigned16Bit,
+      parserStates,
+      emptyBuffer
+    };
+  }
+});
+
+// lib/websocket/symbols.js
+var require_symbols3 = __commonJS({
+  "lib/websocket/symbols.js"(exports2, module2) {
+    "use strict";
+    module2.exports = {
+      kWebSocketURL: Symbol("url"),
+      kReadyState: Symbol("ready state"),
+      kController: Symbol("controller"),
+      kResponse: Symbol("response"),
+      kBinaryType: Symbol("binary type"),
+      kSentClose: Symbol("sent close"),
+      kReceivedClose: Symbol("received close"),
+      kByteParser: Symbol("byte parser")
+    };
+  }
+});
+
+// lib/websocket/events.js
+var require_events = __commonJS({
+  "lib/websocket/events.js"(exports2, module2) {
+    "use strict";
+    var { webidl } = require_webidl();
+    var { kEnumerableProperty } = require_util();
+    var { MessagePort } = require("worker_threads");
+    var MessageEvent = class _MessageEvent extends Event {
+      #eventInit;
+      constructor(type, eventInitDict = {}) {
+        webidl.argumentLengthCheck(arguments, 1, { header: "MessageEvent constructor" });
+        type = webidl.converters.DOMString(type);
+        eventInitDict = webidl.converters.MessageEventInit(eventInitDict);
+        super(type, eventInitDict);
+        this.#eventInit = eventInitDict;
+      }
+      get data() {
+        webidl.brandCheck(this, _MessageEvent);
+        return this.#eventInit.data;
+      }
+      get origin() {
+        webidl.brandCheck(this, _MessageEvent);
+        return this.#eventInit.origin;
+      }
+      get lastEventId() {
+        webidl.brandCheck(this, _MessageEvent);
+        return this.#eventInit.lastEventId;
+      }
+      get source() {
+        webidl.brandCheck(this, _MessageEvent);
+        return this.#eventInit.source;
+      }
+      get ports() {
+        webidl.brandCheck(this, _MessageEvent);
+        if (!Object.isFrozen(this.#eventInit.ports)) {
+          Object.freeze(this.#eventInit.ports);
+        }
+        return this.#eventInit.ports;
+      }
+      initMessageEvent(type, bubbles = false, cancelable = false, data = null, origin = "", lastEventId = "", source = null, ports = []) {
+        webidl.brandCheck(this, _MessageEvent);
+        webidl.argumentLengthCheck(arguments, 1, { header: "MessageEvent.initMessageEvent" });
+        return new _MessageEvent(type, {
+          bubbles,
+          cancelable,
+          data,
+          origin,
+          lastEventId,
+          source,
+          ports
         });
       }
-      const processResponseEndOfBody = () => {
-        fetchParams.request.done = true;
-        if (fetchParams.processResponseEndOfBody != null) {
-          queueMicrotask(() => fetchParams.processResponseEndOfBody(response));
-        }
-      };
-      if (fetchParams.processResponse != null) {
-        queueMicrotask(() => fetchParams.processResponse(response));
+    };
+    var CloseEvent = class _CloseEvent extends Event {
+      #eventInit;
+      constructor(type, eventInitDict = {}) {
+        webidl.argumentLengthCheck(arguments, 1, { header: "CloseEvent constructor" });
+        type = webidl.converters.DOMString(type);
+        eventInitDict = webidl.converters.CloseEventInit(eventInitDict);
+        super(type, eventInitDict);
+        this.#eventInit = eventInitDict;
+      }
+      get wasClean() {
+        webidl.brandCheck(this, _CloseEvent);
+        return this.#eventInit.wasClean;
+      }
+      get code() {
+        webidl.brandCheck(this, _CloseEvent);
+        return this.#eventInit.code;
+      }
+      get reason() {
+        webidl.brandCheck(this, _CloseEvent);
+        return this.#eventInit.reason;
       }
-      if (response.body == null) {
-        processResponseEndOfBody();
-      } else {
-        const identityTransformAlgorithm = (chunk, controller) => {
-          controller.enqueue(chunk);
-        };
-        const transformStream = new TransformStream({
-          start() {
-          },
-          transform: identityTransformAlgorithm,
-          flush: processResponseEndOfBody
-        }, {
-          size() {
-            return 1;
-          }
-        }, {
-          size() {
-            return 1;
-          }
-        });
-        response.body = { stream: response.body.stream.pipeThrough(transformStream) };
+    };
+    var ErrorEvent = class _ErrorEvent extends Event {
+      #eventInit;
+      constructor(type, eventInitDict) {
+        webidl.argumentLengthCheck(arguments, 1, { header: "ErrorEvent constructor" });
+        super(type, eventInitDict);
+        type = webidl.converters.DOMString(type);
+        eventInitDict = webidl.converters.ErrorEventInit(eventInitDict ?? {});
+        this.#eventInit = eventInitDict;
+      }
+      get message() {
+        webidl.brandCheck(this, _ErrorEvent);
+        return this.#eventInit.message;
+      }
+      get filename() {
+        webidl.brandCheck(this, _ErrorEvent);
+        return this.#eventInit.filename;
+      }
+      get lineno() {
+        webidl.brandCheck(this, _ErrorEvent);
+        return this.#eventInit.lineno;
+      }
+      get colno() {
+        webidl.brandCheck(this, _ErrorEvent);
+        return this.#eventInit.colno;
+      }
+      get error() {
+        webidl.brandCheck(this, _ErrorEvent);
+        return this.#eventInit.error;
       }
-      if (fetchParams.processResponseConsumeBody != null) {
-        const processBody = (nullOrBytes) => fetchParams.processResponseConsumeBody(response, nullOrBytes);
-        const processBodyError = (failure) => fetchParams.processResponseConsumeBody(response, failure);
-        if (response.body == null) {
-          queueMicrotask(() => processBody(null));
-        } else {
-          await fullyReadBody(response.body, processBody, processBodyError);
+    };
+    Object.defineProperties(MessageEvent.prototype, {
+      [Symbol.toStringTag]: {
+        value: "MessageEvent",
+        configurable: true
+      },
+      data: kEnumerableProperty,
+      origin: kEnumerableProperty,
+      lastEventId: kEnumerableProperty,
+      source: kEnumerableProperty,
+      ports: kEnumerableProperty,
+      initMessageEvent: kEnumerableProperty
+    });
+    Object.defineProperties(CloseEvent.prototype, {
+      [Symbol.toStringTag]: {
+        value: "CloseEvent",
+        configurable: true
+      },
+      reason: kEnumerableProperty,
+      code: kEnumerableProperty,
+      wasClean: kEnumerableProperty
+    });
+    Object.defineProperties(ErrorEvent.prototype, {
+      [Symbol.toStringTag]: {
+        value: "ErrorEvent",
+        configurable: true
+      },
+      message: kEnumerableProperty,
+      filename: kEnumerableProperty,
+      lineno: kEnumerableProperty,
+      colno: kEnumerableProperty,
+      error: kEnumerableProperty
+    });
+    webidl.converters.MessagePort = webidl.interfaceConverter(MessagePort);
+    webidl.converters["sequence<MessagePort>"] = webidl.sequenceConverter(
+      webidl.converters.MessagePort
+    );
+    var eventInit = [
+      {
+        key: "bubbles",
+        converter: webidl.converters.boolean,
+        defaultValue: false
+      },
+      {
+        key: "cancelable",
+        converter: webidl.converters.boolean,
+        defaultValue: false
+      },
+      {
+        key: "composed",
+        converter: webidl.converters.boolean,
+        defaultValue: false
+      }
+    ];
+    webidl.converters.MessageEventInit = webidl.dictionaryConverter([
+      ...eventInit,
+      {
+        key: "data",
+        converter: webidl.converters.any,
+        defaultValue: null
+      },
+      {
+        key: "origin",
+        converter: webidl.converters.USVString,
+        defaultValue: ""
+      },
+      {
+        key: "lastEventId",
+        converter: webidl.converters.DOMString,
+        defaultValue: ""
+      },
+      {
+        key: "source",
+        // Node doesn't implement WindowProxy or ServiceWorker, so the only
+        // valid value for source is a MessagePort.
+        converter: webidl.nullableConverter(webidl.converters.MessagePort),
+        defaultValue: null
+      },
+      {
+        key: "ports",
+        converter: webidl.converters["sequence<MessagePort>"],
+        get defaultValue() {
+          return [];
         }
       }
-    }
-    async function httpFetch(fetchParams) {
-      const request = fetchParams.request;
-      let response = null;
-      let actualResponse = null;
-      const timingInfo = fetchParams.timingInfo;
-      if (request.serviceWorkers === "all") {
+    ]);
+    webidl.converters.CloseEventInit = webidl.dictionaryConverter([
+      ...eventInit,
+      {
+        key: "wasClean",
+        converter: webidl.converters.boolean,
+        defaultValue: false
+      },
+      {
+        key: "code",
+        converter: webidl.converters["unsigned short"],
+        defaultValue: 0
+      },
+      {
+        key: "reason",
+        converter: webidl.converters.USVString,
+        defaultValue: ""
       }
-      if (response === null) {
-        if (request.redirect === "follow") {
-          request.serviceWorkers = "none";
-        }
-        actualResponse = response = await httpNetworkOrCacheFetch(fetchParams);
-        if (request.responseTainting === "cors" && corsCheck(request, response) === "failure") {
-          return makeNetworkError("cors failure");
-        }
-        if (TAOCheck(request, response) === "failure") {
-          request.timingAllowFailed = true;
-        }
+    ]);
+    webidl.converters.ErrorEventInit = webidl.dictionaryConverter([
+      ...eventInit,
+      {
+        key: "message",
+        converter: webidl.converters.DOMString,
+        defaultValue: ""
+      },
+      {
+        key: "filename",
+        converter: webidl.converters.USVString,
+        defaultValue: ""
+      },
+      {
+        key: "lineno",
+        converter: webidl.converters["unsigned long"],
+        defaultValue: 0
+      },
+      {
+        key: "colno",
+        converter: webidl.converters["unsigned long"],
+        defaultValue: 0
+      },
+      {
+        key: "error",
+        converter: webidl.converters.any
       }
-      if ((request.responseTainting === "opaque" || response.type === "opaque") && crossOriginResourcePolicyCheck(request.origin, request.client, request.destination, actualResponse) === "blocked") {
-        return makeNetworkError("blocked");
+    ]);
+    module2.exports = {
+      MessageEvent,
+      CloseEvent,
+      ErrorEvent
+    };
+  }
+});
+
+// lib/websocket/util.js
+var require_util3 = __commonJS({
+  "lib/websocket/util.js"(exports2, module2) {
+    "use strict";
+    var { kReadyState, kController, kResponse, kBinaryType, kWebSocketURL } = require_symbols3();
+    var { states, opcodes } = require_constants3();
+    var { MessageEvent, ErrorEvent } = require_events();
+    function isEstablished(ws) {
+      return ws[kReadyState] === states.OPEN;
+    }
+    function isClosing(ws) {
+      return ws[kReadyState] === states.CLOSING;
+    }
+    function isClosed(ws) {
+      return ws[kReadyState] === states.CLOSED;
+    }
+    function fireEvent(e, target, eventConstructor = Event, eventInitDict) {
+      const event = new eventConstructor(e, eventInitDict);
+      target.dispatchEvent(event);
+    }
+    function websocketMessageReceived(ws, type, data) {
+      if (ws[kReadyState] !== states.OPEN) {
+        return;
       }
-      if (redirectStatus.includes(actualResponse.status)) {
-        if (request.redirect !== "manual") {
-          fetchParams.controller.connection.destroy();
+      let dataForEvent;
+      if (type === opcodes.TEXT) {
+        try {
+          dataForEvent = new TextDecoder("utf-8", { fatal: true }).decode(data);
+        } catch {
+          failWebsocketConnection(ws, "Received invalid UTF-8 in text frame.");
+          return;
         }
-        if (request.redirect === "error") {
-          response = makeNetworkError("unexpected redirect");
-        } else if (request.redirect === "manual") {
-          response = actualResponse;
-        } else if (request.redirect === "follow") {
-          response = await httpRedirectFetch(fetchParams, response);
+      } else if (type === opcodes.BINARY) {
+        if (ws[kBinaryType] === "blob") {
+          dataForEvent = new Blob([data]);
         } else {
-          assert(false);
+          dataForEvent = new Uint8Array(data).buffer;
         }
       }
-      response.timingInfo = timingInfo;
-      return response;
+      fireEvent("message", ws, MessageEvent, {
+        origin: ws[kWebSocketURL].origin,
+        data: dataForEvent
+      });
     }
-    async function httpRedirectFetch(fetchParams, response) {
-      const request = fetchParams.request;
-      const actualResponse = response.internalResponse ? response.internalResponse : response;
-      let locationURL;
-      try {
-        locationURL = responseLocationURL(actualResponse, requestCurrentURL(request).hash);
-        if (locationURL == null) {
-          return response;
-        }
-      } catch (err) {
-        return makeNetworkError(err);
-      }
-      if (!urlIsHttpHttpsScheme(locationURL)) {
-        return makeNetworkError("URL scheme must be a HTTP(S) scheme");
-      }
-      if (request.redirectCount === 20) {
-        return makeNetworkError("redirect count exceeded");
-      }
-      request.redirectCount += 1;
-      if (request.mode === "cors" && (locationURL.username || locationURL.password) && !sameOrigin(request, locationURL)) {
-        return makeNetworkError('cross origin not allowed for request mode "cors"');
-      }
-      if (request.responseTainting === "cors" && (locationURL.username || locationURL.password)) {
-        return makeNetworkError('URL cannot contain credentials for request mode "cors"');
-      }
-      if (actualResponse.status !== 303 && request.body != null && request.body.source == null) {
-        return makeNetworkError();
+    function isValidSubprotocol(protocol) {
+      if (protocol.length === 0) {
+        return false;
       }
-      if ([301, 302].includes(actualResponse.status) && request.method === "POST" || actualResponse.status === 303 && !["GET", "HEAD"].includes(request.method)) {
-        request.method = "GET";
-        request.body = null;
-        for (const headerName of requestBodyHeader) {
-          request.headersList.delete(headerName);
+      for (const char of protocol) {
+        const code = char.charCodeAt(0);
+        if (code < 33 || code > 126 || char === "(" || char === ")" || char === "<" || char === ">" || char === "@" || char === "," || char === ";" || char === ":" || char === "\\" || char === '"' || char === "/" || char === "[" || char === "]" || char === "?" || char === "=" || char === "{" || char === "}" || code === 32 || // SP
+        code === 9) {
+          return false;
         }
       }
-      if (!sameOrigin(requestCurrentURL(request), locationURL)) {
-        request.headersList.delete("authorization");
+      return true;
+    }
+    function isValidStatusCode(code) {
+      if (code >= 1e3 && code < 1015) {
+        return code !== 1004 && // reserved
+        code !== 1005 && // "MUST NOT be set as a status code"
+        code !== 1006;
       }
-      if (request.body != null) {
-        assert(request.body.source != null);
-        request.body = safelyExtractBody(request.body.source)[0];
+      return code >= 3e3 && code <= 4999;
+    }
+    function failWebsocketConnection(ws, reason) {
+      const { [kController]: controller, [kResponse]: response } = ws;
+      controller.abort();
+      if (response?.socket && !response.socket.destroyed) {
+        response.socket.destroy();
       }
-      const timingInfo = fetchParams.timingInfo;
-      timingInfo.redirectEndTime = timingInfo.postRedirectStartTime = coarsenedSharedCurrentTime(fetchParams.crossOriginIsolatedCapability);
-      if (timingInfo.redirectStartTime === 0) {
-        timingInfo.redirectStartTime = timingInfo.startTime;
+      if (reason) {
+        fireEvent("error", ws, ErrorEvent, {
+          error: new Error(reason)
+        });
       }
-      request.urlList.push(locationURL);
-      setRequestReferrerPolicyOnRedirect(request, actualResponse);
-      return mainFetch(fetchParams, true);
     }
-    async function httpNetworkOrCacheFetch(fetchParams, isAuthenticationFetch = false, isNewConnectionFetch = false) {
-      const request = fetchParams.request;
-      let httpFetchParams = null;
-      let httpRequest = null;
-      let response = null;
-      const httpCache = null;
-      const revalidatingFlag = false;
-      if (request.window === "no-window" && request.redirect === "error") {
-        httpFetchParams = fetchParams;
-        httpRequest = request;
-      } else {
-        httpRequest = makeRequest(request);
-        httpFetchParams = { ...fetchParams };
-        httpFetchParams.request = httpRequest;
+    module2.exports = {
+      isEstablished,
+      isClosing,
+      isClosed,
+      fireEvent,
+      isValidSubprotocol,
+      isValidStatusCode,
+      failWebsocketConnection,
+      websocketMessageReceived
+    };
+  }
+});
+
+// lib/websocket/connection.js
+var require_connection = __commonJS({
+  "lib/websocket/connection.js"(exports2, module2) {
+    "use strict";
+    var diagnosticsChannel = require("diagnostics_channel");
+    var { uid, states } = require_constants3();
+    var {
+      kReadyState,
+      kSentClose,
+      kByteParser,
+      kReceivedClose
+    } = require_symbols3();
+    var { fireEvent, failWebsocketConnection } = require_util3();
+    var { CloseEvent } = require_events();
+    var { makeRequest } = require_request();
+    var { fetching } = require_fetch();
+    var { Headers } = require_headers();
+    var { getGlobalDispatcher } = require_global2();
+    var { kHeadersList } = require_symbols();
+    var channels = {};
+    channels.open = diagnosticsChannel.channel("undici:websocket:open");
+    channels.close = diagnosticsChannel.channel("undici:websocket:close");
+    channels.socketError = diagnosticsChannel.channel("undici:websocket:socket_error");
+    var crypto;
+    try {
+      crypto = require("crypto");
+    } catch {
+    }
+    function establishWebSocketConnection(url, protocols, ws, onEstablish, options) {
+      const requestURL = url;
+      requestURL.protocol = url.protocol === "ws:" ? "http:" : "https:";
+      const request = makeRequest({
+        urlList: [requestURL],
+        serviceWorkers: "none",
+        referrer: "no-referrer",
+        mode: "websocket",
+        credentials: "include",
+        cache: "no-store",
+        redirect: "error"
+      });
+      if (options.headers) {
+        const headersList = new Headers(options.headers)[kHeadersList];
+        request.headersList = headersList;
+      }
+      const keyValue = crypto.randomBytes(16).toString("base64");
+      request.headersList.append("sec-websocket-key", keyValue);
+      request.headersList.append("sec-websocket-version", "13");
+      for (const protocol of protocols) {
+        request.headersList.append("sec-websocket-protocol", protocol);
+      }
+      const permessageDeflate = "";
+      const controller = fetching({
+        request,
+        useParallelQueue: true,
+        dispatcher: options.dispatcher ?? getGlobalDispatcher(),
+        processResponse(response) {
+          if (response.type === "error" || response.status !== 101) {
+            failWebsocketConnection(ws, "Received network error or non-101 status code.");
+            return;
+          }
+          if (protocols.length !== 0 && !response.headersList.get("Sec-WebSocket-Protocol")) {
+            failWebsocketConnection(ws, "Server did not respond with sent protocols.");
+            return;
+          }
+          if (response.headersList.get("Upgrade")?.toLowerCase() !== "websocket") {
+            failWebsocketConnection(ws, 'Server did not set Upgrade header to "websocket".');
+            return;
+          }
+          if (response.headersList.get("Connection")?.toLowerCase() !== "upgrade") {
+            failWebsocketConnection(ws, 'Server did not set Connection header to "upgrade".');
+            return;
+          }
+          const secWSAccept = response.headersList.get("Sec-WebSocket-Accept");
+          const digest = crypto.createHash("sha1").update(keyValue + uid).digest("base64");
+          if (secWSAccept !== digest) {
+            failWebsocketConnection(ws, "Incorrect hash received in Sec-WebSocket-Accept header.");
+            return;
+          }
+          const secExtension = response.headersList.get("Sec-WebSocket-Extensions");
+          if (secExtension !== null && secExtension !== permessageDeflate) {
+            failWebsocketConnection(ws, "Received different permessage-deflate than the one set.");
+            return;
+          }
+          const secProtocol = response.headersList.get("Sec-WebSocket-Protocol");
+          if (secProtocol !== null && secProtocol !== request.headersList.get("Sec-WebSocket-Protocol")) {
+            failWebsocketConnection(ws, "Protocol was not set in the opening handshake.");
+            return;
+          }
+          response.socket.on("data", onSocketData);
+          response.socket.on("close", onSocketClose);
+          response.socket.on("error", onSocketError);
+          if (channels.open.hasSubscribers) {
+            channels.open.publish({
+              address: response.socket.address(),
+              protocol: secProtocol,
+              extensions: secExtension
+            });
+          }
+          onEstablish(response);
+        }
+      });
+      return controller;
+    }
+    function onSocketData(chunk) {
+      if (!this.ws[kByteParser].write(chunk)) {
+        this.pause();
       }
-      const includeCredentials = request.credentials === "include" || request.credentials === "same-origin" && request.responseTainting === "basic";
-      const contentLength = httpRequest.body ? httpRequest.body.length : null;
-      let contentLengthHeaderValue = null;
-      if (httpRequest.body == null && ["POST", "PUT"].includes(httpRequest.method)) {
-        contentLengthHeaderValue = "0";
+    }
+    function onSocketClose() {
+      const { ws } = this;
+      const wasClean = ws[kSentClose] && ws[kReceivedClose];
+      let code = 1005;
+      let reason = "";
+      const result = ws[kByteParser].closingInfo;
+      if (result) {
+        code = result.code ?? 1005;
+        reason = result.reason;
+      } else if (!ws[kSentClose]) {
+        code = 1006;
+      }
+      ws[kReadyState] = states.CLOSED;
+      fireEvent("close", ws, CloseEvent, {
+        wasClean,
+        code,
+        reason
+      });
+      if (channels.close.hasSubscribers) {
+        channels.close.publish({
+          websocket: ws,
+          code,
+          reason
+        });
       }
-      if (contentLength != null) {
-        contentLengthHeaderValue = isomorphicEncode(`${contentLength}`);
+    }
+    function onSocketError(error) {
+      const { ws } = this;
+      ws[kReadyState] = states.CLOSING;
+      if (channels.socketError.hasSubscribers) {
+        channels.socketError.publish(error);
       }
-      if (contentLengthHeaderValue != null) {
-        httpRequest.headersList.append("content-length", contentLengthHeaderValue);
+      this.destroy();
+    }
+    module2.exports = {
+      establishWebSocketConnection
+    };
+  }
+});
+
+// lib/websocket/frame.js
+var require_frame = __commonJS({
+  "lib/websocket/frame.js"(exports2, module2) {
+    "use strict";
+    var { maxUnsigned16Bit } = require_constants3();
+    var crypto;
+    try {
+      crypto = require("crypto");
+    } catch {
+    }
+    var WebsocketFrameSend = class {
+      /**
+       * @param {Buffer|undefined} data
+       */
+      constructor(data) {
+        this.frameData = data;
+        this.maskKey = crypto.randomBytes(4);
+      }
+      createFrame(opcode) {
+        const bodyLength = this.frameData?.byteLength ?? 0;
+        let payloadLength = bodyLength;
+        let offset = 6;
+        if (bodyLength > maxUnsigned16Bit) {
+          offset += 8;
+          payloadLength = 127;
+        } else if (bodyLength > 125) {
+          offset += 2;
+          payloadLength = 126;
+        }
+        const buffer = Buffer.allocUnsafe(bodyLength + offset);
+        buffer[0] = buffer[1] = 0;
+        buffer[0] |= 128;
+        buffer[0] = (buffer[0] & 240) + opcode;
+        buffer[offset - 4] = this.maskKey[0];
+        buffer[offset - 3] = this.maskKey[1];
+        buffer[offset - 2] = this.maskKey[2];
+        buffer[offset - 1] = this.maskKey[3];
+        buffer[1] = payloadLength;
+        if (payloadLength === 126) {
+          buffer.writeUInt16BE(bodyLength, 2);
+        } else if (payloadLength === 127) {
+          buffer[2] = buffer[3] = 0;
+          buffer.writeUIntBE(bodyLength, 4, 6);
+        }
+        buffer[1] |= 128;
+        for (let i = 0; i < bodyLength; i++) {
+          buffer[offset + i] = this.frameData[i] ^ this.maskKey[i % 4];
+        }
+        return buffer;
       }
-      if (contentLength != null && httpRequest.keepalive) {
+    };
+    module2.exports = {
+      WebsocketFrameSend
+    };
+  }
+});
+
+// lib/websocket/receiver.js
+var require_receiver = __commonJS({
+  "lib/websocket/receiver.js"(exports2, module2) {
+    "use strict";
+    var { Writable } = require("stream");
+    var diagnosticsChannel = require("diagnostics_channel");
+    var { parserStates, opcodes, states, emptyBuffer } = require_constants3();
+    var { kReadyState, kSentClose, kResponse, kReceivedClose } = require_symbols3();
+    var { isValidStatusCode, failWebsocketConnection, websocketMessageReceived } = require_util3();
+    var { WebsocketFrameSend } = require_frame();
+    var channels = {};
+    channels.ping = diagnosticsChannel.channel("undici:websocket:ping");
+    channels.pong = diagnosticsChannel.channel("undici:websocket:pong");
+    var ByteParser = class extends Writable {
+      #buffers = [];
+      #byteOffset = 0;
+      #state = parserStates.INFO;
+      #info = {};
+      #fragments = [];
+      constructor(ws) {
+        super();
+        this.ws = ws;
+      }
+      /**
+       * @param {Buffer} chunk
+       * @param {() => void} callback
+       */
+      _write(chunk, _, callback) {
+        this.#buffers.push(chunk);
+        this.#byteOffset += chunk.length;
+        this.run(callback);
+      }
+      /**
+       * Runs whenever a new chunk is received.
+       * Callback is called whenever there are no more chunks buffering,
+       * or not enough bytes are buffered to parse.
+       */
+      run(callback) {
+        while (true) {
+          if (this.#state === parserStates.INFO) {
+            if (this.#byteOffset < 2) {
+              return callback();
+            }
+            const buffer = this.consume(2);
+            this.#info.fin = (buffer[0] & 128) !== 0;
+            this.#info.opcode = buffer[0] & 15;
+            this.#info.originalOpcode ??= this.#info.opcode;
+            this.#info.fragmented = !this.#info.fin && this.#info.opcode !== opcodes.CONTINUATION;
+            if (this.#info.fragmented && this.#info.opcode !== opcodes.BINARY && this.#info.opcode !== opcodes.TEXT) {
+              failWebsocketConnection(this.ws, "Invalid frame type was fragmented.");
+              return;
+            }
+            const payloadLength = buffer[1] & 127;
+            if (payloadLength <= 125) {
+              this.#info.payloadLength = payloadLength;
+              this.#state = parserStates.READ_DATA;
+            } else if (payloadLength === 126) {
+              this.#state = parserStates.PAYLOADLENGTH_16;
+            } else if (payloadLength === 127) {
+              this.#state = parserStates.PAYLOADLENGTH_64;
+            }
+            if (this.#info.fragmented && payloadLength > 125) {
+              failWebsocketConnection(this.ws, "Fragmented frame exceeded 125 bytes.");
+              return;
+            } else if ((this.#info.opcode === opcodes.PING || this.#info.opcode === opcodes.PONG || this.#info.opcode === opcodes.CLOSE) && payloadLength > 125) {
+              failWebsocketConnection(this.ws, "Payload length for control frame exceeded 125 bytes.");
+              return;
+            } else if (this.#info.opcode === opcodes.CLOSE) {
+              if (payloadLength === 1) {
+                failWebsocketConnection(this.ws, "Received close frame with a 1-byte body.");
+                return;
+              }
+              const body = this.consume(payloadLength);
+              this.#info.closeInfo = this.parseCloseBody(false, body);
+              if (!this.ws[kSentClose]) {
+                const body2 = Buffer.allocUnsafe(2);
+                body2.writeUInt16BE(this.#info.closeInfo.code, 0);
+                const closeFrame = new WebsocketFrameSend(body2);
+                this.ws[kResponse].socket.write(
+                  closeFrame.createFrame(opcodes.CLOSE),
+                  (err) => {
+                    if (!err) {
+                      this.ws[kSentClose] = true;
+                    }
+                  }
+                );
+              }
+              this.ws[kReadyState] = states.CLOSING;
+              this.ws[kReceivedClose] = true;
+              this.end();
+              return;
+            } else if (this.#info.opcode === opcodes.PING) {
+              const body = this.consume(payloadLength);
+              if (!this.ws[kReceivedClose]) {
+                const frame = new WebsocketFrameSend(body);
+                this.ws[kResponse].socket.write(frame.createFrame(opcodes.PONG));
+                if (channels.ping.hasSubscribers) {
+                  channels.ping.publish({
+                    payload: body
+                  });
+                }
+              }
+              this.#state = parserStates.INFO;
+              if (this.#byteOffset > 0) {
+                continue;
+              } else {
+                callback();
+                return;
+              }
+            } else if (this.#info.opcode === opcodes.PONG) {
+              const body = this.consume(payloadLength);
+              if (channels.pong.hasSubscribers) {
+                channels.pong.publish({
+                  payload: body
+                });
+              }
+              if (this.#byteOffset > 0) {
+                continue;
+              } else {
+                callback();
+                return;
+              }
+            }
+          } else if (this.#state === parserStates.PAYLOADLENGTH_16) {
+            if (this.#byteOffset < 2) {
+              return callback();
+            }
+            const buffer = this.consume(2);
+            this.#info.payloadLength = buffer.readUInt16BE(0);
+            this.#state = parserStates.READ_DATA;
+          } else if (this.#state === parserStates.PAYLOADLENGTH_64) {
+            if (this.#byteOffset < 8) {
+              return callback();
+            }
+            const buffer = this.consume(8);
+            const upper = buffer.readUInt32BE(0);
+            if (upper > 2 ** 31 - 1) {
+              failWebsocketConnection(this.ws, "Received payload length > 2^31 bytes.");
+              return;
+            }
+            const lower = buffer.readUInt32BE(4);
+            this.#info.payloadLength = (upper << 8) + lower;
+            this.#state = parserStates.READ_DATA;
+          } else if (this.#state === parserStates.READ_DATA) {
+            if (this.#byteOffset < this.#info.payloadLength) {
+              return callback();
+            } else if (this.#byteOffset >= this.#info.payloadLength) {
+              const body = this.consume(this.#info.payloadLength);
+              this.#fragments.push(body);
+              if (!this.#info.fragmented || this.#info.fin && this.#info.opcode === opcodes.CONTINUATION) {
+                const fullMessage = Buffer.concat(this.#fragments);
+                websocketMessageReceived(this.ws, this.#info.originalOpcode, fullMessage);
+                this.#info = {};
+                this.#fragments.length = 0;
+              }
+              this.#state = parserStates.INFO;
+            }
+          }
+          if (this.#byteOffset > 0) {
+            continue;
+          } else {
+            callback();
+            break;
+          }
+        }
       }
-      if (httpRequest.referrer instanceof URL) {
-        httpRequest.headersList.append("referer", isomorphicEncode(httpRequest.referrer.href));
+      /**
+       * Take n bytes from the buffered Buffers
+       * @param {number} n
+       * @returns {Buffer|null}
+       */
+      consume(n) {
+        if (n > this.#byteOffset) {
+          return null;
+        } else if (n === 0) {
+          return emptyBuffer;
+        }
+        if (this.#buffers[0].length === n) {
+          this.#byteOffset -= this.#buffers[0].length;
+          return this.#buffers.shift();
+        }
+        const buffer = Buffer.allocUnsafe(n);
+        let offset = 0;
+        while (offset !== n) {
+          const next = this.#buffers[0];
+          const { length } = next;
+          if (length + offset === n) {
+            buffer.set(this.#buffers.shift(), offset);
+            break;
+          } else if (length + offset > n) {
+            buffer.set(next.subarray(0, n - offset), offset);
+            this.#buffers[0] = next.subarray(n - offset);
+            break;
+          } else {
+            buffer.set(this.#buffers.shift(), offset);
+            offset += next.length;
+          }
+        }
+        this.#byteOffset -= n;
+        return buffer;
       }
-      appendRequestOriginHeader(httpRequest);
-      appendFetchMetadata(httpRequest);
-      if (!httpRequest.headersList.contains("user-agent")) {
-        httpRequest.headersList.append("user-agent", "undici");
+      parseCloseBody(onlyCode, data) {
+        let code;
+        if (data.length >= 2) {
+          code = data.readUInt16BE(0);
+        }
+        if (onlyCode) {
+          if (!isValidStatusCode(code)) {
+            return null;
+          }
+          return { code };
+        }
+        let reason = data.subarray(2);
+        if (reason[0] === 239 && reason[1] === 187 && reason[2] === 191) {
+          reason = reason.subarray(3);
+        }
+        if (code !== void 0 && !isValidStatusCode(code)) {
+          return null;
+        }
+        try {
+          reason = new TextDecoder("utf-8", { fatal: true }).decode(reason);
+        } catch {
+          return null;
+        }
+        return { code, reason };
       }
-      if (httpRequest.cache === "default" && (httpRequest.headersList.contains("if-modified-since") || httpRequest.headersList.contains("if-none-match") || httpRequest.headersList.contains("if-unmodified-since") || httpRequest.headersList.contains("if-match") || httpRequest.headersList.contains("if-range"))) {
-        httpRequest.cache = "no-store";
+      get closingInfo() {
+        return this.#info.closeInfo;
       }
-      if (httpRequest.cache === "no-cache" && !httpRequest.preventNoCacheCacheControlHeaderModification && !httpRequest.headersList.contains("cache-control")) {
-        httpRequest.headersList.append("cache-control", "max-age=0");
+    };
+    module2.exports = {
+      ByteParser
+    };
+  }
+});
+
+// lib/websocket/websocket.js
+var require_websocket = __commonJS({
+  "lib/websocket/websocket.js"(exports2, module2) {
+    "use strict";
+    var { webidl } = require_webidl();
+    var { DOMException } = require_constants();
+    var { URLSerializer } = require_dataURL();
+    var { getGlobalOrigin } = require_global();
+    var { staticPropertyDescriptors, states, opcodes, emptyBuffer } = require_constants3();
+    var {
+      kWebSocketURL,
+      kReadyState,
+      kController,
+      kBinaryType,
+      kResponse,
+      kSentClose,
+      kByteParser
+    } = require_symbols3();
+    var { isEstablished, isClosing, isValidSubprotocol, failWebsocketConnection, fireEvent } = require_util3();
+    var { establishWebSocketConnection } = require_connection();
+    var { WebsocketFrameSend } = require_frame();
+    var { ByteParser } = require_receiver();
+    var { kEnumerableProperty, isBlobLike } = require_util();
+    var { getGlobalDispatcher } = require_global2();
+    var { types } = require("util");
+    var experimentalWarned = false;
+    var WebSocket = class _WebSocket extends EventTarget {
+      #events = {
+        open: null,
+        error: null,
+        close: null,
+        message: null
+      };
+      #bufferedAmount = 0;
+      #protocol = "";
+      #extensions = "";
+      /**
+       * @param {string} url
+       * @param {string|string[]} protocols
+       */
+      constructor(url, protocols = []) {
+        super();
+        webidl.argumentLengthCheck(arguments, 1, { header: "WebSocket constructor" });
+        if (!experimentalWarned) {
+          experimentalWarned = true;
+          process.emitWarning("WebSockets are experimental, expect them to change at any time.", {
+            code: "UNDICI-WS"
+          });
+        }
+        const options = webidl.converters["DOMString or sequence<DOMString> or WebSocketInit"](protocols);
+        url = webidl.converters.USVString(url);
+        protocols = options.protocols;
+        const baseURL = getGlobalOrigin();
+        let urlRecord;
+        try {
+          urlRecord = new URL(url, baseURL);
+        } catch (e) {
+          throw new DOMException(e, "SyntaxError");
+        }
+        if (urlRecord.protocol === "http:") {
+          urlRecord.protocol = "ws:";
+        } else if (urlRecord.protocol === "https:") {
+          urlRecord.protocol = "wss:";
+        }
+        if (urlRecord.protocol !== "ws:" && urlRecord.protocol !== "wss:") {
+          throw new DOMException(
+            `Expected a ws: or wss: protocol, got ${urlRecord.protocol}`,
+            "SyntaxError"
+          );
+        }
+        if (urlRecord.hash || urlRecord.href.endsWith("#")) {
+          throw new DOMException("Got fragment", "SyntaxError");
+        }
+        if (typeof protocols === "string") {
+          protocols = [protocols];
+        }
+        if (protocols.length !== new Set(protocols.map((p) => p.toLowerCase())).size) {
+          throw new DOMException("Invalid Sec-WebSocket-Protocol value", "SyntaxError");
+        }
+        if (protocols.length > 0 && !protocols.every((p) => isValidSubprotocol(p))) {
+          throw new DOMException("Invalid Sec-WebSocket-Protocol value", "SyntaxError");
+        }
+        this[kWebSocketURL] = new URL(urlRecord.href);
+        this[kController] = establishWebSocketConnection(
+          urlRecord,
+          protocols,
+          this,
+          (response) => this.#onConnectionEstablished(response),
+          options
+        );
+        this[kReadyState] = _WebSocket.CONNECTING;
+        this[kBinaryType] = "blob";
+      }
+      /**
+       * @see https://websockets.spec.whatwg.org/#dom-websocket-close
+       * @param {number|undefined} code
+       * @param {string|undefined} reason
+       */
+      close(code = void 0, reason = void 0) {
+        webidl.brandCheck(this, _WebSocket);
+        if (code !== void 0) {
+          code = webidl.converters["unsigned short"](code, { clamp: true });
+        }
+        if (reason !== void 0) {
+          reason = webidl.converters.USVString(reason);
+        }
+        if (code !== void 0) {
+          if (code !== 1e3 && (code < 3e3 || code > 4999)) {
+            throw new DOMException("invalid code", "InvalidAccessError");
+          }
+        }
+        let reasonByteLength = 0;
+        if (reason !== void 0) {
+          reasonByteLength = Buffer.byteLength(reason);
+          if (reasonByteLength > 123) {
+            throw new DOMException(
+              `Reason must be less than 123 bytes; received ${reasonByteLength}`,
+              "SyntaxError"
+            );
+          }
+        }
+        if (this[kReadyState] === _WebSocket.CLOSING || this[kReadyState] === _WebSocket.CLOSED) {
+        } else if (!isEstablished(this)) {
+          failWebsocketConnection(this, "Connection was closed before it was established.");
+          this[kReadyState] = _WebSocket.CLOSING;
+        } else if (!isClosing(this)) {
+          const frame = new WebsocketFrameSend();
+          if (code !== void 0 && reason === void 0) {
+            frame.frameData = Buffer.allocUnsafe(2);
+            frame.frameData.writeUInt16BE(code, 0);
+          } else if (code !== void 0 && reason !== void 0) {
+            frame.frameData = Buffer.allocUnsafe(2 + reasonByteLength);
+            frame.frameData.writeUInt16BE(code, 0);
+            frame.frameData.write(reason, 2, "utf-8");
+          } else {
+            frame.frameData = emptyBuffer;
+          }
+          const socket = this[kResponse].socket;
+          socket.write(frame.createFrame(opcodes.CLOSE), (err) => {
+            if (!err) {
+              this[kSentClose] = true;
+            }
+          });
+          this[kReadyState] = states.CLOSING;
+        } else {
+          this[kReadyState] = _WebSocket.CLOSING;
+        }
       }
-      if (httpRequest.cache === "no-store" || httpRequest.cache === "reload") {
-        if (!httpRequest.headersList.contains("pragma")) {
-          httpRequest.headersList.append("pragma", "no-cache");
+      /**
+       * @see https://websockets.spec.whatwg.org/#dom-websocket-send
+       * @param {NodeJS.TypedArray|ArrayBuffer|Blob|string} data
+       */
+      send(data) {
+        webidl.brandCheck(this, _WebSocket);
+        webidl.argumentLengthCheck(arguments, 1, { header: "WebSocket.send" });
+        data = webidl.converters.WebSocketSendData(data);
+        if (this[kReadyState] === _WebSocket.CONNECTING) {
+          throw new DOMException("Sent before connected.", "InvalidStateError");
         }
-        if (!httpRequest.headersList.contains("cache-control")) {
-          httpRequest.headersList.append("cache-control", "no-cache");
+        if (!isEstablished(this) || isClosing(this)) {
+          return;
+        }
+        const socket = this[kResponse].socket;
+        if (typeof data === "string") {
+          const value = Buffer.from(data);
+          const frame = new WebsocketFrameSend(value);
+          const buffer = frame.createFrame(opcodes.TEXT);
+          this.#bufferedAmount += value.byteLength;
+          socket.write(buffer, () => {
+            this.#bufferedAmount -= value.byteLength;
+          });
+        } else if (types.isArrayBuffer(data)) {
+          const value = Buffer.from(data);
+          const frame = new WebsocketFrameSend(value);
+          const buffer = frame.createFrame(opcodes.BINARY);
+          this.#bufferedAmount += value.byteLength;
+          socket.write(buffer, () => {
+            this.#bufferedAmount -= value.byteLength;
+          });
+        } else if (ArrayBuffer.isView(data)) {
+          const ab = Buffer.from(data, data.byteOffset, data.byteLength);
+          const frame = new WebsocketFrameSend(ab);
+          const buffer = frame.createFrame(opcodes.BINARY);
+          this.#bufferedAmount += ab.byteLength;
+          socket.write(buffer, () => {
+            this.#bufferedAmount -= ab.byteLength;
+          });
+        } else if (isBlobLike(data)) {
+          const frame = new WebsocketFrameSend();
+          data.arrayBuffer().then((ab) => {
+            const value = Buffer.from(ab);
+            frame.frameData = value;
+            const buffer = frame.createFrame(opcodes.BINARY);
+            this.#bufferedAmount += value.byteLength;
+            socket.write(buffer, () => {
+              this.#bufferedAmount -= value.byteLength;
+            });
+          });
         }
       }
-      if (httpRequest.headersList.contains("range")) {
-        httpRequest.headersList.append("accept-encoding", "identity");
+      get readyState() {
+        webidl.brandCheck(this, _WebSocket);
+        return this[kReadyState];
       }
-      if (!httpRequest.headersList.contains("accept-encoding")) {
-        if (urlHasHttpsScheme(requestCurrentURL(httpRequest))) {
-          httpRequest.headersList.append("accept-encoding", "br, gzip, deflate");
-        } else {
-          httpRequest.headersList.append("accept-encoding", "gzip, deflate");
-        }
+      get bufferedAmount() {
+        webidl.brandCheck(this, _WebSocket);
+        return this.#bufferedAmount;
       }
-      if (includeCredentials) {
+      get url() {
+        webidl.brandCheck(this, _WebSocket);
+        return URLSerializer(this[kWebSocketURL]);
       }
-      if (httpCache == null) {
-        httpRequest.cache = "no-store";
+      get extensions() {
+        webidl.brandCheck(this, _WebSocket);
+        return this.#extensions;
       }
-      if (httpRequest.mode !== "no-store" && httpRequest.mode !== "reload") {
+      get protocol() {
+        webidl.brandCheck(this, _WebSocket);
+        return this.#protocol;
       }
-      if (response == null) {
-        if (httpRequest.mode === "only-if-cached") {
-          return makeNetworkError("only if cached");
-        }
-        const forwardResponse = await httpNetworkFetch(httpFetchParams, includeCredentials, isNewConnectionFetch);
-        if (!safeMethods.includes(httpRequest.method) && forwardResponse.status >= 200 && forwardResponse.status <= 399) {
-        }
-        if (revalidatingFlag && forwardResponse.status === 304) {
+      get onopen() {
+        webidl.brandCheck(this, _WebSocket);
+        return this.#events.open;
+      }
+      set onopen(fn) {
+        webidl.brandCheck(this, _WebSocket);
+        if (this.#events.open) {
+          this.removeEventListener("open", this.#events.open);
         }
-        if (response == null) {
-          response = forwardResponse;
+        if (typeof fn === "function") {
+          this.#events.open = fn;
+          this.addEventListener("open", fn);
+        } else {
+          this.#events.open = null;
         }
       }
-      response.urlList = [...httpRequest.urlList];
-      if (httpRequest.headersList.contains("range")) {
-        response.rangeRequested = true;
+      get onerror() {
+        webidl.brandCheck(this, _WebSocket);
+        return this.#events.error;
       }
-      response.requestIncludesCredentials = includeCredentials;
-      if (response.status === 407) {
-        if (request.window === "no-window") {
-          return makeNetworkError();
+      set onerror(fn) {
+        webidl.brandCheck(this, _WebSocket);
+        if (this.#events.error) {
+          this.removeEventListener("error", this.#events.error);
         }
-        if (isCancelled(fetchParams)) {
-          return makeAppropriateNetworkError(fetchParams);
+        if (typeof fn === "function") {
+          this.#events.error = fn;
+          this.addEventListener("error", fn);
+        } else {
+          this.#events.error = null;
         }
-        return makeNetworkError("proxy authentication required");
       }
-      if (response.status === 421 && !isNewConnectionFetch && (request.body == null || request.body.source != null)) {
-        if (isCancelled(fetchParams)) {
-          return makeAppropriateNetworkError(fetchParams);
+      get onclose() {
+        webidl.brandCheck(this, _WebSocket);
+        return this.#events.close;
+      }
+      set onclose(fn) {
+        webidl.brandCheck(this, _WebSocket);
+        if (this.#events.close) {
+          this.removeEventListener("close", this.#events.close);
+        }
+        if (typeof fn === "function") {
+          this.#events.close = fn;
+          this.addEventListener("close", fn);
+        } else {
+          this.#events.close = null;
         }
-        fetchParams.controller.connection.destroy();
-        response = await httpNetworkOrCacheFetch(fetchParams, isAuthenticationFetch, true);
       }
-      if (isAuthenticationFetch) {
+      get onmessage() {
+        webidl.brandCheck(this, _WebSocket);
+        return this.#events.message;
       }
-      return response;
-    }
-    async function httpNetworkFetch(fetchParams, includeCredentials = false, forceNewConnection = false) {
-      assert(!fetchParams.controller.connection || fetchParams.controller.connection.destroyed);
-      fetchParams.controller.connection = {
-        abort: null,
-        destroyed: false,
-        destroy(err) {
-          if (!this.destroyed) {
-            this.destroyed = true;
-            this.abort?.(err ?? new DOMException("The operation was aborted.", "AbortError"));
-          }
+      set onmessage(fn) {
+        webidl.brandCheck(this, _WebSocket);
+        if (this.#events.message) {
+          this.removeEventListener("message", this.#events.message);
+        }
+        if (typeof fn === "function") {
+          this.#events.message = fn;
+          this.addEventListener("message", fn);
+        } else {
+          this.#events.message = null;
         }
-      };
-      const request = fetchParams.request;
-      let response = null;
-      const timingInfo = fetchParams.timingInfo;
-      const httpCache = null;
-      if (httpCache == null) {
-        request.cache = "no-store";
-      }
-      const newConnection = forceNewConnection ? "yes" : "no";
-      if (request.mode === "websocket") {
-      } else {
       }
-      let requestBody = null;
-      if (request.body == null && fetchParams.processRequestEndOfBody) {
-        queueMicrotask(() => fetchParams.processRequestEndOfBody());
-      } else if (request.body != null) {
-        const processBodyChunk = async function* (bytes) {
-          if (isCancelled(fetchParams)) {
-            return;
-          }
-          yield bytes;
-          fetchParams.processRequestBodyChunkLength?.(bytes.byteLength);
-        };
-        const processEndOfBody = () => {
-          if (isCancelled(fetchParams)) {
-            return;
-          }
-          if (fetchParams.processRequestEndOfBody) {
-            fetchParams.processRequestEndOfBody();
-          }
-        };
-        const processBodyError = (e) => {
-          if (isCancelled(fetchParams)) {
-            return;
-          }
-          if (e.name === "AbortError") {
-            fetchParams.controller.abort();
-          } else {
-            fetchParams.controller.terminate(e);
-          }
-        };
-        requestBody = async function* () {
-          try {
-            for await (const bytes of request.body.stream) {
-              yield* processBodyChunk(bytes);
-            }
-            processEndOfBody();
-          } catch (err) {
-            processBodyError(err);
-          }
-        }();
+      get binaryType() {
+        webidl.brandCheck(this, _WebSocket);
+        return this[kBinaryType];
       }
-      try {
-        const { body, status, statusText, headersList, socket } = await dispatch({ body: requestBody });
-        if (socket) {
-          response = makeResponse({ status, statusText, headersList, socket });
+      set binaryType(type) {
+        webidl.brandCheck(this, _WebSocket);
+        if (type !== "blob" && type !== "arraybuffer") {
+          this[kBinaryType] = "blob";
         } else {
-          const iterator = body[Symbol.asyncIterator]();
-          fetchParams.controller.next = () => iterator.next();
-          response = makeResponse({ status, statusText, headersList });
+          this[kBinaryType] = type;
         }
-      } catch (err) {
-        if (err.name === "AbortError") {
-          fetchParams.controller.connection.destroy();
-          return makeAppropriateNetworkError(fetchParams);
+      }
+      /**
+       * @see https://websockets.spec.whatwg.org/#feedback-from-the-protocol
+       */
+      #onConnectionEstablished(response) {
+        this[kResponse] = response;
+        const parser = new ByteParser(this);
+        parser.on("drain", function onParserDrain() {
+          this.ws[kResponse].socket.resume();
+        });
+        response.socket.ws = this;
+        this[kByteParser] = parser;
+        this[kReadyState] = states.OPEN;
+        const extensions = response.headersList.get("sec-websocket-extensions");
+        if (extensions !== null) {
+          this.#extensions = extensions;
         }
-        return makeNetworkError(err);
+        const protocol = response.headersList.get("sec-websocket-protocol");
+        if (protocol !== null) {
+          this.#protocol = protocol;
+        }
+        fireEvent("open", this);
       }
-      const pullAlgorithm = () => {
-        fetchParams.controller.resume();
-      };
-      const cancelAlgorithm = (reason) => {
-        fetchParams.controller.abort(reason);
-      };
-      if (!ReadableStream) {
-        ReadableStream = require("stream/web").ReadableStream;
+    };
+    WebSocket.CONNECTING = WebSocket.prototype.CONNECTING = states.CONNECTING;
+    WebSocket.OPEN = WebSocket.prototype.OPEN = states.OPEN;
+    WebSocket.CLOSING = WebSocket.prototype.CLOSING = states.CLOSING;
+    WebSocket.CLOSED = WebSocket.prototype.CLOSED = states.CLOSED;
+    Object.defineProperties(WebSocket.prototype, {
+      CONNECTING: staticPropertyDescriptors,
+      OPEN: staticPropertyDescriptors,
+      CLOSING: staticPropertyDescriptors,
+      CLOSED: staticPropertyDescriptors,
+      url: kEnumerableProperty,
+      readyState: kEnumerableProperty,
+      bufferedAmount: kEnumerableProperty,
+      onopen: kEnumerableProperty,
+      onerror: kEnumerableProperty,
+      onclose: kEnumerableProperty,
+      close: kEnumerableProperty,
+      onmessage: kEnumerableProperty,
+      binaryType: kEnumerableProperty,
+      send: kEnumerableProperty,
+      extensions: kEnumerableProperty,
+      protocol: kEnumerableProperty,
+      [Symbol.toStringTag]: {
+        value: "WebSocket",
+        writable: false,
+        enumerable: false,
+        configurable: true
       }
-      const stream = new ReadableStream({
-        async start(controller) {
-          fetchParams.controller.controller = controller;
-        },
-        async pull(controller) {
-          await pullAlgorithm(controller);
-        },
-        async cancel(reason) {
-          await cancelAlgorithm(reason);
+    });
+    Object.defineProperties(WebSocket, {
+      CONNECTING: staticPropertyDescriptors,
+      OPEN: staticPropertyDescriptors,
+      CLOSING: staticPropertyDescriptors,
+      CLOSED: staticPropertyDescriptors
+    });
+    webidl.converters["sequence<DOMString>"] = webidl.sequenceConverter(
+      webidl.converters.DOMString
+    );
+    webidl.converters["DOMString or sequence<DOMString>"] = function(V) {
+      if (webidl.util.Type(V) === "Object" && Symbol.iterator in V) {
+        return webidl.converters["sequence<DOMString>"](V);
+      }
+      return webidl.converters.DOMString(V);
+    };
+    webidl.converters.WebSocketInit = webidl.dictionaryConverter([
+      {
+        key: "protocols",
+        converter: webidl.converters["DOMString or sequence<DOMString>"],
+        get defaultValue() {
+          return [];
         }
-      }, {
-        highWaterMark: 0,
-        size() {
-          return 1;
+      },
+      {
+        key: "dispatcher",
+        converter: (V) => V,
+        get defaultValue() {
+          return getGlobalDispatcher();
         }
-      });
-      response.body = { stream };
-      fetchParams.controller.on("terminated", onAborted);
-      fetchParams.controller.resume = async () => {
-        while (true) {
-          let bytes;
-          let isFailure;
-          try {
-            const { done, value } = await fetchParams.controller.next();
-            if (isAborted(fetchParams)) {
-              break;
-            }
-            bytes = done ? void 0 : value;
-          } catch (err) {
-            if (fetchParams.controller.ended && !timingInfo.encodedBodySize) {
-              bytes = void 0;
-            } else {
-              bytes = err;
-              isFailure = true;
-            }
-          }
-          if (bytes === void 0) {
-            readableStreamClose(fetchParams.controller.controller);
-            finalizeResponse(fetchParams, response);
-            return;
-          }
-          timingInfo.decodedBodySize += bytes?.byteLength ?? 0;
-          if (isFailure) {
-            fetchParams.controller.terminate(bytes);
-            return;
-          }
-          fetchParams.controller.controller.enqueue(new Uint8Array(bytes));
-          if (isErrored(stream)) {
-            fetchParams.controller.terminate();
-            return;
-          }
-          if (!fetchParams.controller.controller.desiredSize) {
-            return;
-          }
+      },
+      {
+        key: "headers",
+        converter: webidl.nullableConverter(webidl.converters.HeadersInit)
+      }
+    ]);
+    webidl.converters["DOMString or sequence<DOMString> or WebSocketInit"] = function(V) {
+      if (webidl.util.Type(V) === "Object" && !(Symbol.iterator in V)) {
+        return webidl.converters.WebSocketInit(V);
+      }
+      return { protocols: webidl.converters["DOMString or sequence<DOMString>"](V) };
+    };
+    webidl.converters.WebSocketSendData = function(V) {
+      if (webidl.util.Type(V) === "Object") {
+        if (isBlobLike(V)) {
+          return webidl.converters.Blob(V, { strict: false });
         }
-      };
-      function onAborted(reason) {
-        if (isAborted(fetchParams)) {
-          response.aborted = true;
-          if (isReadable(stream)) {
-            fetchParams.controller.controller.error(fetchParams.controller.serializedAbortReason);
-          }
-        } else {
-          if (isReadable(stream)) {
-            fetchParams.controller.controller.error(new TypeError("terminated", {
-              cause: isErrorLike(reason) ? reason : void 0
-            }));
-          }
+        if (ArrayBuffer.isView(V) || types.isAnyArrayBuffer(V)) {
+          return webidl.converters.BufferSource(V);
         }
-        fetchParams.controller.connection.destroy();
-      }
-      return response;
-      async function dispatch({ body }) {
-        const url = requestCurrentURL(request);
-        const agent = fetchParams.controller.dispatcher;
-        return new Promise((resolve, reject) => agent.dispatch({
-          path: url.pathname + url.search,
-          origin: url.origin,
-          method: request.method,
-          body: fetchParams.controller.dispatcher.isMockActive ? request.body && request.body.source : body,
-          headers: request.headersList.entries,
-          maxRedirections: 0,
-          upgrade: request.mode === "websocket" ? "websocket" : void 0
-        }, {
-          body: null,
-          abort: null,
-          onConnect(abort) {
-            const { connection } = fetchParams.controller;
-            if (connection.destroyed) {
-              abort(new DOMException("The operation was aborted.", "AbortError"));
-            } else {
-              fetchParams.controller.on("terminated", abort);
-              this.abort = connection.abort = abort;
-            }
-          },
-          onHeaders(status, headersList, resume, statusText) {
-            if (status < 200) {
-              return;
-            }
-            let codings = [];
-            let location = "";
-            const headers = new Headers();
-            for (let n = 0; n < headersList.length; n += 2) {
-              const key = headersList[n + 0].toString("latin1");
-              const val = headersList[n + 1].toString("latin1");
-              if (key.toLowerCase() === "content-encoding") {
-                codings = val.toLowerCase().split(",").map((x) => x.trim()).reverse();
-              } else if (key.toLowerCase() === "location") {
-                location = val;
-              }
-              headers.append(key, val);
-            }
-            this.body = new Readable({ read: resume });
-            const decoders = [];
-            const willFollow = request.redirect === "follow" && location && redirectStatus.includes(status);
-            if (request.method !== "HEAD" && request.method !== "CONNECT" && !nullBodyStatus.includes(status) && !willFollow) {
-              for (const coding of codings) {
-                if (coding === "x-gzip" || coding === "gzip") {
-                  decoders.push(zlib.createGunzip({
-                    flush: zlib.constants.Z_SYNC_FLUSH,
-                    finishFlush: zlib.constants.Z_SYNC_FLUSH
-                  }));
-                } else if (coding === "deflate") {
-                  decoders.push(zlib.createInflate());
-                } else if (coding === "br") {
-                  decoders.push(zlib.createBrotliDecompress());
-                } else {
-                  decoders.length = 0;
-                  break;
-                }
-              }
-            }
-            resolve({
-              status,
-              statusText,
-              headersList: headers[kHeadersList],
-              body: decoders.length ? pipeline(this.body, ...decoders, () => {
-              }) : this.body.on("error", () => {
-              })
-            });
-            return true;
-          },
-          onData(chunk) {
-            if (fetchParams.controller.dump) {
-              return;
-            }
-            const bytes = chunk;
-            timingInfo.encodedBodySize += bytes.byteLength;
-            return this.body.push(bytes);
-          },
-          onComplete() {
-            if (this.abort) {
-              fetchParams.controller.off("terminated", this.abort);
-            }
-            fetchParams.controller.ended = true;
-            this.body.push(null);
-          },
-          onError(error) {
-            if (this.abort) {
-              fetchParams.controller.off("terminated", this.abort);
-            }
-            this.body?.destroy(error);
-            fetchParams.controller.terminate(error);
-            reject(error);
-          },
-          onUpgrade(status, headersList, socket) {
-            if (status !== 101) {
-              return;
-            }
-            const headers = new Headers();
-            for (let n = 0; n < headersList.length; n += 2) {
-              const key = headersList[n + 0].toString("latin1");
-              const val = headersList[n + 1].toString("latin1");
-              headers.append(key, val);
-            }
-            resolve({
-              status,
-              statusText: STATUS_CODES[status],
-              headersList: headers[kHeadersList],
-              socket
-            });
-            return true;
-          }
-        }));
       }
-    }
+      return webidl.converters.USVString(V);
+    };
     module2.exports = {
-      fetch: fetch2,
-      Fetch,
-      fetching,
-      finalizeAndReportTiming
+      WebSocket
     };
   }
 });
 
 // index-fetch.js
 var fetchImpl = require_fetch().fetch;
-module.exports.fetch = async function fetch(resource) {
+module.exports.fetch = async function fetch(resource, init = void 0) {
   try {
-    return await fetchImpl(...arguments);
+    return await fetchImpl(resource, init);
   } catch (err) {
     Error.captureStackTrace(err, this);
     throw err;
@@ -11605,4 +11377,12 @@ module.exports.FormData = require_formdata().FormData;
 module.exports.Headers = require_headers().Headers;
 module.exports.Response = require_response().Response;
 module.exports.Request = require_request().Request;
-/*! formdata-polyfill. MIT License. Jimmy Wärting <https://jimmy.warting.se/opensource> */
+module.exports.WebSocket = require_websocket().WebSocket;
+/*! Bundled license information:
+
+undici/lib/fetch/body.js:
+  (*! formdata-polyfill. MIT License. Jimmy Wärting <https://jimmy.warting.se/opensource> *)
+
+undici/lib/websocket/frame.js:
+  (*! ws. MIT License. Einar Otto Stangvik <einaros@gmail.com> *)
+*/
diff --git a/deps/uv/uv.gyp b/deps/uv/uv.gyp
index 410323d7c69276..6c86c3fa50496d 100644
--- a/deps/uv/uv.gyp
+++ b/deps/uv/uv.gyp
@@ -136,7 +136,6 @@
     'uv_sources_android': [
       'src/unix/linux.c',
       'src/unix/procfs-exepath.c',
-      'src/unix/pthread-fixes.c',
       'src/unix/random-getentropy.c',
       'src/unix/random-getrandom.c',
       'src/unix/random-sysctl-linux.c',
@@ -398,7 +397,6 @@
         }],
         ['OS=="zos"', {
           'sources': [
-            'src/unix/pthread-fixes.c',
             'src/unix/os390.c',
             'src/unix/os390-syscalls.c'
           ]
diff --git a/deps/uvwasi/include/uvwasi.h b/deps/uvwasi/include/uvwasi.h
index d475d3e67512bf..a458cfe17daaa3 100644
--- a/deps/uvwasi/include/uvwasi.h
+++ b/deps/uvwasi/include/uvwasi.h
@@ -5,12 +5,13 @@
 extern "C" {
 #endif
 
+#include "uv.h"
 #include "wasi_serdes.h"
 #include "wasi_types.h"
 
 #define UVWASI_VERSION_MAJOR 0
 #define UVWASI_VERSION_MINOR 0
-#define UVWASI_VERSION_PATCH 18
+#define UVWASI_VERSION_PATCH 19
 #define UVWASI_VERSION_HEX ((UVWASI_VERSION_MAJOR << 16) | \
                             (UVWASI_VERSION_MINOR <<  8) | \
                             (UVWASI_VERSION_PATCH))
@@ -47,6 +48,7 @@ typedef struct uvwasi_s {
   char* env_buf;
   uvwasi_size_t env_buf_size;
   const uvwasi_mem_t* allocator;
+  uv_loop_t* loop;
 } uvwasi_t;
 
 typedef struct uvwasi_preopen_s {
@@ -54,10 +56,17 @@ typedef struct uvwasi_preopen_s {
   const char* real_path;
 } uvwasi_preopen_t;
 
+typedef struct uvwasi_preopen_socket_s {
+  const char* address;
+  int port;
+} uvwasi_preopen_socket_t;
+
 typedef struct uvwasi_options_s {
   uvwasi_size_t fd_table_size;
   uvwasi_size_t preopenc;
   uvwasi_preopen_t* preopens;
+  uvwasi_size_t preopen_socketc;
+  uvwasi_preopen_socket_t* preopen_sockets;
   uvwasi_size_t argc;
   const char** argv;
   const char** envp;
diff --git a/deps/uvwasi/src/fd_table.c b/deps/uvwasi/src/fd_table.c
index 7782f1ee43b420..881d192ff3a340 100644
--- a/deps/uvwasi/src/fd_table.c
+++ b/deps/uvwasi/src/fd_table.c
@@ -37,6 +37,7 @@ static uvwasi_errno_t uvwasi__insert_stdio(uvwasi_t* uvwasi,
   err = uvwasi_fd_table_insert(uvwasi,
                                table,
                                fd,
+                               NULL,
                                name,
                                name,
                                type,
@@ -58,6 +59,7 @@ static uvwasi_errno_t uvwasi__insert_stdio(uvwasi_t* uvwasi,
 uvwasi_errno_t uvwasi_fd_table_insert(uvwasi_t* uvwasi,
                                       struct uvwasi_fd_table_t* table,
                                       uv_file fd,
+                                      uv_tcp_t* sock,
                                       const char* mapped_path,
                                       const char* real_path,
                                       uvwasi_filetype_t type,
@@ -78,29 +80,40 @@ uvwasi_errno_t uvwasi_fd_table_insert(uvwasi_t* uvwasi,
   char* rp_copy;
   char* np_copy;
 
-  mp_len = strlen(mapped_path);
-  rp_len = strlen(real_path);
+  if (type != UVWASI_FILETYPE_SOCKET_STREAM) {
+    mp_len = strlen(mapped_path);
+    rp_len = strlen(real_path);
+  } else {
+    mp_len = 0;
+    rp_len = 0;
+    rp_copy = NULL;
+    mp_copy = NULL;
+    np_copy = NULL;
+  }
+
   /* Reserve room for the mapped path, real path, and normalized mapped path. */
   entry = (struct uvwasi_fd_wrap_t*)
     uvwasi__malloc(uvwasi, sizeof(*entry) + mp_len + mp_len + rp_len + 3);
   if (entry == NULL)
     return UVWASI_ENOMEM;
 
-  mp_copy = (char*)(entry + 1);
-  rp_copy = mp_copy + mp_len + 1;
-  np_copy = rp_copy + rp_len + 1;
-  memcpy(mp_copy, mapped_path, mp_len);
-  mp_copy[mp_len] = '\0';
-  memcpy(rp_copy, real_path, rp_len);
-  rp_copy[rp_len] = '\0';
-
-  /* Calculate the normalized version of the mapped path, as it will be used for
-     any path calculations on this fd. Use the length of the mapped path as an
-     upper bound for the normalized path length. */
-  err = uvwasi__normalize_path(mp_copy, mp_len, np_copy, mp_len);
-  if (err) {
-    uvwasi__free(uvwasi, entry);
-    goto exit;
+  if (type != UVWASI_FILETYPE_SOCKET_STREAM) {
+    mp_copy = (char*)(entry + 1);
+    rp_copy = mp_copy + mp_len + 1;
+    np_copy = rp_copy + rp_len + 1;
+    memcpy(mp_copy, mapped_path, mp_len);
+    mp_copy[mp_len] = '\0';
+    memcpy(rp_copy, real_path, rp_len);
+    rp_copy[rp_len] = '\0';
+
+    /* Calculate the normalized version of the mapped path, as it will be used for
+       any path calculations on this fd. Use the length of the mapped path as an
+       upper bound for the normalized path length. */
+    err = uvwasi__normalize_path(mp_copy, mp_len, np_copy, mp_len);
+    if (err) {
+      uvwasi__free(uvwasi, entry);
+      goto exit;
+    }
   }
 
   uv_rwlock_wrlock(&table->rwlock);
@@ -150,6 +163,7 @@ uvwasi_errno_t uvwasi_fd_table_insert(uvwasi_t* uvwasi,
 
   entry->id = index;
   entry->fd = fd;
+  entry->sock = sock;
   entry->path = mp_copy;
   entry->real_path = rp_copy;
   entry->normalized_path = np_copy;
@@ -280,6 +294,7 @@ uvwasi_errno_t uvwasi_fd_table_insert_preopen(uvwasi_t* uvwasi,
   return uvwasi_fd_table_insert(uvwasi,
                                 table,
                                 fd,
+                                NULL,
                                 path,
                                 real_path,
                                 UVWASI_FILETYPE_DIRECTORY,
@@ -290,6 +305,26 @@ uvwasi_errno_t uvwasi_fd_table_insert_preopen(uvwasi_t* uvwasi,
 }
 
 
+uvwasi_errno_t uvwasi_fd_table_insert_preopen_socket(uvwasi_t* uvwasi,
+                                              struct uvwasi_fd_table_t* table,
+                                              uv_tcp_t* sock) {
+  if (table == NULL || sock == NULL)
+    return UVWASI_EINVAL;
+
+  return uvwasi_fd_table_insert(uvwasi,
+                                table,
+                                -1,
+                                sock,
+                                NULL,
+                                NULL,
+                                UVWASI_FILETYPE_SOCKET_STREAM,
+                                UVWASI__RIGHTS_SOCKET_BASE,
+                                UVWASI__RIGHTS_SOCKET_INHERITING,
+                                1,
+                                NULL);
+}
+
+
 uvwasi_errno_t uvwasi_fd_table_get(struct uvwasi_fd_table_t* table,
                                    const uvwasi_fd_t id,
                                    struct uvwasi_fd_wrap_t** wrap,
diff --git a/deps/uvwasi/src/fd_table.h b/deps/uvwasi/src/fd_table.h
index 0755c2d17fdec2..9a7a825bc85d4c 100644
--- a/deps/uvwasi/src/fd_table.h
+++ b/deps/uvwasi/src/fd_table.h
@@ -11,6 +11,7 @@ struct uvwasi_options_s;
 struct uvwasi_fd_wrap_t {
   uvwasi_fd_t id;
   uv_file fd;
+  uv_tcp_t* sock;
   char* path;
   char* real_path;
   char* normalized_path;
@@ -35,6 +36,7 @@ void uvwasi_fd_table_free(struct uvwasi_s* uvwasi,
 uvwasi_errno_t uvwasi_fd_table_insert(struct uvwasi_s* uvwasi,
                                       struct uvwasi_fd_table_t* table,
                                       uv_file fd,
+                                      uv_tcp_t* sock,
                                       const char* mapped_path,
                                       const char* real_path,
                                       uvwasi_filetype_t type,
@@ -47,6 +49,9 @@ uvwasi_errno_t uvwasi_fd_table_insert_preopen(struct uvwasi_s* uvwasi,
                                               const uv_file fd,
                                               const char* path,
                                               const char* real_path);
+uvwasi_errno_t uvwasi_fd_table_insert_preopen_socket(struct uvwasi_s* uvwasi,
+                                              struct uvwasi_fd_table_t* table,
+                                              uv_tcp_t* sock);
 uvwasi_errno_t uvwasi_fd_table_get(struct uvwasi_fd_table_t* table,
                                    const uvwasi_fd_t id,
                                    struct uvwasi_fd_wrap_t** wrap,
diff --git a/deps/uvwasi/src/sync_helpers.c b/deps/uvwasi/src/sync_helpers.c
new file mode 100644
index 00000000000000..c63a62b83d75ed
--- /dev/null
+++ b/deps/uvwasi/src/sync_helpers.c
@@ -0,0 +1,95 @@
+#include "uv.h"
+#include "sync_helpers.h"
+#include "uv_mapping.h"
+#include "uvwasi_alloc.h"
+
+typedef struct free_handle_data_s {
+  uvwasi_t* uvwasi;
+  int done;
+} free_handle_data_t;
+
+static void free_handle_cb(uv_handle_t* handle) {
+  free_handle_data_t* free_handle_data = uv_handle_get_data((uv_handle_t*) handle);
+  uvwasi__free(free_handle_data->uvwasi, handle);
+  free_handle_data->done = 1;
+}
+
+int free_handle_sync(struct uvwasi_s* uvwasi, uv_handle_t* handle) {
+  free_handle_data_t free_handle_data = { uvwasi, 0 };
+  uv_handle_set_data(handle, (void*) &free_handle_data);
+  uv_close(handle, free_handle_cb);
+  uv_loop_t* handle_loop = uv_handle_get_loop(handle);
+  while(!free_handle_data.done) {
+    if (uv_run(handle_loop, UV_RUN_ONCE) == 0) {
+      break;
+    }
+  }
+  return UVWASI_ESUCCESS;
+}
+
+static void do_stream_shutdown(uv_shutdown_t* req, int status) {
+  shutdown_data_t* shutdown_data;
+  shutdown_data = uv_handle_get_data((uv_handle_t*) req->handle);
+  shutdown_data->status = status;
+  shutdown_data->done = 1;
+ }
+
+int shutdown_stream_sync(struct uvwasi_s* uvwasi,
+                          uv_stream_t* stream,
+		          shutdown_data_t* shutdown_data) {
+  uv_shutdown_t req; 
+  uv_loop_t* stream_loop;
+
+  shutdown_data->done = 0;
+  shutdown_data->status = 0;
+  stream_loop = uv_handle_get_loop((uv_handle_t*) stream);
+
+  uv_handle_set_data((uv_handle_t*) stream, (void*) shutdown_data);
+  uv_shutdown(&req, stream, do_stream_shutdown);
+  while (!shutdown_data->done) {
+    if (uv_run(stream_loop, UV_RUN_ONCE) == 0) {
+      return UVWASI_ECANCELED;
+    }
+  }
+  return UVWASI_ESUCCESS;
+}
+
+static void recv_alloc_cb(uv_handle_t* handle, size_t suggested_size, uv_buf_t* buf) {
+  recv_data_t* recv_data;
+  recv_data = uv_handle_get_data(handle);
+  buf->base = recv_data->base;
+  buf->len = recv_data->len;
+}
+
+void do_stream_recv(uv_stream_t* stream, ssize_t nread, const uv_buf_t* buf) {
+  recv_data_t* recv_data;
+  recv_data = uv_handle_get_data((uv_handle_t*) stream);
+  uv_read_stop(stream);
+  recv_data->nread = nread;
+  recv_data->done = 1;
+}
+
+int read_stream_sync(struct uvwasi_s* uvwasi,
+                     uv_stream_t* stream,
+	             recv_data_t* recv_data) {
+  uv_loop_t* recv_loop;
+  int r;
+
+  recv_data->nread = 0;
+  recv_data->done = 0;
+  recv_loop = uv_handle_get_loop((uv_handle_t*) stream);
+
+  uv_handle_set_data((uv_handle_t*) stream, (void*) recv_data);
+  r = uv_read_start(stream, recv_alloc_cb, do_stream_recv);
+  if (r != 0) {
+    return uvwasi__translate_uv_error(r);
+  }
+
+  while (!recv_data->done) {
+    if (uv_run(recv_loop, UV_RUN_ONCE) == 0) {
+      return UVWASI_ECANCELED;
+    }
+ }
+
+  return UVWASI_ESUCCESS;
+}
diff --git a/deps/uvwasi/src/sync_helpers.h b/deps/uvwasi/src/sync_helpers.h
new file mode 100644
index 00000000000000..6ffe2cac133d6c
--- /dev/null
+++ b/deps/uvwasi/src/sync_helpers.h
@@ -0,0 +1,27 @@
+#ifndef __UVWASI_SYNC_HELPERS_H__
+#define __UVWASI_SYNC_HELPERS_H__
+
+struct uvwasi_s;
+
+typedef struct shutdown_data_s {
+  int status;
+  int done;
+} shutdown_data_t;
+
+typedef struct recv_data_s {
+  char* base;
+  size_t len;
+  ssize_t nread;
+  int done;
+} recv_data_t;
+
+int free_handle_sync(struct uvwasi_s* uvwasi, uv_handle_t* handle);
+
+int shutdown_stream_sync(struct uvwasi_s* uvwasi,
+                         uv_stream_t* stream,
+                         shutdown_data_t* shutdown_data);
+
+int read_stream_sync(struct uvwasi_s* uvwasi,
+                     uv_stream_t* stream,
+	             recv_data_t* recv_data);
+#endif /* __UVWASI_SYNC_HELPERS_H__ */
diff --git a/deps/uvwasi/src/uvwasi.c b/deps/uvwasi/src/uvwasi.c
index 9e7fc7681664b8..e904b9f9293864 100644
--- a/deps/uvwasi/src/uvwasi.c
+++ b/deps/uvwasi/src/uvwasi.c
@@ -25,6 +25,7 @@
 #include "clocks.h"
 #include "path_resolver.h"
 #include "poll_oneoff.h"
+#include "sync_helpers.h"
 #include "wasi_rights.h"
 #include "wasi_serdes.h"
 #include "debug.h"
@@ -231,6 +232,13 @@ static uvwasi_errno_t uvwasi__setup_ciovs(const uvwasi_t* uvwasi,
   return UVWASI_ESUCCESS;
 }
 
+typedef struct new_connection_data_s {
+  int done;
+} new_connection_data_t;
+
+void on_new_connection(uv_stream_t *server, int status) {
+  // just do nothing
+}
 
 uvwasi_errno_t uvwasi_init(uvwasi_t* uvwasi, const uvwasi_options_t* options) {
   uv_fs_t realpath_req;
@@ -243,11 +251,16 @@ uvwasi_errno_t uvwasi_init(uvwasi_t* uvwasi, const uvwasi_options_t* options) {
   uvwasi_size_t env_buf_size;
   uvwasi_size_t i;
   int r;
+  struct sockaddr_in addr;
 
   if (uvwasi == NULL || options == NULL || options->fd_table_size == 0)
     return UVWASI_EINVAL;
 
+  // loop is only needed if there were pre-open sockets
+  uvwasi->loop = NULL;
+
   uvwasi->allocator = options->allocator;
+
   if (uvwasi->allocator == NULL)
     uvwasi->allocator = &default_allocator;
 
@@ -328,6 +341,14 @@ uvwasi_errno_t uvwasi_init(uvwasi_t* uvwasi, const uvwasi_options_t* options) {
     }
   }
 
+  for (i = 0; i < options->preopen_socketc; ++i) {
+    if (options->preopen_sockets[i].address == NULL ||
+        options->preopen_sockets[i].port > 65535) {
+      err = UVWASI_EINVAL;
+      goto exit;
+    }
+  }
+
   err = uvwasi_fd_table_init(uvwasi, options);
   if (err != UVWASI_ESUCCESS)
     goto exit;
@@ -363,6 +384,36 @@ uvwasi_errno_t uvwasi_init(uvwasi_t* uvwasi, const uvwasi_options_t* options) {
       goto exit;
   }
 
+  if (options->preopen_socketc > 0) {
+    uvwasi->loop = uvwasi__malloc(uvwasi, sizeof(uv_loop_t));
+    r = uv_loop_init(uvwasi->loop);
+    if (r != 0) {
+      err = uvwasi__translate_uv_error(r);
+      goto exit;
+    }
+  }
+
+  for (i = 0; i < options->preopen_socketc; ++i) {
+    uv_tcp_t* socket = (uv_tcp_t*) malloc(sizeof(uv_tcp_t));
+    uv_tcp_init(uvwasi->loop, socket);
+
+    uv_ip4_addr(options->preopen_sockets[i].address, options->preopen_sockets[i].port, &addr);
+
+    uv_tcp_bind(socket, (const struct sockaddr*)&addr, 0);
+    r = uv_listen((uv_stream_t*) socket, 128, on_new_connection);
+    if (r != 0) {
+      err = uvwasi__translate_uv_error(r);
+      goto exit;
+    }
+
+    err = uvwasi_fd_table_insert_preopen_socket(uvwasi,
+                                         uvwasi->fds,
+                                         socket);
+
+    if (err != UVWASI_ESUCCESS)
+      goto exit;
+  }
+
   return UVWASI_ESUCCESS;
 
 exit:
@@ -380,6 +431,12 @@ void uvwasi_destroy(uvwasi_t* uvwasi) {
   uvwasi__free(uvwasi, uvwasi->argv);
   uvwasi__free(uvwasi, uvwasi->env_buf);
   uvwasi__free(uvwasi, uvwasi->env);
+  if (uvwasi->loop != NULL) {
+    uv_stop(uvwasi->loop);
+    uv_loop_close(uvwasi->loop);
+    uvwasi__free(uvwasi, uvwasi->loop);
+    uvwasi->loop = NULL;
+  }
   uvwasi->fds = NULL;
   uvwasi->argv_buf = NULL;
   uvwasi->argv = NULL;
@@ -401,6 +458,8 @@ void uvwasi_options_init(uvwasi_options_t* options) {
   options->envp = NULL;
   options->preopenc = 0;
   options->preopens = NULL;
+  options->preopen_socketc = 0;
+  options->preopen_sockets = NULL;
   options->allocator = NULL;
 }
 
@@ -694,10 +753,9 @@ uvwasi_errno_t uvwasi_fd_allocate(uvwasi_t* uvwasi,
   return err;
 }
 
-
 uvwasi_errno_t uvwasi_fd_close(uvwasi_t* uvwasi, uvwasi_fd_t fd) {
   struct uvwasi_fd_wrap_t* wrap;
-  uvwasi_errno_t err;
+  uvwasi_errno_t err = 0;
   uv_fs_t req;
   int r;
 
@@ -712,9 +770,18 @@ uvwasi_errno_t uvwasi_fd_close(uvwasi_t* uvwasi, uvwasi_fd_t fd) {
   if (err != UVWASI_ESUCCESS)
     goto exit;
 
-  r = uv_fs_close(NULL, &req, wrap->fd, NULL);
-  uv_mutex_unlock(&wrap->mutex);
-  uv_fs_req_cleanup(&req);
+  if (wrap->sock == NULL) {
+    r = uv_fs_close(NULL, &req, wrap->fd, NULL);
+    uv_mutex_unlock(&wrap->mutex);
+    uv_fs_req_cleanup(&req);
+  } else {
+    r = 0;
+    err = free_handle_sync(uvwasi, (uv_handle_t*) wrap->sock);
+    uv_mutex_unlock(&wrap->mutex);
+    if (err != UVWASI_ESUCCESS) {
+      goto exit;
+    }   
+  }
 
   if (r != 0) {
     err = uvwasi__translate_uv_error(r);
@@ -1997,6 +2064,7 @@ uvwasi_errno_t uvwasi_path_open(uvwasi_t* uvwasi,
   err = uvwasi_fd_table_insert(uvwasi,
                                uvwasi->fds,
                                r,
+                               NULL,
                                resolved_path,
                                resolved_path,
                                filetype,
@@ -2520,7 +2588,6 @@ uvwasi_errno_t uvwasi_sched_yield(uvwasi_t* uvwasi) {
   return UVWASI_ESUCCESS;
 }
 
-
 uvwasi_errno_t uvwasi_sock_recv(uvwasi_t* uvwasi,
                                 uvwasi_fd_t sock,
                                 const uvwasi_iovec_t* ri_data,
@@ -2528,10 +2595,50 @@ uvwasi_errno_t uvwasi_sock_recv(uvwasi_t* uvwasi,
                                 uvwasi_riflags_t ri_flags,
                                 uvwasi_size_t* ro_datalen,
                                 uvwasi_roflags_t* ro_flags) {
-  /* TODO(cjihrig): Waiting to implement, pending
-                    https://github.com/WebAssembly/WASI/issues/4 */
-  UVWASI_DEBUG("uvwasi_sock_recv(uvwasi=%p, unimplemented)\n", uvwasi);
-  return UVWASI_ENOTSUP;
+  struct uvwasi_fd_wrap_t* wrap;
+  uvwasi_errno_t err = 0;
+  recv_data_t recv_data;
+
+  UVWASI_DEBUG("uvwasi_sock_recv(uvwasi=%p, sock=%d, ri_data=%p, "
+	       "ri_data_len=%d, ri_flags=%d, ro_datalen=%p, ro_flags=%p)\n",
+               uvwasi,
+               sock,
+               ri_data,
+               ri_data_len,
+               ri_flags,
+               ro_datalen,
+               ro_flags);
+
+  if (uvwasi == NULL || ri_data == NULL || ro_datalen == NULL || ro_flags == NULL)
+    return UVWASI_EINVAL;
+
+  if (ri_flags != 0)
+    return UVWASI_ENOTSUP;
+
+  err = uvwasi_fd_table_get(uvwasi->fds,
+                            sock,
+                            &wrap,
+                            UVWASI__RIGHTS_SOCKET_BASE,
+                            0);
+  if (err != UVWASI_ESUCCESS)
+    return err;
+
+  recv_data.base = ri_data->buf;
+  recv_data.len = ri_data->buf_len;
+  err = read_stream_sync(uvwasi, (uv_stream_t*) wrap->sock, &recv_data);
+  uv_mutex_unlock(&wrap->mutex);
+  if (err != 0) {
+    return err;
+  }
+
+  if (recv_data.nread == 0) {
+    return UVWASI_EAGAIN;
+  } else if (recv_data.nread < 0) {
+    return uvwasi__translate_uv_error(recv_data.nread);
+  }
+
+  *ro_datalen = recv_data.nread;
+  return UVWASI_ESUCCESS;
 }
 
 
@@ -2541,30 +2648,195 @@ uvwasi_errno_t uvwasi_sock_send(uvwasi_t* uvwasi,
                                 uvwasi_size_t si_data_len,
                                 uvwasi_siflags_t si_flags,
                                 uvwasi_size_t* so_datalen) {
-  /* TODO(cjihrig): Waiting to implement, pending
-                    https://github.com/WebAssembly/WASI/issues/4 */
-  UVWASI_DEBUG("uvwasi_sock_send(uvwasi=%p, unimplemented)\n", uvwasi);
-  return UVWASI_ENOTSUP;
-}
 
+  struct uvwasi_fd_wrap_t* wrap;
+  uvwasi_errno_t err = 0;
+  uv_buf_t* bufs;
+  int r = 0;
+
+  UVWASI_DEBUG("uvwasi_sock_send(uvwasi=%p, sock=%d, si_data=%p, "
+	       "si_data_len=%d, si_flags=%d, so_datalen=%p)\n",
+               uvwasi,
+               sock,
+               si_data,
+               si_data_len,
+               si_flags,
+               so_datalen);
+
+  if (uvwasi == NULL || si_data == NULL || so_datalen == NULL ||
+      si_flags != 0)
+    return UVWASI_EINVAL;
+
+  err = uvwasi_fd_table_get(uvwasi->fds,
+                            sock,
+                            &wrap,
+                            UVWASI__RIGHTS_SOCKET_BASE,
+                            0);
+  if (err != UVWASI_ESUCCESS)
+    return err;
+
+  err = uvwasi__setup_ciovs(uvwasi, &bufs, si_data, si_data_len);
+  if (err != UVWASI_ESUCCESS) {
+    uv_mutex_unlock(&wrap->mutex);
+    return err;
+  }
+
+  r = uv_try_write((uv_stream_t*) wrap->sock, bufs, si_data_len);
+  uvwasi__free(uvwasi, bufs);
+  uv_mutex_unlock(&wrap->mutex);
+  if (r < 0)
+    return uvwasi__translate_uv_error(r);
+
+  *so_datalen = (uvwasi_size_t) r;
+  return UVWASI_ESUCCESS;
+}
 
 uvwasi_errno_t uvwasi_sock_shutdown(uvwasi_t* uvwasi,
                                     uvwasi_fd_t sock,
                                     uvwasi_sdflags_t how) {
-  /* TODO(cjihrig): Waiting to implement, pending
-                    https://github.com/WebAssembly/WASI/issues/4 */
-  UVWASI_DEBUG("uvwasi_sock_shutdown(uvwasi=%p, unimplemented)\n", uvwasi);
-  return UVWASI_ENOTSUP;
+  struct uvwasi_fd_wrap_t* wrap;
+  uvwasi_errno_t err = 0;
+  shutdown_data_t shutdown_data;
+
+  if (how & ~UVWASI_SHUT_WR)
+    return UVWASI_ENOTSUP;
+
+  UVWASI_DEBUG("uvwasi_sock_shutdown(uvwasi=%p, sock=%d, how=%d)\n",
+               uvwasi,
+               sock,
+               how);
+
+  if (uvwasi == NULL)
+    return UVWASI_EINVAL;
+
+  err = uvwasi_fd_table_get(uvwasi->fds,
+                            sock,
+                            &wrap,
+                            UVWASI__RIGHTS_SOCKET_BASE,
+                            0);
+  if (err != UVWASI_ESUCCESS)
+    return err;
+
+  if (how & UVWASI_SHUT_WR) {
+    err = shutdown_stream_sync(uvwasi, (uv_stream_t*) wrap->sock, &shutdown_data);
+    if (err != UVWASI_ESUCCESS) {
+      uv_mutex_unlock(&wrap->mutex);
+      return err;
+    }
+  }
+
+  uv_mutex_unlock(&wrap->mutex);
+
+  if (shutdown_data.status != 0) 
+    return uvwasi__translate_uv_error(shutdown_data.status);
+
+  return UVWASI_ESUCCESS;
 }
 
 uvwasi_errno_t uvwasi_sock_accept(uvwasi_t* uvwasi,
                                   uvwasi_fd_t sock,
                                   uvwasi_fdflags_t flags,
-                                  uvwasi_fd_t* fd) {
-  /* TODO(mhdawson): Needs implementation */
-  UVWASI_DEBUG("uvwasi_sock_accept(uvwasi=%p, unimplemented)\n", uvwasi);
-  return UVWASI_ENOTSUP;
-};
+                                  uvwasi_fd_t* connect_sock) {
+  struct uvwasi_fd_wrap_t* wrap;
+  struct uvwasi_fd_wrap_t* connected_wrap;
+  uvwasi_errno_t err = 0;
+  uv_loop_t* sock_loop = NULL;
+  int r = 0;
+
+  UVWASI_DEBUG("uvwasi_sock_accept(uvwasi=%p, sock=%d, flags=%d, "
+               "connect_sock=%p)\n",
+               uvwasi,
+               sock,
+               flags,
+               connect_sock);
+
+  if (uvwasi == NULL || connect_sock == NULL)
+    return UVWASI_EINVAL;
+
+  if (flags & ~UVWASI_FDFLAG_NONBLOCK)
+    return UVWASI_ENOTSUP;
+
+  err = uvwasi_fd_table_get(uvwasi->fds,
+                            sock,
+                            &wrap,
+                            UVWASI__RIGHTS_SOCKET_BASE,
+                            0);
+  if (err != UVWASI_ESUCCESS)
+    return err;
+
+  sock_loop = uv_handle_get_loop((uv_handle_t*) wrap->sock);
+  uv_tcp_t* uv_connect_sock = (uv_tcp_t*) uvwasi__malloc(uvwasi, sizeof(uv_tcp_t));
+  uv_tcp_init(sock_loop, uv_connect_sock);
+
+  r = uv_accept((uv_stream_t*) wrap->sock, (uv_stream_t*) uv_connect_sock);
+  if (r != 0) {
+    if (r == UV_EAGAIN) {
+      // if not blocking then just return as we have to wait for a connection
+      if (flags & UVWASI_FDFLAG_NONBLOCK) {
+        err = free_handle_sync(uvwasi, (uv_handle_t*) uv_connect_sock);
+        uv_mutex_unlock(&wrap->mutex);
+        if (err != UVWASI_ESUCCESS) {
+          return err;
+	}
+        return UVWASI_EAGAIN;
+      }
+    } else {
+      err = uvwasi__translate_uv_error(r);
+      goto close_sock_and_error_exit;
+    }
+
+    // request was blocking and we have no connection yet. run
+    // the loop until a connection comes in
+    while (1) {
+      err = 0;
+      if (uv_run(sock_loop, UV_RUN_ONCE) == 0) {
+        err = UVWASI_ECONNABORTED;
+        goto close_sock_and_error_exit;
+      }
+
+      int r = uv_accept((uv_stream_t*) wrap->sock, (uv_stream_t*) uv_connect_sock);
+      if (r == UV_EAGAIN) {
+	// still no connection or error so run the loop again
+        continue;
+      }
+
+      if (r != 0) {
+	// An error occurred accepting the connection. Break out of the loop and
+	// report an error.
+        err = uvwasi__translate_uv_error(r);
+        goto close_sock_and_error_exit;
+      }
+
+      // if we get here a new connection was successfully accepted
+      break;
+    }
+  }
+
+  err = uvwasi_fd_table_insert(uvwasi,
+                               uvwasi->fds,
+                               -1,
+                               uv_connect_sock,
+                               NULL,
+                               NULL,
+                               UVWASI_FILETYPE_SOCKET_STREAM,
+                               UVWASI__RIGHTS_SOCKET_BASE,
+                               UVWASI__RIGHTS_SOCKET_INHERITING,
+                               1,
+                               &connected_wrap);
+
+  if (err != UVWASI_ESUCCESS)
+    goto close_sock_and_error_exit;
+
+  *connect_sock = connected_wrap->id;
+  uv_mutex_unlock(&wrap->mutex);
+  uv_mutex_unlock(&connected_wrap->mutex);
+  return UVWASI_ESUCCESS;
+
+close_sock_and_error_exit:
+  uvwasi__free(uvwasi, uv_connect_sock);
+  uv_mutex_unlock(&wrap->mutex);
+  return err;
+}
 
 
 const char* uvwasi_embedder_err_code_to_string(uvwasi_errno_t code) {
diff --git a/deps/uvwasi/src/wasi_rights.h b/deps/uvwasi/src/wasi_rights.h
index 09009b39889cc0..54ac7d7072b7fe 100644
--- a/deps/uvwasi/src/wasi_rights.h
+++ b/deps/uvwasi/src/wasi_rights.h
@@ -84,8 +84,9 @@
                                     UVWASI_RIGHT_FD_WRITE |                   \
                                     UVWASI_RIGHT_FD_FILESTAT_GET |            \
                                     UVWASI_RIGHT_POLL_FD_READWRITE |          \
-                                    UVWASI_RIGHT_SOCK_SHUTDOWN)
-#define UVWASI__RIGHTS_SOCKET_INHERITING UVWASI__RIGHTS_ALL;
+                                    UVWASI_RIGHT_SOCK_SHUTDOWN |              \
+                                    UVWASI_RIGHT_SOCK_ACCEPT)
+#define UVWASI__RIGHTS_SOCKET_INHERITING UVWASI__RIGHTS_ALL
 
 #define UVWASI__RIGHTS_TTY_BASE (UVWASI_RIGHT_FD_READ |                       \
                                  UVWASI_RIGHT_FD_FDSTAT_SET_FLAGS |           \
diff --git a/deps/uvwasi/uvwasi.gyp b/deps/uvwasi/uvwasi.gyp
index 229dc9f41f8de8..4dfe3c46d51818 100644
--- a/deps/uvwasi/uvwasi.gyp
+++ b/deps/uvwasi/uvwasi.gyp
@@ -5,6 +5,7 @@
       'src/fd_table.c',
       'src/path_resolver.c',
       'src/poll_oneoff.c',
+      'src/sync_helpers.c',
       'src/uv_mapping.c',
       'src/uvwasi.c',
       'src/wasi_rights.c',
diff --git a/deps/v8/.clang-format b/deps/v8/.clang-format
index 55479a2f760845..bd7d80dfb7b964 100644
--- a/deps/v8/.clang-format
+++ b/deps/v8/.clang-format
@@ -3,3 +3,4 @@
 BasedOnStyle: Google
 DerivePointerAlignment: false
 MaxEmptyLinesToKeep: 1
+IfMacros: ['IF', 'IF_NOT', 'ELSE', 'ELSE_IF']
diff --git a/deps/v8/.gitignore b/deps/v8/.gitignore
index ed10b522706058..820bac62f897a5 100644
--- a/deps/v8/.gitignore
+++ b/deps/v8/.gitignore
@@ -63,6 +63,8 @@
 /test/wasm-spec-tests/tests.tar.gz
 /third_party/*
 !/third_party/antlr4
+!/third_party/cpu_features
+/third_party/cpu_features/src
 !/third_party/inspector_protocol
 !/third_party/jsoncpp
 /third_party/jsoncpp/source
@@ -94,6 +96,7 @@
 /tools/turbolizer/build
 /tools/turbolizer/.rpt2_cache
 /tools/turbolizer/deploy
+/tools/v8heapconst.py
 /tools/visual_studio/Debug
 /tools/visual_studio/Release
 /v8.log.ll
diff --git a/deps/v8/.gn b/deps/v8/.gn
index 8edbdf34c51807..1ca4a2e4684b45 100644
--- a/deps/v8/.gn
+++ b/deps/v8/.gn
@@ -19,8 +19,8 @@ no_check_targets = [
   "//:cppgc_base",
   "//:v8_internal_headers",
   "//src/inspector:inspector",
-  "//test/cctest:cctest_sources", # 15 errors
-  "//test/unittests:inspector_unittests_sources", # 2 errors
+  "//test/cctest:cctest_sources",  # 15 errors
+  "//test/unittests:inspector_unittests_sources",  # 2 errors
   "//third_party/icu:*",
 ]
 
@@ -28,6 +28,9 @@ default_args = {
   # Overwrite default args declared in the Fuchsia sdk
   # Please maintain this in sync with Chromium version in src/.gn
   fuchsia_target_api_level = 9
+
+  # Disable rust dependencies.
+  enable_rust = false
 }
 
 # These are the list of GN files that run exec_script. This whitelist exists
diff --git a/deps/v8/.vpython3 b/deps/v8/.vpython3
index 1187542f5e19a1..c4adffad12ea28 100644
--- a/deps/v8/.vpython3
+++ b/deps/v8/.vpython3
@@ -75,7 +75,24 @@ wheel: <
   version: "version:3.19.3"
 >
 
+# requests and its dependencies.
 wheel: <
-  name: "infra/python/wheels/requests-py2_py3"
-  version: "version:2.13.0"
+  name: "infra/python/wheels/requests-py3"
+  version: "version:2.31.0"
+>
+wheel: <
+  name: "infra/python/wheels/urllib3-py2_py3"
+  version: "version:1.26.6"
+>
+wheel: <
+  name: "infra/python/wheels/idna-py2_py3"
+  version: "version:2.8"
+>
+wheel: <
+  name: "infra/python/wheels/certifi-py2_py3"
+  version: "version:2020.11.8"
+>
+wheel: <
+  name: "infra/python/wheels/charset_normalizer-py3"
+  version: "version:2.0.4"
 >
diff --git a/deps/v8/AUTHORS b/deps/v8/AUTHORS
index d84c722b8dcb7b..b9b702c5d22400 100644
--- a/deps/v8/AUTHORS
+++ b/deps/v8/AUTHORS
@@ -69,6 +69,8 @@ Anton Bershanskiy <8knots@protonmail.com>
 Anton Bikineev <ant.bikineev@gmail.com>
 Ao Wang <wangao.james@bytedance.com>
 Archil Sharashenidze <achosharashenidze@gmail.com>
+Arthur Islamov <arthur@islamov.ai>
+Aurèle Barrière <aurele.barriere@gmail.com>
 Bala Avulapati <bavulapati@gmail.com>
 Bangfu Tao <bangfu.tao@samsung.com>
 Ben Coe <bencoe@gmail.com>
@@ -110,6 +112,7 @@ Dominic Farolini <domfarolino@gmail.com>
 Douglas Crosher <dtc-v8@scieneer.com>
 Dusan Milosavljevic <dusan.m.milosavljevic@gmail.com>
 Eden Wang <nedenwang@tencent.com>
+Elisha Hollander <just4now666666@gmail.com>
 Eric Rannaud <eric.rannaud@gmail.com>
 Erich Ocean <erich.ocean@me.com>
 Evan Lucas <evan.lucas@help.com>
@@ -133,6 +136,7 @@ Harshil Jain <twitharshil@gmail.com>
 Henrique Ferreiro <henrique.ferreiro@gmail.com>
 Hirofumi Mako <mkhrfm@gmail.com>
 Hisham Muhammad <hisham@gobolinux.org>
+Ho Cheung <uioptt24@gmail.com>
 Honggyu Kim <honggyu.kp@gmail.com>
 Huáng Jùnliàng <jlhwung@gmail.com>
 HyeockJin Kim <kherootz@gmail.com>
@@ -149,6 +153,7 @@ Jan de Mooij <jandemooij@gmail.com>
 Janusz Majnert <jmajnert@gmail.com>
 Javad Amiri <javad.amiri@anu.edu.au>
 Jay Freeman <saurik@saurik.com>
+Jérôme Vouillon <jerome.vouillon@gmail.com>
 Jesper van den Ende <jespertheend@gmail.com>
 Ji Qiu <qiuji@iscas.ac.cn>
 Jiawen Geng <technicalcute@gmail.com>
@@ -167,6 +172,7 @@ Kang-Hao (Kenny) Lu <kennyluck@csail.mit.edu>
 Karl Skomski <karl@skomski.com>
 Keith Smiley <keithbsmiley@gmail.com>
 Kevin Gibbons <bakkot@gmail.com>
+Keyhan Vakil <kvakil@googlecontrib.kvakil.me>
 Kris Selden <kris.selden@gmail.com>
 Kyounga Ra <kyounga@alticast.com>
 Loo Rong Jie <loorongjie@gmail.com>
@@ -178,6 +184,7 @@ Maciej Małecki <me@mmalecki.com>
 Marcel Laverdet <marcel@laverdet.com>
 Marcin Cieślak <saper@marcincieslak.com>
 Marcin Wiącek <marcin@mwiacek.com>
+Marisa Kirisame <u1319884@utah.edu>
 Martin Bidlingmaier <martin.bidlingmaier@gmail.com>
 Mateusz Czeladka <mateusz.szczap@gmail.com>
 Matheus Marchini <mat@mmarchini.me>
@@ -187,6 +194,7 @@ Matt Hanselman <mjhanselman@gmail.com>
 Matthew Sporleder <msporleder@gmail.com>
 Maxim Mazurok <maxim@mazurok.com>
 Maxim Mossienko <maxim.mossienko@gmail.com>
+Meir Shpilraien <meir@redis.com>
 Michael Lutz <michi@icosahedron.de>
 Michael Mclaughlin <m8ch88l@gmail.com>
 Michael Smith <mike@w3.org>
@@ -239,16 +247,19 @@ Sakthipriyan Vairamani (thefourtheye) <thechargingvolcano@gmail.com>
 Sander Mathijs van Veen <sander@leaningtech.com>
 Sandro Santilli <strk@keybit.net>
 Sanjoy Das <sanjoy@playingwithpointers.com>
+Sam James <sam@gentoo.org>
 Seo Sanghyeon <sanxiyn@gmail.com>
 Shawn Anastasio <shawnanastasio@gmail.com>
 Shawn Presser <shawnpresser@gmail.com>
 Stefan Penner <stefan.penner@gmail.com>
+Stefan Stojanovic <stefko.stojanovic@gmail.com>
 Stephan Hartmann <stha09@googlemail.com>
 Stephen Belanger <stephen.belanger@datadoghq.com>
 Sylvestre Ledru <sledru@mozilla.com>
 Takeshi Yoneda <takeshi@tetrate.io>
 Taketoshi Aono <brn@b6n.ch>
 Tao Liqiang <taolq@outlook.com>
+Tao Wang <tao.wang.2261@gmail.com>
 Teddy Katz <teddy.katz@gmail.com>
 Thomas Young <wenzhang5800@gmail.com>
 Tiancheng "Timothy" Gu <timothygu99@gmail.com>
@@ -265,6 +276,7 @@ Vlad Burlik <vladbph@gmail.com>
 Vladimir Krivosheev <develar@gmail.com>
 Vladimir Shutoff <vovan@shutoff.ru>
 Wael Almattar <waelsy123@gmail.com>
+Wang Chen <wangchen20@iscas.ac.cn>
 WANG Xuerui <git@xen0n.name>
 Wei Wu <lazyparser@gmail.com>
 Wenlu Wang <kingwenlu@gmail.com>
diff --git a/deps/v8/BUILD.bazel b/deps/v8/BUILD.bazel
index 81a9286d2670de..3308433ce78dfe 100644
--- a/deps/v8/BUILD.bazel
+++ b/deps/v8/BUILD.bazel
@@ -16,8 +16,7 @@ load(
     "v8_library",
     "v8_mksnapshot",
     "v8_string",
-    "v8_torque_definitions",
-    "v8_torque_initializers",
+    "v8_torque_files",
 )
 load(":bazel/v8-non-pointer-compression.bzl", "v8_binary_non_pointer_compression")
 
@@ -30,7 +29,6 @@ load(":bazel/v8-non-pointer-compression.bzl", "v8_binary_non_pointer_compression
 # v8_embed_script
 # v8_embedder_string
 # v8_promise_internal_field_count
-# v8_enable_vtunejit
 # v8_enable_vtunetracemark
 # v8_enable_fast_torque
 # v8_win64_unwinding_info
@@ -40,8 +38,10 @@ load(":bazel/v8-non-pointer-compression.bzl", "v8_binary_non_pointer_compression
 # v8_enable_trace_baseline_exec
 # v8_enable_trace_feedback_updates
 # v8_enable_atomic_object_field_writes
-# v8_enable_conservative_stack_scanning
 # v8_enable_concurrent_marking
+# v8_enable_conservative_stack_scanning
+# v8_enable_direct_handle
+# v8_enable_direct_local
 # v8_enable_ignition_dispatch_counting
 # v8_enable_builtins_optimization
 # v8_enable_builtins_profiling
@@ -56,7 +56,6 @@ load(":bazel/v8-non-pointer-compression.bzl", "v8_binary_non_pointer_compression
 # v8_use_mips_abi_hardfloat
 # v8_enable_gdbjit
 # v8_check_header_includes
-# v8_enable_shared_ro_heap
 # v8_enable_lazy_source_positions
 # v8_enable_third_party_heap
 # v8_third_party_heap_files
@@ -227,6 +226,18 @@ v8_flag(
     default = True,
 )
 
+# Shared RO heap. Flag has to be set to false when
+# v8_enable_pointer_compression_shared_cage is set to false.
+v8_flag(
+    name = "v8_enable_shared_ro_heap",
+    default = True,
+)
+
+v8_flag(
+    name = "v8_enable_extensible_ro_snapshot",
+    default = True,
+)
+
 # Enable shared cage if v8_enable_pointer_compression
 # and v8_enable_pointer_compression_shared_cage.
 selects.config_setting_group(
@@ -270,6 +281,12 @@ config_setting(
     },
 )
 
+# Enable VTune jit profiling
+v8_flag(
+    name = "v8_enable_vtunejit",
+    default = False,
+)
+
 # Default setting for v8_enable_short_builtin_calls when target is x64.
 # Disable short calls when pointer compression is not enabled.
 selects.config_setting_group(
@@ -340,6 +357,7 @@ v8_config(
         "v8_enable_verify_predictable": "VERIFY_PREDICTABLE",
         "v8_enable_webassembly": "V8_ENABLE_WEBASSEMBLY",
         "v8_jitless": "V8_JITLESS",
+        "v8_enable_vtunejit": "ENABLE_VTUNE_JIT_INTERFACE",
     },
     defines = [
         "GOOGLE3",
@@ -412,6 +430,14 @@ v8_config(
             "V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE",
         ],
         "//conditions:default": [],
+    }) + select({
+        ":is_v8_enable_shared_ro_heap": [
+            "V8_SHARED_RO_HEAP",
+        ],
+    }) + select({
+        ":is_v8_enable_extensible_ro_snapshot": [
+            "V8_ENABLE_EXTENSIBLE_RO_SNAPSHOT",
+        ],
     }) + select({
         ":is_v8_enable_short_builtin_calls": [
             "V8_SHORT_BUILTIN_CALLS",
@@ -449,6 +475,7 @@ filegroup(
     name = "v8_config_headers_files",
     srcs = [
         "include/v8-platform.h",
+        "include/v8-source-location.h",
         "include/v8config.h",
     ],
 )
@@ -481,8 +508,8 @@ filegroup(
         "include/cppgc/internal/api-constants.h",
         "include/cppgc/internal/atomic-entry-flag.h",
         "include/cppgc/internal/base-page-handle.h",
-        "include/cppgc/internal/caged-heap-local-data.h",
         "include/cppgc/internal/caged-heap.h",
+        "include/cppgc/internal/caged-heap-local-data.h",
         "include/cppgc/internal/compiler-specific.h",
         "include/cppgc/internal/finalizer-trait.h",
         "include/cppgc/internal/gc-info.h",
@@ -530,6 +557,7 @@ filegroup(
         "include/v8-forward.h",
         "include/v8-function.h",
         "include/v8-function-callback.h",
+        "include/v8-handle-base.h",
         "include/v8-initialization.h",
         "include/v8-internal.h",
         "include/v8-isolate.h",
@@ -594,18 +622,14 @@ filegroup(
 filegroup(
     name = "v8_libbase_files",
     srcs = [
-        ":v8_flags",
-        ":v8_config_headers_files",
-        ":v8_headers_files",
-        "src/base/vlq.h",
         "src/base/address-region.h",
         "src/base/atomic-utils.h",
         "src/base/atomicops.h",
         "src/base/base-export.h",
         "src/base/bit-field.h",
-        "src/base/bits-iterator.h",
         "src/base/bits.cc",
         "src/base/bits.h",
+        "src/base/bits-iterator.h",
         "src/base/bounded-page-allocator.cc",
         "src/base/bounded-page-allocator.h",
         "src/base/bounds.h",
@@ -617,6 +641,7 @@ filegroup(
         "src/base/cpu.h",
         "src/base/debug/stack_trace.cc",
         "src/base/debug/stack_trace.h",
+        "src/base/discriminated-union.h",
         "src/base/division-by-constant.cc",
         "src/base/division-by-constant.h",
         "src/base/emulated-virtual-address-subspace.cc",
@@ -628,21 +653,22 @@ filegroup(
         "src/base/flags.h",
         "src/base/free_deleter.h",
         "src/base/functional.h",
-        "src/base/hashmap-entry.h",
         "src/base/hashmap.h",
+        "src/base/hashmap-entry.h",
         "src/base/ieee754.cc",
         "src/base/ieee754.h",
         "src/base/immediate-crash.h",
+        "src/base/intrusive-set.h",
         "src/base/iterator.h",
         "src/base/lazy-instance.h",
         "src/base/logging.cc",
         "src/base/logging.h",
         "src/base/macros.h",
         "src/base/memory.h",
-        "src/base/numbers/bignum-dtoa.cc",
-        "src/base/numbers/bignum-dtoa.h",
         "src/base/numbers/bignum.cc",
         "src/base/numbers/bignum.h",
+        "src/base/numbers/bignum-dtoa.cc",
+        "src/base/numbers/bignum-dtoa.h",
         "src/base/numbers/cached-powers.cc",
         "src/base/numbers/cached-powers.h",
         "src/base/numbers/diy-fp.cc",
@@ -670,20 +696,22 @@ filegroup(
         "src/base/platform/memory-protection-key.h",
         "src/base/platform/mutex.cc",
         "src/base/platform/mutex.h",
-        "src/base/platform/platform.h",
         "src/base/platform/platform.cc",
+        "src/base/platform/platform.h",
         "src/base/platform/semaphore.cc",
         "src/base/platform/semaphore.h",
         "src/base/platform/time.cc",
         "src/base/platform/time.h",
-        "src/base/pointer-with-payload.h",
         "src/base/platform/wrappers.h",
+        "src/base/platform/yield-processor.h",
+        "src/base/pointer-with-payload.h",
         "src/base/region-allocator.cc",
         "src/base/region-allocator.h",
         "src/base/ring-buffer.h",
         "src/base/safe_conversions.h",
         "src/base/safe_conversions_arm_impl.h",
         "src/base/safe_conversions_impl.h",
+        "src/base/small-map.h",
         "src/base/small-vector.h",
         "src/base/string-format.h",
         "src/base/strings.cc",
@@ -691,19 +719,22 @@ filegroup(
         "src/base/sys-info.cc",
         "src/base/sys-info.h",
         "src/base/template-utils.h",
-        "src/base/timezone-cache.h",
         "src/base/threaded-list.h",
+        "src/base/timezone-cache.h",
         "src/base/utils/random-number-generator.cc",
         "src/base/utils/random-number-generator.h",
+        "src/base/v8-fallthrough.h",
         "src/base/vector.h",
-        "src/base/virtual-address-space-page-allocator.cc",
-        "src/base/virtual-address-space-page-allocator.h",
         "src/base/virtual-address-space.cc",
         "src/base/virtual-address-space.h",
-        "src/base/v8-fallthrough.h",
+        "src/base/virtual-address-space-page-allocator.cc",
+        "src/base/virtual-address-space-page-allocator.h",
+        "src/base/vlq.h",
         "src/base/vlq-base64.cc",
         "src/base/vlq-base64.h",
-        "src/base/platform/yield-processor.h",
+        ":v8_config_headers_files",
+        ":v8_flags",
+        ":v8_headers_files",
     ] + select({
         "@v8//bazel/config:is_posix": [
             "src/base/platform/platform-posix.cc",
@@ -721,15 +752,16 @@ filegroup(
         "@v8//bazel/config:is_android": [
             "src/base/debug/stack_trace_android.cc",
             "src/base/platform/platform-linux.cc",
+            "src/base/platform/platform-linux.h",
         ],
         "@v8//bazel/config:is_macos": [
             "src/base/debug/stack_trace_posix.cc",
             "src/base/platform/platform-darwin.cc",
         ],
         "@v8//bazel/config:is_windows": [
-            "src/base/win32-headers.h",
             "src/base/debug/stack_trace_win.cc",
             "src/base/platform/platform-win32.cc",
+            "src/base/win32-headers.h",
         ],
     }),
     visibility = ["//visibility:public"],
@@ -747,6 +779,8 @@ filegroup(
         "src/libplatform/default-job.h",
         "src/libplatform/default-platform.cc",
         "src/libplatform/default-platform.h",
+        "src/libplatform/default-thread-isolated-allocator.cc",
+        "src/libplatform/default-thread-isolated-allocator.h",
         "src/libplatform/default-worker-threads-task-runner.cc",
         "src/libplatform/default-worker-threads-task-runner.h",
         "src/libplatform/delayed-task-queue.cc",
@@ -783,6 +817,7 @@ filegroup(
     name = "noicu/torque_files",
     srcs = [
         "src/builtins/aggregate-error.tq",
+        "src/builtins/array.tq",
         "src/builtins/array-at.tq",
         "src/builtins/array-concat.tq",
         "src/builtins/array-copywithin.tq",
@@ -799,8 +834,8 @@ filegroup(
         "src/builtins/array-lastindexof.tq",
         "src/builtins/array-map.tq",
         "src/builtins/array-of.tq",
-        "src/builtins/array-reduce-right.tq",
         "src/builtins/array-reduce.tq",
+        "src/builtins/array-reduce-right.tq",
         "src/builtins/array-reverse.tq",
         "src/builtins/array-shift.tq",
         "src/builtins/array-slice.tq",
@@ -811,7 +846,6 @@ filegroup(
         "src/builtins/array-to-spliced.tq",
         "src/builtins/array-unshift.tq",
         "src/builtins/array-with.tq",
-        "src/builtins/array.tq",
         "src/builtins/arraybuffer.tq",
         "src/builtins/base.tq",
         "src/builtins/boolean.tq",
@@ -819,39 +853,43 @@ filegroup(
         "src/builtins/builtins-string.tq",
         "src/builtins/cast.tq",
         "src/builtins/collections.tq",
+        "src/builtins/console.tq",
         "src/builtins/constructor.tq",
         "src/builtins/conversion.tq",
         "src/builtins/convert.tq",
-        "src/builtins/console.tq",
         "src/builtins/data-view.tq",
         "src/builtins/finalization-registry.tq",
-        "src/builtins/frames.tq",
         "src/builtins/frame-arguments.tq",
+        "src/builtins/frames.tq",
         "src/builtins/function.tq",
         "src/builtins/growable-fixed-array.tq",
-        "src/builtins/ic-callable.tq",
         "src/builtins/ic.tq",
-        "src/builtins/internal-coverage.tq",
+        "src/builtins/ic-callable.tq",
         "src/builtins/internal.tq",
+        "src/builtins/internal-coverage.tq",
         "src/builtins/iterator.tq",
         "src/builtins/iterator-from.tq",
         "src/builtins/iterator-helpers.tq",
+        "src/builtins/map-groupby.tq",
         "src/builtins/math.tq",
         "src/builtins/number.tq",
-        "src/builtins/object-fromentries.tq",
         "src/builtins/object.tq",
+        "src/builtins/object-fromentries.tq",
+        "src/builtins/object-groupby.tq",
         "src/builtins/promise-abstract-operations.tq",
         "src/builtins/promise-all.tq",
         "src/builtins/promise-all-element-closure.tq",
         "src/builtins/promise-any.tq",
         "src/builtins/promise-constructor.tq",
         "src/builtins/promise-finally.tq",
+        "src/builtins/promise-jobs.tq",
         "src/builtins/promise-misc.tq",
         "src/builtins/promise-race.tq",
         "src/builtins/promise-reaction-job.tq",
         "src/builtins/promise-resolve.tq",
         "src/builtins/promise-then.tq",
-        "src/builtins/promise-jobs.tq",
+        "src/builtins/promise-withresolvers.tq",
+        "src/builtins/proxy.tq",
         "src/builtins/proxy-constructor.tq",
         "src/builtins/proxy-delete-property.tq",
         "src/builtins/proxy-get-property.tq",
@@ -863,17 +901,23 @@ filegroup(
         "src/builtins/proxy-revoke.tq",
         "src/builtins/proxy-set-property.tq",
         "src/builtins/proxy-set-prototype-of.tq",
-        "src/builtins/proxy.tq",
         "src/builtins/reflect.tq",
+        "src/builtins/regexp.tq",
         "src/builtins/regexp-exec.tq",
-        "src/builtins/regexp-match-all.tq",
         "src/builtins/regexp-match.tq",
+        "src/builtins/regexp-match-all.tq",
         "src/builtins/regexp-replace.tq",
         "src/builtins/regexp-search.tq",
         "src/builtins/regexp-source.tq",
         "src/builtins/regexp-split.tq",
         "src/builtins/regexp-test.tq",
-        "src/builtins/regexp.tq",
+        "src/builtins/set-difference.tq",
+        "src/builtins/set-intersection.tq",
+        "src/builtins/set-is-disjoint-from.tq",
+        "src/builtins/set-is-subset-of.tq",
+        "src/builtins/set-is-superset-of.tq",
+        "src/builtins/set-symmetric-difference.tq",
+        "src/builtins/set-union.tq",
         "src/builtins/string-at.tq",
         "src/builtins/string-endswith.tq",
         "src/builtins/string-html.tq",
@@ -893,10 +937,11 @@ filegroup(
         "src/builtins/string-trim.tq",
         "src/builtins/symbol.tq",
         "src/builtins/torque-internal.tq",
+        "src/builtins/typed-array.tq",
         "src/builtins/typed-array-at.tq",
         "src/builtins/typed-array-createtypedarray.tq",
-        "src/builtins/typed-array-every.tq",
         "src/builtins/typed-array-entries.tq",
+        "src/builtins/typed-array-every.tq",
         "src/builtins/typed-array-filter.tq",
         "src/builtins/typed-array-find.tq",
         "src/builtins/typed-array-findindex.tq",
@@ -917,16 +962,15 @@ filegroup(
         "src/builtins/typed-array-to-sorted.tq",
         "src/builtins/typed-array-values.tq",
         "src/builtins/typed-array-with.tq",
-        "src/builtins/typed-array.tq",
         "src/builtins/weak-ref.tq",
         "src/ic/handler-configuration.tq",
         "src/objects/allocation-site.tq",
         "src/objects/api-callbacks.tq",
         "src/objects/arguments.tq",
         "src/objects/bigint.tq",
+        "src/objects/bytecode-array.tq",
         "src/objects/call-site-info.tq",
         "src/objects/cell.tq",
-        "src/objects/code.tq",
         "src/objects/contexts.tq",
         "src/objects/data-handler.tq",
         "src/objects/debug-objects.tq",
@@ -939,11 +983,11 @@ filegroup(
         "src/objects/free-space.tq",
         "src/objects/heap-number.tq",
         "src/objects/heap-object.tq",
-        "src/objects/js-array-buffer.tq",
         "src/objects/js-array.tq",
+        "src/objects/js-array-buffer.tq",
         "src/objects/js-atomics-synchronization.tq",
-        "src/objects/js-collection-iterator.tq",
         "src/objects/js-collection.tq",
+        "src/objects/js-collection-iterator.tq",
         "src/objects/js-function.tq",
         "src/objects/js-generator.tq",
         "src/objects/js-iterator-helpers.tq",
@@ -951,8 +995,8 @@ filegroup(
         "src/objects/js-promise.tq",
         "src/objects/js-proxy.tq",
         "src/objects/js-raw-json.tq",
-        "src/objects/js-regexp-string-iterator.tq",
         "src/objects/js-regexp.tq",
+        "src/objects/js-regexp-string-iterator.tq",
         "src/objects/js-shadow-realm.tq",
         "src/objects/js-shared-array.tq",
         "src/objects/js-struct.tq",
@@ -965,6 +1009,7 @@ filegroup(
         "src/objects/module.tq",
         "src/objects/name.tq",
         "src/objects/oddball.tq",
+        "src/objects/hole.tq",
         "src/objects/ordered-hash-table.tq",
         "src/objects/primitive-heap-object.tq",
         "src/objects/promise.tq",
@@ -991,7 +1036,10 @@ filegroup(
         "third_party/v8/builtins/array-sort.tq",
     ] + select({
         ":is_v8_enable_webassembly": [
+            "src/builtins/js-to-wasm.tq",
             "src/builtins/wasm.tq",
+            "src/builtins/wasm-strings.tq",
+            "src/builtins/wasm-to-js.tq",
             "src/debug/debug-wasm-objects.tq",
             "src/wasm/wasm-objects.tq",
         ],
@@ -1023,8 +1071,8 @@ filegroup(
 filegroup(
     name = "torque_base_files",
     srcs = [
-        "src/numbers/integer-literal-inl.h",
         "src/numbers/integer-literal.h",
+        "src/numbers/integer-literal-inl.h",
         "src/torque/ast.h",
         "src/torque/cc-generator.cc",
         "src/torque/cc-generator.h",
@@ -1089,34 +1137,31 @@ selects.config_setting_group(
 filegroup(
     name = "v8_base_without_compiler_files",
     srcs = [
-        ":cppgc_base_files",
-        ":v8_heap_base_files",
-        ":v8_bigint",
-        ":generated_bytecode_builtins_list",
         "include/cppgc/common.h",
-        "include/v8-inspector-protocol.h",
         "include/v8-inspector.h",
+        "include/v8-inspector-protocol.h",
         "include/v8-metrics.h",
         "include/v8-unwinder-state.h",
         "include/v8-wasm-trap-handler-posix.h",
-        "src/api/api-arguments-inl.h",
+        "src/api/api.cc",
+        "src/api/api.h",
         "src/api/api-arguments.cc",
         "src/api/api-arguments.h",
+        "src/api/api-arguments-inl.h",
         "src/api/api-inl.h",
         "src/api/api-macros.h",
         "src/api/api-macros-undef.h",
         "src/api/api-natives.cc",
         "src/api/api-natives.h",
-        "src/api/api.cc",
-        "src/api/api.h",
+        "src/asmjs/asm-js.h",
+        "src/ast/ast.cc",
+        "src/ast/ast.h",
         "src/ast/ast-function-literal-id-reindexer.cc",
         "src/ast/ast-function-literal-id-reindexer.h",
         "src/ast/ast-source-ranges.h",
         "src/ast/ast-traversal-visitor.h",
         "src/ast/ast-value-factory.cc",
         "src/ast/ast-value-factory.h",
-        "src/ast/ast.cc",
-        "src/ast/ast.h",
         "src/ast/modules.cc",
         "src/ast/modules.h",
         "src/ast/prettyprinter.cc",
@@ -1127,18 +1172,27 @@ filegroup(
         "src/ast/source-range-ast-visitor.h",
         "src/ast/variables.cc",
         "src/ast/variables.h",
-        "src/baseline/baseline-assembler-inl.h",
-        "src/baseline/baseline-assembler.h",
-        "src/baseline/baseline-compiler.cc",
-        "src/baseline/baseline-compiler.h",
+        "src/base/sanitizer/asan.h",
+        "src/base/sanitizer/lsan-page-allocator.cc",
+        "src/base/sanitizer/lsan-page-allocator.h",
+        "src/base/sanitizer/lsan-virtual-address-space.cc",
+        "src/base/sanitizer/lsan-virtual-address-space.h",
+        "src/base/sanitizer/msan.h",
+        "src/base/sanitizer/tsan.h",
         "src/baseline/baseline.cc",
         "src/baseline/baseline.h",
-        "src/baseline/baseline-batch-compiler.h",
+        "src/baseline/baseline-assembler.h",
+        "src/baseline/baseline-assembler-inl.h",
         "src/baseline/baseline-batch-compiler.cc",
-        "src/baseline/bytecode-offset-iterator.h",
+        "src/baseline/baseline-batch-compiler.h",
+        "src/baseline/baseline-compiler.cc",
+        "src/baseline/baseline-compiler.h",
         "src/baseline/bytecode-offset-iterator.cc",
+        "src/baseline/bytecode-offset-iterator.h",
         "src/builtins/accessors.cc",
         "src/builtins/accessors.h",
+        "src/builtins/builtins.cc",
+        "src/builtins/builtins.h",
         "src/builtins/builtins-api.cc",
         "src/builtins/builtins-array.cc",
         "src/builtins/builtins-arraybuffer.cc",
@@ -1164,28 +1218,26 @@ filegroup(
         "src/builtins/builtins-reflect.cc",
         "src/builtins/builtins-regexp.cc",
         "src/builtins/builtins-shadow-realm.cc",
-        "src/builtins/builtins-sharedarraybuffer.cc",
         "src/builtins/builtins-shared-array.cc",
+        "src/builtins/builtins-sharedarraybuffer.cc",
         "src/builtins/builtins-string.cc",
         "src/builtins/builtins-struct.cc",
         "src/builtins/builtins-symbol.cc",
         "src/builtins/builtins-temporal.cc",
         "src/builtins/builtins-trace.cc",
         "src/builtins/builtins-typed-array.cc",
-        "src/builtins/builtins-utils-inl.h",
         "src/builtins/builtins-utils.h",
+        "src/builtins/builtins-utils-inl.h",
         "src/builtins/builtins-weak-refs.cc",
-        "src/builtins/builtins.cc",
-        "src/builtins/builtins.h",
         "src/builtins/constants-table-builder.cc",
         "src/builtins/constants-table-builder.h",
         "src/builtins/profile-data-reader.h",
-        "src/codegen/aligned-slot-allocator.h",
         "src/codegen/aligned-slot-allocator.cc",
-        "src/codegen/assembler-arch.h",
-        "src/codegen/assembler-inl.h",
+        "src/codegen/aligned-slot-allocator.h",
         "src/codegen/assembler.cc",
         "src/codegen/assembler.h",
+        "src/codegen/assembler-arch.h",
+        "src/codegen/assembler-inl.h",
         "src/codegen/atomic-memory-order.h",
         "src/codegen/background-merge-task.h",
         "src/codegen/bailout-reason.cc",
@@ -1207,68 +1259,70 @@ filegroup(
         "src/codegen/constant-pool.h",
         "src/codegen/constants-arch.h",
         "src/codegen/cpu-features.h",
+        "src/codegen/external-reference.cc",
+        "src/codegen/external-reference.h",
         "src/codegen/external-reference-encoder.cc",
         "src/codegen/external-reference-encoder.h",
         "src/codegen/external-reference-table.cc",
         "src/codegen/external-reference-table.h",
-        "src/codegen/external-reference.cc",
-        "src/codegen/external-reference.h",
         "src/codegen/flush-instruction-cache.cc",
         "src/codegen/flush-instruction-cache.h",
         "src/codegen/handler-table.cc",
         "src/codegen/handler-table.h",
         "src/codegen/interface-descriptors.cc",
-        "src/codegen/interface-descriptors-inl.h",
         "src/codegen/interface-descriptors.h",
+        "src/codegen/interface-descriptors-inl.h",
         "src/codegen/label.h",
+        "src/codegen/linkage-location.h",
         "src/codegen/machine-type.cc",
         "src/codegen/machine-type.h",
-        "src/codegen/macro-assembler-inl.h",
         "src/codegen/macro-assembler.h",
+        "src/codegen/macro-assembler-base.cc",
+        "src/codegen/macro-assembler-base.h",
+        "src/codegen/macro-assembler-inl.h",
         "src/codegen/maglev-safepoint-table.cc",
         "src/codegen/maglev-safepoint-table.h",
         "src/codegen/optimized-compilation-info.cc",
         "src/codegen/optimized-compilation-info.h",
         "src/codegen/pending-optimization-table.cc",
         "src/codegen/pending-optimization-table.h",
+        "src/codegen/register.h",
         "src/codegen/register-arch.h",
         "src/codegen/register-base.h",
         "src/codegen/register-configuration.cc",
         "src/codegen/register-configuration.h",
-        "src/codegen/register.h",
-        "src/codegen/reglist-base.h",
         "src/codegen/reglist.h",
+        "src/codegen/reglist-base.h",
         "src/codegen/reloc-info.cc",
         "src/codegen/reloc-info.h",
-        "src/codegen/safepoint-table-base.h",
+        "src/codegen/reloc-info-inl.h",
         "src/codegen/safepoint-table.cc",
         "src/codegen/safepoint-table.h",
+        "src/codegen/safepoint-table-base.h",
         "src/codegen/script-details.h",
         "src/codegen/signature.h",
-        "src/codegen/source-position-table.cc",
-        "src/codegen/source-position-table.h",
         "src/codegen/source-position.cc",
         "src/codegen/source-position.h",
+        "src/codegen/source-position-table.cc",
+        "src/codegen/source-position-table.h",
         "src/codegen/tick-counter.cc",
         "src/codegen/tick-counter.h",
         "src/codegen/tnode.cc",
         "src/codegen/tnode.h",
-        "src/codegen/macro-assembler-base.cc",
-        "src/codegen/macro-assembler-base.h",
         "src/codegen/unoptimized-compilation-info.cc",
         "src/codegen/unoptimized-compilation-info.h",
         "src/common/assert-scope.cc",
         "src/common/assert-scope.h",
         "src/common/checks.h",
-        "src/common/code-memory-access-inl.h",
         "src/common/code-memory-access.cc",
         "src/common/code-memory-access.h",
+        "src/common/code-memory-access-inl.h",
         "src/common/high-allocation-throughput-scope.h",
         "src/common/message-template.h",
         "src/common/operation.h",
-        "src/common/ptr-compr-inl.h",
         "src/common/ptr-compr.cc",
         "src/common/ptr-compr.h",
+        "src/common/ptr-compr-inl.h",
         "src/compiler-dispatcher/lazy-compile-dispatcher.cc",
         "src/compiler-dispatcher/lazy-compile-dispatcher.h",
         "src/compiler-dispatcher/optimizing-compile-dispatcher.cc",
@@ -1276,9 +1330,11 @@ filegroup(
         "src/compiler/turbofan.h",
         "src/date/date.cc",
         "src/date/date.h",
-        "src/date/dateparser-inl.h",
         "src/date/dateparser.cc",
         "src/date/dateparser.h",
+        "src/date/dateparser-inl.h",
+        "src/debug/debug.cc",
+        "src/debug/debug.h",
         "src/debug/debug-coverage.cc",
         "src/debug/debug-coverage.h",
         "src/debug/debug-evaluate.cc",
@@ -1295,13 +1351,11 @@ filegroup(
         "src/debug/debug-scopes.h",
         "src/debug/debug-stack-trace-iterator.cc",
         "src/debug/debug-stack-trace-iterator.h",
-        "src/debug/debug.cc",
-        "src/debug/debug.h",
         "src/debug/interface-types.h",
-        "src/debug/liveedit-diff.cc",
-        "src/debug/liveedit-diff.h",
         "src/debug/liveedit.cc",
         "src/debug/liveedit.h",
+        "src/debug/liveedit-diff.cc",
+        "src/debug/liveedit-diff.h",
         "src/deoptimizer/deoptimize-reason.cc",
         "src/deoptimizer/deoptimize-reason.h",
         "src/deoptimizer/deoptimized-frame-info.cc",
@@ -1309,12 +1363,12 @@ filegroup(
         "src/deoptimizer/deoptimizer.cc",
         "src/deoptimizer/deoptimizer.h",
         "src/deoptimizer/frame-description.h",
+        "src/deoptimizer/frame-translation-builder.cc",
+        "src/deoptimizer/frame-translation-builder.h",
         "src/deoptimizer/materialized-object-store.cc",
         "src/deoptimizer/materialized-object-store.h",
         "src/deoptimizer/translated-state.cc",
         "src/deoptimizer/translated-state.h",
-        "src/deoptimizer/translation-array.cc",
-        "src/deoptimizer/translation-array.h",
         "src/deoptimizer/translation-opcode.h",
         "src/diagnostics/basic-block-profiler.cc",
         "src/diagnostics/basic-block-profiler.h",
@@ -1334,48 +1388,47 @@ filegroup(
         "src/diagnostics/perf-jit.h",
         "src/diagnostics/unwinder.cc",
         "src/diagnostics/unwinder.h",
-        "src/execution/arguments-inl.h",
         "src/execution/arguments.cc",
         "src/execution/arguments.h",
+        "src/execution/arguments-inl.h",
         "src/execution/clobber-registers.cc",
         "src/execution/clobber-registers.h",
+        "src/execution/embedder-state.cc",
+        "src/execution/embedder-state.h",
         "src/execution/encoded-c-signature.cc",
         "src/execution/encoded-c-signature.h",
-        "src/execution/embedder-state.h",
-        "src/execution/embedder-state.cc",
         "src/execution/execution.cc",
         "src/execution/execution.h",
         "src/execution/frame-constants.h",
-        "src/execution/frames-inl.h",
         "src/execution/frames.cc",
         "src/execution/frames.h",
+        "src/execution/frames-inl.h",
         "src/execution/futex-emulation.cc",
         "src/execution/futex-emulation.h",
         "src/execution/interrupts-scope.cc",
         "src/execution/interrupts-scope.h",
+        "src/execution/isolate.cc",
+        "src/execution/isolate.h",
         "src/execution/isolate-data.h",
         "src/execution/isolate-inl.h",
         "src/execution/isolate-utils.h",
         "src/execution/isolate-utils-inl.h",
-        "src/snapshot/embedded/platform-embedded-file-writer-base.h",
-        "src/snapshot/embedded/embedded-file-writer.h",
-        "src/execution/isolate.cc",
-        "src/execution/isolate.h",
-        "src/execution/local-isolate-inl.h",
         "src/execution/local-isolate.cc",
         "src/execution/local-isolate.h",
+        "src/execution/local-isolate-inl.h",
         "src/execution/messages.cc",
         "src/execution/messages.h",
         "src/execution/microtask-queue.cc",
         "src/execution/microtask-queue.h",
         "src/execution/pointer-authentication.h",
-        "src/execution/protectors-inl.h",
+        "src/execution/pointer-authentication-dummy.h",
         "src/execution/protectors.cc",
         "src/execution/protectors.h",
+        "src/execution/protectors-inl.h",
         "src/execution/shared-mutex-guard-if-off-thread.h",
+        "src/execution/simulator.h",
         "src/execution/simulator-base.cc",
         "src/execution/simulator-base.h",
-        "src/execution/simulator.h",
         "src/execution/stack-guard.cc",
         "src/execution/stack-guard.h",
         "src/execution/thread-id.cc",
@@ -1386,8 +1439,8 @@ filegroup(
         "src/execution/tiering-manager.h",
         "src/execution/v8threads.cc",
         "src/execution/v8threads.h",
-        "src/execution/vm-state-inl.h",
         "src/execution/vm-state.h",
+        "src/execution/vm-state-inl.h",
         "src/extensions/cputracemark-extension.cc",
         "src/extensions/cputracemark-extension.h",
         "src/extensions/externalize-string-extension.cc",
@@ -1403,48 +1456,45 @@ filegroup(
         "src/flags/flag-definitions.h",
         "src/flags/flags.cc",
         "src/flags/flags.h",
-        "src/handles/global-handles-inl.h",
         "src/handles/global-handles.cc",
         "src/handles/global-handles.h",
-        "src/handles/traced-handles.cc",
-        "src/handles/traced-handles.h",
-        "src/handles/handles-inl.h",
+        "src/handles/global-handles-inl.h",
         "src/handles/handles.cc",
         "src/handles/handles.h",
-        "src/handles/local-handles-inl.h",
+        "src/handles/handles-inl.h",
         "src/handles/local-handles.cc",
         "src/handles/local-handles.h",
-        "src/handles/maybe-handles-inl.h",
+        "src/handles/local-handles-inl.h",
         "src/handles/maybe-handles.h",
+        "src/handles/maybe-handles-inl.h",
         "src/handles/persistent-handles.cc",
         "src/handles/persistent-handles.h",
         "src/handles/shared-object-conveyor-handles.cc",
         "src/handles/shared-object-conveyor-handles.h",
-        "src/heap/base/active-system-pages.cc",
-        "src/heap/base/active-system-pages.h",
+        "src/handles/traced-handles.cc",
+        "src/handles/traced-handles.h",
         "src/heap/allocation-observer.cc",
         "src/heap/allocation-observer.h",
         "src/heap/allocation-result.h",
         "src/heap/allocation-stats.h",
         "src/heap/array-buffer-sweeper.cc",
         "src/heap/array-buffer-sweeper.h",
-        "src/heap/base-space.cc",
         "src/heap/base-space.h",
+        "src/heap/base/active-system-pages.cc",
+        "src/heap/base/active-system-pages.h",
         "src/heap/basic-memory-chunk.cc",
         "src/heap/basic-memory-chunk.h",
-        "src/heap/code-object-registry.cc",
-        "src/heap/code-object-registry.h",
-        "src/heap/code-range.h",
         "src/heap/code-range.cc",
+        "src/heap/code-range.h",
         "src/heap/code-stats.cc",
         "src/heap/code-stats.h",
         "src/heap/collection-barrier.cc",
         "src/heap/collection-barrier.h",
         "src/heap/combined-heap.cc",
         "src/heap/combined-heap.h",
-        "src/heap/concurrent-allocator-inl.h",
         "src/heap/concurrent-allocator.cc",
         "src/heap/concurrent-allocator.h",
+        "src/heap/concurrent-allocator-inl.h",
         "src/heap/concurrent-marking.cc",
         "src/heap/concurrent-marking.h",
         "src/heap/cppgc-js/cpp-heap.cc",
@@ -1464,29 +1514,35 @@ filegroup(
         "src/heap/cppgc-js/unified-heap-marking-visitor.h",
         "src/heap/cppgc-js/wrappable-info.h",
         "src/heap/cppgc-js/wrappable-info-inl.h",
+        "src/heap/ephemeron-remembered-set.h",
+        "src/heap/ephemeron-remembered-set.cc",
+        "src/heap/evacuation-allocator.h",
+        "src/heap/evacuation-allocator-inl.h",
         "src/heap/evacuation-verifier.cc",
         "src/heap/evacuation-verifier.h",
         "src/heap/evacuation-verifier-inl.h",
+        "src/heap/factory.cc",
+        "src/heap/factory.h",
         "src/heap/factory-base.cc",
         "src/heap/factory-base.h",
         "src/heap/factory-base-inl.h",
         "src/heap/factory-inl.h",
-        "src/heap/factory.cc",
-        "src/heap/factory.h",
         "src/heap/finalization-registry-cleanup-task.cc",
         "src/heap/finalization-registry-cleanup-task.h",
-        "src/heap/free-list-inl.h",
         "src/heap/free-list.cc",
         "src/heap/free-list.h",
+        "src/heap/free-list-inl.h",
         "src/heap/gc-callbacks.h",
         "src/heap/gc-idle-time-handler.cc",
         "src/heap/gc-idle-time-handler.h",
         "src/heap/gc-tracer.cc",
-        "src/heap/gc-tracer-inl.h",
         "src/heap/gc-tracer.h",
-        "src/heap/heap-allocator-inl.h",
+        "src/heap/gc-tracer-inl.h",
+        "src/heap/heap.cc",
+        "src/heap/heap.h",
         "src/heap/heap-allocator.cc",
         "src/heap/heap-allocator.h",
+        "src/heap/heap-allocator-inl.h",
         "src/heap/heap-controller.cc",
         "src/heap/heap-controller.h",
         "src/heap/heap-inl.h",
@@ -1494,115 +1550,130 @@ filegroup(
         "src/heap/heap-layout-tracer.h",
         "src/heap/heap-verifier.cc",
         "src/heap/heap-verifier.h",
-        "src/heap/heap-write-barrier-inl.h",
         "src/heap/heap-write-barrier.cc",
         "src/heap/heap-write-barrier.h",
-        "src/heap/heap.cc",
-        "src/heap/heap.h",
+        "src/heap/heap-write-barrier-inl.h",
+        "src/heap/incremental-marking.cc",
+        "src/heap/incremental-marking.h",
         "src/heap/incremental-marking-inl.h",
         "src/heap/incremental-marking-job.cc",
         "src/heap/incremental-marking-job.h",
-        "src/heap/incremental-marking.cc",
-        "src/heap/incremental-marking.h",
         "src/heap/index-generator.cc",
         "src/heap/index-generator.h",
-        "src/heap/invalidated-slots-inl.h",
-        "src/heap/invalidated-slots.cc",
-        "src/heap/invalidated-slots.h",
+        "src/heap/large-page.cc",
+        "src/heap/large-page.h",
         "src/heap/large-spaces.cc",
         "src/heap/large-spaces.h",
         "src/heap/linear-allocation-area.h",
         "src/heap/list.h",
-        "src/heap/evacuation-allocator-inl.h",
-        "src/heap/evacuation-allocator.h",
         "src/heap/local-factory.cc",
         "src/heap/local-factory.h",
         "src/heap/local-factory-inl.h",
-        "src/heap/local-heap-inl.h",
         "src/heap/local-heap.cc",
         "src/heap/local-heap.h",
-        "src/heap/mark-compact-inl.h",
+        "src/heap/local-heap-inl.h",
         "src/heap/mark-compact.cc",
         "src/heap/mark-compact.h",
+        "src/heap/mark-compact-inl.h",
+        "src/heap/mark-sweep-utilities.cc",
+        "src/heap/mark-sweep-utilities.h",
+        "src/heap/minor-mark-sweep.cc",
+        "src/heap/minor-mark-sweep.h",
+        "src/heap/minor-mark-sweep-inl.h",
+        "src/heap/marking.cc",
+        "src/heap/marking.h",
+        "src/heap/marking-inl.h",
         "src/heap/marking-barrier.cc",
         "src/heap/marking-barrier.h",
         "src/heap/marking-barrier-inl.h",
         "src/heap/marking-state.h",
         "src/heap/marking-state-inl.h",
-        "src/heap/marking-visitor-inl.h",
         "src/heap/marking-visitor.h",
-        "src/heap/marking-worklist-inl.h",
+        "src/heap/marking-visitor-inl.h",
         "src/heap/marking-worklist.cc",
         "src/heap/marking-worklist.h",
-        "src/heap/marking.cc",
-        "src/heap/marking.h",
+        "src/heap/marking-worklist-inl.h",
         "src/heap/memory-allocator.cc",
         "src/heap/memory-allocator.h",
+        "src/heap/memory-balancer.cc",
+        "src/heap/memory-balancer.h",
+        "src/heap/memory-chunk.cc",
+        "src/heap/memory-chunk.h",
         "src/heap/memory-chunk-inl.h",
         "src/heap/memory-chunk-layout.cc",
         "src/heap/memory-chunk-layout.h",
-        "src/heap/memory-chunk.cc",
-        "src/heap/memory-chunk.h",
-        "src/heap/memory-measurement-inl.h",
         "src/heap/memory-measurement.cc",
         "src/heap/memory-measurement.h",
+        "src/heap/memory-measurement-inl.h",
         "src/heap/memory-reducer.cc",
         "src/heap/memory-reducer.h",
-        "src/heap/new-spaces-inl.h",
+        "src/heap/minor-gc-job.cc",
+        "src/heap/minor-gc-job.h",
         "src/heap/new-spaces.cc",
         "src/heap/new-spaces.h",
+        "src/heap/new-spaces-inl.h",
         "src/heap/object-lock.h",
         "src/heap/object-stats.cc",
         "src/heap/object-stats.h",
-        "src/heap/objects-visiting-inl.h",
         "src/heap/objects-visiting.cc",
         "src/heap/objects-visiting.h",
-        "src/heap/paged-spaces-inl.h",
+        "src/heap/objects-visiting-inl.h",
+        "src/heap/page.cc",
+        "src/heap/page.h",
+        "src/heap/page-inl.h",
         "src/heap/paged-spaces.cc",
         "src/heap/paged-spaces.h",
+        "src/heap/paged-spaces-inl.h",
         "src/heap/parallel-work-item.h",
+        "src/heap/parked-scope-inl.h",
         "src/heap/parked-scope.h",
-        "src/heap/pretenuring-handler-inl.h",
         "src/heap/pretenuring-handler.cc",
         "src/heap/pretenuring-handler.h",
+        "src/heap/pretenuring-handler-inl.h",
         "src/heap/progress-bar.h",
-        "src/heap/read-only-heap-inl.h",
         "src/heap/read-only-heap.cc",
         "src/heap/read-only-heap.h",
+        "src/heap/read-only-heap-inl.h",
+        "src/heap/read-only-promotion.cc",
+        "src/heap/read-only-promotion.h",
         "src/heap/read-only-spaces.cc",
         "src/heap/read-only-spaces.h",
-        "src/heap/remembered-set-inl.h",
         "src/heap/remembered-set.h",
+        "src/heap/remembered-set-inl.h",
         "src/heap/safepoint.cc",
         "src/heap/safepoint.h",
-        "src/heap/minor-gc-job.cc",
-        "src/heap/minor-gc-job.h",
-        "src/heap/scavenger-inl.h",
         "src/heap/scavenger.cc",
         "src/heap/scavenger.h",
+        "src/heap/scavenger-inl.h",
         "src/heap/slot-set.cc",
         "src/heap/slot-set.h",
-        "src/heap/spaces-inl.h",
         "src/heap/spaces.cc",
         "src/heap/spaces.h",
+        "src/heap/spaces-inl.h",
         "src/heap/stress-scavenge-observer.cc",
         "src/heap/stress-scavenge-observer.h",
         "src/heap/sweeper.cc",
         "src/heap/sweeper.h",
+        "src/heap/third-party/heap-api.h",
+        "src/heap/third-party/heap-api-stub.cc",
         "src/heap/traced-handles-marking-visitor.cc",
         "src/heap/traced-handles-marking-visitor.h",
         "src/heap/weak-object-worklists.cc",
         "src/heap/weak-object-worklists.h",
+        "src/heap/young-generation-marking-visitor.h",
+        "src/heap/young-generation-marking-visitor-inl.h",
+        "src/heap/zapping.cc",
+        "src/heap/zapping.h",
         "src/ic/call-optimization.cc",
         "src/ic/call-optimization.h",
-        "src/ic/handler-configuration-inl.h",
         "src/ic/handler-configuration.cc",
         "src/ic/handler-configuration.h",
+        "src/ic/handler-configuration-inl.h",
+        "src/ic/ic.cc",
+        "src/ic/ic.h",
         "src/ic/ic-inl.h",
         "src/ic/ic-stats.cc",
         "src/ic/ic-stats.h",
-        "src/ic/ic.cc",
-        "src/ic/ic.h",
         "src/ic/stub-cache.cc",
         "src/ic/stub-cache.h",
         "src/init/bootstrapper.cc",
@@ -1639,11 +1710,11 @@ filegroup(
         "src/interpreter/bytecode-node.h",
         "src/interpreter/bytecode-operands.cc",
         "src/interpreter/bytecode-operands.h",
+        "src/interpreter/bytecode-register.cc",
+        "src/interpreter/bytecode-register.h",
         "src/interpreter/bytecode-register-allocator.h",
         "src/interpreter/bytecode-register-optimizer.cc",
         "src/interpreter/bytecode-register-optimizer.h",
-        "src/interpreter/bytecode-register.cc",
-        "src/interpreter/bytecode-register.h",
         "src/interpreter/bytecode-source-info.cc",
         "src/interpreter/bytecode-source-info.h",
         "src/interpreter/bytecode-traits.h",
@@ -1655,152 +1726,169 @@ filegroup(
         "src/interpreter/control-flow-builders.h",
         "src/interpreter/handler-table-builder.cc",
         "src/interpreter/handler-table-builder.h",
+        "src/interpreter/interpreter.cc",
+        "src/interpreter/interpreter.h",
         "src/interpreter/interpreter-generator.h",
         "src/interpreter/interpreter-intrinsics.cc",
         "src/interpreter/interpreter-intrinsics.h",
-        "src/interpreter/interpreter.cc",
-        "src/interpreter/interpreter.h",
         "src/json/json-parser.cc",
         "src/json/json-parser.h",
         "src/json/json-stringifier.cc",
         "src/json/json-stringifier.h",
         "src/logging/code-events.h",
-        "src/logging/counters-definitions.h",
         "src/logging/counters.cc",
         "src/logging/counters.h",
+        "src/logging/counters-definitions.h",
         "src/logging/counters-scopes.h",
         "src/logging/local-logger.cc",
         "src/logging/local-logger.h",
-        "src/logging/log-inl.h",
-        "src/logging/log-file.cc",
-        "src/logging/log-file.h",
         "src/logging/log.cc",
         "src/logging/log.h",
+        "src/logging/log-file.cc",
+        "src/logging/log-file.h",
+        "src/logging/log-inl.h",
         "src/logging/metrics.cc",
         "src/logging/metrics.h",
-        "src/logging/tracing-flags.cc",
-        "src/logging/tracing-flags.h",
         "src/logging/runtime-call-stats.h",
         "src/logging/runtime-call-stats-scope.h",
-        "src/numbers/conversions-inl.h",
+        "src/logging/tracing-flags.cc",
+        "src/logging/tracing-flags.h",
         "src/numbers/conversions.cc",
         "src/numbers/conversions.h",
+        "src/numbers/conversions-inl.h",
         "src/numbers/hash-seed-inl.h",
-        "src/numbers/integer-literal-inl.h",
         "src/numbers/integer-literal.h",
+        "src/numbers/integer-literal-inl.h",
         "src/numbers/math-random.cc",
         "src/numbers/math-random.h",
+        "src/objects/abstract-code.cc",
+        "src/objects/abstract-code.h",
+        "src/objects/abstract-code-inl.h",
         "src/objects/all-objects-inl.h",
+        "src/objects/allocation-site.h",
         "src/objects/allocation-site-inl.h",
-        "src/objects/allocation-site-scopes-inl.h",
         "src/objects/allocation-site-scopes.h",
-        "src/objects/allocation-site.h",
-        "src/objects/api-callbacks-inl.h",
+        "src/objects/allocation-site-scopes-inl.h",
         "src/objects/api-callbacks.h",
-        "src/objects/arguments-inl.h",
+        "src/objects/api-callbacks-inl.h",
         "src/objects/arguments.h",
+        "src/objects/arguments-inl.h",
         "src/objects/backing-store.cc",
         "src/objects/backing-store.h",
-        "src/objects/bigint-inl.h",
         "src/objects/bigint.cc",
         "src/objects/bigint.h",
-        "src/objects/call-site-info-inl.h",
+        "src/objects/bigint-inl.h",
+        "src/objects/bytecode-array.cc",
+        "src/objects/bytecode-array.h",
+        "src/objects/bytecode-array-inl.h",
         "src/objects/call-site-info.cc",
         "src/objects/call-site-info.h",
-        "src/objects/cell-inl.h",
+        "src/objects/call-site-info-inl.h",
         "src/objects/cell.h",
+        "src/objects/cell-inl.h",
+        "src/objects/code.cc",
+        "src/objects/code.h",
         "src/objects/code-inl.h",
         "src/objects/code-kind.cc",
         "src/objects/code-kind.h",
-        "src/objects/code.cc",
-        "src/objects/code.h",
-        "src/objects/compilation-cache-table-inl.h",
         "src/objects/compilation-cache-table.cc",
         "src/objects/compilation-cache-table.h",
-        "src/objects/compressed-slots-inl.h",
+        "src/objects/compilation-cache-table-inl.h",
         "src/objects/compressed-slots.h",
-        "src/objects/contexts-inl.h",
+        "src/objects/compressed-slots-inl.h",
         "src/objects/contexts.cc",
         "src/objects/contexts.h",
-        "src/objects/data-handler-inl.h",
+        "src/objects/contexts-inl.h",
         "src/objects/data-handler.h",
-        "src/objects/debug-objects-inl.h",
+        "src/objects/data-handler-inl.h",
         "src/objects/debug-objects.cc",
         "src/objects/debug-objects.h",
-        "src/objects/descriptor-array-inl.h",
+        "src/objects/debug-objects-inl.h",
+        "src/objects/deoptimization-data.cc",
+        "src/objects/deoptimization-data.h",
+        "src/objects/deoptimization-data-inl.h",
+        "src/objects/dependent-code.cc",
+        "src/objects/dependent-code.h",
+        "src/objects/dependent-code-inl.h",
         "src/objects/descriptor-array.h",
-        "src/objects/dictionary-inl.h",
+        "src/objects/descriptor-array-inl.h",
         "src/objects/dictionary.h",
+        "src/objects/dictionary-inl.h",
+        "src/objects/elements.cc",
+        "src/objects/elements.h",
         "src/objects/elements-inl.h",
         "src/objects/elements-kind.cc",
         "src/objects/elements-kind.h",
-        "src/objects/elements.cc",
-        "src/objects/elements.h",
-        "src/objects/embedder-data-array-inl.h",
         "src/objects/embedder-data-array.cc",
         "src/objects/embedder-data-array.h",
-        "src/objects/embedder-data-slot-inl.h",
+        "src/objects/embedder-data-array-inl.h",
         "src/objects/embedder-data-slot.h",
-        "src/objects/feedback-cell-inl.h",
+        "src/objects/embedder-data-slot-inl.h",
         "src/objects/feedback-cell.h",
-        "src/objects/feedback-vector-inl.h",
+        "src/objects/feedback-cell-inl.h",
         "src/objects/feedback-vector.cc",
         "src/objects/feedback-vector.h",
-        "src/objects/field-index-inl.h",
+        "src/objects/feedback-vector-inl.h",
         "src/objects/field-index.h",
+        "src/objects/field-index-inl.h",
         "src/objects/field-type.cc",
         "src/objects/field-type.h",
-        "src/objects/fixed-array-inl.h",
+        "src/objects/fixed-array.cc",
         "src/objects/fixed-array.h",
-        "src/objects/foreign-inl.h",
+        "src/objects/fixed-array-inl.h",
         "src/objects/foreign.h",
-        "src/objects/free-space-inl.h",
+        "src/objects/foreign-inl.h",
         "src/objects/free-space.h",
+        "src/objects/free-space-inl.h",
         "src/objects/function-kind.h",
         "src/objects/function-syntax-kind.h",
-        "src/objects/hash-table-inl.h",
         "src/objects/hash-table.h",
-        "src/objects/heap-number-inl.h",
+        "src/objects/hash-table-inl.h",
         "src/objects/heap-number.h",
-        "src/objects/heap-object-inl.h",
+        "src/objects/heap-number-inl.h",
         "src/objects/heap-object.h",
-        "src/objects/instance-type-inl.h",
+        "src/objects/heap-object-inl.h",
         "src/objects/instance-type.h",
+        "src/objects/instance-type-checker.h",
+        "src/objects/instance-type-inl.h",
         "src/objects/internal-index.h",
-        "src/objects/js-array-buffer-inl.h",
+        "src/objects/instruction-stream.cc",
+        "src/objects/instruction-stream.h",
+        "src/objects/instruction-stream-inl.h",
+        "src/objects/js-array.h",
         "src/objects/js-array-buffer.cc",
         "src/objects/js-array-buffer.h",
+        "src/objects/js-array-buffer-inl.h",
         "src/objects/js-array-inl.h",
-        "src/objects/js-array.h",
-        "src/objects/js-atomics-synchronization-inl.h",
-        "src/objects/js-atomics-synchronization.h",
         "src/objects/js-atomics-synchronization.cc",
+        "src/objects/js-atomics-synchronization.h",
+        "src/objects/js-atomics-synchronization-inl.h",
+        "src/objects/js-collection.h",
         "src/objects/js-collection-inl.h",
         "src/objects/js-collection-iterator.h",
         "src/objects/js-collection-iterator-inl.h",
-        "src/objects/js-collection.h",
-        "src/objects/js-function-inl.h",
         "src/objects/js-function.cc",
         "src/objects/js-function.h",
-        "src/objects/js-generator-inl.h",
+        "src/objects/js-function-inl.h",
         "src/objects/js-generator.h",
-        "src/objects/js-iterator-helpers-inl.h",
+        "src/objects/js-generator-inl.h",
         "src/objects/js-iterator-helpers.h",
-        "src/objects/js-objects-inl.h",
+        "src/objects/js-iterator-helpers-inl.h",
         "src/objects/js-objects.cc",
         "src/objects/js-objects.h",
-        "src/objects/js-promise-inl.h",
+        "src/objects/js-objects-inl.h",
         "src/objects/js-promise.h",
-        "src/objects/js-proxy-inl.h",
+        "src/objects/js-promise-inl.h",
         "src/objects/js-proxy.h",
-        "src/objects/js-raw-json-inl.h",
-        "src/objects/js-raw-json.h",
+        "src/objects/js-proxy-inl.h",
         "src/objects/js-raw-json.cc",
-        "src/objects/js-regexp-inl.h",
-        "src/objects/js-regexp-string-iterator-inl.h",
-        "src/objects/js-regexp-string-iterator.h",
+        "src/objects/js-raw-json.h",
+        "src/objects/js-raw-json-inl.h",
         "src/objects/js-regexp.cc",
         "src/objects/js-regexp.h",
+        "src/objects/js-regexp-inl.h",
+        "src/objects/js-regexp-string-iterator.h",
+        "src/objects/js-regexp-string-iterator-inl.h",
         "src/objects/js-shadow-realm.h",
         "src/objects/js-shadow-realm-inl.h",
         "src/objects/js-shared-array.h",
@@ -1808,151 +1896,154 @@ filegroup(
         "src/objects/js-struct.cc",
         "src/objects/js-struct.h",
         "src/objects/js-struct-inl.h",
+        "src/objects/js-temporal-objects.cc",
         "src/objects/js-temporal-objects.h",
         "src/objects/js-temporal-objects-inl.h",
-        "src/objects/js-temporal-objects.cc",
         "src/objects/js-weak-refs.h",
         "src/objects/js-weak-refs-inl.h",
         "src/objects/keys.cc",
         "src/objects/keys.h",
-        "src/objects/literal-objects-inl.h",
         "src/objects/literal-objects.cc",
         "src/objects/literal-objects.h",
-        "src/objects/lookup-cache-inl.h",
+        "src/objects/literal-objects-inl.h",
+        "src/objects/lookup.cc",
+        "src/objects/lookup.h",
         "src/objects/lookup-cache.cc",
         "src/objects/lookup-cache.h",
+        "src/objects/lookup-cache-inl.h",
         "src/objects/lookup-inl.h",
-        "src/objects/lookup.cc",
-        "src/objects/lookup.h",
-        "src/objects/managed-inl.h",
         "src/objects/managed.cc",
         "src/objects/managed.h",
+        "src/objects/managed-inl.h",
+        "src/objects/map.cc",
+        "src/objects/map.h",
         "src/objects/map-inl.h",
         "src/objects/map-updater.cc",
         "src/objects/map-updater.h",
-        "src/objects/map.cc",
-        "src/objects/map.h",
-        "src/objects/maybe-object-inl.h",
         "src/objects/maybe-object.h",
-        "src/objects/megadom-handler-inl.h",
+        "src/objects/maybe-object-inl.h",
         "src/objects/megadom-handler.h",
-        "src/objects/microtask-inl.h",
+        "src/objects/megadom-handler-inl.h",
         "src/objects/microtask.h",
-        "src/objects/module-inl.h",
+        "src/objects/microtask-inl.h",
         "src/objects/module.cc",
         "src/objects/module.h",
-        "src/objects/name-inl.h",
+        "src/objects/module-inl.h",
         "src/objects/name.h",
+        "src/objects/name-inl.h",
         "src/objects/object-list-macros.h",
-        "src/objects/object-macros-undef.h",
         "src/objects/object-macros.h",
+        "src/objects/object-macros-undef.h",
         "src/objects/object-type.cc",
         "src/objects/object-type.h",
-        "src/objects/objects-body-descriptors-inl.h",
-        "src/objects/objects-body-descriptors.h",
-        "src/objects/objects-inl.h",
         "src/objects/objects.cc",
         "src/objects/objects.h",
+        "src/objects/objects-body-descriptors.h",
+        "src/objects/objects-body-descriptors-inl.h",
         "src/objects/objects-definitions.h",
-        "src/objects/oddball-inl.h",
+        "src/objects/objects-inl.h",
         "src/objects/oddball.h",
-        "src/objects/option-utils.h",
+        "src/objects/oddball-inl.h",
+        "src/objects/hole.h",
+        "src/objects/hole-inl.h",
         "src/objects/option-utils.cc",
-        "src/objects/ordered-hash-table-inl.h",
+        "src/objects/option-utils.h",
         "src/objects/ordered-hash-table.cc",
         "src/objects/ordered-hash-table.h",
-        "src/objects/primitive-heap-object-inl.h",
+        "src/objects/ordered-hash-table-inl.h",
         "src/objects/primitive-heap-object.h",
-        "src/objects/promise-inl.h",
+        "src/objects/primitive-heap-object-inl.h",
         "src/objects/promise.h",
-        "src/objects/property-array-inl.h",
+        "src/objects/promise-inl.h",
+        "src/objects/property.cc",
+        "src/objects/property.h",
         "src/objects/property-array.h",
-        "src/objects/property-cell-inl.h",
+        "src/objects/property-array-inl.h",
         "src/objects/property-cell.h",
-        "src/objects/property-descriptor-object-inl.h",
-        "src/objects/property-descriptor-object.h",
+        "src/objects/property-cell-inl.h",
         "src/objects/property-descriptor.cc",
         "src/objects/property-descriptor.h",
+        "src/objects/property-descriptor-object.h",
+        "src/objects/property-descriptor-object-inl.h",
         "src/objects/property-details.h",
-        "src/objects/property.cc",
-        "src/objects/property.h",
-        "src/objects/prototype-info-inl.h",
-        "src/objects/prototype-info.h",
         "src/objects/prototype.h",
+        "src/objects/prototype-info.h",
+        "src/objects/prototype-info-inl.h",
         "src/objects/prototype-inl.h",
-        "src/objects/regexp-match-info-inl.h",
         "src/objects/regexp-match-info.h",
-        "src/objects/scope-info-inl.h",
+        "src/objects/regexp-match-info-inl.h",
         "src/objects/scope-info.cc",
         "src/objects/scope-info.h",
-        "src/objects/script-inl.h",
+        "src/objects/scope-info-inl.h",
         "src/objects/script.h",
-        "src/objects/shared-function-info-inl.h",
+        "src/objects/script-inl.h",
         "src/objects/shared-function-info.cc",
         "src/objects/shared-function-info.h",
+        "src/objects/shared-function-info-inl.h",
         "src/objects/simd.cc",
         "src/objects/simd.h",
+        "src/objects/slots.h",
         "src/objects/slots-atomic-inl.h",
         "src/objects/slots-inl.h",
-        "src/objects/slots.h",
-        "src/objects/smi-inl.h",
         "src/objects/smi.h",
+        "src/objects/smi-inl.h",
         "src/objects/source-text-module.cc",
         "src/objects/source-text-module.h",
         "src/objects/source-text-module-inl.h",
+        "src/objects/string.cc",
+        "src/objects/string.h",
         "src/objects/string-comparator.cc",
         "src/objects/string-comparator.h",
-        "src/objects/string-inl.h",
-        "src/objects/string-set-inl.h",
-        "src/objects/string-set.h",
-        "src/objects/string-forwarding-table-inl.h",
         "src/objects/string-forwarding-table.cc",
         "src/objects/string-forwarding-table.h",
-        "src/objects/string-table-inl.h",
+        "src/objects/string-forwarding-table-inl.h",
+        "src/objects/string-inl.h",
+        "src/objects/string-set.h",
+        "src/objects/string-set-inl.h",
         "src/objects/string-table.cc",
-        "src/objects/symbol-table.cc",
         "src/objects/string-table.h",
-        "src/objects/string.cc",
-        "src/objects/string.h",
-        "src/objects/struct-inl.h",
+        "src/objects/string-table-inl.h",
         "src/objects/struct.h",
+        "src/objects/struct-inl.h",
         "src/objects/swiss-hash-table-helpers.h",
-        "src/objects/swiss-name-dictionary-inl.h",
         "src/objects/swiss-name-dictionary.cc",
         "src/objects/swiss-name-dictionary.h",
-        "src/objects/synthetic-module-inl.h",
+        "src/objects/swiss-name-dictionary-inl.h",
+        "src/objects/symbol-table.cc",
         "src/objects/synthetic-module.cc",
         "src/objects/synthetic-module.h",
-        "src/objects/tagged-field-inl.h",
+        "src/objects/synthetic-module-inl.h",
+        "src/objects/tagged.h",
         "src/objects/tagged-field.h",
-        "src/objects/tagged-impl-inl.h",
+        "src/objects/tagged-field-inl.h",
         "src/objects/tagged-impl.cc",
         "src/objects/tagged-impl.h",
+        "src/objects/tagged-impl-inl.h",
         "src/objects/tagged-index.h",
-        "src/objects/tagged-value-inl.h",
         "src/objects/tagged-value.h",
-        "src/objects/template-objects-inl.h",
+        "src/objects/tagged-value-inl.h",
         "src/objects/template-objects.cc",
         "src/objects/template-objects.h",
-        "src/objects/templates-inl.h",
+        "src/objects/template-objects-inl.h",
         "src/objects/templates.cc",
         "src/objects/templates.h",
-        "src/objects/torque-defined-classes-inl.h",
+        "src/objects/templates-inl.h",
         "src/objects/torque-defined-classes.h",
-        "src/objects/transitions-inl.h",
+        "src/objects/torque-defined-classes-inl.h",
         "src/objects/transitions.cc",
         "src/objects/transitions.h",
-        "src/objects/turbofan-types-inl.h",
+        "src/objects/transitions-inl.h",
         "src/objects/turbofan-types.h",
-        "src/objects/turboshaft-types-inl.h",
+        "src/objects/turbofan-types-inl.h",
         "src/objects/turboshaft-types.h",
+        "src/objects/turboshaft-types-inl.h",
         "src/objects/type-hints.cc",
         "src/objects/type-hints.h",
         "src/objects/value-serializer.cc",
         "src/objects/value-serializer.h",
         "src/objects/visitors.cc",
-        "src/objects/visitors-inl.h",
         "src/objects/visitors.h",
+        "src/objects/visitors-inl.h",
         "src/parsing/expression-scope.h",
         "src/parsing/func-name-inferrer.cc",
         "src/parsing/func-name-inferrer.h",
@@ -1963,44 +2054,44 @@ filegroup(
         "src/parsing/literal-buffer.h",
         "src/parsing/parse-info.cc",
         "src/parsing/parse-info.h",
-        "src/parsing/parser-base.h",
         "src/parsing/parser.cc",
         "src/parsing/parser.h",
+        "src/parsing/parser-base.h",
         "src/parsing/parsing.cc",
         "src/parsing/parsing.h",
         "src/parsing/pending-compilation-error-handler.cc",
         "src/parsing/pending-compilation-error-handler.h",
-        "src/parsing/preparse-data-impl.h",
         "src/parsing/preparse-data.cc",
         "src/parsing/preparse-data.h",
-        "src/parsing/preparser-logger.h",
+        "src/parsing/preparse-data-impl.h",
         "src/parsing/preparser.cc",
         "src/parsing/preparser.h",
+        "src/parsing/preparser-logger.h",
         "src/parsing/rewriter.cc",
         "src/parsing/rewriter.h",
-        "src/parsing/scanner-character-streams.cc",
-        "src/parsing/scanner-character-streams.h",
         "src/parsing/scanner.cc",
         "src/parsing/scanner.h",
+        "src/parsing/scanner-character-streams.cc",
+        "src/parsing/scanner-character-streams.h",
         "src/parsing/scanner-inl.h",
         "src/parsing/token.cc",
         "src/parsing/token.h",
         "src/profiler/allocation-tracker.cc",
         "src/profiler/allocation-tracker.h",
-        "src/profiler/circular-queue-inl.h",
         "src/profiler/circular-queue.h",
-        "src/profiler/cpu-profiler-inl.h",
+        "src/profiler/circular-queue-inl.h",
         "src/profiler/cpu-profiler.cc",
         "src/profiler/cpu-profiler.h",
+        "src/profiler/cpu-profiler-inl.h",
         "src/profiler/heap-profiler.cc",
         "src/profiler/heap-profiler.h",
-        "src/profiler/heap-snapshot-generator-inl.h",
         "src/profiler/heap-snapshot-generator.cc",
         "src/profiler/heap-snapshot-generator.h",
+        "src/profiler/heap-snapshot-generator-inl.h",
         "src/profiler/output-stream-writer.h",
-        "src/profiler/profile-generator-inl.h",
         "src/profiler/profile-generator.cc",
         "src/profiler/profile-generator.h",
+        "src/profiler/profile-generator-inl.h",
         "src/profiler/profiler-listener.cc",
         "src/profiler/profiler-listener.h",
         "src/profiler/profiler-stats.cc",
@@ -2015,28 +2106,30 @@ filegroup(
         "src/profiler/tick-sample.h",
         "src/profiler/tracing-cpu-profiler.cc",
         "src/profiler/tracing-cpu-profiler.h",
-        "src/profiler/weak-code-registry.h",
         "src/profiler/weak-code-registry.cc",
+        "src/profiler/weak-code-registry.h",
+        "src/regexp/experimental/experimental.cc",
+        "src/regexp/experimental/experimental.h",
         "src/regexp/experimental/experimental-bytecode.cc",
         "src/regexp/experimental/experimental-bytecode.h",
         "src/regexp/experimental/experimental-compiler.cc",
         "src/regexp/experimental/experimental-compiler.h",
         "src/regexp/experimental/experimental-interpreter.cc",
         "src/regexp/experimental/experimental-interpreter.h",
-        "src/regexp/experimental/experimental.cc",
-        "src/regexp/experimental/experimental.h",
+        "src/regexp/regexp.cc",
+        "src/regexp/regexp.h",
         "src/regexp/regexp-ast.cc",
         "src/regexp/regexp-ast.h",
-        "src/regexp/regexp-bytecode-generator-inl.h",
         "src/regexp/regexp-bytecode-generator.cc",
         "src/regexp/regexp-bytecode-generator.h",
+        "src/regexp/regexp-bytecode-generator-inl.h",
         "src/regexp/regexp-bytecode-peephole.cc",
         "src/regexp/regexp-bytecode-peephole.h",
         "src/regexp/regexp-bytecodes.cc",
         "src/regexp/regexp-bytecodes.h",
-        "src/regexp/regexp-compiler-tonode.cc",
         "src/regexp/regexp-compiler.cc",
         "src/regexp/regexp-compiler.h",
+        "src/regexp/regexp-compiler-tonode.cc",
         "src/regexp/regexp-dotprinter.cc",
         "src/regexp/regexp-dotprinter.h",
         "src/regexp/regexp-error.cc",
@@ -2044,11 +2137,11 @@ filegroup(
         "src/regexp/regexp-flags.h",
         "src/regexp/regexp-interpreter.cc",
         "src/regexp/regexp-interpreter.h",
+        "src/regexp/regexp-macro-assembler.cc",
+        "src/regexp/regexp-macro-assembler.h",
         "src/regexp/regexp-macro-assembler-arch.h",
         "src/regexp/regexp-macro-assembler-tracer.cc",
         "src/regexp/regexp-macro-assembler-tracer.h",
-        "src/regexp/regexp-macro-assembler.cc",
-        "src/regexp/regexp-macro-assembler.h",
         "src/regexp/regexp-nodes.h",
         "src/regexp/regexp-parser.cc",
         "src/regexp/regexp-parser.h",
@@ -2056,13 +2149,13 @@ filegroup(
         "src/regexp/regexp-stack.h",
         "src/regexp/regexp-utils.cc",
         "src/regexp/regexp-utils.h",
-        "src/regexp/regexp.cc",
-        "src/regexp/regexp.h",
         "src/regexp/special-case.h",
-        "src/roots/roots-inl.h",
         "src/roots/roots.cc",
         "src/roots/roots.h",
+        "src/roots/roots-inl.h",
         "src/roots/static-roots.h",
+        "src/runtime/runtime.cc",
+        "src/runtime/runtime.h",
         "src/runtime/runtime-array.cc",
         "src/runtime/runtime-atomics.cc",
         "src/runtime/runtime-bigint.cc",
@@ -2094,28 +2187,28 @@ filegroup(
         "src/runtime/runtime-typedarray.cc",
         "src/runtime/runtime-utils.h",
         "src/runtime/runtime-weak-refs.cc",
-        "src/runtime/runtime.cc",
-        "src/runtime/runtime.h",
-        "src/sandbox/external-pointer-inl.h",
+        "src/sandbox/bounded-size.h",
+        "src/sandbox/bounded-size-inl.h",
         "src/sandbox/external-pointer.h",
+        "src/sandbox/external-pointer-inl.h",
         "src/sandbox/external-pointer-table.cc",
-        "src/sandbox/external-pointer-table-inl.h",
         "src/sandbox/external-pointer-table.h",
-        "src/sandbox/testing.cc",
-        "src/sandbox/testing.h",
+        "src/sandbox/external-pointer-table-inl.h",
+        "src/sandbox/code-pointer-table.cc",
+        "src/sandbox/code-pointer-table.h",
+        "src/sandbox/code-pointer-table-inl.h",
+        "src/sandbox/code-pointer.h",
+        "src/sandbox/code-pointer-inl.h",
+        "src/sandbox/indirect-pointer.h",
+        "src/sandbox/indirect-pointer-inl.h",
+        "src/sandbox/external-entity-table.h",
+        "src/sandbox/external-entity-table-inl.h",
         "src/sandbox/sandbox.cc",
         "src/sandbox/sandbox.h",
-        "src/sandbox/sandboxed-pointer-inl.h",
         "src/sandbox/sandboxed-pointer.h",
-        "src/sandbox/bounded-size-inl.h",
-        "src/sandbox/bounded-size.h",
-        "src/base/sanitizer/asan.h",
-        "src/base/sanitizer/lsan-page-allocator.cc",
-        "src/base/sanitizer/lsan-page-allocator.h",
-        "src/base/sanitizer/lsan-virtual-address-space.cc",
-        "src/base/sanitizer/lsan-virtual-address-space.h",
-        "src/base/sanitizer/msan.h",
-        "src/base/sanitizer/tsan.h",
+        "src/sandbox/sandboxed-pointer-inl.h",
+        "src/sandbox/testing.cc",
+        "src/sandbox/testing.h",
         "src/snapshot/code-serializer.cc",
         "src/snapshot/code-serializer.h",
         "src/snapshot/context-deserializer.cc",
@@ -2125,55 +2218,60 @@ filegroup(
         "src/snapshot/deserializer.cc",
         "src/snapshot/deserializer.h",
         "src/snapshot/embedded/embedded-data.cc",
-        "src/snapshot/embedded/embedded-data-inl.h",
         "src/snapshot/embedded/embedded-data.h",
+        "src/snapshot/embedded/embedded-data-inl.h",
+        "src/snapshot/embedded/embedded-file-writer.h",
         "src/snapshot/embedded/embedded-file-writer-interface.h",
+        "src/snapshot/embedded/platform-embedded-file-writer-base.h",
         "src/snapshot/object-deserializer.cc",
         "src/snapshot/object-deserializer.h",
         "src/snapshot/read-only-deserializer.cc",
         "src/snapshot/read-only-deserializer.h",
         "src/snapshot/read-only-serializer.cc",
         "src/snapshot/read-only-serializer.h",
+        "src/snapshot/read-only-serializer-deserializer.h",
         "src/snapshot/references.h",
         "src/snapshot/roots-serializer.cc",
         "src/snapshot/roots-serializer.h",
+        "src/snapshot/serializer.cc",
+        "src/snapshot/serializer.h",
         "src/snapshot/serializer-deserializer.cc",
         "src/snapshot/serializer-deserializer.h",
-        "src/snapshot/serializer.cc",
         "src/snapshot/serializer-inl.h",
-        "src/snapshot/serializer.h",
-        "src/snapshot/shared-heap-deserializer.h",
         "src/snapshot/shared-heap-deserializer.cc",
-        "src/snapshot/shared-heap-serializer.h",
+        "src/snapshot/shared-heap-deserializer.h",
         "src/snapshot/shared-heap-serializer.cc",
+        "src/snapshot/shared-heap-serializer.h",
+        "src/snapshot/snapshot.cc",
+        "src/snapshot/snapshot.h",
         "src/snapshot/snapshot-data.cc",
         "src/snapshot/snapshot-data.h",
         "src/snapshot/snapshot-source-sink.cc",
         "src/snapshot/snapshot-source-sink.h",
         "src/snapshot/snapshot-utils.cc",
         "src/snapshot/snapshot-utils.h",
-        "src/snapshot/snapshot.cc",
-        "src/snapshot/snapshot.h",
+        "src/snapshot/sort-builtins.cc",
+        "src/snapshot/sort-builtins.h",
         "src/snapshot/startup-deserializer.cc",
         "src/snapshot/startup-deserializer.h",
         "src/snapshot/startup-serializer.cc",
         "src/snapshot/startup-serializer.h",
-        "src/strings/char-predicates-inl.h",
         "src/strings/char-predicates.h",
-        "src/strings/string-builder-inl.h",
+        "src/strings/char-predicates-inl.h",
         "src/strings/string-builder.cc",
+        "src/strings/string-builder-inl.h",
         "src/strings/string-case.cc",
         "src/strings/string-case.h",
-        "src/strings/string-hasher-inl.h",
         "src/strings/string-hasher.h",
+        "src/strings/string-hasher-inl.h",
         "src/strings/string-search.h",
         "src/strings/string-stream.cc",
         "src/strings/string-stream.h",
+        "src/strings/unicode.cc",
+        "src/strings/unicode.h",
         "src/strings/unicode-decoder.cc",
         "src/strings/unicode-decoder.h",
         "src/strings/unicode-inl.h",
-        "src/strings/unicode.cc",
-        "src/strings/unicode.h",
         "src/strings/uri.cc",
         "src/strings/uri.h",
         "src/tasks/cancelable-task.cc",
@@ -2184,10 +2282,10 @@ filegroup(
         "src/tasks/task-utils.h",
         "src/temporal/temporal-parser.cc",
         "src/temporal/temporal-parser.h",
-        "src/torque/runtime-macro-shims.h",
         "src/third_party/siphash/halfsiphash.cc",
         "src/third_party/siphash/halfsiphash.h",
         "src/third_party/utf8-decoder/utf8-decoder.h",
+        "src/torque/runtime-macro-shims.h",
         "src/tracing/trace-event.cc",
         "src/tracing/trace-event.h",
         "src/tracing/traced-value.cc",
@@ -2207,8 +2305,8 @@ filegroup(
         "src/utils/hex-format.h",
         "src/utils/identity-map.cc",
         "src/utils/identity-map.h",
-        "src/utils/locked-queue-inl.h",
         "src/utils/locked-queue.h",
+        "src/utils/locked-queue-inl.h",
         "src/utils/memcopy.cc",
         "src/utils/memcopy.h",
         "src/utils/ostreams.cc",
@@ -2217,9 +2315,9 @@ filegroup(
         "src/utils/sha-256.cc",
         "src/utils/sha-256.h",
         "src/utils/sparse-bit-vector.h",
-        "src/utils/utils-inl.h",
         "src/utils/utils.cc",
         "src/utils/utils.h",
+        "src/utils/utils-inl.h",
         "src/utils/version.cc",
         "src/utils/version.h",
         "src/zone/accounting-allocator.cc",
@@ -2227,42 +2325,42 @@ filegroup(
         "src/zone/compressed-zone-ptr.h",
         "src/zone/type-stats.cc",
         "src/zone/type-stats.h",
+        "src/zone/zone.cc",
+        "src/zone/zone.h",
         "src/zone/zone-allocator.h",
         "src/zone/zone-chunk-list.h",
+        "src/zone/zone-compact-set.h",
         "src/zone/zone-compression.h",
         "src/zone/zone-containers.h",
-        "src/zone/zone-handle-set.h",
         "src/zone/zone-hashmap.h",
-        "src/zone/zone-list-inl.h",
         "src/zone/zone-list.h",
+        "src/zone/zone-list-inl.h",
         "src/zone/zone-segment.cc",
         "src/zone/zone-segment.h",
         "src/zone/zone-type-traits.h",
         "src/zone/zone-utils.h",
-        "src/zone/zone.cc",
-        "src/zone/zone.h",
-        "src/asmjs/asm-js.h",
-        "src/execution/pointer-authentication-dummy.h",
-        "src/heap/third-party/heap-api.h",
-        "src/heap/third-party/heap-api-stub.cc",
+        ":cppgc_base_files",
+        ":generated_bytecode_builtins_list",
+        ":v8_bigint",
+        ":v8_heap_base_files",
     ] + select({
         "@v8//bazel/config:v8_target_ia32": [
             "src/baseline/ia32/baseline-assembler-ia32-inl.h",
             "src/baseline/ia32/baseline-compiler-ia32-inl.h",
-            "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h",
-            "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.cc",
-            "src/codegen/ia32/cpu-ia32.cc",
-            "src/codegen/ia32/assembler-ia32-inl.h",
             "src/codegen/ia32/assembler-ia32.cc",
             "src/codegen/ia32/assembler-ia32.h",
+            "src/codegen/ia32/assembler-ia32-inl.h",
             "src/codegen/ia32/constants-ia32.h",
+            "src/codegen/ia32/cpu-ia32.cc",
             "src/codegen/ia32/fma-instr.h",
             "src/codegen/ia32/interface-descriptors-ia32-inl.h",
-            "src/codegen/ia32/sse-instr.h",
             "src/codegen/ia32/macro-assembler-ia32.cc",
             "src/codegen/ia32/macro-assembler-ia32.h",
             "src/codegen/ia32/register-ia32.h",
             "src/codegen/ia32/reglist-ia32.h",
+            "src/codegen/ia32/sse-instr.h",
+            "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.cc",
+            "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h",
             "src/deoptimizer/ia32/deoptimizer-ia32.cc",
             "src/diagnostics/ia32/disasm-ia32.cc",
             "src/diagnostics/ia32/unwinder-ia32.cc",
@@ -2275,20 +2373,20 @@ filegroup(
         "@v8//bazel/config:v8_target_x64": [
             "src/baseline/x64/baseline-assembler-x64-inl.h",
             "src/baseline/x64/baseline-compiler-x64-inl.h",
-            "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h",
             "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.cc",
-            "src/codegen/x64/cpu-x64.cc",
-            "src/codegen/x64/assembler-x64-inl.h",
+            "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h",
             "src/codegen/x64/assembler-x64.cc",
             "src/codegen/x64/assembler-x64.h",
+            "src/codegen/x64/assembler-x64-inl.h",
             "src/codegen/x64/constants-x64.h",
+            "src/codegen/x64/cpu-x64.cc",
             "src/codegen/x64/fma-instr.h",
             "src/codegen/x64/interface-descriptors-x64-inl.h",
-            "src/codegen/x64/sse-instr.h",
             "src/codegen/x64/macro-assembler-x64.cc",
             "src/codegen/x64/macro-assembler-x64.h",
             "src/codegen/x64/register-x64.h",
             "src/codegen/x64/reglist-x64.h",
+            "src/codegen/x64/sse-instr.h",
             "src/deoptimizer/x64/deoptimizer-x64.cc",
             "src/diagnostics/x64/disasm-x64.cc",
             "src/diagnostics/x64/eh-frame-x64.cc",
@@ -2302,9 +2400,9 @@ filegroup(
         "@v8//bazel/config:v8_target_arm": [
             "src/baseline/arm/baseline-assembler-arm-inl.h",
             "src/baseline/arm/baseline-compiler-arm-inl.h",
-            "src/codegen/arm/assembler-arm-inl.h",
             "src/codegen/arm/assembler-arm.cc",
             "src/codegen/arm/assembler-arm.h",
+            "src/codegen/arm/assembler-arm-inl.h",
             "src/codegen/arm/constants-arm.cc",
             "src/codegen/arm/constants-arm.h",
             "src/codegen/arm/cpu-arm.cc",
@@ -2328,21 +2426,21 @@ filegroup(
         "@v8//bazel/config:v8_target_arm64": [
             "src/baseline/arm64/baseline-assembler-arm64-inl.h",
             "src/baseline/arm64/baseline-compiler-arm64-inl.h",
-            "src/codegen/arm64/assembler-arm64-inl.h",
             "src/codegen/arm64/assembler-arm64.cc",
             "src/codegen/arm64/assembler-arm64.h",
+            "src/codegen/arm64/assembler-arm64-inl.h",
             "src/codegen/arm64/constants-arm64.h",
             "src/codegen/arm64/cpu-arm64.cc",
-            "src/codegen/arm64/decoder-arm64-inl.h",
             "src/codegen/arm64/decoder-arm64.cc",
             "src/codegen/arm64/decoder-arm64.h",
-            "src/codegen/arm64/interface-descriptors-arm64-inl.h",
-            "src/codegen/arm64/instructions-arm64-constants.cc",
+            "src/codegen/arm64/decoder-arm64-inl.h",
             "src/codegen/arm64/instructions-arm64.cc",
             "src/codegen/arm64/instructions-arm64.h",
-            "src/codegen/arm64/macro-assembler-arm64-inl.h",
+            "src/codegen/arm64/instructions-arm64-constants.cc",
+            "src/codegen/arm64/interface-descriptors-arm64-inl.h",
             "src/codegen/arm64/macro-assembler-arm64.cc",
             "src/codegen/arm64/macro-assembler-arm64.h",
+            "src/codegen/arm64/macro-assembler-arm64-inl.h",
             "src/codegen/arm64/register-arm64.cc",
             "src/codegen/arm64/register-arm64.h",
             "src/codegen/arm64/reglist-arm64.h",
@@ -2453,8 +2551,8 @@ filegroup(
         "//conditions:default": [],
     }) + select({
         "@v8//bazel/config:v8_arm64_simulator": [
-            "src/trap-handler/trap-handler-simulator.h",
             "src/trap-handler/handler-outside-simulator.cc",
+            "src/trap-handler/trap-handler-simulator.h",
         ],
         "//conditions:default": [],
     }) + select({
@@ -2486,17 +2584,15 @@ filegroup(
             "src/runtime/runtime-test-wasm.cc",
             "src/runtime/runtime-wasm.cc",
             "src/third_party/utf8-decoder/generalized-utf8-decoder.h",
-            "src/trap-handler/handler-inside-posix.h",
             "src/trap-handler/handler-inside.cc",
+            "src/trap-handler/handler-inside-posix.h",
             "src/trap-handler/handler-outside.cc",
             "src/trap-handler/handler-shared.cc",
-            "src/trap-handler/trap-handler-internal.h",
             "src/trap-handler/trap-handler.h",
-            "src/wasm/assembler-buffer-cache.cc",
-            "src/wasm/assembler-buffer-cache.h",
+            "src/trap-handler/trap-handler-internal.h",
             "src/wasm/baseline/liftoff-assembler.cc",
-            "src/wasm/baseline/liftoff-assembler-defs.h",
             "src/wasm/baseline/liftoff-assembler.h",
+            "src/wasm/baseline/liftoff-assembler-defs.h",
             "src/wasm/baseline/liftoff-compiler.cc",
             "src/wasm/baseline/liftoff-compiler.h",
             "src/wasm/baseline/liftoff-register.h",
@@ -2537,16 +2633,20 @@ filegroup(
             "src/wasm/object-access.h",
             "src/wasm/pgo.cc",
             "src/wasm/pgo.h",
+            "src/wasm/serialized-signature-inl.h",
             "src/wasm/simd-shuffle.cc",
             "src/wasm/simd-shuffle.h",
             "src/wasm/stacks.cc",
             "src/wasm/stacks.h",
+            "src/wasm/std-object-sizes.h",
             "src/wasm/streaming-decoder.cc",
             "src/wasm/streaming-decoder.h",
             "src/wasm/string-builder.h",
             "src/wasm/string-builder-multiline.h",
             "src/wasm/struct-types.h",
             "src/wasm/sync-streaming-decoder.cc",
+            "src/wasm/turboshaft-graph-interface.cc",
+            "src/wasm/turboshaft-graph-interface.h",
             "src/wasm/value-type.cc",
             "src/wasm/value-type.h",
             "src/wasm/wasm-arguments.h",
@@ -2565,15 +2665,14 @@ filegroup(
             "src/wasm/wasm-features.h",
             "src/wasm/wasm-import-wrapper-cache.cc",
             "src/wasm/wasm-import-wrapper-cache.h",
-            "src/wasm/wasm-init-expr.cc",
             "src/wasm/wasm-init-expr.h",
             "src/wasm/wasm-js.cc",
             "src/wasm/wasm-js.h",
             "src/wasm/wasm-linkage.h",
-            "src/wasm/wasm-module-builder.cc",
-            "src/wasm/wasm-module-builder.h",
             "src/wasm/wasm-module.cc",
             "src/wasm/wasm-module.h",
+            "src/wasm/wasm-module-builder.cc",
+            "src/wasm/wasm-module-builder.h",
             "src/wasm/wasm-module-sourcemap.cc",
             "src/wasm/wasm-module-sourcemap.h",
             "src/wasm/wasm-objects.cc",
@@ -2677,6 +2776,7 @@ filegroup(
         "src/compiler/backend/instruction-scheduler.h",
         "src/compiler/backend/instruction-selector.cc",
         "src/compiler/backend/instruction-selector.h",
+        "src/compiler/backend/instruction-selector-adapter.h",
         "src/compiler/backend/instruction-selector-impl.h",
         "src/compiler/backend/jump-threading.cc",
         "src/compiler/backend/jump-threading.h",
@@ -2774,6 +2874,7 @@ filegroup(
         "src/compiler/js-graph.h",
         "src/compiler/js-heap-broker.cc",
         "src/compiler/js-heap-broker.h",
+        "src/compiler/js-heap-broker-inl.h",
         "src/compiler/js-inlining.cc",
         "src/compiler/js-inlining.h",
         "src/compiler/js-inlining-heuristic.cc",
@@ -2840,6 +2941,8 @@ filegroup(
         "src/compiler/operator-properties.h",
         "src/compiler/osr.cc",
         "src/compiler/osr.h",
+        "src/compiler/pair-load-store-reducer.cc",
+        "src/compiler/pair-load-store-reducer.h",
         "src/compiler/per-isolate-compiler-cache.h",
         "src/compiler/persistent-map.h",
         "src/compiler/phase.h",
@@ -2875,11 +2978,11 @@ filegroup(
         "src/compiler/state-values-utils.cc",
         "src/compiler/state-values-utils.h",
         "src/compiler/store-store-elimination.cc",
+        "src/compiler/store-store-elimination.h",
         "src/compiler/string-builder-optimizer.cc",
         "src/compiler/string-builder-optimizer.h",
-        "src/compiler/store-store-elimination.h",
-        "src/compiler/turbofan-enabled.cc",
         "src/compiler/turbofan.h",
+        "src/compiler/turbofan-enabled.cc",
         "src/compiler/turboshaft/assembler.cc",
         "src/compiler/turboshaft/assembler.h",
         "src/compiler/turboshaft/assert-types-reducer.h",
@@ -2890,24 +2993,32 @@ filegroup(
         "src/compiler/turboshaft/dead-code-elimination-phase.cc",
         "src/compiler/turboshaft/dead-code-elimination-phase.h",
         "src/compiler/turboshaft/dead-code-elimination-reducer.h",
+        "src/compiler/turboshaft/debug-feature-lowering-phase.cc",
+        "src/compiler/turboshaft/debug-feature-lowering-phase.h",
+        "src/compiler/turboshaft/debug-feature-lowering-reducer.h",
         "src/compiler/turboshaft/decompression-optimization.cc",
         "src/compiler/turboshaft/decompression-optimization.h",
         "src/compiler/turboshaft/decompression-optimization-phase.cc",
         "src/compiler/turboshaft/decompression-optimization-phase.h",
         "src/compiler/turboshaft/define-assembler-macros.inc",
         "src/compiler/turboshaft/deopt-data.h",
+        "src/compiler/turboshaft/doubly-threaded-list.h",
+        "src/compiler/turboshaft/explicit-truncation-reducer.h",
+        "src/compiler/turboshaft/fast-api-call-reducer.h",
         "src/compiler/turboshaft/fast-hash.h",
-        "src/compiler/turboshaft/graph-builder.cc",
-        "src/compiler/turboshaft/graph-builder.h",
         "src/compiler/turboshaft/graph.cc",
         "src/compiler/turboshaft/graph.h",
-        "src/compiler/turboshaft/index.h",
+        "src/compiler/turboshaft/graph-builder.cc",
+        "src/compiler/turboshaft/graph-builder.h",
         "src/compiler/turboshaft/graph-visualizer.cc",
         "src/compiler/turboshaft/graph-visualizer.h",
-        "src/compiler/turboshaft/late-escape-analysis-reducer.h",
+        "src/compiler/turboshaft/index.h",
+        "src/compiler/turboshaft/instruction-selection-phase.cc",
+        "src/compiler/turboshaft/instruction-selection-phase.h",
         "src/compiler/turboshaft/late-escape-analysis-reducer.cc",
-        "src/compiler/turboshaft/late-optimization-phase.cc",
-        "src/compiler/turboshaft/late-optimization-phase.h",
+        "src/compiler/turboshaft/late-escape-analysis-reducer.h",
+        "src/compiler/turboshaft/late-load-elimination-reducer.cc",
+        "src/compiler/turboshaft/late-load-elimination-reducer.h",
         "src/compiler/turboshaft/layered-hash-map.h",
         "src/compiler/turboshaft/machine-lowering-phase.cc",
         "src/compiler/turboshaft/machine-lowering-phase.h",
@@ -2915,51 +3026,59 @@ filegroup(
         "src/compiler/turboshaft/machine-optimization-reducer.h",
         "src/compiler/turboshaft/memory-optimization-reducer.cc",
         "src/compiler/turboshaft/memory-optimization-reducer.h",
+        "src/compiler/turboshaft/operation-matcher.h",
         "src/compiler/turboshaft/operations.cc",
         "src/compiler/turboshaft/operations.h",
-        "src/compiler/turboshaft/operation-matching.h",
         "src/compiler/turboshaft/optimization-phase.cc",
         "src/compiler/turboshaft/optimization-phase.h",
         "src/compiler/turboshaft/optimize-phase.cc",
         "src/compiler/turboshaft/optimize-phase.h",
         "src/compiler/turboshaft/phase.cc",
         "src/compiler/turboshaft/phase.h",
+        "src/compiler/turboshaft/pretenuring-propagation-reducer.cc",
+        "src/compiler/turboshaft/pretenuring-propagation-reducer.h",
         "src/compiler/turboshaft/recreate-schedule.cc",
         "src/compiler/turboshaft/recreate-schedule.h",
         "src/compiler/turboshaft/recreate-schedule-phase.cc",
         "src/compiler/turboshaft/recreate-schedule-phase.h",
+        "src/compiler/turboshaft/reduce-args-helper.h",
         "src/compiler/turboshaft/reducer-traits.h",
         "src/compiler/turboshaft/representations.cc",
         "src/compiler/turboshaft/representations.h",
+        "src/compiler/turboshaft/required-optimization-reducer.h",
         "src/compiler/turboshaft/runtime-call-descriptors.h",
         "src/compiler/turboshaft/select-lowering-reducer.h",
         "src/compiler/turboshaft/sidetable.h",
         "src/compiler/turboshaft/simplify-tf-loops.cc",
         "src/compiler/turboshaft/simplify-tf-loops.h",
         "src/compiler/turboshaft/snapshot-table.h",
-        "src/compiler/turboshaft/tag-untag-lowering-phase.cc",
-        "src/compiler/turboshaft/tag-untag-lowering-phase.h",
-        "src/compiler/turboshaft/tag-untag-lowering-reducer.h",
+        "src/compiler/turboshaft/store-store-elimination-phase.cc",
+        "src/compiler/turboshaft/store-store-elimination-phase.h",
+        "src/compiler/turboshaft/store-store-elimination-reducer.h",
+        "src/compiler/turboshaft/structural-optimization-reducer.h",
         "src/compiler/turboshaft/tracing.h",
-        "src/compiler/turboshaft/type-inference-analysis.h",
-        "src/compiler/turboshaft/type-inference-reducer.h",
-        "src/compiler/turboshaft/typer.cc",
-        "src/compiler/turboshaft/typer.h",
         "src/compiler/turboshaft/type-assertions-phase.cc",
         "src/compiler/turboshaft/type-assertions-phase.h",
+        "src/compiler/turboshaft/type-inference-analysis.h",
+        "src/compiler/turboshaft/type-inference-reducer.h",
         "src/compiler/turboshaft/type-parser.cc",
         "src/compiler/turboshaft/type-parser.h",
         "src/compiler/turboshaft/typed-optimizations-phase.cc",
         "src/compiler/turboshaft/typed-optimizations-phase.h",
         "src/compiler/turboshaft/typed-optimizations-reducer.h",
+        "src/compiler/turboshaft/typer.cc",
+        "src/compiler/turboshaft/typer.h",
         "src/compiler/turboshaft/types.cc",
         "src/compiler/turboshaft/types.h",
         "src/compiler/turboshaft/undef-assembler-macros.inc",
         "src/compiler/turboshaft/uniform-reducer-adapter.h",
+        "src/compiler/turboshaft/use-map.cc",
+        "src/compiler/turboshaft/use-map.h",
         "src/compiler/turboshaft/utils.cc",
         "src/compiler/turboshaft/utils.h",
         "src/compiler/turboshaft/value-numbering-reducer.h",
         "src/compiler/turboshaft/variable-reducer.h",
+        "src/compiler/turboshaft/wasm-js-lowering-reducer.h",
         "src/compiler/type-cache.cc",
         "src/compiler/type-cache.h",
         "src/compiler/type-narrowing-reducer.cc",
@@ -3035,17 +3154,24 @@ filegroup(
         ":is_v8_enable_webassembly": [
             "src/compiler/int64-lowering.cc",
             "src/compiler/int64-lowering.h",
+            "src/compiler/turboshaft/int64-lowering-phase.cc",
+            "src/compiler/turboshaft/int64-lowering-phase.h",
+            "src/compiler/turboshaft/int64-lowering-reducer.h",
+            "src/compiler/turboshaft/wasm-lowering-reducer.h",
+            "src/compiler/turboshaft/wasm-optimize-phase.cc",
+            "src/compiler/turboshaft/wasm-optimize-phase.h",
+            "src/compiler/turboshaft/wasm-turboshaft-compiler.cc",
+            "src/compiler/turboshaft/wasm-turboshaft-compiler.h",
+            "src/compiler/wasm-address-reassociation.cc",
+            "src/compiler/wasm-address-reassociation.h",
             "src/compiler/wasm-call-descriptors.cc",
             "src/compiler/wasm-call-descriptors.h",
-            "src/compiler/wasm-compiler-definitions.h",
             "src/compiler/wasm-compiler.cc",
             "src/compiler/wasm-compiler.h",
+            "src/compiler/wasm-compiler-definitions.cc",
+            "src/compiler/wasm-compiler-definitions.h",
             "src/compiler/wasm-escape-analysis.cc",
             "src/compiler/wasm-escape-analysis.h",
-            "src/compiler/wasm-load-elimination.cc",
-            "src/compiler/wasm-load-elimination.h",
-            "src/compiler/wasm-loop-peeling.cc",
-            "src/compiler/wasm-loop-peeling.h",
             "src/compiler/wasm-gc-lowering.cc",
             "src/compiler/wasm-gc-lowering.h",
             "src/compiler/wasm-gc-operator-reducer.cc",
@@ -3056,6 +3182,12 @@ filegroup(
             "src/compiler/wasm-inlining.h",
             "src/compiler/wasm-inlining-into-js.cc",
             "src/compiler/wasm-inlining-into-js.h",
+            "src/compiler/wasm-load-elimination.cc",
+            "src/compiler/wasm-load-elimination.h",
+            "src/compiler/wasm-loop-peeling.cc",
+            "src/compiler/wasm-loop-peeling.h",
+            "src/compiler/wasm-js-lowering.cc",
+            "src/compiler/wasm-js-lowering.h",
             "src/compiler/wasm-typer.cc",
             "src/compiler/wasm-typer.h",
         ],
@@ -3079,9 +3211,9 @@ filegroup(
         "src/builtins/builtins-call-gen.h",
         "src/builtins/builtins-collections-gen.cc",
         "src/builtins/builtins-collections-gen.h",
+        "src/builtins/builtins-constructor.h",
         "src/builtins/builtins-constructor-gen.cc",
         "src/builtins/builtins-constructor-gen.h",
-        "src/builtins/builtins-constructor.h",
         "src/builtins/builtins-conversion-gen.cc",
         "src/builtins/builtins-data-view-gen.h",
         "src/builtins/builtins-date-gen.cc",
@@ -3136,8 +3268,8 @@ filegroup(
         "src/interpreter/interpreter-generator.h",
         "src/interpreter/interpreter-intrinsics-generator.cc",
         "src/interpreter/interpreter-intrinsics-generator.h",
-        "src/numbers/integer-literal-inl.h",
         "src/numbers/integer-literal.h",
+        "src/numbers/integer-literal-inl.h",
     ] + select({
         "@v8//bazel/config:v8_target_ia32": ["src/builtins/ia32/builtins-ia32.cc"],
         "@v8//bazel/config:v8_target_x64": ["src/builtins/x64/builtins-x64.cc"],
@@ -3188,6 +3320,7 @@ filegroup(
         "src/heap/cppgc/heap.h",
         "src/heap/cppgc/heap-base.cc",
         "src/heap/cppgc/heap-base.h",
+        "src/heap/cppgc/heap-config.h",
         "src/heap/cppgc/heap-consistency.cc",
         "src/heap/cppgc/heap-growing.cc",
         "src/heap/cppgc/heap-growing.h",
@@ -3201,8 +3334,6 @@ filegroup(
         "src/heap/cppgc/heap-statistics-collector.cc",
         "src/heap/cppgc/heap-statistics-collector.h",
         "src/heap/cppgc/heap-visitor.h",
-        "src/heap/cppgc/incremental-marking-schedule.cc",
-        "src/heap/cppgc/incremental-marking-schedule.h",
         "src/heap/cppgc/liveness-broker.cc",
         "src/heap/cppgc/liveness-broker.h",
         "src/heap/cppgc/logging.cc",
@@ -3244,12 +3375,10 @@ filegroup(
         "src/heap/cppgc/raw-heap.h",
         "src/heap/cppgc/remembered-set.cc",
         "src/heap/cppgc/remembered-set.h",
-        "src/heap/cppgc/source-location.cc",
         "src/heap/cppgc/stats-collector.cc",
         "src/heap/cppgc/stats-collector.h",
         "src/heap/cppgc/sweeper.cc",
         "src/heap/cppgc/sweeper.h",
-        "src/heap/cppgc/heap-config.h",
         "src/heap/cppgc/task-handle.h",
         "src/heap/cppgc/trace-event.h",
         "src/heap/cppgc/trace-trait.cc",
@@ -3269,6 +3398,9 @@ filegroup(
         "src/heap/base/active-system-pages.cc",
         "src/heap/base/active-system-pages.h",
         "src/heap/base/basic-slot-set.h",
+        "src/heap/base/bytes.h",
+        "src/heap/base/incremental-marking-schedule.cc",
+        "src/heap/base/incremental-marking-schedule.h",
         "src/heap/base/stack.cc",
         "src/heap/base/stack.h",
         "src/heap/base/worklist.cc",
@@ -3332,10 +3464,10 @@ filegroup(
         "src/snapshot/embedded/platform-embedded-file-writer-mac.h",
         "src/snapshot/embedded/platform-embedded-file-writer-win.cc",
         "src/snapshot/embedded/platform-embedded-file-writer-win.h",
-        "src/snapshot/static-roots-gen.cc",
-        "src/snapshot/static-roots-gen.h",
         "src/snapshot/mksnapshot.cc",
         "src/snapshot/snapshot-empty.cc",
+        "src/snapshot/static-roots-gen.cc",
+        "src/snapshot/static-roots-gen.h",
     ],
 )
 
@@ -3376,12 +3508,16 @@ filegroup(
         "src/inspector/v8-debugger-id.h",
         "src/inspector/v8-debugger-script.cc",
         "src/inspector/v8-debugger-script.h",
+        "src/inspector/v8-deep-serializer.cc",
+        "src/inspector/v8-deep-serializer.h",
         "src/inspector/v8-heap-profiler-agent-impl.cc",
         "src/inspector/v8-heap-profiler-agent-impl.h",
         "src/inspector/v8-inspector-impl.cc",
         "src/inspector/v8-inspector-impl.h",
         "src/inspector/v8-inspector-session-impl.cc",
         "src/inspector/v8-inspector-session-impl.h",
+        "src/inspector/v8-serialization-duplicate-tracker.cc",
+        "src/inspector/v8-serialization-duplicate-tracker.h",
         "src/inspector/v8-profiler-agent-impl.cc",
         "src/inspector/v8-profiler-agent-impl.h",
         "src/inspector/v8-regex.cc",
@@ -3396,8 +3532,6 @@ filegroup(
         "src/inspector/v8-string-conversions.h",
         "src/inspector/v8-value-utils.cc",
         "src/inspector/v8-value-utils.h",
-        "src/inspector/v8-webdriver-serializer.cc",
-        "src/inspector/v8-webdriver-serializer.h",
         "src/inspector/value-mirror.cc",
         "src/inspector/value-mirror.h",
         ":crdtp_platform_files",
@@ -3495,10 +3629,36 @@ filegroup(
 # Generated files
 # =================================================
 
+# Define file groups for torque definitions and initializers. Both are
+# generated together, but we can use output_group to split them.
+filegroup(
+    name = "icu/generated_torque_definitions",
+    srcs = [":icu/generated_torque_files"],
+    output_group = "definitions",
+)
+
+filegroup(
+    name = "noicu/generated_torque_definitions",
+    srcs = [":noicu/generated_torque_files"],
+    output_group = "definitions",
+)
+
+filegroup(
+    name = "icu/generated_torque_initializers",
+    srcs = [":icu/generated_torque_files"],
+    output_group = "initializers",
+)
+
+filegroup(
+    name = "noicu/generated_torque_initializers",
+    srcs = [":noicu/generated_torque_files"],
+    output_group = "initializers",
+)
+
 # TODO(victorgomes): Add support to tools/debug_helper,
 # which needs class-debug-readers and debug-macros.
-v8_torque_definitions(
-    name = "generated_torque_definitions",
+v8_torque_files(
+    name = "generated_torque_files",
     args = select({
         ":is_v8_annotate_torque_ir": ["-annotate-ir"],
         "//conditions:default": [],
@@ -3506,7 +3666,13 @@ v8_torque_definitions(
         "@v8//bazel/config:v8_target_is_32_bits": ["-m32"],
         "//conditions:default": [],
     }),
-    extras = [
+    initializer_extras = [
+        "csa-types.h",
+        "enum-verifiers.cc",
+        "exported-macros-assembler.cc",
+        "exported-macros-assembler.h",
+    ],
+    definition_extras = [
         "bit-fields.h",
         "builtin-definitions.h",
         # "class-debug-readers.cc",
@@ -3523,25 +3689,7 @@ v8_torque_definitions(
         "objects-body-descriptors-inl.inc",
         "objects-printer.cc",
         "visitor-lists.h",
-    ],
-    icu_srcs = [":icu/torque_files"],
-    noicu_srcs = [":noicu/torque_files"],
-)
 
-v8_torque_initializers(
-    name = "generated_torque_initializers",
-    args = select({
-        ":is_v8_annotate_torque_ir": ["-annotate-ir"],
-        "//conditions:default": [],
-    }) + select({
-        "@v8//bazel/config:v8_target_is_32_bits": ["-m32"],
-        "//conditions:default": [],
-    }),
-    extras = [
-        "csa-types.h",
-        "enum-verifiers.cc",
-        "exported-macros-assembler.cc",
-        "exported-macros-assembler.h",
     ],
     icu_srcs = [":icu/torque_files"],
     noicu_srcs = [":noicu/torque_files"],
@@ -3549,7 +3697,6 @@ v8_torque_initializers(
 
 py_binary(
     name = "code_generator",
-    python_version = "PY3",
     srcs = [
         "third_party/inspector_protocol/code_generator.py",
         "third_party/inspector_protocol/pdl.py",
@@ -3568,6 +3715,8 @@ py_binary(
         "third_party/inspector_protocol/templates/TypeBuilder_cpp.template",
         "third_party/inspector_protocol/templates/TypeBuilder_h.template",
     ],
+    imports = ["third_party/inspector_protocol/"],
+    python_version = "PY3",
     deps = [
         requirement("jinja2"),
     ],
@@ -3599,12 +3748,12 @@ genrule(
         "src/inspector/protocol/Schema.cpp",
         "src/inspector/protocol/Schema.h",
     ],
-    local = 1,
     cmd = "$(location :code_generator) --jinja_dir . \
            --inspector_protocol_dir third_party/inspector_protocol \
            --config $(location :src/inspector/inspector_protocol_config.json) \
            --config_value protocol.path=$(location :include/js_protocol.pdl) \
            --output_base $(@D)/src/inspector",
+    local = 1,
     message = "Generating inspector files",
     tools = [
         ":code_generator",
@@ -3730,6 +3879,7 @@ cc_library(
     deps = [
         ":torque_base_headers",
         ":v8_libbase",
+        "//external:absl_optional",
     ],
 )
 
@@ -3794,7 +3944,12 @@ v8_library(
     copts = ["-Wno-implicit-fallthrough"],
     strip_include_prefix = "third_party",
     visibility = ["//visibility:public"],
-    deps = [":noicu/v8"],
+    deps = [":noicu/v8"] + select({
+        ":is_v8_enable_vtunejit": [
+            ":v8_vtune",
+        ],
+        "//conditions:default": [],
+    }),
 )
 
 alias(
@@ -3807,6 +3962,20 @@ alias(
     actual = "icu/v8",
 )
 
+v8_library(
+    name = "v8_vtune",
+    srcs = glob([
+        "src/third_party/vtune/v8-vtune.h",
+        "src/third_party/vtune/vtune-jit.cc",
+        "src/third_party/vtune/vtune-jit.h",
+    ]),
+    copts = ["-I"],
+    deps = [
+        ":core_lib_noicu",
+        "@intel_ittapi//:lib_ittapi",
+    ],
+)
+
 # =================================================
 # Binary rules
 # =================================================
@@ -3842,6 +4011,7 @@ v8_binary(
         "UNISTR_FROM_CHAR_EXPLICIT=",
     ],
     deps = [
+        "//external:absl_optional",
         "//external:icu",
     ],
 )
@@ -3856,8 +4026,8 @@ v8_binary(
         "@v8//bazel/config:is_posix": ["-fexceptions"],
         "//conditions:default": [],
     }),
-    icu_defines = [ "V8_INTL_SUPPORT" ],
     features = ["-use_header_modules"],
+    icu_defines = ["V8_INTL_SUPPORT"],
     linkopts = select({
         "@v8//bazel/config:is_android": ["-llog"],
         "//conditions:default": [],
@@ -3878,14 +4048,14 @@ v8_binary(
     }),
     copts = ["-Wno-implicit-fallthrough"],
     icu_deps = [":icu/v8_libshared"],
-    linkopts = select({
-        "@v8//bazel/config:is_android": ["-llog"],
-        "//conditions:default": [],
-    }),
     icu_srcs = [
         ":icu/generated_torque_initializers",
         ":icu/v8_initializers_files",
     ],
+    linkopts = select({
+        "@v8//bazel/config:is_android": ["-llog"],
+        "//conditions:default": [],
+    }),
     noicu_deps = [":v8_libshared_noicu"],
     noicu_srcs = [
         ":noicu/generated_torque_initializers",
@@ -3943,10 +4113,10 @@ py_test(
         "mjsunit",
     ],
     data = [
-        "//testing/pybase",
-        ":noicu/v8_build_config",
-        ":noicu/d8",
         "test",
+        ":noicu/d8",
+        ":noicu/v8_build_config",
+        "//testing/pybase",
     ] + glob(["test/**"]) + glob(["tools/**/*.js"]) + glob(["tools/**/*.mjs"]),
     main = "tools/run-tests.py",
     python_version = "PY3",
@@ -3973,10 +4143,10 @@ py_test(
         "mjsunit",
     ],
     data = [
-        "//testing/pybase",
-        ":icu/v8_build_config",
-        ":icu/d8",
         "test",
+        ":icu/d8",
+        ":icu/v8_build_config",
+        "//testing/pybase",
     ] + glob(["test/**"]) + glob(["tools/**/*.js"]) + glob(["tools/**/*.mjs"]),
     main = "tools/run-tests.py",
     python_version = "PY3",
diff --git a/deps/v8/BUILD.gn b/deps/v8/BUILD.gn
index 68d92c3477bc2c..dd97c4f922c81a 100644
--- a/deps/v8/BUILD.gn
+++ b/deps/v8/BUILD.gn
@@ -134,7 +134,7 @@ declare_args() {
 
   # Mode used by gen-static-roots.py to have a heap layout which is identical
   # to when v8_enable_static_roots is enabled.
-  v8_enable_static_root_generation = false
+  v8_enable_static_roots_generation = false
 
   # Enable code-generation-time checking of types in the CodeStubAssembler.
   v8_enable_verify_csa = false
@@ -189,6 +189,15 @@ declare_args() {
   # used builtins.
   v8_enable_builtins_profiling_verbose = false
 
+  # This build flag is used to input a builtin pgo file containing raw
+  # execution counts (as opposed to branch hints), which are embedded into
+  # the `--trace-turbo` .json file from `mksnapshot`.
+  v8_log_builtins_block_count_input = ""
+
+  # This build flag is used to control whether reorder builtins acoording to
+  # the call graph with C3 algorithm based builtin PGO profiling.
+  v8_enable_builtins_reordering = false
+
   # Provides the given V8 log file as an input to mksnapshot, where it can be
   # used for profile-guided optimization of builtins.
   #
@@ -284,6 +293,9 @@ declare_args() {
   # Use switch-based dispatch if this is false
   v8_enable_regexp_interpreter_threaded_dispatch = true
 
+  # Enforce equality of builtins hashes from compatible architectures.
+  v8_verify_builtins_compatibility = false
+
   # Check mksnapshot determinism by running it multiple times.
   v8_verify_deterministic_mksnapshot = false
 
@@ -309,7 +321,7 @@ declare_args() {
   # Enable heap reservation of size 4GB. Only possible for 64bit archs.
   cppgc_enable_caged_heap =
       v8_current_cpu == "x64" || v8_current_cpu == "arm64" ||
-      v8_current_cpu == "loong64"
+      v8_current_cpu == "loong64" || v8_current_cpu == "riscv64"
 
   # Enables additional heap verification phases and checks.
   cppgc_enable_verify_heap = ""
@@ -325,6 +337,10 @@ declare_args() {
   # Sets -DV8_ENABLE_SANDBOX.
   v8_enable_sandbox = ""
 
+  # Enable experimental code pointer sandboxing for the V8 sandbox.
+  # Sets -DV8_CODE_POINTER_SANDBOXING
+  v8_code_pointer_sandboxing = ""
+
   # Expose the memory corruption API to JavaScript. Useful for testing the sandbox.
   # WARNING This will expose builtins that (by design) cause memory corruption.
   # Sets -DV8_EXPOSE_MEMORY_CORRUPTION_API
@@ -370,17 +386,6 @@ declare_args() {
   # This is only used by nodejs.
   v8_scriptormodule_legacy_lifetime = false
 
-  # Change code emission and runtime features to be CET shadow-stack compliant
-  # (incomplete and experimental).
-  v8_enable_cet_shadow_stack = false
-
-  # Get VMEX priviledge at startup.
-  # It allows to run V8 without "deprecated-ambient-replace-as-executable".
-  # Sets -DV8_USE_VMEX_RESOURCE.
-  # TODO(victorgomes): Remove this flag once Chormium no longer needs
-  # the deprecated feature.
-  v8_fuchsia_use_vmex_resource = is_fuchsia && !build_with_chromium
-
   # Enables pointer compression for 8GB heaps.
   # Sets -DV8_COMPRESS_POINTERS_8GB.
   v8_enable_pointer_compression_8gb = ""
@@ -399,6 +404,23 @@ declare_args() {
   # iOS (non-simulator) does not have executable pages for 3rd party
   # applications yet so disable jit.
   v8_jitless = v8_enable_lite_mode || target_is_ios_device
+
+  # Enable Maglev's graph printer.
+  # Sets -DV8_ENABLE_MAGLEV_GRAPH_PRINTER.
+  v8_enable_maglev_graph_printer = !build_with_chromium
+
+  # Enable slow tracing, e.g., tracing on every instruction or Turbofan node.
+  # Sets -DV8_ENABLE_SLOW_TRACING.
+  v8_enable_slow_tracing = is_debug
+
+  # Enable jump table switch for built-in.
+  v8_enable_builtin_jump_table_switch = v8_current_cpu == "x64"
+
+  v8_shortcut_strings_in_minor_ms = false
+
+  # Whether custom embedder snapshots may extend (= allocate new objects in)
+  # ReadOnlySpace.
+  v8_enable_extensible_ro_snapshot = true
 }
 
 # Derived defaults.
@@ -478,13 +500,12 @@ if (v8_enable_short_builtin_calls == "") {
 if (v8_enable_external_code_space == "") {
   v8_enable_external_code_space =
       v8_enable_pointer_compression &&
-      (v8_current_cpu == "x64" ||
-       (target_os != "fuchsia" && v8_current_cpu == "arm64"))
+      (v8_current_cpu == "x64" || v8_current_cpu == "arm64")
 }
 if (v8_enable_maglev == "") {
   v8_enable_maglev = v8_enable_turbofan &&
-                     (v8_current_cpu == "x64" || v8_current_cpu == "arm64") &&
-                     v8_enable_pointer_compression
+                     (v8_current_cpu == "arm" || v8_current_cpu == "x64" ||
+                      v8_current_cpu == "arm64")
 }
 assert(v8_enable_turbofan || !v8_enable_maglev,
        "Maglev is not available when Turbofan is disabled.")
@@ -546,6 +567,11 @@ if (v8_enable_sandbox == "") {
                       v8_enable_external_code_space && target_os != "fuchsia"
 }
 
+if (v8_code_pointer_sandboxing == "") {
+  # By default, enable code pointer sandboxing if the sandbox is enabled.
+  v8_code_pointer_sandboxing = v8_enable_sandbox
+}
+
 if (v8_enable_static_roots == "") {
   # Static roots are only valid for builds with pointer compression and a
   # shared read-only heap.
@@ -569,7 +595,7 @@ assert(!v8_enable_static_roots ||
        "Trying to enable static roots in a configuration that is not supported")
 
 assert(
-    !(v8_enable_static_roots && v8_enable_static_root_generation),
+    !(v8_enable_static_roots && v8_enable_static_roots_generation),
     "Static root values must be generated in a build that does not rely on static roots itself")
 
 if (v8_builtins_profiling_log_file == "default") {
@@ -584,20 +610,30 @@ if (v8_builtins_profiling_log_file == "default") {
   #   are accessed,
   # * v8_enable_webassembly because it changes the set of opcodes which affects
   #   graphs hashes,
-  # * !is_clang because it might affect argument evaluation order, which
-  #    makes node IDs not predictable for subgraphs like Op1(Op2(), Op3()) and
-  #    as a result different graph hash.
   if (v8_enable_builtins_optimization && !v8_enable_builtins_profiling &&
-      is_clang && !is_debug && !dcheck_always_on && v8_enable_webassembly) {
+      !is_debug && !dcheck_always_on && v8_enable_webassembly) {
+    # This is about function arguments evaluation order, which makes node IDs
+    # not predictable for subgraphs like Op1(Op2(), Op3()) and as a result
+    # different graph hashes.
+    # Clang uses left-to-right order everywhere except Windows, otherwise the
+    # order is right-to-left.
+    # TODO(crbug.com/v8/13647): Remove once this issue is fixed in CSA.
+    if (!is_clang || is_win) {
+      pgo_profile_suffix = "-rl"
+    } else {
+      pgo_profile_suffix = ""
+    }
     if ((v8_current_cpu == "x64" || v8_current_cpu == "arm64") &&
         v8_enable_pointer_compression && v8_enable_external_code_space &&
         v8_enable_sandbox) {
       # Note, currently x64 profile can be applied to arm64 but not the other
       # way round.
-      v8_builtins_profiling_log_file = "tools/builtins-pgo/profiles/x64.profile"
+      v8_builtins_profiling_log_file =
+          "tools/builtins-pgo/profiles/x64" + pgo_profile_suffix + ".profile"
     } else if (v8_current_cpu == "x86" || v8_current_cpu == "arm") {
       # Note, x86 profile can be applied to arm but not the other way round.
-      v8_builtins_profiling_log_file = "tools/builtins-pgo/profiles/x86.profile"
+      v8_builtins_profiling_log_file =
+          "tools/builtins-pgo/profiles/x86" + pgo_profile_suffix + ".profile"
     }
   }
 }
@@ -637,6 +673,9 @@ assert(!v8_enable_sandbox || v8_enable_pointer_compression_shared_cage,
 assert(!v8_enable_sandbox || v8_enable_external_code_space,
        "The sandbox requires the external code space")
 
+assert(!v8_code_pointer_sandboxing || v8_enable_sandbox,
+       "Code pointer sandboxing requires the sandbox")
+
 assert(!v8_expose_memory_corruption_api || v8_enable_sandbox,
        "The Memory Corruption API requires the sandbox")
 
@@ -647,14 +686,16 @@ assert(
 assert(
     !v8_enable_pointer_compression_shared_cage || v8_current_cpu == "x64" ||
         v8_current_cpu == "arm64" || v8_current_cpu == "riscv64" ||
-        v8_current_cpu == "ppc64",
-    "Sharing a pointer compression cage is only supported on x64,arm64, ppc64 and riscv64")
+        v8_current_cpu == "ppc64" || v8_current_cpu == "s390x" ||
+        v8_current_cpu == "loong64",
+    "Sharing a pointer compression cage is only supported on x64, arm64, ppc64, s390x, riscv64 and loong64")
 
 assert(!v8_enable_unconditional_write_barriers || !v8_disable_write_barriers,
        "Write barriers can't be both enabled and disabled")
 
 assert(!cppgc_enable_caged_heap || v8_current_cpu == "x64" ||
-           v8_current_cpu == "arm64" || v8_current_cpu == "loong64",
+           v8_current_cpu == "arm64" || v8_current_cpu == "loong64" ||
+           v8_current_cpu == "riscv64",
        "CppGC caged heap requires 64bit platforms")
 
 assert(!cppgc_enable_young_generation || cppgc_enable_caged_heap,
@@ -669,10 +710,6 @@ if (v8_enable_single_generation == true) {
       "Requires unconditional write barriers or none (which disables incremental marking)")
 }
 
-if (v8_fuchsia_use_vmex_resource) {
-  assert(target_os == "fuchsia", "VMEX resource only available on Fuchsia")
-}
-
 assert(!v8_enable_snapshot_compression || v8_use_zlib,
        "Snapshot compression requires zlib")
 
@@ -715,7 +752,9 @@ config("internal_config") {
   }
 
   if (v8_current_cpu == "riscv64" || v8_current_cpu == "riscv32") {
-    libs = [ "atomic" ]
+    if (!is_clang) {
+      libs = [ "atomic" ]
+    }
   }
 }
 
@@ -787,7 +826,9 @@ config("external_config") {
   }
 
   if (current_cpu == "riscv64" || current_cpu == "riscv32") {
-    libs = [ "atomic" ]
+    if (!is_clang) {
+      libs = [ "atomic" ]
+    }
   }
 }
 
@@ -816,6 +857,7 @@ external_v8_defines = [
   "V8_MAP_PACKING",
   "V8_IS_TSAN",
   "V8_ENABLE_CONSERVATIVE_STACK_SCANNING",
+  "V8_ENABLE_DIRECT_LOCAL",
 ]
 
 enabled_external_v8_defines = []
@@ -858,7 +900,12 @@ if (is_tsan) {
 if (v8_enable_conservative_stack_scanning) {
   enabled_external_v8_defines += [ "V8_ENABLE_CONSERVATIVE_STACK_SCANNING" ]
 }
-
+if (v8_enable_direct_local) {
+  enabled_external_v8_defines += [ "V8_ENABLE_DIRECT_LOCAL" ]
+}
+if (v8_shortcut_strings_in_minor_ms) {
+  enabled_external_v8_defines += [ "V8_MINORMS_STRING_SHORTCUTTING" ]
+}
 disabled_external_v8_defines = external_v8_defines - enabled_external_v8_defines
 
 # Put defines that are used in public headers here; public headers are
@@ -881,6 +928,7 @@ external_cppgc_defines = [
   "CPPGC_SLIM_WRITE_BARRIER",
   "CPPGC_YOUNG_GENERATION",
   "CPPGC_POINTER_COMPRESSION",
+  "CPPGC_ENABLE_LARGER_CAGE",
 ]
 
 enabled_external_cppgc_defines = []
@@ -908,6 +956,9 @@ if (cppgc_enable_pointer_compression) {
 if (cppgc_enable_2gb_cage) {
   enabled_external_cppgc_defines += [ "CPPGC_2GB_CAGE" ]
 }
+if (cppgc_enable_larger_cage) {
+  enabled_external_cppgc_defines += [ "CPPGC_ENABLE_LARGER_CAGE" ]
+}
 if (cppgc_enable_slim_write_barrier) {
   enabled_external_cppgc_defines += [ "CPPGC_SLIM_WRITE_BARRIER" ]
 }
@@ -954,9 +1005,12 @@ config("features") {
   if (v8_embedder_string != "") {
     defines += [ "V8_EMBEDDER_STRING=\"$v8_embedder_string\"" ]
   }
-  if (v8_enable_disassembler) {
+  if (v8_enable_disassembler || v8_log_builtins_block_count_input != "") {
     defines += [ "ENABLE_DISASSEMBLER" ]
   }
+  if (v8_log_builtins_block_count_input != "") {
+    defines += [ "LOG_BUILTIN_BLOCK_COUNT" ]
+  }
   if (v8_promise_internal_field_count != 0) {
     defines +=
         [ "V8_PROMISE_INTERNAL_FIELD_COUNT=${v8_promise_internal_field_count}" ]
@@ -1125,9 +1179,6 @@ config("features") {
   if (v8_advanced_bigint_algorithms) {
     defines += [ "V8_ADVANCED_BIGINT_ALGORITHMS" ]
   }
-  if (v8_fuchsia_use_vmex_resource) {
-    defines += [ "V8_USE_VMEX_RESOURCE" ]
-  }
   if (v8_expose_memory_corruption_api) {
     defines += [ "V8_EXPOSE_MEMORY_CORRUPTION_API" ]
   }
@@ -1137,8 +1188,8 @@ config("features") {
   if (v8_enable_static_roots) {
     defines += [ "V8_STATIC_ROOTS" ]
   }
-  if (v8_enable_static_root_generation) {
-    defines += [ "V8_STATIC_ROOT_GENERATION" ]
+  if (v8_enable_static_roots_generation) {
+    defines += [ "V8_STATIC_ROOTS_GENERATION" ]
   }
   if (v8_use_zlib) {
     defines += [ "V8_USE_ZLIB" ]
@@ -1152,6 +1203,24 @@ config("features") {
   if (v8_enable_wasm_simd256_revec) {
     defines += [ "V8_ENABLE_WASM_SIMD256_REVEC" ]
   }
+  if (v8_code_pointer_sandboxing) {
+    defines += [ "V8_CODE_POINTER_SANDBOXING" ]
+  }
+  if (v8_enable_maglev_graph_printer) {
+    defines += [ "V8_ENABLE_MAGLEV_GRAPH_PRINTER" ]
+  }
+  if (v8_enable_slow_tracing) {
+    defines += [ "V8_ENABLE_SLOW_TRACING" ]
+  }
+  if (v8_enable_builtin_jump_table_switch) {
+    defines += [ "V8_ENABLE_BUILTIN_JUMP_TABLE_SWITCH" ]
+  }
+  if (v8_enable_direct_handle) {
+    defines += [ "V8_ENABLE_DIRECT_HANDLE" ]
+  }
+  if (v8_enable_extensible_ro_snapshot) {
+    defines += [ "V8_ENABLE_EXTENSIBLE_RO_SNAPSHOT" ]
+  }
 }
 
 config("toolchain") {
@@ -1296,6 +1365,11 @@ config("toolchain") {
     defines += [ "V8_TARGET_ARCH_RISCV32" ]
     defines += [ "__riscv_xlen=32" ]
     defines += [ "CAN_USE_FPU_INSTRUCTIONS" ]
+
+    if (riscv_use_rvv || target_is_simulator) {
+      defines += [ "CAN_USE_RVV_INSTRUCTIONS" ]
+      defines += [ "RVV_VLEN=${riscv_rvv_vlen}" ]
+    }
   }
 
   if (v8_current_cpu == "x86") {
@@ -1384,21 +1458,35 @@ config("toolchain") {
       "-Wmissing-field-initializers",
       "-Wunreachable-code",
 
-      # Google3 enables this warning, so we should also enable it to find issue
-      # earlier. See https://reviews.llvm.org/D56731 for details about this
-      # warning.
-      "-Wctad-maybe-unsupported",
-
       # TODO(v8:12245): Fix shadowing instances and remove.
       "-Wno-shadow",
     ]
 
+    # TODO(fuchsia:127411): Re-enable once FIDL bindings are compatible.
+    if (!is_fuchsia) {
+      # Google3 enables this warning, so we should also enable it to find issue
+      # earlier. See https://reviews.llvm.org/D56731 for details about this
+      # warning.
+      cflags += [ "-Wctad-maybe-unsupported" ]
+    }
+
     if (v8_current_cpu == "x64" || v8_current_cpu == "arm64" ||
         v8_current_cpu == "mips64el" || v8_current_cpu == "riscv64") {
       cflags += [ "-Wshorten-64-to-32" ]
     }
   }
 
+  if (is_clang || !is_win) {
+    cflags += [
+      # On clang and gcc, disable warnings about offsetof being used on
+      # non-standard-layout types. offsetof is only specified for
+      # standard-layout types, but its behaviour on non-standard-layout types is
+      # implementation defined (rather than UB), and our supported compilers
+      # have the expected reasonable behaviour.
+      "-Wno-invalid-offsetof",
+    ]
+  }
+
   if (is_win) {
     cflags += [
       "/wd4245",  # Conversion with signed/unsigned mismatch.
@@ -1560,10 +1648,6 @@ config("toolchain") {
       "/wd4715",  # 'function' : not all control paths return a value'
                   # MSVC does not analyze switch (enum) for completeness.
     ]
-
-    # TODO(https://crbug.com/1377771): Keep MSVC on C++17 until source code is
-    # made compatible with C++20.
-    cflags_cc = [ "/std:c++17" ]
   }
 
   if (!is_clang && !is_win) {
@@ -1653,10 +1737,20 @@ if (v8_postmortem_support) {
       "src/objects/allocation-site-inl.h",
       "src/objects/cell.h",
       "src/objects/cell-inl.h",
+      "src/objects/dependent-code.h",
+      "src/objects/dependent-code-inl.h",
+      "src/objects/bytecode-array.h",
+      "src/objects/bytecode-array-inl.h",
+      "src/objects/abstract-code.h",
+      "src/objects/abstract-code-inl.h",
+      "src/objects/instruction-stream.h",
+      "src/objects/instruction-stream-inl.h",
       "src/objects/code.h",
       "src/objects/code-inl.h",
       "src/objects/data-handler.h",
       "src/objects/data-handler-inl.h",
+      "src/objects/deoptimization-data.h",
+      "src/objects/deoptimization-data-inl.h",
       "src/objects/descriptor-array.h",
       "src/objects/descriptor-array-inl.h",
       "src/objects/feedback-cell.h",
@@ -1668,6 +1762,8 @@ if (v8_postmortem_support) {
       "src/objects/heap-object.h",
       "src/objects/heap-object-inl.h",
       "src/objects/instance-type.h",
+      "src/objects/instance-type-checker.h",
+      "src/objects/instance-type-inl.h",
       "src/objects/js-array-buffer.h",
       "src/objects/js-array-buffer-inl.h",
       "src/objects/js-array.h",
@@ -1715,6 +1811,7 @@ if (v8_postmortem_support) {
       "src/objects/string-inl.h",
       "src/objects/struct.h",
       "src/objects/struct-inl.h",
+      "src/objects/tagged.h",
     ]
 
     outputs = [ "$target_gen_dir/debug-support.cc" ]
@@ -1781,9 +1878,11 @@ torque_files = [
   "src/builtins/iterator.tq",
   "src/builtins/iterator-from.tq",
   "src/builtins/iterator-helpers.tq",
+  "src/builtins/map-groupby.tq",
   "src/builtins/math.tq",
   "src/builtins/number.tq",
   "src/builtins/object-fromentries.tq",
+  "src/builtins/object-groupby.tq",
   "src/builtins/object.tq",
   "src/builtins/promise-abstract-operations.tq",
   "src/builtins/promise-all.tq",
@@ -1791,12 +1890,13 @@ torque_files = [
   "src/builtins/promise-any.tq",
   "src/builtins/promise-constructor.tq",
   "src/builtins/promise-finally.tq",
+  "src/builtins/promise-jobs.tq",
   "src/builtins/promise-misc.tq",
   "src/builtins/promise-race.tq",
   "src/builtins/promise-reaction-job.tq",
   "src/builtins/promise-resolve.tq",
   "src/builtins/promise-then.tq",
-  "src/builtins/promise-jobs.tq",
+  "src/builtins/promise-withresolvers.tq",
   "src/builtins/proxy-constructor.tq",
   "src/builtins/proxy-delete-property.tq",
   "src/builtins/proxy-get-property.tq",
@@ -1819,6 +1919,13 @@ torque_files = [
   "src/builtins/regexp-split.tq",
   "src/builtins/regexp-test.tq",
   "src/builtins/regexp.tq",
+  "src/builtins/set-difference.tq",
+  "src/builtins/set-intersection.tq",
+  "src/builtins/set-is-disjoint-from.tq",
+  "src/builtins/set-is-subset-of.tq",
+  "src/builtins/set-is-superset-of.tq",
+  "src/builtins/set-symmetric-difference.tq",
+  "src/builtins/set-union.tq",
   "src/builtins/string-at.tq",
   "src/builtins/string-endswith.tq",
   "src/builtins/string-html.tq",
@@ -1871,7 +1978,7 @@ torque_files = [
   "src/objects/bigint.tq",
   "src/objects/call-site-info.tq",
   "src/objects/cell.tq",
-  "src/objects/code.tq",
+  "src/objects/bytecode-array.tq",
   "src/objects/contexts.tq",
   "src/objects/data-handler.tq",
   "src/objects/debug-objects.tq",
@@ -1910,6 +2017,7 @@ torque_files = [
   "src/objects/module.tq",
   "src/objects/name.tq",
   "src/objects/oddball.tq",
+  "src/objects/hole.tq",
   "src/objects/ordered-hash-table.tq",
   "src/objects/primitive-heap-object.tq",
   "src/objects/promise.tq",
@@ -1957,7 +2065,10 @@ if (v8_enable_i18n_support) {
 
 if (v8_enable_webassembly) {
   torque_files += [
+    "src/builtins/js-to-wasm.tq",
     "src/builtins/wasm.tq",
+    "src/builtins/wasm-strings.tq",
+    "src/builtins/wasm-to-js.tq",
     "src/debug/debug-wasm-objects.tq",
     "src/wasm/wasm-objects.tq",
   ]
@@ -2081,6 +2192,15 @@ group("v8_maybe_icu") {
   }
 }
 
+group("v8_abseil") {
+  public_deps = [ "//third_party/abseil-cpp:absl" ]
+
+  public_configs = [
+    "//third_party/abseil-cpp:absl_define_config",
+    "//third_party/abseil-cpp:absl_include_config",
+  ]
+}
+
 v8_header_set("torque_runtime_support") {
   visibility = [ ":*" ]
 
@@ -2101,6 +2221,7 @@ v8_source_set("torque_generated_initializers") {
 
   public_deps = [
     ":torque_runtime_support",
+    ":v8_abseil",
     ":v8_maybe_icu",
   ]
 
@@ -2119,6 +2240,18 @@ v8_source_set("torque_generated_initializers") {
   }
 
   configs = [ ":internal_config" ]
+
+  if (v8_symbol_level > 1) {
+    # Symbols cause huge compile time on some bigger torque files, see
+    # https://crbug.com/1472715. Thus remove any symbol configs added in v8.gni
+    # and instead add the "minimal_symbols" config.
+    v8_add_configs -=
+        filter_include(v8_add_configs, [ "//build/config/compiler:*symbols" ])
+    if (v8_symbol_level == symbol_level) {
+      v8_remove_configs += [ "//build/config/compiler:default_symbols" ]
+    }
+    configs += [ "//build/config/compiler:minimal_symbols" ]
+  }
 }
 
 v8_source_set("torque_generated_definitions") {
@@ -2132,7 +2265,10 @@ v8_source_set("torque_generated_definitions") {
     ":v8_tracing",
   ]
 
-  public_deps = [ ":v8_maybe_icu" ]
+  public_deps = [
+    ":v8_abseil",
+    ":v8_maybe_icu",
+  ]
 
   sources = [
     "$target_gen_dir/torque-generated/class-forward-declarations.h",
@@ -2213,6 +2349,15 @@ template("run_mksnapshot") {
       rebase_path("$target_gen_dir/embedded${suffix}.S", root_build_dir),
     ]
 
+    if (v8_log_builtins_block_count_input != "") {
+      args += [
+        "--trace-turbo",
+
+        "--turbo-log-builtins-count-input",
+        v8_log_builtins_block_count_input,
+      ]
+    }
+
     if (v8_enable_builtins_profiling) {
       args += [ "--turbo-profiling" ]
     }
@@ -2224,13 +2369,15 @@ template("run_mksnapshot") {
       args += [
         "--turbo-profiling-input",
         rebase_path(v8_builtins_profiling_log_file, root_build_dir),
+
+        # Replace this with --warn-about-builtin-profile-data to see the full
+        # list of builtins with incompatible profiles.
+        "--abort-on-bad-builtin-profile-data",
       ]
 
-      # Replace this with --warn-about-builtin-profile-data to see the full
-      # list of builtins with incompatible profiles.
-      # TODO(crbug.com/v8/13647): Do not fail for invalid profiles
-      # args += [ "--abort-on-bad-builtin-profile-data" ]
-      args += [ "--warn-about-builtin-profile-data" ]
+      if (!v8_enable_builtins_profiling && v8_enable_builtins_reordering) {
+        args += [ "--reorder-builtins" ]
+      }
     }
 
     # This is needed to distinguish between generating code for the simulator
@@ -2360,69 +2507,158 @@ if (v8_verify_deterministic_mksnapshot) {
   }
 }
 
+if (v8_verify_builtins_compatibility) {
+  # This specifies a separate mksnapshot target for each of:
+  # x86, x64, arm, arm64.
+  hashes = "builtins_hashes_$v8_current_cpu"
+  run_mksnapshot("dump_$v8_current_cpu") {
+    args = [
+      "--dump-builtins-hashes-to-file",
+      hashes,
+    ]
+    embedded_variant = "Default"
+  }
+
+  # This template defines a comparison action for the architecture the pgo
+  # profile is made for (e.g. x64) and the architecture the profile is used
+  # for (e.g. arm64 with toolchain x64_v8_arm64).
+  template("verify_builtins_hashes") {
+    forward_variables_from(invoker,
+                           [
+                             "profile_arch",
+                             "target_arch",
+                           ])
+    profile_toolchain = "//build/toolchain/linux:clang_${profile_arch}"
+    target_toolchain =
+        "//build/toolchain/linux:clang_${profile_arch}_v8_${target_arch}"
+    action("compare_builtins_$target_name") {
+      deps = [
+        ":run_mksnapshot_dump_${profile_arch}($profile_toolchain)",
+        ":run_mksnapshot_dump_${target_arch}($target_toolchain)",
+      ]
+      report_file = "$root_build_dir/builtins_comparison_$target_name"
+      script = "tools/builtins-pgo/assert_builtins_hashes.py"
+      args = [
+        "builtins_hashes_${profile_arch}",
+        "builtins_hashes_${target_arch}",
+        rebase_path(report_file, root_build_dir),
+      ]
+      outputs = [ report_file ]
+    }
+  }
+
+  verify_builtins_hashes("x86_arm") {
+    profile_arch = "x86"
+    target_arch = "arm"
+  }
+
+  verify_builtins_hashes("x64_arm64") {
+    profile_arch = "x64"
+    target_arch = "arm64"
+  }
+
+  group("verify_all_builtins_hashes") {
+    deps = [
+      ":compare_builtins_x64_arm64",
+      ":compare_builtins_x86_arm",
+    ]
+  }
+}
+
 action("v8_dump_build_config") {
   script = "tools/testrunner/utils/dump_build_config.py"
   outputs = [ "$root_out_dir/v8_build_config.json" ]
   is_DEBUG_defined = v8_enable_debugging_features || dcheck_always_on
   is_full_debug = v8_enable_debugging_features && !v8_optimized_debug
+
+  arch = v8_target_cpu
+  if (v8_target_cpu == "x86") {
+    arch = "ia32"
+  }
+
+  mips_arch_variant_var = ""
+  mips_use_msa_var = false
+  if (arch == "mips64" || arch == "mips64el") {
+    mips_arch_variant_var = mips_arch_variant
+    mips_use_msa_var = mips_use_msa
+  }
+
+  js_shared_memory =
+      v8_enable_shared_ro_heap && (!v8_enable_pointer_compression ||
+                                   v8_enable_pointer_compression_shared_cage) &&
+      !v8_disable_write_barriers
+  simd_mips = mips_arch_variant_var == "r6" && mips_use_msa
+  simulator_run = target_cpu != v8_target_cpu
+  use_sanitizer = is_asan || is_cfi || is_msan || is_tsan || is_ubsan
+
+  # This lists all build-time switches consumed by the test framework. All
+  # switches can be used automatically in the status files as is - no
+  # further files need to be modified.
+  #
+  # Naming conventions: Keep switch names short and remove unnecessary
+  # qualifiers. Drop v8_enable_, v8_, is_ where possible.
+  # Keep only qualifiers that disambiguate the switches from other things.
+  # Examples: has_turbofan disambiguates from the turbofan runtime variant,
+  # is_android disambiguates from the android keyword in status files,
+  # v8_cfi disambiguates from the global cfi flag.
   args = [
     rebase_path("$root_out_dir/v8_build_config.json", root_build_dir),
+    "arch=\"$arch\"",
+    "asan=$is_asan",
+    "atomic_object_field_writes=$v8_enable_atomic_object_field_writes",
+    "cet_shadow_stack=$v8_enable_cet_shadow_stack",
+    "cfi=$is_cfi",
+    "clang=$is_clang",
+    "clang_coverage=$use_clang_coverage",
+    "code_comments=$v8_code_comments",
+    "component_build=$is_component_build",
+    "concurrent_marking=$v8_enable_concurrent_marking",
+    "conservative_stack_scanning=$v8_enable_conservative_stack_scanning",
     "current_cpu=\"$current_cpu\"",
     "dcheck_always_on=$dcheck_always_on",
+    "debug_code=$v8_enable_debug_code",
+    "DEBUG_defined=$is_DEBUG_defined",
+    "debugging_features=$v8_enable_debugging_features",
+    "dict_property_const_tracking=$v8_dict_property_const_tracking",
+    "direct_handle=$v8_enable_direct_handle",
+    "direct_local=$v8_enable_direct_local",
+    "disassembler=$v8_enable_disassembler",
+    "full_debug=$is_full_debug",
+    "gdbjit=$v8_enable_gdbjit",
+    "has_jitless=$v8_jitless",
+    "has_maglev=$v8_enable_maglev",
+    "has_turbofan=$v8_enable_turbofan",
+    "has_webassembly=$v8_enable_webassembly",
+    "i18n=$v8_enable_i18n_support",
     "is_android=$is_android",
-    "is_asan=$is_asan",
-    "is_cfi=$is_cfi",
-    "is_clang=$is_clang",
-    "is_clang_coverage=$use_clang_coverage",
-    "is_component_build=$is_component_build",
-    "is_debug=$v8_enable_debugging_features",
-    "is_DEBUG_defined=$is_DEBUG_defined",
-    "is_full_debug=$is_full_debug",
-    "is_msan=$is_msan",
-    "is_tsan=$is_tsan",
-    "is_ubsan_vptr=$is_ubsan_vptr",
+    "is_ios=$is_ios",
+    "js_shared_memory=$js_shared_memory",
+    "lite_mode=$v8_enable_lite_mode",
+    "mips_arch_variant=\"$mips_arch_variant_var\"",
+    "mips_use_msa=$mips_use_msa_var",
+    "msan=$is_msan",
+    "official_build=$is_official_build",
+    "pointer_compression=$v8_enable_pointer_compression",
+    "pointer_compression_shared_cage=$v8_enable_pointer_compression_shared_cage",
+    "runtime_call_stats=$v8_enable_runtime_call_stats",
+    "sandbox=$v8_enable_sandbox",
+    "shared_ro_heap=$v8_enable_shared_ro_heap",
+    "simd_mips=$simd_mips",
+    "simulator_run=$simulator_run",
+    "single_generation=$v8_enable_single_generation",
+    "slow_dchecks=$v8_enable_slow_dchecks",
     "target_cpu=\"$target_cpu\"",
-    "v8_code_comments=$v8_code_comments",
-    "v8_control_flow_integrity=$v8_control_flow_integrity",
+    "third_party_heap=$v8_enable_third_party_heap",
+    "tsan=$is_tsan",
+    "ubsan=$is_ubsan",
+    "use_sanitizer=$use_sanitizer",
+    "v8_cfi=$v8_control_flow_integrity",
     "v8_current_cpu=\"$v8_current_cpu\"",
-    "v8_dict_property_const_tracking=$v8_dict_property_const_tracking",
-    "v8_disable_write_barriers=$v8_disable_write_barriers",
-    "v8_enable_atomic_object_field_writes=" +
-        "$v8_enable_atomic_object_field_writes",
-    "v8_enable_cet_shadow_stack=$v8_enable_cet_shadow_stack",
-    "v8_enable_concurrent_marking=$v8_enable_concurrent_marking",
-    "v8_enable_conservative_stack_scanning=" +
-        "$v8_enable_conservative_stack_scanning",
-    "v8_enable_debug_code=$v8_enable_debug_code",
-    "v8_enable_disassembler=$v8_enable_disassembler",
-    "v8_enable_gdbjit=$v8_enable_gdbjit",
-    "v8_enable_i18n_support=$v8_enable_i18n_support",
-    "v8_enable_lite_mode=$v8_enable_lite_mode",
-    "v8_enable_maglev=$v8_enable_maglev",
-    "v8_enable_pointer_compression=$v8_enable_pointer_compression",
-    "v8_enable_pointer_compression_shared_cage=" +
-        "$v8_enable_pointer_compression_shared_cage",
-    "v8_enable_runtime_call_stats=$v8_enable_runtime_call_stats",
-    "v8_enable_sandbox=$v8_enable_sandbox",
-    "v8_enable_shared_ro_heap=$v8_enable_shared_ro_heap",
-    "v8_enable_single_generation=$v8_enable_single_generation",
-    "v8_enable_slow_dchecks=$v8_enable_slow_dchecks",
-    "v8_enable_third_party_heap=$v8_enable_third_party_heap",
-    "v8_enable_turbofan=$v8_enable_turbofan",
-    "v8_enable_verify_csa=$v8_enable_verify_csa",
-    "v8_enable_verify_heap=$v8_enable_verify_heap",
-    "v8_enable_verify_predictable=$v8_enable_verify_predictable",
-    "v8_enable_webassembly=$v8_enable_webassembly",
-    "v8_jitless=$v8_jitless",
     "v8_target_cpu=\"$v8_target_cpu\"",
+    "verify_csa=$v8_enable_verify_csa",
+    "verify_heap=$v8_enable_verify_heap",
+    "verify_predictable=$v8_enable_verify_predictable",
   ]
-
-  if (v8_current_cpu == "mips64" || v8_current_cpu == "mips64el") {
-    args += [
-      "mips_arch_variant=\"$mips_arch_variant\"",
-      "mips_use_msa=$mips_use_msa",
-    ]
-  }
 }
 
 ###############################################################################
@@ -2467,7 +2703,10 @@ v8_source_set("v8_snapshot") {
 
     sources += [ "src/snapshot/snapshot-external.cc" ]
   } else {
-    public_deps += [ ":v8_maybe_icu" ]
+    public_deps += [
+      ":v8_abseil",
+      ":v8_maybe_icu",
+    ]
 
     sources += [ "$target_gen_dir/snapshot.cc" ]
   }
@@ -2650,7 +2889,10 @@ v8_source_set("v8_init") {
     "src/init/setup-isolate-full.cc",
   ]
 
-  public_deps = [ ":v8_maybe_icu" ]
+  public_deps = [
+    ":v8_abseil",
+    ":v8_maybe_icu",
+  ]
 
   configs = [ ":internal_config" ]
 }
@@ -2672,6 +2914,7 @@ v8_header_set("v8_config_headers") {
 
   sources = [
     "include/v8-platform.h",
+    "include/v8-source-location.h",
     "include/v8config.h",
   ]
 
@@ -2707,6 +2950,7 @@ v8_header_set("v8_headers") {
     "include/v8-forward.h",
     "include/v8-function-callback.h",
     "include/v8-function.h",
+    "include/v8-handle-base.h",
     "include/v8-initialization.h",
     "include/v8-internal.h",
     "include/v8-isolate.h",
@@ -2894,6 +3138,7 @@ v8_header_set("v8_internal_headers") {
     "src/codegen/interface-descriptors-inl.h",
     "src/codegen/interface-descriptors.h",
     "src/codegen/label.h",
+    "src/codegen/linkage-location.h",
     "src/codegen/machine-type.h",
     "src/codegen/macro-assembler-base.h",
     "src/codegen/macro-assembler-inl.h",
@@ -2907,6 +3152,7 @@ v8_header_set("v8_internal_headers") {
     "src/codegen/register.h",
     "src/codegen/reglist-base.h",
     "src/codegen/reglist.h",
+    "src/codegen/reloc-info-inl.h",
     "src/codegen/reloc-info.h",
     "src/codegen/safepoint-table-base.h",
     "src/codegen/safepoint-table.h",
@@ -2941,6 +3187,7 @@ v8_header_set("v8_internal_headers") {
     "src/compiler/backend/gap-resolver.h",
     "src/compiler/backend/instruction-codes.h",
     "src/compiler/backend/instruction-scheduler.h",
+    "src/compiler/backend/instruction-selector-adapter.h",
     "src/compiler/backend/instruction-selector-impl.h",
     "src/compiler/backend/instruction-selector.h",
     "src/compiler/backend/instruction.h",
@@ -2994,6 +3241,7 @@ v8_header_set("v8_internal_headers") {
     "src/compiler/js-create-lowering.h",
     "src/compiler/js-generic-lowering.h",
     "src/compiler/js-graph.h",
+    "src/compiler/js-heap-broker-inl.h",
     "src/compiler/js-heap-broker.h",
     "src/compiler/js-inlining-heuristic.h",
     "src/compiler/js-inlining.h",
@@ -3029,6 +3277,7 @@ v8_header_set("v8_internal_headers") {
     "src/compiler/operator-properties.h",
     "src/compiler/operator.h",
     "src/compiler/osr.h",
+    "src/compiler/pair-load-store-reducer.h",
     "src/compiler/per-isolate-compiler-cache.h",
     "src/compiler/persistent-map.h",
     "src/compiler/phase.h",
@@ -3058,38 +3307,48 @@ v8_header_set("v8_internal_headers") {
     "src/compiler/turboshaft/builtin-call-descriptors.h",
     "src/compiler/turboshaft/dead-code-elimination-phase.h",
     "src/compiler/turboshaft/dead-code-elimination-reducer.h",
+    "src/compiler/turboshaft/debug-feature-lowering-phase.h",
+    "src/compiler/turboshaft/debug-feature-lowering-reducer.h",
     "src/compiler/turboshaft/decompression-optimization-phase.h",
     "src/compiler/turboshaft/decompression-optimization.h",
     "src/compiler/turboshaft/define-assembler-macros.inc",
     "src/compiler/turboshaft/deopt-data.h",
+    "src/compiler/turboshaft/doubly-threaded-list.h",
+    "src/compiler/turboshaft/explicit-truncation-reducer.h",
+    "src/compiler/turboshaft/fast-api-call-reducer.h",
     "src/compiler/turboshaft/fast-hash.h",
     "src/compiler/turboshaft/graph-builder.h",
     "src/compiler/turboshaft/graph-visualizer.h",
     "src/compiler/turboshaft/graph.h",
     "src/compiler/turboshaft/index.h",
+    "src/compiler/turboshaft/instruction-selection-phase.h",
     "src/compiler/turboshaft/late-escape-analysis-reducer.h",
-    "src/compiler/turboshaft/late-optimization-phase.h",
+    "src/compiler/turboshaft/late-load-elimination-reducer.h",
     "src/compiler/turboshaft/layered-hash-map.h",
     "src/compiler/turboshaft/machine-lowering-phase.h",
     "src/compiler/turboshaft/machine-lowering-reducer.h",
     "src/compiler/turboshaft/machine-optimization-reducer.h",
     "src/compiler/turboshaft/memory-optimization-reducer.h",
-    "src/compiler/turboshaft/operation-matching.h",
+    "src/compiler/turboshaft/operation-matcher.h",
     "src/compiler/turboshaft/operations.h",
     "src/compiler/turboshaft/optimization-phase.h",
     "src/compiler/turboshaft/optimize-phase.h",
     "src/compiler/turboshaft/phase.h",
+    "src/compiler/turboshaft/pretenuring-propagation-reducer.h",
     "src/compiler/turboshaft/recreate-schedule-phase.h",
     "src/compiler/turboshaft/recreate-schedule.h",
+    "src/compiler/turboshaft/reduce-args-helper.h",
     "src/compiler/turboshaft/reducer-traits.h",
     "src/compiler/turboshaft/representations.h",
+    "src/compiler/turboshaft/required-optimization-reducer.h",
     "src/compiler/turboshaft/runtime-call-descriptors.h",
     "src/compiler/turboshaft/select-lowering-reducer.h",
     "src/compiler/turboshaft/sidetable.h",
     "src/compiler/turboshaft/simplify-tf-loops.h",
     "src/compiler/turboshaft/snapshot-table.h",
-    "src/compiler/turboshaft/tag-untag-lowering-phase.h",
-    "src/compiler/turboshaft/tag-untag-lowering-reducer.h",
+    "src/compiler/turboshaft/store-store-elimination-phase.h",
+    "src/compiler/turboshaft/store-store-elimination-reducer.h",
+    "src/compiler/turboshaft/structural-optimization-reducer.h",
     "src/compiler/turboshaft/tracing.h",
     "src/compiler/turboshaft/type-assertions-phase.h",
     "src/compiler/turboshaft/type-inference-analysis.h",
@@ -3101,6 +3360,7 @@ v8_header_set("v8_internal_headers") {
     "src/compiler/turboshaft/types.h",
     "src/compiler/turboshaft/undef-assembler-macros.inc",
     "src/compiler/turboshaft/uniform-reducer-adapter.h",
+    "src/compiler/turboshaft/use-map.h",
     "src/compiler/turboshaft/utils.h",
     "src/compiler/turboshaft/value-numbering-reducer.h",
     "src/compiler/turboshaft/variable-reducer.h",
@@ -3133,9 +3393,9 @@ v8_header_set("v8_internal_headers") {
     "src/deoptimizer/deoptimized-frame-info.h",
     "src/deoptimizer/deoptimizer.h",
     "src/deoptimizer/frame-description.h",
+    "src/deoptimizer/frame-translation-builder.h",
     "src/deoptimizer/materialized-object-store.h",
     "src/deoptimizer/translated-state.h",
-    "src/deoptimizer/translation-array.h",
     "src/deoptimizer/translation-opcode.h",
     "src/diagnostics/basic-block-profiler.h",
     "src/diagnostics/code-tracer.h",
@@ -3202,7 +3462,6 @@ v8_header_set("v8_internal_headers") {
     "src/heap/array-buffer-sweeper.h",
     "src/heap/base-space.h",
     "src/heap/basic-memory-chunk.h",
-    "src/heap/code-object-registry.h",
     "src/heap/code-range.h",
     "src/heap/code-stats.h",
     "src/heap/collection-barrier.h",
@@ -3221,6 +3480,7 @@ v8_header_set("v8_internal_headers") {
     "src/heap/cppgc-js/unified-heap-marking-visitor.h",
     "src/heap/cppgc-js/wrappable-info-inl.h",
     "src/heap/cppgc-js/wrappable-info.h",
+    "src/heap/ephemeron-remembered-set.h",
     "src/heap/evacuation-allocator-inl.h",
     "src/heap/evacuation-allocator.h",
     "src/heap/evacuation-verifier-inl.h",
@@ -3248,8 +3508,7 @@ v8_header_set("v8_internal_headers") {
     "src/heap/incremental-marking-job.h",
     "src/heap/incremental-marking.h",
     "src/heap/index-generator.h",
-    "src/heap/invalidated-slots-inl.h",
-    "src/heap/invalidated-slots.h",
+    "src/heap/large-page.h",
     "src/heap/large-spaces.h",
     "src/heap/linear-allocation-area.h",
     "src/heap/list.h",
@@ -3259,8 +3518,10 @@ v8_header_set("v8_internal_headers") {
     "src/heap/local-heap.h",
     "src/heap/mark-compact-inl.h",
     "src/heap/mark-compact.h",
+    "src/heap/mark-sweep-utilities.h",
     "src/heap/marking-barrier-inl.h",
     "src/heap/marking-barrier.h",
+    "src/heap/marking-inl.h",
     "src/heap/marking-state-inl.h",
     "src/heap/marking-state.h",
     "src/heap/marking-visitor-inl.h",
@@ -3269,6 +3530,7 @@ v8_header_set("v8_internal_headers") {
     "src/heap/marking-worklist.h",
     "src/heap/marking.h",
     "src/heap/memory-allocator.h",
+    "src/heap/memory-balancer.h",
     "src/heap/memory-chunk-inl.h",
     "src/heap/memory-chunk-layout.h",
     "src/heap/memory-chunk.h",
@@ -3276,21 +3538,26 @@ v8_header_set("v8_internal_headers") {
     "src/heap/memory-measurement.h",
     "src/heap/memory-reducer.h",
     "src/heap/minor-gc-job.h",
+    "src/heap/minor-mark-sweep-inl.h",
+    "src/heap/minor-mark-sweep.h",
     "src/heap/new-spaces-inl.h",
     "src/heap/new-spaces.h",
     "src/heap/object-lock.h",
     "src/heap/object-stats.h",
     "src/heap/objects-visiting-inl.h",
     "src/heap/objects-visiting.h",
+    "src/heap/page.h",
     "src/heap/paged-spaces-inl.h",
     "src/heap/paged-spaces.h",
     "src/heap/parallel-work-item.h",
+    "src/heap/parked-scope-inl.h",
     "src/heap/parked-scope.h",
     "src/heap/pretenuring-handler-inl.h",
     "src/heap/pretenuring-handler.h",
     "src/heap/progress-bar.h",
     "src/heap/read-only-heap-inl.h",
     "src/heap/read-only-heap.h",
+    "src/heap/read-only-promotion.h",
     "src/heap/read-only-spaces.h",
     "src/heap/remembered-set-inl.h",
     "src/heap/remembered-set.h",
@@ -3303,6 +3570,9 @@ v8_header_set("v8_internal_headers") {
     "src/heap/sweeper.h",
     "src/heap/traced-handles-marking-visitor.h",
     "src/heap/weak-object-worklists.h",
+    "src/heap/young-generation-marking-visitor-inl.h",
+    "src/heap/young-generation-marking-visitor.h",
+    "src/heap/zapping.h",
     "src/ic/call-optimization.h",
     "src/ic/handler-configuration-inl.h",
     "src/ic/handler-configuration.h",
@@ -3421,6 +3691,9 @@ v8_header_set("v8_internal_headers") {
     "src/objects/heap-number.h",
     "src/objects/heap-object-inl.h",
     "src/objects/heap-object.h",
+    "src/objects/hole-inl.h",
+    "src/objects/hole.h",
+    "src/objects/instance-type-checker.h",
     "src/objects/instance-type-inl.h",
     "src/objects/instance-type.h",
     "src/objects/internal-index.h",
@@ -3555,6 +3828,7 @@ v8_header_set("v8_internal_headers") {
     "src/objects/tagged-index.h",
     "src/objects/tagged-value-inl.h",
     "src/objects/tagged-value.h",
+    "src/objects/tagged.h",
     "src/objects/template-objects-inl.h",
     "src/objects/template-objects.h",
     "src/objects/templates-inl.h",
@@ -3639,10 +3913,18 @@ v8_header_set("v8_internal_headers") {
     "src/runtime/runtime.h",
     "src/sandbox/bounded-size-inl.h",
     "src/sandbox/bounded-size.h",
+    "src/sandbox/code-pointer-inl.h",
+    "src/sandbox/code-pointer-table-inl.h",
+    "src/sandbox/code-pointer-table.h",
+    "src/sandbox/code-pointer.h",
+    "src/sandbox/external-entity-table-inl.h",
+    "src/sandbox/external-entity-table.h",
     "src/sandbox/external-pointer-inl.h",
     "src/sandbox/external-pointer-table-inl.h",
     "src/sandbox/external-pointer-table.h",
     "src/sandbox/external-pointer.h",
+    "src/sandbox/indirect-pointer-inl.h",
+    "src/sandbox/indirect-pointer.h",
     "src/sandbox/sandbox.h",
     "src/sandbox/sandboxed-pointer-inl.h",
     "src/sandbox/sandboxed-pointer.h",
@@ -3656,6 +3938,7 @@ v8_header_set("v8_internal_headers") {
     "src/snapshot/embedded/embedded-file-writer-interface.h",
     "src/snapshot/object-deserializer.h",
     "src/snapshot/read-only-deserializer.h",
+    "src/snapshot/read-only-serializer-deserializer.h",
     "src/snapshot/read-only-serializer.h",
     "src/snapshot/references.h",
     "src/snapshot/roots-serializer.h",
@@ -3668,6 +3951,7 @@ v8_header_set("v8_internal_headers") {
     "src/snapshot/snapshot-source-sink.h",
     "src/snapshot/snapshot-utils.h",
     "src/snapshot/snapshot.h",
+    "src/snapshot/sort-builtins.h",
     "src/snapshot/startup-deserializer.h",
     "src/snapshot/startup-serializer.h",
     "src/strings/char-predicates-inl.h",
@@ -3714,9 +3998,9 @@ v8_header_set("v8_internal_headers") {
     "src/zone/type-stats.h",
     "src/zone/zone-allocator.h",
     "src/zone/zone-chunk-list.h",
+    "src/zone/zone-compact-set.h",
     "src/zone/zone-compression.h",
     "src/zone/zone-containers.h",
-    "src/zone/zone-handle-set.h",
     "src/zone/zone-hashmap.h",
     "src/zone/zone-list-inl.h",
     "src/zone/zone-list.h",
@@ -3755,12 +4039,15 @@ v8_header_set("v8_internal_headers") {
       "src/maglev/maglev-ir-inl.h",
       "src/maglev/maglev-ir.h",
       "src/maglev/maglev-phi-representation-selector.h",
+      "src/maglev/maglev-pipeline-statistics.h",
       "src/maglev/maglev-regalloc-data.h",
       "src/maglev/maglev-regalloc.h",
       "src/maglev/maglev-register-frame-array.h",
       "src/maglev/maglev.h",
     ]
-    if (v8_current_cpu == "arm64") {
+    if (v8_current_cpu == "arm") {
+      sources += [ "src/maglev/arm/maglev-assembler-arm-inl.h" ]
+    } else if (v8_current_cpu == "arm64") {
       sources += [ "src/maglev/arm64/maglev-assembler-arm64-inl.h" ]
     } else if (v8_current_cpu == "x64") {
       sources += [ "src/maglev/x64/maglev-assembler-x64-inl.h" ]
@@ -3775,6 +4062,13 @@ v8_header_set("v8_internal_headers") {
       "src/asmjs/asm-scanner.h",
       "src/asmjs/asm-types.h",
       "src/compiler/int64-lowering.h",
+      "src/compiler/turboshaft/int64-lowering-phase.h",
+      "src/compiler/turboshaft/int64-lowering-reducer.h",
+      "src/compiler/turboshaft/wasm-js-lowering-reducer.h",
+      "src/compiler/turboshaft/wasm-lowering-reducer.h",
+      "src/compiler/turboshaft/wasm-optimize-phase.h",
+      "src/compiler/turboshaft/wasm-turboshaft-compiler.h",
+      "src/compiler/wasm-address-reassociation.h",
       "src/compiler/wasm-call-descriptors.h",
       "src/compiler/wasm-compiler-definitions.h",
       "src/compiler/wasm-compiler.h",
@@ -3784,6 +4078,7 @@ v8_header_set("v8_internal_headers") {
       "src/compiler/wasm-graph-assembler.h",
       "src/compiler/wasm-inlining-into-js.h",
       "src/compiler/wasm-inlining.h",
+      "src/compiler/wasm-js-lowering.h",
       "src/compiler/wasm-load-elimination.h",
       "src/compiler/wasm-loop-peeling.h",
       "src/compiler/wasm-typer.h",
@@ -3792,7 +4087,6 @@ v8_header_set("v8_internal_headers") {
       "src/third_party/utf8-decoder/generalized-utf8-decoder.h",
       "src/trap-handler/trap-handler-internal.h",
       "src/trap-handler/trap-handler.h",
-      "src/wasm/assembler-buffer-cache.h",
       "src/wasm/baseline/liftoff-assembler-defs.h",
       "src/wasm/baseline/liftoff-assembler.h",
       "src/wasm/baseline/liftoff-compiler.h",
@@ -3818,12 +4112,15 @@ v8_header_set("v8_internal_headers") {
       "src/wasm/names-provider.h",
       "src/wasm/object-access.h",
       "src/wasm/pgo.h",
+      "src/wasm/serialized-signature-inl.h",
       "src/wasm/simd-shuffle.h",
       "src/wasm/stacks.h",
+      "src/wasm/std-object-sizes.h",
       "src/wasm/streaming-decoder.h",
       "src/wasm/string-builder-multiline.h",
       "src/wasm/string-builder.h",
       "src/wasm/struct-types.h",
+      "src/wasm/turboshaft-graph-interface.h",
       "src/wasm/value-type.h",
       "src/wasm/wasm-arguments.h",
       "src/wasm/wasm-code-manager.h",
@@ -4026,9 +4323,10 @@ v8_header_set("v8_internal_headers") {
       sources += [ "src/execution/arm64/pointer-authentication-arm64.h" ]
     }
     if (v8_enable_webassembly) {
-      # Trap handling is enabled on arm64 Mac and in simulators on x64 on Linux
-      # and Mac.
-      if ((current_cpu == "arm64" && (is_mac || is_ios)) ||
+      # Trap handling is enabled on arm64 Mac and Linux and in simulators on
+      # x64 on Linux and Mac.
+      if ((current_cpu == "arm64" &&
+           (is_linux || is_chromeos || is_mac || is_ios)) ||
           (current_cpu == "x64" && (is_linux || is_chromeos || is_mac))) {
         sources += [ "src/trap-handler/handler-inside-posix.h" ]
       }
@@ -4315,6 +4613,7 @@ v8_compiler_sources = [
   "src/compiler/operator-properties.cc",
   "src/compiler/operator.cc",
   "src/compiler/osr.cc",
+  "src/compiler/pair-load-store-reducer.cc",
   "src/compiler/pipeline-statistics.cc",
   "src/compiler/pipeline.cc",
   "src/compiler/property-access-builder.cc",
@@ -4431,7 +4730,12 @@ if (v8_current_cpu == "x86") {
 if (v8_enable_webassembly) {
   v8_compiler_sources += [
     "src/compiler/int64-lowering.cc",
+    "src/compiler/turboshaft/int64-lowering-phase.cc",
+    "src/compiler/turboshaft/wasm-optimize-phase.cc",
+    "src/compiler/turboshaft/wasm-turboshaft-compiler.cc",
+    "src/compiler/wasm-address-reassociation.cc",
     "src/compiler/wasm-call-descriptors.cc",
+    "src/compiler/wasm-compiler-definitions.cc",
     "src/compiler/wasm-compiler.cc",
     "src/compiler/wasm-escape-analysis.cc",
     "src/compiler/wasm-gc-lowering.cc",
@@ -4439,6 +4743,7 @@ if (v8_enable_webassembly) {
     "src/compiler/wasm-graph-assembler.cc",
     "src/compiler/wasm-inlining-into-js.cc",
     "src/compiler/wasm-inlining.cc",
+    "src/compiler/wasm-js-lowering.cc",
     "src/compiler/wasm-load-elimination.cc",
     "src/compiler/wasm-loop-peeling.cc",
     "src/compiler/wasm-typer.cc",
@@ -4465,6 +4770,7 @@ v8_source_set("v8_compiler_for_mksnapshot_source_set") {
   public_deps = [
     ":generate_bytecode_builtins_list",
     ":run_torque",
+    ":v8_abseil",
     ":v8_maybe_icu",
     ":v8_tracing",
   ]
@@ -4502,6 +4808,7 @@ v8_source_set("v8_compiler") {
   public_deps = [
     ":generate_bytecode_builtins_list",
     ":run_torque",
+    ":v8_abseil",
     ":v8_internal_headers",
     ":v8_maybe_icu",
     ":v8_tracing",
@@ -4524,29 +4831,33 @@ v8_source_set("v8_turboshaft") {
     "src/compiler/turboshaft/assembler.cc",
     "src/compiler/turboshaft/build-graph-phase.cc",
     "src/compiler/turboshaft/dead-code-elimination-phase.cc",
+    "src/compiler/turboshaft/debug-feature-lowering-phase.cc",
     "src/compiler/turboshaft/decompression-optimization-phase.cc",
     "src/compiler/turboshaft/decompression-optimization.cc",
     "src/compiler/turboshaft/graph-builder.cc",
     "src/compiler/turboshaft/graph-visualizer.cc",
     "src/compiler/turboshaft/graph.cc",
+    "src/compiler/turboshaft/instruction-selection-phase.cc",
     "src/compiler/turboshaft/late-escape-analysis-reducer.cc",
-    "src/compiler/turboshaft/late-optimization-phase.cc",
+    "src/compiler/turboshaft/late-load-elimination-reducer.cc",
     "src/compiler/turboshaft/machine-lowering-phase.cc",
     "src/compiler/turboshaft/memory-optimization-reducer.cc",
     "src/compiler/turboshaft/operations.cc",
     "src/compiler/turboshaft/optimization-phase.cc",
     "src/compiler/turboshaft/optimize-phase.cc",
     "src/compiler/turboshaft/phase.cc",
+    "src/compiler/turboshaft/pretenuring-propagation-reducer.cc",
     "src/compiler/turboshaft/recreate-schedule-phase.cc",
     "src/compiler/turboshaft/recreate-schedule.cc",
     "src/compiler/turboshaft/representations.cc",
     "src/compiler/turboshaft/simplify-tf-loops.cc",
-    "src/compiler/turboshaft/tag-untag-lowering-phase.cc",
+    "src/compiler/turboshaft/store-store-elimination-phase.cc",
     "src/compiler/turboshaft/type-assertions-phase.cc",
     "src/compiler/turboshaft/type-parser.cc",
     "src/compiler/turboshaft/typed-optimizations-phase.cc",
     "src/compiler/turboshaft/typer.cc",
     "src/compiler/turboshaft/types.cc",
+    "src/compiler/turboshaft/use-map.cc",
     "src/compiler/turboshaft/utils.cc",
   ]
 
@@ -4704,9 +5015,9 @@ v8_source_set("v8_base_without_compiler") {
     "src/deoptimizer/deoptimize-reason.cc",
     "src/deoptimizer/deoptimized-frame-info.cc",
     "src/deoptimizer/deoptimizer.cc",
+    "src/deoptimizer/frame-translation-builder.cc",
     "src/deoptimizer/materialized-object-store.cc",
     "src/deoptimizer/translated-state.cc",
-    "src/deoptimizer/translation-array.cc",
     "src/diagnostics/basic-block-profiler.cc",
     "src/diagnostics/compilation-statistics.cc",
     "src/diagnostics/disassembler.cc",
@@ -4750,9 +5061,7 @@ v8_source_set("v8_base_without_compiler") {
     "src/handles/traced-handles.cc",
     "src/heap/allocation-observer.cc",
     "src/heap/array-buffer-sweeper.cc",
-    "src/heap/base-space.cc",
     "src/heap/basic-memory-chunk.cc",
-    "src/heap/code-object-registry.cc",
     "src/heap/code-range.cc",
     "src/heap/code-stats.cc",
     "src/heap/collection-barrier.cc",
@@ -4765,6 +5074,7 @@ v8_source_set("v8_base_without_compiler") {
     "src/heap/cppgc-js/unified-heap-marking-state.cc",
     "src/heap/cppgc-js/unified-heap-marking-verifier.cc",
     "src/heap/cppgc-js/unified-heap-marking-visitor.cc",
+    "src/heap/ephemeron-remembered-set.cc",
     "src/heap/evacuation-verifier.cc",
     "src/heap/factory-base.cc",
     "src/heap/factory.cc",
@@ -4781,26 +5091,31 @@ v8_source_set("v8_base_without_compiler") {
     "src/heap/incremental-marking-job.cc",
     "src/heap/incremental-marking.cc",
     "src/heap/index-generator.cc",
-    "src/heap/invalidated-slots.cc",
+    "src/heap/large-page.cc",
     "src/heap/large-spaces.cc",
     "src/heap/local-factory.cc",
     "src/heap/local-heap.cc",
     "src/heap/mark-compact.cc",
+    "src/heap/mark-sweep-utilities.cc",
     "src/heap/marking-barrier.cc",
     "src/heap/marking-worklist.cc",
     "src/heap/marking.cc",
     "src/heap/memory-allocator.cc",
+    "src/heap/memory-balancer.cc",
     "src/heap/memory-chunk-layout.cc",
     "src/heap/memory-chunk.cc",
     "src/heap/memory-measurement.cc",
     "src/heap/memory-reducer.cc",
     "src/heap/minor-gc-job.cc",
+    "src/heap/minor-mark-sweep.cc",
     "src/heap/new-spaces.cc",
     "src/heap/object-stats.cc",
     "src/heap/objects-visiting.cc",
+    "src/heap/page.cc",
     "src/heap/paged-spaces.cc",
     "src/heap/pretenuring-handler.cc",
     "src/heap/read-only-heap.cc",
+    "src/heap/read-only-promotion.cc",
     "src/heap/read-only-spaces.cc",
     "src/heap/safepoint.cc",
     "src/heap/scavenger.cc",
@@ -4810,6 +5125,7 @@ v8_source_set("v8_base_without_compiler") {
     "src/heap/sweeper.cc",
     "src/heap/traced-handles-marking-visitor.cc",
     "src/heap/weak-object-worklists.cc",
+    "src/heap/zapping.cc",
     "src/ic/call-optimization.cc",
     "src/ic/handler-configuration.cc",
     "src/ic/ic-stats.cc",
@@ -4851,19 +5167,25 @@ v8_source_set("v8_base_without_compiler") {
     "src/logging/tracing-flags.cc",
     "src/numbers/conversions.cc",
     "src/numbers/math-random.cc",
+    "src/objects/abstract-code.cc",
     "src/objects/backing-store.cc",
     "src/objects/bigint.cc",
+    "src/objects/bytecode-array.cc",
     "src/objects/call-site-info.cc",
     "src/objects/code-kind.cc",
     "src/objects/code.cc",
     "src/objects/compilation-cache-table.cc",
     "src/objects/contexts.cc",
     "src/objects/debug-objects.cc",
+    "src/objects/deoptimization-data.cc",
+    "src/objects/dependent-code.cc",
     "src/objects/elements-kind.cc",
     "src/objects/elements.cc",
     "src/objects/embedder-data-array.cc",
     "src/objects/feedback-vector.cc",
     "src/objects/field-type.cc",
+    "src/objects/fixed-array.cc",
+    "src/objects/instruction-stream.cc",
     "src/objects/intl-objects.cc",
     "src/objects/js-array-buffer.cc",
     "src/objects/js-atomics-synchronization.cc",
@@ -4996,6 +5318,7 @@ v8_source_set("v8_base_without_compiler") {
     "src/runtime/runtime-typedarray.cc",
     "src/runtime/runtime-weak-refs.cc",
     "src/runtime/runtime.cc",
+    "src/sandbox/code-pointer-table.cc",
     "src/sandbox/external-pointer-table.cc",
     "src/sandbox/sandbox.cc",
     "src/sandbox/testing.cc",
@@ -5016,6 +5339,7 @@ v8_source_set("v8_base_without_compiler") {
     "src/snapshot/snapshot-source-sink.cc",
     "src/snapshot/snapshot-utils.cc",
     "src/snapshot/snapshot.cc",
+    "src/snapshot/sort-builtins.cc",
     "src/snapshot/startup-deserializer.cc",
     "src/snapshot/startup-serializer.cc",
     "src/strings/char-predicates.cc",
@@ -5067,10 +5391,16 @@ v8_source_set("v8_base_without_compiler") {
       "src/maglev/maglev-interpreter-frame-state.cc",
       "src/maglev/maglev-ir.cc",
       "src/maglev/maglev-phi-representation-selector.cc",
+      "src/maglev/maglev-pipeline-statistics.cc",
       "src/maglev/maglev-regalloc.cc",
       "src/maglev/maglev.cc",
     ]
-    if (v8_current_cpu == "arm64") {
+    if (v8_current_cpu == "arm") {
+      sources += [
+        "src/maglev/arm/maglev-assembler-arm.cc",
+        "src/maglev/arm/maglev-ir-arm.cc",
+      ]
+    } else if (v8_current_cpu == "arm64") {
       sources += [
         "src/maglev/arm64/maglev-assembler-arm64.cc",
         "src/maglev/arm64/maglev-ir-arm64.cc",
@@ -5096,7 +5426,6 @@ v8_source_set("v8_base_without_compiler") {
       "src/trap-handler/handler-inside.cc",
       "src/trap-handler/handler-outside.cc",
       "src/trap-handler/handler-shared.cc",
-      "src/wasm/assembler-buffer-cache.cc",
       "src/wasm/baseline/liftoff-assembler.cc",
       "src/wasm/baseline/liftoff-compiler.cc",
       "src/wasm/canonical-types.cc",
@@ -5118,6 +5447,7 @@ v8_source_set("v8_base_without_compiler") {
       "src/wasm/stacks.cc",
       "src/wasm/streaming-decoder.cc",
       "src/wasm/sync-streaming-decoder.cc",
+      "src/wasm/turboshaft-graph-interface.cc",
       "src/wasm/value-type.cc",
       "src/wasm/wasm-code-manager.cc",
       "src/wasm/wasm-debug.cc",
@@ -5126,7 +5456,6 @@ v8_source_set("v8_base_without_compiler") {
       "src/wasm/wasm-external-refs.cc",
       "src/wasm/wasm-features.cc",
       "src/wasm/wasm-import-wrapper-cache.cc",
-      "src/wasm/wasm-init-expr.cc",
       "src/wasm/wasm-js.cc",
       "src/wasm/wasm-module-builder.cc",
       "src/wasm/wasm-module-sourcemap.cc",
@@ -5252,9 +5581,9 @@ v8_source_set("v8_base_without_compiler") {
       "src/regexp/arm64/regexp-macro-assembler-arm64.cc",
     ]
     if (v8_enable_webassembly) {
-      # Trap handling is enabled on arm64 Mac and in simulators on x64 on Linux,
-      # Mac, and Windows.
-      if ((current_cpu == "arm64" && is_apple) ||
+      # Trap handling is enabled on arm64 Mac and Linux and in simulators on
+      # x64 on Linux, Mac, and Windows.
+      if ((current_cpu == "arm64" && (is_linux || is_chromeos || is_apple)) ||
           (current_cpu == "x64" && (is_linux || is_chromeos || is_mac))) {
         sources += [
           "src/trap-handler/handler-inside-posix.cc",
@@ -5430,6 +5759,7 @@ v8_source_set("v8_base_without_compiler") {
     ":cppgc_base",
     ":generate_bytecode_builtins_list",
     ":run_torque",
+    ":v8_abseil",
     ":v8_headers",
     ":v8_internal_headers",
     ":v8_maybe_icu",
@@ -5487,7 +5817,9 @@ v8_source_set("v8_base_without_compiler") {
       v8_current_cpu == "ppc" || v8_current_cpu == "ppc64" ||
       v8_current_cpu == "s390" || v8_current_cpu == "s390x" ||
       v8_current_cpu == "riscv64" || v8_current_cpu == "riscv32") {
-    libs += [ "atomic" ]
+    if (!is_clang) {
+      libs += [ "atomic" ]
+    }
   }
 
   if (v8_enable_vtunetracemark && (is_linux || is_chromeos || is_win)) {
@@ -5497,13 +5829,6 @@ v8_source_set("v8_base_without_compiler") {
     ]
     deps += [ "src/third_party/vtune:v8_vtune_trace_mark" ]
   }
-
-  if (v8_use_perfetto) {
-    sources += [
-      "src/tracing/trace-categories.cc",
-      "src/tracing/trace-categories.h",
-    ]
-  }
 }
 
 group("v8_base") {
@@ -5595,12 +5920,6 @@ v8_source_set("torque_base") {
     "//build/config/compiler:no_rtti",
   ]
 
-  if (is_win && is_asan) {
-    # Due to a bug in ASAN on Windows (chromium:893437), we disable ASAN for
-    # Torque on Windows.
-    remove_configs += [ "//build/config/sanitizers:default_sanitizer_flags" ]
-  }
-
   if (is_debug && !v8_optimized_debug && v8_enable_fast_torque) {
     # The :no_optimize config is added to v8_add_configs in v8.gni.
     remove_configs += [ "//build/config/compiler:no_optimize" ]
@@ -5637,10 +5956,6 @@ v8_source_set("torque_ls_base") {
     "//build/config/compiler:no_exceptions",
     "//build/config/compiler:no_rtti",
   ]
-
-  if (is_win && is_asan) {
-    remove_configs += [ "//build/config/sanitizers:default_sanitizer_flags" ]
-  }
 }
 
 v8_component("v8_libbase") {
@@ -5664,6 +5979,7 @@ v8_component("v8_libbase") {
     "src/base/cpu.h",
     "src/base/debug/stack_trace.cc",
     "src/base/debug/stack_trace.h",
+    "src/base/discriminated-union.h",
     "src/base/division-by-constant.cc",
     "src/base/division-by-constant.h",
     "src/base/emulated-virtual-address-subspace.cc",
@@ -5680,6 +5996,7 @@ v8_component("v8_libbase") {
     "src/base/ieee754.cc",
     "src/base/ieee754.h",
     "src/base/immediate-crash.h",
+    "src/base/intrusive-set.h",
     "src/base/iterator.h",
     "src/base/lazy-instance.h",
     "src/base/logging.cc",
@@ -5740,6 +6057,7 @@ v8_component("v8_libbase") {
     "src/base/sanitizer/lsan.h",
     "src/base/sanitizer/msan.h",
     "src/base/sanitizer/tsan.h",
+    "src/base/small-map.h",
     "src/base/small-vector.h",
     "src/base/string-format.h",
     "src/base/strings.cc",
@@ -5768,6 +6086,8 @@ v8_component("v8_libbase") {
 
   deps = [ ":v8_config_headers" ]
 
+  libs = []
+
   data = []
 
   data_deps = []
@@ -5838,8 +6158,8 @@ v8_component("v8_libbase") {
       "src/base/platform/platform-fuchsia.cc",
     ]
     deps += [
-      "//third_party/fuchsia-sdk/sdk/fidl/fuchsia.kernel",
-      "//third_party/fuchsia-sdk/sdk/pkg/fdio",
+      "//third_party/fuchsia-sdk/sdk/fidl/fuchsia.kernel:fuchsia.kernel_cpp",
+      "//third_party/fuchsia-sdk/sdk/pkg/component_incoming_cpp",
       "//third_party/fuchsia-sdk/sdk/pkg/zx",
     ]
   } else if (is_mac) {
@@ -5858,6 +6178,7 @@ v8_component("v8_libbase") {
     sources += [
       "src/base/debug/stack_trace_win.cc",
       "src/base/platform/platform-win32.cc",
+      "src/base/platform/platform-win32.h",
       "src/base/win32-headers.h",
     ]
 
@@ -5890,7 +6211,9 @@ v8_component("v8_libbase") {
   }
 
   if (v8_current_cpu == "riscv64" || v8_current_cpu == "riscv32") {
-    libs += [ "atomic" ]
+    if (!is_clang) {
+      libs += [ "atomic" ]
+    }
   }
 
   if (is_tsan && !build_with_chromium) {
@@ -5943,6 +6266,8 @@ v8_component("v8_libplatform") {
     "src/libplatform/default-job.h",
     "src/libplatform/default-platform.cc",
     "src/libplatform/default-platform.h",
+    "src/libplatform/default-thread-isolated-allocator.cc",
+    "src/libplatform/default-thread-isolated-allocator.h",
     "src/libplatform/default-worker-threads-task-runner.cc",
     "src/libplatform/default-worker-threads-task-runner.h",
     "src/libplatform/delayed-task-queue.cc",
@@ -5985,14 +6310,7 @@ v8_component("v8_libplatform") {
       "src/libplatform/tracing/trace-writer.cc",
       "src/libplatform/tracing/trace-writer.h",
     ]
-    sources += [
-      "src/libplatform/tracing/trace-event-listener.cc",
-      "src/libplatform/tracing/trace-event-listener.h",
-    ]
-    deps += [
-      # TODO(skyostil): Switch TraceEventListener to protozero.
-      "//third_party/perfetto/protos/perfetto/trace:lite",
-    ]
+    sources += [ "src/libplatform/tracing/trace-event-listener.h" ]
   }
 
   if (v8_enable_system_instrumentation) {
@@ -6005,7 +6323,9 @@ v8_component("v8_libplatform") {
   }
 
   if (v8_current_cpu == "riscv64" || v8_current_cpu == "riscv32") {
-    libs = [ "atomic" ]
+    if (!is_clang) {
+      libs = [ "atomic" ]
+    }
   }
 }
 
@@ -6062,6 +6382,8 @@ v8_header_set("v8_heap_base_headers") {
   sources = [
     "src/heap/base/active-system-pages.h",
     "src/heap/base/basic-slot-set.h",
+    "src/heap/base/bytes.h",
+    "src/heap/base/incremental-marking-schedule.h",
     "src/heap/base/stack.h",
     "src/heap/base/worklist.h",
   ]
@@ -6074,6 +6396,7 @@ v8_header_set("v8_heap_base_headers") {
 v8_source_set("v8_heap_base") {
   sources = [
     "src/heap/base/active-system-pages.cc",
+    "src/heap/base/incremental-marking-schedule.cc",
     "src/heap/base/stack.cc",
     "src/heap/base/worklist.cc",
   ]
@@ -6222,8 +6545,6 @@ v8_source_set("cppgc_base") {
     "src/heap/cppgc/heap-visitor.h",
     "src/heap/cppgc/heap.cc",
     "src/heap/cppgc/heap.h",
-    "src/heap/cppgc/incremental-marking-schedule.cc",
-    "src/heap/cppgc/incremental-marking-schedule.h",
     "src/heap/cppgc/liveness-broker.cc",
     "src/heap/cppgc/liveness-broker.h",
     "src/heap/cppgc/logging.cc",
@@ -6265,7 +6586,6 @@ v8_source_set("cppgc_base") {
     "src/heap/cppgc/raw-heap.h",
     "src/heap/cppgc/remembered-set.cc",
     "src/heap/cppgc/remembered-set.h",
-    "src/heap/cppgc/source-location.cc",
     "src/heap/cppgc/stats-collector.cc",
     "src/heap/cppgc/stats-collector.h",
     "src/heap/cppgc/sweeper.cc",
@@ -6311,6 +6631,13 @@ v8_source_set("cppgc_base") {
   } else {
     public_deps += [ ":v8_tracing" ]
   }
+
+  if (v8_use_perfetto) {
+    sources += [
+      "src/tracing/trace-categories.cc",
+      "src/tracing/trace-categories.h",
+    ]
+  }
 }
 
 if (v8_check_header_includes) {
@@ -6377,6 +6704,9 @@ if (v8_enable_webassembly) {
       ":v8_snapshot",
       "//build/win:default_exe_manifest",
     ]
+    if (v8_enable_vtunejit) {
+      deps += [ "src/third_party/vtune:v8_vtune" ]
+    }
 
     # TODO: v8dll-main.cc equivalent for shared library builds
 
@@ -6490,10 +6820,6 @@ if (current_toolchain == v8_snapshot_toolchain) {
       "//build/config/compiler:no_exceptions",
       "//build/config/compiler:no_rtti",
     ]
-
-    if (is_win && is_asan) {
-      remove_configs += [ "//build/config/sanitizers:default_sanitizer_flags" ]
-    }
   }
 }
 
@@ -6521,10 +6847,6 @@ v8_executable("torque-language-server") {
     "//build/config/compiler:no_exceptions",
     "//build/config/compiler:no_rtti",
   ]
-
-  if (is_win && is_asan) {
-    remove_configs += [ "//build/config/sanitizers:default_sanitizer_flags" ]
-  }
 }
 
 if (v8_enable_i18n_support) {
@@ -6681,7 +7003,6 @@ group("v8_fuzzers") {
     ":v8_simple_inspector_fuzzer",
     ":v8_simple_json_fuzzer",
     ":v8_simple_parser_fuzzer",
-    ":v8_simple_regexp_builtins_fuzzer",
     ":v8_simple_regexp_fuzzer",
   ]
 
@@ -6922,10 +7243,6 @@ if (want_v8_shell) {
       ":internal_config_base",
     ]
 
-    if (is_win && !v8_enable_cet_shadow_stack) {
-      v8_remove_configs += [ "//build/config/compiler:cet_shadow_stack" ]
-    }
-
     deps = [
       ":v8",
       ":v8_libbase",
@@ -6939,7 +7256,9 @@ v8_executable("cppgc_hello_world") {
   sources = [ "samples/cppgc/hello-world.cc" ]
 
   if (v8_current_cpu == "riscv64" || v8_current_cpu == "riscv32") {
-    libs = [ "atomic" ]
+    if (!is_clang) {
+      libs = [ "atomic" ]
+    }
   }
 
   configs = [
@@ -7002,23 +7321,6 @@ v8_source_set("parser_fuzzer") {
 v8_fuzzer("parser_fuzzer") {
 }
 
-v8_source_set("regexp_builtins_fuzzer") {
-  sources = [
-    "test/fuzzer/regexp-builtins.cc",
-    "test/fuzzer/regexp_builtins/mjsunit.js.h",
-  ]
-
-  deps = [ ":fuzzer_support" ]
-
-  configs = [
-    ":external_config",
-    ":internal_config_base",
-  ]
-}
-
-v8_fuzzer("regexp_builtins_fuzzer") {
-}
-
 v8_source_set("regexp_fuzzer") {
   sources = [ "test/fuzzer/regexp.cc" ]
 
@@ -7052,8 +7354,6 @@ if (v8_enable_webassembly) {
     sources = [
       "test/common/flag-utils.h",
       "test/common/wasm/flag-utils.h",
-      "test/common/wasm/wasm-interpreter.cc",
-      "test/common/wasm/wasm-interpreter.h",
       "test/common/wasm/wasm-module-runner.cc",
       "test/common/wasm/wasm-module-runner.h",
     ]
@@ -7067,7 +7367,10 @@ if (v8_enable_webassembly) {
       ":v8_tracing",
     ]
 
-    public_deps = [ ":v8_maybe_icu" ]
+    public_deps = [
+      ":v8_abseil",
+      ":v8_maybe_icu",
+    ]
 
     configs = [
       ":external_config",
@@ -7147,7 +7450,10 @@ if (v8_enable_webassembly) {
       ":wasm_test_common",
     ]
 
-    public_deps = [ ":v8_maybe_icu" ]
+    public_deps = [
+      ":v8_abseil",
+      ":v8_maybe_icu",
+    ]
 
     configs = [
       ":external_config",
diff --git a/deps/v8/COMMON_OWNERS b/deps/v8/COMMON_OWNERS
index b7dc8f2147de77..9e9d51d5835a1d 100644
--- a/deps/v8/COMMON_OWNERS
+++ b/deps/v8/COMMON_OWNERS
@@ -6,6 +6,8 @@ cbruni@chromium.org
 clemensb@chromium.org
 danno@chromium.org
 dinfuehr@chromium.org
+dlehmann@chromium.org
+dmercadier@chromium.org
 ecmziegler@chromium.org
 gdeepti@chromium.org
 hablich@chromium.org
@@ -25,6 +27,7 @@ nicohartmann@chromium.org
 nikolaos@chromium.org
 omerkatz@chromium.org
 pthier@chromium.org
+sroettger@google.com
 syg@chromium.org
 szuend@chromium.org
 tebbi@chromium.org
diff --git a/deps/v8/DEPS b/deps/v8/DEPS
index 05b32b571c84e2..5cffcad442b366 100644
--- a/deps/v8/DEPS
+++ b/deps/v8/DEPS
@@ -14,18 +14,17 @@ vars = {
   #
   # Available images:
   #   Emulation:
-  #   - qemu.x64 (pulls terminal.qemu-x64-release)
-  #   - qemu.arm64 (pulls terminal.qemu-arm64-release)
+  #   - terminal.qemu-x64
+  #   - terminal.qemu-arm64
   #   - workstation.qemu-x64-release
   #   Hardware:
-  #   - generic.x64 (pulls terminal.x64-debug)
-  #   - generic.arm64 (pulls terminal.arm64-debug)
-  #   - chromebook.x64 (pulls terminal.chromebook-x64-debug)
+  #   - minimal.x64
+  #   - core.x64-dfv2
   #
   # Since the images are hundreds of MB, default to only downloading the image
   # most commonly useful for developers. Bots and developers that need to use
   # other images (e.g., qemu.arm64) can override this with additional images.
-  'checkout_fuchsia_boot_images': "qemu.x64",
+  'checkout_fuchsia_boot_images': "terminal.qemu-x64",
   'checkout_fuchsia_product_bundles': '"{checkout_fuchsia_boot_images}" != ""',
 
   'checkout_instrumented_libraries': False,
@@ -50,30 +49,36 @@ vars = {
   'check_v8_header_includes': False,
 
   # By default, download the fuchsia sdk from the public sdk directory.
-  'fuchsia_sdk_cipd_prefix': 'fuchsia/sdk/gn/',
+  'fuchsia_sdk_cipd_prefix': 'fuchsia/sdk/core/',
+
+  # Used for downloading the Fuchsia SDK without running hooks.
+  'checkout_fuchsia_no_hooks': False,
 
   # reclient CIPD package version
-  'reclient_version': 're_client_version:0.99.0.3f95625-gomaip',
+  'reclient_version': 're_client_version:0.113.0.8b45b89-gomaip',
+
+  # This variable is overrided in Chromium's DEPS file.
+  'build_with_chromium': False,
 
   # GN CIPD package version.
-  'gn_version': 'git_revision:41fef642de70ecdcaaa26be96d56a0398f95abd4',
+  'gn_version': 'git_revision:cc56a0f98bb34accd5323316e0292575ff17a5d4',
 
   # ninja CIPD package version
   # https://chrome-infra-packages.appspot.com/p/infra/3pp/tools/ninja
   'ninja_version': 'version:2@1.11.1.chromium.6',
 
   # luci-go CIPD package version.
-  'luci_go': 'git_revision:320bf3ed60cd4d24549d0ea9ee3a94394f2665ce',
+  'luci_go': 'git_revision:fe3cfd422b1012c2c8cf00d65cdb11aa2c26cd66',
 
   # Three lines of non-changing comments so that
   # the commit queue can handle CLs rolling Fuchsia sdk
   # and whatever else without interference from each other.
-  'fuchsia_version': 'version:12.20230322.3.1',
+  'fuchsia_version': 'version:14.20230902.2.1',
 
   # Three lines of non-changing comments so that
   # the commit queue can handle CLs rolling android_sdk_build-tools_version
   # and whatever else without interference from each other.
-  'android_sdk_build-tools_version': '-VRKr36Uw8L_iFqqo9nevIBgNMggND5iWxjidyjnCgsC',
+  'android_sdk_build-tools_version': 'YK9Rzw3fDzMHVzatNN6VlyoD_81amLZpN1AbmkdOd6AC',
   # Three lines of non-changing comments so that
   # the commit queue can handle CLs rolling android_sdk_emulator_version
   # and whatever else without interference from each other.
@@ -89,11 +94,11 @@ vars = {
   # Three lines of non-changing comments so that
   # the commit queue can handle CLs rolling android_sdk_platform-tools_version
   # and whatever else without interference from each other.
-  'android_sdk_platform-tools_version': 'RSI3iwryh7URLGRgJHsCvUxj092woTPnKt4pwFcJ6L8C',
+  'android_sdk_platform-tools_version': 'HWVsGs2HCKgSVv41FsOcsfJbNcB0UFiNrF6Tc4yRArYC',
   # Three lines of non-changing comments so that
   # the commit queue can handle CLs rolling android_sdk_platforms_version
   # and whatever else without interference from each other.
-  'android_sdk_platforms_version': 'eo5KvW6UVor92LwZai8Zulc624BQZoCu-yn7wa1z_YcC',
+  'android_sdk_platforms_version': 'u-bhWbTME6u-DjypTgr3ZikCyeAeU6txkR9ET6Uudc8C',
   # Three lines of non-changing comments so that
   # the commit queue can handle CLs rolling android_sdk_sources_version
   # and whatever else without interference from each other.
@@ -101,18 +106,16 @@ vars = {
   # Three lines of non-changing comments so that
   # the commit queue can handle CLs rolling android_sdk_tools-lint_version
   # and whatever else without interference from each other.
-  'android_sdk_cmdline-tools_version': '3Yn5Sn7BMObm8gsoZCF0loJMKg9_PpgU07G9DObCLdQC',
+  'android_sdk_cmdline-tools_version': 'Sy00LuyBIUJdRGYKwg0zjWH8eAIUvgnnNiPkI8etaZYC',
 }
 
 deps = {
   'base/trace_event/common':
     Var('chromium_url') + '/chromium/src/base/trace_event/common.git' + '@' + '147f65333c38ddd1ebf554e89965c243c8ce50b3',
   'build':
-    Var('chromium_url') + '/chromium/src/build.git' + '@' + '9e9a4341dd24e68cba0f228567a6edbaff1c665b',
+    Var('chromium_url') + '/chromium/src/build.git' + '@' + 'e14e0cc3b60c6ba8901741da3f9c18b7fa983880',
   'buildtools':
-    Var('chromium_url') + '/chromium/src/buildtools.git' + '@' + '0a6c69640f1841d9109eac70a25af310d4c1d8c7',
-  'buildtools/clang_format/script':
-    Var('chromium_url') + '/external/github.com/llvm/llvm-project/clang/tools/clang-format.git' + '@' + 'f97059df7f8b205064625cdb5f97b56668a125ef',
+    Var('chromium_url') + '/chromium/src/buildtools.git' + '@' + 'b2043d4f435131d0a1bdd5342c17753ef9236572',
   'buildtools/linux64': {
     'packages': [
       {
@@ -133,12 +136,6 @@ deps = {
     'dep_type': 'cipd',
     'condition': 'host_os == "mac"',
   },
-  'buildtools/third_party/libc++/trunk':
-    Var('chromium_url') + '/external/github.com/llvm/llvm-project/libcxx.git' + '@' + 'e44019bfac2b2d3ebe1618628884f85c8600e322',
-  'buildtools/third_party/libc++abi/trunk':
-    Var('chromium_url') + '/external/github.com/llvm/llvm-project/libcxxabi.git' + '@' + '9643f2cf13d6935a84a30b7da7de53327733e190',
-  'buildtools/third_party/libunwind/trunk':
-    Var('chromium_url') + '/external/github.com/llvm/llvm-project/libunwind.git' + '@' + '29a6dda8c6588ba4abeafdb21be531e757983e31',
   'buildtools/win': {
     'packages': [
       {
@@ -164,19 +161,15 @@ deps = {
   'test/mozilla/data':
     Var('chromium_url') + '/v8/deps/third_party/mozilla-tests.git' + '@' + 'f6c578a10ea707b1a8ab0b88943fe5115ce2b9be',
   'test/test262/data':
-    Var('chromium_url') + '/external/github.com/tc39/test262.git' + '@' + 'd216cc197269fc41eb6eca14710529c3d6650535',
-  'third_party/android_ndk': {
-    'url': Var('chromium_url') + '/android_ndk.git' + '@' + '8388a2be5421311dc75c5f937aae13d821a27f3d',
-    'condition': 'checkout_android',
-  },
+    Var('chromium_url') + '/external/github.com/tc39/test262.git' + '@' + '9efb4f8e531efbc297680145a7fa67d7415d0a4a',
   'third_party/android_platform': {
-    'url': Var('chromium_url') + '/chromium/src/third_party/android_platform.git' + '@' + '1bf9b932433ebb78828bf3c8cd0ccc86b9ef4787',
+    'url': Var('chromium_url') + '/chromium/src/third_party/android_platform.git' + '@' + '4b4eee2d24ec8002602e1b82d63a586d46507501',
     'condition': 'checkout_android',
   },
   'third_party/android_sdk/public': {
       'packages': [
           {
-              'package': 'chromium/third_party/android_sdk/public/build-tools/33.0.0',
+              'package': 'chromium/third_party/android_sdk/public/build-tools/34.0.0',
               'version': Var('android_sdk_build-tools_version'),
           },
           {
@@ -196,7 +189,7 @@ deps = {
               'version': Var('android_sdk_platform-tools_version'),
           },
           {
-              'package': 'chromium/third_party/android_sdk/public/platforms/android-33',
+              'package': 'chromium/third_party/android_sdk/public/platforms/android-34',
               'version': Var('android_sdk_platforms_version'),
           },
           {
@@ -211,35 +204,57 @@ deps = {
       'condition': 'checkout_android',
       'dep_type': 'cipd',
   },
+  'third_party/android_toolchain/ndk': {
+    'packages': [
+      {
+        'package': 'chromium/third_party/android_toolchain/android_toolchain',
+        'version': 'R_8suM8m0oHbZ1awdxGXvKEFpAOETscbfZxkkMthyk8C',
+      },
+    ],
+    'condition': 'checkout_android',
+    'dep_type': 'cipd',
+  },
   'third_party/catapult': {
-    'url': Var('chromium_url') + '/catapult.git' + '@' + '018d397758e54d6a6d3b6ddf28a1784664d63f83',
+    'url': Var('chromium_url') + '/catapult.git' + '@' + 'f16ca3c78e46cefa982100444844da3fcb25390e',
     'condition': 'checkout_android',
   },
+  'third_party/clang-format/script':
+    Var('chromium_url') + '/external/github.com/llvm/llvm-project/clang/tools/clang-format.git' + '@' + 'e5337933f2951cacd3aeacd238ce4578163ca0b9',
   'third_party/colorama/src': {
     'url': Var('chromium_url') + '/external/colorama.git' + '@' + '3de9f013df4b470069d03d250224062e8cf15c49',
     'condition': 'checkout_android',
   },
+  'third_party/cpu_features/src': {
+    'url': Var('chromium_url') + '/external/github.com/google/cpu_features.git' + '@' + '936b9ab5515dead115606559502e3864958f7f6e',
+    'condition': 'checkout_android',
+  },
   'third_party/depot_tools':
-    Var('chromium_url') + '/chromium/tools/depot_tools.git' + '@' + '479e1e9055020c8d1351bf2194d0a606aeca93d5',
-  'third_party/fuchsia-sdk/sdk': {
-    'packages': [
-        {
-            'package': Var('fuchsia_sdk_cipd_prefix') + '${{platform}}',
-            'version': Var('fuchsia_version'),
-        },
-    ],
+    Var('chromium_url') + '/chromium/tools/depot_tools.git' + '@' + '693e0b312171685d34de77b39bc90b8271ad6541',
+  'third_party/fuchsia-gn-sdk': {
+    'url': Var('chromium_url') + '/chromium/src/third_party/fuchsia-gn-sdk.git' + '@' + 'd1e0ff4350f77c7f6b246ff62c232318a73c8176',
     'condition': 'checkout_fuchsia',
-    'dep_type': 'cipd',
+  },
+  # Exists for rolling the Fuchsia SDK. Check out of the SDK should always
+  # rely on the hook running |update_sdk.py| script below.
+  'third_party/fuchsia-sdk/sdk': {
+      'packages': [
+          {
+              'package': Var('fuchsia_sdk_cipd_prefix') + '${{platform}}',
+              'version': Var('fuchsia_version'),
+          },
+      ],
+      'condition': 'checkout_fuchsia_no_hooks',
+      'dep_type': 'cipd',
   },
   'third_party/google_benchmark/src': {
-    'url': Var('chromium_url') + '/external/github.com/google/benchmark.git' + '@' + 'e8baf2622591569a27615b31372d1e9cc046af10',
+    'url': Var('chromium_url') + '/external/github.com/google/benchmark.git' + '@' + 'b177433f3ee2513b1075140c723d73ab8901790f',
   },
   'third_party/googletest/src':
     Var('chromium_url') + '/external/github.com/google/googletest.git' + '@' + 'af29db7ec28d6df1c7f0f745186884091e602e07',
   'third_party/icu':
-    Var('chromium_url') + '/chromium/deps/icu.git' + '@' + '1e49ac26ddc712b1ab702f69023cbc57e9ae6628',
+    Var('chromium_url') + '/chromium/deps/icu.git' + '@' + '985b9a6f70e13f3db741fed121e4dcc3046ad494',
   'third_party/instrumented_libraries':
-    Var('chromium_url') + '/chromium/src/third_party/instrumented_libraries.git' + '@' + '0f536d22dbed454b1254c7e6d7130eab28fba1fa',
+    Var('chromium_url') + '/chromium/src/third_party/instrumented_libraries.git' + '@' + '032e9c850ab975f7c088a625dcf2256917dbdfa6',
   'third_party/ittapi': {
     # Force checkout ittapi libraries to pass v8 header includes check on
     # bots that has check_v8_header_includes enabled.
@@ -247,13 +262,19 @@ deps = {
     'condition': "checkout_ittapi or check_v8_header_includes",
   },
   'third_party/jinja2':
-    Var('chromium_url') + '/chromium/src/third_party/jinja2.git' + '@' + '264c07d7e64f2874434a3b8039e101ddf1b01e7e',
+    Var('chromium_url') + '/chromium/src/third_party/jinja2.git' + '@' + '515dd10de9bf63040045902a4a310d2ba25213a0',
   'third_party/jsoncpp/source':
     Var('chromium_url') + '/external/github.com/open-source-parsers/jsoncpp.git'+ '@' + '42e892d96e47b1f6e29844cc705e148ec4856448',
+  'third_party/libc++/src':
+    Var('chromium_url') + '/external/github.com/llvm/llvm-project/libcxx.git' + '@' + '84fb809dd6dae36d556dc0bb702c6cc2ce9d4b80',
+  'third_party/libc++abi/src':
+    Var('chromium_url') + '/external/github.com/llvm/llvm-project/libcxxabi.git' + '@' + '331847d7a5e6f8706689cf5d468e6e58c868fa10',
+  'third_party/libunwind/src':
+    Var('chromium_url') + '/external/github.com/llvm/llvm-project/libunwind.git' + '@' + 'a321409e66c212098e755cfae1a978bbcff1ccbb',
   'third_party/logdog/logdog':
     Var('chromium_url') + '/infra/luci/luci-py/client/libs/logdog' + '@' + '0b2078a90f7a638d576b3a7c407d136f2fb62399',
   'third_party/markupsafe':
-    Var('chromium_url') + '/chromium/src/third_party/markupsafe.git' + '@' + '13f4e8c9e206567eeb13bf585406ddc574005748',
+    Var('chromium_url') + '/chromium/src/third_party/markupsafe.git' + '@' + '006709ba3ed87660a17bd4548c45663628f5ed85',
   'third_party/ninja': {
     'packages': [
       {
@@ -265,17 +286,17 @@ deps = {
     'condition': 'host_cpu != "s390" and host_cpu != "ppc"'
   },
   'third_party/perfetto':
-    Var('android_url') + '/platform/external/perfetto.git' + '@' + '0d180f46481a96cbe8340734fa5cdce3bba636c8',
+    Var('android_url') + '/platform/external/perfetto.git' + '@' + '446adf5b7bb431d42838cb0302b27311fa4331cd',
   'third_party/protobuf':
     Var('chromium_url') + '/external/github.com/google/protobuf'+ '@' + '6a59a2ad1f61d9696092f79b6d74368b4d7970a3',
   'third_party/requests': {
-      'url': Var('chromium_url') + '/external/github.com/kennethreitz/requests.git' + '@' + 'refs/tags/v2.23.0',
+      'url': Var('chromium_url') + '/external/github.com/kennethreitz/requests.git' + '@' + 'c7e0fc087ceeadb8b4c84a0953a422c474093d6d',
       'condition': 'checkout_android',
   },
   'third_party/zlib':
-    Var('chromium_url') + '/chromium/src/third_party/zlib.git'+ '@' + '5edb52d4302d7aef232d585ec9ae27ef5c3c5438',
+    Var('chromium_url') + '/chromium/src/third_party/zlib.git'+ '@' + 'f5fd0ad2663e239a31184ad4c9919991dda16f46',
   'tools/clang':
-    Var('chromium_url') + '/chromium/src/tools/clang.git' + '@' + '7a7207a7f2eb0f7f5c9f304a51077a2fd504b3ed',
+    Var('chromium_url') + '/chromium/src/tools/clang.git' + '@' + '9fc887ccded86c9355f1abbe80c651271c59632f',
   'tools/luci-go': {
       'packages': [
         {
@@ -290,6 +311,10 @@ deps = {
       'condition': 'host_cpu != "s390" and host_os != "aix"',
       'dep_type': 'cipd',
   },
+  'third_party/abseil-cpp': {
+    'url': Var('chromium_url') + '/chromium/src/third_party/abseil-cpp.git' + '@' + '7affa303ea4ebf4d4de65b3f20f230c7bb16a2ed',
+    'condition': 'not build_with_chromium',
+  }
 }
 
 include_rules = [
@@ -589,6 +614,17 @@ hooks = [
     'action': ['python3', 'build/util/lastchange.py',
                '-o', 'build/util/LASTCHANGE'],
   },
+  {
+    'name': 'Download Fuchsia SDK from GCS',
+    'pattern': '.',
+    'condition': 'checkout_fuchsia',
+    'action': [
+      'python3',
+      'build/fuchsia/update_sdk.py',
+      '--cipd-prefix={fuchsia_sdk_cipd_prefix}',
+      '--version={fuchsia_version}',
+    ],
+  },
   {
     'name': 'Download Fuchsia system images',
     'pattern': '.',
diff --git a/deps/v8/PRESUBMIT.py b/deps/v8/PRESUBMIT.py
index 5c31d4dfabd776..5d4bf98bcb3ab7 100644
--- a/deps/v8/PRESUBMIT.py
+++ b/deps/v8/PRESUBMIT.py
@@ -433,26 +433,29 @@ def _SkipTreeCheck(input_api, output_api):
 def _CheckCommitMessageBugEntry(input_api, output_api):
   """Check that bug entries are well-formed in commit message."""
   bogus_bug_msg = (
-      'Bogus BUG entry: {}. Please specify the issue tracker prefix and the '
-      'issue number, separated by a colon, e.g. v8:123 or chromium:12345.')
+      'Bogus BUG entry: {}. Please specify prefix:number for v8 or chromium '
+      '(e.g. chromium:12345) or b/number for buganizer.')
   results = []
   for bug in (input_api.change.BUG or '').split(','):
     bug = bug.strip()
     if 'none'.startswith(bug.lower()):
       continue
-    if ':' not in bug:
+    if ':' not in bug and not bug.startswith('b/'):
       try:
-        if int(bug) > 100000:
-          # Rough indicator for current chromium bugs.
-          prefix_guess = 'chromium'
+        if int(bug) > 10000000:
+          results.append(
+            'Buganizer entry requires issue tracker prefix b/{}'.format(bug))
         else:
-          prefix_guess = 'v8'
-        results.append(
-            'BUG entry requires issue tracker prefix, e.g. {}:{}'.format(
-                prefix_guess, bug))
+          if int(bug) > 200000:
+            prefix_guess = 'chromium'
+          else:
+            prefix_guess = 'v8'
+          results.append(
+              'BUG entry requires issue tracker prefix, e.g. {}:{}'.format(
+                  prefix_guess, bug))
       except ValueError:
         results.append(bogus_bug_msg.format(bug))
-    elif not re.match(r'\w+:\d+', bug):
+    elif not re.match(r'\w+[:\/]\d+', bug):
       results.append(bogus_bug_msg.format(bug))
   return [output_api.PresubmitError(r) for r in results]
 
diff --git a/deps/v8/WORKSPACE b/deps/v8/WORKSPACE
index 306aff18091e2e..1c9fc1078d4176 100644
--- a/deps/v8/WORKSPACE
+++ b/deps/v8/WORKSPACE
@@ -34,6 +34,16 @@ pip_install(
     requirements = "//:bazel/requirements.txt",
 )
 
+local_repository(
+  name = "com_google_absl",
+  path = "third_party/abseil-cpp",
+)
+
+bind(
+    name = "absl_optional",
+    actual = "@com_google_absl//absl/types:optional"
+)
+
 new_local_repository(
     name = "com_googlesource_chromium_icu",
     build_file = "bazel/BUILD.icu",
@@ -55,3 +65,17 @@ bind(
     name = "base_trace_event_common",
     actual = "@com_googlesource_chromium_base_trace_event_common//:trace_event_common",
 )
+
+http_archive(
+    name = "intel_ittapi",
+    add_prefix = "third_party/ittapi",
+    build_file = "@//:bazel/BUILD.ittapi",
+    sha256 = "36c42d3f2446ddfaa2d7dfa02dfaa79615933f1a68a72d7e4f1d70de7b56e2c9",
+    strip_prefix = "ittapi-3.24.0",
+    url = "https://github.com/intel/ittapi/archive/refs/tags/v3.24.0.tar.gz",
+)
+
+bind(
+    name = "ittapi",
+    actual = "@intel_ittapi//:lib_ittapi",
+)
diff --git a/deps/v8/bazel/BUILD.ittapi b/deps/v8/bazel/BUILD.ittapi
new file mode 100644
index 00000000000000..5bc1d2bd07edce
--- /dev/null
+++ b/deps/v8/bazel/BUILD.ittapi
@@ -0,0 +1,15 @@
+cc_library(
+    name = "lib_ittapi",
+    srcs = [
+        "third_party/ittapi/include/ittnotify.h",
+        "third_party/ittapi/include/jitprofiling.h",
+        "third_party/ittapi/src/ittnotify/ittnotify_config.h",
+        "third_party/ittapi/src/ittnotify/jitprofiling.c",
+    ],
+    hdrs = [
+        "third_party/ittapi/include/ittnotify.h",
+        "third_party/ittapi/src/ittnotify/ittnotify_types.h",
+    ],
+    copts = ["-Iexternal/intel_ittapi/third_party/ittapi/include"],
+    visibility = ["//visibility:public"],
+)
diff --git a/deps/v8/bazel/defs.bzl b/deps/v8/bazel/defs.bzl
index d4ff96887e7ca7..09844919a5b572 100644
--- a/deps/v8/bazel/defs.bzl
+++ b/deps/v8/bazel/defs.bzl
@@ -308,7 +308,10 @@ def v8_library(
             **kwargs
         )
 
-def _torque_initializers_impl(ctx):
+# Use a single generator target for torque definitions and initializers. We can
+# split the set of outputs by using OutputGroupInfo, that way we do not need to
+# run the torque generator twice.
+def _torque_files_impl(ctx):
     if ctx.workspace_name == "v8":
         v8root = "."
     else:
@@ -327,7 +330,8 @@ def _torque_initializers_impl(ctx):
     args += [f.path for f in ctx.files.srcs]
 
     # Generate/declare output files
-    outs = []
+    defs = []
+    inits = []
     for src in ctx.files.srcs:
         root, _period, _ext = src.path.rpartition(".")
 
@@ -335,107 +339,39 @@ def _torque_initializers_impl(ctx):
         if root[:len(v8root)] == v8root:
             root = root[len(v8root):]
         file = ctx.attr.prefix + "/torque-generated/" + root
-        outs.append(ctx.actions.declare_file(file + "-tq-csa.cc"))
-        outs.append(ctx.actions.declare_file(file + "-tq-csa.h"))
-    outs += [ctx.actions.declare_file(ctx.attr.prefix + "/torque-generated/" + f) for f in ctx.attr.extras]
+        defs.append(ctx.actions.declare_file(file + "-tq-inl.inc"))
+        defs.append(ctx.actions.declare_file(file + "-tq.inc"))
+        defs.append(ctx.actions.declare_file(file + "-tq.cc"))
+        inits.append(ctx.actions.declare_file(file + "-tq-csa.cc"))
+        inits.append(ctx.actions.declare_file(file + "-tq-csa.h"))
+
+    defs += [ctx.actions.declare_file(ctx.attr.prefix + "/torque-generated/" + f) for f in ctx.attr.definition_extras]
+    inits += [ctx.actions.declare_file(ctx.attr.prefix + "/torque-generated/" + f) for f in ctx.attr.initializer_extras]
+    outs = defs + inits
     ctx.actions.run(
         outputs = outs,
         inputs = ctx.files.srcs,
         arguments = args,
         executable = ctx.executable.tool,
-        mnemonic = "GenTorqueInitializers",
-        progress_message = "Generating Torque initializers",
+        mnemonic = "GenTorqueFiles",
+        progress_message = "Generating Torque files",
     )
-    return [DefaultInfo(files = depset(outs))]
-
-_v8_torque_initializers = rule(
-    implementation = _torque_initializers_impl,
-    # cfg = v8_target_cpu_transition,
-    attrs = {
-        "prefix": attr.string(mandatory = True),
-        "srcs": attr.label_list(allow_files = True, mandatory = True),
-        "extras": attr.string_list(),
-        "tool": attr.label(
-            allow_files = True,
-            executable = True,
-            cfg = "exec",
+    return [
+        DefaultInfo(files = depset(outs)),
+        OutputGroupInfo(
+            initializers = depset(inits),
+            definitions = depset(defs),
         ),
-        "args": attr.string_list(),
-    },
-)
-
-def v8_torque_initializers(name, noicu_srcs, icu_srcs, args, extras):
-    _v8_torque_initializers(
-        name = "noicu/" + name,
-        prefix = "noicu",
-        srcs = noicu_srcs,
-        args = args,
-        extras = extras,
-        tool = select({
-            "@v8//bazel/config:v8_target_is_32_bits": ":noicu/torque_non_pointer_compression",
-            "//conditions:default": ":noicu/torque",
-        }),
-    )
-    _v8_torque_initializers(
-        name = "icu/" + name,
-        prefix = "icu",
-        srcs = icu_srcs,
-        args = args,
-        extras = extras,
-        tool = select({
-            "@v8//bazel/config:v8_target_is_32_bits": ":icu/torque_non_pointer_compression",
-            "//conditions:default": ":icu/torque",
-        }),
-    )
-
-def _torque_definitions_impl(ctx):
-    if ctx.workspace_name == "v8":
-        v8root = "."
-    else:
-        v8root = "external/v8"
-
-    # Arguments
-    args = []
-    args += ctx.attr.args
-    args.append("-o")
-    args.append(ctx.bin_dir.path + "/" + v8root + "/" + ctx.attr.prefix + "/torque-generated")
-    args.append("-strip-v8-root")
-    args.append("-v8-root")
-    args.append(v8root)
-
-    # Sources
-    args += [f.path for f in ctx.files.srcs]
-
-    # Generate/declare output files
-    outs = []
-    for src in ctx.files.srcs:
-        root, _period, _ext = src.path.rpartition(".")
-
-        # Strip v8root
-        if root[:len(v8root)] == v8root:
-            root = root[len(v8root):]
-        file = ctx.attr.prefix + "/torque-generated/" + root
-        outs.append(ctx.actions.declare_file(file + "-tq-inl.inc"))
-        outs.append(ctx.actions.declare_file(file + "-tq.inc"))
-        outs.append(ctx.actions.declare_file(file + "-tq.cc"))
-    outs += [ctx.actions.declare_file(ctx.attr.prefix + "/torque-generated/" + f) for f in ctx.attr.extras]
-    ctx.actions.run(
-        outputs = outs,
-        inputs = ctx.files.srcs,
-        arguments = args,
-        executable = ctx.executable.tool,
-        mnemonic = "GenTorqueDefinitions",
-        progress_message = "Generating Torque definitions",
-    )
-    return [DefaultInfo(files = depset(outs))]
+    ]
 
-_v8_torque_definitions = rule(
-    implementation = _torque_definitions_impl,
+_v8_torque_files = rule(
+    implementation = _torque_files_impl,
     # cfg = v8_target_cpu_transition,
     attrs = {
         "prefix": attr.string(mandatory = True),
         "srcs": attr.label_list(allow_files = True, mandatory = True),
-        "extras": attr.string_list(),
+        "definition_extras": attr.string_list(),
+        "initializer_extras": attr.string_list(),
         "tool": attr.label(
             allow_files = True,
             executable = True,
@@ -445,24 +381,26 @@ _v8_torque_definitions = rule(
     },
 )
 
-def v8_torque_definitions(name, noicu_srcs, icu_srcs, args, extras):
-    _v8_torque_definitions(
+def v8_torque_files(name, noicu_srcs, icu_srcs, args, definition_extras, initializer_extras):
+    _v8_torque_files(
         name = "noicu/" + name,
         prefix = "noicu",
         srcs = noicu_srcs,
         args = args,
-        extras = extras,
+        definition_extras = definition_extras,
+        initializer_extras = initializer_extras,
         tool = select({
             "@v8//bazel/config:v8_target_is_32_bits": ":noicu/torque_non_pointer_compression",
             "//conditions:default": ":noicu/torque",
         }),
     )
-    _v8_torque_definitions(
+    _v8_torque_files(
         name = "icu/" + name,
         prefix = "icu",
         srcs = icu_srcs,
         args = args,
-        extras = extras,
+        definition_extras = definition_extras,
+        initializer_extras = initializer_extras,
         tool = select({
             "@v8//bazel/config:v8_target_is_32_bits": ":icu/torque_non_pointer_compression",
             "//conditions:default": ":icu/torque",
@@ -592,51 +530,65 @@ def _json(kv_pairs):
     return content
 
 def build_config_content(cpu, icu):
+    arch = cpu
+    if cpu == 'x86':
+        arch = 'ia32'
     return _json([
+        ("arch", arch),
+        ("asan", "false"),
+        ("atomic_object_field_writes", "false"),
+        ("cfi", "false"),
+        ("clang_coverage", "false"),
+        ("clang", "true"),
+        ("code_comments", "false"),
+        ("component_build", "false"),
+        ("concurrent_marking", "false"),
+        ("conservative_stack_scanning", "false"),
         ("current_cpu", cpu),
         ("dcheck_always_on", "false"),
+        ("debug_code", "false"),
+        ("DEBUG_defined", "false"),
+        ("debugging_features", "false"),
+        ("dict_property_const_tracking", "false"),
+        ("direct_handle", "false"),
+        ("direct_local", "false"),
+        ("disassembler", "false"),
+        ("full_debug", "false"),
+        ("gdbjit", "false"),
+        ("has_jitless", "false"),
+        ("has_maglev", "false"),
+        ("has_turbofan", "true"),
+        ("has_webassembly", "false"),
+        ("i18n", icu),
         ("is_android", "false"),
-        ("is_asan", "false"),
-        ("is_cfi", "false"),
-        ("is_clang", "true"),
-        ("is_clang_coverage", "false"),
-        ("is_component_build", "false"),
-        ("is_debug", "false"),
-        ("is_full_debug", "false"),
-        ("is_msan", "false"),
-        ("is_tsan", "false"),
-        ("is_ubsan_vptr", "false"),
+        ("is_ios", "false"),
+        ("js_shared_memory", "false"),
+        ("lite_mode", "false"),
+        ("mips_arch_variant", '""'),
+        ("mips_use_msa", "false"),
+        ("msan", "false"),
+        ("official_build", "false"),
+        ("pointer_compression_shared_cage", "false"),
+        ("pointer_compression", "true"),
+        ("runtime_call_stats", "false"),
+        ("sandbox", "false"),
+        ("shared_ro_heap", "false"),
+        ("simd_mips", "false"),
+        ("simulator_run", "false"),
+        ("single_generation", "false"),
+        ("slow_dchecks", "false"),
         ("target_cpu", cpu),
+        ("third_party_heap", "false"),
+        ("tsan", "false"),
+        ("ubsan", "false"),
+        ("use_sanitizer", "false"),
+        ("v8_cfi", "false"),
         ("v8_current_cpu", cpu),
-        ("v8_dict_property_const_tracking", "false"),
-        ("v8_enable_atomic_object_field_writes", "false"),
-        ("v8_enable_conservative_stack_scanning", "false"),
-        ("v8_enable_concurrent_marking", "false"),
-        ("v8_enable_i18n_support", icu),
-        ("v8_enable_verify_predictable", "false"),
-        ("v8_enable_verify_csa", "false"),
-        ("v8_enable_lite_mode", "false"),
-        ("v8_enable_runtime_call_stats", "false"),
-        ("v8_enable_pointer_compression", "true"),
-        ("v8_enable_pointer_compression_shared_cage", "false"),
-        ("v8_enable_third_party_heap", "false"),
-        ("v8_enable_webassembly", "false"),
-        ("v8_control_flow_integrity", "false"),
-        ("v8_enable_single_generation", "false"),
-        ("v8_enable_sandbox", "false"),
-        ("v8_enable_shared_ro_heap", "false"),
-        ("v8_disable_write_barriers", "false"),
         ("v8_target_cpu", cpu),
-        ("v8_code_comments", "false"),
-        ("v8_enable_debug_code", "false"),
-        ("v8_enable_verify_heap", "false"),
-        ("v8_enable_slow_dchecks", "false"),
-        ("v8_enable_maglev", "false"),
-        ("v8_enable_turbofan", "true"),
-        ("v8_enable_disassembler", "false"),
-        ("is_DEBUG_defined", "false"),
-        ("v8_enable_gdbjit", "false"),
-        ("v8_jitless", "false"),
+        ("verify_csa", "false"),
+        ("verify_heap", "false"),
+        ("verify_predictable", "false"),
+        ("write_barriers", "false"),
     ])
 
 # TODO(victorgomes): Create a rule (instead of a macro), that can
diff --git a/deps/v8/gni/Info.plist b/deps/v8/gni/Info.plist
new file mode 100644
index 00000000000000..f56ebb9f398942
--- /dev/null
+++ b/deps/v8/gni/Info.plist
@@ -0,0 +1,34 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>CFBundleDevelopmentRegion</key>
+	<string>en</string>
+	<key>CFBundleDisplayName</key>
+	<string>${PRODUCT_NAME}</string>
+	<key>CFBundleExecutable</key>
+	<string>${EXECUTABLE_NAME}</string>
+	<key>CFBundleIdentifier</key>
+	<string>${BUNDLE_IDENTIFIER}</string>
+	<key>CFBundleInfoDictionaryVersion</key>
+	<string>6.0</string>
+	<key>CFBundleName</key>
+	<string>${PRODUCT_NAME}</string>
+	<key>CFBundlePackageType</key>
+	<string>APPL</string>
+	<key>CFBundleShortVersionString</key>
+	<string>1.0</string>
+	<key>CFBundleSignature</key>
+	<string>????</string>
+	<key>CFBundleVersion</key>
+	<string>1.0</string>
+	<key>LSRequiresIPhoneOS</key>
+	<true/>
+	<key>UISupportedInterfaceOrientation</key>
+	<array>
+		<string>UIInterfaceOrientationPortrait</string>
+		<string>UIInterfaceOrientationLandscapeLeft</string>
+		<string>UIInterfaceOrientationLandscapeRight</string>
+	</array>
+</dict>
+</plist>
diff --git a/deps/v8/gni/v8.gni b/deps/v8/gni/v8.gni
index d38f376b94ae4c..e2505eea24ea52 100644
--- a/deps/v8/gni/v8.gni
+++ b/deps/v8/gni/v8.gni
@@ -2,6 +2,7 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
+import("//build/config/chrome_build.gni")
 import("//build/config/compiler/pgo/pgo.gni")
 import("//build/config/gclient_args.gni")
 import("//build/config/ios/config.gni")
@@ -91,12 +92,18 @@ declare_args() {
   # Scan the call stack conservatively during garbage collection.
   v8_enable_conservative_stack_scanning = false
 
+  # Use direct pointers in internal (direct) handles.
+  v8_enable_direct_handle = ""
+
+  # Use direct pointers in local handles.
+  v8_enable_direct_local = false
+
   v8_enable_google_benchmark = false
 
   cppgc_is_standalone = false
 
-  # Enable object names in cppgc for debug purposes.
-  cppgc_enable_object_names = false
+  # Enable object names in cppgc for profiling purposes.
+  cppgc_enable_object_names = is_chrome_for_testing
 
   # Enable young generation in cppgc.
   cppgc_enable_young_generation = false
@@ -114,6 +121,9 @@ declare_args() {
   # due to an increased number of OOMs.
   cppgc_enable_2gb_cage = false
 
+  # Enable support for larger cages, up to 16GB.
+  cppgc_enable_larger_cage = false
+
   # Enable advanced BigInt algorithms, costing about 10-30 KB binary size
   # depending on platform. Disabled on Android to save binary size.
   v8_advanced_bigint_algorithms = !is_android
@@ -131,6 +141,10 @@ declare_args() {
 
   # Location of zlib.
   v8_zlib_path = "//third_party/zlib"
+
+  # Change code emission and runtime features to be CET shadow-stack compliant
+  # (incomplete and experimental).
+  v8_enable_cet_shadow_stack = false
 }
 
 if (v8_use_external_startup_data == "") {
@@ -179,6 +193,12 @@ if (v8_enable_turbofan == "") {
 assert(v8_enable_turbofan || !v8_enable_webassembly,
        "Webassembly is not available when Turbofan is disabled.")
 
+# Direct internal handles are enabled by default if conservative stack scanning
+# is enabled.
+if (v8_enable_direct_handle == "") {
+  v8_enable_direct_handle = v8_enable_conservative_stack_scanning
+}
+
 # Points to // in v8 stand-alone or to //v8/ in chromium. We need absolute
 # paths for all configs in templates as they are shared in different
 # subdirectories.
@@ -283,24 +303,56 @@ template("v8_header_set") {
 }
 
 template("v8_executable") {
-  executable(target_name) {
-    forward_variables_from(invoker,
-                           "*",
-                           [
-                             "configs",
-                             "remove_configs",
-                           ])
-    configs -= v8_remove_configs
-    configs += v8_add_configs
-    if (defined(invoker.remove_configs)) {
-      configs -= invoker.remove_configs
+  if (is_ios) {
+    import("//build/config/ios/rules.gni")
+
+    ios_app_bundle(target_name) {
+      forward_variables_from(invoker,
+                             "*",
+                             [
+                               "configs",
+                               "remove_configs",
+                             ])
+      configs -= v8_remove_configs
+      configs += v8_add_configs
+      if (defined(invoker.remove_configs)) {
+        configs -= invoker.remove_configs
+      }
+      configs += invoker.configs
+      deps += [ v8_path_prefix + ":v8_dump_build_config" ]
+
+      # Provide sensible defaults in case invoker did not define any of those
+      # required variables.
+      if (!defined(info_plist) && !defined(info_plist_target)) {
+        info_plist = v8_path_prefix + "/gni/Info.plist"
+      }
+
+      bundle_identifier = "$ios_app_bundle_id_prefix.chrome.unittests.dev"
     }
-    configs += invoker.configs
-    if (is_linux || is_chromeos) {
-      # For enabling ASLR.
-      ldflags = [ "-pie" ]
+  } else {
+    executable(target_name) {
+      forward_variables_from(invoker,
+                             "*",
+                             [
+                               "configs",
+                               "remove_configs",
+                             ])
+      configs -= v8_remove_configs
+      configs += v8_add_configs
+      if (defined(invoker.remove_configs)) {
+        configs -= invoker.remove_configs
+      }
+      configs += invoker.configs
+      if (is_linux || is_chromeos) {
+        # For enabling ASLR.
+        ldflags = [ "-pie" ]
+      }
+      deps += [ v8_path_prefix + ":v8_dump_build_config" ]
+
+      if (is_win && !v8_enable_cet_shadow_stack) {
+        configs -= [ "//build/config/compiler:cet_shadow_stack" ]
+      }
     }
-    deps += [ v8_path_prefix + ":v8_dump_build_config" ]
   }
 }
 
diff --git a/deps/v8/include/cppgc/DEPS b/deps/v8/include/cppgc/DEPS
index 861d1187ba5501..2ec7ebbd4abd66 100644
--- a/deps/v8/include/cppgc/DEPS
+++ b/deps/v8/include/cppgc/DEPS
@@ -2,6 +2,7 @@ include_rules = [
   "-include",
   "+v8config.h",
   "+v8-platform.h",
+  "+v8-source-location.h",
   "+cppgc",
   "-src",
   "+libplatform/libplatform.h",
diff --git a/deps/v8/include/cppgc/internal/api-constants.h b/deps/v8/include/cppgc/internal/api-constants.h
index 453ab88b461eb7..4e2a637e420560 100644
--- a/deps/v8/include/cppgc/internal/api-constants.h
+++ b/deps/v8/include/cppgc/internal/api-constants.h
@@ -40,13 +40,32 @@ constexpr size_t kGuardPageSize = 4096;
 
 static constexpr size_t kLargeObjectSizeThreshold = kPageSize / 2;
 
+#if defined(CPPGC_POINTER_COMPRESSION)
+#if defined(CPPGC_ENABLE_LARGER_CAGE)
+constexpr unsigned kPointerCompressionShift = 3;
+#else   // !defined(CPPGC_ENABLE_LARGER_CAGE)
+constexpr unsigned kPointerCompressionShift = 1;
+#endif  // !defined(CPPGC_ENABLE_LARGER_CAGE)
+#endif  // !defined(CPPGC_POINTER_COMPRESSION)
+
 #if defined(CPPGC_CAGED_HEAP)
 #if defined(CPPGC_2GB_CAGE)
-constexpr size_t kCagedHeapReservationSize = static_cast<size_t>(2) * kGB;
-#else   // !defined(CPPGC_2GB_CAGE)
-constexpr size_t kCagedHeapReservationSize = static_cast<size_t>(4) * kGB;
+constexpr size_t kCagedHeapDefaultReservationSize =
+    static_cast<size_t>(2) * kGB;
+constexpr size_t kCagedHeapMaxReservationSize =
+    kCagedHeapDefaultReservationSize;
+#else  // !defined(CPPGC_2GB_CAGE)
+constexpr size_t kCagedHeapDefaultReservationSize =
+    static_cast<size_t>(4) * kGB;
+#if defined(CPPGC_POINTER_COMPRESSION)
+constexpr size_t kCagedHeapMaxReservationSize =
+    size_t{1} << (31 + kPointerCompressionShift);
+#else   // !defined(CPPGC_POINTER_COMPRESSION)
+constexpr size_t kCagedHeapMaxReservationSize =
+    kCagedHeapDefaultReservationSize;
+#endif  // !defined(CPPGC_POINTER_COMPRESSION)
 #endif  // !defined(CPPGC_2GB_CAGE)
-constexpr size_t kCagedHeapReservationAlignment = kCagedHeapReservationSize;
+constexpr size_t kCagedHeapReservationAlignment = kCagedHeapMaxReservationSize;
 #endif  // defined(CPPGC_CAGED_HEAP)
 
 static constexpr size_t kDefaultAlignment = sizeof(void*);
diff --git a/deps/v8/include/cppgc/internal/caged-heap-local-data.h b/deps/v8/include/cppgc/internal/caged-heap-local-data.h
index 7d689f87e71da1..1eb87dfb538955 100644
--- a/deps/v8/include/cppgc/internal/caged-heap-local-data.h
+++ b/deps/v8/include/cppgc/internal/caged-heap-local-data.h
@@ -46,7 +46,11 @@ class V8_EXPORT AgeTable final {
   enum class AdjacentCardsPolicy : uint8_t { kConsider, kIgnore };
 
   static constexpr size_t kCardSizeInBytes =
-      api_constants::kCagedHeapReservationSize / kRequiredSize;
+      api_constants::kCagedHeapDefaultReservationSize / kRequiredSize;
+
+  static constexpr size_t CalculateAgeTableSizeForHeapSize(size_t heap_size) {
+    return heap_size / kCardSizeInBytes;
+  }
 
   void SetAge(uintptr_t cage_offset, Age age) {
     table_[card(cage_offset)] = age;
@@ -81,16 +85,18 @@ class V8_EXPORT AgeTable final {
 #endif  // !V8_HAS_BUILTIN_CTZ
     static_assert((1 << kGranularityBits) == kCardSizeInBytes);
     const size_t entry = offset >> kGranularityBits;
-    CPPGC_DCHECK(table_.size() > entry);
+    CPPGC_DCHECK(CagedHeapBase::GetAgeTableSize() > entry);
     return entry;
   }
 
-  std::array<Age, kRequiredSize> table_;
+#if defined(V8_CC_GNU)
+  // gcc disallows flexible arrays in otherwise empty classes.
+  Age table_[0];
+#else   // !defined(V8_CC_GNU)
+  Age table_[];
+#endif  // !defined(V8_CC_GNU)
 };
 
-static_assert(sizeof(AgeTable) == 1 * api_constants::kMB,
-              "Size of AgeTable is 1MB");
-
 #endif  // CPPGC_YOUNG_GENERATION
 
 struct CagedHeapLocalData final {
@@ -98,6 +104,10 @@ struct CagedHeapLocalData final {
     return *reinterpret_cast<CagedHeapLocalData*>(CagedHeapBase::GetBase());
   }
 
+  static constexpr size_t CalculateLocalDataSizeForHeapSize(size_t heap_size) {
+    return AgeTable::CalculateAgeTableSizeForHeapSize(heap_size);
+  }
+
 #if defined(CPPGC_YOUNG_GENERATION)
   AgeTable age_table;
 #endif
diff --git a/deps/v8/include/cppgc/internal/caged-heap.h b/deps/v8/include/cppgc/internal/caged-heap.h
index 4db42aee089b5d..0c987a95447cc6 100644
--- a/deps/v8/include/cppgc/internal/caged-heap.h
+++ b/deps/v8/include/cppgc/internal/caged-heap.h
@@ -33,24 +33,31 @@ class V8_EXPORT CagedHeapBase {
 
   V8_INLINE static bool AreWithinCage(const void* addr1, const void* addr2) {
 #if defined(CPPGC_2GB_CAGE)
-    static constexpr size_t kHalfWordShift = sizeof(uint32_t) * CHAR_BIT - 1;
+    static constexpr size_t kHeapBaseShift = sizeof(uint32_t) * CHAR_BIT - 1;
 #else   //! defined(CPPGC_2GB_CAGE)
-    static constexpr size_t kHalfWordShift = sizeof(uint32_t) * CHAR_BIT;
+#if defined(CPPGC_POINTER_COMPRESSION)
+    static constexpr size_t kHeapBaseShift =
+        31 + api_constants::kPointerCompressionShift;
+#else   // !defined(CPPGC_POINTER_COMPRESSION)
+    static constexpr size_t kHeapBaseShift = sizeof(uint32_t) * CHAR_BIT;
+#endif  // !defined(CPPGC_POINTER_COMPRESSION)
 #endif  //! defined(CPPGC_2GB_CAGE)
-    static_assert((static_cast<size_t>(1) << kHalfWordShift) ==
-                  api_constants::kCagedHeapReservationSize);
+    static_assert((static_cast<size_t>(1) << kHeapBaseShift) ==
+                  api_constants::kCagedHeapMaxReservationSize);
     CPPGC_DCHECK(g_heap_base_);
     return !(((reinterpret_cast<uintptr_t>(addr1) ^ g_heap_base_) |
               (reinterpret_cast<uintptr_t>(addr2) ^ g_heap_base_)) >>
-             kHalfWordShift);
+             kHeapBaseShift);
   }
 
   V8_INLINE static uintptr_t GetBase() { return g_heap_base_; }
+  V8_INLINE static size_t GetAgeTableSize() { return g_age_table_size_; }
 
  private:
   friend class CagedHeap;
 
   static uintptr_t g_heap_base_;
+  static size_t g_age_table_size_;
 };
 
 }  // namespace internal
diff --git a/deps/v8/include/cppgc/internal/gc-info.h b/deps/v8/include/cppgc/internal/gc-info.h
index 08ffd411a8efab..c8cb99acbc0fde 100644
--- a/deps/v8/include/cppgc/internal/gc-info.h
+++ b/deps/v8/include/cppgc/internal/gc-info.h
@@ -24,89 +24,90 @@ struct V8_EXPORT EnsureGCInfoIndexTrait final {
   // Acquires a new GC info object and updates `registered_index` with the index
   // that identifies that new info accordingly.
   template <typename T>
-  V8_INLINE static void EnsureIndex(
+  V8_INLINE static GCInfoIndex EnsureIndex(
       std::atomic<GCInfoIndex>& registered_index) {
-    EnsureGCInfoIndexTraitDispatch<T>{}(registered_index);
+    return EnsureGCInfoIndexTraitDispatch<T>{}(registered_index);
   }
 
  private:
-  template <typename T, bool = std::is_polymorphic<T>::value,
-            bool = FinalizerTrait<T>::HasFinalizer(),
+  template <typename T, bool = FinalizerTrait<T>::HasFinalizer(),
             bool = NameTrait<T>::HasNonHiddenName()>
   struct EnsureGCInfoIndexTraitDispatch;
 
-  static void V8_PRESERVE_MOST
-  EnsureGCInfoIndexPolymorphic(std::atomic<GCInfoIndex>&, TraceCallback,
-                               FinalizationCallback, NameCallback);
-  static void V8_PRESERVE_MOST EnsureGCInfoIndexPolymorphic(
+  static GCInfoIndex V8_PRESERVE_MOST
+  EnsureGCInfoIndex(std::atomic<GCInfoIndex>&, TraceCallback,
+                    FinalizationCallback, NameCallback);
+  static GCInfoIndex V8_PRESERVE_MOST EnsureGCInfoIndex(
       std::atomic<GCInfoIndex>&, TraceCallback, FinalizationCallback);
-  static void V8_PRESERVE_MOST EnsureGCInfoIndexPolymorphic(
-      std::atomic<GCInfoIndex>&, TraceCallback, NameCallback);
-  static void V8_PRESERVE_MOST
-  EnsureGCInfoIndexPolymorphic(std::atomic<GCInfoIndex>&, TraceCallback);
-  static void V8_PRESERVE_MOST
-  EnsureGCInfoIndexNonPolymorphic(std::atomic<GCInfoIndex>&, TraceCallback,
-                                  FinalizationCallback, NameCallback);
-  static void V8_PRESERVE_MOST EnsureGCInfoIndexNonPolymorphic(
-      std::atomic<GCInfoIndex>&, TraceCallback, FinalizationCallback);
-  static void V8_PRESERVE_MOST EnsureGCInfoIndexNonPolymorphic(
-      std::atomic<GCInfoIndex>&, TraceCallback, NameCallback);
-  static void V8_PRESERVE_MOST
-  EnsureGCInfoIndexNonPolymorphic(std::atomic<GCInfoIndex>&, TraceCallback);
+  static GCInfoIndex V8_PRESERVE_MOST
+  EnsureGCInfoIndex(std::atomic<GCInfoIndex>&, TraceCallback, NameCallback);
+  static GCInfoIndex V8_PRESERVE_MOST
+  EnsureGCInfoIndex(std::atomic<GCInfoIndex>&, TraceCallback);
 };
 
-#define DISPATCH(is_polymorphic, has_finalizer, has_non_hidden_name, function) \
-  template <typename T>                                                        \
-  struct EnsureGCInfoIndexTrait::EnsureGCInfoIndexTraitDispatch<               \
-      T, is_polymorphic, has_finalizer, has_non_hidden_name> {                 \
-    V8_INLINE void operator()(std::atomic<GCInfoIndex>& registered_index) {    \
-      function;                                                                \
-    }                                                                          \
+#define DISPATCH(has_finalizer, has_non_hidden_name, function)   \
+  template <typename T>                                          \
+  struct EnsureGCInfoIndexTrait::EnsureGCInfoIndexTraitDispatch< \
+      T, has_finalizer, has_non_hidden_name> {                   \
+    V8_INLINE GCInfoIndex                                        \
+    operator()(std::atomic<GCInfoIndex>& registered_index) {     \
+      return function;                                           \
+    }                                                            \
   };
 
-// --------------------------------------------------------------------- //
-// DISPATCH(is_polymorphic, has_finalizer, has_non_hidden_name, function)
-// --------------------------------------------------------------------- //
-DISPATCH(true, true, true,                                               //
-         EnsureGCInfoIndexPolymorphic(registered_index,                  //
-                                      TraceTrait<T>::Trace,              //
-                                      FinalizerTrait<T>::kCallback,      //
-                                      NameTrait<T>::GetName))            //
-DISPATCH(true, true, false,                                              //
-         EnsureGCInfoIndexPolymorphic(registered_index,                  //
-                                      TraceTrait<T>::Trace,              //
-                                      FinalizerTrait<T>::kCallback))     //
-DISPATCH(true, false, true,                                              //
-         EnsureGCInfoIndexPolymorphic(registered_index,                  //
-                                      TraceTrait<T>::Trace,              //
-                                      NameTrait<T>::GetName))            //
-DISPATCH(true, false, false,                                             //
-         EnsureGCInfoIndexPolymorphic(registered_index,                  //
-                                      TraceTrait<T>::Trace))             //
-DISPATCH(false, true, true,                                              //
-         EnsureGCInfoIndexNonPolymorphic(registered_index,               //
-                                         TraceTrait<T>::Trace,           //
-                                         FinalizerTrait<T>::kCallback,   //
-                                         NameTrait<T>::GetName))         //
-DISPATCH(false, true, false,                                             //
-         EnsureGCInfoIndexNonPolymorphic(registered_index,               //
-                                         TraceTrait<T>::Trace,           //
-                                         FinalizerTrait<T>::kCallback))  //
-DISPATCH(false, false, true,                                             //
-         EnsureGCInfoIndexNonPolymorphic(registered_index,               //
-                                         TraceTrait<T>::Trace,           //
-                                         NameTrait<T>::GetName))         //
-DISPATCH(false, false, false,                                            //
-         EnsureGCInfoIndexNonPolymorphic(registered_index,               //
-                                         TraceTrait<T>::Trace))          //
+// ------------------------------------------------------- //
+// DISPATCH(has_finalizer, has_non_hidden_name, function)  //
+// ------------------------------------------------------- //
+DISPATCH(true, true,                                       //
+         EnsureGCInfoIndex(registered_index,               //
+                           TraceTrait<T>::Trace,           //
+                           FinalizerTrait<T>::kCallback,   //
+                           NameTrait<T>::GetName))         //
+DISPATCH(true, false,                                      //
+         EnsureGCInfoIndex(registered_index,               //
+                           TraceTrait<T>::Trace,           //
+                           FinalizerTrait<T>::kCallback))  //
+DISPATCH(false, true,                                      //
+         EnsureGCInfoIndex(registered_index,               //
+                           TraceTrait<T>::Trace,           //
+                           NameTrait<T>::GetName))         //
+DISPATCH(false, false,                                     //
+         EnsureGCInfoIndex(registered_index,               //
+                           TraceTrait<T>::Trace))          //
 
 #undef DISPATCH
 
+// Trait determines how the garbage collector treats objects wrt. to traversing,
+// finalization, and naming.
+template <typename T>
+struct GCInfoTrait final {
+  V8_INLINE static GCInfoIndex Index() {
+    static_assert(sizeof(T), "T must be fully defined");
+    static std::atomic<GCInfoIndex>
+        registered_index;  // Uses zero initialization.
+    GCInfoIndex index = registered_index.load(std::memory_order_acquire);
+    if (V8_UNLIKELY(!index)) {
+      index = EnsureGCInfoIndexTrait::EnsureIndex<T>(registered_index);
+      CPPGC_DCHECK(index != 0);
+      CPPGC_DCHECK(index == registered_index.load(std::memory_order_acquire));
+    }
+    return index;
+  }
+
+  static constexpr bool CheckCallbacksAreDefined() {
+    // No USE() macro available.
+    (void)static_cast<TraceCallback>(TraceTrait<T>::Trace);
+    (void)static_cast<FinalizationCallback>(FinalizerTrait<T>::kCallback);
+    (void)static_cast<NameCallback>(NameTrait<T>::GetName);
+    return true;
+  }
+};
+
 // Fold types based on finalizer behavior. Note that finalizer characteristics
 // align with trace behavior, i.e., destructors are virtual when trace methods
 // are and vice versa.
 template <typename T, typename ParentMostGarbageCollectedType>
-struct GCInfoFolding {
+struct GCInfoFolding final {
   static constexpr bool kHasVirtualDestructorAtBase =
       std::has_virtual_destructor<ParentMostGarbageCollectedType>::value;
   static constexpr bool kBothTypesAreTriviallyDestructible =
@@ -121,34 +122,24 @@ struct GCInfoFolding {
   static constexpr bool kWantsDetailedObjectNames = false;
 #endif  // !CPPGC_SUPPORTS_OBJECT_NAMES
 
-  // Folding would regresses name resolution when deriving names from C++
-  // class names as it would just folds a name to the base class name.
-  using ResultType = std::conditional_t<(kHasVirtualDestructorAtBase ||
-                                         kBothTypesAreTriviallyDestructible ||
-                                         kHasCustomFinalizerDispatchAtBase) &&
-                                            !kWantsDetailedObjectNames,
-                                        ParentMostGarbageCollectedType, T>;
-};
+  // Always true. Forces the compiler to resolve callbacks which ensures that
+  // both modes don't break without requiring compiling a separate
+  // configuration. Only a single GCInfo (for `ResultType` below) will actually
+  // be instantiated but existence (and well-formedness) of all callbacks is
+  // checked.
+  static constexpr bool kCheckTypeGuardAlwaysTrue =
+      GCInfoTrait<T>::CheckCallbacksAreDefined() &&
+      GCInfoTrait<ParentMostGarbageCollectedType>::CheckCallbacksAreDefined();
 
-// Trait determines how the garbage collector treats objects wrt. to traversing,
-// finalization, and naming.
-template <typename T>
-struct GCInfoTrait final {
-  V8_INLINE static GCInfoIndex Index() {
-    static_assert(sizeof(T), "T must be fully defined");
-    static std::atomic<GCInfoIndex>
-        registered_index;  // Uses zero initialization.
-    GCInfoIndex index = registered_index.load(std::memory_order_acquire);
-    if (V8_UNLIKELY(!index)) {
-      EnsureGCInfoIndexTrait::EnsureIndex<T>(registered_index);
-      // Slow path call uses V8_PRESERVE_MOST which does not support return
-      // values (also preserves RAX). Avoid out parameter by just reloading the
-      // value here which at this point is guaranteed to be set.
-      index = registered_index.load(std::memory_order_acquire);
-      CPPGC_DCHECK(index != 0);
-    }
-    return index;
-  }
+  // Folding would regress name resolution when deriving names from C++
+  // class names as it would just folds a name to the base class name.
+  using ResultType =
+      std::conditional_t<kCheckTypeGuardAlwaysTrue &&
+                             (kHasVirtualDestructorAtBase ||
+                              kBothTypesAreTriviallyDestructible ||
+                              kHasCustomFinalizerDispatchAtBase) &&
+                             !kWantsDetailedObjectNames,
+                         ParentMostGarbageCollectedType, T>;
 };
 
 }  // namespace internal
diff --git a/deps/v8/include/cppgc/internal/member-storage.h b/deps/v8/include/cppgc/internal/member-storage.h
index 3dfafc4b08cd11..61b255ba637a92 100644
--- a/deps/v8/include/cppgc/internal/member-storage.h
+++ b/deps/v8/include/cppgc/internal/member-storage.h
@@ -122,17 +122,22 @@ class V8_TRIVIAL_ABI CompressedPointer final {
   }
 
   static V8_INLINE IntegralType Compress(const void* ptr) {
-    static_assert(
-        SentinelPointer::kSentinelValue == 0b10,
-        "The compression scheme relies on the sentinel encoded as 0b10");
+    static_assert(SentinelPointer::kSentinelValue ==
+                      1 << api_constants::kPointerCompressionShift,
+                  "The compression scheme relies on the sentinel encoded as 1 "
+                  "<< kPointerCompressionShift");
     static constexpr size_t kGigaCageMask =
         ~(api_constants::kCagedHeapReservationAlignment - 1);
+    static constexpr size_t kPointerCompressionShiftMask =
+        (1 << api_constants::kPointerCompressionShift) - 1;
 
     CPPGC_DCHECK(CageBaseGlobal::IsSet());
     const uintptr_t base = CageBaseGlobal::Get();
     CPPGC_DCHECK(!ptr || ptr == kSentinelPointer ||
                  (base & kGigaCageMask) ==
                      (reinterpret_cast<uintptr_t>(ptr) & kGigaCageMask));
+    CPPGC_DCHECK(
+        (reinterpret_cast<uintptr_t>(ptr) & kPointerCompressionShiftMask) == 0);
 
 #if defined(CPPGC_2GB_CAGE)
     // Truncate the pointer.
@@ -140,8 +145,9 @@ class V8_TRIVIAL_ABI CompressedPointer final {
         static_cast<IntegralType>(reinterpret_cast<uintptr_t>(ptr));
 #else   // !defined(CPPGC_2GB_CAGE)
     const auto uptr = reinterpret_cast<uintptr_t>(ptr);
-    // Shift the pointer by one and truncate.
-    auto compressed = static_cast<IntegralType>(uptr >> 1);
+    // Shift the pointer and truncate.
+    auto compressed = static_cast<IntegralType>(
+        uptr >> api_constants::kPointerCompressionShift);
 #endif  // !defined(CPPGC_2GB_CAGE)
     // Normal compressed pointers must have the MSB set.
     CPPGC_DCHECK((!compressed || compressed == kCompressedSentinel) ||
@@ -157,9 +163,10 @@ class V8_TRIVIAL_ABI CompressedPointer final {
 #if defined(CPPGC_2GB_CAGE)
     const uint64_t mask = static_cast<uint64_t>(static_cast<int32_t>(ptr));
 #else   // !defined(CPPGC_2GB_CAGE)
-    // Then, shift the result by one. It's important to shift the unsigned
+    // Then, shift the result. It's important to shift the unsigned
     // value, as otherwise it would result in undefined behavior.
-    const uint64_t mask = static_cast<uint64_t>(static_cast<int32_t>(ptr)) << 1;
+    const uint64_t mask = static_cast<uint64_t>(static_cast<int32_t>(ptr))
+                          << api_constants::kPointerCompressionShift;
 #endif  // !defined(CPPGC_2GB_CAGE)
     return reinterpret_cast<void*>(mask & base);
   }
@@ -170,7 +177,8 @@ class V8_TRIVIAL_ABI CompressedPointer final {
       SentinelPointer::kSentinelValue;
 #else   // !defined(CPPGC_2GB_CAGE)
   static constexpr IntegralType kCompressedSentinel =
-      SentinelPointer::kSentinelValue >> 1;
+      SentinelPointer::kSentinelValue >>
+      api_constants::kPointerCompressionShift;
 #endif  // !defined(CPPGC_2GB_CAGE)
   // All constructors initialize `value_`. Do not add a default value here as it
   // results in a non-atomic write on some builds, even when the atomic version
diff --git a/deps/v8/include/cppgc/member.h b/deps/v8/include/cppgc/member.h
index b6382a02358744..457f163bc78eab 100644
--- a/deps/v8/include/cppgc/member.h
+++ b/deps/v8/include/cppgc/member.h
@@ -597,8 +597,33 @@ using UncompressedMember = internal::BasicMember<
     T, internal::StrongMemberTag, internal::DijkstraWriteBarrierPolicy,
     internal::DefaultMemberCheckingPolicy, internal::RawPointer>;
 
+#if defined(CPPGC_POINTER_COMPRESSION)
+/**
+ * CompressedMember. Default implementation of cppgc::Member on builds with
+ * pointer compression.
+ */
+template <typename T>
+using CompressedMember = internal::BasicMember<
+    T, internal::StrongMemberTag, internal::DijkstraWriteBarrierPolicy,
+    internal::DefaultMemberCheckingPolicy, internal::CompressedPointer>;
+#endif  // defined(CPPGC_POINTER_COMPRESSION)
+
 }  // namespace subtle
 
+namespace internal {
+
+struct Dummy;
+
+static constexpr size_t kSizeOfMember = sizeof(Member<Dummy>);
+static constexpr size_t kSizeOfUncompressedMember =
+    sizeof(subtle::UncompressedMember<Dummy>);
+#if defined(CPPGC_POINTER_COMPRESSION)
+static constexpr size_t kSizeofCompressedMember =
+    sizeof(subtle::CompressedMember<Dummy>);
+#endif  // defined(CPPGC_POINTER_COMPRESSION)
+
+}  // namespace internal
+
 }  // namespace cppgc
 
 #endif  // INCLUDE_CPPGC_MEMBER_H_
diff --git a/deps/v8/include/cppgc/persistent.h b/deps/v8/include/cppgc/persistent.h
index 709f3fd6ab0996..6eb1c659267d96 100644
--- a/deps/v8/include/cppgc/persistent.h
+++ b/deps/v8/include/cppgc/persistent.h
@@ -92,6 +92,7 @@ class BasicPersistent final : public PersistentBase,
   template <typename U, typename OtherWeaknessPolicy,
             typename OtherLocationPolicy, typename OtherCheckingPolicy,
             typename = std::enable_if_t<std::is_base_of<T, U>::value>>
+  // NOLINTNEXTLINE
   BasicPersistent(
       const BasicPersistent<U, OtherWeaknessPolicy, OtherLocationPolicy,
                             OtherCheckingPolicy>& other,
@@ -116,6 +117,7 @@ class BasicPersistent final : public PersistentBase,
             typename MemberWeaknessTag, typename MemberCheckingPolicy,
             typename MemberStorageType,
             typename = std::enable_if_t<std::is_base_of<T, U>::value>>
+  // NOLINTNEXTLINE
   BasicPersistent(const internal::BasicMember<
                       U, MemberBarrierPolicy, MemberWeaknessTag,
                       MemberCheckingPolicy, MemberStorageType>& member,
@@ -180,6 +182,8 @@ class BasicPersistent final : public PersistentBase,
   }
 
   explicit operator bool() const { return Get(); }
+  // Historically we allow implicit conversions to T*.
+  // NOLINTNEXTLINE
   operator T*() const { return Get(); }
   T* operator->() const { return Get(); }
   T& operator*() const { return *Get(); }
diff --git a/deps/v8/include/cppgc/platform.h b/deps/v8/include/cppgc/platform.h
index 5a0a40ec8c0eb0..ae96579dd64e44 100644
--- a/deps/v8/include/cppgc/platform.h
+++ b/deps/v8/include/cppgc/platform.h
@@ -136,8 +136,13 @@ class V8_EXPORT Platform {
  * \param page_allocator The allocator used for maintaining meta data. Must stay
  *   always alive and not change between multiple calls to InitializeProcess. If
  *   no allocator is provided, a default internal version will be used.
+ * \param desired_heap_size Desired amount of virtual address space to reserve
+ *   for the heap, in bytes. Actual size will be clamped to minimum and maximum
+ *   values based on compile-time settings and may be rounded up. If this
+ *   parameter is zero, a default value will be used.
  */
-V8_EXPORT void InitializeProcess(PageAllocator* page_allocator = nullptr);
+V8_EXPORT void InitializeProcess(PageAllocator* page_allocator = nullptr,
+                                 size_t desired_heap_size = 0);
 
 /**
  * Must be called after destroying the last used heap. Some process-global
diff --git a/deps/v8/include/cppgc/sentinel-pointer.h b/deps/v8/include/cppgc/sentinel-pointer.h
index 8dbbab0ebd1f79..bee96c77607428 100644
--- a/deps/v8/include/cppgc/sentinel-pointer.h
+++ b/deps/v8/include/cppgc/sentinel-pointer.h
@@ -7,13 +7,20 @@
 
 #include <cstdint>
 
+#include "cppgc/internal/api-constants.h"
+
 namespace cppgc {
 namespace internal {
 
 // Special tag type used to denote some sentinel member. The semantics of the
 // sentinel is defined by the embedder.
 struct SentinelPointer {
+#if defined(CPPGC_POINTER_COMPRESSION)
+  static constexpr intptr_t kSentinelValue =
+      1 << api_constants::kPointerCompressionShift;
+#else   // !defined(CPPGC_POINTER_COMPRESSION)
   static constexpr intptr_t kSentinelValue = 0b10;
+#endif  // !defined(CPPGC_POINTER_COMPRESSION)
   template <typename T>
   operator T*() const {
     return reinterpret_cast<T*>(kSentinelValue);
diff --git a/deps/v8/include/cppgc/source-location.h b/deps/v8/include/cppgc/source-location.h
index da5a5ede520138..0dc28aedd9b225 100644
--- a/deps/v8/include/cppgc/source-location.h
+++ b/deps/v8/include/cppgc/source-location.h
@@ -5,87 +5,11 @@
 #ifndef INCLUDE_CPPGC_SOURCE_LOCATION_H_
 #define INCLUDE_CPPGC_SOURCE_LOCATION_H_
 
-#include <cstddef>
-#include <string>
-
-#include "v8config.h"  // NOLINT(build/include_directory)
-
-#if defined(__has_builtin)
-#define CPPGC_SUPPORTS_SOURCE_LOCATION                                   \
-  (__has_builtin(__builtin_FUNCTION) && __has_builtin(__builtin_FILE) && \
-   __has_builtin(__builtin_LINE))  // NOLINT
-#elif defined(V8_CC_GNU) && __GNUC__ >= 7
-#define CPPGC_SUPPORTS_SOURCE_LOCATION 1
-#elif defined(V8_CC_INTEL) && __ICC >= 1800
-#define CPPGC_SUPPORTS_SOURCE_LOCATION 1
-#else
-#define CPPGC_SUPPORTS_SOURCE_LOCATION 0
-#endif
+#include "v8-source-location.h"
 
 namespace cppgc {
 
-/**
- * Encapsulates source location information. Mimics C++20's
- * `std::source_location`.
- */
-class V8_EXPORT SourceLocation final {
- public:
-  /**
-   * Construct source location information corresponding to the location of the
-   * call site.
-   */
-#if CPPGC_SUPPORTS_SOURCE_LOCATION
-  static constexpr SourceLocation Current(
-      const char* function = __builtin_FUNCTION(),
-      const char* file = __builtin_FILE(), size_t line = __builtin_LINE()) {
-    return SourceLocation(function, file, line);
-  }
-#else
-  static constexpr SourceLocation Current() { return SourceLocation(); }
-#endif  // CPPGC_SUPPORTS_SOURCE_LOCATION
-
-  /**
-   * Constructs unspecified source location information.
-   */
-  constexpr SourceLocation() = default;
-
-  /**
-   * Returns the name of the function associated with the position represented
-   * by this object, if any.
-   *
-   * \returns the function name as cstring.
-   */
-  constexpr const char* Function() const { return function_; }
-
-  /**
-   * Returns the name of the current source file represented by this object.
-   *
-   * \returns the file name as cstring.
-   */
-  constexpr const char* FileName() const { return file_; }
-
-  /**
-   * Returns the line number represented by this object.
-   *
-   * \returns the line number.
-   */
-  constexpr size_t Line() const { return line_; }
-
-  /**
-   * Returns a human-readable string representing this object.
-   *
-   * \returns a human-readable string representing source location information.
-   */
-  std::string ToString() const;
-
- private:
-  constexpr SourceLocation(const char* function, const char* file, size_t line)
-      : function_(function), file_(file), line_(line) {}
-
-  const char* function_ = nullptr;
-  const char* file_ = nullptr;
-  size_t line_ = 0u;
-};
+using SourceLocation = v8::SourceLocation;
 
 }  // namespace cppgc
 
diff --git a/deps/v8/include/cppgc/trace-trait.h b/deps/v8/include/cppgc/trace-trait.h
index 694fbfdccf4dcb..5fc863d2ebbac5 100644
--- a/deps/v8/include/cppgc/trace-trait.h
+++ b/deps/v8/include/cppgc/trace-trait.h
@@ -53,6 +53,14 @@ struct TraceDescriptor {
   TraceCallback callback;
 };
 
+/**
+ * Callback for getting a TraceDescriptor for a given address.
+ *
+ * \param address Possibly inner address of an object.
+ * \returns a TraceDescriptor for the provided address.
+ */
+using TraceDescriptorCallback = TraceDescriptor (*)(const void* address);
+
 namespace internal {
 
 struct V8_EXPORT TraceTraitFromInnerAddressImpl {
diff --git a/deps/v8/include/cppgc/visitor.h b/deps/v8/include/cppgc/visitor.h
index 9b135e39a0be1c..1d6b39a14fd16a 100644
--- a/deps/v8/include/cppgc/visitor.h
+++ b/deps/v8/include/cppgc/visitor.h
@@ -5,10 +5,13 @@
 #ifndef INCLUDE_CPPGC_VISITOR_H_
 #define INCLUDE_CPPGC_VISITOR_H_
 
+#include <type_traits>
+
 #include "cppgc/custom-space.h"
 #include "cppgc/ephemeron-pair.h"
 #include "cppgc/garbage-collected.h"
 #include "cppgc/internal/logging.h"
+#include "cppgc/internal/member-storage.h"
 #include "cppgc/internal/pointer-policies.h"
 #include "cppgc/liveness-broker.h"
 #include "cppgc/member.h"
@@ -113,6 +116,30 @@ class V8_EXPORT Visitor {
   }
 #endif  // defined(CPPGC_POINTER_COMPRESSION)
 
+  template <typename T>
+  void TraceMultiple(const subtle::UncompressedMember<T>* start, size_t len) {
+    static_assert(sizeof(T), "Pointee type must be fully defined.");
+    static_assert(internal::IsGarbageCollectedOrMixinType<T>::value,
+                  "T must be GarbageCollected or GarbageCollectedMixin type");
+    VisitMultipleUncompressedMember(start, len,
+                                    &TraceTrait<T>::GetTraceDescriptor);
+  }
+
+  template <typename T,
+            std::enable_if_t<!std::is_same_v<
+                Member<T>, subtle::UncompressedMember<T>>>* = nullptr>
+  void TraceMultiple(const Member<T>* start, size_t len) {
+    static_assert(sizeof(T), "Pointee type must be fully defined.");
+    static_assert(internal::IsGarbageCollectedOrMixinType<T>::value,
+                  "T must be GarbageCollected or GarbageCollectedMixin type");
+#if defined(CPPGC_POINTER_COMPRESSION)
+    static_assert(std::is_same_v<Member<T>, subtle::CompressedMember<T>>,
+                  "Member and CompressedMember must be the same.");
+    VisitMultipleCompressedMember(start, len,
+                                  &TraceTrait<T>::GetTraceDescriptor);
+#endif  // defined(CPPGC_POINTER_COMPRESSION)
+  }
+
   /**
    * Trace method for inlined objects that are not allocated themselves but
    * otherwise follow managed heap layout and have a Trace() method.
@@ -131,6 +158,26 @@ class V8_EXPORT Visitor {
     TraceTrait<T>::Trace(this, &object);
   }
 
+  template <typename T>
+  void TraceMultiple(const T* start, size_t len) {
+#if V8_ENABLE_CHECKS
+    // This object is embedded in potentially multiple nested objects. The
+    // outermost object must not be in construction as such objects are (a) not
+    // processed immediately, and (b) only processed conservatively if not
+    // otherwise possible.
+    CheckObjectNotInConstruction(start);
+#endif  // V8_ENABLE_CHECKS
+    for (size_t i = 0; i < len; ++i) {
+      const T* object = &start[i];
+      if constexpr (std::is_polymorphic_v<T>) {
+        // The object's vtable may be uninitialized in which case the object is
+        // not traced.
+        if (*reinterpret_cast<const uintptr_t*>(object) == 0) continue;
+      }
+      TraceTrait<T>::Trace(this, object);
+    }
+  }
+
   /**
    * Registers a weak callback method on the object of type T. See
    * LivenessBroker for an usage example.
@@ -314,6 +361,39 @@ class V8_EXPORT Visitor {
                                   WeakCallback callback, const void* data) {}
   virtual void HandleMovableReference(const void**) {}
 
+  virtual void VisitMultipleUncompressedMember(
+      const void* start, size_t len,
+      TraceDescriptorCallback get_trace_descriptor) {
+    // Default implementation merely delegates to Visit().
+    const char* it = static_cast<const char*>(start);
+    const char* end = it + len * internal::kSizeOfUncompressedMember;
+    for (; it < end; it += internal::kSizeOfUncompressedMember) {
+      const auto* current = reinterpret_cast<const internal::RawPointer*>(it);
+      const void* object = current->LoadAtomic();
+      if (!object) continue;
+
+      Visit(object, get_trace_descriptor(object));
+    }
+  }
+
+#if defined(CPPGC_POINTER_COMPRESSION)
+  virtual void VisitMultipleCompressedMember(
+      const void* start, size_t len,
+      TraceDescriptorCallback get_trace_descriptor) {
+    // Default implementation merely delegates to Visit().
+    const char* it = static_cast<const char*>(start);
+    const char* end = it + len * internal::kSizeofCompressedMember;
+    for (; it < end; it += internal::kSizeofCompressedMember) {
+      const auto* current =
+          reinterpret_cast<const internal::CompressedPointer*>(it);
+      const void* object = current->LoadAtomic();
+      if (!object) continue;
+
+      Visit(object, get_trace_descriptor(object));
+    }
+  }
+#endif  // defined(CPPGC_POINTER_COMPRESSION)
+
  private:
   template <typename T, void (T::*method)(const LivenessBroker&)>
   static void WeakCallbackMethodDelegate(const LivenessBroker& info,
@@ -326,8 +406,7 @@ class V8_EXPORT Visitor {
   template <typename PointerType>
   static void HandleWeak(const LivenessBroker& info, const void* object) {
     const PointerType* weak = static_cast<const PointerType*>(object);
-    auto* raw_ptr = weak->GetFromGC();
-    if (!info.IsHeapObjectAlive(raw_ptr)) {
+    if (!info.IsHeapObjectAlive(weak->GetFromGC())) {
       weak->ClearFromGC();
     }
   }
@@ -413,8 +492,7 @@ class V8_EXPORT RootVisitor {
   template <typename PointerType>
   static void HandleWeak(const LivenessBroker& info, const void* object) {
     const PointerType* weak = static_cast<const PointerType*>(object);
-    auto* raw_ptr = weak->GetFromGC();
-    if (!info.IsHeapObjectAlive(raw_ptr)) {
+    if (!info.IsHeapObjectAlive(weak->GetFromGC())) {
       weak->ClearFromGC();
     }
   }
diff --git a/deps/v8/include/js_protocol.pdl b/deps/v8/include/js_protocol.pdl
index 6285d9b6f24f63..ed6226308c266b 100644
--- a/deps/v8/include/js_protocol.pdl
+++ b/deps/v8/include/js_protocol.pdl
@@ -580,6 +580,7 @@ domain Debugger
         other
         promiseRejection
         XHR
+        step
       # Object containing break-specific auxiliary properties.
       optional object data
       # Hit breakpoints IDs
@@ -631,7 +632,7 @@ domain Debugger
       Runtime.ExecutionContextId executionContextId
       # Content hash of the script, SHA-256.
       string hash
-      # Embedder-specific auxiliary data.
+      # Embedder-specific auxiliary data likely matching {isDefault: boolean, type: 'default'|'isolated'|'worker', frameId: string}
       optional object executionContextAuxData
       # URL of source map associated with script (if any).
       optional string sourceMapURL
@@ -670,7 +671,7 @@ domain Debugger
       Runtime.ExecutionContextId executionContextId
       # Content hash of the script, SHA-256.
       string hash
-      # Embedder-specific auxiliary data.
+      # Embedder-specific auxiliary data likely matching {isDefault: boolean, type: 'default'|'isolated'|'worker', frameId: string}
       optional object executionContextAuxData
       # True, if this script is generated as a result of the live edit operation.
       experimental optional boolean isLiveEdit
@@ -1013,9 +1014,33 @@ domain Runtime
   # Unique script identifier.
   type ScriptId extends string
 
-  # Represents the value serialiazed by the WebDriver BiDi specification
-  # https://w3c.github.io/webdriver-bidi.
-  type WebDriverValue extends object
+  # Represents options for serialization. Overrides `generatePreview`, `returnByValue` and
+  # `generateWebDriverValue`.
+  type SerializationOptions extends object
+    properties
+      enum serialization
+        # Whether the result should be deep-serialized. The result is put into
+        # `deepSerializedValue` and `ObjectId` is provided.
+        deep
+        # Whether the result is expected to be a JSON object which should be sent by value.
+        # The result is put either into `value` or into `unserializableValue`. Synonym of
+        # `returnByValue: true`. Overrides `returnByValue`.
+        json
+        # Only remote object id is put in the result. Same bahaviour as if no
+        # `serializationOptions`, `generatePreview`, `returnByValue` nor `generateWebDriverValue`
+        # are provided.
+        idOnly
+
+      # Deep serialization depth. Default is full depth. Respected only in `deep` serialization mode.
+      optional integer maxDepth
+
+      # Embedder-specific parameters. For example if connected to V8 in Chrome these control DOM
+      # serialization via `maxNodeDepth: integer` and `includeShadowTree: "none" | "open" | "all"`.
+      # Values can be only of type string or integer.
+      optional object additionalParameters
+
+  # Represents deep serialized value.
+  type DeepSerializedValue extends object
     properties
       enum type
         undefined
@@ -1043,6 +1068,10 @@ domain Runtime
         window
       optional any value
       optional string objectId
+      # Set if value reference met more then once during serialization. In such
+      # case, value is provided only to one of the serialized values. Unique
+      # per value in the scope of one CDP call.
+      optional integer weakLocalObjectReference
 
   # Unique object identifier.
   type RemoteObjectId extends string
@@ -1096,8 +1125,10 @@ domain Runtime
       optional UnserializableValue unserializableValue
       # String representation of the object.
       optional string description
-      # WebDriver BiDi representation of the value.
-      experimental optional WebDriverValue webDriverValue
+      # Deprecated. Use `deepSerializedValue` instead. WebDriver BiDi representation of the value.
+      deprecated optional DeepSerializedValue webDriverValue
+      # Deep serialized value.
+      experimental optional DeepSerializedValue deepSerializedValue
       # Unique object identifier (for non-primitive values).
       optional RemoteObjectId objectId
       # Preview containing abbreviated property values. Specified for `object` type values only.
@@ -1283,7 +1314,7 @@ domain Runtime
       # multiple processes, so can be reliably used to identify specific context while backend
       # performs a cross-process navigation.
       experimental string uniqueId
-      # Embedder-specific auxiliary data.
+      # Embedder-specific auxiliary data likely matching {isDefault: boolean, type: 'default'|'isolated'|'worker', frameId: string}
       optional object auxData
 
   # Detailed information about exception (or error) that was thrown during script compilation or
@@ -1387,6 +1418,7 @@ domain Runtime
       # execution. Overrides `setPauseOnException` state.
       optional boolean silent
       # Whether the result is expected to be a JSON object which should be sent by value.
+      # Can be overriden by `serializationOptions`.
       optional boolean returnByValue
       # Whether preview should be generated for the result.
       experimental optional boolean generatePreview
@@ -1410,10 +1442,15 @@ domain Runtime
       # boundaries).
       # This is mutually exclusive with `executionContextId`.
       experimental optional string uniqueContextId
+      # Deprecated. Use `serializationOptions: {serialization:"deep"}` instead.
       # Whether the result should contain `webDriverValue`, serialized according to
       # https://w3c.github.io/webdriver-bidi. This is mutually exclusive with `returnByValue`, but
       # resulting `objectId` is still provided.
-      experimental optional boolean generateWebDriverValue
+      deprecated optional boolean generateWebDriverValue
+      # Specifies the result serialization. If provided, overrides
+      # `generatePreview`, `returnByValue` and `generateWebDriverValue`.
+      experimental optional SerializationOptions serializationOptions
+
     returns
       # Call result.
       RemoteObject result
@@ -1499,8 +1536,15 @@ domain Runtime
       # boundaries).
       # This is mutually exclusive with `contextId`.
       experimental optional string uniqueContextId
-      # Whether the result should be serialized according to https://w3c.github.io/webdriver-bidi.
-      experimental optional boolean generateWebDriverValue
+      # Deprecated. Use `serializationOptions: {serialization:"deep"}` instead.
+      # Whether the result should contain `webDriverValue`, serialized
+      # according to
+      # https://w3c.github.io/webdriver-bidi. This is mutually exclusive with `returnByValue`, but
+      # resulting `objectId` is still provided.
+      deprecated optional boolean generateWebDriverValue
+      # Specifies the result serialization. If provided, overrides
+      # `generatePreview`, `returnByValue` and `generateWebDriverValue`.
+      experimental optional SerializationOptions serializationOptions
     returns
       # Evaluation result.
       RemoteObject result
diff --git a/deps/v8/include/libplatform/libplatform.h b/deps/v8/include/libplatform/libplatform.h
index 9ec60c04f9cce6..6a34f4324106c6 100644
--- a/deps/v8/include/libplatform/libplatform.h
+++ b/deps/v8/include/libplatform/libplatform.h
@@ -23,6 +23,8 @@ enum class MessageLoopBehavior : bool {
   kWaitForWork = true
 };
 
+enum class PriorityMode : bool { kDontApply, kApply };
+
 /**
  * Returns a new instance of the default v8::Platform implementation.
  *
@@ -35,13 +37,17 @@ enum class MessageLoopBehavior : bool {
  * calling v8::platform::RunIdleTasks to process the idle tasks.
  * If |tracing_controller| is nullptr, the default platform will create a
  * v8::platform::TracingController instance and use it.
+ * If |priority_mode| is PriorityMode::kApply, the default platform will use
+ * multiple task queues executed by threads different system-level priorities
+ * (where available) to schedule tasks.
  */
 V8_PLATFORM_EXPORT std::unique_ptr<v8::Platform> NewDefaultPlatform(
     int thread_pool_size = 0,
     IdleTaskSupport idle_task_support = IdleTaskSupport::kDisabled,
     InProcessStackDumping in_process_stack_dumping =
         InProcessStackDumping::kDisabled,
-    std::unique_ptr<v8::TracingController> tracing_controller = {});
+    std::unique_ptr<v8::TracingController> tracing_controller = {},
+    PriorityMode priority_mode = PriorityMode::kDontApply);
 
 /**
  * The same as NewDefaultPlatform but disables the worker thread pool.
diff --git a/deps/v8/include/v8-callbacks.h b/deps/v8/include/v8-callbacks.h
index f0fa561a3d76fb..2a25b9ee04e003 100644
--- a/deps/v8/include/v8-callbacks.h
+++ b/deps/v8/include/v8-callbacks.h
@@ -147,14 +147,18 @@ using JitCodeEventHandler = void (*)(const JitCodeEvent* event);
  * the callback functions, you therefore cannot manipulate objects (set or
  * delete properties for example) since it is possible such operations will
  * result in the allocation of objects.
+ * TODO(v8:12612): Deprecate kGCTypeMinorMarkSweep after updating blink.
  */
 enum GCType {
   kGCTypeScavenge = 1 << 0,
-  kGCTypeMinorMarkCompact = 1 << 1,
+  kGCTypeMinorMarkSweep = 1 << 1,
+  kGCTypeMinorMarkCompact V8_DEPRECATE_SOON(
+      "Use kGCTypeMinorMarkSweep instead of kGCTypeMinorMarkCompact.") =
+      kGCTypeMinorMarkSweep,
   kGCTypeMarkSweepCompact = 1 << 2,
   kGCTypeIncrementalMarking = 1 << 3,
   kGCTypeProcessWeakCallbacks = 1 << 4,
-  kGCTypeAll = kGCTypeScavenge | kGCTypeMinorMarkCompact |
+  kGCTypeAll = kGCTypeScavenge | kGCTypeMinorMarkSweep |
                kGCTypeMarkSweepCompact | kGCTypeIncrementalMarking |
                kGCTypeProcessWeakCallbacks
 };
@@ -323,20 +327,21 @@ using WasmAsyncResolvePromiseCallback = void (*)(
 using WasmLoadSourceMapCallback = Local<String> (*)(Isolate* isolate,
                                                     const char* name);
 
-// --- Callback for checking if WebAssembly Simd is enabled ---
-using WasmSimdEnabledCallback = bool (*)(Local<Context> context);
-
-// --- Callback for checking if WebAssembly exceptions are enabled ---
-using WasmExceptionsEnabledCallback = bool (*)(Local<Context> context);
-
 // --- Callback for checking if WebAssembly GC is enabled ---
 // If the callback returns true, it will also enable Wasm stringrefs.
 using WasmGCEnabledCallback = bool (*)(Local<Context> context);
 
+// --- Callback for checking if WebAssembly imported strings are enabled ---
+using WasmImportedStringsEnabledCallback = bool (*)(Local<Context> context);
+
 // --- Callback for checking if the SharedArrayBuffer constructor is enabled ---
 using SharedArrayBufferConstructorEnabledCallback =
     bool (*)(Local<Context> context);
 
+// --- Callback for checking if the compile hints magic comments are enabled ---
+using JavaScriptCompileHintsMagicEnabledCallback =
+    bool (*)(Local<Context> context);
+
 /**
  * HostImportModuleDynamicallyCallback is called when we
  * require the embedder to load a module. This is used as part of the dynamic
@@ -419,6 +424,45 @@ using PrepareStackTraceCallback = MaybeLocal<Value> (*)(Local<Context> context,
                                                         Local<Value> error,
                                                         Local<Array> sites);
 
+#if defined(V8_OS_WIN)
+/**
+ * Callback to selectively enable ETW tracing based on the document URL.
+ * Implemented by the embedder, it should never call back into V8.
+ *
+ * Windows allows passing additional data to the ETW EnableCallback:
+ * https://learn.microsoft.com/en-us/windows/win32/api/evntprov/nc-evntprov-penablecallback
+ *
+ * This data can be configured in a WPR (Windows Performance Recorder)
+ * profile, adding a CustomFilter to an EventProvider like the following:
+ *
+ * <EventProvider Id=".." Name="57277741-3638-4A4B-BDBA-0AC6E45DA56C" Level="5">
+ *   <CustomFilter Type="0x80000000" Value="AQABAAAAAAA..." />
+ * </EventProvider>
+ *
+ * Where:
+ * - Name="57277741-3638-4A4B-BDBA-0AC6E45DA56C" is the GUID of the V8
+ *     ETW provider, (see src/libplatform/etw/etw-provider-win.h),
+ * - Type="0x80000000" is EVENT_FILTER_TYPE_SCHEMATIZED,
+ * - Value="AQABAAAAAA..." is a base64-encoded byte array that is
+ *     base64-decoded by Windows and passed to the ETW enable callback in
+ *     the 'PEVENT_FILTER_DESCRIPTOR FilterData' argument; see:
+ * https://learn.microsoft.com/en-us/windows/win32/api/evntprov/ns-evntprov-event_filter_descriptor.
+ *
+ * This array contains a struct EVENT_FILTER_HEADER followed by a
+ * variable length payload, and as payload we pass a string in JSON format,
+ * with a list of regular expressions that should match the document URL
+ * in order to enable ETW tracing:
+ *   {
+ *     "version": "1.0",
+ *     "filtered_urls": [
+ *         "https:\/\/.*\.chromium\.org\/.*", "https://v8.dev/";, "..."
+ *     ]
+ *  }
+ */
+using FilterETWSessionByURLCallback =
+    bool (*)(Local<Context> context, const std::string& etw_filter_payload);
+#endif  // V8_OS_WIN
+
 }  // namespace v8
 
 #endif  // INCLUDE_V8_ISOLATE_CALLBACKS_H_
diff --git a/deps/v8/include/v8-context.h b/deps/v8/include/v8-context.h
index 3589caabd4b7c1..50c7e6f494ce36 100644
--- a/deps/v8/include/v8-context.h
+++ b/deps/v8/include/v8-context.h
@@ -395,7 +395,7 @@ Local<Value> Context::GetEmbedderData(int index) {
 #ifndef V8_ENABLE_CHECKS
   using A = internal::Address;
   using I = internal::Internals;
-  A ctx = *reinterpret_cast<const A*>(this);
+  A ctx = internal::ValueHelper::ValueAsAddress(this);
   A embedder_data =
       I::ReadTaggedPointerField(ctx, I::kNativeContextEmbedderDataOffset);
   int value_offset =
@@ -407,15 +407,9 @@ Local<Value> Context::GetEmbedderData(int index) {
   value = I::DecompressTaggedField(embedder_data, static_cast<uint32_t>(value));
 #endif
 
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
-  return Local<Value>(reinterpret_cast<Value*>(value));
-#else
-  internal::Isolate* isolate = internal::IsolateFromNeverReadOnlySpaceObject(
-      *reinterpret_cast<A*>(this));
-  A* result = HandleScope::CreateHandle(isolate, value);
-  return Local<Value>(reinterpret_cast<Value*>(result));
-#endif
-
+  auto isolate = reinterpret_cast<v8::Isolate*>(
+      internal::IsolateFromNeverReadOnlySpaceObject(ctx));
+  return Local<Value>::New(isolate, value);
 #else
   return SlowGetEmbedderData(index);
 #endif
@@ -442,9 +436,12 @@ void* Context::GetAlignedPointerFromEmbedderData(int index) {
 
 template <class T>
 MaybeLocal<T> Context::GetDataFromSnapshotOnce(size_t index) {
-  T* data = reinterpret_cast<T*>(GetDataFromSnapshotOnce(index));
-  if (data) internal::PerformCastCheck(data);
-  return Local<T>(data);
+  auto slot = GetDataFromSnapshotOnce(index);
+  if (slot) {
+    internal::PerformCastCheck(
+        internal::ValueHelper::SlotAsValue<T, false>(slot));
+  }
+  return Local<T>::FromSlot(slot);
 }
 
 Context* Context::Cast(v8::Data* data) {
diff --git a/deps/v8/include/v8-embedder-heap.h b/deps/v8/include/v8-embedder-heap.h
index 9e2e3ef58c4341..c37dadf7a39d55 100644
--- a/deps/v8/include/v8-embedder-heap.h
+++ b/deps/v8/include/v8-embedder-heap.h
@@ -34,6 +34,8 @@ class V8_EXPORT EmbedderRootsHandler {
    * for retaining the object. The embedder may use |WrapperClassId()| to
    * distinguish cases where it wants handles to be treated as roots from not
    * being treated as roots.
+   *
+   * The concrete implementations must be thread-safe.
    */
   virtual bool IsRoot(const v8::TracedReference<v8::Value>& handle) = 0;
 
@@ -47,6 +49,16 @@ class V8_EXPORT EmbedderRootsHandler {
    * handle via the object or class id.
    */
   virtual void ResetRoot(const v8::TracedReference<v8::Value>& handle) = 0;
+
+  /**
+   * Similar to |ResetRoot()|, but opportunistic. The function is called in
+   * parallel for different handles and as such must be thread-safe. In case,
+   * |false| is returned, |ResetRoot()| will be recalled for the same handle.
+   */
+  virtual bool TryResetRoot(const v8::TracedReference<v8::Value>& handle) {
+    ResetRoot(handle);
+    return true;
+  }
 };
 
 }  // namespace v8
diff --git a/deps/v8/include/v8-fast-api-calls.h b/deps/v8/include/v8-fast-api-calls.h
index 0fe7cd2489b05e..e40f1068faba99 100644
--- a/deps/v8/include/v8-fast-api-calls.h
+++ b/deps/v8/include/v8-fast-api-calls.h
@@ -388,13 +388,19 @@ struct FastOneByteString {
 
 class V8_EXPORT CFunctionInfo {
  public:
+  enum class Int64Representation : uint8_t {
+    kNumber = 0,  // Use numbers to represent 64 bit integers.
+    kBigInt = 1,  // Use BigInts to represent 64 bit integers.
+  };
+
   // Construct a struct to hold a CFunction's type information.
   // |return_info| describes the function's return type.
   // |arg_info| is an array of |arg_count| CTypeInfos describing the
   //   arguments. Only the last argument may be of the special type
   //   CTypeInfo::kCallbackOptionsType.
   CFunctionInfo(const CTypeInfo& return_info, unsigned int arg_count,
-                const CTypeInfo* arg_info);
+                const CTypeInfo* arg_info,
+                Int64Representation repr = Int64Representation::kNumber);
 
   const CTypeInfo& ReturnInfo() const { return return_info_; }
 
@@ -404,6 +410,8 @@ class V8_EXPORT CFunctionInfo {
     return HasOptions() ? arg_count_ - 1 : arg_count_;
   }
 
+  Int64Representation GetInt64Representation() const { return repr_; }
+
   // |index| must be less than ArgumentCount().
   //  Note: if the last argument passed on construction of CFunctionInfo
   //  has type CTypeInfo::kCallbackOptionsType, it is not included in
@@ -418,6 +426,7 @@ class V8_EXPORT CFunctionInfo {
 
  private:
   const CTypeInfo return_info_;
+  const Int64Representation repr_;
   const unsigned int arg_count_;
   const CTypeInfo* arg_info_;
 };
@@ -469,6 +478,9 @@ class V8_EXPORT CFunction {
   unsigned int ArgumentCount() const { return type_info_->ArgumentCount(); }
 
   const void* GetAddress() const { return address_; }
+  CFunctionInfo::Int64Representation GetInt64Representation() const {
+    return type_info_->GetInt64Representation();
+  }
   const CFunctionInfo* GetTypeInfo() const { return type_info_; }
 
   enum class OverloadResolution { kImpossible, kAtRuntime, kAtCompileTime };
@@ -598,7 +610,8 @@ struct count<T, T, Args...>
 template <typename T, typename U, typename... Args>
 struct count<T, U, Args...> : count<T, Args...> {};
 
-template <typename RetBuilder, typename... ArgBuilders>
+template <CFunctionInfo::Int64Representation Representation,
+          typename RetBuilder, typename... ArgBuilders>
 class CFunctionInfoImpl : public CFunctionInfo {
   static constexpr int kOptionsArgCount =
       count<FastApiCallbackOptions&, ArgBuilders...>();
@@ -613,18 +626,20 @@ class CFunctionInfoImpl : public CFunctionInfo {
  public:
   constexpr CFunctionInfoImpl()
       : CFunctionInfo(RetBuilder::Build(), sizeof...(ArgBuilders),
-                      arg_info_storage_),
+                      arg_info_storage_, Representation),
         arg_info_storage_{ArgBuilders::Build()...} {
     constexpr CTypeInfo::Type kReturnType = RetBuilder::Build().GetType();
     static_assert(kReturnType == CTypeInfo::Type::kVoid ||
                       kReturnType == CTypeInfo::Type::kBool ||
                       kReturnType == CTypeInfo::Type::kInt32 ||
                       kReturnType == CTypeInfo::Type::kUint32 ||
+                      kReturnType == CTypeInfo::Type::kInt64 ||
+                      kReturnType == CTypeInfo::Type::kUint64 ||
                       kReturnType == CTypeInfo::Type::kFloat32 ||
                       kReturnType == CTypeInfo::Type::kFloat64 ||
                       kReturnType == CTypeInfo::Type::kPointer ||
                       kReturnType == CTypeInfo::Type::kAny,
-                  "64-bit int, string and api object values are not currently "
+                  "String and api object values are not currently "
                   "supported return types.");
   }
 
@@ -845,8 +860,11 @@ class CFunctionBuilderWithFunction {
     return *this;
   }
 
+  template <CFunctionInfo::Int64Representation Representation =
+                CFunctionInfo::Int64Representation::kNumber>
   auto Build() {
-    static CFunctionInfoImpl<RetBuilder, ArgBuilders...> instance;
+    static CFunctionInfoImpl<Representation, RetBuilder, ArgBuilders...>
+        instance;
     return CFunction(fn_, &instance);
   }
 
diff --git a/deps/v8/include/v8-function-callback.h b/deps/v8/include/v8-function-callback.h
index 60ecca1fd2a34f..17b37cdda1e817 100644
--- a/deps/v8/include/v8-function-callback.h
+++ b/deps/v8/include/v8-function-callback.h
@@ -78,7 +78,6 @@ class ReturnValue {
 
   // See FunctionCallbackInfo.
   static constexpr int kIsolateValueIndex = -2;
-  static constexpr int kDefaultValueValueIndex = -1;
 
   internal::Address* value_;
 };
@@ -127,16 +126,16 @@ class FunctionCallbackInfo {
   friend class internal::FunctionCallbackArguments;
   friend class internal::CustomArguments<FunctionCallbackInfo>;
   friend class debug::ConsoleCallArguments;
-  friend class internal::Builtins;
+
   static constexpr int kHolderIndex = 0;
   static constexpr int kIsolateIndex = 1;
-  static constexpr int kReturnValueDefaultValueIndex = 2;
+  static constexpr int kUnusedIndex = 2;
   static constexpr int kReturnValueIndex = 3;
   static constexpr int kDataIndex = 4;
   static constexpr int kNewTargetIndex = 5;
-
   static constexpr int kArgsLength = 6;
-  static constexpr int kArgsLengthWithReceiver = 7;
+
+  static constexpr int kArgsLengthWithReceiver = kArgsLength + 1;
 
   // Codegen constants:
   static constexpr int kSize = 3 * internal::kApiSystemPointerSize;
@@ -147,8 +146,6 @@ class FunctionCallbackInfo {
       kValuesOffset + internal::kApiSystemPointerSize;
 
   static constexpr int kThisValuesIndex = -1;
-  static_assert(ReturnValue<Value>::kDefaultValueValueIndex ==
-                kReturnValueDefaultValueIndex - kReturnValueIndex);
   static_assert(ReturnValue<Value>::kIsolateValueIndex ==
                 kIsolateIndex - kReturnValueIndex);
 
@@ -258,17 +255,17 @@ class PropertyCallbackInfo {
   static constexpr int kShouldThrowOnErrorIndex = 0;
   static constexpr int kHolderIndex = 1;
   static constexpr int kIsolateIndex = 2;
-  static constexpr int kReturnValueDefaultValueIndex = 3;
+  static constexpr int kUnusedIndex = 3;
   static constexpr int kReturnValueIndex = 4;
   static constexpr int kDataIndex = 5;
   static constexpr int kThisIndex = 6;
-
   static constexpr int kArgsLength = 7;
 
   static constexpr int kSize = 1 * internal::kApiSystemPointerSize;
 
   V8_INLINE explicit PropertyCallbackInfo(internal::Address* args)
       : args_(args) {}
+
   internal::Address* args_;
 };
 
@@ -286,7 +283,7 @@ void ReturnValue<T>::Set(const Global<S>& handle) {
   if (V8_UNLIKELY(handle.IsEmpty())) {
     *value_ = GetDefaultValue();
   } else {
-    *value_ = *reinterpret_cast<internal::Address*>(*handle);
+    *value_ = handle.ptr();
   }
 }
 
@@ -297,7 +294,7 @@ void ReturnValue<T>::Set(const BasicTracedReference<S>& handle) {
   if (V8_UNLIKELY(handle.IsEmpty())) {
     *value_ = GetDefaultValue();
   } else {
-    *value_ = *reinterpret_cast<internal::Address*>(handle.val_);
+    *value_ = handle.ptr();
   }
 }
 
@@ -309,7 +306,7 @@ void ReturnValue<T>::Set(const Local<S> handle) {
   if (V8_UNLIKELY(handle.IsEmpty())) {
     *value_ = GetDefaultValue();
   } else {
-    *value_ = internal::ValueHelper::ValueAsAddress(*handle);
+    *value_ = handle.ptr();
   }
 }
 
@@ -378,7 +375,6 @@ void ReturnValue<T>::SetEmptyString() {
 
 template <typename T>
 Isolate* ReturnValue<T>::GetIsolate() const {
-  // Isolate is always the pointer below the default value on the stack.
   return *reinterpret_cast<Isolate**>(&value_[kIsolateValueIndex]);
 }
 
@@ -403,8 +399,8 @@ void ReturnValue<T>::Set(S* whatever) {
 
 template <typename T>
 internal::Address ReturnValue<T>::GetDefaultValue() {
-  // Default value is always the pointer below value_ on the stack.
-  return value_[kDefaultValueValueIndex];
+  using I = internal::Internals;
+  return I::GetRoot(GetIsolate(), I::kTheHoleValueRootIndex);
 }
 
 template <typename T>
diff --git a/deps/v8/include/v8-function.h b/deps/v8/include/v8-function.h
index 1e35bfc8bfa272..30a9fcfe174acb 100644
--- a/deps/v8/include/v8-function.h
+++ b/deps/v8/include/v8-function.h
@@ -87,6 +87,12 @@ class V8_EXPORT Function : public Object {
    */
   int GetScriptColumnNumber() const;
 
+  /**
+   * Returns zero based start position (character offset) of function body and
+   * kLineOffsetNotFound if no information available.
+   */
+  int GetScriptStartPosition() const;
+
   /**
    * Returns scriptId.
    */
diff --git a/deps/v8/include/v8-handle-base.h b/deps/v8/include/v8-handle-base.h
new file mode 100644
index 00000000000000..d346a80de2a147
--- /dev/null
+++ b/deps/v8/include/v8-handle-base.h
@@ -0,0 +1,185 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef INCLUDE_V8_HANDLE_BASE_H_
+#define INCLUDE_V8_HANDLE_BASE_H_
+
+#include "v8-internal.h"  // NOLINT(build/include_directory)
+
+namespace v8 {
+
+namespace internal {
+
+// Helper functions about values contained in handles.
+// A value is either an indirect pointer or a direct pointer, depending on
+// whether direct local support is enabled.
+class ValueHelper final {
+ public:
+#ifdef V8_ENABLE_DIRECT_LOCAL
+  static constexpr Address kTaggedNullAddress = 1;
+  static constexpr Address kEmpty = kTaggedNullAddress;
+#else
+  static constexpr Address kEmpty = kNullAddress;
+#endif  // V8_ENABLE_DIRECT_LOCAL
+
+  template <typename T>
+  V8_INLINE static bool IsEmpty(T* value) {
+    return reinterpret_cast<Address>(value) == kEmpty;
+  }
+
+  // Returns a handle's "value" for all kinds of abstract handles. For Local,
+  // it is equivalent to `*handle`. The variadic parameters support handle
+  // types with extra type parameters, like `Persistent<T, M>`.
+  template <template <typename T, typename... Ms> typename H, typename T,
+            typename... Ms>
+  V8_INLINE static T* HandleAsValue(const H<T, Ms...>& handle) {
+    return handle.template value<T>();
+  }
+
+#ifdef V8_ENABLE_DIRECT_LOCAL
+
+  template <typename T>
+  V8_INLINE static Address ValueAsAddress(const T* value) {
+    return reinterpret_cast<Address>(value);
+  }
+
+  template <typename T, bool check_null = true, typename S>
+  V8_INLINE static T* SlotAsValue(S* slot) {
+    if (check_null && slot == nullptr) {
+      return reinterpret_cast<T*>(kTaggedNullAddress);
+    }
+    return *reinterpret_cast<T**>(slot);
+  }
+
+#else  // !V8_ENABLE_DIRECT_LOCAL
+
+  template <typename T>
+  V8_INLINE static Address ValueAsAddress(const T* value) {
+    return *reinterpret_cast<const Address*>(value);
+  }
+
+  template <typename T, bool check_null = true, typename S>
+  V8_INLINE static T* SlotAsValue(S* slot) {
+    return reinterpret_cast<T*>(slot);
+  }
+
+#endif  // V8_ENABLE_DIRECT_LOCAL
+};
+
+/**
+ * Helper functions about handles.
+ */
+class HandleHelper final {
+ public:
+  /**
+   * Checks whether two handles are equal.
+   * They are equal iff they are both empty or they are both non-empty and the
+   * objects to which they refer are physically equal.
+   *
+   * If both handles refer to JS objects, this is the same as strict equality.
+   * For primitives, such as numbers or strings, a `false` return value does not
+   * indicate that the values aren't equal in the JavaScript sense.
+   * Use `Value::StrictEquals()` to check primitives for equality.
+   */
+  template <typename T1, typename T2>
+  V8_INLINE static bool EqualHandles(const T1& lhs, const T2& rhs) {
+    if (lhs.IsEmpty()) return rhs.IsEmpty();
+    if (rhs.IsEmpty()) return false;
+    return lhs.ptr() == rhs.ptr();
+  }
+
+  static V8_EXPORT void VerifyOnStack(const void* ptr);
+};
+
+}  // namespace internal
+
+/**
+ * A base class for abstract handles containing indirect pointers.
+ * These are useful regardless of whether direct local support is enabled.
+ */
+class IndirectHandleBase {
+ public:
+  // Returns true if the handle is empty.
+  V8_INLINE bool IsEmpty() const { return location_ == nullptr; }
+
+  // Sets the handle to be empty. IsEmpty() will then return true.
+  V8_INLINE void Clear() { location_ = nullptr; }
+
+ protected:
+  friend class internal::ValueHelper;
+  friend class internal::HandleHelper;
+
+  V8_INLINE IndirectHandleBase() = default;
+  V8_INLINE IndirectHandleBase(const IndirectHandleBase& other) = default;
+  V8_INLINE IndirectHandleBase& operator=(const IndirectHandleBase& that) =
+      default;
+
+  V8_INLINE explicit IndirectHandleBase(internal::Address* location)
+      : location_(location) {}
+
+  // Returns the address of the actual heap object (tagged).
+  // This method must be called only if the handle is not empty, otherwise it
+  // will crash.
+  V8_INLINE internal::Address ptr() const { return *location_; }
+
+  // Returns a reference to the slot (indirect pointer).
+  V8_INLINE internal::Address* const& slot() const { return location_; }
+  V8_INLINE internal::Address*& slot() { return location_; }
+
+  // Returns the handler's "value" (direct or indirect pointer, depending on
+  // whether direct local support is enabled).
+  template <typename T>
+  V8_INLINE T* value() const {
+    return internal::ValueHelper::SlotAsValue<T, false>(slot());
+  }
+
+ private:
+  internal::Address* location_ = nullptr;
+};
+
+#ifdef V8_ENABLE_DIRECT_LOCAL
+
+/**
+ * A base class for abstract handles containing direct pointers.
+ * These are only possible when conservative stack scanning is enabled.
+ */
+class DirectHandleBase {
+ public:
+  // Returns true if the handle is empty.
+  V8_INLINE bool IsEmpty() const {
+    return ptr_ == internal::ValueHelper::kEmpty;
+  }
+
+  // Sets the handle to be empty. IsEmpty() will then return true.
+  V8_INLINE void Clear() { ptr_ = internal::ValueHelper::kEmpty; }
+
+ protected:
+  friend class internal::ValueHelper;
+  friend class internal::HandleHelper;
+
+  V8_INLINE DirectHandleBase() = default;
+  V8_INLINE DirectHandleBase(const DirectHandleBase& other) = default;
+  V8_INLINE DirectHandleBase& operator=(const DirectHandleBase& that) = default;
+
+  V8_INLINE explicit DirectHandleBase(internal::Address ptr) : ptr_(ptr) {}
+
+  // Returns the address of the referenced object.
+  V8_INLINE internal::Address ptr() const { return ptr_; }
+
+  // Returns the handler's "value" (direct pointer, as direct local support
+  // is guaranteed to be enabled here).
+  template <typename T>
+  V8_INLINE T* value() const {
+    return reinterpret_cast<T*>(ptr_);
+  }
+
+ private:
+  internal::Address ptr_ = internal::ValueHelper::kEmpty;
+};
+
+#endif  // V8_ENABLE_DIRECT_LOCAL
+
+}  // namespace v8
+
+#endif  // INCLUDE_V8_HANDLE_BASE_H_
diff --git a/deps/v8/include/v8-inspector.h b/deps/v8/include/v8-inspector.h
index 563ad196d6e607..68b19720a4f3e7 100644
--- a/deps/v8/include/v8-inspector.h
+++ b/deps/v8/include/v8-inspector.h
@@ -217,6 +217,8 @@ class V8_EXPORT V8InspectorSession {
   virtual void stop() = 0;
 };
 
+// Deprecated.
+// TODO(crbug.com/1420968): remove.
 class V8_EXPORT WebDriverValue {
  public:
   explicit WebDriverValue(std::unique_ptr<StringBuffer> type,
@@ -226,6 +228,27 @@ class V8_EXPORT WebDriverValue {
   v8::MaybeLocal<v8::Value> value;
 };
 
+struct V8_EXPORT DeepSerializedValue {
+  explicit DeepSerializedValue(std::unique_ptr<StringBuffer> type,
+                               v8::MaybeLocal<v8::Value> value = {})
+      : type(std::move(type)), value(value) {}
+  std::unique_ptr<StringBuffer> type;
+  v8::MaybeLocal<v8::Value> value;
+};
+
+struct V8_EXPORT DeepSerializationResult {
+  explicit DeepSerializationResult(
+      std::unique_ptr<DeepSerializedValue> serializedValue)
+      : serializedValue(std::move(serializedValue)), isSuccess(true) {}
+  explicit DeepSerializationResult(std::unique_ptr<StringBuffer> errorMessage)
+      : errorMessage(std::move(errorMessage)), isSuccess(false) {}
+
+  // Use std::variant when available.
+  std::unique_ptr<DeepSerializedValue> serializedValue;
+  std::unique_ptr<StringBuffer> errorMessage;
+  bool isSuccess;
+};
+
 class V8_EXPORT V8InspectorClient {
  public:
   virtual ~V8InspectorClient() = default;
@@ -243,8 +266,15 @@ class V8_EXPORT V8InspectorClient {
   virtual void beginUserGesture() {}
   virtual void endUserGesture() {}
 
+  // Deprecated. Use `deepSerialize` instead.
+  // TODO(crbug.com/1420968): remove.
   virtual std::unique_ptr<WebDriverValue> serializeToWebDriverValue(
-      v8::Local<v8::Value> v8_value, int max_depth) {
+      v8::Local<v8::Value> v8Value, int maxDepth) {
+    return nullptr;
+  }
+  virtual std::unique_ptr<DeepSerializationResult> deepSerialize(
+      v8::Local<v8::Value> v8Value, int maxDepth,
+      v8::Local<v8::Object> additionalParameters) {
     return nullptr;
   }
   virtual std::unique_ptr<StringBuffer> valueSubtype(v8::Local<v8::Value>) {
diff --git a/deps/v8/include/v8-internal.h b/deps/v8/include/v8-internal.h
index e61bb6e4154eb0..d29a303536186c 100644
--- a/deps/v8/include/v8-internal.h
+++ b/deps/v8/include/v8-internal.h
@@ -12,7 +12,6 @@
 #include <atomic>
 #include <type_traits>
 
-#include "v8-version.h"  // NOLINT(build/include_directory)
 #include "v8config.h"    // NOLINT(build/include_directory)
 
 namespace v8 {
@@ -80,7 +79,7 @@ struct SmiTagging<4> {
       static_cast<intptr_t>(kUintptrAllBitsSet << (kSmiValueSize - 1));
   static constexpr intptr_t kSmiMaxValue = -(kSmiMinValue + 1);
 
-  V8_INLINE static int SmiToInt(Address value) {
+  V8_INLINE static constexpr int SmiToInt(Address value) {
     int shift_bits = kSmiTagSize + kSmiShiftSize;
     // Truncate and shift down (requires >> to be sign extending).
     return static_cast<int32_t>(static_cast<uint32_t>(value)) >> shift_bits;
@@ -105,7 +104,7 @@ struct SmiTagging<8> {
       static_cast<intptr_t>(kUintptrAllBitsSet << (kSmiValueSize - 1));
   static constexpr intptr_t kSmiMaxValue = -(kSmiMinValue + 1);
 
-  V8_INLINE static int SmiToInt(Address value) {
+  V8_INLINE static constexpr int SmiToInt(Address value) {
     int shift_bits = kSmiTagSize + kSmiShiftSize;
     // Shift down and throw away top 32 bits.
     return static_cast<int>(static_cast<intptr_t>(value) >> shift_bits);
@@ -247,20 +246,22 @@ static_assert(1ULL << (64 - kBoundedSizeShift) ==
 // size allows omitting bounds checks on table accesses if the indices are
 // guaranteed (e.g. through shifting) to be below the maximum index. This
 // value must be a power of two.
-static const size_t kExternalPointerTableReservationSize = 512 * MB;
+constexpr size_t kExternalPointerTableReservationSize = 512 * MB;
 
 // The external pointer table indices stored in HeapObjects as external
 // pointers are shifted to the left by this amount to guarantee that they are
 // smaller than the maximum table size.
-static const uint32_t kExternalPointerIndexShift = 6;
+constexpr uint32_t kExternalPointerIndexShift = 6;
 #else
-static const size_t kExternalPointerTableReservationSize = 1024 * MB;
-static const uint32_t kExternalPointerIndexShift = 5;
+constexpr size_t kExternalPointerTableReservationSize = 1024 * MB;
+constexpr uint32_t kExternalPointerIndexShift = 5;
 #endif  // V8_TARGET_OS_ANDROID
 
 // The maximum number of entries in an external pointer table.
-static const size_t kMaxExternalPointers =
-    kExternalPointerTableReservationSize / kApiSystemPointerSize;
+constexpr int kExternalPointerTableEntrySize = 8;
+constexpr int kExternalPointerTableEntrySizeLog2 = 3;
+constexpr size_t kMaxExternalPointers =
+    kExternalPointerTableReservationSize / kExternalPointerTableEntrySize;
 static_assert((1 << (32 - kExternalPointerIndexShift)) == kMaxExternalPointers,
               "kExternalPointerTableReservationSize and "
               "kExternalPointerIndexShift don't match");
@@ -268,7 +269,7 @@ static_assert((1 << (32 - kExternalPointerIndexShift)) == kMaxExternalPointers,
 #else  // !V8_COMPRESS_POINTERS
 
 // Needed for the V8.SandboxedExternalPointersCount histogram.
-static const size_t kMaxExternalPointers = 0;
+constexpr size_t kMaxExternalPointers = 0;
 
 #endif  // V8_COMPRESS_POINTERS
 
@@ -281,15 +282,21 @@ static const size_t kMaxExternalPointers = 0;
 // that it is smaller than the size of the table.
 using ExternalPointerHandle = uint32_t;
 
-// ExternalPointers point to objects located outside the sandbox. When
-// sandboxed external pointers are enabled, these are stored on heap as
-// ExternalPointerHandles, otherwise they are simply raw pointers.
+// ExternalPointers point to objects located outside the sandbox. When the V8
+// sandbox is enabled, these are stored on heap as ExternalPointerHandles,
+// otherwise they are simply raw pointers.
 #ifdef V8_ENABLE_SANDBOX
 using ExternalPointer_t = ExternalPointerHandle;
 #else
 using ExternalPointer_t = Address;
 #endif
 
+constexpr ExternalPointer_t kNullExternalPointer = 0;
+constexpr ExternalPointerHandle kNullExternalPointerHandle = 0;
+
+//
+// External Pointers.
+//
 // When the sandbox is enabled, external pointers are stored in an external
 // pointer table and are referenced from HeapObjects through an index (a
 // "handle"). When stored in the table, the pointers are tagged with per-type
@@ -359,6 +366,7 @@ using ExternalPointer_t = Address;
 // ExternalPointerTable.
 constexpr uint64_t kExternalPointerMarkBit = 1ULL << 62;
 constexpr uint64_t kExternalPointerTagMask = 0x40ff000000000000;
+constexpr uint64_t kExternalPointerTagMaskWithoutMarkBit = 0xff000000000000;
 constexpr uint64_t kExternalPointerTagShift = 48;
 
 // All possible 8-bit type tags.
@@ -417,7 +425,8 @@ constexpr uint64_t kAllExternalPointerTypeTags[] = {
   V(kWasmTypeInfoNativeTypeTag,                 TAG(18)) \
   V(kWasmExportedFunctionDataSignatureTag,      TAG(19)) \
   V(kWasmContinuationJmpbufTag,                 TAG(20)) \
-  V(kArrayBufferExtensionTag,                   TAG(21))
+  V(kWasmIndirectFunctionTargetTag,             TAG(21)) \
+  V(kArrayBufferExtensionTag,                   TAG(22))
 
 // All external pointer tags.
 #define ALL_EXTERNAL_POINTER_TAGS(V) \
@@ -430,7 +439,7 @@ constexpr uint64_t kAllExternalPointerTypeTags[] = {
   (HasMarkBit ? kExternalPointerMarkBit : 0))
 enum ExternalPointerTag : uint64_t {
   // Empty tag value. Mostly used as placeholder.
-  kExternalPointerNullTag =            MAKE_TAG(0, 0b00000000),
+  kExternalPointerNullTag =            MAKE_TAG(1, 0b00000000),
   // External pointer tag that will match any external pointer. Use with care!
   kAnyExternalPointerTag =             MAKE_TAG(1, 0b11111111),
   // The free entry tag has all type bits set so every type check with a
@@ -471,6 +480,74 @@ PER_ISOLATE_EXTERNAL_POINTER_TAGS(CHECK_NON_SHARED_EXTERNAL_POINTER_TAGS)
 #undef SHARED_EXTERNAL_POINTER_TAGS
 #undef EXTERNAL_POINTER_TAGS
 
+//
+// Indirect Pointers.
+//
+// When the sandbox is enabled, indirect pointers are used to reference
+// HeapObjects that live outside of the sandbox (but are still managed through
+// the GC). When object A references an object B through an indirect pointer,
+// object A will contain a IndirectPointerHandle, i.e. a shifted 32-bit index,
+// which identifies an entry in a pointer table (such as the CodePointerTable).
+// This table entry then contains the actual pointer to object B. Further,
+// object B owns this pointer table entry, and it is responsible for updating
+// the "self-pointer" in the entry when it is relocated in memory. This way, in
+// contrast to "normal" pointers, indirect pointers never need to be tracked by
+// the GC (i.e. there is no remembered set for them).
+// Currently there is only one type of object referenced through indirect
+// pointers (Code objects), but once there are different types of such objects,
+// the pointer table entry would probably also contain the type of the target
+// object (e.g. by XORing the instance type into the top bits of the pointer).
+
+// An IndirectPointerHandle represents a 32-bit index into a pointer table.
+using IndirectPointerHandle = uint32_t;
+
+// The indirect pointer handles are stores shifted to the left by this amount
+// to guarantee that they are smaller than the maximum table size.
+constexpr uint32_t kIndirectPointerHandleShift = 6;
+
+// A null handle always references an entry that contains nullptr.
+constexpr IndirectPointerHandle kNullIndirectPointerHandle = 0;
+
+// Currently only Code objects can be referenced through indirect pointers and
+// various places rely on that assumption. They will all static_assert against
+// this constant to make them easy to find and fix once we reference other types
+// of objects indirectly.
+constexpr bool kAllIndirectPointerObjectsAreCode = true;
+
+//
+// Code Pointers.
+//
+// When the sandbox is enabled, Code objects are referenced from inside the
+// sandbox through indirect pointers that reference entries in the code pointer
+// table (CPT). Each entry in the CPT contains both a pointer to a Code object
+// as well as a pointer to the Code's entrypoint. This allows calling/jumping
+// into Code with one fewer memory access (compared to the case where the
+// entrypoint pointer needs to be loaded from the Code object).
+// As such, a CodePointerHandle can be used both to obtain the referenced Code
+// object and to directly load its entrypoint pointer.
+using CodePointerHandle = IndirectPointerHandle;
+constexpr uint32_t kCodePointerHandleShift = kIndirectPointerHandleShift;
+constexpr CodePointerHandle kNullCodePointerHandle = 0;
+
+// The size of the virtual memory reservation for code pointer table.
+// This determines the maximum number of entries in a table. Using a maximum
+// size allows omitting bounds checks on table accesses if the indices are
+// guaranteed (e.g. through shifting) to be below the maximum index. This
+// value must be a power of two.
+constexpr size_t kCodePointerTableReservationSize = 1 * GB;
+
+// The maximum number of entries in an external pointer table.
+constexpr int kCodePointerTableEntrySize = 16;
+constexpr int kCodePointerTableEntrySizeLog2 = 4;
+constexpr size_t kMaxCodePointers =
+    kCodePointerTableReservationSize / kCodePointerTableEntrySize;
+static_assert(
+    (1 << (32 - kIndirectPointerHandleShift)) == kMaxCodePointers,
+    "kCodePointerTableReservationSize and kCodePointerHandleShift don't match");
+
+constexpr int kCodePointerTableEntryEntrypointOffset = 0;
+constexpr int kCodePointerTableEntryCodeObjectOffset = 8;
+
 // {obj} must be the raw tagged pointer representation of a HeapObject
 // that's guaranteed to never be in ReadOnlySpace.
 V8_EXPORT internal::Isolate* IsolateFromNeverReadOnlySpaceObject(Address obj);
@@ -517,15 +594,17 @@ class Internals {
   static const int kExternalOneByteRepresentationTag = 0x0a;
 
   static const uint32_t kNumIsolateDataSlots = 4;
-  static const int kStackGuardSize = 7 * kApiSystemPointerSize;
+  static const int kStackGuardSize = 8 * kApiSystemPointerSize;
   static const int kBuiltinTier0EntryTableSize = 7 * kApiSystemPointerSize;
   static const int kBuiltinTier0TableSize = 7 * kApiSystemPointerSize;
   static const int kLinearAllocationAreaSize = 3 * kApiSystemPointerSize;
-  static const int kThreadLocalTopSize = 25 * kApiSystemPointerSize;
+  static const int kThreadLocalTopSize = 30 * kApiSystemPointerSize;
+  static const int kHandleScopeDataSize =
+      2 * kApiSystemPointerSize + 2 * kApiInt32Size;
 
   // ExternalPointerTable layout guarantees.
-  static const int kExternalPointerTableBufferOffset = 0;
-  static const int kExternalPointerTableSize = 4 * kApiSystemPointerSize;
+  static const int kExternalPointerTableBasePointerOffset = 0;
+  static const int kExternalPointerTableSize = 2 * kApiSystemPointerSize;
 
   // IsolateData layout guarantees.
   static const int kIsolateCageBaseOffset = 0;
@@ -551,19 +630,23 @@ class Internals {
       kIsolateFastApiCallTargetOffset + kApiSystemPointerSize;
   static const int kIsolateThreadLocalTopOffset =
       kIsolateLongTaskStatsCounterOffset + kApiSizetSize;
-  static const int kIsolateEmbedderDataOffset =
+  static const int kIsolateHandleScopeDataOffset =
       kIsolateThreadLocalTopOffset + kThreadLocalTopSize;
+  static const int kIsolateEmbedderDataOffset =
+      kIsolateHandleScopeDataOffset + kHandleScopeDataSize;
 #ifdef V8_COMPRESS_POINTERS
   static const int kIsolateExternalPointerTableOffset =
       kIsolateEmbedderDataOffset + kNumIsolateDataSlots * kApiSystemPointerSize;
   static const int kIsolateSharedExternalPointerTableAddressOffset =
       kIsolateExternalPointerTableOffset + kExternalPointerTableSize;
-  static const int kIsolateRootsOffset =
+  static const int kIsolateApiCallbackThunkArgumentOffset =
       kIsolateSharedExternalPointerTableAddressOffset + kApiSystemPointerSize;
 #else
-  static const int kIsolateRootsOffset =
+  static const int kIsolateApiCallbackThunkArgumentOffset =
       kIsolateEmbedderDataOffset + kNumIsolateDataSlots * kApiSystemPointerSize;
 #endif
+  static const int kIsolateRootsOffset =
+      kIsolateApiCallbackThunkArgumentOffset + kApiSystemPointerSize;
 
 #if V8_STATIC_ROOTS_BOOL
 
@@ -641,11 +724,11 @@ class Internals {
 #endif
   }
 
-  V8_INLINE static bool HasHeapObjectTag(Address value) {
+  V8_INLINE static constexpr bool HasHeapObjectTag(Address value) {
     return (value & kHeapObjectTagMask) == static_cast<Address>(kHeapObjectTag);
   }
 
-  V8_INLINE static int SmiValue(Address value) {
+  V8_INLINE static constexpr int SmiValue(Address value) {
     return PlatformSmiTagging::SmiToInt(value);
   }
 
@@ -770,7 +853,7 @@ class Internals {
   V8_INLINE static Address* GetExternalPointerTableBase(v8::Isolate* isolate) {
     Address addr = reinterpret_cast<Address>(isolate) +
                    kIsolateExternalPointerTableOffset +
-                   kExternalPointerTableBufferOffset;
+                   kExternalPointerTableBasePointerOffset;
     return *reinterpret_cast<Address**>(addr);
   }
 
@@ -779,7 +862,7 @@ class Internals {
     Address addr = reinterpret_cast<Address>(isolate) +
                    kIsolateSharedExternalPointerTableAddressOffset;
     addr = *reinterpret_cast<Address*>(addr);
-    addr += kExternalPointerTableBufferOffset;
+    addr += kExternalPointerTableBasePointerOffset;
     return *reinterpret_cast<Address**>(addr);
   }
 #endif
@@ -901,57 +984,6 @@ class BackingStoreBase {};
 // This is needed for histograms sampling garbage collection reasons.
 constexpr int kGarbageCollectionReasonMaxValue = 27;
 
-// Helper functions about values contained in handles.
-class ValueHelper final {
- public:
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
-  static constexpr Address kLocalTaggedNullAddress = 1;
-
-  template <typename T>
-  static constexpr T* EmptyValue() {
-    return reinterpret_cast<T*>(kLocalTaggedNullAddress);
-  }
-
-  template <typename T>
-  V8_INLINE static Address ValueAsAddress(const T* value) {
-    return reinterpret_cast<Address>(value);
-  }
-
-  template <typename T, typename S>
-  V8_INLINE static T* SlotAsValue(S* slot) {
-    return *reinterpret_cast<T**>(slot);
-  }
-
-  template <typename T>
-  V8_INLINE static T* ValueAsSlot(T* const& value) {
-    return reinterpret_cast<T*>(const_cast<T**>(&value));
-  }
-
-#else  // !V8_ENABLE_CONSERVATIVE_STACK_SCANNING
-
-  template <typename T>
-  static constexpr T* EmptyValue() {
-    return nullptr;
-  }
-
-  template <typename T>
-  V8_INLINE static Address ValueAsAddress(const T* value) {
-    return *reinterpret_cast<const Address*>(value);
-  }
-
-  template <typename T, typename S>
-  V8_INLINE static T* SlotAsValue(S* slot) {
-    return reinterpret_cast<T*>(slot);
-  }
-
-  template <typename T>
-  V8_INLINE static T* ValueAsSlot(T* const& value) {
-    return value;
-  }
-
-#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
-};
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/include/v8-isolate.h b/deps/v8/include/v8-isolate.h
index 0284e6e769c819..f6b64db360ba3a 100644
--- a/deps/v8/include/v8-isolate.h
+++ b/deps/v8/include/v8-isolate.h
@@ -414,40 +414,43 @@ class V8_EXPORT Isolate {
    * Features reported via the SetUseCounterCallback callback. Do not change
    * assigned numbers of existing items; add new features to the end of this
    * list.
+   * Dead features can be marked `V8_DEPRECATE_SOON`, then `V8_DEPRECATED`, and
+   * then finally be renamed to `kOBSOLETE_...` to stop embedders from using
+   * them.
    */
   enum UseCounterFeature {
     kUseAsm = 0,
     kBreakIterator = 1,
-    kLegacyConst = 2,
-    kMarkDequeOverflow = 3,
-    kStoreBufferOverflow = 4,
-    kSlotsBufferOverflow = 5,
-    kObjectObserve = 6,
+    kLegacyConst V8_DEPRECATE_SOON("unused") = 2,
+    kMarkDequeOverflow V8_DEPRECATE_SOON("unused") = 3,
+    kStoreBufferOverflow V8_DEPRECATE_SOON("unused") = 4,
+    kSlotsBufferOverflow V8_DEPRECATE_SOON("unused") = 5,
+    kObjectObserve V8_DEPRECATE_SOON("unused") = 6,
     kForcedGC = 7,
     kSloppyMode = 8,
     kStrictMode = 9,
-    kStrongMode = 10,
+    kStrongMode V8_DEPRECATE_SOON("unused") = 10,
     kRegExpPrototypeStickyGetter = 11,
     kRegExpPrototypeToString = 12,
     kRegExpPrototypeUnicodeGetter = 13,
-    kIntlV8Parse = 14,
-    kIntlPattern = 15,
-    kIntlResolved = 16,
-    kPromiseChain = 17,
-    kPromiseAccept = 18,
-    kPromiseDefer = 19,
+    kIntlV8Parse V8_DEPRECATE_SOON("unused") = 14,
+    kIntlPattern V8_DEPRECATE_SOON("unused") = 15,
+    kIntlResolved V8_DEPRECATE_SOON("unused") = 16,
+    kPromiseChain V8_DEPRECATE_SOON("unused") = 17,
+    kPromiseAccept V8_DEPRECATE_SOON("unused") = 18,
+    kPromiseDefer V8_DEPRECATE_SOON("unused") = 19,
     kHtmlCommentInExternalScript = 20,
     kHtmlComment = 21,
     kSloppyModeBlockScopedFunctionRedefinition = 22,
     kForInInitializer = 23,
-    kArrayProtectorDirtied = 24,
+    kArrayProtectorDirtied V8_DEPRECATE_SOON("unused") = 24,
     kArraySpeciesModified = 25,
     kArrayPrototypeConstructorModified = 26,
-    kArrayInstanceProtoModified = 27,
+    kArrayInstanceProtoModified V8_DEPRECATE_SOON("unused") = 27,
     kArrayInstanceConstructorModified = 28,
-    kLegacyFunctionDeclaration = 29,
-    kRegExpPrototypeSourceGetter = 30,   // Unused.
-    kRegExpPrototypeOldFlagGetter = 31,  // Unused.
+    kLegacyFunctionDeclaration V8_DEPRECATE_SOON("unused") = 29,
+    kRegExpPrototypeSourceGetter V8_DEPRECATE_SOON("unused") = 30,
+    kRegExpPrototypeOldFlagGetter V8_DEPRECATE_SOON("unused") = 31,
     kDecimalWithLeadingZeroInStrictMode = 32,
     kLegacyDateParser = 33,
     kDefineGetterOrSetterWouldThrow = 34,
@@ -455,21 +458,22 @@ class V8_EXPORT Isolate {
     kAssigmentExpressionLHSIsCallInSloppy = 36,
     kAssigmentExpressionLHSIsCallInStrict = 37,
     kPromiseConstructorReturnedUndefined = 38,
-    kConstructorNonUndefinedPrimitiveReturn = 39,
-    kLabeledExpressionStatement = 40,
-    kLineOrParagraphSeparatorAsLineTerminator = 41,
+    kConstructorNonUndefinedPrimitiveReturn V8_DEPRECATE_SOON("unused") = 39,
+    kLabeledExpressionStatement V8_DEPRECATE_SOON("unused") = 40,
+    kLineOrParagraphSeparatorAsLineTerminator V8_DEPRECATE_SOON("unused") = 41,
     kIndexAccessor = 42,
     kErrorCaptureStackTrace = 43,
     kErrorPrepareStackTrace = 44,
     kErrorStackTraceLimit = 45,
     kWebAssemblyInstantiation = 46,
     kDeoptimizerDisableSpeculation = 47,
-    kArrayPrototypeSortJSArrayModifiedPrototype = 48,
+    kArrayPrototypeSortJSArrayModifiedPrototype V8_DEPRECATE_SOON("unused") =
+        48,
     kFunctionTokenOffsetTooLongForToString = 49,
     kWasmSharedMemory = 50,
     kWasmThreadOpcodes = 51,
-    kAtomicsNotify = 52,  // Unused.
-    kAtomicsWake = 53,    // Unused.
+    kAtomicsNotify V8_DEPRECATE_SOON("unused") = 52,
+    kAtomicsWake V8_DEPRECATE_SOON("unused") = 53,
     kCollator = 54,
     kNumberFormat = 55,
     kDateTimeFormat = 56,
@@ -479,7 +483,7 @@ class V8_EXPORT Isolate {
     kListFormat = 60,
     kSegmenter = 61,
     kStringLocaleCompare = 62,
-    kStringToLocaleUpperCase = 63,
+    kStringToLocaleUpperCase V8_DEPRECATE_SOON("unused") = 63,
     kStringToLocaleLowerCase = 64,
     kNumberToLocaleString = 65,
     kDateToLocaleString = 66,
@@ -487,14 +491,14 @@ class V8_EXPORT Isolate {
     kDateToLocaleTimeString = 68,
     kAttemptOverrideReadOnlyOnPrototypeSloppy = 69,
     kAttemptOverrideReadOnlyOnPrototypeStrict = 70,
-    kOptimizedFunctionWithOneShotBytecode = 71,  // Unused.
+    kOptimizedFunctionWithOneShotBytecode V8_DEPRECATE_SOON("unused") = 71,
     kRegExpMatchIsTrueishOnNonJSRegExp = 72,
     kRegExpMatchIsFalseishOnJSRegExp = 73,
-    kDateGetTimezoneOffset = 74,  // Unused.
+    kDateGetTimezoneOffset V8_DEPRECATE_SOON("unused") = 74,
     kStringNormalize = 75,
     kCallSiteAPIGetFunctionSloppyCall = 76,
     kCallSiteAPIGetThisSloppyCall = 77,
-    kRegExpMatchAllWithNonGlobalRegExp = 78,
+    kRegExpMatchAllWithNonGlobalRegExp V8_DEPRECATE_SOON("unused") = 78,
     kRegExpExecCalledOnSlowRegExp = 79,
     kRegExpReplaceCalledOnSlowRegExp = 80,
     kDisplayNames = 81,
@@ -525,8 +529,10 @@ class V8_EXPORT Isolate {
     kWasmSimdOpcodes = 106,
     kVarRedeclaredCatchBinding = 107,
     kWasmRefTypes = 108,
-    kWasmBulkMemory = 109,  // Unused.
-    kWasmMultiValue = 110,
+    kWasmBulkMemory V8_DEPRECATE_SOON(
+        "Unused since 2021 (https://crrev.com/c/2622913)") = 109,
+    kWasmMultiValue V8_DEPRECATE_SOON(
+        "Unused since 2021 (https://crrev.com/c/2817790)") = 110,
     kWasmExceptionHandling = 111,
     kInvalidatedMegaDOMProtector = 112,
     kFunctionPrototypeArguments = 113,
@@ -534,8 +540,17 @@ class V8_EXPORT Isolate {
     kTurboFanOsrCompileStarted = 115,
     kAsyncStackTaggingCreateTaskCall = 116,
     kDurationFormat = 117,
-    kInvalidatedNumberStringPrototypeNoReplaceProtector = 118,
-    kRegExpUnicodeSetIncompatibilitiesWithUnicodeMode = 119,  // Unused.
+    kInvalidatedNumberStringNotRegexpLikeProtector = 118,
+    kRegExpUnicodeSetIncompatibilitiesWithUnicodeMode V8_DEPRECATE_SOON(
+        "unused") = 119,
+    kImportAssertionDeprecatedSyntax = 120,
+    kLocaleInfoObsoletedGetters = 121,
+    kLocaleInfoFunctions = 122,
+    kCompileHintsMagicAll = 123,
+    kInvalidatedNoProfilingProtector = 124,
+    kWasmMemory64 = 125,
+    kWasmMultiMemory = 126,
+    kWasmGC = 127,
 
     // If you add new values here, you'll also need to update Chromium's:
     // web_feature.mojom, use_counter_callback.cc, and enums.xml. V8 changes to
@@ -664,6 +679,13 @@ class V8_EXPORT Isolate {
    */
   void SetPrepareStackTraceCallback(PrepareStackTraceCallback callback);
 
+#if defined(V8_OS_WIN)
+  /**
+   * This specifies the callback called when an ETW tracing session starts.
+   */
+  void SetFilterETWSessionByURLCallback(FilterETWSessionByURLCallback callback);
+#endif  // V8_OS_WIN
+
   /**
    * Optional notification that the system is running low on memory.
    * V8 uses these notifications to guide heuristics.
@@ -904,25 +926,73 @@ class V8_EXPORT Isolate {
 
   /**
    * Enables the host application to receive a notification before a
-   * garbage collection. Allocations are allowed in the callback function,
-   * but the callback is not re-entrant: if the allocation inside it will
-   * trigger the garbage collection, the callback won't be called again.
-   * It is possible to specify the GCType filter for your callback. But it is
-   * not possible to register the same callback function two times with
-   * different GCType filters.
+   * garbage collection.
+   *
+   * \param callback The callback to be invoked. The callback is allowed to
+   *     allocate but invocation is not re-entrant: a callback triggering
+   *     garbage collection will not be called again. JS execution is prohibited
+   *     from these callbacks. A single callback may only be registered once.
+   * \param gc_type_filter A filter in case it should be applied.
    */
-  void AddGCPrologueCallback(GCCallbackWithData callback, void* data = nullptr,
-                             GCType gc_type_filter = kGCTypeAll);
   void AddGCPrologueCallback(GCCallback callback,
                              GCType gc_type_filter = kGCTypeAll);
 
   /**
-   * This function removes callback which was installed by
-   * AddGCPrologueCallback function.
+   * \copydoc AddGCPrologueCallback(GCCallback, GCType)
+   *
+   * \param data Additional data that should be passed to the callback.
+   */
+  void AddGCPrologueCallback(GCCallbackWithData callback, void* data = nullptr,
+                             GCType gc_type_filter = kGCTypeAll);
+
+  /**
+   * This function removes a callback which was added by
+   * `AddGCPrologueCallback`.
+   *
+   * \param callback the callback to remove.
    */
-  void RemoveGCPrologueCallback(GCCallbackWithData, void* data = nullptr);
   void RemoveGCPrologueCallback(GCCallback callback);
 
+  /**
+   * \copydoc AddGCPrologueCallback(GCCallback)
+   *
+   * \param data Additional data that was used to install the callback.
+   */
+  void RemoveGCPrologueCallback(GCCallbackWithData, void* data = nullptr);
+
+  /**
+   * Enables the host application to receive a notification after a
+   * garbage collection.
+   *
+   * \copydetails AddGCPrologueCallback(GCCallback, GCType)
+   */
+  void AddGCEpilogueCallback(GCCallback callback,
+                             GCType gc_type_filter = kGCTypeAll);
+
+  /**
+   * \copydoc AddGCEpilogueCallback(GCCallback, GCType)
+   *
+   * \param data Additional data that should be passed to the callback.
+   */
+  void AddGCEpilogueCallback(GCCallbackWithData callback, void* data = nullptr,
+                             GCType gc_type_filter = kGCTypeAll);
+
+  /**
+   * This function removes a callback which was added by
+   * `AddGCEpilogueCallback`.
+   *
+   * \param callback the callback to remove.
+   */
+  void RemoveGCEpilogueCallback(GCCallback callback);
+
+  /**
+   * \copydoc RemoveGCEpilogueCallback(GCCallback)
+   *
+   * \param data Additional data that was used to install the callback.
+   */
+  void RemoveGCEpilogueCallback(GCCallbackWithData callback,
+                                void* data = nullptr);
+
   /**
    * Sets an embedder roots handle that V8 should consider when performing
    * non-unified heap garbage collections. The intended use case is for setting
@@ -1032,28 +1102,6 @@ class V8_EXPORT Isolate {
    */
   void SetAtomicsWaitCallback(AtomicsWaitCallback callback, void* data);
 
-  /**
-   * Enables the host application to receive a notification after a
-   * garbage collection. Allocations are allowed in the callback function,
-   * but the callback is not re-entrant: if the allocation inside it will
-   * trigger the garbage collection, the callback won't be called again.
-   * It is possible to specify the GCType filter for your callback. But it is
-   * not possible to register the same callback function two times with
-   * different GCType filters.
-   */
-  void AddGCEpilogueCallback(GCCallbackWithData callback, void* data = nullptr,
-                             GCType gc_type_filter = kGCTypeAll);
-  void AddGCEpilogueCallback(GCCallback callback,
-                             GCType gc_type_filter = kGCTypeAll);
-
-  /**
-   * This function removes callback which was installed by
-   * AddGCEpilogueCallback function.
-   */
-  void RemoveGCEpilogueCallback(GCCallbackWithData callback,
-                                void* data = nullptr);
-  void RemoveGCEpilogueCallback(GCCallback callback);
-
   using GetExternallyAllocatedMemoryInBytesCallback = size_t (*)();
 
   /**
@@ -1321,20 +1369,6 @@ class V8_EXPORT Isolate {
    */
   void IsolateInBackgroundNotification();
 
-  /**
-   * Optional notification which will enable the memory savings mode.
-   * V8 uses this notification to guide heuristics which may result in a
-   * smaller memory footprint at the cost of reduced runtime performance.
-   */
-  V8_DEPRECATED("Use IsolateInBackgroundNotification() instead")
-  void EnableMemorySavingsMode();
-
-  /**
-   * Optional notification which will disable the memory savings mode.
-   */
-  V8_DEPRECATED("Use IsolateInBackgroundNotification() instead")
-  void DisableMemorySavingsMode();
-
   /**
    * Optional notification to tell V8 the current performance requirements
    * of the embedder based on RAIL.
@@ -1506,22 +1540,26 @@ class V8_EXPORT Isolate {
 
   void SetWasmLoadSourceMapCallback(WasmLoadSourceMapCallback callback);
 
-  V8_DEPRECATED("Wasm SIMD is always enabled")
-  void SetWasmSimdEnabledCallback(WasmSimdEnabledCallback callback);
-
-  V8_DEPRECATED("Wasm exceptions are always enabled")
-  void SetWasmExceptionsEnabledCallback(WasmExceptionsEnabledCallback callback);
-
   /**
-   * Register callback to control whehter Wasm GC is enabled.
+   * Register callback to control whether Wasm GC is enabled.
    * The callback overwrites the value of the flag.
    * If the callback returns true, it will also enable Wasm stringrefs.
    */
   void SetWasmGCEnabledCallback(WasmGCEnabledCallback callback);
 
+  void SetWasmImportedStringsEnabledCallback(
+      WasmImportedStringsEnabledCallback callback);
+
   void SetSharedArrayBufferConstructorEnabledCallback(
       SharedArrayBufferConstructorEnabledCallback callback);
 
+  /**
+   * Register callback to control whether compile hints magic comments are
+   * enabled.
+   */
+  void SetJavaScriptCompileHintsMagicEnabledCallback(
+      JavaScriptCompileHintsMagicEnabledCallback callback);
+
   /**
    * This function can be called by the embedder to signal V8 that the dynamic
    * enabling of features has finished. V8 can now set up dynamically added
@@ -1583,6 +1621,7 @@ class V8_EXPORT Isolate {
    * heap.  GC is not invoked prior to iterating, therefore there is no
    * guarantee that visited objects are still alive.
    */
+  V8_DEPRECATE_SOON("Will be removed without replacement. crbug.com/v8/14172")
   void VisitExternalResources(ExternalResourceVisitor* visitor);
 
   /**
@@ -1673,10 +1712,12 @@ uint32_t Isolate::GetNumberOfDataSlots() {
 
 template <class T>
 MaybeLocal<T> Isolate::GetDataFromSnapshotOnce(size_t index) {
-  T* data =
-      internal::ValueHelper::SlotAsValue<T>(GetDataFromSnapshotOnce(index));
-  if (data) internal::PerformCastCheck(data);
-  return Local<T>(data);
+  auto slot = GetDataFromSnapshotOnce(index);
+  if (slot) {
+    internal::PerformCastCheck(
+        internal::ValueHelper::SlotAsValue<T, false>(slot));
+  }
+  return Local<T>::FromSlot(slot);
 }
 
 }  // namespace v8
diff --git a/deps/v8/include/v8-local-handle.h b/deps/v8/include/v8-local-handle.h
index 0dbbfdbc9f7513..fab4a59f48f631 100644
--- a/deps/v8/include/v8-local-handle.h
+++ b/deps/v8/include/v8-local-handle.h
@@ -9,29 +9,42 @@
 
 #include <type_traits>
 
-#include "v8-internal.h"  // NOLINT(build/include_directory)
+#include "v8-handle-base.h"  // NOLINT(build/include_directory)
 
 namespace v8 {
 
-class Boolean;
 template <class T>
-class BasicTracedReference;
-class Context;
-class EscapableHandleScope;
-template <class F>
-class Eternal;
-template <class F>
-class FunctionCallbackInfo;
-class Isolate;
+class LocalBase;
+template <class T>
+class Local;
 template <class F>
 class MaybeLocal;
+
+template <class T>
+class Eternal;
+template <class T>
+class Global;
+
 template <class T>
 class NonCopyablePersistentTraits;
-class Object;
+template <class T>
+class PersistentBase;
 template <class T, class M = NonCopyablePersistentTraits<T>>
 class Persistent;
+
+class TracedReferenceBase;
 template <class T>
-class PersistentBase;
+class BasicTracedReference;
+template <class F>
+class TracedReference;
+
+class Boolean;
+class Context;
+class EscapableHandleScope;
+template <class F>
+class FunctionCallbackInfo;
+class Isolate;
+class Object;
 template <class F1, class F2, class F3>
 class PersistentValueMapBase;
 template <class F1, class F2>
@@ -45,9 +58,6 @@ class ReturnValue;
 class String;
 template <class F>
 class Traced;
-template <class F>
-class TracedReference;
-class TracedReferenceBase;
 class Utils;
 
 namespace debug {
@@ -120,9 +130,9 @@ class V8_EXPORT V8_NODISCARD HandleScope {
   internal::Address* prev_next_;
   internal::Address* prev_limit_;
 
-  // Local::New uses CreateHandle with an Isolate* parameter.
-  template <class F>
-  friend class Local;
+  // LocalBase<T>::New uses CreateHandle with an Isolate* parameter.
+  template <typename T>
+  friend class LocalBase;
 
   // Object::GetInternalField and Context::GetEmbedderData use CreateHandle with
   // a HeapObject in their shortcuts.
@@ -130,32 +140,74 @@ class V8_EXPORT V8_NODISCARD HandleScope {
   friend class Context;
 };
 
-namespace internal {
-
 /**
- * Helper functions about handles.
+ * A base class for local handles.
+ * Its implementation depends on whether direct local support is enabled.
+ * When it is, a local handle contains a direct pointer to the referenced
+ * object, otherwise it contains an indirect pointer.
  */
-class HandleHelper final {
- public:
-  /**
-   * Checks whether two handles are equal.
-   * They are equal iff they are both empty or they are both non-empty and the
-   * objects to which they refer are physically equal.
-   *
-   * If both handles refer to JS objects, this is the same as strict equality.
-   * For primitives, such as numbers or strings, a `false` return value does not
-   * indicate that the values aren't equal in the JavaScript sense.
-   * Use `Value::StrictEquals()` to check primitives for equality.
-   */
-  template <typename T1, typename T2>
-  V8_INLINE static bool EqualHandles(const T1& lhs, const T2& rhs) {
-    if (lhs.IsEmpty()) return rhs.IsEmpty();
-    if (rhs.IsEmpty()) return false;
-    return lhs.address() == rhs.address();
+#ifdef V8_ENABLE_DIRECT_LOCAL
+
+template <typename T>
+class LocalBase : public DirectHandleBase {
+ protected:
+  template <class F>
+  friend class Local;
+
+  V8_INLINE LocalBase() = default;
+
+  V8_INLINE explicit LocalBase(internal::Address ptr) : DirectHandleBase(ptr) {}
+
+  template <typename S>
+  V8_INLINE LocalBase(const LocalBase<S>& other) : DirectHandleBase(other) {}
+
+  V8_INLINE static LocalBase<T> New(Isolate* isolate, internal::Address value) {
+    return LocalBase<T>(value);
+  }
+
+  V8_INLINE static LocalBase<T> New(Isolate* isolate, T* that) {
+    return LocalBase<T>::New(isolate,
+                             internal::ValueHelper::ValueAsAddress(that));
+  }
+
+  V8_INLINE static LocalBase<T> FromSlot(internal::Address* slot) {
+    return LocalBase<T>(*slot);
   }
 };
 
-}  // namespace internal
+#else  // !V8_ENABLE_DIRECT_LOCAL
+
+template <typename T>
+class LocalBase : public IndirectHandleBase {
+ protected:
+  template <class F>
+  friend class Local;
+
+  V8_INLINE LocalBase() = default;
+
+  V8_INLINE explicit LocalBase(internal::Address* location)
+      : IndirectHandleBase(location) {}
+
+  template <typename S>
+  V8_INLINE LocalBase(const LocalBase<S>& other) : IndirectHandleBase(other) {}
+
+  V8_INLINE static LocalBase<T> New(Isolate* isolate, internal::Address value) {
+    return LocalBase(HandleScope::CreateHandle(
+        reinterpret_cast<internal::Isolate*>(isolate), value));
+  }
+
+  V8_INLINE static LocalBase<T> New(Isolate* isolate, T* that) {
+    if (internal::ValueHelper::IsEmpty(that)) return LocalBase<T>();
+    return LocalBase<T>::New(isolate,
+                             internal::ValueHelper::ValueAsAddress(that));
+  }
+
+  V8_INLINE static LocalBase<T> FromSlot(internal::Address* slot) {
+    return LocalBase<T>(slot);
+  }
+};
+
+#endif  // V8_ENABLE_DIRECT_LOCAL
 
 /**
  * An object reference managed by the v8 garbage collector.
@@ -187,12 +239,12 @@ class HandleHelper final {
  * to these values as to their handles.
  */
 template <class T>
-class Local {
+class Local : public LocalBase<T> {
  public:
-  V8_INLINE Local() : val_(internal::ValueHelper::EmptyValue<T>()) {}
+  V8_INLINE Local() = default;
 
   template <class S>
-  V8_INLINE Local(Local<S> that) : val_(reinterpret_cast<T*>(*that)) {
+  V8_INLINE Local(Local<S> that) : LocalBase<T>(that) {
     /**
      * This check fails when trying to convert between incompatible
      * handles. For example, converting from a Local<String> to a
@@ -201,21 +253,9 @@ class Local {
     static_assert(std::is_base_of<T, S>::value, "type check");
   }
 
-  /**
-   * Returns true if the handle is empty.
-   */
-  V8_INLINE bool IsEmpty() const {
-    return val_ == internal::ValueHelper::EmptyValue<T>();
-  }
-
-  /**
-   * Sets the handle to be empty. IsEmpty() will then return true.
-   */
-  V8_INLINE void Clear() { val_ = internal::ValueHelper::EmptyValue<T>(); }
-
-  V8_INLINE T* operator->() const { return val_; }
+  V8_INLINE T* operator->() const { return this->template value<T>(); }
 
-  V8_INLINE T* operator*() const { return val_; }
+  V8_INLINE T* operator*() const { return this->operator->(); }
 
   /**
    * Checks whether two handles are equal or different.
@@ -259,8 +299,9 @@ class Local {
     // If we're going to perform the type check then we have to check
     // that the handle isn't empty before doing the checked cast.
     if (that.IsEmpty()) return Local<T>();
+    T::Cast(that.template value<S>());
 #endif
-    return Local<T>(T::Cast(*that));
+    return Local<T>(LocalBase<T>(that));
   }
 
   /**
@@ -279,17 +320,17 @@ class Local {
    * the original handle is destroyed/disposed.
    */
   V8_INLINE static Local<T> New(Isolate* isolate, Local<T> that) {
-    return New(isolate, that.val_);
+    return New(isolate, that.template value<T>());
   }
 
   V8_INLINE static Local<T> New(Isolate* isolate,
                                 const PersistentBase<T>& that) {
-    return New(isolate, internal::ValueHelper::SlotAsValue<T>(that.val_));
+    return New(isolate, that.template value<T>());
   }
 
   V8_INLINE static Local<T> New(Isolate* isolate,
                                 const BasicTracedReference<T>& that) {
-    return New(isolate, internal::ValueHelper::SlotAsValue<T>(*that));
+    return New(isolate, that.template value<T>());
   }
 
  private:
@@ -298,7 +339,13 @@ class Local {
   template <class F>
   friend class Eternal;
   template <class F>
+  friend class Global;
+  template <class F>
+  friend class Local;
+  template <class F>
   friend class MaybeLocal;
+  template <class F, class M>
+  friend class Persistent;
   template <class F>
   friend class FunctionCallbackInfo;
   template <class F>
@@ -328,28 +375,32 @@ class Local {
   friend class internal::HandleHelper;
   friend class debug::ConsoleCallArguments;
 
-  explicit V8_INLINE Local(T* that) : val_(that) {}
+  V8_INLINE explicit Local<T>(const LocalBase<T>& other)
+      : LocalBase<T>(other) {}
 
-  V8_INLINE internal::Address address() const {
-    return internal::ValueHelper::ValueAsAddress(val_);
+  V8_INLINE static Local<T> FromSlot(internal::Address* slot) {
+    return Local<T>(LocalBase<T>::FromSlot(slot));
   }
 
-  V8_INLINE static Local<T> FromSlot(internal::Address* slot) {
-    return Local<T>(internal::ValueHelper::SlotAsValue<T>(slot));
+#ifdef V8_ENABLE_DIRECT_LOCAL
+  V8_INLINE static Local<T> FromAddress(internal::Address ptr) {
+    return Local<T>(LocalBase<T>(ptr));
+  }
+#endif  // V8_ENABLE_DIRECT_LOCAL
+
+  V8_INLINE static Local<T> New(Isolate* isolate, internal::Address value) {
+    return Local<T>(LocalBase<T>::New(isolate, value));
   }
 
   V8_INLINE static Local<T> New(Isolate* isolate, T* that) {
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
-    return Local<T>(that);
-#else
-    if (that == nullptr) return Local<T>();
-    internal::Address* p = reinterpret_cast<internal::Address*>(that);
-    return Local<T>(reinterpret_cast<T*>(HandleScope::CreateHandle(
-        reinterpret_cast<internal::Isolate*>(isolate), *p)));
-#endif
+    return Local<T>(LocalBase<T>::New(isolate, that));
   }
 
-  T* val_;
+  // Unsafe cast, should be avoided.
+  template <class S>
+  V8_INLINE Local<S> UnsafeAs() const {
+    return Local<S>(LocalBase<S>(*this));
+  }
 };
 
 #if !defined(V8_IMMINENT_DEPRECATION_WARNINGS)
@@ -371,15 +422,11 @@ using Handle = Local<T>;
 template <class T>
 class MaybeLocal {
  public:
-  V8_INLINE MaybeLocal() : val_(internal::ValueHelper::EmptyValue<T>()) {}
+  V8_INLINE MaybeLocal() : local_() {}
   template <class S>
-  V8_INLINE MaybeLocal(Local<S> that) : val_(reinterpret_cast<T*>(*that)) {
-    static_assert(std::is_base_of<T, S>::value, "type check");
-  }
+  V8_INLINE MaybeLocal(Local<S> that) : local_(that) {}
 
-  V8_INLINE bool IsEmpty() const {
-    return val_ == internal::ValueHelper::EmptyValue<T>();
-  }
+  V8_INLINE bool IsEmpty() const { return local_.IsEmpty(); }
 
   /**
    * Converts this MaybeLocal<> to a Local<>. If this MaybeLocal<> is empty,
@@ -387,7 +434,7 @@ class MaybeLocal {
    */
   template <class S>
   V8_WARN_UNUSED_RESULT V8_INLINE bool ToLocal(Local<S>* out) const {
-    out->val_ = IsEmpty() ? internal::ValueHelper::EmptyValue<T>() : this->val_;
+    *out = local_;
     return !IsEmpty();
   }
 
@@ -397,7 +444,7 @@ class MaybeLocal {
    */
   V8_INLINE Local<T> ToLocalChecked() {
     if (V8_UNLIKELY(IsEmpty())) api_internal::ToLocalEmpty();
-    return Local<T>(val_);
+    return local_;
   }
 
   /**
@@ -406,11 +453,11 @@ class MaybeLocal {
    */
   template <class S>
   V8_INLINE Local<S> FromMaybe(Local<S> default_value) const {
-    return IsEmpty() ? default_value : Local<S>(val_);
+    return IsEmpty() ? default_value : Local<S>(local_);
   }
 
  private:
-  T* val_;
+  Local<T> local_;
 };
 
 /**
@@ -428,12 +475,10 @@ class V8_EXPORT V8_NODISCARD EscapableHandleScope : public HandleScope {
    */
   template <class T>
   V8_INLINE Local<T> Escape(Local<T> value) {
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+#ifdef V8_ENABLE_DIRECT_LOCAL
     return value;
 #else
-    internal::Address* slot =
-        Escape(reinterpret_cast<internal::Address*>(*value));
-    return Local<T>(reinterpret_cast<T*>(slot));
+    return Local<T>::FromSlot(Escape(value.slot()));
 #endif
   }
 
diff --git a/deps/v8/include/v8-object.h b/deps/v8/include/v8-object.h
index b34253d7ac5a8e..45660924dd055a 100644
--- a/deps/v8/include/v8-object.h
+++ b/deps/v8/include/v8-object.h
@@ -165,17 +165,16 @@ using AccessorNameSetterCallback =
 /**
  * Access control specifications.
  *
- * Some accessors should be accessible across contexts.  These
+ * Some accessors should be accessible across contexts. These
  * accessors have an explicit access control parameter which specifies
  * the kind of cross-context access that should be allowed.
  *
- * TODO(dcarney): Remove PROHIBITS_OVERWRITING as it is now unused.
  */
 enum AccessControl {
   DEFAULT = 0,
   ALL_CAN_READ = 1,
   ALL_CAN_WRITE = 1 << 1,
-  PROHIBITS_OVERWRITING = 1 << 2
+  PROHIBITS_OVERWRITING V8_ENUM_DEPRECATE_SOON("unused") = 1 << 2
 };
 
 /**
@@ -247,13 +246,16 @@ class V8_EXPORT Object : public Value {
   V8_WARN_UNUSED_RESULT Maybe<bool> Set(Local<Context> context, uint32_t index,
                                         Local<Value> value);
 
-  // Implements CreateDataProperty (ECMA-262, 7.3.4).
-  //
-  // Defines a configurable, writable, enumerable property with the given value
-  // on the object unless the property already exists and is not configurable
-  // or the object is not extensible.
-  //
-  // Returns true on success.
+  /**
+   * Implements CreateDataProperty(O, P, V), see
+   * https://tc39.es/ecma262/#sec-createdataproperty.
+   *
+   * Defines a configurable, writable, enumerable property with the given value
+   * on the object unless the property already exists and is not configurable
+   * or the object is not extensible.
+   *
+   * Returns true on success.
+   */
   V8_WARN_UNUSED_RESULT Maybe<bool> CreateDataProperty(Local<Context> context,
                                                        Local<Name> key,
                                                        Local<Value> value);
@@ -261,29 +263,35 @@ class V8_EXPORT Object : public Value {
                                                        uint32_t index,
                                                        Local<Value> value);
 
-  // Implements DefineOwnProperty.
-  //
-  // In general, CreateDataProperty will be faster, however, does not allow
-  // for specifying attributes.
-  //
-  // Returns true on success.
+  /**
+   * Implements [[DefineOwnProperty]] for data property case, see
+   * https://tc39.es/ecma262/#table-essential-internal-methods.
+   *
+   * In general, CreateDataProperty will be faster, however, does not allow
+   * for specifying attributes.
+   *
+   * Returns true on success.
+   */
   V8_WARN_UNUSED_RESULT Maybe<bool> DefineOwnProperty(
       Local<Context> context, Local<Name> key, Local<Value> value,
       PropertyAttribute attributes = None);
 
-  // Implements Object.DefineProperty(O, P, Attributes), see Ecma-262 19.1.2.4.
-  //
-  // The defineProperty function is used to add an own property or
-  // update the attributes of an existing own property of an object.
-  //
-  // Both data and accessor descriptors can be used.
-  //
-  // In general, CreateDataProperty is faster, however, does not allow
-  // for specifying attributes or an accessor descriptor.
-  //
-  // The PropertyDescriptor can change when redefining a property.
-  //
-  // Returns true on success.
+  /**
+   * Implements Object.defineProperty(O, P, Attributes), see
+   * https://tc39.es/ecma262/#sec-object.defineproperty.
+   *
+   * The defineProperty function is used to add an own property or
+   * update the attributes of an existing own property of an object.
+   *
+   * Both data and accessor descriptors can be used.
+   *
+   * In general, CreateDataProperty is faster, however, does not allow
+   * for specifying attributes or an accessor descriptor.
+   *
+   * The PropertyDescriptor can change when redefining a property.
+   *
+   * Returns true on success.
+   */
   V8_WARN_UNUSED_RESULT Maybe<bool> DefineProperty(
       Local<Context> context, Local<Name> key, PropertyDescriptor& descriptor);
 
@@ -302,14 +310,15 @@ class V8_EXPORT Object : public Value {
       Local<Context> context, Local<Value> key);
 
   /**
-   * Returns Object.getOwnPropertyDescriptor as per ES2016 section 19.1.2.6.
+   * Implements Object.getOwnPropertyDescriptor(O, P), see
+   * https://tc39.es/ecma262/#sec-object.getownpropertydescriptor.
    */
   V8_WARN_UNUSED_RESULT MaybeLocal<Value> GetOwnPropertyDescriptor(
       Local<Context> context, Local<Name> key);
 
   /**
-   * Object::Has() calls the abstract operation HasProperty(O, P) described
-   * in ECMA-262, 7.3.10. Has() returns
+   * Object::Has() calls the abstract operation HasProperty(O, P), see
+   * https://tc39.es/ecma262/#sec-hasproperty. Has() returns
    * true, if the object has the property, either own or on the prototype chain.
    * Interceptors, i.e., PropertyQueryCallbacks, are called if present.
    *
@@ -347,7 +356,7 @@ class V8_EXPORT Object : public Value {
 
   void SetAccessorProperty(Local<Name> name, Local<Function> getter,
                            Local<Function> setter = Local<Function>(),
-                           PropertyAttribute attribute = None,
+                           PropertyAttribute attributes = None,
                            AccessControl settings = DEFAULT);
 
   /**
@@ -465,13 +474,13 @@ class V8_EXPORT Object : public Value {
   /** Same as above, but works for PersistentBase. */
   V8_INLINE static int InternalFieldCount(
       const PersistentBase<Object>& object) {
-    return object.val_->InternalFieldCount();
+    return object.template value<Object>()->InternalFieldCount();
   }
 
   /** Same as above, but works for BasicTracedReference. */
   V8_INLINE static int InternalFieldCount(
       const BasicTracedReference<Object>& object) {
-    return object->InternalFieldCount();
+    return object.template value<Object>()->InternalFieldCount();
   }
 
   /**
@@ -499,13 +508,15 @@ class V8_EXPORT Object : public Value {
   /** Same as above, but works for PersistentBase. */
   V8_INLINE static void* GetAlignedPointerFromInternalField(
       const PersistentBase<Object>& object, int index) {
-    return object.val_->GetAlignedPointerFromInternalField(index);
+    return object.template value<Object>()->GetAlignedPointerFromInternalField(
+        index);
   }
 
   /** Same as above, but works for TracedReference. */
   V8_INLINE static void* GetAlignedPointerFromInternalField(
       const BasicTracedReference<Object>& object, int index) {
-    return object->GetAlignedPointerFromInternalField(index);
+    return object.template value<Object>()->GetAlignedPointerFromInternalField(
+        index);
   }
 
   /**
@@ -613,7 +624,7 @@ class V8_EXPORT Object : public Value {
   /** Same as above, but works for Persistents */
   V8_INLINE static MaybeLocal<Context> GetCreationContext(
       const PersistentBase<Object>& object) {
-    return object.val_->GetCreationContext();
+    return object.template value<Object>()->GetCreationContext();
   }
 
   /**
@@ -679,6 +690,10 @@ class V8_EXPORT Object : public Value {
    */
   Isolate* GetIsolate();
 
+  V8_INLINE static Isolate* GetIsolate(const TracedReference<Object>& handle) {
+    return handle.template value<Object>()->GetIsolate();
+  }
+
   /**
    * If this object is a Set, Map, WeakSet or WeakMap, this returns a
    * representation of the elements of this object as an array.
@@ -742,14 +757,9 @@ Local<Data> Object::GetInternalField(int index) {
     value = I::DecompressTaggedField(obj, static_cast<uint32_t>(value));
 #endif
 
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
-    return Local<Data>(reinterpret_cast<Data*>(value));
-#else
-    internal::Isolate* isolate =
-        internal::IsolateFromNeverReadOnlySpaceObject(obj);
-    A* result = HandleScope::CreateHandle(isolate, value);
-    return Local<Data>(reinterpret_cast<Data*>(result));
-#endif
+    auto isolate = reinterpret_cast<v8::Isolate*>(
+        internal::IsolateFromNeverReadOnlySpaceObject(obj));
+    return Local<Data>::New(isolate, value);
   }
 #endif
   return SlowGetInternalField(index);
diff --git a/deps/v8/include/v8-persistent-handle.h b/deps/v8/include/v8-persistent-handle.h
index fbae1aa6f284e2..200a81e5fbdcf4 100644
--- a/deps/v8/include/v8-persistent-handle.h
+++ b/deps/v8/include/v8-persistent-handle.h
@@ -26,7 +26,7 @@ class PersistentValueMap;
 class Value;
 
 namespace api_internal {
-V8_EXPORT Value* Eternalize(v8::Isolate* isolate, Value* handle);
+V8_EXPORT internal::Address* Eternalize(v8::Isolate* isolate, Value* handle);
 V8_EXPORT internal::Address* CopyGlobalReference(internal::Address* from);
 V8_EXPORT void DisposeGlobal(internal::Address* global_handle);
 V8_EXPORT void MakeWeak(internal::Address** location_addr);
@@ -34,7 +34,7 @@ V8_EXPORT void* ClearWeak(internal::Address* location);
 V8_EXPORT void AnnotateStrongRetainer(internal::Address* location,
                                       const char* label);
 V8_EXPORT internal::Address* GlobalizeReference(internal::Isolate* isolate,
-                                                internal::Address* handle);
+                                                internal::Address value);
 V8_EXPORT void MoveGlobalReference(internal::Address** from,
                                    internal::Address** to);
 }  // namespace api_internal
@@ -44,35 +44,28 @@ V8_EXPORT void MoveGlobalReference(internal::Address** from,
  * isolate.
  */
 template <class T>
-class Eternal {
+class Eternal : public IndirectHandleBase {
  public:
-  V8_INLINE Eternal() : val_(nullptr) {}
+  V8_INLINE Eternal() = default;
+
   template <class S>
-  V8_INLINE Eternal(Isolate* isolate, Local<S> handle) : val_(nullptr) {
+  V8_INLINE Eternal(Isolate* isolate, Local<S> handle) {
     Set(isolate, handle);
   }
+
   // Can only be safely called if already set.
   V8_INLINE Local<T> Get(Isolate* isolate) const {
     // The eternal handle will never go away, so as with the roots, we don't
     // even need to open a handle.
-    return Local<T>(internal::ValueHelper::SlotAsValue<T>(val_));
+    return Local<T>::FromSlot(slot());
   }
 
-  V8_INLINE bool IsEmpty() const { return val_ == nullptr; }
-
   template <class S>
   void Set(Isolate* isolate, Local<S> handle) {
     static_assert(std::is_base_of<T, S>::value, "type check");
-    val_ = reinterpret_cast<T*>(
-        api_internal::Eternalize(isolate, reinterpret_cast<Value*>(*handle)));
-  }
-
- private:
-  V8_INLINE internal::Address address() const {
-    return *reinterpret_cast<internal::Address*>(val_);
+    slot() =
+        api_internal::Eternalize(isolate, *handle.template UnsafeAs<Value>());
   }
-
-  T* val_;
 };
 
 namespace api_internal {
@@ -95,7 +88,7 @@ V8_EXPORT void MakeWeak(internal::Address* location, void* data,
  *
  */
 template <class T>
-class PersistentBase {
+class PersistentBase : public IndirectHandleBase {
  public:
   /**
    * If non-empty, destroy the underlying storage cell
@@ -117,9 +110,6 @@ class PersistentBase {
   template <class S>
   V8_INLINE void Reset(Isolate* isolate, const PersistentBase<S>& other);
 
-  V8_INLINE bool IsEmpty() const { return val_ == nullptr; }
-  V8_INLINE void Empty() { val_ = 0; }
-
   V8_INLINE Local<T> Get(Isolate* isolate) const {
     return Local<T>::New(isolate, *this);
   }
@@ -217,18 +207,14 @@ class PersistentBase {
   template <class F1, class F2>
   friend class PersistentValueVector;
   friend class Object;
-  friend class internal::HandleHelper;
+  friend class internal::ValueHelper;
 
-  explicit V8_INLINE PersistentBase(T* val) : val_(val) {}
-  V8_INLINE T* operator*() const { return this->val_; }
-  V8_INLINE internal::Address address() const {
-    return *reinterpret_cast<internal::Address*>(val_);
-  }
+  V8_INLINE PersistentBase() = default;
 
-  V8_INLINE static T* New(Isolate* isolate, Local<T> that);
-  V8_INLINE static T* New(Isolate* isolate, T* that);
+  V8_INLINE explicit PersistentBase(internal::Address* location)
+      : IndirectHandleBase(location) {}
 
-  T* val_;
+  V8_INLINE static internal::Address* New(Isolate* isolate, T* that);
 };
 
 /**
@@ -279,16 +265,17 @@ class Persistent : public PersistentBase<T> {
   /**
    * A Persistent with no storage cell.
    */
-  V8_INLINE Persistent() : PersistentBase<T>(nullptr) {}
+  V8_INLINE Persistent() = default;
+
   /**
    * Construct a Persistent from a Local.
    * When the Local is non-empty, a new storage cell is created
    * pointing to the same object, and no flags are set.
    */
-
   template <class S>
   V8_INLINE Persistent(Isolate* isolate, Local<S> that)
-      : PersistentBase<T>(PersistentBase<T>::New(isolate, that)) {
+      : PersistentBase<T>(
+            PersistentBase<T>::New(isolate, that.template value<S>())) {
     static_assert(std::is_base_of<T, S>::value, "type check");
   }
 
@@ -299,20 +286,22 @@ class Persistent : public PersistentBase<T> {
    */
   template <class S, class M2>
   V8_INLINE Persistent(Isolate* isolate, const Persistent<S, M2>& that)
-      : PersistentBase<T>(PersistentBase<T>::New(isolate, *that)) {
+      : PersistentBase<T>(
+            PersistentBase<T>::New(isolate, that.template value<S>())) {
     static_assert(std::is_base_of<T, S>::value, "type check");
   }
+
   /**
    * The copy constructors and assignment operator create a Persistent
    * exactly as the Persistent constructor, but the Copy function from the
    * traits class is called, allowing the setting of flags based on the
    * copied Persistent.
    */
-  V8_INLINE Persistent(const Persistent& that) : PersistentBase<T>(nullptr) {
+  V8_INLINE Persistent(const Persistent& that) : PersistentBase<T>() {
     Copy(that);
   }
   template <class S, class M2>
-  V8_INLINE Persistent(const Persistent<S, M2>& that) : PersistentBase<T>(0) {
+  V8_INLINE Persistent(const Persistent<S, M2>& that) : PersistentBase<T>() {
     Copy(that);
   }
   V8_INLINE Persistent& operator=(const Persistent& that) {
@@ -324,6 +313,7 @@ class Persistent : public PersistentBase<T> {
     Copy(that);
     return *this;
   }
+
   /**
    * The destructor will dispose the Persistent based on the
    * kResetInDestructor flags in the traits class.  Since not calling dispose
@@ -334,20 +324,21 @@ class Persistent : public PersistentBase<T> {
   }
 
   // TODO(dcarney): this is pretty useless, fix or remove
-  template <class S>
-  V8_INLINE static Persistent<T>& Cast(const Persistent<S>& that) {
+  template <class S, class M2>
+  V8_INLINE static Persistent<T, M>& Cast(const Persistent<S, M2>& that) {
 #ifdef V8_ENABLE_CHECKS
     // If we're going to perform the type check then we have to check
     // that the handle isn't empty before doing the checked cast.
-    if (!that.IsEmpty()) T::Cast(*that);
+    if (!that.IsEmpty()) T::Cast(that.template value<S>());
 #endif
-    return reinterpret_cast<Persistent<T>&>(const_cast<Persistent<S>&>(that));
+    return reinterpret_cast<Persistent<T, M>&>(
+        const_cast<Persistent<S, M2>&>(that));
   }
 
   // TODO(dcarney): this is pretty useless, fix or remove
-  template <class S>
-  V8_INLINE Persistent<S>& As() const {
-    return Persistent<S>::Cast(*this);
+  template <class S, class M2>
+  V8_INLINE Persistent<S, M2>& As() const {
+    return Persistent<S, M2>::Cast(*this);
   }
 
  private:
@@ -360,7 +351,6 @@ class Persistent : public PersistentBase<T> {
   template <class F>
   friend class ReturnValue;
 
-  explicit V8_INLINE Persistent(T* that) : PersistentBase<T>(that) {}
   template <class S, class M2>
   V8_INLINE void Copy(const Persistent<S, M2>& that);
 };
@@ -376,7 +366,7 @@ class Global : public PersistentBase<T> {
   /**
    * A Global with no storage cell.
    */
-  V8_INLINE Global() : PersistentBase<T>(nullptr) {}
+  V8_INLINE Global() = default;
 
   /**
    * Construct a Global from a Local.
@@ -385,7 +375,8 @@ class Global : public PersistentBase<T> {
    */
   template <class S>
   V8_INLINE Global(Isolate* isolate, Local<S> that)
-      : PersistentBase<T>(PersistentBase<T>::New(isolate, that)) {
+      : PersistentBase<T>(
+            PersistentBase<T>::New(isolate, that.template value<S>())) {
     static_assert(std::is_base_of<T, S>::value, "type check");
   }
 
@@ -396,7 +387,8 @@ class Global : public PersistentBase<T> {
    */
   template <class S>
   V8_INLINE Global(Isolate* isolate, const PersistentBase<S>& that)
-      : PersistentBase<T>(PersistentBase<T>::New(isolate, that.val_)) {
+      : PersistentBase<T>(
+            PersistentBase<T>::New(isolate, that.template value<S>())) {
     static_assert(std::is_base_of<T, S>::value, "type check");
   }
 
@@ -446,17 +438,11 @@ class V8_EXPORT PersistentHandleVisitor {
 };
 
 template <class T>
-T* PersistentBase<T>::New(Isolate* isolate, Local<T> that) {
-  return PersistentBase<T>::New(isolate,
-                                internal::ValueHelper::ValueAsSlot(*that));
-}
-
-template <class T>
-T* PersistentBase<T>::New(Isolate* isolate, T* that) {
-  if (that == nullptr) return nullptr;
-  internal::Address* p = reinterpret_cast<internal::Address*>(that);
-  return reinterpret_cast<T*>(api_internal::GlobalizeReference(
-      reinterpret_cast<internal::Isolate*>(isolate), p));
+internal::Address* PersistentBase<T>::New(Isolate* isolate, T* that) {
+  if (internal::ValueHelper::IsEmpty(that)) return nullptr;
+  return api_internal::GlobalizeReference(
+      reinterpret_cast<internal::Isolate*>(isolate),
+      internal::ValueHelper::ValueAsAddress(that));
 }
 
 template <class T, class M>
@@ -465,8 +451,7 @@ void Persistent<T, M>::Copy(const Persistent<S, M2>& that) {
   static_assert(std::is_base_of<T, S>::value, "type check");
   this->Reset();
   if (that.IsEmpty()) return;
-  internal::Address* p = reinterpret_cast<internal::Address*>(that.val_);
-  this->val_ = reinterpret_cast<T*>(api_internal::CopyGlobalReference(p));
+  this->slot() = api_internal::CopyGlobalReference(that.slot());
   M::Copy(that, this);
 }
 
@@ -474,15 +459,14 @@ template <class T>
 bool PersistentBase<T>::IsWeak() const {
   using I = internal::Internals;
   if (this->IsEmpty()) return false;
-  return I::GetNodeState(reinterpret_cast<internal::Address*>(this->val_)) ==
-         I::kNodeStateIsWeakValue;
+  return I::GetNodeState(this->slot()) == I::kNodeStateIsWeakValue;
 }
 
 template <class T>
 void PersistentBase<T>::Reset() {
   if (this->IsEmpty()) return;
-  api_internal::DisposeGlobal(reinterpret_cast<internal::Address*>(this->val_));
-  val_ = nullptr;
+  api_internal::DisposeGlobal(this->slot());
+  this->Clear();
 }
 
 /**
@@ -495,7 +479,7 @@ void PersistentBase<T>::Reset(Isolate* isolate, const Local<S>& other) {
   static_assert(std::is_base_of<T, S>::value, "type check");
   Reset();
   if (other.IsEmpty()) return;
-  this->val_ = New(isolate, internal::ValueHelper::ValueAsSlot(*other));
+  this->slot() = New(isolate, *other);
 }
 
 /**
@@ -509,7 +493,7 @@ void PersistentBase<T>::Reset(Isolate* isolate,
   static_assert(std::is_base_of<T, S>::value, "type check");
   Reset();
   if (other.IsEmpty()) return;
-  this->val_ = New(isolate, other.val_);
+  this->slot() = New(isolate, other.template value<S>());
 }
 
 template <class T>
@@ -522,8 +506,8 @@ V8_INLINE void PersistentBase<T>::SetWeak(
 #pragma GCC diagnostic push
 #pragma GCC diagnostic ignored "-Wcast-function-type"
 #endif
-  api_internal::MakeWeak(reinterpret_cast<internal::Address*>(this->val_),
-                         parameter, reinterpret_cast<Callback>(callback), type);
+  api_internal::MakeWeak(this->slot(), parameter,
+                         reinterpret_cast<Callback>(callback), type);
 #if (__GNUC__ >= 8) && !defined(__clang__)
 #pragma GCC diagnostic pop
 #endif
@@ -531,28 +515,25 @@ V8_INLINE void PersistentBase<T>::SetWeak(
 
 template <class T>
 void PersistentBase<T>::SetWeak() {
-  api_internal::MakeWeak(reinterpret_cast<internal::Address**>(&this->val_));
+  api_internal::MakeWeak(&this->slot());
 }
 
 template <class T>
 template <typename P>
 P* PersistentBase<T>::ClearWeak() {
-  return reinterpret_cast<P*>(api_internal::ClearWeak(
-      reinterpret_cast<internal::Address*>(this->val_)));
+  return reinterpret_cast<P*>(api_internal::ClearWeak(this->slot()));
 }
 
 template <class T>
 void PersistentBase<T>::AnnotateStrongRetainer(const char* label) {
-  api_internal::AnnotateStrongRetainer(
-      reinterpret_cast<internal::Address*>(this->val_), label);
+  api_internal::AnnotateStrongRetainer(this->slot(), label);
 }
 
 template <class T>
 void PersistentBase<T>::SetWrapperClassId(uint16_t class_id) {
   using I = internal::Internals;
   if (this->IsEmpty()) return;
-  internal::Address* obj = reinterpret_cast<internal::Address*>(this->val_);
-  uint8_t* addr = reinterpret_cast<uint8_t*>(obj) + I::kNodeClassIdOffset;
+  uint8_t* addr = reinterpret_cast<uint8_t*>(slot()) + I::kNodeClassIdOffset;
   *reinterpret_cast<uint16_t*>(addr) = class_id;
 }
 
@@ -560,18 +541,15 @@ template <class T>
 uint16_t PersistentBase<T>::WrapperClassId() const {
   using I = internal::Internals;
   if (this->IsEmpty()) return 0;
-  internal::Address* obj = reinterpret_cast<internal::Address*>(this->val_);
-  uint8_t* addr = reinterpret_cast<uint8_t*>(obj) + I::kNodeClassIdOffset;
+  uint8_t* addr = reinterpret_cast<uint8_t*>(slot()) + I::kNodeClassIdOffset;
   return *reinterpret_cast<uint16_t*>(addr);
 }
 
 template <class T>
-Global<T>::Global(Global&& other) : PersistentBase<T>(other.val_) {
-  if (other.val_ != nullptr) {
-    api_internal::MoveGlobalReference(
-        reinterpret_cast<internal::Address**>(&other.val_),
-        reinterpret_cast<internal::Address**>(&this->val_));
-    other.val_ = nullptr;
+Global<T>::Global(Global&& other) : PersistentBase<T>(other.slot()) {
+  if (!other.IsEmpty()) {
+    api_internal::MoveGlobalReference(&other.slot(), &this->slot());
+    other.Clear();
   }
 }
 
@@ -581,12 +559,10 @@ Global<T>& Global<T>::operator=(Global<S>&& rhs) {
   static_assert(std::is_base_of<T, S>::value, "type check");
   if (this != &rhs) {
     this->Reset();
-    if (rhs.val_ != nullptr) {
-      this->val_ = rhs.val_;
-      api_internal::MoveGlobalReference(
-          reinterpret_cast<internal::Address**>(&rhs.val_),
-          reinterpret_cast<internal::Address**>(&this->val_));
-      rhs.val_ = nullptr;
+    if (!rhs.IsEmpty()) {
+      this->slot() = rhs.slot();
+      api_internal::MoveGlobalReference(&rhs.slot(), &this->slot());
+      rhs.Clear();
     }
   }
   return *this;
diff --git a/deps/v8/include/v8-platform.h b/deps/v8/include/v8-platform.h
index 4f476f5c3c3e73..0d82f4b990a749 100644
--- a/deps/v8/include/v8-platform.h
+++ b/deps/v8/include/v8-platform.h
@@ -13,6 +13,7 @@
 #include <memory>
 #include <string>
 
+#include "v8-source-location.h"  // NOLINT(build/include_directory)
 #include "v8config.h"  // NOLINT(build/include_directory)
 
 namespace v8 {
@@ -39,6 +40,7 @@ enum class TaskPriority : uint8_t {
    * possible.
    */
   kUserBlocking,
+  kMaxPriority = kUserBlocking
 };
 
 /**
@@ -261,8 +263,12 @@ class JobTask {
    * Controls the maximum number of threads calling Run() concurrently, given
    * the number of threads currently assigned to this job and executing Run().
    * Run() is only invoked if the number of threads previously running Run() was
-   * less than the value returned. Since GetMaxConcurrency() is a leaf function,
-   * it must not call back any JobHandle methods.
+   * less than the value returned. In general, this should return the latest
+   * number of incomplete work items (smallest unit of work) left to process,
+   * including items that are currently in progress. |worker_count| is the
+   * number of threads currently assigned to this job which some callers may
+   * need to determine their return value. Since GetMaxConcurrency() is a leaf
+   * function, it must not call back any JobHandle methods.
    */
   virtual size_t GetMaxConcurrency(size_t worker_count) const = 0;
 };
@@ -566,6 +572,42 @@ class PageAllocator {
   virtual bool CanAllocateSharedPages() { return false; }
 };
 
+/**
+ * An allocator that uses per-thread permissions to protect the memory.
+ *
+ * The implementation is platform/hardware specific, e.g. using pkeys on x64.
+ *
+ * INTERNAL ONLY: This interface has not been stabilised and may change
+ * without notice from one release to another without being deprecated first.
+ */
+class ThreadIsolatedAllocator {
+ public:
+  virtual ~ThreadIsolatedAllocator() = default;
+
+  virtual void* Allocate(size_t size) = 0;
+
+  virtual void Free(void* object) = 0;
+
+  enum class Type {
+    kPkey,
+  };
+
+  virtual Type Type() const = 0;
+
+  /**
+   * Return the pkey used to implement the thread isolation if Type == kPkey.
+   */
+  virtual int Pkey() const { return -1; }
+
+  /**
+   * Per-thread permissions can be reset on signal handler entry. Even reading
+   * ThreadIsolated memory will segfault in that case.
+   * Call this function on signal handler entry to ensure that read permissions
+   * are restored.
+   */
+  static void SetDefaultPermissionsForSignalHandler();
+};
+
 // Opaque type representing a handle to a shared memory region.
 using PlatformSharedMemoryHandle = intptr_t;
 static constexpr PlatformSharedMemoryHandle kInvalidSharedMemoryHandle = -1;
@@ -969,6 +1011,16 @@ class Platform {
    */
   virtual PageAllocator* GetPageAllocator() = 0;
 
+  /**
+   * Allows the embedder to provide an allocator that uses per-thread memory
+   * permissions to protect allocations.
+   * Returning nullptr will cause V8 to disable protections that rely on this
+   * feature.
+   */
+  virtual ThreadIsolatedAllocator* GetThreadIsolatedAllocator() {
+    return nullptr;
+  }
+
   /**
    * Allows the embedder to specify a custom allocator used for zones.
    */
@@ -1000,40 +1052,80 @@ class Platform {
    * Returns a TaskRunner which can be used to post a task on the foreground.
    * The TaskRunner's NonNestableTasksEnabled() must be true. This function
    * should only be called from a foreground thread.
+   * TODO(chromium:1448758): Deprecate once |GetForegroundTaskRunner(Isolate*,
+   * TaskPriority)| is ready.
    */
   virtual std::shared_ptr<v8::TaskRunner> GetForegroundTaskRunner(
-      Isolate* isolate) = 0;
+      Isolate* isolate) {
+    return GetForegroundTaskRunner(isolate, TaskPriority::kUserBlocking);
+  }
 
   /**
-   * Schedules a task to be invoked on a worker thread.
+   * Returns a TaskRunner with a specific |priority| which can be used to post a
+   * task on the foreground thread. The TaskRunner's NonNestableTasksEnabled()
+   * must be true. This function should only be called from a foreground thread.
+   * TODO(chromium:1448758): Make pure virtual once embedders implement it.
    */
-  virtual void CallOnWorkerThread(std::unique_ptr<Task> task) = 0;
+  virtual std::shared_ptr<v8::TaskRunner> GetForegroundTaskRunner(
+      Isolate* isolate, TaskPriority priority) {
+    return nullptr;
+  }
+
+  /**
+   * Schedules a task to be invoked on a worker thread.
+   * Embedders should override PostTaskOnWorkerThreadImpl() instead of
+   * CallOnWorkerThread().
+   * TODO(chromium:1424158): Make non-virtual once embedders are migrated to
+   * PostTaskOnWorkerThreadImpl().
+   */
+  virtual void CallOnWorkerThread(std::unique_ptr<Task> task) {
+    PostTaskOnWorkerThreadImpl(TaskPriority::kUserVisible, std::move(task),
+                               SourceLocation::Current());
+  }
 
   /**
    * Schedules a task that blocks the main thread to be invoked with
    * high-priority on a worker thread.
+   * Embedders should override PostTaskOnWorkerThreadImpl() instead of
+   * CallBlockingTaskOnWorkerThread().
+   * TODO(chromium:1424158): Make non-virtual once embedders are migrated to
+   * PostTaskOnWorkerThreadImpl().
    */
   virtual void CallBlockingTaskOnWorkerThread(std::unique_ptr<Task> task) {
     // Embedders may optionally override this to process these tasks in a high
     // priority pool.
-    CallOnWorkerThread(std::move(task));
+    PostTaskOnWorkerThreadImpl(TaskPriority::kUserBlocking, std::move(task),
+                               SourceLocation::Current());
   }
 
   /**
    * Schedules a task to be invoked with low-priority on a worker thread.
+   * Embedders should override PostTaskOnWorkerThreadImpl() instead of
+   * CallLowPriorityTaskOnWorkerThread().
+   * TODO(chromium:1424158): Make non-virtual once embedders are migrated to
+   * PostTaskOnWorkerThreadImpl().
    */
   virtual void CallLowPriorityTaskOnWorkerThread(std::unique_ptr<Task> task) {
     // Embedders may optionally override this to process these tasks in a low
     // priority pool.
-    CallOnWorkerThread(std::move(task));
+    PostTaskOnWorkerThreadImpl(TaskPriority::kBestEffort, std::move(task),
+                               SourceLocation::Current());
   }
 
   /**
    * Schedules a task to be invoked on a worker thread after |delay_in_seconds|
    * expires.
+   * Embedders should override PostDelayedTaskOnWorkerThreadImpl() instead of
+   * CallDelayedOnWorkerThread().
+   * TODO(chromium:1424158): Make non-virtual once embedders are migrated to
+   * PostDelayedTaskOnWorkerThreadImpl().
    */
   virtual void CallDelayedOnWorkerThread(std::unique_ptr<Task> task,
-                                         double delay_in_seconds) = 0;
+                                         double delay_in_seconds) {
+    PostDelayedTaskOnWorkerThreadImpl(TaskPriority::kUserVisible,
+                                      std::move(task), delay_in_seconds,
+                                      SourceLocation::Current());
+  }
 
   /**
    * Returns true if idle tasks are enabled for the given |isolate|.
@@ -1083,6 +1175,9 @@ class Platform {
    * thread (A=>B/B=>A deadlock) and [2] JobTask::Run or
    * JobTask::GetMaxConcurrency may be invoked synchronously from JobHandle
    * (B=>JobHandle::foo=>B deadlock).
+   * Embedders should override CreateJobImpl() instead of PostJob().
+   * TODO(chromium:1424158): Make non-virtual once embedders are migrated to
+   * CreateJobImpl().
    */
   virtual std::unique_ptr<JobHandle> PostJob(
       TaskPriority priority, std::unique_ptr<JobTask> job_task) {
@@ -1103,9 +1198,16 @@ class Platform {
    *    return v8::platform::NewDefaultJobHandle(
    *        this, priority, std::move(job_task), NumberOfWorkerThreads());
    * }
+   *
+   * Embedders should override CreateJobImpl() instead of CreateJob().
+   * TODO(chromium:1424158): Make non-virtual once embedders are migrated to
+   * CreateJobImpl().
    */
   virtual std::unique_ptr<JobHandle> CreateJob(
-      TaskPriority priority, std::unique_ptr<JobTask> job_task) = 0;
+      TaskPriority priority, std::unique_ptr<JobTask> job_task) {
+    return CreateJobImpl(priority, std::move(job_task),
+                         SourceLocation::Current());
+  }
 
   /**
    * Instantiates a ScopedBlockingCall to annotate a scope that may/will block.
@@ -1183,6 +1285,35 @@ class Platform {
    * nothing special needed.
    */
   V8_EXPORT static double SystemClockTimeMillis();
+
+  /**
+   * Creates and returns a JobHandle associated with a Job.
+   * TODO(chromium:1424158): Make pure virtual once embedders implement it.
+   */
+  virtual std::unique_ptr<JobHandle> CreateJobImpl(
+      TaskPriority priority, std::unique_ptr<JobTask> job_task,
+      const SourceLocation& location) {
+    return nullptr;
+  }
+
+  /**
+   * Schedules a task with |priority| to be invoked on a worker thread.
+   * TODO(chromium:1424158): Make pure virtual once embedders implement it.
+   */
+  virtual void PostTaskOnWorkerThreadImpl(TaskPriority priority,
+                                          std::unique_ptr<Task> task,
+                                          const SourceLocation& location) {
+    CallOnWorkerThread(std::move(task));
+  }
+
+  /**
+   * Schedules a task with |priority| to be invoked on a worker thread after
+   * |delay_in_seconds| expires.
+   * TODO(chromium:1424158): Make pure virtual once embedders implement it.
+   */
+  virtual void PostDelayedTaskOnWorkerThreadImpl(
+      TaskPriority priority, std::unique_ptr<Task> task,
+      double delay_in_seconds, const SourceLocation& location) {}
 };
 
 }  // namespace v8
diff --git a/deps/v8/include/v8-primitive.h b/deps/v8/include/v8-primitive.h
index 4148a7053a267f..eb0a791cf73946 100644
--- a/deps/v8/include/v8-primitive.h
+++ b/deps/v8/include/v8-primitive.h
@@ -490,12 +490,6 @@ class V8_EXPORT String : public Name {
    */
   bool MakeExternal(ExternalOneByteStringResource* resource);
 
-  /**
-   * Returns true if this string can be made external.
-   */
-  V8_DEPRECATE_SOON("Use the version that takes an encoding as argument.")
-  bool CanMakeExternal() const;
-
   /**
    * Returns true if this string can be made external, given the encoding for
    * the external string resource.
@@ -644,10 +638,20 @@ class V8_EXPORT Symbol : public Name {
   static void CheckCast(Data* that);
 };
 
+/**
+ * A JavaScript numeric value (either Number or BigInt).
+ * https://tc39.es/ecma262/#sec-numeric-types
+ */
+class V8_EXPORT Numeric : public Primitive {
+ private:
+  Numeric();
+  static void CheckCast(v8::Data* that);
+};
+
 /**
  * A JavaScript number value (ECMA-262, 4.3.20)
  */
-class V8_EXPORT Number : public Primitive {
+class V8_EXPORT Number : public Numeric {
  public:
   double Value() const;
   static Local<Number> New(Isolate* isolate, double value);
@@ -722,7 +726,7 @@ class V8_EXPORT Uint32 : public Integer {
 /**
  * A JavaScript BigInt value (https://tc39.github.io/proposal-bigint)
  */
-class V8_EXPORT BigInt : public Primitive {
+class V8_EXPORT BigInt : public Numeric {
  public:
   static Local<BigInt> New(Isolate* isolate, int64_t value);
   static Local<BigInt> NewFromUnsigned(Isolate* isolate, uint64_t value);
diff --git a/deps/v8/include/v8-profiler.h b/deps/v8/include/v8-profiler.h
index d3941512218342..75c9d6a4ae7863 100644
--- a/deps/v8/include/v8-profiler.h
+++ b/deps/v8/include/v8-profiler.h
@@ -11,6 +11,7 @@
 #include <unordered_set>
 #include <vector>
 
+#include "cppgc/common.h"          // NOLINT(build/include_directory)
 #include "v8-local-handle.h"       // NOLINT(build/include_directory)
 #include "v8-message.h"            // NOLINT(build/include_directory)
 #include "v8-persistent-handle.h"  // NOLINT(build/include_directory)
@@ -24,7 +25,7 @@ enum class EmbedderStateTag : uint8_t;
 class HeapGraphNode;
 struct HeapStatsUpdate;
 class Object;
-enum StateTag : int;
+enum StateTag : uint16_t;
 
 using NativeObject = void*;
 using SnapshotObjectId = uint32_t;
@@ -596,7 +597,6 @@ class V8_EXPORT HeapGraphNode {
     kBigInt = 13,        // BigInt.
     kObjectShape = 14,   // Internal data used for tracking the shapes (or
                          // "hidden classes") of JS objects.
-    kWasmObject = 15,    // A WasmGC struct or array.
   };
 
   /** Returns node type (see HeapGraphNode::Type). */
@@ -883,6 +883,15 @@ class V8_EXPORT EmbedderGraph {
      */
     virtual Detachedness GetDetachedness() { return Detachedness::kUnknown; }
 
+    /**
+     * Returns the address of the object in the embedder heap, or nullptr to not
+     * specify the address. If this address is provided, then V8 can generate
+     * consistent IDs for objects across subsequent heap snapshots, which allows
+     * devtools to determine which objects were retained from one snapshot to
+     * the next. This value is used only if GetNativeObject returns nullptr.
+     */
+    virtual const void* GetAddress() { return nullptr; }
+
     Node(const Node&) = delete;
     Node& operator=(const Node&) = delete;
   };
@@ -1045,6 +1054,11 @@ class V8_EXPORT HeapProfiler {
      * Mode for dealing with numeric values, see `NumericsMode`.
      */
     NumericsMode numerics_mode = NumericsMode::kHideNumericValues;
+    /**
+     * Whether stack is considered as a root set.
+     */
+    cppgc::EmbedderStackState stack_state =
+        cppgc::EmbedderStackState::kMayContainHeapPointers;
   };
 
   /**
diff --git a/deps/v8/include/v8-script.h b/deps/v8/include/v8-script.h
index 9b278da6d587a4..aa1447c6bb8cc5 100644
--- a/deps/v8/include/v8-script.h
+++ b/deps/v8/include/v8-script.h
@@ -9,6 +9,7 @@
 #include <stdint.h>
 
 #include <memory>
+#include <tuple>
 #include <vector>
 
 #include "v8-callbacks.h"     // NOLINT(build/include_directory)
@@ -142,10 +143,9 @@ class V8_EXPORT ModuleRequest : public Data {
    *
    * All assertions present in the module request will be supplied in this
    * list, regardless of whether they are supported by the host. Per
-   * https://tc39.es/proposal-import-assertions/#sec-hostgetsupportedimportassertions,
-   * hosts are expected to ignore assertions that they do not support (as
-   * opposed to, for example, triggering an error if an unsupported assertion is
-   * present).
+   * https://tc39.es/proposal-import-attributes/#sec-hostgetsupportedimportattributes,
+   * hosts are expected to throw for assertions that they do not support (as
+   * opposed to, for example, ignoring them).
    */
   Local<FixedArray> GetImportAssertions() const;
 
@@ -650,7 +650,9 @@ class V8_EXPORT ScriptCompiler {
   static ScriptStreamingTask* StartStreaming(
       Isolate* isolate, StreamedSource* source,
       ScriptType type = ScriptType::kClassic,
-      CompileOptions options = kNoCompileOptions);
+      CompileOptions options = kNoCompileOptions,
+      CompileHintCallback compile_hint_callback = nullptr,
+      void* compile_hint_callback_data = nullptr);
 
   static ConsumeCodeCacheTask* StartConsumingCodeCache(
       Isolate* isolate, std::unique_ptr<CachedData> source);
diff --git a/deps/v8/include/v8-snapshot.h b/deps/v8/include/v8-snapshot.h
index d47bcbaec9e976..74bbcae2d0fac3 100644
--- a/deps/v8/include/v8-snapshot.h
+++ b/deps/v8/include/v8-snapshot.h
@@ -88,10 +88,13 @@ class V8_EXPORT SnapshotCreator {
    * \param existing_blob existing snapshot from which to create this one.
    * \param external_references a null-terminated array of external references
    *        that must be equivalent to CreateParams::external_references.
+   * \param owns_isolate whether this SnapshotCreator should call
+   *        v8::Isolate::Dispose() during its destructor.
    */
   SnapshotCreator(Isolate* isolate,
                   const intptr_t* external_references = nullptr,
-                  const StartupData* existing_blob = nullptr);
+                  const StartupData* existing_blob = nullptr,
+                  bool owns_isolate = true);
 
   /**
    * Create and enter an isolate, and set it up for serialization.
diff --git a/deps/v8/include/v8-source-location.h b/deps/v8/include/v8-source-location.h
new file mode 100644
index 00000000000000..92216ef2fa6152
--- /dev/null
+++ b/deps/v8/include/v8-source-location.h
@@ -0,0 +1,92 @@
+// Copyright 2020 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef INCLUDE_SOURCE_LOCATION_H_
+#define INCLUDE_SOURCE_LOCATION_H_
+
+#include <cstddef>
+#include <string>
+
+#include "v8config.h"  // NOLINT(build/include_directory)
+
+#if defined(__has_builtin)
+#define V8_SUPPORTS_SOURCE_LOCATION                                      \
+  (__has_builtin(__builtin_FUNCTION) && __has_builtin(__builtin_FILE) && \
+   __has_builtin(__builtin_LINE))  // NOLINT
+#elif defined(V8_CC_GNU) && __GNUC__ >= 7
+#define V8_SUPPORTS_SOURCE_LOCATION 1
+#elif defined(V8_CC_INTEL) && __ICC >= 1800
+#define V8_SUPPORTS_SOURCE_LOCATION 1
+#else
+#define V8_SUPPORTS_SOURCE_LOCATION 0
+#endif
+
+namespace v8 {
+
+/**
+ * Encapsulates source location information. Mimics C++20's
+ * `std::source_location`.
+ */
+class V8_EXPORT SourceLocation final {
+ public:
+  /**
+   * Construct source location information corresponding to the location of the
+   * call site.
+   */
+#if V8_SUPPORTS_SOURCE_LOCATION
+  static constexpr SourceLocation Current(
+      const char* function = __builtin_FUNCTION(),
+      const char* file = __builtin_FILE(), size_t line = __builtin_LINE()) {
+    return SourceLocation(function, file, line);
+  }
+#else
+  static constexpr SourceLocation Current() { return SourceLocation(); }
+#endif  // V8_SUPPORTS_SOURCE_LOCATION
+
+  /**
+   * Constructs unspecified source location information.
+   */
+  constexpr SourceLocation() = default;
+
+  /**
+   * Returns the name of the function associated with the position represented
+   * by this object, if any.
+   *
+   * \returns the function name as cstring.
+   */
+  constexpr const char* Function() const { return function_; }
+
+  /**
+   * Returns the name of the current source file represented by this object.
+   *
+   * \returns the file name as cstring.
+   */
+  constexpr const char* FileName() const { return file_; }
+
+  /**
+   * Returns the line number represented by this object.
+   *
+   * \returns the line number.
+   */
+  constexpr size_t Line() const { return line_; }
+
+  /**
+   * Returns a human-readable string representing this object.
+   *
+   * \returns a human-readable string representing source location information.
+   */
+  std::string ToString() const;
+
+ private:
+  constexpr SourceLocation(const char* function, const char* file, size_t line)
+      : function_(function), file_(file), line_(line) {}
+
+  const char* function_ = nullptr;
+  const char* file_ = nullptr;
+  size_t line_ = 0u;
+};
+
+}  // namespace v8
+
+#endif  // INCLUDE_SOURCE_LOCATION_H_
diff --git a/deps/v8/include/v8-statistics.h b/deps/v8/include/v8-statistics.h
index ca20bc9f6c4161..0b7611794154aa 100644
--- a/deps/v8/include/v8-statistics.h
+++ b/deps/v8/include/v8-statistics.h
@@ -46,6 +46,10 @@ enum class MeasureMemoryExecution { kDefault, kEager, kLazy };
  *
  * It specifies the contexts that need to be measured and gets called when
  * the measurement is completed to report the results.
+ *
+ * Both MeasurementComplete() callbacks will be invoked on completion.
+ * Each implementation of this class should hence implement only one of them,
+ * and leave the other empty.
  */
 class V8_EXPORT MeasureMemoryDelegate {
  public:
@@ -66,10 +70,41 @@ class V8_EXPORT MeasureMemoryDelegate {
    * \param unattributed_size_in_bytes total size of objects that were not
    *   attributed to any context (i.e. are likely shared objects).
    */
+  V8_DEPRECATE_SOON("Please use the version that takes a result struct")
   virtual void MeasurementComplete(
       const std::vector<std::pair<Local<Context>, size_t>>&
           context_sizes_in_bytes,
-      size_t unattributed_size_in_bytes) = 0;
+      size_t unattributed_size_in_bytes) {}
+
+  /** Holds the result of a memory measurement request. */
+  struct Result {
+    /**
+     * a vector of (context, size) pairs that includes each context for
+     * which ShouldMeasure returned true and that was not garbage collected
+     * while the memory measurement was in progress.
+     */
+    const std::vector<std::pair<Local<Context>, size_t>>&
+        context_sizes_in_bytes;
+
+    /**
+     * total size of objects that were not attributed to any context (i.e. are
+     * likely shared objects).
+     */
+    size_t unattributed_size_in_bytes;
+
+    /** total size of generated code for Wasm (shared across contexts). */
+    size_t wasm_code_size_in_bytes;
+
+    /** total size of Wasm metadata (except code; shared across contexts). */
+    size_t wasm_metadata_size_in_bytes;
+  };
+
+  /**
+   * This function is called when memory measurement finishes.
+   *
+   * \param result the result of the measurement.
+   */
+  virtual void MeasurementComplete(Result result) {}
 
   /**
    * Returns a default delegate that resolves the given promise when
diff --git a/deps/v8/include/v8-traced-handle.h b/deps/v8/include/v8-traced-handle.h
index d92c3fdc867df5..e5bad3e9b47db6 100644
--- a/deps/v8/include/v8-traced-handle.h
+++ b/deps/v8/include/v8-traced-handle.h
@@ -33,7 +33,7 @@ enum class GlobalHandleStoreMode {
 };
 
 V8_EXPORT internal::Address* GlobalizeTracedReference(
-    internal::Isolate* isolate, internal::Address* handle,
+    internal::Isolate* isolate, internal::Address value,
     internal::Address* slot, GlobalHandleStoreMode store_mode);
 V8_EXPORT void MoveTracedReference(internal::Address** from,
                                    internal::Address** to);
@@ -43,14 +43,12 @@ V8_EXPORT void DisposeTracedReference(internal::Address* global_handle);
 
 }  // namespace internal
 
-class TracedReferenceBase {
+/**
+ * An indirect handle, where the indirect pointer points to a GlobalHandles
+ * node.
+ */
+class TracedReferenceBase : public IndirectHandleBase {
  public:
-  /**
-   * Returns true if the reference is empty, i.e., has not been assigned
-   * object.
-   */
-  bool IsEmpty() const { return val_ == nullptr; }
-
   /**
    * If non-empty, destroy the underlying storage cell. |IsEmpty| will return
    * true after this call.
@@ -60,10 +58,9 @@ class TracedReferenceBase {
   /**
    * Construct a Local<Value> from this handle.
    */
-  V8_INLINE v8::Local<v8::Value> Get(v8::Isolate* isolate) const {
+  V8_INLINE Local<Value> Get(Isolate* isolate) const {
     if (IsEmpty()) return Local<Value>();
-    return Local<Value>::New(isolate,
-                             internal::ValueHelper::SlotAsValue<Value>(val_));
+    return Local<Value>::New(isolate, this->value<Value>());
   }
 
   /**
@@ -86,11 +83,13 @@ class TracedReferenceBase {
   V8_INLINE uint16_t WrapperClassId() const;
 
  protected:
+  V8_INLINE TracedReferenceBase() = default;
+
   /**
    * Update this reference in a thread-safe way.
    */
   void SetSlotThreadSafe(void* new_val) {
-    reinterpret_cast<std::atomic<void*>*>(&val_)->store(
+    reinterpret_cast<std::atomic<void*>*>(&slot())->store(
         new_val, std::memory_order_relaxed);
   }
 
@@ -98,19 +97,13 @@ class TracedReferenceBase {
    * Get this reference in a thread-safe way
    */
   const void* GetSlotThreadSafe() const {
-    return reinterpret_cast<std::atomic<const void*> const*>(&val_)->load(
+    return reinterpret_cast<std::atomic<const void*> const*>(&slot())->load(
         std::memory_order_relaxed);
   }
 
   V8_EXPORT void CheckValue() const;
 
-  V8_INLINE internal::Address address() const { return *val_; }
-
-  // val_ points to a GlobalHandles node.
-  internal::Address* val_ = nullptr;
-
   friend class internal::BasicTracedReferenceExtractor;
-  friend class internal::HandleHelper;
   template <typename F>
   friend class Local;
   template <typename U>
@@ -139,12 +132,7 @@ class BasicTracedReference : public TracedReferenceBase {
   /**
    * Construct a Local<T> from this handle.
    */
-  Local<T> Get(Isolate* isolate) const {
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
-    if (val_ == nullptr) return Local<T>();
-#endif
-    return Local<T>::New(isolate, *this);
-  }
+  Local<T> Get(Isolate* isolate) const { return Local<T>::New(isolate, *this); }
 
   template <class S>
   V8_INLINE BasicTracedReference<S>& As() const {
@@ -152,19 +140,17 @@ class BasicTracedReference : public TracedReferenceBase {
         const_cast<BasicTracedReference<T>&>(*this));
   }
 
-  T* operator->() const {
+  V8_DEPRECATE_SOON("Use Get to convert to Local instead")
+  V8_INLINE T* operator->() const {
 #ifdef V8_ENABLE_CHECKS
     CheckValue();
 #endif  // V8_ENABLE_CHECKS
-    return reinterpret_cast<T*>(val_);
-  }
-  T* operator*() const {
-#ifdef V8_ENABLE_CHECKS
-    CheckValue();
-#endif  // V8_ENABLE_CHECKS
-    return reinterpret_cast<T*>(val_);
+    return this->template value<T>();
   }
 
+  V8_DEPRECATE_SOON("Use Get to convert to Local instead")
+  V8_INLINE T* operator*() const { return this->operator->(); }
+
  private:
   /**
    * An empty BasicTracedReference without storage cell.
@@ -172,7 +158,7 @@ class BasicTracedReference : public TracedReferenceBase {
   BasicTracedReference() = default;
 
   V8_INLINE static internal::Address* New(
-      Isolate* isolate, T* that, void* slot,
+      Isolate* isolate, T* that, internal::Address** slot,
       internal::GlobalHandleStoreMode store_mode);
 
   template <typename F>
@@ -199,7 +185,7 @@ class TracedReference : public BasicTracedReference<T> {
   /**
    * An empty TracedReference without storage cell.
    */
-  TracedReference() : BasicTracedReference<T>() {}
+  V8_INLINE TracedReference() = default;
 
   /**
    * Construct a TracedReference from a Local.
@@ -209,8 +195,9 @@ class TracedReference : public BasicTracedReference<T> {
    */
   template <class S>
   TracedReference(Isolate* isolate, Local<S> that) : BasicTracedReference<T>() {
-    this->val_ = this->New(isolate, *that, &this->val_,
-                           internal::GlobalHandleStoreMode::kInitializingStore);
+    this->slot() =
+        this->New(isolate, *that, &this->slot(),
+                  internal::GlobalHandleStoreMode::kInitializingStore);
     static_assert(std::is_base_of<T, S>::value, "type check");
   }
 
@@ -291,18 +278,18 @@ class TracedReference : public BasicTracedReference<T> {
 // --- Implementation ---
 template <class T>
 internal::Address* BasicTracedReference<T>::New(
-    Isolate* isolate, T* that, void* slot,
+    Isolate* isolate, T* that, internal::Address** slot,
     internal::GlobalHandleStoreMode store_mode) {
-  if (that == internal::ValueHelper::EmptyValue<T>()) return nullptr;
-  internal::Address* p = reinterpret_cast<internal::Address*>(that);
+  if (internal::ValueHelper::IsEmpty(that)) return nullptr;
   return internal::GlobalizeTracedReference(
-      reinterpret_cast<internal::Isolate*>(isolate), p,
+      reinterpret_cast<internal::Isolate*>(isolate),
+      internal::ValueHelper::ValueAsAddress(that),
       reinterpret_cast<internal::Address*>(slot), store_mode);
 }
 
 void TracedReferenceBase::Reset() {
   if (IsEmpty()) return;
-  internal::DisposeTracedReference(reinterpret_cast<internal::Address*>(val_));
+  internal::DisposeTracedReference(slot());
   SetSlotThreadSafe(nullptr);
 }
 
@@ -347,7 +334,7 @@ void TracedReference<T>::Reset(Isolate* isolate, const Local<S>& other) {
   this->Reset();
   if (other.IsEmpty()) return;
   this->SetSlotThreadSafe(
-      this->New(isolate, *other, &this->val_,
+      this->New(isolate, *other, &this->slot(),
                 internal::GlobalHandleStoreMode::kAssigningStore));
 }
 
@@ -373,9 +360,7 @@ template <class T>
 TracedReference<T>& TracedReference<T>::operator=(
     TracedReference&& rhs) noexcept {
   if (this != &rhs) {
-    internal::MoveTracedReference(
-        reinterpret_cast<internal::Address**>(&rhs.val_),
-        reinterpret_cast<internal::Address**>(&this->val_));
+    internal::MoveTracedReference(&rhs.slot(), &this->slot());
   }
   return *this;
 }
@@ -384,10 +369,8 @@ template <class T>
 TracedReference<T>& TracedReference<T>::operator=(const TracedReference& rhs) {
   if (this != &rhs) {
     this->Reset();
-    if (rhs.val_ != nullptr) {
-      internal::CopyTracedReference(
-          reinterpret_cast<const internal::Address* const*>(&rhs.val_),
-          reinterpret_cast<internal::Address**>(&this->val_));
+    if (!rhs.IsEmpty()) {
+      internal::CopyTracedReference(&rhs.slot(), &this->slot());
     }
   }
   return *this;
@@ -396,16 +379,16 @@ TracedReference<T>& TracedReference<T>::operator=(const TracedReference& rhs) {
 void TracedReferenceBase::SetWrapperClassId(uint16_t class_id) {
   using I = internal::Internals;
   if (IsEmpty()) return;
-  internal::Address* obj = reinterpret_cast<internal::Address*>(val_);
-  uint8_t* addr = reinterpret_cast<uint8_t*>(obj) + I::kTracedNodeClassIdOffset;
+  uint8_t* addr =
+      reinterpret_cast<uint8_t*>(slot()) + I::kTracedNodeClassIdOffset;
   *reinterpret_cast<uint16_t*>(addr) = class_id;
 }
 
 uint16_t TracedReferenceBase::WrapperClassId() const {
   using I = internal::Internals;
   if (IsEmpty()) return 0;
-  internal::Address* obj = reinterpret_cast<internal::Address*>(val_);
-  uint8_t* addr = reinterpret_cast<uint8_t*>(obj) + I::kTracedNodeClassIdOffset;
+  uint8_t* addr =
+      reinterpret_cast<uint8_t*>(slot()) + I::kTracedNodeClassIdOffset;
   return *reinterpret_cast<uint16_t*>(addr);
 }
 
diff --git a/deps/v8/include/v8-unwinder.h b/deps/v8/include/v8-unwinder.h
index 8dca52f41c817a..8b71bb39b55f42 100644
--- a/deps/v8/include/v8-unwinder.h
+++ b/deps/v8/include/v8-unwinder.h
@@ -33,7 +33,7 @@ struct V8_EXPORT RegisterState {
 };
 
 // A StateTag represents a possible state of the VM.
-enum StateTag : int {
+enum StateTag : uint16_t {
   JS,
   GC,
   PARSER,
diff --git a/deps/v8/include/v8-util.h b/deps/v8/include/v8-util.h
index 36611697632296..c845c9924cd403 100644
--- a/deps/v8/include/v8-util.h
+++ b/deps/v8/include/v8-util.h
@@ -182,7 +182,7 @@ class PersistentValueMapBase {
    */
   Local<V> Get(const K& key) {
     V* p = FromVal(Traits::Get(&impl_, key));
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+#ifdef V8_ENABLE_DIRECT_LOCAL
     if (p == nullptr) return Local<V>();
 #endif
     return Local<V>::New(isolate_, p);
@@ -302,13 +302,13 @@ class PersistentValueMapBase {
   }
 
   static PersistentContainerValue ClearAndLeak(Global<V>* persistent) {
-    V* v = persistent->val_;
-    persistent->val_ = nullptr;
-    return reinterpret_cast<PersistentContainerValue>(v);
+    internal::Address* address = persistent->slot();
+    persistent->Clear();
+    return reinterpret_cast<PersistentContainerValue>(address);
   }
 
   static PersistentContainerValue Leak(Global<V>* persistent) {
-    return reinterpret_cast<PersistentContainerValue>(persistent->val_);
+    return reinterpret_cast<PersistentContainerValue>(persistent->slot());
   }
 
   /**
@@ -318,7 +318,7 @@ class PersistentValueMapBase {
    */
   static Global<V> Release(PersistentContainerValue v) {
     Global<V> p;
-    p.val_ = FromVal(v);
+    p.slot() = reinterpret_cast<internal::Address*>(FromVal(v));
     if (Traits::kCallbackType != kNotWeak && p.IsWeak()) {
       Traits::DisposeCallbackData(
           p.template ClearWeak<typename Traits::WeakCallbackDataType>());
@@ -328,7 +328,8 @@ class PersistentValueMapBase {
 
   void RemoveWeak(const K& key) {
     Global<V> p;
-    p.val_ = FromVal(Traits::Remove(&impl_, key));
+    p.slot() = reinterpret_cast<internal::Address*>(
+        FromVal(Traits::Remove(&impl_, key)));
     p.Reset();
   }
 
@@ -396,7 +397,7 @@ class PersistentValueMap : public PersistentValueMapBase<K, V, Traits> {
           Traits::kCallbackType == kWeakWithInternalFields
               ? WeakCallbackType::kInternalFields
               : WeakCallbackType::kParameter;
-      Local<V> value(Local<V>::New(this->isolate(), *persistent));
+      auto value = Local<V>::New(this->isolate(), *persistent);
       persistent->template SetWeak<typename Traits::WeakCallbackDataType>(
           Traits::WeakCallbackParameter(this, key, value), WeakCallback,
           callback_type);
@@ -472,7 +473,7 @@ class GlobalValueMap : public PersistentValueMapBase<K, V, Traits> {
           Traits::kCallbackType == kWeakWithInternalFields
               ? WeakCallbackType::kInternalFields
               : WeakCallbackType::kParameter;
-      Local<V> value(Local<V>::New(this->isolate(), *persistent));
+      auto value = Local<V>::New(this->isolate(), *persistent);
       persistent->template SetWeak<typename Traits::WeakCallbackDataType>(
           Traits::WeakCallbackParameter(this, key, value), OnWeakCallback,
           callback_type);
@@ -629,7 +630,8 @@ class V8_DEPRECATE_SOON("Use std::vector<Global<V>>.") PersistentValueVector {
     size_t length = Traits::Size(&impl_);
     for (size_t i = 0; i < length; i++) {
       Global<V> p;
-      p.val_ = FromVal(Traits::Get(&impl_, i));
+      p.slot() =
+          reinterpret_cast<internal::Address>(FromVal(Traits::Get(&impl_, i)));
     }
     Traits::Clear(&impl_);
   }
@@ -644,9 +646,9 @@ class V8_DEPRECATE_SOON("Use std::vector<Global<V>>.") PersistentValueVector {
 
  private:
   static PersistentContainerValue ClearAndLeak(Global<V>* persistent) {
-    V* v = persistent->val_;
-    persistent->val_ = nullptr;
-    return reinterpret_cast<PersistentContainerValue>(v);
+    auto slot = persistent->slot();
+    persistent->Clear();
+    return reinterpret_cast<PersistentContainerValue>(slot);
   }
 
   static V* FromVal(PersistentContainerValue v) {
diff --git a/deps/v8/include/v8-value.h b/deps/v8/include/v8-value.h
index c80ae064ee7ba9..19ecf71d16a9d8 100644
--- a/deps/v8/include/v8-value.h
+++ b/deps/v8/include/v8-value.h
@@ -16,6 +16,8 @@
  */
 namespace v8 {
 
+class Primiitive;
+class Numeric;
 class BigInt;
 class Int32;
 class Integer;
@@ -354,6 +356,18 @@ class V8_EXPORT Value : public Data {
    */
   bool IsModuleNamespaceObject() const;
 
+  /**
+   * Perform `ToPrimitive(value)` as specified in:
+   * https://tc39.es/ecma262/#sec-toprimitive.
+   */
+  V8_WARN_UNUSED_RESULT MaybeLocal<Primitive> ToPrimitive(
+      Local<Context> context) const;
+  /**
+   * Perform `ToNumeric(value)` as specified in:
+   * https://tc39.es/ecma262/#sec-tonumeric.
+   */
+  V8_WARN_UNUSED_RESULT MaybeLocal<Numeric> ToNumeric(
+      Local<Context> context) const;
   /**
    * Perform the equivalent of `BigInt(value)` in JS.
    */
diff --git a/deps/v8/include/v8-version.h b/deps/v8/include/v8-version.h
index 4b0ee2b11c4cd9..e34be9b283f45c 100644
--- a/deps/v8/include/v8-version.h
+++ b/deps/v8/include/v8-version.h
@@ -9,9 +9,9 @@
 // NOTE these macros are used by some of the tool scripts and the build
 // system so their names cannot be changed without changing the scripts.
 #define V8_MAJOR_VERSION 11
-#define V8_MINOR_VERSION 3
-#define V8_BUILD_NUMBER 244
-#define V8_PATCH_LEVEL 8
+#define V8_MINOR_VERSION 8
+#define V8_BUILD_NUMBER 172
+#define V8_PATCH_LEVEL 15
 
 // Use 1 for candidates and 0 otherwise.
 // (Boolean macro values are not supported by all preprocessors.)
diff --git a/deps/v8/include/v8config.h b/deps/v8/include/v8config.h
index bee208ffa95a78..33bb3f94316a9c 100644
--- a/deps/v8/include/v8config.h
+++ b/deps/v8/include/v8config.h
@@ -367,6 +367,7 @@ path. Add it with -I<path> to the command line
 # define V8_HAS_ATTRIBUTE_VISIBILITY (__has_attribute(visibility))
 # define V8_HAS_ATTRIBUTE_WARN_UNUSED_RESULT \
     (__has_attribute(warn_unused_result))
+# define V8_HAS_ATTRIBUTE_WEAK (__has_attribute(weak))
 
 # define V8_HAS_CPP_ATTRIBUTE_NODISCARD (V8_HAS_CPP_ATTRIBUTE(nodiscard))
 # define V8_HAS_CPP_ATTRIBUTE_NO_UNIQUE_ADDRESS \
@@ -417,6 +418,7 @@ path. Add it with -I<path> to the command line
 # define V8_HAS_ATTRIBUTE_UNUSED 1
 # define V8_HAS_ATTRIBUTE_VISIBILITY 1
 # define V8_HAS_ATTRIBUTE_WARN_UNUSED_RESULT (!V8_CC_INTEL)
+# define V8_HAS_ATTRIBUTE_WEAK 1
 
 // [[nodiscard]] does not work together with with
 // __attribute__((visibility(""))) on GCC 7.4 which is why there is no define
@@ -462,14 +464,16 @@ path. Add it with -I<path> to the command line
 
 #ifdef DEBUG
 // In debug mode, check assumptions instead of actually adding annotations.
-# define V8_ASSUME(condition) DCHECK(condition)
+# define V8_ASSUME DCHECK
 #elif V8_HAS_BUILTIN_ASSUME
-# define V8_ASSUME(condition) __builtin_assume(condition)
+# define V8_ASSUME __builtin_assume
 #elif V8_HAS_BUILTIN_UNREACHABLE
-# define V8_ASSUME(condition) \
-  do { if (!(condition)) __builtin_unreachable(); } while (false)
+# define V8_ASSUME(condition)                  \
+  do {                                         \
+    if (!(condition)) __builtin_unreachable(); \
+  } while (false)
 #else
-# define V8_ASSUME(condition)
+# define V8_ASSUME USE
 #endif
 
 #if V8_HAS_BUILTIN_ASSUME_ALIGNED
@@ -525,9 +529,6 @@ path. Add it with -I<path> to the command line
 // A macro used to change the calling conventions to preserve all registers (no
 // caller-saved registers). Use this for cold functions called from hot
 // functions.
-// Note: The attribute is considered experimental, so apply with care. Also,
-// "preserve_most" is currently not handling the return value correctly, so only
-// use it for functions returning void (see https://reviews.llvm.org/D141020).
 // Use like:
 //   V8_NOINLINE V8_PRESERVE_MOST void UnlikelyMethod();
 #if V8_HAS_ATTRIBUTE_PRESERVE_MOST
@@ -610,6 +611,14 @@ path. Add it with -I<path> to the command line
 #endif
 
 
+// Annotate functions/variables as weak to allow overriding the symbol.
+#if V8_HAS_ATTRIBUTE_WEAK
+#define V8_WEAK __attribute__((weak))
+#else
+#define V8_WEAK /* NOT SUPPORTED */
+#endif
+
+
 // Annotate a class or constructor indicating the caller must assign the
 // constructed instances.
 // Apply to the whole class like:
@@ -749,7 +758,7 @@ V8 shared library set USING_V8_SHARED.
 #elif defined(__mips64)
 #define V8_HOST_ARCH_MIPS64 1
 #define V8_HOST_ARCH_64_BIT 1
-#elif defined(__loongarch64)
+#elif defined(__loongarch_lp64)
 #define V8_HOST_ARCH_LOONG64 1
 #define V8_HOST_ARCH_64_BIT 1
 #elif defined(__PPC64__) || defined(_ARCH_PPC64)
@@ -799,7 +808,7 @@ V8 shared library set USING_V8_SHARED.
 #define V8_TARGET_ARCH_ARM 1
 #elif defined(__mips64)
 #define V8_TARGET_ARCH_MIPS64 1
-#elif defined(__loongarch64)
+#elif defined(__loongarch_lp64)
 #define V8_TARGET_ARCH_LOONG64 1
 #elif defined(_ARCH_PPC64)
 #define V8_TARGET_ARCH_PPC64 1
diff --git a/deps/v8/infra/mb/mb_config.pyl b/deps/v8/infra/mb/mb_config.pyl
index 41e5ed04194800..989584b8dd58d5 100644
--- a/deps/v8/infra/mb/mb_config.pyl
+++ b/deps/v8/infra/mb/mb_config.pyl
@@ -69,7 +69,9 @@
       'V8 Linux64 - builder (goma cache silo)': 'release_x64',
       'V8 Linux64 - builder (reclient)': 'release_x64_reclient',
       'V8 Linux64 - builder (reclient compare)': 'release_x64_reclient',
+      'V8 Linux64 - official - builder': 'official_x64',
       'V8 Linux64 - debug builder': 'debug_x64',
+      'V8 Linux64 - no shared cage - debug builder': 'debug_x64_no_shared_cage',
       'V8 Linux64 - external code space - debug - builder': 'debug_x64_external_code_space',
       'V8 Linux64 - custom snapshot - debug builder': 'debug_x64_custom',
       'V8 Linux64 - internal snapshot - builder': 'release_x64_internal',
@@ -115,6 +117,8 @@
       'V8 Linux - arm64 - sim - MSAN - builder': 'release_simulate_arm64_msan',
       # FYI.
       'V8 iOS - sim - builder': 'release_x64_ios_simulator',
+      'V8 Linux64 - arm64 - builder': 'release_arm64',
+      'V8 Linux64 - arm64 - debug builder': 'debug_arm64',
       'V8 Linux64 - arm64 - sim - no pointer compression - builder':
           'release_simulate_arm64_no_pointer_compression',
       'V8 Linux64 - coverage': 'release_x64_coverage',
@@ -135,6 +139,7 @@
       'V8 Linux - vtunejit': 'debug_x86_vtunejit',
       'V8 Linux64 - Fuzzilli - builder': 'release_x64_fuzzilli',
       'V8 Linux64 - predictable - builder': 'release_x64_predictable',
+      'V8 Linux64 - verify builtins': 'release_x64_verify_builtins',
       'V8 Linux64 - verify deterministic': 'release_x64_verify_deterministic',
       'V8 Linux - full debug builder': 'full_debug_x86',
       'V8 Mac64 - full debug builder': 'full_debug_x64',
@@ -179,17 +184,26 @@
           'release_x64_asan_symbolized_expose_memory_corruption',
     },
     'client.v8.perf' : {
+      # Arm
       'V8 Arm - builder - perf': 'official_arm',
       'V8 Arm - builder - pgo - perf': 'official_arm_pgo',
+      # Android Arm
       'V8 Android Arm - builder - perf': 'official_android_arm',
+      'v8_android_arm_compile_perf_try': 'official_android_arm',
       'V8 Android Arm - builder - pgo - perf': 'official_android_arm_pgo',
       'V8 Android Arm64 - builder - perf': 'official_android_arm64',
+      'v8_android_arm64_compile_perf_try': 'official_android_arm64',
       'V8 Android Arm64 - builder - pgo - perf': 'official_android_arm64_pgo',
+      # Linux
       'V8 Linux - builder - perf': 'official_x86',
+      'v8_linux_compile_perf_try': 'official_x86',
       'V8 Linux - builder - pgo - perf': 'official_x86_pgo',
       'V8 Linux64 - builder - perf': 'official_x64',
+      'v8_linux64_compile_perf_try': 'official_x64',
       'V8 Linux64 - builder - pgo - perf': 'official_x64_pgo',
+      # Mac Arm
       'V8 Mac Arm64 - builder - perf': 'official_mac_arm64',
+      'v8_mac_arm64_compile_perf_try': 'official_mac_arm64',
       'V8 Mac Arm64 - builder - pgo - perf': 'official_mac_arm64_pgo',
     },
     'client.v8.ports': {
@@ -208,6 +222,7 @@
       'V8 Linux - arm64 - sim - builder': 'release_simulate_arm64_gcmole',
       'V8 Linux - arm64 - sim - debug builder': 'debug_simulate_arm64',
       'V8 Linux - arm64 - sim - gc stress - builder': 'debug_simulate_arm64',
+      'V8 Linux64 - arm64 - no wasm - debug builder': 'debug_arm64_webassembly_disabled',
       # Mips.
       'V8 Linux - mips64el - sim - builder': 'release_simulate_mips64el',
       # IBM.
@@ -216,6 +231,7 @@
       # RISC-V
       'V8 Linux - riscv32 - sim - builder': 'release_simulate_riscv32',
       'V8 Linux - riscv64 - sim - builder': 'release_simulate_riscv64',
+      'V8 Linux - riscv64 - sim - pointer compression - builder': 'release_simulate_riscv64_pointer_compression',
       # Loongson
       'V8 Linux - loong64 - sim - builder': 'release_simulate_loong64',
     },
@@ -236,10 +252,13 @@
       'v8_linux_gc_stress_compile_dbg': 'debug_x86_trybot',
       'v8_linux_shared_compile_rel': 'release_x86_shared_verify_heap',
       'v8_linux_vtunejit': 'debug_x86_vtunejit',
+      'v8_linux64_arm64_compile_dbg': 'debug_arm64_trybot',
+      'v8_linux64_arm64_compile_rel': 'release_arm64_trybot',
       'v8_linux64_arm64_no_pointer_compression_compile_rel':
           'release_simulate_arm64_no_pointer_compression',
       'v8_linux64_cppgc_non_default_compile_dbg': 'debug_x64_non_default_cppgc',
       'v8_linux64_compile_dbg': 'debug_x64_trybot',
+      'v8_linux64_no_shared_cage_compile_dbg': 'debug_x64_no_shared_cage',
       'v8_linux64_coverage_dbg': 'debug_x64_coverage',
       'v8_linux64_coverage_rel': 'release_x64_coverage',
       'v8_linux64_no_sandbox_compile_dbg': 'debug_x64_no_sandbox',
@@ -260,10 +279,13 @@
       'v8_linux64_no_pointer_compression_compile_rel': 'release_x64_no_pointer_compression',
       'v8_linux64_compile_rel': 'release_x64_test_features_gcmole_trybot',
       'v8_linux64_no_sandbox_compile_rel': 'release_x64_no_sandbox',
+      'v8_linux64_official_compile_rel': 'official_x64',
       'v8_linux64_predictable_compile_rel': 'release_x64_predictable',
+      'v8_linux64_pku_compile_rel': 'release_x64',
       'v8_linux64_shared_compile_rel': 'release_x64_shared_verify_heap',
       'v8_linux64_single_generation_compile_dbg': 'debug_x64_single_generation',
       'v8_linux64_no_wasm_compile_rel': 'release_x64_webassembly_disabled',
+      'v8_linux64_arm64_no_wasm_compile_dbg': 'debug_arm64_webassembly_disabled',
       'v8_linux64_verify_csa_compile_rel': 'release_x64_verify_csa',
       'v8_linux64_asan_compile_rel': 'release_x64_asan_minimal_symbols',
       'v8_linux64_cfi_compile_rel': 'release_x64_cfi',
@@ -272,12 +294,14 @@
       'v8_linux64_msan_compile_rel': 'release_simulate_arm64_msan_minimal_symbols',
       'v8_linux_riscv32_compile_rel': 'release_simulate_riscv32',
       'v8_linux64_riscv64_compile_rel': 'release_simulate_riscv64',
+      'v8_linux64_riscv64_pointer_compression_compile_rel': 'release_simulate_riscv64_pointer_compression',
       'v8_linux64_tsan_compile_rel': 'release_x64_tsan_minimal_symbols',
       'v8_linux64_tsan_compile_dbg': 'debug_x64_tsan_minimal_symbols',
       'v8_linux64_tsan_no_cm_compile_rel': 'release_x64_tsan_no_cm',
       'v8_linux64_tsan_isolates_compile_rel':
           'release_x64_tsan_minimal_symbols',
       'v8_linux64_ubsan_compile_rel': 'release_x64_ubsan_minimal_symbols',
+      'v8_linux64_verify_builtins_rel': 'release_x64_verify_builtins',
       'v8_linux64_verify_deterministic_rel': 'release_x64_verify_deterministic',
       'v8_odroid_arm_compile_rel': 'release_arm',
       'v8_linux_torque_compare': 'torque_compare',
@@ -457,6 +481,8 @@
       'release_bot', 'simulate_riscv32'],
     'release_simulate_riscv64': [
       'release_bot', 'simulate_riscv64'],
+    'release_simulate_riscv64_pointer_compression': [
+      'release_bot', 'simulate_riscv64', 'v8_enable_pointer_compression'],
     'release_simulate_s390x': [
       'release_bot', 'simulate_s390x'],
 
@@ -467,9 +493,13 @@
       'debug_bot', 'arm', 'hard_float'],
     'debug_arm64': [
       'debug_bot', 'arm64'],
+    'debug_arm64_trybot': [
+      'debug_trybot', 'arm64'],
     'debug_arm64_no_pointer_compression': [
       'debug_bot', 'arm64', 'no_sandbox', 'dcheck_always_on', 'v8_enable_slow_dchecks', 'v8_enable_javascript_promise_hooks',
       'v8_disable_pointer_compression'],
+    'debug_arm64_webassembly_disabled': [
+      'debug_bot', 'arm64', 'webassembly_disabled'],
     'full_debug_arm64': [
       'debug_bot', 'arm64', 'v8_full_debug'],
 
@@ -478,6 +508,8 @@
       'release_bot', 'arm', 'hard_float'],
     'release_arm64': [
       'release_bot', 'arm64'],
+    'release_arm64_trybot': [
+      'release_trybot', 'arm64'],
     'release_arm64_hard_float': [
       'release_bot', 'arm64', 'hard_float'],
     'release_android_arm': [
@@ -593,6 +625,8 @@
       'release_bot', 'x64', 'ubsan_recover'],
     'release_x64_shared_verify_heap': [
       'release_bot', 'x64', 'shared', 'v8_verify_heap'],
+    'release_x64_verify_builtins': [
+      'release_bot', 'x64', 'v8_verify_builtins'],
     'release_x64_verify_csa': [
       'release_bot', 'x64', 'dcheck_always_on',
       'v8_enable_slow_dchecks', 'v8_verify_csa'],
@@ -630,6 +664,8 @@
       'debug_bot_no_goma', 'x64', 'gcc', 'lld', 'no_custom_libcxx'],
     'debug_x64_header_includes': [
       'debug_bot', 'x64', 'v8_check_header_includes'],
+    'debug_x64_no_shared_cage': [
+      'debug_bot', 'x64', 'v8_disable_pointer_compression_shared_cage'],
     'debug_x64_minimal_symbols': [
       'debug_bot', 'x64', 'minimal_symbols'],
     'debug_x64_non_default_cppgc': [
@@ -1038,6 +1074,12 @@
     'v8_disable_pointer_compression': {
       'gn_args': 'v8_enable_pointer_compression=false',
     },
+    'v8_enable_pointer_compression': {
+      'gn_args': 'v8_enable_pointer_compression=true',
+    },
+    'v8_disable_pointer_compression_shared_cage': {
+      'gn_args': 'v8_enable_pointer_compression_shared_cage=false',
+    },
     'v8_enable_single_generation': {
       'gn_args': 'v8_enable_single_generation=true '
                  'v8_disable_write_barriers=true',
@@ -1083,6 +1125,10 @@
       'gn_args': 'v8_enable_verify_heap=true',
     },
 
+    'v8_verify_builtins': {
+      'gn_args': 'v8_verify_builtins_compatibility=true',
+    },
+
     'v8_verify_csa': {
       'gn_args': 'v8_enable_verify_csa=true',
     },
diff --git a/deps/v8/infra/testing/builders.pyl b/deps/v8/infra/testing/builders.pyl
index 565e33620e3554..2e3513a7416951 100644
--- a/deps/v8/infra/testing/builders.pyl
+++ b/deps/v8/infra/testing/builders.pyl
@@ -48,7 +48,7 @@
   # Fuchsia
   'v8_fuchsia_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'fuchsia-unittests'},
@@ -56,7 +56,7 @@
   },
   'V8 Fuchsia': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'fuchsia-unittests'},
@@ -67,16 +67,16 @@
   'v8_linux_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
       {'name': 'benchmarks', 'variant': 'extra'},
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'mozilla'},
       {'name': 'mozilla', 'variant': 'extra'},
       {'name': 'test262', 'variant': 'default', 'shards': 2},
-      {'name': 'test262', 'variant': 'extra', 'shards': 5},
+      {'name': 'test262', 'variant': 'future', 'shards': 2},
+      {'name': 'test262', 'variant': 'extra', 'shards': 7},
       {'name': 'v8testing', 'shards': 4},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 4},
       # Noavx.
@@ -112,7 +112,7 @@
   },
   'v8_linux_gc_stress_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'mjsunit', 'variant': 'slow_path', 'test_args': ['--gc-stress'], 'shards': 2},
@@ -122,7 +122,7 @@
   'v8_linux_nodcheck_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
@@ -132,7 +132,7 @@
       {'name': 'test262', 'shards': 4},
       {'name': 'test262', 'variant': 'extra', 'shards': 4},
       {'name': 'v8testing', 'shards': 2},
-      {'name': 'v8testing', 'variant': 'extra'},
+      {'name': 'v8testing', 'variant': 'extra', 'shards': 2},
       {
         'name': 'v8testing',
         'suffix': 'nosse3',
@@ -146,7 +146,7 @@
   },
   'v8_linux_noi18n_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'mozilla', 'variant': 'default'},
@@ -157,12 +157,11 @@
   'v8_linux_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
       {'name': 'benchmarks', 'variant': 'extra'},
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'mozilla'},
       {'name': 'mozilla', 'variant': 'extra'},
       {'name': 'optimize_for_size'},
@@ -186,7 +185,7 @@
   'v8_linux_optional_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       # Code serializer.
@@ -292,7 +291,7 @@
   },
   'v8_linux_verify_csa_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 2},
@@ -302,10 +301,9 @@
   # Linux32 with arm simulators
   'v8_linux_arm_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'mjsunit_sp_frame_access', 'shards': 3},
       {'name': 'mozilla', 'shards': 3},
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 10},
@@ -314,7 +312,7 @@
   },
   'v8_linux_arm_lite_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default', 'shards': 4},
@@ -322,10 +320,9 @@
   },
   'v8_linux_arm_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'mjsunit_sp_frame_access', 'shards': 2},
       {'name': 'mozilla', 'shards': 2},
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 10},
@@ -335,9 +332,29 @@
   },
   ##############################################################################
   # Linux64
+  'v8_linux64_arm64_dbg': {
+    'swarming_dimensions': {
+      'os': 'Linux',
+      'cpu': 'arm64',
+      'pool': 'chromium.tests',
+    },
+    'tests': [
+      {'name': 'v8testing', 'variant': 'default'},
+    ],
+  },
+  'v8_linux64_arm64_rel': {
+    'swarming_dimensions': {
+      'os': 'Linux',
+      'cpu': 'arm64',
+      'pool': 'chromium.tests',
+    },
+    'tests': [
+      {'name': 'v8testing', 'variant': 'default'},
+    ],
+  },
   'v8_linux64_asan_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'test262', 'shards': 12},
@@ -348,7 +365,7 @@
   },
   'v8_linux64_cfi_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
@@ -360,7 +377,7 @@
   },
   'v8_linux64_coverage_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default'},
@@ -369,7 +386,7 @@
   },
   'v8_linux64_coverage_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default'},
@@ -379,7 +396,7 @@
   'v8_linux64_cppgc_non_default_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -387,7 +404,7 @@
   },
   'v8_linux64_css_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 5},
@@ -396,32 +413,41 @@
   'v8_linux64_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks', 'shards': 2},
       {'name': 'benchmarks', 'variant': 'extra', 'shards': 2},
-      {'name': 'mjsunit_sp_frame_access', 'shards': 2},
       {'name': 'mozilla'},
       {'name': 'mozilla', 'variant': 'extra'},
       {'name': 'test262', 'variant': 'default', 'shards': 3},
-      {'name': 'test262', 'variant': 'extra', 'shards': 12},
+      {'name': 'test262', 'variant': 'future', 'shards': 3},
+      {'name': 'test262', 'variant': 'extra', 'shards': 14},
       {'name': 'v8testing', 'shards': 5},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 5},
-      {'name': 'v8testing', 'variant': 'minor_mc'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
       {'name': 'v8testing', 'variant': 'no_lfa'},
       {'name': 'v8testing', 'variant': 'stress_instruction_scheduling'},
       {'name': 'v8testing', 'variant': 'stress_concurrent_allocation'},
       {'name': 'v8testing', 'variant': 'stress_concurrent_inlining'},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
+      # GC stress
+      {
+        'name': 'd8testing',
+        'suffix': 'gc-stress',
+        'test_args': ['--gc-stress'],
+        'shards': 7,
+      },
     ],
   },
   'v8_linux64_dict_tracking_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -429,7 +455,7 @@
   },
   'v8_linux64_disable_runtime_call_stats_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing'},
@@ -438,7 +464,7 @@
   'v8_linux64_external_code_space_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -446,14 +472,14 @@
   },
   'v8_linux64_fuzzilli_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     # TODO(almuthanna): Add a new test config for the fuzzilli suite.
     'tests': [],
   },
   'v8_linux64_fyi_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       # Infra staging.
@@ -463,15 +489,16 @@
       {'name': 'webkit', 'variant': 'stress_sampling'},
       # Stress snapshot.
       {'name': 'mjsunit', 'variant': 'stress_snapshot'},
-      # Stress maglev-future.
-      {'name': 'mjsunit', 'variant': 'maglev_future'},
       # Experimental regexp engine.
       {'name': 'mjsunit', 'variant': 'experimental_regexp'},
+      # Variants for maglev.
+      {'name': 'v8testing', 'variant': 'maglev_no_turbofan'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_no_turbofan'},
     ],
   },
   'v8_linux64_gc_stress_custom_snapshot_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {
@@ -484,7 +511,7 @@
   'v8_linux64_gc_stress_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'd8testing', 'test_args': ['--gc-stress'], 'shards': 5},
@@ -495,11 +522,17 @@
         'shards': 2
       },
       {
-        'name': 'mjsunit',
+        'name': 'd8testing',
         'variant': 'maglev',
         'test_args': ['--gc-stress'],
         'shards': 2
       },
+      {
+        'name': 'mjsunit',
+        'variant': 'minor_ms',
+        'test_args': ['--gc-stress'],
+        'shards': 2
+      },
     ],
   },
   'v8_linux64_gcc_rel': {
@@ -513,19 +546,24 @@
   'v8_linux64_minor_mc_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'v8testing', 'variant': 'minor_mc'},
-      {'name': 'benchmarks', 'variant': 'minor_mc'},
-      {'name': 'mozilla', 'variant': 'minor_mc'},
-      {'name': 'test262', 'variant': 'minor_mc', 'shards': 2},
-      {'name': 'mjsunit', 'variant': 'minor_mc'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
+      {'name': 'benchmarks', 'variant': 'minor_ms'},
+      {'name': 'mozilla', 'variant': 'minor_ms'},
+      {'name': 'test262', 'variant': 'minor_ms', 'shards': 2},
+      {'name': 'mjsunit', 'variant': 'minor_ms'},
+      {'name': 'v8testing', 'variant': 'concurrent_minor_ms'},
+      {'name': 'benchmarks', 'variant': 'concurrent_minor_ms'},
+      {'name': 'mozilla', 'variant': 'concurrent_minor_ms'},
+      {'name': 'test262', 'variant': 'concurrent_minor_ms', 'shards': 2},
+      {'name': 'mjsunit', 'variant': 'concurrent_minor_ms'},
     ],
   },
   'v8_linux64_msan_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-20.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'test262', 'variant': 'default', 'shards': 4},
@@ -535,7 +573,7 @@
   'v8_linux64_nodcheck_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
@@ -551,17 +589,28 @@
       {'name': 'test262', 'variant': 'extra', 'shards': 4},
       {'name': 'v8testing', 'shards': 2},
       {'name': 'v8testing', 'variant': 'assert_types'},
-      {'name': 'v8testing', 'variant': 'extra'},
+      {'name': 'v8testing', 'variant': 'extra', 'shards': 2},
       {'name': 'v8testing', 'variant': 'no_lfa'},
       {'name': 'v8testing', 'variant': 'stress_instruction_scheduling'},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'v8_linux64_perfetto_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
+    },
+    'tests': [
+      {'name': 'v8testing', 'shards': 3},
+    ],
+  },
+  'v8_linux64_no_shared_cage_dbg': {
+    'swarming_dimensions' : {
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -569,7 +618,7 @@
   },
   'v8_linux64_no_pointer_compression_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -578,15 +627,34 @@
   'v8_linux64_no_sandbox_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 5},
     ],
   },
+  'v8_linux64_official_rel': {
+    'swarming_dimensions' : {
+      'cpu': 'x86-64-avx2',
+      'os': 'Ubuntu-22.04',
+    },
+    'tests': [
+      {'name': 'v8testing', 'shards': 2},
+    ],
+  },
+  'v8_linux64_pku_rel': {
+    'swarming_dimensions' : {
+      'os': 'Ubuntu-22.04',
+      'cpu': 'x86-64-avx2',
+      'pool': 'v8.tests',
+    },
+    'tests': [
+      {'name': 'v8testing', 'variant': 'default'},
+    ],
+  },
   'v8_linux64_single_generation_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -595,25 +663,26 @@
   'v8_linux64_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       # TODO(machenbach): Add benchmarks.
       # TODO(machenbach): Add mozilla tests.
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'optimize_for_size'},
       {'name': 'test262', 'shards': 4},
       {'name': 'test262', 'variant': 'extra', 'shards': 4},
       {'name': 'v8initializers'},
       {'name': 'v8testing', 'shards': 2},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 2},
-      {'name': 'v8testing', 'variant': 'minor_mc'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
       {'name': 'v8testing', 'variant': 'no_lfa'},
       {'name': 'v8testing', 'variant': 'slow_path'},
       {'name': 'v8testing', 'variant': 'stress_instruction_scheduling'},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
       # GCMole.
       {'name': 'gcmole_v3', 'variant': 'x64', 'shards': 4},
       {
@@ -633,7 +702,7 @@
   'v8_linux64_predictable_rel': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
@@ -644,7 +713,7 @@
   'v8_linux64_no_sandbox_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 2},
@@ -652,7 +721,7 @@
   },
   'v8_linux64_tsan_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks', 'shards': 2},
@@ -666,7 +735,7 @@
   },
   'v8_linux64_tsan_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks', 'shards': 2},
@@ -678,25 +747,16 @@
   },
   'v8_linux64_tsan_no_cm_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {
-        'name': 'v8testing',
-        'shards': 6,
-      },
-      {
-        'name': 'v8testing',
-        'suffix': 'future',
-        'test_args': ['--extra-flags=--future'],
-        'shards': 6,
-      },
+      {'name': 'v8testing', 'shards': 6},
       {'name': 'v8testing', 'variant': 'stress_concurrent_inlining', 'shards': 2},
     ],
   },
   'v8_linux64_tsan_isolates_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'test_args': ['--isolates'], 'shards': 7},
@@ -704,7 +764,7 @@
   },
   'v8_linux64_ubsan_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 2},
@@ -712,7 +772,7 @@
   },
   'v8_linux64_verify_csa_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 2},
@@ -722,10 +782,9 @@
   # Linux64 with arm64 simulators
   'v8_linux_arm64_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'mjsunit_sp_frame_access', 'shards': 2},
       {'name': 'mozilla', 'shards': 4},
       {'name': 'test262', 'variant': 'default', 'shards': 4},
       {'name': 'v8testing', 'shards': 14},
@@ -734,7 +793,7 @@
   },
   'v8_linux_arm64_gc_stress_dbg': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'd8testing', 'test_args': ['--gc-stress'], 'shards': 12},
@@ -742,10 +801,9 @@
   },
   'v8_linux_arm64_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'mjsunit_sp_frame_access', 'shards': 4},
       {'name': 'mozilla', 'shards': 4},
       {'name': 'test262', 'variant': 'default', 'shards': 4},
       {'name': 'v8testing', 'shards': 14},
@@ -755,7 +813,7 @@
   },
   'v8_linux_arm64_cfi_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'test262', 'variant': 'default', 'shards': 3},
@@ -764,7 +822,7 @@
   },
   'v8_linux64_arm64_no_pointer_compression_rel': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default', 'shards': 4},
@@ -774,7 +832,7 @@
   # Linux64 with Loongson simulators
   'v8_linux64_loong64_rel': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -784,7 +842,7 @@
   # Linux with RISC-V simulators
   'v8_linux_riscv32_rel': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -792,7 +850,15 @@
   },
   'v8_linux64_riscv64_rel': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
+    },
+    'tests': [
+      {'name': 'v8testing', 'shards': 3},
+    ],
+  },
+  'v8_linux64_riscv64_pointer_compression_rel': {
+    'swarming_dimensions': {
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -803,7 +869,7 @@
   'v8_odroid_arm_rel': {
     'swarming_dimensions' : {
       'cores': '8',
-      'cpu': 'armv7l-32-ODROID-XU4',
+      'cpu': 'armv7l-32-Hardkernel_ODROID-XU4',
       'os': 'Ubuntu',
     },
     'swarming_task_attrs': {
@@ -859,6 +925,7 @@
       {'name': 'test262', 'variant': 'default', 'shards': 4},
       {'name': 'v8testing', 'shards': 3},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 2},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'v8_win64_msvc_rel': {
@@ -882,6 +949,7 @@
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 2},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 2},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   ##############################################################################
@@ -889,7 +957,7 @@
   'v8_mac64_asan_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 8},
@@ -898,19 +966,20 @@
   'v8_mac64_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'mozilla'},
       {'name': 'test262', 'variant': 'default', 'shards': 4},
       {'name': 'v8testing', 'shards': 6},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 6},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'v8_mac64_gc_stress_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'd8testing', 'test_args': ['--gc-stress'], 'shards': 6},
@@ -919,7 +988,7 @@
   'v8_mac64_noopt_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 6},
@@ -928,58 +997,68 @@
   'v8_mac64_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'mozilla'},
       {'name': 'test262', 'variant': 'default', 'shards': 3},
       {'name': 'v8testing', 'shards': 3},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 3},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'v8_mac_arm64_rel': {
     'swarming_dimensions' : {
       'cpu': 'arm64',
-      'os': 'Mac-11',
+      'os': 'Mac-13',
       'pool': 'chromium.tests',
     },
     'tests': [
       {'name': 'v8testing'},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'v8_mac_arm64_dbg': {
     'swarming_dimensions' : {
       'cpu': 'arm64',
-      'os': 'Mac-11',
+      'os': 'Mac-13',
       'pool': 'chromium.tests',
     },
     'tests': [
       {'name': 'v8testing'},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'v8_mac_arm64_full_dbg': {
     'swarming_dimensions' : {
       'cpu': 'arm64',
-      'os': 'Mac-11',
+      'os': 'Mac-13',
       'pool': 'chromium.tests',
     },
     'tests': [
       {'name': 'v8testing'},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'v8_mac_arm64_no_pointer_compression_dbg': {
     'swarming_dimensions' : {
       'cpu': 'arm64',
-      'os': 'Mac-11',
+      'os': 'Mac-13',
       'pool': 'chromium.tests',
     },
     'tests': [
@@ -989,30 +1068,30 @@
   'v8_mac_arm64_sim_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
-      {'name': 'v8testing', 'shards': 8},
+      {'name': 'v8testing', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'variant': 'future', 'shards': 2},
     ],
   },
   'v8_mac_arm64_sim_dbg': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
-      {'name': 'v8testing', 'shards': 8},
+      {'name': 'v8testing', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'variant': 'future', 'shards': 2},
     ],
   },
   'v8_mac_arm64_sim_nodcheck_rel': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
-      {'name': 'v8testing', 'shards': 8},
+      {'name': 'v8testing', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'variant': 'future', 'shards': 2},
     ],
   },
@@ -1020,28 +1099,14 @@
   ### luci.v8.ci
   ##############################################################################
   # Main.
-  'V8 Fuzzer': {
-    'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
-    },
-    'swarming_task_attrs': {
-      'expiration': 14400,
-      'hard_timeout': 3600,
-      'priority': 35,
-    },
-    'tests': [
-      {'name': 'jsfunfuzz'},
-    ],
-  },
   'V8 Linux': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
       {'name': 'benchmarks', 'variant': 'extra'},
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'mozilla'},
       {'name': 'mozilla', 'variant': 'extra'},
       {'name': 'optimize_for_size'},
@@ -1108,7 +1173,7 @@
   },
   'V8 Linux - arm64 - sim - CFI': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'test262', 'variant': 'default', 'shards': 3},
@@ -1117,7 +1182,7 @@
   },
   'V8 Linux - arm64 - sim - MSAN': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-20.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'test262', 'variant': 'default', 'shards': 4},
@@ -1127,21 +1192,20 @@
   'V8 Linux - debug': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
       {'name': 'benchmarks', 'variant': 'code_serializer', 'shards': 1},
       {'name': 'benchmarks', 'variant': 'extra'},
       {'name': 'd8testing', 'variant': 'code_serializer', 'shards': 1},
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'mozilla'},
       {'name': 'mozilla', 'variant': 'code_serializer', 'shards': 1},
       {'name': 'mozilla', 'variant': 'extra'},
       {'name': 'optimize_for_size'},
-      {'name': 'test262', 'shards': 12},
+      {'name': 'test262', 'shards': 10},
       {'name': 'test262', 'variant': 'code_serializer', 'shards': 2},
-      {'name': 'test262', 'variant': 'extra', 'shards': 10},
+      {'name': 'test262', 'variant': 'extra', 'shards': 12},
       {'name': 'v8testing', 'shards': 3},
       {
         'name': 'v8testing',
@@ -1230,7 +1294,7 @@
   },
   'V8 Linux - full debug': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default', 'shards': 6},
@@ -1238,7 +1302,7 @@
   },
   'V8 Linux - gc stress': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {
@@ -1256,7 +1320,7 @@
   },
   'V8 Linux - noi18n - debug': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'mozilla', 'variant': 'default'},
@@ -1267,7 +1331,7 @@
   'V8 Linux64 - predictable': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
@@ -1277,7 +1341,7 @@
   },
   'V8 Linux - shared': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'mozilla'},
@@ -1287,7 +1351,7 @@
   },
   'V8 Linux - verify csa': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing'},
@@ -1295,7 +1359,7 @@
   },
   'V8 Linux PGO instrumentation - builder' : {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'pgo_instrumentation'}
@@ -1304,14 +1368,13 @@
   'V8 Linux64': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
       {'name': 'benchmarks', 'variant': 'assert_types'},
       {'name': 'benchmarks', 'variant': 'extra'},
       {'name': 'check-bytecode-baseline'},
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'mozilla'},
       {'name': 'mozilla', 'variant': 'assert_types'},
       {'name': 'mozilla', 'variant': 'extra'},
@@ -1324,12 +1387,14 @@
       {'name': 'v8testing'},
       {'name': 'v8testing', 'variant': 'assert_types'},
       {'name': 'v8testing', 'variant': 'extra'},
-      {'name': 'v8testing', 'variant': 'minor_mc'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
       {'name': 'v8testing', 'variant': 'no_lfa'},
       {'name': 'v8testing', 'variant': 'stress_instruction_scheduling'},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
       # Noavx.
       {
         'name': 'mozilla',
@@ -1364,9 +1429,18 @@
       },
     ],
   },
+  'V8 Linux64 - official': {
+    'swarming_dimensions' : {
+      'cpu': 'x86-64-avx2',
+      'os': 'Ubuntu-22.04',
+    },
+    'tests': [
+      {'name': 'v8testing', 'shards': 2},
+    ],
+  },
   'V8 Linux64 - cfi': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
@@ -1378,7 +1452,7 @@
   },
   'V8 Linux64 - coverage': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default'},
@@ -1387,7 +1461,7 @@
   },
   'V8 Linux64 - coverage - debug': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default'},
@@ -1396,7 +1470,7 @@
   },
   'V8 Linux64 - custom snapshot - debug': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'mjsunit', 'test_args': ['--no-harness']},
@@ -1405,28 +1479,29 @@
   'V8 Linux64 - debug': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks'},
-      {'name': 'benchmarks', 'variant': 'extra'},
-      {'name': 'mjsunit_sp_frame_access'},
+      {'name': 'benchmarks', 'variant': 'extra', 'shards': 2},
       {'name': 'mozilla'},
       {'name': 'mozilla', 'variant': 'extra'},
       {'name': 'optimize_for_size'},
       {'name': 'test262', 'shards': 7},
-      {'name': 'test262', 'variant': 'extra', 'shards': 5},
+      {'name': 'test262', 'variant': 'extra', 'shards': 7},
       {'name': 'v8testing', 'shards': 2},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 4},
-      {'name': 'v8testing', 'variant': 'minor_mc'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
       {'name': 'v8testing', 'variant': 'no_lfa'},
       {'name': 'v8testing', 'variant': 'slow_path'},
       {'name': 'v8testing', 'variant': 'stress_instruction_scheduling'},
       {'name': 'v8testing', 'variant': 'stress_concurrent_allocation'},
       {'name': 'v8testing', 'variant': 'stress_concurrent_inlining', 'shards': 2},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
       # Noavx.
       {
         'name': 'mozilla',
@@ -1451,19 +1526,24 @@
   'V8 Linux64 - minor mc - debug': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'v8testing', 'variant': 'minor_mc'},
-      {'name': 'benchmarks', 'variant': 'minor_mc'},
-      {'name': 'mozilla', 'variant': 'minor_mc'},
-      {'name': 'test262', 'variant': 'minor_mc', 'shards': 2},
-      {'name': 'mjsunit', 'variant': 'minor_mc'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
+      {'name': 'benchmarks', 'variant': 'minor_ms'},
+      {'name': 'mozilla', 'variant': 'minor_ms'},
+      {'name': 'test262', 'variant': 'minor_ms', 'shards': 2},
+      {'name': 'mjsunit', 'variant': 'minor_ms'},
+      {'name': 'v8testing', 'variant': 'concurrent_minor_ms'},
+      {'name': 'benchmarks', 'variant': 'concurrent_minor_ms'},
+      {'name': 'mozilla', 'variant': 'concurrent_minor_ms'},
+      {'name': 'test262', 'variant': 'concurrent_minor_ms', 'shards': 2},
+      {'name': 'mjsunit', 'variant': 'concurrent_minor_ms'},
     ],
   },
   'V8 Linux64 - disable runtime call stats': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing'},
@@ -1471,7 +1551,7 @@
   },
   'V8 Linux64 - debug - fyi': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       # Infra staging.
@@ -1481,16 +1561,17 @@
       {'name': 'webkit', 'variant': 'stress_sampling'},
       # Stress snapshot.
       {'name': 'mjsunit', 'variant': 'stress_snapshot'},
-      # Stress maglev-future.
-      {'name': 'mjsunit', 'variant': 'maglev_future'},
       # Experimental regexp engine.
       {'name': 'mjsunit', 'variant': 'experimental_regexp'},
+      # Variants for maglev.
+      {'name': 'v8testing', 'variant': 'maglev_no_turbofan'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_no_turbofan'},
     ],
   },
   'V8 Linux64 - cppgc-non-default - debug': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -1498,7 +1579,7 @@
   },
   'V8 Linux64 - debug - perfetto': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -1511,7 +1592,7 @@
   },
   'V8 Linux64 - debug - single generation': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -1525,7 +1606,7 @@
   'V8 Linux64 - external code space - debug': {
     'swarming_dimensions' : {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 3},
@@ -1533,7 +1614,7 @@
   },
   'V8 Linux64 - fyi': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       # Infra staging.
@@ -1543,10 +1624,21 @@
       {'name': 'webkit', 'variant': 'stress_sampling'},
       # Stress snapshot.
       {'name': 'mjsunit', 'variant': 'stress_snapshot'},
-      # Stress maglev-future.
-      {'name': 'mjsunit', 'variant': 'maglev_future'},
       # Experimental regexp engine.
       {'name': 'mjsunit', 'variant': 'experimental_regexp'},
+      # Variants for maglev.
+      {'name': 'v8testing', 'variant': 'maglev_no_turbofan'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_no_turbofan'},
+    ],
+  },
+  'V8 Linux64 - PKU': {
+    'swarming_dimensions' : {
+      'os': 'Ubuntu-22.04',
+      'cpu': 'x86-64-avx2',
+      'pool': 'v8.tests',
+    },
+    'tests': [
+      {'name': 'v8testing', 'variant': 'default'},
     ],
   },
   'V8 Linux64 gcc': {
@@ -1560,7 +1652,7 @@
   'V8 Linux64 - gc stress': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {
@@ -1575,24 +1667,43 @@
         'shards': 2,
       },
       {
-        'name': 'mjsunit',
+        'name': 'd8testing',
         'variant': 'maglev',
         'test_args': ['--gc-stress'],
         'shards': 2
       },
+      {
+        'name': 'mjsunit',
+        'variant': 'minor_ms',
+        'test_args': ['--gc-stress'],
+        'shards': 2
+      },
     ],
   },
   'V8 Linux64 - internal snapshot': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing'},
     ],
   },
+  'V8 Linux64 - no shared cage - debug': {
+    'swarming_dimensions' : {
+      'os': 'Ubuntu-22.04',
+    },
+    'swarming_task_attrs': {
+      'expiration': 14400,
+      'hard_timeout': 3600,
+      'priority': 35,
+    },
+    'tests': [
+      {'name': 'v8testing', 'shards': 2},
+    ],
+  },
   'V8 Linux64 - no pointer compression': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 2},
@@ -1601,7 +1712,7 @@
   'V8 Linux64 - no sandbox': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing'},
@@ -1610,7 +1721,7 @@
   'V8 Linux64 - no sandbox - debug': {
     'swarming_dimensions': {
       'cpu': 'x86-64-avx2',
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 2},
@@ -1618,7 +1729,7 @@
   },
   'V8 Linux64 - shared': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'mozilla'},
@@ -1628,7 +1739,7 @@
   },
   'V8 Linux64 - verify csa': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing'},
@@ -1636,7 +1747,7 @@
   },
   'V8 Linux64 ASAN': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'test262', 'shards': 7},
@@ -1647,7 +1758,7 @@
   },
   'V8 Linux64 css - debug': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 5},
@@ -1655,7 +1766,7 @@
   },
   'V8 Linux64 GC Stress - custom snapshot': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {
@@ -1667,7 +1778,7 @@
   },
   'V8 Linux64 PGO instrumentation - builder' : {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'pgo_instrumentation'}
@@ -1675,7 +1786,7 @@
   },
   'V8 Linux64 TSAN': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks', 'shards': 2},
@@ -1689,19 +1800,19 @@
   },
   'V8 Linux64 TSAN - debug': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'benchmarks', 'shards': 2},
       {'name': 'mozilla', 'shards': 4},
       {'name': 'test262', 'variant': 'default', 'shards': 5},
       {'name': 'v8testing', 'shards': 12},
-      {'name': 'v8testing', 'variant': 'extra', 'shards': 10},
+      {'name': 'v8testing', 'variant': 'extra', 'shards': 12},
     ],
   },
   'V8 Linux64 TSAN - stress-incremental-marking': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -1734,7 +1845,7 @@
   },
   'V8 Linux64 TSAN - isolates': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'test_args': ['--isolates'], 'shards': 7},
@@ -1742,25 +1853,16 @@
   },
   'V8 Linux64 TSAN - no-concurrent-marking': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {
-        'name': 'v8testing',
-        'shards': 6,
-      },
-      {
-        'name': 'v8testing',
-        'suffix': 'future',
-        'test_args': ['--extra-flags=--future'],
-        'shards': 6,
-      },
+      {'name': 'v8testing', 'shards': 6},
       {'name': 'v8testing', 'variant': 'stress_concurrent_inlining', 'shards': 2},
     ],
   },
   'V8 Linux64 UBSan': {
     'swarming_dimensions' : {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'mozilla'},
@@ -1772,31 +1874,33 @@
   'V8 Mac64': {
     'swarming_dimensions': {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'mozilla'},
       {'name': 'test262', 'variant': 'default', 'shards': 3},
       {'name': 'v8testing', 'shards': 3},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 3},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'V8 Mac64 - debug': {
     'swarming_dimensions': {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'mozilla'},
       {'name': 'test262', 'variant': 'default', 'shards': 4},
       {'name': 'v8testing', 'shards': 6},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 6},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'V8 Mac64 ASAN': {
     'swarming_dimensions': {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'v8testing', 'shards': 10},
@@ -1805,7 +1909,7 @@
   'V8 Mac64 GC Stress': {
     'swarming_dimensions': {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'tests': [
       {'name': 'd8testing', 'test_args': ['--gc-stress'], 'shards': 6},
@@ -1813,7 +1917,7 @@
   },
   'V8 Mac - arm64 - release': {
     'swarming_dimensions' : {
-      'os': 'Mac-11',
+      'os': 'Mac-13',
       'cpu': 'arm64',
       'pool': 'chromium.tests',
     },
@@ -1826,13 +1930,16 @@
       {'name': 'v8testing'},
       {'name': 'v8testing', 'variant': 'extra'},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'V8 Mac - arm64 - debug': {
     'swarming_dimensions' : {
-      'os': 'Mac-11',
+      'os': 'Mac-13',
       'cpu': 'arm64',
       'pool': 'chromium.tests',
     },
@@ -1845,14 +1952,17 @@
       {'name': 'v8testing', 'shards': 2},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 2},
       # Maglev -- move to extra once more architectures are supported.
-      {'name': 'mjsunit', 'variant': 'maglev'},
-      {'name': 'mjsunit', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'maglev'},
+      {'name': 'v8testing', 'variant': 'maglev_future'},
+      {'name': 'v8testing', 'variant': 'stress_maglev'},
+      {'name': 'v8testing', 'variant': 'stress_maglev_future'},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'V8 Mac - arm64 - no pointer compression debug': {
     'swarming_dimensions' : {
       'cpu': 'arm64',
-      'os': 'Mac-11',
+      'os': 'Mac-13',
       'pool': 'chromium.tests',
     },
     'tests': [
@@ -1862,7 +1972,7 @@
   'V8 Mac - arm64 - sim - debug': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -1870,14 +1980,14 @@
       'priority': 35,
     },
     'tests': [
-      {'name': 'v8testing', 'shards': 10},
+      {'name': 'v8testing', 'variant': 'default', 'shards': 4},
       {'name': 'v8testing', 'variant': 'future', 'shards': 4},
     ],
   },
   'V8 Mac - arm64 - sim - release': {
     'swarming_dimensions' : {
       'cpu': 'x86-64',
-      'os': 'Mac-12',
+      'os': 'Mac-13',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -1885,7 +1995,7 @@
       'priority': 35,
     },
     'tests': [
-      {'name': 'v8testing', 'shards': 8},
+      {'name': 'v8testing', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'variant': 'future', 'shards': 2},
     ],
   },
@@ -1929,6 +2039,7 @@
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 2},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 2},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'V8 Win64 - debug': {
@@ -1940,6 +2051,7 @@
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 4},
       {'name': 'v8testing', 'variant': 'extra', 'shards': 3},
+      {'name': 'v8testing', 'variant': 'minor_ms'},
     ],
   },
   'V8 Win64 - msvc': {
@@ -1985,7 +2097,7 @@
   'V8 Arm': {
     'swarming_dimensions': {
       'cores': '8',
-      'cpu': 'armv7l-32-ODROID-XU4',
+      'cpu': 'armv7l-32-Hardkernel_ODROID-XU4',
       'os': 'Ubuntu',
     },
     'swarming_task_attrs': {
@@ -2014,7 +2126,7 @@
   'V8 Arm - debug': {
     'swarming_dimensions': {
       'cores': '8',
-      'cpu': 'armv7l-32-ODROID-XU4',
+      'cpu': 'armv7l-32-Hardkernel_ODROID-XU4',
       'os': 'Ubuntu',
     },
     'swarming_task_attrs': {
@@ -2042,7 +2154,7 @@
   'V8 Arm GC Stress': {
     'swarming_dimensions': {
       'cores': '8',
-      'cpu': 'armv7l-32-ODROID-XU4',
+      'cpu': 'armv7l-32-Hardkernel_ODROID-XU4',
       'os': 'Ubuntu',
     },
     'swarming_task_attrs': {
@@ -2061,10 +2173,9 @@
   },
   'V8 Linux - arm - sim': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'mozilla'},
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 6},
@@ -2113,10 +2224,9 @@
   },
   'V8 Linux - arm - sim - debug': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'mjsunit_sp_frame_access', 'shards': 3},
       {'name': 'mozilla', 'shards': 3},
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 10},
@@ -2166,7 +2276,7 @@
   },
   'V8 Linux - arm - sim - lite': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default', 'shards': 2},
@@ -2174,7 +2284,7 @@
   },
   'V8 Linux - arm - sim - lite - debug': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {'name': 'v8testing', 'variant': 'default', 'shards': 4},
@@ -2182,10 +2292,9 @@
   },
   'V8 Linux - arm64 - sim': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'mozilla'},
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 3},
@@ -2195,14 +2304,13 @@
   },
   'V8 Linux - arm64 - sim - debug': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     # TODO(machenbach): Remove longer timeout when this builder scales better.
     'swarming_task_attrs': {
       'hard_timeout': 3600,
     },
     'tests': [
-      {'name': 'mjsunit_sp_frame_access'},
       {'name': 'mozilla', 'shards': 2},
       {'name': 'test262', 'variant': 'default', 'shards': 2},
       {'name': 'v8testing', 'shards': 12},
@@ -2211,7 +2319,7 @@
   },
   'V8 Linux - arm64 - sim - gc stress': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -2228,7 +2336,7 @@
   },
   'V8 Linux - loong64 - sim': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -2241,7 +2349,7 @@
   },
   'V8 Linux - mips64el - sim': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -2255,7 +2363,7 @@
   },
   'V8 Linux - ppc64 - sim': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -2268,7 +2376,7 @@
   },
   'V8 Linux - riscv32 - sim': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -2281,7 +2389,20 @@
   },
   'V8 Linux - riscv64 - sim': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
+    },
+    'swarming_task_attrs': {
+      'expiration': 14400,
+      'hard_timeout': 3600,
+      'priority': 35,
+    },
+    'tests': [
+      {'name': 'v8testing', 'shards': 3},
+    ],
+  },
+  'V8 Linux - riscv64 - sim - pointer compression': {
+    'swarming_dimensions': {
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -2294,7 +2415,7 @@
   },
   'V8 Linux - s390x - sim': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -2305,9 +2426,29 @@
       {'name': 'v8testing', 'shards': 3},
     ],
   },
+  'V8 Linux64 - arm64': {
+    'swarming_dimensions': {
+      'os': 'Linux',
+      'cpu': 'arm64',
+      'pool': 'chromium.tests',
+    },
+    'tests': [
+      {'name': 'v8testing',  'variant': 'default'},
+    ],
+  },
+  'V8 Linux64 - arm64 - debug': {
+    'swarming_dimensions': {
+      'os': 'Linux',
+      'cpu': 'arm64',
+      'pool': 'chromium.tests',
+    },
+    'tests': [
+      {'name': 'v8testing', 'variant': 'default'},
+    ],
+  },
   'V8 Linux64 - arm64 - sim - no pointer compression': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 14400,
@@ -2322,7 +2463,7 @@
   # Clusterfuzz.
   'V8 NumFuzz': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 13800,
@@ -2344,7 +2485,7 @@
   },
   'V8 NumFuzz - TSAN': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 13800,
@@ -2404,7 +2545,7 @@
   },
   'V8 NumFuzz - debug': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'swarming_task_attrs': {
       'expiration': 13800,
@@ -2471,7 +2612,7 @@
   },
   'v8_numfuzz_rel': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {
@@ -2488,7 +2629,7 @@
   },
   'v8_numfuzz_tsan_rel': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {
@@ -2541,7 +2682,7 @@
   },
   'v8_numfuzz_dbg': {
     'swarming_dimensions': {
-      'os': 'Ubuntu-18.04',
+      'os': 'Ubuntu-22.04',
     },
     'tests': [
       {
@@ -2597,4 +2738,40 @@
       },
     ],
   },
+  # Try perf bots
+  'v8_android_arm_perf_try': {
+    'tests': [
+      {
+        'name': 'perf_integration',
+      },
+    ],
+  },
+  'v8_android_arm64_perf_try': {
+    'tests': [
+      {
+        'name': 'perf_integration',
+      },
+    ],
+  },
+  'v8_linux_perf_try': {
+    'tests': [
+      {
+        'name': 'perf_integration',
+      },
+    ],
+  },
+  'v8_linux64_perf_try': {
+    'tests': [
+      {
+        'name': 'perf_integration',
+      },
+    ],
+  },
+  'v8_mac_arm64_perf_try': {
+    'tests': [
+      {
+        'name': 'perf_integration',
+      },
+    ],
+  },
 }
diff --git a/deps/v8/samples/process.cc b/deps/v8/samples/process.cc
index 32e87b854be803..0af49e304ab7b3 100644
--- a/deps/v8/samples/process.cc
+++ b/deps/v8/samples/process.cc
@@ -176,17 +176,15 @@ class JsHttpRequestProcessor : public HttpRequestProcessor {
 // --- P r o c e s s o r ---
 // -------------------------
 
-
-static void LogCallback(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() < 1) return;
-  Isolate* isolate = args.GetIsolate();
+static void LogCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  if (info.Length() < 1) return;
+  Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
-  Local<Value> arg = args[0];
+  Local<Value> arg = info[0];
   String::Utf8Value value(isolate, arg);
   HttpRequestProcessor::Log(*value);
 }
 
-
 // Execute the script and fetch the Process method.
 bool JsHttpRequestProcessor::Initialize(map<string, string>* opts,
                                         map<string, string>* output) {
diff --git a/deps/v8/samples/shell.cc b/deps/v8/samples/shell.cc
index 046ed1e4eb53b7..f647214387a9de 100644
--- a/deps/v8/samples/shell.cc
+++ b/deps/v8/samples/shell.cc
@@ -56,11 +56,11 @@ int RunMain(v8::Isolate* isolate, v8::Platform* platform, int argc,
 bool ExecuteString(v8::Isolate* isolate, v8::Local<v8::String> source,
                    v8::Local<v8::Value> name, bool print_result,
                    bool report_exceptions);
-void Print(const v8::FunctionCallbackInfo<v8::Value>& args);
-void Read(const v8::FunctionCallbackInfo<v8::Value>& args);
-void Load(const v8::FunctionCallbackInfo<v8::Value>& args);
-void Quit(const v8::FunctionCallbackInfo<v8::Value>& args);
-void Version(const v8::FunctionCallbackInfo<v8::Value>& args);
+void Print(const v8::FunctionCallbackInfo<v8::Value>& info);
+void Read(const v8::FunctionCallbackInfo<v8::Value>& info);
+void Load(const v8::FunctionCallbackInfo<v8::Value>& info);
+void Quit(const v8::FunctionCallbackInfo<v8::Value>& info);
+void Version(const v8::FunctionCallbackInfo<v8::Value>& info);
 v8::MaybeLocal<v8::String> ReadFile(v8::Isolate* isolate, const char* name);
 void ReportException(v8::Isolate* isolate, v8::TryCatch* handler);
 
@@ -129,16 +129,16 @@ v8::Local<v8::Context> CreateShellContext(v8::Isolate* isolate) {
 // The callback that is invoked by v8 whenever the JavaScript 'print'
 // function is called.  Prints its arguments on stdout separated by
 // spaces and ending with a newline.
-void Print(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void Print(const v8::FunctionCallbackInfo<v8::Value>& info) {
   bool first = true;
-  for (int i = 0; i < args.Length(); i++) {
-    v8::HandleScope handle_scope(args.GetIsolate());
+  for (int i = 0; i < info.Length(); i++) {
+    v8::HandleScope handle_scope(info.GetIsolate());
     if (first) {
       first = false;
     } else {
       printf(" ");
     }
-    v8::String::Utf8Value str(args.GetIsolate(), args[i]);
+    v8::String::Utf8Value str(info.GetIsolate(), info[i]);
     const char* cstr = ToCString(str);
     printf("%s", cstr);
   }
@@ -146,73 +146,69 @@ void Print(const v8::FunctionCallbackInfo<v8::Value>& args) {
   fflush(stdout);
 }
 
-
 // The callback that is invoked by v8 whenever the JavaScript 'read'
 // function is called.  This function loads the content of the file named in
 // the argument into a JavaScript string.
-void Read(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() != 1) {
-    args.GetIsolate()->ThrowError("Bad parameters");
+void Read(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  if (info.Length() != 1) {
+    info.GetIsolate()->ThrowError("Bad parameters");
     return;
   }
-  v8::String::Utf8Value file(args.GetIsolate(), args[0]);
+  v8::String::Utf8Value file(info.GetIsolate(), info[0]);
   if (*file == NULL) {
-    args.GetIsolate()->ThrowError("Error loading file");
+    info.GetIsolate()->ThrowError("Error loading file");
     return;
   }
   v8::Local<v8::String> source;
-  if (!ReadFile(args.GetIsolate(), *file).ToLocal(&source)) {
-    args.GetIsolate()->ThrowError("Error loading file");
+  if (!ReadFile(info.GetIsolate(), *file).ToLocal(&source)) {
+    info.GetIsolate()->ThrowError("Error loading file");
     return;
   }
 
-  args.GetReturnValue().Set(source);
+  info.GetReturnValue().Set(source);
 }
 
 // The callback that is invoked by v8 whenever the JavaScript 'load'
 // function is called.  Loads, compiles and executes its argument
 // JavaScript file.
-void Load(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  for (int i = 0; i < args.Length(); i++) {
-    v8::HandleScope handle_scope(args.GetIsolate());
-    v8::String::Utf8Value file(args.GetIsolate(), args[i]);
+void Load(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  for (int i = 0; i < info.Length(); i++) {
+    v8::HandleScope handle_scope(info.GetIsolate());
+    v8::String::Utf8Value file(info.GetIsolate(), info[i]);
     if (*file == NULL) {
-      args.GetIsolate()->ThrowError("Error loading file");
+      info.GetIsolate()->ThrowError("Error loading file");
       return;
     }
     v8::Local<v8::String> source;
-    if (!ReadFile(args.GetIsolate(), *file).ToLocal(&source)) {
-      args.GetIsolate()->ThrowError("Error loading file");
+    if (!ReadFile(info.GetIsolate(), *file).ToLocal(&source)) {
+      info.GetIsolate()->ThrowError("Error loading file");
       return;
     }
-    if (!ExecuteString(args.GetIsolate(), source, args[i], false, false)) {
-      args.GetIsolate()->ThrowError("Error executing file");
+    if (!ExecuteString(info.GetIsolate(), source, info[i], false, false)) {
+      info.GetIsolate()->ThrowError("Error executing file");
       return;
     }
   }
 }
 
-
 // The callback that is invoked by v8 whenever the JavaScript 'quit'
 // function is called.  Quits.
-void Quit(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  // If not arguments are given args[0] will yield undefined which
+void Quit(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  // If not arguments are given info[0] will yield undefined which
   // converts to the integer value 0.
   int exit_code =
-      args[0]->Int32Value(args.GetIsolate()->GetCurrentContext()).FromMaybe(0);
+      info[0]->Int32Value(info.GetIsolate()->GetCurrentContext()).FromMaybe(0);
   fflush(stdout);
   fflush(stderr);
   exit(exit_code);
 }
 
-
-void Version(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().Set(
-      v8::String::NewFromUtf8(args.GetIsolate(), v8::V8::GetVersion())
+void Version(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  info.GetReturnValue().Set(
+      v8::String::NewFromUtf8(info.GetIsolate(), v8::V8::GetVersion())
           .ToLocalChecked());
 }
 
-
 // Reads a file into a v8 string.
 v8::MaybeLocal<v8::String> ReadFile(v8::Isolate* isolate, const char* name) {
   FILE* file = fopen(name, "rb");
diff --git a/deps/v8/src/DEPS b/deps/v8/src/DEPS
index ebe2dd0dc5442c..d87f05d66d96e6 100644
--- a/deps/v8/src/DEPS
+++ b/deps/v8/src/DEPS
@@ -12,6 +12,7 @@ include_rules = [
   "-src/compiler",
   "+src/compiler/code-assembler.h",
   "+src/compiler/turbofan.h",
+  "+src/compiler/turboshaft/wasm-turboshaft-compiler.h",
   "+src/compiler/wasm-compiler-definitions.h",
   "+src/compiler/wasm-compiler.h",
   "-src/heap",
@@ -38,6 +39,7 @@ include_rules = [
   "+src/heap/memory-chunk.h",
   "+src/heap/memory-chunk-inl.h",
   "+src/heap/paged-spaces-inl.h",
+  "+src/heap/parked-scope-inl.h",
   "+src/heap/parked-scope.h",
   "+src/heap/read-only-heap-inl.h",
   "+src/heap/read-only-heap.h",
@@ -100,5 +102,16 @@ specific_include_rules = {
   ],
   "etw-jit-metadata-win\.h": [
     "+src/libplatform/etw/etw-provider-win.h",
-  ]
+  ],
+  "external-pointer-table\.cc": [
+    "+src/heap/read-only-spaces.h",
+  ],
+  "script\.h": [
+    "+src/heap/factory.h",
+    "+src/heap/factory-base.h",
+    "+src/heap/local-factory.h",
+  ],
+  "snapshot\.cc": [
+    "+src/heap/read-only-promotion.h",
+  ],
 }
diff --git a/deps/v8/src/api/api-arguments-inl.h b/deps/v8/src/api/api-arguments-inl.h
index 31daa9a39cae89..b5aba465de731a 100644
--- a/deps/v8/src/api/api-arguments-inl.h
+++ b/deps/v8/src/api/api-arguments-inl.h
@@ -13,17 +13,17 @@
 #include "src/objects/api-callbacks.h"
 #include "src/objects/instance-type.h"
 #include "src/objects/slots-inl.h"
-#include "v8-isolate.h"
 
 namespace v8 {
 namespace internal {
 
 #if DEBUG
-bool Object::IsApiCallResultType() const {
-  if (IsSmi()) return true;
-  DCHECK(IsHeapObject());
-  return (IsString() || IsSymbol() || IsJSReceiver() || IsHeapNumber() ||
-          IsBigInt() || IsUndefined() || IsTrue() || IsFalse() || IsNull());
+bool IsApiCallResultType(Tagged<Object> obj) {
+  if (IsSmi(obj)) return true;
+  DCHECK(IsHeapObject(obj));
+  return (IsString(obj) || IsSymbol(obj) || IsJSReceiver(obj) ||
+          IsHeapNumber(obj) || IsBigInt(obj) || IsUndefined(obj) ||
+          IsTrue(obj) || IsFalse(obj) || IsNull(obj));
 }
 #endif  // DEBUG
 
@@ -41,105 +41,60 @@ Handle<V> CustomArguments<T>::GetReturnValue(Isolate* isolate) const {
   // Check the ReturnValue.
   FullObjectSlot slot = slot_at(kReturnValueIndex);
   // Nothing was set, return empty handle as per previous behaviour.
-  Object raw_object = *slot;
-  if (raw_object.IsTheHole(isolate)) return Handle<V>();
-  DCHECK(raw_object.IsApiCallResultType());
+  Tagged<Object> raw_object = *slot;
+  if (IsTheHole(raw_object, isolate)) return Handle<V>();
+  DCHECK(IsApiCallResultType(raw_object));
   return Handle<V>::cast(Handle<Object>(slot.location()));
 }
 
-inline JSObject PropertyCallbackArguments::holder() const {
+inline Tagged<JSObject> PropertyCallbackArguments::holder() const {
   return JSObject::cast(*slot_at(T::kHolderIndex));
 }
 
-inline Object PropertyCallbackArguments::receiver() const {
+inline Tagged<Object> PropertyCallbackArguments::receiver() const {
   return *slot_at(T::kThisIndex);
 }
 
-inline JSReceiver FunctionCallbackArguments::holder() const {
+inline Tagged<JSReceiver> FunctionCallbackArguments::holder() const {
   return JSReceiver::cast(*slot_at(T::kHolderIndex));
 }
 
-#define FOR_EACH_CALLBACK(F)                        \
-  F(Query, query, Object, v8::Integer, interceptor) \
-  F(Deleter, deleter, Object, v8::Boolean, Handle<Object>())
-
 #define DCHECK_NAME_COMPATIBLE(interceptor, name) \
   DCHECK(interceptor->is_named());                \
   DCHECK(!name->IsPrivate());                     \
-  DCHECK_IMPLIES(name->IsSymbol(), interceptor->can_intercept_symbols());
-
-#define PREPARE_CALLBACK_INFO(ISOLATE, F, RETURN_VALUE, API_RETURN_TYPE, \
-                              CALLBACK_INFO, RECEIVER, ACCESSOR_KIND)    \
-  if (ISOLATE->debug_execution_mode() == DebugInfo::kSideEffects &&      \
-      !ISOLATE->debug()->PerformSideEffectCheckForCallback(              \
-          CALLBACK_INFO, RECEIVER, Debug::k##ACCESSOR_KIND)) {           \
-    return RETURN_VALUE();                                               \
-  }                                                                      \
-  ExternalCallbackScope call_scope(ISOLATE, FUNCTION_ADDR(F));           \
-  PropertyCallbackInfo<API_RETURN_TYPE> callback_info(values_);
-
-#define PREPARE_CALLBACK_INFO_FAIL_SIDE_EFFECT_CHECK(ISOLATE, F, RETURN_VALUE, \
-                                                     API_RETURN_TYPE)          \
-  if (ISOLATE->debug_execution_mode() == DebugInfo::kSideEffects) {            \
-    return RETURN_VALUE();                                                     \
+  DCHECK_IMPLIES(IsSymbol(*name), interceptor->can_intercept_symbols());
+
+#define PREPARE_CALLBACK_INFO_ACCESSOR(ISOLATE, F, API_RETURN_TYPE,            \
+                                       ACCESSOR_INFO, RECEIVER, ACCESSOR_KIND) \
+  if (ISOLATE->should_check_side_effects() &&                                  \
+      !ISOLATE->debug()->PerformSideEffectCheckForAccessor(                    \
+          ACCESSOR_INFO, RECEIVER, ACCESSOR_KIND)) {                           \
+    return {};                                                                 \
   }                                                                            \
   ExternalCallbackScope call_scope(ISOLATE, FUNCTION_ADDR(F));                 \
   PropertyCallbackInfo<API_RETURN_TYPE> callback_info(values_);
 
-#define CREATE_NAMED_CALLBACK(FUNCTION, TYPE, RETURN_TYPE, API_RETURN_TYPE, \
-                              INFO_FOR_SIDE_EFFECT)                         \
-  Handle<RETURN_TYPE> PropertyCallbackArguments::CallNamed##FUNCTION(       \
-      Handle<InterceptorInfo> interceptor, Handle<Name> name) {             \
-    DCHECK_NAME_COMPATIBLE(interceptor, name);                              \
-    Isolate* isolate = this->isolate();                                     \
-    RCS_SCOPE(isolate, RuntimeCallCounterId::kNamed##FUNCTION##Callback);   \
-    Handle<Object> receiver_check_unsupported;                              \
-    GenericNamedProperty##FUNCTION##Callback f =                            \
-        ToCData<GenericNamedProperty##FUNCTION##Callback>(                  \
-            interceptor->TYPE());                                           \
-    PREPARE_CALLBACK_INFO(isolate, f, Handle<RETURN_TYPE>, API_RETURN_TYPE, \
-                          INFO_FOR_SIDE_EFFECT, receiver_check_unsupported, \
-                          NotAccessor);                                     \
-    f(v8::Utils::ToLocal(name), callback_info);                             \
-    return GetReturnValue<RETURN_TYPE>(isolate);                            \
-  }
-
-FOR_EACH_CALLBACK(CREATE_NAMED_CALLBACK)
-#undef CREATE_NAMED_CALLBACK
-
-#define CREATE_INDEXED_CALLBACK(FUNCTION, TYPE, RETURN_TYPE, API_RETURN_TYPE, \
-                                INFO_FOR_SIDE_EFFECT)                         \
-  Handle<RETURN_TYPE> PropertyCallbackArguments::CallIndexed##FUNCTION(       \
-      Handle<InterceptorInfo> interceptor, uint32_t index) {                  \
-    DCHECK(!interceptor->is_named());                                         \
-    Isolate* isolate = this->isolate();                                       \
-    RCS_SCOPE(isolate, RuntimeCallCounterId::kIndexed##FUNCTION##Callback);   \
-    Handle<Object> receiver_check_unsupported;                                \
-    IndexedProperty##FUNCTION##Callback f =                                   \
-        ToCData<IndexedProperty##FUNCTION##Callback>(interceptor->TYPE());    \
-    PREPARE_CALLBACK_INFO(isolate, f, Handle<RETURN_TYPE>, API_RETURN_TYPE,   \
-                          INFO_FOR_SIDE_EFFECT, receiver_check_unsupported,   \
-                          NotAccessor);                                       \
-    f(index, callback_info);                                                  \
-    return GetReturnValue<RETURN_TYPE>(isolate);                              \
-  }
-
-FOR_EACH_CALLBACK(CREATE_INDEXED_CALLBACK)
-
-#undef FOR_EACH_CALLBACK
-#undef CREATE_INDEXED_CALLBACK
+#define PREPARE_CALLBACK_INFO_INTERCEPTOR(ISOLATE, F, API_RETURN_TYPE, \
+                                          INTERCEPTOR_INFO)            \
+  if (ISOLATE->should_check_side_effects() &&                          \
+      !ISOLATE->debug()->PerformSideEffectCheckForInterceptor(         \
+          INTERCEPTOR_INFO)) {                                         \
+    return {};                                                         \
+  }                                                                    \
+  ExternalCallbackScope call_scope(ISOLATE, FUNCTION_ADDR(F));         \
+  PropertyCallbackInfo<API_RETURN_TYPE> callback_info(values_);
 
-Handle<Object> FunctionCallbackArguments::Call(CallHandlerInfo handler) {
+Handle<Object> FunctionCallbackArguments::Call(
+    Tagged<CallHandlerInfo> handler) {
   Isolate* isolate = this->isolate();
   RCS_SCOPE(isolate, RuntimeCallCounterId::kFunctionCallback);
   v8::FunctionCallback f =
-      reinterpret_cast<v8::FunctionCallback>(handler.callback());
+      reinterpret_cast<v8::FunctionCallback>(handler->callback(isolate));
   Handle<Object> receiver_check_unsupported;
-  if (isolate->debug_execution_mode() == DebugInfo::kSideEffects &&
+  if (isolate->should_check_side_effects() &&
       !isolate->debug()->PerformSideEffectCheckForCallback(
-          handle(handler, isolate), receiver_check_unsupported,
-          Debug::kNotAccessor)) {
-    return Handle<Object>();
+          handle(handler, isolate))) {
+    return {};
   }
   ExternalCallbackScope call_scope(isolate, FUNCTION_ADDR(f));
   FunctionCallbackInfo<v8::Value> info(values_, argv_, argc_);
@@ -158,6 +113,9 @@ PropertyCallbackArguments::~PropertyCallbackArguments(){
 #endif  // DEBUG
 }
 
+// -------------------------------------------------------------------------
+// Named Interceptor callbacks.
+
 Handle<JSObject> PropertyCallbackArguments::CallNamedEnumerator(
     Handle<InterceptorInfo> interceptor) {
   DCHECK(interceptor->is_named());
@@ -165,39 +123,40 @@ Handle<JSObject> PropertyCallbackArguments::CallNamedEnumerator(
   return CallPropertyEnumerator(interceptor);
 }
 
-Handle<JSObject> PropertyCallbackArguments::CallIndexedEnumerator(
-    Handle<InterceptorInfo> interceptor) {
-  DCHECK(!interceptor->is_named());
-  RCS_SCOPE(isolate(), RuntimeCallCounterId::kIndexedEnumeratorCallback);
-  return CallPropertyEnumerator(interceptor);
+Handle<Object> PropertyCallbackArguments::CallNamedQuery(
+    Handle<InterceptorInfo> interceptor, Handle<Name> name) {
+  DCHECK_NAME_COMPATIBLE(interceptor, name);
+  Isolate* isolate = this->isolate();
+  RCS_SCOPE(isolate, RuntimeCallCounterId::kNamedQueryCallback);
+  Handle<Object> receiver_check_unsupported;
+  GenericNamedPropertyQueryCallback f =
+      ToCData<GenericNamedPropertyQueryCallback>(interceptor->query());
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Integer, interceptor);
+  f(v8::Utils::ToLocal(name), callback_info);
+  return GetReturnValue<Object>(isolate);
 }
 
 Handle<Object> PropertyCallbackArguments::CallNamedGetter(
     Handle<InterceptorInfo> interceptor, Handle<Name> name) {
   DCHECK_NAME_COMPATIBLE(interceptor, name);
-  RCS_SCOPE(isolate(), RuntimeCallCounterId::kNamedGetterCallback);
+  Isolate* isolate = this->isolate();
+  RCS_SCOPE(isolate, RuntimeCallCounterId::kNamedGetterCallback);
   GenericNamedPropertyGetterCallback f =
       ToCData<GenericNamedPropertyGetterCallback>(interceptor->getter());
-  return BasicCallNamedGetterCallback(f, name, interceptor);
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Value, interceptor);
+  f(v8::Utils::ToLocal(name), callback_info);
+  return GetReturnValue<Object>(isolate);
 }
 
 Handle<Object> PropertyCallbackArguments::CallNamedDescriptor(
     Handle<InterceptorInfo> interceptor, Handle<Name> name) {
   DCHECK_NAME_COMPATIBLE(interceptor, name);
-  RCS_SCOPE(isolate(), RuntimeCallCounterId::kNamedDescriptorCallback);
+  Isolate* isolate = this->isolate();
+  RCS_SCOPE(isolate, RuntimeCallCounterId::kNamedDescriptorCallback);
   GenericNamedPropertyDescriptorCallback f =
       ToCData<GenericNamedPropertyDescriptorCallback>(
           interceptor->descriptor());
-  return BasicCallNamedGetterCallback(f, name, interceptor);
-}
-
-Handle<Object> PropertyCallbackArguments::BasicCallNamedGetterCallback(
-    GenericNamedPropertyGetterCallback f, Handle<Name> name,
-    Handle<Object> info, Handle<Object> receiver) {
-  DCHECK(!name->IsPrivate());
-  Isolate* isolate = this->isolate();
-  PREPARE_CALLBACK_INFO(isolate, f, Handle<Object>, v8::Value, info, receiver,
-                        Getter);
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Value, interceptor);
   f(v8::Utils::ToLocal(name), callback_info);
   return GetReturnValue<Object>(isolate);
 }
@@ -206,12 +165,12 @@ Handle<Object> PropertyCallbackArguments::CallNamedSetter(
     Handle<InterceptorInfo> interceptor, Handle<Name> name,
     Handle<Object> value) {
   DCHECK_NAME_COMPATIBLE(interceptor, name);
-  GenericNamedPropertySetterCallback f =
-      ToCData<GenericNamedPropertySetterCallback>(interceptor->setter());
   Isolate* isolate = this->isolate();
   RCS_SCOPE(isolate, RuntimeCallCounterId::kNamedSetterCallback);
-  PREPARE_CALLBACK_INFO_FAIL_SIDE_EFFECT_CHECK(isolate, f, Handle<Object>,
-                                               v8::Value);
+  GenericNamedPropertySetterCallback f =
+      ToCData<GenericNamedPropertySetterCallback>(interceptor->setter());
+  Handle<InterceptorInfo> has_side_effects;
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Value, has_side_effects);
   f(v8::Utils::ToLocal(name), v8::Utils::ToLocal(value), callback_info);
   return GetReturnValue<Object>(isolate);
 }
@@ -224,12 +183,71 @@ Handle<Object> PropertyCallbackArguments::CallNamedDefiner(
   RCS_SCOPE(isolate, RuntimeCallCounterId::kNamedDefinerCallback);
   GenericNamedPropertyDefinerCallback f =
       ToCData<GenericNamedPropertyDefinerCallback>(interceptor->definer());
-  PREPARE_CALLBACK_INFO_FAIL_SIDE_EFFECT_CHECK(isolate, f, Handle<Object>,
-                                               v8::Value);
+  Handle<InterceptorInfo> has_side_effects;
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Value, has_side_effects);
   f(v8::Utils::ToLocal(name), desc, callback_info);
   return GetReturnValue<Object>(isolate);
 }
 
+Handle<Object> PropertyCallbackArguments::CallNamedDeleter(
+    Handle<InterceptorInfo> interceptor, Handle<Name> name) {
+  DCHECK_NAME_COMPATIBLE(interceptor, name);
+  Isolate* isolate = this->isolate();
+  RCS_SCOPE(isolate, RuntimeCallCounterId::kNamedDeleterCallback);
+  GenericNamedPropertyDeleterCallback f =
+      ToCData<GenericNamedPropertyDeleterCallback>(interceptor->deleter());
+  Handle<InterceptorInfo> has_side_effects;
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Boolean, has_side_effects);
+  f(v8::Utils::ToLocal(name), callback_info);
+  return GetReturnValue<Object>(isolate);
+}
+
+// -------------------------------------------------------------------------
+// Indexed Interceptor callbacks.
+
+Handle<JSObject> PropertyCallbackArguments::CallIndexedEnumerator(
+    Handle<InterceptorInfo> interceptor) {
+  DCHECK(!interceptor->is_named());
+  RCS_SCOPE(isolate(), RuntimeCallCounterId::kIndexedEnumeratorCallback);
+  return CallPropertyEnumerator(interceptor);
+}
+
+Handle<Object> PropertyCallbackArguments::CallIndexedQuery(
+    Handle<InterceptorInfo> interceptor, uint32_t index) {
+  DCHECK(!interceptor->is_named());
+  Isolate* isolate = this->isolate();
+  RCS_SCOPE(isolate, RuntimeCallCounterId::kIndexedQueryCallback);
+  IndexedPropertyQueryCallback f =
+      ToCData<IndexedPropertyQueryCallback>(interceptor->query());
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Integer, interceptor);
+  f(index, callback_info);
+  return GetReturnValue<Object>(isolate);
+}
+
+Handle<Object> PropertyCallbackArguments::CallIndexedGetter(
+    Handle<InterceptorInfo> interceptor, uint32_t index) {
+  DCHECK(!interceptor->is_named());
+  RCS_SCOPE(isolate(), RuntimeCallCounterId::kNamedGetterCallback);
+  IndexedPropertyGetterCallback f =
+      ToCData<IndexedPropertyGetterCallback>(interceptor->getter());
+  Isolate* isolate = this->isolate();
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Value, interceptor);
+  f(index, callback_info);
+  return GetReturnValue<Object>(isolate);
+}
+
+Handle<Object> PropertyCallbackArguments::CallIndexedDescriptor(
+    Handle<InterceptorInfo> interceptor, uint32_t index) {
+  DCHECK(!interceptor->is_named());
+  Isolate* isolate = this->isolate();
+  RCS_SCOPE(isolate, RuntimeCallCounterId::kIndexedDescriptorCallback);
+  IndexedPropertyDescriptorCallback f =
+      ToCData<IndexedPropertyDescriptorCallback>(interceptor->descriptor());
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Value, interceptor);
+  f(index, callback_info);
+  return GetReturnValue<Object>(isolate);
+}
+
 Handle<Object> PropertyCallbackArguments::CallIndexedSetter(
     Handle<InterceptorInfo> interceptor, uint32_t index, Handle<Object> value) {
   DCHECK(!interceptor->is_named());
@@ -237,8 +255,8 @@ Handle<Object> PropertyCallbackArguments::CallIndexedSetter(
   RCS_SCOPE(isolate, RuntimeCallCounterId::kIndexedSetterCallback);
   IndexedPropertySetterCallback f =
       ToCData<IndexedPropertySetterCallback>(interceptor->setter());
-  PREPARE_CALLBACK_INFO_FAIL_SIDE_EFFECT_CHECK(isolate, f, Handle<Object>,
-                                               v8::Value);
+  Handle<InterceptorInfo> has_side_effects;
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Value, has_side_effects);
   f(index, v8::Utils::ToLocal(value), callback_info);
   return GetReturnValue<Object>(isolate);
 }
@@ -251,36 +269,20 @@ Handle<Object> PropertyCallbackArguments::CallIndexedDefiner(
   RCS_SCOPE(isolate, RuntimeCallCounterId::kIndexedDefinerCallback);
   IndexedPropertyDefinerCallback f =
       ToCData<IndexedPropertyDefinerCallback>(interceptor->definer());
-  PREPARE_CALLBACK_INFO_FAIL_SIDE_EFFECT_CHECK(isolate, f, Handle<Object>,
-                                               v8::Value);
+  Handle<InterceptorInfo> has_side_effects;
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Value, has_side_effects);
   f(index, desc, callback_info);
   return GetReturnValue<Object>(isolate);
 }
 
-Handle<Object> PropertyCallbackArguments::CallIndexedGetter(
+Handle<Object> PropertyCallbackArguments::CallIndexedDeleter(
     Handle<InterceptorInfo> interceptor, uint32_t index) {
   DCHECK(!interceptor->is_named());
-  RCS_SCOPE(isolate(), RuntimeCallCounterId::kNamedGetterCallback);
-  IndexedPropertyGetterCallback f =
-      ToCData<IndexedPropertyGetterCallback>(interceptor->getter());
-  return BasicCallIndexedGetterCallback(f, index, interceptor);
-}
-
-Handle<Object> PropertyCallbackArguments::CallIndexedDescriptor(
-    Handle<InterceptorInfo> interceptor, uint32_t index) {
-  DCHECK(!interceptor->is_named());
-  RCS_SCOPE(isolate(), RuntimeCallCounterId::kIndexedDescriptorCallback);
-  IndexedPropertyDescriptorCallback f =
-      ToCData<IndexedPropertyDescriptorCallback>(interceptor->descriptor());
-  return BasicCallIndexedGetterCallback(f, index, interceptor);
-}
-
-Handle<Object> PropertyCallbackArguments::BasicCallIndexedGetterCallback(
-    IndexedPropertyGetterCallback f, uint32_t index, Handle<Object> info) {
   Isolate* isolate = this->isolate();
-  Handle<Object> receiver_check_unsupported;
-  PREPARE_CALLBACK_INFO(isolate, f, Handle<Object>, v8::Value, info,
-                        receiver_check_unsupported, Getter);
+  RCS_SCOPE(isolate, RuntimeCallCounterId::kIndexedDeleterCallback);
+  IndexedPropertyDeleterCallback f =
+      ToCData<IndexedPropertyDeleterCallback>(interceptor->deleter());
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Boolean, interceptor);
   f(index, callback_info);
   return GetReturnValue<Object>(isolate);
 }
@@ -292,9 +294,7 @@ Handle<JSObject> PropertyCallbackArguments::CallPropertyEnumerator(
       v8::ToCData<IndexedPropertyEnumeratorCallback>(interceptor->enumerator());
   // TODO(cbruni): assert same type for indexed and named callback.
   Isolate* isolate = this->isolate();
-  Handle<Object> receiver_check_unsupported;
-  PREPARE_CALLBACK_INFO(isolate, f, Handle<JSObject>, v8::Array, interceptor,
-                        receiver_check_unsupported, NotAccessor);
+  PREPARE_CALLBACK_INFO_INTERCEPTOR(isolate, f, v8::Array, interceptor);
   f(callback_info);
   return GetReturnValue<JSObject>(isolate);
 }
@@ -311,9 +311,11 @@ Handle<Object> PropertyCallbackArguments::CallAccessorGetter(
   AcceptSideEffects();
 
   AccessorNameGetterCallback f =
-      reinterpret_cast<AccessorNameGetterCallback>(info->getter());
-  return BasicCallNamedGetterCallback(f, name, info,
-                                      handle(receiver(), isolate));
+      reinterpret_cast<AccessorNameGetterCallback>(info->getter(isolate));
+  PREPARE_CALLBACK_INFO_ACCESSOR(isolate, f, v8::Value, info,
+                                 handle(receiver(), isolate), ACCESSOR_GETTER);
+  f(v8::Utils::ToLocal(name), callback_info);
+  return GetReturnValue<Object>(isolate);
 }
 
 Handle<Object> PropertyCallbackArguments::CallAccessorSetter(
@@ -325,16 +327,16 @@ Handle<Object> PropertyCallbackArguments::CallAccessorSetter(
   // the callback is allowed to have side effects.
   AcceptSideEffects();
 
-  AccessorNameSetterCallback f =
-      reinterpret_cast<AccessorNameSetterCallback>(accessor_info->setter());
-  PREPARE_CALLBACK_INFO(isolate, f, Handle<Object>, void, accessor_info,
-                        handle(receiver(), isolate), Setter);
+  AccessorNameSetterCallback f = reinterpret_cast<AccessorNameSetterCallback>(
+      accessor_info->setter(isolate));
+  PREPARE_CALLBACK_INFO_ACCESSOR(isolate, f, void, accessor_info,
+                                 handle(receiver(), isolate), ACCESSOR_SETTER);
   f(v8::Utils::ToLocal(name), v8::Utils::ToLocal(value), callback_info);
   return GetReturnValue<Object>(isolate);
 }
 
-#undef PREPARE_CALLBACK_INFO
-#undef PREPARE_CALLBACK_INFO_FAIL_SIDE_EFFECT_CHECK
+#undef PREPARE_CALLBACK_INFO_ACCESSOR
+#undef PREPARE_CALLBACK_INFO_INTERCEPTOR
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/api/api-arguments.cc b/deps/v8/src/api/api-arguments.cc
index 452588b394f087..08511a0ac4a1d7 100644
--- a/deps/v8/src/api/api-arguments.cc
+++ b/deps/v8/src/api/api-arguments.cc
@@ -10,8 +10,8 @@ namespace v8 {
 namespace internal {
 
 PropertyCallbackArguments::PropertyCallbackArguments(
-    Isolate* isolate, Object data, Object self, JSObject holder,
-    Maybe<ShouldThrow> should_throw)
+    Isolate* isolate, Tagged<Object> data, Tagged<Object> self,
+    Tagged<JSObject> holder, Maybe<ShouldThrow> should_throw)
     : Super(isolate)
 #ifdef DEBUG
       ,
@@ -27,31 +27,33 @@ PropertyCallbackArguments::PropertyCallbackArguments(
     value = should_throw.FromJust();
   }
   slot_at(T::kShouldThrowOnErrorIndex).store(Smi::FromInt(value));
-
   // Here the hole is set as default value.
   // It cannot escape into js as it's removed in Call below.
-  HeapObject the_hole = ReadOnlyRoots(isolate).the_hole_value();
-  slot_at(T::kReturnValueDefaultValueIndex).store(the_hole);
-  slot_at(T::kReturnValueIndex).store(the_hole);
-  DCHECK((*slot_at(T::kHolderIndex)).IsHeapObject());
-  DCHECK((*slot_at(T::kIsolateIndex)).IsSmi());
+  Tagged<HeapObject> the_hole_value = ReadOnlyRoots(isolate).the_hole_value();
+  slot_at(T::kReturnValueIndex).store(the_hole_value);
+  slot_at(T::kUnusedIndex).store(Smi::zero());
+  DCHECK(IsHeapObject(*slot_at(T::kHolderIndex)));
+  DCHECK(IsSmi(*slot_at(T::kIsolateIndex)));
 }
 
 FunctionCallbackArguments::FunctionCallbackArguments(
-    internal::Isolate* isolate, internal::Object data, internal::Object holder,
-    internal::HeapObject new_target, internal::Address* argv, int argc)
+    internal::Isolate* isolate, internal::Tagged<internal::Object> data,
+    internal::Tagged<internal::Object> holder,
+    internal::Tagged<internal::HeapObject> new_target, internal::Address* argv,
+    int argc)
     : Super(isolate), argv_(argv), argc_(argc) {
   slot_at(T::kDataIndex).store(data);
   slot_at(T::kHolderIndex).store(holder);
   slot_at(T::kNewTargetIndex).store(new_target);
   slot_at(T::kIsolateIndex).store(Object(reinterpret_cast<Address>(isolate)));
-  // Here the hole is set as default value.
-  // It cannot escape into js as it's remove in Call below.
-  HeapObject the_hole = ReadOnlyRoots(isolate).the_hole_value();
-  slot_at(T::kReturnValueDefaultValueIndex).store(the_hole);
-  slot_at(T::kReturnValueIndex).store(the_hole);
-  DCHECK((*slot_at(T::kHolderIndex)).IsHeapObject());
-  DCHECK((*slot_at(T::kIsolateIndex)).IsSmi());
+  // Here the hole is set as default value. It's converted to and not
+  // directly exposed to js.
+  // TODO(cbruni): Remove and/or use custom sentinel value.
+  Tagged<HeapObject> the_hole_value = ReadOnlyRoots(isolate).the_hole_value();
+  slot_at(T::kReturnValueIndex).store(the_hole_value);
+  slot_at(T::kUnusedIndex).store(Smi::zero());
+  DCHECK(IsHeapObject(*slot_at(T::kHolderIndex)));
+  DCHECK(IsSmi(*slot_at(T::kIsolateIndex)));
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/api/api-arguments.h b/deps/v8/src/api/api-arguments.h
index 9caf5decb0b0ae..18f28ce7bdf8ae 100644
--- a/deps/v8/src/api/api-arguments.h
+++ b/deps/v8/src/api/api-arguments.h
@@ -74,15 +74,15 @@ class PropertyCallbackArguments final
   using Super = CustomArguments<T>;
   static constexpr int kArgsLength = T::kArgsLength;
   static constexpr int kThisIndex = T::kThisIndex;
-  static constexpr int kHolderIndex = T::kHolderIndex;
   static constexpr int kDataIndex = T::kDataIndex;
-  static constexpr int kReturnValueDefaultValueIndex =
-      T::kReturnValueDefaultValueIndex;
+  static constexpr int kUnusedIndex = T::kUnusedIndex;
+  static constexpr int kHolderIndex = T::kHolderIndex;
   static constexpr int kIsolateIndex = T::kIsolateIndex;
   static constexpr int kShouldThrowOnErrorIndex = T::kShouldThrowOnErrorIndex;
 
-  PropertyCallbackArguments(Isolate* isolate, Object data, Object self,
-                            JSObject holder, Maybe<ShouldThrow> should_throw);
+  PropertyCallbackArguments(Isolate* isolate, Tagged<Object> data,
+                            Tagged<Object> self, Tagged<JSObject> holder,
+                            Maybe<ShouldThrow> should_throw);
   inline ~PropertyCallbackArguments();
 
   // Don't copy PropertyCallbackArguments, because they would both have the
@@ -158,14 +158,8 @@ class PropertyCallbackArguments final
   inline Handle<JSObject> CallPropertyEnumerator(
       Handle<InterceptorInfo> interceptor);
 
-  inline Handle<Object> BasicCallIndexedGetterCallback(
-      IndexedPropertyGetterCallback f, uint32_t index, Handle<Object> info);
-  inline Handle<Object> BasicCallNamedGetterCallback(
-      GenericNamedPropertyGetterCallback f, Handle<Name> name,
-      Handle<Object> info, Handle<Object> receiver = Handle<Object>());
-
-  inline JSObject holder() const;
-  inline Object receiver() const;
+  inline Tagged<JSObject> holder() const;
+  inline Tagged<Object> receiver() const;
 
 #ifdef DEBUG
   // This stores current value of Isolate::javascript_execution_counter().
@@ -184,20 +178,28 @@ class FunctionCallbackArguments
   static constexpr int kArgsLengthWithReceiver = T::kArgsLengthWithReceiver;
 
   static constexpr int kHolderIndex = T::kHolderIndex;
-  static constexpr int kDataIndex = T::kDataIndex;
-  static constexpr int kReturnValueDefaultValueIndex =
-      T::kReturnValueDefaultValueIndex;
   static constexpr int kIsolateIndex = T::kIsolateIndex;
+  static constexpr int kUnusedIndex = T::kUnusedIndex;
+  static constexpr int kDataIndex = T::kDataIndex;
   static constexpr int kNewTargetIndex = T::kNewTargetIndex;
 
   static_assert(T::kThisValuesIndex == BuiltinArguments::kReceiverArgsOffset);
+
+  static constexpr int kSize = T::kSize;
+  static constexpr int kImplicitArgsOffset = T::kImplicitArgsOffset;
+  static constexpr int kValuesOffset = T::kValuesOffset;
+  static constexpr int kLengthOffset = T::kLengthOffset;
+
   // Make sure all FunctionCallbackInfo constants are in sync.
+  static_assert(T::kSize == sizeof(T));
   static_assert(T::kImplicitArgsOffset == offsetof(T, implicit_args_));
   static_assert(T::kValuesOffset == offsetof(T, values_));
   static_assert(T::kLengthOffset == offsetof(T, length_));
 
-  FunctionCallbackArguments(Isolate* isolate, Object data, Object holder,
-                            HeapObject new_target, Address* argv, int argc);
+  FunctionCallbackArguments(Isolate* isolate, Tagged<Object> data,
+                            Tagged<Object> holder,
+                            Tagged<HeapObject> new_target, Address* argv,
+                            int argc);
 
   /*
    * The following Call function wraps the calling of all callbacks to handle
@@ -207,10 +209,10 @@ class FunctionCallbackArguments
    * and used if it's been set to anything inside the callback.
    * New style callbacks always use the return value.
    */
-  inline Handle<Object> Call(CallHandlerInfo handler);
+  inline Handle<Object> Call(Tagged<CallHandlerInfo> handler);
 
  private:
-  inline JSReceiver holder() const;
+  inline Tagged<JSReceiver> holder() const;
 
   internal::Address* argv_;
   int const argc_;
diff --git a/deps/v8/src/api/api-inl.h b/deps/v8/src/api/api-inl.h
index 73be24cbe0718e..154ac355a1aae3 100644
--- a/deps/v8/src/api/api-inl.h
+++ b/deps/v8/src/api/api-inl.h
@@ -19,17 +19,18 @@
 namespace v8 {
 
 template <typename T>
-inline T ToCData(v8::internal::Object obj) {
+inline T ToCData(v8::internal::Tagged<v8::internal::Object> obj) {
   static_assert(sizeof(T) == sizeof(v8::internal::Address));
   if (obj == v8::internal::Smi::zero()) return nullptr;
   return reinterpret_cast<T>(
-      v8::internal::Foreign::cast(obj).foreign_address());
+      v8::internal::Foreign::cast(obj)->foreign_address());
 }
 
 template <>
-inline v8::internal::Address ToCData(v8::internal::Object obj) {
+inline v8::internal::Address ToCData(
+    v8::internal::Tagged<v8::internal::Object> obj) {
   if (obj == v8::internal::Smi::zero()) return v8::internal::kNullAddress;
-  return v8::internal::Foreign::cast(obj).foreign_address();
+  return v8::internal::Foreign::cast(obj)->foreign_address();
 }
 
 template <typename T>
@@ -52,11 +53,24 @@ inline v8::internal::Handle<v8::internal::Object> FromCData(
 
 template <class From, class To>
 inline Local<To> Utils::Convert(v8::internal::Handle<From> obj) {
-  DCHECK(obj.is_null() || (obj->IsSmi() || !obj->IsTheHole()));
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+  DCHECK(obj.is_null() || (IsSmi(*obj) || !IsTheHole(*obj)));
+#ifdef V8_ENABLE_DIRECT_LOCAL
   if (obj.is_null()) return Local<To>();
 #endif
-  return Local<To>(internal::ValueHelper::SlotAsValue<To>(obj.location()));
+  return Local<To>::FromSlot(obj.location());
+}
+
+template <class From, class To>
+inline Local<To> Utils::Convert(v8::internal::DirectHandle<From> obj,
+                                v8::internal::Isolate* isolate) {
+#if defined(V8_ENABLE_DIRECT_LOCAL)
+  DCHECK(obj.is_null() || (IsSmi(*obj) || !IsTheHole(*obj)));
+  return Local<To>::FromAddress(obj.address());
+#elif defined(V8_ENABLE_DIRECT_HANDLE)
+  return Convert<From, To>(v8::internal::Handle<From>(*obj, isolate));
+#else
+  return Convert<From, To>(obj);
+#endif
 }
 
 // Implementations of ToLocal
@@ -64,15 +78,28 @@ inline Local<To> Utils::Convert(v8::internal::Handle<From> obj) {
 #define MAKE_TO_LOCAL(Name, From, To)                                       \
   Local<v8::To> Utils::Name(v8::internal::Handle<v8::internal::From> obj) { \
     return Convert<v8::internal::From, v8::To>(obj);                        \
+  }                                                                         \
+                                                                            \
+  Local<v8::To> Utils::Name(                                                \
+      v8::internal::DirectHandle<v8::internal::From> obj,                   \
+      i::Isolate* isolate) {                                                \
+    return Convert<v8::internal::From, v8::To>(obj, isolate);               \
   }
 
 TO_LOCAL_LIST(MAKE_TO_LOCAL)
 
-#define MAKE_TO_LOCAL_TYPED_ARRAY(Type, typeName, TYPE, ctype)        \
-  Local<v8::Type##Array> Utils::ToLocal##Type##Array(                 \
-      v8::internal::Handle<v8::internal::JSTypedArray> obj) {         \
-    DCHECK(obj->type() == v8::internal::kExternal##Type##Array);      \
-    return Convert<v8::internal::JSTypedArray, v8::Type##Array>(obj); \
+#define MAKE_TO_LOCAL_TYPED_ARRAY(Type, typeName, TYPE, ctype)                 \
+  Local<v8::Type##Array> Utils::ToLocal##Type##Array(                          \
+      v8::internal::Handle<v8::internal::JSTypedArray> obj) {                  \
+    DCHECK(obj->type() == v8::internal::kExternal##Type##Array);               \
+    return Convert<v8::internal::JSTypedArray, v8::Type##Array>(obj);          \
+  }                                                                            \
+                                                                               \
+  Local<v8::Type##Array> Utils::ToLocal##Type##Array(                          \
+      v8::internal::DirectHandle<v8::internal::JSTypedArray> obj,              \
+      v8::internal::Isolate* isolate) {                                        \
+    DCHECK(obj->type() == v8::internal::kExternal##Type##Array);               \
+    return Convert<v8::internal::JSTypedArray, v8::Type##Array>(obj, isolate); \
   }
 
 TYPED_ARRAYS(MAKE_TO_LOCAL_TYPED_ARRAY)
@@ -83,42 +110,63 @@ TYPED_ARRAYS(MAKE_TO_LOCAL_TYPED_ARRAY)
 
 // Implementations of OpenHandle
 
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
-
-#define MAKE_OPEN_HANDLE(From, To)                                            \
-  v8::internal::Handle<v8::internal::To> Utils::OpenHandle(                   \
-      const v8::From* that, bool allow_empty_handle) {                        \
-    DCHECK(allow_empty_handle ||                                              \
-           that != v8::internal::ValueHelper::EmptyValue<v8::From>());        \
-    DCHECK(                                                                   \
-        that == v8::internal::ValueHelper::EmptyValue<v8::From>() ||          \
-        v8::internal::Object(v8::internal::ValueHelper::ValueAsAddress(that)) \
-            .Is##To());                                                       \
-    if (that == v8::internal::ValueHelper::EmptyValue<v8::From>()) {          \
-      return v8::internal::Handle<v8::internal::To>::null();                  \
-    }                                                                         \
-    return v8::internal::Handle<v8::internal::To>(                            \
-        v8::HandleScope::CreateHandleForCurrentIsolate(                       \
-            reinterpret_cast<v8::internal::Address>(that)));                  \
+#ifdef V8_ENABLE_DIRECT_LOCAL
+
+#define MAKE_OPEN_HANDLE(From, To)                                           \
+  v8::internal::Handle<v8::internal::To> Utils::OpenHandle(                  \
+      const v8::From* that, bool allow_empty_handle) {                       \
+    DCHECK(allow_empty_handle || !v8::internal::ValueHelper::IsEmpty(that)); \
+    DCHECK(v8::internal::ValueHelper::IsEmpty(that) ||                       \
+           Is##To(v8::internal::Object(                                      \
+               v8::internal::ValueHelper::ValueAsAddress(that))));           \
+    if (v8::internal::ValueHelper::IsEmpty(that)) {                          \
+      return v8::internal::Handle<v8::internal::To>::null();                 \
+    }                                                                        \
+    return v8::internal::Handle<v8::internal::To>(                           \
+        v8::HandleScope::CreateHandleForCurrentIsolate(                      \
+            v8::internal::ValueHelper::ValueAsAddress(that)));               \
+  }                                                                          \
+                                                                             \
+  v8::internal::DirectHandle<v8::internal::To> Utils::OpenDirectHandle(      \
+      const v8::From* that, bool allow_empty_handle) {                       \
+    DCHECK(allow_empty_handle || !v8::internal::ValueHelper::IsEmpty(that)); \
+    DCHECK(v8::internal::ValueHelper::IsEmpty(that) ||                       \
+           Is##To(v8::internal::Object(                                      \
+               v8::internal::ValueHelper::ValueAsAddress(that))));           \
+    return v8::internal::DirectHandle<v8::internal::To>(                     \
+        v8::internal::ValueHelper::ValueAsAddress(that));                    \
+  }                                                                          \
+                                                                             \
+  v8::internal::IndirectHandle<v8::internal::To> Utils::OpenIndirectHandle(  \
+      const v8::From* that, bool allow_empty_handle) {                       \
+    return Utils::OpenHandle(that, allow_empty_handle);                      \
   }
 
-#else
-
-#define MAKE_OPEN_HANDLE(From, To)                                            \
-  v8::internal::Handle<v8::internal::To> Utils::OpenHandle(                   \
-      const v8::From* that, bool allow_empty_handle) {                        \
-    DCHECK(allow_empty_handle ||                                              \
-           that != v8::internal::ValueHelper::EmptyValue<v8::From>());        \
-    DCHECK(                                                                   \
-        that == v8::internal::ValueHelper::EmptyValue<v8::From>() ||          \
-        v8::internal::Object(v8::internal::ValueHelper::ValueAsAddress(that)) \
-            .Is##To());                                                       \
-    return v8::internal::Handle<v8::internal::To>(                            \
-        reinterpret_cast<v8::internal::Address*>(                             \
-            const_cast<v8::From*>(that)));                                    \
+#else  // !V8_ENABLE_DIRECT_LOCAL
+
+#define MAKE_OPEN_HANDLE(From, To)                                           \
+  v8::internal::Handle<v8::internal::To> Utils::OpenHandle(                  \
+      const v8::From* that, bool allow_empty_handle) {                       \
+    DCHECK(allow_empty_handle || !v8::internal::ValueHelper::IsEmpty(that)); \
+    DCHECK(v8::internal::ValueHelper::IsEmpty(that) ||                       \
+           Is##To(v8::internal::Object(                                      \
+               v8::internal::ValueHelper::ValueAsAddress(that))));           \
+    return v8::internal::Handle<v8::internal::To>(                           \
+        reinterpret_cast<v8::internal::Address*>(                            \
+            const_cast<v8::From*>(that)));                                   \
+  }                                                                          \
+                                                                             \
+  v8::internal::DirectHandle<v8::internal::To> Utils::OpenDirectHandle(      \
+      const v8::From* that, bool allow_empty_handle) {                       \
+    return Utils::OpenHandle(that, allow_empty_handle);                      \
+  }                                                                          \
+                                                                             \
+  v8::internal::IndirectHandle<v8::internal::To> Utils::OpenIndirectHandle(  \
+      const v8::From* that, bool allow_empty_handle) {                       \
+    return Utils::OpenHandle(that, allow_empty_handle);                      \
   }
 
-#endif
+#endif  // V8_ENABLE_DIRECT_LOCAL
 
 OPEN_HANDLE_LIST(MAKE_OPEN_HANDLE)
 
@@ -144,10 +192,10 @@ class V8_NODISCARD CallDepthScope {
     isolate_->set_next_v8_call_is_safe_for_termination(false);
     if (!context.IsEmpty()) {
       i::DisallowGarbageCollection no_gc;
-      i::Context env = *Utils::OpenHandle(*context);
+      i::Tagged<i::Context> env = *Utils::OpenHandle(*context);
       i::HandleScopeImplementer* impl = isolate->handle_scope_implementer();
       if (isolate->context().is_null() ||
-          isolate->context().native_context() != env.native_context()) {
+          isolate->context()->native_context() != env->native_context()) {
         impl->SaveContext(isolate->context());
         isolate->set_context(env);
         did_enter_context_ = true;
@@ -164,7 +212,7 @@ class V8_NODISCARD CallDepthScope {
       }
 
       i::Handle<i::Context> env = Utils::OpenHandle(*context_);
-      microtask_queue = env->native_context().microtask_queue();
+      microtask_queue = env->native_context()->microtask_queue();
     }
     if (!escaped_) isolate_->thread_local_top()->DecrementCallDepth(this);
     if (do_callback) isolate_->FireCallCompletedCallback(microtask_queue);
@@ -204,7 +252,7 @@ class V8_NODISCARD CallDepthScope {
         microtask_queue->microtasks_policy() == MicrotasksPolicy::kAuto &&
         !isolate_->is_execution_terminating();
     return !did_perform_microtask_checkpoint ||
-           isolate_->heap()->weak_refs_keep_during_job().IsUndefined(isolate_);
+           IsUndefined(isolate_->heap()->weak_refs_keep_during_job(), isolate_);
   }
 #endif
 
@@ -229,9 +277,9 @@ class V8_NODISCARD InternalEscapableScope : public EscapableHandleScope {
 
 template <typename T>
 void CopySmiElementsToTypedBuffer(T* dst, uint32_t length,
-                                  i::FixedArray elements) {
+                                  i::Tagged<i::FixedArray> elements) {
   for (uint32_t i = 0; i < length; ++i) {
-    double value = elements.get(static_cast<int>(i)).Number();
+    double value = i::Object::Number(elements->get(static_cast<int>(i)));
     // TODO(mslekova): Avoid converting back-and-forth when possible, e.g
     // avoid int->double->int conversions to boost performance.
     dst[i] = i::ConvertDouble<T>(value);
@@ -240,9 +288,9 @@ void CopySmiElementsToTypedBuffer(T* dst, uint32_t length,
 
 template <typename T>
 void CopyDoubleElementsToTypedBuffer(T* dst, uint32_t length,
-                                     i::FixedDoubleArray elements) {
+                                     i::Tagged<i::FixedDoubleArray> elements) {
   for (uint32_t i = 0; i < length; ++i) {
-    double value = elements.get_scalar(static_cast<int>(i));
+    double value = elements->get_scalar(static_cast<int>(i));
     // TODO(mslekova): There are certain cases, e.g. double->double, in which
     // we could do a memcpy directly.
     dst[i] = i::ConvertDouble<T>(value);
@@ -264,14 +312,14 @@ bool CopyAndConvertArrayToCppBuffer(Local<Array> src, T* dst,
   }
 
   i::DisallowGarbageCollection no_gc;
-  i::JSArray obj = *reinterpret_cast<i::JSArray*>(*src);
-  if (obj.IterationHasObservableEffects()) {
+  i::Tagged<i::JSArray> obj = *reinterpret_cast<i::JSArray*>(*src);
+  if (i::Object::IterationHasObservableEffects(obj)) {
     // The array has a custom iterator.
     return false;
   }
 
-  i::FixedArrayBase elements = obj.elements();
-  switch (obj.GetElementsKind()) {
+  i::Tagged<i::FixedArrayBase> elements = obj->elements();
+  switch (obj->GetElementsKind()) {
     case i::PACKED_SMI_ELEMENTS:
       CopySmiElementsToTypedBuffer(dst, length, i::FixedArray::cast(elements));
       return true;
@@ -302,39 +350,38 @@ inline bool V8_EXPORT TryToCopyAndConvertArrayToCppBuffer(Local<Array> src,
 
 namespace internal {
 
-void HandleScopeImplementer::EnterContext(Context context) {
+void HandleScopeImplementer::EnterContext(Tagged<NativeContext> context) {
   DCHECK_EQ(entered_contexts_.capacity(), is_microtask_context_.capacity());
   DCHECK_EQ(entered_contexts_.size(), is_microtask_context_.size());
-  DCHECK(context.IsNativeContext());
   entered_contexts_.push_back(context);
   is_microtask_context_.push_back(0);
 }
 
-void HandleScopeImplementer::EnterMicrotaskContext(Context context) {
+void HandleScopeImplementer::EnterMicrotaskContext(
+    Tagged<NativeContext> context) {
   DCHECK_EQ(entered_contexts_.capacity(), is_microtask_context_.capacity());
   DCHECK_EQ(entered_contexts_.size(), is_microtask_context_.size());
-  DCHECK(context.IsNativeContext());
   entered_contexts_.push_back(context);
   is_microtask_context_.push_back(1);
 }
 
-Handle<Context> HandleScopeImplementer::LastEnteredContext() {
+Handle<NativeContext> HandleScopeImplementer::LastEnteredContext() {
   DCHECK_EQ(entered_contexts_.capacity(), is_microtask_context_.capacity());
   DCHECK_EQ(entered_contexts_.size(), is_microtask_context_.size());
 
   for (size_t i = 0; i < entered_contexts_.size(); ++i) {
     size_t j = entered_contexts_.size() - i - 1;
     if (!is_microtask_context_.at(j)) {
-      return Handle<Context>(entered_contexts_.at(j), isolate_);
+      return handle(entered_contexts_.at(j), isolate_);
     }
   }
 
-  return Handle<Context>::null();
+  return {};
 }
 
-Handle<Context> HandleScopeImplementer::LastEnteredOrMicrotaskContext() {
-  if (entered_contexts_.empty()) return Handle<Context>::null();
-  return Handle<Context>(entered_contexts_.back(), isolate_);
+Handle<NativeContext> HandleScopeImplementer::LastEnteredOrMicrotaskContext() {
+  if (entered_contexts_.empty()) return {};
+  return handle(entered_contexts_.back(), isolate_);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/api/api-natives.cc b/deps/v8/src/api/api-natives.cc
index 05a883f2d560e3..3015c2f80fbc0e 100644
--- a/deps/v8/src/api/api-natives.cc
+++ b/deps/v8/src/api/api-natives.cc
@@ -4,6 +4,7 @@
 
 #include "src/api/api-natives.h"
 
+#include "src/api/api-inl.h"
 #include "src/common/message-template.h"
 #include "src/execution/isolate-inl.h"
 #include "src/heap/heap-inl.h"
@@ -55,10 +56,10 @@ MaybeHandle<JSFunction> InstantiateFunction(
 MaybeHandle<Object> Instantiate(
     Isolate* isolate, Handle<Object> data,
     MaybeHandle<Name> maybe_name = MaybeHandle<Name>()) {
-  if (data->IsFunctionTemplateInfo()) {
+  if (IsFunctionTemplateInfo(*data)) {
     return InstantiateFunction(
         isolate, Handle<FunctionTemplateInfo>::cast(data), maybe_name);
-  } else if (data->IsObjectTemplateInfo()) {
+  } else if (IsObjectTemplateInfo(*data)) {
     return InstantiateObject(isolate, Handle<ObjectTemplateInfo>::cast(data),
                              Handle<JSReceiver>(), false);
   } else {
@@ -72,12 +73,12 @@ MaybeHandle<Object> DefineAccessorProperty(Isolate* isolate,
                                            Handle<Object> getter,
                                            Handle<Object> setter,
                                            PropertyAttributes attributes) {
-  DCHECK(!getter->IsFunctionTemplateInfo() ||
-         FunctionTemplateInfo::cast(*getter).should_cache());
-  DCHECK(!setter->IsFunctionTemplateInfo() ||
-         FunctionTemplateInfo::cast(*setter).should_cache());
-  if (getter->IsFunctionTemplateInfo() &&
-      FunctionTemplateInfo::cast(*getter).BreakAtEntry()) {
+  DCHECK(!IsFunctionTemplateInfo(*getter) ||
+         FunctionTemplateInfo::cast(*getter)->should_cache());
+  DCHECK(!IsFunctionTemplateInfo(*setter) ||
+         FunctionTemplateInfo::cast(*setter)->should_cache());
+  if (IsFunctionTemplateInfo(*getter) &&
+      FunctionTemplateInfo::cast(*getter)->BreakAtEntry(isolate)) {
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, getter,
         InstantiateFunction(isolate,
@@ -86,8 +87,8 @@ MaybeHandle<Object> DefineAccessorProperty(Isolate* isolate,
     Handle<Code> trampoline = BUILTIN_CODE(isolate, DebugBreakTrampoline);
     Handle<JSFunction>::cast(getter)->set_code(*trampoline);
   }
-  if (setter->IsFunctionTemplateInfo() &&
-      FunctionTemplateInfo::cast(*setter).BreakAtEntry()) {
+  if (IsFunctionTemplateInfo(*setter) &&
+      FunctionTemplateInfo::cast(*setter)->BreakAtEntry(isolate)) {
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, setter,
         InstantiateFunction(isolate,
@@ -96,10 +97,10 @@ MaybeHandle<Object> DefineAccessorProperty(Isolate* isolate,
     Handle<Code> trampoline = BUILTIN_CODE(isolate, DebugBreakTrampoline);
     Handle<JSFunction>::cast(setter)->set_code(*trampoline);
   }
-  RETURN_ON_EXCEPTION(
-      isolate,
-      JSObject::DefineAccessor(object, name, getter, setter, attributes),
-      Object);
+  RETURN_ON_EXCEPTION(isolate,
+                      JSObject::DefineOwnAccessorIgnoreAttributes(
+                          object, name, getter, setter, attributes),
+                      Object);
   return object;
 }
 
@@ -145,7 +146,7 @@ void EnableAccessChecks(Isolate* isolate, Handle<JSObject> object) {
   // Copy map so it won't interfere constructor's initial map.
   Handle<Map> new_map = Map::Copy(isolate, old_map, "EnableAccessChecks");
   new_map->set_is_access_check_needed(true);
-  new_map->set_may_have_interesting_symbols(true);
+  new_map->set_may_have_interesting_properties(true);
   JSObject::MigrateToMap(isolate, object, new_map);
 }
 
@@ -153,7 +154,7 @@ class V8_NODISCARD AccessCheckDisableScope {
  public:
   AccessCheckDisableScope(Isolate* isolate, Handle<JSObject> obj)
       : isolate_(isolate),
-        disabled_(obj->map().is_access_check_needed()),
+        disabled_(obj->map()->is_access_check_needed()),
         obj_(obj) {
     if (disabled_) {
       DisableAccessChecks(isolate_, obj_);
@@ -171,7 +172,7 @@ class V8_NODISCARD AccessCheckDisableScope {
   Handle<JSObject> obj_;
 };
 
-Object GetIntrinsic(Isolate* isolate, v8::Intrinsic intrinsic) {
+Tagged<Object> GetIntrinsic(Isolate* isolate, v8::Intrinsic intrinsic) {
   Handle<Context> native_context = isolate->native_context();
   DCHECK(!native_context.is_null());
   switch (intrinsic) {
@@ -196,9 +197,9 @@ MaybeHandle<JSObject> ConfigureInstance(Isolate* isolate, Handle<JSObject> obj,
   int max_number_of_properties = 0;
   TemplateInfoT info = *data;
   while (!info.is_null()) {
-    Object props = info.property_accessors();
-    if (!props.IsUndefined(isolate)) {
-      max_number_of_properties += TemplateList::cast(props).length();
+    Tagged<Object> props = info.property_accessors();
+    if (!IsUndefined(props, isolate)) {
+      max_number_of_properties += TemplateList::cast(props)->length();
     }
     info = info.GetParent(isolate);
   }
@@ -212,8 +213,8 @@ MaybeHandle<JSObject> ConfigureInstance(Isolate* isolate, Handle<JSObject> obj,
     for (Handle<TemplateInfoT> temp(*data, isolate); !temp->is_null();
          temp = handle(temp->GetParent(isolate), isolate)) {
       // Accumulate accessors.
-      Object maybe_properties = temp->property_accessors();
-      if (!maybe_properties.IsUndefined(isolate)) {
+      Tagged<Object> maybe_properties = temp->property_accessors();
+      if (!IsUndefined(maybe_properties, isolate)) {
         valid_descriptors = AccessorInfo::AppendUnique(
             isolate, handle(maybe_properties, isolate), array,
             valid_descriptors);
@@ -230,8 +231,8 @@ MaybeHandle<JSObject> ConfigureInstance(Isolate* isolate, Handle<JSObject> obj,
     }
   }
 
-  Object maybe_property_list = data->property_list();
-  if (maybe_property_list.IsUndefined(isolate)) return obj;
+  Tagged<Object> maybe_property_list = data->property_list();
+  if (IsUndefined(maybe_property_list, isolate)) return obj;
   Handle<TemplateList> properties(TemplateList::cast(maybe_property_list),
                                   isolate);
   if (properties->length() == 0) return obj;
@@ -239,8 +240,8 @@ MaybeHandle<JSObject> ConfigureInstance(Isolate* isolate, Handle<JSObject> obj,
   int i = 0;
   for (int c = 0; c < data->number_of_properties(); c++) {
     auto name = handle(Name::cast(properties->get(i++)), isolate);
-    Object bit = properties->get(i++);
-    if (bit.IsSmi()) {
+    Tagged<Object> bit = properties->get(i++);
+    if (IsSmi(bit)) {
       PropertyDetails details(Smi::cast(bit));
       PropertyAttributes attributes = details.attributes();
       PropertyKind kind = details.kind();
@@ -296,19 +297,19 @@ MaybeHandle<JSObject> ProbeInstantiationsCache(
   }
 
   if (serial_number < TemplateInfo::kFastTemplateInstantiationsCacheSize) {
-    FixedArray fast_cache =
+    Tagged<FixedArray> fast_cache =
         native_context->fast_template_instantiations_cache();
-    Handle<Object> object{fast_cache.get(serial_number), isolate};
-    if (object->IsTheHole(isolate)) return {};
+    Handle<Object> object{fast_cache->get(serial_number), isolate};
+    if (IsTheHole(*object, isolate)) return {};
     return Handle<JSObject>::cast(object);
   }
   if (caching_mode == CachingMode::kUnlimited ||
       (serial_number < TemplateInfo::kSlowTemplateInstantiationsCacheSize)) {
-    SimpleNumberDictionary slow_cache =
+    Tagged<SimpleNumberDictionary> slow_cache =
         native_context->slow_template_instantiations_cache();
-    InternalIndex entry = slow_cache.FindEntry(isolate, serial_number);
+    InternalIndex entry = slow_cache->FindEntry(isolate, serial_number);
     if (entry.is_found()) {
-      return handle(JSObject::cast(slow_cache.ValueAt(entry)), isolate);
+      return handle(JSObject::cast(slow_cache->ValueAt(entry)), isolate);
     }
   }
   return {};
@@ -360,10 +361,10 @@ void UncacheTemplateInstantiation(Isolate* isolate,
   if (serial_number < 0) return;
 
   if (serial_number < TemplateInfo::kFastTemplateInstantiationsCacheSize) {
-    FixedArray fast_cache =
+    Tagged<FixedArray> fast_cache =
         native_context->fast_template_instantiations_cache();
-    DCHECK(!fast_cache.get(serial_number).IsUndefined(isolate));
-    fast_cache.set_undefined(serial_number);
+    DCHECK(!IsUndefined(fast_cache->get(serial_number), isolate));
+    fast_cache->set_undefined(serial_number);
     data->set_serial_number(TemplateInfo::kUncached);
   } else if (caching_mode == CachingMode::kUnlimited ||
              (serial_number <
@@ -378,16 +379,16 @@ void UncacheTemplateInstantiation(Isolate* isolate,
   }
 }
 
-bool IsSimpleInstantiation(Isolate* isolate, ObjectTemplateInfo info,
-                           JSReceiver new_target) {
+bool IsSimpleInstantiation(Isolate* isolate, Tagged<ObjectTemplateInfo> info,
+                           Tagged<JSReceiver> new_target) {
   DisallowGarbageCollection no_gc;
 
-  if (!new_target.IsJSFunction()) return false;
-  JSFunction fun = JSFunction::cast(new_target);
-  if (fun.shared().function_data(kAcquireLoad) != info.constructor())
+  if (!IsJSFunction(new_target)) return false;
+  Tagged<JSFunction> fun = JSFunction::cast(new_target);
+  if (fun->shared()->function_data(kAcquireLoad) != info->constructor())
     return false;
-  if (info.immutable_proto()) return false;
-  return fun.native_context() == isolate->raw_native_context();
+  if (info->immutable_proto()) return false;
+  return fun->native_context() == isolate->raw_native_context();
 }
 
 MaybeHandle<JSObject> InstantiateObject(Isolate* isolate,
@@ -416,8 +417,8 @@ MaybeHandle<JSObject> InstantiateObject(Isolate* isolate,
   }
 
   if (constructor.is_null()) {
-    Object maybe_constructor_info = info->constructor();
-    if (maybe_constructor_info.IsUndefined(isolate)) {
+    Tagged<Object> maybe_constructor_info = info->constructor();
+    if (IsUndefined(maybe_constructor_info, isolate)) {
       constructor = isolate->object_function();
     } else {
       // Enter a new scope.  Recursion could otherwise create a lot of handles.
@@ -500,10 +501,10 @@ MaybeHandle<JSFunction> InstantiateFunction(
   Handle<Object> prototype;
   if (!data->remove_prototype()) {
     Handle<Object> prototype_templ(data->GetPrototypeTemplate(), isolate);
-    if (prototype_templ->IsUndefined(isolate)) {
+    if (IsUndefined(*prototype_templ, isolate)) {
       Handle<Object> protoype_provider_templ(
           data->GetPrototypeProviderTemplate(), isolate);
-      if (protoype_provider_templ->IsUndefined(isolate)) {
+      if (IsUndefined(*protoype_provider_templ, isolate)) {
         prototype = isolate->factory()->NewJSObject(isolate->object_function());
       } else {
         ASSIGN_RETURN_ON_EXCEPTION(
@@ -519,20 +520,20 @@ MaybeHandle<JSFunction> InstantiateFunction(
           JSFunction);
     }
     Handle<Object> parent(data->GetParentTemplate(), isolate);
-    if (!parent->IsUndefined(isolate)) {
+    if (!IsUndefined(*parent, isolate)) {
       Handle<Object> parent_prototype;
       ASSIGN_RETURN_ON_EXCEPTION(isolate, parent_prototype,
                                  GetInstancePrototype(isolate, parent),
                                  JSFunction);
-      CHECK(parent_prototype->IsHeapObject());
+      CHECK(IsHeapObject(*parent_prototype));
       JSObject::ForceSetPrototype(isolate, Handle<JSObject>::cast(prototype),
                                   Handle<HeapObject>::cast(parent_prototype));
     }
   }
   InstanceType function_type = JS_SPECIAL_API_OBJECT_TYPE;
   if (!data->needs_access_check() &&
-      data->GetNamedPropertyHandler().IsUndefined(isolate) &&
-      data->GetIndexedPropertyHandler().IsUndefined(isolate)) {
+      IsUndefined(data->GetNamedPropertyHandler(), isolate) &&
+      IsUndefined(data->GetIndexedPropertyHandler(), isolate)) {
     function_type = v8_flags.embedder_instance_types && data->HasInstanceType()
                         ? static_cast<InstanceType>(data->InstanceType())
                         : JS_API_OBJECT_TYPE;
@@ -558,9 +559,9 @@ MaybeHandle<JSFunction> InstantiateFunction(
 
 void AddPropertyToPropertyList(Isolate* isolate, Handle<TemplateInfo> templ,
                                int length, Handle<Object>* data) {
-  Object maybe_list = templ->property_list();
+  Tagged<Object> maybe_list = templ->property_list();
   Handle<TemplateList> list;
-  if (maybe_list.IsUndefined(isolate)) {
+  if (IsUndefined(maybe_list, isolate)) {
     list = TemplateList::New(isolate, length);
   } else {
     list = handle(TemplateList::cast(maybe_list), isolate);
@@ -578,6 +579,19 @@ void AddPropertyToPropertyList(Isolate* isolate, Handle<TemplateInfo> templ,
 
 }  // namespace
 
+// static
+i::Handle<i::FunctionTemplateInfo>
+ApiNatives::CreateAccessorFunctionTemplateInfo(
+    i::Isolate* i_isolate, FunctionCallback callback, int length,
+    SideEffectType side_effect_type) {
+  // TODO(v8:5962): move FunctionTemplateNew() from api.cc here.
+  auto isolate = reinterpret_cast<v8::Isolate*>(i_isolate);
+  Local<FunctionTemplate> func_template = FunctionTemplate::New(
+      isolate, callback, v8::Local<Value>{}, v8::Local<v8::Signature>{}, length,
+      v8::ConstructorBehavior::kThrow, side_effect_type);
+  return Utils::OpenHandle(*func_template);
+}
+
 MaybeHandle<JSFunction> ApiNatives::InstantiateFunction(
     Isolate* isolate, Handle<NativeContext> native_context,
     Handle<FunctionTemplateInfo> data, MaybeHandle<Name> maybe_name) {
@@ -587,8 +601,8 @@ MaybeHandle<JSFunction> ApiNatives::InstantiateFunction(
 }
 
 MaybeHandle<JSFunction> ApiNatives::InstantiateFunction(
-    Handle<FunctionTemplateInfo> data, MaybeHandle<Name> maybe_name) {
-  Isolate* isolate = data->GetIsolate();
+    Isolate* isolate, Handle<FunctionTemplateInfo> data,
+    MaybeHandle<Name> maybe_name) {
   InvokeScope invoke_scope(isolate);
   return ::v8::internal::InstantiateFunction(isolate, data, maybe_name);
 }
@@ -614,7 +628,7 @@ MaybeHandle<JSObject> ApiNatives::InstantiateRemoteObject(
       TERMINAL_FAST_ELEMENTS_KIND);
   object_map->SetConstructor(*constructor);
   object_map->set_is_access_check_needed(true);
-  object_map->set_may_have_interesting_symbols(true);
+  object_map->set_may_have_interesting_properties(true);
 
   Handle<JSObject> object = isolate->factory()->NewJSObjectFromMap(object_map);
   JSObject::ForceSetPrototype(isolate, object,
@@ -663,9 +677,9 @@ void ApiNatives::AddAccessorProperty(Isolate* isolate,
 void ApiNatives::AddNativeDataProperty(Isolate* isolate,
                                        Handle<TemplateInfo> info,
                                        Handle<AccessorInfo> property) {
-  Object maybe_list = info->property_accessors();
+  Tagged<Object> maybe_list = info->property_accessors();
   Handle<TemplateList> list;
-  if (maybe_list.IsUndefined(isolate)) {
+  if (IsUndefined(maybe_list, isolate)) {
     list = TemplateList::New(isolate, 1);
   } else {
     list = handle(TemplateList::cast(maybe_list), isolate);
@@ -690,8 +704,8 @@ Handle<JSFunction> ApiNatives::CreateApiFunction(
 
   if (obj->remove_prototype()) {
     DCHECK(prototype.is_null());
-    DCHECK(result->shared().IsApiFunction());
-    DCHECK(!result->IsConstructor());
+    DCHECK(result->shared()->IsApiFunction());
+    DCHECK(!IsConstructor(*result));
     DCHECK(!result->has_prototype_slot());
     return result;
   }
@@ -704,9 +718,9 @@ Handle<JSFunction> ApiNatives::CreateApiFunction(
     result->set_map(*isolate->sloppy_function_with_readonly_prototype_map());
   }
 
-  if (prototype->IsTheHole(isolate)) {
+  if (IsTheHole(*prototype, isolate)) {
     prototype = isolate->factory()->NewFunctionPrototype(result);
-  } else if (obj->GetPrototypeProviderTemplate().IsUndefined(isolate)) {
+  } else if (IsUndefined(obj->GetPrototypeProviderTemplate(), isolate)) {
     JSObject::AddProperty(isolate, Handle<JSObject>::cast(prototype),
                           isolate->factory()->constructor_string(), result,
                           DONT_ENUM);
@@ -714,7 +728,7 @@ Handle<JSFunction> ApiNatives::CreateApiFunction(
 
   int embedder_field_count = 0;
   bool immutable_proto = false;
-  if (!obj->GetInstanceTemplate().IsUndefined(isolate)) {
+  if (!IsUndefined(obj->GetInstanceTemplate(), isolate)) {
     Handle<ObjectTemplateInfo> GetInstanceTemplate = Handle<ObjectTemplateInfo>(
         ObjectTemplateInfo::cast(obj->GetInstanceTemplate()), isolate);
     embedder_field_count = GetInstanceTemplate->embedder_field_count();
@@ -736,27 +750,27 @@ Handle<JSFunction> ApiNatives::CreateApiFunction(
     // undetectable and callable. If we ever see the need to have an object
     // that is undetectable but not callable, we need to update the types.h
     // to allow encoding this.
-    CHECK(!obj->GetInstanceCallHandler().IsUndefined(isolate));
+    CHECK(!IsUndefined(obj->GetInstanceCallHandler(), isolate));
     map->set_is_undetectable(true);
   }
 
   // Mark as needs_access_check if needed.
   if (obj->needs_access_check()) {
     map->set_is_access_check_needed(true);
-    map->set_may_have_interesting_symbols(true);
+    map->set_may_have_interesting_properties(true);
   }
 
   // Set interceptor information in the map.
-  if (!obj->GetNamedPropertyHandler().IsUndefined(isolate)) {
+  if (!IsUndefined(obj->GetNamedPropertyHandler(), isolate)) {
     map->set_has_named_interceptor(true);
-    map->set_may_have_interesting_symbols(true);
+    map->set_may_have_interesting_properties(true);
   }
-  if (!obj->GetIndexedPropertyHandler().IsUndefined(isolate)) {
+  if (!IsUndefined(obj->GetIndexedPropertyHandler(), isolate)) {
     map->set_has_indexed_interceptor(true);
   }
 
   // Mark instance as callable in the map.
-  if (!obj->GetInstanceCallHandler().IsUndefined(isolate)) {
+  if (!IsUndefined(obj->GetInstanceCallHandler(), isolate)) {
     map->set_is_callable(true);
     map->set_is_constructor(!obj->undetectable());
   }
diff --git a/deps/v8/src/api/api-natives.h b/deps/v8/src/api/api-natives.h
index 034aad830c4186..fc11ca81691f7c 100644
--- a/deps/v8/src/api/api-natives.h
+++ b/deps/v8/src/api/api-natives.h
@@ -23,13 +23,19 @@ class ApiNatives {
  public:
   static const int kInitialFunctionCacheSize = 256;
 
+  // A convenient internal wrapper around FunctionTemplate::New() for creating
+  // getter/setter callback function templates.
+  static Handle<FunctionTemplateInfo> CreateAccessorFunctionTemplateInfo(
+      Isolate* isolate, FunctionCallback callback, int length,
+      v8::SideEffectType side_effect_type);
+
   V8_WARN_UNUSED_RESULT static MaybeHandle<JSFunction> InstantiateFunction(
       Isolate* isolate, Handle<NativeContext> native_context,
       Handle<FunctionTemplateInfo> data,
       MaybeHandle<Name> maybe_name = MaybeHandle<Name>());
 
   V8_WARN_UNUSED_RESULT static MaybeHandle<JSFunction> InstantiateFunction(
-      Handle<FunctionTemplateInfo> data,
+      Isolate* isolate, Handle<FunctionTemplateInfo> data,
       MaybeHandle<Name> maybe_name = MaybeHandle<Name>());
 
   V8_WARN_UNUSED_RESULT static MaybeHandle<JSObject> InstantiateObject(
diff --git a/deps/v8/src/api/api.cc b/deps/v8/src/api/api.cc
index 7071b221a7afe0..ddf93efc1bd8da 100644
--- a/deps/v8/src/api/api.cc
+++ b/deps/v8/src/api/api.cc
@@ -23,6 +23,7 @@
 #include "include/v8-locker.h"
 #include "include/v8-primitive-object.h"
 #include "include/v8-profiler.h"
+#include "include/v8-source-location.h"
 #include "include/v8-unwinder-state.h"
 #include "include/v8-util.h"
 #include "include/v8-wasm.h"
@@ -35,7 +36,6 @@
 #include "src/base/platform/time.h"
 #include "src/base/safe_conversions.h"
 #include "src/base/utils/random-number-generator.h"
-#include "src/baseline/baseline-batch-compiler.h"
 #include "src/builtins/accessors.h"
 #include "src/builtins/builtins-utils.h"
 #include "src/codegen/compilation-cache.h"
@@ -46,7 +46,7 @@
 #include "src/common/globals.h"
 #include "src/compiler-dispatcher/lazy-compile-dispatcher.h"
 #include "src/date/date.h"
-#include "src/debug/liveedit.h"
+#include "src/debug/debug.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/execution/embedder-state.h"
 #include "src/execution/execution.h"
@@ -121,7 +121,6 @@
 #include "src/snapshot/code-serializer.h"
 #include "src/snapshot/embedded/embedded-data.h"
 #include "src/snapshot/snapshot.h"
-#include "src/snapshot/startup-serializer.h"  // For SerializedHandleChecker.
 #include "src/strings/char-predicates-inl.h"
 #include "src/strings/string-hasher.h"
 #include "src/strings/unicode-inl.h"
@@ -187,7 +186,7 @@ static ScriptOrigin GetScriptOriginForScript(i::Isolate* i_isolate,
   ScriptOriginOptions options(script->origin_options());
   bool is_wasm = false;
 #if V8_ENABLE_WEBASSEMBLY
-  is_wasm = script->type() == i::Script::TYPE_WASM;
+  is_wasm = script->type() == i::Script::Type::kWasm;
 #endif  // V8_ENABLE_WEBASSEMBLY
   v8::ScriptOrigin origin(
       reinterpret_cast<v8::Isolate*>(i_isolate), Utils::ToLocal(scriptName),
@@ -222,6 +221,8 @@ void i::V8::FatalProcessOutOfMemory(i::Isolate* i_isolate, const char* location,
     // Give the embedder a chance to handle the condition. If it doesn't,
     // just crash.
     if (g_oom_error_callback) g_oom_error_callback(location, details);
+    // Note: The error message needs to be consistent with other OOM error
+    // messages (e.g. below) so that ClusterFuzz recognizes it.
     FATAL("Fatal process out of memory: %s", location);
     UNREACHABLE();
   }
@@ -333,8 +334,10 @@ void Utils::ReportOOMFailure(i::Isolate* i_isolate, const char* location,
     // crbug.com/614440.
     FatalErrorCallback fatal_callback = i_isolate->exception_behavior();
     if (fatal_callback == nullptr) {
-      base::OS::PrintError("\n#\n# Fatal %s OOM in %s\n#\n\n",
-                           details.is_heap_oom ? "javascript" : "process",
+      // Be careful when changing the error message below; it's matched by
+      // ClusterFuzz.
+      base::OS::PrintError("\n#\n# Fatal %s out of memory: %s\n#\n\n",
+                           details.is_heap_oom ? "JavaScript" : "process",
                            location);
 #ifdef V8_FUZZILLI
       // Ignore OOM crashes for fuzzing but exit with an error such that
@@ -424,14 +427,20 @@ class ArrayBufferAllocator : public v8::ArrayBuffer::Allocator {
           i::Address new_end_of_accessible_region = RoundUp(start, kChunkSize);
           size_t size =
               end_of_accessible_region_ - new_end_of_accessible_region;
-          CHECK(vas->DecommitPages(new_end_of_accessible_region, size));
+          if (!vas->DecommitPages(new_end_of_accessible_region, size)) {
+            i::V8::FatalProcessOutOfMemory(
+                nullptr, "ArrayBufferAllocator::BackendAllocator()");
+          }
           end_of_accessible_region_ = new_end_of_accessible_region;
         } else if (size >= 2 * kChunkSize) {
           // Can discard pages. The pages stay accessible, so the size of the
           // accessible region doesn't change.
           i::Address chunk_start = RoundUp(start, kChunkSize);
           i::Address chunk_end = RoundDown(start + size, kChunkSize);
-          CHECK(vas->DiscardSystemPages(chunk_start, chunk_end - chunk_start));
+          if (!vas->DiscardSystemPages(chunk_start, chunk_end - chunk_start)) {
+            i::V8::FatalProcessOutOfMemory(
+                nullptr, "ArrayBufferAllocator::BackendAllocator()");
+          }
         }
       });
     }
@@ -464,7 +473,10 @@ class ArrayBufferAllocator : public v8::ArrayBuffer::Allocator {
         size_t size = new_end_of_accessible_region - end_of_accessible_region_;
         if (!vas->SetPagePermissions(end_of_accessible_region_, size,
                                      PagePermissions::kReadWrite)) {
-          CHECK(region_alloc_->FreeRegion(region));
+          if (!region_alloc_->FreeRegion(region)) {
+            i::V8::FatalProcessOutOfMemory(
+                nullptr, "ArrayBufferAllocator::BackendAllocator::Allocate()");
+          }
           return nullptr;
         }
 
@@ -528,256 +540,57 @@ class ArrayBufferAllocator : public v8::ArrayBuffer::Allocator {
 };
 #endif  // V8_ENABLE_SANDBOX
 
-struct SnapshotCreatorData {
-  explicit SnapshotCreatorData(Isolate* v8_isolate) : isolate_(v8_isolate) {}
-
-  static SnapshotCreatorData* cast(void* data) {
-    return reinterpret_cast<SnapshotCreatorData*>(data);
-  }
-
-  ArrayBufferAllocator allocator_;
-  Isolate* isolate_;
-  Persistent<Context> default_context_;
-  SerializeInternalFieldsCallback default_embedder_fields_serializer_;
-  std::vector<Global<Context>> contexts_;
-  std::vector<SerializeInternalFieldsCallback> embedder_fields_serializers_;
-  bool created_ = false;
-};
-
 }  // namespace
 
 SnapshotCreator::SnapshotCreator(Isolate* v8_isolate,
                                  const intptr_t* external_references,
-                                 const StartupData* existing_snapshot) {
-  SnapshotCreatorData* data = new SnapshotCreatorData(v8_isolate);
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
-  i_isolate->set_array_buffer_allocator(&data->allocator_);
-  i_isolate->set_api_external_references(external_references);
-  i_isolate->enable_serializer();
-  v8_isolate->Enter();
-  const StartupData* blob = existing_snapshot
-                                ? existing_snapshot
-                                : i::Snapshot::DefaultSnapshotBlob();
-  if (blob && blob->raw_size > 0) {
-    i_isolate->set_snapshot_blob(blob);
-    i::Snapshot::Initialize(i_isolate);
-  } else {
-    i_isolate->InitWithoutSnapshot();
-  }
-  data_ = data;
-  // Disable batch compilation during snapshot creation.
-  i_isolate->baseline_batch_compiler()->set_enabled(false);
-}
+                                 const StartupData* existing_snapshot,
+                                 bool owns_isolate)
+    : data_(new i::SnapshotCreatorImpl(
+          reinterpret_cast<i::Isolate*>(v8_isolate), external_references,
+          existing_snapshot, owns_isolate)) {}
 
 SnapshotCreator::SnapshotCreator(const intptr_t* external_references,
                                  const StartupData* existing_snapshot)
-    : SnapshotCreator(Isolate::Allocate(), external_references,
-                      existing_snapshot) {}
+    : SnapshotCreator(nullptr, external_references, existing_snapshot) {}
 
 SnapshotCreator::~SnapshotCreator() {
-  SnapshotCreatorData* data = SnapshotCreatorData::cast(data_);
-  Isolate* v8_isolate = data->isolate_;
-  v8_isolate->Exit();
-  v8_isolate->Dispose();
-  delete data;
+  DCHECK_NOT_NULL(data_);
+  auto impl = static_cast<i::SnapshotCreatorImpl*>(data_);
+  delete impl;
 }
 
 Isolate* SnapshotCreator::GetIsolate() {
-  return SnapshotCreatorData::cast(data_)->isolate_;
+  auto impl = static_cast<i::SnapshotCreatorImpl*>(data_);
+  return reinterpret_cast<v8::Isolate*>(impl->isolate());
 }
 
 void SnapshotCreator::SetDefaultContext(
     Local<Context> context, SerializeInternalFieldsCallback callback) {
-  DCHECK(!context.IsEmpty());
-  SnapshotCreatorData* data = SnapshotCreatorData::cast(data_);
-  DCHECK(!data->created_);
-  DCHECK(data->default_context_.IsEmpty());
-  Isolate* v8_isolate = data->isolate_;
-  CHECK_EQ(v8_isolate, context->GetIsolate());
-  data->default_context_.Reset(v8_isolate, context);
-  data->default_embedder_fields_serializer_ = callback;
+  auto impl = static_cast<i::SnapshotCreatorImpl*>(data_);
+  impl->SetDefaultContext(Utils::OpenHandle(*context), callback);
 }
 
 size_t SnapshotCreator::AddContext(Local<Context> context,
                                    SerializeInternalFieldsCallback callback) {
-  DCHECK(!context.IsEmpty());
-  SnapshotCreatorData* data = SnapshotCreatorData::cast(data_);
-  DCHECK(!data->created_);
-  Isolate* v8_isolate = data->isolate_;
-  CHECK_EQ(v8_isolate, context->GetIsolate());
-  size_t index = data->contexts_.size();
-  data->contexts_.emplace_back(v8_isolate, context);
-  data->embedder_fields_serializers_.push_back(callback);
-  return index;
+  auto impl = static_cast<i::SnapshotCreatorImpl*>(data_);
+  return impl->AddContext(Utils::OpenHandle(*context), callback);
 }
 
 size_t SnapshotCreator::AddData(i::Address object) {
-  DCHECK_NE(object, i::kNullAddress);
-  SnapshotCreatorData* data = SnapshotCreatorData::cast(data_);
-  DCHECK(!data->created_);
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(data->isolate_);
-  i::HandleScope scope(i_isolate);
-  i::Handle<i::Object> obj(i::Object(object), i_isolate);
-  i::Handle<i::ArrayList> list;
-  if (!i_isolate->heap()->serialized_objects().IsArrayList()) {
-    list = i::ArrayList::New(i_isolate, 1);
-  } else {
-    list = i::Handle<i::ArrayList>(
-        i::ArrayList::cast(i_isolate->heap()->serialized_objects()), i_isolate);
-  }
-  size_t index = static_cast<size_t>(list->Length());
-  list = i::ArrayList::Add(i_isolate, list, obj);
-  i_isolate->heap()->SetSerializedObjects(*list);
-  return index;
+  auto impl = static_cast<i::SnapshotCreatorImpl*>(data_);
+  return impl->AddData(object);
 }
 
 size_t SnapshotCreator::AddData(Local<Context> context, i::Address object) {
-  DCHECK_NE(object, i::kNullAddress);
-  DCHECK(!SnapshotCreatorData::cast(data_)->created_);
-  i::Handle<i::Context> ctx = Utils::OpenHandle(*context);
-  i::Isolate* i_isolate = ctx->GetIsolate();
-  i::HandleScope scope(i_isolate);
-  i::Handle<i::Object> obj(i::Object(object), i_isolate);
-  i::Handle<i::ArrayList> list;
-  if (!ctx->serialized_objects().IsArrayList()) {
-    list = i::ArrayList::New(i_isolate, 1);
-  } else {
-    list = i::Handle<i::ArrayList>(
-        i::ArrayList::cast(ctx->serialized_objects()), i_isolate);
-  }
-  size_t index = static_cast<size_t>(list->Length());
-  list = i::ArrayList::Add(i_isolate, list, obj);
-  ctx->set_serialized_objects(*list);
-  return index;
-}
-
-namespace {
-void ConvertSerializedObjectsToFixedArray(Local<Context> context) {
-  i::Handle<i::Context> ctx = Utils::OpenHandle(*context);
-  i::Isolate* i_isolate = ctx->GetIsolate();
-  if (!ctx->serialized_objects().IsArrayList()) {
-    ctx->set_serialized_objects(
-        i::ReadOnlyRoots(i_isolate).empty_fixed_array());
-  } else {
-    i::Handle<i::ArrayList> list(i::ArrayList::cast(ctx->serialized_objects()),
-                                 i_isolate);
-    i::Handle<i::FixedArray> elements = i::ArrayList::Elements(i_isolate, list);
-    ctx->set_serialized_objects(*elements);
-  }
+  auto impl = static_cast<i::SnapshotCreatorImpl*>(data_);
+  return impl->AddData(Utils::OpenHandle(*context), object);
 }
 
-void ConvertSerializedObjectsToFixedArray(i::Isolate* i_isolate) {
-  if (!i_isolate->heap()->serialized_objects().IsArrayList()) {
-    i_isolate->heap()->SetSerializedObjects(
-        i::ReadOnlyRoots(i_isolate).empty_fixed_array());
-  } else {
-    i::Handle<i::ArrayList> list(
-        i::ArrayList::cast(i_isolate->heap()->serialized_objects()), i_isolate);
-    i::Handle<i::FixedArray> elements = i::ArrayList::Elements(i_isolate, list);
-    i_isolate->heap()->SetSerializedObjects(*elements);
-  }
-}
-}  // anonymous namespace
-
 StartupData SnapshotCreator::CreateBlob(
     SnapshotCreator::FunctionCodeHandling function_code_handling) {
-  SnapshotCreatorData* data = SnapshotCreatorData::cast(data_);
-  Isolate* isolate = data->isolate_;
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
-  Utils::ApiCheck(!data->created_, "v8::SnapshotCreator::CreateBlob",
-                  "CreateBlob() cannot be called more than once on the same "
-                  "SnapshotCreator");
-  Utils::ApiCheck(
-      !data->default_context_.IsEmpty(), "v8::SnapshotCreator::CreateBlob",
-      "CreateBlob() cannot be called before the default context is set");
-  const int num_additional_contexts = static_cast<int>(data->contexts_.size());
-  const int num_contexts = num_additional_contexts + 1;  // The default context.
-
-  // Create and store lists of embedder-provided data needed during
-  // serialization.
-  {
-    i::HandleScope scope(i_isolate);
-    // Convert list of context-independent data to FixedArray.
-    ConvertSerializedObjectsToFixedArray(i_isolate);
-
-    // Convert lists of context-dependent data to FixedArray.
-    ConvertSerializedObjectsToFixedArray(
-        data->default_context_.Get(data->isolate_));
-    for (int i = 0; i < num_additional_contexts; i++) {
-      ConvertSerializedObjectsToFixedArray(data->contexts_[i].Get(isolate));
-    }
-
-    // We need to store the global proxy size upfront in case we need the
-    // bootstrapper to create a global proxy before we deserialize the context.
-    i::Handle<i::FixedArray> global_proxy_sizes =
-        i_isolate->factory()->NewFixedArray(num_additional_contexts,
-                                            i::AllocationType::kOld);
-    for (int i = 0; i < num_additional_contexts; i++) {
-      i::Handle<i::Context> context =
-          v8::Utils::OpenHandle(*data->contexts_[i].Get(isolate));
-      global_proxy_sizes->set(i,
-                              i::Smi::FromInt(context->global_proxy().Size()));
-    }
-    i_isolate->heap()->SetSerializedGlobalProxySizes(*global_proxy_sizes);
-  }
-
-  // We might rehash strings and re-sort descriptors. Clear the lookup cache.
-  i_isolate->descriptor_lookup_cache()->Clear();
-
-  // If we don't do this then we end up with a stray root pointing at the
-  // context even after we have disposed of the context.
-  i_isolate->heap()->CollectAllAvailableGarbage(
-      i::GarbageCollectionReason::kSnapshotCreator);
-  {
-    i::HandleScope scope(i_isolate);
-    i_isolate->heap()->CompactWeakArrayLists();
-  }
-
-  i::Snapshot::ClearReconstructableDataForSerialization(
-      i_isolate, function_code_handling == FunctionCodeHandling::kClear);
-
-  i::SafepointKind safepoint_kind = i_isolate->has_shared_space()
-                                        ? i::SafepointKind::kGlobal
-                                        : i::SafepointKind::kIsolate;
-  i::SafepointScope safepoint_scope(i_isolate, safepoint_kind);
-  i::DisallowGarbageCollection no_gc_from_here_on;
-
-  // Create a vector with all contexts and clear associated Persistent fields.
-  // Note these contexts may be dead after calling Clear(), but will not be
-  // collected until serialization completes and the DisallowGarbageCollection
-  // scope above goes out of scope.
-  std::vector<i::Context> contexts;
-  contexts.reserve(num_contexts);
-  {
-    i::HandleScope scope(i_isolate);
-    contexts.push_back(
-        *v8::Utils::OpenHandle(*data->default_context_.Get(data->isolate_)));
-    data->default_context_.Reset();
-    for (int i = 0; i < num_additional_contexts; i++) {
-      i::Handle<i::Context> context =
-          v8::Utils::OpenHandle(*data->contexts_[i].Get(isolate));
-      contexts.push_back(*context);
-    }
-    data->contexts_.clear();
-  }
-
-  // Check that values referenced by global/eternal handles are accounted for.
-  i::SerializedHandleChecker handle_checker(i_isolate, &contexts);
-  CHECK(handle_checker.CheckGlobalAndEternalHandles());
-
-  // Create a vector with all embedder fields serializers.
-  std::vector<SerializeInternalFieldsCallback> embedder_fields_serializers;
-  embedder_fields_serializers.reserve(num_contexts);
-  embedder_fields_serializers.push_back(
-      data->default_embedder_fields_serializer_);
-  for (int i = 0; i < num_additional_contexts; i++) {
-    embedder_fields_serializers.push_back(
-        data->embedder_fields_serializers_[i]);
-  }
-
-  data->created_ = true;
-  return i::Snapshot::Create(i_isolate, &contexts, embedder_fields_serializers,
-                             safepoint_scope, no_gc_from_here_on);
+  auto impl = static_cast<i::SnapshotCreatorImpl*>(data_);
+  return impl->CreateBlob(function_code_handling);
 }
 
 bool StartupData::CanBeRehashed() const {
@@ -907,7 +720,7 @@ void ResourceConstraints::ConfigureDefaults(uint64_t physical_memory,
 
 namespace internal {
 
-i::Address* GlobalizeTracedReference(i::Isolate* i_isolate, i::Address* obj,
+i::Address* GlobalizeTracedReference(i::Isolate* i_isolate, i::Address value,
                                      internal::Address* slot,
                                      GlobalHandleStoreMode store_mode) {
   API_RCS_SCOPE(i_isolate, TracedGlobal, New);
@@ -915,11 +728,10 @@ i::Address* GlobalizeTracedReference(i::Isolate* i_isolate, i::Address* obj,
   Utils::ApiCheck((slot != nullptr), "v8::GlobalizeTracedReference",
                   "the address slot must be not null");
 #endif
-  auto obj_addr = internal::ValueHelper::ValueAsAddress(obj);
-  auto result = i_isolate->traced_handles()->Create(obj_addr, slot, store_mode);
+  auto result = i_isolate->traced_handles()->Create(value, slot, store_mode);
 #ifdef VERIFY_HEAP
   if (i::v8_flags.verify_heap) {
-    i::Object(obj_addr).ObjectVerify(i_isolate);
+    Object::ObjectVerify(i::Object(value), i_isolate);
   }
 #endif  // VERIFY_HEAP
   return result.location();
@@ -938,6 +750,12 @@ void DisposeTracedReference(internal::Address* location) {
   TracedHandles::Destroy(location);
 }
 
+// static
+void v8::internal::HandleHelper::VerifyOnStack(const void* ptr) {
+  DCHECK_LE(v8::base::Stack::GetCurrentStackPosition(), ptr);
+  DCHECK_GE(v8::base::Stack::GetStackStartUnchecked(), ptr);
+}
+
 #if V8_STATIC_ROOTS_BOOL
 
 // Initialize static root constants exposed in v8-internal.h.
@@ -977,12 +795,12 @@ EXPORTED_STATIC_ROOTS_MAPPING(DEF_STATIC_ROOT)
 
 namespace api_internal {
 
-i::Address* GlobalizeReference(i::Isolate* i_isolate, i::Address* obj) {
+i::Address* GlobalizeReference(i::Isolate* i_isolate, i::Address value) {
   API_RCS_SCOPE(i_isolate, Persistent, New);
-  i::Handle<i::Object> result = i_isolate->global_handles()->Create(*obj);
+  i::Handle<i::Object> result = i_isolate->global_handles()->Create(value);
 #ifdef VERIFY_HEAP
   if (i::v8_flags.verify_heap) {
-    i::Object(*obj).ObjectVerify(i_isolate);
+    i::Object::ObjectVerify(i::Object(value), i_isolate);
   }
 #endif  // VERIFY_HEAP
   return result.location();
@@ -1019,13 +837,12 @@ void DisposeGlobal(i::Address* location) {
   i::GlobalHandles::Destroy(location);
 }
 
-Value* Eternalize(Isolate* v8_isolate, Value* value) {
+i::Address* Eternalize(Isolate* v8_isolate, Value* value) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
-  i::Object object = *Utils::OpenHandle(value);
+  i::Tagged<i::Object> object = *Utils::OpenDirectHandle(value);
   int index = -1;
   i_isolate->eternal_handles()->Create(i_isolate, object, &index);
-  return reinterpret_cast<Value*>(
-      i_isolate->eternal_handles()->Get(index).location());
+  return i_isolate->eternal_handles()->Get(index).location();
 }
 
 void FromJustIsNothing() {
@@ -1085,14 +902,14 @@ i::Address* HandleScope::CreateHandle(i::Isolate* i_isolate, i::Address value) {
   return i::HandleScope::CreateHandle(i_isolate, value);
 }
 
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+#ifdef V8_ENABLE_DIRECT_LOCAL
 
 i::Address* HandleScope::CreateHandleForCurrentIsolate(i::Address value) {
   i::Isolate* i_isolate = i::Isolate::Current();
   return i::HandleScope::CreateHandle(i_isolate, value);
 }
 
-#endif
+#endif  // V8_ENABLE_DIRECT_LOCAL
 
 EscapableHandleScope::EscapableHandleScope(Isolate* v8_isolate) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
@@ -1103,7 +920,7 @@ EscapableHandleScope::EscapableHandleScope(Isolate* v8_isolate) {
 
 i::Address* EscapableHandleScope::Escape(i::Address* escape_value) {
   i::Heap* heap = reinterpret_cast<i::Isolate*>(GetIsolate())->heap();
-  Utils::ApiCheck(i::Object(*escape_slot_).IsTheHole(heap->isolate()),
+  Utils::ApiCheck(i::IsTheHole(i::Object(*escape_slot_), heap->isolate()),
                   "EscapableHandleScope::Escape", "Escape value set twice");
   if (escape_value == nullptr) {
     *escape_slot_ = i::ReadOnlyRoots(heap).undefined_value().ptr();
@@ -1142,41 +959,45 @@ void* SealHandleScope::operator new[](size_t) { base::OS::Abort(); }
 void SealHandleScope::operator delete(void*, size_t) { base::OS::Abort(); }
 void SealHandleScope::operator delete[](void*, size_t) { base::OS::Abort(); }
 
-bool Data::IsModule() const { return Utils::OpenHandle(this)->IsModule(); }
+bool Data::IsModule() const {
+  return i::IsModule(*Utils::OpenDirectHandle(this));
+}
 bool Data::IsFixedArray() const {
-  return Utils::OpenHandle(this)->IsFixedArray();
+  return i::IsFixedArray(*Utils::OpenDirectHandle(this));
 }
 
 bool Data::IsValue() const {
   i::DisallowGarbageCollection no_gc;
-  i::Object self = *Utils::OpenHandle(this);
-  if (self.IsSmi()) return true;
-  i::HeapObject heap_object = i::HeapObject::cast(self);
-  DCHECK(!heap_object.IsTheHole());
-  if (heap_object.IsSymbol()) {
-    return !i::Symbol::cast(heap_object).is_private();
+  i::Tagged<i::Object> self = *Utils::OpenDirectHandle(this);
+  if (i::IsSmi(self)) return true;
+  i::Tagged<i::HeapObject> heap_object = i::HeapObject::cast(self);
+  DCHECK(!IsTheHole(heap_object));
+  if (i::IsSymbol(heap_object)) {
+    return !i::Symbol::cast(heap_object)->is_private();
   }
-  return heap_object.IsPrimitiveHeapObject() || heap_object.IsJSReceiver();
+  return IsPrimitiveHeapObject(heap_object) || IsJSReceiver(heap_object);
 }
 
 bool Data::IsPrivate() const {
-  return Utils::OpenHandle(this)->IsPrivateSymbol();
+  return i::IsPrivateSymbol(*Utils::OpenDirectHandle(this));
 }
 
 bool Data::IsObjectTemplate() const {
-  return Utils::OpenHandle(this)->IsObjectTemplateInfo();
+  return i::IsObjectTemplateInfo(*Utils::OpenDirectHandle(this));
 }
 
 bool Data::IsFunctionTemplate() const {
-  return Utils::OpenHandle(this)->IsFunctionTemplateInfo();
+  return i::IsFunctionTemplateInfo(*Utils::OpenDirectHandle(this));
 }
 
-bool Data::IsContext() const { return Utils::OpenHandle(this)->IsContext(); }
+bool Data::IsContext() const {
+  return i::IsContext(*Utils::OpenDirectHandle(this));
+}
 
 void Context::Enter() {
   i::DisallowGarbageCollection no_gc;
-  i::Context env = *Utils::OpenHandle(this);
-  i::Isolate* i_isolate = env.GetIsolate();
+  i::Tagged<i::NativeContext> env = *Utils::OpenDirectHandle(this);
+  i::Isolate* i_isolate = env->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScopeImplementer* impl = i_isolate->handle_scope_implementer();
   impl->EnterContext(env);
@@ -1185,7 +1006,7 @@ void Context::Enter() {
 }
 
 void Context::Exit() {
-  i::Handle<i::Context> env = Utils::OpenHandle(this);
+  i::DirectHandle<i::NativeContext> env = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = env->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScopeImplementer* impl = i_isolate->handle_scope_implementer();
@@ -1202,7 +1023,8 @@ Context::BackupIncumbentScope::BackupIncumbentScope(
     : backup_incumbent_context_(backup_incumbent_context) {
   DCHECK(!backup_incumbent_context_.IsEmpty());
 
-  i::Handle<i::Context> env = Utils::OpenHandle(*backup_incumbent_context_);
+  i::DirectHandle<i::NativeContext> env =
+      Utils::OpenDirectHandle(*backup_incumbent_context_);
   i::Isolate* i_isolate = env->GetIsolate();
 
   js_stack_comparable_address_ =
@@ -1213,7 +1035,8 @@ Context::BackupIncumbentScope::BackupIncumbentScope(
 }
 
 Context::BackupIncumbentScope::~BackupIncumbentScope() {
-  i::Handle<i::Context> env = Utils::OpenHandle(*backup_incumbent_context_);
+  i::DirectHandle<i::NativeContext> env =
+      Utils::OpenDirectHandle(*backup_incumbent_context_);
   i::Isolate* i_isolate = env->GetIsolate();
 
   i::SimulatorStack::UnregisterJSStackComparableAddress(i_isolate);
@@ -1228,10 +1051,10 @@ static_assert(i::Internals::kEmbedderDataSlotExternalPointerOffset ==
 static i::Handle<i::EmbedderDataArray> EmbedderDataFor(Context* context,
                                                        int index, bool can_grow,
                                                        const char* location) {
-  i::Handle<i::Context> env = Utils::OpenHandle(context);
+  i::DirectHandle<i::NativeContext> env = Utils::OpenDirectHandle(context);
   i::Isolate* i_isolate = env->GetIsolate();
   DCHECK_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  bool ok = Utils::ApiCheck(env->IsNativeContext(), location,
+  bool ok = Utils::ApiCheck(i::IsNativeContext(*env), location,
                             "Not a native context") &&
             Utils::ApiCheck(index >= 0, location, "Negative index");
   if (!ok) return i::Handle<i::EmbedderDataArray>();
@@ -1249,14 +1072,14 @@ static i::Handle<i::EmbedderDataArray> EmbedderDataFor(Context* context,
 }
 
 uint32_t Context::GetNumberOfEmbedderDataFields() {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::DirectHandle<i::NativeContext> context = Utils::OpenDirectHandle(this);
   DCHECK_NO_SCRIPT_NO_EXCEPTION(context->GetIsolate());
-  Utils::ApiCheck(context->IsNativeContext(),
+  Utils::ApiCheck(i::IsNativeContext(*context),
                   "Context::GetNumberOfEmbedderDataFields",
                   "Not a native context");
   // TODO(ishell): remove cast once embedder_data slot has a proper type.
   return static_cast<uint32_t>(
-      i::EmbedderDataArray::cast(context->embedder_data()).length());
+      i::EmbedderDataArray::cast(context->embedder_data())->length());
 }
 
 v8::Local<v8::Value> Context::SlowGetEmbedderData(int index) {
@@ -1264,7 +1087,7 @@ v8::Local<v8::Value> Context::SlowGetEmbedderData(int index) {
   i::Handle<i::EmbedderDataArray> data =
       EmbedderDataFor(this, index, false, location);
   if (data.is_null()) return Local<Value>();
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   i::Handle<i::Object> result(i::EmbedderDataSlot(*data, index).load_tagged(),
                               i_isolate);
   return Utils::ToLocal(result);
@@ -1275,15 +1098,15 @@ void Context::SetEmbedderData(int index, v8::Local<Value> value) {
   i::Handle<i::EmbedderDataArray> data =
       EmbedderDataFor(this, index, true, location);
   if (data.is_null()) return;
-  i::Handle<i::Object> val = Utils::OpenHandle(*value);
+  i::DirectHandle<i::Object> val = Utils::OpenDirectHandle(*value);
   i::EmbedderDataSlot::store_tagged(*data, index, *val);
-  DCHECK_EQ(*Utils::OpenHandle(*value),
-            *Utils::OpenHandle(*GetEmbedderData(index)));
+  DCHECK_EQ(*Utils::OpenDirectHandle(*value),
+            *Utils::OpenDirectHandle(*GetEmbedderData(index)));
 }
 
 void* Context::SlowGetAlignedPointerFromEmbedderData(int index) {
   const char* location = "v8::Context::GetAlignedPointerFromEmbedderData()";
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   i::HandleScope handle_scope(i_isolate);
   i::Handle<i::EmbedderDataArray> data =
       EmbedderDataFor(this, index, false, location);
@@ -1297,7 +1120,7 @@ void* Context::SlowGetAlignedPointerFromEmbedderData(int index) {
 
 void Context::SetAlignedPointerInEmbedderData(int index, void* value) {
   const char* location = "v8::Context::SetAlignedPointerInEmbedderData()";
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   i::Handle<i::EmbedderDataArray> data =
       EmbedderDataFor(this, index, true, location);
   bool ok =
@@ -1308,31 +1131,31 @@ void Context::SetAlignedPointerInEmbedderData(int index, void* value) {
 
 // --- T e m p l a t e ---
 
-static void InitializeTemplate(i::TemplateInfo that, int type,
+static void InitializeTemplate(i::Tagged<i::TemplateInfo> that, int type,
                                bool do_not_cache) {
-  that.set_number_of_properties(0);
-  that.set_tag(type);
+  that->set_number_of_properties(0);
+  that->set_tag(type);
   int serial_number =
       do_not_cache ? i::TemplateInfo::kDoNotCache : i::TemplateInfo::kUncached;
-  that.set_serial_number(serial_number);
+  that->set_serial_number(serial_number);
 }
 
 void Template::Set(v8::Local<Name> name, v8::Local<Data> value,
                    v8::PropertyAttribute attribute) {
   auto templ = Utils::OpenHandle(this);
-  i::Isolate* i_isolate = templ->GetIsolate();
+  i::Isolate* i_isolate = templ->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   auto value_obj = Utils::OpenHandle(*value);
 
-  Utils::ApiCheck(!value_obj->IsJSReceiver() || value_obj->IsTemplateInfo(),
+  Utils::ApiCheck(!IsJSReceiver(*value_obj) || IsTemplateInfo(*value_obj),
                   "v8::Template::Set",
                   "Invalid value, must be a primitive or a Template");
 
   // The template cache only performs shallow clones, if we set an
   // ObjectTemplate as a property value then we can not cache the receiver
   // template.
-  if (value_obj->IsObjectTemplateInfo()) {
+  if (i::IsObjectTemplateInfo(*value_obj)) {
     templ->set_serial_number(i::TemplateInfo::kDoNotCache);
   }
 
@@ -1354,17 +1177,19 @@ void Template::SetAccessorProperty(v8::Local<v8::Name> name,
                                    v8::AccessControl access_control) {
   Utils::ApiCheck(
       getter.IsEmpty() ||
-          !Utils::OpenHandle(*getter)->call_code(kAcquireLoad).IsUndefined(),
+          !IsUndefined(
+              Utils::OpenDirectHandle(*getter)->call_code(kAcquireLoad)),
       "v8::Template::SetAccessorProperty", "Getter must have a call handler");
   Utils::ApiCheck(
       setter.IsEmpty() ||
-          !Utils::OpenHandle(*setter)->call_code(kAcquireLoad).IsUndefined(),
+          !IsUndefined(
+              Utils::OpenDirectHandle(*setter)->call_code(kAcquireLoad)),
       "v8::Template::SetAccessorProperty", "Setter must have a call handler");
 
   // TODO(verwaest): Remove |access_control|.
   DCHECK_EQ(v8::DEFAULT, access_control);
   auto templ = Utils::OpenHandle(this);
-  auto i_isolate = templ->GetIsolate();
+  auto i_isolate = templ->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   DCHECK(!name.IsEmpty());
   DCHECK(!getter.IsEmpty() || !setter.IsEmpty());
@@ -1376,10 +1201,10 @@ void Template::SetAccessorProperty(v8::Local<v8::Name> name,
 }
 
 // --- F u n c t i o n   T e m p l a t e ---
-static void InitializeFunctionTemplate(i::FunctionTemplateInfo info,
+static void InitializeFunctionTemplate(i::Tagged<i::FunctionTemplateInfo> info,
                                        bool do_not_cache) {
   InitializeTemplate(info, Consts::FUNCTION_TEMPLATE, do_not_cache);
-  info.set_flag(0);
+  info->set_flag(0, kRelaxedStore);
 }
 
 namespace {
@@ -1395,11 +1220,11 @@ Local<ObjectTemplate> ObjectTemplateNew(i::Isolate* i_isolate,
   {
     // Disallow GC until all fields of obj have acceptable types.
     i::DisallowGarbageCollection no_gc;
-    i::ObjectTemplateInfo raw = *obj;
+    i::Tagged<i::ObjectTemplateInfo> raw = *obj;
     InitializeTemplate(raw, Consts::OBJECT_TEMPLATE, do_not_cache);
-    raw.set_data(0);
+    raw->set_data(0);
     if (!constructor.IsEmpty()) {
-      raw.set_constructor(*Utils::OpenHandle(*constructor));
+      raw->set_constructor(*Utils::OpenDirectHandle(*constructor));
     }
   }
   return Utils::ToLocal(obj);
@@ -1408,10 +1233,10 @@ Local<ObjectTemplate> ObjectTemplateNew(i::Isolate* i_isolate,
 
 Local<ObjectTemplate> FunctionTemplate::PrototypeTemplate() {
   auto self = Utils::OpenHandle(this);
-  i::Isolate* i_isolate = self->GetIsolate();
+  i::Isolate* i_isolate = self->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::Handle<i::HeapObject> result(self->GetPrototypeTemplate(), i_isolate);
-  if (result->IsUndefined(i_isolate)) {
+  if (i::IsUndefined(*result, i_isolate)) {
     // Do not cache prototype objects.
     result = Utils::OpenHandle(
         *ObjectTemplateNew(i_isolate, Local<FunctionTemplate>(), true));
@@ -1423,14 +1248,14 @@ Local<ObjectTemplate> FunctionTemplate::PrototypeTemplate() {
 void FunctionTemplate::SetPrototypeProviderTemplate(
     Local<FunctionTemplate> prototype_provider) {
   auto self = Utils::OpenHandle(this);
-  i::Isolate* i_isolate = self->GetIsolate();
+  i::Isolate* i_isolate = self->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::Handle<i::FunctionTemplateInfo> result =
       Utils::OpenHandle(*prototype_provider);
-  Utils::ApiCheck(self->GetPrototypeTemplate().IsUndefined(i_isolate),
+  Utils::ApiCheck(i::IsUndefined(self->GetPrototypeTemplate(), i_isolate),
                   "v8::FunctionTemplate::SetPrototypeProviderTemplate",
                   "Protoype must be undefined");
-  Utils::ApiCheck(self->GetParentTemplate().IsUndefined(i_isolate),
+  Utils::ApiCheck(i::IsUndefined(self->GetParentTemplate(), i_isolate),
                   "v8::FunctionTemplate::SetPrototypeProviderTemplate",
                   "Prototype provider must be empty");
   i::FunctionTemplateInfo::SetPrototypeProviderTemplate(i_isolate, self,
@@ -1438,7 +1263,7 @@ void FunctionTemplate::SetPrototypeProviderTemplate(
 }
 
 namespace {
-static void EnsureNotPublished(i::Handle<i::FunctionTemplateInfo> info,
+static void EnsureNotPublished(i::DirectHandle<i::FunctionTemplateInfo> info,
                                const char* func) {
   DCHECK_IMPLIES(info->instantiated(), info->published());
   Utils::ApiCheck(!info->published(), func,
@@ -1462,24 +1287,25 @@ Local<FunctionTemplate> FunctionTemplateNew(
   {
     // Disallow GC until all fields of obj have acceptable types.
     i::DisallowGarbageCollection no_gc;
-    i::FunctionTemplateInfo raw = *obj;
+    i::Tagged<i::FunctionTemplateInfo> raw = *obj;
     InitializeFunctionTemplate(raw, do_not_cache);
-    raw.set_length(length);
-    raw.set_undetectable(false);
-    raw.set_needs_access_check(false);
-    raw.set_accept_any_receiver(true);
+    raw->set_length(length);
+    raw->set_undetectable(false);
+    raw->set_needs_access_check(false);
+    raw->set_accept_any_receiver(true);
     if (!signature.IsEmpty()) {
-      raw.set_signature(*Utils::OpenHandle(*signature));
+      raw->set_signature(*Utils::OpenDirectHandle(*signature));
     }
-    raw.set_cached_property_name(
+    raw->set_cached_property_name(
         cached_property_name.IsEmpty()
             ? i::ReadOnlyRoots(i_isolate).the_hole_value()
-            : *Utils::OpenHandle(*cached_property_name));
-    if (behavior == ConstructorBehavior::kThrow) raw.set_remove_prototype(true);
-    raw.SetInstanceType(instance_type);
-    raw.set_allowed_receiver_instance_type_range_start(
+            : *Utils::OpenDirectHandle(*cached_property_name));
+    if (behavior == ConstructorBehavior::kThrow)
+      raw->set_remove_prototype(true);
+    raw->SetInstanceType(instance_type);
+    raw->set_allowed_receiver_instance_type_range_start(
         allowed_receiver_instance_type_range_start);
-    raw.set_allowed_receiver_instance_type_range_end(
+    raw->set_allowed_receiver_instance_type_range_end(
         allowed_receiver_instance_type_range_end);
   }
   if (callback != nullptr) {
@@ -1493,11 +1319,11 @@ Local<FunctionTemplate> FunctionTemplateNew(
 void FunctionTemplate::Inherit(v8::Local<FunctionTemplate> value) {
   auto info = Utils::OpenHandle(this);
   EnsureNotPublished(info, "v8::FunctionTemplate::Inherit");
-  i::Isolate* i_isolate = info->GetIsolate();
+  i::Isolate* i_isolate = info->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  Utils::ApiCheck(info->GetPrototypeProviderTemplate().IsUndefined(i_isolate),
-                  "v8::FunctionTemplate::Inherit",
-                  "Protoype provider must be empty");
+  Utils::ApiCheck(
+      i::IsUndefined(info->GetPrototypeProviderTemplate(), i_isolate),
+      "v8::FunctionTemplate::Inherit", "Protoype provider must be empty");
   i::FunctionTemplateInfo::SetParentTemplate(i_isolate, info,
                                              Utils::OpenHandle(*value));
 }
@@ -1576,7 +1402,7 @@ Local<FunctionTemplate> FunctionTemplate::NewWithCache(
 
 Local<Signature> Signature::New(Isolate* v8_isolate,
                                 Local<FunctionTemplate> receiver) {
-  return Utils::SignatureToLocal(Utils::OpenHandle(*receiver));
+  return Local<Signature>::Cast(receiver);
 }
 
 #define SET_FIELD_WRAPPED(i_isolate, obj, setter, cdata)        \
@@ -1591,11 +1417,12 @@ void FunctionTemplate::SetCallHandler(
     const MemorySpan<const CFunction>& c_function_overloads) {
   auto info = Utils::OpenHandle(this);
   EnsureNotPublished(info, "v8::FunctionTemplate::SetCallHandler");
-  i::Isolate* i_isolate = info->GetIsolate();
+  i::Isolate* i_isolate = info->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   i::Handle<i::CallHandlerInfo> obj = i_isolate->factory()->NewCallHandlerInfo(
       side_effect_type == SideEffectType::kHasNoSideEffect);
+  obj->set_owner_template(*info);
   obj->set_callback(i_isolate, reinterpret_cast<i::Address>(callback));
   if (data.IsEmpty()) {
     data = v8::Undefined(reinterpret_cast<v8::Isolate*>(i_isolate));
@@ -1644,23 +1471,23 @@ i::Handle<i::AccessorInfo> MakeAccessorInfo(
   obj->set_setter(i_isolate, reinterpret_cast<i::Address>(setter));
 
   i::Handle<i::Name> accessor_name = Utils::OpenHandle(*name);
-  if (!accessor_name->IsUniqueName()) {
+  if (!IsUniqueName(*accessor_name)) {
     accessor_name = i_isolate->factory()->InternalizeString(
         i::Handle<i::String>::cast(accessor_name));
   }
   i::DisallowGarbageCollection no_gc;
-  i::AccessorInfo raw_obj = *obj;
+  i::Tagged<i::AccessorInfo> raw_obj = *obj;
   if (data.IsEmpty()) {
-    raw_obj.set_data(i::ReadOnlyRoots(i_isolate).undefined_value());
+    raw_obj->set_data(i::ReadOnlyRoots(i_isolate).undefined_value());
   } else {
-    raw_obj.set_data(*Utils::OpenHandle(*data));
-  }
-  raw_obj.set_name(*accessor_name);
-  raw_obj.set_is_special_data_property(is_special_data_property);
-  raw_obj.set_replace_on_access(replace_on_access);
-  if (settings & ALL_CAN_READ) raw_obj.set_all_can_read(true);
-  if (settings & ALL_CAN_WRITE) raw_obj.set_all_can_write(true);
-  raw_obj.set_initial_property_attributes(i::NONE);
+    raw_obj->set_data(*Utils::OpenHandle(*data));
+  }
+  raw_obj->set_name(*accessor_name);
+  raw_obj->set_is_special_data_property(is_special_data_property);
+  raw_obj->set_replace_on_access(replace_on_access);
+  if (settings & ALL_CAN_READ) raw_obj->set_all_can_read(true);
+  if (settings & ALL_CAN_WRITE) raw_obj->set_all_can_write(true);
+  raw_obj->set_initial_property_attributes(i::NONE);
   return obj;
 }
 
@@ -1673,9 +1500,9 @@ Local<ObjectTemplate> FunctionTemplate::InstanceTemplate() {
                        "Reading from empty handle")) {
     return Local<ObjectTemplate>();
   }
-  i::Isolate* i_isolate = handle->GetIsolate();
+  i::Isolate* i_isolate = handle->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  if (handle->GetInstanceTemplate().IsUndefined(i_isolate)) {
+  if (i::IsUndefined(handle->GetInstanceTemplate(), i_isolate)) {
     Local<ObjectTemplate> templ =
         ObjectTemplate::New(i_isolate, ToApiHandle<FunctionTemplate>(handle));
     i::FunctionTemplateInfo::SetInstanceTemplate(i_isolate, handle,
@@ -1687,41 +1514,41 @@ Local<ObjectTemplate> FunctionTemplate::InstanceTemplate() {
 }
 
 void FunctionTemplate::SetLength(int length) {
-  auto info = Utils::OpenHandle(this);
+  auto info = Utils::OpenDirectHandle(this);
   EnsureNotPublished(info, "v8::FunctionTemplate::SetLength");
-  auto i_isolate = info->GetIsolate();
+  i::Isolate* i_isolate = info->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   info->set_length(length);
 }
 
 void FunctionTemplate::SetClassName(Local<String> name) {
-  auto info = Utils::OpenHandle(this);
+  auto info = Utils::OpenDirectHandle(this);
   EnsureNotPublished(info, "v8::FunctionTemplate::SetClassName");
-  auto i_isolate = info->GetIsolate();
+  i::Isolate* i_isolate = info->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   info->set_class_name(*Utils::OpenHandle(*name));
 }
 
 void FunctionTemplate::SetAcceptAnyReceiver(bool value) {
-  auto info = Utils::OpenHandle(this);
+  auto info = Utils::OpenDirectHandle(this);
   EnsureNotPublished(info, "v8::FunctionTemplate::SetAcceptAnyReceiver");
-  auto i_isolate = info->GetIsolate();
+  i::Isolate* i_isolate = info->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   info->set_accept_any_receiver(value);
 }
 
 void FunctionTemplate::ReadOnlyPrototype() {
-  auto info = Utils::OpenHandle(this);
+  auto info = Utils::OpenDirectHandle(this);
   EnsureNotPublished(info, "v8::FunctionTemplate::ReadOnlyPrototype");
-  auto i_isolate = info->GetIsolate();
+  i::Isolate* i_isolate = info->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   info->set_read_only_prototype(true);
 }
 
 void FunctionTemplate::RemovePrototype() {
-  auto info = Utils::OpenHandle(this);
+  auto info = Utils::OpenDirectHandle(this);
   EnsureNotPublished(info, "v8::FunctionTemplate::RemovePrototype");
-  auto i_isolate = info->GetIsolate();
+  i::Isolate* i_isolate = info->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   info->set_remove_prototype(true);
 }
@@ -1743,9 +1570,11 @@ namespace {
 // constructor is available we create one.
 i::Handle<i::FunctionTemplateInfo> EnsureConstructor(
     i::Isolate* i_isolate, ObjectTemplate* object_template) {
-  i::Object obj = Utils::OpenHandle(object_template)->constructor();
-  if (!obj.IsUndefined(i_isolate)) {
-    i::FunctionTemplateInfo info = i::FunctionTemplateInfo::cast(obj);
+  i::Tagged<i::Object> obj =
+      Utils::OpenDirectHandle(object_template)->constructor();
+  if (!IsUndefined(obj, i_isolate)) {
+    i::Tagged<i::FunctionTemplateInfo> info =
+        i::FunctionTemplateInfo::cast(obj);
     return i::Handle<i::FunctionTemplateInfo>(info, i_isolate);
   }
   Local<FunctionTemplate> templ =
@@ -1753,7 +1582,7 @@ i::Handle<i::FunctionTemplateInfo> EnsureConstructor(
   i::Handle<i::FunctionTemplateInfo> constructor = Utils::OpenHandle(*templ);
   i::FunctionTemplateInfo::SetInstanceTemplate(
       i_isolate, constructor, Utils::OpenHandle(object_template));
-  Utils::OpenHandle(object_template)->set_constructor(*constructor);
+  Utils::OpenDirectHandle(object_template)->set_constructor(*constructor);
   return constructor;
 }
 
@@ -1765,7 +1594,7 @@ void TemplateSetAccessor(Template* template_obj, v8::Local<Name> name,
                          SideEffectType getter_side_effect_type,
                          SideEffectType setter_side_effect_type) {
   auto info = Utils::OpenHandle(template_obj);
-  auto i_isolate = info->GetIsolate();
+  auto i_isolate = info->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   i::Handle<i::AccessorInfo> accessor_info =
@@ -1773,11 +1602,11 @@ void TemplateSetAccessor(Template* template_obj, v8::Local<Name> name,
                        is_special_data_property, replace_on_access);
   {
     i::DisallowGarbageCollection no_gc;
-    i::AccessorInfo raw = *accessor_info;
-    raw.set_initial_property_attributes(
+    i::Tagged<i::AccessorInfo> raw = *accessor_info;
+    raw->set_initial_property_attributes(
         static_cast<i::PropertyAttributes>(attribute));
-    raw.set_getter_side_effect_type(getter_side_effect_type);
-    raw.set_setter_side_effect_type(setter_side_effect_type);
+    raw->set_getter_side_effect_type(getter_side_effect_type);
+    raw->set_setter_side_effect_type(setter_side_effect_type);
   }
   i::ApiNatives::AddNativeDataProperty(i_isolate, info, accessor_info);
 }
@@ -1824,7 +1653,7 @@ void Template::SetLazyDataProperty(v8::Local<Name> name,
 void Template::SetIntrinsicDataProperty(Local<Name> name, Intrinsic intrinsic,
                                         PropertyAttribute attribute) {
   auto templ = Utils::OpenHandle(this);
-  i::Isolate* i_isolate = templ->GetIsolate();
+  i::Isolate* i_isolate = templ->GetIsolateChecked();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   i::ApiNatives::AddDataProperty(i_isolate, templ, Utils::OpenHandle(*name),
@@ -1871,14 +1700,18 @@ i::Handle<i::InterceptorInfo> CreateInterceptorInfo(
   if (getter != nullptr) SET_FIELD_WRAPPED(i_isolate, obj, set_getter, getter);
   if (setter != nullptr) SET_FIELD_WRAPPED(i_isolate, obj, set_setter, setter);
   if (query != nullptr) SET_FIELD_WRAPPED(i_isolate, obj, set_query, query);
-  if (descriptor != nullptr)
+  if (descriptor != nullptr) {
     SET_FIELD_WRAPPED(i_isolate, obj, set_descriptor, descriptor);
-  if (remover != nullptr)
+  }
+  if (remover != nullptr) {
     SET_FIELD_WRAPPED(i_isolate, obj, set_deleter, remover);
-  if (enumerator != nullptr)
+  }
+  if (enumerator != nullptr) {
     SET_FIELD_WRAPPED(i_isolate, obj, set_enumerator, enumerator);
-  if (definer != nullptr)
+  }
+  if (definer != nullptr) {
     SET_FIELD_WRAPPED(i_isolate, obj, set_definer, definer);
+  }
   obj->set_can_intercept_symbols(
       !(static_cast<int>(flags) &
         static_cast<int>(PropertyHandlerFlags::kOnlyInterceptStrings)));
@@ -1893,7 +1726,7 @@ i::Handle<i::InterceptorInfo> CreateInterceptorInfo(
   if (data.IsEmpty()) {
     data = v8::Undefined(reinterpret_cast<v8::Isolate*>(i_isolate));
   }
-  obj->set_data(*Utils::OpenHandle(*data));
+  obj->set_data(*Utils::OpenDirectHandle(*data));
   return obj;
 }
 
@@ -1950,7 +1783,7 @@ void ObjectTemplate::SetHandler(
 }
 
 void ObjectTemplate::MarkAsUndetectable() {
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   auto cons = EnsureConstructor(i_isolate, this);
@@ -1960,7 +1793,7 @@ void ObjectTemplate::MarkAsUndetectable() {
 
 void ObjectTemplate::SetAccessCheckCallback(AccessCheckCallback callback,
                                             Local<Value> data) {
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   auto cons = EnsureConstructor(i_isolate, this);
@@ -1978,7 +1811,7 @@ void ObjectTemplate::SetAccessCheckCallback(AccessCheckCallback callback,
   if (data.IsEmpty()) {
     data = v8::Undefined(reinterpret_cast<v8::Isolate*>(i_isolate));
   }
-  info->set_data(*Utils::OpenHandle(*data));
+  info->set_data(*Utils::OpenDirectHandle(*data));
 
   i::FunctionTemplateInfo::SetAccessCheckInfo(i_isolate, cons, info);
   cons->set_needs_access_check(true);
@@ -1989,7 +1822,7 @@ void ObjectTemplate::SetAccessCheckCallbackAndHandler(
     const NamedPropertyHandlerConfiguration& named_handler,
     const IndexedPropertyHandlerConfiguration& indexed_handler,
     Local<Value> data) {
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   auto cons = EnsureConstructor(i_isolate, this);
@@ -2018,7 +1851,7 @@ void ObjectTemplate::SetAccessCheckCallbackAndHandler(
   if (data.IsEmpty()) {
     data = v8::Undefined(reinterpret_cast<v8::Isolate*>(i_isolate));
   }
-  info->set_data(*Utils::OpenHandle(*data));
+  info->set_data(*Utils::OpenDirectHandle(*data));
 
   i::FunctionTemplateInfo::SetAccessCheckInfo(i_isolate, cons, info);
   cons->set_needs_access_check(true);
@@ -2026,7 +1859,7 @@ void ObjectTemplate::SetAccessCheckCallbackAndHandler(
 
 void ObjectTemplate::SetHandler(
     const IndexedPropertyHandlerConfiguration& config) {
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   auto cons = EnsureConstructor(i_isolate, this);
@@ -2040,27 +1873,28 @@ void ObjectTemplate::SetHandler(
 
 void ObjectTemplate::SetCallAsFunctionHandler(FunctionCallback callback,
                                               Local<Value> data) {
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   auto cons = EnsureConstructor(i_isolate, this);
   EnsureNotPublished(cons, "v8::ObjectTemplate::SetCallAsFunctionHandler");
   i::Handle<i::CallHandlerInfo> obj =
       i_isolate->factory()->NewCallHandlerInfo();
+  obj->set_owner_template(*Utils::OpenDirectHandle(this));
   obj->set_callback(i_isolate, reinterpret_cast<i::Address>(callback));
   if (data.IsEmpty()) {
     data = v8::Undefined(reinterpret_cast<v8::Isolate*>(i_isolate));
   }
-  obj->set_data(*Utils::OpenHandle(*data));
+  obj->set_data(*Utils::OpenDirectHandle(*data));
   i::FunctionTemplateInfo::SetInstanceCallHandler(i_isolate, cons, obj);
 }
 
 int ObjectTemplate::InternalFieldCount() const {
-  return Utils::OpenHandle(this)->embedder_field_count();
+  return Utils::OpenDirectHandle(this)->embedder_field_count();
 }
 
 void ObjectTemplate::SetInternalFieldCount(int value) {
-  i::Isolate* i_isolate = Utils::OpenHandle(this)->GetIsolate();
+  i::Isolate* i_isolate = Utils::OpenDirectHandle(this)->GetIsolate();
   if (!Utils::ApiCheck(i::Smi::IsValid(value),
                        "v8::ObjectTemplate::SetInternalFieldCount()",
                        "Invalid embedder field count")) {
@@ -2073,26 +1907,26 @@ void ObjectTemplate::SetInternalFieldCount(int value) {
     // function to do the setting.
     EnsureConstructor(i_isolate, this);
   }
-  Utils::OpenHandle(this)->set_embedder_field_count(value);
+  Utils::OpenDirectHandle(this)->set_embedder_field_count(value);
 }
 
 bool ObjectTemplate::IsImmutableProto() const {
-  return Utils::OpenHandle(this)->immutable_proto();
+  return Utils::OpenDirectHandle(this)->immutable_proto();
 }
 
 void ObjectTemplate::SetImmutableProto() {
-  auto self = Utils::OpenHandle(this);
+  auto self = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   self->set_immutable_proto(true);
 }
 
 bool ObjectTemplate::IsCodeLike() const {
-  return Utils::OpenHandle(this)->code_like();
+  return Utils::OpenDirectHandle(this)->code_like();
 }
 
 void ObjectTemplate::SetCodeLike() {
-  auto self = Utils::OpenHandle(this);
+  auto self = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   self->set_code_like(true);
@@ -2136,17 +1970,18 @@ Local<Script> UnboundScript::BindToCurrentContext() {
 }
 
 int UnboundScript::GetId() const {
-  i::Handle<i::SharedFunctionInfo> function_info = Utils::OpenHandle(this);
+  i::DirectHandle<i::SharedFunctionInfo> function_info =
+      Utils::OpenDirectHandle(this);
   // TODO(jgruber): Remove this DCHECK once Function::GetUnboundScript is gone.
   DCHECK(!function_info->InReadOnlySpace());
   API_RCS_SCOPE(i::GetIsolateFromWritableObject(*function_info), UnboundScript,
                 GetId);
-  return i::Script::cast(function_info->script()).id();
+  return i::Script::cast(function_info->script())->id();
 }
 
 int UnboundScript::GetLineNumber(int code_pos) {
-  i::Handle<i::SharedFunctionInfo> obj = Utils::OpenHandle(this);
-  if (obj->script().IsScript()) {
+  i::DirectHandle<i::SharedFunctionInfo> obj = Utils::OpenDirectHandle(this);
+  if (i::IsScript(obj->script())) {
     // TODO(jgruber): Remove this DCHECK once Function::GetUnboundScript is
     // gone.
     DCHECK(!obj->InReadOnlySpace());
@@ -2161,8 +1996,8 @@ int UnboundScript::GetLineNumber(int code_pos) {
 }
 
 int UnboundScript::GetColumnNumber(int code_pos) {
-  i::Handle<i::SharedFunctionInfo> obj = Utils::OpenHandle(this);
-  if (obj->script().IsScript()) {
+  i::DirectHandle<i::SharedFunctionInfo> obj = Utils::OpenDirectHandle(this);
+  if (i::IsScript(obj->script())) {
     // TODO(jgruber): Remove this DCHECK once Function::GetUnboundScript is
     // gone.
     DCHECK(!obj->InReadOnlySpace());
@@ -2177,80 +2012,87 @@ int UnboundScript::GetColumnNumber(int code_pos) {
 }
 
 Local<Value> UnboundScript::GetScriptName() {
-  i::Handle<i::SharedFunctionInfo> obj = Utils::OpenHandle(this);
-  if (obj->script().IsScript()) {
+  i::DirectHandle<i::SharedFunctionInfo> obj = Utils::OpenDirectHandle(this);
+  if (i::IsScript(obj->script())) {
     // TODO(jgruber): Remove this DCHECK once Function::GetUnboundScript is
     // gone.
     DCHECK(!obj->InReadOnlySpace());
     i::Isolate* i_isolate = i::GetIsolateFromWritableObject(*obj);
     ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
     API_RCS_SCOPE(i_isolate, UnboundScript, GetName);
-    i::Object name = i::Script::cast(obj->script()).name();
-    return Utils::ToLocal(i::Handle<i::Object>(name, i_isolate));
+    i::Tagged<i::Object> name = i::Script::cast(obj->script())->name();
+    return Utils::ToLocal(i::DirectHandle<i::Object>(name, i_isolate),
+                          i_isolate);
   } else {
     return Local<String>();
   }
 }
 
 Local<Value> UnboundScript::GetSourceURL() {
-  i::Handle<i::SharedFunctionInfo> obj = Utils::OpenHandle(this);
-  if (obj->script().IsScript()) {
+  i::DirectHandle<i::SharedFunctionInfo> obj = Utils::OpenDirectHandle(this);
+  if (i::IsScript(obj->script())) {
     // TODO(jgruber): Remove this DCHECK once Function::GetUnboundScript is
     // gone.
     DCHECK(!obj->InReadOnlySpace());
     i::Isolate* i_isolate = i::GetIsolateFromWritableObject(*obj);
     API_RCS_SCOPE(i_isolate, UnboundScript, GetSourceURL);
     ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-    i::Object url = i::Script::cast(obj->script()).source_url();
-    return Utils::ToLocal(i::Handle<i::Object>(url, i_isolate));
+    i::Tagged<i::Object> url = i::Script::cast(obj->script())->source_url();
+    return Utils::ToLocal(i::DirectHandle<i::Object>(url, i_isolate),
+                          i_isolate);
   } else {
     return Local<String>();
   }
 }
 
 Local<Value> UnboundScript::GetSourceMappingURL() {
-  i::Handle<i::SharedFunctionInfo> obj = Utils::OpenHandle(this);
-  if (obj->script().IsScript()) {
+  i::DirectHandle<i::SharedFunctionInfo> obj = Utils::OpenDirectHandle(this);
+  if (i::IsScript(obj->script())) {
     // TODO(jgruber): Remove this DCHECK once Function::GetUnboundScript is
     // gone.
     DCHECK(!obj->InReadOnlySpace());
     i::Isolate* i_isolate = i::GetIsolateFromWritableObject(*obj);
     API_RCS_SCOPE(i_isolate, UnboundScript, GetSourceMappingURL);
     ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-    i::Object url = i::Script::cast(obj->script()).source_mapping_url();
-    return Utils::ToLocal(i::Handle<i::Object>(url, i_isolate));
+    i::Tagged<i::Object> url =
+        i::Script::cast(obj->script())->source_mapping_url();
+    return Utils::ToLocal(i::DirectHandle<i::Object>(url, i_isolate),
+                          i_isolate);
   } else {
     return Local<String>();
   }
 }
 
 Local<Value> UnboundModuleScript::GetSourceURL() {
-  i::Handle<i::SharedFunctionInfo> obj = Utils::OpenHandle(this);
-  if (obj->script().IsScript()) {
+  i::DirectHandle<i::SharedFunctionInfo> obj = Utils::OpenDirectHandle(this);
+  if (i::IsScript(obj->script())) {
     // TODO(jgruber): Remove this DCHECK once Function::GetUnboundScript is
     // gone.
     DCHECK(!obj->InReadOnlySpace());
     i::Isolate* i_isolate = i::GetIsolateFromWritableObject(*obj);
     API_RCS_SCOPE(i_isolate, UnboundModuleScript, GetSourceURL);
     ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-    i::Object url = i::Script::cast(obj->script()).source_url();
-    return Utils::ToLocal(i::Handle<i::Object>(url, i_isolate));
+    i::Tagged<i::Object> url = i::Script::cast(obj->script())->source_url();
+    return Utils::ToLocal(i::DirectHandle<i::Object>(url, i_isolate),
+                          i_isolate);
   } else {
     return Local<String>();
   }
 }
 
 Local<Value> UnboundModuleScript::GetSourceMappingURL() {
-  i::Handle<i::SharedFunctionInfo> obj = Utils::OpenHandle(this);
-  if (obj->script().IsScript()) {
+  i::DirectHandle<i::SharedFunctionInfo> obj = Utils::OpenDirectHandle(this);
+  if (i::IsScript(obj->script())) {
     // TODO(jgruber): Remove this DCHECK once Function::GetUnboundScript is
     // gone.
     DCHECK(!obj->InReadOnlySpace());
     i::Isolate* i_isolate = i::GetIsolateFromWritableObject(*obj);
     API_RCS_SCOPE(i_isolate, UnboundModuleScript, GetSourceMappingURL);
     ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-    i::Object url = i::Script::cast(obj->script()).source_mapping_url();
-    return Utils::ToLocal(i::Handle<i::Object>(url, i_isolate));
+    i::Tagged<i::Object> url =
+        i::Script::cast(obj->script())->source_mapping_url();
+    return Utils::ToLocal(i::DirectHandle<i::Object>(url, i_isolate),
+                          i_isolate);
   } else {
     return Local<String>();
   }
@@ -2290,7 +2132,7 @@ MaybeLocal<Value> Script::Run(Local<Context> context,
   i::Handle<i::Object> receiver = i_isolate->global_proxy();
   // TODO(cbruni, chromium:1244145): Remove once migrated to the context.
   i::Handle<i::Object> options(
-      i::Script::cast(fun->shared().script()).host_defined_options(),
+      i::Script::cast(fun->shared()->script())->host_defined_options(),
       i_isolate);
   Local<Value> result;
   has_pending_exception = !ToLocal<Value>(
@@ -2301,59 +2143,61 @@ MaybeLocal<Value> Script::Run(Local<Context> context,
 }
 
 Local<Value> ScriptOrModule::GetResourceName() {
-  i::Handle<i::ScriptOrModule> obj = Utils::OpenHandle(this);
+  i::DirectHandle<i::ScriptOrModule> obj = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = i::GetIsolateFromWritableObject(*obj);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  i::Handle<i::Object> val(obj->resource_name(), i_isolate);
-  return ToApiHandle<Value>(val);
+  i::DirectHandle<i::Object> val(obj->resource_name(), i_isolate);
+  return ToApiHandle<Value>(val, i_isolate);
 }
 
 Local<Data> ScriptOrModule::HostDefinedOptions() {
-  i::Handle<i::ScriptOrModule> obj = Utils::OpenHandle(this);
+  i::DirectHandle<i::ScriptOrModule> obj = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = i::GetIsolateFromWritableObject(*obj);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  i::Handle<i::Object> val(obj->host_defined_options(), i_isolate);
-  return ToApiHandle<Data>(val);
+  i::DirectHandle<i::Object> val(obj->host_defined_options(), i_isolate);
+  return ToApiHandle<Data>(val, i_isolate);
 }
 
 Local<UnboundScript> Script::GetUnboundScript() {
   i::DisallowGarbageCollection no_gc;
-  i::Handle<i::JSFunction> obj = Utils::OpenHandle(this);
-  i::Handle<i::SharedFunctionInfo> sfi =
+  i::DirectHandle<i::JSFunction> obj = Utils::OpenDirectHandle(this);
+  i::DirectHandle<i::SharedFunctionInfo> sfi =
       i::handle(obj->shared(), obj->GetIsolate());
   DCHECK(!sfi->InReadOnlySpace());
-  return ToApiHandle<UnboundScript>(sfi);
+  return ToApiHandle<UnboundScript>(sfi, obj->GetIsolate());
 }
 
 Local<Value> Script::GetResourceName() {
   i::DisallowGarbageCollection no_gc;
-  i::Handle<i::JSFunction> func = Utils::OpenHandle(this);
-  i::SharedFunctionInfo sfi = func->shared();
-  CHECK(sfi.script().IsScript());
-  return ToApiHandle<Value>(
-      i::handle(i::Script::cast(sfi.script()).name(), func->GetIsolate()));
+  i::DirectHandle<i::JSFunction> func = Utils::OpenDirectHandle(this);
+  i::Tagged<i::SharedFunctionInfo> sfi = func->shared();
+  CHECK(IsScript(sfi->script()));
+  i::DirectHandle<i::Object> name(i::Script::cast(sfi->script())->name(),
+                                  func->GetIsolate());
+  return ToApiHandle<Value>(name, func->GetIsolate());
 }
 
 std::vector<int> Script::GetProducedCompileHints() const {
   i::DisallowGarbageCollection no_gc;
-  i::Handle<i::JSFunction> func = Utils::OpenHandle(this);
+  i::DirectHandle<i::JSFunction> func = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = func->GetIsolate();
-  i::SharedFunctionInfo sfi = func->shared();
-  CHECK(sfi.script().IsScript());
-  i::Script script = i::Script::cast(sfi.script());
-  i::Object maybe_array_list = script.compiled_lazy_function_positions();
+  i::Tagged<i::SharedFunctionInfo> sfi = func->shared();
+  CHECK(IsScript(sfi->script()));
+  i::Tagged<i::Script> script = i::Script::cast(sfi->script());
+  i::Tagged<i::Object> maybe_array_list =
+      script->compiled_lazy_function_positions();
   std::vector<int> result;
-  if (!maybe_array_list.IsUndefined(i_isolate)) {
-    i::ArrayList array_list = i::ArrayList::cast(maybe_array_list);
-    result.reserve(array_list.Length());
-    for (int i = 0; i < array_list.Length(); ++i) {
-      i::Object item = array_list.Get(i);
-      CHECK(item.IsSmi());
+  if (!IsUndefined(maybe_array_list, i_isolate)) {
+    i::Tagged<i::ArrayList> array_list = i::ArrayList::cast(maybe_array_list);
+    result.reserve(array_list->Length());
+    for (int i = 0; i < array_list->Length(); ++i) {
+      i::Tagged<i::Object> item = array_list->Get(i);
+      CHECK(IsSmi(item));
       result.push_back(i::Smi::ToInt(item));
     }
     // Clear the data; the embedder can still request more data later, but it'll
     // have to keep track of the original data itself.
-    script.set_compiled_lazy_function_positions(
+    script->set_compiled_lazy_function_positions(
         i::ReadOnlyRoots(i_isolate).undefined_value());
   }
   return result;
@@ -2370,75 +2214,76 @@ Local<PrimitiveArray> PrimitiveArray::New(Isolate* v8_isolate, int length) {
 }
 
 int PrimitiveArray::Length() const {
-  i::Handle<i::FixedArray> array = Utils::OpenHandle(this);
+  i::DirectHandle<i::FixedArray> array = Utils::OpenDirectHandle(this);
   return array->length();
 }
 
 void PrimitiveArray::Set(Isolate* v8_isolate, int index,
                          Local<Primitive> item) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
-  i::Handle<i::FixedArray> array = Utils::OpenHandle(this);
+  i::DirectHandle<i::FixedArray> array = Utils::OpenDirectHandle(this);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   Utils::ApiCheck(index >= 0 && index < array->length(),
                   "v8::PrimitiveArray::Set",
                   "index must be greater than or equal to 0 and less than the "
                   "array length");
-  i::Handle<i::Object> i_item = Utils::OpenHandle(*item);
+  i::DirectHandle<i::Object> i_item = Utils::OpenDirectHandle(*item);
   array->set(index, *i_item);
 }
 
 Local<Primitive> PrimitiveArray::Get(Isolate* v8_isolate, int index) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
-  i::Handle<i::FixedArray> array = Utils::OpenHandle(this);
+  i::DirectHandle<i::FixedArray> array = Utils::OpenDirectHandle(this);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   Utils::ApiCheck(index >= 0 && index < array->length(),
                   "v8::PrimitiveArray::Get",
                   "index must be greater than or equal to 0 and less than the "
                   "array length");
-  i::Handle<i::Object> i_item(array->get(index), i_isolate);
-  return ToApiHandle<Primitive>(i_item);
+  i::DirectHandle<i::Object> i_item(array->get(index), i_isolate);
+  return ToApiHandle<Primitive>(i_item, i_isolate);
 }
 
 void v8::PrimitiveArray::CheckCast(v8::Data* that) {
-  i::Handle<i::Object> obj = Utils::OpenHandle(that);
+  i::DirectHandle<i::Object> obj = Utils::OpenDirectHandle(that);
   Utils::ApiCheck(
-      obj->IsFixedArray(), "v8::PrimitiveArray::Cast",
+      i::IsFixedArray(*obj), "v8::PrimitiveArray::Cast",
       "Value is not a PrimitiveArray; this is a temporary issue, v8::Data and "
       "v8::PrimitiveArray will not be compatible in the future");
 }
 
 int FixedArray::Length() const {
-  i::Handle<i::FixedArray> self = Utils::OpenHandle(this);
+  i::DirectHandle<i::FixedArray> self = Utils::OpenDirectHandle(this);
   return self->length();
 }
 
 Local<Data> FixedArray::Get(Local<Context> context, int i) const {
-  i::Handle<i::FixedArray> self = Utils::OpenHandle(this);
+  i::DirectHandle<i::FixedArray> self = Utils::OpenDirectHandle(this);
   auto i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
   CHECK_LT(i, self->length());
-  i::Handle<i::Object> entry(self->get(i), i_isolate);
-  return ToApiHandle<Data>(entry);
+  i::DirectHandle<i::Object> entry(self->get(i), i_isolate);
+  return ToApiHandle<Data>(entry, i_isolate);
 }
 
 Local<String> ModuleRequest::GetSpecifier() const {
-  i::Handle<i::ModuleRequest> self = Utils::OpenHandle(this);
+  i::DirectHandle<i::ModuleRequest> self = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
-  return ToApiHandle<String>(i::handle(self->specifier(), i_isolate));
+  return ToApiHandle<String>(i::direct_handle(self->specifier(), i_isolate),
+                             i_isolate);
 }
 
 int ModuleRequest::GetSourceOffset() const {
-  return Utils::OpenHandle(this)->position();
+  return Utils::OpenDirectHandle(this)->position();
 }
 
 Local<FixedArray> ModuleRequest::GetImportAssertions() const {
-  i::Handle<i::ModuleRequest> self = Utils::OpenHandle(this);
+  i::DirectHandle<i::ModuleRequest> self = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
   return ToApiHandle<FixedArray>(
-      i::handle(self->import_assertions(), i_isolate));
+      i::direct_handle(self->import_assertions(), i_isolate), i_isolate);
 }
 
 Module::Status Module::GetStatus() const {
-  i::Handle<i::Module> self = Utils::OpenHandle(this);
+  i::DirectHandle<i::Module> self = Utils::OpenDirectHandle(this);
   switch (self->status()) {
     case i::Module::kUnlinked:
     case i::Module::kPreLinking:
@@ -2461,26 +2306,29 @@ Module::Status Module::GetStatus() const {
 Local<Value> Module::GetException() const {
   Utils::ApiCheck(GetStatus() == kErrored, "v8::Module::GetException",
                   "Module status must be kErrored");
-  i::Handle<i::Module> self = Utils::OpenHandle(this);
+  i::DirectHandle<i::Module> self = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  return ToApiHandle<Value>(i::handle(self->GetException(), i_isolate));
+  return ToApiHandle<Value>(i::direct_handle(self->GetException(), i_isolate),
+                            i_isolate);
 }
 
 Local<FixedArray> Module::GetModuleRequests() const {
-  i::Handle<i::Module> self = Utils::OpenHandle(this);
+  i::DirectHandle<i::Module> self = Utils::OpenDirectHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
   DCHECK_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  if (self->IsSyntheticModule()) {
+  if (i::IsSyntheticModule(*self)) {
     // Synthetic modules are leaf nodes in the module graph. They have no
     // ModuleRequests.
     return ToApiHandle<FixedArray>(
         self->GetReadOnlyRoots().empty_fixed_array_handle());
   } else {
-    i::Handle<i::FixedArray> module_requests(
-        i::Handle<i::SourceTextModule>::cast(self)->info().module_requests(),
+    i::DirectHandle<i::FixedArray> module_requests(
+        i::DirectHandle<i::SourceTextModule>::cast(self)
+            ->info()
+            ->module_requests(),
         i_isolate);
-    return ToApiHandle<FixedArray>(module_requests);
+    return ToApiHandle<FixedArray>(module_requests, i_isolate);
   }
 }
 
@@ -2490,12 +2338,12 @@ Location Module::SourceOffsetToLocation(int offset) const {
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   Utils::ApiCheck(
-      self->IsSourceTextModule(), "v8::Module::SourceOffsetToLocation",
+      i::IsSourceTextModule(*self), "v8::Module::SourceOffsetToLocation",
       "v8::Module::SourceOffsetToLocation must be used on an SourceTextModule");
   i::Handle<i::Script> script(
       i::Handle<i::SourceTextModule>::cast(self)->GetScript(), i_isolate);
   i::Script::PositionInfo info;
-  i::Script::GetPositionInfo(script, offset, &info, i::Script::WITH_OFFSET);
+  i::Script::GetPositionInfo(script, offset, &info);
   return v8::Location(info.line, info.column);
 }
 
@@ -2512,49 +2360,50 @@ Local<Value> Module::GetModuleNamespace() {
 }
 
 Local<UnboundModuleScript> Module::GetUnboundModuleScript() {
-  i::Handle<i::Module> self = Utils::OpenHandle(this);
+  i::DirectHandle<i::Module> self = Utils::OpenDirectHandle(this);
   Utils::ApiCheck(
-      self->IsSourceTextModule(), "v8::Module::GetUnboundModuleScript",
+      i::IsSourceTextModule(*self), "v8::Module::GetUnboundModuleScript",
       "v8::Module::GetUnboundModuleScript must be used on an SourceTextModule");
   auto i_isolate = self->GetIsolate();
   DCHECK_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  return ToApiHandle<UnboundModuleScript>(i::handle(
-      i::Handle<i::SourceTextModule>::cast(self)->GetSharedFunctionInfo(),
-      i_isolate));
+  i::DirectHandle<i::Object> shared_info(
+      i::DirectHandle<i::SourceTextModule>::cast(self)->GetSharedFunctionInfo(),
+      i_isolate);
+  return ToApiHandle<UnboundModuleScript>(shared_info, i_isolate);
 }
 
 int Module::ScriptId() const {
-  i::Module self = *Utils::OpenHandle(this);
-  Utils::ApiCheck(self.IsSourceTextModule(), "v8::Module::ScriptId",
+  i::Tagged<i::Module> self = *Utils::OpenDirectHandle(this);
+  Utils::ApiCheck(i::IsSourceTextModule(self), "v8::Module::ScriptId",
                   "v8::Module::ScriptId must be used on an SourceTextModule");
-  DCHECK_NO_SCRIPT_NO_EXCEPTION(self.GetIsolate());
-  return i::SourceTextModule::cast(self).GetScript().id();
+  DCHECK_NO_SCRIPT_NO_EXCEPTION(self->GetIsolate());
+  return i::SourceTextModule::cast(self)->GetScript()->id();
 }
 
 bool Module::IsGraphAsync() const {
   Utils::ApiCheck(
       GetStatus() >= kInstantiated, "v8::Module::IsGraphAsync",
       "v8::Module::IsGraphAsync must be used on an instantiated module");
-  i::Module self = *Utils::OpenHandle(this);
-  auto i_isolate = self.GetIsolate();
+  i::Tagged<i::Module> self = *Utils::OpenDirectHandle(this);
+  auto i_isolate = self->GetIsolate();
   DCHECK_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  return self.IsGraphAsync(i_isolate);
+  return self->IsGraphAsync(i_isolate);
 }
 
 bool Module::IsSourceTextModule() const {
-  auto self = Utils::OpenHandle(this);
+  auto self = Utils::OpenDirectHandle(this);
   DCHECK_NO_SCRIPT_NO_EXCEPTION(self->GetIsolate());
-  return self->IsSourceTextModule();
+  return i::IsSourceTextModule(*self);
 }
 
 bool Module::IsSyntheticModule() const {
-  auto self = Utils::OpenHandle(this);
+  auto self = Utils::OpenDirectHandle(this);
   DCHECK_NO_SCRIPT_NO_EXCEPTION(self->GetIsolate());
-  return self->IsSyntheticModule();
+  return i::IsSyntheticModule(*self);
 }
 
 int Module::GetIdentityHash() const {
-  auto self = Utils::OpenHandle(this);
+  auto self = Utils::OpenDirectHandle(this);
   DCHECK_NO_SCRIPT_NO_EXCEPTION(self->GetIsolate());
   return self->hash();
 }
@@ -2618,7 +2467,7 @@ Maybe<bool> Module::SetSyntheticModuleExport(Isolate* v8_isolate,
   i::Handle<i::String> i_export_name = Utils::OpenHandle(*export_name);
   i::Handle<i::Object> i_export_value = Utils::OpenHandle(*export_value);
   i::Handle<i::Module> self = Utils::OpenHandle(this);
-  Utils::ApiCheck(self->IsSyntheticModule(),
+  Utils::ApiCheck(i::IsSyntheticModule(*self),
                   "v8::Module::SyntheticModuleSetExport",
                   "v8::Module::SyntheticModuleSetExport must only be called on "
                   "a SyntheticModule");
@@ -2637,7 +2486,7 @@ std::vector<std::tuple<Local<Module>, Local<Message>>>
 Module::GetStalledTopLevelAwaitMessage(Isolate* isolate) {
   auto i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   i::Handle<i::Module> self = Utils::OpenHandle(this);
-  Utils::ApiCheck(self->IsSourceTextModule(),
+  Utils::ApiCheck(i::IsSourceTextModule(*self),
                   "v8::Module::GetStalledTopLevelAwaitMessage",
                   "v8::Module::GetStalledTopLevelAwaitMessage must only be "
                   "called on a SourceTextModule");
@@ -2832,7 +2681,7 @@ MaybeLocal<Function> ScriptCompiler::CompileFunctionInternal(
 
     i::Handle<i::Context> context = Utils::OpenHandle(*v8_context);
 
-    DCHECK(context->IsNativeContext());
+    DCHECK(IsNativeContext(*context));
 
     i::Handle<i::FixedArray> arguments_list =
         i_isolate->factory()->NewFixedArray(static_cast<int>(arguments_count));
@@ -2846,12 +2695,12 @@ MaybeLocal<Function> ScriptCompiler::CompileFunctionInternal(
     for (size_t i = 0; i < context_extension_count; ++i) {
       i::Handle<i::JSReceiver> extension =
           Utils::OpenHandle(*context_extensions[i]);
-      if (!extension->IsJSObject()) return Local<Function>();
+      if (!IsJSObject(*extension)) return Local<Function>();
       context = i_isolate->factory()->NewWithContext(
           context,
           i::ScopeInfo::CreateForWithScope(
               i_isolate,
-              context->IsNativeContext()
+              IsNativeContext(*context)
                   ? i::Handle<i::ScopeInfo>::null()
                   : i::Handle<i::ScopeInfo>(context->scope_info(), i_isolate)),
           extension);
@@ -2909,17 +2758,19 @@ void ScriptCompiler::ScriptStreamingTask::Run() { data_->task->Run(); }
 
 ScriptCompiler::ScriptStreamingTask* ScriptCompiler::StartStreaming(
     Isolate* v8_isolate, StreamedSource* source, v8::ScriptType type,
-    CompileOptions options) {
-  Utils::ApiCheck(options == kNoCompileOptions || options == kEagerCompile ||
-                      options == kProduceCompileHints,
-                  "v8::ScriptCompiler::StartStreaming",
-                  "Invalid CompileOptions");
+    CompileOptions options, CompileHintCallback compile_hint_callback,
+    void* compile_hint_callback_data) {
+  Utils::ApiCheck(
+      options == kNoCompileOptions || options == kEagerCompile ||
+          options == kProduceCompileHints || options == kConsumeCompileHints,
+      "v8::ScriptCompiler::StartStreaming", "Invalid CompileOptions");
   if (!i::v8_flags.script_streaming) return nullptr;
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   i::ScriptStreamingData* data = source->impl();
   std::unique_ptr<i::BackgroundCompileTask> task =
-      std::make_unique<i::BackgroundCompileTask>(data, i_isolate, type,
-                                                 options);
+      std::make_unique<i::BackgroundCompileTask>(data, i_isolate, type, options,
+                                                 compile_hint_callback,
+                                                 compile_hint_callback_data);
   data->task = std::move(task);
   return new ScriptCompiler::ScriptStreamingTask(data);
 }
@@ -3130,8 +2981,8 @@ void v8::TryCatch::operator delete(void*, size_t) { base::OS::Abort(); }
 void v8::TryCatch::operator delete[](void*, size_t) { base::OS::Abort(); }
 
 bool v8::TryCatch::HasCaught() const {
-  return !i::Object(reinterpret_cast<i::Address>(exception_))
-              .IsTheHole(i_isolate_);
+  return !IsTheHole(i::Object(reinterpret_cast<i::Address>(exception_)),
+                    i_isolate_);
 }
 
 bool v8::TryCatch::CanContinue() const { return can_continue_; }
@@ -3147,7 +2998,7 @@ v8::Local<v8::Value> v8::TryCatch::ReThrow() {
 v8::Local<Value> v8::TryCatch::Exception() const {
   if (HasCaught()) {
     // Check for out of memory exception.
-    i::Object exception(reinterpret_cast<i::Address>(exception_));
+    i::Tagged<i::Object> exception(reinterpret_cast<i::Address>(exception_));
     return v8::Utils::ToLocal(i::Handle<i::Object>(exception, i_isolate_));
   } else {
     return v8::Local<Value>();
@@ -3157,7 +3008,7 @@ v8::Local<Value> v8::TryCatch::Exception() const {
 MaybeLocal<Value> v8::TryCatch::StackTrace(Local<Context> context,
                                            Local<Value> exception) {
   i::Handle<i::Object> i_exception = Utils::OpenHandle(*exception);
-  if (!i_exception->IsJSObject()) return v8::Local<Value>();
+  if (!IsJSObject(*i_exception)) return v8::Local<Value>();
   PREPARE_FOR_EXECUTION(context, TryCatch, StackTrace, Value);
   auto obj = i::Handle<i::JSObject>::cast(i_exception);
   i::Handle<i::String> name = i_isolate->factory()->stack_string();
@@ -3178,9 +3029,9 @@ MaybeLocal<Value> v8::TryCatch::StackTrace(Local<Context> context) const {
 }
 
 v8::Local<v8::Message> v8::TryCatch::Message() const {
-  i::Object message(reinterpret_cast<i::Address>(message_obj_));
-  DCHECK(message.IsJSMessageObject() || message.IsTheHole(i_isolate_));
-  if (HasCaught() && !message.IsTheHole(i_isolate_)) {
+  i::Tagged<i::Object> message(reinterpret_cast<i::Address>(message_obj_));
+  DCHECK(IsJSMessageObject(message) || IsTheHole(message, i_isolate_));
+  if (HasCaught() && !IsTheHole(message, i_isolate_)) {
     return v8::Utils::MessageToLocal(i::Handle<i::Object>(message, i_isolate_));
   } else {
     return v8::Local<v8::Message>();
@@ -3198,7 +3049,7 @@ void v8::TryCatch::Reset() {
 }
 
 void v8::TryCatch::ResetInternal() {
-  i::Object the_hole = i::ReadOnlyRoots(i_isolate_).the_hole_value();
+  i::Tagged<i::Object> the_hole = i::ReadOnlyRoots(i_isolate_).the_hole_value();
   exception_ = reinterpret_cast<void*>(the_hole.ptr());
   message_obj_ = reinterpret_cast<void*>(the_hole.ptr());
 }
@@ -3245,7 +3096,7 @@ void ScriptOrigin::VerifyHostDefinedOptions() const {
   i::Handle<i::FixedArray> options =
       Utils::OpenHandle(*host_defined_options_.As<FixedArray>());
   for (int i = 0; i < options->length(); i++) {
-    Utils::ApiCheck(options->get(i).IsPrimitive(), "ScriptOrigin()",
+    Utils::ApiCheck(i::IsPrimitive(options->get(i)), "ScriptOrigin()",
                     "PrimitiveArray can only contain primtive values");
   }
 }
@@ -3261,7 +3112,7 @@ v8::Local<v8::StackTrace> Message::GetStackTrace() const {
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   EscapableHandleScope scope(reinterpret_cast<Isolate*>(i_isolate));
   i::Handle<i::Object> stackFramesObj(self->stack_frames(), i_isolate);
-  if (!stackFramesObj->IsFixedArray()) return v8::Local<v8::StackTrace>();
+  if (!IsFixedArray(*stackFramesObj)) return v8::Local<v8::StackTrace>();
   auto stackTrace = i::Handle<i::FixedArray>::cast(stackFramesObj);
   return scope.Escape(Utils::StackTraceToLocal(stackTrace));
 }
@@ -3320,7 +3171,7 @@ int Message::GetWasmFunctionIndex() const {
 
   i::Handle<i::Script> script(self->script(), i_isolate);
 
-  if (script->type() != i::Script::TYPE_WASM) {
+  if (script->type() != i::Script::Type::kWasm) {
     return Message::kNoWasmFunctionIndexInfo;
   }
 
@@ -3357,14 +3208,14 @@ bool Message::IsSharedCrossOrigin() const {
   auto self = Utils::OpenHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  return self->script().origin_options().IsSharedCrossOrigin();
+  return self->script()->origin_options().IsSharedCrossOrigin();
 }
 
 bool Message::IsOpaque() const {
   auto self = Utils::OpenHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  return self->script().origin_options().IsOpaque();
+  return self->script()->origin_options().IsOpaque();
 }
 
 MaybeLocal<String> Message::GetSource(Local<Context> context) const {
@@ -3430,9 +3281,8 @@ Location StackFrame::GetLocation() const {
   i::Isolate* i_isolate = self->GetIsolate();
   i::Handle<i::Script> script(self->script(), i_isolate);
   i::Script::PositionInfo info;
-  CHECK(i::Script::GetPositionInfo(script,
-                                   i::StackFrameInfo::GetSourcePosition(self),
-                                   &info, i::Script::WITH_OFFSET));
+  CHECK(i::Script::GetPositionInfo(
+      script, i::StackFrameInfo::GetSourcePosition(self), &info));
   if (script->HasSourceURLComment()) {
     info.line -= script->line_offset();
     if (info.line == 0) {
@@ -3443,41 +3293,41 @@ Location StackFrame::GetLocation() const {
 }
 
 int StackFrame::GetScriptId() const {
-  return Utils::OpenHandle(this)->script().id();
+  return Utils::OpenHandle(this)->script()->id();
 }
 
 Local<String> StackFrame::GetScriptName() const {
   i::Handle<i::StackFrameInfo> self = Utils::OpenHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
-  i::Handle<i::Object> name(self->script().name(), i_isolate);
-  if (!name->IsString()) return {};
+  i::Handle<i::Object> name(self->script()->name(), i_isolate);
+  if (!IsString(*name)) return {};
   return Utils::ToLocal(i::Handle<i::String>::cast(name));
 }
 
 Local<String> StackFrame::GetScriptNameOrSourceURL() const {
   i::Handle<i::StackFrameInfo> self = Utils::OpenHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
-  i::Handle<i::Object> name_or_source_url(self->script().GetNameOrSourceURL(),
+  i::Handle<i::Object> name_or_source_url(self->script()->GetNameOrSourceURL(),
                                           i_isolate);
-  if (!name_or_source_url->IsString()) return {};
+  if (!IsString(*name_or_source_url)) return {};
   return Utils::ToLocal(i::Handle<i::String>::cast(name_or_source_url));
 }
 
 Local<String> StackFrame::GetScriptSource() const {
   i::Handle<i::StackFrameInfo> self = Utils::OpenHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
-  if (!self->script().HasValidSource()) return {};
-  i::Handle<i::PrimitiveHeapObject> source(self->script().source(), i_isolate);
-  if (!source->IsString()) return {};
+  if (!self->script()->HasValidSource()) return {};
+  i::Handle<i::PrimitiveHeapObject> source(self->script()->source(), i_isolate);
+  if (!IsString(*source)) return {};
   return Utils::ToLocal(i::Handle<i::String>::cast(source));
 }
 
 Local<String> StackFrame::GetScriptSourceMappingURL() const {
   i::Handle<i::StackFrameInfo> self = Utils::OpenHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
-  i::Handle<i::Object> source_mapping_url(self->script().source_mapping_url(),
+  i::Handle<i::Object> source_mapping_url(self->script()->source_mapping_url(),
                                           i_isolate);
-  if (!source_mapping_url->IsString()) return {};
+  if (!IsString(*source_mapping_url)) return {};
   return Utils::ToLocal(i::Handle<i::String>::cast(source_mapping_url));
 }
 
@@ -3491,7 +3341,8 @@ Local<String> StackFrame::GetFunctionName() const {
 
 bool StackFrame::IsEval() const {
   i::Handle<i::StackFrameInfo> self = Utils::OpenHandle(this);
-  return self->script().compilation_type() == i::Script::COMPILATION_TYPE_EVAL;
+  return self->script()->compilation_type() ==
+         i::Script::CompilationType::kEval;
 }
 
 bool StackFrame::IsConstructor() const {
@@ -3501,7 +3352,7 @@ bool StackFrame::IsConstructor() const {
 bool StackFrame::IsWasm() const { return !IsUserJavaScript(); }
 
 bool StackFrame::IsUserJavaScript() const {
-  return Utils::OpenHandle(this)->script().IsUserJavaScript();
+  return Utils::OpenHandle(this)->script()->IsUserJavaScript();
 }
 
 // --- J S O N ---
@@ -3812,65 +3663,65 @@ bool ValueDeserializer::ReadRawBytes(size_t length, const void** data) {
 
 bool Value::FullIsUndefined() const {
   i::Handle<i::Object> object = Utils::OpenHandle(this);
-  bool result = object->IsUndefined();
+  bool result = i::IsUndefined(*object);
   DCHECK_EQ(result, QuickIsUndefined());
   return result;
 }
 
 bool Value::FullIsNull() const {
   i::Handle<i::Object> object = Utils::OpenHandle(this);
-  bool result = object->IsNull();
+  bool result = i::IsNull(*object);
   DCHECK_EQ(result, QuickIsNull());
   return result;
 }
 
 bool Value::IsTrue() const {
-  i::Object object = *Utils::OpenHandle(this);
-  if (object.IsSmi()) return false;
-  return object.IsTrue();
+  i::Tagged<i::Object> object = *Utils::OpenHandle(this);
+  if (i::IsSmi(object)) return false;
+  return i::IsTrue(object);
 }
 
 bool Value::IsFalse() const {
-  i::Object object = *Utils::OpenHandle(this);
-  if (object.IsSmi()) return false;
-  return object.IsFalse();
+  i::Tagged<i::Object> object = *Utils::OpenHandle(this);
+  if (i::IsSmi(object)) return false;
+  return i::IsFalse(object);
 }
 
-bool Value::IsFunction() const { return Utils::OpenHandle(this)->IsCallable(); }
+bool Value::IsFunction() const { return IsCallable(*Utils::OpenHandle(this)); }
 
-bool Value::IsName() const { return Utils::OpenHandle(this)->IsName(); }
+bool Value::IsName() const { return i::IsName(*Utils::OpenHandle(this)); }
 
 bool Value::FullIsString() const {
-  bool result = Utils::OpenHandle(this)->IsString();
+  bool result = i::IsString(*Utils::OpenHandle(this));
   DCHECK_EQ(result, QuickIsString());
   return result;
 }
 
 bool Value::IsSymbol() const {
-  return Utils::OpenHandle(this)->IsPublicSymbol();
+  return IsPublicSymbol(*Utils::OpenHandle(this));
 }
 
-bool Value::IsArray() const { return Utils::OpenHandle(this)->IsJSArray(); }
+bool Value::IsArray() const { return IsJSArray(*Utils::OpenHandle(this)); }
 
 bool Value::IsArrayBuffer() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  if (!obj.IsJSArrayBuffer()) return false;
-  return !i::JSArrayBuffer::cast(obj).is_shared();
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  if (!IsJSArrayBuffer(obj)) return false;
+  return !i::JSArrayBuffer::cast(obj)->is_shared();
 }
 
 bool Value::IsArrayBufferView() const {
-  return Utils::OpenHandle(this)->IsJSArrayBufferView();
+  return IsJSArrayBufferView(*Utils::OpenHandle(this));
 }
 
 bool Value::IsTypedArray() const {
-  return Utils::OpenHandle(this)->IsJSTypedArray();
+  return IsJSTypedArray(*Utils::OpenHandle(this));
 }
 
-#define VALUE_IS_TYPED_ARRAY(Type, typeName, TYPE, ctype)                   \
-  bool Value::Is##Type##Array() const {                                     \
-    i::Handle<i::Object> obj = Utils::OpenHandle(this);                     \
-    return obj->IsJSTypedArray() &&                                         \
-           i::JSTypedArray::cast(*obj).type() == i::kExternal##Type##Array; \
+#define VALUE_IS_TYPED_ARRAY(Type, typeName, TYPE, ctype)                    \
+  bool Value::Is##Type##Array() const {                                      \
+    i::Handle<i::Object> obj = Utils::OpenHandle(this);                      \
+    return i::IsJSTypedArray(*obj) &&                                        \
+           i::JSTypedArray::cast(*obj)->type() == i::kExternal##Type##Array; \
   }
 
 TYPED_ARRAYS(VALUE_IS_TYPED_ARRAY)
@@ -3879,27 +3730,29 @@ TYPED_ARRAYS(VALUE_IS_TYPED_ARRAY)
 
 bool Value::IsDataView() const {
   i::Handle<i::Object> obj = Utils::OpenHandle(this);
-  return obj->IsJSDataView() || obj->IsJSRabGsabDataView();
+  return IsJSDataView(*obj) || IsJSRabGsabDataView(*obj);
 }
 
 bool Value::IsSharedArrayBuffer() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  if (!obj.IsJSArrayBuffer()) return false;
-  return i::JSArrayBuffer::cast(obj).is_shared();
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  if (!IsJSArrayBuffer(obj)) return false;
+  return i::JSArrayBuffer::cast(obj)->is_shared();
 }
 
-bool Value::IsObject() const { return Utils::OpenHandle(this)->IsJSReceiver(); }
+bool Value::IsObject() const {
+  return i::IsJSReceiver(*Utils::OpenHandle(this));
+}
 
-bool Value::IsNumber() const { return Utils::OpenHandle(this)->IsNumber(); }
+bool Value::IsNumber() const { return i::IsNumber(*Utils::OpenHandle(this)); }
 
-bool Value::IsBigInt() const { return Utils::OpenHandle(this)->IsBigInt(); }
+bool Value::IsBigInt() const { return i::IsBigInt(*Utils::OpenHandle(this)); }
 
-bool Value::IsProxy() const { return Utils::OpenHandle(this)->IsJSProxy(); }
+bool Value::IsProxy() const { return i::IsJSProxy(*Utils::OpenHandle(this)); }
 
 #define VALUE_IS_SPECIFIC_TYPE(Type, Check)             \
   bool Value::Is##Type() const {                        \
     i::Handle<i::Object> obj = Utils::OpenHandle(this); \
-    return obj->Is##Check();                            \
+    return i::Is##Check(*obj);                          \
   }
 
 VALUE_IS_SPECIFIC_TYPE(ArgumentsObject, JSArgumentsObject)
@@ -3926,27 +3779,27 @@ VALUE_IS_SPECIFIC_TYPE(WeakRef, JSWeakRef)
 
 #undef VALUE_IS_SPECIFIC_TYPE
 
-bool Value::IsBoolean() const { return Utils::OpenHandle(this)->IsBoolean(); }
+bool Value::IsBoolean() const { return i::IsBoolean(*Utils::OpenHandle(this)); }
 
 bool Value::IsExternal() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  return obj.IsJSExternalObject();
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  return IsJSExternalObject(obj);
 }
 
 bool Value::IsInt32() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  if (obj.IsSmi()) return true;
-  if (obj.IsNumber()) {
-    return i::IsInt32Double(obj.Number());
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  if (i::IsSmi(obj)) return true;
+  if (i::IsNumber(obj)) {
+    return i::IsInt32Double(i::Object::Number(obj));
   }
   return false;
 }
 
 bool Value::IsUint32() const {
   i::Handle<i::Object> obj = Utils::OpenHandle(this);
-  if (obj->IsSmi()) return i::Smi::ToInt(*obj) >= 0;
-  if (obj->IsNumber()) {
-    double value = obj->Number();
+  if (i::IsSmi(*obj)) return i::Smi::ToInt(*obj) >= 0;
+  if (i::IsNumber(*obj)) {
+    double value = i::Object::Number(*obj);
     return !i::IsMinusZero(value) && value >= 0 && value <= i::kMaxUInt32 &&
            value == i::FastUI2D(i::FastD2UI(value));
   }
@@ -3954,50 +3807,50 @@ bool Value::IsUint32() const {
 }
 
 bool Value::IsNativeError() const {
-  return Utils::OpenHandle(this)->IsJSError();
+  return IsJSError(*Utils::OpenHandle(this));
 }
 
 bool Value::IsRegExp() const {
   i::Handle<i::Object> obj = Utils::OpenHandle(this);
-  return obj->IsJSRegExp();
+  return IsJSRegExp(*obj);
 }
 
 bool Value::IsAsyncFunction() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  if (!obj.IsJSFunction()) return false;
-  i::JSFunction func = i::JSFunction::cast(obj);
-  return i::IsAsyncFunction(func.shared().kind());
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  if (!IsJSFunction(obj)) return false;
+  i::Tagged<i::JSFunction> func = i::JSFunction::cast(obj);
+  return i::IsAsyncFunction(func->shared()->kind());
 }
 
 bool Value::IsGeneratorFunction() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  if (!obj.IsJSFunction()) return false;
-  i::JSFunction func = i::JSFunction::cast(obj);
-  DCHECK_NO_SCRIPT_NO_EXCEPTION(func.GetIsolate());
-  return i::IsGeneratorFunction(func.shared().kind());
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  if (!IsJSFunction(obj)) return false;
+  i::Tagged<i::JSFunction> func = i::JSFunction::cast(obj);
+  DCHECK_NO_SCRIPT_NO_EXCEPTION(func->GetIsolate());
+  return i::IsGeneratorFunction(func->shared()->kind());
 }
 
 bool Value::IsGeneratorObject() const {
-  return Utils::OpenHandle(this)->IsJSGeneratorObject();
+  return IsJSGeneratorObject(*Utils::OpenHandle(this));
 }
 
 bool Value::IsMapIterator() const {
-  return Utils::OpenHandle(this)->IsJSMapIterator();
+  return IsJSMapIterator(*Utils::OpenHandle(this));
 }
 
 bool Value::IsSetIterator() const {
-  return Utils::OpenHandle(this)->IsJSSetIterator();
+  return IsJSSetIterator(*Utils::OpenHandle(this));
 }
 
-bool Value::IsPromise() const { return Utils::OpenHandle(this)->IsJSPromise(); }
+bool Value::IsPromise() const { return IsJSPromise(*Utils::OpenHandle(this)); }
 
 bool Value::IsModuleNamespaceObject() const {
-  return Utils::OpenHandle(this)->IsJSModuleNamespace();
+  return IsJSModuleNamespace(*Utils::OpenHandle(this));
 }
 
 MaybeLocal<String> Value::ToString(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsString()) return ToApiHandle<String>(obj);
+  if (i::IsString(*obj)) return ToApiHandle<String>(obj);
   PREPARE_FOR_EXECUTION(context, Object, ToString, String);
   Local<String> result;
   has_pending_exception =
@@ -4008,7 +3861,7 @@ MaybeLocal<String> Value::ToString(Local<Context> context) const {
 
 MaybeLocal<String> Value::ToDetailString(Local<Context> context) const {
   i::Handle<i::Object> obj = Utils::OpenHandle(this);
-  if (obj->IsString()) return ToApiHandle<String>(obj);
+  if (i::IsString(*obj)) return ToApiHandle<String>(obj);
   PREPARE_FOR_EXECUTION(context, Object, ToDetailString, String);
   Local<String> result =
       Utils::ToLocal(i::Object::NoSideEffectsToString(i_isolate, obj));
@@ -4018,7 +3871,7 @@ MaybeLocal<String> Value::ToDetailString(Local<Context> context) const {
 
 MaybeLocal<Object> Value::ToObject(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsJSReceiver()) return ToApiHandle<Object>(obj);
+  if (i::IsJSReceiver(*obj)) return ToApiHandle<Object>(obj);
   PREPARE_FOR_EXECUTION(context, Object, ToObject, Object);
   Local<Object> result;
   has_pending_exception =
@@ -4029,7 +3882,7 @@ MaybeLocal<Object> Value::ToObject(Local<Context> context) const {
 
 MaybeLocal<BigInt> Value::ToBigInt(Local<Context> context) const {
   i::Handle<i::Object> obj = Utils::OpenHandle(this);
-  if (obj->IsBigInt()) return ToApiHandle<BigInt>(obj);
+  if (i::IsBigInt(*obj)) return ToApiHandle<BigInt>(obj);
   PREPARE_FOR_EXECUTION(context, Object, ToBigInt, BigInt);
   Local<BigInt> result;
   has_pending_exception =
@@ -4039,8 +3892,30 @@ MaybeLocal<BigInt> Value::ToBigInt(Local<Context> context) const {
 }
 
 bool Value::BooleanValue(Isolate* v8_isolate) const {
-  return Utils::OpenHandle(this)->BooleanValue(
-      reinterpret_cast<i::Isolate*>(v8_isolate));
+  return i::Object::BooleanValue(*Utils::OpenHandle(this),
+                                 reinterpret_cast<i::Isolate*>(v8_isolate));
+}
+
+MaybeLocal<Primitive> Value::ToPrimitive(Local<Context> context) const {
+  auto obj = Utils::OpenHandle(this);
+  if (i::IsPrimitive(*obj)) return ToApiHandle<Primitive>(obj);
+  PREPARE_FOR_EXECUTION(context, Object, ToPrimitive, Primitive);
+  Local<Primitive> result;
+  has_pending_exception =
+      !ToLocal<Primitive>(i::Object::ToPrimitive(i_isolate, obj), &result);
+  RETURN_ON_FAILED_EXECUTION(Primitive);
+  RETURN_ESCAPED(result);
+}
+
+MaybeLocal<Numeric> Value::ToNumeric(Local<Context> context) const {
+  auto obj = Utils::OpenHandle(this);
+  if (i::IsNumeric(*obj)) return ToApiHandle<Numeric>(obj);
+  PREPARE_FOR_EXECUTION(context, Object, ToNumeric, Numeric);
+  Local<Numeric> result;
+  has_pending_exception =
+      !ToLocal<Numeric>(i::Object::ToNumeric(i_isolate, obj), &result);
+  RETURN_ON_FAILED_EXECUTION(Numeric);
+  RETURN_ESCAPED(result);
 }
 
 Local<Boolean> Value::ToBoolean(Isolate* v8_isolate) const {
@@ -4052,7 +3927,7 @@ Local<Boolean> Value::ToBoolean(Isolate* v8_isolate) const {
 
 MaybeLocal<Number> Value::ToNumber(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsNumber()) return ToApiHandle<Number>(obj);
+  if (i::IsNumber(*obj)) return ToApiHandle<Number>(obj);
   PREPARE_FOR_EXECUTION(context, Object, ToNumber, Number);
   Local<Number> result;
   has_pending_exception =
@@ -4063,7 +3938,7 @@ MaybeLocal<Number> Value::ToNumber(Local<Context> context) const {
 
 MaybeLocal<Integer> Value::ToInteger(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsSmi()) return ToApiHandle<Integer>(obj);
+  if (i::IsSmi(*obj)) return ToApiHandle<Integer>(obj);
   PREPARE_FOR_EXECUTION(context, Object, ToInteger, Integer);
   Local<Integer> result;
   has_pending_exception =
@@ -4074,7 +3949,7 @@ MaybeLocal<Integer> Value::ToInteger(Local<Context> context) const {
 
 MaybeLocal<Int32> Value::ToInt32(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsSmi()) return ToApiHandle<Int32>(obj);
+  if (i::IsSmi(*obj)) return ToApiHandle<Int32>(obj);
   Local<Int32> result;
   PREPARE_FOR_EXECUTION(context, Object, ToInt32, Int32);
   has_pending_exception =
@@ -4085,7 +3960,7 @@ MaybeLocal<Int32> Value::ToInt32(Local<Context> context) const {
 
 MaybeLocal<Uint32> Value::ToUint32(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsSmi()) return ToApiHandle<Uint32>(obj);
+  if (i::IsSmi(*obj)) return ToApiHandle<Uint32>(obj);
   Local<Uint32> result;
   PREPARE_FOR_EXECUTION(context, Object, ToUint32, Uint32);
   has_pending_exception =
@@ -4121,70 +3996,79 @@ void External::CheckCast(v8::Value* that) {
 
 void v8::Object::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSReceiver(), "v8::Object::Cast",
+  Utils::ApiCheck(i::IsJSReceiver(*obj), "v8::Object::Cast",
                   "Value is not an Object");
 }
 
 void v8::Function::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsCallable(), "v8::Function::Cast",
+  Utils::ApiCheck(i::IsCallable(*obj), "v8::Function::Cast",
                   "Value is not a Function");
 }
 
 void v8::Boolean::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsBoolean(), "v8::Boolean::Cast",
+  Utils::ApiCheck(i::IsBoolean(*obj), "v8::Boolean::Cast",
                   "Value is not a Boolean");
 }
 
 void v8::Name::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsName(), "v8::Name::Cast", "Value is not a Name");
+  Utils::ApiCheck(i::IsName(*obj), "v8::Name::Cast", "Value is not a Name");
 }
 
 void v8::String::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsString(), "v8::String::Cast", "Value is not a String");
+  Utils::ApiCheck(i::IsString(*obj), "v8::String::Cast",
+                  "Value is not a String");
 }
 
 void v8::Symbol::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsSymbol(), "v8::Symbol::Cast", "Value is not a Symbol");
+  Utils::ApiCheck(i::IsSymbol(*obj), "v8::Symbol::Cast",
+                  "Value is not a Symbol");
 }
 
 void v8::Private::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
   Utils::ApiCheck(
-      obj->IsSymbol() && i::Handle<i::Symbol>::cast(obj)->is_private(),
+      IsSymbol(*obj) && i::Handle<i::Symbol>::cast(obj)->is_private(),
       "v8::Private::Cast", "Value is not a Private");
 }
 
 void v8::FixedArray::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsFixedArray(), "v8::FixedArray::Cast",
+  Utils::ApiCheck(i::IsFixedArray(*obj), "v8::FixedArray::Cast",
                   "Value is not a FixedArray");
 }
 
 void v8::ModuleRequest::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsModuleRequest(), "v8::ModuleRequest::Cast",
+  Utils::ApiCheck(i::IsModuleRequest(*obj), "v8::ModuleRequest::Cast",
                   "Value is not a ModuleRequest");
 }
 
 void v8::Module::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsModule(), "v8::Module::Cast", "Value is not a Module");
+  Utils::ApiCheck(i::IsModule(*obj), "v8::Module::Cast",
+                  "Value is not a Module");
+}
+
+void v8::Numeric::CheckCast(v8::Data* that) {
+  i::Handle<i::Object> obj = Utils::OpenHandle(that);
+  Utils::ApiCheck(i::IsNumeric(*obj), "v8::Numeric::Cast()",
+                  "Value is not a Numeric");
 }
 
 void v8::Number::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsNumber(), "v8::Number::Cast()",
+  Utils::ApiCheck(i::IsNumber(*obj), "v8::Number::Cast()",
                   "Value is not a Number");
 }
 
 void v8::Integer::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsNumber(), "v8::Integer::Cast",
+  Utils::ApiCheck(i::IsNumber(*obj), "v8::Integer::Cast",
                   "Value is not an Integer");
 }
 
@@ -4205,23 +4089,24 @@ void v8::BigInt::CheckCast(v8::Data* that) {
 
 void v8::Context::CheckCast(v8::Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsContext(), "v8::Context::Cast",
+  Utils::ApiCheck(i::IsContext(*obj), "v8::Context::Cast",
                   "Value is not a Context");
 }
 
 void v8::Array::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSArray(), "v8::Array::Cast", "Value is not an Array");
+  Utils::ApiCheck(i::IsJSArray(*obj), "v8::Array::Cast",
+                  "Value is not an Array");
 }
 
 void v8::Map::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSMap(), "v8::Map::Cast", "Value is not a Map");
+  Utils::ApiCheck(i::IsJSMap(*obj), "v8::Map::Cast", "Value is not a Map");
 }
 
 void v8::Set::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSSet(), "v8_Set_Cast", "Value is not a Set");
+  Utils::ApiCheck(i::IsJSSet(*obj), "v8_Set_Cast", "Value is not a Set");
 }
 
 void v8::Promise::CheckCast(Value* that) {
@@ -4330,13 +4215,13 @@ void* v8::SharedArrayBuffer::Data() const {
 void v8::ArrayBuffer::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
   Utils::ApiCheck(
-      obj->IsJSArrayBuffer() && !i::JSArrayBuffer::cast(*obj).is_shared(),
+      IsJSArrayBuffer(*obj) && !i::JSArrayBuffer::cast(*obj)->is_shared(),
       "v8::ArrayBuffer::Cast()", "Value is not an ArrayBuffer");
 }
 
 void v8::ArrayBufferView::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSArrayBufferView(), "v8::ArrayBufferView::Cast()",
+  Utils::ApiCheck(i::IsJSArrayBufferView(*obj), "v8::ArrayBufferView::Cast()",
                   "Value is not an ArrayBufferView");
 }
 
@@ -4344,17 +4229,17 @@ constexpr size_t v8::TypedArray::kMaxLength;
 
 void v8::TypedArray::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSTypedArray(), "v8::TypedArray::Cast()",
+  Utils::ApiCheck(i::IsJSTypedArray(*obj), "v8::TypedArray::Cast()",
                   "Value is not a TypedArray");
 }
 
-#define CHECK_TYPED_ARRAY_CAST(Type, typeName, TYPE, ctype)                  \
-  void v8::Type##Array::CheckCast(Value* that) {                             \
-    i::Handle<i::Object> obj = Utils::OpenHandle(that);                      \
-    Utils::ApiCheck(                                                         \
-        obj->IsJSTypedArray() &&                                             \
-            i::JSTypedArray::cast(*obj).type() == i::kExternal##Type##Array, \
-        "v8::" #Type "Array::Cast()", "Value is not a " #Type "Array");      \
+#define CHECK_TYPED_ARRAY_CAST(Type, typeName, TYPE, ctype)                   \
+  void v8::Type##Array::CheckCast(Value* that) {                              \
+    i::Handle<i::Object> obj = Utils::OpenHandle(that);                       \
+    Utils::ApiCheck(                                                          \
+        i::IsJSTypedArray(*obj) &&                                            \
+            i::JSTypedArray::cast(*obj)->type() == i::kExternal##Type##Array, \
+        "v8::" #Type "Array::Cast()", "Value is not a " #Type "Array");       \
   }
 
 TYPED_ARRAYS(CHECK_TYPED_ARRAY_CAST)
@@ -4363,73 +4248,73 @@ TYPED_ARRAYS(CHECK_TYPED_ARRAY_CAST)
 
 void v8::DataView::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSDataView() || obj->IsJSRabGsabDataView(),
+  Utils::ApiCheck(i::IsJSDataView(*obj) || IsJSRabGsabDataView(*obj),
                   "v8::DataView::Cast()", "Value is not a DataView");
 }
 
 void v8::SharedArrayBuffer::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
   Utils::ApiCheck(
-      obj->IsJSArrayBuffer() && i::JSArrayBuffer::cast(*obj).is_shared(),
+      IsJSArrayBuffer(*obj) && i::JSArrayBuffer::cast(*obj)->is_shared(),
       "v8::SharedArrayBuffer::Cast()", "Value is not a SharedArrayBuffer");
 }
 
 void v8::Date::CheckCast(v8::Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSDate(), "v8::Date::Cast()", "Value is not a Date");
+  Utils::ApiCheck(i::IsJSDate(*obj), "v8::Date::Cast()", "Value is not a Date");
 }
 
 void v8::StringObject::CheckCast(v8::Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsStringWrapper(), "v8::StringObject::Cast()",
+  Utils::ApiCheck(i::IsStringWrapper(*obj), "v8::StringObject::Cast()",
                   "Value is not a StringObject");
 }
 
 void v8::SymbolObject::CheckCast(v8::Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsSymbolWrapper(), "v8::SymbolObject::Cast()",
+  Utils::ApiCheck(i::IsSymbolWrapper(*obj), "v8::SymbolObject::Cast()",
                   "Value is not a SymbolObject");
 }
 
 void v8::NumberObject::CheckCast(v8::Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsNumberWrapper(), "v8::NumberObject::Cast()",
+  Utils::ApiCheck(i::IsNumberWrapper(*obj), "v8::NumberObject::Cast()",
                   "Value is not a NumberObject");
 }
 
 void v8::BigIntObject::CheckCast(v8::Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsBigIntWrapper(), "v8::BigIntObject::Cast()",
+  Utils::ApiCheck(i::IsBigIntWrapper(*obj), "v8::BigIntObject::Cast()",
                   "Value is not a BigIntObject");
 }
 
 void v8::BooleanObject::CheckCast(v8::Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsBooleanWrapper(), "v8::BooleanObject::Cast()",
+  Utils::ApiCheck(i::IsBooleanWrapper(*obj), "v8::BooleanObject::Cast()",
                   "Value is not a BooleanObject");
 }
 
 void v8::RegExp::CheckCast(v8::Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsJSRegExp(), "v8::RegExp::Cast()",
+  Utils::ApiCheck(i::IsJSRegExp(*obj), "v8::RegExp::Cast()",
                   "Value is not a RegExp");
 }
 
 Maybe<double> Value::NumberValue(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsNumber()) return Just(obj->Number());
+  if (i::IsNumber(*obj)) return Just(i::Object::Number(*obj));
   auto i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
   ENTER_V8(i_isolate, context, Value, NumberValue, Nothing<double>(),
            i::HandleScope);
   i::Handle<i::Object> num;
   has_pending_exception = !i::Object::ToNumber(i_isolate, obj).ToHandle(&num);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(double);
-  return Just(num->Number());
+  return Just(i::Object::Number(*num));
 }
 
 Maybe<int64_t> Value::IntegerValue(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsNumber()) {
+  if (i::IsNumber(*obj)) {
     return Just(NumberToInt64(*obj));
   }
   auto i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
@@ -4443,33 +4328,33 @@ Maybe<int64_t> Value::IntegerValue(Local<Context> context) const {
 
 Maybe<int32_t> Value::Int32Value(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsNumber()) return Just(NumberToInt32(*obj));
+  if (i::IsNumber(*obj)) return Just(NumberToInt32(*obj));
   auto i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
   ENTER_V8(i_isolate, context, Value, Int32Value, Nothing<int32_t>(),
            i::HandleScope);
   i::Handle<i::Object> num;
   has_pending_exception = !i::Object::ToInt32(i_isolate, obj).ToHandle(&num);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(int32_t);
-  return Just(num->IsSmi() ? i::Smi::ToInt(*num)
-                           : static_cast<int32_t>(num->Number()));
+  return Just(IsSmi(*num) ? i::Smi::ToInt(*num)
+                          : static_cast<int32_t>(i::Object::Number(*num)));
 }
 
 Maybe<uint32_t> Value::Uint32Value(Local<Context> context) const {
   auto obj = Utils::OpenHandle(this);
-  if (obj->IsNumber()) return Just(NumberToUint32(*obj));
+  if (i::IsNumber(*obj)) return Just(NumberToUint32(*obj));
   auto i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
   ENTER_V8(i_isolate, context, Value, Uint32Value, Nothing<uint32_t>(),
            i::HandleScope);
   i::Handle<i::Object> num;
   has_pending_exception = !i::Object::ToUint32(i_isolate, obj).ToHandle(&num);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(uint32_t);
-  return Just(num->IsSmi() ? static_cast<uint32_t>(i::Smi::ToInt(*num))
-                           : static_cast<uint32_t>(num->Number()));
+  return Just(IsSmi(*num) ? static_cast<uint32_t>(i::Smi::ToInt(*num))
+                          : static_cast<uint32_t>(i::Object::Number(*num)));
 }
 
 MaybeLocal<Uint32> Value::ToArrayIndex(Local<Context> context) const {
   auto self = Utils::OpenHandle(this);
-  if (self->IsSmi()) {
+  if (i::IsSmi(*self)) {
     if (i::Smi::ToInt(*self) >= 0) return Utils::Uint32ToLocal(self);
     return Local<Uint32>();
   }
@@ -4506,13 +4391,13 @@ Maybe<bool> Value::Equals(Local<Context> context, Local<Value> that) const {
 bool Value::StrictEquals(Local<Value> that) const {
   auto self = Utils::OpenHandle(this);
   auto other = Utils::OpenHandle(*that);
-  return self->StrictEquals(*other);
+  return i::Object::StrictEquals(*self, *other);
 }
 
 bool Value::SameValue(Local<Value> that) const {
   auto self = Utils::OpenHandle(this);
   auto other = Utils::OpenHandle(*that);
-  return self->SameValue(*other);
+  return i::Object::SameValue(*self, *other);
 }
 
 Local<String> Value::TypeOf(v8::Isolate* external_isolate) {
@@ -4533,7 +4418,7 @@ Maybe<bool> Value::InstanceOf(v8::Local<v8::Context> context,
   has_pending_exception =
       !i::Object::InstanceOf(i_isolate, left, right).ToHandle(&result);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
-  return Just(result->IsTrue(i_isolate));
+  return Just(i::IsTrue(*result, i_isolate));
 }
 
 Maybe<bool> v8::Object::Set(v8::Local<v8::Context> context,
@@ -4576,7 +4461,7 @@ Maybe<bool> v8::Object::CreateDataProperty(v8::Local<v8::Context> context,
 
   i::PropertyKey lookup_key(i_isolate, key_obj);
   i::LookupIterator it(i_isolate, self, lookup_key, i::LookupIterator::OWN);
-  if (self->IsJSProxy()) {
+  if (i::IsJSProxy(*self)) {
     ENTER_V8(i_isolate, context, Object, CreateDataProperty, Nothing<bool>(),
              i::HandleScope);
     Maybe<bool> result =
@@ -4603,7 +4488,7 @@ Maybe<bool> v8::Object::CreateDataProperty(v8::Local<v8::Context> context,
   i::Handle<i::Object> value_obj = Utils::OpenHandle(*value);
 
   i::LookupIterator it(i_isolate, self, index, self, i::LookupIterator::OWN);
-  if (self->IsJSProxy()) {
+  if (i::IsJSProxy(*self)) {
     ENTER_V8(i_isolate, context, Object, CreateDataProperty, Nothing<bool>(),
              i::HandleScope);
     Maybe<bool> result =
@@ -4730,12 +4615,13 @@ Maybe<bool> v8::Object::DefineOwnProperty(v8::Local<v8::Context> context,
   desc.set_configurable(!(attributes & v8::DontDelete));
   desc.set_value(value_obj);
 
-  if (self->IsJSProxy()) {
+  if (i::IsJSProxy(*self)) {
     ENTER_V8(i_isolate, context, Object, DefineOwnProperty, Nothing<bool>(),
              i::HandleScope);
     Maybe<bool> success = i::JSReceiver::DefineOwnProperty(
         i_isolate, self, key_obj, &desc, Just(i::kDontThrow));
     // Even though we said kDontThrow, there might be accessors that do throw.
+    has_pending_exception = success.IsNothing();
     RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
     return success;
   } else {
@@ -4745,6 +4631,7 @@ Maybe<bool> v8::Object::DefineOwnProperty(v8::Local<v8::Context> context,
                        Nothing<bool>(), i::HandleScope);
     Maybe<bool> success = i::JSReceiver::DefineOwnProperty(
         i_isolate, self, key_obj, &desc, Just(i::kDontThrow));
+    has_pending_exception = success.IsNothing();
     RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
     return success;
   }
@@ -4762,6 +4649,7 @@ Maybe<bool> v8::Object::DefineProperty(v8::Local<v8::Context> context,
   Maybe<bool> success = i::JSReceiver::DefineOwnProperty(
       i_isolate, self, key_obj, &descriptor.get_private()->desc,
       Just(i::kDontThrow));
+  has_pending_exception = success.IsNothing();
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
   return success;
 }
@@ -4774,7 +4662,7 @@ Maybe<bool> v8::Object::SetPrivate(Local<Context> context, Local<Private> key,
   auto self = Utils::OpenHandle(this);
   auto key_obj = Utils::OpenHandle(reinterpret_cast<Name*>(*key));
   auto value_obj = Utils::OpenHandle(*value);
-  if (self->IsJSProxy()) {
+  if (i::IsJSProxy(*self)) {
     i::PropertyDescriptor desc;
     desc.set_writable(true);
     desc.set_enumerable(false);
@@ -4818,7 +4706,7 @@ MaybeLocal<Value> v8::Object::Get(Local<Context> context, uint32_t index) {
 
 MaybeLocal<Value> v8::Object::GetPrivate(Local<Context> context,
                                          Local<Private> key) {
-  return Get(context, Local<Value>(reinterpret_cast<Value*>(*key)));
+  return Get(context, key.UnsafeAs<Value>());
 }
 
 Maybe<PropertyAttribute> v8::Object::GetPropertyAttributes(
@@ -4828,7 +4716,7 @@ Maybe<PropertyAttribute> v8::Object::GetPropertyAttributes(
            Nothing<PropertyAttribute>(), i::HandleScope);
   auto self = Utils::OpenHandle(this);
   auto key_obj = Utils::OpenHandle(*key);
-  if (!key_obj->IsName()) {
+  if (!i::IsName(*key_obj)) {
     has_pending_exception =
         !i::Object::ToString(i_isolate, key_obj).ToHandle(&key_obj);
     RETURN_ON_FAILED_EXECUTION_PRIMITIVE(PropertyAttribute);
@@ -4872,7 +4760,7 @@ Maybe<bool> v8::Object::SetPrototype(Local<Context> context,
   auto i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
   auto self = Utils::OpenHandle(this);
   auto value_obj = Utils::OpenHandle(*value);
-  if (self->IsJSProxy()) {
+  if (i::IsJSProxy(*self)) {
     ENTER_V8(i_isolate, context, Object, SetPrototype, Nothing<bool>(),
              i::HandleScope);
     // We do not allow exceptions thrown while setting the prototype
@@ -4901,11 +4789,11 @@ Local<Object> v8::Object::FindInstanceInPrototypeChain(
   auto self = Utils::OpenHandle(this);
   auto i_isolate = self->GetIsolate();
   i::PrototypeIterator iter(i_isolate, *self, i::kStartAtReceiver);
-  auto tmpl_info = *Utils::OpenHandle(*tmpl);
-  while (!tmpl_info.IsTemplateFor(iter.GetCurrent<i::JSObject>())) {
+  i::Tagged<i::FunctionTemplateInfo> tmpl_info = *Utils::OpenHandle(*tmpl);
+  while (!tmpl_info->IsTemplateFor(iter.GetCurrent<i::JSObject>())) {
     iter.Advance();
     if (iter.IsAtEnd()) return Local<Object>();
-    if (!iter.GetCurrent().IsJSObject()) return Local<Object>();
+    if (!IsJSObject(iter.GetCurrent())) return Local<Object>();
   }
   // IsTemplateFor() ensures that iter.GetCurrent() can't be a Proxy here.
   return Utils::ToLocal(i::handle(iter.GetCurrent<i::JSObject>(), i_isolate));
@@ -4933,9 +4821,9 @@ MaybeLocal<Array> v8::Object::GetPropertyNames(
   RETURN_ON_FAILED_EXECUTION(Array);
   value =
       accumulator.GetKeys(static_cast<i::GetKeysConversion>(key_conversion));
-  DCHECK(self->map().EnumLength() == i::kInvalidEnumCacheSentinel ||
-         self->map().EnumLength() == 0 ||
-         self->map().instance_descriptors(i_isolate).enum_cache().keys() !=
+  DCHECK(self->map()->EnumLength() == i::kInvalidEnumCacheSentinel ||
+         self->map()->EnumLength() == 0 ||
+         self->map()->instance_descriptors(i_isolate)->enum_cache()->keys() !=
              *value);
   auto result = i_isolate->factory()->NewJSArrayWithElements(value);
   RETURN_ESCAPED(Utils::ToLocal(result));
@@ -4998,7 +4886,7 @@ Maybe<bool> v8::Object::Delete(Local<Context> context, Local<Value> key) {
   auto i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
   auto self = Utils::OpenHandle(this);
   auto key_obj = Utils::OpenHandle(*key);
-  if (self->IsJSProxy()) {
+  if (i::IsJSProxy(*self)) {
     ENTER_V8(i_isolate, context, Object, Delete, Nothing<bool>(),
              i::HandleScope);
     Maybe<bool> result = i::Runtime::DeleteObjectProperty(
@@ -5043,7 +4931,7 @@ Maybe<bool> v8::Object::Has(Local<Context> context, Local<Value> key) {
   Maybe<bool> maybe = Nothing<bool>();
   // Check if the given key is an array index.
   uint32_t index = 0;
-  if (key_obj->ToArrayIndex(&index)) {
+  if (i::Object::ToArrayIndex(*key_obj, &index)) {
     maybe = i::JSReceiver::HasElement(i_isolate, self, index);
   } else {
     // Convert the key to a name - possibly by calling back into JavaScript.
@@ -5058,7 +4946,7 @@ Maybe<bool> v8::Object::Has(Local<Context> context, Local<Value> key) {
 }
 
 Maybe<bool> v8::Object::HasPrivate(Local<Context> context, Local<Private> key) {
-  return HasOwnProperty(context, Local<Name>(reinterpret_cast<Name*>(*key)));
+  return HasOwnProperty(context, key.UnsafeAs<Name>());
 }
 
 Maybe<bool> v8::Object::Delete(Local<Context> context, uint32_t index) {
@@ -5091,7 +4979,7 @@ static Maybe<bool> ObjectSetAccessor(
   auto i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
   ENTER_V8_NO_SCRIPT(i_isolate, context, Object, SetAccessor, Nothing<bool>(),
                      i::HandleScope);
-  if (!Utils::OpenHandle(self)->IsJSObject()) return Just(false);
+  if (!IsJSObject(*Utils::OpenHandle(self))) return Just(false);
   i::Handle<i::JSObject> obj =
       i::Handle<i::JSObject>::cast(Utils::OpenHandle(self));
   i::Handle<i::AccessorInfo> info =
@@ -5109,7 +4997,7 @@ static Maybe<bool> ObjectSetAccessor(
       !i::JSObject::SetAccessor(obj, accessor_name, info, attrs)
            .ToHandle(&result);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
-  if (result->IsUndefined(i_isolate)) return Just(false);
+  if (i::IsUndefined(*result, i_isolate)) return Just(false);
   if (fast) {
     i::JSObject::MigrateSlowToFast(obj, 0, "APISetAccessor");
   }
@@ -5131,7 +5019,7 @@ Maybe<bool> Object::SetAccessor(Local<Context> context, Local<Name> name,
 
 void Object::SetAccessorProperty(Local<Name> name, Local<Function> getter,
                                  Local<Function> setter,
-                                 PropertyAttribute attribute,
+                                 PropertyAttribute attributes,
                                  AccessControl settings) {
   // TODO(verwaest): Remove |settings|.
   DCHECK_EQ(v8::DEFAULT, settings);
@@ -5139,13 +5027,24 @@ void Object::SetAccessorProperty(Local<Name> name, Local<Function> getter,
   i::Isolate* i_isolate = self->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
-  if (!self->IsJSObject()) return;
+  if (!IsJSObject(*self)) return;
   i::Handle<i::Object> getter_i = v8::Utils::OpenHandle(*getter);
   i::Handle<i::Object> setter_i = v8::Utils::OpenHandle(*setter, true);
   if (setter_i.is_null()) setter_i = i_isolate->factory()->null_value();
-  i::JSObject::DefineAccessor(i::Handle<i::JSObject>::cast(self),
-                              v8::Utils::OpenHandle(*name), getter_i, setter_i,
-                              static_cast<i::PropertyAttributes>(attribute));
+
+  i::PropertyDescriptor desc;
+  desc.set_enumerable(!(attributes & v8::DontEnum));
+  desc.set_configurable(!(attributes & v8::DontDelete));
+  desc.set_get(getter_i);
+  desc.set_set(setter_i);
+
+  i::Handle<i::Name> name_i = v8::Utils::OpenHandle(*name);
+  // DefineOwnProperty might still throw if the receiver is a JSProxy and it
+  // might fail if the receiver is non-extensible or already has this property
+  // as non-configurable.
+  Maybe<bool> success = i::JSReceiver::DefineOwnProperty(
+      i_isolate, self, name_i, &desc, Just(i::kDontThrow));
+  USE(success);
 }
 
 Maybe<bool> Object::SetNativeDataProperty(
@@ -5200,7 +5099,7 @@ Maybe<bool> v8::Object::HasRealNamedProperty(Local<Context> context,
   ENTER_V8_NO_SCRIPT(i_isolate, context, Object, HasRealNamedProperty,
                      Nothing<bool>(), i::HandleScope);
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSObject()) return Just(false);
+  if (!IsJSObject(*self)) return Just(false);
   auto key_val = Utils::OpenHandle(*key);
   auto result = i::JSObject::HasRealNamedProperty(
       i_isolate, i::Handle<i::JSObject>::cast(self), key_val);
@@ -5215,7 +5114,7 @@ Maybe<bool> v8::Object::HasRealIndexedProperty(Local<Context> context,
   ENTER_V8_NO_SCRIPT(i_isolate, context, Object, HasRealIndexedProperty,
                      Nothing<bool>(), i::HandleScope);
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSObject()) return Just(false);
+  if (!IsJSObject(*self)) return Just(false);
   auto result = i::JSObject::HasRealElementProperty(
       i_isolate, i::Handle<i::JSObject>::cast(self), index);
   has_pending_exception = result.IsNothing();
@@ -5229,7 +5128,7 @@ Maybe<bool> v8::Object::HasRealNamedCallbackProperty(Local<Context> context,
   ENTER_V8_NO_SCRIPT(i_isolate, context, Object, HasRealNamedCallbackProperty,
                      Nothing<bool>(), i::HandleScope);
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSObject()) return Just(false);
+  if (!IsJSObject(*self)) return Just(false);
   auto key_val = Utils::OpenHandle(*key);
   auto result = i::JSObject::HasRealNamedCallbackProperty(
       i_isolate, i::Handle<i::JSObject>::cast(self), key_val);
@@ -5240,14 +5139,14 @@ Maybe<bool> v8::Object::HasRealNamedCallbackProperty(Local<Context> context,
 
 bool v8::Object::HasNamedLookupInterceptor() const {
   auto self = *Utils::OpenHandle(this);
-  if (self.IsJSObject()) return false;
-  return i::JSObject::cast(self).HasNamedInterceptor();
+  if (!IsJSObject(*self)) return false;
+  return i::JSObject::cast(self)->HasNamedInterceptor();
 }
 
 bool v8::Object::HasIndexedLookupInterceptor() const {
   auto self = *Utils::OpenHandle(this);
-  if (self.IsJSObject()) return false;
-  return i::JSObject::cast(self).HasIndexedInterceptor();
+  if (!IsJSObject(*self)) return false;
+  return i::JSObject::cast(self)->HasIndexedInterceptor();
 }
 
 MaybeLocal<Value> v8::Object::GetRealNamedPropertyInPrototypeChain(
@@ -5255,7 +5154,7 @@ MaybeLocal<Value> v8::Object::GetRealNamedPropertyInPrototypeChain(
   PREPARE_FOR_EXECUTION(context, Object, GetRealNamedPropertyInPrototypeChain,
                         Value);
   i::Handle<i::JSReceiver> self = Utils::OpenHandle(this);
-  if (!self->IsJSObject()) return MaybeLocal<Value>();
+  if (!IsJSObject(*self)) return MaybeLocal<Value>();
   i::Handle<i::Name> key_obj = Utils::OpenHandle(*key);
   i::PrototypeIterator iter(i_isolate, self);
   if (iter.IsAtEnd()) return MaybeLocal<Value>();
@@ -5279,7 +5178,7 @@ v8::Object::GetRealNamedPropertyAttributesInPrototypeChain(
            GetRealNamedPropertyAttributesInPrototypeChain,
            Nothing<PropertyAttribute>(), i::HandleScope);
   i::Handle<i::JSReceiver> self = Utils::OpenHandle(this);
-  if (!self->IsJSObject()) return Nothing<PropertyAttribute>();
+  if (!IsJSObject(*self)) return Nothing<PropertyAttribute>();
   i::Handle<i::Name> key_obj = Utils::OpenHandle(*key);
   i::PrototypeIterator iter(i_isolate, self);
   if (iter.IsAtEnd()) return Nothing<PropertyAttribute>();
@@ -5343,7 +5242,7 @@ Local<v8::Object> v8::Object::Clone() {
 
 MaybeLocal<v8::Context> v8::Object::GetCreationContext() {
   auto self = Utils::OpenHandle(this);
-  i::Handle<i::Context> context;
+  i::Handle<i::NativeContext> context;
   if (self->GetCreationContext().ToHandle(&context)) {
     return Utils::ToLocal(context);
   }
@@ -5361,16 +5260,16 @@ void* v8::Object::GetAlignedPointerFromEmbedderDataInCreationContext(
   // The code below mostly mimics Context::GetAlignedPointerFromEmbedderData()
   // but it doesn't try to expand the EmbedderDataArray instance.
   i::DisallowGarbageCollection no_gc;
-  i::NativeContext native_context =
+  i::Tagged<i::NativeContext> native_context =
       i::NativeContext::cast(maybe_context.value());
-  i::Isolate* i_isolate = native_context.GetIsolate();
+  i::Isolate* i_isolate = native_context->GetIsolate();
 
   DCHECK_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   // TODO(ishell): remove cast once embedder_data slot has a proper type.
-  i::EmbedderDataArray data =
-      i::EmbedderDataArray::cast(native_context.embedder_data());
+  i::Tagged<i::EmbedderDataArray> data =
+      i::EmbedderDataArray::cast(native_context->embedder_data());
   if (V8_LIKELY(static_cast<unsigned>(index) <
-                static_cast<unsigned>(data.length()))) {
+                static_cast<unsigned>(data->length()))) {
     void* result;
     Utils::ApiCheck(
         i::EmbedderDataSlot(data, index).ToAlignedPointer(i_isolate, &result),
@@ -5403,12 +5302,12 @@ int v8::Object::GetIdentityHash() {
 
 bool v8::Object::IsCallable() const {
   auto self = Utils::OpenHandle(this);
-  return self->IsCallable();
+  return i::IsCallable(*self);
 }
 
 bool v8::Object::IsConstructor() const {
   auto self = Utils::OpenHandle(this);
-  return self->IsConstructor();
+  return i::IsConstructor(*self);
 }
 
 bool v8::Object::IsApiWrapper() const {
@@ -5419,7 +5318,7 @@ bool v8::Object::IsApiWrapper() const {
 
 bool v8::Object::IsUndetectable() const {
   auto self = i::Handle<i::JSObject>::cast(Utils::OpenHandle(this));
-  return self->IsUndetectable();
+  return i::IsUndetectable(*self);
 }
 
 MaybeLocal<Value> Object::CallAsFunction(Local<Context> context,
@@ -5495,17 +5394,19 @@ MaybeLocal<Object> Function::NewInstanceWithSideEffectType(
   static_assert(sizeof(v8::Local<v8::Value>) == sizeof(i::Handle<i::Object>));
   bool should_set_has_no_side_effect =
       side_effect_type == SideEffectType::kHasNoSideEffect &&
-      i_isolate->debug_execution_mode() == i::DebugInfo::kSideEffects;
+      i_isolate->should_check_side_effects();
   if (should_set_has_no_side_effect) {
-    CHECK(self->IsJSFunction() &&
-          i::JSFunction::cast(*self).shared().IsApiFunction());
-    i::Object obj =
-        i::JSFunction::cast(*self).shared().get_api_func_data().call_code(
+    CHECK(IsJSFunction(*self) &&
+          i::JSFunction::cast(*self)->shared()->IsApiFunction());
+    i::Tagged<i::Object> obj =
+        i::JSFunction::cast(*self)->shared()->api_func_data()->call_code(
             kAcquireLoad);
-    if (obj.IsCallHandlerInfo()) {
-      i::CallHandlerInfo handler_info = i::CallHandlerInfo::cast(obj);
-      if (!handler_info.IsSideEffectFreeCallHandlerInfo()) {
-        handler_info.SetNextCallHasNoSideEffect();
+    if (i::IsCallHandlerInfo(obj)) {
+      i::Tagged<i::CallHandlerInfo> handler_info =
+          i::CallHandlerInfo::cast(obj);
+      if (handler_info->IsSideEffectCallHandlerInfo()) {
+        i_isolate->debug()->IgnoreSideEffectsOnNextCallTo(
+            handle(handler_info, i_isolate));
       }
     }
   }
@@ -5513,21 +5414,6 @@ MaybeLocal<Object> Function::NewInstanceWithSideEffectType(
   Local<Object> result;
   has_pending_exception = !ToLocal<Object>(
       i::Execution::New(i_isolate, self, self, argc, args), &result);
-  if (should_set_has_no_side_effect) {
-    i::Object obj =
-        i::JSFunction::cast(*self).shared().get_api_func_data().call_code(
-            kAcquireLoad);
-    if (obj.IsCallHandlerInfo()) {
-      i::CallHandlerInfo handler_info = i::CallHandlerInfo::cast(obj);
-      if (has_pending_exception) {
-        // Restore the map if an exception prevented restoration.
-        handler_info.NextCallHasNoSideEffect();
-      } else {
-        DCHECK(handler_info.IsSideEffectCallHandlerInfo() ||
-               handler_info.IsSideEffectFreeCallHandlerInfo());
-      }
-    }
-  }
   RETURN_ON_FAILED_EXECUTION(Object);
   RETURN_ESCAPED(result);
 }
@@ -5547,14 +5433,16 @@ MaybeLocal<v8::Value> Function::Call(Local<Context> context,
                   "Function to be called is a null pointer");
   i::Handle<i::Object> recv_obj = Utils::OpenHandle(*recv);
   static_assert(sizeof(v8::Local<v8::Value>) == sizeof(i::Handle<i::Object>));
-#if V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+
+#ifdef V8_ENABLE_DIRECT_LOCAL
   i::Handle<i::Object>* args = new i::Handle<i::Object>[argc];
   for (int i = 0; i < argc; ++i) {
     args[i] = Utils::OpenHandle(*argv[i]);
   }
-#else
+#else   // !V8_ENABLE_DIRECT_LOCAL
   i::Handle<i::Object>* args = reinterpret_cast<i::Handle<i::Object>*>(argv);
-#endif
+#endif  // V8_ENABLE_DIRECT_LOCAL
+
   Local<Value> result;
   has_pending_exception = !ToLocal<Value>(
       i::Execution::Call(i_isolate, self, recv_obj, argc, args), &result);
@@ -5564,16 +5452,16 @@ MaybeLocal<v8::Value> Function::Call(Local<Context> context,
 
 void Function::SetName(v8::Local<v8::String> name) {
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSFunction()) return;
+  if (!IsJSFunction(*self)) return;
   auto func = i::Handle<i::JSFunction>::cast(self);
   DCHECK_NO_SCRIPT_NO_EXCEPTION(func->GetIsolate());
-  func->shared().SetName(*Utils::OpenHandle(*name));
+  func->shared()->SetName(*Utils::OpenHandle(*name));
 }
 
 Local<Value> Function::GetName() const {
   auto self = Utils::OpenHandle(this);
   i::Isolate* i_isolate = self->GetIsolate();
-  if (self->IsJSBoundFunction()) {
+  if (i::IsJSBoundFunction(*self)) {
     auto func = i::Handle<i::JSBoundFunction>::cast(self);
     i::Handle<i::Object> name;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -5581,27 +5469,27 @@ Local<Value> Function::GetName() const {
         Local<Value>());
     return Utils::ToLocal(name);
   }
-  if (self->IsJSFunction()) {
+  if (i::IsJSFunction(*self)) {
     auto func = i::Handle<i::JSFunction>::cast(self);
-    return Utils::ToLocal(handle(func->shared().Name(), i_isolate));
+    return Utils::ToLocal(handle(func->shared()->Name(), i_isolate));
   }
   return ToApiHandle<Primitive>(i_isolate->factory()->undefined_value());
 }
 
 Local<Value> Function::GetInferredName() const {
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSFunction()) {
+  if (!IsJSFunction(*self)) {
     return ToApiHandle<Primitive>(
         self->GetIsolate()->factory()->undefined_value());
   }
   auto func = i::Handle<i::JSFunction>::cast(self);
-  return Utils::ToLocal(
-      i::Handle<i::Object>(func->shared().inferred_name(), func->GetIsolate()));
+  return Utils::ToLocal(i::Handle<i::Object>(func->shared()->inferred_name(),
+                                             func->GetIsolate()));
 }
 
 Local<Value> Function::GetDebugName() const {
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSFunction()) {
+  if (!IsJSFunction(*self)) {
     return ToApiHandle<Primitive>(
         self->GetIsolate()->factory()->undefined_value());
   }
@@ -5613,10 +5501,10 @@ Local<Value> Function::GetDebugName() const {
 ScriptOrigin Function::GetScriptOrigin() const {
   auto self = Utils::OpenHandle(this);
   auto i_isolate = reinterpret_cast<v8::Isolate*>(self->GetIsolate());
-  if (!self->IsJSFunction()) return v8::ScriptOrigin(i_isolate, Local<Value>());
+  if (!IsJSFunction(*self)) return v8::ScriptOrigin(i_isolate, Local<Value>());
   auto func = i::Handle<i::JSFunction>::cast(self);
-  if (func->shared().script().IsScript()) {
-    i::Handle<i::Script> script(i::Script::cast(func->shared().script()),
+  if (i::IsScript(func->shared()->script())) {
+    i::Handle<i::Script> script(i::Script::cast(func->shared()->script()),
                                 func->GetIsolate());
     return GetScriptOriginForScript(func->GetIsolate(), script);
   }
@@ -5627,51 +5515,64 @@ const int Function::kLineOffsetNotFound = -1;
 
 int Function::GetScriptLineNumber() const {
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSFunction()) {
+  if (!IsJSFunction(*self)) {
     return kLineOffsetNotFound;
   }
   auto func = i::Handle<i::JSFunction>::cast(self);
-  if (func->shared().script().IsScript()) {
-    i::Handle<i::Script> script(i::Script::cast(func->shared().script()),
+  if (i::IsScript(func->shared()->script())) {
+    i::Handle<i::Script> script(i::Script::cast(func->shared()->script()),
                                 func->GetIsolate());
-    return i::Script::GetLineNumber(script, func->shared().StartPosition());
+    return i::Script::GetLineNumber(script, func->shared()->StartPosition());
   }
   return kLineOffsetNotFound;
 }
 
 int Function::GetScriptColumnNumber() const {
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSFunction()) {
+  if (!IsJSFunction(*self)) {
     return kLineOffsetNotFound;
   }
   auto func = i::Handle<i::JSFunction>::cast(self);
-  if (func->shared().script().IsScript()) {
-    i::Handle<i::Script> script(i::Script::cast(func->shared().script()),
+  if (i::IsScript(func->shared()->script())) {
+    i::Handle<i::Script> script(i::Script::cast(func->shared()->script()),
                                 func->GetIsolate());
-    return i::Script::GetColumnNumber(script, func->shared().StartPosition());
+    return i::Script::GetColumnNumber(script, func->shared()->StartPosition());
+  }
+  return kLineOffsetNotFound;
+}
+
+int Function::GetScriptStartPosition() const {
+  auto self = Utils::OpenHandle(this);
+  if (!IsJSFunction(*self)) {
+    return kLineOffsetNotFound;
+  }
+  auto func = i::Handle<i::JSFunction>::cast(self);
+  if (i::IsScript(func->shared()->script())) {
+    return func->shared()->StartPosition();
   }
   return kLineOffsetNotFound;
 }
 
 MaybeLocal<UnboundScript> Function::GetUnboundScript() const {
   i::Handle<i::JSReceiver> self = Utils::OpenHandle(this);
-  if (!self->IsJSFunction()) return MaybeLocal<UnboundScript>();
-  i::SharedFunctionInfo sfi = i::JSFunction::cast(*self).shared();
+  if (!IsJSFunction(*self)) return MaybeLocal<UnboundScript>();
+  i::Tagged<i::SharedFunctionInfo> sfi = i::JSFunction::cast(*self)->shared();
   i::Isolate* i_isolate = self->GetIsolate();
   return ToApiHandle<UnboundScript>(i::handle(sfi, i_isolate));
 }
 
 int Function::ScriptId() const {
-  i::JSReceiver self = *Utils::OpenHandle(this);
-  if (!self.IsJSFunction()) return v8::UnboundScript::kNoScriptId;
+  i::Tagged<i::JSReceiver> self = *Utils::OpenHandle(this);
+  if (!IsJSFunction(self)) return v8::UnboundScript::kNoScriptId;
   auto func = i::JSFunction::cast(self);
-  if (!func.shared().script().IsScript()) return v8::UnboundScript::kNoScriptId;
-  return i::Script::cast(func.shared().script()).id();
+  if (!IsScript(func->shared()->script()))
+    return v8::UnboundScript::kNoScriptId;
+  return i::Script::cast(func->shared()->script())->id();
 }
 
 Local<v8::Value> Function::GetBoundFunction() const {
   auto self = Utils::OpenHandle(this);
-  if (self->IsJSBoundFunction()) {
+  if (i::IsJSBoundFunction(*self)) {
     auto bound_function = i::Handle<i::JSBoundFunction>::cast(self);
     auto bound_target_function = i::handle(
         bound_function->bound_target_function(), bound_function->GetIsolate());
@@ -5682,10 +5583,10 @@ Local<v8::Value> Function::GetBoundFunction() const {
 
 bool Function::Experimental_IsNopFunction() const {
   auto self = Utils::OpenHandle(this);
-  if (!self->IsJSFunction()) return false;
-  i::SharedFunctionInfo sfi = i::JSFunction::cast(*self).shared();
+  if (!IsJSFunction(*self)) return false;
+  i::Tagged<i::SharedFunctionInfo> sfi = i::JSFunction::cast(*self)->shared();
   i::Isolate* i_isolate = self->GetIsolate();
-  i::IsCompiledScope is_compiled_scope(sfi.is_compiled_scope(i_isolate));
+  i::IsCompiledScope is_compiled_scope(sfi->is_compiled_scope(i_isolate));
   if (!is_compiled_scope.is_compiled() &&
       !i::Compiler::Compile(i_isolate, i::handle(sfi, i_isolate),
                             i::Compiler::CLEAR_EXCEPTION, &is_compiled_scope)) {
@@ -5693,9 +5594,9 @@ bool Function::Experimental_IsNopFunction() const {
   }
   DCHECK(is_compiled_scope.is_compiled());
   // Since |sfi| can be GC'ed, we get it again.
-  sfi = i::JSFunction::cast(*self).shared();
-  if (!sfi.HasBytecodeArray()) return false;
-  i::Handle<i::BytecodeArray> bytecode_array(sfi.GetBytecodeArray(i_isolate),
+  sfi = i::JSFunction::cast(*self)->shared();
+  if (!sfi->HasBytecodeArray()) return false;
+  i::Handle<i::BytecodeArray> bytecode_array(sfi->GetBytecodeArray(i_isolate),
                                              i_isolate);
   i::interpreter::BytecodeArrayIterator it(bytecode_array, 0);
   if (it.current_bytecode() != i::interpreter::Bytecode::kLdaUndefined) {
@@ -5764,8 +5665,9 @@ class ContainsOnlyOneByteHelper {
   ContainsOnlyOneByteHelper(const ContainsOnlyOneByteHelper&) = delete;
   ContainsOnlyOneByteHelper& operator=(const ContainsOnlyOneByteHelper&) =
       delete;
-  bool Check(i::String string) {
-    i::ConsString cons_string = i::String::VisitFlat(this, string, 0);
+  bool Check(i::Tagged<i::String> string) {
+    i::Tagged<i::ConsString> cons_string =
+        i::String::VisitFlat(this, string, 0);
     if (cons_string.is_null()) return is_one_byte_;
     return CheckCons(cons_string);
   }
@@ -5805,19 +5707,21 @@ class ContainsOnlyOneByteHelper {
   }
 
  private:
-  bool CheckCons(i::ConsString cons_string) {
+  bool CheckCons(i::Tagged<i::ConsString> cons_string) {
     while (true) {
       // Check left side if flat.
-      i::String left = cons_string.first();
-      i::ConsString left_as_cons = i::String::VisitFlat(this, left, 0);
+      i::Tagged<i::String> left = cons_string->first();
+      i::Tagged<i::ConsString> left_as_cons =
+          i::String::VisitFlat(this, left, 0);
       if (!is_one_byte_) return false;
       // Check right side if flat.
-      i::String right = cons_string.second();
-      i::ConsString right_as_cons = i::String::VisitFlat(this, right, 0);
+      i::Tagged<i::String> right = cons_string->second();
+      i::Tagged<i::ConsString> right_as_cons =
+          i::String::VisitFlat(this, right, 0);
       if (!is_one_byte_) return false;
       // Standard recurse/iterate trick.
       if (!left_as_cons.is_null() && !right_as_cons.is_null()) {
-        if (left.length() < right.length()) {
+        if (left->length() < right->length()) {
           CheckCons(left_as_cons);
           cons_string = right_as_cons;
         } else {
@@ -6058,13 +5962,13 @@ int String::Write(Isolate* v8_isolate, uint16_t* buffer, int start, int length,
 
 namespace {
 
-bool HasExternalStringResource(i::String string) {
+bool HasExternalStringResource(i::Tagged<i::String> string) {
   return i::StringShape(string).IsExternal() ||
-         string.HasExternalForwardingIndex(kAcquireLoad);
+         string->HasExternalForwardingIndex(kAcquireLoad);
 }
 
 v8::String::ExternalStringResourceBase* GetExternalResourceFromForwardingTable(
-    i::String string, uint32_t raw_hash, bool* is_one_byte) {
+    i::Tagged<i::String> string, uint32_t raw_hash, bool* is_one_byte) {
   DCHECK(i::String::IsExternalForwardingIndex(raw_hash));
   const int index = i::String::ForwardingIndexValueBits::decode(raw_hash);
   i::Isolate* isolate = i::GetIsolateFromWritableObject(string);
@@ -6108,18 +6012,18 @@ bool v8::String::IsExternalOneByte() const {
 void v8::String::VerifyExternalStringResource(
     v8::String::ExternalStringResource* value) const {
   i::DisallowGarbageCollection no_gc;
-  i::String str = *Utils::OpenHandle(this);
+  i::Tagged<i::String> str = *Utils::OpenHandle(this);
   const v8::String::ExternalStringResource* expected;
 
-  if (str.IsThinString()) {
-    str = i::ThinString::cast(str).actual();
+  if (i::IsThinString(str)) {
+    str = i::ThinString::cast(str)->actual();
   }
 
   if (i::StringShape(str).IsExternalTwoByte()) {
-    const void* resource = i::ExternalTwoByteString::cast(str).resource();
+    const void* resource = i::ExternalTwoByteString::cast(str)->resource();
     expected = reinterpret_cast<const ExternalStringResource*>(resource);
   } else {
-    uint32_t raw_hash_field = str.raw_hash_field(kAcquireLoad);
+    uint32_t raw_hash_field = str->raw_hash_field(kAcquireLoad);
     if (i::String::IsExternalForwardingIndex(raw_hash_field)) {
       bool is_one_byte;
       auto resource = GetExternalResourceFromForwardingTable(
@@ -6137,24 +6041,24 @@ void v8::String::VerifyExternalStringResource(
 void v8::String::VerifyExternalStringResourceBase(
     v8::String::ExternalStringResourceBase* value, Encoding encoding) const {
   i::DisallowGarbageCollection no_gc;
-  i::String str = *Utils::OpenHandle(this);
+  i::Tagged<i::String> str = *Utils::OpenHandle(this);
   const v8::String::ExternalStringResourceBase* expected;
   Encoding expectedEncoding;
 
-  if (str.IsThinString()) {
-    str = i::ThinString::cast(str).actual();
+  if (i::IsThinString(str)) {
+    str = i::ThinString::cast(str)->actual();
   }
 
   if (i::StringShape(str).IsExternalOneByte()) {
-    const void* resource = i::ExternalOneByteString::cast(str).resource();
+    const void* resource = i::ExternalOneByteString::cast(str)->resource();
     expected = reinterpret_cast<const ExternalStringResourceBase*>(resource);
     expectedEncoding = ONE_BYTE_ENCODING;
   } else if (i::StringShape(str).IsExternalTwoByte()) {
-    const void* resource = i::ExternalTwoByteString::cast(str).resource();
+    const void* resource = i::ExternalTwoByteString::cast(str)->resource();
     expected = reinterpret_cast<const ExternalStringResourceBase*>(resource);
     expectedEncoding = TWO_BYTE_ENCODING;
   } else {
-    uint32_t raw_hash_field = str.raw_hash_field(kAcquireLoad);
+    uint32_t raw_hash_field = str->raw_hash_field(kAcquireLoad);
     if (i::String::IsExternalForwardingIndex(raw_hash_field)) {
       bool is_one_byte;
       expected = GetExternalResourceFromForwardingTable(str, raw_hash_field,
@@ -6162,8 +6066,8 @@ void v8::String::VerifyExternalStringResourceBase(
       expectedEncoding = is_one_byte ? ONE_BYTE_ENCODING : TWO_BYTE_ENCODING;
     } else {
       expected = nullptr;
-      expectedEncoding =
-          str.IsOneByteRepresentation() ? ONE_BYTE_ENCODING : TWO_BYTE_ENCODING;
+      expectedEncoding = str->IsOneByteRepresentation() ? ONE_BYTE_ENCODING
+                                                        : TWO_BYTE_ENCODING;
     }
   }
   CHECK_EQ(expected, value);
@@ -6172,10 +6076,10 @@ void v8::String::VerifyExternalStringResourceBase(
 
 String::ExternalStringResource* String::GetExternalStringResourceSlow() const {
   i::DisallowGarbageCollection no_gc;
-  i::String str = *Utils::OpenHandle(this);
+  i::Tagged<i::String> str = *Utils::OpenHandle(this);
 
-  if (str.IsThinString()) {
-    str = i::ThinString::cast(str).actual();
+  if (i::IsThinString(str)) {
+    str = i::ThinString::cast(str)->actual();
   }
 
   if (i::StringShape(str).IsExternalTwoByte()) {
@@ -6185,7 +6089,7 @@ String::ExternalStringResource* String::GetExternalStringResourceSlow() const {
             isolate, str.ptr(), i::Internals::kStringResourceOffset);
     return reinterpret_cast<String::ExternalStringResource*>(value);
   } else {
-    uint32_t raw_hash_field = str.raw_hash_field(kAcquireLoad);
+    uint32_t raw_hash_field = str->raw_hash_field(kAcquireLoad);
     if (i::String::IsExternalForwardingIndex(raw_hash_field)) {
       bool is_one_byte;
       auto resource = GetExternalResourceFromForwardingTable(
@@ -6220,10 +6124,10 @@ String::ExternalStringResourceBase* String::GetExternalStringResourceBaseSlow(
     String::Encoding* encoding_out) const {
   i::DisallowGarbageCollection no_gc;
   ExternalStringResourceBase* resource = nullptr;
-  i::String str = *Utils::OpenHandle(this);
+  i::Tagged<i::String> str = *Utils::OpenHandle(this);
 
-  if (str.IsThinString()) {
-    str = i::ThinString::cast(str).actual();
+  if (i::IsThinString(str)) {
+    str = i::ThinString::cast(str)->actual();
   }
 
   internal::Address string = str.ptr();
@@ -6239,7 +6143,7 @@ String::ExternalStringResourceBase* String::GetExternalStringResourceBaseSlow(
             isolate, string, i::Internals::kStringResourceOffset);
     resource = reinterpret_cast<ExternalStringResourceBase*>(value);
   } else {
-    uint32_t raw_hash_field = str.raw_hash_field();
+    uint32_t raw_hash_field = str->raw_hash_field();
     if (i::String::IsExternalForwardingIndex(raw_hash_field)) {
       bool is_one_byte;
       resource = GetExternalResourceFromForwardingTable(str, raw_hash_field,
@@ -6254,16 +6158,16 @@ String::ExternalStringResourceBase* String::GetExternalStringResourceBaseSlow(
 const v8::String::ExternalOneByteStringResource*
 v8::String::GetExternalOneByteStringResource() const {
   i::DisallowGarbageCollection no_gc;
-  i::String str = *Utils::OpenHandle(this);
+  i::Tagged<i::String> str = *Utils::OpenHandle(this);
   if (i::StringShape(str).IsExternalOneByte()) {
-    return i::ExternalOneByteString::cast(str).resource();
-  } else if (str.IsThinString()) {
-    str = i::ThinString::cast(str).actual();
+    return i::ExternalOneByteString::cast(str)->resource();
+  } else if (i::IsThinString(str)) {
+    str = i::ThinString::cast(str)->actual();
     if (i::StringShape(str).IsExternalOneByte()) {
-      return i::ExternalOneByteString::cast(str).resource();
+      return i::ExternalOneByteString::cast(str)->resource();
     }
   }
-  uint32_t raw_hash_field = str.raw_hash_field(kAcquireLoad);
+  uint32_t raw_hash_field = str->raw_hash_field(kAcquireLoad);
   if (i::String::IsExternalForwardingIndex(raw_hash_field)) {
     bool is_one_byte;
     auto resource = GetExternalResourceFromForwardingTable(str, raw_hash_field,
@@ -6293,51 +6197,51 @@ Local<Value> Private::Name() const {
 
 double Number::Value() const {
   i::Handle<i::Object> obj = Utils::OpenHandle(this);
-  return obj->Number();
+  return i::Object::Number(*obj);
 }
 
 bool Boolean::Value() const {
   i::Handle<i::Object> obj = Utils::OpenHandle(this);
-  return obj->IsTrue();
+  return i::IsTrue(*obj);
 }
 
 int64_t Integer::Value() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  if (obj.IsSmi()) {
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  if (i::IsSmi(obj)) {
     return i::Smi::ToInt(obj);
   } else {
-    return static_cast<int64_t>(obj.Number());
+    return static_cast<int64_t>(i::Object::Number(obj));
   }
 }
 
 int32_t Int32::Value() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  if (obj.IsSmi()) {
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  if (i::IsSmi(obj)) {
     return i::Smi::ToInt(obj);
   } else {
-    return static_cast<int32_t>(obj.Number());
+    return static_cast<int32_t>(i::Object::Number(obj));
   }
 }
 
 uint32_t Uint32::Value() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  if (obj.IsSmi()) {
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  if (i::IsSmi(obj)) {
     return i::Smi::ToInt(obj);
   } else {
-    return static_cast<uint32_t>(obj.Number());
+    return static_cast<uint32_t>(i::Object::Number(obj));
   }
 }
 
 int v8::Object::InternalFieldCount() const {
-  i::JSReceiver self = *Utils::OpenHandle(this);
-  if (!self.IsJSObject()) return 0;
-  return i::JSObject::cast(self).GetEmbedderFieldCount();
+  i::Tagged<i::JSReceiver> self = *Utils::OpenHandle(this);
+  if (!IsJSObject(self)) return 0;
+  return i::JSObject::cast(self)->GetEmbedderFieldCount();
 }
 
 static bool InternalFieldOK(i::Handle<i::JSReceiver> obj, int index,
                             const char* location) {
   return Utils::ApiCheck(
-      obj->IsJSObject() &&
+      IsJSObject(*obj) &&
           (index < i::Handle<i::JSObject>::cast(obj)->GetEmbedderFieldCount()),
       location, "Internal field out of bounds");
 }
@@ -6346,7 +6250,7 @@ Local<Data> v8::Object::SlowGetInternalField(int index) {
   i::Handle<i::JSReceiver> obj = Utils::OpenHandle(this);
   const char* location = "v8::Object::GetInternalField()";
   if (!InternalFieldOK(obj, index, location)) return Local<Value>();
-  i::Handle<i::Object> value(i::JSObject::cast(*obj).GetEmbedderField(index),
+  i::Handle<i::Object> value(i::JSObject::cast(*obj)->GetEmbedderField(index),
                              obj->GetIsolate());
   return ToApiHandle<Data>(value);
 }
@@ -6390,8 +6294,8 @@ void v8::Object::SetAlignedPointerInInternalFields(int argc, int indices[],
 
   i::DisallowGarbageCollection no_gc;
   const char* location = "v8::Object::SetAlignedPointerInInternalFields()";
-  i::JSObject js_obj = i::JSObject::cast(*obj);
-  int nof_embedder_fields = js_obj.GetEmbedderFieldCount();
+  i::Tagged<i::JSObject> js_obj = i::JSObject::cast(*obj);
+  int nof_embedder_fields = js_obj->GetEmbedderFieldCount();
   for (int i = 0; i < argc; i++) {
     int index = indices[i];
     if (!Utils::ApiCheck(index < nof_embedder_fields, location,
@@ -6607,8 +6511,8 @@ template <typename ObjectType>
 struct InvokeBootstrapper;
 
 template <>
-struct InvokeBootstrapper<i::Context> {
-  i::Handle<i::Context> Invoke(
+struct InvokeBootstrapper<i::NativeContext> {
+  i::Handle<i::NativeContext> Invoke(
       i::Isolate* i_isolate,
       i::MaybeHandle<i::JSGlobalProxy> maybe_global_proxy,
       v8::Local<v8::ObjectTemplate> global_proxy_template,
@@ -6678,7 +6582,7 @@ static i::Handle<ObjectType> CreateEnvironment(
       // Migrate security handlers from global_template to
       // proxy_template.  Temporarily removing access check
       // information from the global template.
-      if (!global_constructor->GetAccessCheckInfo().IsUndefined(i_isolate)) {
+      if (!IsUndefined(global_constructor->GetAccessCheckInfo(), i_isolate)) {
         i::FunctionTemplateInfo::SetAccessCheckInfo(
             i_isolate, proxy_constructor,
             i::handle(global_constructor->GetAccessCheckInfo(), i_isolate));
@@ -6694,16 +6598,16 @@ static i::Handle<ObjectType> CreateEnvironment(
       // interceptors, we need to replace them temporarily with noop
       // interceptors, so the map is correctly marked as having interceptors,
       // but we don't invoke any.
-      if (!global_constructor->GetNamedPropertyHandler().IsUndefined(
-              i_isolate)) {
+      if (!IsUndefined(global_constructor->GetNamedPropertyHandler(),
+                       i_isolate)) {
         named_interceptor =
             handle(global_constructor->GetNamedPropertyHandler(), i_isolate);
         i::FunctionTemplateInfo::SetNamedPropertyHandler(
             i_isolate, global_constructor,
             i::ReadOnlyRoots(i_isolate).noop_interceptor_info_handle());
       }
-      if (!global_constructor->GetIndexedPropertyHandler().IsUndefined(
-              i_isolate)) {
+      if (!IsUndefined(global_constructor->GetIndexedPropertyHandler(),
+                       i_isolate)) {
         indexed_interceptor =
             handle(global_constructor->GetIndexedPropertyHandler(), i_isolate);
         i::FunctionTemplateInfo::SetIndexedPropertyHandler(
@@ -6753,14 +6657,14 @@ Local<Context> NewContext(
   // TODO(jkummerow): This is for crbug.com/713699. Remove it if it doesn't
   // fail.
   // Sanity-check that the isolate is initialized and usable.
-  CHECK(i_isolate->builtins()->code(i::Builtin::kIllegal).IsCode());
+  CHECK(IsCode(i_isolate->builtins()->code(i::Builtin::kIllegal)));
 
   TRACE_EVENT_CALL_STATS_SCOPED(i_isolate, "v8", "V8.NewContext");
   API_RCS_SCOPE(i_isolate, Context, New);
   i::HandleScope scope(i_isolate);
   ExtensionConfiguration no_extensions;
   if (extensions == nullptr) extensions = &no_extensions;
-  i::Handle<i::Context> env = CreateEnvironment<i::Context>(
+  i::Handle<i::NativeContext> env = CreateEnvironment<i::NativeContext>(
       i_isolate, extensions, global_template, global_object,
       context_snapshot_index, embedder_fields_deserializer, microtask_queue);
   if (env.is_null()) {
@@ -6827,20 +6731,20 @@ MaybeLocal<Object> v8::Context::NewRemoteContext(
 }
 
 void v8::Context::SetSecurityToken(Local<Value> token) {
-  i::Handle<i::Context> env = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> env = Utils::OpenHandle(this);
   i::Handle<i::Object> token_handle = Utils::OpenHandle(*token);
   env->set_security_token(*token_handle);
 }
 
 void v8::Context::UseDefaultSecurityToken() {
-  i::Handle<i::Context> env = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> env = Utils::OpenHandle(this);
   env->set_security_token(env->global_object());
 }
 
 Local<Value> v8::Context::GetSecurityToken() {
-  i::Handle<i::Context> env = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> env = Utils::OpenHandle(this);
   i::Isolate* i_isolate = env->GetIsolate();
-  i::Object security_token = env->security_token();
+  i::Tagged<i::Object> security_token = env->security_token();
   i::Handle<i::Object> token_handle(security_token, i_isolate);
   return Utils::ToLocal(token_handle);
 }
@@ -6904,6 +6808,7 @@ bool IsJSReceiverSafeToFreeze(i::InstanceType obj_type) {
 #if V8_ENABLE_WEBASSEMBLY
     case i::WASM_ARRAY_TYPE:
     case i::WASM_STRUCT_TYPE:
+    case i::WASM_TAG_OBJECT_TYPE:
 #endif  // V8_ENABLE_WEBASSEMBLY
     case i::JS_PROXY_TYPE:
       return true;
@@ -6933,6 +6838,9 @@ class ObjectVisitorDeepFreezer : i::ObjectVisitor {
 
   bool DeepFreeze(i::Handle<i::Context> context) {
     bool success = VisitObject(i::HeapObject::cast(*context));
+    if (success) {
+      success = InstantiateAndVisitLazyAccessorPairs();
+    }
     DCHECK_EQ(success, !error_.has_value());
     if (!success) {
       THROW_NEW_ERROR_RETURN_VALUE(
@@ -6948,22 +6856,21 @@ class ObjectVisitorDeepFreezer : i::ObjectVisitor {
     return true;
   }
 
-  void VisitPointers(i::HeapObject host, i::ObjectSlot start,
+  void VisitPointers(i::Tagged<i::HeapObject> host, i::ObjectSlot start,
                      i::ObjectSlot end) final {
     VisitPointersImpl(start, end);
   }
-  void VisitPointers(i::HeapObject host, i::MaybeObjectSlot start,
+  void VisitPointers(i::Tagged<i::HeapObject> host, i::MaybeObjectSlot start,
                      i::MaybeObjectSlot end) final {
     VisitPointersImpl(start, end);
   }
-  void VisitMapPointer(i::HeapObject host) final {
-    VisitPointer(host, host.map_slot());
+  void VisitMapPointer(i::Tagged<i::HeapObject> host) final {
+    VisitPointer(host, host->map_slot());
   }
-  void VisitCodePointer(i::Code host, i::CodeObjectSlot slot) final {}
-  void VisitCodeTarget(i::RelocInfo* rinfo) final {}
-  void VisitEmbeddedPointer(i::RelocInfo* rinfo) final {}
-  void VisitCustomWeakPointers(i::HeapObject host, i::ObjectSlot start,
-                               i::ObjectSlot end) final {}
+  void VisitInstructionStreamPointer(i::Tagged<i::Code> host,
+                                     i::InstructionStreamSlot slot) final {}
+  void VisitCustomWeakPointers(i::Tagged<i::HeapObject> host,
+                               i::ObjectSlot start, i::ObjectSlot end) final {}
 
  private:
   struct ErrorInfo {
@@ -6975,7 +6882,7 @@ class ObjectVisitorDeepFreezer : i::ObjectVisitor {
   void VisitPointersImpl(TSlot start, TSlot end) {
     for (TSlot current = start; current < end; ++current) {
       typename TSlot::TObject object = current.load(isolate_);
-      i::HeapObject heap_object;
+      i::Tagged<i::HeapObject> heap_object;
       if (object.GetHeapObjectIfStrong(&heap_object)) {
         if (!VisitObject(heap_object)) {
           return;
@@ -6999,14 +6906,14 @@ class ObjectVisitorDeepFreezer : i::ObjectVisitor {
     return true;
   }
 
-  bool VisitObject(i::HeapObject obj) {
+  bool VisitObject(i::Tagged<i::HeapObject> obj) {
     DCHECK(!obj.is_null());
     if (error_.has_value()) {
       return false;
     }
 
     i::DisallowGarbageCollection no_gc;
-    i::InstanceType obj_type = obj.map().instance_type();
+    i::InstanceType obj_type = obj->map()->instance_type();
 
     // Skip common types that can't contain items to freeze.
     if (!MayContainObjectsToFreeze(obj_type)) {
@@ -7022,22 +6929,20 @@ class ObjectVisitorDeepFreezer : i::ObjectVisitor {
     if (i::InstanceTypeChecker::IsAccessorPair(obj_type)) {
       // For AccessorPairs we need to ensure that the functions they point to
       // have been instantiated into actual JavaScript objects that can be
-      // frozen. TODO(behamilton): If they haven't then we need to save them to
-      // instantiate (and recurse) before freezing.
-      i::AccessorPair accessor_pair = i::AccessorPair::cast(obj);
-      if (accessor_pair.getter().IsFunctionTemplateInfo() ||
-          accessor_pair.setter().IsFunctionTemplateInfo()) {
-        // TODO(behamilton): Handle this more gracefully.
-        error_ = ErrorInfo{i::MessageTemplate::kCannotDeepFreezeObject,
-                           isolate_->factory()->empty_string()};
-        return false;
+      // frozen. If they haven't then we need to save them to instantiate
+      // (and recurse) before freezing.
+      i::Tagged<i::AccessorPair> accessor_pair = i::AccessorPair::cast(obj);
+      if (i::IsFunctionTemplateInfo(accessor_pair->getter()) ||
+          IsFunctionTemplateInfo(accessor_pair->setter())) {
+        i::Handle<i::AccessorPair> lazy_accessor_pair(accessor_pair, isolate_);
+        lazy_accessor_pairs_to_freeze_.push_back(lazy_accessor_pair);
       }
     } else if (i::InstanceTypeChecker::IsContext(obj_type)) {
       // For contexts we need to ensure that all accessible locals are const.
       // If not they could be replaced to bypass freezing.
-      i::ScopeInfo scope_info = i::Context::cast(obj).scope_info();
-      for (auto it : i::ScopeInfo::IterateLocalNames(&scope_info, no_gc)) {
-        if (scope_info.ContextLocalMode(it->index()) !=
+      i::Tagged<i::ScopeInfo> scope_info = i::Context::cast(obj)->scope_info();
+      for (auto it : i::ScopeInfo::IterateLocalNames(scope_info, no_gc)) {
+        if (scope_info->ContextLocalMode(it->index()) !=
             i::VariableMode::kConst) {
           DCHECK(!error_.has_value());
           error_ = ErrorInfo{i::MessageTemplate::kCannotDeepFreezeValue,
@@ -7073,7 +6978,7 @@ class ObjectVisitorDeepFreezer : i::ObjectVisitor {
       } else {
         DCHECK_IMPLIES(
             i::InstanceTypeChecker::IsJSObject(obj_type),
-            i::JSObject::cast(*receiver).GetEmbedderFieldCount() == 0);
+            i::JSObject::cast(*receiver)->GetEmbedderFieldCount() == 0);
         if (!IsJSReceiverSafeToFreeze(obj_type)) {
           DCHECK(!error_.has_value());
           error_ = ErrorInfo{i::MessageTemplate::kCannotDeepFreezeObject,
@@ -7094,22 +6999,41 @@ class ObjectVisitorDeepFreezer : i::ObjectVisitor {
     }
 
     DCHECK(!error_.has_value());
-    obj.Iterate(isolate_, this);
+    obj->Iterate(isolate_, this);
     // Iterate sets error_ on failure. We should propagate errors.
     return !error_.has_value();
   }
 
+  bool InstantiateAndVisitLazyAccessorPairs() {
+    i::Handle<i::NativeContext> native_context = isolate_->native_context();
+
+    std::vector<i::Handle<i::AccessorPair>> lazy_accessor_pairs_to_freeze;
+    std::swap(lazy_accessor_pairs_to_freeze, lazy_accessor_pairs_to_freeze_);
+
+    for (const auto& accessor_pair : lazy_accessor_pairs_to_freeze) {
+      i::AccessorPair::GetComponent(isolate_, native_context, accessor_pair,
+                                    i::ACCESSOR_GETTER);
+      i::AccessorPair::GetComponent(isolate_, native_context, accessor_pair,
+                                    i::ACCESSOR_SETTER);
+      VisitObject(*accessor_pair);
+    }
+    // Ensure no new lazy accessor pairs were discovered.
+    CHECK_EQ(lazy_accessor_pairs_to_freeze_.size(), 0);
+    return true;
+  }
+
   i::Isolate* isolate_;
   Context::DeepFreezeDelegate* delegate_;
   std::unordered_set<i::Object, i::Object::Hasher> done_list_;
   std::vector<i::Handle<i::JSReceiver>> objects_to_freeze_;
+  std::vector<i::Handle<i::AccessorPair>> lazy_accessor_pairs_to_freeze_;
   base::Optional<ErrorInfo> error_;
 };
 
 }  // namespace
 
 Maybe<void> Context::DeepFreeze(DeepFreezeDelegate* delegate) {
-  i::Handle<i::Context> env = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> env = Utils::OpenHandle(this);
   i::Isolate* i_isolate = env->GetIsolate();
 
   // TODO(behamilton): Incorporate compatibility improvements similar to NodeJS:
@@ -7127,21 +7051,22 @@ Maybe<void> Context::DeepFreeze(DeepFreezeDelegate* delegate) {
 }
 
 v8::Isolate* Context::GetIsolate() {
-  i::Handle<i::Context> env = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> env = Utils::OpenHandle(this);
   return reinterpret_cast<Isolate*>(env->GetIsolate());
 }
 
 v8::MicrotaskQueue* Context::GetMicrotaskQueue() {
-  i::Handle<i::Context> env = Utils::OpenHandle(this);
-  Utils::ApiCheck(env->IsNativeContext(), "v8::Context::GetMicrotaskQueue",
+  i::Handle<i::NativeContext> env = Utils::OpenHandle(this);
+  Utils::ApiCheck(i::IsNativeContext(*env), "v8::Context::GetMicrotaskQueue",
                   "Must be called on a native context");
   return i::Handle<i::NativeContext>::cast(env)->microtask_queue();
 }
 
 void Context::SetMicrotaskQueue(v8::MicrotaskQueue* queue) {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
-  Utils::ApiCheck(context->IsNativeContext(), "v8::Context::SetMicrotaskQueue",
+  Utils::ApiCheck(i::IsNativeContext(*context),
+                  "v8::Context::SetMicrotaskQueue",
                   "Must be called on a native context");
   i::Handle<i::NativeContext> native_context =
       i::Handle<i::NativeContext>::cast(context);
@@ -7160,7 +7085,7 @@ void Context::SetMicrotaskQueue(v8::MicrotaskQueue* queue) {
 }
 
 v8::Local<v8::Object> Context::Global() {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
   i::Handle<i::Object> global(context->global_proxy(), i_isolate);
   // TODO(chromium:324812): This should always return the global proxy
@@ -7173,48 +7098,48 @@ v8::Local<v8::Object> Context::Global() {
 }
 
 void Context::DetachGlobal() {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i_isolate->DetachGlobal(context);
 }
 
 Local<v8::Object> Context::GetExtrasBindingObject() {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
   i::Handle<i::JSObject> binding(context->extras_binding_object(), i_isolate);
   return Utils::ToLocal(binding);
 }
 
 void Context::AllowCodeGenerationFromStrings(bool allow) {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   context->set_allow_code_gen_from_strings(
-      allow ? i::ReadOnlyRoots(i_isolate).true_value()
-            : i::ReadOnlyRoots(i_isolate).false_value());
+      i::ReadOnlyRoots(i_isolate).boolean_value(allow));
 }
 
 bool Context::IsCodeGenerationFromStringsAllowed() const {
-  i::Context context = *Utils::OpenHandle(this);
-  return !context.allow_code_gen_from_strings().IsFalse(context.GetIsolate());
+  i::Tagged<i::NativeContext> context = *Utils::OpenHandle(this);
+  return !IsFalse(context->allow_code_gen_from_strings(),
+                  context->GetIsolate());
 }
 
 void Context::SetErrorMessageForCodeGenerationFromStrings(Local<String> error) {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Handle<i::String> error_handle = Utils::OpenHandle(*error);
   context->set_error_message_for_code_gen_from_strings(*error_handle);
 }
 
 void Context::SetErrorMessageForWasmCodeGeneration(Local<String> error) {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Handle<i::String> error_handle = Utils::OpenHandle(*error);
   context->set_error_message_for_wasm_code_gen(*error_handle);
 }
 
 void Context::SetAbortScriptExecution(
     Context::AbortScriptExecutionCallback callback) {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
   if (callback == nullptr) {
     context->set_script_execution_callback(
@@ -7226,20 +7151,20 @@ void Context::SetAbortScriptExecution(
 }
 
 Local<Value> Context::GetContinuationPreservedEmbedderData() const {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
   i::Handle<i::Object> data(
-      context->native_context().continuation_preserved_embedder_data(),
+      context->native_context()->continuation_preserved_embedder_data(),
       i_isolate);
   return ToApiHandle<Object>(data);
 }
 
 void Context::SetContinuationPreservedEmbedderData(Local<Value> data) {
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
   if (data.IsEmpty())
     data = v8::Undefined(reinterpret_cast<v8::Isolate*>(i_isolate));
-  context->native_context().set_continuation_preserved_embedder_data(
+  context->native_context()->set_continuation_preserved_embedder_data(
       *i::Handle<i::HeapObject>::cast(Utils::OpenHandle(*data)));
 }
 
@@ -7248,7 +7173,7 @@ void v8::Context::SetPromiseHooks(Local<Function> init_hook,
                                   Local<Function> after_hook,
                                   Local<Function> resolve_hook) {
 #ifdef V8_ENABLE_JAVASCRIPT_PROMISE_HOOKS
-  i::Handle<i::Context> context = Utils::OpenHandle(this);
+  i::Handle<i::NativeContext> context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
 
   i::Handle<i::Object> init = i_isolate->factory()->undefined_value();
@@ -7277,10 +7202,10 @@ void v8::Context::SetPromiseHooks(Local<Function> init_hook,
 
   i_isolate->SetHasContextPromiseHooks(has_hook);
 
-  context->native_context().set_promise_hook_init_function(*init);
-  context->native_context().set_promise_hook_before_function(*before);
-  context->native_context().set_promise_hook_after_function(*after);
-  context->native_context().set_promise_hook_resolve_function(*resolve);
+  context->native_context()->set_promise_hook_init_function(*init);
+  context->native_context()->set_promise_hook_before_function(*before);
+  context->native_context()->set_promise_hook_after_function(*after);
+  context->native_context()->set_promise_hook_resolve_function(*resolve);
 #else   // V8_ENABLE_JAVASCRIPT_PROMISE_HOOKS
   Utils::ApiCheck(false, "v8::Context::SetPromiseHook",
                   "V8 was compiled without JavaScript Promise hooks");
@@ -7289,9 +7214,9 @@ void v8::Context::SetPromiseHooks(Local<Function> init_hook,
 
 bool Context::HasTemplateLiteralObject(Local<Value> object) {
   i::DisallowGarbageCollection no_gc;
-  i::Object i_object = *Utils::OpenHandle(*object);
-  if (!i_object.IsJSArray()) return false;
-  return Utils::OpenHandle(this)->native_context().HasTemplateLiteralObject(
+  i::Tagged<i::Object> i_object = *Utils::OpenHandle(*object);
+  if (!IsJSArray(i_object)) return false;
+  return Utils::OpenHandle(this)->native_context()->HasTemplateLiteralObject(
       i::JSArray::cast(i_object));
 }
 
@@ -7303,7 +7228,7 @@ MaybeLocal<Context> metrics::Recorder::GetContext(
 
 metrics::Recorder::ContextId metrics::Recorder::GetContextId(
     Local<Context> context) {
-  i::Handle<i::Context> i_context = Utils::OpenHandle(*context);
+  i::Handle<i::NativeContext> i_context = Utils::OpenHandle(*context);
   i::Isolate* i_isolate = i_context->GetIsolate();
   return i_isolate->GetOrRegisterRecorderContextId(
       handle(i_context->native_context(), i_isolate));
@@ -7316,18 +7241,19 @@ metrics::LongTaskStats metrics::LongTaskStats::Get(v8::Isolate* v8_isolate) {
 
 namespace {
 i::Address* GetSerializedDataFromFixedArray(i::Isolate* i_isolate,
-                                            i::FixedArray list, size_t index) {
-  if (index < static_cast<size_t>(list.length())) {
+                                            i::Tagged<i::FixedArray> list,
+                                            size_t index) {
+  if (index < static_cast<size_t>(list->length())) {
     int int_index = static_cast<int>(index);
-    i::Object object = list.get(int_index);
-    if (!object.IsTheHole(i_isolate)) {
-      list.set_the_hole(i_isolate, int_index);
+    i::Tagged<i::Object> object = list->get(int_index);
+    if (!IsTheHole(object, i_isolate)) {
+      list->set_the_hole(i_isolate, int_index);
       // Shrink the list so that the last element is not the hole (unless it's
       // the first element, because we don't want to end up with a non-canonical
       // empty FixedArray).
-      int last = list.length() - 1;
-      while (last >= 0 && list.is_the_hole(i_isolate, last)) last--;
-      if (last != -1) list.Shrink(i_isolate, last + 1);
+      int last = list->length() - 1;
+      while (last >= 0 && list->is_the_hole(i_isolate, last)) last--;
+      if (last != -1) list->Shrink(i_isolate, last + 1);
       return i::Handle<i::Object>(object, i_isolate).location();
     }
   }
@@ -7338,7 +7264,7 @@ i::Address* GetSerializedDataFromFixedArray(i::Isolate* i_isolate,
 i::Address* Context::GetDataFromSnapshotOnce(size_t index) {
   auto context = Utils::OpenHandle(this);
   i::Isolate* i_isolate = context->GetIsolate();
-  i::FixedArray list = context->serialized_objects();
+  i::Tagged<i::FixedArray> list = context->serialized_objects();
   return GetSerializedDataFromFixedArray(i_isolate, list, index);
 }
 
@@ -7354,19 +7280,19 @@ MaybeLocal<v8::Object> ObjectTemplate::NewInstance(Local<Context> context) {
 
 void v8::ObjectTemplate::CheckCast(Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsObjectTemplateInfo(), "v8::ObjectTemplate::Cast",
+  Utils::ApiCheck(i::IsObjectTemplateInfo(*obj), "v8::ObjectTemplate::Cast",
                   "Value is not an ObjectTemplate");
 }
 
 void v8::FunctionTemplate::CheckCast(Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsFunctionTemplateInfo(), "v8::FunctionTemplate::Cast",
+  Utils::ApiCheck(i::IsFunctionTemplateInfo(*obj), "v8::FunctionTemplate::Cast",
                   "Value is not a FunctionTemplate");
 }
 
 void v8::Signature::CheckCast(Data* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsFunctionTemplateInfo(), "v8::Signature::Cast",
+  Utils::ApiCheck(i::IsFunctionTemplateInfo(*obj), "v8::Signature::Cast",
                   "Value is not a Signature");
 }
 
@@ -7375,14 +7301,16 @@ MaybeLocal<v8::Function> FunctionTemplate::GetFunction(Local<Context> context) {
   auto self = Utils::OpenHandle(this);
   Local<Function> result;
   has_pending_exception =
-      !ToLocal<Function>(i::ApiNatives::InstantiateFunction(self), &result);
+      !ToLocal<Function>(i::ApiNatives::InstantiateFunction(
+                             i_isolate, i_isolate->native_context(), self),
+                         &result);
   RETURN_ON_FAILED_EXECUTION(Function);
   RETURN_ESCAPED(result);
 }
 
 MaybeLocal<v8::Object> FunctionTemplate::NewRemoteInstance() {
   auto self = Utils::OpenHandle(this);
-  i::Isolate* i_isolate = self->GetIsolate();
+  i::Isolate* i_isolate = self->GetIsolateChecked();
   API_RCS_SCOPE(i_isolate, FunctionTemplate, NewRemoteInstance);
   i::HandleScope scope(i_isolate);
   i::Handle<i::FunctionTemplateInfo> constructor =
@@ -7410,14 +7338,14 @@ MaybeLocal<v8::Object> FunctionTemplate::NewRemoteInstance() {
 bool FunctionTemplate::HasInstance(v8::Local<v8::Value> value) {
   auto self = Utils::OpenHandle(this);
   auto obj = Utils::OpenHandle(*value);
-  if (obj->IsJSObject() && self->IsTemplateFor(i::JSObject::cast(*obj))) {
+  if (i::IsJSObject(*obj) && self->IsTemplateFor(i::JSObject::cast(*obj))) {
     return true;
   }
-  if (obj->IsJSGlobalProxy()) {
+  if (i::IsJSGlobalProxy(*obj)) {
     // If it's a global proxy, then test with the global object. Note that the
     // inner global object may not necessarily be a JSGlobalObject.
-    i::PrototypeIterator iter(self->GetIsolate(),
-                              i::JSObject::cast(*obj).map());
+    auto jsobj = i::JSObject::cast(*obj);
+    i::PrototypeIterator iter(jsobj->GetIsolate(), jsobj->map());
     // The global proxy should always have a prototype, as it is a bug to call
     // this on a detached JSGlobalProxy.
     DCHECK(!iter.IsAtEnd());
@@ -7430,7 +7358,7 @@ bool FunctionTemplate::IsLeafTemplateForApiObject(
     v8::Local<v8::Value> value) const {
   i::DisallowGarbageCollection no_gc;
 
-  i::Object object = *Utils::OpenHandle(*value);
+  i::Tagged<i::Object> object = *Utils::OpenHandle(*value);
 
   auto self = Utils::OpenHandle(this);
   return self->IsLeafTemplateForApiObject(object);
@@ -7452,7 +7380,7 @@ Local<External> v8::External::New(Isolate* v8_isolate, void* value) {
 
 void* External::Value() const {
   auto self = Utils::OpenHandle(this);
-  return i::JSExternalObject::cast(*self).value();
+  return i::JSExternalObject::cast(*self)->value();
 }
 
 // anonymous namespace for string creation helper functions
@@ -7628,13 +7556,13 @@ MaybeLocal<String> v8::String::NewExternalOneByte(
 bool v8::String::MakeExternal(v8::String::ExternalStringResource* resource) {
   i::DisallowGarbageCollection no_gc;
 
-  i::String obj = *Utils::OpenHandle(this);
+  i::Tagged<i::String> obj = *Utils::OpenHandle(this);
 
-  if (obj.IsThinString()) {
-    obj = i::ThinString::cast(obj).actual();
+  if (i::IsThinString(obj)) {
+    obj = i::ThinString::cast(obj)->actual();
   }
 
-  if (!obj.SupportsExternalization()) {
+  if (!obj->SupportsExternalization(Encoding::TWO_BYTE_ENCODING)) {
     return false;
   }
 
@@ -7652,7 +7580,7 @@ bool v8::String::MakeExternal(v8::String::ExternalStringResource* resource) {
 
   CHECK(resource && resource->data());
 
-  bool result = obj.MakeExternal(resource);
+  bool result = obj->MakeExternal(resource);
   DCHECK_IMPLIES(result, HasExternalStringResource(obj));
   return result;
 }
@@ -7661,13 +7589,13 @@ bool v8::String::MakeExternal(
     v8::String::ExternalOneByteStringResource* resource) {
   i::DisallowGarbageCollection no_gc;
 
-  i::String obj = *Utils::OpenHandle(this);
+  i::Tagged<i::String> obj = *Utils::OpenHandle(this);
 
-  if (obj.IsThinString()) {
-    obj = i::ThinString::cast(obj).actual();
+  if (i::IsThinString(obj)) {
+    obj = i::ThinString::cast(obj)->actual();
   }
 
-  if (!obj.SupportsExternalization()) {
+  if (!obj->SupportsExternalization(Encoding::ONE_BYTE_ENCODING)) {
     return false;
   }
 
@@ -7685,39 +7613,15 @@ bool v8::String::MakeExternal(
 
   CHECK(resource && resource->data());
 
-  bool result = obj.MakeExternal(resource);
+  bool result = obj->MakeExternal(resource);
   DCHECK_IMPLIES(result, HasExternalStringResource(obj));
   return result;
 }
 
-bool v8::String::CanMakeExternal() const {
-  i::String obj = *Utils::OpenHandle(this);
-
-  if (obj.IsThinString()) {
-    obj = i::ThinString::cast(obj).actual();
-  }
-
-  if (!obj.SupportsExternalization()) {
-    return false;
-  }
-
-  // Only old space strings should be externalized.
-  return !i::Heap::InYoungGeneration(obj);
-}
-
 bool v8::String::CanMakeExternal(Encoding encoding) const {
-  i::String obj = *Utils::OpenHandle(this);
-
-  if (obj.IsThinString()) {
-    obj = i::ThinString::cast(obj).actual();
-  }
+  i::Tagged<i::String> obj = *Utils::OpenHandle(this);
 
-  if (!obj.SupportsExternalization(encoding)) {
-    return false;
-  }
-
-  // Only old space strings should be externalized.
-  return !i::Heap::InYoungGeneration(obj);
+  return obj->SupportsExternalization(encoding);
 }
 
 bool v8::String::StringEquals(Local<String> that) const {
@@ -7772,7 +7676,7 @@ void AddPropertiesAndElementsToObject(i::Isolate* i_isolate,
     if (name->AsArrayIndex(&index)) {
       // If this is the first element, allocate a proper
       // dictionary elements backing store for {elements}.
-      if (!elements->IsNumberDictionary()) {
+      if (!IsNumberDictionary(*elements)) {
         elements =
             i::NumberDictionary::New(i_isolate, static_cast<int>(length));
       }
@@ -7803,7 +7707,7 @@ Local<v8::Object> v8::Object::New(Isolate* v8_isolate,
                                   size_t length) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   i::Handle<i::Object> proto = Utils::OpenHandle(*prototype_or_null);
-  if (!Utils::ApiCheck(proto->IsNull() || proto->IsJSReceiver(),
+  if (!Utils::ApiCheck(i::IsNull(*proto) || IsJSReceiver(*proto),
                        "v8::Object::New", "prototype must be null or object")) {
     return Local<v8::Object>();
   }
@@ -7853,7 +7757,7 @@ double v8::NumberObject::ValueOf() const {
   i::Handle<i::JSPrimitiveWrapper> js_primitive_wrapper =
       i::Handle<i::JSPrimitiveWrapper>::cast(obj);
   API_RCS_SCOPE(js_primitive_wrapper->GetIsolate(), NumberObject, NumberValue);
-  return js_primitive_wrapper->value().Number();
+  return i::Object::Number(js_primitive_wrapper->value());
 }
 
 Local<v8::Value> v8::BigIntObject::New(Isolate* v8_isolate, int64_t value) {
@@ -7880,21 +7784,20 @@ Local<v8::Value> v8::BooleanObject::New(Isolate* v8_isolate, bool value) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   API_RCS_SCOPE(i_isolate, BooleanObject, New);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  i::Handle<i::Object> boolean(value
-                                   ? i::ReadOnlyRoots(i_isolate).true_value()
-                                   : i::ReadOnlyRoots(i_isolate).false_value(),
-                               i_isolate);
+  i::Handle<i::Object> boolean =
+      i::ReadOnlyRoots(i_isolate).boolean_value_handle(value);
   i::Handle<i::Object> obj =
       i::Object::ToObject(i_isolate, boolean).ToHandleChecked();
   return Utils::ToLocal(obj);
 }
 
 bool v8::BooleanObject::ValueOf() const {
-  i::Object obj = *Utils::OpenHandle(this);
-  i::JSPrimitiveWrapper js_primitive_wrapper = i::JSPrimitiveWrapper::cast(obj);
-  i::Isolate* i_isolate = js_primitive_wrapper.GetIsolate();
+  i::Tagged<i::Object> obj = *Utils::OpenHandle(this);
+  i::Tagged<i::JSPrimitiveWrapper> js_primitive_wrapper =
+      i::JSPrimitiveWrapper::cast(obj);
+  i::Isolate* i_isolate = js_primitive_wrapper->GetIsolate();
   API_RCS_SCOPE(i_isolate, BooleanObject, BooleanValue);
-  return js_primitive_wrapper.value().IsTrue(i_isolate);
+  return i::IsTrue(js_primitive_wrapper->value(), i_isolate);
 }
 
 Local<v8::Value> v8::StringObject::New(Isolate* v8_isolate,
@@ -7958,7 +7861,7 @@ double v8::Date::ValueOf() const {
   i::Handle<i::Object> obj = Utils::OpenHandle(this);
   i::Handle<i::JSDate> jsdate = i::Handle<i::JSDate>::cast(obj);
   API_RCS_SCOPE(jsdate->GetIsolate(), Date, NumberValue);
-  return jsdate->value().Number();
+  return i::Object::Number(jsdate->value());
 }
 
 v8::Local<v8::String> v8::Date::ToISOString() const {
@@ -7966,9 +7869,9 @@ v8::Local<v8::String> v8::Date::ToISOString() const {
   i::Handle<i::JSDate> jsdate = i::Handle<i::JSDate>::cast(obj);
   i::Isolate* i_isolate = jsdate->GetIsolate();
   API_RCS_SCOPE(i_isolate, Date, NumberValue);
-  i::DateBuffer buffer =
-      i::ToDateString(jsdate->value().Number(), i_isolate->date_cache(),
-                      i::ToDateStringMode::kISODateAndTime);
+  i::DateBuffer buffer = i::ToDateString(i::Object::Number(jsdate->value()),
+                                         i_isolate->date_cache(),
+                                         i::ToDateStringMode::kISODateAndTime);
   i::Handle<i::String> str = i_isolate->factory()
                                  ->NewStringFromUtf8(base::VectorOf(buffer))
                                  .ToHandleChecked();
@@ -8095,11 +7998,11 @@ Local<v8::Array> v8::Array::New(Isolate* v8_isolate, Local<Value>* elements,
 
 uint32_t v8::Array::Length() const {
   i::Handle<i::JSArray> obj = Utils::OpenHandle(this);
-  i::Object length = obj->length();
-  if (length.IsSmi()) {
+  i::Tagged<i::Object> length = obj->length();
+  if (i::IsSmi(length)) {
     return i::Smi::ToInt(length);
   } else {
-    return static_cast<uint32_t>(length.Number());
+    return static_cast<uint32_t>(i::Object::Number(length));
   }
 }
 
@@ -8113,7 +8016,7 @@ Local<v8::Map> v8::Map::New(Isolate* v8_isolate) {
 
 size_t v8::Map::Size() const {
   i::Handle<i::JSMap> obj = Utils::OpenHandle(this);
-  return i::OrderedHashMap::cast(obj->table()).NumberOfElements();
+  return i::OrderedHashMap::cast(obj->table())->NumberOfElements();
 }
 
 void Map::Clear() {
@@ -8163,7 +8066,7 @@ Maybe<bool> Map::Has(Local<Context> context, Local<Value> key) {
                                  arraysize(argv), argv)
            .ToHandle(&result);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
-  return Just(result->IsTrue(i_isolate));
+  return Just(i::IsTrue(*result, i_isolate));
 }
 
 Maybe<bool> Map::Delete(Local<Context> context, Local<Value> key) {
@@ -8177,7 +8080,7 @@ Maybe<bool> Map::Delete(Local<Context> context, Local<Value> key) {
                                  arraysize(argv), argv)
            .ToHandle(&result);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
-  return Just(result->IsTrue(i_isolate));
+  return Just(i::IsTrue(*result, i_isolate));
 }
 
 namespace {
@@ -8193,8 +8096,9 @@ enum class SetAsArrayKind {
   kValues = i::JS_SET_VALUE_ITERATOR_TYPE
 };
 
-i::Handle<i::JSArray> MapAsArray(i::Isolate* i_isolate, i::Object table_obj,
-                                 int offset, MapAsArrayKind kind) {
+i::Handle<i::JSArray> MapAsArray(i::Isolate* i_isolate,
+                                 i::Tagged<i::Object> table_obj, int offset,
+                                 MapAsArrayKind kind) {
   i::Factory* factory = i_isolate->factory();
   i::Handle<i::OrderedHashMap> table(i::OrderedHashMap::cast(table_obj),
                                      i_isolate);
@@ -8209,10 +8113,10 @@ i::Handle<i::JSArray> MapAsArray(i::Isolate* i_isolate, i::Object table_obj,
   int result_index = 0;
   {
     i::DisallowGarbageCollection no_gc;
-    i::Oddball the_hole = i::ReadOnlyRoots(i_isolate).the_hole_value();
+    i::Tagged<i::Hole> the_hole = i::ReadOnlyRoots(i_isolate).the_hole_value();
     for (int i = offset; i < capacity; ++i) {
       i::InternalIndex entry(i);
-      i::Object key = table->KeyAt(entry);
+      i::Tagged<i::Object> key = table->KeyAt(entry);
       if (key == the_hole) continue;
       if (collect_keys) result->set(result_index++, key);
       if (collect_values) result->set(result_index++, table->ValueAt(entry));
@@ -8246,7 +8150,7 @@ Local<v8::Set> v8::Set::New(Isolate* v8_isolate) {
 
 size_t v8::Set::Size() const {
   i::Handle<i::JSSet> obj = Utils::OpenHandle(this);
-  return i::OrderedHashSet::cast(obj->table()).NumberOfElements();
+  return i::OrderedHashSet::cast(obj->table())->NumberOfElements();
 }
 
 void Set::Clear() {
@@ -8281,7 +8185,7 @@ Maybe<bool> Set::Has(Local<Context> context, Local<Value> key) {
                                  arraysize(argv), argv)
            .ToHandle(&result);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
-  return Just(result->IsTrue(i_isolate));
+  return Just(i::IsTrue(*result, i_isolate));
 }
 
 Maybe<bool> Set::Delete(Local<Context> context, Local<Value> key) {
@@ -8295,12 +8199,13 @@ Maybe<bool> Set::Delete(Local<Context> context, Local<Value> key) {
                                  arraysize(argv), argv)
            .ToHandle(&result);
   RETURN_ON_FAILED_EXECUTION_PRIMITIVE(bool);
-  return Just(result->IsTrue(i_isolate));
+  return Just(i::IsTrue(*result, i_isolate));
 }
 
 namespace {
-i::Handle<i::JSArray> SetAsArray(i::Isolate* i_isolate, i::Object table_obj,
-                                 int offset, SetAsArrayKind kind) {
+i::Handle<i::JSArray> SetAsArray(i::Isolate* i_isolate,
+                                 i::Tagged<i::Object> table_obj, int offset,
+                                 SetAsArrayKind kind) {
   i::Factory* factory = i_isolate->factory();
   i::Handle<i::OrderedHashSet> table(i::OrderedHashSet::cast(table_obj),
                                      i_isolate);
@@ -8313,10 +8218,10 @@ i::Handle<i::JSArray> SetAsArray(i::Isolate* i_isolate, i::Object table_obj,
   int result_index = 0;
   {
     i::DisallowGarbageCollection no_gc;
-    i::Oddball the_hole = i::ReadOnlyRoots(i_isolate).the_hole_value();
+    i::Tagged<i::Hole> the_hole = i::ReadOnlyRoots(i_isolate).the_hole_value();
     for (int i = offset; i < capacity; ++i) {
       i::InternalIndex entry(i);
-      i::Object key = table->KeyAt(entry);
+      i::Tagged<i::Object> key = table->KeyAt(entry);
       if (key == the_hole) continue;
       result->set(result_index++, key);
       if (collect_key_values) result->set(result_index++, key);
@@ -8438,12 +8343,12 @@ MaybeLocal<Promise> Promise::Then(Local<Context> context,
 }
 
 bool Promise::HasHandler() const {
-  i::JSReceiver promise = *Utils::OpenHandle(this);
-  i::Isolate* i_isolate = promise.GetIsolate();
+  i::Tagged<i::JSReceiver> promise = *Utils::OpenHandle(this);
+  i::Isolate* i_isolate = promise->GetIsolate();
   API_RCS_SCOPE(i_isolate, Promise, HasRejectHandler);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  if (!promise.IsJSPromise()) return false;
-  return i::JSPromise::cast(promise).has_handler();
+  if (!IsJSPromise(promise)) return false;
+  return i::JSPromise::cast(promise)->has_handler();
 }
 
 Local<Value> Promise::Result() {
@@ -8553,7 +8458,7 @@ CompiledWasmModule WasmModuleObject::GetCompiledModule() {
 #if V8_ENABLE_WEBASSEMBLY
   auto obj = i::Handle<i::WasmModuleObject>::cast(Utils::OpenHandle(this));
   auto url =
-      i::handle(i::String::cast(obj->script().name()), obj->GetIsolate());
+      i::handle(i::String::cast(obj->script()->name()), obj->GetIsolate());
   int length;
   std::unique_ptr<char[]> cstring =
       url->ToCString(i::DISALLOW_NULLS, i::FAST_STRING_TRAVERSAL, &length);
@@ -8795,21 +8700,21 @@ std::unique_ptr<BackingStore> v8::ArrayBuffer::NewResizableBackingStore(
 Local<ArrayBuffer> v8::ArrayBufferView::Buffer() {
   i::Handle<i::JSArrayBufferView> obj = Utils::OpenHandle(this);
   i::Handle<i::JSArrayBuffer> buffer;
-  if (obj->IsJSDataView()) {
+  if (i::IsJSDataView(*obj)) {
     i::Handle<i::JSDataView> data_view(i::JSDataView::cast(*obj),
                                        obj->GetIsolate());
-    DCHECK(data_view->buffer().IsJSArrayBuffer());
+    DCHECK(IsJSArrayBuffer(data_view->buffer()));
     buffer = i::handle(i::JSArrayBuffer::cast(data_view->buffer()),
                        data_view->GetIsolate());
-  } else if (obj->IsJSRabGsabDataView()) {
+  } else if (i::IsJSRabGsabDataView(*obj)) {
     i::Handle<i::JSRabGsabDataView> data_view(i::JSRabGsabDataView::cast(*obj),
                                               obj->GetIsolate());
-    DCHECK(data_view->buffer().IsJSArrayBuffer());
+    DCHECK(IsJSArrayBuffer(data_view->buffer()));
     buffer = i::handle(i::JSArrayBuffer::cast(data_view->buffer()),
                        data_view->GetIsolate());
   } else {
-    DCHECK(obj->IsJSTypedArray());
-    buffer = i::JSTypedArray::cast(*obj).GetBuffer();
+    DCHECK(IsJSTypedArray(*obj));
+    buffer = i::JSTypedArray::cast(*obj)->GetBuffer();
   }
   return Utils::ToLocal(buffer);
 }
@@ -8821,14 +8726,14 @@ size_t v8::ArrayBufferView::CopyContents(void* dest, size_t byte_length) {
     i::DisallowGarbageCollection no_gc;
     i::Isolate* i_isolate = self->GetIsolate();
     const char* source;
-    if (self->IsJSTypedArray()) {
+    if (i::IsJSTypedArray(*self)) {
       i::Handle<i::JSTypedArray> array(i::JSTypedArray::cast(*self), i_isolate);
       source = reinterpret_cast<char*>(array->DataPtr());
-    } else if (self->IsJSDataView()) {
+    } else if (i::IsJSDataView(*self)) {
       i::Handle<i::JSDataView> data_view(i::JSDataView::cast(*self), i_isolate);
       source = reinterpret_cast<char*>(data_view->data_pointer());
     } else {
-      DCHECK(self->IsJSRabGsabDataView());
+      DCHECK(IsJSRabGsabDataView(*self));
       i::Handle<i::JSRabGsabDataView> data_view(
           i::JSRabGsabDataView::cast(*self), i_isolate);
       source = reinterpret_cast<char*>(data_view->data_pointer());
@@ -8840,7 +8745,7 @@ size_t v8::ArrayBufferView::CopyContents(void* dest, size_t byte_length) {
 
 bool v8::ArrayBufferView::HasBuffer() const {
   i::Handle<i::JSArrayBufferView> self = Utils::OpenHandle(this);
-  if (!self->IsJSTypedArray()) return true;
+  if (!IsJSTypedArray(*self)) return true;
   auto typed_array = i::Handle<i::JSTypedArray>::cast(self);
   return !typed_array->is_on_heap();
 }
@@ -8852,23 +8757,23 @@ size_t v8::ArrayBufferView::ByteOffset() {
 
 size_t v8::ArrayBufferView::ByteLength() {
   i::DisallowGarbageCollection no_gc;
-  i::JSArrayBufferView obj = *Utils::OpenHandle(this);
-  if (obj.WasDetached()) {
+  i::Tagged<i::JSArrayBufferView> obj = *Utils::OpenHandle(this);
+  if (obj->WasDetached()) {
     return 0;
   }
-  if (obj.IsJSTypedArray()) {
-    return i::JSTypedArray::cast(obj).GetByteLength();
+  if (i::IsJSTypedArray(obj)) {
+    return i::JSTypedArray::cast(obj)->GetByteLength();
   }
-  if (obj.IsJSDataView()) {
-    return i::JSDataView::cast(obj).byte_length();
+  if (i::IsJSDataView(obj)) {
+    return i::JSDataView::cast(obj)->byte_length();
   }
-  return i::JSRabGsabDataView::cast(obj).GetByteLength();
+  return i::JSRabGsabDataView::cast(obj)->GetByteLength();
 }
 
 size_t v8::TypedArray::Length() {
   i::DisallowGarbageCollection no_gc;
-  i::JSTypedArray obj = *Utils::OpenHandle(this);
-  return obj.WasDetached() ? 0 : obj.GetLength();
+  i::Tagged<i::JSTypedArray> obj = *Utils::OpenHandle(this);
+  return obj->WasDetached() ? 0 : obj->GetLength();
 }
 
 static_assert(
@@ -8895,7 +8800,6 @@ static_assert(
   Local<Type##Array> Type##Array::New(                                      \
       Local<SharedArrayBuffer> shared_array_buffer, size_t byte_offset,     \
       size_t length) {                                                      \
-    CHECK(i::v8_flags.harmony_sharedarraybuffer);                           \
     i::Isolate* i_isolate =                                                 \
         Utils::OpenHandle(*shared_array_buffer)->GetIsolate();              \
     API_RCS_SCOPE(i_isolate, Type##Array, New);                             \
@@ -8932,7 +8836,6 @@ Local<DataView> DataView::New(Local<ArrayBuffer> array_buffer,
 
 Local<DataView> DataView::New(Local<SharedArrayBuffer> shared_array_buffer,
                               size_t byte_offset, size_t byte_length) {
-  CHECK(i::v8_flags.harmony_sharedarraybuffer);
   i::Handle<i::JSArrayBuffer> buffer = Utils::OpenHandle(*shared_array_buffer);
   i::Isolate* i_isolate = buffer->GetIsolate();
   API_RCS_SCOPE(i_isolate, DataView, New);
@@ -8955,7 +8858,6 @@ size_t v8::SharedArrayBuffer::MaxByteLength() const {
 
 Local<SharedArrayBuffer> v8::SharedArrayBuffer::New(Isolate* v8_isolate,
                                                     size_t byte_length) {
-  CHECK(i::v8_flags.harmony_sharedarraybuffer);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   API_RCS_SCOPE(i_isolate, SharedArrayBuffer, New);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
@@ -8977,7 +8879,6 @@ Local<SharedArrayBuffer> v8::SharedArrayBuffer::New(Isolate* v8_isolate,
 
 Local<SharedArrayBuffer> v8::SharedArrayBuffer::New(
     Isolate* v8_isolate, std::shared_ptr<BackingStore> backing_store) {
-  CHECK(i::v8_flags.harmony_sharedarraybuffer);
   CHECK_IMPLIES(backing_store->ByteLength() != 0,
                 backing_store->Data() != nullptr);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
@@ -9079,7 +8980,7 @@ Local<Private> v8::Private::New(Isolate* v8_isolate, Local<String> name) {
   i::Handle<i::Symbol> symbol = i_isolate->factory()->NewPrivateSymbol();
   if (!name.IsEmpty()) symbol->set_description(*Utils::OpenHandle(*name));
   Local<Symbol> result = Utils::ToLocal(symbol);
-  return v8::Local<Private>(reinterpret_cast<Private*>(*result));
+  return result.UnsafeAs<Private>();
 }
 
 Local<Private> v8::Private::ForApi(Isolate* v8_isolate, Local<String> name) {
@@ -9088,7 +8989,7 @@ Local<Private> v8::Private::ForApi(Isolate* v8_isolate, Local<String> name) {
   i::Handle<i::String> i_name = Utils::OpenHandle(*name);
   Local<Symbol> result = Utils::ToLocal(
       i_isolate->SymbolFor(i::RootIndex::kApiPrivateSymbolTable, i_name, true));
-  return v8::Local<Private>(reinterpret_cast<Private*>(*result));
+  return result.UnsafeAs<Private>();
 }
 
 Local<Number> v8::Number::New(Isolate* v8_isolate, double value) {
@@ -9207,25 +9108,23 @@ void Isolate::ClearKeptObjects() {
 
 v8::Local<v8::Context> Isolate::GetCurrentContext() {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
-  i::Context context = i_isolate->context();
+  i::Tagged<i::Context> context = i_isolate->context();
   if (context.is_null()) return Local<Context>();
-  i::Context native_context = context.native_context();
-  if (native_context.is_null()) return Local<Context>();
-  return Utils::ToLocal(i::Handle<i::Context>(native_context, i_isolate));
+  i::Tagged<i::NativeContext> native_context = context->native_context();
+  return Utils::ToLocal(handle(native_context, i_isolate));
 }
 
 v8::Local<v8::Context> Isolate::GetEnteredOrMicrotaskContext() {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
-  i::Handle<i::Object> last =
+  i::Handle<i::NativeContext> last =
       i_isolate->handle_scope_implementer()->LastEnteredOrMicrotaskContext();
   if (last.is_null()) return Local<Context>();
-  DCHECK(last->IsNativeContext());
-  return Utils::ToLocal(i::Handle<i::Context>::cast(last));
+  return Utils::ToLocal(last);
 }
 
 v8::Local<v8::Context> Isolate::GetIncumbentContext() {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
-  i::Handle<i::Context> context = i_isolate->GetIncumbentContext();
+  i::Handle<i::NativeContext> context = i_isolate->GetIncumbentContext();
   return Utils::ToLocal(context);
 }
 
@@ -9362,7 +9261,7 @@ void Isolate::RequestGarbageCollectionForTesting(GarbageCollectionType type) {
   } else {
     DCHECK_EQ(kFullGarbageCollection, type);
     reinterpret_cast<i::Isolate*>(this)->heap()->PreciseCollectAllGarbage(
-        i::Heap::kNoGCFlags, i::GarbageCollectionReason::kTesting,
+        i::GCFlag::kNoFlags, i::GarbageCollectionReason::kTesting,
         kGCCallbackFlagForced);
   }
 }
@@ -9644,7 +9543,7 @@ Isolate::SafeForTerminationScope::~SafeForTerminationScope() {
 
 i::Address* Isolate::GetDataFromSnapshotOnce(size_t index) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
-  i::FixedArray list = i_isolate->heap()->serialized_objects();
+  i::Tagged<i::FixedArray> list = i_isolate->heap()->serialized_objects();
   return GetSerializedDataFromFixedArray(i_isolate, list, index);
 }
 
@@ -9700,7 +9599,7 @@ void Isolate::GetHeapStatistics(HeapStatistics* heap_statistics) {
   heap_statistics->number_of_native_contexts_ = heap->NumberOfNativeContexts();
   heap_statistics->number_of_detached_contexts_ =
       heap->NumberOfDetachedContexts();
-  heap_statistics->does_zap_garbage_ = heap->ShouldZapGarbage();
+  heap_statistics->does_zap_garbage_ = i::heap::ShouldZapGarbage();
 
 #if V8_ENABLE_WEBASSEMBLY
   heap_statistics->malloced_memory_ +=
@@ -9724,7 +9623,7 @@ bool Isolate::GetHeapSpaceStatistics(HeapSpaceStatistics* space_statistics,
   i::Heap* heap = i_isolate->heap();
 
   i::AllocationSpace allocation_space = static_cast<i::AllocationSpace>(index);
-  space_statistics->space_name_ = i::BaseSpace::GetSpaceName(allocation_space);
+  space_statistics->space_name_ = i::ToString(allocation_space);
 
   if (allocation_space == i::RO_SPACE) {
     if (i::ReadOnlyHeap::IsReadOnlySpaceShared()) {
@@ -9857,8 +9756,6 @@ int64_t Isolate::AdjustAmountOfExternalAllocatedMemory(
 }
 
 void Isolate::SetEventLogger(LogEventCallback that) {
-  // Do not overwrite the event logger if we want to log explicitly.
-  if (i::v8_flags.log_internal_timer_events) return;
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
   i_isolate->set_event_logger(that);
 }
@@ -10050,16 +9947,6 @@ void Isolate::ClearCachesForTesting() {
   i_isolate->compilation_cache()->Clear();
 }
 
-void Isolate::EnableMemorySavingsMode() {
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
-  i_isolate->EnableMemorySavingsMode();
-}
-
-void Isolate::DisableMemorySavingsMode() {
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
-  i_isolate->DisableMemorySavingsMode();
-}
-
 void Isolate::SetRAILMode(RAILMode rail_mode) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
   return i_isolate->SetRAILMode(rail_mode);
@@ -10119,10 +10006,10 @@ JSEntryStubs Isolate::GetJSEntryStubs() {
        {i::Builtin::kJSRunMicrotasksEntry,
         &entry_stubs.js_run_microtasks_entry_stub}}};
   for (auto& pair : stubs) {
-    i::Code js_entry = i_isolate->builtins()->code(pair.first);
+    i::Tagged<i::Code> js_entry = i_isolate->builtins()->code(pair.first);
     pair.second->code.start =
-        reinterpret_cast<const void*>(js_entry.InstructionStart());
-    pair.second->code.length_in_bytes = js_entry.InstructionSize();
+        reinterpret_cast<const void*>(js_entry->instruction_start());
+    pair.second->code.length_in_bytes = js_entry->instruction_size();
   }
 
   return entry_stubs;
@@ -10181,18 +10068,17 @@ CALLBACK_SETTER(WasmLoadSourceMapCallback, WasmLoadSourceMapCallback,
 CALLBACK_SETTER(WasmGCEnabledCallback, WasmGCEnabledCallback,
                 wasm_gc_enabled_callback)
 
+CALLBACK_SETTER(WasmImportedStringsEnabledCallback,
+                WasmImportedStringsEnabledCallback,
+                wasm_imported_strings_enabled_callback)
+
 CALLBACK_SETTER(SharedArrayBufferConstructorEnabledCallback,
                 SharedArrayBufferConstructorEnabledCallback,
                 sharedarraybuffer_constructor_enabled_callback)
 
-void Isolate::SetWasmExceptionsEnabledCallback(
-    WasmExceptionsEnabledCallback callback) {
-  // Exceptions are always enabled
-}
-
-void Isolate::SetWasmSimdEnabledCallback(WasmSimdEnabledCallback callback) {
-  // SIMD is always enabled
-}
+CALLBACK_SETTER(JavaScriptCompileHintsMagicEnabledCallback,
+                JavaScriptCompileHintsMagicEnabledCallback,
+                compile_hints_magic_enabled_callback)
 
 void Isolate::InstallConditionalFeatures(Local<Context> context) {
   v8::HandleScope handle_scope(this);
@@ -10245,7 +10131,7 @@ bool Isolate::AddMessageListenerWithErrorLevel(MessageCallback that,
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
-  i::Handle<i::TemplateList> list = i_isolate->factory()->message_listeners();
+  i::Handle<i::ArrayList> list = i_isolate->factory()->message_listeners();
   i::Handle<i::FixedArray> listener = i_isolate->factory()->NewFixedArray(3);
   i::Handle<i::Foreign> foreign =
       i_isolate->factory()->NewForeign(FUNCTION_ADDR(that));
@@ -10254,7 +10140,7 @@ bool Isolate::AddMessageListenerWithErrorLevel(MessageCallback that,
                        ? i::ReadOnlyRoots(i_isolate).undefined_value()
                        : *Utils::OpenHandle(*data));
   listener->set(2, i::Smi::FromInt(message_levels));
-  list = i::TemplateList::Add(i_isolate, list, listener);
+  list = i::ArrayList::Add(i_isolate, list, listener);
   i_isolate->heap()->SetMessageListeners(*list);
   return true;
 }
@@ -10264,13 +10150,15 @@ void Isolate::RemoveMessageListeners(MessageCallback that) {
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
   i::HandleScope scope(i_isolate);
   i::DisallowGarbageCollection no_gc;
-  i::TemplateList listeners = i_isolate->heap()->message_listeners();
-  for (int i = 0; i < listeners.length(); i++) {
-    if (listeners.get(i).IsUndefined(i_isolate)) continue;  // skip deleted ones
-    i::FixedArray listener = i::FixedArray::cast(listeners.get(i));
-    i::Foreign callback_obj = i::Foreign::cast(listener.get(0));
-    if (callback_obj.foreign_address() == FUNCTION_ADDR(that)) {
-      listeners.set(i, i::ReadOnlyRoots(i_isolate).undefined_value());
+  i::Tagged<i::ArrayList> listeners = i_isolate->heap()->message_listeners();
+  for (int i = 0; i < listeners->Length(); i++) {
+    if (i::IsUndefined(listeners->Get(i), i_isolate)) {
+      continue;  // skip deleted ones
+    }
+    i::Tagged<i::FixedArray> listener = i::FixedArray::cast(listeners->Get(i));
+    i::Tagged<i::Foreign> callback_obj = i::Foreign::cast(listener->get(0));
+    if (callback_obj->foreign_address() == FUNCTION_ADDR(that)) {
+      listeners->Set(i, i::ReadOnlyRoots(i_isolate).undefined_value());
     }
   }
 }
@@ -10330,6 +10218,14 @@ void v8::Isolate::LocaleConfigurationChangeNotification() {
 #endif  // V8_INTL_SUPPORT
 }
 
+#if defined(V8_OS_WIN)
+void Isolate::SetFilterETWSessionByURLCallback(
+    FilterETWSessionByURLCallback callback) {
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(this);
+  i_isolate->SetFilterETWSessionByURLCallback(callback);
+}
+#endif  // V8_OS_WIN
+
 bool v8::Object::IsCodeLike(v8::Isolate* v8_isolate) const {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   API_RCS_SCOPE(i_isolate, Object, IsCodeLike);
@@ -10481,7 +10377,7 @@ Local<Message> Exception::CreateMessage(Isolate* v8_isolate,
 
 Local<StackTrace> Exception::GetStackTrace(Local<Value> exception) {
   i::Handle<i::Object> obj = Utils::OpenHandle(*exception);
-  if (!obj->IsJSObject()) return Local<StackTrace>();
+  if (!IsJSObject(*obj)) return Local<StackTrace>();
   i::Handle<i::JSObject> js_obj = i::Handle<i::JSObject>::cast(obj);
   i::Isolate* i_isolate = js_obj->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
@@ -10503,24 +10399,24 @@ v8::MaybeLocal<v8::Array> v8::Object::PreviewEntries(bool* is_key_value) {
 
   Isolate* v8_isolate = reinterpret_cast<Isolate*>(i_isolate);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  if (object->IsJSWeakCollection()) {
-    *is_key_value = object->IsJSWeakMap();
+  if (i::IsJSWeakCollection(*object)) {
+    *is_key_value = IsJSWeakMap(*object);
     return Utils::ToLocal(i::JSWeakCollection::GetEntries(
         i::Handle<i::JSWeakCollection>::cast(object), 0));
   }
-  if (object->IsJSMapIterator()) {
+  if (i::IsJSMapIterator(*object)) {
     i::Handle<i::JSMapIterator> it = i::Handle<i::JSMapIterator>::cast(object);
     MapAsArrayKind const kind =
-        static_cast<MapAsArrayKind>(it->map().instance_type());
+        static_cast<MapAsArrayKind>(it->map()->instance_type());
     *is_key_value = kind == MapAsArrayKind::kEntries;
     if (!it->HasMore()) return v8::Array::New(v8_isolate);
     return Utils::ToLocal(
         MapAsArray(i_isolate, it->table(), i::Smi::ToInt(it->index()), kind));
   }
-  if (object->IsJSSetIterator()) {
+  if (i::IsJSSetIterator(*object)) {
     i::Handle<i::JSSetIterator> it = i::Handle<i::JSSetIterator>::cast(object);
     SetAsArrayKind const kind =
-        static_cast<SetAsArrayKind>(it->map().instance_type());
+        static_cast<SetAsArrayKind>(it->map()->instance_type());
     *is_key_value = kind == SetAsArrayKind::kEntries;
     if (!it->HasMore()) return v8::Array::New(v8_isolate);
     return Utils::ToLocal(
@@ -10722,7 +10618,7 @@ CpuProfilingOptions::CpuProfilingOptions(CpuProfilingMode mode,
 void* CpuProfilingOptions::raw_filter_context() const {
   return reinterpret_cast<void*>(
       i::Context::cast(*Utils::OpenPersistent(filter_context_))
-          .native_context()
+          ->native_context()
           .address());
 }
 
@@ -11115,9 +11011,10 @@ EmbedderStateScope::~EmbedderStateScope() = default;
 
 void TracedReferenceBase::CheckValue() const {
 #ifdef V8_HOST_ARCH_64_BIT
-  if (!val_) return;
+  if (IsEmpty()) return;
 
-  CHECK_NE(internal::kGlobalHandleZapValue, *reinterpret_cast<uint64_t*>(val_));
+  CHECK_NE(internal::kGlobalHandleZapValue,
+           *reinterpret_cast<uint64_t*>(slot()));
 #endif  // V8_HOST_ARCH_64_BIT
 }
 
@@ -11128,8 +11025,14 @@ CFunction::CFunction(const void* address, const CFunctionInfo* type_info)
 }
 
 CFunctionInfo::CFunctionInfo(const CTypeInfo& return_info,
-                             unsigned int arg_count, const CTypeInfo* arg_info)
-    : return_info_(return_info), arg_count_(arg_count), arg_info_(arg_info) {
+                             unsigned int arg_count, const CTypeInfo* arg_info,
+                             Int64Representation repr)
+    : return_info_(return_info),
+      repr_(repr),
+      arg_count_(arg_count),
+      arg_info_(arg_info) {
+  DCHECK(repr == Int64Representation::kNumber ||
+         repr == Int64Representation::kBigInt);
   if (arg_count_ > 0) {
     for (unsigned int i = 0; i < arg_count_ - 1; ++i) {
       DCHECK(arg_info_[i].GetType() != CTypeInfo::kCallbackOptionsType);
@@ -11275,14 +11178,17 @@ void HandleScopeImplementer::IterateThis(RootVisitor* v) {
                          FullObjectSlot(handle_scope_data_.next));
   }
 
-  DetachableVector<Context>* context_lists[2] = {&saved_contexts_,
-                                                 &entered_contexts_};
-  for (unsigned i = 0; i < arraysize(context_lists); i++) {
-    context_lists[i]->shrink_to_fit();
-    if (context_lists[i]->empty()) continue;
-    FullObjectSlot start(&context_lists[i]->front());
+  saved_contexts_.shrink_to_fit();
+  if (!saved_contexts_.empty()) {
+    FullObjectSlot start(&saved_contexts_.front());
     v->VisitRootPointers(Root::kHandleScope, nullptr, start,
-                         start + static_cast<int>(context_lists[i]->size()));
+                         start + static_cast<int>(saved_contexts_.size()));
+  }
+  entered_contexts_.shrink_to_fit();
+  if (!entered_contexts_.empty()) {
+    FullObjectSlot start(&entered_contexts_.front());
+    v->VisitRootPointers(Root::kHandleScope, nullptr, start,
+                         start + static_cast<int>(entered_contexts_.size()));
   }
   // The shape of |entered_contexts_| and |is_microtask_context_| stacks must
   // be in sync.
@@ -11344,30 +11250,98 @@ void HandleScopeImplementer::BeginDeferredScope() {
 
 void InvokeAccessorGetterCallback(
     v8::Local<v8::Name> property,
-    const v8::PropertyCallbackInfo<v8::Value>& info,
-    v8::AccessorNameGetterCallback getter) {
+    const v8::PropertyCallbackInfo<v8::Value>& info) {
   // Leaving JavaScript.
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
   RCS_SCOPE(i_isolate, RuntimeCallCounterId::kAccessorGetterCallback);
-  Address getter_address = reinterpret_cast<Address>(getter);
-  ExternalCallbackScope call_scope(i_isolate, getter_address);
+
+  v8::AccessorNameGetterCallback getter;
+  {
+    Address arg = i_isolate->isolate_data()->api_callback_thunk_argument();
+    // Currently we don't call InterceptorInfo callbacks via CallApiGetter.
+    DCHECK(IsAccessorInfo(Object(arg)));
+    Tagged<AccessorInfo> accessor_info = AccessorInfo::cast(Object(arg));
+    getter = reinterpret_cast<v8::AccessorNameGetterCallback>(
+        accessor_info->getter(i_isolate));
+
+    if (V8_UNLIKELY(i_isolate->should_check_side_effects())) {
+      i::Handle<Object> receiver_check_unsupported;
+
+      if (!i_isolate->debug()->PerformSideEffectCheckForAccessor(
+              handle(accessor_info, i_isolate), receiver_check_unsupported,
+              ACCESSOR_GETTER)) {
+        return;
+      }
+    }
+  }
+  ExternalCallbackScope call_scope(i_isolate, FUNCTION_ADDR(getter));
   getter(property, info);
 }
 
-void InvokeFunctionCallback(const v8::FunctionCallbackInfo<v8::Value>& info,
-                            v8::FunctionCallback callback) {
+namespace {
+
+inline void InvokeFunctionCallback(
+    const v8::FunctionCallbackInfo<v8::Value>& info, CallApiCallbackMode mode) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
   RCS_SCOPE(i_isolate, RuntimeCallCounterId::kFunctionCallback);
-  Address callback_address = reinterpret_cast<Address>(callback);
-  ExternalCallbackScope call_scope(i_isolate, callback_address);
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric: {
+      if (V8_UNLIKELY(i_isolate->should_check_side_effects())) {
+        // Load FunctionTemplateInfo from API_CALLBACK_EXIT frame.
+        // If this ever becomes a performance bottleneck, one can pass function
+        // template info here explicitly.
+        StackFrameIterator it(i_isolate);
+        CHECK(it.frame()->is_api_callback_exit());
+        ApiCallbackExitFrame* frame = ApiCallbackExitFrame::cast(it.frame());
+        Tagged<FunctionTemplateInfo> fti =
+            FunctionTemplateInfo::cast(frame->target());
+        Tagged<CallHandlerInfo> call_handler_info =
+            CallHandlerInfo::cast(fti->call_code(kAcquireLoad));
+        if (!i_isolate->debug()->PerformSideEffectCheckForCallback(
+                handle(call_handler_info, i_isolate))) {
+          // Failed side effect check.
+          return;
+        }
+      }
+      break;
+    }
+    case CallApiCallbackMode::kOptimized:
+      // CallFunction builtin should deoptimize an optimized function when
+      // side effects checking is enabled, so we don't have to handle side
+      // effects checking in the optimized version of the builtin.
+      DCHECK(!i_isolate->should_check_side_effects());
+      break;
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+      // This mode doesn't call InvokeFunctionCallback.
+      UNREACHABLE();
+  }
+
+  Address arg = i_isolate->isolate_data()->api_callback_thunk_argument();
+  if (USE_SIMULATOR_BOOL) {
+    arg = ExternalReference::UnwrapRedirection(arg);
+  }
+  v8::FunctionCallback callback = reinterpret_cast<v8::FunctionCallback>(arg);
+  ExternalCallbackScope call_scope(i_isolate, FUNCTION_ADDR(callback));
   callback(info);
 }
+}  // namespace
+
+void InvokeFunctionCallbackGeneric(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  InvokeFunctionCallback(info, CallApiCallbackMode::kGeneric);
+}
+
+void InvokeFunctionCallbackOptimized(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  InvokeFunctionCallback(info, CallApiCallbackMode::kOptimized);
+}
 
 void InvokeFinalizationRegistryCleanupFromTask(
-    Handle<Context> context,
+    Handle<NativeContext> native_context,
     Handle<JSFinalizationRegistry> finalization_registry,
     Handle<Object> callback) {
-  i::Isolate* i_isolate = finalization_registry->native_context().GetIsolate();
+  i::Isolate* i_isolate = finalization_registry->native_context()->GetIsolate();
   RCS_SCOPE(i_isolate,
             RuntimeCallCounterId::kFinalizationRegistryCleanupFromTask);
   // Do not use ENTER_V8 because this is always called from a running
@@ -11375,7 +11349,7 @@ void InvokeFinalizationRegistryCleanupFromTask(
   // API call. This method is implemented here to avoid duplication of the
   // exception handling and microtask running logic in CallDepthScope.
   if (i_isolate->is_execution_terminating()) return;
-  Local<v8::Context> api_context = Utils::ToLocal(context);
+  Local<v8::Context> api_context = Utils::ToLocal(native_context);
   CallDepthScope<true> call_depth_scope(i_isolate, api_context);
   VMState<OTHER> state(i_isolate);
   Handle<Object> argv[] = {callback};
@@ -11435,6 +11409,79 @@ bool ConvertDouble(double d) {
 #undef NEW_STRING
 #undef CALLBACK_SETTER
 
+template <typename T>
+bool ValidateFunctionCallbackInfo(const FunctionCallbackInfo<T>& info) {
+  CHECK_GE(info.Length(), 0);
+  // Theorticall args-length is unlimited, practically we run out of stack
+  // space. This should guard against accidentally used raw pointers.
+  CHECK_LE(info.Length(), 0xFFFFF);
+  if (info.Length() > 0) {
+    CHECK(info[0]->IsValue());
+    CHECK(info[info.Length() - 1]->IsValue());
+  }
+  auto* i_isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
+  CHECK_EQ(i_isolate, Isolate::Current());
+  CHECK(info.This()->IsValue());
+  CHECK(info.Holder()->IsObject());
+  CHECK(!info.Data().IsEmpty());
+  CHECK(info.GetReturnValue().Get()->IsValue());
+  return true;
+}
+
+template <typename T>
+bool ValidatePropertyCallbackInfo(const PropertyCallbackInfo<T>& info) {
+  auto* i_isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
+  CHECK_EQ(i_isolate, Isolate::Current());
+  CHECK(info.This()->IsValue());
+  CHECK(info.Holder()->IsObject());
+  CHECK(info.Data()->IsValue());
+  USE(info.ShouldThrowOnError());
+  if (!std::is_same<T, void>::value) {
+    CHECK(info.GetReturnValue().Get()->IsValue());
+  }
+  return true;
+}
+
+template <>
+bool V8_EXPORT ValidateCallbackInfo(const FunctionCallbackInfo<void>& info) {
+  return ValidateFunctionCallbackInfo(info);
+}
+
+template <>
+bool V8_EXPORT
+ValidateCallbackInfo(const FunctionCallbackInfo<v8::Value>& info) {
+  return ValidateFunctionCallbackInfo(info);
+}
+
+template <>
+bool V8_EXPORT
+ValidateCallbackInfo(const PropertyCallbackInfo<v8::Value>& info) {
+  return ValidatePropertyCallbackInfo(info);
+}
+
+template <>
+bool V8_EXPORT
+ValidateCallbackInfo(const PropertyCallbackInfo<v8::Array>& info) {
+  return ValidatePropertyCallbackInfo(info);
+}
+
+template <>
+bool V8_EXPORT
+ValidateCallbackInfo(const PropertyCallbackInfo<v8::Boolean>& info) {
+  return ValidatePropertyCallbackInfo(info);
+}
+
+template <>
+bool V8_EXPORT
+ValidateCallbackInfo(const PropertyCallbackInfo<v8::Integer>& info) {
+  return ValidatePropertyCallbackInfo(info);
+}
+
+template <>
+bool V8_EXPORT ValidateCallbackInfo(const PropertyCallbackInfo<void>& info) {
+  return ValidatePropertyCallbackInfo(info);
+}
+
 }  // namespace internal
 
 template <>
@@ -11481,6 +11528,13 @@ TryToCopyAndConvertArrayToCppBuffer<CTypeInfoBuilder<double>::Build().GetId(),
       double>(src, dst, max_length);
 }
 
+std::string SourceLocation::ToString() const {
+  if (!file_) {
+    return {};
+  }
+  return std::string(function_) + "@" + file_ + ":" + std::to_string(line_);
+}
+
 }  // namespace v8
 
 #include "src/api/api-macros-undef.h"
diff --git a/deps/v8/src/api/api.h b/deps/v8/src/api/api.h
index c9450a44b3af28..8b67c3e045daec 100644
--- a/deps/v8/src/api/api.h
+++ b/deps/v8/src/api/api.h
@@ -9,6 +9,7 @@
 
 #include "include/v8-container.h"
 #include "include/v8-external.h"
+#include "include/v8-function-callback.h"
 #include "include/v8-proxy.h"
 #include "include/v8-typed-array.h"
 #include "include/v8-wasm.h"
@@ -55,10 +56,11 @@ class Consts {
 };
 
 template <typename T>
-inline T ToCData(v8::internal::Object obj);
+inline T ToCData(v8::internal::Tagged<v8::internal::Object> obj);
 
 template <>
-inline v8::internal::Address ToCData(v8::internal::Object obj);
+inline v8::internal::Address ToCData(
+    v8::internal::Tagged<v8::internal::Object> obj);
 
 template <typename T>
 inline v8::internal::Handle<v8::internal::Object> FromCData(
@@ -95,7 +97,7 @@ class RegisteredExtension {
 
 #define TO_LOCAL_LIST(V)                               \
   V(ToLocal, AccessorPair, debug::AccessorPair)        \
-  V(ToLocal, Context, Context)                         \
+  V(ToLocal, NativeContext, Context)                   \
   V(ToLocal, Object, Value)                            \
   V(ToLocal, Module, Module)                           \
   V(ToLocal, Name, Name)                               \
@@ -167,7 +169,7 @@ class RegisteredExtension {
   V(Module, Module)                            \
   V(Function, JSReceiver)                      \
   V(Message, JSMessageObject)                  \
-  V(Context, Context)                          \
+  V(Context, NativeContext)                    \
   V(External, Object)                          \
   V(StackTrace, FixedArray)                    \
   V(StackFrame, StackFrameInfo)                \
@@ -196,21 +198,31 @@ class Utils {
   static void ReportOOMFailure(v8::internal::Isolate* isolate,
                                const char* location, const OOMDetails& details);
 
-#define DECLARE_TO_LOCAL(Name, From, To) \
-  static inline Local<v8::To> Name(      \
-      v8::internal::Handle<v8::internal::From> obj);
+#define DECLARE_TO_LOCAL(Name, From, To)                  \
+  static inline Local<v8::To> Name(                       \
+      v8::internal::Handle<v8::internal::From> obj);      \
+  static inline Local<v8::To> Name(                       \
+      v8::internal::DirectHandle<v8::internal::From> obj, \
+      v8::internal::Isolate* isolate);
 
   TO_LOCAL_LIST(DECLARE_TO_LOCAL)
 
 #define DECLARE_TO_LOCAL_TYPED_ARRAY(Type, typeName, TYPE, ctype) \
   static inline Local<v8::Type##Array> ToLocal##Type##Array(      \
-      v8::internal::Handle<v8::internal::JSTypedArray> obj);
+      v8::internal::Handle<v8::internal::JSTypedArray> obj);      \
+  static inline Local<v8::Type##Array> ToLocal##Type##Array(      \
+      v8::internal::DirectHandle<v8::internal::JSTypedArray> obj, \
+      v8::internal::Isolate* isolate);
 
   TYPED_ARRAYS(DECLARE_TO_LOCAL_TYPED_ARRAY)
 
-#define DECLARE_OPEN_HANDLE(From, To)                              \
-  static inline v8::internal::Handle<v8::internal::To> OpenHandle( \
-      const From* that, bool allow_empty_handle = false);
+#define DECLARE_OPEN_HANDLE(From, To)                                          \
+  static inline v8::internal::Handle<v8::internal::To> OpenHandle(             \
+      const From* that, bool allow_empty_handle = false);                      \
+  static inline v8::internal::DirectHandle<v8::internal::To> OpenDirectHandle( \
+      const From* that, bool allow_empty_handle = false);                      \
+  static inline v8::internal::IndirectHandle<v8::internal::To>                 \
+  OpenIndirectHandle(const From* that, bool allow_empty_handle = false);
 
   OPEN_HANDLE_LIST(DECLARE_OPEN_HANDLE)
 
@@ -221,11 +233,14 @@ class Utils {
   template <class From, class To>
   static inline Local<To> Convert(v8::internal::Handle<From> obj);
 
+  template <class From, class To>
+  static inline Local<To> Convert(v8::internal::DirectHandle<From> obj,
+                                  v8::internal::Isolate* isolate);
+
   template <class T>
   static inline v8::internal::Handle<v8::internal::Object> OpenPersistent(
       const v8::PersistentBase<T>& persistent) {
-    return v8::internal::Handle<v8::internal::Object>(
-        reinterpret_cast<v8::internal::Address*>(persistent.val_));
+    return v8::internal::Handle<v8::internal::Object>(persistent.slot());
   }
 
   template <class T>
@@ -254,6 +269,13 @@ inline v8::Local<T> ToApiHandle(
   return Utils::Convert<v8::internal::Object, T>(obj);
 }
 
+template <class T>
+inline v8::Local<T> ToApiHandle(
+    v8::internal::DirectHandle<v8::internal::Object> obj,
+    v8::internal::Isolate* isolate) {
+  return Utils::Convert<v8::internal::Object, T>(obj, isolate);
+}
+
 template <class T>
 inline bool ToLocal(v8::internal::MaybeHandle<v8::internal::Object> maybe,
                     Local<T>* local) {
@@ -320,20 +342,20 @@ class HandleScopeImplementer {
   inline internal::Address* GetSpareOrNewBlock();
   inline void DeleteExtensions(internal::Address* prev_limit);
 
-  inline void EnterContext(Context context);
+  inline void EnterContext(Tagged<NativeContext> context);
   inline void LeaveContext();
-  inline bool LastEnteredContextWas(Context context);
+  inline bool LastEnteredContextWas(Tagged<NativeContext> context);
   inline size_t EnteredContextCount() const { return entered_contexts_.size(); }
 
-  inline void EnterMicrotaskContext(Context context);
+  inline void EnterMicrotaskContext(Tagged<NativeContext> context);
 
   // Returns the last entered context or an empty handle if no
   // contexts have been entered.
-  inline Handle<Context> LastEnteredContext();
-  inline Handle<Context> LastEnteredOrMicrotaskContext();
+  inline Handle<NativeContext> LastEnteredContext();
+  inline Handle<NativeContext> LastEnteredOrMicrotaskContext();
 
-  inline void SaveContext(Context context);
-  inline Context RestoreContext();
+  inline void SaveContext(Tagged<Context> context);
+  inline Tagged<Context> RestoreContext();
   inline bool HasSavedContexts();
 
   inline DetachableVector<Address*>* blocks() { return &blocks_; }
@@ -386,7 +408,7 @@ class HandleScopeImplementer {
   // `is_microtask_context_[i]` is 1.
   // TODO(tzik): Remove |is_microtask_context_| after the deprecated
   // v8::Isolate::GetEnteredContext() is removed.
-  DetachableVector<Context> entered_contexts_;
+  DetachableVector<NativeContext> entered_contexts_;
   DetachableVector<int8_t> is_microtask_context_;
 
   // Used as a stack to keep track of saved contexts.
@@ -406,12 +428,12 @@ class HandleScopeImplementer {
 
 const int kHandleBlockSize = v8::internal::KB - 2;  // fit in one page
 
-void HandleScopeImplementer::SaveContext(Context context) {
+void HandleScopeImplementer::SaveContext(Tagged<Context> context) {
   saved_contexts_.push_back(context);
 }
 
-Context HandleScopeImplementer::RestoreContext() {
-  Context last_context = saved_contexts_.back();
+Tagged<Context> HandleScopeImplementer::RestoreContext() {
+  Tagged<Context> last_context = saved_contexts_.back();
   saved_contexts_.pop_back();
   return last_context;
 }
@@ -428,7 +450,8 @@ void HandleScopeImplementer::LeaveContext() {
   is_microtask_context_.pop_back();
 }
 
-bool HandleScopeImplementer::LastEnteredContextWas(Context context) {
+bool HandleScopeImplementer::LastEnteredContextWas(
+    Tagged<NativeContext> context) {
   return !entered_contexts_.empty() && entered_contexts_.back() == context;
 }
 
@@ -472,18 +495,29 @@ void HandleScopeImplementer::DeleteExtensions(internal::Address* prev_limit) {
          (!blocks_.empty() && prev_limit != nullptr));
 }
 
-// Interceptor functions called from generated inline caches to notify
-// CPU profiler that external callbacks are invoked.
+// This is a wrapper function called from CallApiGetter builtin when profiling
+// or side-effect checking is enabled. It's supposed to set up the runtime
+// call stats scope and check if the getter has side-effects in case debugger
+// enabled the side-effects checking mode.
+// It gets additional argument, the AccessorInfo object, via
+// IsolateData::api_callback_thunk_argument slot.
 void InvokeAccessorGetterCallback(
     v8::Local<v8::Name> property,
-    const v8::PropertyCallbackInfo<v8::Value>& info,
-    v8::AccessorNameGetterCallback getter);
-
-void InvokeFunctionCallback(const v8::FunctionCallbackInfo<v8::Value>& info,
-                            v8::FunctionCallback callback);
+    const v8::PropertyCallbackInfo<v8::Value>& info);
+
+// This is a wrapper function called from CallApiCallback builtin when profiling
+// or side-effect checking is enabled. It's supposed to set up the runtime
+// call stats scope and check if the callback has side-effects in case debugger
+// enabled the side-effects checking mode.
+// It gets additional argument, the v8::FunctionCallback address, via
+// IsolateData::api_callback_thunk_argument slot.
+void InvokeFunctionCallbackGeneric(
+    const v8::FunctionCallbackInfo<v8::Value>& info);
+void InvokeFunctionCallbackOptimized(
+    const v8::FunctionCallbackInfo<v8::Value>& info);
 
 void InvokeFinalizationRegistryCleanupFromTask(
-    Handle<Context> context,
+    Handle<NativeContext> native_context,
     Handle<JSFinalizationRegistry> finalization_registry,
     Handle<Object> callback);
 
@@ -491,6 +525,14 @@ template <typename T>
 EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
 T ConvertDouble(double d);
 
+template <typename T>
+EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
+bool ValidateCallbackInfo(const FunctionCallbackInfo<T>& info);
+
+template <typename T>
+EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
+bool ValidateCallbackInfo(const PropertyCallbackInfo<T>& info);
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/asmjs/asm-js.cc b/deps/v8/src/asmjs/asm-js.cc
index 774153dfa52225..c02e218a8ade9b 100644
--- a/deps/v8/src/asmjs/asm-js.cc
+++ b/deps/v8/src/asmjs/asm-js.cc
@@ -43,7 +43,7 @@ Handle<Object> StdlibMathMember(Isolate* isolate, Handle<JSReceiver> stdlib,
   Handle<Name> math_name(
       isolate->factory()->InternalizeString(base::StaticCharVector("Math")));
   Handle<Object> math = JSReceiver::GetDataProperty(isolate, stdlib, math_name);
-  if (!math->IsJSReceiver()) return isolate->factory()->undefined_value();
+  if (!IsJSReceiver(*math)) return isolate->factory()->undefined_value();
   Handle<JSReceiver> math_receiver = Handle<JSReceiver>::cast(math);
   Handle<Object> value =
       JSReceiver::GetDataProperty(isolate, math_receiver, name);
@@ -57,13 +57,13 @@ bool AreStdlibMembersValid(Isolate* isolate, Handle<JSReceiver> stdlib,
     members.Remove(wasm::AsmJsParser::StandardMember::kInfinity);
     Handle<Name> name = isolate->factory()->Infinity_string();
     Handle<Object> value = JSReceiver::GetDataProperty(isolate, stdlib, name);
-    if (!value->IsNumber() || !std::isinf(value->Number())) return false;
+    if (!IsNumber(*value) || !std::isinf(Object::Number(*value))) return false;
   }
   if (members.contains(wasm::AsmJsParser::StandardMember::kNaN)) {
     members.Remove(wasm::AsmJsParser::StandardMember::kNaN);
     Handle<Name> name = isolate->factory()->NaN_string();
     Handle<Object> value = JSReceiver::GetDataProperty(isolate, stdlib, name);
-    if (!value->IsNaN()) return false;
+    if (!IsNaN(*value)) return false;
   }
 #define STDLIB_MATH_FUNC(fname, FName, ignore1, ignore2)                   \
   if (members.contains(wasm::AsmJsParser::StandardMember::kMath##FName)) { \
@@ -71,24 +71,25 @@ bool AreStdlibMembersValid(Isolate* isolate, Handle<JSReceiver> stdlib,
     Handle<Name> name(isolate->factory()->InternalizeString(               \
         base::StaticCharVector(#fname)));                                  \
     Handle<Object> value = StdlibMathMember(isolate, stdlib, name);        \
-    if (!value->IsJSFunction()) return false;                              \
+    if (!IsJSFunction(*value)) return false;                               \
     SharedFunctionInfo shared = Handle<JSFunction>::cast(value)->shared(); \
-    if (!shared.HasBuiltinId() ||                                          \
-        shared.builtin_id() != Builtin::kMath##FName) {                    \
+    if (!shared->HasBuiltinId() ||                                         \
+        shared->builtin_id() != Builtin::kMath##FName) {                   \
       return false;                                                        \
     }                                                                      \
-    DCHECK_EQ(shared.GetCode(isolate),                                     \
+    DCHECK_EQ(shared->GetCode(isolate),                                    \
               isolate->builtins()->code(Builtin::kMath##FName));           \
   }
   STDLIB_MATH_FUNCTION_LIST(STDLIB_MATH_FUNC)
 #undef STDLIB_MATH_FUNC
-#define STDLIB_MATH_CONST(cname, const_value)                               \
-  if (members.contains(wasm::AsmJsParser::StandardMember::kMath##cname)) {  \
-    members.Remove(wasm::AsmJsParser::StandardMember::kMath##cname);        \
-    Handle<Name> name(isolate->factory()->InternalizeString(                \
-        base::StaticCharVector(#cname)));                                   \
-    Handle<Object> value = StdlibMathMember(isolate, stdlib, name);         \
-    if (!value->IsNumber() || value->Number() != const_value) return false; \
+#define STDLIB_MATH_CONST(cname, const_value)                              \
+  if (members.contains(wasm::AsmJsParser::StandardMember::kMath##cname)) { \
+    members.Remove(wasm::AsmJsParser::StandardMember::kMath##cname);       \
+    Handle<Name> name(isolate->factory()->InternalizeString(               \
+        base::StaticCharVector(#cname)));                                  \
+    Handle<Object> value = StdlibMathMember(isolate, stdlib, name);        \
+    if (!IsNumber(*value) || Object::Number(*value) != const_value)        \
+      return false;                                                        \
   }
   STDLIB_MATH_VALUE_LIST(STDLIB_MATH_CONST)
 #undef STDLIB_MATH_CONST
@@ -99,7 +100,7 @@ bool AreStdlibMembersValid(Isolate* isolate, Handle<JSReceiver> stdlib,
     Handle<Name> name(isolate->factory()->InternalizeString(                   \
         base::StaticCharVector(#FName)));                                      \
     Handle<Object> value = JSReceiver::GetDataProperty(isolate, stdlib, name); \
-    if (!value->IsJSFunction()) return false;                                  \
+    if (!IsJSFunction(*value)) return false;                                   \
     Handle<JSFunction> func = Handle<JSFunction>::cast(value);                 \
     if (!func.is_identical_to(isolate->fname())) return false;                 \
   }
@@ -334,7 +335,7 @@ MaybeHandle<Object> AsmJs::InstantiateAsmWasm(Isolate* isolate,
   int position = shared->StartPosition();
 
   // Check that the module is not instantiated as a generator or async function.
-  if (IsResumableFunction(shared->scope_info().function_kind())) {
+  if (IsResumableFunction(shared->scope_info()->function_kind())) {
     ReportInstantiationFailure(script, position,
                                "Cannot be instantiated as resumable function");
     return MaybeHandle<Object>();
@@ -369,18 +370,30 @@ MaybeHandle<Object> AsmJs::InstantiateAsmWasm(Isolate* isolate,
                                  "Invalid heap type: SharedArrayBuffer");
       return MaybeHandle<Object>();
     }
-    // Mark the buffer as being used as an asm.js memory. This implies two
-    // things: 1) if the buffer is from a Wasm memory, that memory can no longer
-    // be grown, since that would detach this buffer, and 2) the buffer cannot
-    // be postMessage()'d, as that also detaches the buffer.
-    memory->set_is_asmjs_memory(true);
-    memory->set_is_detachable(false);
+    // We don't allow resizable ArrayBuffers because resizable ArrayBuffers may
+    // shrink, and then asm.js does out of bounds memory accesses.
+    if (memory->is_resizable_by_js()) {
+      ReportInstantiationFailure(script, position,
+                                 "Invalid heap type: resizable ArrayBuffer");
+      return MaybeHandle<Object>();
+    }
+    // We don't allow WebAssembly.Memory, because WebAssembly.Memory.grow()
+    // detaches the ArrayBuffer, and that would invalidate the asm.js module.
+    if (memory->GetBackingStore() &&
+        memory->GetBackingStore()->is_wasm_memory()) {
+      ReportInstantiationFailure(script, position,
+                                 "Invalid heap type: WebAssembly.Memory");
+      return MaybeHandle<Object>();
+    }
     size_t size = memory->byte_length();
     // Check the asm.js heap size against the valid limits.
     if (!IsValidAsmjsMemorySize(size)) {
       ReportInstantiationFailure(script, position, "Invalid heap size");
       return MaybeHandle<Object>();
     }
+    // Mark the buffer as undetachable. This implies that the buffer cannot be
+    // postMessage()'d, as that detaches the buffer.
+    memory->set_is_detachable(false);
   } else {
     memory = Handle<JSArrayBuffer>::null();
   }
@@ -413,7 +426,7 @@ MaybeHandle<Object> AsmJs::InstantiateAsmWasm(Isolate* isolate,
   MaybeHandle<Object> single_function =
       Object::GetProperty(isolate, instance, single_function_name);
   if (!single_function.is_null() &&
-      !single_function.ToHandleChecked()->IsUndefined(isolate)) {
+      !IsUndefined(*single_function.ToHandleChecked(), isolate)) {
     return single_function;
   }
 
@@ -421,7 +434,7 @@ MaybeHandle<Object> AsmJs::InstantiateAsmWasm(Isolate* isolate,
   // The following check is a weak indicator for that. If this ever changes,
   // then we'll have to call the "exports" getter, and be careful about
   // handling possible stack overflow exceptions.
-  DCHECK(instance->exports_object().IsJSObject());
+  DCHECK(IsJSObject(instance->exports_object()));
   return handle(instance->exports_object(), isolate);
 }
 
diff --git a/deps/v8/src/asmjs/asm-parser.cc b/deps/v8/src/asmjs/asm-parser.cc
index 9346be040b0d7b..c4d9645fa6c462 100644
--- a/deps/v8/src/asmjs/asm-parser.cc
+++ b/deps/v8/src/asmjs/asm-parser.cc
@@ -208,9 +208,7 @@ wasm::AsmJsParser::VarInfo* AsmJsParser::GetVarInfo(
   if (is_global && index + 1 > num_globals_) num_globals_ = index + 1;
   if (index + 1 > old_capacity) {
     size_t new_size = std::max(2 * old_capacity, index + 1);
-    base::Vector<VarInfo> new_info{zone_->NewArray<VarInfo>(new_size),
-                                   new_size};
-    std::uninitialized_fill(new_info.begin(), new_info.end(), VarInfo{});
+    base::Vector<VarInfo> new_info = zone_->NewVector<VarInfo>(new_size);
     std::copy(var_info.begin(), var_info.end(), new_info.begin());
     var_info = new_info;
   }
@@ -228,7 +226,8 @@ void AsmJsParser::AddGlobalImport(base::Vector<const char> name, AsmType* type,
   // Allocate a separate variable for the import.
   // TODO(asmjs): Consider using the imported global directly instead of
   // allocating a separate global variable for immutable (i.e. const) imports.
-  DeclareGlobal(info, mutable_variable, type, vtype);
+  DeclareGlobal(info, mutable_variable, type, vtype,
+                WasmInitExpr::DefaultValue(vtype));
 
   // Record the need to initialize the global from the import.
   global_imports_.push_back({name, vtype, info});
@@ -259,10 +258,7 @@ uint32_t AsmJsParser::TempVariable(int index) {
 }
 
 base::Vector<const char> AsmJsParser::CopyCurrentIdentifierString() {
-  const std::string& str = scanner_.GetIdentifierString();
-  char* buffer = zone()->NewArray<char>(str.size());
-  str.copy(buffer, str.size());
-  return base::Vector<const char>(buffer, static_cast<int>(str.size()));
+  return zone()->CloneVector(base::VectorOf(scanner_.GetIdentifierString()));
 }
 
 void AsmJsParser::SkipSemicolon() {
@@ -442,7 +438,12 @@ void AsmJsParser::ValidateModuleVar(bool mutable_variable) {
   if (!scanner_.IsGlobal()) {
     FAIL("Expected identifier");
   }
-  VarInfo* info = GetVarInfo(Consume());
+  AsmJsScanner::token_t identifier = Consume();
+  if (identifier == stdlib_name_ || identifier == foreign_name_ ||
+      identifier == heap_name_) {
+    FAIL("Cannot shadow parameters");
+  }
+  VarInfo* info = GetVarInfo(identifier);
   if (info->kind != VarKind::kUnused) {
     FAIL("Redefinition of variable");
   }
diff --git a/deps/v8/src/asmjs/asm-parser.h b/deps/v8/src/asmjs/asm-parser.h
index 92dd17a867b3c4..179043a022e639 100644
--- a/deps/v8/src/asmjs/asm-parser.h
+++ b/deps/v8/src/asmjs/asm-parser.h
@@ -313,7 +313,7 @@ class AsmJsParser {
   VarInfo* GetVarInfo(AsmJsScanner::token_t token);
   uint32_t VarIndex(VarInfo* info);
   void DeclareGlobal(VarInfo* info, bool mutable_variable, AsmType* type,
-                     ValueType vtype, WasmInitExpr init = WasmInitExpr());
+                     ValueType vtype, WasmInitExpr init);
   void DeclareStdlibFunc(VarInfo* info, VarKind kind, AsmType* type);
   void AddGlobalImport(base::Vector<const char> name, AsmType* type,
                        ValueType vtype, bool mutable_variable, VarInfo* info);
diff --git a/deps/v8/src/ast/ast-value-factory.cc b/deps/v8/src/ast/ast-value-factory.cc
index 6cf5796c660a84..239f0a6e8d3168 100644
--- a/deps/v8/src/ast/ast-value-factory.cc
+++ b/deps/v8/src/ast/ast-value-factory.cc
@@ -44,14 +44,14 @@ namespace {
 // For using StringToIndex.
 class OneByteStringStream {
  public:
-  explicit OneByteStringStream(base::Vector<const byte> lb)
+  explicit OneByteStringStream(base::Vector<const uint8_t> lb)
       : literal_bytes_(lb), pos_(0) {}
 
   bool HasMore() { return pos_ < literal_bytes_.length(); }
   uint16_t GetNext() { return literal_bytes_[pos_++]; }
 
  private:
-  base::Vector<const byte> literal_bytes_;
+  base::Vector<const uint8_t> literal_bytes_;
   int pos_;
 };
 
@@ -335,14 +335,15 @@ const AstRawString* AstValueFactory::GetTwoByteStringInternal(
   uint32_t raw_hash_field = StringHasher::HashSequentialString<uint16_t>(
       literal.begin(), literal.length(), hash_seed_);
   return GetString(raw_hash_field, false,
-                   base::Vector<const byte>::cast(literal));
+                   base::Vector<const uint8_t>::cast(literal));
 }
 
 const AstRawString* AstValueFactory::GetString(
-    String literal, const SharedStringAccessGuardIfNeeded& access_guard) {
+    Tagged<String> literal,
+    const SharedStringAccessGuardIfNeeded& access_guard) {
   const AstRawString* result = nullptr;
   DisallowGarbageCollection no_gc;
-  String::FlatContent content = literal.GetFlatContent(no_gc, access_guard);
+  String::FlatContent content = literal->GetFlatContent(no_gc, access_guard);
   if (content.IsOneByte()) {
     result = GetOneByteStringInternal(content.ToOneByteVector());
   } else {
@@ -386,7 +387,7 @@ template EXPORT_TEMPLATE_DEFINE(
 
 const AstRawString* AstValueFactory::GetString(
     uint32_t raw_hash_field, bool is_one_byte,
-    base::Vector<const byte> literal_bytes) {
+    base::Vector<const uint8_t> literal_bytes) {
   // literal_bytes here points to whatever the user passed, and this is OK
   // because we use vector_compare (which checks the contents) to compare
   // against the AstRawStrings which are in the string_table_. We should not
@@ -397,10 +398,11 @@ const AstRawString* AstValueFactory::GetString(
       [&]() {
         // Copy literal contents for later comparison.
         int length = literal_bytes.length();
-        byte* new_literal_bytes = ast_raw_string_zone()->NewArray<byte>(length);
+        uint8_t* new_literal_bytes =
+            ast_raw_string_zone()->AllocateArray<uint8_t>(length);
         memcpy(new_literal_bytes, literal_bytes.begin(), length);
         AstRawString* new_string = ast_raw_string_zone()->New<AstRawString>(
-            is_one_byte, base::Vector<const byte>(new_literal_bytes, length),
+            is_one_byte, base::Vector<const uint8_t>(new_literal_bytes, length),
             raw_hash_field);
         CHECK_NOT_NULL(new_string);
         AddString(new_string);
diff --git a/deps/v8/src/ast/ast-value-factory.h b/deps/v8/src/ast/ast-value-factory.h
index f407f83e84c790..b7bdc33b1604df 100644
--- a/deps/v8/src/ast/ast-value-factory.h
+++ b/deps/v8/src/ast/ast-value-factory.h
@@ -101,7 +101,7 @@ class AstRawString final : public ZoneObject {
   friend Zone;
 
   // Members accessed only by the AstValueFactory & related classes:
-  AstRawString(bool is_one_byte, const base::Vector<const byte>& literal_bytes,
+  AstRawString(bool is_one_byte, base::Vector<const uint8_t> literal_bytes,
                uint32_t raw_hash_field)
       : next_(nullptr),
         literal_bytes_(literal_bytes),
@@ -130,7 +130,7 @@ class AstRawString final : public ZoneObject {
     Handle<String> string_;
   };
 
-  base::Vector<const byte> literal_bytes_;  // Memory owned by Zone.
+  base::Vector<const uint8_t> literal_bytes_;  // Memory owned by Zone.
   uint32_t raw_hash_field_;
   bool is_one_byte_;
 #ifdef DEBUG
@@ -361,7 +361,7 @@ class AstValueFactory {
   const AstRawString* GetTwoByteString(base::Vector<const uint16_t> literal) {
     return GetTwoByteStringInternal(literal);
   }
-  const AstRawString* GetString(String literal,
+  const AstRawString* GetString(Tagged<String> literal,
                                 const SharedStringAccessGuardIfNeeded&);
 
   V8_EXPORT_PRIVATE AstConsString* NewConsString();
@@ -398,7 +398,7 @@ class AstValueFactory {
   const AstRawString* GetTwoByteStringInternal(
       base::Vector<const uint16_t> literal);
   const AstRawString* GetString(uint32_t raw_hash_field, bool is_one_byte,
-                                base::Vector<const byte> literal_bytes);
+                                base::Vector<const uint8_t> literal_bytes);
 
   // All strings are copied here.
   AstRawStringMap string_table_;
diff --git a/deps/v8/src/ast/ast.cc b/deps/v8/src/ast/ast.cc
index 34a26d9c269c08..25a9bd3f82e310 100644
--- a/deps/v8/src/ast/ast.cc
+++ b/deps/v8/src/ast/ast.cc
@@ -678,14 +678,16 @@ void ArrayLiteralBoilerplateBuilder::BuildBoilerplateDescription(
 
       if (literal && literal->type() == Literal::kTheHole) {
         DCHECK(IsHoleyElementsKind(kind));
-        DCHECK(GetBoilerplateValue(element, isolate)->IsTheHole(isolate));
-        FixedDoubleArray::cast(*elements).set_the_hole(array_index);
+        DCHECK(IsTheHole(*GetBoilerplateValue(element, isolate), isolate));
+        FixedDoubleArray::cast(*elements)->set_the_hole(array_index);
         continue;
       } else if (literal && literal->IsNumber()) {
-        FixedDoubleArray::cast(*elements).set(array_index, literal->AsNumber());
+        FixedDoubleArray::cast(*elements)->set(array_index,
+                                               literal->AsNumber());
       } else {
-        DCHECK(GetBoilerplateValue(element, isolate)->IsUninitialized(isolate));
-        FixedDoubleArray::cast(*elements).set(array_index, 0);
+        DCHECK(
+            IsUninitialized(*GetBoilerplateValue(element, isolate), isolate));
+        FixedDoubleArray::cast(*elements)->set(array_index, 0);
       }
 
     } else {
@@ -697,24 +699,25 @@ void ArrayLiteralBoilerplateBuilder::BuildBoilerplateDescription(
       // New handle scope here, needs to be after BuildContants().
       typename IsolateT::HandleScopeType scope(isolate);
 
-      Object boilerplate_value = *GetBoilerplateValue(element, isolate);
+      Tagged<Object> boilerplate_value = *GetBoilerplateValue(element, isolate);
       // We shouldn't allocate after creating the boilerplate value.
       DisallowGarbageCollection no_gc;
 
-      if (boilerplate_value.IsTheHole(isolate)) {
+      if (IsTheHole(boilerplate_value, isolate)) {
         DCHECK(IsHoleyElementsKind(kind));
         continue;
       }
 
-      if (boilerplate_value.IsUninitialized(isolate)) {
+      if (IsUninitialized(boilerplate_value, isolate)) {
         boilerplate_value = Smi::zero();
       }
 
       DCHECK_EQ(kind, GetMoreGeneralElementsKind(
-                          kind, boilerplate_value.OptimalElementsKind(
+                          kind, Object::OptimalElementsKind(
+                                    boilerplate_value,
                                     GetPtrComprCageBase(*elements))));
 
-      FixedArray::cast(*elements).set(array_index, boilerplate_value);
+      FixedArray::cast(*elements)->set(array_index, boilerplate_value);
     }
   }  // namespace internal
 
@@ -801,9 +804,9 @@ Handle<TemplateObjectDescription> GetTemplateObject::GetOrBuildDescription(
   bool raw_and_cooked_match = true;
   {
     DisallowGarbageCollection no_gc;
-    FixedArray raw_strings = *raw_strings_handle;
+    Tagged<FixedArray> raw_strings = *raw_strings_handle;
 
-    for (int i = 0; i < raw_strings.length(); ++i) {
+    for (int i = 0; i < raw_strings->length(); ++i) {
       if (this->raw_strings()->at(i) != this->cooked_strings()->at(i)) {
         // If the AstRawStrings don't match, then neither should the allocated
         // Strings, since the AstValueFactory should have deduplicated them
@@ -814,7 +817,7 @@ Handle<TemplateObjectDescription> GetTemplateObject::GetOrBuildDescription(
 
         raw_and_cooked_match = false;
       }
-      raw_strings.set(i, *this->raw_strings()->at(i)->string());
+      raw_strings->set(i, *this->raw_strings()->at(i)->string());
     }
   }
   Handle<FixedArray> cooked_strings_handle = raw_strings_handle;
@@ -822,13 +825,13 @@ Handle<TemplateObjectDescription> GetTemplateObject::GetOrBuildDescription(
     cooked_strings_handle = isolate->factory()->NewFixedArray(
         this->cooked_strings()->length(), AllocationType::kOld);
     DisallowGarbageCollection no_gc;
-    FixedArray cooked_strings = *cooked_strings_handle;
+    Tagged<FixedArray> cooked_strings = *cooked_strings_handle;
     ReadOnlyRoots roots(isolate);
-    for (int i = 0; i < cooked_strings.length(); ++i) {
+    for (int i = 0; i < cooked_strings->length(); ++i) {
       if (this->cooked_strings()->at(i) != nullptr) {
-        cooked_strings.set(i, *this->cooked_strings()->at(i)->string());
+        cooked_strings->set(i, *this->cooked_strings()->at(i)->string());
       } else {
-        cooked_strings.set_undefined(roots, i);
+        cooked_strings->set_undefined(roots, i);
       }
     }
   }
@@ -850,7 +853,7 @@ static bool IsCommutativeOperationWithSmiLiteral(Token::Value op) {
 
 // Check for the pattern: x + 1.
 static bool MatchSmiLiteralOperation(Expression* left, Expression* right,
-                                     Expression** expr, Smi* literal) {
+                                     Expression** expr, Tagged<Smi>* literal) {
   if (right->IsSmiLiteral()) {
     *expr = left;
     *literal = right->AsLiteral()->AsSmiLiteral();
@@ -860,7 +863,7 @@ static bool MatchSmiLiteralOperation(Expression* left, Expression* right,
 }
 
 bool BinaryOperation::IsSmiLiteralOperation(Expression** subexpr,
-                                            Smi* literal) {
+                                            Tagged<Smi>* literal) {
   return MatchSmiLiteralOperation(left_, right_, subexpr, literal) ||
          (IsCommutativeOperationWithSmiLiteral(op()) &&
           MatchSmiLiteralOperation(right_, left_, subexpr, literal));
@@ -948,6 +951,26 @@ bool CompareOperation::IsLiteralCompareNull(Expression** expr) {
          MatchLiteralCompareNull(right_, op(), left_, expr);
 }
 
+static bool MatchLiteralCompareEqualVariable(Expression* left, Token::Value op,
+                                             Expression* right,
+                                             Expression** expr,
+                                             Literal** literal) {
+  if (Token::IsEqualityOp(op) && left->AsVariableProxy() &&
+      right->IsStringLiteral()) {
+    *expr = left->AsVariableProxy();
+    *literal = right->AsLiteral();
+    return true;
+  }
+  return false;
+}
+
+bool CompareOperation::IsLiteralCompareEqualVariable(Expression** expr,
+                                                     Literal** literal) {
+  return (
+      MatchLiteralCompareEqualVariable(left_, op(), right_, expr, literal) ||
+      MatchLiteralCompareEqualVariable(right_, op(), left_, expr, literal));
+}
+
 void CallBase::ComputeSpreadPosition() {
   int arguments_length = arguments_.length();
   int first_spread_index = 0;
diff --git a/deps/v8/src/ast/ast.h b/deps/v8/src/ast/ast.h
index f111660d951c7d..cf9d52eeed67a3 100644
--- a/deps/v8/src/ast/ast.h
+++ b/deps/v8/src/ast/ast.h
@@ -13,6 +13,7 @@
 #include "src/base/pointer-with-payload.h"
 #include "src/base/threaded-list.h"
 #include "src/codegen/bailout-reason.h"
+#include "src/codegen/handler-table.h"
 #include "src/codegen/label.h"
 #include "src/common/globals.h"
 #include "src/heap/factory.h"
@@ -952,7 +953,7 @@ class Literal final : public Expression {
     return string_;
   }
 
-  Smi AsSmiLiteral() const {
+  Tagged<Smi> AsSmiLiteral() const {
     DCHECK_EQ(kSmi, type());
     return Smi::FromInt(smi_);
   }
@@ -1864,7 +1865,7 @@ class BinaryOperation final : public Expression {
 
   // Returns true if one side is a Smi literal, returning the other side's
   // sub-expression in |subexpr| and the literal Smi in |literal|.
-  bool IsSmiLiteralOperation(Expression** subexpr, Smi* literal);
+  bool IsSmiLiteralOperation(Expression** subexpr, Tagged<Smi>* literal);
 
  private:
   friend class AstNodeFactory;
@@ -1978,6 +1979,7 @@ class CompareOperation final : public Expression {
   bool IsLiteralStrictCompareBoolean(Expression** expr, Literal** literal);
   bool IsLiteralCompareUndefined(Expression** expr);
   bool IsLiteralCompareNull(Expression** expr);
+  bool IsLiteralCompareEqualVariable(Expression** expr, Literal** literal);
 
  private:
   friend class AstNodeFactory;
diff --git a/deps/v8/src/ast/modules.cc b/deps/v8/src/ast/modules.cc
index e80222f92301ae..2b07460c256bc7 100644
--- a/deps/v8/src/ast/modules.cc
+++ b/deps/v8/src/ast/modules.cc
@@ -137,15 +137,15 @@ Handle<ModuleRequest> SourceTextModuleDescriptor::AstModuleRequest::Serialize(
           AllocationType::kOld);
   {
     DisallowGarbageCollection no_gc;
-    auto raw_import_assertions = *import_assertions_array;
+    Tagged<FixedArray> raw_import_assertions = *import_assertions_array;
     int i = 0;
     for (auto iter = import_assertions()->cbegin();
          iter != import_assertions()->cend();
          ++iter, i += ModuleRequest::kAssertionEntrySize) {
-      raw_import_assertions.set(i, *iter->first->string());
-      raw_import_assertions.set(i + 1, *iter->second.first->string());
-      raw_import_assertions.set(i + 2,
-                                Smi::FromInt(iter->second.second.beg_pos));
+      raw_import_assertions->set(i, *iter->first->string());
+      raw_import_assertions->set(i + 1, *iter->second.first->string());
+      raw_import_assertions->set(i + 2,
+                                 Smi::FromInt(iter->second.second.beg_pos));
     }
   }
   return v8::internal::ModuleRequest::New(isolate, specifier()->string(),
diff --git a/deps/v8/src/ast/prettyprinter.cc b/deps/v8/src/ast/prettyprinter.cc
index 5705ed9ca3a25b..d9458877a49ed1 100644
--- a/deps/v8/src/ast/prettyprinter.cc
+++ b/deps/v8/src/ast/prettyprinter.cc
@@ -398,7 +398,7 @@ void CallPrinter::VisitProperty(Property* node) {
   Expression* key = node->key();
   Literal* literal = key->AsLiteral();
   if (literal != nullptr &&
-      literal->BuildValue(isolate_)->IsInternalizedString()) {
+      IsInternalizedString(*literal->BuildValue(isolate_))) {
     Find(node->obj(), true);
     if (node->is_optional_chain_link()) {
       Print("?");
@@ -599,21 +599,21 @@ void CallPrinter::FindArguments(const ZonePtrList<Expression>* arguments) {
 }
 
 void CallPrinter::PrintLiteral(Handle<Object> value, bool quote) {
-  if (value->IsString()) {
+  if (IsString(*value)) {
     if (quote) Print("\"");
     Print(Handle<String>::cast(value));
     if (quote) Print("\"");
-  } else if (value->IsNull(isolate_)) {
+  } else if (IsNull(*value, isolate_)) {
     Print("null");
-  } else if (value->IsTrue(isolate_)) {
+  } else if (IsTrue(*value, isolate_)) {
     Print("true");
-  } else if (value->IsFalse(isolate_)) {
+  } else if (IsFalse(*value, isolate_)) {
     Print("false");
-  } else if (value->IsUndefined(isolate_)) {
+  } else if (IsUndefined(*value, isolate_)) {
     Print("undefined");
-  } else if (value->IsNumber()) {
+  } else if (IsNumber(*value)) {
     Print(isolate_->factory()->NumberToString(value));
-  } else if (value->IsSymbol()) {
+  } else if (IsSymbol(*value)) {
     // Symbols can only occur as literals if they were inserted by the parser.
     PrintLiteral(handle(Handle<Symbol>::cast(value)->description(), isolate_),
                  false);
@@ -853,7 +853,7 @@ const char* AstPrinter::PrintProgram(FunctionLiteral* program) {
 
 
 void AstPrinter::PrintOut(Isolate* isolate, AstNode* node) {
-  AstPrinter printer(isolate->stack_guard()->real_climit());
+  AstPrinter printer(isolate ? isolate->stack_guard()->real_climit() : 0);
   printer.Init();
   printer.Visit(node);
   PrintF("%s", printer.output_);
diff --git a/deps/v8/src/ast/scopes.cc b/deps/v8/src/ast/scopes.cc
index cd8be1caecf6ec..003bd0f27368a2 100644
--- a/deps/v8/src/ast/scopes.cc
+++ b/deps/v8/src/ast/scopes.cc
@@ -412,7 +412,7 @@ bool Scope::ContainsAsmModule() const {
 
 template <typename IsolateT>
 Scope* Scope::DeserializeScopeChain(IsolateT* isolate, Zone* zone,
-                                    ScopeInfo scope_info,
+                                    Tagged<ScopeInfo> scope_info,
                                     DeclarationScope* script_scope,
                                     AstValueFactory* ast_value_factory,
                                     DeserializationMode deserialization_mode) {
@@ -422,8 +422,8 @@ Scope* Scope::DeserializeScopeChain(IsolateT* isolate, Zone* zone,
   Scope* outer_scope = nullptr;
   bool cache_scope_found = false;
   while (!scope_info.is_null()) {
-    if (scope_info.scope_type() == WITH_SCOPE) {
-      if (scope_info.IsDebugEvaluateScope()) {
+    if (scope_info->scope_type() == WITH_SCOPE) {
+      if (scope_info->IsDebugEvaluateScope()) {
         outer_scope =
             zone->New<DeclarationScope>(zone, FUNCTION_SCOPE, ast_value_factory,
                                         handle(scope_info, isolate));
@@ -434,50 +434,50 @@ Scope* Scope::DeserializeScopeChain(IsolateT* isolate, Zone* zone,
                                        handle(scope_info, isolate));
       }
 
-    } else if (scope_info.scope_type() == SCRIPT_SCOPE) {
+    } else if (scope_info->scope_type() == SCRIPT_SCOPE) {
       // If we reach a script scope, it's the outermost scope. Install the
       // scope info of this script context onto the existing script scope to
       // avoid nesting script scopes.
       if (deserialization_mode == DeserializationMode::kIncludingVariables) {
         script_scope->SetScriptScopeInfo(handle(scope_info, isolate));
       }
-      if (scope_info.IsReplModeScope()) script_scope->set_is_repl_mode_scope();
-      DCHECK(!scope_info.HasOuterScopeInfo());
+      if (scope_info->IsReplModeScope()) script_scope->set_is_repl_mode_scope();
+      DCHECK(!scope_info->HasOuterScopeInfo());
       break;
-    } else if (scope_info.scope_type() == FUNCTION_SCOPE) {
+    } else if (scope_info->scope_type() == FUNCTION_SCOPE) {
       outer_scope = zone->New<DeclarationScope>(
           zone, FUNCTION_SCOPE, ast_value_factory, handle(scope_info, isolate));
 #if V8_ENABLE_WEBASSEMBLY
-      if (scope_info.IsAsmModule()) {
+      if (scope_info->IsAsmModule()) {
         outer_scope->AsDeclarationScope()->set_is_asm_module();
       }
 #endif  // V8_ENABLE_WEBASSEMBLY
-    } else if (scope_info.scope_type() == EVAL_SCOPE) {
+    } else if (scope_info->scope_type() == EVAL_SCOPE) {
       outer_scope = zone->New<DeclarationScope>(
           zone, EVAL_SCOPE, ast_value_factory, handle(scope_info, isolate));
-    } else if (scope_info.scope_type() == CLASS_SCOPE) {
+    } else if (scope_info->scope_type() == CLASS_SCOPE) {
       outer_scope = zone->New<ClassScope>(isolate, zone, ast_value_factory,
                                           handle(scope_info, isolate));
-    } else if (scope_info.scope_type() == BLOCK_SCOPE) {
-      if (scope_info.is_declaration_scope()) {
+    } else if (scope_info->scope_type() == BLOCK_SCOPE) {
+      if (scope_info->is_declaration_scope()) {
         outer_scope = zone->New<DeclarationScope>(
             zone, BLOCK_SCOPE, ast_value_factory, handle(scope_info, isolate));
       } else {
         outer_scope = zone->New<Scope>(zone, BLOCK_SCOPE, ast_value_factory,
                                        handle(scope_info, isolate));
       }
-    } else if (scope_info.scope_type() == MODULE_SCOPE) {
+    } else if (scope_info->scope_type() == MODULE_SCOPE) {
       outer_scope = zone->New<ModuleScope>(handle(scope_info, isolate),
                                            ast_value_factory);
     } else {
-      DCHECK_EQ(scope_info.scope_type(), CATCH_SCOPE);
-      DCHECK_EQ(scope_info.ContextLocalCount(), 1);
-      DCHECK_EQ(scope_info.ContextLocalMode(0), VariableMode::kVar);
-      DCHECK_EQ(scope_info.ContextLocalInitFlag(0), kCreatedInitialized);
-      DCHECK(scope_info.HasInlinedLocalNames());
-      String name = scope_info.ContextInlinedLocalName(0);
+      DCHECK_EQ(scope_info->scope_type(), CATCH_SCOPE);
+      DCHECK_EQ(scope_info->ContextLocalCount(), 1);
+      DCHECK_EQ(scope_info->ContextLocalMode(0), VariableMode::kVar);
+      DCHECK_EQ(scope_info->ContextLocalInitFlag(0), kCreatedInitialized);
+      DCHECK(scope_info->HasInlinedLocalNames());
+      String name = scope_info->ContextInlinedLocalName(0);
       MaybeAssignedFlag maybe_assigned =
-          scope_info.ContextLocalMaybeAssignedFlag(0);
+          scope_info->ContextLocalMaybeAssignedFlag(0);
       outer_scope =
           zone->New<Scope>(zone,
                            ast_value_factory->GetString(
@@ -501,8 +501,8 @@ Scope* Scope::DeserializeScopeChain(IsolateT* isolate, Zone* zone,
     }
     current_scope = outer_scope;
     if (innermost_scope == nullptr) innermost_scope = current_scope;
-    scope_info = scope_info.HasOuterScopeInfo() ? scope_info.OuterScopeInfo()
-                                                : ScopeInfo();
+    scope_info = scope_info->HasOuterScopeInfo() ? scope_info->OuterScopeInfo()
+                                                 : Tagged<ScopeInfo>();
   }
 
   if (deserialization_mode == DeserializationMode::kIncludingVariables) {
@@ -534,12 +534,12 @@ template EXPORT_TEMPLATE_DEFINE(
 
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
     Scope* Scope::DeserializeScopeChain(
-        Isolate* isolate, Zone* zone, ScopeInfo scope_info,
+        Isolate* isolate, Zone* zone, Tagged<ScopeInfo> scope_info,
         DeclarationScope* script_scope, AstValueFactory* ast_value_factory,
         DeserializationMode deserialization_mode);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
     Scope* Scope::DeserializeScopeChain(
-        LocalIsolate* isolate, Zone* zone, ScopeInfo scope_info,
+        LocalIsolate* isolate, Zone* zone, Tagged<ScopeInfo> scope_info,
         DeclarationScope* script_scope, AstValueFactory* ast_value_factory,
         DeserializationMode deserialization_mode);
 
@@ -751,6 +751,13 @@ void DeclarationScope::DeclareThis(AstValueFactory* ast_value_factory) {
       THIS_VARIABLE,
       derived_constructor ? kNeedsInitialization : kCreatedInitialized,
       kNotAssigned);
+  // Derived constructors have hole checks when calling super. Mark the 'this'
+  // variable as having hole initialization forced so that TDZ elision analysis
+  // applies and numbers the variable.
+  if (derived_constructor) {
+    receiver_->ForceHoleInitialization(
+        Variable::kHasHoleCheckUseInUnknownScope);
+  }
   locals_.Add(receiver_);
 }
 
@@ -982,20 +989,20 @@ Variable* Scope::LookupInScopeInfo(const AstRawString* name, Scope* cache) {
 
   {
     location = VariableLocation::CONTEXT;
-    index = scope_info.ContextSlotIndex(name->string(), &lookup_result);
+    index = scope_info->ContextSlotIndex(name->string(), &lookup_result);
     found = index >= 0;
   }
 
   if (!found && is_module_scope()) {
     location = VariableLocation::MODULE;
-    index = scope_info.ModuleIndex(name_handle, &lookup_result.mode,
-                                   &lookup_result.init_flag,
-                                   &lookup_result.maybe_assigned_flag);
+    index = scope_info->ModuleIndex(name_handle, &lookup_result.mode,
+                                    &lookup_result.init_flag,
+                                    &lookup_result.maybe_assigned_flag);
     found = index != 0;
   }
 
   if (!found) {
-    index = scope_info.FunctionContextSlotIndex(name_handle);
+    index = scope_info->FunctionContextSlotIndex(name_handle);
     if (index < 0) return nullptr;  // Nowhere found.
     Variable* var = AsDeclarationScope()->DeclareFunctionVar(name, cache);
     DCHECK_EQ(VariableMode::kConst, var->mode());
@@ -1004,7 +1011,7 @@ Variable* Scope::LookupInScopeInfo(const AstRawString* name, Scope* cache) {
   }
 
   if (!is_module_scope()) {
-    DCHECK_NE(index, scope_info.ReceiverContextSlotIndex());
+    DCHECK_NE(index, scope_info->ReceiverContextSlotIndex());
   }
 
   bool was_added;
@@ -1244,10 +1251,6 @@ Variable* DeclarationScope::DeclareDynamicGlobal(const AstRawString* name,
   // TODO(neis): Mark variable as maybe-assigned?
 }
 
-bool Scope::RemoveUnresolved(VariableProxy* var) {
-  return unresolved_list_.Remove(var);
-}
-
 void Scope::DeleteUnresolved(VariableProxy* var) {
   DCHECK(unresolved_list_.Contains(var));
   var->mark_removed_from_unresolved();
@@ -1601,50 +1604,18 @@ bool Scope::IsOuterScopeOf(Scope* other) const {
   return false;
 }
 
-void Scope::CollectNonLocals(DeclarationScope* max_outer_scope,
-                             Isolate* isolate, Handle<StringSet>* non_locals) {
-  this->ForEach([max_outer_scope, isolate, non_locals](Scope* scope) {
-    // Module variables must be allocated before variable resolution
-    // to ensure that UpdateNeedsHoleCheck() can detect import variables.
-    if (scope->is_module_scope()) {
-      scope->AsModuleScope()->AllocateModuleVariables();
-    }
-
-    // Lazy parsed declaration scopes are already partially analyzed. If there
-    // are unresolved references remaining, they just need to be resolved in
-    // outer scopes.
-    Scope* lookup = WasLazilyParsed(scope) ? scope->outer_scope() : scope;
-
-    for (VariableProxy* proxy : scope->unresolved_list_) {
-      DCHECK(!proxy->is_resolved());
-      Variable* var =
-          Lookup<kParsedScope>(proxy, lookup, max_outer_scope->outer_scope());
-      if (var == nullptr) {
-        *non_locals = StringSet::Add(isolate, *non_locals, proxy->name());
-      } else {
-        // In this case we need to leave scopes in a way that they can be
-        // allocated. If we resolved variables from lazy parsed scopes, we need
-        // to context allocate the var.
-        scope->ResolveTo(proxy, var);
-        if (!var->is_dynamic() && lookup != scope)
-          var->ForceContextAllocation();
-      }
-    }
-
-    // Clear unresolved_list_ as it's in an inconsistent state.
-    scope->unresolved_list_.Clear();
-    return Iteration::kDescend;
-  });
-}
-
 void Scope::AnalyzePartially(DeclarationScope* max_outer_scope,
                              AstNodeFactory* ast_node_factory,
                              UnresolvedList* new_unresolved_list,
                              bool maybe_in_arrowhead) {
   this->ForEach([max_outer_scope, ast_node_factory, new_unresolved_list,
                  maybe_in_arrowhead](Scope* scope) {
-    DCHECK_IMPLIES(scope->is_declaration_scope(),
-                   !scope->AsDeclarationScope()->was_lazily_parsed());
+    // Skip already lazily parsed scopes. This can only happen to functions
+    // inside arrowheads.
+    if (WasLazilyParsed(scope)) {
+      DCHECK(max_outer_scope->is_arrow_scope());
+      return Iteration::kContinue;
+    }
 
     for (VariableProxy* proxy = scope->unresolved_list_.first();
          proxy != nullptr; proxy = proxy->next_unresolved()) {
@@ -1673,12 +1644,6 @@ void Scope::AnalyzePartially(DeclarationScope* max_outer_scope,
   });
 }
 
-Handle<StringSet> DeclarationScope::CollectNonLocals(
-    Isolate* isolate, Handle<StringSet> non_locals) {
-  Scope::CollectNonLocals(this, isolate, &non_locals);
-  return non_locals;
-}
-
 void DeclarationScope::ResetAfterPreparsing(AstValueFactory* ast_value_factory,
                                             bool aborted) {
   DCHECK(is_function_scope());
@@ -1734,7 +1699,10 @@ bool Scope::IsSkippableFunctionScope() {
 
 void Scope::SavePreparseData(Parser* parser) {
   this->ForEach([parser](Scope* scope) {
-    if (scope->IsSkippableFunctionScope()) {
+    // Save preparse data for every skippable scope, unless it was already
+    // previously saved (this can happen with functions inside arrowheads).
+    if (scope->IsSkippableFunctionScope() &&
+        !scope->AsDeclarationScope()->was_lazily_parsed()) {
       scope->AsDeclarationScope()->SavePreparseDataForDeclarationScope(parser);
     }
     return Iteration::kDescend;
@@ -1751,10 +1719,28 @@ void DeclarationScope::AnalyzePartially(Parser* parser,
                                         bool maybe_in_arrowhead) {
   DCHECK(!force_eager_compilation_);
   UnresolvedList new_unresolved_list;
-  if (!IsArrowFunction(function_kind_) &&
-      (!outer_scope_->is_script_scope() || maybe_in_arrowhead ||
-       (preparse_data_builder_ != nullptr &&
-        preparse_data_builder_->HasInnerFunctions()))) {
+
+  // We don't need to do partial analysis for top level functions, since they
+  // can only access values in the global scope, and we can't track assignments
+  // for these since they're accessible across scripts.
+  //
+  // If the top level function has inner functions though, we do still want to
+  // analyze those to save their preparse data.
+  //
+  // Additionally, functions in potential arrowheads _need_ to be analyzed, in
+  // case they do end up being in an arrowhead and the arrow function needs to
+  // know about context acceses. For example, in
+  //
+  //     (a, b=function foo(){ a = 1 }) => { b(); return a}
+  //
+  // `function foo(){ a = 1 }` is "maybe_in_arrowhead" but still top-level when
+  // parsed, and is re-scoped to the arrow function when that one is parsed. The
+  // arrow function needs to know that `a` needs to be context allocated, so
+  // that the call to `b()` correctly updates the `a` parameter.
+  const bool is_top_level_function = outer_scope_->is_script_scope();
+  const bool has_inner_functions = preparse_data_builder_ != nullptr &&
+                                   preparse_data_builder_->HasInnerFunctions();
+  if (maybe_in_arrowhead || !is_top_level_function || has_inner_functions) {
     // Try to resolve unresolved variables for this Scope and migrate those
     // which cannot be resolved inside. It doesn't make sense to try to resolve
     // them in the outer Scopes here, because they are incomplete.
@@ -2303,9 +2289,10 @@ void Scope::ResolveVariable(VariableProxy* proxy) {
 
 namespace {
 
-void SetNeedsHoleCheck(Variable* var, VariableProxy* proxy) {
+void SetNeedsHoleCheck(Variable* var, VariableProxy* proxy,
+                       Variable::ForceHoleInitializationFlag flag) {
   proxy->set_needs_hole_check();
-  var->ForceHoleInitialization();
+  var->ForceHoleInitialization(flag);
 }
 
 void UpdateNeedsHoleCheck(Variable* var, VariableProxy* proxy, Scope* scope) {
@@ -2324,7 +2311,8 @@ void UpdateNeedsHoleCheck(Variable* var, VariableProxy* proxy, Scope* scope) {
   // unknown at compilation time whether the binding referred to in the
   // exporting module itself requires hole checks.
   if (var->location() == VariableLocation::MODULE && !var->IsExport()) {
-    return SetNeedsHoleCheck(var, proxy);
+    SetNeedsHoleCheck(var, proxy, Variable::kHasHoleCheckUseInUnknownScope);
+    return;
   }
 
   // Check if the binding really needs an initialization check. The check
@@ -2346,7 +2334,9 @@ void UpdateNeedsHoleCheck(Variable* var, VariableProxy* proxy, Scope* scope) {
   // The scope of the variable needs to be checked, in case the use is
   // in a sub-block which may be linear.
   if (var->scope()->GetClosureScope() != scope->GetClosureScope()) {
-    return SetNeedsHoleCheck(var, proxy);
+    SetNeedsHoleCheck(var, proxy,
+                      Variable::kHasHoleCheckUseInDifferentClosureScope);
+    return;
   }
 
   // We should always have valid source positions.
@@ -2355,7 +2345,8 @@ void UpdateNeedsHoleCheck(Variable* var, VariableProxy* proxy, Scope* scope) {
 
   if (var->scope()->is_nonlinear() ||
       var->initializer_position() >= proxy->position()) {
-    return SetNeedsHoleCheck(var, proxy);
+    SetNeedsHoleCheck(var, proxy, Variable::kHasHoleCheckUseInSameClosureScope);
+    return;
   }
 }
 
@@ -2815,7 +2806,7 @@ bool IsComplementaryAccessorPair(VariableMode a, VariableMode b) {
 }
 
 void ClassScope::FinalizeReparsedClassScope(
-    Isolate* isolate, MaybeHandle<ScopeInfo> maybe_scope_info,
+    Isolate* isolate, MaybeHandle<ScopeInfo> maybe_class_scope_info,
     AstValueFactory* ast_value_factory, bool needs_allocation_fixup) {
   // Set this bit so that DeclarationScope::Analyze recognizes
   // the reparsed instance member initializer scope.
@@ -2831,10 +2822,10 @@ void ClassScope::FinalizeReparsedClassScope(
   // the class scope from ScopeInfo, so that we don't need to run
   // resolution and allocation on these variables again when generating
   // code for the initializer function.
-  DCHECK(!maybe_scope_info.is_null());
-  Handle<ScopeInfo> scope_info = maybe_scope_info.ToHandleChecked();
+  DCHECK(!maybe_class_scope_info.is_null());
+  Handle<ScopeInfo> scope_info = maybe_class_scope_info.ToHandleChecked();
   DCHECK_EQ(scope_info->scope_type(), CLASS_SCOPE);
-  DCHECK_EQ(scope_info->StartPosition(), start_position_);
+  DCHECK_EQ(scope_info->EndPosition(), end_position_);
 
   int context_header_length = scope_info->ContextHeaderLength();
   DisallowGarbageCollection no_gc;
diff --git a/deps/v8/src/ast/scopes.h b/deps/v8/src/ast/scopes.h
index cba189ba0e21a0..b4c2e8b2136813 100644
--- a/deps/v8/src/ast/scopes.h
+++ b/deps/v8/src/ast/scopes.h
@@ -149,7 +149,7 @@ class V8_EXPORT_PRIVATE Scope : public NON_EXPORTED_BASE(ZoneObject) {
   template <typename IsolateT>
   EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
   static Scope* DeserializeScopeChain(IsolateT* isolate, Zone* zone,
-                                      ScopeInfo scope_info,
+                                      Tagged<ScopeInfo> scope_info,
                                       DeclarationScope* script_scope,
                                       AstValueFactory* ast_value_factory,
                                       DeserializationMode deserialization_mode);
@@ -227,9 +227,6 @@ class V8_EXPORT_PRIVATE Scope : public NON_EXPORTED_BASE(ZoneObject) {
   VariableProxy* NewUnresolved(AstNodeFactory* factory,
                                const AstRawString* name, int start_pos,
                                VariableKind kind = NORMAL_VARIABLE) {
-    // Note that we must not share the unresolved variables with
-    // the same name because they may be removed selectively via
-    // RemoveUnresolved().
     DCHECK(!already_resolved_);
     DCHECK_EQ(factory->zone(), zone());
     VariableProxy* proxy = factory->NewVariableProxy(name, kind, start_pos);
@@ -239,11 +236,6 @@ class V8_EXPORT_PRIVATE Scope : public NON_EXPORTED_BASE(ZoneObject) {
 
   void AddUnresolved(VariableProxy* proxy);
 
-  // Removes an unresolved variable from the list so it can be readded to
-  // another list. This is used to reparent parameter initializers that contain
-  // sloppy eval.
-  bool RemoveUnresolved(VariableProxy* var);
-
   // Deletes an unresolved variable. The variable proxy cannot be reused for
   // another list later. During parsing, an unresolved variable may have been
   // added optimistically, but then only the variable name was used (typically
@@ -328,6 +320,14 @@ class V8_EXPORT_PRIVATE Scope : public NON_EXPORTED_BASE(ZoneObject) {
   //     switch (tag) { cases }
   //   start position: start position of '{'
   //   end position: end position of '}'
+  // * For the scope of a class literal or declaration
+  //     class A extends B { body }
+  //   start position: start position of 'class'
+  //   end position: end position of '}'
+  // * For the scope of a class member initializer functions:
+  //     class A extends B { body }
+  //   start position: start position of '{'
+  //   end position: end position of '}'
   int start_position() const { return start_position_; }
   void set_start_position(int statement_pos) {
     start_position_ = statement_pos;
@@ -707,8 +707,6 @@ class V8_EXPORT_PRIVATE Scope : public NON_EXPORTED_BASE(ZoneObject) {
                         AstNodeFactory* ast_node_factory,
                         UnresolvedList* new_unresolved_list,
                         bool maybe_in_arrowhead);
-  void CollectNonLocals(DeclarationScope* max_outer_scope, Isolate* isolate,
-                        Handle<StringSet>* non_locals);
 
   // Predicates.
   bool MustAllocate(Variable* var);
@@ -1161,9 +1159,6 @@ class V8_EXPORT_PRIVATE DeclarationScope : public Scope {
   V8_EXPORT_PRIVATE static void AllocateScopeInfos(ParseInfo* info,
                                                    IsolateT* isolate);
 
-  Handle<StringSet> CollectNonLocals(Isolate* isolate,
-                                     Handle<StringSet> non_locals);
-
   // Determine if we can use lazy compilation for this scope.
   bool AllowsLazyCompilation() const;
 
@@ -1496,7 +1491,7 @@ class V8_EXPORT_PRIVATE ClassScope : public Scope {
   // If the reparsed scope declares any variable that needs allocation
   // fixup using the scope info, needs_allocation_fixup is true.
   void FinalizeReparsedClassScope(Isolate* isolate,
-                                  MaybeHandle<ScopeInfo> outer_scope_info,
+                                  MaybeHandle<ScopeInfo> maybe_class_scope_info,
                                   AstValueFactory* ast_value_factory,
                                   bool needs_allocation_fixup);
 #ifdef DEBUG
diff --git a/deps/v8/src/ast/variables.cc b/deps/v8/src/ast/variables.cc
index adeb7e7f8c4080..6f5d94257b912d 100644
--- a/deps/v8/src/ast/variables.cc
+++ b/deps/v8/src/ast/variables.cc
@@ -44,5 +44,15 @@ void Variable::RewriteLocationForRepl() {
   }
 }
 
+void Variable::AssignHoleCheckBitmapIndex(ZoneVector<Variable*>& list,
+                                          uint8_t next_index) {
+  DCHECK_EQ(next_index, list.size() + 1);
+  DCHECK_NE(kUncacheableHoleCheckBitmapIndex, next_index);
+  DCHECK_LT(next_index, kHoleCheckBitmapBits);
+  hole_check_analysis_bit_field_ = HoleCheckBitmapIndexField::update(
+      hole_check_analysis_bit_field_, next_index);
+  list.push_back(this);
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/ast/variables.h b/deps/v8/src/ast/variables.h
index e63593b3d2927f..30d41ea800d00d 100644
--- a/deps/v8/src/ast/variables.h
+++ b/deps/v8/src/ast/variables.h
@@ -8,6 +8,7 @@
 #include "src/ast/ast-value-factory.h"
 #include "src/base/threaded-list.h"
 #include "src/common/globals.h"
+#include "src/zone/zone-containers.h"
 #include "src/zone/zone.h"
 
 namespace v8 {
@@ -34,10 +35,13 @@ class Variable final : public ZoneObject {
                    VariableModeField::encode(mode) |
                    IsUsedField::encode(false) |
                    ForceContextAllocationBit::encode(false) |
-                   ForceHoleInitializationField::encode(false) |
                    LocationField::encode(VariableLocation::UNALLOCATED) |
                    VariableKindField::encode(kind) |
-                   IsStaticFlagField::encode(is_static_flag)) {
+                   IsStaticFlagField::encode(is_static_flag)),
+        hole_check_analysis_bit_field_(HoleCheckBitmapIndexField::encode(
+                                           kUncacheableHoleCheckBitmapIndex) |
+                                       ForceHoleInitializationFlagField::encode(
+                                           kHoleInitializationNotForced)) {
     // Var declared variables never need initialization.
     DCHECK(!(mode == VariableMode::kVar &&
              initialization_flag == kNeedsInitialization));
@@ -144,12 +148,12 @@ class Variable final : public ZoneObject {
     DCHECK_IMPLIES(initialization_flag() == kNeedsInitialization,
                    IsLexicalVariableMode(mode()) ||
                        IsPrivateMethodOrAccessorVariableMode(mode()));
-    DCHECK_IMPLIES(ForceHoleInitializationField::decode(bit_field_),
+    DCHECK_IMPLIES(IsHoleInitializationForced(),
                    initialization_flag() == kNeedsInitialization);
 
     // Always initialize if hole initialization was forced during
     // scope analysis.
-    if (ForceHoleInitializationField::decode(bit_field_)) return true;
+    if (IsHoleInitializationForced()) return true;
 
     // If initialization was not forced, no need for initialization
     // for stack allocated variables, since UpdateNeedsHoleCheck()
@@ -162,14 +166,79 @@ class Variable final : public ZoneObject {
     return initialization_flag() == kNeedsInitialization;
   }
 
+  enum ForceHoleInitializationFlag {
+    kHoleInitializationNotForced = 0,
+    kHasHoleCheckUseInDifferentClosureScope = 1 << 0,
+    kHasHoleCheckUseInSameClosureScope = 1 << 1,
+    kHasHoleCheckUseInUnknownScope = kHasHoleCheckUseInDifferentClosureScope |
+                                     kHasHoleCheckUseInSameClosureScope
+  };
+  ForceHoleInitializationFlag force_hole_initialization_flag_field() const {
+    return ForceHoleInitializationFlagField::decode(
+        hole_check_analysis_bit_field_);
+  }
+
+  bool IsHoleInitializationForced() const {
+    return force_hole_initialization_flag_field() !=
+           kHoleInitializationNotForced;
+  }
+
+  bool HasHoleCheckUseInSameClosureScope() const {
+    return force_hole_initialization_flag_field() &
+           kHasHoleCheckUseInSameClosureScope;
+  }
+
   // Called during scope analysis when a VariableProxy is found to
   // reference this Variable in such a way that a hole check will
   // be required at runtime.
-  void ForceHoleInitialization() {
+  void ForceHoleInitialization(ForceHoleInitializationFlag flag) {
     DCHECK_EQ(kNeedsInitialization, initialization_flag());
+    DCHECK_NE(kHoleInitializationNotForced, flag);
     DCHECK(IsLexicalVariableMode(mode()) ||
            IsPrivateMethodOrAccessorVariableMode(mode()));
-    bit_field_ = ForceHoleInitializationField::update(bit_field_, true);
+    hole_check_analysis_bit_field_ |=
+        ForceHoleInitializationFlagField::encode(flag);
+  }
+
+  // The first N-1 lexical bindings that need hole checks in a compilation are
+  // numbered, where N is the number of bits in HoleCheckBitmap. This number is
+  // an index into a bitmap that the BytecodeGenerator uses to elide redundant
+  // hole checks.
+  using HoleCheckBitmap = uint64_t;
+
+  // The 0th index is reserved for bindings for which the BytecodeGenerator
+  // should not elide hole checks, such as for bindings beyond the first N-1.
+  //
+  // This index in the bitmap must always be 0.
+  static constexpr uint8_t kUncacheableHoleCheckBitmapIndex = 0;
+  static constexpr uint8_t kHoleCheckBitmapBits =
+      std::numeric_limits<HoleCheckBitmap>::digits;
+
+  void ResetHoleCheckBitmapIndex() {
+    hole_check_analysis_bit_field_ = HoleCheckBitmapIndexField::update(
+        hole_check_analysis_bit_field_, kUncacheableHoleCheckBitmapIndex);
+  }
+
+  void RememberHoleCheckInBitmap(HoleCheckBitmap& bitmap,
+                                 ZoneVector<Variable*>& list) {
+    DCHECK(v8_flags.ignition_elide_redundant_tdz_checks);
+    uint8_t index = HoleCheckBitmapIndex();
+    if (V8_UNLIKELY(index == kUncacheableHoleCheckBitmapIndex)) {
+      index = list.size() + 1;
+      // The bitmap is full.
+      if (index == kHoleCheckBitmapBits) return;
+      AssignHoleCheckBitmapIndex(list, index);
+    }
+    bitmap |= HoleCheckBitmap{1} << index;
+    DCHECK_EQ(
+        0, bitmap & (HoleCheckBitmap{1} << kUncacheableHoleCheckBitmapIndex));
+  }
+
+  bool HasRememberedHoleCheck(HoleCheckBitmap bitmap) const {
+    uint8_t index = HoleCheckBitmapIndex();
+    bool result = bitmap & (HoleCheckBitmap{1} << index);
+    DCHECK_IMPLIES(index == kUncacheableHoleCheckBitmapIndex, !result);
+    return result;
   }
 
   bool throw_on_const_assignment(LanguageMode language_mode) const {
@@ -260,22 +329,33 @@ class Variable final : public ZoneObject {
   int index_;
   int initializer_position_;
   uint16_t bit_field_;
+  uint16_t hole_check_analysis_bit_field_;
 
   void set_maybe_assigned() {
     bit_field_ = MaybeAssignedFlagField::update(bit_field_, kMaybeAssigned);
   }
 
+  uint8_t HoleCheckBitmapIndex() const {
+    return HoleCheckBitmapIndexField::decode(hole_check_analysis_bit_field_);
+  }
+
+  void AssignHoleCheckBitmapIndex(ZoneVector<Variable*>& list,
+                                  uint8_t next_index);
+
   using VariableModeField = base::BitField16<VariableMode, 0, 4>;
   using VariableKindField = VariableModeField::Next<VariableKind, 3>;
   using LocationField = VariableKindField::Next<VariableLocation, 3>;
   using ForceContextAllocationBit = LocationField::Next<bool, 1>;
   using IsUsedField = ForceContextAllocationBit::Next<bool, 1>;
   using InitializationFlagField = IsUsedField::Next<InitializationFlag, 1>;
-  using ForceHoleInitializationField = InitializationFlagField::Next<bool, 1>;
   using MaybeAssignedFlagField =
-      ForceHoleInitializationField::Next<MaybeAssignedFlag, 1>;
+      InitializationFlagField::Next<MaybeAssignedFlag, 1>;
   using IsStaticFlagField = MaybeAssignedFlagField::Next<IsStaticFlag, 1>;
 
+  using HoleCheckBitmapIndexField = base::BitField16<uint8_t, 0, 8>;
+  using ForceHoleInitializationFlagField =
+      HoleCheckBitmapIndexField::Next<ForceHoleInitializationFlag, 2>;
+
   Variable** next() { return &next_; }
   friend List;
   friend base::ThreadedListTraits<Variable>;
diff --git a/deps/v8/src/base/atomic-utils.h b/deps/v8/src/base/atomic-utils.h
index e81176e582ace4..eafb08abafe93a 100644
--- a/deps/v8/src/base/atomic-utils.h
+++ b/deps/v8/src/base/atomic-utils.h
@@ -149,6 +149,16 @@ class AsAtomicImpl {
         cast_helper<T>::to_storage_type(new_value)));
   }
 
+  template <typename T>
+  static T SeqCst_CompareAndSwap(
+      T* addr, typename std::remove_reference<T>::type old_value,
+      typename std::remove_reference<T>::type new_value) {
+    static_assert(sizeof(T) <= sizeof(AtomicStorageType));
+    return cast_helper<T>::to_return_type(base::SeqCst_CompareAndSwap(
+        to_storage_addr(addr), cast_helper<T>::to_storage_type(old_value),
+        cast_helper<T>::to_storage_type(new_value)));
+  }
+
   // Atomically sets bits selected by the mask to the given value.
   // Returns false if the bits are already set as needed.
   template <typename T>
diff --git a/deps/v8/src/base/atomicops.h b/deps/v8/src/base/atomicops.h
index 8ffcfac2b8350e..815d88e4fee314 100644
--- a/deps/v8/src/base/atomicops.h
+++ b/deps/v8/src/base/atomicops.h
@@ -178,6 +178,14 @@ inline Atomic32 AcquireRelease_CompareAndSwap(volatile Atomic32* ptr,
   return old_value;
 }
 
+inline Atomic32 SeqCst_CompareAndSwap(volatile Atomic32* ptr,
+                                      Atomic32 old_value, Atomic32 new_value) {
+  atomic_compare_exchange_strong_explicit(
+      helper::to_std_atomic(ptr), &old_value, new_value,
+      std::memory_order_seq_cst, std::memory_order_seq_cst);
+  return old_value;
+}
+
 inline void Relaxed_Store(volatile Atomic8* ptr, Atomic8 value) {
   std::atomic_store_explicit(helper::to_std_atomic(ptr), value,
                              std::memory_order_relaxed);
@@ -312,6 +320,14 @@ inline Atomic64 AcquireRelease_CompareAndSwap(volatile Atomic64* ptr,
   return old_value;
 }
 
+inline Atomic64 SeqCst_CompareAndSwap(volatile Atomic64* ptr,
+                                      Atomic64 old_value, Atomic64 new_value) {
+  std::atomic_compare_exchange_strong_explicit(
+      helper::to_std_atomic(ptr), &old_value, new_value,
+      std::memory_order_seq_cst, std::memory_order_seq_cst);
+  return old_value;
+}
+
 inline void Relaxed_Store(volatile Atomic64* ptr, Atomic64 value) {
   std::atomic_store_explicit(helper::to_std_atomic(ptr), value,
                              std::memory_order_relaxed);
diff --git a/deps/v8/src/base/bit-field.h b/deps/v8/src/base/bit-field.h
index 06db44e3b2e0df..59e786bdd1f23f 100644
--- a/deps/v8/src/base/bit-field.h
+++ b/deps/v8/src/base/bit-field.h
@@ -7,6 +7,8 @@
 
 #include <stdint.h>
 
+#include <algorithm>
+
 #include "src/base/macros.h"
 
 namespace v8 {
@@ -29,6 +31,7 @@ class BitField final {
   static_assert(size > 0);
 
   using FieldType = T;
+  using BaseType = U;
 
   // A type U mask of bit field.  To use all bits of a type U of x bits
   // in a bitfield without compiler warnings we have to compute 2^x
@@ -72,6 +75,24 @@ class BitField final {
   }
 };
 
+// ----------------------------------------------------------------------------
+// BitFieldUnion can be used to combine two linear BitFields.
+// So far only the static mask is computed. Encoding and decoding tbd.
+// Can be used for example as a quick combined check:
+//   `if (BitFieldUnion<BFA, BFB>::kMask & bitfield) ...`
+
+template <typename A, typename B>
+class BitFieldUnion final {
+ public:
+  static_assert(
+      std::is_same<typename A::BaseType, typename B::BaseType>::value);
+  static_assert((A::kMask & B::kMask) == 0);
+  static constexpr int kShift = std::min(A::kShift, B::kShift);
+  static constexpr int kMask = A::kMask | B::kMask;
+  static constexpr int kSize =
+      A::kSize + B::kSize + (std::max(A::kShift, B::kShift) - kShift);
+};
+
 template <class T, int shift, int size>
 using BitField8 = BitField<T, shift, size, uint8_t>;
 
diff --git a/deps/v8/src/base/bits.cc b/deps/v8/src/base/bits.cc
index 2a3dce97761c59..122c11c8d21b15 100644
--- a/deps/v8/src/base/bits.cc
+++ b/deps/v8/src/base/bits.cc
@@ -12,40 +12,6 @@ namespace v8 {
 namespace base {
 namespace bits {
 
-uint32_t RoundUpToPowerOfTwo32(uint32_t value) {
-  DCHECK_LE(value, uint32_t{1} << 31);
-  if (value) --value;
-// Use computation based on leading zeros if we have compiler support for that.
-#if V8_HAS_BUILTIN_CLZ || V8_CC_MSVC
-  return 1u << (32 - CountLeadingZeros(value));
-#else
-  value |= value >> 1;
-  value |= value >> 2;
-  value |= value >> 4;
-  value |= value >> 8;
-  value |= value >> 16;
-  return value + 1;
-#endif
-}
-
-uint64_t RoundUpToPowerOfTwo64(uint64_t value) {
-  DCHECK_LE(value, uint64_t{1} << 63);
-  if (value) --value;
-// Use computation based on leading zeros if we have compiler support for that.
-#if V8_HAS_BUILTIN_CLZ
-  return uint64_t{1} << (64 - CountLeadingZeros(value));
-#else
-  value |= value >> 1;
-  value |= value >> 2;
-  value |= value >> 4;
-  value |= value >> 8;
-  value |= value >> 16;
-  value |= value >> 32;
-  return value + 1;
-#endif
-}
-
-
 int32_t SignedMulHigh32(int32_t lhs, int32_t rhs) {
   int64_t const value = static_cast<int64_t>(lhs) * static_cast<int64_t>(rhs);
   return base::bit_cast<int32_t, uint32_t>(base::bit_cast<uint64_t>(value) >>
diff --git a/deps/v8/src/base/bits.h b/deps/v8/src/base/bits.h
index 2d618782745cf9..78f2c8b88acc28 100644
--- a/deps/v8/src/base/bits.h
+++ b/deps/v8/src/base/bits.h
@@ -219,11 +219,40 @@ inline constexpr int WhichPowerOfTwo(T value) {
 // 0x80000000u. Uses computation based on leading zeros if we have compiler
 // support for that. Falls back to the implementation from "Hacker's Delight" by
 // Henry S. Warren, Jr., figure 3-3, page 48, where the function is called clp2.
-V8_BASE_EXPORT uint32_t RoundUpToPowerOfTwo32(uint32_t value);
+V8_BASE_EXPORT constexpr uint32_t RoundUpToPowerOfTwo32(uint32_t value) {
+  DCHECK_LE(value, uint32_t{1} << 31);
+  if (value) --value;
+// Use computation based on leading zeros if we have compiler support for that.
+#if V8_HAS_BUILTIN_CLZ || V8_CC_MSVC
+  return 1u << (32 - CountLeadingZeros(value));
+#else
+  value |= value >> 1;
+  value |= value >> 2;
+  value |= value >> 4;
+  value |= value >> 8;
+  value |= value >> 16;
+  return value + 1;
+#endif
+}
 // Same for 64 bit integers. |value| must be <= 2^63
-V8_BASE_EXPORT uint64_t RoundUpToPowerOfTwo64(uint64_t value);
+V8_BASE_EXPORT constexpr uint64_t RoundUpToPowerOfTwo64(uint64_t value) {
+  DCHECK_LE(value, uint64_t{1} << 63);
+  if (value) --value;
+// Use computation based on leading zeros if we have compiler support for that.
+#if V8_HAS_BUILTIN_CLZ
+  return uint64_t{1} << (64 - CountLeadingZeros(value));
+#else
+  value |= value >> 1;
+  value |= value >> 2;
+  value |= value >> 4;
+  value |= value >> 8;
+  value |= value >> 16;
+  value |= value >> 32;
+  return value + 1;
+#endif
+}
 // Same for size_t integers.
-inline size_t RoundUpToPowerOfTwo(size_t value) {
+inline constexpr size_t RoundUpToPowerOfTwo(size_t value) {
   if (sizeof(size_t) == sizeof(uint64_t)) {
     return RoundUpToPowerOfTwo64(value);
   } else {
diff --git a/deps/v8/src/base/bounded-page-allocator.cc b/deps/v8/src/base/bounded-page-allocator.cc
index b61a01039ee2cc..d3a377b49b53a0 100644
--- a/deps/v8/src/base/bounded-page-allocator.cc
+++ b/deps/v8/src/base/bounded-page-allocator.cc
@@ -116,9 +116,8 @@ bool BoundedPageAllocator::ReserveForSharedMemoryMapping(void* ptr,
     }
   }
 
-  CHECK(page_allocator_->SetPermissions(ptr, size,
-                                        PageAllocator::Permission::kNoAccess));
-  return true;
+  return page_allocator_->SetPermissions(ptr, size,
+                                         PageAllocator::Permission::kNoAccess);
 }
 
 bool BoundedPageAllocator::FreePages(void* raw_address, size_t size) {
@@ -131,19 +130,16 @@ bool BoundedPageAllocator::FreePages(void* raw_address, size_t size) {
     DCHECK_NE(page_freeing_mode_, PageFreeingMode::kDiscard);
     // When we are required to return zero-initialized pages, we decommit the
     // pages here, which will cause any wired pages to be removed by the OS.
-    CHECK(page_allocator_->DecommitPages(raw_address, size));
-  } else {
-    DCHECK_EQ(page_initialization_mode_,
-              PageInitializationMode::kAllocatedPagesCanBeUninitialized);
-    if (page_freeing_mode_ == PageFreeingMode::kMakeInaccessible) {
-      CHECK(page_allocator_->SetPermissions(raw_address, size,
-                                            PageAllocator::kNoAccess));
-    } else {
-      CHECK_EQ(page_freeing_mode_, PageFreeingMode::kDiscard);
-      CHECK(page_allocator_->DiscardSystemPages(raw_address, size));
-    }
+    return page_allocator_->DecommitPages(raw_address, size);
   }
-  return true;
+  DCHECK_EQ(page_initialization_mode_,
+            PageInitializationMode::kAllocatedPagesCanBeUninitialized);
+  if (page_freeing_mode_ == PageFreeingMode::kMakeInaccessible) {
+    return page_allocator_->SetPermissions(raw_address, size,
+                                           PageAllocator::kNoAccess);
+  }
+  CHECK_EQ(page_freeing_mode_, PageFreeingMode::kDiscard);
+  return page_allocator_->DiscardSystemPages(raw_address, size);
 }
 
 bool BoundedPageAllocator::ReleasePages(void* raw_address, size_t size,
@@ -180,19 +176,16 @@ bool BoundedPageAllocator::ReleasePages(void* raw_address, size_t size,
       PageInitializationMode::kAllocatedPagesMustBeZeroInitialized) {
     DCHECK_NE(page_freeing_mode_, PageFreeingMode::kDiscard);
     // See comment in FreePages().
-    CHECK(page_allocator_->DecommitPages(free_address, free_size));
-  } else {
-    DCHECK_EQ(page_initialization_mode_,
-              PageInitializationMode::kAllocatedPagesCanBeUninitialized);
-    if (page_freeing_mode_ == PageFreeingMode::kMakeInaccessible) {
-      CHECK(page_allocator_->SetPermissions(free_address, free_size,
-                                            PageAllocator::kNoAccess));
-    } else {
-      CHECK_EQ(page_freeing_mode_, PageFreeingMode::kDiscard);
-      CHECK(page_allocator_->DiscardSystemPages(free_address, free_size));
-    }
+    return (page_allocator_->DecommitPages(free_address, free_size));
   }
-  return true;
+  DCHECK_EQ(page_initialization_mode_,
+            PageInitializationMode::kAllocatedPagesCanBeUninitialized);
+  if (page_freeing_mode_ == PageFreeingMode::kMakeInaccessible) {
+    return page_allocator_->SetPermissions(free_address, free_size,
+                                           PageAllocator::kNoAccess);
+  }
+  CHECK_EQ(page_freeing_mode_, PageFreeingMode::kDiscard);
+  return page_allocator_->DiscardSystemPages(free_address, free_size);
 }
 
 bool BoundedPageAllocator::SetPermissions(void* address, size_t size,
diff --git a/deps/v8/src/base/container-utils.h b/deps/v8/src/base/container-utils.h
index bf6826d5a86b3c..b8a299ccca47dc 100644
--- a/deps/v8/src/base/container-utils.h
+++ b/deps/v8/src/base/container-utils.h
@@ -79,6 +79,24 @@ template <typename C, typename P>
 inline bool all_of(const C& container, const P& predicate) {
   return std::all_of(std::begin(container), std::end(container), predicate);
 }
+template <typename C>
+inline bool all_of(const C& container) {
+  return std::all_of(
+      std::begin(container), std::end(container),
+      [](const auto& value) { return static_cast<bool>(value); });
+}
+
+// Helper for std::any_of.
+template <typename C, typename P>
+inline bool any_of(const C& container, const P& predicate) {
+  return std::any_of(std::begin(container), std::end(container), predicate);
+}
+template <typename C>
+inline bool any_of(const C& container) {
+  return std::any_of(
+      std::begin(container), std::end(container),
+      [](const auto& value) { return static_cast<bool>(value); });
+}
 
 // Helper for std::none_of.
 template <typename C, typename P>
diff --git a/deps/v8/src/base/contextual.h b/deps/v8/src/base/contextual.h
index 7f575997da28b3..3b81c50d115dbe 100644
--- a/deps/v8/src/base/contextual.h
+++ b/deps/v8/src/base/contextual.h
@@ -71,16 +71,17 @@ class V8_EXPORT_PRIVATE ContextualVariable {
  private:
   inline static thread_local Scope* top_ = nullptr;
 
-  // If there is a linking error for `Top()`, then the contextual variable
-  // probably needs to be exported using EXPORT_CONTEXTUAL_VARIABLE.
 #if defined(USING_V8_SHARED)
-  // Hide the definition from other DLLs/libraries to avoid access to `top_`,
-  // since access to thread_local variables from other DLLs/libraries does not
-  // work correctly.
-  static Scope*& Top();
+  // Hide the access to `top_` from other DLLs/libraries, since access to
+  // thread_local variables from other DLLs/libraries does not work correctly.
+  static Scope*& Top() { return ExportedTop(); }
 #else
   static Scope*& Top() { return top_; }
 #endif
+  // Same as `Top()`, but non-inline and exported to DLLs/libraries.
+  // If there is a linking error for `ExportedTop()`, then the contextual
+  // variable probably needs to be exported using EXPORT_CONTEXTUAL_VARIABLE.
+  static Scope*& ExportedTop();
 };
 
 // Usage: DECLARE_CONTEXTUAL_VARIABLE(VarName, VarType)
@@ -90,13 +91,13 @@ class V8_EXPORT_PRIVATE ContextualVariable {
 // Contextual variables that are accessed in tests need to be
 // exported. For this, place the following macro in the global namespace inside
 // of a .cc file.
-#define EXPORT_CONTEXTUAL_VARIABLE(VarName)                    \
-  namespace v8::base {                                         \
-  template <>                                                  \
-  V8_EXPORT_PRIVATE typename VarName::Scope*&                  \
-  ContextualVariable<VarName, typename VarName::VarT>::Top() { \
-    return top_;                                               \
-  }                                                            \
+#define EXPORT_CONTEXTUAL_VARIABLE(VarName)                            \
+  namespace v8::base {                                                 \
+  template <>                                                          \
+  V8_EXPORT_PRIVATE typename VarName::Scope*&                          \
+  ContextualVariable<VarName, typename VarName::VarT>::ExportedTop() { \
+    return top_;                                                       \
+  }                                                                    \
   }
 
 // By inheriting from {ContextualClass} a class can become a contextual variable
diff --git a/deps/v8/src/base/cpu.cc b/deps/v8/src/base/cpu.cc
index fdef3c6695ae72..e63896bca53338 100644
--- a/deps/v8/src/base/cpu.cc
+++ b/deps/v8/src/base/cpu.cc
@@ -410,6 +410,7 @@ CPU::CPU()
       has_non_stop_time_stamp_counter_(false),
       is_running_in_vm_(false),
       has_msa_(false),
+      riscv_mmu_(RV_MMU_MODE::kRiscvSV48),
       has_rvv_(false) {
   memcpy(vendor_, "Unknown", 8);
 
@@ -868,6 +869,7 @@ CPU::CPU()
 #endif  // !USE_SIMULATOR
 
 #elif V8_HOST_ARCH_RISCV64
+#if V8_OS_LINUX
   CPUInfo cpu_info;
   char* features = cpu_info.ExtractField("isa");
 
@@ -878,6 +880,17 @@ CPU::CPU()
     has_fpu_ = true;
     has_rvv_ = true;
   }
+  char* mmu = cpu_info.ExtractField("mmu");
+  if (HasListItem(mmu, "sv48")) {
+    riscv_mmu_ = RV_MMU_MODE::kRiscvSV48;
+  }
+  if (HasListItem(mmu, "sv39")) {
+    riscv_mmu_ = RV_MMU_MODE::kRiscvSV39;
+  }
+  if (HasListItem(mmu, "sv57")) {
+    riscv_mmu_ = RV_MMU_MODE::kRiscvSV57;
+  }
+#endif
 #endif  // V8_HOST_ARCH_RISCV64
 }
 
diff --git a/deps/v8/src/base/cpu.h b/deps/v8/src/base/cpu.h
index ff22712625f446..a1537faa756a32 100644
--- a/deps/v8/src/base/cpu.h
+++ b/deps/v8/src/base/cpu.h
@@ -130,8 +130,14 @@ class V8_BASE_EXPORT CPU final {
   bool is_fp64_mode() const { return is_fp64_mode_; }
   bool has_msa() const { return has_msa_; }
 
-  // riscv features
+  // riscv-specific part codes
   bool has_rvv() const { return has_rvv_; }
+  enum class RV_MMU_MODE {
+    kRiscvSV39,
+    kRiscvSV48,
+    kRiscvSV57,
+  };
+  RV_MMU_MODE riscv_mmu() const { return riscv_mmu_; }
 
  private:
 #if defined(V8_OS_STARBOARD)
@@ -184,6 +190,7 @@ class V8_BASE_EXPORT CPU final {
   bool has_non_stop_time_stamp_counter_;
   bool is_running_in_vm_;
   bool has_msa_;
+  RV_MMU_MODE riscv_mmu_;
   bool has_rvv_;
 };
 
diff --git a/deps/v8/src/base/debug/stack_trace_posix.cc b/deps/v8/src/base/debug/stack_trace_posix.cc
index b76c098d8808ed..b4e6499a5ea4e2 100644
--- a/deps/v8/src/base/debug/stack_trace_posix.cc
+++ b/deps/v8/src/base/debug/stack_trace_posix.cc
@@ -341,7 +341,11 @@ bool EnableInProcessStackDumping() {
 
   struct sigaction action;
   memset(&action, 0, sizeof(action));
-  action.sa_flags = SA_RESETHAND | SA_SIGINFO;
+  // Use SA_ONSTACK so that iff an alternate stack has been registered, the
+  // handler will run on that stack instead of the default stack. This can be
+  // useful for example if the stack pointer gets corrupted or in case of stack
+  // overflows, since that might prevent the handler from running properly.
+  action.sa_flags = SA_RESETHAND | SA_SIGINFO | SA_ONSTACK;
   action.sa_sigaction = &StackDumpSignalHandler;
   sigemptyset(&action.sa_mask);
 
diff --git a/deps/v8/src/base/discriminated-union.h b/deps/v8/src/base/discriminated-union.h
new file mode 100644
index 00000000000000..a1c1a01e4d744c
--- /dev/null
+++ b/deps/v8/src/base/discriminated-union.h
@@ -0,0 +1,120 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_BASE_DISCRIMINATED_UNION_H_
+#define V8_BASE_DISCRIMINATED_UNION_H_
+
+#include <type_traits>
+#include <utility>
+
+#include "src/base/compiler-specific.h"
+#include "src/base/template-utils.h"
+
+namespace v8 {
+namespace base {
+
+// A variant-like discriminated union type, which takes a discriminating enum
+// and a set of types. The enum must have as many elements as the number of
+// types, with each enum value corresponding to one type in the set.
+//
+// Example usage:
+//
+//     enum class FooType {
+//       kBar,
+//       kBaz
+//     }
+//     class Bar { ... };
+//     class Baz { ... };
+//
+//     // FooType::kBar and FooType::kBaz match Bar and Baz, respectively.
+//     DiscriminatedUnion<FooType, Bar, Baz> union;
+//
+//     switch (union.tag()) {
+//       case FooType::kBar:
+//         return process_bar(union.get<FooType::kBar>);
+//       case FooType::kBaz:
+//         return process_baz(union.get<FooType::kBaz>);
+//     }
+template <typename TagEnum, typename... Ts>
+class DiscriminatedUnion {
+ public:
+  // All Ts must be trivially destructible to avoid DiscriminatedUnion needing a
+  // destructor.
+  static_assert((std::is_trivially_destructible_v<Ts> && ...));
+
+  using Tag = TagEnum;
+
+  DiscriminatedUnion(DiscriminatedUnion&& other) V8_NOEXCEPT = default;
+  DiscriminatedUnion(const DiscriminatedUnion& other) V8_NOEXCEPT = default;
+  DiscriminatedUnion& operator=(DiscriminatedUnion&& other)
+      V8_NOEXCEPT = default;
+  DiscriminatedUnion& operator=(const DiscriminatedUnion& other)
+      V8_NOEXCEPT = default;
+
+  // TODO(leszeks): Add in-place constructor.
+
+  // Construct with known tag and type (the tag is DCHECKed).
+  template <typename T>
+  constexpr explicit DiscriminatedUnion(Tag tag, T&& data) V8_NOEXCEPT {
+    constexpr size_t index = index_of_type_v<std::decay_t<T>, Ts...>;
+    static_assert(index < sizeof...(Ts));
+    static_assert(index < std::numeric_limits<uint8_t>::max());
+    // TODO(leszeks): Support unions with repeated types.
+    DCHECK_EQ(tag, static_cast<Tag>(index));
+    tag_ = static_cast<uint8_t>(index);
+    new (&data_) T(std::forward<T>(data));
+  }
+
+  // Construct with known type.
+  template <typename T>
+  constexpr explicit DiscriminatedUnion(T&& data) V8_NOEXCEPT {
+    constexpr size_t index = index_of_type_v<std::decay_t<T>, Ts...>;
+    static_assert(index < sizeof...(Ts));
+    static_assert(index < std::numeric_limits<uint8_t>::max());
+    tag_ = static_cast<uint8_t>(index);
+    new (&data_) T(std::forward<T>(data));
+  }
+
+  constexpr Tag tag() const { return static_cast<Tag>(tag_); }
+
+  // Get union member by tag.
+  template <Tag tag>
+  constexpr const auto& get() const {
+    using T = nth_type_t<static_cast<size_t>(tag), Ts...>;
+    DCHECK_EQ(tag, this->tag());
+    return reinterpret_cast<const T&>(data_);
+  }
+
+  // Get union member by tag.
+  template <Tag tag>
+  constexpr auto& get() {
+    using T = nth_type_t<static_cast<size_t>(tag), Ts...>;
+    DCHECK_EQ(tag, this->tag());
+    return reinterpret_cast<T&>(data_);
+  }
+
+  // Get union member by type.
+  template <typename T>
+  constexpr const auto& get() const {
+    DCHECK_EQ(static_cast<Tag>(index_of_type_v<T, Ts...>), this->tag());
+    return reinterpret_cast<const T&>(data_);
+  }
+
+  // Get union member by type.
+  template <typename T>
+  constexpr auto& get() {
+    DCHECK_EQ(static_cast<Tag>(index_of_type_v<T, Ts...>), this->tag());
+    return reinterpret_cast<T&>(data_);
+  }
+
+ private:
+  alignas(std::max({alignof(Ts)...})) char data_[std::max({sizeof(Ts)...})];
+  static_assert(sizeof...(Ts) <= std::numeric_limits<uint8_t>::max());
+  uint8_t tag_;
+};
+
+}  // namespace base
+}  // namespace v8
+
+#endif  // V8_BASE_DISCRIMINATED_UNION_H_
diff --git a/deps/v8/src/base/enum-set.h b/deps/v8/src/base/enum-set.h
index ce49b3996ed52a..48b5dfabfd42f4 100644
--- a/deps/v8/src/base/enum-set.h
+++ b/deps/v8/src/base/enum-set.h
@@ -5,8 +5,10 @@
 #ifndef V8_BASE_ENUM_SET_H_
 #define V8_BASE_ENUM_SET_H_
 
+#include <ostream>
 #include <type_traits>
 
+#include "src/base/bits.h"
 #include "src/base/logging.h"
 
 namespace v8 {
@@ -21,7 +23,7 @@ class EnumSet {
  public:
   constexpr EnumSet() = default;
 
-  explicit constexpr EnumSet(std::initializer_list<E> init) {
+  constexpr EnumSet(std::initializer_list<E> init) {
     T bits = 0;
     for (E e : init) bits |= Mask(e);
     bits_ = bits;
@@ -34,6 +36,12 @@ class EnumSet {
   constexpr bool contains_any(EnumSet set) const {
     return (bits_ & set.bits_) != 0;
   }
+  constexpr bool contains_only(E element) const {
+    return bits_ == Mask(element);
+  }
+  constexpr bool is_subset_of(EnumSet set) const {
+    return (bits_ & set.bits_) == bits_;
+  }
   void Add(E element) { bits_ |= Mask(element); }
   void Add(EnumSet set) { bits_ |= set.bits_; }
   void Remove(E element) { bits_ &= ~Mask(element); }
@@ -86,6 +94,23 @@ class EnumSet {
   T bits_ = 0;
 };
 
+template <typename E, typename T>
+std::ostream& operator<<(std::ostream& os, EnumSet<E, T> set) {
+  os << "{";
+  bool first = true;
+  while (!set.empty()) {
+    if (!first) os << ", ";
+    first = false;
+
+    T bits = set.ToIntegral();
+    E element = static_cast<E>(bits::CountTrailingZerosNonZero(bits));
+    os << element;
+    set.Remove(element);
+  }
+  os << "}";
+  return os;
+}
+
 }  // namespace base
 }  // namespace v8
 
diff --git a/deps/v8/src/base/flags.h b/deps/v8/src/base/flags.h
index 2a36ca77e82d40..ab36d617cfc182 100644
--- a/deps/v8/src/base/flags.h
+++ b/deps/v8/src/base/flags.h
@@ -13,30 +13,32 @@ namespace v8 {
 namespace base {
 
 // The Flags class provides a type-safe way of storing OR-combinations of enum
-// values. The Flags<T, S> class is a template class, where T is an enum type,
-// and S is the underlying storage type (usually int).
+// values.
 //
 // The traditional C++ approach for storing OR-combinations of enum values is to
 // use an int or unsigned int variable. The inconvenience with this approach is
 // that there's no type checking at all; any enum value can be OR'd with any
 // other enum value and passed on to a function that takes an int or unsigned
 // int.
-template <typename T, typename S = int>
+template <typename EnumT, typename BitfieldT = int,
+          typename BitfieldStorageT = BitfieldT>
 class Flags final {
  public:
-  using flag_type = T;
-  using mask_type = S;
+  static_assert(sizeof(BitfieldStorageT) >= sizeof(BitfieldT));
+  using flag_type = EnumT;
+  using mask_type = BitfieldT;
 
   constexpr Flags() : mask_(0) {}
   constexpr Flags(flag_type flag)  // NOLINT(runtime/explicit)
-      : mask_(static_cast<S>(flag)) {}
-  constexpr explicit Flags(mask_type mask) : mask_(static_cast<S>(mask)) {}
+      : mask_(static_cast<mask_type>(flag)) {}
+  constexpr explicit Flags(mask_type mask)
+      : mask_(static_cast<mask_type>(mask)) {}
 
   constexpr bool operator==(flag_type flag) const {
-    return mask_ == static_cast<S>(flag);
+    return mask_ == static_cast<mask_type>(flag);
   }
   constexpr bool operator!=(flag_type flag) const {
-    return mask_ != static_cast<S>(flag);
+    return mask_ != static_cast<mask_type>(flag);
   }
 
   Flags& operator&=(const Flags& flags) {
@@ -66,6 +68,12 @@ class Flags final {
   Flags& operator|=(flag_type flag) { return operator|=(Flags(flag)); }
   Flags& operator^=(flag_type flag) { return operator^=(Flags(flag)); }
 
+  // Sets or clears given flag.
+  Flags& set(flag_type flag, bool value) {
+    if (value) return operator|=(Flags(flag));
+    return operator&=(~Flags(flag));
+  }
+
   constexpr Flags operator&(flag_type flag) const {
     return operator&(Flags(flag));
   }
@@ -86,7 +94,7 @@ class Flags final {
   friend size_t hash_value(const Flags& flags) { return flags.mask_; }
 
  private:
-  mask_type mask_;
+  BitfieldStorageT mask_;
 };
 
 #define DEFINE_OPERATORS_FOR_FLAGS(Type)                                 \
diff --git a/deps/v8/src/base/hashmap.h b/deps/v8/src/base/hashmap.h
index 7130d623aa0598..b9d2d6a8f87a4b 100644
--- a/deps/v8/src/base/hashmap.h
+++ b/deps/v8/src/base/hashmap.h
@@ -22,7 +22,7 @@ namespace base {
 class DefaultAllocationPolicy {
  public:
   template <typename T, typename TypeTag = T[]>
-  V8_INLINE T* NewArray(size_t length) {
+  V8_INLINE T* AllocateArray(size_t length) {
     return static_cast<T*>(base::Malloc(length * sizeof(T)));
   }
   template <typename T, typename TypeTag = T[]>
@@ -197,7 +197,7 @@ TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::
     : impl_(original->impl_.match(), std::move(allocator)) {
   impl_.capacity_ = original->capacity();
   impl_.occupancy_ = original->occupancy();
-  impl_.map_ = impl_.allocator().template NewArray<Entry>(capacity());
+  impl_.map_ = impl_.allocator().template AllocateArray<Entry>(capacity());
   memcpy(impl_.map_, original->impl_.map_, capacity() * sizeof(Entry));
 }
 
@@ -398,7 +398,7 @@ template <typename Key, typename Value, typename MatchFun,
 void TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Initialize(
     uint32_t capacity) {
   DCHECK(base::bits::IsPowerOfTwo(capacity));
-  impl_.map_ = impl_.allocator().template NewArray<Entry>(capacity);
+  impl_.map_ = impl_.allocator().template AllocateArray<Entry>(capacity);
   if (impl_.map_ == nullptr) {
     FATAL("Out of memory: HashMap::Initialize");
     return;
diff --git a/deps/v8/src/base/intrusive-set.h b/deps/v8/src/base/intrusive-set.h
new file mode 100644
index 00000000000000..360cac3a35dd3e
--- /dev/null
+++ b/deps/v8/src/base/intrusive-set.h
@@ -0,0 +1,127 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_BASE_INTRUSIVE_SET_H_
+#define V8_BASE_INTRUSIVE_SET_H_
+
+#include <iterator>
+#include <limits>
+#include <type_traits>
+
+#include "src/base/logging.h"
+#include "src/base/optional.h"
+
+namespace v8::base {
+
+class IntrusiveSetIndex {
+ private:
+  template <class T, class GetIntrusiveSetIndex, class Container>
+  friend class IntrusiveSet;
+  static constexpr size_t kNotInSet = std::numeric_limits<size_t>::max();
+
+  size_t value = kNotInSet;
+};
+
+// A set of pointer-like values (`T`) that point to memory containing the
+// position inside of the set (`IntrusiveSetIndex`), to allow for O(1) insertion
+// and removal without using a hash table. This set is intrusive in the sense
+// that elements need to know their position inside of the set by storing an
+// `IntrusiveSetIndex` somewhere. In particular, all copies of a `T` value
+// should point to the same `IntrusiveSetIndex` instance. `GetIntrusiveSetIndex`
+// has to be a functor that produces `IntrusiveSetIndex&` given a `T`. The
+// reference has to remain valid and refer to the same memory location while the
+// element is in the set and until we finish iterating over the data structure
+// if the element is removed during iteration.
+//
+// Add(T):     amortized O(1)
+// Contain(T): O(1)
+// Remove(T):  O(1)
+template <class T, class GetIntrusiveSetIndex, class Container>
+class IntrusiveSet {
+ public:
+  // This is not needed for soundness, but rather serves as a hint that `T`
+  // should be a lightweight pointer-like value.
+  static_assert(std::is_trivially_copyable_v<T>);
+
+  explicit IntrusiveSet(Container container,
+                        GetIntrusiveSetIndex index_functor = {})
+      : elements_(std::move(container)), index_functor_(index_functor) {
+    static_assert(std::is_same_v<decltype(index_functor(std::declval<T>())),
+                                 IntrusiveSetIndex&>);
+  }
+
+  bool Contains(T x) const { return Index(x) != IntrusiveSetIndex::kNotInSet; }
+
+  // Adding elements while iterating is allowed.
+  void Add(T x) {
+    DCHECK(!Contains(x));
+    Index(x) = elements_.size();
+    elements_.push_back(x);
+  }
+
+  // Removing while iterating is allowed under very specific circumstances. See
+  // comment on `IntrusiveSet::iterator`.
+  void Remove(T x) {
+    DCHECK(Contains(x));
+    size_t& index = Index(x);
+    DCHECK_EQ(x, elements_[index]);
+    Index(elements_.back()) = index;
+    elements_[index] = elements_.back();
+    index = IntrusiveSetIndex::kNotInSet;
+    elements_.pop_back();
+  }
+
+  // Since C++17, it is possible to have a sentinel end-iterator that is not an
+  // iterator itself.
+  class end_iterator {};
+
+  // This iterator supports insertion (newly inserted elements will be visited
+  // as part of the iteration) and removal of the current element while
+  // iterating. Removing previously visited elements is undefined behavior.
+  // ATTENTION! The memory the removed element points to needs to remain alive
+  // until the end of the iteration.
+  class iterator {
+   public:
+    explicit iterator(const IntrusiveSet& set) : set_(set) {}
+    T operator*() {
+      T result = set_.elements_[index_];
+      last_index_location_ = &set_.Index(result);
+      return result;
+    }
+    iterator& operator++() {
+      // This iterator requires `operator*` being used before `operator++`.
+      DCHECK_NOT_NULL(last_index_location_);
+      if (index_ < set_.elements_.size() &&
+          last_index_location_ == &set_.Index(set_.elements_[index_])) {
+        index_++;
+      }
+      return *this;
+    }
+    bool operator!=(end_iterator) const {
+      return index_ < set_.elements_.size();
+    }
+
+   private:
+    const IntrusiveSet& set_;
+    size_t index_ = 0;
+    // If the current element is removed, another element is swapped in to the
+    // same position. We notice this by remembering the index memory location of
+    // the last retrieved element.
+    const size_t* last_index_location_ = nullptr;
+  };
+
+  // These iterators are only intended for range-based for loops.
+  iterator begin() const { return iterator{*this}; }
+  end_iterator end() const { return end_iterator{}; }
+
+ private:
+  Container elements_;
+  GetIntrusiveSetIndex index_functor_;
+
+  size_t& Index(T x) const { return index_functor_(x).value; }
+};
+
+}  // namespace v8::base
+
+#endif  // V8_BASE_INTRUSIVE_SET_H_
diff --git a/deps/v8/src/base/iterator.h b/deps/v8/src/base/iterator.h
index d0dff1333081ac..b10240649b79c3 100644
--- a/deps/v8/src/base/iterator.h
+++ b/deps/v8/src/base/iterator.h
@@ -93,7 +93,7 @@ struct DerefPtrIterator : base::iterator<std::bidirectional_iterator_tag, T> {
 // The signature avoids binding to temporaries (T&& / const T&) on purpose. The
 // lifetime of a temporary would not extend to a range-based for loop using it.
 template <typename T>
-auto Reversed(T& t) {  // NOLINT(runtime/references): match {rbegin} and {rend}
+auto Reversed(T& t) {
   return make_iterator_range(std::rbegin(t), std::rend(t));
 }
 
@@ -105,6 +105,31 @@ auto Reversed(const iterator_range<T>& t) {
   return make_iterator_range(std::rbegin(t), std::rend(t));
 }
 
+// {IterateWithoutLast} returns a container adapter usable in a range-based
+// "for" statement for iterating all elements without the last in a forward
+// order. It performs a check whether the container is empty.
+//
+// Example:
+//
+//   std::vector<int> v = ...;
+//   for (int i : base::IterateWithoutLast(v)) {
+//     // iterates through v front to --back
+//   }
+//
+// The signature avoids binding to temporaries, see the remark in {Reversed}.
+template <typename T>
+auto IterateWithoutLast(T& t) {
+  DCHECK_NE(std::begin(t), std::end(t));
+  auto new_end = std::end(t);
+  return make_iterator_range(std::begin(t), --new_end);
+}
+
+template <typename T>
+auto IterateWithoutLast(const iterator_range<T>& t) {
+  iterator_range<T> range_copy = {t.begin(), t.end()};
+  return IterateWithoutLast(range_copy);
+}
+
 }  // namespace base
 }  // namespace v8
 
diff --git a/deps/v8/src/base/logging.h b/deps/v8/src/base/logging.h
index e333aefd0cadaf..4c129abd985b99 100644
--- a/deps/v8/src/base/logging.h
+++ b/deps/v8/src/base/logging.h
@@ -26,9 +26,16 @@ V8_BASE_EXPORT V8_NOINLINE void V8_Dcheck(const char* file, int line,
     void V8_Fatal(const char* file, int line, const char* format, ...);
 #define FATAL(...) V8_Fatal(__FILE__, __LINE__, __VA_ARGS__)
 
+// The following can be used instead of FATAL() to prevent calling
+// IMMEDIATE_CRASH in official mode. Please only use if needed for testing.
+// See v8:13945
+#define GRACEFUL_FATAL(...) FATAL(__VA_ARGS__)
+
 #else
 [[noreturn]] PRINTF_FORMAT(1, 2) V8_BASE_EXPORT V8_NOINLINE
     void V8_Fatal(const char* format, ...);
+#define GRACEFUL_FATAL(...) V8_Fatal(__VA_ARGS__)
+
 #if !defined(OFFICIAL_BUILD)
 // In non-official release, include full error message, but drop file & line
 // numbers. It saves binary size to drop the |file| & |line| as opposed to just
diff --git a/deps/v8/src/base/macros.h b/deps/v8/src/base/macros.h
index c267b8f1e9f305..92d9af5a090b0b 100644
--- a/deps/v8/src/base/macros.h
+++ b/deps/v8/src/base/macros.h
@@ -22,12 +22,7 @@
 // Creates an unique identifier. Useful for scopes to avoid shadowing names.
 #define UNIQUE_IDENTIFIER(base) CONCAT(base, __COUNTER__)
 
-// TODO(all) Replace all uses of this macro with C++'s offsetof. To do that, we
-// have to make sure that only standard-layout types and simple field
-// designators are used.
-#define OFFSET_OF(type, field) \
-  (reinterpret_cast<intptr_t>(&(reinterpret_cast<type*>(16)->field)) - 16)
-
+#define OFFSET_OF(type, field) offsetof(type, field)
 
 // The arraysize(arr) macro returns the # of elements in an array arr.
 // The expression is a compile-time constant, and therefore can be
@@ -179,14 +174,18 @@ V8_INLINE Dest bit_cast(Source const& source) {
 #define DISABLE_CFI_PERF V8_CLANG_NO_SANITIZE("cfi")
 
 // DISABLE_CFI_ICALL -- Disable Control Flow Integrity indirect call checks,
-// useful because calls into JITed code can not be CFI verified.
+// useful because calls into JITed code can not be CFI verified. Same for
+// UBSan's function pointer type checks.
 #ifdef V8_OS_WIN
 // On Windows, also needs __declspec(guard(nocf)) for CFG.
 #define DISABLE_CFI_ICALL           \
   V8_CLANG_NO_SANITIZE("cfi-icall") \
+  V8_CLANG_NO_SANITIZE("function")  \
   __declspec(guard(nocf))
 #else
-#define DISABLE_CFI_ICALL V8_CLANG_NO_SANITIZE("cfi-icall")
+#define DISABLE_CFI_ICALL           \
+  V8_CLANG_NO_SANITIZE("cfi-icall") \
+  V8_CLANG_NO_SANITIZE("function")
 #endif
 
 namespace v8 {
@@ -239,7 +238,7 @@ struct is_trivially_copyable {
 // The arguments are guaranteed to be evaluated from left to right.
 struct Use {
   template <typename T>
-  Use(T&&) {}  // NOLINT(runtime/explicit)
+  constexpr Use(T&&) {}  // NOLINT(runtime/explicit)
 };
 #define USE(...)                                                   \
   do {                                                             \
@@ -388,6 +387,7 @@ bool is_inbounds(float_t v) {
 #ifdef V8_OS_WIN
 
 // Setup for Windows shared library export.
+#define V8_EXPORT_ENUM
 #ifdef BUILDING_V8_SHARED
 #define V8_EXPORT_PRIVATE
 #elif USING_V8_SHARED
@@ -402,11 +402,14 @@ bool is_inbounds(float_t v) {
 #if V8_HAS_ATTRIBUTE_VISIBILITY
 #ifdef BUILDING_V8_SHARED
 #define V8_EXPORT_PRIVATE
+#define V8_EXPORT_ENUM
 #else
 #define V8_EXPORT_PRIVATE
+#define V8_EXPORT_ENUM
 #endif
 #else
 #define V8_EXPORT_PRIVATE
+#define V8_EXPORT_ENUM
 #endif
 
 #endif  // V8_OS_WIN
diff --git a/deps/v8/src/base/memory.h b/deps/v8/src/base/memory.h
index e2676a82e77a0f..3441dddd252208 100644
--- a/deps/v8/src/base/memory.h
+++ b/deps/v8/src/base/memory.h
@@ -11,7 +11,6 @@ namespace v8 {
 namespace base {
 
 using Address = uintptr_t;
-using byte = uint8_t;
 
 // Memory provides an interface to 'raw' memory. It encapsulates the casts
 // that typically are needed when incompatible pointer types are used.
@@ -23,7 +22,7 @@ inline T& Memory(Address addr) {
   return *reinterpret_cast<T*>(addr);
 }
 template <class T>
-inline T& Memory(byte* addr) {
+inline T& Memory(uint8_t* addr) {
   return Memory<T>(reinterpret_cast<Address>(addr));
 }
 
@@ -47,8 +46,8 @@ static inline V ReadLittleEndianValue(Address p) {
   return ReadUnalignedValue<V>(p);
 #elif defined(V8_TARGET_BIG_ENDIAN)
   V ret{};
-  const byte* src = reinterpret_cast<const byte*>(p);
-  byte* dst = reinterpret_cast<byte*>(&ret);
+  const uint8_t* src = reinterpret_cast<const uint8_t*>(p);
+  uint8_t* dst = reinterpret_cast<uint8_t*>(&ret);
   for (size_t i = 0; i < sizeof(V); i++) {
     dst[i] = src[sizeof(V) - i - 1];
   }
@@ -61,8 +60,8 @@ static inline void WriteLittleEndianValue(Address p, V value) {
 #if defined(V8_TARGET_LITTLE_ENDIAN)
   WriteUnalignedValue<V>(p, value);
 #elif defined(V8_TARGET_BIG_ENDIAN)
-  byte* src = reinterpret_cast<byte*>(&value);
-  byte* dst = reinterpret_cast<byte*>(p);
+  uint8_t* src = reinterpret_cast<uint8_t*>(&value);
+  uint8_t* dst = reinterpret_cast<uint8_t*>(p);
   for (size_t i = 0; i < sizeof(V); i++) {
     dst[i] = src[sizeof(V) - i - 1];
   }
diff --git a/deps/v8/src/base/platform/OWNERS b/deps/v8/src/base/platform/OWNERS
index 9e6d7833510167..9cd6bebc879472 100644
--- a/deps/v8/src/base/platform/OWNERS
+++ b/deps/v8/src/base/platform/OWNERS
@@ -2,4 +2,5 @@ hpayer@chromium.org
 mlippautz@chromium.org
 victorgomes@chromium.org
 
+per-file memory-protection-key.*=sroettger@google.com
 per-file platform-fuchsia.cc=wez@chromium.org
diff --git a/deps/v8/src/base/platform/elapsed-timer.h b/deps/v8/src/base/platform/elapsed-timer.h
index c5ac56043dea25..f1ad5c932e10e4 100644
--- a/deps/v8/src/base/platform/elapsed-timer.h
+++ b/deps/v8/src/base/platform/elapsed-timer.h
@@ -153,6 +153,24 @@ class ElapsedTimer final {
 #endif
 };
 
+// Helper that times a scoped region and records the elapsed time.
+struct ScopedTimer {
+  explicit ScopedTimer(TimeDelta* location) : location_(location) {
+    if (location_) {
+      timer_.Start();
+    }
+  }
+
+  ~ScopedTimer() {
+    if (location_) {
+      *location_ += timer_.Elapsed();
+    }
+  }
+
+  ElapsedTimer timer_;
+  TimeDelta* location_;
+};
+
 }  // namespace base
 }  // namespace v8
 
diff --git a/deps/v8/src/base/platform/memory-protection-key.cc b/deps/v8/src/base/platform/memory-protection-key.cc
index d014556e945e7a..ac5eee89afd860 100644
--- a/deps/v8/src/base/platform/memory-protection-key.cc
+++ b/deps/v8/src/base/platform/memory-protection-key.cc
@@ -5,169 +5,60 @@
 #include "src/base/platform/memory-protection-key.h"
 
 #if V8_HAS_PKU_JIT_WRITE_PROTECT
-#include <sys/mman.h>     // For {mprotect()} protection macros.
-#include <sys/utsname.h>  // For {uname()}.
+
+#include <sys/mman.h>  // For {mprotect()} protection macros.
 #undef MAP_TYPE  // Conflicts with MAP_TYPE in Torque-generated instance-types.h
-#endif
 
 #include "src/base/logging.h"
 #include "src/base/macros.h"
 
-// Runtime-detection of PKU support with {dlsym()}.
-//
-// For now, we support memory protection keys/PKEYs/PKU only for Linux on x64
-// based on glibc functions {pkey_alloc()}, {pkey_free()}, etc.
-// Those functions are only available since glibc version 2.27:
-// https://man7.org/linux/man-pages/man2/pkey_alloc.2.html
-// However, if we check the glibc verison with V8_GLIBC_PREPREQ here at compile
-// time, this causes two problems due to dynamic linking of glibc:
-// 1) If the compiling system _has_ a new enough glibc, the binary will include
-// calls to {pkey_alloc()} etc., and then the runtime system must supply a
-// new enough glibc version as well. That is, this potentially breaks runtime
-// compatability on older systems (e.g., Ubuntu 16.04 with glibc 2.23).
-// 2) If the compiling system _does not_ have a new enough glibc, PKU support
-// will not be compiled in, even though the runtime system potentially _does_
-// have support for it due to a new enough Linux kernel and glibc version.
-// That is, this results in non-optimal security (PKU available, but not used).
-// Hence, we do _not_ check the glibc version during compilation, and instead
-// only at runtime try to load {pkey_alloc()} etc. with {dlsym()}.
-// TODO(dlehmann): Move this import and freestanding functions below to
-// base/platform/platform.h {OS} (lower-level functions) and
-// {base::PageAllocator} (exported API).
-#if V8_HAS_PKU_JIT_WRITE_PROTECT
-#include <dlfcn.h>
-#endif
+// Declare all the pkey functions as weak to support older glibc versions where
+// they don't exist yet.
+int pkey_mprotect(void* addr, size_t len, int prot, int pkey) V8_WEAK;
+int pkey_get(int key) V8_WEAK;
+int pkey_set(int, unsigned) V8_WEAK;
 
 namespace v8 {
 namespace base {
 
 namespace {
-using pkey_alloc_t = int (*)(unsigned, unsigned);
-using pkey_free_t = int (*)(int);
-using pkey_mprotect_t = int (*)(void*, size_t, int, int);
-using pkey_get_t = int (*)(int);
-using pkey_set_t = int (*)(int, unsigned);
-
-pkey_alloc_t pkey_alloc = nullptr;
-pkey_free_t pkey_free = nullptr;
-pkey_mprotect_t pkey_mprotect = nullptr;
-pkey_get_t pkey_get = nullptr;
-pkey_set_t pkey_set = nullptr;
 
 #if DEBUG
 bool pkey_api_initialized = false;
 #endif
 
 int GetProtectionFromMemoryPermission(PageAllocator::Permission permission) {
-#if V8_HAS_PKU_JIT_WRITE_PROTECT
   // Mappings for PKU are either RWX (for code), no access (for uncommitted
-  // memory), or RW (for assembler buffers).
+  // memory), or RO for globals.
   switch (permission) {
     case PageAllocator::kNoAccess:
       return PROT_NONE;
-    case PageAllocator::kReadWrite:
-      return PROT_READ | PROT_WRITE;
+    case PageAllocator::kRead:
+      return PROT_READ;
     case PageAllocator::kReadWriteExecute:
       return PROT_READ | PROT_WRITE | PROT_EXEC;
     default:
       UNREACHABLE();
   }
-#endif
-  // Other platforms do not use PKU.
-  UNREACHABLE();
 }
 
 }  // namespace
 
-void MemoryProtectionKey::InitializeMemoryProtectionKeySupport() {
+bool MemoryProtectionKey::InitializeMemoryProtectionKeySupport() {
   // Flip {pkey_api_initialized} (in debug mode) and check the new value.
   DCHECK_EQ(true, pkey_api_initialized = !pkey_api_initialized);
-#if V8_HAS_PKU_JIT_WRITE_PROTECT
-  // PKU was broken on Linux kernels before 5.13 (see
-  // https://lore.kernel.org/all/20210623121456.399107624@linutronix.de/).
-  // A fix is also included in the 5.4.182 and 5.10.103 versions ("x86/fpu:
-  // Correct pkru/xstate inconsistency" by Brian Geffon <bgeffon@google.com>).
-  // Thus check the kernel version we are running on, and bail out if does not
-  // contain the fix.
-  struct utsname uname_buffer;
-  CHECK_EQ(0, uname(&uname_buffer));
-  int kernel, major, minor;
-  // Conservatively return if the release does not match the format we expect.
-  if (sscanf(uname_buffer.release, "%d.%d.%d", &kernel, &major, &minor) != 3) {
-    return;
-  }
-  bool kernel_has_pkru_fix =
-      kernel > 5 || (kernel == 5 && major >= 13) ||   // anything >= 5.13
-      (kernel == 5 && major == 4 && minor >= 182) ||  // 5.4 >= 5.4.182
-      (kernel == 5 && major == 10 && minor >= 103);   // 5.10 >= 5.10.103
-  if (!kernel_has_pkru_fix) return;
-
-  // Try to find the pkey functions in glibc.
-  void* pkey_alloc_ptr = dlsym(RTLD_DEFAULT, "pkey_alloc");
-  if (!pkey_alloc_ptr) return;
-
-  // If {pkey_alloc} is available, the others must also be available.
-  void* pkey_free_ptr = dlsym(RTLD_DEFAULT, "pkey_free");
-  void* pkey_mprotect_ptr = dlsym(RTLD_DEFAULT, "pkey_mprotect");
-  void* pkey_get_ptr = dlsym(RTLD_DEFAULT, "pkey_get");
-  void* pkey_set_ptr = dlsym(RTLD_DEFAULT, "pkey_set");
-  CHECK(pkey_free_ptr && pkey_mprotect_ptr && pkey_get_ptr && pkey_set_ptr);
-
-  pkey_alloc = reinterpret_cast<pkey_alloc_t>(pkey_alloc_ptr);
-  pkey_free = reinterpret_cast<pkey_free_t>(pkey_free_ptr);
-  pkey_mprotect = reinterpret_cast<pkey_mprotect_t>(pkey_mprotect_ptr);
-  pkey_get = reinterpret_cast<pkey_get_t>(pkey_get_ptr);
-  pkey_set = reinterpret_cast<pkey_set_t>(pkey_set_ptr);
-#endif
-}
 
-// TODO(dlehmann) Security: Are there alternatives to disabling CFI altogether
-// for the functions below? Since they are essentially an arbitrary indirect
-// call gadget, disabling CFI should be only a last resort. In Chromium, there
-// was {base::ProtectedMemory} to protect the function pointer from being
-// overwritten, but t seems it was removed to not begin used and AFAICT no such
-// thing exists in V8 to begin with. See
-// https://www.chromium.org/developers/testing/control-flow-integrity and
-// https://crrev.com/c/1884819.
-// What is the general solution for CFI + {dlsym()}?
-// An alternative would be to not rely on glibc and instead implement PKEY
-// directly on top of Linux syscalls + inline asm, but that is quite some low-
-// level code (probably in the order of 100 lines).
-// static
-DISABLE_CFI_ICALL
-int MemoryProtectionKey::AllocateKey() {
-  DCHECK(pkey_api_initialized);
-  if (!pkey_alloc) return kNoMemoryProtectionKey;
-
-  // If there is support in glibc, try to allocate a new key.
-  // This might still return -1, e.g., because the kernel does not support
-  // PKU or because there is no more key available.
-  // Different reasons for why {pkey_alloc()} failed could be checked with
-  // errno, e.g., EINVAL vs ENOSPC vs ENOSYS. See manpages and glibc manual
-  // (the latter is the authorative source):
-  // https://www.gnu.org/software/libc/manual/html_mono/libc.html#Memory-Protection-Keys
-  static_assert(kNoMemoryProtectionKey == -1);
-  return pkey_alloc(/* flags, unused */ 0, kDisableAccess);
-}
-
-// static
-DISABLE_CFI_ICALL
-void MemoryProtectionKey::FreeKey(int key) {
-  DCHECK(pkey_api_initialized);
-  // Only free the key if one was allocated.
-  if (key == kNoMemoryProtectionKey) return;
+  if (!pkey_mprotect) return false;
+  // If {pkey_mprotect} is available, the others must also be available.
+  CHECK(pkey_get && pkey_set);
 
-  // On platforms without PKU support, we should have already returned because
-  // the key must be {kNoMemoryProtectionKey}.
-  DCHECK_NOT_NULL(pkey_free);
-  CHECK_EQ(/* success */ 0, pkey_free(key));
+  return true;
 }
 
 // static
-DISABLE_CFI_ICALL
 bool MemoryProtectionKey::SetPermissionsAndKey(
-    v8::PageAllocator* page_allocator, base::AddressRegion region,
-    v8::PageAllocator::Permission page_permissions, int key) {
+    base::AddressRegion region, v8::PageAllocator::Permission page_permissions,
+    int key) {
   DCHECK(pkey_api_initialized);
   DCHECK_NE(key, kNoMemoryProtectionKey);
   CHECK_NOT_NULL(pkey_mprotect);
@@ -175,29 +66,12 @@ bool MemoryProtectionKey::SetPermissionsAndKey(
   void* address = reinterpret_cast<void*>(region.begin());
   size_t size = region.size();
 
-  // Copied with slight modifications from base/platform/platform-posix.cc
-  // {OS::SetPermissions()}.
-  // TODO(dlehmann): Move this block into its own function at the right
-  // abstraction boundary (likely some static method in platform.h {OS})
-  // once the whole PKU code is moved into base/platform/.
-  DCHECK_EQ(0, region.begin() % page_allocator->CommitPageSize());
-  DCHECK_EQ(0, size % page_allocator->CommitPageSize());
-
   int protection = GetProtectionFromMemoryPermission(page_permissions);
 
-  int ret = pkey_mprotect(address, size, protection, key);
-
-  if (ret == 0 && page_permissions == PageAllocator::kNoAccess) {
-    // Similar to {OS::SetPermissions}, also discard the pages after switching
-    // to no access. This is advisory; ignore errors and continue execution.
-    USE(page_allocator->DiscardSystemPages(address, size));
-  }
-
-  return ret == /* success */ 0;
+  return pkey_mprotect(address, size, protection, key) == 0;
 }
 
 // static
-DISABLE_CFI_ICALL
 void MemoryProtectionKey::SetPermissionsForKey(int key,
                                                Permission permissions) {
   DCHECK(pkey_api_initialized);
@@ -210,7 +84,6 @@ void MemoryProtectionKey::SetPermissionsForKey(int key,
 }
 
 // static
-DISABLE_CFI_ICALL
 MemoryProtectionKey::Permission MemoryProtectionKey::GetKeyPermission(int key) {
   DCHECK(pkey_api_initialized);
   DCHECK_NE(kNoMemoryProtectionKey, key);
@@ -226,3 +99,5 @@ MemoryProtectionKey::Permission MemoryProtectionKey::GetKeyPermission(int key) {
 
 }  // namespace base
 }  // namespace v8
+
+#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
diff --git a/deps/v8/src/base/platform/memory-protection-key.h b/deps/v8/src/base/platform/memory-protection-key.h
index 7d89a41427e02c..24c81ffa7ed553 100644
--- a/deps/v8/src/base/platform/memory-protection-key.h
+++ b/deps/v8/src/base/platform/memory-protection-key.h
@@ -5,10 +5,9 @@
 #ifndef V8_BASE_PLATFORM_MEMORY_PROTECTION_KEY_H_
 #define V8_BASE_PLATFORM_MEMORY_PROTECTION_KEY_H_
 
+#include "src/base/build_config.h"
+
 #if V8_HAS_PKU_JIT_WRITE_PROTECT
-#include <sys/mman.h>  // For static_assert of permission values.
-#undef MAP_TYPE  // Conflicts with MAP_TYPE in Torque-generated instance-types.h
-#endif
 
 #include "include/v8-platform.h"
 #include "src/base/address-region.h"
@@ -22,7 +21,7 @@ namespace base {
 // This class has static methods for the different platform specific
 // functions related to memory protection key support.
 
-// TODO(dlehmann): Consider adding this to {base::PageAllocator} (higher-level,
+// TODO(sroettger): Consider adding this to {base::PageAllocator} (higher-level,
 // exported API) once the API is more stable and we have converged on a better
 // design (e.g., typed class wrapper around int memory protection key).
 class V8_BASE_EXPORT MemoryProtectionKey {
@@ -51,20 +50,7 @@ class V8_BASE_EXPORT MemoryProtectionKey {
 
   // Call exactly once per process to determine if PKU is supported on this
   // platform and initialize global data structures.
-  static void InitializeMemoryProtectionKeySupport();
-
-  // Allocates a memory protection key on platforms with PKU support, returns
-  // {kNoMemoryProtectionKey} on platforms without support or when allocation
-  // failed at runtime.
-  static int AllocateKey();
-
-  // Frees the given memory protection key, to make it available again for the
-  // next call to {AllocateKey()}. Note that this does NOT
-  // invalidate access rights to pages that are still tied to that key. That is,
-  // if the key is reused and pages with that key are still accessable, this
-  // might be a security issue. See
-  // https://www.gnu.org/software/libc/manual/html_mono/libc.html#Memory-Protection-Keys
-  static void FreeKey(int key);
+  static bool InitializeMemoryProtectionKeySupport();
 
   // Associates a memory protection {key} with the given {region}.
   // If {key} is {kNoMemoryProtectionKey} this behaves like "plain"
@@ -78,7 +64,7 @@ class V8_BASE_EXPORT MemoryProtectionKey {
   // permissions of the page, not the key. For changing the permissions of the
   // key, use {SetPermissionsForKey()} instead.
   static bool SetPermissionsAndKey(
-      v8::PageAllocator* page_allocator, base::AddressRegion region,
+      base::AddressRegion region,
       v8::PageAllocator::Permission page_permissions, int key);
 
   // Set the key's permissions. {key} must be valid, i.e. not
@@ -92,4 +78,6 @@ class V8_BASE_EXPORT MemoryProtectionKey {
 }  // namespace base
 }  // namespace v8
 
+#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
+
 #endif  // V8_BASE_PLATFORM_MEMORY_PROTECTION_KEY_H_
diff --git a/deps/v8/src/base/platform/mutex.h b/deps/v8/src/base/platform/mutex.h
index a6b71b864f2960..15cf0cd5d5989c 100644
--- a/deps/v8/src/base/platform/mutex.h
+++ b/deps/v8/src/base/platform/mutex.h
@@ -308,22 +308,25 @@ template <typename Mutex, NullBehavior Behavior = NullBehavior::kRequireNotNull>
 class V8_NODISCARD LockGuard final {
  public:
   explicit LockGuard(Mutex* mutex) : mutex_(mutex) {
+    DCHECK_IMPLIES(Behavior == NullBehavior::kRequireNotNull,
+                   mutex_ != nullptr);
     if (has_mutex()) mutex_->Lock();
   }
   LockGuard(const LockGuard&) = delete;
   LockGuard& operator=(const LockGuard&) = delete;
+  LockGuard(LockGuard&& other) V8_NOEXCEPT : mutex_(other.mutex_) {
+    DCHECK_IMPLIES(Behavior == NullBehavior::kRequireNotNull,
+                   mutex_ != nullptr);
+    other.mutex_ = nullptr;
+  }
   ~LockGuard() {
     if (has_mutex()) mutex_->Unlock();
   }
 
  private:
-  Mutex* const mutex_;
+  Mutex* mutex_;
 
-  bool V8_INLINE has_mutex() const {
-    DCHECK_IMPLIES(Behavior == NullBehavior::kRequireNotNull,
-                   mutex_ != nullptr);
-    return Behavior == NullBehavior::kRequireNotNull || mutex_ != nullptr;
-  }
+  bool V8_INLINE has_mutex() const { return mutex_ != nullptr; }
 };
 
 using MutexGuard = LockGuard<Mutex>;
diff --git a/deps/v8/src/base/platform/platform-fuchsia.cc b/deps/v8/src/base/platform/platform-fuchsia.cc
index 885bffa340462b..ad9b9dc3fc7a49 100644
--- a/deps/v8/src/base/platform/platform-fuchsia.cc
+++ b/deps/v8/src/base/platform/platform-fuchsia.cc
@@ -2,8 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include <fuchsia/kernel/cpp/fidl.h>
-#include <lib/fdio/directory.h>
+#include <fidl/fuchsia.kernel/cpp/fidl.h>
+#include <lib/component/incoming/cpp/protocol.h>
 #include <lib/zx/resource.h>
 #include <lib/zx/thread.h>
 #include <lib/zx/vmar.h>
@@ -24,22 +24,26 @@ static zx_handle_t g_vmex_resource = ZX_HANDLE_INVALID;
 
 static void* g_root_vmar_base = nullptr;
 
-#ifdef V8_USE_VMEX_RESOURCE
+// If VmexResource is unavailable or does not return a valid handle then
+// this will be observed as failures in vmo_replace_as_executable() calls.
 void SetVmexResource() {
   DCHECK_EQ(g_vmex_resource, ZX_HANDLE_INVALID);
-  zx::resource vmex_resource;
-  fuchsia::kernel::VmexResourceSyncPtr vmex_resource_svc;
-  zx_status_t status = fdio_service_connect(
-      "/svc/fuchsia.kernel.VmexResource",
-      vmex_resource_svc.NewRequest().TakeChannel().release());
-  DCHECK_EQ(status, ZX_OK);
-  status = vmex_resource_svc->Get(&vmex_resource);
-  USE(status);
-  DCHECK_EQ(status, ZX_OK);
-  DCHECK(vmex_resource.is_valid());
-  g_vmex_resource = vmex_resource.release();
-}
-#endif
+
+  auto vmex_resource_client =
+      component::Connect<fuchsia_kernel::VmexResource>();
+  if (vmex_resource_client.is_error()) {
+    return;
+  }
+
+  fidl::SyncClient sync_vmex_resource_client(
+      std::move(vmex_resource_client.value()));
+  auto result = sync_vmex_resource_client->Get();
+  if (result.is_error()) {
+    return;
+  }
+
+  g_vmex_resource = result->resource().release();
+}
 
 zx_vm_option_t GetProtectionFromMemoryPermission(OS::MemoryPermission access) {
   switch (access) {
@@ -246,9 +250,7 @@ void OS::Initialize(bool hard_abort, const char* const gc_fake_mmap) {
   CHECK_EQ(ZX_OK, status);
   g_root_vmar_base = reinterpret_cast<void*>(info.base);
 
-#ifdef V8_USE_VMEX_RESOURCE
   SetVmexResource();
-#endif
 }
 
 // static
diff --git a/deps/v8/src/base/platform/platform-linux.cc b/deps/v8/src/base/platform/platform-linux.cc
index e72a3a212d5f79..c0e3743410b394 100644
--- a/deps/v8/src/base/platform/platform-linux.cc
+++ b/deps/v8/src/base/platform/platform-linux.cc
@@ -140,7 +140,7 @@ std::vector<OS::MemoryRange> OS::GetFreeMemoryRangesWithin(
 //  static
 base::Optional<MemoryRegion> MemoryRegion::FromMapsLine(const char* line) {
   MemoryRegion region;
-  uint8_t dev_major = 0, dev_minor = 0;
+  unsigned dev_major = 0, dev_minor = 0;
   uintptr_t inode = 0;
   int path_index = 0;
   uintptr_t offset = 0;
@@ -153,7 +153,7 @@ base::Optional<MemoryRegion> MemoryRegion::FromMapsLine(const char* line) {
   // Refer to man 3 sscanf for details.
   if (sscanf(line,
              "%" V8PRIxPTR "-%" V8PRIxPTR " %4c %" V8PRIxPTR
-             " %hhx:%hhx %" V8PRIdPTR " %n",
+             " %x:%x %" V8PRIdPTR " %n",
              &region.start, &region.end, region.permissions, &offset,
              &dev_major, &dev_minor, &inode, &path_index) < 7) {
     return base::nullopt;
diff --git a/deps/v8/src/base/platform/platform-posix.cc b/deps/v8/src/base/platform/platform-posix.cc
index 4b6e6ad8f17138..73cdbdb19df2ae 100644
--- a/deps/v8/src/base/platform/platform-posix.cc
+++ b/deps/v8/src/base/platform/platform-posix.cc
@@ -9,6 +9,8 @@
 #include <errno.h>
 #include <limits.h>
 #include <pthread.h>
+
+#include "src/base/logging.h"
 #if defined(__DragonFly__) || defined(__FreeBSD__) || defined(__OpenBSD__)
 #include <pthread_np.h>  // for pthread_set_name_np
 #endif
@@ -159,7 +161,7 @@ void* Allocate(void* hint, size_t size, OS::MemoryPermission access,
   void* result = mmap(hint, size, prot, flags, kMmapFd, kMmapFdOffset);
   if (result == MAP_FAILED) return nullptr;
 
-#if V8_ENABLE_PRIVATE_MAPPING_FORK_OPTIMIZATION
+#if V8_OS_LINUX && V8_ENABLE_PRIVATE_MAPPING_FORK_OPTIMIZATION
   // This is advisory, so we ignore errors.
   madvise(result, size, MADV_DONTFORK);
 #endif
@@ -485,6 +487,7 @@ bool OS::SetPermissions(void* address, size_t size, MemoryPermission access) {
   int prot = GetProtectionFromMemoryPermission(access);
   int ret = mprotect(address, size, prot);
 
+  // Setting permissions can fail if the limit of VMAs is exceeded.
   // Any failure that's not OOM likely indicates a bug in the caller (e.g.
   // using an invalid mapping) so attempt to catch that here to facilitate
   // debugging of these failures.
@@ -521,10 +524,13 @@ bool OS::SetPermissions(void* address, size_t size, MemoryPermission access) {
 
 // static
 void OS::SetDataReadOnly(void* address, size_t size) {
-  DCHECK_EQ(0, reinterpret_cast<uintptr_t>(address) % CommitPageSize());
-  DCHECK_EQ(0, size % CommitPageSize());
+  CHECK_EQ(0, reinterpret_cast<uintptr_t>(address) % CommitPageSize());
+  CHECK_EQ(0, size % CommitPageSize());
 
-  CHECK_EQ(0, mprotect(address, size, PROT_READ));
+  if (mprotect(address, size, PROT_READ) != 0) {
+    FATAL("Failed to protect data memory at %p +%zu; error %d\n", address, size,
+          errno);
+  }
 }
 
 // static
@@ -591,6 +597,7 @@ bool OS::DecommitPages(void* address, size_t size) {
   void* ret = mmap(address, size, PROT_NONE,
                    MAP_FIXED | MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
   if (V8_UNLIKELY(ret == MAP_FAILED)) {
+    // Decommitting pages can fail if the limit of VMAs is exceeded.
     CHECK_EQ(ENOMEM, errno);
     return false;
   }
@@ -924,10 +931,12 @@ void OS::FPrint(FILE* out, const char* format, ...) {
 
 void OS::VFPrint(FILE* out, const char* format, va_list args) {
 #if defined(ANDROID) && !defined(V8_ANDROID_LOG_STDOUT)
-  __android_log_vprint(ANDROID_LOG_INFO, LOG_TAG, format, args);
-#else
-  vfprintf(out, format, args);
+  if (out == stdout) {
+    __android_log_vprint(ANDROID_LOG_INFO, LOG_TAG, format, args);
+    return;
+  }
 #endif
+  vfprintf(out, format, args);
 }
 
 
@@ -1080,13 +1089,13 @@ class Thread::PlatformData {
 Thread::Thread(const Options& options)
     : data_(new PlatformData),
       stack_size_(options.stack_size()),
+      priority_(options.priority()),
       start_semaphore_(nullptr) {
   const int min_stack_size = static_cast<int>(PTHREAD_STACK_MIN);
   if (stack_size_ > 0) stack_size_ = std::max(stack_size_, min_stack_size);
   set_name(options.name());
 }
 
-
 Thread::~Thread() {
   delete data_;
 }
@@ -1117,7 +1126,6 @@ static void SetThreadName(const char* name) {
 #endif
 }
 
-
 static void* ThreadEntry(void* arg) {
   Thread* thread = reinterpret_cast<Thread*>(arg);
   // We take the lock here to make sure that pthread_create finished first since
@@ -1125,6 +1133,35 @@ static void* ThreadEntry(void* arg) {
   // one).
   { MutexGuard lock_guard(&thread->data()->thread_creation_mutex_); }
   SetThreadName(thread->name());
+#if V8_OS_DARWIN
+  switch (thread->priority()) {
+    case Thread::Priority::kBestEffort:
+      pthread_set_qos_class_self_np(QOS_CLASS_BACKGROUND, 0);
+      break;
+    case Thread::Priority::kUserVisible:
+      pthread_set_qos_class_self_np(QOS_CLASS_USER_INITIATED, -1);
+      break;
+    case Thread::Priority::kUserBlocking:
+      pthread_set_qos_class_self_np(QOS_CLASS_USER_INITIATED, 0);
+      break;
+    case Thread::Priority::kDefault:
+      break;
+  }
+#elif V8_OS_LINUX
+  switch (thread->priority()) {
+    case Thread::Priority::kBestEffort:
+      setpriority(PRIO_PROCESS, 0, 10);
+      break;
+    case Thread::Priority::kUserVisible:
+      setpriority(PRIO_PROCESS, 0, 1);
+      break;
+    case Thread::Priority::kUserBlocking:
+      setpriority(PRIO_PROCESS, 0, 0);
+      break;
+    case Thread::Priority::kDefault:
+      break;
+  }
+#endif
   DCHECK_NE(thread->data()->thread_, kNoThread);
   thread->NotifyStartedAndRun();
   return nullptr;
@@ -1246,28 +1283,52 @@ void Thread::SetThreadLocal(LocalStorageKey key, void* value) {
 #if !defined(V8_OS_FREEBSD) && !defined(V8_OS_DARWIN) && !defined(_AIX) && \
     !defined(V8_OS_SOLARIS)
 
+namespace {
+#if DEBUG
+bool MainThreadIsCurrentThread() {
+  // This method assumes the first time is called is from the main thread.
+  // It returns true for subsequent calls only if they are called from the
+  // same thread.
+  static int main_thread_id = -1;
+  if (main_thread_id == -1) {
+    main_thread_id = OS::GetCurrentThreadId();
+  }
+  return main_thread_id == OS::GetCurrentThreadId();
+}
+#endif  // DEBUG
+}  // namespace
+
 // static
 Stack::StackSlot Stack::ObtainCurrentThreadStackStart() {
   pthread_attr_t attr;
   int error = pthread_getattr_np(pthread_self(), &attr);
-  if (!error) {
-    void* base;
-    size_t size;
-    error = pthread_attr_getstack(&attr, &base, &size);
-    CHECK(!error);
-    pthread_attr_destroy(&attr);
-    return reinterpret_cast<uint8_t*>(base) + size;
-  }
-
+  if (error) {
+    DCHECK(MainThreadIsCurrentThread());
 #if defined(V8_LIBC_GLIBC)
-  // pthread_getattr_np can fail for the main thread. In this case
-  // just like NaCl we rely on the __libc_stack_end to give us
-  // the start of the stack.
-  // See https://code.google.com/p/nativeclient/issues/detail?id=3431.
-  return __libc_stack_end;
+    // pthread_getattr_np can fail for the main thread.
+    // For the main thread we prefer using __libc_stack_end (if it exists) since
+    // it generally provides a tighter limit for CSS.
+    return __libc_stack_end;
 #else
-  return nullptr;
+    return nullptr;
+#endif  // !defined(V8_LIBC_GLIBC)
+  }
+  void* base;
+  size_t size;
+  error = pthread_attr_getstack(&attr, &base, &size);
+  CHECK(!error);
+  pthread_attr_destroy(&attr);
+  void* stack_start = reinterpret_cast<uint8_t*>(base) + size;
+#if defined(V8_LIBC_GLIBC)
+  // __libc_stack_end is process global and thus is only valid for
+  // the main thread. Check whether this is the main thread by checking
+  // __libc_stack_end is within the thread's stack.
+  if ((base <= __libc_stack_end) && (__libc_stack_end <= stack_start)) {
+    DCHECK(MainThreadIsCurrentThread());
+    return __libc_stack_end;
+  }
 #endif  // !defined(V8_LIBC_GLIBC)
+  return stack_start;
 }
 
 #endif  // !defined(V8_OS_FREEBSD) && !defined(V8_OS_DARWIN) &&
diff --git a/deps/v8/src/base/platform/platform-win32.cc b/deps/v8/src/base/platform/platform-win32.cc
index 280fe18f7f2281..152fbbf3c26eab 100644
--- a/deps/v8/src/base/platform/platform-win32.cc
+++ b/deps/v8/src/base/platform/platform-win32.cc
@@ -29,6 +29,7 @@
 #include "src/base/bits.h"
 #include "src/base/lazy-instance.h"
 #include "src/base/macros.h"
+#include "src/base/platform/platform-win32.h"
 #include "src/base/platform/platform.h"
 #include "src/base/platform/time.h"
 #include "src/base/timezone-cache.h"
@@ -1020,7 +1021,7 @@ void OS::SetDataReadOnly(void* address, size_t size) {
   DCHECK_EQ(0, reinterpret_cast<uintptr_t>(address) % CommitPageSize());
   DCHECK_EQ(0, size % CommitPageSize());
 
-  unsigned long old_protection;
+  DWORD old_protection;
   CHECK(VirtualProtect(address, size, PAGE_READONLY, &old_protection));
   CHECK(old_protection == PAGE_READWRITE || old_protection == PAGE_WRITECOPY);
 }
@@ -1129,6 +1130,57 @@ void OS::Sleep(TimeDelta interval) {
   ::Sleep(static_cast<DWORD>(interval.InMilliseconds()));
 }
 
+PreciseSleepTimer::PreciseSleepTimer() : timer_(NULL) {}
+PreciseSleepTimer::~PreciseSleepTimer() { Close(); }
+PreciseSleepTimer::PreciseSleepTimer(PreciseSleepTimer&& other) V8_NOEXCEPT {
+  Close();
+  timer_ = other.timer_;
+  other.timer_ = NULL;
+}
+PreciseSleepTimer& PreciseSleepTimer::operator=(PreciseSleepTimer&& other)
+    V8_NOEXCEPT {
+  Close();
+  timer_ = other.timer_;
+  other.timer_ = NULL;
+  return *this;
+}
+bool PreciseSleepTimer::IsInitialized() const { return timer_ != NULL; }
+void PreciseSleepTimer::Close() {
+  if (timer_ != NULL) {
+    CloseHandle(timer_);
+    timer_ = NULL;
+  }
+}
+
+void PreciseSleepTimer::TryInit() {
+  Close();
+  // This flag allows precise sleep times, but is only available since Windows
+  // 10 version 1803.
+  DWORD flags = CREATE_WAITABLE_TIMER_HIGH_RESOLUTION;
+  // The TIMER_MODIFY_STATE permission allows setting the timer, and SYNCHRONIZE
+  // allows waiting for it.
+  DWORD desired_access = TIMER_MODIFY_STATE | SYNCHRONIZE;
+  timer_ =
+      CreateWaitableTimerExW(NULL,  // Cannot be inherited by child processes
+                             NULL,  // Cannot be looked up by name
+                             flags, desired_access);
+}
+
+void PreciseSleepTimer::Sleep(TimeDelta interval) const {
+  // Time is specified in 100 nanosecond intervals. Negative values indicate
+  // relative time.
+  LARGE_INTEGER due_time;
+  due_time.QuadPart = -interval.InMicroseconds() * 10;
+  LONG period = 0;  // Not periodic; wake only once
+  PTIMERAPCROUTINE completion_routine = NULL;
+  LPVOID arg_to_completion_routine = NULL;
+  BOOL resume = false;  // No need to wake system from sleep
+  CHECK(SetWaitableTimer(timer_, &due_time, period, completion_routine,
+                         arg_to_completion_routine, resume));
+
+  DWORD timeout_interval = INFINITE;  // Return only when the object is signaled
+  CHECK_EQ(WAIT_OBJECT_0, WaitForSingleObject(timer_, timeout_interval));
+}
 
 void OS::Abort() {
   // Give a chance to debug the failure.
diff --git a/deps/v8/src/base/platform/platform-win32.h b/deps/v8/src/base/platform/platform-win32.h
new file mode 100644
index 00000000000000..63d7bb210cd71f
--- /dev/null
+++ b/deps/v8/src/base/platform/platform-win32.h
@@ -0,0 +1,50 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_BASE_PLATFORM_PLATFORM_WIN32_H_
+#define V8_BASE_PLATFORM_PLATFORM_WIN32_H_
+
+#include "src/base/platform/time.h"
+
+namespace v8 {
+namespace base {
+
+// A timer which allows more precise sleep intervals. Sleeping on Windows is
+// generally limited by the granularity of the system timer (64 Hz by default),
+// but on Windows 10 version 1803 and newer, this class allows much shorter
+// sleeps including sub-millisecond intervals.
+class V8_BASE_EXPORT PreciseSleepTimer {
+ public:
+  PreciseSleepTimer();
+  ~PreciseSleepTimer();
+
+  // Moving is supported but copying is not, because this class owns a
+  // platform handle.
+  PreciseSleepTimer(const PreciseSleepTimer& other) = delete;
+  PreciseSleepTimer& operator=(const PreciseSleepTimer& other) = delete;
+  PreciseSleepTimer(PreciseSleepTimer&& other) V8_NOEXCEPT;
+  PreciseSleepTimer& operator=(PreciseSleepTimer&& other) V8_NOEXCEPT;
+
+  // Attempts to initialize this timer. Precise timers are only available on
+  // Windows 10 version 1803 and later. To check whether initialization worked,
+  // use IsInitialized.
+  void TryInit();
+
+  bool IsInitialized() const;
+
+  // Sleeps for a specified time interval. This function requires that the timer
+  // has been initialized, as can be checked with IsInitialized. A single
+  // PreciseSleepTimer instance must not be used simultaneously on multiple
+  // threads.
+  void Sleep(TimeDelta interval) const;
+
+ private:
+  void Close();
+  HANDLE timer_;
+};
+
+}  // namespace base
+}  // namespace v8
+
+#endif  // V8_BASE_PLATFORM_PLATFORM_WIN32_H_
diff --git a/deps/v8/src/base/platform/platform.cc b/deps/v8/src/base/platform/platform.cc
index 3914b7dabab3fd..328e9d890d6ec7 100644
--- a/deps/v8/src/base/platform/platform.cc
+++ b/deps/v8/src/base/platform/platform.cc
@@ -1,10 +1,10 @@
 // Copyright 2023 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+
 #include "src/base/platform/platform.h"
 
 namespace v8 {
-
 namespace base {
 
 namespace {
@@ -15,15 +15,19 @@ thread_local void* thread_stack_start = nullptr;
 }  // namespace
 
 // static
-Stack::StackSlot Stack::GetStackStart() {
-  DCHECK_IMPLIES(thread_stack_start,
-                 thread_stack_start == ObtainCurrentThreadStackStart());
-
+Stack::StackSlot Stack::GetStackStartUnchecked() {
   if (!thread_stack_start) {
     thread_stack_start = ObtainCurrentThreadStackStart();
   }
   return thread_stack_start;
 }
 
+// static
+Stack::StackSlot Stack::GetStackStart() {
+  DCHECK_IMPLIES(thread_stack_start,
+                 thread_stack_start == ObtainCurrentThreadStackStart());
+  return GetStackStartUnchecked();
+}
+
 }  // namespace base
 }  // namespace v8
diff --git a/deps/v8/src/base/platform/platform.h b/deps/v8/src/base/platform/platform.h
index 27369a7a8d656f..4ced4fdeddc164 100644
--- a/deps/v8/src/base/platform/platform.h
+++ b/deps/v8/src/base/platform/platform.h
@@ -65,6 +65,10 @@ extern "C" unsigned long __readfsdword(unsigned long);  // NOLINT(runtime/int)
 
 namespace v8 {
 
+namespace internal {
+class HandleHelper;
+}
+
 namespace base {
 
 // ----------------------------------------------------------------------------
@@ -519,18 +523,26 @@ class V8_BASE_EXPORT Thread {
   using LocalStorageKey = int32_t;
 #endif
 
+  // Priority class for the thread. Use kDefault to keep the priority
+  // unchanged.
+  enum class Priority { kBestEffort, kUserVisible, kUserBlocking, kDefault };
+
   class Options {
    public:
-    Options() : name_("v8:<unknown>"), stack_size_(0) {}
+    Options() : Options("v8:<unknown>") {}
     explicit Options(const char* name, int stack_size = 0)
-        : name_(name), stack_size_(stack_size) {}
+        : Options(name, Priority::kDefault, stack_size) {}
+    Options(const char* name, Priority priority, int stack_size = 0)
+        : name_(name), priority_(priority), stack_size_(stack_size) {}
 
     const char* name() const { return name_; }
     int stack_size() const { return stack_size_; }
+    Priority priority() const { return priority_; }
 
    private:
     const char* name_;
-    int stack_size_;
+    const Priority priority_;
+    const int stack_size_;
   };
 
   // Create new thread.
@@ -590,6 +602,7 @@ class V8_BASE_EXPORT Thread {
 
   class PlatformData;
   PlatformData* data() { return data_; }
+  Priority priority() const { return priority_; }
 
   void NotifyStartedAndRun() {
     if (start_semaphore_) start_semaphore_->Signal();
@@ -603,6 +616,7 @@ class V8_BASE_EXPORT Thread {
 
   char name_[kMaxThreadNameLength];
   int stack_size_;
+  Priority priority_;
   Semaphore* start_semaphore_;
 };
 
@@ -662,8 +676,11 @@ class V8_BASE_EXPORT Stack {
   }
 
  private:
-  // Returns the current thread stack start pointer.
+  // Return the current thread stack start pointer.
+  static StackSlot GetStackStartUnchecked();
   static Stack::StackSlot ObtainCurrentThreadStackStart();
+
+  friend v8::internal::HandleHelper;
 };
 
 #if V8_HAS_PTHREAD_JIT_WRITE_PROTECT
diff --git a/deps/v8/src/base/platform/time.h b/deps/v8/src/base/platform/time.h
index 9a41d49b2cc651..808e0776ddac49 100644
--- a/deps/v8/src/base/platform/time.h
+++ b/deps/v8/src/base/platform/time.h
@@ -145,18 +145,18 @@ class V8_BASE_EXPORT TimeDelta final {
   struct timespec ToTimespec() const;
 
   // Computations with other deltas.
-  TimeDelta operator+(const TimeDelta& other) const {
+  constexpr TimeDelta operator+(const TimeDelta& other) const {
     return TimeDelta(delta_ + other.delta_);
   }
-  TimeDelta operator-(const TimeDelta& other) const {
+  constexpr TimeDelta operator-(const TimeDelta& other) const {
     return TimeDelta(delta_ - other.delta_);
   }
 
-  TimeDelta& operator+=(const TimeDelta& other) {
+  constexpr TimeDelta& operator+=(const TimeDelta& other) {
     delta_ += other.delta_;
     return *this;
   }
-  TimeDelta& operator-=(const TimeDelta& other) {
+  constexpr TimeDelta& operator-=(const TimeDelta& other) {
     delta_ -= other.delta_;
     return *this;
   }
@@ -209,6 +209,8 @@ class V8_BASE_EXPORT TimeDelta final {
     return delta_ >= other.delta_;
   }
 
+  friend void swap(TimeDelta a, TimeDelta b) { std::swap(a.delta_, b.delta_); }
+
  private:
   static constexpr inline TimeDelta FromDouble(double value);
 
@@ -435,6 +437,10 @@ class V8_BASE_EXPORT TimeTicks final
   // Returns true if the high-resolution clock is working on this system.
   static bool IsHighResolution();
 
+  static constexpr TimeTicks FromMsTicksForTesting(int64_t ticks) {
+    return TimeTicks(ticks * kMicrosecondsPerMillisecond);
+  }
+
  private:
   friend class time_internal::TimeBase<TimeTicks>;
 
diff --git a/deps/v8/src/base/pointer-with-payload.h b/deps/v8/src/base/pointer-with-payload.h
index 94801a9af75bca..b124f8a9a1d06a 100644
--- a/deps/v8/src/base/pointer-with-payload.h
+++ b/deps/v8/src/base/pointer-with-payload.h
@@ -96,6 +96,8 @@ class PointerWithPayload {
     DCHECK_EQ(GetPayload(), new_payload);
   }
 
+  uintptr_t raw() const { return pointer_with_payload_; }
+
  private:
   static constexpr int kAvailableBits = PointerWithPayloadTraits<
       typename std::remove_const<PointerType>::type>::kAvailableBits;
@@ -112,6 +114,13 @@ class PointerWithPayload {
   uintptr_t pointer_with_payload_ = 0;
 };
 
+template <typename PointerType, typename PayloadType, int NumPayloadBits>
+bool operator==(
+    PointerWithPayload<PointerType, PayloadType, NumPayloadBits> lhs,
+    PointerWithPayload<PointerType, PayloadType, NumPayloadBits> rhs) {
+  return lhs.raw() == rhs.raw();
+}
+
 }  // namespace base
 }  // namespace v8
 
diff --git a/deps/v8/src/base/region-allocator.cc b/deps/v8/src/base/region-allocator.cc
index d4d443cacf9e82..e3d3d54cfb55f1 100644
--- a/deps/v8/src/base/region-allocator.cc
+++ b/deps/v8/src/base/region-allocator.cc
@@ -4,6 +4,8 @@
 
 #include "src/base/region-allocator.h"
 
+#include <iterator>
+
 #include "src/base/bits.h"
 #include "src/base/logging.h"
 #include "src/base/macros.h"
diff --git a/deps/v8/src/base/ring-buffer.h b/deps/v8/src/base/ring-buffer.h
index 8357987083d805..575cce06e2d1c4 100644
--- a/deps/v8/src/base/ring-buffer.h
+++ b/deps/v8/src/base/ring-buffer.h
@@ -5,53 +5,58 @@
 #ifndef V8_BASE_RING_BUFFER_H_
 #define V8_BASE_RING_BUFFER_H_
 
-#include "src/base/macros.h"
+#include <cstdint>
 
-namespace v8 {
-namespace base {
+namespace v8::base {
 
-template <typename T>
-class RingBuffer {
+template <typename T, uint8_t _SIZE = 10>
+class RingBuffer final {
  public:
-  RingBuffer() { Reset(); }
+  static constexpr uint8_t kSize = _SIZE;
+
+  constexpr RingBuffer() = default;
+
   RingBuffer(const RingBuffer&) = delete;
   RingBuffer& operator=(const RingBuffer&) = delete;
 
-  static const int kSize = 10;
-
-  void Push(const T& value) {
-    if (count_ == kSize) {
-      elements_[start_++] = value;
-      if (start_ == kSize) start_ = 0;
-    } else {
-      DCHECK_EQ(start_, 0);
-      elements_[count_++] = value;
+  constexpr void Push(const T& value) {
+    elements_[pos_++] = value;
+    if (pos_ == kSize) {
+      pos_ = 0;
+      is_full_ = true;
     }
   }
 
-  int Count() const { return count_; }
+  constexpr uint8_t Size() const { return is_full_ ? kSize : pos_; }
+
+  constexpr bool Empty() const { return Size() == 0; }
+
+  constexpr void Clear() {
+    pos_ = 0;
+    is_full_ = false;
+  }
 
   template <typename Callback>
-  T Sum(Callback callback, const T& initial) const {
-    int j = start_ + count_ - 1;
-    if (j >= kSize) j -= kSize;
+  constexpr T Reduce(Callback callback, const T& initial) const {
     T result = initial;
-    for (int i = 0; i < count_; i++) {
-      result = callback(result, elements_[j]);
-      if (--j == -1) j += kSize;
+    for (uint8_t i = pos_; i > 0; --i) {
+      result = callback(result, elements_[i - 1]);
+    }
+    if (!is_full_) {
+      return result;
+    }
+    for (uint8_t i = kSize; i > pos_; --i) {
+      result = callback(result, elements_[i - 1]);
     }
     return result;
   }
 
-  void Reset() { start_ = count_ = 0; }
-
  private:
   T elements_[kSize];
-  int start_;
-  int count_;
+  uint8_t pos_ = 0;
+  bool is_full_ = false;
 };
 
-}  // namespace base
-}  // namespace v8
+}  // namespace v8::base
 
 #endif  // V8_BASE_RING_BUFFER_H_
diff --git a/deps/v8/src/base/small-map.h b/deps/v8/src/base/small-map.h
new file mode 100644
index 00000000000000..579f884c9246b8
--- /dev/null
+++ b/deps/v8/src/base/small-map.h
@@ -0,0 +1,629 @@
+// Copyright 2012 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Copyright 2023 the V8 project authors. All rights reserved.
+// This file is a clone of "base/containers/small_map.h" in chromium.
+// Keep in sync, especially when fixing bugs.
+
+#ifndef V8_BASE_SMALL_MAP_H_
+#define V8_BASE_SMALL_MAP_H_
+
+#include "src/base/macros.h"
+
+namespace v8::base {
+
+// SmallMap is a container with a std::map-like interface. It starts out backed
+// by an unsorted array but switches to some other container type if it grows
+// beyond this fixed size.
+//
+// PROS
+//
+//  - Good memory locality and low overhead for smaller maps.
+//  - Handles large maps without the degenerate performance of an array.
+//
+// CONS
+//
+//  - Larger code size than the alternatives.
+//
+// IMPORTANT NOTES
+//
+//  - Iterators are invalidated across mutations.
+//
+// DETAILS
+//
+// SmallMap will pick up the comparator from the underlying map type. In
+// std::map only a "less" operator is defined, which requires us to do two
+// comparisons per element when doing the brute-force search in the simple
+// array. std::unordered_map has a key_equal function which will be used.
+//
+// We define default overrides for the common map types to avoid this
+// double-compare, but you should be aware of this if you use your own operator<
+// for your map and supply your own version of == to the SmallMap. You can use
+// regular operator== by just doing:
+//
+//   SmallMap<std::map<MyKey, MyValue>, 4, std::equal_to<MyKey>>
+//
+//
+// USAGE
+// -----
+//
+// NormalMap:  The map type to fall back to. This also defines the key and value
+//             types for the SmallMap.
+// kArraySize:  The size of the initial array of results. This will be allocated
+//              with the SmallMap object rather than separately on the heap.
+//              Once the map grows beyond this size, the map type will be used
+//              instead.
+// EqualKey:  A functor which tests two keys for equality. If the wrapped map
+//            type has a "key_equal" member (unordered_map does), then that will
+//            be used by default. If the wrapped map type has a strict weak
+//            ordering "key_compare" (std::map does), that will be used to
+//            implement equality by default.
+// MapInit: A functor that takes a NormalMap* and uses it to initialize the map.
+//          This functor will be called at most once per SmallMap, when the map
+//          exceeds the threshold of kArraySize and we are about to copy values
+//          from the array to the map. The functor *must* initialize the
+//          NormalMap* argument with placement new, since after it runs we
+//          assume that the NormalMap has been initialized.
+//
+// Example:
+//   SmallMap<std::map<string, int>> days;
+//   days["sunday"   ] = 0;
+//   days["monday"   ] = 1;
+//   days["tuesday"  ] = 2;
+//   days["wednesday"] = 3;
+//   days["thursday" ] = 4;
+//   days["friday"   ] = 5;
+//   days["saturday" ] = 6;
+
+namespace internal {
+
+template <typename NormalMap>
+class SmallMapDefaultInit {
+ public:
+  void operator()(NormalMap* map) const { new (map) NormalMap(); }
+};
+
+// has_key_equal<M>::value is true iff there exists a type M::key_equal. This is
+// used to dispatch to one of the select_equal_key<> metafunctions below.
+template <typename M>
+struct has_key_equal {
+  typedef char sml;  // "small" is sometimes #defined so we use an abbreviation.
+  typedef struct {
+    char dummy[2];
+  } big;
+  // Two functions, one accepts types that have a key_equal member, and one that
+  // accepts anything. They each return a value of a different size, so we can
+  // determine at compile-time which function would have been called.
+  template <typename U>
+  static big test(typename U::key_equal*);
+  template <typename>
+  static sml test(...);
+  // Determines if M::key_equal exists by looking at the size of the return
+  // type of the compiler-chosen test() function.
+  static const bool value = (sizeof(test<M>(0)) == sizeof(big));
+};
+template <typename M>
+const bool has_key_equal<M>::value;
+
+// Base template used for map types that do NOT have an M::key_equal member,
+// e.g., std::map<>. These maps have a strict weak ordering comparator rather
+// than an equality functor, so equality will be implemented in terms of that
+// comparator.
+//
+// There's a partial specialization of this template below for map types that do
+// have an M::key_equal member.
+template <typename M, bool has_key_equal_value>
+struct select_equal_key {
+  struct equal_key {
+    bool operator()(const typename M::key_type& left,
+                    const typename M::key_type& right) {
+      // Implements equality in terms of a strict weak ordering comparator.
+      typename M::key_compare comp;
+      return !comp(left, right) && !comp(right, left);
+    }
+  };
+};
+
+// Partial template specialization handles case where M::key_equal exists, e.g.,
+// unordered_map<>.
+template <typename M>
+struct select_equal_key<M, true> {
+  typedef typename M::key_equal equal_key;
+};
+
+}  // namespace internal
+
+template <typename NormalMap, size_t kArraySize = 4,
+          typename EqualKey = typename internal::select_equal_key<
+              NormalMap, internal::has_key_equal<NormalMap>::value>::equal_key,
+          typename MapInit = internal::SmallMapDefaultInit<NormalMap>>
+class SmallMap {
+  static constexpr size_t kUsingFullMapSentinel =
+      std::numeric_limits<size_t>::max();
+
+  static_assert(kArraySize > 0, "Initial size must be greater than 0");
+  static_assert(kArraySize != kUsingFullMapSentinel,
+                "Initial size out of range");
+
+ public:
+  typedef typename NormalMap::key_type key_type;
+  typedef typename NormalMap::mapped_type data_type;
+  typedef typename NormalMap::mapped_type mapped_type;
+  typedef typename NormalMap::value_type value_type;
+  typedef EqualKey key_equal;
+
+  SmallMap() : size_(0), functor_(MapInit()) {}
+
+  explicit SmallMap(const MapInit& functor) : size_(0), functor_(functor) {}
+
+  // Allow copy-constructor and assignment, since STL allows them too.
+  SmallMap(const SmallMap& src) V8_NOEXCEPT {
+    // size_ and functor_ are initted in InitFrom()
+    InitFrom(src);
+  }
+
+  void operator=(const SmallMap& src) V8_NOEXCEPT {
+    if (&src == this) return;
+
+    // This is not optimal. If src and dest are both using the small array, we
+    // could skip the teardown and reconstruct. One problem to be resolved is
+    // that the value_type itself is pair<const K, V>, and const K is not
+    // assignable.
+    Destroy();
+    InitFrom(src);
+  }
+
+  ~SmallMap() { Destroy(); }
+
+  class const_iterator;
+
+  class iterator {
+   public:
+    typedef typename NormalMap::iterator::iterator_category iterator_category;
+    typedef typename NormalMap::iterator::value_type value_type;
+    typedef typename NormalMap::iterator::difference_type difference_type;
+    typedef typename NormalMap::iterator::pointer pointer;
+    typedef typename NormalMap::iterator::reference reference;
+
+    V8_INLINE iterator() : array_iter_(nullptr) {}
+
+    V8_INLINE iterator& operator++() {
+      if (array_iter_ != nullptr) {
+        ++array_iter_;
+      } else {
+        ++map_iter_;
+      }
+      return *this;
+    }
+
+    V8_INLINE iterator operator++(int /*unused*/) {
+      iterator result(*this);
+      ++(*this);
+      return result;
+    }
+
+    V8_INLINE iterator& operator--() {
+      if (array_iter_ != nullptr) {
+        --array_iter_;
+      } else {
+        --map_iter_;
+      }
+      return *this;
+    }
+
+    V8_INLINE iterator operator--(int /*unused*/) {
+      iterator result(*this);
+      --(*this);
+      return result;
+    }
+
+    V8_INLINE value_type* operator->() const {
+      return array_iter_ ? array_iter_ : map_iter_.operator->();
+    }
+
+    V8_INLINE value_type& operator*() const {
+      return array_iter_ ? *array_iter_ : *map_iter_;
+    }
+
+    V8_INLINE bool operator==(const iterator& other) const {
+      if (array_iter_ != nullptr) {
+        return array_iter_ == other.array_iter_;
+      } else {
+        return other.array_iter_ == nullptr && map_iter_ == other.map_iter_;
+      }
+    }
+
+    V8_INLINE bool operator!=(const iterator& other) const {
+      return !(*this == other);
+    }
+
+   private:
+    friend class SmallMap;
+    friend class const_iterator;
+    V8_INLINE explicit iterator(value_type* init) : array_iter_(init) {}
+    V8_INLINE explicit iterator(const typename NormalMap::iterator& init)
+        : array_iter_(nullptr), map_iter_(init) {}
+
+    value_type* array_iter_;
+    typename NormalMap::iterator map_iter_;
+  };
+
+  class const_iterator {
+   public:
+    typedef
+        typename NormalMap::const_iterator::iterator_category iterator_category;
+    typedef typename NormalMap::const_iterator::value_type value_type;
+    typedef typename NormalMap::const_iterator::difference_type difference_type;
+    typedef typename NormalMap::const_iterator::pointer pointer;
+    typedef typename NormalMap::const_iterator::reference reference;
+
+    V8_INLINE const_iterator() : array_iter_(nullptr) {}
+
+    // Non-explicit constructor lets us convert regular iterators to const
+    // iterators.
+    V8_INLINE const_iterator(const iterator& other)
+        : array_iter_(other.array_iter_), map_iter_(other.map_iter_) {}
+
+    V8_INLINE const_iterator& operator++() {
+      if (array_iter_ != nullptr) {
+        ++array_iter_;
+      } else {
+        ++map_iter_;
+      }
+      return *this;
+    }
+
+    V8_INLINE const_iterator operator++(int /*unused*/) {
+      const_iterator result(*this);
+      ++(*this);
+      return result;
+    }
+
+    V8_INLINE const_iterator& operator--() {
+      if (array_iter_ != nullptr) {
+        --array_iter_;
+      } else {
+        --map_iter_;
+      }
+      return *this;
+    }
+
+    V8_INLINE const_iterator operator--(int /*unused*/) {
+      const_iterator result(*this);
+      --(*this);
+      return result;
+    }
+
+    V8_INLINE const value_type* operator->() const {
+      return array_iter_ ? array_iter_ : map_iter_.operator->();
+    }
+
+    V8_INLINE const value_type& operator*() const {
+      return array_iter_ ? *array_iter_ : *map_iter_;
+    }
+
+    V8_INLINE bool operator==(const const_iterator& other) const {
+      if (array_iter_ != nullptr) {
+        return array_iter_ == other.array_iter_;
+      }
+      return other.array_iter_ == nullptr && map_iter_ == other.map_iter_;
+    }
+
+    V8_INLINE bool operator!=(const const_iterator& other) const {
+      return !(*this == other);
+    }
+
+   private:
+    friend class SmallMap;
+    V8_INLINE explicit const_iterator(const value_type* init)
+        : array_iter_(init) {}
+    V8_INLINE explicit const_iterator(
+        const typename NormalMap::const_iterator& init)
+        : array_iter_(nullptr), map_iter_(init) {}
+
+    const value_type* array_iter_;
+    typename NormalMap::const_iterator map_iter_;
+  };
+
+  iterator find(const key_type& key) {
+    key_equal compare;
+
+    if (UsingFullMap()) {
+      return iterator(map()->find(key));
+    }
+
+    for (size_t i = 0; i < size_; ++i) {
+      if (compare(array_[i].first, key)) {
+        return iterator(array_ + i);
+      }
+    }
+    return iterator(array_ + size_);
+  }
+
+  const_iterator find(const key_type& key) const {
+    key_equal compare;
+
+    if (UsingFullMap()) {
+      return const_iterator(map()->find(key));
+    }
+
+    for (size_t i = 0; i < size_; ++i) {
+      if (compare(array_[i].first, key)) {
+        return const_iterator(array_ + i);
+      }
+    }
+    return const_iterator(array_ + size_);
+  }
+
+  // Invalidates iterators.
+  data_type& operator[](const key_type& key) {
+    key_equal compare;
+
+    if (UsingFullMap()) {
+      return map_[key];
+    }
+
+    // Search backwards to favor recently-added elements.
+    for (size_t i = size_; i > 0; --i) {
+      const size_t index = i - 1;
+      if (compare(array_[index].first, key)) {
+        return array_[index].second;
+      }
+    }
+
+    if (V8_UNLIKELY(size_ == kArraySize)) {
+      ConvertToRealMap();
+      return map_[key];
+    }
+
+    DCHECK(size_ < kArraySize);
+    new (&array_[size_]) value_type(key, data_type());
+    return array_[size_++].second;
+  }
+
+  // Invalidates iterators.
+  std::pair<iterator, bool> insert(const value_type& x) {
+    key_equal compare;
+
+    if (UsingFullMap()) {
+      std::pair<typename NormalMap::iterator, bool> ret = map_.insert(x);
+      return std::make_pair(iterator(ret.first), ret.second);
+    }
+
+    for (size_t i = 0; i < size_; ++i) {
+      if (compare(array_[i].first, x.first)) {
+        return std::make_pair(iterator(array_ + i), false);
+      }
+    }
+
+    if (V8_UNLIKELY(size_ == kArraySize)) {
+      ConvertToRealMap();  // Invalidates all iterators!
+      std::pair<typename NormalMap::iterator, bool> ret = map_.insert(x);
+      return std::make_pair(iterator(ret.first), ret.second);
+    }
+
+    DCHECK(size_ < kArraySize);
+    new (&array_[size_]) value_type(x);
+    return std::make_pair(iterator(array_ + size_++), true);
+  }
+
+  // Invalidates iterators.
+  template <class InputIterator>
+  void insert(InputIterator f, InputIterator l) {
+    while (f != l) {
+      insert(*f);
+      ++f;
+    }
+  }
+
+  // Invalidates iterators.
+  template <typename... Args>
+  std::pair<iterator, bool> emplace(Args&&... args) {
+    key_equal compare;
+
+    if (UsingFullMap()) {
+      std::pair<typename NormalMap::iterator, bool> ret =
+          map_.emplace(std::forward<Args>(args)...);
+      return std::make_pair(iterator(ret.first), ret.second);
+    }
+
+    value_type x(std::forward<Args>(args)...);
+    for (size_t i = 0; i < size_; ++i) {
+      if (compare(array_[i].first, x.first)) {
+        return std::make_pair(iterator(array_ + i), false);
+      }
+    }
+
+    if (V8_UNLIKELY(size_ == kArraySize)) {
+      ConvertToRealMap();  // Invalidates all iterators!
+      std::pair<typename NormalMap::iterator, bool> ret =
+          map_.emplace(std::move(x));
+      return std::make_pair(iterator(ret.first), ret.second);
+    }
+
+    DCHECK(size_ < kArraySize);
+    new (&array_[size_]) value_type(std::move(x));
+    return std::make_pair(iterator(array_ + size_++), true);
+  }
+
+  // Invalidates iterators.
+  template <typename... Args>
+  std::pair<iterator, bool> try_emplace(const key_type& key, Args&&... args) {
+    key_equal compare;
+
+    if (UsingFullMap()) {
+      std::pair<typename NormalMap::iterator, bool> ret =
+          map_.try_emplace(key, std::forward<Args>(args)...);
+      return std::make_pair(iterator(ret.first), ret.second);
+    }
+
+    for (size_t i = 0; i < size_; ++i) {
+      if (compare(array_[i].first, key)) {
+        return std::make_pair(iterator(array_ + i), false);
+      }
+    }
+
+    if (V8_UNLIKELY(size_ == kArraySize)) {
+      ConvertToRealMap();  // Invalidates all iterators!
+      std::pair<typename NormalMap::iterator, bool> ret =
+          map_.try_emplace(key, std::forward<Args>(args)...);
+      return std::make_pair(iterator(ret.first), ret.second);
+    }
+
+    DCHECK(size_ < kArraySize);
+    new (&array_[size_]) value_type(key, std::forward<Args>(args)...);
+    return std::make_pair(iterator(array_ + size_++), true);
+  }
+
+  iterator begin() {
+    return UsingFullMap() ? iterator(map_.begin()) : iterator(array_);
+  }
+
+  const_iterator begin() const {
+    return UsingFullMap() ? const_iterator(map_.begin())
+                          : const_iterator(array_);
+  }
+
+  iterator end() {
+    return UsingFullMap() ? iterator(map_.end()) : iterator(array_ + size_);
+  }
+
+  const_iterator end() const {
+    return UsingFullMap() ? const_iterator(map_.end())
+                          : const_iterator(array_ + size_);
+  }
+
+  void clear() {
+    if (UsingFullMap()) {
+      map_.~NormalMap();
+    } else {
+      for (size_t i = 0; i < size_; ++i) {
+        array_[i].~value_type();
+      }
+    }
+    size_ = 0;
+  }
+
+  // Invalidates iterators. Returns iterator following the last removed element.
+  iterator erase(const iterator& position) {
+    if (UsingFullMap()) {
+      return iterator(map_.erase(position.map_iter_));
+    }
+
+    size_t i = static_cast<size_t>(position.array_iter_ - array_);
+    // TODO(crbug.com/817982): When we have a checked iterator, this CHECK might
+    // not be necessary.
+    CHECK_LE(i, size_);
+    array_[i].~value_type();
+    --size_;
+    if (i != size_) {
+      new (&array_[i]) value_type(std::move(array_[size_]));
+      array_[size_].~value_type();
+      return iterator(array_ + i);
+    }
+    return end();
+  }
+
+  size_t erase(const key_type& key) {
+    iterator iter = find(key);
+    if (iter == end()) {
+      return 0;
+    }
+    erase(iter);
+    return 1;
+  }
+
+  size_t count(const key_type& key) const {
+    return (find(key) == end()) ? 0 : 1;
+  }
+
+  size_t size() const { return UsingFullMap() ? map_.size() : size_; }
+
+  bool empty() const { return UsingFullMap() ? map_.empty() : size_ == 0; }
+
+  // Returns true if we have fallen back to using the underlying map
+  // representation.
+  bool UsingFullMap() const { return size_ == kUsingFullMapSentinel; }
+
+  V8_INLINE NormalMap* map() {
+    CHECK(UsingFullMap());
+    return &map_;
+  }
+
+  V8_INLINE const NormalMap* map() const {
+    CHECK(UsingFullMap());
+    return &map_;
+  }
+
+ private:
+  // When `size_ == kUsingFullMapSentinel`, we have switched storage strategies
+  // from `array_[kArraySize] to `NormalMap map_`. See ConvertToRealMap and
+  // UsingFullMap.
+  size_t size_;
+
+  MapInit functor_;
+
+  // We want to call constructors and destructors manually, but we don't want
+  // to allocate and deallocate the memory used for them separately. Since
+  // array_ and map_ are mutually exclusive, we'll put them in a union.
+  union {
+    value_type array_[kArraySize];
+    NormalMap map_;
+  };
+
+  V8_NOINLINE V8_PRESERVE_MOST void ConvertToRealMap() {
+    // Storage for the elements in the temporary array. This is intentionally
+    // declared as a union to avoid having to default-construct |kArraySize|
+    // elements, only to move construct over them in the initial loop.
+    union Storage {
+      Storage() {}
+      ~Storage() {}
+      value_type array[kArraySize];
+    } temp;
+
+    // Move the current elements into a temporary array.
+    for (size_t i = 0; i < kArraySize; ++i) {
+      new (&temp.array[i]) value_type(std::move(array_[i]));
+      array_[i].~value_type();
+    }
+
+    // Initialize the map.
+    size_ = kUsingFullMapSentinel;
+    functor_(&map_);
+
+    // Insert elements into it.
+    for (size_t i = 0; i < kArraySize; ++i) {
+      map_.insert(std::move(temp.array[i]));
+      temp.array[i].~value_type();
+    }
+  }
+
+  // Helpers for constructors and destructors.
+  void InitFrom(const SmallMap& src) {
+    functor_ = src.functor_;
+    size_ = src.size_;
+    if (src.UsingFullMap()) {
+      functor_(&map_);
+      map_ = src.map_;
+    } else {
+      for (size_t i = 0; i < size_; ++i) {
+        new (&array_[i]) value_type(src.array_[i]);
+      }
+    }
+  }
+
+  void Destroy() {
+    if (UsingFullMap()) {
+      map_.~NormalMap();
+    } else {
+      for (size_t i = 0; i < size_; ++i) {
+        array_[i].~value_type();
+      }
+    }
+  }
+};
+
+}  // namespace v8::base
+
+#endif  // V8_BASE_SMALL_MAP_H_
diff --git a/deps/v8/src/base/small-vector.h b/deps/v8/src/base/small-vector.h
index 44085e86654980..4470b875e20ad9 100644
--- a/deps/v8/src/base/small-vector.h
+++ b/deps/v8/src/base/small-vector.h
@@ -28,8 +28,8 @@ class SmallVector {
  public:
   static constexpr size_t kInlineSize = kSize;
 
-  explicit SmallVector(const Allocator& allocator = Allocator())
-      : allocator_(allocator) {}
+  SmallVector() = default;
+  explicit SmallVector(const Allocator& allocator) : allocator_(allocator) {}
   explicit V8_INLINE SmallVector(size_t size,
                                  const Allocator& allocator = Allocator())
       : allocator_(allocator) {
@@ -63,6 +63,7 @@ class SmallVector {
   }
 
   ~SmallVector() {
+    static_assert(std::is_trivially_destructible_v<T>);
     if (is_big()) FreeDynamicStorage();
   }
 
@@ -165,9 +166,11 @@ class SmallVector {
   T* insert(T* pos, size_t count, const T& value) {
     DCHECK_LE(pos, end_);
     size_t offset = pos - begin_;
-    T* old_end = end_;
-    resize_no_init(size() + count);
+    size_t old_size = size();
+    resize_no_init(old_size + count);
     pos = begin_ + offset;
+    T* old_end = begin_ + old_size;
+    DCHECK_LE(old_end, end_);
     std::move_backward(pos, old_end, end_);
     std::fill_n(pos, count, value);
     return pos;
@@ -177,9 +180,11 @@ class SmallVector {
     DCHECK_LE(pos, end_);
     size_t offset = pos - begin_;
     size_t count = std::distance(begin, end);
-    T* old_end = end_;
-    resize_no_init(size() + count);
+    size_t old_size = size();
+    resize_no_init(old_size + count);
     pos = begin_ + offset;
+    T* old_end = begin_ + old_size;
+    DCHECK_LE(old_end, end_);
     std::move_backward(pos, old_end, end_);
     std::copy(begin, end, pos);
     return pos;
@@ -192,6 +197,12 @@ class SmallVector {
     end_ = begin_ + new_size;
   }
 
+  void reserve_no_init(size_t new_capacity) {
+    // Resizing without initialization is safe if T is trivially copyable.
+    ASSERT_TRIVIALLY_COPYABLE(T);
+    if (new_capacity > capacity()) Grow(new_capacity);
+  }
+
   // Clear without reverting back to inline storage.
   void clear() { end_ = begin_; }
 
diff --git a/deps/v8/src/base/template-utils.h b/deps/v8/src/base/template-utils.h
index 30c4785777c86d..8577d31fcd97b1 100644
--- a/deps/v8/src/base/template-utils.h
+++ b/deps/v8/src/base/template-utils.h
@@ -8,6 +8,7 @@
 #include <array>
 #include <functional>
 #include <iosfwd>
+#include <tuple>
 #include <type_traits>
 #include <utility>
 
@@ -72,20 +73,123 @@ using prepend_tuple_type = decltype(std::tuple_cat(
 
 namespace detail {
 
+template <size_t N, typename Tuple>
+constexpr bool NIsNotGreaterThanTupleSize =
+    N <= std::tuple_size_v<std::decay_t<Tuple>>;
+
 template <size_t N, typename T, size_t... Ints>
-auto tuple_drop_impl(const T& tpl, std::index_sequence<Ints...>) {
+constexpr auto tuple_slice_impl(const T& tpl, std::index_sequence<Ints...>) {
   return std::tuple{std::get<N + Ints>(tpl)...};
 }
 
+template <typename Tuple, typename Function, size_t... Index>
+constexpr auto tuple_for_each_impl(const Tuple& tpl, Function&& function,
+                                   std::index_sequence<Index...>) {
+  (function(std::get<Index>(tpl)), ...);
+}
+
+template <typename Tuple, typename Function, size_t... Index>
+constexpr auto tuple_for_each_with_index_impl(const Tuple& tpl,
+                                              Function&& function,
+                                              std::index_sequence<Index...>) {
+  (function(std::get<Index>(tpl), std::integral_constant<size_t, Index>()),
+   ...);
+}
+
 }  // namespace detail
 
+// Get the first N elements from a tuple.
+template <size_t N, typename Tuple>
+constexpr auto tuple_head(Tuple&& tpl) {
+  constexpr size_t total_size = std::tuple_size_v<std::decay_t<Tuple>>;
+  static_assert(N <= total_size);
+  return detail::tuple_slice_impl<0>(std::forward<Tuple>(tpl),
+                                     std::make_index_sequence<N>());
+}
+
 // Drop the first N elements from a tuple.
-template <size_t N, typename T>
-auto tuple_drop(const T& tpl) {
-  return detail::tuple_drop_impl<N>(
-      tpl, std::make_index_sequence<std::tuple_size_v<T> - N>());
+template <
+    size_t N, typename Tuple,
+    // If the user accidentally passes in an N that is larger than the tuple
+    // size, the unsigned subtraction will create a giant index sequence and
+    // crash the compiler. To avoid this and fail early, disable this function
+    // for invalid N.
+    typename = std::enable_if_t<detail::NIsNotGreaterThanTupleSize<N, Tuple>>>
+constexpr auto tuple_drop(Tuple&& tpl) {
+  constexpr size_t total_size = std::tuple_size_v<std::decay_t<Tuple>>;
+  static_assert(N <= total_size);
+  return detail::tuple_slice_impl<N>(
+      std::forward<Tuple>(tpl), std::make_index_sequence<total_size - N>());
 }
 
+// Calls `function(v)` for each `v` in the tuple.
+template <typename Tuple, typename Function>
+constexpr void tuple_for_each(Tuple&& tpl, Function&& function) {
+  detail::tuple_for_each_impl(
+      std::forward<Tuple>(tpl), function,
+      std::make_index_sequence<std::tuple_size_v<std::decay_t<Tuple>>>());
+}
+
+// Calls `function(v, i)` for each `v` in the tuple, with index `i`. The index
+// `i` is passed as an std::integral_constant<size_t>, rather than a raw size_t,
+// to allow it to be used
+template <typename Tuple, typename Function>
+constexpr void tuple_for_each_with_index(Tuple&& tpl, Function&& function) {
+  detail::tuple_for_each_with_index_impl(
+      std::forward<Tuple>(tpl), function,
+      std::make_index_sequence<std::tuple_size_v<std::decay_t<Tuple>>>());
+}
+
+#ifdef __clang__
+
+template <size_t N, typename... Ts>
+using nth_type = __type_pack_element<N, Ts...>;
+
+#else
+
+template <size_t N, typename... Ts>
+struct nth_type;
+
+template <typename T, typename... Ts>
+struct nth_type<0, T, Ts...> {
+  using type = T;
+};
+
+template <size_t N, typename T, typename... Ts>
+struct nth_type<N, T, Ts...> : public nth_type<N - 1, Ts...> {};
+
+#endif
+
+template <size_t N, typename... T>
+using nth_type_t = typename nth_type<N, T...>::type;
+
+// Find SearchT in Ts. SearchT must be present at most once in Ts, and returns
+// sizeof...(Ts) if not found.
+template <typename SearchT, typename... Ts>
+struct index_of_type;
+
+// Not found / empty list.
+template <typename SearchT>
+struct index_of_type<SearchT> : public std::integral_constant<size_t, 0> {};
+
+// SearchT found at head of list.
+template <typename SearchT, typename... Ts>
+struct index_of_type<SearchT, SearchT, Ts...>
+    : public std::integral_constant<size_t, 0> {
+  // SearchT is not allowed to be anywhere else in the list.
+  static_assert(index_of_type<SearchT, Ts...>::value == sizeof...(Ts));
+};
+
+// Recursion, SearchT not found at head of list.
+template <typename SearchT, typename T, typename... Ts>
+struct index_of_type<SearchT, T, Ts...>
+    : public std::integral_constant<size_t,
+                                    1 + index_of_type<SearchT, Ts...>::value> {
+};
+
+template <typename SearchT, typename... Ts>
+constexpr size_t index_of_type_v = index_of_type<SearchT, Ts...>::value;
+
 }  // namespace base
 }  // namespace v8
 
diff --git a/deps/v8/src/base/vector.h b/deps/v8/src/base/vector.h
index 96c72be2c1eca5..2c63240615a145 100644
--- a/deps/v8/src/base/vector.h
+++ b/deps/v8/src/base/vector.h
@@ -81,20 +81,27 @@ class Vector {
   const T& at(size_t index) const { return operator[](index); }
 
   T& first() { return start_[0]; }
+  const T& first() const { return start_[0]; }
 
   T& last() {
     DCHECK_LT(0, length_);
     return start_[length_ - 1];
   }
+  const T& last() const {
+    DCHECK_LT(0, length_);
+    return start_[length_ - 1];
+  }
 
   // Returns a pointer to the start of the data in the vector.
   constexpr T* begin() const { return start_; }
+  constexpr const T* cbegin() const { return start_; }
 
   // For consistency with other containers, do also provide a {data} accessor.
   constexpr T* data() const { return start_; }
 
   // Returns a pointer past the end of the data in the vector.
   constexpr T* end() const { return start_ + length_; }
+  constexpr const T* cend() const { return start_ + length_; }
 
   constexpr std::reverse_iterator<T*> rbegin() const {
     return std::make_reverse_iterator(end());
@@ -246,6 +253,13 @@ class OwnedVector {
   // compatibility with other sequential containers.
   constexpr T* data() const { return begin(); }
 
+  constexpr std::reverse_iterator<T*> rbegin() const {
+    return std::make_reverse_iterator(end());
+  }
+  constexpr std::reverse_iterator<T*> rend() const {
+    return std::make_reverse_iterator(begin());
+  }
+
   // Access individual vector elements - checks bounds in debug mode.
   T& operator[](size_t index) const {
     DCHECK_LT(index, length_);
diff --git a/deps/v8/src/base/virtual-address-space.cc b/deps/v8/src/base/virtual-address-space.cc
index 490a112e630ee7..b66c64693faa61 100644
--- a/deps/v8/src/base/virtual-address-space.cc
+++ b/deps/v8/src/base/virtual-address-space.cc
@@ -214,6 +214,10 @@ VirtualAddressSubspace::VirtualAddressSubspace(
 }
 
 VirtualAddressSubspace::~VirtualAddressSubspace() {
+  // TODO(chromium:1218005) here or in the RegionAllocator destructor we should
+  // assert that all allocations have been freed. Otherwise we may end up
+  // leaking memory on Windows because VirtualFree(subspace_base, 0) will then
+  // only free the first allocation in the subspace, not the entire subspace.
   parent_space_->FreeSubspace(this);
 }
 
diff --git a/deps/v8/src/base/vlq.h b/deps/v8/src/base/vlq.h
index f17652bb0c0085..225dcdf5534e95 100644
--- a/deps/v8/src/base/vlq.h
+++ b/deps/v8/src/base/vlq.h
@@ -23,10 +23,10 @@ static constexpr uint32_t kDataMask = kContinueBit - 1;
 // writing it.
 template <typename Function>
 inline typename std::enable_if<
-    std::is_same<decltype(std::declval<Function>()(0)), byte*>::value,
+    std::is_same<decltype(std::declval<Function>()(0)), uint8_t*>::value,
     void>::type
 VLQEncodeUnsigned(Function&& process_byte, uint32_t value) {
-  byte* written_byte = process_byte(value);
+  uint8_t* written_byte = process_byte(value);
   if (value <= kDataMask) {
     // Value fits in first byte, early return.
     return;
@@ -53,7 +53,7 @@ inline uint32_t VLQConvertToUnsigned(int32_t value) {
 // process_byte function.
 template <typename Function>
 inline typename std::enable_if<
-    std::is_same<decltype(std::declval<Function>()(0)), byte*>::value,
+    std::is_same<decltype(std::declval<Function>()(0)), uint8_t*>::value,
     void>::type
 VLQEncode(Function&& process_byte, int32_t value) {
   uint32_t bits = VLQConvertToUnsigned(value);
@@ -62,9 +62,9 @@ VLQEncode(Function&& process_byte, int32_t value) {
 
 // Wrapper of VLQEncode for std::vector backed storage containers.
 template <typename A>
-inline void VLQEncode(std::vector<byte, A>* data, int32_t value) {
+inline void VLQEncode(std::vector<uint8_t, A>* data, int32_t value) {
   VLQEncode(
-      [data](byte value) {
+      [data](uint8_t value) {
         data->push_back(value);
         return &data->back();
       },
@@ -73,9 +73,9 @@ inline void VLQEncode(std::vector<byte, A>* data, int32_t value) {
 
 // Wrapper of VLQEncodeUnsigned for std::vector backed storage containers.
 template <typename A>
-inline void VLQEncodeUnsigned(std::vector<byte, A>* data, uint32_t value) {
+inline void VLQEncodeUnsigned(std::vector<uint8_t, A>* data, uint32_t value) {
   VLQEncodeUnsigned(
-      [data](byte value) {
+      [data](uint8_t value) {
         data->push_back(value);
         return &data->back();
       },
@@ -86,10 +86,10 @@ inline void VLQEncodeUnsigned(std::vector<byte, A>* data, uint32_t value) {
 // successive calls to the given function.
 template <typename GetNextFunction>
 inline typename std::enable_if<
-    std::is_same<decltype(std::declval<GetNextFunction>()()), byte>::value,
+    std::is_same<decltype(std::declval<GetNextFunction>()()), uint8_t>::value,
     uint32_t>::type
 VLQDecodeUnsigned(GetNextFunction&& get_next) {
-  byte cur_byte = get_next();
+  uint8_t cur_byte = get_next();
   // Single byte fast path; no need to mask.
   if (cur_byte <= kDataMask) {
     return cur_byte;
@@ -106,13 +106,13 @@ VLQDecodeUnsigned(GetNextFunction&& get_next) {
 // Decodes a variable-length encoded unsigned value stored in contiguous memory
 // starting at data_start + index, updating index to where the next encoded
 // value starts.
-inline uint32_t VLQDecodeUnsigned(byte* data_start, int* index) {
+inline uint32_t VLQDecodeUnsigned(uint8_t* data_start, int* index) {
   return VLQDecodeUnsigned([&] { return data_start[(*index)++]; });
 }
 
 // Decodes a variable-length encoded value stored in contiguous memory starting
 // at data_start + index, updating index to where the next encoded value starts.
-inline int32_t VLQDecode(byte* data_start, int* index) {
+inline int32_t VLQDecode(uint8_t* data_start, int* index) {
   uint32_t bits = VLQDecodeUnsigned(data_start, index);
   bool is_negative = (bits & 1) == 1;
   int32_t result = bits >> 1;
diff --git a/deps/v8/src/baseline/arm/baseline-assembler-arm-inl.h b/deps/v8/src/baseline/arm/baseline-assembler-arm-inl.h
index b63499c85cc038..e5fb71dd20ca91 100644
--- a/deps/v8/src/baseline/arm/baseline-assembler-arm-inl.h
+++ b/deps/v8/src/baseline/arm/baseline-assembler-arm-inl.h
@@ -150,7 +150,7 @@ void BaselineAssembler::JumpIfPointer(Condition cc, Register value,
   __ ldr(tmp, operand);
   JumpIf(cc, value, Operand(tmp), target);
 }
-void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Smi smi,
+void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
                                   Label* target, Label::Distance) {
   __ AssertSmi(value);
   JumpIf(cc, value, Operand(smi), target);
@@ -185,7 +185,7 @@ void BaselineAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
 void BaselineAssembler::Move(interpreter::Register output, Register source) {
   Move(RegisterFrameOperand(output), source);
 }
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   __ mov(output, Operand(value.ptr()));
 }
 void BaselineAssembler::Move(MemOperand output, Register source) {
@@ -345,7 +345,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
 }
 
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   ASM_CODE_COMMENT(masm_);
   ScratchRegisterScope temps(this);
   Register tmp = temps.AcquireScratch();
@@ -488,7 +488,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   __ add(lhs, lhs, Operand(rhs));
 }
 
@@ -498,25 +498,8 @@ void BaselineAssembler::Word32And(Register output, Register lhs, int rhs) {
 
 void BaselineAssembler::Switch(Register reg, int case_value_base,
                                Label** labels, int num_labels) {
-  ASM_CODE_COMMENT(masm_);
-  Label fallthrough;
-  if (case_value_base != 0) {
-    __ sub(reg, reg, Operand(case_value_base));
-  }
-
-  // Mostly copied from code-generator-arm.cc
-  ScratchRegisterScope scope(this);
-  JumpIf(kUnsignedGreaterThanEqual, reg, Operand(num_labels), &fallthrough);
-  // Ensure to emit the constant pool first if necessary.
-  __ CheckConstPool(true, true);
-  __ BlockConstPoolFor(num_labels);
-  int entry_size_log2 = 2;
-  __ add(pc, pc, Operand(reg, LSL, entry_size_log2), LeaveCC, lo);
-  __ b(&fallthrough);
-  for (int i = 0; i < num_labels; ++i) {
-    __ b(labels[i]);
-  }
-  __ bind(&fallthrough);
+  __ MacroAssembler::Switch(Register::no_reg(), reg, case_value_base, labels,
+                            num_labels);
 }
 
 #undef __
diff --git a/deps/v8/src/baseline/arm64/baseline-assembler-arm64-inl.h b/deps/v8/src/baseline/arm64/baseline-assembler-arm64-inl.h
index 6aa1419e920f2f..77d29bb8981451 100644
--- a/deps/v8/src/baseline/arm64/baseline-assembler-arm64-inl.h
+++ b/deps/v8/src/baseline/arm64/baseline-assembler-arm64-inl.h
@@ -167,7 +167,7 @@ void BaselineAssembler::JumpIfPointer(Condition cc, Register value,
   __ Ldr(tmp, operand);
   JumpIf(cc, value, tmp, target);
 }
-void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Smi smi,
+void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
                                   Label* target, Label::Distance distance) {
   __ AssertSmi(value);
   __ CompareTaggedAndBranch(value, smi, cc, target);
@@ -203,7 +203,7 @@ void BaselineAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
 void BaselineAssembler::Move(interpreter::Register output, Register source) {
   Move(RegisterFrameOperand(output), source);
 }
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   __ Mov(output, Immediate(value.ptr()));
 }
 void BaselineAssembler::Move(MemOperand output, Register source) {
@@ -420,7 +420,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
 }
 
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   ASM_CODE_COMMENT(masm_);
   ScratchRegisterScope temps(this);
   Register tmp = temps.AcquireScratch();
@@ -448,8 +448,9 @@ void BaselineAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
                                                 FeedbackSlot slot,
                                                 Label* on_result,
                                                 Label::Distance) {
-  __ TryLoadOptimizedOsrCode(scratch_and_result, feedback_vector, slot,
-                             on_result, Label::Distance::kFar);
+  __ TryLoadOptimizedOsrCode(scratch_and_result, CodeKind::MAGLEV,
+                             feedback_vector, slot, on_result,
+                             Label::Distance::kFar);
 }
 
 void BaselineAssembler::AddToInterruptBudgetAndJumpIfNotExceeded(
@@ -545,7 +546,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   if (SmiValuesAre31Bits()) {
     __ Add(lhs.W(), lhs.W(), Immediate(rhs));
   } else {
diff --git a/deps/v8/src/baseline/baseline-assembler-inl.h b/deps/v8/src/baseline/baseline-assembler-inl.h
index 71c4e7a5eb6e6b..9fba6a927bd18a 100644
--- a/deps/v8/src/baseline/baseline-assembler-inl.h
+++ b/deps/v8/src/baseline/baseline-assembler-inl.h
@@ -48,7 +48,7 @@ namespace baseline {
 
 #define __ masm_->
 
-void BaselineAssembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+void BaselineAssembler::GetCode(LocalIsolate* isolate, CodeDesc* desc) {
   __ GetCode(isolate, desc);
 }
 int BaselineAssembler::pc_offset() const { return __ pc_offset(); }
@@ -103,7 +103,7 @@ void BaselineAssembler::Move(Register output, Register source) {
 void BaselineAssembler::Move(Register output, MemOperand operand) {
   __ Move(output, operand);
 }
-void BaselineAssembler::Move(Register output, Smi value) {
+void BaselineAssembler::Move(Register output, Tagged<Smi> value) {
   __ Move(output, value);
 }
 
@@ -144,15 +144,6 @@ void BaselineAssembler::DecodeField(Register reg) {
   __ DecodeField<Field>(reg);
 }
 
-SaveAccumulatorScope::SaveAccumulatorScope(BaselineAssembler* assembler)
-    : assembler_(assembler) {
-  assembler_->Push(kInterpreterAccumulatorRegister);
-}
-
-SaveAccumulatorScope::~SaveAccumulatorScope() {
-  assembler_->Pop(kInterpreterAccumulatorRegister);
-}
-
 EnsureAccumulatorPreservedScope::EnsureAccumulatorPreservedScope(
     BaselineAssembler* assembler)
     : assembler_(assembler)
diff --git a/deps/v8/src/baseline/baseline-assembler.h b/deps/v8/src/baseline/baseline-assembler.h
index 6910df9ec837ac..41f3c22df398fa 100644
--- a/deps/v8/src/baseline/baseline-assembler.h
+++ b/deps/v8/src/baseline/baseline-assembler.h
@@ -11,6 +11,7 @@
 #if ENABLE_SPARKPLUG
 
 #include "src/codegen/macro-assembler.h"
+#include "src/interpreter/bytecode-register.h"
 #include "src/objects/tagged-index.h"
 
 namespace v8 {
@@ -30,7 +31,7 @@ class BaselineAssembler {
   inline MemOperand FunctionOperand();
   inline MemOperand FeedbackVectorOperand();
 
-  inline void GetCode(Isolate* isolate, CodeDesc* desc);
+  inline void GetCode(LocalIsolate* isolate, CodeDesc* desc);
   inline int pc_offset() const;
   inline void CodeEntry() const;
   inline void ExceptionHandler() const;
@@ -82,8 +83,8 @@ class BaselineAssembler {
                             Label* target,
                             Label::Distance distance = Label::kFar);
   inline Condition CheckSmi(Register value);
-  inline void JumpIfSmi(Condition cc, Register value, Smi smi, Label* target,
-                        Label::Distance distance = Label::kFar);
+  inline void JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
+                        Label* target, Label::Distance distance = Label::kFar);
   inline void JumpIfSmi(Condition cc, Register lhs, Register rhs, Label* target,
                         Label::Distance distance = Label::kFar);
   inline void JumpIfImmediate(Condition cc, Register left, int right,
@@ -104,8 +105,8 @@ class BaselineAssembler {
 
   inline void Move(Register output, Register source);
   inline void Move(Register output, MemOperand operand);
-  inline void Move(Register output, Smi value);
-  inline void Move(Register output, TaggedIndex value);
+  inline void Move(Register output, Tagged<Smi> value);
+  inline void Move(Register output, Tagged<TaggedIndex> value);
   inline void Move(Register output, interpreter::Register source);
   inline void Move(interpreter::Register output, Register source);
   inline void Move(Register output, RootIndex source);
@@ -165,7 +166,8 @@ class BaselineAssembler {
   inline void LoadWord16FieldZeroExtend(Register output, Register source,
                                         int offset);
   inline void LoadWord8Field(Register output, Register source, int offset);
-  inline void StoreTaggedSignedField(Register target, int offset, Smi value);
+  inline void StoreTaggedSignedField(Register target, int offset,
+                                     Tagged<Smi> value);
   inline void StoreTaggedFieldWithWriteBarrier(Register target, int offset,
                                                Register value);
   inline void StoreTaggedFieldNoWriteBarrier(Register target, int offset,
@@ -212,7 +214,7 @@ class BaselineAssembler {
   inline void StaModuleVariable(Register context, Register value,
                                 int cell_index, uint32_t depth);
 
-  inline void AddSmi(Register lhs, Smi rhs);
+  inline void AddSmi(Register lhs, Tagged<Smi> rhs);
   inline void SmiUntag(Register value);
   inline void SmiUntag(Register output, Register value);
 
@@ -239,16 +241,6 @@ class BaselineAssembler {
   ScratchRegisterScope* scratch_register_scope_ = nullptr;
 };
 
-class SaveAccumulatorScope final {
- public:
-  inline explicit SaveAccumulatorScope(BaselineAssembler* assembler);
-
-  inline ~SaveAccumulatorScope();
-
- private:
-  BaselineAssembler* assembler_;
-};
-
 class EnsureAccumulatorPreservedScope final {
  public:
   inline explicit EnsureAccumulatorPreservedScope(BaselineAssembler* assembler);
diff --git a/deps/v8/src/baseline/baseline-batch-compiler.cc b/deps/v8/src/baseline/baseline-batch-compiler.cc
index e746113eb5701e..db634068dd3597 100644
--- a/deps/v8/src/baseline/baseline-batch-compiler.cc
+++ b/deps/v8/src/baseline/baseline-batch-compiler.cc
@@ -27,18 +27,18 @@ namespace v8 {
 namespace internal {
 namespace baseline {
 
-static bool CanCompileWithConcurrentBaseline(SharedFunctionInfo shared,
+static bool CanCompileWithConcurrentBaseline(Tagged<SharedFunctionInfo> shared,
                                              Isolate* isolate) {
-  return !shared.HasBaselineCode() && CanCompileWithBaseline(isolate, shared);
+  return !shared->HasBaselineCode() && CanCompileWithBaseline(isolate, shared);
 }
 
 class BaselineCompilerTask {
  public:
   BaselineCompilerTask(Isolate* isolate, PersistentHandles* handles,
-                       SharedFunctionInfo sfi)
+                       Tagged<SharedFunctionInfo> sfi)
       : shared_function_info_(handles->NewHandle(sfi)),
-        bytecode_(handles->NewHandle(sfi.GetBytecodeArray(isolate))) {
-    DCHECK(sfi.is_compiled());
+        bytecode_(handles->NewHandle(sfi->GetBytecodeArray(isolate))) {
+    DCHECK(sfi->is_compiled());
     shared_function_info_->set_is_sparkplug_compiling(true);
   }
 
@@ -47,17 +47,12 @@ class BaselineCompilerTask {
 
   // Executed in the background thread.
   void Compile(LocalIsolate* local_isolate) {
-    base::ElapsedTimer timer;
-    timer.Start();
+    base::ScopedTimer timer(v8_flags.log_function_events ? &time_taken_
+                                                         : nullptr);
     BaselineCompiler compiler(local_isolate, shared_function_info_, bytecode_);
     compiler.GenerateCode();
     maybe_code_ = local_isolate->heap()->NewPersistentMaybeHandle(
         compiler.Build(local_isolate));
-    Handle<Code> code;
-    if (maybe_code_.ToHandle(&code)) {
-      local_isolate->heap()->RegisterCodeObject(code);
-    }
-    time_taken_ms_ = timer.Elapsed().InMillisecondsF();
   }
 
   // Executed in the main thread.
@@ -66,7 +61,7 @@ class BaselineCompilerTask {
     Handle<Code> code;
     if (!maybe_code_.ToHandle(&code)) return;
     if (v8_flags.print_code) {
-      code->Print();
+      Print(*code);
     }
     // Don't install the code if the bytecode has been flushed or has
     // already some baseline code installed.
@@ -75,21 +70,23 @@ class BaselineCompilerTask {
     }
 
     shared_function_info_->set_baseline_code(*code, kReleaseStore);
+    shared_function_info_->set_age(0);
     if (v8_flags.trace_baseline_concurrent_compilation) {
       CodeTracer::Scope scope(isolate->GetCodeTracer());
       std::stringstream ss;
       ss << "[Concurrent Sparkplug Off Thread] Function ";
-      shared_function_info_->ShortPrint(ss);
+      ShortPrint(*shared_function_info_, ss);
       ss << " installed\n";
       OFStream os(scope.file());
       os << ss.str();
     }
-    if (shared_function_info_->script().IsScript()) {
+    if (IsScript(shared_function_info_->script())) {
       Compiler::LogFunctionCompilation(
           isolate, LogEventListener::CodeTag::kFunction,
           handle(Script::cast(shared_function_info_->script()), isolate),
           shared_function_info_, Handle<FeedbackVector>(),
-          Handle<AbstractCode>::cast(code), CodeKind::BASELINE, time_taken_ms_);
+          Handle<AbstractCode>::cast(code), CodeKind::BASELINE,
+          time_taken_.InMillisecondsF());
     }
   }
 
@@ -97,7 +94,7 @@ class BaselineCompilerTask {
   Handle<SharedFunctionInfo> shared_function_info_;
   Handle<BytecodeArray> bytecode_;
   MaybeHandle<Code> maybe_code_;
-  double time_taken_ms_;
+  base::TimeDelta time_taken_;
 };
 
 class BaselineBatchCompilerJob {
@@ -110,14 +107,14 @@ class BaselineBatchCompilerJob {
       MaybeObject maybe_sfi = task_queue->Get(i);
       // TODO(victorgomes): Do I need to clear the value?
       task_queue->Set(i, HeapObjectReference::ClearedValue(isolate));
-      HeapObject obj;
+      Tagged<HeapObject> obj;
       // Skip functions where weak reference is no longer valid.
       if (!maybe_sfi.GetHeapObjectIfWeak(&obj)) continue;
       // Skip functions where the bytecode has been flushed.
-      SharedFunctionInfo shared = SharedFunctionInfo::cast(obj);
+      Tagged<SharedFunctionInfo> shared = SharedFunctionInfo::cast(obj);
       if (!CanCompileWithConcurrentBaseline(shared, isolate)) continue;
       // Skip functions that are already being compiled.
-      if (shared.is_sparkplug_compiling()) continue;
+      if (shared->is_sparkplug_compiling()) continue;
       tasks_.emplace_back(isolate, handles_.get(), shared);
     }
     if (v8_flags.trace_baseline_concurrent_compilation) {
@@ -163,15 +160,10 @@ class ConcurrentBaselineCompiler {
           outgoing_queue_(outcoming_queue) {}
 
     void Run(JobDelegate* delegate) override {
-      RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
       LocalIsolate local_isolate(isolate_, ThreadKind::kBackground);
       UnparkedScope unparked_scope(&local_isolate);
       LocalHandleScope handle_scope(&local_isolate);
 
-      // Since we're going to compile an entire batch, this guarantees that
-      // we only switch back the memory chunks to RX at the end.
-      CodePageCollectionMemoryModificationScope batch_alloc(isolate_->heap());
-
       while (!incoming_queue_->IsEmpty() && !delegate->ShouldYield()) {
         std::unique_ptr<BaselineBatchCompilerJob> job;
         if (!incoming_queue_->Dequeue(&job)) break;
@@ -184,10 +176,11 @@ class ConcurrentBaselineCompiler {
 
     size_t GetMaxConcurrency(size_t worker_count) const override {
       size_t max_threads = v8_flags.concurrent_sparkplug_max_threads;
+      size_t num_tasks = incoming_queue_->size() + worker_count;
       if (max_threads > 0) {
-        return std::min(max_threads, incoming_queue_->size());
+        return std::min(max_threads, num_tasks);
       }
-      return incoming_queue_->size();
+      return num_tasks;
     }
 
    private:
@@ -263,7 +256,7 @@ void BaselineBatchCompiler::EnqueueFunction(Handle<JSFunction> function) {
   // Immediately compile the function if batch compilation is disabled.
   if (!is_enabled()) {
     IsCompiledScope is_compiled_scope(
-        function->shared().is_compiled_scope(isolate_));
+        function->shared()->is_compiled_scope(isolate_));
     Compiler::CompileBaseline(isolate_, function, Compiler::CLEAR_EXCEPTION,
                               &is_compiled_scope);
     return;
@@ -279,7 +272,7 @@ void BaselineBatchCompiler::EnqueueFunction(Handle<JSFunction> function) {
   }
 }
 
-void BaselineBatchCompiler::EnqueueSFI(SharedFunctionInfo shared) {
+void BaselineBatchCompiler::EnqueueSFI(Tagged<SharedFunctionInfo> shared) {
   if (!v8_flags.concurrent_sparkplug || !is_enabled()) return;
   if (ShouldCompileBatch(shared)) {
     CompileBatchConcurrent(shared);
@@ -315,10 +308,9 @@ void BaselineBatchCompiler::EnsureQueueCapacity() {
 }
 
 void BaselineBatchCompiler::CompileBatch(Handle<JSFunction> function) {
-  CodePageCollectionMemoryModificationScope batch_allocation(isolate_->heap());
   {
     IsCompiledScope is_compiled_scope(
-        function->shared().is_compiled_scope(isolate_));
+        function->shared()->is_compiled_scope(isolate_));
     Compiler::CompileBaseline(isolate_, function, Compiler::CLEAR_EXCEPTION,
                               &is_compiled_scope);
   }
@@ -330,31 +322,33 @@ void BaselineBatchCompiler::CompileBatch(Handle<JSFunction> function) {
   ClearBatch();
 }
 
-void BaselineBatchCompiler::CompileBatchConcurrent(SharedFunctionInfo shared) {
+void BaselineBatchCompiler::CompileBatchConcurrent(
+    Tagged<SharedFunctionInfo> shared) {
   Enqueue(Handle<SharedFunctionInfo>(shared, isolate_));
   concurrent_compiler_->CompileBatch(compilation_queue_, last_index_);
   ClearBatch();
 }
 
-bool BaselineBatchCompiler::ShouldCompileBatch(SharedFunctionInfo shared) {
+bool BaselineBatchCompiler::ShouldCompileBatch(
+    Tagged<SharedFunctionInfo> shared) {
   // Early return if the function is compiled with baseline already or it is not
   // suitable for baseline compilation.
-  if (shared.HasBaselineCode()) return false;
+  if (shared->HasBaselineCode()) return false;
   // If we're already compiling this function, return.
-  if (shared.is_sparkplug_compiling()) return false;
+  if (shared->is_sparkplug_compiling()) return false;
   if (!CanCompileWithBaseline(isolate_, shared)) return false;
 
   int estimated_size;
   {
     DisallowHeapAllocation no_gc;
     estimated_size = BaselineCompiler::EstimateInstructionSize(
-        shared.GetBytecodeArray(isolate_));
+        shared->GetBytecodeArray(isolate_));
   }
   estimated_instruction_size_ += estimated_size;
   if (v8_flags.trace_baseline_batch_compilation) {
     CodeTracer::Scope trace_scope(isolate_->GetCodeTracer());
     PrintF(trace_scope.file(), "[Baseline batch compilation] Enqueued SFI %s",
-           shared.DebugNameCStr().get());
+           shared->DebugNameCStr().get());
     PrintF(trace_scope.file(),
            " with estimated size %d (current budget: %d/%d)\n", estimated_size,
            estimated_instruction_size_,
@@ -375,7 +369,7 @@ bool BaselineBatchCompiler::ShouldCompileBatch(SharedFunctionInfo shared) {
 }
 
 bool BaselineBatchCompiler::MaybeCompileFunction(MaybeObject maybe_sfi) {
-  HeapObject heapobj;
+  Tagged<HeapObject> heapobj;
   // Skip functions where the weak reference is no longer valid.
   if (!maybe_sfi.GetHeapObjectIfWeak(&heapobj)) return false;
   Handle<SharedFunctionInfo> shared =
diff --git a/deps/v8/src/baseline/baseline-batch-compiler.h b/deps/v8/src/baseline/baseline-batch-compiler.h
index a7915c3128fe20..9bb30b32c72b91 100644
--- a/deps/v8/src/baseline/baseline-batch-compiler.h
+++ b/deps/v8/src/baseline/baseline-batch-compiler.h
@@ -25,7 +25,7 @@ class BaselineBatchCompiler {
   ~BaselineBatchCompiler();
   // Enqueues SharedFunctionInfo of |function| for compilation.
   void EnqueueFunction(Handle<JSFunction> function);
-  void EnqueueSFI(SharedFunctionInfo shared);
+  void EnqueueSFI(Tagged<SharedFunctionInfo> shared);
 
   void set_enabled(bool enabled) { enabled_ = enabled; }
   bool is_enabled() { return enabled_; }
@@ -42,13 +42,13 @@ class BaselineBatchCompiler {
 
   // Returns true if the current batch exceeds the threshold and should be
   // compiled.
-  bool ShouldCompileBatch(SharedFunctionInfo shared);
+  bool ShouldCompileBatch(Tagged<SharedFunctionInfo> shared);
 
   // Compiles the current batch.
   void CompileBatch(Handle<JSFunction> function);
 
   // Compiles the current batch concurrently.
-  void CompileBatchConcurrent(SharedFunctionInfo shared);
+  void CompileBatchConcurrent(Tagged<SharedFunctionInfo> shared);
 
   // Resets the current batch.
   void ClearBatch();
diff --git a/deps/v8/src/baseline/baseline-compiler.cc b/deps/v8/src/baseline/baseline-compiler.cc
index 185d5f49ddf782..1252af976e0160 100644
--- a/deps/v8/src/baseline/baseline-compiler.cc
+++ b/deps/v8/src/baseline/baseline-compiler.cc
@@ -79,7 +79,7 @@ namespace detail {
 bool Clobbers(Register target, Register reg) { return target == reg; }
 bool Clobbers(Register target, Handle<Object> handle) { return false; }
 bool Clobbers(Register target, Smi smi) { return false; }
-bool Clobbers(Register target, TaggedIndex index) { return false; }
+bool Clobbers(Register target, Tagged<TaggedIndex> index) { return false; }
 bool Clobbers(Register target, int32_t imm) { return false; }
 bool Clobbers(Register target, RootIndex index) { return false; }
 bool Clobbers(Register target, interpreter::Register reg) { return false; }
@@ -95,9 +95,9 @@ bool MachineTypeMatches(MachineType type, Handle<HeapObject> handle) {
 bool MachineTypeMatches(MachineType type, Smi handle) {
   return type.IsTagged() && !type.IsTaggedPointer();
 }
-bool MachineTypeMatches(MachineType type, TaggedIndex handle) {
-  // TaggedIndex doesn't have a separate type, so check for the same type as for
-  // Smis.
+bool MachineTypeMatches(MachineType type, Tagged<TaggedIndex> handle) {
+  // Tagged<TaggedIndex> doesn't have a separate type, so check for the same
+  // type as for Smis.
   return type.IsTagged() && !type.IsTaggedPointer();
 }
 bool MachineTypeMatches(MachineType type, int32_t imm) {
@@ -287,7 +287,7 @@ BaselineCompiler::BaselineCompiler(
       basm_(&masm_),
       iterator_(bytecode_),
       zone_(local_isolate->allocator(), ZONE_NAME),
-      labels_(zone_.NewArray<BaselineLabelPointer>(bytecode_->length())) {
+      labels_(zone_.AllocateArray<BaselineLabelPointer>(bytecode_->length())) {
   MemsetPointer(reinterpret_cast<Address*>(labels_), Address{0},
                 bytecode_->length());
 
@@ -339,7 +339,7 @@ void BaselineCompiler::GenerateCode() {
 
 MaybeHandle<Code> BaselineCompiler::Build(LocalIsolate* local_isolate) {
   CodeDesc desc;
-  __ GetCode(local_isolate->GetMainThreadIsolateUnsafe(), &desc);
+  __ GetCode(local_isolate, &desc);
 
   // Allocate the bytecode offset table.
   Handle<ByteArray> bytecode_offset_table =
@@ -356,8 +356,8 @@ MaybeHandle<Code> BaselineCompiler::Build(LocalIsolate* local_isolate) {
   return code_builder.TryBuild();
 }
 
-int BaselineCompiler::EstimateInstructionSize(BytecodeArray bytecode) {
-  return bytecode.length() * kAverageBytecodeToInstructionRatio;
+int BaselineCompiler::EstimateInstructionSize(Tagged<BytecodeArray> bytecode) {
+  return bytecode->length() * kAverageBytecodeToInstructionRatio;
 }
 
 interpreter::Register BaselineCompiler::RegisterOperand(int operand_index) {
@@ -369,11 +369,17 @@ void BaselineCompiler::LoadRegister(Register output, int operand_index) {
 }
 
 void BaselineCompiler::StoreRegister(int operand_index, Register value) {
+#ifdef DEBUG
+  effect_state_.CheckEffect();
+#endif
   __ Move(RegisterOperand(operand_index), value);
 }
 
 void BaselineCompiler::StoreRegisterPair(int operand_index, Register val0,
                                          Register val1) {
+#ifdef DEBUG
+  effect_state_.CheckEffect();
+#endif
   interpreter::Register reg0, reg1;
   std::tie(reg0, reg1) = iterator().GetRegisterPairOperand(operand_index);
   __ StoreRegister(reg0, val0);
@@ -384,7 +390,7 @@ Handle<Type> BaselineCompiler::Constant(int operand_index) {
   return Handle<Type>::cast(
       iterator().GetConstantForIndexOperand(operand_index, local_isolate_));
 }
-Smi BaselineCompiler::ConstantSmi(int operand_index) {
+Tagged<Smi> BaselineCompiler::ConstantSmi(int operand_index) {
   return iterator().GetConstantAtIndexAsSmi(operand_index);
 }
 template <typename Type>
@@ -409,22 +415,22 @@ uint32_t BaselineCompiler::Flag16(int operand_index) {
 uint32_t BaselineCompiler::RegisterCount(int operand_index) {
   return iterator().GetRegisterCountOperand(operand_index);
 }
-TaggedIndex BaselineCompiler::IndexAsTagged(int operand_index) {
+Tagged<TaggedIndex> BaselineCompiler::IndexAsTagged(int operand_index) {
   return TaggedIndex::FromIntptr(Index(operand_index));
 }
-TaggedIndex BaselineCompiler::UintAsTagged(int operand_index) {
+Tagged<TaggedIndex> BaselineCompiler::UintAsTagged(int operand_index) {
   return TaggedIndex::FromIntptr(Uint(operand_index));
 }
-Smi BaselineCompiler::IndexAsSmi(int operand_index) {
+Tagged<Smi> BaselineCompiler::IndexAsSmi(int operand_index) {
   return Smi::FromInt(Index(operand_index));
 }
-Smi BaselineCompiler::IntAsSmi(int operand_index) {
+Tagged<Smi> BaselineCompiler::IntAsSmi(int operand_index) {
   return Smi::FromInt(Int(operand_index));
 }
-Smi BaselineCompiler::Flag8AsSmi(int operand_index) {
+Tagged<Smi> BaselineCompiler::Flag8AsSmi(int operand_index) {
   return Smi::FromInt(Flag8(operand_index));
 }
-Smi BaselineCompiler::Flag16AsSmi(int operand_index) {
+Tagged<Smi> BaselineCompiler::Flag16AsSmi(int operand_index) {
   return Smi::FromInt(Flag16(operand_index));
 }
 
@@ -493,6 +499,9 @@ void BaselineCompiler::PreVisitSingleBytecode() {
 }
 
 void BaselineCompiler::VisitSingleBytecode() {
+#ifdef DEBUG
+  effect_state_.clear();
+#endif
   int offset = iterator().current_offset();
   BaselineLabelPointer label = labels_[offset];
   if (label.GetPointer()) __ Bind(label.GetPointer());
@@ -578,7 +587,7 @@ void BaselineCompiler::TraceBytecode(Runtime::FunctionId function_id) {
                           function_id == Runtime::kTraceUnoptimizedBytecodeEntry
                               ? "Trace bytecode entry"
                               : "Trace bytecode exit");
-  SaveAccumulatorScope accumulator_scope(&basm_);
+  SaveAccumulatorScope accumulator_scope(this, &basm_);
   CallRuntime(function_id, bytecode_,
               Smi::FromInt(BytecodeArray::kHeaderSize - kHeapObjectTag +
                            iterator().current_offset()),
@@ -596,41 +605,34 @@ INTRINSICS_LIST(DECLARE_VISITOR)
 #undef DECLARE_VISITOR
 
 void BaselineCompiler::UpdateInterruptBudgetAndJumpToLabel(
-    int weight, Label* label, Label* skip_interrupt_label) {
+    int weight, Label* label, Label* skip_interrupt_label,
+    StackCheckBehavior stack_check_behavior) {
   if (weight != 0) {
     ASM_CODE_COMMENT(&masm_);
     __ AddToInterruptBudgetAndJumpIfNotExceeded(weight, skip_interrupt_label);
 
-    if (weight < 0) {
-      SaveAccumulatorScope accumulator_scope(&basm_);
-      CallRuntime(Runtime::kBytecodeBudgetInterruptWithStackCheck_Sparkplug,
-                  __ FunctionOperand());
-    }
+    DCHECK_LT(weight, 0);
+    CallRuntime(stack_check_behavior == kEnableStackCheck
+                    ? Runtime::kBytecodeBudgetInterruptWithStackCheck_Sparkplug
+                    : Runtime::kBytecodeBudgetInterrupt_Sparkplug,
+                __ FunctionOperand());
   }
   if (label) __ Jump(label);
 }
 
-void BaselineCompiler::UpdateInterruptBudgetAndDoInterpreterJump() {
-  int weight = iterator().GetRelativeJumpTargetOffset() -
-               iterator().current_bytecode_size_without_prefix();
-  UpdateInterruptBudgetAndJumpToLabel(weight, BuildForwardJumpLabel(), nullptr);
-}
-
-void BaselineCompiler::UpdateInterruptBudgetAndDoInterpreterJumpIfRoot(
-    RootIndex root) {
+void BaselineCompiler::JumpIfRoot(RootIndex root) {
   Label dont_jump;
   __ JumpIfNotRoot(kInterpreterAccumulatorRegister, root, &dont_jump,
                    Label::kNear);
-  UpdateInterruptBudgetAndDoInterpreterJump();
+  __ Jump(BuildForwardJumpLabel());
   __ Bind(&dont_jump);
 }
 
-void BaselineCompiler::UpdateInterruptBudgetAndDoInterpreterJumpIfNotRoot(
-    RootIndex root) {
+void BaselineCompiler::JumpIfNotRoot(RootIndex root) {
   Label dont_jump;
   __ JumpIfRoot(kInterpreterAccumulatorRegister, root, &dont_jump,
                 Label::kNear);
-  UpdateInterruptBudgetAndDoInterpreterJump();
+  __ Jump(BuildForwardJumpLabel());
   __ Bind(&dont_jump);
 }
 
@@ -639,8 +641,34 @@ Label* BaselineCompiler::BuildForwardJumpLabel() {
   return EnsureLabel(target_offset);
 }
 
+#ifdef DEBUG
+// Allowlist to mark builtin calls during which it is impossible that the
+// sparkplug frame would have to be deoptimized. Either because they don't
+// execute any user code, or because they would anyway replace the current
+// frame, e.g., due to OSR.
+constexpr static bool BuiltinMayDeopt(Builtin id) {
+  switch (id) {
+    case Builtin::kSuspendGeneratorBaseline:
+    case Builtin::kBaselineOutOfLinePrologue:
+    case Builtin::kIncBlockCounter:
+    case Builtin::kToObject:
+    // This one explicitly skips the construct if the debugger is enabled.
+    case Builtin::kFindNonDefaultConstructorOrConstruct:
+      return false;
+    default:
+      return true;
+  }
+}
+#endif  // DEBUG
+
 template <Builtin kBuiltin, typename... Args>
 void BaselineCompiler::CallBuiltin(Args... args) {
+#ifdef DEBUG
+  effect_state_.CheckEffect();
+  if (BuiltinMayDeopt(kBuiltin)) {
+    effect_state_.MayDeopt();
+  }
+#endif
   ASM_CODE_COMMENT(&masm_);
   detail::MoveArgumentsForBuiltin<kBuiltin>(&basm_, args...);
   __ CallBuiltin(kBuiltin);
@@ -648,12 +676,19 @@ void BaselineCompiler::CallBuiltin(Args... args) {
 
 template <Builtin kBuiltin, typename... Args>
 void BaselineCompiler::TailCallBuiltin(Args... args) {
+#ifdef DEBUG
+  effect_state_.CheckEffect();
+#endif
   detail::MoveArgumentsForBuiltin<kBuiltin>(&basm_, args...);
   __ TailCallBuiltin(kBuiltin);
 }
 
 template <typename... Args>
 void BaselineCompiler::CallRuntime(Runtime::FunctionId function, Args... args) {
+#ifdef DEBUG
+  effect_state_.CheckEffect();
+  effect_state_.MayDeopt();
+#endif
   __ LoadContext(kContextRegister);
   int nargs = __ Push(args...);
   __ CallRuntime(function, nargs);
@@ -1151,7 +1186,7 @@ void BaselineCompiler::VisitGetSuperConstructor() {
 }
 
 void BaselineCompiler::VisitFindNonDefaultConstructorOrConstruct() {
-  SaveAccumulatorScope accumulator_scope(&basm_);
+  SaveAccumulatorScope accumulator_scope(this, &basm_);
   CallBuiltin<Builtin::kFindNonDefaultConstructorOrConstruct>(
       RegisterOperand(0), RegisterOperand(1));
   StoreRegisterPair(2, kReturnRegister0, kReturnRegister1);
@@ -1276,10 +1311,24 @@ void BaselineCompiler::VisitCallRuntime() {
 }
 
 void BaselineCompiler::VisitCallRuntimeForPair() {
-  SaveAccumulatorScope accumulator_scope(&basm_);
-  CallRuntime(iterator().GetRuntimeIdOperand(0),
-              iterator().GetRegisterListOperand(1));
-  StoreRegisterPair(3, kReturnRegister0, kReturnRegister1);
+  auto builtin = iterator().GetRuntimeIdOperand(0);
+  switch (builtin) {
+    case Runtime::kLoadLookupSlotForCall: {
+      // TODO(olivf) Once we have more builtins to support here we should find
+      // out how to do this generically.
+      auto in = iterator().GetRegisterListOperand(1);
+      auto out = iterator().GetRegisterPairOperand(3);
+      BaselineAssembler::ScratchRegisterScope scratch_scope(&basm_);
+      Register out_reg = scratch_scope.AcquireScratch();
+      __ RegisterFrameAddress(out.first, out_reg);
+      DCHECK(in.register_count() == 1);
+      CallRuntime(Runtime::kLoadLookupSlotForCall_Baseline, in.first_register(),
+                  out_reg);
+      break;
+    }
+    default:
+      UNREACHABLE();
+  }
 }
 
 void BaselineCompiler::VisitCallJSRuntime() {
@@ -1574,7 +1623,7 @@ void BaselineCompiler::VisitTestTypeOf() {
     case interpreter::TestTypeOfFlags::LiteralFlag::kString: {
       Label is_smi, bad_instance_type;
       __ JumpIfSmi(kInterpreterAccumulatorRegister, &is_smi, Label::kNear);
-      static_assert(INTERNALIZED_STRING_TYPE == FIRST_TYPE);
+      static_assert(INTERNALIZED_TWO_BYTE_STRING_TYPE == FIRST_TYPE);
       __ JumpIfObjectType(kGreaterThanEqual, kInterpreterAccumulatorRegister,
                           FIRST_NONSTRING_TYPE, scratch_scope.AcquireScratch(),
                           &bad_instance_type, Label::kNear);
@@ -1717,9 +1766,7 @@ void BaselineCompiler::VisitTestTypeOf() {
 }
 
 void BaselineCompiler::VisitToName() {
-  SaveAccumulatorScope save_accumulator(&basm_);
   CallBuiltin<Builtin::kToName>(kInterpreterAccumulatorRegister);
-  StoreRegister(0, kInterpreterAccumulatorRegister);
 }
 
 void BaselineCompiler::VisitToNumber() {
@@ -1733,7 +1780,7 @@ void BaselineCompiler::VisitToNumeric() {
 }
 
 void BaselineCompiler::VisitToObject() {
-  SaveAccumulatorScope save_accumulator(&basm_);
+  SaveAccumulatorScope save_accumulator(this, &basm_);
   CallBuiltin<Builtin::kToObject>(kInterpreterAccumulatorRegister);
   StoreRegister(0, kInterpreterAccumulatorRegister);
 }
@@ -1742,6 +1789,10 @@ void BaselineCompiler::VisitToString() {
   CallBuiltin<Builtin::kToString>(kInterpreterAccumulatorRegister);
 }
 
+void BaselineCompiler::VisitToBoolean() {
+  CallBuiltin<Builtin::kToBoolean>(kInterpreterAccumulatorRegister);
+}
+
 void BaselineCompiler::VisitCreateRegExpLiteral() {
   CallBuiltin<Builtin::kCreateRegExpLiteral>(
       FeedbackVector(),         // feedback vector
@@ -1910,7 +1961,9 @@ void BaselineCompiler::VisitJumpLoop() {
     LoadFeedbackVector(feedback_vector);
     __ LoadWord8Field(osr_state, feedback_vector,
                       FeedbackVector::kOsrStateOffset);
-    static_assert(FeedbackVector::MaybeHasOptimizedOsrCodeBit::encode(true) >
+    static_assert(FeedbackVector::MaybeHasMaglevOsrCodeBit::encode(true) >
+                  FeedbackVector::kMaxOsrUrgency);
+    static_assert(FeedbackVector::MaybeHasTurbofanOsrCodeBit::encode(true) >
                   FeedbackVector::kMaxOsrUrgency);
     __ JumpIfByte(kUnsignedGreaterThan, osr_state, loop_depth, &osr_armed,
                   Label::kNear);
@@ -1924,37 +1977,56 @@ void BaselineCompiler::VisitJumpLoop() {
   // We can pass in the same label twice since it's a back edge and thus already
   // bound.
   DCHECK(label->is_bound());
-  UpdateInterruptBudgetAndJumpToLabel(weight, label, label);
+  UpdateInterruptBudgetAndJumpToLabel(weight, label, label, kEnableStackCheck);
 
 #ifndef V8_JITLESS
   {
+    // In case we deopt during the above interrupt check then this part of the
+    // jump loop is skipped. This is not a problem as nothing observable happens
+    // here.
+#ifdef DEBUG
+    effect_state_.safe_to_skip = true;
+#endif
+
     ASM_CODE_COMMENT_STRING(&masm_, "OSR Handle Armed");
     __ Bind(&osr_armed);
-    Label osr;
-    BaselineAssembler::ScratchRegisterScope temps(&basm_);
-    Register scratch0 = temps.AcquireScratch();
-    Register scratch1 = temps.AcquireScratch();
-    DCHECK_EQ(scratch0, feedback_vector);
-    DCHECK_EQ(scratch1, osr_state);
     Register maybe_target_code = D::MaybeTargetCodeRegister();
-    DCHECK(!AreAliased(maybe_target_code, scratch0, scratch1));
-    __ TryLoadOptimizedOsrCode(maybe_target_code, scratch0,
-                               iterator().GetSlotOperand(2), &osr,
-                               Label::kNear);
-    __ DecodeField<FeedbackVector::OsrUrgencyBits>(scratch1);
-    __ JumpIfByte(kUnsignedLessThanEqual, scratch1, loop_depth, &osr_not_armed,
-                  Label::kNear);
+    Label osr;
+    {
+      BaselineAssembler::ScratchRegisterScope temps(&basm_);
+      Register scratch0 = temps.AcquireScratch();
+      Register scratch1 = temps.AcquireScratch();
+      DCHECK_EQ(scratch0, feedback_vector);
+      DCHECK_EQ(scratch1, osr_state);
+      DCHECK(!AreAliased(maybe_target_code, scratch0, scratch1));
+      __ TryLoadOptimizedOsrCode(maybe_target_code, scratch0,
+                                 iterator().GetSlotOperand(2), &osr,
+                                 Label::kNear);
+      __ DecodeField<FeedbackVector::OsrUrgencyBits>(scratch1);
+      __ JumpIfByte(kUnsignedLessThanEqual, scratch1, loop_depth,
+                    &osr_not_armed, Label::kNear);
+    }
 
     __ Bind(&osr);
+    Label do_osr;
+    int weight = bytecode_->length() * v8_flags.osr_to_tierup;
+    __ Push(maybe_target_code);
+    UpdateInterruptBudgetAndJumpToLabel(-weight, nullptr, &do_osr,
+                                        kDisableStackCheck);
+    __ Bind(&do_osr);
+    __ Pop(maybe_target_code);
     CallBuiltin<Builtin::kBaselineOnStackReplacement>(maybe_target_code);
+    __ AddToInterruptBudgetAndJumpIfNotExceeded(weight, nullptr);
     __ Jump(&osr_not_armed, Label::kNear);
+
+#ifdef DEBUG
+    effect_state_.safe_to_skip = false;
+#endif
   }
 #endif  // !V8_JITLESS
 }
 
-void BaselineCompiler::VisitJump() {
-  UpdateInterruptBudgetAndDoInterpreterJump();
-}
+void BaselineCompiler::VisitJump() { __ Jump(BuildForwardJumpLabel()); }
 
 void BaselineCompiler::VisitJumpConstant() { VisitJump(); }
 
@@ -1993,40 +2065,35 @@ void BaselineCompiler::VisitJumpIfToBooleanFalseConstant() {
 void BaselineCompiler::VisitJumpIfToBooleanTrue() {
   Label dont_jump;
   JumpIfToBoolean(false, &dont_jump, Label::kNear);
-  UpdateInterruptBudgetAndDoInterpreterJump();
+  __ Jump(BuildForwardJumpLabel());
   __ Bind(&dont_jump);
 }
 
 void BaselineCompiler::VisitJumpIfToBooleanFalse() {
   Label dont_jump;
   JumpIfToBoolean(true, &dont_jump, Label::kNear);
-  UpdateInterruptBudgetAndDoInterpreterJump();
+  __ Jump(BuildForwardJumpLabel());
   __ Bind(&dont_jump);
 }
 
-void BaselineCompiler::VisitJumpIfTrue() {
-  UpdateInterruptBudgetAndDoInterpreterJumpIfRoot(RootIndex::kTrueValue);
-}
+void BaselineCompiler::VisitJumpIfTrue() { JumpIfRoot(RootIndex::kTrueValue); }
 
 void BaselineCompiler::VisitJumpIfFalse() {
-  UpdateInterruptBudgetAndDoInterpreterJumpIfRoot(RootIndex::kFalseValue);
+  JumpIfRoot(RootIndex::kFalseValue);
 }
 
-void BaselineCompiler::VisitJumpIfNull() {
-  UpdateInterruptBudgetAndDoInterpreterJumpIfRoot(RootIndex::kNullValue);
-}
+void BaselineCompiler::VisitJumpIfNull() { JumpIfRoot(RootIndex::kNullValue); }
 
 void BaselineCompiler::VisitJumpIfNotNull() {
-  UpdateInterruptBudgetAndDoInterpreterJumpIfNotRoot(RootIndex::kNullValue);
+  JumpIfNotRoot(RootIndex::kNullValue);
 }
 
 void BaselineCompiler::VisitJumpIfUndefined() {
-  UpdateInterruptBudgetAndDoInterpreterJumpIfRoot(RootIndex::kUndefinedValue);
+  JumpIfRoot(RootIndex::kUndefinedValue);
 }
 
 void BaselineCompiler::VisitJumpIfNotUndefined() {
-  UpdateInterruptBudgetAndDoInterpreterJumpIfNotRoot(
-      RootIndex::kUndefinedValue);
+  JumpIfNotRoot(RootIndex::kUndefinedValue);
 }
 
 void BaselineCompiler::VisitJumpIfUndefinedOrNull() {
@@ -2036,7 +2103,7 @@ void BaselineCompiler::VisitJumpIfUndefinedOrNull() {
   __ JumpIfNotRoot(kInterpreterAccumulatorRegister, RootIndex::kNullValue,
                    &dont_jump, Label::kNear);
   __ Bind(&do_jump);
-  UpdateInterruptBudgetAndDoInterpreterJump();
+  __ Jump(BuildForwardJumpLabel());
   __ Bind(&dont_jump);
 }
 
@@ -2051,7 +2118,7 @@ void BaselineCompiler::VisitJumpIfJSReceiver() {
   __ JumpIfObjectTypeFast(kLessThan, kInterpreterAccumulatorRegister,
                           FIRST_JS_RECEIVER_TYPE, &dont_jump);
 #endif
-  UpdateInterruptBudgetAndDoInterpreterJump();
+  __ Jump(BuildForwardJumpLabel());
 
   __ Bind(&is_smi);
   __ Bind(&dont_jump);
@@ -2243,7 +2310,7 @@ void BaselineCompiler::VisitSuspendGenerator() {
   Register generator_object = scratch_scope.AcquireScratch();
   LoadRegister(generator_object, 0);
   {
-    SaveAccumulatorScope accumulator_scope(&basm_);
+    SaveAccumulatorScope accumulator_scope(this, &basm_);
 
     int bytecode_offset =
         BytecodeArray::kHeaderSize + iterator().current_offset();
@@ -2253,7 +2320,9 @@ void BaselineCompiler::VisitSuspendGenerator() {
         bytecode_offset,
         static_cast<int>(RegisterCount(2)));  // register_count
   }
-  VisitReturn();
+  int parameter_count = bytecode_->parameter_count();
+
+  TailCallBuiltin<Builtin::kBaselineLeaveFrame>(parameter_count, 0);
 }
 
 void BaselineCompiler::VisitResumeGenerator() {
@@ -2273,12 +2342,11 @@ void BaselineCompiler::VisitGetIterator() {
 }
 
 void BaselineCompiler::VisitDebugger() {
-  SaveAccumulatorScope accumulator_scope(&basm_);
   CallRuntime(Runtime::kHandleDebuggerStatement);
 }
 
 void BaselineCompiler::VisitIncBlockCounter() {
-  SaveAccumulatorScope accumulator_scope(&basm_);
+  SaveAccumulatorScope accumulator_scope(this, &basm_);
   CallBuiltin<Builtin::kIncBlockCounter>(__ FunctionOperand(),
                                          IndexAsSmi(0));  // coverage array slot
 }
@@ -2307,6 +2375,30 @@ void BaselineCompiler::VisitIllegal() {
 DEBUG_BREAK_BYTECODE_LIST(DEBUG_BREAK)
 #undef DEBUG_BREAK
 
+SaveAccumulatorScope::SaveAccumulatorScope(BaselineCompiler* compiler,
+                                           BaselineAssembler* assembler)
+    :
+#ifdef DEBUG
+      compiler_(compiler),
+#endif
+      assembler_(assembler) {
+#ifdef DEBUG
+  DCHECK(!compiler_->effect_state_.accumulator_on_stack);
+  compiler_->effect_state_.accumulator_on_stack = true;
+#endif  // DEBUG
+  ASM_CODE_COMMENT(assembler_->masm());
+  assembler_->Push(kInterpreterAccumulatorRegister);
+}
+
+SaveAccumulatorScope::~SaveAccumulatorScope() {
+#ifdef DEBUG
+  DCHECK(compiler_->effect_state_.accumulator_on_stack);
+  compiler_->effect_state_.accumulator_on_stack = false;
+#endif  // DEBUG
+  ASM_CODE_COMMENT(assembler_->masm());
+  assembler_->Pop(kInterpreterAccumulatorRegister);
+}
+
 }  // namespace baseline
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/baseline/baseline-compiler.h b/deps/v8/src/baseline/baseline-compiler.h
index 7e8a5725d53545..f5d2c89bf13eb5 100644
--- a/deps/v8/src/baseline/baseline-compiler.h
+++ b/deps/v8/src/baseline/baseline-compiler.h
@@ -48,7 +48,7 @@ class BytecodeOffsetTableBuilder {
 
  private:
   size_t previous_pc_ = 0;
-  std::vector<byte> bytes_;
+  std::vector<uint8_t> bytes_;
 };
 
 class BaselineCompiler {
@@ -59,7 +59,7 @@ class BaselineCompiler {
 
   void GenerateCode();
   MaybeHandle<Code> Build(LocalIsolate* local_isolate);
-  static int EstimateInstructionSize(BytecodeArray bytecode);
+  static int EstimateInstructionSize(Tagged<BytecodeArray> bytecode);
 
  private:
   void Prologue();
@@ -81,7 +81,7 @@ class BaselineCompiler {
   // Constant pool operands.
   template <typename Type>
   Handle<Type> Constant(int operand_index);
-  Smi ConstantSmi(int operand_index);
+  Tagged<Smi> ConstantSmi(int operand_index);
   template <typename Type>
   void LoadConstant(Register output, int operand_index);
 
@@ -92,21 +92,25 @@ class BaselineCompiler {
   uint32_t Flag8(int operand_index);
   uint32_t Flag16(int operand_index);
   uint32_t RegisterCount(int operand_index);
-  TaggedIndex IndexAsTagged(int operand_index);
-  TaggedIndex UintAsTagged(int operand_index);
-  Smi IndexAsSmi(int operand_index);
-  Smi IntAsSmi(int operand_index);
-  Smi Flag8AsSmi(int operand_index);
-  Smi Flag16AsSmi(int operand_index);
+  Tagged<TaggedIndex> IndexAsTagged(int operand_index);
+  Tagged<TaggedIndex> UintAsTagged(int operand_index);
+  Tagged<Smi> IndexAsSmi(int operand_index);
+  Tagged<Smi> IntAsSmi(int operand_index);
+  Tagged<Smi> Flag8AsSmi(int operand_index);
+  Tagged<Smi> Flag16AsSmi(int operand_index);
 
   // Jump helpers.
   Label* NewLabel();
   Label* BuildForwardJumpLabel();
-  void UpdateInterruptBudgetAndJumpToLabel(int weight, Label* label,
-                                           Label* skip_interrupt_label);
-  void UpdateInterruptBudgetAndDoInterpreterJump();
-  void UpdateInterruptBudgetAndDoInterpreterJumpIfRoot(RootIndex root);
-  void UpdateInterruptBudgetAndDoInterpreterJumpIfNotRoot(RootIndex root);
+  enum StackCheckBehavior {
+    kEnableStackCheck,
+    kDisableStackCheck,
+  };
+  void UpdateInterruptBudgetAndJumpToLabel(
+      int weight, Label* label, Label* skip_interrupt_label,
+      StackCheckBehavior stack_check_behavior);
+  void JumpIfRoot(RootIndex root);
+  void JumpIfNotRoot(RootIndex root);
 
   // Feedback vector.
   MemOperand FeedbackVector();
@@ -195,6 +199,42 @@ class BaselineCompiler {
   }
 
   BaselineLabelPointer* labels_;
+
+#ifdef DEBUG
+  friend class SaveAccumulatorScope;
+
+  struct EffectState {
+    bool may_have_deopted = false;
+    bool accumulator_on_stack = false;
+    bool safe_to_skip = false;
+
+    void MayDeopt() {
+      DCHECK(!accumulator_on_stack);
+      may_have_deopted = true;
+    }
+
+    void CheckEffect() { DCHECK(!may_have_deopted || safe_to_skip); }
+
+    void clear() {
+      DCHECK(!accumulator_on_stack);
+      *this = EffectState();
+    }
+  } effect_state_;
+#endif
+};
+
+class SaveAccumulatorScope final {
+ public:
+  SaveAccumulatorScope(BaselineCompiler* compiler,
+                       BaselineAssembler* assembler);
+
+  ~SaveAccumulatorScope();
+
+ private:
+#ifdef DEBUG
+  BaselineCompiler* compiler_;
+#endif
+  BaselineAssembler* assembler_;
 };
 
 }  // namespace baseline
diff --git a/deps/v8/src/baseline/baseline.cc b/deps/v8/src/baseline/baseline.cc
index 03ed08a6d914e0..23f53faf1ee8c7 100644
--- a/deps/v8/src/baseline/baseline.cc
+++ b/deps/v8/src/baseline/baseline.cc
@@ -22,7 +22,8 @@
 namespace v8 {
 namespace internal {
 
-bool CanCompileWithBaseline(Isolate* isolate, SharedFunctionInfo shared) {
+bool CanCompileWithBaseline(Isolate* isolate,
+                            Tagged<SharedFunctionInfo> shared) {
   DisallowGarbageCollection no_gc;
 
   // Check that baseline compiler is enabled.
@@ -35,23 +36,22 @@ bool CanCompileWithBaseline(Isolate* isolate, SharedFunctionInfo shared) {
   }
 
   // Check if we actually have bytecode.
-  if (!shared.HasBytecodeArray()) return false;
+  if (!shared->HasBytecodeArray()) return false;
 
   // Do not optimize when debugger needs to hook into every call.
   if (isolate->debug()->needs_check_on_function_call()) return false;
 
-  // Functions with breakpoints have to stay interpreted.
-  if (shared.HasBreakInfo()) return false;
+  if (auto debug_info = shared->TryGetDebugInfo(isolate)) {
+    // Functions with breakpoints have to stay interpreted.
+    if (debug_info.value()->HasBreakInfo()) return false;
 
-  // Functions with instrumented bytecode can't be baseline compiled since the
-  // baseline code's bytecode array pointer is immutable.
-  if (shared.HasDebugInfo() &&
-      shared.GetDebugInfo().HasInstrumentedBytecodeArray()) {
-    return false;
+    // Functions with instrumented bytecode can't be baseline compiled since the
+    // baseline code's bytecode array pointer is immutable.
+    if (debug_info.value()->HasInstrumentedBytecodeArray()) return false;
   }
 
   // Do not baseline compile if function doesn't pass sparkplug_filter.
-  if (!shared.PassesFilter(v8_flags.sparkplug_filter)) return false;
+  if (!shared->PassesFilter(v8_flags.sparkplug_filter)) return false;
 
   return true;
 }
@@ -65,7 +65,7 @@ MaybeHandle<Code> GenerateBaselineCode(Isolate* isolate,
   compiler.GenerateCode();
   MaybeHandle<Code> code = compiler.Build(local_isolate);
   if (v8_flags.print_code && !code.is_null()) {
-    code.ToHandleChecked()->Print();
+    Print(*code.ToHandleChecked());
   }
   return code;
 }
diff --git a/deps/v8/src/baseline/baseline.h b/deps/v8/src/baseline/baseline.h
index 10a6e25e4fbb94..ab85136d771096 100644
--- a/deps/v8/src/baseline/baseline.h
+++ b/deps/v8/src/baseline/baseline.h
@@ -14,7 +14,8 @@ class Code;
 class SharedFunctionInfo;
 class MacroAssembler;
 
-bool CanCompileWithBaseline(Isolate* isolate, SharedFunctionInfo shared);
+bool CanCompileWithBaseline(Isolate* isolate,
+                            Tagged<SharedFunctionInfo> shared);
 
 MaybeHandle<Code> GenerateBaselineCode(Isolate* isolate,
                                        Handle<SharedFunctionInfo> shared);
diff --git a/deps/v8/src/baseline/bytecode-offset-iterator.cc b/deps/v8/src/baseline/bytecode-offset-iterator.cc
index d2504b62e9b194..d60559e4a7732f 100644
--- a/deps/v8/src/baseline/bytecode-offset-iterator.cc
+++ b/deps/v8/src/baseline/bytecode-offset-iterator.cc
@@ -4,7 +4,9 @@
 
 #include "src/baseline/bytecode-offset-iterator.h"
 
-#include "src/objects/code-inl.h"
+#include "src/execution/isolate.h"
+#include "src/heap/local-heap.h"
+#include "src/objects/bytecode-array-inl.h"
 
 namespace v8 {
 namespace internal {
@@ -24,10 +26,10 @@ BytecodeOffsetIterator::BytecodeOffsetIterator(Handle<ByteArray> mapping_table,
   Initialize();
 }
 
-BytecodeOffsetIterator::BytecodeOffsetIterator(ByteArray mapping_table,
-                                               BytecodeArray bytecodes)
-    : data_start_address_(mapping_table.GetDataStartAddress()),
-      data_length_(mapping_table.length()),
+BytecodeOffsetIterator::BytecodeOffsetIterator(Tagged<ByteArray> mapping_table,
+                                               Tagged<BytecodeArray> bytecodes)
+    : data_start_address_(mapping_table->GetDataStartAddress()),
+      data_length_(mapping_table->length()),
       current_index_(0),
       bytecode_handle_storage_(bytecodes),
       // In the non-handlified version, no GC is allowed. We use a "dummy"
diff --git a/deps/v8/src/baseline/bytecode-offset-iterator.h b/deps/v8/src/baseline/bytecode-offset-iterator.h
index a08655d9d67342..6f30cd9a72d80f 100644
--- a/deps/v8/src/baseline/bytecode-offset-iterator.h
+++ b/deps/v8/src/baseline/bytecode-offset-iterator.h
@@ -8,8 +8,7 @@
 #include "src/base/vlq.h"
 #include "src/common/globals.h"
 #include "src/interpreter/bytecode-array-iterator.h"
-#include "src/objects/code.h"
-#include "src/objects/fixed-array.h"
+#include "src/objects/bytecode-array.h"
 
 namespace v8 {
 namespace internal {
@@ -23,8 +22,8 @@ class V8_EXPORT_PRIVATE BytecodeOffsetIterator {
   explicit BytecodeOffsetIterator(Handle<ByteArray> mapping_table,
                                   Handle<BytecodeArray> bytecodes);
   // Non-handlified version for use when no GC can happen.
-  explicit BytecodeOffsetIterator(ByteArray mapping_table,
-                                  BytecodeArray bytecodes);
+  explicit BytecodeOffsetIterator(Tagged<ByteArray> mapping_table,
+                                  Tagged<BytecodeArray> bytecodes);
   ~BytecodeOffsetIterator();
 
   inline void Advance() {
@@ -66,8 +65,7 @@ class V8_EXPORT_PRIVATE BytecodeOffsetIterator {
     return current_bytecode_offset_;
   }
 
-  static void UpdatePointersCallback(LocalIsolate*, GCType, GCCallbackFlags,
-                                     void* iterator) {
+  static void UpdatePointersCallback(void* iterator) {
     reinterpret_cast<BytecodeOffsetIterator*>(iterator)->UpdatePointers();
   }
 
@@ -80,7 +78,7 @@ class V8_EXPORT_PRIVATE BytecodeOffsetIterator {
   }
 
   Handle<ByteArray> mapping_table_;
-  byte* data_start_address_;
+  uint8_t* data_start_address_;
   int data_length_;
   int current_index_;
   Address current_pc_start_offset_;
diff --git a/deps/v8/src/baseline/ia32/baseline-assembler-ia32-inl.h b/deps/v8/src/baseline/ia32/baseline-assembler-ia32-inl.h
index f96f2e00a560eb..d474366ae5ac57 100644
--- a/deps/v8/src/baseline/ia32/baseline-assembler-ia32-inl.h
+++ b/deps/v8/src/baseline/ia32/baseline-assembler-ia32-inl.h
@@ -158,7 +158,7 @@ void BaselineAssembler::JumpIfPointer(Condition cc, Register value,
                                       Label::Distance distance) {
   JumpIf(cc, value, operand, target, distance);
 }
-void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Smi smi,
+void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
                                   Label* target, Label::Distance distance) {
   if (smi.value() == 0) {
     __ test(value, value);
@@ -194,7 +194,7 @@ void BaselineAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
 void BaselineAssembler::Move(interpreter::Register output, Register source) {
   return __ mov(RegisterFrameOperand(output), source);
 }
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   __ Move(output, Immediate(value.ptr()));
 }
 void BaselineAssembler::Move(MemOperand output, Register source) {
@@ -221,10 +221,12 @@ inline void PushSingle(MacroAssembler* masm, RootIndex source) {
   masm->PushRoot(source);
 }
 inline void PushSingle(MacroAssembler* masm, Register reg) { masm->Push(reg); }
-inline void PushSingle(MacroAssembler* masm, TaggedIndex value) {
+inline void PushSingle(MacroAssembler* masm, Tagged<TaggedIndex> value) {
   masm->Push(Immediate(value.ptr()));
 }
-inline void PushSingle(MacroAssembler* masm, Smi value) { masm->Push(value); }
+inline void PushSingle(MacroAssembler* masm, Tagged<Smi> value) {
+  masm->Push(value);
+}
 inline void PushSingle(MacroAssembler* masm, Handle<HeapObject> object) {
   masm->Push(object);
 }
@@ -331,7 +333,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
 }
 
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   __ mov(FieldOperand(target, offset), Immediate(value));
 }
 
@@ -458,7 +460,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   if (rhs.value() == 0) return;
   __ add(lhs, Immediate(rhs));
 }
diff --git a/deps/v8/src/baseline/loong64/baseline-assembler-loong64-inl.h b/deps/v8/src/baseline/loong64/baseline-assembler-loong64-inl.h
index a80617c92850f7..1dd4a7ef0df106 100644
--- a/deps/v8/src/baseline/loong64/baseline-assembler-loong64-inl.h
+++ b/deps/v8/src/baseline/loong64/baseline-assembler-loong64-inl.h
@@ -104,12 +104,28 @@ void BaselineAssembler::JumpIf(Condition cc, Register lhs, const Operand& rhs,
                                Label* target, Label::Distance) {
   __ Branch(target, cc, lhs, Operand(rhs));
 }
+
+#if V8_STATIC_ROOTS_BOOL
+void BaselineAssembler::JumpIfJSAnyIsPrimitive(Register heap_object,
+                                               Label* target,
+                                               Label::Distance distance) {
+  __ AssertNotSmi(heap_object);
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.AcquireScratch();
+  __ JumpIfJSAnyIsPrimitive(heap_object, scratch, target, distance);
+}
+#endif  // V8_STATIC_ROOTS_BOOL
+
 void BaselineAssembler::JumpIfObjectTypeFast(Condition cc, Register object,
                                              InstanceType instance_type,
                                              Label* target,
                                              Label::Distance distance) {
   ScratchRegisterScope temps(this);
   Register scratch = temps.AcquireScratch();
+  if (cc == eq || cc == ne) {
+    __ JumpIfObjectType(target, cc, object, instance_type, scratch);
+    return;
+  }
   JumpIfObjectType(cc, object, instance_type, scratch, target, distance);
 }
 void BaselineAssembler::JumpIfObjectType(Condition cc, Register object,
@@ -134,7 +150,7 @@ void BaselineAssembler::JumpIfInstanceType(Condition cc, Register map,
   __ Ld_hu(type, FieldMemOperand(map, Map::kInstanceTypeOffset));
   __ Branch(target, cc, type, Operand(instance_type));
 }
-void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Smi smi,
+void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
                                   Label* target, Label::Distance) {
   __ CompareTaggedAndBranch(target, cc, value, Operand(smi));
 }
@@ -167,7 +183,7 @@ void BaselineAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
 void BaselineAssembler::Move(interpreter::Register output, Register source) {
   Move(RegisterFrameOperand(output), source);
 }
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   __ li(output, Operand(value.ptr()));
 }
 void BaselineAssembler::Move(MemOperand output, Register source) {
@@ -323,7 +339,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
   __ Ld_b(output, FieldMemOperand(source, offset));
 }
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   ASM_CODE_COMMENT(masm_);
   ScratchRegisterScope temps(this);
   Register scratch = temps.AcquireScratch();
@@ -458,7 +474,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   if (SmiValuesAre31Bits()) {
     __ Add_w(lhs, lhs, Operand(rhs));
   } else {
diff --git a/deps/v8/src/baseline/mips64/baseline-assembler-mips64-inl.h b/deps/v8/src/baseline/mips64/baseline-assembler-mips64-inl.h
index 762ec1745ba064..47b8fabaa1dbea 100644
--- a/deps/v8/src/baseline/mips64/baseline-assembler-mips64-inl.h
+++ b/deps/v8/src/baseline/mips64/baseline-assembler-mips64-inl.h
@@ -142,7 +142,7 @@ void BaselineAssembler::JumpIfPointer(Condition cc, Register value,
   __ Ld(scratch, operand);
   __ Branch(target, cc, value, Operand(scratch));
 }
-void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Smi smi,
+void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
                                   Label* target, Label::Distance) {
   ScratchRegisterScope temps(this);
   Register scratch = temps.AcquireScratch();
@@ -180,7 +180,7 @@ void BaselineAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
 void BaselineAssembler::Move(interpreter::Register output, Register source) {
   Move(RegisterFrameOperand(output), source);
 }
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   __ li(output, Operand(value.ptr()));
 }
 void BaselineAssembler::Move(MemOperand output, Register source) {
@@ -335,7 +335,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
   __ Lb(output, FieldMemOperand(source, offset));
 }
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   ASM_CODE_COMMENT(masm_);
   ScratchRegisterScope temps(this);
   Register scratch = temps.AcquireScratch();
@@ -472,7 +472,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   __ Daddu(lhs, lhs, Operand(rhs));
 }
 
diff --git a/deps/v8/src/baseline/ppc/baseline-assembler-ppc-inl.h b/deps/v8/src/baseline/ppc/baseline-assembler-ppc-inl.h
index 74a3db7ca3b61c..639ff8ae1ff0d5 100644
--- a/deps/v8/src/baseline/ppc/baseline-assembler-ppc-inl.h
+++ b/deps/v8/src/baseline/ppc/baseline-assembler-ppc-inl.h
@@ -195,7 +195,7 @@ void BaselineAssembler::JumpIfPointer(Condition cc, Register value,
   JumpIfHelper(masm_, cc, value, tmp, target);
 }
 
-void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Smi smi,
+void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
                                   Label* target, Label::Distance) {
   ASM_CODE_COMMENT(masm_);
   __ AssertSmi(value);
@@ -238,7 +238,7 @@ void BaselineAssembler::Move(interpreter::Register output, Register source) {
   Move(RegisterFrameOperand(output), source);
 }
 
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   ASM_CODE_COMMENT(masm_);
   __ mov(output, Operand(value.ptr()));
 }
@@ -415,7 +415,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
 }
 
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   ASM_CODE_COMMENT(masm_);
   ScratchRegisterScope temps(this);
   Register tmp = temps.AcquireScratch();
@@ -567,7 +567,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   ASM_CODE_COMMENT(masm_);
   if (rhs.value() == 0) return;
   __ LoadSmiLiteral(r0, rhs);
diff --git a/deps/v8/src/baseline/riscv/baseline-assembler-riscv-inl.h b/deps/v8/src/baseline/riscv/baseline-assembler-riscv-inl.h
index 14b09eec724bf3..7f65c7858052de 100644
--- a/deps/v8/src/baseline/riscv/baseline-assembler-riscv-inl.h
+++ b/deps/v8/src/baseline/riscv/baseline-assembler-riscv-inl.h
@@ -68,22 +68,22 @@ void BaselineAssembler::JumpTarget() {
 }
 
 void BaselineAssembler::Jump(Label* target, Label::Distance distance) {
-  __ jmp(target);
+  __ jmp(target, distance);
 }
 void BaselineAssembler::JumpIfRoot(Register value, RootIndex index,
-                                   Label* target, Label::Distance) {
-  __ JumpIfRoot(value, index, target);
+                                   Label* target, Label::Distance distance) {
+  __ JumpIfRoot(value, index, target, distance);
 }
 void BaselineAssembler::JumpIfNotRoot(Register value, RootIndex index,
-                                      Label* target, Label::Distance) {
-  __ JumpIfNotRoot(value, index, target);
+                                      Label* target, Label::Distance distance) {
+  __ JumpIfNotRoot(value, index, target, distance);
 }
 void BaselineAssembler::JumpIfSmi(Register value, Label* target,
-                                  Label::Distance) {
-  __ JumpIfSmi(value, target);
+                                  Label::Distance distance) {
+  __ JumpIfSmi(value, target, distance);
 }
 void BaselineAssembler::JumpIfNotSmi(Register value, Label* target,
-                                     Label::Distance) {
+                                     Label::Distance distance) {
   __ JumpIfNotSmi(value, target);
 }
 void BaselineAssembler::JumpIfImmediate(Condition cc, Register left, int right,
@@ -92,37 +92,54 @@ void BaselineAssembler::JumpIfImmediate(Condition cc, Register left, int right,
   JumpIf(cc, left, Operand(right), target, distance);
 }
 void BaselineAssembler::TestAndBranch(Register value, int mask, Condition cc,
-                                      Label* target, Label::Distance) {
+                                      Label* target, Label::Distance distance) {
   ScratchRegisterScope temps(this);
   Register tmp = temps.AcquireScratch();
   __ And(tmp, value, Operand(mask));
-  __ Branch(target, cc, tmp, Operand(zero_reg));
+  __ Branch(target, cc, tmp, Operand(zero_reg), distance);
 }
 
 void BaselineAssembler::JumpIf(Condition cc, Register lhs, const Operand& rhs,
-                               Label* target, Label::Distance) {
-  __ Branch(target, cc, lhs, Operand(rhs));
+                               Label* target, Label::Distance distance) {
+  __ Branch(target, cc, lhs, Operand(rhs), distance);
 }
+
+#if V8_STATIC_ROOTS_BOOL
+void BaselineAssembler::JumpIfJSAnyIsPrimitive(Register heap_object,
+                                               Label* target,
+                                               Label::Distance distance) {
+  __ AssertNotSmi(heap_object);
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.AcquireScratch();
+  __ JumpIfJSAnyIsPrimitive(heap_object, scratch, target, distance);
+}
+#endif  // V8_STATIC_ROOTS_BOOL
+
 void BaselineAssembler::JumpIfObjectTypeFast(Condition cc, Register object,
                                              InstanceType instance_type,
                                              Label* target,
                                              Label::Distance distance) {
   ScratchRegisterScope temps(this);
   Register scratch = temps.AcquireScratch();
+  if (cc == eq || cc == ne) {
+    __ JumpIfObjectType(target, cc, object, instance_type, scratch);
+    return;
+  }
   JumpIfObjectType(cc, object, instance_type, scratch, target, distance);
 }
 void BaselineAssembler::JumpIfObjectType(Condition cc, Register object,
                                          InstanceType instance_type,
                                          Register map, Label* target,
-                                         Label::Distance) {
+                                         Label::Distance distance) {
   ScratchRegisterScope temps(this);
   Register type = temps.AcquireScratch();
   __ GetObjectType(object, map, type);
-  __ Branch(target, cc, type, Operand(instance_type));
+  __ Branch(target, cc, type, Operand(instance_type), distance);
 }
 void BaselineAssembler::JumpIfInstanceType(Condition cc, Register map,
                                            InstanceType instance_type,
-                                           Label* target, Label::Distance) {
+                                           Label* target,
+                                           Label::Distance distance) {
   ScratchRegisterScope temps(this);
   Register type = temps.AcquireScratch();
   if (v8_flags.debug_code) {
@@ -131,58 +148,54 @@ void BaselineAssembler::JumpIfInstanceType(Condition cc, Register map,
     __ Assert(eq, AbortReason::kUnexpectedValue, type, Operand(MAP_TYPE));
   }
   __ LoadWord(type, FieldMemOperand(map, Map::kInstanceTypeOffset));
-  __ Branch(target, cc, type, Operand(instance_type));
+  __ Branch(target, cc, type, Operand(instance_type), distance);
 }
 void BaselineAssembler::JumpIfPointer(Condition cc, Register value,
                                       MemOperand operand, Label* target,
-                                      Label::Distance) {
+                                      Label::Distance distance) {
   ScratchRegisterScope temps(this);
   Register temp = temps.AcquireScratch();
   __ LoadWord(temp, operand);
-  __ Branch(target, cc, value, Operand(temp));
+  __ Branch(target, cc, value, Operand(temp), distance);
 }
-void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Smi smi,
-                                  Label* target, Label::Distance) {
-  ScratchRegisterScope temps(this);
-  Register temp = temps.AcquireScratch();
-  __ li(temp, Operand(smi));
-  __ SmiUntag(temp);
-  __ Branch(target, cc, value, Operand(temp));
+void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
+                                  Label* target, Label::Distance distance) {
+  __ CompareTaggedAndBranch(target, cc, value, Operand(smi));
 }
 void BaselineAssembler::JumpIfSmi(Condition cc, Register lhs, Register rhs,
-                                  Label* target, Label::Distance) {
+                                  Label* target, Label::Distance distance) {
   // todo: compress pointer
   __ AssertSmi(lhs);
   __ AssertSmi(rhs);
-  __ Branch(target, cc, lhs, Operand(rhs));
+  __ CompareTaggedAndBranch(target, cc, lhs, Operand(rhs), distance);
 }
 void BaselineAssembler::JumpIfTagged(Condition cc, Register value,
                                      MemOperand operand, Label* target,
-                                     Label::Distance) {
+                                     Label::Distance distance) {
   // todo: compress pointer
   ScratchRegisterScope temps(this);
   Register scratch = temps.AcquireScratch();
   __ LoadWord(scratch, operand);
-  __ Branch(target, cc, value, Operand(scratch));
+  __ CompareTaggedAndBranch(target, cc, value, Operand(scratch), distance);
 }
 void BaselineAssembler::JumpIfTagged(Condition cc, MemOperand operand,
                                      Register value, Label* target,
-                                     Label::Distance) {
+                                     Label::Distance distance) {
   // todo: compress pointer
   ScratchRegisterScope temps(this);
   Register scratch = temps.AcquireScratch();
   __ LoadWord(scratch, operand);
-  __ Branch(target, cc, scratch, Operand(value));
+  __ CompareTaggedAndBranch(target, cc, scratch, Operand(value), distance);
 }
 void BaselineAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
-                                   Label* target, Label::Distance) {
-  __ Branch(target, cc, value, Operand(byte));
+                                   Label* target, Label::Distance distance) {
+  __ Branch(target, cc, value, Operand(byte), distance);
 }
 
 void BaselineAssembler::Move(interpreter::Register output, Register source) {
   Move(RegisterFrameOperand(output), source);
 }
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   __ li(output, Operand(value.ptr()));
 }
 void BaselineAssembler::Move(MemOperand output, Register source) {
@@ -328,7 +341,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
   __ Lb(output, FieldMemOperand(source, offset));
 }
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   ASM_CODE_COMMENT(masm_);
   ScratchRegisterScope temps(this);
   Register tmp = temps.AcquireScratch();
@@ -353,7 +366,7 @@ void BaselineAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
                                                 Register feedback_vector,
                                                 FeedbackSlot slot,
                                                 Label* on_result,
-                                                Label::Distance) {
+                                                Label::Distance distance) {
   Label fallthrough, clear_slot;
   LoadTaggedField(scratch_and_result, feedback_vector,
                   FeedbackVector::OffsetOfElementAt(slot.ToInt()));
@@ -364,7 +377,7 @@ void BaselineAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
     ScratchRegisterScope temps(this);
     __ JumpIfCodeIsMarkedForDeoptimization(scratch_and_result,
                                            temps.AcquireScratch(), &clear_slot);
-    Jump(on_result);
+    Jump(on_result, distance);
   }
 
   __ bind(&clear_slot);
@@ -471,7 +484,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   ASM_CODE_COMMENT(masm_);
   if (SmiValuesAre31Bits()) {
     __ Add32(lhs, lhs, Operand(rhs));
@@ -505,18 +518,17 @@ void BaselineAssembler::Switch(Register reg, int case_value_base,
   __ addi(t6, t6, Lo12);  // jump PC + Hi20 + Lo12
 
   int entry_size_log2 = 3;
+  __ BlockTrampolinePoolFor(num_labels * 2 + 5);
   __ CalcScaledAddress(t6, t6, reg, entry_size_log2);
   __ Jump(t6);
   {
-    MacroAssembler::BlockTrampolinePoolScope(masm());
-    __ BlockTrampolinePoolFor(num_labels * kInstrSize * 2);
     __ bind(&table);
     for (int i = 0; i < num_labels; ++i) {
       __ BranchLong(labels[i]);
     }
     DCHECK_EQ(num_labels * 2, __ InstructionsGeneratedSince(&table));
-    __ bind(&fallthrough);
   }
+  __ bind(&fallthrough);
 }
 
 #undef __
diff --git a/deps/v8/src/baseline/riscv/baseline-compiler-riscv-inl.h b/deps/v8/src/baseline/riscv/baseline-compiler-riscv-inl.h
index 684bf382aa9f78..0a84881accd9e7 100644
--- a/deps/v8/src/baseline/riscv/baseline-compiler-riscv-inl.h
+++ b/deps/v8/src/baseline/riscv/baseline-compiler-riscv-inl.h
@@ -44,7 +44,8 @@ void BaselineCompiler::PrologueFillFrame() {
   const bool has_new_target = new_target_index != kMaxInt;
   if (has_new_target) {
     DCHECK_LE(new_target_index, register_count);
-    __ masm()->AddWord(sp, sp, Operand(-(kPointerSize * new_target_index)));
+    __ masm()->AddWord(sp, sp,
+                       Operand(-(kSystemPointerSize * new_target_index)));
     for (int i = 0; i < new_target_index; i++) {
       __ masm()->StoreWord(kInterpreterAccumulatorRegister,
                            MemOperand(sp, i * kSystemPointerSize));
@@ -55,13 +56,13 @@ void BaselineCompiler::PrologueFillFrame() {
   }
   if (register_count < 2 * kLoopUnrollSize) {
     // If the frame is small enough, just unroll the frame fill completely.
-    __ masm()->AddWord(sp, sp, Operand(-(kPointerSize * register_count)));
+    __ masm()->AddWord(sp, sp, Operand(-(kSystemPointerSize * register_count)));
     for (int i = 0; i < register_count; ++i) {
       __ masm()->StoreWord(kInterpreterAccumulatorRegister,
                            MemOperand(sp, i * kSystemPointerSize));
     }
   } else {
-    __ masm()->AddWord(sp, sp, Operand(-(kPointerSize * register_count)));
+    __ masm()->AddWord(sp, sp, Operand(-(kSystemPointerSize * register_count)));
     for (int i = 0; i < register_count; ++i) {
       __ masm()->StoreWord(kInterpreterAccumulatorRegister,
                            MemOperand(sp, i * kSystemPointerSize));
@@ -71,11 +72,10 @@ void BaselineCompiler::PrologueFillFrame() {
 
 void BaselineCompiler::VerifyFrameSize() {
   ASM_CODE_COMMENT(&masm_);
-  __ masm()->AddWord(kScratchReg, sp,
+  __ masm()->AddWord(t0, sp,
                      Operand(InterpreterFrameConstants::kFixedFrameSizeFromFp +
                              bytecode_->frame_size()));
-  __ masm()->Assert(eq, AbortReason::kUnexpectedStackPointer, kScratchReg,
-                    Operand(fp));
+  __ masm()->Assert(eq, AbortReason::kUnexpectedStackPointer, t0, Operand(fp));
 }
 
 #undef __
diff --git a/deps/v8/src/baseline/s390/baseline-assembler-s390-inl.h b/deps/v8/src/baseline/s390/baseline-assembler-s390-inl.h
index 517453c605e8ef..bd157932db5486 100644
--- a/deps/v8/src/baseline/s390/baseline-assembler-s390-inl.h
+++ b/deps/v8/src/baseline/s390/baseline-assembler-s390-inl.h
@@ -16,7 +16,7 @@ namespace baseline {
 
 namespace detail {
 
-static constexpr Register kScratchRegisters[] = {r8, r9, ip, r1};
+static constexpr Register kScratchRegisters[] = {r8, ip, r1};
 static constexpr int kNumScratchRegisters = arraysize(kScratchRegisters);
 
 #ifdef DEBUG
@@ -194,7 +194,7 @@ void BaselineAssembler::JumpIfPointer(Condition cc, Register value,
   JumpIfHelper(masm_, cc, value, tmp, target);
 }
 
-void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Smi smi,
+void BaselineAssembler::JumpIfSmi(Condition cc, Register value, Tagged<Smi> smi,
                                   Label* target, Label::Distance) {
   ASM_CODE_COMMENT(masm_);
   __ AssertSmi(value);
@@ -255,7 +255,7 @@ void BaselineAssembler::Move(interpreter::Register output, Register source) {
   Move(RegisterFrameOperand(output), source);
 }
 
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   ASM_CODE_COMMENT(masm_);
   __ mov(output, Operand(value.ptr()));
 }
@@ -432,7 +432,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
 }
 
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   ASM_CODE_COMMENT(masm_);
   ScratchRegisterScope temps(this);
   Register tmp = temps.AcquireScratch();
@@ -580,7 +580,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   if (rhs.value() == 0) return;
   __ LoadSmiLiteral(r0, rhs);
   if (SmiValuesAre31Bits()) {
diff --git a/deps/v8/src/baseline/x64/baseline-assembler-x64-inl.h b/deps/v8/src/baseline/x64/baseline-assembler-x64-inl.h
index 9f475ad4a017c1..c80c077b83b754 100644
--- a/deps/v8/src/baseline/x64/baseline-assembler-x64-inl.h
+++ b/deps/v8/src/baseline/x64/baseline-assembler-x64-inl.h
@@ -165,7 +165,7 @@ void BaselineAssembler::JumpIfPointer(Condition cc, Register value,
   __ cmpq(value, operand);
   __ j(cc, target, distance);
 }
-void BaselineAssembler::JumpIfSmi(Condition cc, Register lhs, Smi smi,
+void BaselineAssembler::JumpIfSmi(Condition cc, Register lhs, Tagged<Smi> smi,
                                   Label* target, Label::Distance distance) {
   __ SmiCompare(lhs, smi);
   __ j(cc, target, distance);
@@ -205,7 +205,7 @@ void BaselineAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
 void BaselineAssembler::Move(interpreter::Register output, Register source) {
   return __ movq(RegisterFrameOperand(output), source);
 }
-void BaselineAssembler::Move(Register output, TaggedIndex value) {
+void BaselineAssembler::Move(Register output, Tagged<TaggedIndex> value) {
   __ Move(output, value);
 }
 void BaselineAssembler::Move(MemOperand output, Register source) {
@@ -232,10 +232,12 @@ inline void PushSingle(MacroAssembler* masm, RootIndex source) {
   masm->PushRoot(source);
 }
 inline void PushSingle(MacroAssembler* masm, Register reg) { masm->Push(reg); }
-inline void PushSingle(MacroAssembler* masm, TaggedIndex value) {
+inline void PushSingle(MacroAssembler* masm, Tagged<TaggedIndex> value) {
+  masm->Push(value);
+}
+inline void PushSingle(MacroAssembler* masm, Tagged<Smi> value) {
   masm->Push(value);
 }
-inline void PushSingle(MacroAssembler* masm, Smi value) { masm->Push(value); }
 inline void PushSingle(MacroAssembler* masm, Handle<HeapObject> object) {
   masm->Push(object);
 }
@@ -336,7 +338,7 @@ void BaselineAssembler::LoadWord8Field(Register output, Register source,
   __ movb(output, FieldOperand(source, offset));
 }
 void BaselineAssembler::StoreTaggedSignedField(Register target, int offset,
-                                               Smi value) {
+                                               Tagged<Smi> value) {
   __ StoreTaggedSignedField(FieldOperand(target, offset), value);
 }
 void BaselineAssembler::StoreTaggedFieldWithWriteBarrier(Register target,
@@ -386,8 +388,9 @@ void BaselineAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
                                                 FeedbackSlot slot,
                                                 Label* on_result,
                                                 Label::Distance distance) {
-  __ MacroAssembler::TryLoadOptimizedOsrCode(
-      scratch_and_result, feedback_vector, slot, on_result, distance);
+  __ MacroAssembler::TryLoadOptimizedOsrCode(scratch_and_result,
+                                             CodeKind::MAGLEV, feedback_vector,
+                                             slot, on_result, distance);
 }
 
 void BaselineAssembler::AddToInterruptBudgetAndJumpIfNotExceeded(
@@ -516,7 +519,7 @@ void BaselineAssembler::StaModuleVariable(Register context, Register value,
   StoreTaggedFieldWithWriteBarrier(context, Cell::kValueOffset, value);
 }
 
-void BaselineAssembler::AddSmi(Register lhs, Smi rhs) {
+void BaselineAssembler::AddSmi(Register lhs, Tagged<Smi> rhs) {
   if (rhs.value() == 0) return;
   if (SmiValuesAre31Bits()) {
     __ addl(lhs, Immediate(rhs));
diff --git a/deps/v8/src/builtins/accessors.cc b/deps/v8/src/builtins/accessors.cc
index 9ac4d5266549ac..c0e840b5afd72c 100644
--- a/deps/v8/src/builtins/accessors.cc
+++ b/deps/v8/src/builtins/accessors.cc
@@ -33,18 +33,18 @@ Handle<AccessorInfo> Accessors::MakeAccessor(
   Handle<AccessorInfo> info = factory->NewAccessorInfo();
   {
     DisallowGarbageCollection no_gc;
-    auto raw = *info;
-    raw.set_all_can_read(false);
-    raw.set_all_can_write(false);
-    raw.set_is_special_data_property(true);
-    raw.set_is_sloppy(false);
-    raw.set_replace_on_access(false);
-    raw.set_getter_side_effect_type(SideEffectType::kHasSideEffect);
-    raw.set_setter_side_effect_type(SideEffectType::kHasSideEffect);
-    raw.set_name(*name);
-    raw.set_getter(isolate, reinterpret_cast<Address>(getter));
+    Tagged<AccessorInfo> raw = *info;
+    raw->set_all_can_read(false);
+    raw->set_all_can_write(false);
+    raw->set_is_special_data_property(true);
+    raw->set_is_sloppy(false);
+    raw->set_replace_on_access(false);
+    raw->set_getter_side_effect_type(SideEffectType::kHasSideEffect);
+    raw->set_setter_side_effect_type(SideEffectType::kHasSideEffect);
+    raw->set_name(*name);
+    raw->set_getter(isolate, reinterpret_cast<Address>(getter));
     if (setter == nullptr) setter = &ReconfigureToDataProperty;
-    raw.set_setter(isolate, reinterpret_cast<Address>(setter));
+    raw->set_setter(isolate, reinterpret_cast<Address>(setter));
   }
   return info;
 }
@@ -135,7 +135,7 @@ void Accessors::ArgumentsIteratorGetter(
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
   DisallowGarbageCollection no_gc;
   HandleScope scope(isolate);
-  Object result = isolate->native_context()->array_values_iterator();
+  Tagged<Object> result = isolate->native_context()->array_values_iterator();
   info.GetReturnValue().Set(Utils::ToLocal(Handle<Object>(result, isolate)));
 }
 
@@ -154,8 +154,8 @@ void Accessors::ArrayLengthGetter(
   RCS_SCOPE(isolate, RuntimeCallCounterId::kArrayLengthGetter);
   DisallowGarbageCollection no_gc;
   HandleScope scope(isolate);
-  JSArray holder = JSArray::cast(*Utils::OpenHandle(*info.Holder()));
-  Object result = holder.length();
+  Tagged<JSArray> holder = JSArray::cast(*Utils::OpenHandle(*info.Holder()));
+  Tagged<Object> result = holder->length();
   info.GetReturnValue().Set(Utils::ToLocal(Handle<Object>(result, isolate)));
 }
 
@@ -166,8 +166,8 @@ void Accessors::ArrayLengthSetter(
   RCS_SCOPE(isolate, RuntimeCallCounterId::kArrayLengthSetter);
   HandleScope scope(isolate);
 
-  DCHECK(Utils::OpenHandle(*name)->SameValue(
-      ReadOnlyRoots(isolate).length_string()));
+  DCHECK(Object::SameValue(*Utils::OpenHandle(*name),
+                           ReadOnlyRoots(isolate).length_string()));
 
   Handle<JSReceiver> object = Utils::OpenHandle(*info.Holder());
   Handle<JSArray> array = Handle<JSArray>::cast(object);
@@ -186,7 +186,7 @@ void Accessors::ArrayLengthSetter(
     // its property descriptor. Don't perform this check if "length" was
     // previously readonly, as this may have been called during
     // DefineOwnPropertyIgnoreAttributes().
-    if (length == array->length().Number()) {
+    if (length == Object::Number(array->length())) {
       info.GetReturnValue().Set(true);
     } else if (info.ShouldThrowOnError()) {
       Factory* factory = isolate->factory();
@@ -208,7 +208,7 @@ void Accessors::ArrayLengthSetter(
   }
 
   uint32_t actual_new_len = 0;
-  CHECK(array->length().ToArrayLength(&actual_new_len));
+  CHECK(Object::ToArrayLength(array->length(), &actual_new_len));
   // Fail if there were non-deletable elements.
   if (actual_new_len != length) {
     if (info.ShouldThrowOnError()) {
@@ -238,10 +238,11 @@ void Accessors::ModuleNamespaceEntryGetter(
     v8::Local<v8::Name> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
   HandleScope scope(isolate);
-  JSModuleNamespace holder =
+  Tagged<JSModuleNamespace> holder =
       JSModuleNamespace::cast(*Utils::OpenHandle(*info.Holder()));
   Handle<Object> result;
-  if (!holder.GetExport(isolate, Handle<String>::cast(Utils::OpenHandle(*name)))
+  if (!holder
+           ->GetExport(isolate, Handle<String>::cast(Utils::OpenHandle(*name)))
            .ToHandle(&result)) {
     isolate->OptionalRescheduleException(false);
   } else {
@@ -290,14 +291,14 @@ void Accessors::StringLengthGetter(
   // v8::Object, but internally we have callbacks on entities which are higher
   // in the hierarchy, in this case for String values.
 
-  Object value = *Utils::OpenHandle(*v8::Local<v8::Value>(info.This()));
-  if (!value.IsString()) {
+  Tagged<Object> value = *Utils::OpenHandle(*v8::Local<v8::Value>(info.This()));
+  if (!IsString(value)) {
     // Not a string value. That means that we either got a String wrapper or
     // a Value with a String wrapper in its prototype chain.
     value =
-        JSPrimitiveWrapper::cast(*Utils::OpenHandle(*info.Holder())).value();
+        JSPrimitiveWrapper::cast(*Utils::OpenHandle(*info.Holder()))->value();
   }
-  Object result = Smi::FromInt(String::cast(value).length());
+  Tagged<Object> result = Smi::FromInt(String::cast(value)->length());
   info.GetReturnValue().Set(Utils::ToLocal(Handle<Object>(result, isolate)));
 }
 
@@ -481,11 +482,11 @@ Handle<JSObject> GetFrameArguments(Isolate* isolate,
   // Copy the parameters to the arguments object.
   DCHECK(array->length() == length);
   for (int i = 0; i < length; i++) {
-    Object value = frame->GetParameter(i);
-    if (value.IsTheHole(isolate)) {
+    Tagged<Object> value = frame->GetParameter(i);
+    if (IsTheHole(value, isolate)) {
       // Generators currently use holes as dummy arguments when resuming.  We
       // must not leak those.
-      DCHECK(IsResumableFunction(function->shared().kind()));
+      DCHECK(IsResumableFunction(function->shared()->kind()));
       value = ReadOnlyRoots(isolate).undefined_value();
     }
     array->set(i, value);
@@ -495,7 +496,7 @@ Handle<JSObject> GetFrameArguments(Isolate* isolate,
   // For optimized functions, the frame arguments may be outdated, so we should
   // update them with the deopt info, while keeping the length and extra
   // arguments from the actual frame.
-  if (CodeKindCanDeoptimize(frame->LookupCode().kind()) && length > 0) {
+  if (CodeKindCanDeoptimize(frame->LookupCode()->kind()) && length > 0) {
     Handle<JSObject> arguments_from_deopt_info =
         ArgumentsFromDeoptInfo(frame, function_index);
     Handle<FixedArray> elements_from_deopt_info(
@@ -533,7 +534,7 @@ void Accessors::FunctionArgumentsGetter(
   Handle<JSFunction> function =
       Handle<JSFunction>::cast(Utils::OpenHandle(*info.Holder()));
   Handle<Object> result = isolate->factory()->null_value();
-  if (!function->shared().native()) {
+  if (!function->shared()->native()) {
     // Find the top invocation of the function by traversing frames.
     for (JavaScriptStackFrameIterator it(isolate); !it.done(); it.Advance()) {
       JavaScriptFrame* frame = it.frame();
@@ -556,9 +557,9 @@ Handle<AccessorInfo> Accessors::MakeFunctionArgumentsInfo(Isolate* isolate) {
 // Accessors::FunctionCaller
 //
 
-static inline bool AllowAccessToFunction(Context current_context,
-                                         JSFunction function) {
-  return current_context.HasSameSecurityTokenAs(function.context());
+static inline bool AllowAccessToFunction(Tagged<Context> current_context,
+                                         Tagged<JSFunction> function) {
+  return current_context->HasSameSecurityTokenAs(function->context());
 }
 
 class FrameFunctionIterator {
@@ -582,7 +583,7 @@ class FrameFunctionIterator {
   bool FindNextNonTopLevel() {
     do {
       if (!next().ToHandle(&function_)) return false;
-    } while (function_->shared().is_toplevel());
+    } while (function_->shared()->is_toplevel());
     return true;
   }
 
@@ -591,8 +592,8 @@ class FrameFunctionIterator {
   // unless directly exposed, in which case the native flag is set on them.
   // Returns true if one is found, and false if the iterator ends before.
   bool FindFirstNativeOrUserJavaScript() {
-    while (!function_->shared().native() &&
-           !function_->shared().IsUserJavaScript()) {
+    while (!function_->shared()->native() &&
+           !function_->shared()->IsUserJavaScript()) {
       if (!next().ToHandle(&function_)) return false;
     }
     return true;
@@ -663,7 +664,7 @@ class FrameFunctionIterator {
 MaybeHandle<JSFunction> FindCaller(Isolate* isolate,
                                    Handle<JSFunction> function) {
   FrameFunctionIterator it(isolate);
-  if (function->shared().native()) {
+  if (function->shared()->native()) {
     return MaybeHandle<JSFunction>();
   }
   // Find the function from the frames. Return null in case no frame
@@ -690,7 +691,7 @@ MaybeHandle<JSFunction> FindCaller(Isolate* isolate,
   // Censor if the caller is not a sloppy mode function.
   // Change from ES5, which used to throw, see:
   // https://bugs.ecmascript.org/show_bug.cgi?id=310
-  if (is_strict(caller->shared().language_mode())) {
+  if (is_strict(caller->shared()->language_mode())) {
     return MaybeHandle<JSFunction>();
   }
   // Don't return caller from another security context.
@@ -850,34 +851,35 @@ Handle<AccessorInfo> Accessors::MakeWrappedFunctionNameInfo(Isolate* isolate) {
 //
 
 void Accessors::ErrorStackGetter(
-    v8::Local<v8::Name> key, const v8::PropertyCallbackInfo<v8::Value>& info) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
   Isolate* isolate = reinterpret_cast<Isolate*>(info.GetIsolate());
   HandleScope scope(isolate);
-  Handle<Object> formatted_stack;
-  Handle<JSObject> error_object =
-      Handle<JSObject>::cast(Utils::OpenHandle(*info.Holder()));
-  if (!ErrorUtils::GetFormattedStack(isolate, error_object)
-           .ToHandle(&formatted_stack)) {
-    isolate->OptionalRescheduleException(false);
-    return;
+  Handle<Object> formatted_stack = isolate->factory()->undefined_value();
+  Handle<JSReceiver> maybe_error_object = Utils::OpenHandle(*info.This());
+  if (IsJSObject(*maybe_error_object)) {
+    if (!ErrorUtils::GetFormattedStack(
+             isolate, Handle<JSObject>::cast(maybe_error_object))
+             .ToHandle(&formatted_stack)) {
+      isolate->OptionalRescheduleException(false);
+      return;
+    }
   }
-  info.GetReturnValue().Set(Utils::ToLocal(formatted_stack));
+  v8::Local<v8::Value> result = Utils::ToLocal(formatted_stack);
+  CHECK(result->IsValue());
+  info.GetReturnValue().Set(result);
 }
 
 void Accessors::ErrorStackSetter(
-    v8::Local<v8::Name> name, v8::Local<v8::Value> value,
-    const v8::PropertyCallbackInfo<v8::Boolean>& info) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
   Isolate* isolate = reinterpret_cast<Isolate*>(info.GetIsolate());
   HandleScope scope(isolate);
-  Handle<JSObject> error_object =
-      Handle<JSObject>::cast(Utils::OpenHandle(*info.Holder()));
-  ErrorUtils::SetFormattedStack(isolate, error_object,
-                                Utils::OpenHandle(*value));
-}
-
-Handle<AccessorInfo> Accessors::MakeErrorStackInfo(Isolate* isolate) {
-  return MakeAccessor(isolate, isolate->factory()->stack_string(),
-                      &ErrorStackGetter, &ErrorStackSetter);
+  Handle<JSReceiver> maybe_error_object = Utils::OpenHandle(*info.This());
+  if (IsJSObject(*maybe_error_object)) {
+    v8::Local<v8::Value> value = info[0];
+    ErrorUtils::SetFormattedStack(isolate,
+                                  Handle<JSObject>::cast(maybe_error_object),
+                                  Utils::OpenHandle(*value));
+  }
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/builtins/accessors.h b/deps/v8/src/builtins/accessors.h
index f2edcd8978d8c3..b180b5094923c5 100644
--- a/deps/v8/src/builtins/accessors.h
+++ b/deps/v8/src/builtins/accessors.h
@@ -16,8 +16,6 @@ namespace internal {
 
 // Forward declarations.
 class AccessorInfo;
-template <typename T>
-class Handle;
 class FieldIndex;
 class JavaScriptFrame;
 
@@ -32,8 +30,6 @@ class JavaScriptFrame;
     kHasSideEffectToReceiver)                                                 \
   V(_, bound_function_name, BoundFunctionName, kHasNoSideEffect,              \
     kHasSideEffectToReceiver)                                                 \
-  V(_, error_stack, ErrorStack, kHasSideEffectToReceiver,                     \
-    kHasSideEffectToReceiver)                                                 \
   V(_, function_arguments, FunctionArguments, kHasNoSideEffect,               \
     kHasSideEffectToReceiver)                                                 \
   V(_, function_caller, FunctionCaller, kHasNoSideEffect,                     \
@@ -57,11 +53,14 @@ class JavaScriptFrame;
 
 #define ACCESSOR_SETTER_LIST(V) \
   V(ArrayLengthSetter)          \
-  V(ErrorStackSetter)           \
   V(FunctionPrototypeSetter)    \
   V(ModuleNamespaceEntrySetter) \
   V(ReconfigureToDataProperty)
 
+#define ACCESSOR_CALLBACK_LIST_GENERATOR(V, _) \
+  V(_, ErrorStackGetter, kHasSideEffect)       \
+  V(_, ErrorStackSetter, kHasSideEffectToReceiver)
+
 // Accessors contains all predefined proxy accessors.
 
 class Accessors : public AllStatic {
@@ -73,32 +72,37 @@ class Accessors : public AllStatic {
   ACCESSOR_INFO_LIST_GENERATOR(ACCESSOR_GETTER_DECLARATION, /* not used */)
 #undef ACCESSOR_GETTER_DECLARATION
 
-#define ACCESSOR_GETTER_DECLARATION(accessor_name)    \
-  static void accessor_name(v8::Local<v8::Name> name, \
-                            const v8::PropertyCallbackInfo<v8::Value>& info);
+#define ACCESSOR_GETTER_DECLARATION(AccessorName)    \
+  static void AccessorName(v8::Local<v8::Name> name, \
+                           const v8::PropertyCallbackInfo<v8::Value>& info);
   ACCESSOR_GETTER_LIST(ACCESSOR_GETTER_DECLARATION)
 #undef ACCESSOR_GETTER_DECLARATION
 
-#define ACCESSOR_SETTER_DECLARATION(accessor_name)          \
-  static void accessor_name(                                \
-      v8::Local<v8::Name> name, v8::Local<v8::Value> value, \
-      const v8::PropertyCallbackInfo<v8::Boolean>& info);
+#define ACCESSOR_SETTER_DECLARATION(AccessorName)      \
+  static void AccessorName(v8::Local<v8::Name> name,   \
+                           v8::Local<v8::Value> value, \
+                           const v8::PropertyCallbackInfo<v8::Boolean>& info);
   ACCESSOR_SETTER_LIST(ACCESSOR_SETTER_DECLARATION)
 #undef ACCESSOR_SETTER_DECLARATION
 
-  static constexpr int kAccessorInfoCount =
+#define ACCESSOR_CALLBACK_DECLARATION(_, AccessorName, ...) \
+  static void AccessorName(const v8::FunctionCallbackInfo<v8::Value>& info);
+  ACCESSOR_CALLBACK_LIST_GENERATOR(ACCESSOR_CALLBACK_DECLARATION,
+                                   /* not used */)
+#undef ACCESSOR_CALLBACK_DECLARATION
+
 #define COUNT_ACCESSOR(...) +1
+  static constexpr int kAccessorInfoCount =
       ACCESSOR_INFO_LIST_GENERATOR(COUNT_ACCESSOR, /* not used */);
-#undef COUNT_ACCESSOR
 
   static constexpr int kAccessorGetterCount =
-#define COUNT_ACCESSOR(...) +1
       ACCESSOR_GETTER_LIST(COUNT_ACCESSOR);
-#undef COUNT_ACCESSOR
 
   static constexpr int kAccessorSetterCount =
-#define COUNT_ACCESSOR(...) +1
       ACCESSOR_SETTER_LIST(COUNT_ACCESSOR);
+
+  static constexpr int kAccessorCallbackCount =
+      ACCESSOR_CALLBACK_LIST_GENERATOR(COUNT_ACCESSOR, /* not used */);
 #undef COUNT_ACCESSOR
 
   static Handle<AccessorInfo> MakeModuleNamespaceEntryInfo(Isolate* isolate,
diff --git a/deps/v8/src/builtins/aggregate-error.tq b/deps/v8/src/builtins/aggregate-error.tq
index c811403274ddbb..871fa6f8e3be4e 100644
--- a/deps/v8/src/builtins/aggregate-error.tq
+++ b/deps/v8/src/builtins/aggregate-error.tq
@@ -7,8 +7,8 @@
 namespace error {
 
 transitioning javascript builtin AggregateErrorConstructor(
-    js-implicit context: NativeContext, target: JSFunction,
-    newTarget: JSAny)(...arguments): JSAny {
+    js-implicit context: NativeContext, target: JSFunction, newTarget: JSAny)(
+    ...arguments): JSAny {
   // 1. If NewTarget is undefined, let newTarget be the active function
   // object, else let newTarget be NewTarget.
   // 2. Let O be ? OrdinaryCreateFromConstructor(newTarget,
diff --git a/deps/v8/src/builtins/arm/builtins-arm.cc b/deps/v8/src/builtins/arm/builtins-arm.cc
index b7996476c74235..9a465695ca8ed7 100644
--- a/deps/v8/src/builtins/arm/builtins-arm.cc
+++ b/deps/v8/src/builtins/arm/builtins-arm.cc
@@ -241,19 +241,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   // Call the function.
   __ InvokeFunctionWithNewTarget(r1, r3, r0, InvokeType::kCall);
 
-  // ----------- S t a t e -------------
-  //  --                 r0: constructor result
-  //  -- sp[0*kPointerSize]: implicit receiver
-  //  -- sp[1*kPointerSize]: padding
-  //  -- sp[2*kPointerSize]: constructor function
-  //  -- sp[3*kPointerSize]: number of arguments
-  //  -- sp[4*kPointerSize]: context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -451,9 +438,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     // undefined because generator functions are non-constructable.
     __ Move(r3, r1);
     __ Move(r1, r4);
-    static_assert(kJavaScriptCallCodeStartRegister == r2, "ABI mismatch");
-    __ ldr(r2, FieldMemOperand(r1, JSFunction::kCodeOffset));
-    __ JumpCodeObject(r2);
+    __ JumpJSFunction(r1);
   }
 
   __ bind(&prepare_step_in_if_stepping);
@@ -771,9 +756,7 @@ static void Generate_JSEntryTrampolineHelper(MacroAssembler* masm,
     __ mov(r5, r4);
     __ mov(r6, r4);
     __ mov(r8, r4);
-    if (kR9Available == 1) {
-      __ mov(r9, r4);
-    }
+    __ mov(r9, r4);
 
     // Invoke the code.
     Handle<Code> builtin = is_construct
@@ -920,12 +903,18 @@ static void AdvanceBytecodeOffsetOrReturn(MacroAssembler* masm,
 
 namespace {
 
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array,
-                      Register scratch) {
-  DCHECK(!AreAliased(bytecode_array, scratch));
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi,
+                                Register scratch) {
+  DCHECK(!AreAliased(sfi, scratch));
   __ mov(scratch, Operand(0));
-  __ strh(scratch,
-          FieldMemOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset));
+  __ strh(scratch, FieldMemOperand(sfi, SharedFunctionInfo::kAgeOffset));
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function,
+                        Register scratch1, Register scratch2) {
+  __ Move(scratch1,
+          FieldMemOperand(js_function, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, scratch1, scratch2);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
@@ -933,8 +922,7 @@ void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
   DCHECK(!AreAliased(feedback_vector, scratch));
   __ ldrb(scratch,
           FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
-  __ and_(scratch, scratch,
-          Operand(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ and_(scratch, scratch, Operand(~FeedbackVector::OsrUrgencyBits::kMask));
   __ strb(scratch,
           FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
 }
@@ -955,7 +943,8 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   Register feedback_vector = temps.Acquire();
   __ ldr(feedback_vector,
          FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ ldr(feedback_vector, FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ ldr(feedback_vector,
+         FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
   __ AssertFeedbackVector(feedback_vector);
 
   // Check the tiering state.
@@ -999,6 +988,11 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
         BaselineOutOfLinePrologueDescriptor::kCalleeContext);
     Register callee_js_function = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kClosure);
+    {
+      UseScratchRegisterScope temps(masm);
+      ResetJSFunctionAge(masm, callee_js_function, temps.Acquire(),
+                         temps.Acquire());
+    }
     __ Push(callee_context, callee_js_function);
     DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
     DCHECK_EQ(callee_js_function, kJSFunctionRegister);
@@ -1009,10 +1003,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // the frame, so load it into a register.
     Register bytecodeArray = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray);
-    {
-      UseScratchRegisterScope temps(masm);
-      ResetBytecodeAge(masm, bytecodeArray, temps.Acquire());
-    }
     __ Push(argc, bytecodeArray);
 
     // Baseline code frames store the feedback vector where interpreter would
@@ -1122,6 +1112,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // Get the bytecode array from the function object and load it into
   // kInterpreterBytecodeArrayRegister.
   __ ldr(r4, FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, r4, r8);
   __ ldr(kInterpreterBytecodeArrayRegister,
          FieldMemOperand(r4, SharedFunctionInfo::kFunctionDataOffset));
 
@@ -1141,7 +1132,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   Register feedback_vector = r2;
   __ ldr(feedback_vector,
          FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ ldr(feedback_vector, FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ ldr(feedback_vector,
+         FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label push_stack_frame;
   // Check if feedback vector is valid. If valid, check for optimized code
@@ -1185,8 +1177,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ PushStandardFrame(closure);
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister, r9);
-
   // Load the initial bytecode offset.
   __ mov(kInterpreterBytecodeOffsetRegister,
          Operand(BytecodeArray::kHeaderSize - kHeapObjectTag));
@@ -1325,7 +1315,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ ldr(feedback_vector,
            FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
     __ ldr(feedback_vector,
-           FieldMemOperand(feedback_vector, Cell::kValueOffset));
+           FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1494,11 +1484,182 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   }
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- r0 : argument count
+  // -- r1 : constructor to call (checked to be a JSFunction)
+  // -- r3 : new target
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+  Register implicit_receiver = r4;
+
+  // Save live registers.
+  __ SmiTag(r0);
+  __ Push(r0, r1, r3);
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  // Save result.
+  __ Move(implicit_receiver, r0);
+  // Restore live registers.
+  __ Pop(r0, r1, r3);
+  __ SmiUntag(r0);
+
+  // Patch implicit receiver (in arguments)
+  __ str(implicit_receiver, MemOperand(sp, 0 * kPointerSize));
+  // Patch second implicit (in construct frame)
+  __ str(implicit_receiver,
+         MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+
+  // Restore context.
+  __ ldr(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- r0 : argument count
+  // -- r1 : constructor to call (checked to be a JSFunction)
+  // -- r3 : new target
+  // -- r4 : address of the first argument
+  // -- cp/r7 : context pointer
+  // -----------------------------------
+  __ AssertFunction(r1);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  __ LoadMap(r2, r1);
+  __ ldrb(r2, FieldMemOperand(r2, Map::kBitFieldOffset));
+  __ tst(r2, Operand(Map::Bits1::IsConstructorBit::kMask));
+  __ b(eq, &non_constructor);
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(r0, r2, &stack_overflow);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+  // Implicit receiver stored in the construct frame.
+  __ LoadRoot(r2, RootIndex::kTheHoleValue);
+  __ Push(cp, r2);
+
+  // Push arguments + implicit receiver.
+  Register argc_without_receiver = r6;
+  __ sub(argc_without_receiver, r0, Operand(kJSArgcReceiverSlots));
+  // Push the arguments. r4 and r5 will be modified.
+  GenerateInterpreterPushArgs(masm, argc_without_receiver, r4, r5);
+  // Implicit receiver as part of the arguments (patched later if needed).
+  __ push(r2);
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  __ ldr(r2, FieldMemOperand(r1, JSFunction::kSharedFunctionInfoOffset));
+  __ ldr(r2, FieldMemOperand(r2, SharedFunctionInfo::kFlagsOffset));
+  __ tst(r2, Operand(SharedFunctionInfo::ConstructAsBuiltinBit::kMask));
+  __ b(ne, &builtin_call);
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(r2);
+  __ JumpIfIsInRange(
+      r2, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor),
+      &not_create_implicit_receiver);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the function.
+  __ InvokeFunctionWithNewTarget(r1, r3, r0, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- r0     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label use_receiver, do_throw, leave_and_return, check_receiver;
+
+  // If the result is undefined, we jump out to using the implicit receiver.
+  __ JumpIfNotRoot(r0, RootIndex::kUndefinedValue, &check_receiver);
+
+  // Otherwise we do a smi check and fall through to check if the return value
+  // is a valid receiver.
+
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ bind(&use_receiver);
+  __ ldr(r0,
+         MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+  __ JumpIfRoot(r0, RootIndex::kTheHoleValue, &do_throw);
+
+  __ bind(&leave_and_return);
+  // Leave construct frame.
+  __ LeaveFrame(StackFrame::CONSTRUCT);
+  __ Jump(lr);
+
+  __ bind(&check_receiver);
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(r0, &use_receiver);
+
+  // If the type of the result (stored in its map) is less than
+  // FIRST_JS_RECEIVER_TYPE, it is not an object in the ECMA sense.
+  static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
+  __ CompareObjectType(r0, r4, r5, FIRST_JS_RECEIVER_TYPE);
+  __ b(ge, &leave_and_return);
+  __ b(&use_receiver);
+
+  __ bind(&builtin_call);
+  // TODO(victorgomes): Check the possibility to turn this into a tailcall.
+  __ InvokeFunctionWithNewTarget(r1, r3, r0, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Jump(lr);
+
+  __ bind(&do_throw);
+  // Restore the context from the frame.
+  __ ldr(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  __ bkpt(0);
+
+  __ bind(&stack_overflow);
+  // Restore the context from the frame.
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  // Unreachable code.
+  __ bkpt(0);
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Set the return address to the correct point in the interpreter entry
   // trampoline.
   Label builtin_trampoline, trampoline_loaded;
-  Smi interpreter_entry_return_pc_offset(
+  Tagged<Smi> interpreter_entry_return_pc_offset(
       masm->isolate()->heap()->interpreter_entry_return_pc_offset());
   DCHECK_NE(interpreter_entry_return_pc_offset, Smi::zero());
 
@@ -1516,7 +1677,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
 
   __ ldr(r2,
          FieldMemOperand(r2, InterpreterData::kInterpreterTrampolineOffset));
-  __ LoadCodeEntry(r2, r2);
+  __ LoadCodeInstructionStart(r2, r2);
   __ b(&trampoline_loaded);
 
   __ bind(&builtin_trampoline);
@@ -1671,7 +1832,7 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
   __ add(sp, sp,
          Operand(BuiltinContinuationFrameConstants::kFixedFrameSizeFromFp));
   __ Pop(lr);
-  __ LoadEntryFromBuiltinIndex(builtin);
+  __ LoadEntryFromBuiltinIndex(builtin, builtin);
   __ bx(builtin);
 }
 }  // namespace
@@ -1779,7 +1940,7 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
   __ ldr(r1,
          FieldMemOperand(r0, Code::kDeoptimizationDataOrInterpreterDataOffset));
 
-  __ LoadCodeEntry(r0, r0);
+  __ LoadCodeInstructionStart(r0, r0);
 
   {
     ConstantPoolUnavailableScope constant_pool_unavailable(masm);
@@ -1811,6 +1972,31 @@ void Builtins::Generate_BaselineOnStackReplacement(MacroAssembler* masm) {
                      D::MaybeTargetCodeRegister());
 }
 
+#ifdef V8_ENABLE_MAGLEV
+
+void Builtins::Generate_MaglevFunctionEntryStackCheck(MacroAssembler* masm,
+                                                      bool save_new_target) {
+  // Input (r0): Stack size (Smi).
+  // This builtin can be invoked just after Maglev's prologue.
+  // All registers are available, except (possibly) new.target.
+  ASM_CODE_COMMENT(masm);
+  {
+    FrameScope scope(masm, StackFrame::INTERNAL);
+    __ AssertSmi(r0);
+    if (save_new_target) {
+      __ Push(kJavaScriptCallNewTargetRegister);
+    }
+    __ Push(r0);
+    __ CallRuntime(Runtime::kStackGuardWithGap, 1);
+    if (save_new_target) {
+      __ Pop(kJavaScriptCallNewTargetRegister);
+    }
+  }
+  __ Ret();
+}
+
+#endif  // V8_ENABLE_MAGLEV
+
 // static
 void Builtins::Generate_FunctionPrototypeApply(MacroAssembler* masm) {
   // ----------- S t a t e -------------
@@ -2014,7 +2200,7 @@ void Generate_AllocateSpaceAndShiftExistingArguments(
 }  // namespace
 
 // static
-// TODO(v8:11615): Observe InstructionStream::kMaxArguments in
+// TODO(v8:11615): Observe Code::kMaxArguments in
 // CallOrConstructVarargs
 void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
                                                Handle<Code> code) {
@@ -2203,7 +2389,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ LoadGlobalProxy(r3);
     } else {
       Label convert_to_object, convert_receiver;
-      __ ldr(r3, __ ReceiverOperand(r0));
+      __ ldr(r3, __ ReceiverOperand());
       __ JumpIfSmi(r3, &convert_to_object);
       static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
       __ CompareObjectType(r3, r4, r4, FIRST_JS_RECEIVER_TYPE);
@@ -2239,7 +2425,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ ldr(r2, FieldMemOperand(r1, JSFunction::kSharedFunctionInfoOffset));
       __ bind(&convert_receiver);
     }
-    __ str(r3, __ ReceiverOperand(r0));
+    __ str(r3, __ ReceiverOperand());
   }
   __ bind(&done_convert);
 
@@ -2345,7 +2531,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
 
   // Patch the receiver to [[BoundThis]].
   __ ldr(r3, FieldMemOperand(r1, JSBoundFunction::kBoundThisOffset));
-  __ str(r3, __ ReceiverOperand(r0));
+  __ str(r3, __ ReceiverOperand());
 
   // Push the [[BoundArguments]] onto the stack.
   Generate_PushBoundArguments(masm);
@@ -2362,11 +2548,10 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   //  -- r0 : the number of arguments
   //  -- r1 : the target to call (can be any Object).
   // -----------------------------------
-  Register argc = r0;
   Register target = r1;
   Register map = r4;
   Register instance_type = r5;
-  DCHECK(!AreAliased(argc, target, map, instance_type));
+  DCHECK(!AreAliased(r0, target, map, instance_type));
 
   Label non_callable, class_constructor;
   __ JumpIfSmi(target, &non_callable);
@@ -2407,7 +2592,7 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   // 2. Call to something else, which might have a [[Call]] internal method (if
   // not we raise an exception).
   // Overwrite the original receiver the (original) target.
-  __ str(target, __ ReceiverOperand(argc));
+  __ str(target, __ ReceiverOperand());
   // Let the "call_as_function_delegate" take care of the rest.
   __ LoadNativeContextSlot(target, Context::CALL_AS_FUNCTION_DELEGATE_INDEX);
   __ Jump(masm->isolate()->builtins()->CallFunction(
@@ -2494,11 +2679,10 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   //  -- r3 : the new target (either the same as the constructor or
   //          the JSFunction on which new was invoked initially)
   // -----------------------------------
-  Register argc = r0;
   Register target = r1;
   Register map = r4;
   Register instance_type = r5;
-  DCHECK(!AreAliased(argc, target, map, instance_type));
+  DCHECK(!AreAliased(r0, target, map, instance_type));
 
   // Check if target is a Smi.
   Label non_constructor, non_proxy;
@@ -2508,7 +2692,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ ldr(map, FieldMemOperand(target, HeapObject::kMapOffset));
   {
     Register flags = r2;
-    DCHECK(!AreAliased(argc, target, map, instance_type, flags));
+    DCHECK(!AreAliased(r0, target, map, instance_type, flags));
     __ ldrb(flags, FieldMemOperand(map, Map::kBitFieldOffset));
     __ tst(flags, Operand(Map::Bits1::IsConstructorBit::kMask));
     __ b(eq, &non_constructor);
@@ -2536,7 +2720,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ bind(&non_proxy);
   {
     // Overwrite the original receiver with the (original) target.
-    __ str(target, __ ReceiverOperand(argc));
+    __ str(target, __ ReceiverOperand());
     // Let the "call_as_constructor_delegate" take care of the rest.
     __ LoadNativeContextSlot(target,
                              Context::CALL_AS_CONSTRUCTOR_DELEGATE_INDEX);
@@ -2713,14 +2897,30 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
   __ Ret();
 }
 
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
-  // TODO(v8:10701): Implement for this platform.
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
+  // TODO(v8:12191): Implement for this platform.
   __ Trap();
 }
 
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
-  // TODO(v8:12191): Implement for this platform.
-  __ Trap();
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) {
+  // Push registers in reverse order so that they are on the stack like
+  // in an array, with the first item being at the lowest address.
+  for (int i = static_cast<int>(arraysize(wasm::kFpParamRegisters)) - 1; i >= 0;
+       --i) {
+    __ vpush(wasm::kFpParamRegisters[i]);
+  }
+
+  // r6 is pushed for alignment, so that the pushed register parameters and
+  // stack parameters look the same as the layout produced by the js-to-wasm
+  // wrapper for out-going parameters. Having the same layout allows to share
+  // code in Torque, especially the `LocationAllocator`. r6 has been picked
+  // arbitrarily.
+  __ Push(r6, wasm::kGpParamRegisters[3], wasm::kGpParamRegisters[2],
+          wasm::kGpParamRegisters[1]);
+  // Push an arbitrary register to reserve stack space for the signature which
+  // will be spilled on the stack in Torque.
+  __ Push(r0);
+  __ TailCallBuiltin(Builtin::kWasmToJsWrapperCSA);
 }
 
 void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
@@ -2742,10 +2942,166 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
   // Only needed on x64.
   __ Trap();
 }
+
+void ResetStackSwitchFrameStackSlots(MacroAssembler* masm) {
+  Register zero = r0;
+  __ Move(zero, Smi::zero());
+  __ str(zero, MemOperand(fp, StackSwitchFrameConstants::kResultArrayOffset));
+  __ str(zero, MemOperand(fp, StackSwitchFrameConstants::kInstanceOffset));
+}
+
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) {
+  __ EnterFrame(StackFrame::JS_TO_WASM);
+
+  constexpr int kNumSpillSlots = StackSwitchFrameConstants::kNumSpillSlots;
+  __ AllocateStackSpace(kNumSpillSlots * kSystemPointerSize);
+  ResetStackSwitchFrameStackSlots(masm);
+
+  Register wrapper_buffer =
+      WasmJSToWasmWrapperDescriptor::WrapperBufferRegister();
+  // Push the wrapper_buffer stack, it's needed later for the results.
+  __ str(wrapper_buffer,
+         MemOperand(fp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset));
+
+  Register result_size = r0;
+  __ ldr(
+      result_size,
+      MemOperand(
+          wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferSize));
+  __ sub(sp, sp, Operand(result_size, LSL, kPointerSizeLog2));
+
+  __ str(
+      sp,
+      MemOperand(
+          wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferStart));
+  // Push stack parameters on the stack.
+  Register params_end = r9;
+  __ ldr(params_end,
+         MemOperand(wrapper_buffer,
+                    JSToWasmWrapperFrameConstants::kWrapperBufferParamEnd));
+
+  Register params_start = r4;
+  __ ldr(params_start,
+         MemOperand(wrapper_buffer,
+                    JSToWasmWrapperFrameConstants::kWrapperBufferParamStart));
+
+  // The first GP parameter is the instance, which we handle specially.
+  int stack_params_offset =
+      (arraysize(wasm::kGpParamRegisters) - 1) * kSystemPointerSize +
+      arraysize(wasm::kFpParamRegisters) * kDoubleSize;
+  int param_padding = stack_params_offset & kSystemPointerSize;
+  stack_params_offset += param_padding;
+  Register last_stack_param = r0;
+  __ add(last_stack_param, params_start, Operand(stack_params_offset));
+
+  Label loop_start;
+  __ bind(&loop_start);
+
+  Label finish_stack_params;
+  __ cmp(last_stack_param, params_end);
+  __ b(ge, &finish_stack_params);
+
+  // Push parameter
+  {
+    Register scratch = r1;
+    __ ldr(scratch, MemOperand(params_end, -kSystemPointerSize, PreIndex));
+    __ push(scratch);
+  }
+
+  __ jmp(&loop_start);
+
+  __ bind(&finish_stack_params);
+
+  size_t next_offset = 0;
+  for (size_t i = 1; i < arraysize(wasm::kGpParamRegisters); ++i) {
+    // Check that {params_start} does not overlap with any of the parameter
+    // registers, so that we don't overwrite it by accident with the loads
+    // below.
+    DCHECK_NE(params_start, wasm::kGpParamRegisters[i]);
+    __ ldr(wasm::kGpParamRegisters[i], MemOperand(params_start, next_offset));
+    next_offset += kSystemPointerSize;
+  }
+
+  next_offset += param_padding;
+  for (size_t i = 0; i < arraysize(wasm::kFpParamRegisters); ++i) {
+    __ vldr(wasm::kFpParamRegisters[i], MemOperand(params_start, next_offset));
+    next_offset += kDoubleSize;
+  }
+  DCHECK_EQ(next_offset, stack_params_offset);
+
+  // Load the instance into r3.
+  __ ldr(kWasmInstanceRegister,
+         MemOperand(fp, JSToWasmWrapperFrameConstants::kInstanceParamOffset));
+
+  {
+    Register thread_in_wasm_flag_addr = r1;
+    __ ldr(thread_in_wasm_flag_addr,
+           MemOperand(kRootRegister,
+                      Isolate::thread_in_wasm_flag_address_offset()));
+    Register scratch = r9;
+    __ mov(scratch, Operand(1));
+    __ str(scratch, MemOperand(thread_in_wasm_flag_addr, 0));
+  }
+
+  Register function_entry = r1;
+  __ ldr(function_entry,
+         MemOperand(wrapper_buffer,
+                    JSToWasmWrapperFrameConstants::kWrapperBufferCallTarget));
+  __ Call(function_entry);
+  {
+    Register thread_in_wasm_flag_addr = r4;
+    __ ldr(thread_in_wasm_flag_addr,
+           MemOperand(kRootRegister,
+                      Isolate::thread_in_wasm_flag_address_offset()));
+    Register scratch = r9;
+    __ mov(scratch, Operand(0));
+    __ str(scratch, MemOperand(thread_in_wasm_flag_addr, 0));
+  }
+
+  // `wrapper_buffer` is a parameter for `JSToWasmHandleReturns`, it therefore
+  // has to be in r2.
+  wrapper_buffer = r2;
+  __ ldr(wrapper_buffer,
+         MemOperand(fp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset));
+
+  __ vstr(wasm::kFpReturnRegisters[0],
+          MemOperand(
+              wrapper_buffer,
+              JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister1));
+  __ vstr(wasm::kFpReturnRegisters[1],
+          MemOperand(
+              wrapper_buffer,
+              JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister2));
+  __ str(wasm::kGpReturnRegisters[0],
+         MemOperand(
+             wrapper_buffer,
+             JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister1));
+  __ str(wasm::kGpReturnRegisters[1],
+         MemOperand(
+             wrapper_buffer,
+             JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister2));
+
+  // r0: wasm instance.
+  // r1: the result JSArray for multi-return.
+  // r2: pointer to the byte buffer which contains all parameters.
+  __ ldr(r1, MemOperand(
+                 fp, JSToWasmWrapperFrameConstants::kResultArrayParamOffset));
+  __ ldr(r0,
+         MemOperand(fp, JSToWasmWrapperFrameConstants::kInstanceParamOffset));
+  __ Call(BUILTIN_CODE(masm->isolate(), JSToWasmHandleReturns),
+          RelocInfo::CODE_TARGET);
+
+  __ LeaveFrame(StackFrame::JS_TO_WASM);
+  __ add(sp, sp, Operand(2 * kSystemPointerSize), LeaveCC);
+  __ Jump(lr);
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   // Called from JavaScript; parameters are on stack as if calling JS function.
   // r0: number of arguments including receiver
   // r1: pointer to builtin function
@@ -2984,312 +3340,307 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ Ret();
 }
 
-namespace {
-
-int AddressOffset(ExternalReference ref0, ExternalReference ref1) {
-  return ref0.address() - ref1.address();
-}
-
-// Calls an API function.  Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.  Restores context.  stack_space
-// - space to be unwound on exit (includes the call JS arguments space and
-// the additional space allocated for the fast call).
-void CallApiFunctionAndReturn(MacroAssembler* masm, Register function_address,
-                              ExternalReference thunk_ref, int stack_space,
-                              MemOperand* stack_space_operand,
-                              MemOperand return_value_operand) {
-  ASM_CODE_COMMENT(masm);
-  Isolate* isolate = masm->isolate();
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  const int kNextOffset = 0;
-  const int kLimitOffset = AddressOffset(
-      ExternalReference::handle_scope_limit_address(isolate), next_address);
-  const int kLevelOffset = AddressOffset(
-      ExternalReference::handle_scope_level_address(isolate), next_address);
-
-  DCHECK(function_address == r1 || function_address == r2);
-
-  // Allocate HandleScope in callee-save registers.
-  __ Move(r9, next_address);
-  __ ldr(r4, MemOperand(r9, kNextOffset));
-  __ ldr(r5, MemOperand(r9, kLimitOffset));
-  __ ldr(r6, MemOperand(r9, kLevelOffset));
-  __ add(r6, r6, Operand(1));
-  __ str(r6, MemOperand(r9, kLevelOffset));
-
-  Label profiler_enabled, done_api_call;
-  __ ldrb(r8, __ ExternalReferenceAsOperand(
-                  ExternalReference::is_profiling_address(isolate), r8));
-  __ cmp(r8, Operand(0));
-  __ b(ne, &profiler_enabled);
-#ifdef V8_RUNTIME_CALL_STATS
-  __ Move(r8, ExternalReference::address_of_runtime_stats_flag());
-  __ ldr(r8, MemOperand(r8, 0));
-  __ cmp(r8, Operand(0));
-  __ b(ne, &profiler_enabled);
-#endif  // V8_RUNTIME_CALL_STATS
-
-  // Call the api function directly.
-  __ StoreReturnAddressAndCall(function_address);
-  __ bind(&done_api_call);
-
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-  Label return_value_loaded;
-
-  // load value from ReturnValue
-  __ ldr(r0, return_value_operand);
-  __ bind(&return_value_loaded);
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ str(r4, MemOperand(r9, kNextOffset));
-  if (v8_flags.debug_code) {
-    __ ldr(r1, MemOperand(r9, kLevelOffset));
-    __ cmp(r1, r6);
-    __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall);
-  }
-  __ sub(r6, r6, Operand(1));
-  __ str(r6, MemOperand(r9, kLevelOffset));
-  __ ldr(r6, MemOperand(r9, kLimitOffset));
-  __ cmp(r5, r6);
-  __ b(ne, &delete_allocated_handles);
-
-  // Leave the API exit frame.
-  __ bind(&leave_exit_frame);
-  // LeaveExitFrame expects unwind space to be in a register.
-  if (stack_space_operand == nullptr) {
-    DCHECK_NE(stack_space, 0);
-    __ mov(r4, Operand(stack_space));
-  } else {
-    DCHECK_EQ(stack_space, 0);
-    __ ldr(r4, *stack_space_operand);
-  }
-  __ LeaveExitFrame(r4, stack_space_operand != nullptr);
-
-  // Check if the function scheduled an exception.
-  __ LoadRoot(r4, RootIndex::kTheHoleValue);
-  __ Move(r6, ExternalReference::scheduled_exception_address(isolate));
-  __ ldr(r5, MemOperand(r6));
-  __ cmp(r4, r5);
-  __ b(ne, &promote_scheduled_exception);
-
-  __ mov(pc, lr);
-
-  // Call the api function via thunk wrapper.
-  __ bind(&profiler_enabled);
-  // Additional parameter is the address of the actual callback.
-  __ Move(r3, function_address);
-  __ Move(r8, thunk_ref);
-  __ StoreReturnAddressAndCall(r8);
-  __ b(&done_api_call);
-
-  // Re-throw by promoting a scheduled exception.
-  __ bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  __ bind(&delete_allocated_handles);
-  __ str(r5, MemOperand(r9, kLimitOffset));
-  __ mov(r4, r0);
-  __ PrepareCallCFunction(1);
-  __ Move(r0, ExternalReference::isolate_address(isolate));
-  __ CallCFunction(ExternalReference::delete_handle_scope_extensions(), 1);
-  __ mov(r0, r4);
-  __ jmp(&leave_exit_frame);
-}
-
-MemOperand ExitFrameStackSlotOperand(int offset) {
-  static constexpr int kFrameOffset = 1 * kPointerSize;
-  return MemOperand(sp, kFrameOffset + offset);
-}
-
-MemOperand ExitFrameCallerStackSlotOperand(int index) {
-  return MemOperand(
-      fp, (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
-              kSystemPointerSize);
-}
-
-}  // namespace
-
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- cp                  : context
+  // CallApiCallbackMode::kGeneric mode:
+  //  -- r2                  : arguments count (not including the receiver)
+  //  -- r3                  : call handler info
+  //  -- r0                  : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
   //  -- r1                  : api function address
   //  -- r2                  : arguments count (not including the receiver)
   //  -- r3                  : call data
   //  -- r0                  : holder
+  // Both modes:
+  //  -- cp                  : context
   //  -- sp[0]               : receiver
   //  -- sp[8]               : first argument
   //  -- ...
   //  -- sp[(argc) * 8]      : last argument
   // -----------------------------------
 
-  Register api_function_address = r1;
-  Register argc = r2;
-  Register call_data = r3;
-  Register holder = r0;
-  Register scratch = r4;
+  Register function_callback_info_arg = arg_reg_1;
 
-  DCHECK(!AreAliased(api_function_address, argc, call_data, holder, scratch));
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register callback = no_reg;
+  Register holder = no_reg;
+  Register scratch = r4;
+  Register scratch2 = r5;
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = r1;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, holder, call_data, callback,
+                     scratch, scratch2));
 
-  using FCI = FunctionCallbackInfo<v8::Value>;
   using FCA = FunctionCallbackArguments;
 
   static_assert(FCA::kArgsLength == 6);
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
   // Set up FunctionCallbackInfo's implicit_args on the stack as follows:
-  //
   // Target state:
-  //   sp[0 * kPointerSize]: kHolder   <= FCI::implicit_args_
-  //   sp[1 * kPointerSize]: kIsolate
-  //   sp[2 * kPointerSize]: undefined (kReturnValueDefaultValue)
-  //   sp[3 * kPointerSize]: undefined (kReturnValue)
-  //   sp[4 * kPointerSize]: kData
-  //   sp[5 * kPointerSize]: undefined (kNewTarget)
+  //   sp[1 * kSystemPointerSize]: kHolder   <= FCA::implicit_args_
+  //   sp[2 * kSystemPointerSize]: kIsolate
+  //   sp[3 * kSystemPointerSize]: Smi::zero(padding, unused)
+  //   sp[4 * kSystemPointerSize]: undefined (kReturnValue)
+  //   sp[5 * kSystemPointerSize]: kData
+  //   sp[6 * kSystemPointerSize]: undefined (kNewTarget)
   // Existing state:
-  //   sp[6 * kPointerSize]:            <= FCI:::values_
+  //   sp[7 * kSystemPointerSize]:            <= FCA:::values_
 
   // Reserve space on the stack.
-  __ AllocateStackSpace(FCA::kArgsLength * kPointerSize);
+  __ AllocateStackSpace(FCA::kArgsLength * kSystemPointerSize);
 
-  // kHolder.
-  __ str(holder, MemOperand(sp, 0 * kPointerSize));
+  // kHolder
+  __ str(holder, MemOperand(sp, FCA::kHolderIndex * kSystemPointerSize));
 
   // kIsolate.
   __ Move(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ str(scratch, MemOperand(sp, 1 * kPointerSize));
+  __ str(scratch, MemOperand(sp, FCA::kIsolateIndex * kSystemPointerSize));
 
-  // kReturnValueDefaultValue and kReturnValue.
+  // kUnused
+  __ Move(scratch, Smi::zero());
+  __ str(scratch, MemOperand(sp, FCA::kUnusedIndex * kSystemPointerSize));
+  // kReturnValue
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ str(scratch, MemOperand(sp, 2 * kPointerSize));
-  __ str(scratch, MemOperand(sp, 3 * kPointerSize));
+  __ str(scratch, MemOperand(sp, FCA::kReturnValueIndex * kSystemPointerSize));
 
   // kData.
-  __ str(call_data, MemOperand(sp, 4 * kPointerSize));
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ ldr(scratch2, FieldMemOperand(callback, CallHandlerInfo::kDataOffset));
+      __ str(scratch2, MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ str(call_data, MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+  }
 
   // kNewTarget.
-  __ str(scratch, MemOperand(sp, 5 * kPointerSize));
+  __ str(scratch, MemOperand(sp, FCA::kNewTargetIndex * kSystemPointerSize));
 
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  __ mov(scratch, sp);
+  __ mov(holder, sp);
 
   // Allocate the v8::Arguments structure in the arguments' space since
   // it's not controlled by GC.
-  static constexpr int kSlotsToDropSize = 1 * kPointerSize;
+  static constexpr int kSlotsToDropOnStackSize = 1 * kPointerSize;
   static constexpr int kApiStackSpace =
-      (FCI::kSize + kSlotsToDropSize) / kPointerSize;
+      (FCA::kSize + kSlotsToDropOnStackSize) / kPointerSize;
   static_assert(kApiStackSpace == 4);
-  static_assert(FCI::kImplicitArgsOffset == 0);
-  static_assert(FCI::kValuesOffset == 1 * kPointerSize);
-  static_assert(FCI::kLengthOffset == 2 * kPointerSize);
+  static_assert(FCA::kImplicitArgsOffset == 0);
+  static_assert(FCA::kValuesOffset == 1 * kPointerSize);
+  static_assert(FCA::kLengthOffset == 2 * kPointerSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
 
   FrameScope frame_scope(masm, StackFrame::MANUAL);
-  __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
-
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  // Arguments are after the return address (pushed by EnterExitFrame()).
-  __ str(scratch, ExitFrameStackSlotOperand(FCI::kImplicitArgsOffset));
-
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  __ add(scratch, scratch,
-         Operand(FCA::kArgsLengthWithReceiver * kPointerSize));
-  __ str(scratch, ExitFrameStackSlotOperand(FCI::kValuesOffset));
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+    __ AllocateStackSpace(exit_frame_params_count * kSystemPointerSize);
+
+    // No padding is required.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize == 0);
+
+    // Context parameter.
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ str(kContextRegister, MemOperand(sp, 2 * kSystemPointerSize));
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ SmiTag(scratch, argc);
+    __ str(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ ldr(scratch,
+           FieldMemOperand(callback, CallHandlerInfo::kOwnerTemplateOffset));
+    __ str(scratch, MemOperand(sp, 0 * kSystemPointerSize));
+
+    __ ldr(api_function_address,
+           FieldMemOperand(callback,
+                           CallHandlerInfo::kMaybeRedirectedCallbackOffset));
+
+    __ EnterExitFrame(kApiStackSpace, StackFrame::API_CALLBACK_EXIT);
+  } else {
+    __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  }
 
-  // FunctionCallbackInfo::length_.
-  __ str(argc, ExitFrameStackSlotOperand(FCI::kLengthOffset));
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    // Arguments are after the return address (pushed by EnterExitFrame()).
+    __ str(holder, ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset));
+
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ add(holder, holder,
+           Operand(FCA::kArgsLengthWithReceiver * kPointerSize));
+    __ str(holder, ExitFrameStackSlotOperand(FCA::kValuesOffset));
+
+    // FunctionCallbackInfo::length_.
+    __ str(argc, ExitFrameStackSlotOperand(FCA::kLengthOffset));
+  }
 
   // We also store the number of bytes to drop from the stack after returning
   // from the API function here.
   MemOperand stack_space_operand =
-      ExitFrameStackSlotOperand(FCI::kLengthOffset + kSlotsToDropSize);
-  __ mov(scratch,
-         Operand((FCA::kArgsLength + 1 /* receiver */) * kPointerSize));
+      ExitFrameStackSlotOperand(FCA::kLengthOffset + kSlotsToDropOnStackSize);
+  __ mov(scratch, Operand((FCA::kArgsLength + 1 /* receiver */ +
+                           exit_frame_params_count) *
+                          kPointerSize));
   __ add(scratch, scratch, Operand(argc, LSL, kPointerSizeLog2));
   __ str(scratch, stack_space_operand);
 
-  // v8::InvocationCallback's argument.
-  __ add(r0, sp, Operand(1 * kPointerSize));
+  __ RecordComment("v8::FunctionCallback's argument.");
+  __ add(function_callback_info_arg, sp, Operand(1 * kPointerSize));
+
+  DCHECK(!AreAliased(api_function_address, function_callback_info_arg));
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
-  MemOperand return_value_operand =
-      ExitFrameCallerStackSlotOperand(FCA::kReturnValueIndex);
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
+
+  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
   static constexpr int kUseStackSpaceOperand = 0;
 
-  AllowExternalCallThatCantCauseGC scope(masm);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kUseStackSpaceOperand, &stack_space_operand,
-                           return_value_operand);
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseStackSpaceOperand,
+                           &stack_space_operand, return_value_operand);
 }
 
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- cp                  : context
+  //  -- r1                  : receiver
+  //  -- r3                  : accessor info
+  //  -- r0                  : holder
+  // -----------------------------------
+
   // Build v8::PropertyCallbackInfo::args_ array on the stack and push property
   // name below the exit frame to make GC aware of them.
+  using PCI = PropertyCallbackInfo<v8::Value>;
   using PCA = PropertyCallbackArguments;
   static_assert(PCA::kShouldThrowOnErrorIndex == 0);
   static_assert(PCA::kHolderIndex == 1);
   static_assert(PCA::kIsolateIndex == 2);
-  static_assert(PCA::kReturnValueDefaultValueIndex == 3);
+  static_assert(PCA::kUnusedIndex == 3);
   static_assert(PCA::kReturnValueIndex == 4);
   static_assert(PCA::kDataIndex == 5);
   static_assert(PCA::kThisIndex == 6);
   static_assert(PCA::kArgsLength == 7);
 
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  // Target state:
+  //   sp[0 * kSystemPointerSize]: name
+  //   sp[1 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   sp[2 * kSystemPointerSize]: kHolderIndex
+  //   sp[3 * kSystemPointerSize]: kIsolateIndex
+  //   sp[4 * kSystemPointerSize]: kUnusedIndex
+  //   sp[5 * kSystemPointerSize]: kReturnValueIndex
+  //   sp[6 * kSystemPointerSize]: kDataIndex
+  //   sp[7 * kSystemPointerSize]: kThisIndex / receiver
+
+  Register name_arg = arg_reg_1;
+  Register property_callback_info_arg = arg_reg_2;
+
+  Register api_function_address = r2;
   Register receiver = ApiGetterDescriptor::ReceiverRegister();
   Register holder = ApiGetterDescriptor::HolderRegister();
   Register callback = ApiGetterDescriptor::CallbackRegister();
   Register scratch = r4;
-  DCHECK(!AreAliased(receiver, holder, callback, scratch));
-
-  Register api_function_address = r2;
+  Register smi_zero = r5;
+  DCHECK(!AreAliased(receiver, holder, callback, scratch, smi_zero));
 
-  __ push(receiver);
-  // Push data from AccessorInfo.
   __ ldr(scratch, FieldMemOperand(callback, AccessorInfo::kDataOffset));
-  __ push(scratch);
+  __ Push(receiver, scratch);  // kThisIndex, kDataIndex
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ Push(scratch, scratch);
+  __ Move(smi_zero, Smi::zero());
+  __ Push(scratch, smi_zero);  // kReturnValueIndex, kUnusedIndex
   __ Move(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ Push(scratch, holder);
-  __ Push(Smi::zero());  // should_throw_on_error -> false
+  __ Push(scratch, holder);  // kIsolateIndex, kHolderIndex
+
   __ ldr(scratch, FieldMemOperand(callback, AccessorInfo::kNameOffset));
-  __ push(scratch);
-  // v8::PropertyCallbackInfo::args_ array and name handle.
-  constexpr int kNameHandleStackSize = 1;
-  constexpr int kStackUnwindSpace = PCA::kArgsLength + kNameHandleStackSize;
+  __ Push(smi_zero, scratch);  // should_throw_on_error -> false, name
 
-  // Load address of v8::PropertyAccessorInfo::args_ array and name handle.
-  __ mov(r0, sp);                             // r0 = Handle<Name>
-  __ add(r1, r0, Operand(1 * kPointerSize));  // r1 = v8::PCI::args_
+  __ RecordComment(
+      "Load address of v8::PropertyAccessorInfo::args_ array and name handle.");
+  // name_arg = Handle<Name>(&name), name value was pushed to GC-ed stack space.
+  __ mov(name_arg, sp);
+  // property_callback_info_arg = v8::PCI::args_ (= &ShouldThrow)
+  __ add(property_callback_info_arg, name_arg, Operand(1 * kPointerSize));
+
+  constexpr int kNameOnStackSize = 1;
+  constexpr int kStackUnwindSpace = PCA::kArgsLength + kNameOnStackSize;
 
   constexpr int kApiStackSpace = 1;
+  static_assert(kApiStackSpace * kSystemPointerSize == sizeof(PCI));
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
 
-  // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // it's args_ field.
-  __ str(r1, MemOperand(sp, 1 * kPointerSize));
-  __ add(r1, sp, Operand(1 * kPointerSize));  // r1 = v8::PropertyCallbackInfo&
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
+  // Initialize v8::PropertyCallbackInfo::args_ field.
+  __ str(property_callback_info_arg, MemOperand(sp, 1 * kPointerSize));
+  // property_callback_info_arg = v8::PropertyCallbackInfo&
+  __ add(property_callback_info_arg, sp, Operand(1 * kPointerSize));
 
-  ExternalReference thunk_ref =
-      ExternalReference::invoke_accessor_getter_callback();
+  __ RecordComment("Load api_function_address");
   __ ldr(api_function_address,
          FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset));
+
+  DCHECK(
+      !AreAliased(api_function_address, property_callback_info_arg, name_arg));
+
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_accessor_getter_callback();
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
+
   MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
-      PCA::kReturnValueIndex + kNameHandleStackSize);
+      PCA::kReturnValueIndex + kNameOnStackSize);
   MemOperand* const kUseStackSpaceConstant = nullptr;
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           return_value_operand);
+
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
@@ -3593,6 +3944,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register code_obj = r4;
   __ ldr(code_obj,
          FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+
+  if (is_osr) {
+    ResetSharedFunctionInfoAge(masm, code_obj, r3);
+  }
+
   __ ldr(code_obj,
          FieldMemOperand(code_obj, SharedFunctionInfo::kFunctionDataOffset));
 
@@ -3625,7 +3981,8 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register feedback_vector = r2;
   __ ldr(feedback_vector,
          FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ ldr(feedback_vector, FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ ldr(feedback_vector,
+         FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -3677,9 +4034,6 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   // Save the accumulator register, since it's clobbered by the below call.
   __ Push(kInterpreterAccumulatorRegister);
   {
-    Register arg_reg_1 = r0;
-    Register arg_reg_2 = r1;
-    Register arg_reg_3 = r2;
     __ mov(arg_reg_1, code_obj);
     __ mov(arg_reg_2, kInterpreterBytecodeOffsetRegister);
     __ mov(arg_reg_3, kInterpreterBytecodeArrayRegister);
@@ -3687,13 +4041,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     __ PrepareCallCFunction(3, 0);
     __ CallCFunction(get_baseline_pc, 3, 0);
   }
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ add(code_obj, code_obj, kReturnRegister0);
   __ Pop(kInterpreterAccumulatorRegister);
 
   if (is_osr) {
-    UseScratchRegisterScope temps(masm);
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister, temps.Acquire());
     Generate_OSREntry(masm, code_obj);
   } else {
     __ Jump(code_obj);
diff --git a/deps/v8/src/builtins/arm64/builtins-arm64.cc b/deps/v8/src/builtins/arm64/builtins-arm64.cc
index 9d48902a319ed4..3d7f7b284cfb8f 100644
--- a/deps/v8/src/builtins/arm64/builtins-arm64.cc
+++ b/deps/v8/src/builtins/arm64/builtins-arm64.cc
@@ -5,6 +5,7 @@
 #if V8_TARGET_ARCH_ARM64
 
 #include "src/api/api-arguments.h"
+#include "src/builtins/builtins-descriptors.h"
 #include "src/codegen/code-factory.h"
 #include "src/codegen/interface-descriptors-inl.h"
 // For interpreter_entry_return_pc_offset. TODO(jkummerow): Drop.
@@ -43,6 +44,10 @@ namespace internal {
 
 #define __ ACCESS_MASM(masm)
 
+namespace {
+constexpr int kReceiverOnStackSize = kSystemPointerSize;
+}  // namespace
+
 void Builtins::Generate_Adaptor(MacroAssembler* masm, Address address) {
   __ CodeEntry();
 
@@ -314,18 +319,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   __ Mov(x0, x12);
   __ InvokeFunctionWithNewTarget(x1, x3, x0, InvokeType::kCall);
 
-  // ----------- S t a t e -------------
-  //  -- sp[0*kSystemPointerSize]: implicit receiver
-  //  -- sp[1*kSystemPointerSize]: padding
-  //  -- sp[2*kSystemPointerSize]: constructor function
-  //  -- sp[3*kSystemPointerSize]: number of arguments
-  //  -- sp[4*kSystemPointerSize]: context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -498,7 +491,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
   // Poke receiver into highest claimed slot.
   __ LoadTaggedField(x5,
                      FieldMemOperand(x1, JSGeneratorObject::kReceiverOffset));
-  __ Poke(x5, __ ReceiverOperand(x10));
+  __ Poke(x5, __ ReceiverOperand());
 
   // ----------- S t a t e -------------
   //  -- x1                       : the JSGeneratorObject to resume
@@ -551,9 +544,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     // undefined because generator functions are non-constructable.
     __ Mov(x3, x1);
     __ Mov(x1, x4);
-    static_assert(kJavaScriptCallCodeStartRegister == x2, "ABI mismatch");
-    __ LoadTaggedField(x2, FieldMemOperand(x1, JSFunction::kCodeOffset));
-    __ JumpCodeObject(x2);
+    __ JumpJSFunction(x1);
   }
 
   __ Bind(&prepare_step_in_if_stepping);
@@ -1081,9 +1072,17 @@ static void AdvanceBytecodeOffsetOrReturn(MacroAssembler* masm,
 
 namespace {
 
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array) {
-  __ Strh(wzr,
-          FieldMemOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset));
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi) {
+  __ Strh(wzr, FieldMemOperand(sfi, SharedFunctionInfo::kAgeOffset));
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function,
+                        Register scratch) {
+  const Register shared_function_info(scratch);
+  __ LoadTaggedField(
+      shared_function_info,
+      FieldMemOperand(js_function, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, shared_function_info);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
@@ -1091,8 +1090,7 @@ void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
   DCHECK(!AreAliased(feedback_vector, scratch));
   __ Ldrb(scratch,
           FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
-  __ And(scratch, scratch,
-         Operand(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ And(scratch, scratch, Operand(~FeedbackVector::OsrUrgencyBits::kMask));
   __ Strb(scratch,
           FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
 }
@@ -1113,8 +1111,9 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   Register feedback_vector = temps.AcquireX();
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
   __ AssertFeedbackVector(feedback_vector, x4);
 
   // Check the tiering state.
@@ -1152,6 +1151,10 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
         BaselineOutOfLinePrologueDescriptor::kCalleeContext);
     Register callee_js_function = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kClosure);
+    {
+      UseScratchRegisterScope temps(masm);
+      ResetJSFunctionAge(masm, callee_js_function, temps.AcquireX());
+    }
     __ Push(callee_context, callee_js_function);
     DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
     DCHECK_EQ(callee_js_function, kJSFunctionRegister);
@@ -1162,7 +1165,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // the frame, so load it into a register.
     Register bytecode_array = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray);
-    ResetBytecodeAge(masm, bytecode_array);
     __ Push(argc, bytecode_array);
 
     // Baseline code frames store the feedback vector where interpreter would
@@ -1273,6 +1275,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // kInterpreterBytecodeArrayRegister.
   __ LoadTaggedField(
       x4, FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, x4);
   __ LoadTaggedField(
       kInterpreterBytecodeArrayRegister,
       FieldMemOperand(x4, SharedFunctionInfo::kFunctionDataOffset));
@@ -1293,8 +1296,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   Register feedback_vector = x2;
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label push_stack_frame;
   // Check if feedback vector is valid. If valid, check for optimized code
@@ -1342,8 +1346,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   __ mov(fp, sp);
   __ Push(cp, closure);
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
-
   // Load the initial bytecode offset.
   __ Mov(kInterpreterBytecodeOffsetRegister,
          Operand(BytecodeArray::kHeaderSize - kHeapObjectTag));
@@ -1492,8 +1494,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ LoadTaggedField(
         feedback_vector,
         FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-    __ LoadTaggedField(feedback_vector,
-                       FieldMemOperand(feedback_vector, Cell::kValueOffset));
+    __ LoadTaggedField(
+        feedback_vector,
+        FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1532,7 +1535,8 @@ static void GenerateInterpreterPushArgs(MacroAssembler* masm, Register num_args,
                                         Register first_arg_index,
                                         Register spread_arg_out,
                                         ConvertReceiverMode receiver_mode,
-                                        InterpreterPushArgsMode mode) {
+                                        InterpreterPushArgsMode mode,
+                                        bool stack_check_already_done = false) {
   ASM_CODE_COMMENT(masm);
   Register last_arg_addr = x10;
   Register stack_addr = x11;
@@ -1554,17 +1558,18 @@ static void GenerateInterpreterPushArgs(MacroAssembler* masm, Register num_args,
   __ Add(slots_to_claim, num_args, 1);
   __ Bic(slots_to_claim, slots_to_claim, 1);
 
-  // Add a stack check before pushing arguments.
-  Label stack_overflow, done;
-  __ StackOverflowCheck(slots_to_claim, &stack_overflow);
-  __ B(&done);
-  __ Bind(&stack_overflow);
-  __ TailCallRuntime(Runtime::kThrowStackOverflow);
-  __ Unreachable();
-  __ Bind(&done);
+  if (!stack_check_already_done) {
+    // Add a stack check before pushing arguments.
+    Label stack_overflow, done;
+    __ StackOverflowCheck(slots_to_claim, &stack_overflow);
+    __ B(&done);
+    __ Bind(&stack_overflow);
+    __ TailCallRuntime(Runtime::kThrowStackOverflow);
+    __ Unreachable();
+    __ Bind(&done);
+  }
 
   __ Claim(slots_to_claim);
-
   {
     // Store padding, which may be overwritten.
     UseScratchRegisterScope temps(masm);
@@ -1675,6 +1680,181 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   }
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- x0 : the number of arguments
+  // -- x1 : constructor to call (checked to be a JSFunction)
+  // -- x3 : new target
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+  Register implicit_receiver = x4;
+
+  // Save live registers.
+  __ SmiTag(x0);
+  __ Push(x0, x1, x3, padreg);
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  // Save result.
+  __ Mov(implicit_receiver, x0);
+  // Restore live registers.
+  __ Pop(padreg, x3, x1, x0);
+  __ SmiUntag(x0);
+
+  // Patch implicit receiver (in arguments)
+  __ Poke(implicit_receiver, 0 * kSystemPointerSize);
+  // Patch second implicit (in construct frame)
+  __ Str(implicit_receiver,
+         MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+
+  // Restore context.
+  __ Ldr(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- x0 : argument count
+  // -- x1 : constructor to call (checked to be a JSFunction)
+  // -- x3 : new target
+  // -- x4 : address of the first argument
+  // -- cp : context pointer
+  // -----------------------------------
+  __ AssertFunction(x1);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  __ LoadMap(x2, x1);
+  __ Ldrb(x2, FieldMemOperand(x2, Map::kBitFieldOffset));
+  __ TestAndBranchIfAllClear(x2, Map::Bits1::IsConstructorBit::kMask,
+                             &non_constructor);
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(x0, &stack_overflow);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+
+  if (v8_flags.debug_code) {
+    // Check that FrameScope pushed the context on to the stack already.
+    __ Peek(x2, 0);
+    __ Cmp(x2, cp);
+    __ Check(eq, AbortReason::kUnexpectedValue);
+  }
+
+  // Implicit receiver stored in the construct frame.
+  __ LoadRoot(x2, RootIndex::kTheHoleValue);
+  __ Push(x2, padreg);
+
+  // Push arguments + implicit receiver.
+  GenerateInterpreterPushArgs(masm, x0, x4, Register::no_reg(),
+                              ConvertReceiverMode::kNullOrUndefined,
+                              InterpreterPushArgsMode::kOther, true);
+  __ Poke(x2, 0 * kSystemPointerSize);
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  __ LoadTaggedField(
+      x2, FieldMemOperand(x1, JSFunction::kSharedFunctionInfoOffset));
+  __ Ldr(w2, FieldMemOperand(x2, SharedFunctionInfo::kFlagsOffset));
+  __ TestAndBranchIfAnySet(w2, SharedFunctionInfo::ConstructAsBuiltinBit::kMask,
+                           &builtin_call);
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(w2);
+  __ JumpIfIsInRange(
+      w2, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor),
+      &not_create_implicit_receiver);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the function.
+  __ InvokeFunctionWithNewTarget(x1, x3, x0, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- x0     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label use_receiver, do_throw, leave_and_return, check_receiver;
+
+  // If the result is undefined, we jump out to using the implicit receiver.
+  __ CompareRoot(x0, RootIndex::kUndefinedValue);
+  __ B(ne, &check_receiver);
+
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ Bind(&use_receiver);
+  __ Ldr(x0,
+         MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+  __ CompareRoot(x0, RootIndex::kTheHoleValue);
+  __ B(eq, &do_throw);
+
+  __ Bind(&leave_and_return);
+  // Leave construct frame.
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  // Otherwise we do a smi check and fall through to check if the return value
+  // is a valid receiver.
+  __ bind(&check_receiver);
+
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(x0, &use_receiver);
+
+  // Check if the type of the result is not an object in the ECMA sense.
+  __ JumpIfJSAnyIsNotPrimitive(x0, x4, &leave_and_return);
+  __ B(&use_receiver);
+
+  __ bind(&builtin_call);
+  // TODO(victorgomes): Check the possibility to turn this into a tailcall.
+  __ InvokeFunctionWithNewTarget(x1, x3, x0, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  __ Bind(&do_throw);
+  // Restore the context from the frame.
+  __ Ldr(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  __ Unreachable();
+
+  __ Bind(&stack_overflow);
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  __ Unreachable();
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Initialize the dispatch table register.
   __ Mov(
@@ -1709,11 +1889,6 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
     __ bind(&okay);
   }
 
-  // Set up LR to point to code below, so we return there after we're done
-  // executing the function.
-  Label return_from_bytecode_dispatch;
-  __ Adr(lr, &return_from_bytecode_dispatch);
-
   // Dispatch to the target bytecode.
   __ Ldrb(x23, MemOperand(kInterpreterBytecodeArrayRegister,
                           kInterpreterBytecodeOffsetRegister));
@@ -1725,15 +1900,13 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
     UseScratchRegisterScope temps(masm);
     temps.Exclude(x17);
     __ Mov(x17, kJavaScriptCallCodeStartRegister);
-    __ Jump(x17);
+    __ Call(x17);
   }
 
-  __ Bind(&return_from_bytecode_dispatch);
-
   // We return here after having executed the function in the interpreter.
   // Now jump to the correct point in the interpreter entry trampoline.
   Label builtin_trampoline, trampoline_loaded;
-  Smi interpreter_entry_return_pc_offset(
+  Tagged<Smi> interpreter_entry_return_pc_offset(
       masm->isolate()->heap()->interpreter_entry_return_pc_offset());
   DCHECK_NE(interpreter_entry_return_pc_offset, Smi::zero());
 
@@ -1752,7 +1925,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
 
   __ LoadTaggedField(
       x1, FieldMemOperand(x1, InterpreterData::kInterpreterTrampolineOffset));
-  __ LoadCodeEntry(x1, x1);
+  __ LoadCodeInstructionStart(x1, x1);
   __ B(&trampoline_loaded);
 
   __ Bind(&builtin_trampoline);
@@ -1893,7 +2066,7 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
   __ Mov(sp, fp);
   __ Pop<MacroAssembler::kAuthLR>(fp, lr);
 
-  __ LoadEntryFromBuiltinIndex(builtin);
+  __ LoadEntryFromBuiltinIndex(builtin, builtin);
   __ Jump(builtin);
 }
 }  // namespace
@@ -2014,7 +2187,7 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
       x1, FieldMemOperand(x1, FixedArray::OffsetOfElementAt(
                                   DeoptimizationData::kOsrPcOffsetIndex)));
 
-  __ LoadCodeEntry(x0, x0);
+  __ LoadCodeInstructionStart(x0, x0);
 
   // Compute the target address = code_entry + osr_offset
   // <entry_addr> = <code_entry> + <osr_offset>
@@ -2040,6 +2213,36 @@ void Builtins::Generate_BaselineOnStackReplacement(MacroAssembler* masm) {
                      D::MaybeTargetCodeRegister());
 }
 
+#ifdef V8_ENABLE_MAGLEV
+
+// static
+void Builtins::Generate_MaglevFunctionEntryStackCheck(MacroAssembler* masm,
+                                                      bool save_new_target) {
+  // Input (x0): Stack size (Smi).
+  // This builtin can be invoked just after Maglev's prologue.
+  // All registers are available, except (possibly) new.target.
+  ASM_CODE_COMMENT(masm);
+  {
+    FrameScope scope(masm, StackFrame::INTERNAL);
+    __ AssertSmi(x0);
+    if (save_new_target) {
+      if (PointerCompressionIsEnabled()) {
+        __ AssertSmiOrHeapObjectInCompressionCage(
+            kJavaScriptCallNewTargetRegister);
+      }
+      __ Push(kJavaScriptCallNewTargetRegister, padreg);
+    }
+    __ PushArgument(x0);
+    __ CallRuntime(Runtime::kStackGuardWithGap, 1);
+    if (save_new_target) {
+      __ Pop(padreg, kJavaScriptCallNewTargetRegister);
+    }
+  }
+  __ Ret();
+}
+
+#endif  // V8_ENABLE_MAGLEV
+
 // static
 void Builtins::Generate_FunctionPrototypeApply(MacroAssembler* masm) {
   // ----------- S t a t e -------------
@@ -2117,7 +2320,7 @@ void Builtins::Generate_FunctionPrototypeCall(MacroAssembler* masm) {
   ASM_LOCATION("Builtins::Generate_FunctionPrototypeCall");
 
   // 1. Get the callable to call (passed as receiver) from the stack.
-  __ Peek(function, __ ReceiverOperand(argc));
+  __ Peek(function, __ ReceiverOperand());
 
   // 2. Handle case with no arguments.
   {
@@ -2303,7 +2506,7 @@ namespace {
 // one slot up or one slot down, as needed.
 void Generate_PrepareForCopyingVarargs(MacroAssembler* masm, Register argc,
                                        Register len) {
-  Label exit, even;
+  Label exit, even, init;
   Register slots_to_copy = x10;
   Register slots_to_claim = x12;
 
@@ -2325,6 +2528,7 @@ void Generate_PrepareForCopyingVarargs(MacroAssembler* masm, Register argc,
   __ Bind(&even);
   __ Cbz(slots_to_claim, &exit);
   __ Claim(slots_to_claim);
+  __ Cbz(slots_to_copy, &init);
 
   // Move the arguments already in the stack including the receiver.
   {
@@ -2333,6 +2537,31 @@ void Generate_PrepareForCopyingVarargs(MacroAssembler* masm, Register argc,
     __ SlotAddress(src, slots_to_claim);
     __ SlotAddress(dst, 0);
     __ CopyDoubleWords(dst, src, slots_to_copy);
+    __ jmp(&exit);
+  }
+  // Initialize the alignment slot with a meaningful value. This is only
+  // necessary if slots_to_copy is 0, because otherwise the alignment slot
+  // already contains a valid value. In case slots_to_copy is even, then the
+  // alignment slot contains the last parameter passed over the stack. In case
+  // slots_to_copy is odd, then the alignment slot is that alignment slot when
+  // CallVarArgs (or similar) was called, and already got initialized for that
+  // call.
+  {
+    __ Bind(&init);
+    // Unconditionally initialize the last parameter slot. If `len` is odd, then
+    // it is an alignment slot that we have to initialize to avoid issues in the
+    // GC. If `len` is even, then the write is unnecessary, but faster than a
+    // check + jump.
+    __ Str(xzr, MemOperand(sp, len, LSL, kSystemPointerSizeLog2));
+  }
+  // Fill a possible alignment slot with a meaningful value.
+  {
+    Register total_num_args = x10;
+    __ Add(total_num_args, argc, len);
+    // If the sum is even, then there are no alignment slots that need
+    // initialization.
+    __ Tbz(total_num_args, 0, &exit);
+    __ Str(xzr, MemOperand(sp, total_num_args, LSL, kSystemPointerSizeLog2));
   }
   __ Bind(&exit);
 }
@@ -2340,7 +2569,7 @@ void Generate_PrepareForCopyingVarargs(MacroAssembler* masm, Register argc,
 }  // namespace
 
 // static
-// TODO(v8:11615): Observe InstructionStream::kMaxArguments in
+// TODO(v8:11615): Observe Code::kMaxArguments in
 // CallOrConstructVarargs
 void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
                                                Handle<Code> code) {
@@ -2526,7 +2755,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ LoadGlobalProxy(x3);
     } else {
       Label convert_to_object, convert_receiver;
-      __ Peek(x3, __ ReceiverOperand(x0));
+      __ Peek(x3, __ ReceiverOperand());
       __ JumpIfSmi(x3, &convert_to_object);
       __ JumpIfJSAnyIsNotPrimitive(x3, x4, &done_convert);
       if (mode != ConvertReceiverMode::kNotNullOrUndefined) {
@@ -2559,7 +2788,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
           x2, FieldMemOperand(x1, JSFunction::kSharedFunctionInfoOffset));
       __ Bind(&convert_receiver);
     }
-    __ Poke(x3, __ ReceiverOperand(x0));
+    __ Poke(x3, __ ReceiverOperand());
   }
   __ Bind(&done_convert);
 
@@ -2715,7 +2944,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
   // Patch the receiver to [[BoundThis]].
   __ LoadTaggedField(x10,
                      FieldMemOperand(x1, JSBoundFunction::kBoundThisOffset));
-  __ Poke(x10, __ ReceiverOperand(x0));
+  __ Poke(x10, __ ReceiverOperand());
 
   // Push the [[BoundArguments]] onto the stack.
   Generate_PushBoundArguments(masm);
@@ -2733,11 +2962,10 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   //  -- x0 : the number of arguments
   //  -- x1 : the target to call (can be any Object).
   // -----------------------------------
-  Register argc = x0;
   Register target = x1;
   Register map = x4;
   Register instance_type = x5;
-  DCHECK(!AreAliased(argc, target, map, instance_type));
+  DCHECK(!AreAliased(x0, target, map, instance_type));
 
   Label non_callable, class_constructor;
   __ JumpIfSmi(target, &non_callable);
@@ -2778,7 +3006,7 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   // 2. Call to something else, which might have a [[Call]] internal method (if
   // not we raise an exception).
   // Overwrite the original receiver with the (original) target.
-  __ Poke(target, __ ReceiverOperand(argc));
+  __ Poke(target, __ ReceiverOperand());
 
   // Let the "call_as_function_delegate" take care of the rest.
   __ LoadNativeContextSlot(target, Context::CALL_AS_FUNCTION_DELEGATE_INDEX);
@@ -2873,11 +3101,10 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   //  -- x3 : the new target (either the same as the constructor or
   //          the JSFunction on which new was invoked initially)
   // -----------------------------------
-  Register argc = x0;
   Register target = x1;
   Register map = x4;
   Register instance_type = x5;
-  DCHECK(!AreAliased(argc, target, map, instance_type));
+  DCHECK(!AreAliased(x0, target, map, instance_type));
 
   // Check if target is a Smi.
   Label non_constructor, non_proxy;
@@ -2887,7 +3114,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ LoadTaggedField(map, FieldMemOperand(target, HeapObject::kMapOffset));
   {
     Register flags = x2;
-    DCHECK(!AreAliased(argc, target, map, instance_type, flags));
+    DCHECK(!AreAliased(x0, target, map, instance_type, flags));
     __ Ldrb(flags, FieldMemOperand(map, Map::kBitFieldOffset));
     __ TestAndBranchIfAllClear(flags, Map::Bits1::IsConstructorBit::kMask,
                                &non_constructor);
@@ -2915,7 +3142,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ bind(&non_proxy);
   {
     // Overwrite the original receiver with the (original) target.
-    __ Poke(target, __ ReceiverOperand(argc));
+    __ Poke(target, __ ReceiverOperand());
 
     // Let the "call_as_constructor_delegate" take care of the rest.
     __ LoadNativeContextSlot(target,
@@ -3104,56 +3331,6 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
 }
 
 namespace {
-// Helper functions for the GenericJSToWasmWrapper.
-void PrepareForBuiltinCall(MacroAssembler* masm, MemOperand GCScanSlotPlace,
-                           const int GCScanSlotCount, Register current_param,
-                           Register param_limit,
-                           Register current_int_param_slot,
-                           Register current_float_param_slot,
-                           Register valuetypes_array_ptr,
-                           Register wasm_instance, Register function_data,
-                           Register original_fp) {
-  UseScratchRegisterScope temps(masm);
-  Register GCScanCount = temps.AcquireX();
-  // Pushes and puts the values in order onto the stack before builtin calls for
-  // the GenericJSToWasmWrapper.
-  __ Mov(GCScanCount, GCScanSlotCount);
-  __ Str(GCScanCount, GCScanSlotPlace);
-  __ Stp(current_param, param_limit,
-        MemOperand(sp, -2 * kSystemPointerSize, PreIndex));
-  __ Stp(current_int_param_slot, current_float_param_slot,
-        MemOperand(sp, -2 * kSystemPointerSize, PreIndex));
-  __ Stp(valuetypes_array_ptr, original_fp,
-        MemOperand(sp, -2 * kSystemPointerSize, PreIndex));
-  __ Stp(wasm_instance, function_data,
-        MemOperand(sp, -2 * kSystemPointerSize, PreIndex));
-  // We had to prepare the parameters for the Call: we have to put the context
-  // into kContextRegister.
-  __ LoadTaggedField(
-      kContextRegister,  // cp(x27)
-      MemOperand(wasm_instance, wasm::ObjectAccess::ToTagged(
-                                    WasmInstanceObject::kNativeContextOffset)));
-}
-
-void RestoreAfterBuiltinCall(MacroAssembler* masm, Register function_data,
-                             Register wasm_instance,
-                             Register valuetypes_array_ptr,
-                             Register current_float_param_slot,
-                             Register current_int_param_slot,
-                             Register param_limit, Register current_param,
-                             Register original_fp) {
-  // Pop and load values from the stack in order into the registers after
-  // builtin calls for the GenericJSToWasmWrapper.
-  __ Ldp(wasm_instance, function_data,
-        MemOperand(sp, 2 * kSystemPointerSize, PostIndex));
-  __ Ldp(valuetypes_array_ptr, original_fp,
-        MemOperand(sp, 2 * kSystemPointerSize, PostIndex));
-  __ Ldp(current_int_param_slot, current_float_param_slot,
-        MemOperand(sp, 2 * kSystemPointerSize, PostIndex));
-  __ Ldp(current_param, param_limit,
-        MemOperand(sp, 2 * kSystemPointerSize, PostIndex));
-}
-
 // Check that the stack was in the old state (if generated code assertions are
 // enabled), and switch to the new state.
 void SwitchStackState(MacroAssembler* masm, Register jmpbuf,
@@ -3172,6 +3349,25 @@ void SwitchStackState(MacroAssembler* masm, Register jmpbuf,
   __ Str(tmp.W(), MemOperand(jmpbuf, wasm::kJmpBufStateOffset));
 }
 
+// Switch the stack pointer. Also switch the simulator's stack limit when
+// running on the simulator. This needs to be done as close as possible to
+// changing the stack pointer, as a mismatch between the stack pointer and the
+// simulator's stack limit can cause stack access check failures.
+void SwitchStackPointerAndSimulatorStackLimit(MacroAssembler* masm,
+                                              Register jmpbuf, Register tmp) {
+  if (masm->options().enable_simulator_code) {
+    UseScratchRegisterScope temps(masm);
+    temps.Exclude(x16);
+    __ Ldr(tmp, MemOperand(jmpbuf, wasm::kJmpBufSpOffset));
+    __ Ldr(x16, MemOperand(jmpbuf, wasm::kJmpBufStackLimitOffset));
+    __ Mov(sp, tmp);
+    __ hlt(kImmExceptionIsSwitchStackLimit);
+  } else {
+    __ Ldr(tmp, MemOperand(jmpbuf, wasm::kJmpBufSpOffset));
+    __ Mov(sp, tmp);
+  }
+}
+
 void FillJumpBuffer(MacroAssembler* masm, Register jmpbuf, Label* pc,
                     Register tmp) {
   __ Mov(tmp, sp);
@@ -3185,8 +3381,7 @@ void FillJumpBuffer(MacroAssembler* masm, Register jmpbuf, Label* pc,
 
 void LoadJumpBuffer(MacroAssembler* masm, Register jmpbuf, bool load_pc,
                     Register tmp) {
-  __ Ldr(tmp, MemOperand(jmpbuf, wasm::kJmpBufSpOffset));
-  __ Mov(sp, tmp);
+  SwitchStackPointerAndSimulatorStackLimit(masm, jmpbuf, tmp);
   __ Ldr(fp, MemOperand(jmpbuf, wasm::kJmpBufFpOffset));
   SwitchStackState(masm, jmpbuf, tmp, wasm::JumpBuffer::Inactive,
                    wasm::JumpBuffer::Active);
@@ -3194,7 +3389,8 @@ void LoadJumpBuffer(MacroAssembler* masm, Register jmpbuf, bool load_pc,
     __ Ldr(tmp, MemOperand(jmpbuf, wasm::kJmpBufPcOffset));
     __ Br(tmp);
   }
-  // The stack limit is set separately under the ExecutionAccess lock.
+  // The stack limit in StackGuard is set separately under the ExecutionAccess
+  // lock.
 }
 
 void SaveState(MacroAssembler* masm, Register active_continuation,
@@ -3210,24 +3406,6 @@ void SaveState(MacroAssembler* masm, Register active_continuation,
   FillJumpBuffer(masm, jmpbuf, suspend, scratch);
 }
 
-// Returns the new suspender in kReturnRegister0.
-void AllocateSuspender(MacroAssembler* masm, Register function_data,
-                       Register wasm_instance, Register tmp) {
-  __ Mov(tmp, 2);
-  __ Str(tmp,
-         MemOperand(fp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset));
-  __ Stp(wasm_instance, function_data,
-        MemOperand(sp, -2 * kSystemPointerSize, PreIndex));
-  __ LoadTaggedField(
-      kContextRegister,
-      MemOperand(wasm_instance, wasm::ObjectAccess::ToTagged(
-                                    WasmInstanceObject::kNativeContextOffset)));
-  __ CallRuntime(Runtime::kWasmAllocateSuspender);
-  __ Ldp(wasm_instance, function_data,
-        MemOperand(sp, 2 * kSystemPointerSize, PostIndex));
-  static_assert(kReturnRegister0 == x0);
-}
-
 void LoadTargetJumpBuffer(MacroAssembler* masm, Register target_continuation,
                           Register tmp) {
   Register target_jmpbuf = target_continuation;
@@ -3237,14 +3415,27 @@ void LoadTargetJumpBuffer(MacroAssembler* masm, Register target_continuation,
                       WasmContinuationObject::kJmpbufOffset),
       kWasmContinuationJmpbufTag);
   __ Str(xzr,
-         MemOperand(fp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset));
+         MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset));
   // Switch stack!
   LoadJumpBuffer(masm, target_jmpbuf, false, tmp);
 }
 
-void ReloadParentContinuation(MacroAssembler* masm, Register wasm_instance,
-                              Register return_reg, Register tmp1,
-                              Register tmp2) {
+void SyncStackLimit(MacroAssembler* masm, const CPURegister& keep1 = NoReg,
+                    const CPURegister& keep2 = padreg) {
+  using ER = ExternalReference;
+#if V8_ENABLE_WEBASSEMBLY
+  __ Push(keep1, keep2);
+  {
+    FrameScope scope(masm, StackFrame::MANUAL);
+    __ Mov(arg_reg_1, ER::isolate_address(masm->isolate()));
+    __ CallCFunction(ER::wasm_sync_stack_limit(), 1);
+  }
+  __ Pop(keep2, keep1);
+#endif  // V8_ENABLE_WEBASSEMBLY
+}
+
+void ReloadParentContinuation(MacroAssembler* masm, Register return_reg,
+                              Register tmp1, Register tmp2) {
   Register active_continuation = tmp1;
   __ LoadRoot(active_continuation, RootIndex::kActiveContinuation);
 
@@ -3281,15 +3472,7 @@ void ReloadParentContinuation(MacroAssembler* masm, Register wasm_instance,
   // Switch stack!
   LoadJumpBuffer(masm, jmpbuf, false, tmp1);
 
-  __ Mov(tmp1, 1);
-  __ Str(tmp1,
-         MemOperand(fp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset));
-  __ Stp(wasm_instance, return_reg,
-      MemOperand(sp, -2 * kSystemPointerSize, PreIndex));  // Spill.
-  __ Move(kContextRegister, Smi::zero());
-  __ CallRuntime(Runtime::kWasmSyncStackLimit);
-  __ Ldp(wasm_instance, return_reg,
-      MemOperand(sp, 2 * kSystemPointerSize, PostIndex));
+  SyncStackLimit(masm, return_reg);
 }
 
 void RestoreParentSuspender(MacroAssembler* masm, Register tmp1,
@@ -3325,40 +3508,9 @@ void RestoreParentSuspender(MacroAssembler* masm, Register tmp1,
   __ Str(suspender, MemOperand(kRootRegister, active_suspender_offset));
 }
 
-void LoadFunctionDataAndWasmInstance(MacroAssembler* masm,
-                                     Register function_data,
-                                     Register wasm_instance) {
-  Register closure = function_data;
-  __ LoadTaggedField(
-      function_data,
-      MemOperand(
-          closure,
-          wasm::ObjectAccess::SharedFunctionInfoOffsetInTaggedJSFunction()));
-  __ LoadTaggedField(
-      function_data,
-      FieldMemOperand(function_data, SharedFunctionInfo::kFunctionDataOffset));
-
-  __ LoadTaggedField(
-      wasm_instance,
-      FieldMemOperand(function_data,
-                      WasmExportedFunctionData::kInstanceOffset));
-}
-
-void LoadValueTypesArray(MacroAssembler* masm, Register function_data,
-                         Register valuetypes_array_ptr, Register return_count,
-                         Register param_count) {
-  Register signature = valuetypes_array_ptr;
-  __ LoadExternalPointerField(
-      signature,
-      FieldMemOperand(function_data, WasmExportedFunctionData::kSigOffset),
-      kWasmExportedFunctionDataSignatureTag);
-  __ Ldr(return_count,
-          MemOperand(signature, wasm::FunctionSig::kReturnCountOffset));
-  __ Ldr(param_count,
-          MemOperand(signature, wasm::FunctionSig::kParameterCountOffset));
-  valuetypes_array_ptr = signature;
-  __ Ldr(valuetypes_array_ptr,
-          MemOperand(signature, wasm::FunctionSig::kRepsOffset));
+void ResetStackSwitchFrameStackSlots(MacroAssembler* masm) {
+  __ Str(xzr, MemOperand(fp, StackSwitchFrameConstants::kResultArrayOffset));
+  __ Str(xzr, MemOperand(fp, StackSwitchFrameConstants::kInstanceOffset));
 }
 
 class RegisterAllocator {
@@ -3481,1049 +3633,87 @@ class RegisterAllocator {
   Register Name = no_reg; \
   regs.Pinned(Reg, &Name);
 
+#define ASSIGN_PINNED(Name, Reg) regs.Pinned(Reg, &Name);
+
 #define DEFINE_SCOPED(Name) \
   DEFINE_REG(Name) \
   RegisterAllocator::Scoped scope_##Name(&regs, &Name);
 
-#define FREE_REG(Name) \
-  regs.Free(&Name);
+#define FREE_REG(Name) regs.Free(&Name);
+}  // namespace
+
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) {
+  // Push registers in reverse order so that they are on the stack like
+  // in an array, with the first item being at the lowest address.
+  __ Push(wasm::kFpParamRegisters[7], wasm::kFpParamRegisters[6],
+          wasm::kFpParamRegisters[5], wasm::kFpParamRegisters[4]);
+  __ Push(wasm::kFpParamRegisters[3], wasm::kFpParamRegisters[2],
+          wasm::kFpParamRegisters[1], wasm::kFpParamRegisters[0]);
+
+  __ Push(wasm::kGpParamRegisters[6], wasm::kGpParamRegisters[5],
+          wasm::kGpParamRegisters[4], wasm::kGpParamRegisters[3]);
+  __ Push(wasm::kGpParamRegisters[2], wasm::kGpParamRegisters[1],
+          // Spill two more slots, one to allocate space for the signature,
+          // which will get spilled in Torque, and one for stack alignment.
+          xzr, xzr);
+  __ TailCallBuiltin(Builtin::kWasmToJsWrapperCSA);
+}
 
-void GenericJSToWasmWrapperHelper(MacroAssembler* masm, bool stack_switch) {
+void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   auto regs = RegisterAllocator::WithAllocatableGeneralRegisters();
   // Set up the stackframe.
-  __ EnterFrame(stack_switch ? StackFrame::STACK_SWITCH
-                             : StackFrame::JS_TO_WASM);
+  __ EnterFrame(StackFrame::STACK_SWITCH);
+
+  DEFINE_PINNED(suspender, x0);
+  DEFINE_PINNED(context, kContextRegister);
+
+  __ Sub(sp, sp,
+         Immediate(StackSwitchFrameConstants::kNumSpillSlots *
+                   kSystemPointerSize));
+  // Set a sentinel value for the spill slots visited by the GC.
+  ResetStackSwitchFrameStackSlots(masm);
 
   // -------------------------------------------
-  // Compute offsets and prepare for GC.
+  // Save current state in active jump buffer.
   // -------------------------------------------
-  constexpr int kGCScanSlotCountOffset =
-      BuiltinWasmWrapperConstants::kGCScanSlotCountOffset;
-  // The number of parameters passed to this function.
-  constexpr int kInParamCountOffset =
-      BuiltinWasmWrapperConstants::kInParamCountOffset;
-  // The number of parameters according to the signature.
-  constexpr int kParamCountOffset =
-      BuiltinWasmWrapperConstants::kParamCountOffset;
-  constexpr int kSuspenderOffset =
-      BuiltinWasmWrapperConstants::kSuspenderOffset;
-  constexpr int kReturnCountOffset = kSuspenderOffset - kSystemPointerSize;
-  constexpr int kValueTypesArrayStartOffset =
-      kReturnCountOffset - kSystemPointerSize;
-  // The number of reference parameters.
-  // It is used as a boolean flag to check if one of the parameters is
-  // a reference.
-  // If so, we iterate over the parameters two times, first for all value types
-  // and then for all references. During second iteration we store the actual
-  // reference params count.
-  constexpr int kRefParamsCountOffset =
-      kValueTypesArrayStartOffset - kSystemPointerSize;
-  // We set and use this slot only when moving parameters into the parameter
-  // registers (so no GC scan is needed).
-  constexpr int kFunctionDataOffset =
-      kRefParamsCountOffset - kSystemPointerSize;
-  constexpr int kLastSpillOffset = kFunctionDataOffset;
-  constexpr int kNumSpillSlots =
-      (-TypedFrameConstants::kFixedFrameSizeFromFp - kLastSpillOffset) >>
-      kSystemPointerSizeLog2;
-  __ Sub(sp, sp, Immediate(kNumSpillSlots * kSystemPointerSize));
-  // Put the in_parameter count on the stack, we only  need it at the very end
-  // when we pop the parameters off the stack.
-  __ Sub(kJavaScriptCallArgCountRegister, kJavaScriptCallArgCountRegister, 1);
-  __ Str(kJavaScriptCallArgCountRegister, MemOperand(fp, kInParamCountOffset));
-
-  Label compile_wrapper, compile_wrapper_done;
-  // Load function data and check wrapper budget.
-  DEFINE_PINNED(function_data, kJSFunctionRegister);
-  DEFINE_PINNED(wasm_instance, kWasmInstanceRegister);
-  LoadFunctionDataAndWasmInstance(masm, function_data, wasm_instance);
-
+  Label resume;
+  DEFINE_REG(continuation);
+  __ LoadRoot(continuation, RootIndex::kActiveContinuation);
+  DEFINE_REG(jmpbuf);
   DEFINE_REG(scratch);
-  if (!stack_switch) {
-    // -------------------------------------------
-    // Decrement the budget of the generic wrapper in function data.
-    // -------------------------------------------
-    MemOperand budget_loc = FieldMemOperand(
-        function_data,
-        WasmExportedFunctionData::kWrapperBudgetOffset);
-    __ SmiUntag(scratch, budget_loc);
-    __ Subs(scratch, scratch, 1);
-    __ SmiTag(scratch);
-    __ StoreTaggedField(scratch, budget_loc);
+  __ LoadExternalPointerField(
+      jmpbuf,
+      FieldMemOperand(continuation, WasmContinuationObject::kJmpbufOffset),
+      kWasmContinuationJmpbufTag);
+  FillJumpBuffer(masm, jmpbuf, &resume, scratch);
+  SwitchStackState(masm, jmpbuf, scratch, wasm::JumpBuffer::Active,
+                   wasm::JumpBuffer::Inactive);
+  __ Move(scratch, Smi::FromInt(WasmSuspenderObject::kSuspended));
+  __ StoreTaggedField(
+      scratch,
+      FieldMemOperand(suspender, WasmSuspenderObject::kStateOffset));
+  regs.ResetExcept(suspender, continuation);
 
+  DEFINE_REG(suspender_continuation);
+  __ LoadTaggedField(
+      suspender_continuation,
+      FieldMemOperand(suspender, WasmSuspenderObject::kContinuationOffset));
+  if (v8_flags.debug_code) {
     // -------------------------------------------
-    // Check if the budget of the generic wrapper reached 0 (zero).
+    // Check that the suspender's continuation is the active continuation.
     // -------------------------------------------
-    // Instead of a specific comparison, we can directly use the flags set
-    // from the previous addition.
-    __ B(&compile_wrapper, le);
-    __ bind(&compile_wrapper_done);
-  }
-
-  regs.ResetExcept(function_data, wasm_instance);
-
-  Label suspend;
-  Register original_fp = no_reg;
-  if (stack_switch) {
-    DEFINE_PINNED(suspender, kReturnRegister0);
-    // Set the suspender spill slot to a sentinel value, in case a GC happens
-    // before we set the actual value.
-    ASSIGN_REG(scratch);
-    __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-    __ Str(scratch, MemOperand(fp, kSuspenderOffset));
-    DEFINE_REG(active_continuation);
-    __ LoadRoot(active_continuation, RootIndex::kActiveContinuation);
-    SaveState(masm, active_continuation, scratch, &suspend);
-    FREE_REG(active_continuation);
-    AllocateSuspender(masm, function_data, wasm_instance, scratch);
-    // A result of AllocateSuspender is in the return register.
-    __ Str(suspender, MemOperand(fp, kSuspenderOffset));
-    DEFINE_SCOPED(target_continuation);
-    __ LoadTaggedField(
-        target_continuation,
-        FieldMemOperand(suspender, WasmSuspenderObject::kContinuationOffset));
-    FREE_REG(suspender);
-    // Save the old stack's rbp in r9, and use it to access the parameters in
-    // the parent frame.
-    // We also distribute the spill slots across the two stacks as needed by
-    // creating a "shadow frame":
-    //
-    //      old stack:                    new stack:
-    //      +-----------------+
-    //      | <parent frame>  |
-    //      +-----------------+
-    //      | pc              |
-    //      +-----------------+           +-----------------+
-    //      | caller rbp      |           | 0 (jmpbuf rbp)  |
-    // x9-> +-----------------+      fp-> +-----------------+
-    //      | frame marker    |           | frame marker    |
-    //      +-----------------+           +-----------------+
-    //      |kGCScanSlotCount |           |kGCScanSlotCount |
-    //      +-----------------+           +-----------------+
-    //      | kInParamCount   |           |      /          |
-    //      +-----------------+           +-----------------+
-    //      | kParamCount     |           |      /          |
-    //      +-----------------+           +-----------------+
-    //      | kSuspender      |           |      /          |
-    //      +-----------------+           +-----------------+
-    //      |      /          |           | kReturnCount    |
-    //      +-----------------+           +-----------------+
-    //      |      /          |           |kValueTypesArray |
-    //      +-----------------+           +-----------------+
-    //      |      /          |           | kHasRefTypes    |
-    //      +-----------------+           +-----------------+
-    //      |      /          |           | kFunctionData   |
-    //      +-----------------+     sp->  +-----------------+
-    //          seal stack                         |
-    //                                             V
-    //
-    // - When we first enter the prompt, we have access to both frames, so it
-    // does not matter where the values are spilled.
-    // - When we suspend for the first time, we longjmp to the original frame
-    // (left).  So the frame needs to contain the necessary information to
-    // properly deconstruct itself (actual param count and signature param
-    // count).
-    // - When we suspend for the second time, we longjmp to the frame that was
-    // set up by the WasmResume builtin, which has the same layout as the
-    // original frame (left).
-    // - When the closure finally resolves, we use the value types pointer
-    // stored in the shadow frame to get the return type and convert the return
-    // value accordingly.
-    // original_fp stays alive until we load params to param registers.
-    // To prevent aliasing assign higher register here.
-    regs.Pinned(x9, &original_fp);
-    __ Mov(original_fp, fp);
-    LoadTargetJumpBuffer(masm, target_continuation, scratch);
-    // Push the loaded rbp. We know it is null, because there is no frame yet,
-    // so we could also push 0 directly. In any case we need to push it,
-    // because this marks the base of the stack segment for
-    // the stack frame iterator.
-    __ EnterFrame(StackFrame::STACK_SWITCH);
-    __ Sub(sp, sp, Immediate(kNumSpillSlots * kSystemPointerSize));
-    // Set a sentinel value for the suspender spill slot in the new frame.
-    __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-    __ Str(scratch, MemOperand(fp, kSuspenderOffset));
-  } else {
-    original_fp = fp;
+    // TODO(thibaudm): Once we add core stack-switching instructions, this
+    // check will not hold anymore: it's possible that the active continuation
+    // changed (due to an internal switch), so we have to update the suspender.
+    __ cmp(suspender_continuation, continuation);
+    Label ok;
+    __ B(&ok, eq);
+    __ Trap();
+    __ bind(&ok);
   }
-  regs.ResetExcept(original_fp, function_data, wasm_instance);
-
-  Label prepare_for_wasm_call;
-  // Load a signature and store on stack.
-  // Param should be x0 for calling Runtime in the conversion loop.
-  DEFINE_PINNED(param, x0);
-  DEFINE_REG(valuetypes_array_ptr);
-  DEFINE_REG(return_count);
-  // param_count stays alive until we load params to param registers.
-  // To prevent aliasing assign higher register here.
-  DEFINE_PINNED(param_count, x10);
+  FREE_REG(continuation);
   // -------------------------------------------
-  // Load values from the signature.
-  // -------------------------------------------
-  LoadValueTypesArray(masm, function_data, valuetypes_array_ptr,
-                      return_count, param_count);
-
-  // Initialize the {RefParamsCount} slot with 0.
-  __ Str(xzr, MemOperand(fp, kRefParamsCountOffset));
-
-  // -------------------------------------------
-  // Store signature-related values to the stack.
-  // -------------------------------------------
-  // We store values on the stack to restore them after function calls.
-  // We cannot push values onto the stack right before the wasm call.
-  // The Wasm function expects the parameters, that didn't fit into
-  // the registers, on the top of the stack.
-  __ Str(param_count, MemOperand(original_fp, kParamCountOffset));
-  __ Str(return_count, MemOperand(fp, kReturnCountOffset));
-  __ Str(valuetypes_array_ptr, MemOperand(fp, kValueTypesArrayStartOffset));
-
-  // -------------------------------------------
-  // Parameter handling.
-  // -------------------------------------------
-  __ Cmp(param_count, 0);
-
-  // IF we have 0 params: jump through parameter handling.
-  __ B(&prepare_for_wasm_call, eq);
-
-  // -------------------------------------------
-  // Create 2 sections for integer and float params.
-  // -------------------------------------------
-  // We will create 2 sections on the stack for the evaluated parameters:
-  // Integer and Float section, both with parameter count size. We will place
-  // the parameters into these sections depending on their valuetype. This
-  // way we can easily fill the general purpose and floating point parameter
-  // registers and place the remaining parameters onto the stack in proper
-  // order for the Wasm function. These remaining params are the final stack
-  // parameters for the call to WebAssembly. Example of the stack layout
-  // after processing 2 int and 1 float parameters when param_count is 4.
-  //   +-----------------+
-  //   |       fp        |
-  //   |-----------------|-------------------------------
-  //   |                 |   Slots we defined
-  //   |   Saved values  |    when setting up
-  //   |                 |     the stack
-  //   |                 |
-  //   +-Integer section-+--- <--- start_int_section ----
-  //   |  1st int param  |
-  //   |- - - - - - - - -|
-  //   |  2nd int param  |
-  //   |- - - - - - - - -|  <----- current_int_param_slot
-  //   |                 |       (points to the stackslot
-  //   |- - - - - - - - -|  where the next int param should be placed)
-  //   |                 |
-  //   +--Float section--+--- <--- start_float_section --
-  //   | 1st float param |
-  //   |- - - - - - - - -|  <----  current_float_param_slot
-  //   |                 |       (points to the stackslot
-  //   |- - - - - - - - -|  where the next float param should be placed)
-  //   |                 |
-  //   |- - - - - - - - -|
-  //   |                 |
-  //   +---Final stack---+------------------------------
-  //   +-parameters for--+------------------------------
-  //   +-the Wasm call---+------------------------------
-  //   |      . . .      |
-
-  // For Integer section.
-  DEFINE_REG(current_int_param_slot);
-  // Set the current_int_param_slot to point to the start of the section.
-  __ Sub(current_int_param_slot, sp, kSystemPointerSize);
-
-  DEFINE_REG(current_float_param_slot);
-  // Set the current_float_param_slot to point to the start of the section.
-  __ Sub(current_float_param_slot, current_int_param_slot,
-          Operand(param_count, LSL, kSystemPointerSizeLog2));
-  // Claim space for int and float params at once,
-  // to be sure sp is aligned by kSystemPointerSize << 1 = 16.
-  __ Sub(sp, sp, Operand(param_count, LSL, kSystemPointerSizeLog2 + 1));
-
-  // -------------------------------------------
-  // Set up for the param evaluation loop.
-  // -------------------------------------------
-  // We will loop through the params starting with the 1st param.
-  // The order of processing the params is important. We have to evaluate
-  // them in an increasing order.
-  //       +-----------------+---------------
-  //       |     param n     |
-  //       |- - - - - - - - -|
-  //       |    param n-1    |   Caller
-  //       |       ...       | frame slots
-  //       |     param 1     |
-  //       |- - - - - - - - -|
-  //       |    receiver     |
-  //       +-----------------+---------------
-  //       |  return addr    |
-  //   FP->|- - - - - - - - -|
-  //       |       fp        |   Spill slots
-  //       |- - - - - - - - -|
-  //
-  // [current_param] gives us the parameter we are processing.
-  // We iterate through half-open interval <1st param, [fp + param_limit]).
-
-  DEFINE_REG(param_ptr);
-  constexpr int kReceiverOnStackSize = kSystemPointerSize;
-  __ Add(param_ptr, original_fp,
-          kFPOnStackSize + kPCOnStackSize + kReceiverOnStackSize);
-  DEFINE_REG(param_limit);
-  __ Add(param_limit, param_ptr,
-          Operand(param_count, LSL, kSystemPointerSizeLog2));
-  // We have to check the types of the params. The ValueType array contains
-  // first the return then the param types.
-  // Set the ValueType array pointer to point to the first parameter.
-  constexpr int kValueTypeSize = sizeof(wasm::ValueType);
-  static_assert(kValueTypeSize == 4);
-  const int32_t kValueTypeSizeLog2 = log2(kValueTypeSize);
-  __ Add(valuetypes_array_ptr, valuetypes_array_ptr,
-          Operand(return_count, LSL, kValueTypeSizeLog2));
-  DEFINE_REG_W(valuetype);
-
-  Label numeric_params_done;
-  if (stack_switch) {
-    // Prepare for materializing the suspender parameter. We don't materialize
-    // it here but in the next loop that processes references. Here we only
-    // adjust the pointers to keep the state consistent:
-    // - Skip the first valuetype in the signature,
-    // - Adjust the param limit which is off by one because of the extra
-    // param in the signature,
-    // - Set HasRefTypes to 1 to ensure that the reference loop is entered.
-    __ Add(valuetypes_array_ptr, valuetypes_array_ptr, kValueTypeSize);
-    __ Sub(param_limit, param_limit, kSystemPointerSize);
-    // Use return_count as a scratch register, because it is not used
-    // in this block anymore.
-    __ Mov(return_count, 1);
-    __ Str(return_count, MemOperand(fp, kRefParamsCountOffset));
-    __ cmp(param_ptr, param_limit);
-    __ B(&numeric_params_done, eq);
-  }
-
-  // -------------------------------------------
-  // Param evaluation loop.
-  // -------------------------------------------
-  Label loop_through_params;
-  __ bind(&loop_through_params);
-
-  __ Ldr(param, MemOperand(param_ptr, kSystemPointerSize, PostIndex));
-  __ Ldr(valuetype, MemOperand(valuetypes_array_ptr,
-                                wasm::ValueType::bit_field_offset()));
-
-  // -------------------------------------------
-  // Param conversion.
-  // -------------------------------------------
-  // If param is a Smi we can easily convert it. Otherwise we'll call
-  // a builtin for conversion.
-  Label convert_param, param_conversion_done;
-  __ cmp(valuetype, Immediate(wasm::kWasmI32.raw_bit_field()));
-  __ B(&convert_param, ne);
-  __ JumpIfNotSmi(param, &convert_param);
-  // Change the paramfrom Smi to int32.
-  __ SmiUntag(param);
-  // Place the param into the proper slot in Integer section.
-  __ Str(param,
-        MemOperand(current_int_param_slot, -kSystemPointerSize, PostIndex));
-  __ jmp(&param_conversion_done);
-
-  // -------------------------------------------
-  // Param conversion builtins.
-  // -------------------------------------------
-  __ bind(&convert_param);
-  // The order of pushes is important. We want the heap objects,
-  // that should be scanned by GC, to be on the top of the stack.
-  // We have to set the indicating value for the GC to the number of values
-  // on the top of the stack that have to be scanned before calling
-  // the builtin function.
-  // The builtin expects the parameter to be in register param = x0.
-  constexpr int kBuiltinCallGCScanSlotCount = 2;
-  PrepareForBuiltinCall(masm, MemOperand(fp, kGCScanSlotCountOffset),
-                        kBuiltinCallGCScanSlotCount, param_ptr, param_limit,
-                        current_int_param_slot, current_float_param_slot,
-                        valuetypes_array_ptr, wasm_instance, function_data,
-                        original_fp);
-
-  Label param_kWasmI32_not_smi;
-  Label param_kWasmI64;
-  Label param_kWasmF32;
-  Label param_kWasmF64;
-
-  __ cmp(valuetype, Immediate(wasm::kWasmI32.raw_bit_field()));
-  __ B(&param_kWasmI32_not_smi, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmI64.raw_bit_field()));
-  __ B(&param_kWasmI64, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmF32.raw_bit_field()));
-  __ B(&param_kWasmF32, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmF64.raw_bit_field()));
-  __ B(&param_kWasmF64, eq);
-
-  // The parameter is a reference.
-  // We do not copy the references to the int section yet.
-  // Instead we will later loop over all parameters again to handle reference
-  // parameters. The reason is that later value type parameters may trigger a
-  // GC, and we cannot keep reference parameters alive then. Instead we leave
-  // reference parameters at their initial place on the stack and only copy
-  // them once no GC can happen anymore.
-  // As an optimization we set a flag here that indicates that we have seen a
-  // reference so far. If there was no reference parameter, we would not
-  // iterate over the parameters for a second time.
-  // Use param_limit as a scratch reg,
-  // it is going to be restored in next call anyway.
-  __ Mov(param_limit, Immediate(1));
-  __ Str(param_limit, MemOperand(fp, kRefParamsCountOffset));
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, param_ptr,
-                          original_fp);
-  __ jmp(&param_conversion_done);
-
-  __ bind(&param_kWasmI32_not_smi);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmTaggedNonSmiToInt32),
-          RelocInfo::CODE_TARGET);
-  // Param is the result of the builtin.
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, param_ptr,
-                          original_fp);
-  __ Str(param,
-          MemOperand(current_int_param_slot, -kSystemPointerSize, PostIndex));
-  __ jmp(&param_conversion_done);
-
-  __ bind(&param_kWasmI64);
-  __ Call(BUILTIN_CODE(masm->isolate(), BigIntToI64), RelocInfo::CODE_TARGET);
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, param_ptr,
-                          original_fp);
-  __ Str(param,
-          MemOperand(current_int_param_slot, -kSystemPointerSize, PostIndex));
-  __ jmp(&param_conversion_done);
-
-  __ bind(&param_kWasmF32);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmTaggedToFloat64),
-          RelocInfo::CODE_TARGET);
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, param_ptr,
-                          original_fp);
-  // Truncate float64 to float32.
-  __ Fcvt(s1, kFPReturnRegister0);
-  // Store the full 64 bits to silence a spurious msan error (see
-  // crbug.com/1414270).
-  __ Str(d1,
-         MemOperand(current_float_param_slot, -kSystemPointerSize, PostIndex));
-  __ jmp(&param_conversion_done);
-
-  __ bind(&param_kWasmF64);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmTaggedToFloat64),
-          RelocInfo::CODE_TARGET);
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, param_ptr,
-                          original_fp);
-  __ Str(kFPReturnRegister0,
-          MemOperand(current_float_param_slot, -kSystemPointerSize,
-                    PostIndex));
-  __ jmp(&param_conversion_done);
-
-  // -------------------------------------------
-  // Param conversion done.
-  // -------------------------------------------
-  __ bind(&param_conversion_done);
-
-  __ Add(valuetypes_array_ptr, valuetypes_array_ptr, kValueTypeSize);
-
-  __ cmp(param_ptr, param_limit);
-  __ B(&loop_through_params, ne);
-  __ bind(&numeric_params_done);
-
-  // -------------------------------------------
-  // Second loop to handle references.
-  // -------------------------------------------
-  // In this loop we iterate over all parameters for a second time and copy
-  // all reference parameters at the end of the integer parameters section.
-  Label ref_params_done;
-  // We check if we have seen a reference in the first parameter loop.
-  __ Ldr(param_count, MemOperand(original_fp, kParamCountOffset));
-  DEFINE_REG(ref_param_count);
-  __ Ldr(ref_param_count, MemOperand(fp, kRefParamsCountOffset));
-  __ cmp(ref_param_count, 0);
-  __ B(&ref_params_done, eq);
-  __ Mov(ref_param_count, 0);
-  // We re-calculate the beginning of the value-types array and the beginning
-  // of the parameters ({valuetypes_array_ptr} and {current_param}).
-  __ Ldr(valuetypes_array_ptr, MemOperand(fp, kValueTypesArrayStartOffset));
-  __ Ldr(return_count, MemOperand(fp, kReturnCountOffset));
-  __ Add(valuetypes_array_ptr, valuetypes_array_ptr,
-          Operand(return_count, LSL, kValueTypeSizeLog2));
-  __ Add(param_ptr, original_fp,
-          kFPOnStackSize + kPCOnStackSize + kReceiverOnStackSize);
-  __ Add(param_limit, param_ptr,
-          Operand(param_count, LSL, kSystemPointerSizeLog2));
-  if (stack_switch) {
-    // Materialize the suspender param
-    __ Ldr(param, MemOperand(original_fp, kSuspenderOffset));
-    __ Str(param,
-        MemOperand(current_int_param_slot, -kSystemPointerSize, PostIndex));
-    __ Add(valuetypes_array_ptr, valuetypes_array_ptr, kValueTypeSize);
-    __ Add(ref_param_count, ref_param_count, Immediate(1));
-    __ cmp(param_ptr, param_limit);
-    __ B(&ref_params_done, eq);
-  }
-
-  Label ref_loop_through_params;
-  Label ref_loop_end;
-  // Start of the loop.
-  __ bind(&ref_loop_through_params);
-
-  // Load the current parameter with type.
-  __ Ldr(param, MemOperand(param_ptr, kSystemPointerSize, PostIndex));
-  __ Ldr(valuetype,
-          MemOperand(valuetypes_array_ptr,
-                      wasm::ValueType::bit_field_offset()));
-  // Extract the ValueKind of the type, to check for kRef and kRefNull.
-  __ And(valuetype, valuetype, Immediate(wasm::kWasmValueKindBitsMask));
-  Label move_ref_to_slot;
-  __ cmp(valuetype, Immediate(wasm::ValueKind::kRefNull));
-  __ B(&move_ref_to_slot, eq);
-  __ cmp(valuetype, Immediate(wasm::ValueKind::kRef));
-  __ B(&move_ref_to_slot, eq);
-  __ jmp(&ref_loop_end);
-
-  // Place the param into the proper slot in Integer section.
-  __ bind(&move_ref_to_slot);
-  __ Add(ref_param_count, ref_param_count, Immediate(1));
-  __ Str(param,
-        MemOperand(current_int_param_slot, -kSystemPointerSize, PostIndex));
-
-  // Move to the next parameter.
-  __ bind(&ref_loop_end);
-  __ Add(valuetypes_array_ptr, valuetypes_array_ptr, kValueTypeSize);
-
-  // Check if we finished all parameters.
-  __ cmp(param_ptr, param_limit);
-  __ B(&ref_loop_through_params, ne);
-
-  __ Str(ref_param_count, MemOperand(fp, kRefParamsCountOffset));
-  __ bind(&ref_params_done);
-  // There is no potential GC calls after this point,
-  // so storing it in the spill to reuse register.
-  __ Str(function_data, MemOperand(fp, kFunctionDataOffset));
-
-  regs.ResetExcept(valuetypes_array_ptr, param_count, current_int_param_slot,
-                   current_float_param_slot, wasm_instance, original_fp);
-
-  // -------------------------------------------
-  // Allocate space on the stack for Wasm params.
-  // -------------------------------------------
-  // We have to pre-allocate stack param space before iterating them,
-  // because ARM64 requires SP to be aligned by 16. To comply we have
-  // to insert a 8 bytes gap in a case of odd amount of parameters and
-  // fill the slots skipping this gap. We cannot place the gap slot
-  // at the end, because Wasm function is expecting params from the bottom
-  // border of a caller frame without any gaps.
-
-  // There is one gap slot after the last spill slot.
-  // It is there because kNumSpillSlots + StackMarker == 9*8 bytes,
-  // but SP should be aligned by 16.
-  constexpr int kGapSlotSize = kSystemPointerSize;
-  constexpr int kIntegerSectionStartOffset =
-    kLastSpillOffset - kGapSlotSize - kSystemPointerSize;
-  DEFINE_REG(start_int_section);
-  __ Add(start_int_section, fp, kIntegerSectionStartOffset);
-
-  DEFINE_REG(start_float_section);
-  __ Sub(start_float_section, start_int_section,
-          Operand(param_count, LSL, kSystemPointerSizeLog2));
-
-  // Substract params passed in registers.
-  // There are 6 general purpose and 8 fp registers for parameters,
-  // but kIntegerSectionStartOffset is already shifted by kSystemPointerSize,
-  // so we should substruct (n - 1) slots.
-  __ Sub(start_int_section, start_int_section, 5 * kSystemPointerSize);
-  __ Sub(start_float_section, start_float_section, 7 * kSystemPointerSize);
-
-  // We want the current_param_slot (insertion) pointers to point at the last
-  // param of the section instead of the next free slot.
-  __ Add(current_int_param_slot, current_int_param_slot,
-          Immediate(kSystemPointerSize));
-  __ Add(current_float_param_slot, current_float_param_slot,
-          Immediate(kSystemPointerSize));
-
-  DEFINE_REG(args_pointer);
-  Label has_ints, has_floats;
-  // How much space int params require on stack(in bytes)?
-  __ Subs(args_pointer, start_int_section, current_int_param_slot);
-  __ B(&has_ints, gt);
-  // Clamp negative value to 0.
-  __ Mov(args_pointer, 0);
-  __ bind(&has_ints);
-  ASSIGN_REG(scratch);
-  // How much space float params require on stack(in bytes)?
-  __ Subs(scratch, start_float_section, current_float_param_slot);
-  __ B(&has_floats, gt);
-  // Clamp negative value to 0.
-  __ Mov(scratch, 0);
-  __ bind(&has_floats);
-  // Sum int and float stack space requirements.
-  __ Add(args_pointer, args_pointer, scratch);
-  // Round up stack space to 16 divisor.
-  __ Add(scratch, args_pointer, 0xF);
-  __ Bic(scratch, scratch, 0xF);
-  // Reserve space for params on stack.
-  __ Sub(sp, sp, scratch);
-  // Setup args pointer after possible gap.
-  // args_pointer contains num_of_stack_arguments * kSystemPointerSize.
-  __ Add(args_pointer, sp, args_pointer);
-  // Setup args_pointer to first stack param slot.
-  __ Sub(args_pointer, args_pointer, kSystemPointerSize);
-
-  // -------------------------------------------
-  // Final stack parameters loop.
-  // -------------------------------------------
-  // The parameters that didn't fit into the registers should be placed on
-  // the top of the stack contiguously. The interval of parameters between
-  // the start_section and the current_param_slot pointers define
-  // the remaining parameters of the section.
-  // We can iterate through the valuetypes array to decide from which section
-  // we need to push the parameter onto the top of the stack. By iterating in
-  // a reversed order we can easily pick the last parameter of the proper
-  // section. The parameter of the section is pushed on the top of the stack
-  // only if the interval of remaining params is not empty. This way we
-  // ensure that only params that didn't fit into param registers are
-  // pushed again.
-
-  Label loop_through_valuetypes;
-  Label loop_place_ref_params;
-  ASSIGN_REG(ref_param_count);
-  __ Ldr(ref_param_count, MemOperand(fp, kRefParamsCountOffset));
-  __ bind(&loop_place_ref_params);
-  __ cmp(ref_param_count, Immediate(0));
-  __ B(&loop_through_valuetypes, eq);
-
-  __ Cmp(start_int_section, current_int_param_slot);
-  // if no int or ref param remains, directly iterate valuetypes
-  __ B(&loop_through_valuetypes, le);
-
-  ASSIGN_REG(param);
-  __ Ldr(param,
-          MemOperand(current_int_param_slot, kSystemPointerSize, PostIndex));
-  __ Str(param, MemOperand(args_pointer, -kSystemPointerSize, PostIndex));
-  __ Sub(ref_param_count, ref_param_count, Immediate(1));
-  __ jmp(&loop_place_ref_params);
-
-  __ bind(&loop_through_valuetypes);
-
-  // We iterated through the valuetypes array, we are one field over the end
-  // in the beginning. Also, we have to decrement it in each iteration.
-  __ Sub(valuetypes_array_ptr, valuetypes_array_ptr, kValueTypeSize);
-
-  // Check if there are still remaining integer params.
-  Label continue_loop;
-  __ cmp(start_int_section, current_int_param_slot);
-  // If there are remaining integer params.
-  __ B(&continue_loop, gt);
-
-  // Check if there are still remaining float params.
-  __ cmp(start_float_section, current_float_param_slot);
-  // If there aren't any params remaining.
-  Label params_done;
-  __ B(&params_done, le);
-
-  __ bind(&continue_loop);
-  ASSIGN_REG_W(valuetype);
-  __ Ldr(valuetype, MemOperand(valuetypes_array_ptr,
-                                wasm::ValueType::bit_field_offset()));
-  Label place_integer_param;
-  Label place_float_param;
-  __ cmp(valuetype, Immediate(wasm::kWasmI32.raw_bit_field()));
-  __ B(&place_integer_param, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmI64.raw_bit_field()));
-  __ B(&place_integer_param, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmF32.raw_bit_field()));
-  __ B(&place_float_param, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmF64.raw_bit_field()));
-  __ B(&place_float_param, eq);
-
-  // ref params have already been pushed, so go through directly
-  __ jmp(&loop_through_valuetypes);
-
-  // All other types are reference types. We can just fall through to place
-  // them in the integer section.
-
-  __ bind(&place_integer_param);
-  __ cmp(start_int_section, current_int_param_slot);
-  // If there aren't any integer params remaining, just floats, then go to
-  // the next valuetype.
-  __ B(&loop_through_valuetypes, le);
-
-  // Copy the param from the integer section to the actual parameter area.
-  __ Ldr(param,
-          MemOperand(current_int_param_slot, kSystemPointerSize, PostIndex));
-  __ Str(param, MemOperand(args_pointer, -kSystemPointerSize, PostIndex));
-  __ jmp(&loop_through_valuetypes);
-
-  __ bind(&place_float_param);
-  __ cmp(start_float_section, current_float_param_slot);
-  // If there aren't any float params remaining, just integers, then go to
-  // the next valuetype.
-  __ B(&loop_through_valuetypes, le);
-
-  // Copy the param from the float section to the actual parameter area.
-  __ Ldr(param,
-        MemOperand(current_float_param_slot, kSystemPointerSize, PostIndex));
-  __ Str(param, MemOperand(args_pointer, -kSystemPointerSize, PostIndex));
-  __ jmp(&loop_through_valuetypes);
-
-  __ bind(&params_done);
-
-  regs.ResetExcept(original_fp, wasm_instance, param_count);
-
-  // -------------------------------------------
-  // Move the parameters into the proper param registers.
-  // -------------------------------------------
-  // Exclude param registers from the register registry.
-  regs.Reserve(x0, x2, x3, x4, x5, x6);
-  DEFINE_PINNED(function_entry, x1);
-  ASSIGN_REG(start_int_section);
-  __ Add(start_int_section, fp, kIntegerSectionStartOffset);
-  ASSIGN_REG(start_float_section);
-  __ Sub(start_float_section, start_int_section,
-          Operand(param_count, LSL, kSystemPointerSizeLog2));
-  // Arm64 simulator checks access below SP, so allocate some
-  // extra space to make it happy during filling registers,
-  // when we have less slots than param registers.
-  __ Sub(sp, sp, 8 * kSystemPointerSize);
-  // Fill the FP param registers.
-  __ Ldr(d0, MemOperand(start_float_section, 0));
-  __ Ldr(d1, MemOperand(start_float_section, -kSystemPointerSize));
-  __ Ldr(d2, MemOperand(start_float_section, -2 * kSystemPointerSize));
-  __ Ldr(d3, MemOperand(start_float_section, -3 * kSystemPointerSize));
-  __ Ldr(d4, MemOperand(start_float_section, -4 * kSystemPointerSize));
-  __ Ldr(d5, MemOperand(start_float_section, -5 * kSystemPointerSize));
-  __ Ldr(d6, MemOperand(start_float_section, -6 * kSystemPointerSize));
-  __ Ldr(d7, MemOperand(start_float_section, -7 * kSystemPointerSize));
-
-  // Fill the GP param registers.
-  __ Ldr(x0, MemOperand(start_int_section, 0));
-  __ Ldr(x2, MemOperand(start_int_section, -kSystemPointerSize));
-  __ Ldr(x3, MemOperand(start_int_section, -2 * kSystemPointerSize));
-  __ Ldr(x4, MemOperand(start_int_section, -3 * kSystemPointerSize));
-  __ Ldr(x5, MemOperand(start_int_section, -4 * kSystemPointerSize));
-  __ Ldr(x6, MemOperand(start_int_section, -5 * kSystemPointerSize));
-
-  // Restore SP to previous state.
-  __ Add(sp, sp, 8 * kSystemPointerSize);
-
-  // If we jump through 0 params shortcut, then function_data is live in x1.
-  // In regular flow we need to repopulate it from the spill slot.
-  DCHECK_EQ(function_data, no_reg);
-  function_data = function_entry;
-  __ Ldr(function_data, MemOperand(fp, kFunctionDataOffset));
-
-  __ bind(&prepare_for_wasm_call);
-  // -------------------------------------------
-  // Prepare for the Wasm call.
-  // -------------------------------------------
-  // Set thread_in_wasm_flag.
-  DEFINE_REG(thread_in_wasm_flag_addr);
-  __ Ldr(
-      thread_in_wasm_flag_addr,
-      MemOperand(kRootRegister,
-                  Isolate::thread_in_wasm_flag_address_offset()));
-  ASSIGN_REG(scratch);
-  __ Mov(scratch, 1);
-  __ Str(scratch, MemOperand(thread_in_wasm_flag_addr, 0));
-
-  __ LoadTaggedField(
-      function_entry,
-      FieldMemOperand(function_data,
-                      WasmExportedFunctionData::kInternalOffset));
-  function_data = no_reg;
-  __ LoadExternalPointerField(
-      function_entry,
-      FieldMemOperand(function_entry,
-                      WasmInternalFunction::kCallTargetOffset),
-      kWasmInternalFunctionCallTargetTag);
-
-  // We set the indicating value for the GC to the proper one for Wasm call.
-  __ Str(xzr, MemOperand(fp, kGCScanSlotCountOffset));
-  // -------------------------------------------
-  // Call the Wasm function.
-  // -------------------------------------------
-  __ Call(function_entry);
-
-  // Note: we might be returning to a different frame if the stack was
-  // suspended and resumed during the call. The new frame is set up by
-  // WasmResume and has a compatible layout.
-
-  // -------------------------------------------
-  // Resetting after the Wasm call.
-  // -------------------------------------------
-  // Restore rsp to free the reserved stack slots for the sections.
-  __ Add(sp, fp, kLastSpillOffset - kSystemPointerSize);
-
-  // Unset thread_in_wasm_flag.
-  __ Ldr(
-      thread_in_wasm_flag_addr,
-      MemOperand(kRootRegister,
-                  Isolate::thread_in_wasm_flag_address_offset()));
-  __ Str(xzr, MemOperand(thread_in_wasm_flag_addr, 0));
-
-  regs.ResetExcept(original_fp, wasm_instance);
-
-  // -------------------------------------------
-  // Return handling.
-  // -------------------------------------------
-  DEFINE_PINNED(return_reg, kReturnRegister0); // x0
-  ASSIGN_REG(return_count);
-  __ Ldr(return_count, MemOperand(fp, kReturnCountOffset));
-
-  // If we have 1 return value, then jump to conversion.
-  __ cmp(return_count, 1);
-  Label convert_return;
-  __ B(&convert_return, eq);
-
-  // Otherwise load undefined.
-  __ LoadRoot(return_reg, RootIndex::kUndefinedValue);
-
-  Label return_done;
-  __ bind(&return_done);
-
-  if (stack_switch) {
-    DEFINE_SCOPED(tmp);
-    DEFINE_SCOPED(tmp2);
-    ReloadParentContinuation(masm, wasm_instance, return_reg, tmp, tmp2);
-    RestoreParentSuspender(masm, tmp, tmp2);
-  }
-  __ bind(&suspend);
-  // No need to process the return value if the stack is suspended, there is
-  // a single 'externref' value (the promise) which doesn't require conversion.
-
-  ASSIGN_REG(param_count);
-  __ Ldr(param_count, MemOperand(fp, kParamCountOffset));
-
-  // Calculate the number of parameters we have to pop off the stack. This
-  // number is max(in_param_count, param_count).
-  DEFINE_REG(in_param_count);
-  __ Ldr(in_param_count, MemOperand(fp, kInParamCountOffset));
-  __ cmp(param_count, in_param_count);
-  __ csel(param_count, in_param_count, param_count, lt);
-
-  // -------------------------------------------
-  // Deconstrunct the stack frame.
-  // -------------------------------------------
-  __ LeaveFrame(stack_switch ? StackFrame::STACK_SWITCH
-                             : StackFrame::JS_TO_WASM);
-
-  // We have to remove the caller frame slots:
-  //  - JS arguments
-  //  - the receiver
-  // and transfer the control to the return address (the return address is
-  // expected to be on the top of the stack).
-  // We cannot use just the ret instruction for this, because we cannot pass
-  // the number of slots to remove in a Register as an argument.
-  __ DropArguments(param_count, MacroAssembler::kCountExcludesReceiver);
-  __ Ret(lr);
-
-  // -------------------------------------------
-  // Return conversions.
-  // -------------------------------------------
-  __ bind(&convert_return);
-  // We have to make sure that the kGCScanSlotCount is set correctly when we
-  // call the builtins for conversion. For these builtins it's the same as
-  // for the Wasm call, that is, kGCScanSlotCount = 0, so we don't have to
-  // reset it. We don't need the JS context for these builtin calls.
-
-  ASSIGN_REG(valuetypes_array_ptr);
-  __ Ldr(valuetypes_array_ptr, MemOperand(fp, kValueTypesArrayStartOffset));
-  // The first valuetype of the array is the return's valuetype.
-  ASSIGN_REG_W(valuetype);
-  __ Ldr(valuetype,
-        MemOperand(valuetypes_array_ptr,
-                    wasm::ValueType::bit_field_offset()));
-
-  Label return_kWasmI32;
-  Label return_kWasmI64;
-  Label return_kWasmF32;
-  Label return_kWasmF64;
-  Label return_kWasmFuncRef;
-
-  __ cmp(valuetype, Immediate(wasm::kWasmI32.raw_bit_field()));
-  __ B(&return_kWasmI32, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmI64.raw_bit_field()));
-  __ B(&return_kWasmI64, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmF32.raw_bit_field()));
-  __ B(&return_kWasmF32, eq);
-
-  __ cmp(valuetype, Immediate(wasm::kWasmF64.raw_bit_field()));
-  __ B(&return_kWasmF64, eq);
-
-  // kWasmFuncRef is not representable as a cmp immediate operand.
-  ASSIGN_REG_W(scratch);
-  __ Mov(scratch, Immediate(wasm::kWasmFuncRef.raw_bit_field()));
-  __ cmp(valuetype, scratch);
-  __ B(&return_kWasmFuncRef, eq);
-
-  // All types that are not SIMD are reference types.
-  __ cmp(valuetype, Immediate(wasm::kWasmS128.raw_bit_field()));
-  // References can be passed to JavaScript as is.
-  __ B(&return_done, ne);
-
-  __ bind(&return_kWasmI32);
-  Label to_heapnumber;
-  // If pointer compression is disabled, we can convert the return to a smi.
-  if (SmiValuesAre32Bits()) {
-    __ SmiTag(return_reg);
-  } else {
-    __ Mov(scratch, return_reg.W());
-    // Double the return value to test if it can be a Smi.
-    __ Adds(scratch, scratch, return_reg.W());
-    // If there was overflow, convert the return value to a HeapNumber.
-    __ B(&to_heapnumber, vs);
-    // If there was no overflow, we can convert to Smi.
-    __ SmiTag(return_reg);
-  }
-  __ jmp(&return_done);
-
-  // Handle the conversion of the I32 return value to HeapNumber when it
-  // cannot be a smi.
-  __ bind(&to_heapnumber);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmInt32ToHeapNumber),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  __ bind(&return_kWasmI64);
-  __ Call(BUILTIN_CODE(masm->isolate(), I64ToBigInt),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  __ bind(&return_kWasmF32);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmFloat32ToNumber),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  __ bind(&return_kWasmF64);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmFloat64ToNumber),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  __ bind(&return_kWasmFuncRef);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmFuncRefToJS),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  regs.ResetExcept();
-
-  // --------------------------------------------------------------------------
-  //                          Deferred code.
-  // --------------------------------------------------------------------------
-
-  if (!stack_switch) {
-    // -------------------------------------------
-    // Kick off compilation.
-    // -------------------------------------------
-    __ bind(&compile_wrapper);
-    // Enable GC.
-    MemOperand GCScanSlotPlace = MemOperand(fp, kGCScanSlotCountOffset);
-    ASSIGN_REG(scratch);
-    __ Mov(scratch, 4);
-    __ Str(scratch, GCScanSlotPlace);
-
-    // These register are live and pinned to the same values
-    // at the place of jumping to this deffered code.
-    DEFINE_PINNED(function_data, kJSFunctionRegister);
-    DEFINE_PINNED(wasm_instance, kWasmInstanceRegister);
-    __ Stp(wasm_instance, function_data,
-      MemOperand(sp, -2 * kSystemPointerSize, PreIndex));
-    // Push the arguments for the runtime call.
-    __ Push(wasm_instance, function_data);
-    // Set up context.
-    __ Move(kContextRegister, Smi::zero());
-    // Call the runtime function that kicks off compilation.
-    __ CallRuntime(Runtime::kWasmCompileWrapper, 2);
-    __ Ldp(wasm_instance, function_data,
-      MemOperand(sp, 2 * kSystemPointerSize, PostIndex));
-    __ jmp(&compile_wrapper_done);
-  }
-}
-
-} // namespace
-
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
-  GenericJSToWasmWrapperHelper(masm, false);
-}
-
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
-  GenericJSToWasmWrapperHelper(masm, true);
-}
-
-void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
-  auto regs = RegisterAllocator::WithAllocatableGeneralRegisters();
-  // Set up the stackframe.
-  __ EnterFrame(StackFrame::STACK_SWITCH);
-
-  DEFINE_PINNED(promise, x0);
-  DEFINE_PINNED(suspender, x1);
-
-  __ Sub(sp, sp, RoundUp(-(BuiltinWasmWrapperConstants::kGCScanSlotCountOffset
-                           - TypedFrameConstants::kFixedFrameSizeFromFp), 16));
-  // Set a sentinel value for the spill slot visited by the GC.
-  DEFINE_REG(undefined);
-  __ LoadRoot(undefined, RootIndex::kUndefinedValue);
-  __ Str(undefined,
-          MemOperand(fp, BuiltinWasmWrapperConstants::kSuspenderOffset));
-
-  // TODO(thibaudm): Throw if any of the following holds:
-  // - caller is null
-  // - ActiveSuspender is undefined
-  // - 'suspender' is not the active suspender
-
-  // -------------------------------------------
-  // Save current state in active jump buffer.
-  // -------------------------------------------
-  Label resume;
-  DEFINE_REG(continuation);
-  __ LoadRoot(continuation, RootIndex::kActiveContinuation);
-  DEFINE_REG(jmpbuf);
-  DEFINE_REG(scratch);
-  __ LoadExternalPointerField(
-      jmpbuf,
-      FieldMemOperand(continuation, WasmContinuationObject::kJmpbufOffset),
-      kWasmContinuationJmpbufTag);
-  FillJumpBuffer(masm, jmpbuf, &resume, scratch);
-  SwitchStackState(masm, jmpbuf, scratch, wasm::JumpBuffer::Active,
-                   wasm::JumpBuffer::Inactive);
-  __ Move(scratch, Smi::FromInt(WasmSuspenderObject::kSuspended));
-  __ StoreTaggedField(
-      scratch,
-      FieldMemOperand(suspender, WasmSuspenderObject::kStateOffset));
-  regs.ResetExcept(promise, suspender, continuation);
-
-  DEFINE_REG(suspender_continuation);
-  __ LoadTaggedField(
-      suspender_continuation,
-      FieldMemOperand(suspender, WasmSuspenderObject::kContinuationOffset));
-  if (v8_flags.debug_code) {
-    // -------------------------------------------
-    // Check that the suspender's continuation is the active continuation.
-    // -------------------------------------------
-    // TODO(thibaudm): Once we add core stack-switching instructions, this
-    // check will not hold anymore: it's possible that the active continuation
-    // changed (due to an internal switch), so we have to update the suspender.
-    __ cmp(suspender_continuation, continuation);
-    Label ok;
-    __ B(&ok, eq);
-    __ Trap();
-    __ bind(&ok);
-  }
-  FREE_REG(continuation);
-  // -------------------------------------------
-  // Update roots.
+  // Update roots.
   // -------------------------------------------
   DEFINE_REG(caller);
   __ LoadTaggedField(caller,
@@ -4540,31 +3730,26 @@ void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
       MacroAssembler::RootRegisterOffsetForRootIndex(
           RootIndex::kActiveSuspender);
   __ Str(parent, MemOperand(kRootRegister, active_suspender_offset));
-  regs.ResetExcept(promise, caller);
+  regs.ResetExcept(suspender, caller);
 
   // -------------------------------------------
   // Load jump buffer.
   // -------------------------------------------
-  MemOperand GCScanSlotPlace =
-      MemOperand(fp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
-  ASSIGN_REG(scratch);
-  __ Mov(scratch, 2);
-  __ Str(scratch, GCScanSlotPlace);
-  __ Stp(caller, promise,
-      MemOperand(sp, -2 * kSystemPointerSize, PreIndex));
-  __ Move(kContextRegister, Smi::zero());
-  __ CallRuntime(Runtime::kWasmSyncStackLimit);
-  __ Ldp(caller, promise,
-      MemOperand(sp, 2 * kSystemPointerSize, PostIndex));
+  SyncStackLimit(masm, caller, suspender);
   ASSIGN_REG(jmpbuf);
   __ LoadExternalPointerField(
       jmpbuf, FieldMemOperand(caller, WasmContinuationObject::kJmpbufOffset),
       kWasmContinuationJmpbufTag);
-  __ Mov(kReturnRegister0, promise);
+  __ LoadTaggedField(
+      kReturnRegister0,
+      FieldMemOperand(suspender, WasmSuspenderObject::kPromiseOffset));
+  MemOperand GCScanSlotPlace =
+      MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset);
   __ Str(xzr, GCScanSlotPlace);
+  ASSIGN_REG(scratch)
   LoadJumpBuffer(masm, jmpbuf, true, scratch);
   __ Trap();
-  __ bind(&resume);
+  __ Bind(&resume, BranchTargetIdentifier::kBtiJump);
   __ LeaveFrame(StackFrame::STACK_SWITCH);
   __ Ret(lr);
 }
@@ -4578,26 +3763,13 @@ void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) {
   auto regs = RegisterAllocator::WithAllocatableGeneralRegisters();
   __ EnterFrame(StackFrame::STACK_SWITCH);
 
-  DEFINE_PINNED(param_count, kJavaScriptCallArgCountRegister);
-  __ Sub(param_count, param_count, 1);          // Exclude receiver.
   DEFINE_PINNED(closure, kJSFunctionRegister);  // x1
 
-  // These slots are not used in this builtin. But when we return from the
-  // resumed continuation, we return to the GenericJSToWasmWrapper code, which
-  // expects these slots to be set.
-  constexpr int kInParamCountOffset =
-      BuiltinWasmWrapperConstants::kInParamCountOffset;
-  constexpr int kParamCountOffset =
-      BuiltinWasmWrapperConstants::kParamCountOffset;
-  // Extra slot for allignment.
-  __ Sub(sp, sp, Immediate(4 * kSystemPointerSize));
-  __ Str(param_count, MemOperand(fp, kParamCountOffset));
-  __ Str(param_count, MemOperand(fp, kInParamCountOffset));
-  // Set a sentinel value for the spill slot visited by the GC.
-  DEFINE_REG(scratch);
-  __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ Str(scratch,
-         MemOperand(fp, BuiltinWasmWrapperConstants::kSuspenderOffset));
+  __ Sub(sp, sp,
+         Immediate(StackSwitchFrameConstants::kNumSpillSlots *
+                   kSystemPointerSize));
+  // Set a sentinel value for the spill slots visited by the GC.
+  ResetStackSwitchFrameStackSlots(masm);
 
   regs.ResetExcept(closure);
 
@@ -4642,7 +3814,7 @@ void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) {
   DEFINE_REG(active_continuation);
   __ LoadRoot(active_continuation, RootIndex::kActiveContinuation);
   DEFINE_REG(current_jmpbuf);
-  ASSIGN_REG(scratch);
+  DEFINE_REG(scratch);
   __ LoadExternalPointerField(
       current_jmpbuf,
       FieldMemOperand(active_continuation,
@@ -4698,16 +3870,7 @@ void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) {
   __ Str(target_continuation,
          MemOperand(kRootRegister, active_continuation_offset));
 
-  MemOperand GCScanSlotPlace =
-      MemOperand(fp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
-  __ Mov(scratch, 1);
-  __ Str(scratch, GCScanSlotPlace);
-  __ Stp(target_continuation, scratch, // Scratch for padding.
-         MemOperand(sp, -2*kSystemPointerSize, PreIndex));
-  __ Move(kContextRegister, Smi::zero());
-  __ CallRuntime(Runtime::kWasmSyncStackLimit);
-  __ Ldp(target_continuation, scratch,
-         MemOperand(sp, 2*kSystemPointerSize, PostIndex));
+  SyncStackLimit(masm, target_continuation);
 
   regs.ResetExcept(target_continuation);
 
@@ -4724,10 +3887,15 @@ void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) {
       kWasmContinuationJmpbufTag);
   // Move resolved value to return register.
   __ Ldr(kReturnRegister0, MemOperand(fp, 3 * kSystemPointerSize));
+  MemOperand GCScanSlotPlace =
+      MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset);
   __ Str(xzr, GCScanSlotPlace);
   if (on_resume == wasm::OnResume::kThrow) {
     // Switch to the continuation's stack without restoring the PC.
     LoadJumpBuffer(masm, target_jmpbuf, false, scratch);
+    // Pop this frame now. The unwinder expects that the first STACK_SWITCH
+    // frame is the outermost one.
+    __ LeaveFrame(StackFrame::STACK_SWITCH);
     // Forward the onRejected value to kThrow.
     __ Push(xzr, kReturnRegister0);
     __ CallRuntime(Runtime::kThrow);
@@ -4736,7 +3904,7 @@ void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) {
     LoadJumpBuffer(masm, target_jmpbuf, true, scratch);
   }
   __ Trap();
-  __ bind(&suspend);
+  __ Bind(&suspend, BranchTargetIdentifier::kBtiJump);
   __ LeaveFrame(StackFrame::STACK_SWITCH);
   // Pop receiver + parameter.
   __ DropArguments(2, MacroAssembler::kCountIncludesReceiver);
@@ -4756,19 +3924,475 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
   // Only needed on x64.
   __ Trap();
 }
+namespace {
+void SwitchToAllocatedStack(MacroAssembler* masm, RegisterAllocator& regs,
+                            Register wasm_instance, Register wrapper_buffer,
+                            Register& original_fp, Register& new_wrapper_buffer,
+                            Label* suspend) {
+  ResetStackSwitchFrameStackSlots(masm);
+  DEFINE_SCOPED(scratch)
+  DEFINE_REG(target_continuation)
+  __ LoadRoot(target_continuation, RootIndex::kActiveContinuation);
+  DEFINE_REG(parent_continuation)
+  __ LoadTaggedField(parent_continuation,
+                     FieldMemOperand(target_continuation,
+                                     WasmContinuationObject::kParentOffset));
+  SaveState(masm, parent_continuation, scratch, suspend);
+  SyncStackLimit(masm, wasm_instance, wrapper_buffer);
+  FREE_REG(parent_continuation);
+  // Save the old stack's fp in x9, and use it to access the parameters in
+  // the parent frame.
+  regs.Pinned(x9, &original_fp);
+  __ Mov(original_fp, fp);
+  __ LoadRoot(target_continuation, RootIndex::kActiveContinuation);
+  LoadTargetJumpBuffer(masm, target_continuation, scratch);
+  FREE_REG(target_continuation);
+  // Push the loaded fp. We know it is null, because there is no frame yet,
+  // so we could also push 0 directly. In any case we need to push it,
+  // because this marks the base of the stack segment for
+  // the stack frame iterator.
+  __ EnterFrame(StackFrame::STACK_SWITCH);
+  int stack_space =
+      RoundUp(StackSwitchFrameConstants::kNumSpillSlots * kSystemPointerSize +
+                  JSToWasmWrapperFrameConstants::kWrapperBufferSize,
+              16);
+  __ Sub(sp, sp, Immediate(stack_space));
+  ASSIGN_REG(new_wrapper_buffer)
+  __ Mov(new_wrapper_buffer, sp);
+  // Copy data needed for return handling from old wrapper buffer to new one.
+  // kWrapperBufferRefReturnCount will be copied too, because 8 bytes are copied
+  // at the same time.
+  static_assert(JSToWasmWrapperFrameConstants::kWrapperBufferRefReturnCount ==
+                JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount + 4);
+  __ Ldr(scratch,
+         MemOperand(wrapper_buffer,
+                    JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount));
+  __ Str(scratch,
+         MemOperand(new_wrapper_buffer,
+                    JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount));
+  __ Ldr(
+      scratch,
+      MemOperand(
+          wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferSigRepresentationArray));
+  __ Str(
+      scratch,
+      MemOperand(
+          new_wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferSigRepresentationArray));
+}
+
+void SwitchBackAndReturnPromise(MacroAssembler* masm, RegisterAllocator& regs,
+                                Label* return_promise) {
+  regs.ResetExcept();
+  DEFINE_PINNED(return_reg, kReturnRegister0);  // x0
+  // The return value of the wasm function becomes the parameter of the
+  // FulfillPromise builtin, and the promise is the return value of this
+  // wrapper.
+  DEFINE_PINNED(return_value, x1);
+  __ Move(return_value, return_reg);
+  DEFINE_SCOPED(tmp);
+  DEFINE_SCOPED(tmp2);
+  Register promise = return_reg;
+  __ LoadRoot(promise, RootIndex::kActiveSuspender);
+  __ LoadTaggedField(
+      promise, FieldMemOperand(promise, WasmSuspenderObject::kPromiseOffset));
+
+  __ Ldr(kContextRegister,
+         MemOperand(fp, StackSwitchFrameConstants::kInstanceOffset));
+  __ LoadTaggedField(kContextRegister,
+                     FieldMemOperand(kContextRegister,
+                                     WasmInstanceObject::kNativeContextOffset));
+  __ Mov(tmp, 1);
+  __ Str(tmp,
+         MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset));
+  __ Push(padreg, promise);
+  __ CallBuiltin(Builtin::kFulfillPromise);
+  __ Pop(promise, padreg);
+
+  __ bind(return_promise);
+  ReloadParentContinuation(masm, promise, tmp, tmp2);
+  RestoreParentSuspender(masm, tmp, tmp2);
+  FREE_REG(return_value);
+}
+
+void GenerateExceptionHandlingLandingPad(MacroAssembler* masm,
+                                         RegisterAllocator& regs,
+                                         Label* return_promise) {
+  int catch_handler = __ pc_offset();
+  __ JumpTarget();
+
+  DEFINE_SCOPED(thread_in_wasm_flag_addr);
+  thread_in_wasm_flag_addr = x2;
+  // Unset thread_in_wasm_flag.
+  __ Ldr(
+      thread_in_wasm_flag_addr,
+      MemOperand(kRootRegister, Isolate::thread_in_wasm_flag_address_offset()));
+  __ Str(xzr, MemOperand(thread_in_wasm_flag_addr, 0));
+
+  // The exception becomes the parameter of the RejectPromise builtin, and the
+  // promise is the return value of this wrapper.
+  __ Move(x1, kReturnRegister0);
+  Register promise = kReturnRegister0;
+  __ LoadRoot(promise, RootIndex::kActiveSuspender);
+  __ LoadTaggedField(
+      promise, FieldMemOperand(promise, WasmSuspenderObject::kPromiseOffset));
+
+  __ Ldr(kContextRegister,
+         MemOperand(fp, StackSwitchFrameConstants::kInstanceOffset));
+  __ LoadTaggedField(kContextRegister,
+                     FieldMemOperand(kContextRegister,
+                                     WasmInstanceObject::kNativeContextOffset));
+  __ Mov(x2, 1);
+  __ Str(x2, MemOperand(fp, StackSwitchFrameConstants::kGCScanSlotCountOffset));
+  __ Push(padreg, promise);
+  static const Builtin_RejectPromise_InterfaceDescriptor desc;
+  static_assert(desc.GetRegisterParameter(0) == x0 &&  // promise
+                desc.GetRegisterParameter(1) == x1 &&  // reason
+                desc.GetRegisterParameter(2) == x2     // debugEvent
+  );
+  __ LoadRoot(x2, RootIndex::kTrueValue);
+  __ CallBuiltin(Builtin::kRejectPromise);
+  __ Pop(promise, padreg);
+
+  // Run the rest of the wrapper normally (switch to the old stack,
+  // deconstruct the frame, ...).
+  __ jmp(return_promise);
+
+  masm->isolate()->builtins()->SetJSPIPromptHandlerOffset(catch_handler);
+}
+
+void JSToWasmWrapperHelper(MacroAssembler* masm, bool stack_switch) {
+  auto regs = RegisterAllocator::WithAllocatableGeneralRegisters();
+
+  __ EnterFrame(stack_switch ? StackFrame::STACK_SWITCH
+                             : StackFrame::JS_TO_WASM);
+
+  __ Sub(sp, sp,
+         Immediate(StackSwitchFrameConstants::kNumSpillSlots *
+                   kSystemPointerSize));
+
+  DEFINE_PINNED(wasm_instance, kWasmInstanceRegister);
+  __ Ldr(wasm_instance,
+         MemOperand(fp, JSToWasmWrapperFrameConstants::kInstanceParamOffset));
+
+  DEFINE_PINNED(wrapper_buffer,
+                WasmJSToWasmWrapperDescriptor::WrapperBufferRegister());
+
+  Label suspend;
+  Register original_fp = no_reg;
+  Register new_wrapper_buffer = no_reg;
+  if (stack_switch) {
+    SwitchToAllocatedStack(masm, regs, wasm_instance, wrapper_buffer,
+                           original_fp, new_wrapper_buffer, &suspend);
+  } else {
+    original_fp = fp;
+    new_wrapper_buffer = wrapper_buffer;
+  }
+
+  regs.ResetExcept(original_fp, wrapper_buffer, wasm_instance,
+                   new_wrapper_buffer);
+
+  {
+    __ Str(new_wrapper_buffer,
+           MemOperand(fp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset));
+    if (stack_switch) {
+      __ Str(wasm_instance,
+             MemOperand(fp, StackSwitchFrameConstants::kInstanceOffset));
+      DEFINE_SCOPED(scratch)
+      __ Ldr(
+          scratch,
+          MemOperand(original_fp,
+                     JSToWasmWrapperFrameConstants::kResultArrayParamOffset));
+      __ Str(scratch,
+             MemOperand(fp, StackSwitchFrameConstants::kResultArrayOffset));
+    }
+  }
+  {
+    DEFINE_SCOPED(result_size);
+    __ Ldr(result_size,
+           MemOperand(wrapper_buffer, JSToWasmWrapperFrameConstants::
+                                          kWrapperBufferStackReturnBufferSize));
+    // The `result_size` is the number of slots needed on the stack to store the
+    // return values of the wasm function. If `result_size` is an odd number, we
+    // have to add `1` to preserve stack pointer alignment.
+    __ Add(result_size, result_size, 1);
+    __ Bic(result_size, result_size, 1);
+    __ Sub(sp, sp, Operand(result_size, LSL, kSystemPointerSizeLog2));
+  }
+  {
+    DEFINE_SCOPED(scratch);
+    __ Mov(scratch, sp);
+    __ Str(scratch, MemOperand(new_wrapper_buffer,
+                               JSToWasmWrapperFrameConstants::
+                                   kWrapperBufferStackReturnBufferStart));
+  }
+  if (stack_switch) {
+    FREE_REG(new_wrapper_buffer)
+  }
+  FREE_REG(wasm_instance)
+  for (auto reg : wasm::kGpParamRegisters) {
+    regs.Reserve(reg);
+  }
+
+  // The first GP parameter is the instance, which we handle specially.
+  int stack_params_offset =
+      (arraysize(wasm::kGpParamRegisters) - 1) * kSystemPointerSize +
+      arraysize(wasm::kFpParamRegisters) * kDoubleSize;
+
+  {
+    DEFINE_SCOPED(params_start);
+    __ Ldr(params_start,
+           MemOperand(wrapper_buffer,
+                      JSToWasmWrapperFrameConstants::kWrapperBufferParamStart));
+    {
+      // Push stack parameters on the stack.
+      DEFINE_SCOPED(params_end);
+      __ Ldr(params_end,
+             MemOperand(wrapper_buffer,
+                        JSToWasmWrapperFrameConstants::kWrapperBufferParamEnd));
+      DEFINE_SCOPED(last_stack_param);
+
+      __ Add(last_stack_param, params_start, Immediate(stack_params_offset));
+      Label loop_start;
+      {
+        DEFINE_SCOPED(scratch);
+        // Check if there is an even number of parameters, so no alignment
+        // needed.
+        __ Sub(scratch, params_end, last_stack_param);
+        __ TestAndBranchIfAllClear(scratch, 0x8, &loop_start);
+
+        // Push the first parameter with alignment.
+        __ Ldr(scratch, MemOperand(params_end, -kSystemPointerSize, PreIndex));
+        __ Push(xzr, scratch);
+      }
+      __ bind(&loop_start);
+
+      Label finish_stack_params;
+      __ Cmp(last_stack_param, params_end);
+      __ B(ge, &finish_stack_params);
+
+      // Push parameter
+      {
+        DEFINE_SCOPED(scratch1);
+        DEFINE_SCOPED(scratch2);
+        __ Ldp(scratch2, scratch1,
+               MemOperand(params_end, -2 * kSystemPointerSize, PreIndex));
+        __ Push(scratch1, scratch2);
+      }
+      __ jmp(&loop_start);
+
+      __ bind(&finish_stack_params);
+    }
+
+    size_t next_offset = 0;
+    for (size_t i = 1; i < arraysize(wasm::kGpParamRegisters); i += 2) {
+      // Check that {params_start} does not overlap with any of the parameter
+      // registers, so that we don't overwrite it by accident with the loads
+      // below.
+      DCHECK_NE(params_start, wasm::kGpParamRegisters[i]);
+      DCHECK_NE(params_start, wasm::kGpParamRegisters[i + 1]);
+      __ Ldp(wasm::kGpParamRegisters[i], wasm::kGpParamRegisters[i + 1],
+             MemOperand(params_start, next_offset));
+      next_offset += 2 * kSystemPointerSize;
+    }
+
+    for (size_t i = 0; i < arraysize(wasm::kFpParamRegisters); i += 2) {
+      __ Ldp(wasm::kFpParamRegisters[i], wasm::kFpParamRegisters[i + 1],
+             MemOperand(params_start, next_offset));
+      next_offset += 2 * kDoubleSize;
+    }
+    DCHECK_EQ(next_offset, stack_params_offset);
+  }
+
+  {
+    DEFINE_SCOPED(thread_in_wasm_flag_addr);
+    __ Ldr(thread_in_wasm_flag_addr,
+           MemOperand(kRootRegister,
+                      Isolate::thread_in_wasm_flag_address_offset()));
+    DEFINE_SCOPED(scratch);
+    __ Mov(scratch, 1);
+    __ Str(scratch, MemOperand(thread_in_wasm_flag_addr, 0));
+  }
+  {
+    DEFINE_SCOPED(call_target);
+    __ Ldr(call_target,
+           MemOperand(wrapper_buffer,
+                      JSToWasmWrapperFrameConstants::kWrapperBufferCallTarget));
+    __ Call(call_target);
+  }
+  regs.ResetExcept();
+  // The wrapper_buffer has to be in x2 as the correct parameter register.
+  regs.Reserve(kReturnRegister0, kReturnRegister1);
+  ASSIGN_PINNED(wrapper_buffer, x2);
+  {
+    DEFINE_SCOPED(thread_in_wasm_flag_addr);
+    __ Ldr(thread_in_wasm_flag_addr,
+           MemOperand(kRootRegister,
+                      Isolate::thread_in_wasm_flag_address_offset()));
+    __ Str(xzr, MemOperand(thread_in_wasm_flag_addr, 0));
+  }
+
+  __ Ldr(wrapper_buffer,
+         MemOperand(fp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset));
+
+  __ Str(wasm::kFpReturnRegisters[0],
+         MemOperand(
+             wrapper_buffer,
+             JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister1));
+  __ Str(wasm::kFpReturnRegisters[1],
+         MemOperand(
+             wrapper_buffer,
+             JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister2));
+  __ Str(wasm::kGpReturnRegisters[0],
+         MemOperand(
+             wrapper_buffer,
+             JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister1));
+  __ Str(wasm::kGpReturnRegisters[1],
+         MemOperand(
+             wrapper_buffer,
+             JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister2));
+  // Call the return value builtin with
+  // x0: wasm instance.
+  // x1: the result JSArray for multi-return.
+  // x2: pointer to the byte buffer which contains all parameters.
+  if (stack_switch) {
+    __ Ldr(x1, MemOperand(fp, StackSwitchFrameConstants::kResultArrayOffset));
+    __ Ldr(x0, MemOperand(fp, StackSwitchFrameConstants::kInstanceOffset));
+  } else {
+    __ Ldr(x1, MemOperand(
+                   fp, JSToWasmWrapperFrameConstants::kResultArrayParamOffset));
+    __ Ldr(x0,
+           MemOperand(fp, JSToWasmWrapperFrameConstants::kInstanceParamOffset));
+  }
+  __ Call(BUILTIN_CODE(masm->isolate(), JSToWasmHandleReturns),
+          RelocInfo::CODE_TARGET);
+
+  Label return_promise;
+  if (stack_switch) {
+    SwitchBackAndReturnPromise(masm, regs, &return_promise);
+  }
+  __ Bind(&suspend, BranchTargetIdentifier::kBtiJump);
+
+  __ LeaveFrame(stack_switch ? StackFrame::STACK_SWITCH
+                             : StackFrame::JS_TO_WASM);
+  // Despite returning to the different location for regular and stack switching
+  // versions, incoming argument count matches both cases:
+  // instance and result array without suspend or
+  // or promise resolve/reject params for callback.
+  constexpr int64_t stack_arguments_in = 2;
+  __ DropArguments(stack_arguments_in, MacroAssembler::kCountIncludesReceiver);
+  __ Ret();
+
+  // Catch handler for the stack-switching wrapper: reject the promise with the
+  // thrown exception.
+  if (stack_switch) {
+    GenerateExceptionHandlingLandingPad(masm, regs, &return_promise);
+  }
+}
+}  // namespace
+
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) {
+  JSToWasmWrapperHelper(masm, false);
+}
+
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
+  JSToWasmWrapperHelper(masm, true);
+}
+
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
-  // The Abort mechanism relies on CallRuntime, which in turn relies on
-  // CEntry, so until this stub has been generated, we have to use a
-  // fall-back Abort mechanism.
-  //
-  // Note that this stub must be generated before any use of Abort.
-  HardAbortScope hard_aborts(masm);
+#if V8_ENABLE_WEBASSEMBLY
+namespace {
+void SwitchSimulatorStackLimit(MacroAssembler* masm) {
+  if (masm->options().enable_simulator_code) {
+    UseScratchRegisterScope temps(masm);
+    temps.Exclude(x16);
+    __ LoadStackLimit(x16, StackLimitKind::kRealStackLimit);
+    __ hlt(kImmExceptionIsSwitchStackLimit);
+  }
+}
+
+static constexpr Register kOldSPRegister = x23;
+static constexpr Register kSwitchFlagRegister = x24;
+
+void SwitchToTheCentralStackIfNeeded(MacroAssembler* masm, Register argc_input,
+                                     Register target_input,
+                                     Register argv_input) {
+  using ER = ExternalReference;
+
+  __ Mov(kSwitchFlagRegister, 0);
+  __ Mov(kOldSPRegister, sp);
+
+  // Using x2-x4 as temporary registers, because they will be rewritten
+  // before exiting to native code anyway.
+
+  ER on_central_stack_flag_loc = ER::Create(
+      IsolateAddressId::kIsOnCentralStackFlagAddress, masm->isolate());
+  const Register& on_central_stack_flag = x2;
+  __ Mov(on_central_stack_flag, on_central_stack_flag_loc);
+  __ Ldrb(on_central_stack_flag, MemOperand(on_central_stack_flag));
+
+  Label do_not_need_to_switch;
+  __ Cbnz(on_central_stack_flag, &do_not_need_to_switch);
+  // Switch to central stack.
+
+  static constexpr Register central_stack_sp = x4;
+  DCHECK(!AreAliased(central_stack_sp, argc_input, argv_input, target_input));
+  {
+    __ Push(argc_input, target_input, argv_input, padreg);
+    __ Mov(arg_reg_1, ER::isolate_address(masm->isolate()));
+    __ Mov(arg_reg_2, kOldSPRegister);
+    __ CallCFunction(ER::wasm_switch_to_the_central_stack(), 2);
+    __ Mov(central_stack_sp, kReturnRegister0);
+    __ Pop(padreg, argv_input, target_input, argc_input);
+  }
+
+  SwitchSimulatorStackLimit(masm);
+
+  static constexpr int kReturnAddressSlotOffset = 1 * kSystemPointerSize;
+  static constexpr int kPadding = 1 * kSystemPointerSize;
+  __ Sub(sp, central_stack_sp, kReturnAddressSlotOffset + kPadding);
+  __ Mov(kSwitchFlagRegister, 1);
+
+  // Update the sp saved in the frame.
+  // It will be used to calculate the callee pc during GC.
+  // The pc is going to be on the new stack segment, so rewrite it here.
+  __ Add(central_stack_sp, sp, kSystemPointerSize);
+  __ Str(central_stack_sp, MemOperand(fp, ExitFrameConstants::kSPOffset));
 
+  __ bind(&do_not_need_to_switch);
+}
+
+void SwitchFromTheCentralStackIfNeeded(MacroAssembler* masm) {
+  using ER = ExternalReference;
+
+  Label no_stack_change;
+  __ Cbz(kSwitchFlagRegister, &no_stack_change);
+
+  {
+    __ Push(kReturnRegister0, kReturnRegister1);
+    __ Mov(arg_reg_1, ER::isolate_address(masm->isolate()));
+    __ CallCFunction(ER::wasm_switch_from_the_central_stack(), 1);
+    __ Pop(kReturnRegister1, kReturnRegister0);
+  }
+
+  SwitchSimulatorStackLimit(masm);
+
+  __ Mov(sp, kOldSPRegister);
+
+  __ bind(&no_stack_change);
+}
+}  // namespace
+#endif  // V8_ENABLE_WEBASSEMBLY
+
+void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   ASM_LOCATION("CEntry::Generate entry");
 
+  using ER = ExternalReference;
+
   // Register parameters:
   //    x0: argc (including receiver, untagged)
   //    x1: target
@@ -4786,51 +4410,38 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
   //
   // The arguments are in reverse order, so that arg[argc-2] is actually the
   // first argument to the target function and arg[0] is the last.
-  const Register& argc_input = x0;
-  const Register& target_input = x1;
-
-  // Calculate argv, argc and the target address, and store them in
-  // callee-saved registers so we can retry the call without having to reload
-  // these arguments.
-  // TODO(jbramley): If the first call attempt succeeds in the common case (as
-  // it should), then we might be better off putting these parameters directly
-  // into their argument registers, rather than using callee-saved registers and
-  // preserving them on the stack.
-  const Register& argv = x21;
-  const Register& argc = x22;
-  const Register& target = x23;
-
-  // Derive argv from the stack pointer so that it points to the first argument
-  // (arg[argc-2]), or just below the receiver in case there are no arguments.
-  //  - Adjust for the arg[] array.
-  Register temp_argv = x11;
+  static constexpr Register argc_input = x0;
+  static constexpr Register target_input = x1;
+  // Initialized below if ArgvMode::kStack.
+  static constexpr Register argv_input = x11;
+
   if (argv_mode == ArgvMode::kStack) {
-    __ SlotAddress(temp_argv, x0);
-    //  - Adjust for the receiver.
-    __ Sub(temp_argv, temp_argv, 1 * kSystemPointerSize);
+    // Derive argv from the stack pointer so that it points to the first
+    // argument.
+    __ SlotAddress(argv_input, argc_input);
+    __ Sub(argv_input, argv_input, kReceiverOnStackSize);
   }
 
-  // Reserve three slots to preserve x21-x23 callee-saved registers.
-  int extra_stack_space = 3;
+  // If ArgvMode::kStack, argc is reused below and must be retained across the
+  // call in a callee-saved register.
+  static constexpr Register argc = x22;
+
   // Enter the exit frame.
+  const int kNoExtraSpace = 0;
   FrameScope scope(masm, StackFrame::MANUAL);
   __ EnterExitFrame(
-      x10, extra_stack_space,
+      x10, kNoExtraSpace,
       builtin_exit_frame ? StackFrame::BUILTIN_EXIT : StackFrame::EXIT);
 
-  // Poke callee-saved registers into reserved space.
-  __ Poke(argv, 1 * kSystemPointerSize);
-  __ Poke(argc, 2 * kSystemPointerSize);
-  __ Poke(target, 3 * kSystemPointerSize);
+  if (argv_mode == ArgvMode::kStack) {
+    __ Mov(argc, argc_input);
+  }
 
-  // We normally only keep tagged values in callee-saved registers, as they
-  // could be pushed onto the stack by called stubs and functions, and on the
-  // stack they can confuse the GC. However, we're only calling C functions
-  // which can push arbitrary data onto the stack anyway, and so the GC won't
-  // examine that part of the stack.
-  __ Mov(argc, argc_input);
-  __ Mov(target, target_input);
-  __ Mov(argv, temp_argv);
+#if V8_ENABLE_WEBASSEMBLY
+  if (switch_to_central_stack) {
+    SwitchToTheCentralStackIfNeeded(masm, argc_input, target_input, argv_input);
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
 
   // x21 : argv
   // x22 : argc
@@ -4852,24 +4463,22 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
   //         fp[-8]:   Space reserved for SPOffset.
   //         fp[-16]:  CodeObject()
   //         sp[...]:  Saved doubles, if saved_doubles is true.
-  //         sp[32]:   Alignment padding, if necessary.
-  //         sp[24]:   Preserved x23 (used for target).
-  //         sp[16]:   Preserved x22 (used for argc).
-  //         sp[8]:    Preserved x21 (used for argv).
+  //         sp[16]:   Alignment padding, if necessary.
+  //         sp[8]:   Preserved x22 (used for argc).
   //   sp -> sp[0]:    Space reserved for the return address.
-  //
-  // After a successful call, the exit frame, preserved registers (x21-x23) and
-  // the arguments (including the receiver) are dropped or popped as
-  // appropriate. The stub then returns.
-  //
-  // After an unsuccessful call, the exit frame and suchlike are left
-  // untouched, and the stub either throws an exception by jumping to one of
-  // the exception_returned label.
+
+  // TODO(jgruber): Swap these registers in the calling convention instead.
+  static_assert(target_input == x1);
+  static_assert(argv_input == x11);
+  __ Swap(target_input, argv_input);
+  static constexpr Register target = x11;
+  static constexpr Register argv = x1;
+  static_assert(!AreAliased(argc_input, argc, target, argv));
 
   // Prepare AAPCS64 arguments to pass to the builtin.
-  __ Mov(x0, argc);
-  __ Mov(x1, argv);
-  __ Mov(x2, ExternalReference::isolate_address(masm->isolate()));
+  static_assert(argc_input == x0);  // Already in the right spot.
+  static_assert(argv == x1);        // Already in the right spot.
+  __ Mov(x2, ER::isolate_address(masm->isolate()));
 
   __ StoreReturnAddressAndCall(target);
 
@@ -4877,69 +4486,59 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
 
   //  x0    result0      The return code from the call.
   //  x1    result1      For calls which return ObjectPair.
-  //  x21   argv
-  //  x22   argc
-  //  x23   target
+  //  x22   argc         .. only if ArgvMode::kStack.
   const Register& result = x0;
 
+#if V8_ENABLE_WEBASSEMBLY
+  if (switch_to_central_stack) {
+    SwitchFromTheCentralStackIfNeeded(masm);
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
+
   // Check result for exception sentinel.
   Label exception_returned;
   __ CompareRoot(result, RootIndex::kException);
   __ B(eq, &exception_returned);
 
   // The call succeeded, so unwind the stack and return.
-
-  // Restore callee-saved registers x21-x23.
-  __ Mov(x11, argc);
-
-  __ Peek(argv, 1 * kSystemPointerSize);
-  __ Peek(argc, 2 * kSystemPointerSize);
-  __ Peek(target, 3 * kSystemPointerSize);
-
-  __ LeaveExitFrame(x10, x9);
   if (argv_mode == ArgvMode::kStack) {
-    // Drop the remaining stack slots and return from the stub.
+    __ Mov(x11, argc);  // x11 used as scratch, just til DropArguments below.
+    __ LeaveExitFrame(x10, x9);
     __ DropArguments(x11);
+  } else {
+    __ LeaveExitFrame(x10, x9);
   }
+
   __ AssertFPCRState();
   __ Ret();
 
   // Handling of exception.
   __ Bind(&exception_returned);
 
-  ExternalReference pending_handler_context_address = ExternalReference::Create(
-      IsolateAddressId::kPendingHandlerContextAddress, masm->isolate());
-  ExternalReference pending_handler_entrypoint_address =
-      ExternalReference::Create(
-          IsolateAddressId::kPendingHandlerEntrypointAddress, masm->isolate());
-  ExternalReference pending_handler_fp_address = ExternalReference::Create(
-      IsolateAddressId::kPendingHandlerFPAddress, masm->isolate());
-  ExternalReference pending_handler_sp_address = ExternalReference::Create(
-      IsolateAddressId::kPendingHandlerSPAddress, masm->isolate());
-
   // Ask the runtime for help to determine the handler. This will set x0 to
   // contain the current pending exception, don't clobber it.
-  ExternalReference find_handler =
-      ExternalReference::Create(Runtime::kUnwindAndFindExceptionHandler);
   {
     FrameScope scope(masm, StackFrame::MANUAL);
     __ Mov(x0, 0);  // argc.
     __ Mov(x1, 0);  // argv.
-    __ Mov(x2, ExternalReference::isolate_address(masm->isolate()));
-    __ CallCFunction(find_handler, 3);
+    __ Mov(x2, ER::isolate_address(masm->isolate()));
+    __ CallCFunction(ER::Create(Runtime::kUnwindAndFindExceptionHandler), 3);
   }
 
   // Retrieve the handler context, SP and FP.
-  __ Mov(cp, pending_handler_context_address);
+  __ Mov(cp, ER::Create(IsolateAddressId::kPendingHandlerContextAddress,
+                        masm->isolate()));
   __ Ldr(cp, MemOperand(cp));
   {
     UseScratchRegisterScope temps(masm);
     Register scratch = temps.AcquireX();
-    __ Mov(scratch, pending_handler_sp_address);
+    __ Mov(scratch, ER::Create(IsolateAddressId::kPendingHandlerSPAddress,
+                               masm->isolate()));
     __ Ldr(scratch, MemOperand(scratch));
     __ Mov(sp, scratch);
   }
-  __ Mov(fp, pending_handler_fp_address);
+  __ Mov(fp, ER::Create(IsolateAddressId::kPendingHandlerFPAddress,
+                        masm->isolate()));
   __ Ldr(fp, MemOperand(fp));
 
   // If the handler is a JS frame, restore the context to the frame. Note that
@@ -4953,8 +4552,8 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
     // Clear c_entry_fp, like we do in `LeaveExitFrame`.
     UseScratchRegisterScope temps(masm);
     Register scratch = temps.AcquireX();
-    __ Mov(scratch, ExternalReference::Create(
-                        IsolateAddressId::kCEntryFPAddress, masm->isolate()));
+    __ Mov(scratch,
+           ER::Create(IsolateAddressId::kCEntryFPAddress, masm->isolate()));
     __ Str(xzr, MemOperand(scratch));
   }
 
@@ -4964,7 +4563,8 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
   // a "BTI c".
   UseScratchRegisterScope temps(masm);
   temps.Exclude(x17);
-  __ Mov(x17, pending_handler_entrypoint_address);
+  __ Mov(x17, ER::Create(IsolateAddressId::kPendingHandlerEntrypointAddress,
+                         masm->isolate()));
   __ Ldr(x17, MemOperand(x17));
   __ Br(x17);
 }
@@ -5036,197 +4636,63 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ Ret();
 }
 
-namespace {
-
-// The number of register that CallApiFunctionAndReturn will need to save on
-// the stack. The space for these registers need to be allocated in the
-// ExitFrame before calling CallApiFunctionAndReturn.
-constexpr int kCallApiFunctionSpillSpace = 4;
-
-int AddressOffset(ExternalReference ref0, ExternalReference ref1) {
-  return static_cast<int>(ref0.address() - ref1.address());
-}
-
-// Calls an API function. Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.
-// 'stack_space' is the space to be unwound on exit (includes the call JS
-// arguments space and the additional space allocated for the fast call).
-// 'spill_offset' is the offset from the stack pointer where
-// CallApiFunctionAndReturn can spill registers.
-void CallApiFunctionAndReturn(MacroAssembler* masm, Register function_address,
-                              ExternalReference thunk_ref, int stack_space,
-                              MemOperand* stack_space_operand, int spill_offset,
-                              MemOperand return_value_operand) {
-  ASM_CODE_COMMENT(masm);
-  ASM_LOCATION("CallApiFunctionAndReturn");
-  Isolate* isolate = masm->isolate();
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  const int kNextOffset = 0;
-  const int kLimitOffset = AddressOffset(
-      ExternalReference::handle_scope_limit_address(isolate), next_address);
-  const int kLevelOffset = AddressOffset(
-      ExternalReference::handle_scope_level_address(isolate), next_address);
-
-  DCHECK(function_address == x1 || function_address == x2);
-
-  // Save the callee-save registers we are going to use.
-  // TODO(all): Is this necessary? ARM doesn't do it.
-  static_assert(kCallApiFunctionSpillSpace == 4);
-  __ Poke(x19, (spill_offset + 0) * kXRegSize);
-  __ Poke(x20, (spill_offset + 1) * kXRegSize);
-  __ Poke(x21, (spill_offset + 2) * kXRegSize);
-  __ Poke(x22, (spill_offset + 3) * kXRegSize);
-
-  // Allocate HandleScope in callee-save registers.
-  // We will need to restore the HandleScope after the call to the API function,
-  // by allocating it in callee-save registers they will be preserved by C code.
-  Register handle_scope_base = x22;
-  Register next_address_reg = x19;
-  Register limit_reg = x20;
-  Register level_reg = w21;
-
-  __ Mov(handle_scope_base, next_address);
-  __ Ldr(next_address_reg, MemOperand(handle_scope_base, kNextOffset));
-  __ Ldr(limit_reg, MemOperand(handle_scope_base, kLimitOffset));
-  __ Ldr(level_reg, MemOperand(handle_scope_base, kLevelOffset));
-  __ Add(level_reg, level_reg, 1);
-  __ Str(level_reg, MemOperand(handle_scope_base, kLevelOffset));
-
-  Label profiler_enabled, done_api_call;
-  __ Ldrb(w10, __ ExternalReferenceAsOperand(
-                   ExternalReference::is_profiling_address(isolate), x10));
-  __ Cbnz(w10, &profiler_enabled);
-#ifdef V8_RUNTIME_CALL_STATS
-  __ Mov(x10, ExternalReference::address_of_runtime_stats_flag());
-  __ Ldrsw(w10, MemOperand(x10));
-  __ Cbnz(w10, &profiler_enabled);
-#endif  // V8_RUNTIME_CALL_STATS
-
-  // Call the api function directly.
-  __ Mov(x10, function_address);
-  __ StoreReturnAddressAndCall(x10);
-  __ Bind(&done_api_call);
-
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-  Label return_value_loaded;
-
-  // Load value from ReturnValue.
-  __ Ldr(x0, return_value_operand);
-  __ Bind(&return_value_loaded);
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ Str(next_address_reg, MemOperand(handle_scope_base, kNextOffset));
-  if (v8_flags.debug_code) {
-    __ Ldr(w1, MemOperand(handle_scope_base, kLevelOffset));
-    __ Cmp(w1, level_reg);
-    __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall);
-  }
-  __ Sub(level_reg, level_reg, 1);
-  __ Str(level_reg, MemOperand(handle_scope_base, kLevelOffset));
-  __ Ldr(x1, MemOperand(handle_scope_base, kLimitOffset));
-  __ Cmp(limit_reg, x1);
-  __ B(ne, &delete_allocated_handles);
-
-  // Leave the API exit frame.
-  __ Bind(&leave_exit_frame);
-  // Restore callee-saved registers.
-  __ Peek(x19, (spill_offset + 0) * kXRegSize);
-  __ Peek(x20, (spill_offset + 1) * kXRegSize);
-  __ Peek(x21, (spill_offset + 2) * kXRegSize);
-  __ Peek(x22, (spill_offset + 3) * kXRegSize);
-
-  if (stack_space_operand != nullptr) {
-    DCHECK_EQ(stack_space, 0);
-    // Load the number of stack slots to drop before LeaveExitFrame modifies sp.
-    __ Ldr(x19, *stack_space_operand);
-  }
-
-  __ LeaveExitFrame(x1, x5);
-
-  // Check if the function scheduled an exception.
-  __ Mov(x5, ExternalReference::scheduled_exception_address(isolate));
-  __ Ldr(x5, MemOperand(x5));
-  __ JumpIfNotRoot(x5, RootIndex::kTheHoleValue, &promote_scheduled_exception);
-
-  if (stack_space_operand == nullptr) {
-    DCHECK_NE(stack_space, 0);
-    __ DropSlots(stack_space);
-  } else {
-    DCHECK_EQ(stack_space, 0);
-    __ DropArguments(x19);
-  }
-
-  __ Ret();
-
-  // Call the api function via thunk wrapper.
-  __ Bind(&profiler_enabled);
-  // Additional parameter is the address of the actual callback.
-  __ Mov(x3, function_address);
-  __ Mov(x10, thunk_ref);
-  __ StoreReturnAddressAndCall(x10);
-  __ B(&done_api_call);
-
-  // Re-throw by promoting a scheduled exception.
-  __ Bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  __ Bind(&delete_allocated_handles);
-  __ Str(limit_reg, MemOperand(handle_scope_base, kLimitOffset));
-  // Save the return value in a callee-save register.
-  Register saved_result = x19;
-  __ Mov(saved_result, x0);
-  __ Mov(x0, ExternalReference::isolate_address(isolate));
-  __ CallCFunction(ExternalReference::delete_handle_scope_extensions(), 1);
-  __ Mov(x0, saved_result);
-  __ B(&leave_exit_frame);
-}
-
-MemOperand ExitFrameStackSlotOperand(int offset) {
-  static constexpr int kFrameOffset = 1 * kSystemPointerSize;
-  return MemOperand(sp, kFrameOffset + offset);
-}
-
-MemOperand ExitFrameCallerStackSlotOperand(int index) {
-  return MemOperand(
-      fp, (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
-              kSystemPointerSize);
-}
-
-}  // namespace
-
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- cp                  : context
+  // CallApiCallbackMode::kGeneric mode:
+  //  -- x2                  : arguments count (not including the receiver)
+  //  -- x3                  : call handler info
+  //  -- x0                  : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
   //  -- x1                  : api function address
   //  -- x2                  : arguments count (not including the receiver)
   //  -- x3                  : call data
   //  -- x0                  : holder
+  // Both modes:
+  //  -- cp                  : context
   //  -- sp[0]               : receiver
   //  -- sp[8]               : first argument
   //  -- ...
   //  -- sp[(argc) * 8]      : last argument
   // -----------------------------------
 
-  Register api_function_address = x1;
-  Register argc = x2;
-  Register call_data = x3;
-  Register holder = x0;
+  Register function_callback_info_arg = arg_reg_1;
+
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register callback = no_reg;
+  Register holder = no_reg;
   Register scratch = x4;
+  Register scratch2 = x5;
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = x1;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
 
-  DCHECK(!AreAliased(api_function_address, argc, call_data, holder, scratch));
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, holder, call_data, callback,
+                     scratch, scratch2));
 
-  using FCI = FunctionCallbackInfo<v8::Value>;
   using FCA = FunctionCallbackArguments;
 
   static_assert(FCA::kArgsLength == 6);
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
@@ -5234,7 +4700,7 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   // Target state:
   //   sp[0 * kSystemPointerSize]: kHolder   <= FCA::implicit_args_
   //   sp[1 * kSystemPointerSize]: kIsolate
-  //   sp[2 * kSystemPointerSize]: undefined (kReturnValueDefaultValue)
+  //   sp[2 * kSystemPointerSize]: undefined (padding, unused)
   //   sp[3 * kSystemPointerSize]: undefined (kReturnValue)
   //   sp[4 * kSystemPointerSize]: kData
   //   sp[5 * kSystemPointerSize]: undefined (kNewTarget)
@@ -5242,56 +4708,113 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   //   sp[6 * kSystemPointerSize]:            <= FCA:::values_
 
   // Reserve space on the stack.
-  __ Claim(FCA::kArgsLength, kSystemPointerSize);
+  static constexpr int kStackSize = FCA::kArgsLength;
+  static_assert(kStackSize % 2 == 0);
+  __ Claim(kStackSize, kSystemPointerSize);
 
-  // kHolder.
-  __ Str(holder, MemOperand(sp, 0 * kSystemPointerSize));
+  // kHolder
+  __ Str(holder, MemOperand(sp, FCA::kHolderIndex * kSystemPointerSize));
 
   // kIsolate.
   __ Mov(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ Str(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+  __ Str(scratch, MemOperand(sp, FCA::kIsolateIndex * kSystemPointerSize));
+
+  // kPadding
+  __ Str(xzr, MemOperand(sp, FCA::kUnusedIndex * kSystemPointerSize));
 
-  // kReturnValueDefaultValue and kReturnValue.
+  // kReturnValue
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ Str(scratch, MemOperand(sp, 2 * kSystemPointerSize));
-  __ Str(scratch, MemOperand(sp, 3 * kSystemPointerSize));
+  __ Str(scratch, MemOperand(sp, FCA::kReturnValueIndex * kSystemPointerSize));
 
   // kData.
-  __ Str(call_data, MemOperand(sp, 4 * kSystemPointerSize));
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ LoadTaggedField(
+          scratch2, FieldMemOperand(callback, CallHandlerInfo::kDataOffset));
+      __ Str(scratch2, MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ Str(call_data, MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+  }
 
   // kNewTarget.
-  __ Str(scratch, MemOperand(sp, 5 * kSystemPointerSize));
+  __ Str(scratch, MemOperand(sp, FCA::kNewTargetIndex * kSystemPointerSize));
 
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  __ Mov(scratch, sp);
+  __ Mov(holder, sp);
 
   // Allocate the v8::Arguments structure in the arguments' space, since it's
   // not controlled by GC.
-  static constexpr int kSlotsToDropSize = 1 * kSystemPointerSize;
+  static constexpr int kSlotsToDropOnStackSize = 1 * kSystemPointerSize;
   static constexpr int kApiStackSpace =
-      (FCI::kSize + kSlotsToDropSize) / kSystemPointerSize;
+      (FCA::kSize + kSlotsToDropOnStackSize) / kSystemPointerSize;
   static_assert(kApiStackSpace == 4);
-  static_assert(FCI::kImplicitArgsOffset == 0);
-  static_assert(FCI::kValuesOffset == 1 * kSystemPointerSize);
-  static_assert(FCI::kLengthOffset == 2 * kSystemPointerSize);
+  static_assert(FCA::kImplicitArgsOffset == 0);
+  static_assert(FCA::kValuesOffset == 1 * kSystemPointerSize);
+  static_assert(FCA::kLengthOffset == 2 * kSystemPointerSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
 
   FrameScope frame_scope(masm, StackFrame::MANUAL);
-  __ EnterExitFrame(x10, kApiStackSpace + kCallApiFunctionSpillSpace,
-                    StackFrame::EXIT);
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+    __ Claim(exit_frame_params_count, kSystemPointerSize);
+
+    // Context parameter and padding.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize ==
+                  kSystemPointerSize);
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingOffset ==
+                  5 * kSystemPointerSize);
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ Stp(kContextRegister, xzr, MemOperand(sp, 2 * kSystemPointerSize));
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ SmiTag(scratch, argc);
+    __ Str(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ LoadTaggedField(
+        scratch,
+        FieldMemOperand(callback, CallHandlerInfo::kOwnerTemplateOffset));
+    __ Str(scratch, MemOperand(sp, 0 * kSystemPointerSize));
 
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  // Arguments are after the return address(pushed by EnterExitFrame()).
-  __ Str(scratch, ExitFrameStackSlotOperand(FCI::kImplicitArgsOffset));
+    __ LoadExternalPointerField(
+        api_function_address,
+        FieldMemOperand(callback,
+                        CallHandlerInfo::kMaybeRedirectedCallbackOffset),
+        kCallHandlerInfoCallbackTag);
 
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  __ Add(scratch, scratch,
-         Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
-  __ Str(scratch, ExitFrameStackSlotOperand(FCI::kValuesOffset));
+    __ EnterExitFrame(scratch, kApiStackSpace, StackFrame::API_CALLBACK_EXIT);
+  } else {
+    __ EnterExitFrame(scratch, kApiStackSpace, StackFrame::EXIT);
+  }
 
-  // FunctionCallbackInfo::length_.
-  __ Str(argc, ExitFrameStackSlotOperand(FCI::kLengthOffset));
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    // Arguments are after the return address(pushed by EnterExitFrame()).
+    __ Str(holder, ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset));
+
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ Add(holder, holder,
+           Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
+    __ Str(holder, ExitFrameStackSlotOperand(FCA::kValuesOffset));
+
+    // FunctionCallbackInfo::length_.
+    __ Str(argc, ExitFrameStackSlotOperand(FCA::kLengthOffset));
+  }
 
   // We also store the number of slots to drop from the stack after returning
   // from the API function here.
@@ -5300,41 +4823,73 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   // a multiple of two, and related helper functions (DropArguments) expect a
   // register containing the slot count.
   MemOperand stack_space_operand =
-      ExitFrameStackSlotOperand(FCI::kLengthOffset + kSlotsToDropSize);
-  __ Add(scratch, argc, Operand(FCA::kArgsLengthWithReceiver));
+      ExitFrameStackSlotOperand(FCA::kLengthOffset + kSlotsToDropOnStackSize);
+  __ Add(scratch, argc,
+         Operand(FCA::kArgsLengthWithReceiver + exit_frame_params_count));
   __ Str(scratch, stack_space_operand);
 
-  // v8::InvocationCallback's argument.
-  DCHECK(!AreAliased(x0, api_function_address));
-  __ add(x0, sp, Operand(1 * kSystemPointerSize));
+  __ RecordComment("v8::FunctionCallback's argument.");
+  // function_callback_info_arg = v8::FunctionCallbackInfo&
+  __ add(function_callback_info_arg, sp, Operand(1 * kSystemPointerSize));
+
+  DCHECK(!AreAliased(api_function_address, function_callback_info_arg));
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
 
   // The current frame needs to be aligned.
   DCHECK_EQ(FCA::kArgsLength % 2, 0);
 
-  MemOperand return_value_operand =
-      ExitFrameCallerStackSlotOperand(FCA::kReturnValueIndex);
-  static constexpr int kSpillOffset = 1 + kApiStackSpace;
+  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
   static constexpr int kUseStackSpaceOperand = 0;
 
-  AllowExternalCallThatCantCauseGC scope(masm);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kUseStackSpaceOperand, &stack_space_operand,
-                           kSpillOffset, return_value_operand);
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseStackSpaceOperand,
+                           &stack_space_operand, return_value_operand);
 }
 
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- cp                  : context
+  //  -- x1                  : receiver
+  //  -- x3                  : accessor info
+  //  -- x0                  : holder
+  // -----------------------------------
+
+  // Build v8::PropertyCallbackInfo::args_ array on the stack and push property
+  // name below the exit frame to make GC aware of them.
+  using PCI = PropertyCallbackInfo<v8::Value>;
   using PCA = PropertyCallbackArguments;
   static_assert(PCA::kShouldThrowOnErrorIndex == 0);
   static_assert(PCA::kHolderIndex == 1);
   static_assert(PCA::kIsolateIndex == 2);
-  static_assert(PCA::kReturnValueDefaultValueIndex == 3);
+  static_assert(PCA::kUnusedIndex == 3);
   static_assert(PCA::kReturnValueIndex == 4);
   static_assert(PCA::kDataIndex == 5);
   static_assert(PCA::kThisIndex == 6);
   static_assert(PCA::kArgsLength == 7);
 
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  // Target state:
+  //   sp[0 * kSystemPointerSize]: name
+  //   sp[1 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   sp[2 * kSystemPointerSize]: kHolderIndex
+  //   sp[3 * kSystemPointerSize]: kIsolateIndex
+  //   sp[4 * kSystemPointerSize]: kUnusedIndex
+  //   sp[5 * kSystemPointerSize]: kReturnValueIndex
+  //   sp[6 * kSystemPointerSize]: kDataIndex
+  //   sp[7 * kSystemPointerSize]: kThisIndex / receiver
+
+  Register name_arg = arg_reg_1;
+  Register property_callback_info_arg = arg_reg_2;
+
+  Register api_function_address = x2;
   Register receiver = ApiGetterDescriptor::ReceiverRegister();
   Register holder = ApiGetterDescriptor::HolderRegister();
   Register callback = ApiGetterDescriptor::CallbackRegister();
@@ -5352,51 +4907,68 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
   __ LoadTaggedField(name,
                      FieldMemOperand(callback, AccessorInfo::kNameOffset));
 
-  // PropertyCallbackArguments:
-  //   receiver, data, return value, return value default, isolate, holder,
-  //   should_throw_on_error
-  // These are followed by the property name, which is also pushed below the
-  // exit frame to make the GC aware of it.
-  __ Push(receiver, data, undef, undef, isolate_address, holder, xzr, name);
+  // - PropertyCallbackArguments:
+  //     receiver, data, return value, isolate, holder, should_throw_on_error
+  // - These are followed by the property name, which is also pushed below the
+  //   exit frame to make the GC aware of it.
+  // - Padding
+  Register should_throw_on_error = xzr;
+  Register padding = xzr;
+  __ Push(receiver, data, undef, padding, isolate_address, holder,
+          should_throw_on_error, name);
 
   // v8::PropertyCallbackInfo::args_ array and name handle.
-  static constexpr int kNameHandleStackSize = 1;
-  static const int kStackUnwindSpace = PCA::kArgsLength + kNameHandleStackSize;
+  static constexpr int kPaddingOnStackSlots = 0;
+  static constexpr int kNameOnStackSlots = 1;
+  static constexpr int kNameStackIndex = kPaddingOnStackSlots;
+  static constexpr int kPCAStackIndex =
+      kNameOnStackSlots + kPaddingOnStackSlots;
+  static constexpr int kStackUnwindSpace = PCA::kArgsLength + kPCAStackIndex;
   static_assert(kStackUnwindSpace % 2 == 0,
                 "slots must be a multiple of 2 for stack pointer alignment");
 
-  // Load address of v8::PropertyAccessorInfo::args_ array and name handle.
-  __ Mov(x0, sp);                          // x0 = Handle<Name>
-  __ Add(x1, x0, 1 * kSystemPointerSize);  // x1 = v8::PCI::args_
+  __ RecordComment(
+      "Load address of v8::PropertyAccessorInfo::args_ array and name handle.");
+  // name_arg = Handle<Name>(&name), name value was pushed to GC-ed stack space.
+  __ Add(name_arg, sp, Operand(kNameStackIndex * kSystemPointerSize));
+  // property_callback_info_arg = v8::PCI::args_ (= &ShouldThrow)
+  __ Add(property_callback_info_arg, sp,
+         Operand(kPCAStackIndex * kSystemPointerSize));
 
   const int kApiStackSpace = 1;
+  static_assert(kApiStackSpace * kSystemPointerSize == sizeof(PCI));
 
   FrameScope frame_scope(masm, StackFrame::MANUAL);
-  __ EnterExitFrame(x10, kApiStackSpace + kCallApiFunctionSpillSpace,
-                    StackFrame::EXIT);
+  __ EnterExitFrame(x10, kApiStackSpace, StackFrame::EXIT);
 
-  // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // it's args_ field.
-  __ Poke(x1, 1 * kSystemPointerSize);
-  __ SlotAddress(x1, 1);
-  // x1 = v8::PropertyCallbackInfo&
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
+  // Initialize v8::PropertyCallbackInfo::args_ field.
+  __ Poke(property_callback_info_arg, 1 * kSystemPointerSize);
+  // property_callback_info_arg = v8::PropertyCallbackInfo&
+  __ SlotAddress(property_callback_info_arg, 1);
 
-  Register api_function_address = x2;
   __ LoadExternalPointerField(
       api_function_address,
       FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset),
       kAccessorInfoGetterTag);
 
+  DCHECK(
+      !AreAliased(api_function_address, property_callback_info_arg, name_arg));
+
   ExternalReference thunk_ref =
       ExternalReference::invoke_accessor_getter_callback();
-  static constexpr int kSpillOffset = 1 + kApiStackSpace;
-  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
-      PCA::kReturnValueIndex + kNameHandleStackSize);
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
+
+  MemOperand return_value_operand =
+      ExitFrameCallerStackSlotOperand(kPCAStackIndex + PCA::kReturnValueIndex);
   MemOperand* const kUseStackSpaceConstant = nullptr;
 
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           kSpillOffset, return_value_operand);
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
@@ -5722,6 +5294,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+
+  if (is_osr) {
+    ResetSharedFunctionInfoAge(masm, code_obj);
+  }
+
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(code_obj, SharedFunctionInfo::kFunctionDataOffset));
@@ -5755,8 +5332,9 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register feedback_vector = x2;
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -5807,21 +5385,17 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   // Save the accumulator register, since it's clobbered by the below call.
   __ Push(padreg, kInterpreterAccumulatorRegister);
   {
-    Register arg_reg_1 = x0;
-    Register arg_reg_2 = x1;
-    Register arg_reg_3 = x2;
     __ Mov(arg_reg_1, code_obj);
     __ Mov(arg_reg_2, kInterpreterBytecodeOffsetRegister);
     __ Mov(arg_reg_3, kInterpreterBytecodeArrayRegister);
     FrameScope scope(masm, StackFrame::INTERNAL);
     __ CallCFunction(get_baseline_pc, 3, 0);
   }
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ Add(code_obj, code_obj, kReturnRegister0);
   __ Pop(kInterpreterAccumulatorRegister, padreg);
 
   if (is_osr) {
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
     Generate_OSREntry(masm, code_obj);
   } else {
     __ Jump(code_obj);
diff --git a/deps/v8/src/builtins/array-concat.tq b/deps/v8/src/builtins/array-concat.tq
index 6fad3e66833c8d..8c736eb82d5377 100644
--- a/deps/v8/src/builtins/array-concat.tq
+++ b/deps/v8/src/builtins/array-concat.tq
@@ -6,8 +6,7 @@ namespace array {
 
 extern builtin ArrayConcat(Context, JSFunction, JSAny, int32): JSAny;
 
-transitioning javascript builtin
-ArrayPrototypeConcat(
+transitioning javascript builtin ArrayPrototypeConcat(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // Fast path if we invoke as `x.concat()`.
   if (arguments.length == 0) {
diff --git a/deps/v8/src/builtins/array-every.tq b/deps/v8/src/builtins/array-every.tq
index 2514a18b747ab6..ad3c486c6cd7fc 100644
--- a/deps/v8/src/builtins/array-every.tq
+++ b/deps/v8/src/builtins/array-every.tq
@@ -3,10 +3,9 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning javascript builtin
-ArrayEveryLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
+transitioning javascript builtin ArrayEveryLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
   // All continuation points in the optimized every implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -24,11 +23,9 @@ ArrayEveryLoopEagerDeoptContinuation(
       numberLength, Undefined);
 }
 
-transitioning javascript builtin
-ArrayEveryLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny,
-    result: JSAny): JSAny {
+transitioning javascript builtin ArrayEveryLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny, result: JSAny): JSAny {
   // All continuation points in the optimized every implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -51,9 +48,10 @@ ArrayEveryLoopLazyDeoptContinuation(
       numberLength, Undefined);
 }
 
-transitioning builtin ArrayEveryLoopContinuation(implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable, thisArg: JSAny, _array: JSAny,
-    o: JSReceiver, initialK: Number, length: Number, _initialTo: JSAny): JSAny {
+transitioning builtin ArrayEveryLoopContinuation(
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
+    thisArg: JSAny, _array: JSAny, o: JSReceiver, initialK: Number,
+    length: Number, _initialTo: JSAny): JSAny {
   // 5. Let k be 0.
   // 6. Repeat, while k < len
   for (let k: Number = initialK; k < length; k++) {
@@ -83,8 +81,9 @@ transitioning builtin ArrayEveryLoopContinuation(implicit context: Context)(
   return True;
 }
 
-transitioning macro FastArrayEvery(implicit context: Context)(
-    o: JSReceiver, len: Number, callbackfn: Callable, thisArg: JSAny): JSAny
+transitioning macro FastArrayEvery(
+    implicit context: Context)(o: JSReceiver, len: Number,
+    callbackfn: Callable, thisArg: JSAny): JSAny
     labels Bailout(Smi) {
   let k: Smi = 0;
   const smiLen = Cast<Smi>(len) otherwise goto Bailout(k);
@@ -108,8 +107,7 @@ transitioning macro FastArrayEvery(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.every
-transitioning javascript builtin
-ArrayEvery(
+transitioning javascript builtin ArrayEvery(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.every');
@@ -138,7 +136,7 @@ ArrayEvery(
           o, callbackfn, thisArg, Undefined, o, kValue, len, Undefined);
     }
   } label TypeError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-filter.tq b/deps/v8/src/builtins/array-filter.tq
index bd892a2e76cb44..7c983710c9a250 100644
--- a/deps/v8/src/builtins/array-filter.tq
+++ b/deps/v8/src/builtins/array-filter.tq
@@ -3,11 +3,10 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning javascript builtin
-ArrayFilterLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, array: JSAny, initialK: JSAny,
-    length: JSAny, initialTo: JSAny): JSAny {
+transitioning javascript builtin ArrayFilterLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, array: JSAny, initialK: JSAny, length: JSAny,
+    initialTo: JSAny): JSAny {
   // All continuation points in the optimized filter implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -27,11 +26,10 @@ ArrayFilterLoopEagerDeoptContinuation(
       numberLength, numberTo);
 }
 
-transitioning javascript builtin
-ArrayFilterLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, array: JSAny, initialK: JSAny,
-    length: JSAny, valueK: JSAny, initialTo: JSAny, result: JSAny): JSAny {
+transitioning javascript builtin ArrayFilterLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, array: JSAny, initialK: JSAny, length: JSAny, valueK: JSAny,
+    initialTo: JSAny, result: JSAny): JSAny {
   // All continuation points in the optimized filter implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -58,10 +56,10 @@ ArrayFilterLoopLazyDeoptContinuation(
       numberLength, numberTo);
 }
 
-transitioning builtin ArrayFilterLoopContinuation(implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable, thisArg: JSAny,
-    array: JSReceiver, o: JSReceiver, initialK: Number, length: Number,
-    initialTo: Number): JSAny {
+transitioning builtin ArrayFilterLoopContinuation(
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
+    thisArg: JSAny, array: JSReceiver, o: JSReceiver, initialK: Number,
+    length: Number, initialTo: Number): JSAny {
   let to: Number = initialTo;
   // 5. Let k be 0.
   // 6. Repeat, while k < len
@@ -95,9 +93,9 @@ transitioning builtin ArrayFilterLoopContinuation(implicit context: Context)(
   return array;
 }
 
-transitioning macro FastArrayFilter(implicit context: Context)(
-    fastO: FastJSArray, len: Smi, callbackfn: Callable, thisArg: JSAny,
-    output: FastJSArray): void labels
+transitioning macro FastArrayFilter(
+    implicit context: Context)(fastO: FastJSArray, len: Smi,
+    callbackfn: Callable, thisArg: JSAny, output: FastJSArray): void labels
 Bailout(Number, Number) {
   let k: Smi = 0;
   let to: Smi = 0;
@@ -134,8 +132,8 @@ Bailout(Number, Number) {
 // This method creates a 0-length array with the ElementsKind of the
 // receiver if possible, otherwise, bails out. It makes sense for the
 // caller to know that the slow case needs to be invoked.
-macro FastFilterSpeciesCreate(implicit context: Context)(receiver: JSReceiver):
-    JSReceiver labels Slow {
+macro FastFilterSpeciesCreate(
+    implicit context: Context)(receiver: JSReceiver): JSReceiver labels Slow {
   const len: Smi = 0;
   if (IsArraySpeciesProtectorCellInvalid()) goto Slow;
   const o = Cast<FastJSArray>(receiver) otherwise Slow;
@@ -145,8 +143,7 @@ macro FastFilterSpeciesCreate(implicit context: Context)(receiver: JSReceiver):
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.filter
-transitioning javascript builtin
-ArrayFilter(
+transitioning javascript builtin ArrayFilter(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.filter');
@@ -193,7 +190,7 @@ ArrayFilter(
     return ArrayFilterLoopContinuation(
         o, callbackfn, thisArg, output, o, k, len, to);
   } label TypeError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-find.tq b/deps/v8/src/builtins/array-find.tq
index 9b53f9c7000673..784c8f255a4f13 100644
--- a/deps/v8/src/builtins/array-find.tq
+++ b/deps/v8/src/builtins/array-find.tq
@@ -3,10 +3,9 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning javascript builtin
-ArrayFindLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
+transitioning javascript builtin ArrayFindLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
   // All continuation points in the optimized find implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -23,11 +22,9 @@ ArrayFindLoopEagerDeoptContinuation(
       jsreceiver, callbackfn, thisArg, jsreceiver, numberK, numberLength);
 }
 
-transitioning javascript builtin
-ArrayFindLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    _callback: JSAny, _thisArg: JSAny, _initialK: JSAny, _length: JSAny,
-    _result: JSAny): JSAny {
+transitioning javascript builtin ArrayFindLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(_callback: JSAny,
+    _thisArg: JSAny, _initialK: JSAny, _length: JSAny, _result: JSAny): JSAny {
   // This deopt continuation point is never actually called, it just
   // exists to make stack traces correct from a ThrowTypeError if the
   // callback was found to be non-callable.
@@ -39,9 +36,9 @@ ArrayFindLoopLazyDeoptContinuation(
 // before iteration continues.
 transitioning javascript builtin
 ArrayFindLoopAfterCallbackLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny,
-    foundValue: JSAny, isFound: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny, foundValue: JSAny,
+    isFound: JSAny): JSAny {
   // All continuation points in the optimized find implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -63,9 +60,9 @@ ArrayFindLoopAfterCallbackLazyDeoptContinuation(
       jsreceiver, callbackfn, thisArg, jsreceiver, numberK, numberLength);
 }
 
-transitioning builtin ArrayFindLoopContinuation(implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable, thisArg: JSAny, o: JSReceiver,
-    initialK: Number, length: Number): JSAny {
+transitioning builtin ArrayFindLoopContinuation(
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
+    thisArg: JSAny, o: JSReceiver, initialK: Number, length: Number): JSAny {
   // 5. Let k be 0.
   // 6. Repeat, while k < len
   for (let k: Number = initialK; k < length; k++) {
@@ -90,8 +87,9 @@ transitioning builtin ArrayFindLoopContinuation(implicit context: Context)(
   return Undefined;
 }
 
-transitioning macro FastArrayFind(implicit context: Context)(
-    o: JSReceiver, len: Number, callbackfn: Callable, thisArg: JSAny): JSAny
+transitioning macro FastArrayFind(
+    implicit context: Context)(o: JSReceiver, len: Number,
+    callbackfn: Callable, thisArg: JSAny): JSAny
     labels Bailout(Smi) {
   let k: Smi = 0;
   const smiLen = Cast<Smi>(len) otherwise goto Bailout(k);
@@ -116,8 +114,7 @@ transitioning macro FastArrayFind(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.find
-transitioning javascript builtin
-ArrayPrototypeFind(
+transitioning javascript builtin ArrayPrototypeFind(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.find');
@@ -145,7 +142,7 @@ ArrayPrototypeFind(
       return ArrayFindLoopContinuation(o, callbackfn, thisArg, o, k, len);
     }
   } label NotCallableError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-findindex.tq b/deps/v8/src/builtins/array-findindex.tq
index ed70a122594e42..6d0339b1eee6e6 100644
--- a/deps/v8/src/builtins/array-findindex.tq
+++ b/deps/v8/src/builtins/array-findindex.tq
@@ -3,10 +3,9 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning javascript builtin
-ArrayFindIndexLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
+transitioning javascript builtin ArrayFindIndexLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
   // All continuation points in the optimized findIndex implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -23,11 +22,9 @@ ArrayFindIndexLoopEagerDeoptContinuation(
       jsreceiver, callbackfn, thisArg, jsreceiver, numberK, numberLength);
 }
 
-transitioning javascript builtin
-ArrayFindIndexLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    _callback: JSAny, _thisArg: JSAny, _initialK: JSAny, _length: JSAny,
-    _result: JSAny): JSAny {
+transitioning javascript builtin ArrayFindIndexLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(_callback: JSAny,
+    _thisArg: JSAny, _initialK: JSAny, _length: JSAny, _result: JSAny): JSAny {
   // This deopt continuation point is never actually called, it just
   // exists to make stack traces correct from a ThrowTypeError if the
   // callback was found to be non-callable.
@@ -39,9 +36,9 @@ ArrayFindIndexLoopLazyDeoptContinuation(
 // before iteration continues.
 transitioning javascript builtin
 ArrayFindIndexLoopAfterCallbackLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny,
-    foundValue: JSAny, isFound: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny, foundValue: JSAny,
+    isFound: JSAny): JSAny {
   // All continuation points in the optimized findIndex implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -63,9 +60,9 @@ ArrayFindIndexLoopAfterCallbackLazyDeoptContinuation(
       jsreceiver, callbackfn, thisArg, jsreceiver, numberK, numberLength);
 }
 
-transitioning builtin ArrayFindIndexLoopContinuation(implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable, thisArg: JSAny, o: JSReceiver,
-    initialK: Number, length: Number): Number {
+transitioning builtin ArrayFindIndexLoopContinuation(
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
+    thisArg: JSAny, o: JSReceiver, initialK: Number, length: Number): Number {
   // 5. Let k be 0.
   // 6. Repeat, while k < len
   for (let k: Number = initialK; k < length; k++) {
@@ -90,8 +87,9 @@ transitioning builtin ArrayFindIndexLoopContinuation(implicit context: Context)(
   return Convert<Smi>(-1);
 }
 
-transitioning macro FastArrayFindIndex(implicit context: Context)(
-    o: JSReceiver, len: Number, callbackfn: Callable, thisArg: JSAny): Number
+transitioning macro FastArrayFindIndex(
+    implicit context: Context)(o: JSReceiver, len: Number,
+    callbackfn: Callable, thisArg: JSAny): Number
     labels Bailout(Smi) {
   let k: Smi = 0;
   const smiLen = Cast<Smi>(len) otherwise goto Bailout(k);
@@ -116,8 +114,7 @@ transitioning macro FastArrayFindIndex(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.findIndex
-transitioning javascript builtin
-ArrayPrototypeFindIndex(
+transitioning javascript builtin ArrayPrototypeFindIndex(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.findIndex');
@@ -145,7 +142,7 @@ ArrayPrototypeFindIndex(
       return ArrayFindIndexLoopContinuation(o, callbackfn, thisArg, o, k, len);
     }
   } label NotCallableError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-findlast.tq b/deps/v8/src/builtins/array-findlast.tq
index a359ec915f90b7..225c4384f73445 100644
--- a/deps/v8/src/builtins/array-findlast.tq
+++ b/deps/v8/src/builtins/array-findlast.tq
@@ -4,9 +4,9 @@
 
 namespace array {
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-array.prototype.findlast
-transitioning builtin ArrayFindLastLoopContinuation(implicit context: Context)(
-    predicate: Callable, thisArg: JSAny, o: JSReceiver,
-    initialK: Number): JSAny {
+transitioning builtin ArrayFindLastLoopContinuation(
+    implicit context: Context)(predicate: Callable, thisArg: JSAny,
+    o: JSReceiver, initialK: Number): JSAny {
   // 5. Repeat, while k >= 0
   for (let k: Number = initialK; k >= 0; k--) {
     // 5a. Let Pk be ! ToString(𝔽(k)).
@@ -33,8 +33,9 @@ transitioning builtin ArrayFindLastLoopContinuation(implicit context: Context)(
 }
 
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-array.prototype.findlast
-transitioning macro FastArrayFindLast(implicit context: Context)(
-    o: JSReceiver, len: Number, predicate: Callable, thisArg: JSAny): JSAny
+transitioning macro FastArrayFindLast(
+    implicit context: Context)(o: JSReceiver, len: Number, predicate: Callable,
+    thisArg: JSAny): JSAny
     labels Bailout(Number) {
   const smiLen = Cast<Smi>(len) otherwise goto Bailout(len - 1);
   // 4. Let k be len - 1.
@@ -73,8 +74,7 @@ transitioning macro FastArrayFindLast(implicit context: Context)(
 }
 
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-array.prototype.findlast
-transitioning javascript builtin
-ArrayPrototypeFindLast(
+transitioning javascript builtin ArrayPrototypeFindLast(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.findLast');
@@ -104,7 +104,7 @@ ArrayPrototypeFindLast(
       return ArrayFindLastLoopContinuation(predicate, thisArg, o, k);
     }
   } label NotCallableError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-findlastindex.tq b/deps/v8/src/builtins/array-findlastindex.tq
index 3b5498f9617eeb..33a32ba45d9b8f 100644
--- a/deps/v8/src/builtins/array-findlastindex.tq
+++ b/deps/v8/src/builtins/array-findlastindex.tq
@@ -5,9 +5,8 @@
 namespace array {
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-array.prototype.findlastindex
 transitioning builtin ArrayFindLastIndexLoopContinuation(
-    implicit context: Context)(
-    predicate: Callable, thisArg: JSAny, o: JSReceiver,
-    initialK: Number): Number {
+    implicit context: Context)(predicate: Callable, thisArg: JSAny,
+    o: JSReceiver, initialK: Number): Number {
   // 5. Repeat, while k >= 0
   for (let k: Number = initialK; k >= 0; k--) {
     // 5a. Let Pk be ! ToString(𝔽(k)).
@@ -34,8 +33,9 @@ transitioning builtin ArrayFindLastIndexLoopContinuation(
 }
 
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-array.prototype.findlastindex
-transitioning macro FastArrayFindLastIndex(implicit context: Context)(
-    o: JSReceiver, len: Number, predicate: Callable, thisArg: JSAny): Number
+transitioning macro FastArrayFindLastIndex(
+    implicit context: Context)(o: JSReceiver, len: Number, predicate: Callable,
+    thisArg: JSAny): Number
     labels Bailout(Number) {
   const smiLen = Cast<Smi>(len) otherwise goto Bailout(len - 1);
   // 4. Let k be len - 1.
@@ -74,8 +74,7 @@ transitioning macro FastArrayFindLastIndex(implicit context: Context)(
 }
 
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-array.prototype.findlastindex
-transitioning javascript builtin
-ArrayPrototypeFindLastIndex(
+transitioning javascript builtin ArrayPrototypeFindLastIndex(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.findLastIndex');
@@ -105,7 +104,7 @@ ArrayPrototypeFindLastIndex(
       return ArrayFindLastIndexLoopContinuation(predicate, thisArg, o, k);
     }
   } label NotCallableError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-foreach.tq b/deps/v8/src/builtins/array-foreach.tq
index 938210dcdc3c61..db5f881a466047 100644
--- a/deps/v8/src/builtins/array-foreach.tq
+++ b/deps/v8/src/builtins/array-foreach.tq
@@ -3,10 +3,9 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning javascript builtin
-ArrayForEachLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
+transitioning javascript builtin ArrayForEachLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
   // All continuation points in the optimized forEach implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -20,11 +19,9 @@ ArrayForEachLoopEagerDeoptContinuation(
       numberLength, Undefined);
 }
 
-transitioning javascript builtin
-ArrayForEachLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny,
-    _result: JSAny): JSAny {
+transitioning javascript builtin ArrayForEachLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny, _result: JSAny): JSAny {
   // All continuation points in the optimized forEach implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -38,9 +35,10 @@ ArrayForEachLoopLazyDeoptContinuation(
       numberLength, Undefined);
 }
 
-transitioning builtin ArrayForEachLoopContinuation(implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable, thisArg: JSAny, _array: JSAny,
-    o: JSReceiver, initialK: Number, len: Number, _to: JSAny): JSAny {
+transitioning builtin ArrayForEachLoopContinuation(
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
+    thisArg: JSAny, _array: JSAny, o: JSReceiver, initialK: Number, len: Number,
+    _to: JSAny): JSAny {
   // variables {array} and {to} are ignored.
 
   // 5. Let k be 0.
@@ -67,8 +65,9 @@ transitioning builtin ArrayForEachLoopContinuation(implicit context: Context)(
   return Undefined;
 }
 
-transitioning macro FastArrayForEach(implicit context: Context)(
-    o: JSReceiver, len: Number, callbackfn: Callable, thisArg: JSAny): JSAny
+transitioning macro FastArrayForEach(
+    implicit context: Context)(o: JSReceiver, len: Number,
+    callbackfn: Callable, thisArg: JSAny): JSAny
     labels Bailout(Smi) {
   let k: Smi = 0;
   const smiLen = Cast<Smi>(len) otherwise goto Bailout(k);
@@ -89,8 +88,7 @@ transitioning macro FastArrayForEach(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.foreach
-transitioning javascript builtin
-ArrayForEach(
+transitioning javascript builtin ArrayForEach(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.forEach');
@@ -122,7 +120,7 @@ ArrayForEach(
     return ArrayForEachLoopContinuation(
         o, callbackfn, thisArg, Undefined, o, k, len, Undefined);
   } label TypeError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-from.tq b/deps/v8/src/builtins/array-from.tq
index 103892d740074f..3722256ff7739c 100644
--- a/deps/v8/src/builtins/array-from.tq
+++ b/deps/v8/src/builtins/array-from.tq
@@ -5,9 +5,9 @@
 namespace array {
 // Array.from( items [, mapfn [, thisArg ] ] )
 // ES #sec-array.from
-transitioning javascript builtin
-ArrayFrom(js-implicit context: NativeContext, receiver: JSAny)(...arguments):
-    JSReceiver {
+transitioning javascript builtin ArrayFrom(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): JSReceiver {
   const c = HasBuiltinSubclassingFlag() ? receiver : GetArrayFunction();
 
   // Use fast path if:
@@ -35,7 +35,7 @@ ArrayFrom(js-implicit context: NativeContext, receiver: JSAny)(...arguments):
   } else {
     // a. If IsCallable(mapfn) is false, throw a TypeError exception.
     if (!Is<Callable>(mapfn)) deferred {
-        ThrowTypeError(MessageTemplate::kCalledNonCallable, mapfn);
+        ThrowCalledNonCallable(mapfn);
       }
     // b. Let mapping be true.
     mapping = true;
@@ -78,7 +78,7 @@ ArrayFrom(js-implicit context: NativeContext, receiver: JSAny)(...arguments):
       // done to true and a target array which somehow never ran out of
       // memory, e.g. a proxy that discarded the values. Ignoring this case
       // just means we would repeatedly call CreateDataProperty with index =
-      // 2^53
+      // 2^53.
       dcheck(k < kMaxSafeInteger);
 
       // ii. Let Pk be ! ToString(k).
@@ -149,8 +149,7 @@ ArrayFrom(js-implicit context: NativeContext, receiver: JSAny)(...arguments):
       const capacity: intptr = Convert<intptr>(len);
       const map: Map = GetFastPackedSmiElementsJSArrayMap();
       a = AllocateJSArray(
-          ElementsKind::PACKED_SMI_ELEMENTS, map, capacity, smiLen,
-          AllocationFlag::kAllowLargeObjectAllocation);
+          ElementsKind::PACKED_SMI_ELEMENTS, map, capacity, smiLen);
     } label CreateWithConstructor {
       typeswitch (c) {
         case (c: Constructor): {
diff --git a/deps/v8/src/builtins/array-isarray.tq b/deps/v8/src/builtins/array-isarray.tq
index a88c1579d1aa91..329e4ee99a2cd8 100644
--- a/deps/v8/src/builtins/array-isarray.tq
+++ b/deps/v8/src/builtins/array-isarray.tq
@@ -8,8 +8,8 @@ extern runtime ArrayIsArray(implicit context: Context)(JSAny): JSAny;
 
 namespace array {
 // ES #sec-array.isarray
-javascript builtin ArrayIsArray(js-implicit context: NativeContext)(arg: JSAny):
-    JSAny {
+javascript builtin ArrayIsArray(
+    js-implicit context: NativeContext)(arg: JSAny): JSAny {
   // 1. Return ? IsArray(arg).
   typeswitch (arg) {
     case (JSArray): {
diff --git a/deps/v8/src/builtins/array-join.tq b/deps/v8/src/builtins/array-join.tq
index 7fd9c07a1cd317..ee18210d5abd83 100644
--- a/deps/v8/src/builtins/array-join.tq
+++ b/deps/v8/src/builtins/array-join.tq
@@ -12,8 +12,8 @@ const kMaxArrayLength:
 // Fast C call to write a fixed array (see Buffer.fixedArray) to a single
 // string.
 extern macro
-ArrayBuiltinsAssembler::CallJSArrayArrayJoinConcatToSequentialString(
-    FixedArray, intptr, String, String): String;
+    ArrayBuiltinsAssembler::CallJSArrayArrayJoinConcatToSequentialString(
+        FixedArray, intptr, String, String): String;
 
 transitioning builtin LoadJoinElement<T : type extends ElementsKind>(
     context: Context, receiver: JSReceiver, k: uintptr): JSAny {
@@ -88,19 +88,19 @@ transitioning builtin ConvertToLocaleString(
 
     return ToString_Inline(result);
   } label TypeError {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, prop);
+    ThrowCalledNonCallable(prop);
   }
 }
 
 // Verifies the current element JSArray accessor can still be safely used
 // (see LoadJoinElement<ElementsAccessor>).
-macro CannotUseSameArrayAccessor<T: type>(implicit context: Context)(
-    loadFn: LoadJoinElementFn, receiver: JSReceiver, originalMap: Map,
-    originalLen: Number): bool;
+macro CannotUseSameArrayAccessor<T: type>(
+    implicit context: Context)(loadFn: LoadJoinElementFn, receiver: JSReceiver,
+    originalMap: Map, originalLen: Number): bool;
 
-CannotUseSameArrayAccessor<JSArray>(implicit context: Context)(
-    loadFn: LoadJoinElementFn, receiver: JSReceiver, originalMap: Map,
-    originalLen: Number): bool {
+CannotUseSameArrayAccessor<JSArray>(
+    implicit context: Context)(loadFn: LoadJoinElementFn, receiver: JSReceiver,
+    originalMap: Map, originalLen: Number): bool {
   if (loadFn == LoadJoinElement<array::GenericElementsAccessor>) return false;
 
   const array: JSArray = UnsafeCast<JSArray>(receiver);
@@ -110,9 +110,9 @@ CannotUseSameArrayAccessor<JSArray>(implicit context: Context)(
   return false;
 }
 
-CannotUseSameArrayAccessor<JSTypedArray>(implicit context: Context)(
-    _loadFn: LoadJoinElementFn, receiver: JSReceiver, _initialMap: Map,
-    _initialLen: Number): bool {
+CannotUseSameArrayAccessor<JSTypedArray>(
+    implicit context: Context)(_loadFn: LoadJoinElementFn,
+    receiver: JSReceiver, _initialMap: Map, _initialLen: Number): bool {
   const typedArray: JSTypedArray = UnsafeCast<JSTypedArray>(receiver);
   // When this is called from toLocaleString(), the underlying buffer might get
   // detached / resized (in the case of RAB / GSAB) during iterating the
@@ -132,8 +132,8 @@ CannotUseSameArrayAccessor<JSTypedArray>(implicit context: Context)(
 // Calculates the running total length of the resulting string.  If the
 // calculated length exceeds the maximum string length (see
 // String::kMaxLength), throws a range error.
-macro AddStringLength(implicit context: Context)(
-    lenA: intptr, lenB: intptr): intptr {
+macro AddStringLength(
+    implicit context: Context)(lenA: intptr, lenB: intptr): intptr {
   try {
     const length: intptr = TryIntPtrAdd(lenA, lenB) otherwise IfOverflow;
     if (length > kStringMaxLength) goto IfOverflow;
@@ -169,8 +169,9 @@ macro StoreAndGrowFixedArray<T: type>(
 // The buffer is maintained and updated by Buffer.constructor, Buffer.Add(),
 // Buffer.AddSeparators().
 struct Buffer {
-  macro Add(implicit context: Context)(
-      str: String, nofSeparators: intptr, separatorLength: intptr): void {
+  macro Add(
+      implicit context: Context)(str: String, nofSeparators: intptr,
+      separatorLength: intptr): void {
     // Add separators if necessary (at the beginning or more than one)
     const writeSeparators: bool = this.index == 0 | nofSeparators > 1;
     this.AddSeparators(nofSeparators, separatorLength, writeSeparators);
@@ -190,8 +191,9 @@ struct Buffer {
         IsOneByteStringInstanceType(str.instanceType) & this.isOneByte;
   }
 
-  macro AddSeparators(implicit context: Context)(
-      nofSeparators: intptr, separatorLength: intptr, write: bool): void {
+  macro AddSeparators(
+      implicit context: Context)(nofSeparators: intptr,
+      separatorLength: intptr, write: bool): void {
     if (nofSeparators == 0 || separatorLength == 0) return;
 
     const nofSeparatorsInt: intptr = nofSeparators;
@@ -278,8 +280,8 @@ macro NewBuffer(len: uintptr, sep: String): Buffer {
   };
 }
 
-macro BufferJoin(implicit context: Context)(
-    buffer: Buffer, sep: String): String {
+macro BufferJoin(implicit context: Context)(buffer: Buffer, sep: String):
+    String {
   dcheck(IsValidPositiveSmi(buffer.totalStringLength));
   if (buffer.totalStringLength == 0) return kEmptyString;
 
@@ -312,10 +314,10 @@ macro BufferJoin(implicit context: Context)(
       buffer.fixedArray, buffer.index, sep, r);
 }
 
-transitioning macro ArrayJoinImpl<T: type>(implicit context: Context)(
-    receiver: JSReceiver, sep: String, lengthNumber: Number,
-    useToLocaleString: constexpr bool, locales: JSAny, options: JSAny,
-    initialLoadFn: LoadJoinElementFn): String {
+transitioning macro ArrayJoinImpl<T: type>(
+    implicit context: Context)(receiver: JSReceiver, sep: String,
+    lengthNumber: Number, useToLocaleString: constexpr bool, locales: JSAny,
+    options: JSAny, initialLoadFn: LoadJoinElementFn): String {
   const initialMap: Map = receiver.map;
   const len: uintptr = Convert<uintptr>(lengthNumber);
   const separatorLength: intptr = sep.length_intptr;
@@ -378,13 +380,15 @@ transitioning macro ArrayJoinImpl<T: type>(implicit context: Context)(
   return BufferJoin(buffer, sep);
 }
 
-transitioning macro ArrayJoin<T: type>(implicit context: Context)(
-    useToLocaleString: constexpr bool, receiver: JSReceiver, sep: String,
-    lenNumber: Number, locales: JSAny, options: JSAny): JSAny;
+transitioning macro ArrayJoin<T: type>(
+    implicit context: Context)(useToLocaleString: constexpr bool,
+    receiver: JSReceiver, sep: String, lenNumber: Number, locales: JSAny,
+    options: JSAny): JSAny;
 
-transitioning ArrayJoin<JSArray>(implicit context: Context)(
-    useToLocaleString: constexpr bool, receiver: JSReceiver, sep: String,
-    lenNumber: Number, locales: JSAny, options: JSAny): JSAny {
+transitioning ArrayJoin<JSArray>(
+    implicit context: Context)(useToLocaleString: constexpr bool,
+    receiver: JSReceiver, sep: String, lenNumber: Number, locales: JSAny,
+    options: JSAny): JSAny {
   const map: Map = receiver.map;
   const kind: ElementsKind = map.elements_kind;
   let loadFn: LoadJoinElementFn;
@@ -428,9 +432,10 @@ transitioning ArrayJoin<JSArray>(implicit context: Context)(
       receiver, sep, lenNumber, useToLocaleString, locales, options, loadFn);
 }
 
-transitioning ArrayJoin<JSTypedArray>(implicit context: Context)(
-    useToLocaleString: constexpr bool, receiver: JSReceiver, sep: String,
-    lenNumber: Number, locales: JSAny, options: JSAny): JSAny {
+transitioning ArrayJoin<JSTypedArray>(
+    implicit context: Context)(useToLocaleString: constexpr bool,
+    receiver: JSReceiver, sep: String, lenNumber: Number, locales: JSAny,
+    options: JSAny): JSAny {
   const map: Map = receiver.map;
   const kind: ElementsKind = map.elements_kind;
   let loadFn: LoadJoinElementFn;
@@ -518,8 +523,9 @@ macro SetJoinStack(implicit context: Context)(stack: FixedArray): void {
 // Adds a receiver to the stack. The FixedArray will automatically grow to
 // accommodate the receiver. If the receiver already exists on the stack,
 // this indicates a cyclical call and False is returned.
-builtin JoinStackPush(implicit context: Context)(
-    stack: FixedArray, receiver: JSReceiver): Boolean {
+builtin JoinStackPush(
+    implicit context: Context)(stack: FixedArray,
+    receiver: JSReceiver): Boolean {
   const capacity: intptr = stack.length_intptr;
   for (let i: intptr = 0; i < capacity; i++) {
     const previouslyVisited: Object = stack.objects[i];
@@ -565,8 +571,9 @@ macro JoinStackPushInline(implicit context: Context)(receiver: JSReceiver):
 
 // Removes a receiver from the stack. The FixedArray will automatically shrink
 // to Heap::kMinJoinStackSize once the stack becomes empty.
-builtin JoinStackPop(implicit context: Context)(
-    stack: FixedArray, receiver: JSReceiver): JSAny {
+builtin JoinStackPop(
+    implicit context: Context)(stack: FixedArray,
+    receiver: JSReceiver): JSAny {
   const len: intptr = stack.length_intptr;
   for (let i: intptr = 0; i < len; i++) {
     if (stack.objects[i] == receiver) {
@@ -605,9 +612,9 @@ macro JoinStackPopInline(implicit context: Context)(receiver: JSReceiver):
 
 // Main entry point for all builtins using Array Join functionality.
 transitioning macro CycleProtectedArrayJoin<T: type>(
-    implicit context: Context)(
-    useToLocaleString: constexpr bool, o: JSReceiver, len: Number,
-    sepObj: JSAny, locales: JSAny, options: JSAny): JSAny {
+    implicit context: Context)(useToLocaleString: constexpr bool,
+    o: JSReceiver, len: Number, sepObj: JSAny, locales: JSAny,
+    options: JSAny): JSAny {
   // 3. If separator is undefined, let sep be the single-element String ",".
   // 4. Else, let sep be ? ToString(separator).
   const sep: String = sepObj == Undefined ? ',' : ToString_Inline(sepObj);
@@ -630,8 +637,7 @@ transitioning macro CycleProtectedArrayJoin<T: type>(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.join
-transitioning javascript builtin
-ArrayPrototypeJoin(
+transitioning javascript builtin ArrayPrototypeJoin(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   const separator: JSAny = arguments[0];
 
diff --git a/deps/v8/src/builtins/array-lastindexof.tq b/deps/v8/src/builtins/array-lastindexof.tq
index 912b43abed179e..8616a6f22ebc3c 100644
--- a/deps/v8/src/builtins/array-lastindexof.tq
+++ b/deps/v8/src/builtins/array-lastindexof.tq
@@ -7,8 +7,8 @@ macro LoadWithHoleCheck<Elements : type extends FixedArrayBase>(
     elements: FixedArrayBase, index: Smi): JSAny
     labels IfHole;
 
-LoadWithHoleCheck<FixedArray>(implicit context: Context)(
-    elements: FixedArrayBase, index: Smi): JSAny
+LoadWithHoleCheck<FixedArray>(
+    implicit context: Context)(elements: FixedArrayBase, index: Smi): JSAny
     labels IfHole {
   const elements: FixedArray = UnsafeCast<FixedArray>(elements);
   const element: Object = elements.objects[index];
@@ -16,8 +16,8 @@ LoadWithHoleCheck<FixedArray>(implicit context: Context)(
   return UnsafeCast<JSAny>(element);
 }
 
-LoadWithHoleCheck<FixedDoubleArray>(implicit context: Context)(
-    elements: FixedArrayBase, index: Smi): JSAny
+LoadWithHoleCheck<FixedDoubleArray>(
+    implicit context: Context)(elements: FixedArrayBase, index: Smi): JSAny
     labels IfHole {
   const elements: FixedDoubleArray = UnsafeCast<FixedDoubleArray>(elements);
   const element: float64 = elements.floats[index].Value() otherwise IfHole;
@@ -56,8 +56,8 @@ macro FastArrayLastIndexOf<Elements : type extends FixedArrayBase>(
   return -1;
 }
 
-transitioning macro
-GetFromIndex(context: Context, length: Number, arguments: Arguments): Number {
+transitioning macro GetFromIndex(
+    context: Context, length: Number, arguments: Arguments): Number {
   // 4. If fromIndex is present, let n be ? ToInteger(fromIndex);
   //    else let n be len - 1.
   const n: Number =
diff --git a/deps/v8/src/builtins/array-map.tq b/deps/v8/src/builtins/array-map.tq
index 1958d1eb59d590..2755caecb3d39c 100644
--- a/deps/v8/src/builtins/array-map.tq
+++ b/deps/v8/src/builtins/array-map.tq
@@ -5,26 +5,23 @@
 namespace array {
 
 // Continuation for lazy deopt triggered by allocation of the result array.
-transitioning javascript builtin
-ArrayMapPreLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, length: JSAny, result: JSAny): JSAny {
+transitioning javascript builtin ArrayMapPreLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, length: JSAny, result: JSAny): JSAny {
   const jsreceiver = Cast<JSReceiver>(receiver) otherwise unreachable;
   const outputArray = Cast<JSReceiver>(result) otherwise unreachable;
   const numberLength = Cast<Number>(length) otherwise unreachable;
 
   const callbackfn = Cast<Callable>(callback)
-      otherwise ThrowTypeError(MessageTemplate::kCalledNonCallable, callback);
+      otherwise ThrowCalledNonCallable(callback);
   return ArrayMapLoopContinuation(
       jsreceiver, callbackfn, thisArg, outputArray, jsreceiver, kZero,
       numberLength);
 }
 
-transitioning javascript builtin
-ArrayMapLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, array: JSAny, initialK: JSAny,
-    length: JSAny): JSAny {
+transitioning javascript builtin ArrayMapLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, array: JSAny, initialK: JSAny, length: JSAny): JSAny {
   const jsreceiver = Cast<JSReceiver>(receiver) otherwise unreachable;
   const callbackfn = Cast<Callable>(callback) otherwise unreachable;
   const outputArray = Cast<JSReceiver>(array) otherwise unreachable;
@@ -36,11 +33,10 @@ ArrayMapLoopEagerDeoptContinuation(
       numberLength);
 }
 
-transitioning javascript builtin
-ArrayMapLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, array: JSAny, initialK: JSAny,
-    length: JSAny, result: JSAny): JSAny {
+transitioning javascript builtin ArrayMapLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, array: JSAny, initialK: JSAny, length: JSAny,
+    result: JSAny): JSAny {
   const jsreceiver = Cast<JSReceiver>(receiver) otherwise unreachable;
   const callbackfn = Cast<Callable>(callback) otherwise unreachable;
   const outputArray = Cast<JSReceiver>(array) otherwise unreachable;
@@ -63,9 +59,10 @@ ArrayMapLoopLazyDeoptContinuation(
       numberLength);
 }
 
-transitioning builtin ArrayMapLoopContinuation(implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable, thisArg: JSAny,
-    array: JSReceiver, o: JSReceiver, initialK: Number, length: Number): JSAny {
+transitioning builtin ArrayMapLoopContinuation(
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
+    thisArg: JSAny, array: JSReceiver, o: JSReceiver, initialK: Number,
+    length: Number): JSAny {
   // 6. Let k be 0.
   // 7. Repeat, while k < len
   for (let k: Number = initialK; k < length; k++) {
@@ -101,7 +98,8 @@ struct Vector {
     this.skippedElements = true;
   }
 
-  macro CreateJSArray(implicit context: Context)(validLength: Smi): JSArray {
+  macro CreateJSArray(implicit context: Context)(validLength: Smi):
+      JSArray {
     const length: Smi = this.fixedArray.length;
     dcheck(validLength <= length);
     let kind: ElementsKind = ElementsKind::PACKED_SMI_ELEMENTS;
@@ -129,8 +127,8 @@ struct Vector {
       // We need to allocate and copy.
       // First, initialize the elements field before allocation to prevent
       // heap corruption.
-      const elements: FixedDoubleArray = AllocateFixedDoubleArrayWithHoles(
-          SmiUntag(length), AllocationFlag::kAllowLargeObjectAllocation);
+      const elements: FixedDoubleArray =
+          AllocateFixedDoubleArrayWithHoles(SmiUntag(length));
       a = NewJSArray(map, this.fixedArray);
       for (let i: Smi = 0; i < validLength; i++) {
         typeswitch (
@@ -153,8 +151,8 @@ struct Vector {
     return a;
   }
 
-  macro StoreResult(implicit context: Context)(
-      index: Smi, result: JSAny): void {
+  macro StoreResult(implicit context: Context)(index: Smi, result: JSAny):
+      void {
     typeswitch (result) {
       case (s: Smi): {
         this.fixedArray.objects[index] = s;
@@ -179,8 +177,7 @@ struct Vector {
 
 macro NewVector(implicit context: Context)(length: Smi): Vector {
   const fixedArray = length > 0 ?
-      AllocateFixedArrayWithHoles(
-          SmiUntag(length), AllocationFlag::kAllowLargeObjectAllocation) :
+      AllocateFixedArrayWithHoles(SmiUntag(length)) :
       kEmptyFixedArray;
   return Vector{
     fixedArray,
@@ -190,9 +187,9 @@ macro NewVector(implicit context: Context)(length: Smi): Vector {
   };
 }
 
-transitioning macro FastArrayMap(implicit context: Context)(
-    fastO: FastJSArrayForRead, len: Smi, callbackfn: Callable,
-    thisArg: JSAny): JSArray
+transitioning macro FastArrayMap(
+    implicit context: Context)(fastO: FastJSArrayForRead, len: Smi,
+    callbackfn: Callable, thisArg: JSAny): JSArray
     labels Bailout(JSArray, Smi) {
   let k: Smi = 0;
   let fastOW = NewFastJSArrayForReadWitness(fastO);
@@ -228,8 +225,7 @@ transitioning macro FastArrayMap(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.map
-transitioning javascript builtin
-ArrayMap(
+transitioning javascript builtin ArrayMap(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.map');
@@ -269,7 +265,7 @@ ArrayMap(
 
     return ArrayMapLoopContinuation(o, callbackfn, thisArg, array, o, k, len);
   } label TypeError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-of.tq b/deps/v8/src/builtins/array-of.tq
index b469ec5f5c4590..b40fb436cfe931 100644
--- a/deps/v8/src/builtins/array-of.tq
+++ b/deps/v8/src/builtins/array-of.tq
@@ -4,8 +4,7 @@
 
 namespace array {
 // https://tc39.github.io/ecma262/#sec-array.of
-transitioning javascript builtin
-ArrayOf(
+transitioning javascript builtin ArrayOf(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // 1. Let len be the actual number of arguments passed to this function.
   const len: Smi = Convert<Smi>(arguments.length);
diff --git a/deps/v8/src/builtins/array-reduce-right.tq b/deps/v8/src/builtins/array-reduce-right.tq
index 90e0e496f8f657..7a6c82268813d1 100644
--- a/deps/v8/src/builtins/array-reduce-right.tq
+++ b/deps/v8/src/builtins/array-reduce-right.tq
@@ -3,10 +3,9 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning javascript builtin
-ArrayReduceRightPreLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, length: JSAny): JSAny {
+transitioning javascript builtin ArrayReduceRightPreLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    length: JSAny): JSAny {
   // All continuation points in the optimized every implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -26,11 +25,9 @@ ArrayReduceRightPreLoopEagerDeoptContinuation(
       jsreceiver, callbackfn, TheHole, jsreceiver, initialK, numberLength);
 }
 
-transitioning javascript builtin
-ArrayReduceRightLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, initialK: JSAny, length: JSAny,
-    accumulator: JSAny): JSAny {
+transitioning javascript builtin ArrayReduceRightLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    initialK: JSAny, length: JSAny, accumulator: JSAny): JSAny {
   // All continuation points in the optimized every implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -47,10 +44,9 @@ ArrayReduceRightLoopEagerDeoptContinuation(
       jsreceiver, callbackfn, accumulator, jsreceiver, numberK, numberLength);
 }
 
-transitioning javascript builtin
-ArrayReduceRightLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, initialK: JSAny, length: JSAny, result: JSAny): JSAny {
+transitioning javascript builtin ArrayReduceRightLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    initialK: JSAny, length: JSAny, result: JSAny): JSAny {
   // All continuation points in the optimized every implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -66,8 +62,7 @@ ArrayReduceRightLoopLazyDeoptContinuation(
 }
 
 transitioning builtin ArrayReduceRightLoopContinuation(
-    implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable,
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
     initialAccumulator: JSAny|TheHole, o: JSReceiver, initialK: Number,
     _length: Number): JSAny {
   let accumulator = initialAccumulator;
@@ -117,10 +112,10 @@ transitioning builtin ArrayReduceRightLoopContinuation(
   }
 }
 
-transitioning macro FastArrayReduceRight(implicit context: Context)(
-    o: JSReceiver, len: Number, callbackfn: Callable,
-    initialAccumulator: JSAny|TheHole): JSAny
-    labels Bailout(Number, JSAny | TheHole) {
+transitioning macro FastArrayReduceRight(
+    implicit context: Context)(o: JSReceiver, len: Number,
+    callbackfn: Callable, initialAccumulator: JSAny|TheHole): JSAny
+    labels Bailout(Number, JSAny|TheHole) {
   let accumulator = initialAccumulator;
   const smiLen = Cast<Smi>(len) otherwise goto Bailout(len - 1, accumulator);
   const fastO = Cast<FastJSArrayForRead>(o)
@@ -158,8 +153,7 @@ transitioning macro FastArrayReduceRight(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.reduceRight
-transitioning javascript builtin
-ArrayReduceRight(
+transitioning javascript builtin ArrayReduceRight(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.reduceRight');
@@ -191,7 +185,7 @@ ArrayReduceRight(
           o, callbackfn, accumulator, o, value, len);
     }
   } label NoCallableError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-reduce.tq b/deps/v8/src/builtins/array-reduce.tq
index 8ab85a0cb61cfc..a67347805c8982 100644
--- a/deps/v8/src/builtins/array-reduce.tq
+++ b/deps/v8/src/builtins/array-reduce.tq
@@ -3,10 +3,9 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning javascript builtin
-ArrayReducePreLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, length: JSAny): JSAny {
+transitioning javascript builtin ArrayReducePreLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    length: JSAny): JSAny {
   // All continuation points in the optimized every implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -25,11 +24,9 @@ ArrayReducePreLoopEagerDeoptContinuation(
       jsreceiver, callbackfn, TheHole, jsreceiver, 0, numberLength);
 }
 
-transitioning javascript builtin
-ArrayReduceLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, initialK: JSAny, length: JSAny,
-    accumulator: JSAny): JSAny {
+transitioning javascript builtin ArrayReduceLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    initialK: JSAny, length: JSAny, accumulator: JSAny): JSAny {
   // All continuation points in the optimized every implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -46,10 +43,9 @@ ArrayReduceLoopEagerDeoptContinuation(
       jsreceiver, callbackfn, accumulator, jsreceiver, numberK, numberLength);
 }
 
-transitioning javascript builtin
-ArrayReduceLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, initialK: JSAny, length: JSAny, result: JSAny): JSAny {
+transitioning javascript builtin ArrayReduceLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    initialK: JSAny, length: JSAny, result: JSAny): JSAny {
   // All continuation points in the optimized every implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -64,8 +60,8 @@ ArrayReduceLoopLazyDeoptContinuation(
   return r;
 }
 
-transitioning builtin ArrayReduceLoopContinuation(implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable,
+transitioning builtin ArrayReduceLoopContinuation(
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
     initialAccumulator: JSAny|TheHole, o: JSReceiver, initialK: Number,
     length: Number): JSAny {
   let accumulator = initialAccumulator;
@@ -115,10 +111,10 @@ transitioning builtin ArrayReduceLoopContinuation(implicit context: Context)(
   }
 }
 
-transitioning macro FastArrayReduce(implicit context: Context)(
-    o: JSReceiver, len: Number, callbackfn: Callable,
-    initialAccumulator: JSAny|TheHole): JSAny
-    labels Bailout(Number, JSAny | TheHole) {
+transitioning macro FastArrayReduce(
+    implicit context: Context)(o: JSReceiver, len: Number,
+    callbackfn: Callable, initialAccumulator: JSAny|TheHole): JSAny
+    labels Bailout(Number, JSAny|TheHole) {
   const k = 0;
   let accumulator = initialAccumulator;
   Cast<Smi>(len) otherwise goto Bailout(k, accumulator);
@@ -157,8 +153,7 @@ transitioning macro FastArrayReduce(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.reduce
-transitioning javascript builtin
-ArrayReduce(
+transitioning javascript builtin ArrayReduce(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.reduce');
@@ -190,7 +185,7 @@ ArrayReduce(
           o, callbackfn, accumulator, o, value, len);
     }
   } label NoCallableError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-reverse.tq b/deps/v8/src/builtins/array-reverse.tq
index b5835f8be967ce..55a419437cf530 100644
--- a/deps/v8/src/builtins/array-reverse.tq
+++ b/deps/v8/src/builtins/array-reverse.tq
@@ -6,30 +6,33 @@ namespace array {
 macro LoadElement<Elements : type extends FixedArrayBase, T: type>(
     elements: FixedArrayBase, index: Smi): T;
 
-LoadElement<FixedArray, Object>(implicit context: Context)(
-    elements: FixedArrayBase, index: Smi): Object {
+LoadElement<FixedArray, Object>(
+    implicit context: Context)(elements: FixedArrayBase, index: Smi): Object {
   const elements: FixedArray = UnsafeCast<FixedArray>(elements);
   return elements.objects[index];
 }
 
-LoadElement<FixedDoubleArray, float64_or_hole>(implicit context: Context)(
-    elements: FixedArrayBase, index: Smi): float64_or_hole {
+LoadElement<FixedDoubleArray, float64_or_hole>(
+    implicit context: Context)(elements: FixedArrayBase,
+    index: Smi): float64_or_hole {
   const elements: FixedDoubleArray = UnsafeCast<FixedDoubleArray>(elements);
   return elements.floats[index];
 }
 
 macro StoreElement<Elements : type extends FixedArrayBase, T: type>(
-    implicit context: Context)(
-    elements: FixedArrayBase, index: Smi, value: T): void;
+    implicit context: Context)(elements: FixedArrayBase, index: Smi,
+    value: T): void;
 
-StoreElement<FixedArray, Object>(implicit context: Context)(
-    elements: FixedArrayBase, index: Smi, value: Object): void {
+StoreElement<FixedArray, Object>(
+    implicit context: Context)(elements: FixedArrayBase, index: Smi,
+    value: Object): void {
   const elements: FixedArray = UnsafeCast<FixedArray>(elements);
   elements.objects[index] = value;
 }
 
-StoreElement<FixedDoubleArray, float64_or_hole>(implicit context: Context)(
-    elements: FixedArrayBase, index: Smi, value: float64_or_hole): void {
+StoreElement<FixedDoubleArray, float64_or_hole>(
+    implicit context: Context)(elements: FixedArrayBase, index: Smi,
+    value: float64_or_hole): void {
   const elems: FixedDoubleArray = UnsafeCast<FixedDoubleArray>(elements);
   elems.floats[index] = value;
 }
@@ -52,8 +55,8 @@ macro FastArrayReverse<Elements : type extends FixedArrayBase, T: type>(
   }
 }
 
-transitioning macro GenericArrayReverse(
-    context: Context, receiver: JSAny): JSAny {
+transitioning macro GenericArrayReverse(context: Context, receiver: JSAny):
+    JSAny {
   // 1. Let O be ? ToObject(this value).
   const object: JSReceiver = ToObject_Inline(context, receiver);
 
diff --git a/deps/v8/src/builtins/array-shift.tq b/deps/v8/src/builtins/array-shift.tq
index ea62b1c7a86bb0..484a48d5482a9d 100644
--- a/deps/v8/src/builtins/array-shift.tq
+++ b/deps/v8/src/builtins/array-shift.tq
@@ -36,8 +36,8 @@ macro TryFastArrayShift(implicit context: Context)(receiver: JSAny): JSAny
   return result;
 }
 
-transitioning macro GenericArrayShift(implicit context: Context)(
-    receiver: JSAny): JSAny {
+transitioning macro GenericArrayShift(
+    implicit context: Context)(receiver: JSAny): JSAny {
   // 1. Let O be ? ToObject(this value).
   const object: JSReceiver = ToObject_Inline(context, receiver);
 
diff --git a/deps/v8/src/builtins/array-slice.tq b/deps/v8/src/builtins/array-slice.tq
index f5a644ef40edbf..16babfc8c92663 100644
--- a/deps/v8/src/builtins/array-slice.tq
+++ b/deps/v8/src/builtins/array-slice.tq
@@ -127,8 +127,7 @@ macro HandleFastSlice(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.slice
-transitioning javascript builtin
-ArrayPrototypeSlice(
+transitioning javascript builtin ArrayPrototypeSlice(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // 1. Let O be ? ToObject(this value).
   const o: JSReceiver = ToObject_Inline(context, receiver);
diff --git a/deps/v8/src/builtins/array-some.tq b/deps/v8/src/builtins/array-some.tq
index 69467bba276a12..ea07ec8260cc3f 100644
--- a/deps/v8/src/builtins/array-some.tq
+++ b/deps/v8/src/builtins/array-some.tq
@@ -3,10 +3,9 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning javascript builtin
-ArraySomeLoopEagerDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
+transitioning javascript builtin ArraySomeLoopEagerDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny): JSAny {
   // All continuation points in the optimized some implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -24,11 +23,9 @@ ArraySomeLoopEagerDeoptContinuation(
       numberLength, Undefined);
 }
 
-transitioning javascript builtin
-ArraySomeLoopLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    callback: JSAny, thisArg: JSAny, initialK: JSAny, length: JSAny,
-    result: JSAny): JSAny {
+transitioning javascript builtin ArraySomeLoopLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(callback: JSAny,
+    thisArg: JSAny, initialK: JSAny, length: JSAny, result: JSAny): JSAny {
   // All continuation points in the optimized some implementation are
   // after the ToObject(O) call that ensures we are dealing with a
   // JSReceiver.
@@ -51,9 +48,10 @@ ArraySomeLoopLazyDeoptContinuation(
       numberLength, Undefined);
 }
 
-transitioning builtin ArraySomeLoopContinuation(implicit context: Context)(
-    _receiver: JSReceiver, callbackfn: Callable, thisArg: JSAny, _array: JSAny,
-    o: JSReceiver, initialK: Number, length: Number, _initialTo: JSAny): JSAny {
+transitioning builtin ArraySomeLoopContinuation(
+    implicit context: Context)(_receiver: JSReceiver, callbackfn: Callable,
+    thisArg: JSAny, _array: JSAny, o: JSReceiver, initialK: Number,
+    length: Number, _initialTo: JSAny): JSAny {
   // 5. Let k be 0.
   // 6. Repeat, while k < len
   for (let k: Number = initialK; k < length; k++) {
@@ -83,8 +81,9 @@ transitioning builtin ArraySomeLoopContinuation(implicit context: Context)(
   return False;
 }
 
-transitioning macro FastArraySome(implicit context: Context)(
-    o: JSReceiver, len: Number, callbackfn: Callable, thisArg: JSAny): JSAny
+transitioning macro FastArraySome(
+    implicit context: Context)(o: JSReceiver, len: Number,
+    callbackfn: Callable, thisArg: JSAny): JSAny
     labels Bailout(Smi) {
   let k: Smi = 0;
   const smiLen = Cast<Smi>(len) otherwise goto Bailout(k);
@@ -108,8 +107,7 @@ transitioning macro FastArraySome(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.some
-transitioning javascript builtin
-ArraySome(
+transitioning javascript builtin ArraySome(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   try {
     RequireObjectCoercible(receiver, 'Array.prototype.some');
@@ -138,7 +136,7 @@ ArraySome(
           o, callbackfn, thisArg, Undefined, o, kValue, len, Undefined);
     }
   } label TypeError deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/array-splice.tq b/deps/v8/src/builtins/array-splice.tq
index c8a4010d1ae0bc..cb5cb6d2cf90a7 100644
--- a/deps/v8/src/builtins/array-splice.tq
+++ b/deps/v8/src/builtins/array-splice.tq
@@ -9,24 +9,23 @@ namespace array {
 // created result array. Most of this behavior is outsourced to
 // ExtractFixedArray(). We handle the case where the {source} is
 // EmptyFixedArray but result is expected to be a FixedDoubleArray.
-macro Extract(implicit context: Context)(
-    source: FixedArray, startIndex: Smi, count: Smi,
+macro Extract(
+    implicit context: Context)(source: FixedArray, startIndex: Smi, count: Smi,
     resultCapacity: Smi): FixedArray {
   return ExtractFixedArray(
       source, Convert<intptr>(startIndex), Convert<intptr>(count),
       Convert<intptr>(resultCapacity));
 }
 
-macro Extract(implicit context: Context)(
-    source: FixedDoubleArray|EmptyFixedArray, startIndex: Smi, count: Smi,
-    resultCapacity: Smi): FixedDoubleArray|EmptyFixedArray {
+macro Extract(
+    implicit context: Context)(source: FixedDoubleArray|EmptyFixedArray,
+    startIndex: Smi, count: Smi, resultCapacity: Smi): FixedDoubleArray
+    |EmptyFixedArray {
   typeswitch (source) {
     case (EmptyFixedArray): {
       // ExtractFixedDoubleArray expects {source} to be a FixedDoubleArray.
       // Handle the case where {source} is empty here.
-      return AllocateFixedDoubleArrayWithHoles(
-          Convert<intptr>(resultCapacity),
-          AllocationFlag::kAllowLargeObjectAllocation);
+      return AllocateFixedDoubleArrayWithHoles(Convert<intptr>(resultCapacity));
     }
     case (source: FixedDoubleArray): {
       return ExtractFixedDoubleArray(
@@ -80,9 +79,9 @@ macro InsertArgumentsIntoFastPackedArray<
 
 macro
 FastSplice<FixedArrayType : type extends FixedArrayBase, ElementType: type>(
-    implicit context: Context)(
-    args: Arguments, a: JSArray, length: Smi, newLength: Smi, actualStart: Smi,
-    insertCount: Smi, actualDeleteCount: Smi): void {
+    implicit context: Context)(args: Arguments, a: JSArray, length: Smi,
+    newLength: Smi, actualStart: Smi, insertCount: Smi,
+    actualDeleteCount: Smi): void {
   // Make sure elements are writable.
   array::EnsureWriteableFastElements(a);
 
@@ -380,8 +379,7 @@ transitioning macro SlowSplice(
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.splice
-transitioning javascript builtin
-ArrayPrototypeSplice(
+transitioning javascript builtin ArrayPrototypeSplice(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // 1. Let O be ? ToObject(this value).
   const o: JSReceiver = ToObject(context, receiver);
diff --git a/deps/v8/src/builtins/array-to-reversed.tq b/deps/v8/src/builtins/array-to-reversed.tq
index cb098e1a4555ae..944554c748fd75 100644
--- a/deps/v8/src/builtins/array-to-reversed.tq
+++ b/deps/v8/src/builtins/array-to-reversed.tq
@@ -4,13 +4,13 @@
 
 namespace array {
 
-macro FastPackedDoubleArrayToReversed(implicit context: Context)(
-    elements: FixedDoubleArray, length: Smi): JSArray {
+macro FastPackedDoubleArrayToReversed(
+    implicit context: Context)(elements: FixedDoubleArray,
+    length: Smi): JSArray {
   // 3. Let A be ? ArrayCreate(𝔽(len)).
   const copy: FixedDoubleArray =
       UnsafeCast<FixedDoubleArray>(AllocateFixedArray(
-          ElementsKind::PACKED_DOUBLE_ELEMENTS, SmiUntag(length),
-          AllocationFlag::kAllowLargeObjectAllocation));
+          ElementsKind::PACKED_DOUBLE_ELEMENTS, SmiUntag(length)));
 
   // 4. Let k be 0.
   let k: Smi = 0;
@@ -39,12 +39,11 @@ macro FastPackedDoubleArrayToReversed(implicit context: Context)(
 }
 
 macro FastArrayToReversed<FromElements : type extends FixedArrayBase>(
-    implicit context: Context)(
-    kind: constexpr ElementsKind, elements: FromElements, length: Smi,
+    implicit context: Context)(kind: constexpr ElementsKind,
+    elements: FromElements, length: Smi,
     initializeArray: constexpr bool): JSArray {
   // 3. Let A be ? ArrayCreate(𝔽(len)).
-  const copy: FixedArrayBase = AllocateFixedArray(
-      kind, SmiUntag(length), AllocationFlag::kAllowLargeObjectAllocation);
+  const copy: FixedArrayBase = AllocateFixedArray(kind, SmiUntag(length));
 
   // Reversing HOLEY_DOUBLE_ELEMENTS array may allocate heap numbers.
   // We need to initialize the array to avoid running GC with garbage values.
@@ -115,8 +114,8 @@ macro TryFastArrayToReversed(implicit context: Context)(receiver: JSAny):
   }
 }
 
-transitioning builtin GenericArrayToReversed(implicit context: Context)(
-    receiver: JSAny): JSAny {
+transitioning builtin GenericArrayToReversed(
+    implicit context: Context)(receiver: JSAny): JSAny {
   // 1. Let O be ? ToObject(this value).
   const object: JSReceiver = ToObject_Inline(context, receiver);
 
diff --git a/deps/v8/src/builtins/array-to-sorted.tq b/deps/v8/src/builtins/array-to-sorted.tq
index e3fb93a0c4b6da..c9da1bf0c7aae1 100644
--- a/deps/v8/src/builtins/array-to-sorted.tq
+++ b/deps/v8/src/builtins/array-to-sorted.tq
@@ -3,8 +3,8 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning macro
-CopyWorkArrayToNewFastJSArray(implicit context: Context, sortState: SortState)(
+transitioning macro CopyWorkArrayToNewFastJSArray(
+    implicit context: Context, sortState: SortState)(
     elementsKind: constexpr ElementsKind, numberOfNonUndefined: Smi): JSArray {
   dcheck(
       elementsKind == ElementsKind::PACKED_SMI_ELEMENTS ||
@@ -14,9 +14,8 @@ CopyWorkArrayToNewFastJSArray(implicit context: Context, sortState: SortState)(
   dcheck(len == numberOfNonUndefined + sortState.numberOfUndefined);
   dcheck(len <= kMaxFastArrayLength);
 
-  const copy: FixedArray = UnsafeCast<FixedArray>(AllocateFixedArray(
-      elementsKind, Convert<intptr>(len),
-      AllocationFlag::kAllowLargeObjectAllocation));
+  const copy: FixedArray = UnsafeCast<FixedArray>(
+      AllocateFixedArray(elementsKind, Convert<intptr>(len)));
 
   const workArray = sortState.workArray;
   CopyElements(
@@ -34,8 +33,8 @@ CopyWorkArrayToNewFastJSArray(implicit context: Context, sortState: SortState)(
   return NewJSArray(map, copy);
 }
 
-transitioning macro
-CopyWorkArrayToNewJSArray(implicit context: Context, sortState: SortState)(
+transitioning macro CopyWorkArrayToNewJSArray(
+    implicit context: Context, sortState: SortState)(
     numberOfNonUndefined: Smi): JSArray {
   const len = sortState.sortLength;
   dcheck(len == numberOfNonUndefined + sortState.numberOfUndefined);
@@ -52,8 +51,8 @@ CopyWorkArrayToNewJSArray(implicit context: Context, sortState: SortState)(
   return copy;
 }
 
-transitioning builtin
-ArrayTimSortIntoCopy(context: Context, sortState: SortState): JSArray {
+transitioning builtin ArrayTimSortIntoCopy(
+    context: Context, sortState: SortState): JSArray {
   const isToSorted: constexpr bool = true;
   const numberOfNonUndefined: Smi =
       CompactReceiverElementsIntoWorkArray(isToSorted);
diff --git a/deps/v8/src/builtins/array-to-spliced.tq b/deps/v8/src/builtins/array-to-spliced.tq
index 505a58b733cf05..7f71941c4dd13d 100644
--- a/deps/v8/src/builtins/array-to-spliced.tq
+++ b/deps/v8/src/builtins/array-to-spliced.tq
@@ -5,17 +5,16 @@
 namespace array {
 // Makes a copy of the source array for toSpliced without inserting the new
 // items.
-macro CopyFastPackedArrayForToSpliced(implicit context: Context)(
-    kind: constexpr ElementsKind, array: JSArray, newLenSmi: Smi,
-    actualStartSmi: Smi, insertCountSmi: Smi,
+macro CopyFastPackedArrayForToSpliced(
+    implicit context: Context)(kind: constexpr ElementsKind, array: JSArray,
+    newLenSmi: Smi, actualStartSmi: Smi, insertCountSmi: Smi,
     actualDeleteCountSmi: Smi): JSArray {
   const newLen: intptr = Convert<intptr>(newLenSmi);
   const actualStart: intptr = Convert<intptr>(actualStartSmi);
   const insertCount: intptr = Convert<intptr>(insertCountSmi);
   const actualDeleteCount: intptr = Convert<intptr>(actualDeleteCountSmi);
 
-  const copy: FixedArrayBase = AllocateFixedArray(
-      kind, newLen, AllocationFlag::kAllowLargeObjectAllocation);
+  const copy: FixedArrayBase = AllocateFixedArray(kind, newLen);
 
   if (actualStart > 0) {
     // Copy the part before the inserted items.
@@ -48,10 +47,10 @@ macro CopyFastPackedArrayForToSpliced(implicit context: Context)(
   return NewJSArray(map, copy);
 }
 
-transitioning macro TryFastArrayToSpliced(implicit context: Context)(
-    args: Arguments, o: JSReceiver, originalLenNumber: Number,
-    newLenNumber: Number, actualStartNumber: Number, insertCount: Smi,
-    actualDeleteCountNumber: Number): JSArray labels Slow {
+transitioning macro TryFastArrayToSpliced(
+    implicit context: Context)(args: Arguments, o: JSReceiver,
+    originalLenNumber: Number, newLenNumber: Number, actualStartNumber: Number,
+    insertCount: Smi, actualDeleteCountNumber: Number): JSArray labels Slow {
   const newLen: Smi = Cast<Smi>(newLenNumber) otherwise Slow;
   const actualStart: Smi = Cast<Smi>(actualStartNumber) otherwise Slow;
   const actualDeleteCount: Smi =
@@ -107,9 +106,9 @@ transitioning macro TryFastArrayToSpliced(implicit context: Context)(
   return copy;
 }
 
-transitioning macro GenericArrayToSpliced(implicit context: Context)(
-    args: Arguments, o: JSReceiver, newLen: Number, actualStart: Number,
-    actualDeleteCount: Number): JSArray {
+transitioning macro GenericArrayToSpliced(
+    implicit context: Context)(args: Arguments, o: JSReceiver, newLen: Number,
+    actualStart: Number, actualDeleteCount: Number): JSArray {
   // 13. Let A be ? ArrayCreate(𝔽(newLen)).
   const copy = ArrayCreate(newLen);
 
diff --git a/deps/v8/src/builtins/array-with.tq b/deps/v8/src/builtins/array-with.tq
index e6a6c7cfbcf580..b45fbe825e7df3 100644
--- a/deps/v8/src/builtins/array-with.tq
+++ b/deps/v8/src/builtins/array-with.tq
@@ -3,9 +3,9 @@
 // found in the LICENSE file.
 
 namespace array {
-transitioning macro TryFastPackedArrayWith(implicit context: Context)(
-    receiver: JSReceiver, len: Number, actualIndex: Number,
-    value: JSAny): JSArray labels Slow {
+transitioning macro TryFastPackedArrayWith(
+    implicit context: Context)(receiver: JSReceiver, len: Number,
+    actualIndex: Number, value: JSAny): JSArray labels Slow {
   // Array#with does not preserve holes and always creates packed Arrays. Holes
   // in the source array-like are treated like any other element and the value
   // is computed with Get. So, there are only fast paths for packed elements.
@@ -55,8 +55,8 @@ transitioning builtin GenericArrayWith(
 
 // https://tc39.es/proposal-change-array-by-copy/#sec-array.prototype.with
 transitioning javascript builtin ArrayPrototypeWith(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    index: JSAny, value: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(index: JSAny,
+    value: JSAny): JSAny {
   // 1. Let O be ? ToObject(this value).
   const object: JSReceiver = ToObject_Inline(context, receiver);
 
diff --git a/deps/v8/src/builtins/array.tq b/deps/v8/src/builtins/array.tq
index 2ec4ab8f4e6eeb..a682274428f344 100644
--- a/deps/v8/src/builtins/array.tq
+++ b/deps/v8/src/builtins/array.tq
@@ -16,8 +16,8 @@ type FastSmiOrObjectElements extends ElementsKind;
 type FastDoubleElements extends ElementsKind;
 type DictionaryElements extends ElementsKind;
 
-macro EnsureWriteableFastElements(implicit context: Context)(array: JSArray):
-    void {
+macro EnsureWriteableFastElements(
+    implicit context: Context)(array: JSArray): void {
   dcheck(IsFastElementsKind(array.map.elements_kind));
 
   const elements: FixedArrayBase = array.elements;
@@ -33,13 +33,14 @@ macro EnsureWriteableFastElements(implicit context: Context)(array: JSArray):
   dcheck(array.elements.map != kCOWMap);
 }
 
-macro LoadElementOrUndefined(implicit context: Context)(
-    a: FixedArray, i: Smi): JSAny {
+macro LoadElementOrUndefined(
+    implicit context: Context)(a: FixedArray, i: Smi): JSAny {
   const e = UnsafeCast<(JSAny | TheHole)>(a.objects[i]);
   return ReplaceTheHoleWithUndefined(e);
 }
 
-macro LoadElementOrUndefined(a: FixedDoubleArray, i: Smi): NumberOrUndefined {
+macro LoadElementOrUndefined(a: FixedDoubleArray, i: Smi):
+    NumberOrUndefined {
   const f: float64 = a.floats[i].Value() otherwise return Undefined;
   return AllocateHeapNumberWithValue(f);
 }
@@ -52,7 +53,8 @@ macro StoreArrayHole(elements: FixedArray, k: Smi): void {
   elements.objects[k] = TheHole;
 }
 
-extern macro SetPropertyLength(implicit context: Context)(JSAny, Number): void;
+extern macro SetPropertyLength(implicit context: Context)(JSAny, Number):
+    void;
 
 const kLengthDescriptorIndex:
     constexpr int31 generates 'JSArray::kLengthDescriptorIndex';
@@ -80,8 +82,8 @@ macro EnsureArrayLengthWritable(implicit context: Context)(map: Map):
   }
 }
 
-macro CreateJSArrayWithElements(implicit context: Context)(array: FixedArray):
-    JSArray {
+macro CreateJSArrayWithElements(
+    implicit context: Context)(array: FixedArray): JSArray {
   const nativeContext: NativeContext = LoadNativeContext(context);
   const map: Map =
       LoadJSArrayElementsMap(ElementsKind::PACKED_ELEMENTS, nativeContext);
diff --git a/deps/v8/src/builtins/arraybuffer.tq b/deps/v8/src/builtins/arraybuffer.tq
index 3765e57d69e6fb..70d9ef914e840d 100644
--- a/deps/v8/src/builtins/arraybuffer.tq
+++ b/deps/v8/src/builtins/arraybuffer.tq
@@ -97,8 +97,7 @@ transitioning javascript builtin ArrayBufferPrototypeGetDetached(
 }
 
 // #sec-get-growablesharedarraybuffer.prototype.maxbytelength
-transitioning javascript builtin
-SharedArrayBufferPrototypeGetMaxByteLength(
+transitioning javascript builtin SharedArrayBufferPrototypeGetMaxByteLength(
     js-implicit context: NativeContext, receiver: JSAny)(): Number {
   // 1. Let O be the this value.
   // 2. Perform ? RequireInternalSlot(O, [[ArrayBufferData]]).
diff --git a/deps/v8/src/builtins/base.tq b/deps/v8/src/builtins/base.tq
index a6c8a1ba0f8fa0..4685c4b007bfe0 100644
--- a/deps/v8/src/builtins/base.tq
+++ b/deps/v8/src/builtins/base.tq
@@ -58,6 +58,8 @@ type TaggedZeroPattern extends TaggedIndex;
 // A value with the size of Tagged which may contain arbitrary data.
 type Uninitialized extends Tagged;
 
+type BuiltinsName extends int31 constexpr 'Builtin';
+
 extern macro MakeWeak(HeapObject): WeakHeapObject;
 extern macro GetHeapObjectAssumeWeak(MaybeObject): HeapObject labels IfCleared;
 extern macro GetHeapObjectIfStrong(MaybeObject): HeapObject labels IfNotStrong;
@@ -85,8 +87,8 @@ type PropertyKey = String|PublicSymbol;
 // https://tc39.es/ecma262/#sec-primitive-value.
 type JSPrimitive = Numeric|String|Symbol|Boolean|Null|Undefined;
 
-// A user-exposed JavaScript value, as opposed to V8-internal values like
-// TheHole or FixedArray.
+// A user-exposed JavaScript value, as opposed to V8-internal values like Holes
+// or a FixedArray.
 type JSAny = JSReceiver|JSPrimitive;
 
 type JSAnyNotNumeric = String|Symbol|Boolean|Null|Undefined|JSReceiver;
@@ -230,6 +232,11 @@ type RawPtr generates 'TNode<RawPtrT>' constexpr 'Address';
 type RawPtr<To: type> extends RawPtr;
 type ExternalPointer
     generates 'TNode<ExternalPointerT>' constexpr 'ExternalPointer_t';
+type IndirectPointer
+    generates 'TNode<IndirectPointerHandleT>'
+    constexpr 'IndirectPointerHandle';
+// TODO(saelo): implement accessors and type checkers for these fields.
+type IndirectPointer<To: type> extends IndirectPointer;
 extern class InstructionStream extends HeapObject;
 type BuiltinPtr extends Smi generates 'TNode<BuiltinPtr>';
 
@@ -342,21 +349,21 @@ const kFirstRabGsabFixedTypedArrayElementsKind: constexpr ElementsKind =
     ElementsKind::RAB_GSAB_UINT8_ELEMENTS;
 
 extern enum AllocationFlag extends int32
-constexpr 'CodeStubAssembler::AllocationFlag' {
+    constexpr 'CodeStubAssembler::AllocationFlag' {
   kNone,
   kDoubleAlignment,
-  kPretenured,
-  kAllowLargeObjectAllocation
+  kPretenured
 }
 
 extern enum SlackTrackingMode
-constexpr 'CodeStubAssembler::SlackTrackingMode' {
+    constexpr 'CodeStubAssembler::SlackTrackingMode' {
   kWithSlackTracking,
-  kNoSlackTracking
+  kNoSlackTracking,
+  kDontInitializeInObjectProperties
 }
 
 extern enum ExtractFixedArrayFlag
-constexpr 'CodeStubAssembler::ExtractFixedArrayFlag' {
+    constexpr 'CodeStubAssembler::ExtractFixedArrayFlag' {
   kFixedDoubleArrays,
   kAllFixedArrays,
   kFixedArrays,
@@ -441,6 +448,7 @@ extern enum MessageTemplate {
   kWasmTrapFuncSigMismatch,
   kWasmTrapDataSegmentOutOfBounds,
   kWasmTrapElementSegmentOutOfBounds,
+  kWasmTrapJSTypeError,
   kWasmTrapTableOutOfBounds,
   kWasmTrapRethrowNull,
   kWasmTrapNullDereference,
@@ -457,6 +465,11 @@ extern enum MessageTemplate {
   kObjectSetterCallable,
   kPropertyDescObject,
   kMustBePositive,
+  kIteratorReduceNoInitial,
+  kSizeIsNaN,
+  kArgumentIsNonObject,
+  kKeysMethodInvalid,
+  kGeneratorRunning,
   ...
 }
 
@@ -522,14 +535,9 @@ const kWasmArrayHeaderSize:
 const kHeapObjectHeaderSize:
     constexpr int32 generates 'HeapObject::kHeaderSize';
 
-type TheHole extends Oddball;
-type Null extends Oddball;
-type Undefined extends Oddball;
-type True extends Oddball;
-type False extends Oddball;
+type TheHole extends Hole;
 type Exception extends Oddball;
 type EmptyString extends String;
-type Boolean = True|False;
 
 type NumberOrUndefined = Number|Undefined;
 
@@ -537,9 +545,12 @@ extern macro DefaultStringConstant(): String;
 extern macro EmptyStringConstant(): EmptyString;
 extern macro ErrorsStringConstant(): String;
 extern macro FalseConstant(): False;
+extern macro GetStringConstant(): String;
+extern macro HasStringConstant(): String;
 extern macro Int32FalseConstant(): bool;
 extern macro Int32TrueConstant(): bool;
 extern macro IteratorSymbolConstant(): PublicSymbol;
+extern macro KeysStringConstant(): String;
 extern macro LengthStringConstant(): String;
 extern macro MatchSymbolConstant(): Symbol;
 extern macro MessageStringConstant(): String;
@@ -550,6 +561,7 @@ extern macro NullConstant(): Null;
 extern macro NumberStringConstant(): String;
 extern macro ReturnStringConstant(): String;
 extern macro SearchSymbolConstant(): Symbol;
+extern macro SizeStringConstant(): String;
 extern macro StringStringConstant(): String;
 extern macro TheHoleConstant(): TheHole;
 extern macro ToPrimitiveSymbolConstant(): PublicSymbol;
@@ -569,6 +581,9 @@ const kLengthString: String = LengthStringConstant();
 const kMessageString: String = MessageStringConstant();
 const kNextString: String = NextStringConstant();
 const kReturnString: String = ReturnStringConstant();
+const kSizeString: String = SizeStringConstant();
+const kHasString: String = HasStringConstant();
+const kKeysString: String = KeysStringConstant();
 
 const kNaN: NaN = NanConstant();
 const kZero: Zero = %RawDownCast<Zero>(SmiConstant(0));
@@ -586,8 +601,8 @@ const SKIP_WRITE_BARRIER:
 const UNSAFE_SKIP_WRITE_BARRIER:
     constexpr WriteBarrierMode generates 'UNSAFE_SKIP_WRITE_BARRIER';
 
-extern transitioning macro AllocateJSIteratorResult(implicit context: Context)(
-    JSAny, Boolean): JSObject;
+extern transitioning macro AllocateJSIteratorResult(
+    implicit context: Context)(JSAny, Boolean): JSObject;
 
 extern class Filler extends HeapObject generates 'TNode<HeapObject>';
 
@@ -623,6 +638,8 @@ extern macro SelectBooleanConstant(bool): Boolean;
 extern macro Print(constexpr string): void;
 extern macro Print(constexpr string, Object): void;
 extern macro Print(Object): void;
+extern macro Print(constexpr string, uintptr): void;
+extern macro Print(constexpr string, float64): void;
 extern macro PrintErr(constexpr string): void;
 extern macro PrintErr(constexpr string, Object): void;
 extern macro PrintErr(Object): void;
@@ -630,8 +647,8 @@ extern macro Comment(constexpr string): void;
 extern macro DebugBreak(): void;
 
 // ES6 7.1.4 ToInteger ( argument )
-transitioning macro ToIntegerImpl(implicit context: Context)(input: JSAny):
-    Number {
+transitioning macro ToIntegerImpl(
+    implicit context: Context)(input: JSAny): Number {
   let input = input;
 
   while (true) {
@@ -657,14 +674,14 @@ transitioning macro ToIntegerImpl(implicit context: Context)(input: JSAny):
   unreachable;
 }
 
-transitioning builtin ToInteger(implicit context: Context)(input: JSAny):
-    Number {
+transitioning builtin ToInteger(
+    implicit context: Context)(input: JSAny): Number {
   return ToIntegerImpl(input);
 }
 
 @export
-transitioning macro ToInteger_Inline(implicit context: Context)(input: JSAny):
-    Number {
+transitioning macro ToInteger_Inline(
+    implicit context: Context)(input: JSAny): Number {
   typeswitch (input) {
     case (s: Smi): {
       return s;
@@ -678,65 +695,75 @@ transitioning macro ToInteger_Inline(implicit context: Context)(input: JSAny):
 extern macro ToBigInt(Context, JSAny): BigInt;
 
 extern enum BigIntHandling extends int32
-constexpr 'CodeStubAssembler::BigIntHandling' { kConvertToNumber, kThrow }
-
-extern transitioning macro ToNumber(implicit context: Context)(
-    JSAny, constexpr BigIntHandling): Number;
-
-extern transitioning macro ToLength_Inline(implicit context: Context)(JSAny):
-    Number;
-extern transitioning macro ToNumber_Inline(implicit context: Context)(JSAny):
-    Number;
-extern transitioning macro ToString_Inline(implicit context: Context)(JSAny):
-    String;
-extern transitioning macro ToThisString(implicit context: Context)(
-    JSAny, String): String;
-extern transitioning macro ToThisValue(implicit context: Context)(
-    JSAny, constexpr PrimitiveType, constexpr string): JSAny;
-extern transitioning macro GetProperty(implicit context: Context)(
-    JSAny, JSAny): JSAny;
-extern transitioning builtin SetProperty(implicit context: Context)(
-    JSAny, JSAny, JSAny): JSAny;
+    constexpr 'CodeStubAssembler::BigIntHandling' { kConvertToNumber, kThrow }
+
+extern transitioning macro ToNumber(
+    implicit context: Context)(JSAny, constexpr BigIntHandling): Number;
+
+extern transitioning macro ToLength_Inline(
+    implicit context: Context)(JSAny): Number;
+extern transitioning macro ToNumber_Inline(
+    implicit context: Context)(JSAny): Number;
+extern transitioning macro ToString_Inline(
+    implicit context: Context)(JSAny): String;
+extern transitioning macro ToThisString(
+    implicit context: Context)(JSAny, String): String;
+extern transitioning macro ToThisValue(
+    implicit context: Context)(JSAny, constexpr PrimitiveType,
+    constexpr string): JSAny;
+extern transitioning macro GetProperty(
+    implicit context: Context)(JSAny, JSAny): JSAny;
+extern macro IsInterestingProperty(Name): bool;
+extern macro GetInterestingProperty(Context, JSReceiver, Name): JSAny
+    labels NotFound;
+extern transitioning builtin SetProperty(
+    implicit context: Context)(JSAny, JSAny, JSAny): JSAny;
 extern transitioning builtin SetPropertyIgnoreAttributes(
     implicit context: Context)(JSObject, String, JSAny, Smi): JSAny;
-extern transitioning builtin CreateDataProperty(implicit context: Context)(
-    JSAny, JSAny, JSAny): JSAny;
-extern transitioning builtin DeleteProperty(implicit context: Context)(
-    JSAny, JSAny | PrivateSymbol, LanguageModeSmi): Boolean;
-extern transitioning builtin HasProperty(implicit context: Context)(
-    JSAny, JSAny): Boolean;
-extern transitioning macro HasProperty_Inline(implicit context: Context)(
-    JSReceiver, JSAny): Boolean;
+extern transitioning builtin CreateDataProperty(
+    implicit context: Context)(JSAny, JSAny, JSAny): JSAny;
+extern transitioning builtin DeleteProperty(
+    implicit context: Context)(JSAny, JSAny|PrivateSymbol,
+    LanguageModeSmi): Boolean;
+extern transitioning builtin HasProperty(
+    implicit context: Context)(JSAny, JSAny): Boolean;
+extern transitioning macro HasProperty_Inline(
+    implicit context: Context)(JSReceiver, JSAny): Boolean;
 extern builtin LoadIC(
     Context, JSAny, JSAny, TaggedIndex, FeedbackVector): JSAny;
 
 extern macro SetPropertyStrict(Context, Object, Object, Object): Object;
 
-extern macro ThrowRangeError(implicit context: Context)(
-    constexpr MessageTemplate): never;
-extern macro ThrowRangeError(implicit context: Context)(
-    constexpr MessageTemplate, Object): never;
-extern macro ThrowRangeError(implicit context: Context)(
-    constexpr MessageTemplate, Object, Object): never;
-extern macro ThrowTypeError(implicit context: Context)(
-    constexpr MessageTemplate): never;
-extern macro ThrowTypeError(implicit context: Context)(
-    constexpr MessageTemplate, constexpr string): never;
-extern macro ThrowTypeError(implicit context: Context)(
-    constexpr MessageTemplate, Object): never;
-extern macro ThrowTypeError(implicit context: Context)(
-    constexpr MessageTemplate, Object, Object): never;
-extern macro ThrowTypeError(implicit context: Context)(
-    constexpr MessageTemplate, Object, Object, Object): never;
-extern transitioning runtime ThrowTypeErrorIfStrict(implicit context: Context)(
-    Smi, Object, Object): void;
-extern transitioning runtime ThrowIteratorError(implicit context: Context)(
-    JSAny): never;
-extern transitioning runtime ThrowCalledNonCallable(implicit context: Context)(
-    JSAny): never;
-
-extern transitioning macro ThrowIfNotJSReceiver(implicit context: Context)(
-    JSAny, constexpr MessageTemplate, constexpr string): void;
+extern macro ThrowRangeError(
+    implicit context: Context)(constexpr MessageTemplate): never;
+extern macro ThrowRangeError(
+    implicit context: Context)(constexpr MessageTemplate, Object): never;
+extern macro ThrowRangeError(
+    implicit context: Context)(constexpr MessageTemplate, Object,
+    Object): never;
+extern macro ThrowTypeError(
+    implicit context: Context)(constexpr MessageTemplate): never;
+extern macro ThrowTypeError(
+    implicit context: Context)(constexpr MessageTemplate,
+    constexpr string): never;
+extern macro ThrowTypeError(
+    implicit context: Context)(constexpr MessageTemplate, Object): never;
+extern macro ThrowTypeError(
+    implicit context: Context)(constexpr MessageTemplate, Object,
+    Object): never;
+extern macro ThrowTypeError(
+    implicit context: Context)(constexpr MessageTemplate, Object, Object,
+    Object): never;
+extern transitioning runtime ThrowTypeErrorIfStrict(
+    implicit context: Context)(Smi, Object, Object): void;
+extern transitioning runtime ThrowIteratorError(
+    implicit context: Context)(JSAny): never;
+extern transitioning runtime ThrowCalledNonCallable(
+    implicit context: Context)(JSAny): never;
+
+extern transitioning macro ThrowIfNotJSReceiver(
+    implicit context: Context)(JSAny, constexpr MessageTemplate,
+    constexpr string): void;
 
 extern macro TerminateExecution(implicit context: Context)(): never;
 
@@ -749,27 +776,38 @@ extern macro EnsureArrayPushable(implicit context: Context)(Map): ElementsKind
     labels Bailout;
 // TODO: Reduce duplication once varargs are supported in macros.
 extern macro Construct(implicit context: Context)(Constructor): JSReceiver;
-extern macro Construct(implicit context: Context)(
-    Constructor, JSAny): JSReceiver;
-extern macro Construct(implicit context: Context)(
-    Constructor, JSAny, JSAny): JSReceiver;
-extern macro Construct(implicit context: Context)(
-    Constructor, JSAny, JSAny, JSAny): JSReceiver;
-extern macro ConstructWithTarget(implicit context: Context)(
-    Constructor, JSReceiver): JSReceiver;
-extern macro ConstructWithTarget(implicit context: Context)(
-    Constructor, JSReceiver, JSAny): JSReceiver;
-extern macro SpeciesConstructor(implicit context: Context)(
-    JSAny, JSReceiver): JSReceiver;
+extern macro Construct(
+    implicit context: Context)(Constructor, JSAny): JSReceiver;
+extern macro Construct(
+    implicit context: Context)(Constructor, JSAny, JSAny): JSReceiver;
+extern macro Construct(
+    implicit context: Context)(Constructor, JSAny, JSAny, JSAny): JSReceiver;
+extern macro ConstructWithTarget(
+    implicit context: Context)(Constructor, JSReceiver): JSReceiver;
+extern macro ConstructWithTarget(
+    implicit context: Context)(Constructor, JSReceiver, JSAny): JSReceiver;
+extern macro SpeciesConstructor(
+    implicit context: Context)(JSAny, JSReceiver): JSReceiver;
 
 extern macro ConstructorBuiltinsAssembler::IsDictionaryMap(Map): bool;
 extern macro CodeStubAssembler::AllocateNameDictionary(constexpr int32):
     NameDictionary;
+extern macro CodeStubAssembler::AllocateNameDictionary(intptr): NameDictionary;
+extern macro CodeStubAssembler::AllocateNameDictionary(
+    intptr, constexpr AllocationFlag): NameDictionary;
 extern macro CodeStubAssembler::AllocateOrderedNameDictionary(constexpr int32):
     OrderedNameDictionary;
 extern macro CodeStubAssembler::AllocateSwissNameDictionary(constexpr int32):
     SwissNameDictionary;
 
+extern macro CodeStubAssembler::AddToDictionary(
+    NameDictionary, Name, Object): void labels Bailout;
+extern macro CodeStubAssembler::AddToDictionary(
+    SwissNameDictionary, Name, Object): void labels Bailout;
+
+extern macro AllocateOrderedHashSet(): OrderedHashSet;
+extern macro AllocateOrderedHashMap(): OrderedHashMap;
+
 extern builtin ToObject(Context, JSAny): JSReceiver;
 extern macro ToObject_Inline(Context, JSAny): JSReceiver;
 extern macro IsUndefined(Object): bool;
@@ -780,8 +818,8 @@ extern transitioning builtin NonPrimitiveToPrimitive_String(
 extern transitioning builtin NonPrimitiveToPrimitive_Default(
     Context, JSAny): JSPrimitive;
 
-transitioning macro ToPrimitiveDefault(implicit context: Context)(v: JSAny):
-    JSPrimitive {
+transitioning macro ToPrimitiveDefault(
+    implicit context: Context)(v: JSAny): JSPrimitive {
   typeswitch (v) {
     case (v: JSReceiver): {
       return NonPrimitiveToPrimitive_Default(context, v);
@@ -796,6 +834,8 @@ extern transitioning runtime NormalizeElements(Context, JSObject): void;
 extern transitioning runtime TransitionElementsKindWithKind(
     Context, JSObject, Smi): void;
 
+extern macro ArrayListElements(ArrayList): FixedArray;
+
 extern macro LoadObjectField(HeapObject, constexpr int32): Object;
 
 extern macro LoadBufferObject(RawPtr, constexpr int32): Object;
@@ -812,10 +852,10 @@ extern macro StringFromSingleCharCode(char16): String;
 
 extern macro NumberToString(Number): String;
 extern macro StringToNumber(String): Number;
-extern transitioning macro NonNumberToNumber(implicit context: Context)(
-    JSAnyNotNumber): Number;
-extern transitioning macro NonNumberToNumeric(implicit context: Context)(
-    JSAnyNotNumber): Numeric;
+extern transitioning macro NonNumberToNumber(
+    implicit context: Context)(JSAnyNotNumber): Number;
+extern transitioning macro NonNumberToNumeric(
+    implicit context: Context)(JSAnyNotNumber): Numeric;
 
 extern macro Equal(JSAny, JSAny, Context): Boolean;
 macro Equal(implicit context: Context)(left: JSAny, right: JSAny): Boolean {
@@ -826,7 +866,7 @@ extern macro StrictEqual(JSAny, JSAny): Boolean;
 extern macro SmiLexicographicCompare(Smi, Smi): Smi;
 
 extern runtime ReThrowWithMessage(
-    Context, JSAny, TheHole | JSMessageObject): never;
+    Context, JSAny, TheHole|JSMessageObject): never;
 extern runtime Throw(implicit context: Context)(JSAny): never;
 extern runtime ThrowInvalidStringLength(Context): never;
 
@@ -908,6 +948,7 @@ extern operator '>' macro Float64GreaterThan(float64, float64): bool;
 extern operator '>=' macro Float64GreaterThanOrEqual(float64, float64): bool;
 extern operator '<' macro Float64LessThan(float64, float64): bool;
 extern operator '<=' macro Float64LessThanOrEqual(float64, float64): bool;
+extern macro Float64AlmostEqual(float64, float64, constexpr float64): bool;
 
 extern macro BranchIfNumberEqual(Number, Number): never
     labels Taken, NotTaken;
@@ -943,11 +984,11 @@ macro Float64IsNaN(n: float64): bool {
 
 // The type of all tagged values that can safely be compared with TaggedEqual.
 @if(V8_ENABLE_WEBASSEMBLY)
-type TaggedWithIdentity = JSReceiver | FixedArrayBase | Oddball | Map |
-    WeakCell | Context | EmptyString | Symbol | WasmInternalFunction | WasmNull;
+  type TaggedWithIdentity = JSReceiver|FixedArrayBase|Oddball|Hole|Map|WeakCell|
+      Context|EmptyString|Symbol|WasmInternalFunction|WasmNull;
 @ifnot(V8_ENABLE_WEBASSEMBLY)
-type TaggedWithIdentity = JSReceiver | FixedArrayBase | Oddball | Map |
-    WeakCell | Context | EmptyString | Symbol;
+  type TaggedWithIdentity = JSReceiver|FixedArrayBase|Oddball|Hole|Map|WeakCell|
+      Context|EmptyString|Symbol;
 
 extern operator '==' macro TaggedEqual(TaggedWithIdentity, Object): bool;
 extern operator '==' macro TaggedEqual(Object, TaggedWithIdentity): bool;
@@ -1021,16 +1062,15 @@ extern operator '%' macro Int32Mod(int32, int32): int32;
 extern operator '%' macro Uint32Mod(uint32, uint32): uint32;
 extern operator '&' macro Word32And(int32, int32): int32;
 extern operator '&' macro Word32And(uint32, uint32): uint32;
-extern operator '==' macro
-ConstexprInt31Equal(constexpr int31, constexpr int31): constexpr bool;
-extern operator '!=' macro
-ConstexprInt31NotEqual(constexpr int31, constexpr int31): constexpr bool;
-extern operator '==' macro
-ConstexprUint32Equal(constexpr uint32, constexpr uint32): constexpr bool;
-extern operator '!=' macro
-ConstexprUint32NotEqual(constexpr uint32, constexpr uint32): constexpr bool;
-extern operator '>=' macro
-ConstexprInt31GreaterThanEqual(
+extern operator '==' macro ConstexprInt31Equal(
+    constexpr int31, constexpr int31): constexpr bool;
+extern operator '!=' macro ConstexprInt31NotEqual(
+    constexpr int31, constexpr int31): constexpr bool;
+extern operator '==' macro ConstexprUint32Equal(
+    constexpr uint32, constexpr uint32): constexpr bool;
+extern operator '!=' macro ConstexprUint32NotEqual(
+    constexpr uint32, constexpr uint32): constexpr bool;
+extern operator '>=' macro ConstexprInt31GreaterThanEqual(
     constexpr int31, constexpr int31): constexpr bool;
 extern operator '==' macro ConstexprInt32Equal(
     constexpr int32, constexpr int32): constexpr bool;
@@ -1147,8 +1187,7 @@ extern operator '!' macro ConstexprBoolNot(constexpr bool): constexpr bool;
 extern operator '!' macro Word32BinaryNot(bool): bool;
 extern operator '!' macro IsFalse(Boolean): bool;
 
-extern operator '==' macro
-ConstexprInt31Equal(
+extern operator '==' macro ConstexprInt31Equal(
     constexpr InstanceType, constexpr InstanceType): constexpr bool;
 extern operator '-' macro ConstexprUint32Sub(
     constexpr InstanceType, constexpr InstanceType): constexpr int32;
@@ -1170,10 +1209,10 @@ operator '.length_uintptr' macro LoadStringLengthAsUintPtr(s: String): uintptr {
 extern operator '.length_uint32' macro LoadStringLengthAsWord32(String): uint32;
 extern operator '.length_smi' macro LoadStringLengthAsSmi(String): Smi;
 
-extern builtin StringAdd_CheckNone(implicit context: Context)(
-    String, String): String;
-operator '+' macro StringAdd(implicit context: Context)(
-    a: String, b: String): String {
+extern builtin StringAdd_CheckNone(
+    implicit context: Context)(String, String): String;
+operator '+' macro StringAdd(
+    implicit context: Context)(a: String, b: String): String {
   return StringAdd_CheckNone(a, b);
 }
 
@@ -1233,24 +1272,27 @@ extern macro SmiToTaggedIndex(Smi): TaggedIndex;
 extern macro RoundIntPtrToFloat64(intptr): float64;
 extern macro IntPtrRoundUpToPowerOfTwo32(intptr): intptr;
 extern macro ChangeFloat32ToFloat64(float32): float64;
+extern macro RoundInt32ToFloat32(int32): float32;
 extern macro ChangeNumberToFloat64(Number): float64;
 extern macro ChangeNumberToUint32(Number): uint32;
-extern macro ChangeTaggedNonSmiToInt32(implicit context: Context)(JSAnyNotSmi):
-    int32;
+extern macro ChangeTaggedNonSmiToInt32(
+    implicit context: Context)(HeapObject): int32;
+extern macro ChangeFloat32ToTagged(float32): Number;
 extern macro ChangeTaggedToFloat64(implicit context: Context)(JSAny): float64;
 extern macro ChangeFloat64ToTagged(float64): Number;
 extern macro ChangeFloat64ToUintPtr(float64): uintptr;
 extern macro ChangeFloat64ToIntPtr(float64): intptr;
 extern macro ChangeBoolToInt32(bool): int32;
 extern macro ChangeInt32ToFloat64(int32): float64;
-extern macro ChangeInt32ToIntPtr(int32): intptr;    // Sign-extends.
-extern macro ChangeUint32ToWord(uint32): uintptr;   // Doesn't sign-extend.
-extern macro ChangeInt32ToInt64(int32): int64;      // Sign-extends.
+extern macro ChangeInt32ToIntPtr(int32): intptr;  // Sign-extends.
+extern macro ChangeUint32ToWord(uint32): uintptr;  // Doesn't sign-extend.
+extern macro ChangeInt32ToInt64(int32): int64;  // Sign-extends.
 extern macro ChangeUint32ToUint64(uint32): uint64;  // Doesn't sign-extend.
 extern macro LoadNativeContext(Context): NativeContext;
 extern macro TruncateFloat64ToFloat32(float64): float32;
 extern macro TruncateHeapNumberValueToWord32(HeapNumber): int32;
-extern macro LoadJSArrayElementsMap(constexpr ElementsKind, NativeContext): Map;
+extern macro LoadJSArrayElementsMap(
+    constexpr ElementsKind, NativeContext): Map;
 extern macro LoadJSArrayElementsMap(ElementsKind, NativeContext): Map;
 extern macro NumberConstant(constexpr float64): Number;
 extern macro NumberConstant(constexpr int32): Number;
@@ -1291,6 +1333,7 @@ extern macro BitcastWordToTaggedSigned(intptr): Smi;
 extern macro BitcastWordToTaggedSigned(uintptr): Smi;
 extern macro BitcastWordToTagged(intptr): Object;
 extern macro BitcastWordToTagged(uintptr): Object;
+extern macro BitcastWordToTagged(RawPtr): Object;
 extern macro BitcastTaggedToWord(Object): intptr;
 extern macro BitcastTaggedToWordForTagAndSmiBits(Tagged): intptr;
 
@@ -1300,8 +1343,8 @@ extern macro FixedCOWArrayMapConstant(): Map;
 extern macro EmptyByteArrayConstant(): ByteArray;
 extern macro EmptyFixedArrayConstant(): EmptyFixedArray;
 extern macro PromiseCapabilityMapConstant(): Map;
-extern macro OneByteStringMapConstant(): Map;
-extern macro StringMapConstant(): Map;
+extern macro SeqOneByteStringMapConstant(): Map;
+extern macro SeqTwoByteStringMapConstant(): Map;
 
 const kFixedArrayMap: Map = FixedArrayMapConstant();
 const kFixedDoubleArrayMap: Map = FixedDoubleArrayMapConstant();
@@ -1310,9 +1353,9 @@ const kEmptyByteArray: ByteArray = EmptyByteArrayConstant();
 const kEmptyFixedArray: EmptyFixedArray = EmptyFixedArrayConstant();
 const kPromiseCapabilityMap: Map = PromiseCapabilityMapConstant();
 // The map of a non-internalized internal SeqOneByteString.
-const kOneByteStringMap: Map = OneByteStringMapConstant();
+const kSeqOneByteStringMap: Map = SeqOneByteStringMapConstant();
 // The map of a non-internalized internal SeqTwoByteString.
-const kStringMap: Map = StringMapConstant();
+const kSeqTwoByteStringMap: Map = SeqTwoByteStringMapConstant();
 
 macro OutOfBounds<T: type, X: type>(index: T, length: X): bool {
   return UintPtrGreaterThanOrEqual(
@@ -1320,8 +1363,8 @@ macro OutOfBounds<T: type, X: type>(index: T, length: X): bool {
       Convert<uintptr>(Convert<intptr>(length)));
 }
 
-extern macro IsPrototypeInitialArrayPrototype(implicit context: Context)(Map):
-    bool;
+extern macro IsPrototypeInitialArrayPrototype(
+    implicit context: Context)(Map): bool;
 extern macro IsNoElementsProtectorCellInvalid(): bool;
 extern macro IsArrayIteratorProtectorCellInvalid(): bool;
 extern macro IsArraySpeciesProtectorCellInvalid(): bool;
@@ -1330,8 +1373,10 @@ extern macro IsTypedArraySpeciesProtectorCellInvalid(): bool;
 extern macro IsPromiseSpeciesProtectorCellInvalid(): bool;
 extern macro IsMockArrayBufferAllocatorFlag(): bool;
 extern macro HasBuiltinSubclassingFlag(): bool;
-extern macro IsPrototypeTypedArrayPrototype(implicit context: Context)(Map):
-    bool;
+extern macro IsPrototypeTypedArrayPrototype(
+    implicit context: Context)(Map): bool;
+extern macro IsSetIteratorProtectorCellInvalid(): bool;
+extern macro IsMapIteratorProtectorCellInvalid(): bool;
 
 extern operator '.data_ptr' macro LoadJSTypedArrayDataPtr(JSTypedArray): RawPtr;
 
@@ -1495,8 +1540,8 @@ macro ToBoolean(obj: JSAny): bool {
 }
 
 @export
-macro RequireObjectCoercible(implicit context: Context)(
-    value: JSAny, name: constexpr string): JSAny {
+macro RequireObjectCoercible(
+    implicit context: Context)(value: JSAny, name: constexpr string): JSAny {
   if (IsNullOrUndefined(value)) {
     ThrowTypeError(MessageTemplate::kCalledOnNullOrUndefined, name);
   }
@@ -1641,8 +1686,8 @@ transitioning macro ToUintPtr(implicit context: Context)(value: JSAny):
 // We can do this because all callers do a range checks against uintptr length
 // anyway and throw a RangeError in case of out-of-bounds index.
 @export
-transitioning macro ToIndex(implicit context: Context)(value: JSAny):
-    uintptr labels IfRangeError {
+transitioning macro ToIndex(
+    implicit context: Context)(value: JSAny): uintptr labels IfRangeError {
   if (value == Undefined) return 0;
   const indexNumber = ToInteger_Inline(value);
   // Less than 0 case, uintptr range overflow and safe integer range overflow
@@ -1651,8 +1696,8 @@ transitioning macro ToIndex(implicit context: Context)(value: JSAny):
       otherwise IfRangeError, IfRangeError, IfRangeError;
 }
 
-transitioning macro GetLengthProperty(implicit context: Context)(o: JSAny):
-    Number {
+transitioning macro GetLengthProperty(
+    implicit context: Context)(o: JSAny): Number {
   try {
     typeswitch (o) {
       case (a: JSArray): {
@@ -1673,9 +1718,13 @@ transitioning macro GetLengthProperty(implicit context: Context)(o: JSAny):
   }
 }
 
-transitioning macro GetMethod(implicit context: Context)(
-    o: JSAny, name: AnyName): Callable labels IfNullOrUndefined,
+transitioning macro GetMethod(
+    implicit context: Context)(o: JSAny, name: AnyName):
+    Callable labels IfNullOrUndefined,
     IfMethodNotCallable(JSAny) {
+  // Use GetInterestingMethod - a version of GetMethod optimized for interesting
+  // properties.
+  dcheck(!IsInterestingProperty(name));
   const value = GetProperty(o, name);
   // TODO(v8:9933): Consider checking for null/undefined after checking for
   // callable because the latter seems to be more common.
@@ -1684,8 +1733,12 @@ transitioning macro GetMethod(implicit context: Context)(
       otherwise goto IfMethodNotCallable(value);
 }
 
-transitioning macro GetMethod(implicit context: Context)(
-    o: JSAny, name: String): Callable labels IfNullOrUndefined {
+transitioning macro GetMethod(
+    implicit context: Context)(o: JSAny,
+    name: String): Callable labels IfNullOrUndefined {
+  // Use GetInterestingMethod - a version of GetMethod optimized for interesting
+  // properties.
+  dcheck(!IsInterestingProperty(name));
   try {
     return GetMethod(o, name) otherwise IfNullOrUndefined, IfMethodNotCallable;
   } label IfMethodNotCallable(value: JSAny) deferred {
@@ -1693,13 +1746,18 @@ transitioning macro GetMethod(implicit context: Context)(
   }
 }
 
-transitioning macro GetMethod(implicit context: Context)(
-    o: JSAny, name: constexpr string): Callable labels IfNullOrUndefined {
+transitioning macro GetMethod(
+    implicit context: Context)(o: JSAny,
+    name: constexpr string): Callable labels IfNullOrUndefined {
   return GetMethod(o, StringConstant(name)) otherwise IfNullOrUndefined;
 }
 
-transitioning macro GetMethod(implicit context: Context)(
-    o: JSAny, symbol: Symbol): Callable labels IfNullOrUndefined {
+transitioning macro GetMethod(
+    implicit context: Context)(o: JSAny,
+    symbol: Symbol): Callable labels IfNullOrUndefined {
+  // Use GetInterestingMethod - a version of GetMethod optimized for interesting
+  // properties.
+  dcheck(!IsInterestingProperty(symbol));
   const value = GetProperty(o, symbol);
   if (value == Undefined || value == Null) goto IfNullOrUndefined;
   return Cast<Callable>(value)
@@ -1707,13 +1765,28 @@ transitioning macro GetMethod(implicit context: Context)(
       MessageTemplate::kPropertyNotFunction, value, symbol, o);
 }
 
+transitioning macro GetInterestingMethod(
+    implicit context: Context)(o: JSReceiver,
+    name: String): Callable labels IfNullOrUndefined {
+  dcheck(IsInterestingProperty(name));
+  try {
+    const value = GetInterestingProperty(context, o, name)
+        otherwise goto IfNullOrUndefined;
+    if (value == Undefined || value == Null) goto IfNullOrUndefined;
+    return Cast<Callable>(value)
+        otherwise goto IfMethodNotCallable(value);
+  } label IfMethodNotCallable(value: JSAny) deferred {
+    ThrowTypeError(MessageTemplate::kPropertyNotFunction, value, name, o);
+  }
+}
+
 extern macro IsOneByteStringInstanceType(InstanceType): bool;
 
 // After converting an index to an integer, calculate a relative index:
 // return index < 0 ? max(length + index, 0) : min(index, length)
 @export
-transitioning macro ConvertAndClampRelativeIndex(implicit context: Context)(
-    index: JSAny, length: uintptr): uintptr {
+transitioning macro ConvertAndClampRelativeIndex(
+    implicit context: Context)(index: JSAny, length: uintptr): uintptr {
   const indexNumber: Number = ToInteger_Inline(index);
   return ConvertAndClampRelativeIndex(indexNumber, length);
 }
@@ -1721,8 +1794,8 @@ transitioning macro ConvertAndClampRelativeIndex(implicit context: Context)(
 // Calculate a relative index:
 // return index < 0 ? max(length + index, 0) : min(index, length)
 @export
-macro ConvertAndClampRelativeIndex(indexNumber: Number, length: uintptr):
-    uintptr {
+macro ConvertAndClampRelativeIndex(
+    indexNumber: Number, length: uintptr): uintptr {
   try {
     return ConvertRelativeIndex(indexNumber, length) otherwise OutOfBoundsLow,
            OutOfBoundsHigh;
@@ -1780,8 +1853,8 @@ macro ConvertRelativeIndex(indexNumber: Number, length: uintptr):
 // range [0, limit]:
 // return min(max(index, 0), limit)
 @export
-transitioning macro ClampToIndexRange(implicit context: Context)(
-    index: JSAny, limit: uintptr): uintptr {
+transitioning macro ClampToIndexRange(
+    implicit context: Context)(index: JSAny, limit: uintptr): uintptr {
   const indexNumber: Number = ToInteger_Inline(index);
   return ClampToIndexRange(indexNumber, limit);
 }
@@ -1862,25 +1935,27 @@ macro IsFastJSArrayWithNoCustomIteration(context: Context, o: Object): bool {
 }
 
 @export
-macro IsFastJSArrayForReadWithNoCustomIteration(context: Context, o: Object):
-    bool {
+macro IsFastJSArrayForReadWithNoCustomIteration(
+    context: Context, o: Object): bool {
   return Is<FastJSArrayForReadWithNoCustomIteration>(o);
 }
 
-extern transitioning runtime
-CreateDataProperty(implicit context: Context)(JSReceiver, JSAny, JSAny): void;
+extern transitioning runtime CreateDataProperty(
+    implicit context: Context)(JSReceiver, JSAny, JSAny): void;
 
 extern transitioning runtime SetOwnPropertyIgnoreAttributes(
     implicit context: Context)(JSObject, String, JSAny, Smi): void;
 
 namespace runtime {
-extern runtime
-GetDerivedMap(Context, JSFunction, JSReceiver, JSAny): Map;
+extern runtime GetDerivedMap(Context, JSFunction, JSReceiver, JSAny): Map;
 }
 extern macro IsDeprecatedMap(Map): bool;
 
-transitioning builtin FastCreateDataProperty(implicit context: Context)(
-    receiver: JSReceiver, key: JSAny, value: JSAny): Object {
+extern macro LoadSlowObjectWithNullPrototypeMap(NativeContext): Map;
+
+transitioning builtin FastCreateDataProperty(
+    implicit context: Context)(receiver: JSReceiver, key: JSAny,
+    value: JSAny): Object {
   try {
     const array = Cast<FastJSArray>(receiver) otherwise Slow;
     const index: Smi = Cast<Smi>(key) otherwise goto Slow;
@@ -1973,29 +2048,6 @@ macro NumberIsSomeInfinity(n: Number): bool {
   }
 }
 
-// Assert that the objects satisfy SameValue or are both the hole.
-builtin CheckSameObject(implicit context: Context)(
-    lhs: Object, rhs: Object): Undefined {
-  typeswitch (lhs) {
-    case (TheHole): {
-      if (rhs == TheHole) return Undefined;
-    }
-    case (a: JSAny): {
-      typeswitch (rhs) {
-        case (b: JSAny): {
-          if (SameValue(a, b)) return Undefined;
-        }
-        case (Object): {
-        }
-      }
-    }
-    case (Object): {
-    }
-  }
-  Print('Distinct or unexpected values in CheckSameObject');
-  unreachable;
-}
-
 macro ReplaceTheHoleWithUndefined(o: JSAny|TheHole): JSAny {
   typeswitch (o) {
     case (TheHole): {
@@ -2047,6 +2099,8 @@ const kNoHashSentinel:
     constexpr int32 generates 'PropertyArray::kNoHashSentinel';
 extern macro LoadNameHash(Name): uint32;
 
+extern transitioning builtin ToName(implicit context: Context)(JSAny): AnyName;
+
 extern macro LoadSimd128(intptr): Simd128;
 extern macro I8x16BitMask(I8X16): int32;
 extern macro I8x16Eq(I8X16, I8X16): I8X16;
diff --git a/deps/v8/src/builtins/boolean.tq b/deps/v8/src/builtins/boolean.tq
index 40a011d4e09e59..b2fa2f1db3df0b 100644
--- a/deps/v8/src/builtins/boolean.tq
+++ b/deps/v8/src/builtins/boolean.tq
@@ -3,14 +3,14 @@
 // found in the LICENSE file.
 
 namespace boolean {
-transitioning macro ThisBooleanValue(implicit context: Context)(
-    receiver: JSAny, method: constexpr string): Boolean {
+transitioning macro ThisBooleanValue(
+    implicit context: Context)(receiver: JSAny,
+    method: constexpr string): Boolean {
   return UnsafeCast<Boolean>(
       ToThisValue(receiver, PrimitiveType::kBoolean, method));
 }
 
-javascript builtin
-BooleanConstructor(
+javascript builtin BooleanConstructor(
     js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny,
     target: JSFunction)(...arguments): JSAny {
   const value = SelectBooleanConstant(ToBoolean(arguments[0]));
diff --git a/deps/v8/src/builtins/builtins-api.cc b/deps/v8/src/builtins/builtins-api.cc
index ac4083df59b6ca..d77df638f0d4d6 100644
--- a/deps/v8/src/builtins/builtins-api.cc
+++ b/deps/v8/src/builtins/builtins-api.cc
@@ -23,27 +23,29 @@ namespace {
 // Returns the holder JSObject if the function can legally be called with this
 // receiver.  Returns nullptr if the call is illegal.
 // TODO(dcarney): CallOptimization duplicates this logic, merge.
-JSReceiver GetCompatibleReceiver(Isolate* isolate, FunctionTemplateInfo info,
-                                 JSReceiver receiver) {
+Tagged<JSReceiver> GetCompatibleReceiver(Isolate* isolate,
+                                         Tagged<FunctionTemplateInfo> info,
+                                         Tagged<JSReceiver> receiver) {
   RCS_SCOPE(isolate, RuntimeCallCounterId::kGetCompatibleReceiver);
-  Object recv_type = info.signature();
+  Tagged<Object> recv_type = info->signature();
   // No signature, return holder.
-  if (!recv_type.IsFunctionTemplateInfo()) return receiver;
+  if (!IsFunctionTemplateInfo(recv_type)) return receiver;
   // A Proxy cannot have been created from the signature template.
-  if (!receiver.IsJSObject()) return JSReceiver();
+  if (!IsJSObject(receiver)) return JSReceiver();
 
-  JSObject js_obj_receiver = JSObject::cast(receiver);
-  FunctionTemplateInfo signature = FunctionTemplateInfo::cast(recv_type);
+  Tagged<JSObject> js_obj_receiver = JSObject::cast(receiver);
+  Tagged<FunctionTemplateInfo> signature =
+      FunctionTemplateInfo::cast(recv_type);
 
   // Check the receiver.
-  if (signature.IsTemplateFor(js_obj_receiver)) return receiver;
+  if (signature->IsTemplateFor(js_obj_receiver)) return receiver;
 
   // The JSGlobalProxy might have a hidden prototype.
-  if (V8_UNLIKELY(js_obj_receiver.IsJSGlobalProxy())) {
-    HeapObject prototype = js_obj_receiver.map().prototype();
-    if (!prototype.IsNull(isolate)) {
-      JSObject js_obj_prototype = JSObject::cast(prototype);
-      if (signature.IsTemplateFor(js_obj_prototype)) return js_obj_prototype;
+  if (V8_UNLIKELY(IsJSGlobalProxy(js_obj_receiver))) {
+    Tagged<HeapObject> prototype = js_obj_receiver->map()->prototype();
+    if (!IsNull(prototype, isolate)) {
+      Tagged<JSObject> js_obj_prototype = JSObject::cast(prototype);
+      if (signature->IsTemplateFor(js_obj_prototype)) return js_obj_prototype;
     }
   }
   return JSReceiver();
@@ -58,10 +60,10 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> HandleApiCallHelper(
     Handle<FunctionTemplateInfo> fun_data, Handle<Object> receiver,
     Address* argv, int argc) {
   Handle<JSReceiver> js_receiver;
-  JSReceiver raw_holder;
+  Tagged<JSReceiver> raw_holder;
   if (is_construct) {
-    DCHECK(receiver->IsTheHole(isolate));
-    if (fun_data->GetInstanceTemplate().IsUndefined(isolate)) {
+    DCHECK(IsTheHole(*receiver, isolate));
+    if (IsUndefined(fun_data->GetInstanceTemplate(), isolate)) {
       v8::Local<ObjectTemplate> templ =
           ObjectTemplate::New(reinterpret_cast<v8::Isolate*>(isolate),
                               ToApiHandle<v8::FunctionTemplate>(fun_data));
@@ -78,18 +80,17 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> HandleApiCallHelper(
     argv[BuiltinArguments::kReceiverArgsOffset] = js_receiver->ptr();
     raw_holder = *js_receiver;
   } else {
-    DCHECK(receiver->IsJSReceiver());
+    DCHECK(IsJSReceiver(*receiver));
     js_receiver = Handle<JSReceiver>::cast(receiver);
 
-    if (!fun_data->accept_any_receiver() &&
-        js_receiver->IsAccessCheckNeeded()) {
+    if (!fun_data->accept_any_receiver() && IsAccessCheckNeeded(*js_receiver)) {
       // Proxies never need access checks.
-      DCHECK(js_receiver->IsJSObject());
+      DCHECK(IsJSObject(*js_receiver));
       Handle<JSObject> js_object = Handle<JSObject>::cast(js_receiver);
-      if (!isolate->MayAccess(handle(isolate->context(), isolate), js_object)) {
-        isolate->ReportFailedAccessCheck(js_object);
-        RETURN_EXCEPTION_IF_SCHEDULED_EXCEPTION(isolate, Object);
-        return isolate->factory()->undefined_value();
+      if (!isolate->MayAccess(isolate->native_context(), js_object)) {
+        RETURN_ON_EXCEPTION(
+            isolate, isolate->ReportFailedAccessCheck(js_object), Object);
+        UNREACHABLE();
       }
     }
 
@@ -102,11 +103,11 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> HandleApiCallHelper(
     }
   }
 
-  Object raw_call_data = fun_data->call_code(kAcquireLoad);
-  if (!raw_call_data.IsUndefined(isolate)) {
-    DCHECK(raw_call_data.IsCallHandlerInfo());
-    CallHandlerInfo call_data = CallHandlerInfo::cast(raw_call_data);
-    Object data_obj = call_data.data();
+  Tagged<Object> raw_call_data = fun_data->call_code(kAcquireLoad);
+  if (!IsUndefined(raw_call_data, isolate)) {
+    DCHECK(IsCallHandlerInfo(raw_call_data));
+    Tagged<CallHandlerInfo> call_data = CallHandlerInfo::cast(raw_call_data);
+    Tagged<Object> data_obj = call_data->data();
 
     FunctionCallbackArguments custom(isolate, data_obj, raw_holder, *new_target,
                                      argv, argc);
@@ -120,9 +121,9 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> HandleApiCallHelper(
     // Rebox the result.
     {
       DisallowGarbageCollection no_gc;
-      Object raw_result = *result;
-      DCHECK(raw_result.IsApiCallResultType());
-      if (!is_construct || raw_result.IsJSReceiver())
+      Tagged<Object> raw_result = *result;
+      DCHECK(IsApiCallResultType(raw_result));
+      if (!is_construct || IsJSReceiver(raw_result))
         return handle(raw_result, isolate);
     }
   }
@@ -132,23 +133,18 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> HandleApiCallHelper(
 
 }  // anonymous namespace
 
-BUILTIN(HandleApiCall) {
+BUILTIN(HandleApiConstruct) {
   HandleScope scope(isolate);
   Handle<Object> receiver = args.receiver();
   Handle<HeapObject> new_target = args.new_target();
+  DCHECK(!IsUndefined(*new_target, isolate));
   Handle<FunctionTemplateInfo> fun_data(
-      args.target()->shared().get_api_func_data(), isolate);
+      args.target()->shared()->api_func_data(), isolate);
   int argc = args.length() - 1;
   Address* argv = args.address_of_first_argument();
-  if (new_target->IsUndefined()) {
-    RETURN_RESULT_OR_FAILURE(
-        isolate, HandleApiCallHelper<false>(isolate, new_target, fun_data,
-                                            receiver, argv, argc));
-  } else {
-    RETURN_RESULT_OR_FAILURE(
-        isolate, HandleApiCallHelper<true>(isolate, new_target, fun_data,
-                                           receiver, argv, argc));
-  }
+  RETURN_RESULT_OR_FAILURE(
+      isolate, HandleApiCallHelper<true>(isolate, new_target, fun_data,
+                                         receiver, argv, argc));
 }
 
 namespace {
@@ -183,19 +179,19 @@ MaybeHandle<Object> Builtins::InvokeApiFunction(
   RCS_SCOPE(isolate, RuntimeCallCounterId::kInvokeApiFunction);
 
   // Do proper receiver conversion for non-strict mode api functions.
-  if (!is_construct && !receiver->IsJSReceiver()) {
+  if (!is_construct && !IsJSReceiver(*receiver)) {
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, receiver, Object::ConvertReceiver(isolate, receiver), Object);
   }
 
   // We assume that all lazy accessor pairs have been instantiated when setting
   // a break point on any API function.
-  DCHECK(!Handle<FunctionTemplateInfo>::cast(function)->BreakAtEntry());
+  DCHECK(!Handle<FunctionTemplateInfo>::cast(function)->BreakAtEntry(isolate));
 
   base::SmallVector<Address, 32> argv(argc + 1);
-  argv[0] = receiver->ptr();
+  argv[0] = (*receiver).ptr();
   for (int i = 0; i < argc; ++i) {
-    argv[i + 1] = args[i]->ptr();
+    argv[i + 1] = (*args[i]).ptr();
   }
 
   RelocatableArguments arguments(isolate, argv.size(), argv.data());
@@ -210,15 +206,17 @@ MaybeHandle<Object> Builtins::InvokeApiFunction(
 // Helper function to handle calls to non-function objects created through the
 // API. The object can be called as either a constructor (using new) or just as
 // a function (without new).
-V8_WARN_UNUSED_RESULT static Object HandleApiCallAsFunctionOrConstructor(
-    Isolate* isolate, bool is_construct_call, BuiltinArguments args) {
+V8_WARN_UNUSED_RESULT static Tagged<Object>
+HandleApiCallAsFunctionOrConstructorDelegate(Isolate* isolate,
+                                             bool is_construct_call,
+                                             BuiltinArguments args) {
   Handle<Object> receiver = args.receiver();
 
   // Get the object called.
-  JSObject obj = JSObject::cast(*receiver);
+  Tagged<JSObject> obj = JSObject::cast(*receiver);
 
   // Set the new target.
-  HeapObject new_target;
+  Tagged<HeapObject> new_target;
   if (is_construct_call) {
     // TODO(adamk): This should be passed through in args instead of
     // being patched in here. We need to set a non-undefined value
@@ -231,21 +229,22 @@ V8_WARN_UNUSED_RESULT static Object HandleApiCallAsFunctionOrConstructor(
 
   // Get the invocation callback from the function descriptor that was
   // used to create the called object.
-  DCHECK(obj.map().is_callable());
-  JSFunction constructor = JSFunction::cast(obj.map().GetConstructor());
-  DCHECK(constructor.shared().IsApiFunction());
-  Object handler =
-      constructor.shared().get_api_func_data().GetInstanceCallHandler();
-  DCHECK(!handler.IsUndefined(isolate));
-  CallHandlerInfo call_data = CallHandlerInfo::cast(handler);
+  DCHECK(obj->map()->is_callable());
+  Tagged<JSFunction> constructor =
+      JSFunction::cast(obj->map()->GetConstructor());
+  DCHECK(constructor->shared()->IsApiFunction());
+  Tagged<Object> handler =
+      constructor->shared()->api_func_data()->GetInstanceCallHandler();
+  DCHECK(!IsUndefined(handler, isolate));
+  Tagged<CallHandlerInfo> call_data = CallHandlerInfo::cast(handler);
 
   // Get the data for the call and perform the callback.
-  Object result;
+  Tagged<Object> result;
   {
     HandleScope scope(isolate);
-    FunctionCallbackArguments custom(isolate, call_data.data(), obj, new_target,
-                                     args.address_of_first_argument(),
-                                     args.length() - 1);
+    FunctionCallbackArguments custom(
+        isolate, call_data->data(), obj, new_target,
+        args.address_of_first_argument(), args.length() - 1);
     Handle<Object> result_handle = custom.Call(call_data);
     if (result_handle.is_null()) {
       result = ReadOnlyRoots(isolate).undefined_value();
@@ -260,14 +259,14 @@ V8_WARN_UNUSED_RESULT static Object HandleApiCallAsFunctionOrConstructor(
 
 // Handle calls to non-function objects created through the API. This delegate
 // function is used when the call is a normal function call.
-BUILTIN(HandleApiCallAsFunction) {
-  return HandleApiCallAsFunctionOrConstructor(isolate, false, args);
+BUILTIN(HandleApiCallAsFunctionDelegate) {
+  return HandleApiCallAsFunctionOrConstructorDelegate(isolate, false, args);
 }
 
 // Handle calls to non-function objects created through the API. This delegate
 // function is used when the call is a construct call.
-BUILTIN(HandleApiCallAsConstructor) {
-  return HandleApiCallAsFunctionOrConstructor(isolate, true, args);
+BUILTIN(HandleApiCallAsConstructorDelegate) {
+  return HandleApiCallAsFunctionOrConstructorDelegate(isolate, true, args);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/builtins/builtins-array-gen.cc b/deps/v8/src/builtins/builtins-array-gen.cc
index 011c7808d08167..b1eae115ee760a 100644
--- a/deps/v8/src/builtins/builtins-array-gen.cc
+++ b/deps/v8/src/builtins/builtins-array-gen.cc
@@ -38,7 +38,19 @@ void ArrayBuiltinsAssembler::TypedArrayMapResultGenerator() {
       context(), method_name, original_array, len());
   // In the Spec and our current implementation, the length check is already
   // performed in TypedArraySpeciesCreate.
-  CSA_DCHECK(this, UintPtrLessThanOrEqual(len(), LoadJSTypedArrayLength(a)));
+#ifdef DEBUG
+  Label detached_or_out_of_bounds(this), done(this);
+  CSA_DCHECK(this, UintPtrLessThanOrEqual(
+                       len(), LoadJSTypedArrayLengthAndCheckDetached(
+                                  a, &detached_or_out_of_bounds)));
+  Goto(&done);
+  BIND(&detached_or_out_of_bounds);
+  Unreachable();
+  BIND(&done);
+#endif  // DEBUG
+
+  // TODO(v8:11111): Make storing fast when the elements kinds only differ
+  // because of their RAB/GSABness.
   fast_typed_array_target_ =
       Word32Equal(LoadElementsKind(original_array), LoadElementsKind(a));
   a_ = a;
@@ -65,17 +77,21 @@ TNode<Object> ArrayBuiltinsAssembler::TypedArrayMapProcessor(
   // numValue be ? ToBigInt(v).
   // 3. Otherwise, let numValue be ? ToNumber(value).
   TNode<Object> num_value;
-  if (source_elements_kind_ == BIGINT64_ELEMENTS ||
-      source_elements_kind_ == BIGUINT64_ELEMENTS) {
+  if (IsBigIntTypedArrayElementsKind(source_elements_kind_)) {
     num_value = ToBigInt(context(), mapped_value);
   } else {
     num_value = ToNumber_Inline(context(), mapped_value);
   }
 
-  // The only way how this can bailout is because of a detached buffer.
+  // The only way how this can bailout is because of a detached or out of bounds
+  // buffer.
   // TODO(v8:4153): Consider checking IsDetachedBuffer() and calling
   // TypedArrayBuiltinsAssembler::StoreJSTypedArrayElementFromNumeric() here
   // instead to avoid converting k_number back to UintPtrT.
+
+  // Using source_elements_kind_ (not "target elements kind") is correct here,
+  // because the fast branch is taken only when the source and the target
+  // elements kinds match.
   EmitElementStore(CAST(a()), k_number, num_value, source_elements_kind_,
                    KeyedAccessStoreMode::STANDARD_STORE, &detached, context());
   Goto(&done);
@@ -179,25 +195,14 @@ void ArrayBuiltinsAssembler::GenerateIteratingTypedArrayBuiltinBody(
   for (auto it = labels.begin(); it != labels.end(); ++i, ++it) {
     BIND(&*it);
     source_elements_kind_ = static_cast<ElementsKind>(elements_kinds[i]);
-    // TODO(v8:11111): Only RAB-backed TAs need special handling here since the
-    // backing store can shrink mid-iteration. This implementation has an
-    // overzealous check for GSAB-backed length-tracking TAs. Then again, the
-    // non-RAB/GSAB code also has an overzealous detached check for SABs.
-    bool is_rab_gsab = IsRabGsabTypedArrayElementsKind(source_elements_kind_);
-    if (is_rab_gsab) {
-      source_elements_kind_ =
-          GetCorrespondingNonRabGsabElementsKind(source_elements_kind_);
-    }
-    VisitAllTypedArrayElements(array_buffer, processor, direction, typed_array,
-                               is_rab_gsab);
+    VisitAllTypedArrayElements(array_buffer, processor, direction, typed_array);
     ReturnFromBuiltin(a_.value());
   }
 }
 
 void ArrayBuiltinsAssembler::VisitAllTypedArrayElements(
     TNode<JSArrayBuffer> array_buffer, const CallResultProcessor& processor,
-    ForEachDirection direction, TNode<JSTypedArray> typed_array,
-    bool can_shrink) {
+    ForEachDirection direction, TNode<JSTypedArray> typed_array) {
   VariableList list({&a_, &k_}, zone());
 
   TNode<UintPtrT> start = UintPtrConstant(0);
@@ -210,13 +215,24 @@ void ArrayBuiltinsAssembler::VisitAllTypedArrayElements(
     incr = -1;
   }
   k_ = start;
+
+  // TODO(v8:11111): Only RAB-backed TAs need special handling here since the
+  // backing store can shrink mid-iteration. This implementation has an
+  // overzealous check for GSAB-backed length-tracking TAs. Then again, the
+  // non-RAB/GSAB code also has an overzealous detached check for SABs.
+  ElementsKind effective_elements_kind = source_elements_kind_;
+  bool is_rab_gsab = IsRabGsabTypedArrayElementsKind(effective_elements_kind);
+  if (is_rab_gsab) {
+    effective_elements_kind =
+        GetCorrespondingNonRabGsabElementsKind(effective_elements_kind);
+  }
   BuildFastLoop<UintPtrT>(
       list, start, end,
       [&](TNode<UintPtrT> index) {
         TVARIABLE(Object, value);
         Label detached(this, Label::kDeferred);
         Label process(this);
-        if (can_shrink) {
+        if (is_rab_gsab) {
           // If `index` is out of bounds, Get returns undefined.
           CheckJSTypedArrayIndex(typed_array, index, &detached);
         } else {
@@ -225,7 +241,7 @@ void ArrayBuiltinsAssembler::VisitAllTypedArrayElements(
         {
           TNode<RawPtrT> data_ptr = LoadJSTypedArrayDataPtr(typed_array);
           value = LoadFixedTypedArrayElementAsTagged(data_ptr, index,
-                                                     source_elements_kind_);
+                                                     effective_elements_kind);
           Goto(&process);
         }
 
@@ -268,33 +284,34 @@ TF_BUILTIN(ArrayPrototypePop, CodeStubAssembler) {
   {
     TNode<JSArray> array_receiver = CAST(receiver);
     CSA_DCHECK(this, TaggedIsPositiveSmi(LoadJSArrayLength(array_receiver)));
-    TNode<IntPtrT> length =
-        LoadAndUntagObjectField(array_receiver, JSArray::kLengthOffset);
+    TNode<Int32T> length =
+        LoadAndUntagToWord32ObjectField(array_receiver, JSArray::kLengthOffset);
     Label return_undefined(this), fast_elements(this);
 
     // 2) Ensure that the length is writable.
     EnsureArrayLengthWritable(context, LoadMap(array_receiver), &runtime);
 
-    GotoIf(IntPtrEqual(length, IntPtrConstant(0)), &return_undefined);
+    GotoIf(Word32Equal(length, Int32Constant(0)), &return_undefined);
 
     // 3) Check that the elements backing store isn't copy-on-write.
     TNode<FixedArrayBase> elements = LoadElements(array_receiver);
     GotoIf(TaggedEqual(LoadMap(elements), FixedCOWArrayMapConstant()),
            &runtime);
 
-    TNode<IntPtrT> new_length = IntPtrSub(length, IntPtrConstant(1));
+    TNode<Int32T> new_length = Int32Sub(length, Int32Constant(1));
 
     // 4) Check that we're not supposed to shrink the backing store, as
     //    implemented in elements.cc:ElementsAccessorBase::SetLengthImpl.
-    TNode<IntPtrT> capacity = SmiUntag(LoadFixedArrayBaseLength(elements));
-    GotoIf(IntPtrLessThan(
-               IntPtrAdd(IntPtrAdd(new_length, new_length),
-                         IntPtrConstant(JSObject::kMinAddedElementsCapacity)),
+    TNode<Int32T> capacity = SmiToInt32(LoadFixedArrayBaseLength(elements));
+    GotoIf(Int32LessThan(
+               Int32Add(Int32Add(new_length, new_length),
+                        Int32Constant(JSObject::kMinAddedElementsCapacity)),
                capacity),
            &runtime);
 
+    TNode<IntPtrT> new_length_intptr = ChangePositiveInt32ToIntPtr(new_length);
     StoreObjectFieldNoWriteBarrier(array_receiver, JSArray::kLengthOffset,
-                                   SmiTag(new_length));
+                                   SmiTag(new_length_intptr));
 
     TNode<Int32T> elements_kind = LoadElementsKind(array_receiver);
     GotoIf(Int32LessThanOrEqual(elements_kind,
@@ -305,9 +322,9 @@ TF_BUILTIN(ArrayPrototypePop, CodeStubAssembler) {
       TNode<FixedDoubleArray> elements_known_double_array =
           ReinterpretCast<FixedDoubleArray>(elements);
       TNode<Float64T> value = LoadFixedDoubleArrayElement(
-          elements_known_double_array, new_length, &return_undefined);
+          elements_known_double_array, new_length_intptr, &return_undefined);
 
-      StoreFixedDoubleArrayHole(elements_known_double_array, new_length);
+      StoreFixedDoubleArrayHole(elements_known_double_array, new_length_intptr);
       args.PopAndReturn(AllocateHeapNumberWithValue(value));
     }
 
@@ -315,8 +332,8 @@ TF_BUILTIN(ArrayPrototypePop, CodeStubAssembler) {
     {
       TNode<FixedArray> elements_known_fixed_array = CAST(elements);
       TNode<Object> value =
-          LoadFixedArrayElement(elements_known_fixed_array, new_length);
-      StoreFixedArrayElement(elements_known_fixed_array, new_length,
+          LoadFixedArrayElement(elements_known_fixed_array, new_length_intptr);
+      StoreFixedArrayElement(elements_known_fixed_array, new_length_intptr,
                              TheHoleConstant());
       GotoIf(TaggedEqual(value, TheHoleConstant()), &return_undefined);
       args.PopAndReturn(value);
@@ -659,7 +676,7 @@ void ArrayIncludesIndexofAssembler::Generate(SearchVariant variant,
   // JSArray length is always a positive Smi for fast arrays.
   CSA_DCHECK(this, TaggedIsPositiveSmi(LoadJSArrayLength(array)));
   TNode<Smi> array_length = LoadFastJSArrayLength(array);
-  TNode<IntPtrT> array_length_untagged = SmiUntag(array_length);
+  TNode<IntPtrT> array_length_untagged = PositiveSmiUntag(array_length);
 
   {
     // Initialize fromIndex.
@@ -797,7 +814,7 @@ void ArrayIncludesIndexofAssembler::GenerateSmiOrObject(
     TNode<Smi> from_index, SimpleElementKind array_kind) {
   TVARIABLE(IntPtrT, index_var, SmiUntag(from_index));
   TVARIABLE(Float64T, search_num);
-  TNode<IntPtrT> array_length_untagged = SmiUntag(array_length);
+  TNode<IntPtrT> array_length_untagged = PositiveSmiUntag(array_length);
 
   Label ident_loop(this, &index_var), heap_num_loop(this, &search_num),
       string_loop(this), bigint_loop(this, &index_var),
@@ -822,7 +839,11 @@ void ArrayIncludesIndexofAssembler::GenerateSmiOrObject(
   GotoIf(IsStringInstanceType(search_type), &string_loop);
   GotoIf(IsBigIntInstanceType(search_type), &bigint_loop);
 
-  if (kCanVectorize) {
+  // Use UniqueInt32Constant instead of BoolConstant here in order to ensure
+  // that the graph structure does not depend on the value of the predicate
+  // (BoolConstant uses cached nodes).
+  GotoIfNot(UniqueInt32Constant(kCanVectorize), &ident_loop);
+  {
     Label simd_call(this);
     Branch(
         UintPtrLessThan(array_length_untagged, IntPtrConstant(kSIMDThreshold)),
@@ -839,8 +860,6 @@ void ArrayIncludesIndexofAssembler::GenerateSmiOrObject(
     index_var = ReinterpretCast<IntPtrT>(result);
     Branch(IntPtrLessThan(index_var.value(), IntPtrConstant(0)),
            &return_not_found, &return_found);
-  } else {
-    Goto(&ident_loop);
   }
 
   BIND(&ident_loop);
@@ -876,7 +895,13 @@ void ArrayIncludesIndexofAssembler::GenerateSmiOrObject(
     GotoIfNot(Float64Equal(search_num.value(), search_num.value()),
               nan_handling);
 
-    if (kCanVectorize && array_kind == SimpleElementKind::kSmiOrHole) {
+    // Use UniqueInt32Constant instead of BoolConstant here in order to ensure
+    // that the graph structure does not depend on the value of the predicate
+    // (BoolConstant uses cached nodes).
+    GotoIfNot(UniqueInt32Constant(kCanVectorize &&
+                                  array_kind == SimpleElementKind::kSmiOrHole),
+              &not_nan_loop);
+    {
       Label smi_check(this), simd_call(this);
       Branch(UintPtrLessThan(array_length_untagged,
                              IntPtrConstant(kSIMDThreshold)),
@@ -895,8 +920,6 @@ void ArrayIncludesIndexofAssembler::GenerateSmiOrObject(
       index_var = ReinterpretCast<IntPtrT>(result);
       Branch(IntPtrLessThan(index_var.value(), IntPtrConstant(0)),
              &return_not_found, &return_found);
-    } else {
-      Goto(&not_nan_loop);
     }
 
     BIND(&not_nan_loop);
@@ -1013,7 +1036,7 @@ void ArrayIncludesIndexofAssembler::GeneratePackedDoubles(
     TNode<Object> search_element, TNode<Smi> array_length,
     TNode<Smi> from_index) {
   TVARIABLE(IntPtrT, index_var, SmiUntag(from_index));
-  TNode<IntPtrT> array_length_untagged = SmiUntag(array_length);
+  TNode<IntPtrT> array_length_untagged = PositiveSmiUntag(array_length);
 
   Label nan_loop(this, &index_var), not_nan_case(this),
       not_nan_loop(this, &index_var), hole_loop(this, &index_var),
@@ -1034,7 +1057,11 @@ void ArrayIncludesIndexofAssembler::GeneratePackedDoubles(
   BranchIfFloat64IsNaN(search_num.value(), nan_handling, &not_nan_case);
 
   BIND(&not_nan_case);
-  if (kCanVectorize) {
+  // Use UniqueInt32Constant instead of BoolConstant here in order to ensure
+  // that the graph structure does not depend on the value of the predicate
+  // (BoolConstant uses cached nodes).
+  GotoIfNot(UniqueInt32Constant(kCanVectorize), &not_nan_loop);
+  {
     Label simd_call(this);
     Branch(
         UintPtrLessThan(array_length_untagged, IntPtrConstant(kSIMDThreshold)),
@@ -1051,8 +1078,6 @@ void ArrayIncludesIndexofAssembler::GeneratePackedDoubles(
     index_var = ReinterpretCast<IntPtrT>(result);
     Branch(IntPtrLessThan(index_var.value(), IntPtrConstant(0)),
            &return_not_found, &return_found);
-  } else {
-    Goto(&not_nan_loop);
   }
 
   BIND(&not_nan_loop);
@@ -1103,7 +1128,7 @@ void ArrayIncludesIndexofAssembler::GenerateHoleyDoubles(
     TNode<Object> search_element, TNode<Smi> array_length,
     TNode<Smi> from_index) {
   TVARIABLE(IntPtrT, index_var, SmiUntag(from_index));
-  TNode<IntPtrT> array_length_untagged = SmiUntag(array_length);
+  TNode<IntPtrT> array_length_untagged = PositiveSmiUntag(array_length);
 
   Label nan_loop(this, &index_var), not_nan_case(this),
       not_nan_loop(this, &index_var), hole_loop(this, &index_var),
@@ -1127,7 +1152,11 @@ void ArrayIncludesIndexofAssembler::GenerateHoleyDoubles(
   BranchIfFloat64IsNaN(search_num.value(), nan_handling, &not_nan_case);
 
   BIND(&not_nan_case);
-  if (kCanVectorize) {
+  // Use UniqueInt32Constant instead of BoolConstant here in order to ensure
+  // that the graph structure does not depend on the value of the predicate
+  // (BoolConstant uses cached nodes).
+  GotoIfNot(UniqueInt32Constant(kCanVectorize), &not_nan_loop);
+  {
     Label simd_call(this);
     Branch(
         UintPtrLessThan(array_length_untagged, IntPtrConstant(kSIMDThreshold)),
@@ -1144,8 +1173,6 @@ void ArrayIncludesIndexofAssembler::GenerateHoleyDoubles(
     index_var = ReinterpretCast<IntPtrT>(result);
     Branch(IntPtrLessThan(index_var.value(), IntPtrConstant(0)),
            &return_not_found, &return_found);
-  } else {
-    Goto(&not_nan_loop);
   }
 
   BIND(&not_nan_loop);
@@ -1347,7 +1374,7 @@ TF_BUILTIN(ArrayIteratorPrototypeNext, CodeStubAssembler) {
   auto context = Parameter<Context>(Descriptor::kContext);
   auto maybe_iterator = Parameter<Object>(Descriptor::kReceiver);
 
-  TVARIABLE(Oddball, var_done, TrueConstant());
+  TVARIABLE(Boolean, var_done, TrueConstant());
   TVARIABLE(Object, var_value, UndefinedConstant());
 
   Label allocate_entry_if_needed(this);
diff --git a/deps/v8/src/builtins/builtins-array-gen.h b/deps/v8/src/builtins/builtins-array-gen.h
index e80b85ba002452..979269faa58a74 100644
--- a/deps/v8/src/builtins/builtins-array-gen.h
+++ b/deps/v8/src/builtins/builtins-array-gen.h
@@ -107,8 +107,7 @@ class ArrayBuiltinsAssembler : public CodeStubAssembler {
   void VisitAllTypedArrayElements(TNode<JSArrayBuffer> array_buffer,
                                   const CallResultProcessor& processor,
                                   ForEachDirection direction,
-                                  TNode<JSTypedArray> typed_array,
-                                  bool can_shrink);
+                                  TNode<JSTypedArray> typed_array);
 
   TNode<Object> callbackfn_;
   TNode<JSReceiver> o_;
diff --git a/deps/v8/src/builtins/builtins-array.cc b/deps/v8/src/builtins/builtins-array.cc
index 5049fa36c72a04..408c77bc7acb5c 100644
--- a/deps/v8/src/builtins/builtins-array.cc
+++ b/deps/v8/src/builtins/builtins-array.cc
@@ -18,6 +18,7 @@
 #include "src/objects/js-array-buffer-inl.h"
 #include "src/objects/js-array-inl.h"
 #include "src/objects/js-collection-inl.h"
+#include "src/objects/js-shared-array-inl.h"
 #include "src/objects/lookup.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/prototype.h"
@@ -29,27 +30,29 @@ namespace internal {
 namespace {
 
 inline bool IsJSArrayFastElementMovingAllowed(Isolate* isolate,
-                                              JSArray receiver) {
+                                              Tagged<JSArray> receiver) {
   return JSObject::PrototypeHasNoElements(isolate, receiver);
 }
 
-inline bool HasSimpleElements(JSObject current) {
-  return !current.map().IsCustomElementsReceiverMap() &&
-         !current.GetElementsAccessor()->HasAccessors(current);
+inline bool HasSimpleElements(Tagged<JSObject> current) {
+  return !IsCustomElementsReceiverMap(current->map()) &&
+         !current->GetElementsAccessor()->HasAccessors(current);
 }
 
-inline bool HasOnlySimpleReceiverElements(Isolate* isolate, JSObject receiver) {
+inline bool HasOnlySimpleReceiverElements(Isolate* isolate,
+                                          Tagged<JSObject> receiver) {
   // Check that we have no accessors on the receiver's elements.
   if (!HasSimpleElements(receiver)) return false;
   return JSObject::PrototypeHasNoElements(isolate, receiver);
 }
 
-inline bool HasOnlySimpleElements(Isolate* isolate, JSReceiver receiver) {
+inline bool HasOnlySimpleElements(Isolate* isolate,
+                                  Tagged<JSReceiver> receiver) {
   DisallowGarbageCollection no_gc;
   PrototypeIterator iter(isolate, receiver, kStartAtReceiver);
   for (; !iter.IsAtEnd(); iter.Advance()) {
-    if (iter.GetCurrent().IsJSProxy()) return false;
-    JSObject current = iter.GetCurrent<JSObject>();
+    if (IsJSProxy(iter.GetCurrent())) return false;
+    Tagged<JSObject> current = iter.GetCurrent<JSObject>();
     if (!HasSimpleElements(current)) return false;
   }
   return true;
@@ -74,9 +77,9 @@ void MatchArrayElementsKindToArguments(Isolate* isolate, Handle<JSArray> array,
     DisallowGarbageCollection no_gc;
     int last_arg_index = std::min(first_arg_index + num_arguments, args_length);
     for (int i = first_arg_index; i < last_arg_index; i++) {
-      Object arg = (*args)[i];
-      if (arg.IsHeapObject()) {
-        if (arg.IsHeapNumber()) {
+      Tagged<Object> arg = (*args)[i];
+      if (IsHeapObject(arg)) {
+        if (IsHeapNumber(arg)) {
           target_kind = PACKED_DOUBLE_ELEMENTS;
         } else {
           target_kind = PACKED_ELEMENTS;
@@ -102,11 +105,11 @@ inline bool EnsureJSArrayWithWritableFastElements(Isolate* isolate,
                                                   BuiltinArguments* args,
                                                   int first_arg_index,
                                                   int num_arguments) {
-  if (!receiver->IsJSArray()) return false;
+  if (!IsJSArray(*receiver)) return false;
   Handle<JSArray> array = Handle<JSArray>::cast(receiver);
   ElementsKind origin_kind = array->GetElementsKind();
   if (IsDictionaryElementsKind(origin_kind)) return false;
-  if (!array->map().is_extensible()) return false;
+  if (!array->map()->is_extensible()) return false;
   if (args == nullptr) return true;
 
   // If there may be elements accessors in the prototype chain, the fast path
@@ -133,12 +136,12 @@ V8_WARN_UNUSED_RESULT Maybe<double> GetRelativeIndex(Isolate* isolate,
                                                      Handle<Object> index,
                                                      double init_if_undefined) {
   double relative_index = init_if_undefined;
-  if (!index->IsUndefined()) {
+  if (!IsUndefined(*index)) {
     Handle<Object> relative_index_obj;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, relative_index_obj,
                                      Object::ToInteger(isolate, index),
                                      Nothing<double>());
-    relative_index = relative_index_obj->Number();
+    relative_index = Object::Number(*relative_index_obj);
   }
 
   if (relative_index < 0) {
@@ -151,9 +154,9 @@ V8_WARN_UNUSED_RESULT Maybe<double> GetRelativeIndex(Isolate* isolate,
 // Returns "length", has "fast-path" for JSArrays.
 V8_WARN_UNUSED_RESULT Maybe<double> GetLengthProperty(
     Isolate* isolate, Handle<JSReceiver> receiver) {
-  if (receiver->IsJSArray()) {
+  if (IsJSArray(*receiver)) {
     Handle<JSArray> array = Handle<JSArray>::cast(receiver);
-    double length = array->length().Number();
+    double length = Object::Number(array->length());
     DCHECK(0 <= length && length <= kMaxSafeInteger);
 
     return Just(length);
@@ -163,14 +166,14 @@ V8_WARN_UNUSED_RESULT Maybe<double> GetLengthProperty(
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, raw_length_number,
       Object::GetLengthFromArrayLike(isolate, receiver), Nothing<double>());
-  return Just(raw_length_number->Number());
+  return Just(Object::Number(*raw_length_number));
 }
 
 // Set "length" property, has "fast-path" for JSArrays.
 // Returns Nothing if something went wrong.
 V8_WARN_UNUSED_RESULT MaybeHandle<Object> SetLengthProperty(
     Isolate* isolate, Handle<JSReceiver> receiver, double length) {
-  if (receiver->IsJSArray()) {
+  if (IsJSArray(*receiver)) {
     Handle<JSArray> array = Handle<JSArray>::cast(receiver);
     if (!JSArray::HasReadOnlyLength(array)) {
       DCHECK_LE(length, kMaxUInt32);
@@ -186,10 +189,9 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> SetLengthProperty(
       Just(ShouldThrow::kThrowOnError));
 }
 
-V8_WARN_UNUSED_RESULT Object GenericArrayFill(Isolate* isolate,
-                                              Handle<JSReceiver> receiver,
-                                              Handle<Object> value,
-                                              double start, double end) {
+V8_WARN_UNUSED_RESULT Tagged<Object> GenericArrayFill(
+    Isolate* isolate, Handle<JSReceiver> receiver, Handle<Object> value,
+    double start, double end) {
   // 7. Repeat, while k < final.
   while (start < end) {
     // a. Let Pk be ! ToString(k).
@@ -215,7 +217,7 @@ V8_WARN_UNUSED_RESULT Maybe<bool> TryFastArrayFill(
   // If indices are too large, use generic path since they are stored as
   // properties, not in the element backing store.
   if (end_index > kMaxUInt32) return Just(false);
-  if (!receiver->IsJSObject()) return Just(false);
+  if (!IsJSObject(*receiver)) return Just(false);
 
   if (!EnsureJSArrayWithWritableFastElements(isolate, receiver, args, 1, 1)) {
     return Just(false);
@@ -244,17 +246,25 @@ V8_WARN_UNUSED_RESULT Maybe<bool> TryFastArrayFill(
   ElementsAccessor* accessor = array->GetElementsAccessor();
   RETURN_ON_EXCEPTION_VALUE(isolate, accessor->Fill(array, value, start, end),
                             Nothing<bool>());
+
+  // It's possible the JSArray's 'length' property was assigned to after the
+  // length was loaded due to user code during argument coercion of the start
+  // and end parameters. The spec algorithm does a Set, meaning the length would
+  // grow as needed during the fill.
+  //
+  // ElementAccessor::Fill is able to grow the backing store as needed, but we
+  // need to ensure the JSArray's length is correctly set in case the user
+  // assigned a smaller value.
+  if (Object::Number(array->length()) < end) {
+    CHECK(accessor->SetLength(array, end).FromJust());
+  }
+
   return Just(true);
 }
 }  // namespace
 
 BUILTIN(ArrayPrototypeFill) {
   HandleScope scope(isolate);
-  if (isolate->debug_execution_mode() == DebugInfo::kSideEffects) {
-    if (!isolate->debug()->PerformSideEffectCheckForObject(args.receiver())) {
-      return ReadOnlyRoots(isolate).exception();
-    }
-  }
 
   // 1. Let O be ? ToObject(this value).
   Handle<JSReceiver> receiver;
@@ -304,8 +314,8 @@ BUILTIN(ArrayPrototypeFill) {
 }
 
 namespace {
-V8_WARN_UNUSED_RESULT Object GenericArrayPush(Isolate* isolate,
-                                              BuiltinArguments* args) {
+V8_WARN_UNUSED_RESULT Tagged<Object> GenericArrayPush(Isolate* isolate,
+                                                      BuiltinArguments* args) {
   // 1. Let O be ? ToObject(this value).
   Handle<JSReceiver> receiver;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
@@ -323,7 +333,7 @@ V8_WARN_UNUSED_RESULT Object GenericArrayPush(Isolate* isolate,
   int arg_count = args->length() - 1;
 
   // 5. If len + arg_count > 2^53-1, throw a TypeError exception.
-  double length = raw_length_number->Number();
+  double length = Object::Number(*raw_length_number);
   if (arg_count > kMaxSafeInteger - length) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kPushPastSafeLength,
@@ -378,7 +388,7 @@ BUILTIN(ArrayPush) {
   // Fast Elements Path
   int to_add = args.length() - 1;
   Handle<JSArray> array = Handle<JSArray>::cast(receiver);
-  uint32_t len = static_cast<uint32_t>(array->length().Number());
+  uint32_t len = static_cast<uint32_t>(Object::Number(array->length()));
   if (to_add == 0) return *isolate->factory()->NewNumberFromUint(len);
 
   // Currently fixed arrays cannot grow too big, so we should never hit this.
@@ -397,8 +407,8 @@ BUILTIN(ArrayPush) {
 
 namespace {
 
-V8_WARN_UNUSED_RESULT Object GenericArrayPop(Isolate* isolate,
-                                             BuiltinArguments* args) {
+V8_WARN_UNUSED_RESULT Tagged<Object> GenericArrayPop(Isolate* isolate,
+                                                     BuiltinArguments* args) {
   // 1. Let O be ? ToObject(this value).
   Handle<JSReceiver> receiver;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
@@ -409,7 +419,7 @@ V8_WARN_UNUSED_RESULT Object GenericArrayPop(Isolate* isolate,
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, raw_length_number,
       Object::GetLengthFromArrayLike(isolate, receiver));
-  double length = raw_length_number->Number();
+  double length = Object::Number(*raw_length_number);
 
   // 3. If len is zero, then.
   if (length == 0) {
@@ -464,7 +474,7 @@ BUILTIN(ArrayPop) {
   }
   Handle<JSArray> array = Handle<JSArray>::cast(receiver);
 
-  uint32_t len = static_cast<uint32_t>(array->length().Number());
+  uint32_t len = static_cast<uint32_t>(Object::Number(array->length()));
 
   if (JSArray::HasReadOnlyLength(array)) {
     return GenericArrayPop(isolate, &args);
@@ -515,9 +525,8 @@ V8_WARN_UNUSED_RESULT bool CanUseFastArrayShift(Isolate* isolate,
   return !JSArray::HasReadOnlyLength(array);
 }
 
-V8_WARN_UNUSED_RESULT Object GenericArrayShift(Isolate* isolate,
-                                               Handle<JSReceiver> receiver,
-                                               double length) {
+V8_WARN_UNUSED_RESULT Tagged<Object> GenericArrayShift(
+    Isolate* isolate, Handle<JSReceiver> receiver, double length) {
   // 4. Let first be ? Get(O, "0").
   Handle<Object> first;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, first,
@@ -616,11 +625,11 @@ BUILTIN(ArrayShift) {
 
 BUILTIN(ArrayUnshift) {
   HandleScope scope(isolate);
-  DCHECK(args.receiver()->IsJSArray());
+  DCHECK(IsJSArray(*args.receiver()));
   Handle<JSArray> array = Handle<JSArray>::cast(args.receiver());
 
   // These are checked in the Torque builtin.
-  DCHECK(array->map().is_extensible());
+  DCHECK(array->map()->is_extensible());
   DCHECK(!IsDictionaryElementsKind(array->GetElementsKind()));
   DCHECK(IsJSArrayFastElementMovingAllowed(isolate, *array));
   DCHECK(!isolate->IsAnyInitialArrayPrototype(*array));
@@ -666,13 +675,13 @@ class ArrayConcatVisitor {
         index_offset_(0u),
         bit_field_(FastElementsField::encode(fast_elements) |
                    ExceedsLimitField::encode(false) |
-                   IsFixedArrayField::encode(storage->IsFixedArray(isolate)) |
+                   IsFixedArrayField::encode(IsFixedArray(*storage, isolate)) |
                    HasSimpleElementsField::encode(
-                       storage->IsFixedArray(isolate) ||
+                       IsFixedArray(*storage, isolate) ||
                        // Don't take fast path for storages that might have
                        // side effects when storing to them.
-                       (!storage->map(isolate).IsCustomElementsReceiverMap() &&
-                        !storage->IsJSTypedArray(isolate)))) {
+                       (!IsCustomElementsReceiverMap(storage->map(isolate)) &&
+                        !IsJSTypedArray(*storage, isolate)))) {
     DCHECK_IMPLIES(this->fast_elements(), is_fixed_array());
   }
 
@@ -739,7 +748,7 @@ class ArrayConcatVisitor {
     // provided-for index range, go to dictionary mode now.
     if (fast_elements() &&
         index_offset_ >
-            static_cast<uint32_t>(FixedArrayBase::cast(*storage_).length())) {
+            static_cast<uint32_t>(FixedArrayBase::cast(*storage_)->length())) {
       SetDictionaryMode();
     }
   }
@@ -757,10 +766,10 @@ class ArrayConcatVisitor {
         array, fast_elements() ? HOLEY_ELEMENTS : DICTIONARY_ELEMENTS);
     {
       DisallowGarbageCollection no_gc;
-      auto raw = *array;
-      raw.set_length(*length);
-      raw.set_elements(*storage_fixed_array());
-      raw.set_map(*map, kReleaseStore);
+      Tagged<JSArray> raw = *array;
+      raw->set_length(*length);
+      raw->set_elements(*storage_fixed_array());
+      raw->set_map(*map, kReleaseStore);
     }
     return array;
   }
@@ -793,7 +802,7 @@ class ArrayConcatVisitor {
     FOR_WITH_HANDLE_SCOPE(
         isolate_, uint32_t, i = 0, i, i < current_length, i++, {
           Handle<Object> element(current_storage->get(i), isolate_);
-          if (!element->IsTheHole(isolate_)) {
+          if (!IsTheHole(*element, isolate_)) {
             // The object holding this backing store has just been allocated, so
             // it cannot yet be used as a prototype.
             Handle<JSObject> not_a_prototype_holder;
@@ -811,7 +820,7 @@ class ArrayConcatVisitor {
 
   inline void clear_storage() { GlobalHandles::Destroy(storage_.location()); }
 
-  inline void set_storage(FixedArray storage) {
+  inline void set_storage(Tagged<FixedArray> storage) {
     DCHECK(is_fixed_array());
     DCHECK(has_simple_elements());
     storage_ = isolate_->global_handles()->Create(storage);
@@ -846,7 +855,7 @@ class ArrayConcatVisitor {
 
 uint32_t EstimateElementCount(Isolate* isolate, Handle<JSArray> array) {
   DisallowGarbageCollection no_gc;
-  uint32_t length = static_cast<uint32_t>(array->length().Number());
+  uint32_t length = static_cast<uint32_t>(Object::Number(array->length()));
   int element_count = 0;
   switch (array->GetElementsKind()) {
     case PACKED_SMI_ELEMENTS:
@@ -863,9 +872,9 @@ uint32_t EstimateElementCount(Isolate* isolate, Handle<JSArray> array) {
       // a 32-bit signed integer.
       DCHECK_GE(static_cast<int32_t>(FixedArray::kMaxLength), 0);
       int fast_length = static_cast<int>(length);
-      FixedArray elements = FixedArray::cast(array->elements());
+      Tagged<FixedArray> elements = FixedArray::cast(array->elements());
       for (int i = 0; i < fast_length; i++) {
-        if (!elements.get(i).IsTheHole(isolate)) element_count++;
+        if (!IsTheHole(elements->get(i), isolate)) element_count++;
       }
       break;
     }
@@ -875,22 +884,24 @@ uint32_t EstimateElementCount(Isolate* isolate, Handle<JSArray> array) {
       // a 32-bit signed integer.
       DCHECK_GE(static_cast<int32_t>(FixedDoubleArray::kMaxLength), 0);
       int fast_length = static_cast<int>(length);
-      if (array->elements().IsFixedArray()) {
-        DCHECK_EQ(FixedArray::cast(array->elements()).length(), 0);
+      if (IsFixedArray(array->elements())) {
+        DCHECK_EQ(FixedArray::cast(array->elements())->length(), 0);
         break;
       }
-      FixedDoubleArray elements = FixedDoubleArray::cast(array->elements());
+      Tagged<FixedDoubleArray> elements =
+          FixedDoubleArray::cast(array->elements());
       for (int i = 0; i < fast_length; i++) {
-        if (!elements.is_the_hole(i)) element_count++;
+        if (!elements->is_the_hole(i)) element_count++;
       }
       break;
     }
     case DICTIONARY_ELEMENTS: {
-      NumberDictionary dictionary = NumberDictionary::cast(array->elements());
+      Tagged<NumberDictionary> dictionary =
+          NumberDictionary::cast(array->elements());
       ReadOnlyRoots roots(isolate);
-      for (InternalIndex i : dictionary.IterateEntries()) {
-        Object key = dictionary.KeyAt(i);
-        if (dictionary.IsKey(roots, key)) {
+      for (InternalIndex i : dictionary->IterateEntries()) {
+        Tagged<Object> key = dictionary->KeyAt(i);
+        if (dictionary->IsKey(roots, key)) {
           element_count++;
         }
       }
@@ -934,11 +945,11 @@ void CollectElementIndices(Isolate* isolate, Handle<JSObject> object,
     case HOLEY_NONEXTENSIBLE_ELEMENTS:
     case HOLEY_ELEMENTS: {
       DisallowGarbageCollection no_gc;
-      FixedArray elements = FixedArray::cast(object->elements());
-      uint32_t length = static_cast<uint32_t>(elements.length());
+      Tagged<FixedArray> elements = FixedArray::cast(object->elements());
+      uint32_t length = static_cast<uint32_t>(elements->length());
       if (range < length) length = range;
       for (uint32_t i = 0; i < length; i++) {
-        if (!elements.get(i).IsTheHole(isolate)) {
+        if (!IsTheHole(elements->get(i), isolate)) {
           indices->push_back(i);
         }
       }
@@ -946,8 +957,8 @@ void CollectElementIndices(Isolate* isolate, Handle<JSObject> object,
     }
     case HOLEY_DOUBLE_ELEMENTS:
     case PACKED_DOUBLE_ELEMENTS: {
-      if (object->elements().IsFixedArray()) {
-        DCHECK_EQ(object->elements().length(), 0);
+      if (IsFixedArray(object->elements())) {
+        DCHECK_EQ(object->elements()->length(), 0);
         break;
       }
       Handle<FixedDoubleArray> elements(
@@ -963,14 +974,15 @@ void CollectElementIndices(Isolate* isolate, Handle<JSObject> object,
     }
     case DICTIONARY_ELEMENTS: {
       DisallowGarbageCollection no_gc;
-      NumberDictionary dict = NumberDictionary::cast(object->elements());
-      uint32_t capacity = dict.Capacity();
+      Tagged<NumberDictionary> dict =
+          NumberDictionary::cast(object->elements());
+      uint32_t capacity = dict->Capacity();
       ReadOnlyRoots roots(isolate);
       FOR_WITH_HANDLE_SCOPE(isolate, uint32_t, j = 0, j, j < capacity, j++, {
-        Object k = dict.KeyAt(InternalIndex(j));
-        if (!dict.IsKey(roots, k)) continue;
-        DCHECK(k.IsNumber());
-        uint32_t index = static_cast<uint32_t>(k.Number());
+        Tagged<Object> k = dict->KeyAt(InternalIndex(j));
+        if (!dict->IsKey(roots, k)) continue;
+        DCHECK(IsNumber(k));
+        uint32_t index = static_cast<uint32_t>(Object::Number(k));
         if (index < range) {
           indices->push_back(index);
         }
@@ -1001,8 +1013,8 @@ void CollectElementIndices(Isolate* isolate, Handle<JSObject> object,
     case SLOW_SLOPPY_ARGUMENTS_ELEMENTS: {
       DisallowGarbageCollection no_gc;
       DisableGCMole no_gc_mole;
-      FixedArrayBase elements = object->elements();
-      JSObject raw_object = *object;
+      Tagged<FixedArrayBase> elements = object->elements();
+      Tagged<JSObject> raw_object = *object;
       ElementsAccessor* accessor = object->GetElementsAccessor();
       for (uint32_t i = 0; i < range; i++) {
         if (accessor->HasElement(raw_object, i, elements)) {
@@ -1013,10 +1025,10 @@ void CollectElementIndices(Isolate* isolate, Handle<JSObject> object,
     }
     case FAST_STRING_WRAPPER_ELEMENTS:
     case SLOW_STRING_WRAPPER_ELEMENTS: {
-      DCHECK(object->IsJSPrimitiveWrapper());
+      DCHECK(IsJSPrimitiveWrapper(*object));
       Handle<JSPrimitiveWrapper> js_value =
           Handle<JSPrimitiveWrapper>::cast(object);
-      DCHECK(js_value->value().IsString());
+      DCHECK(IsString(js_value->value()));
       Handle<String> string(String::cast(js_value->value()), isolate);
       uint32_t length = static_cast<uint32_t>(string->length());
       uint32_t i = 0;
@@ -1035,8 +1047,22 @@ void CollectElementIndices(Isolate* isolate, Handle<JSObject> object,
     case WASM_ARRAY_ELEMENTS:
       // TODO(ishell): implement
       UNIMPLEMENTED();
-    case SHARED_ARRAY_ELEMENTS:
-      UNREACHABLE();
+    case SHARED_ARRAY_ELEMENTS: {
+      uint32_t length =
+          Handle<JSSharedArray>::cast(object)->elements()->length();
+      if (range <= length) {
+        length = range;
+        indices->clear();
+      }
+      for (uint32_t i = 0; i < length; i++) {
+        // JSSharedArrays are created non-resizable and do not have holes.
+        SLOW_DCHECK(object->GetElementsAccessor()->HasElement(
+            *object, i, object->elements()));
+        indices->push_back(i);
+      }
+      if (length == range) return;
+      break;
+    }
     case NO_ELEMENTS:
       break;
   }
@@ -1080,20 +1106,20 @@ bool IterateElements(Isolate* isolate, Handle<JSReceiver> receiver,
                      ArrayConcatVisitor* visitor) {
   uint32_t length = 0;
 
-  if (receiver->IsJSArray()) {
+  if (IsJSArray(*receiver)) {
     Handle<JSArray> array = Handle<JSArray>::cast(receiver);
-    length = static_cast<uint32_t>(array->length().Number());
+    length = static_cast<uint32_t>(Object::Number(array->length()));
   } else {
     Handle<Object> val;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, val, Object::GetLengthFromArrayLike(isolate, receiver), false);
-    if (visitor->index_offset() + val->Number() > kMaxSafeInteger) {
+    if (visitor->index_offset() + Object::Number(*val) > kMaxSafeInteger) {
       isolate->Throw(*isolate->factory()->NewTypeError(
           MessageTemplate::kInvalidArrayLength));
       return false;
     }
     // TODO(caitp): Support larger element indexes (up to 2^53-1).
-    if (!val->ToUint32(&length)) {
+    if (!Object::ToUint32(*val, &length)) {
       length = 0;
     }
     // TODO(cbruni): handle other element kind as well
@@ -1127,7 +1153,7 @@ bool IterateElements(Isolate* isolate, Handle<JSReceiver> receiver,
       DCHECK(fast_length <= elements->length());
       FOR_WITH_HANDLE_SCOPE(isolate, int, j = 0, j, j < fast_length, j++, {
         Handle<Object> element_value(elements->get(j), isolate);
-        if (!element_value->IsTheHole(isolate)) {
+        if (!IsTheHole(*element_value, isolate)) {
           if (!visitor->visit(j, element_value)) return false;
         } else {
           Maybe<bool> maybe = JSReceiver::HasElement(isolate, array, j);
@@ -1153,8 +1179,8 @@ bool IterateElements(Isolate* isolate, Handle<JSReceiver> receiver,
       if (length == 0) break;
       // Run through the elements FixedArray and use HasElement and GetElement
       // to check the prototype for missing elements.
-      if (array->elements().IsFixedArray()) {
-        DCHECK_EQ(array->elements().length(), 0);
+      if (IsFixedArray(array->elements())) {
+        DCHECK_EQ(array->elements()->length(), 0);
         break;
       }
       Handle<FixedDoubleArray> elements(
@@ -1244,25 +1270,26 @@ bool IterateElements(Isolate* isolate, Handle<JSReceiver> receiver,
 
 static Maybe<bool> IsConcatSpreadable(Isolate* isolate, Handle<Object> obj) {
   HandleScope handle_scope(isolate);
-  if (!obj->IsJSReceiver()) return Just(false);
+  if (!IsJSReceiver(*obj)) return Just(false);
   if (!Protectors::IsIsConcatSpreadableLookupChainIntact(isolate) ||
-      JSReceiver::cast(*obj).HasProxyInPrototype(isolate)) {
+      JSReceiver::cast(*obj)->HasProxyInPrototype(isolate)) {
     // Slow path if @@isConcatSpreadable has been used.
     Handle<Symbol> key(isolate->factory()->is_concat_spreadable_symbol());
     Handle<Object> value;
     MaybeHandle<Object> maybeValue =
         i::Runtime::GetObjectProperty(isolate, obj, key);
     if (!maybeValue.ToHandle(&value)) return Nothing<bool>();
-    if (!value->IsUndefined(isolate)) return Just(value->BooleanValue(isolate));
+    if (!IsUndefined(*value, isolate))
+      return Just(Object::BooleanValue(*value, isolate));
   }
   return Object::IsArray(obj);
 }
 
-Object Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
-                        Isolate* isolate) {
+Tagged<Object> Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
+                                Isolate* isolate) {
   int argument_count = args->length();
 
-  bool is_array_species = *species == isolate->context().array_function();
+  bool is_array_species = *species == isolate->context()->array_function();
 
   // Pass 1: estimate the length and number of elements of the result.
   // The actual length can be larger if any of the arguments have getters
@@ -1277,9 +1304,9 @@ Object Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
     Handle<Object> obj = args->at(i);
     uint32_t length_estimate;
     uint32_t element_estimate;
-    if (obj->IsJSArray()) {
+    if (IsJSArray(*obj)) {
       Handle<JSArray> array(Handle<JSArray>::cast(obj));
-      length_estimate = static_cast<uint32_t>(array->length().Number());
+      length_estimate = static_cast<uint32_t>(Object::Number(array->length()));
       if (length_estimate != 0) {
         ElementsKind array_kind =
             GetPackedElementsKind(array->GetElementsKind());
@@ -1290,9 +1317,9 @@ Object Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
       }
       element_estimate = EstimateElementCount(isolate, array);
     } else {
-      if (obj->IsHeapObject()) {
+      if (IsHeapObject(*obj)) {
         kind = GetMoreGeneralElementsKind(
-            kind, obj->IsNumber() ? PACKED_DOUBLE_ELEMENTS : PACKED_ELEMENTS);
+            kind, IsNumber(*obj) ? PACKED_DOUBLE_ELEMENTS : PACKED_ELEMENTS);
       }
       length_estimate = 1;
       element_estimate = 1;
@@ -1327,25 +1354,26 @@ Object Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
           Handle<FixedDoubleArray>::cast(storage);
       for (int i = 0; i < argument_count; i++) {
         Handle<Object> obj = args->at(i);
-        if (obj->IsSmi()) {
+        if (IsSmi(*obj)) {
           double_storage->set(j, Smi::ToInt(*obj));
           j++;
-        } else if (obj->IsNumber()) {
-          double_storage->set(j, obj->Number());
+        } else if (IsNumber(*obj)) {
+          double_storage->set(j, Object::Number(*obj));
           j++;
         } else {
           DisallowGarbageCollection no_gc;
-          JSArray array = JSArray::cast(*obj);
-          uint32_t length = static_cast<uint32_t>(array.length().Number());
-          switch (array.GetElementsKind()) {
+          Tagged<JSArray> array = JSArray::cast(*obj);
+          uint32_t length =
+              static_cast<uint32_t>(Object::Number(array->length()));
+          switch (array->GetElementsKind()) {
             case HOLEY_DOUBLE_ELEMENTS:
             case PACKED_DOUBLE_ELEMENTS: {
               // Empty array is FixedArray but not FixedDoubleArray.
               if (length == 0) break;
-              FixedDoubleArray elements =
-                  FixedDoubleArray::cast(array.elements());
+              Tagged<FixedDoubleArray> elements =
+                  FixedDoubleArray::cast(array->elements());
               for (uint32_t k = 0; k < length; k++) {
-                if (elements.is_the_hole(k)) {
+                if (elements->is_the_hole(k)) {
                   // TODO(jkummerow/verwaest): We could be a bit more clever
                   // here: Check if there are no elements/getters on the
                   // prototype chain, and if so, allow creation of a holey
@@ -1354,7 +1382,7 @@ Object Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
                   failure = true;
                   break;
                 }
-                double double_value = elements.get_scalar(k);
+                double double_value = elements->get_scalar(k);
                 double_storage->set(j, double_value);
                 j++;
               }
@@ -1362,10 +1390,10 @@ Object Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
             }
             case HOLEY_SMI_ELEMENTS:
             case PACKED_SMI_ELEMENTS: {
-              Object the_hole = ReadOnlyRoots(isolate).the_hole_value();
-              FixedArray elements(FixedArray::cast(array.elements()));
+              Tagged<Object> the_hole = ReadOnlyRoots(isolate).the_hole_value();
+              Tagged<FixedArray> elements(FixedArray::cast(array->elements()));
               for (uint32_t k = 0; k < length; k++) {
-                Object element = elements.get(k);
+                Tagged<Object> element = elements->get(k);
                 if (element == the_hole) {
                   failure = true;
                   break;
@@ -1421,7 +1449,7 @@ Object Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
   } else if (is_array_species) {
     storage = NumberDictionary::New(isolate, estimate_nof);
   } else {
-    DCHECK(species->IsConstructor());
+    DCHECK(IsConstructor(*species));
     Handle<Object> length(Smi::zero(), isolate);
     Handle<Object> storage_object;
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
@@ -1461,10 +1489,11 @@ Object Slow_ArrayConcat(BuiltinArguments* args, Handle<Object> species,
 
 bool IsSimpleArray(Isolate* isolate, Handle<JSArray> obj) {
   DisallowGarbageCollection no_gc;
-  Map map = obj->map();
+  Tagged<Map> map = obj->map();
   // If there is only the 'length' property we are fine.
-  if (map.prototype() == isolate->native_context()->initial_array_prototype() &&
-      map.NumberOfOwnDescriptors() == 1) {
+  if (map->prototype() ==
+          isolate->native_context()->initial_array_prototype() &&
+      map->NumberOfOwnDescriptors() == 1) {
     return true;
   }
   // TODO(cbruni): slower lookup for array subclasses and support slow
@@ -1490,13 +1519,13 @@ MaybeHandle<JSArray> Fast_ArrayConcat(Isolate* isolate,
     // Iterate through all the arguments performing checks
     // and calculating total length.
     for (int i = 0; i < n_arguments; i++) {
-      Object arg = (*args)[i];
-      if (!arg.IsJSArray()) return MaybeHandle<JSArray>();
+      Tagged<Object> arg = (*args)[i];
+      if (!IsJSArray(arg)) return MaybeHandle<JSArray>();
       if (!HasOnlySimpleReceiverElements(isolate, JSObject::cast(arg))) {
         return MaybeHandle<JSArray>();
       }
       // TODO(cbruni): support fast concatenation of DICTIONARY_ELEMENTS.
-      if (!JSObject::cast(arg).HasFastElements()) {
+      if (!JSObject::cast(arg)->HasFastElements()) {
         return MaybeHandle<JSArray>();
       }
       Handle<JSArray> array(JSArray::cast(arg), isolate);
@@ -1536,7 +1565,7 @@ BUILTIN(ArrayConcat) {
   Handle<JSArray> result_array;
 
   // Avoid a real species read to avoid extra lookups to the array constructor
-  if (V8_LIKELY(receiver->IsJSArray() &&
+  if (V8_LIKELY(IsJSArray(*receiver) &&
                 Handle<JSArray>::cast(receiver)->HasArrayPrototype(isolate) &&
                 Protectors::IsArraySpeciesLookupChainIntact(isolate))) {
     if (Fast_ArrayConcat(isolate, &args).ToHandle(&result_array)) {
@@ -1560,306 +1589,6 @@ BUILTIN(ArrayConcat) {
   return Slow_ArrayConcat(&args, species, isolate);
 }
 
-namespace {
-
-// https://tc39.es/proposal-array-grouping/#sec-add-value-to-keyed-group
-// Each keyed group is an array list.
-inline Handle<OrderedHashMap> AddValueToKeyedGroup(
-    Isolate* isolate, Handle<OrderedHashMap> groups, Handle<Object> key,
-    Handle<Object> value) {
-  InternalIndex entry = groups->FindEntry(isolate, *key);
-  if (!entry.is_found()) {
-    Handle<ArrayList> array = ArrayList::New(isolate, 1);
-    array = ArrayList::Add(isolate, array, value);
-    return OrderedHashMap::Add(isolate, groups, key, array).ToHandleChecked();
-  }
-  Handle<ArrayList> array =
-      Handle<ArrayList>(ArrayList::cast(groups->ValueAt(entry)), isolate);
-  array = ArrayList::Add(isolate, array, value);
-  groups->SetEntry(entry, *key, *array);
-  return groups;
-}
-
-inline bool IsFastArray(Handle<JSReceiver> object) {
-  Isolate* isolate = object->GetIsolate();
-  if (isolate->force_slow_path()) return false;
-  if (!object->IsJSArray()) return false;
-  Handle<JSArray> array = Handle<JSArray>::cast(object);
-  if (!array->HasFastElements(isolate)) return false;
-
-  Context context = isolate->context();
-  if (array->map().prototype() !=
-      context.get(Context::INITIAL_ARRAY_PROTOTYPE_INDEX)) {
-    return false;
-  }
-
-  return Protectors::IsNoElementsIntact(isolate);
-}
-
-inline bool CheckArrayMapNotModified(Handle<JSArray> array,
-                                     Handle<Map> original_map) {
-  if (array->map() != *original_map) {
-    return false;
-  }
-  return Protectors::IsNoElementsIntact(array->GetIsolate());
-}
-
-enum class ArrayGroupMode { kToObject, kToMap };
-
-template <ArrayGroupMode mode>
-inline MaybeHandle<OrderedHashMap> GenericArrayGroup(
-    Isolate* isolate, Handle<JSReceiver> O, Handle<Object> callbackfn,
-    Handle<Object> thisArg, Handle<OrderedHashMap> groups, double initialK,
-    double len) {
-  // 6. Repeat, while k < len
-  for (double k = initialK; k < len; ++k) {
-    // 6a. Let Pk be ! ToString(𝔽(k)).
-    Handle<Name> Pk;
-    ASSIGN_RETURN_ON_EXCEPTION(
-        isolate, Pk, Object::ToName(isolate, isolate->factory()->NewNumber(k)),
-        OrderedHashMap);
-    // 6b. Let kValue be ? Get(O, Pk).
-    Handle<Object> kValue;
-    ASSIGN_RETURN_ON_EXCEPTION(isolate, kValue,
-                               Object::GetPropertyOrElement(isolate, O, Pk),
-                               OrderedHashMap);
-
-    // Common steps for ArrayPrototypeGroup and ArrayPrototypeGroupToMap
-    // 6c. Let key be ? Call(callbackfn, thisArg, « kValue, 𝔽(k), O »).
-    Handle<Object> propertyKey;
-    Handle<Object> argv[] = {kValue, isolate->factory()->NewNumber(k), O};
-    ASSIGN_RETURN_ON_EXCEPTION(
-        isolate, propertyKey,
-        Execution::Call(isolate, callbackfn, thisArg, 3, argv), OrderedHashMap);
-
-    if (mode == ArrayGroupMode::kToMap) {
-      // 6d. If key is -0𝔽, set key to +0𝔽.
-      if (propertyKey->IsMinusZero()) {
-        propertyKey = Handle<Smi>(Smi::FromInt(0), isolate);
-      }
-    } else {
-      // 6c. Let propertyKey be ? ToPropertyKey(? Call(callbackfn, thisArg, «
-      // kValue, 𝔽(k), O »)).
-      Handle<Name> propertyKeyName;
-      ASSIGN_RETURN_ON_EXCEPTION(isolate, propertyKeyName,
-                                 Object::ToName(isolate, propertyKey),
-                                 OrderedHashMap);
-      propertyKey = isolate->factory()->InternalizeName(propertyKeyName);
-    }
-
-    // 6e. Perform ! AddValueToKeyedGroup(groups, propertyKey, kValue).
-    groups = AddValueToKeyedGroup(isolate, groups, propertyKey, kValue);
-
-    // 6f. Set k to k + 1.
-    // done by the loop.
-  }
-
-  return groups;
-}
-
-template <ArrayGroupMode mode>
-inline MaybeHandle<OrderedHashMap> FastArrayGroup(
-    Isolate* isolate, Handle<JSArray> array, Handle<Object> callbackfn,
-    Handle<Object> thisArg, Handle<OrderedHashMap> groups, double len,
-    ElementsKind* result_elements_kind) {
-  DCHECK_NOT_NULL(result_elements_kind);
-
-  Handle<Map> original_map = Handle<Map>(array->map(), isolate);
-  uint32_t uint_len = static_cast<uint32_t>(len);
-  ElementsAccessor* accessor = array->GetElementsAccessor();
-
-  // 4. Let k be 0.
-  // 6. Repeat, while k < len
-  for (InternalIndex k : InternalIndex::Range(uint_len)) {
-    if (!CheckArrayMapNotModified(array, original_map) ||
-        k.as_uint32() >= static_cast<uint32_t>(array->length().Number())) {
-      return GenericArrayGroup<mode>(isolate, array, callbackfn, thisArg,
-                                     groups, k.as_uint32(), len);
-    }
-    // 6a. Let Pk be ! ToString(𝔽(k)).
-    // 6b. Let kValue be ? Get(O, Pk).
-    Handle<Object> kValue = accessor->Get(isolate, array, k);
-    if (kValue->IsTheHole()) {
-      kValue = isolate->factory()->undefined_value();
-    }
-
-    // Common steps for ArrayPrototypeGroup and ArrayPrototypeGroupToMap
-    // 6c. Let key be ? Call(callbackfn, thisArg, « kValue, 𝔽(k), O »).
-    Handle<Object> propertyKey;
-    Handle<Object> argv[] = {
-        kValue, isolate->factory()->NewNumber(k.as_uint32()), array};
-    ASSIGN_RETURN_ON_EXCEPTION(
-        isolate, propertyKey,
-        Execution::Call(isolate, callbackfn, thisArg, 3, argv), OrderedHashMap);
-
-    if (mode == ArrayGroupMode::kToMap) {
-      // 6d. If key is -0𝔽, set key to +0𝔽.
-      if (propertyKey->IsMinusZero()) {
-        propertyKey = Handle<Smi>(Smi::FromInt(0), isolate);
-      }
-    } else {
-      // 6c. Let propertyKey be ? ToPropertyKey(? Call(callbackfn, thisArg, «
-      // kValue, 𝔽(k), O »)).
-      Handle<Name> propertyKeyName;
-      ASSIGN_RETURN_ON_EXCEPTION(isolate, propertyKeyName,
-                                 Object::ToName(isolate, propertyKey),
-                                 OrderedHashMap);
-      propertyKey = isolate->factory()->InternalizeName(propertyKeyName);
-    }
-
-    // 6e. Perform ! AddValueToKeyedGroup(groups, propertyKey, kValue).
-    groups = AddValueToKeyedGroup(isolate, groups, propertyKey, kValue);
-
-    // 6f. Set k to k + 1.
-    // done by the loop.
-  }
-
-  // When staying on the fast path, we can deduce a more specific results
-  // ElementsKind for the keyed groups based on the input ElementsKind.
-  //
-  // Double elements are stored as HeapNumbers in the keyed group elements
-  // so that we don't need to cast all the keyed groups when switching from
-  // fast path to the generic path.
-  // TODO(v8:12499) add unboxed double elements support
-  if (array->GetElementsKind() == ElementsKind::PACKED_SMI_ELEMENTS) {
-    *result_elements_kind = ElementsKind::PACKED_SMI_ELEMENTS;
-  }
-
-  return groups;
-}
-
-}  // namespace
-
-// https://tc39.es/proposal-array-grouping/#sec-array.prototype.group
-BUILTIN(ArrayPrototypeGroup) {
-  const char* const kMethodName = "Array.prototype.group";
-  HandleScope scope(isolate);
-
-  Handle<JSReceiver> O;
-  // 1. Let O be ? ToObject(this value).
-  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
-      isolate, O, Object::ToObject(isolate, args.receiver(), kMethodName));
-
-  // 2. Let len be ? LengthOfArrayLike(O).
-  double len;
-  MAYBE_ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, len,
-                                           GetLengthProperty(isolate, O));
-
-  // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.
-  Handle<Object> callbackfn = args.atOrUndefined(isolate, 1);
-  if (!callbackfn->IsCallable()) {
-    THROW_NEW_ERROR_RETURN_FAILURE(
-        isolate, NewTypeError(MessageTemplate::kCalledNonCallable, callbackfn));
-  }
-
-  Handle<Object> thisArg = args.atOrUndefined(isolate, 2);
-
-  // 5. Let groups be a new empty List.
-  Handle<OrderedHashMap> groups = isolate->factory()->NewOrderedHashMap();
-  ElementsKind result_elements_kind = ElementsKind::PACKED_ELEMENTS;
-  if (IsFastArray(O)) {
-    Handle<JSArray> array = Handle<JSArray>::cast(O);
-    ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
-        isolate, groups,
-        FastArrayGroup<ArrayGroupMode::kToObject>(isolate, array, callbackfn,
-                                                  thisArg, groups, len,
-                                                  &result_elements_kind));
-  } else {
-    // 4. Let k be 0.
-    ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
-        isolate, groups,
-        GenericArrayGroup<ArrayGroupMode::kToObject>(isolate, O, callbackfn,
-                                                     thisArg, groups, 0, len));
-  }
-
-  // 7. Let obj be ! OrdinaryObjectCreate(null).
-  Handle<JSObject> obj = isolate->factory()->NewJSObjectWithNullProto();
-
-  // 8. For each Record { [[Key]], [[Elements]] } g of groups, do
-  for (InternalIndex entry : groups->IterateEntries()) {
-    Handle<Name> key = Handle<Name>(Name::cast(groups->KeyAt(entry)), isolate);
-    // 8a. Let elements be ! CreateArrayFromList(g.[[Elements]]).
-    Handle<ArrayList> array_list =
-        Handle<ArrayList>(ArrayList::cast(groups->ValueAt(entry)), isolate);
-    Handle<FixedArray> elements = ArrayList::Elements(isolate, array_list);
-    Handle<JSArray> array = isolate->factory()->NewJSArrayWithElements(
-        elements, result_elements_kind, array_list->Length());
-
-    // 8b. Perform ! CreateDataPropertyOrThrow(obj, g.[[Key]], elements).
-    JSReceiver::CreateDataProperty(isolate, obj, key, array,
-                                   Just(kThrowOnError))
-        .Check();
-  }
-
-  // 9. Return obj.
-  return *obj;
-}
-
-// https://tc39.es/proposal-array-grouping/#sec-array.prototype.grouptomap
-BUILTIN(ArrayPrototypeGroupToMap) {
-  const char* const kMethodName = "Array.prototype.groupToMap";
-  HandleScope scope(isolate);
-
-  Handle<JSReceiver> O;
-  // 1. Let O be ? ToObject(this value).
-  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
-      isolate, O, Object::ToObject(isolate, args.receiver(), kMethodName));
-
-  // 2. Let len be ? LengthOfArrayLike(O).
-  double len;
-  MAYBE_ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, len,
-                                           GetLengthProperty(isolate, O));
-
-  // 3. If IsCallable(callbackfn) is false, throw a TypeError exception.
-  Handle<Object> callbackfn = args.atOrUndefined(isolate, 1);
-  if (!callbackfn->IsCallable()) {
-    THROW_NEW_ERROR_RETURN_FAILURE(
-        isolate, NewTypeError(MessageTemplate::kCalledNonCallable, callbackfn));
-  }
-
-  Handle<Object> thisArg = args.atOrUndefined(isolate, 2);
-
-  // 5. Let groups be a new empty List.
-  Handle<OrderedHashMap> groups = isolate->factory()->NewOrderedHashMap();
-  ElementsKind result_elements_kind = ElementsKind::PACKED_ELEMENTS;
-  if (IsFastArray(O)) {
-    Handle<JSArray> array = Handle<JSArray>::cast(O);
-    ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, groups,
-                                       FastArrayGroup<ArrayGroupMode::kToMap>(
-                                           isolate, array, callbackfn, thisArg,
-                                           groups, len, &result_elements_kind));
-  } else {
-    // 4. Let k be 0.
-    ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
-        isolate, groups,
-        GenericArrayGroup<ArrayGroupMode::kToMap>(isolate, O, callbackfn,
-                                                  thisArg, groups, 0, len));
-  }
-
-  // 7. Let map be ! Construct(%Map%).
-  Handle<JSMap> map = isolate->factory()->NewJSMap();
-  Handle<OrderedHashMap> map_table = isolate->factory()->NewOrderedHashMap();
-  // 8. For each Record { [[Key]], [[Elements]] } g of groups, do
-  for (InternalIndex entry : groups->IterateEntries()) {
-    Handle<Object> key = Handle<Object>(groups->KeyAt(entry), isolate);
-    // 8a. Let elements be ! CreateArrayFromList(g.[[Elements]]).
-    Handle<ArrayList> array_list =
-        Handle<ArrayList>(ArrayList::cast(groups->ValueAt(entry)), isolate);
-    Handle<FixedArray> elements = ArrayList::Elements(isolate, array_list);
-    Handle<JSArray> array = isolate->factory()->NewJSArrayWithElements(
-        elements, result_elements_kind, array_list->Length());
-
-    // 8b. Let entry be the Record { [[Key]]: g.[[Key]], [[Value]]: elements }.
-    // 8c. Append entry as the last element of map.[[MapData]].
-    map_table =
-        OrderedHashMap::Add(isolate, map_table, key, array).ToHandleChecked();
-  }
-  map->set_table(*map_table);
-
-  // 9. Return map.
-  return *map;
-}
-
 BUILTIN(ArrayFromAsync) {
   HandleScope scope(isolate);
   DCHECK(v8_flags.harmony_array_from_async);
diff --git a/deps/v8/src/builtins/builtins-arraybuffer.cc b/deps/v8/src/builtins/builtins-arraybuffer.cc
index b1f285b8da0046..08810fd4afd7f5 100644
--- a/deps/v8/src/builtins/builtins-arraybuffer.cc
+++ b/deps/v8/src/builtins/builtins-arraybuffer.cc
@@ -4,6 +4,8 @@
 
 #include "src/builtins/builtins-utils-inl.h"
 #include "src/builtins/builtins.h"
+#include "src/execution/protectors-inl.h"
+#include "src/execution/protectors.h"
 #include "src/handles/maybe-handles-inl.h"
 #include "src/heap/heap-inl.h"  // For ToBoolean. TODO(jkummerow): Drop.
 #include "src/logging/counters.h"
@@ -37,10 +39,11 @@ namespace internal {
 
 namespace {
 
-Object ConstructBuffer(Isolate* isolate, Handle<JSFunction> target,
-                       Handle<JSReceiver> new_target, Handle<Object> length,
-                       Handle<Object> max_length, InitializedFlag initialized) {
-  SharedFlag shared = *target != target->native_context().array_buffer_fun()
+Tagged<Object> ConstructBuffer(Isolate* isolate, Handle<JSFunction> target,
+                               Handle<JSReceiver> new_target,
+                               Handle<Object> length, Handle<Object> max_length,
+                               InitializedFlag initialized) {
+  SharedFlag shared = *target != target->native_context()->array_buffer_fun()
                           ? SharedFlag::kShared
                           : SharedFlag::kNotShared;
   ResizableFlag resizable = max_length.is_null() ? ResizableFlag::kNotResizable
@@ -116,12 +119,12 @@ Object ConstructBuffer(Isolate* isolate, Handle<JSFunction> target,
 BUILTIN(ArrayBufferConstructor) {
   HandleScope scope(isolate);
   Handle<JSFunction> target = args.target();
-  DCHECK(*target == target->native_context().array_buffer_fun() ||
-         *target == target->native_context().shared_array_buffer_fun());
-  if (args.new_target()->IsUndefined(isolate)) {  // [[Call]]
+  DCHECK(*target == target->native_context()->array_buffer_fun() ||
+         *target == target->native_context()->shared_array_buffer_fun());
+  if (IsUndefined(*args.new_target(), isolate)) {  // [[Call]]
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kConstructorNotFunction,
-                              handle(target->shared().Name(), isolate)));
+                              handle(target->shared()->Name(), isolate)));
   }
   // [[Construct]]
   Handle<JSReceiver> new_target = Handle<JSReceiver>::cast(args.new_target());
@@ -130,7 +133,7 @@ BUILTIN(ArrayBufferConstructor) {
   Handle<Object> number_length;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, number_length,
                                      Object::ToInteger(isolate, length));
-  if (number_length->Number() < 0.0) {
+  if (Object::Number(*number_length) < 0.0) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewRangeError(MessageTemplate::kInvalidArrayBufferLength));
   }
@@ -144,7 +147,7 @@ BUILTIN(ArrayBufferConstructor) {
         JSObject::ReadFromOptionsBag(
             options, isolate->factory()->max_byte_length_string(), isolate));
 
-    if (!max_length->IsUndefined(isolate)) {
+    if (!IsUndefined(*max_length, isolate)) {
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
           isolate, number_max_length, Object::ToInteger(isolate, max_length));
     }
@@ -165,8 +168,8 @@ BUILTIN(ArrayBufferConstructor_DoNotInitialize) {
                          InitializedFlag::kUninitialized);
 }
 
-static Object SliceHelper(BuiltinArguments args, Isolate* isolate,
-                          const char* kMethodName, bool is_shared) {
+static Tagged<Object> SliceHelper(BuiltinArguments args, Isolate* isolate,
+                                  const char* kMethodName, bool is_shared) {
   HandleScope scope(isolate);
   Handle<Object> start = args.at(1);
   Handle<Object> end = args.atOrUndefined(isolate, 2);
@@ -198,20 +201,21 @@ static Object SliceHelper(BuiltinArguments args, Isolate* isolate,
 
   // * If relativeStart < 0, let first be max((len + relativeStart), 0); else
   //   let first be min(relativeStart, len).
-  double const first = (relative_start->Number() < 0)
-                           ? std::max(len + relative_start->Number(), 0.0)
-                           : std::min(relative_start->Number(), len);
+  double const first =
+      (Object::Number(*relative_start) < 0)
+          ? std::max(len + Object::Number(*relative_start), 0.0)
+          : std::min(Object::Number(*relative_start), len);
 
   // * If end is undefined, let relativeEnd be len; else let relativeEnd be ?
   //   ToInteger(end).
   double relative_end;
-  if (end->IsUndefined(isolate)) {
+  if (IsUndefined(*end, isolate)) {
     relative_end = len;
   } else {
     Handle<Object> relative_end_obj;
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, relative_end_obj,
                                        Object::ToInteger(isolate, end));
-    relative_end = relative_end_obj->Number();
+    relative_end = Object::Number(*relative_end_obj);
   }
 
   // * If relativeEnd < 0, let final be max((len + relativeEnd), 0); else let
@@ -251,7 +255,7 @@ static Object SliceHelper(BuiltinArguments args, Isolate* isolate,
 
   // * If new does not have an [[ArrayBufferData]] internal slot, throw a
   //   TypeError exception.
-  if (!new_->IsJSArrayBuffer()) {
+  if (!IsJSArrayBuffer(*new_)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
         NewTypeError(MessageTemplate::kIncompatibleMethodReceiver,
@@ -276,7 +280,7 @@ static Object SliceHelper(BuiltinArguments args, Isolate* isolate,
   }
 
   // * [AB] If SameValue(new, O) is true, throw a TypeError exception.
-  if (!is_shared && new_->SameValue(*args.receiver())) {
+  if (!is_shared && Object::SameValue(*new_, *args.receiver())) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kArrayBufferSpeciesThis));
   }
@@ -357,8 +361,8 @@ BUILTIN(ArrayBufferPrototypeSlice) {
   return SliceHelper(args, isolate, kMethodName, false);
 }
 
-static Object ResizeHelper(BuiltinArguments args, Isolate* isolate,
-                           const char* kMethodName, bool is_shared) {
+static Tagged<Object> ResizeHelper(BuiltinArguments args, Isolate* isolate,
+                                   const char* kMethodName, bool is_shared) {
   HandleScope scope(isolate);
 
   // 1 Let O be the this value.
@@ -434,6 +438,15 @@ static Object ResizeHelper(BuiltinArguments args, Isolate* isolate,
                                  isolate->factory()->NewStringFromAsciiChecked(
                                      kMethodName)));
     }
+
+    // TypedsArrays in optimized code may go out of bounds. Trigger deopts
+    // through the ArrayBufferDetaching protector.
+    if (new_byte_length < array_buffer->byte_length()) {
+      if (Protectors::IsArrayBufferDetachingIntact(isolate)) {
+        Protectors::InvalidateArrayBufferDetaching(isolate);
+      }
+    }
+
     // [RAB] Set O.[[ArrayBufferByteLength]] to newLength.
     array_buffer->set_byte_length(new_byte_length);
   } else {
@@ -493,16 +506,17 @@ namespace {
 
 enum PreserveResizability { kToFixedLength, kPreserveResizability };
 
-Object ArrayBufferTransfer(Isolate* isolate, Handle<JSArrayBuffer> array_buffer,
-                           Handle<Object> new_length,
-                           PreserveResizability preserve_resizability,
-                           const char* method_name) {
+Tagged<Object> ArrayBufferTransfer(Isolate* isolate,
+                                   Handle<JSArrayBuffer> array_buffer,
+                                   Handle<Object> new_length,
+                                   PreserveResizability preserve_resizability,
+                                   const char* method_name) {
   // 2. If IsSharedArrayBuffer(arrayBuffer) is true, throw a TypeError
   // exception.
   CHECK_SHARED(false, array_buffer, method_name);
 
   size_t new_byte_length;
-  if (new_length->IsUndefined(isolate)) {
+  if (IsUndefined(*new_length, isolate)) {
     // 3. If newLength is undefined, then
     //   a. Let newByteLength be arrayBuffer.[[ArrayBufferByteLength]].
     new_byte_length = array_buffer->GetByteLength();
@@ -512,7 +526,7 @@ Object ArrayBufferTransfer(Isolate* isolate, Handle<JSArrayBuffer> array_buffer,
     Handle<Object> number_new_byte_length;
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, number_new_byte_length,
                                        Object::ToInteger(isolate, new_length));
-    if (number_new_byte_length->Number() < 0.0) {
+    if (Object::Number(*number_new_byte_length) < 0.0) {
       THROW_NEW_ERROR_RETURN_FAILURE(
           isolate, NewRangeError(MessageTemplate::kInvalidArrayBufferLength));
     }
diff --git a/deps/v8/src/builtins/builtins-async-function-gen.cc b/deps/v8/src/builtins/builtins-async-function-gen.cc
index 66b3e432f88cb8..20eca72b4578d0 100644
--- a/deps/v8/src/builtins/builtins-async-function-gen.cc
+++ b/deps/v8/src/builtins/builtins-async-function-gen.cc
@@ -96,8 +96,7 @@ TF_BUILTIN(AsyncFunctionEnter, AsyncFunctionBuiltinsAssembler) {
 
   // Allocate and initialize the register file.
   TNode<FixedArrayBase> parameters_and_registers =
-      AllocateFixedArray(HOLEY_ELEMENTS, parameters_and_register_length,
-                         AllocationFlag::kAllowLargeObjectAllocation);
+      AllocateFixedArray(HOLEY_ELEMENTS, parameters_and_register_length);
   FillFixedArrayWithValue(HOLEY_ELEMENTS, parameters_and_registers,
                           IntPtrConstant(0), parameters_and_register_length,
                           RootIndex::kUndefinedValue);
diff --git a/deps/v8/src/builtins/builtins-async-gen.cc b/deps/v8/src/builtins/builtins-async-gen.cc
index 6abae74f863d56..d87004050bad2e 100644
--- a/deps/v8/src/builtins/builtins-async-gen.cc
+++ b/deps/v8/src/builtins/builtins-async-gen.cc
@@ -27,7 +27,7 @@ TNode<Object> AsyncBuiltinsAssembler::Await(
     TNode<Object> value, TNode<JSPromise> outer_promise,
     TNode<SharedFunctionInfo> on_resolve_sfi,
     TNode<SharedFunctionInfo> on_reject_sfi,
-    TNode<Oddball> is_predicted_as_caught) {
+    TNode<Boolean> is_predicted_as_caught) {
   const TNode<NativeContext> native_context = LoadNativeContext(context);
 
   // We do the `PromiseResolve(%Promise%,value)` avoiding to unnecessarily
@@ -181,11 +181,12 @@ void AsyncBuiltinsAssembler::InitializeNativeClosure(
   TNode<Smi> builtin_id = LoadObjectField<Smi>(
       shared_info, SharedFunctionInfo::kFunctionDataOffset);
   TNode<Code> code = LoadBuiltin(builtin_id);
-  StoreObjectFieldNoWriteBarrier(function, JSFunction::kCodeOffset, code);
+  StoreMaybeIndirectPointerFieldNoWriteBarrier(function,
+                                               JSFunction::kCodeOffset, code);
 }
 
 TNode<JSFunction> AsyncBuiltinsAssembler::CreateUnwrapClosure(
-    TNode<NativeContext> native_context, TNode<Oddball> done) {
+    TNode<NativeContext> native_context, TNode<Boolean> done) {
   const TNode<Map> map = CAST(LoadContextElement(
       native_context, Context::STRICT_FUNCTION_WITHOUT_PROTOTYPE_MAP_INDEX));
   const TNode<SharedFunctionInfo> on_fulfilled_shared =
@@ -197,7 +198,7 @@ TNode<JSFunction> AsyncBuiltinsAssembler::CreateUnwrapClosure(
 }
 
 TNode<Context> AsyncBuiltinsAssembler::AllocateAsyncIteratorValueUnwrapContext(
-    TNode<NativeContext> native_context, TNode<Oddball> done) {
+    TNode<NativeContext> native_context, TNode<Boolean> done) {
   CSA_DCHECK(this, IsBoolean(done));
 
   TNode<Context> context = AllocateSyntheticFunctionContext(
diff --git a/deps/v8/src/builtins/builtins-async-gen.h b/deps/v8/src/builtins/builtins-async-gen.h
index 7e8666678f6478..0cec32290595bc 100644
--- a/deps/v8/src/builtins/builtins-async-gen.h
+++ b/deps/v8/src/builtins/builtins-async-gen.h
@@ -26,7 +26,7 @@ class AsyncBuiltinsAssembler : public PromiseBuiltinsAssembler {
                       TNode<JSPromise> outer_promise,
                       TNode<SharedFunctionInfo> on_resolve_sfi,
                       TNode<SharedFunctionInfo> on_reject_sfi,
-                      TNode<Oddball> is_predicted_as_caught);
+                      TNode<Boolean> is_predicted_as_caught);
   TNode<Object> Await(TNode<Context> context,
                       TNode<JSGeneratorObject> generator, TNode<Object> value,
                       TNode<JSPromise> outer_promise,
@@ -40,7 +40,7 @@ class AsyncBuiltinsAssembler : public PromiseBuiltinsAssembler {
   // Return a new built-in function object as defined in
   // Async Iterator Value Unwrap Functions
   TNode<JSFunction> CreateUnwrapClosure(TNode<NativeContext> native_context,
-                                        TNode<Oddball> done);
+                                        TNode<Boolean> done);
 
  private:
   void InitializeNativeClosure(TNode<Context> context,
@@ -48,7 +48,7 @@ class AsyncBuiltinsAssembler : public PromiseBuiltinsAssembler {
                                TNode<HeapObject> function,
                                TNode<SharedFunctionInfo> shared_info);
   TNode<Context> AllocateAsyncIteratorValueUnwrapContext(
-      TNode<NativeContext> native_context, TNode<Oddball> done);
+      TNode<NativeContext> native_context, TNode<Boolean> done);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/builtins/builtins-async-generator-gen.cc b/deps/v8/src/builtins/builtins-async-generator-gen.cc
index dc66bd8f77cc65..bcf982bb2f5884 100644
--- a/deps/v8/src/builtins/builtins-async-generator-gen.cc
+++ b/deps/v8/src/builtins/builtins-async-generator-gen.cc
@@ -619,7 +619,7 @@ TF_BUILTIN(AsyncGeneratorReject, AsyncGeneratorBuiltinsAssembler) {
 TF_BUILTIN(AsyncGeneratorYieldWithAwait, AsyncGeneratorBuiltinsAssembler) {
   const auto generator = Parameter<JSGeneratorObject>(Descriptor::kGenerator);
   const auto value = Parameter<Object>(Descriptor::kValue);
-  const auto is_caught = Parameter<Oddball>(Descriptor::kIsCaught);
+  const auto is_caught = Parameter<Boolean>(Descriptor::kIsCaught);
   const auto context = Parameter<Context>(Descriptor::kContext);
 
   const TNode<AsyncGeneratorRequest> request =
@@ -671,7 +671,7 @@ TF_BUILTIN(AsyncGeneratorReturn, AsyncGeneratorBuiltinsAssembler) {
   const auto generator =
       Parameter<JSAsyncGeneratorObject>(Descriptor::kGenerator);
   const auto value = Parameter<Object>(Descriptor::kValue);
-  const auto is_caught = Parameter<Oddball>(Descriptor::kIsCaught);
+  const auto is_caught = Parameter<Boolean>(Descriptor::kIsCaught);
   const TNode<AsyncGeneratorRequest> req =
       CAST(LoadFirstAsyncGeneratorRequestFromQueue(generator));
 
diff --git a/deps/v8/src/builtins/builtins-async-iterator-gen.cc b/deps/v8/src/builtins/builtins-async-iterator-gen.cc
index 47bad91b5bd048..9c2b753ae3c991 100644
--- a/deps/v8/src/builtins/builtins-async-iterator-gen.cc
+++ b/deps/v8/src/builtins/builtins-async-iterator-gen.cc
@@ -65,7 +65,7 @@ class AsyncFromSyncBuiltinsAssembler : public AsyncBuiltinsAssembler {
   // Returns a Pair of Nodes, whose first element is the value of the "value"
   // property, and whose second element is the value of the "done" property,
   // converted to a Boolean if needed.
-  std::pair<TNode<Object>, TNode<Oddball>> LoadIteratorResult(
+  std::pair<TNode<Object>, TNode<Boolean>> LoadIteratorResult(
       const TNode<Context> context, const TNode<NativeContext> native_context,
       const TNode<Object> iter_result, Label* if_exception,
       TVariable<Object>* var_exception);
@@ -154,7 +154,7 @@ void AsyncFromSyncBuiltinsAssembler::Generate_AsyncFromSyncIteratorMethod(
   }
 
   TNode<Object> value;
-  TNode<Oddball> done;
+  TNode<Boolean> done;
   std::tie(value, done) =
       LoadIteratorResult(context, native_context, iter_result.value(),
                          &reject_promise, &var_exception);
@@ -193,7 +193,7 @@ void AsyncFromSyncBuiltinsAssembler::Generate_AsyncFromSyncIteratorMethod(
   }
 }
 
-std::pair<TNode<Object>, TNode<Oddball>>
+std::pair<TNode<Object>, TNode<Boolean>>
 AsyncFromSyncBuiltinsAssembler::LoadIteratorResult(
     const TNode<Context> context, const TNode<NativeContext> native_context,
     const TNode<Object> iter_result, Label* if_exception,
diff --git a/deps/v8/src/builtins/builtins-async-module.cc b/deps/v8/src/builtins/builtins-async-module.cc
index e1a2a71c4211a2..9920f0b6dc143b 100644
--- a/deps/v8/src/builtins/builtins-async-module.cc
+++ b/deps/v8/src/builtins/builtins-async-module.cc
@@ -12,7 +12,7 @@ namespace internal {
 BUILTIN(CallAsyncModuleFulfilled) {
   HandleScope handle_scope(isolate);
   Handle<SourceTextModule> module = Handle<SourceTextModule>(
-      SourceTextModule::cast(isolate->context().get(
+      SourceTextModule::cast(isolate->context()->get(
           SourceTextModule::ExecuteAsyncModuleContextSlots::kModule)),
       isolate);
   if (SourceTextModule::AsyncModuleExecutionFulfilled(isolate, module)
@@ -29,7 +29,7 @@ BUILTIN(CallAsyncModuleFulfilled) {
 BUILTIN(CallAsyncModuleRejected) {
   HandleScope handle_scope(isolate);
   Handle<SourceTextModule> module = Handle<SourceTextModule>(
-      SourceTextModule::cast(isolate->context().get(
+      SourceTextModule::cast(isolate->context()->get(
           SourceTextModule::ExecuteAsyncModuleContextSlots::kModule)),
       isolate);
 
diff --git a/deps/v8/src/builtins/builtins-atomics-synchronization.cc b/deps/v8/src/builtins/builtins-atomics-synchronization.cc
index 904d56059702ac..cde44158d7109e 100644
--- a/deps/v8/src/builtins/builtins-atomics-synchronization.cc
+++ b/deps/v8/src/builtins/builtins-atomics-synchronization.cc
@@ -20,7 +20,7 @@ BUILTIN(AtomicsMutexLock) {
   HandleScope scope(isolate);
 
   Handle<Object> js_mutex_obj = args.atOrUndefined(isolate, 1);
-  if (!js_mutex_obj->IsJSAtomicsMutex()) {
+  if (!IsJSAtomicsMutex(*js_mutex_obj)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -28,7 +28,7 @@ BUILTIN(AtomicsMutexLock) {
   }
   Handle<JSAtomicsMutex> js_mutex = Handle<JSAtomicsMutex>::cast(js_mutex_obj);
   Handle<Object> run_under_lock = args.atOrUndefined(isolate, 2);
-  if (!run_under_lock->IsCallable()) {
+  if (!IsCallable(*run_under_lock)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotCallable, run_under_lock));
   }
@@ -62,7 +62,7 @@ BUILTIN(AtomicsMutexTryLock) {
   HandleScope scope(isolate);
 
   Handle<Object> js_mutex_obj = args.atOrUndefined(isolate, 1);
-  if (!js_mutex_obj->IsJSAtomicsMutex()) {
+  if (!IsJSAtomicsMutex(*js_mutex_obj)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -70,7 +70,7 @@ BUILTIN(AtomicsMutexTryLock) {
   }
   Handle<JSAtomicsMutex> js_mutex = Handle<JSAtomicsMutex>::cast(js_mutex_obj);
   Handle<Object> run_under_lock = args.atOrUndefined(isolate, 2);
-  if (!run_under_lock->IsCallable()) {
+  if (!IsCallable(*run_under_lock)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotCallable, run_under_lock));
   }
@@ -102,8 +102,8 @@ BUILTIN(AtomicsConditionWait) {
   Handle<Object> js_condition_obj = args.atOrUndefined(isolate, 1);
   Handle<Object> js_mutex_obj = args.atOrUndefined(isolate, 2);
   Handle<Object> timeout_obj = args.atOrUndefined(isolate, 3);
-  if (!js_condition_obj->IsJSAtomicsCondition() ||
-      !js_mutex_obj->IsJSAtomicsMutex()) {
+  if (!IsJSAtomicsCondition(*js_condition_obj) ||
+      !IsJSAtomicsMutex(*js_mutex_obj)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -111,10 +111,10 @@ BUILTIN(AtomicsConditionWait) {
   }
 
   base::Optional<base::TimeDelta> timeout = base::nullopt;
-  if (!timeout_obj->IsUndefined(isolate)) {
+  if (!IsUndefined(*timeout_obj, isolate)) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, timeout_obj,
                                        Object::ToNumber(isolate, timeout_obj));
-    double ms = timeout_obj->Number();
+    double ms = Object::Number(*timeout_obj);
     if (!std::isnan(ms)) {
       if (ms < 0) ms = 0;
       if (ms <= static_cast<double>(std::numeric_limits<int64_t>::max())) {
@@ -151,7 +151,7 @@ BUILTIN(AtomicsConditionNotify) {
 
   Handle<Object> js_condition_obj = args.atOrUndefined(isolate, 1);
   Handle<Object> count_obj = args.atOrUndefined(isolate, 2);
-  if (!js_condition_obj->IsJSAtomicsCondition()) {
+  if (!IsJSAtomicsCondition(*js_condition_obj)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -159,12 +159,12 @@ BUILTIN(AtomicsConditionNotify) {
   }
 
   uint32_t count;
-  if (count_obj->IsUndefined(isolate)) {
+  if (IsUndefined(*count_obj, isolate)) {
     count = JSAtomicsCondition::kAllWaiters;
   } else {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, count_obj,
                                        Object::ToInteger(isolate, count_obj));
-    double count_double = count_obj->Number();
+    double count_double = Object::Number(*count_obj);
     if (count_double < 0) {
       count_double = 0;
     } else if (count_double > JSAtomicsCondition::kAllWaiters) {
diff --git a/deps/v8/src/builtins/builtins-bigint-gen.cc b/deps/v8/src/builtins/builtins-bigint-gen.cc
index e424c53caf1d94..8db65c9f53c893 100644
--- a/deps/v8/src/builtins/builtins-bigint-gen.cc
+++ b/deps/v8/src/builtins/builtins-bigint-gen.cc
@@ -3,9 +3,11 @@
 // found in the LICENSE file.
 
 #include "src/builtins/builtins-bigint-gen.h"
+
 #include "src/builtins/builtins-utils-gen.h"
 #include "src/builtins/builtins.h"
 #include "src/codegen/code-stub-assembler.h"
+#include "src/objects/dictionary.h"
 
 namespace v8 {
 namespace internal {
diff --git a/deps/v8/src/builtins/builtins-bigint.cc b/deps/v8/src/builtins/builtins-bigint.cc
index ed95a31e998caf..f2265752337571 100644
--- a/deps/v8/src/builtins/builtins-bigint.cc
+++ b/deps/v8/src/builtins/builtins-bigint.cc
@@ -16,7 +16,7 @@ namespace internal {
 
 BUILTIN(BigIntConstructor) {
   HandleScope scope(isolate);
-  if (!args.new_target()->IsUndefined(isolate)) {  // [[Construct]]
+  if (!IsUndefined(*args.new_target(), isolate)) {  // [[Construct]]
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotConstructor,
                               isolate->factory()->BigInt_string()));
@@ -24,14 +24,14 @@ BUILTIN(BigIntConstructor) {
   // [[Call]]
   Handle<Object> value = args.atOrUndefined(isolate, 1);
 
-  if (value->IsJSReceiver()) {
+  if (IsJSReceiver(*value)) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
         isolate, value,
         JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(value),
                                 ToPrimitiveHint::kNumber));
   }
 
-  if (value->IsNumber()) {
+  if (IsNumber(*value)) {
     RETURN_RESULT_OR_FAILURE(isolate, BigInt::FromNumber(isolate, value));
   } else {
     RETURN_RESULT_OR_FAILURE(isolate, BigInt::FromObject(isolate, value));
@@ -52,8 +52,8 @@ BUILTIN(BigIntAsUintN) {
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, bigint,
                                      BigInt::FromObject(isolate, bigint_obj));
 
-  RETURN_RESULT_OR_FAILURE(isolate,
-                           BigInt::AsUintN(isolate, bits->Number(), bigint));
+  RETURN_RESULT_OR_FAILURE(
+      isolate, BigInt::AsUintN(isolate, Object::Number(*bits), bigint));
 }
 
 BUILTIN(BigIntAsIntN) {
@@ -70,7 +70,7 @@ BUILTIN(BigIntAsIntN) {
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, bigint,
                                      BigInt::FromObject(isolate, bigint_obj));
 
-  return *BigInt::AsIntN(isolate, bits->Number(), bigint);
+  return *BigInt::AsIntN(isolate, Object::Number(*bits), bigint);
 }
 
 namespace {
@@ -78,13 +78,13 @@ namespace {
 MaybeHandle<BigInt> ThisBigIntValue(Isolate* isolate, Handle<Object> value,
                                     const char* caller) {
   // 1. If Type(value) is BigInt, return value.
-  if (value->IsBigInt()) return Handle<BigInt>::cast(value);
+  if (IsBigInt(*value)) return Handle<BigInt>::cast(value);
   // 2. If Type(value) is Object and value has a [[BigIntData]] internal slot:
-  if (value->IsJSPrimitiveWrapper()) {
+  if (IsJSPrimitiveWrapper(*value)) {
     // 2a. Assert: value.[[BigIntData]] is a BigInt value.
     // 2b. Return value.[[BigIntData]].
-    Object data = JSPrimitiveWrapper::cast(*value).value();
-    if (data.IsBigInt()) return handle(BigInt::cast(data), isolate);
+    Tagged<Object> data = JSPrimitiveWrapper::cast(*value)->value();
+    if (IsBigInt(data)) return handle(BigInt::cast(data), isolate);
   }
   // 3. Throw a TypeError exception.
   THROW_NEW_ERROR(
@@ -95,8 +95,8 @@ MaybeHandle<BigInt> ThisBigIntValue(Isolate* isolate, Handle<Object> value,
       BigInt);
 }
 
-Object BigIntToStringImpl(Handle<Object> receiver, Handle<Object> radix,
-                          Isolate* isolate, const char* builtin_name) {
+Tagged<Object> BigIntToStringImpl(Handle<Object> receiver, Handle<Object> radix,
+                                  Isolate* isolate, const char* builtin_name) {
   // 1. Let x be ? thisBigIntValue(this value).
   Handle<BigInt> x;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
@@ -104,11 +104,11 @@ Object BigIntToStringImpl(Handle<Object> receiver, Handle<Object> radix,
   // 2. If radix is not present, let radixNumber be 10.
   // 3. Else if radix is undefined, let radixNumber be 10.
   int radix_number = 10;
-  if (!radix->IsUndefined(isolate)) {
+  if (!IsUndefined(*radix, isolate)) {
     // 4. Else, let radixNumber be ? ToInteger(radix).
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, radix,
                                        Object::ToInteger(isolate, radix));
-    double radix_double = radix->Number();
+    double radix_double = Object::Number(*radix);
     // 5. If radixNumber < 2 or radixNumber > 36, throw a RangeError exception.
     if (radix_double < 2 || radix_double > 36) {
       THROW_NEW_ERROR_RETURN_FAILURE(
diff --git a/deps/v8/src/builtins/builtins-bigint.tq b/deps/v8/src/builtins/builtins-bigint.tq
index 40e42840bfac89..b8f878c5d1e2bd 100644
--- a/deps/v8/src/builtins/builtins-bigint.tq
+++ b/deps/v8/src/builtins/builtins-bigint.tq
@@ -75,8 +75,9 @@ macro InvertSign(sign: uint32): uint32 {
   return sign == kPositiveSign ? kNegativeSign : kPositiveSign;
 }
 
-macro AllocateEmptyBigIntNoThrow(implicit context: Context)(
-    sign: uint32, length: intptr): MutableBigInt labels BigIntTooBig {
+macro AllocateEmptyBigIntNoThrow(
+    implicit context: Context)(sign: uint32,
+    length: intptr): MutableBigInt labels BigIntTooBig {
   if (length > kBigIntMaxLength) {
     goto BigIntTooBig;
   }
@@ -86,8 +87,8 @@ macro AllocateEmptyBigIntNoThrow(implicit context: Context)(
   return result;
 }
 
-macro AllocateEmptyBigInt(implicit context: Context)(
-    sign: uint32, length: intptr): MutableBigInt {
+macro AllocateEmptyBigInt(
+    implicit context: Context)(sign: uint32, length: intptr): MutableBigInt {
   try {
     return AllocateEmptyBigIntNoThrow(sign, length) otherwise BigIntTooBig;
   } label BigIntTooBig {
@@ -99,8 +100,9 @@ macro MutableBigIntAbsoluteCompare(x: BigIntBase, y: BigIntBase): int32 {
   return CppAbsoluteCompare(x, y);
 }
 
-macro MutableBigIntAbsoluteSub(implicit context: Context)(
-    x: BigInt, y: BigInt, resultSign: uint32): BigInt {
+macro MutableBigIntAbsoluteSub(
+    implicit context: Context)(x: BigInt, y: BigInt,
+    resultSign: uint32): BigInt {
   const xlength = ReadBigIntLength(x);
   const ylength = ReadBigIntLength(y);
   const xsign = ReadBigIntSign(x);
@@ -120,8 +122,8 @@ macro MutableBigIntAbsoluteSub(implicit context: Context)(
   return Convert<BigInt>(result);
 }
 
-macro MutableBigIntAbsoluteAdd(implicit context: Context)(
-    xBigint: BigInt, yBigint: BigInt,
+macro MutableBigIntAbsoluteAdd(
+    implicit context: Context)(xBigint: BigInt, yBigint: BigInt,
     resultSign: uint32): BigInt labels BigIntTooBig {
   let xlength = ReadBigIntLength(xBigint);
   let ylength = ReadBigIntLength(yBigint);
@@ -173,8 +175,8 @@ macro BigIntAddImpl(implicit context: Context)(x: BigInt, y: BigInt): BigInt
   return MutableBigIntAbsoluteSub(y, x, InvertSign(xsign));
 }
 
-builtin BigIntAddNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntAddNoThrow(implicit context: Context)(x: BigInt, y: BigInt):
+    Numeric {
   try {
     return BigIntAddImpl(x, y) otherwise BigIntTooBig;
   } label BigIntTooBig {
@@ -183,8 +185,8 @@ builtin BigIntAddNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntAdd(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntAdd(implicit context: Context)(xNum: Numeric, yNum: Numeric):
+    BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -197,8 +199,8 @@ builtin BigIntAdd(implicit context: Context)(
   }
 }
 
-macro BigIntSubtractImpl(implicit context: Context)(
-    x: BigInt, y: BigInt): BigInt labels BigIntTooBig {
+macro BigIntSubtractImpl(implicit context: Context)(x: BigInt, y: BigInt):
+    BigInt labels BigIntTooBig {
   const xsign = ReadBigIntSign(x);
   const ysign = ReadBigIntSign(y);
   if (xsign != ysign) {
@@ -215,8 +217,8 @@ macro BigIntSubtractImpl(implicit context: Context)(
   return MutableBigIntAbsoluteSub(y, x, InvertSign(xsign));
 }
 
-builtin BigIntSubtractNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntSubtractNoThrow(
+    implicit context: Context)(x: BigInt, y: BigInt): Numeric {
   try {
     return BigIntSubtractImpl(x, y) otherwise BigIntTooBig;
   } label BigIntTooBig {
@@ -225,8 +227,8 @@ builtin BigIntSubtractNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntSubtract(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntSubtract(
+    implicit context: Context)(xNum: Numeric, yNum: Numeric): BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -268,8 +270,8 @@ macro BigIntMultiplyImpl(implicit context: Context)(x: BigInt, y: BigInt):
   return Convert<BigInt>(result);
 }
 
-builtin BigIntMultiplyNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntMultiplyNoThrow(
+    implicit context: Context)(x: BigInt, y: BigInt): Numeric {
   try {
     return BigIntMultiplyImpl(x, y) otherwise BigIntTooBig,
            TerminationRequested;
@@ -282,8 +284,8 @@ builtin BigIntMultiplyNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntMultiply(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntMultiply(
+    implicit context: Context)(xNum: Numeric, yNum: Numeric): BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -337,8 +339,8 @@ macro BigIntDivideImpl(implicit context: Context)(x: BigInt, y: BigInt):
   return Convert<BigInt>(result);
 }
 
-builtin BigIntDivideNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntDivideNoThrow(implicit context: Context)(x: BigInt, y: BigInt):
+    Numeric {
   try {
     return BigIntDivideImpl(x, y) otherwise BigIntDivZero, TerminationRequested;
   } label BigIntDivZero {
@@ -350,8 +352,8 @@ builtin BigIntDivideNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntDivide(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntDivide(implicit context: Context)(xNum: Numeric, yNum: Numeric):
+    BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -399,8 +401,8 @@ macro BigIntModulusImpl(implicit context: Context)(x: BigInt, y: BigInt):
   return Convert<BigInt>(result);
 }
 
-builtin BigIntModulusNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntModulusNoThrow(implicit context: Context)(x: BigInt, y: BigInt):
+    Numeric {
   try {
     return BigIntModulusImpl(x, y) otherwise BigIntDivZero,
            TerminationRequested;
@@ -413,8 +415,8 @@ builtin BigIntModulusNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntModulus(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntModulus(
+    implicit context: Context)(xNum: Numeric, yNum: Numeric): BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -430,8 +432,8 @@ builtin BigIntModulus(implicit context: Context)(
   }
 }
 
-macro BigIntBitwiseAndImpl(implicit context: Context)(
-    x: BigInt, y: BigInt): BigInt labels BigIntTooBig {
+macro BigIntBitwiseAndImpl(implicit context: Context)(x: BigInt, y: BigInt):
+    BigInt labels BigIntTooBig {
   const xlength = ReadBigIntLength(x);
   const ylength = ReadBigIntLength(y);
 
@@ -473,8 +475,8 @@ macro BigIntBitwiseAndImpl(implicit context: Context)(
   }
 }
 
-builtin BigIntBitwiseAndNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntBitwiseAndNoThrow(
+    implicit context: Context)(x: BigInt, y: BigInt): Numeric {
   try {
     return BigIntBitwiseAndImpl(x, y) otherwise BigIntTooBig;
   } label BigIntTooBig {
@@ -483,8 +485,8 @@ builtin BigIntBitwiseAndNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntBitwiseAnd(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntBitwiseAnd(
+    implicit context: Context)(xNum: Numeric, yNum: Numeric): BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -497,8 +499,8 @@ builtin BigIntBitwiseAnd(implicit context: Context)(
   }
 }
 
-macro BigIntBitwiseOrImpl(implicit context: Context)(
-    x: BigInt, y: BigInt): BigInt {
+macro BigIntBitwiseOrImpl(implicit context: Context)(x: BigInt, y: BigInt):
+    BigInt {
   const xlength = ReadBigIntLength(x);
   const ylength = ReadBigIntLength(y);
 
@@ -539,13 +541,13 @@ macro BigIntBitwiseOrImpl(implicit context: Context)(
   }
 }
 
-builtin BigIntBitwiseOrNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntBitwiseOrNoThrow(
+    implicit context: Context)(x: BigInt, y: BigInt): Numeric {
   return BigIntBitwiseOrImpl(x, y);
 }
 
-builtin BigIntBitwiseOr(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntBitwiseOr(
+    implicit context: Context)(xNum: Numeric, yNum: Numeric): BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -556,8 +558,8 @@ builtin BigIntBitwiseOr(implicit context: Context)(
   }
 }
 
-macro BigIntBitwiseXorImpl(implicit context: Context)(
-    x: BigInt, y: BigInt): BigInt labels BigIntTooBig {
+macro BigIntBitwiseXorImpl(implicit context: Context)(x: BigInt, y: BigInt):
+    BigInt labels BigIntTooBig {
   const xlength = ReadBigIntLength(x);
   const ylength = ReadBigIntLength(y);
 
@@ -601,8 +603,8 @@ macro BigIntBitwiseXorImpl(implicit context: Context)(
   }
 }
 
-builtin BigIntBitwiseXorNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntBitwiseXorNoThrow(
+    implicit context: Context)(x: BigInt, y: BigInt): Numeric {
   try {
     return BigIntBitwiseXorImpl(x, y) otherwise BigIntTooBig;
   } label BigIntTooBig {
@@ -611,8 +613,8 @@ builtin BigIntBitwiseXorNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntBitwiseXor(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntBitwiseXor(
+    implicit context: Context)(xNum: Numeric, yNum: Numeric): BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -625,8 +627,9 @@ builtin BigIntBitwiseXor(implicit context: Context)(
   }
 }
 
-macro MutableBigIntLeftShiftByAbsolute(implicit context: Context)(
-    x: BigInt, y: BigInt): BigInt labels BigIntTooBig {
+macro MutableBigIntLeftShiftByAbsolute(
+    implicit context: Context)(x: BigInt,
+    y: BigInt): BigInt labels BigIntTooBig {
   const xlength = ReadBigIntLength(x);
   const ylength = ReadBigIntLength(y);
 
@@ -674,8 +677,8 @@ macro RightShiftByMaximum(implicit context: Context)(sign: uint32): BigInt {
   }
 }
 
-macro MutableBigIntRightShiftByAbsolute(implicit context: Context)(
-    x: BigInt, y: BigInt): BigInt {
+macro MutableBigIntRightShiftByAbsolute(
+    implicit context: Context)(x: BigInt, y: BigInt): BigInt {
   const xlength = ReadBigIntLength(x);
   const ylength = ReadBigIntLength(y);
 
@@ -715,8 +718,8 @@ macro MutableBigIntRightShiftByAbsolute(implicit context: Context)(
   return Convert<BigInt>(result);
 }
 
-macro BigIntShiftLeftImpl(implicit context: Context)(
-    x: BigInt, y: BigInt): BigInt labels BigIntTooBig {
+macro BigIntShiftLeftImpl(implicit context: Context)(x: BigInt, y: BigInt):
+    BigInt labels BigIntTooBig {
   if (ReadBigIntSign(y) == kNegativeSign) {
     return MutableBigIntRightShiftByAbsolute(x, y);
   } else {
@@ -724,8 +727,8 @@ macro BigIntShiftLeftImpl(implicit context: Context)(
   }
 }
 
-macro BigIntShiftRightImpl(implicit context: Context)(
-    x: BigInt, y: BigInt): BigInt labels BigIntTooBig {
+macro BigIntShiftRightImpl(implicit context: Context)(x: BigInt, y: BigInt):
+    BigInt labels BigIntTooBig {
   if (ReadBigIntSign(y) == kNegativeSign) {
     return MutableBigIntLeftShiftByAbsolute(x, y) otherwise BigIntTooBig;
   } else {
@@ -733,8 +736,8 @@ macro BigIntShiftRightImpl(implicit context: Context)(
   }
 }
 
-builtin BigIntShiftLeftNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntShiftLeftNoThrow(
+    implicit context: Context)(x: BigInt, y: BigInt): Numeric {
   try {
     return BigIntShiftLeftImpl(x, y) otherwise BigIntTooBig;
   } label BigIntTooBig {
@@ -743,8 +746,8 @@ builtin BigIntShiftLeftNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntShiftLeft(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntShiftLeft(
+    implicit context: Context)(xNum: Numeric, yNum: Numeric): BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -757,8 +760,8 @@ builtin BigIntShiftLeft(implicit context: Context)(
   }
 }
 
-builtin BigIntShiftRightNoThrow(implicit context: Context)(
-    x: BigInt, y: BigInt): Numeric {
+builtin BigIntShiftRightNoThrow(
+    implicit context: Context)(x: BigInt, y: BigInt): Numeric {
   try {
     return BigIntShiftRightImpl(x, y) otherwise BigIntTooBig;
   } label BigIntTooBig {
@@ -767,8 +770,8 @@ builtin BigIntShiftRightNoThrow(implicit context: Context)(
   }
 }
 
-builtin BigIntShiftRight(implicit context: Context)(
-    xNum: Numeric, yNum: Numeric): BigInt {
+builtin BigIntShiftRight(
+    implicit context: Context)(xNum: Numeric, yNum: Numeric): BigInt {
   try {
     const x = Cast<BigInt>(xNum) otherwise MixedTypes;
     const y = Cast<BigInt>(yNum) otherwise MixedTypes;
@@ -781,7 +784,8 @@ builtin BigIntShiftRight(implicit context: Context)(
   }
 }
 
-builtin BigIntEqual(implicit context: Context)(x: BigInt, y: BigInt): Boolean {
+builtin BigIntEqual(implicit context: Context)(x: BigInt, y: BigInt):
+    Boolean {
   if (ReadBigIntSign(x) != ReadBigIntSign(y)) {
     return False;
   }
@@ -803,8 +807,8 @@ builtin BigIntEqual(implicit context: Context)(x: BigInt, y: BigInt): Boolean {
 
 // Returns r such that r < 0 if |x| < |y|; r > 0 if |x| > |y|;
 // r == 0 if |x| == |y|.
-macro BigIntCompareAbsolute(implicit context: Context)(
-    x: BigInt, y: BigInt): intptr {
+macro BigIntCompareAbsolute(
+    implicit context: Context)(x: BigInt, y: BigInt): intptr {
   const xlength = ReadBigIntLength(x);
   const ylength = ReadBigIntLength(y);
   const diff = xlength - ylength;
@@ -824,7 +828,8 @@ macro BigIntCompareAbsolute(implicit context: Context)(
 }
 
 // Returns r such that r < 0 if x < y; r > 0 if x > y; r == 0 if x == y.
-macro BigIntCompare(implicit context: Context)(x: BigInt, y: BigInt): intptr {
+macro BigIntCompare(implicit context: Context)(x: BigInt, y: BigInt):
+    intptr {
   const xsign = ReadBigIntSign(x);
   const ysign = ReadBigIntSign(y);
   if (xsign != ysign) {
@@ -836,23 +841,23 @@ macro BigIntCompare(implicit context: Context)(x: BigInt, y: BigInt): intptr {
   return xsign == kPositiveSign ? diff : 0 - diff;
 }
 
-builtin BigIntLessThan(implicit context: Context)(
-    x: BigInt, y: BigInt): Boolean {
+builtin BigIntLessThan(implicit context: Context)(x: BigInt, y: BigInt):
+    Boolean {
   return BigIntCompare(x, y) < 0 ? True : False;
 }
 
-builtin BigIntGreaterThan(implicit context: Context)(
-    x: BigInt, y: BigInt): Boolean {
+builtin BigIntGreaterThan(implicit context: Context)(x: BigInt, y: BigInt):
+    Boolean {
   return BigIntCompare(x, y) > 0 ? True : False;
 }
 
-builtin BigIntLessThanOrEqual(implicit context: Context)(
-    x: BigInt, y: BigInt): Boolean {
+builtin BigIntLessThanOrEqual(
+    implicit context: Context)(x: BigInt, y: BigInt): Boolean {
   return BigIntCompare(x, y) <= 0 ? True : False;
 }
 
-builtin BigIntGreaterThanOrEqual(implicit context: Context)(
-    x: BigInt, y: BigInt): Boolean {
+builtin BigIntGreaterThanOrEqual(
+    implicit context: Context)(x: BigInt, y: BigInt): Boolean {
   return BigIntCompare(x, y) >= 0 ? True : False;
 }
 
diff --git a/deps/v8/src/builtins/builtins-call-gen.cc b/deps/v8/src/builtins/builtins-call-gen.cc
index 896875cada149a..1f98e20e678afa 100644
--- a/deps/v8/src/builtins/builtins-call-gen.cc
+++ b/deps/v8/src/builtins/builtins-call-gen.cc
@@ -64,6 +64,20 @@ void Builtins::Generate_CallFunctionForwardVarargs(MacroAssembler* masm) {
       masm->isolate()->builtins()->CallFunction());
 }
 
+void Builtins::Generate_CallApiCallbackGeneric(MacroAssembler* masm) {
+  Generate_CallApiCallbackImpl(masm, CallApiCallbackMode::kGeneric);
+}
+
+void Builtins::Generate_CallApiCallbackOptimizedNoProfiling(
+    MacroAssembler* masm) {
+  Generate_CallApiCallbackImpl(masm,
+                               CallApiCallbackMode::kOptimizedNoProfiling);
+}
+
+void Builtins::Generate_CallApiCallbackOptimized(MacroAssembler* masm) {
+  Generate_CallApiCallbackImpl(masm, CallApiCallbackMode::kOptimized);
+}
+
 // TODO(cbruni): Try reusing code between builtin versions to avoid binary
 // overhead.
 TF_BUILTIN(Call_ReceiverIsNullOrUndefined_Baseline_Compact,
@@ -333,8 +347,8 @@ void CallOrConstructBuiltinsAssembler::CallOrConstructDoubleVarargs(
   CSA_DCHECK(this, WordNotEqual(intptr_length, IntPtrConstant(0)));
 
   // Allocate a new FixedArray of Objects.
-  TNode<FixedArray> new_elements = CAST(AllocateFixedArray(
-      new_kind, intptr_length, AllocationFlag::kAllowLargeObjectAllocation));
+  TNode<FixedArray> new_elements =
+      CAST(AllocateFixedArray(new_kind, intptr_length));
   // CopyFixedArrayElements does not distinguish between holey and packed for
   // its first argument, so we don't need to dispatch on {kind} here.
   CopyFixedArrayElements(PACKED_DOUBLE_ELEMENTS, elements, new_kind,
@@ -669,11 +683,25 @@ TNode<JSReceiver> CallOrConstructBuiltinsAssembler::GetCompatibleReceiver(
   return CAST(var_holder.value());
 }
 
+// static
+constexpr bool CallOrConstructBuiltinsAssembler::IsAccessCheckRequired(
+    CallFunctionTemplateMode mode) {
+  switch (mode) {
+    case CallFunctionTemplateMode::kGeneric:
+    case CallFunctionTemplateMode::kCheckAccess:
+    case CallFunctionTemplateMode::kCheckAccessAndCompatibleReceiver:
+      return true;
+
+    case CallFunctionTemplateMode::kCheckCompatibleReceiver:
+      return false;
+  }
+}
+
 // This calls an API callback by passing a {FunctionTemplateInfo},
 // does appropriate access and compatible receiver checks.
 void CallOrConstructBuiltinsAssembler::CallFunctionTemplate(
     CallFunctionTemplateMode mode,
-    TNode<FunctionTemplateInfo> function_template_info, TNode<IntPtrT> argc,
+    TNode<FunctionTemplateInfo> function_template_info, TNode<Int32T> argc,
     TNode<Context> context) {
   CodeStubArguments args(this, argc);
   Label throw_illegal_invocation(this, Label::kDeferred);
@@ -685,18 +713,18 @@ void CallOrConstructBuiltinsAssembler::CallFunctionTemplate(
   // _and_ the {function_template_info} doesn't have the "accepts
   // any receiver" bit set.
   TNode<JSReceiver> receiver = CAST(args.GetReceiver());
-  if (mode == CallFunctionTemplateMode::kCheckAccess ||
-      mode == CallFunctionTemplateMode::kCheckAccessAndCompatibleReceiver) {
+  if (IsAccessCheckRequired(mode)) {
     TNode<Map> receiver_map = LoadMap(receiver);
     Label receiver_needs_access_check(this, Label::kDeferred),
         receiver_done(this);
     GotoIfNot(IsSetWord32<Map::Bits1::IsAccessCheckNeededBit>(
                   LoadMapBitField(receiver_map)),
               &receiver_done);
-    TNode<IntPtrT> function_template_info_flags = LoadAndUntagObjectField(
-        function_template_info, FunctionTemplateInfo::kFlagOffset);
-    Branch(IsSetWord(function_template_info_flags,
-                     1 << FunctionTemplateInfo::AcceptAnyReceiverBit::kShift),
+    TNode<Int32T> function_template_info_flags =
+        LoadAndUntagToWord32ObjectField(function_template_info,
+                                        FunctionTemplateInfo::kFlagOffset);
+    Branch(IsSetWord32<FunctionTemplateInfo::AcceptAnyReceiverBit>(
+               function_template_info_flags),
            &receiver_done, &receiver_needs_access_check);
 
     BIND(&receiver_needs_access_check);
@@ -711,41 +739,96 @@ void CallOrConstructBuiltinsAssembler::CallFunctionTemplate(
   // Figure out the API holder for the {receiver} depending on the
   // {mode} and the signature on the {function_template_info}.
   TNode<JSReceiver> holder;
-  if (mode == CallFunctionTemplateMode::kCheckAccess) {
-    // We did the access check (including the ToObject) above, so
-    // {receiver} is a JSReceiver at this point, and we don't need
-    // to perform any "compatible receiver check", so {holder} is
-    // actually the {receiver}.
-    holder = receiver;
-  } else {
-    // If the {function_template_info} doesn't specify any signature, we
-    // just use the receiver as the holder for the API callback, otherwise
-    // we need to look for a compatible holder in the receiver's hidden
-    // prototype chain.
-    TNode<HeapObject> signature = LoadObjectField<HeapObject>(
-        function_template_info, FunctionTemplateInfo::kSignatureOffset);
-    holder = Select<JSReceiver>(
-        IsUndefined(signature),  // --
-        [&]() { return receiver; },
-        [&]() { return GetCompatibleReceiver(receiver, signature, context); });
+  switch (mode) {
+    case CallFunctionTemplateMode::kCheckAccess:
+      // We did the access check (including the ToObject) above, so
+      // {receiver} is a JSReceiver at this point, and we don't need
+      // to perform any "compatible receiver check", so {holder} is
+      // actually the {receiver}.
+      holder = receiver;
+      break;
+
+    case CallFunctionTemplateMode::kCheckAccessAndCompatibleReceiver:
+    case CallFunctionTemplateMode::kCheckCompatibleReceiver: {
+      // The {function_template_info} has a signature, so look for a compatible
+      // holder in the receiver's hidden prototype chain.
+      TNode<HeapObject> signature = LoadObjectField<HeapObject>(
+          function_template_info, FunctionTemplateInfo::kSignatureOffset);
+      CSA_DCHECK(this, Word32BinaryNot(IsUndefined(signature)));
+      holder = GetCompatibleReceiver(receiver, signature, context);
+      break;
+    }
+    case CallFunctionTemplateMode::kGeneric: {
+      // If the {function_template_info} doesn't specify any signature, we
+      // just use the receiver as the holder for the API callback, otherwise
+      // we need to look for a compatible holder in the receiver's hidden
+      // prototype chain.
+      TNode<HeapObject> signature = LoadObjectField<HeapObject>(
+          function_template_info, FunctionTemplateInfo::kSignatureOffset);
+      holder = Select<JSReceiver>(
+          IsUndefined(signature),  // --
+          [&]() { return receiver; },
+          [&]() {
+            return GetCompatibleReceiver(receiver, signature, context);
+          });
+      break;
+    }
+  }
+
+  TNode<HeapObject> call_code = CAST(LoadObjectField(
+      function_template_info, FunctionTemplateInfo::kCallCodeOffset));
+  // If the function doesn't have an associated C++ code to execute, just
+  // return the receiver as would an empty function do (see
+  // HandleApiCallHelper).
+  {
+    Label if_continue(this);
+    GotoIfNot(IsUndefined(call_code), &if_continue);
+    args.PopAndReturn(receiver);
+
+    Bind(&if_continue);
   }
 
   // Perform the actual API callback invocation via CallApiCallback.
-  TNode<CallHandlerInfo> call_handler_info = LoadObjectField<CallHandlerInfo>(
-      function_template_info, FunctionTemplateInfo::kCallCodeOffset);
-  TNode<RawPtrT> callback = LoadCallHandlerInfoJsCallbackPtr(call_handler_info);
-  TNode<Object> call_data =
-      LoadObjectField<Object>(call_handler_info, CallHandlerInfo::kDataOffset);
-  TailCallStub(CodeFactory::CallApiCallback(isolate()), context, callback,
-               TruncateIntPtrToInt32(args.GetLengthWithoutReceiver()),
-               call_data, holder);
+  TNode<CallHandlerInfo> call_handler_info = CAST(call_code);
+  switch (mode) {
+    case CallFunctionTemplateMode::kGeneric:
+      TailCallStub(
+          Builtins::CallableFor(isolate(), Builtin::kCallApiCallbackGeneric),
+          context, TruncateIntPtrToInt32(args.GetLengthWithoutReceiver()),
+          call_handler_info, holder);
+      break;
+
+    case CallFunctionTemplateMode::kCheckAccess:
+    case CallFunctionTemplateMode::kCheckAccessAndCompatibleReceiver:
+    case CallFunctionTemplateMode::kCheckCompatibleReceiver: {
+      TNode<RawPtrT> callback_address =
+          LoadCallHandlerInfoJsCallbackPtr(call_handler_info);
+      TNode<Object> call_data =
+          LoadObjectField(call_handler_info, CallHandlerInfo::kDataOffset);
+      TailCallStub(
+          Builtins::CallableFor(isolate(), Builtin::kCallApiCallbackOptimized),
+          context, callback_address,
+          TruncateIntPtrToInt32(args.GetLengthWithoutReceiver()), call_data,
+          holder);
+      break;
+    }
+  }
+}
+
+TF_BUILTIN(CallFunctionTemplate_Generic, CallOrConstructBuiltinsAssembler) {
+  auto context = Parameter<Context>(Descriptor::kContext);
+  auto function_template_info = UncheckedParameter<FunctionTemplateInfo>(
+      Descriptor::kFunctionTemplateInfo);
+  auto argc = UncheckedParameter<Int32T>(Descriptor::kArgumentsCount);
+  CallFunctionTemplate(CallFunctionTemplateMode::kGeneric,
+                       function_template_info, argc, context);
 }
 
 TF_BUILTIN(CallFunctionTemplate_CheckAccess, CallOrConstructBuiltinsAssembler) {
   auto context = Parameter<Context>(Descriptor::kContext);
   auto function_template_info = UncheckedParameter<FunctionTemplateInfo>(
       Descriptor::kFunctionTemplateInfo);
-  auto argc = UncheckedParameter<IntPtrT>(Descriptor::kArgumentsCount);
+  auto argc = UncheckedParameter<Int32T>(Descriptor::kArgumentsCount);
   CallFunctionTemplate(CallFunctionTemplateMode::kCheckAccess,
                        function_template_info, argc, context);
 }
@@ -755,7 +838,7 @@ TF_BUILTIN(CallFunctionTemplate_CheckCompatibleReceiver,
   auto context = Parameter<Context>(Descriptor::kContext);
   auto function_template_info = UncheckedParameter<FunctionTemplateInfo>(
       Descriptor::kFunctionTemplateInfo);
-  auto argc = UncheckedParameter<IntPtrT>(Descriptor::kArgumentsCount);
+  auto argc = UncheckedParameter<Int32T>(Descriptor::kArgumentsCount);
   CallFunctionTemplate(CallFunctionTemplateMode::kCheckCompatibleReceiver,
                        function_template_info, argc, context);
 }
@@ -765,11 +848,41 @@ TF_BUILTIN(CallFunctionTemplate_CheckAccessAndCompatibleReceiver,
   auto context = Parameter<Context>(Descriptor::kContext);
   auto function_template_info = UncheckedParameter<FunctionTemplateInfo>(
       Descriptor::kFunctionTemplateInfo);
-  auto argc = UncheckedParameter<IntPtrT>(Descriptor::kArgumentsCount);
+  auto argc = UncheckedParameter<Int32T>(Descriptor::kArgumentsCount);
   CallFunctionTemplate(
       CallFunctionTemplateMode::kCheckAccessAndCompatibleReceiver,
       function_template_info, argc, context);
 }
 
+TF_BUILTIN(HandleApiCallOrConstruct, CallOrConstructBuiltinsAssembler) {
+  auto target = Parameter<Object>(Descriptor::kTarget);
+  auto new_target = Parameter<Object>(Descriptor::kNewTarget);
+  auto context = Parameter<Context>(Descriptor::kContext);
+  auto argc = UncheckedParameter<Int32T>(Descriptor::kActualArgumentsCount);
+
+  Label if_call(this), if_construct(this);
+  Branch(IsUndefined(new_target), &if_call, &if_construct);
+
+  BIND(&if_call);
+  {
+    TNode<SharedFunctionInfo> shared =
+        LoadJSFunctionSharedFunctionInfo(CAST(target));
+    TNode<FunctionTemplateInfo> function_template_info =
+        CAST(LoadSharedFunctionInfoFunctionData(shared));
+
+    // Tail call to the stub while leaving all the incoming JS arguments on
+    // the stack.
+    TailCallBuiltin(Builtin::kCallFunctionTemplate_Generic, context,
+                    function_template_info, argc);
+  }
+  BIND(&if_construct);
+  {
+    // Tail call to the stub while leaving all the incoming JS arguments on
+    // the stack.
+    TailCallBuiltin(Builtin::kHandleApiConstruct, context, target, new_target,
+                    argc);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/builtins/builtins-call-gen.h b/deps/v8/src/builtins/builtins-call-gen.h
index 268d7b3d91a631..21a95bff24fdbd 100644
--- a/deps/v8/src/builtins/builtins-call-gen.h
+++ b/deps/v8/src/builtins/builtins-call-gen.h
@@ -37,14 +37,25 @@ class CallOrConstructBuiltinsAssembler : public CodeStubAssembler {
                     base::Optional<TNode<Object>> = base::nullopt);
 
   enum class CallFunctionTemplateMode : uint8_t {
+    // This version is for using from IC system and generic builtins like
+    // HandleApiCallOrConstruct. It does both access and receiver compatibility
+    // checks if necessary and uses CallApiCallbackGeneric for calling Api
+    // function in order to support side-effects checking and make the Api
+    // function show up in the stack trace in case of exception.
+    kGeneric,
+
+    // These versions are used for generating calls from optimized code with
+    // respective checks and use CallApiCallbackOptimized for calling Api
+    // function.
     kCheckAccess,
     kCheckCompatibleReceiver,
     kCheckAccessAndCompatibleReceiver,
   };
+  constexpr static bool IsAccessCheckRequired(CallFunctionTemplateMode mode);
 
   void CallFunctionTemplate(CallFunctionTemplateMode mode,
                             TNode<FunctionTemplateInfo> function_template_info,
-                            TNode<IntPtrT> argc, TNode<Context> context);
+                            TNode<Int32T> argc, TNode<Context> context);
 
   void BuildConstruct(TNode<Object> target, TNode<Object> new_target,
                       TNode<Int32T> argc, const LazyNode<Context>& context,
diff --git a/deps/v8/src/builtins/builtins-callsite.cc b/deps/v8/src/builtins/builtins-callsite.cc
index 60f347f643cded..fef73e8d1ccdf1 100644
--- a/deps/v8/src/builtins/builtins-callsite.cc
+++ b/deps/v8/src/builtins/builtins-callsite.cc
@@ -27,13 +27,13 @@ namespace internal {
 
 namespace {
 
-Object PositiveNumberOrNull(int value, Isolate* isolate) {
+Tagged<Object> PositiveNumberOrNull(int value, Isolate* isolate) {
   if (value > 0) return *isolate->factory()->NewNumberFromInt(value);
   return ReadOnlyRoots(isolate).null_value();
 }
 
-bool NativeContextIsForShadowRealm(NativeContext native_context) {
-  return native_context.scope_info().scope_type() == SHADOW_REALM_SCOPE;
+bool NativeContextIsForShadowRealm(Tagged<NativeContext> native_context) {
+  return native_context->scope_info()->scope_type() == SHADOW_REALM_SCOPE;
 }
 
 }  // namespace
@@ -78,9 +78,9 @@ BUILTIN(CallSitePrototypeGetFunction) {
   // in the ShadowRealm, and references to ShadowRealm objects must not exist
   // outside the ShadowRealm.
   if (NativeContextIsForShadowRealm(isolate->raw_native_context()) ||
-      (frame->function().IsJSFunction() &&
+      (IsJSFunction(frame->function()) &&
        NativeContextIsForShadowRealm(
-           JSFunction::cast(frame->function()).native_context()))) {
+           JSFunction::cast(frame->function())->native_context()))) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
         NewTypeError(
@@ -88,8 +88,8 @@ BUILTIN(CallSitePrototypeGetFunction) {
             isolate->factory()->NewStringFromAsciiChecked(method_name)));
   }
   if (frame->IsStrict() ||
-      (frame->function().IsJSFunction() &&
-       JSFunction::cast(frame->function()).shared().is_toplevel())) {
+      (IsJSFunction(frame->function()) &&
+       JSFunction::cast(frame->function())->shared()->is_toplevel())) {
     return ReadOnlyRoots(isolate).undefined_value();
   }
   isolate->CountUsage(v8::Isolate::kCallSiteAPIGetFunctionSloppyCall);
@@ -150,9 +150,9 @@ BUILTIN(CallSitePrototypeGetThis) {
   // in the ShadowRealm, and references to ShadowRealm objects must not exist
   // outside the ShadowRealm.
   if (NativeContextIsForShadowRealm(isolate->raw_native_context()) ||
-      (frame->function().IsJSFunction() &&
+      (IsJSFunction(frame->function()) &&
        NativeContextIsForShadowRealm(
-           JSFunction::cast(frame->function()).native_context()))) {
+           JSFunction::cast(frame->function())->native_context()))) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
         NewTypeError(
@@ -163,7 +163,7 @@ BUILTIN(CallSitePrototypeGetThis) {
   isolate->CountUsage(v8::Isolate::kCallSiteAPIGetThisSloppyCall);
 #if V8_ENABLE_WEBASSEMBLY
   if (frame->IsAsmJsWasm()) {
-    return frame->GetWasmInstance().native_context().global_proxy();
+    return frame->GetWasmInstance()->native_context()->global_proxy();
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
   return frame->receiver_or_instance();
diff --git a/deps/v8/src/builtins/builtins-collections-gen.cc b/deps/v8/src/builtins/builtins-collections-gen.cc
index fb3251a040587e..b229c29aea5324 100644
--- a/deps/v8/src/builtins/builtins-collections-gen.cc
+++ b/deps/v8/src/builtins/builtins-collections-gen.cc
@@ -154,8 +154,7 @@ void BaseCollectionsAssembler::AddConstructorEntriesFromFastJSArray(
              TaggedEqual(GetAddFunction(variant, native_context, collection),
                          add_func));
   CSA_DCHECK(this, IsFastJSArrayWithNoCustomIteration(context, fast_jsarray));
-  TNode<IntPtrT> length = SmiUntag(LoadFastJSArrayLength(fast_jsarray));
-  CSA_DCHECK(this, IntPtrGreaterThanOrEqual(length, IntPtrConstant(0)));
+  TNode<IntPtrT> length = PositiveSmiUntag(LoadFastJSArrayLength(fast_jsarray));
   CSA_DCHECK(
       this, HasInitialCollectionPrototype(variant, native_context, collection));
 
@@ -425,11 +424,13 @@ TNode<IntPtrT> BaseCollectionsAssembler::EstimatedInitialSize(
     TNode<Object> initial_entries, TNode<BoolT> is_fast_jsarray) {
   return Select<IntPtrT>(
       is_fast_jsarray,
-      [=] { return SmiUntag(LoadFastJSArrayLength(CAST(initial_entries))); },
+      [=] {
+        return PositiveSmiUntag(LoadFastJSArrayLength(CAST(initial_entries)));
+      },
       [=] { return IntPtrConstant(0); });
 }
 
-// https://tc39.es/proposal-symbols-as-weakmap-keys/#sec-canbeheldweakly-abstract-operation
+// https://tc39.es/ecma262/#sec-canbeheldweakly
 void BaseCollectionsAssembler::GotoIfCannotBeHeldWeakly(
     const TNode<Object> obj, Label* if_cannot_be_held_weakly) {
   Label check_symbol_key(this);
@@ -444,7 +445,6 @@ void BaseCollectionsAssembler::GotoIfCannotBeHeldWeakly(
          if_cannot_be_held_weakly);
   Goto(&end);
   Bind(&check_symbol_key);
-  GotoIfNot(HasHarmonySymbolAsWeakmapKeyFlag(), if_cannot_be_held_weakly);
   GotoIfNot(IsSymbolInstanceType(instance_type), if_cannot_be_held_weakly);
   TNode<Uint32T> flags = LoadSymbolFlags(CAST(obj));
   GotoIf(Word32And(flags, Symbol::IsInPublicSymbolTableBit::kMask),
@@ -508,188 +508,23 @@ TNode<Object> BaseCollectionsAssembler::LoadAndNormalizeFixedDoubleArrayElement(
   return entry.value();
 }
 
-class CollectionsBuiltinsAssembler : public BaseCollectionsAssembler {
- public:
-  explicit CollectionsBuiltinsAssembler(compiler::CodeAssemblerState* state)
-      : BaseCollectionsAssembler(state) {}
-
-  // Check whether |iterable| is a JS_MAP_KEY_ITERATOR_TYPE or
-  // JS_MAP_VALUE_ITERATOR_TYPE object that is not partially consumed and still
-  // has original iteration behavior.
-  void BranchIfIterableWithOriginalKeyOrValueMapIterator(TNode<Object> iterable,
-                                                         TNode<Context> context,
-                                                         Label* if_true,
-                                                         Label* if_false);
-
-  // Check whether |iterable| is a JS_SET_TYPE or JS_SET_VALUE_ITERATOR_TYPE
-  // object that still has original iteration behavior. In case of the iterator,
-  // the iterator also must not have been partially consumed.
-  void BranchIfIterableWithOriginalValueSetIterator(TNode<Object> iterable,
-                                                    TNode<Context> context,
-                                                    Label* if_true,
-                                                    Label* if_false);
-
- protected:
-  template <typename IteratorType>
-  TNode<HeapObject> AllocateJSCollectionIterator(
-      const TNode<Context> context, int map_index,
-      const TNode<HeapObject> collection);
-  TNode<HeapObject> AllocateTable(Variant variant,
-                                  TNode<IntPtrT> at_least_space_for) override;
-  TNode<IntPtrT> GetHash(const TNode<HeapObject> key);
-  TNode<IntPtrT> CallGetHashRaw(const TNode<HeapObject> key);
-  TNode<Smi> CallGetOrCreateHashRaw(const TNode<HeapObject> key);
-
-  // Transitions the iterator to the non obsolete backing store.
-  // This is a NOP if the [table] is not obsolete.
-  template <typename TableType>
-  using UpdateInTransition = std::function<void(const TNode<TableType> table,
-                                                const TNode<IntPtrT> index)>;
-  template <typename TableType>
-  std::pair<TNode<TableType>, TNode<IntPtrT>> Transition(
-      const TNode<TableType> table, const TNode<IntPtrT> index,
-      UpdateInTransition<TableType> const& update_in_transition);
-  template <typename IteratorType, typename TableType>
-  std::pair<TNode<TableType>, TNode<IntPtrT>> TransitionAndUpdate(
-      const TNode<IteratorType> iterator);
-  template <typename TableType>
-  std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>> NextSkipHoles(
-      TNode<TableType> table, TNode<IntPtrT> index, Label* if_end);
-
-  // Specialization for Smi.
-  // The {result} variable will contain the entry index if the key was found,
-  // or the hash code otherwise.
-  template <typename CollectionType>
-  void FindOrderedHashTableEntryForSmiKey(TNode<CollectionType> table,
-                                          TNode<Smi> key_tagged,
-                                          TVariable<IntPtrT>* result,
-                                          Label* entry_found, Label* not_found);
-  void SameValueZeroSmi(TNode<Smi> key_smi, TNode<Object> candidate_key,
-                        Label* if_same, Label* if_not_same);
-
-  // Specialization for heap numbers.
-  // The {result} variable will contain the entry index if the key was found,
-  // or the hash code otherwise.
-  void SameValueZeroHeapNumber(TNode<Float64T> key_float,
-                               TNode<Object> candidate_key, Label* if_same,
-                               Label* if_not_same);
-  template <typename CollectionType>
-  void FindOrderedHashTableEntryForHeapNumberKey(
-      TNode<CollectionType> table, TNode<HeapNumber> key_heap_number,
-      TVariable<IntPtrT>* result, Label* entry_found, Label* not_found);
-
-  // Specialization for bigints.
-  // The {result} variable will contain the entry index if the key was found,
-  // or the hash code otherwise.
-  void SameValueZeroBigInt(TNode<BigInt> key, TNode<Object> candidate_key,
-                           Label* if_same, Label* if_not_same);
-  template <typename CollectionType>
-  void FindOrderedHashTableEntryForBigIntKey(TNode<CollectionType> table,
-                                             TNode<BigInt> key_big_int,
-                                             TVariable<IntPtrT>* result,
-                                             Label* entry_found,
-                                             Label* not_found);
-
-  // Specialization for string.
-  // The {result} variable will contain the entry index if the key was found,
-  // or the hash code otherwise.
-  template <typename CollectionType>
-  void FindOrderedHashTableEntryForStringKey(TNode<CollectionType> table,
-                                             TNode<String> key_tagged,
-                                             TVariable<IntPtrT>* result,
-                                             Label* entry_found,
-                                             Label* not_found);
-  TNode<IntPtrT> ComputeStringHash(TNode<String> string_key);
-  void SameValueZeroString(TNode<String> key_string,
-                           TNode<Object> candidate_key, Label* if_same,
-                           Label* if_not_same);
-
-  // Specialization for non-strings, non-numbers. For those we only need
-  // reference equality to compare the keys.
-  // The {result} variable will contain the entry index if the key was found,
-  // or the hash code otherwise. If the hash-code has not been computed, it
-  // should be Smi -1.
-  template <typename CollectionType>
-  void FindOrderedHashTableEntryForOtherKey(TNode<CollectionType> table,
-                                            TNode<HeapObject> key_heap_object,
-                                            TVariable<IntPtrT>* result,
-                                            Label* entry_found,
-                                            Label* not_found);
-
-  template <typename CollectionType>
-  void TryLookupOrderedHashTableIndex(const TNode<CollectionType> table,
-                                      const TNode<Object> key,
-                                      TVariable<IntPtrT>* result,
-                                      Label* if_entry_found,
-                                      Label* if_not_found);
-
-  const TNode<Object> NormalizeNumberKey(const TNode<Object> key);
-  void StoreOrderedHashMapNewEntry(const TNode<OrderedHashMap> table,
-                                   const TNode<Object> key,
-                                   const TNode<Object> value,
-                                   const TNode<IntPtrT> hash,
-                                   const TNode<IntPtrT> number_of_buckets,
-                                   const TNode<IntPtrT> occupancy);
-
-  void StoreOrderedHashSetNewEntry(const TNode<OrderedHashSet> table,
-                                   const TNode<Object> key,
-                                   const TNode<IntPtrT> hash,
-                                   const TNode<IntPtrT> number_of_buckets,
-                                   const TNode<IntPtrT> occupancy);
-
-  // Create a JSArray with PACKED_ELEMENTS kind from a Map.prototype.keys() or
-  // Map.prototype.values() iterator. The iterator is assumed to satisfy
-  // IterableWithOriginalKeyOrValueMapIterator. This function will skip the
-  // iterator and iterate directly on the underlying hash table. In the end it
-  // will update the state of the iterator to 'exhausted'.
-  TNode<JSArray> MapIteratorToList(TNode<Context> context,
-                                   TNode<JSMapIterator> iterator);
-
-  // Create a JSArray with PACKED_ELEMENTS kind from a Set.prototype.keys() or
-  // Set.prototype.values() iterator, or a Set. The |iterable| is assumed to
-  // satisfy IterableWithOriginalValueSetIterator. This function will skip the
-  // iterator and iterate directly on the underlying hash table. In the end, if
-  // |iterable| is an iterator, it will update the state of the iterator to
-  // 'exhausted'.
-  TNode<JSArray> SetOrSetIteratorToList(TNode<Context> context,
-                                        TNode<HeapObject> iterable);
-
-  void BranchIfMapIteratorProtectorValid(Label* if_true, Label* if_false);
-  void BranchIfSetIteratorProtectorValid(Label* if_true, Label* if_false);
-
-  // Builds code that finds OrderedHashTable entry for a key with hash code
-  // {hash} with using the comparison code generated by {key_compare}. The code
-  // jumps to {entry_found} if the key is found, or to {not_found} if the key
-  // was not found. In the {entry_found} branch, the variable
-  // entry_start_position will be bound to the index of the entry (relative to
-  // OrderedHashTable::kHashTableStartIndex).
-  //
-  // The {CollectionType} template parameter stands for the particular instance
-  // of OrderedHashTable, it should be OrderedHashMap or OrderedHashSet.
-  template <typename CollectionType>
-  void FindOrderedHashTableEntry(
-      const TNode<CollectionType> table, const TNode<IntPtrT> hash,
-      const std::function<void(TNode<Object>, Label*, Label*)>& key_compare,
-      TVariable<IntPtrT>* entry_start_position, Label* entry_found,
-      Label* not_found);
-
-  TNode<Word32T> ComputeUnseededHash(TNode<IntPtrT> key);
-};
-
 template <typename CollectionType>
 void CollectionsBuiltinsAssembler::FindOrderedHashTableEntry(
-    const TNode<CollectionType> table, const TNode<IntPtrT> hash,
+    const TNode<CollectionType> table, const TNode<Uint32T> hash,
     const std::function<void(TNode<Object>, Label*, Label*)>& key_compare,
     TVariable<IntPtrT>* entry_start_position, Label* entry_found,
     Label* not_found) {
   // Get the index of the bucket.
-  const TNode<IntPtrT> number_of_buckets =
-      SmiUntag(CAST(UnsafeLoadFixedArrayElement(
+  const TNode<Uint32T> number_of_buckets =
+      PositiveSmiToUint32(CAST(UnsafeLoadFixedArrayElement(
           table, CollectionType::NumberOfBucketsIndex())));
-  const TNode<IntPtrT> bucket =
-      WordAnd(hash, IntPtrSub(number_of_buckets, IntPtrConstant(1)));
+  const TNode<Uint32T> bucket =
+      Word32And(hash, Uint32Sub(number_of_buckets, Uint32Constant(1)));
   const TNode<IntPtrT> first_entry = SmiUntag(CAST(UnsafeLoadFixedArrayElement(
-      table, bucket, CollectionType::HashTableStartIndex() * kTaggedSize)));
+      table, Signed(ChangeUint32ToWord(bucket)),
+      CollectionType::HashTableStartIndex() * kTaggedSize)));
+  const TNode<IntPtrT> number_of_buckets_intptr =
+      Signed(ChangeUint32ToWord(number_of_buckets));
 
   // Walk the bucket chain.
   TNode<IntPtrT> entry_start;
@@ -711,7 +546,7 @@ void CollectionsBuiltinsAssembler::FindOrderedHashTableEntry(
         this,
         UintPtrLessThan(
             var_entry.value(),
-            SmiUntag(SmiAdd(
+            PositiveSmiUntag(SmiAdd(
                 CAST(UnsafeLoadFixedArrayElement(
                     table, CollectionType::NumberOfElementsIndex())),
                 CAST(UnsafeLoadFixedArrayElement(
@@ -721,12 +556,11 @@ void CollectionsBuiltinsAssembler::FindOrderedHashTableEntry(
     entry_start =
         IntPtrAdd(IntPtrMul(var_entry.value(),
                             IntPtrConstant(CollectionType::kEntrySize)),
-                  number_of_buckets);
+                  number_of_buckets_intptr);
 
     // Load the key from the entry.
-    const TNode<Object> candidate_key = UnsafeLoadFixedArrayElement(
-        table, entry_start,
-        CollectionType::HashTableStartIndex() * kTaggedSize);
+    const TNode<Object> candidate_key =
+        UnsafeLoadKeyFromOrderedHashTableEntry(table, entry_start);
 
     key_compare(candidate_key, &if_key_found, &continue_next_entry);
 
@@ -813,7 +647,7 @@ TNode<Smi> CollectionsBuiltinsAssembler::CallGetOrCreateHashRaw(
   return result;
 }
 
-TNode<IntPtrT> CollectionsBuiltinsAssembler::CallGetHashRaw(
+TNode<Uint32T> CollectionsBuiltinsAssembler::CallGetHashRaw(
     const TNode<HeapObject> key) {
   const TNode<ExternalReference> function_addr =
       ExternalConstant(ExternalReference::orderedhashmap_gethash_raw());
@@ -826,13 +660,12 @@ TNode<IntPtrT> CollectionsBuiltinsAssembler::CallGetHashRaw(
   TNode<Smi> result = CAST(CallCFunction(function_addr, type_tagged,
                                          std::make_pair(type_ptr, isolate_ptr),
                                          std::make_pair(type_tagged, key)));
-
-  return SmiUntag(result);
+  return PositiveSmiToUint32(result);
 }
 
-TNode<IntPtrT> CollectionsBuiltinsAssembler::GetHash(
+TNode<Uint32T> CollectionsBuiltinsAssembler::GetHash(
     const TNode<HeapObject> key) {
-  TVARIABLE(IntPtrT, var_hash);
+  TVARIABLE(Uint32T, var_hash);
   Label if_receiver(this), if_other(this), done(this);
   Branch(IsJSReceiver(key), &if_receiver, &if_other);
 
@@ -879,7 +712,7 @@ void CollectionsBuiltinsAssembler::SameValueZeroSmi(TNode<Smi> key_smi,
 void CollectionsBuiltinsAssembler::BranchIfMapIteratorProtectorValid(
     Label* if_true, Label* if_false) {
   TNode<PropertyCell> protector_cell = MapIteratorProtectorConstant();
-  DCHECK(isolate()->heap()->map_iterator_protector().IsPropertyCell());
+  DCHECK(i::IsPropertyCell(isolate()->heap()->map_iterator_protector()));
   Branch(
       TaggedEqual(LoadObjectField(protector_cell, PropertyCell::kValueOffset),
                   SmiConstant(Protectors::kProtectorValid)),
@@ -938,7 +771,7 @@ void BranchIfIterableWithOriginalKeyOrValueMapIterator(
 void CollectionsBuiltinsAssembler::BranchIfSetIteratorProtectorValid(
     Label* if_true, Label* if_false) {
   const TNode<PropertyCell> protector_cell = SetIteratorProtectorConstant();
-  DCHECK(isolate()->heap()->set_iterator_protector().IsPropertyCell());
+  DCHECK(i::IsPropertyCell(isolate()->heap()->set_iterator_protector()));
   Branch(
       TaggedEqual(LoadObjectField(protector_cell, PropertyCell::kValueOffset),
                   SmiConstant(Protectors::kProtectorValid)),
@@ -1011,15 +844,14 @@ TNode<JSArray> CollectionsBuiltinsAssembler::MapIteratorToList(
       TransitionAndUpdate<JSMapIterator, OrderedHashMap>(iterator);
   CSA_DCHECK(this, IntPtrEqual(index, IntPtrConstant(0)));
 
-  TNode<IntPtrT> size =
-      LoadAndUntagObjectField(table, OrderedHashMap::NumberOfElementsOffset());
+  TNode<Smi> size_smi =
+      LoadObjectField<Smi>(table, OrderedHashMap::NumberOfElementsOffset());
+  TNode<IntPtrT> size = PositiveSmiUntag(size_smi);
 
   const ElementsKind kind = PACKED_ELEMENTS;
   TNode<Map> array_map =
       LoadJSArrayElementsMap(kind, LoadNativeContext(context));
-  TNode<JSArray> array =
-      AllocateJSArray(kind, array_map, size, SmiTag(size),
-                      AllocationFlag::kAllowLargeObjectAllocation);
+  TNode<JSArray> array = AllocateJSArray(kind, array_map, size, size_smi);
   TNode<FixedArray> elements = CAST(LoadElements(array));
 
   const int first_element_offset = FixedArray::kHeaderSize - kHeapObjectTag;
@@ -1060,10 +892,7 @@ TNode<JSArray> CollectionsBuiltinsAssembler::MapIteratorToList(
       CSA_DCHECK(this, InstanceTypeEqual(LoadInstanceType(iterator),
                                          JS_MAP_VALUE_ITERATOR_TYPE));
       TNode<Object> entry_value =
-          UnsafeLoadFixedArrayElement(table, entry_start_position,
-                                      (OrderedHashMap::HashTableStartIndex() +
-                                       OrderedHashMap::kValueOffset) *
-                                          kTaggedSize);
+          UnsafeLoadValueFromOrderedHashMapEntry(table, entry_start_position);
 
       Store(elements, var_offset.value(), entry_value);
       Goto(&continue_loop);
@@ -1123,15 +952,14 @@ TNode<JSArray> CollectionsBuiltinsAssembler::SetOrSetIteratorToList(
 
   BIND(&copy);
   TNode<OrderedHashSet> table = var_table.value();
-  TNode<IntPtrT> size =
-      LoadAndUntagObjectField(table, OrderedHashMap::NumberOfElementsOffset());
+  TNode<Smi> size_smi =
+      LoadObjectField<Smi>(table, OrderedHashMap::NumberOfElementsOffset());
+  TNode<IntPtrT> size = PositiveSmiUntag(size_smi);
 
   const ElementsKind kind = PACKED_ELEMENTS;
   TNode<Map> array_map =
       LoadJSArrayElementsMap(kind, LoadNativeContext(context));
-  TNode<JSArray> array =
-      AllocateJSArray(kind, array_map, size, SmiTag(size),
-                      AllocationFlag::kAllowLargeObjectAllocation);
+  TNode<JSArray> array = AllocateJSArray(kind, array_map, size, size_smi);
   TNode<FixedArray> elements = CAST(LoadElements(array));
 
   const int first_element_offset = FixedArray::kHeaderSize - kHeapObjectTag;
@@ -1200,10 +1028,8 @@ void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForSmiKey(
     TNode<CollectionType> table, TNode<Smi> smi_key, TVariable<IntPtrT>* result,
     Label* entry_found, Label* not_found) {
   const TNode<IntPtrT> key_untagged = SmiUntag(smi_key);
-  const TNode<IntPtrT> hash =
-      ChangeInt32ToIntPtr(ComputeUnseededHash(key_untagged));
-  CSA_DCHECK(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0)));
-  *result = hash;
+  const TNode<Uint32T> hash = Unsigned(ComputeUnseededHash(key_untagged));
+  *result = Signed(ChangeUint32ToWord(hash));
   FindOrderedHashTableEntry<CollectionType>(
       table, hash,
       [&](TNode<Object> other_key, Label* if_same, Label* if_not_same) {
@@ -1216,9 +1042,8 @@ template <typename CollectionType>
 void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForStringKey(
     TNode<CollectionType> table, TNode<String> key_tagged,
     TVariable<IntPtrT>* result, Label* entry_found, Label* not_found) {
-  const TNode<IntPtrT> hash = ComputeStringHash(key_tagged);
-  CSA_DCHECK(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0)));
-  *result = hash;
+  const TNode<Uint32T> hash = ComputeStringHash(key_tagged);
+  *result = Signed(ChangeUint32ToWord(hash));
   FindOrderedHashTableEntry<CollectionType>(
       table, hash,
       [&](TNode<Object> other_key, Label* if_same, Label* if_not_same) {
@@ -1231,9 +1056,8 @@ template <typename CollectionType>
 void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForHeapNumberKey(
     TNode<CollectionType> table, TNode<HeapNumber> key_heap_number,
     TVariable<IntPtrT>* result, Label* entry_found, Label* not_found) {
-  const TNode<IntPtrT> hash = CallGetHashRaw(key_heap_number);
-  CSA_DCHECK(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0)));
-  *result = hash;
+  const TNode<Uint32T> hash = CallGetHashRaw(key_heap_number);
+  *result = Signed(ChangeUint32ToWord(hash));
   const TNode<Float64T> key_float = LoadHeapNumberValue(key_heap_number);
   FindOrderedHashTableEntry<CollectionType>(
       table, hash,
@@ -1247,9 +1071,8 @@ template <typename CollectionType>
 void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForBigIntKey(
     TNode<CollectionType> table, TNode<BigInt> key_big_int,
     TVariable<IntPtrT>* result, Label* entry_found, Label* not_found) {
-  const TNode<IntPtrT> hash = CallGetHashRaw(key_big_int);
-  CSA_DCHECK(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0)));
-  *result = hash;
+  const TNode<Uint32T> hash = CallGetHashRaw(key_big_int);
+  *result = Signed(ChangeUint32ToWord(hash));
   FindOrderedHashTableEntry<CollectionType>(
       table, hash,
       [&](TNode<Object> other_key, Label* if_same, Label* if_not_same) {
@@ -1262,9 +1085,8 @@ template <typename CollectionType>
 void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForOtherKey(
     TNode<CollectionType> table, TNode<HeapObject> key_heap_object,
     TVariable<IntPtrT>* result, Label* entry_found, Label* not_found) {
-  const TNode<IntPtrT> hash = GetHash(key_heap_object);
-  CSA_DCHECK(this, IntPtrGreaterThanOrEqual(hash, IntPtrConstant(0)));
-  *result = hash;
+  const TNode<Uint32T> hash = GetHash(key_heap_object);
+  *result = Signed(ChangeUint32ToWord(hash));
   FindOrderedHashTableEntry<CollectionType>(
       table, hash,
       [&](TNode<Object> other_key, Label* if_same, Label* if_not_same) {
@@ -1273,13 +1095,12 @@ void CollectionsBuiltinsAssembler::FindOrderedHashTableEntryForOtherKey(
       result, entry_found, not_found);
 }
 
-TNode<IntPtrT> CollectionsBuiltinsAssembler::ComputeStringHash(
+TNode<Uint32T> CollectionsBuiltinsAssembler::ComputeStringHash(
     TNode<String> string_key) {
-  TVARIABLE(IntPtrT, var_result);
+  TVARIABLE(Uint32T, var_result);
 
   Label hash_not_computed(this), done(this, &var_result);
-  const TNode<IntPtrT> hash =
-      ChangeInt32ToIntPtr(LoadNameHash(string_key, &hash_not_computed));
+  const TNode<Uint32T> hash = LoadNameHash(string_key, &hash_not_computed);
   var_result = hash;
   Goto(&done);
 
@@ -1298,6 +1119,7 @@ void CollectionsBuiltinsAssembler::SameValueZeroString(
   GotoIf(TaggedIsSmi(candidate_key), if_not_same);
   GotoIfNot(IsString(CAST(candidate_key)), if_not_same);
 
+  GotoIf(TaggedEqual(key_string, candidate_key), if_same);
   BranchIfStringEqual(key_string, CAST(candidate_key), if_same, if_not_same);
 }
 
@@ -1357,29 +1179,30 @@ TF_BUILTIN(OrderedHashTableHealIndex, CollectionsBuiltinsAssembler) {
   // Check if the {table} was cleared.
   static_assert(OrderedHashMap::NumberOfDeletedElementsOffset() ==
                 OrderedHashSet::NumberOfDeletedElementsOffset());
-  TNode<IntPtrT> number_of_deleted_elements = LoadAndUntagObjectField(
+  TNode<Int32T> number_of_deleted_elements = LoadAndUntagToWord32ObjectField(
       table, OrderedHashMap::NumberOfDeletedElementsOffset());
   static_assert(OrderedHashMap::kClearedTableSentinel ==
                 OrderedHashSet::kClearedTableSentinel);
-  GotoIf(IntPtrEqual(number_of_deleted_elements,
-                     IntPtrConstant(OrderedHashMap::kClearedTableSentinel)),
+  GotoIf(Word32Equal(number_of_deleted_elements,
+                     Int32Constant(OrderedHashMap::kClearedTableSentinel)),
          &return_zero);
 
-  TVARIABLE(IntPtrT, var_i, IntPtrConstant(0));
+  TVARIABLE(Int32T, var_i, Int32Constant(0));
   TVARIABLE(Smi, var_index, index);
   Label loop(this, {&var_i, &var_index});
   Goto(&loop);
   BIND(&loop);
   {
-    TNode<IntPtrT> i = var_i.value();
-    GotoIfNot(IntPtrLessThan(i, number_of_deleted_elements), &return_index);
+    TNode<Int32T> i = var_i.value();
+    GotoIfNot(Int32LessThan(i, number_of_deleted_elements), &return_index);
     static_assert(OrderedHashMap::RemovedHolesIndex() ==
                   OrderedHashSet::RemovedHolesIndex());
     TNode<Smi> removed_index = CAST(LoadFixedArrayElement(
-        CAST(table), i, OrderedHashMap::RemovedHolesIndex() * kTaggedSize));
+        CAST(table), ChangeUint32ToWord(i),
+        OrderedHashMap::RemovedHolesIndex() * kTaggedSize));
     GotoIf(SmiGreaterThanOrEqual(removed_index, index), &return_index);
     Decrement(&var_index);
-    Increment(&var_i);
+    var_i = Int32Add(var_i.value(), Int32Constant(1));
     Goto(&loop);
   }
 
@@ -1438,7 +1261,7 @@ CollectionsBuiltinsAssembler::TransitionAndUpdate(
     const TNode<IteratorType> iterator) {
   return Transition<TableType>(
       CAST(LoadObjectField(iterator, IteratorType::kTableOffset)),
-      LoadAndUntagObjectField(iterator, IteratorType::kIndexOffset),
+      LoadAndUntagPositiveSmiObjectField(iterator, IteratorType::kIndexOffset),
       [this, iterator](const TNode<TableType> table,
                        const TNode<IntPtrT> index) {
         // Update the {iterator} with the new state.
@@ -1448,42 +1271,164 @@ CollectionsBuiltinsAssembler::TransitionAndUpdate(
       });
 }
 
+TorqueStructOrderedHashSetIndexPair
+CollectionsBuiltinsAssembler::TransitionOrderedHashSetNoUpdate(
+    const TNode<OrderedHashSet> table_arg, const TNode<IntPtrT> index_arg) {
+  TNode<OrderedHashSet> table;
+  TNode<IntPtrT> index;
+  std::tie(table, index) = Transition<OrderedHashSet>(
+      table_arg, index_arg,
+      [](const TNode<OrderedHashSet>, const TNode<IntPtrT>) {});
+  return TorqueStructOrderedHashSetIndexPair{table, index};
+}
+
 template <typename TableType>
 std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>>
 CollectionsBuiltinsAssembler::NextSkipHoles(TNode<TableType> table,
                                             TNode<IntPtrT> index,
                                             Label* if_end) {
   // Compute the used capacity for the {table}.
-  TNode<IntPtrT> number_of_buckets =
-      LoadAndUntagObjectField(table, TableType::NumberOfBucketsOffset());
-  TNode<IntPtrT> number_of_elements =
-      LoadAndUntagObjectField(table, TableType::NumberOfElementsOffset());
-  TNode<IntPtrT> number_of_deleted_elements = LoadAndUntagObjectField(
+  TNode<Int32T> number_of_buckets = LoadAndUntagToWord32ObjectField(
+      table, TableType::NumberOfBucketsOffset());
+  TNode<Int32T> number_of_elements = LoadAndUntagToWord32ObjectField(
+      table, TableType::NumberOfElementsOffset());
+  TNode<Int32T> number_of_deleted_elements = LoadAndUntagToWord32ObjectField(
       table, TableType::NumberOfDeletedElementsOffset());
-  TNode<IntPtrT> used_capacity =
-      IntPtrAdd(number_of_elements, number_of_deleted_elements);
+  TNode<Int32T> used_capacity =
+      Int32Add(number_of_elements, number_of_deleted_elements);
+
+  return NextSkipHoles(table, number_of_buckets, used_capacity, index, if_end);
+}
+
+template <typename TableType>
+std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>>
+CollectionsBuiltinsAssembler::NextSkipHoles(TNode<TableType> table,
+                                            TNode<Int32T> number_of_buckets,
+                                            TNode<Int32T> used_capacity,
+                                            TNode<IntPtrT> index,
+                                            Label* if_end) {
+  CSA_DCHECK(this, Word32Equal(number_of_buckets,
+                               LoadAndUntagToWord32ObjectField(
+                                   table, TableType::NumberOfBucketsOffset())));
+  CSA_DCHECK(
+      this,
+      Word32Equal(
+          used_capacity,
+          Int32Add(LoadAndUntagToWord32ObjectField(
+                       table, TableType::NumberOfElementsOffset()),
+                   LoadAndUntagToWord32ObjectField(
+                       table, TableType::NumberOfDeletedElementsOffset()))));
 
   TNode<Object> entry_key;
-  TNode<IntPtrT> entry_start_position;
-  TVARIABLE(IntPtrT, var_index, index);
+  TNode<Int32T> entry_start_position;
+  TVARIABLE(Int32T, var_index, TruncateIntPtrToInt32(index));
   Label loop(this, &var_index), done_loop(this);
   Goto(&loop);
   BIND(&loop);
   {
-    GotoIfNot(IntPtrLessThan(var_index.value(), used_capacity), if_end);
-    entry_start_position = IntPtrAdd(
-        IntPtrMul(var_index.value(), IntPtrConstant(TableType::kEntrySize)),
+    GotoIfNot(Int32LessThan(var_index.value(), used_capacity), if_end);
+    entry_start_position = Int32Add(
+        Int32Mul(var_index.value(), Int32Constant(TableType::kEntrySize)),
         number_of_buckets);
-    entry_key = UnsafeLoadFixedArrayElement(
-        table, entry_start_position,
-        TableType::HashTableStartIndex() * kTaggedSize);
-    Increment(&var_index);
+    entry_key = UnsafeLoadKeyFromOrderedHashTableEntry(
+        table, ChangePositiveInt32ToIntPtr(entry_start_position));
+    var_index = Int32Add(var_index.value(), Int32Constant(1));
     Branch(IsTheHole(entry_key), &loop, &done_loop);
   }
 
   BIND(&done_loop);
   return std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>>{
-      entry_key, entry_start_position, var_index.value()};
+      entry_key, ChangePositiveInt32ToIntPtr(entry_start_position),
+      ChangePositiveInt32ToIntPtr(var_index.value())};
+}
+
+template <typename CollectionType>
+TorqueStructKeyIndexPair
+CollectionsBuiltinsAssembler::NextKeyIndexPairUnmodifiedTable(
+    const TNode<CollectionType> table, const TNode<Int32T> number_of_buckets,
+    const TNode<Int32T> used_capacity, const TNode<IntPtrT> index,
+    Label* if_end) {
+  // Unmodified tables do not have transitions.
+  CSA_DCHECK(this, TaggedIsSmi(LoadObjectField(
+                       table, CollectionType::NextTableOffset())));
+
+  TNode<Object> key;
+  TNode<IntPtrT> entry_start_position;
+  TNode<IntPtrT> next_index;
+
+  std::tie(key, entry_start_position, next_index) =
+      NextSkipHoles(table, number_of_buckets, used_capacity, index, if_end);
+
+  return TorqueStructKeyIndexPair{key, next_index};
+}
+
+template TorqueStructKeyIndexPair
+CollectionsBuiltinsAssembler::NextKeyIndexPairUnmodifiedTable(
+    const TNode<OrderedHashMap> table, const TNode<Int32T> number_of_buckets,
+    const TNode<Int32T> used_capacity, const TNode<IntPtrT> index,
+    Label* if_end);
+template TorqueStructKeyIndexPair
+CollectionsBuiltinsAssembler::NextKeyIndexPairUnmodifiedTable(
+    const TNode<OrderedHashSet> table, const TNode<Int32T> number_of_buckets,
+    const TNode<Int32T> used_capacity, const TNode<IntPtrT> index,
+    Label* if_end);
+
+template <typename CollectionType>
+TorqueStructKeyIndexPair CollectionsBuiltinsAssembler::NextKeyIndexPair(
+    const TNode<CollectionType> table, const TNode<IntPtrT> index,
+    Label* if_end) {
+  TNode<Object> key;
+  TNode<IntPtrT> entry_start_position;
+  TNode<IntPtrT> next_index;
+
+  std::tie(key, entry_start_position, next_index) =
+      NextSkipHoles<CollectionType>(table, index, if_end);
+
+  return TorqueStructKeyIndexPair{key, next_index};
+}
+
+template TorqueStructKeyIndexPair
+CollectionsBuiltinsAssembler::NextKeyIndexPair(
+    const TNode<OrderedHashMap> table, const TNode<IntPtrT> index,
+    Label* if_end);
+template TorqueStructKeyIndexPair
+CollectionsBuiltinsAssembler::NextKeyIndexPair(
+    const TNode<OrderedHashSet> table, const TNode<IntPtrT> index,
+    Label* if_end);
+
+TorqueStructKeyValueIndexTuple
+CollectionsBuiltinsAssembler::NextKeyValueIndexTupleUnmodifiedTable(
+    const TNode<OrderedHashMap> table, const TNode<Int32T> number_of_buckets,
+    const TNode<Int32T> used_capacity, const TNode<IntPtrT> index,
+    Label* if_end) {
+  TNode<Object> key;
+  TNode<IntPtrT> entry_start_position;
+  TNode<IntPtrT> next_index;
+
+  std::tie(key, entry_start_position, next_index) =
+      NextSkipHoles(table, number_of_buckets, used_capacity, index, if_end);
+
+  TNode<Object> value =
+      UnsafeLoadValueFromOrderedHashMapEntry(table, entry_start_position);
+
+  return TorqueStructKeyValueIndexTuple{key, value, next_index};
+}
+
+TorqueStructKeyValueIndexTuple
+CollectionsBuiltinsAssembler::NextKeyValueIndexTuple(
+    const TNode<OrderedHashMap> table, const TNode<IntPtrT> index,
+    Label* if_end) {
+  TNode<Object> key;
+  TNode<IntPtrT> entry_start_position;
+  TNode<IntPtrT> next_index;
+
+  std::tie(key, entry_start_position, next_index) =
+      NextSkipHoles(table, index, if_end);
+
+  TNode<Object> value =
+      UnsafeLoadValueFromOrderedHashMapEntry(table, entry_start_position);
+
+  return TorqueStructKeyValueIndexTuple{key, value, next_index};
 }
 
 TF_BUILTIN(MapPrototypeGet, CollectionsBuiltinsAssembler) {
@@ -1503,10 +1448,7 @@ TF_BUILTIN(MapPrototypeGet, CollectionsBuiltinsAssembler) {
          &if_not_found);
 
   BIND(&if_found);
-  Return(LoadFixedArrayElement(
-      CAST(table), SmiUntag(index),
-      (OrderedHashMap::HashTableStartIndex() + OrderedHashMap::kValueOffset) *
-          kTaggedSize));
+  Return(LoadValueFromOrderedHashMapEntry(CAST(table), SmiUntag(index)));
 
   BIND(&if_not_found);
   Return(UndefinedConstant());
@@ -1519,14 +1461,11 @@ TF_BUILTIN(MapPrototypeHas, CollectionsBuiltinsAssembler) {
 
   ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.has");
 
-  const TNode<Object> table =
-      LoadObjectField(CAST(receiver), JSMap::kTableOffset);
-  TNode<Smi> index =
-      CAST(CallBuiltin(Builtin::kFindOrderedHashMapEntry, context, table, key));
+  const TNode<OrderedHashMap> table =
+      CAST(LoadObjectField(CAST(receiver), JSMap::kTableOffset));
 
   Label if_found(this), if_not_found(this);
-  Branch(SmiGreaterThanOrEqual(index, SmiConstant(0)), &if_found,
-         &if_not_found);
+  Branch(TableHasKey(context, table, key), &if_found, &if_not_found);
 
   BIND(&if_found);
   Return(TrueConstant());
@@ -1535,6 +1474,15 @@ TF_BUILTIN(MapPrototypeHas, CollectionsBuiltinsAssembler) {
   Return(FalseConstant());
 }
 
+TNode<BoolT> CollectionsBuiltinsAssembler::TableHasKey(
+    const TNode<Object> context, TNode<OrderedHashMap> table,
+    TNode<Object> key) {
+  TNode<Smi> index =
+      CAST(CallBuiltin(Builtin::kFindOrderedHashMapEntry, context, table, key));
+
+  return SmiGreaterThanOrEqual(index, SmiConstant(0));
+}
+
 const TNode<Object> CollectionsBuiltinsAssembler::NormalizeNumberKey(
     const TNode<Object> key) {
   TVARIABLE(Object, result, key);
@@ -1553,32 +1501,25 @@ const TNode<Object> CollectionsBuiltinsAssembler::NormalizeNumberKey(
   return result.value();
 }
 
-TF_BUILTIN(MapPrototypeSet, CollectionsBuiltinsAssembler) {
-  const auto receiver = Parameter<Object>(Descriptor::kReceiver);
-  auto key = Parameter<Object>(Descriptor::kKey);
-  const auto value = Parameter<Object>(Descriptor::kValue);
-  const auto context = Parameter<Context>(Descriptor::kContext);
-
-  ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.set");
-
-  key = NormalizeNumberKey(key);
-
-  const TNode<OrderedHashMap> table =
-      LoadObjectField<OrderedHashMap>(CAST(receiver), JSMap::kTableOffset);
-
+template <typename CollectionType>
+TNode<CollectionType> CollectionsBuiltinsAssembler::AddToOrderedHashTable(
+    const TNode<CollectionType> table, const TNode<Object> key,
+    const GrowCollection<CollectionType>& grow,
+    const StoreAtEntry<CollectionType>& store_at_new_entry,
+    const StoreAtEntry<CollectionType>& store_at_existing_entry) {
+  TVARIABLE(CollectionType, table_var, table);
   TVARIABLE(IntPtrT, entry_start_position_or_hash, IntPtrConstant(0));
-  Label entry_found(this), not_found(this);
+  Label entry_found(this), not_found(this), done(this);
 
-  TryLookupOrderedHashTableIndex<OrderedHashMap>(
+  TryLookupOrderedHashTableIndex<CollectionType>(
       table, key, &entry_start_position_or_hash, &entry_found, &not_found);
 
   BIND(&entry_found);
-  // If we found the entry, we just store the value there.
-  StoreFixedArrayElement(table, entry_start_position_or_hash.value(), value,
-                         UPDATE_WRITE_BARRIER,
-                         kTaggedSize * (OrderedHashMap::HashTableStartIndex() +
-                                        OrderedHashMap::kValueOffset));
-  Return(receiver);
+  {
+    // If we found the entry, we just store the value there.
+    store_at_existing_entry(table, entry_start_position_or_hash.value());
+    Goto(&done);
+  }
 
   Label no_hash(this), add_entry(this), store_new_entry(this);
   BIND(&not_found);
@@ -1596,81 +1537,138 @@ TF_BUILTIN(MapPrototypeSet, CollectionsBuiltinsAssembler) {
   BIND(&add_entry);
   TVARIABLE(IntPtrT, number_of_buckets);
   TVARIABLE(IntPtrT, occupancy);
-  TVARIABLE(OrderedHashMap, table_var, table);
   {
     // Check we have enough space for the entry.
-    number_of_buckets = SmiUntag(CAST(UnsafeLoadFixedArrayElement(
-        table, OrderedHashMap::NumberOfBucketsIndex())));
+    number_of_buckets = PositiveSmiUntag(CAST(UnsafeLoadFixedArrayElement(
+        table, CollectionType::NumberOfBucketsIndex())));
 
-    static_assert(OrderedHashMap::kLoadFactor == 2);
+    static_assert(CollectionType::kLoadFactor == 2);
     const TNode<WordT> capacity = WordShl(number_of_buckets.value(), 1);
-    const TNode<IntPtrT> number_of_elements = SmiUntag(
-        CAST(LoadObjectField(table, OrderedHashMap::NumberOfElementsOffset())));
-    const TNode<IntPtrT> number_of_deleted = SmiUntag(CAST(LoadObjectField(
-        table, OrderedHashMap::NumberOfDeletedElementsOffset())));
+    const TNode<IntPtrT> number_of_elements =
+        LoadAndUntagPositiveSmiObjectField(
+            table, CollectionType::NumberOfElementsOffset());
+    const TNode<IntPtrT> number_of_deleted =
+        PositiveSmiUntag(CAST(LoadObjectField(
+            table, CollectionType::NumberOfDeletedElementsOffset())));
     occupancy = IntPtrAdd(number_of_elements, number_of_deleted);
     GotoIf(IntPtrLessThan(occupancy.value(), capacity), &store_new_entry);
 
     // We do not have enough space, grow the table and reload the relevant
     // fields.
-    CallRuntime(Runtime::kMapGrow, context, receiver);
-    table_var =
-        LoadObjectField<OrderedHashMap>(CAST(receiver), JSMap::kTableOffset);
-    number_of_buckets = SmiUntag(CAST(UnsafeLoadFixedArrayElement(
-        table_var.value(), OrderedHashMap::NumberOfBucketsIndex())));
-    const TNode<IntPtrT> new_number_of_elements = SmiUntag(CAST(LoadObjectField(
-        table_var.value(), OrderedHashMap::NumberOfElementsOffset())));
-    const TNode<IntPtrT> new_number_of_deleted = SmiUntag(CAST(LoadObjectField(
-        table_var.value(), OrderedHashMap::NumberOfDeletedElementsOffset())));
+    table_var = grow();
+    number_of_buckets = PositiveSmiUntag(CAST(UnsafeLoadFixedArrayElement(
+        table_var.value(), CollectionType::NumberOfBucketsIndex())));
+    const TNode<IntPtrT> new_number_of_elements =
+        LoadAndUntagPositiveSmiObjectField(
+            table_var.value(), CollectionType::NumberOfElementsOffset());
+    const TNode<IntPtrT> new_number_of_deleted = PositiveSmiUntag(
+        CAST(LoadObjectField(table_var.value(),
+                             CollectionType::NumberOfDeletedElementsOffset())));
     occupancy = IntPtrAdd(new_number_of_elements, new_number_of_deleted);
     Goto(&store_new_entry);
   }
+
   BIND(&store_new_entry);
-  // Store the key, value and connect the element to the bucket chain.
-  StoreOrderedHashMapNewEntry(table_var.value(), key, value,
-                              entry_start_position_or_hash.value(),
-                              number_of_buckets.value(), occupancy.value());
+  {
+    StoreOrderedHashTableNewEntry(
+        table_var.value(), entry_start_position_or_hash.value(),
+        number_of_buckets.value(), occupancy.value(), store_at_new_entry);
+    Goto(&done);
+  }
+
+  BIND(&done);
+  return table_var.value();
+}
+
+TF_BUILTIN(MapPrototypeSet, CollectionsBuiltinsAssembler) {
+  const auto receiver = Parameter<Object>(Descriptor::kReceiver);
+  auto key = Parameter<Object>(Descriptor::kKey);
+  const auto value = Parameter<Object>(Descriptor::kValue);
+  const auto context = Parameter<Context>(Descriptor::kContext);
+
+  ThrowIfNotInstanceType(context, receiver, JS_MAP_TYPE, "Map.prototype.set");
+
+  key = NormalizeNumberKey(key);
+
+  GrowCollection<OrderedHashMap> grow = [this, context, receiver]() {
+    CallRuntime(Runtime::kMapGrow, context, receiver);
+    return LoadObjectField<OrderedHashMap>(CAST(receiver), JSMap::kTableOffset);
+  };
+
+  StoreAtEntry<OrderedHashMap> store_at_new_entry =
+      [this, key, value](const TNode<OrderedHashMap> table,
+                         const TNode<IntPtrT> entry_start) {
+        UnsafeStoreKeyValueInOrderedHashMapEntry(table, key, value,
+                                                 entry_start);
+      };
+
+  StoreAtEntry<OrderedHashMap> store_at_existing_entry =
+      [this, value](const TNode<OrderedHashMap> table,
+                    const TNode<IntPtrT> entry_start) {
+        UnsafeStoreValueInOrderedHashMapEntry(table, value, entry_start);
+      };
+
+  const TNode<OrderedHashMap> table =
+      LoadObjectField<OrderedHashMap>(CAST(receiver), JSMap::kTableOffset);
+  AddToOrderedHashTable(table, key, grow, store_at_new_entry,
+                        store_at_existing_entry);
   Return(receiver);
 }
 
-void CollectionsBuiltinsAssembler::StoreOrderedHashMapNewEntry(
-    const TNode<OrderedHashMap> table, const TNode<Object> key,
-    const TNode<Object> value, const TNode<IntPtrT> hash,
-    const TNode<IntPtrT> number_of_buckets, const TNode<IntPtrT> occupancy) {
+template <typename CollectionType>
+void CollectionsBuiltinsAssembler::StoreOrderedHashTableNewEntry(
+    const TNode<CollectionType> table, const TNode<IntPtrT> hash,
+    const TNode<IntPtrT> number_of_buckets, const TNode<IntPtrT> occupancy,
+    const StoreAtEntry<CollectionType>& store_at_new_entry) {
   const TNode<IntPtrT> bucket =
       WordAnd(hash, IntPtrSub(number_of_buckets, IntPtrConstant(1)));
   TNode<Smi> bucket_entry = CAST(UnsafeLoadFixedArrayElement(
-      table, bucket, OrderedHashMap::HashTableStartIndex() * kTaggedSize));
+      table, bucket, CollectionType::HashTableStartIndex() * kTaggedSize));
 
   // Store the entry elements.
   const TNode<IntPtrT> entry_start = IntPtrAdd(
-      IntPtrMul(occupancy, IntPtrConstant(OrderedHashMap::kEntrySize)),
+      IntPtrMul(occupancy, IntPtrConstant(CollectionType::kEntrySize)),
       number_of_buckets);
-  UnsafeStoreFixedArrayElement(
-      table, entry_start, key, UPDATE_WRITE_BARRIER,
-      kTaggedSize * OrderedHashMap::HashTableStartIndex());
-  UnsafeStoreFixedArrayElement(
-      table, entry_start, value, UPDATE_WRITE_BARRIER,
-      kTaggedSize * (OrderedHashMap::HashTableStartIndex() +
-                     OrderedHashMap::kValueOffset));
+  store_at_new_entry(table, entry_start);
+
+  // Connect the element to the bucket chain.
   UnsafeStoreFixedArrayElement(
       table, entry_start, bucket_entry,
-      kTaggedSize * (OrderedHashMap::HashTableStartIndex() +
-                     OrderedHashMap::kChainOffset));
+      kTaggedSize * (CollectionType::HashTableStartIndex() +
+                     CollectionType::kChainOffset));
 
   // Update the bucket head.
   UnsafeStoreFixedArrayElement(
       table, bucket, SmiTag(occupancy),
-      OrderedHashMap::HashTableStartIndex() * kTaggedSize);
+      CollectionType::HashTableStartIndex() * kTaggedSize);
 
   // Bump the elements count.
   const TNode<Smi> number_of_elements =
-      CAST(LoadObjectField(table, OrderedHashMap::NumberOfElementsOffset()));
+      CAST(LoadObjectField(table, CollectionType::NumberOfElementsOffset()));
   StoreObjectFieldNoWriteBarrier(table,
-                                 OrderedHashMap::NumberOfElementsOffset(),
+                                 CollectionType::NumberOfElementsOffset(),
                                  SmiAdd(number_of_elements, SmiConstant(1)));
 }
 
+void CollectionsBuiltinsAssembler::StoreValueInOrderedHashMapEntry(
+    const TNode<OrderedHashMap> table, const TNode<Object> value,
+    const TNode<IntPtrT> entry_start, CheckBounds check_bounds) {
+  StoreFixedArrayElement(table, entry_start, value, UPDATE_WRITE_BARRIER,
+                         kTaggedSize * (OrderedHashMap::HashTableStartIndex() +
+                                        OrderedHashMap::kValueOffset),
+                         check_bounds);
+}
+
+void CollectionsBuiltinsAssembler::StoreKeyValueInOrderedHashMapEntry(
+    const TNode<OrderedHashMap> table, const TNode<Object> key,
+    const TNode<Object> value, const TNode<IntPtrT> entry_start,
+    CheckBounds check_bounds) {
+  StoreFixedArrayElement(table, entry_start, key, UPDATE_WRITE_BARRIER,
+                         kTaggedSize * OrderedHashMap::HashTableStartIndex(),
+                         check_bounds);
+  StoreValueInOrderedHashMapEntry(table, value, entry_start, check_bounds);
+}
+
 TF_BUILTIN(MapPrototypeDelete, CollectionsBuiltinsAssembler) {
   const auto receiver = Parameter<Object>(Descriptor::kReceiver);
   const auto key = Parameter<Object>(Descriptor::kKey);
@@ -1696,13 +1694,9 @@ TF_BUILTIN(MapPrototypeDelete, CollectionsBuiltinsAssembler) {
 
   BIND(&entry_found);
   // If we found the entry, mark the entry as deleted.
-  StoreFixedArrayElement(table, entry_start_position_or_hash.value(),
-                         TheHoleConstant(), UPDATE_WRITE_BARRIER,
-                         kTaggedSize * OrderedHashMap::HashTableStartIndex());
-  StoreFixedArrayElement(table, entry_start_position_or_hash.value(),
-                         TheHoleConstant(), UPDATE_WRITE_BARRIER,
-                         kTaggedSize * (OrderedHashMap::HashTableStartIndex() +
-                                        OrderedHashMap::kValueOffset));
+  StoreKeyValueInOrderedHashMapEntry(table, TheHoleConstant(),
+                                     TheHoleConstant(),
+                                     entry_start_position_or_hash.value());
 
   // Decrement the number of elements, increment the number of deleted elements.
   const TNode<Smi> number_of_elements = SmiSub(
@@ -1742,104 +1736,82 @@ TF_BUILTIN(SetPrototypeAdd, CollectionsBuiltinsAssembler) {
 
   key = NormalizeNumberKey(key);
 
-  const TNode<OrderedHashSet> table =
-      LoadObjectField<OrderedHashSet>(CAST(receiver), JSMap::kTableOffset);
+  GrowCollection<OrderedHashSet> grow = [this, context, receiver]() {
+    CallRuntime(Runtime::kSetGrow, context, receiver);
+    return LoadObjectField<OrderedHashSet>(CAST(receiver), JSSet::kTableOffset);
+  };
 
-  TVARIABLE(IntPtrT, entry_start_position_or_hash, IntPtrConstant(0));
-  Label entry_found(this), not_found(this);
+  StoreAtEntry<OrderedHashSet> store_at_new_entry =
+      [this, key](const TNode<OrderedHashSet> table,
+                  const TNode<IntPtrT> entry_start) {
+        UnsafeStoreKeyInOrderedHashSetEntry(table, key, entry_start);
+      };
 
-  TryLookupOrderedHashTableIndex<OrderedHashSet>(
-      table, key, &entry_start_position_or_hash, &entry_found, &not_found);
+  StoreAtEntry<OrderedHashSet> store_at_existing_entry =
+      [](const TNode<OrderedHashSet>, const TNode<IntPtrT>) {
+        // If the entry was found, there is nothing to do.
+      };
 
-  BIND(&entry_found);
-  // The entry was found, there is nothing to do.
+  const TNode<OrderedHashSet> table =
+      LoadObjectField<OrderedHashSet>(CAST(receiver), JSSet::kTableOffset);
+  AddToOrderedHashTable(table, key, grow, store_at_new_entry,
+                        store_at_existing_entry);
   Return(receiver);
+}
 
-  Label no_hash(this), add_entry(this), store_new_entry(this);
-  BIND(&not_found);
-  {
-    // If we have a hash code, we can start adding the new entry.
-    GotoIf(IntPtrGreaterThan(entry_start_position_or_hash.value(),
-                             IntPtrConstant(0)),
-           &add_entry);
+TNode<OrderedHashSet> CollectionsBuiltinsAssembler::AddToSetTable(
+    const TNode<Object> context, TNode<OrderedHashSet> table, TNode<Object> key,
+    TNode<String> method_name) {
+  key = NormalizeNumberKey(key);
 
-    // Otherwise, go to runtime to compute the hash code.
-    entry_start_position_or_hash = SmiUntag(CallGetOrCreateHashRaw(CAST(key)));
-    Goto(&add_entry);
-  }
+  GrowCollection<OrderedHashSet> grow = [this, context, table, method_name]() {
+    TNode<OrderedHashSet> new_table = Cast(
+        CallRuntime(Runtime::kOrderedHashSetGrow, context, table, method_name));
+    // TODO(v8:13556): check if the table is updated and remove pointer to the
+    // new table.
+    return new_table;
+  };
 
-  BIND(&add_entry);
-  TVARIABLE(IntPtrT, number_of_buckets);
-  TVARIABLE(IntPtrT, occupancy);
-  TVARIABLE(OrderedHashSet, table_var, table);
-  {
-    // Check we have enough space for the entry.
-    number_of_buckets = SmiUntag(CAST(UnsafeLoadFixedArrayElement(
-        table, OrderedHashSet::NumberOfBucketsIndex())));
+  StoreAtEntry<OrderedHashSet> store_at_new_entry =
+      [this, key](const TNode<OrderedHashSet> table,
+                  const TNode<IntPtrT> entry_start) {
+        UnsafeStoreKeyInOrderedHashSetEntry(table, key, entry_start);
+      };
 
-    static_assert(OrderedHashSet::kLoadFactor == 2);
-    const TNode<WordT> capacity = WordShl(number_of_buckets.value(), 1);
-    const TNode<IntPtrT> number_of_elements = SmiUntag(
-        CAST(LoadObjectField(table, OrderedHashSet::NumberOfElementsOffset())));
-    const TNode<IntPtrT> number_of_deleted = SmiUntag(CAST(LoadObjectField(
-        table, OrderedHashSet::NumberOfDeletedElementsOffset())));
-    occupancy = IntPtrAdd(number_of_elements, number_of_deleted);
-    GotoIf(IntPtrLessThan(occupancy.value(), capacity), &store_new_entry);
+  StoreAtEntry<OrderedHashSet> store_at_existing_entry =
+      [](const TNode<OrderedHashSet>, const TNode<IntPtrT>) {
+        // If the entry was found, there is nothing to do.
+      };
 
-    // We do not have enough space, grow the table and reload the relevant
-    // fields.
-    CallRuntime(Runtime::kSetGrow, context, receiver);
-    table_var =
-        LoadObjectField<OrderedHashSet>(CAST(receiver), JSMap::kTableOffset);
-    number_of_buckets = SmiUntag(CAST(UnsafeLoadFixedArrayElement(
-        table_var.value(), OrderedHashSet::NumberOfBucketsIndex())));
-    const TNode<IntPtrT> new_number_of_elements = SmiUntag(CAST(LoadObjectField(
-        table_var.value(), OrderedHashSet::NumberOfElementsOffset())));
-    const TNode<IntPtrT> new_number_of_deleted = SmiUntag(CAST(LoadObjectField(
-        table_var.value(), OrderedHashSet::NumberOfDeletedElementsOffset())));
-    occupancy = IntPtrAdd(new_number_of_elements, new_number_of_deleted);
-    Goto(&store_new_entry);
-  }
-  BIND(&store_new_entry);
-  // Store the key, value and connect the element to the bucket chain.
-  StoreOrderedHashSetNewEntry(table_var.value(), key,
-                              entry_start_position_or_hash.value(),
-                              number_of_buckets.value(), occupancy.value());
-  Return(receiver);
+  return AddToOrderedHashTable(table, key, grow, store_at_new_entry,
+                               store_at_existing_entry);
 }
 
-void CollectionsBuiltinsAssembler::StoreOrderedHashSetNewEntry(
+void CollectionsBuiltinsAssembler::StoreKeyInOrderedHashSetEntry(
     const TNode<OrderedHashSet> table, const TNode<Object> key,
-    const TNode<IntPtrT> hash, const TNode<IntPtrT> number_of_buckets,
-    const TNode<IntPtrT> occupancy) {
-  const TNode<IntPtrT> bucket =
-      WordAnd(hash, IntPtrSub(number_of_buckets, IntPtrConstant(1)));
-  TNode<Smi> bucket_entry = CAST(UnsafeLoadFixedArrayElement(
-      table, bucket, OrderedHashSet::HashTableStartIndex() * kTaggedSize));
-
-  // Store the entry elements.
-  const TNode<IntPtrT> entry_start = IntPtrAdd(
-      IntPtrMul(occupancy, IntPtrConstant(OrderedHashSet::kEntrySize)),
-      number_of_buckets);
-  UnsafeStoreFixedArrayElement(
-      table, entry_start, key, UPDATE_WRITE_BARRIER,
-      kTaggedSize * OrderedHashSet::HashTableStartIndex());
-  UnsafeStoreFixedArrayElement(
-      table, entry_start, bucket_entry,
-      kTaggedSize * (OrderedHashSet::HashTableStartIndex() +
-                     OrderedHashSet::kChainOffset));
-
-  // Update the bucket head.
-  UnsafeStoreFixedArrayElement(
-      table, bucket, SmiTag(occupancy),
-      OrderedHashSet::HashTableStartIndex() * kTaggedSize);
+    const TNode<IntPtrT> entry_start, CheckBounds check_bounds) {
+  StoreFixedArrayElement(table, entry_start, key, UPDATE_WRITE_BARRIER,
+                         kTaggedSize * OrderedHashSet::HashTableStartIndex(),
+                         check_bounds);
+}
 
-  // Bump the elements count.
-  const TNode<Smi> number_of_elements =
-      CAST(LoadObjectField(table, OrderedHashSet::NumberOfElementsOffset()));
-  StoreObjectFieldNoWriteBarrier(table,
-                                 OrderedHashSet::NumberOfElementsOffset(),
-                                 SmiAdd(number_of_elements, SmiConstant(1)));
+template <typename CollectionType>
+TNode<Object> CollectionsBuiltinsAssembler::LoadKeyFromOrderedHashTableEntry(
+    const TNode<CollectionType> table, const TNode<IntPtrT> entry,
+    CheckBounds check_bounds) {
+  return LoadFixedArrayElement(
+      table, entry, kTaggedSize * CollectionType::HashTableStartIndex(),
+      check_bounds);
+}
+
+TNode<Object> CollectionsBuiltinsAssembler::LoadValueFromOrderedHashMapEntry(
+    const TNode<OrderedHashMap> table, const TNode<IntPtrT> entry,
+    CheckBounds check_bounds) {
+  return LoadFixedArrayElement(
+      table, entry,
+      kTaggedSize * (OrderedHashMap::HashTableStartIndex() +
+                     OrderedHashMap::kValueOffset),
+      check_bounds);
 }
 
 TF_BUILTIN(SetPrototypeDelete, CollectionsBuiltinsAssembler) {
@@ -1856,20 +1828,44 @@ TF_BUILTIN(SetPrototypeDelete, CollectionsBuiltinsAssembler) {
   const TNode<OrderedHashSet> table =
       LoadObjectField<OrderedHashSet>(CAST(receiver), JSMap::kTableOffset);
 
-  TVARIABLE(IntPtrT, entry_start_position_or_hash, IntPtrConstant(0));
-  Label entry_found(this), not_found(this);
+  Label not_found(this);
+  const TNode<Smi> number_of_elements =
+      DeleteFromSetTable(context, table, key, &not_found);
 
-  TryLookupOrderedHashTableIndex<OrderedHashSet>(
-      table, key, &entry_start_position_or_hash, &entry_found, &not_found);
+  const TNode<Smi> number_of_buckets = CAST(
+      LoadFixedArrayElement(table, OrderedHashSet::NumberOfBucketsIndex()));
+
+  // If there fewer elements than #buckets / 2, shrink the table.
+  Label shrink(this);
+  GotoIf(SmiLessThan(SmiAdd(number_of_elements, number_of_elements),
+                     number_of_buckets),
+         &shrink);
+  Return(TrueConstant());
+
+  BIND(&shrink);
+  CallRuntime(Runtime::kSetShrink, context, receiver);
+  Return(TrueConstant());
 
   BIND(&not_found);
   Return(FalseConstant());
+}
+
+TNode<Smi> CollectionsBuiltinsAssembler::DeleteFromSetTable(
+    const TNode<Object> context, TNode<OrderedHashSet> table, TNode<Object> key,
+    Label* not_found) {
+  // This check breaks a known exploitation technique. See crbug.com/1263462
+  CSA_CHECK(this, TaggedNotEqual(key, TheHoleConstant()));
+
+  TVARIABLE(IntPtrT, entry_start_position_or_hash, IntPtrConstant(0));
+  Label entry_found(this);
+
+  TryLookupOrderedHashTableIndex<OrderedHashSet>(
+      table, key, &entry_start_position_or_hash, &entry_found, not_found);
 
   BIND(&entry_found);
   // If we found the entry, mark the entry as deleted.
-  StoreFixedArrayElement(table, entry_start_position_or_hash.value(),
-                         TheHoleConstant(), UPDATE_WRITE_BARRIER,
-                         kTaggedSize * OrderedHashSet::HashTableStartIndex());
+  StoreKeyInOrderedHashSetEntry(table, TheHoleConstant(),
+                                entry_start_position_or_hash.value());
 
   // Decrement the number of elements, increment the number of deleted elements.
   const TNode<Smi> number_of_elements = SmiSub(
@@ -1885,19 +1881,7 @@ TF_BUILTIN(SetPrototypeDelete, CollectionsBuiltinsAssembler) {
       table, OrderedHashSet::NumberOfDeletedElementsOffset(),
       number_of_deleted);
 
-  const TNode<Smi> number_of_buckets = CAST(
-      LoadFixedArrayElement(table, OrderedHashSet::NumberOfBucketsIndex()));
-
-  // If there fewer elements than #buckets / 2, shrink the table.
-  Label shrink(this);
-  GotoIf(SmiLessThan(SmiAdd(number_of_elements, number_of_elements),
-                     number_of_buckets),
-         &shrink);
-  Return(TrueConstant());
-
-  BIND(&shrink);
-  CallRuntime(Runtime::kSetShrink, context, receiver);
-  Return(TrueConstant());
+  return number_of_elements;
 }
 
 TF_BUILTIN(MapPrototypeEntries, CollectionsBuiltinsAssembler) {
@@ -1956,10 +1940,8 @@ TF_BUILTIN(MapPrototypeForEach, CollectionsBuiltinsAssembler) {
         NextSkipHoles<OrderedHashMap>(table, index, &done_loop);
 
     // Load the entry value as well.
-    TNode<Object> entry_value = LoadFixedArrayElement(
-        table, entry_start_position,
-        (OrderedHashMap::HashTableStartIndex() + OrderedHashMap::kValueOffset) *
-            kTaggedSize);
+    TNode<Object> entry_value =
+        LoadValueFromOrderedHashMapEntry(table, entry_start_position);
 
     // Invoke the {callback} passing the {entry_key}, {entry_value} and the
     // {receiver}.
@@ -2022,7 +2004,7 @@ TF_BUILTIN(MapIteratorPrototypeNext, CollectionsBuiltinsAssembler) {
   TNode<JSMapIterator> receiver = CAST(maybe_receiver);
 
   // Check if the {receiver} is exhausted.
-  TVARIABLE(Oddball, var_done, TrueConstant());
+  TVARIABLE(Boolean, var_done, TrueConstant());
   TVARIABLE(Object, var_value, UndefinedConstant());
   Label return_value(this, {&var_done, &var_value}), return_entry(this),
       return_end(this, Label::kDeferred);
@@ -2046,10 +2028,7 @@ TF_BUILTIN(MapIteratorPrototypeNext, CollectionsBuiltinsAssembler) {
   // Check how to return the {key} (depending on {receiver} type).
   GotoIf(InstanceTypeEqual(receiver_instance_type, JS_MAP_KEY_ITERATOR_TYPE),
          &return_value);
-  var_value = LoadFixedArrayElement(
-      table, entry_start_position,
-      (OrderedHashMap::HashTableStartIndex() + OrderedHashMap::kValueOffset) *
-          kTaggedSize);
+  var_value = LoadValueFromOrderedHashMapEntry(table, entry_start_position);
   Branch(InstanceTypeEqual(receiver_instance_type, JS_MAP_VALUE_ITERATOR_TYPE),
          &return_value, &return_entry);
 
@@ -2082,14 +2061,11 @@ TF_BUILTIN(SetPrototypeHas, CollectionsBuiltinsAssembler) {
 
   ThrowIfNotInstanceType(context, receiver, JS_SET_TYPE, "Set.prototype.has");
 
-  const TNode<Object> table =
-      LoadObjectField(CAST(receiver), JSMap::kTableOffset);
-  TNode<Smi> index =
-      CAST(CallBuiltin(Builtin::kFindOrderedHashSetEntry, context, table, key));
+  const TNode<OrderedHashSet> table =
+      CAST(LoadObjectField(CAST(receiver), JSMap::kTableOffset));
 
   Label if_found(this), if_not_found(this);
-  Branch(SmiGreaterThanOrEqual(index, SmiConstant(0)), &if_found,
-         &if_not_found);
+  Branch(TableHasKey(context, table, key), &if_found, &if_not_found);
 
   BIND(&if_found);
   Return(TrueConstant());
@@ -2098,6 +2074,15 @@ TF_BUILTIN(SetPrototypeHas, CollectionsBuiltinsAssembler) {
   Return(FalseConstant());
 }
 
+TNode<BoolT> CollectionsBuiltinsAssembler::TableHasKey(
+    const TNode<Object> context, TNode<OrderedHashSet> table,
+    TNode<Object> key) {
+  TNode<Smi> index =
+      CAST(CallBuiltin(Builtin::kFindOrderedHashSetEntry, context, table, key));
+
+  return SmiGreaterThanOrEqual(index, SmiConstant(0));
+}
+
 TF_BUILTIN(SetPrototypeEntries, CollectionsBuiltinsAssembler) {
   const auto receiver = Parameter<Object>(Descriptor::kReceiver);
   const auto context = Parameter<Context>(Descriptor::kContext);
@@ -2204,7 +2189,7 @@ TF_BUILTIN(SetIteratorPrototypeNext, CollectionsBuiltinsAssembler) {
   TNode<JSSetIterator> receiver = CAST(maybe_receiver);
 
   // Check if the {receiver} is exhausted.
-  TVARIABLE(Oddball, var_done, TrueConstant());
+  TVARIABLE(Boolean, var_done, TrueConstant());
   TVARIABLE(Object, var_value, UndefinedConstant());
   Label return_value(this, {&var_done, &var_value}), return_entry(this),
       return_end(this, Label::kDeferred);
@@ -2329,9 +2314,52 @@ TF_BUILTIN(FindOrderedHashSetEntry, CollectionsBuiltinsAssembler) {
   Return(SmiConstant(-1));
 }
 
+const TNode<OrderedHashMap> CollectionsBuiltinsAssembler::AddValueToKeyedGroup(
+    const TNode<OrderedHashMap> groups, const TNode<Object> key,
+    const TNode<Object> value, const TNode<String> methodName) {
+  GrowCollection<OrderedHashMap> grow = [this, groups, methodName]() {
+    TNode<OrderedHashMap> new_groups = CAST(CallRuntime(
+        Runtime::kOrderedHashMapGrow, NoContextConstant(), groups, methodName));
+    // The groups OrderedHashMap is not escaped to user script while grouping
+    // items, so there can't be live iterators. So we don't need to keep the
+    // pointer from the old table to the new one.
+    Label did_grow(this), done(this);
+    Branch(TaggedEqual(groups, new_groups), &done, &did_grow);
+    BIND(&did_grow);
+    {
+      StoreObjectFieldNoWriteBarrier(groups, OrderedHashMap::NextTableOffset(),
+                                     SmiConstant(0));
+      Goto(&done);
+    }
+    BIND(&done);
+    return new_groups;
+  };
+
+  StoreAtEntry<OrderedHashMap> store_at_new_entry =
+      [this, key, value](const TNode<OrderedHashMap> table,
+                         const TNode<IntPtrT> entry_start) {
+        TNode<ArrayList> array = AllocateArrayList(SmiConstant(1));
+        ArrayListSet(array, SmiConstant(0), value);
+        ArrayListSetLength(array, SmiConstant(1));
+        StoreKeyValueInOrderedHashMapEntry(table, key, array, entry_start);
+      };
+
+  StoreAtEntry<OrderedHashMap> store_at_existing_entry =
+      [this, key, value](const TNode<OrderedHashMap> table,
+                         const TNode<IntPtrT> entry_start) {
+        TNode<ArrayList> array =
+            CAST(LoadValueFromOrderedHashMapEntry(table, entry_start));
+        TNode<ArrayList> new_array = ArrayListAdd(array, value);
+        StoreKeyValueInOrderedHashMapEntry(table, key, new_array, entry_start);
+      };
+
+  return AddToOrderedHashTable(groups, key, grow, store_at_new_entry,
+                               store_at_existing_entry);
+}
+
 void WeakCollectionsBuiltinsAssembler::AddEntry(
     TNode<EphemeronHashTable> table, TNode<IntPtrT> key_index,
-    TNode<Object> key, TNode<Object> value, TNode<IntPtrT> number_of_elements) {
+    TNode<Object> key, TNode<Object> value, TNode<Int32T> number_of_elements) {
   // See EphemeronHashTable::AddEntry().
   TNode<IntPtrT> value_index = ValueIndexFromKeyIndex(key_index);
   UnsafeStoreFixedArrayElement(table, key_index, key,
@@ -2341,7 +2369,7 @@ void WeakCollectionsBuiltinsAssembler::AddEntry(
   // See HashTableBase::ElementAdded().
   UnsafeStoreFixedArrayElement(table,
                                EphemeronHashTable::kNumberOfElementsIndex,
-                               SmiFromIntPtr(number_of_elements));
+                               SmiFromInt32(number_of_elements));
 }
 
 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::GetHash(
@@ -2350,14 +2378,15 @@ TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::GetHash(
   Label if_symbol(this);
   Label return_result(this);
   GotoIfNot(IsJSReceiver(key), &if_symbol);
-  var_hash = LoadJSReceiverIdentityHash(CAST(key), if_no_hash);
+  var_hash = Signed(
+      ChangeUint32ToWord(LoadJSReceiverIdentityHash(CAST(key), if_no_hash)));
   Goto(&return_result);
   Bind(&if_symbol);
   CSA_DCHECK(this, IsSymbol(key));
   CSA_DCHECK(this, Word32BinaryNot(
                        Word32And(LoadSymbolFlags(CAST(key)),
                                  Symbol::IsInPublicSymbolTableBit::kMask)));
-  var_hash = ChangeInt32ToIntPtr(LoadNameHash(CAST(key), nullptr));
+  var_hash = Signed(ChangeUint32ToWord(LoadNameHash(CAST(key), nullptr)));
   Goto(&return_result);
   Bind(&return_result);
   return var_hash.value();
@@ -2372,8 +2401,7 @@ TNode<HeapObject> WeakCollectionsBuiltinsAssembler::AllocateTable(
 
   // See HashTable::NewInternal().
   TNode<IntPtrT> length = KeyIndexFromEntry(capacity);
-  TNode<FixedArray> table = CAST(AllocateFixedArray(
-      HOLEY_ELEMENTS, length, AllocationFlag::kAllowLargeObjectAllocation));
+  TNode<FixedArray> table = CAST(AllocateFixedArray(HOLEY_ELEMENTS, length));
 
   TNode<Map> map =
       HeapConstant(EphemeronHashTable::GetMap(ReadOnlyRoots(isolate())));
@@ -2474,18 +2502,19 @@ TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::KeyIndexFromEntry(
                      EphemeronHashTable::kEntryKeyIndex));
 }
 
-TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::LoadNumberOfElements(
+TNode<Int32T> WeakCollectionsBuiltinsAssembler::LoadNumberOfElements(
     TNode<EphemeronHashTable> table, int offset) {
-  TNode<IntPtrT> number_of_elements = SmiUntag(CAST(UnsafeLoadFixedArrayElement(
-      table, EphemeronHashTable::kNumberOfElementsIndex)));
-  return IntPtrAdd(number_of_elements, IntPtrConstant(offset));
+  TNode<Int32T> number_of_elements =
+      SmiToInt32(CAST(UnsafeLoadFixedArrayElement(
+          table, EphemeronHashTable::kNumberOfElementsIndex)));
+  return Int32Add(number_of_elements, Int32Constant(offset));
 }
 
-TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::LoadNumberOfDeleted(
+TNode<Int32T> WeakCollectionsBuiltinsAssembler::LoadNumberOfDeleted(
     TNode<EphemeronHashTable> table, int offset) {
-  TNode<IntPtrT> number_of_deleted = SmiUntag(CAST(UnsafeLoadFixedArrayElement(
+  TNode<Int32T> number_of_deleted = SmiToInt32(CAST(UnsafeLoadFixedArrayElement(
       table, EphemeronHashTable::kNumberOfDeletedElementsIndex)));
-  return IntPtrAdd(number_of_deleted, IntPtrConstant(offset));
+  return Int32Add(number_of_deleted, Int32Constant(offset));
 }
 
 TNode<EphemeronHashTable> WeakCollectionsBuiltinsAssembler::LoadTable(
@@ -2495,26 +2524,26 @@ TNode<EphemeronHashTable> WeakCollectionsBuiltinsAssembler::LoadTable(
 
 TNode<IntPtrT> WeakCollectionsBuiltinsAssembler::LoadTableCapacity(
     TNode<EphemeronHashTable> table) {
-  return SmiUntag(CAST(
+  return PositiveSmiUntag(CAST(
       UnsafeLoadFixedArrayElement(table, EphemeronHashTable::kCapacityIndex)));
 }
 
 TNode<Word32T> WeakCollectionsBuiltinsAssembler::InsufficientCapacityToAdd(
-    TNode<IntPtrT> capacity, TNode<IntPtrT> number_of_elements,
-    TNode<IntPtrT> number_of_deleted) {
+    TNode<Int32T> capacity, TNode<Int32T> number_of_elements,
+    TNode<Int32T> number_of_deleted) {
   // This is the negative form of HashTable::HasSufficientCapacityToAdd().
   // Return true if:
   //   - more than 50% of the available space are deleted elements
   //   - less than 50% will be available
-  TNode<IntPtrT> available = IntPtrSub(capacity, number_of_elements);
-  TNode<IntPtrT> half_available = WordShr(available, 1);
-  TNode<IntPtrT> needed_available = WordShr(number_of_elements, 1);
+  TNode<Int32T> available = Int32Sub(capacity, number_of_elements);
+  TNode<Int32T> half_available = Signed(Word32Shr(available, 1));
+  TNode<Int32T> needed_available = Signed(Word32Shr(number_of_elements, 1));
   return Word32Or(
       // deleted > half
-      IntPtrGreaterThan(number_of_deleted, half_available),
+      Int32GreaterThan(number_of_deleted, half_available),
       // elements + needed available > capacity
-      IntPtrGreaterThan(IntPtrAdd(number_of_elements, needed_available),
-                        capacity));
+      Int32GreaterThan(Int32Add(number_of_elements, needed_available),
+                       capacity));
 }
 
 void WeakCollectionsBuiltinsAssembler::RemoveEntry(
@@ -2526,19 +2555,19 @@ void WeakCollectionsBuiltinsAssembler::RemoveEntry(
   StoreFixedArrayElement(table, value_index, TheHoleConstant());
 
   // See HashTableBase::ElementRemoved().
-  TNode<IntPtrT> number_of_deleted = LoadNumberOfDeleted(table, 1);
+  TNode<Int32T> number_of_deleted = LoadNumberOfDeleted(table, 1);
   StoreFixedArrayElement(table, EphemeronHashTable::kNumberOfElementsIndex,
                          SmiFromIntPtr(number_of_elements), SKIP_WRITE_BARRIER);
   StoreFixedArrayElement(table,
                          EphemeronHashTable::kNumberOfDeletedElementsIndex,
-                         SmiFromIntPtr(number_of_deleted), SKIP_WRITE_BARRIER);
+                         SmiFromInt32(number_of_deleted), SKIP_WRITE_BARRIER);
 }
 
 TNode<BoolT> WeakCollectionsBuiltinsAssembler::ShouldRehash(
-    TNode<IntPtrT> number_of_elements, TNode<IntPtrT> number_of_deleted) {
+    TNode<Int32T> number_of_elements, TNode<Int32T> number_of_deleted) {
   // Rehash if more than 33% of the entries are deleted.
-  return IntPtrGreaterThanOrEqual(WordShl(number_of_deleted, 1),
-                                  number_of_elements);
+  return Int32GreaterThanOrEqual(Word32Shl(number_of_deleted, 1),
+                                 number_of_elements);
 }
 
 TNode<Word32T> WeakCollectionsBuiltinsAssembler::ShouldShrink(
@@ -2662,10 +2691,11 @@ TF_BUILTIN(WeakCollectionDelete, WeakCollectionsBuiltinsAssembler) {
   TNode<IntPtrT> capacity = LoadTableCapacity(table);
   TNode<IntPtrT> key_index = FindKeyIndexForKey(
       table, key, hash, EntryMask(capacity), &if_cannot_be_held_weakly);
-  TNode<IntPtrT> number_of_elements = LoadNumberOfElements(table, -1);
-  GotoIf(ShouldShrink(capacity, number_of_elements), &call_runtime);
+  TNode<Int32T> number_of_elements = LoadNumberOfElements(table, -1);
+  GotoIf(ShouldShrink(capacity, ChangeInt32ToIntPtr(number_of_elements)),
+         &call_runtime);
 
-  RemoveEntry(table, key_index, number_of_elements);
+  RemoveEntry(table, key_index, ChangeInt32ToIntPtr(number_of_elements));
   Return(TrueConstant());
 
   BIND(&if_cannot_be_held_weakly);
@@ -2707,12 +2737,17 @@ TF_BUILTIN(WeakCollectionSet, WeakCollectionsBuiltinsAssembler) {
   }
   BIND(&if_not_found);
   {
-    TNode<IntPtrT> number_of_deleted = LoadNumberOfDeleted(table);
-    TNode<IntPtrT> number_of_elements = LoadNumberOfElements(table, 1);
+    TNode<Int32T> number_of_deleted = LoadNumberOfDeleted(table);
+    TNode<Int32T> number_of_elements = LoadNumberOfElements(table, 1);
 
+    CSA_DCHECK(this,
+               IntPtrLessThanOrEqual(capacity, IntPtrConstant(INT32_MAX)));
+    CSA_DCHECK(this,
+               IntPtrGreaterThanOrEqual(capacity, IntPtrConstant(INT32_MIN)));
     // TODO(pwong): Port HashTable's Rehash() and EnsureCapacity() to CSA.
     GotoIf(Word32Or(ShouldRehash(number_of_elements, number_of_deleted),
-                    InsufficientCapacityToAdd(capacity, number_of_elements,
+                    InsufficientCapacityToAdd(TruncateIntPtrToInt32(capacity),
+                                              number_of_elements,
                                               number_of_deleted)),
            &call_runtime);
 
diff --git a/deps/v8/src/builtins/builtins-collections-gen.h b/deps/v8/src/builtins/builtins-collections-gen.h
index 723b68071998d9..d69534dfa6708d 100644
--- a/deps/v8/src/builtins/builtins-collections-gen.h
+++ b/deps/v8/src/builtins/builtins-collections-gen.h
@@ -141,6 +141,307 @@ class BaseCollectionsAssembler : public CodeStubAssembler {
       TNode<HeapObject> elements, TNode<IntPtrT> index);
 };
 
+class CollectionsBuiltinsAssembler : public BaseCollectionsAssembler {
+ public:
+  explicit CollectionsBuiltinsAssembler(compiler::CodeAssemblerState* state)
+      : BaseCollectionsAssembler(state) {}
+
+  // Check whether |iterable| is a JS_MAP_KEY_ITERATOR_TYPE or
+  // JS_MAP_VALUE_ITERATOR_TYPE object that is not partially consumed and still
+  // has original iteration behavior.
+  void BranchIfIterableWithOriginalKeyOrValueMapIterator(TNode<Object> iterable,
+                                                         TNode<Context> context,
+                                                         Label* if_true,
+                                                         Label* if_false);
+
+  // Check whether |iterable| is a JS_SET_TYPE or JS_SET_VALUE_ITERATOR_TYPE
+  // object that still has original iteration behavior. In case of the iterator,
+  // the iterator also must not have been partially consumed.
+  void BranchIfIterableWithOriginalValueSetIterator(TNode<Object> iterable,
+                                                    TNode<Context> context,
+                                                    Label* if_true,
+                                                    Label* if_false);
+
+  // Adds an element to a set if the element is not already in the set.
+  TNode<OrderedHashSet> AddToSetTable(TNode<Object> context,
+                                      TNode<OrderedHashSet> table,
+                                      TNode<Object> key,
+                                      TNode<String> method_name);
+  // Direct iteration helpers.
+  template <typename CollectionType>
+  TorqueStructKeyIndexPair NextKeyIndexPairUnmodifiedTable(
+      const TNode<CollectionType> table, const TNode<Int32T> number_of_buckets,
+      const TNode<Int32T> used_capacity, const TNode<IntPtrT> index,
+      Label* if_end);
+
+  template <typename CollectionType>
+  TorqueStructKeyIndexPair NextKeyIndexPair(const TNode<CollectionType> table,
+                                            const TNode<IntPtrT> index,
+                                            Label* if_end);
+
+  TorqueStructKeyValueIndexTuple NextKeyValueIndexTupleUnmodifiedTable(
+      const TNode<OrderedHashMap> table, const TNode<Int32T> number_of_buckets,
+      const TNode<Int32T> used_capacity, const TNode<IntPtrT> index,
+      Label* if_end);
+
+  TorqueStructKeyValueIndexTuple NextKeyValueIndexTuple(
+      const TNode<OrderedHashMap> table, const TNode<IntPtrT> index,
+      Label* if_end);
+
+  // Checks if the set/map contains a key.
+  TNode<BoolT> TableHasKey(const TNode<Object> context,
+                           TNode<OrderedHashSet> table, TNode<Object> key);
+  TNode<BoolT> TableHasKey(const TNode<Object> context,
+                           TNode<OrderedHashMap> table, TNode<Object> key);
+
+  // Adds {value} to a FixedArray keyed by {key} in {groups}.
+  //
+  // Utility used by Object.groupBy and Map.groupBy.
+  const TNode<OrderedHashMap> AddValueToKeyedGroup(
+      const TNode<OrderedHashMap> groups, const TNode<Object> key,
+      const TNode<Object> value, const TNode<String> methodName);
+
+  // Normalizes -0 to +0.
+  const TNode<Object> NormalizeNumberKey(const TNode<Object> key);
+
+  // Methods after this point should really be protected but are exposed for
+  // Torque.
+  void UnsafeStoreValueInOrderedHashMapEntry(const TNode<OrderedHashMap> table,
+                                             const TNode<Object> value,
+                                             const TNode<IntPtrT> entry) {
+    return StoreValueInOrderedHashMapEntry(table, value, entry,
+                                           CheckBounds::kDebugOnly);
+  }
+
+  TNode<Smi> DeleteFromSetTable(const TNode<Object> context,
+                                TNode<OrderedHashSet> table, TNode<Object> key,
+                                Label* not_found);
+
+  TorqueStructOrderedHashSetIndexPair TransitionOrderedHashSetNoUpdate(
+      const TNode<OrderedHashSet> table, const TNode<IntPtrT> index);
+
+ protected:
+  template <typename IteratorType>
+  TNode<HeapObject> AllocateJSCollectionIterator(
+      const TNode<Context> context, int map_index,
+      const TNode<HeapObject> collection);
+  TNode<HeapObject> AllocateTable(Variant variant,
+                                  TNode<IntPtrT> at_least_space_for) override;
+  TNode<Uint32T> GetHash(const TNode<HeapObject> key);
+  TNode<Uint32T> CallGetHashRaw(const TNode<HeapObject> key);
+  TNode<Smi> CallGetOrCreateHashRaw(const TNode<HeapObject> key);
+
+  // Transitions the iterator to the non obsolete backing store.
+  // This is a NOP if the [table] is not obsolete.
+  template <typename TableType>
+  using UpdateInTransition = std::function<void(const TNode<TableType> table,
+                                                const TNode<IntPtrT> index)>;
+  template <typename TableType>
+  std::pair<TNode<TableType>, TNode<IntPtrT>> Transition(
+      const TNode<TableType> table, const TNode<IntPtrT> index,
+      UpdateInTransition<TableType> const& update_in_transition);
+  template <typename IteratorType, typename TableType>
+  std::pair<TNode<TableType>, TNode<IntPtrT>> TransitionAndUpdate(
+      const TNode<IteratorType> iterator);
+
+  template <typename TableType>
+  std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>> NextSkipHoles(
+      TNode<TableType> table, TNode<IntPtrT> index, Label* if_end);
+  template <typename TableType>
+  std::tuple<TNode<Object>, TNode<IntPtrT>, TNode<IntPtrT>> NextSkipHoles(
+      TNode<TableType> table, TNode<Int32T> number_of_buckets,
+      TNode<Int32T> used_capacity, TNode<IntPtrT> index, Label* if_end);
+
+  // Specialization for Smi.
+  // The {result} variable will contain the entry index if the key was found,
+  // or the hash code otherwise.
+  template <typename CollectionType>
+  void FindOrderedHashTableEntryForSmiKey(TNode<CollectionType> table,
+                                          TNode<Smi> key_tagged,
+                                          TVariable<IntPtrT>* result,
+                                          Label* entry_found, Label* not_found);
+  void SameValueZeroSmi(TNode<Smi> key_smi, TNode<Object> candidate_key,
+                        Label* if_same, Label* if_not_same);
+
+  // Specialization for heap numbers.
+  // The {result} variable will contain the entry index if the key was found,
+  // or the hash code otherwise.
+  void SameValueZeroHeapNumber(TNode<Float64T> key_float,
+                               TNode<Object> candidate_key, Label* if_same,
+                               Label* if_not_same);
+  template <typename CollectionType>
+  void FindOrderedHashTableEntryForHeapNumberKey(
+      TNode<CollectionType> table, TNode<HeapNumber> key_heap_number,
+      TVariable<IntPtrT>* result, Label* entry_found, Label* not_found);
+
+  // Specialization for bigints.
+  // The {result} variable will contain the entry index if the key was found,
+  // or the hash code otherwise.
+  void SameValueZeroBigInt(TNode<BigInt> key, TNode<Object> candidate_key,
+                           Label* if_same, Label* if_not_same);
+  template <typename CollectionType>
+  void FindOrderedHashTableEntryForBigIntKey(TNode<CollectionType> table,
+                                             TNode<BigInt> key_big_int,
+                                             TVariable<IntPtrT>* result,
+                                             Label* entry_found,
+                                             Label* not_found);
+
+  // Specialization for string.
+  // The {result} variable will contain the entry index if the key was found,
+  // or the hash code otherwise.
+  template <typename CollectionType>
+  void FindOrderedHashTableEntryForStringKey(TNode<CollectionType> table,
+                                             TNode<String> key_tagged,
+                                             TVariable<IntPtrT>* result,
+                                             Label* entry_found,
+                                             Label* not_found);
+  TNode<Uint32T> ComputeStringHash(TNode<String> string_key);
+  void SameValueZeroString(TNode<String> key_string,
+                           TNode<Object> candidate_key, Label* if_same,
+                           Label* if_not_same);
+
+  // Specialization for non-strings, non-numbers. For those we only need
+  // reference equality to compare the keys.
+  // The {result} variable will contain the entry index if the key was found,
+  // or the hash code otherwise. If the hash-code has not been computed, it
+  // should be Smi -1.
+  template <typename CollectionType>
+  void FindOrderedHashTableEntryForOtherKey(TNode<CollectionType> table,
+                                            TNode<HeapObject> key_heap_object,
+                                            TVariable<IntPtrT>* result,
+                                            Label* entry_found,
+                                            Label* not_found);
+
+  // Generates code to add an entry keyed by {key} to an instance of
+  // OrderedHashTable subclass {table}.
+  //
+  // Takes 3 functions:
+  //   - {grow} generates code to return a OrderedHashTable subclass instance
+  //     with space to store the entry.
+  //   - {store_new_entry} generates code to store into a new entry, for the
+  //     case when {table} didn't already have an entry keyed by {key}.
+  //   - {store_existing_entry} generates code to store into an existing entry,
+  //     for the case when {table} already has an entry keyed by {key}.
+  //
+  // Both {store_new_entry} and {store_existing_entry} take the table and an
+  // offset to the entry as parameters.
+  template <typename CollectionType>
+  using GrowCollection = std::function<const TNode<CollectionType>()>;
+  template <typename CollectionType>
+  using StoreAtEntry = std::function<void(const TNode<CollectionType> table,
+                                          const TNode<IntPtrT> entry_start)>;
+  template <typename CollectionType>
+  TNode<CollectionType> AddToOrderedHashTable(
+      const TNode<CollectionType> table, const TNode<Object> key,
+      const GrowCollection<CollectionType>& grow,
+      const StoreAtEntry<CollectionType>& store_at_new_entry,
+      const StoreAtEntry<CollectionType>& store_at_existing_entry);
+
+  template <typename CollectionType>
+  void TryLookupOrderedHashTableIndex(const TNode<CollectionType> table,
+                                      const TNode<Object> key,
+                                      TVariable<IntPtrT>* result,
+                                      Label* if_entry_found,
+                                      Label* if_not_found);
+
+  // Generates code to store a new entry into {table}, connecting to the bucket
+  // chain, and updating the bucket head. {store_new_entry} is called to
+  // generate the code to store the payload (e.g., the key and value for
+  // OrderedHashMap).
+  template <typename CollectionType>
+  void StoreOrderedHashTableNewEntry(
+      const TNode<CollectionType> table, const TNode<IntPtrT> hash,
+      const TNode<IntPtrT> number_of_buckets, const TNode<IntPtrT> occupancy,
+      const StoreAtEntry<CollectionType>& store_at_new_entry);
+
+  // Store payload (key, value, or both) in {table} at {entry}. Does not connect
+  // the bucket chain and update the bucket head.
+  void StoreValueInOrderedHashMapEntry(
+      const TNode<OrderedHashMap> table, const TNode<Object> value,
+      const TNode<IntPtrT> entry,
+      CheckBounds check_bounds = CheckBounds::kAlways);
+  void StoreKeyValueInOrderedHashMapEntry(
+      const TNode<OrderedHashMap> table, const TNode<Object> key,
+      const TNode<Object> value, const TNode<IntPtrT> entry,
+      CheckBounds check_bounds = CheckBounds::kAlways);
+  void StoreKeyInOrderedHashSetEntry(
+      const TNode<OrderedHashSet> table, const TNode<Object> key,
+      const TNode<IntPtrT> entry,
+      CheckBounds check_bounds = CheckBounds::kAlways);
+
+  void UnsafeStoreKeyValueInOrderedHashMapEntry(
+      const TNode<OrderedHashMap> table, const TNode<Object> key,
+      const TNode<Object> value, const TNode<IntPtrT> entry) {
+    return StoreKeyValueInOrderedHashMapEntry(table, key, value, entry,
+                                              CheckBounds::kDebugOnly);
+  }
+  void UnsafeStoreKeyInOrderedHashSetEntry(const TNode<OrderedHashSet> table,
+                                           const TNode<Object> key,
+                                           const TNode<IntPtrT> entry) {
+    return StoreKeyInOrderedHashSetEntry(table, key, entry,
+                                         CheckBounds::kDebugOnly);
+  }
+
+  // Load payload (key or value) from {table} at {entry}.
+  template <typename CollectionType>
+  TNode<Object> LoadKeyFromOrderedHashTableEntry(
+      const TNode<CollectionType> table, const TNode<IntPtrT> entry,
+      CheckBounds check_bounds = CheckBounds::kAlways);
+  TNode<Object> LoadValueFromOrderedHashMapEntry(
+      const TNode<OrderedHashMap> table, const TNode<IntPtrT> entry,
+      CheckBounds check_bounds = CheckBounds::kAlways);
+
+  template <typename CollectionType>
+  TNode<Object> UnsafeLoadKeyFromOrderedHashTableEntry(
+      const TNode<CollectionType> table, const TNode<IntPtrT> entry) {
+    return LoadKeyFromOrderedHashTableEntry(table, entry,
+                                            CheckBounds::kDebugOnly);
+  }
+  TNode<Object> UnsafeLoadValueFromOrderedHashMapEntry(
+      const TNode<OrderedHashMap> table, const TNode<IntPtrT> entry) {
+    return LoadValueFromOrderedHashMapEntry(table, entry,
+                                            CheckBounds::kDebugOnly);
+  }
+
+  // Create a JSArray with PACKED_ELEMENTS kind from a Map.prototype.keys() or
+  // Map.prototype.values() iterator. The iterator is assumed to satisfy
+  // IterableWithOriginalKeyOrValueMapIterator. This function will skip the
+  // iterator and iterate directly on the underlying hash table. In the end it
+  // will update the state of the iterator to 'exhausted'.
+  TNode<JSArray> MapIteratorToList(TNode<Context> context,
+                                   TNode<JSMapIterator> iterator);
+
+  // Create a JSArray with PACKED_ELEMENTS kind from a Set.prototype.keys() or
+  // Set.prototype.values() iterator, or a Set. The |iterable| is assumed to
+  // satisfy IterableWithOriginalValueSetIterator. This function will skip the
+  // iterator and iterate directly on the underlying hash table. In the end, if
+  // |iterable| is an iterator, it will update the state of the iterator to
+  // 'exhausted'.
+  TNode<JSArray> SetOrSetIteratorToList(TNode<Context> context,
+                                        TNode<HeapObject> iterable);
+
+  void BranchIfMapIteratorProtectorValid(Label* if_true, Label* if_false);
+  void BranchIfSetIteratorProtectorValid(Label* if_true, Label* if_false);
+
+  // Builds code that finds OrderedHashTable entry for a key with hash code
+  // {hash} with using the comparison code generated by {key_compare}. The code
+  // jumps to {entry_found} if the key is found, or to {not_found} if the key
+  // was not found. In the {entry_found} branch, the variable
+  // entry_start_position will be bound to the index of the entry (relative to
+  // OrderedHashTable::kHashTableStartIndex).
+  //
+  // The {CollectionType} template parameter stands for the particular instance
+  // of OrderedHashTable, it should be OrderedHashMap or OrderedHashSet.
+  template <typename CollectionType>
+  void FindOrderedHashTableEntry(
+      const TNode<CollectionType> table, const TNode<Uint32T> hash,
+      const std::function<void(TNode<Object>, Label*, Label*)>& key_compare,
+      TVariable<IntPtrT>* entry_start_position, Label* entry_found,
+      Label* not_found);
+
+  TNode<Word32T> ComputeUnseededHash(TNode<IntPtrT> key);
+};
+
 class WeakCollectionsBuiltinsAssembler : public BaseCollectionsAssembler {
  public:
   explicit WeakCollectionsBuiltinsAssembler(compiler::CodeAssemblerState* state)
@@ -149,7 +450,7 @@ class WeakCollectionsBuiltinsAssembler : public BaseCollectionsAssembler {
  protected:
   void AddEntry(TNode<EphemeronHashTable> table, TNode<IntPtrT> key_index,
                 TNode<Object> key, TNode<Object> value,
-                TNode<IntPtrT> number_of_elements);
+                TNode<Int32T> number_of_elements);
 
   TNode<HeapObject> AllocateTable(Variant variant,
                                   TNode<IntPtrT> at_least_space_for) override;
@@ -182,27 +483,30 @@ class WeakCollectionsBuiltinsAssembler : public BaseCollectionsAssembler {
                                     TNode<IntPtrT> entry_mask,
                                     Label* if_not_found);
 
-  TNode<Word32T> InsufficientCapacityToAdd(TNode<IntPtrT> capacity,
-                                           TNode<IntPtrT> number_of_elements,
-                                           TNode<IntPtrT> number_of_deleted);
+  TNode<Word32T> InsufficientCapacityToAdd(TNode<Int32T> capacity,
+                                           TNode<Int32T> number_of_elements,
+                                           TNode<Int32T> number_of_deleted);
   TNode<IntPtrT> KeyIndexFromEntry(TNode<IntPtrT> entry);
 
-  TNode<IntPtrT> LoadNumberOfElements(TNode<EphemeronHashTable> table,
-                                      int offset);
-  TNode<IntPtrT> LoadNumberOfDeleted(TNode<EphemeronHashTable> table,
-                                     int offset = 0);
+  TNode<Int32T> LoadNumberOfElements(TNode<EphemeronHashTable> table,
+                                     int offset);
+  TNode<Int32T> LoadNumberOfDeleted(TNode<EphemeronHashTable> table,
+                                    int offset = 0);
   TNode<EphemeronHashTable> LoadTable(TNode<JSWeakCollection> collection);
   TNode<IntPtrT> LoadTableCapacity(TNode<EphemeronHashTable> table);
 
   void RemoveEntry(TNode<EphemeronHashTable> table, TNode<IntPtrT> key_index,
                    TNode<IntPtrT> number_of_elements);
-  TNode<BoolT> ShouldRehash(TNode<IntPtrT> number_of_elements,
-                            TNode<IntPtrT> number_of_deleted);
+  TNode<BoolT> ShouldRehash(TNode<Int32T> number_of_elements,
+                            TNode<Int32T> number_of_deleted);
   TNode<Word32T> ShouldShrink(TNode<IntPtrT> capacity,
                               TNode<IntPtrT> number_of_elements);
   TNode<IntPtrT> ValueIndexFromKeyIndex(TNode<IntPtrT> key_index);
 };
 
+// Controls the key coercion behavior for Object.groupBy and Map.groupBy.
+enum class GroupByCoercionMode { kZero, kProperty };
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/builtins/builtins-console.cc b/deps/v8/src/builtins/builtins-console.cc
index 8631b799e04d46..90b1a53845a1fe 100644
--- a/deps/v8/src/builtins/builtins-console.cc
+++ b/deps/v8/src/builtins/builtins-console.cc
@@ -63,7 +63,7 @@ namespace {
 // which is different for example in case of `console.log` where it
 // is 1 compared to `console.assert` where it is 2.
 bool Formatter(Isolate* isolate, BuiltinArguments& args, int index) {
-  if (args.length() < index + 2 || !args[index].IsString()) {
+  if (args.length() < index + 2 || !IsString(args[index])) {
     return true;
   }
   struct State {
@@ -84,7 +84,7 @@ bool Formatter(Isolate* isolate, BuiltinArguments& args, int index) {
     Handle<Object> current = args.at(index);
     uint16_t specifier = state.str->Get(state.off + 1, isolate);
     if (specifier == 'd' || specifier == 'f' || specifier == 'i') {
-      if (current->IsSymbol()) {
+      if (IsSymbol(*current)) {
         current = isolate->factory()->nan_value();
       } else {
         Handle<Object> params[] = {current,
@@ -144,6 +144,7 @@ void ConsoleCall(
     Isolate* isolate, const internal::BuiltinArguments& args,
     void (debug::ConsoleDelegate::*func)(const v8::debug::ConsoleCallArguments&,
                                          const v8::debug::ConsoleContext&)) {
+  if (isolate->is_execution_terminating()) return;
   CHECK(!isolate->has_pending_exception());
   CHECK(!isolate->has_scheduled_exception());
   if (!isolate->console_delegate()) return;
@@ -152,11 +153,11 @@ void ConsoleCall(
   Handle<Object> context_id_obj = JSObject::GetDataProperty(
       isolate, args.target(), isolate->factory()->console_context_id_symbol());
   int context_id =
-      context_id_obj->IsSmi() ? Handle<Smi>::cast(context_id_obj)->value() : 0;
+      IsSmi(*context_id_obj) ? Smi::cast(*context_id_obj).value() : 0;
   Handle<Object> context_name_obj = JSObject::GetDataProperty(
       isolate, args.target(),
       isolate->factory()->console_context_name_symbol());
-  Handle<String> context_name = context_name_obj->IsString()
+  Handle<String> context_name = IsString(*context_name_obj)
                                     ? Handle<String>::cast(context_name_obj)
                                     : isolate->factory()->anonymous_string();
   (isolate->console_delegate()->*func)(
@@ -166,11 +167,11 @@ void ConsoleCall(
 
 void LogTimerEvent(Isolate* isolate, BuiltinArguments args,
                    v8::LogEventStatus se) {
-  if (!isolate->v8_file_logger()->is_logging()) return;
+  if (!v8_flags.log_timer_events) return;
   HandleScope scope(isolate);
   std::unique_ptr<char[]> name;
   const char* raw_name = "default";
-  if (args.length() > 1 && args[1].IsString()) {
+  if (args.length() > 1 && IsString(args[1])) {
     // Try converting the first argument to a string.
     name = args.at<String>(1)->ToCString();
     raw_name = name.get();
@@ -242,13 +243,13 @@ void InstallContextFunction(Isolate* isolate, Handle<JSObject> target,
   Handle<JSFunction> fun =
       Factory::JSFunctionBuilder{isolate, info, context}.set_map(map).Build();
 
-  fun->shared().set_native(true);
-  fun->shared().DontAdaptArguments();
-  fun->shared().set_length(1);
+  fun->shared()->set_native(true);
+  fun->shared()->DontAdaptArguments();
+  fun->shared()->set_length(1);
 
   JSObject::AddProperty(isolate, fun, factory->console_context_id_symbol(),
                         handle(Smi::FromInt(context_id), isolate), NONE);
-  if (context_name->IsString()) {
+  if (IsString(*context_name)) {
     JSObject::AddProperty(isolate, fun, factory->console_context_name_symbol(),
                           context_name, NONE);
   }
@@ -274,7 +275,7 @@ BUILTIN(ConsoleContext) {
   JSFunction::SetPrototype(cons, prototype);
 
   Handle<JSObject> context = factory->NewJSObject(cons, AllocationType::kOld);
-  DCHECK(context->IsJSObject());
+  DCHECK(IsJSObject(*context));
   int id = isolate->last_console_context_id() + 1;
   isolate->set_last_console_context_id(id);
 
diff --git a/deps/v8/src/builtins/builtins-constructor-gen.cc b/deps/v8/src/builtins/builtins-constructor-gen.cc
index 7a47263c9deace..c6423124c141a5 100644
--- a/deps/v8/src/builtins/builtins-constructor-gen.cc
+++ b/deps/v8/src/builtins/builtins-constructor-gen.cc
@@ -253,7 +253,7 @@ TF_BUILTIN(FastNewClosure, ConstructorBuiltinsAssembler) {
                                  shared_function_info);
   StoreObjectFieldNoWriteBarrier(result, JSFunction::kContextOffset, context);
   TNode<Code> lazy_builtin = HeapConstant(BUILTIN_CODE(isolate(), CompileLazy));
-  StoreObjectFieldNoWriteBarrier(result, JSFunction::kCodeOffset, lazy_builtin);
+  StoreMaybeIndirectPointerField(result, JSFunction::kCodeOffset, lazy_builtin);
   Return(result);
 }
 
diff --git a/deps/v8/src/builtins/builtins-dataview.cc b/deps/v8/src/builtins/builtins-dataview.cc
index c6d8adeceaa6ef..8895327cc16797 100644
--- a/deps/v8/src/builtins/builtins-dataview.cc
+++ b/deps/v8/src/builtins/builtins-dataview.cc
@@ -22,7 +22,7 @@ BUILTIN(DataViewConstructor) {
   const char* const kMethodName = "DataView constructor";
   HandleScope scope(isolate);
   // 1. If NewTarget is undefined, throw a TypeError exception.
-  if (args.new_target()->IsUndefined(isolate)) {  // [[Call]]
+  if (IsUndefined(*args.new_target(), isolate)) {  // [[Call]]
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kConstructorNotFunction,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -36,7 +36,7 @@ BUILTIN(DataViewConstructor) {
   Handle<Object> byte_length = args.atOrUndefined(isolate, 3);
 
   // 2. Perform ? RequireInternalSlot(buffer, [[ArrayBufferData]]).
-  if (!buffer->IsJSArrayBuffer()) {
+  if (!IsJSArrayBuffer(*buffer)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kDataViewNotArrayBuffer));
   }
@@ -46,7 +46,7 @@ BUILTIN(DataViewConstructor) {
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, byte_offset,
       Object::ToIndex(isolate, byte_offset, MessageTemplate::kInvalidOffset));
-  size_t view_byte_offset = byte_offset->Number();
+  size_t view_byte_offset = Object::Number(*byte_offset);
 
   // 4. If IsDetachedBuffer(buffer) is true, throw a TypeError exception.
   if (array_buffer->was_detached()) {
@@ -73,7 +73,7 @@ BUILTIN(DataViewConstructor) {
   //       a. Let viewByteLength be bufferByteLength - offset.
   size_t view_byte_length;
   bool length_tracking = false;
-  if (byte_length->IsUndefined(isolate)) {
+  if (IsUndefined(*byte_length, isolate)) {
     view_byte_length = buffer_byte_length - view_byte_offset;
     length_tracking = array_buffer->is_resizable_by_js();
   } else {
@@ -86,12 +86,12 @@ BUILTIN(DataViewConstructor) {
         isolate, byte_length,
         Object::ToIndex(isolate, byte_length,
                         MessageTemplate::kInvalidDataViewLength));
-    if (view_byte_offset + byte_length->Number() > buffer_byte_length) {
+    if (view_byte_offset + Object::Number(*byte_length) > buffer_byte_length) {
       THROW_NEW_ERROR_RETURN_FAILURE(
           isolate,
           NewRangeError(MessageTemplate::kInvalidDataViewLength, byte_length));
     }
-    view_byte_length = byte_length->Number();
+    view_byte_length = Object::Number(*byte_length);
   }
 
   bool is_backed_by_rab =
@@ -125,19 +125,19 @@ BUILTIN(DataViewConstructor) {
     // passes ObjectVerify, which may for example be triggered when allocating
     // error objects below.
     DisallowGarbageCollection no_gc;
-    JSDataViewOrRabGsabDataView raw = *data_view;
+    Tagged<JSDataViewOrRabGsabDataView> raw = *data_view;
 
     for (int i = 0; i < ArrayBufferView::kEmbedderFieldCount; ++i) {
       // TODO(v8:10391, saelo): Handle external pointers in EmbedderDataSlot
-      raw.SetEmbedderField(i, Smi::zero());
+      raw->SetEmbedderField(i, Smi::zero());
     }
-    raw.set_bit_field(0);
-    raw.set_is_backed_by_rab(is_backed_by_rab);
-    raw.set_is_length_tracking(length_tracking);
-    raw.set_byte_length(0);
-    raw.set_byte_offset(0);
-    raw.set_data_pointer(isolate, array_buffer->backing_store());
-    raw.set_buffer(*array_buffer);
+    raw->set_bit_field(0);
+    raw->set_is_backed_by_rab(is_backed_by_rab);
+    raw->set_is_length_tracking(length_tracking);
+    raw->set_byte_length(0);
+    raw->set_byte_offset(0);
+    raw->set_data_pointer(isolate, array_buffer->backing_store());
+    raw->set_buffer(*array_buffer);
   }
 
   // 13. If IsDetachedBuffer(buffer) is true, throw a TypeError exception.
diff --git a/deps/v8/src/builtins/builtins-date-gen.cc b/deps/v8/src/builtins/builtins-date-gen.cc
index b3ad88c6d593d4..5edd5487f308b7 100644
--- a/deps/v8/src/builtins/builtins-date-gen.cc
+++ b/deps/v8/src/builtins/builtins-date-gen.cc
@@ -5,6 +5,7 @@
 #include "src/builtins/builtins-utils-gen.h"
 #include "src/builtins/builtins.h"
 #include "src/codegen/code-stub-assembler.h"
+#include "src/objects/dictionary.h"
 
 namespace v8 {
 namespace internal {
diff --git a/deps/v8/src/builtins/builtins-date.cc b/deps/v8/src/builtins/builtins-date.cc
index c9cbccf4fed3af..f539f1f6071c61 100644
--- a/deps/v8/src/builtins/builtins-date.cc
+++ b/deps/v8/src/builtins/builtins-date.cc
@@ -74,7 +74,7 @@ Object SetLocalDateValue(Isolate* isolate, Handle<JSDate> date,
 // ES #sec-date-constructor
 BUILTIN(DateConstructor) {
   HandleScope scope(isolate);
-  if (args.new_target()->IsUndefined(isolate)) {
+  if (IsUndefined(*args.new_target(), isolate)) {
     double const time_val =
         static_cast<double>(JSDate::CurrentTimeValue(isolate));
     DateBuffer buffer = ToDateString(time_val, isolate->date_cache(),
@@ -91,17 +91,17 @@ BUILTIN(DateConstructor) {
     time_val = static_cast<double>(JSDate::CurrentTimeValue(isolate));
   } else if (argc == 1) {
     Handle<Object> value = args.at(1);
-    if (value->IsJSDate()) {
-      time_val = Handle<JSDate>::cast(value)->value().Number();
+    if (IsJSDate(*value)) {
+      time_val = Object::Number(Handle<JSDate>::cast(value)->value());
     } else {
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, value,
                                          Object::ToPrimitive(isolate, value));
-      if (value->IsString()) {
+      if (IsString(*value)) {
         time_val = ParseDateTimeString(isolate, Handle<String>::cast(value));
       } else {
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, value,
                                            Object::ToNumber(isolate, value));
-        time_val = value->Number();
+        time_val = Object::Number(*value);
       }
     }
   } else {
@@ -111,34 +111,34 @@ BUILTIN(DateConstructor) {
     Handle<Object> month_object;
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, month_object,
                                        Object::ToNumber(isolate, args.at(2)));
-    double year = year_object->Number();
-    double month = month_object->Number();
+    double year = Object::Number(*year_object);
+    double month = Object::Number(*month_object);
     double date = 1.0, hours = 0.0, minutes = 0.0, seconds = 0.0, ms = 0.0;
     if (argc >= 3) {
       Handle<Object> date_object;
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, date_object,
                                          Object::ToNumber(isolate, args.at(3)));
-      date = date_object->Number();
+      date = Object::Number(*date_object);
       if (argc >= 4) {
         Handle<Object> hours_object;
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
             isolate, hours_object, Object::ToNumber(isolate, args.at(4)));
-        hours = hours_object->Number();
+        hours = Object::Number(*hours_object);
         if (argc >= 5) {
           Handle<Object> minutes_object;
           ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
               isolate, minutes_object, Object::ToNumber(isolate, args.at(5)));
-          minutes = minutes_object->Number();
+          minutes = Object::Number(*minutes_object);
           if (argc >= 6) {
             Handle<Object> seconds_object;
             ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
                 isolate, seconds_object, Object::ToNumber(isolate, args.at(6)));
-            seconds = seconds_object->Number();
+            seconds = Object::Number(*seconds_object);
             if (argc >= 7) {
               Handle<Object> ms_object;
               ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
                   isolate, ms_object, Object::ToNumber(isolate, args.at(7)));
-              ms = ms_object->Number();
+              ms = Object::Number(*ms_object);
             }
           }
         }
@@ -189,38 +189,38 @@ BUILTIN(DateUTC) {
     Handle<Object> year_object;
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, year_object,
                                        Object::ToNumber(isolate, args.at(1)));
-    year = year_object->Number();
+    year = Object::Number(*year_object);
     if (argc >= 2) {
       Handle<Object> month_object;
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, month_object,
                                          Object::ToNumber(isolate, args.at(2)));
-      month = month_object->Number();
+      month = Object::Number(*month_object);
       if (argc >= 3) {
         Handle<Object> date_object;
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
             isolate, date_object, Object::ToNumber(isolate, args.at(3)));
-        date = date_object->Number();
+        date = Object::Number(*date_object);
         if (argc >= 4) {
           Handle<Object> hours_object;
           ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
               isolate, hours_object, Object::ToNumber(isolate, args.at(4)));
-          hours = hours_object->Number();
+          hours = Object::Number(*hours_object);
           if (argc >= 5) {
             Handle<Object> minutes_object;
             ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
                 isolate, minutes_object, Object::ToNumber(isolate, args.at(5)));
-            minutes = minutes_object->Number();
+            minutes = Object::Number(*minutes_object);
             if (argc >= 6) {
               Handle<Object> seconds_object;
               ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
                   isolate, seconds_object,
                   Object::ToNumber(isolate, args.at(6)));
-              seconds = seconds_object->Number();
+              seconds = Object::Number(*seconds_object);
               if (argc >= 7) {
                 Handle<Object> ms_object;
                 ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
                     isolate, ms_object, Object::ToNumber(isolate, args.at(7)));
-                ms = ms_object->Number();
+                ms = Object::Number(*ms_object);
               }
             }
           }
@@ -245,7 +245,7 @@ BUILTIN(DatePrototypeSetDate) {
   Handle<Object> value = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, value,
                                      Object::ToNumber(isolate, value));
-  double time_val = date->value().Number();
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
@@ -253,7 +253,8 @@ BUILTIN(DatePrototypeSetDate) {
     int time_within_day = isolate->date_cache()->TimeInDay(local_time_ms, days);
     int year, month, day;
     isolate->date_cache()->YearMonthDayFromDays(days, &year, &month, &day);
-    time_val = MakeDate(MakeDay(year, month, value->Number()), time_within_day);
+    time_val =
+        MakeDate(MakeDay(year, month, Object::Number(*value)), time_within_day);
   }
   return SetLocalDateValue(isolate, date, time_val);
 }
@@ -266,10 +267,11 @@ BUILTIN(DatePrototypeSetFullYear) {
   Handle<Object> year = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, year,
                                      Object::ToNumber(isolate, year));
-  double year_double = year->Number(), month_double = 0.0, day_double = 1.0;
+  double year_double = Object::Number(*year), month_double = 0.0,
+         day_double = 1.0;
   int time_within_day = 0;
-  if (!std::isnan(date->value().Number())) {
-    int64_t const time_ms = static_cast<int64_t>(date->value().Number());
+  if (!std::isnan(Object::Number(date->value()))) {
+    int64_t const time_ms = static_cast<int64_t>(Object::Number(date->value()));
     int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
     int const days = isolate->date_cache()->DaysFromTime(local_time_ms);
     time_within_day = isolate->date_cache()->TimeInDay(local_time_ms, days);
@@ -283,12 +285,12 @@ BUILTIN(DatePrototypeSetFullYear) {
     Handle<Object> month = args.at(2);
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, month,
                                        Object::ToNumber(isolate, month));
-    month_double = month->Number();
+    month_double = Object::Number(*month);
     if (argc >= 3) {
       Handle<Object> day = args.at(3);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, day,
                                          Object::ToNumber(isolate, day));
-      day_double = day->Number();
+      day_double = Object::Number(*day);
     }
   }
   double time_val =
@@ -304,8 +306,8 @@ BUILTIN(DatePrototypeSetHours) {
   Handle<Object> hour = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, hour,
                                      Object::ToNumber(isolate, hour));
-  double h = hour->Number();
-  double time_val = date->value().Number();
+  double h = Object::Number(*hour);
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
@@ -318,17 +320,17 @@ BUILTIN(DatePrototypeSetHours) {
       Handle<Object> min = args.at(2);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, min,
                                          Object::ToNumber(isolate, min));
-      m = min->Number();
+      m = Object::Number(*min);
       if (argc >= 3) {
         Handle<Object> sec = args.at(3);
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, sec,
                                            Object::ToNumber(isolate, sec));
-        s = sec->Number();
+        s = Object::Number(*sec);
         if (argc >= 4) {
           Handle<Object> ms = args.at(4);
           ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, ms,
                                              Object::ToNumber(isolate, ms));
-          milli = ms->Number();
+          milli = Object::Number(*ms);
         }
       }
     }
@@ -344,7 +346,7 @@ BUILTIN(DatePrototypeSetMilliseconds) {
   Handle<Object> ms = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, ms,
                                      Object::ToNumber(isolate, ms));
-  double time_val = date->value().Number();
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
@@ -353,7 +355,7 @@ BUILTIN(DatePrototypeSetMilliseconds) {
     int h = time_within_day / (60 * 60 * 1000);
     int m = (time_within_day / (60 * 1000)) % 60;
     int s = (time_within_day / 1000) % 60;
-    time_val = MakeDate(day, MakeTime(h, m, s, ms->Number()));
+    time_val = MakeDate(day, MakeTime(h, m, s, Object::Number(*ms)));
   }
   return SetLocalDateValue(isolate, date, time_val);
 }
@@ -366,26 +368,26 @@ BUILTIN(DatePrototypeSetMinutes) {
   Handle<Object> min = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, min,
                                      Object::ToNumber(isolate, min));
-  double time_val = date->value().Number();
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
     int day = isolate->date_cache()->DaysFromTime(local_time_ms);
     int time_within_day = isolate->date_cache()->TimeInDay(local_time_ms, day);
     int h = time_within_day / (60 * 60 * 1000);
-    double m = min->Number();
+    double m = Object::Number(*min);
     double s = (time_within_day / 1000) % 60;
     double milli = time_within_day % 1000;
     if (argc >= 2) {
       Handle<Object> sec = args.at(2);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, sec,
                                          Object::ToNumber(isolate, sec));
-      s = sec->Number();
+      s = Object::Number(*sec);
       if (argc >= 3) {
         Handle<Object> ms = args.at(3);
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, ms,
                                            Object::ToNumber(isolate, ms));
-        milli = ms->Number();
+        milli = Object::Number(*ms);
       }
     }
     time_val = MakeDate(day, MakeTime(h, m, s, milli));
@@ -401,7 +403,7 @@ BUILTIN(DatePrototypeSetMonth) {
   Handle<Object> month = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, month,
                                      Object::ToNumber(isolate, month));
-  double time_val = this_date->value().Number();
+  double time_val = Object::Number(this_date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
@@ -409,13 +411,13 @@ BUILTIN(DatePrototypeSetMonth) {
     int time_within_day = isolate->date_cache()->TimeInDay(local_time_ms, days);
     int year, unused, day;
     isolate->date_cache()->YearMonthDayFromDays(days, &year, &unused, &day);
-    double m = month->Number();
+    double m = Object::Number(*month);
     double dt = day;
     if (argc >= 2) {
       Handle<Object> date = args.at(2);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, date,
                                          Object::ToNumber(isolate, date));
-      dt = date->Number();
+      dt = Object::Number(*date);
     }
     time_val = MakeDate(MakeDay(year, m, dt), time_within_day);
   }
@@ -430,7 +432,7 @@ BUILTIN(DatePrototypeSetSeconds) {
   Handle<Object> sec = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, sec,
                                      Object::ToNumber(isolate, sec));
-  double time_val = date->value().Number();
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
@@ -438,13 +440,13 @@ BUILTIN(DatePrototypeSetSeconds) {
     int time_within_day = isolate->date_cache()->TimeInDay(local_time_ms, day);
     int h = time_within_day / (60 * 60 * 1000);
     double m = (time_within_day / (60 * 1000)) % 60;
-    double s = sec->Number();
+    double s = Object::Number(*sec);
     double milli = time_within_day % 1000;
     if (argc >= 2) {
       Handle<Object> ms = args.at(2);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, ms,
                                          Object::ToNumber(isolate, ms));
-      milli = ms->Number();
+      milli = Object::Number(*ms);
     }
     time_val = MakeDate(day, MakeTime(h, m, s, milli));
   }
@@ -458,7 +460,7 @@ BUILTIN(DatePrototypeSetTime) {
   Handle<Object> value = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, value,
                                      Object::ToNumber(isolate, value));
-  return *JSDate::SetValue(date, DateCache::TimeClip(value->Number()));
+  return *JSDate::SetValue(date, DateCache::TimeClip(Object::Number(*value)));
 }
 
 // ES6 section 20.3.4.28 Date.prototype.setUTCDate ( date )
@@ -468,14 +470,14 @@ BUILTIN(DatePrototypeSetUTCDate) {
   Handle<Object> value = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, value,
                                      Object::ToNumber(isolate, value));
-  if (std::isnan(date->value().Number())) return date->value();
-  int64_t const time_ms = static_cast<int64_t>(date->value().Number());
+  if (std::isnan(Object::Number(date->value()))) return date->value();
+  int64_t const time_ms = static_cast<int64_t>(Object::Number(date->value()));
   int const days = isolate->date_cache()->DaysFromTime(time_ms);
   int const time_within_day = isolate->date_cache()->TimeInDay(time_ms, days);
   int year, month, day;
   isolate->date_cache()->YearMonthDayFromDays(days, &year, &month, &day);
   double const time_val =
-      MakeDate(MakeDay(year, month, value->Number()), time_within_day);
+      MakeDate(MakeDay(year, month, Object::Number(*value)), time_within_day);
   return *JSDate::SetValue(date, DateCache::TimeClip(time_val));
 }
 
@@ -487,10 +489,11 @@ BUILTIN(DatePrototypeSetUTCFullYear) {
   Handle<Object> year = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, year,
                                      Object::ToNumber(isolate, year));
-  double year_double = year->Number(), month_double = 0.0, day_double = 1.0;
+  double year_double = Object::Number(*year), month_double = 0.0,
+         day_double = 1.0;
   int time_within_day = 0;
-  if (!std::isnan(date->value().Number())) {
-    int64_t const time_ms = static_cast<int64_t>(date->value().Number());
+  if (!std::isnan(Object::Number(date->value()))) {
+    int64_t const time_ms = static_cast<int64_t>(Object::Number(date->value()));
     int const days = isolate->date_cache()->DaysFromTime(time_ms);
     time_within_day = isolate->date_cache()->TimeInDay(time_ms, days);
     int year_int, month_int, day_int;
@@ -503,12 +506,12 @@ BUILTIN(DatePrototypeSetUTCFullYear) {
     Handle<Object> month = args.at(2);
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, month,
                                        Object::ToNumber(isolate, month));
-    month_double = month->Number();
+    month_double = Object::Number(*month);
     if (argc >= 3) {
       Handle<Object> day = args.at(3);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, day,
                                          Object::ToNumber(isolate, day));
-      day_double = day->Number();
+      day_double = Object::Number(*day);
     }
   }
   double const time_val =
@@ -524,8 +527,8 @@ BUILTIN(DatePrototypeSetUTCHours) {
   Handle<Object> hour = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, hour,
                                      Object::ToNumber(isolate, hour));
-  double h = hour->Number();
-  double time_val = date->value().Number();
+  double h = Object::Number(*hour);
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int day = isolate->date_cache()->DaysFromTime(time_ms);
@@ -537,17 +540,17 @@ BUILTIN(DatePrototypeSetUTCHours) {
       Handle<Object> min = args.at(2);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, min,
                                          Object::ToNumber(isolate, min));
-      m = min->Number();
+      m = Object::Number(*min);
       if (argc >= 3) {
         Handle<Object> sec = args.at(3);
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, sec,
                                            Object::ToNumber(isolate, sec));
-        s = sec->Number();
+        s = Object::Number(*sec);
         if (argc >= 4) {
           Handle<Object> ms = args.at(4);
           ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, ms,
                                              Object::ToNumber(isolate, ms));
-          milli = ms->Number();
+          milli = Object::Number(*ms);
         }
       }
     }
@@ -563,7 +566,7 @@ BUILTIN(DatePrototypeSetUTCMilliseconds) {
   Handle<Object> ms = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, ms,
                                      Object::ToNumber(isolate, ms));
-  double time_val = date->value().Number();
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int day = isolate->date_cache()->DaysFromTime(time_ms);
@@ -571,7 +574,7 @@ BUILTIN(DatePrototypeSetUTCMilliseconds) {
     int h = time_within_day / (60 * 60 * 1000);
     int m = (time_within_day / (60 * 1000)) % 60;
     int s = (time_within_day / 1000) % 60;
-    time_val = MakeDate(day, MakeTime(h, m, s, ms->Number()));
+    time_val = MakeDate(day, MakeTime(h, m, s, Object::Number(*ms)));
   }
   return *JSDate::SetValue(date, DateCache::TimeClip(time_val));
 }
@@ -584,25 +587,25 @@ BUILTIN(DatePrototypeSetUTCMinutes) {
   Handle<Object> min = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, min,
                                      Object::ToNumber(isolate, min));
-  double time_val = date->value().Number();
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int day = isolate->date_cache()->DaysFromTime(time_ms);
     int time_within_day = isolate->date_cache()->TimeInDay(time_ms, day);
     int h = time_within_day / (60 * 60 * 1000);
-    double m = min->Number();
+    double m = Object::Number(*min);
     double s = (time_within_day / 1000) % 60;
     double milli = time_within_day % 1000;
     if (argc >= 2) {
       Handle<Object> sec = args.at(2);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, sec,
                                          Object::ToNumber(isolate, sec));
-      s = sec->Number();
+      s = Object::Number(*sec);
       if (argc >= 3) {
         Handle<Object> ms = args.at(3);
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, ms,
                                            Object::ToNumber(isolate, ms));
-        milli = ms->Number();
+        milli = Object::Number(*ms);
       }
     }
     time_val = MakeDate(day, MakeTime(h, m, s, milli));
@@ -618,20 +621,20 @@ BUILTIN(DatePrototypeSetUTCMonth) {
   Handle<Object> month = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, month,
                                      Object::ToNumber(isolate, month));
-  double time_val = this_date->value().Number();
+  double time_val = Object::Number(this_date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int days = isolate->date_cache()->DaysFromTime(time_ms);
     int time_within_day = isolate->date_cache()->TimeInDay(time_ms, days);
     int year, unused, day;
     isolate->date_cache()->YearMonthDayFromDays(days, &year, &unused, &day);
-    double m = month->Number();
+    double m = Object::Number(*month);
     double dt = day;
     if (argc >= 2) {
       Handle<Object> date = args.at(2);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, date,
                                          Object::ToNumber(isolate, date));
-      dt = date->Number();
+      dt = Object::Number(*date);
     }
     time_val = MakeDate(MakeDay(year, m, dt), time_within_day);
   }
@@ -646,20 +649,20 @@ BUILTIN(DatePrototypeSetUTCSeconds) {
   Handle<Object> sec = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, sec,
                                      Object::ToNumber(isolate, sec));
-  double time_val = date->value().Number();
+  double time_val = Object::Number(date->value());
   if (!std::isnan(time_val)) {
     int64_t const time_ms = static_cast<int64_t>(time_val);
     int day = isolate->date_cache()->DaysFromTime(time_ms);
     int time_within_day = isolate->date_cache()->TimeInDay(time_ms, day);
     int h = time_within_day / (60 * 60 * 1000);
     double m = (time_within_day / (60 * 1000)) % 60;
-    double s = sec->Number();
+    double s = Object::Number(*sec);
     double milli = time_within_day % 1000;
     if (argc >= 2) {
       Handle<Object> ms = args.at(2);
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, ms,
                                          Object::ToNumber(isolate, ms));
-      milli = ms->Number();
+      milli = Object::Number(*ms);
     }
     time_val = MakeDate(day, MakeTime(h, m, s, milli));
   }
@@ -671,7 +674,7 @@ BUILTIN(DatePrototypeToDateString) {
   HandleScope scope(isolate);
   CHECK_RECEIVER(JSDate, date, "Date.prototype.toDateString");
   DateBuffer buffer =
-      ToDateString(date->value().Number(), isolate->date_cache(),
+      ToDateString(Object::Number(date->value()), isolate->date_cache(),
                    ToDateStringMode::kLocalDate);
   RETURN_RESULT_OR_FAILURE(
       isolate, isolate->factory()->NewStringFromUtf8(base::VectorOf(buffer)));
@@ -681,7 +684,7 @@ BUILTIN(DatePrototypeToDateString) {
 BUILTIN(DatePrototypeToISOString) {
   HandleScope scope(isolate);
   CHECK_RECEIVER(JSDate, date, "Date.prototype.toISOString");
-  double const time_val = date->value().Number();
+  double const time_val = Object::Number(date->value());
   if (std::isnan(time_val)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewRangeError(MessageTemplate::kInvalidTimeValue));
@@ -697,7 +700,7 @@ BUILTIN(DatePrototypeToString) {
   HandleScope scope(isolate);
   CHECK_RECEIVER(JSDate, date, "Date.prototype.toString");
   DateBuffer buffer =
-      ToDateString(date->value().Number(), isolate->date_cache(),
+      ToDateString(Object::Number(date->value()), isolate->date_cache(),
                    ToDateStringMode::kLocalDateAndTime);
   RETURN_RESULT_OR_FAILURE(
       isolate, isolate->factory()->NewStringFromUtf8(base::VectorOf(buffer)));
@@ -708,7 +711,7 @@ BUILTIN(DatePrototypeToTimeString) {
   HandleScope scope(isolate);
   CHECK_RECEIVER(JSDate, date, "Date.prototype.toTimeString");
   DateBuffer buffer =
-      ToDateString(date->value().Number(), isolate->date_cache(),
+      ToDateString(Object::Number(date->value()), isolate->date_cache(),
                    ToDateStringMode::kLocalTime);
   RETURN_RESULT_OR_FAILURE(
       isolate, isolate->factory()->NewStringFromUtf8(base::VectorOf(buffer)));
@@ -781,7 +784,7 @@ BUILTIN(DatePrototypeToUTCString) {
   HandleScope scope(isolate);
   CHECK_RECEIVER(JSDate, date, "Date.prototype.toUTCString");
   DateBuffer buffer =
-      ToDateString(date->value().Number(), isolate->date_cache(),
+      ToDateString(Object::Number(date->value()), isolate->date_cache(),
                    ToDateStringMode::kUTCDateAndTime);
   RETURN_RESULT_OR_FAILURE(
       isolate, isolate->factory()->NewStringFromUtf8(base::VectorOf(buffer)));
@@ -791,7 +794,7 @@ BUILTIN(DatePrototypeToUTCString) {
 BUILTIN(DatePrototypeGetYear) {
   HandleScope scope(isolate);
   CHECK_RECEIVER(JSDate, date, "Date.prototype.getYear");
-  double time_val = date->value().Number();
+  double time_val = Object::Number(date->value());
   if (std::isnan(time_val)) return date->value();
   int64_t time_ms = static_cast<int64_t>(time_val);
   int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
@@ -808,7 +811,8 @@ BUILTIN(DatePrototypeSetYear) {
   Handle<Object> year = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, year,
                                      Object::ToNumber(isolate, year));
-  double month_double = 0.0, day_double = 1.0, year_double = year->Number();
+  double month_double = 0.0, day_double = 1.0,
+         year_double = Object::Number(*year);
   if (!std::isnan(year_double)) {
     double year_int = DoubleToInteger(year_double);
     if (0.0 <= year_int && year_int <= 99.0) {
@@ -816,8 +820,8 @@ BUILTIN(DatePrototypeSetYear) {
     }
   }
   int time_within_day = 0;
-  if (!std::isnan(date->value().Number())) {
-    int64_t const time_ms = static_cast<int64_t>(date->value().Number());
+  if (!std::isnan(Object::Number(date->value()))) {
+    int64_t const time_ms = static_cast<int64_t>(Object::Number(date->value()));
     int64_t local_time_ms = isolate->date_cache()->ToLocal(time_ms);
     int const days = isolate->date_cache()->DaysFromTime(local_time_ms);
     time_within_day = isolate->date_cache()->TimeInDay(local_time_ms, days);
@@ -843,7 +847,7 @@ BUILTIN(DatePrototypeToJson) {
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, primitive,
       Object::ToPrimitive(isolate, receiver_obj, ToPrimitiveHint::kNumber));
-  if (primitive->IsNumber() && !std::isfinite(primitive->Number())) {
+  if (IsNumber(*primitive) && !std::isfinite(Object::Number(*primitive))) {
     return ReadOnlyRoots(isolate).null_value();
   } else {
     Handle<String> name =
@@ -851,7 +855,7 @@ BUILTIN(DatePrototypeToJson) {
     Handle<Object> function;
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
         isolate, function, Object::GetProperty(isolate, receiver_obj, name));
-    if (!function->IsCallable()) {
+    if (!IsCallable(*function)) {
       THROW_NEW_ERROR_RETURN_FAILURE(
           isolate, NewTypeError(MessageTemplate::kCalledNonCallable, name));
     }
diff --git a/deps/v8/src/builtins/builtins-definitions.h b/deps/v8/src/builtins/builtins-definitions.h
index 3e746487bc4a61..18da8a651ba30f 100644
--- a/deps/v8/src/builtins/builtins-definitions.h
+++ b/deps/v8/src/builtins/builtins-definitions.h
@@ -18,7 +18,7 @@ namespace internal {
 // TFJ: Builtin in Turbofan, with JS linkage (callable as Javascript function).
 //      Args: name, arguments count, explicit argument names...
 // TFS: Builtin in Turbofan, with CodeStub linkage.
-//      Args: name, explicit argument names...
+//      Args: name, needs context, explicit argument names...
 // TFC: Builtin in Turbofan, with CodeStub linkage and custom descriptor.
 //      Args: name, interface descriptor
 // TFH: Handlers in Turbofan, with CodeStub linkage.
@@ -54,6 +54,10 @@ namespace internal {
   TFC(AdaptorWithBuiltinExitFrame, CppBuiltinAdaptor)
 
 #define BUILTIN_LIST_BASE_TIER1(CPP, TFJ, TFC, TFS, TFH, ASM)                  \
+  /* GC write barriers */                                                      \
+  TFC(IndirectPointerBarrierSaveFP, WriteBarrier)                              \
+  TFC(IndirectPointerBarrierIgnoreFP, WriteBarrier)                            \
+                                                                               \
   /* TSAN support for stores in generated code. */                             \
   IF_TSAN(TFC, TSANRelaxedStore8IgnoreFP, TSANStore)                           \
   IF_TSAN(TFC, TSANRelaxedStore8SaveFP, TSANStore)                             \
@@ -117,6 +121,7 @@ namespace internal {
   ASM(CallFunctionForwardVarargs, CallForwardVarargs)                          \
   /* Call an API callback via a {FunctionTemplateInfo}, doing appropriate */   \
   /* access and compatible receiver checks. */                                 \
+  TFC(CallFunctionTemplate_Generic, CallFunctionTemplate)                      \
   TFC(CallFunctionTemplate_CheckAccess, CallFunctionTemplate)                  \
   TFC(CallFunctionTemplate_CheckCompatibleReceiver, CallFunctionTemplate)      \
   TFC(CallFunctionTemplate_CheckAccessAndCompatibleReceiver,                   \
@@ -144,7 +149,7 @@ namespace internal {
   ASM(JSConstructStubGeneric, ConstructStub)                                   \
   ASM(JSBuiltinsConstructStub, ConstructStub)                                  \
   TFC(FastNewObject, FastNewObject)                                            \
-  TFS(FastNewClosure, kSharedFunctionInfo, kFeedbackCell)                      \
+  TFS(FastNewClosure, NeedsContext::kYes, kSharedFunctionInfo, kFeedbackCell)  \
   /* ES6 section 9.5.14 [[Construct]] ( argumentsList, newTarget) */           \
   TFC(ConstructProxy, JSTrampoline)                                            \
                                                                                \
@@ -169,7 +174,7 @@ namespace internal {
   TFC(StringSubstring, StringSubstring)                                        \
                                                                                \
   /* OrderedHashTable helpers */                                               \
-  TFS(OrderedHashTableHealIndex, kTable, kIndex)                               \
+  TFS(OrderedHashTableHealIndex, NeedsContext::kYes, kTable, kIndex)           \
                                                                                \
   /* Interpreter */                                                            \
   /* InterpreterEntryTrampoline dispatches to the interpreter to run a */      \
@@ -180,6 +185,8 @@ namespace internal {
   ASM(InterpreterPushUndefinedAndArgsThenCall, InterpreterPushArgsThenCall)    \
   ASM(InterpreterPushArgsThenCallWithFinalSpread, InterpreterPushArgsThenCall) \
   ASM(InterpreterPushArgsThenConstruct, InterpreterPushArgsThenConstruct)      \
+  ASM(InterpreterPushArgsThenFastConstructFunction,                            \
+      InterpreterPushArgsThenConstruct)                                        \
   ASM(InterpreterPushArgsThenConstructArrayFunction,                           \
       InterpreterPushArgsThenConstruct)                                        \
   ASM(InterpreterPushArgsThenConstructWithFinalSpread,                         \
@@ -199,6 +206,10 @@ namespace internal {
                                                                                \
   /* Maglev Compiler */                                                        \
   ASM(MaglevOnStackReplacement, OnStackReplacement)                            \
+  ASM(MaglevFunctionEntryStackCheck_WithoutNewTarget, Void)                    \
+  ASM(MaglevFunctionEntryStackCheck_WithNewTarget, Void)                       \
+  ASM(MaglevOptimizeCodeOrTailCallOptimizedCodeSlot,                           \
+      MaglevOptimizeCodeOrTailCallOptimizedCodeSlot)                           \
                                                                                \
   /* Code life-cycle */                                                        \
   TFC(CompileLazy, JSTrampoline)                                               \
@@ -232,22 +243,23 @@ namespace internal {
   ASM(ContinueToJavaScriptBuiltinWithResult, ContinueToBuiltin)                \
                                                                                \
   /* API callback handling */                                                  \
-  ASM(CallApiCallback, ApiCallback)                                            \
+  ASM(CallApiCallbackGeneric, CallApiCallbackGeneric)                          \
+  ASM(CallApiCallbackOptimizedNoProfiling, CallApiCallbackOptimized)           \
+  ASM(CallApiCallbackOptimized, CallApiCallbackOptimized)                      \
   ASM(CallApiGetter, ApiGetter)                                                \
-  CPP(HandleApiCall)                                                           \
-  CPP(HandleApiCallAsFunction)                                                 \
-  CPP(HandleApiCallAsConstructor)                                              \
+  TFC(HandleApiCallOrConstruct, JSTrampoline)                                  \
+  CPP(HandleApiConstruct)                                                      \
+  CPP(HandleApiCallAsFunctionDelegate)                                         \
+  CPP(HandleApiCallAsConstructorDelegate)                                      \
                                                                                \
   /* Adapters for Turbofan into runtime */                                     \
   TFC(AllocateInYoungGeneration, Allocate)                                     \
-  TFC(AllocateRegularInYoungGeneration, Allocate)                              \
   TFC(AllocateInOldGeneration, Allocate)                                       \
-  TFC(AllocateRegularInOldGeneration, Allocate)                                \
                                                                                \
   TFC(NewHeapNumber, NewHeapNumber)                                            \
                                                                                \
   /* TurboFan support builtins */                                              \
-  TFS(CopyFastSmiOrObjectElements, kObject)                                    \
+  TFS(CopyFastSmiOrObjectElements, NeedsContext::kNo, kObject)                 \
   TFC(GrowFastDoubleElements, GrowArrayElements)                               \
   TFC(GrowFastSmiOrObjectElements, GrowArrayElements)                          \
                                                                                \
@@ -306,16 +318,16 @@ namespace internal {
   TFH(HasIndexedInterceptorIC, LoadWithVector)                                 \
                                                                                \
   /* Microtask helpers */                                                      \
-  TFS(EnqueueMicrotask, kMicrotask)                                            \
+  TFS(EnqueueMicrotask, NeedsContext::kYes, kMicrotask)                        \
   ASM(RunMicrotasksTrampoline, RunMicrotasksEntry)                             \
   TFC(RunMicrotasks, RunMicrotasks)                                            \
                                                                                \
   /* Object property helpers */                                                \
-  TFS(HasProperty, kObject, kKey)                                              \
-  TFS(DeleteProperty, kObject, kKey, kLanguageMode)                            \
+  TFS(HasProperty, NeedsContext::kYes, kObject, kKey)                          \
+  TFS(DeleteProperty, NeedsContext::kYes, kObject, kKey, kLanguageMode)        \
   /* ES #sec-copydataproperties */                                             \
-  TFS(CopyDataProperties, kTarget, kSource)                                    \
-  TFS(SetDataProperties, kTarget, kSource)                                     \
+  TFS(CopyDataProperties, NeedsContext::kYes, kTarget, kSource)                \
+  TFS(SetDataProperties, NeedsContext::kYes, kTarget, kSource)                 \
   TFC(CopyDataPropertiesWithExcludedPropertiesOnStack,                         \
       CopyDataPropertiesWithExcludedPropertiesOnStack)                         \
   TFC(CopyDataPropertiesWithExcludedProperties,                                \
@@ -373,28 +385,28 @@ namespace internal {
   /* ES6 #sec-array.prototype.fill */                                          \
   CPP(ArrayPrototypeFill)                                                      \
   /* ES7 #sec-array.prototype.includes */                                      \
-  TFS(ArrayIncludesSmi, kElements, kSearchElement, kLength, kFromIndex)        \
-  TFS(ArrayIncludesSmiOrObject, kElements, kSearchElement, kLength,            \
-      kFromIndex)                                                              \
-  TFS(ArrayIncludesPackedDoubles, kElements, kSearchElement, kLength,          \
-      kFromIndex)                                                              \
-  TFS(ArrayIncludesHoleyDoubles, kElements, kSearchElement, kLength,           \
-      kFromIndex)                                                              \
+  TFS(ArrayIncludesSmi, NeedsContext::kYes, kElements, kSearchElement,         \
+      kLength, kFromIndex)                                                     \
+  TFS(ArrayIncludesSmiOrObject, NeedsContext::kYes, kElements, kSearchElement, \
+      kLength, kFromIndex)                                                     \
+  TFS(ArrayIncludesPackedDoubles, NeedsContext::kYes, kElements,               \
+      kSearchElement, kLength, kFromIndex)                                     \
+  TFS(ArrayIncludesHoleyDoubles, NeedsContext::kYes, kElements,                \
+      kSearchElement, kLength, kFromIndex)                                     \
   TFJ(ArrayIncludes, kDontAdaptArgumentsSentinel)                              \
   /* ES6 #sec-array.prototype.indexof */                                       \
-  TFS(ArrayIndexOfSmi, kElements, kSearchElement, kLength, kFromIndex)         \
-  TFS(ArrayIndexOfSmiOrObject, kElements, kSearchElement, kLength, kFromIndex) \
-  TFS(ArrayIndexOfPackedDoubles, kElements, kSearchElement, kLength,           \
-      kFromIndex)                                                              \
-  TFS(ArrayIndexOfHoleyDoubles, kElements, kSearchElement, kLength,            \
+  TFS(ArrayIndexOfSmi, NeedsContext::kYes, kElements, kSearchElement, kLength, \
       kFromIndex)                                                              \
+  TFS(ArrayIndexOfSmiOrObject, NeedsContext::kYes, kElements, kSearchElement,  \
+      kLength, kFromIndex)                                                     \
+  TFS(ArrayIndexOfPackedDoubles, NeedsContext::kYes, kElements,                \
+      kSearchElement, kLength, kFromIndex)                                     \
+  TFS(ArrayIndexOfHoleyDoubles, NeedsContext::kYes, kElements, kSearchElement, \
+      kLength, kFromIndex)                                                     \
   TFJ(ArrayIndexOf, kDontAdaptArgumentsSentinel)                               \
   /* ES6 #sec-array.prototype.pop */                                           \
   CPP(ArrayPop)                                                                \
   TFJ(ArrayPrototypePop, kDontAdaptArgumentsSentinel)                          \
-  /* ES6 #sec-array.prototype.group */                                         \
-  CPP(ArrayPrototypeGroup)                                                     \
-  CPP(ArrayPrototypeGroupToMap)                                                \
   /* ES6 #sec-array.prototype.push */                                          \
   CPP(ArrayPush)                                                               \
   TFJ(ArrayPrototypePush, kDontAdaptArgumentsSentinel)                         \
@@ -404,9 +416,9 @@ namespace internal {
   CPP(ArrayUnshift)                                                            \
   CPP(ArrayFromAsync)                                                          \
   /* Support for Array.from and other array-copying idioms */                  \
-  TFS(CloneFastJSArray, kSource)                                               \
-  TFS(CloneFastJSArrayFillingHoles, kSource)                                   \
-  TFS(ExtractFastJSArray, kSource, kBegin, kCount)                             \
+  TFS(CloneFastJSArray, NeedsContext::kYes, kSource)                           \
+  TFS(CloneFastJSArrayFillingHoles, NeedsContext::kYes, kSource)               \
+  TFS(ExtractFastJSArray, NeedsContext::kYes, kSource, kBegin, kCount)         \
   /* ES6 #sec-array.prototype.entries */                                       \
   TFJ(ArrayPrototypeEntries, kJSArgcReceiverSlots, kReceiver)                  \
   /* ES6 #sec-array.prototype.keys */                                          \
@@ -416,9 +428,10 @@ namespace internal {
   /* ES6 #sec-%arrayiteratorprototype%.next */                                 \
   TFJ(ArrayIteratorPrototypeNext, kJSArgcReceiverSlots, kReceiver)             \
   /* https://tc39.github.io/proposal-flatMap/#sec-FlattenIntoArray */          \
-  TFS(FlattenIntoArray, kTarget, kSource, kSourceLength, kStart, kDepth)       \
-  TFS(FlatMapIntoArray, kTarget, kSource, kSourceLength, kStart, kDepth,       \
-      kMapperFunction, kThisArg)                                               \
+  TFS(FlattenIntoArray, NeedsContext::kYes, kTarget, kSource, kSourceLength,   \
+      kStart, kDepth)                                                          \
+  TFS(FlatMapIntoArray, NeedsContext::kYes, kTarget, kSource, kSourceLength,   \
+      kStart, kDepth, kMapperFunction, kThisArg)                               \
   /* https://tc39.github.io/proposal-flatMap/#sec-Array.prototype.flat */      \
   TFJ(ArrayPrototypeFlat, kDontAdaptArgumentsSentinel)                         \
   /* https://tc39.github.io/proposal-flatMap/#sec-Array.prototype.flatMap */   \
@@ -436,12 +449,14 @@ namespace internal {
   CPP(ArrayBufferPrototypeTransferToFixedLength)                               \
                                                                                \
   /* AsyncFunction */                                                          \
-  TFS(AsyncFunctionEnter, kClosure, kReceiver)                                 \
-  TFS(AsyncFunctionReject, kAsyncFunctionObject, kReason)                      \
-  TFS(AsyncFunctionResolve, kAsyncFunctionObject, kValue)                      \
+  TFS(AsyncFunctionEnter, NeedsContext::kYes, kClosure, kReceiver)             \
+  TFS(AsyncFunctionReject, NeedsContext::kYes, kAsyncFunctionObject, kReason)  \
+  TFS(AsyncFunctionResolve, NeedsContext::kYes, kAsyncFunctionObject, kValue)  \
   TFC(AsyncFunctionLazyDeoptContinuation, AsyncFunctionStackParameter)         \
-  TFS(AsyncFunctionAwaitCaught, kAsyncFunctionObject, kValue)                  \
-  TFS(AsyncFunctionAwaitUncaught, kAsyncFunctionObject, kValue)                \
+  TFS(AsyncFunctionAwaitCaught, NeedsContext::kYes, kAsyncFunctionObject,      \
+      kValue)                                                                  \
+  TFS(AsyncFunctionAwaitUncaught, NeedsContext::kYes, kAsyncFunctionObject,    \
+      kValue)                                                                  \
   TFJ(AsyncFunctionAwaitRejectClosure, kJSArgcReceiverSlots + 1, kReceiver,    \
       kSentError)                                                              \
   TFJ(AsyncFunctionAwaitResolveClosure, kJSArgcReceiverSlots + 1, kReceiver,   \
@@ -592,10 +607,10 @@ namespace internal {
   CPP(FunctionPrototypeToString)                                               \
                                                                                \
   /* Belongs to Objects but is a dependency of GeneratorPrototypeResume */     \
-  TFS(CreateIterResultObject, kValue, kDone)                                   \
+  TFS(CreateIterResultObject, NeedsContext::kYes, kValue, kDone)               \
                                                                                \
   /* Generator and Async */                                                    \
-  TFS(CreateGeneratorObject, kClosure, kReceiver)                              \
+  TFS(CreateGeneratorObject, NeedsContext::kYes, kClosure, kReceiver)          \
   CPP(GeneratorFunctionConstructor)                                            \
   /* ES6 #sec-generator.prototype.next */                                      \
   TFJ(GeneratorPrototypeNext, kDontAdaptArgumentsSentinel)                     \
@@ -688,18 +703,20 @@ namespace internal {
                                                                                \
   /* IterableToList */                                                         \
   /* ES #sec-iterabletolist */                                                 \
-  TFS(IterableToList, kIterable, kIteratorFn)                                  \
-  TFS(IterableToFixedArray, kIterable, kIteratorFn)                            \
-  TFS(IterableToListWithSymbolLookup, kIterable)                               \
-  TFS(IterableToFixedArrayWithSymbolLookupSlow, kIterable)                     \
-  TFS(IterableToListMayPreserveHoles, kIterable, kIteratorFn)                  \
-  IF_WASM(TFS, IterableToFixedArrayForWasm, kIterable, kExpectedLength)        \
+  TFS(IterableToList, NeedsContext::kYes, kIterable, kIteratorFn)              \
+  TFS(IterableToFixedArray, NeedsContext::kYes, kIterable, kIteratorFn)        \
+  TFS(IterableToListWithSymbolLookup, NeedsContext::kYes, kIterable)           \
+  TFS(IterableToFixedArrayWithSymbolLookupSlow, NeedsContext::kYes, kIterable) \
+  TFS(IterableToListMayPreserveHoles, NeedsContext::kYes, kIterable,           \
+      kIteratorFn)                                                             \
+  IF_WASM(TFS, IterableToFixedArrayForWasm, NeedsContext::kYes, kIterable,     \
+          kExpectedLength)                                                     \
                                                                                \
   /* #sec-createstringlistfromiterable */                                      \
-  TFS(StringListFromIterable, kIterable)                                       \
+  TFS(StringListFromIterable, NeedsContext::kYes, kIterable)                   \
                                                                                \
   /* Map */                                                                    \
-  TFS(FindOrderedHashMapEntry, kTable, kKey)                                   \
+  TFS(FindOrderedHashMapEntry, NeedsContext::kYes, kTable, kKey)               \
   TFJ(MapConstructor, kDontAdaptArgumentsSentinel)                             \
   TFJ(MapPrototypeSet, kJSArgcReceiverSlots + 2, kReceiver, kKey, kValue)      \
   TFJ(MapPrototypeDelete, kJSArgcReceiverSlots + 1, kReceiver, kKey)           \
@@ -718,7 +735,7 @@ namespace internal {
   TFJ(MapPrototypeValues, kJSArgcReceiverSlots, kReceiver)                     \
   /* ES #sec-%mapiteratorprototype%.next */                                    \
   TFJ(MapIteratorPrototypeNext, kJSArgcReceiverSlots, kReceiver)               \
-  TFS(MapIteratorToList, kSource)                                              \
+  TFS(MapIteratorToList, NeedsContext::kYes, kSource)                          \
                                                                                \
   /* ES #sec-number-constructor */                                             \
   CPP(NumberPrototypeToExponential)                                            \
@@ -823,7 +840,7 @@ namespace internal {
   CPP(ObjectPrototypeGetProto)                                                 \
   CPP(ObjectPrototypeSetProto)                                                 \
   CPP(ObjectSeal)                                                              \
-  TFS(ObjectToString, kReceiver)                                               \
+  TFS(ObjectToString, NeedsContext::kYes, kReceiver)                           \
   TFJ(ObjectValues, kJSArgcReceiverSlots + 1, kReceiver, kObject)              \
                                                                                \
   /* instanceof */                                                             \
@@ -833,9 +850,9 @@ namespace internal {
   TFC(InstanceOf_Baseline, Compare_Baseline)                                   \
                                                                                \
   /* for-in */                                                                 \
-  TFS(ForInEnumerate, kReceiver)                                               \
+  TFS(ForInEnumerate, NeedsContext::kYes, kReceiver)                           \
   TFC(ForInPrepare, ForInPrepare)                                              \
-  TFS(ForInFilter, kKey, kObject)                                              \
+  TFS(ForInFilter, NeedsContext::kYes, kKey, kObject)                          \
                                                                                \
   /* Reflect */                                                                \
   ASM(ReflectApply, JSTrampoline)                                              \
@@ -869,13 +886,15 @@ namespace internal {
   CPP(RegExpRightContextGetter)                                                \
                                                                                \
   /* RegExp helpers */                                                         \
-  TFS(RegExpExecAtom, kRegExp, kString, kLastIndex, kMatchInfo)                \
-  TFS(RegExpExecInternal, kRegExp, kString, kLastIndex, kMatchInfo)            \
+  TFS(RegExpExecAtom, NeedsContext::kYes, kRegExp, kString, kLastIndex,        \
+      kMatchInfo)                                                              \
+  TFS(RegExpExecInternal, NeedsContext::kYes, kRegExp, kString, kLastIndex,    \
+      kMatchInfo)                                                              \
   ASM(RegExpInterpreterTrampoline, CCall)                                      \
   ASM(RegExpExperimentalTrampoline, CCall)                                     \
                                                                                \
   /* Set */                                                                    \
-  TFS(FindOrderedHashSetEntry, kTable, kKey)                                   \
+  TFS(FindOrderedHashSetEntry, NeedsContext::kYes, kTable, kKey)               \
   TFJ(SetConstructor, kDontAdaptArgumentsSentinel)                             \
   TFJ(SetPrototypeHas, kJSArgcReceiverSlots + 1, kReceiver, kKey)              \
   TFJ(SetPrototypeAdd, kJSArgcReceiverSlots + 1, kReceiver, kKey)              \
@@ -891,11 +910,12 @@ namespace internal {
   TFJ(SetPrototypeValues, kJSArgcReceiverSlots, kReceiver)                     \
   /* ES #sec-%setiteratorprototype%.next */                                    \
   TFJ(SetIteratorPrototypeNext, kJSArgcReceiverSlots, kReceiver)               \
-  TFS(SetOrSetIteratorToList, kSource)                                         \
+  TFS(SetOrSetIteratorToList, NeedsContext::kYes, kSource)                     \
                                                                                \
   /* ShadowRealm */                                                            \
   CPP(ShadowRealmConstructor)                                                  \
-  TFS(ShadowRealmGetWrappedValue, kCreationContext, kTargetContext, kValue)    \
+  TFS(ShadowRealmGetWrappedValue, NeedsContext::kYes, kCreationContext,        \
+      kTargetContext, kValue)                                                  \
   CPP(ShadowRealmPrototypeEvaluate)                                            \
   TFJ(ShadowRealmPrototypeImportValue, kJSArgcReceiverSlots + 2, kReceiver,    \
       kSpecifier, kExportName)                                                 \
@@ -916,8 +936,8 @@ namespace internal {
       kIndexOrFieldName, kValue)                                               \
   TFJ(AtomicsExchange, kJSArgcReceiverSlots + 3, kReceiver,                    \
       kArrayOrSharedObject, kIndexOrFieldName, kValue)                         \
-  TFJ(AtomicsCompareExchange, kJSArgcReceiverSlots + 4, kReceiver, kArray,     \
-      kIndex, kOldValue, kNewValue)                                            \
+  TFJ(AtomicsCompareExchange, kJSArgcReceiverSlots + 4, kReceiver,             \
+      kArrayOrSharedObject, kIndexOrFieldName, kOldValue, kNewValue)           \
   TFJ(AtomicsAdd, kJSArgcReceiverSlots + 3, kReceiver, kArray, kIndex, kValue) \
   TFJ(AtomicsSub, kJSArgcReceiverSlots + 3, kReceiver, kArray, kIndex, kValue) \
   TFJ(AtomicsAnd, kJSArgcReceiverSlots + 3, kReceiver, kArray, kIndex, kValue) \
@@ -984,8 +1004,10 @@ namespace internal {
   TFJ(TypedArrayPrototypeMap, kDontAdaptArgumentsSentinel)                     \
                                                                                \
   /* Wasm */                                                                   \
-  IF_WASM(ASM, GenericJSToWasmWrapper, WasmDummy)                              \
-  IF_WASM(ASM, WasmReturnPromiseOnSuspend, WasmDummy)                          \
+  IF_WASM(ASM, JSToWasmWrapperAsm, WasmJSToWasmWrapper)                        \
+  IF_WASM(ASM, WasmReturnPromiseOnSuspendAsm, WasmJSToWasmWrapper)             \
+  IF_WASM(ASM, WasmToJsWrapperAsm, WasmDummy)                                  \
+  IF_WASM(TFC, WasmToJsWrapperCSA, WasmToJSWrapper)                            \
   IF_WASM(ASM, WasmSuspend, WasmSuspend)                                       \
   IF_WASM(ASM, WasmResume, WasmDummy)                                          \
   IF_WASM(ASM, WasmReject, WasmDummy)                                          \
@@ -994,12 +1016,13 @@ namespace internal {
   IF_WASM(ASM, WasmDebugBreak, WasmDummy)                                      \
   IF_WASM(ASM, WasmOnStackReplace, WasmDummy)                                  \
   IF_WASM(TFC, WasmFloat32ToNumber, WasmFloat32ToNumber)                       \
-  IF_WASM(TFC, WasmFloat64ToNumber, WasmFloat64ToNumber)                       \
+  IF_WASM(TFC, WasmFloat64ToNumber, WasmFloat64ToTagged)                       \
+  IF_WASM(TFC, WasmFloat64ToString, WasmFloat64ToTagged)                       \
   IF_WASM(TFC, JSToWasmLazyDeoptContinuation, SingleParameterOnStack)          \
                                                                                \
   /* WeakMap */                                                                \
   TFJ(WeakMapConstructor, kDontAdaptArgumentsSentinel)                         \
-  TFS(WeakMapLookupHashIndex, kTable, kKey)                                    \
+  TFS(WeakMapLookupHashIndex, NeedsContext::kYes, kTable, kKey)                \
   TFJ(WeakMapGet, kJSArgcReceiverSlots + 1, kReceiver, kKey)                   \
   TFJ(WeakMapPrototypeHas, kJSArgcReceiverSlots + 1, kReceiver, kKey)          \
   TFJ(WeakMapPrototypeSet, kJSArgcReceiverSlots + 2, kReceiver, kKey, kValue)  \
@@ -1012,27 +1035,33 @@ namespace internal {
   TFJ(WeakSetPrototypeDelete, kJSArgcReceiverSlots + 1, kReceiver, kValue)     \
                                                                                \
   /* WeakSet / WeakMap Helpers */                                              \
-  TFS(WeakCollectionDelete, kCollection, kKey)                                 \
-  TFS(WeakCollectionSet, kCollection, kKey, kValue)                            \
+  TFS(WeakCollectionDelete, NeedsContext::kYes, kCollection, kKey)             \
+  TFS(WeakCollectionSet, NeedsContext::kYes, kCollection, kKey, kValue)        \
                                                                                \
   /* JS Structs and friends */                                                 \
+  CPP(SharedSpaceJSObjectHasInstance)                                          \
   CPP(SharedStructTypeConstructor)                                             \
+  CPP(SharedStructTypeIsSharedStruct)                                          \
   CPP(SharedStructConstructor)                                                 \
   CPP(SharedArrayConstructor)                                                  \
+  CPP(SharedArrayIsSharedArray)                                                \
   CPP(AtomicsMutexConstructor)                                                 \
+  CPP(AtomicsMutexIsMutex)                                                     \
   CPP(AtomicsMutexLock)                                                        \
   CPP(AtomicsMutexTryLock)                                                     \
   CPP(AtomicsConditionConstructor)                                             \
+  CPP(AtomicsConditionIsCondition)                                             \
   CPP(AtomicsConditionWait)                                                    \
   CPP(AtomicsConditionNotify)                                                  \
                                                                                \
   /* AsyncGenerator */                                                         \
                                                                                \
-  TFS(AsyncGeneratorResolve, kGenerator, kValue, kDone)                        \
-  TFS(AsyncGeneratorReject, kGenerator, kValue)                                \
-  TFS(AsyncGeneratorYieldWithAwait, kGenerator, kValue, kIsCaught)             \
-  TFS(AsyncGeneratorReturn, kGenerator, kValue, kIsCaught)                     \
-  TFS(AsyncGeneratorResumeNext, kGenerator)                                    \
+  TFS(AsyncGeneratorResolve, NeedsContext::kYes, kGenerator, kValue, kDone)    \
+  TFS(AsyncGeneratorReject, NeedsContext::kYes, kGenerator, kValue)            \
+  TFS(AsyncGeneratorYieldWithAwait, NeedsContext::kYes, kGenerator, kValue,    \
+      kIsCaught)                                                               \
+  TFS(AsyncGeneratorReturn, NeedsContext::kYes, kGenerator, kValue, kIsCaught) \
+  TFS(AsyncGeneratorResumeNext, NeedsContext::kYes, kGenerator)                \
                                                                                \
   /* AsyncGeneratorFunction( p1, p2, ... pn, body ) */                         \
   /* proposal-async-iteration/#sec-asyncgeneratorfunction-constructor */       \
@@ -1049,8 +1078,10 @@ namespace internal {
                                                                                \
   /* Await (proposal-async-iteration/#await), with resume behaviour */         \
   /* specific to Async Generators. Internal / Not exposed to JS code. */       \
-  TFS(AsyncGeneratorAwaitCaught, kAsyncGeneratorObject, kValue)                \
-  TFS(AsyncGeneratorAwaitUncaught, kAsyncGeneratorObject, kValue)              \
+  TFS(AsyncGeneratorAwaitCaught, NeedsContext::kYes, kAsyncGeneratorObject,    \
+      kValue)                                                                  \
+  TFS(AsyncGeneratorAwaitUncaught, NeedsContext::kYes, kAsyncGeneratorObject,  \
+      kValue)                                                                  \
   TFJ(AsyncGeneratorAwaitResolveClosure, kJSArgcReceiverSlots + 1, kReceiver,  \
       kValue)                                                                  \
   TFJ(AsyncGeneratorAwaitRejectClosure, kJSArgcReceiverSlots + 1, kReceiver,   \
@@ -1084,24 +1115,26 @@ namespace internal {
   ASM(CEntry_Return2_ArgvInRegister_NoBuiltinExit, CEntryDummy)                \
   ASM(CEntry_Return2_ArgvOnStack_BuiltinExit, CEntryDummy)                     \
   ASM(CEntry_Return2_ArgvOnStack_NoBuiltinExit, CEntryDummy)                   \
+  ASM(WasmCEntry, CEntryDummy)                                                 \
   ASM(DirectCEntry, CEntryDummy)                                               \
                                                                                \
   /* String helpers */                                                         \
-  TFS(StringAdd_CheckNone, kLeft, kRight)                                      \
-  TFS(SubString, kString, kFrom, kTo)                                          \
+  TFS(StringAdd_CheckNone, NeedsContext::kYes, kLeft, kRight)                  \
+  TFS(SubString, NeedsContext::kYes, kString, kFrom, kTo)                      \
                                                                                \
   /* Miscellaneous */                                                          \
   ASM(DoubleToI, Void)                                                         \
   TFC(GetProperty, GetProperty)                                                \
-  TFS(GetPropertyWithReceiver, kObject, kKey, kReceiver, kOnNonExistent)       \
-  TFS(SetProperty, kReceiver, kKey, kValue)                                    \
-  TFS(CreateDataProperty, kReceiver, kKey, kValue)                             \
-  TFS(GetOwnPropertyDescriptor, kReceiver, kKey)                               \
+  TFS(GetPropertyWithReceiver, NeedsContext::kYes, kObject, kKey, kReceiver,   \
+      kOnNonExistent)                                                          \
+  TFS(SetProperty, NeedsContext::kYes, kReceiver, kKey, kValue)                \
+  TFS(CreateDataProperty, NeedsContext::kYes, kReceiver, kKey, kValue)         \
+  TFS(GetOwnPropertyDescriptor, NeedsContext::kYes, kReceiver, kKey)           \
   ASM(MemCopyUint8Uint8, CCall)                                                \
   ASM(MemMove, CCall)                                                          \
   TFC(FindNonDefaultConstructorOrConstruct,                                    \
       FindNonDefaultConstructorOrConstruct)                                    \
-  TFS(OrdinaryGetOwnPropertyDescriptor, kReceiver, kKey)                       \
+  TFS(OrdinaryGetOwnPropertyDescriptor, NeedsContext::kYes, kReceiver, kKey)   \
                                                                                \
   /* Trace */                                                                  \
   CPP(IsTraceCategoryEnabled)                                                  \
@@ -1795,6 +1828,20 @@ namespace internal {
   CPP(LocalePrototypeCollation)                                        \
   /* ecma402 #sec-Intl.Locale.prototype.collations */                  \
   CPP(LocalePrototypeCollations)                                       \
+  /* ecma402 #sec-Intl.Locale.prototype.getCalendars */                \
+  CPP(LocalePrototypeGetCalendars)                                     \
+  /* ecma402 #sec-Intl.Locale.prototype.getCollations */               \
+  CPP(LocalePrototypeGetCollations)                                    \
+  /* ecma402 #sec-Intl.Locale.prototype.getHourCycles */               \
+  CPP(LocalePrototypeGetHourCycles)                                    \
+  /* ecma402 #sec-Intl.Locale.prototype.getNumberingSystems */         \
+  CPP(LocalePrototypeGetNumberingSystems)                              \
+  /* ecma402 #sec-Intl.Locale.prototype.getTimeZones */                \
+  CPP(LocalePrototypeGetTimeZones)                                     \
+  /* ecma402 #sec-Intl.Locale.prototype.getTextInfo */                 \
+  CPP(LocalePrototypeGetTextInfo)                                      \
+  /* ecma402 #sec-Intl.Locale.prototype.getWeekInfo */                 \
+  CPP(LocalePrototypeGetWeekInfo)                                      \
   /* ecma402 #sec-Intl.Locale.prototype.hourCycle */                   \
   CPP(LocalePrototypeHourCycle)                                        \
   /* ecma402 #sec-Intl.Locale.prototype.hourCycles */                  \
@@ -1883,7 +1930,7 @@ namespace internal {
   TFJ(StringPrototypeToLowerCaseIntl, kJSArgcReceiverSlots, kReceiver) \
   /* ES #sec-string.prototype.touppercase */                           \
   CPP(StringPrototypeToUpperCaseIntl)                                  \
-  TFS(StringToLowerCaseIntl, kString)                                  \
+  TFS(StringToLowerCaseIntl, NeedsContext::kYes, kString)              \
                                                                        \
   /* Temporal */                                                       \
   /* Temporal #sec-temporal.calendar.prototype.era */                  \
diff --git a/deps/v8/src/builtins/builtins-error.cc b/deps/v8/src/builtins/builtins-error.cc
index 14c06022a9ecca..649551aa4c75f3 100644
--- a/deps/v8/src/builtins/builtins-error.cc
+++ b/deps/v8/src/builtins/builtins-error.cc
@@ -31,37 +31,18 @@ BUILTIN(ErrorCaptureStackTrace) {
 
   isolate->CountUsage(v8::Isolate::kErrorCaptureStackTrace);
 
-  if (!object_obj->IsJSObject()) {
+  if (!IsJSObject(*object_obj)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kInvalidArgument, object_obj));
   }
-  if (object_obj->IsJSGlobalProxy()) {
-    return ReadOnlyRoots(isolate).undefined_value();
-  }
 
   Handle<JSObject> object = Handle<JSObject>::cast(object_obj);
   Handle<Object> caller = args.atOrUndefined(isolate, 2);
-  FrameSkipMode mode = caller->IsJSFunction() ? SKIP_UNTIL_SEEN : SKIP_FIRST;
-
-  // Collect the stack trace.
-
-  RETURN_FAILURE_ON_EXCEPTION(
-      isolate, isolate->CaptureAndSetErrorStack(object, mode, caller));
-
-  // Add the stack accessors.
-
-  Handle<AccessorInfo> error_stack = isolate->factory()->error_stack_accessor();
-  Handle<Name> name(Name::cast(error_stack->name()), isolate);
-
-  // Explicitly check for frozen objects. Other access checks are performed by
-  // the LookupIterator in SetAccessor below.
-  if (!JSObject::IsExtensible(isolate, object)) {
-    return isolate->Throw(*isolate->factory()->NewTypeError(
-        MessageTemplate::kDefineDisallowed, name));
-  }
+  FrameSkipMode mode = IsJSFunction(*caller) ? SKIP_UNTIL_SEEN : SKIP_FIRST;
 
+  // Collect the stack trace and install the stack accessors.
   RETURN_FAILURE_ON_EXCEPTION(
-      isolate, JSObject::SetAccessor(object, name, error_stack, DONT_ENUM));
+      isolate, ErrorUtils::CaptureStackTrace(isolate, object, mode, caller));
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
diff --git a/deps/v8/src/builtins/builtins-function.cc b/deps/v8/src/builtins/builtins-function.cc
index 84856beba8f305..751b7609358968 100644
--- a/deps/v8/src/builtins/builtins-function.cc
+++ b/deps/v8/src/builtins/builtins-function.cc
@@ -73,7 +73,7 @@ MaybeHandle<Object> CreateDynamicFunction(Isolate* isolate,
 
   bool is_code_like = true;
   for (int i = 0; i < argc; ++i) {
-    if (!args.at(i + 1)->IsCodeLike(isolate)) {
+    if (!Object::IsCodeLike(*args.at(i + 1), isolate)) {
       is_code_like = false;
       break;
     }
@@ -95,7 +95,7 @@ MaybeHandle<Object> CreateDynamicFunction(Isolate* isolate,
         Execution::Call(isolate, function, target_global_proxy, 0, nullptr),
         Object);
     function = Handle<JSFunction>::cast(result);
-    function->shared().set_name_should_print_as_anonymous(true);
+    function->shared()->set_name_should_print_as_anonymous(true);
   }
 
   // If new.target is equal to target then the function created
@@ -105,7 +105,7 @@ MaybeHandle<Object> CreateDynamicFunction(Isolate* isolate,
   // function has wrong initial map. To fix that we create a new
   // function object with correct initial map.
   Handle<Object> unchecked_new_target = args.new_target();
-  if (!unchecked_new_target->IsUndefined(isolate) &&
+  if (!IsUndefined(*unchecked_new_target, isolate) &&
       !unchecked_new_target.is_identical_to(target)) {
     Handle<JSReceiver> new_target =
         Handle<JSReceiver>::cast(unchecked_new_target);
@@ -150,13 +150,13 @@ BUILTIN(AsyncFunctionConstructor) {
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, maybe_func,
       CreateDynamicFunction(isolate, args, "async function"));
-  if (!maybe_func->IsJSFunction()) return *maybe_func;
+  if (!IsJSFunction(*maybe_func)) return *maybe_func;
 
   // Do not lazily compute eval position for AsyncFunction, as they may not be
   // determined after the function is resumed.
   Handle<JSFunction> func = Handle<JSFunction>::cast(maybe_func);
   Handle<Script> script =
-      handle(Script::cast(func->shared().script()), isolate);
+      handle(Script::cast(func->shared()->script()), isolate);
   int position = Script::GetEvalPosition(isolate, script);
   USE(position);
 
@@ -169,13 +169,13 @@ BUILTIN(AsyncGeneratorFunctionConstructor) {
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, maybe_func,
       CreateDynamicFunction(isolate, args, "async function*"));
-  if (!maybe_func->IsJSFunction()) return *maybe_func;
+  if (!IsJSFunction(*maybe_func)) return *maybe_func;
 
   // Do not lazily compute eval position for AsyncFunction, as they may not be
   // determined after the function is resumed.
   Handle<JSFunction> func = Handle<JSFunction>::cast(maybe_func);
   Handle<Script> script =
-      handle(Script::cast(func->shared().script()), isolate);
+      handle(Script::cast(func->shared()->script()), isolate);
   int position = Script::GetEvalPosition(isolate, script);
   USE(position);
 
@@ -184,10 +184,10 @@ BUILTIN(AsyncGeneratorFunctionConstructor) {
 
 namespace {
 
-Object DoFunctionBind(Isolate* isolate, BuiltinArguments args) {
+Tagged<Object> DoFunctionBind(Isolate* isolate, BuiltinArguments args) {
   HandleScope scope(isolate);
   DCHECK_LE(1, args.length());
-  if (!args.receiver()->IsCallable()) {
+  if (!IsCallable(*args.receiver())) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kFunctionBind));
   }
@@ -226,16 +226,16 @@ BUILTIN(FunctionPrototypeBind) { return DoFunctionBind(isolate, args); }
 BUILTIN(FunctionPrototypeToString) {
   HandleScope scope(isolate);
   Handle<Object> receiver = args.receiver();
-  if (receiver->IsJSBoundFunction()) {
+  if (IsJSBoundFunction(*receiver)) {
     return *JSBoundFunction::ToString(Handle<JSBoundFunction>::cast(receiver));
   }
-  if (receiver->IsJSFunction()) {
+  if (IsJSFunction(*receiver)) {
     return *JSFunction::ToString(Handle<JSFunction>::cast(receiver));
   }
   // With the revised toString behavior, all callable objects are valid
   // receivers for this method.
-  if (receiver->IsJSReceiver() &&
-      JSReceiver::cast(*receiver).map().is_callable()) {
+  if (IsJSReceiver(*receiver) &&
+      JSReceiver::cast(*receiver)->map()->is_callable()) {
     return ReadOnlyRoots(isolate).function_native_code_string();
   }
   THROW_NEW_ERROR_RETURN_FAILURE(
diff --git a/deps/v8/src/builtins/builtins-generator-gen.cc b/deps/v8/src/builtins/builtins-generator-gen.cc
index 751003076d1b95..d8c091889e150d 100644
--- a/deps/v8/src/builtins/builtins-generator-gen.cc
+++ b/deps/v8/src/builtins/builtins-generator-gen.cc
@@ -227,7 +227,7 @@ TF_BUILTIN(SuspendGeneratorBaseline, GeneratorBuiltinsAssembler) {
   TNode<FixedArray> parameters_and_registers =
       LoadJSGeneratorObjectParametersAndRegisters(generator);
   auto parameters_and_registers_length =
-      SmiUntag(LoadFixedArrayBaseLength(parameters_and_registers));
+      LoadAndUntagFixedArrayBaseLength(parameters_and_registers);
 
   // Copy over the function parameters
   auto parameter_base_index = IntPtrConstant(
@@ -289,7 +289,7 @@ TF_BUILTIN(ResumeGeneratorBaseline, GeneratorBuiltinsAssembler) {
   auto register_count = UncheckedParameter<IntPtrT>(Descriptor::kRegisterCount);
   auto end_index = IntPtrAdd(formal_parameter_count, register_count);
   auto parameters_and_registers_length =
-      SmiUntag(LoadFixedArrayBaseLength(parameters_and_registers));
+      LoadAndUntagFixedArrayBaseLength(parameters_and_registers);
   CSA_CHECK(this, UintPtrLessThan(end_index, parameters_and_registers_length));
   auto parent_frame_pointer = LoadParentFramePointer();
   BuildFastLoop<IntPtrT>(
diff --git a/deps/v8/src/builtins/builtins-internal-gen.cc b/deps/v8/src/builtins/builtins-internal-gen.cc
index bbe9a22e5bf902..9a35975fa9279d 100644
--- a/deps/v8/src/builtins/builtins-internal-gen.cc
+++ b/deps/v8/src/builtins/builtins-internal-gen.cc
@@ -8,7 +8,7 @@
 #include "src/builtins/builtins.h"
 #include "src/codegen/code-stub-assembler.h"
 #include "src/codegen/interface-descriptors-inl.h"
-#include "src/codegen/macro-assembler.h"
+#include "src/codegen/macro-assembler-inl.h"
 #include "src/common/globals.h"
 #include "src/execution/frame-constants.h"
 #include "src/heap/memory-chunk.h"
@@ -82,25 +82,20 @@ TF_BUILTIN(DebugBreakTrampoline, CodeStubAssembler) {
   auto function = Parameter<JSFunction>(Descriptor::kJSTarget);
 
   // Check break-at-entry flag on the debug info.
+  TNode<ExternalReference> f =
+      ExternalConstant(ExternalReference::debug_break_at_entry_function());
+  TNode<ExternalReference> isolate_ptr =
+      ExternalConstant(ExternalReference::isolate_address(isolate()));
   TNode<SharedFunctionInfo> shared =
       CAST(LoadObjectField(function, JSFunction::kSharedFunctionInfoOffset));
-  TNode<Object> maybe_heap_object_or_smi =
-      LoadObjectField(shared, SharedFunctionInfo::kScriptOrDebugInfoOffset);
-  TNode<HeapObject> maybe_debug_info =
-      TaggedToHeapObject(maybe_heap_object_or_smi, &tailcall_to_shared);
-  GotoIfNot(HasInstanceType(maybe_debug_info, InstanceType::DEBUG_INFO_TYPE),
-            &tailcall_to_shared);
+  TNode<IntPtrT> result = UncheckedCast<IntPtrT>(
+      CallCFunction(f, MachineType::UintPtr(),
+                    std::make_pair(MachineType::Pointer(), isolate_ptr),
+                    std::make_pair(MachineType::TaggedPointer(), shared)));
+  GotoIf(IntPtrEqual(result, IntPtrConstant(0)), &tailcall_to_shared);
 
-  {
-    TNode<DebugInfo> debug_info = CAST(maybe_debug_info);
-    TNode<Smi> flags =
-        CAST(LoadObjectField(debug_info, DebugInfo::kFlagsOffset));
-    GotoIfNot(SmiToInt32(SmiAnd(flags, SmiConstant(DebugInfo::kBreakAtEntry))),
-              &tailcall_to_shared);
-
-    CallRuntime(Runtime::kDebugBreakAtEntry, context, function);
-    Goto(&tailcall_to_shared);
-  }
+  CallRuntime(Runtime::kDebugBreakAtEntry, context, function);
+  Goto(&tailcall_to_shared);
 
   BIND(&tailcall_to_shared);
   // Tail call into code object on the SharedFunctionInfo.
@@ -154,9 +149,8 @@ class WriteBarrierCodeStubAssembler : public CodeStubAssembler {
     TNode<IntPtrT> cell;
     TNode<IntPtrT> mask;
     GetMarkBit(object, &cell, &mask);
-    TNode<Int32T> mask32 = TruncateIntPtrToInt32(mask);
     // Marked only requires checking a single bit here.
-    return Word32Equal(Word32And(Load<Int32T>(cell), mask32), Int32Constant(0));
+    return WordEqual(WordAnd(Load<IntPtrT>(cell), mask), IntPtrConstant(0));
   }
 
   void GetMarkBit(TNode<IntPtrT> object, TNode<IntPtrT>* cell,
@@ -168,18 +162,19 @@ class WriteBarrierCodeStubAssembler : public CodeStubAssembler {
     {
       // Temp variable to calculate cell offset in bitmap.
       TNode<WordT> r0;
-      int shift = Bitmap::kBitsPerCellLog2 + kTaggedSizeLog2 -
-                  Bitmap::kBytesPerCellLog2;
+      int shift = MarkingBitmap::kBitsPerCellLog2 + kTaggedSizeLog2 -
+                  MarkingBitmap::kBytesPerCellLog2;
       r0 = WordShr(object, IntPtrConstant(shift));
       r0 = WordAnd(r0, IntPtrConstant((kPageAlignmentMask >> shift) &
-                                      ~(Bitmap::kBytesPerCell - 1)));
+                                      ~(MarkingBitmap::kBytesPerCell - 1)));
       *cell = IntPtrAdd(bitmap, Signed(r0));
     }
     {
       // Temp variable to calculate bit offset in cell.
       TNode<WordT> r1;
       r1 = WordShr(object, IntPtrConstant(kTaggedSizeLog2));
-      r1 = WordAnd(r1, IntPtrConstant((1 << Bitmap::kBitsPerCellLog2) - 1));
+      r1 = WordAnd(r1,
+                   IntPtrConstant((1 << MarkingBitmap::kBitsPerCellLog2) - 1));
       // It seems that LSB(e.g. cl) is automatically used, so no manual masking
       // is needed. Uncomment the following line otherwise.
       // WordAnd(r1, IntPtrConstant((1 << kBitsPerByte) - 1)));
@@ -275,6 +270,35 @@ class WriteBarrierCodeStubAssembler : public CodeStubAssembler {
     BIND(&next);
   }
 
+  void PointerTableWriteBarrier(SaveFPRegsMode fp_mode) {
+    // Currently, only objects living in (local) old space are referenced
+    // through a pointer table indirection and we have DCHECKs in the CPP write
+    // barrier code to check that. This simplifies the write barrier code for
+    // these cases.
+    Label marking_is_on(this), next(this);
+    Branch(IsMarking(), &marking_is_on, &next);
+
+    BIND(&marking_is_on);
+
+    // For this barrier, the slot contains an index into a pointer table and not
+    // directly a pointer to a HeapObject.
+    TNode<IntPtrT> slot =
+        UncheckedParameter<IntPtrT>(WriteBarrierDescriptor::kSlotAddress);
+    TNode<IntPtrT> object = BitcastTaggedToWord(
+        UncheckedParameter<Object>(WriteBarrierDescriptor::kObject));
+
+    TNode<ExternalReference> function = ExternalConstant(
+        ExternalReference::
+            write_barrier_indirect_pointer_marking_from_code_function());
+    CallCFunctionWithCallerSavedRegisters(
+        function, MachineTypeOf<Int32T>::value, fp_mode,
+        std::make_pair(MachineTypeOf<IntPtrT>::value, object),
+        std::make_pair(MachineTypeOf<IntPtrT>::value, slot));
+    Goto(&next);
+
+    BIND(&next);
+  }
+
   void GenerationalOrSharedBarrierSlow(TNode<IntPtrT> slot, Label* next,
                                        SaveFPRegsMode fp_mode) {
     // When incremental marking is not on, the fast and out-of-line fast path of
@@ -531,6 +555,17 @@ class WriteBarrierCodeStubAssembler : public CodeStubAssembler {
     Return(TrueConstant());
   }
 
+  void GenerateIndirectPointerBarrier(SaveFPRegsMode fp_mode) {
+    if (V8_DISABLE_WRITE_BARRIERS_BOOL) {
+      Return(TrueConstant());
+      return;
+    }
+
+    PointerTableWriteBarrier(fp_mode);
+    IncrementCounter(isolate()->counters()->write_barriers(), 1);
+    Return(TrueConstant());
+  }
+
   void GenerateEphemeronKeyBarrier(SaveFPRegsMode fp_mode) {
     TNode<ExternalReference> function = ExternalConstant(
         ExternalReference::ephemeron_key_write_barrier_function());
@@ -564,6 +599,14 @@ TF_BUILTIN(RecordWriteIgnoreFP, WriteBarrierCodeStubAssembler) {
   GenerateRecordWrite(SaveFPRegsMode::kIgnore);
 }
 
+TF_BUILTIN(IndirectPointerBarrierSaveFP, WriteBarrierCodeStubAssembler) {
+  GenerateIndirectPointerBarrier(SaveFPRegsMode::kSave);
+}
+
+TF_BUILTIN(IndirectPointerBarrierIgnoreFP, WriteBarrierCodeStubAssembler) {
+  GenerateIndirectPointerBarrier(SaveFPRegsMode::kIgnore);
+}
+
 TF_BUILTIN(EphemeronKeyBarrierSaveFP, WriteBarrierCodeStubAssembler) {
   GenerateEphemeronKeyBarrier(SaveFPRegsMode::kSave);
 }
@@ -761,7 +804,7 @@ class DeletePropertyBaseAssembler : public AccessorAssembler {
                                 TNode<IntPtrT> key_index,
                                 TNode<Context> context) {
     // Overwrite the entry itself (see NameDictionary::SetEntry).
-    TNode<Oddball> filler = TheHoleConstant();
+    TNode<Hole> filler = TheHoleConstant();
     DCHECK(RootsTable::IsImmortalImmovable(RootIndex::kTheHoleValue));
     StoreFixedArrayElement(properties, key_index, filler, SKIP_WRITE_BARRIER);
     StoreValueByKeyIndex<NameDictionary>(properties, key_index, filler,
@@ -1013,8 +1056,8 @@ class SetOrCopyDataPropertiesAssembler : public CodeStubAssembler {
       // Non-empty strings are the only non-JSReceivers that need to be
       // handled explicitly by Object.assign() and CopyDataProperties.
       GotoIfNot(IsStringInstanceType(source_instance_type), &if_done);
-      TNode<IntPtrT> source_length = LoadStringLengthAsWord(CAST(source));
-      Branch(IntPtrEqual(source_length, IntPtrConstant(0)), &if_done,
+      TNode<Uint32T> source_length = LoadStringLengthAsWord32(CAST(source));
+      Branch(Word32Equal(source_length, Uint32Constant(0)), &if_done,
              if_runtime);
     }
 
@@ -1252,19 +1295,7 @@ TF_BUILTIN(AllocateInYoungGeneration, CodeStubAssembler) {
   CSA_CHECK(this, IsValidPositiveSmi(requested_size));
 
   TNode<Smi> allocation_flags =
-      SmiConstant(Smi::FromInt(AllocateDoubleAlignFlag::encode(false) |
-                               AllowLargeObjectAllocationFlag::encode(true)));
-  TailCallRuntime(Runtime::kAllocateInYoungGeneration, NoContextConstant(),
-                  SmiFromIntPtr(requested_size), allocation_flags);
-}
-
-TF_BUILTIN(AllocateRegularInYoungGeneration, CodeStubAssembler) {
-  auto requested_size = UncheckedParameter<IntPtrT>(Descriptor::kRequestedSize);
-  CSA_CHECK(this, IsValidPositiveSmi(requested_size));
-
-  TNode<Smi> allocation_flags =
-      SmiConstant(Smi::FromInt(AllocateDoubleAlignFlag::encode(false) |
-                               AllowLargeObjectAllocationFlag::encode(false)));
+      SmiConstant(Smi::FromInt(AllocateDoubleAlignFlag::encode(false)));
   TailCallRuntime(Runtime::kAllocateInYoungGeneration, NoContextConstant(),
                   SmiFromIntPtr(requested_size), allocation_flags);
 }
@@ -1274,19 +1305,7 @@ TF_BUILTIN(AllocateInOldGeneration, CodeStubAssembler) {
   CSA_CHECK(this, IsValidPositiveSmi(requested_size));
 
   TNode<Smi> runtime_flags =
-      SmiConstant(Smi::FromInt(AllocateDoubleAlignFlag::encode(false) |
-                               AllowLargeObjectAllocationFlag::encode(true)));
-  TailCallRuntime(Runtime::kAllocateInOldGeneration, NoContextConstant(),
-                  SmiFromIntPtr(requested_size), runtime_flags);
-}
-
-TF_BUILTIN(AllocateRegularInOldGeneration, CodeStubAssembler) {
-  auto requested_size = UncheckedParameter<IntPtrT>(Descriptor::kRequestedSize);
-  CSA_CHECK(this, IsValidPositiveSmi(requested_size));
-
-  TNode<Smi> runtime_flags =
-      SmiConstant(Smi::FromInt(AllocateDoubleAlignFlag::encode(false) |
-                               AllowLargeObjectAllocationFlag::encode(false)));
+      SmiConstant(Smi::FromInt(AllocateDoubleAlignFlag::encode(false)));
   TailCallRuntime(Runtime::kAllocateInOldGeneration, NoContextConstant(),
                   SmiFromIntPtr(requested_size), runtime_flags);
 }
@@ -1303,32 +1322,36 @@ TF_BUILTIN(AbortCSADcheck, CodeStubAssembler) {
 
 void Builtins::Generate_CEntry_Return1_ArgvOnStack_NoBuiltinExit(
     MacroAssembler* masm) {
-  Generate_CEntry(masm, 1, ArgvMode::kStack, false);
+  Generate_CEntry(masm, 1, ArgvMode::kStack, false, false);
 }
 
 void Builtins::Generate_CEntry_Return1_ArgvOnStack_BuiltinExit(
     MacroAssembler* masm) {
-  Generate_CEntry(masm, 1, ArgvMode::kStack, true);
+  Generate_CEntry(masm, 1, ArgvMode::kStack, true, false);
 }
 
 void Builtins::Generate_CEntry_Return1_ArgvInRegister_NoBuiltinExit(
     MacroAssembler* masm) {
-  Generate_CEntry(masm, 1, ArgvMode::kRegister, false);
+  Generate_CEntry(masm, 1, ArgvMode::kRegister, false, false);
 }
 
 void Builtins::Generate_CEntry_Return2_ArgvOnStack_NoBuiltinExit(
     MacroAssembler* masm) {
-  Generate_CEntry(masm, 2, ArgvMode::kStack, false);
+  Generate_CEntry(masm, 2, ArgvMode::kStack, false, false);
 }
 
 void Builtins::Generate_CEntry_Return2_ArgvOnStack_BuiltinExit(
     MacroAssembler* masm) {
-  Generate_CEntry(masm, 2, ArgvMode::kStack, true);
+  Generate_CEntry(masm, 2, ArgvMode::kStack, true, false);
 }
 
 void Builtins::Generate_CEntry_Return2_ArgvInRegister_NoBuiltinExit(
     MacroAssembler* masm) {
-  Generate_CEntry(masm, 2, ArgvMode::kRegister, false);
+  Generate_CEntry(masm, 2, ArgvMode::kRegister, false, false);
+}
+
+void Builtins::Generate_WasmCEntry(MacroAssembler* masm) {
+  Generate_CEntry(masm, 1, ArgvMode::kStack, false, true);
 }
 
 #if !defined(V8_TARGET_ARCH_ARM)
@@ -1373,6 +1396,38 @@ void Builtins::Generate_MaglevOnStackReplacement(MacroAssembler* masm) {
 }
 #endif  // V8_TARGET_ARCH_X64
 
+#ifdef V8_ENABLE_MAGLEV
+void Builtins::Generate_MaglevOptimizeCodeOrTailCallOptimizedCodeSlot(
+    MacroAssembler* masm) {
+  using D = MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor;
+  Register flags = D::GetRegisterParameter(D::kFlags);
+  Register feedback_vector = D::GetRegisterParameter(D::kFeedbackVector);
+  masm->AssertFeedbackVector(feedback_vector);
+  masm->OptimizeCodeOrTailCallOptimizedCodeSlot(flags, feedback_vector);
+  masm->Trap();
+}
+#else
+// static
+void Builtins::Generate_MaglevFunctionEntryStackCheck(MacroAssembler* masm,
+                                                      bool save_new_target) {
+  masm->Trap();
+}
+void Builtins::Generate_MaglevOptimizeCodeOrTailCallOptimizedCodeSlot(
+    MacroAssembler* masm) {
+  masm->Trap();
+}
+#endif  // V8_ENABLE_MAGLEV
+
+void Builtins::Generate_MaglevFunctionEntryStackCheck_WithoutNewTarget(
+    MacroAssembler* masm) {
+  Generate_MaglevFunctionEntryStackCheck(masm, false);
+}
+
+void Builtins::Generate_MaglevFunctionEntryStackCheck_WithNewTarget(
+    MacroAssembler* masm) {
+  Generate_MaglevFunctionEntryStackCheck(masm, true);
+}
+
 // ES6 [[Get]] operation.
 TF_BUILTIN(GetProperty, CodeStubAssembler) {
   auto object = Parameter<Object>(Descriptor::kObject);
@@ -1389,9 +1444,12 @@ TF_BUILTIN(GetProperty, CodeStubAssembler) {
           TNode<Name> unique_name, Label* next_holder, Label* if_bailout) {
         TVARIABLE(Object, var_value);
         Label if_found(this);
+        // If we get here then it's guaranteed that |object| (and thus the
+        // |receiver|) is a JSReceiver.
         TryGetOwnProperty(context, receiver, CAST(holder), holder_map,
                           holder_instance_type, unique_name, &if_found,
-                          &var_value, next_holder, if_bailout);
+                          &var_value, next_holder, if_bailout,
+                          kExpectingJSReceiver);
         BIND(&if_found);
         Return(var_value.value());
       };
@@ -1446,7 +1504,8 @@ TF_BUILTIN(GetPropertyWithReceiver, CodeStubAssembler) {
         Label if_found(this);
         TryGetOwnProperty(context, receiver, CAST(holder), holder_map,
                           holder_instance_type, unique_name, &if_found,
-                          &var_value, next_holder, if_bailout);
+                          &var_value, next_holder, if_bailout,
+                          kExpectingAnyReceiver);
         BIND(&if_found);
         Return(var_value.value());
       };
@@ -1573,9 +1632,8 @@ TF_BUILTIN(FindNonDefaultConstructorOrConstruct, CodeStubAssembler) {
   Label found_default_base_ctor(this, &constructor),
       found_something_else(this, &constructor);
 
-  FindNonDefaultConstructorOrConstruct(context, this_function, constructor,
-                                       &found_default_base_ctor,
-                                       &found_something_else);
+  FindNonDefaultConstructor(this_function, constructor,
+                            &found_default_base_ctor, &found_something_else);
 
   BIND(&found_default_base_ctor);
   {
diff --git a/deps/v8/src/builtins/builtins-intl-gen.cc b/deps/v8/src/builtins/builtins-intl-gen.cc
index 8902662407f1df..81b86b8d892a17 100644
--- a/deps/v8/src/builtins/builtins-intl-gen.cc
+++ b/deps/v8/src/builtins/builtins-intl-gen.cc
@@ -123,8 +123,10 @@ void IntlBuiltinsAssembler::ToLowerCaseImpl(
     Label fast(this), check_locale(this);
     // Check for fast locales.
     GotoIf(IsUndefined(maybe_locales), &fast);
-    // Passing a smi here is equivalent to passing an empty list of locales.
-    GotoIf(TaggedIsSmi(maybe_locales), &fast);
+    // Passing a Smi as locales requires performing a ToObject conversion
+    // followed by reading the length property and the "indexed" properties of
+    // it until a valid locale is found.
+    GotoIf(TaggedIsSmi(maybe_locales), &runtime);
     GotoIfNot(IsString(CAST(maybe_locales)), &runtime);
     GotoIfNot(IsSeqOneByteString(CAST(maybe_locales)), &runtime);
     TNode<SeqOneByteString> locale = CAST(maybe_locales);
diff --git a/deps/v8/src/builtins/builtins-intl.cc b/deps/v8/src/builtins/builtins-intl.cc
index a6815a4afe4c6d..a7b300bad925b1 100644
--- a/deps/v8/src/builtins/builtins-intl.cc
+++ b/deps/v8/src/builtins/builtins-intl.cc
@@ -128,7 +128,7 @@ BUILTIN(DateTimeFormatPrototypeFormatToParts) {
   CHECK_RECEIVER(JSObject, date_format_holder, method_name);
   Factory* factory = isolate->factory();
 
-  if (!date_format_holder->IsJSDateTimeFormat()) {
+  if (!IsJSDateTimeFormat(*date_format_holder)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kIncompatibleMethodReceiver,
                               factory->NewStringFromAsciiChecked(method_name),
@@ -146,7 +146,7 @@ BUILTIN(DateTimeFormatPrototypeFormatToParts) {
 template <class T, MaybeHandle<T> (*F)(Isolate*, Handle<JSDateTimeFormat>,
                                        Handle<Object>, Handle<Object>,
                                        const char* const)>
-V8_WARN_UNUSED_RESULT Object DateTimeFormatRange(
+V8_WARN_UNUSED_RESULT Tagged<Object> DateTimeFormatRange(
     BuiltinArguments args, Isolate* isolate, const char* const method_name) {
   // 1. Let dtf be this value.
   // 2. Perform ? RequireInternalSlot(dtf, [[InitializedDateTimeFormat]]).
@@ -156,7 +156,7 @@ V8_WARN_UNUSED_RESULT Object DateTimeFormatRange(
   // exception.
   Handle<Object> start_date = args.atOrUndefined(isolate, 1);
   Handle<Object> end_date = args.atOrUndefined(isolate, 2);
-  if (start_date->IsUndefined(isolate) || end_date->IsUndefined(isolate)) {
+  if (IsUndefined(*start_date, isolate) || IsUndefined(*end_date, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kInvalidTimeValue));
   }
@@ -188,7 +188,7 @@ namespace {
 Handle<JSFunction> CreateBoundFunction(Isolate* isolate,
                                        Handle<JSObject> object, Builtin builtin,
                                        int len) {
-  Handle<NativeContext> native_context(isolate->context().native_context(),
+  Handle<NativeContext> native_context(isolate->context()->native_context(),
                                        isolate);
   Handle<Context> context = isolate->factory()->NewBuiltinContext(
       native_context,
@@ -214,15 +214,15 @@ Handle<JSFunction> CreateBoundFunction(Isolate* isolate,
  * NumberFormatConstrutor
  */
 template <class T>
-Object LegacyFormatConstructor(BuiltinArguments args, Isolate* isolate,
-                               v8::Isolate::UseCounterFeature feature,
-                               Handle<Object> constructor,
-                               const char* method_name) {
+Tagged<Object> LegacyFormatConstructor(BuiltinArguments args, Isolate* isolate,
+                                       v8::Isolate::UseCounterFeature feature,
+                                       Handle<Object> constructor,
+                                       const char* method_name) {
   isolate->CountUsage(feature);
   Handle<JSReceiver> new_target;
   // 1. If NewTarget is undefined, let newTarget be the active
   // function object, else let newTarget be NewTarget.
-  if (args.new_target()->IsUndefined(isolate)) {
+  if (IsUndefined(*args.new_target(), isolate)) {
     new_target = args.target();
   } else {
     new_target = Handle<JSReceiver>::cast(args.new_target());
@@ -244,7 +244,7 @@ Object LegacyFormatConstructor(BuiltinArguments args, Isolate* isolate,
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, format, T::New(isolate, map, locales, options, method_name));
   // 4. Let this be the this value.
-  if (args.new_target()->IsUndefined(isolate)) {
+  if (IsUndefined(*args.new_target(), isolate)) {
     Handle<Object> receiver = args.receiver();
     // 5. If NewTarget is undefined and ? OrdinaryHasInstance(%<T>%, this)
     // is true, then Look up the intrinsic value that has been stored on
@@ -253,8 +253,8 @@ Object LegacyFormatConstructor(BuiltinArguments args, Isolate* isolate,
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
         isolate, ordinary_has_instance_obj,
         Object::OrdinaryHasInstance(isolate, constructor, receiver));
-    if (ordinary_has_instance_obj->BooleanValue(isolate)) {
-      if (!receiver->IsJSReceiver()) {
+    if (Object::BooleanValue(*ordinary_has_instance_obj, isolate)) {
+      if (!IsJSReceiver(*receiver)) {
         THROW_NEW_ERROR_RETURN_FAILURE(
             isolate, NewTypeError(MessageTemplate::kIncompatibleMethodReceiver,
                                   isolate->factory()->NewStringFromAsciiChecked(
@@ -288,13 +288,13 @@ Object LegacyFormatConstructor(BuiltinArguments args, Isolate* isolate,
  * Segmenter
  */
 template <class T>
-Object DisallowCallConstructor(BuiltinArguments args, Isolate* isolate,
-                               v8::Isolate::UseCounterFeature feature,
-                               const char* method_name) {
+Tagged<Object> DisallowCallConstructor(BuiltinArguments args, Isolate* isolate,
+                                       v8::Isolate::UseCounterFeature feature,
+                                       const char* method_name) {
   isolate->CountUsage(feature);
 
   // 1. If NewTarget is undefined, throw a TypeError exception.
-  if (args.new_target()->IsUndefined(isolate)) {  // [[Call]]
+  if (IsUndefined(*args.new_target(), isolate)) {  // [[Call]]
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kConstructorNotFunction,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -321,11 +321,12 @@ Object DisallowCallConstructor(BuiltinArguments args, Isolate* isolate,
  * Common code shared by Collator and V8BreakIterator
  */
 template <class T>
-Object CallOrConstructConstructor(BuiltinArguments args, Isolate* isolate,
-                                  const char* method_name) {
+Tagged<Object> CallOrConstructConstructor(BuiltinArguments args,
+                                          Isolate* isolate,
+                                          const char* method_name) {
   Handle<JSReceiver> new_target;
 
-  if (args.new_target()->IsUndefined(isolate)) {
+  if (IsUndefined(*args.new_target(), isolate)) {
     new_target = args.target();
   } else {
     new_target = Handle<JSReceiver>::cast(args.new_target());
@@ -473,8 +474,8 @@ BUILTIN(NumberFormatPrototypeFormatNumber) {
   Handle<Object> bound_format(number_format->bound_format(), isolate);
 
   // 4. If nf.[[BoundFormat]] is undefined, then
-  if (!bound_format->IsUndefined(isolate)) {
-    DCHECK(bound_format->IsJSFunction());
+  if (!IsUndefined(*bound_format, isolate)) {
+    DCHECK(IsJSFunction(*bound_format));
     // 5. Return nf.[[BoundFormat]].
     return *bound_format;
   }
@@ -512,9 +513,8 @@ BUILTIN(NumberFormatInternalFormatNumber) {
 // Common code for NumberFormatPrototypeFormtRange(|ToParts)
 template <class T, MaybeHandle<T> (*F)(Isolate*, Handle<JSNumberFormat>,
                                        Handle<Object>, Handle<Object>)>
-V8_WARN_UNUSED_RESULT Object NumberFormatRange(BuiltinArguments args,
-                                               Isolate* isolate,
-                                               const char* const method_name) {
+V8_WARN_UNUSED_RESULT Tagged<Object> NumberFormatRange(
+    BuiltinArguments args, Isolate* isolate, const char* const method_name) {
   // 1. Let nf be this value.
   // 2. Perform ? RequireInternalSlot(nf, [[InitializedNumberFormat]]).
   CHECK_RECEIVER(JSNumberFormat, nf, method_name);
@@ -524,13 +524,13 @@ V8_WARN_UNUSED_RESULT Object NumberFormatRange(BuiltinArguments args,
 
   Factory* factory = isolate->factory();
   // 3. If start is undefined or end is undefined, throw a TypeError exception.
-  if (start->IsUndefined(isolate)) {
+  if (IsUndefined(*start, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
         NewTypeError(MessageTemplate::kInvalid,
                      factory->NewStringFromStaticChars("start"), start));
   }
-  if (end->IsUndefined(isolate)) {
+  if (IsUndefined(*end, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kInvalid,
                               factory->NewStringFromStaticChars("end"), end));
@@ -579,8 +579,8 @@ BUILTIN(DateTimeFormatPrototypeFormat) {
   Handle<Object> bound_format = Handle<Object>(format->bound_format(), isolate);
 
   // 4. If dtf.[[BoundFormat]] is undefined, then
-  if (!bound_format->IsUndefined(isolate)) {
-    DCHECK(bound_format->IsJSFunction());
+  if (!IsUndefined(*bound_format, isolate)) {
+    DCHECK(IsJSFunction(*bound_format));
     // 5. Return dtf.[[BoundFormat]].
     return *bound_format;
   }
@@ -662,7 +662,7 @@ BUILTIN(LocaleConstructor) {
   isolate->CountUsage(v8::Isolate::UseCounterFeature::kLocale);
 
   const char* method_name = "Intl.Locale";
-  if (args.new_target()->IsUndefined(isolate)) {  // [[Call]]
+  if (IsUndefined(*args.new_target(), isolate)) {  // [[Call]]
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kConstructorNotFunction,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -682,7 +682,7 @@ BUILTIN(LocaleConstructor) {
       isolate, map, JSFunction::GetDerivedMap(isolate, target, new_target));
 
   // 7. If Type(tag) is not String or Object, throw a TypeError exception.
-  if (!tag->IsString() && !tag->IsJSReceiver()) {
+  if (!IsString(*tag) && !IsJSReceiver(*tag)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kLocaleNotEmpty));
   }
@@ -690,7 +690,7 @@ BUILTIN(LocaleConstructor) {
   Handle<String> locale_string;
   // 8. If Type(tag) is Object and tag has an [[InitializedLocale]] internal
   // slot, then
-  if (tag->IsJSLocale()) {
+  if (IsJSLocale(*tag)) {
     // a. Let tag be tag.[[Locale]].
     locale_string = JSLocale::ToString(isolate, Handle<JSLocale>::cast(tag));
   } else {  // 9. Else,
@@ -721,47 +721,111 @@ BUILTIN(LocalePrototypeMinimize) {
   RETURN_RESULT_OR_FAILURE(isolate, JSLocale::Minimize(isolate, locale));
 }
 
+BUILTIN(LocalePrototypeGetCalendars) {
+  HandleScope scope(isolate);
+  isolate->CountUsage(v8::Isolate::UseCounterFeature::kLocaleInfoFunctions);
+  CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.getCalendars");
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetCalendars(isolate, locale));
+}
+
+BUILTIN(LocalePrototypeGetCollations) {
+  HandleScope scope(isolate);
+  isolate->CountUsage(v8::Isolate::UseCounterFeature::kLocaleInfoFunctions);
+  CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.getCollations");
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetCollations(isolate, locale));
+}
+
+BUILTIN(LocalePrototypeGetHourCycles) {
+  HandleScope scope(isolate);
+  isolate->CountUsage(v8::Isolate::UseCounterFeature::kLocaleInfoFunctions);
+  CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.getHourCycles");
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetHourCycles(isolate, locale));
+}
+
+BUILTIN(LocalePrototypeGetNumberingSystems) {
+  HandleScope scope(isolate);
+  isolate->CountUsage(v8::Isolate::UseCounterFeature::kLocaleInfoFunctions);
+  CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.getNumberingSystems");
+  RETURN_RESULT_OR_FAILURE(isolate,
+                           JSLocale::GetNumberingSystems(isolate, locale));
+}
+
+BUILTIN(LocalePrototypeGetTextInfo) {
+  HandleScope scope(isolate);
+  isolate->CountUsage(v8::Isolate::UseCounterFeature::kLocaleInfoFunctions);
+  CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.getTextInfo");
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetTextInfo(isolate, locale));
+}
+
+BUILTIN(LocalePrototypeGetTimeZones) {
+  HandleScope scope(isolate);
+  isolate->CountUsage(v8::Isolate::UseCounterFeature::kLocaleInfoFunctions);
+  CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.getTimeZones");
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetTimeZones(isolate, locale));
+}
+
+BUILTIN(LocalePrototypeGetWeekInfo) {
+  HandleScope scope(isolate);
+  isolate->CountUsage(v8::Isolate::UseCounterFeature::kLocaleInfoFunctions);
+  CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.getWeekInfo");
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetWeekInfo(isolate, locale));
+}
+
 BUILTIN(LocalePrototypeCalendars) {
   HandleScope scope(isolate);
+  isolate->CountUsage(
+      v8::Isolate::UseCounterFeature::kLocaleInfoObsoletedGetters);
   CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.calendars");
-  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::Calendars(isolate, locale));
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetCalendars(isolate, locale));
 }
 
 BUILTIN(LocalePrototypeCollations) {
   HandleScope scope(isolate);
+  isolate->CountUsage(
+      v8::Isolate::UseCounterFeature::kLocaleInfoObsoletedGetters);
   CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.collations");
-  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::Collations(isolate, locale));
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetCollations(isolate, locale));
 }
 
 BUILTIN(LocalePrototypeHourCycles) {
   HandleScope scope(isolate);
+  isolate->CountUsage(
+      v8::Isolate::UseCounterFeature::kLocaleInfoObsoletedGetters);
   CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.hourCycles");
-  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::HourCycles(isolate, locale));
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetHourCycles(isolate, locale));
 }
 
 BUILTIN(LocalePrototypeNumberingSystems) {
   HandleScope scope(isolate);
+  isolate->CountUsage(
+      v8::Isolate::UseCounterFeature::kLocaleInfoObsoletedGetters);
   CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.numberingSystems");
   RETURN_RESULT_OR_FAILURE(isolate,
-                           JSLocale::NumberingSystems(isolate, locale));
+                           JSLocale::GetNumberingSystems(isolate, locale));
 }
 
 BUILTIN(LocalePrototypeTextInfo) {
   HandleScope scope(isolate);
+  isolate->CountUsage(
+      v8::Isolate::UseCounterFeature::kLocaleInfoObsoletedGetters);
   CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.textInfo");
-  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::TextInfo(isolate, locale));
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetTextInfo(isolate, locale));
 }
 
 BUILTIN(LocalePrototypeTimeZones) {
   HandleScope scope(isolate);
+  isolate->CountUsage(
+      v8::Isolate::UseCounterFeature::kLocaleInfoObsoletedGetters);
   CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.timeZones");
-  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::TimeZones(isolate, locale));
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetTimeZones(isolate, locale));
 }
 
 BUILTIN(LocalePrototypeWeekInfo) {
   HandleScope scope(isolate);
+  isolate->CountUsage(
+      v8::Isolate::UseCounterFeature::kLocaleInfoObsoletedGetters);
   CHECK_RECEIVER(JSLocale, locale, "Intl.Locale.prototype.weekInfo");
-  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::WeekInfo(isolate, locale));
+  RETURN_RESULT_OR_FAILURE(isolate, JSLocale::GetWeekInfo(isolate, locale));
 }
 
 BUILTIN(RelativeTimeFormatSupportedLocalesOf) {
@@ -901,19 +965,19 @@ BUILTIN(RelativeTimeFormatPrototypeResolvedOptions) {
   return *JSRelativeTimeFormat::ResolvedOptions(isolate, format_holder);
 }
 
-bool IsFastLocale(Object maybe_locale) {
+bool IsFastLocale(Tagged<Object> maybe_locale) {
   DisallowGarbageCollection no_gc;
-  if (!maybe_locale.IsSeqOneByteString()) {
+  if (!IsSeqOneByteString(maybe_locale)) {
     return false;
   }
   auto locale = SeqOneByteString::cast(maybe_locale);
-  uint8_t* chars = locale.GetChars(no_gc);
-  if (locale.length() < 2 || !std::isalpha(chars[0]) ||
+  uint8_t* chars = locale->GetChars(no_gc);
+  if (locale->length() < 2 || !std::isalpha(chars[0]) ||
       !std::isalpha(chars[1])) {
     return false;
   }
-  if (locale.length() != 2 &&
-      (locale.length() != 5 || chars[2] != '-' || !std::isalpha(chars[3]) ||
+  if (locale->length() != 2 &&
+      (locale->length() != 5 || chars[2] != '-' || !std::isalpha(chars[3]) ||
        !std::isalpha(chars[4]))) {
     return false;
   }
@@ -927,7 +991,7 @@ BUILTIN(StringPrototypeToLocaleUpperCase) {
   HandleScope scope(isolate);
   Handle<Object> maybe_locale = args.atOrUndefined(isolate, 1);
   TO_THIS_STRING(string, "String.prototype.toLocaleUpperCase");
-  if (maybe_locale->IsUndefined() || IsFastLocale(*maybe_locale)) {
+  if (IsUndefined(*maybe_locale) || IsFastLocale(*maybe_locale)) {
     string = String::Flatten(isolate, string);
     RETURN_RESULT_OR_FAILURE(isolate, Intl::ConvertToUpper(isolate, string));
   } else {
@@ -963,7 +1027,7 @@ BUILTIN(PluralRulesPrototypeSelect) {
   Handle<Object> number = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, number,
                                      Object::ToNumber(isolate, number));
-  double number_double = number->Number();
+  double number_double = Object::Number(*number);
 
   // 4. Return ! ResolvePlural(pr, n).
   RETURN_RESULT_OR_FAILURE(isolate, JSPluralRules::ResolvePlural(
@@ -981,12 +1045,12 @@ BUILTIN(PluralRulesPrototypeSelectRange) {
   // 3. If start is undefined or end is undefined, throw a TypeError exception.
   Handle<Object> start = args.atOrUndefined(isolate, 1);
   Handle<Object> end = args.atOrUndefined(isolate, 2);
-  if (start->IsUndefined()) {
+  if (IsUndefined(*start)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kInvalid,
                               isolate->factory()->startRange_string(), start));
   }
-  if (end->IsUndefined()) {
+  if (IsUndefined(*end)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kInvalid,
                               isolate->factory()->endRange_string(), end));
@@ -1003,20 +1067,21 @@ BUILTIN(PluralRulesPrototypeSelectRange) {
                                      Object::ToNumber(isolate, end));
 
   // 6. Return ! ResolvePluralRange(pr, x, y).
-  if (x->IsNaN()) {
+  if (IsNaN(*x)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewRangeError(MessageTemplate::kInvalid,
                                isolate->factory()->startRange_string(), x));
   }
-  if (y->IsNaN()) {
+  if (IsNaN(*y)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewRangeError(MessageTemplate::kInvalid,
                                isolate->factory()->endRange_string(), y));
   }
 
   RETURN_RESULT_OR_FAILURE(
-      isolate, JSPluralRules::ResolvePluralRange(isolate, plural_rules,
-                                                 x->Number(), y->Number()));
+      isolate,
+      JSPluralRules::ResolvePluralRange(
+          isolate, plural_rules, Object::Number(*x), Object::Number(*y)));
 }
 
 BUILTIN(PluralRulesSupportedLocalesOf) {
@@ -1068,8 +1133,8 @@ BUILTIN(CollatorPrototypeCompare) {
 
   // 4. If collator.[[BoundCompare]] is undefined, then
   Handle<Object> bound_compare(collator->bound_compare(), isolate);
-  if (!bound_compare->IsUndefined(isolate)) {
-    DCHECK(bound_compare->IsJSFunction());
+  if (!IsUndefined(*bound_compare, isolate)) {
+    DCHECK(IsJSFunction(*bound_compare));
     // 5. Return collator.[[BoundCompare]].
     return *bound_compare;
   }
@@ -1111,7 +1176,7 @@ BUILTIN(CollatorInternalCompare) {
                                      Object::ToString(isolate, y));
 
   // 7. Return CompareStrings(collator, X, Y).
-  icu::Collator* icu_collator = collator->icu_collator().raw();
+  icu::Collator* icu_collator = collator->icu_collator()->raw();
   CHECK_NOT_NULL(icu_collator);
   return Smi::FromInt(
       Intl::CompareStrings(isolate, *icu_collator, string_x, string_y));
@@ -1181,7 +1246,7 @@ BUILTIN(SegmentsPrototypeContaining) {
   // 6. Let n be ? ToInteger(index).
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, index,
                                      Object::ToInteger(isolate, index));
-  double const n = index->Number();
+  double const n = Object::Number(*index);
 
   RETURN_RESULT_OR_FAILURE(isolate,
                            JSSegments::Containing(isolate, segments, n));
@@ -1194,7 +1259,7 @@ BUILTIN(SegmentsPrototypeIterator) {
   CHECK_RECEIVER(JSSegments, segments, method_name);
   RETURN_RESULT_OR_FAILURE(
       isolate,
-      JSSegmentIterator::Create(isolate, segments->icu_break_iterator().raw(),
+      JSSegmentIterator::Create(isolate, segments->icu_break_iterator()->raw(),
                                 segments->granularity()));
 }
 
@@ -1220,8 +1285,8 @@ BUILTIN(V8BreakIteratorPrototypeAdoptText) {
   CHECK_RECEIVER(JSV8BreakIterator, break_iterator, method_name);
 
   Handle<Object> bound_adopt_text(break_iterator->bound_adopt_text(), isolate);
-  if (!bound_adopt_text->IsUndefined(isolate)) {
-    DCHECK(bound_adopt_text->IsJSFunction());
+  if (!IsUndefined(*bound_adopt_text, isolate)) {
+    DCHECK(IsJSFunction(*bound_adopt_text));
     return *bound_adopt_text;
   }
 
@@ -1256,8 +1321,8 @@ BUILTIN(V8BreakIteratorPrototypeFirst) {
   CHECK_RECEIVER(JSV8BreakIterator, break_iterator, method_name);
 
   Handle<Object> bound_first(break_iterator->bound_first(), isolate);
-  if (!bound_first->IsUndefined(isolate)) {
-    DCHECK(bound_first->IsJSFunction());
+  if (!IsUndefined(*bound_first, isolate)) {
+    DCHECK(IsJSFunction(*bound_first));
     return *bound_first;
   }
 
@@ -1286,8 +1351,8 @@ BUILTIN(V8BreakIteratorPrototypeNext) {
   CHECK_RECEIVER(JSV8BreakIterator, break_iterator, method_name);
 
   Handle<Object> bound_next(break_iterator->bound_next(), isolate);
-  if (!bound_next->IsUndefined(isolate)) {
-    DCHECK(bound_next->IsJSFunction());
+  if (!IsUndefined(*bound_next, isolate)) {
+    DCHECK(IsJSFunction(*bound_next));
     return *bound_next;
   }
 
@@ -1315,8 +1380,8 @@ BUILTIN(V8BreakIteratorPrototypeCurrent) {
   CHECK_RECEIVER(JSV8BreakIterator, break_iterator, method_name);
 
   Handle<Object> bound_current(break_iterator->bound_current(), isolate);
-  if (!bound_current->IsUndefined(isolate)) {
-    DCHECK(bound_current->IsJSFunction());
+  if (!IsUndefined(*bound_current, isolate)) {
+    DCHECK(IsJSFunction(*bound_current));
     return *bound_current;
   }
 
@@ -1345,8 +1410,8 @@ BUILTIN(V8BreakIteratorPrototypeBreakType) {
   CHECK_RECEIVER(JSV8BreakIterator, break_iterator, method_name);
 
   Handle<Object> bound_break_type(break_iterator->bound_break_type(), isolate);
-  if (!bound_break_type->IsUndefined(isolate)) {
-    DCHECK(bound_break_type->IsJSFunction());
+  if (!IsUndefined(*bound_break_type, isolate)) {
+    DCHECK(IsJSFunction(*bound_break_type));
     return *bound_break_type;
   }
 
diff --git a/deps/v8/src/builtins/builtins-iterator-gen.cc b/deps/v8/src/builtins/builtins-iterator-gen.cc
index 06564c6c603b38..3baadec1cd5172 100644
--- a/deps/v8/src/builtins/builtins-iterator-gen.cc
+++ b/deps/v8/src/builtins/builtins-iterator-gen.cc
@@ -250,7 +250,8 @@ TF_BUILTIN(IterableToFixedArrayForWasm, IteratorBuiltinsAssembler) {
 
   FillFixedArrayFromIterable(context, iterable, iterator_fn, &values);
 
-  GotoIf(WordEqual(SmiUntag(expected_length), values.var_length()->value()),
+  GotoIf(WordEqual(PositiveSmiUntag(expected_length),
+                   values.var_length()->value()),
          &done);
   Return(CallRuntime(
       Runtime::kThrowTypeError, context,
@@ -383,10 +384,10 @@ void IteratorBuiltinsAssembler::FastIterableToList(
         iterable, context, &string_maybe_fast_call, &check_map);
 
     BIND(&string_maybe_fast_call);
-    const TNode<IntPtrT> length = LoadStringLengthAsWord(CAST(iterable));
+    const TNode<Uint32T> length = LoadStringLengthAsWord32(CAST(iterable));
     // Use string length as conservative approximation of number of codepoints.
     GotoIf(
-        IntPtrGreaterThan(length, IntPtrConstant(JSArray::kMaxFastArrayLength)),
+        Uint32GreaterThan(length, Uint32Constant(JSArray::kMaxFastArrayLength)),
         slow);
     *var_result = CAST(CallBuiltin(Builtin::kStringToList, context, iterable));
     Goto(&done);
diff --git a/deps/v8/src/builtins/builtins-json.cc b/deps/v8/src/builtins/builtins-json.cc
index 5ac1cd2bfc57e8..bef2dd47bcd0c7 100644
--- a/deps/v8/src/builtins/builtins-json.cc
+++ b/deps/v8/src/builtins/builtins-json.cc
@@ -49,7 +49,7 @@ BUILTIN(JsonRawJson) {
 BUILTIN(JsonIsRawJson) {
   HandleScope scope(isolate);
   Handle<Object> text = args.atOrUndefined(isolate, 1);
-  return isolate->heap()->ToBoolean(text->IsJSRawJson());
+  return isolate->heap()->ToBoolean(IsJSRawJson(*text));
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/builtins/builtins-lazy-gen.cc b/deps/v8/src/builtins/builtins-lazy-gen.cc
index 0428372b9948d4..2a377bf10e1d1b 100644
--- a/deps/v8/src/builtins/builtins-lazy-gen.cc
+++ b/deps/v8/src/builtins/builtins-lazy-gen.cc
@@ -74,7 +74,8 @@ void LazyBuiltinsAssembler::MaybeTailCallOptimizedCodeSlot(
 
     // Optimized code is good, get it into the closure and link the closure into
     // the optimized functions list, then tail call the optimized code.
-    StoreObjectField(function, JSFunction::kCodeOffset, optimized_code);
+    StoreMaybeIndirectPointerField(function, JSFunction::kCodeOffset,
+                                   optimized_code);
     Comment("MaybeTailCallOptimizedCodeSlot:: GenerateTailCallToJSCode");
     GenerateTailCallToJSCode(optimized_code, function);
 
@@ -110,7 +111,7 @@ void LazyBuiltinsAssembler::CompileLazy(TNode<JSFunction> function) {
 
   CSA_DCHECK(this, TaggedNotEqual(sfi_code, HeapConstant(BUILTIN_CODE(
                                                 isolate(), CompileLazy))));
-  StoreObjectField(function, JSFunction::kCodeOffset, sfi_code);
+  StoreMaybeIndirectPointerField(function, JSFunction::kCodeOffset, sfi_code);
 
   Label maybe_use_sfi_code(this);
   // If there is no feedback, don't check for optimized code.
@@ -167,7 +168,7 @@ TF_BUILTIN(CompileLazyDeoptimizedCode, LazyBuiltinsAssembler) {
 
   TNode<Code> code = HeapConstant(BUILTIN_CODE(isolate(), CompileLazy));
   // Set the code slot inside the JSFunction to CompileLazy.
-  StoreObjectField(function, JSFunction::kCodeOffset, code);
+  StoreMaybeIndirectPointerField(function, JSFunction::kCodeOffset, code);
   GenerateTailCallToJSCode(code, function);
 }
 
diff --git a/deps/v8/src/builtins/builtins-number-gen.cc b/deps/v8/src/builtins/builtins-number-gen.cc
index ef89a1baddf583..e4de522f5ead5a 100644
--- a/deps/v8/src/builtins/builtins-number-gen.cc
+++ b/deps/v8/src/builtins/builtins-number-gen.cc
@@ -154,7 +154,7 @@ DEF_UNOP(Negate_Baseline, Generate_NegateWithFeedback)
     auto slot = UncheckedParameter<UintPtrT>(Descriptor::kSlot);               \
                                                                                \
     TVARIABLE(Smi, var_type_feedback);                                         \
-    TNode<Oddball> result = RelationalComparison(Operation::k##Name, lhs, rhs, \
+    TNode<Boolean> result = RelationalComparison(Operation::k##Name, lhs, rhs, \
                                                  context, &var_type_feedback); \
     UpdateFeedback(var_type_feedback.value(), feedback_vector, slot);          \
                                                                                \
@@ -173,7 +173,7 @@ DEF_COMPARE(GreaterThanOrEqual)
     auto slot = UncheckedParameter<UintPtrT>(Descriptor::kSlot);          \
                                                                           \
     TVARIABLE(Smi, var_type_feedback);                                    \
-    TNode<Oddball> result = RelationalComparison(                         \
+    TNode<Boolean> result = RelationalComparison(                         \
         Operation::k##Name, lhs, rhs,                                     \
         [&]() { return LoadContextFromBaseline(); }, &var_type_feedback); \
     auto feedback_vector = LoadFeedbackVectorFromBaseline();              \
@@ -195,7 +195,7 @@ TF_BUILTIN(Equal_WithFeedback, CodeStubAssembler) {
   auto slot = UncheckedParameter<UintPtrT>(Descriptor::kSlot);
 
   TVARIABLE(Smi, var_type_feedback);
-  TNode<Oddball> result = Equal(
+  TNode<Boolean> result = Equal(
       lhs, rhs, [&]() { return context; }, &var_type_feedback);
   UpdateFeedback(var_type_feedback.value(), feedback_vector, slot);
 
@@ -209,7 +209,7 @@ TF_BUILTIN(StrictEqual_WithFeedback, CodeStubAssembler) {
   auto slot = UncheckedParameter<UintPtrT>(Descriptor::kSlot);
 
   TVARIABLE(Smi, var_type_feedback);
-  TNode<Oddball> result = StrictEqual(lhs, rhs, &var_type_feedback);
+  TNode<Boolean> result = StrictEqual(lhs, rhs, &var_type_feedback);
   UpdateFeedback(var_type_feedback.value(), feedback_vector, slot);
 
   Return(result);
@@ -221,7 +221,7 @@ TF_BUILTIN(Equal_Baseline, CodeStubAssembler) {
   auto slot = UncheckedParameter<UintPtrT>(Descriptor::kSlot);
 
   TVARIABLE(Smi, var_type_feedback);
-  TNode<Oddball> result = Equal(
+  TNode<Boolean> result = Equal(
       lhs, rhs, [&]() { return LoadContextFromBaseline(); },
       &var_type_feedback);
   auto feedback_vector = LoadFeedbackVectorFromBaseline();
@@ -236,7 +236,7 @@ TF_BUILTIN(StrictEqual_Baseline, CodeStubAssembler) {
   auto slot = UncheckedParameter<UintPtrT>(Descriptor::kSlot);
 
   TVARIABLE(Smi, var_type_feedback);
-  TNode<Oddball> result = StrictEqual(lhs, rhs, &var_type_feedback);
+  TNode<Boolean> result = StrictEqual(lhs, rhs, &var_type_feedback);
   auto feedback_vector = LoadFeedbackVectorFromBaseline();
   UpdateFeedback(var_type_feedback.value(), feedback_vector, slot);
 
diff --git a/deps/v8/src/builtins/builtins-number.cc b/deps/v8/src/builtins/builtins-number.cc
index 4eddf5358a7b95..8a14852b3639d1 100644
--- a/deps/v8/src/builtins/builtins-number.cc
+++ b/deps/v8/src/builtins/builtins-number.cc
@@ -25,22 +25,22 @@ BUILTIN(NumberPrototypeToExponential) {
   Handle<Object> fraction_digits = args.atOrUndefined(isolate, 1);
 
   // Unwrap the receiver {value}.
-  if (value->IsJSPrimitiveWrapper()) {
+  if (IsJSPrimitiveWrapper(*value)) {
     value = handle(Handle<JSPrimitiveWrapper>::cast(value)->value(), isolate);
   }
-  if (!value->IsNumber()) {
+  if (!IsNumber(*value)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotGeneric,
                               isolate->factory()->NewStringFromAsciiChecked(
                                   "Number.prototype.toExponential"),
                               isolate->factory()->Number_string()));
   }
-  double const value_number = value->Number();
+  double const value_number = Object::Number(*value);
 
   // Convert the {fraction_digits} to an integer first.
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, fraction_digits, Object::ToInteger(isolate, fraction_digits));
-  double const fraction_digits_number = fraction_digits->Number();
+  double const fraction_digits_number = Object::Number(*fraction_digits);
 
   if (std::isnan(value_number)) return ReadOnlyRoots(isolate).NaN_string();
   if (std::isinf(value_number)) {
@@ -54,7 +54,7 @@ BUILTIN(NumberPrototypeToExponential) {
                                isolate->factory()->NewStringFromAsciiChecked(
                                    "toExponential()")));
   }
-  int const f = args.atOrUndefined(isolate, 1)->IsUndefined(isolate)
+  int const f = IsUndefined(*args.atOrUndefined(isolate, 1), isolate)
                     ? -1
                     : static_cast<int>(fraction_digits_number);
   char* const str = DoubleToExponentialCString(value_number, f);
@@ -70,22 +70,22 @@ BUILTIN(NumberPrototypeToFixed) {
   Handle<Object> fraction_digits = args.atOrUndefined(isolate, 1);
 
   // Unwrap the receiver {value}.
-  if (value->IsJSPrimitiveWrapper()) {
+  if (IsJSPrimitiveWrapper(*value)) {
     value = handle(Handle<JSPrimitiveWrapper>::cast(value)->value(), isolate);
   }
-  if (!value->IsNumber()) {
+  if (!IsNumber(*value)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotGeneric,
                               isolate->factory()->NewStringFromAsciiChecked(
                                   "Number.prototype.toFixed"),
                               isolate->factory()->Number_string()));
   }
-  double const value_number = value->Number();
+  double const value_number = Object::Number(*value);
 
   // Convert the {fraction_digits} to an integer first.
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, fraction_digits, Object::ToInteger(isolate, fraction_digits));
-  double const fraction_digits_number = fraction_digits->Number();
+  double const fraction_digits_number = Object::Number(*fraction_digits);
 
   // Check if the {fraction_digits} are in the supported range.
   if (fraction_digits_number < 0.0 ||
@@ -118,11 +118,11 @@ BUILTIN(NumberPrototypeToLocaleString) {
   Handle<Object> value = args.at(0);
 
   // Unwrap the receiver {value}.
-  if (value->IsJSPrimitiveWrapper()) {
+  if (IsJSPrimitiveWrapper(*value)) {
     value = handle(Handle<JSPrimitiveWrapper>::cast(value)->value(), isolate);
   }
   // 1. Let x be ? thisNumberValue(this value)
-  if (!value->IsNumber()) {
+  if (!IsNumber(*value)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
         NewTypeError(MessageTemplate::kNotGeneric,
@@ -148,27 +148,27 @@ BUILTIN(NumberPrototypeToPrecision) {
   Handle<Object> precision = args.atOrUndefined(isolate, 1);
 
   // Unwrap the receiver {value}.
-  if (value->IsJSPrimitiveWrapper()) {
+  if (IsJSPrimitiveWrapper(*value)) {
     value = handle(Handle<JSPrimitiveWrapper>::cast(value)->value(), isolate);
   }
-  if (!value->IsNumber()) {
+  if (!IsNumber(*value)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotGeneric,
                               isolate->factory()->NewStringFromAsciiChecked(
                                   "Number.prototype.toPrecision"),
                               isolate->factory()->Number_string()));
   }
-  double const value_number = value->Number();
+  double const value_number = Object::Number(*value);
 
   // If no {precision} was specified, just return ToString of {value}.
-  if (precision->IsUndefined(isolate)) {
+  if (IsUndefined(*precision, isolate)) {
     return *isolate->factory()->NumberToString(value);
   }
 
   // Convert the {precision} to an integer first.
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, precision,
                                      Object::ToInteger(isolate, precision));
-  double const precision_number = precision->Number();
+  double const precision_number = Object::Number(*precision);
 
   if (std::isnan(value_number)) return ReadOnlyRoots(isolate).NaN_string();
   if (std::isinf(value_number)) {
diff --git a/deps/v8/src/builtins/builtins-object-gen.cc b/deps/v8/src/builtins/builtins-object-gen.cc
index f0d21bba565935..a425989083e6f8 100644
--- a/deps/v8/src/builtins/builtins-object-gen.cc
+++ b/deps/v8/src/builtins/builtins-object-gen.cc
@@ -216,8 +216,7 @@ TNode<JSArray> ObjectEntriesValuesBuiltinsAssembler::FastGetOwnValuesOrEntries(
   {
     GotoIf(WordEqual(object_enum_length, IntPtrConstant(0)), if_no_properties);
     TNode<FixedArray> values_or_entries =
-        CAST(AllocateFixedArray(PACKED_ELEMENTS, object_enum_length,
-                                AllocationFlag::kAllowLargeObjectAllocation));
+        CAST(AllocateFixedArray(PACKED_ELEMENTS, object_enum_length));
 
     // If in case we have enum_cache,
     // we can't detect accessor of object until loop through descriptors.
@@ -954,59 +953,13 @@ TF_BUILTIN(ObjectToString, ObjectBuiltinsAssembler) {
 
   BIND(&checkstringtag);
   {
-    // Check if all relevant maps (including the prototype maps) don't
-    // have any interesting symbols (i.e. that none of them have the
-    // @@toStringTag property).
-    Label loop(this, {&var_holder, &var_holder_map}), return_default(this),
-        return_generic(this, Label::kDeferred);
-    Goto(&loop);
-    BIND(&loop);
-    {
-      Label interesting_symbols(this);
-      TNode<HeapObject> holder = var_holder.value();
-      TNode<Map> holder_map = var_holder_map.value();
-      GotoIf(IsNull(holder), &return_default);
-      TNode<Uint32T> holder_bit_field3 = LoadMapBitField3(holder_map);
-      GotoIf(IsSetWord32<Map::Bits3::MayHaveInterestingSymbolsBit>(
-                 holder_bit_field3),
-             &interesting_symbols);
-      var_holder = LoadMapPrototype(holder_map);
-      var_holder_map = LoadMap(var_holder.value());
-      Goto(&loop);
-      BIND(&interesting_symbols);
-      {
-        // Check flags for dictionary objects.
-        GotoIf(IsClearWord32<Map::Bits3::IsDictionaryMapBit>(holder_bit_field3),
-               &return_generic);
-        GotoIf(
-            InstanceTypeEqual(LoadMapInstanceType(holder_map), JS_PROXY_TYPE),
-            &if_proxy);
-        TNode<Object> properties =
-            LoadObjectField(holder, JSObject::kPropertiesOrHashOffset);
-        CSA_DCHECK(this, TaggedIsNotSmi(properties));
-        // TODO(pthier): Support swiss dictionaries.
-        if constexpr (!V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-          CSA_DCHECK(this, IsNameDictionary(CAST(properties)));
-          TNode<Smi> flags =
-              GetNameDictionaryFlags<NameDictionary>(CAST(properties));
-          GotoIf(IsSetSmi(flags,
-                          NameDictionary::MayHaveInterestingSymbolsBit::kMask),
-                 &return_generic);
-          var_holder = LoadMapPrototype(holder_map);
-          var_holder_map = LoadMap(var_holder.value());
-        }
-        Goto(&loop);
-      }
-    }
-
-    BIND(&return_generic);
-    {
-      TNode<Object> tag = GetProperty(context, ToObject(context, receiver),
-                                      ToStringTagSymbolConstant());
-      GotoIf(TaggedIsSmi(tag), &return_default);
-      GotoIfNot(IsString(CAST(tag)), &return_default);
-      ReturnToStringFormat(context, CAST(tag));
-    }
+    Label return_default(this);
+    TNode<Object> tag =
+        GetInterestingProperty(context, receiver, &var_holder, &var_holder_map,
+                               ToStringTagSymbolConstant(), &return_default);
+    GotoIf(TaggedIsSmi(tag), &return_default);
+    GotoIfNot(IsString(CAST(tag)), &return_default);
+    ReturnToStringFormat(context, CAST(tag));
 
     BIND(&return_default);
     Return(var_default.value());
@@ -1179,7 +1132,7 @@ TF_BUILTIN(ObjectIs, ObjectBuiltinsAssembler) {
 
 TF_BUILTIN(CreateIterResultObject, ObjectBuiltinsAssembler) {
   const auto value = Parameter<Object>(Descriptor::kValue);
-  const auto done = Parameter<Oddball>(Descriptor::kDone);
+  const auto done = Parameter<Boolean>(Descriptor::kDone);
   const auto context = Parameter<Context>(Descriptor::kContext);
 
   const TNode<NativeContext> native_context = LoadNativeContext(context);
@@ -1267,8 +1220,8 @@ TF_BUILTIN(CreateGeneratorObject, ObjectBuiltinsAssembler) {
   TNode<IntPtrT> size =
       IntPtrAdd(WordSar(frame_size, IntPtrConstant(kTaggedSizeLog2)),
                 formal_parameter_count);
-  TNode<FixedArrayBase> parameters_and_registers = AllocateFixedArray(
-      HOLEY_ELEMENTS, size, AllocationFlag::kAllowLargeObjectAllocation);
+  TNode<FixedArrayBase> parameters_and_registers =
+      AllocateFixedArray(HOLEY_ELEMENTS, size);
   FillFixedArrayWithValue(HOLEY_ELEMENTS, parameters_and_registers,
                           IntPtrConstant(0), size, RootIndex::kUndefinedValue);
   // TODO(cbruni): support start_offset to avoid double initialization.
@@ -1403,8 +1356,8 @@ void ObjectBuiltinsAssembler::AddToDictionaryIf(
   Label done(this);
   GotoIfNot(condition, &done);
 
-  Add<PropertyDictionary>(CAST(name_dictionary), HeapConstant(name), value,
-                          bailout);
+  AddToDictionary<PropertyDictionary>(CAST(name_dictionary), HeapConstant(name),
+                                      value, bailout);
   Goto(&done);
 
   BIND(&done);
diff --git a/deps/v8/src/builtins/builtins-object.cc b/deps/v8/src/builtins/builtins-object.cc
index 77ad03715a7c4e..0efbf1e37e5496 100644
--- a/deps/v8/src/builtins/builtins-object.cc
+++ b/deps/v8/src/builtins/builtins-object.cc
@@ -59,14 +59,15 @@ BUILTIN(ObjectDefineProperty) {
 namespace {
 
 template <AccessorComponent which_accessor>
-Object ObjectDefineAccessor(Isolate* isolate, Handle<Object> object,
-                            Handle<Object> name, Handle<Object> accessor) {
+Tagged<Object> ObjectDefineAccessor(Isolate* isolate, Handle<Object> object,
+                                    Handle<Object> name,
+                                    Handle<Object> accessor) {
   // 1. Let O be ? ToObject(this value).
   Handle<JSReceiver> receiver;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, receiver,
                                      Object::ToObject(isolate, object));
   // 2. If IsCallable(getter) is false, throw a TypeError exception.
-  if (!accessor->IsCallable()) {
+  if (!IsCallable(*accessor)) {
     MessageTemplate message =
         which_accessor == ACCESSOR_GETTER
             ? MessageTemplate::kObjectGetterExpectingFunction
@@ -100,8 +101,9 @@ Object ObjectDefineAccessor(Isolate* isolate, Handle<Object> object,
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
-Object ObjectLookupAccessor(Isolate* isolate, Handle<Object> object,
-                            Handle<Object> key, AccessorComponent component) {
+Tagged<Object> ObjectLookupAccessor(Isolate* isolate, Handle<Object> object,
+                                    Handle<Object> key,
+                                    AccessorComponent component) {
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, object,
                                      Object::ToObject(isolate, object));
   // TODO(jkummerow/verwaest): PropertyKey(..., bool*) performs a
@@ -122,9 +124,9 @@ Object ObjectLookupAccessor(Isolate* isolate, Handle<Object> object,
 
       case LookupIterator::ACCESS_CHECK:
         if (it.HasAccess()) continue;
-        isolate->ReportFailedAccessCheck(it.GetHolder<JSObject>());
-        RETURN_FAILURE_IF_SCHEDULED_EXCEPTION(isolate);
-        return ReadOnlyRoots(isolate).undefined_value();
+        RETURN_FAILURE_ON_EXCEPTION(isolate, isolate->ReportFailedAccessCheck(
+                                                 it.GetHolder<JSObject>()));
+        UNREACHABLE();
 
       case LookupIterator::JSPROXY: {
         PropertyDescriptor desc;
@@ -143,7 +145,7 @@ Object ObjectLookupAccessor(Isolate* isolate, Handle<Object> object,
         Handle<Object> prototype;
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
             isolate, prototype, JSProxy::GetPrototype(it.GetHolder<JSProxy>()));
-        if (prototype->IsNull(isolate)) {
+        if (IsNull(*prototype, isolate)) {
           return ReadOnlyRoots(isolate).undefined_value();
         }
         return ObjectLookupAccessor(isolate, prototype, key, component);
@@ -155,7 +157,7 @@ Object ObjectLookupAccessor(Isolate* isolate, Handle<Object> object,
 
       case LookupIterator::ACCESSOR: {
         Handle<Object> maybe_pair = it.GetAccessors();
-        if (maybe_pair->IsAccessorPair()) {
+        if (IsAccessorPair(*maybe_pair)) {
           Handle<NativeContext> native_context = it.GetHolder<JSReceiver>()
                                                      ->GetCreationContext()
                                                      .ToHandleChecked();
@@ -214,7 +216,7 @@ BUILTIN(ObjectLookupSetter) {
 BUILTIN(ObjectFreeze) {
   HandleScope scope(isolate);
   Handle<Object> object = args.atOrUndefined(isolate, 1);
-  if (object->IsJSReceiver()) {
+  if (IsJSReceiver(*object)) {
     MAYBE_RETURN(
         JSReceiver::SetIntegrityLevel(isolate, Handle<JSReceiver>::cast(object),
                                       FROZEN, kThrowOnError),
@@ -241,7 +243,7 @@ BUILTIN(ObjectPrototypeSetProto) {
   HandleScope scope(isolate);
   // 1. Let O be ? RequireObjectCoercible(this value).
   Handle<Object> object = args.receiver();
-  if (object->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*object, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kCalledOnNullOrUndefined,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -250,12 +252,12 @@ BUILTIN(ObjectPrototypeSetProto) {
 
   // 2. If Type(proto) is neither Object nor Null, return undefined.
   Handle<Object> proto = args.at(1);
-  if (!proto->IsNull(isolate) && !proto->IsJSReceiver()) {
+  if (!IsNull(*proto, isolate) && !IsJSReceiver(*proto)) {
     return ReadOnlyRoots(isolate).undefined_value();
   }
 
   // 3. If Type(O) is not Object, return undefined.
-  if (!object->IsJSReceiver()) return ReadOnlyRoots(isolate).undefined_value();
+  if (!IsJSReceiver(*object)) return ReadOnlyRoots(isolate).undefined_value();
   Handle<JSReceiver> receiver = Handle<JSReceiver>::cast(object);
 
   // 4. Let status be ? O.[[SetPrototypeOf]](proto).
@@ -270,8 +272,8 @@ BUILTIN(ObjectPrototypeSetProto) {
 
 namespace {
 
-Object GetOwnPropertyKeys(Isolate* isolate, BuiltinArguments args,
-                          PropertyFilter filter) {
+Tagged<Object> GetOwnPropertyKeys(Isolate* isolate, BuiltinArguments args,
+                                  PropertyFilter filter) {
   HandleScope scope(isolate);
   Handle<Object> object = args.atOrUndefined(isolate, 1);
   Handle<JSReceiver> receiver;
@@ -297,7 +299,7 @@ BUILTIN(ObjectIsFrozen) {
   HandleScope scope(isolate);
   Handle<Object> object = args.atOrUndefined(isolate, 1);
   Maybe<bool> result =
-      object->IsJSReceiver()
+      IsJSReceiver(*object)
           ? JSReceiver::TestIntegrityLevel(
                 isolate, Handle<JSReceiver>::cast(object), FROZEN)
           : Just(true);
@@ -310,7 +312,7 @@ BUILTIN(ObjectIsSealed) {
   HandleScope scope(isolate);
   Handle<Object> object = args.atOrUndefined(isolate, 1);
   Maybe<bool> result =
-      object->IsJSReceiver()
+      IsJSReceiver(*object)
           ? JSReceiver::TestIntegrityLevel(
                 isolate, Handle<JSReceiver>::cast(object), SEALED)
           : Just(true);
@@ -358,7 +360,7 @@ BUILTIN(ObjectGetOwnPropertyDescriptors) {
 BUILTIN(ObjectSeal) {
   HandleScope scope(isolate);
   Handle<Object> object = args.atOrUndefined(isolate, 1);
-  if (object->IsJSReceiver()) {
+  if (IsJSReceiver(*object)) {
     MAYBE_RETURN(
         JSReceiver::SetIntegrityLevel(isolate, Handle<JSReceiver>::cast(object),
                                       SEALED, kThrowOnError),
diff --git a/deps/v8/src/builtins/builtins-reflect.cc b/deps/v8/src/builtins/builtins-reflect.cc
index 7f5b2095bfc762..8d3ef5d22de1f4 100644
--- a/deps/v8/src/builtins/builtins-reflect.cc
+++ b/deps/v8/src/builtins/builtins-reflect.cc
@@ -24,7 +24,7 @@ BUILTIN(ReflectDefineProperty) {
   Handle<Object> key = args.at(2);
   Handle<Object> attributes = args.at(3);
 
-  if (!target->IsJSReceiver()) {
+  if (!IsJSReceiver(*target)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kCalledOnNonObject,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -52,7 +52,7 @@ BUILTIN(ReflectOwnKeys) {
   DCHECK_LE(2, args.length());
   Handle<Object> target = args.at(1);
 
-  if (!target->IsJSReceiver()) {
+  if (!IsJSReceiver(*target)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kCalledOnNonObject,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -76,7 +76,7 @@ BUILTIN(ReflectSet) {
   Handle<Object> value = args.atOrUndefined(isolate, 3);
   Handle<Object> receiver = args.length() > 4 ? args.at(4) : target;
 
-  if (!target->IsJSReceiver()) {
+  if (!IsJSReceiver(*target)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kCalledOnNonObject,
                               isolate->factory()->NewStringFromAsciiChecked(
diff --git a/deps/v8/src/builtins/builtins-regexp-gen.cc b/deps/v8/src/builtins/builtins-regexp-gen.cc
index 32e9ae742c4d27..d36652469133b0 100644
--- a/deps/v8/src/builtins/builtins-regexp-gen.cc
+++ b/deps/v8/src/builtins/builtins-regexp-gen.cc
@@ -61,7 +61,7 @@ TNode<JSRegExpResult> RegExpBuiltinsAssembler::AllocateRegExpResult(
   Label result_has_indices(this), allocated(this);
   const ElementsKind elements_kind = PACKED_ELEMENTS;
   base::Optional<TNode<AllocationSite>> no_gc_site = base::nullopt;
-  TNode<IntPtrT> length_intptr = SmiUntag(length);
+  TNode<IntPtrT> length_intptr = PositiveSmiUntag(length);
   // Note: The returned `var_elements` may be in young large object space, but
   // `var_array` is guaranteed to be in new space so we could skip write
   // barriers below.
@@ -75,7 +75,7 @@ TNode<JSRegExpResult> RegExpBuiltinsAssembler::AllocateRegExpResult(
     std::tie(var_array, var_elements) =
         AllocateUninitializedJSArrayWithElements(
             elements_kind, map, length, no_gc_site, length_intptr,
-            AllocationFlag::kAllowLargeObjectAllocation, JSRegExpResult::kSize);
+            AllocationFlag::kNone, JSRegExpResult::kSize);
     Goto(&allocated);
   }
 
@@ -87,8 +87,7 @@ TNode<JSRegExpResult> RegExpBuiltinsAssembler::AllocateRegExpResult(
     std::tie(var_array, var_elements) =
         AllocateUninitializedJSArrayWithElements(
             elements_kind, map, length, no_gc_site, length_intptr,
-            AllocationFlag::kAllowLargeObjectAllocation,
-            JSRegExpResultWithIndices::kSize);
+            AllocationFlag::kNone, JSRegExpResultWithIndices::kSize);
     Goto(&allocated);
   }
 
@@ -181,8 +180,9 @@ TNode<JSRegExpResult> RegExpBuiltinsAssembler::ConstructNewResultFromMatchInfo(
     TNode<Number> last_index) {
   Label named_captures(this), maybe_build_indices(this), out(this);
 
-  TNode<IntPtrT> num_indices = SmiUntag(CAST(UnsafeLoadFixedArrayElement(
-      match_info, RegExpMatchInfo::kNumberOfCapturesIndex)));
+  TNode<IntPtrT> num_indices =
+      PositiveSmiUntag(CAST(UnsafeLoadFixedArrayElement(
+          match_info, RegExpMatchInfo::kNumberOfCapturesIndex)));
   TNode<Smi> num_results = SmiTag(WordShr(num_indices, 1));
   TNode<Smi> start = CAST(UnsafeLoadFixedArrayElement(
       match_info, RegExpMatchInfo::kFirstCaptureIndex));
@@ -293,8 +293,7 @@ TNode<JSRegExpResult> RegExpBuiltinsAssembler::ConstructNewResultFromMatchInfo(
     if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
       properties = AllocateSwissNameDictionary(num_properties);
     } else {
-      properties = AllocateNameDictionary(
-          num_properties, AllocationFlag::kAllowLargeObjectAllocation);
+      properties = AllocateNameDictionary(num_properties);
     }
 
     TNode<JSObject> group_object = AllocateJSObjectFromMap(map, properties);
@@ -330,8 +329,8 @@ TNode<JSRegExpResult> RegExpBuiltinsAssembler::ConstructNewResultFromMatchInfo(
       // - Receiver is extensible
       // - Receiver has no interceptors
       Label add_dictionary_property_slow(this, Label::kDeferred);
-      Add<PropertyDictionary>(CAST(properties), name, capture,
-                              &add_dictionary_property_slow);
+      AddToDictionary<PropertyDictionary>(CAST(properties), name, capture,
+                                          &add_dictionary_property_slow);
 
       var_i = i_plus_2;
       Branch(IntPtrGreaterThanOrEqual(var_i.value(), names_length),
@@ -415,7 +414,7 @@ TNode<HeapObject> RegExpBuiltinsAssembler::RegExpExecInternal(
   GotoIf(TaggedIsNotSmi(last_index), &if_failure);
 
   TNode<IntPtrT> int_string_length = LoadStringLengthAsWord(string);
-  TNode<IntPtrT> int_last_index = SmiUntag(CAST(last_index));
+  TNode<IntPtrT> int_last_index = PositiveSmiUntag(CAST(last_index));
 
   GotoIf(UintPtrGreaterThan(int_last_index, int_string_length), &if_failure);
 
@@ -580,7 +579,7 @@ TNode<HeapObject> RegExpBuiltinsAssembler::RegExpExecInternal(
     MachineType arg8_type = type_tagged;
     TNode<JSRegExp> arg8 = regexp;
 
-    TNode<RawPtrT> code_entry = GetCodeEntry(code);
+    TNode<RawPtrT> code_entry = LoadCodeInstructionStart(code);
 
     // AIX uses function descriptors on CFunction calls. code_entry in this case
     // may also point to a Regex interpreter entry trampoline which does not
@@ -1612,7 +1611,7 @@ TNode<JSArray> RegExpBuiltinsAssembler::RegExpPrototypeSplitBody(
     {
       const TNode<Smi> num_registers = CAST(LoadFixedArrayElement(
           match_indices, RegExpMatchInfo::kNumberOfCapturesIndex));
-      const TNode<IntPtrT> int_num_registers = SmiUntag(num_registers);
+      const TNode<IntPtrT> int_num_registers = PositiveSmiUntag(num_registers);
 
       TVARIABLE(IntPtrT, var_reg, IntPtrConstant(2));
 
diff --git a/deps/v8/src/builtins/builtins-regexp-gen.h b/deps/v8/src/builtins/builtins-regexp-gen.h
index 96497a0a99d7bd..53e746575ea99a 100644
--- a/deps/v8/src/builtins/builtins-regexp-gen.h
+++ b/deps/v8/src/builtins/builtins-regexp-gen.h
@@ -8,6 +8,7 @@
 #include "src/base/optional.h"
 #include "src/codegen/code-stub-assembler.h"
 #include "src/common/message-template.h"
+#include "src/objects/string.h"
 #include "src/regexp/regexp.h"
 
 namespace v8 {
diff --git a/deps/v8/src/builtins/builtins-regexp.cc b/deps/v8/src/builtins/builtins-regexp.cc
index e758782a997dd0..e7391f1d246953 100644
--- a/deps/v8/src/builtins/builtins-regexp.cc
+++ b/deps/v8/src/builtins/builtins-regexp.cc
@@ -82,8 +82,8 @@ DEFINE_CAPTURE_GETTER(9)
 BUILTIN(RegExpInputGetter) {
   HandleScope scope(isolate);
   Handle<Object> obj(isolate->regexp_last_match_info()->LastInput(), isolate);
-  return obj->IsUndefined(isolate) ? ReadOnlyRoots(isolate).empty_string()
-                                   : String::cast(*obj);
+  return IsUndefined(*obj, isolate) ? ReadOnlyRoots(isolate).empty_string()
+                                    : Tagged<String>::cast(*obj);
 }
 
 BUILTIN(RegExpInputSetter) {
diff --git a/deps/v8/src/builtins/builtins-shadow-realm.cc b/deps/v8/src/builtins/builtins-shadow-realm.cc
index 03f1cceaca615c..8bfce891ab711f 100644
--- a/deps/v8/src/builtins/builtins-shadow-realm.cc
+++ b/deps/v8/src/builtins/builtins-shadow-realm.cc
@@ -14,7 +14,7 @@ namespace internal {
 BUILTIN(ShadowRealmConstructor) {
   HandleScope scope(isolate);
   // 1. If NewTarget is undefined, throw a TypeError exception.
-  if (args.new_target()->IsUndefined(isolate)) {  // [[Call]]
+  if (IsUndefined(*args.new_target(), isolate)) {  // [[Call]]
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kConstructorNotFunction,
                               isolate->factory()->ShadowRealm_string()));
@@ -63,12 +63,12 @@ MaybeHandle<Object> GetWrappedValue(Isolate* isolate,
                                     Handle<NativeContext> creation_context,
                                     Handle<Object> value) {
   // 1. If Type(value) is Object, then
-  if (!value->IsJSReceiver()) {
+  if (!IsJSReceiver(*value)) {
     // 2. Return value.
     return value;
   }
   // 1a. If IsCallable(value) is false, throw a TypeError exception.
-  if (!value->IsCallable()) {
+  if (!IsCallable(*value)) {
     // The TypeError thrown is created with creation Realm's TypeError
     // constructor instead of the executing Realm's.
     THROW_NEW_ERROR_RETURN_VALUE(
@@ -96,14 +96,14 @@ BUILTIN(ShadowRealmPrototypeEvaluate) {
   Factory* factory = isolate->factory();
 
   // 2. Perform ? ValidateShadowRealmObject(O).
-  if (!receiver->IsJSShadowRealm()) {
+  if (!IsJSShadowRealm(*receiver)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kIncompatibleMethodReceiver));
   }
   Handle<JSShadowRealm> shadow_realm = Handle<JSShadowRealm>::cast(receiver);
 
   // 3. If Type(sourceText) is not String, throw a TypeError exception.
-  if (!source_text->IsString()) {
+  if (!IsString(*source_text)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
         NewTypeError(MessageTemplate::kInvalidShadowRealmEvaluateSourceText));
diff --git a/deps/v8/src/builtins/builtins-shared-array.cc b/deps/v8/src/builtins/builtins-shared-array.cc
index 1ddfe36c007ee7..335af07b9a11d8 100644
--- a/deps/v8/src/builtins/builtins-shared-array.cc
+++ b/deps/v8/src/builtins/builtins-shared-array.cc
@@ -24,12 +24,12 @@ BUILTIN(SharedArrayConstructor) {
   Handle<Object> length_number;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, length_number,
                                      Object::ToInteger(isolate, length_arg));
-  if (!length_number->IsSmi()) {
+  if (!IsSmi(*length_number)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewRangeError(MessageTemplate::kSharedArraySizeOutOfRange));
   }
 
-  int length = Handle<Smi>::cast(length_number)->value();
+  int length = Smi::cast(*length_number).value();
   if (length < 0 || length > kMaxJSSharedArraySize) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewRangeError(MessageTemplate::kSharedArraySizeOutOfRange));
diff --git a/deps/v8/src/builtins/builtins-sharedarraybuffer-gen.cc b/deps/v8/src/builtins/builtins-sharedarraybuffer-gen.cc
index c6b824cab7e3e7..09e6de5d1af315 100644
--- a/deps/v8/src/builtins/builtins-sharedarraybuffer-gen.cc
+++ b/deps/v8/src/builtins/builtins-sharedarraybuffer-gen.cc
@@ -524,22 +524,25 @@ TF_BUILTIN(AtomicsExchange, SharedArrayBufferBuiltinsAssembler) {
 
 // https://tc39.es/ecma262/#sec-atomics.compareexchange
 TF_BUILTIN(AtomicsCompareExchange, SharedArrayBufferBuiltinsAssembler) {
-  auto maybe_array = Parameter<Object>(Descriptor::kArray);
-  auto index = Parameter<Object>(Descriptor::kIndex);
+  auto maybe_array_or_shared_object =
+      Parameter<Object>(Descriptor::kArrayOrSharedObject);
+  auto index_or_field_name = Parameter<Object>(Descriptor::kIndexOrFieldName);
   auto old_value = Parameter<Object>(Descriptor::kOldValue);
   auto new_value = Parameter<Object>(Descriptor::kNewValue);
   auto context = Parameter<Context>(Descriptor::kContext);
 
   // 1. Let buffer be ? ValidateIntegerTypedArray(typedArray).
-  Label detached_or_out_of_bounds(this);
+  Label detached_or_out_of_bounds(this), is_shared_struct_or_shared_array(this);
   TNode<Int32T> elements_kind;
   TNode<RawPtrT> backing_store;
-  ValidateIntegerTypedArray(maybe_array, context, &elements_kind,
-                            &backing_store, &detached_or_out_of_bounds);
-  TNode<JSTypedArray> array = CAST(maybe_array);
+  ValidateIntegerTypedArray(
+      maybe_array_or_shared_object, context, &elements_kind, &backing_store,
+      &detached_or_out_of_bounds, &is_shared_struct_or_shared_array);
+  TNode<JSTypedArray> array = CAST(maybe_array_or_shared_object);
 
   // 2. Let i be ? ValidateAtomicAccess(typedArray, index).
-  TNode<UintPtrT> index_word = ValidateAtomicAccess(array, index, context);
+  TNode<UintPtrT> index_word =
+      ValidateAtomicAccess(array, index_or_field_name, context);
 
 #if V8_TARGET_ARCH_MIPS64
   TNode<Number> index_number = ChangeUintPtrToTagged(index_word);
@@ -667,6 +670,13 @@ TF_BUILTIN(AtomicsCompareExchange, SharedArrayBufferBuiltinsAssembler) {
     ThrowTypeError(context, MessageTemplate::kDetachedOperation,
                    "Atomics.store");
   }
+
+  BIND(&is_shared_struct_or_shared_array);
+  {
+    Return(CallRuntime(Runtime::kAtomicsCompareExchangeSharedStructOrArray,
+                       context, maybe_array_or_shared_object,
+                       index_or_field_name, old_value, new_value));
+  }
 }
 
 #define BINOP_BUILTIN(op, method_name)                                        \
diff --git a/deps/v8/src/builtins/builtins-sharedarraybuffer.cc b/deps/v8/src/builtins/builtins-sharedarraybuffer.cc
index ea2fba9bbe55b8..9779bec18ac6ab 100644
--- a/deps/v8/src/builtins/builtins-sharedarraybuffer.cc
+++ b/deps/v8/src/builtins/builtins-sharedarraybuffer.cc
@@ -45,14 +45,15 @@ BUILTIN(AtomicsIsLockFree) {
   Handle<Object> size = args.atOrUndefined(isolate, 1);
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, size,
                                      Object::ToNumber(isolate, size));
-  return *isolate->factory()->ToBoolean(AtomicIsLockFree(size->Number()));
+  return *isolate->factory()->ToBoolean(
+      AtomicIsLockFree(Object::Number(*size)));
 }
 
 // https://tc39.es/ecma262/#sec-validatesharedintegertypedarray
 V8_WARN_UNUSED_RESULT MaybeHandle<JSTypedArray> ValidateIntegerTypedArray(
     Isolate* isolate, Handle<Object> object, const char* method_name,
     bool only_int32_and_big_int64 = false) {
-  if (object->IsJSTypedArray()) {
+  if (IsJSTypedArray(*object)) {
     Handle<JSTypedArray> typed_array = Handle<JSTypedArray>::cast(object);
 
     if (typed_array->IsDetachedOrOutOfBounds()) {
@@ -144,12 +145,12 @@ BUILTIN(AtomicsNotify) {
   //   a. Let intCount be ? ToInteger(count).
   //   b. Let c be max(intCount, 0).
   uint32_t c;
-  if (count->IsUndefined(isolate)) {
+  if (IsUndefined(*count, isolate)) {
     c = kMaxUInt32;
   } else {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, count,
                                        Object::ToInteger(isolate, count));
-    double count_double = count->Number();
+    double count_double = Object::Number(*count);
     if (count_double < 0) {
       count_double = 0;
     } else if (count_double > kMaxUInt32) {
@@ -178,9 +179,9 @@ BUILTIN(AtomicsNotify) {
   return FutexEmulation::Wake(array_buffer, wake_addr, c);
 }
 
-Object DoWait(Isolate* isolate, FutexEmulation::WaitMode mode,
-              Handle<Object> array, Handle<Object> index, Handle<Object> value,
-              Handle<Object> timeout) {
+Tagged<Object> DoWait(Isolate* isolate, FutexEmulation::WaitMode mode,
+                      Handle<Object> array, Handle<Object> index,
+                      Handle<Object> value, Handle<Object> timeout) {
   // 1. Let buffer be ? ValidateIntegerTypedArray(typedArray, true).
   Handle<JSTypedArray> sta;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
@@ -213,14 +214,14 @@ Object DoWait(Isolate* isolate, FutexEmulation::WaitMode mode,
   // 7. Let q be ? ToNumber(timeout).
   // 8. If q is NaN, let t be +∞, else let t be max(q, 0).
   double timeout_number;
-  if (timeout->IsUndefined(isolate)) {
-    timeout_number = ReadOnlyRoots(isolate).infinity_value().Number();
+  if (IsUndefined(*timeout, isolate)) {
+    timeout_number = Object::Number(*ReadOnlyRoots(isolate).infinity_value());
   } else {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, timeout,
                                        Object::ToNumber(isolate, timeout));
-    timeout_number = timeout->Number();
+    timeout_number = Object::Number(*timeout);
     if (std::isnan(timeout_number))
-      timeout_number = ReadOnlyRoots(isolate).infinity_value().Number();
+      timeout_number = Object::Number(*ReadOnlyRoots(isolate).infinity_value());
     else if (timeout_number < 0)
       timeout_number = 0;
   }
diff --git a/deps/v8/src/builtins/builtins-string-gen.cc b/deps/v8/src/builtins/builtins-string-gen.cc
index f6dc59899a13f8..85035f3ef5a87d 100644
--- a/deps/v8/src/builtins/builtins-string-gen.cc
+++ b/deps/v8/src/builtins/builtins-string-gen.cc
@@ -9,6 +9,7 @@
 #include "src/builtins/builtins-utils-gen.h"
 #include "src/builtins/builtins.h"
 #include "src/codegen/code-factory.h"
+#include "src/codegen/code-stub-assembler.h"
 #include "src/execution/protectors.h"
 #include "src/heap/factory-inl.h"
 #include "src/heap/heap-inl.h"
@@ -130,13 +131,17 @@ void StringBuiltinsAssembler::GenerateStringEqual(TNode<String> left,
   TVARIABLE(String, var_left, left);
   TVARIABLE(String, var_right, right);
   Label if_equal(this), if_notequal(this), if_indirect(this, Label::kDeferred),
-      restart(this, {&var_left, &var_right});
+      start(this, {&var_left, &var_right});
+
+  // Callers must handle the case where {lhs} and {rhs} refer to the same
+  // String object.
+  CSA_DCHECK(this, TaggedNotEqual(left, right));
 
   CSA_DCHECK(this, IntPtrEqual(LoadStringLengthAsWord(left), length));
   CSA_DCHECK(this, IntPtrEqual(LoadStringLengthAsWord(right), length));
 
-  Goto(&restart);
-  BIND(&restart);
+  Goto(&start);
+  BIND(&start);
   TNode<String> lhs = var_left.value();
   TNode<String> rhs = var_right.value();
 
@@ -148,11 +153,16 @@ void StringBuiltinsAssembler::GenerateStringEqual(TNode<String> left,
 
   BIND(&if_indirect);
   {
+    Label restart(this, {&var_left, &var_right});
     // Try to unwrap indirect strings, restart the above attempt on success.
     MaybeDerefIndirectStrings(&var_left, lhs_instance_type, &var_right,
                               rhs_instance_type, &restart);
 
     TailCallRuntime(Runtime::kStringEqual, NoContextConstant(), lhs, rhs);
+
+    BIND(&restart);
+    GotoIf(TaggedEqual(var_left.value(), var_right.value()), &if_equal);
+    Goto(&start);
   }
 
   BIND(&if_equal);
@@ -168,8 +178,10 @@ void StringBuiltinsAssembler::StringEqual_Core(
     Label* if_not_equal, Label* if_indirect) {
   CSA_DCHECK(this, WordEqual(LoadStringLengthAsWord(lhs), length));
   CSA_DCHECK(this, WordEqual(LoadStringLengthAsWord(rhs), length));
-  // Fast check to see if {lhs} and {rhs} refer to the same String object.
-  GotoIf(TaggedEqual(lhs, rhs), if_equal);
+
+  // Callers must handle the case where {lhs} and {rhs} refer to the same
+  // String object.
+  CSA_DCHECK(this, TaggedNotEqual(lhs, rhs));
 
   // Combine the instance types into a single 16-bit value, so we can check
   // both of them at once.
@@ -424,25 +436,22 @@ TNode<String> StringBuiltinsAssembler::AllocateConsString(TNode<Uint32T> length,
   // Added string can be a cons string.
   Comment("Allocating ConsString");
   TVARIABLE(String, first, left);
-  TVARIABLE(Int32T, left_instance_type, LoadInstanceType(left));
+  TNode<Int32T> left_instance_type = LoadInstanceType(left);
   Label handle_right(this);
-  GotoIfNot(InstanceTypeEqual(left_instance_type.value(), THIN_STRING_TYPE),
-            &handle_right);
+  static_assert(base::bits::CountPopulation(kThinStringTagBit) == 1);
+  GotoIfNot(IsSetWord32(left_instance_type, kThinStringTagBit), &handle_right);
   {
     first = LoadObjectField<String>(left, ThinString::kActualOffset);
-    left_instance_type = LoadInstanceType(first.value());
     Goto(&handle_right);
   }
 
   BIND(&handle_right);
   TVARIABLE(String, second, right);
-  TVARIABLE(Int32T, right_instance_type, LoadInstanceType(right));
+  TNode<Int32T> right_instance_type = LoadInstanceType(right);
   Label allocate(this);
-  GotoIfNot(InstanceTypeEqual(right_instance_type.value(), THIN_STRING_TYPE),
-            &allocate);
+  GotoIfNot(IsSetWord32(right_instance_type, kThinStringTagBit), &allocate);
   {
     second = LoadObjectField<String>(right, ThinString::kActualOffset);
-    right_instance_type = LoadInstanceType(second.value());
     Goto(&allocate);
   }
 
@@ -452,11 +461,11 @@ TNode<String> StringBuiltinsAssembler::AllocateConsString(TNode<Uint32T> length,
   static_assert(kOneByteStringTag != 0);
   static_assert(kTwoByteStringTag == 0);
   TNode<Int32T> combined_instance_type =
-      Word32And(left_instance_type.value(), right_instance_type.value());
+      Word32And(left_instance_type, right_instance_type);
   TNode<Map> result_map = CAST(Select<Object>(
       IsSetWord32(combined_instance_type, kStringEncodingMask),
       [=] { return ConsOneByteStringMapConstant(); },
-      [=] { return ConsStringMapConstant(); }));
+      [=] { return ConsTwoByteStringMapConstant(); }));
   TNode<HeapObject> result = AllocateInNewSpace(ConsString::kSize);
   StoreMapNoWriteBarrier(result, result_map);
   StoreObjectFieldNoWriteBarrier(result, ConsString::kLengthOffset, length);
@@ -729,27 +738,46 @@ void StringBuiltinsAssembler::GenerateStringRelationalComparison(
 
     // Unrolled first iteration.
     GotoIf(IntPtrEqual(length, IntPtrConstant(0)), &if_done);
-    TNode<Uint32T> lhs_chunk = Load<Uint32T>(lhs, IntPtrConstant(kBeginOffset));
-    TNode<Uint32T> rhs_chunk = Load<Uint32T>(rhs, IntPtrConstant(kBeginOffset));
-    GotoIf(Word32NotEqual(lhs_chunk, rhs_chunk), &char_loop);
-    // We could make the chunk size depend on kTaggedSize, but kTaggedSize > 4
-    // is rare at the time of this writing.
-    constexpr int kChunkSize = sizeof(uint32_t);
+
+    constexpr int kChunkSize = kTaggedSize;
+    static_assert(
+        kChunkSize == ElementSizeInBytes(MachineRepresentation::kWord64) ||
+        kChunkSize == ElementSizeInBytes(MachineRepresentation::kWord32));
+    if (kChunkSize == ElementSizeInBytes(MachineRepresentation::kWord32)) {
+      TNode<Uint32T> lhs_chunk =
+          Load<Uint32T>(lhs, IntPtrConstant(kBeginOffset));
+      TNode<Uint32T> rhs_chunk =
+          Load<Uint32T>(rhs, IntPtrConstant(kBeginOffset));
+      GotoIf(Word32NotEqual(lhs_chunk, rhs_chunk), &char_loop);
+    } else {
+      TNode<Uint64T> lhs_chunk =
+          Load<Uint64T>(lhs, IntPtrConstant(kBeginOffset));
+      TNode<Uint64T> rhs_chunk =
+          Load<Uint64T>(rhs, IntPtrConstant(kBeginOffset));
+      GotoIf(Word64NotEqual(lhs_chunk, rhs_chunk), &char_loop);
+    }
+
     var_offset = IntPtrConstant(SeqOneByteString::kHeaderSize - kHeapObjectTag +
                                 kChunkSize);
 
     Goto(&chunk_loop);
 
-    // Try skipping over chunks of 4 identical characters.
+    // Try skipping over chunks of kChunkSize identical characters.
     // This depends on padding (between strings' lengths and the actual end
     // of the heap object) being zeroed out.
     BIND(&chunk_loop);
     {
       GotoIf(IntPtrGreaterThanOrEqual(var_offset.value(), end), &if_done);
 
-      TNode<Uint32T> lhs_chunk = Load<Uint32T>(lhs, var_offset.value());
-      TNode<Uint32T> rhs_chunk = Load<Uint32T>(rhs, var_offset.value());
-      GotoIf(Word32NotEqual(lhs_chunk, rhs_chunk), &char_loop);
+      if (kChunkSize == ElementSizeInBytes(MachineRepresentation::kWord32)) {
+        TNode<Uint32T> lhs_chunk = Load<Uint32T>(lhs, var_offset.value());
+        TNode<Uint32T> rhs_chunk = Load<Uint32T>(rhs, var_offset.value());
+        GotoIf(Word32NotEqual(lhs_chunk, rhs_chunk), &char_loop);
+      } else {
+        TNode<Uint64T> lhs_chunk = Load<Uint64T>(lhs, var_offset.value());
+        TNode<Uint64T> rhs_chunk = Load<Uint64T>(rhs, var_offset.value());
+        GotoIf(Word64NotEqual(lhs_chunk, rhs_chunk), &char_loop);
+      }
 
       var_offset = IntPtrAdd(var_offset.value(), IntPtrConstant(kChunkSize));
       Goto(&chunk_loop);
@@ -866,6 +894,9 @@ TF_BUILTIN(StringEqual, StringBuiltinsAssembler) {
   auto left = Parameter<String>(Descriptor::kLeft);
   auto right = Parameter<String>(Descriptor::kRight);
   auto length = UncheckedParameter<IntPtrT>(Descriptor::kLength);
+  // Callers must handle the case where {lhs} and {rhs} refer to the same
+  // String object.
+  CSA_DCHECK(this, TaggedNotEqual(left, right));
   GenerateStringEqual(left, right, length);
 }
 
@@ -1029,12 +1060,24 @@ void StringBuiltinsAssembler::MaybeCallFunctionAtSymbol(
     const TNode<Object> maybe_string, Handle<Symbol> symbol,
     DescriptorIndexNameValue additional_property_to_check,
     const NodeFunction0& regexp_call, const NodeFunction1& generic_call) {
-  Label out(this);
+  Label out(this), no_protector(this), object_is_heapobject(this);
   Label get_property_lookup(this);
 
+  // The protector guarantees that that the Number and String wrapper
+  // prototypes do not contain Symbol.{matchAll|replace|split} (aka.
+  // @@matchAll, @@replace @@split).
+  GotoIf(IsNumberStringNotRegexpLikeProtectorCellInvalid(), &no_protector);
+  // Smi is safe thanks to the protector.
+  GotoIf(TaggedIsSmi(object), &out);
+  // String is safe thanks to the protector.
+  GotoIf(IsString(CAST(object)), &out);
+  // HeapNumber is safe thanks to the protector.
+  Branch(IsHeapNumber(CAST(object)), &out, &object_is_heapobject);
+
+  BIND(&no_protector);
   // Smis have to go through the GetProperty lookup in case Number.prototype or
   // Object.prototype was modified.
-  GotoIf(TaggedIsSmi(object), &get_property_lookup);
+  Branch(TaggedIsSmi(object), &get_property_lookup, &object_is_heapobject);
 
   // Take the fast path for RegExps.
   // There's two conditions: {object} needs to be a fast regexp, and
@@ -1043,6 +1086,7 @@ void StringBuiltinsAssembler::MaybeCallFunctionAtSymbol(
   {
     Label stub_call(this), slow_lookup(this);
 
+    BIND(&object_is_heapobject);
     TNode<HeapObject> heap_object = CAST(object);
 
     GotoIf(TaggedIsSmi(maybe_string), &slow_lookup);
@@ -1153,20 +1197,7 @@ TF_BUILTIN(StringPrototypeReplace, StringBuiltinsAssembler) {
   // Redirect to replacer method if {search[@@replace]} is not undefined.
   {
     Label next(this);
-    Label check_for_replace(this);
-
-    // The protector guarantees that that the Number and String wrapper
-    // prototypes do not contain Symbol.replace (aka. @@replace).
-    GotoIf(IsNumberStringPrototypeNoReplaceProtectorCellInvalid(),
-           &check_for_replace);
-    // Smi is safe thanks to the protector.
-    GotoIf(TaggedIsSmi(search), &next);
-    // String is safe thanks to the protector.
-    GotoIf(IsString(CAST(search)), &next);
-    // HeapNumber is safe thanks to the protector.
-    Branch(IsHeapNumber(CAST(search)), &next, &check_for_replace);
-
-    BIND(&check_for_replace);
+
     MaybeCallFunctionAtSymbol(
         context, search, receiver, isolate()->factory()->replace_symbol(),
         DescriptorIndexNameValue{
@@ -1440,8 +1471,8 @@ TNode<JSArray> StringBuiltinsAssembler::StringToArray(
     GotoIfNot(IsOneByteStringInstanceType(to_direct.instance_type()),
               &call_runtime);
 
-    TNode<FixedArray> elements = CAST(AllocateFixedArray(
-        PACKED_ELEMENTS, length, AllocationFlag::kAllowLargeObjectAllocation));
+    TNode<FixedArray> elements =
+        CAST(AllocateFixedArray(PACKED_ELEMENTS, length));
     // Don't allocate anything while {string_data} is live!
     TNode<RawPtrT> string_data =
         to_direct.PointerToData(&fill_thehole_and_call_runtime);
@@ -1733,7 +1764,7 @@ void StringBuiltinsAssembler::BranchIfStringPrimitiveWithNoCustomIteration(
   // Check that the String iterator hasn't been modified in a way that would
   // affect iteration.
   TNode<PropertyCell> protector_cell = StringIteratorProtectorConstant();
-  DCHECK(isolate()->heap()->string_iterator_protector().IsPropertyCell());
+  DCHECK(i::IsPropertyCell(isolate()->heap()->string_iterator_protector()));
   Branch(
       TaggedEqual(LoadObjectField(protector_cell, PropertyCell::kValueOffset),
                   SmiConstant(Protectors::kProtectorValid)),
@@ -1762,7 +1793,6 @@ void StringBuiltinsAssembler::CopyStringCharacters(
   // faked sequential strings when handling external subject strings.
   bool from_one_byte = from_encoding == String::ONE_BYTE_ENCODING;
   bool to_one_byte = to_encoding == String::ONE_BYTE_ENCODING;
-  DCHECK_IMPLIES(to_one_byte, from_one_byte);
   Comment("CopyStringCharacters ",
           from_one_byte ? "ONE_BYTE_ENCODING" : "TWO_BYTE_ENCODING", " -> ",
           to_one_byte ? "ONE_BYTE_ENCODING" : "TWO_BYTE_ENCODING");
@@ -1779,7 +1809,7 @@ void StringBuiltinsAssembler::CopyStringCharacters(
       ElementOffsetFromIndex(character_count, from_kind);
   TNode<IntPtrT> limit_offset = IntPtrAdd(from_offset, byte_count);
 
-  // Prepare the fast loop
+  // Prepare the fast loop.
   MachineType type =
       from_one_byte ? MachineType::Uint8() : MachineType::Uint16();
   MachineRepresentation rep = to_one_byte ? MachineRepresentation::kWord8
@@ -1798,9 +1828,18 @@ void StringBuiltinsAssembler::CopyStringCharacters(
   BuildFastLoop<IntPtrT>(
       vars, from_offset, limit_offset,
       [&](TNode<IntPtrT> offset) {
+        compiler::Node* value = Load(type, from_string, offset);
+#if DEBUG
+        // Copying two-byte characters to one-byte is okay if callers have
+        // checked that this loses no information.
+        if (v8_flags.debug_code && !from_one_byte && to_one_byte) {
+          CSA_DCHECK(this, Uint32LessThanOrEqual(UncheckedCast<Uint32T>(value),
+                                                 Uint32Constant(0xFF)));
+        }
+#endif
         StoreNoWriteBarrier(rep, to_string,
                             index_same ? offset : current_to_offset.value(),
-                            Load(type, from_string, offset));
+                            value);
         if (!index_same) {
           Increment(&current_to_offset, to_increment);
         }
@@ -1838,13 +1877,87 @@ TNode<String> StringBuiltinsAssembler::AllocAndCopyStringCharacters(
   // The subject string is a sequential two-byte string.
   BIND(&two_byte_sequential);
   {
-    TNode<String> result = AllocateSeqTwoByteString(
-        Unsigned(TruncateIntPtrToInt32(character_count)));
-    CopyStringCharacters<T>(from, result, from_index, IntPtrConstant(0),
-                            character_count, String::TWO_BYTE_ENCODING,
-                            String::TWO_BYTE_ENCODING);
-    var_result = result;
-    Goto(&end);
+    // Check if the to-be-copied range happens to contain only one-byte
+    // characters, and copy it to a one-byte string if so.
+    // If the range is long enough, we check 8 characters at a time, to reduce
+    // the amount of branching.
+    // For a more readable version of this logic, see {StringFromTwoByteSlice}
+    // in wasm.tq.
+    TNode<IntPtrT> start_offset =
+        ElementOffsetFromIndex(from_index, UINT16_ELEMENTS,
+                               SeqTwoByteString::kHeaderSize - kHeapObjectTag);
+    TNode<IntPtrT> end_offset = IntPtrAdd(
+        start_offset, ElementOffsetFromIndex(character_count, UINT16_ELEMENTS));
+    TNode<IntPtrT> eight_char_loop_end = IntPtrSub(
+        end_offset, ElementOffsetFromIndex(IntPtrConstant(8), UINT16_ELEMENTS));
+
+    TVARIABLE(IntPtrT, var_cursor, start_offset);
+    TNode<RawPtrT> raw_from;
+    if constexpr (std::is_same_v<T, RawPtrT>) {
+      raw_from = from;
+    } else {
+      raw_from = ReinterpretCast<RawPtrT>(BitcastTaggedToWord(from));
+    }
+    Label first_loop(this, &var_cursor), second_loop(this, &var_cursor);
+    Label twobyte(this);
+    Branch(IntPtrLessThanOrEqual(start_offset, eight_char_loop_end),
+           &first_loop, &second_loop);
+    BIND(&first_loop);
+    {
+      TNode<RawPtrT> chunk = RawPtrAdd(raw_from, var_cursor.value());
+      TNode<Uint32T> c1 = Load<Uint16T>(chunk);
+      TNode<Uint32T> c2 = Load<Uint16T>(chunk, IntPtrConstant(2));
+      TNode<Uint32T> bits = Word32Or(c1, c2);
+      TNode<Uint32T> c3 = Load<Uint16T>(chunk, IntPtrConstant(4));
+      bits = Word32Or(bits, c3);
+      TNode<Uint32T> c4 = Load<Uint16T>(chunk, IntPtrConstant(6));
+      bits = Word32Or(bits, c4);
+      TNode<Uint32T> c5 = Load<Uint16T>(chunk, IntPtrConstant(8));
+      bits = Word32Or(bits, c5);
+      TNode<Uint32T> c6 = Load<Uint16T>(chunk, IntPtrConstant(10));
+      bits = Word32Or(bits, c6);
+      TNode<Uint32T> c7 = Load<Uint16T>(chunk, IntPtrConstant(12));
+      bits = Word32Or(bits, c7);
+      TNode<Uint32T> c8 = Load<Uint16T>(chunk, IntPtrConstant(14));
+      bits = Word32Or(bits, c8);
+      GotoIf(Uint32GreaterThan(bits, Uint32Constant(0xFF)), &twobyte);
+      Increment(&var_cursor, 8 * sizeof(uint16_t));
+      Branch(IntPtrLessThanOrEqual(var_cursor.value(), eight_char_loop_end),
+             &first_loop, &second_loop);
+    }
+
+    BIND(&second_loop);
+    TVARIABLE(Uint32T, var_bits, Uint32Constant(0));
+    VariableList vars({&var_bits}, zone());
+    FastLoopBody<IntPtrT> one_char_loop = [&](TNode<IntPtrT> offset) {
+      TNode<Uint32T> c = Load<Uint16T>(from, offset);
+      var_bits = Word32Or(var_bits.value(), c);
+    };
+    BuildFastLoop<IntPtrT>(vars, var_cursor, var_cursor.value(), end_offset,
+                           one_char_loop, sizeof(uint16_t),
+                           LoopUnrollingMode::kNo, IndexAdvanceMode::kPost);
+    GotoIf(Uint32GreaterThan(var_bits.value(), Uint32Constant(0xFF)), &twobyte);
+    // Fallthrough: only one-byte characters in the to-be-copied range.
+    {
+      TNode<String> result = AllocateSeqOneByteString(
+          Unsigned(TruncateIntPtrToInt32(character_count)));
+      CopyStringCharacters<T>(from, result, from_index, IntPtrConstant(0),
+                              character_count, String::TWO_BYTE_ENCODING,
+                              String::ONE_BYTE_ENCODING);
+      var_result = result;
+      Goto(&end);
+    }
+
+    BIND(&twobyte);
+    {
+      TNode<String> result = AllocateSeqTwoByteString(
+          Unsigned(TruncateIntPtrToInt32(character_count)));
+      CopyStringCharacters<T>(from, result, from_index, IntPtrConstant(0),
+                              character_count, String::TWO_BYTE_ENCODING,
+                              String::TWO_BYTE_ENCODING);
+      var_result = result;
+      Goto(&end);
+    }
   }
 
   BIND(&end);
diff --git a/deps/v8/src/builtins/builtins-string-gen.h b/deps/v8/src/builtins/builtins-string-gen.h
index 267dc9d9b778b2..2f0f139aa6097e 100644
--- a/deps/v8/src/builtins/builtins-string-gen.h
+++ b/deps/v8/src/builtins/builtins-string-gen.h
@@ -6,6 +6,7 @@
 #define V8_BUILTINS_BUILTINS_STRING_GEN_H_
 
 #include "src/codegen/code-stub-assembler.h"
+#include "src/objects/string.h"
 
 namespace v8 {
 namespace internal {
@@ -122,9 +123,6 @@ class StringBuiltinsAssembler : public CodeStubAssembler {
                                           TNode<String> right,
                                           StringComparison op);
 
-  using StringAtAccessor = std::function<TNode<Object>(
-      TNode<String> receiver, TNode<IntPtrT> length, TNode<IntPtrT> index)>;
-
   const TNode<Smi> IndexOfDollarChar(const TNode<Context> context,
                                      const TNode<String> string);
 
diff --git a/deps/v8/src/builtins/builtins-string.cc b/deps/v8/src/builtins/builtins-string.cc
index d94976bab213f1..db193bdf8bd7a9 100644
--- a/deps/v8/src/builtins/builtins-string.cc
+++ b/deps/v8/src/builtins/builtins-string.cc
@@ -24,17 +24,16 @@ namespace internal {
 namespace {  // for String.fromCodePoint
 
 bool IsValidCodePoint(Isolate* isolate, Handle<Object> value) {
-  if (!value->IsNumber() &&
-      !Object::ToNumber(isolate, value).ToHandle(&value)) {
+  if (!IsNumber(*value) && !Object::ToNumber(isolate, value).ToHandle(&value)) {
     return false;
   }
 
-  if (Object::ToInteger(isolate, value).ToHandleChecked()->Number() !=
-      value->Number()) {
+  if (Object::Number(*Object::ToInteger(isolate, value).ToHandleChecked()) !=
+      Object::Number(*value)) {
     return false;
   }
 
-  if (value->Number() < 0 || value->Number() > 0x10FFFF) {
+  if (Object::Number(*value) < 0 || Object::Number(*value) > 0x10FFFF) {
     return false;
   }
 
@@ -52,7 +51,7 @@ base::uc32 NextCodePoint(Isolate* isolate, BuiltinArguments args, int index) {
         MessageTemplate::kInvalidCodePoint, value));
     return kInvalidCodePoint;
   }
-  return DoubleToUint32(value->Number());
+  return DoubleToUint32(Object::Number(*value));
 }
 
 }  // namespace
@@ -211,7 +210,7 @@ BUILTIN(StringPrototypeNormalize) {
   TO_THIS_STRING(string, "String.prototype.normalize");
 
   Handle<Object> form_input = args.atOrUndefined(isolate, 1);
-  if (form_input->IsUndefined(isolate)) return *string;
+  if (IsUndefined(*form_input, isolate)) return *string;
 
   Handle<String> form;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, form,
@@ -266,7 +265,7 @@ V8_WARN_UNUSED_RESULT static Object ConvertCaseHelper(
   unibrow::uchar chars[Converter::kMaxWidth];
   // We can assume that the string is not empty
   base::uc32 current = stream.GetNext();
-  bool ignore_overflow = Converter::kIsToLower || result.IsSeqTwoByteString();
+  bool ignore_overflow = Converter::kIsToLower || IsSeqTwoByteString(result);
   for (int i = 0; i < result_length;) {
     bool has_next = stream.HasMore();
     base::uc32 next = has_next ? stream.GetNext() : 0;
@@ -381,9 +380,9 @@ V8_WARN_UNUSED_RESULT static Object ConvertCase(
   }
 
   Object answer = ConvertCaseHelper(isolate, *s, *result, length, mapping);
-  if (answer.IsException(isolate) || answer.IsString()) return answer;
+  if (IsException(answer, isolate) || IsString(answer)) return answer;
 
-  DCHECK(answer.IsSmi());
+  DCHECK(IsSmi(answer));
   length = Smi::ToInt(answer);
   if (s->IsOneByteRepresentation() && length > 0) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
@@ -455,7 +454,7 @@ BUILTIN(StringRaw) {
   IncrementalStringBuilder result_builder(isolate);
   // Intentional spec violation: we ignore {length} values >= 2^32, because
   // assuming non-empty chunks they would generate too-long strings anyway.
-  const double raw_len_number = raw_len->Number();
+  const double raw_len_number = Object::Number(*raw_len);
   const uint32_t length = raw_len_number > std::numeric_limits<uint32_t>::max()
                               ? std::numeric_limits<uint32_t>::max()
                               : static_cast<uint32_t>(raw_len_number);
diff --git a/deps/v8/src/builtins/builtins-string.tq b/deps/v8/src/builtins/builtins-string.tq
index f04ec2891b6971..2657f1b9968743 100644
--- a/deps/v8/src/builtins/builtins-string.tq
+++ b/deps/v8/src/builtins/builtins-string.tq
@@ -47,20 +47,18 @@ transitioning macro ToString_Inline(context: Context, o: JSAny): String {
   return ToStringImpl(context, o);
 }
 
-extern macro StringBuiltinsAssembler::SubString(
-    String, uintptr, uintptr): String;
+extern macro StringBuiltinsAssembler::SubString(String, uintptr, uintptr):
+    String;
 
 // ES6 #sec-string.prototype.tostring
-transitioning javascript builtin
-StringPrototypeToString(
+transitioning javascript builtin StringPrototypeToString(
     js-implicit context: NativeContext, receiver: JSAny)(): JSAny {
   return ToThisValue(
       receiver, PrimitiveType::kString, 'String.prototype.toString');
 }
 
 // ES6 #sec-string.prototype.valueof
-transitioning javascript builtin
-StringPrototypeValueOf(
+transitioning javascript builtin StringPrototypeValueOf(
     js-implicit context: NativeContext, receiver: JSAny)(): JSAny {
   return ToThisValue(
       receiver, PrimitiveType::kString, 'String.prototype.valueOf');
@@ -79,9 +77,8 @@ transitioning builtin StringToList(implicit context: Context)(string: String):
 
   const nativeContext = LoadNativeContext(context);
   const map: Map = LoadJSArrayElementsMap(kind, nativeContext);
-  const array: JSArray = AllocateJSArray(
-      kind, map, stringLength, SmiTag(stringLength),
-      AllocationFlag::kAllowLargeObjectAllocation);
+  const array: JSArray =
+      AllocateJSArray(kind, map, stringLength, SmiTag(stringLength));
   const elements = UnsafeCast<FixedArray>(array.elements);
   const encoding = UnicodeEncoding::UTF16;
   let arrayLength: Smi = 0;
@@ -101,8 +98,8 @@ transitioning builtin StringToList(implicit context: Context)(string: String):
   return array;
 }
 
-transitioning macro GenerateStringAt(implicit context: Context)(
-    receiver: JSAny, position: JSAny,
+transitioning macro GenerateStringAt(
+    implicit context: Context)(receiver: JSAny, position: JSAny,
     methodName: constexpr string): never labels
 IfInBounds(String, uintptr, uintptr), IfOutOfBounds {
   // 1. Let O be ? RequireObjectCoercible(this value).
@@ -135,8 +132,8 @@ IfInBounds(String, uintptr, uintptr), IfOutOfBounds {
 
 // ES6 #sec-string.prototype.charat
 transitioning javascript builtin StringPrototypeCharAt(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(position: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    position: JSAny): JSAny {
   try {
     GenerateStringAt(receiver, position, 'String.prototype.charAt')
         otherwise IfInBounds, IfOutOfBounds;
@@ -150,8 +147,8 @@ transitioning javascript builtin StringPrototypeCharAt(
 
 // ES6 #sec-string.prototype.charcodeat
 transitioning javascript builtin StringPrototypeCharCodeAt(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(position: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    position: JSAny): JSAny {
   try {
     GenerateStringAt(receiver, position, 'String.prototype.charCodeAt')
         otherwise IfInBounds, IfOutOfBounds;
@@ -165,8 +162,8 @@ transitioning javascript builtin StringPrototypeCharCodeAt(
 
 // ES6 #sec-string.prototype.codepointat
 transitioning javascript builtin StringPrototypeCodePointAt(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(position: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    position: JSAny): JSAny {
   try {
     GenerateStringAt(receiver, position, 'String.prototype.codePointAt')
         otherwise IfInBounds, IfOutOfBounds;
@@ -197,8 +194,8 @@ transitioning javascript builtin StringPrototypeConcat(
   return string;
 }
 
-extern transitioning runtime
-SymbolDescriptiveString(implicit context: Context)(Symbol): String;
+extern transitioning runtime SymbolDescriptiveString(
+    implicit context: Context)(Symbol): String;
 
 // ES #sec-string-constructor
 // https://tc39.github.io/ecma262/#sec-string-constructor
@@ -239,18 +236,18 @@ transitioning javascript builtin StringConstructor(
   return obj;
 }
 
-transitioning builtin StringAddConvertLeft(implicit context: Context)(
-    left: JSAny, right: String): String {
+transitioning builtin StringAddConvertLeft(
+    implicit context: Context)(left: JSAny, right: String): String {
   return ToStringImpl(context, ToPrimitiveDefault(left)) + right;
 }
 
-transitioning builtin StringAddConvertRight(implicit context: Context)(
-    left: String, right: JSAny): String {
+transitioning builtin StringAddConvertRight(
+    implicit context: Context)(left: String, right: JSAny): String {
   return left + ToStringImpl(context, ToPrimitiveDefault(right));
 }
 
-builtin StringCharAt(implicit context: Context)(
-    receiver: String, position: uintptr): String {
+builtin StringCharAt(
+    implicit context: Context)(receiver: String, position: uintptr): String {
   // Load the character code at the {position} from the {receiver}.
   const code: char16 = StringCharCodeAt(receiver, position);
   // And return the single character string with only that {code}
diff --git a/deps/v8/src/builtins/builtins-struct.cc b/deps/v8/src/builtins/builtins-struct.cc
index 626fd2b916ad88..338becc89462b3 100644
--- a/deps/v8/src/builtins/builtins-struct.cc
+++ b/deps/v8/src/builtins/builtins-struct.cc
@@ -25,8 +25,8 @@ struct NameHandleHasher {
 
 struct UniqueNameHandleEqual {
   bool operator()(Handle<Name> x, Handle<Name> y) const {
-    DCHECK(x->IsUniqueName());
-    DCHECK(y->IsUniqueName());
+    DCHECK(IsUniqueName(*x));
+    DCHECK(IsUniqueName(*y));
     return *x == *y;
   }
 };
@@ -36,6 +36,72 @@ using UniqueNameHandleSet =
 
 }  // namespace
 
+BUILTIN(SharedSpaceJSObjectHasInstance) {
+  HandleScope scope(isolate);
+  Handle<Object> constructor = args.receiver();
+  if (!IsJSFunction(*constructor)) {
+    return *isolate->factory()->false_value();
+  }
+
+  bool result;
+  MAYBE_ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
+      isolate, result,
+      AlwaysSharedSpaceJSObject::HasInstance(
+          isolate, Handle<JSFunction>::cast(constructor),
+          args.atOrUndefined(isolate, 1)));
+  return *isolate->factory()->ToBoolean(result);
+}
+
+namespace {
+Maybe<bool> CollectFieldsAndElements(Isolate* isolate,
+                                     Handle<JSReceiver> property_names,
+                                     int num_properties,
+                                     std::vector<Handle<Name>>& field_names,
+                                     std::set<uint32_t>& element_names) {
+  Handle<Object> raw_property_name;
+  Handle<Name> property_name;
+  UniqueNameHandleSet field_names_set;
+  for (int i = 0; i < num_properties; i++) {
+    ASSIGN_RETURN_ON_EXCEPTION_VALUE(
+        isolate, raw_property_name,
+        JSReceiver::GetElement(isolate, property_names, i), Nothing<bool>());
+    ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, property_name,
+                                     Object::ToName(isolate, raw_property_name),
+                                     Nothing<bool>());
+
+    bool is_duplicate;
+    size_t index;
+    if (!property_name->AsIntegerIndex(&index) ||
+        index > JSObject::kMaxElementIndex) {
+      property_name = isolate->factory()->InternalizeName(property_name);
+
+      // TODO(v8:12547): Support Symbols?
+      if (IsSymbol(*property_name)) {
+        THROW_NEW_ERROR_RETURN_VALUE(
+            isolate, NewTypeError(MessageTemplate::kSymbolToString),
+            Nothing<bool>());
+      }
+
+      is_duplicate = !field_names_set.insert(property_name).second;
+      // Keep the field names in the original order.
+      if (!is_duplicate) field_names.push_back(property_name);
+    } else {
+      is_duplicate = !element_names.insert(static_cast<uint32_t>(index)).second;
+    }
+
+    if (is_duplicate) {
+      THROW_NEW_ERROR_RETURN_VALUE(
+          isolate,
+          NewTypeError(MessageTemplate::kDuplicateTemplateProperty,
+                       property_name),
+          Nothing<bool>());
+    }
+  }
+
+  return Just(true);
+}
+}  // namespace
+
 BUILTIN(SharedStructTypeConstructor) {
   DCHECK(v8_flags.shared_string_table);
 
@@ -43,17 +109,17 @@ BUILTIN(SharedStructTypeConstructor) {
   static const char method_name[] = "SharedStructType";
   auto* factory = isolate->factory();
 
-  Handle<JSReceiver> field_names_arg;
+  Handle<JSReceiver> property_names_arg;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
-      isolate, field_names_arg,
+      isolate, property_names_arg,
       Object::ToObject(isolate, args.atOrUndefined(isolate, 1), method_name));
 
-  // Treat field_names_arg as arraylike.
+  // Treat property_names_arg as arraylike.
   Handle<Object> raw_length_number;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, raw_length_number,
-      Object::GetLengthFromArrayLike(isolate, field_names_arg));
-  double num_properties_double = raw_length_number->Number();
+      Object::GetLengthFromArrayLike(isolate, property_names_arg));
+  double num_properties_double = Object::Number(*raw_length_number);
   if (num_properties_double < 0 || num_properties_double > kMaxJSStructFields) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewRangeError(MessageTemplate::kStructFieldCountOutOfRange));
@@ -61,45 +127,46 @@ BUILTIN(SharedStructTypeConstructor) {
   int num_properties = static_cast<int>(num_properties_double);
 
   Handle<DescriptorArray> maybe_descriptors;
+  Handle<NumberDictionary> elements_template;
+  int num_fields = 0;
   if (num_properties != 0) {
-    maybe_descriptors = factory->NewDescriptorArray(num_properties, 0,
-                                                    AllocationType::kSharedOld);
-
-    // Build up the descriptor array.
-    UniqueNameHandleSet all_field_names;
-    for (int i = 0; i < num_properties; ++i) {
-      Handle<Object> raw_field_name;
-      ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
-          isolate, raw_field_name,
-          JSReceiver::GetElement(isolate, field_names_arg, i));
-      Handle<Name> field_name;
-      ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
-          isolate, field_name, Object::ToName(isolate, raw_field_name));
-      field_name = factory->InternalizeName(field_name);
-
-      // TOOD(v8:12547): Support Symbols?
-      if (field_name->IsSymbol()) {
-        THROW_NEW_ERROR_RETURN_FAILURE(
-            isolate, NewTypeError(MessageTemplate::kSymbolToString));
-      }
+    std::vector<Handle<Name>> field_names;
+    std::set<uint32_t> element_names;
+    MAYBE_RETURN(
+        CollectFieldsAndElements(isolate, property_names_arg, num_properties,
+                                 field_names, element_names),
+        ReadOnlyRoots(isolate).exception());
 
-      // Check that there are no duplicates.
-      const bool is_duplicate = !all_field_names.insert(field_name).second;
-      if (is_duplicate) {
-        THROW_NEW_ERROR_RETURN_FAILURE(
-            isolate, NewTypeError(MessageTemplate::kDuplicateTemplateProperty,
-                                  field_name));
+    if (!field_names.empty()) {
+      maybe_descriptors = factory->NewDescriptorArray(
+          static_cast<int>(field_names.size()), 0, AllocationType::kSharedOld);
+      for (const Handle<Name>& field_name : field_names) {
+        // Shared structs' fields need to be aligned, so make it all tagged.
+        PropertyDetails details(
+            PropertyKind::kData, SEALED, PropertyLocation::kField,
+            PropertyConstness::kMutable, Representation::Tagged(), num_fields);
+        maybe_descriptors->Set(InternalIndex(num_fields), *field_name,
+                               MaybeObject::FromObject(FieldType::Any()),
+                               details);
+        num_fields++;
       }
+      maybe_descriptors->Sort();
+    }
 
-      // Shared structs' fields need to be aligned, so make it all tagged.
-      PropertyDetails details(
-          PropertyKind::kData, SEALED, PropertyLocation::kField,
-          PropertyConstness::kMutable, Representation::Tagged(), i);
-      maybe_descriptors->Set(InternalIndex(i), *field_name,
-                             MaybeObject::FromObject(FieldType::Any()),
-                             details);
+    if (!element_names.empty()) {
+      int nof_elements = static_cast<int>(element_names.size());
+      elements_template = NumberDictionary::New(isolate, nof_elements,
+                                                AllocationType::kSharedOld);
+      for (uint32_t index : element_names) {
+        PropertyDetails details(PropertyKind::kData, SEALED,
+                                PropertyConstness::kMutable, 0);
+        NumberDictionary::UncheckedAdd<Isolate, AllocationType::kSharedOld>(
+            isolate, elements_template, index,
+            ReadOnlyRoots(isolate).undefined_value_handle(), details);
+      }
+      elements_template->SetInitialNumberOfElements(nof_elements);
+      DCHECK(elements_template->InAnySharedSpace());
     }
-    maybe_descriptors->Sort();
   }
 
   Handle<SharedFunctionInfo> info =
@@ -117,42 +184,77 @@ BUILTIN(SharedStructTypeConstructor) {
   int instance_size;
   int in_object_properties;
   JSFunction::CalculateInstanceSizeHelper(JS_SHARED_STRUCT_TYPE, false, 0,
-                                          num_properties, &instance_size,
+                                          num_fields, &instance_size,
                                           &in_object_properties);
-  Handle<Map> instance_map = factory->NewMap(
-      JS_SHARED_STRUCT_TYPE, instance_size, TERMINAL_FAST_ELEMENTS_KIND,
-      in_object_properties, AllocationType::kSharedMap);
+  Handle<Map> instance_map =
+      factory->NewMap(JS_SHARED_STRUCT_TYPE, instance_size, DICTIONARY_ELEMENTS,
+                      in_object_properties, AllocationType::kSharedMap);
+  if (num_fields == 0) {
+    AlwaysSharedSpaceJSObject::PrepareMapNoEnumerableProperties(*instance_map);
+  } else {
+    AlwaysSharedSpaceJSObject::PrepareMapWithEnumerableProperties(
+        isolate, instance_map, maybe_descriptors, num_fields);
+  }
 
   // Structs have fixed layout ahead of time, so there's no slack.
-  int out_of_object_properties = num_properties - in_object_properties;
-  if (out_of_object_properties == 0) {
-    instance_map->SetInObjectUnusedPropertyFields(0);
-  } else {
+  int out_of_object_properties = num_fields - in_object_properties;
+  if (out_of_object_properties != 0) {
     instance_map->SetOutOfObjectUnusedPropertyFields(0);
   }
-  instance_map->set_is_extensible(false);
-  JSFunction::SetInitialMap(isolate, constructor, instance_map,
-                            factory->null_value(), factory->null_value());
-  constructor->map().SetConstructor(ReadOnlyRoots(isolate).null_value());
-  constructor->map().set_has_non_instance_prototype(true);
-
-  // Pre-create the enum cache in the shared space, as otherwise for-in
-  // enumeration will incorrectly create an enum cache in the per-thread heap.
-  if (num_properties == 0) {
-    instance_map->SetEnumLength(0);
-  } else {
-    instance_map->InitializeDescriptors(isolate, *maybe_descriptors);
-    FastKeyAccumulator::InitializeFastPropertyEnumCache(
-        isolate, instance_map, num_properties, AllocationType::kSharedOld);
-    DCHECK_EQ(num_properties, instance_map->EnumLength());
+  constructor->set_prototype_or_initial_map(*instance_map, kReleaseStore);
+
+  int num_elements = num_properties - num_fields;
+  if (num_elements != 0) {
+    DCHECK(elements_template->InAnySharedSpace());
+    // Abuse the class fields private symbol to store the elements template on
+    // shared struct constructors.
+    // TODO(v8:12547): Find a better place to store this.
+    JSObject::AddProperty(isolate, constructor, factory->class_fields_symbol(),
+                          elements_template, NONE);
   }
 
+  JSObject::AddProperty(
+      isolate, constructor, factory->has_instance_symbol(),
+      handle(isolate->native_context()->shared_space_js_object_has_instance(),
+             isolate),
+      static_cast<PropertyAttributes>(DONT_ENUM | DONT_DELETE | READ_ONLY));
+
   return *constructor;
 }
 
 BUILTIN(SharedStructConstructor) {
   HandleScope scope(isolate);
-  return *isolate->factory()->NewJSSharedStruct(args.target());
+  Handle<Object> elements_template;
+  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
+      isolate, elements_template,
+      JSReceiver::GetProperty(isolate, args.target(),
+                              isolate->factory()->class_fields_symbol()));
+  return *isolate->factory()->NewJSSharedStruct(args.target(),
+                                                elements_template);
+}
+
+BUILTIN(SharedArrayIsSharedArray) {
+  HandleScope scope(isolate);
+  return isolate->heap()->ToBoolean(
+      IsJSSharedArray(*args.atOrUndefined(isolate, 1)));
+}
+
+BUILTIN(SharedStructTypeIsSharedStruct) {
+  HandleScope scope(isolate);
+  return isolate->heap()->ToBoolean(
+      IsJSSharedStruct(*args.atOrUndefined(isolate, 1)));
+}
+
+BUILTIN(AtomicsMutexIsMutex) {
+  HandleScope scope(isolate);
+  return isolate->heap()->ToBoolean(
+      IsJSAtomicsMutex(*args.atOrUndefined(isolate, 1)));
+}
+
+BUILTIN(AtomicsConditionIsCondition) {
+  HandleScope scope(isolate);
+  return isolate->heap()->ToBoolean(
+      IsJSAtomicsCondition(*args.atOrUndefined(isolate, 1)));
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/builtins/builtins-symbol.cc b/deps/v8/src/builtins/builtins-symbol.cc
index 682563ddcf417c..be8bd19d3b6622 100644
--- a/deps/v8/src/builtins/builtins-symbol.cc
+++ b/deps/v8/src/builtins/builtins-symbol.cc
@@ -17,7 +17,7 @@ namespace internal {
 // ES #sec-symbol-constructor
 BUILTIN(SymbolConstructor) {
   HandleScope scope(isolate);
-  if (!args.new_target()->IsUndefined(isolate)) {  // [[Construct]]
+  if (!IsUndefined(*args.new_target(), isolate)) {  // [[Construct]]
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotConstructor,
                               isolate->factory()->Symbol_string()));
@@ -25,7 +25,7 @@ BUILTIN(SymbolConstructor) {
   // [[Call]]
   Handle<Symbol> result = isolate->factory()->NewSymbol();
   Handle<Object> description = args.atOrUndefined(isolate, 1);
-  if (!description->IsUndefined(isolate)) {
+  if (!IsUndefined(*description, isolate)) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, description,
                                        Object::ToString(isolate, description));
     result->set_description(String::cast(*description));
@@ -47,20 +47,20 @@ BUILTIN(SymbolFor) {
 BUILTIN(SymbolKeyFor) {
   HandleScope scope(isolate);
   Handle<Object> obj = args.atOrUndefined(isolate, 1);
-  if (!obj->IsSymbol()) {
+  if (!IsSymbol(*obj)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kSymbolKeyFor, obj));
   }
   Handle<Symbol> symbol = Handle<Symbol>::cast(obj);
   DisallowGarbageCollection no_gc;
-  Object result;
+  Tagged<Object> result;
   if (symbol->is_in_public_symbol_table()) {
     result = symbol->description();
-    DCHECK(result.IsString());
+    DCHECK(IsString(result));
   } else {
     result = ReadOnlyRoots(isolate).undefined_value();
   }
-  DCHECK_EQ(isolate->heap()->public_symbol_table().SlowReverseLookup(*symbol),
+  DCHECK_EQ(isolate->heap()->public_symbol_table()->SlowReverseLookup(*symbol),
             result);
   return result;
 }
diff --git a/deps/v8/src/builtins/builtins-temporal.cc b/deps/v8/src/builtins/builtins-temporal.cc
index 449621c8df2c29..be1265f817bc53 100644
--- a/deps/v8/src/builtins/builtins-temporal.cc
+++ b/deps/v8/src/builtins/builtins-temporal.cc
@@ -156,7 +156,7 @@ namespace internal {
         BigInt::Divide(isolate, Handle<BigInt>(handle->field(), isolate), \
                        BigInt::FromUint64(isolate, scale)));              \
     Handle<Object> number = BigInt::ToNumber(isolate, value);             \
-    DCHECK(std::isfinite(number->Number()));                              \
+    DCHECK(std::isfinite(Object::Number(*number)));                       \
     return *number;                                                       \
   }
 
diff --git a/deps/v8/src/builtins/builtins-trace.cc b/deps/v8/src/builtins/builtins-trace.cc
index 22941ddb0ffdb7..59fdcf661a7447 100644
--- a/deps/v8/src/builtins/builtins-trace.cc
+++ b/deps/v8/src/builtins/builtins-trace.cc
@@ -107,7 +107,7 @@ const uint8_t* GetCategoryGroupEnabled(Isolate* isolate,
 BUILTIN(IsTraceCategoryEnabled) {
   HandleScope scope(isolate);
   Handle<Object> category = args.atOrUndefined(isolate, 1);
-  if (!category->IsString()) {
+  if (!IsString(*category)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kTraceEventCategoryError));
   }
@@ -144,29 +144,29 @@ BUILTIN(Trace) {
   if (!*category_group_enabled) return ReadOnlyRoots(isolate).false_value();
 #endif
 
-  if (!phase_arg->IsNumber()) {
+  if (!IsNumber(*phase_arg)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kTraceEventPhaseError));
   }
-  char phase = static_cast<char>(DoubleToInt32(phase_arg->Number()));
-  if (!category->IsString()) {
+  char phase = static_cast<char>(DoubleToInt32(Object::Number(*phase_arg)));
+  if (!IsString(*category)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kTraceEventCategoryError));
   }
-  if (!name_arg->IsString()) {
+  if (!IsString(*name_arg)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kTraceEventNameError));
   }
 
   uint32_t flags = TRACE_EVENT_FLAG_COPY;
   int32_t id = 0;
-  if (!id_arg->IsNullOrUndefined(isolate)) {
-    if (!id_arg->IsNumber()) {
+  if (!IsNullOrUndefined(*id_arg, isolate)) {
+    if (!IsNumber(*id_arg)) {
       THROW_NEW_ERROR_RETURN_FAILURE(
           isolate, NewTypeError(MessageTemplate::kTraceEventIDError));
     }
     flags |= TRACE_EVENT_FLAG_HAS_ID;
-    id = DoubleToInt32(id_arg->Number());
+    id = DoubleToInt32(Object::Number(*id_arg));
   }
 
   Handle<String> name_str = Handle<String>::cast(name_arg);
@@ -181,7 +181,7 @@ BUILTIN(Trace) {
   static const char* arg_name = "data";
   Handle<Object> arg_json;
   int32_t num_args = 0;
-  if (!data_arg->IsUndefined(isolate)) {
+  if (!IsUndefined(*data_arg, isolate)) {
     // Serializes the data argument as a JSON string, which is then
     // copied into an object. This eliminates duplicated code but
     // could have perf costs. It is also subject to all the same
diff --git a/deps/v8/src/builtins/builtins-typed-array.cc b/deps/v8/src/builtins/builtins-typed-array.cc
index eb4eea831f0788..4d41333588567d 100644
--- a/deps/v8/src/builtins/builtins-typed-array.cc
+++ b/deps/v8/src/builtins/builtins-typed-array.cc
@@ -27,13 +27,13 @@ BUILTIN(TypedArrayPrototypeBuffer) {
 namespace {
 
 int64_t CapRelativeIndex(Handle<Object> num, int64_t minimum, int64_t maximum) {
-  if (V8_LIKELY(num->IsSmi())) {
+  if (V8_LIKELY(IsSmi(*num))) {
     int64_t relative = Smi::ToInt(*num);
     return relative < 0 ? std::max<int64_t>(relative + maximum, minimum)
                         : std::min<int64_t>(relative, maximum);
   } else {
-    DCHECK(num->IsHeapNumber());
-    double relative = HeapNumber::cast(*num).value();
+    DCHECK(IsHeapNumber(*num));
+    double relative = HeapNumber::cast(*num)->value();
     DCHECK(!std::isnan(relative));
     return static_cast<int64_t>(
         relative < 0 ? std::max<double>(relative + maximum, minimum)
@@ -69,7 +69,7 @@ BUILTIN(TypedArrayPrototypeCopyWithin) {
       from = CapRelativeIndex(num, 0, len);
 
       Handle<Object> end = args.atOrUndefined(isolate, 3);
-      if (!end->IsUndefined(isolate)) {
+      if (!IsUndefined(*end, isolate)) {
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, num,
                                            Object::ToInteger(isolate, end));
         final = CapRelativeIndex(num, 0, len);
@@ -126,7 +126,7 @@ BUILTIN(TypedArrayPrototypeCopyWithin) {
   count = count * element_size;
 
   uint8_t* data = static_cast<uint8_t*>(array->DataPtr());
-  if (array->buffer().is_shared()) {
+  if (array->buffer()->is_shared()) {
     base::Relaxed_Memmove(reinterpret_cast<base::Atomic8*>(data + to),
                           reinterpret_cast<base::Atomic8*>(data + from), count);
   } else {
@@ -161,13 +161,13 @@ BUILTIN(TypedArrayPrototypeFill) {
 
   if (args.length() > 2) {
     Handle<Object> num = args.atOrUndefined(isolate, 2);
-    if (!num->IsUndefined(isolate)) {
+    if (!IsUndefined(*num, isolate)) {
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
           isolate, num, Object::ToInteger(isolate, num));
       start = CapRelativeIndex(num, 0, len);
 
       num = args.atOrUndefined(isolate, 3);
-      if (!num->IsUndefined(isolate)) {
+      if (!IsUndefined(*num, isolate)) {
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
             isolate, num, Object::ToInteger(isolate, num));
         end = CapRelativeIndex(num, 0, len);
diff --git a/deps/v8/src/builtins/builtins-utils.h b/deps/v8/src/builtins/builtins-utils.h
index 03a4b2e9b18912..9d9a51f33bae94 100644
--- a/deps/v8/src/builtins/builtins-utils.h
+++ b/deps/v8/src/builtins/builtins-utils.h
@@ -23,9 +23,10 @@ class BuiltinArguments : public JavaScriptArguments {
       : Arguments(length, arguments) {
     // Check we have at least the receiver.
     DCHECK_LE(1, this->length());
+    DCHECK(Object((*at(0)).ptr()).IsObject());
   }
 
-  Object operator[](int index) const {
+  Tagged<Object> operator[](int index) const {
     DCHECK_LT(index, length());
     return Object(*address_of_arg_at(index + kArgsOffset));
   }
@@ -36,7 +37,7 @@ class BuiltinArguments : public JavaScriptArguments {
     return Handle<S>(address_of_arg_at(index + kArgsOffset));
   }
 
-  inline void set_at(int index, Object value) {
+  inline void set_at(int index, Tagged<Object> value) {
     DCHECK_LT(index, length());
     *address_of_arg_at(index + kArgsOffset) = value.ptr();
   }
@@ -102,44 +103,44 @@ static_assert(BuiltinArguments::kNumExtraArgsWithReceiver ==
 // through the BuiltinArguments object args.
 // TODO(cbruni): add global flag to check whether any tracing events have been
 // enabled.
-#define BUILTIN_RCS(name)                                                   \
-  V8_WARN_UNUSED_RESULT static Object Builtin_Impl_##name(                  \
-      BuiltinArguments args, Isolate* isolate);                             \
-                                                                            \
-  V8_NOINLINE static Address Builtin_Impl_Stats_##name(                     \
-      int args_length, Address* args_object, Isolate* isolate) {            \
-    BuiltinArguments args(args_length, args_object);                        \
-    RCS_SCOPE(isolate, RuntimeCallCounterId::kBuiltin_##name);              \
-    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.runtime"),                   \
-                 "V8.Builtin_" #name);                                      \
-    return BUILTIN_CONVERT_RESULT(Builtin_Impl_##name(args, isolate));      \
-  }                                                                         \
-                                                                            \
-  V8_WARN_UNUSED_RESULT Address Builtin_##name(                             \
-      int args_length, Address* args_object, Isolate* isolate) {            \
-    DCHECK(isolate->context().is_null() || isolate->context().IsContext()); \
-    if (V8_UNLIKELY(TracingFlags::is_runtime_stats_enabled())) {            \
-      return Builtin_Impl_Stats_##name(args_length, args_object, isolate);  \
-    }                                                                       \
-    BuiltinArguments args(args_length, args_object);                        \
-    return BUILTIN_CONVERT_RESULT(Builtin_Impl_##name(args, isolate));      \
-  }                                                                         \
-                                                                            \
-  V8_WARN_UNUSED_RESULT static Object Builtin_Impl_##name(                  \
+#define BUILTIN_RCS(name)                                                  \
+  V8_WARN_UNUSED_RESULT static Object Builtin_Impl_##name(                 \
+      BuiltinArguments args, Isolate* isolate);                            \
+                                                                           \
+  V8_NOINLINE static Address Builtin_Impl_Stats_##name(                    \
+      int args_length, Address* args_object, Isolate* isolate) {           \
+    BuiltinArguments args(args_length, args_object);                       \
+    RCS_SCOPE(isolate, RuntimeCallCounterId::kBuiltin_##name);             \
+    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.runtime"),                  \
+                 "V8.Builtin_" #name);                                     \
+    return BUILTIN_CONVERT_RESULT(Builtin_Impl_##name(args, isolate));     \
+  }                                                                        \
+                                                                           \
+  V8_WARN_UNUSED_RESULT Address Builtin_##name(                            \
+      int args_length, Address* args_object, Isolate* isolate) {           \
+    DCHECK(isolate->context().is_null() || IsContext(isolate->context())); \
+    if (V8_UNLIKELY(TracingFlags::is_runtime_stats_enabled())) {           \
+      return Builtin_Impl_Stats_##name(args_length, args_object, isolate); \
+    }                                                                      \
+    BuiltinArguments args(args_length, args_object);                       \
+    return BUILTIN_CONVERT_RESULT(Builtin_Impl_##name(args, isolate));     \
+  }                                                                        \
+                                                                           \
+  V8_WARN_UNUSED_RESULT static Object Builtin_Impl_##name(                 \
       BuiltinArguments args, Isolate* isolate)
 
-#define BUILTIN_NO_RCS(name)                                                \
-  V8_WARN_UNUSED_RESULT static Object Builtin_Impl_##name(                  \
-      BuiltinArguments args, Isolate* isolate);                             \
-                                                                            \
-  V8_WARN_UNUSED_RESULT Address Builtin_##name(                             \
-      int args_length, Address* args_object, Isolate* isolate) {            \
-    DCHECK(isolate->context().is_null() || isolate->context().IsContext()); \
-    BuiltinArguments args(args_length, args_object);                        \
-    return BUILTIN_CONVERT_RESULT(Builtin_Impl_##name(args, isolate));      \
-  }                                                                         \
-                                                                            \
-  V8_WARN_UNUSED_RESULT static Object Builtin_Impl_##name(                  \
+#define BUILTIN_NO_RCS(name)                                               \
+  V8_WARN_UNUSED_RESULT static Object Builtin_Impl_##name(                 \
+      BuiltinArguments args, Isolate* isolate);                            \
+                                                                           \
+  V8_WARN_UNUSED_RESULT Address Builtin_##name(                            \
+      int args_length, Address* args_object, Isolate* isolate) {           \
+    DCHECK(isolate->context().is_null() || IsContext(isolate->context())); \
+    BuiltinArguments args(args_length, args_object);                       \
+    return BUILTIN_CONVERT_RESULT(Builtin_Impl_##name(args, isolate));     \
+  }                                                                        \
+                                                                           \
+  V8_WARN_UNUSED_RESULT static Object Builtin_Impl_##name(                 \
       BuiltinArguments args, Isolate* isolate)
 
 #ifdef V8_RUNTIME_CALL_STATS
@@ -150,7 +151,7 @@ static_assert(BuiltinArguments::kNumExtraArgsWithReceiver ==
 // ----------------------------------------------------------------------------
 
 #define CHECK_RECEIVER(Type, name, method)                                  \
-  if (!args.receiver()->Is##Type()) {                                       \
+  if (!Is##Type(*args.receiver())) {                                        \
     THROW_NEW_ERROR_RETURN_FAILURE(                                         \
         isolate,                                                            \
         NewTypeError(MessageTemplate::kIncompatibleMethodReceiver,          \
@@ -163,7 +164,7 @@ static_assert(BuiltinArguments::kNumExtraArgsWithReceiver ==
 // or converts the receiver to a String otherwise and assigns it to a new var
 // with the given {name}.
 #define TO_THIS_STRING(name, method)                                          \
-  if (args.receiver()->IsNullOrUndefined(isolate)) {                          \
+  if (IsNullOrUndefined(*args.receiver(), isolate)) {                         \
     THROW_NEW_ERROR_RETURN_FAILURE(                                           \
         isolate,                                                              \
         NewTypeError(MessageTemplate::kCalledOnNullOrUndefined,               \
diff --git a/deps/v8/src/builtins/builtins-wasm-gen.cc b/deps/v8/src/builtins/builtins-wasm-gen.cc
index 98929d796b76b0..55fc36fd2c95ba 100644
--- a/deps/v8/src/builtins/builtins-wasm-gen.cc
+++ b/deps/v8/src/builtins/builtins-wasm-gen.cc
@@ -25,8 +25,13 @@ TNode<NativeContext> WasmBuiltinsAssembler::LoadContextFromWasmOrJsFrame() {
   TNode<HeapObject> function_or_instance =
       CAST(LoadFromParentFrame(WasmFrameConstants::kWasmInstanceOffset));
   Label js(this);
+  Label apifunc(this);
   Label done(this);
-  GotoIf(IsJSFunction(function_or_instance), &js);
+  TNode<Uint16T> instance_type =
+      LoadMapInstanceType(LoadMap(function_or_instance));
+  GotoIf(IsJSFunctionInstanceType(instance_type), &js);
+  GotoIf(Word32Equal(instance_type, Int32Constant(WASM_API_FUNCTION_REF_TYPE)),
+         &apifunc);
   context_result = LoadContextFromInstance(CAST(function_or_instance));
   Goto(&done);
 
@@ -37,6 +42,12 @@ TNode<NativeContext> WasmBuiltinsAssembler::LoadContextFromWasmOrJsFrame() {
   context_result = LoadNativeContext(context);
   Goto(&done);
 
+  BIND(&apifunc);
+  TNode<WasmApiFunctionRef> apiref = CAST(function_or_instance);
+  context_result = LoadObjectField<NativeContext>(
+      apiref, WasmApiFunctionRef::kNativeContextOffset);
+  Goto(&done);
+
   BIND(&done);
   return context_result.value();
 }
@@ -66,6 +77,22 @@ TNode<FixedArray> WasmBuiltinsAssembler::LoadManagedObjectMapsFromInstance(
       instance, WasmInstanceObject::kManagedObjectMapsOffset);
 }
 
+TNode<Float64T> WasmBuiltinsAssembler::StringToFloat64(TNode<String> input) {
+#ifdef V8_ENABLE_FP_PARAMS_IN_C_LINKAGE
+  TNode<ExternalReference> string_to_float64 =
+      ExternalConstant(ExternalReference::wasm_string_to_f64());
+  return TNode<Float64T>::UncheckedCast(
+      CallCFunction(string_to_float64, MachineType::Float64(),
+                    std::make_pair(MachineType::AnyTagged(), input)));
+#else
+  // We could support the fast path by passing the float via a stackslot, see
+  // MachineOperatorBuilder::StackSlot.
+  TNode<Object> result =
+      CallRuntime(Runtime::kStringParseFloat, NoContextConstant(), input);
+  return ChangeNumberToFloat64(CAST(result));
+#endif
+}
+
 TF_BUILTIN(WasmFloat32ToNumber, WasmBuiltinsAssembler) {
   auto val = UncheckedParameter<Float32T>(Descriptor::kValue);
   Return(ChangeFloat32ToTagged(val));
@@ -76,6 +103,15 @@ TF_BUILTIN(WasmFloat64ToNumber, WasmBuiltinsAssembler) {
   Return(ChangeFloat64ToTagged(val));
 }
 
+TF_BUILTIN(WasmFloat64ToString, WasmBuiltinsAssembler) {
+  TNode<Float64T> val = UncheckedParameter<Float64T>(Descriptor::kValue);
+  // Having to allocate a HeapNumber is a bit unfortunate, but the subsequent
+  // runtime call will have to allocate a string anyway, which probably
+  // dwarfs the cost of one more small allocation here.
+  TNode<Number> tagged = ChangeFloat64ToTagged(val);
+  Return(NumberToString(tagged));
+}
+
 TF_BUILTIN(JSToWasmLazyDeoptContinuation, WasmBuiltinsAssembler) {
   // Reset thread_in_wasm_flag.
   TNode<ExternalReference> thread_in_wasm_flag_address_address =
@@ -90,6 +126,11 @@ TF_BUILTIN(JSToWasmLazyDeoptContinuation, WasmBuiltinsAssembler) {
   auto value = Parameter<Object>(Descriptor::kArgument);
   Return(value);
 }
-
+TF_BUILTIN(WasmToJsWrapperCSA, WasmBuiltinsAssembler) {
+  TorqueStructWasmToJSResult result = WasmToJSWrapper(
+      UncheckedParameter<WasmApiFunctionRef>(Descriptor::kWasmApiFunctionRef));
+  PopAndReturn(result.popCount, result.result0, result.result1, result.result2,
+               result.result3);
+}
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/builtins/builtins-wasm-gen.h b/deps/v8/src/builtins/builtins-wasm-gen.h
index af568b329b85d4..59f26464a38abc 100644
--- a/deps/v8/src/builtins/builtins-wasm-gen.h
+++ b/deps/v8/src/builtins/builtins-wasm-gen.h
@@ -29,6 +29,8 @@ class WasmBuiltinsAssembler : public CodeStubAssembler {
 
   TNode<FixedArray> LoadManagedObjectMapsFromInstance(
       TNode<WasmInstanceObject> instance);
+
+  TNode<Float64T> StringToFloat64(TNode<String> input);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/builtins/builtins-weak-refs.cc b/deps/v8/src/builtins/builtins-weak-refs.cc
index a944159f247bec..32cc43019dc40f 100644
--- a/deps/v8/src/builtins/builtins-weak-refs.cc
+++ b/deps/v8/src/builtins/builtins-weak-refs.cc
@@ -9,25 +9,21 @@
 namespace v8 {
 namespace internal {
 
-// https://tc39.es/proposal-symbols-as-weakmap-keys/#sec-finalization-registry.prototype.unregister
+// https://tc39.es/ecma262/#sec-finalization-registry.prototype.unregister
 BUILTIN(FinalizationRegistryUnregister) {
   HandleScope scope(isolate);
   const char* method_name = "FinalizationRegistry.prototype.unregister";
 
   // 1. Let finalizationGroup be the this value.
   //
-  // 2. If Type(finalizationGroup) is not Object, throw a TypeError
-  //    exception.
-  //
-  // 3. If finalizationGroup does not have a [[Cells]] internal slot,
-  //    throw a TypeError exception.
+  // 2. Perform ? RequireInternalSlot(finalizationRegistry, [[Cells]]).
   CHECK_RECEIVER(JSFinalizationRegistry, finalization_registry, method_name);
 
   Handle<Object> unregister_token = args.atOrUndefined(isolate, 1);
 
-  // 4. If CanBeHeldWeakly(unregisterToken) is false, throw a TypeError
+  // 3. If CanBeHeldWeakly(unregisterToken) is false, throw a TypeError
   // exception.
-  if (!unregister_token->CanBeHeldWeakly()) {
+  if (!Object::CanBeHeldWeakly(*unregister_token)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kInvalidWeakRefsUnregisterToken,
                               unregister_token));
diff --git a/deps/v8/src/builtins/builtins.cc b/deps/v8/src/builtins/builtins.cc
index 2c84a811bc2716..1085f16075f7b4 100644
--- a/deps/v8/src/builtins/builtins.cc
+++ b/deps/v8/src/builtins/builtins.cc
@@ -114,7 +114,7 @@ const char* Builtins::Lookup(Address pc) {
   if (!initialized_) return nullptr;
   for (Builtin builtin_ix = Builtins::kFirst; builtin_ix <= Builtins::kLast;
        ++builtin_ix) {
-    if (code(builtin_ix).contains(isolate_, pc)) {
+    if (code(builtin_ix)->contains(isolate_, pc)) {
       return name(builtin_ix);
     }
   }
@@ -179,14 +179,14 @@ FullObjectSlot Builtins::builtin_tier0_slot(Builtin builtin) {
   return FullObjectSlot(location);
 }
 
-void Builtins::set_code(Builtin builtin, Code code) {
-  DCHECK_EQ(builtin, code.builtin_id());
+void Builtins::set_code(Builtin builtin, Tagged<Code> code) {
+  DCHECK_EQ(builtin, code->builtin_id());
   DCHECK(Internals::HasHeapObjectTag(code.ptr()));
   // The given builtin may be uninitialized thus we cannot check its type here.
   isolate_->builtin_table()[Builtins::ToInt(builtin)] = code.ptr();
 }
 
-Code Builtins::code(Builtin builtin) {
+Tagged<Code> Builtins::code(Builtin builtin) {
   Address ptr = isolate_->builtin_table()[Builtins::ToInt(builtin)];
   return Code::cast(Object(ptr));
 }
@@ -246,6 +246,41 @@ const char* Builtins::name(Builtin builtin) {
   return builtin_metadata[index].name;
 }
 
+// static
+const char* Builtins::NameForStackTrace(Builtin builtin) {
+#if V8_ENABLE_WEBASSEMBLY
+  // Most builtins are never shown in stack traces. Those that are exposed
+  // to JavaScript get their name from the object referring to them. Here
+  // we only support a few internal builtins that have special reasons for
+  // being shown on stack traces:
+  // - builtins that are allowlisted in {StubFrame::Summarize}.
+  // - builtins that throw the same error as one of those above, but would
+  //   lose information and e.g. print "indexOf" instead of "String.indexOf".
+  switch (builtin) {
+    case Builtin::kStringPrototypeToLocaleLowerCase:
+      return "String.toLocaleLowerCase";
+    case Builtin::kStringPrototypeIndexOf:
+    case Builtin::kThrowIndexOfCalledOnNull:
+      return "String.indexOf";
+#if V8_INTL_SUPPORT
+    case Builtin::kStringPrototypeToLowerCaseIntl:
+#endif
+    case Builtin::kThrowToLowerCaseCalledOnNull:
+      return "String.toLowerCase";
+    case Builtin::kWasmIntToString:
+      return "Number.toString";
+    default:
+      // Callers getting this might well crash, which might be desirable
+      // because it's similar to {UNREACHABLE()}, but contrary to that a
+      // careful caller can also check the value and use it as an "is a
+      // name available for this builtin?" check.
+      return nullptr;
+  }
+#else
+  return nullptr;
+#endif  // V8_ENABLE_WEBASSEMBLY
+}
+
 void Builtins::PrintBuiltinCode() {
   DCHECK(v8_flags.print_builtin_code);
 #ifdef ENABLE_DISASSEMBLER
@@ -256,8 +291,8 @@ void Builtins::PrintBuiltinCode() {
                      base::CStrVector(v8_flags.print_builtin_code_filter))) {
       CodeTracer::Scope trace_scope(isolate_->GetCodeTracer());
       OFStream os(trace_scope.file());
-      Code builtin_code = code(builtin);
-      builtin_code.Disassemble(builtin_name, os, isolate_);
+      Tagged<Code> builtin_code = code(builtin);
+      builtin_code->Disassemble(builtin_name, os, isolate_);
       os << "\n";
     }
   }
@@ -270,9 +305,9 @@ void Builtins::PrintBuiltinSize() {
        ++builtin) {
     const char* builtin_name = name(builtin);
     const char* kind = KindNameOf(builtin);
-    Code code = Builtins::code(builtin);
+    Tagged<Code> code = Builtins::code(builtin);
     PrintF(stdout, "%s Builtin, %s, %d\n", kind, builtin_name,
-           code.InstructionSize());
+           code->instruction_size());
   }
 }
 
@@ -283,8 +318,8 @@ Address Builtins::CppEntryOf(Builtin builtin) {
 }
 
 // static
-bool Builtins::IsBuiltin(const Code code) {
-  return Builtins::IsBuiltinId(code.builtin_id());
+bool Builtins::IsBuiltin(const Tagged<Code> code) {
+  return Builtins::IsBuiltinId(code->builtin_id());
 }
 
 bool Builtins::IsBuiltinHandle(Handle<HeapObject> maybe_code,
@@ -299,8 +334,8 @@ bool Builtins::IsBuiltinHandle(Handle<HeapObject> maybe_code,
 }
 
 // static
-bool Builtins::IsIsolateIndependentBuiltin(Code code) {
-  Builtin builtin = code.builtin_id();
+bool Builtins::IsIsolateIndependentBuiltin(Tagged<Code> code) {
+  Builtin builtin = code->builtin_id();
   return Builtins::IsBuiltinId(builtin) &&
          Builtins::IsIsolateIndependent(builtin);
 }
@@ -312,10 +347,10 @@ void Builtins::InitializeIsolateDataTables(Isolate* isolate) {
 
   // The entry table.
   for (Builtin i = Builtins::kFirst; i <= Builtins::kLast; ++i) {
-    DCHECK(Builtins::IsBuiltinId(isolate->builtins()->code(i).builtin_id()));
-    DCHECK(!isolate->builtins()->code(i).has_instruction_stream());
+    DCHECK(Builtins::IsBuiltinId(isolate->builtins()->code(i)->builtin_id()));
+    DCHECK(!isolate->builtins()->code(i)->has_instruction_stream());
     isolate_data->builtin_entry_table()[ToInt(i)] =
-        embedded_data.InstructionStartOfBuiltin(i);
+        embedded_data.InstructionStartOf(i);
   }
 
   // T0 tables.
@@ -329,10 +364,7 @@ void Builtins::InitializeIsolateDataTables(Isolate* isolate) {
 
 // static
 void Builtins::EmitCodeCreateEvents(Isolate* isolate) {
-  if (!isolate->v8_file_logger()->is_listening_to_code_events() &&
-      !isolate->is_profiling()) {
-    return;  // No need to iterate the entire table in this case.
-  }
+  if (!isolate->IsLoggingCodeCreation()) return;
 
   Address* builtins = isolate->builtin_table();
   int i = 0;
@@ -365,28 +397,27 @@ Handle<Code> Builtins::CreateInterpreterEntryTrampolineForProfiling(
   DCHECK_NOT_NULL(isolate->embedded_blob_code());
   DCHECK_NE(0, isolate->embedded_blob_code_size());
 
-  EmbeddedData d = EmbeddedData::FromBlob(isolate);
-  const Builtin builtin = Builtin::kInterpreterEntryTrampolineForProfiling;
+  Tagged<Code> code = isolate->builtins()->code(
+      Builtin::kInterpreterEntryTrampolineForProfiling);
 
   CodeDesc desc;
-  desc.buffer = reinterpret_cast<byte*>(d.InstructionStartOfBuiltin(builtin));
+  desc.buffer = reinterpret_cast<uint8_t*>(code->instruction_start());
 
-  int instruction_size = d.InstructionSizeOfBuiltin(builtin);
+  int instruction_size = code->instruction_size();
   desc.buffer_size = instruction_size;
   desc.instr_size = instruction_size;
 
   // Ensure the code doesn't require creation of metadata, otherwise respective
   // fields of CodeDesc should be initialized.
-  DCHECK_EQ(d.SafepointTableSizeOf(builtin), 0);
-  DCHECK_EQ(d.HandlerTableSizeOf(builtin), 0);
-  DCHECK_EQ(d.ConstantPoolSizeOf(builtin), 0);
-  // TODO(v8:11036): currently the CodeDesc can't represent the state when the
-  // code metadata is stored separately from the instruction stream, therefore
-  // it cannot recreate code comments in the trampoline copy.
-  // The following DCHECK currently fails if the mksnapshot is run with enabled
-  // code comments.
-  DCHECK_EQ(d.CodeCommentsSizeOf(builtin), 0);
-  DCHECK_EQ(d.UnwindingInfoSizeOf(builtin), 0);
+  DCHECK_EQ(code->safepoint_table_size(), 0);
+  DCHECK_EQ(code->handler_table_size(), 0);
+  DCHECK_EQ(code->constant_pool_size(), 0);
+  // TODO(v8:11036): The following DCHECK currently fails if the mksnapshot is
+  // run with enabled code comments, i.e. --interpreted_frames_native_stack is
+  // incompatible with --code-comments at mksnapshot-time. If ever needed,
+  // implement support.
+  DCHECK_EQ(code->code_comments_size(), 0);
+  DCHECK_EQ(code->unwinding_info_size(), 0);
 
   desc.safepoint_table_offset = instruction_size;
   desc.handler_table_offset = instruction_size;
@@ -395,11 +426,7 @@ Handle<Code> Builtins::CreateInterpreterEntryTrampolineForProfiling(
 
   CodeDesc::Verify(&desc);
 
-  const int kind_specific_flags =
-      isolate->builtins()->code(builtin).kind_specific_flags(kRelaxedLoad);
-
   return Factory::CodeBuilder(isolate, desc, CodeKind::BUILTIN)
-      .set_kind_specific_flags(kind_specific_flags)
       // Mimic the InterpreterEntryTrampoline.
       .set_builtin(Builtin::kInterpreterEntryTrampoline)
       .Build();
@@ -437,7 +464,8 @@ bool Builtins::AllowDynamicFunction(Isolate* isolate, Handle<JSFunction> target,
                                     Handle<JSObject> target_global_proxy) {
   if (v8_flags.allow_unsafe_function_constructor) return true;
   HandleScopeImplementer* impl = isolate->handle_scope_implementer();
-  Handle<Context> responsible_context = impl->LastEnteredOrMicrotaskContext();
+  Handle<NativeContext> responsible_context =
+      impl->LastEnteredOrMicrotaskContext();
   // TODO(verwaest): Remove this.
   if (responsible_context.is_null()) {
     return true;
diff --git a/deps/v8/src/builtins/builtins.h b/deps/v8/src/builtins/builtins.h
index 91811adb8bb407..5797cc15cf3c1d 100644
--- a/deps/v8/src/builtins/builtins.h
+++ b/deps/v8/src/builtins/builtins.h
@@ -15,9 +15,6 @@ namespace internal {
 class ByteArray;
 class CallInterfaceDescriptor;
 class Callable;
-template <typename T>
-class Handle;
-class Isolate;
 
 // Forward declarations.
 class BytecodeOffset;
@@ -71,6 +68,14 @@ class Builtins {
   // Disassembler support.
   const char* Lookup(Address pc);
 
+#if !defined(V8_SHORT_BUILTIN_CALLS) || \
+    defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE)
+  static constexpr bool kCodeObjectsAreInROSpace = true;
+#else
+  static constexpr bool kCodeObjectsAreInROSpace = false;
+#endif  // !defined(V8_SHORT_BUILTIN_CALLS) || \
+        // defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE)
+
 #define ADD_ONE(Name, ...) +1
   static constexpr int kBuiltinCount = 0 BUILTIN_LIST(
       ADD_ONE, ADD_ONE, ADD_ONE, ADD_ONE, ADD_ONE, ADD_ONE, ADD_ONE);
@@ -90,7 +95,9 @@ class Builtins {
       kFirstWideBytecodeHandler + kNumberOfWideBytecodeHandlers;
   static constexpr int kLastBytecodeHandlerPlusOne =
       kFirstExtraWideBytecodeHandler + kNumberOfWideBytecodeHandlers;
-  static_assert(kLastBytecodeHandlerPlusOne == kBuiltinCount);
+  static constexpr bool kBytecodeHandlersAreSortedLast =
+      kLastBytecodeHandlerPlusOne == kBuiltinCount;
+  static_assert(kBytecodeHandlersAreSortedLast);
 
   static constexpr bool IsBuiltinId(Builtin builtin) {
     return builtin != Builtin::kNoBuiltinId;
@@ -119,12 +126,23 @@ class Builtins {
   static BytecodeOffset GetContinuationBytecodeOffset(Builtin builtin);
   static Builtin GetBuiltinFromBytecodeOffset(BytecodeOffset);
 
-  static constexpr Builtin GetRecordWriteStub(SaveFPRegsMode fp_mode) {
-    switch (fp_mode) {
-      case SaveFPRegsMode::kIgnore:
-        return Builtin::kRecordWriteIgnoreFP;
-      case SaveFPRegsMode::kSave:
-        return Builtin::kRecordWriteSaveFP;
+  static constexpr Builtin GetRecordWriteStub(
+      SaveFPRegsMode fp_mode, PointerType type = PointerType::kDirect) {
+    switch (type) {
+      case PointerType::kDirect:
+        switch (fp_mode) {
+          case SaveFPRegsMode::kIgnore:
+            return Builtin::kRecordWriteIgnoreFP;
+          case SaveFPRegsMode::kSave:
+            return Builtin::kRecordWriteSaveFP;
+        }
+      case PointerType::kIndirect:
+        switch (fp_mode) {
+          case SaveFPRegsMode::kIgnore:
+            return Builtin::kIndirectPointerBarrierIgnoreFP;
+          case SaveFPRegsMode::kSave:
+            return Builtin::kIndirectPointerBarrierSaveFP;
+        }
     }
   }
 
@@ -145,9 +163,9 @@ class Builtins {
   Handle<Code> OrdinaryToPrimitive(OrdinaryToPrimitiveHint hint);
 
   // Used by CreateOffHeapTrampolines in isolate.cc.
-  void set_code(Builtin builtin, Code code);
+  void set_code(Builtin builtin, Tagged<Code> code);
 
-  V8_EXPORT_PRIVATE Code code(Builtin builtin);
+  V8_EXPORT_PRIVATE Tagged<Code> code(Builtin builtin);
   V8_EXPORT_PRIVATE Handle<Code> code_handle(Builtin builtin);
 
   static CallInterfaceDescriptor CallInterfaceDescriptorFor(Builtin builtin);
@@ -158,6 +176,7 @@ class Builtins {
   static int GetStackParameterCount(Builtin builtin);
 
   V8_EXPORT_PRIVATE static const char* name(Builtin builtin);
+  V8_EXPORT_PRIVATE static const char* NameForStackTrace(Builtin builtin);
 
   // Support for --print-builtin-size and --print-builtin-code.
   void PrintBuiltinCode();
@@ -174,7 +193,7 @@ class Builtins {
 
   // True, iff the given code object is a builtin. Note that this does not
   // necessarily mean that its kind is InstructionStream::BUILTIN.
-  static bool IsBuiltin(const Code code);
+  static bool IsBuiltin(const Tagged<Code> code);
 
   // As above, but safe to access off the main thread since the check is done
   // by handle location. Similar to Heap::IsRootHandle.
@@ -192,7 +211,7 @@ class Builtins {
   }
 
   // True, iff the given code object is a builtin with off-heap embedded code.
-  static bool IsIsolateIndependentBuiltin(Code code);
+  static bool IsIsolateIndependentBuiltin(Tagged<Code> code);
 
   static void InitializeIsolateDataTables(Isolate* isolate);
 
@@ -215,7 +234,8 @@ class Builtins {
   static void Generate_Adaptor(MacroAssembler* masm, Address builtin_address);
 
   static void Generate_CEntry(MacroAssembler* masm, int result_size,
-                              ArgvMode argv_mode, bool builtin_exit_frame);
+                              ArgvMode argv_mode, bool builtin_exit_frame,
+                              bool switch_to_central_stack);
 
   static bool AllowDynamicFunction(Isolate* isolate, Handle<JSFunction> target,
                                    Handle<JSObject> target_global_proxy);
@@ -241,6 +261,11 @@ class Builtins {
     return js_entry_handler_offset_;
   }
 
+  int jspi_prompt_handler_offset() const {
+    DCHECK_NE(jspi_prompt_handler_offset_, 0);
+    return jspi_prompt_handler_offset_;
+  }
+
   void SetJSEntryHandlerOffset(int offset) {
     // Check the stored offset is either uninitialized or unchanged (we
     // generate multiple variants of this builtin but they should all have the
@@ -249,6 +274,11 @@ class Builtins {
     js_entry_handler_offset_ = offset;
   }
 
+  void SetJSPIPromptHandlerOffset(int offset) {
+    CHECK_EQ(jspi_prompt_handler_offset_, 0);
+    jspi_prompt_handler_offset_ = offset;
+  }
+
   // Returns given builtin's slot in the main builtin table.
   FullObjectSlot builtin_slot(Builtin builtin);
   // Returns given builtin's slot in the tier0 builtin table.
@@ -269,6 +299,9 @@ class Builtins {
                                                      CallOrConstructMode mode,
                                                      Handle<Code> code);
 
+  static void Generate_MaglevFunctionEntryStackCheck(MacroAssembler* masm,
+                                                     bool save_new_target);
+
   enum class InterpreterEntryTrampolineMode {
     // The version of InterpreterEntryTrampoline used by default.
     kDefault,
@@ -288,6 +321,9 @@ class Builtins {
   static void Generate_InterpreterPushArgsThenConstructImpl(
       MacroAssembler* masm, InterpreterPushArgsMode mode);
 
+  static void Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                           CallApiCallbackMode mode);
+
 #define DECLARE_ASM(Name, ...) \
   static void Generate_##Name(MacroAssembler* masm);
 #define DECLARE_TF(Name, ...) \
@@ -306,6 +342,9 @@ class Builtins {
   // label) in JSEntry and its variants. It's used to generate the handler table
   // during codegen (mksnapshot-only).
   int js_entry_handler_offset_ = 0;
+  // Do the same for the JSPI prompt, which catches uncaught exceptions and
+  // rejects the corresponding promise.
+  int jspi_prompt_handler_offset_ = 0;
 
   friend class SetupIsolateDelegate;
 };
diff --git a/deps/v8/src/builtins/cast.tq b/deps/v8/src/builtins/cast.tq
index 20eecf7352ff65..1ae43277569793 100644
--- a/deps/v8/src/builtins/cast.tq
+++ b/deps/v8/src/builtins/cast.tq
@@ -135,13 +135,14 @@ extern macro HeapObjectToJSFunctionWithPrototypeSlot(HeapObject):
     JSFunctionWithPrototypeSlot
     labels CastError;
 
-macro Cast<A : type extends WeakHeapObject>(o: A|Object): A labels CastError {
+macro Cast<A : type extends WeakHeapObject>(o: A|
+                                               Object): A labels CastError {
   if (!IsWeakOrCleared(o)) goto CastError;
   return %RawDownCast<A>(o);
 }
 
-macro Cast<A : type extends Object>(implicit context: Context)(o: MaybeObject):
-    A labels CastError {
+macro Cast<A : type extends Object>(
+    implicit context: Context)(o: MaybeObject): A labels CastError {
   typeswitch (o) {
     case (WeakHeapObject): {
       goto CastError;
@@ -459,8 +460,8 @@ Cast<JSRegExpResult>(implicit context: Context)(o: HeapObject): JSRegExpResult
   goto CastError;
 }
 
-Cast<JSSloppyArgumentsObject>(implicit context: Context)(o: HeapObject):
-    JSSloppyArgumentsObject
+Cast<JSSloppyArgumentsObject>(
+    implicit context: Context)(o: HeapObject): JSSloppyArgumentsObject
     labels CastError {
   const map: Map = o.map;
   if (IsFastAliasedArgumentsMap(map) || IsSloppyArgumentsMap(map) ||
@@ -470,16 +471,16 @@ Cast<JSSloppyArgumentsObject>(implicit context: Context)(o: HeapObject):
   goto CastError;
 }
 
-Cast<JSStrictArgumentsObject>(implicit context: Context)(o: HeapObject):
-    JSStrictArgumentsObject
+Cast<JSStrictArgumentsObject>(
+    implicit context: Context)(o: HeapObject): JSStrictArgumentsObject
     labels CastError {
   const map: Map = o.map;
   if (!IsStrictArgumentsMap(map)) goto CastError;
   return %RawDownCast<JSStrictArgumentsObject>(o);
 }
 
-Cast<JSArgumentsObjectWithLength>(implicit context: Context)(o: HeapObject):
-    JSArgumentsObjectWithLength
+Cast<JSArgumentsObjectWithLength>(
+    implicit context: Context)(o: HeapObject): JSArgumentsObjectWithLength
     labels CastError {
   typeswitch (o) {
     case (o: JSStrictArgumentsObject): {
@@ -524,8 +525,8 @@ Cast<FastJSArray>(implicit context: Context)(o: HeapObject): FastJSArray
   return %RawDownCast<FastJSArray>(o);
 }
 
-Cast<FastJSArrayForRead>(implicit context: Context)(o: HeapObject):
-    FastJSArrayForRead
+Cast<FastJSArrayForRead>(
+    implicit context: Context)(o: HeapObject): FastJSArrayForRead
     labels CastError {
   if (!Is<JSArray>(o)) goto CastError;
 
@@ -543,8 +544,8 @@ Cast<FastJSArrayForRead>(implicit context: Context)(o: HeapObject):
   return %RawDownCast<FastJSArrayForRead>(o);
 }
 
-Cast<FastJSArrayForCopy>(implicit context: Context)(o: HeapObject):
-    FastJSArrayForCopy
+Cast<FastJSArrayForCopy>(
+    implicit context: Context)(o: HeapObject): FastJSArrayForCopy
     labels CastError {
   if (IsArraySpeciesProtectorCellInvalid()) goto CastError;
   // TODO(victorgomes): Check if we can cast from FastJSArrayForRead instead.
@@ -552,23 +553,24 @@ Cast<FastJSArrayForCopy>(implicit context: Context)(o: HeapObject):
   return %RawDownCast<FastJSArrayForCopy>(a);
 }
 
-Cast<FastJSArrayForConcat>(implicit context: Context)(o: HeapObject):
-    FastJSArrayForConcat
+Cast<FastJSArrayForConcat>(
+    implicit context: Context)(o: HeapObject): FastJSArrayForConcat
     labels CastError {
   if (IsIsConcatSpreadableProtectorCellInvalid()) goto CastError;
   const a = Cast<FastJSArrayForCopy>(o) otherwise CastError;
   return %RawDownCast<FastJSArrayForConcat>(a);
 }
 
-Cast<FastJSArrayWithNoCustomIteration>(implicit context: Context)(
-    o: HeapObject): FastJSArrayWithNoCustomIteration
+Cast<FastJSArrayWithNoCustomIteration>(
+    implicit context: Context)(o: HeapObject): FastJSArrayWithNoCustomIteration
     labels CastError {
   if (IsArrayIteratorProtectorCellInvalid()) goto CastError;
   const a = Cast<FastJSArray>(o) otherwise CastError;
   return %RawDownCast<FastJSArrayWithNoCustomIteration>(a);
 }
 
-Cast<FastJSArrayForReadWithNoCustomIteration>(implicit context: Context)(
+Cast<FastJSArrayForReadWithNoCustomIteration>(
+    implicit context: Context)(
     o: HeapObject): FastJSArrayForReadWithNoCustomIteration
     labels CastError {
   if (IsArrayIteratorProtectorCellInvalid()) goto CastError;
@@ -576,6 +578,22 @@ Cast<FastJSArrayForReadWithNoCustomIteration>(implicit context: Context)(
   return %RawDownCast<FastJSArrayForReadWithNoCustomIteration>(a);
 }
 
+Cast<JSSetWithNoCustomIteration>(
+    implicit context: Context)(o: HeapObject): JSSetWithNoCustomIteration
+    labels CastError {
+  if (IsSetIteratorProtectorCellInvalid()) goto CastError;
+  const a = Cast<JSSet>(o) otherwise CastError;
+  return %RawDownCast<JSSetWithNoCustomIteration>(a);
+}
+
+Cast<JSMapWithNoCustomIteration>(
+    implicit context: Context)(o: HeapObject): JSMapWithNoCustomIteration
+    labels CastError {
+  if (IsMapIteratorProtectorCellInvalid()) goto CastError;
+  const a = Cast<JSMap>(o) otherwise CastError;
+  return %RawDownCast<JSMapWithNoCustomIteration>(a);
+}
+
 macro Cast<T: type>(o: String): T labels CastError;
 
 Cast<SeqOneByteString>(o: HeapObject): SeqOneByteString labels CastError {
@@ -697,7 +715,8 @@ Cast<JSReceiver|Null>(o: HeapObject): JSReceiver|Null
   }
 }
 
-Cast<JSReceiver|Symbol>(implicit context: Context)(o: Object): JSReceiver|Symbol
+Cast<JSReceiver|Symbol>(implicit context: Context)(o: Object): JSReceiver|
+    Symbol
     labels CastError {
   typeswitch (o) {
     case (o: JSReceiver): {
@@ -756,8 +775,9 @@ Cast<Zero|PromiseReaction>(implicit context: Context)(o: Object): Zero|
   }
 }
 
-Cast<JSFunction|JSBoundFunction|JSWrappedFunction>(implicit context: Context)(
-    o: Object): JSFunction|JSBoundFunction|JSWrappedFunction labels CastError {
+Cast<JSFunction|JSBoundFunction|JSWrappedFunction>(
+    implicit context: Context)(o: Object): JSFunction|JSBoundFunction|
+    JSWrappedFunction labels CastError {
   typeswitch (o) {
     case (o: JSFunction): {
       return o;
@@ -809,8 +829,8 @@ macro Is<A : type extends Object, B : type extends Object>(
   return true;
 }
 
-macro UnsafeCast<A : type extends Object>(implicit context: Context)(o: Object):
-    A {
+macro UnsafeCast<A : type extends Object>(
+    implicit context: Context)(o: Object): A {
   dcheck(Is<A>(o));
   return %RawDownCast<A>(o);
 }
@@ -819,20 +839,24 @@ macro UnsafeConstCast<T: type>(r: const &T):&T {
   return %RawDownCast<&T>(r);
 }
 
-UnsafeCast<RegExpMatchInfo>(implicit context: Context)(o: Object):
-    RegExpMatchInfo {
+UnsafeCast<RegExpMatchInfo>(
+    implicit context: Context)(o: Object): RegExpMatchInfo {
   dcheck(Is<FixedArray>(o));
   return %RawDownCast<RegExpMatchInfo>(o);
 }
 
+UnsafeCast<ArrayList>(implicit context: Context)(o: Object): ArrayList {
+  dcheck(Is<FixedArray>(o));
+  return %RawDownCast<ArrayList>(o);
+}
+
 macro UnsafeCast<A : type extends WeakHeapObject>(o: A|Object): A {
   dcheck(IsWeakOrCleared(o));
   return %RawDownCast<A>(o);
 }
 
-macro
-CastOrDefault<T: type, Arg: type, Default: type>(implicit context: Context)(
-    x: Arg, default: Default): T|Default {
+macro CastOrDefault<T: type, Arg: type, Default: type>(
+    implicit context: Context)(x: Arg, default: Default): T|Default {
   return Cast<T>(x) otherwise return default;
 }
 
diff --git a/deps/v8/src/builtins/collections.tq b/deps/v8/src/builtins/collections.tq
index 30444ddadc0ddc..a333fec15c9b6d 100644
--- a/deps/v8/src/builtins/collections.tq
+++ b/deps/v8/src/builtins/collections.tq
@@ -5,6 +5,218 @@
 #include 'src/builtins/builtins-collections-gen.h'
 
 namespace collections {
+
+const kSetPrototypeValues: constexpr BuiltinsName
+    generates 'Builtin::kSetPrototypeValues';
+const kSetPrototypeHas: constexpr BuiltinsName
+    generates 'Builtin::kSetPrototypeHas';
+const kMapPrototypeKeys: constexpr BuiltinsName
+    generates 'Builtin::kMapPrototypeKeys';
+const kMapPrototypeHas: constexpr BuiltinsName
+    generates 'Builtin::kMapPrototypeHas';
+
+@export
+struct SetRecord {
+  // SetRecord.[[Set]]
+  object: JSReceiver;
+
+  // SetRecord.[[Size]]
+  // a non-negative integer or +∞
+  size: Number;
+
+  // SetRecord.[[Has]]
+  has: JSAny;
+
+  // SetRecord.[[Keys]]
+  keys: JSAny;
+}
+
+extern macro CodeStubAssembler::CloneFixedArray(
+    FixedArrayBase, constexpr ExtractFixedArrayFlag): FixedArrayBase;
+
+extern macro CollectionsBuiltinsAssembler::AddToSetTable(
+    implicit context: Context)(OrderedHashSet, Object, String): OrderedHashSet;
+
+extern macro CollectionsBuiltinsAssembler::TableHasKey(
+    implicit context: Context)(OrderedHashSet, Object): bool;
+extern macro CollectionsBuiltinsAssembler::TableHasKey(
+    implicit context: Context)(OrderedHashMap, Object): bool;
+
+extern macro CollectionsBuiltinsAssembler::DeleteFromSetTable(
+    implicit context: Context)(OrderedHashSet, Object): Smi labels NotFound;
+
+extern runtime OrderedHashSetShrink(implicit context: Context)(OrderedHashSet):
+    OrderedHashSet;
+
+// Direct iteration helpers.
+@export
+struct KeyIndexPair {
+  key: JSAny;
+  index: intptr;
+}
+
+@export
+struct OrderedHashSetIndexPair {
+  table: OrderedHashSet;
+  index: intptr;
+}
+
+extern macro CollectionsBuiltinsAssembler::NextKeyIndexPairUnmodifiedTable(
+    OrderedHashSet, int32, int32, intptr): KeyIndexPair labels Done;
+
+// The underlying table must not be resized during iteration!
+struct UnmodifiedOrderedHashSetIterator {
+  macro Next(): JSAny labels Done {
+    this.current = NextKeyIndexPairUnmodifiedTable(
+        this.table, this.numBuckets, this.usedCapacity, this.current.index)
+        otherwise Done;
+    return this.current.key;
+  }
+  const table: OrderedHashSet;
+  const numBuckets: int32;
+  const usedCapacity: int32;
+  current: KeyIndexPair;
+}
+
+extern macro CollectionsBuiltinsAssembler::TransitionOrderedHashSetNoUpdate(
+    OrderedHashSet, intptr): OrderedHashSetIndexPair;
+
+extern macro CollectionsBuiltinsAssembler::NextKeyIndexPair(
+    OrderedHashSet, intptr): KeyIndexPair labels Done;
+
+// The underlying table can be resized during iteration.
+struct OrderedHashSetIterator {
+  macro Next(): JSAny labels Done {
+    // Transition the table and index in case it was modified during iteration.
+    const tableAndIndex =
+        TransitionOrderedHashSetNoUpdate(this.table, this.current.index);
+    this.table = tableAndIndex.table;
+    this.current.index = tableAndIndex.index;
+    this.current = NextKeyIndexPair(this.table, this.current.index)
+        otherwise Done;
+    return this.current.key;
+  }
+  table: OrderedHashSet;
+  current: KeyIndexPair;
+}
+
+macro LoadOrderedHashTableMetadata(
+    table: OrderedHashMap|OrderedHashSet, fieldIndex: constexpr int32): int32 {
+  return Convert<int32>(UnsafeCast<Smi>(table.objects[fieldIndex]));
+}
+
+const kOrderedHashSetNumberOfBucketsIndex:
+    constexpr int32 generates 'OrderedHashSet::NumberOfBucketsIndex()';
+const kOrderedHashSetNumberOfElementsIndex:
+    constexpr int32 generates 'OrderedHashSet::NumberOfElementsIndex()';
+const kOrderedHashSetNumberOfDeletedElementsIndex: constexpr int32
+    generates 'OrderedHashSet::NumberOfDeletedElementsIndex()';
+
+macro NewUnmodifiedOrderedHashSetIterator(table: OrderedHashSet):
+    UnmodifiedOrderedHashSetIterator {
+  const numBuckets =
+      LoadOrderedHashTableMetadata(table, kOrderedHashSetNumberOfBucketsIndex);
+  const numElements =
+      LoadOrderedHashTableMetadata(table, kOrderedHashSetNumberOfElementsIndex);
+  const numDeleted = LoadOrderedHashTableMetadata(
+      table, kOrderedHashSetNumberOfDeletedElementsIndex);
+  const usedCapacity = numElements + numDeleted;
+  return UnmodifiedOrderedHashSetIterator{
+    table: table,
+    numBuckets: numBuckets,
+    usedCapacity: usedCapacity,
+    current: KeyIndexPair {
+      key:
+        Undefined, index: 0
+    }
+  };
+}
+
+macro NewOrderedHashSetIterator(table: OrderedHashSet):
+    OrderedHashSetIterator {
+  return OrderedHashSetIterator{
+    table: table,
+    current: KeyIndexPair {
+      key:
+        Undefined, index: 0
+    }
+  };
+}
+
+@export
+struct KeyValueIndexTuple {
+  key: JSAny;
+  value: JSAny;
+  index: intptr;
+}
+extern macro
+    CollectionsBuiltinsAssembler::NextKeyValueIndexTupleUnmodifiedTable(
+        OrderedHashMap, int32, int32, intptr): KeyValueIndexTuple labels Done;
+
+extern macro CollectionsBuiltinsAssembler::NextKeyValueIndexTuple(
+    OrderedHashMap, intptr): KeyValueIndexTuple labels Done;
+
+extern macro
+    CollectionsBuiltinsAssembler::UnsafeStoreValueInOrderedHashMapEntry(
+        OrderedHashMap, Object, intptr): void;
+
+const kOrderedHashMapEntrySize:
+    constexpr int32 generates 'OrderedHashMap::kEntrySize';
+
+// The underlying table must not be resized during iteration!
+struct UnmodifiedOrderedHashMapIterator {
+  macro Next(): KeyValuePair labels Done {
+    this.current = NextKeyValueIndexTupleUnmodifiedTable(
+        this.table, this.numBuckets, this.usedCapacity, this.current.index)
+        otherwise Done;
+    return KeyValuePair{key: this.current.key, value: this.current.value};
+  }
+
+  macro UnsafeStoreValueAtCurrentEntry(value: Object): void {
+    // There is no current entry if the iterator is not yet advanced. The
+    // current entry is at the previous index, as we've already advanced the
+    // index.
+    dcheck(this.current.index > 0);
+    const entry =
+        (Convert<int32>(this.current.index) - 1) * kOrderedHashMapEntrySize +
+        this.numBuckets;
+    UnsafeStoreValueInOrderedHashMapEntry(
+        this.table, value, Convert<intptr>(entry));
+  }
+
+  const table: OrderedHashMap;
+  const numBuckets: int32;
+  const usedCapacity: int32;
+  current: KeyValueIndexTuple;
+}
+
+const kOrderedHashMapNumberOfBucketsIndex:
+    constexpr int32 generates 'OrderedHashMap::NumberOfBucketsIndex()';
+const kOrderedHashMapNumberOfElementsIndex:
+    constexpr int32 generates 'OrderedHashMap::NumberOfElementsIndex()';
+const kOrderedHashMapNumberOfDeletedElementsIndex: constexpr int32
+    generates 'OrderedHashMap::NumberOfDeletedElementsIndex()';
+
+macro NewUnmodifiedOrderedHashMapIterator(table: OrderedHashMap):
+    UnmodifiedOrderedHashMapIterator {
+  const numBuckets =
+      LoadOrderedHashTableMetadata(table, kOrderedHashMapNumberOfBucketsIndex);
+  const numElements =
+      LoadOrderedHashTableMetadata(table, kOrderedHashMapNumberOfElementsIndex);
+  const numDeleted = LoadOrderedHashTableMetadata(
+      table, kOrderedHashMapNumberOfDeletedElementsIndex);
+  const usedCapacity = numElements + numDeleted;
+  return UnmodifiedOrderedHashMapIterator{
+    table: table,
+    numBuckets: numBuckets,
+    usedCapacity: usedCapacity,
+    current: KeyValueIndexTuple {
+      key:
+        Undefined, value: Undefined, index: 0
+    }
+  };
+}
+
 @export
 macro LoadKeyValuePairNoSideEffects(implicit context: Context)(o: JSAny):
     KeyValuePair labels MayHaveSideEffects {
@@ -53,4 +265,114 @@ transitioning macro LoadKeyValuePair(implicit context: Context)(o: JSAny):
     };
   }
 }
+
+// https://tc39.es/proposal-set-methods/#sec-getsetrecord
+transitioning macro GetSetRecord(
+    implicit context: Context)(obj: JSAny,
+    methodName: constexpr string): SetRecord {
+  // 1. If obj is not an Object, throw a TypeError exception.
+  const obj = Cast<JSReceiver>(obj)
+      otherwise ThrowTypeError(MessageTemplate::kArgumentIsNonObject, methodName);
+
+  // 2. Let rawSize be ? Get(obj, "size").
+  const rawSize = GetProperty(obj, kSizeString);
+
+  // 3. Let numSize be ? ToNumber(rawSize).
+  const numSize = ToNumber_Inline(rawSize);
+  if (NumberIsNaN(numSize)) {
+    // 4. NOTE: If rawSize is undefined, then numSize will be NaN.
+    // 5. If numSize is NaN, throw a TypeError exception.
+    ThrowTypeError(MessageTemplate::kSizeIsNaN);
+  }
+
+  // 6. Let intSize be ! ToIntegerOrInfinity(numSize).
+  const intSize = ToInteger_Inline(numSize);
+
+  // 7. Let has be ? Get(obj, "has").
+  let has = GetProperty(obj, kHasString);
+
+  // 8. If IsCallable(has) is false, throw a TypeError exception.
+  has = Cast<Callable>(has)
+      otherwise ThrowCalledNonCallable(kHasString);
+
+  // 9. Let keys be ? Get(obj, "keys").
+  let keys = GetProperty(obj, kKeysString);
+
+  // 10. If IsCallable(keys) is false, throw a TypeError exception.
+  keys = Cast<Callable>(keys)
+      otherwise ThrowCalledNonCallable(kKeysString);
+
+  // 11. Return a new Set Record { [[Set]]: obj, [[Size]]: intSize, [[Has]]:
+  // has, [[Keys]]: keys }.
+  return SetRecord{object: obj, size: intSize, has: has, keys: keys};
+}
+
+// https://tc39.es/proposal-set-methods/#sec-getkeysiterator
+transitioning macro GetKeysIterator(
+    implicit context: Context)(set: JSReceiver,
+    keys: Callable): iterator::IteratorRecord {
+  // 1. Let keysIter be ? Call(setRec.[[Keys]], setRec.[[Set]]).
+  const keysIter = Call(context, keys, set);
+
+  // 2. If keysIter is not an Object, throw a TypeError exception.
+  const keysIterObj = Cast<JSReceiver>(keysIter)
+      otherwise ThrowTypeError(MessageTemplate::kKeysMethodInvalid);
+
+  // 3. Let nextMethod be ? Get(keysIter, "next").
+  const nextMethod = GetProperty(keysIter, kNextString);
+
+  // 4. If IsCallable(nextMethod) is false, throw a TypeError exception.
+  Cast<Callable>(nextMethod)
+      otherwise ThrowCalledNonCallable(kNextString);
+
+  // 5. Return a new Iterator Record { [[Iterator]]: keysIter, [[NextMethod]]:
+  // nextMethod, [[Done]]: false }.
+  return iterator::IteratorRecord{object: keysIterObj, next: nextMethod};
+}
+
+macro CheckSetRecordHasJSSetMethods(setRecord: SetRecord):
+    void labels HasUserProvidedMethods {
+  const keys =
+      Cast<JSFunction>(setRecord.keys) otherwise HasUserProvidedMethods;
+  const has = Cast<JSFunction>(setRecord.has) otherwise HasUserProvidedMethods;
+  if (!(TaggedEqual(
+            keys.shared_function_info.function_data,
+            SmiConstant(kSetPrototypeValues)) &&
+        TaggedEqual(
+            has.shared_function_info.function_data,
+            SmiConstant(kSetPrototypeHas))))
+    goto HasUserProvidedMethods;
+}
+
+macro CheckSetRecordHasJSMapMethods(setRecord: SetRecord):
+    void labels HasUserProvidedMethods {
+  const keys =
+      Cast<JSFunction>(setRecord.keys) otherwise HasUserProvidedMethods;
+  const has = Cast<JSFunction>(setRecord.has) otherwise HasUserProvidedMethods;
+  if (!(TaggedEqual(
+            keys.shared_function_info.function_data,
+            SmiConstant(kMapPrototypeKeys)) &&
+        TaggedEqual(
+            has.shared_function_info.function_data,
+            SmiConstant(kMapPrototypeHas))))
+    goto HasUserProvidedMethods;
+}
+
+macro ShrinkOrderedHashSetIfNeeded(
+    implicit context: Context)(numberOfElements: Smi,
+    resultSetData: OrderedHashSet): OrderedHashSet {
+  dcheck(
+      Convert<int32>(numberOfElements) ==
+      LoadOrderedHashTableMetadata(
+          resultSetData, kOrderedHashSetNumberOfElementsIndex));
+  let result = resultSetData;
+
+  // Shrink the result table if # of element is less than # buckets/2
+  const numberOfBuckets =
+      LoadOrderedHashTableMetadata(result, kOrderedHashSetNumberOfBucketsIndex);
+  if (Convert<int32>(numberOfElements) < (numberOfBuckets / 2)) {
+    result = OrderedHashSetShrink(result);
+  }
+  return result;
+}
 }
diff --git a/deps/v8/src/builtins/console.tq b/deps/v8/src/builtins/console.tq
index 483b5422d8267b..f595cdd609d845 100644
--- a/deps/v8/src/builtins/console.tq
+++ b/deps/v8/src/builtins/console.tq
@@ -3,8 +3,8 @@
 // found in the LICENSE file.
 
 namespace console {
-extern builtin ConsoleAssert(implicit context: Context)(
-    JSFunction, JSAny, int32): JSAny;
+extern builtin ConsoleAssert(
+    implicit context: Context)(JSFunction, JSAny, int32): JSAny;
 
 javascript builtin FastConsoleAssert(
     js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny,
diff --git a/deps/v8/src/builtins/constants-table-builder.cc b/deps/v8/src/builtins/constants-table-builder.cc
index 668a69daceef94..016d417e02331d 100644
--- a/deps/v8/src/builtins/constants-table-builder.cc
+++ b/deps/v8/src/builtins/constants-table-builder.cc
@@ -30,7 +30,7 @@ uint32_t BuiltinsConstantsTableBuilder::AddObject(Handle<Object> object) {
   // accessibly from the root list.
   RootIndex root_list_index;
   DCHECK(!isolate_->roots_table().IsRootHandle(object, &root_list_index));
-  DCHECK_IMPLIES(object->IsMap(), !HeapObject::cast(*object).InReadOnlySpace());
+  DCHECK_IMPLIES(IsMap(*object), !HeapObject::cast(*object).InReadOnlySpace());
 
   // Not yet finalized.
   DCHECK_EQ(ReadOnlyRoots(isolate_).empty_fixed_array(),
@@ -44,12 +44,12 @@ uint32_t BuiltinsConstantsTableBuilder::AddObject(Handle<Object> object) {
 
   // All code objects should be loaded through the root register or use
   // pc-relative addressing.
-  DCHECK(!object->IsInstructionStream());
+  DCHECK(!IsInstructionStream(*object));
 #endif
 
   auto find_result = map_.FindOrInsert(object);
   if (!find_result.already_exists) {
-    DCHECK(object->IsHeapObject());
+    DCHECK(IsHeapObject(*object));
     *find_result.entry = map_.size() - 1;
   }
   return *find_result.entry;
@@ -76,13 +76,13 @@ void CheckPreconditionsForPatching(Isolate* isolate,
 void BuiltinsConstantsTableBuilder::PatchSelfReference(
     Handle<Object> self_reference, Handle<InstructionStream> code_object) {
   CheckPreconditionsForPatching(isolate_, code_object);
-  DCHECK(self_reference->IsOddball());
-  DCHECK(Oddball::cast(*self_reference).kind() ==
+  DCHECK(IsOddball(*self_reference));
+  DCHECK(Oddball::cast(*self_reference)->kind() ==
          Oddball::kSelfReferenceMarker);
 
   uint32_t key;
   if (map_.Delete(self_reference, &key)) {
-    DCHECK(code_object->IsInstructionStream());
+    DCHECK(IsInstructionStream(*code_object));
     map_.Insert(code_object, key);
   }
 }
@@ -115,21 +115,21 @@ void BuiltinsConstantsTableBuilder::Finalize() {
   ConstantsMap::IteratableScope it_scope(&map_);
   for (auto it = it_scope.begin(); it != it_scope.end(); ++it) {
     uint32_t index = *it.entry();
-    Object value = it.key();
-    if (value.IsCode() && Code::cast(value).kind() == CodeKind::BUILTIN) {
+    Tagged<Object> value = it.key();
+    if (IsCode(value) && Code::cast(value)->kind() == CodeKind::BUILTIN) {
       // Replace placeholder code objects with the real builtin.
       // See also: SetupIsolateDelegate::PopulateWithPlaceholders.
       // TODO(jgruber): Deduplicate placeholders and their corresponding
       // builtin.
-      value = builtins->code(Code::cast(value).builtin_id());
+      value = builtins->code(Code::cast(value)->builtin_id());
     }
-    DCHECK(value.IsHeapObject());
+    DCHECK(IsHeapObject(value));
     table->set(index, value);
   }
 
 #ifdef DEBUG
   for (int i = 0; i < map_.size(); i++) {
-    DCHECK(table->get(i).IsHeapObject());
+    DCHECK(IsHeapObject(table->get(i)));
     DCHECK_NE(ReadOnlyRoots(isolate_).undefined_value(), table->get(i));
     DCHECK_NE(ReadOnlyRoots(isolate_).self_reference_marker(), table->get(i));
     DCHECK_NE(ReadOnlyRoots(isolate_).basic_block_counters_marker(),
diff --git a/deps/v8/src/builtins/constants-table-builder.h b/deps/v8/src/builtins/constants-table-builder.h
index e8d79202ef484b..383deb3cb6d7a6 100644
--- a/deps/v8/src/builtins/constants-table-builder.h
+++ b/deps/v8/src/builtins/constants-table-builder.h
@@ -15,6 +15,7 @@ namespace internal {
 
 class Isolate;
 class Object;
+class ByteArray;
 
 // Utility class to build the builtins constants table and store it on the root
 // list. The constants table contains constants used by builtins, and is there
diff --git a/deps/v8/src/builtins/constructor.tq b/deps/v8/src/builtins/constructor.tq
index d929c7f485fce2..815967c78131ec 100644
--- a/deps/v8/src/builtins/constructor.tq
+++ b/deps/v8/src/builtins/constructor.tq
@@ -6,17 +6,17 @@
 
 namespace runtime {
 extern runtime CreateArrayLiteral(
-    Context, Undefined | FeedbackVector, TaggedIndex,
-    ArrayBoilerplateDescription, Smi): HeapObject;
+    Context, Undefined|FeedbackVector, TaggedIndex, ArrayBoilerplateDescription,
+    Smi): HeapObject;
 extern runtime CreateObjectLiteral(
-    Context, Undefined | FeedbackVector, TaggedIndex,
+    Context, Undefined|FeedbackVector, TaggedIndex,
     ObjectBoilerplateDescription, Smi): HeapObject;
 }
 
 namespace constructor {
 
-extern builtin FastNewClosure(
-    Context, SharedFunctionInfo, FeedbackCell): JSFunction;
+extern builtin FastNewClosure(Context, SharedFunctionInfo, FeedbackCell):
+    JSFunction;
 extern builtin FastNewObject(Context, JSFunction, JSReceiver): JSObject;
 
 extern enum AllocationSiteMode {
@@ -53,26 +53,27 @@ builtin FastNewClosureBaseline(
   tail FastNewClosure(context, sharedFunctionInfo, feedbackCell);
 }
 
-builtin FastNewFunctionContextEval(implicit context: Context)(
-    scopeInfo: ScopeInfo, slots: uint32): Context {
+builtin FastNewFunctionContextEval(
+    implicit context: Context)(scopeInfo: ScopeInfo, slots: uint32): Context {
   return FastNewFunctionContext(scopeInfo, slots, context, kEvalScope);
 }
 
-builtin FastNewFunctionContextFunction(implicit context: Context)(
-    scopeInfo: ScopeInfo, slots: uint32): Context {
+builtin FastNewFunctionContextFunction(
+    implicit context: Context)(scopeInfo: ScopeInfo, slots: uint32): Context {
   return FastNewFunctionContext(scopeInfo, slots, context, kFunctionScope);
 }
 
-builtin CreateRegExpLiteral(implicit context: Context)(
-    maybeFeedbackVector: HeapObject, slot: TaggedIndex, pattern: Object,
-    flags: Smi): JSRegExp {
+builtin CreateRegExpLiteral(
+    implicit context: Context)(maybeFeedbackVector: HeapObject,
+    slot: TaggedIndex, pattern: Object, flags: Smi): JSRegExp {
   return CreateRegExpLiteral(
       maybeFeedbackVector, slot, pattern, flags, context);
 }
 
-builtin CreateShallowArrayLiteral(implicit context: Context)(
-    maybeFeedbackVector: Undefined|FeedbackVector, slot: TaggedIndex,
-    constantElements: ArrayBoilerplateDescription, flags: Smi): HeapObject {
+builtin CreateShallowArrayLiteral(
+    implicit context: Context)(maybeFeedbackVector: Undefined|FeedbackVector,
+    slot: TaggedIndex, constantElements: ArrayBoilerplateDescription,
+    flags: Smi): HeapObject {
   try {
     const vector = Cast<FeedbackVector>(maybeFeedbackVector)
         otherwise CallRuntime;
@@ -85,14 +86,16 @@ builtin CreateShallowArrayLiteral(implicit context: Context)(
   }
 }
 
-builtin CreateEmptyArrayLiteral(implicit context: Context)(
-    feedbackVector: FeedbackVector, slot: TaggedIndex): HeapObject {
+builtin CreateEmptyArrayLiteral(
+    implicit context: Context)(feedbackVector: FeedbackVector,
+    slot: TaggedIndex): HeapObject {
   return CreateEmptyArrayLiteral(feedbackVector, slot, context);
 }
 
-builtin CreateShallowObjectLiteral(implicit context: Context)(
-    maybeFeedbackVector: Undefined|FeedbackVector, slot: TaggedIndex,
-    desc: ObjectBoilerplateDescription, flags: Smi): HeapObject {
+builtin CreateShallowObjectLiteral(
+    implicit context: Context)(maybeFeedbackVector: Undefined|FeedbackVector,
+    slot: TaggedIndex, desc: ObjectBoilerplateDescription,
+    flags: Smi): HeapObject {
   try {
     const feedbackVector = Cast<FeedbackVector>(maybeFeedbackVector)
         otherwise CallRuntime;
@@ -105,8 +108,7 @@ builtin CreateShallowObjectLiteral(implicit context: Context)(
 }
 
 // ES #sec-object-constructor
-transitioning javascript builtin
-ObjectConstructor(
+transitioning javascript builtin ObjectConstructor(
     js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny,
     target: JSFunction)(...arguments): JSAny {
   if (newTarget == Undefined || newTarget == target) {
@@ -129,8 +131,7 @@ builtin CreateEmptyLiteralObject(implicit context: Context)(): JSAny {
 }
 
 // ES #sec-number-constructor
-transitioning javascript builtin
-NumberConstructor(
+transitioning javascript builtin NumberConstructor(
     js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny,
     target: JSFunction)(...arguments): JSAny {
   // 1. If no arguments were passed to this function invocation, let n be +0.
@@ -161,9 +162,8 @@ NumberConstructor(
   return result;
 }
 
-javascript builtin
-GenericLazyDeoptContinuation(js-implicit context: NativeContext)(result: JSAny):
-    JSAny {
+javascript builtin GenericLazyDeoptContinuation(
+    js-implicit context: NativeContext)(result: JSAny): JSAny {
   return result;
 }
 
diff --git a/deps/v8/src/builtins/conversion.tq b/deps/v8/src/builtins/conversion.tq
index 8fd07a17458da6..9b6dabe3000d1a 100644
--- a/deps/v8/src/builtins/conversion.tq
+++ b/deps/v8/src/builtins/conversion.tq
@@ -8,22 +8,23 @@ extern transitioning runtime ToString(Context, BigInt): String;
 
 extern enum OrdinaryToPrimitiveHint { kString, kNumber }
 
-extern macro OrdinaryToPrimitive(implicit context: Context)(
-    JSAny, constexpr OrdinaryToPrimitiveHint): JSPrimitive;
+extern macro OrdinaryToPrimitive(
+    implicit context: Context)(JSAny,
+    constexpr OrdinaryToPrimitiveHint): JSPrimitive;
 
 namespace conversion {
 
-builtin StringToNumber(implicit context: Context)(input: String): Number {
+builtin StringToNumber(input: String): Number {
   return ::StringToNumber(input);
 }
 
-transitioning builtin NonNumberToNumber(implicit context: Context)(
-    input: JSAnyNotNumber): Number {
+transitioning builtin NonNumberToNumber(
+    implicit context: Context)(input: JSAnyNotNumber): Number {
   return ::NonNumberToNumber(input);
 }
 
-transitioning builtin NonNumberToNumeric(implicit context: Context)(
-    input: JSAnyNotNumber): Numeric {
+transitioning builtin NonNumberToNumeric(
+    implicit context: Context)(input: JSAnyNotNumber): Numeric {
   return ::NonNumberToNumeric(input);
 }
 
@@ -40,7 +41,7 @@ transitioning builtin ToNumeric(implicit context: Context)(input: JSAny):
 }
 
 // ES section #sec-tostring-applied-to-the-number-type
-builtin NumberToString(implicit context: Context)(input: Number): String {
+builtin NumberToString(input: Number): String {
   return ::NumberToString(input);
 }
 
@@ -59,7 +60,8 @@ struct ToBooleanForBaselineJumpResult {
 //      to save it in the caller, and
 //   b) returns the true/false value as a Smi, to make the baseline-side
 //      comparison cheaper.
-builtin ToBooleanForBaselineJump(input: JSAny): ToBooleanForBaselineJumpResult {
+builtin ToBooleanForBaselineJump(input: JSAny):
+    ToBooleanForBaselineJumpResult {
   try {
     BranchIfToBooleanIsTrue(input) otherwise IsTrue, IsFalse;
   } label IsTrue {
@@ -157,17 +159,20 @@ transitioning builtin ToObject(implicit context: Context)(input: JSAny):
 
 // ES6 section 7.1.1 ToPrimitive ( input [ , PreferredType ] )
 
-transitioning macro TryGetExoticToPrimitive(implicit context: Context)(
-    input: JSAny): JSAny labels OrdinaryToPrimitive {
+transitioning macro TryGetExoticToPrimitive(
+    implicit context: Context)(
+    input: JSReceiver): JSAny labels OrdinaryToPrimitive {
   // Look up the @@toPrimitive property.
   const exoticToPrimitive: JSAny =
-      GetProperty(input, ToPrimitiveSymbolConstant());
+      GetInterestingProperty(context, input, ToPrimitiveSymbolConstant())
+      otherwise OrdinaryToPrimitive;
   if (IsNullOrUndefined(exoticToPrimitive)) goto OrdinaryToPrimitive;
   return exoticToPrimitive;
 }
 
-transitioning macro CallExoticToPrimitive(implicit context: Context)(
-    input: JSAny, exoticToPrimitive: JSAny, hint: String): JSPrimitive {
+transitioning macro CallExoticToPrimitive(
+    implicit context: Context)(input: JSAny, exoticToPrimitive: JSAny,
+    hint: String): JSPrimitive {
   // Invoke the exoticToPrimitive method on the input with a string
   // representation of the hint.
   const result: JSAny = Call(context, exoticToPrimitive, input, hint);
@@ -192,8 +197,8 @@ transitioning builtin NonPrimitiveToPrimitive_Default(
       input, exoticToPrimitive, DefaultStringConstant());
 }
 
-transitioning builtin NonPrimitiveToPrimitive_Number(implicit context: Context)(
-    input: JSReceiver): JSPrimitive {
+transitioning builtin NonPrimitiveToPrimitive_Number(
+    implicit context: Context)(input: JSReceiver): JSPrimitive {
   const exoticToPrimitive: JSAny = TryGetExoticToPrimitive(input)
       otherwise return OrdinaryToPrimitive_Number_Inline(input);
   return CallExoticToPrimitive(
@@ -208,15 +213,16 @@ transitioning macro NonPrimitiveToPrimitive_String_Inline(
       input, exoticToPrimitive, StringStringConstant());
 }
 
-transitioning builtin NonPrimitiveToPrimitive_String(implicit context: Context)(
-    input: JSReceiver): JSPrimitive {
+transitioning builtin NonPrimitiveToPrimitive_String(
+    implicit context: Context)(input: JSReceiver): JSPrimitive {
   return NonPrimitiveToPrimitive_String_Inline(input);
 }
 
 // 7.1.1.1 OrdinaryToPrimitive ( O, hint )
 
-transitioning macro TryToPrimitiveMethod(implicit context: Context)(
-    input: JSAny, name: String): JSPrimitive labels Continue {
+transitioning macro TryToPrimitiveMethod(
+    implicit context: Context)(input: JSAny,
+    name: String): JSPrimitive labels Continue {
   const method: JSAny = GetProperty(input, name);
   typeswitch (method) {
     case (Callable): {
@@ -229,8 +235,8 @@ transitioning macro TryToPrimitiveMethod(implicit context: Context)(
   }
 }
 
-transitioning builtin OrdinaryToPrimitive_Number(implicit context: Context)(
-    input: JSAny): JSPrimitive {
+transitioning builtin OrdinaryToPrimitive_Number(
+    implicit context: Context)(input: JSAny): JSPrimitive {
   return OrdinaryToPrimitive_Number_Inline(input);
 }
 
@@ -247,8 +253,8 @@ transitioning builtin OrdinaryToPrimitive_Number_Inline(
   }
 }
 
-transitioning builtin OrdinaryToPrimitive_String(implicit context: Context)(
-    input: JSAny): JSPrimitive {
+transitioning builtin OrdinaryToPrimitive_String(
+    implicit context: Context)(input: JSAny): JSPrimitive {
   return OrdinaryToPrimitive_String_Inline(input);
 }
 
diff --git a/deps/v8/src/builtins/convert.tq b/deps/v8/src/builtins/convert.tq
index c5d235e18ed864..36eda98f16fe8b 100644
--- a/deps/v8/src/builtins/convert.tq
+++ b/deps/v8/src/builtins/convert.tq
@@ -361,6 +361,15 @@ Convert<float32, float64>(f: float64): float32 {
 Convert<float32, Number>(n: Number): float32 {
   return Convert<float32>(ChangeNumberToFloat64(n));
 }
+Convert<float32, int32>(n: int32): float32 {
+  return RoundInt32ToFloat32(n);
+}
+Convert<float32, HeapNumber>(h: HeapNumber): float32 {
+  return Convert<float32>(LoadHeapNumberValue(h));
+}
+Convert<Number, float32>(d: float32): Number {
+  return ChangeFloat32ToTagged(d);
+}
 Convert<Number, float64>(d: float64): Number {
   return ChangeFloat64ToTagged(d);
 }
@@ -391,6 +400,7 @@ Convert<intptr, Number>(n: Number): intptr {
 Convert<bint, int32>(v: int32): bint {
   return IntPtrToBInt(Convert<intptr>(v));
 }
+
 FromConstexpr<float64, constexpr IntegerLiteral>(v: constexpr IntegerLiteral):
     float64 {
   return ConstexprIntegerLiteralToFloat64(v);
diff --git a/deps/v8/src/builtins/data-view.tq b/deps/v8/src/builtins/data-view.tq
index 0ec6dc6dc250f6..b418d04e709783 100644
--- a/deps/v8/src/builtins/data-view.tq
+++ b/deps/v8/src/builtins/data-view.tq
@@ -67,8 +67,8 @@ macro WasDetached(view: JSArrayBufferView): bool {
   return IsDetachedBuffer(view.buffer);
 }
 
-macro ValidateDataView(
-    context: Context, o: JSAny, method: String): JSDataViewOrRabGsabDataView {
+macro ValidateDataView(context: Context, o: JSAny, method: String):
+    JSDataViewOrRabGsabDataView {
   typeswitch (o) {
     case (_x: JSDataView): {
       return UnsafeCast<JSDataView>(o);
@@ -84,8 +84,8 @@ macro ValidateDataView(
 
 // ES6 section 24.2.4.1 get DataView.prototype.buffer
 javascript builtin DataViewPrototypeGetBuffer(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(...arguments): JSArrayBuffer {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): JSArrayBuffer {
   const dataView: JSDataViewOrRabGsabDataView =
       ValidateDataView(context, receiver, 'get DataView.prototype.buffer');
   return dataView.buffer;
@@ -93,7 +93,8 @@ javascript builtin DataViewPrototypeGetBuffer(
 
 // ES6 section 24.2.4.2 get DataView.prototype.byteLength
 javascript builtin DataViewPrototypeGetByteLength(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): Number {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): Number {
   const dataView: JSDataViewOrRabGsabDataView =
       ValidateDataView(context, receiver, 'get DataView.prototype.byte_length');
   if (IsVariableLengthJSArrayBufferView(dataView)) {
@@ -116,7 +117,8 @@ javascript builtin DataViewPrototypeGetByteLength(
 
 // ES6 section 24.2.4.3 get DataView.prototype.byteOffset
 javascript builtin DataViewPrototypeGetByteOffset(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): Number {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): Number {
   const dataView: JSDataViewOrRabGsabDataView =
       ValidateDataView(context, receiver, 'get DataView.prototype.byte_offset');
   try {
@@ -240,8 +242,9 @@ const kOneDigitBigInt: constexpr int31 = 1;
 const kTwoDigitBigInt: constexpr int31 = 2;
 
 // Create a BigInt on a 64-bit architecture from two 32-bit values.
-macro MakeBigIntOn64Bit(implicit context: Context)(
-    lowWord: uint32, highWord: uint32, signed: constexpr bool): BigInt {
+macro MakeBigIntOn64Bit(
+    implicit context: Context)(lowWord: uint32, highWord: uint32,
+    signed: constexpr bool): BigInt {
   // 0n is represented by a zero-length BigInt.
   if (lowWord == 0 && highWord == 0) {
     return Convert<BigInt>(bigint::AllocateBigInt(kZeroDigitBigInt));
@@ -268,8 +271,9 @@ macro MakeBigIntOn64Bit(implicit context: Context)(
 }
 
 // Create a BigInt on a 32-bit architecture from two 32-bit values.
-macro MakeBigIntOn32Bit(implicit context: Context)(
-    lowWord: uint32, highWord: uint32, signed: constexpr bool): BigInt {
+macro MakeBigIntOn32Bit(
+    implicit context: Context)(lowWord: uint32, highWord: uint32,
+    signed: constexpr bool): BigInt {
   // 0n is represented by a zero-length BigInt.
   if (lowWord == 0 && highWord == 0) {
     return Convert<BigInt>(bigint::AllocateBigInt(kZeroDigitBigInt));
@@ -335,8 +339,9 @@ macro MakeBigIntOn32Bit(implicit context: Context)(
   return Convert<BigInt>(result);
 }
 
-macro MakeBigInt(implicit context: Context)(
-    lowWord: uint32, highWord: uint32, signed: constexpr bool): BigInt {
+macro MakeBigInt(
+    implicit context: Context)(lowWord: uint32, highWord: uint32,
+    signed: constexpr bool): BigInt {
   // A BigInt digit has the platform word size, so we only need one digit
   // on 64-bit platforms but may need two on 32-bit.
   if constexpr (Is64()) {
@@ -346,9 +351,9 @@ macro MakeBigInt(implicit context: Context)(
   }
 }
 
-macro LoadDataViewBigInt(implicit context: Context)(
-    buffer: JSArrayBuffer, offset: uintptr, requestedLittleEndian: bool,
-    signed: constexpr bool): BigInt {
+macro LoadDataViewBigInt(
+    implicit context: Context)(buffer: JSArrayBuffer, offset: uintptr,
+    requestedLittleEndian: bool, signed: constexpr bool): BigInt {
   const dataPointer: RawPtr = buffer.backing_store_ptr;
 
   const b0: uint32 = LoadUint8(dataPointer, offset);
@@ -545,11 +550,11 @@ transitioning javascript builtin DataViewPrototypeGetBigInt64(
 extern macro ToNumber(Context, JSAny): Number;
 extern macro TruncateFloat64ToWord32(float64): uint32;
 
-extern macro DataViewBuiltinsAssembler::StoreWord8(
-    RawPtr, uintptr, uint32): void;
+extern macro DataViewBuiltinsAssembler::StoreWord8(RawPtr, uintptr, uint32):
+    void;
 
-macro StoreDataView8(
-    buffer: JSArrayBuffer, offset: uintptr, value: uint32): void {
+macro StoreDataView8(buffer: JSArrayBuffer, offset: uintptr, value: uint32):
+    void {
   StoreWord8(buffer.backing_store_ptr, offset, value & 0xFF);
 }
 
diff --git a/deps/v8/src/builtins/finalization-registry.tq b/deps/v8/src/builtins/finalization-registry.tq
index 4e4b4be068669f..9e2b65023df707 100644
--- a/deps/v8/src/builtins/finalization-registry.tq
+++ b/deps/v8/src/builtins/finalization-registry.tq
@@ -4,16 +4,14 @@
 #include "src/builtins/builtins-collections-gen.h"
 
 namespace runtime {
-extern runtime
-ShrinkFinalizationRegistryUnregisterTokenMap(
+extern runtime ShrinkFinalizationRegistryUnregisterTokenMap(
     Context, JSFinalizationRegistry): void;
 extern runtime JSFinalizationRegistryRegisterWeakCellWithUnregisterToken(
     implicit context: Context)(JSFinalizationRegistry, WeakCell): void;
 }
 
 namespace weakref {
-extern transitioning macro
-RemoveFinalizationRegistryCellFromUnregisterTokenMap(
+extern transitioning macro RemoveFinalizationRegistryCellFromUnregisterTokenMap(
     JSFinalizationRegistry, WeakCell): void;
 
 extern macro WeakCollectionsBuiltinsAssembler::GotoIfCannotBeHeldWeakly(JSAny):
@@ -33,9 +31,9 @@ macro SplitOffTail(weakCell: WeakCell): WeakCell|Undefined {
   return weakCellTail;
 }
 
-transitioning macro
-PopClearedCell(finalizationRegistry: JSFinalizationRegistry): WeakCell|
-    Undefined {
+transitioning macro PopClearedCell(finalizationRegistry:
+                                       JSFinalizationRegistry): WeakCell
+    |Undefined {
   typeswitch (finalizationRegistry.cleared_cells) {
     case (Undefined): {
       return Undefined;
@@ -71,9 +69,9 @@ transitioning macro PushCell(
   finalizationRegistry.active_cells = cell;
 }
 
-transitioning macro
-FinalizationRegistryCleanupLoop(implicit context: Context)(
-    finalizationRegistry: JSFinalizationRegistry, callback: Callable): void {
+transitioning macro FinalizationRegistryCleanupLoop(
+    implicit context: Context)(finalizationRegistry: JSFinalizationRegistry,
+    callback: Callable): void {
   while (true) {
     const weakCellHead = PopClearedCell(finalizationRegistry);
     typeswitch (weakCellHead) {
@@ -96,8 +94,7 @@ FinalizationRegistryCleanupLoop(implicit context: Context)(
       context, finalizationRegistry);
 }
 
-transitioning javascript builtin
-FinalizationRegistryConstructor(
+transitioning javascript builtin FinalizationRegistryConstructor(
     js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny,
     target: JSFunction)(cleanupCallback: JSAny): JSFinalizationRegistry {
   // 1. If NewTarget is undefined, throw a TypeError exception.
@@ -129,9 +126,8 @@ FinalizationRegistryConstructor(
   return finalizationRegistry;
 }
 
-// https://tc39.es/proposal-symbols-as-weakmap-keys/#sec-finalization-registry.prototype.register
-transitioning javascript builtin
-FinalizationRegistryRegister(
+// https://tc39.es/ecma262/#sec-finalization-registry.prototype.register
+transitioning javascript builtin FinalizationRegistryRegister(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // 1. Let finalizationRegistry be the this value.
   // 2. Perform ? RequireInternalSlot(finalizationRegistry, [[Cells]]).
@@ -194,8 +190,7 @@ FinalizationRegistryRegister(
   return Undefined;
 }
 
-transitioning javascript builtin
-FinalizationRegistryPrototypeCleanupSome(
+transitioning javascript builtin FinalizationRegistryPrototypeCleanupSome(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // 1. Let finalizationRegistry be the this value.
   //
diff --git a/deps/v8/src/builtins/frame-arguments.tq b/deps/v8/src/builtins/frame-arguments.tq
index cd9d3d84d615b9..fe499a881f3531 100644
--- a/deps/v8/src/builtins/frame-arguments.tq
+++ b/deps/v8/src/builtins/frame-arguments.tq
@@ -14,6 +14,7 @@ struct Arguments {
 }
 
 extern operator '[]' macro GetArgumentValue(Arguments, intptr): JSAny;
+extern operator '[]=' macro SetArgumentValue(Arguments, intptr, Object): void;
 extern macro GetFrameArguments(FrameWithArguments, intptr): Arguments;
 
 struct ArgumentsIterator {
diff --git a/deps/v8/src/builtins/frames.tq b/deps/v8/src/builtins/frames.tq
index 121c3bb3e112e9..47a3a651f971ec 100644
--- a/deps/v8/src/builtins/frames.tq
+++ b/deps/v8/src/builtins/frames.tq
@@ -35,6 +35,7 @@ type Frame = FrameWithArguments|StubFrame;
 
 extern macro LoadFramePointer(): Frame;
 extern macro LoadParentFramePointer(): Frame;
+extern macro StackSlotPtr(constexpr int32, constexpr int32): RawPtr;
 
 // Load values from a specified frame by given offset in bytes.
 macro LoadObjectFromFrame(f: Frame, o: constexpr int32): Object {
@@ -75,8 +76,8 @@ operator '.argument_count' macro LoadArgCFromFrame(f: Frame): intptr {
 }
 
 type ContextOrFrameType = Context|FrameType;
-Cast<ContextOrFrameType>(implicit context: Context)(o: Object):
-    ContextOrFrameType
+Cast<ContextOrFrameType>(
+    implicit context: Context)(o: Object): ContextOrFrameType
     labels CastError {
   typeswitch (o) {
     case (c: Context): {
@@ -93,9 +94,8 @@ Cast<ContextOrFrameType>(implicit context: Context)(o: Object):
 
 const kStandardFrameContextOrFrameTypeOffset: constexpr int31
     generates 'StandardFrameConstants::kContextOrFrameTypeOffset';
-operator '.context_or_frame_type'
-macro LoadContextOrFrameTypeFromFrame(implicit context: Context)(f: Frame):
-    ContextOrFrameType {
+operator '.context_or_frame_type' macro LoadContextOrFrameTypeFromFrame(
+    implicit context: Context)(f: Frame): ContextOrFrameType {
   return UnsafeCast<ContextOrFrameType>(
       LoadObjectFromFrame(f, kStandardFrameContextOrFrameTypeOffset));
 }
@@ -104,10 +104,10 @@ operator '==' macro FrameTypeEquals(f1: FrameType, f2: FrameType): bool {
   return TaggedEqual(f1, f2);
 }
 
-macro Cast<A : type extends Frame>(implicit context: Context)(o: Frame):
-    A labels CastError;
-Cast<StandardFrame>(implicit context: Context)(f: Frame):
-    StandardFrame labels CastError {
+macro Cast<A : type extends Frame>(
+    implicit context: Context)(o: Frame): A labels CastError;
+Cast<StandardFrame>(
+    implicit context: Context)(f: Frame): StandardFrame labels CastError {
   const o: HeapObject =
       Cast<HeapObject>(f.context_or_frame_type) otherwise CastError;
   // StandardFrames (which include interpreted and JIT-compiled frames),
diff --git a/deps/v8/src/builtins/function.tq b/deps/v8/src/builtins/function.tq
index ccc3c5bc812c7b..413de58619146d 100644
--- a/deps/v8/src/builtins/function.tq
+++ b/deps/v8/src/builtins/function.tq
@@ -12,9 +12,8 @@ javascript builtin FunctionPrototypeHasInstance(
   return OrdinaryHasInstance(context, receiver, value);
 }
 
-extern transitioning builtin
-FunctionPrototypeBind(implicit context: Context)(
-    JSFunction, JSAny, int32): JSAny;
+extern transitioning builtin FunctionPrototypeBind(
+    implicit context: Context)(JSFunction, JSAny, int32): JSAny;
 
 const kLengthDescriptorIndex: constexpr int32
     generates 'JSFunctionOrBoundFunctionOrWrappedFunction::kLengthDescriptorIndex'
@@ -25,8 +24,8 @@ const kNameDescriptorIndex: constexpr int32
 const kMinDescriptorsForFastBindAndWrap: constexpr int31
     generates 'JSFunction::kMinDescriptorsForFastBindAndWrap';
 
-macro CheckAccessor(implicit context: Context)(
-    array: DescriptorArray, index: constexpr int32,
+macro CheckAccessor(
+    implicit context: Context)(array: DescriptorArray, index: constexpr int32,
     name: Name): void labels Slow {
   const descriptor: DescriptorEntry = array.descriptors[index];
   const key: Name|Undefined = descriptor.key;
@@ -37,8 +36,7 @@ macro CheckAccessor(implicit context: Context)(
 }
 
 // ES6 section 19.2.3.2 Function.prototype.bind
-transitioning javascript builtin
-FastFunctionPrototypeBind(
+transitioning javascript builtin FastFunctionPrototypeBind(
     js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny,
     target: JSFunction)(...arguments): JSAny {
   const argc: intptr = arguments.actual_count;
diff --git a/deps/v8/src/builtins/ia32/builtins-ia32.cc b/deps/v8/src/builtins/ia32/builtins-ia32.cc
index 5e8ba2dee60112..f603a1e611cc28 100644
--- a/deps/v8/src/builtins/ia32/builtins-ia32.cc
+++ b/deps/v8/src/builtins/ia32/builtins-ia32.cc
@@ -248,19 +248,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   __ mov(edi, Operand(ebp, ConstructFrameConstants::kConstructorOffset));
   __ InvokeFunction(edi, edx, eax, InvokeType::kCall);
 
-  // ----------- S t a t e -------------
-  //  --                eax: constructor result
-  //  -- sp[0*kSystemPointerSize]: implicit receiver
-  //  -- sp[1*kSystemPointerSize]: padding
-  //  -- sp[2*kSystemPointerSize]: constructor function
-  //  -- sp[3*kSystemPointerSize]: number of arguments
-  //  -- sp[4*kSystemPointerSize]: context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -708,9 +695,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     // We abuse new.target both to indicate that this is a resume call and to
     // pass in the generator object.  In ordinary calls, new.target is always
     // undefined because generator functions are non-constructable.
-    static_assert(kJavaScriptCallCodeStartRegister == ecx, "ABI mismatch");
-    __ mov(ecx, FieldOperand(edi, JSFunction::kCodeOffset));
-    __ JumpCodeObject(ecx);
+    __ JumpJSFunction(edi);
   }
 
   __ bind(&prepare_step_in_if_stepping);
@@ -864,17 +849,23 @@ static void AdvanceBytecodeOffsetOrReturn(MacroAssembler* masm,
 
 namespace {
 
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array) {
-  __ mov_w(FieldOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset),
-           Immediate(0));
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi) {
+  __ mov_w(FieldOperand(sfi, SharedFunctionInfo::kAgeOffset), Immediate(0));
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function,
+                        Register scratch) {
+  const Register shared_function_info(scratch);
+  __ Move(shared_function_info,
+          FieldOperand(js_function, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, shared_function_info);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
                                    Register feedback_vector, Register scratch) {
   __ mov_b(scratch,
            FieldOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
-  __ and_(scratch,
-          Immediate(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ and_(scratch, Immediate(~FeedbackVector::OsrUrgencyBits::kMask));
   __ mov_b(FieldOperand(feedback_vector, FeedbackVector::kOsrStateOffset),
            scratch);
 }
@@ -920,7 +911,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // frame.
   __ mov(feedback_vector,
          FieldOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ mov(feedback_vector, FieldOperand(feedback_vector, Cell::kValueOffset));
+  __ mov(feedback_vector,
+         FieldOperand(feedback_vector, FeedbackCell::kValueOffset));
   __ mov(eax, FieldOperand(feedback_vector, HeapObject::kMapOffset));
   __ CmpInstanceType(eax, FEEDBACK_VECTOR_TYPE);
   __ j(not_equal, &push_stack_frame);
@@ -936,7 +928,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // TODO(jgruber): Don't clobber it above.
   __ mov(feedback_vector,
          FieldOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ mov(feedback_vector, FieldOperand(feedback_vector, Cell::kValueOffset));
+  __ mov(feedback_vector,
+         FieldOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   {
     static constexpr Register scratch = eax;
@@ -967,6 +960,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // Get the bytecode array from the function object and load it into
   // kInterpreterBytecodeArrayRegister.
   __ mov(eax, FieldOperand(edi, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, eax);
   __ mov(kInterpreterBytecodeArrayRegister,
          FieldOperand(eax, SharedFunctionInfo::kFunctionDataOffset));
   GetSharedFunctionInfoBytecode(masm, kInterpreterBytecodeArrayRegister, eax);
@@ -981,8 +975,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
         AbortReason::kFunctionDataShouldBeBytecodeArrayOnInterpreterEntry);
   }
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
-
   // Push bytecode array.
   __ push(kInterpreterBytecodeArrayRegister);
   // Push Smi tagged initial bytecode array offset.
@@ -1136,7 +1128,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     // Load the feedback vector from the closure.
     __ mov(feedback_vector,
            FieldOperand(closure, JSFunction::kFeedbackCellOffset));
-    __ mov(feedback_vector, FieldOperand(feedback_vector, Cell::kValueOffset));
+    __ mov(feedback_vector,
+           FieldOperand(feedback_vector, FeedbackCell::kValueOffset));
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1407,6 +1400,205 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   __ int3();
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- eax : argument count
+  // -- edi : constructor to call
+  // -- edx : new target (checked to be a JSFunction)
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+
+  Register implicit_receiver = ecx;
+
+  // Save live registers.
+  __ SmiTag(eax);
+  __ Push(eax);  // Number of arguments
+  __ Push(edx);  // NewTarget
+  __ Push(edi);  // Target
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  // Save result.
+  __ mov(implicit_receiver, eax);
+  // Restore live registers.
+  __ Pop(edi);
+  __ Pop(edx);
+  __ Pop(eax);
+  __ SmiUntag(eax);
+
+  // Patch implicit receiver (in arguments)
+  __ mov(Operand(esp, 0 /* first argument */), implicit_receiver);
+  // Patch second implicit (in construct frame)
+  __ mov(Operand(ebp, FastConstructFrameConstants::kImplicitReceiverOffset),
+         implicit_receiver);
+
+  // Restore context.
+  __ mov(esi, Operand(ebp, FastConstructFrameConstants::kContextOffset));
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- eax     : the number of arguments
+  //  -- ecx     : the address of the first argument to be pushed. Subsequent
+  //               arguments should be consecutive above this, in the same order
+  //               as they are to be pushed onto the stack.
+  //  -- esi     : the context
+  //  -- esp[0]  : return address
+  //  -- esp[4]  : allocation site feedback (if available or undefined)
+  //  -- esp[8]  : the new target
+  //  -- esp[12] : the constructor (checked to be a JSFunction)
+  // -----------------------------------
+
+  // Load constructor.
+  __ mov(edi, Operand(esp, 3 * kSystemPointerSize));
+  __ AssertFunction(edi, edx);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  // Load constructor.
+  __ LoadMap(edx, edi);
+  __ test_b(FieldOperand(edx, Map::kBitFieldOffset),
+            Immediate(Map::Bits1::IsConstructorBit::kMask));
+  __ j(zero, &non_constructor);
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(eax, edx, &stack_overflow, true);
+
+  // Spill number of arguments.
+  __ movd(xmm0, eax);
+
+  // Load NewTarget.
+  __ mov(edx, Operand(esp, 2 * kSystemPointerSize));
+
+  // Drop stub arguments from the stack.
+  __ PopReturnAddressTo(eax);
+  __ Drop(3);  // The allocation site is unused.
+  __ PushReturnAddressFrom(eax);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+  __ Push(esi);
+  // Implicit receiver stored in the construct frame.
+  __ PushRoot(RootIndex::kTheHoleValue);
+
+  // Push arguments + implicit receiver
+  __ movd(eax, xmm0);  // Recover number of arguments.
+  // Find the address of the last argument.
+  __ lea(esi, Operand(eax, times_system_pointer_size,
+                      -kJSArgcReceiverSlots * kSystemPointerSize));
+  __ neg(esi);
+  __ add(esi, ecx);
+  GenerateInterpreterPushArgs(masm, esi, ecx);
+  __ PushRoot(RootIndex::kTheHoleValue);
+
+  // Restore context.
+  __ mov(esi, Operand(ebp, FastConstructFrameConstants::kContextOffset));
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  __ mov(ecx, FieldOperand(edi, JSFunction::kSharedFunctionInfoOffset));
+  __ test(FieldOperand(ecx, SharedFunctionInfo::kFlagsOffset),
+          Immediate(SharedFunctionInfo::ConstructAsBuiltinBit::kMask));
+  __ j(not_zero, &builtin_call);
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ mov(ecx, FieldOperand(ecx, SharedFunctionInfo::kFlagsOffset));
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(ecx);
+  __ JumpIfIsInRange(
+      ecx, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor), ecx,
+      &not_create_implicit_receiver, Label::kNear);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the constructor.
+  __ InvokeFunction(edi, edx, eax, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- eax     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+
+  Label check_result, use_receiver, do_throw, leave_and_return;
+  // If the result is undefined, we jump out to using the implicit receiver.
+  __ JumpIfNotRoot(eax, RootIndex::kUndefinedValue, &check_result,
+                   Label::kNear);
+
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ bind(&use_receiver);
+  __ mov(eax, Operand(esp, 0 * kSystemPointerSize));
+  __ JumpIfRoot(eax, RootIndex::kTheHoleValue, &do_throw);
+
+  __ bind(&leave_and_return);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ ret(0);
+
+  // Otherwise we do a smi check and fall through to check if the return value
+  // is a valid receiver.
+  __ bind(&check_result);
+
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(eax, &use_receiver, Label::kNear);
+
+  // If the type of the result (stored in its map) is less than
+  // FIRST_JS_RECEIVER_TYPE, it is not an object in the ECMA sense.
+  static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
+  __ CmpObjectType(eax, FIRST_JS_RECEIVER_TYPE, ecx);
+  __ j(above_equal, &leave_and_return, Label::kNear);
+  __ jmp(&use_receiver, Label::kNear);
+
+  __ bind(&do_throw);
+  // Restore context from the frame.
+  __ mov(esi, Operand(ebp, ConstructFrameConstants::kContextOffset));
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  // This should be unreachable.
+  __ int3();
+
+  __ bind(&builtin_call);
+  __ InvokeFunction(edi, edx, eax, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ ret(0);
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+
+  // Throw stack overflow exception.
+  __ bind(&stack_overflow);
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  // This should be unreachable.
+  __ int3();
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Set the return address to the correct point in the interpreter entry
   // trampoline.
@@ -1431,7 +1623,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
 
   __ mov(scratch,
          FieldOperand(scratch, InterpreterData::kInterpreterTrampolineOffset));
-  __ LoadCodeEntry(scratch, scratch);
+  __ LoadCodeInstructionStart(scratch, scratch);
   __ jmp(&trampoline_loaded, Label::kNear);
 
   __ bind(&builtin_trampoline);
@@ -1564,7 +1756,8 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
       BaselineOutOfLinePrologueDescriptor::kClosure);
   __ mov(feedback_vector,
          FieldOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ mov(feedback_vector, FieldOperand(feedback_vector, Cell::kValueOffset));
+  __ mov(feedback_vector,
+         FieldOperand(feedback_vector, FeedbackCell::kValueOffset));
   __ AssertFeedbackVector(feedback_vector, scratch);
 
   // Load the optimization state from the feedback vector and re-use the
@@ -1604,6 +1797,7 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
         BaselineOutOfLinePrologueDescriptor::kClosure);
     DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
     DCHECK_EQ(callee_js_function, kJSFunctionRegister);
+    ResetJSFunctionAge(masm, callee_js_function, scratch);
     __ Push(callee_js_function);        // Callee's JS function.
     __ Push(saved_arg_count, scratch);  // Push actual argument count.
 
@@ -1611,7 +1805,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // the frame, so load it into a register.
     Register bytecode_array = scratch;
     __ movd(bytecode_array, saved_bytecode_array);
-    ResetBytecodeAge(masm, bytecode_array);
     __ Push(bytecode_array);
 
     // Baseline code frames store the feedback vector where interpreter would
@@ -1730,7 +1923,7 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
   // address.
   int offset_to_builtin_index = allocatable_register_count * kSystemPointerSize;
   __ mov(eax, Operand(esp, offset_to_builtin_index));
-  __ LoadEntryFromBuiltinIndex(eax);
+  __ LoadEntryFromBuiltinIndex(eax, eax);
   __ mov(Operand(esp, offset_to_builtin_index), eax);
 
   for (int i = allocatable_register_count - 1; i >= 0; --i) {
@@ -2065,7 +2258,7 @@ void Generate_AllocateSpaceAndShiftExistingArguments(
 }  // namespace
 
 // static
-// TODO(v8:11615): Observe InstructionStream::kMaxArguments in
+// TODO(v8:11615): Observe Code::kMaxArguments in
 // CallOrConstructVarargs
 void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
                                                Handle<Code> code) {
@@ -2751,7 +2944,7 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
                                kHeapObjectTag));
   __ SmiUntag(ecx);
 
-  __ LoadCodeEntry(eax, eax);
+  __ LoadCodeInstructionStart(eax, eax);
 
   // Compute the target address = code_entry + osr_offset
   __ add(eax, ecx);
@@ -2988,16 +3181,186 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
   __ ret(0);
 }
 
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
-  // TODO(v8:10701): Implement for this platform.
-  __ Trap();
+void ResetStackSwitchFrameStackSlots(MacroAssembler* masm) {
+  Register zero = eax;
+  __ Move(zero, Smi::zero());
+  __ mov(MemOperand(ebp, StackSwitchFrameConstants::kInstanceOffset), zero);
+  __ mov(MemOperand(ebp, StackSwitchFrameConstants::kResultArrayOffset), zero);
+}
+
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) {
+  __ EnterFrame(StackFrame::JS_TO_WASM);
+
+  constexpr int kNumSpillSlots = StackSwitchFrameConstants::kNumSpillSlots;
+  __ sub(esp, Immediate(kNumSpillSlots * kSystemPointerSize));
+  ResetStackSwitchFrameStackSlots(masm);
+
+  Register wrapper_buffer =
+      WasmJSToWasmWrapperDescriptor::WrapperBufferRegister();
+  // Push the wrapper_buffer stack, it's needed later for the results.
+  __ mov(MemOperand(ebp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset),
+         wrapper_buffer);
+  Register result_size = eax;
+  __ mov(
+      result_size,
+      MemOperand(
+          wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferSize));
+  __ shl(result_size, kSystemPointerSizeLog2);
+  __ sub(esp, result_size);
+  __ mov(
+      MemOperand(
+          wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferStart),
+      esp);
+  Register params_start = eax;
+  __ mov(params_start,
+         MemOperand(wrapper_buffer,
+                    JSToWasmWrapperFrameConstants::kWrapperBufferParamStart));
+  Register params_end = esi;
+  __ mov(params_end,
+         MemOperand(wrapper_buffer,
+                    JSToWasmWrapperFrameConstants::kWrapperBufferParamEnd));
+  Register call_target = edi;
+  __ mov(call_target,
+         MemOperand(wrapper_buffer,
+                    JSToWasmWrapperFrameConstants::kWrapperBufferCallTarget));
+
+  Register last_stack_param = ecx;
+
+  // The first GP parameter is the instance, which we handle specially.
+  int stack_params_offset =
+      (arraysize(wasm::kGpParamRegisters) - 1) * kSystemPointerSize +
+      arraysize(wasm::kFpParamRegisters) * kDoubleSize;
+  int param_padding = stack_params_offset & kSystemPointerSize;
+  stack_params_offset += param_padding;
+  __ lea(last_stack_param, MemOperand(params_start, stack_params_offset));
+
+  Label loop_start;
+  __ bind(&loop_start);
+
+  Label finish_stack_params;
+  __ cmp(last_stack_param, params_end);
+  __ j(greater_equal, &finish_stack_params);
+
+  // Push parameter
+  __ sub(params_end, Immediate(kSystemPointerSize));
+  __ push(MemOperand(params_end, 0));
+  __ jmp(&loop_start);
+
+  __ bind(&finish_stack_params);
+
+  int next_offset = stack_params_offset;
+  for (size_t i = arraysize(wasm::kFpParamRegisters) - 1;
+       i < arraysize(wasm::kFpParamRegisters); --i) {
+    next_offset -= kDoubleSize;
+    __ Movsd(wasm::kFpParamRegisters[i], MemOperand(params_start, next_offset));
+  }
+
+  // Set the flag-in-wasm flag before loading the parameter registers. There are
+  // not so many registers, so we use one of the parameter registers before it
+  // is blocked.
+  Register thread_in_wasm_flag_addr = ecx;
+  __ mov(
+      thread_in_wasm_flag_addr,
+      MemOperand(kRootRegister, Isolate::thread_in_wasm_flag_address_offset()));
+  __ mov(MemOperand(thread_in_wasm_flag_addr, 0), Immediate(1));
+
+  next_offset -= param_padding;
+  for (size_t i = arraysize(wasm::kGpParamRegisters) - 1; i > 0; --i) {
+    next_offset -= kSystemPointerSize;
+    __ mov(wasm::kGpParamRegisters[i], MemOperand(params_start, next_offset));
+  }
+  DCHECK_EQ(next_offset, 0);
+  // Since there are so few registers, {params_start} overlaps with one of the
+  // parameter registers. Make sure it overlaps with the last one we fill.
+  DCHECK_EQ(params_start, wasm::kGpParamRegisters[1]);
+
+  __ mov(kWasmInstanceRegister,
+         MemOperand(ebp, JSToWasmWrapperFrameConstants::kInstanceParamOffset));
+
+  __ call(call_target);
+
+  __ mov(
+      thread_in_wasm_flag_addr,
+      MemOperand(kRootRegister, Isolate::thread_in_wasm_flag_address_offset()));
+  __ mov(MemOperand(thread_in_wasm_flag_addr, 0), Immediate(0));
+  thread_in_wasm_flag_addr = no_reg;
+
+  wrapper_buffer = esi;
+  __ mov(wrapper_buffer,
+         MemOperand(ebp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset));
+
+  __ Movsd(MemOperand(
+               wrapper_buffer,
+               JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister1),
+           wasm::kFpReturnRegisters[0]);
+  __ Movsd(MemOperand(
+               wrapper_buffer,
+               JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister2),
+           wasm::kFpReturnRegisters[1]);
+  __ mov(MemOperand(
+             wrapper_buffer,
+             JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister1),
+         wasm::kGpReturnRegisters[0]);
+  __ mov(MemOperand(
+             wrapper_buffer,
+             JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister2),
+         wasm::kGpReturnRegisters[1]);
+
+  // Call the return value builtin with
+  // eax: wasm instance.
+  // ecx: the result JSArray for multi-return.
+  // edx: pointer to the wrapper buffer which contains all parameters.
+  __ mov(eax,
+         MemOperand(ebp, JSToWasmWrapperFrameConstants::kInstanceParamOffset));
+  __ mov(ecx, MemOperand(
+                  ebp, JSToWasmWrapperFrameConstants::kResultArrayParamOffset));
+  __ mov(edx, wrapper_buffer);
+  __ Call(BUILTIN_CODE(masm->isolate(), JSToWasmHandleReturns),
+          RelocInfo::CODE_TARGET);
+
+  __ LeaveFrame(StackFrame::JS_TO_WASM);
+  __ ret(0);
 }
 
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
   // TODO(v8:12191): Implement for this platform.
   __ Trap();
 }
 
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) {
+  // Pop the return address into a scratch register and push it later again. The
+  // return address has to be on top of the stack after all registers have been
+  // pushed, so that the return instruction can find it.
+  Register scratch = edi;
+  __ pop(scratch);
+
+  int required_stack_space = arraysize(wasm::kFpParamRegisters) * kDoubleSize;
+  __ sub(esp, Immediate(required_stack_space));
+  for (int i = 0; i < static_cast<int>(arraysize(wasm::kFpParamRegisters));
+       ++i) {
+    __ Movsd(MemOperand(esp, i * kDoubleSize), wasm::kFpParamRegisters[i]);
+  }
+  // eax is pushed for alignment, so that the pushed register parameters and
+  // stack parameters look the same as the layout produced by the js-to-wasm
+  // wrapper for out-going parameters. Having the same layout allows to share
+  // code in Torque, especially the `LocationAllocator`. eax has been picked
+  // arbitrarily.
+  __ push(eax);
+  // Push the GP registers in reverse order so that they are on the stack like
+  // in an array, with the first item being at the lowest address.
+  for (size_t i = arraysize(wasm::kGpParamRegisters) - 1; i > 0; --i) {
+    __ push(wasm::kGpParamRegisters[i]);
+  }
+  // Decrement the stack to allocate a stack slot. The signature gets written
+  // into the slot in Torque.
+  __ push(eax);
+  // Push the return address again.
+  __ push(scratch);
+  __ TailCallBuiltin(Builtin::kWasmToJsWrapperCSA);
+}
+
 void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   // TODO(v8:12191): Implement for this platform.
   __ Trap();
@@ -3020,7 +3383,8 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   CHECK(result_size == 1 || result_size == 2);
 
   using ER = ExternalReference;
@@ -3259,184 +3623,20 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ ret(0);
 }
 
-namespace {
-
-// Generates an Operand for saving parameters after PrepareCallApiFunction.
-Operand ApiParameterOperand(int index) {
-  return Operand(esp, index * kSystemPointerSize);
-}
-
-Operand ExitFrameCallerStackSlotOperand(int index) {
-  return Operand(ebp,
-                 (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
-                     kSystemPointerSize);
-}
-
-// Prepares stack to put arguments (aligns and so on). Reserves
-// space for return value if needed (assumes the return value is a handle).
-// Arguments must be stored in ApiParameterOperand(0), ApiParameterOperand(1)
-// etc. Saves context (esi). If space was reserved for return value then
-// stores the pointer to the reserved slot into esi.
-void PrepareCallApiFunction(MacroAssembler* masm, int argc, Register scratch) {
-  ASM_CODE_COMMENT(masm);
-  __ EnterExitFrame(argc, StackFrame::EXIT, scratch);
-  if (v8_flags.debug_code) {
-    __ mov(esi, Immediate(base::bit_cast<int32_t>(kZapValue)));
-  }
-}
-
-// Calls an API function.  Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.  Clobbers esi, edi and
-// caller-save registers.  Restores context.  On return removes
-// stack_space * kSystemPointerSize (GCed).
-void CallApiFunctionAndReturn(MacroAssembler* masm, Register function_address,
-                              ExternalReference thunk_ref,
-                              Operand thunk_last_arg, int stack_space,
-                              Operand* stack_space_operand,
-                              Operand return_value_operand) {
-  Isolate* isolate = masm->isolate();
-
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  ExternalReference limit_address =
-      ExternalReference::handle_scope_limit_address(isolate);
-  ExternalReference level_address =
-      ExternalReference::handle_scope_level_address(isolate);
-
-  DCHECK(edx == function_address);
-  // Allocate HandleScope in callee-save registers.
-  __ add(__ ExternalReferenceAsOperand(level_address, esi), Immediate(1));
-  __ mov(esi, __ ExternalReferenceAsOperand(next_address, esi));
-  __ mov(edi, __ ExternalReferenceAsOperand(limit_address, edi));
-
-  Label profiler_enabled, done_api_call;
-  __ cmpb(__ ExternalReferenceAsOperand(
-              ExternalReference::is_profiling_address(isolate), eax),
-          Immediate(0));
-  __ j(not_zero, &profiler_enabled);
-#ifdef V8_RUNTIME_CALL_STATS
-  __ Move(eax, Immediate(ExternalReference::address_of_runtime_stats_flag()));
-  __ cmp(Operand(eax, 0), Immediate(0));
-  __ j(not_zero, &profiler_enabled);
-#endif  // V8_RUNTIME_CALL_STATS
-
-  // Call the api function directly.
-  __ call(function_address);
-  __ bind(&done_api_call);
-
-  // Load the value from ReturnValue
-  __ mov(eax, return_value_operand);
-
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ mov(__ ExternalReferenceAsOperand(next_address, ecx), esi);
-  __ sub(__ ExternalReferenceAsOperand(level_address, ecx), Immediate(1));
-  __ Assert(above_equal, AbortReason::kInvalidHandleScopeLevel);
-  __ cmp(edi, __ ExternalReferenceAsOperand(limit_address, ecx));
-  __ j(not_equal, &delete_allocated_handles);
-
-  // Leave the API exit frame.
-  __ bind(&leave_exit_frame);
-  if (stack_space_operand != nullptr) {
-    DCHECK_EQ(stack_space, 0);
-    __ mov(edx, *stack_space_operand);
-  }
-  __ LeaveExitFrame(esi);
-
-  // Check if the function scheduled an exception.
-  ExternalReference scheduled_exception_address =
-      ExternalReference::scheduled_exception_address(isolate);
-  __ mov(ecx, __ ExternalReferenceAsOperand(scheduled_exception_address, ecx));
-  __ CompareRoot(ecx, RootIndex::kTheHoleValue);
-  __ j(not_equal, &promote_scheduled_exception);
-
-#if DEBUG
-  // Check if the function returned a valid JavaScript value.
-  Label ok;
-  Register return_value = eax;
-  Register map = ecx;
-
-  __ JumpIfSmi(return_value, &ok, Label::kNear);
-  __ mov(map, FieldOperand(return_value, HeapObject::kMapOffset));
-
-  __ CmpInstanceType(map, LAST_NAME_TYPE);
-  __ j(below_equal, &ok, Label::kNear);
-
-  __ CmpInstanceType(map, FIRST_JS_RECEIVER_TYPE);
-  __ j(above_equal, &ok, Label::kNear);
-
-  __ CompareRoot(map, RootIndex::kHeapNumberMap);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(map, RootIndex::kBigIntMap);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(return_value, RootIndex::kUndefinedValue);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(return_value, RootIndex::kTrueValue);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(return_value, RootIndex::kFalseValue);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(return_value, RootIndex::kNullValue);
-  __ j(equal, &ok, Label::kNear);
-
-  __ Abort(AbortReason::kAPICallReturnedInvalidObject);
-
-  __ bind(&ok);
-#endif
-
-  if (stack_space_operand == nullptr) {
-    DCHECK_NE(stack_space, 0);
-    __ ret(stack_space * kSystemPointerSize);
-  } else {
-    DCHECK_EQ(0, stack_space);
-    __ pop(ecx);
-    __ add(esp, edx);
-    __ jmp(ecx);
-  }
-
-  // Call the api function via thunk wrapper.
-  __ bind(&profiler_enabled);
-  // Additional parameter is the address of the actual getter function.
-  __ mov(thunk_last_arg, function_address);
-  __ Move(eax, Immediate(thunk_ref));
-  __ call(eax);
-  __ jmp(&done_api_call);
-
-  // Re-throw by promoting a scheduled exception.
-  __ bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  ExternalReference delete_extensions =
-      ExternalReference::delete_handle_scope_extensions();
-  __ bind(&delete_allocated_handles);
-  __ mov(__ ExternalReferenceAsOperand(limit_address, ecx), edi);
-  __ mov(edi, eax);
-  __ Move(eax, Immediate(ExternalReference::isolate_address(isolate)));
-  __ mov(Operand(esp, 0), eax);
-  __ Move(eax, Immediate(delete_extensions));
-  __ call(eax);
-  __ mov(eax, edi);
-  __ jmp(&leave_exit_frame);
-}
-
-}  // namespace
-
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- esi                 : context
-  //  -- edx                 : api function address
+  // CallApiCallbackMode::kGeneric mode:
   //  -- ecx                 : arguments count (not including the receiver)
-  //  -- eax                 : call data
+  //  -- edx                 : call handler info
   //  -- edi                 : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
+  //  -- eax                 : api function address
+  //  -- ecx                 : arguments count (not including the receiver)
+  //  -- edx                 : call data
+  //  -- edi                 : holder
+  // Both modes:
+  //  -- esi                 : context
   //  -- esp[0]              : return address
   //  -- esp[8]              : argument 0 (receiver)
   //  -- esp[16]             : argument 1
@@ -3445,15 +3645,30 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   //  -- esp[(argc + 1) * 8] : argument argc
   // -----------------------------------
 
-  Register api_function_address = edx;
-  Register argc = ecx;
-  Register call_data = eax;
-  Register holder = edi;
-
-  // Park argc in xmm0.
-  __ movd(xmm0, argc);
-
-  DCHECK(!AreAliased(api_function_address, argc, holder));
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register callback = no_reg;
+  Register holder = no_reg;
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = eax;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, call_data, callback, holder));
 
   using FCA = FunctionCallbackArguments;
 
@@ -3461,7 +3676,7 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
@@ -3472,145 +3687,264 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   //
   // Target state:
   //   esp[0 * kSystemPointerSize]: return address
-  //   esp[1 * kSystemPointerSize]: kHolder
+  //   esp[1 * kSystemPointerSize]: kHolder   <= implicit_args_
   //   esp[2 * kSystemPointerSize]: kIsolate
-  //   esp[3 * kSystemPointerSize]: undefined (kReturnValueDefaultValue)
+  //   esp[3 * kSystemPointerSize]: undefined (padding, unused)
   //   esp[4 * kSystemPointerSize]: undefined (kReturnValue)
   //   esp[5 * kSystemPointerSize]: kData
   //   esp[6 * kSystemPointerSize]: undefined (kNewTarget)
+  // Existing state:
+  //   esp[7 * kSystemPointerSize]:          <= FCA:::values_
 
-  __ PopReturnAddressTo(ecx);
-  __ PushRoot(RootIndex::kUndefinedValue);
-  __ Push(call_data);
-  __ PushRoot(RootIndex::kUndefinedValue);
-  __ PushRoot(RootIndex::kUndefinedValue);
+  // Park argc in xmm0.
+  __ movd(xmm0, argc);
+
+  __ PopReturnAddressTo(argc);
+  __ PushRoot(RootIndex::kUndefinedValue);  // kNewTarget
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ push(FieldOperand(callback, CallHandlerInfo::kDataOffset));
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ Push(call_data);
+      break;
+  }
+  __ PushRoot(RootIndex::kUndefinedValue);  // kReturnValue
+  __ Push(Smi::zero());                     // kUnused
   __ Push(Immediate(ExternalReference::isolate_address(masm->isolate())));
   __ Push(holder);
-  __ PushReturnAddressFrom(ecx);
-
-  // Reload argc from xmm0.
-  __ movd(argc, xmm0);
-
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  Register scratch = eax;
-  __ lea(scratch, Operand(esp, 1 * kSystemPointerSize));
+  __ mov(holder, esp);
 
-  // The API function takes a reference to v8::Arguments. If the CPU profiler
-  // is enabled, a wrapper function will be called and we need to pass
-  // the address of the callback as an additional parameter. Always allocate
-  // space for it.
-  static constexpr int kApiArgc = 1 + 1;
+  // The API function takes v8::FunctionCallbackInfo reference, allocate it
+  // in non-GCed space of the exit frame.
+  static constexpr int kApiArgc = 1;
+  static constexpr int kApiArg0Offset = 0 * kSystemPointerSize;
+  static constexpr int kApiArgsSize = kApiArgc * kSystemPointerSize;
 
-  // Allocate the v8::Arguments structure in the arguments' space since
-  // it's not controlled by GC.
+  // Allocate v8::FunctionCallbackInfo object and a number of bytes to drop
+  // from the stack after the callback in non-GCed space of the exit frame.
   static constexpr int kApiStackSpace = 4;
+  static_assert((kApiStackSpace - 1) * kSystemPointerSize == FCA::kSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
+
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+    // Reload argc from xmm0.
+    __ movd(api_function_address, xmm0);
+
+    // No padding is required.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize == 0);
+
+    // Context parameter.
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ Push(kContextRegister);
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ SmiTag(api_function_address);
+    __ Push(api_function_address);
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ push(FieldOperand(callback, CallHandlerInfo::kOwnerTemplateOffset));
+
+    __ PushReturnAddressFrom(argc);
+
+    __ mov(api_function_address,
+           FieldOperand(callback,
+                        CallHandlerInfo::kMaybeRedirectedCallbackOffset));
+
+    __ EnterExitFrame(kApiArgc + kApiStackSpace, StackFrame::API_CALLBACK_EXIT,
+                      api_function_address);
+  } else {
+    __ PushReturnAddressFrom(argc);
+    __ EnterExitFrame(kApiArgc + kApiStackSpace, StackFrame::EXIT,
+                      api_function_address);
+  }
 
-  PrepareCallApiFunction(masm, kApiArgc + kApiStackSpace, edi);
-
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  __ mov(ApiParameterOperand(kApiArgc + 0), scratch);
+  if (v8_flags.debug_code) {
+    __ mov(esi, Immediate(base::bit_cast<int32_t>(kZapValue)));
+  }
 
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  __ lea(scratch,
-         Operand(scratch, (FCA::kArgsLength + 1) * kSystemPointerSize));
-  __ mov(ApiParameterOperand(kApiArgc + 1), scratch);
+  // Reload argc from xmm0.
+  __ movd(argc, xmm0);
 
-  // FunctionCallbackInfo::length_.
-  __ mov(ApiParameterOperand(kApiArgc + 2), argc);
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    __ mov(ExitFrameStackSlotOperand(kApiArgsSize + FCA::kImplicitArgsOffset),
+           holder);
+
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ lea(holder,
+           Operand(holder, (FCA::kArgsLength + 1) * kSystemPointerSize));
+    __ mov(ExitFrameStackSlotOperand(kApiArgsSize + FCA::kValuesOffset),
+           holder);
+
+    // FunctionCallbackInfo::length_.
+    __ mov(ExitFrameStackSlotOperand(kApiArgsSize + FCA::kLengthOffset), argc);
+  }
+  Register scratch = ReassignRegister(holder);
 
   // We also store the number of bytes to drop from the stack after returning
   // from the API function here.
+  constexpr int kBytesToDropOffset = FCA::kLengthOffset + kSystemPointerSize;
+  static_assert(kBytesToDropOffset ==
+                (kApiStackSpace - 1) * kSystemPointerSize);
+  __ lea(scratch, Operand(argc, times_system_pointer_size,
+                          (FCA::kArgsLength + 1 /* receiver */ +
+                           exit_frame_params_count) *
+                              kSystemPointerSize));
+  __ mov(ExitFrameStackSlotOperand(kApiArgsSize + kBytesToDropOffset), scratch);
+
+  __ RecordComment("v8::FunctionCallback's argument.");
   __ lea(scratch,
-         Operand(argc, times_system_pointer_size,
-                 (FCA::kArgsLength + 1 /* receiver */) * kSystemPointerSize));
-  __ mov(ApiParameterOperand(kApiArgc + 3), scratch);
+         ExitFrameStackSlotOperand(kApiArgsSize + FCA::kImplicitArgsOffset));
+  __ mov(ExitFrameStackSlotOperand(kApiArg0Offset), scratch);
 
-  // v8::InvocationCallback's argument.
-  __ lea(scratch, ApiParameterOperand(kApiArgc + 0));
-  __ mov(ApiParameterOperand(0), scratch);
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
-  Operand return_value_operand =
-      ExitFrameCallerStackSlotOperand(FCA::kReturnValueIndex);
+  Operand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
   static constexpr int kUseStackSpaceOperand = 0;
-  Operand stack_space_operand = ApiParameterOperand(kApiArgc + 3);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           ApiParameterOperand(1), kUseStackSpaceOperand,
+  Operand stack_space_operand =
+      ExitFrameStackSlotOperand(kApiArgsSize + kBytesToDropOffset);
+
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseStackSpaceOperand,
                            &stack_space_operand, return_value_operand);
 }
 
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- esi                 : context
+  //  -- edx                 : receiver
+  //  -- ecx                 : holder
+  //  -- eax                 : accessor info
+  //  -- esp[0]              : return address
+  // -----------------------------------
+
+  Register receiver = ApiGetterDescriptor::ReceiverRegister();
+  Register holder = ApiGetterDescriptor::HolderRegister();
+  Register callback = ApiGetterDescriptor::CallbackRegister();
+  Register scratch = edi;
+  DCHECK(!AreAliased(receiver, holder, callback, scratch));
+
   // Build v8::PropertyCallbackInfo::args_ array on the stack and push property
   // name below the exit frame to make GC aware of them.
+  using PCI = PropertyCallbackInfo<v8::Value>;
   using PCA = PropertyCallbackArguments;
   static_assert(PCA::kShouldThrowOnErrorIndex == 0);
   static_assert(PCA::kHolderIndex == 1);
   static_assert(PCA::kIsolateIndex == 2);
-  static_assert(PCA::kReturnValueDefaultValueIndex == 3);
+  static_assert(PCA::kUnusedIndex == 3);
   static_assert(PCA::kReturnValueIndex == 4);
   static_assert(PCA::kDataIndex == 5);
   static_assert(PCA::kThisIndex == 6);
   static_assert(PCA::kArgsLength == 7);
 
-  Register receiver = ApiGetterDescriptor::ReceiverRegister();
-  Register holder = ApiGetterDescriptor::HolderRegister();
-  Register callback = ApiGetterDescriptor::CallbackRegister();
-  Register scratch = edi;
-  DCHECK(!AreAliased(receiver, holder, callback, scratch));
-
-  __ pop(scratch);  // Pop return address to extend the frame.
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  //
+  // Current state:
+  //   esp[0]: return address
+  //
+  // Target state:
+  //   esp[0 * kSystemPointerSize]: return address
+  //   esp[1 * kSystemPointerSize]: name
+  //   esp[2 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   esp[3 * kSystemPointerSize]: kHolderIndex
+  //   esp[4 * kSystemPointerSize]: kIsolateIndex
+  //   esp[5 * kSystemPointerSize]: kUnusedIndex
+  //   esp[6 * kSystemPointerSize]: kReturnValueIndex
+  //   esp[7 * kSystemPointerSize]: kDataIndex
+  //   esp[8 * kSystemPointerSize]: kThisIndex / receiver
+
+  __ PopReturnAddressTo(scratch);
   __ push(receiver);
   __ push(FieldOperand(callback, AccessorInfo::kDataOffset));
   __ PushRoot(RootIndex::kUndefinedValue);  // ReturnValue
-  // ReturnValue default value
-  __ PushRoot(RootIndex::kUndefinedValue);
+  __ Push(Smi::zero());                     // unused
   __ Push(Immediate(ExternalReference::isolate_address(masm->isolate())));
   __ push(holder);
-  __ push(Immediate(Smi::zero()));  // should_throw_on_error -> false
+  __ Push(Smi::zero());  // should_throw_on_error -> false
+
+  // Initialize a pointer to PropertyCallbackInfo::args_ array (= &ShouldThrow).
+  Register args_array = ReassignRegister(holder);
+  __ mov(args_array, esp);
+
   __ push(FieldOperand(callback, AccessorInfo::kNameOffset));
-  __ push(scratch);  // Restore return address.
+  __ PushReturnAddressFrom(scratch);
+
+  Register api_function_address = ReassignRegister(receiver);
+  __ RecordComment("Load function_address");
+  __ mov(api_function_address,
+         FieldOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset));
 
   // v8::PropertyCallbackInfo::args_ array and name handle.
-  const int kNameHandleStackSize = 1;
-  const int kStackUnwindSpace = PCA::kArgsLength + kNameHandleStackSize;
-
-  // Allocate v8::PropertyCallbackInfo object, arguments for callback and
-  // space for optional callback address parameter (in case CPU profiler is
-  // active) in non-GCed stack space.
-  const int kApiArgc = 3 + 1;
-
-  PrepareCallApiFunction(masm, kApiArgc, scratch);
-
-  // Load address of v8::PropertyAccessorInfo::args_ array. The value in ebp
-  // here corresponds to esp + kSystemPointerSize before PrepareCallApiFunction.
-  __ lea(scratch, Operand(ebp, kSystemPointerSize + 2 * kSystemPointerSize));
-  // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // it's args_ field.
-  Operand info_object = ApiParameterOperand(3);
-  __ mov(info_object, scratch);
-
-  // Name as handle.
-  __ sub(scratch, Immediate(kSystemPointerSize));
-  __ mov(ApiParameterOperand(0), scratch);
-  // Arguments pointer.
+  static constexpr int kNameOnStackSize = 1;
+  static constexpr int kStackUnwindSpace = PCA::kArgsLength + kNameOnStackSize;
+
+  // The API function takes a name handle and v8::PropertyCallbackInfo
+  // reference, allocate them in non-GCed space of the exit frame.
+  static constexpr int kApiArgc = 2;
+  static constexpr int kApiArg0Offset = 0 * kSystemPointerSize;
+  static constexpr int kApiArg1Offset = 1 * kSystemPointerSize;
+  static constexpr int kApiArgsSize = kApiArgc * kSystemPointerSize;
+  // Allocate v8::PropertyCallbackInfo object in non-GCed space of the exit
+  // frame.
+  static constexpr int kApiStackSpace = 1;
+  static_assert(kApiStackSpace * kSystemPointerSize == sizeof(PCI));
+
+  __ EnterExitFrame(kApiArgc + kApiStackSpace, StackFrame::EXIT,
+                    api_function_address);
+  if (v8_flags.debug_code) {
+    __ mov(esi, Immediate(base::bit_cast<int32_t>(kZapValue)));
+  }
+
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
+  // Initialize its args_ field.
+  Operand info_object = ExitFrameStackSlotOperand(kApiArgsSize);
+  __ mov(info_object, args_array);
+
+  __ RecordComment("Handle<Name>");
+  __ sub(args_array, Immediate(kSystemPointerSize));
+  __ mov(ExitFrameStackSlotOperand(kApiArg0Offset), args_array);
+  args_array = no_reg;
+  __ RecordComment("&v8::PropertyCallbackInfo::args_");
   __ lea(scratch, info_object);
-  __ mov(ApiParameterOperand(1), scratch);
-  // Reserve space for optional callback address parameter.
-  Operand thunk_last_arg = ApiParameterOperand(2);
+  __ mov(ExitFrameStackSlotOperand(kApiArg1Offset), scratch);
 
-  Register function_address = edx;
-  __ mov(function_address,
-         FieldOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset));
   ExternalReference thunk_ref =
       ExternalReference::invoke_accessor_getter_callback();
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
+
   Operand return_value_operand = ExitFrameCallerStackSlotOperand(
-      PCA::kReturnValueIndex + kNameHandleStackSize);
+      PCA::kReturnValueIndex + kNameOnStackSize);
   Operand* const kUseStackSpaceConstant = nullptr;
-  CallApiFunctionAndReturn(masm, function_address, thunk_ref, thunk_last_arg,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           return_value_operand);
+
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
@@ -4251,7 +4585,8 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register feedback_vector = ecx;
   __ mov(feedback_vector,
          FieldOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ mov(feedback_vector, FieldOperand(feedback_vector, Cell::kValueOffset));
+  __ mov(feedback_vector,
+         FieldOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -4311,12 +4646,13 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
            kInterpreterBytecodeArrayRegister);
     __ CallCFunction(get_baseline_pc, 3);
   }
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ add(code_obj, kReturnRegister0);
   __ pop(kInterpreterAccumulatorRegister);
 
   if (is_osr) {
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
+    __ mov(closure, MemOperand(ebp, StandardFrameConstants::kFunctionOffset));
+    ResetJSFunctionAge(masm, closure, closure);
     Generate_OSREntry(masm, code_obj);
   } else {
     __ jmp(code_obj);
diff --git a/deps/v8/src/builtins/ic-callable.tq b/deps/v8/src/builtins/ic-callable.tq
index c1f7a32bd0440a..7443ad1b381edc 100644
--- a/deps/v8/src/builtins/ic-callable.tq
+++ b/deps/v8/src/builtins/ic-callable.tq
@@ -26,8 +26,9 @@ macro MaybeObjectToStrong(maybeObject: MaybeObject):
   return WeakToStrong(weakObject) otherwise IfCleared;
 }
 
-macro TryInitializeAsMonomorphic(implicit context: Context)(
-    maybeTarget: JSAny, feedbackVector: FeedbackVector,
+macro TryInitializeAsMonomorphic(
+    implicit context: Context)(maybeTarget: JSAny,
+    feedbackVector: FeedbackVector,
     slotId: uintptr): void labels TransitionToMegamorphic {
   const targetHeapObject =
       Cast<HeapObject>(maybeTarget) otherwise TransitionToMegamorphic;
@@ -48,27 +49,29 @@ macro TryInitializeAsMonomorphic(implicit context: Context)(
   ReportFeedbackUpdate(feedbackVector, slotId, 'Call:Initialize');
 }
 
-macro TransitionToMegamorphic(implicit context: Context)(
-    feedbackVector: FeedbackVector, slotId: uintptr): void {
+macro TransitionToMegamorphic(
+    implicit context: Context)(feedbackVector: FeedbackVector,
+    slotId: uintptr): void {
   StoreFeedbackVectorSlot(feedbackVector, slotId, kMegamorphicSymbol);
   ReportFeedbackUpdate(feedbackVector, slotId, 'Call:TransitionMegamorphic');
 }
 
-macro TaggedEqualPrototypeApplyFunction(implicit context: Context)(
-    target: JSAny): bool {
+macro TaggedEqualPrototypeApplyFunction(
+    implicit context: Context)(target: JSAny): bool {
   return TaggedEqual(target, GetPrototypeApplyFunction());
 }
 
-macro FeedbackValueIsReceiver(implicit context: Context)(
-    feedbackVector: FeedbackVector, slotId: uintptr): bool {
+macro FeedbackValueIsReceiver(
+    implicit context: Context)(feedbackVector: FeedbackVector,
+    slotId: uintptr): bool {
   const callCount: intptr = SmiUntag(Cast<Smi>(LoadFeedbackVectorSlot(
       feedbackVector, slotId, kTaggedSize)) otherwise return false);
   return (callCount & IntPtrConstant(kCallFeedbackContentFieldMask)) !=
       IntPtrConstant(0);
 }
 
-macro SetCallFeedbackContent(implicit context: Context)(
-    feedbackVector: FeedbackVector, slotId: uintptr,
+macro SetCallFeedbackContent(
+    implicit context: Context)(feedbackVector: FeedbackVector, slotId: uintptr,
     callFeedbackContent: constexpr CallFeedbackContent): void {
   // Load the call count field from the feecback vector.
   const callCount: intptr = SmiUntag(Cast<Smi>(LoadFeedbackVectorSlot(
@@ -200,13 +203,13 @@ macro CollectInstanceOfFeedback(
   }
 }
 
-macro BothTaggedEqualArrayFunction(implicit context: Context)(
-    first: JSAny, second: JSAny): bool {
+macro BothTaggedEqualArrayFunction(
+    implicit context: Context)(first: JSAny, second: JSAny): bool {
   return TaggedEqual(first, second) && TaggedEqual(second, GetArrayFunction());
 }
 
-extern macro CreateAllocationSiteInFeedbackVector(
-    FeedbackVector, uintptr): AllocationSite;
+extern macro CreateAllocationSiteInFeedbackVector(FeedbackVector, uintptr):
+    AllocationSite;
 
 macro CastFeedbackVector(
     maybeFeedbackVector: Undefined|FeedbackVector,
@@ -224,8 +227,8 @@ macro CastFeedbackVector(
   }
 }
 
-macro CollectConstructFeedback(implicit context: Context)(
-    target: JSAny, newTarget: JSAny,
+macro CollectConstructFeedback(
+    implicit context: Context)(target: JSAny, newTarget: JSAny,
     maybeFeedbackVector: Undefined|FeedbackVector, slotId: uintptr,
     updateFeedbackMode: constexpr UpdateFeedbackMode):
     never labels ConstructGeneric,
diff --git a/deps/v8/src/builtins/ic.tq b/deps/v8/src/builtins/ic.tq
index 110ed885030180..36850ba5f83fc9 100644
--- a/deps/v8/src/builtins/ic.tq
+++ b/deps/v8/src/builtins/ic.tq
@@ -23,8 +23,8 @@ macro CollectInstanceOfFeedback(
 }
 
 @export
-macro CollectConstructFeedback(implicit context: Context)(
-    target: JSAny, newTarget: JSAny,
+macro CollectConstructFeedback(
+    implicit context: Context)(target: JSAny, newTarget: JSAny,
     maybeFeedbackVector: Undefined|FeedbackVector, slotId: uintptr,
     updateFeedbackMode: constexpr UpdateFeedbackMode):
     never labels ConstructGeneric,
@@ -51,19 +51,19 @@ macro IsUninitialized(feedback: MaybeObject): bool {
 }
 
 extern macro LoadFeedbackVectorSlot(FeedbackVector, uintptr): MaybeObject;
-extern macro LoadFeedbackVectorSlot(
-    FeedbackVector, uintptr, constexpr int32): MaybeObject;
-extern operator '[]' macro LoadFeedbackVectorSlot(
-    FeedbackVector, intptr): MaybeObject;
-extern macro StoreFeedbackVectorSlot(
-    FeedbackVector, uintptr, MaybeObject): void;
+extern macro LoadFeedbackVectorSlot(FeedbackVector, uintptr, constexpr int32):
+    MaybeObject;
+extern operator '[]' macro LoadFeedbackVectorSlot(FeedbackVector, intptr):
+    MaybeObject;
+extern macro StoreFeedbackVectorSlot(FeedbackVector, uintptr, MaybeObject):
+    void;
 extern macro StoreFeedbackVectorSlot(
     FeedbackVector, uintptr, MaybeObject, constexpr WriteBarrierMode,
     constexpr int32): void;
 extern macro StoreWeakReferenceInFeedbackVector(
     FeedbackVector, uintptr, HeapObject): MaybeObject;
-extern macro ReportFeedbackUpdate(
-    FeedbackVector, uintptr, constexpr string): void;
+extern macro ReportFeedbackUpdate(FeedbackVector, uintptr, constexpr string):
+    void;
 extern operator '.length_intptr' macro LoadFeedbackVectorLength(FeedbackVector):
     intptr;
 
diff --git a/deps/v8/src/builtins/internal-coverage.tq b/deps/v8/src/builtins/internal-coverage.tq
index ec5026861e2a2a..ea3be9526c352d 100644
--- a/deps/v8/src/builtins/internal-coverage.tq
+++ b/deps/v8/src/builtins/internal-coverage.tq
@@ -6,25 +6,26 @@
 
 namespace internal_coverage {
 
+extern macro GetCoverageInfo(SharedFunctionInfo): Object;
+
 macro GetCoverageInfo(implicit context: Context)(function: JSFunction):
     CoverageInfo labels IfNoCoverageInfo {
   const shared: SharedFunctionInfo = function.shared_function_info;
-  const debugInfo = Cast<DebugInfo>(shared.script_or_debug_info)
+  const maybeCoverageInfo = GetCoverageInfo(shared);
+  const coverageInfo = Cast<CoverageInfo>(maybeCoverageInfo)
       otherwise goto IfNoCoverageInfo;
-
-  if (!debugInfo.flags.has_coverage_info) goto IfNoCoverageInfo;
-  return UnsafeCast<CoverageInfo>(debugInfo.coverage_info);
+  return coverageInfo;
 }
 
-macro IncrementBlockCount(implicit context: Context)(
-    coverageInfo: CoverageInfo, slot: Smi): void {
+macro IncrementBlockCount(
+    implicit context: Context)(coverageInfo: CoverageInfo, slot: Smi): void {
   dcheck(Convert<int32>(slot) < coverageInfo.slot_count);
   ++coverageInfo.slots[slot].block_count;
 }
 
 builtin IncBlockCounter(
-    implicit context:
-        Context)(function: JSFunction, coverageArraySlotIndex: Smi): Undefined {
+    implicit context: Context)(function: JSFunction,
+    coverageArraySlotIndex: Smi): Undefined {
   // It's quite possible that a function contains IncBlockCounter bytecodes,
   // but no coverage info exists. This happens e.g. by selecting the
   // best-effort coverage collection mode, which triggers deletion of all
diff --git a/deps/v8/src/builtins/internal.tq b/deps/v8/src/builtins/internal.tq
index 945e7fd2d41e53..677fb4d8e7ac9d 100644
--- a/deps/v8/src/builtins/internal.tq
+++ b/deps/v8/src/builtins/internal.tq
@@ -5,8 +5,9 @@
 namespace internal {
 
 namespace runtime {
-extern runtime GetTemplateObject(implicit context: Context)(
-    TemplateObjectDescription, SharedFunctionInfo, Smi): JSAny;
+extern runtime GetTemplateObject(
+    implicit context: Context)(TemplateObjectDescription, SharedFunctionInfo,
+    Smi): JSAny;
 }
 
 builtin GetTemplateObject(
@@ -38,11 +39,11 @@ builtin GetTemplateObject(
   }
 }
 
-extern transitioning builtin ForInFilter(implicit context: Context)(
-    JSAny, HeapObject): JSAny;
+extern transitioning builtin ForInFilter(
+    implicit context: Context)(JSAny, HeapObject): JSAny;
 extern enum ForInFeedback extends uint31 { kAny, ...}
 extern macro UpdateFeedback(
-    SmiTagged<ForInFeedback>, Undefined | FeedbackVector, uintptr,
+    SmiTagged<ForInFeedback>, Undefined|FeedbackVector, uintptr,
     constexpr UpdateFeedbackMode): void;
 
 @export
diff --git a/deps/v8/src/builtins/iterator-from.tq b/deps/v8/src/builtins/iterator-from.tq
index b711c289715c74..51e00d85cd45c1 100644
--- a/deps/v8/src/builtins/iterator-from.tq
+++ b/deps/v8/src/builtins/iterator-from.tq
@@ -4,7 +4,8 @@
 
 namespace iterator {
 
-macro NewJSValidIteratorWrapper(implicit context: Context)(
+macro NewJSValidIteratorWrapper(
+    implicit context: Context)(
     underlying: IteratorRecord): JSValidIteratorWrapper {
   return new JSValidIteratorWrapper{
     map: *NativeContextSlot(ContextSlot::VALID_ITERATOR_WRAPPER_MAP_INDEX),
@@ -15,96 +16,47 @@ macro NewJSValidIteratorWrapper(implicit context: Context)(
 }
 
 // https://tc39.es/proposal-iterator-helpers/#sec-getiteratorflattenable
-//
-// Currently never used with the async hint, so only the sync path is
-// implemented.
-transitioning macro GetIteratorFlattenable(implicit context: Context)(
-    obj: JSReceiver): IteratorRecord {
+transitioning macro GetIteratorFlattenable(
+    implicit context: Context)(obj: JSReceiver|String): IteratorRecord {
+  // 1. If obj is not an Object, then
+  //   a. If stringHandling is reject-strings or obj is not a String, throw a
+  //      TypeError exception.
+  // (Done by caller.)
+
+  let iterator: JSAny;
   try {
-    // 1. If obj is not an Object, throw a TypeError exception.
-    // (Done by caller.)
-
-    // 2. Let alreadyAsync be false.
-    //
-    // (Unimplemented because the async path is unused.)
-
-    // 3. Let method be undefined.
-    //
-    // (Done below.)
-
-    // 4. If hint is async, then
-    //   a. Set method to ? Get(obj, @@asyncIterator).
-    //   b. Set alreadyAsync to true.
-    //
-    // (Unimplemented because unused.)
-
-    // 5. If IsCallable(method) is false, then
-    //   a. Set method to ? Get(obj, @@iterator).
-    const method = GetProperty(obj, IteratorSymbolConstant());
-
-    // b. Set alreadyAsync to false.
-    //
-    // (Unimplemented because unused.)
-
-    let iterator: JSAny;
-
-    // 6. If IsCallable(method) is false, then
-    if (!Is<Callable>(method)) {
-      // a. Let iterator be obj.
-      iterator = obj;
-
-      // b. Set alreadyAsync to true.
-      //
-      // (Unimplemented because unused.)
-    } else {
-      // 7. Else,
-      // a. Let iterator be ? Call(method, obj).
-      iterator = Call(context, UnsafeCast<Callable>(method), obj);
-    }
-
-    // 8. If iterator is not an Object, throw a TypeError exception.
-    const iteratorObj = Cast<JSReceiver>(iterator)
-        otherwise goto IteratorNotObject(obj, method);
-
-    // 9. Let nextMethod be ? Get(iterator, "next").
-    const nextMethod = GetProperty(iteratorObj, kNextString);
+    // 2. Let method be ? GetMethod(obj, @@iterator).
+    const method = GetMethod(obj, IteratorSymbolConstant())
+        otherwise IfNullOrUndefined;
+
+    // 4. Else (method is not undefined),
+    //  a. Let iterator be ? Call(method, obj).
+    iterator = Call(context, method, obj);
+  } label IfNullOrUndefined {
+    // 3. If method is undefined, then
+    //  a. Let iterator be obj.
+    iterator = obj;
+  }
 
-    // 10. If IsCallable(nextMethod) is false, throw a TypeError exception.
-    if (!Is<Callable>(nextMethod)) {
-      ThrowTypeError(
-          MessageTemplate::kPropertyNotFunction, nextMethod, kNextString, obj);
-    }
+  // 5. If iterator is not an Object, throw a TypeError exception.
+  const iteratorObj = Cast<JSReceiver>(iterator)
+      otherwise ThrowTypeError(MessageTemplate::kNotIterable, obj);
 
-    // 11. Let iteratorRecord be the Iterator Record { [[Iterator]]: iterator,
-    //     [[NextMethod]]: nextMethod, [[Done]]: false }.
-    const iteratorRecord =
-    IteratorRecord{object: iteratorObj, next: nextMethod};
-
-    // 12. If hint is async and alreadyAsync is false, then
-    //   a. Return CreateAsyncFromSyncIterator(iteratorRecord).
-    //
-    // (Unimplemented because unused.)
-
-    // 13. Return iteratorRecord.
-    return iteratorRecord;
-  } label IteratorNotObject(obj: JSAny, method: JSAny) deferred {
-    if (Is<Callable>(method)) {
-      ThrowTypeError(MessageTemplate::kSymbolIteratorInvalid);
-    } else {
-      ThrowTypeError(MessageTemplate::kNotIterable, obj);
-    }
-  }
+  // 6. Return ? GetIteratorDirect(iterator).
+  return GetIteratorDirect(iteratorObj);
 }
 
 // https://tc39.es/proposal-iterator-helpers/#sec-iterator.from
 transitioning javascript builtin IteratorFrom(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(objArg: JSAny): JSReceiver {
-  // 1. If O is a String, set O to ! ToObject(O).
-  let obj: JSReceiver;
+    js-implicit context: NativeContext, receiver: JSAny)(
+    objArg: JSAny): JSReceiver {
+  // GetIteratorFlattenable below accepts either Objects or Strings (without
+  // wrapping) with the iterate-strings parameter. The type checking is done by
+  // the caller of GetIteratorFlattenable.
+  let obj: JSReceiver|String;
   typeswitch (objArg) {
     case (o: String): {
-      obj = ToObject_Inline(context, o);
+      obj = o;
     }
     case (o: JSReceiver): {
       obj = o;
@@ -114,24 +66,24 @@ transitioning javascript builtin IteratorFrom(
     }
   }
 
-  // 2. Let iteratorRecord be ? GetIteratorFlattenable(O, sync).
+  // 1. Let iteratorRecord be ? GetIteratorFlattenable(O, iterate-strings).
   const iteratorRecord = GetIteratorFlattenable(obj);
 
-  // 3. Let hasInstance be ? OrdinaryHasInstance(%Iterator%,
+  // 2. Let hasInstance be ? OrdinaryHasInstance(%Iterator%,
   //    iteratorRecord.[[Iterator]]).
   const hasInstance = function::OrdinaryHasInstance(
       context, GetIteratorFunction(), iteratorRecord.object);
 
-  // 4. If hasInstance is true, then
+  // 3. If hasInstance is true, then
   if (hasInstance == True) {
     // a. Return iteratorRecord.[[Iterator]].
     return iteratorRecord.object;
   }
 
-  // 5. Let wrapper be OrdinaryObjectCreate(%WrapForValidIteratorPrototype%, «
+  // 4. Let wrapper be OrdinaryObjectCreate(%WrapForValidIteratorPrototype%, «
   //    [[Iterated]] »).
-  // 6. Set wrapper.[[Iterated]] to iteratorRecord.
-  // 7. Return wrapper.
+  // 5. Set wrapper.[[Iterated]] to iteratorRecord.
+  // 6. Return wrapper.
   return NewJSValidIteratorWrapper(iteratorRecord);
 }
 
diff --git a/deps/v8/src/builtins/iterator-helpers.tq b/deps/v8/src/builtins/iterator-helpers.tq
index 6998bc689fbea4..305baade85f8ce 100644
--- a/deps/v8/src/builtins/iterator-helpers.tq
+++ b/deps/v8/src/builtins/iterator-helpers.tq
@@ -2,32 +2,65 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// In GetIteratorDirect and the helpers below, this file implements the changes
-// in [1] and [2], which are highly likely to get consensus at the March 2023
-// TC39.
-//
-// [1] https://github.com/tc39/proposal-iterator-helpers/pull/265
-// [2] https://github.com/tc39/proposal-iterator-helpers/pull/267
-//
-// TODO(v8:13556): Remove this comment once PR is merged.
-
 // --- Utilities
 
 namespace iterator {
 
+// Iterator helpers are specced as generators but implemented as direct
+// iterators. As such generator states need to be tracked manually. To save
+// space, this is done by assigning sentinel values to underlying.next.
+
+// Tracks the ~completed~ generator state.
+const kIteratorHelperExhausted: Null = Null;
+// Tracks the ~executing~ generator state.
+const kIteratorHelperExecuting: Undefined = Undefined;
+
+macro IsIteratorHelperExhausted(helper: JSIteratorHelper): bool {
+  return helper.underlying.next == kIteratorHelperExhausted;
+}
+
+macro MarkIteratorHelperAsExhausted(helper: JSIteratorHelper): void {
+  helper.underlying.next = kIteratorHelperExhausted;
+}
+
+macro IsIteratorHelperExecuting(helper: JSIteratorHelper): bool {
+  return helper.underlying.next == kIteratorHelperExecuting;
+}
+
+// When a generator's state is ~executing~, attempts to reenter via next() or
+// return() throw a TypeError. See step 6 in ES #sec-generatorvalidate.
+macro ThrowIfIteratorHelperExecuting(
+    implicit context: Context)(helper: JSIteratorHelper): void {
+  if (IsIteratorHelperExecuting(helper)) {
+    ThrowTypeError(MessageTemplate::kGeneratorRunning);
+  }
+}
+
+macro MarkIteratorHelperAsExecuting(helper: JSIteratorHelper):
+    IteratorRecord {
+  dcheck(!IsIteratorHelperExecuting(helper));
+  const underlying = helper.underlying;
+  helper.underlying.next = kIteratorHelperExecuting;
+  return underlying;
+}
+
+macro MarkIteratorHelperAsFinishedExecuting(
+    helper: JSIteratorHelper, underlying: IteratorRecord): void {
+  dcheck(IsIteratorHelperExecuting(helper));
+  dcheck(underlying.next != kIteratorHelperExecuting);
+  dcheck(underlying.object == helper.underlying.object);
+  helper.underlying.next = underlying.next;
+}
+
 // https://tc39.es/proposal-iterator-helpers/#sec-getiteratordirect
-transitioning macro GetIteratorDirect(implicit context: Context)(
-    obj: JSReceiver): IteratorRecord {
+transitioning macro GetIteratorDirect(
+    implicit context: Context)(obj: JSReceiver): IteratorRecord {
   // 1. Let nextMethod be ? Get(obj, "next").
-  const nextProp = GetProperty(obj, kNextString);
-
-  // 2. If IsCallable(nextMethod) is false, throw a TypeError exception.
-  const nextMethod = Cast<Callable>(nextProp)
-      otherwise ThrowTypeError(MessageTemplate::kCalledNonCallable, 'next');
+  const nextMethod = GetProperty(obj, kNextString);
 
-  // 3. Let iteratorRecord be Record { [[Iterator]]: obj, [[NextMethod]]:
+  // 2. Let iteratorRecord be Record { [[Iterator]]: obj, [[NextMethod]]:
   //    nextMethod, [[Done]]: false }.
-  // 4. Return iteratorRecord.
+  // 3. Return iteratorRecord.
   return IteratorRecord{object: obj, next: nextMethod};
 }
 
@@ -40,7 +73,17 @@ transitioning javascript builtin IteratorHelperPrototypeNext(
 
   // Iterator helpers are specified as generators but we implement them as
   // direct iterators.
-  typeswitch (receiver) {
+  const helper = Cast<JSIteratorHelper>(receiver) otherwise ThrowTypeError(
+      MessageTemplate::kIncompatibleMethodReceiver,
+      'Iterator Helper.prototype.next', receiver);
+
+  ThrowIfIteratorHelperExecuting(helper);
+
+  if (IsIteratorHelperExhausted(helper)) {
+    return AllocateJSIteratorResult(Undefined, True);
+  }
+
+  typeswitch (helper) {
     case (mapHelper: JSIteratorMapHelper): {
       return IteratorMapHelperNext(mapHelper);
     }
@@ -53,10 +96,11 @@ transitioning javascript builtin IteratorHelperPrototypeNext(
     case (dropHelper: JSIteratorDropHelper): {
       return IteratorDropHelperNext(dropHelper);
     }
+    case (flatMapHelper: JSIteratorFlatMapHelper): {
+      return IteratorFlatMapHelperNext(flatMapHelper);
+    }
     case (Object): {
-      ThrowTypeError(
-          MessageTemplate::kIncompatibleMethodReceiver,
-          'Iterator Helper.prototype.next', receiver);
+      unreachable;
     }
   }
 }
@@ -76,20 +120,56 @@ transitioning javascript builtin IteratorHelperPrototypeReturn(
   //    [[Target]]: empty }.
   // 6. Return ? GeneratorResumeAbrupt(O, C, "Iterator Helper").
 
-  // Iterator helpers are specified as generators. The net effect of this method
-  // is to close the underlying and return { value: undefined, done: true }.
-  const helper = Cast<JSIteratorHelper>(receiver) otherwise ThrowTypeError(
-      MessageTemplate::kIncompatibleMethodReceiver,
-      'Iterator Helper.prototype.return', receiver);
+  // Return for flatMap helper is not the same as other helpers.
+  typeswitch (receiver) {
+    case (helper: JSIteratorFlatMapHelper): {
+      ThrowIfIteratorHelperExecuting(helper);
+
+      if (IsIteratorHelperExhausted(helper)) {
+        return AllocateJSIteratorResult(Undefined, True);
+      }
+      MarkIteratorHelperAsExhausted(helper);
+
+      if (helper.innerAlive == True) {
+        try {
+          // d. If completion is an abrupt completion, then
+          // i. Let backupCompletion be Completion(IteratorClose(innerIterator,
+          // completion)).
+          IteratorClose(helper.innerIterator);
+
+        } catch (e, message) {
+          // ii. IfAbruptCloseIterator(backupCompletion, iterated).
+          IteratorCloseOnException(helper.underlying);
+          ReThrowWithMessage(context, e, message);
+        }
+      }
 
-  IteratorCloseOnException(helper.underlying);
-  return AllocateJSIteratorResult(Undefined, True);
+      // iii. Return ? IteratorClose(completion, iterated).
+      IteratorClose(helper.underlying);
+      return AllocateJSIteratorResult(Undefined, True);
+    }
+    case (Object): {
+      // Iterator helpers are specified as generators. The net effect of this
+      // method is to close the underlying and return { value: undefined, done:
+      // true }.
+      const helper = Cast<JSIteratorHelper>(receiver) otherwise ThrowTypeError(
+          MessageTemplate::kIncompatibleMethodReceiver,
+          'Iterator Helper.prototype.return', receiver);
+      ThrowIfIteratorHelperExecuting(helper);
+      if (!IsIteratorHelperExhausted(helper)) {
+        MarkIteratorHelperAsExhausted(helper);
+        IteratorClose(helper.underlying);
+      }
+      return AllocateJSIteratorResult(Undefined, True);
+    }
+  }
 }
 
-// --- Map helper
+// --- map helper
 
-macro NewJSIteratorMapHelper(implicit context: Context)(
-    underlying: IteratorRecord, mapper: Callable): JSIteratorMapHelper {
+macro NewJSIteratorMapHelper(
+    implicit context: Context)(underlying: IteratorRecord,
+    mapper: Callable): JSIteratorMapHelper {
   return new JSIteratorMapHelper{
     map: *NativeContextSlot(ContextSlot::ITERATOR_MAP_HELPER_MAP_INDEX),
     properties_or_hash: kEmptyFixedArray,
@@ -102,8 +182,8 @@ macro NewJSIteratorMapHelper(implicit context: Context)(
 
 // https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.map
 transitioning javascript builtin IteratorPrototypeMap(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(mapper: JSAny): JSIteratorMapHelper {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    mapper: JSAny): JSIteratorMapHelper {
   const methodName: constexpr string = 'Iterator.prototype.map';
 
   // 1. Let O be the this value.
@@ -113,7 +193,7 @@ transitioning javascript builtin IteratorPrototypeMap(
 
   // 3. If IsCallable(mapper) is false, throw a TypeError exception.
   const mapper = Cast<Callable>(mapper)
-      otherwise ThrowTypeError(MessageTemplate::kCalledNonCallable, methodName);
+      otherwise ThrowCalledNonCallable(methodName);
 
   // 4. Let iterated be ? GetIteratorDirect(O).
   const iterated = GetIteratorDirect(o);
@@ -127,55 +207,63 @@ transitioning javascript builtin IteratorPrototypeMap(
   return NewJSIteratorMapHelper(iterated, mapper);
 }
 
-transitioning builtin IteratorMapHelperNext(implicit context: Context)(
-    helper: JSIteratorMapHelper): JSAny {
+transitioning builtin IteratorMapHelperNext(
+    implicit context: Context)(helper: JSIteratorMapHelper): JSAny {
   // a. Let counter be 0.
   // (Done when creating JSIteratorMapHelper.)
 
   const fastIteratorResultMap = GetIteratorResultMap();
-  const underlying = helper.underlying;
+  const underlying = MarkIteratorHelperAsExecuting(helper);
   const counter = helper.counter;
 
-  // b. Repeat,
-  let next: JSReceiver;
   try {
-    // i. Let next be ? IteratorStep(iterated).
-    next = IteratorStep(underlying, fastIteratorResultMap)
-        otherwise Done;
-  } label Done {
-    // ii. If next is false, return undefined.
-    return AllocateJSIteratorResult(Undefined, True);
-  }
+    // b. Repeat,
+    let next: JSReceiver;
+    try {
+      // i. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(underlying, fastIteratorResultMap)
+          otherwise Done;
+    } label Done {
+      // ii. If next is false, return undefined.
+      MarkIteratorHelperAsExhausted(helper);
+      return AllocateJSIteratorResult(Undefined, True);
+    }
 
-  // iii. Let value be ? IteratorValue(next).
-  const value = IteratorValue(next, fastIteratorResultMap);
+    // iii. Let value be ? IteratorValue(next).
+    const value = IteratorValue(next, fastIteratorResultMap);
 
-  try {
-    // iv. Let mapped be Completion(
-    //     Call(mapper, undefined, « value, 𝔽(counter) »)).
-    const mapped = Call(context, helper.mapper, Undefined, value, counter);
+    try {
+      // iv. Let mapped be Completion(
+      //     Call(mapper, undefined, « value, 𝔽(counter) »)).
+      const mapped = Call(context, helper.mapper, Undefined, value, counter);
 
-    // viii. Set counter to counter + 1.
-    // (Done out of order. Iterator helpers are specified as generators with
-    // yields but we implement them as direct iterators.)
-    helper.counter = counter + 1;
+      // viii. Set counter to counter + 1.
+      // (Done out of order. Iterator helpers are specified as generators with
+      // yields but we implement them as direct iterators.)
+      helper.counter = counter + 1;
 
-    // vi. Let completion be Completion(Yield(mapped)).
-    return AllocateJSIteratorResult(mapped, False);
+      // vi. Let completion be Completion(Yield(mapped)).
+      MarkIteratorHelperAsFinishedExecuting(helper, underlying);
+      return AllocateJSIteratorResult(mapped, False);
 
-    // vii. IfAbruptCloseIterator(completion, iterated).
-    // (Done in IteratorHelperPrototypeReturn.)
+      // vii. IfAbruptCloseIterator(completion, iterated).
+      // (Done in IteratorHelperPrototypeReturn.)
+    } catch (e, message) {
+      // v. IfAbruptCloseIterator(mapped, iterated).
+      IteratorCloseOnException(underlying);
+      ReThrowWithMessage(context, e, message);
+    }
   } catch (e, message) {
-    // v. IfAbruptCloseIterator(mapped, iterated).
-    IteratorCloseOnException(underlying);
+    MarkIteratorHelperAsExhausted(helper);
     ReThrowWithMessage(context, e, message);
   }
 }
 
-// --- Filter helper
+// --- filter helper
 
-macro NewJSIteratorFilterHelper(implicit context: Context)(
-    underlying: IteratorRecord, predicate: Callable): JSIteratorFilterHelper {
+macro NewJSIteratorFilterHelper(
+    implicit context: Context)(underlying: IteratorRecord,
+    predicate: Callable): JSIteratorFilterHelper {
   return new JSIteratorFilterHelper{
     map: *NativeContextSlot(ContextSlot::ITERATOR_FILTER_HELPER_MAP_INDEX),
     properties_or_hash: kEmptyFixedArray,
@@ -188,8 +276,8 @@ macro NewJSIteratorFilterHelper(implicit context: Context)(
 
 // https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.filter
 transitioning javascript builtin IteratorPrototypeFilter(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(predicate: JSAny): JSIteratorFilterHelper {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    predicate: JSAny): JSIteratorFilterHelper {
   const methodName: constexpr string = 'Iterator.prototype.filter';
 
   // 1. Let O be the this value.
@@ -199,7 +287,7 @@ transitioning javascript builtin IteratorPrototypeFilter(
 
   // 3. If IsCallable(predicate) is false, throw a TypeError exception.
   const predicate = Cast<Callable>(predicate)
-      otherwise ThrowTypeError(MessageTemplate::kCalledNonCallable, methodName);
+      otherwise ThrowCalledNonCallable(methodName);
 
   // 4. Let iterated be ? GetIteratorDirect(O).
   const iterated = GetIteratorDirect(o);
@@ -213,62 +301,70 @@ transitioning javascript builtin IteratorPrototypeFilter(
   return NewJSIteratorFilterHelper(iterated, predicate);
 }
 
-transitioning builtin IteratorFilterHelperNext(implicit context: Context)(
-    helper: JSIteratorFilterHelper): JSAny {
+transitioning builtin IteratorFilterHelperNext(
+    implicit context: Context)(helper: JSIteratorFilterHelper): JSAny {
   // a. Let counter be 0.
   // (Done when creating JSIteratorFilterHelper.)
 
   const fastIteratorResultMap = GetIteratorResultMap();
-  const underlying = helper.underlying;
-
-  while (true) {
-    const counter = helper.counter;
+  const underlying = MarkIteratorHelperAsExecuting(helper);
 
-    // b. Repeat,
-    let next: JSReceiver;
-    try {
-      // i. Let next be ? IteratorStep(iterated).
-      next = IteratorStep(underlying, fastIteratorResultMap)
-          otherwise Done;
-    } label Done {
-      // ii. If next is false, return undefined.
-      return AllocateJSIteratorResult(Undefined, True);
-    }
-
-    // iii. Let value be ? IteratorValue(next).
-    const value = IteratorValue(next, fastIteratorResultMap);
-
-    try {
-      // iv. Let selected be Completion(
-      //     Call(predicate, undefined, « value, 𝔽(counter) »)).
-      const selected =
-          Call(context, helper.predicate, Undefined, value, counter);
-
-      // vii. Set counter to counter + 1.
-      // (Done out of order. Iterator helpers are specified as generators with
-      // yields but we implement them as direct iterators.)
-      helper.counter = counter + 1;
+  try {
+    while (true) {
+      const counter = helper.counter;
+
+      // b. Repeat,
+      let next: JSReceiver;
+      try {
+        // i. Let next be ? IteratorStep(iterated).
+        next = IteratorStep(underlying, fastIteratorResultMap)
+            otherwise Done;
+      } label Done {
+        // ii. If next is false, return undefined.
+        MarkIteratorHelperAsExhausted(helper);
+        return AllocateJSIteratorResult(Undefined, True);
+      }
 
-      // vi. If ToBoolean(selected) is true, then
-      if (ToBoolean(selected)) {
-        // 1. Let completion be Completion(Yield(value)).
-        return AllocateJSIteratorResult(value, False);
-        // 2. IfAbruptCloseIterator(completion, iterated).
-        // (Done in IteratorHelperPrototypeReturn.)
+      // iii. Let value be ? IteratorValue(next).
+      const value = IteratorValue(next, fastIteratorResultMap);
+
+      try {
+        // iv. Let selected be Completion(
+        //     Call(predicate, undefined, « value, 𝔽(counter) »)).
+        const selected =
+            Call(context, helper.predicate, Undefined, value, counter);
+
+        // vii. Set counter to counter + 1.
+        // (Done out of order. Iterator helpers are specified as generators with
+        // yields but we implement them as direct iterators.)
+        helper.counter = counter + 1;
+
+        // vi. If ToBoolean(selected) is true, then
+        if (ToBoolean(selected)) {
+          // 1. Let completion be Completion(Yield(value)).
+          MarkIteratorHelperAsFinishedExecuting(helper, underlying);
+          return AllocateJSIteratorResult(value, False);
+          // 2. IfAbruptCloseIterator(completion, iterated).
+          // (Done in IteratorHelperPrototypeReturn.)
+        }
+      } catch (e, message) {
+        // v. IfAbruptCloseIterator(selected, iterated).
+        IteratorCloseOnException(underlying);
+        ReThrowWithMessage(context, e, message);
       }
-    } catch (e, message) {
-      // v. IfAbruptCloseIterator(selected, iterated).
-      IteratorCloseOnException(underlying);
-      ReThrowWithMessage(context, e, message);
     }
+  } catch (e, message) {
+    MarkIteratorHelperAsExhausted(helper);
+    ReThrowWithMessage(context, e, message);
   }
   unreachable;
 }
 
-// --- Take helper
+// --- take helper
 
-macro NewJSIteratorTakeHelper(implicit context: Context)(
-    underlying: IteratorRecord, limit: Number): JSIteratorTakeHelper {
+macro NewJSIteratorTakeHelper(
+    implicit context: Context)(underlying: IteratorRecord,
+    limit: Number): JSIteratorTakeHelper {
   return new JSIteratorTakeHelper{
     map: *NativeContextSlot(ContextSlot::ITERATOR_TAKE_HELPER_MAP_INDEX),
     properties_or_hash: kEmptyFixedArray,
@@ -280,8 +376,8 @@ macro NewJSIteratorTakeHelper(implicit context: Context)(
 
 // https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.take
 transitioning javascript builtin IteratorPrototypeTake(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(limit: JSAny): JSIteratorTakeHelper {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    limit: JSAny): JSIteratorTakeHelper {
   try {
     const methodName: constexpr string = 'Iterator.prototype.take';
 
@@ -317,52 +413,61 @@ transitioning javascript builtin IteratorPrototypeTake(
   }
 }
 
-transitioning builtin IteratorTakeHelperNext(implicit context: Context)(
-    helper: JSIteratorTakeHelper): JSAny {
+transitioning builtin IteratorTakeHelperNext(
+    implicit context: Context)(helper: JSIteratorTakeHelper): JSAny {
   // a. Let remaining be integerLimit.
   // (Done when creating JSIteratorTakeHelper.)
 
   const fastIteratorResultMap = GetIteratorResultMap();
-  const underlying = helper.underlying;
+  const underlying = MarkIteratorHelperAsExecuting(helper);
   const remaining = helper.remaining;
 
-  // b. Repeat,
-  let next: JSReceiver;
+  try {
+    // b. Repeat,
+    let next: JSReceiver;
 
-  // i. If remaining is 0, then
-  if (remaining == 0) {
-    // 1. Return ? IteratorClose(iterated, NormalCompletion(undefined)).
-    IteratorClose(underlying);
-    return AllocateJSIteratorResult(Undefined, True);
-  }
+    // i. If remaining is 0, then
+    if (remaining == 0) {
+      // 1. Return ? IteratorClose(iterated, NormalCompletion(undefined)).
+      MarkIteratorHelperAsExhausted(helper);
+      IteratorClose(underlying);
+      return AllocateJSIteratorResult(Undefined, True);
+    }
 
-  // ii. If remaining is not +∞, then
-  if (!NumberIsSomeInfinity(remaining)) {
-    // 1. Set remaining to remaining - 1.
-    helper.remaining = remaining - 1;
-  }
+    // ii. If remaining is not +∞, then
+    if (!NumberIsSomeInfinity(remaining)) {
+      // 1. Set remaining to remaining - 1.
+      helper.remaining = remaining - 1;
+    }
 
-  try {
-    // iii. Let next be ? IteratorStep(iterated).
-    next = IteratorStep(underlying, fastIteratorResultMap)
-        otherwise Done;
-  } label Done {
-    // iv. If next is false, return undefined.
-    return AllocateJSIteratorResult(Undefined, True);
-  }
+    try {
+      // iii. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(underlying, fastIteratorResultMap)
+          otherwise Done;
+    } label Done {
+      // iv. If next is false, return undefined.
+      MarkIteratorHelperAsExhausted(helper);
+      return AllocateJSIteratorResult(Undefined, True);
+    }
 
-  // v. Let completion be Completion(Yield(? IteratorValue(next))).
-  const value = IteratorValue(next, fastIteratorResultMap);
-  return AllocateJSIteratorResult(value, False);
+    // v. Let completion be Completion(Yield(? IteratorValue(next))).
+    const value = IteratorValue(next, fastIteratorResultMap);
+    MarkIteratorHelperAsFinishedExecuting(helper, underlying);
+    return AllocateJSIteratorResult(value, False);
 
-  // vi. IfAbruptCloseIterator(completion, iterated).
-  // (Done in IteratorHelperPrototypeReturn.)
+    // vi. IfAbruptCloseIterator(completion, iterated).
+    // (Done in IteratorHelperPrototypeReturn.)
+  } catch (e, message) {
+    MarkIteratorHelperAsExhausted(helper);
+    ReThrowWithMessage(context, e, message);
+  }
 }
 
-// --- Drop helper
+// --- drop helper
 
-macro NewJSIteratorDropHelper(implicit context: Context)(
-    underlying: IteratorRecord, limit: Number): JSIteratorDropHelper {
+macro NewJSIteratorDropHelper(
+    implicit context: Context)(underlying: IteratorRecord,
+    limit: Number): JSIteratorDropHelper {
   return new JSIteratorDropHelper{
     map: *NativeContextSlot(ContextSlot::ITERATOR_DROP_HELPER_MAP_INDEX),
     properties_or_hash: kEmptyFixedArray,
@@ -374,8 +479,8 @@ macro NewJSIteratorDropHelper(implicit context: Context)(
 
 // https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.drop
 transitioning javascript builtin IteratorPrototypeDrop(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(limit: JSAny): JSIteratorDropHelper {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    limit: JSAny): JSIteratorDropHelper {
   try {
     const methodName: constexpr string = 'Iterator.prototype.drop';
 
@@ -411,46 +516,558 @@ transitioning javascript builtin IteratorPrototypeDrop(
   }
 }
 
-transitioning builtin IteratorDropHelperNext(implicit context: Context)(
-    helper: JSIteratorDropHelper): JSAny {
+transitioning builtin IteratorDropHelperNext(
+    implicit context: Context)(helper: JSIteratorDropHelper): JSAny {
   // a. Let remaining be integerLimit.
   // (Done when creating JSIteratorDropHelper.)
 
   const fastIteratorResultMap = GetIteratorResultMap();
-  const underlying = helper.underlying;
+  const underlying = MarkIteratorHelperAsExecuting(helper);
   let remaining = helper.remaining;
   let next: JSReceiver;
 
-  // b. Repeat, while remaining > 0,
   try {
-    while (remaining > 0) {
-      // i. If remaining is not +∞, then
-      if (!NumberIsSomeInfinity(remaining)) {
-        // 1. Set remaining to remaining - 1.
-        remaining = remaining - 1;
-        helper.remaining = remaining;
+    // b. Repeat, while remaining > 0,
+    try {
+      while (remaining > 0) {
+        // i. If remaining is not +∞, then
+        if (!NumberIsSomeInfinity(remaining)) {
+          // 1. Set remaining to remaining - 1.
+          remaining = remaining - 1;
+          helper.remaining = remaining;
+        }
+
+        // ii. Let next be ? IteratorStep(iterated).
+        IteratorStep(underlying, fastIteratorResultMap)
+            otherwise Done;
       }
 
-      // ii. Let next be ? IteratorStep(iterated).
-      IteratorStep(underlying, fastIteratorResultMap)
+      // c. Repeat,
+      // i. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(underlying, fastIteratorResultMap)
           otherwise Done;
+    } label Done {
+      // ii. If next is false, return undefined.
+      MarkIteratorHelperAsExhausted(helper);
+      return AllocateJSIteratorResult(Undefined, True);
     }
 
-    // c. Repeat,
-    // i. Let next be ? IteratorStep(iterated).
-    next = IteratorStep(underlying, fastIteratorResultMap)
-        otherwise Done;
-  } label Done {
-    // ii. If next is false, return undefined.
-    return AllocateJSIteratorResult(Undefined, True);
+    // iii. Let completion be Completion(Yield(? IteratorValue(next))).
+    const value = IteratorValue(next, fastIteratorResultMap);
+    MarkIteratorHelperAsFinishedExecuting(helper, underlying);
+    return AllocateJSIteratorResult(value, False);
+
+    // iv. IfAbruptCloseIterator(completion, iterated).
+    // (Done in IteratorHelperPrototypeReturn.)
+  } catch (e, message) {
+    MarkIteratorHelperAsExhausted(helper);
+    ReThrowWithMessage(context, e, message);
+  }
+}
+
+// --- flatMap helper
+
+const kFlatMapMethodName: constexpr string = 'Iterator.prototype.flatMap';
+
+macro NewJSIteratorFlatMapHelper(
+    implicit context: Context)(underlying: IteratorRecord,
+    mapper: Callable): JSIteratorFlatMapHelper {
+  return new JSIteratorFlatMapHelper{
+    map: *NativeContextSlot(ContextSlot::ITERATOR_FLAT_MAP_HELPER_MAP_INDEX),
+    properties_or_hash: kEmptyFixedArray,
+    elements: kEmptyFixedArray,
+    underlying: underlying,
+    mapper: mapper,
+    counter: 0,
+    innerIterator: underlying,
+    innerAlive: False
+  };
+}
+
+// https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.flatmap
+transitioning javascript builtin IteratorPrototypeFlatMap(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    mapper: JSAny): JSIteratorFlatMapHelper {
+  // 1. Let O be the this value.
+  // 2. If O is not an Object, throw a TypeError exception.
+  const o = Cast<JSReceiver>(receiver)
+      otherwise ThrowTypeError(
+      MessageTemplate::kCalledOnNonObject, kFlatMapMethodName);
+
+  // 3. If IsCallable(mapper) is false, throw a TypeError exception.
+  const mapper = Cast<Callable>(mapper)
+      otherwise ThrowTypeError(
+      MessageTemplate::kCalledNonCallable, kFlatMapMethodName);
+
+  // 4. Let iterated be ? GetIteratorDirect(O).
+  const iterated = GetIteratorDirect(o);
+
+  // Step 5 implemented in IteratorFlatMapHelperNext
+
+  // 6. Let result be CreateIteratorFromClosure(closure, "Iterator Helper",
+  //    %IteratorHelperPrototype%).
+  // 7. Set result.[[UnderlyingIterator]] to iterated.
+  // 8. Return result.
+  return NewJSIteratorFlatMapHelper(iterated, mapper);
+}
+
+transitioning builtin IteratorFlatMapHelperNext(
+    implicit context: Context)(helper: JSIteratorFlatMapHelper): JSAny {
+  // a. Let counter be 0.
+  // (Done when creating JSIteratorFlatMapHelper.)
+
+  const fastIteratorResultMap = GetIteratorResultMap();
+  const underlying = MarkIteratorHelperAsExecuting(helper);
+
+  try {
+    while (true) {
+      const counter = helper.counter;
+      let innerIterator = helper.innerIterator;
+      // b. Repeat,
+      if (helper.innerAlive == False) {
+        let next: JSReceiver;
+        try {
+          // i. Let next be ? IteratorStep(iterated).
+          next = IteratorStep(underlying, fastIteratorResultMap)
+              otherwise Done;
+        } label Done {
+          // ii. If next is false, return undefined.
+          MarkIteratorHelperAsExhausted(helper);
+          return AllocateJSIteratorResult(Undefined, True);
+        }
+
+        // iii. Let value be ? IteratorValue(next).
+        const value = IteratorValue(next, fastIteratorResultMap);
+
+        try {
+          // iv. Let mapped be Completion(
+          //     Call(mapper, undefined, « value, 𝔽(counter) »)).
+          const mapped =
+              Call(context, helper.mapper, Undefined, value, counter);
+          const mappedIter = Cast<JSReceiver>(mapped)
+              otherwise ThrowTypeError(
+              MessageTemplate::kCalledOnNonObject, kFlatMapMethodName);
+
+          // vi. Let innerIterator be Completion(GetIteratorFlattenable(mapped,
+          //     reject-strings)).
+          innerIterator = GetIteratorFlattenable(mappedIter);
+          helper.innerIterator = innerIterator;
+
+          // viii. Let innerAlive be true.
+          helper.innerAlive = True;
+
+        } catch (e, message) {
+          // v. IfAbruptCloseIterator(mapped, iterated)
+          IteratorCloseOnException(underlying);
+          ReThrowWithMessage(context, e, message);
+        }
+        // x. Set counter to counter + 1.
+        helper.counter = counter + 1;
+      }
+
+      // ix. Repeat, while innerAlive is true,
+      try {
+        // 1. Let innerNext be Completion(IteratorStep(innerIterator)).
+        let innerNext: JSReceiver;
+        innerNext = IteratorStep(innerIterator, fastIteratorResultMap)
+            otherwise Done;
+
+        // 4. Else,
+        //    a. Let innerValue be Completion(IteratorValue(innerNext)).
+        const innerValue = IteratorValue(innerNext, fastIteratorResultMap);
+
+        // c. Let completion be Completion(Yield(innerValue)).
+        MarkIteratorHelperAsFinishedExecuting(helper, underlying);
+        return AllocateJSIteratorResult(innerValue, False);
+
+        // d. If completion is an abrupt completion, then
+        //    i. Let backupCompletion be Completion(IteratorClose(innerIterator,
+        // completion)).
+        //    ii. IfAbruptCloseIterator(backupCompletion, iterated).
+        //    iii. Return ? IteratorClose(completion, iterated).
+        // Done in IteratorHelperPrototypeReturn.
+
+      } catch (e, message) {
+        // 2. IfAbruptCloseIterator(innerNext, iterated)
+        IteratorCloseOnException(underlying);
+        ReThrowWithMessage(context, e, message);
+      } label Done {
+        // 3. If innerNext is false, then
+        //    a. Set innerAlive to false.
+        helper.innerAlive = False;
+      }
+    }
+  } catch (e, message) {
+    MarkIteratorHelperAsExhausted(helper);
+    ReThrowWithMessage(context, e, message);
+  }
+  unreachable;
+}
+
+// --- reduce helper
+
+// https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.reduce
+transitioning javascript builtin IteratorPrototypeReduce(
+    js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
+  const methodName: constexpr string = 'Iterator.prototype.reduce';
+
+  // 1. Let O be the this value.
+  // 2. If O is not an Object, throw a TypeError exception.
+  const o = Cast<JSReceiver>(receiver)
+      otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, methodName);
+
+  // 3. If IsCallable(reducer) is false, throw a TypeError exception.
+  const reducer = Cast<Callable>(arguments[0])
+      otherwise ThrowCalledNonCallable(methodName);
+
+  // 4. Let iterated be ? GetIteratorDirect(O).
+  const iterated = GetIteratorDirect(o);
+
+  const fastIteratorResultMap = GetIteratorResultMap();
+  let next: JSReceiver;
+  let accumulator: JSAny;
+  let counter: Number;
+
+  // 5. If initialValue is not present, then
+  if (arguments.length == 1) {
+    //   a. Let next be ? IteratorStep(iterated).
+    //   b. If next is false, throw a TypeError exception.
+    next = IteratorStep(iterated, fastIteratorResultMap)
+        otherwise ThrowTypeError(
+        MessageTemplate::kIteratorReduceNoInitial, methodName);
+    //   c. Let accumulator be ? IteratorValue(next).
+    accumulator = IteratorValue(next, fastIteratorResultMap);
+    //   d. Let counter be 1.
+    counter = 1;
+  } else {
+    // 6. Else,
+    //   a. Let accumulator be initialValue.
+    accumulator = arguments[1];
+    //   b. Let counter be 0.
+    counter = 0;
+  }
+
+  // 7. Repeat,
+  while (true) {
+    try {
+      //  a. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(iterated, fastIteratorResultMap)
+          otherwise Done;
+    } label Done {
+      //  b. If next is false, return accumulator.
+      return accumulator;
+    }
+
+    //  c. Let value be ? IteratorValue(next).
+    const value = IteratorValue(next, fastIteratorResultMap);
+
+    try {
+      //  d. Let result be Completion(Call(reducer, undefined, « accumulator,
+      //  value, 𝔽(counter) »)).
+      const result =
+          Call(context, reducer, Undefined, accumulator, value, counter);
+
+      //  f. Set accumulator to result.[[Value]].
+      accumulator = result;
+
+      //  g. Set counter to counter + 1.
+      counter = counter + 1;
+
+    } catch (e, message) {
+      //  e. IfAbruptCloseIterator(result, iterated).
+      IteratorCloseOnException(iterated);
+      ReThrowWithMessage(context, e, message);
+    }
+  }
+  unreachable;
+}
+
+// --- toArray helper
+
+// https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.toarray
+transitioning javascript builtin IteratorPrototypeToArray(
+    js-implicit context: NativeContext, receiver: JSAny)(): JSAny {
+  const methodName: constexpr string = 'Iterator.prototype.toArray';
+
+  // 1. Let O be the this value.
+  // 2. If O is not an Object, throw a TypeError exception.
+  const o = Cast<JSReceiver>(receiver)
+      otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, methodName);
+
+  // 3. Let iterated be ? GetIteratorDirect(O).
+  const iterated = GetIteratorDirect(o);
+
+  // 4. Let items be a new empty List.
+  let items = growable_fixed_array::NewGrowableFixedArray();
+
+  const fastIteratorResultMap = GetIteratorResultMap();
+  let next: JSReceiver;
+
+  // 5. Repeat,
+  while (true) {
+    try {
+      //  a. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(iterated, fastIteratorResultMap)
+          otherwise Done;
+    } label Done {
+      //  b. If next is false, return CreateArrayFromList(items).
+      return items.ToJSArray();
+    }
+
+    //  c. Let value be ? IteratorValue(next).
+    const value = IteratorValue(next, fastIteratorResultMap);
+
+    //  d. Append value to items.
+    items.Push(value);
   }
+  unreachable;
+}
+
+// --- forEach helper
+
+// https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.foreach
+transitioning javascript builtin IteratorPrototypeForEach(
+    js-implicit context: NativeContext, receiver: JSAny)(fn: JSAny): JSAny {
+  const methodName: constexpr string = 'Iterator.prototype.forEach';
+
+  // 1. Let O be the this value.
+  // 2. If O is not an Object, throw a TypeError exception.
+  const o = Cast<JSReceiver>(receiver)
+      otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, methodName);
+
+  // 3. If IsCallable(fn) is false, throw a TypeError exception.
+  const fn = Cast<Callable>(fn)
+      otherwise ThrowCalledNonCallable(methodName);
+
+  // 4. Let iterated be ? GetIteratorDirect(O).
+  const iterated = GetIteratorDirect(o);
+
+  // 5. Let counter be 0.
+  let counter: Number = 0;
+
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 5. Repeat,
+  while (true) {
+    let next: JSReceiver;
+    try {
+      //  a. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(iterated, fastIteratorResultMap)
+          otherwise Done;
+    } label Done {
+      //  b. If next is false, return undefined.
+      return Undefined;
+    }
 
-  // iii. Let completion be Completion(Yield(? IteratorValue(next))).
-  const value = IteratorValue(next, fastIteratorResultMap);
-  return AllocateJSIteratorResult(value, False);
+    //  c. Let value be ? IteratorValue(next).
+    const value = IteratorValue(next, fastIteratorResultMap);
+
+    try {
+      //  d. Let result be Completion(Call(fn, undefined, « value, 𝔽(counter)
+      //  »)).
+      Call(context, fn, Undefined, value, counter);
+
+      //  f. Set counter to counter + 1.
+      counter = counter + 1;
+    } catch (e, message) {
+      //  e. IfAbruptCloseIterator(result, iterated).
+      IteratorCloseOnException(iterated);
+      ReThrowWithMessage(context, e, message);
+    }
+  }
+  unreachable;
+}
+
+// --- some helper
+
+// https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.some
+transitioning javascript builtin IteratorPrototypeSome(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    predicate: JSAny): JSAny {
+  const methodName: constexpr string = 'Iterator.prototype.some';
+
+  // 1. Let O be the this value.
+  // 2. If O is not an Object, throw a TypeError exception.
+  const o = Cast<JSReceiver>(receiver)
+      otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, methodName);
+
+  // 3. If IsCallable(predicate) is false, throw a TypeError exception.
+  const predicate = Cast<Callable>(predicate)
+      otherwise ThrowCalledNonCallable(methodName);
+
+  // 4. Let iterated be ? GetIteratorDirect(O).
+  const iterated = GetIteratorDirect(o);
 
-  // iv. IfAbruptCloseIterator(completion, iterated).
-  // (Done in IteratorHelperPrototypeReturn.)
+  // 5. Let counter be 0.
+  let counter: Number = 0;
+
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 5. Repeat,
+  while (true) {
+    let next: JSReceiver;
+    try {
+      //  a. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(iterated, fastIteratorResultMap)
+          otherwise Done;
+    } label Done {
+      //  b. If next is false, return false.
+      return False;
+    }
+
+    //  c. Let value be ? IteratorValue(next).
+    const value = IteratorValue(next, fastIteratorResultMap);
+
+    let result: JSAny;
+    try {
+      //  d. Let result be Completion(Call(predicate, undefined, « value,
+      //  𝔽(counter) »)).
+      result = Call(context, predicate, Undefined, value, counter);
+    } catch (e, message) {
+      //  e. IfAbruptCloseIterator(result, iterated).
+      IteratorCloseOnException(iterated);
+      ReThrowWithMessage(context, e, message);
+    }
+
+    //  f. If ToBoolean(result) is true, return ? IteratorClose(iterated,
+    //  NormalCompletion(true)).
+    if (ToBoolean(result) == true) {
+      IteratorClose(iterated);
+      return True;
+    }
+
+    //  g. Set counter to counter + 1.
+    counter = counter + 1;
+  }
+  unreachable;
+}
+
+// --- every helper
+
+// https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.every
+transitioning javascript builtin IteratorPrototypeEvery(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    predicate: JSAny): JSAny {
+  const methodName: constexpr string = 'Iterator.prototype.every';
+
+  // 1. Let O be the this value.
+  // 2. If O is not an Object, throw a TypeError exception.
+  const o = Cast<JSReceiver>(receiver)
+      otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, methodName);
+
+  // 3. If IsCallable(predicate) is false, throw a TypeError exception.
+  const predicate = Cast<Callable>(predicate)
+      otherwise ThrowCalledNonCallable(methodName);
+
+  // 4. Let iterated be ? GetIteratorDirect(O).
+  const iterated = GetIteratorDirect(o);
+
+  // 5. Let counter be 0.
+  let counter: Number = 0;
+
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 5. Repeat,
+  while (true) {
+    let next: JSReceiver;
+    try {
+      //  a. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(iterated, fastIteratorResultMap)
+          otherwise Done;
+    } label Done {
+      //  b. If next is false, return true.
+      return True;
+    }
+
+    //  c. Let value be ? IteratorValue(next).
+    const value = IteratorValue(next, fastIteratorResultMap);
+
+    let result: JSAny;
+    try {
+      //  d. Let result be Completion(Call(predicate, undefined, « value,
+      //  𝔽(counter) »)).
+      result = Call(context, predicate, Undefined, value, counter);
+    } catch (e, message) {
+      //  e. IfAbruptCloseIterator(result, iterated).
+      IteratorCloseOnException(iterated);
+      ReThrowWithMessage(context, e, message);
+    }
+
+    //  f. If ToBoolean(result) is false, return ? IteratorClose(iterated,
+    //  NormalCompletion(false)).
+    if (ToBoolean(result) == false) {
+      IteratorClose(iterated);
+      return False;
+    }
+
+    //  g. Set counter to counter + 1.
+    counter = counter + 1;
+  }
+  unreachable;
+}
+
+// --- find helper
+
+// https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype.find
+transitioning javascript builtin IteratorPrototypeFind(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    predicate: JSAny): JSAny {
+  const methodName: constexpr string = 'Iterator.prototype.find';
+
+  // 1. Let O be the this value.
+  // 2. If O is not an Object, throw a TypeError exception.
+  const o = Cast<JSReceiver>(receiver)
+      otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, methodName);
+
+  // 3. If IsCallable(predicate) is false, throw a TypeError exception.
+  const predicate = Cast<Callable>(predicate)
+      otherwise ThrowCalledNonCallable(methodName);
+
+  // 4. Let iterated be ? GetIteratorDirect(O).
+  const iterated = GetIteratorDirect(o);
+
+  // 5. Let counter be 0.
+  let counter: Number = 0;
+
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 5. Repeat,
+  while (true) {
+    let next: JSReceiver;
+    try {
+      //  a. Let next be ? IteratorStep(iterated).
+      next = IteratorStep(iterated, fastIteratorResultMap)
+          otherwise Done;
+    } label Done {
+      //  b. If next is false, return undefined.
+      return Undefined;
+    }
+
+    //  c. Let value be ? IteratorValue(next).
+    const value = IteratorValue(next, fastIteratorResultMap);
+
+    let result: JSAny;
+    try {
+      //  d. Let result be Completion(Call(predicate, undefined, « value,
+      //  𝔽(counter) »)).
+      result = Call(context, predicate, Undefined, value, counter);
+    } catch (e, message) {
+      //  e. IfAbruptCloseIterator(result, iterated).
+      IteratorCloseOnException(iterated);
+      ReThrowWithMessage(context, e, message);
+    }
+
+    //  f. If ToBoolean(result) is true, return ? IteratorClose(iterated,
+    //  NormalCompletion(value)).
+    if (ToBoolean(result) == true) {
+      IteratorClose(iterated);
+      return value;
+    }
+
+    //  g. Set counter to counter + 1.
+    counter = counter + 1;
+  }
+  unreachable;
 }
 
 }  // namespace iterator
diff --git a/deps/v8/src/builtins/iterator.tq b/deps/v8/src/builtins/iterator.tq
index 66f99aa77d90c6..bbcdf066cfed02 100644
--- a/deps/v8/src/builtins/iterator.tq
+++ b/deps/v8/src/builtins/iterator.tq
@@ -20,16 +20,16 @@ extern macro IteratorBuiltinsAssembler::FastIterableToList(
 
 extern macro IteratorBuiltinsAssembler::GetIteratorMethod(
     implicit context: Context)(JSAny): JSAny;
-extern macro IteratorBuiltinsAssembler::GetIterator(implicit context: Context)(
-    JSAny): IteratorRecord;
-extern macro IteratorBuiltinsAssembler::GetIterator(implicit context: Context)(
-    JSAny, JSAny): IteratorRecord;
+extern macro IteratorBuiltinsAssembler::GetIterator(
+    implicit context: Context)(JSAny): IteratorRecord;
+extern macro IteratorBuiltinsAssembler::GetIterator(
+    implicit context: Context)(JSAny, JSAny): IteratorRecord;
 
-extern macro IteratorBuiltinsAssembler::IteratorStep(implicit context: Context)(
-    IteratorRecord): JSReceiver
+extern macro IteratorBuiltinsAssembler::IteratorStep(
+    implicit context: Context)(IteratorRecord): JSReceiver
     labels Done;
-extern macro IteratorBuiltinsAssembler::IteratorStep(implicit context: Context)(
-    IteratorRecord, Map): JSReceiver
+extern macro IteratorBuiltinsAssembler::IteratorStep(
+    implicit context: Context)(IteratorRecord, Map): JSReceiver
     labels Done;
 
 extern macro IteratorBuiltinsAssembler::IteratorValue(
@@ -43,8 +43,8 @@ extern macro IteratorBuiltinsAssembler::IterableToList(
 extern macro IteratorBuiltinsAssembler::StringListFromIterable(
     implicit context: Context)(JSAny): JSArray;
 
-extern builtin IterableToListWithSymbolLookup(implicit context: Context)(JSAny):
-    JSArray;
+extern builtin IterableToListWithSymbolLookup(
+    implicit context: Context)(JSAny): JSArray;
 extern builtin IterableToFixedArrayWithSymbolLookupSlow(
     implicit context: Context)(JSAny): FixedArray;
 
@@ -120,8 +120,8 @@ transitioning builtin CallIteratorWithFeedback(
 // IteratorCloseOnException should be used to close iterators due to exceptions
 // being thrown.
 @export
-transitioning macro IteratorCloseOnException(implicit context: Context)(
-    iterator: IteratorRecord): void {
+transitioning macro IteratorCloseOnException(
+    implicit context: Context)(iterator: IteratorRecord): void {
   try {
     // 3. Let innerResult be GetMethod(iterator, "return").
     const method = GetProperty(iterator.object, kReturnString);
@@ -142,8 +142,8 @@ transitioning macro IteratorCloseOnException(implicit context: Context)(
 }
 
 @export
-transitioning macro IteratorClose(implicit context: Context)(
-    iterator: IteratorRecord): void {
+transitioning macro IteratorClose(
+    implicit context: Context)(iterator: IteratorRecord): void {
   // 3. Let innerResult be GetMethod(iterator, "return").
   const method = GetProperty(iterator.object, kReturnString);
 
@@ -160,7 +160,7 @@ transitioning macro IteratorClose(implicit context: Context)(
 
   // 7. If innerResult.[[Value]] is not an Object, throw a TypeError
   // exception.
-  Cast<Object>(result)
+  Cast<JSReceiver>(result)
       otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, 'return');
 }
 
diff --git a/deps/v8/src/builtins/js-to-wasm.tq b/deps/v8/src/builtins/js-to-wasm.tq
new file mode 100644
index 00000000000000..41d873c74f119b
--- /dev/null
+++ b/deps/v8/src/builtins/js-to-wasm.tq
@@ -0,0 +1,868 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include 'src/wasm/wasm-linkage.h'
+
+namespace runtime {
+extern runtime WasmGenericJSToWasmObject(
+    Context, WasmInstanceObject|Undefined, JSAny, Smi): JSAny;
+extern runtime WasmGenericWasmToJSObject(Context, Object): JSAny;
+extern runtime WasmCompileWrapper(NoContext, WasmExportedFunctionData): JSAny;
+extern runtime WasmAllocateSuspender(Context): JSAny;
+}  // namespace runtime
+
+namespace wasm {
+extern builtin JSToWasmWrapperAsm(RawPtr<intptr>, WasmInstanceObject, JSAny):
+    JSAny;
+extern builtin WasmReturnPromiseOnSuspendAsm(
+    RawPtr<intptr>, WasmInstanceObject, JSAny): JSAny;
+
+extern macro UniqueIntPtrConstant(constexpr intptr): intptr;
+
+const kWasmExportedFunctionDataSignatureOffset:
+    constexpr int32 generates 'WasmExportedFunctionData::kSigOffset';
+
+const kWasmReturnCountOffset:
+    constexpr intptr generates 'wasm::FunctionSig::kReturnCountOffset';
+
+const kWasmParameterCountOffset: constexpr intptr
+    generates 'wasm::FunctionSig::kParameterCountOffset';
+
+const kWasmSigTypesOffset:
+    constexpr intptr generates 'wasm::FunctionSig::kRepsOffset';
+
+// This constant should only be loaded as a `UniqueIntPtrConstant` to avoid
+// problems with PGO.
+// `- 1` because of the instance parameter.
+const kNumGPRegisterParameters:
+    constexpr intptr generates 'arraysize(wasm::kGpParamRegisters) - 1';
+
+// This constant should only be loaded as a `UniqueIntPtrConstant` to avoid
+// problems with PGO.
+const kNumFPRegisterParameters:
+    constexpr intptr generates 'arraysize(wasm::kFpParamRegisters)';
+
+const kNumGPRegisterReturns:
+    constexpr intptr generates 'arraysize(wasm::kGpReturnRegisters)';
+
+const kNumFPRegisterReturns:
+    constexpr intptr generates 'arraysize(wasm::kFpReturnRegisters)';
+
+const kWasmI32Type:
+    constexpr int32 generates 'wasm::kWasmI32.raw_bit_field()';
+const kWasmI64Type:
+    constexpr int32 generates 'wasm::kWasmI64.raw_bit_field()';
+const kWasmF32Type:
+    constexpr int32 generates 'wasm::kWasmF32.raw_bit_field()';
+const kWasmF64Type:
+    constexpr int32 generates 'wasm::kWasmF64.raw_bit_field()';
+
+extern enum ValueKind extends int32 constexpr 'wasm::ValueKind' {
+  kRef,
+  kRefNull,
+  ...
+}
+
+extern enum HeapType extends int32
+    constexpr 'wasm::HeapType::Representation' {
+  kExtern,
+  kNoExtern,
+  kString,
+  kEq,
+  kI31,
+  kStruct,
+  kArray,
+  kAny,
+  kNone,
+  kNoFunc,
+  ...
+}
+
+const kWrapperBufferReturnCount: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount';
+const kWrapperBufferRefReturnCount: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferRefReturnCount';
+const kWrapperBufferSigRepresentationArray: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferSigRepresentationArray'
+    ;
+const kWrapperBufferStackReturnBufferSize: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferSize'
+    ;
+const kWrapperBufferCallTarget: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferCallTarget';
+const kWrapperBufferParamStart: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferParamStart';
+const kWrapperBufferParamEnd: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferParamEnd';
+const kWrapperBufferStackReturnBufferStart: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferStart'
+    ;
+const kWrapperBufferFPReturnRegister1: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister1'
+    ;
+const kWrapperBufferFPReturnRegister2: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister2'
+    ;
+const kWrapperBufferGPReturnRegister1: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister1'
+    ;
+const kWrapperBufferGPReturnRegister2: constexpr intptr
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister2'
+    ;
+const kWrapperBufferSize: constexpr int32
+    generates 'JSToWasmWrapperFrameConstants::kWrapperBufferSize';
+
+const kValueTypeKindBits: constexpr int32
+    generates 'wasm::ValueType::kKindBits';
+const kValueTypeKindBitsMask: constexpr int32
+    generates 'wasm::kWasmValueKindBitsMask';
+const kValueTypeHeapTypeMask: constexpr int32
+    generates 'wasm::kWasmHeapTypeBitsMask';
+
+macro Bitcast<To: type, From: type>(i: From): To {
+  return i;
+}
+
+extern macro BitcastFloat32ToInt32(float32): uint32;
+
+Bitcast<uint32, float32>(v: float32): uint32 {
+  return BitcastFloat32ToInt32(v);
+}
+
+macro RefCast<To: type>(i: &intptr):
+  &To {
+  return torque_internal::unsafe::NewReference<To>(i.object, i.offset);
+}
+
+macro TruncateBigIntToI64(context: Context, input: JSAny): intptr {
+  // This is only safe to use on 64-bit platforms.
+  dcheck(Is64());
+  const bigint = ToBigInt(context, input);
+
+  if (bigint::ReadBigIntLength(bigint) == 0) {
+    return 0;
+  }
+
+  const digit = bigint::LoadBigIntDigit(bigint, 0);
+  if (bigint::ReadBigIntSign(bigint) == bigint::kPositiveSign) {
+    // Note that even though the bigint is positive according to its sign, the
+    // result of `Signed(digit)` can be negative if the most significant bit is
+    // set. This is intentional and follows the specification of `ToBigInt64()`.
+    return Signed(digit);
+  }
+  return 0 - Signed(digit);
+}
+
+@export
+struct Int64AsInt32Pair {
+  low: uintptr;
+  high: uintptr;
+}
+
+// This is only safe to use on 32-bit platforms.
+extern macro BigIntToRawBytes(BigInt): Int64AsInt32Pair;
+
+extern macro PopAndReturn(intptr, JSAny): never;
+
+// The ReturnSlotAllocator calculates the size of the space needed on the stack
+// for return values.
+struct ReturnSlotAllocator {
+  macro AllocStack(): void {
+    if constexpr (Is64()) {
+      this.stackSlots++;
+    } else {
+      if (this.hasSmallSlot) {
+        this.hasSmallSlot = false;
+        this.smallSlotLast = false;
+      } else {
+        this.stackSlots += 2;
+        this.hasSmallSlot = true;
+        this.smallSlotLast = true;
+      }
+    }
+    return;
+  }
+
+  macro AllocGP(): void {
+    if (this.remainingGPRegs > 0) {
+      this.remainingGPRegs--;
+      return;
+    }
+    this.AllocStack();
+  }
+
+  macro AllocFP32(): void {
+    if (this.remainingFPRegs > 0) {
+      this.remainingFPRegs--;
+      return;
+    }
+    this.AllocStack();
+  }
+
+  macro AllocFP64(): void {
+    if (this.remainingFPRegs > 0) {
+      this.remainingFPRegs--;
+      return;
+    }
+    if constexpr (Is64()) {
+      this.stackSlots++;
+    } else {
+      this.stackSlots += 2;
+      this.smallSlotLast = false;
+    }
+  }
+
+  macro GetSize(): intptr {
+    if (this.smallSlotLast) {
+      return this.stackSlots - 1;
+    } else {
+      return this.stackSlots;
+    }
+  }
+
+  remainingGPRegs: intptr;
+  remainingFPRegs: intptr;
+  // Even on 32-bit platforms we always allocate 64-bit stack space at a time to
+  // preserve alignment. If we allocate a 64-bit slot for a 32-bit type, then we
+  // remember the second half of the 64-bit slot as `smallSlot` so that it can
+  // be used for the next 32-bit type.
+  hasSmallSlot: bool;
+  // If the {smallSlot} is in the middle of the whole allocated stack space,
+  // then it is part of the overall stack space size. However, if the hole is at
+  // the border of the whole allocated stack space, then we have to subtract it
+  // from the overall stack space size. This flag keeps track of whether the
+  // hole is in the middle (false) or at the border (true).
+  smallSlotLast: bool;
+  stackSlots: intptr;
+}
+
+macro NewReturnSlotAllocator(): ReturnSlotAllocator {
+  let result: ReturnSlotAllocator;
+  result.remainingGPRegs = kNumGPRegisterReturns;
+  result.remainingFPRegs = kNumFPRegisterReturns;
+  result.stackSlots = 0;
+  result.hasSmallSlot = false;
+  result.smallSlotLast = false;
+  return result;
+}
+
+struct LocationAllocator {
+  macro GetStackSlot(): &intptr {
+    if constexpr (Is64()) {
+      const result = torque_internal::unsafe::NewReference<intptr>(
+          this.object, this.nextStack);
+      this.nextStack += torque_internal::SizeOf<intptr>();
+      return result;
+    } else {
+      if (this.smallSlot != 0) {
+        const result = torque_internal::unsafe::NewReference<intptr>(
+            this.object, this.smallSlot);
+        this.smallSlot = 0;
+        this.smallSlotLast = false;
+        return result;
+      }
+      const result = torque_internal::unsafe::NewReference<intptr>(
+          this.object, this.nextStack);
+      this.smallSlot = this.nextStack + torque_internal::SizeOf<intptr>();
+      this.nextStack = this.smallSlot + torque_internal::SizeOf<intptr>();
+      this.smallSlotLast = true;
+      return result;
+    }
+  }
+
+  macro GetGPSlot(): &intptr {
+    if (this.remainingGPRegs-- > 0) {
+      const result = torque_internal::unsafe::NewReference<intptr>(
+          this.object, this.nextGPReg);
+      this.nextGPReg += torque_internal::SizeOf<intptr>();
+      return result;
+    }
+    return this.GetStackSlot();
+  }
+
+  macro GetFP32Slot(): &intptr {
+    if (this.remainingFPRegs-- > 0) {
+      const result = torque_internal::unsafe::NewReference<intptr>(
+          this.object, this.nextFPReg);
+      this.nextFPReg += torque_internal::SizeOf<float64>();
+      return result;
+    }
+    return this.GetStackSlot();
+  }
+
+  macro GetFP64Slot(): &intptr {
+    if (this.remainingFPRegs-- > 0) {
+      const result = torque_internal::unsafe::NewReference<intptr>(
+          this.object, this.nextFPReg);
+      this.nextFPReg += torque_internal::SizeOf<float64>();
+      return result;
+    }
+    if constexpr (Is64()) {
+      return this.GetStackSlot();
+    } else {
+      const result = torque_internal::unsafe::NewReference<intptr>(
+          this.object, this.nextStack);
+      this.nextStack = this.nextStack + 2 * torque_internal::SizeOf<intptr>();
+      this.smallSlotLast = false;
+      return result;
+    }
+  }
+
+  // For references we start a new section on the stack, no old slots are
+  // filled.
+  macro StartRefs(): void {
+    if (!this.smallSlotLast) {
+      this.smallSlot = 0;
+    }
+  }
+
+  macro GetStackEnd(): RawPtr {
+    let offset = this.nextStack;
+    if (this.smallSlotLast) {
+      offset -= torque_internal::SizeOf<intptr>();
+    }
+    return torque_internal::unsafe::GCUnsafeReferenceToRawPtr(
+        this.object, offset);
+  }
+
+  macro GetAlignedStackEnd(alignment: intptr): RawPtr {
+    let offset = this.nextStack;
+    if (this.smallSlotLast) {
+      offset -= torque_internal::SizeOf<intptr>();
+    }
+    const stackSize = offset - this.stackStart;
+    if (stackSize % alignment != 0) {
+      offset += alignment - (stackSize % alignment);
+    }
+    return torque_internal::unsafe::GCUnsafeReferenceToRawPtr(
+        this.object, offset);
+  }
+
+  object: HeapObject|TaggedZeroPattern;
+  remainingGPRegs: intptr;
+  remainingFPRegs: intptr;
+  nextGPReg: intptr;
+  nextFPReg: intptr;
+  nextStack: intptr;
+  stackStart: intptr;
+  // Even on 32-bit platforms we always allocate 64-bit stack space at a time to
+  // preserve alignment. If we allocate a 64-bit slot for a 32-bit type, then we
+  // remember the second half of the 64-bit slot as `smallSlot` so that it can
+  // be used for the next 32-bit type.
+  smallSlot: intptr;
+  // If the {smallSlot} is in the middle of the whole allocated stack space,
+  // then it is part of the overall stack space size. However, if the hole is at
+  // the border of the whole allocated stack space, then we have to subtract it
+  // from the overall stack space size. This flag keeps track of whether the
+  // hole is in the middle (false) or at the border (true).
+  smallSlotLast: bool;
+}
+
+macro LocationAllocatorForParams(paramBuffer: &intptr): LocationAllocator {
+  let result: LocationAllocator;
+  result.object = paramBuffer.object;
+  result.remainingGPRegs = UniqueIntPtrConstant(kNumGPRegisterParameters);
+  result.remainingFPRegs = UniqueIntPtrConstant(kNumFPRegisterParameters);
+  result.nextGPReg = paramBuffer.offset;
+  result.nextFPReg = result.remainingGPRegs * torque_internal::SizeOf<intptr>();
+  if constexpr (!Is64()) {
+    // Add padding to provide 8-byte alignment for float64 values.
+    result.nextFPReg += (result.nextFPReg & torque_internal::SizeOf<intptr>());
+  }
+  dcheck(result.nextFPReg % 8 == 0);
+  result.nextFPReg += paramBuffer.offset;
+  result.nextStack = result.nextFPReg +
+      result.remainingFPRegs * torque_internal::SizeOf<float64>();
+  result.stackStart = result.nextStack;
+  result.smallSlot = 0;
+  result.smallSlotLast = false;
+  return result;
+}
+
+macro LocationAllocatorForReturns(
+    gpRegs: RawPtr, fpRegs: RawPtr, stack: RawPtr): LocationAllocator {
+  let result: LocationAllocator;
+  result.object = kZeroBitPattern;
+  result.remainingGPRegs = kNumGPRegisterReturns;
+  result.remainingFPRegs = kNumFPRegisterReturns;
+  result.nextGPReg = Convert<intptr>(gpRegs) + kHeapObjectTag;
+  result.nextFPReg = Convert<intptr>(fpRegs) + kHeapObjectTag;
+  result.nextStack = Convert<intptr>(stack) + kHeapObjectTag;
+  result.stackStart = result.nextStack;
+  result.smallSlot = 0;
+  result.smallSlotLast = false;
+  return result;
+}
+
+macro JSToWasmObject(
+    context: NativeContext, instanceOrUndefined: WasmInstanceObject|Undefined,
+    targetType: int32, value: JSAny): Object {
+  const heapType = (targetType >> kValueTypeKindBits) & kValueTypeHeapTypeMask;
+  const kind = targetType & kValueTypeKindBitsMask;
+  if (heapType == HeapType::kExtern || heapType == HeapType::kNoExtern) {
+    if (kind == ValueKind::kRef && value == Null) {
+      ThrowTypeError(MessageTemplate::kWasmTrapJSTypeError);
+    }
+    return value;
+  }
+  if (heapType == HeapType::kString) {
+    if (TaggedIsSmi(value)) {
+      ThrowTypeError(MessageTemplate::kWasmTrapJSTypeError);
+    }
+    if (IsString(UnsafeCast<HeapObject>(value))) {
+      return value;
+    }
+    if (value == Null) {
+      if (kind == ValueKind::kRef) {
+        ThrowTypeError(MessageTemplate::kWasmTrapJSTypeError);
+      } else {
+        return kWasmNull;
+      }
+    }
+
+    ThrowTypeError(MessageTemplate::kWasmTrapJSTypeError);
+  }
+  return runtime::WasmGenericJSToWasmObject(
+      context, instanceOrUndefined, value, Convert<Smi>(targetType));
+}
+
+macro JSToWasmWrapperHelper(
+    context: NativeContext, _receiver: JSAny, target: JSFunction,
+    arguments: Arguments, switchStack: constexpr bool): never {
+  const functionData = UnsafeCast<WasmExportedFunctionData>(
+      target.shared_function_info.function_data);
+
+  // Trigger a wrapper tier-up when this function got called often enough.
+  if constexpr (!switchStack) {
+    functionData.wrapper_budget = functionData.wrapper_budget - 1;
+    if (functionData.wrapper_budget == 0) {
+      runtime::WasmCompileWrapper(kNoContext, functionData);
+    }
+  }
+
+  const sig = functionData.sig_ptr;
+
+  const paramCount = *GetRefAt<int32>(sig, kWasmParameterCountOffset);
+
+  const returnCount = *GetRefAt<int32>(sig, kWasmReturnCountOffset);
+
+  const reps = *GetRefAt<RawPtr>(sig, kWasmSigTypesOffset);
+
+  const sigTypes = torque_internal::unsafe::NewOffHeapConstSlice(
+      %RawDownCast<RawPtr<int32>>(reps),
+      Convert<intptr>(paramCount + returnCount));
+
+  // If the return count is greater than 1, then the return values are returned
+  // as a JSArray. After returning from the call to wasm, the return values are
+  // stored on an area of the stack the GC does not know about. To avoid a GC
+  // while references are still stored in this area of the stack, we allocate
+  // the result JSArray already now before the call to wasm.
+  let resultArray: JSAny = Undefined;
+  let returnSize: intptr = 0;
+  let hasRefReturns: bool = false;
+  if (returnCount > 1) {
+    resultArray = WasmAllocateJSArray(Convert<Smi>(returnCount));
+
+    // We have to calculate the size of the stack area where the wasm function
+    // will store the return values for multi-return.
+    const returnTypes =
+        Subslice(sigTypes, Convert<intptr>(0), Convert<intptr>(returnCount))
+        otherwise unreachable;
+    let retIt = returnTypes.Iterator();
+    let allocator = NewReturnSlotAllocator();
+
+    while (!retIt.Empty()) {
+      const retType = retIt.NextNotEmpty();
+      if (retType == kWasmI32Type) {
+        allocator.AllocGP();
+      } else if (retType == kWasmI64Type) {
+        allocator.AllocGP();
+        if constexpr (!Is64()) {
+          // On 32-bit platforms I64 values are stored as two I32 values.
+          allocator.AllocGP();
+        }
+      } else if (retType == kWasmF32Type) {
+        allocator.AllocFP32();
+      } else if (retType == kWasmF64Type) {
+        allocator.AllocFP64();
+      } else {
+        // Also check if there are any reference return values, as this allows
+        // us to skip code when we process return values.
+        hasRefReturns = true;
+        allocator.AllocGP();
+      }
+    }
+    returnSize = allocator.GetSize();
+  }
+
+  const paramTypes = Subslice(
+      sigTypes, Convert<intptr>(returnCount), Convert<intptr>(paramCount))
+      otherwise unreachable;
+
+  let paramBuffer: &intptr;
+
+  // 10 here is an arbitrary number. The analysis of signatures of exported
+  // functions of big modules showed that most signatures have a low number of
+  // I32 parameters. We picked a cutoff point where for most signatures the
+  // pre-allocated stack slots are sufficient without making these stack slots
+  // overly big.
+  if (paramCount <= 10) {
+    // Performance optimization: we pre-allocate a stack area with 18
+    // 8-byte slots, and use this area when it is sufficient for all
+    // parameters. If the stack area is too small, we allocate a byte array
+    // below. The stack area is big enough for 10 parameters. The 10 parameters
+    // need 18 * 8 bytes because some segments of the stack area are reserved
+    // for register parameters, and there may e.g. be no FP parameters passed
+    // by register, so all 8 FP register slots would remain empty.
+    const stackSlots = %RawDownCast<RawPtr<intptr>>(
+        StackSlotPtr(144, torque_internal::SizeOf<float64>()));
+    paramBuffer = torque_internal::unsafe::NewOffHeapReference(stackSlots);
+  } else {
+    // We have to estimate the size of the byte array such that it can store
+    // all converted parameters. The size is the sum of sizes of the segments
+    // for the gp registers, fp registers, and stack slots. The sizes of
+    // the register segments are fixed, but for the size of the stack segment
+    // we have to guess the number of parameters on the stack. On ia32 it can
+    // happen that only a single parameter fits completely into a register, and
+    // all other parameters end up at least partially on the stack (e.g. for a
+    // signature with only I64 parameters). To make the calculation simpler, we
+    // just assume that all parameters are on the stack.
+    const kSlotSize: intptr = torque_internal::SizeOf<float64>();
+    const bufferSize = UniqueIntPtrConstant(kNumGPRegisterParameters) *
+            Convert<intptr>(torque_internal::SizeOf<intptr>()) +
+        UniqueIntPtrConstant(kNumFPRegisterParameters) * kSlotSize +
+        Convert<intptr>(paramCount) * kSlotSize;
+    const slice = &AllocateByteArray(Convert<uintptr>(bufferSize)).bytes;
+    paramBuffer = torque_internal::unsafe::NewReference<intptr>(
+        slice.object, slice.offset);
+  }
+
+  let locationAllocator = LocationAllocatorForParams(paramBuffer);
+  let hasRefParam: bool = false;
+
+  let paramTypeIndex: int32 = 0;
+  // For stack switching paramTypeIndex and paramIndex diverges,
+  // because a suspender is not passed to wrapper as param.
+  if constexpr (switchStack) {
+    paramTypeIndex++;
+    hasRefParam = true;
+  }
+  for (let paramIndex: int32 = 0; paramTypeIndex < paramCount; paramIndex++) {
+    const param = arguments[Convert<intptr>(paramIndex)];
+    const paramType = *paramTypes.UncheckedAtIndex(
+        Convert<intptr>(paramTypeIndex++));
+    if (paramType == kWasmI32Type) {
+      let toRef = locationAllocator.GetGPSlot();
+      typeswitch (param) {
+        case (smiParam: Smi): {
+          *toRef = Convert<intptr>(Unsigned(SmiToInt32(smiParam)));
+        }
+        case (heapParam: JSAnyNotSmi): {
+          *toRef =
+              Convert<intptr>(Unsigned(WasmTaggedNonSmiToInt32(heapParam)));
+        }
+      }
+    } else if (paramType == kWasmF32Type) {
+      let toRef = locationAllocator.GetFP32Slot();
+      *toRef = Convert<intptr>(Bitcast<uint32>(WasmTaggedToFloat32(param)));
+    } else if (paramType == kWasmF64Type) {
+      let toRef = locationAllocator.GetFP64Slot();
+      *RefCast<float64>(toRef) = ChangeTaggedToFloat64(param);
+    } else if (paramType == kWasmI64Type) {
+      if constexpr (Is64()) {
+        let toRef = locationAllocator.GetGPSlot();
+        const v = TruncateBigIntToI64(context, param);
+        *toRef = v;
+      } else {
+        let toLowRef = locationAllocator.GetGPSlot();
+        let toHighRef = locationAllocator.GetGPSlot();
+        const bigIntVal = ToBigInt(context, param);
+        const pair = BigIntToRawBytes(bigIntVal);
+        *toLowRef = Signed(pair.low);
+        *toHighRef = Signed(pair.high);
+      }
+    } else {
+      // The byte array where we store converted parameters is not GC-safe.
+      // Therefore we can only copy references into this array once no GC can
+      // happen anymore. Any conversion of a primitive type can execute
+      // arbitrary JavaScript code and therefore also trigger GC. Therefore
+      // references get copied into the array only after all parameters of
+      // primitive types are finished. For now we write the converted parameter
+      // back to the stack.
+      hasRefParam = true;
+      arguments[Convert<intptr>(paramIndex)] =
+          JSToWasmObject(context, functionData.instance, paramType, param);
+    }
+  }
+  if (hasRefParam) {
+    // Iterate over all parameters again and handle all those with ref types.
+    let k: int32 = 0;
+    // For stack switching k and paramIndex diverges,
+    // because a suspender is not passed to wrapper as param.
+    let paramIndex: int32 = 0;
+    locationAllocator.StartRefs();
+
+    if constexpr (switchStack) {
+      const suspender = runtime::WasmAllocateSuspender(context);
+      const toRef = locationAllocator.GetGPSlot();
+      *toRef = BitcastTaggedToWord(suspender);
+      // First param is suspender, so skip it in the signature loop.
+      k++;
+    }
+
+    // We are not using a `for` loop here because Torque does not support
+    // `continue` in `for` loops.
+    while (k < paramCount) {
+      const paramType = *paramTypes.UncheckedAtIndex(Convert<intptr>(k));
+      const paramKind = paramType & kValueTypeKindBitsMask;
+      if (paramKind != ValueKind::kRef && paramKind != ValueKind::kRefNull) {
+        k++;
+        paramIndex++;
+        continue;
+      }
+      const param = arguments[Convert<intptr>(paramIndex++)];
+      let toRef = locationAllocator.GetGPSlot();
+      *toRef = BitcastTaggedToWord(param);
+      k++;
+    }
+  }
+  const paramStart = paramBuffer.GCUnsafeRawPtr();
+  const paramEnd = locationAllocator.GetStackEnd();
+
+  const internal: WasmInternalFunction = functionData.internal;
+  const callTarget = internal.call_target_ptr;
+  const instance: WasmInstanceObject = functionData.instance;
+
+  // We construct a state that will be passed to `JSToWasmWrapperAsm`
+  // and `JSToWasmHandleReturns`. There are too many parameters to pass
+  // everything through registers. The stack area also contains slots for
+  // values that get passed from `JSToWasmWrapperAsm` and
+  // `WasmReturnPromiseOnSuspendAsm` to `JSToWasmHandleReturns`.
+  const wrapperBuffer = %RawDownCast<RawPtr<intptr>>(
+      StackSlotPtr(kWrapperBufferSize, torque_internal::SizeOf<intptr>()));
+
+  *GetRefAt<int32>(wrapperBuffer, kWrapperBufferReturnCount) = returnCount;
+  *GetRefAt<bool>(wrapperBuffer, kWrapperBufferRefReturnCount) = hasRefReturns;
+  *GetRefAt<RawPtr>(wrapperBuffer, kWrapperBufferSigRepresentationArray) = reps;
+  *GetRefAt<intptr>(wrapperBuffer, kWrapperBufferStackReturnBufferSize) =
+      returnSize;
+  *GetRefAt<RawPtr>(wrapperBuffer, kWrapperBufferCallTarget) = callTarget;
+  *GetRefAt<RawPtr<intptr>>(wrapperBuffer, kWrapperBufferParamStart) =
+      paramStart;
+  *GetRefAt<RawPtr>(wrapperBuffer, kWrapperBufferParamEnd) = paramEnd;
+
+  // Both `instance` and `resultArray` get passed separately as parameters to
+  // make them GC-safe. They get passed over the stack so that they get scanned
+  // by the GC as part of the outgoing parameters of this Torque builtin.
+  let result: JSAny;
+  if constexpr (switchStack) {
+    result =
+        WasmReturnPromiseOnSuspendAsm(wrapperBuffer, instance, resultArray);
+  } else {
+    result = JSToWasmWrapperAsm(wrapperBuffer, instance, resultArray);
+  }
+
+  // The normal return sequence of Torque-generated JavaScript builtins does not
+  // consider the case where the caller may push additional "undefined"
+  // parameters on the stack, and therefore does not generate code to pop these
+  // additional parameters. Here we calculate the actual number of parameters on
+  // the stack. This number is the number of actual parameters provided by the
+  // caller, which is `arguments.length`, or the number of declared arguments,
+  // if not enough actual parameters were provided, i.e.
+  // `SharedFunctionInfo::length`.
+  let popCount = arguments.length;
+  const declaredArgCount =
+      Convert<intptr>(Convert<int32>(target.shared_function_info.length));
+  if (declaredArgCount > popCount) {
+    popCount = declaredArgCount;
+  }
+  // Also pop the receiver.
+  PopAndReturn(popCount + 1, result);
+}
+
+transitioning javascript builtin JSToWasmWrapper(
+    js-implicit context: NativeContext, receiver: JSAny, target: JSFunction)(
+    ...arguments): JSAny {
+  JSToWasmWrapperHelper(context, receiver, target, arguments, false);
+}
+
+transitioning javascript builtin WasmReturnPromiseOnSuspend(
+    js-implicit context: NativeContext, receiver: JSAny, target: JSFunction)(
+    ...arguments): JSAny {
+  JSToWasmWrapperHelper(context, receiver, target, arguments, true);
+}
+
+macro WasmToJSObject(context: NativeContext, value: Object, retType: int32):
+    JSAny {
+  const paramKind = retType & kValueTypeKindBitsMask;
+  const heapType = (retType >> kValueTypeKindBits) & kValueTypeHeapTypeMask;
+  if (paramKind == ValueKind::kRef) {
+    if (heapType == HeapType::kEq || heapType == HeapType::kI31 ||
+        heapType == HeapType::kStruct || heapType == HeapType::kArray ||
+        heapType == HeapType::kAny || heapType == HeapType::kExtern ||
+        heapType == HeapType::kString || heapType == HeapType::kNone ||
+        heapType == HeapType::kNoFunc || heapType == HeapType::kNoExtern) {
+      return UnsafeCast<JSAny>(value);
+    }
+    // TODO(ahaas): This is overly pessimistic: all module-defined struct and
+    // array types can be passed to JS as-is as well; and for function types we
+    // could at least support the fast path where the WasmExternalFunction has
+    // already been created.
+    return runtime::WasmGenericWasmToJSObject(context, value);
+  } else {
+    dcheck(paramKind == ValueKind::kRefNull);
+    if (heapType == HeapType::kExtern || heapType == HeapType::kNoExtern) {
+      return UnsafeCast<JSAny>(value);
+    }
+    if (value == kWasmNull) {
+      return Null;
+    }
+    if (heapType == HeapType::kEq || heapType == HeapType::kStruct ||
+        heapType == HeapType::kArray || heapType == HeapType::kString ||
+        heapType == HeapType::kI31 || heapType == HeapType::kAny) {
+      return UnsafeCast<JSAny>(value);
+    }
+    // TODO(ahaas): This is overly pessimistic: all module-defined struct and
+    // array types can be passed to JS as-is as well; and for function types we
+    // could at least support the fast path where the WasmExternalFunction has
+    // already been created.
+    return runtime::WasmGenericWasmToJSObject(context, value);
+  }
+}
+
+builtin JSToWasmHandleReturns(
+    instance: WasmInstanceObject, resultArray: JSArray,
+    wrapperBuffer: RawPtr<intptr>): JSAny {
+  const returnCount = *GetRefAt<int32>(
+      wrapperBuffer, kWrapperBufferReturnCount);
+  if (returnCount == 0) {
+    return Undefined;
+  }
+  if (returnCount == 1) {
+    const reps = *GetRefAt<RawPtr>(
+        wrapperBuffer, kWrapperBufferSigRepresentationArray);
+    const retType = *GetRefAt<int32>(reps, 0);
+    if (retType == kWasmI32Type) {
+      const ret = *GetRefAt<int32>(
+          wrapperBuffer, kWrapperBufferGPReturnRegister1);
+      const result = Convert<Number>(ret);
+      return result;
+    } else if (retType == kWasmF32Type) {
+      const resultRef =
+          GetRefAt<float32>(wrapperBuffer, kWrapperBufferFPReturnRegister1);
+      return Convert<Number>(*resultRef);
+    } else if (retType == kWasmF64Type) {
+      const resultRef =
+          GetRefAt<float64>(wrapperBuffer, kWrapperBufferFPReturnRegister1);
+      return Convert<Number>(*resultRef);
+    } else if (retType == kWasmI64Type) {
+      if constexpr (Is64()) {
+        const ret = *GetRefAt<intptr>(
+            wrapperBuffer, kWrapperBufferGPReturnRegister1);
+        return I64ToBigInt(ret);
+      } else {
+        const lowWord = *GetRefAt<intptr>(
+            wrapperBuffer, kWrapperBufferGPReturnRegister1);
+        const highWord = *GetRefAt<intptr>(
+            wrapperBuffer, kWrapperBufferGPReturnRegister2);
+        return I32PairToBigInt(lowWord, highWord);
+      }
+    } else {
+      const ptr = %RawDownCast<RawPtr<uintptr>>(
+          wrapperBuffer + kWrapperBufferGPReturnRegister1);
+      const rawRef = *GetRefAt<uintptr>(ptr, 0);
+      const value = BitcastWordToTagged(rawRef);
+      return WasmToJSObject(LoadContextFromInstance(instance), value, retType);
+    }
+  }
+
+  // Multi return;
+  const fixedArray: FixedArray = UnsafeCast<FixedArray>(resultArray.elements);
+  const returnBuffer = *GetRefAt<RawPtr>(
+      wrapperBuffer, kWrapperBufferStackReturnBufferStart);
+  let locationAllocator = LocationAllocatorForReturns(
+      wrapperBuffer + kWrapperBufferGPReturnRegister1,
+      wrapperBuffer + kWrapperBufferFPReturnRegister1, returnBuffer);
+
+  const reps = *GetRefAt<RawPtr>(
+      wrapperBuffer, kWrapperBufferSigRepresentationArray);
+
+  const retTypes = torque_internal::unsafe::NewOffHeapConstSlice(
+      %RawDownCast<RawPtr<int32>>(reps), Convert<intptr>(returnCount));
+
+  const hasRefReturns = *GetRefAt<bool>(
+      wrapperBuffer, kWrapperBufferRefReturnCount);
+
+  if (hasRefReturns) {
+    // We first process all references and copy them in the the result array to
+    // put them into a location that is known to the GC. The processing of
+    // references does not trigger a GC, but the allocation of HeapNumbers and
+    // BigInts for primitive types may trigger a GC.
+
+    for (let k: intptr = 0; k < Convert<intptr>(returnCount); k++) {
+      const retType = *retTypes.UncheckedAtIndex(Convert<intptr>(k));
+      if (retType == kWasmI32Type) {
+        locationAllocator.GetGPSlot();
+      } else if (retType == kWasmF32Type) {
+        locationAllocator.GetFP32Slot();
+      } else if (retType == kWasmI64Type) {
+        locationAllocator.GetGPSlot();
+        if constexpr (!Is64()) {
+          locationAllocator.GetGPSlot();
+        }
+      } else if (retType == kWasmF64Type) {
+        locationAllocator.GetFP64Slot();
+      } else {
+        let value: Object;
+        const slot = locationAllocator.GetGPSlot();
+        const rawRef = *slot;
+        value = BitcastWordToTagged(rawRef);
+        // Store the wasm object in the JSArray to make it GC safe. The
+        // transformation will happen later in a second loop.
+        fixedArray.objects[k] = value;
+      }
+    }
+  }
+
+  locationAllocator = LocationAllocatorForReturns(
+      wrapperBuffer + kWrapperBufferGPReturnRegister1,
+      wrapperBuffer + kWrapperBufferFPReturnRegister1, returnBuffer);
+
+  for (let k: intptr = 0; k < Convert<intptr>(returnCount); k++) {
+    const retType = *retTypes.UncheckedAtIndex(Convert<intptr>(k));
+    if (retType == kWasmI32Type) {
+      const slot = locationAllocator.GetGPSlot();
+      const val = *RefCast<int32>(slot);
+      fixedArray.objects[k] = Convert<Number>(val);
+    } else if (retType == kWasmF32Type) {
+      const slot = locationAllocator.GetFP32Slot();
+      const val = *RefCast<float32>(slot);
+      fixedArray.objects[k] = Convert<Number>(val);
+    } else if (retType == kWasmI64Type) {
+      if constexpr (Is64()) {
+        const slot = locationAllocator.GetGPSlot();
+        const val = *slot;
+        fixedArray.objects[k] = I64ToBigInt(val);
+      } else {
+        const lowWordSlot = locationAllocator.GetGPSlot();
+        const highWordSlot = locationAllocator.GetGPSlot();
+        const lowWord = *lowWordSlot;
+        const highWord = *highWordSlot;
+        fixedArray.objects[k] = I32PairToBigInt(lowWord, highWord);
+      }
+    } else if (retType == kWasmF64Type) {
+      const slot = locationAllocator.GetFP64Slot();
+      const val = *RefCast<float64>(slot);
+      fixedArray.objects[k] = Convert<Number>(val);
+    } else {
+      locationAllocator.GetGPSlot();
+      const value = fixedArray.objects[k];
+      fixedArray.objects[k] =
+          WasmToJSObject(LoadContextFromInstance(instance), value, retType);
+    }
+  }
+
+  return resultArray;
+}
+}  // namespace wasm
diff --git a/deps/v8/src/builtins/loong64/builtins-loong64.cc b/deps/v8/src/builtins/loong64/builtins-loong64.cc
index 42f3f980a560b7..abd863546b6d01 100644
--- a/deps/v8/src/builtins/loong64/builtins-loong64.cc
+++ b/deps/v8/src/builtins/loong64/builtins-loong64.cc
@@ -231,19 +231,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   // Call the function.
   __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
 
-  // ----------- S t a t e -------------
-  //  --                 s0: constructor result
-  //  -- sp[0*kSystemPointerSize]: implicit receiver
-  //  -- sp[1*kSystemPointerSize]: padding
-  //  -- sp[2*kSystemPointerSize]: constructor function
-  //  -- sp[3*kSystemPointerSize]: number of arguments
-  //  -- sp[4*kSystemPointerSize]: context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -275,12 +262,8 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   __ bind(&check_receiver);
   __ JumpIfSmi(a0, &use_receiver);
 
-  // If the type of the result (stored in its map) is less than
-  // FIRST_JS_RECEIVER_TYPE, it is not an object in the ECMA sense.
-  __ GetObjectType(a0, t2, t2);
-  static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
-  __ Branch(&leave_and_return, greater_equal, t2,
-            Operand(FIRST_JS_RECEIVER_TYPE));
+  // Check if the type of the result is not an object in the ECMA sense.
+  __ JumpIfJSAnyIsNotPrimitive(a0, t2, &leave_and_return);
   __ Branch(&use_receiver);
 
   __ bind(&do_throw);
@@ -445,9 +428,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     // undefined because generator functions are non-constructable.
     __ Move(a3, a1);
     __ Move(a1, a4);
-    static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-    __ LoadTaggedField(a2, FieldMemOperand(a1, JSFunction::kCodeOffset));
-    __ JumpCodeObject(a2);
+    __ JumpJSFunction(a1);
   }
 
   __ bind(&prepare_step_in_if_stepping);
@@ -912,9 +893,17 @@ static void AdvanceBytecodeOffsetOrReturn(MacroAssembler* masm,
 }
 
 namespace {
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array) {
-  __ St_h(zero_reg,
-          FieldMemOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset));
+
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi) {
+  __ St_h(zero_reg, FieldMemOperand(sfi, SharedFunctionInfo::kAgeOffset));
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function,
+                        Register scratch) {
+  __ LoadTaggedField(
+      scratch,
+      FieldMemOperand(js_function, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, scratch);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
@@ -922,8 +911,7 @@ void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
   DCHECK(!AreAliased(feedback_vector, scratch));
   __ Ld_bu(scratch,
            FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
-  __ And(scratch, scratch,
-         Operand(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ And(scratch, scratch, Operand(~FeedbackVector::OsrUrgencyBits::kMask));
   __ St_b(scratch,
           FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
 }
@@ -943,8 +931,9 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   Register feedback_vector = temps.Acquire();
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
   {
     UseScratchRegisterScope temps(masm);
     Register scratch = temps.Acquire();
@@ -988,6 +977,10 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
         BaselineOutOfLinePrologueDescriptor::kCalleeContext);
     Register callee_js_function = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kClosure);
+    {
+      UseScratchRegisterScope temps(masm);
+      ResetJSFunctionAge(masm, callee_js_function, temps.Acquire());
+    }
     __ Push(callee_context, callee_js_function);
     DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
     DCHECK_EQ(callee_js_function, kJSFunctionRegister);
@@ -998,7 +991,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // the frame, so load it into a register.
     Register bytecode_array = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray);
-    ResetBytecodeAge(masm, bytecode_array);
     __ Push(argc, bytecode_array);
 
     // Baseline code frames store the feedback vector where interpreter would
@@ -1112,6 +1104,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   __ LoadTaggedField(
       kScratchReg,
       FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, kScratchReg);
   __ LoadTaggedField(
       kInterpreterBytecodeArrayRegister,
       FieldMemOperand(kScratchReg, SharedFunctionInfo::kFunctionDataOffset));
@@ -1123,16 +1116,17 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // The bytecode array could have been flushed from the shared function info,
   // if so, call into CompileLazy.
   Label compile_lazy;
-  __ GetObjectType(kInterpreterBytecodeArrayRegister, kScratchReg, kScratchReg);
-  __ Branch(&compile_lazy, ne, kScratchReg, Operand(BYTECODE_ARRAY_TYPE));
+  __ JumpIfObjectType(&compile_lazy, ne, kInterpreterBytecodeArrayRegister,
+                      BYTECODE_ARRAY_TYPE, kScratchReg);
 
 #ifndef V8_JITLESS
   // Load the feedback vector from the closure.
   Register feedback_vector = a2;
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label push_stack_frame;
   // Check if feedback vector is valid. If valid, check for optimized code
@@ -1177,8 +1171,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ PushStandardFrame(closure);
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
-
   // Load initial bytecode offset.
   __ li(kInterpreterBytecodeOffsetRegister,
         Operand(BytecodeArray::kHeaderSize - kHeapObjectTag));
@@ -1320,8 +1312,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ LoadTaggedField(
         feedback_vector,
         FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-    __ LoadTaggedField(feedback_vector,
-                       FieldMemOperand(feedback_vector, Cell::kValueOffset));
+    __ LoadTaggedField(
+        feedback_vector,
+        FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1488,11 +1481,179 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   }
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- a0 : the number of arguments
+  // -- a1 : constructor to call (checked to be a JSFunction)
+  // -- a3 : new target
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+  Register implicit_receiver = a4;
+
+  // Save live registers.
+  __ SmiTag(a0);
+  __ Push(a0, a1, a3);
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  // Save result.
+  __ Move(implicit_receiver, a0);
+  // Restore live registers.
+  __ Pop(a0, a1, a3);
+  __ SmiUntag(a0);
+
+  // Patch implicit receiver (in arguments)
+  __ StoreReceiver(implicit_receiver);
+  // Patch second implicit (in construct frame)
+  __ St_d(implicit_receiver,
+          MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+
+  // Restore context.
+  __ Ld_d(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- a0 : argument count
+  // -- a1 : constructor to call (checked to be a JSFunction)
+  // -- a3 : new target
+  // -- a4 : address of the first argument
+  // -- cp : context pointer
+  // -----------------------------------
+  __ AssertFunction(a1);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  __ LoadMap(a2, a1);
+  __ Ld_bu(a2, FieldMemOperand(a2, Map::kBitFieldOffset));
+  __ And(a2, a2, Operand(Map::Bits1::IsConstructorBit::kMask));
+  __ Branch(&non_constructor, eq, a2, Operand(zero_reg));
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(a0, a2, a5, &stack_overflow);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+
+  // Implicit receiver stored in the construct frame.
+  __ LoadRoot(a2, RootIndex::kTheHoleValue);
+  __ Push(cp, a2);
+
+  // Push arguments + implicit receiver.
+  Register argc_without_receiver = a7;
+  __ Sub_d(argc_without_receiver, a0, Operand(kJSArgcReceiverSlots));
+  GenerateInterpreterPushArgs(masm, argc_without_receiver, a4, a5, a6);
+  __ Push(a2);
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  __ LoadTaggedField(
+      a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset));
+  __ Ld_wu(a2, FieldMemOperand(a2, SharedFunctionInfo::kFlagsOffset));
+  __ And(a5, a2, Operand(SharedFunctionInfo::ConstructAsBuiltinBit::kMask));
+  __ Branch(&builtin_call, ne, a5, Operand(zero_reg));
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(a2);
+  __ JumpIfIsInRange(
+      a2, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor),
+      &not_create_implicit_receiver);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the function.
+  __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- a0     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label use_receiver, do_throw, leave_and_return, check_receiver;
+
+  // If the result is undefined, we jump out to using the implicit receiver.
+  __ JumpIfNotRoot(a0, RootIndex::kUndefinedValue, &check_receiver);
+
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ bind(&use_receiver);
+  __ Ld_d(a0,
+          MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+  __ JumpIfRoot(a0, RootIndex::kTheHoleValue, &do_throw);
+
+  __ bind(&leave_and_return);
+  // Leave construct frame.
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  // Otherwise we do a smi check and fall through to check if the return value
+  // is a valid receiver.
+  __ bind(&check_receiver);
+
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(a0, &use_receiver);
+
+  // Check if the type of the result is not an object in the ECMA sense.
+  __ JumpIfJSAnyIsNotPrimitive(a0, a4, &leave_and_return);
+  __ Branch(&use_receiver);
+
+  __ bind(&builtin_call);
+  // TODO(victorgomes): Check the possibility to turn this into a tailcall.
+  __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  __ bind(&do_throw);
+  // Restore the context from the frame.
+  __ Ld_d(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  // Unreachable code.
+  __ break_(0xCC);
+
+  __ bind(&stack_overflow);
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  // Unreachable code.
+  __ break_(0xCC);
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Set the return address to the correct point in the interpreter entry
   // trampoline.
   Label builtin_trampoline, trampoline_loaded;
-  Smi interpreter_entry_return_pc_offset(
+  Tagged<Smi> interpreter_entry_return_pc_offset(
       masm->isolate()->heap()->interpreter_entry_return_pc_offset());
   DCHECK_NE(interpreter_entry_return_pc_offset, Smi::zero());
 
@@ -1505,14 +1666,12 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
       t0, FieldMemOperand(t0, JSFunction::kSharedFunctionInfoOffset));
   __ LoadTaggedField(
       t0, FieldMemOperand(t0, SharedFunctionInfo::kFunctionDataOffset));
-  __ GetObjectType(t0, kInterpreterDispatchTableRegister,
-                   kInterpreterDispatchTableRegister);
-  __ Branch(&builtin_trampoline, ne, kInterpreterDispatchTableRegister,
-            Operand(INTERPRETER_DATA_TYPE));
+  __ JumpIfObjectType(&builtin_trampoline, ne, t0, INTERPRETER_DATA_TYPE,
+                      kInterpreterDispatchTableRegister);
 
   __ LoadTaggedField(
       t0, FieldMemOperand(t0, InterpreterData::kInterpreterTrampolineOffset));
-  __ LoadCodeEntry(t0, t0);
+  __ LoadCodeInstructionStart(t0, t0);
   __ Branch(&trampoline_loaded);
 
   __ bind(&builtin_trampoline);
@@ -1670,7 +1829,7 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
   __ Add_d(sp, sp,
            Operand(BuiltinContinuationFrameConstants::kFixedFrameSizeFromFp));
   __ Pop(ra);
-  __ LoadEntryFromBuiltinIndex(t0);
+  __ LoadEntryFromBuiltinIndex(t0, t0);
   __ Jump(t0);
 }
 }  // namespace
@@ -1781,7 +1940,7 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
                                       DeoptimizationData::kOsrPcOffsetIndex) -
                                       kHeapObjectTag));
 
-  __ LoadCodeEntry(maybe_target_code, maybe_target_code);
+  __ LoadCodeInstructionStart(maybe_target_code, maybe_target_code);
 
   // Compute the target address = code_entry + osr_offset
   // <entry_addr> = <code_entry> + <osr_offset>
@@ -2106,11 +2265,21 @@ void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
     __ Branch(&done, eq, len, Operand(zero_reg));
     __ slli_d(scratch, len, kSystemPointerSizeLog2);
     __ Sub_d(scratch, sp, Operand(scratch));
-    __ LoadRoot(t1, RootIndex::kTheHoleValue);
+#if !V8_STATIC_ROOTS_BOOL
+    // We do not use the Branch(reg, RootIndex) macro without static roots,
+    // as it would do a LoadRoot behind the scenes and we want to avoid that
+    // in a loop.
+    __ LoadTaggedRoot(t1, RootIndex::kTheHoleValue);
+#endif  // !V8_STATIC_ROOTS_BOOL
     __ bind(&loop);
     __ LoadTaggedField(a5, MemOperand(src, 0));
     __ addi_d(src, src, kTaggedSize);
-    __ CompareTaggedAndBranch(&push, ne, a5, Operand(t1));
+#if V8_STATIC_ROOTS_BOOL
+    __ Branch(&push, ne, a5, RootIndex::kTheHoleValue);
+#else
+    __ slli_w(t0, a5, 0);
+    __ Branch(&push, ne, t0, Operand(t1));
+#endif
     __ LoadRoot(a5, RootIndex::kUndefinedValue);
     __ bind(&push);
     __ St_d(a5, MemOperand(a7, 0));
@@ -2242,11 +2411,9 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ LoadGlobalProxy(a3);
     } else {
       Label convert_to_object, convert_receiver;
-      __ LoadReceiver(a3, a0);
+      __ LoadReceiver(a3);
       __ JumpIfSmi(a3, &convert_to_object);
-      static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
-      __ GetObjectType(a3, a4, a4);
-      __ Branch(&done_convert, hs, a4, Operand(FIRST_JS_RECEIVER_TYPE));
+      __ JumpIfJSAnyIsNotPrimitive(a3, a4, &done_convert);
       if (mode != ConvertReceiverMode::kNotNullOrUndefined) {
         Label convert_global_proxy;
         __ JumpIfRoot(a3, RootIndex::kUndefinedValue, &convert_global_proxy);
@@ -2279,7 +2446,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
           a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset));
       __ bind(&convert_receiver);
     }
-    __ StoreReceiver(a3, a0, kScratchReg);
+    __ StoreReceiver(a3);
   }
   __ bind(&done_convert);
 
@@ -2307,7 +2474,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
   {
     __ LoadTaggedField(t0,
                        FieldMemOperand(a1, JSBoundFunction::kBoundThisOffset));
-    __ StoreReceiver(t0, a0, kScratchReg);
+    __ StoreReceiver(t0);
   }
 
   // Load [[BoundArguments]] into a2 and length of that into a4.
@@ -2376,12 +2543,11 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   //  -- a1 : the target to call (can be any Object).
   // -----------------------------------
 
-  Register argc = a0;
   Register target = a1;
   Register map = t1;
   Register instance_type = t2;
   Register scratch = t8;
-  DCHECK(!AreAliased(argc, target, map, instance_type, scratch));
+  DCHECK(!AreAliased(a0, target, map, instance_type, scratch));
 
   Label non_callable, class_constructor;
   __ JumpIfSmi(target, &non_callable);
@@ -2422,7 +2588,7 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   // 2. Call to something else, which might have a [[Call]] internal method (if
   // not we raise an exception).
   // Overwrite the original receiver with the (original) target.
-  __ StoreReceiver(target, argc, kScratchReg);
+  __ StoreReceiver(target);
   // Let the "call_as_function_delegate" take care of the rest.
   __ LoadNativeContextSlot(target, Context::CALL_AS_FUNCTION_DELEGATE_INDEX);
   __ Jump(masm->isolate()->builtins()->CallFunction(
@@ -2563,12 +2729,11 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   //          the JSFunction on which new was invoked initially)
   // -----------------------------------
 
-  Register argc = a0;
   Register target = a1;
   Register map = t1;
   Register instance_type = t2;
   Register scratch = t8;
-  DCHECK(!AreAliased(argc, target, map, instance_type, scratch));
+  DCHECK(!AreAliased(a0, target, map, instance_type, scratch));
 
   // Check if target is a Smi.
   Label non_constructor, non_proxy;
@@ -2604,7 +2769,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ bind(&non_proxy);
   {
     // Overwrite the original receiver with the (original) target.
-    __ StoreReceiver(target, argc, kScratchReg);
+    __ StoreReceiver(target);
     // Let the "call_as_constructor_delegate" take care of the rest.
     __ LoadNativeContextSlot(target,
                              Context::CALL_AS_CONSTRUCTOR_DELEGATE_INDEX);
@@ -2780,15 +2945,13 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
   __ Ret();
 }
 
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
-  __ Trap();
-}
-
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
   // TODO(v8:12191): Implement for this platform.
   __ Trap();
 }
 
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) { __ Trap(); }
+
 void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   // TODO(v8:12191): Implement for this platform.
   __ Trap();
@@ -2809,10 +2972,13 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
   __ Trap();
 }
 
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) { __ Trap(); }
+
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   // Called from JavaScript; parameters are on stack as if calling JS function
   // a0: number of arguments including receiver
   // a1: pointer to builtin function
@@ -3008,146 +3174,56 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ Ret();
 }
 
-namespace {
-
-int AddressOffset(ExternalReference ref0, ExternalReference ref1) {
-  int64_t offset = (ref0.address() - ref1.address());
-  DCHECK(static_cast<int>(offset) == offset);
-  return static_cast<int>(offset);
-}
-
-// Calls an API function.  Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.  Restores context.  stack_space
-// - space to be unwound on exit (includes the call JS arguments space and
-// the additional space allocated for the fast call).
-void CallApiFunctionAndReturn(MacroAssembler* masm, Register function_address,
-                              ExternalReference thunk_ref, int stack_space,
-                              MemOperand* stack_space_operand,
-                              MemOperand return_value_operand) {
-  Isolate* isolate = masm->isolate();
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  const int kNextOffset = 0;
-  const int kLimitOffset = AddressOffset(
-      ExternalReference::handle_scope_limit_address(isolate), next_address);
-  const int kLevelOffset = AddressOffset(
-      ExternalReference::handle_scope_level_address(isolate), next_address);
-
-  DCHECK(function_address == a1 || function_address == a2);
-
-  // Allocate HandleScope in callee-save registers.
-  __ li(s5, next_address);
-  __ Ld_d(s0, MemOperand(s5, kNextOffset));
-  __ Ld_d(s1, MemOperand(s5, kLimitOffset));
-  __ Ld_w(s2, MemOperand(s5, kLevelOffset));
-  __ Add_w(s2, s2, Operand(1));
-  __ St_w(s2, MemOperand(s5, kLevelOffset));
-
-  Label profiler_enabled, done_api_call;
-  __ Ld_b(t7, __ ExternalReferenceAsOperand(
-                  ExternalReference::is_profiling_address(isolate), t7));
-  __ Branch(&profiler_enabled, ne, t7, Operand(zero_reg));
-#ifdef V8_RUNTIME_CALL_STATS
-  __ li(t7, ExternalReference::address_of_runtime_stats_flag());
-  __ Ld_w(t7, MemOperand(t7, 0));
-  __ Branch(&profiler_enabled, ne, t7, Operand(zero_reg));
-#endif  // V8_RUNTIME_CALL_STATS
-
-  // Call the api function directly.
-  __ mov(t7, function_address);
-  __ StoreReturnAddressAndCall(t7);
-  __ bind(&done_api_call);
-
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-  Label return_value_loaded;
-
-  // Load value from ReturnValue.
-  __ Ld_d(a0, return_value_operand);
-  __ bind(&return_value_loaded);
-
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ St_d(s0, MemOperand(s5, kNextOffset));
-  if (v8_flags.debug_code) {
-    __ Ld_w(a1, MemOperand(s5, kLevelOffset));
-    __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall, a1,
-             Operand(s2));
-  }
-  __ Sub_w(s2, s2, Operand(1));
-  __ St_w(s2, MemOperand(s5, kLevelOffset));
-  __ Ld_d(kScratchReg, MemOperand(s5, kLimitOffset));
-  __ Branch(&delete_allocated_handles, ne, s1, Operand(kScratchReg));
-
-  // Leave the API exit frame.
-  __ bind(&leave_exit_frame);
-
-  if (stack_space_operand == nullptr) {
-    DCHECK_NE(stack_space, 0);
-    __ li(s0, Operand(stack_space));
-  } else {
-    DCHECK_EQ(stack_space, 0);
-    __ Ld_d(s0, *stack_space_operand);
-  }
-
-  static constexpr bool kRegisterContainsSlotCount = false;
-  __ LeaveExitFrame(s0, NO_EMIT_RETURN, kRegisterContainsSlotCount);
-
-  // Check if the function scheduled an exception.
-  __ LoadRoot(a4, RootIndex::kTheHoleValue);
-  __ li(kScratchReg, ExternalReference::scheduled_exception_address(isolate));
-  __ Ld_d(a5, MemOperand(kScratchReg, 0));
-  __ Branch(&promote_scheduled_exception, ne, a4, Operand(a5));
-
-  __ Ret();
-
-  // Call the api function via thunk wrapper.
-  __ bind(&profiler_enabled);
-  // Additional parameter is the address of the actual callback.
-  __ li(t7, thunk_ref);
-  __ StoreReturnAddressAndCall(t7);
-  __ Branch(&done_api_call);
-
-  // Re-throw by promoting a scheduled exception.
-  __ bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  __ bind(&delete_allocated_handles);
-  __ St_d(s1, MemOperand(s5, kLimitOffset));
-  __ mov(s0, a0);
-  __ PrepareCallCFunction(1, s1);
-  __ li(a0, ExternalReference::isolate_address(isolate));
-  __ CallCFunction(ExternalReference::delete_handle_scope_extensions(), 1);
-  __ mov(a0, s0);
-  __ jmp(&leave_exit_frame);
-}
-
-}  // namespace
-
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- cp                  : context
+  // CallApiCallbackMode::kGeneric mode:
+  //  -- a2                  : arguments count (not including the receiver)
+  //  -- a3                  : call handler info
+  //  -- a0                  : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
   //  -- a1                  : api function address
   //  -- a2                  : arguments count
   //  -- a3                  : call data
   //  -- a0                  : holder
+  // Both modes:
+  //  -- cp                  : context
   //  -- sp[0]               : receiver
   //  -- sp[8]               : first argument
   //  -- ...
   //  -- sp[(argc) * 8]      : last argument
   // -----------------------------------
 
-  Register api_function_address = a1;
-  Register argc = a2;
-  Register call_data = a3;
-  Register holder = a0;
-  Register scratch = t0;
-  Register base = t1;  // For addressing MemOperands on the stack.
+  Register function_callback_info_arg = arg_reg_1;
 
-  DCHECK(!AreAliased(api_function_address, argc, call_data, holder, scratch,
-                     base));
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register callback = no_reg;
+  Register holder = no_reg;
+  Register scratch = t0;
+  Register scratch2 = t1;
+  Register base = t2;  // For addressing MemOperands on the stack.
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = a1;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, holder, call_data, callback,
+                     scratch, scratch2, base));
 
   using FCA = FunctionCallbackArguments;
 
@@ -3155,19 +3231,21 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
   // Set up FunctionCallbackInfo's implicit_args on the stack as follows:
   //
   // Target state:
-  //   sp[0 * kSystemPointerSize]: kHolder
+  //   sp[0 * kSystemPointerSize]: kHolder   <= FCA::implicit_args_
   //   sp[1 * kSystemPointerSize]: kIsolate
-  //   sp[2 * kSystemPointerSize]: undefined (kReturnValueDefaultValue)
+  //   sp[2 * kSystemPointerSize]: undefined (padding, unused)
   //   sp[3 * kSystemPointerSize]: undefined (kReturnValue)
   //   sp[4 * kSystemPointerSize]: kData
   //   sp[5 * kSystemPointerSize]: undefined (kNewTarget)
+  // Existing state:
+  //   sp[6 * kSystemPointerSize]:           <= FCA:::values_
 
   // Set up the base register for addressing through MemOperands. It will point
   // at the receiver (located at sp + argc * kSystemPointerSize).
@@ -3177,101 +3255,189 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   __ Sub_d(sp, sp, Operand(FCA::kArgsLength * kSystemPointerSize));
 
   // kHolder.
-  __ St_d(holder, MemOperand(sp, 0 * kSystemPointerSize));
+  __ St_d(holder, MemOperand(sp, FCA::kHolderIndex * kSystemPointerSize));
 
   // kIsolate.
   __ li(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ St_d(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+  __ St_d(scratch, MemOperand(sp, FCA::kIsolateIndex * kSystemPointerSize));
+
+  // kUnused
+  __ St_d(zero_reg, MemOperand(sp, FCA::kUnusedIndex * kSystemPointerSize));
 
-  // kReturnValueDefaultValue and kReturnValue.
+  // kReturnValue
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ St_d(scratch, MemOperand(sp, 2 * kSystemPointerSize));
-  __ St_d(scratch, MemOperand(sp, 3 * kSystemPointerSize));
+  __ St_d(scratch, MemOperand(sp, FCA::kReturnValueIndex * kSystemPointerSize));
 
   // kData.
-  __ St_d(call_data, MemOperand(sp, 4 * kSystemPointerSize));
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ LoadTaggedField(
+          scratch2, FieldMemOperand(callback, CallHandlerInfo::kDataOffset));
+      __ St_d(scratch2, MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ St_d(call_data, MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+  }
 
   // kNewTarget.
-  __ St_d(scratch, MemOperand(sp, 5 * kSystemPointerSize));
+  __ St_d(scratch, MemOperand(sp, FCA::kNewTargetIndex * kSystemPointerSize));
 
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  __ mov(scratch, sp);
+  __ mov(holder, sp);
 
   // Allocate the v8::Arguments structure in the arguments' space since
   // it's not controlled by GC.
-  static constexpr int kApiStackSpace = 4;
+  static constexpr int kSlotsToDropOnStackSize = 1 * kSystemPointerSize;
+  static constexpr int kApiStackSpace =
+      (FCA::kSize + kSlotsToDropOnStackSize) / kSystemPointerSize;
+  static_assert(kApiStackSpace == 4);
+  static_assert(FCA::kImplicitArgsOffset == 0);
+  static_assert(FCA::kValuesOffset == 1 * kSystemPointerSize);
+  static_assert(FCA::kLengthOffset == 2 * kSystemPointerSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
+
   FrameScope frame_scope(masm, StackFrame::MANUAL);
-  __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+    __ AllocateStackSpace(exit_frame_params_count * kSystemPointerSize);
+
+    // No padding is required.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize == 0);
+
+    // Context parameter.
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ St_d(kContextRegister, MemOperand(sp, 2 * kSystemPointerSize));
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ SmiTag(scratch, argc);
+    __ St_d(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ LoadTaggedField(
+        scratch,
+        FieldMemOperand(callback, CallHandlerInfo::kOwnerTemplateOffset));
+    __ St_d(scratch, MemOperand(sp, 0 * kSystemPointerSize));
 
-  // EnterExitFrame may align the sp.
+    __ LoadExternalPointerField(
+        api_function_address,
+        FieldMemOperand(callback,
+                        CallHandlerInfo::kMaybeRedirectedCallbackOffset),
+        kCallHandlerInfoCallbackTag);
+
+    __ EnterExitFrame(kApiStackSpace, StackFrame::API_CALLBACK_EXIT);
+  } else {
+    __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  }
 
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  // Arguments are after the return address (pushed by EnterExitFrame()).
-  __ St_d(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    // Arguments are after the return address (pushed by EnterExitFrame()).
+    __ St_d(holder, ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset));
 
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  __ Add_d(scratch, scratch,
-           Operand((FCA::kArgsLength + 1) * kSystemPointerSize));
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ Add_d(holder, holder,
+             Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
 
-  __ St_d(scratch, MemOperand(sp, 2 * kSystemPointerSize));
+    __ St_d(holder, ExitFrameStackSlotOperand(FCA::kValuesOffset));
 
-  // FunctionCallbackInfo::length_.
-  // Stored as int field, 32-bit integers within struct on stack always left
-  // justified by n64 ABI.
-  __ St_w(argc, MemOperand(sp, 3 * kSystemPointerSize));
+    // FunctionCallbackInfo::length_.
+    // Stored as int field, 32-bit integers within struct on stack always left
+    // justified by n64 ABI.
+    __ St_w(argc, ExitFrameStackSlotOperand(FCA::kLengthOffset));
+  }
 
   // We also store the number of bytes to drop from the stack after returning
   // from the API function here.
   // Note: Unlike on other architectures, this stores the number of slots to
   // drop, not the number of bytes.
-  __ Add_d(scratch, argc, Operand(FCA::kArgsLength + 1 /* receiver */));
-  __ St_d(scratch, MemOperand(sp, 4 * kSystemPointerSize));
+  MemOperand stack_space_operand =
+      ExitFrameStackSlotOperand(FCA::kLengthOffset + kSlotsToDropOnStackSize);
+  __ Add_d(scratch, argc,
+           Operand(FCA::kArgsLengthWithReceiver + exit_frame_params_count));
+  __ St_d(scratch, stack_space_operand);
+
+  __ RecordComment("v8::FunctionCallback's argument.");
+  // function_callback_info_arg = v8::FunctionCallbackInfo&
+  __ Add_d(function_callback_info_arg, sp, Operand(1 * kSystemPointerSize));
 
-  // v8::InvocationCallback's argument.
-  DCHECK(!AreAliased(api_function_address, scratch, a0));
-  __ Add_d(a0, sp, Operand(1 * kSystemPointerSize));
+  DCHECK(
+      !AreAliased(api_function_address, scratch, function_callback_info_arg));
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
 
-  // There are two stack slots above the arguments we constructed on the stack.
-  // TODO(jgruber): Document what these arguments are.
-  static constexpr int kStackSlotsAboveFCA = 2;
-  MemOperand return_value_operand(
-      fp, (kStackSlotsAboveFCA + FCA::kReturnValueIndex) * kSystemPointerSize);
+  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
 
   static constexpr int kUseStackSpaceOperand = 0;
-  MemOperand stack_space_operand(sp, 4 * kSystemPointerSize);
 
-  AllowExternalCallThatCantCauseGC scope(masm);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kUseStackSpaceOperand, &stack_space_operand,
-                           return_value_operand);
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseStackSpaceOperand,
+                           &stack_space_operand, return_value_operand);
 }
 
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- cp                  : context
+  //  -- a1                  : receiver
+  //  -- a3                  : accessor info
+  //  -- a0                  : holder
+  // -----------------------------------
+  //
   // Build v8::PropertyCallbackInfo::args_ array on the stack and push property
   // name below the exit frame to make GC aware of them.
-  static_assert(PropertyCallbackArguments::kShouldThrowOnErrorIndex == 0);
-  static_assert(PropertyCallbackArguments::kHolderIndex == 1);
-  static_assert(PropertyCallbackArguments::kIsolateIndex == 2);
-  static_assert(PropertyCallbackArguments::kReturnValueDefaultValueIndex == 3);
-  static_assert(PropertyCallbackArguments::kReturnValueIndex == 4);
-  static_assert(PropertyCallbackArguments::kDataIndex == 5);
-  static_assert(PropertyCallbackArguments::kThisIndex == 6);
-  static_assert(PropertyCallbackArguments::kArgsLength == 7);
+  using PCI = PropertyCallbackInfo<v8::Value>;
+  using PCA = PropertyCallbackArguments;
+  static_assert(PCA::kShouldThrowOnErrorIndex == 0);
+  static_assert(PCA::kHolderIndex == 1);
+  static_assert(PCA::kIsolateIndex == 2);
+  static_assert(PCA::kUnusedIndex == 3);
+  static_assert(PCA::kReturnValueIndex == 4);
+  static_assert(PCA::kDataIndex == 5);
+  static_assert(PCA::kThisIndex == 6);
+  static_assert(PCA::kArgsLength == 7);
+
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  // Target state:
+  //   sp[0 * kSystemPointerSize]: name
+  //   sp[1 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   sp[2 * kSystemPointerSize]: kHolderIndex
+  //   sp[3 * kSystemPointerSize]: kIsolateIndex
+  //   sp[4 * kSystemPointerSize]: kUnusedIndex
+  //   sp[5 * kSystemPointerSize]: kReturnValueIndex
+  //   sp[6 * kSystemPointerSize]: kDataIndex
+  //   sp[7 * kSystemPointerSize]: kThisIndex / receiver
+
+  Register name_arg = arg_reg_1;
+  Register property_callback_info_arg = arg_reg_2;
 
+  Register api_function_address = a2;
   Register receiver = ApiGetterDescriptor::ReceiverRegister();
   Register holder = ApiGetterDescriptor::HolderRegister();
   Register callback = ApiGetterDescriptor::CallbackRegister();
   Register scratch = a4;
   DCHECK(!AreAliased(receiver, holder, callback, scratch));
 
-  Register api_function_address = a2;
-
   // Here and below +1 is for name() pushed after the args_ array.
-  using PCA = PropertyCallbackArguments;
   __ Sub_d(sp, sp, (PCA::kArgsLength + 1) * kSystemPointerSize);
   __ St_d(receiver, MemOperand(sp, (PCA::kThisIndex + 1) * kSystemPointerSize));
   __ LoadTaggedField(scratch,
@@ -3280,8 +3446,8 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
   __ St_d(scratch,
           MemOperand(sp, (PCA::kReturnValueIndex + 1) * kSystemPointerSize));
-  __ St_d(scratch, MemOperand(sp, (PCA::kReturnValueDefaultValueIndex + 1) *
-                                      kSystemPointerSize));
+  __ St_d(zero_reg,
+          MemOperand(sp, (PCA::kUnusedIndex + 1) * kSystemPointerSize));
   __ li(scratch, ExternalReference::isolate_address(masm->isolate()));
   __ St_d(scratch,
           MemOperand(sp, (PCA::kIsolateIndex + 1) * kSystemPointerSize));
@@ -3295,37 +3461,55 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
   __ St_d(scratch, MemOperand(sp, 0 * kSystemPointerSize));
 
   // v8::PropertyCallbackInfo::args_ array and name handle.
-  const int kStackUnwindSpace = PropertyCallbackArguments::kArgsLength + 1;
-
-  // Load address of v8::PropertyAccessorInfo::args_ array and name handle.
-  __ mov(a0, sp);                               // a0 = Handle<Name>
-  __ Add_d(a1, a0, Operand(1 * kSystemPointerSize));  // a1 = v8::PCI::args_
+  static constexpr int kPaddingOnStackSlots = 0;
+  static constexpr int kNameOnStackSlots = 1;
+  static constexpr int kNameStackIndex = kPaddingOnStackSlots;
+  static constexpr int kPCAStackIndex =
+      kNameOnStackSlots + kPaddingOnStackSlots;
+  static constexpr int kStackUnwindSpace = PCA::kArgsLength + kPCAStackIndex;
+
+  __ RecordComment(
+      "Load address of v8::PropertyAccessorInfo::args_ array and name handle.");
+  // name_arg = Handle<Name>(&name), name value was pushed to GC-ed stack space.
+  __ Add_d(name_arg, sp, Operand(kNameStackIndex * kSystemPointerSize));
+  // property_callback_info_arg = v8::PCI::args_ (= &ShouldThrow)
+  __ Add_d(property_callback_info_arg, sp,
+           Operand(kPCAStackIndex * kSystemPointerSize));
 
   const int kApiStackSpace = 1;
+  static_assert(kApiStackSpace * kSystemPointerSize == sizeof(PCI));
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
 
-  // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // it's args_ field.
-  __ St_d(a1, MemOperand(sp, 1 * kSystemPointerSize));
-  __ Add_d(a1, sp, Operand(1 * kSystemPointerSize));
-  // a1 = v8::PropertyCallbackInfo&
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
+  // Initialize v8::PropertyCallbackInfo::args_ field.
+  __ St_d(property_callback_info_arg, MemOperand(sp, 1 * kSystemPointerSize));
+  // property_callback_info_arg = v8::PropertyCallbackInfo&
+  __ Add_d(property_callback_info_arg, sp, Operand(1 * kSystemPointerSize));
+
+  __ RecordComment("Load api_function_address");
+  __ LoadExternalPointerField(
+      api_function_address,
+      FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset),
+      kAccessorInfoGetterTag);
+
+  DCHECK(
+      !AreAliased(api_function_address, property_callback_info_arg, name_arg));
 
   ExternalReference thunk_ref =
       ExternalReference::invoke_accessor_getter_callback();
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
 
-  __ Ld_d(
-      api_function_address,
-      FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset));
-
-  // +3 is to skip prolog, return address and name handle.
-  MemOperand return_value_operand(
-      fp,
-      (PropertyCallbackArguments::kReturnValueIndex + 3) * kSystemPointerSize);
+  MemOperand return_value_operand =
+      ExitFrameCallerStackSlotOperand(PCA::kReturnValueIndex + kPCAStackIndex);
   MemOperand* const kUseStackSpaceConstant = nullptr;
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           return_value_operand);
+
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
@@ -3578,6 +3762,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+
+  if (is_osr) {
+    ResetSharedFunctionInfoAge(masm, code_obj);
+  }
+
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(code_obj, SharedFunctionInfo::kFunctionDataOffset));
@@ -3586,8 +3775,7 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   // always have baseline code.
   if (!is_osr) {
     Label start_with_baseline;
-    __ GetObjectType(code_obj, t2, t2);
-    __ Branch(&start_with_baseline, eq, t2, Operand(CODE_TYPE));
+    __ JumpIfObjectType(&start_with_baseline, eq, code_obj, CODE_TYPE, t2);
 
     // Start with bytecode as there is no baseline code.
     Builtin builtin_id = next_bytecode
@@ -3611,14 +3799,15 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register feedback_vector = a2;
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
   // allocate it.
-  __ GetObjectType(feedback_vector, t2, t2);
-  __ Branch(&install_baseline_code, ne, t2, Operand(FEEDBACK_VECTOR_TYPE));
+  __ JumpIfObjectType(&install_baseline_code, ne, feedback_vector,
+                      FEEDBACK_VECTOR_TYPE, t2);
 
   // Save BytecodeOffset from the stack frame.
   __ SmiUntag(kInterpreterBytecodeOffsetRegister,
@@ -3664,9 +3853,6 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   // Save the accumulator register, since it's clobbered by the below call.
   __ Push(kInterpreterAccumulatorRegister);
   {
-    Register arg_reg_1 = a0;
-    Register arg_reg_2 = a1;
-    Register arg_reg_3 = a2;
     __ Move(arg_reg_1, code_obj);
     __ Move(arg_reg_2, kInterpreterBytecodeOffsetRegister);
     __ Move(arg_reg_3, kInterpreterBytecodeArrayRegister);
@@ -3674,7 +3860,7 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     __ PrepareCallCFunction(3, 0, a4);
     __ CallCFunction(get_baseline_pc, 3, 0);
   }
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ Add_d(code_obj, code_obj, kReturnRegister0);
   __ Pop(kInterpreterAccumulatorRegister);
 
@@ -3682,7 +3868,6 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     // TODO(liuyu): Remove Ld as arm64 after register reallocation.
     __ Ld_d(kInterpreterBytecodeArrayRegister,
             MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp));
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
     Generate_OSREntry(masm, code_obj);
   } else {
     __ Jump(code_obj);
diff --git a/deps/v8/src/builtins/map-groupby.tq b/deps/v8/src/builtins/map-groupby.tq
new file mode 100644
index 00000000000000..c5cb844d8500c7
--- /dev/null
+++ b/deps/v8/src/builtins/map-groupby.tq
@@ -0,0 +1,37 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+transitioning javascript builtin MapGroupBy(
+    js-implicit context: NativeContext, receiver: JSAny)(items: JSAny,
+    callback: JSAny): JSAny {
+  // 1. Let groups be ? GroupBy(items, callbackfn, zero).
+  const groups: OrderedHashMap =
+      GroupByImpl(items, callback, /* coerceToProperty */ False, 'Map.groupBy');
+
+  // 2. Let map be ! Construct(%Map%).
+  // 3. For each Record { [[Key]], [[Elements]] } g of groups, do
+  //   a. Let elements be CreateArrayFromList(g.[[Elements]]).
+  //   b. Let entry be the Record { [[Key]]: g.[[Key]], [[Value]]: elements }.
+  //   c. Append entry to map.[[MapData]].
+
+  // TODO(v8:12499): Determine more specific elements map if worth it.
+  try {
+    let iter = collections::NewUnmodifiedOrderedHashMapIterator(groups);
+    const arrayMap = GetFastPackedElementsJSArrayMap();
+    while (true) {
+      const entry = iter.Next() otherwise Done;
+      const elements = ArrayListElements(UnsafeCast<ArrayList>(entry.value));
+      const array = NewJSArray(arrayMap, elements);
+      iter.UnsafeStoreValueAtCurrentEntry(array);
+    }
+  } label Done {}
+
+  // 4. Return map.
+  return new JSMap{
+    map: *NativeContextSlot(ContextSlot::JS_MAP_MAP_INDEX),
+    properties_or_hash: kEmptyFixedArray,
+    elements: kEmptyFixedArray,
+    table: groups
+  };
+}
diff --git a/deps/v8/src/builtins/math.tq b/deps/v8/src/builtins/math.tq
index b3d2aafb56f269..5a64d533517ee3 100644
--- a/deps/v8/src/builtins/math.tq
+++ b/deps/v8/src/builtins/math.tq
@@ -33,8 +33,8 @@ extern macro Float64Abs(float64): float64;
 const kSmiMaxValuePlusOne:
     constexpr float64 generates '0.0 - kSmiMinValue';
 
-transitioning javascript builtin
-MathAbs(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathAbs(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   try {
     ReduceToSmiOrFloat64(x) otherwise SmiResult, Float64Result;
   } label SmiResult(s: Smi) {
@@ -61,8 +61,8 @@ MathAbs(js-implicit context: NativeContext)(x: JSAny): Number {
 
 // ES6 #sec-math.ceil
 extern macro Float64Ceil(float64): float64;
-transitioning javascript builtin
-MathCeil(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathCeil(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   try {
     ReduceToSmiOrFloat64(x) otherwise SmiResult, Float64Result;
   } label SmiResult(s: Smi) {
@@ -74,8 +74,8 @@ MathCeil(js-implicit context: NativeContext)(x: JSAny): Number {
 
 // ES6 #sec-math.floor
 extern macro Float64Floor(float64): float64;
-transitioning javascript builtin
-MathFloor(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathFloor(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   try {
     ReduceToSmiOrFloat64(x) otherwise SmiResult, Float64Result;
   } label SmiResult(s: Smi) {
@@ -87,8 +87,8 @@ MathFloor(js-implicit context: NativeContext)(x: JSAny): Number {
 
 // ES6 #sec-math.round
 extern macro Float64Round(float64): float64;
-transitioning javascript builtin
-MathRound(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathRound(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   try {
     ReduceToSmiOrFloat64(x) otherwise SmiResult, Float64Result;
   } label SmiResult(s: Smi) {
@@ -100,8 +100,8 @@ MathRound(js-implicit context: NativeContext)(x: JSAny): Number {
 
 // ES6 #sec-math.trunc
 extern macro Float64Trunc(float64): float64;
-transitioning javascript builtin
-MathTrunc(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathTrunc(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   try {
     ReduceToSmiOrFloat64(x) otherwise SmiResult, Float64Result;
   } label SmiResult(s: Smi) {
@@ -113,7 +113,8 @@ MathTrunc(js-implicit context: NativeContext)(x: JSAny): Number {
 
 // ES6 #sec-math.pow
 extern macro Float64Pow(float64, float64): float64;
-extern macro TruncateTaggedToFloat64(implicit context: Context)(JSAny): float64;
+extern macro TruncateTaggedToFloat64(implicit context: Context)(JSAny):
+    float64;
 
 @export
 macro MathPowImpl(implicit context: Context)(base: JSAny, exponent: JSAny):
@@ -124,16 +125,15 @@ macro MathPowImpl(implicit context: Context)(base: JSAny, exponent: JSAny):
   return Convert<Number>(result);
 }
 
-transitioning javascript builtin
-MathPow(js-implicit context: NativeContext)(
-    base: JSAny, exponent: JSAny): Number {
+transitioning javascript builtin MathPow(
+    js-implicit context: NativeContext)(base: JSAny, exponent: JSAny): Number {
   return MathPowImpl(base, exponent);
 }
 
 // ES6 #sec-math.max
 extern macro Float64Max(float64, float64): float64;
-transitioning javascript builtin
-MathMax(js-implicit context: NativeContext)(...arguments): Number {
+transitioning javascript builtin MathMax(
+    js-implicit context: NativeContext)(...arguments): Number {
   let result: float64 = MINUS_V8_INFINITY;
   const argCount = arguments.length;
   for (let i: intptr = 0; i < argCount; i++) {
@@ -145,8 +145,8 @@ MathMax(js-implicit context: NativeContext)(...arguments): Number {
 
 // ES6 #sec-math.min
 extern macro Float64Min(float64, float64): float64;
-transitioning javascript builtin
-MathMin(js-implicit context: NativeContext)(...arguments): Number {
+transitioning javascript builtin MathMin(
+    js-implicit context: NativeContext)(...arguments): Number {
   let result: float64 = V8_INFINITY;
   const argCount = arguments.length;
   for (let i: intptr = 0; i < argCount; i++) {
@@ -159,8 +159,8 @@ MathMin(js-implicit context: NativeContext)(...arguments): Number {
 // ES6 #sec-math.acos
 extern macro Float64Acos(float64): float64;
 
-transitioning javascript builtin
-MathAcos(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathAcos(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Acos(value));
 }
@@ -168,8 +168,8 @@ MathAcos(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.acosh
 extern macro Float64Acosh(float64): float64;
 
-transitioning javascript builtin
-MathAcosh(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathAcosh(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Acosh(value));
 }
@@ -177,8 +177,8 @@ MathAcosh(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.asin
 extern macro Float64Asin(float64): float64;
 
-transitioning javascript builtin
-MathAsin(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathAsin(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Asin(value));
 }
@@ -186,8 +186,8 @@ MathAsin(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.asinh
 extern macro Float64Asinh(float64): float64;
 
-transitioning javascript builtin
-MathAsinh(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathAsinh(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Asinh(value));
 }
@@ -195,8 +195,8 @@ MathAsinh(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.atan
 extern macro Float64Atan(float64): float64;
 
-transitioning javascript builtin
-MathAtan(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathAtan(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Atan(value));
 }
@@ -204,8 +204,8 @@ MathAtan(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.atan2
 extern macro Float64Atan2(float64, float64): float64;
 
-transitioning javascript builtin
-MathAtan2(js-implicit context: NativeContext)(y: JSAny, x: JSAny): Number {
+transitioning javascript builtin MathAtan2(
+    js-implicit context: NativeContext)(y: JSAny, x: JSAny): Number {
   const yValue = Convert<float64>(ToNumber_Inline(y));
   const xValue = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Atan2(yValue, xValue));
@@ -214,8 +214,8 @@ MathAtan2(js-implicit context: NativeContext)(y: JSAny, x: JSAny): Number {
 // ES6 #sec-math.atanh
 extern macro Float64Atanh(float64): float64;
 
-transitioning javascript builtin
-MathAtanh(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathAtanh(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Atanh(value));
 }
@@ -223,8 +223,8 @@ MathAtanh(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.cbrt
 extern macro Float64Cbrt(float64): float64;
 
-transitioning javascript builtin
-MathCbrt(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathCbrt(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Cbrt(value));
 }
@@ -232,8 +232,8 @@ MathCbrt(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.clz32
 extern macro Word32Clz(int32): int32;
 
-transitioning javascript builtin
-MathClz32(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathClz32(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value: int32 = Convert<int32>(ToNumber_Inline(x));
   return Convert<Number>(Word32Clz(value));
 }
@@ -241,8 +241,8 @@ MathClz32(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.cos
 extern macro Float64Cos(float64): float64;
 
-transitioning javascript builtin
-MathCos(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathCos(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Cos(value));
 }
@@ -250,8 +250,8 @@ MathCos(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.cosh
 extern macro Float64Cosh(float64): float64;
 
-transitioning javascript builtin
-MathCosh(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathCosh(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Cosh(value));
 }
@@ -259,8 +259,8 @@ MathCosh(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.exp
 extern macro Float64Exp(float64): float64;
 
-transitioning javascript builtin
-MathExp(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathExp(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Exp(value));
 }
@@ -268,23 +268,23 @@ MathExp(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.expm1
 extern macro Float64Expm1(float64): float64;
 
-transitioning javascript builtin
-MathExpm1(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathExpm1(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Expm1(value));
 }
 
 // ES6 #sec-math.fround
-transitioning javascript builtin
-MathFround(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathFround(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const x32 = Convert<float32>(ToNumber_Inline(x));
   const x64 = Convert<float64>(x32);
   return Convert<Number>(x64);
 }
 
 // ES6 #sec-math.imul
-transitioning javascript builtin
-MathImul(js-implicit context: NativeContext)(x: JSAny, y: JSAny): Number {
+transitioning javascript builtin MathImul(
+    js-implicit context: NativeContext)(x: JSAny, y: JSAny): Number {
   const x = Convert<int32>(ToNumber_Inline(x));
   const y = Convert<int32>(ToNumber_Inline(y));
   return Convert<Number>(x * y);
@@ -293,8 +293,8 @@ MathImul(js-implicit context: NativeContext)(x: JSAny, y: JSAny): Number {
 // ES6 #sec-math.log
 extern macro Float64Log(float64): float64;
 
-transitioning javascript builtin
-MathLog(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathLog(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Log(value));
 }
@@ -302,8 +302,8 @@ MathLog(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.log1p
 extern macro Float64Log1p(float64): float64;
 
-transitioning javascript builtin
-MathLog1p(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathLog1p(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Log1p(value));
 }
@@ -311,8 +311,8 @@ MathLog1p(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.log10
 extern macro Float64Log10(float64): float64;
 
-transitioning javascript builtin
-MathLog10(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathLog10(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Log10(value));
 }
@@ -320,8 +320,8 @@ MathLog10(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.log2
 extern macro Float64Log2(float64): float64;
 
-transitioning javascript builtin
-MathLog2(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathLog2(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Log2(value));
 }
@@ -329,15 +329,15 @@ MathLog2(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.sin
 extern macro Float64Sin(float64): float64;
 
-transitioning javascript builtin
-MathSin(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathSin(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Sin(value));
 }
 
 // ES6 #sec-math.sign
-transitioning javascript builtin
-MathSign(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathSign(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const num = ToNumber_Inline(x);
   const value = Convert<float64>(num);
 
@@ -353,8 +353,8 @@ MathSign(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.sinh
 extern macro Float64Sinh(float64): float64;
 
-transitioning javascript builtin
-MathSinh(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathSinh(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Sinh(value));
 }
@@ -362,8 +362,8 @@ MathSinh(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.sqrt
 extern macro Float64Sqrt(float64): float64;
 
-transitioning javascript builtin
-MathSqrt(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathSqrt(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Sqrt(value));
 }
@@ -371,8 +371,8 @@ MathSqrt(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.tan
 extern macro Float64Tan(float64): float64;
 
-transitioning javascript builtin
-MathTan(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathTan(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Tan(value));
 }
@@ -380,16 +380,16 @@ MathTan(js-implicit context: NativeContext)(x: JSAny): Number {
 // ES6 #sec-math.tanh
 extern macro Float64Tanh(float64): float64;
 
-transitioning javascript builtin
-MathTanh(js-implicit context: NativeContext)(x: JSAny): Number {
+transitioning javascript builtin MathTanh(
+    js-implicit context: NativeContext)(x: JSAny): Number {
   const value = Convert<float64>(ToNumber_Inline(x));
   return Convert<Number>(Float64Tanh(value));
 }
 
 // ES6 #sec-math.hypot
-transitioning javascript builtin
-MathHypot(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): Number {
+transitioning javascript builtin MathHypot(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): Number {
   const length = arguments.length;
   if (length == 0) {
     return 0;
@@ -435,8 +435,8 @@ MathHypot(
 // ES6 #sec-math.random
 extern macro RefillMathRandom(NativeContext): Smi;
 
-transitioning javascript builtin
-MathRandom(js-implicit context: NativeContext, receiver: JSAny)(): Number {
+transitioning javascript builtin MathRandom(
+    js-implicit context: NativeContext, receiver: JSAny)(): Number {
   let smiIndex: Smi = *NativeContextSlot(ContextSlot::MATH_RANDOM_INDEX_INDEX);
   if (smiIndex == 0) {
     // refill math random.
diff --git a/deps/v8/src/builtins/mips64/builtins-mips64.cc b/deps/v8/src/builtins/mips64/builtins-mips64.cc
index 25043609ce62a3..81e01e09e9047d 100644
--- a/deps/v8/src/builtins/mips64/builtins-mips64.cc
+++ b/deps/v8/src/builtins/mips64/builtins-mips64.cc
@@ -142,11 +142,11 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   __ Push(a3);
 
   // ----------- S t a t e -------------
-  //  --        sp[0*kPointerSize]: new target
-  //  --        sp[1*kPointerSize]: padding
-  //  -- a1 and sp[2*kPointerSize]: constructor function
-  //  --        sp[3*kPointerSize]: number of arguments (tagged)
-  //  --        sp[4*kPointerSize]: context
+  //  --        sp[0*kSystemPointerSize]: new target
+  //  --        sp[1*kSystemPointerSize]: padding
+  //  -- a1 and sp[2*kSystemPointerSize]: constructor function
+  //  --        sp[3*kSystemPointerSize]: number of arguments (tagged)
+  //  --        sp[4*kSystemPointerSize]: context
   // -----------------------------------
 
   __ Ld(t2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset));
@@ -168,11 +168,11 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
 
   // ----------- S t a t e -------------
   //  --                          v0: receiver
-  //  -- Slot 4 / sp[0*kPointerSize]: new target
-  //  -- Slot 3 / sp[1*kPointerSize]: padding
-  //  -- Slot 2 / sp[2*kPointerSize]: constructor function
-  //  -- Slot 1 / sp[3*kPointerSize]: number of arguments (tagged)
-  //  -- Slot 0 / sp[4*kPointerSize]: context
+  //  -- Slot 4 / sp[0*kSystemPointerSize]: new target
+  //  -- Slot 3 / sp[1*kSystemPointerSize]: padding
+  //  -- Slot 2 / sp[2*kSystemPointerSize]: constructor function
+  //  -- Slot 1 / sp[3*kSystemPointerSize]: number of arguments (tagged)
+  //  -- Slot 0 / sp[4*kSystemPointerSize]: context
   // -----------------------------------
   // Deoptimizer enters here.
   masm->isolate()->heap()->SetConstructStubCreateDeoptPCOffset(
@@ -197,12 +197,12 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
 
   // ----------- S t a t e -------------
   //  --                 a3: new target
-  //  -- sp[0*kPointerSize]: implicit receiver
-  //  -- sp[1*kPointerSize]: implicit receiver
-  //  -- sp[2*kPointerSize]: padding
-  //  -- sp[3*kPointerSize]: constructor function
-  //  -- sp[4*kPointerSize]: number of arguments (tagged)
-  //  -- sp[5*kPointerSize]: context
+  //  -- sp[0*kSystemPointerSize]: implicit receiver
+  //  -- sp[1*kSystemPointerSize]: implicit receiver
+  //  -- sp[2*kSystemPointerSize]: padding
+  //  -- sp[3*kSystemPointerSize]: constructor function
+  //  -- sp[4*kSystemPointerSize]: number of arguments (tagged)
+  //  -- sp[5*kSystemPointerSize]: context
   // -----------------------------------
 
   // Restore constructor function and argument count.
@@ -230,19 +230,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   // Call the function.
   __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
 
-  // ----------- S t a t e -------------
-  //  --                 v0: constructor result
-  //  -- sp[0*kPointerSize]: implicit receiver
-  //  -- sp[1*kPointerSize]: padding
-  //  -- sp[2*kPointerSize]: constructor function
-  //  -- sp[3*kPointerSize]: number of arguments
-  //  -- sp[4*kPointerSize]: context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -257,7 +244,7 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   // Throw away the result of the constructor invocation and use the
   // on-stack receiver as the result.
   __ bind(&use_receiver);
-  __ Ld(v0, MemOperand(sp, 0 * kPointerSize));
+  __ Ld(v0, MemOperand(sp, 0 * kSystemPointerSize));
   __ JumpIfRoot(v0, RootIndex::kTheHoleValue, &do_throw);
 
   __ bind(&leave_and_return);
@@ -401,7 +388,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     __ bind(&loop);
     __ Dsubu(a3, a3, Operand(1));
     __ Branch(&done_loop, lt, a3, Operand(zero_reg));
-    __ Dlsa(kScratchReg, t1, a3, kPointerSizeLog2);
+    __ Dlsa(kScratchReg, t1, a3, kSystemPointerSizeLog2);
     __ Ld(kScratchReg, FieldMemOperand(kScratchReg, FixedArray::kHeaderSize));
     __ Push(kScratchReg);
     __ Branch(&loop);
@@ -433,9 +420,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     // undefined because generator functions are non-constructable.
     __ Move(a3, a1);
     __ Move(a1, a4);
-    static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-    __ Ld(a2, FieldMemOperand(a1, JSFunction::kCodeOffset));
-    __ JumpCodeObject(a2);
+    __ JumpJSFunction(a1);
   }
 
   __ bind(&prepare_step_in_if_stepping);
@@ -486,7 +471,7 @@ static void Generate_CheckStackOverflow(MacroAssembler* masm, Register argc,
   // here which will cause r2 to become negative.
   __ dsubu(scratch1, sp, scratch1);
   // Check if the arguments will overflow the stack.
-  __ dsll(scratch2, argc, kPointerSizeLog2);
+  __ dsll(scratch2, argc, kSystemPointerSizeLog2);
   __ Branch(&okay, gt, scratch1, Operand(scratch2));  // Signed comparison.
 
   // Out of stack space.
@@ -797,7 +782,7 @@ static void LeaveInterpreterFrame(MacroAssembler* masm, Register scratch1,
   // Compute the size of the actual parameters + receiver (in bytes).
   __ Ld(actual_params_size,
         MemOperand(fp, StandardFrameConstants::kArgCOffset));
-  __ dsll(actual_params_size, actual_params_size, kPointerSizeLog2);
+  __ dsll(actual_params_size, actual_params_size, kSystemPointerSizeLog2);
 
   // If actual is bigger than formal, then we should use it to free up the stack
   // arguments.
@@ -891,9 +876,16 @@ static void AdvanceBytecodeOffsetOrReturn(MacroAssembler* masm,
 }
 
 namespace {
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array) {
-  __ Sh(zero_reg,
-        FieldMemOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset));
+
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi) {
+  __ Sh(zero_reg, FieldMemOperand(sfi, SharedFunctionInfo::kAgeOffset));
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function,
+                        Register scratch) {
+  __ Ld(scratch,
+        FieldMemOperand(js_function, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, scratch);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
@@ -901,8 +893,7 @@ void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
   DCHECK(!AreAliased(feedback_vector, scratch));
   __ Lbu(scratch,
          FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
-  __ And(scratch, scratch,
-         Operand(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ And(scratch, scratch, Operand(~FeedbackVector::OsrUrgencyBits::kMask));
   __ Sb(scratch,
         FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
 }
@@ -920,7 +911,8 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   Register feedback_vector = temps.Acquire();
   __ Ld(feedback_vector,
         FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ Ld(feedback_vector, FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ Ld(feedback_vector,
+        FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
   {
     UseScratchRegisterScope temps(masm);
     Register scratch = temps.Acquire();
@@ -964,6 +956,10 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
         BaselineOutOfLinePrologueDescriptor::kCalleeContext);
     Register callee_js_function = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kClosure);
+    {
+      UseScratchRegisterScope temps(masm);
+      ResetJSFunctionAge(masm, callee_js_function, temps.Acquire());
+    }
     __ Push(callee_context, callee_js_function);
     DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
     DCHECK_EQ(callee_js_function, kJSFunctionRegister);
@@ -974,7 +970,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // the frame, so load it into a register.
     Register bytecode_array = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray);
-    ResetBytecodeAge(masm, bytecode_array);
     __ Push(argc, bytecode_array);
 
     // Baseline code frames store the feedback vector where interpreter would
@@ -1087,6 +1082,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // kInterpreterBytecodeArrayRegister.
   __ Ld(kScratchReg,
         FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, kScratchReg);
   __ Ld(kInterpreterBytecodeArrayRegister,
         FieldMemOperand(kScratchReg, SharedFunctionInfo::kFunctionDataOffset));
   Label is_baseline;
@@ -1104,7 +1100,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   Register feedback_vector = a2;
   __ Ld(feedback_vector,
         FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ Ld(feedback_vector, FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ Ld(feedback_vector,
+        FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label push_stack_frame;
   // Check if feedback vector is valid. If valid, check for optimized code
@@ -1148,8 +1145,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ PushStandardFrame(closure);
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
-
   // Load initial bytecode offset.
   __ li(kInterpreterBytecodeOffsetRegister,
         Operand(BytecodeArray::kHeaderSize - kHeapObjectTag));
@@ -1180,7 +1175,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ push(kInterpreterAccumulatorRegister);
     // Continue loop if not done.
     __ bind(&loop_check);
-    __ Dsubu(a4, a4, Operand(kPointerSize));
+    __ Dsubu(a4, a4, Operand(kSystemPointerSize));
     __ Branch(&loop_header, ge, a4, Operand(zero_reg));
   }
 
@@ -1192,7 +1187,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
                 BytecodeArray::kIncomingNewTargetOrGeneratorRegisterOffset));
   __ Branch(&no_incoming_new_target_or_generator_register, eq, a5,
             Operand(zero_reg));
-  __ Dlsa(a5, fp, a5, kPointerSizeLog2);
+  __ Dlsa(a5, fp, a5, kSystemPointerSizeLog2);
   __ Sd(a3, MemOperand(a5));
   __ bind(&no_incoming_new_target_or_generator_register);
 
@@ -1214,7 +1209,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   __ Daddu(a0, kInterpreterBytecodeArrayRegister,
            kInterpreterBytecodeOffsetRegister);
   __ Lbu(a7, MemOperand(a0));
-  __ Dlsa(kScratchReg, kInterpreterDispatchTableRegister, a7, kPointerSizeLog2);
+  __ Dlsa(kScratchReg, kInterpreterDispatchTableRegister, a7,
+          kSystemPointerSizeLog2);
   __ Ld(kJavaScriptCallCodeStartRegister, MemOperand(kScratchReg));
   __ Call(kJavaScriptCallCodeStartRegister);
 
@@ -1289,7 +1285,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ Ld(feedback_vector,
           FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
     __ Ld(feedback_vector,
-          FieldMemOperand(feedback_vector, Cell::kValueOffset));
+          FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1329,7 +1325,7 @@ static void GenerateInterpreterPushArgs(MacroAssembler* masm, Register num_args,
                                         Register scratch, Register scratch2) {
   // Find the address of the last argument.
   __ Dsubu(scratch, num_args, Operand(1));
-  __ dsll(scratch, scratch, kPointerSizeLog2);
+  __ dsll(scratch, scratch, kSystemPointerSizeLog2);
   __ Dsubu(start_address, start_address, scratch);
 
   // Push the arguments.
@@ -1454,11 +1450,175 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   }
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- a0 : the number of arguments
+  // -- a1 : constructor to call (checked to be a JSFunction)
+  // -- a3 : new target
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Save live registers.
+  __ SmiTag(a0);
+  __ Push(a0, a1, a3);
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  __ Pop(a0, a1, a3);
+  __ SmiUntag(a0);
+
+  // Patch implicit receiver (in arguments)
+  __ StoreReceiver(v0);
+  // Patch second implicit (in construct frame)
+  __ Sd(v0,
+        MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+
+  // Restore context.
+  __ Ld(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- a0 : argument count
+  // -- a1 : constructor to call (checked to be a JSFunction)
+  // -- a3 : new target
+  // -- a4 : address of the first argument
+  // -- cp : context pointer
+  // -----------------------------------
+  __ AssertFunction(a1);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  __ LoadMap(a2, a1);
+  __ Lbu(a2, FieldMemOperand(a2, Map::kBitFieldOffset));
+  __ And(a2, a2, Operand(Map::Bits1::IsConstructorBit::kMask));
+  __ Branch(&non_constructor, eq, a2, Operand(zero_reg));
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(a0, a2, a5, &stack_overflow);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+
+  // Implicit receiver stored in the construct frame.
+  __ LoadRoot(a2, RootIndex::kTheHoleValue);
+  __ Push(cp, a2);
+
+  // Push arguments + implicit receiver.
+  Register argc_without_receiver = a7;
+  __ Dsubu(argc_without_receiver, a0, Operand(kJSArgcReceiverSlots));
+  GenerateInterpreterPushArgs(masm, argc_without_receiver, a4, a5, a6);
+  __ Push(a2);
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  __ Ld(a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset));
+  __ Lwu(a2, FieldMemOperand(a2, SharedFunctionInfo::kFlagsOffset));
+  __ And(a5, a2, Operand(SharedFunctionInfo::ConstructAsBuiltinBit::kMask));
+  __ Branch(&builtin_call, ne, a5, Operand(zero_reg));
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(a2);
+  __ JumpIfIsInRange(
+      a2, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor),
+      &not_create_implicit_receiver);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the function.
+  __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- v0     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label use_receiver, do_throw, leave_and_return, check_receiver;
+
+  // If the result is undefined, we jump out to using the implicit receiver.
+  __ JumpIfNotRoot(v0, RootIndex::kUndefinedValue, &check_receiver);
+
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ bind(&use_receiver);
+  __ Ld(v0,
+        MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+  __ JumpIfRoot(v0, RootIndex::kTheHoleValue, &do_throw);
+
+  __ bind(&leave_and_return);
+  // Leave construct frame.
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  // Otherwise we do a smi check and fall through to check if the return value
+  // is a valid receiver.
+  __ bind(&check_receiver);
+
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(v0, &use_receiver);
+
+  // Check if the type of the result is not an object in the ECMA sense.
+  __ GetObjectType(v0, a4, a4);
+  __ Branch(&leave_and_return, hs, a4, Operand(FIRST_JS_RECEIVER_TYPE));
+  __ Branch(&use_receiver);
+
+  __ bind(&builtin_call);
+  // TODO(victorgomes): Check the possibility to turn this into a tailcall.
+  __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  __ bind(&do_throw);
+  // Restore the context from the frame.
+  __ Ld(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  // Unreachable code.
+  __ break_(0xCC);
+
+  __ bind(&stack_overflow);
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  // Unreachable code.
+  __ break_(0xCC);
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Set the return address to the correct point in the interpreter entry
   // trampoline.
   Label builtin_trampoline, trampoline_loaded;
-  Smi interpreter_entry_return_pc_offset(
+  Tagged<Smi> interpreter_entry_return_pc_offset(
       masm->isolate()->heap()->interpreter_entry_return_pc_offset());
   DCHECK_NE(interpreter_entry_return_pc_offset, Smi::zero());
 
@@ -1475,7 +1635,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
             Operand(INTERPRETER_DATA_TYPE));
 
   __ Ld(t0, FieldMemOperand(t0, InterpreterData::kInterpreterTrampolineOffset));
-  __ LoadCodeEntry(t0, t0);
+  __ LoadCodeInstructionStart(t0, t0);
   __ Branch(&trampoline_loaded);
 
   __ bind(&builtin_trampoline);
@@ -1524,7 +1684,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   __ Daddu(a1, kInterpreterBytecodeArrayRegister,
            kInterpreterBytecodeOffsetRegister);
   __ Lbu(a7, MemOperand(a1));
-  __ Dlsa(a1, kInterpreterDispatchTableRegister, a7, kPointerSizeLog2);
+  __ Dlsa(a1, kInterpreterDispatchTableRegister, a7, kSystemPointerSizeLog2);
   __ Ld(kJavaScriptCallCodeStartRegister, MemOperand(a1));
   __ Jump(kJavaScriptCallCodeStartRegister);
 }
@@ -1595,10 +1755,10 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
   } else {
     // Overwrite the hole inserted by the deoptimizer with the return value from
     // the LAZY deopt point.
-    __ Sd(v0,
-          MemOperand(
-              sp, config->num_allocatable_general_registers() * kPointerSize +
-                      BuiltinContinuationFrameConstants::kFixedFrameSize));
+    __ Sd(v0, MemOperand(
+                  sp, config->num_allocatable_general_registers() *
+                              kSystemPointerSize +
+                          BuiltinContinuationFrameConstants::kFixedFrameSize));
   }
   }
   for (int i = allocatable_register_count - 1; i >= 0; --i) {
@@ -1631,7 +1791,7 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
   __ Daddu(sp, sp,
            Operand(BuiltinContinuationFrameConstants::kFixedFrameSizeFromFp));
   __ Pop(ra);
-  __ LoadEntryFromBuiltinIndex(t0);
+  __ LoadEntryFromBuiltinIndex(t0, t0);
   __ Jump(t0);
 }
 }  // namespace
@@ -1661,10 +1821,10 @@ void Builtins::Generate_NotifyDeoptimized(MacroAssembler* masm) {
   }
 
   DCHECK_EQ(kInterpreterAccumulatorRegister.code(), v0.code());
-  __ Ld(v0, MemOperand(sp, 0 * kPointerSize));
+  __ Ld(v0, MemOperand(sp, 0 * kSystemPointerSize));
   __ Ret(USE_DELAY_SLOT);
   // Safe to fill delay slot Addu will emit one instruction.
-  __ Daddu(sp, sp, Operand(1 * kPointerSize));  // Remove state.
+  __ Daddu(sp, sp, Operand(1 * kSystemPointerSize));  // Remove state.
 }
 
 namespace {
@@ -1696,13 +1856,12 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
   {
     FrameScope scope(masm, StackFrame::INTERNAL);
     __ CallRuntime(Runtime::kCompileOptimizedOSR);
-    __ mov(maybe_target_code, v0);
   }
 
   // If the code object is null, just return to the caller.
   __ Ret(eq, maybe_target_code, Operand(Smi::zero()));
   __ bind(&jump_to_optimized_code);
-  DCHECK_EQ(maybe_target_code, a0);  // Already in the right spot.
+  DCHECK_EQ(maybe_target_code, v0);  // Already in the right spot.
 
   // OSR entry tracing.
   {
@@ -1713,9 +1872,9 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
 
     {
       FrameScope scope(masm, StackFrame::INTERNAL);
-      __ Push(a0);  // Preserve the code object.
+      __ Push(v0);  // Preserve the code object.
       __ CallRuntime(Runtime::kLogOrTraceOptimizedOSREntry, 0);
-      __ Pop(a0);
+      __ Pop(v0);
     }
 
     __ bind(&next);
@@ -1739,7 +1898,7 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
                                      DeoptimizationData::kOsrPcOffsetIndex) -
                                      kHeapObjectTag));
 
-  __ LoadCodeEntry(maybe_target_code, maybe_target_code);
+  __ LoadCodeInstructionStart(maybe_target_code, maybe_target_code);
 
   // Compute the target address = code_entry + osr_offset
   // <entry_addr> = <code_entry> + <osr_offset>
@@ -1787,8 +1946,8 @@ void Builtins::Generate_FunctionPrototypeApply(MacroAssembler* masm) {
   // present) instead.
   {
     __ Dsubu(scratch, argc, JSParameterCount(0));
-    __ Ld(this_arg, MemOperand(sp, kPointerSize));
-    __ Ld(arg_array, MemOperand(sp, 2 * kPointerSize));
+    __ Ld(this_arg, MemOperand(sp, kSystemPointerSize));
+    __ Ld(arg_array, MemOperand(sp, 2 * kSystemPointerSize));
     __ Movz(arg_array, undefined_value, scratch);  // if argc == 0
     __ Movz(this_arg, undefined_value, scratch);   // if argc == 0
     __ Dsubu(scratch, scratch, Operand(1));
@@ -1879,9 +2038,9 @@ void Builtins::Generate_ReflectApply(MacroAssembler* masm) {
     // consistent state for a simple pop operation.
 
     __ Dsubu(scratch, argc, Operand(JSParameterCount(0)));
-    __ Ld(target, MemOperand(sp, kPointerSize));
-    __ Ld(this_argument, MemOperand(sp, 2 * kPointerSize));
-    __ Ld(arguments_list, MemOperand(sp, 3 * kPointerSize));
+    __ Ld(target, MemOperand(sp, kSystemPointerSize));
+    __ Ld(this_argument, MemOperand(sp, 2 * kSystemPointerSize));
+    __ Ld(arguments_list, MemOperand(sp, 3 * kSystemPointerSize));
     __ Movz(arguments_list, undefined_value, scratch);  // if argc == 0
     __ Movz(this_argument, undefined_value, scratch);   // if argc == 0
     __ Movz(target, undefined_value, scratch);          // if argc == 0
@@ -1939,9 +2098,9 @@ void Builtins::Generate_ReflectConstruct(MacroAssembler* masm) {
     // consistent state for a simple pop operation.
 
     __ Dsubu(scratch, argc, Operand(JSParameterCount(0)));
-    __ Ld(target, MemOperand(sp, kPointerSize));
-    __ Ld(arguments_list, MemOperand(sp, 2 * kPointerSize));
-    __ Ld(new_target, MemOperand(sp, 3 * kPointerSize));
+    __ Ld(target, MemOperand(sp, kSystemPointerSize));
+    __ Ld(arguments_list, MemOperand(sp, 2 * kSystemPointerSize));
+    __ Ld(new_target, MemOperand(sp, 3 * kSystemPointerSize));
     __ Movz(arguments_list, undefined_value, scratch);  // if argc == 0
     __ Movz(new_target, undefined_value, scratch);      // if argc == 0
     __ Movz(target, undefined_value, scratch);          // if argc == 0
@@ -1991,7 +2150,7 @@ void Generate_AllocateSpaceAndShiftExistingArguments(
   Register old_sp = scratch1;
   Register new_space = scratch2;
   __ mov(old_sp, sp);
-  __ dsll(new_space, count, kPointerSizeLog2);
+  __ dsll(new_space, count, kSystemPointerSizeLog2);
   __ Dsubu(sp, sp, Operand(new_space));
 
   Register end = scratch2;
@@ -2062,12 +2221,12 @@ void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
 
     __ daddiu(src, args, FixedArray::kHeaderSize - kHeapObjectTag);
     __ Branch(&done, eq, len, Operand(zero_reg), i::USE_DELAY_SLOT);
-    __ dsll(scratch, len, kPointerSizeLog2);
+    __ dsll(scratch, len, kSystemPointerSizeLog2);
     __ Dsubu(scratch, sp, Operand(scratch));
     __ LoadRoot(t1, RootIndex::kTheHoleValue);
     __ bind(&loop);
     __ Ld(a5, MemOperand(src));
-    __ daddiu(src, src, kPointerSize);
+    __ daddiu(src, src, kSystemPointerSize);
     __ Branch(&push, ne, a5, Operand(t1));
     __ LoadRoot(a5, RootIndex::kUndefinedValue);
     __ bind(&push);
@@ -2147,9 +2306,9 @@ void Builtins::Generate_CallOrConstructForwardVarargs(MacroAssembler* masm,
       __ bind(&loop);
       {
         __ Subu(a7, a7, Operand(1));
-        __ Dlsa(t0, a6, a7, kPointerSizeLog2);
+        __ Dlsa(t0, a6, a7, kSystemPointerSizeLog2);
         __ Ld(kScratchReg, MemOperand(t0));
-        __ Dlsa(t0, a2, a7, kPointerSizeLog2);
+        __ Dlsa(t0, a2, a7, kSystemPointerSizeLog2);
         __ Sd(kScratchReg, MemOperand(t0));
         __ Branch(&loop, ne, a7, Operand(zero_reg));
       }
@@ -2199,7 +2358,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ LoadGlobalProxy(a3);
     } else {
       Label convert_to_object, convert_receiver;
-      __ LoadReceiver(a3, a0);
+      __ LoadReceiver(a3);
       __ JumpIfSmi(a3, &convert_to_object);
       static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
       __ GetObjectType(a3, a4, a4);
@@ -2235,7 +2394,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ Ld(a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset));
       __ bind(&convert_receiver);
     }
-    __ StoreReceiver(a3, a0, kScratchReg);
+    __ StoreReceiver(a3);
   }
   __ bind(&done_convert);
 
@@ -2262,7 +2421,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
   // Patch the receiver to [[BoundThis]].
   {
     __ Ld(t0, FieldMemOperand(a1, JSBoundFunction::kBoundThisOffset));
-    __ StoreReceiver(t0, a0, kScratchReg);
+    __ StoreReceiver(t0);
   }
 
   // Load [[BoundArguments]] into a2 and length of that into a4.
@@ -2279,7 +2438,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
   // Reserve stack space for the [[BoundArguments]].
   {
     Label done;
-    __ dsll(a5, a4, kPointerSizeLog2);
+    __ dsll(a5, a4, kSystemPointerSizeLog2);
     __ Dsubu(t0, sp, Operand(a5));
     // Check the stack for overflow. We are not trying to catch interruptions
     // (i.e. debug break and preemption) here, so check the "real stack limit".
@@ -2306,7 +2465,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
     __ bind(&loop);
     __ Dsubu(a4, a4, Operand(1));
     __ Branch(&done_loop, lt, a4, Operand(zero_reg));
-    __ Dlsa(a5, a2, a4, kPointerSizeLog2);
+    __ Dlsa(a5, a2, a4, kSystemPointerSizeLog2);
     __ Ld(kScratchReg, MemOperand(a5));
     __ Push(kScratchReg);
     __ Branch(&loop);
@@ -2328,12 +2487,11 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   //  -- a0 : the number of arguments
   //  -- a1 : the target to call (can be any Object).
   // -----------------------------------
-  Register argc = a0;
   Register target = a1;
   Register map = t1;
   Register instance_type = t2;
   Register scratch = t8;
-  DCHECK(!AreAliased(argc, target, map, instance_type, scratch));
+  DCHECK(!AreAliased(a0, target, map, instance_type, scratch));
 
   Label non_callable, class_constructor;
   __ JumpIfSmi(target, &non_callable);
@@ -2374,7 +2532,7 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   // 2. Call to something else, which might have a [[Call]] internal method (if
   // not we raise an exception).
   // Overwrite the original receiver with the (original) target.
-  __ StoreReceiver(target, argc, kScratchReg);
+  __ StoreReceiver(target);
   // Let the "call_as_function_delegate" take care of the rest.
   __ LoadNativeContextSlot(target, Context::CALL_AS_FUNCTION_DELEGATE_INDEX);
   __ Jump(masm->isolate()->builtins()->CallFunction(
@@ -2452,7 +2610,7 @@ void Builtins::Generate_ConstructBoundFunction(MacroAssembler* masm) {
   // Reserve stack space for the [[BoundArguments]].
   {
     Label done;
-    __ dsll(a5, a4, kPointerSizeLog2);
+    __ dsll(a5, a4, kSystemPointerSizeLog2);
     __ Dsubu(t0, sp, Operand(a5));
     // Check the stack for overflow. We are not trying to catch interruptions
     // (i.e. debug break and preemption) here, so check the "real stack limit".
@@ -2479,7 +2637,7 @@ void Builtins::Generate_ConstructBoundFunction(MacroAssembler* masm) {
     __ bind(&loop);
     __ Dsubu(a4, a4, Operand(1));
     __ Branch(&done_loop, lt, a4, Operand(zero_reg));
-    __ Dlsa(a5, a2, a4, kPointerSizeLog2);
+    __ Dlsa(a5, a2, a4, kSystemPointerSizeLog2);
     __ Ld(kScratchReg, MemOperand(a5));
     __ Push(kScratchReg);
     __ Branch(&loop);
@@ -2511,12 +2669,11 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   //          the JSFunction on which new was invoked initially)
   // -----------------------------------
 
-  Register argc = a0;
   Register target = a1;
   Register map = t1;
   Register instance_type = t2;
   Register scratch = t8;
-  DCHECK(!AreAliased(argc, target, map, instance_type, scratch));
+  DCHECK(!AreAliased(a0, target, map, instance_type, scratch));
 
   // Check if target is a Smi.
   Label non_constructor, non_proxy;
@@ -2552,7 +2709,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ bind(&non_proxy);
   {
     // Overwrite the original receiver with the (original) target.
-    __ StoreReceiver(target, argc, kScratchReg);
+    __ StoreReceiver(target);
     // Let the "call_as_constructor_delegate" take care of the rest.
     __ LoadNativeContextSlot(target,
                              Context::CALL_AS_CONSTRUCTOR_DELEGATE_INDEX);
@@ -2756,14 +2913,11 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
   __ Ret();
 }
 
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
   __ Trap();
 }
 
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
-  // TODO(v8:12191): Implement for this platform.
-  __ Trap();
-}
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) { __ Trap(); }
 
 void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   // TODO(v8:12191): Implement for this platform.
@@ -2785,10 +2939,13 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
   __ Trap();
 }
 
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) { __ Trap(); }
+
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   // Called from JavaScript; parameters are on stack as if calling JS function
   // a0: number of arguments including receiver
   // a1: pointer to builtin function
@@ -2804,8 +2961,8 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
     __ mov(s1, a2);
   } else {
     // Compute the argv pointer in a callee-saved register.
-    __ Dlsa(s1, sp, a0, kPointerSizeLog2);
-    __ Dsubu(s1, s1, kPointerSize);
+    __ Dlsa(s1, sp, a0, kSystemPointerSizeLog2);
+    __ Dsubu(s1, s1, kSystemPointerSize);
   }
 
   // Enter the exit frame that transitions from JavaScript to C++.
@@ -2932,7 +3089,7 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   DoubleRegister double_scratch = kScratchDoubleReg;
 
   // Account for saved regs.
-  const int kArgumentOffset = 4 * kPointerSize;
+  const int kArgumentOffset = 4 * kSystemPointerSize;
 
   __ Push(result_reg);
   __ Push(scratch, scratch2, scratch3);
@@ -3046,148 +3203,56 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ Ret();
 }
 
-namespace {
-
-int AddressOffset(ExternalReference ref0, ExternalReference ref1) {
-  int64_t offset = (ref0.address() - ref1.address());
-  DCHECK(static_cast<int>(offset) == offset);
-  return static_cast<int>(offset);
-}
-
-// Calls an API function.  Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.  Restores context.  stack_space
-// - space to be unwound on exit (includes the call JS arguments space and
-// the additional space allocated for the fast call).
-void CallApiFunctionAndReturn(MacroAssembler* masm, Register function_address,
-                              ExternalReference thunk_ref, int stack_space,
-                              MemOperand* stack_space_operand,
-                              MemOperand return_value_operand) {
-  Isolate* isolate = masm->isolate();
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  const int kNextOffset = 0;
-  const int kLimitOffset = AddressOffset(
-      ExternalReference::handle_scope_limit_address(isolate), next_address);
-  const int kLevelOffset = AddressOffset(
-      ExternalReference::handle_scope_level_address(isolate), next_address);
-
-  DCHECK(function_address == a1 || function_address == a2);
-
-  // Allocate HandleScope in callee-save registers.
-  __ li(s5, next_address);
-  __ Ld(s0, MemOperand(s5, kNextOffset));
-  __ Ld(s1, MemOperand(s5, kLimitOffset));
-  __ Lw(s2, MemOperand(s5, kLevelOffset));
-  __ Addu(s2, s2, Operand(1));
-  __ Sw(s2, MemOperand(s5, kLevelOffset));
-
-  Label profiler_enabled, done_api_call;
-  __ Lb(t9, __ ExternalReferenceAsOperand(
-                ExternalReference::is_profiling_address(isolate), t9));
-  __ Branch(&profiler_enabled, ne, t9, Operand(zero_reg));
-#ifdef V8_RUNTIME_CALL_STATS
-  __ li(t9, ExternalReference::address_of_runtime_stats_flag());
-  __ Lw(t9, MemOperand(t9, 0));
-  __ Branch(&profiler_enabled, ne, t9, Operand(zero_reg));
-#endif  // V8_RUNTIME_CALL_STATS
-
-  // Call the api function directly.
-  __ mov(t9, function_address);
-  __ StoreReturnAddressAndCall(t9);
-  __ bind(&done_api_call);
-
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-  Label return_value_loaded;
-
-  // Load value from ReturnValue.
-  __ Ld(v0, return_value_operand);
-  __ bind(&return_value_loaded);
-
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ Sd(s0, MemOperand(s5, kNextOffset));
-  if (v8_flags.debug_code) {
-    __ Lw(a1, MemOperand(s5, kLevelOffset));
-    __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall, a1,
-             Operand(s2));
-  }
-  __ Subu(s2, s2, Operand(1));
-  __ Sw(s2, MemOperand(s5, kLevelOffset));
-  __ Ld(kScratchReg, MemOperand(s5, kLimitOffset));
-  __ Branch(&delete_allocated_handles, ne, s1, Operand(kScratchReg));
-
-  // Leave the API exit frame.
-  __ bind(&leave_exit_frame);
-
-  if (stack_space_operand == nullptr) {
-    DCHECK_NE(stack_space, 0);
-    __ li(s0, Operand(stack_space));
-  } else {
-    DCHECK_EQ(stack_space, 0);
-    static_assert(kCArgSlotCount == 0);
-    __ Ld(s0, *stack_space_operand);
-  }
-
-  static constexpr bool kRegisterContainsSlotCount = false;
-  __ LeaveExitFrame(s0, NO_EMIT_RETURN, kRegisterContainsSlotCount);
-
-  // Check if the function scheduled an exception.
-  __ LoadRoot(a4, RootIndex::kTheHoleValue);
-  __ li(kScratchReg, ExternalReference::scheduled_exception_address(isolate));
-  __ Ld(a5, MemOperand(kScratchReg));
-  __ Branch(&promote_scheduled_exception, ne, a4, Operand(a5));
-
-  __ Ret();
-
-  // Call the api function via thunk wrapper.
-  __ bind(&profiler_enabled);
-  // Additional parameter is the address of the actual callback.
-  __ li(t9, thunk_ref);
-  __ StoreReturnAddressAndCall(t9);
-  __ Branch(&done_api_call);
-
-  // Re-throw by promoting a scheduled exception.
-  __ bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  __ bind(&delete_allocated_handles);
-  __ Sd(s1, MemOperand(s5, kLimitOffset));
-  __ mov(s0, v0);
-  __ mov(a0, v0);
-  __ PrepareCallCFunction(1, s1);
-  __ li(a0, ExternalReference::isolate_address(isolate));
-  __ CallCFunction(ExternalReference::delete_handle_scope_extensions(), 1);
-  __ mov(v0, s0);
-  __ jmp(&leave_exit_frame);
-}
-
-}  // namespace
-
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- cp                  : context
+  // CallApiCallbackMode::kGeneric mode:
+  //  -- a2                  : arguments count (not including the receiver)
+  //  -- a3                  : call handler info
+  //  -- a0                  : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
   //  -- a1                  : api function address
   //  -- a2                  : arguments count
   //  -- a3                  : call data
   //  -- a0                  : holder
+  //  Both modes:
+  //  -- cp                  : context
   //  -- sp[0]               : receiver
   //  -- sp[8]               : first argument
   //  -- ...
   //  -- sp[(argc) * 8]      : last argument
   // -----------------------------------
 
-  Register api_function_address = a1;
-  Register argc = a2;
-  Register call_data = a3;
-  Register holder = a0;
-  Register scratch = t0;
-  Register base = t1;  // For addressing MemOperands on the stack.
+  Register function_callback_info_arg = arg_reg_1;
 
-  DCHECK(!AreAliased(api_function_address, argc, call_data,
-                     holder, scratch, base));
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register callback = no_reg;
+  Register holder = no_reg;
+  Register scratch = t0;
+  Register scratch2 = t1;
+  Register base = t2;  // For addressing MemOperands on the stack.
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = a1;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, holder, call_data, callback,
+                     scratch, scratch2, base));
 
   using FCA = FunctionCallbackArguments;
 
@@ -3195,171 +3260,278 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
   // Set up FunctionCallbackInfo's implicit_args on the stack as follows:
   //
   // Target state:
-  //   sp[0 * kPointerSize]: kHolder
-  //   sp[1 * kPointerSize]: kIsolate
-  //   sp[2 * kPointerSize]: undefined (kReturnValueDefaultValue)
-  //   sp[3 * kPointerSize]: undefined (kReturnValue)
-  //   sp[4 * kPointerSize]: kData
-  //   sp[5 * kPointerSize]: undefined (kNewTarget)
+  //   sp[0 * kSystemPointerSize]: kHolder   <= FCA::implicit_args_
+  //   sp[1 * kSystemPointerSize]: kIsolate
+  //   sp[2 * kSystemPointerSize]: undefined (padding, unused)
+  //   sp[3 * kSystemPointerSize]: undefined (kReturnValue)
+  //   sp[4 * kSystemPointerSize]: kData
+  //   sp[5 * kSystemPointerSize]: undefined (kNewTarget)
+  // Existing state:
+  //   sp[6 * kSystemPointerSize]:           <= FCA:::values_
 
   // Set up the base register for addressing through MemOperands. It will point
-  // at the receiver (located at sp + argc * kPointerSize).
-  __ Dlsa(base, sp, argc, kPointerSizeLog2);
+  // at the receiver (located at sp + argc * kSystemPointerSize).
+  __ Dlsa(base, sp, argc, kSystemPointerSizeLog2);
 
   // Reserve space on the stack.
-  __ Dsubu(sp, sp, Operand(FCA::kArgsLength * kPointerSize));
+  __ Dsubu(sp, sp, Operand(FCA::kArgsLength * kSystemPointerSize));
 
   // kHolder.
-  __ Sd(holder, MemOperand(sp, 0 * kPointerSize));
+  __ Sd(holder, MemOperand(sp, FCA::kHolderIndex * kSystemPointerSize));
 
   // kIsolate.
   __ li(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ Sd(scratch, MemOperand(sp, 1 * kPointerSize));
+  __ Sd(scratch, MemOperand(sp, FCA::kIsolateIndex * kSystemPointerSize));
 
-  // kReturnValueDefaultValue and kReturnValue.
+  // kUnused
+  __ Sd(zero_reg, MemOperand(sp, FCA::kUnusedIndex * kSystemPointerSize));
+
+  // kReturnValue.
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ Sd(scratch, MemOperand(sp, 2 * kPointerSize));
-  __ Sd(scratch, MemOperand(sp, 3 * kPointerSize));
+  __ Sd(scratch, MemOperand(sp, FCA::kReturnValueIndex * kSystemPointerSize));
 
   // kData.
-  __ Sd(call_data, MemOperand(sp, 4 * kPointerSize));
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ Ld(scratch2, FieldMemOperand(callback, CallHandlerInfo::kDataOffset));
+      __ Sd(scratch2, MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ Sd(call_data, MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+  }
 
   // kNewTarget.
-  __ Sd(scratch, MemOperand(sp, 5 * kPointerSize));
+  __ Sd(scratch, MemOperand(sp, FCA::kNewTargetIndex * kSystemPointerSize));
 
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  __ mov(scratch, sp);
+  __ mov(holder, sp);
 
   // Allocate the v8::Arguments structure in the arguments' space since
   // it's not controlled by GC.
-  static constexpr int kApiStackSpace = 4;
-  FrameScope frame_scope(masm, StackFrame::MANUAL);
-  __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  static constexpr int kSlotsToDropOnStackSize = 1 * kSystemPointerSize;
+  static constexpr int kApiStackSpace =
+      (FCA::kSize + kSlotsToDropOnStackSize) / kSystemPointerSize;
+  static_assert(kApiStackSpace == 4);
+  static_assert(FCA::kImplicitArgsOffset == 0);
+  static_assert(FCA::kValuesOffset == 1 * kSystemPointerSize);
+  static_assert(FCA::kLengthOffset == 2 * kSystemPointerSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
 
-  // EnterExitFrame may align the sp.
+  FrameScope frame_scope(masm, StackFrame::MANUAL);
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+    __ AllocateStackSpace(exit_frame_params_count * kSystemPointerSize);
+
+    // No padding is required.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize == 0);
+
+    // Context parameter.
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ Sd(kContextRegister, MemOperand(sp, 2 * kSystemPointerSize));
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ SmiTag(scratch, argc);
+    __ Sd(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ Ld(scratch,
+          FieldMemOperand(callback, CallHandlerInfo::kOwnerTemplateOffset));
+    __ Sd(scratch, MemOperand(sp, 0 * kSystemPointerSize));
+
+    __ Ld(api_function_address,
+          FieldMemOperand(callback,
+                          CallHandlerInfo::kMaybeRedirectedCallbackOffset));
+
+    __ EnterExitFrame(kApiStackSpace, StackFrame::API_CALLBACK_EXIT);
+  } else {
+    __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  }
 
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  // Arguments are after the return address (pushed by EnterExitFrame()).
-  __ Sd(scratch, MemOperand(sp, 1 * kPointerSize));
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    // Arguments are after the return address (pushed by EnterExitFrame()).
+    __ Sd(holder, ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset));
 
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  __ Daddu(scratch, scratch,
-          Operand((FCA::kArgsLength + 1) * kSystemPointerSize));
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ Daddu(holder, holder,
+             Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
 
-  __ Sd(scratch, MemOperand(sp, 2 * kPointerSize));
+    __ Sd(holder, ExitFrameStackSlotOperand(FCA::kValuesOffset));
 
-  // FunctionCallbackInfo::length_.
-  // Stored as int field, 32-bit integers within struct on stack always left
-  // justified by n64 ABI.
-  __ Sw(argc, MemOperand(sp, 3 * kPointerSize));
+    // FunctionCallbackInfo::length_.
+    // Stored as int field, 32-bit integers within struct on stack always left
+    // justified by n64 ABI.
+    __ Sw(argc, ExitFrameStackSlotOperand(FCA::kLengthOffset));
+  }
 
   // We also store the number of bytes to drop from the stack after returning
   // from the API function here.
   // Note: Unlike on other architectures, this stores the number of slots to
   // drop, not the number of bytes.
-  __ Daddu(scratch, argc, Operand(FCA::kArgsLength + 1 /* receiver */));
-  __ Sd(scratch, MemOperand(sp, 4 * kPointerSize));
+  MemOperand stack_space_operand =
+      ExitFrameStackSlotOperand(FCA::kLengthOffset + kSlotsToDropOnStackSize);
+  __ Daddu(scratch, argc,
+           Operand(FCA::kArgsLengthWithReceiver + exit_frame_params_count));
+  __ Sd(scratch, stack_space_operand);
+
+  __ RecordComment("v8::FunctionCallback's argument.");
+  // function_callback_info_arg = v8::FunctionCallbackInfo&
+  DCHECK(
+      !AreAliased(api_function_address, scratch, function_callback_info_arg));
+  __ Daddu(function_callback_info_arg, sp, Operand(1 * kSystemPointerSize));
 
-  // v8::InvocationCallback's argument.
-  DCHECK(!AreAliased(api_function_address, scratch, a0));
-  __ Daddu(a0, sp, Operand(1 * kPointerSize));
+  DCHECK(
+      !AreAliased(api_function_address, scratch, function_callback_info_arg));
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
 
-  // There are two stack slots above the arguments we constructed on the stack.
-  // TODO(jgruber): Document what these arguments are.
-  static constexpr int kStackSlotsAboveFCA = 2;
-  MemOperand return_value_operand(
-      fp, (kStackSlotsAboveFCA + FCA::kReturnValueIndex) * kPointerSize);
+  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
 
   static constexpr int kUseStackSpaceOperand = 0;
-  MemOperand stack_space_operand(sp, 4 * kPointerSize);
 
-  AllowExternalCallThatCantCauseGC scope(masm);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kUseStackSpaceOperand, &stack_space_operand,
-                           return_value_operand);
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseStackSpaceOperand,
+                           &stack_space_operand, return_value_operand);
 }
 
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- cp                  : context
+  //  -- a1                  : receiver
+  //  -- a3                  : accessor info
+  //  -- a0                  : holder
+  // -----------------------------------
+  //
   // Build v8::PropertyCallbackInfo::args_ array on the stack and push property
   // name below the exit frame to make GC aware of them.
-  static_assert(PropertyCallbackArguments::kShouldThrowOnErrorIndex == 0);
-  static_assert(PropertyCallbackArguments::kHolderIndex == 1);
-  static_assert(PropertyCallbackArguments::kIsolateIndex == 2);
-  static_assert(PropertyCallbackArguments::kReturnValueDefaultValueIndex == 3);
-  static_assert(PropertyCallbackArguments::kReturnValueIndex == 4);
-  static_assert(PropertyCallbackArguments::kDataIndex == 5);
-  static_assert(PropertyCallbackArguments::kThisIndex == 6);
-  static_assert(PropertyCallbackArguments::kArgsLength == 7);
+  using PCI = PropertyCallbackInfo<v8::Value>;
+  using PCA = PropertyCallbackArguments;
+  static_assert(PCA::kShouldThrowOnErrorIndex == 0);
+  static_assert(PCA::kHolderIndex == 1);
+  static_assert(PCA::kIsolateIndex == 2);
+  static_assert(PCA::kUnusedIndex == 3);
+  static_assert(PCA::kReturnValueIndex == 4);
+  static_assert(PCA::kDataIndex == 5);
+  static_assert(PCA::kThisIndex == 6);
+  static_assert(PCA::kArgsLength == 7);
+
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  // Target state:
+  //   sp[0 * kSystemPointerSize]: name
+  //   sp[1 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   sp[2 * kSystemPointerSize]: kHolderIndex
+  //   sp[3 * kSystemPointerSize]: kIsolateIndex
+  //   sp[4 * kSystemPointerSize]: kUnusedIndex
+  //   sp[5 * kSystemPointerSize]: kReturnValueIndex
+  //   sp[6 * kSystemPointerSize]: kDataIndex
+  //   sp[7 * kSystemPointerSize]: kThisIndex / receiver
+
+  Register name_arg = arg_reg_1;
+  Register property_callback_info_arg = arg_reg_2;
 
+  Register api_function_address = a2;
   Register receiver = ApiGetterDescriptor::ReceiverRegister();
   Register holder = ApiGetterDescriptor::HolderRegister();
   Register callback = ApiGetterDescriptor::CallbackRegister();
   Register scratch = a4;
   DCHECK(!AreAliased(receiver, holder, callback, scratch));
 
-  Register api_function_address = a2;
-
   // Here and below +1 is for name() pushed after the args_ array.
-  using PCA = PropertyCallbackArguments;
-  __ Dsubu(sp, sp, (PCA::kArgsLength + 1) * kPointerSize);
-  __ Sd(receiver, MemOperand(sp, (PCA::kThisIndex + 1) * kPointerSize));
+  __ Dsubu(sp, sp, (PCA::kArgsLength + 1) * kSystemPointerSize);
+  __ Sd(receiver, MemOperand(sp, (PCA::kThisIndex + 1) * kSystemPointerSize));
   __ Ld(scratch, FieldMemOperand(callback, AccessorInfo::kDataOffset));
-  __ Sd(scratch, MemOperand(sp, (PCA::kDataIndex + 1) * kPointerSize));
+  __ Sd(scratch, MemOperand(sp, (PCA::kDataIndex + 1) * kSystemPointerSize));
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ Sd(scratch, MemOperand(sp, (PCA::kReturnValueIndex + 1) * kPointerSize));
-  __ Sd(scratch, MemOperand(sp, (PCA::kReturnValueDefaultValueIndex + 1) *
-                                    kPointerSize));
+  __ Sd(scratch,
+        MemOperand(sp, (PCA::kReturnValueIndex + 1) * kSystemPointerSize));
+  __ Sd(zero_reg, MemOperand(sp, (PCA::kUnusedIndex + 1) * kSystemPointerSize));
   __ li(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ Sd(scratch, MemOperand(sp, (PCA::kIsolateIndex + 1) * kPointerSize));
-  __ Sd(holder, MemOperand(sp, (PCA::kHolderIndex + 1) * kPointerSize));
+  __ Sd(scratch, MemOperand(sp, (PCA::kIsolateIndex + 1) * kSystemPointerSize));
+  __ Sd(holder, MemOperand(sp, (PCA::kHolderIndex + 1) * kSystemPointerSize));
   // should_throw_on_error -> false
   DCHECK_EQ(0, Smi::zero().ptr());
-  __ Sd(zero_reg,
-        MemOperand(sp, (PCA::kShouldThrowOnErrorIndex + 1) * kPointerSize));
+  __ Sd(zero_reg, MemOperand(sp, (PCA::kShouldThrowOnErrorIndex + 1) *
+                                     kSystemPointerSize));
   __ Ld(scratch, FieldMemOperand(callback, AccessorInfo::kNameOffset));
-  __ Sd(scratch, MemOperand(sp, 0 * kPointerSize));
+  __ Sd(scratch, MemOperand(sp, 0 * kSystemPointerSize));
 
   // v8::PropertyCallbackInfo::args_ array and name handle.
-  const int kStackUnwindSpace = PropertyCallbackArguments::kArgsLength + 1;
-
-  // Load address of v8::PropertyAccessorInfo::args_ array and name handle.
-  __ mov(a0, sp);                               // a0 = Handle<Name>
-  __ Daddu(a1, a0, Operand(1 * kPointerSize));  // a1 = v8::PCI::args_
+  static constexpr int kPaddingOnStackSlots = 0;
+  static constexpr int kNameOnStackSlots = 1;
+  static constexpr int kNameStackIndex = kPaddingOnStackSlots;
+  static constexpr int kPCAStackIndex =
+      kNameOnStackSlots + kPaddingOnStackSlots;
+  static constexpr int kStackUnwindSpace = PCA::kArgsLength + kPCAStackIndex;
+
+  __ RecordComment(
+      "Load address of v8::PropertyAccessorInfo::args_ array and name handle.");
+
+  // name_arg = Handle<Name>(&name), name value was pushed to GC-ed stack space.
+  __ Daddu(name_arg, sp, Operand(kNameStackIndex * kSystemPointerSize));
+  // property_callback_info_arg = v8::PCI::args_ (= &ShouldThrow)
+  __ Daddu(property_callback_info_arg, sp,
+           Operand(kPCAStackIndex * kSystemPointerSize));
 
   const int kApiStackSpace = 1;
+  static_assert(kApiStackSpace * kSystemPointerSize == sizeof(PCI));
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
 
-  // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // it's args_ field.
-  __ Sd(a1, MemOperand(sp, 1 * kPointerSize));
-  __ Daddu(a1, sp, Operand(1 * kPointerSize));
-  // a1 = v8::PropertyCallbackInfo&
-
-  ExternalReference thunk_ref =
-      ExternalReference::invoke_accessor_getter_callback();
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
+  // Initialize v8::PropertyCallbackInfo::args_ field.
+  __ Sd(property_callback_info_arg, MemOperand(sp, 1 * kSystemPointerSize));
+  // property_callback_info_arg = v8::PropertyCallbackInfo&
+  __ Daddu(property_callback_info_arg, sp, Operand(1 * kSystemPointerSize));
 
+  __ RecordComment("Load api_function_address");
   __ Ld(api_function_address,
         FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset));
 
-  // +3 is to skip prolog, return address and name handle.
-  MemOperand return_value_operand(
-      fp, (PropertyCallbackArguments::kReturnValueIndex + 3) * kPointerSize);
+  DCHECK(
+      !AreAliased(api_function_address, property_callback_info_arg, name_arg));
+
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_accessor_getter_callback();
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
+
+  MemOperand return_value_operand =
+      ExitFrameCallerStackSlotOperand(PCA::kReturnValueIndex + kPCAStackIndex);
   MemOperand* const kUseStackSpaceConstant = nullptr;
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           return_value_operand);
+
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
@@ -3421,10 +3593,10 @@ void Generate_DeoptimizationEntry(MacroAssembler* masm,
 
   // Push saved_regs (needed to populate FrameDescription::registers_).
   // Leave gaps for other registers.
-  __ Dsubu(sp, sp, kNumberOfRegisters * kPointerSize);
+  __ Dsubu(sp, sp, kNumberOfRegisters * kSystemPointerSize);
   for (int16_t i = kNumberOfRegisters - 1; i >= 0; i--) {
     if ((saved_regs.bits() & (1 << i)) != 0) {
-      __ Sd(ToRegister(i), MemOperand(sp, kPointerSize * i));
+      __ Sd(ToRegister(i), MemOperand(sp, kSystemPointerSize * i));
     }
   }
 
@@ -3433,7 +3605,7 @@ void Generate_DeoptimizationEntry(MacroAssembler* masm,
   __ Sd(fp, MemOperand(a2));
 
   const int kSavedRegistersAreaSize =
-      (kNumberOfRegisters * kPointerSize) + kDoubleRegsSize;
+      (kNumberOfRegisters * kSystemPointerSize) + kDoubleRegsSize;
 
   // Get the address of the location in the code object (a2) (return
   // address for lazy deoptimization) and compute the fp-to-sp delta in
@@ -3472,9 +3644,10 @@ void Generate_DeoptimizationEntry(MacroAssembler* masm,
   // Copy core registers into FrameDescription::registers_[kNumRegisters].
   DCHECK_EQ(Register::kNumRegisters, kNumberOfRegisters);
   for (int i = 0; i < kNumberOfRegisters; i++) {
-    int offset = (i * kPointerSize) + FrameDescription::registers_offset();
+    int offset =
+        (i * kSystemPointerSize) + FrameDescription::registers_offset();
     if ((saved_regs.bits() & (1 << i)) != 0) {
-      __ Ld(a2, MemOperand(sp, i * kPointerSize));
+      __ Ld(a2, MemOperand(sp, i * kSystemPointerSize));
       __ Sd(a2, MemOperand(a1, offset));
     } else if (v8_flags.debug_code) {
       __ li(a2, kDebugZapValue);
@@ -3488,7 +3661,8 @@ void Generate_DeoptimizationEntry(MacroAssembler* masm,
   for (int i = 0; i < config->num_allocatable_double_registers(); ++i) {
     int code = config->GetAllocatableDoubleCode(i);
     int dst_offset = code * kDoubleSize + double_regs_offset;
-    int src_offset = code * kDoubleSize + kNumberOfRegisters * kPointerSize;
+    int src_offset =
+        code * kDoubleSize + kNumberOfRegisters * kSystemPointerSize;
     __ Ldc1(f0, MemOperand(sp, src_offset));
     __ Sdc1(f0, MemOperand(a1, dst_offset));
   }
@@ -3533,7 +3707,7 @@ void Generate_DeoptimizationEntry(MacroAssembler* masm,
   // a1 = one past the last FrameDescription**.
   __ Lw(a1, MemOperand(a0, Deoptimizer::output_count_offset()));
   __ Ld(a4, MemOperand(a0, Deoptimizer::output_offset()));  // a4 is output_.
-  __ Dlsa(a1, a4, a1, kPointerSizeLog2);
+  __ Dlsa(a1, a4, a1, kSystemPointerSizeLog2);
   __ BranchShort(&outer_loop_header);
   __ bind(&outer_push_loop);
   // Inner loop state: a2 = current FrameDescription*, a3 = loop index.
@@ -3548,7 +3722,7 @@ void Generate_DeoptimizationEntry(MacroAssembler* masm,
   __ bind(&inner_loop_header);
   __ BranchShort(&inner_push_loop, ne, a3, Operand(zero_reg));
 
-  __ Daddu(a4, a4, Operand(kPointerSize));
+  __ Daddu(a4, a4, Operand(kSystemPointerSize));
   __ bind(&outer_loop_header);
   __ BranchShort(&outer_push_loop, lt, a4, Operand(a1));
 
@@ -3572,7 +3746,8 @@ void Generate_DeoptimizationEntry(MacroAssembler* masm,
   // Restore the registers from the last output frame.
   __ mov(at, a2);
   for (int i = kNumberOfRegisters - 1; i >= 0; i--) {
-    int offset = (i * kPointerSize) + FrameDescription::registers_offset();
+    int offset =
+        (i * kSystemPointerSize) + FrameDescription::registers_offset();
     if ((restored_regs.bits() & (1 << i)) != 0) {
       __ Ld(ToRegister(i), MemOperand(at, offset));
     }
@@ -3614,6 +3789,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register code_obj = s1;
   __ Ld(code_obj,
         FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+
+  if (is_osr) {
+    ResetSharedFunctionInfoAge(masm, code_obj);
+  }
+
   __ Ld(code_obj,
         FieldMemOperand(code_obj, SharedFunctionInfo::kFunctionDataOffset));
 
@@ -3646,7 +3826,8 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register feedback_vector = a2;
   __ Ld(feedback_vector,
         FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ Ld(feedback_vector, FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ Ld(feedback_vector,
+        FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -3698,9 +3879,6 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   // Save the accumulator register, since it's clobbered by the below call.
   __ Push(kInterpreterAccumulatorRegister);
   {
-    Register arg_reg_1 = a0;
-    Register arg_reg_2 = a1;
-    Register arg_reg_3 = a2;
     __ Move(arg_reg_1, code_obj);
     __ Move(arg_reg_2, kInterpreterBytecodeOffsetRegister);
     __ Move(arg_reg_3, kInterpreterBytecodeArrayRegister);
@@ -3708,7 +3886,7 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     __ PrepareCallCFunction(3, 0, a4);
     __ CallCFunction(get_baseline_pc, 3, 0);
   }
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ Daddu(code_obj, code_obj, kReturnRegister0);
   __ Pop(kInterpreterAccumulatorRegister);
 
@@ -3716,7 +3894,6 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     // TODO(liuyu): Remove Ld as arm64 after register reallocation.
     __ Ld(kInterpreterBytecodeArrayRegister,
           MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp));
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
     Generate_OSREntry(masm, code_obj);
   } else {
     __ Jump(code_obj);
diff --git a/deps/v8/src/builtins/number.tq b/deps/v8/src/builtins/number.tq
index 3d0122d60e0932..4e51dd3fa12a80 100644
--- a/deps/v8/src/builtins/number.tq
+++ b/deps/v8/src/builtins/number.tq
@@ -33,17 +33,17 @@ extern enum Operation extends uint31 {
 }
 
 namespace runtime {
-extern transitioning runtime
-DoubleToStringWithRadix(implicit context: Context)(Number, Number): String;
+extern transitioning runtime DoubleToStringWithRadix(
+    implicit context: Context)(Number, Number): String;
 
-extern transitioning runtime StringParseFloat(implicit context: Context)(
-    String): Number;
-extern transitioning runtime StringParseInt(implicit context: Context)(
-    JSAny, JSAny): Number;
+extern transitioning runtime StringParseFloat(
+    implicit context: Context)(String): Number;
+extern transitioning runtime StringParseInt(
+    implicit context: Context)(JSAny, JSAny): Number;
 
 extern runtime BigIntUnaryOp(Context, BigInt, SmiTagged<Operation>): BigInt;
-extern runtime BigIntBinaryOp(
-    Context, Numeric, Numeric, SmiTagged<Operation>): BigInt;
+extern runtime BigIntBinaryOp(Context, Numeric, Numeric, SmiTagged<Operation>):
+    BigInt;
 }  // namespace runtime
 
 namespace number {
@@ -53,8 +53,9 @@ extern macro InfinityStringConstant(): String;
 extern macro MinusInfinityStringConstant(): String;
 extern macro Log10OffsetTable(): RawPtr<uint64>;
 
-transitioning macro ThisNumberValue(implicit context: Context)(
-    receiver: JSAny, method: constexpr string): Number {
+transitioning macro ThisNumberValue(
+    implicit context: Context)(receiver: JSAny,
+    method: constexpr string): Number {
   return UnsafeCast<Number>(
       ToThisValue(receiver, PrimitiveType::kNumber, method));
 }
@@ -177,7 +178,8 @@ macro IntToString(x: int32, radix: uint32): String {
 
 // https://tc39.github.io/ecma262/#sec-number.prototype.tostring
 transitioning javascript builtin NumberPrototypeToString(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   // 1. Let x be ? thisNumberValue(this value).
   const x = ThisNumberValue(receiver, 'Number.prototype.toString');
 
@@ -220,8 +222,8 @@ transitioning javascript builtin NumberPrototypeToString(
 
 // ES6 #sec-number.isfinite
 javascript builtin NumberIsFinite(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(value: JSAny): Boolean {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    value: JSAny): Boolean {
   typeswitch (value) {
     case (Smi): {
       return True;
@@ -238,14 +240,14 @@ javascript builtin NumberIsFinite(
 }
 
 // ES6 #sec-number.isinteger
-javascript builtin NumberIsInteger(js-implicit context: NativeContext)(
-    value: JSAny): Boolean {
+javascript builtin NumberIsInteger(
+    js-implicit context: NativeContext)(value: JSAny): Boolean {
   return SelectBooleanConstant(IsInteger(value));
 }
 
 // ES6 #sec-number.isnan
-javascript builtin NumberIsNaN(js-implicit context: NativeContext)(
-    value: JSAny): Boolean {
+javascript builtin NumberIsNaN(
+    js-implicit context: NativeContext)(value: JSAny): Boolean {
   typeswitch (value) {
     case (Smi): {
       return False;
@@ -261,8 +263,8 @@ javascript builtin NumberIsNaN(js-implicit context: NativeContext)(
 }
 
 // ES6 #sec-number.issafeinteger
-javascript builtin NumberIsSafeInteger(js-implicit context: NativeContext)(
-    value: JSAny): Boolean {
+javascript builtin NumberIsSafeInteger(
+    js-implicit context: NativeContext)(value: JSAny): Boolean {
   return SelectBooleanConstant(IsSafeInteger(value));
 }
 
@@ -308,8 +310,8 @@ transitioning javascript builtin NumberParseFloat(
 
 extern macro TruncateFloat64ToWord32(float64): uint32;
 
-transitioning builtin ParseInt(implicit context: Context)(
-    input: JSAny, radix: JSAny): Number {
+transitioning builtin ParseInt(
+    implicit context: Context)(input: JSAny, radix: JSAny): Number {
   try {
     // Check if radix should be 10 (i.e. undefined, 0 or 10).
     if (radix != Undefined && !TaggedEqual(radix, SmiConstant(10)) &&
@@ -368,21 +370,21 @@ transitioning javascript builtin NumberParseInt(
 extern builtin NonNumberToNumeric(implicit context: Context)(JSAny): Numeric;
 extern builtin Subtract(implicit context: Context)(Number, Number): Number;
 extern builtin Add(implicit context: Context)(Number, Number): Number;
-extern builtin StringAddConvertLeft(implicit context: Context)(
-    JSAny, String): JSAny;
-extern builtin StringAddConvertRight(implicit context: Context)(
-    String, JSAny): JSAny;
+extern builtin StringAddConvertLeft(implicit context: Context)(JSAny, String):
+    JSAny;
+extern builtin StringAddConvertRight(implicit context: Context)(String, JSAny):
+    JSAny;
 
 extern macro BitwiseOp(int32, int32, constexpr Operation): Number;
-extern macro RelationalComparison(
-    constexpr Operation, JSAny, JSAny, Context): Boolean;
+extern macro RelationalComparison(constexpr Operation, JSAny, JSAny, Context):
+    Boolean;
 extern macro TruncateNumberToWord32(Number): int32;
 
 // TODO(bbudge) Use a simpler macro structure that doesn't loop when converting
 // non-numbers, if such a code sequence doesn't make the builtin bigger.
 
-transitioning macro ToNumericOrPrimitive(implicit context: Context)(
-    value: JSAny): JSAny {
+transitioning macro ToNumericOrPrimitive(
+    implicit context: Context)(value: JSAny): JSAny {
   typeswitch (value) {
     case (v: JSReceiver): {
       return NonPrimitiveToPrimitive_Default(context, v);
@@ -393,8 +395,8 @@ transitioning macro ToNumericOrPrimitive(implicit context: Context)(
   }
 }
 
-transitioning builtin Add(implicit context: Context)(
-    leftArg: JSAny, rightArg: JSAny): JSAny {
+transitioning builtin Add(
+    implicit context: Context)(leftArg: JSAny, rightArg: JSAny): JSAny {
   let left: JSAny = leftArg;
   let right: JSAny = rightArg;
   try {
@@ -538,8 +540,8 @@ Smi(Smi), HeapNumber(HeapNumber), BigInt(BigInt) {
 }
 
 // Binary type switch on Number | BigInt.
-macro BinaryOp1(implicit context: Context)(
-    leftVal: JSAny, rightVal: JSAny): never labels
+macro BinaryOp1(implicit context: Context)(leftVal: JSAny, rightVal: JSAny):
+    never labels
 Number(Number, Number), AtLeastOneBigInt(Numeric, Numeric) {
   let left: JSAny = leftVal;
   let right: JSAny = rightVal;
@@ -642,8 +644,8 @@ macro BinaryOp2(implicit context: Context)(leftVal: JSAny, rightVal: JSAny):
   unreachable;
 }
 
-builtin Subtract(implicit context: Context)(
-    left: JSAny, right: JSAny): Numeric {
+builtin Subtract(implicit context: Context)(left: JSAny, right: JSAny):
+    Numeric {
   try {
     BinaryOp2(left, right) otherwise Smis, Float64s, AtLeastOneBigInt;
   } label Smis(left: Smi, right: Smi) {
@@ -659,8 +661,8 @@ builtin Subtract(implicit context: Context)(
   }
 }
 
-builtin Multiply(implicit context: Context)(
-    left: JSAny, right: JSAny): Numeric {
+builtin Multiply(implicit context: Context)(left: JSAny, right: JSAny):
+    Numeric {
   try {
     BinaryOp2(left, right) otherwise Smis, Float64s, AtLeastOneBigInt;
   } label Smis(left: Smi, right: Smi) {
@@ -678,7 +680,8 @@ const kMinInt32: constexpr int32 generates 'kMinInt';
 const kMinInt31: constexpr int32 generates 'kMinInt31';
 const kMinimumDividend: int32 = (kSmiValueSize == 32) ? kMinInt32 : kMinInt31;
 
-builtin Divide(implicit context: Context)(left: JSAny, right: JSAny): Numeric {
+builtin Divide(implicit context: Context)(left: JSAny, right: JSAny):
+    Numeric {
   try {
     BinaryOp2(left, right) otherwise Smis, Float64s, AtLeastOneBigInt;
   } label Smis(left: Smi, right: Smi) {
@@ -712,7 +715,8 @@ builtin Divide(implicit context: Context)(left: JSAny, right: JSAny): Numeric {
   }
 }
 
-builtin Modulus(implicit context: Context)(left: JSAny, right: JSAny): Numeric {
+builtin Modulus(implicit context: Context)(left: JSAny, right: JSAny):
+    Numeric {
   try {
     BinaryOp2(left, right) otherwise Smis, Float64s, AtLeastOneBigInt;
   } label Smis(left: Smi, right: Smi) {
@@ -724,8 +728,8 @@ builtin Modulus(implicit context: Context)(left: JSAny, right: JSAny): Numeric {
   }
 }
 
-builtin Exponentiate(implicit context: Context)(
-    left: JSAny, right: JSAny): Numeric {
+builtin Exponentiate(implicit context: Context)(left: JSAny, right: JSAny):
+    Numeric {
   try {
     BinaryOp1(left, right) otherwise Numbers, AtLeastOneBigInt;
   } label Numbers(left: Number, right: Number) {
@@ -787,24 +791,24 @@ builtin Increment(implicit context: Context)(value: JSAny): Numeric {
 extern macro BinaryOpAssembler::Generate_BitwiseBinaryOp(
     constexpr Operation, JSAny, JSAny, Context): Object;
 
-builtin ShiftLeft(implicit context: Context)(
-    left: JSAny, right: JSAny): Object {
+builtin ShiftLeft(implicit context: Context)(left: JSAny, right: JSAny):
+    Object {
   return Generate_BitwiseBinaryOp(Operation::kShiftLeft, left, right, context);
 }
 
-builtin ShiftRight(implicit context: Context)(
-    left: JSAny, right: JSAny): Object {
+builtin ShiftRight(implicit context: Context)(left: JSAny, right: JSAny):
+    Object {
   return Generate_BitwiseBinaryOp(Operation::kShiftRight, left, right, context);
 }
 
-builtin ShiftRightLogical(implicit context: Context)(
-    left: JSAny, right: JSAny): Object {
+builtin ShiftRightLogical(
+    implicit context: Context)(left: JSAny, right: JSAny): Object {
   return Generate_BitwiseBinaryOp(
       Operation::kShiftRightLogical, left, right, context);
 }
 
-builtin BitwiseAnd(implicit context: Context)(
-    left: JSAny, right: JSAny): Numeric {
+builtin BitwiseAnd(implicit context: Context)(left: JSAny, right: JSAny):
+    Numeric {
   try {
     BinaryOp1(left, right) otherwise Number, AtLeastOneBigInt;
   } label Number(left: Number, right: Number) {
@@ -816,8 +820,8 @@ builtin BitwiseAnd(implicit context: Context)(
   }
 }
 
-builtin BitwiseOr(implicit context: Context)(
-    left: JSAny, right: JSAny): Numeric {
+builtin BitwiseOr(implicit context: Context)(left: JSAny, right: JSAny):
+    Numeric {
   try {
     BinaryOp1(left, right) otherwise Number, AtLeastOneBigInt;
   } label Number(left: Number, right: Number) {
@@ -829,8 +833,8 @@ builtin BitwiseOr(implicit context: Context)(
   }
 }
 
-builtin BitwiseXor(implicit context: Context)(
-    left: JSAny, right: JSAny): Numeric {
+builtin BitwiseXor(implicit context: Context)(left: JSAny, right: JSAny):
+    Numeric {
   try {
     BinaryOp1(left, right) otherwise Number, AtLeastOneBigInt;
   } label Number(left: Number, right: Number) {
@@ -844,23 +848,24 @@ builtin BitwiseXor(implicit context: Context)(
 
 // Relational builtins.
 
-builtin LessThan(implicit context: Context)(left: JSAny, right: JSAny): Object {
+builtin LessThan(implicit context: Context)(left: JSAny, right: JSAny):
+    Object {
   return RelationalComparison(Operation::kLessThan, left, right, context);
 }
 
-builtin LessThanOrEqual(implicit context: Context)(
-    left: JSAny, right: JSAny): Object {
+builtin LessThanOrEqual(implicit context: Context)(left: JSAny, right: JSAny):
+    Object {
   return RelationalComparison(
       Operation::kLessThanOrEqual, left, right, context);
 }
 
-builtin GreaterThan(implicit context: Context)(
-    left: JSAny, right: JSAny): Object {
+builtin GreaterThan(implicit context: Context)(left: JSAny, right: JSAny):
+    Object {
   return RelationalComparison(Operation::kGreaterThan, left, right, context);
 }
 
-builtin GreaterThanOrEqual(implicit context: Context)(
-    left: JSAny, right: JSAny): Object {
+builtin GreaterThanOrEqual(
+    implicit context: Context)(left: JSAny, right: JSAny): Object {
   return RelationalComparison(
       Operation::kGreaterThanOrEqual, left, right, context);
 }
@@ -869,8 +874,8 @@ builtin Equal(implicit context: Context)(left: JSAny, right: JSAny): Object {
   return Equal(left, right, context);
 }
 
-builtin StrictEqual(implicit context: Context)(
-    left: JSAny, right: JSAny): Object {
+builtin StrictEqual(implicit context: Context)(left: JSAny, right: JSAny):
+    Object {
   return ::StrictEqual(left, right);
 }
 
diff --git a/deps/v8/src/builtins/object-fromentries.tq b/deps/v8/src/builtins/object-fromentries.tq
index 94a723667b6762..0573f02aad662c 100644
--- a/deps/v8/src/builtins/object-fromentries.tq
+++ b/deps/v8/src/builtins/object-fromentries.tq
@@ -4,8 +4,8 @@
 
 namespace object {
 
-transitioning macro ObjectFromEntriesFastCase(implicit context: Context)(
-    iterable: JSAny): JSObject labels IfSlow {
+transitioning macro ObjectFromEntriesFastCase(
+    implicit context: Context)(iterable: JSAny): JSObject labels IfSlow {
   typeswitch (iterable) {
     case (array: FastJSArrayWithNoCustomIteration): {
       const elements: FixedArray =
@@ -46,8 +46,7 @@ transitioning macro ObjectFromEntriesFastCase(implicit context: Context)(
   }
 }
 
-transitioning javascript builtin
-ObjectFromEntries(
+transitioning javascript builtin ObjectFromEntries(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   const iterable: JSAny = arguments[0];
   try {
diff --git a/deps/v8/src/builtins/object-groupby.tq b/deps/v8/src/builtins/object-groupby.tq
new file mode 100644
index 00000000000000..48774973a1c176
--- /dev/null
+++ b/deps/v8/src/builtins/object-groupby.tq
@@ -0,0 +1,204 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace collections {
+
+extern macro CollectionsBuiltinsAssembler::AddValueToKeyedGroup(
+    OrderedHashMap, Object, Object, String): OrderedHashMap;
+
+extern macro CollectionsBuiltinsAssembler::NormalizeNumberKey(JSAny): JSAny;
+
+}  // namespace collections
+
+// https://tc39.es/proposal-array-grouping/#sec-group-by
+transitioning macro CoerceGroupKey(
+    implicit context: Context)(key: JSAny, coerceToProperty: Boolean): JSAny {
+  // 6.g. If coercion is property, then
+  if (coerceToProperty == True) {
+    // i. Set key to Completion(ToPropertyKey(key)).
+    return ToName(key);
+  }
+  // 6.h. Else,
+  //    i. Assert: coercion is zero.
+  //   ii. If key is -0𝔽, set key to +0𝔽.
+  return collections::NormalizeNumberKey(key);
+}
+
+// https://tc39.es/proposal-array-grouping/#sec-group-by
+transitioning builtin GroupByGeneric(
+    implicit context: Context)(items: JSAny, initialGroups: OrderedHashMap,
+    callbackfn: Callable, coerceToProperty: Boolean,
+    methodName: String): OrderedHashMap {
+  let groups = initialGroups;
+
+  // 4. Let iteratorRecord be ? GetIterator(items, sync).
+  const fastIteratorResultMap = GetIteratorResultMap();
+  const iteratorRecord = iterator::GetIterator(items);
+
+  // 5. Let k be 0.
+  let k: Number = 0;
+
+  // 6. Repeat,
+  while (true) {
+    // a. If k ≥ 2^53 - 1, then
+    //   i. Let error be ThrowCompletion(a newly created TypeError object).
+    //   ii. Return ? IteratorClose(iteratorRecord, error).
+    //
+    // The spec requires that we throw an exception if index reaches 2^53-1,
+    // but an empty loop would take >100 days to do this many iterations. To
+    // actually run for that long would require an iterator that never set
+    // done to true and a target array which somehow never ran out of
+    // memory, e.g. a proxy that discarded the values. Ignoring this case
+    // just means we would call the callback with 2^53.
+    dcheck(k < kMaxSafeInteger);
+
+    // b. Let next be ? IteratorStep(iteratorRecord).
+    let next: JSReceiver;
+    try {
+      next = iterator::IteratorStep(iteratorRecord, fastIteratorResultMap)
+          otherwise NextIsFalse;
+    }
+    // c. If next is false, then
+    label NextIsFalse {
+      // i. Return groups.
+      return groups;
+    }
+
+    // d. Let value be ? IteratorValue(next).
+    const value = iterator::IteratorValue(next, fastIteratorResultMap);
+
+    // e. Let key be Completion(Call(callbackfn, undefined, « value, 𝔽(k) »)).
+    let key: JSAny;
+    try {
+      key = Call(context, callbackfn, Undefined, value, k);
+      key = CoerceGroupKey(key, coerceToProperty);
+    } catch (e, message) {
+      // f. and g.ii.
+      // IfAbruptCloseIterator(key, iteratorRecord).
+      iterator::IteratorCloseOnException(iteratorRecord);
+      ReThrowWithMessage(context, e, message);
+    }
+
+    // i. Perform AddValueToKeyedGroup(groups, key, value).
+    groups = collections::AddValueToKeyedGroup(groups, key, value, methodName);
+
+    // j. Set k to k + 1.
+    k += 1;
+  }
+
+  unreachable;
+}
+
+// https://tc39.es/proposal-array-grouping/#sec-group-by
+transitioning macro GroupByImpl(
+    implicit context: Context)(items: JSAny, callback: JSAny,
+    coerceToProperty: Boolean, methodName: constexpr string): OrderedHashMap {
+  // 1. Perform ? RequireObjectCoercible(items).
+  RequireObjectCoercible(items, methodName);
+
+  // 2. If IsCallable(callbackfn) is false, throw a TypeError exception.
+  const callbackfn = Cast<Callable>(callback)
+      otherwise ThrowTypeError(MessageTemplate::kCalledNonCallable, callback);
+
+  // 3. Let groups be a new empty List.
+  let groups = AllocateOrderedHashMap();
+
+  try {
+    typeswitch (items) {
+      case (array: FastJSArrayForReadWithNoCustomIteration): {
+        // Per spec, the iterator and its next method are cached up front. This
+        // means that we only need to check for no custom iteration once up
+        // front. Even though the grouping callback has arbitrary side effects,
+        // mutations to %ArrayIteratorPrototype% will not be reflected during
+        // the iteration itself. Therefore we don't need a "no custom iteration"
+        // witness.
+        let fastArrayWitness = NewFastJSArrayForReadWitness(array);
+        const stableArray = fastArrayWitness.stable;
+        let k: Smi = 0;
+
+        try {
+          while (k < stableArray.length) {
+            fastArrayWitness.Recheck() otherwise goto SlowArrayContinuation;
+            let value: JSAny;
+            try {
+              value =
+                  fastArrayWitness.LoadElementNoHole(k) otherwise IsUndefined;
+            } label IsUndefined {
+              value = Undefined;
+            }
+            const key = CoerceGroupKey(
+                Call(context, callbackfn, Undefined, value, k),
+                coerceToProperty);
+            groups = collections::AddValueToKeyedGroup(
+                groups, key, value, methodName);
+            ++k;
+          }
+        } label SlowArrayContinuation deferred {
+          // The grouping callback can mutate the array such that it is no
+          // longer fast, but it is still a JSArray. Since the spec caches the
+          // iterator up front, a fully generic fallback is not needed. Instead
+          // we encode the array iterator logic here directly for the rest of
+          // the loop.
+          while (k < stableArray.length) {
+            const value = GetProperty(stableArray, k);
+            const key = CoerceGroupKey(
+                Call(context, callbackfn, Undefined, value, k),
+                coerceToProperty);
+            groups = collections::AddValueToKeyedGroup(
+                groups, key, value, methodName);
+            ++k;
+          }
+        }
+
+        return groups;
+      }
+      case (JSAny): {
+        goto SlowGeneric;
+      }
+    }
+  } label SlowGeneric {
+    return GroupByGeneric(
+        items, groups, callbackfn, coerceToProperty, methodName);
+  }
+}
+
+transitioning javascript builtin ObjectGroupBy(
+    js-implicit context: NativeContext, receiver: JSAny)(items: JSAny,
+    callback: JSAny): JSAny {
+  // 1. Let groups be ? GroupBy(items, callbackfn, property).
+  const groups: OrderedHashMap = GroupByImpl(
+      items, callback, /* coerceToProperty */ True, 'Object.groupBy');
+
+  let iter = collections::NewUnmodifiedOrderedHashMapIterator(groups);
+
+  // 2. Let obj be OrdinaryObjectCreate(null).
+  // 3. For each Record { [[Key]], [[Elements]] } g of groups, do
+  //   a. Let elements be CreateArrayFromList(g.[[Elements]]).
+  //   b. Perform ! CreateDataPropertyOrThrow(obj, g.[[Key]], elements).
+  let properties: NameDictionary|SwissNameDictionary;
+
+  @if(V8_ENABLE_SWISS_NAME_DICTIONARY) {
+    properties =
+        AllocateSwissNameDictionary(Convert<intptr>(iter.usedCapacity));
+  }
+  @ifnot(V8_ENABLE_SWISS_NAME_DICTIONARY) {
+    properties = AllocateNameDictionary(Convert<intptr>(iter.usedCapacity));
+  }
+  const nullProtoMap = LoadSlowObjectWithNullPrototypeMap(context);
+  const obj = AllocateJSObjectFromMap(nullProtoMap, properties);
+
+  // TODO(v8:12499): Determine more specific elements map if worth it.
+  try {
+    const arrayMap = GetFastPackedElementsJSArrayMap();
+    while (true) {
+      const entry = iter.Next() otherwise Done;
+      const elements = ArrayListElements(UnsafeCast<ArrayList>(entry.value));
+      const array = NewJSArray(arrayMap, elements);
+      CreateDataProperty(obj, entry.key, array);
+    }
+  } label Done {}
+
+  // 4. Return obj.
+  return obj;
+}
diff --git a/deps/v8/src/builtins/object.tq b/deps/v8/src/builtins/object.tq
index 664b76830b9a88..8adc64564d701b 100644
--- a/deps/v8/src/builtins/object.tq
+++ b/deps/v8/src/builtins/object.tq
@@ -5,42 +5,39 @@
 #include 'src/builtins/builtins-object-gen.h'
 
 namespace runtime {
-extern transitioning runtime
-ObjectIsExtensible(implicit context: Context)(JSAny): JSAny;
+extern transitioning runtime ObjectIsExtensible(
+    implicit context: Context)(JSAny): JSAny;
 
-extern transitioning runtime
-JSReceiverPreventExtensionsThrow(implicit context: Context)(JSReceiver): JSAny;
+extern transitioning runtime JSReceiverPreventExtensionsThrow(
+    implicit context: Context)(JSReceiver): JSAny;
 
-extern transitioning runtime
-JSReceiverPreventExtensionsDontThrow(implicit context: Context)(JSReceiver):
-    JSAny;
+extern transitioning runtime JSReceiverPreventExtensionsDontThrow(
+    implicit context: Context)(JSReceiver): JSAny;
 
-extern transitioning runtime
-JSReceiverGetPrototypeOf(implicit context: Context)(JSReceiver): JSAny;
+extern transitioning runtime JSReceiverGetPrototypeOf(
+    implicit context: Context)(JSReceiver): JSAny;
 
-extern transitioning runtime
-JSReceiverSetPrototypeOfThrow(implicit context: Context)(
-    JSReceiver, JSAny): JSAny;
+extern transitioning runtime JSReceiverSetPrototypeOfThrow(
+    implicit context: Context)(JSReceiver, JSAny): JSAny;
 
-extern transitioning runtime
-JSReceiverSetPrototypeOfDontThrow(implicit context: Context)(
-    JSReceiver, JSAny): JSAny;
+extern transitioning runtime JSReceiverSetPrototypeOfDontThrow(
+    implicit context: Context)(JSReceiver, JSAny): JSAny;
 
-extern transitioning runtime ObjectCreate(implicit context: Context)(
-    JSAny, JSAny): JSAny;
+extern transitioning runtime ObjectCreate(
+    implicit context: Context)(JSAny, JSAny): JSAny;
 }  // namespace runtime
 
 namespace object {
-transitioning macro
-ObjectIsExtensibleImpl(implicit context: Context)(object: JSAny): JSAny {
+transitioning macro ObjectIsExtensibleImpl(
+    implicit context: Context)(object: JSAny): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object) otherwise return False;
   const objectJSProxy = Cast<JSProxy>(objectJSReceiver)
       otherwise return runtime::ObjectIsExtensible(objectJSReceiver);
   return proxy::ProxyIsExtensible(objectJSProxy);
 }
 
-transitioning macro
-ObjectPreventExtensionsThrow(implicit context: Context)(object: JSAny): JSAny {
+transitioning macro ObjectPreventExtensionsThrow(
+    implicit context: Context)(object: JSAny): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object) otherwise return object;
   const objectJSProxy = Cast<JSProxy>(objectJSReceiver)
       otherwise return runtime::JSReceiverPreventExtensionsThrow(objectJSReceiver);
@@ -48,9 +45,8 @@ ObjectPreventExtensionsThrow(implicit context: Context)(object: JSAny): JSAny {
   return objectJSReceiver;
 }
 
-transitioning macro
-ObjectPreventExtensionsDontThrow(implicit context: Context)(object: JSAny):
-    JSAny {
+transitioning macro ObjectPreventExtensionsDontThrow(
+    implicit context: Context)(object: JSAny): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object) otherwise return False;
   const objectJSProxy = Cast<JSProxy>(objectJSReceiver)
       otherwise return runtime::JSReceiverPreventExtensionsDontThrow(
@@ -58,22 +54,21 @@ ObjectPreventExtensionsDontThrow(implicit context: Context)(object: JSAny):
   return proxy::ProxyPreventExtensions(objectJSProxy, False);
 }
 
-transitioning macro
-ObjectGetPrototypeOfImpl(implicit context: Context)(object: JSAny): JSAny {
+transitioning macro ObjectGetPrototypeOfImpl(
+    implicit context: Context)(object: JSAny): JSAny {
   const objectJSReceiver: JSReceiver = ToObject_Inline(context, object);
   return object::JSReceiverGetPrototypeOf(objectJSReceiver);
 }
 
-transitioning macro
-JSReceiverGetPrototypeOf(implicit context: Context)(object: JSReceiver): JSAny {
+transitioning macro JSReceiverGetPrototypeOf(
+    implicit context: Context)(object: JSReceiver): JSAny {
   const objectJSProxy = Cast<JSProxy>(object)
       otherwise return runtime::JSReceiverGetPrototypeOf(object);
   return proxy::ProxyGetPrototypeOf(objectJSProxy);
 }
 
-transitioning macro
-ObjectSetPrototypeOfThrow(implicit context: Context)(
-    object: JSAny, proto: JSReceiver|Null): JSAny {
+transitioning macro ObjectSetPrototypeOfThrow(
+    implicit context: Context)(object: JSAny, proto: JSReceiver|Null): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object) otherwise return object;
   const objectJSProxy = Cast<JSProxy>(objectJSReceiver)
       otherwise return runtime::JSReceiverSetPrototypeOfThrow(
@@ -82,9 +77,8 @@ ObjectSetPrototypeOfThrow(implicit context: Context)(
   return objectJSReceiver;
 }
 
-transitioning macro
-ObjectSetPrototypeOfDontThrow(implicit context: Context)(
-    object: JSAny, proto: JSReceiver|Null): JSAny {
+transitioning macro ObjectSetPrototypeOfDontThrow(
+    implicit context: Context)(object: JSAny, proto: JSReceiver|Null): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object) otherwise return False;
   const objectJSProxy = Cast<JSProxy>(objectJSReceiver)
       otherwise return runtime::JSReceiverSetPrototypeOfDontThrow(
@@ -92,8 +86,8 @@ ObjectSetPrototypeOfDontThrow(implicit context: Context)(
   return proxy::ProxySetPrototypeOf(objectJSProxy, proto, False);
 }
 
-transitioning builtin CreateObjectWithoutProperties(implicit context: Context)(
-    prototype: JSAny): JSAny {
+transitioning builtin CreateObjectWithoutProperties(
+    implicit context: Context)(prototype: JSAny): JSAny {
   try {
     let map: Map;
     let properties: NameDictionary|SwissNameDictionary|EmptyFixedArray;
@@ -137,21 +131,20 @@ transitioning builtin CreateObjectWithoutProperties(implicit context: Context)(
 }
 
 // ES6 section 19.1.2.11 Object.isExtensible ( O )
-transitioning javascript builtin
-ObjectIsExtensible(js-implicit context: NativeContext)(object: JSAny): JSAny {
+transitioning javascript builtin ObjectIsExtensible(
+    js-implicit context: NativeContext)(object: JSAny): JSAny {
   return object::ObjectIsExtensibleImpl(object);
 }
 
 // ES6 section 19.1.2.18 Object.preventExtensions ( O )
-transitioning javascript builtin
-ObjectPreventExtensions(js-implicit context: NativeContext)(object: JSAny):
-    JSAny {
+transitioning javascript builtin ObjectPreventExtensions(
+    js-implicit context: NativeContext)(object: JSAny): JSAny {
   return object::ObjectPreventExtensionsThrow(object);
 }
 
 // ES6 section 19.1.2.9 Object.getPrototypeOf ( O )
-transitioning javascript builtin
-ObjectGetPrototypeOf(js-implicit context: NativeContext)(object: JSAny): JSAny {
+transitioning javascript builtin ObjectGetPrototypeOf(
+    js-implicit context: NativeContext)(object: JSAny): JSAny {
   return object::ObjectGetPrototypeOfImpl(object);
 }
 
@@ -225,8 +218,8 @@ const kJSAccessorPropertyDescriptorSetOffset: constexpr int31
     generates 'JSAccessorPropertyDescriptor::kSetOffset';
 
 // ToPropertyDescriptor (https://tc39.es/ecma262/#sec-topropertydescriptor)
-transitioning macro ToPropertyDescriptor(implicit context: Context)(
-    object: JSReceiver): PropertyDescriptorObject {
+transitioning macro ToPropertyDescriptor(
+    implicit context: Context)(object: JSReceiver): PropertyDescriptorObject {
   const result: PropertyDescriptorObject = AllocatePropertyDescriptorObject();
 
   if (object.map == *NativeContextSlot<Map>(
@@ -324,8 +317,9 @@ transitioning macro ToPropertyDescriptor(implicit context: Context)(
 }
 
 @export
-transitioning macro ToPropertyDescriptor(implicit context: Context)(
-    object: JSAny): PropertyDescriptorObject|Undefined {
+transitioning macro ToPropertyDescriptor(
+    implicit context: Context)(object: JSAny): PropertyDescriptorObject
+    |Undefined {
   typeswitch (object) {
     case (Undefined): {
       return Undefined;
@@ -343,8 +337,8 @@ extern transitioning macro ObjectBuiltinsAssembler::FromPropertyDescriptor(
     Context, JSAny): JSAny;
 
 @export
-transitioning macro FromPropertyDescriptor(implicit context: Context)(
-    object: JSAny): JSAny {
+transitioning macro FromPropertyDescriptor(
+    implicit context: Context)(object: JSAny): JSAny {
   return FromPropertyDescriptor(context, object);
 }
 
diff --git a/deps/v8/src/builtins/ppc/builtins-ppc.cc b/deps/v8/src/builtins/ppc/builtins-ppc.cc
index ed3fcfd55df1a8..466d799975b59a 100644
--- a/deps/v8/src/builtins/ppc/builtins-ppc.cc
+++ b/deps/v8/src/builtins/ppc/builtins-ppc.cc
@@ -87,13 +87,21 @@ void Generate_OSREntry(MacroAssembler* masm, Register entry_address,
   __ Ret();
 }
 
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array,
-                      Register scratch) {
-  DCHECK(!AreAliased(bytecode_array, scratch));
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi,
+                                Register scratch) {
+  DCHECK(!AreAliased(sfi, scratch));
   __ mov(scratch, Operand(0));
-  __ StoreU16(
-      scratch,
-      FieldMemOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset), r0);
+  __ StoreU16(scratch, FieldMemOperand(sfi, SharedFunctionInfo::kAgeOffset),
+              no_reg);
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function,
+                        Register scratch1, Register scratch2) {
+  __ LoadTaggedField(
+      scratch1,
+      FieldMemOperand(js_function, JSFunction::kSharedFunctionInfoOffset),
+      scratch2);
+  ResetSharedFunctionInfoAge(masm, scratch1, scratch2);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
@@ -103,8 +111,9 @@ void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
   __ LoadU8(scratch1,
             FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset),
             scratch2);
-  __ andi(scratch1, scratch1,
-          Operand(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ andi(
+      scratch1, scratch1,
+      Operand(static_cast<uint8_t>(~FeedbackVector::OsrUrgencyBits::kMask)));
   __ StoreU8(scratch1,
              FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset),
              scratch2);
@@ -130,6 +139,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   __ LoadTaggedField(
       code_obj, FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset),
       r0);
+
+  if (is_osr) {
+    ResetSharedFunctionInfoAge(masm, code_obj, r6);
+  }
+
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(code_obj, SharedFunctionInfo::kFunctionDataOffset), r0);
@@ -164,8 +178,9 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset),
                      r0);
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset), r0);
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset), r0);
 
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -220,9 +235,6 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   __ Push(kInterpreterAccumulatorRegister);
   __ Push(code_obj);
   {
-    Register arg_reg_1 = r3;
-    Register arg_reg_2 = r4;
-    Register arg_reg_3 = r5;
     __ mr(arg_reg_1, code_obj);
     __ mr(arg_reg_2, kInterpreterBytecodeOffsetRegister);
     __ mr(arg_reg_3, kInterpreterBytecodeArrayRegister);
@@ -231,13 +243,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     __ CallCFunction(get_baseline_pc, 3, 0);
   }
   __ Pop(code_obj);
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ AddS64(code_obj, code_obj, kReturnRegister0);
   __ Pop(kInterpreterAccumulatorRegister);
 
   if (is_osr) {
-    Register scratch = ip;
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister, scratch);
     Generate_OSREntry(masm, code_obj, 0);
   } else {
     __ Jump(code_obj);
@@ -440,10 +450,10 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
     ConstantPoolUnavailableScope constant_pool_unavailable(masm);
 
     if (V8_EMBEDDED_CONSTANT_POOL_BOOL) {
-      __ LoadConstantPoolPointerRegisterFromCodeTargetAddress(r3);
+      __ LoadConstantPoolPointerRegisterFromCodeTargetAddress(r3, r0, ip);
     }
 
-    __ LoadCodeEntry(r3, r3);
+    __ LoadCodeInstructionStart(r3, r3);
 
     // Load the OSR entrypoint offset from the deoptimization data.
     // <osr_offset> = <deopt_data>[#header_size + #osr_pc_offset]
@@ -572,19 +582,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
     __ InvokeFunctionWithNewTarget(r4, r6, r3, InvokeType::kCall);
   }
 
-  // ----------- S t a t e -------------
-  //  --                 r0: constructor result
-  //  -- sp[0*kSystemPointerSize]: implicit receiver
-  //  -- sp[1*kSystemPointerSize]: padding
-  //  -- sp[2*kSystemPointerSize]: constructor function
-  //  -- sp[3*kSystemPointerSize]: number of arguments
-  //  -- sp[4*kSystemPointerSize]: context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -752,9 +749,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     // undefined because generator functions are non-constructable.
     __ mr(r6, r4);
     __ mr(r4, r7);
-    static_assert(kJavaScriptCallCodeStartRegister == r5, "ABI mismatch");
-    __ LoadTaggedField(r5, FieldMemOperand(r4, JSFunction::kCodeOffset), r0);
-    __ JumpCodeObject(r5);
+    __ JumpJSFunction(r4, r0);
   }
 
   __ bind(&prepare_step_in_if_stepping);
@@ -1211,8 +1206,9 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset),
                      r0);
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset), r0);
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset), r0);
   __ AssertFeedbackVector(feedback_vector, r11);
 
   // Check for an tiering state.
@@ -1250,6 +1246,7 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
         BaselineOutOfLinePrologueDescriptor::kCalleeContext);
     Register callee_js_function = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kClosure);
+    ResetJSFunctionAge(masm, callee_js_function, r11, r0);
     __ Push(callee_context, callee_js_function);
     DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
     DCHECK_EQ(callee_js_function, kJSFunctionRegister);
@@ -1260,7 +1257,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // the frame, so load it into a register.
     Register bytecodeArray = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray);
-    ResetBytecodeAge(masm, bytecodeArray, r11);
 
     __ Push(argc, bytecodeArray);
 
@@ -1374,6 +1370,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // kInterpreterBytecodeArrayRegister.
   __ LoadTaggedField(
       r7, FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset), r0);
+  ResetSharedFunctionInfoAge(masm, r7, ip);
   // Load original bytecode array or the debug copy.
   __ LoadTaggedField(
       kInterpreterBytecodeArrayRegister,
@@ -1396,8 +1393,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset),
                      r0);
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset), r0);
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset), r0);
 
   Label push_stack_frame;
   // Check if feedback vector is valid. If valid, check for optimized code
@@ -1448,8 +1446,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ PushStandardFrame(closure);
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister, r8);
-
   // Load initial bytecode offset.
   __ mov(kInterpreterBytecodeOffsetRegister,
          Operand(BytecodeArray::kHeaderSize - kHeapObjectTag));
@@ -1594,9 +1590,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ LoadTaggedField(
         feedback_vector,
         FieldMemOperand(closure, JSFunction::kFeedbackCellOffset), r0);
-    __ LoadTaggedField(feedback_vector,
-                       FieldMemOperand(feedback_vector, Cell::kValueOffset),
-                       r0);
+    __ LoadTaggedField(
+        feedback_vector,
+        FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset), r0);
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1763,11 +1759,188 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   }
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- r3 : argument count
+  // -- r4 : constructor to call (checked to be a JSFunction)
+  // -- r6 : new target
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+  Register implicit_receiver = r7;
+
+  // Save live registers.
+  __ SmiTag(r3);
+  __ Push(r3, r4, r6);
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  // Save result.
+  __ Move(implicit_receiver, r3);
+  // Restore live registers.
+  __ Pop(r3, r4, r6);
+  __ SmiUntag(r3);
+
+  // Patch implicit receiver (in arguments)
+  __ StoreU64(implicit_receiver, MemOperand(sp, 0 * kSystemPointerSize), r0);
+  // Patch second implicit (in construct frame)
+  __ StoreU64(
+      implicit_receiver,
+      MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset), r0);
+
+  // Restore context.
+  __ LoadU64(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset),
+             r0);
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- r3 : argument count
+  // -- r4 : constructor to call (checked to be a JSFunction)
+  // -- r6 : new target
+  // -- r7 : address of the first argument
+  // -- cp/r30 : context pointer
+  // -----------------------------------
+  __ AssertFunction(r4);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  __ LoadMap(r5, r4);
+  __ lbz(r5, FieldMemOperand(r5, Map::kBitFieldOffset));
+  __ TestBit(r5, Map::Bits1::IsConstructorBit::kShift, r0);
+  __ beq(&non_constructor, cr0);
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(r3, r5, &stack_overflow);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+  // Implicit receiver stored in the construct frame.
+  __ LoadRoot(r5, RootIndex::kTheHoleValue);
+  __ Push(cp, r5);
+
+  // Push arguments + implicit receiver.
+  Register argc_without_receiver = r9;
+  __ SubS64(argc_without_receiver, r3, Operand(kJSArgcReceiverSlots));
+  // Push the arguments. r7 and r8 will be modified.
+  GenerateInterpreterPushArgs(masm, argc_without_receiver, r7, r8);
+  // Implicit receiver as part of the arguments (patched later if needed).
+  __ push(r5);
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  __ LoadTaggedField(
+      r5, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset), r0);
+  __ lwz(r5, FieldMemOperand(r5, SharedFunctionInfo::kFlagsOffset));
+  __ mov(ip, Operand(SharedFunctionInfo::ConstructAsBuiltinBit::kMask));
+  __ and_(r0, r5, ip, SetRC);
+  __ bne(&builtin_call, cr0);
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(r5);
+  __ JumpIfIsInRange(
+      r5, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor),
+      &not_create_implicit_receiver);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the function.
+  __ InvokeFunctionWithNewTarget(r4, r6, r3, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- r0     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label use_receiver, do_throw, leave_and_return, check_receiver;
+
+  // If the result is undefined, we jump out to using the implicit receiver.
+  __ JumpIfNotRoot(r3, RootIndex::kUndefinedValue, &check_receiver);
+
+  // Otherwise we do a smi check and fall through to check if the return value
+  // is a valid receiver.
+
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ bind(&use_receiver);
+  __ LoadU64(
+      r3, MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset),
+      r0);
+  __ JumpIfRoot(r3, RootIndex::kTheHoleValue, &do_throw);
+
+  __ bind(&leave_and_return);
+  // Leave construct frame.
+  __ LeaveFrame(StackFrame::CONSTRUCT);
+  __ blr();
+
+  __ bind(&check_receiver);
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(r3, &use_receiver);
+
+  // If the type of the result (stored in its map) is less than
+  // FIRST_JS_RECEIVER_TYPE, it is not an object in the ECMA sense.
+  static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
+  __ CompareObjectType(r3, r7, r8, FIRST_JS_RECEIVER_TYPE);
+  __ bge(&leave_and_return);
+  __ b(&use_receiver);
+
+  __ bind(&builtin_call);
+  // TODO(victorgomes): Check the possibility to turn this into a tailcall.
+  __ InvokeFunctionWithNewTarget(r4, r6, r3, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ blr();
+
+  __ bind(&do_throw);
+  // Restore the context from the frame.
+  __ LoadU64(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset),
+             r0);
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  __ bkpt(0);
+
+  __ bind(&stack_overflow);
+  // Restore the context from the frame.
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  // Unreachable code.
+  __ bkpt(0);
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Set the return address to the correct point in the interpreter entry
   // trampoline.
   Label builtin_trampoline, trampoline_loaded;
-  Smi interpreter_entry_return_pc_offset(
+  Tagged<Smi> interpreter_entry_return_pc_offset(
       masm->isolate()->heap()->interpreter_entry_return_pc_offset());
   DCHECK_NE(interpreter_entry_return_pc_offset, Smi::zero());
 
@@ -1788,7 +1961,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   __ LoadTaggedField(
       r5, FieldMemOperand(r5, InterpreterData::kInterpreterTrampolineOffset),
       r0);
-  __ LoadCodeEntry(r5, r5);
+  __ LoadCodeInstructionStart(r5, r5);
   __ b(&trampoline_loaded);
 
   __ bind(&builtin_trampoline);
@@ -1950,7 +2123,7 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
           Operand(BuiltinContinuationFrameConstants::kFixedFrameSizeFromFp));
   __ Pop(r0);
   __ mtlr(r0);
-  __ LoadEntryFromBuiltinIndex(builtin);
+  __ LoadEntryFromBuiltinIndex(builtin, builtin);
   __ Jump(builtin);
 }
 }  // namespace
@@ -2225,7 +2398,7 @@ void Generate_AllocateSpaceAndShiftExistingArguments(
 }  // namespace
 
 // static
-// TODO(v8:11615): Observe InstructionStream::kMaxArguments in
+// TODO(v8:11615): Observe Code::kMaxArguments in
 // CallOrConstructVarargs
 void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
                                                Handle<Code> code) {
@@ -2425,7 +2598,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ LoadGlobalProxy(r6);
     } else {
       Label convert_to_object, convert_receiver;
-      __ LoadReceiver(r6, r3);
+      __ LoadReceiver(r6);
       __ JumpIfSmi(r6, &convert_to_object);
       static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
       __ CompareObjectType(r6, r7, r7, FIRST_JS_RECEIVER_TYPE);
@@ -2462,7 +2635,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
           r5, FieldMemOperand(r4, JSFunction::kSharedFunctionInfoOffset), r0);
       __ bind(&convert_receiver);
     }
-    __ StoreReceiver(r6, r3, r7);
+    __ StoreReceiver(r6);
   }
   __ bind(&done_convert);
 
@@ -2563,7 +2736,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
   // Patch the receiver to [[BoundThis]].
   __ LoadTaggedField(r6, FieldMemOperand(r4, JSBoundFunction::kBoundThisOffset),
                      r0);
-  __ StoreReceiver(r6, r3, ip);
+  __ StoreReceiver(r6);
 
   // Push the [[BoundArguments]] onto the stack.
   Generate_PushBoundArguments(masm);
@@ -2581,11 +2754,10 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   //  -- r3 : the number of arguments
   //  -- r4 : the target to call (can be any Object).
   // -----------------------------------
-  Register argc = r3;
   Register target = r4;
   Register map = r7;
   Register instance_type = r8;
-  DCHECK(!AreAliased(argc, target, map, instance_type));
+  DCHECK(!AreAliased(r3, target, map, instance_type));
 
   Label non_callable, class_constructor;
   __ JumpIfSmi(target, &non_callable);
@@ -2626,7 +2798,7 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   // 2. Call to something else, which might have a [[Call]] internal method (if
   // not we raise an exception).
   // Overwrite the original receiver the (original) target.
-  __ StoreReceiver(target, argc, r8);
+  __ StoreReceiver(target);
   // Let the "call_as_function_delegate" take care of the rest.
   __ LoadNativeContextSlot(target, Context::CALL_AS_FUNCTION_DELEGATE_INDEX);
   __ Jump(masm->isolate()->builtins()->CallFunction(
@@ -2719,11 +2891,10 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   //  -- r6 : the new target (either the same as the constructor or
   //          the JSFunction on which new was invoked initially)
   // -----------------------------------
-  Register argc = r3;
   Register target = r4;
   Register map = r7;
   Register instance_type = r8;
-  DCHECK(!AreAliased(argc, target, map, instance_type));
+  DCHECK(!AreAliased(r3, target, map, instance_type));
 
   // Check if target is a Smi.
   Label non_constructor, non_proxy;
@@ -2733,7 +2904,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ LoadTaggedField(map, FieldMemOperand(target, HeapObject::kMapOffset), r0);
   {
     Register flags = r5;
-    DCHECK(!AreAliased(argc, target, map, instance_type, flags));
+    DCHECK(!AreAliased(r3, target, map, instance_type, flags));
     __ lbz(flags, FieldMemOperand(map, Map::kBitFieldOffset));
     __ TestBit(flags, Map::Bits1::IsConstructorBit::kShift, r0);
     __ beq(&non_constructor, cr0);
@@ -2761,7 +2932,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ bind(&non_proxy);
   {
     // Overwrite the original receiver with the (original) target.
-    __ StoreReceiver(target, argc, r8);
+    __ StoreReceiver(target);
     // Let the "call_as_constructor_delegate" take care of the rest.
     __ LoadNativeContextSlot(target,
                              Context::CALL_AS_CONSTRUCTOR_DELEGATE_INDEX);
@@ -2934,15 +3105,11 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
   __ Ret();
 }
 
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
-  // TODO(v8:10701): Implement for this platform.
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
   __ Trap();
 }
 
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
-  // TODO(v8:12191): Implement for this platform.
-  __ Trap();
-}
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) { __ Trap(); }
 
 void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   // TODO(v8:12191): Implement for this platform.
@@ -2963,10 +3130,13 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
   // Only needed on x64.
   __ Trap();
 }
+
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) { __ Trap(); }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   // Called from JavaScript; parameters are on stack as if calling JS function.
   // r3: number of arguments including receiver
   // r4: pointer to builtin function
@@ -3255,210 +3425,121 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ Ret();
 }
 
-namespace {
-
-static int AddressOffset(ExternalReference ref0, ExternalReference ref1) {
-  return ref0.address() - ref1.address();
-}
-
-
-// Calls an API function.  Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.  Restores context.  stack_space
-// - space to be unwound on exit (includes the call JS arguments space and
-// the additional space allocated for the fast call).
-static void CallApiFunctionAndReturn(MacroAssembler* masm,
-                                     Register function_address,
-                                     ExternalReference thunk_ref,
-                                     int stack_space,
-                                     MemOperand* stack_space_operand,
-                                     MemOperand return_value_operand) {
-  Isolate* isolate = masm->isolate();
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  const int kNextOffset = 0;
-  const int kLimitOffset = AddressOffset(
-      ExternalReference::handle_scope_limit_address(isolate), next_address);
-  const int kLevelOffset = AddressOffset(
-      ExternalReference::handle_scope_level_address(isolate), next_address);
-
-  // Additional parameter is the address of the actual callback.
-  DCHECK(function_address == r4 || function_address == r5);
-  Register scratch = r6;
-
-  // Allocate HandleScope in callee-save registers.
-  // r17 - next_address
-  // r14 - next_address->kNextOffset
-  // r15 - next_address->kLimitOffset
-  // r16 - next_address->kLevelOffset
-  __ Move(r17, next_address);
-  __ LoadU64(r14, MemOperand(r17, kNextOffset));
-  __ LoadU64(r15, MemOperand(r17, kLimitOffset));
-  __ lwz(r16, MemOperand(r17, kLevelOffset));
-  __ addi(r16, r16, Operand(1));
-  __ stw(r16, MemOperand(r17, kLevelOffset));
-
-  Label profiler_enabled, done_api_call;
-  __ lbz(scratch,
-         __ ExternalReferenceAsOperand(
-             ExternalReference::is_profiling_address(isolate), scratch));
-  __ cmpi(scratch, Operand::Zero());
-  __ bne(&profiler_enabled);
-#ifdef V8_RUNTIME_CALL_STATS
-  __ Move(scratch, ExternalReference::address_of_runtime_stats_flag());
-  __ lwz(scratch, MemOperand(scratch, 0));
-  __ cmpi(scratch, Operand::Zero());
-  __ bne(&profiler_enabled);
-#endif  // V8_RUNTIME_CALL_STATS
-
-  // Call the api function directly.
-  __ StoreReturnAddressAndCall(function_address);
-  __ bind(&done_api_call);
-
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-  Label return_value_loaded;
-
-  // load value from ReturnValue
-  __ LoadU64(r3, return_value_operand);
-  __ bind(&return_value_loaded);
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ StoreU64(r14, MemOperand(r17, kNextOffset));
-  if (v8_flags.debug_code) {
-    __ lwz(r4, MemOperand(r17, kLevelOffset));
-    __ CmpS64(r4, r16);
-    __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall);
-  }
-  __ subi(r16, r16, Operand(1));
-  __ stw(r16, MemOperand(r17, kLevelOffset));
-  __ LoadU64(r0, MemOperand(r17, kLimitOffset));
-  __ CmpS64(r15, r0);
-  __ bne(&delete_allocated_handles);
-
-  // Leave the API exit frame.
-  __ bind(&leave_exit_frame);
-  // LeaveExitFrame expects unwind space to be in a register.
-  if (stack_space_operand != nullptr) {
-    __ LoadU64(r14, *stack_space_operand);
-  } else {
-    __ mov(r14, Operand(stack_space));
-  }
-  __ LeaveExitFrame(r14, stack_space_operand != nullptr);
-
-  // Check if the function scheduled an exception.
-  __ LoadRoot(r14, RootIndex::kTheHoleValue);
-  __ Move(r15, ExternalReference::scheduled_exception_address(isolate));
-  __ LoadU64(r15, MemOperand(r15));
-  __ CmpS64(r14, r15);
-  __ bne(&promote_scheduled_exception);
-
-  __ blr();
-
-  // Call the api function via thunk wrapper.
-  __ bind(&profiler_enabled);
-  // Additional parameter is the address of the actual callback.
-  __ Move(r6, function_address);
-  __ Move(ip, thunk_ref);
-  __ StoreReturnAddressAndCall(ip);
-  __ b(&done_api_call);
-
-  // Re-throw by promoting a scheduled exception.
-  __ bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  __ bind(&delete_allocated_handles);
-  __ StoreU64(r15, MemOperand(r17, kLimitOffset));
-  __ mr(r14, r3);
-  __ PrepareCallCFunction(1, r15);
-  __ Move(r3, ExternalReference::isolate_address(isolate));
-  __ CallCFunction(ExternalReference::delete_handle_scope_extensions(), 1);
-  __ mr(r3, r14);
-  __ b(&leave_exit_frame);
-}
-
-MemOperand ExitFrameStackSlotOperand(int offset) {
-  static constexpr int kFrameOffset = 1 * kSystemPointerSize;
-  return MemOperand(sp, (kStackFrameExtraParamSlot * kSystemPointerSize) +
-                            offset + kFrameOffset);
-}
-
-MemOperand ExitFrameCallerStackSlotOperand(int index) {
-  return MemOperand(
-      fp, (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
-              kSystemPointerSize);
-}
-
-}  // namespace
-
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- cp                  : context
+  // CallApiCallbackMode::kGeneric mode:
+  //  -- r5                  : arguments count (not including the receiver)
+  //  -- r6                  : call handler info
+  //  -- r3                  : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
   //  -- r4                  : api function address
   //  -- r5                  : arguments count (not including the receiver)
   //  -- r6                  : call data
   //  -- r3                  : holder
+  // Both modes:
+  //  -- cp                  : context
   //  -- sp[0]               : receiver
   //  -- sp[8]               : first argument
   //  -- ...
   //  -- sp[(argc) * 8]      : last argument
   // -----------------------------------
 
-  Register api_function_address = r4;
-  Register argc = r5;
-  Register call_data = r6;
-  Register holder = r3;
+  Register function_callback_info_arg = arg_reg_1;
+
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register callback = no_reg;
+  Register holder = no_reg;
   Register scratch = r7;
-  DCHECK(!AreAliased(api_function_address, argc, call_data, holder, scratch));
+  Register scratch2 = r8;
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = r4;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, holder, call_data, callback,
+                     scratch, scratch2));
 
-  using FCI = FunctionCallbackInfo<v8::Value>;
   using FCA = FunctionCallbackArguments;
 
   static_assert(FCA::kArgsLength == 6);
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
   // Set up FunctionCallbackInfo's implicit_args on the stack as follows:
   //
   // Target state:
-  //   sp[0 * kSystemPointerSize]: kHolder   <= FCI::implicit_args_
-  //   sp[1 * kSystemPointerSize]: kIsolate
-  //   sp[2 * kSystemPointerSize]: undefined (kReturnValueDefaultValue)
-  //   sp[3 * kSystemPointerSize]: undefined (kReturnValue)
-  //   sp[4 * kSystemPointerSize]: kData
-  //   sp[5 * kSystemPointerSize]: undefined (kNewTarget)
+  //   sp[1 * kSystemPointerSize]: kHolder   <= FCA::implicit_args_
+  //   sp[2 * kSystemPointerSize]: kIsolate
+  //   sp[3 * kSystemPointerSize]: Smi::zero(padding, unused)
+  //   sp[4 * kSystemPointerSize]: undefined (kReturnValue)
+  //   sp[5 * kSystemPointerSize]: kData
+  //   sp[6 * kSystemPointerSize]: undefined (kNewTarget)
   // Existing state:
-  //   sp[6 * kSystemPointerSize]:            <= FCI:::values_
+  //   sp[7 * kSystemPointerSize]:            <= FCA:::values_
 
   // Reserve space on the stack.
   __ subi(sp, sp, Operand(FCA::kArgsLength * kSystemPointerSize));
 
   // kHolder.
-  __ StoreU64(holder, MemOperand(sp, 0 * kSystemPointerSize));
+  __ StoreU64(holder, MemOperand(sp, FCA::kHolderIndex * kSystemPointerSize));
 
   // kIsolate.
   __ Move(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ StoreU64(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+  __ StoreU64(scratch, MemOperand(sp, FCA::kIsolateIndex * kSystemPointerSize));
+
+  // kUnused
+  __ Move(scratch, Smi::zero());
+  __ StoreU64(scratch, MemOperand(sp, FCA::kUnusedIndex * kSystemPointerSize));
 
-  // kReturnValueDefaultValue and kReturnValue.
+  // kReturnValue.
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ StoreU64(scratch, MemOperand(sp, 2 * kSystemPointerSize));
-  __ StoreU64(scratch, MemOperand(sp, 3 * kSystemPointerSize));
+  __ StoreU64(scratch,
+              MemOperand(sp, FCA::kReturnValueIndex * kSystemPointerSize));
 
   // kData.
-  __ StoreU64(call_data, MemOperand(sp, 4 * kSystemPointerSize));
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ LoadTaggedField(
+          scratch2, FieldMemOperand(callback, CallHandlerInfo::kDataOffset),
+          r0);
+      __ StoreU64(scratch2,
+                  MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ StoreU64(call_data,
+                  MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+  }
 
   // kNewTarget.
-  __ StoreU64(scratch, MemOperand(sp, 5 * kSystemPointerSize));
+  __ StoreU64(scratch,
+              MemOperand(sp, FCA::kNewTargetIndex * kSystemPointerSize));
 
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  __ mr(scratch, sp);
+  __ mr(holder, sp);
 
   // Allocate the v8::Arguments structure in the arguments' space since
   // it's not controlled by GC.
@@ -3468,55 +3549,111 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   //    [0] space for DirectCEntryStub's LR save
   //    [1-3] FunctionCallbackInfo
   //    [4] number of bytes to drop from the stack after returning
-  static constexpr int kSlotsToDropSize = 1 * kSystemPointerSize;
+  static constexpr int kSlotsToDropOnStackSize = 1 * kSystemPointerSize;
   static constexpr int kApiStackSpace = 5;
-  static_assert(FCI::kImplicitArgsOffset == 0);
-  static_assert(FCI::kValuesOffset == 1 * kSystemPointerSize);
-  static_assert(FCI::kLengthOffset == 2 * kSystemPointerSize);
+  static_assert(FCA::kImplicitArgsOffset == 0);
+  static_assert(FCA::kValuesOffset == 1 * kSystemPointerSize);
+  static_assert(FCA::kLengthOffset == 2 * kSystemPointerSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
 
   FrameScope frame_scope(masm, StackFrame::MANUAL);
-  __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+    __ AllocateStackSpace(exit_frame_params_count * kSystemPointerSize);
+
+    // No padding is required.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize == 0);
+
+    // Context parameter.
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ StoreU64(kContextRegister, MemOperand(sp, 2 * kSystemPointerSize));
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ SmiTag(scratch, argc);
+    __ StoreU64(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ LoadTaggedField(
+        scratch,
+        FieldMemOperand(callback, CallHandlerInfo::kOwnerTemplateOffset), r0);
+    __ StoreU64(scratch, MemOperand(sp, 0 * kSystemPointerSize));
 
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  // Arguments are after the return address (pushed by EnterExitFrame()).
-  __ StoreU64(scratch, ExitFrameStackSlotOperand(FCI::kImplicitArgsOffset));
+    __ LoadU64(api_function_address,
+               FieldMemOperand(callback,
+                               CallHandlerInfo::kMaybeRedirectedCallbackOffset),
+               r0);
 
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  __ addi(scratch, scratch,
-          Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
-  __ StoreU64(scratch, ExitFrameStackSlotOperand(FCI::kValuesOffset));
+    __ EnterExitFrame(kApiStackSpace, StackFrame::API_CALLBACK_EXIT);
+  } else {
+    __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  }
 
-  // FunctionCallbackInfo::length_.
-  __ stw(argc, ExitFrameStackSlotOperand(FCI::kLengthOffset));
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    // Arguments are after the return address (pushed by EnterExitFrame()).
+    __ StoreU64(holder, ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset));
+
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ addi(holder, holder,
+            Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
+    __ StoreU64(holder, ExitFrameStackSlotOperand(FCA::kValuesOffset));
+
+    // FunctionCallbackInfo::length_.
+    __ stw(argc, ExitFrameStackSlotOperand(FCA::kLengthOffset));
+  }
 
   // We also store the number of bytes to drop from the stack after returning
   // from the API function here.
   MemOperand stack_space_operand =
-      ExitFrameStackSlotOperand(FCI::kLengthOffset + kSlotsToDropSize);
-  __ mov(scratch,
-         Operand((FCA::kArgsLength + 1 /* receiver */) * kSystemPointerSize));
+      ExitFrameStackSlotOperand(FCA::kLengthOffset + kSlotsToDropOnStackSize);
+  __ mov(scratch, Operand((FCA::kArgsLength + 1 /* receiver */ +
+                           exit_frame_params_count) *
+                          kSystemPointerSize));
   __ ShiftLeftU64(ip, argc, Operand(kSystemPointerSizeLog2));
   __ add(scratch, scratch, ip);
   __ StoreU64(scratch, stack_space_operand);
 
-  // v8::InvocationCallback's argument.
-  __ addi(r3, sp,
+  __ RecordComment("v8::FunctionCallback's argument");
+  __ addi(function_callback_info_arg, sp,
           Operand((kStackFrameExtraParamSlot + 1) * kSystemPointerSize));
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
-  MemOperand return_value_operand =
-      ExitFrameCallerStackSlotOperand(FCA::kReturnValueIndex);
+  DCHECK(!AreAliased(api_function_address, function_callback_info_arg));
+
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
+
+  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
   static constexpr int kUseStackSpaceOperand = 0;
 
-  AllowExternalCallThatCantCauseGC scope(masm);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kUseStackSpaceOperand, &stack_space_operand,
-                           return_value_operand);
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseStackSpaceOperand,
+                           &stack_space_operand, return_value_operand);
 }
 
-
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- cp                  : context
+  //  -- r4                  : receiver
+  //  -- r6                  : accessor info
+  //  -- r3                  : holder
+  // -----------------------------------
+
   int arg0Slot = 0;
   int accessorInfoSlot = 0;
   int apiStackSpace = 0;
@@ -3526,41 +3663,56 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
   static_assert(PCA::kShouldThrowOnErrorIndex == 0);
   static_assert(PCA::kHolderIndex == 1);
   static_assert(PCA::kIsolateIndex == 2);
-  static_assert(PCA::kReturnValueDefaultValueIndex == 3);
+  static_assert(PCA::kUnusedIndex == 3);
   static_assert(PCA::kReturnValueIndex == 4);
   static_assert(PCA::kDataIndex == 5);
   static_assert(PCA::kThisIndex == 6);
   static_assert(PCA::kArgsLength == 7);
 
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  // Target state:
+  //   sp[0 * kSystemPointerSize]: name
+  //   sp[1 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   sp[2 * kSystemPointerSize]: kHolderIndex
+  //   sp[3 * kSystemPointerSize]: kIsolateIndex
+  //   sp[4 * kSystemPointerSize]: kUnusedIndex
+  //   sp[5 * kSystemPointerSize]: kReturnValueIndex
+  //   sp[6 * kSystemPointerSize]: kDataIndex
+  //   sp[7 * kSystemPointerSize]: kThisIndex / receiver
+
+  Register name_arg = arg_reg_1;
+  Register property_callback_info_arg = arg_reg_2;
+
+  Register api_function_address = r5;
   Register receiver = ApiGetterDescriptor::ReceiverRegister();
   Register holder = ApiGetterDescriptor::HolderRegister();
   Register callback = ApiGetterDescriptor::CallbackRegister();
   Register scratch = r7;
-  DCHECK(!AreAliased(receiver, holder, callback, scratch));
-
-  Register api_function_address = r5;
+  Register smi_zero = r8;
+  DCHECK(!AreAliased(receiver, holder, callback, scratch, smi_zero));
 
-  __ push(receiver);
-  // Push data from AccessorInfo.
   __ LoadTaggedField(scratch,
                      FieldMemOperand(callback, AccessorInfo::kDataOffset), r0);
-  __ push(scratch);
+  __ Push(receiver, scratch);  // kThisIndex, kDataIndex
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ Push(scratch, scratch);
+  __ Move(smi_zero, Smi::zero());
+  __ Push(scratch, smi_zero);  // kReturnValueIndex, kUnusedIndex
   __ Move(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ Push(scratch, holder);
-  __ Push(Smi::zero());  // should_throw_on_error -> false
+  __ Push(scratch, holder);  // kIsolateIndex, kHolderIndex
+
   __ LoadTaggedField(scratch,
                      FieldMemOperand(callback, AccessorInfo::kNameOffset), r0);
-  __ push(scratch);
+  __ Push(smi_zero, scratch);  // should_throw_on_error -> false, name
 
-  // v8::PropertyCallbackInfo::args_ array and name handle.
-  constexpr int kNameHandleStackSize = 1;
-  constexpr int kStackUnwindSpace = PCA::kArgsLength + kNameHandleStackSize;
+  __ RecordComment(
+      "Load address of v8::PropertyAccessorInfo::args_ array and name handle.");
 
   // Load address of v8::PropertyAccessorInfo::args_ array and name handle.
-  __ mr(r3, sp);                               // r3 = Handle<Name>
-  __ addi(r4, r3, Operand(1 * kSystemPointerSize));  // r4 = v8::PCI::args_
+  // name_arg = Handle<Name>(&name), name value was pushed to GC-ed stack space.
+  __ mr(name_arg, sp);
+  // property_callback_info_arg = v8::PCI::args_ (= &ShouldThrow)
+  __ addi(property_callback_info_arg, name_arg,
+          Operand(1 * kSystemPointerSize));
 
   // If ABI passes Handles (pointer-sized struct) in a register:
   //
@@ -3583,6 +3735,9 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
     apiStackSpace = 3;
   }
 
+  constexpr int kNameOnStackSize = 1;
+  constexpr int kStackUnwindSpace = PCA::kArgsLength + kNameOnStackSize;
+
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ EnterExitFrame(apiStackSpace, StackFrame::EXIT);
 
@@ -3592,24 +3747,37 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
     __ addi(r3, sp, Operand(arg0Slot * kSystemPointerSize));
   }
 
-  // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // it's args_ field.
-  __ StoreU64(r4, MemOperand(sp, accessorInfoSlot * kSystemPointerSize));
-  __ addi(r4, sp, Operand(accessorInfoSlot * kSystemPointerSize));
-  // r4 = v8::PropertyCallbackInfo&
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
+  // Initialize v8::PropertyCallbackInfo::args_ field.
+  __ StoreU64(property_callback_info_arg,
+              MemOperand(sp, accessorInfoSlot * kSystemPointerSize));
+  // property_callback_info_arg = v8::PropertyCallbackInfo&
+  __ addi(property_callback_info_arg, sp,
+          Operand(accessorInfoSlot * kSystemPointerSize));
 
-  ExternalReference thunk_ref =
-      ExternalReference::invoke_accessor_getter_callback();
+  __ RecordComment("Load api_function_address");
   __ LoadU64(
       api_function_address,
       FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset),
       r0);
+
+  DCHECK(
+      !AreAliased(api_function_address, property_callback_info_arg, name_arg));
+
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_accessor_getter_callback();
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
+
   MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
-      PCA::kReturnValueIndex + kNameHandleStackSize);
+      PCA::kReturnValueIndex + kNameOnStackSize);
   MemOperand* const kUseStackSpaceConstant = nullptr;
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           return_value_operand);
+
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
diff --git a/deps/v8/src/builtins/profile-data-reader.cc b/deps/v8/src/builtins/profile-data-reader.cc
index 8024666b47d5cd..22c5c6c0f4539c 100644
--- a/deps/v8/src/builtins/profile-data-reader.cc
+++ b/deps/v8/src/builtins/profile-data-reader.cc
@@ -33,6 +33,12 @@ class ProfileDataFromFileInternal : public ProfileDataFromFile {
         std::make_pair(true_block_id, false_block_id), hint != 0));
   }
 
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+  void AddBlockExecutionCount(size_t block_id, uint64_t executed_count) {
+    executed_count_.emplace(block_id, executed_count);
+  }
+#endif
+
  private:
   bool hash_has_value_ = false;
 };
@@ -46,6 +52,56 @@ EnsureInitProfileData() {
 
   if (initialized) return *data.get();
   initialized = true;
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+  if (v8_flags.turbo_log_builtins_count_input) {
+    std::ifstream raw_count_file(
+        v8_flags.turbo_log_builtins_count_input.value());
+    CHECK_WITH_MSG(raw_count_file.good(),
+                   "Can't read raw count file for log builtin hotness.");
+    for (std::string line; std::getline(raw_count_file, line);) {
+      std::string token;
+      std::istringstream line_stream(line);
+      if (!std::getline(line_stream, token, '\t')) continue;
+      if (token == ProfileDataFromFileConstants::kBlockCounterMarker) {
+        // Any line starting with kBlockCounterMarker is a basic block execution
+        // count. The format is:
+        //   literal kBlockCounterMarker \t builtin_name \t block_id \t count
+        std::string builtin_name;
+        CHECK(std::getline(line_stream, builtin_name, '\t'));
+        std::string block_id_str;
+        CHECK(std::getline(line_stream, block_id_str, '\t'));
+        char* end = nullptr;
+        errno = 0;
+        uint32_t block_id =
+            static_cast<uint32_t>(strtoul(block_id_str.c_str(), &end, 10));
+        CHECK(errno == 0);
+        std::string executed_count_str;
+        CHECK(std::getline(line_stream, executed_count_str, '\t'));
+        uint64_t executed_count = static_cast<uint64_t>(
+            strtoul(executed_count_str.c_str(), &end, 10));
+        CHECK(errno == 0 && end != token.c_str());
+        std::getline(line_stream, token, '\t');
+        ProfileDataFromFileInternal& block_count = (*data.get())[builtin_name];
+        block_count.AddBlockExecutionCount(block_id, executed_count);
+        CHECK(line_stream.eof());
+      } else if (token == ProfileDataFromFileConstants::kBuiltinHashMarker) {
+        // Any line starting with kBuiltinHashMarker is a function hash record.
+        // As defined by V8FileLogger::BuiltinHashEvent, the format is:
+        //   literal kBuiltinHashMarker \t builtin_name \t hash
+        std::string builtin_name;
+        CHECK(std::getline(line_stream, builtin_name, '\t'));
+        std::getline(line_stream, token, '\t');
+        CHECK(line_stream.eof());
+        char* end = nullptr;
+        int hash = static_cast<int>(strtol(token.c_str(), &end, 0));
+        CHECK(errno == 0 && end != token.c_str());
+        ProfileDataFromFileInternal& block_count = (*data.get())[builtin_name];
+        CHECK_IMPLIES(block_count.hash_has_value(), block_count.hash() == hash);
+        block_count.set_hash(hash);
+      }
+    }
+  }
+#endif
   const char* filename = v8_flags.turbo_profiling_input;
   if (filename == nullptr) return *data.get();
   std::ifstream file(filename);
@@ -101,7 +157,6 @@ EnsureInitProfileData() {
     // Every function is required to have a hash in the log.
     CHECK(pair.second.hash_has_value());
   }
-
   return *data.get();
 }
 
diff --git a/deps/v8/src/builtins/profile-data-reader.h b/deps/v8/src/builtins/profile-data-reader.h
index bd49b39c75a7b5..9e91a30af102ed 100644
--- a/deps/v8/src/builtins/profile-data-reader.h
+++ b/deps/v8/src/builtins/profile-data-reader.h
@@ -31,6 +31,13 @@ class ProfileDataFromFile {
     return BranchHint::kNone;
   }
 
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+  uint64_t GetExecutedCount(size_t block_id) const {
+    if (executed_count_.count(block_id) == 0) return 0;
+    return executed_count_.at(block_id);
+  }
+#endif
+
   // Load basic block profiling data for the builtin with the given name, if
   // such data exists. The returned vector is indexed by block ID, and its
   // values are the number of times each block was executed while profiling.
@@ -43,6 +50,10 @@ class ProfileDataFromFile {
   // the branch condition. The vector is indexed by the basic block ids of
   // the two destinations of the branch.
   std::map<std::pair<size_t, size_t>, bool> block_hints_by_id;
+
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+  std::unordered_map<size_t, uint64_t> executed_count_;
+#endif
 };
 
 // The following strings can't be static members of ProfileDataFromFile until
diff --git a/deps/v8/src/builtins/promise-abstract-operations.tq b/deps/v8/src/builtins/promise-abstract-operations.tq
index 2e2dd0e1ef71e9..047c94578d5c3e 100644
--- a/deps/v8/src/builtins/promise-abstract-operations.tq
+++ b/deps/v8/src/builtins/promise-abstract-operations.tq
@@ -6,20 +6,20 @@
 #include 'src/builtins/builtins-promise-gen.h'
 
 namespace runtime {
-extern transitioning runtime
-RejectPromise(implicit context: Context)(JSPromise, JSAny, Boolean): JSAny;
+extern transitioning runtime RejectPromise(
+    implicit context: Context)(JSPromise, JSAny, Boolean): JSAny;
 
-extern transitioning runtime
-PromiseRevokeReject(implicit context: Context)(JSPromise): JSAny;
+extern transitioning runtime PromiseRevokeReject(
+    implicit context: Context)(JSPromise): JSAny;
 
-extern transitioning runtime
-PromiseRejectAfterResolved(implicit context: Context)(JSPromise, JSAny): JSAny;
+extern transitioning runtime PromiseRejectAfterResolved(
+    implicit context: Context)(JSPromise, JSAny): JSAny;
 
-extern transitioning runtime
-PromiseResolveAfterResolved(implicit context: Context)(JSPromise, JSAny): JSAny;
+extern transitioning runtime PromiseResolveAfterResolved(
+    implicit context: Context)(JSPromise, JSAny): JSAny;
 
-extern transitioning runtime
-PromiseRejectEventFromStack(implicit context: Context)(JSPromise, JSAny): JSAny;
+extern transitioning runtime PromiseRejectEventFromStack(
+    implicit context: Context)(JSPromise, JSAny): JSAny;
 }
 
 // https://tc39.es/ecma262/#sec-promise-abstract-operations
@@ -40,14 +40,12 @@ extern macro AllocateFunctionWithMapAndContext(
 extern macro PromiseReactionMapConstant(): Map;
 extern macro PromiseFulfillReactionJobTaskMapConstant(): Map;
 extern macro PromiseRejectReactionJobTaskMapConstant(): Map;
-extern transitioning builtin
-ResolvePromise(Context, JSPromise, JSAny): JSAny;
+extern transitioning builtin ResolvePromise(Context, JSPromise, JSAny): JSAny;
 
-extern transitioning builtin
-EnqueueMicrotask(Context, Microtask): Undefined;
+extern transitioning builtin EnqueueMicrotask(Context, Microtask): Undefined;
 
-macro
-ExtractHandlerContextInternal(implicit context: Context)(
+macro ExtractHandlerContextInternal(
+    implicit context: Context)(
     handler: Callable|Undefined): Context labels NotFound {
   let iter: JSAny = handler;
   while (true) {
@@ -69,9 +67,8 @@ ExtractHandlerContextInternal(implicit context: Context)(
   goto NotFound;
 }
 
-macro
-ExtractHandlerContext(implicit context: Context)(handler: Callable|
-                                                 Undefined): Context {
+macro ExtractHandlerContext(
+    implicit context: Context)(handler: Callable|Undefined): Context {
   try {
     return ExtractHandlerContextInternal(handler) otherwise NotFound;
   } label NotFound deferred {
@@ -79,9 +76,9 @@ ExtractHandlerContext(implicit context: Context)(handler: Callable|
   }
 }
 
-macro
-ExtractHandlerContext(implicit context: Context)(
-    primary: Callable|Undefined, secondary: Callable|Undefined): Context {
+macro ExtractHandlerContext(
+    implicit context: Context)(primary: Callable|Undefined,
+    secondary: Callable|Undefined): Context {
   try {
     return ExtractHandlerContextInternal(primary) otherwise NotFound;
   } label NotFound deferred {
@@ -91,9 +88,9 @@ ExtractHandlerContext(implicit context: Context)(
   }
 }
 
-transitioning macro MorphAndEnqueuePromiseReaction(implicit context: Context)(
-    promiseReaction: PromiseReaction, argument: JSAny,
-    reactionType: constexpr PromiseReactionType): void {
+transitioning macro MorphAndEnqueuePromiseReaction(
+    implicit context: Context)(promiseReaction: PromiseReaction,
+    argument: JSAny, reactionType: constexpr PromiseReactionType): void {
   let primaryHandler: Callable|Undefined;
   let secondaryHandler: Callable|Undefined;
   if constexpr (reactionType == kPromiseReactionFulfill) {
@@ -148,9 +145,9 @@ transitioning macro MorphAndEnqueuePromiseReaction(implicit context: Context)(
 }
 
 // https://tc39.es/ecma262/#sec-triggerpromisereactions
-transitioning macro TriggerPromiseReactions(implicit context: Context)(
-    reactions: Zero|PromiseReaction, argument: JSAny,
-    reactionType: constexpr PromiseReactionType): void {
+transitioning macro TriggerPromiseReactions(
+    implicit context: Context)(reactions: Zero|PromiseReaction,
+    argument: JSAny, reactionType: constexpr PromiseReactionType): void {
   // We need to reverse the {reactions} here, since we record them on the
   // JSPromise in the reverse order.
   let current = reactions;
@@ -190,9 +187,8 @@ transitioning macro TriggerPromiseReactions(implicit context: Context)(
 }
 
 // https://tc39.es/ecma262/#sec-fulfillpromise
-transitioning builtin
-FulfillPromise(implicit context: Context)(
-    promise: JSPromise, value: JSAny): Undefined {
+transitioning builtin FulfillPromise(
+    implicit context: Context)(promise: JSPromise, value: JSAny): Undefined {
   // Assert: The value of promise.[[PromiseState]] is "pending".
   dcheck(promise.Status() == PromiseState::kPending);
 
@@ -223,9 +219,9 @@ extern macro PromiseBuiltinsAssembler::
         bool;
 
 // https://tc39.es/ecma262/#sec-rejectpromise
-transitioning builtin
-RejectPromise(implicit context: Context)(
-    promise: JSPromise, reason: JSAny, debugEvent: Boolean): JSAny {
+transitioning builtin RejectPromise(
+    implicit context: Context)(promise: JSPromise, reason: JSAny,
+    debugEvent: Boolean): JSAny {
   const promiseHookFlags = PromiseHookFlags();
 
   // If promise hook is enabled or the debugger is active, let
@@ -266,7 +262,7 @@ const kPromiseCapabilitySize:
 
 type PromiseResolvingFunctionContext extends FunctionContext;
 extern enum PromiseResolvingFunctionContextSlot extends intptr
-constexpr 'PromiseBuiltins::PromiseResolvingFunctionContextSlot' {
+    constexpr 'PromiseBuiltins::PromiseResolvingFunctionContextSlot' {
   kPromiseSlot: Slot<PromiseResolvingFunctionContext, JSPromise>,
   kAlreadyResolvedSlot: Slot<PromiseResolvingFunctionContext, Boolean>,
   kDebugEventSlot: Slot<PromiseResolvingFunctionContext, Boolean>,
@@ -275,15 +271,15 @@ constexpr 'PromiseBuiltins::PromiseResolvingFunctionContextSlot' {
 
 type PromiseCapabilitiesExecutorContext extends FunctionContext;
 extern enum FunctionContextSlot extends intptr
-constexpr 'PromiseBuiltins::FunctionContextSlot' {
+    constexpr 'PromiseBuiltins::FunctionContextSlot' {
   kCapabilitySlot: Slot<PromiseCapabilitiesExecutorContext, PromiseCapability>,
   kCapabilitiesContextLength
 }
 
 @export
 macro CreatePromiseCapabilitiesExecutorContext(
-    nativeContext: NativeContext, capability: PromiseCapability):
-    PromiseCapabilitiesExecutorContext {
+    nativeContext: NativeContext,
+    capability: PromiseCapability): PromiseCapabilitiesExecutorContext {
   const executorContext = %RawDownCast<PromiseCapabilitiesExecutorContext>(
       AllocateSyntheticFunctionContext(
           nativeContext, FunctionContextSlot::kCapabilitiesContextLength));
@@ -312,9 +308,9 @@ struct PromiseResolvingFunctions {
 }
 
 @export
-macro CreatePromiseResolvingFunctions(implicit context: Context)(
-    promise: JSPromise, debugEvent: Boolean, nativeContext: NativeContext):
-    PromiseResolvingFunctions {
+macro CreatePromiseResolvingFunctions(
+    implicit context: Context)(promise: JSPromise, debugEvent: Boolean,
+    nativeContext: NativeContext): PromiseResolvingFunctions {
   const promiseContext = CreatePromiseResolvingFunctionsContext(
       promise, debugEvent, nativeContext);
   const map = *NativeContextSlot(
@@ -329,9 +325,9 @@ macro CreatePromiseResolvingFunctions(implicit context: Context)(
   return PromiseResolvingFunctions{resolve: resolve, reject: reject};
 }
 
-transitioning macro
-InnerNewPromiseCapability(implicit context: Context)(
-    constructor: HeapObject, debugEvent: Boolean): PromiseCapability {
+transitioning macro InnerNewPromiseCapability(
+    implicit context: Context)(constructor: HeapObject,
+    debugEvent: Boolean): PromiseCapability {
   const nativeContext = LoadNativeContext(context);
   if (constructor ==
       *NativeContextSlot(nativeContext, ContextSlot::PROMISE_FUNCTION_INDEX)) {
@@ -368,9 +364,9 @@ InnerNewPromiseCapability(implicit context: Context)(
 }
 
 // https://tc39.es/ecma262/#sec-newpromisecapability
-transitioning builtin
-NewPromiseCapability(implicit context: Context)(
-    maybeConstructor: Object, debugEvent: Boolean): PromiseCapability {
+transitioning builtin NewPromiseCapability(
+    implicit context: Context)(maybeConstructor: Object,
+    debugEvent: Boolean): PromiseCapability {
   typeswitch (maybeConstructor) {
     case (Smi): {
       ThrowTypeError(MessageTemplate::kNotConstructor, maybeConstructor);
@@ -385,8 +381,7 @@ NewPromiseCapability(implicit context: Context)(
 }
 
 // https://tc39.es/ecma262/#sec-promise-reject-functions
-transitioning javascript builtin
-PromiseCapabilityDefaultReject(
+transitioning javascript builtin PromiseCapabilityDefaultReject(
     js-implicit context: Context, receiver: JSAny)(reason: JSAny): JSAny {
   const context = %RawDownCast<PromiseResolvingFunctionContext>(context);
   // 2. Let promise be F.[[Promise]].
@@ -414,8 +409,7 @@ PromiseCapabilityDefaultReject(
 }
 
 // https://tc39.es/ecma262/#sec-promise-resolve-functions
-transitioning javascript builtin
-PromiseCapabilityDefaultResolve(
+transitioning javascript builtin PromiseCapabilityDefaultResolve(
     js-implicit context: Context, receiver: JSAny)(resolution: JSAny): JSAny {
   const context = %RawDownCast<PromiseResolvingFunctionContext>(context);
   // 2. Let promise be F.[[Promise]].
@@ -442,9 +436,9 @@ PromiseCapabilityDefaultResolve(
 }
 
 @export
-transitioning macro PerformPromiseThenImpl(implicit context: Context)(
-    promise: JSPromise, onFulfilled: Callable|Undefined,
-    onRejected: Callable|Undefined,
+transitioning macro PerformPromiseThenImpl(
+    implicit context: Context)(promise: JSPromise,
+    onFulfilled: Callable|Undefined, onRejected: Callable|Undefined,
     resultPromiseOrCapability: JSPromise|PromiseCapability|Undefined): void {
   if (promise.Status() == PromiseState::kPending) {
     // The {promise} is still in "Pending" state, so we just record a new
@@ -484,18 +478,18 @@ transitioning macro PerformPromiseThenImpl(implicit context: Context)(
 }
 
 // https://tc39.es/ecma262/#sec-performpromisethen
-transitioning builtin
-PerformPromiseThen(implicit context: Context)(
-    promise: JSPromise, onFulfilled: Callable|Undefined,
-    onRejected: Callable|Undefined, resultPromise: JSPromise|Undefined): JSAny {
+transitioning builtin PerformPromiseThen(
+    implicit context: Context)(promise: JSPromise,
+    onFulfilled: Callable|Undefined, onRejected: Callable|Undefined,
+    resultPromise: JSPromise|Undefined): JSAny {
   PerformPromiseThenImpl(promise, onFulfilled, onRejected, resultPromise);
   return resultPromise;
 }
 
 // https://tc39.es/ecma262/#sec-promise-reject-functions
-transitioning javascript builtin
-PromiseReject(
-    js-implicit context: NativeContext, receiver: JSAny)(reason: JSAny): JSAny {
+transitioning javascript builtin PromiseReject(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    reason: JSAny): JSAny {
   // 1. Let C be the this value.
   // 2. If Type(C) is not Object, throw a TypeError exception.
   const receiver = Cast<JSReceiver>(receiver) otherwise
@@ -523,9 +517,9 @@ const kPromiseExecutorAlreadyInvoked: constexpr MessageTemplate
     generates 'MessageTemplate::kPromiseExecutorAlreadyInvoked';
 
 // https://tc39.es/ecma262/#sec-getcapabilitiesexecutor-functions
-transitioning javascript builtin
-PromiseGetCapabilitiesExecutor(js-implicit context: Context, receiver: JSAny)(
-    resolve: JSAny, reject: JSAny): JSAny {
+transitioning javascript builtin PromiseGetCapabilitiesExecutor(
+    js-implicit context: Context, receiver: JSAny)(resolve: JSAny,
+    reject: JSAny): JSAny {
   const context = %RawDownCast<PromiseCapabilitiesExecutorContext>(context);
   const capability: PromiseCapability =
       *ContextSlot(context, FunctionContextSlot::kCapabilitySlot);
@@ -539,8 +533,9 @@ PromiseGetCapabilitiesExecutor(js-implicit context: Context, receiver: JSAny)(
   return Undefined;
 }
 
-macro IsPromiseResolveLookupChainIntact(implicit context: Context)(
-    nativeContext: NativeContext, constructor: JSReceiver): bool {
+macro IsPromiseResolveLookupChainIntact(
+    implicit context: Context)(nativeContext: NativeContext,
+    constructor: JSReceiver): bool {
   if (IsForceSlowPath()) return false;
   const promiseFun =
       *NativeContextSlot(nativeContext, ContextSlot::PROMISE_FUNCTION_INDEX);
@@ -548,8 +543,9 @@ macro IsPromiseResolveLookupChainIntact(implicit context: Context)(
 }
 
 // https://tc39.es/ecma262/#sec-getpromiseresolve
-transitioning macro GetPromiseResolve(implicit context: Context)(
-    nativeContext: NativeContext, constructor: Constructor): JSAny {
+transitioning macro GetPromiseResolve(
+    implicit context: Context)(nativeContext: NativeContext,
+    constructor: Constructor): JSAny {
   // 1. Assert: IsConstructor(constructor) is true.
 
   // We can skip the "resolve" lookup on {constructor} if it's the
@@ -574,8 +570,9 @@ transitioning macro GetPromiseResolve(implicit context: Context)(
   return promiseResolveFunction;
 }
 
-transitioning macro CallResolve(implicit context: Context)(
-    constructor: Constructor, resolve: JSAny, value: JSAny): JSAny {
+transitioning macro CallResolve(
+    implicit context: Context)(constructor: Constructor, resolve: JSAny,
+    value: JSAny): JSAny {
   // Undefined can never be a valid value for the resolve function,
   // instead it is used as a special marker for the fast path.
   if (resolve == Undefined) {
@@ -586,11 +583,9 @@ transitioning macro CallResolve(implicit context: Context)(
     }
 }
 
-transitioning javascript builtin
-PromiseConstructorLazyDeoptContinuation(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    promise: JSAny, reject: JSAny, exception: JSAny|TheHole,
-    _result: JSAny): JSAny {
+transitioning javascript builtin PromiseConstructorLazyDeoptContinuation(
+    js-implicit context: NativeContext, receiver: JSAny)(promise: JSAny,
+    reject: JSAny, exception: JSAny|TheHole, _result: JSAny): JSAny {
   typeswitch (exception) {
     case (TheHole): {
     }
diff --git a/deps/v8/src/builtins/promise-all-element-closure.tq b/deps/v8/src/builtins/promise-all-element-closure.tq
index db3fb0134cf5bf..276e69fde49475 100644
--- a/deps/v8/src/builtins/promise-all-element-closure.tq
+++ b/deps/v8/src/builtins/promise-all-element-closure.tq
@@ -15,9 +15,9 @@ struct PromiseAllWrapResultAsFulfilledFunctor {
 }
 
 struct PromiseAllSettledWrapResultAsFulfilledFunctor {
-  transitioning
-  macro Call(implicit context: Context)(
-      nativeContext: NativeContext, value: JSAny): JSAny {
+  transitioning macro Call(
+      implicit context: Context)(nativeContext: NativeContext,
+      value: JSAny): JSAny {
     // TODO(gsathya): Optimize the creation using a cached map to
     // prevent transitions here.
     // 9. Let obj be ! ObjectCreate(%ObjectPrototype%).
@@ -38,9 +38,9 @@ struct PromiseAllSettledWrapResultAsFulfilledFunctor {
 }
 
 struct PromiseAllSettledWrapResultAsRejectedFunctor {
-  transitioning
-  macro Call(implicit context: Context)(
-      nativeContext: NativeContext, value: JSAny): JSAny {
+  transitioning macro Call(
+      implicit context: Context)(nativeContext: NativeContext,
+      value: JSAny): JSAny {
     // TODO(gsathya): Optimize the creation using a cached map to
     // prevent transitions here.
     // 9. Let obj be ! ObjectCreate(%ObjectPrototype%).
@@ -60,11 +60,11 @@ struct PromiseAllSettledWrapResultAsRejectedFunctor {
   }
 }
 
-extern macro LoadJSReceiverIdentityHash(JSReceiver): intptr labels IfNoHash;
+extern macro LoadJSReceiverIdentityHash(JSReceiver): uint32 labels IfNoHash;
 
 type PromiseAllResolveElementContext extends FunctionContext;
 extern enum PromiseAllResolveElementContextSlots extends intptr
-constexpr 'PromiseBuiltins::PromiseAllResolveElementContextSlots' {
+    constexpr 'PromiseBuiltins::PromiseAllResolveElementContextSlots' {
   kPromiseAllResolveElementRemainingSlot:
       Slot<PromiseAllResolveElementContext, Smi>,
   kPromiseAllResolveElementCapabilitySlot:
@@ -114,8 +114,8 @@ transitioning macro PromiseAllResolveElementClosure<F: type>(
   dcheck(kPropertyArrayNoHashSentinel == 0);
   const identityHash =
       LoadJSReceiverIdentityHash(function) otherwise unreachable;
-  dcheck(identityHash > 0);
-  const index = identityHash - 1;
+  dcheck(ChangeUint32ToWord(identityHash) < kSmiMaxValue);
+  const index = Signed(ChangeUint32ToWord(identityHash)) - 1;
 
   let remainingElementsCount = *ContextSlot(
       promiseContext,
@@ -175,41 +175,49 @@ transitioning macro PromiseAllResolveElementClosure<F: type>(
         *NativeContextSlot(
         nativeContext, ContextSlot::JS_ARRAY_PACKED_ELEMENTS_MAP_INDEX);
 
-    // If resolve and reject handlers close over values to keep track of whether
-    // an input promise is already settled, mark the values array as COW before
-    // letting it escape to user code.
-    if (hasResolveAndRejectClosures) MakeFixedArrayCOW(values);
-
+    // After this point, values escapes to user code.
+    //
+    // If resolve and reject handlers close over values to keep track of
+    // whether an input promise is already settled, mark the values array as
+    // COW. The original values array is still needed to guard against resolve
+    // or reject being called multiple times for an element.
+    //
+    // Otherwise, clear the slot.
+    if (hasResolveAndRejectClosures) {
+      MakeFixedArrayCOW(values);
+    } else {
+      *ContextSlot(
+          promiseContext,
+          PromiseAllResolveElementContextSlots::
+              kPromiseAllResolveElementValuesSlot) = kEmptyFixedArray;
+    }
     const valuesArray = NewJSArray(arrayMap, values);
     Call(promiseContext, resolve, Undefined, valuesArray);
   }
   return Undefined;
 }
 
-transitioning javascript builtin
-PromiseAllResolveElementClosure(
-    js-implicit context: Context, receiver: JSAny,
-    target: JSFunction)(value: JSAny): JSAny {
+transitioning javascript builtin PromiseAllResolveElementClosure(
+    js-implicit context: Context, receiver: JSAny, target: JSFunction)(
+    value: JSAny): JSAny {
   const context =
       %RawDownCast<PromiseAllResolveElementContext|NativeContext>(context);
   return PromiseAllResolveElementClosure(
       value, target, PromiseAllWrapResultAsFulfilledFunctor{}, false);
 }
 
-transitioning javascript builtin
-PromiseAllSettledResolveElementClosure(
-    js-implicit context: Context, receiver: JSAny,
-    target: JSFunction)(value: JSAny): JSAny {
+transitioning javascript builtin PromiseAllSettledResolveElementClosure(
+    js-implicit context: Context, receiver: JSAny, target: JSFunction)(
+    value: JSAny): JSAny {
   const context =
       %RawDownCast<PromiseAllResolveElementContext|NativeContext>(context);
   return PromiseAllResolveElementClosure(
       value, target, PromiseAllSettledWrapResultAsFulfilledFunctor{}, true);
 }
 
-transitioning javascript builtin
-PromiseAllSettledRejectElementClosure(
-    js-implicit context: Context, receiver: JSAny,
-    target: JSFunction)(value: JSAny): JSAny {
+transitioning javascript builtin PromiseAllSettledRejectElementClosure(
+    js-implicit context: Context, receiver: JSAny, target: JSFunction)(
+    value: JSAny): JSAny {
   const context =
       %RawDownCast<PromiseAllResolveElementContext|NativeContext>(context);
   return PromiseAllResolveElementClosure(
diff --git a/deps/v8/src/builtins/promise-all.tq b/deps/v8/src/builtins/promise-all.tq
index 4d131abb44b759..24c4ab7145cca0 100644
--- a/deps/v8/src/builtins/promise-all.tq
+++ b/deps/v8/src/builtins/promise-all.tq
@@ -16,8 +16,8 @@ const kPromiseBuiltinsPromiseContextLength: constexpr int31
 // closures), and we also need to have a separate marker for when the closure
 // was called already (we slap the native context onto the closure in that
 // case to mark it's done).
-macro CreatePromiseAllResolveElementContext(implicit context: Context)(
-    capability: PromiseCapability,
+macro CreatePromiseAllResolveElementContext(
+    implicit context: Context)(capability: PromiseCapability,
     nativeContext: NativeContext): PromiseAllResolveElementContext {
   const resolveContext = %RawDownCast<
       PromiseAllResolveElementContext>(AllocateSyntheticFunctionContext(
@@ -40,7 +40,8 @@ macro CreatePromiseAllResolveElementContext(implicit context: Context)(
   return resolveContext;
 }
 
-macro CreatePromiseAllResolveElementFunction(implicit context: Context)(
+macro CreatePromiseAllResolveElementFunction(
+    implicit context: Context)(
     resolveElementContext: PromiseAllResolveElementContext, index: Smi,
     nativeContext: NativeContext,
     resolveFunction: SharedFunctionInfo): JSFunction {
@@ -58,9 +59,9 @@ macro CreatePromiseAllResolveElementFunction(implicit context: Context)(
 }
 
 @export
-macro CreatePromiseResolvingFunctionsContext(implicit context: Context)(
-    promise: JSPromise, debugEvent: Boolean, nativeContext: NativeContext):
-    PromiseResolvingFunctionContext {
+macro CreatePromiseResolvingFunctionsContext(
+    implicit context: Context)(promise: JSPromise, debugEvent: Boolean,
+    nativeContext: NativeContext): PromiseResolvingFunctionContext {
   const resolveContext = %RawDownCast<PromiseResolvingFunctionContext>(
       AllocateSyntheticFunctionContext(
           nativeContext,
@@ -80,8 +81,9 @@ macro CreatePromiseResolvingFunctionsContext(implicit context: Context)(
   return resolveContext;
 }
 
-macro IsPromiseThenLookupChainIntact(implicit context: Context)(
-    nativeContext: NativeContext, receiverMap: Map): bool {
+macro IsPromiseThenLookupChainIntact(
+    implicit context: Context)(nativeContext: NativeContext,
+    receiverMap: Map): bool {
   if (IsForceSlowPath()) return false;
   if (!IsJSPromiseMap(receiverMap)) return false;
   if (receiverMap.prototype != *NativeContextSlot(
@@ -92,7 +94,8 @@ macro IsPromiseThenLookupChainIntact(implicit context: Context)(
 }
 
 struct PromiseAllResolveElementFunctor {
-  macro Call(implicit context: Context)(
+  macro Call(
+      implicit context: Context)(
       resolveElementContext: PromiseAllResolveElementContext,
       nativeContext: NativeContext, index: Smi,
       _capability: PromiseCapability): Callable {
@@ -103,7 +106,8 @@ struct PromiseAllResolveElementFunctor {
 }
 
 struct PromiseAllRejectElementFunctor {
-  macro Call(implicit context: Context)(
+  macro Call(
+      implicit context: Context)(
       _resolveElementContext: PromiseAllResolveElementContext,
       _nativeContext: NativeContext, _index: Smi,
       capability: PromiseCapability): Callable {
@@ -112,7 +116,8 @@ struct PromiseAllRejectElementFunctor {
 }
 
 struct PromiseAllSettledResolveElementFunctor {
-  macro Call(implicit context: Context)(
+  macro Call(
+      implicit context: Context)(
       resolveElementContext: PromiseAllResolveElementContext,
       nativeContext: NativeContext, index: Smi,
       _capability: PromiseCapability): Callable {
@@ -123,7 +128,8 @@ struct PromiseAllSettledResolveElementFunctor {
 }
 
 struct PromiseAllSettledRejectElementFunctor {
-  macro Call(implicit context: Context)(
+  macro Call(
+      implicit context: Context)(
       resolveElementContext: PromiseAllResolveElementContext,
       nativeContext: NativeContext, index: Smi,
       _capability: PromiseCapability): Callable {
@@ -134,11 +140,10 @@ struct PromiseAllSettledRejectElementFunctor {
 }
 
 transitioning macro PerformPromiseAll<F1: type, F2: type>(
-    implicit context: Context)(
-    nativeContext: NativeContext, iter: iterator::IteratorRecord,
-    constructor: Constructor, capability: PromiseCapability,
-    promiseResolveFunction: JSAny, createResolveElementFunctor: F1,
-    createRejectElementFunctor: F2,
+    implicit context: Context)(nativeContext: NativeContext,
+    iter: iterator::IteratorRecord, constructor: Constructor,
+    capability: PromiseCapability, promiseResolveFunction: JSAny,
+    createResolveElementFunctor: F1, createRejectElementFunctor: F2,
     hasResolveAndRejectClosures: constexpr bool): JSAny labels
 Reject(JSAny) {
   const promise = capability.promise;
@@ -278,15 +283,16 @@ Reject(JSAny) {
 
   check(remainingElementsCount >= 0);
 
+  const valuesRef:&FixedArray = ContextSlot(
+      resolveElementContext,
+      PromiseAllResolveElementContextSlots::
+          kPromiseAllResolveElementValuesSlot);
+  const values = *valuesRef;
+
   if (remainingElementsCount > 0) {
     // Pre-allocate the backing store for the {values} to the desired
     // capacity. We may already have elements in "values" - this happens
     // when the Thenable calls the resolve callback immediately.
-    const valuesRef:&FixedArray = ContextSlot(
-        resolveElementContext,
-        PromiseAllResolveElementContextSlots::
-            kPromiseAllResolveElementValuesSlot);
-    const values = *valuesRef;
     // 'index' is a 1-based index and incremented after every Promise. Later we
     // use 'values' as a 0-based array, so capacity 'index - 1' is enough.
     const newCapacity = SmiUntag(index) - 1;
@@ -301,19 +307,23 @@ Reject(JSAny) {
       //     Let valuesArray be CreateArrayFromList(values).
       //     Perform ? Call(resultCapability.[[Resolve]], undefined,
       //                    « valuesArray »).
-
-      const values: FixedArray = *ContextSlot(
-          resolveElementContext,
-          PromiseAllResolveElementContextSlots::
-              kPromiseAllResolveElementValuesSlot);
       const arrayMap =
           *NativeContextSlot(
           nativeContext, ContextSlot::JS_ARRAY_PACKED_ELEMENTS_MAP_INDEX);
 
+      // After this point, values escapes to user code.
+      //
       // If resolve and reject handlers close over values to keep track of
       // whether an input promise is already settled, mark the values array as
-      // COW before letting it escape to user code.
-      if (hasResolveAndRejectClosures) MakeFixedArrayCOW(values);
+      // COW. The original values array is still needed to guard against resolve
+      // or reject being called multiple times for an element.
+      //
+      // Otherwise, clear the slot.
+      if (hasResolveAndRejectClosures) {
+        MakeFixedArrayCOW(values);
+      } else {
+        *valuesRef = kEmptyFixedArray;
+      }
 
       const valuesArray = NewJSArray(arrayMap, values);
       Call(nativeContext, UnsafeCast<JSAny>(resolve), Undefined, valuesArray);
@@ -324,9 +334,9 @@ Reject(JSAny) {
 }
 
 transitioning macro GeneratePromiseAll<F1: type, F2: type>(
-    implicit context: Context)(
-    receiver: JSAny, iterable: JSAny, createResolveElementFunctor: F1,
-    createRejectElementFunctor: F2, message: constexpr string,
+    implicit context: Context)(receiver: JSAny, iterable: JSAny,
+    createResolveElementFunctor: F1, createRejectElementFunctor: F2,
+    message: constexpr string,
     hasResolveAndRejectClosures: constexpr bool): JSAny {
   const nativeContext = LoadNativeContext(context);
   // Let C be the this value.
diff --git a/deps/v8/src/builtins/promise-any.tq b/deps/v8/src/builtins/promise-any.tq
index 7e707e649f11bc..8b21ebfff0fed4 100644
--- a/deps/v8/src/builtins/promise-any.tq
+++ b/deps/v8/src/builtins/promise-any.tq
@@ -7,7 +7,7 @@
 namespace promise {
 type PromiseAnyRejectElementContext extends FunctionContext;
 extern enum PromiseAnyRejectElementContextSlots extends intptr
-constexpr 'PromiseBuiltins::PromiseAnyRejectElementContextSlots' {
+    constexpr 'PromiseBuiltins::PromiseAnyRejectElementContextSlots' {
   kPromiseAnyRejectElementRemainingSlot:
       Slot<PromiseAnyRejectElementContext, Smi>,
   kPromiseAnyRejectElementCapabilitySlot:
@@ -30,8 +30,7 @@ extern operator '[]' macro LoadContextElement(
 // was called already (we slap the native context onto the closure in that
 // case to mark it's done). See Promise.all which uses the same approach.
 transitioning macro CreatePromiseAnyRejectElementContext(
-    implicit context: Context)(
-    capability: PromiseCapability,
+    implicit context: Context)(capability: PromiseCapability,
     nativeContext: NativeContext): PromiseAnyRejectElementContext {
   const rejectContext = %RawDownCast<PromiseAnyRejectElementContext>(
       AllocateSyntheticFunctionContext(
@@ -54,7 +53,8 @@ transitioning macro CreatePromiseAnyRejectElementContext(
   return rejectContext;
 }
 
-macro CreatePromiseAnyRejectElementFunction(implicit context: Context)(
+macro CreatePromiseAnyRejectElementFunction(
+    implicit context: Context)(
     rejectElementContext: PromiseAnyRejectElementContext, index: Smi,
     nativeContext: NativeContext): JSFunction {
   dcheck(index > 0);
@@ -70,10 +70,9 @@ macro CreatePromiseAnyRejectElementFunction(implicit context: Context)(
 }
 
 // https://tc39.es/ecma262/#sec-promise.any-reject-element-functions
-transitioning javascript builtin
-PromiseAnyRejectElementClosure(
-    js-implicit context: Context, receiver: JSAny,
-    target: JSFunction)(value: JSAny): JSAny {
+transitioning javascript builtin PromiseAnyRejectElementClosure(
+    js-implicit context: Context, receiver: JSAny, target: JSFunction)(
+    value: JSAny): JSAny {
   // 1. Let F be the active function object.
 
   // 2. Let alreadyCalled be F.[[AlreadyCalled]].
@@ -102,13 +101,14 @@ PromiseAnyRejectElementClosure(
   // 5. Let index be F.[[Index]].
   dcheck(kPropertyArrayNoHashSentinel == 0);
   const identityHash = LoadJSReceiverIdentityHash(target) otherwise unreachable;
-  dcheck(identityHash > 0);
-  const index = identityHash - 1;
+  dcheck(ChangeUint32ToWord(identityHash) < kSmiMaxValue);
+  const index = Signed(ChangeUint32ToWord(identityHash)) - 1;
 
   // 6. Let errors be F.[[Errors]].
-  let errors = *ContextSlot(
+  let errorsRef:&FixedArray = ContextSlot(
       context,
       PromiseAnyRejectElementContextSlots::kPromiseAnyRejectElementErrorsSlot);
+  let errors = *errorsRef;
 
   // 7. Let promiseCapability be F.[[Capability]].
 
@@ -134,10 +134,7 @@ PromiseAnyRejectElementClosure(
       IntPtrMax(SmiUntag(remainingElementsCount) - 1, index + 1);
   if (newCapacity > errors.length_intptr) deferred {
       errors = ExtractFixedArray(errors, 0, errors.length_intptr, newCapacity);
-      *ContextSlot(
-          context,
-          PromiseAnyRejectElementContextSlots::
-              kPromiseAnyRejectElementErrorsSlot) = errors;
+      *errorsRef = errors;
     }
   errors.objects[index] = value;
 
@@ -155,6 +152,10 @@ PromiseAnyRejectElementClosure(
 
     //   b. Set error.[[AggregateErrors]] to errors.
     const error = ConstructAggregateError(errors);
+
+    // After this point, errors escapes to user code. Clear the slot.
+    *errorsRef = kEmptyFixedArray;
+
     //   c. Return ? Call(promiseCapability.[[Reject]], undefined, « error »).
     const capability = *ContextSlot(
         context,
@@ -167,9 +168,10 @@ PromiseAnyRejectElementClosure(
   return Undefined;
 }
 
-transitioning macro PerformPromiseAny(implicit context: Context)(
-    nativeContext: NativeContext, iteratorRecord: iterator::IteratorRecord,
-    constructor: Constructor, resultCapability: PromiseCapability,
+transitioning macro PerformPromiseAny(
+    implicit context: Context)(nativeContext: NativeContext,
+    iteratorRecord: iterator::IteratorRecord, constructor: Constructor,
+    resultCapability: PromiseCapability,
     promiseResolveFunction: JSAny): JSAny labels
 Reject(JSAny) {
   // 1. Assert: ! IsConstructor(constructor) is true.
@@ -313,10 +315,14 @@ Reject(JSAny) {
 
       // We may already have elements in "errors" - this happens when the
       // Thenable calls the reject callback immediately.
-      const errors: FixedArray = *ContextSlot(
+      const errorsRef:&FixedArray = ContextSlot(
           rejectElementContext,
           PromiseAnyRejectElementContextSlots::
               kPromiseAnyRejectElementErrorsSlot);
+      const errors: FixedArray = *errorsRef;
+
+      // After this point, errors escapes to user code. Clear the slot.
+      *errorsRef = kEmptyFixedArray;
 
       check(errors.length == index - 1);
       const error = ConstructAggregateError(errors);
@@ -328,8 +334,7 @@ Reject(JSAny) {
 }
 
 // https://tc39.es/ecma262/#sec-promise.any
-transitioning javascript builtin
-PromiseAny(
+transitioning javascript builtin PromiseAny(
     js-implicit context: Context, receiver: JSAny)(iterable: JSAny): JSAny {
   const nativeContext = LoadNativeContext(context);
 
@@ -386,8 +391,8 @@ PromiseAny(
   }
 }
 
-transitioning macro ConstructAggregateError(implicit context: Context)(
-    errors: FixedArray): JSObject {
+transitioning macro ConstructAggregateError(
+    implicit context: Context)(errors: FixedArray): JSObject {
   const obj: JSObject = error::ConstructInternalAggregateErrorHelper(
       context, SmiConstant(MessageTemplate::kAllPromisesRejected));
   const errorsJSArray = array::CreateJSArrayWithElements(errors);
diff --git a/deps/v8/src/builtins/promise-constructor.tq b/deps/v8/src/builtins/promise-constructor.tq
index b502eabf05f614..5611e228b50cfd 100644
--- a/deps/v8/src/builtins/promise-constructor.tq
+++ b/deps/v8/src/builtins/promise-constructor.tq
@@ -6,14 +6,13 @@
 #include 'src/builtins/builtins-promise-gen.h'
 
 namespace runtime {
-extern transitioning runtime
-DebugPushPromise(implicit context: Context)(JSAny): JSAny;
+extern transitioning runtime DebugPushPromise(
+    implicit context: Context)(JSAny): JSAny;
 
-extern transitioning runtime
-DebugPopPromise(implicit context: Context)(): JSAny;
+extern transitioning runtime DebugPopPromise(implicit context: Context)(): JSAny;
 
-extern transitioning runtime
-PromiseHookInit(implicit context: Context)(Object, Object): JSAny;
+extern transitioning runtime PromiseHookInit(
+    implicit context: Context)(Object, Object): JSAny;
 }
 
 // https://tc39.es/ecma262/#sec-promise-constructor
@@ -21,16 +20,15 @@ namespace promise {
 
 extern runtime IncrementUseCounter(Context, Smi): void;
 type UseCounterFeature extends int31
-constexpr 'v8::Isolate::UseCounterFeature';
+    constexpr 'v8::Isolate::UseCounterFeature';
 const kPromiseConstructorReturnedUndefined: constexpr UseCounterFeature
     generates 'v8::Isolate::kPromiseConstructorReturnedUndefined';
 
-extern macro
-IsDebugActive(): bool;
+extern macro IsDebugActive(): bool;
 
-transitioning macro
-HasAccessCheckFailed(implicit context: Context)(
-    nativeContext: NativeContext, promiseFun: JSAny, executor: JSAny): bool {
+transitioning macro HasAccessCheckFailed(
+    implicit context: Context)(nativeContext: NativeContext, promiseFun: JSAny,
+    executor: JSAny): bool {
   BranchIfAccessCheckFailed(nativeContext, promiseFun, executor)
       otherwise return true;
   return false;
@@ -39,15 +37,13 @@ HasAccessCheckFailed(implicit context: Context)(
 extern macro ConstructorBuiltinsAssembler::FastNewObject(
     Context, JSFunction, JSReceiver): JSObject;
 
-extern macro
-PromiseBuiltinsAssembler::IsIsolatePromiseHookEnabledOrHasAsyncEventDelegate(
-    uint32): bool;
+extern macro PromiseBuiltinsAssembler::
+    IsIsolatePromiseHookEnabledOrHasAsyncEventDelegate(uint32): bool;
 
 // https://tc39.es/ecma262/#sec-promise-executor
-transitioning javascript builtin
-PromiseConstructor(
-    js-implicit context: NativeContext, receiver: JSAny,
-    newTarget: JSAny)(executor: JSAny): JSAny {
+transitioning javascript builtin PromiseConstructor(
+    js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny)(
+    executor: JSAny): JSAny {
   // 1. If NewTarget is undefined, throw a TypeError exception.
   if (newTarget == Undefined) {
     ThrowTypeError(MessageTemplate::kPromiseNewTargetUndefined);
@@ -95,8 +91,7 @@ PromiseConstructor(
 
 // Promise.prototype.catch ( onRejected )
 // https://tc39.es/ecma262/#sec-promise.prototype.catch
-transitioning javascript builtin
-PromisePrototypeCatch(
+transitioning javascript builtin PromisePrototypeCatch(
     js-implicit context: Context, receiver: JSAny)(onRejected: JSAny): JSAny {
   // 1. Let promise be the this value.
   // 2. Return ? Invoke(promise, "then", « undefined, onRejected »).
diff --git a/deps/v8/src/builtins/promise-finally.tq b/deps/v8/src/builtins/promise-finally.tq
index a34583354cc8f6..7e1b752f35d9ac 100644
--- a/deps/v8/src/builtins/promise-finally.tq
+++ b/deps/v8/src/builtins/promise-finally.tq
@@ -9,37 +9,37 @@ namespace promise {
 
 type PromiseValueThunkOrReasonContext extends FunctionContext;
 extern enum PromiseValueThunkOrReasonContextSlot extends intptr
-constexpr 'PromiseBuiltins::PromiseValueThunkOrReasonContextSlot' {
+    constexpr 'PromiseBuiltins::PromiseValueThunkOrReasonContextSlot' {
   kValueSlot: Slot<PromiseValueThunkOrReasonContext, JSAny>,
   kPromiseValueThunkOrReasonContextLength
 }
 
 type PromiseFinallyContext extends FunctionContext;
 extern enum PromiseFinallyContextSlot extends intptr
-constexpr 'PromiseBuiltins::PromiseFinallyContextSlot' {
+    constexpr 'PromiseBuiltins::PromiseFinallyContextSlot' {
   kOnFinallySlot: Slot<PromiseFinallyContext, Callable>,
   kConstructorSlot: Slot<PromiseFinallyContext, Constructor>,
   kPromiseFinallyContextLength
 }
 
-transitioning javascript builtin
-PromiseValueThunkFinally(
+transitioning javascript builtin PromiseValueThunkFinally(
     js-implicit context: Context, receiver: JSAny)(): JSAny {
   const context = %RawDownCast<PromiseValueThunkOrReasonContext>(context);
   return *ContextSlot(
       context, PromiseValueThunkOrReasonContextSlot::kValueSlot);
 }
 
-transitioning javascript builtin
-PromiseThrowerFinally(js-implicit context: Context, receiver: JSAny)(): never {
+transitioning javascript builtin PromiseThrowerFinally(
+    js-implicit context: Context, receiver: JSAny)(): never {
   const context = %RawDownCast<PromiseValueThunkOrReasonContext>(context);
   const reason =
       *ContextSlot(context, PromiseValueThunkOrReasonContextSlot::kValueSlot);
   Throw(reason);
 }
 
-macro CreateThrowerFunction(implicit context: Context)(
-    nativeContext: NativeContext, reason: JSAny): JSFunction {
+macro CreateThrowerFunction(
+    implicit context: Context)(nativeContext: NativeContext,
+    reason: JSAny): JSFunction {
   const throwerContext = %RawDownCast<PromiseValueThunkOrReasonContext>(
       AllocateSyntheticFunctionContext(
           nativeContext,
@@ -53,8 +53,7 @@ macro CreateThrowerFunction(implicit context: Context)(
   return AllocateFunctionWithMapAndContext(map, throwerInfo, throwerContext);
 }
 
-transitioning javascript builtin
-PromiseCatchFinally(
+transitioning javascript builtin PromiseCatchFinally(
     js-implicit context: Context, receiver: JSAny)(reason: JSAny): JSAny {
   const context = %RawDownCast<PromiseFinallyContext>(context);
   // 1. Let onFinally be F.[[OnFinally]].
@@ -83,8 +82,9 @@ PromiseCatchFinally(
   return UnsafeCast<JSAny>(InvokeThen(nativeContext, promise, thrower));
 }
 
-macro CreateValueThunkFunction(implicit context: Context)(
-    nativeContext: NativeContext, value: JSAny): JSFunction {
+macro CreateValueThunkFunction(
+    implicit context: Context)(nativeContext: NativeContext,
+    value: JSAny): JSFunction {
   const valueThunkContext = %RawDownCast<PromiseValueThunkOrReasonContext>(
       AllocateSyntheticFunctionContext(
           nativeContext,
@@ -100,8 +100,7 @@ macro CreateValueThunkFunction(implicit context: Context)(
       map, valueThunkInfo, valueThunkContext);
 }
 
-transitioning javascript builtin
-PromiseThenFinally(
+transitioning javascript builtin PromiseThenFinally(
     js-implicit context: Context, receiver: JSAny)(value: JSAny): JSAny {
   const context = %RawDownCast<PromiseFinallyContext>(context);
   // 1. Let onFinally be F.[[OnFinally]].
@@ -135,9 +134,9 @@ struct PromiseFinallyFunctions {
   catch_finally: JSFunction;
 }
 
-macro CreatePromiseFinallyFunctions(implicit context: Context)(
-    nativeContext: NativeContext, onFinally: Callable,
-    constructor: Constructor): PromiseFinallyFunctions {
+macro CreatePromiseFinallyFunctions(
+    implicit context: Context)(nativeContext: NativeContext,
+    onFinally: Callable, constructor: Constructor): PromiseFinallyFunctions {
   const promiseContext =
       %RawDownCast<PromiseFinallyContext>(AllocateSyntheticFunctionContext(
           nativeContext,
@@ -161,8 +160,7 @@ macro CreatePromiseFinallyFunctions(implicit context: Context)(
 }
 
 // https://tc39.es/ecma262/#sec-promise.prototype.finally
-transitioning javascript builtin
-PromisePrototypeFinally(
+transitioning javascript builtin PromisePrototypeFinally(
     js-implicit context: Context, receiver: JSAny)(onFinally: JSAny): JSAny {
   // 1. Let promise be the this value.
   // 2. If Type(promise) is not Object, throw a TypeError exception.
diff --git a/deps/v8/src/builtins/promise-jobs.tq b/deps/v8/src/builtins/promise-jobs.tq
index 9a9d22af9474f3..859a10858005dd 100644
--- a/deps/v8/src/builtins/promise-jobs.tq
+++ b/deps/v8/src/builtins/promise-jobs.tq
@@ -10,9 +10,9 @@ extern macro IsJSPromiseMap(Map): bool;
 extern macro NeedsAnyPromiseHooks(): bool;
 
 // https://tc39.es/ecma262/#sec-promiseresolvethenablejob
-transitioning builtin
-PromiseResolveThenableJob(implicit context: Context)(
-    promiseToResolve: JSPromise, thenable: JSReceiver, then: JSAny): JSAny {
+transitioning builtin PromiseResolveThenableJob(
+    implicit context: Context)(promiseToResolve: JSPromise,
+    thenable: JSReceiver, then: JSAny): JSAny {
   // We can use a simple optimization here if we know that {then} is the
   // initial Promise.prototype.then method, and {thenable} is a JSPromise
   // whose
diff --git a/deps/v8/src/builtins/promise-misc.tq b/deps/v8/src/builtins/promise-misc.tq
index 199fc313193e82..95e300ff8dfcbc 100644
--- a/deps/v8/src/builtins/promise-misc.tq
+++ b/deps/v8/src/builtins/promise-misc.tq
@@ -6,13 +6,13 @@
 #include 'src/builtins/builtins-promise-gen.h'
 
 namespace runtime {
-extern transitioning runtime
-AllowDynamicFunction(implicit context: Context)(JSAny): JSAny;
+extern transitioning runtime AllowDynamicFunction(
+    implicit context: Context)(JSAny): JSAny;
 
 extern transitioning runtime ThrowNoAccess(implicit context: Context)(): never;
 
-extern transitioning runtime
-ReportMessageFromMicrotask(implicit context: Context)(JSAny): JSAny;
+extern transitioning runtime ReportMessageFromMicrotask(
+    implicit context: Context)(JSAny): JSAny;
 }
 
 // Unsafe functions that should be used very carefully.
@@ -22,14 +22,13 @@ extern macro PromiseBuiltinsAssembler::ZeroOutEmbedderOffsets(JSPromise): void;
 extern macro PromiseBuiltinsAssembler::AllocateJSPromise(Context): HeapObject;
 }
 
-extern macro
-PromiseBuiltinsAssembler::IsContextPromiseHookEnabled(uint32): bool;
+extern macro PromiseBuiltinsAssembler::IsContextPromiseHookEnabled(uint32):
+    bool;
 
-extern macro
-PromiseBuiltinsAssembler::IsIsolatePromiseHookEnabled(uint32): bool;
+extern macro PromiseBuiltinsAssembler::IsIsolatePromiseHookEnabled(uint32):
+    bool;
 
-extern macro
-PromiseBuiltinsAssembler::PromiseHookFlags(): uint32;
+extern macro PromiseBuiltinsAssembler::PromiseHookFlags(): uint32;
 
 namespace promise {
 extern macro IsFunctionWithPrototypeSlotMap(Map): bool;
@@ -72,8 +71,9 @@ macro InnerNewJSPromise(implicit context: Context)(): JSPromise {
   return promise;
 }
 
-macro NewPromiseFulfillReactionJobTask(implicit context: Context)(
-    handlerContext: Context, argument: Object, handler: Callable|Undefined,
+macro NewPromiseFulfillReactionJobTask(
+    implicit context: Context)(handlerContext: Context, argument: Object,
+    handler: Callable|Undefined,
     promiseOrCapability: JSPromise|PromiseCapability|
     Undefined): PromiseFulfillReactionJobTask {
   const nativeContext = LoadNativeContext(handlerContext);
@@ -89,8 +89,9 @@ macro NewPromiseFulfillReactionJobTask(implicit context: Context)(
   };
 }
 
-macro NewPromiseRejectReactionJobTask(implicit context: Context)(
-    handlerContext: Context, argument: Object, handler: Callable|Undefined,
+macro NewPromiseRejectReactionJobTask(
+    implicit context: Context)(handlerContext: Context, argument: Object,
+    handler: Callable|Undefined,
     promiseOrCapability: JSPromise|PromiseCapability|
     Undefined): PromiseRejectReactionJobTask {
   const nativeContext = LoadNativeContext(handlerContext);
@@ -107,8 +108,8 @@ macro NewPromiseRejectReactionJobTask(implicit context: Context)(
 }
 
 @export
-transitioning macro RunContextPromiseHookInit(implicit context: Context)(
-    promise: JSPromise, parent: Object): void {
+transitioning macro RunContextPromiseHookInit(
+    implicit context: Context)(promise: JSPromise, parent: Object): void {
   const maybeHook = *NativeContextSlot(
       ContextSlot::PROMISE_HOOK_INIT_FUNCTION_INDEX);
   const hook = Cast<Callable>(maybeHook) otherwise return;
@@ -123,8 +124,8 @@ transitioning macro RunContextPromiseHookInit(implicit context: Context)(
 }
 
 @export
-transitioning macro RunContextPromiseHookResolve(implicit context: Context)(
-    promise: JSPromise): void {
+transitioning macro RunContextPromiseHookResolve(
+    implicit context: Context)(promise: JSPromise): void {
   // Use potentially unused variables.
   const _unusedPromise = promise;
   @if(V8_ENABLE_JAVASCRIPT_PROMISE_HOOKS) {
@@ -135,14 +136,15 @@ transitioning macro RunContextPromiseHookResolve(implicit context: Context)(
 }
 
 @export
-transitioning macro RunContextPromiseHookResolve(implicit context: Context)(
-    promise: JSPromise, flags: uint32): void {
+transitioning macro RunContextPromiseHookResolve(
+    implicit context: Context)(promise: JSPromise, flags: uint32): void {
   RunContextPromiseHook(
       ContextSlot::PROMISE_HOOK_RESOLVE_FUNCTION_INDEX, promise, flags);
 }
 
 @export
-transitioning macro RunContextPromiseHookBefore(implicit context: Context)(
+transitioning macro RunContextPromiseHookBefore(
+    implicit context: Context)(
     promiseOrCapability: JSPromise|PromiseCapability|Undefined): void {
   // Use potentially unused variables.
   const _unusedPromiseOrCapability = promiseOrCapability;
@@ -154,16 +156,18 @@ transitioning macro RunContextPromiseHookBefore(implicit context: Context)(
 }
 
 @export
-transitioning macro RunContextPromiseHookBefore(implicit context: Context)(
-    promiseOrCapability: JSPromise|PromiseCapability|Undefined, flags: uint32):
-    void {
+transitioning macro RunContextPromiseHookBefore(
+    implicit context: Context)(
+    promiseOrCapability: JSPromise|PromiseCapability|Undefined,
+    flags: uint32): void {
   RunContextPromiseHook(
       ContextSlot::PROMISE_HOOK_BEFORE_FUNCTION_INDEX, promiseOrCapability,
       flags);
 }
 
 @export
-transitioning macro RunContextPromiseHookAfter(implicit context: Context)(
+transitioning macro RunContextPromiseHookAfter(
+    implicit context: Context)(
     promiseOrCapability: JSPromise|PromiseCapability|Undefined): void {
   // Use potentially unused variables.
   const _unusedPromiseOrCapability = promiseOrCapability;
@@ -175,16 +179,17 @@ transitioning macro RunContextPromiseHookAfter(implicit context: Context)(
 }
 
 @export
-transitioning macro RunContextPromiseHookAfter(implicit context: Context)(
-    promiseOrCapability: JSPromise|PromiseCapability|Undefined, flags: uint32):
-    void {
+transitioning macro RunContextPromiseHookAfter(
+    implicit context: Context)(
+    promiseOrCapability: JSPromise|PromiseCapability|Undefined,
+    flags: uint32): void {
   RunContextPromiseHook(
       ContextSlot::PROMISE_HOOK_AFTER_FUNCTION_INDEX, promiseOrCapability,
       flags);
 }
 
-transitioning macro RunContextPromiseHook(implicit context: Context)(
-    slot: Slot<NativeContext, Undefined|Callable>,
+transitioning macro RunContextPromiseHook(
+    implicit context: Context)(slot: Slot<NativeContext, Undefined|Callable>,
     promiseOrCapability: JSPromise|PromiseCapability|Undefined,
     flags: uint32): void {
   // Use potentially unused variables.
@@ -217,8 +222,8 @@ transitioning macro RunContextPromiseHook(implicit context: Context)(
   }
 }
 
-transitioning macro RunAnyPromiseHookInit(implicit context: Context)(
-    promise: JSPromise, parent: Object): void {
+transitioning macro RunAnyPromiseHookInit(
+    implicit context: Context)(promise: JSPromise, parent: Object): void {
   const promiseHookFlags = PromiseHookFlags();
   // Fast return if no hooks are set.
   if (promiseHookFlags == 0) return;
@@ -256,8 +261,9 @@ transitioning macro NewJSPromise(implicit context: Context)(): JSPromise {
 // This allocates and initializes a promise with the given state and
 // fields.
 @export
-transitioning macro NewJSPromise(implicit context: Context)(
-    status: constexpr PromiseState, result: JSAny): JSPromise {
+transitioning macro NewJSPromise(
+    implicit context: Context)(status: constexpr PromiseState,
+    result: JSAny): JSPromise {
   dcheck(status != PromiseState::kPending);
 
   const instance = InnerNewJSPromise();
@@ -268,8 +274,9 @@ transitioning macro NewJSPromise(implicit context: Context)(
   return instance;
 }
 
-macro NewPromiseReaction(implicit context: Context)(
-    handlerContext: Context, next: Zero|PromiseReaction,
+macro NewPromiseReaction(
+    implicit context: Context)(handlerContext: Context,
+    next: Zero|PromiseReaction,
     promiseOrCapability: JSPromise|PromiseCapability|Undefined,
     fulfillHandler: Callable|Undefined,
     rejectHandler: Callable|Undefined): PromiseReaction {
@@ -289,9 +296,9 @@ macro NewPromiseReaction(implicit context: Context)(
 extern macro PromiseResolveThenableJobTaskMapConstant(): Map;
 
 // https://tc39.es/ecma262/#sec-newpromiseresolvethenablejob
-macro NewPromiseResolveThenableJobTask(implicit context: Context)(
-    promiseToResolve: JSPromise, thenable: JSReceiver,
-    then: Callable): PromiseResolveThenableJobTask {
+macro NewPromiseResolveThenableJobTask(
+    implicit context: Context)(promiseToResolve: JSPromise,
+    thenable: JSReceiver, then: Callable): PromiseResolveThenableJobTask {
   // 2. Let getThenRealmResult be GetFunctionRealm(then).
   // 3. If getThenRealmResult is a normal completion, then let thenRealm be
   //    getThenRealmResult.[[Value]].
@@ -317,8 +324,7 @@ macro NewPromiseResolveThenableJobTask(implicit context: Context)(
 }
 
 struct InvokeThenOneArgFunctor {
-  transitioning
-  macro Call(
+  transitioning macro Call(
       nativeContext: NativeContext, then: JSAny, receiver: JSAny, arg1: JSAny,
       _arg2: JSAny): JSAny {
     return Call(nativeContext, then, receiver, arg1);
@@ -326,18 +332,16 @@ struct InvokeThenOneArgFunctor {
 }
 
 struct InvokeThenTwoArgFunctor {
-  transitioning
-  macro Call(
+  transitioning macro Call(
       nativeContext: NativeContext, then: JSAny, receiver: JSAny, arg1: JSAny,
       arg2: JSAny): JSAny {
     return Call(nativeContext, then, receiver, arg1, arg2);
   }
 }
 
-transitioning
-macro InvokeThen<F: type>(implicit context: Context)(
-    nativeContext: NativeContext, receiver: JSAny, arg1: JSAny, arg2: JSAny,
-    callFunctor: F): JSAny {
+transitioning macro InvokeThen<F: type>(
+    implicit context: Context)(nativeContext: NativeContext, receiver: JSAny,
+    arg1: JSAny, arg2: JSAny, callFunctor: F): JSAny {
   // We can skip the "then" lookup on {receiver} if it's [[Prototype]]
   // is the (initial) Promise.prototype and the Promise#then protector
   // is intact, as that guards the lookup path for the "then" property
@@ -355,25 +359,23 @@ macro InvokeThen<F: type>(implicit context: Context)(
     }
 }
 
-transitioning
-macro InvokeThen(implicit context: Context)(
-    nativeContext: NativeContext, receiver: JSAny, arg: JSAny): JSAny {
+transitioning macro InvokeThen(
+    implicit context: Context)(nativeContext: NativeContext, receiver: JSAny,
+    arg: JSAny): JSAny {
   return InvokeThen(
       nativeContext, receiver, arg, Undefined, InvokeThenOneArgFunctor{});
 }
 
-transitioning
-macro InvokeThen(implicit context: Context)(
-    nativeContext: NativeContext, receiver: JSAny, arg1: JSAny,
-    arg2: JSAny): JSAny {
+transitioning macro InvokeThen(
+    implicit context: Context)(nativeContext: NativeContext, receiver: JSAny,
+    arg1: JSAny, arg2: JSAny): JSAny {
   return InvokeThen(
       nativeContext, receiver, arg1, arg2, InvokeThenTwoArgFunctor{});
 }
 
-transitioning
-macro BranchIfAccessCheckFailed(implicit context: Context)(
-    nativeContext: NativeContext, promiseConstructor: JSAny,
-    executor: JSAny): void labels IfNoAccess {
+transitioning macro BranchIfAccessCheckFailed(
+    implicit context: Context)(nativeContext: NativeContext,
+    promiseConstructor: JSAny, executor: JSAny): void labels IfNoAccess {
   try {
     // If executor is a bound function, load the bound function until we've
     // reached an actual function.
diff --git a/deps/v8/src/builtins/promise-race.tq b/deps/v8/src/builtins/promise-race.tq
index 1d15dde666664e..39a1c26e24c4cb 100644
--- a/deps/v8/src/builtins/promise-race.tq
+++ b/deps/v8/src/builtins/promise-race.tq
@@ -7,8 +7,7 @@
 namespace promise {
 
 // https://tc39.es/ecma262/#sec-promise.race
-transitioning javascript builtin
-PromiseRace(
+transitioning javascript builtin PromiseRace(
     js-implicit context: Context, receiver: JSAny)(iterable: JSAny): JSAny {
   const receiver = Cast<JSReceiver>(receiver)
       otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, 'Promise.race');
diff --git a/deps/v8/src/builtins/promise-reaction-job.tq b/deps/v8/src/builtins/promise-reaction-job.tq
index 30283591075c17..3ea7ca28abefeb 100644
--- a/deps/v8/src/builtins/promise-reaction-job.tq
+++ b/deps/v8/src/builtins/promise-reaction-job.tq
@@ -6,8 +6,7 @@
 
 namespace promise {
 
-transitioning
-macro RejectPromiseReactionJob(
+transitioning macro RejectPromiseReactionJob(
     context: Context,
     promiseOrCapability: JSPromise|PromiseCapability|Undefined, reason: JSAny,
     reactionType: constexpr PromiseReactionType): JSAny {
@@ -39,8 +38,7 @@ macro RejectPromiseReactionJob(
   }
 }
 
-transitioning
-macro FuflfillPromiseReactionJob(
+transitioning macro FuflfillPromiseReactionJob(
     context: Context,
     promiseOrCapability: JSPromise|PromiseCapability|Undefined, result: JSAny,
     reactionType: constexpr PromiseReactionType): JSAny {
@@ -69,8 +67,7 @@ macro FuflfillPromiseReactionJob(
 }
 
 // https://tc39.es/ecma262/#sec-promisereactionjob
-transitioning
-macro PromiseReactionJob(
+transitioning macro PromiseReactionJob(
     context: Context, argument: JSAny, handler: Callable|Undefined,
     promiseOrCapability: JSPromise|PromiseCapability|Undefined,
     reactionType: constexpr PromiseReactionType): JSAny {
@@ -105,17 +102,15 @@ macro PromiseReactionJob(
   }
 }
 
-transitioning builtin
-PromiseFulfillReactionJob(implicit context: Context)(
-    value: JSAny, handler: Callable|Undefined,
+transitioning builtin PromiseFulfillReactionJob(
+    implicit context: Context)(value: JSAny, handler: Callable|Undefined,
     promiseOrCapability: JSPromise|PromiseCapability|Undefined): JSAny {
   return PromiseReactionJob(
       context, value, handler, promiseOrCapability, kPromiseReactionFulfill);
 }
 
-transitioning builtin
-PromiseRejectReactionJob(implicit context: Context)(
-    reason: JSAny, handler: Callable|Undefined,
+transitioning builtin PromiseRejectReactionJob(
+    implicit context: Context)(reason: JSAny, handler: Callable|Undefined,
     promiseOrCapability: JSPromise|PromiseCapability|Undefined): JSAny {
   return PromiseReactionJob(
       context, reason, handler, promiseOrCapability, kPromiseReactionReject);
diff --git a/deps/v8/src/builtins/promise-resolve.tq b/deps/v8/src/builtins/promise-resolve.tq
index 768691ecaa4836..dd1316b281f4f5 100644
--- a/deps/v8/src/builtins/promise-resolve.tq
+++ b/deps/v8/src/builtins/promise-resolve.tq
@@ -5,8 +5,8 @@
 #include 'src/builtins/builtins-promise-gen.h'
 
 namespace runtime {
-extern transitioning runtime
-ResolvePromise(implicit context: Context)(JSPromise, JSAny): JSAny;
+extern transitioning runtime ResolvePromise(
+    implicit context: Context)(JSPromise, JSAny): JSAny;
 }
 
 namespace promise {
@@ -14,8 +14,7 @@ extern macro ConstructorStringConstant(): String;
 const kConstructorString: String = ConstructorStringConstant();
 
 // https://tc39.es/ecma262/#sec-promise.resolve
-transitioning javascript builtin
-PromiseResolveTrampoline(
+transitioning javascript builtin PromiseResolveTrampoline(
     js-implicit context: NativeContext, receiver: JSAny)(value: JSAny): JSAny {
   // 1. Let C be the this value.
   // 2. If Type(C) is not Object, throw a TypeError exception.
@@ -26,9 +25,8 @@ PromiseResolveTrampoline(
   return PromiseResolve(receiver, value);
 }
 
-transitioning builtin
-PromiseResolve(implicit context: Context)(
-    constructor: JSReceiver, value: JSAny): JSAny {
+transitioning builtin PromiseResolve(
+    implicit context: Context)(constructor: JSReceiver, value: JSAny): JSAny {
   const nativeContext = LoadNativeContext(context);
   const promiseFun = *NativeContextSlot(
       nativeContext, ContextSlot::PROMISE_FUNCTION_INDEX);
@@ -89,9 +87,8 @@ extern macro ThenStringConstant(): String;
 const kThenString: String = ThenStringConstant();
 
 // https://tc39.es/ecma262/#sec-promise-resolve-functions
-transitioning builtin
-ResolvePromise(implicit context: Context)(
-    promise: JSPromise, resolution: JSAny): JSAny {
+transitioning builtin ResolvePromise(
+    implicit context: Context)(promise: JSPromise, resolution: JSAny): JSAny {
   // 7. If SameValue(resolution, promise) is true, then
   // If promise hook is enabled or the debugger is active, let
   // the runtime handle this operation, which greatly reduces
diff --git a/deps/v8/src/builtins/promise-then.tq b/deps/v8/src/builtins/promise-then.tq
index efa12855755d5a..e4d81d54124fa7 100644
--- a/deps/v8/src/builtins/promise-then.tq
+++ b/deps/v8/src/builtins/promise-then.tq
@@ -5,17 +5,15 @@
 #include 'src/builtins/builtins-promise-gen.h'
 
 namespace runtime {
-extern transitioning runtime
-DebugPromiseThen(implicit context: Context)(JSAny): JSAny;
+extern transitioning runtime DebugPromiseThen(
+    implicit context: Context)(JSAny): JSAny;
 }
 
 namespace promise {
 
-extern macro
-CodeStubAssembler::HasAsyncEventDelegate(): bool;
+extern macro CodeStubAssembler::HasAsyncEventDelegate(): bool;
 
-macro
-IsPromiseSpeciesLookupChainIntact(
+macro IsPromiseSpeciesLookupChainIntact(
     nativeContext: NativeContext, promiseMap: Map): bool {
   const promisePrototype =
       *NativeContextSlot(nativeContext, ContextSlot::PROMISE_PROTOTYPE_INDEX);
@@ -25,9 +23,9 @@ IsPromiseSpeciesLookupChainIntact(
 }
 
 // https://tc39.es/ecma262/#sec-promise.prototype.then
-transitioning javascript builtin
-PromisePrototypeThen(js-implicit context: NativeContext, receiver: JSAny)(
-    onFulfilled: JSAny, onRejected: JSAny): JSAny {
+transitioning javascript builtin PromisePrototypeThen(
+    js-implicit context: NativeContext, receiver: JSAny)(onFulfilled: JSAny,
+    onRejected: JSAny): JSAny {
   // 1. Let promise be the this value.
   // 2. If IsPromise(promise) is false, throw a TypeError exception.
   const promise = Cast<JSPromise>(receiver) otherwise ThrowTypeError(
diff --git a/deps/v8/src/builtins/promise-withresolvers.tq b/deps/v8/src/builtins/promise-withresolvers.tq
new file mode 100644
index 00000000000000..a56d9151636c79
--- /dev/null
+++ b/deps/v8/src/builtins/promise-withresolvers.tq
@@ -0,0 +1,33 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace promise {
+
+extern macro AllocatePromiseWithResolversResult(
+    implicit context: Context)(JSAny, JSAny, JSAny): JSObject;
+
+// https://tc39.es/proposal-promise-with-resolvers/#sec-promise.withResolvers
+transitioning javascript builtin PromiseWithResolvers(
+    js-implicit context: Context, receiver: JSAny)(): JSAny {
+  // 1. Let C be the this value.
+  const receiver = Cast<JSReceiver>(receiver)
+      otherwise ThrowTypeError(
+      MessageTemplate::kCalledOnNonObject, 'Promise.withResolvers');
+
+  // 2. Let promiseCapability be ? NewPromiseCapability(C).
+  const capability = NewPromiseCapability(receiver, False);
+
+  // 3. Let obj be OrdinaryObjectCreate(%Object.prototype%).
+  // 4. Perform ! CreateDataPropertyOrThrow(obj, "promise",
+  //    promiseCapability.[[Promise]]).
+  // 5. Perform ! CreateDataPropertyOrThrow(obj, "resolve",
+  //    promiseCapability.[[Resolve]]).
+  // 6. Perform ! CreateDataPropertyOrThrow(obj, "reject",
+  //    promiseCapability.[[Reject]]).
+  // 7. Return obj.
+  return AllocatePromiseWithResolversResult(
+      capability.promise, capability.resolve, capability.reject);
+}
+
+}  // namespace promise
diff --git a/deps/v8/src/builtins/proxy-constructor.tq b/deps/v8/src/builtins/proxy-constructor.tq
index ea31ff6db87fd4..f38e19e67cd097 100644
--- a/deps/v8/src/builtins/proxy-constructor.tq
+++ b/deps/v8/src/builtins/proxy-constructor.tq
@@ -8,8 +8,7 @@ namespace proxy {
 
 // ES #sec-proxy-constructor
 // https://tc39.github.io/ecma262/#sec-proxy-constructor
-transitioning javascript builtin
-ProxyConstructor(
+transitioning javascript builtin ProxyConstructor(
     js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny)(
     target: JSAny, handler: JSAny): JSProxy {
   try {
diff --git a/deps/v8/src/builtins/proxy-delete-property.tq b/deps/v8/src/builtins/proxy-delete-property.tq
index 330cf8e0cdffa7..d9c7bc45eb2fc5 100644
--- a/deps/v8/src/builtins/proxy-delete-property.tq
+++ b/deps/v8/src/builtins/proxy-delete-property.tq
@@ -8,9 +8,9 @@ namespace proxy {
 
 // ES #sec-proxy-object-internal-methods-and-internal-slots-delete-p
 // https://tc39.es/ecma262/#sec-proxy-object-internal-methods-and-internal-slots-delete-p
-transitioning builtin
-ProxyDeleteProperty(implicit context: Context)(
-    proxy: JSProxy, name: PropertyKey, languageMode: LanguageModeSmi): JSAny {
+transitioning builtin ProxyDeleteProperty(
+    implicit context: Context)(proxy: JSProxy, name: PropertyKey,
+    languageMode: LanguageModeSmi): JSAny {
   const kTrapName: constexpr string = 'deleteProperty';
   // Handle deeply nested proxy.
   PerformStackCheck();
diff --git a/deps/v8/src/builtins/proxy-get-property.tq b/deps/v8/src/builtins/proxy-get-property.tq
index 0471cf318ace1a..dbce08d3b5ccf4 100644
--- a/deps/v8/src/builtins/proxy-get-property.tq
+++ b/deps/v8/src/builtins/proxy-get-property.tq
@@ -6,15 +6,14 @@
 
 namespace proxy {
 
-extern transitioning builtin GetPropertyWithReceiver(implicit context: Context)(
-    JSAny, Name, JSAny, Smi): JSAny;
+extern transitioning builtin GetPropertyWithReceiver(
+    implicit context: Context)(JSAny, Name, JSAny, Smi): JSAny;
 
 // ES #sec-proxy-object-internal-methods-and-internal-slots-get-p-receiver
 // https://tc39.github.io/ecma262/#sec-proxy-object-internal-methods-and-internal-slots-get-p-receiver
-transitioning builtin
-ProxyGetProperty(implicit context: Context)(
-    proxy: JSProxy, name: PropertyKey, receiverValue: JSAny,
-    onNonExistent: Smi): JSAny {
+transitioning builtin ProxyGetProperty(
+    implicit context: Context)(proxy: JSProxy, name: PropertyKey,
+    receiverValue: JSAny, onNonExistent: Smi): JSAny {
   PerformStackCheck();
   // 1. Assert: IsPropertyKey(P) is true.
   dcheck(TaggedIsNotSmi(name));
@@ -40,7 +39,7 @@ ProxyGetProperty(implicit context: Context)(
   // 6. Let trap be ? GetMethod(handler, "get").
   // 7. If trap is undefined, then (see 7.a below).
   // 7.a. Return ? target.[[Get]](P, Receiver).
-  const trap: Callable = GetMethod(handler, 'get')
+  const trap: Callable = GetInterestingMethod(handler, GetStringConstant())
       otherwise return GetPropertyWithReceiver(
       target, name, receiverValue, onNonExistent);
 
diff --git a/deps/v8/src/builtins/proxy-get-prototype-of.tq b/deps/v8/src/builtins/proxy-get-prototype-of.tq
index ad22ab2986854d..59ccc5e6a26bb2 100644
--- a/deps/v8/src/builtins/proxy-get-prototype-of.tq
+++ b/deps/v8/src/builtins/proxy-get-prototype-of.tq
@@ -8,8 +8,8 @@ namespace proxy {
 
 // ES #sec-proxy-object-internal-methods-and-internal-slots-isextensible
 // https://tc39.github.io/ecma262/#sec-proxy-object-internal-methods-and-internal-slots-isextensible
-transitioning builtin
-ProxyGetPrototypeOf(implicit context: Context)(proxy: JSProxy): JSAny {
+transitioning builtin ProxyGetPrototypeOf(
+    implicit context: Context)(proxy: JSProxy): JSAny {
   PerformStackCheck();
   const kTrapName: constexpr string = 'getPrototypeOf';
   try {
diff --git a/deps/v8/src/builtins/proxy-has-property.tq b/deps/v8/src/builtins/proxy-has-property.tq
index 75ac60d03cca07..4b8b27de2c3a67 100644
--- a/deps/v8/src/builtins/proxy-has-property.tq
+++ b/deps/v8/src/builtins/proxy-has-property.tq
@@ -8,8 +8,8 @@ namespace proxy {
 
 // ES #sec-proxy-object-internal-methods-and-internal-slots-hasproperty-p
 // https://tc39.github.io/ecma262/#sec-proxy-object-internal-methods-and-internal-slots-hasproperty-p
-transitioning builtin ProxyHasProperty(implicit context: Context)(
-    proxy: JSProxy, name: PropertyKey): JSAny {
+transitioning builtin ProxyHasProperty(
+    implicit context: Context)(proxy: JSProxy, name: PropertyKey): JSAny {
   dcheck(Is<JSProxy>(proxy));
 
   PerformStackCheck();
diff --git a/deps/v8/src/builtins/proxy-is-extensible.tq b/deps/v8/src/builtins/proxy-is-extensible.tq
index 58f147c29646eb..ec7797ec6af7fc 100644
--- a/deps/v8/src/builtins/proxy-is-extensible.tq
+++ b/deps/v8/src/builtins/proxy-is-extensible.tq
@@ -8,8 +8,8 @@ namespace proxy {
 
 // ES #sec-proxy-object-internal-methods-and-internal-slots-isextensible
 // https://tc39.github.io/ecma262/#sec-proxy-object-internal-methods-and-internal-slots-isextensible
-transitioning builtin ProxyIsExtensible(implicit context: Context)(
-    proxy: JSProxy): JSAny {
+transitioning builtin ProxyIsExtensible(
+    implicit context: Context)(proxy: JSProxy): JSAny {
   PerformStackCheck();
   const kTrapName: constexpr string = 'isExtensible';
   try {
diff --git a/deps/v8/src/builtins/proxy-prevent-extensions.tq b/deps/v8/src/builtins/proxy-prevent-extensions.tq
index 9f7a226b3abca0..768446f6c86d02 100644
--- a/deps/v8/src/builtins/proxy-prevent-extensions.tq
+++ b/deps/v8/src/builtins/proxy-prevent-extensions.tq
@@ -8,9 +8,8 @@ namespace proxy {
 
 // ES #sec-proxy-object-internal-methods-and-internal-slots-preventextensions
 // https://tc39.es/ecma262/#sec-proxy-object-internal-methods-and-internal-slots-preventextensions
-transitioning builtin
-ProxyPreventExtensions(implicit context: Context)(
-    proxy: JSProxy, doThrow: Boolean): JSAny {
+transitioning builtin ProxyPreventExtensions(
+    implicit context: Context)(proxy: JSProxy, doThrow: Boolean): JSAny {
   PerformStackCheck();
   const kTrapName: constexpr string = 'preventExtensions';
   try {
diff --git a/deps/v8/src/builtins/proxy-revocable.tq b/deps/v8/src/builtins/proxy-revocable.tq
index 989db1c04c6129..6a07a8b7f756c3 100644
--- a/deps/v8/src/builtins/proxy-revocable.tq
+++ b/deps/v8/src/builtins/proxy-revocable.tq
@@ -11,9 +11,9 @@ extern macro ProxiesCodeStubAssembler::AllocateProxyRevokeFunction(
 
 // Proxy.revocable(target, handler)
 // https://tc39.github.io/ecma262/#sec-proxy.revocable
-transitioning javascript builtin
-ProxyRevocable(js-implicit context: NativeContext)(
-    target: JSAny, handler: JSAny): JSProxyRevocableResult {
+transitioning javascript builtin ProxyRevocable(
+    js-implicit context: NativeContext)(target: JSAny,
+    handler: JSAny): JSProxyRevocableResult {
   try {
     // 1. Let p be ? ProxyCreate(target, handler).
     const targetJSReceiver =
diff --git a/deps/v8/src/builtins/proxy-revoke.tq b/deps/v8/src/builtins/proxy-revoke.tq
index 0c6c9dbb258a9e..52469fdd4f9aba 100644
--- a/deps/v8/src/builtins/proxy-revoke.tq
+++ b/deps/v8/src/builtins/proxy-revoke.tq
@@ -8,8 +8,8 @@ namespace proxy {
 
 // Proxy Revocation Functions
 // https://tc39.github.io/ecma262/#sec-proxy-revocation-functions
-transitioning javascript builtin
-ProxyRevoke(js-implicit context: Context)(): Undefined {
+transitioning javascript builtin ProxyRevoke(js-implicit context: Context)():
+    Undefined {
   const context = %RawDownCast<ProxyRevokeFunctionContext>(context);
 
   // 1. Let p be F.[[RevocableProxy]].
diff --git a/deps/v8/src/builtins/proxy-set-property.tq b/deps/v8/src/builtins/proxy-set-property.tq
index 2aa95ccae1057c..b63deb9a5dc3e0 100644
--- a/deps/v8/src/builtins/proxy-set-property.tq
+++ b/deps/v8/src/builtins/proxy-set-property.tq
@@ -6,21 +6,19 @@
 
 namespace proxy {
 
-extern transitioning runtime
-SetPropertyWithReceiver(implicit context: Context)(
-    Object, Name, Object, Object): void;
+extern transitioning runtime SetPropertyWithReceiver(
+    implicit context: Context)(Object, Name, Object, Object): void;
 
-transitioning macro CallThrowTypeErrorIfStrict(implicit context: Context)(
-    message: constexpr MessageTemplate): void {
+transitioning macro CallThrowTypeErrorIfStrict(
+    implicit context: Context)(message: constexpr MessageTemplate): void {
   ThrowTypeErrorIfStrict(SmiConstant(message), Null, Null);
 }
 
 // ES #sec-proxy-object-internal-methods-and-internal-slots-set-p-v-receiver
 // https://tc39.github.io/ecma262/#sec-proxy-object-internal-methods-and-internal-slots-set-p-v-receiver
-transitioning builtin
-ProxySetProperty(implicit context: Context)(
-    proxy: JSProxy, name: PropertyKey|PrivateSymbol, value: JSAny,
-    receiverValue: JSAny): JSAny {
+transitioning builtin ProxySetProperty(
+    implicit context: Context)(proxy: JSProxy, name: PropertyKey|PrivateSymbol,
+    value: JSAny, receiverValue: JSAny): JSAny {
   // Handle deeply nested proxy.
   PerformStackCheck();
   // 1. Assert: IsPropertyKey(P) is true.
diff --git a/deps/v8/src/builtins/proxy-set-prototype-of.tq b/deps/v8/src/builtins/proxy-set-prototype-of.tq
index 57ceb2778440bc..9054a7b90f1145 100644
--- a/deps/v8/src/builtins/proxy-set-prototype-of.tq
+++ b/deps/v8/src/builtins/proxy-set-prototype-of.tq
@@ -8,9 +8,9 @@ namespace proxy {
 
 // ES #sec-proxy-object-internal-methods-and-internal-slots-setprototypeof-v
 // https://tc39.es/ecma262/#sec-proxy-object-internal-methods-and-internal-slots-setprototypeof-v
-transitioning builtin
-ProxySetPrototypeOf(implicit context: Context)(
-    proxy: JSProxy, proto: Null|JSReceiver, doThrow: Boolean): JSAny {
+transitioning builtin ProxySetPrototypeOf(
+    implicit context: Context)(proxy: JSProxy, proto: Null|JSReceiver,
+    doThrow: Boolean): JSAny {
   PerformStackCheck();
   const kTrapName: constexpr string = 'setPrototypeOf';
   try {
diff --git a/deps/v8/src/builtins/proxy.tq b/deps/v8/src/builtins/proxy.tq
index 9e56a28903e221..2471e30e875edc 100644
--- a/deps/v8/src/builtins/proxy.tq
+++ b/deps/v8/src/builtins/proxy.tq
@@ -6,12 +6,12 @@
 
 namespace proxy {
 
-extern macro ProxiesCodeStubAssembler::AllocateProxy(implicit context: Context)(
-    JSReceiver, JSReceiver): JSProxy;
+extern macro ProxiesCodeStubAssembler::AllocateProxy(
+    implicit context: Context)(JSReceiver, JSReceiver): JSProxy;
 
 extern transitioning macro ProxiesCodeStubAssembler::CheckGetSetTrapResult(
-    implicit context: Context)(
-    JSReceiver, JSProxy, Name, Object, constexpr int31): void;
+    implicit context: Context)(JSReceiver, JSProxy, Name, Object,
+    constexpr int31): void;
 
 extern transitioning macro ProxiesCodeStubAssembler::CheckDeleteTrapResult(
     implicit context: Context)(JSReceiver, JSProxy, Name): void;
@@ -26,7 +26,7 @@ const kProxySet: constexpr int31
 
 type ProxyRevokeFunctionContext extends FunctionContext;
 extern enum ProxyRevokeFunctionContextSlot extends intptr
-constexpr 'ProxiesCodeStubAssembler::ProxyRevokeFunctionContextSlot' {
+    constexpr 'ProxiesCodeStubAssembler::ProxyRevokeFunctionContextSlot' {
   kProxySlot: Slot<ProxyRevokeFunctionContext, JSProxy|Null>,
   kProxyContextLength
 }
diff --git a/deps/v8/src/builtins/reflect.tq b/deps/v8/src/builtins/reflect.tq
index 5ed70c81c5a100..3447991622ad78 100644
--- a/deps/v8/src/builtins/reflect.tq
+++ b/deps/v8/src/builtins/reflect.tq
@@ -4,8 +4,8 @@
 
 namespace reflect {
 // ES6 section 26.1.10 Reflect.isExtensible
-transitioning javascript builtin
-ReflectIsExtensible(js-implicit context: NativeContext)(object: JSAny): JSAny {
+transitioning javascript builtin ReflectIsExtensible(
+    js-implicit context: NativeContext)(object: JSAny): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object)
       otherwise ThrowTypeError(
       MessageTemplate::kCalledOnNonObject, 'Reflect.isExtensible');
@@ -13,9 +13,8 @@ ReflectIsExtensible(js-implicit context: NativeContext)(object: JSAny): JSAny {
 }
 
 // ES6 section 26.1.12 Reflect.preventExtensions
-transitioning javascript builtin
-ReflectPreventExtensions(js-implicit context: NativeContext)(object: JSAny):
-    JSAny {
+transitioning javascript builtin ReflectPreventExtensions(
+    js-implicit context: NativeContext)(object: JSAny): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object)
       otherwise ThrowTypeError(
       MessageTemplate::kCalledOnNonObject, 'Reflect.preventExtensions');
@@ -23,9 +22,8 @@ ReflectPreventExtensions(js-implicit context: NativeContext)(object: JSAny):
 }
 
 // ES6 section 26.1.8 Reflect.getPrototypeOf
-transitioning javascript builtin
-ReflectGetPrototypeOf(js-implicit context: NativeContext)(object: JSAny):
-    JSAny {
+transitioning javascript builtin ReflectGetPrototypeOf(
+    js-implicit context: NativeContext)(object: JSAny): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object)
       otherwise ThrowTypeError(
       MessageTemplate::kCalledOnNonObject, 'Reflect.getPrototypeOf');
@@ -41,9 +39,9 @@ transitioning javascript builtin ReflectSetPrototypeOf(
 
   // Wasm objects do not support having prototypes.
   @if(V8_ENABLE_WEBASSEMBLY)
-  if (Is<WasmObject>(objectJSReceiver)) {
-    ThrowTypeError(MessageTemplate::kWasmObjectsAreOpaque);
-  }
+    if (Is<WasmObject>(objectJSReceiver)) {
+      ThrowTypeError(MessageTemplate::kWasmObjectsAreOpaque);
+    }
 
   typeswitch (proto) {
     case (proto: JSReceiver|Null): {
@@ -55,17 +53,16 @@ transitioning javascript builtin ReflectSetPrototypeOf(
   }
 }
 
-extern transitioning builtin ToName(implicit context: Context)(JSAny): AnyName;
 type OnNonExistent constexpr 'OnNonExistent';
 const kReturnUndefined: constexpr OnNonExistent
     generates 'OnNonExistent::kReturnUndefined';
 extern macro SmiConstant(constexpr OnNonExistent): Smi;
-extern transitioning builtin GetPropertyWithReceiver(implicit context: Context)(
-    JSAny, Name, JSAny, Smi): JSAny;
+extern transitioning builtin GetPropertyWithReceiver(
+    implicit context: Context)(JSAny, Name, JSAny, Smi): JSAny;
 
 // ES6 section 26.1.6 Reflect.get
-transitioning javascript builtin
-ReflectGet(js-implicit context: NativeContext)(...arguments): JSAny {
+transitioning javascript builtin ReflectGet(
+    js-implicit context: NativeContext)(...arguments): JSAny {
   const object: JSAny = arguments[0];
   const objectJSReceiver = Cast<JSReceiver>(object)
       otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, 'Reflect.get');
@@ -87,9 +84,8 @@ transitioning javascript builtin ReflectDeleteProperty(
 }
 
 // ES section #sec-reflect.has
-transitioning javascript builtin
-ReflectHas(js-implicit context: NativeContext)(
-    object: JSAny, key: JSAny): JSAny {
+transitioning javascript builtin ReflectHas(
+    js-implicit context: NativeContext)(object: JSAny, key: JSAny): JSAny {
   const objectJSReceiver = Cast<JSReceiver>(object)
       otherwise ThrowTypeError(MessageTemplate::kCalledOnNonObject, 'Reflect.has');
   return HasProperty(objectJSReceiver, key);
@@ -99,9 +95,9 @@ extern transitioning builtin GetOwnPropertyDescriptor(
     implicit context: Context)(JSAny, Name): JSAny;
 
 // ES6 section 26.1.7 Reflect.getOwnPropertyDescriptor
-transitioning javascript builtin
-ReflectGetOwnPropertyDescriptor(js-implicit context: NativeContext)(
-    target: JSAny, propertyKey: JSAny): JSAny {
+transitioning javascript builtin ReflectGetOwnPropertyDescriptor(
+    js-implicit context: NativeContext)(target: JSAny,
+    propertyKey: JSAny): JSAny {
   const targetReceiver = Cast<JSReceiver>(target)
       otherwise ThrowTypeError(
       MessageTemplate::kCalledOnNonObject, 'Reflect.getOwnPropertyDescriptor');
diff --git a/deps/v8/src/builtins/regexp-exec.tq b/deps/v8/src/builtins/regexp-exec.tq
index 87b00c1fdcdfc7..813dcd6baa20db 100644
--- a/deps/v8/src/builtins/regexp-exec.tq
+++ b/deps/v8/src/builtins/regexp-exec.tq
@@ -7,20 +7,19 @@
 namespace regexp {
 
 @export
-transitioning macro RegExpPrototypeExecBodyFast(implicit context: Context)(
-    receiver: JSReceiver, string: String): JSAny {
+transitioning macro RegExpPrototypeExecBodyFast(
+    implicit context: Context)(receiver: JSReceiver, string: String): JSAny {
   return RegExpPrototypeExecBody(receiver, string, true);
 }
 
-transitioning macro RegExpPrototypeExecBodySlow(implicit context: Context)(
-    receiver: JSReceiver, string: String): JSAny {
+transitioning macro RegExpPrototypeExecBodySlow(
+    implicit context: Context)(receiver: JSReceiver, string: String): JSAny {
   return RegExpPrototypeExecBody(receiver, string, false);
 }
 
 // Slow path stub for RegExpPrototypeExec to decrease code size.
-transitioning builtin
-RegExpPrototypeExecSlow(implicit context: Context)(
-    regexp: JSRegExp, string: String): JSAny {
+transitioning builtin RegExpPrototypeExecSlow(
+    implicit context: Context)(regexp: JSRegExp, string: String): JSAny {
   return RegExpPrototypeExecBodySlow(regexp, string);
 }
 
@@ -30,7 +29,8 @@ extern macro RegExpBuiltinsAssembler::IsFastRegExpNoPrototype(
 // ES#sec-regexp.prototype.exec
 // RegExp.prototype.exec ( string )
 transitioning javascript builtin RegExpPrototypeExec(
-    js-implicit context: NativeContext, receiver: JSAny)(string: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    string: JSAny): JSAny {
   // Ensure {receiver} is a JSRegExp.
   const receiver = Cast<JSRegExp>(receiver) otherwise ThrowTypeError(
       MessageTemplate::kIncompatibleMethodReceiver, 'RegExp.prototype.exec',
diff --git a/deps/v8/src/builtins/regexp-match-all.tq b/deps/v8/src/builtins/regexp-match-all.tq
index 48f12218b94889..fd4f76d23f429c 100644
--- a/deps/v8/src/builtins/regexp-match-all.tq
+++ b/deps/v8/src/builtins/regexp-match-all.tq
@@ -6,13 +6,13 @@
 
 namespace regexp {
 
-extern transitioning macro
-RegExpMatchAllAssembler::CreateRegExpStringIterator(
+extern transitioning macro RegExpMatchAllAssembler::CreateRegExpStringIterator(
     NativeContext, Object, String, bool, bool): JSAny;
 
 @export
-transitioning macro RegExpPrototypeMatchAllImpl(implicit context: Context)(
-    nativeContext: NativeContext, receiver: JSAny, string: JSAny): JSAny {
+transitioning macro RegExpPrototypeMatchAllImpl(
+    implicit context: Context)(nativeContext: NativeContext, receiver: JSAny,
+    string: JSAny): JSAny {
   // 1. Let R be the this value.
   // 2. If Type(R) is not Object, throw a TypeError exception.
   ThrowIfNotJSReceiver(
@@ -102,7 +102,8 @@ transitioning macro RegExpPrototypeMatchAllImpl(implicit context: Context)(
 // https://tc39.github.io/proposal-string-matchall/
 // RegExp.prototype [ @@matchAll ] ( string )
 transitioning javascript builtin RegExpPrototypeMatchAll(
-    js-implicit context: NativeContext, receiver: JSAny)(string: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    string: JSAny): JSAny {
   return RegExpPrototypeMatchAllImpl(context, receiver, string);
 }
 
diff --git a/deps/v8/src/builtins/regexp-match.tq b/deps/v8/src/builtins/regexp-match.tq
index ff2dcf2c33c0fc..1f733cb3194f1e 100644
--- a/deps/v8/src/builtins/regexp-match.tq
+++ b/deps/v8/src/builtins/regexp-match.tq
@@ -16,11 +16,12 @@ const kAtomPatternIndex: constexpr int31
 extern transitioning macro RegExpBuiltinsAssembler::FlagGetter(
     implicit context: Context)(Object, constexpr Flag, constexpr bool): bool;
 
-extern macro UnsafeLoadFixedArrayElement(
-    RegExpMatchInfo, constexpr int31): Object;
+extern macro UnsafeLoadFixedArrayElement(RegExpMatchInfo, constexpr int31):
+    Object;
 
-transitioning macro RegExpPrototypeMatchBody(implicit context: Context)(
-    regexp: JSReceiver, string: String, isFastPath: constexpr bool): JSAny {
+transitioning macro RegExpPrototypeMatchBody(
+    implicit context: Context)(regexp: JSReceiver, string: String,
+    isFastPath: constexpr bool): JSAny {
   if constexpr (isFastPath) {
     dcheck(Is<FastJSRegExp>(regexp));
   }
@@ -120,28 +121,29 @@ transitioning macro RegExpPrototypeMatchBody(implicit context: Context)(
   VerifiedUnreachable();
 }
 
-transitioning macro FastRegExpPrototypeMatchBody(implicit context: Context)(
-    receiver: FastJSRegExp, string: String): JSAny {
+transitioning macro FastRegExpPrototypeMatchBody(
+    implicit context: Context)(receiver: FastJSRegExp, string: String): JSAny {
   return RegExpPrototypeMatchBody(receiver, string, true);
 }
 
-transitioning macro SlowRegExpPrototypeMatchBody(implicit context: Context)(
-    receiver: JSReceiver, string: String): JSAny {
+transitioning macro SlowRegExpPrototypeMatchBody(
+    implicit context: Context)(receiver: JSReceiver, string: String): JSAny {
   return RegExpPrototypeMatchBody(receiver, string, false);
 }
 
 // Helper that skips a few initial checks. and assumes...
 // 1) receiver is a "fast" RegExp
 // 2) pattern is a string
-transitioning builtin RegExpMatchFast(implicit context: Context)(
-    receiver: FastJSRegExp, string: String): JSAny {
+transitioning builtin RegExpMatchFast(
+    implicit context: Context)(receiver: FastJSRegExp, string: String): JSAny {
   return FastRegExpPrototypeMatchBody(receiver, string);
 }
 
 // ES#sec-regexp.prototype-@@match
 // RegExp.prototype [ @@match ] ( string )
 transitioning javascript builtin RegExpPrototypeMatch(
-    js-implicit context: NativeContext, receiver: JSAny)(string: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    string: JSAny): JSAny {
   ThrowIfNotJSReceiver(
       receiver, MessageTemplate::kIncompatibleMethodReceiver,
       'RegExp.prototype.@@match');
diff --git a/deps/v8/src/builtins/regexp-replace.tq b/deps/v8/src/builtins/regexp-replace.tq
index 127755ec888a49..046ae285321bef 100644
--- a/deps/v8/src/builtins/regexp-replace.tq
+++ b/deps/v8/src/builtins/regexp-replace.tq
@@ -6,25 +6,23 @@
 
 namespace regexp {
 
-extern builtin
-SubString(implicit context: Context)(String, Smi, Smi): String;
-
-extern runtime RegExpExecMultiple(implicit context: Context)(
-    JSRegExp, String, RegExpMatchInfo): Null|FixedArray;
-extern transitioning runtime
-RegExpReplaceRT(Context, JSReceiver, String, Object): String;
-extern transitioning runtime
-StringBuilderConcat(implicit context: Context)(FixedArray, Smi, String): String;
-extern transitioning runtime
-StringReplaceNonGlobalRegExpWithFunction(implicit context: Context)(
-    String, JSRegExp, Callable): String;
+extern builtin SubString(implicit context: Context)(String, Smi, Smi): String;
+
+extern runtime RegExpExecMultiple(
+    implicit context: Context)(JSRegExp, String, RegExpMatchInfo): Null
+    |FixedArray;
+extern transitioning runtime RegExpReplaceRT(
+    Context, JSReceiver, String, Object): String;
+extern transitioning runtime StringBuilderConcat(
+    implicit context: Context)(FixedArray, Smi, String): String;
+extern transitioning runtime StringReplaceNonGlobalRegExpWithFunction(
+    implicit context: Context)(String, JSRegExp, Callable): String;
 
 // matchesCapacity is the length of the matchesElements FixedArray, and
 // matchesElements is allowed to contain holes at the end.
 transitioning macro RegExpReplaceCallableNoExplicitCaptures(
-    implicit context: Context)(
-    matchesElements: FixedArray, matchesCapacity: intptr, string: String,
-    replaceFn: Callable): intptr {
+    implicit context: Context)(matchesElements: FixedArray,
+    matchesCapacity: intptr, string: String, replaceFn: Callable): intptr {
   let matchStart: Smi = 0;
   for (let i: intptr = 0; i < matchesCapacity; i++) {
     typeswitch (matchesElements.objects[i]) {
@@ -70,10 +68,9 @@ transitioning macro RegExpReplaceCallableNoExplicitCaptures(
 
 // matchesCapacity is the length of the matchesElements FixedArray, and
 // matchesElements is allowed to contain holes at the end.
-transitioning macro
-RegExpReplaceCallableWithExplicitCaptures(implicit context: Context)(
-    matchesElements: FixedArray, matchesCapacity: intptr,
-    replaceFn: Callable): intptr {
+transitioning macro RegExpReplaceCallableWithExplicitCaptures(
+    implicit context: Context)(matchesElements: FixedArray,
+    matchesCapacity: intptr, replaceFn: Callable): intptr {
   for (let i: intptr = 0; i < matchesCapacity; i++) {
     if (matchesElements.objects[i] == TheHole) {
       // No more elements.
@@ -94,8 +91,9 @@ RegExpReplaceCallableWithExplicitCaptures(implicit context: Context)(
   return matchesCapacity;
 }
 
-transitioning macro RegExpReplaceFastGlobalCallable(implicit context: Context)(
-    regexp: FastJSRegExp, string: String, replaceFn: Callable): String {
+transitioning macro RegExpReplaceFastGlobalCallable(
+    implicit context: Context)(regexp: FastJSRegExp, string: String,
+    replaceFn: Callable): String {
   regexp.lastIndex = 0;
 
   const result: Null|FixedArray =
@@ -131,8 +129,9 @@ transitioning macro RegExpReplaceFastGlobalCallable(implicit context: Context)(
   return StringBuilderConcat(matches, Convert<Smi>(matchesLength), string);
 }
 
-transitioning macro RegExpReplaceFastString(implicit context: Context)(
-    regexp: JSRegExp, string: String, replaceString: String): String {
+transitioning macro RegExpReplaceFastString(
+    implicit context: Context)(regexp: JSRegExp, string: String,
+    replaceString: String): String {
   // The fast path is reached only if {receiver} is an unmodified JSRegExp
   // instance, {replace_value} is non-callable, and ToString({replace_value})
   // does not contain '$', i.e. we're doing a simple string replacement.
@@ -186,8 +185,9 @@ transitioning macro RegExpReplaceFastString(implicit context: Context)(
   return result + SubString(string, lastMatchEnd, string.length_smi);
 }
 
-transitioning builtin RegExpReplace(implicit context: Context)(
-    regexp: FastJSRegExp, string: String, replaceValue: JSAny): String {
+transitioning builtin RegExpReplace(
+    implicit context: Context)(regexp: FastJSRegExp, string: String,
+    replaceValue: JSAny): String {
   // TODO(pwong): Remove dcheck when all callers (StringPrototypeReplace) are
   // from Torque.
   dcheck(Is<FastJSRegExp>(regexp));
diff --git a/deps/v8/src/builtins/regexp-search.tq b/deps/v8/src/builtins/regexp-search.tq
index 7deec8b1c64ff4..5e021b5f881350 100644
--- a/deps/v8/src/builtins/regexp-search.tq
+++ b/deps/v8/src/builtins/regexp-search.tq
@@ -6,9 +6,8 @@
 
 namespace regexp {
 
-transitioning macro
-RegExpPrototypeSearchBodyFast(implicit context: Context)(
-    regexp: JSRegExp, string: String): JSAny {
+transitioning macro RegExpPrototypeSearchBodyFast(
+    implicit context: Context)(regexp: JSRegExp, string: String): JSAny {
   dcheck(IsFastRegExpPermissive(regexp));
 
   // Grab the initial value of last index.
@@ -42,13 +41,13 @@ extern macro RegExpBuiltinsAssembler::BranchIfRegExpResult(
     implicit context: Context)(Object): never labels IsUnmodified,
     IsModified;
 
-macro
-IsRegExpResult(implicit context: Context)(execResult: HeapObject): bool {
+macro IsRegExpResult(implicit context: Context)(execResult: HeapObject):
+    bool {
   BranchIfRegExpResult(execResult) otherwise return true, return false;
 }
 
-transitioning macro RegExpPrototypeSearchBodySlow(implicit context: Context)(
-    regexp: JSReceiver, string: String): JSAny {
+transitioning macro RegExpPrototypeSearchBodySlow(
+    implicit context: Context)(regexp: JSReceiver, string: String): JSAny {
   // Grab the initial value of last index.
   const previousLastIndex = SlowLoadLastIndex(regexp);
   const smiZero: Smi = 0;
@@ -81,15 +80,16 @@ transitioning macro RegExpPrototypeSearchBodySlow(implicit context: Context)(
 // Helper that skips a few initial checks. and assumes...
 // 1) receiver is a "fast permissive" RegExp
 // 2) pattern is a string
-transitioning builtin RegExpSearchFast(implicit context: Context)(
-    receiver: JSRegExp, string: String): JSAny {
+transitioning builtin RegExpSearchFast(
+    implicit context: Context)(receiver: JSRegExp, string: String): JSAny {
   return RegExpPrototypeSearchBodyFast(receiver, string);
 }
 
 // ES#sec-regexp.prototype-@@search
 // RegExp.prototype [ @@search ] ( string )
 transitioning javascript builtin RegExpPrototypeSearch(
-    js-implicit context: NativeContext, receiver: JSAny)(string: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    string: JSAny): JSAny {
   ThrowIfNotJSReceiver(
       receiver, MessageTemplate::kIncompatibleMethodReceiver,
       'RegExp.prototype.@@search');
diff --git a/deps/v8/src/builtins/regexp-split.tq b/deps/v8/src/builtins/regexp-split.tq
index 47ff214130f142..1f4ae0b4a7f626 100644
--- a/deps/v8/src/builtins/regexp-split.tq
+++ b/deps/v8/src/builtins/regexp-split.tq
@@ -5,8 +5,8 @@
 #include 'src/builtins/builtins-regexp-gen.h'
 
 namespace runtime {
-extern transitioning runtime
-RegExpSplit(implicit context: Context)(JSReceiver, String, Object): JSAny;
+extern transitioning runtime RegExpSplit(
+    implicit context: Context)(JSReceiver, String, Object): JSAny;
 }  // namespace runtime
 
 namespace regexp {
@@ -18,9 +18,9 @@ extern transitioning macro RegExpBuiltinsAssembler::RegExpPrototypeSplitBody(
     implicit context: Context)(JSRegExp, String, Smi): JSArray;
 
 // Helper that skips a few initial checks.
-transitioning builtin
-RegExpSplit(implicit context: Context)(
-    regexp: FastJSRegExp, string: String, limit: JSAny): JSAny {
+transitioning builtin RegExpSplit(
+    implicit context: Context)(regexp: FastJSRegExp, string: String,
+    limit: JSAny): JSAny {
   let sanitizedLimit: Smi;
 
   // We need to be extra-strict and require the given limit to be either
diff --git a/deps/v8/src/builtins/regexp-test.tq b/deps/v8/src/builtins/regexp-test.tq
index c83afd602de85c..c8d08f7c772c98 100644
--- a/deps/v8/src/builtins/regexp-test.tq
+++ b/deps/v8/src/builtins/regexp-test.tq
@@ -9,7 +9,8 @@ namespace regexp {
 // ES#sec-regexp.prototype.test
 // RegExp.prototype.test ( S )
 transitioning javascript builtin RegExpPrototypeTest(
-    js-implicit context: NativeContext, receiver: JSAny)(string: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    string: JSAny): JSAny {
   const methodName: constexpr string = 'RegExp.prototype.test';
   const receiver = Cast<JSReceiver>(receiver)
       otherwise ThrowTypeError(
@@ -25,8 +26,8 @@ transitioning javascript builtin RegExpPrototypeTest(
   return SelectBooleanConstant(matchIndices != Null);
 }
 
-transitioning builtin RegExpPrototypeTestFast(implicit context: Context)(
-    receiver: JSRegExp, string: String): Object {
+transitioning builtin RegExpPrototypeTestFast(
+    implicit context: Context)(receiver: JSRegExp, string: String): Object {
   RegExpPrototypeExecBodyWithoutResultFast(receiver, string)
       otherwise return False;
   return True;
diff --git a/deps/v8/src/builtins/regexp.tq b/deps/v8/src/builtins/regexp.tq
index 2ddcfd138eed27..9c426ebd7b8d39 100644
--- a/deps/v8/src/builtins/regexp.tq
+++ b/deps/v8/src/builtins/regexp.tq
@@ -16,7 +16,8 @@ macro IsFastRegExpForMatch(implicit context: Context)(o: HeapObject): bool {
 extern macro RegExpBuiltinsAssembler::BranchIfFastRegExpForSearch(
     implicit context: Context)(HeapObject): never labels IsFast,
     IsSlow;
-macro IsFastRegExpForSearch(implicit context: Context)(o: HeapObject): bool {
+macro IsFastRegExpForSearch(implicit context: Context)(o: HeapObject):
+    bool {
   BranchIfFastRegExpForSearch(o) otherwise return true, return false;
 }
 
@@ -32,14 +33,15 @@ extern macro RegExpBuiltinsAssembler::BranchIfFastRegExp_Permissive(
     IsSlow;
 
 @export
-macro IsFastRegExpPermissive(implicit context: Context)(o: HeapObject): bool {
+macro IsFastRegExpPermissive(implicit context: Context)(o: HeapObject):
+    bool {
   BranchIfFastRegExp_Permissive(o) otherwise return true, return false;
 }
 
 // ES#sec-regexpexec Runtime Semantics: RegExpExec ( R, S )
 @export
-transitioning macro RegExpExec(implicit context: Context)(
-    receiver: JSReceiver, string: String): JSAny {
+transitioning macro RegExpExec(
+    implicit context: Context)(receiver: JSReceiver, string: String): JSAny {
   // Take the slow path of fetching the exec property, calling it, and
   // verifying its return value.
 
@@ -65,15 +67,15 @@ transitioning macro RegExpExec(implicit context: Context)(
 }
 
 extern macro RegExpBuiltinsAssembler::ConstructNewResultFromMatchInfo(
-    implicit context: Context)(JSRegExp, RegExpMatchInfo, String, Number):
-    JSRegExpResult|JSRegExpResultWithIndices;
+    implicit context: Context)(JSRegExp, RegExpMatchInfo, String,
+    Number): JSRegExpResult|JSRegExpResultWithIndices;
 
 const kGlobalOrSticky: constexpr int31
     generates 'JSRegExp::kGlobal | JSRegExp::kSticky';
 
 extern macro RegExpBuiltinsAssembler::RegExpExecInternal(
-    implicit context: Context)(
-    JSRegExp, String, Number, RegExpMatchInfo): HeapObject;
+    implicit context: Context)(JSRegExp, String, Number,
+    RegExpMatchInfo): HeapObject;
 
 // ES#sec-regexp.prototype.exec
 // RegExp.prototype.exec ( string )
@@ -82,8 +84,8 @@ extern macro RegExpBuiltinsAssembler::RegExpExecInternal(
 // indices as returned by RegExpExecStub on successful match, and jumps to
 // IfDidNotMatch otherwise.
 transitioning macro RegExpPrototypeExecBodyWithoutResult(
-    implicit context: Context)(
-    regexp: JSRegExp, string: String, regexpLastIndex: Number,
+    implicit context: Context)(regexp: JSRegExp, string: String,
+    regexpLastIndex: Number,
     isFastPath: constexpr bool): RegExpMatchInfo labels IfDidNotMatch {
   if (isFastPath) {
     dcheck(HasInitialRegExpMap(regexp));
@@ -135,16 +137,15 @@ transitioning macro RegExpPrototypeExecBodyWithoutResult(
 
 @export
 transitioning macro RegExpPrototypeExecBodyWithoutResultFast(
-    implicit context: Context)(regexp: JSRegExp, string: String):
-    RegExpMatchInfo labels IfDidNotMatch {
+    implicit context: Context)(regexp: JSRegExp,
+    string: String): RegExpMatchInfo labels IfDidNotMatch {
   const lastIndex = LoadLastIndexAsLength(regexp, true);
   return RegExpPrototypeExecBodyWithoutResult(regexp, string, lastIndex, true)
       otherwise IfDidNotMatch;
 }
 
 transitioning macro RegExpPrototypeExecBodyWithoutResultFast(
-    implicit context: Context)(
-    regexp: JSRegExp, string: String,
+    implicit context: Context)(regexp: JSRegExp, string: String,
     lastIndex: Number): RegExpMatchInfo labels IfDidNotMatch {
   return RegExpPrototypeExecBodyWithoutResult(regexp, string, lastIndex, true)
       otherwise IfDidNotMatch;
@@ -152,8 +153,9 @@ transitioning macro RegExpPrototypeExecBodyWithoutResultFast(
 
 // ES#sec-regexp.prototype.exec
 // RegExp.prototype.exec ( string )
-transitioning macro RegExpPrototypeExecBody(implicit context: Context)(
-    receiver: JSReceiver, string: String, isFastPath: constexpr bool): JSAny {
+transitioning macro RegExpPrototypeExecBody(
+    implicit context: Context)(receiver: JSReceiver, string: String,
+    isFastPath: constexpr bool): JSAny {
   let regexp: JSRegExp;
   if constexpr (isFastPath) {
     regexp = UnsafeCast<JSRegExp>(receiver);
@@ -182,8 +184,8 @@ macro HasInitialRegExpMap(implicit context: Context)(o: HeapObject): bool {
   return initialMap == o.map;
 }
 
-macro IsReceiverInitialRegExpPrototype(implicit context: Context)(
-    receiver: Object): bool {
+macro IsReceiverInitialRegExpPrototype(
+    implicit context: Context)(receiver: Object): bool {
   const nativeContext = LoadNativeContext(context);
   const regexpFun = LoadRegExpFunction(nativeContext);
   const initialMap = UnsafeCast<Map>(regexpFun.prototype_or_initial_map);
@@ -210,13 +212,13 @@ const kRegExpPrototypeStickyGetter: constexpr int31
 const kRegExpPrototypeUnicodeGetter: constexpr int31
     generates 'v8::Isolate::kRegExpPrototypeUnicodeGetter';
 
-extern macro RegExpBuiltinsAssembler::FastFlagGetter(
-    JSRegExp, constexpr Flag): bool;
+extern macro RegExpBuiltinsAssembler::FastFlagGetter(JSRegExp, constexpr Flag):
+    bool;
 extern runtime IncrementUseCounter(Context, Smi): void;
 
-macro FlagGetter(implicit context: Context)(
-    receiver: Object, flag: constexpr Flag, counter: constexpr int31,
-    methodName: constexpr string): JSAny {
+macro FlagGetter(
+    implicit context: Context)(receiver: Object, flag: constexpr Flag,
+    counter: constexpr int31, methodName: constexpr string): JSAny {
   typeswitch (receiver) {
     case (receiver: JSRegExp): {
       return SelectBooleanConstant(FastFlagGetter(receiver, flag));
@@ -306,17 +308,16 @@ transitioning javascript builtin RegExpPrototypeUnicodeSetsGetter(
       'RegExp.prototype.unicodeSets');
 }
 
-extern transitioning macro
-RegExpBuiltinsAssembler::FlagsGetter(implicit context: Context)(
-    Object, constexpr bool): String;
+extern transitioning macro RegExpBuiltinsAssembler::FlagsGetter(
+    implicit context: Context)(Object, constexpr bool): String;
 
-transitioning macro
-FastFlagsGetter(implicit context: Context)(receiver: FastJSRegExp): String {
+transitioning macro FastFlagsGetter(
+    implicit context: Context)(receiver: FastJSRegExp): String {
   return FlagsGetter(receiver, true);
 }
 
-transitioning macro SlowFlagsGetter(implicit context: Context)(receiver: JSAny):
-    String {
+transitioning macro SlowFlagsGetter(
+    implicit context: Context)(receiver: JSAny): String {
   return FlagsGetter(receiver, false);
 }
 
@@ -344,15 +345,17 @@ extern macro RegExpBuiltinsAssembler::FastLoadLastIndex(JSRegExp): Smi;
 extern macro RegExpBuiltinsAssembler::FastStoreLastIndex(JSRegExp, Smi): void;
 
 @export
-transitioning macro LoadLastIndex(implicit context: Context)(
-    regexp: JSAny, isFastPath: constexpr bool): JSAny {
+transitioning macro LoadLastIndex(
+    implicit context: Context)(regexp: JSAny,
+    isFastPath: constexpr bool): JSAny {
   return isFastPath ? FastLoadLastIndex(UnsafeCast<JSRegExp>(regexp)) :
                       SlowLoadLastIndex(regexp);
 }
 
 @export
-transitioning macro LoadLastIndexAsLength(implicit context: Context)(
-    regexp: JSRegExp, isFastPath: constexpr bool): Number {
+transitioning macro LoadLastIndexAsLength(
+    implicit context: Context)(regexp: JSRegExp,
+    isFastPath: constexpr bool): Number {
   const lastIndex = LoadLastIndex(regexp, isFastPath);
   if (isFastPath) {
     // ToLength on a positive smi is a nop and can be skipped.
@@ -371,8 +374,9 @@ transitioning macro LoadLastIndexAsLength(implicit context: Context)(
 }
 
 @export
-transitioning macro StoreLastIndex(implicit context: Context)(
-    regexp: JSAny, value: Number, isFastPath: constexpr bool): void {
+transitioning macro StoreLastIndex(
+    implicit context: Context)(regexp: JSAny, value: Number,
+    isFastPath: constexpr bool): void {
   if (isFastPath) {
     FastStoreLastIndex(UnsafeCast<JSRegExp>(regexp), UnsafeCast<Smi>(value));
   } else {
@@ -382,13 +386,13 @@ transitioning macro StoreLastIndex(implicit context: Context)(
 
 extern macro RegExpBuiltinsAssembler::AdvanceStringIndex(
     String, Number, bool, constexpr bool): Number;
-extern macro
-RegExpBuiltinsAssembler::AdvanceStringIndexFast(String, Smi, bool): Smi;
-extern macro
-RegExpBuiltinsAssembler::AdvanceStringIndexSlow(String, Number, bool): Smi;
+extern macro RegExpBuiltinsAssembler::AdvanceStringIndexFast(
+    String, Smi, bool): Smi;
+extern macro RegExpBuiltinsAssembler::AdvanceStringIndexSlow(
+    String, Number, bool): Smi;
 
 type UseCounterFeature extends int31
-constexpr 'v8::Isolate::UseCounterFeature';
+    constexpr 'v8::Isolate::UseCounterFeature';
 const kRegExpMatchIsTrueishOnNonJSRegExp: constexpr UseCounterFeature
     generates 'v8::Isolate::kRegExpMatchIsTrueishOnNonJSRegExp';
 const kRegExpMatchIsFalseishOnJSRegExp: constexpr UseCounterFeature
@@ -425,20 +429,22 @@ transitioning macro IsRegExp(implicit context: Context)(obj: JSAny): bool {
   return false;
 }
 
-extern runtime RegExpInitializeAndCompile(
-    Context, JSRegExp, String, String): JSAny;
+extern runtime RegExpInitializeAndCompile(Context, JSRegExp, String, String):
+    JSAny;
 
 @export
-transitioning macro RegExpCreate(implicit context: Context)(
-    nativeContext: NativeContext, maybeString: JSAny, flags: String): JSAny {
+transitioning macro RegExpCreate(
+    implicit context: Context)(nativeContext: NativeContext,
+    maybeString: JSAny, flags: String): JSAny {
   const regexpFun = LoadRegExpFunction(nativeContext);
   const initialMap = UnsafeCast<Map>(regexpFun.prototype_or_initial_map);
   return RegExpCreate(initialMap, maybeString, flags);
 }
 
 @export
-transitioning macro RegExpCreate(implicit context: Context)(
-    initialMap: Map, maybeString: JSAny, flags: String): JSAny {
+transitioning macro RegExpCreate(
+    implicit context: Context)(initialMap: Map, maybeString: JSAny,
+    flags: String): JSAny {
   const pattern: String =
       maybeString == Undefined ? kEmptyString : ToString_Inline(maybeString);
   const regexp =
diff --git a/deps/v8/src/builtins/riscv/builtins-riscv.cc b/deps/v8/src/builtins/riscv/builtins-riscv.cc
index 3404562785991c..326001fdd18add 100644
--- a/deps/v8/src/builtins/riscv/builtins-riscv.cc
+++ b/deps/v8/src/builtins/riscv/builtins-riscv.cc
@@ -246,22 +246,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   // Call the function.
   __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
 
-  // ----------- S t a t e -------------
-  //  --                 a0: constructor result
-  //  -- sp[0*kSystemPointerSize]: implicit receiver
-  //  -- sp[1*kSystemPointerSize]: padding
-  //  -- sp[2*kSystemPointerSize]: constructor function
-  //  -- sp[3*kSystemPointerSize]: number of arguments
-  //  -- sp[4*kSystemPointerSize]: context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
-  // Restore the context from the frame.
-  __ LoadWord(cp, MemOperand(fp, ConstructFrameConstants::kContextOffset));
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -370,7 +354,6 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
   //  -- a1 : the JSGeneratorObject to resume
   //  -- ra : return address
   // -----------------------------------
-
   // Store input value into generator object.
   __ StoreTaggedField(
       a0, FieldMemOperand(a1, JSGeneratorObject::kInputOrDebugPosOffset));
@@ -469,9 +452,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     // undefined because generator functions are non-constructable.
     __ Move(a3, a1);
     __ Move(a1, a4);
-    static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-    __ LoadTaggedField(a2, FieldMemOperand(a1, JSFunction::kCodeOffset));
-    __ JumpCodeObject(a2);
+    __ JumpJSFunction(a1);
   }
 
   __ bind(&prepare_step_in_if_stepping);
@@ -804,6 +785,7 @@ static void Generate_JSEntryTrampolineHelper(MacroAssembler* masm,
 #endif
     // s6 holds the root address. Do not clobber.
     // s7 is cp. Do not init.
+    // s11 is pointer cage base register (kPointerCageBaseRegister).
 
     // Invoke the code.
     Handle<Code> builtin = is_construct
@@ -945,9 +927,17 @@ static void AdvanceBytecodeOffsetOrReturn(MacroAssembler* masm,
 }
 
 namespace {
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array) {
-  __ Sh(zero_reg,
-        FieldMemOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset));
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi) {
+  __ Sh(zero_reg, FieldMemOperand(sfi, SharedFunctionInfo::kAgeOffset));
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function,
+                        Register scratch) {
+  const Register shared_function_info(scratch);
+  __ LoadTaggedField(
+      shared_function_info,
+      FieldMemOperand(js_function, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, shared_function_info);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
@@ -955,8 +945,7 @@ void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
   DCHECK(!AreAliased(feedback_vector, scratch));
   __ Lbu(scratch,
          FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
-  __ And(scratch, scratch,
-         Operand(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ And(scratch, scratch, Operand(~FeedbackVector::OsrUrgencyBits::kMask));
   __ Sb(scratch,
         FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
 }
@@ -970,7 +959,7 @@ void Builtins::Generate_BaselineOutOfLinePrologueDeopt(MacroAssembler* masm) {
 
   // Drop bytecode offset (was the feedback vector but got replaced during
   // deopt) and bytecode array.
-  __ AddWord(sp, sp, Operand(2 * kPointerSize));
+  __ AddWord(sp, sp, Operand(2 * kSystemPointerSize));
 
   // Context, closure, argc.
   __ Pop(kContextRegister, kJavaScriptCallTargetRegister,
@@ -992,10 +981,11 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
       BaselineOutOfLinePrologueDescriptor::kClosure);
   // Load the feedback vector from the closure.
   Register feedback_vector = temps.Acquire();
-  __ LoadWord(feedback_vector,
-              FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadWord(feedback_vector,
-              FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(feedback_vector,
+                     FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
   {
     UseScratchRegisterScope temp(masm);
     Register type = temps.Acquire();
@@ -1035,6 +1025,10 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
         BaselineOutOfLinePrologueDescriptor::kCalleeContext);
     Register callee_js_function = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kClosure);
+    {
+      UseScratchRegisterScope temps(masm);
+      ResetJSFunctionAge(masm, callee_js_function, temps.Acquire());
+    }
     __ Push(callee_context, callee_js_function);
     DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
     DCHECK_EQ(callee_js_function, kJSFunctionRegister);
@@ -1045,7 +1039,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // the frame, so load it into a register.
     Register bytecode_array = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray);
-    ResetBytecodeAge(masm, bytecode_array);
     __ Push(argc, bytecode_array);
     // Baseline code frames store the feedback vector where interpreter would
     // store the bytecode offset.
@@ -1134,6 +1127,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   __ LoadTaggedField(
       kScratchReg,
       FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, kScratchReg);
   __ LoadTaggedField(
       kInterpreterBytecodeArrayRegister,
       FieldMemOperand(kScratchReg, SharedFunctionInfo::kFunctionDataOffset));
@@ -1152,8 +1146,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // Load the feedback vector from the closure.
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label push_stack_frame;
   // Check if feedback vector is valid. If valid, check for optimized code
@@ -1197,8 +1192,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ PushStandardFrame(closure);
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
-
   // Load initial bytecode offset.
   __ li(kInterpreterBytecodeOffsetRegister,
         Operand(BytecodeArray::kHeaderSize - kHeapObjectTag));
@@ -1343,8 +1336,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ LoadTaggedField(
         feedback_vector,
         FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-    __ LoadTaggedField(feedback_vector,
-                       FieldMemOperand(feedback_vector, Cell::kValueOffset));
+    __ LoadTaggedField(
+        feedback_vector,
+        FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1508,6 +1502,173 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   }
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- a0 : the number of arguments
+  // -- a1 : constructor to call (checked to be a JSFunction)
+  // -- a3 : new target
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+  Register implicit_receiver = a4;
+
+  // Save live registers.
+  __ SmiTag(a0);
+  __ Push(a0, a1, a3);
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  // Save result.
+  __ mv(implicit_receiver, a0);
+  __ Pop(a0, a1, a3);
+  __ SmiUntag(a0);
+
+  // Patch implicit receiver (in arguments)
+  __ StoreReceiver(implicit_receiver);
+  // Patch second implicit (in construct frame)
+  __ StoreWord(
+      implicit_receiver,
+      MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+
+  // Restore context.
+  __ LoadWord(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- a0 : argument count
+  // -- a1 : constructor to call (checked to be a JSFunction)
+  // -- a3 : new target
+  // -- a4 : address of the first argument
+  // -- cp : context pointer
+  // -----------------------------------
+  __ AssertFunction(a1);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  __ LoadMap(a2, a1);
+  __ Lbu(a2, FieldMemOperand(a2, Map::kBitFieldOffset));
+  __ And(a2, a2, Operand(Map::Bits1::IsConstructorBit::kMask));
+  __ Branch(&non_constructor, eq, a2, Operand(zero_reg));
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(a0, a2, a5, &stack_overflow);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+
+  // Implicit receiver stored in the construct frame.
+  __ LoadRoot(a2, RootIndex::kTheHoleValue);
+  __ Push(cp, a2);
+
+  // Push arguments + implicit receiver.
+  Register argc_without_receiver = a7;
+  __ SubWord(argc_without_receiver, a0, Operand(kJSArgcReceiverSlots));
+  GenerateInterpreterPushArgs(masm, argc_without_receiver, a4, a5);
+  __ Push(a2);
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  __ LoadTaggedField(
+      a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset));
+  __ Load32U(a2, FieldMemOperand(a2, SharedFunctionInfo::kFlagsOffset));
+  __ And(a5, a2, Operand(SharedFunctionInfo::ConstructAsBuiltinBit::kMask));
+  __ Branch(&builtin_call, ne, a5, Operand(zero_reg));
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(a2);
+  __ JumpIfIsInRange(
+      a2, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor),
+      &not_create_implicit_receiver);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the function.
+  __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- x0     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label use_receiver, do_throw, leave_and_return, check_receiver;
+
+  // If the result is undefined, we jump out to using the implicit receiver.
+  __ JumpIfNotRoot(a0, RootIndex::kUndefinedValue, &check_receiver);
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ bind(&use_receiver);
+  __ LoadWord(
+      a0, MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+  __ JumpIfRoot(a0, RootIndex::kTheHoleValue, &do_throw);
+
+  __ bind(&leave_and_return);
+  // Leave construct frame.
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  // Otherwise we do a smi check and fall through to check if the return value
+  // is a valid receiver.
+  __ bind(&check_receiver);
+
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(a0, &use_receiver);
+
+  // Check if the type of the result is not an object in the ECMA sense.
+  __ JumpIfJSAnyIsNotPrimitive(a0, a4, &leave_and_return);
+  __ Branch(&use_receiver);
+
+  __ bind(&builtin_call);
+  // TODO(victorgomes): Check the possibility to turn this into a tailcall.
+  __ InvokeFunctionWithNewTarget(a1, a3, a0, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  __ bind(&do_throw);
+  // Restore the context from the frame.
+  __ LoadWord(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  // Unreachable code.
+  __ Trap();
+
+  __ bind(&stack_overflow);
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  // Unreachable code.
+  __ Trap();
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Set the return address to the correct point in the interpreter entry
   // trampoline.
@@ -1532,7 +1693,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
 
   __ LoadTaggedField(
       t0, FieldMemOperand(t0, InterpreterData::kInterpreterTrampolineOffset));
-  __ LoadCodeEntry(t0, t0);
+  __ LoadCodeInstructionStart(t0, t0);
   __ BranchShort(&trampoline_loaded);
 
   __ bind(&builtin_trampoline);
@@ -1692,7 +1853,7 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
   __ AddWord(sp, sp,
              Operand(BuiltinContinuationFrameConstants::kFixedFrameSizeFromFp));
   __ Pop(ra);
-  __ LoadEntryFromBuiltinIndex(t6);
+  __ LoadEntryFromBuiltinIndex(t6, t6);
   __ Jump(t6);
 }
 }  // namespace
@@ -1748,8 +1909,8 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
     // If maybe_target_code is not null, no need to call into runtime. A
     // precondition here is: if maybe_target_code is a InstructionStream object,
     // it must NOT be marked_for_deoptimization (callers must ensure this).
-    __ Branch(&jump_to_optimized_code, ne, maybe_target_code,
-              Operand(Smi::zero()));
+    __ CompareTaggedAndBranch(&jump_to_optimized_code, ne, maybe_target_code,
+                              Operand(Smi::zero()));
   }
   ASM_CODE_COMMENT(masm);
   {
@@ -1758,7 +1919,12 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
   }
 
   // If the code object is null, just return to the caller.
-  __ Ret(eq, a0, Operand(Smi::zero()));
+  // If the code object is null, just return to the caller.
+  __ CompareTaggedAndBranch(&jump_to_optimized_code, ne, maybe_target_code,
+                            Operand(Smi::zero()));
+  __ Ret();
+  DCHECK_EQ(maybe_target_code, a0);  // Already in the right spot.
+
   __ bind(&jump_to_optimized_code);
 
   // OSR entry tracing.
@@ -1792,11 +1958,12 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
 
   // Load the OSR entrypoint offset from the deoptimization data.
   // <osr_offset> = <deopt_data>[#header_size + #osr_pc_offset]
-  __ SmiUntag(a1, MemOperand(a1, FixedArray::OffsetOfElementAt(
-                                     DeoptimizationData::kOsrPcOffsetIndex) -
-                                     kHeapObjectTag));
+  __ SmiUntagField(a1,
+                   MemOperand(a1, FixedArray::OffsetOfElementAt(
+                                      DeoptimizationData::kOsrPcOffsetIndex) -
+                                      kHeapObjectTag));
 
-  __ LoadCodeEntry(a0, a0);
+  __ LoadCodeInstructionStart(a0, a0);
 
   // Compute the target address = code_entry + osr_offset
   // <entry_addr> = <code_entry> + <osr_offset>
@@ -1835,6 +2002,7 @@ void Builtins::Generate_FunctionPrototypeApply(MacroAssembler* masm) {
   Register receiver = a1;
   Register this_arg = a5;
   Register undefined_value = a3;
+  Register scratch = a4;
 
   __ LoadRoot(undefined_value, RootIndex::kUndefinedValue);
 
@@ -1880,9 +2048,10 @@ void Builtins::Generate_FunctionPrototypeApply(MacroAssembler* masm) {
 
   // 3. Tail call with no arguments if argArray is null or undefined.
   Label no_arguments;
-  __ JumpIfRoot(arg_array, RootIndex::kNullValue, &no_arguments);
-  __ Branch(&no_arguments, eq, arg_array, Operand(undefined_value),
-            Label::Distance::kNear);
+  __ LoadRoot(scratch, RootIndex::kNullValue);
+  __ CompareTaggedAndBranch(&no_arguments, eq, arg_array, Operand(scratch));
+  __ CompareTaggedAndBranch(&no_arguments, eq, arg_array,
+                            Operand(undefined_value));
 
   // 4a. Apply the receiver to the given argArray.
   __ Jump(BUILTIN_CODE(masm->isolate(), CallWithArrayLike),
@@ -2078,7 +2247,7 @@ void Generate_AllocateSpaceAndShiftExistingArguments(
   Register old_sp = scratch1;
   Register new_space = scratch2;
   __ mv(old_sp, sp);
-  __ slli(new_space, count, kPointerSizeLog2);
+  __ slli(new_space, count, kSystemPointerSizeLog2);
   __ SubWord(sp, sp, Operand(new_space));
 
   Register end = scratch2;
@@ -2156,11 +2325,16 @@ void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
     __ Branch(&done, eq, len, Operand(zero_reg), Label::Distance::kNear);
     __ SllWord(scratch, len, kTaggedSizeLog2);
     __ SubWord(scratch, sp, Operand(scratch));
-    __ LoadRoot(hole_value, RootIndex::kTheHoleValue);
+#if !V8_STATIC_ROOTS_BOOL
+    // We do not use the Branch(reg, RootIndex) macro without static roots,
+    // as it would do a LoadRoot behind the scenes and we want to avoid that
+    // in a loop.
+    __ LoadTaggedRoot(hole_value, RootIndex::kTheHoleValue);
+#endif  // !V8_STATIC_ROOTS_BOOL
     __ bind(&loop);
     __ LoadTaggedField(a5, MemOperand(src));
     __ AddWord(src, src, kTaggedSize);
-    __ Branch(&push, ne, a5, Operand(hole_value), Label::Distance::kNear);
+    __ CompareTaggedAndBranch(&push, ne, a5, Operand(hole_value));
     __ LoadRoot(a5, RootIndex::kUndefinedValue);
     __ bind(&push);
     __ StoreWord(a5, MemOperand(a7, 0));
@@ -2271,15 +2445,10 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
   //  -- a0 : the number of arguments
   //  -- a1 : the function to call (checked to be a JSFunction)
   // -----------------------------------
-  __ AssertCallableFunction(a1);
+  __ AssertFunction(a1);
 
-  Label class_constructor;
   __ LoadTaggedField(
       a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset));
-  __ Load32U(a3, FieldMemOperand(a2, SharedFunctionInfo::kFlagsOffset));
-  __ And(kScratchReg, a3,
-         Operand(SharedFunctionInfo::IsClassConstructorBit::kMask));
-  __ Branch(&class_constructor, ne, kScratchReg, Operand(zero_reg));
 
   // Enter the context of the function; ToObject has to run in the function
   // context, and we also need to take the global proxy from the function
@@ -2305,12 +2474,9 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ LoadGlobalProxy(a3);
     } else {
       Label convert_to_object, convert_receiver;
-      __ LoadReceiver(a3, a0);
+      __ LoadReceiver(a3);
       __ JumpIfSmi(a3, &convert_to_object);
-      static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
-      __ GetObjectType(a3, a4, a4);
-      __ Branch(&done_convert, Ugreater_equal, a4,
-                Operand(FIRST_JS_RECEIVER_TYPE));
+      __ JumpIfJSAnyIsNotPrimitive(a3, a4, &done_convert);
       if (mode != ConvertReceiverMode::kNotNullOrUndefined) {
         Label convert_global_proxy;
         __ JumpIfRoot(a3, RootIndex::kUndefinedValue, &convert_global_proxy);
@@ -2343,7 +2509,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
           a2, FieldMemOperand(a1, JSFunction::kSharedFunctionInfoOffset));
       __ bind(&convert_receiver);
     }
-    __ StoreReceiver(a3, a0, kScratchReg);
+    __ StoreReceiver(a3);
   }
   __ bind(&done_convert);
 
@@ -2357,14 +2523,6 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
   __ Lhu(a2,
          FieldMemOperand(a2, SharedFunctionInfo::kFormalParameterCountOffset));
   __ InvokeFunctionCode(a1, no_reg, a2, a0, InvokeType::kJump);
-
-  // The function is a "classConstructor", need to raise an exception.
-  __ bind(&class_constructor);
-  {
-    FrameScope frame(masm, StackFrame::INTERNAL);
-    __ Push(a1);
-    __ CallRuntime(Runtime::kThrowConstructorNonCallableError);
-  }
 }
 
 namespace {
@@ -2453,7 +2611,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
     Register scratch = temps.Acquire();
     __ LoadTaggedField(scratch,
                        FieldMemOperand(a1, JSBoundFunction::kBoundThisOffset));
-    __ StoreReceiver(scratch, a0, kScratchReg);
+    __ StoreReceiver(scratch);
   }
 
   // Push the [[BoundArguments]] onto the stack.
@@ -2473,46 +2631,54 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   //  -- a1 : the target to call (can be any Object).
   // -----------------------------------
 
+  Register target = a1;
+  Register map = t1;
+  Register instance_type = t2;
+  Register scratch = t6;
+  DCHECK(!AreAliased(a0, target, map, instance_type, scratch));
+
   Label non_callable, class_constructor;
-  UseScratchRegisterScope temps(masm);
-  temps.Include(t1, t2);
-  temps.Include(t4);
-  Register map = temps.Acquire(), type = temps.Acquire(),
-           range = temps.Acquire();
-  __ JumpIfSmi(a1, &non_callable);
-  __ LoadMap(map, a1);
-  __ GetInstanceTypeRange(map, type, FIRST_CALLABLE_JS_FUNCTION_TYPE, range);
+  __ JumpIfSmi(target, &non_callable);
+  __ LoadMap(map, target);
+  __ GetInstanceTypeRange(map, instance_type, FIRST_CALLABLE_JS_FUNCTION_TYPE,
+                          scratch);
   __ Jump(masm->isolate()->builtins()->CallFunction(mode),
-          RelocInfo::CODE_TARGET, Uless_equal, range,
+          RelocInfo::CODE_TARGET, ule, scratch,
           Operand(LAST_CALLABLE_JS_FUNCTION_TYPE -
                   FIRST_CALLABLE_JS_FUNCTION_TYPE));
   __ Jump(BUILTIN_CODE(masm->isolate(), CallBoundFunction),
-          RelocInfo::CODE_TARGET, eq, type, Operand(JS_BOUND_FUNCTION_TYPE));
-  Register scratch = map;
+          RelocInfo::CODE_TARGET, eq, instance_type,
+          Operand(JS_BOUND_FUNCTION_TYPE));
+
   // Check if target has a [[Call]] internal method.
-  __ Lbu(scratch, FieldMemOperand(map, Map::kBitFieldOffset));
-  __ And(scratch, scratch, Operand(Map::Bits1::IsCallableBit::kMask));
-  __ Branch(&non_callable, eq, scratch, Operand(zero_reg),
-            Label::Distance::kNear);
+  {
+    Register flags = t1;
+    __ Lbu(flags, FieldMemOperand(map, Map::kBitFieldOffset));
+    map = no_reg;
+    __ And(flags, flags, Operand(Map::Bits1::IsCallableBit::kMask));
+    __ Branch(&non_callable, eq, flags, Operand(zero_reg));
+  }
 
   __ Jump(BUILTIN_CODE(masm->isolate(), CallProxy), RelocInfo::CODE_TARGET, eq,
-          type, Operand(JS_PROXY_TYPE));
+          instance_type, Operand(JS_PROXY_TYPE));
 
   // Check if target is a wrapped function and call CallWrappedFunction external
   // builtin
   __ Jump(BUILTIN_CODE(masm->isolate(), CallWrappedFunction),
-          RelocInfo::CODE_TARGET, eq, type, Operand(JS_WRAPPED_FUNCTION_TYPE));
+          RelocInfo::CODE_TARGET, eq, instance_type,
+          Operand(JS_WRAPPED_FUNCTION_TYPE));
 
   // ES6 section 9.2.1 [[Call]] ( thisArgument, argumentsList)
   // Check that the function is not a "classConstructor".
-  __ Branch(&class_constructor, eq, type, Operand(JS_CLASS_CONSTRUCTOR_TYPE));
+  __ Branch(&class_constructor, eq, instance_type,
+            Operand(JS_CLASS_CONSTRUCTOR_TYPE));
 
   // 2. Call to something else, which might have a [[Call]] internal method (if
   // not we raise an exception).
   // Overwrite the original receiver with the (original) target.
-  __ StoreReceiver(a1, a0, kScratchReg);
+  __ StoreReceiver(target);
   // Let the "call_as_function_delegate" take care of the rest.
-  __ LoadNativeContextSlot(a1, Context::CALL_AS_FUNCTION_DELEGATE_INDEX);
+  __ LoadNativeContextSlot(target, Context::CALL_AS_FUNCTION_DELEGATE_INDEX);
   __ Jump(masm->isolate()->builtins()->CallFunction(
               ConvertReceiverMode::kNotNullOrUndefined),
           RelocInfo::CODE_TARGET);
@@ -2521,16 +2687,16 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   __ bind(&non_callable);
   {
     FrameScope scope(masm, StackFrame::INTERNAL);
-    __ Push(a1);
+    __ Push(target);
     __ CallRuntime(Runtime::kThrowCalledNonCallable);
   }
+
   // 4. The function is a "classConstructor", need to raise an exception.
   __ bind(&class_constructor);
   {
     FrameScope frame(masm, StackFrame::INTERNAL);
-    __ Push(a1);
+    __ Push(target);
     __ CallRuntime(Runtime::kThrowConstructorNonCallableError);
-    __ ebreak();
   }
 }
 
@@ -2579,16 +2745,7 @@ void Builtins::Generate_ConstructBoundFunction(MacroAssembler* masm) {
 
   // Patch new.target to [[BoundTargetFunction]] if new.target equals target.
   Label skip;
-  {
-#ifdef V8_COMPRESS_POINTERS
-    UseScratchRegisterScope temps(masm);
-    Register scratch = temps.Acquire();
-    __ CmpTagged(scratch, a1, a3);
-    __ Branch(&skip, ne, scratch, Operand(zero_reg), Label::Distance::kNear);
-#else
-    __ Branch(&skip, ne, a1, Operand(a3), Label::Distance::kNear);
-#endif
-  }
+  __ CompareTaggedAndBranch(&skip, ne, a1, Operand(a3));
   __ LoadTaggedField(
       a3, FieldMemOperand(a1, JSBoundFunction::kBoundTargetFunctionOffset));
   __ bind(&skip);
@@ -2599,7 +2756,6 @@ void Builtins::Generate_ConstructBoundFunction(MacroAssembler* masm) {
   __ Jump(BUILTIN_CODE(masm->isolate(), Construct), RelocInfo::CODE_TARGET);
 }
 
-// static
 void Builtins::Generate_Construct(MacroAssembler* masm) {
   // ----------- S t a t e -------------
   //  -- a0 : the number of arguments
@@ -2608,34 +2764,39 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   //          the JSFunction on which new was invoked initially)
   // -----------------------------------
 
+  Register target = a1;
+  Register map = t1;
+  Register instance_type = t2;
+  Register scratch = t6;
+  DCHECK(!AreAliased(a0, target, map, instance_type, scratch));
+
   // Check if target is a Smi.
   Label non_constructor, non_proxy;
-  __ JumpIfSmi(a1, &non_constructor);
+  __ JumpIfSmi(target, &non_constructor);
 
   // Check if target has a [[Construct]] internal method.
-  UseScratchRegisterScope temps(masm);
-  temps.Include(t0, t1);
-  Register map = temps.Acquire();
-  Register scratch = temps.Acquire();
-  __ LoadTaggedField(map, FieldMemOperand(a1, HeapObject::kMapOffset));
-  __ Lbu(scratch, FieldMemOperand(map, Map::kBitFieldOffset));
-  __ And(scratch, scratch, Operand(Map::Bits1::IsConstructorBit::kMask));
-  __ Branch(&non_constructor, eq, scratch, Operand(zero_reg));
-  Register range = temps.Acquire();
+  __ LoadTaggedField(map, FieldMemOperand(target, HeapObject::kMapOffset));
+  {
+    Register flags = t3;
+    __ Lbu(flags, FieldMemOperand(map, Map::kBitFieldOffset));
+    __ And(flags, flags, Operand(Map::Bits1::IsConstructorBit::kMask));
+    __ Branch(&non_constructor, eq, flags, Operand(zero_reg));
+  }
+
   // Dispatch based on instance type.
-  __ GetInstanceTypeRange(map, scratch, FIRST_JS_FUNCTION_TYPE, range);
+  __ GetInstanceTypeRange(map, instance_type, FIRST_JS_FUNCTION_TYPE, scratch);
   __ Jump(BUILTIN_CODE(masm->isolate(), ConstructFunction),
-          RelocInfo::CODE_TARGET, Uless_equal, range,
+          RelocInfo::CODE_TARGET, Uless_equal, scratch,
           Operand(LAST_JS_FUNCTION_TYPE - FIRST_JS_FUNCTION_TYPE));
 
   // Only dispatch to bound functions after checking whether they are
   // constructors.
   __ Jump(BUILTIN_CODE(masm->isolate(), ConstructBoundFunction),
-          RelocInfo::CODE_TARGET, eq, scratch, Operand(JS_BOUND_FUNCTION_TYPE));
+          RelocInfo::CODE_TARGET, eq, instance_type,
+          Operand(JS_BOUND_FUNCTION_TYPE));
 
   // Only dispatch to proxies after checking whether they are constructors.
-  __ Branch(&non_proxy, ne, scratch, Operand(JS_PROXY_TYPE),
-            Label::Distance::kNear);
+  __ Branch(&non_proxy, ne, instance_type, Operand(JS_PROXY_TYPE));
   __ Jump(BUILTIN_CODE(masm->isolate(), ConstructProxy),
           RelocInfo::CODE_TARGET);
 
@@ -2643,9 +2804,10 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ bind(&non_proxy);
   {
     // Overwrite the original receiver with the (original) target.
-    __ StoreReceiver(a1, a0, kScratchReg);
+    __ StoreReceiver(target);
     // Let the "call_as_constructor_delegate" take care of the rest.
-    __ LoadNativeContextSlot(a1, Context::CALL_AS_CONSTRUCTOR_DELEGATE_INDEX);
+    __ LoadNativeContextSlot(target,
+                             Context::CALL_AS_CONSTRUCTOR_DELEGATE_INDEX);
     __ Jump(masm->isolate()->builtins()->CallFunction(),
             RelocInfo::CODE_TARGET);
   }
@@ -2663,6 +2825,9 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
 // call below. We don't have any callee-saved registers in wasm, so no need to
 // store anything else.
 constexpr RegList kSavedGpRegs = ([]() constexpr {
+  static_assert(WasmLiftoffSetupFrameConstants::kNumberOfSavedGpParamRegs ==
+                    arraysize(wasm::kGpParamRegisters) - 1,
+                "frame size mismatch");
   RegList saved_gp_regs;
   for (Register gp_param_reg : wasm::kGpParamRegisters) {
     saved_gp_regs.set(gp_param_reg);
@@ -2678,6 +2843,9 @@ constexpr RegList kSavedGpRegs = ([]() constexpr {
 })();
 
 constexpr DoubleRegList kSavedFpRegs = ([]() constexpr {
+  static_assert(WasmLiftoffSetupFrameConstants::kNumberOfSavedFpParamRegs ==
+                    arraysize(wasm::kFpParamRegisters),
+                "frame size mismatch");
   DoubleRegList saved_fp_regs;
   for (DoubleRegister fp_param_reg : wasm::kFpParamRegisters) {
     saved_fp_regs.set(fp_param_reg);
@@ -2707,11 +2875,11 @@ void Builtins::Generate_WasmLiftoffFrameSetup(MacroAssembler* masm) {
   Register scratch = t2;
   Label allocate_vector, done;
 
-  __ LoadWord(vector,
+  __ LoadTaggedField(vector,
               FieldMemOperand(kWasmInstanceRegister,
                               WasmInstanceObject::kFeedbackVectorsOffset));
   __ CalcScaledAddress(vector, vector, func_index, kTaggedSizeLog2);
-  __ LoadWord(vector, FieldMemOperand(vector, FixedArray::kHeaderSize));
+  __ LoadTaggedField(vector, FieldMemOperand(vector, FixedArray::kHeaderSize));
   __ JumpIfSmi(vector, &allocate_vector);
   __ bind(&done);
   __ Push(vector);
@@ -2812,7 +2980,8 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   // Called from JavaScript; parameters are on stack as if calling JS function
   // a0: number of arguments including receiver
   // a1: pointer to builtin function
@@ -2861,8 +3030,7 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
 
   // Check result for exception sentinel.
   Label exception_returned;
-  __ LoadRoot(a4, RootIndex::kException);
-  __ Branch(&exception_returned, eq, a4, Operand(a0));
+  __ Branch(&exception_returned, eq, a0, RootIndex::kException);
 
   // Check that there is no pending exception, otherwise we
   // should have returned the exception sentinel.
@@ -2871,10 +3039,13 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
     ExternalReference pending_exception_address = ExternalReference::Create(
         IsolateAddressId::kPendingExceptionAddress, masm->isolate());
     __ li(a2, pending_exception_address);
+#ifndef V8_ENABLE_SANDBOX
     __ LoadWord(a2, MemOperand(a2));
-    __ LoadRoot(a4, RootIndex::kTheHoleValue);
+#else
+    __ Lwu(a2, MemOperand(a2));
+#endif
     // Cannot use check here as it attempts to generate call into runtime.
-    __ Branch(&okay, eq, a4, Operand(a2), Label::Distance::kNear);
+    __ Branch(&okay, eq, a2, RootIndex::kTheHoleValue);
     __ stop();
     __ bind(&okay);
   }
@@ -2931,6 +3102,15 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
   __ StoreWord(cp, MemOperand(fp, StandardFrameConstants::kContextOffset));
   __ bind(&zero);
 
+  // Clear c_entry_fp, like we do in `LeaveExitFrame`.
+  {
+    UseScratchRegisterScope temps(masm);
+    Register scratch = temps.Acquire();
+    __ li(scratch, ExternalReference::Create(IsolateAddressId::kCEntryFPAddress,
+                                             masm->isolate()));
+    __ StoreWord(zero_reg, MemOperand(scratch, 0));
+  }
+
   // Compute the handler entry address and jump to it.
   UseScratchRegisterScope temp(masm);
   Register scratch = temp.Acquire();
@@ -3062,15 +3242,11 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ Ret();
 }
 
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
-  // TODO(v8:10701): Implement for this platform.
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
   __ Trap();
 }
 
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
-  // TODO(v8:12191): Implement for this platform.
-  __ Trap();
-}
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) { __ Trap(); }
 
 void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   // TODO(v8:12191): Implement for this platform.
@@ -3091,162 +3267,57 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
   // Only needed on x64.
   __ Trap();
 }
-namespace {
-
-int AddressOffset(ExternalReference ref0, ExternalReference ref1) {
-  int64_t offset = (ref0.address() - ref1.address());
-  DCHECK(static_cast<int>(offset) == offset);
-  return static_cast<int>(offset);
-}
-
-// Calls an API function.  Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.  Restores context.  stack_space
-// - space to be unwound on exit (includes the call JS arguments space and
-// the additional space allocated for the fast call).
-void CallApiFunctionAndReturn(MacroAssembler* masm, Register function_address,
-                              ExternalReference thunk_ref, int stack_space,
-                              MemOperand* stack_space_operand,
-                              MemOperand return_value_operand) {
-  ASM_CODE_COMMENT(masm);
-  Isolate* isolate = masm->isolate();
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  const int kNextOffset = 0;
-  const int kLimitOffset = AddressOffset(
-      ExternalReference::handle_scope_limit_address(isolate), next_address);
-  const int kLevelOffset = AddressOffset(
-      ExternalReference::handle_scope_level_address(isolate), next_address);
-
-  DCHECK(function_address == a1 || function_address == a2);
-
-  Label profiler_enabled, end_profiler_check;
-  {
-    UseScratchRegisterScope temp(masm);
-    Register scratch = temp.Acquire();
-    __ li(scratch, ExternalReference::is_profiling_address(isolate));
-    __ Lb(scratch, MemOperand(scratch, 0));
-    __ Branch(&profiler_enabled, ne, scratch, Operand(zero_reg),
-              Label::Distance::kNear);
-    __ li(scratch, ExternalReference::address_of_runtime_stats_flag());
-    __ Lw(scratch, MemOperand(scratch, 0));
-    __ Branch(&profiler_enabled, ne, scratch, Operand(zero_reg),
-              Label::Distance::kNear);
-    {
-      // Call the api function directly.
-      __ Move(scratch, function_address);
-      __ BranchShort(&end_profiler_check);
-    }
 
-    __ bind(&profiler_enabled);
-    {
-      // Additional parameter is the address of the actual callback.
-      __ li(scratch, thunk_ref);
-    }
-    __ bind(&end_profiler_check);
-
-    // Allocate HandleScope in callee-save registers.
-    __ li(s5, next_address);
-    __ LoadWord(s3, MemOperand(s5, kNextOffset));
-    __ LoadWord(s1, MemOperand(s5, kLimitOffset));
-    __ Lw(s2, MemOperand(s5, kLevelOffset));
-    __ Add32(s2, s2, Operand(1));
-    __ Sw(s2, MemOperand(s5, kLevelOffset));
-
-    __ StoreReturnAddressAndCall(scratch);
-  }
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) { __ Trap(); }
 
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-  Label return_value_loaded;
-
-  // Load value from ReturnValue.
-  __ LoadWord(a0, return_value_operand);
-  __ bind(&return_value_loaded);
-
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ StoreWord(s3, MemOperand(s5, kNextOffset));
-  if (v8_flags.debug_code) {
-    __ Lw(a1, MemOperand(s5, kLevelOffset));
-    __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall, a1,
-             Operand(s2));
-  }
-  __ Sub32(s2, s2, Operand(1));
-  __ Sw(s2, MemOperand(s5, kLevelOffset));
-  __ LoadWord(kScratchReg, MemOperand(s5, kLimitOffset));
-  __ Branch(&delete_allocated_handles, ne, s1, Operand(kScratchReg));
-
-  // Leave the API exit frame.
-  __ bind(&leave_exit_frame);
-
-  if (stack_space_operand == nullptr) {
-    DCHECK_NE(stack_space, 0);
-    __ li(s3, Operand(stack_space));
-  } else {
-    DCHECK_EQ(stack_space, 0);
-    static_assert(kCArgSlotCount == 0);
-    __ LoadWord(s3, *stack_space_operand);
-  }
-
-  static constexpr bool kRegisterContainsSlotCount = false;
-  __ LeaveExitFrame(s3, NO_EMIT_RETURN, kRegisterContainsSlotCount);
-
-  // Check if the function scheduled an exception.
-  __ LoadRoot(a4, RootIndex::kTheHoleValue);
-  __ li(kScratchReg, ExternalReference::scheduled_exception_address(isolate));
-  __ LoadWord(a5, MemOperand(kScratchReg));
-  __ Branch(&promote_scheduled_exception, ne, a4, Operand(a5),
-            Label::Distance::kNear);
-
-  __ Ret();
-
-  // Re-throw by promoting a scheduled exception.
-  __ bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  __ bind(&delete_allocated_handles);
-  __ StoreWord(s1, MemOperand(s5, kLimitOffset));
-  __ Move(s3, a0);
-  __ PrepareCallCFunction(1, s1);
-  __ li(a0, ExternalReference::isolate_address(isolate));
-  __ CallCFunction(ExternalReference::delete_handle_scope_extensions(), 1);
-  __ Move(a0, s3);
-  __ Branch(&leave_exit_frame);
-}
-
-MemOperand ExitFrameCallerStackSlotOperand(int index) {
-  return MemOperand(
-      fp, (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
-              kSystemPointerSize);
-}
-}  // namespace
-
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- cp                  : context
+  // CallApiCallbackMode::kGeneric mode:
+  //  -- a2                  : arguments count (not including the receiver)
+  //  -- a3                  : call handler info
+  //  -- a0                  : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
   //  -- a1                  : api function address
   //  -- a2                  : arguments count
   //  -- a3                  : call data
   //  -- a0                  : holder
-  //  --
+  // Both modes:
+  //  -- cp                  : context
   //  -- sp[0]               : receiver
   //  -- sp[8]               : first argument
   //  -- ...
   //  -- sp[(argc) * 8]      : last argument
   // -----------------------------------
-  UseScratchRegisterScope temps(masm);
-  temps.Include(t0, t1);
-  Register api_function_address = a1;
-  Register argc = a2;
-  Register call_data = a3;
-  Register holder = a0;
-  Register scratch = temps.Acquire();
-  Register base = temps.Acquire();  // For addressing MemOperands on the stack.
-
-  DCHECK(!AreAliased(api_function_address, argc, call_data, holder, scratch,
-                     base));
+  Register function_callback_info_arg = arg_reg_1;
+
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register callback = no_reg;
+  Register holder = no_reg;
+  Register scratch = t0;
+  Register scratch2 = t1;
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = a1;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, holder, call_data, callback,
+                     scratch, scratch2));
 
   using FCA = FunctionCallbackArguments;
 
@@ -3254,118 +3325,215 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
   // Set up FunctionCallbackInfo's implicit_args on the stack as follows:
-  //
   // Target state:
-  //   sp[0 * kSystemPointerSize]: kHolder
+  //   sp[0 * kSystemPointerSize]: kHolder   <= FCA::implicit_args_
   //   sp[1 * kSystemPointerSize]: kIsolate
-  //   sp[2 * kSystemPointerSize]: undefined (kReturnValueDefaultValue)
+  //   sp[2 * kSystemPointerSize]: undefined (padding, unused)
   //   sp[3 * kSystemPointerSize]: undefined (kReturnValue)
   //   sp[4 * kSystemPointerSize]: kData
   //   sp[5 * kSystemPointerSize]: undefined (kNewTarget)
-
-  // Set up the base register for addressing through MemOperands. It will point
-  // at the receiver (located at sp + argc * kSystemPointerSize).
-  __ CalcScaledAddress(base, sp, argc, kSystemPointerSizeLog2);
+  // Existing state:
+  //   sp[6 * kSystemPointerSize]:            <= FCA:::values_
 
   // Reserve space on the stack.
-  __ SubWord(sp, sp, Operand(FCA::kArgsLength * kSystemPointerSize));
+  static constexpr int kStackSize = FCA::kArgsLength;
+  static_assert(kStackSize % 2 == 0);
+  __ SubWord(sp, sp, Operand(kStackSize * kSystemPointerSize));
 
   // kHolder.
-  __ StoreWord(holder, MemOperand(sp, 0 * kSystemPointerSize));
+  __ StoreWord(holder, MemOperand(sp, FCA::kHolderIndex * kSystemPointerSize));
 
   // kIsolate.
   __ li(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ StoreWord(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+  __ StoreWord(scratch,
+               MemOperand(sp, FCA::kIsolateIndex * kSystemPointerSize));
 
-  // kReturnValueDefaultValue and kReturnValue.
+  // kPadding
+  __ StoreWord(zero_reg,
+               MemOperand(sp, FCA::kUnusedIndex * kSystemPointerSize));
+
+  // kReturnValue
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ StoreWord(scratch, MemOperand(sp, 2 * kSystemPointerSize));
-  __ StoreWord(scratch, MemOperand(sp, 3 * kSystemPointerSize));
+  __ StoreWord(scratch,
+               MemOperand(sp, FCA::kReturnValueIndex * kSystemPointerSize));
 
   // kData.
-  __ StoreWord(call_data, MemOperand(sp, 4 * kSystemPointerSize));
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ LoadTaggedField(
+          scratch2, FieldMemOperand(callback, CallHandlerInfo::kDataOffset));
+      __ StoreWord(scratch2,
+                   MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ StoreWord(call_data,
+                   MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+  }
 
   // kNewTarget.
-  __ StoreWord(scratch, MemOperand(sp, 5 * kSystemPointerSize));
+  __ StoreWord(scratch,
+               MemOperand(sp, FCA::kNewTargetIndex * kSystemPointerSize));
 
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  __ Move(scratch, sp);
+  __ Move(holder, sp);
 
   // Allocate the v8::Arguments structure in the arguments' space since
   // it's not controlled by GC.
-  static constexpr int kApiStackSpace = 4;
-  FrameScope frame_scope(masm, StackFrame::MANUAL);
-  __ EnterExitFrame(kApiStackSpace);
+  static constexpr int kSlotsToDropOnStackSize = 1 * kSystemPointerSize;
+  static constexpr int kApiStackSpace =
+      (FCA::kSize + kSlotsToDropOnStackSize) / kSystemPointerSize;
+  static_assert(kApiStackSpace == 4);
+  static_assert(FCA::kImplicitArgsOffset == 0);
+  static_assert(FCA::kValuesOffset == 1 * kSystemPointerSize);
+  static_assert(FCA::kLengthOffset == 2 * kSystemPointerSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
 
-  // EnterExitFrame may align the sp.
-
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  // Arguments are after the return address (pushed by EnterExitFrame()).
-  __ StoreWord(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+  FrameScope frame_scope(masm, StackFrame::MANUAL);
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+    __ AllocateStackSpace(exit_frame_params_count * kSystemPointerSize);
+
+    // No padding is required.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize == 0);
+
+    // Context parameter.
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ StoreWord(kContextRegister, MemOperand(sp, 2 * kSystemPointerSize));
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ SmiTag(scratch, argc);
+    __ StoreWord(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ LoadTaggedField(
+        scratch,
+        FieldMemOperand(callback, CallHandlerInfo::kOwnerTemplateOffset));
+    __ StoreWord(scratch, MemOperand(sp, 0 * kSystemPointerSize));
 
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  __ AddWord(scratch, scratch,
-             Operand((FCA::kArgsLength + 1) * kSystemPointerSize));
-  __ StoreWord(scratch, MemOperand(sp, 2 * kSystemPointerSize));
+    __ LoadExternalPointerField(
+        api_function_address,
+        FieldMemOperand(callback,
+                        CallHandlerInfo::kMaybeRedirectedCallbackOffset),
+        kCallHandlerInfoCallbackTag);
 
-  // FunctionCallbackInfo::length_.
-  // Stored as int field, 32-bit integers within struct on stack always left
-  // justified by n64 ABI.
-  __ Sw(argc, MemOperand(sp, 3 * kSystemPointerSize));
+    __ EnterExitFrame(kApiStackSpace, StackFrame::API_CALLBACK_EXIT);
+  } else {
+    __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  }
 
+  // EnterExitFrame may align the sp.
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    // Arguments are after the return address (pushed by EnterExitFrame()).
+    __ StoreWord(holder, ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset));
+
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ AddWord(holder, holder,
+               Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
+    __ StoreWord(holder, ExitFrameStackSlotOperand(FCA::kValuesOffset));
+
+    // FunctionCallbackInfo::length_.
+    // Stored as int field, 32-bit integers within struct on stack always left
+    // justified by n64 ABI.
+    __ Sw(argc, ExitFrameStackSlotOperand(FCA::kLengthOffset));
+  }
   // We also store the number of bytes to drop from the stack after returning
   // from the API function here.
   // Note: Unlike on other architectures, this stores the number of slots to
   // drop, not the number of bytes.
-  __ AddWord(scratch, argc, Operand(FCA::kArgsLength + 1 /* receiver */));
-  __ StoreWord(scratch, MemOperand(sp, 4 * kSystemPointerSize));
+  MemOperand stack_space_operand =
+      ExitFrameStackSlotOperand(FCA::kLengthOffset + kSlotsToDropOnStackSize);
+  __ AddWord(scratch, argc,
+             Operand(FCA::kArgsLengthWithReceiver + exit_frame_params_count));
+  __ StoreWord(scratch, stack_space_operand);
 
-  // v8::InvocationCallback's argument.
-  DCHECK(!AreAliased(api_function_address, scratch, a0));
-  __ AddWord(a0, sp, Operand(1 * kSystemPointerSize));
+  __ RecordComment("v8::FunctionCallback's argument.");
+  // function_callback_info_arg = v8::FunctionCallbackInfo&
+  __ AddWord(function_callback_info_arg, sp, Operand(1 * kSystemPointerSize));
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
+  DCHECK(!AreAliased(api_function_address, function_callback_info_arg));
 
-  MemOperand return_value_operand =
-      ExitFrameCallerStackSlotOperand(FCA::kReturnValueIndex);
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+
+  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
+
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
 
   static constexpr int kUseStackSpaceOperand = 0;
-  MemOperand stack_space_operand(sp, 4 * kSystemPointerSize);
 
-  AllowExternalCallThatCantCauseGC scope(masm);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kUseStackSpaceOperand, &stack_space_operand,
-                           return_value_operand);
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseStackSpaceOperand,
+                           &stack_space_operand, return_value_operand);
 }
 
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- cp                  : context
+  //  -- a1                  : receiver
+  //  -- a3                  : accessor info
+  //  -- a0                  : holder
+  // -----------------------------------
+
   // Build v8::PropertyCallbackInfo::args_ array on the stack and push property
   // name below the exit frame to make GC aware of them.
+  using PCI = PropertyCallbackInfo<v8::Value>;
   using PCA = PropertyCallbackArguments;
   static_assert(PCA::kShouldThrowOnErrorIndex == 0);
   static_assert(PCA::kHolderIndex == 1);
   static_assert(PCA::kIsolateIndex == 2);
-  static_assert(PCA::kReturnValueDefaultValueIndex == 3);
+  static_assert(PCA::kUnusedIndex == 3);
   static_assert(PCA::kReturnValueIndex == 4);
   static_assert(PCA::kDataIndex == 5);
   static_assert(PCA::kThisIndex == 6);
   static_assert(PCA::kArgsLength == 7);
 
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  // Target state:
+  //   sp[0 * kSystemPointerSize]: name
+  //   sp[1 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   sp[2 * kSystemPointerSize]: kHolderIndex
+  //   sp[3 * kSystemPointerSize]: kIsolateIndex
+  //   sp[4 * kSystemPointerSize]: kUnusedIndex
+  //   sp[5 * kSystemPointerSize]: kReturnValueIndex
+  //   sp[6 * kSystemPointerSize]: kDataIndex
+  //   sp[7 * kSystemPointerSize]: kThisIndex / receiver
+
+  Register name_arg = arg_reg_1;
+  Register property_callback_info_arg = arg_reg_2;
+
+  Register api_function_address = arg_reg_3;
+
   Register receiver = ApiGetterDescriptor::ReceiverRegister();
   Register holder = ApiGetterDescriptor::HolderRegister();
   Register callback = ApiGetterDescriptor::CallbackRegister();
   Register scratch = a4;
   DCHECK(!AreAliased(receiver, holder, callback, scratch));
 
-  Register api_function_address = a2;
-
   // Here and below +1 is for name() pushed after the args_ array.
   using PCA = PropertyCallbackArguments;
   __ SubWord(sp, sp, (PCA::kArgsLength + 1) * kSystemPointerSize);
@@ -3379,8 +3547,7 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
   __ StoreWord(scratch, MemOperand(sp, (PCA::kReturnValueIndex + 1) *
                                            kSystemPointerSize));
   __ StoreWord(scratch,
-               MemOperand(sp, (PCA::kReturnValueDefaultValueIndex + 1) *
-                                  kSystemPointerSize));
+               MemOperand(sp, (PCA::kUnusedIndex + 1) * kSystemPointerSize));
   __ li(scratch, ExternalReference::isolate_address(masm->isolate()));
   __ StoreWord(scratch,
                MemOperand(sp, (PCA::kIsolateIndex + 1) * kSystemPointerSize));
@@ -3395,36 +3562,58 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
   __ StoreWord(scratch, MemOperand(sp, 0 * kSystemPointerSize));
 
   // v8::PropertyCallbackInfo::args_ array and name handle.
-  static constexpr int kNameHandleStackSize = 1;
-  static const int kStackUnwindSpace = PCA::kArgsLength + kNameHandleStackSize;
-
-  // Load address of v8::PropertyAccessorInfo::args_ array and name handle.
-  __ Move(a0, sp);                                      // a0 = Handle<Name>
-  __ AddWord(a1, a0, Operand(1 * kSystemPointerSize));  // a1 = v8::PCI::args_
+  static constexpr int kPaddingOnStackSlots = 0;
+  static constexpr int kNameOnStackSlots = 1;
+  // static constexpr int kNameStackIndex = kPaddingOnStackSlots;
+  static constexpr int kPCAStackIndex =
+      kNameOnStackSlots + kPaddingOnStackSlots;
+  static constexpr int kStackUnwindSpace = PCA::kArgsLength + kPCAStackIndex;
+  static_assert(kStackUnwindSpace % 2 == 0,
+                "slots must be a multiple of 2 for stack pointer alignment");
+
+  __ RecordComment(
+      "Load address of v8::PropertyAccessorInfo::args_ array and name handle.");
+  // name_arg = Handle<Name>(&name), name value was pushed to GC-ed stack space.
+  __ Move(name_arg, sp);
+  // property_callback_info_arg = v8::PCI::args_ (= &ShouldThrow)
+  __ AddWord(property_callback_info_arg, name_arg,
+             Operand(1 * kSystemPointerSize));
 
   const int kApiStackSpace = 1;
+  static_assert(kApiStackSpace * kSystemPointerSize == sizeof(PCI));
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ EnterExitFrame(kApiStackSpace);
 
-  // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // it's args_ field.
-  __ StoreWord(a1, MemOperand(sp, 1 * kSystemPointerSize));
-  __ AddWord(a1, sp, Operand(1 * kSystemPointerSize));
-  // a1 = v8::PropertyCallbackInfo&
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
+  // Initialize v8::PropertyCallbackInfo::args_ field.
+  __ StoreWord(property_callback_info_arg,
+               MemOperand(sp, 1 * kSystemPointerSize));
+  // property_callback_info_arg = v8::PropertyCallbackInfo&
+  __ AddWord(property_callback_info_arg, sp, Operand(1 * kSystemPointerSize));
 
-  __ LoadWord(
+  __ RecordComment("Load api_function_address");
+  __ LoadExternalPointerField(
       api_function_address,
-      FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset));
+      FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset),
+      kAccessorInfoGetterTag);
+
+  DCHECK(
+      !AreAliased(api_function_address, property_callback_info_arg, name_arg));
 
   ExternalReference thunk_ref =
       ExternalReference::invoke_accessor_getter_callback();
-  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
-      PCA::kReturnValueIndex + kNameHandleStackSize);
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
+
+  MemOperand return_value_operand =
+      ExitFrameCallerStackSlotOperand(kPCAStackIndex + PCA::kReturnValueIndex);
   MemOperand* const kUseStackSpaceConstant = nullptr;
 
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           return_value_operand);
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
@@ -3684,6 +3873,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+
+  if (is_osr) {
+    ResetSharedFunctionInfoAge(masm, code_obj);
+  }
+
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(code_obj, SharedFunctionInfo::kFunctionDataOffset));
@@ -3723,8 +3917,9 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register feedback_vector = a2;
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
   // allocate it.
@@ -3776,16 +3971,13 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
               MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp));
   __ Push(kInterpreterAccumulatorRegister);
   {
-    Register arg_reg_1 = a0;
-    Register arg_reg_2 = a1;
-    Register arg_reg_3 = a2;
     __ Move(arg_reg_1, code_obj);
     __ Move(arg_reg_2, kInterpreterBytecodeOffsetRegister);
     __ Move(arg_reg_3, kInterpreterBytecodeArrayRegister);
     FrameScope scope(masm, StackFrame::INTERNAL);
     __ CallCFunction(get_baseline_pc, 3, 0);
   }
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ AddWord(code_obj, code_obj, kReturnRegister0);
   __ Pop(kInterpreterAccumulatorRegister);
 
@@ -3796,7 +3988,6 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     __ LoadWord(
         kInterpreterBytecodeArrayRegister,
         MemOperand(fp, InterpreterFrameConstants::kBytecodeArrayFromFp));
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
     Generate_OSREntry(masm, code_obj);
   } else {
     __ Jump(code_obj);
diff --git a/deps/v8/src/builtins/s390/builtins-s390.cc b/deps/v8/src/builtins/s390/builtins-s390.cc
index ed4a8720c3b6ae..ab958664f4431d 100644
--- a/deps/v8/src/builtins/s390/builtins-s390.cc
+++ b/deps/v8/src/builtins/s390/builtins-s390.cc
@@ -84,7 +84,7 @@ void Generate_OSREntry(MacroAssembler* masm, Register entry_address,
   if (!offset.is_reg() && is_int20(offset.immediate())) {
     __ lay(r14, MemOperand(entry_address, offset.immediate()));
   } else {
-    CHECK(offset.is_reg());
+    DCHECK(offset.is_reg());
     __ AddS64(r14, entry_address, offset.rm());
   }
 
@@ -92,13 +92,20 @@ void Generate_OSREntry(MacroAssembler* masm, Register entry_address,
   __ Ret();
 }
 
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array,
-                      Register scratch) {
-  DCHECK(!AreAliased(bytecode_array, scratch));
-  __ mov(r0, Operand(0));
-  __ StoreU16(
-      r0, FieldMemOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset),
-      scratch);
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi,
+                                Register scratch) {
+  DCHECK(!AreAliased(sfi, scratch));
+  __ mov(scratch, Operand(0));
+  __ StoreU16(scratch, FieldMemOperand(sfi, SharedFunctionInfo::kAgeOffset),
+              no_reg);
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function,
+                        Register scratch1, Register scratch2) {
+  __ LoadTaggedField(
+      scratch1,
+      FieldMemOperand(js_function, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, scratch1, scratch2);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
@@ -106,8 +113,7 @@ void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
   DCHECK(!AreAliased(feedback_vector, scratch));
   __ LoadU8(scratch,
             FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
-  __ AndP(scratch, scratch,
-          Operand(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ AndP(scratch, scratch, Operand(~FeedbackVector::OsrUrgencyBits::kMask));
   __ StoreU8(scratch,
              FieldMemOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
 }
@@ -131,6 +137,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+
+  if (is_osr) {
+    ResetSharedFunctionInfoAge(masm, code_obj, r5);
+  }
+
   __ LoadTaggedField(
       code_obj,
       FieldMemOperand(code_obj, SharedFunctionInfo::kFunctionDataOffset));
@@ -164,8 +175,9 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   Register feedback_vector = r4;
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -218,9 +230,6 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   // Save the accumulator register, since it's clobbered by the below call.
   __ Push(kInterpreterAccumulatorRegister);
   {
-    Register arg_reg_1 = r2;
-    Register arg_reg_2 = r3;
-    Register arg_reg_3 = r4;
     __ mov(arg_reg_1, code_obj);
     __ mov(arg_reg_2, kInterpreterBytecodeOffsetRegister);
     __ mov(arg_reg_3, kInterpreterBytecodeArrayRegister);
@@ -228,14 +237,13 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     __ PrepareCallCFunction(3, 0, r1);
     __ CallCFunction(get_baseline_pc, 3, 0);
   }
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ AddS64(code_obj, code_obj, kReturnRegister0);
   __ Pop(kInterpreterAccumulatorRegister);
 
   if (is_osr) {
     // TODO(pthier): Separate baseline Sparkplug from TF arming and don't
     // disarm Sparkplug here.
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister, r1);
     Generate_OSREntry(masm, code_obj, Operand(0));
   } else {
     __ Jump(code_obj);
@@ -332,7 +340,7 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
       r3, FieldMemOperand(r3, FixedArray::OffsetOfElementAt(
                                   DeoptimizationData::kOsrPcOffsetIndex)));
 
-  __ LoadCodeEntry(r2, r2);
+  __ LoadCodeInstructionStart(r2, r2);
 
   // Compute the target address = code_entry + osr_offset
   // <entry_addr> = <code_entry> + <osr_offset>
@@ -549,19 +557,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   // Call the function.
   __ InvokeFunctionWithNewTarget(r3, r5, r2, InvokeType::kCall);
 
-  // ----------- S t a t e -------------
-  //  --                 r0: constructor result
-  //  -- sp[0*kSystemPointerSize]: implicit receiver
-  //  -- sp[1*kSystemPointerSize]: padding
-  //  -- sp[2*kSystemPointerSize]: constructor function
-  //  -- sp[3*kSystemPointerSize]: number of arguments
-  //  -- sp[4*kSystemPointerSize]: context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -722,17 +717,14 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
   {
     __ LoadTaggedField(
         r2, FieldMemOperand(r6, JSFunction::kSharedFunctionInfoOffset));
-    __ LoadS16(
-        r2,
-        FieldMemOperand(r2, SharedFunctionInfo::kFormalParameterCountOffset));
+    __ LoadS16(r2, FieldMemOperand(
+                       r2, SharedFunctionInfo::kFormalParameterCountOffset));
     // We abuse new.target both to indicate that this is a resume call and to
     // pass in the generator object.  In ordinary calls, new.target is always
     // undefined because generator functions are non-constructable.
     __ mov(r5, r3);
     __ mov(r3, r6);
-    static_assert(kJavaScriptCallCodeStartRegister == r4, "ABI mismatch");
-    __ LoadTaggedField(r4, FieldMemOperand(r3, JSFunction::kCodeOffset));
-    __ JumpCodeObject(r4);
+    __ JumpJSFunction(r3);
   }
 
   __ bind(&prepare_step_in_if_stepping);
@@ -843,7 +835,7 @@ void Generate_JSEntryVariant(MacroAssembler* masm, StackFrame::Type type,
     __ mov(kRootRegister, r2);
   }
 
-  // save r6 to r1
+  // save r6 to r0
   __ mov(r0, r6);
 
   // Push a frame with special values setup to mark it as an entry frame.
@@ -873,6 +865,12 @@ void Generate_JSEntryVariant(MacroAssembler* masm, StackFrame::Type type,
   __ mov(r6, Operand::Zero());
   __ StoreU64(r6, MemOperand(r1));
 
+#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
+  // Initialize the pointer cage base register.
+  __ LoadRootRelative(kPtrComprCageBaseRegister,
+                      IsolateData::cage_base_offset());
+#endif
+
   Register scrach = r8;
 
   // Set up frame pointer for the frame to be pushed.
@@ -888,9 +886,8 @@ void Generate_JSEntryVariant(MacroAssembler* masm, StackFrame::Type type,
 
   // If this is the outermost JS call, set js_entry_sp value.
   Label non_outermost_js;
-  ExternalReference js_entry_sp =
-      ExternalReference::Create(IsolateAddressId::kJSEntrySPAddress,
-                                masm->isolate());
+  ExternalReference js_entry_sp = ExternalReference::Create(
+      IsolateAddressId::kJSEntrySPAddress, masm->isolate());
   __ Move(r7, js_entry_sp);
   __ LoadAndTestP(scrach, MemOperand(r7));
   __ bne(&non_outermost_js, Label::kNear);
@@ -1021,7 +1018,7 @@ static void Generate_JSEntryTrampolineHelper(MacroAssembler* masm,
   // r5: receiver
   // r6: argc
   // [fp + kPushedStackSpace + 20 * kSystemPointerSize]: argv
-  // r0,r2,r7-r9, cp may be clobbered
+  // r0,r2,r7-r8, cp may be clobbered
 
   __ mov(r2, r6);
   // Load argv from the stack.
@@ -1069,7 +1066,6 @@ static void Generate_JSEntryTrampolineHelper(MacroAssembler* masm,
     // r6: argv, i.e. points to first arg
     // r7: scratch reg to hold scaled argc
     // r8: scratch reg to hold arg handle
-    // r9: scratch reg to hold index into argv
     Generate_PushArguments(masm, r6, r2, r1, ArgumentsElementType::kHandle);
 
     // Push the receiver.
@@ -1088,7 +1084,6 @@ static void Generate_JSEntryTrampolineHelper(MacroAssembler* masm,
     __ mov(r6, r4);
     __ mov(r7, r6);
     __ mov(r8, r6);
-    __ mov(r9, r6);
 
     // Invoke the code.
     Handle<Code> builtin = is_construct
@@ -1248,13 +1243,14 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   Register feedback_vector = ip;
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
   __ AssertFeedbackVector(feedback_vector, r1);
 
   // Check for an tiering state.
   Label flags_need_processing;
-  Register flags = r9;
+  Register flags = r8;
   {
     __ LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
         flags, feedback_vector, CodeKind::BASELINE, &flags_need_processing);
@@ -1268,11 +1264,11 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   // Increment invocation count for the function.
   {
     Register invocation_count = r1;
-    __ LoadU64(invocation_count,
+    __ LoadU32(invocation_count,
                FieldMemOperand(feedback_vector,
                                FeedbackVector::kInvocationCountOffset));
-    __ AddU64(invocation_count, Operand(1));
-    __ StoreU64(invocation_count,
+    __ AddU32(invocation_count, Operand(1));
+    __ StoreU32(invocation_count,
                 FieldMemOperand(feedback_vector,
                                 FeedbackVector::kInvocationCountOffset));
   }
@@ -1288,6 +1284,7 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
         BaselineOutOfLinePrologueDescriptor::kCalleeContext);
     Register callee_js_function = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kClosure);
+    ResetJSFunctionAge(masm, callee_js_function, r1, r0);
     __ Push(callee_context, callee_js_function);
     DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
     DCHECK_EQ(callee_js_function, kJSFunctionRegister);
@@ -1298,7 +1295,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // the frame, so load it into a register.
     Register bytecodeArray = descriptor.GetRegisterParameter(
         BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray);
-    ResetBytecodeAge(masm, bytecodeArray, r1);
 
     __ Push(argc, bytecodeArray);
 
@@ -1407,6 +1403,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // kInterpreterBytecodeArrayRegister.
   __ LoadTaggedField(
       r6, FieldMemOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, r6, ip);
   // Load original bytecode array or the debug copy.
   __ LoadTaggedField(
       kInterpreterBytecodeArrayRegister,
@@ -1428,8 +1425,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   Register feedback_vector = r4;
   __ LoadTaggedField(feedback_vector,
                      FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-  __ LoadTaggedField(feedback_vector,
-                     FieldMemOperand(feedback_vector, Cell::kValueOffset));
+  __ LoadTaggedField(
+      feedback_vector,
+      FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
   Label push_stack_frame;
   // Check if feedback vector is valid. If valid, check for optimized code
@@ -1456,7 +1454,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
 
   // Increment invocation count for the function.
   __ LoadS32(r1, FieldMemOperand(feedback_vector,
-                               FeedbackVector::kInvocationCountOffset));
+                                 FeedbackVector::kInvocationCountOffset));
   __ AddS64(r1, r1, Operand(1));
   __ StoreU32(r1, FieldMemOperand(feedback_vector,
                                   FeedbackVector::kInvocationCountOffset));
@@ -1474,8 +1472,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   FrameScope frame_scope(masm, StackFrame::MANUAL);
   __ PushStandardFrame(closure);
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister, r1);
-
   // Load the initial bytecode offset.
   __ mov(kInterpreterBytecodeOffsetRegister,
          Operand(BytecodeArray::kHeaderSize - kHeapObjectTag));
@@ -1489,7 +1485,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   {
     // Load frame size (word) from the BytecodeArray object.
     __ LoadU32(r4, FieldMemOperand(kInterpreterBytecodeArrayRegister,
-                                  BytecodeArray::kFrameSizeOffset));
+                                   BytecodeArray::kFrameSizeOffset));
 
     // Do a stack check to ensure we don't go over the limit.
     __ SubS64(r8, sp, r4);
@@ -1514,9 +1510,10 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   // If the bytecode array has a valid incoming new target or generator object
   // register, initialize it with incoming value which was passed in r5.
   Label no_incoming_new_target_or_generator_register;
-  __ LoadS32(r8, FieldMemOperand(
-                   kInterpreterBytecodeArrayRegister,
-                   BytecodeArray::kIncomingNewTargetOrGeneratorRegisterOffset));
+  __ LoadS32(r8,
+             FieldMemOperand(
+                 kInterpreterBytecodeArrayRegister,
+                 BytecodeArray::kIncomingNewTargetOrGeneratorRegisterOffset));
   __ CmpS64(r8, Operand::Zero());
   __ beq(&no_incoming_new_target_or_generator_register);
   __ ShiftLeftU64(r8, r8, Operand(kSystemPointerSizeLog2));
@@ -1621,8 +1618,9 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ LoadTaggedField(
         feedback_vector,
         FieldMemOperand(closure, JSFunction::kFeedbackCellOffset));
-    __ LoadTaggedField(feedback_vector,
-                       FieldMemOperand(feedback_vector, Cell::kValueOffset));
+    __ LoadTaggedField(
+        feedback_vector,
+        FieldMemOperand(feedback_vector, FeedbackCell::kValueOffset));
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1787,11 +1785,184 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   }
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- r2 : argument count
+  // -- r3 : constructor to call (checked to be a JSFunction)
+  // -- r5 : new target
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+  Register implicit_receiver = r6;
+
+  // Save live registers.
+  __ SmiTag(r2);
+  __ Push(r2, r3, r5);
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  // Save result.
+  __ Move(implicit_receiver, r2);
+  // Restore live registers.
+  __ Pop(r2, r3, r5);
+  __ SmiUntag(r2);
+
+  // Patch implicit receiver (in arguments)
+  __ StoreU64(implicit_receiver, MemOperand(sp, 0 * kSystemPointerSize));
+  // Patch second implicit (in construct frame)
+  __ StoreU64(
+      implicit_receiver,
+      MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+
+  // Restore context.
+  __ LoadU64(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  // -- r2 : argument count
+  // -- r3 : constructor to call (checked to be a JSFunction)
+  // -- r5 : new target
+  // -- r6 : address of the first argument
+  // -- cp/r13 : context pointer
+  // -----------------------------------
+  __ AssertFunction(r3);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  __ LoadMap(r4, r3);
+  __ LoadU8(r4, FieldMemOperand(r4, Map::kBitFieldOffset));
+  __ TestBit(r4, Map::Bits1::IsConstructorBit::kShift);
+  __ beq(&non_constructor);
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(r2, r4, &stack_overflow);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+  // Implicit receiver stored in the construct frame.
+  __ LoadRoot(r4, RootIndex::kTheHoleValue);
+  __ Push(cp, r4);
+
+  // Push arguments + implicit receiver.
+  Register argc_without_receiver = r8;
+  __ SubS64(argc_without_receiver, r2, Operand(kJSArgcReceiverSlots));
+  // Push the arguments. r6 and r7 will be modified.
+  GenerateInterpreterPushArgs(masm, argc_without_receiver, r6, r7);
+  // Implicit receiver as part of the arguments (patched later if needed).
+  __ push(r4);
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  __ LoadTaggedField(
+      r4, FieldMemOperand(r3, JSFunction::kSharedFunctionInfoOffset));
+  __ LoadU32(r4, FieldMemOperand(r4, SharedFunctionInfo::kFlagsOffset));
+  __ AndP(r0, r4, Operand(SharedFunctionInfo::ConstructAsBuiltinBit::kMask));
+  __ bne(&builtin_call);
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(r4);
+  __ JumpIfIsInRange(
+      r4, static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor),
+      &not_create_implicit_receiver);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the function.
+  __ InvokeFunctionWithNewTarget(r3, r5, r2, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- r0     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label use_receiver, do_throw, leave_and_return, check_receiver;
+
+  // If the result is undefined, we jump out to using the implicit receiver.
+  __ JumpIfNotRoot(r2, RootIndex::kUndefinedValue, &check_receiver);
+
+  // Otherwise we do a smi check and fall through to check if the return value
+  // is a valid receiver.
+
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ bind(&use_receiver);
+  __ LoadU64(
+      r2, MemOperand(fp, FastConstructFrameConstants::kImplicitReceiverOffset));
+  __ JumpIfRoot(r2, RootIndex::kTheHoleValue, &do_throw);
+
+  __ bind(&leave_and_return);
+  // Leave construct frame.
+  __ LeaveFrame(StackFrame::CONSTRUCT);
+  __ Ret();
+
+  __ bind(&check_receiver);
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(r2, &use_receiver);
+
+  // If the type of the result (stored in its map) is less than
+  // FIRST_JS_RECEIVER_TYPE, it is not an object in the ECMA sense.
+  static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
+  __ CompareObjectType(r2, r6, r7, FIRST_JS_RECEIVER_TYPE);
+  __ bge(&leave_and_return);
+  __ b(&use_receiver);
+
+  __ bind(&builtin_call);
+  // TODO(victorgomes): Check the possibility to turn this into a tailcall.
+  __ InvokeFunctionWithNewTarget(r3, r5, r2, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ Ret();
+
+  __ bind(&do_throw);
+  // Restore the context from the frame.
+  __ LoadU64(cp, MemOperand(fp, FastConstructFrameConstants::kContextOffset));
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  __ bkpt(0);
+
+  __ bind(&stack_overflow);
+  // Restore the context from the frame.
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  // Unreachable code.
+  __ bkpt(0);
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Set the return address to the correct point in the interpreter entry
   // trampoline.
   Label builtin_trampoline, trampoline_loaded;
-  Smi interpreter_entry_return_pc_offset(
+  Tagged<Smi> interpreter_entry_return_pc_offset(
       masm->isolate()->heap()->interpreter_entry_return_pc_offset());
   DCHECK_NE(interpreter_entry_return_pc_offset, Smi::zero());
 
@@ -1811,7 +1982,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
 
   __ LoadTaggedField(
       r4, FieldMemOperand(r4, InterpreterData::kInterpreterTrampolineOffset));
-  __ LoadCodeEntry(r4, r4);
+  __ LoadCodeInstructionStart(r4, r4);
   __ b(&trampoline_loaded);
 
   __ bind(&builtin_trampoline);
@@ -1970,7 +2141,7 @@ void Generate_ContinueToBuiltinHelper(MacroAssembler* masm,
             Operand(BuiltinContinuationFrameConstants::kFixedFrameSizeFromFp));
   __ Pop(r0);
   __ mov(r14, r0);
-  __ LoadEntryFromBuiltinIndex(builtin);
+  __ LoadEntryFromBuiltinIndex(builtin, builtin);
   __ Jump(builtin);
 }
 }  // namespace
@@ -2230,7 +2401,7 @@ void Generate_AllocateSpaceAndShiftExistingArguments(
 }  // namespace
 
 // static
-// TODO(v8:11615): Observe InstructionStream::kMaxArguments in
+// TODO(v8:11615): Observe Code::kMaxArguments in
 // CallOrConstructVarargs
 void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
                                                Handle<Code> code) {
@@ -2249,8 +2420,7 @@ void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
     Label ok, fail;
     __ AssertNotSmi(r4);
     __ LoadTaggedField(scratch, FieldMemOperand(r4, HeapObject::kMapOffset));
-    __ LoadS16(scratch,
-                     FieldMemOperand(scratch, Map::kInstanceTypeOffset));
+    __ LoadS16(scratch, FieldMemOperand(scratch, Map::kInstanceTypeOffset));
     __ CmpS64(scratch, Operand(FIXED_ARRAY_TYPE));
     __ beq(&ok);
     __ CmpS64(scratch, Operand(FIXED_DOUBLE_ARRAY_TYPE));
@@ -2430,7 +2600,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
       __ LoadGlobalProxy(r5);
     } else {
       Label convert_to_object, convert_receiver;
-      __ LoadReceiver(r5, r2);
+      __ LoadReceiver(r5);
       __ JumpIfSmi(r5, &convert_to_object);
       static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
       __ CompareObjectType(r5, r6, r6, FIRST_JS_RECEIVER_TYPE);
@@ -2467,7 +2637,7 @@ void Builtins::Generate_CallFunction(MacroAssembler* masm,
           r4, FieldMemOperand(r3, JSFunction::kSharedFunctionInfoOffset));
       __ bind(&convert_receiver);
     }
-    __ StoreReceiver(r5, r2, r6);
+    __ StoreReceiver(r5);
   }
   __ bind(&done_convert);
 
@@ -2512,8 +2682,8 @@ void Generate_PushBoundArguments(MacroAssembler* masm) {
     // Reserve stack space for the [[BoundArguments]].
     {
       Label done;
-      __ ShiftLeftU64(r9, r6, Operand(kSystemPointerSizeLog2));
-      __ SubS64(r1, sp, r9);
+      __ ShiftLeftU64(scratch, r6, Operand(kSystemPointerSizeLog2));
+      __ SubS64(r1, sp, scratch);
       // Check the stack for overflow. We are not trying to catch interruptions
       // (i.e. debug break and preemption) here, so check the "real stack
       // limit".
@@ -2566,7 +2736,7 @@ void Builtins::Generate_CallBoundFunctionImpl(MacroAssembler* masm) {
   // Patch the receiver to [[BoundThis]].
   __ LoadTaggedField(r5,
                      FieldMemOperand(r3, JSBoundFunction::kBoundThisOffset));
-  __ StoreReceiver(r5, r2, r1);
+  __ StoreReceiver(r5);
 
   // Push the [[BoundArguments]] onto the stack.
   Generate_PushBoundArguments(masm);
@@ -2584,11 +2754,10 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   //  -- r2 : the number of arguments
   //  -- r3 : the target to call (can be any Object).
   // -----------------------------------
-  Register argc = r2;
   Register target = r3;
   Register map = r6;
   Register instance_type = r7;
-  DCHECK(!AreAliased(argc, target, map, instance_type));
+  DCHECK(!AreAliased(r2, target, map, instance_type));
 
   Label non_callable, class_constructor;
   __ JumpIfSmi(target, &non_callable);
@@ -2629,7 +2798,7 @@ void Builtins::Generate_Call(MacroAssembler* masm, ConvertReceiverMode mode) {
   // 2. Call to something else, which might have a [[Call]] internal method (if
   // not we raise an exception).
   // Overwrite the original receiver the (original) target.
-  __ StoreReceiver(target, argc, r7);
+  __ StoreReceiver(target);
   // Let the "call_as_function_delegate" take care of the rest.
   __ LoadNativeContextSlot(target, Context::CALL_AS_FUNCTION_DELEGATE_INDEX);
   __ Jump(masm->isolate()->builtins()->CallFunction(
@@ -2721,11 +2890,10 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   //  -- r5 : the new target (either the same as the constructor or
   //          the JSFunction on which new was invoked initially)
   // -----------------------------------
-  Register argc = r2;
   Register target = r3;
   Register map = r6;
   Register instance_type = r7;
-  DCHECK(!AreAliased(argc, target, map, instance_type));
+  DCHECK(!AreAliased(r2, target, map, instance_type));
 
   // Check if target is a Smi.
   Label non_constructor, non_proxy;
@@ -2735,7 +2903,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ LoadTaggedField(map, FieldMemOperand(target, HeapObject::kMapOffset));
   {
     Register flags = r4;
-    DCHECK(!AreAliased(argc, target, map, instance_type, flags));
+    DCHECK(!AreAliased(r2, target, map, instance_type, flags));
     __ LoadU8(flags, FieldMemOperand(map, Map::kBitFieldOffset));
     __ TestBit(flags, Map::Bits1::IsConstructorBit::kShift);
     __ beq(&non_constructor);
@@ -2763,7 +2931,7 @@ void Builtins::Generate_Construct(MacroAssembler* masm) {
   __ bind(&non_proxy);
   {
     // Overwrite the original receiver with the (original) target.
-    __ StoreReceiver(target, argc, r7);
+    __ StoreReceiver(target);
     // Let the "call_as_constructor_delegate" take care of the rest.
     __ LoadNativeContextSlot(target,
                              Context::CALL_AS_CONSTRUCTOR_DELEGATE_INDEX);
@@ -2920,15 +3088,11 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
   __ Ret();
 }
 
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
-  // TODO(v8:10701): Implement for this platform.
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
   __ Trap();
 }
 
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
-  // TODO(v8:12191): Implement for this platform.
-  __ Trap();
-}
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) { __ Trap(); }
 
 void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   // TODO(v8:12191): Implement for this platform.
@@ -2949,10 +3113,13 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
   // Only needed on x64.
   __ Trap();
 }
+
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) { __ Trap(); }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   // Called from JavaScript; parameters are on stack as if calling JS function.
   // r2: number of arguments including receiver
   // r3: pointer to builtin function
@@ -3153,9 +3320,9 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   argument_offset += 2 * kSystemPointerSize;
 
   __ LoadU32(scratch_high,
-            MemOperand(sp, argument_offset + Register::kExponentOffset));
+             MemOperand(sp, argument_offset + Register::kExponentOffset));
   __ LoadU32(scratch_low,
-            MemOperand(sp, argument_offset + Register::kMantissaOffset));
+             MemOperand(sp, argument_offset + Register::kMantissaOffset));
 
   __ ExtractBitMask(scratch, scratch_high, HeapNumber::kExponentMask);
   // Load scratch with exponent - 1. This is faster than loading
@@ -3233,209 +3400,120 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ Ret();
 }
 
-namespace {
-
-static int AddressOffset(ExternalReference ref0, ExternalReference ref1) {
-  return ref0.address() - ref1.address();
-}
-
-// Calls an API function.  Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.  Restores context.  stack_space
-// - space to be unwound on exit (includes the call JS arguments space and
-// the additional space allocated for the fast call).
-static void CallApiFunctionAndReturn(MacroAssembler* masm,
-                                     Register function_address,
-                                     ExternalReference thunk_ref,
-                                     int stack_space,
-                                     MemOperand* stack_space_operand,
-                                     MemOperand return_value_operand) {
-  Isolate* isolate = masm->isolate();
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  const int kNextOffset = 0;
-  const int kLimitOffset = AddressOffset(
-      ExternalReference::handle_scope_limit_address(isolate), next_address);
-  const int kLevelOffset = AddressOffset(
-      ExternalReference::handle_scope_level_address(isolate), next_address);
-
-  // Additional parameter is the address of the actual callback.
-  DCHECK(function_address == r3 || function_address == r4);
-  Register scratch = r5;
-
-  // Allocate HandleScope in callee-save registers.
-  // r9 - next_address
-  // r6 - next_address->kNextOffset
-  // r7 - next_address->kLimitOffset
-  // r8 - next_address->kLevelOffset
-  __ Move(r9, next_address);
-  __ LoadU64(r6, MemOperand(r9, kNextOffset));
-  __ LoadU64(r7, MemOperand(r9, kLimitOffset));
-  __ LoadU32(r8, MemOperand(r9, kLevelOffset));
-  __ AddS64(r8, Operand(1));
-  __ StoreU32(r8, MemOperand(r9, kLevelOffset));
-
-  Label profiler_enabled, done_api_call;
-  __ LoadU8(scratch,
-            __ ExternalReferenceAsOperand(
-                ExternalReference::is_profiling_address(isolate), scratch));
-  __ CmpS64(scratch, Operand::Zero());
-  __ bne(&profiler_enabled, Label::kNear);
-#ifdef V8_RUNTIME_CALL_STATS
-  __ Move(scratch, ExternalReference::address_of_runtime_stats_flag());
-  __ LoadU32(scratch, MemOperand(scratch, 0));
-  __ CmpS64(scratch, Operand::Zero());
-  __ bne(&profiler_enabled, Label::kNear);
-#endif  // V8_RUNTIME_CALL_STATS
-
-  // Call the api function directly.
-  __ StoreReturnAddressAndCall(function_address);
-  __ bind(&done_api_call);
-
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-  Label return_value_loaded;
-
-  // load value from ReturnValue
-  __ LoadU64(r2, return_value_operand);
-  __ bind(&return_value_loaded);
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ StoreU64(r6, MemOperand(r9, kNextOffset));
-  if (v8_flags.debug_code) {
-    __ LoadU32(r3, MemOperand(r9, kLevelOffset));
-    __ CmpS64(r3, r8);
-    __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall);
-  }
-  __ SubS64(r8, Operand(1));
-  __ StoreU32(r8, MemOperand(r9, kLevelOffset));
-  __ CmpS64(r7, MemOperand(r9, kLimitOffset));
-  __ bne(&delete_allocated_handles, Label::kNear);
-
-  // Leave the API exit frame.
-  __ bind(&leave_exit_frame);
-  // LeaveExitFrame expects unwind space to be in a register.
-  if (stack_space_operand == nullptr) {
-    DCHECK_NE(stack_space, 0);
-    __ mov(r6, Operand(stack_space));
-  } else {
-    DCHECK_EQ(stack_space, 0);
-    __ LoadU64(r6, *stack_space_operand);
-  }
-  __ LeaveExitFrame(r6, stack_space_operand != nullptr);
-
-  // Check if the function scheduled an exception.
-  __ Move(r7, ExternalReference::scheduled_exception_address(isolate));
-  __ LoadU64(r7, MemOperand(r7));
-  __ CompareRoot(r7, RootIndex::kTheHoleValue);
-  __ bne(&promote_scheduled_exception, Label::kNear);
-
-  __ b(r14);
-
-  // Call the api function via thunk wrapper.
-  __ bind(&profiler_enabled);
-  // Additional parameter is the address of the actual callback.
-  __ Move(r5, function_address);
-  __ Move(ip, thunk_ref);
-  __ StoreReturnAddressAndCall(ip);
-  __ b(&done_api_call);
-
-  // Re-throw by promoting a scheduled exception.
-  __ bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  __ bind(&delete_allocated_handles);
-  __ StoreU64(r7, MemOperand(r9, kLimitOffset));
-  __ mov(r6, r2);
-  __ PrepareCallCFunction(1, r7);
-  __ Move(r2, ExternalReference::isolate_address(isolate));
-  __ CallCFunction(ExternalReference::delete_handle_scope_extensions(), 1);
-  __ mov(r2, r6);
-  __ b(&leave_exit_frame, Label::kNear);
-}
-
-MemOperand ExitFrameStackSlotOperand(int offset) {
-  static constexpr int kFrameOffset = 1 * kSystemPointerSize;
-  return MemOperand(sp, (kStackFrameExtraParamSlot * kSystemPointerSize) +
-                            offset + kFrameOffset);
-}
-
-MemOperand ExitFrameCallerStackSlotOperand(int index) {
-  return MemOperand(
-      fp, (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
-              kSystemPointerSize);
-}
-
-}  // namespace
-
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- cp                  : context
+  // CallApiCallbackMode::kGeneric mode:
+  //  -- r4                  : arguments count (not including the receiver)
+  //  -- r5                  : call handler info
+  //  -- r2                  : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
   //  -- r4                  : api function address
   //  -- r4                  : arguments count (not including the receiver)
   //  -- r5                  : call data
   //  -- r2                  : holder
+  // Both modes:
+  //  -- cp
   //  -- sp[0]               : receiver
   //  -- sp[8]               : first argument
   //  -- ...
   //  -- sp[(argc) * 8]      : last argument
   // -----------------------------------
 
-  Register api_function_address = r3;
-  Register argc = r4;
-  Register call_data = r5;
-  Register holder = r2;
+  Register function_callback_info_arg = arg_reg_1;
+
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register holder = no_reg;
+  Register callback = no_reg;
   Register scratch = r6;
-  DCHECK(!AreAliased(api_function_address, argc, call_data, holder, scratch));
+  Register scratch2 = r7;
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = r3;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, holder, call_data, callback,
+                     scratch, scratch2));
 
-  using FCI = FunctionCallbackInfo<v8::Value>;
   using FCA = FunctionCallbackArguments;
 
   static_assert(FCA::kArgsLength == 6);
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
   // Set up FunctionCallbackInfo's implicit_args on the stack as follows:
   //
   // Target state:
-  //   sp[0 * kSystemPointerSize]: kHolder   <= FCI::implicit_args_
-  //   sp[1 * kSystemPointerSize]: kIsolate
-  //   sp[2 * kSystemPointerSize]: undefined (kReturnValueDefaultValue)
-  //   sp[3 * kSystemPointerSize]: undefined (kReturnValue)
-  //   sp[4 * kSystemPointerSize]: kData
-  //   sp[5 * kSystemPointerSize]: undefined (kNewTarget)
+  //   sp[1 * kSystemPointerSize]: kHolder   <= FCA::implicit_args_
+  //   sp[2 * kSystemPointerSize]: kIsolate
+  //   sp[3 * kSystemPointerSize]: Smi::zero(padding, unused)
+  //   sp[4 * kSystemPointerSize]: undefined (kReturnValue)
+  //   sp[5 * kSystemPointerSize]: kData
+  //   sp[6 * kSystemPointerSize]: undefined (kNewTarget)
   // Existing state:
-  //   sp[6 * kSystemPointerSize]:            <= FCI:::values_
+  //   sp[7 * kSystemPointerSize]:            <= FCA:::values_
 
   // Reserve space on the stack.
   __ lay(sp, MemOperand(sp, -(FCA::kArgsLength * kSystemPointerSize)));
 
   // kHolder.
-  __ StoreU64(holder, MemOperand(sp, 0 * kSystemPointerSize));
+  __ StoreU64(holder, MemOperand(sp, FCA::kHolderIndex * kSystemPointerSize));
 
   // kIsolate.
   __ Move(scratch, ExternalReference::isolate_address(masm->isolate()));
-  __ StoreU64(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+  __ StoreU64(scratch, MemOperand(sp, FCA::kIsolateIndex * kSystemPointerSize));
 
-  // kReturnValueDefaultValue and kReturnValue.
+  // kUnused
+  __ Move(scratch, Smi::zero());
+  __ StoreU64(scratch, MemOperand(sp, FCA::kUnusedIndex * kSystemPointerSize));
+
+  // kReturnValue.
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ StoreU64(scratch, MemOperand(sp, 2 * kSystemPointerSize));
-  __ StoreU64(scratch, MemOperand(sp, 3 * kSystemPointerSize));
+  __ StoreU64(scratch,
+              MemOperand(sp, FCA::kReturnValueIndex * kSystemPointerSize));
 
   // kData.
-  __ StoreU64(call_data, MemOperand(sp, 4 * kSystemPointerSize));
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ LoadTaggedField(
+          scratch2, FieldMemOperand(callback, CallHandlerInfo::kDataOffset));
+      __ StoreU64(scratch2,
+                  MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ StoreU64(call_data,
+                  MemOperand(sp, FCA::kDataIndex * kSystemPointerSize));
+      break;
+  }
 
   // kNewTarget.
-  __ StoreU64(scratch, MemOperand(sp, 5 * kSystemPointerSize));
+  __ StoreU64(scratch,
+              MemOperand(sp, FCA::kNewTargetIndex * kSystemPointerSize));
 
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  __ mov(scratch, sp);
+  __ mov(holder, sp);
 
   // Allocate the v8::Arguments structure in the arguments' space since
   // it's not controlled by GC.
@@ -3445,54 +3523,111 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   //    [0] space for DirectCEntryStub's LR save
   //    [1-3] FunctionCallbackInfo
   //    [4] number of bytes to drop from the stack after returning
-  static constexpr int kSlotsToDropSize = 1 * kSystemPointerSize;
+  static constexpr int kSlotsToDropOnStackSize = 1 * kSystemPointerSize;
   static constexpr int kApiStackSpace = 5;
-  static_assert(FCI::kImplicitArgsOffset == 0);
-  static_assert(FCI::kValuesOffset == 1 * kSystemPointerSize);
-  static_assert(FCI::kLengthOffset == 2 * kSystemPointerSize);
+  // (FCA::kSize + kSlotsToDropOnStackSize) / kSystemPointerSize;
+  static_assert(FCA::kImplicitArgsOffset == 0);
+  static_assert(FCA::kValuesOffset == 1 * kSystemPointerSize);
+  static_assert(FCA::kLengthOffset == 2 * kSystemPointerSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
 
   FrameScope frame_scope(masm, StackFrame::MANUAL);
-  __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+    __ AllocateStackSpace(exit_frame_params_count * kSystemPointerSize);
+
+    // No padding is required.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize == 0);
+
+    // Context parameter.
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ StoreU64(kContextRegister, MemOperand(sp, 2 * kSystemPointerSize));
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ SmiTag(scratch, argc);
+    __ StoreU64(scratch, MemOperand(sp, 1 * kSystemPointerSize));
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ LoadTaggedField(
+        scratch,
+        FieldMemOperand(callback, CallHandlerInfo::kOwnerTemplateOffset));
+    __ StoreU64(scratch, MemOperand(sp, 0 * kSystemPointerSize));
 
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  // Arguments are after the return address (pushed by EnterExitFrame()).
-  __ StoreU64(scratch, ExitFrameStackSlotOperand(FCI::kImplicitArgsOffset));
+    __ LoadU64(api_function_address,
+               FieldMemOperand(
+                   callback, CallHandlerInfo::kMaybeRedirectedCallbackOffset));
 
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  __ AddS64(scratch, scratch,
-            Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
-  __ StoreU64(scratch, ExitFrameStackSlotOperand(FCI::kValuesOffset));
+    __ EnterExitFrame(kApiStackSpace, StackFrame::API_CALLBACK_EXIT);
+  } else {
+    __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    // Arguments are after the return address (pushed by EnterExitFrame()).
+    __ StoreU64(holder, ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset));
+
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ AddS64(holder, holder,
+              Operand(FCA::kArgsLengthWithReceiver * kSystemPointerSize));
+    __ StoreU64(holder, ExitFrameStackSlotOperand(FCA::kValuesOffset));
 
-  // FunctionCallbackInfo::length_.
-  __ StoreU32(argc, ExitFrameStackSlotOperand(FCI::kLengthOffset));
+    // FunctionCallbackInfo::length_.
+    __ StoreU32(argc, ExitFrameStackSlotOperand(FCA::kLengthOffset));
+  }
 
   // We also store the number of bytes to drop from the stack after returning
   // from the API function here.
   MemOperand stack_space_operand =
-      ExitFrameStackSlotOperand(FCI::kLengthOffset + kSlotsToDropSize);
-  __ mov(scratch,
-         Operand((FCA::kArgsLength + 1 /* receiver */) * kSystemPointerSize));
+      ExitFrameStackSlotOperand(FCA::kLengthOffset + kSlotsToDropOnStackSize);
+  __ mov(scratch, Operand((FCA::kArgsLength + 1 /* receiver */ +
+                           exit_frame_params_count) *
+                          kSystemPointerSize));
   __ ShiftLeftU64(r1, argc, Operand(kSystemPointerSizeLog2));
   __ AddS64(scratch, r1);
   __ StoreU64(scratch, stack_space_operand);
 
-  // v8::InvocationCallback's argument.
-  __ lay(r2,
+  __ RecordComment("v8::FunctionCallback's argument.");
+  __ lay(function_callback_info_arg,
          MemOperand(sp, (kStackFrameExtraParamSlot + 1) * kSystemPointerSize));
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
-  MemOperand return_value_operand =
-      ExitFrameCallerStackSlotOperand(FCA::kReturnValueIndex);
+  DCHECK(!AreAliased(api_function_address, function_callback_info_arg));
+
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
+
+  MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
   static constexpr int kUseStackSpaceOperand = 0;
 
-  AllowExternalCallThatCantCauseGC scope(masm);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kUseStackSpaceOperand, &stack_space_operand,
-                           return_value_operand);
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseStackSpaceOperand,
+                           &stack_space_operand, return_value_operand);
 }
 
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- cp                  : context
+  //  -- r3                  : receiver
+  //  -- r5                  : accessor info
+  //  -- r2                  : holder
+  // -----------------------------------
+
   int arg0Slot = 0;
   int accessorInfoSlot = 0;
   int apiStackSpace = 0;
@@ -3502,41 +3637,55 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
   static_assert(PCA::kShouldThrowOnErrorIndex == 0);
   static_assert(PCA::kHolderIndex == 1);
   static_assert(PCA::kIsolateIndex == 2);
-  static_assert(PCA::kReturnValueDefaultValueIndex == 3);
+  static_assert(PCA::kUnusedIndex == 3);
   static_assert(PCA::kReturnValueIndex == 4);
   static_assert(PCA::kDataIndex == 5);
   static_assert(PCA::kThisIndex == 6);
   static_assert(PCA::kArgsLength == 7);
 
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  // Target state:
+  //   sp[0 * kSystemPointerSize]: name
+  //   sp[1 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   sp[2 * kSystemPointerSize]: kHolderIndex
+  //   sp[3 * kSystemPointerSize]: kIsolateIndex
+  //   sp[4 * kSystemPointerSize]: kUnusedIndex
+  //   sp[5 * kSystemPointerSize]: kReturnValueIndex
+  //   sp[6 * kSystemPointerSize]: kDataIndex
+  //   sp[7 * kSystemPointerSize]: kThisIndex / receiver
+
+  Register name_arg = arg_reg_1;
+  Register property_callback_info_arg = arg_reg_2;
+
+  Register api_function_address = r4;
   Register receiver = ApiGetterDescriptor::ReceiverRegister();
   Register holder = ApiGetterDescriptor::HolderRegister();
   Register callback = ApiGetterDescriptor::CallbackRegister();
   Register scratch = r6;
-  DCHECK(!AreAliased(receiver, holder, callback, scratch));
+  Register smi_zero = r7;
+  DCHECK(!AreAliased(receiver, holder, callback, scratch, smi_zero));
 
-  Register api_function_address = r4;
-
-  __ push(receiver);
-  // Push data from AccessorInfo.
   __ LoadTaggedField(scratch,
                      FieldMemOperand(callback, AccessorInfo::kDataOffset), r1);
-  __ push(scratch);
+  __ Push(receiver, scratch);
   __ LoadRoot(scratch, RootIndex::kUndefinedValue);
-  __ Push(scratch, scratch);
+  __ Move(smi_zero, Smi::zero());
+  __ Push(scratch, smi_zero);  // kReturnValueIndex, kUnusedIndex
   __ Move(scratch, ExternalReference::isolate_address(masm->isolate()));
   __ Push(scratch, holder);
-  __ Push(Smi::zero());  // should_throw_on_error -> false
   __ LoadTaggedField(scratch,
                      FieldMemOperand(callback, AccessorInfo::kNameOffset), r1);
-  __ push(scratch);
-
-  // v8::PropertyCallbackInfo::args_ array and name handle.
-  constexpr int kNameHandleStackSize = 1;
-  constexpr int kStackUnwindSpace = PCA::kArgsLength + kNameHandleStackSize;
-
-  // Load address of v8::PropertyAccessorInfo::args_ array and name handle.
-  __ mov(r2, sp);                                    // r2 = Handle<Name>
-  __ AddS64(r3, r2, Operand(1 * kSystemPointerSize));  // r3 = v8::PCI::args_
+  __ Push(smi_zero, scratch);
+  __ RecordComment(
+      "Load address of v8::PropertyAccessorInfo::args_ array and name handle.");
+  // name_arg = Handle<Name>(&name), name value was pushed to GC-ed stack space.
+  __ mov(name_arg, sp);
+  // property_callback_info_arg = v8::PCI::args_ (= &ShouldThrow)
+  __ AddS64(property_callback_info_arg, name_arg,
+            Operand(1 * kSystemPointerSize));
+
+  constexpr int kNameOnStackSize = 1;
+  constexpr int kStackUnwindSpace = PCA::kArgsLength + kNameOnStackSize;
 
   // If ABI passes Handles (pointer-sized struct) in a register:
   //
@@ -3568,23 +3717,36 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
     __ AddS64(r2, sp, Operand(arg0Slot * kSystemPointerSize));
   }
 
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
   // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // it's args_ field.
-  __ StoreU64(r3, MemOperand(sp, accessorInfoSlot * kSystemPointerSize));
-  __ AddS64(r3, sp, Operand(accessorInfoSlot * kSystemPointerSize));
-  // r3 = v8::PropertyCallbackInfo&
-
-  ExternalReference thunk_ref =
-      ExternalReference::invoke_accessor_getter_callback();
+  // its  v8::PropertyCallbackInfo::args_ field.
+  __ StoreU64(property_callback_info_arg,
+              MemOperand(sp, accessorInfoSlot * kSystemPointerSize));
+  // property_callback_info_arg = v8::PropertyCallbackInfo&
+  __ AddS64(property_callback_info_arg, sp,
+            Operand(accessorInfoSlot * kSystemPointerSize));
+
+  __ RecordComment("Load api_function_address");
   __ LoadU64(
       api_function_address,
       FieldMemOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset));
+
+  DCHECK(
+      !AreAliased(api_function_address, property_callback_info_arg, name_arg));
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_accessor_getter_callback();
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
+
   MemOperand return_value_operand = ExitFrameCallerStackSlotOperand(
-      PCA::kReturnValueIndex + kNameHandleStackSize);
+      PCA::kReturnValueIndex + kNameOnStackSize);
   MemOperand* const kUseStackSpaceConstant = nullptr;
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           return_value_operand);
+
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
@@ -3834,7 +3996,7 @@ void Builtins::Generate_BaselineOnStackReplacement(MacroAssembler* masm) {
   static_assert(D::kParameterCount == 1);
 
   __ LoadU64(kContextRegister,
-         MemOperand(fp, BaselineFrameConstants::kContextOffset));
+             MemOperand(fp, BaselineFrameConstants::kContextOffset));
   OnStackReplacement(masm, OsrSourceTier::kBaseline,
                      D::MaybeTargetCodeRegister());
 }
diff --git a/deps/v8/src/builtins/set-difference.tq b/deps/v8/src/builtins/set-difference.tq
new file mode 100644
index 00000000000000..c5f9e11bf02931
--- /dev/null
+++ b/deps/v8/src/builtins/set-difference.tq
@@ -0,0 +1,192 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace collections {
+
+// https://tc39.es/proposal-set-methods/#sec-set.prototype.difference
+transitioning javascript builtin SetPrototypeDifference(
+    js-implicit context: NativeContext, receiver: JSAny)(other: JSAny): JSSet {
+  const methodName: constexpr string = 'Set.prototype.difference';
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 1. Let O be the this value.
+  // 2. Perform ? RequireInternalSlot(O, [[SetData]]).
+  const o = Cast<JSSet>(receiver) otherwise
+  ThrowTypeError(
+      MessageTemplate::kIncompatibleMethodReceiver, methodName, receiver);
+
+  // 3. Let otherRec be ? GetSetRecord(other).
+  let otherRec = GetSetRecord(other, methodName);
+
+  const table = Cast<OrderedHashSet>(o.table) otherwise unreachable;
+
+  // 4. Let resultSetData be a copy of O.[[SetData]].
+  let resultSetData = Cast<OrderedHashSet>(CloneFixedArray(
+      table, ExtractFixedArrayFlag::kFixedArrays)) otherwise unreachable;
+
+  // 5. Let thisSize be the number of elements in O.[[SetData]].
+  const thisSize =
+      LoadOrderedHashTableMetadata(table, kOrderedHashSetNumberOfElementsIndex);
+
+  let numberOfElements = Convert<Smi>(thisSize);
+
+  try {
+    typeswitch (other) {
+      case (otherSet: JSSetWithNoCustomIteration): {
+        CheckSetRecordHasJSSetMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashSet>(otherSet.table) otherwise unreachable;
+
+        const otherSize = LoadOrderedHashTableMetadata(
+            otherTable, kOrderedHashSetNumberOfElementsIndex);
+
+        if (thisSize <= otherSize) {
+          numberOfElements =
+              FastDifference<OrderedHashSet>(table, otherTable, resultSetData);
+        } else {
+          numberOfElements = FastDifference<OrderedHashSet>(
+              otherTable, resultSetData, resultSetData);
+        }
+        goto Done;
+      }
+      case (otherMap: JSMapWithNoCustomIteration): {
+        CheckSetRecordHasJSMapMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashMap>(otherMap.table) otherwise unreachable;
+
+        const otherSize = LoadOrderedHashTableMetadata(
+            otherTable, kOrderedHashSetNumberOfElementsIndex);
+
+        if (thisSize <= otherSize) {
+          numberOfElements =
+              FastDifference<OrderedHashMap>(table, otherTable, resultSetData);
+          goto Done;
+        } else {
+          // TODO(13556): Change `FastDifference` macro to be able to handle
+          // this case as well.
+          let otherIterator =
+              collections::NewUnmodifiedOrderedHashMapIterator(otherTable);
+
+          // c. Repeat, while next is not false,
+          while (true) {
+            const nextValue = otherIterator.Next() otherwise Done;
+
+            if (TableHasKey(resultSetData, nextValue.key)) {
+              //   a. Remove nextValue from resultSetData.
+              numberOfElements =
+                  DeleteFromSetTable(resultSetData, nextValue.key)
+                  otherwise unreachable;
+            }
+          }
+        }
+      }
+      case (JSAny): {
+        goto SlowPath;
+      }
+    }
+  } label SlowPath {
+    // 6. If thisSize ≤ otherRec.[[Size]], then
+    if (thisSize <= Convert<int32>(otherRec.size)) {
+      // a. Let index be 0.
+      let thisIter = collections::NewOrderedHashSetIterator(table);
+
+      // b. Repeat, while index < thisSize,
+      while (true) {
+        // i. Let e be O.[[SetData]][index].
+        const key = thisIter.Next() otherwise Done;
+
+        // ii. Set index to index + 1.
+        // iii. If e is not empty, then
+        //   1. Let inOther be ToBoolean(? Call(otherRec.[[Has]],
+        // otherRec.[[Set]], « e »)).
+        const inOther =
+            ToBoolean(Call(context, otherRec.has, otherRec.object, key));
+
+        //   2. If inOther is true, then
+        if (inOther) {
+          try {
+            // a. Set resultSetData[index] to empty.
+            numberOfElements = DeleteFromSetTable(resultSetData, key)
+                otherwise NotFound;
+          } label NotFound {
+            // Do nothing and go back to the while loop.
+          }
+        }
+      }
+    } else {
+      // a. Let keysIter be ? GetKeysIterator(otherRec).
+      let keysIter =
+          GetKeysIterator(otherRec.object, UnsafeCast<Callable>(otherRec.keys));
+
+      // b. Let next be true.
+      let nextRecord: JSReceiver;
+
+      // c. Repeat, while next is not false,
+      while (true) {
+        // i. Set next to ? IteratorStep(keysIter).
+        nextRecord = iterator::IteratorStep(keysIter, fastIteratorResultMap)
+            otherwise Done;
+        // ii. If next is not false, then
+        //   1. Let nextValue be ? IteratorValue(next).
+        let nextValue =
+            iterator::IteratorValue(nextRecord, fastIteratorResultMap);
+
+        //   2. If nextValue is -0𝔽, set nextValue to +0𝔽.
+        nextValue = collections::NormalizeNumberKey(nextValue);
+
+        //   3. If SetDataHas(resultSetData, nextValue) is true, then
+
+        if (TableHasKey(resultSetData, nextValue)) {
+          //   a. Remove nextValue from resultSetData.
+          numberOfElements = DeleteFromSetTable(resultSetData, nextValue)
+              otherwise unreachable;
+        }
+      }
+    }
+  } label Done {
+    resultSetData =
+        ShrinkOrderedHashSetIfNeeded(numberOfElements, resultSetData);
+    return new JSSet{
+      map: *NativeContextSlot(ContextSlot::JS_SET_MAP_INDEX),
+      properties_or_hash: kEmptyFixedArray,
+      elements: kEmptyFixedArray,
+      table: resultSetData
+    };
+  }
+  unreachable;
+}
+
+// This macro creates an iterator from a collection that need to be iterated
+// (collectionToIterate), lookup each value of the iterator in a table that
+// needs to be checked (tableToLookup), and delete the value from result
+// (resultSetData) if it exists in the table.
+macro FastDifference<T : type extends FixedArray>(
+    implicit context: Context)(collectionToIterate: OrderedHashSet,
+    tableToLookup: T, resultSetData: OrderedHashSet): Smi {
+  let iter =
+      collections::NewUnmodifiedOrderedHashSetIterator(collectionToIterate);
+
+  let numberOfElements = UnsafeCast<Smi>(
+      resultSetData.objects[kOrderedHashSetNumberOfElementsIndex]);
+  try {
+    while (true) {
+      const nextValue = iter.Next() otherwise Done;
+
+      if (TableHasKey(tableToLookup, nextValue)) {
+        try {
+          numberOfElements = DeleteFromSetTable(resultSetData, nextValue)
+              otherwise NotFound;
+        } label NotFound {
+          // Do nothing and go back to the while loop.
+        }
+      }
+    }
+  } label Done {
+    return numberOfElements;
+  }
+  unreachable;
+}
+}
diff --git a/deps/v8/src/builtins/set-intersection.tq b/deps/v8/src/builtins/set-intersection.tq
new file mode 100644
index 00000000000000..971f4dda4cf532
--- /dev/null
+++ b/deps/v8/src/builtins/set-intersection.tq
@@ -0,0 +1,191 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace collections {
+
+// https://tc39.es/proposal-set-methods/#sec-set.prototype.intersection
+transitioning javascript builtin SetPrototypeIntersection(
+    js-implicit context: NativeContext, receiver: JSAny)(other: JSAny): JSSet {
+  const methodName: constexpr string = 'Set.prototype.intersection';
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 1. Let O be the this value.
+  // 2. Perform ? RequireInternalSlot(O, [[SetData]]).
+  const o = Cast<JSSet>(receiver) otherwise
+  ThrowTypeError(
+      MessageTemplate::kIncompatibleMethodReceiver, methodName, receiver);
+
+  // 3. Let otherRec be ? GetSetRecord(other).
+  let otherRec = GetSetRecord(other, methodName);
+
+  const table = Cast<OrderedHashSet>(o.table) otherwise unreachable;
+
+  // 4. Let resultSetData be a new empty List.
+  let resultSetData = AllocateOrderedHashSet();
+
+  // 5. Let thisSize be the number of elements in O.[[SetData]].
+  const thisSize =
+      LoadOrderedHashTableMetadata(table, kOrderedHashSetNumberOfElementsIndex);
+
+  try {
+    typeswitch (other) {
+      case (otherSet: JSSetWithNoCustomIteration): {
+        CheckSetRecordHasJSSetMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashSet>(otherSet.table) otherwise unreachable;
+
+        const otherSize = LoadOrderedHashTableMetadata(
+            otherTable, kOrderedHashSetNumberOfElementsIndex);
+
+        if (thisSize <= otherSize) {
+          resultSetData = FastIntersect<OrderedHashSet>(
+              table, otherTable, methodName, resultSetData);
+          goto Done;
+
+        } else {
+          resultSetData = FastIntersect<OrderedHashSet>(
+              otherTable, table, methodName, resultSetData);
+          goto Done;
+        }
+      }
+      case (otherMap: JSMapWithNoCustomIteration): {
+        CheckSetRecordHasJSMapMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashMap>(otherMap.table) otherwise unreachable;
+
+        const otherSize = LoadOrderedHashTableMetadata(
+            otherTable, kOrderedHashSetNumberOfElementsIndex);
+
+        if (thisSize <= otherSize) {
+          resultSetData = FastIntersect<OrderedHashMap>(
+              table, otherTable, methodName, resultSetData);
+          goto Done;
+
+        } else {
+          // TODO(13556): Change `FastIntersect` macro to be able to handle
+          // this case as well.
+          let otherIterator =
+              collections::NewUnmodifiedOrderedHashMapIterator(otherTable);
+
+          while (true) {
+            const nextValue = otherIterator.Next() otherwise Done;
+
+            if (TableHasKey(table, nextValue.key)) {
+              resultSetData =
+                  AddToSetTable(resultSetData, nextValue.key, methodName);
+            }
+          }
+        }
+      }
+      case (JSAny): {
+        goto SlowPath;
+      }
+    }
+  } label SlowPath {
+    // 6. If thisSize ≤ otherRec.[[Size]], then
+    if (thisSize <= Convert<int32>(otherRec.size)) {
+      // a. Let index be 0.
+      let thisIter = collections::NewOrderedHashSetIterator(table);
+
+      // b. Repeat, while index < thisSize,
+      while (true) {
+        // i. Let e be O.[[SetData]][index].
+        const key = thisIter.Next() otherwise Done;
+
+        // ii. Set index to index + 1.
+        // iii. If e is not empty, then
+        //   1. Let inOther be ToBoolean(? Call(otherRec.[[Has]],
+        // otherRec.[[Set]], « e »)).
+        const inOther =
+            ToBoolean(Call(context, otherRec.has, otherRec.object, key));
+
+        //   2. If inOther is true, then
+        if (inOther) {
+          //  a. NOTE: It is possible for earlier calls to otherRec.[[Has]] to
+          // remove and re-add an element of O.[[SetData]], which can cause the
+          // same element to be visited twice during this iteration.
+          // We used `OrderedHashSetIterator` that works when underlying table
+          // is changed.
+          //  b. Let alreadyInResult be SetDataHas(resultSetData, e).
+          //  c. If alreadyInResult is false, then
+          //    i. Append e to resultSetData.
+          resultSetData = AddToSetTable(resultSetData, key, methodName);
+        }
+
+        // 3. NOTE: The number of elements in O.[[SetData]] may have increased
+        // during execution of otherRec.[[Has]].
+        // 4. Set thisSize to the number of elements of O.[[SetData]].
+        // We used iterator so we do not need to update thisSize and index.
+      }
+    } else {
+      // a. Let keysIter be ? GetKeysIterator(otherRec).
+      let keysIter =
+          GetKeysIterator(otherRec.object, UnsafeCast<Callable>(otherRec.keys));
+
+      // b. Let next be true.
+      let nextRecord: JSReceiver;
+
+      // c. Repeat, while next is not false,
+      while (true) {
+        // i. Set next to ? IteratorStep(keysIter).
+        nextRecord = iterator::IteratorStep(keysIter, fastIteratorResultMap)
+            otherwise Done;
+
+        // ii. If next is not false, then
+        // 1. Let nextValue be ? IteratorValue(next).
+        const nextValue =
+            iterator::IteratorValue(nextRecord, fastIteratorResultMap);
+
+        // 2. If nextValue is -0𝔽, set nextValue to +0𝔽.
+        // 3. NOTE: Because other is an arbitrary object, it is possible for its
+        // "keys" iterator to produce the same value more than once.
+        // 4. Let alreadyInResult be SetDataHas(resultSetData, nextValue).
+        // 5. Let inThis be SetDataHas(O.[[SetData]], nextValue).
+
+        if (TableHasKey(table, nextValue)) {
+          // 6. If alreadyInResult is false and inThis is true, then
+          // a. Append nextValue to resultSetData.
+          resultSetData = AddToSetTable(resultSetData, nextValue, methodName);
+        }
+      }
+    }
+  } label Done {
+    return new JSSet{
+      map: *NativeContextSlot(ContextSlot::JS_SET_MAP_INDEX),
+      properties_or_hash: kEmptyFixedArray,
+      elements: kEmptyFixedArray,
+      table: resultSetData
+    };
+  }
+  unreachable;
+}
+
+// This macro creates an iterator from a collection that need to be iterated
+// (collectionToIterate), lookup each value of the iterator in a table that
+// needs to be checked (tableToLookup), and adds the value to the result
+// (resultSetData) if it exists in the table.
+macro FastIntersect<T : type extends FixedArray>(
+    implicit context: Context)(collectionToIterate: OrderedHashSet,
+    tableToLookup: T, methodName: String,
+    resultSetData: OrderedHashSet): OrderedHashSet {
+  let result = resultSetData;
+
+  let iter =
+      collections::NewUnmodifiedOrderedHashSetIterator(collectionToIterate);
+  try {
+    while (true) {
+      const nextValue = iter.Next() otherwise Done;
+
+      if (TableHasKey(tableToLookup, nextValue)) {
+        result = AddToSetTable(result, nextValue, methodName);
+      }
+    }
+  } label Done {
+    return result;
+  }
+  unreachable;
+}
+}
diff --git a/deps/v8/src/builtins/set-is-disjoint-from.tq b/deps/v8/src/builtins/set-is-disjoint-from.tq
new file mode 100644
index 00000000000000..99c9b92fd7dda5
--- /dev/null
+++ b/deps/v8/src/builtins/set-is-disjoint-from.tq
@@ -0,0 +1,161 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace collections {
+
+// https://tc39.es/proposal-set-methods/#sec-set.prototype.isdisjointfrom
+transitioning javascript builtin SetPrototypeIsDisjointFrom(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    other: JSAny): Boolean {
+  const methodName: constexpr string = 'Set.prototype.isDisjointFrom';
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 1. Let O be the this value.
+  // 2. Perform ? RequireInternalSlot(O, [[SetData]]).
+  const o = Cast<JSSet>(receiver) otherwise
+  ThrowTypeError(
+      MessageTemplate::kIncompatibleMethodReceiver, methodName, receiver);
+
+  // 3. Let otherRec be ? GetSetRecord(other).
+  let otherRec = GetSetRecord(other, methodName);
+
+  const table = Cast<OrderedHashSet>(o.table) otherwise unreachable;
+
+  // 4. Let thisSize be the number of elements in O.[[SetData]].
+  const thisSize =
+      LoadOrderedHashTableMetadata(table, kOrderedHashSetNumberOfElementsIndex);
+
+  try {
+    typeswitch (other) {
+      case (otherSet: JSSetWithNoCustomIteration): {
+        CheckSetRecordHasJSSetMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashSet>(otherSet.table) otherwise unreachable;
+
+        const otherSize = LoadOrderedHashTableMetadata(
+            otherTable, kOrderedHashSetNumberOfElementsIndex);
+
+        if (thisSize <= otherSize) {
+          return FastIsDisjointFrom<OrderedHashSet>(table, otherTable);
+        }
+
+        return FastIsDisjointFrom<OrderedHashSet>(otherTable, table);
+      }
+      case (otherMap: JSMapWithNoCustomIteration): {
+        CheckSetRecordHasJSMapMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashMap>(otherMap.table) otherwise unreachable;
+
+        const otherSize = LoadOrderedHashTableMetadata(
+            otherTable, kOrderedHashSetNumberOfElementsIndex);
+
+        if (thisSize <= otherSize) {
+          return FastIsDisjointFrom<OrderedHashMap>(table, otherTable);
+        }
+
+        // TODO(v8:13556): Change `FastIsDisjointFrom` macro to be able to
+        // handle this case as well.
+        let otherIterator =
+            collections::NewUnmodifiedOrderedHashMapIterator(otherTable);
+
+        while (true) {
+          const nextValue = otherIterator.Next() otherwise Done;
+
+          if (TableHasKey(table, nextValue.key)) {
+            return False;
+          }
+        }
+      }
+      case (JSAny): {
+        goto SlowPath;
+      }
+    }
+  } label SlowPath {
+    // 5. If thisSize ≤ otherRec.[[Size]], then
+    if (thisSize <= Convert<int32>(otherRec.size)) {
+      // a. Let index be 0.
+      let thisIter = collections::NewOrderedHashSetIterator(table);
+
+      // b. Repeat, while index < thisSize,
+      while (true) {
+        // i. Let e be O.[[SetData]][index].
+        const key = thisIter.Next() otherwise Done;
+
+        // ii. Set index to index + 1.
+        // iii. If e is not empty, then
+        //   1. Let inOther be ToBoolean(? Call(otherRec.[[Has]],
+        // otherRec.[[Set]], « e »)).
+        const inOther =
+            ToBoolean(Call(context, otherRec.has, otherRec.object, key));
+
+        //   2. If inOther is true, return false
+        if (inOther) {
+          return False;
+        }
+
+        // 3. NOTE: The number of elements in O.[[SetData]] may have increased
+        // during execution of otherRec.[[Has]].
+        // 4. Set thisSize to the number of elements of O.[[SetData]].
+        // We used iterator so we do not need to update thisSize and index.
+      }
+    } else {
+      // a. Let keysIter be ? GetKeysIterator(otherRec).
+      let keysIter =
+          GetKeysIterator(otherRec.object, UnsafeCast<Callable>(otherRec.keys));
+
+      // b. Let next be true.
+      let nextRecord: JSReceiver;
+
+      // c. Repeat, while next is not false,
+      while (true) {
+        // i. Set next to ? IteratorStep(keysIter).
+        nextRecord = iterator::IteratorStep(keysIter, fastIteratorResultMap)
+            otherwise Done;
+
+        // ii. If next is not false, then
+        // 1. Let nextValue be ? IteratorValue(next).
+        const nextValue =
+            iterator::IteratorValue(nextRecord, fastIteratorResultMap);
+
+        // 2. If SetDataHas(O.[[SetData]], nextValue) is true, then
+        if (TableHasKey(table, nextValue)) {
+          //   a. Perform ? IteratorClose(keysIter, NormalCompletion(unused)).
+          //   b. Return false.
+          iterator::IteratorClose(keysIter);
+          return False;
+        }
+      }
+    }
+  } label Done {
+    // 7. Return true.
+    return True;
+  }
+  unreachable;
+}
+
+// This macro creates an iterator from a collection that needs to be iterated
+// (collectionToIterate), lookup each value of the iterator in a table that
+// needs to be checked (tableToLookup), and return if the two collections
+// are disjoint from each other or not.
+macro FastIsDisjointFrom<T : type extends FixedArray>(
+    implicit context: Context)(collectionToIterate: OrderedHashSet,
+    tableToLookup: T): Boolean {
+  let iter =
+      collections::NewUnmodifiedOrderedHashSetIterator(collectionToIterate);
+  try {
+    while (true) {
+      const nextValue = iter.Next() otherwise Done;
+
+      if (TableHasKey(tableToLookup, nextValue)) {
+        return False;
+      }
+    }
+  } label Done {
+    return True;
+  }
+  unreachable;
+}
+}
diff --git a/deps/v8/src/builtins/set-is-subset-of.tq b/deps/v8/src/builtins/set-is-subset-of.tq
new file mode 100644
index 00000000000000..c29efe7c24794a
--- /dev/null
+++ b/deps/v8/src/builtins/set-is-subset-of.tq
@@ -0,0 +1,100 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace collections {
+
+// https://tc39.es/proposal-set-methods/#sec-set.prototype.issubsetof
+transitioning javascript builtin SetPrototypeIsSubsetOf(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    other: JSAny): Boolean {
+  const methodName: constexpr string = 'Set.prototype.isSubsetOf';
+
+  // 1. Let O be the this value.
+  // 2. Perform ? RequireInternalSlot(O, [[SetData]]).
+  const o = Cast<JSSet>(receiver) otherwise
+  ThrowTypeError(
+      MessageTemplate::kIncompatibleMethodReceiver, methodName, receiver);
+
+  // 3. Let otherRec be ? GetSetRecord(other).
+  let otherRec = GetSetRecord(other, methodName);
+
+  const table = Cast<OrderedHashSet>(o.table) otherwise unreachable;
+
+  // 4. Let thisSize be the number of elements in O.[[SetData]].
+  const thisSize =
+      LoadOrderedHashTableMetadata(table, kOrderedHashSetNumberOfElementsIndex);
+
+  // 5. If thisSize > otherRec.[[Size]], return false.
+  if (thisSize > Convert<int32>(otherRec.size)) {
+    return False;
+  }
+
+  // 6. Let index be 0.
+
+  try {
+    typeswitch (other) {
+      case (otherSet: JSSetWithNoCustomIteration): {
+        CheckSetRecordHasJSSetMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashSet>(otherSet.table) otherwise unreachable;
+
+        let thisIter = collections::NewUnmodifiedOrderedHashSetIterator(table);
+        while (true) {
+          const key = thisIter.Next() otherwise Done;
+
+          if (!TableHasKey(otherTable, key)) {
+            return False;
+          }
+        }
+      }
+      case (otherMap: JSMapWithNoCustomIteration): {
+        CheckSetRecordHasJSMapMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashMap>(otherMap.table) otherwise unreachable;
+
+        let thisIter = collections::NewUnmodifiedOrderedHashSetIterator(table);
+        while (true) {
+          const key = thisIter.Next() otherwise Done;
+
+          if (!TableHasKey(otherTable, key)) {
+            return False;
+          }
+        }
+      }
+      case (JSAny): {
+        goto SlowPath;
+      }
+    }
+  } label SlowPath {
+    // 7. Repeat, while index < thisSize,
+    let thisIter = collections::NewOrderedHashSetIterator(table);
+    while (true) {
+      // a. Let e be O.[[SetData]][index].
+      const key = thisIter.Next() otherwise Done;
+
+      // b. Set index to index + 1.
+      // c. Let inOther be ToBoolean(? Call(otherRec.[[Has]], otherRec.[[Set]],
+      // « e »)).
+      const inOther =
+          ToBoolean(Call(context, otherRec.has, otherRec.object, key));
+
+      // d. If inOther is false, return false.
+      if (!inOther) {
+        return False;
+      }
+      // e. NOTE: The number of elements in O.[[SetData]] may have increased
+      // during execution of otherRec.[[Has]].
+      // f. Set thisSize to the number of elements of O.[[SetData]].
+      // We have used `collections::NewOrderedHashSetIterator` which allows
+      // changes on the table.
+    }
+  } label Done {
+    // 8. Return true.
+    return True;
+  }
+  unreachable;
+}
+}
diff --git a/deps/v8/src/builtins/set-is-superset-of.tq b/deps/v8/src/builtins/set-is-superset-of.tq
new file mode 100644
index 00000000000000..50e47e5767651a
--- /dev/null
+++ b/deps/v8/src/builtins/set-is-superset-of.tq
@@ -0,0 +1,104 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace collections {
+
+// https://tc39.es/proposal-set-methods/#sec-set.prototype.issupersetof
+transitioning javascript builtin SetPrototypeIsSupersetOf(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    other: JSAny): Boolean {
+  const methodName: constexpr string = 'Set.prototype.isSupersetOf';
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 1. Let O be the this value.
+  // 2. Perform ? RequireInternalSlot(O, [[SetData]]).
+  const o = Cast<JSSet>(receiver) otherwise
+  ThrowTypeError(
+      MessageTemplate::kIncompatibleMethodReceiver, methodName, receiver);
+
+  // 3. Let otherRec be ? GetSetRecord(other).
+  let otherRec = GetSetRecord(other, methodName);
+
+  const table = Cast<OrderedHashSet>(o.table) otherwise unreachable;
+
+  // 4. Let thisSize be the number of elements in O.[[SetData]].
+  const thisSize =
+      LoadOrderedHashTableMetadata(table, kOrderedHashSetNumberOfElementsIndex);
+
+  // 5. If thisSize < otherRec.[[Size]], return false.
+  if (thisSize < Convert<int32>(otherRec.size)) {
+    return False;
+  }
+
+  try {
+    typeswitch (other) {
+      case (otherSet: JSSetWithNoCustomIteration): {
+        CheckSetRecordHasJSSetMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashSet>(otherSet.table) otherwise unreachable;
+
+        let iter = collections::NewUnmodifiedOrderedHashSetIterator(otherTable);
+
+        while (true) {
+          const nextValue = iter.Next() otherwise Done;
+
+          if (!TableHasKey(table, nextValue)) {
+            return False;
+          }
+        }
+      }
+      case (otherMap: JSMapWithNoCustomIteration): {
+        CheckSetRecordHasJSMapMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashMap>(otherMap.table) otherwise unreachable;
+
+        let iter = collections::NewUnmodifiedOrderedHashMapIterator(otherTable);
+
+        while (true) {
+          const nextValue = iter.Next() otherwise Done;
+
+          if (!TableHasKey(table, nextValue.key)) {
+            return False;
+          }
+        }
+      }
+      case (JSAny): {
+        goto SlowPath;
+      }
+    }
+  } label SlowPath {
+    // 6. Let keysIter be ? GetKeysIterator(otherRec).
+    let keysIter =
+        GetKeysIterator(otherRec.object, UnsafeCast<Callable>(otherRec.keys));
+
+    // 7. Let next be true.
+    let nextRecord: JSReceiver;
+
+    // 8. Repeat, while next is not false,
+    while (true) {
+      //   a. Set next to ? IteratorStep(keysIter).
+      nextRecord = iterator::IteratorStep(keysIter, fastIteratorResultMap)
+          otherwise Done;
+      //   b. If next is not false, then
+      //      i. Let nextValue be ? IteratorValue(next).
+      const nextValue =
+          iterator::IteratorValue(nextRecord, fastIteratorResultMap);
+      //      ii. If SetDataHas(O.[[SetData]], nextValue) is false, then
+      if (!TableHasKey(table, nextValue)) {
+        //          1. Perform ? IteratorClose(keysIter,
+        //          NormalCompletion(unused)).
+        //          2. Return false.
+        iterator::IteratorClose(keysIter);
+        return False;
+      }
+    }
+  } label Done {
+    // 9. Return true.
+    return True;
+  }
+  unreachable;
+}
+}
diff --git a/deps/v8/src/builtins/set-symmetric-difference.tq b/deps/v8/src/builtins/set-symmetric-difference.tq
new file mode 100644
index 00000000000000..6427012e1ad6ee
--- /dev/null
+++ b/deps/v8/src/builtins/set-symmetric-difference.tq
@@ -0,0 +1,166 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace collections {
+
+// https://tc39.es/proposal-set-methods/#sec-set.prototype.symmetricdifference
+transitioning javascript builtin SetPrototypeSymmetricDifference(
+    js-implicit context: NativeContext, receiver: JSAny)(other: JSAny): JSSet {
+  const methodName: constexpr string = 'Set.prototype.symmetricDifference';
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 1. Let O be the this value.
+  // 2. Perform ? RequireInternalSlot(O, [[SetData]]).
+  const o = Cast<JSSet>(receiver) otherwise
+  ThrowTypeError(
+      MessageTemplate::kIncompatibleMethodReceiver, methodName, receiver);
+
+  // 3. Let otherRec be ? GetSetRecord(other).
+  let otherRec = GetSetRecord(other, methodName);
+
+  const table = Cast<OrderedHashSet>(o.table) otherwise unreachable;
+
+  // 4. Let keysIter be ? GetKeysIterator(otherRec).
+  let keysIter =
+      GetKeysIterator(otherRec.object, UnsafeCast<Callable>(otherRec.keys));
+
+  // 5. Let resultSetData be a copy of O.[[SetData]].
+  const resultSetData = Cast<OrderedHashSet>(CloneFixedArray(
+      table, ExtractFixedArrayFlag::kFixedArrays)) otherwise unreachable;
+  let resultAndNumberOfElements = OrderedHashSetAndNumberOfElements{
+    setData: resultSetData,
+    numberOfElements: UnsafeCast<Smi>(
+        resultSetData.objects[kOrderedHashSetNumberOfElementsIndex])
+  };
+
+  try {
+    typeswitch (other) {
+      case (otherSet: JSSetWithNoCustomIteration): {
+        CheckSetRecordHasJSSetMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashSet>(otherSet.table) otherwise unreachable;
+
+        let otherIterator =
+            collections::NewUnmodifiedOrderedHashSetIterator(otherTable);
+
+        while (true) {
+          const nextValue = otherIterator.Next() otherwise Done;
+
+          resultAndNumberOfElements = FastSymmetricDifference(
+              nextValue, table, resultAndNumberOfElements, methodName);
+        }
+      }
+      case (otherMap: JSMapWithNoCustomIteration): {
+        CheckSetRecordHasJSMapMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashMap>(otherMap.table) otherwise unreachable;
+
+        let otherIterator =
+            collections::NewUnmodifiedOrderedHashMapIterator(otherTable);
+
+        while (true) {
+          const nextValue = otherIterator.Next() otherwise Done;
+
+          resultAndNumberOfElements = FastSymmetricDifference(
+              nextValue.key, table, resultAndNumberOfElements, methodName);
+        }
+      }
+      case (JSAny): {
+        goto SlowPath;
+      }
+    }
+  } label SlowPath {
+    // 6. Let next be true.
+    let nextRecord: JSReceiver;
+    // 7. Repeat, while next is not false,
+    while (true) {
+      //  a. Set next to ? IteratorStep(keysIter).
+      nextRecord = iterator::IteratorStep(keysIter, fastIteratorResultMap)
+          otherwise Done;
+
+      //  b. If next is not false, then
+      //      i. Let nextValue be ? IteratorValue(next).
+      let nextValue =
+          iterator::IteratorValue(nextRecord, fastIteratorResultMap);
+
+      //      ii. If nextValue is -0𝔽, set nextValue to +0𝔽.
+      nextValue = collections::NormalizeNumberKey(nextValue);
+
+      //      iii. Let inResult be SetDataHas(resultSetData, nextValue).
+      const inResult =
+          TableHasKey(resultAndNumberOfElements.setData, nextValue);
+
+      //      iv. If SetDataHas(O.[[SetData]], nextValue) is true, then
+      if (TableHasKey(table, nextValue)) {
+        //  1. If inResult is true, remove nextValue from resultSetData.
+        if (inResult) {
+          resultAndNumberOfElements.numberOfElements =
+              DeleteFromSetTable(resultAndNumberOfElements.setData, nextValue)
+              otherwise unreachable;
+        }
+      } else {
+        // v. Else,
+        //    1. If inResult is false, append nextValue to resultSetData.
+        if (!inResult) {
+          resultAndNumberOfElements.setData = AddToSetTable(
+              resultAndNumberOfElements.setData, nextValue, methodName);
+          resultAndNumberOfElements.numberOfElements++;
+        }
+      }
+    }
+  } label Done {
+    const shrunk = ShrinkOrderedHashSetIfNeeded(
+        resultAndNumberOfElements.numberOfElements,
+        resultAndNumberOfElements.setData);
+    return new JSSet{
+      map: *NativeContextSlot(ContextSlot::JS_SET_MAP_INDEX),
+      properties_or_hash: kEmptyFixedArray,
+      elements: kEmptyFixedArray,
+      table: shrunk
+    };
+  }
+  unreachable;
+}
+
+// This macro gets the nextValue in other table and normalize it. If the
+// nextValue exists in the receiver table, it will be removed. Otherwise
+// it will be added to the resultSetData.
+struct OrderedHashSetAndNumberOfElements {
+  setData: OrderedHashSet;
+  numberOfElements: Smi;
+}
+macro FastSymmetricDifference(
+    implicit context: Context)(nextValue: JSAny, table: OrderedHashSet,
+    resultSetDataAndNumberOfElements: OrderedHashSetAndNumberOfElements,
+    methodName: constexpr string): OrderedHashSetAndNumberOfElements {
+  let key = nextValue;
+  let resultSetData = resultSetDataAndNumberOfElements.setData;
+  let numberOfElements = resultSetDataAndNumberOfElements.numberOfElements;
+
+  // ii. If nextValue is -0𝔽, set nextValue to +0𝔽.
+  key = collections::NormalizeNumberKey(key);
+
+  // iii. Let inResult be SetDataHas(resultSetData, nextValue).
+  const inResult = TableHasKey(resultSetData, key);
+
+  // iv. If SetDataHas(O.[[SetData]], nextValue) is true, then
+  dcheck(inResult == TableHasKey(table, key));
+  //  1. If inResult is true, remove nextValue from resultSetData.
+  if (inResult) {
+    numberOfElements = DeleteFromSetTable(resultSetData, key)
+        otherwise unreachable;
+  } else {
+    // v. Else,
+    //  1. If inResult is false, append nextValue to resultSetData.
+    resultSetData = AddToSetTable(resultSetData, key, methodName);
+    numberOfElements++;
+  }
+  return OrderedHashSetAndNumberOfElements{
+    setData: resultSetData,
+    numberOfElements: numberOfElements
+  };
+}
+}
diff --git a/deps/v8/src/builtins/set-union.tq b/deps/v8/src/builtins/set-union.tq
new file mode 100644
index 00000000000000..e81859c089ac0d
--- /dev/null
+++ b/deps/v8/src/builtins/set-union.tq
@@ -0,0 +1,100 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace collections {
+
+// https://tc39.es/proposal-set-methods/#sec-set.prototype.union
+transitioning javascript builtin SetPrototypeUnion(
+    js-implicit context: NativeContext, receiver: JSAny)(other: JSAny): JSSet {
+  const methodName: constexpr string = 'Set.prototype.union';
+  const fastIteratorResultMap = GetIteratorResultMap();
+
+  // 1. Let O be the this value.
+  // 2. Perform ? RequireInternalSlot(O, [[SetData]]).
+  const o = Cast<JSSet>(receiver) otherwise
+  ThrowTypeError(
+      MessageTemplate::kIncompatibleMethodReceiver, methodName, receiver);
+
+  // 3. Let otherRec be ? GetSetRecord(other).
+  let otherRec = GetSetRecord(other, methodName);
+
+  const table = Cast<OrderedHashSet>(o.table) otherwise unreachable;
+
+  // 5. Let resultSetData be a copy of O.[[SetData]].
+  let resultSetData = Cast<OrderedHashSet>(CloneFixedArray(
+      table, ExtractFixedArrayFlag::kFixedArrays)) otherwise unreachable;
+
+  try {
+    typeswitch (other) {
+      case (otherSet: JSSetWithNoCustomIteration): {
+        CheckSetRecordHasJSSetMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashSet>(otherSet.table) otherwise unreachable;
+
+        let otherIterator =
+            collections::NewUnmodifiedOrderedHashSetIterator(otherTable);
+
+        while (true) {
+          const nextValue = otherIterator.Next() otherwise Done;
+          resultSetData = AddToSetTable(resultSetData, nextValue, methodName);
+        }
+      }
+      case (otherMap: JSMapWithNoCustomIteration): {
+        CheckSetRecordHasJSMapMethods(otherRec) otherwise SlowPath;
+
+        const otherTable =
+            Cast<OrderedHashMap>(otherMap.table) otherwise unreachable;
+
+        let otherIterator =
+            collections::NewUnmodifiedOrderedHashMapIterator(otherTable);
+
+        while (true) {
+          const nextValue = otherIterator.Next() otherwise Done;
+          resultSetData =
+              AddToSetTable(resultSetData, nextValue.key, methodName);
+        }
+      }
+      case (JSAny): {
+        goto SlowPath;
+      }
+    }
+  } label SlowPath {
+    // 4. Let keysIter be ? GetKeysIterator(otherRec).
+    let keysIter =
+        GetKeysIterator(otherRec.object, UnsafeCast<Callable>(otherRec.keys));
+
+    // 6. Let next be true.
+    let nextRecord: JSReceiver;
+    // 7. Repeat, while next is not false,
+    while (true) {
+      //  a. Set next to ? IteratorStep(keysIter).
+      nextRecord = iterator::IteratorStep(keysIter, fastIteratorResultMap)
+          otherwise Done;
+
+      //  b. If next is not false, then
+      //      i. Let nextValue be ? IteratorValue(next).
+      const nextValue =
+          iterator::IteratorValue(nextRecord, fastIteratorResultMap);
+
+      //      ii. If nextValue is -0𝔽, set nextValue to +0𝔽.
+      //      iii. If SetDataHas(resultSetData, nextValue) is false, then
+      //          1. Append nextValue to resultSetData.
+      resultSetData = AddToSetTable(resultSetData, nextValue, methodName);
+    }
+  } label Done {
+    // 8. Let result be
+    // OrdinaryObjectCreate(%Set.prototype%, « [[SetData]]»).
+    // 9. Set result.[[SetData]] to resultSetData.
+    // 10. Return result.
+    return new JSSet{
+      map: *NativeContextSlot(ContextSlot::JS_SET_MAP_INDEX),
+      properties_or_hash: kEmptyFixedArray,
+      elements: kEmptyFixedArray,
+      table: resultSetData
+    };
+  }
+  unreachable;
+}
+}
diff --git a/deps/v8/src/builtins/setup-builtins-internal.cc b/deps/v8/src/builtins/setup-builtins-internal.cc
index ca7b4ca57cd6d4..3010364d5017d2 100644
--- a/deps/v8/src/builtins/setup-builtins-internal.cc
+++ b/deps/v8/src/builtins/setup-builtins-internal.cc
@@ -2,12 +2,15 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include <fstream>
+
 #include "src/builtins/builtins.h"
 #include "src/builtins/profile-data-reader.h"
 #include "src/codegen/assembler-inl.h"
 #include "src/codegen/interface-descriptors.h"
 #include "src/codegen/macro-assembler-inl.h"
 #include "src/codegen/macro-assembler.h"
+#include "src/codegen/reloc-info-inl.h"
 #include "src/compiler/code-assembler.h"
 #include "src/execution/isolate.h"
 #include "src/handles/handles-inl.h"
@@ -78,7 +81,7 @@ using CodeAssemblerGenerator = void (*)(compiler::CodeAssemblerState*);
 
 Handle<Code> BuildPlaceholder(Isolate* isolate, Builtin builtin) {
   HandleScope scope(isolate);
-  byte buffer[kBufferSize];
+  uint8_t buffer[kBufferSize];
   MacroAssembler masm(isolate, CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, kBufferSize));
   DCHECK(!masm.has_frame());
@@ -98,14 +101,11 @@ Handle<Code> BuildPlaceholder(Isolate* isolate, Builtin builtin) {
   return scope.CloseAndEscape(code);
 }
 
-Code BuildWithMacroAssembler(Isolate* isolate, Builtin builtin,
-                             MacroAssemblerGenerator generator,
-                             const char* s_name) {
+Tagged<Code> BuildWithMacroAssembler(Isolate* isolate, Builtin builtin,
+                                     MacroAssemblerGenerator generator,
+                                     const char* s_name) {
   HandleScope scope(isolate);
-  // Canonicalize handles, so that we can share constant pool entries pointing
-  // to code targets without dereferencing their handles.
-  CanonicalHandleScope canonical(isolate);
-  byte buffer[kBufferSize];
+  uint8_t buffer[kBufferSize];
 
   MacroAssembler masm(isolate, BuiltinAssemblerOptions(isolate, builtin),
                       CodeObjectRequired::kYes,
@@ -126,10 +126,18 @@ Code BuildWithMacroAssembler(Isolate* isolate, Builtin builtin,
     HandlerTable::EmitReturnEntry(
         &masm, 0, isolate->builtins()->js_entry_handler_offset());
   }
+#if V8_ENABLE_WEBASSEMBLY && (V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_ARM64)
+  // TODO(v8:12191): Enable on all platforms once the builtin has been ported.
+  if (builtin == Builtin::kWasmReturnPromiseOnSuspendAsm) {
+    handler_table_offset = HandlerTable::EmitReturnTableStart(&masm);
+    HandlerTable::EmitReturnEntry(
+        &masm, 0, isolate->builtins()->jspi_prompt_handler_offset());
+  }
+#endif
 
   CodeDesc desc;
-  masm.GetCode(isolate, &desc, MacroAssembler::kNoSafepointTable,
-               handler_table_offset);
+  masm.GetCode(isolate->main_thread_local_isolate(), &desc,
+               MacroAssembler::kNoSafepointTable, handler_table_offset);
 
   Handle<Code> code = Factory::CodeBuilder(isolate, desc, CodeKind::BUILTIN)
                           .set_self_reference(masm.CodeObject())
@@ -141,13 +149,10 @@ Code BuildWithMacroAssembler(Isolate* isolate, Builtin builtin,
   return *code;
 }
 
-Code BuildAdaptor(Isolate* isolate, Builtin builtin, Address builtin_address,
-                  const char* name) {
+Tagged<Code> BuildAdaptor(Isolate* isolate, Builtin builtin,
+                          Address builtin_address, const char* name) {
   HandleScope scope(isolate);
-  // Canonicalize handles, so that we can share constant pool entries pointing
-  // to code targets without dereferencing their handles.
-  CanonicalHandleScope canonical(isolate);
-  byte buffer[kBufferSize];
+  uint8_t buffer[kBufferSize];
   MacroAssembler masm(isolate, BuiltinAssemblerOptions(isolate, builtin),
                       CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, kBufferSize));
@@ -164,13 +169,10 @@ Code BuildAdaptor(Isolate* isolate, Builtin builtin, Address builtin_address,
 }
 
 // Builder for builtins implemented in TurboFan with JS linkage.
-Code BuildWithCodeStubAssemblerJS(Isolate* isolate, Builtin builtin,
-                                  CodeAssemblerGenerator generator, int argc,
-                                  const char* name) {
+Tagged<Code> BuildWithCodeStubAssemblerJS(Isolate* isolate, Builtin builtin,
+                                          CodeAssemblerGenerator generator,
+                                          int argc, const char* name) {
   HandleScope scope(isolate);
-  // Canonicalize handles, so that we can share constant pool entries pointing
-  // to code targets without dereferencing their handles.
-  CanonicalHandleScope canonical(isolate);
 
   Zone zone(isolate->allocator(), ZONE_NAME, kCompressGraphZone);
   compiler::CodeAssemblerState state(isolate, &zone, argc, CodeKind::BUILTIN,
@@ -183,14 +185,10 @@ Code BuildWithCodeStubAssemblerJS(Isolate* isolate, Builtin builtin,
 }
 
 // Builder for builtins implemented in TurboFan with CallStub linkage.
-Code BuildWithCodeStubAssemblerCS(Isolate* isolate, Builtin builtin,
-                                  CodeAssemblerGenerator generator,
-                                  CallDescriptors::Key interface_descriptor,
-                                  const char* name) {
+Tagged<Code> BuildWithCodeStubAssemblerCS(
+    Isolate* isolate, Builtin builtin, CodeAssemblerGenerator generator,
+    CallDescriptors::Key interface_descriptor, const char* name) {
   HandleScope scope(isolate);
-  // Canonicalize handles, so that we can share constant pool entries pointing
-  // to code targets without dereferencing their handles.
-  CanonicalHandleScope canonical(isolate);
   Zone zone(isolate->allocator(), ZONE_NAME, kCompressGraphZone);
   // The interface descriptor with given key must be initialized at this point
   // and this construction just queries the details from the descriptors table.
@@ -210,8 +208,8 @@ Code BuildWithCodeStubAssemblerCS(Isolate* isolate, Builtin builtin,
 
 // static
 void SetupIsolateDelegate::AddBuiltin(Builtins* builtins, Builtin builtin,
-                                      Code code) {
-  DCHECK_EQ(builtin, code.builtin_id());
+                                      Tagged<Code> code) {
+  DCHECK_EQ(builtin, code->builtin_id());
   builtins->set_code(builtin, code);
 }
 
@@ -234,7 +232,6 @@ void SetupIsolateDelegate::ReplacePlaceholders(Isolate* isolate) {
   // Replace references from all builtin code objects to placeholders.
   Builtins* builtins = isolate->builtins();
   DisallowGarbageCollection no_gc;
-  CodePageCollectionMemoryModificationScope modification_scope(isolate->heap());
   static const int kRelocMask =
       RelocInfo::ModeMask(RelocInfo::CODE_TARGET) |
       RelocInfo::ModeMask(RelocInfo::FULL_EMBEDDED_OBJECT) |
@@ -243,44 +240,46 @@ void SetupIsolateDelegate::ReplacePlaceholders(Isolate* isolate) {
   PtrComprCageBase cage_base(isolate);
   for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
        ++builtin) {
-    Code code = builtins->code(builtin);
-    isolate->heap()->UnprotectAndRegisterMemoryChunk(
-        code, UnprotectMemoryOrigin::kMainThread);
+    Tagged<Code> code = builtins->code(builtin);
+    Tagged<InstructionStream> istream = code->instruction_stream();
+    CodePageMemoryModificationScope code_modification_scope(istream);
     bool flush_icache = false;
     for (RelocIterator it(code, kRelocMask); !it.done(); it.next()) {
       RelocInfo* rinfo = it.rinfo();
       if (RelocInfo::IsCodeTargetMode(rinfo->rmode())) {
-        Code target_code = Code::FromTargetAddress(rinfo->target_address());
+        Tagged<Code> target_code =
+            Code::FromTargetAddress(rinfo->target_address());
         DCHECK_IMPLIES(
             RelocInfo::IsRelativeCodeTarget(rinfo->rmode()),
-            Builtins::IsIsolateIndependent(target_code.builtin_id()));
-        if (!target_code.is_builtin()) continue;
-        Code new_target = builtins->code(target_code.builtin_id());
-        rinfo->set_target_address(new_target.InstructionStart(),
+            Builtins::IsIsolateIndependent(target_code->builtin_id()));
+        if (!target_code->is_builtin()) continue;
+        Tagged<Code> new_target = builtins->code(target_code->builtin_id());
+        rinfo->set_target_address(istream, new_target->instruction_start(),
                                   UPDATE_WRITE_BARRIER, SKIP_ICACHE_FLUSH);
       } else {
         DCHECK(RelocInfo::IsEmbeddedObjectMode(rinfo->rmode()));
-        Object object = rinfo->target_object(cage_base);
-        if (!object.IsCode(cage_base)) continue;
-        Code target = Code::cast(object);
-        if (!target.is_builtin()) continue;
-        Code new_target = builtins->code(target.builtin_id());
-        rinfo->set_target_object(isolate->heap(), new_target,
-                                 UPDATE_WRITE_BARRIER, SKIP_ICACHE_FLUSH);
+        Tagged<Object> object = rinfo->target_object(cage_base);
+        if (!IsCode(object, cage_base)) continue;
+        Tagged<Code> target = Code::cast(object);
+        if (!target->is_builtin()) continue;
+        Tagged<Code> new_target = builtins->code(target->builtin_id());
+        rinfo->set_target_object(istream, new_target, UPDATE_WRITE_BARRIER,
+                                 SKIP_ICACHE_FLUSH);
       }
       flush_icache = true;
     }
     if (flush_icache) {
-      FlushInstructionCache(code.InstructionStart(), code.instruction_size());
+      FlushInstructionCache(code->instruction_start(),
+                            code->instruction_size());
     }
   }
 }
 
 namespace {
 
-Code GenerateBytecodeHandler(Isolate* isolate, Builtin builtin,
-                             interpreter::OperandScale operand_scale,
-                             interpreter::Bytecode bytecode) {
+Tagged<Code> GenerateBytecodeHandler(Isolate* isolate, Builtin builtin,
+                                     interpreter::OperandScale operand_scale,
+                                     interpreter::Bytecode bytecode) {
   DCHECK(interpreter::Bytecodes::BytecodeHasHandler(bytecode, operand_scale));
   Handle<Code> code = interpreter::GenerateBytecodeHandler(
       isolate, Builtins::name(builtin), bytecode, operand_scale, builtin,
@@ -295,13 +294,18 @@ void SetupIsolateDelegate::SetupBuiltinsInternal(Isolate* isolate) {
   Builtins* builtins = isolate->builtins();
   DCHECK(!builtins->initialized_);
 
+  if (v8_flags.dump_builtins_hashes_to_file) {
+    // Create an empty file.
+    std::ofstream(v8_flags.dump_builtins_hashes_to_file, std::ios_base::trunc);
+  }
+
   PopulateWithPlaceholders(isolate);
 
   // Create a scope for the handles in the builtins.
   HandleScope scope(isolate);
 
   int index = 0;
-  Code code;
+  Tagged<Code> code;
 #define BUILD_CPP(Name)                                      \
   code = BuildAdaptor(isolate, Builtin::k##Name,             \
                       FUNCTION_ADDR(Builtin_##Name), #Name); \
@@ -364,12 +368,6 @@ void SetupIsolateDelegate::SetupBuiltinsInternal(Isolate* isolate) {
 
   ReplacePlaceholders(isolate);
 
-#define SET_PROMISE_REJECTION_PREDICTION(Name) \
-  builtins->code(Builtin::k##Name).set_is_promise_rejection(true);
-
-  BUILTIN_PROMISE_REJECTION_PREDICTION_LIST(SET_PROMISE_REJECTION_PREDICTION)
-#undef SET_PROMISE_REJECTION_PREDICTION
-
   builtins->MarkInitialized();
 }
 
diff --git a/deps/v8/src/builtins/string-endswith.tq b/deps/v8/src/builtins/string-endswith.tq
index 42e3f6fe4b8d8b..866fdea6f34cd0 100644
--- a/deps/v8/src/builtins/string-endswith.tq
+++ b/deps/v8/src/builtins/string-endswith.tq
@@ -39,8 +39,8 @@ macro IsSubstringAt(string: String, searchStr: String, start: intptr): bool {
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.endswith
 transitioning javascript builtin StringPrototypeEndsWith(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(...arguments): Boolean {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): Boolean {
   const searchString: JSAny = arguments[0];
   const endPosition: JSAny = arguments[1];
   const kBuiltinName: constexpr string = 'String.prototype.endsWith';
diff --git a/deps/v8/src/builtins/string-html.tq b/deps/v8/src/builtins/string-html.tq
index 8b3e01342eaad1..cccb396a840a6e 100644
--- a/deps/v8/src/builtins/string-html.tq
+++ b/deps/v8/src/builtins/string-html.tq
@@ -6,9 +6,9 @@ namespace string {
 extern runtime StringEscapeQuotes(Context, String): String;
 
 // https://tc39.github.io/ecma262/#sec-createhtml
-transitioning builtin CreateHTML(implicit context: Context)(
-    receiver: JSAny, methodName: String, tagName: String, attr: String,
-    attrValue: JSAny): String {
+transitioning builtin CreateHTML(
+    implicit context: Context)(receiver: JSAny, methodName: String,
+    tagName: String, attr: String, attrValue: JSAny): String {
   const tagContents: String = ToThisString(receiver, methodName);
   let result = '<' + tagName;
   if (attr != kEmptyString) {
@@ -22,104 +22,105 @@ transitioning builtin CreateHTML(implicit context: Context)(
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.anchor
 transitioning javascript builtin StringPrototypeAnchor(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.anchor', 'a', 'name', arguments[0]);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.big
-transitioning javascript builtin
-StringPrototypeBig(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeBig(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.big', 'big', kEmptyString, kEmptyString);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.blink
-transitioning javascript builtin
-StringPrototypeBlink(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeBlink(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.blink', 'blink', kEmptyString, kEmptyString);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.bold
-transitioning javascript builtin
-StringPrototypeBold(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeBold(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.bold', 'b', kEmptyString, kEmptyString);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.fontcolor
-transitioning javascript builtin
-StringPrototypeFontcolor(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeFontcolor(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.fontcolor', 'font', 'color', arguments[0]);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.fontsize
-transitioning javascript builtin
-StringPrototypeFontsize(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeFontsize(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.fontsize', 'font', 'size', arguments[0]);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.fixed
-transitioning javascript builtin
-StringPrototypeFixed(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeFixed(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.fixed', 'tt', kEmptyString, kEmptyString);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.italics
-transitioning javascript builtin
-StringPrototypeItalics(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeItalics(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.italics', 'i', kEmptyString, kEmptyString);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.link
-transitioning javascript builtin
-StringPrototypeLink(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeLink(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.link', 'a', 'href', arguments[0]);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.small
-transitioning javascript builtin
-StringPrototypeSmall(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeSmall(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.small', 'small', kEmptyString, kEmptyString);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.strike
-transitioning javascript builtin
-StringPrototypeStrike(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeStrike(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.strike', 'strike', kEmptyString,
       kEmptyString);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.sub
-transitioning javascript builtin
-StringPrototypeSub(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeSub(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.sub', 'sub', kEmptyString, kEmptyString);
 }
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.sup
-transitioning javascript builtin
-StringPrototypeSup(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeSup(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   return CreateHTML(
       receiver, 'String.prototype.sup', 'sup', kEmptyString, kEmptyString);
 }
diff --git a/deps/v8/src/builtins/string-includes.tq b/deps/v8/src/builtins/string-includes.tq
index 7da7aa7e6d1e5c..ed0bd0bdb17a75 100644
--- a/deps/v8/src/builtins/string-includes.tq
+++ b/deps/v8/src/builtins/string-includes.tq
@@ -7,8 +7,8 @@
 namespace string {
 
 // https://tc39.es/ecma262/#sec-string.prototype.includes
-transitioning javascript builtin
-StringPrototypeIncludes(js-implicit context: NativeContext, receiver: JSAny)(
+transitioning javascript builtin StringPrototypeIncludes(
+    js-implicit context: NativeContext, receiver: JSAny)(
     ...arguments): Boolean {
   const methodName: constexpr string = 'String.prototype.includes';
   const searchString: JSAny = arguments[0];
diff --git a/deps/v8/src/builtins/string-indexof.tq b/deps/v8/src/builtins/string-indexof.tq
index f649d1d15eddea..1d57409610c68b 100644
--- a/deps/v8/src/builtins/string-indexof.tq
+++ b/deps/v8/src/builtins/string-indexof.tq
@@ -7,8 +7,7 @@
 namespace string {
 
 // https://tc39.es/ecma262/#sec-string.prototype.indexof
-transitioning javascript builtin
-StringPrototypeIndexOf(
+transitioning javascript builtin StringPrototypeIndexOf(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): Smi {
   const methodName: constexpr string = 'String.prototype.indexOf';
   const searchString: JSAny = arguments[0];
diff --git a/deps/v8/src/builtins/string-iswellformed.tq b/deps/v8/src/builtins/string-iswellformed.tq
index 9eebf8fbff3a3e..1060643d4dfc8e 100644
--- a/deps/v8/src/builtins/string-iswellformed.tq
+++ b/deps/v8/src/builtins/string-iswellformed.tq
@@ -13,10 +13,9 @@ namespace string {
 extern macro StringBuiltinsAssembler::HasUnpairedSurrogate(String):
     bool labels Indirect;
 
-transitioning javascript builtin
-StringPrototypeIsWellFormed(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(...arguments): Boolean {
+transitioning javascript builtin StringPrototypeIsWellFormed(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): Boolean {
   const methodName: constexpr string = 'String.prototype.isWellFormed';
 
   // 1. Let O be ? RequireObjectCoercible(this value).
@@ -27,9 +26,7 @@ StringPrototypeIsWellFormed(
 
   // Fast path: one-byte strings cannot have unpaired surrogates and are
   // definitionally well-formed.
-  //
-  // See note in String::IsWellFormedUnicode.
-  if (s.IsOneByteRepresentation()) return True;
+  if (s.StringInstanceType().is_one_byte) return True;
 
   // Slow path: flatten the string and look for unpaired surrogates.
   //
diff --git a/deps/v8/src/builtins/string-iterator.tq b/deps/v8/src/builtins/string-iterator.tq
index eea7a621f0f8ae..6a0cc5af1a6e54 100644
--- a/deps/v8/src/builtins/string-iterator.tq
+++ b/deps/v8/src/builtins/string-iterator.tq
@@ -4,8 +4,9 @@
 
 namespace string {
 
-macro NewJSStringIterator(implicit context: Context)(
-    string: String, nextIndex: Smi): JSStringIterator {
+macro NewJSStringIterator(
+    implicit context: Context)(string: String,
+    nextIndex: Smi): JSStringIterator {
   return new JSStringIterator{
     map: GetInitialStringIteratorMap(),
     properties_or_hash: kEmptyFixedArray,
diff --git a/deps/v8/src/builtins/string-match-search.tq b/deps/v8/src/builtins/string-match-search.tq
index 18dcf1b812cb01..6b26e2e3995ab4 100644
--- a/deps/v8/src/builtins/string-match-search.tq
+++ b/deps/v8/src/builtins/string-match-search.tq
@@ -8,11 +8,12 @@ struct StringMatchFunctor {
   macro FnSymbol(): Symbol {
     return MatchSymbolConstant();
   }
-  macro CanCallFast(implicit context: Context)(maybeRegExp: HeapObject): bool {
+  macro CanCallFast(implicit context: Context)(maybeRegExp: HeapObject):
+      bool {
     return regexp::IsFastRegExpForMatch(maybeRegExp);
   }
-  transitioning macro CallFast(implicit context: Context)(
-      regexp: FastJSRegExp, string: String): JSAny {
+  transitioning macro CallFast(
+      implicit context: Context)(regexp: FastJSRegExp, string: String): JSAny {
     return regexp::RegExpMatchFast(regexp, string);
   }
 }
@@ -21,18 +22,19 @@ struct StringSearchFunctor {
   macro FnSymbol(): Symbol {
     return SearchSymbolConstant();
   }
-  macro CanCallFast(implicit context: Context)(maybeRegExp: HeapObject): bool {
+  macro CanCallFast(implicit context: Context)(maybeRegExp: HeapObject):
+      bool {
     return regexp::IsFastRegExpForSearch(maybeRegExp);
   }
-  transitioning macro CallFast(implicit context: Context)(
-      regexp: FastJSRegExp, string: String): JSAny {
+  transitioning macro CallFast(
+      implicit context: Context)(regexp: FastJSRegExp, string: String): JSAny {
     return regexp::RegExpSearchFast(regexp, string);
   }
 }
 
 transitioning macro StringMatchSearch<F: type>(
-    implicit context: NativeContext, receiver: JSAny)(
-    regexp: JSAny, functor: F, methodName: constexpr string): JSAny {
+    implicit context: NativeContext, receiver: JSAny)(regexp: JSAny,
+    functor: F, methodName: constexpr string): JSAny {
   // 1. Let O be ? RequireObjectCoercible(this value).
   RequireObjectCoercible(receiver, methodName);
 
@@ -69,17 +71,17 @@ transitioning macro StringMatchSearch<F: type>(
 }
 
 // https://tc39.es/ecma262/#sec-string.prototype.match
-transitioning javascript builtin
-StringPrototypeMatch(
-    js-implicit context: NativeContext, receiver: JSAny)(regexp: JSAny): JSAny {
+transitioning javascript builtin StringPrototypeMatch(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    regexp: JSAny): JSAny {
   return StringMatchSearch(
       regexp, StringMatchFunctor{}, 'String.prototype.match');
 }
 
 // https://tc39.es/ecma262/#sec-string.prototype.search
-transitioning javascript builtin
-StringPrototypeSearch(
-    js-implicit context: NativeContext, receiver: JSAny)(regexp: JSAny): JSAny {
+transitioning javascript builtin StringPrototypeSearch(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    regexp: JSAny): JSAny {
   return StringMatchSearch(
       regexp, StringSearchFunctor{}, 'String.prototype.search');
 }
diff --git a/deps/v8/src/builtins/string-pad.tq b/deps/v8/src/builtins/string-pad.tq
index 6812a32b7d73a9..6344a08bdcbd5f 100644
--- a/deps/v8/src/builtins/string-pad.tq
+++ b/deps/v8/src/builtins/string-pad.tq
@@ -6,15 +6,15 @@
 
 namespace string {
 
-extern transitioning builtin
-StringSubstring(implicit context: Context)(String, intptr, intptr): String;
+extern transitioning builtin StringSubstring(
+    implicit context: Context)(String, intptr, intptr): String;
 
 const kStringPadStart: constexpr int31 = 0;
 const kStringPadEnd: constexpr int31 = 1;
 
-transitioning macro StringPad(implicit context: Context)(
-    receiver: JSAny, arguments: Arguments, methodName: constexpr string,
-    variant: constexpr int31): String {
+transitioning macro StringPad(
+    implicit context: Context)(receiver: JSAny, arguments: Arguments,
+    methodName: constexpr string, variant: constexpr int31): String {
   const receiverString: String = ToThisString(receiver, methodName);
   const stringLength: Smi = receiverString.length_smi;
 
@@ -94,17 +94,17 @@ transitioning macro StringPad(implicit context: Context)(
 }
 
 // ES6 #sec-string.prototype.padstart
-transitioning javascript builtin
-StringPrototypePadStart(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypePadStart(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   const methodName: constexpr string = 'String.prototype.padStart';
   return StringPad(receiver, arguments, methodName, kStringPadStart);
 }
 
 // ES6 #sec-string.prototype.padend
-transitioning javascript builtin
-StringPrototypePadEnd(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypePadEnd(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   const methodName: constexpr string = 'String.prototype.padEnd';
   return StringPad(receiver, arguments, methodName, kStringPadEnd);
 }
diff --git a/deps/v8/src/builtins/string-repeat.tq b/deps/v8/src/builtins/string-repeat.tq
index 0c2d68861e5df0..36b04f6fa57add 100644
--- a/deps/v8/src/builtins/string-repeat.tq
+++ b/deps/v8/src/builtins/string-repeat.tq
@@ -5,8 +5,8 @@
 namespace string {
 const kBuiltinName: constexpr string = 'String.prototype.repeat';
 
-builtin StringRepeat(implicit context: Context)(
-    string: String, count: Smi): String {
+builtin StringRepeat(implicit context: Context)(string: String, count: Smi):
+    String {
   dcheck(count >= 0);
   dcheck(string != kEmptyString);
 
@@ -28,7 +28,8 @@ builtin StringRepeat(implicit context: Context)(
 
 // https://tc39.github.io/ecma262/#sec-string.prototype.repeat
 transitioning javascript builtin StringPrototypeRepeat(
-    js-implicit context: NativeContext, receiver: JSAny)(count: JSAny): String {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    count: JSAny): String {
   // 1. Let O be ? RequireObjectCoercible(this value).
   // 2. Let S be ? ToString(O).
   const s: String = ToThisString(receiver, kBuiltinName);
diff --git a/deps/v8/src/builtins/string-replaceall.tq b/deps/v8/src/builtins/string-replaceall.tq
index cd670208ad9a9b..b09fde5d773fcf 100644
--- a/deps/v8/src/builtins/string-replaceall.tq
+++ b/deps/v8/src/builtins/string-replaceall.tq
@@ -9,8 +9,8 @@ extern macro ReplaceSymbolConstant(): Symbol;
 extern macro StringBuiltinsAssembler::GetSubstitution(
     implicit context: Context)(String, Smi, Smi, String): String;
 
-transitioning macro
-ThrowIfNotGlobal(implicit context: Context)(searchValue: JSAny): void {
+transitioning macro ThrowIfNotGlobal(
+    implicit context: Context)(searchValue: JSAny): void {
   let shouldThrow: bool;
   typeswitch (searchValue) {
     case (fastRegExp: FastJSRegExp): {
@@ -32,8 +32,8 @@ ThrowIfNotGlobal(implicit context: Context)(searchValue: JSAny): void {
 
 // https://tc39.es/ecma262/#sec-string.prototype.replaceall
 transitioning javascript builtin StringPrototypeReplaceAll(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    searchValue: JSAny, replaceValue: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(searchValue: JSAny,
+    replaceValue: JSAny): JSAny {
   // 1. Let O be ? RequireObjectCoercible(this value).
   RequireObjectCoercible(receiver, 'String.prototype.replaceAll');
 
diff --git a/deps/v8/src/builtins/string-slice.tq b/deps/v8/src/builtins/string-slice.tq
index 7a953418e71d5f..4e7205ce6ce426 100644
--- a/deps/v8/src/builtins/string-slice.tq
+++ b/deps/v8/src/builtins/string-slice.tq
@@ -6,7 +6,8 @@ namespace string {
 // ES6 #sec-string.prototype.slice ( start, end )
 // https://tc39.github.io/ecma262/#sec-string.prototype.slice
 transitioning javascript builtin StringPrototypeSlice(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   // 1. Let O be ? RequireObjectCoercible(this value).
   // 2. Let S be ? ToString(O).
   const string: String = ToThisString(receiver, 'String.prototype.slice');
diff --git a/deps/v8/src/builtins/string-startswith.tq b/deps/v8/src/builtins/string-startswith.tq
index 74fec538d9669e..961ce4d94870ec 100644
--- a/deps/v8/src/builtins/string-startswith.tq
+++ b/deps/v8/src/builtins/string-startswith.tq
@@ -7,8 +7,8 @@
 namespace string {
 // https://tc39.github.io/ecma262/#sec-string.prototype.startswith
 transitioning javascript builtin StringPrototypeStartsWith(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(...arguments): Boolean {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): Boolean {
   const searchString: JSAny = arguments[0];
   const position: JSAny = arguments[1];
   const kBuiltinName: constexpr string = 'String.prototype.startsWith';
diff --git a/deps/v8/src/builtins/string-substr.tq b/deps/v8/src/builtins/string-substr.tq
index 81ea82ab7efcb8..43a75be7cf1c99 100644
--- a/deps/v8/src/builtins/string-substr.tq
+++ b/deps/v8/src/builtins/string-substr.tq
@@ -7,7 +7,8 @@ namespace string {
 // String.prototype.substr ( start, length )
 // ES6 #sec-string.prototype.substr
 transitioning javascript builtin StringPrototypeSubstr(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   const methodName: constexpr string = 'String.prototype.substr';
   // 1. Let O be ? RequireObjectCoercible(this value).
   // 2. Let S be ? ToString(O).
diff --git a/deps/v8/src/builtins/string-substring.tq b/deps/v8/src/builtins/string-substring.tq
index 099a28b5057c44..77daf39b288013 100644
--- a/deps/v8/src/builtins/string-substring.tq
+++ b/deps/v8/src/builtins/string-substring.tq
@@ -6,7 +6,8 @@ namespace string {
 
 // ES6 #sec-string.prototype.substring
 transitioning javascript builtin StringPrototypeSubstring(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   // Check that {receiver} is coercible to Object and convert it to a String.
   const string: String = ToThisString(receiver, 'String.prototype.substring');
   const length: uintptr = string.length_uintptr;
diff --git a/deps/v8/src/builtins/string-towellformed.tq b/deps/v8/src/builtins/string-towellformed.tq
index 662037d4a8fbb3..56246fe0daf5d4 100644
--- a/deps/v8/src/builtins/string-towellformed.tq
+++ b/deps/v8/src/builtins/string-towellformed.tq
@@ -13,9 +13,9 @@ namespace string {
 extern macro StringBuiltinsAssembler::ReplaceUnpairedSurrogates(
     String, String): void labels Indirect;
 
-transitioning javascript builtin
-StringPrototypeToWellFormed(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeToWellFormed(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   const methodName: constexpr string = 'String.prototype.toWellFormed';
 
   // 1. Let O be ? RequireObjectCoercible(this value).
@@ -24,9 +24,7 @@ StringPrototypeToWellFormed(
 
   // Fast path: one-byte strings cannot have unpaired surrogates and are
   // definitionally well-formed.
-  //
-  // See note in String::IsWellFormedUnicode.
-  if (s.IsOneByteRepresentation()) return s;
+  if (s.StringInstanceType().is_one_byte) return s;
 
   // 3. Let strLen be the length of S.
   const strLen = s.length_uint32;
diff --git a/deps/v8/src/builtins/string-trim.tq b/deps/v8/src/builtins/string-trim.tq
index daaec9973889f0..0f528b23a8dc93 100644
--- a/deps/v8/src/builtins/string-trim.tq
+++ b/deps/v8/src/builtins/string-trim.tq
@@ -92,9 +92,9 @@ macro IsWhiteSpaceOrLineTerminator(charCode: char16|char8): bool {
   return false;
 }
 
-transitioning macro StringTrimLoop<T: type>(implicit context: Context)(
-    stringSlice: ConstSlice<T>, startIndex: intptr, endIndex: intptr,
-    increment: intptr): intptr {
+transitioning macro StringTrimLoop<T: type>(
+    implicit context: Context)(stringSlice: ConstSlice<T>, startIndex: intptr,
+    endIndex: intptr, increment: intptr): intptr {
   let index = startIndex;
   while (true) {
     if (index == endIndex) {
@@ -110,8 +110,9 @@ transitioning macro StringTrimLoop<T: type>(implicit context: Context)(
   unreachable;
 }
 
-transitioning macro StringTrimBody<T: type>(implicit context: Context)(
-    string: String, slice: ConstSlice<T>, variant: constexpr TrimMode): String {
+transitioning macro StringTrimBody<T: type>(
+    implicit context: Context)(string: String, slice: ConstSlice<T>,
+    variant: constexpr TrimMode): String {
   const stringLength: intptr = string.length_intptr;
 
   let startIndex: intptr = 0;
@@ -133,9 +134,9 @@ transitioning macro StringTrimBody<T: type>(implicit context: Context)(
   return SubString(string, Unsigned(startIndex), Unsigned(endIndex + 1));
 }
 
-transitioning macro StringTrim(implicit context: Context)(
-    receiver: JSAny, _arguments: Arguments, methodName: constexpr string,
-    variant: constexpr TrimMode): String {
+transitioning macro StringTrim(
+    implicit context: Context)(receiver: JSAny, _arguments: Arguments,
+    methodName: constexpr string, variant: constexpr TrimMode): String {
   const receiverString: String = ToThisString(receiver, methodName);
 
   try {
@@ -148,25 +149,25 @@ transitioning macro StringTrim(implicit context: Context)(
 }
 
 // ES6 #sec-string.prototype.trim
-transitioning javascript builtin
-StringPrototypeTrim(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeTrim(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   const methodName: constexpr string = 'String.prototype.trim';
   return StringTrim(receiver, arguments, methodName, TrimMode::kTrim);
 }
 
 // https://github.com/tc39/proposal-string-left-right-trim
-transitioning javascript builtin
-StringPrototypeTrimStart(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeTrimStart(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   const methodName: constexpr string = 'String.prototype.trimLeft';
   return StringTrim(receiver, arguments, methodName, TrimMode::kTrimStart);
 }
 
 // https://github.com/tc39/proposal-string-left-right-trim
-transitioning javascript builtin
-StringPrototypeTrimEnd(
-    js-implicit context: NativeContext, receiver: JSAny)(...arguments): String {
+transitioning javascript builtin StringPrototypeTrimEnd(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): String {
   const methodName: constexpr string = 'String.prototype.trimRight';
   return StringTrim(receiver, arguments, methodName, TrimMode::kTrimEnd);
 }
diff --git a/deps/v8/src/builtins/symbol.tq b/deps/v8/src/builtins/symbol.tq
index 18bdebd380e62a..b32641731dc36e 100644
--- a/deps/v8/src/builtins/symbol.tq
+++ b/deps/v8/src/builtins/symbol.tq
@@ -6,8 +6,9 @@ namespace symbol {
 extern runtime SymbolDescriptiveString(implicit context: Context)(Symbol):
     String;
 
-transitioning macro ThisSymbolValue(implicit context: Context)(
-    receiver: JSAny, method: constexpr string): Symbol {
+transitioning macro ThisSymbolValue(
+    implicit context: Context)(receiver: JSAny,
+    method: constexpr string): Symbol {
   return UnsafeCast<Symbol>(
       ToThisValue(receiver, PrimitiveType::kSymbol, method));
 }
diff --git a/deps/v8/src/builtins/torque-internal.tq b/deps/v8/src/builtins/torque-internal.tq
index 5baa32cd20b82c..99880d05a421ef 100644
--- a/deps/v8/src/builtins/torque-internal.tq
+++ b/deps/v8/src/builtins/torque-internal.tq
@@ -7,16 +7,18 @@
 type MutableSlice<T: type> extends torque_internal::Slice<T, &T>;
 type ConstSlice<T: type> extends torque_internal::Slice<T, const &T>;
 
-macro Subslice<T: type>(slice: ConstSlice<T>, start: intptr, length: intptr):
-    ConstSlice<T>labels OutOfBounds {
+macro Subslice<T: type>(
+    slice: ConstSlice<T>, start: intptr,
+    length: intptr): ConstSlice<T>labels OutOfBounds {
   if (Unsigned(length) > Unsigned(slice.length)) goto OutOfBounds;
   if (Unsigned(start) > Unsigned(slice.length - length)) goto OutOfBounds;
   const offset = slice.offset + torque_internal::TimesSizeOf<T>(start);
   return torque_internal::unsafe::NewConstSlice<T>(
       slice.object, offset, length);
 }
-macro Subslice<T: type>(slice: MutableSlice<T>, start: intptr, length: intptr):
-    MutableSlice<T>labels OutOfBounds {
+macro Subslice<T: type>(
+    slice: MutableSlice<T>, start: intptr,
+    length: intptr): MutableSlice<T>labels OutOfBounds {
   if (Unsigned(length) > Unsigned(slice.length)) goto OutOfBounds;
   if (Unsigned(start) > Unsigned(slice.length - length)) goto OutOfBounds;
   const offset = slice.offset + torque_internal::TimesSizeOf<T>(start);
@@ -48,11 +50,21 @@ struct Unsafe {}
 // of the pointer, not of the instance.
 intrinsic %SizeOf<T: type>(): constexpr int31;
 
+// `SizeOf` without the `%` to allow uses outside of `torque_internal`.
+macro SizeOf<T: type>(): constexpr int31 {
+  return %SizeOf<T>();
+}
+
 macro TimesSizeOf<T: type>(i: intptr): intptr {
   return i * %SizeOf<T>();
 }
 
 struct Reference<T: type> {
+  macro GCUnsafeRawPtr(): RawPtr<T> {
+    return %RawDownCast<RawPtr<T>>(
+        unsafe::GCUnsafeReferenceToRawPtr(this.object, this.offset));
+  }
+
   const object: HeapObject|TaggedZeroPattern;
   const offset: intptr;
   unsafeMarker: Unsafe;
@@ -79,8 +91,8 @@ macro ReferenceCast<T: type, U: type>(ref:&U):&T {
   return ref;
 }
 
-extern macro GCUnsafeReferenceToRawPtr(
-    HeapObject | TaggedZeroPattern, intptr): RawPtr;
+extern macro GCUnsafeReferenceToRawPtr(HeapObject|TaggedZeroPattern, intptr):
+    RawPtr;
 
 }  // namespace unsafe
 
@@ -133,8 +145,8 @@ struct Slice<T: type, Reference: type> {
       unsafeMarker: Unsafe {}
     };
   }
-  macro Iterator(
-      startIndex: intptr, endIndex: intptr): SliceIterator<T, Reference> {
+  macro Iterator(startIndex: intptr, endIndex: intptr):
+      SliceIterator<T, Reference> {
     check(
         Convert<uintptr>(endIndex) <= Convert<uintptr>(this.length) &&
         Convert<uintptr>(startIndex) <= Convert<uintptr>(endIndex));
@@ -184,6 +196,16 @@ macro NewConstSlice<T: type>(
   });
 }
 
+macro NewOffHeapMutableSlice<T: type>(
+    startPointer: RawPtr<T>, length: intptr): MutableSlice<T> {
+  return %RawDownCast<MutableSlice<T>>(Slice<T, &T>{
+    object: kZeroBitPattern,
+    offset: Convert<intptr>(Convert<RawPtr>(startPointer)) + kHeapObjectTag,
+    length: length,
+    unsafeMarker: Unsafe {}
+  });
+}
+
 macro NewOffHeapConstSlice<T: type>(
     startPointer: RawPtr<T>, length: intptr): ConstSlice<T> {
   return %RawDownCast<ConstSlice<T>>(Slice<T, const &T>{
@@ -261,11 +283,9 @@ macro ValidAllocationSize(sizeInBytes: intptr, map: Map): bool {
 type UninitializedHeapObject extends HeapObject;
 
 extern macro GetInstanceTypeMap(constexpr InstanceType): Map;
-extern macro Allocate(
-    intptr, constexpr AllocationFlag): UninitializedHeapObject;
+extern macro Allocate(intptr, constexpr AllocationFlag):
+    UninitializedHeapObject;
 
-const kAllocateBaseFlags: constexpr AllocationFlag =
-    AllocationFlag::kAllowLargeObjectAllocation;
 macro AllocateFromNew(
     sizeInBytes: intptr, map: Map, pretenured: bool,
     clearPadding: bool): UninitializedHeapObject {
@@ -275,10 +295,9 @@ macro AllocateFromNew(
     res = Allocate(
         sizeInBytes,
         %RawConstexprCast<constexpr AllocationFlag>(
-            %RawConstexprCast<constexpr int32>(kAllocateBaseFlags) |
             %RawConstexprCast<constexpr int32>(AllocationFlag::kPretenured)));
   } else {
-    res = Allocate(sizeInBytes, kAllocateBaseFlags);
+    res = Allocate(sizeInBytes, AllocationFlag::kNone);
   }
   if (clearPadding) {
     *unsafe::NewReference<Zero>(res, sizeInBytes - kObjectAlignment) = kZero;
@@ -357,11 +376,11 @@ intrinsic %IndexedFieldLength<T: type>(o: T, f: constexpr string): intptr;
 // optional field, which is either length zero or one depending on whether the
 // field is present. This intrinsic provides Slices for both indexed fields
 // (equivalent to &o.x) and optional fields.
-intrinsic %FieldSlice<T: type, TSlice: type>(
-    o: T, f: constexpr string): TSlice;
+intrinsic %FieldSlice<T: type, TSlice: type>(o: T, f: constexpr string):
+    TSlice;
 
 extern macro GetPendingMessage(): TheHole|JSMessageObject;
-extern macro SetPendingMessage(TheHole | JSMessageObject): void;
+extern macro SetPendingMessage(TheHole|JSMessageObject): void;
 
 // This is implicitly performed at the beginning of Torque catch-blocks.
 macro GetAndResetPendingMessage(): TheHole|JSMessageObject {
@@ -388,7 +407,8 @@ intrinsic %MaxInstanceType<T: type>(): constexpr InstanceType;
 intrinsic %ClassHasMapConstant<T: type>(): constexpr bool;
 intrinsic %GetClassMapConstant<T: type>(): Map;
 
-struct IteratorSequence<T: type, FirstIterator: type, SecondIterator: type> {
+struct IteratorSequence<
+    T: type, FirstIterator: type, SecondIterator: type> {
   macro Empty(): bool {
     return this.first.Empty() && this.second.Empty();
   }
@@ -402,7 +422,8 @@ struct IteratorSequence<T: type, FirstIterator: type, SecondIterator: type> {
   second: SecondIterator;
 }
 
-macro IteratorSequence<T: type, FirstIterator: type, SecondIterator: type>(
+macro
+IteratorSequence<T: type, FirstIterator: type, SecondIterator: type>(
     first: FirstIterator, second: SecondIterator):
     IteratorSequence<T, FirstIterator, SecondIterator> {
   return IteratorSequence<T>{first, second};
diff --git a/deps/v8/src/builtins/typed-array-createtypedarray.tq b/deps/v8/src/builtins/typed-array-createtypedarray.tq
index 4ec380da1efec4..a5260fc52a6525 100644
--- a/deps/v8/src/builtins/typed-array-createtypedarray.tq
+++ b/deps/v8/src/builtins/typed-array-createtypedarray.tq
@@ -5,27 +5,26 @@
 #include 'src/builtins/builtins-constructor-gen.h'
 
 namespace typed_array {
-extern builtin IterableToListMayPreserveHoles(
-    Context, Object, Callable): JSArray;
+extern builtin IterableToListMayPreserveHoles(Context, Object, Callable):
+    JSArray;
 
 extern macro TypedArrayBuiltinsAssembler::AllocateEmptyOnHeapBuffer(
     implicit context: Context)(): JSArrayBuffer;
-extern macro CodeStubAssembler::AllocateByteArray(uintptr): ByteArray;
 extern macro TypedArrayBuiltinsAssembler::GetDefaultConstructor(
     implicit context: Context)(JSTypedArray): JSFunction;
 extern macro TypedArrayBuiltinsAssembler::SetupTypedArrayEmbedderFields(
     JSTypedArray): void;
 
-extern runtime ThrowInvalidTypedArrayAlignment(implicit context: Context)(
-    Map, String): never;
+extern runtime ThrowInvalidTypedArrayAlignment(
+    implicit context: Context)(Map, String): never;
 
-extern runtime GrowableSharedArrayBufferByteLength(implicit context: Context)(
-    Object): JSAny;
+extern runtime GrowableSharedArrayBufferByteLength(
+    implicit context: Context)(Object): JSAny;
 
-transitioning macro AllocateTypedArray(implicit context: Context)(
-    isOnHeap: constexpr bool, map: Map, buffer: JSArrayBuffer,
-    byteOffset: uintptr, byteLength: uintptr, length: uintptr,
-    isLengthTracking: bool): JSTypedArray {
+transitioning macro AllocateTypedArray(
+    implicit context: Context)(isOnHeap: constexpr bool, map: Map,
+    buffer: JSArrayBuffer, byteOffset: uintptr, byteLength: uintptr,
+    length: uintptr, isLengthTracking: bool): JSTypedArray {
   let elements: ByteArray;
   if constexpr (isOnHeap) {
     dcheck(!IsResizableArrayBuffer(buffer));
@@ -83,9 +82,9 @@ transitioning macro AllocateTypedArray(implicit context: Context)(
   return typedArray;
 }
 
-transitioning macro TypedArrayInitialize(implicit context: Context)(
-    initialize: constexpr bool, map: Map, length: uintptr,
-    elementsInfo: typed_array::TypedArrayElementsInfo):
+transitioning macro TypedArrayInitialize(
+    implicit context: Context)(initialize: constexpr bool, map: Map,
+    length: uintptr, elementsInfo: typed_array::TypedArrayElementsInfo):
     JSTypedArray labels IfRangeError {
   const byteLength = elementsInfo.CalculateByteLength(length)
       otherwise IfRangeError;
@@ -129,8 +128,8 @@ transitioning macro TypedArrayInitialize(implicit context: Context)(
 
 // 22.2.4.2 TypedArray ( length )
 // ES #sec-typedarray-length
-transitioning macro ConstructByLength(implicit context: Context)(
-    map: Map, lengthObj: JSAny,
+transitioning macro ConstructByLength(
+    implicit context: Context)(map: Map, lengthObj: JSAny,
     elementsInfo: typed_array::TypedArrayElementsInfo): JSTypedArray {
   try {
     const length: uintptr = ToIndex(lengthObj) otherwise RangeError;
@@ -144,8 +143,9 @@ transitioning macro ConstructByLength(implicit context: Context)(
 
 // 22.2.4.4 TypedArray ( object )
 // ES #sec-typedarray-object
-transitioning macro ConstructByArrayLike(implicit context: Context)(
-    map: Map, arrayLike: HeapObject, length: uintptr,
+transitioning macro ConstructByArrayLike(
+    implicit context: Context)(map: Map, arrayLike: HeapObject,
+    length: uintptr,
     elementsInfo: typed_array::TypedArrayElementsInfo): JSTypedArray {
   try {
     const initialize: constexpr bool = false;
@@ -196,8 +196,9 @@ transitioning macro ConstructByArrayLike(implicit context: Context)(
 
 // 22.2.4.4 TypedArray ( object )
 // ES #sec-typedarray-object
-transitioning macro ConstructByIterable(implicit context: Context)(
-    iterable: JSReceiver, iteratorFn: Callable): never
+transitioning macro ConstructByIterable(
+    implicit context: Context)(iterable: JSReceiver,
+    iteratorFn: Callable): never
     labels IfConstructByArrayLike(JSArray, uintptr) {
   const array: JSArray =
       IterableToListMayPreserveHoles(context, iterable, iteratorFn);
@@ -207,8 +208,8 @@ transitioning macro ConstructByIterable(implicit context: Context)(
 
 // 22.2.4.3 TypedArray ( typedArray )
 // ES #sec-typedarray-typedarray
-transitioning macro ConstructByTypedArray(implicit context: Context)(
-    srcTypedArray: JSTypedArray): never
+transitioning macro ConstructByTypedArray(
+    implicit context: Context)(srcTypedArray: JSTypedArray): never
     labels IfConstructByArrayLike(JSTypedArray, uintptr) {
   let length: uintptr;
   try {
@@ -223,10 +224,10 @@ transitioning macro ConstructByTypedArray(implicit context: Context)(
 }
 
 // 22.2.4.5 TypedArray ( buffer, byteOffset, length )
-// ES #sec-typedarray-buffer-byteoffset-length
-transitioning macro ConstructByArrayBuffer(implicit context: Context)(
-    target: JSFunction, newTarget: JSReceiver, buffer: JSArrayBuffer,
-    byteOffset: JSAny, length: JSAny): JSTypedArray {
+// ES #sec-initializetypedarrayfromarraybuffer
+transitioning macro ConstructByArrayBuffer(
+    implicit context: Context)(target: JSFunction, newTarget: JSReceiver,
+    buffer: JSArrayBuffer, byteOffset: JSAny, length: JSAny): JSTypedArray {
   let map: Map;
   const isLengthTracking: bool =
       IsResizableArrayBuffer(buffer) && (length == Undefined);
@@ -241,30 +242,31 @@ transitioning macro ConstructByArrayBuffer(implicit context: Context)(
     map = GetDerivedMap(target, newTarget);
   }
 
-  // 5. Let elementSize be the Number value of the Element Size value in Table
-  // 56 for constructorName.
+  // 1. Let elementSize be TypedArrayElementSize(O).
   const elementsInfo = GetTypedArrayElementsInfo(map);
 
   try {
-    // 6. Let offset be ? ToIndex(byteOffset).
+    // 2. Let offset be ? ToIndex(byteOffset).
     const offset: uintptr = ToIndex(byteOffset) otherwise IfInvalidOffset;
 
-    // 7. If offset modulo elementSize ≠ 0, throw a RangeError exception.
+    // 3. If offset modulo elementSize ≠ 0, throw a RangeError exception.
     if (elementsInfo.IsUnaligned(offset)) {
       goto IfInvalidAlignment('start offset');
     }
 
-    // 8. If length is present and length is not undefined, then
+    // 4. Let bufferIsResizable be IsResizableArrayBuffer(buffer).
+
+    // 5. If length is not undefined, then
     // a. Let newLength be ? ToIndex(length).
     let newLength: uintptr = ToIndex(length) otherwise IfInvalidLength;
     let newByteLength: uintptr;
 
-    // 9. If IsDetachedBuffer(buffer) is true, throw a TypeError exception.
+    // 6. If IsDetachedBuffer(buffer) is true, throw a TypeError exception.
     if (IsDetachedBuffer(buffer)) {
       ThrowTypeError(MessageTemplate::kDetachedOperation, 'Construct');
     }
 
-    // 10. Let bufferByteLength be buffer.[[ArrayBufferByteLength]].
+    // 7. Let bufferByteLength be ArrayBufferByteLength(buffer, SeqCst).
     let bufferByteLength: uintptr;
     if (IsResizableArrayBuffer(buffer) && IsSharedArrayBuffer(buffer)) {
       bufferByteLength = ToIndex(GrowableSharedArrayBufferByteLength(buffer))
@@ -273,35 +275,44 @@ transitioning macro ConstructByArrayBuffer(implicit context: Context)(
       bufferByteLength = buffer.byte_length;
     }
 
-    // 11. If length is either not present or undefined, then
-    if (length == Undefined) {
-      // a. If bufferByteLength modulo elementSize ≠ 0, throw a RangeError
-      // exception.
-      if (elementsInfo.IsUnaligned(bufferByteLength)) {
-        goto IfInvalidAlignment('byte length');
-      }
-
-      // b. Let newByteLength be bufferByteLength - offset.
-      // c. If newByteLength < 0, throw a RangeError exception.
+    // 8. If length is undefined and bufferIsResizable is true, then
+    //   a. If offset > bufferByteLength, throw a RangeError exception.
+    //   b. Set O.[[ByteLength]] to auto.
+    //   c. Set O.[[ArrayLength]] to auto.
+    if (isLengthTracking) {
       if (bufferByteLength < offset) goto IfInvalidOffset;
-
-      // Spec step 16 length calculated here to avoid recalculating the length
-      // in the step 12 branch.
-      newByteLength = bufferByteLength - offset;
-      newLength = elementsInfo.CalculateLength(newByteLength)
-          otherwise IfInvalidLength;
-
-      // 12. Else,
+      newLength = 0;
+      newByteLength = 0;
     } else {
-      // a. Let newByteLength be newLength × elementSize.
-      newByteLength = elementsInfo.CalculateByteLength(newLength)
-          otherwise IfInvalidLength;
-
-      // b. If offset + newByteLength > bufferByteLength, throw a RangeError
-      // exception.
-      if ((bufferByteLength < newByteLength) ||
-          (offset > bufferByteLength - newByteLength))
-        goto IfInvalidLength;
+      // 9. Else
+      //   a. If length is undefined, then
+      if (length == Undefined) {
+        //   i. If bufferByteLength modulo elementSize ≠ 0, throw a RangeError
+        //   exception.
+        if (elementsInfo.IsUnaligned(bufferByteLength)) {
+          goto IfInvalidAlignment('byte length');
+        }
+
+        //   ii. Let newByteLength be bufferByteLength - offset.
+        //   iii. If newByteLength < 0, throw a RangeError exception.
+        if (bufferByteLength < offset) goto IfInvalidOffset;
+
+        newByteLength = bufferByteLength - offset;
+        newLength = elementsInfo.CalculateLength(newByteLength)
+            otherwise IfInvalidLength;
+      } else {
+        // b. Else,
+        //   i. Let newByteLength be newLength × elementSize.
+        newByteLength = elementsInfo.CalculateByteLength(newLength)
+            otherwise IfInvalidLength;
+
+        //   ii. If offset + newByteLength > bufferByteLength, throw a
+        //   RangeError
+        // exception.
+        if ((bufferByteLength < newByteLength) ||
+            (offset > bufferByteLength - newByteLength))
+          goto IfInvalidLength;
+      }
     }
 
     const isOnHeap: constexpr bool = false;
@@ -320,9 +331,9 @@ transitioning macro ConstructByArrayBuffer(implicit context: Context)(
 // 22.2.4.6 TypedArrayCreate ( constructor, argumentList )
 // ES #typedarray-create
 @export
-transitioning macro TypedArrayCreateByLength(implicit context: Context)(
-    constructor: Constructor, length: Number, methodName: constexpr string):
-    JSTypedArray {
+transitioning macro TypedArrayCreateByLength(
+    implicit context: Context)(constructor: Constructor, length: Number,
+    methodName: constexpr string): JSTypedArray {
   dcheck(IsSafeInteger(length));
 
   // 1. Let newTypedArray be ? Construct(constructor, argumentList).
@@ -358,8 +369,8 @@ transitioning macro TypedArrayCreateByLength(implicit context: Context)(
   return newTypedArray;
 }
 
-transitioning macro ConstructByJSReceiver(implicit context: Context)(
-    obj: JSReceiver): never
+transitioning macro ConstructByJSReceiver(
+    implicit context: Context)(obj: JSReceiver): never
     labels IfConstructByArrayLike(JSReceiver, uintptr),
     IfIteratorNotCallable(JSAny) {
   try {
@@ -432,9 +443,9 @@ transitioning builtin CreateTypedArray(
   }
 }
 
-transitioning macro TypedArraySpeciesCreate(implicit context: Context)(
-    methodName: constexpr string, numArgs: constexpr int31,
-    exemplar: JSTypedArray, arg0: JSAny, arg1: JSAny,
+transitioning macro TypedArraySpeciesCreate(
+    implicit context: Context)(methodName: constexpr string,
+    numArgs: constexpr int31, exemplar: JSTypedArray, arg0: JSAny, arg1: JSAny,
     arg2: JSAny): JSTypedArray {
   const defaultConstructor = GetDefaultConstructor(exemplar);
 
@@ -470,9 +481,9 @@ transitioning macro TypedArraySpeciesCreate(implicit context: Context)(
 }
 
 @export
-transitioning macro TypedArraySpeciesCreateByLength(implicit context: Context)(
-    methodName: constexpr string, exemplar: JSTypedArray, length: uintptr):
-    JSTypedArray {
+transitioning macro TypedArraySpeciesCreateByLength(
+    implicit context: Context)(methodName: constexpr string,
+    exemplar: JSTypedArray, length: uintptr): JSTypedArray {
   const numArgs: constexpr int31 = 1;
   // TODO(v8:4153): pass length further as uintptr.
   const typedArray: JSTypedArray = TypedArraySpeciesCreate(
@@ -491,9 +502,10 @@ transitioning macro TypedArraySpeciesCreateByLength(implicit context: Context)(
   return typedArray;
 }
 
-transitioning macro TypedArraySpeciesCreateByBuffer(implicit context: Context)(
-    methodName: constexpr string, exemplar: JSTypedArray, buffer: JSArrayBuffer,
-    beginByteOffset: uintptr, newLength: NumberOrUndefined): JSTypedArray {
+transitioning macro TypedArraySpeciesCreateByBuffer(
+    implicit context: Context)(methodName: constexpr string,
+    exemplar: JSTypedArray, buffer: JSArrayBuffer, beginByteOffset: uintptr,
+    newLength: NumberOrUndefined): JSTypedArray {
   const numArgs: constexpr int31 = 3;
   // TODO(v8:4153): pass length further as uintptr.
   const typedArray: JSTypedArray = TypedArraySpeciesCreate(
@@ -502,8 +514,9 @@ transitioning macro TypedArraySpeciesCreateByBuffer(implicit context: Context)(
   return typedArray;
 }
 
-transitioning macro TypedArrayCreateSameType(implicit context: Context)(
-    exemplar: JSTypedArray, newLength: uintptr): JSTypedArray {
+transitioning macro TypedArrayCreateSameType(
+    implicit context: Context)(exemplar: JSTypedArray,
+    newLength: uintptr): JSTypedArray {
   const constructor = GetDefaultConstructor(exemplar);
   const typedArray = CreateTypedArray(
       context, constructor, constructor, Convert<Number>(newLength), Undefined,
diff --git a/deps/v8/src/builtins/typed-array-entries.tq b/deps/v8/src/builtins/typed-array-entries.tq
index 6749a14e90ab0d..b4806dfd404ed1 100644
--- a/deps/v8/src/builtins/typed-array-entries.tq
+++ b/deps/v8/src/builtins/typed-array-entries.tq
@@ -9,8 +9,8 @@ const kBuiltinNameEntries: constexpr string = '%TypedArray%.prototype.entries';
 
 // %TypedArray%.entries ()
 // https://tc39.github.io/ecma262/#sec-%typedarray%.entries
-transitioning javascript builtin
-TypedArrayPrototypeEntries(js-implicit context: NativeContext, receiver: JSAny)(
+transitioning javascript builtin TypedArrayPrototypeEntries(
+    js-implicit context: NativeContext, receiver: JSAny)(
     ...arguments): JSArrayIterator {
   try {
     const array: JSTypedArray = Cast<JSTypedArray>(receiver)
diff --git a/deps/v8/src/builtins/typed-array-every.tq b/deps/v8/src/builtins/typed-array-every.tq
index fa1b7ab619dcba..6681cf0a019e2d 100644
--- a/deps/v8/src/builtins/typed-array-every.tq
+++ b/deps/v8/src/builtins/typed-array-every.tq
@@ -8,7 +8,8 @@ namespace typed_array {
 const kBuiltinNameEvery: constexpr string = '%TypedArray%.prototype.every';
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.every
-transitioning macro EveryAllElements(implicit context: Context)(
+transitioning macro EveryAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     callbackfn: Callable, thisArg: JSAny): Boolean {
   let witness =
@@ -49,8 +50,7 @@ transitioning macro EveryAllElements(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.every
-transitioning javascript builtin
-TypedArrayPrototypeEvery(
+transitioning javascript builtin TypedArrayPrototypeEvery(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // arguments[0] = callback
   // arguments[1] = thisArg
@@ -71,7 +71,7 @@ TypedArrayPrototypeEvery(
   } label IsDetachedOrOutOfBounds deferred {
     ThrowTypeError(MessageTemplate::kDetachedOperation, kBuiltinNameEvery);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/typed-array-filter.tq b/deps/v8/src/builtins/typed-array-filter.tq
index 736dff0affb8e1..8fcd7f8e0538f7 100644
--- a/deps/v8/src/builtins/typed-array-filter.tq
+++ b/deps/v8/src/builtins/typed-array-filter.tq
@@ -22,7 +22,7 @@ transitioning javascript builtin TypedArrayPrototypeFilter(
         otherwise IsDetachedOrOutOfBounds;
     // 4. If IsCallable(callbackfn) is false, throw a TypeError exception.
     const callbackfn = Cast<Callable>(arguments[0])
-        otherwise ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+        otherwise ThrowCalledNonCallable(arguments[0]);
 
     // 5. If thisArg is present, let T be thisArg; else let T be undefined.
     const thisArg: JSAny = arguments[1];
diff --git a/deps/v8/src/builtins/typed-array-find.tq b/deps/v8/src/builtins/typed-array-find.tq
index c2456f9268fcc4..2f8c3408b5846f 100644
--- a/deps/v8/src/builtins/typed-array-find.tq
+++ b/deps/v8/src/builtins/typed-array-find.tq
@@ -8,7 +8,8 @@ namespace typed_array {
 const kBuiltinNameFind: constexpr string = '%TypedArray%.prototype.find';
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.find
-transitioning macro FindAllElements(implicit context: Context)(
+transitioning macro FindAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     predicate: Callable, thisArg: JSAny): JSAny {
   let witness =
@@ -51,8 +52,7 @@ transitioning macro FindAllElements(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.find
-transitioning javascript builtin
-TypedArrayPrototypeFind(
+transitioning javascript builtin TypedArrayPrototypeFind(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // arguments[0] = callback
   // arguments[1] = thisArg
@@ -69,7 +69,7 @@ TypedArrayPrototypeFind(
     const thisArg = arguments[1];
     return FindAllElements(attachedArrayAndLength, predicate, thisArg);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   } label NotTypedArray deferred {
     ThrowTypeError(MessageTemplate::kNotTypedArray, kBuiltinNameFind);
   } label IsDetachedOrOutOfBounds deferred {
diff --git a/deps/v8/src/builtins/typed-array-findindex.tq b/deps/v8/src/builtins/typed-array-findindex.tq
index 6a63008145a9af..0fc306ef5940a8 100644
--- a/deps/v8/src/builtins/typed-array-findindex.tq
+++ b/deps/v8/src/builtins/typed-array-findindex.tq
@@ -8,7 +8,8 @@ namespace typed_array {
 const kBuiltinNameFindIndex: constexpr string =
     '%TypedArray%.prototype.findIndex';
 
-transitioning macro FindIndexAllElements(implicit context: Context)(
+transitioning macro FindIndexAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     predicate: Callable, thisArg: JSAny): Number {
   let witness =
@@ -45,8 +46,7 @@ transitioning macro FindIndexAllElements(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.findIndex
-transitioning javascript builtin
-TypedArrayPrototypeFindIndex(
+transitioning javascript builtin TypedArrayPrototypeFindIndex(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // arguments[0] = predicate
   // arguments[1] = thisArg.
@@ -63,7 +63,7 @@ TypedArrayPrototypeFindIndex(
     const thisArg = arguments[1];
     return FindIndexAllElements(attachedArrayAndLength, predicate, thisArg);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   } label NotTypedArray deferred {
     ThrowTypeError(MessageTemplate::kNotTypedArray, kBuiltinNameFindIndex);
   } label IsDetachedOrOutOfBounds deferred {
diff --git a/deps/v8/src/builtins/typed-array-findlast.tq b/deps/v8/src/builtins/typed-array-findlast.tq
index 45695f83ac7f50..8b573fcb683fca 100644
--- a/deps/v8/src/builtins/typed-array-findlast.tq
+++ b/deps/v8/src/builtins/typed-array-findlast.tq
@@ -9,7 +9,8 @@ const kBuiltinNameFindLast: constexpr string =
     '%TypedArray%.prototype.findLast';
 
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-%typedarray%.prototype.findlast
-transitioning macro FindLastAllElements(implicit context: Context)(
+transitioning macro FindLastAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     predicate: Callable, thisArg: JSAny): JSAny {
   let witness =
@@ -50,8 +51,7 @@ transitioning macro FindLastAllElements(implicit context: Context)(
 }
 
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-%typedarray%.prototype.findlast
-transitioning javascript builtin
-TypedArrayPrototypeFindLast(
+transitioning javascript builtin TypedArrayPrototypeFindLast(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // arguments[0] = predicate
   // arguments[1] = thisArg
@@ -68,7 +68,7 @@ TypedArrayPrototypeFindLast(
     const thisArg = arguments[1];
     return FindLastAllElements(attachedArrayAndLength, predicate, thisArg);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   } label NotTypedArray deferred {
     ThrowTypeError(MessageTemplate::kNotTypedArray, kBuiltinNameFindLast);
   } label IsDetachedOrOutOfBounds deferred {
diff --git a/deps/v8/src/builtins/typed-array-findlastindex.tq b/deps/v8/src/builtins/typed-array-findlastindex.tq
index 1edee5444feba0..72237138924078 100644
--- a/deps/v8/src/builtins/typed-array-findlastindex.tq
+++ b/deps/v8/src/builtins/typed-array-findlastindex.tq
@@ -9,7 +9,8 @@ const kBuiltinNameFindLastIndex: constexpr string =
     '%TypedArray%.prototype.findIndexLast';
 
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-%typedarray%.prototype.findlastindex
-transitioning macro FindLastIndexAllElements(implicit context: Context)(
+transitioning macro FindLastIndexAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     predicate: Callable, thisArg: JSAny): Number {
   let witness =
@@ -50,8 +51,7 @@ transitioning macro FindLastIndexAllElements(implicit context: Context)(
 }
 
 // https://tc39.es/proposal-array-find-from-last/index.html#sec-%typedarray%.prototype.findlastindex
-transitioning javascript builtin
-TypedArrayPrototypeFindLastIndex(
+transitioning javascript builtin TypedArrayPrototypeFindLastIndex(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // arguments[0] = predicate
   // arguments[1] = thisArg
@@ -68,7 +68,7 @@ TypedArrayPrototypeFindLastIndex(
     const thisArg = arguments[1];
     return FindLastIndexAllElements(attachedArrayAndLength, predicate, thisArg);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   } label NotTypedArray deferred {
     ThrowTypeError(MessageTemplate::kNotTypedArray, kBuiltinNameFindLastIndex);
   } label IsDetachedOrOutOfBounds deferred {
diff --git a/deps/v8/src/builtins/typed-array-foreach.tq b/deps/v8/src/builtins/typed-array-foreach.tq
index 45b949b4ef1e36..14e1b1e934bd11 100644
--- a/deps/v8/src/builtins/typed-array-foreach.tq
+++ b/deps/v8/src/builtins/typed-array-foreach.tq
@@ -7,7 +7,8 @@
 namespace typed_array {
 const kBuiltinNameForEach: constexpr string = '%TypedArray%.prototype.forEach';
 
-transitioning macro ForEachAllElements(implicit context: Context)(
+transitioning macro ForEachAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     callbackfn: Callable, thisArg: JSAny): Undefined {
   let witness =
@@ -44,8 +45,8 @@ transitioning macro ForEachAllElements(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.every
-transitioning javascript builtin
-TypedArrayPrototypeForEach(js-implicit context: NativeContext, receiver: JSAny)(
+transitioning javascript builtin TypedArrayPrototypeForEach(
+    js-implicit context: NativeContext, receiver: JSAny)(
     ...arguments): Undefined {
   // arguments[0] = callback
   // arguments[1] = this_arg.
@@ -63,7 +64,7 @@ TypedArrayPrototypeForEach(js-implicit context: NativeContext, receiver: JSAny)(
     const thisArg = arguments[1];
     return ForEachAllElements(attachedArrayAndLength, callbackfn, thisArg);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   } label NotTypedArray deferred {
     ThrowTypeError(MessageTemplate::kNotTypedArray, kBuiltinNameForEach);
   } label IsDetachedOrOutOfBounds deferred {
diff --git a/deps/v8/src/builtins/typed-array-from.tq b/deps/v8/src/builtins/typed-array-from.tq
index eba7c87ea1fee7..3a889484969439 100644
--- a/deps/v8/src/builtins/typed-array-from.tq
+++ b/deps/v8/src/builtins/typed-array-from.tq
@@ -7,18 +7,18 @@
 namespace typed_array {
 const kBuiltinNameFrom: constexpr string = '%TypedArray%.from';
 
-type BuiltinsName extends int31 constexpr 'Builtin';
 const kTypedArrayPrototypeValues: constexpr BuiltinsName
     generates 'Builtin::kTypedArrayPrototypeValues';
 const kArrayPrototypeValues: constexpr BuiltinsName
     generates 'Builtin::kArrayPrototypeValues';
 
-extern builtin IterableToList(implicit context: Context)(JSAny, JSAny): JSArray;
+extern builtin IterableToList(implicit context: Context)(JSAny, JSAny):
+    JSArray;
 
 // %TypedArray%.from ( source [ , mapfn [ , thisArg ] ] )
 // https://tc39.github.io/ecma262/#sec-%typedarray%.from
-transitioning javascript builtin
-TypedArrayFrom(js-implicit context: NativeContext, receiver: JSAny)(
+transitioning javascript builtin TypedArrayFrom(
+    js-implicit context: NativeContext, receiver: JSAny)(
     ...arguments): JSTypedArray {
   try {
     const source: JSAny = arguments[0];
@@ -35,7 +35,7 @@ TypedArrayFrom(js-implicit context: NativeContext, receiver: JSAny)(
     //   b. Let mapping be true.
     const mapping: bool = mapfnObj != Undefined;
     if (mapping && !Is<Callable>(mapfnObj)) deferred {
-        ThrowTypeError(MessageTemplate::kCalledNonCallable, mapfnObj);
+        ThrowCalledNonCallable(mapfnObj);
       }
 
     // We split up this builtin differently to the way it is written in the
diff --git a/deps/v8/src/builtins/typed-array-keys.tq b/deps/v8/src/builtins/typed-array-keys.tq
index 24c53c71052647..68835e64d17f8f 100644
--- a/deps/v8/src/builtins/typed-array-keys.tq
+++ b/deps/v8/src/builtins/typed-array-keys.tq
@@ -9,8 +9,8 @@ const kBuiltinNameKeys: constexpr string = '%TypedArray%.prototype.keys';
 
 // %TypedArray%.keys ()
 // https://tc39.github.io/ecma262/#sec-%typedarray%.keys
-transitioning javascript builtin
-TypedArrayPrototypeKeys(js-implicit context: NativeContext, receiver: JSAny)(
+transitioning javascript builtin TypedArrayPrototypeKeys(
+    js-implicit context: NativeContext, receiver: JSAny)(
     ...arguments): JSArrayIterator {
   try {
     const array: JSTypedArray = Cast<JSTypedArray>(receiver)
diff --git a/deps/v8/src/builtins/typed-array-of.tq b/deps/v8/src/builtins/typed-array-of.tq
index b5d42ef9a2f58e..d696e767fb7d1c 100644
--- a/deps/v8/src/builtins/typed-array-of.tq
+++ b/deps/v8/src/builtins/typed-array-of.tq
@@ -9,9 +9,9 @@ const kBuiltinNameOf: constexpr string = '%TypedArray%.of';
 
 // %TypedArray%.of ( ...items )
 // https://tc39.github.io/ecma262/#sec-%typedarray%.of
-transitioning javascript builtin
-TypedArrayOf(js-implicit context: NativeContext, receiver: JSAny)(...arguments):
-    JSTypedArray {
+transitioning javascript builtin TypedArrayOf(
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): JSTypedArray {
   try {
     // 1. Let len be the actual number of arguments passed to this function.
     const len: uintptr = Unsigned(arguments.length);
diff --git a/deps/v8/src/builtins/typed-array-reduce.tq b/deps/v8/src/builtins/typed-array-reduce.tq
index b231b1ff98398f..581bfba6a018d0 100644
--- a/deps/v8/src/builtins/typed-array-reduce.tq
+++ b/deps/v8/src/builtins/typed-array-reduce.tq
@@ -7,7 +7,8 @@
 namespace typed_array {
 const kBuiltinNameReduce: constexpr string = '%TypedArray%.prototype.reduce';
 
-transitioning macro ReduceAllElements(implicit context: Context)(
+transitioning macro ReduceAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     callbackfn: Callable, initialValue: JSAny|TheHole): JSAny {
   let witness =
@@ -47,8 +48,7 @@ transitioning macro ReduceAllElements(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.reduce
-transitioning javascript builtin
-TypedArrayPrototypeReduce(
+transitioning javascript builtin TypedArrayPrototypeReduce(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // arguments[0] = callback
   // arguments[1] = initialValue.
@@ -65,7 +65,7 @@ TypedArrayPrototypeReduce(
     const initialValue = arguments.length >= 2 ? arguments[1] : TheHole;
     return ReduceAllElements(attachedArrayAndLength, callbackfn, initialValue);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   } label NotTypedArray deferred {
     ThrowTypeError(MessageTemplate::kNotTypedArray, kBuiltinNameReduce);
   } label IsDetachedOrOutOfBounds deferred {
diff --git a/deps/v8/src/builtins/typed-array-reduceright.tq b/deps/v8/src/builtins/typed-array-reduceright.tq
index 36f14a1b68ef38..fe7d9e34a4e948 100644
--- a/deps/v8/src/builtins/typed-array-reduceright.tq
+++ b/deps/v8/src/builtins/typed-array-reduceright.tq
@@ -9,7 +9,8 @@ const kBuiltinNameReduceRight: constexpr string =
     '%TypedArray%.prototype.reduceRight';
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.reduceright
-transitioning macro ReduceRightAllElements(implicit context: Context)(
+transitioning macro ReduceRightAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     callbackfn: Callable, initialValue: JSAny|TheHole): JSAny {
   let witness =
@@ -49,8 +50,7 @@ transitioning macro ReduceRightAllElements(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.reduceright
-transitioning javascript builtin
-TypedArrayPrototypeReduceRight(
+transitioning javascript builtin TypedArrayPrototypeReduceRight(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // arguments[0] = callback
   // arguments[1] = initialValue.
@@ -69,7 +69,7 @@ TypedArrayPrototypeReduceRight(
     return ReduceRightAllElements(
         attachedArrayAndLength, callbackfn, initialValue);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   } label NotTypedArray deferred {
     ThrowTypeError(MessageTemplate::kNotTypedArray, kBuiltinNameReduceRight);
   } label IsDetachedOrOutOfBounds deferred {
diff --git a/deps/v8/src/builtins/typed-array-set.tq b/deps/v8/src/builtins/typed-array-set.tq
index 825a2a4b7ded0e..86bec2ba3c353c 100644
--- a/deps/v8/src/builtins/typed-array-set.tq
+++ b/deps/v8/src/builtins/typed-array-set.tq
@@ -7,30 +7,29 @@
 namespace typed_array {
 const kBuiltinNameSet: constexpr string = '%TypedArray%.prototype.set';
 
-extern runtime TypedArraySet(
-    Context, JSTypedArray, Object, Number, Number): void;
+extern runtime TypedArraySet(Context, JSTypedArray, Object, Number, Number):
+    void;
 
 extern macro
-TypedArrayBuiltinsAssembler::CallCCopyFastNumberJSArrayElementsToTypedArray(
-    Context,
-    FastJSArray,           // source
-    AttachedJSTypedArray,  // dest
-    uintptr,               // sourceLength
-    uintptr                // destOffset
-    ): void;
+    TypedArrayBuiltinsAssembler::CallCCopyFastNumberJSArrayElementsToTypedArray(
+        Context,
+        FastJSArray,           // source
+        AttachedJSTypedArray,  // dest
+        uintptr,               // sourceLength
+        uintptr                // destOffset
+        ): void;
 
 extern macro
-TypedArrayBuiltinsAssembler::CallCCopyTypedArrayElementsToTypedArray(
-    AttachedJSTypedArray,  // source
-    AttachedJSTypedArray,  // dest
-    uintptr,               // sourceLength
-    uintptr                // destOffset
-    ): void;
+    TypedArrayBuiltinsAssembler::CallCCopyTypedArrayElementsToTypedArray(
+        AttachedJSTypedArray,  // source
+        AttachedJSTypedArray,  // dest
+        uintptr,               // sourceLength
+        uintptr                // destOffset
+        ): void;
 
 // %TypedArray%.prototype.set ( overloaded [ , offset ] )
 // https://tc39.es/ecma262/#sec-%typedarray%.prototype.set-overloaded-offset
-transitioning javascript builtin
-TypedArrayPrototypeSet(
+transitioning javascript builtin TypedArrayPrototypeSet(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // Steps 2-8 are the same for
   // %TypedArray%.prototype.set ( array [ , offset ] ) and
@@ -109,10 +108,9 @@ TypedArrayPrototypeSet(
 
 // SetTypedArrayFromArrayLike
 // https://tc39.es/ecma262/#sec-settypedarrayfromarraylike
-transitioning macro
-TypedArrayPrototypeSetArray(implicit context: Context, receiver: JSAny)(
-    target: JSTypedArray, targetLength: uintptr, arrayArg: JSAny,
-    targetOffset: uintptr,
+transitioning macro TypedArrayPrototypeSetArray(
+    implicit context: Context, receiver: JSAny)(target: JSTypedArray,
+    targetLength: uintptr, arrayArg: JSAny, targetOffset: uintptr,
     targetOffsetOverflowed: bool): void labels IfOffsetOutOfBounds {
   // 4. Let src be ? ToObject(source).
   const src: JSReceiver = ToObject_Inline(context, arrayArg);
@@ -170,8 +168,8 @@ TypedArrayPrototypeSetArray(implicit context: Context, receiver: JSAny)(
 
 // SetTypedArrayFromTypedArray
 // https://tc39.es/ecma262/#sec-settypedarrayfromtypedarray
-transitioning macro
-TypedArrayPrototypeSetTypedArray(implicit context: Context, receiver: JSAny)(
+transitioning macro TypedArrayPrototypeSetTypedArray(
+    implicit context: Context, receiver: JSAny)(
     attachedTargetAndLength: AttachedJSTypedArrayAndLength,
     attachedSourceAndLength: AttachedJSTypedArrayAndLength,
     targetOffset: uintptr,
diff --git a/deps/v8/src/builtins/typed-array-slice.tq b/deps/v8/src/builtins/typed-array-slice.tq
index 0ac50a3ec7563d..ba4598ef739d6b 100644
--- a/deps/v8/src/builtins/typed-array-slice.tq
+++ b/deps/v8/src/builtins/typed-array-slice.tq
@@ -59,8 +59,9 @@ macro FastCopy(
   }
 }
 
-macro SlowCopy(implicit context: Context)(
-    src: JSTypedArray, dest: JSTypedArray, k: uintptr, final: uintptr): void {
+macro SlowCopy(
+    implicit context: Context)(src: JSTypedArray, dest: JSTypedArray,
+    k: uintptr, final: uintptr): void {
   if (typed_array::IsBigInt64ElementsKind(src.elements_kind) !=
       typed_array::IsBigInt64ElementsKind(dest.elements_kind))
     deferred {
diff --git a/deps/v8/src/builtins/typed-array-some.tq b/deps/v8/src/builtins/typed-array-some.tq
index bb2d951ec7b76d..b14b875eda8ac3 100644
--- a/deps/v8/src/builtins/typed-array-some.tq
+++ b/deps/v8/src/builtins/typed-array-some.tq
@@ -8,7 +8,8 @@ namespace typed_array {
 const kBuiltinNameSome: constexpr string = '%TypedArray%.prototype.some';
 
 // https://tc39.es/ecma262/#sec-%typedarray%.prototype.some
-transitioning macro SomeAllElements(implicit context: Context)(
+transitioning macro SomeAllElements(
+    implicit context: Context)(
     attachedArrayAndLength: typed_array::AttachedJSTypedArrayAndLength,
     callbackfn: Callable, thisArg: JSAny): Boolean {
   let witness =
@@ -51,8 +52,7 @@ transitioning macro SomeAllElements(implicit context: Context)(
 }
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.some
-transitioning javascript builtin
-TypedArrayPrototypeSome(
+transitioning javascript builtin TypedArrayPrototypeSome(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // arguments[0] = callback
   // arguments[1] = thisArg
@@ -73,7 +73,7 @@ TypedArrayPrototypeSome(
   } label IsDetachedOrOutOfBounds deferred {
     ThrowTypeError(MessageTemplate::kDetachedOperation, kBuiltinNameSome);
   } label NotCallable deferred {
-    ThrowTypeError(MessageTemplate::kCalledNonCallable, arguments[0]);
+    ThrowCalledNonCallable(arguments[0]);
   }
 }
 }
diff --git a/deps/v8/src/builtins/typed-array-sort.tq b/deps/v8/src/builtins/typed-array-sort.tq
index 5793bf92ba8768..00072e32080465 100644
--- a/deps/v8/src/builtins/typed-array-sort.tq
+++ b/deps/v8/src/builtins/typed-array-sort.tq
@@ -24,8 +24,7 @@ transitioning macro CallCompare(
 
 // Merges two sorted runs [from, middle) and [middle, to)
 // from "source" into "target".
-transitioning macro
-TypedArrayMerge(
+transitioning macro TypedArrayMerge(
     implicit context: Context, array: JSTypedArray, comparefn: Callable)(
     source: FixedArray, from: uintptr, middle: uintptr, to: uintptr,
     target: FixedArray): void {
@@ -57,10 +56,9 @@ TypedArrayMerge(
   }
 }
 
-transitioning builtin
-TypedArrayMergeSort(implicit context: Context)(
-    source: FixedArray, from: uintptr, to: uintptr, target: FixedArray,
-    array: JSTypedArray, comparefn: Callable): JSAny {
+transitioning builtin TypedArrayMergeSort(
+    implicit context: Context)(source: FixedArray, from: uintptr, to: uintptr,
+    target: FixedArray, array: JSTypedArray, comparefn: Callable): JSAny {
   dcheck(to - from > 1);
   const middle: uintptr = from + ((to - from) >>> 1);
 
@@ -80,9 +78,9 @@ TypedArrayMergeSort(implicit context: Context)(
 }
 
 // Shared between TypedArray.prototype.sort and TypedArray.prototype.toSorted.
-transitioning macro TypedArraySortCommon(implicit context: Context)(
-    array: JSTypedArray, len: uintptr, comparefnArg: Undefined|Callable,
-    isSort: constexpr bool): JSTypedArray {
+transitioning macro TypedArraySortCommon(
+    implicit context: Context)(array: JSTypedArray, len: uintptr,
+    comparefnArg: Undefined|Callable, isSort: constexpr bool): JSTypedArray {
   // Arrays of length 1 or less are considered sorted.
   if (len < 2) return array;
 
@@ -153,8 +151,8 @@ transitioning macro TypedArraySortCommon(implicit context: Context)(
 
 // https://tc39.github.io/ecma262/#sec-%typedarray%.prototype.sort
 transitioning javascript builtin TypedArrayPrototypeSort(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(...arguments): JSTypedArray {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): JSTypedArray {
   // 1. If comparefn is not undefined and IsCallable(comparefn) is false,
   //    throw a TypeError exception.
   const comparefnObj: JSAny = arguments[0];
diff --git a/deps/v8/src/builtins/typed-array-subarray.tq b/deps/v8/src/builtins/typed-array-subarray.tq
index d9506321b82be5..5cc481c98059d3 100644
--- a/deps/v8/src/builtins/typed-array-subarray.tq
+++ b/deps/v8/src/builtins/typed-array-subarray.tq
@@ -5,8 +5,8 @@
 namespace typed_array {
 // ES %TypedArray%.prototype.subarray
 transitioning javascript builtin TypedArrayPrototypeSubArray(
-    js-implicit context: NativeContext,
-    receiver: JSAny)(...arguments): JSTypedArray {
+    js-implicit context: NativeContext, receiver: JSAny)(
+    ...arguments): JSTypedArray {
   const methodName: constexpr string = '%TypedArray%.prototype.subarray';
 
   // 1. Let O be the this value.
diff --git a/deps/v8/src/builtins/typed-array-values.tq b/deps/v8/src/builtins/typed-array-values.tq
index a60aaaf707ff60..7f2711a67e5d79 100644
--- a/deps/v8/src/builtins/typed-array-values.tq
+++ b/deps/v8/src/builtins/typed-array-values.tq
@@ -9,8 +9,8 @@ const kBuiltinNameValues: constexpr string = '%TypedArray%.prototype.values';
 
 // %TypedArray%.values ()
 // https://tc39.github.io/ecma262/#sec-%typedarray%.values
-transitioning javascript builtin
-TypedArrayPrototypeValues(js-implicit context: NativeContext, receiver: JSAny)(
+transitioning javascript builtin TypedArrayPrototypeValues(
+    js-implicit context: NativeContext, receiver: JSAny)(
     ...arguments): JSArrayIterator {
   try {
     const array: JSTypedArray = Cast<JSTypedArray>(receiver)
diff --git a/deps/v8/src/builtins/typed-array-with.tq b/deps/v8/src/builtins/typed-array-with.tq
index c14de29364defc..78f74e1af84e10 100644
--- a/deps/v8/src/builtins/typed-array-with.tq
+++ b/deps/v8/src/builtins/typed-array-with.tq
@@ -7,8 +7,8 @@ const kBuiltinNameWith: constexpr string = '%TypedArray%.prototype.with';
 
 // https://tc39.es/proposal-change-array-by-copy/#sec-%typedarray%.prototype.with
 transitioning javascript builtin TypedArrayPrototypeWith(
-    js-implicit context: NativeContext, receiver: JSAny)(
-    index: JSAny, valueArg: JSAny): JSAny {
+    js-implicit context: NativeContext, receiver: JSAny)(index: JSAny,
+    valueArg: JSAny): JSAny {
   try {
     // 1. Let O be the this value.
     // 2. Perform ? ValidateTypedArray(O).
diff --git a/deps/v8/src/builtins/typed-array.tq b/deps/v8/src/builtins/typed-array.tq
index 26f2956a0d8592..404217a9fd2784 100644
--- a/deps/v8/src/builtins/typed-array.tq
+++ b/deps/v8/src/builtins/typed-array.tq
@@ -53,19 +53,19 @@ struct TypedArrayElementsInfo {
   sizeLog2: uintptr;
   kind: ElementsKind;
 }
-extern runtime TypedArrayCopyElements(
-    Context, JSTypedArray, Object, Number): void;
+extern runtime TypedArrayCopyElements(Context, JSTypedArray, Object, Number):
+    void;
 extern macro TypedArrayBuiltinsAssembler::ValidateTypedArray(
     Context, JSAny, constexpr string): JSTypedArray;
 extern macro TypedArrayBuiltinsAssembler::ValidateTypedArrayAndGetLength(
     Context, JSAny, constexpr string): uintptr;
 
-extern macro TypedArrayBuiltinsAssembler::CallCMemcpy(
-    RawPtr, RawPtr, uintptr): void;
+extern macro TypedArrayBuiltinsAssembler::CallCMemcpy(RawPtr, RawPtr, uintptr):
+    void;
 extern macro TypedArrayBuiltinsAssembler::CallCMemmove(
     RawPtr, RawPtr, uintptr): void;
-extern macro TypedArrayBuiltinsAssembler::CallCMemset(
-    RawPtr, intptr, uintptr): void;
+extern macro TypedArrayBuiltinsAssembler::CallCMemset(RawPtr, intptr, uintptr):
+    void;
 extern macro TypedArrayBuiltinsAssembler::CallCRelaxedMemcpy(
     RawPtr, RawPtr, uintptr): void;
 extern macro TypedArrayBuiltinsAssembler::CallCRelaxedMemmove(
@@ -182,8 +182,8 @@ extern macro TypedArrayBuiltinsAssembler::SetJSTypedArrayOffHeapDataPtr(
     JSTypedArray, RawPtr, uintptr): void;
 extern macro IsJSArrayBufferViewDetachedOrOutOfBounds(JSArrayBufferView):
     never labels DetachedOrOutOfBounds, NotDetachedNorOutOfBounds;
-extern macro IsJSArrayBufferViewDetachedOrOutOfBoundsBoolean(JSArrayBufferView):
-    bool;
+extern macro IsJSArrayBufferViewDetachedOrOutOfBoundsBoolean(
+    JSArrayBufferView): bool;
 
 // AttachedJSTypedArray guards that the array's buffer is not detached.
 transient type AttachedJSTypedArray extends JSTypedArray;
@@ -249,7 +249,8 @@ macro NewAttachedJSTypedArrayWitness(array: AttachedJSTypedArray):
   };
 }
 
-macro KindForArrayType<T : type extends ElementsKind>(): constexpr ElementsKind;
+macro KindForArrayType<T : type extends ElementsKind>():
+    constexpr ElementsKind;
 KindForArrayType<Uint8Elements>(): constexpr ElementsKind {
   return ElementsKind::UINT8_ELEMENTS;
 }
diff --git a/deps/v8/src/builtins/wasm-strings.tq b/deps/v8/src/builtins/wasm-strings.tq
new file mode 100644
index 00000000000000..8ef897fac58bb2
--- /dev/null
+++ b/deps/v8/src/builtins/wasm-strings.tq
@@ -0,0 +1,186 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// This file defines the builtins that are installed on the WebAssembly.String
+// object.
+
+macro Trap(context: Context, error: constexpr MessageTemplate): never {
+  runtime::ThrowWasmError(context, SmiConstant(error));
+}
+
+transitioning javascript builtin WebAssemblyStringFromWtf16Array(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const array = Cast<WasmArray>(arguments[0]) otherwise goto IllegalCast;
+    if (!wasm::IsWord16WasmArrayMap(array.map)) goto IllegalCast;
+    const start = ChangeNumberToUint32(ToInteger_Inline(arguments[1]));
+    const end = ChangeNumberToUint32(ToInteger_Inline(arguments[2]));
+    return wasm::WasmStringNewWtf16Array(array, start, end);
+  } label IllegalCast deferred {
+    if (arguments[0] == Null) {
+      Trap(context, MessageTemplate::kWasmTrapNullDereference);
+    }
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  }
+}
+
+const kWtf8: constexpr int31 generates 'unibrow::Utf8Variant::kWtf8';
+
+transitioning javascript builtin WebAssemblyStringFromWtf8Array(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const array = Cast<WasmArray>(arguments[0]) otherwise goto IllegalCast;
+    if (!wasm::IsWord8WasmArrayMap(array.map)) goto IllegalCast;
+    const start = ChangeNumberToUint32(ToInteger_Inline(arguments[1]));
+    const end = ChangeNumberToUint32(ToInteger_Inline(arguments[2]));
+    return wasm::WasmStringNewWtf8Array(start, end, array, SmiConstant(kWtf8));
+  } label IllegalCast deferred {
+    if (arguments[0] == Null) {
+      Trap(context, MessageTemplate::kWasmTrapNullDereference);
+    }
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  }
+}
+
+transitioning javascript builtin WebAssemblyStringToWtf16Array(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const string = Cast<String>(arguments[0]) otherwise goto IllegalCast;
+    const array = Cast<WasmArray>(arguments[1]) otherwise goto IllegalCast;
+    if (!wasm::IsWord16WasmArrayMap(array.map)) goto IllegalCast;
+    const start = ChangeNumberToUint32(ToInteger_Inline(arguments[2]));
+    const written = wasm::WasmStringEncodeWtf16Array(string, array, start);
+    return Convert<Smi>(written);
+  } label IllegalCast deferred {
+    if (arguments[1] == Null) {
+      Trap(context, MessageTemplate::kWasmTrapNullDereference);
+    }
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  }
+}
+
+transitioning javascript builtin WebAssemblyStringFromCharCode(
+    js-implicit context: Context)(...arguments): JSAny {
+  const code = ChangeNumberToUint32(ToInteger_Inline(arguments[0]));
+  return StringFromSingleCharCode(%RawDownCast<char16>(code & 0xFFFF));
+}
+
+transitioning javascript builtin WebAssemblyStringFromCodePoint(
+    js-implicit context: Context)(...arguments): JSAny {
+  const code = ToInteger_Inline(arguments[0]);
+  const codeUint = ChangeNumberToUint32(code);
+  if (codeUint <= 0xFFFF) {
+    return StringFromSingleCharCode(%RawDownCast<char16>(codeUint));
+  }
+  return runtime::WasmStringFromCodePoint(context, code);
+}
+
+transitioning javascript builtin WebAssemblyStringCodePointAt(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const string = Cast<String>(arguments[0]) otherwise goto IllegalCast;
+    const index = ChangeNumberToUint32(ToInteger_Inline(arguments[1]));
+    if (index >= Unsigned(string.length)) goto OOB;
+    const code: int32 = string::LoadSurrogatePairAt(
+        string, string.length_intptr, Signed(Convert<uintptr>(index)),
+        UnicodeEncoding::UTF32);
+    return Convert<Smi>(code);
+  } label IllegalCast deferred {
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  } label OOB deferred {
+    Trap(context, MessageTemplate::kWasmTrapStringOffsetOutOfBounds);
+  }
+}
+
+transitioning javascript builtin WebAssemblyStringCharCodeAt(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const string = Cast<String>(arguments[0]) otherwise goto IllegalCast;
+    const index = ChangeNumberToUint32(ToInteger_Inline(arguments[1]));
+    if (index >= Unsigned(string.length)) goto OOB;
+    const code: char16 = StringCharCodeAt(string, Convert<uintptr>(index));
+    return SmiTag(code);
+  } label IllegalCast deferred {
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  } label OOB deferred {
+    Trap(context, MessageTemplate::kWasmTrapStringOffsetOutOfBounds);
+  }
+}
+
+transitioning javascript builtin WebAssemblyStringLength(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const string = Cast<String>(arguments[0]) otherwise goto IllegalCast;
+    return string.length_smi;
+  } label IllegalCast deferred {
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  }
+}
+
+transitioning javascript builtin WebAssemblyStringConcat(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const first = Cast<String>(arguments[0]) otherwise goto IllegalCast;
+    const second = Cast<String>(arguments[1]) otherwise goto IllegalCast;
+    return StringAdd_CheckNone(first, second);
+  } label IllegalCast deferred {
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  }
+}
+
+transitioning javascript builtin WebAssemblyStringSubstring(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const string = Cast<String>(arguments[0]) otherwise goto IllegalCast;
+    const start = ChangeNumberToUint32(ToInteger_Inline(arguments[1]));
+    const end = ChangeNumberToUint32(ToInteger_Inline(arguments[2]));
+    return wasm::WasmStringViewWtf16Slice(string, start, end);
+  } label IllegalCast deferred {
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  }
+}
+
+transitioning javascript builtin WebAssemblyStringEquals(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const a = arguments[0];
+    const b = arguments[1];
+    if (a == Null) {
+      typeswitch (b) {
+        case (Null): {
+          return SmiConstant(1);
+        }
+        case (String): {
+          return SmiConstant(0);
+        }
+        case (JSAny): {
+          goto IllegalCast;
+        }
+      }
+    }
+    const left = Cast<String>(a) otherwise goto IllegalCast;
+    if (b == Null) return SmiConstant(0);
+    const right = Cast<String>(b) otherwise goto IllegalCast;
+    if (TaggedEqual(a, b)) return SmiConstant(1);
+    if (left.length != right.length) return SmiConstant(0);
+    if (wasm::StringEqual(kNoContext, left, right, left.length_intptr) ==
+        True) {
+      return SmiConstant(1);
+    }
+    return SmiConstant(0);
+  } label IllegalCast deferred {
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  }
+}
+
+transitioning javascript builtin WebAssemblyStringCompare(
+    js-implicit context: Context)(...arguments): JSAny {
+  try {
+    const first = Cast<String>(arguments[0]) otherwise goto IllegalCast;
+    const second = Cast<String>(arguments[1]) otherwise goto IllegalCast;
+    return StringCompare(first, second);
+  } label IllegalCast deferred {
+    Trap(context, MessageTemplate::kWasmTrapIllegalCast);
+  }
+}
diff --git a/deps/v8/src/builtins/wasm-to-js.tq b/deps/v8/src/builtins/wasm-to-js.tq
new file mode 100644
index 00000000000000..82751b72478f42
--- /dev/null
+++ b/deps/v8/src/builtins/wasm-to-js.tq
@@ -0,0 +1,270 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+namespace runtime {
+extern runtime TierUpWasmToJSWrapper(NoContext, WasmApiFunctionRef): JSAny;
+}  // namespace runtime
+
+namespace wasm {
+@export
+struct WasmToJSResult {
+  popCount: intptr;
+  result0: intptr;
+  result1: intptr;
+  result2: float64;
+  result3: float64;
+}
+
+extern builtin CallVarargs(
+    Context,
+    JSAny,      // target
+    int32,      // number of arguments already on the stack
+    int32,      // number of arguments in the FixedArray
+    FixedArray  // arguments list
+    ): JSAny;
+
+extern builtin IterableToFixedArrayForWasm(Context, JSAny, Smi): FixedArray;
+
+extern macro StackAlignmentInBytes(): intptr;
+
+const kSignatureOffset: constexpr intptr
+    generates 'WasmToJSWrapperConstants::kSignatureOffset';
+
+@export
+transitioning macro WasmToJSWrapper(ref: WasmApiFunctionRef): WasmToJSResult {
+  // Spill the signature on the stack so that it can be read by the GC. This is
+  // done in the very beginning before a GC could be triggered.
+  // Caller FP + return address.
+  const sigSlot = LoadFramePointer() + kSignatureOffset;
+  *GetRefAt<intptr>(sigSlot, 0) = BitcastTaggedToWord(ref.sig);
+  const sizeOfSig = StackAlignmentInBytes() / torque_internal::SizeOf<intptr>();
+
+  ModifyWasmToJSCounter(1);
+  ModifyThreadInWasmFlag(0);
+  // Trigger a wrapper tier-up when this function got called often enough.
+  dcheck(ref.wrapper_budget > 0);
+  ref.wrapper_budget = ref.wrapper_budget - 1;
+  if (ref.wrapper_budget == 0) {
+    runtime::TierUpWasmToJSWrapper(kNoContext, ref);
+  }
+
+  const signaturePod = &ref.sig.bytes;
+  const serializedSig = torque_internal::unsafe::NewConstSlice<int32>(
+      signaturePod.object, signaturePod.offset,
+      signaturePod.length / torque_internal::SizeOf<int32>());
+  const returnCount =
+      Convert<intptr>(*torque_internal::unsafe::NewReference<int32>(
+          serializedSig.object, serializedSig.offset));
+  const paramCount: intptr = serializedSig.length - returnCount - 1;
+  const returnTypes = Subslice(serializedSig, Convert<intptr>(1), returnCount)
+      otherwise unreachable;
+  const paramTypes = Subslice(serializedSig, returnCount + 1, paramCount)
+      otherwise unreachable;
+
+  const outParams = WasmAllocateFixedArray(paramCount + 1);
+  let nextIndex: intptr = 0;
+  // Set the receiver to `Undefined` as the default. If the receiver would be
+  // different, e.g. the global proxy for sloppy functions, then the CallVarargs
+  // builtin takes care of it automatically
+  outParams.objects[nextIndex++] = Undefined;
+
+  // Caller FP + return address + signature.
+  const stackParamStart =
+      LoadFramePointer() + (2 + sizeOfSig) * torque_internal::SizeOf<intptr>();
+  const inParams = torque_internal::unsafe::NewOffHeapReference(
+      %RawDownCast<RawPtr<intptr>>(stackParamStart));
+
+  let locationAllocator = LocationAllocatorForParams(inParams);
+
+  let paramIt = paramTypes.Iterator();
+
+  let hasTaggedParams: bool = false;
+  while (!paramIt.Empty()) {
+    const paramType = paramIt.NextNotEmpty();
+    if (paramType == kWasmI32Type) {
+      const slot = locationAllocator.GetGPSlot();
+      const val = *RefCast<int32>(slot);
+      outParams.objects[nextIndex++] = Convert<Number>(val);
+    } else if (paramType == kWasmF32Type) {
+      const slot = locationAllocator.GetFP32Slot();
+      const val = *RefCast<float32>(slot);
+      outParams.objects[nextIndex++] = Convert<Number>(val);
+    } else if (paramType == kWasmI64Type) {
+      if constexpr (Is64()) {
+        const slot = locationAllocator.GetGPSlot();
+        const val = *slot;
+        outParams.objects[nextIndex++] = I64ToBigInt(val);
+      } else {
+        const lowWordSlot = locationAllocator.GetGPSlot();
+        const highWordSlot = locationAllocator.GetGPSlot();
+        const lowWord = *lowWordSlot;
+        const highWord = *highWordSlot;
+        outParams.objects[nextIndex++] = I32PairToBigInt(lowWord, highWord);
+      }
+    } else if (paramType == kWasmF64Type) {
+      const slot = locationAllocator.GetFP64Slot();
+      const val = *RefCast<float64>(slot);
+      outParams.objects[nextIndex++] = Convert<Number>(val);
+    } else {
+      nextIndex++;
+      hasTaggedParams = true;
+    }
+  }
+
+  // Second loop for tagged parameters.
+  if (hasTaggedParams) {
+    locationAllocator.StartRefs();
+    nextIndex = 1;
+    paramIt = paramTypes.Iterator();
+    while (!paramIt.Empty()) {
+      const paramType = paramIt.NextNotEmpty();
+      const paramKind = paramType & kValueTypeKindBitsMask;
+      if (paramKind == ValueKind::kRef || paramKind == ValueKind::kRefNull) {
+        const slot = locationAllocator.GetGPSlot();
+        const rawRef = *slot;
+        const value = BitcastWordToTagged(rawRef);
+        outParams.objects[nextIndex] =
+            WasmToJSObject(ref.native_context, value, paramType);
+      }
+      nextIndex++;
+    }
+  }
+  const target = ref.callable;
+
+  const context = ref.native_context;
+  // Reset the signature on the stack, so that incoming parameters don't get
+  // scanned anymore. This performance optimization is possible because the
+  // incoming parameters are not accessed anymore.
+  *GetRefAt<intptr>(sigSlot, 0) = 0;
+
+  const result = CallVarargs(
+      context, target, 0, Convert<int32>(paramCount) + 1, outParams);
+
+  // Put a marker on the stack to indicate to the frame iterator that the call
+  // to JavaScript is finished. For asm.js source positions it is important to
+  // know if an exception happened in the call to JS, or in the ToNumber
+  // conversion afterwards.
+  *GetRefAt<intptr>(sigSlot, 0) = BitcastTaggedToWord(SmiConstant(2));
+  let resultFixedArray: FixedArray;
+  if (returnCount > 1) {
+    resultFixedArray =
+        IterableToFixedArrayForWasm(context, result, Convert<Smi>(returnCount));
+  } else {
+    resultFixedArray = kEmptyFixedArray;
+  }
+
+  const gpRegSlots = %RawDownCast<RawPtr<intptr>>(StackSlotPtr(
+      2 * torque_internal::SizeOf<intptr>(),
+      torque_internal::SizeOf<intptr>()));
+  const fpRegSlots = %RawDownCast<RawPtr<float64>>(StackSlotPtr(
+      2 * torque_internal::SizeOf<float64>(),
+      torque_internal::SizeOf<float64>()));
+  // The return area on the stack starts right after the stack area.
+  const stackSlots =
+      locationAllocator.GetAlignedStackEnd(StackAlignmentInBytes());
+  locationAllocator =
+      LocationAllocatorForReturns(gpRegSlots, fpRegSlots, stackSlots);
+
+  let returnIt = returnTypes.Iterator();
+  nextIndex = 0;
+  let hasTagged: bool = false;
+  while (!returnIt.Empty()) {
+    let retVal: JSAny;
+    if (returnCount == 1) {
+      retVal = result;
+    } else {
+      retVal = UnsafeCast<JSAny>(resultFixedArray.objects[nextIndex]);
+    }
+    const retType = returnIt.NextNotEmpty();
+    if (retType == kWasmI32Type) {
+      let toRef = locationAllocator.GetGPSlot();
+      typeswitch (retVal) {
+        case (smiVal: Smi): {
+          *toRef = Convert<intptr>(Unsigned(SmiToInt32(smiVal)));
+        }
+        case (heapVal: JSAnyNotSmi): {
+          *toRef = Convert<intptr>(Unsigned(WasmTaggedNonSmiToInt32(heapVal)));
+        }
+      }
+    } else if (retType == kWasmF32Type) {
+      let toRef = locationAllocator.GetFP32Slot();
+      *toRef = Convert<intptr>(Bitcast<uint32>(WasmTaggedToFloat32(retVal)));
+    } else if (retType == kWasmF64Type) {
+      let toRef = locationAllocator.GetFP64Slot();
+      *RefCast<float64>(toRef) = ChangeTaggedToFloat64(retVal);
+    } else if (retType == kWasmI64Type) {
+      if constexpr (Is64()) {
+        let toRef = locationAllocator.GetGPSlot();
+        const v = TruncateBigIntToI64(context, retVal);
+        *toRef = v;
+      } else {
+        let toLowRef = locationAllocator.GetGPSlot();
+        let toHighRef = locationAllocator.GetGPSlot();
+        const bigIntVal = ToBigInt(context, retVal);
+        const pair = BigIntToRawBytes(bigIntVal);
+        *toLowRef = Signed(pair.low);
+        *toHighRef = Signed(pair.high);
+      }
+    } else {
+      const converted = JSToWasmObject(context, ref.instance, retType, retVal);
+      let toRef = locationAllocator.GetGPSlot();
+      if (returnCount == 1) {
+        // There are no other values, we can write the object directly into the
+        // result buffer.
+        *toRef = BitcastTaggedToWord(converted);
+      } else {
+        // There may be other parameters that could still trigger a GC when they
+        // get transformed. For now we just store the converted value back in
+        // the FixedArray.
+        hasTagged = true;
+        resultFixedArray.objects[nextIndex] = converted;
+      }
+    }
+    nextIndex++;
+  }
+  if (hasTagged) {
+    returnIt = returnTypes.Iterator();
+    nextIndex = 0;
+    locationAllocator =
+        LocationAllocatorForReturns(gpRegSlots, fpRegSlots, stackSlots);
+    while (!returnIt.Empty()) {
+      const retType = returnIt.NextNotEmpty();
+      if (retType == kWasmI32Type) {
+        locationAllocator.GetGPSlot();
+      } else if (retType == kWasmF32Type) {
+        locationAllocator.GetFP32Slot();
+      } else if (retType == kWasmF64Type) {
+        locationAllocator.GetFP64Slot();
+      } else if (retType == kWasmI64Type) {
+        if constexpr (Is64()) {
+          locationAllocator.GetGPSlot();
+        } else {
+          locationAllocator.GetGPSlot();
+          locationAllocator.GetGPSlot();
+        }
+      } else {
+        let toRef = locationAllocator.GetGPSlot();
+        const value = resultFixedArray.objects[nextIndex];
+        *toRef = BitcastTaggedToWord(value);
+      }
+      nextIndex++;
+    }
+  }
+
+  const popCount =
+      (Convert<intptr>(stackSlots) - Convert<intptr>(stackParamStart)) /
+          torque_internal::SizeOf<intptr>() +
+      sizeOfSig;
+
+  ModifyThreadInWasmFlag(1);
+  ModifyWasmToJSCounter(-1);
+  return WasmToJSResult{
+    popCount: popCount,
+    result0: *GetRefAt<intptr>(gpRegSlots, 0),
+    result1: *GetRefAt<intptr>(gpRegSlots, torque_internal::SizeOf<intptr>()),
+    result2: *GetRefAt<float64>(fpRegSlots, 0),
+    result3: *GetRefAt<float64>(fpRegSlots, torque_internal::SizeOf<float64>())
+  };
+}
+}  // namespace wasm
diff --git a/deps/v8/src/builtins/wasm.tq b/deps/v8/src/builtins/wasm.tq
index 5fe8fd6a048741..622d0bea4127cb 100644
--- a/deps/v8/src/builtins/wasm.tq
+++ b/deps/v8/src/builtins/wasm.tq
@@ -5,21 +5,24 @@
 #include 'src/builtins/builtins-wasm-gen.h'
 
 namespace runtime {
-extern runtime WasmMemoryGrow(Context, WasmInstanceObject, Smi): Smi;
+extern runtime WasmMemoryGrow(Context, WasmInstanceObject, Smi, Smi): Smi;
 extern runtime WasmRefFunc(Context, WasmInstanceObject, Smi): JSAny;
+extern runtime WasmInternalFunctionCreateExternal(
+    Context, WasmInternalFunction): JSFunction;
 extern runtime WasmTableInit(
     Context, WasmInstanceObject, Object, Object, Smi, Smi, Smi): JSAny;
 extern runtime WasmTableCopy(
     Context, WasmInstanceObject, Object, Object, Smi, Smi, Smi): JSAny;
 extern runtime WasmTableFill(
     Context, WasmInstanceObject, Smi, Smi, Object, Smi): JSAny;
-extern runtime WasmTableGrow(
-    Context, WasmInstanceObject, Smi, Object, Smi): Smi;
-extern runtime WasmFunctionTableGet(
-    Context, WasmInstanceObject, Smi, Smi): JSAny;
+extern runtime WasmTableGrow(Context, WasmInstanceObject, Smi, Object, Smi):
+    Smi;
+extern runtime WasmFunctionTableGet(Context, WasmInstanceObject, Smi, Smi):
+    JSAny;
 extern runtime WasmFunctionTableSet(
     Context, WasmInstanceObject, Smi, Smi, Object): JSAny;
-extern runtime ThrowWasmError(Context, Smi): JSAny;
+extern runtime ThrowRangeError(Context, Smi): never;
+extern runtime ThrowWasmError(Context, Smi): never;
 extern runtime WasmThrowTypeError(Context, Smi, JSAny): never;
 extern runtime WasmThrow(Context, Object, FixedArray): JSAny;
 extern runtime WasmReThrow(Context, Object): JSAny;
@@ -30,19 +33,23 @@ extern runtime WasmTraceMemory(Context, Smi): JSAny;
 extern runtime WasmTraceEnter(Context): JSAny;
 extern runtime WasmTraceExit(Context, Smi): JSAny;
 extern runtime WasmAtomicNotify(
-    Context, WasmInstanceObject, Number, Number): Smi;
+    Context, WasmInstanceObject, Smi, Number, Number): Smi;
 extern runtime WasmI32AtomicWait(
-    Context, WasmInstanceObject, Number, Number, BigInt): Smi;
+    Context, WasmInstanceObject, Smi, Number, Number, BigInt): Smi;
 extern runtime WasmI64AtomicWait(
-    Context, WasmInstanceObject, Number, BigInt, BigInt): Smi;
-extern runtime WasmArrayCopy(
-    Context, WasmArray, Smi, WasmArray, Smi, Smi): JSAny;
+    Context, WasmInstanceObject, Smi, Number, BigInt, BigInt): Smi;
+extern runtime WasmArrayCopy(Context, WasmArray, Smi, WasmArray, Smi, Smi):
+    JSAny;
 extern runtime WasmArrayNewSegment(
     Context, WasmInstanceObject, Smi, Smi, Smi, Map): Object;
+extern runtime WasmStringNewSegmentWtf8(
+    Context, WasmInstanceObject, Smi, Smi, Smi): String;
+extern runtime WasmArrayInitSegment(
+    Context, WasmInstanceObject, Smi, WasmArray, Smi, Smi, Smi): JSAny;
 extern runtime WasmStringNewWtf8(
     Context, WasmInstanceObject, Smi, Smi, Number, Number): String|Null;
-extern runtime WasmStringNewWtf8Array(
-    Context, Smi, WasmArray, Smi, Smi): String|Null;
+extern runtime WasmStringNewWtf8Array(Context, Smi, WasmArray, Smi, Smi): String
+    |Null;
 extern runtime WasmStringNewWtf16(
     Context, WasmInstanceObject, Smi, Number, Number): String;
 extern runtime WasmStringNewWtf16Array(Context, WasmArray, Smi, Smi): String;
@@ -58,15 +65,16 @@ extern runtime WasmStringEncodeWtf16(
 extern runtime WasmStringAsWtf8(Context, String): ByteArray;
 extern runtime WasmStringViewWtf8Encode(
     Context, WasmInstanceObject, Smi, ByteArray, Number, Number, Number): JSAny;
-extern runtime WasmStringViewWtf8Slice(
-    Context, ByteArray, Number, Number): String;
+extern runtime WasmStringViewWtf8Slice(Context, ByteArray, Number, Number):
+    String;
 extern runtime WasmStringFromCodePoint(Context, Number): String;
 extern runtime WasmStringHash(NoContext, String): Smi;
+extern runtime WasmSubstring(Context, String, Smi, Smi): String;
 extern runtime WasmJSToWasmObject(Context, JSAny, Smi): JSAny;
 }
 
 namespace unsafe {
-extern macro TimesTaggedSize(intptr): intptr;
+extern macro Allocate(intptr): HeapObject;
 extern macro Allocate(intptr, constexpr AllocationFlag): HeapObject;
 }
 
@@ -76,12 +84,13 @@ const kAnyType: constexpr int31
 const kMaxPolymorphism:
     constexpr int31 generates 'wasm::kMaxPolymorphism';
 
-extern macro WasmBuiltinsAssembler::LoadInstanceFromFrame(): WasmInstanceObject;
+extern macro WasmBuiltinsAssembler::LoadInstanceFromFrame():
+    WasmInstanceObject;
 
 // WasmInstanceObject has a field layout that Torque can't handle yet.
 // TODO(bbudge) Eliminate these functions when Torque is ready.
-extern macro WasmBuiltinsAssembler::LoadContextFromInstance(WasmInstanceObject):
-    NativeContext;
+extern macro WasmBuiltinsAssembler::LoadContextFromInstance(
+    WasmInstanceObject): NativeContext;
 extern macro WasmBuiltinsAssembler::LoadTablesFromInstance(WasmInstanceObject):
     FixedArray;
 extern macro WasmBuiltinsAssembler::LoadInternalFunctionsFromInstance(
@@ -91,6 +100,8 @@ extern macro WasmBuiltinsAssembler::LoadManagedObjectMapsFromInstance(
 extern macro WasmBuiltinsAssembler::LoadContextFromWasmOrJsFrame():
     NativeContext;
 
+extern macro WasmBuiltinsAssembler::StringToFloat64(String): float64;
+
 macro LoadContextFromFrame(): NativeContext {
   return LoadContextFromInstance(LoadInstanceFromFrame());
 }
@@ -99,19 +110,24 @@ builtin WasmInt32ToHeapNumber(val: int32): HeapNumber {
   return AllocateHeapNumberWithValue(Convert<float64>(val));
 }
 
-builtin WasmFuncRefToJS(val: WasmInternalFunction|WasmNull): JSFunction|Null|
-    Undefined {
+builtin WasmFuncRefToJS(
+    implicit context: Context)(val: WasmInternalFunction|WasmNull): JSFunction
+    |Null {
   typeswitch (val) {
     case (WasmNull): {
       return Null;
     }
     case (func: WasmInternalFunction): {
-      return func.external;
+      const maybeExternal: Object = func.external;
+      if (maybeExternal != Undefined) {
+        return %RawDownCast<JSFunction>(maybeExternal);
+      }
+      tail runtime::WasmInternalFunctionCreateExternal(context, func);
     }
   }
 }
 
-builtin WasmTaggedNonSmiToInt32(implicit context: Context)(val: JSAnyNotSmi):
+builtin WasmTaggedNonSmiToInt32(implicit context: Context)(val: HeapObject):
     int32 {
   return ChangeTaggedNonSmiToInt32(val);
 }
@@ -120,13 +136,18 @@ builtin WasmTaggedToFloat64(implicit context: Context)(val: JSAny): float64 {
   return ChangeTaggedToFloat64(val);
 }
 
-builtin WasmMemoryGrow(numPages: int32): int32 {
+builtin WasmTaggedToFloat32(implicit context: Context)(val: JSAny): float32 {
+  return TruncateFloat64ToFloat32(ChangeTaggedToFloat64(val));
+}
+
+builtin WasmMemoryGrow(memIndex: int32, numPages: int32): int32 {
+  dcheck(IsValidPositiveSmi(ChangeInt32ToIntPtr(memIndex)));
   if (!IsValidPositiveSmi(ChangeInt32ToIntPtr(numPages)))
     return Int32Constant(-1);
   const instance: WasmInstanceObject = LoadInstanceFromFrame();
   const context: NativeContext = LoadContextFromInstance(instance);
-  const result: Smi =
-      runtime::WasmMemoryGrow(context, instance, SmiFromInt32(numPages));
+  const result: Smi = runtime::WasmMemoryGrow(
+      context, instance, SmiFromInt32(memIndex), SmiFromInt32(numPages));
   return SmiToInt32(result);
 }
 
@@ -266,8 +287,8 @@ builtin WasmTableGetFuncRef(tableIndex: intptr, index: int32): Object {
   }
 }
 
-builtin WasmTableSetFuncRef(
-    tableIndex: intptr, index: int32, value: Object): Object {
+builtin WasmTableSetFuncRef(tableIndex: intptr, index: int32, value: Object):
+    Object {
   const instance: WasmInstanceObject = LoadInstanceFromFrame();
   const entryIndex: intptr = ChangeInt32ToIntPtr(index);
   try {
@@ -305,6 +326,11 @@ builtin WasmRefFunc(index: uint32): Object {
   }
 }
 
+builtin WasmInternalFunctionCreateExternal(
+    context: Context, func: WasmInternalFunction): JSFunction {
+  return runtime::WasmInternalFunctionCreateExternal(context, func);
+}
+
 builtin WasmAllocateFixedArray(size: intptr): FixedArray {
   if (size == 0) return kEmptyFixedArray;
   return UnsafeCast<FixedArray>(AllocateFixedArray(
@@ -359,9 +385,7 @@ builtin WasmAllocateJSArray(implicit context: Context)(size: Smi): JSArray {
 }
 
 builtin WasmAllocateStructWithRtt(rtt: Map, instanceSize: int32): HeapObject {
-  const result: HeapObject = unsafe::Allocate(
-      Convert<intptr>(instanceSize),
-      AllocationFlag::kAllowLargeObjectAllocation);
+  const result: HeapObject = unsafe::Allocate(Convert<intptr>(instanceSize));
   *UnsafeConstCast(&result.map) = rtt;
   // TODO(ishell): consider removing properties_or_hash field from WasmObjects.
   %RawDownCast<WasmStruct>(result).properties_or_hash = kEmptyFixedArray;
@@ -376,8 +400,7 @@ builtin WasmAllocateArray_Uninitialized(
       torque_internal::AlignTagged(
           Convert<intptr>(length) * Convert<intptr>(elementSize)) +
       Convert<intptr>(kWasmArrayHeaderSize);
-  const result: HeapObject = unsafe::Allocate(
-      instanceSize, AllocationFlag::kAllowLargeObjectAllocation);
+  const result: HeapObject = unsafe::Allocate(instanceSize);
   *UnsafeConstCast(&result.map) = rtt;
   // TODO(ishell): consider removing properties_or_hash field from WasmObjects.
   %RawDownCast<WasmArray>(result).properties_or_hash = kEmptyFixedArray;
@@ -386,22 +409,56 @@ builtin WasmAllocateArray_Uninitialized(
 }
 
 builtin WasmArrayNewSegment(
-    dataSegment: uint32, offset: uint32, length: uint32, rtt: Map): Object {
+    segmentIndex: uint32, offset: uint32, length: uint32, isElement: Smi,
+    rtt: Map): Object {
   const instance = LoadInstanceFromFrame();
   try {
-    const smiOffset =
-        Convert<PositiveSmi>(offset) otherwise ElementSegmentOutOfBounds;
+    const smiOffset = Convert<PositiveSmi>(offset) otherwise SegmentOutOfBounds;
     const smiLength = Convert<PositiveSmi>(length) otherwise ArrayTooLarge;
     tail runtime::WasmArrayNewSegment(
-        LoadContextFromInstance(instance), instance, SmiFromUint32(dataSegment),
-        smiOffset, smiLength, rtt);
-  } label ElementSegmentOutOfBounds {
-    tail ThrowWasmTrapElementSegmentOutOfBounds();
+        LoadContextFromInstance(instance), instance,
+        SmiFromUint32(segmentIndex), smiOffset, smiLength, rtt);
+  } label SegmentOutOfBounds {
+    if (isElement == SmiConstant(0)) {
+      tail ThrowWasmTrapDataSegmentOutOfBounds();
+    } else {
+      tail ThrowWasmTrapElementSegmentOutOfBounds();
+    }
   } label ArrayTooLarge {
     tail ThrowWasmTrapArrayTooLarge();
   }
 }
 
+// {segmentIndex} has to be tagged as a possible stack parameter.
+builtin WasmArrayInitSegment(
+    arrayIndex: uint32, segmentOffset: uint32, length: uint32,
+    segmentIndex: Smi, isElement: Smi, arrayRaw: HeapObject): JSAny {
+  const instance = LoadInstanceFromFrame();
+  if (arrayRaw == kWasmNull) {
+    tail ThrowWasmTrapNullDereference();
+  }
+  const array = %RawDownCast<WasmArray>(arrayRaw);
+  try {
+    const smiArrayIndex =
+        Convert<PositiveSmi>(arrayIndex) otherwise ArrayOutOfBounds;
+    const smiOffset =
+        Convert<PositiveSmi>(segmentOffset) otherwise SegmentOutOfBounds;
+    const smiLength = Convert<PositiveSmi>(length) otherwise ArrayOutOfBounds;
+
+    tail runtime::WasmArrayInitSegment(
+        LoadContextFromInstance(instance), instance, segmentIndex, array,
+        smiArrayIndex, smiOffset, smiLength);
+  } label SegmentOutOfBounds {
+    if (isElement == SmiConstant(0)) {
+      tail ThrowWasmTrapDataSegmentOutOfBounds();
+    } else {
+      tail ThrowWasmTrapElementSegmentOutOfBounds();
+    }
+  } label ArrayOutOfBounds {
+    tail ThrowWasmTrapArrayOutOfBounds();
+  }
+}
+
 // We put all uint32 parameters at the beginning so that they are assigned to
 // registers.
 builtin WasmArrayCopyWithChecks(
@@ -435,40 +492,6 @@ builtin WasmArrayCopy(
       SmiFromUint32(srcIndex), SmiFromUint32(length));
 }
 
-// Redeclaration with different typing (value is an Object, not JSAny).
-extern transitioning runtime
-CreateDataProperty(implicit context: Context)(JSReceiver, JSAny, Object): void;
-
-transitioning builtin WasmAllocateObjectWrapper(implicit context: Context)(
-    obj: Object): JSObject {
-  // Note: {obj} can be null, or i31ref. The code below is agnostic to that.
-  const wrapper = NewJSObject();
-  const symbol = WasmWrappedObjectSymbolConstant();
-  CreateDataProperty(wrapper, symbol, obj);
-  return wrapper;
-}
-
-builtin WasmSubtypeCheck(objectSupertypes: FixedArray, rtt: Map): int32 {
-  const rttSupertypeLength: Smi =
-      %RawDownCast<WasmTypeInfo>(
-          rtt.constructor_or_back_pointer_or_native_context)
-          .supertypes_length;
-
-  if (objectSupertypes.length <= rttSupertypeLength) {
-    return 0;
-  }
-
-  const supertype: Map = %RawDownCast<Map>(
-      LoadFixedArrayElement(objectSupertypes, rttSupertypeLength));
-
-  if (supertype == rtt) return 1;
-  return 0;
-}
-
-builtin WasmInt32ToNumber(value: int32): Number {
-  return ChangeInt32ToTagged(value);
-}
-
 builtin WasmUint32ToNumber(value: uint32): Number {
   return ChangeUint32ToTagged(value);
 }
@@ -483,47 +506,52 @@ builtin UintPtr53ToNumber(value: uintptr): Number {
 }
 
 extern builtin I64ToBigInt(intptr): BigInt;
+extern builtin I32PairToBigInt(/*low*/ intptr, /*high*/ intptr): BigInt;
 
-builtin WasmAtomicNotify(offset: uintptr, count: uint32): uint32 {
+builtin WasmAtomicNotify(memoryIndex: int32, offset: uintptr, count: uint32):
+    uint32 {
   const instance: WasmInstanceObject = LoadInstanceFromFrame();
   const result: Smi = runtime::WasmAtomicNotify(
-      LoadContextFromInstance(instance), instance, UintPtr53ToNumber(offset),
-      WasmUint32ToNumber(count));
+      LoadContextFromInstance(instance), instance, SmiFromInt32(memoryIndex),
+      UintPtr53ToNumber(offset), WasmUint32ToNumber(count));
   return Unsigned(SmiToInt32(result));
 }
 
 builtin WasmI32AtomicWait(
-    offset: uintptr, expectedValue: int32, timeout: BigInt): uint32 {
+    memIndex: int32, offset: uintptr, expectedValue: int32,
+    timeout: BigInt): uint32 {
   const instance: WasmInstanceObject = LoadInstanceFromFrame();
   const result: Smi = runtime::WasmI32AtomicWait(
-      LoadContextFromInstance(instance), instance, UintPtr53ToNumber(offset),
-      WasmInt32ToNumber(expectedValue), timeout);
+      LoadContextFromInstance(instance), instance, SmiFromInt32(memIndex),
+      UintPtr53ToNumber(offset), ChangeInt32ToTagged(expectedValue), timeout);
   return Unsigned(SmiToInt32(result));
 }
 
 builtin WasmI64AtomicWait(
-    offset: uintptr, expectedValue: BigInt, timeout: BigInt): uint32 {
+    memIndex: int32, offset: uintptr, expectedValue: BigInt,
+    timeout: BigInt): uint32 {
   const instance: WasmInstanceObject = LoadInstanceFromFrame();
   const result: Smi = runtime::WasmI64AtomicWait(
-      LoadContextFromInstance(instance), instance, UintPtr53ToNumber(offset),
-      expectedValue, timeout);
+      LoadContextFromInstance(instance), instance, SmiFromInt32(memIndex),
+      UintPtr53ToNumber(offset), expectedValue, timeout);
   return Unsigned(SmiToInt32(result));
 }
 
 // Type feedback collection support for `call_ref`.
 
-extern macro GetCodeEntry(Code): RawPtr;
+extern macro LoadCodeInstructionStart(Code): RawPtr;
 
 struct TargetAndInstance {
   target: RawPtr;
   instance: HeapObject;  // WasmInstanceObject or WasmApiFunctionRef
 }
 
-macro GetTargetAndInstance(funcref: WasmInternalFunction): TargetAndInstance {
+macro GetTargetAndInstance(funcref: WasmInternalFunction):
+    TargetAndInstance {
   const ref = funcref.ref;
   let target = funcref.call_target_ptr;
   if (Signed(target) == IntPtrConstant(0)) {
-    target = GetCodeEntry(funcref.code);
+    target = LoadCodeInstructionStart(funcref.code);
   }
   return TargetAndInstance{target: target, instance: ref};
 }
@@ -611,11 +639,11 @@ type OnNonExistent constexpr 'OnNonExistent';
 const kReturnUndefined: constexpr OnNonExistent
     generates 'OnNonExistent::kReturnUndefined';
 extern macro SmiConstant(constexpr OnNonExistent): Smi;
-extern transitioning builtin GetPropertyWithReceiver(implicit context: Context)(
-    JSAny, Name, JSAny, Smi): JSAny;
+extern transitioning builtin GetPropertyWithReceiver(
+    implicit context: Context)(JSAny, Name, JSAny, Smi): JSAny;
 
-transitioning builtin WasmGetOwnProperty(implicit context: Context)(
-    object: Object, uniqueName: Name): JSAny {
+transitioning builtin WasmGetOwnProperty(
+    implicit context: Context)(object: Object, uniqueName: Name): JSAny {
   try {
     const heapObject: HeapObject =
         TaggedToHeapObject(object) otherwise NotFound;
@@ -709,23 +737,6 @@ builtin ThrowWasmTrapStringOffsetOutOfBounds(): JSAny {
   tail WasmTrap(SmiConstant(MessageTemplate::kWasmTrapStringOffsetOutOfBounds));
 }
 
-macro TryNumberToIntptr(value: JSAny): intptr labels Failure {
-  typeswitch (value) {
-    case (s: Smi): {
-      return Convert<intptr>(s);
-    }
-    case (hn: HeapNumber): deferred {
-      let value = Convert<float64>(hn);
-      if (Float64IsNaN(value)) goto Failure;
-      value = math::Float64Trunc(value);
-      return ChangeFloat64ToIntPtr(value);
-    }
-    case (JSAny): deferred {
-      goto Failure;
-    }
-  }
-}
-
 macro WasmTypeInfo(map: Map): WasmTypeInfo {
   return UnsafeCast<WasmTypeInfo>(
       map.constructor_or_back_pointer_or_native_context);
@@ -733,6 +744,8 @@ macro WasmTypeInfo(map: Map): WasmTypeInfo {
 
 const kWasmI16ValueType: constexpr int32
     generates 'wasm::ValueType::Primitive(wasm::kI16).raw_bit_field()';
+const kWasmI8ValueType: constexpr int32
+    generates 'wasm::ValueType::Primitive(wasm::kI8).raw_bit_field()';
 
 const kWasmArrayTypeRepOffset:
     constexpr intptr generates 'wasm::ArrayType::kRepOffset';
@@ -748,69 +761,47 @@ macro IsWord16WasmArrayMap(map: Map): bool {
   return *arrayTypeRef == kWasmI16ValueType;
 }
 
-// Non-standard experimental feature.
-// Arguments: array, start, count.
-transitioning javascript builtin ExperimentalWasmConvertArrayToString(
-    js-implicit context: NativeContext)(...arguments): String {
-  try {
-    if (arguments.length != 3) goto InvalidArgument;
-    const array = Cast<WasmArray>(arguments[0]) otherwise goto InvalidArgument;
-    const start = TryNumberToIntptr(arguments[1])
-        otherwise goto InvalidArgument;
-    const count = TryNumberToIntptr(arguments[2])
-        otherwise goto InvalidArgument;
-
-    if (!IsWord16WasmArrayMap(array.map)) goto InvalidArgument;
-    const arrayContent = torque_internal::unsafe::NewConstSlice<char16>(
-        array, kWasmArrayHeaderSize, Convert<intptr>(array.length));
+macro IsWord8WasmArrayMap(map: Map): bool {
+  const arrayTypePtr: RawPtr<int32> = %RawDownCast<RawPtr<int32>>(
+      WasmTypeInfo(map).native_type_ptr + kWasmArrayTypeRepOffset +
+      kWasmValueTypeBitFieldOffset);
+  const arrayTypeRef: &int32 =
+      torque_internal::unsafe::NewOffHeapReference(arrayTypePtr);
+  return *arrayTypeRef == kWasmI8ValueType;
+}
 
-    return AllocateSeqTwoByteString(
-        Convert<uint32>(Unsigned(count)),
-        (Subslice(arrayContent, start, count) otherwise goto InvalidArgument)
-            .Iterator());
-  } label InvalidArgument deferred {
-    ThrowTypeError(MessageTemplate::kInvalidArgument);
-  }
+macro GetRefAt<T: type, From: type>(base: From, offset: intptr): &T {
+  return torque_internal::unsafe::NewOffHeapReference<T>(
+      %RawDownCast<RawPtr<T>>(base + offset));
 }
 
-// Non-standard experimental feature.
-// Arguments: string, sampleArray.
-transitioning javascript builtin ExperimentalWasmConvertStringToArray(
-    js-implicit context: NativeContext)(...arguments): WasmArray {
-  try {
-    if (arguments.length != 2) goto InvalidArgument;
-    const string = Cast<String>(arguments[0]) otherwise goto InvalidArgument;
-    const sampleArray =
-        Cast<WasmArray>(arguments[1]) otherwise goto InvalidArgument;
-    const arrayMap = sampleArray.map;
-    if (!IsWord16WasmArrayMap(arrayMap)) goto InvalidArgument;
+extern macro LoadPointerFromRootRegister(intptr): RawPtr;
 
-    const length = string.length;
+const kThreadInWasmFlagAddressOffset: constexpr intptr
+    generates 'Isolate::thread_in_wasm_flag_address_offset()';
 
-    const result =
-        WasmAllocateArray_Uninitialized(arrayMap, Unsigned(length), 2);
-    const arrayContent = torque_internal::unsafe::NewMutableSlice<char16>(
-        result, kWasmArrayHeaderSize, Convert<intptr>(length));
-    try {
-      StringToSlice(string) otherwise OneByte, TwoByte;
-    } label OneByte(slice: ConstSlice<char8>) {
-      let fromIt = slice.Iterator();
-      let toIt = arrayContent.Iterator();
-      while (true) {
-        let toRef = toIt.NextReference() otherwise break;
-        *toRef = %RawDownCast<char16>(Convert<uint16>(fromIt.NextNotEmpty()));
-      }
-    } label TwoByte(slice: ConstSlice<char16>) {
-      let fromIt = slice.Iterator();
-      let toIt = arrayContent.Iterator();
-      while (true) {
-        let toRef = toIt.NextReference() otherwise break;
-        *toRef = fromIt.NextNotEmpty();
-      }
+const kActiveSuspenderOffset: constexpr intptr
+    generates 'IsolateData::root_slot_offset(RootIndex::kActiveSuspender)';
+
+macro ModifyThreadInWasmFlag(newValue: int32): void {
+  const threadInWasmFlagAddress =
+      LoadPointerFromRootRegister(kThreadInWasmFlagAddressOffset);
+  const threadInWasmFlagRef = GetRefAt<int32>(threadInWasmFlagAddress, 0);
+  *threadInWasmFlagRef = newValue;
+}
+
+macro ModifyWasmToJSCounter(increment: int32): void {
+  const rootSlot = LoadPointerFromRootRegister(kActiveSuspenderOffset);
+
+  const rawSuspender = BitcastWordToTagged(rootSlot);
+  typeswitch (rawSuspender) {
+    case (activeSuspender: WasmSuspenderObject): {
+      const current = Signed(activeSuspender.wasm_to_js_counter);
+      activeSuspender.wasm_to_js_counter = Unsigned(current + increment);
+    }
+    case (Object): {
+      // Nothing to do, but the case is needed by the Torque compiler.
     }
-    return result;
-  } label InvalidArgument deferred {
-    ThrowTypeError(MessageTemplate::kInvalidArgument);
   }
 }
 
@@ -822,9 +813,10 @@ builtin WasmStringNewWtf8(
       WasmUint32ToNumber(offset), WasmUint32ToNumber(size));
 }
 builtin WasmStringNewWtf8Array(
-    start: uint32, end: uint32, array: WasmArray, utf8Variant: Smi): String|
-    Null {
-  const context = LoadContextFromFrame();
+    start: uint32, end: uint32, array: WasmArray, utf8Variant: Smi): String
+    |Null {
+  // This can be called from Wasm and from WebAssembly.String.* JS builtins.
+  const context = LoadContextFromWasmOrJsFrame();
   try {
     if (array.length < end) goto OffsetOutOfRange;
     if (end < start) goto OffsetOutOfRange;
@@ -833,11 +825,10 @@ builtin WasmStringNewWtf8Array(
   } label OffsetOutOfRange deferred {
     const error = MessageTemplate::kWasmTrapArrayOutOfBounds;
     runtime::ThrowWasmError(context, SmiConstant(error));
-    unreachable;
   }
 }
-builtin WasmStringNewWtf16(
-    memory: uint32, offset: uint32, size: uint32): String {
+builtin WasmStringNewWtf16(memory: uint32, offset: uint32, size: uint32):
+    String {
   const instance = LoadInstanceFromFrame();
   tail runtime::WasmStringNewWtf16(
       LoadContextFromInstance(instance), instance, SmiFromUint32(memory),
@@ -846,26 +837,98 @@ builtin WasmStringNewWtf16(
 
 struct TwoByteToOneByteIterator {
   macro Next(): char8 labels NoMore {
-    if (this.offset == this.end_offset) goto NoMore;
+    if (this.start == this.end) goto NoMore;
     const raw: char16 = *torque_internal::unsafe::NewReference<char16>(
-        this.array, this.offset);
+        this.object, this.start);
     const result: char8 = %RawDownCast<char8>(raw & 0xFF);
-    this.offset += 2;
+    this.start += 2;
     return result;
   }
 
-  array: WasmArray;
-  offset: intptr;
-  end_offset: intptr;
+  object: HeapObject|TaggedZeroPattern;
+  start: intptr;
+  end: intptr;
+}
+
+macro StringFromTwoByteSlice(length: uint32, slice: ConstSlice<char16>):
+    String {
+  // Ideas for additional future improvements:
+  // (1) We could add a fast path for very short strings, e.g. <= 8 chars,
+  //     and just allocate two-byte strings for them. That would save time
+  //     here, and would only waste a couple of bytes at most. A concern is
+  //     that such strings couldn't take one-byte fast paths later on, e.g.
+  //     in toLower/toUpper case conversions.
+  // (2) We could load more than one array element at a time, e.g. using
+  //     intptr-wide loads, or possibly even wider SIMD instructions. We'd
+  //     have to make sure that non-aligned start offsets are handled,
+  //     and the implementation would become more platform-specific.
+  // (3) We could shift the problem around by allocating two-byte strings
+  //     here and checking whether they're one-byte-compatible later, e.g.
+  //     when promoting them from new to old space. Drawback: rewriting
+  //     strings to different maps isn't great for optimized code that's
+  //     based on collected type feedback, or that wants to elide duplicate
+  //     map checks within the function.
+  // (4) We could allocate space for a two-byte string, then optimistically
+  //     start writing one-byte characters into it, and then either restart
+  //     in two-byte mode if needed, or return the over-allocated bytes to
+  //     the allocator in the end.
+  // (5) We could standardize a `string.new_ascii_array` instruction, which
+  //     could safely produce one-byte strings without checking characters.
+  //     See https://github.com/WebAssembly/stringref/issues/53.
+
+  try {
+    // To reduce the amount of branching, check 8 code units at a time. The
+    // tradeoff for choosing 8 is that we want to check for early termination
+    // of the loop often (to avoid unnecessary work) but not too often
+    // (because each check has a cost).
+    let i: intptr = 0;
+    const intptrLength = slice.length;
+    const eightElementLoopEnd = intptrLength - 8;
+    while (i <= eightElementLoopEnd) {
+      const bits = Convert<uint32>(*slice.UncheckedAtIndex(i)) |
+          Convert<uint32>(*slice.UncheckedAtIndex(i + 1)) |
+          Convert<uint32>(*slice.UncheckedAtIndex(i + 2)) |
+          Convert<uint32>(*slice.UncheckedAtIndex(i + 3)) |
+          Convert<uint32>(*slice.UncheckedAtIndex(i + 4)) |
+          Convert<uint32>(*slice.UncheckedAtIndex(i + 5)) |
+          Convert<uint32>(*slice.UncheckedAtIndex(i + 6)) |
+          Convert<uint32>(*slice.UncheckedAtIndex(i + 7));
+      if (bits > 0xFF) goto TwoByte;
+      i += 8;
+    }
+    let bits: uint32 = 0;
+    while (i < intptrLength) {
+      bits |= Convert<uint32>(*slice.UncheckedAtIndex(i));
+      i += 1;
+    }
+    if (bits > 0xFF) goto TwoByte;
+  } label TwoByte {
+    return AllocateSeqTwoByteString(length, slice.Iterator());
+  }
+
+  const end = slice.offset + torque_internal::TimesSizeOf<char16>(slice.length);
+  return AllocateNonEmptySeqOneByteString(length, TwoByteToOneByteIterator{
+    object: slice.object,
+    start: slice.offset,
+    end: end
+  });
 }
 
-builtin WasmStringNewWtf16Array(
-    array: WasmArray, start: uint32, end: uint32): String {
+builtin WasmStringNewWtf16Array(array: WasmArray, start: uint32, end: uint32):
+    String {
   try {
     if (array.length < end) goto OffsetOutOfRange;
     if (end < start) goto OffsetOutOfRange;
     const length: uint32 = end - start;
     if (length == 0) return kEmptyString;
+    if (length == 1) {
+      const offset = kWasmArrayHeaderSize +
+          torque_internal::TimesSizeOf<char16>(Convert<intptr>(start));
+      const code: char16 = *torque_internal::unsafe::NewReference<char16>(
+          array, offset);
+      // This makes sure we check the SingleCharacterStringTable.
+      return StringFromSingleCharCode(code);
+    }
     // Calling into the runtime has overhead, but once we're there it's faster,
     // so it pays off for long strings. The threshold has been determined
     // experimentally.
@@ -877,78 +940,48 @@ builtin WasmStringNewWtf16Array(
         Subslice(arrayContent, Convert<intptr>(start), intptrLength)
         otherwise goto OffsetOutOfRange;
 
-    // Ideas for additional future improvements:
-    // (1) We could add a fast path for very short strings, e.g. <= 8 chars,
-    //     and just allocate two-byte strings for them. That would save time
-    //     here, and would only waste a couple of bytes at most. A concern is
-    //     that such strings couldn't take one-byte fast paths later on, e.g.
-    //     in toLower/toUpper case conversions.
-    // (2) We could load more than one array element at a time, e.g. using
-    //     intptr-wide loads, or possibly even wider SIMD instructions. We'd
-    //     have to make sure that non-aligned start offsets are handled,
-    //     and the implementation would become more platform-specific.
-    // (3) We could shift the problem around by allocating two-byte strings
-    //     here and checking whether they're one-byte-compatible later, e.g.
-    //     when promoting them from new to old space. Drawback: rewriting
-    //     strings to different maps isn't great for optimized code that's
-    //     based on collected type feedback, or that wants to elide duplicate
-    //     map checks within the function.
-    // (4) We could allocate space for a two-byte string, then optimistically
-    //     start writing one-byte characters into it, and then either restart
-    //     in two-byte mode if needed, or return the over-allocated bytes to
-    //     the allocator in the end.
-    // (5) We could standardize a `string.new_ascii_array` instruction, which
-    //     could safely produce one-byte strings without checking characters.
-    //     See https://github.com/WebAssembly/stringref/issues/53.
-
-    try {
-      // To reduce the amount of branching, check 8 code units at a time. The
-      // tradeoff for choosing 8 is that we want to check for early termination
-      // of the loop often (to avoid unnecessary work) but not too often
-      // (because each check has a cost).
-      let i: intptr = 0;
-      const eightElementLoopEnd = intptrLength - 8;
-      while (i <= eightElementLoopEnd) {
-        const bits = Convert<uint32>(*substring.UncheckedAtIndex(i)) |
-            Convert<uint32>(*substring.UncheckedAtIndex(i + 1)) |
-            Convert<uint32>(*substring.UncheckedAtIndex(i + 2)) |
-            Convert<uint32>(*substring.UncheckedAtIndex(i + 3)) |
-            Convert<uint32>(*substring.UncheckedAtIndex(i + 4)) |
-            Convert<uint32>(*substring.UncheckedAtIndex(i + 5)) |
-            Convert<uint32>(*substring.UncheckedAtIndex(i + 6)) |
-            Convert<uint32>(*substring.UncheckedAtIndex(i + 7));
-        if (bits > 0xFF) goto TwoByte;
-        i += 8;
-      }
-      let bits: uint32 = 0;
-      while (i < intptrLength) {
-        bits |= Convert<uint32>(*substring.UncheckedAtIndex(i));
-        i += 1;
-      }
-      if (bits > 0xFF) goto TwoByte;
-    } label TwoByte {
-      return AllocateSeqTwoByteString(length, substring.Iterator());
-    }
-
-    return AllocateNonEmptySeqOneByteString(length, TwoByteToOneByteIterator{
-      array: array,
-      offset: kWasmArrayHeaderSize +
-          torque_internal::TimesSizeOf<char16>(Convert<intptr>(start)),
-      end_offset: kWasmArrayHeaderSize +
-          torque_internal::TimesSizeOf<char16>(Convert<intptr>(end))
-    });
+    return StringFromTwoByteSlice(length, substring);
   } label OffsetOutOfRange deferred {
-    const context = LoadContextFromFrame();
+    // This can be called from Wasm and from WebAssembly.String.* JS builtins.
+    const context = LoadContextFromWasmOrJsFrame();
     const error = MessageTemplate::kWasmTrapArrayOutOfBounds;
     runtime::ThrowWasmError(context, SmiConstant(error));
-    unreachable;
   } label Runtime deferred {
-    const context = LoadContextFromFrame();
+    const context = LoadContextFromWasmOrJsFrame();
     tail runtime::WasmStringNewWtf16Array(
         context, array, SmiFromUint32(start), SmiFromUint32(end));
   }
 }
 
+// For imports based string constants.
+// Always returns a String if it didn't trap; typed "JSAny" to satisfy
+// Torque's type checker for tail calls.
+builtin WasmStringFromDataSegment(
+    segmentLength: uint32, arrayStart: uint32, arrayEnd: uint32,
+    segmentIndex: Smi, segmentOffset: Smi): JSAny {
+  const instance = LoadInstanceFromFrame();
+  try {
+    const segmentOffsetU: uint32 = Unsigned(SmiToInt32(segmentOffset));
+    if (segmentLength > Convert<uint32>(kSmiMax) - segmentOffsetU) {
+      goto SegmentOOB;
+    }
+    if (arrayStart > segmentLength) goto ArrayOutOfBounds;
+    if (arrayEnd < arrayStart) goto ArrayOutOfBounds;
+    const arrayLength = arrayEnd - arrayStart;
+    if (arrayLength > segmentLength - arrayStart) goto ArrayOutOfBounds;
+    const smiOffset = Convert<PositiveSmi>(segmentOffsetU + arrayStart)
+        otherwise SegmentOOB;
+    const smiLength = Convert<PositiveSmi>(arrayLength) otherwise SegmentOOB;
+    tail runtime::WasmStringNewSegmentWtf8(
+        LoadContextFromInstance(instance), instance, segmentIndex, smiOffset,
+        smiLength);
+  } label SegmentOOB deferred {
+    tail ThrowWasmTrapElementSegmentOutOfBounds();
+  } label ArrayOutOfBounds deferred {
+    tail ThrowWasmTrapArrayOutOfBounds();
+  }
+}
+
 // Contract: input is any string, output is a string that the TF operator
 // "StringPrepareForGetCodeunit" can handle.
 builtin WasmStringAsWtf16(str: String): String {
@@ -985,8 +1018,8 @@ builtin WasmStringEncodeWtf8Array(
       WasmUint32ToNumber(start));
   return ChangeNumberToUint32(result);
 }
-builtin WasmStringEncodeWtf16(
-    string: String, offset: uint32, memory: Smi): uint32 {
+builtin WasmStringEncodeWtf16(string: String, offset: uint32, memory: Smi):
+    uint32 {
   const instance = LoadInstanceFromFrame();
   runtime::WasmStringEncodeWtf16(
       LoadContextFromInstance(instance), instance, memory, string,
@@ -1002,7 +1035,7 @@ builtin WasmStringEncodeWtf16Array(
     const byteOffset: intptr = kWasmArrayHeaderSize +
         torque_internal::TimesSizeOf<char16>(Convert<intptr>(start));
     const arrayContent = torque_internal::unsafe::NewMutableSlice<char16>(
-        array, byteOffset, Convert<intptr>(string.length));
+        array, byteOffset, string.length_intptr);
     try {
       StringToSlice(string) otherwise OneByte, TwoByte;
     } label OneByte(slice: ConstSlice<char8>) {
@@ -1023,8 +1056,7 @@ builtin WasmStringEncodeWtf16Array(
     return Unsigned(string.length);
   } label OffsetOutOfRange deferred {
     const error = MessageTemplate::kWasmTrapArrayOutOfBounds;
-    runtime::ThrowWasmError(LoadContextFromFrame(), SmiConstant(error));
-    unreachable;
+    runtime::ThrowWasmError(LoadContextFromWasmOrJsFrame(), SmiConstant(error));
   }
 }
 
@@ -1035,6 +1067,13 @@ builtin ThrowToLowerCaseCalledOnNull(): JSAny {
   runtime::WasmThrowTypeError(context, SmiConstant(error), name);
 }
 
+builtin ThrowIndexOfCalledOnNull(): JSAny {
+  const context = LoadContextFromFrame();
+  const error = MessageTemplate::kCalledOnNullOrUndefined;
+  const name = StringConstant('String.prototype.indexOf');
+  runtime::WasmThrowTypeError(context, SmiConstant(error), name);
+}
+
 builtin WasmStringConcat(a: String, b: String): String {
   const context = LoadContextFromFrame();
   tail StringAdd_CheckNone(a, b);
@@ -1045,20 +1084,23 @@ extern builtin StringEqual(NoContext, String, String, intptr): Boolean;
 builtin WasmStringEqual(a: String, b: String): int32 {
   if (TaggedEqual(a, b)) return 1;
   if (a.length != b.length) return 0;
-  if (StringEqual(kNoContext, a, b, Convert<intptr>(a.length)) == True) {
+  if (StringEqual(kNoContext, a, b, a.length_intptr) == True) {
     return 1;
   }
   return 0;
 }
+
 builtin WasmStringIsUSVSequence(str: String): int32 {
   if (IsOneByteStringInstanceType(str.instanceType)) return 1;
   const length = runtime::WasmStringMeasureUtf8(LoadContextFromFrame(), str);
   if (Signed(ChangeNumberToUint32(length)) < 0) return 0;
   return 1;
 }
+
 builtin WasmStringAsWtf8(str: String): ByteArray {
   tail runtime::WasmStringAsWtf8(LoadContextFromFrame(), str);
 }
+
 macro IsWtf8CodepointStart(view: ByteArray, pos: uint32): bool {
   // We're already at the start of a codepoint if the current byte
   // doesn't start with 0b10xxxxxx.
@@ -1090,8 +1132,8 @@ macro AlignWtf8PositionBackward(view: ByteArray, pos: uint32): uint32 {
   if (IsWtf8CodepointStart(view, pos - 2)) return pos - 2;
   return pos - 3;
 }
-builtin WasmStringViewWtf8Advance(
-    view: ByteArray, pos: uint32, bytes: uint32): uint32 {
+builtin WasmStringViewWtf8Advance(view: ByteArray, pos: uint32, bytes: uint32):
+    uint32 {
   const clampedPos = AlignWtf8PositionForward(view, pos);
   if (bytes == 0) return clampedPos;
   const length = Unsigned(SmiToInt32(view.length));
@@ -1126,8 +1168,8 @@ builtin WasmStringViewWtf8Encode(
     bytesWritten: Convert<uintptr>(end - start)
   };
 }
-builtin WasmStringViewWtf8Slice(
-    view: ByteArray, start: uint32, end: uint32): String {
+builtin WasmStringViewWtf8Slice(view: ByteArray, start: uint32, end: uint32):
+    String {
   const start = WasmStringViewWtf8Advance(view, start, 0);
   const end = WasmStringViewWtf8Advance(view, end, 0);
 
@@ -1146,7 +1188,6 @@ transitioning builtin WasmStringViewWtf16GetCodeUnit(
   } label OffsetOutOfRange deferred {
     const error = MessageTemplate::kWasmTrapStringOffsetOutOfBounds;
     runtime::ThrowWasmError(LoadContextFromFrame(), SmiConstant(error));
-    unreachable;
   }
 }
 builtin WasmStringViewWtf16Encode(
@@ -1168,8 +1209,49 @@ transitioning builtin WasmStringViewWtf16Slice(
   const length = Unsigned(string.length);
   if (start >= length) return kEmptyString;
   if (end <= start) return kEmptyString;
-  const clampedEnd = Convert<uintptr>(end <= length ? end : length);
-  return string::SubString(string, Convert<uintptr>(start), clampedEnd);
+
+  // On a high level, the intended logic is:
+  // (1) If start == 0 && end == string.length, return string.
+  // (2) If clampedLength == 1, use a cached single-character string.
+  // (3) If clampedLength < SlicedString::kMinLength, make a copy.
+  // (4) If clampedLength < string.length / 2, make a copy.
+  // (5) Else, create a slice.
+  // The reason for having case (4) is that case (5) has the risk of keeping
+  // huge parent strings alive unnecessarily, and Wasm currently doesn't have a
+  // way to control that behavior, so we have to be careful.
+  // The reason for having case (5) is that case (4) would lead to quadratic
+  // overall behavior if code repeatedly chops off a few characters of a long
+  // string, which we want to avoid.
+  // The string::SubString implementation can handle cases (1), (2), (3),
+  // and (5). The inline code here handles case (4), and doesn't mind if it
+  // also catches some of case (3).
+  const clampedEnd = end <= length ? end : length;
+  const clampedLength = clampedEnd - start;
+  if (clampedLength > 1 && clampedLength < length / 2) {
+    try {
+      // Calling into the runtime has overhead, but once we're there it's
+      // faster, so it pays off for long strings.
+      if (clampedLength > 32) goto Runtime;
+      StringToSlice(string) otherwise OneByte, TwoByte;
+    } label OneByte(slice: ConstSlice<char8>) {
+      let subslice = Subslice(
+          slice, Convert<intptr>(start), Convert<intptr>(clampedLength))
+          otherwise unreachable;
+      return AllocateNonEmptySeqOneByteString(
+          clampedLength, subslice.Iterator());
+    } label TwoByte(slice: ConstSlice<char16>) {
+      let subslice = Subslice(
+          slice, Convert<intptr>(start), Convert<intptr>(clampedLength))
+          otherwise unreachable;
+      return StringFromTwoByteSlice(clampedLength, subslice);
+    } label Runtime deferred {
+      const context = LoadContextFromWasmOrJsFrame();
+      tail runtime::WasmSubstring(
+          context, string, SmiFromUint32(start), SmiFromUint32(clampedLength));
+    }
+  }
+  return string::SubString(
+      string, Convert<uintptr>(start), Convert<uintptr>(clampedEnd));
 }
 builtin WasmStringAsIter(string: String): WasmStringViewIter {
   return new WasmStringViewIter{string: string, offset: 0, optional_padding: 0};
@@ -1190,6 +1272,24 @@ macro CombineSurrogatePair(lead: char16, trail: char16): int32 {
   const surrogateBias: uint32 = 0xFCA02400;
   return Signed((lead32 << 10) + trail32 + surrogateBias);
 }
+
+builtin WasmStringCodePointAt(string: String, offset: uint32): uint32 {
+  try {
+    if (Unsigned(string.length) <= offset) goto OffsetOutOfRange;
+    const lead: char16 = StringCharCodeAt(string, Convert<uintptr>(offset));
+    if (!IsLeadSurrogate(lead)) return Convert<uint32>(lead);
+    const trailOffset = offset + 1;
+    if (Unsigned(string.length) <= trailOffset) return Convert<uint32>(lead);
+    const trail: char16 =
+        StringCharCodeAt(string, Convert<uintptr>(trailOffset));
+    if (!IsTrailSurrogate(trail)) return Convert<uint32>(lead);
+    return Unsigned(CombineSurrogatePair(lead, trail));
+  } label OffsetOutOfRange deferred {
+    const error = MessageTemplate::kWasmTrapStringOffsetOutOfBounds;
+    runtime::ThrowWasmError(LoadContextFromFrame(), SmiConstant(error));
+  }
+}
+
 builtin WasmStringViewIterNext(view: WasmStringViewIter): int32 {
   const string = view.string;
   const offset = view.offset;
@@ -1230,8 +1330,8 @@ builtin WasmStringViewIterAdvance(
   view.offset = offset;
   return advanced;
 }
-builtin WasmStringViewIterRewind(
-    view: WasmStringViewIter, codepoints: uint32): uint32 {
+builtin WasmStringViewIterRewind(view: WasmStringViewIter, codepoints: uint32):
+    uint32 {
   const string = view.string;
   let offset = view.offset;
   let rewound: uint32 = 0;
@@ -1252,8 +1352,8 @@ builtin WasmStringViewIterRewind(
   view.offset = offset;
   return rewound;
 }
-builtin WasmStringViewIterSlice(
-    view: WasmStringViewIter, codepoints: uint32): String {
+builtin WasmStringViewIterSlice(view: WasmStringViewIter, codepoints: uint32):
+    String {
   const string = view.string;
   const start = view.offset;
   let end = view.offset;
@@ -1274,6 +1374,37 @@ builtin WasmStringViewIterSlice(
       string::SubString(string, Convert<uintptr>(start), Convert<uintptr>(end));
 }
 
+builtin WasmIntToString(x: int32, radix: int32): String {
+  if (radix == 10) {
+    const smi = SmiFromInt32(x);
+    const untagged = SmiToInt32(smi);
+    if (x == untagged) {
+      // Queries and populates the NumberToStringCache, but needs tagged
+      // inputs, so only call this for Smis.
+      return NumberToString(smi);
+    }
+    return number::IntToDecimalString(x);
+  }
+
+  // Pretend that Number.prototype.toString was called.
+  if (radix < 2 || radix > 36) {
+    runtime::ThrowRangeError(
+        LoadContextFromInstance(LoadInstanceFromFrame()),
+        SmiConstant(MessageTemplate::kToRadixFormatRange));
+  }
+  return number::IntToString(x, Unsigned(radix));
+}
+
+builtin WasmStringToDouble(s: String): float64 {
+  const hash: NameHash = s.raw_hash_field;
+  if (IsIntegerIndex(hash) &&
+      hash.array_index_length < kMaxCachedArrayIndexLength) {
+    const arrayIndex: int32 = Signed(hash.array_index_value);
+    return Convert<float64>(arrayIndex);
+  }
+  return StringToFloat64(Flatten(s));
+}
+
 builtin WasmStringFromCodePoint(codePoint: uint32): String {
   tail runtime::WasmStringFromCodePoint(
       LoadContextFromFrame(), WasmUint32ToNumber(codePoint));
@@ -1291,4 +1422,5 @@ builtin WasmExternInternalize(externObject: JSAny): JSAny {
   tail runtime::WasmJSToWasmObject(
       context, externObject, SmiConstant(kAnyType));
 }
-}
+
+}  // namespace wasm
diff --git a/deps/v8/src/builtins/weak-ref.tq b/deps/v8/src/builtins/weak-ref.tq
index 051831698534ce..fbd738e8013364 100644
--- a/deps/v8/src/builtins/weak-ref.tq
+++ b/deps/v8/src/builtins/weak-ref.tq
@@ -6,16 +6,15 @@
 
 namespace runtime {
 
-extern runtime JSWeakRefAddToKeptObjects(implicit context: Context)(
-    JSReceiver | Symbol): void;
+extern runtime JSWeakRefAddToKeptObjects(
+    implicit context: Context)(JSReceiver|Symbol): void;
 
 }  // namespace runtime
 
 namespace weakref {
 
-// https://tc39.es/proposal-symbols-as-weakmap-keys/#sec-weak-ref-target
-transitioning javascript builtin
-WeakRefConstructor(
+// https://tc39.es/ecma262/#sec-weak-ref-target
+transitioning javascript builtin WeakRefConstructor(
     js-implicit context: NativeContext, receiver: JSAny, newTarget: JSAny,
     target: JSFunction)(weakTarget: JSAny): JSWeakRef {
   // 1. If NewTarget is undefined, throw a TypeError exception.
@@ -40,8 +39,8 @@ WeakRefConstructor(
   return weakRef;
 }
 
-transitioning javascript builtin
-WeakRefDeref(js-implicit context: NativeContext, receiver: JSAny)(): JSAny {
+transitioning javascript builtin WeakRefDeref(
+    js-implicit context: NativeContext, receiver: JSAny)(): JSAny {
   // 1. Let weakRef be the this value.
   // 2. Perform ? RequireInternalSlot(weakRef, [[WeakRefTarget]]).
   const weakRef = Cast<JSWeakRef>(receiver) otherwise
diff --git a/deps/v8/src/builtins/x64/builtins-x64.cc b/deps/v8/src/builtins/x64/builtins-x64.cc
index 31d01a209916fa..55fa656cb01791 100644
--- a/deps/v8/src/builtins/x64/builtins-x64.cc
+++ b/deps/v8/src/builtins/x64/builtins-x64.cc
@@ -7,6 +7,7 @@
 #include "src/api/api-arguments.h"
 #include "src/base/bits-iterator.h"
 #include "src/base/iterator.h"
+#include "src/builtins/builtins-descriptors.h"
 #include "src/codegen/code-factory.h"
 #include "src/codegen/interface-descriptors-inl.h"
 // For interpreter_entry_return_pc_offset. TODO(jkummerow): Drop.
@@ -139,21 +140,6 @@ void Generate_JSBuiltinsConstructStubHelper(MacroAssembler* masm) {
   }
 }
 
-// Provides access to exit frame stack space (not GCed).
-Operand ExitFrameStackSlotOperand(int index) {
-#ifdef V8_TARGET_OS_WIN
-  return Operand(rsp, (index + kWindowsHomeStackSlots) * kSystemPointerSize);
-#else
-  return Operand(rsp, index * kSystemPointerSize);
-#endif
-}
-
-Operand ExitFrameCallerStackSlotOperand(int index) {
-  return Operand(rbp,
-                 (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
-                     kSystemPointerSize);
-}
-
 }  // namespace
 
 // The construct stub for ES5 constructor functions and ES6 class constructors.
@@ -262,19 +248,6 @@ void Builtins::Generate_JSConstructStubGeneric(MacroAssembler* masm) {
   // Call the function.
   __ InvokeFunction(rdi, rdx, rax, InvokeType::kCall);
 
-  // ----------- S t a t e -------------
-  //  -- rax                 constructor result
-  //  -- sp[0*kSystemPointerSize]  implicit receiver
-  //  -- sp[1*kSystemPointerSize]  padding
-  //  -- sp[2*kSystemPointerSize]  constructor function
-  //  -- sp[3*kSystemPointerSize]  number of arguments
-  //  -- sp[4*kSystemPointerSize]  context
-  // -----------------------------------
-
-  // Store offset of return address for deoptimizer.
-  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
-      masm->pc_offset());
-
   // If the result is an object (in the ECMA sense), we should get rid
   // of the receiver and use the result; see ECMA-262 section 13.2.2-7
   // on page 74.
@@ -838,8 +811,7 @@ void Builtins::Generate_ResumeGeneratorTrampoline(MacroAssembler* masm) {
     // pass in the generator object.  In ordinary calls, new.target is always
     // undefined because generator functions are non-constructable.
     static_assert(kJavaScriptCallCodeStartRegister == rcx, "ABI mismatch");
-    __ LoadTaggedField(rcx, FieldOperand(rdi, JSFunction::kCodeOffset));
-    __ JumpCodeObject(rcx);
+    __ JumpJSFunction(rdi);
   }
 
   __ bind(&prepare_step_in_if_stepping);
@@ -994,17 +966,23 @@ static void AdvanceBytecodeOffsetOrReturn(MacroAssembler* masm,
 
 namespace {
 
-void ResetBytecodeAge(MacroAssembler* masm, Register bytecode_array) {
-  __ movw(FieldOperand(bytecode_array, BytecodeArray::kBytecodeAgeOffset),
-          Immediate(0));
+void ResetSharedFunctionInfoAge(MacroAssembler* masm, Register sfi) {
+  __ movw(FieldOperand(sfi, SharedFunctionInfo::kAgeOffset), Immediate(0));
+}
+
+void ResetJSFunctionAge(MacroAssembler* masm, Register js_function) {
+  const Register shared_function_info(kScratchRegister);
+  __ LoadTaggedField(
+      shared_function_info,
+      FieldOperand(js_function, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, shared_function_info);
 }
 
 void ResetFeedbackVectorOsrUrgency(MacroAssembler* masm,
                                    Register feedback_vector, Register scratch) {
   __ movb(scratch,
           FieldOperand(feedback_vector, FeedbackVector::kOsrStateOffset));
-  __ andb(scratch,
-          Immediate(FeedbackVector::MaybeHasOptimizedOsrCodeBit::kMask));
+  __ andb(scratch, Immediate(~FeedbackVector::OsrUrgencyBits::kMask));
   __ movb(FieldOperand(feedback_vector, FeedbackVector::kOsrStateOffset),
           scratch);
 }
@@ -1031,10 +1009,11 @@ void Builtins::Generate_InterpreterEntryTrampoline(
 
   // Get the bytecode array from the function object and load it into
   // kInterpreterBytecodeArrayRegister.
-  const TaggedRegister shared_function_info(kScratchRegister);
+  const Register shared_function_info(kScratchRegister);
   __ LoadTaggedField(
       shared_function_info,
       FieldOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+  ResetSharedFunctionInfoAge(masm, shared_function_info);
   __ LoadTaggedField(kInterpreterBytecodeArrayRegister,
                      FieldOperand(shared_function_info,
                                   SharedFunctionInfo::kFunctionDataOffset));
@@ -1057,7 +1036,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   __ LoadTaggedField(feedback_cell,
                      FieldOperand(closure, JSFunction::kFeedbackCellOffset));
   __ LoadTaggedField(feedback_vector,
-                     FieldOperand(feedback_cell, Cell::kValueOffset));
+                     FieldOperand(feedback_cell, FeedbackCell::kValueOffset));
 
   Label push_stack_frame;
   // Check if feedback vector is valid. If valid, check for optimized code
@@ -1067,10 +1046,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
 
   // Check the tiering state.
   Label flags_need_processing;
-  Register flags = rcx;
-  __ LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-      flags, feedback_vector, CodeKind::INTERPRETED_FUNCTION,
-      &flags_need_processing);
+  __ CheckFeedbackVectorFlagsAndJumpIfNeedsProcessing(
+      feedback_vector, CodeKind::INTERPRETED_FUNCTION, &flags_need_processing);
 
   ResetFeedbackVectorOsrUrgency(masm, feedback_vector, kScratchRegister);
 
@@ -1095,8 +1072,6 @@ void Builtins::Generate_InterpreterEntryTrampoline(
   __ Push(kJavaScriptCallTargetRegister);    // Callee's JS function.
   __ Push(kJavaScriptCallArgCountRegister);  // Actual argument count.
 
-  ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
-
   // Load initial bytecode offset.
   __ Move(kInterpreterBytecodeOffsetRegister,
           BytecodeArray::kHeaderSize - kHeapObjectTag);
@@ -1234,7 +1209,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
 
 #ifndef V8_JITLESS
   __ bind(&flags_need_processing);
-  __ OptimizeCodeOrTailCallOptimizedCodeSlot(flags, feedback_vector, closure);
+  __ OptimizeCodeOrTailCallOptimizedCodeSlot(feedback_vector, closure,
+                                             JumpMode::kJump);
 
   __ bind(&is_baseline);
   {
@@ -1243,7 +1219,7 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ LoadTaggedField(feedback_cell,
                        FieldOperand(closure, JSFunction::kFeedbackCellOffset));
     __ LoadTaggedField(feedback_vector,
-                       FieldOperand(feedback_cell, Cell::kValueOffset));
+                       FieldOperand(feedback_cell, FeedbackCell::kValueOffset));
 
     Label install_baseline_code;
     // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -1252,8 +1228,8 @@ void Builtins::Generate_InterpreterEntryTrampoline(
     __ j(not_equal, &install_baseline_code);
 
     // Check the tiering state.
-    __ LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-        flags, feedback_vector, CodeKind::BASELINE, &flags_need_processing);
+    __ CheckFeedbackVectorFlagsAndJumpIfNeedsProcessing(
+        feedback_vector, CodeKind::BASELINE, &flags_need_processing);
 
     // Load the baseline code into the closure.
     __ Move(rcx, kInterpreterBytecodeArrayRegister);
@@ -1423,11 +1399,187 @@ void Builtins::Generate_InterpreterPushArgsThenConstructImpl(
   }
 }
 
+namespace {
+
+void NewImplicitReceiver(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- rax : the number of arguments
+  //  -- rdx : the new target
+  //  -- rdi : the constructor to call (checked to be a JSFunction)
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- [arguments without receiver]
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+  Register implicit_receiver = rcx;
+
+  // Save live registers.
+  __ SmiTag(rax);
+  __ Push(rax);  // Number of arguments
+  __ Push(rdx);  // NewTarget
+  __ Push(rdi);  // Target
+  __ Call(BUILTIN_CODE(masm->isolate(), FastNewObject), RelocInfo::CODE_TARGET);
+  // Save result.
+  __ movq(implicit_receiver, rax);
+  // Restore live registers.
+  __ Pop(rdi);
+  __ Pop(rdx);
+  __ Pop(rax);
+  __ SmiUntagUnsigned(rax);
+
+  // Patch implicit receiver (in arguments)
+  __ movq(Operand(rsp, 0 /* first argument */), implicit_receiver);
+  // Patch second implicit (in construct frame)
+  __ movq(Operand(rbp, FastConstructFrameConstants::kImplicitReceiverOffset),
+          implicit_receiver);
+
+  // Restore context.
+  __ movq(rsi, Operand(rbp, FastConstructFrameConstants::kContextOffset));
+}
+
+}  // namespace
+
+// static
+void Builtins::Generate_InterpreterPushArgsThenFastConstructFunction(
+    MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- rax : the number of arguments
+  //  -- rdx : the new target
+  //  -- rdi : the constructor to call (checked to be a JSFunction)
+  //  -- rcx : the address of the first argument to be pushed. Subsequent
+  //           arguments should be consecutive above this, in the same order as
+  //           they are to be pushed onto the stack.
+  // -----------------------------------
+  __ AssertFunction(rdi);
+
+  // Check if target has a [[Construct]] internal method.
+  Label non_constructor;
+  __ LoadMap(kScratchRegister, rdi);
+  __ testb(FieldOperand(kScratchRegister, Map::kBitFieldOffset),
+           Immediate(Map::Bits1::IsConstructorBit::kMask));
+  __ j(zero, &non_constructor);
+
+  // Add a stack check before pushing arguments.
+  Label stack_overflow;
+  __ StackOverflowCheck(rax, &stack_overflow);
+
+  // Enter a construct frame.
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ EnterFrame(StackFrame::FAST_CONSTRUCT);
+  __ Push(rsi);
+  // Implicit receiver stored in the construct frame.
+  __ PushRoot(RootIndex::kTheHoleValue);
+
+  // Push arguments + implicit receiver.
+  Register argc_without_receiver = r11;
+  __ leaq(argc_without_receiver, Operand(rax, -kJSArgcReceiverSlots));
+  GenerateInterpreterPushArgs(masm, argc_without_receiver, rcx, r12);
+  // Implicit receiver as part of the arguments (patched later if needed).
+  __ PushRoot(RootIndex::kTheHoleValue);
+
+  // Check if it is a builtin call.
+  Label builtin_call;
+  const TaggedRegister shared_function_info(kScratchRegister);
+  __ LoadTaggedField(shared_function_info,
+                     FieldOperand(rdi, JSFunction::kSharedFunctionInfoOffset));
+  __ testl(FieldOperand(shared_function_info, SharedFunctionInfo::kFlagsOffset),
+           Immediate(SharedFunctionInfo::ConstructAsBuiltinBit::kMask));
+  __ j(not_zero, &builtin_call);
+
+  // Check if we need to create an implicit receiver.
+  Label not_create_implicit_receiver;
+  __ movl(kScratchRegister,
+          FieldOperand(shared_function_info, SharedFunctionInfo::kFlagsOffset));
+  __ DecodeField<SharedFunctionInfo::FunctionKindBits>(kScratchRegister);
+  __ JumpIfIsInRange(
+      kScratchRegister,
+      static_cast<uint32_t>(FunctionKind::kDefaultDerivedConstructor),
+      static_cast<uint32_t>(FunctionKind::kDerivedConstructor),
+      &not_create_implicit_receiver, Label::kNear);
+  NewImplicitReceiver(masm);
+  __ bind(&not_create_implicit_receiver);
+
+  // Call the function.
+  __ InvokeFunction(rdi, rdx, rax, InvokeType::kCall);
+
+  // ----------- S t a t e -------------
+  //  -- rax     constructor result
+  //
+  //  Stack:
+  //  -- Implicit Receiver
+  //  -- Context
+  //  -- FastConstructMarker
+  //  -- FramePointer
+  // -----------------------------------
+
+  // Store offset of return address for deoptimizer.
+  masm->isolate()->heap()->SetConstructStubInvokeDeoptPCOffset(
+      masm->pc_offset());
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label use_receiver, do_throw, leave_and_return, check_result;
+
+  // If the result is undefined, we'll use the implicit receiver. Otherwise we
+  // do a smi check and fall through to check if the return value is a valid
+  // receiver.
+  __ JumpIfNotRoot(rax, RootIndex::kUndefinedValue, &check_result,
+                   Label::kNear);
+
+  // Throw away the result of the constructor invocation and use the
+  // on-stack receiver as the result.
+  __ bind(&use_receiver);
+  __ movq(rax,
+          Operand(rbp, FastConstructFrameConstants::kImplicitReceiverOffset));
+  __ JumpIfRoot(rax, RootIndex::kTheHoleValue, &do_throw, Label::kNear);
+
+  __ bind(&leave_and_return);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ ret(0);
+
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ bind(&check_result);
+  __ JumpIfSmi(rax, &use_receiver, Label::kNear);
+
+  // Check if the type of the result is not an object in the ECMA sense.
+  __ JumpIfJSAnyIsNotPrimitive(rax, rcx, &leave_and_return, Label::kNear);
+  __ jmp(&use_receiver);
+
+  __ bind(&do_throw);
+  __ movq(rsi, Operand(rbp, ConstructFrameConstants::kContextOffset));
+  __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+  // We don't return here.
+  __ int3();
+
+  __ bind(&builtin_call);
+  // TODO(victorgomes): Check the possibility to turn this into a tailcall.
+  __ InvokeFunction(rdi, rdx, rax, InvokeType::kCall);
+  __ LeaveFrame(StackFrame::FAST_CONSTRUCT);
+  __ ret(0);
+
+  // Called Construct on an Object that doesn't have a [[Construct]] internal
+  // method.
+  __ bind(&non_constructor);
+  __ Jump(BUILTIN_CODE(masm->isolate(), ConstructedNonConstructable),
+          RelocInfo::CODE_TARGET);
+
+  // Throw stack overflow exception.
+  __ bind(&stack_overflow);
+  __ TailCallRuntime(Runtime::kThrowStackOverflow);
+  // This should be unreachable.
+  __ int3();
+}
+
 static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
   // Set the return address to the correct point in the interpreter entry
   // trampoline.
   Label builtin_trampoline, trampoline_loaded;
-  Smi interpreter_entry_return_pc_offset(
+  Tagged<Smi> interpreter_entry_return_pc_offset(
       masm->isolate()->heap()->interpreter_entry_return_pc_offset());
   DCHECK_NE(interpreter_entry_return_pc_offset, Smi::zero());
 
@@ -1447,7 +1599,7 @@ static void Generate_InterpreterEnterBytecode(MacroAssembler* masm) {
 
   __ LoadTaggedField(
       rbx, FieldOperand(rbx, InterpreterData::kInterpreterTrampolineOffset));
-  __ LoadCodeEntry(rbx, rbx);
+  __ LoadCodeInstructionStart(rbx, rbx);
   __ jmp(&trampoline_loaded, Label::kNear);
 
   __ bind(&builtin_trampoline);
@@ -1559,12 +1711,11 @@ void Builtins::Generate_InterpreterEnterAtBytecode(MacroAssembler* masm) {
 // static
 void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   Register feedback_vector = r8;
-  Register flags = rcx;
   Register return_address = r15;
 
 #ifdef DEBUG
   for (auto reg : BaselineOutOfLinePrologueDescriptor::registers()) {
-    DCHECK(!AreAliased(feedback_vector, flags, return_address, reg));
+    DCHECK(!AreAliased(feedback_vector, return_address, reg));
   }
 #endif
 
@@ -1577,13 +1728,13 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
   __ LoadTaggedField(feedback_cell,
                      FieldOperand(closure, JSFunction::kFeedbackCellOffset));
   __ LoadTaggedField(feedback_vector,
-                     FieldOperand(feedback_cell, Cell::kValueOffset));
+                     FieldOperand(feedback_cell, FeedbackCell::kValueOffset));
   __ AssertFeedbackVector(feedback_vector);
 
   // Check the tiering state.
   Label flags_need_processing;
-  __ LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-      flags, feedback_vector, CodeKind::BASELINE, &flags_need_processing);
+  __ CheckFeedbackVectorFlagsAndJumpIfNeedsProcessing(
+      feedback_vector, CodeKind::BASELINE, &flags_need_processing);
 
   ResetFeedbackVectorOsrUrgency(masm, feedback_vector, kScratchRegister);
 
@@ -1606,6 +1757,7 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
           BaselineOutOfLinePrologueDescriptor::kClosure);
       DCHECK_EQ(callee_js_function, kJavaScriptCallTargetRegister);
       DCHECK_EQ(callee_js_function, kJSFunctionRegister);
+      ResetJSFunctionAge(masm, callee_js_function);
       __ Push(callee_js_function);  // Callee's JS function.
       __ Push(descriptor.GetRegisterParameter(
           BaselineOutOfLinePrologueDescriptor::
@@ -1616,7 +1768,6 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
       // onto the frame, so load it into a register.
       Register bytecode_array = descriptor.GetRegisterParameter(
           BaselineOutOfLinePrologueDescriptor::kInterpreterBytecodeArray);
-      ResetBytecodeAge(masm, bytecode_array);
       __ Push(bytecode_array);
 
       // Baseline code frames store the feedback vector where interpreter would
@@ -1662,7 +1813,7 @@ void Builtins::Generate_BaselineOutOfLinePrologue(MacroAssembler* masm) {
     // return since we may do a runtime call along the way that requires the
     // stack to only contain valid frames.
     __ Drop(1);
-    __ OptimizeCodeOrTailCallOptimizedCodeSlot(flags, feedback_vector, closure,
+    __ OptimizeCodeOrTailCallOptimizedCodeSlot(feedback_vector, closure,
                                                JumpMode::kPushAndReturn);
     __ Trap();
   }
@@ -2064,7 +2215,7 @@ void Generate_AllocateSpaceAndShiftExistingArguments(
 }  // namespace
 
 // static
-// TODO(v8:11615): Observe InstructionStream::kMaxArguments in
+// TODO(v8:11615): Observe Code::kMaxArguments in
 // CallOrConstructVarargs
 void Builtins::Generate_CallOrConstructVarargs(MacroAssembler* masm,
                                                Handle<Code> code) {
@@ -2699,7 +2850,7 @@ void OnStackReplacement(MacroAssembler* masm, OsrSourceTier source,
       FieldOperand(deopt_data, FixedArray::OffsetOfElementAt(
                                    DeoptimizationData::kOsrPcOffsetIndex)));
 
-  __ LoadCodeEntry(rax, rax);
+  __ LoadCodeInstructionStart(rax, rax);
 
   // Compute the target address = code_entry + osr_offset
   __ addq(rax, rbx);
@@ -2733,6 +2884,36 @@ void Builtins::Generate_MaglevOnStackReplacement(MacroAssembler* masm) {
                      D::MaybeTargetCodeRegister());
 }
 
+#ifdef V8_ENABLE_MAGLEV
+
+// static
+void Builtins::Generate_MaglevFunctionEntryStackCheck(MacroAssembler* masm,
+                                                      bool save_new_target) {
+  // Input (rax): Stack size (Smi).
+  // This builtin can be invoked just after Maglev's prologue.
+  // All registers are available, except (possibly) new.target.
+  ASM_CODE_COMMENT(masm);
+  {
+    FrameScope scope(masm, StackFrame::INTERNAL);
+    __ AssertSmi(rax);
+    if (save_new_target) {
+      if (PointerCompressionIsEnabled()) {
+        __ AssertSmiOrHeapObjectInCompressionCage(
+            kJavaScriptCallNewTargetRegister);
+      }
+      __ Push(kJavaScriptCallNewTargetRegister);
+    }
+    __ Push(rax);
+    __ CallRuntime(Runtime::kStackGuardWithGap, 1);
+    if (save_new_target) {
+      __ Pop(kJavaScriptCallNewTargetRegister);
+    }
+  }
+  __ Ret();
+}
+
+#endif  // V8_ENABLE_MAGLEV
+
 #if V8_ENABLE_WEBASSEMBLY
 
 // Returns the offset beyond the last saved FP register.
@@ -2918,58 +3099,6 @@ void Builtins::Generate_WasmDebugBreak(MacroAssembler* masm) {
 }
 
 namespace {
-// Helper functions for the GenericJSToWasmWrapper.
-void PrepareForBuiltinCall(MacroAssembler* masm, MemOperand GCScanSlotPlace,
-                           const int GCScanSlotCount, Register current_param,
-                           Register param_limit,
-                           Register current_int_param_slot,
-                           Register current_float_param_slot,
-                           Register valuetypes_array_ptr,
-                           Register wasm_instance, Register function_data,
-                           Register original_fp) {
-  // Pushes and puts the values in order onto the stack before builtin calls for
-  // the GenericJSToWasmWrapper.
-  __ Move(GCScanSlotPlace, GCScanSlotCount);
-  __ pushq(current_param);
-  __ pushq(param_limit);
-  __ pushq(current_int_param_slot);
-  __ pushq(current_float_param_slot);
-  __ pushq(valuetypes_array_ptr);
-  if (original_fp != rbp) {
-    // For stack-switching only: keep the pointer to the parent stack alive.
-    __ pushq(original_fp);
-  }
-  __ pushq(wasm_instance);
-  __ pushq(function_data);
-  // We had to prepare the parameters for the Call: we have to put the context
-  // into rsi.
-  __ LoadTaggedField(
-      rsi,
-      MemOperand(wasm_instance, wasm::ObjectAccess::ToTagged(
-                                    WasmInstanceObject::kNativeContextOffset)));
-}
-
-void RestoreAfterBuiltinCall(MacroAssembler* masm, Register function_data,
-                             Register wasm_instance,
-                             Register valuetypes_array_ptr,
-                             Register current_float_param_slot,
-                             Register current_int_param_slot,
-                             Register param_limit, Register current_param,
-                             Register original_fp) {
-  // Pop and load values from the stack in order into the registers after
-  // builtin calls for the GenericJSToWasmWrapper.
-  __ popq(function_data);
-  __ popq(wasm_instance);
-  if (original_fp != rbp) {
-    __ popq(original_fp);
-  }
-  __ popq(valuetypes_array_ptr);
-  __ popq(current_float_param_slot);
-  __ popq(current_int_param_slot);
-  __ popq(param_limit);
-  __ popq(current_param);
-}
-
 // Check that the stack was in the old state (if generated code assertions are
 // enabled), and switch to the new state.
 void SwitchStackState(MacroAssembler* masm, Register jmpbuf,
@@ -3016,24 +3145,6 @@ void SaveState(MacroAssembler* masm, Register active_continuation, Register tmp,
   FillJumpBuffer(masm, jmpbuf, suspend);
 }
 
-// Returns the new suspender in rax.
-void AllocateSuspender(MacroAssembler* masm, Register function_data,
-                       Register wasm_instance) {
-  MemOperand GCScanSlotPlace =
-      MemOperand(rbp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
-  __ Move(GCScanSlotPlace, 2);
-  __ Push(wasm_instance);
-  __ Push(function_data);
-  __ LoadTaggedField(
-      kContextRegister,
-      MemOperand(wasm_instance, wasm::ObjectAccess::ToTagged(
-                                    WasmInstanceObject::kNativeContextOffset)));
-  __ CallRuntime(Runtime::kWasmAllocateSuspender);
-  __ Pop(function_data);
-  __ Pop(wasm_instance);
-  static_assert(kReturnRegister0 == rax);
-}
-
 void LoadTargetJumpBuffer(MacroAssembler* masm, Register target_continuation) {
   Register target_jmpbuf = target_continuation;
   __ LoadExternalPointerField(
@@ -3041,15 +3152,33 @@ void LoadTargetJumpBuffer(MacroAssembler* masm, Register target_continuation) {
       FieldOperand(target_continuation, WasmContinuationObject::kJmpbufOffset),
       kWasmContinuationJmpbufTag, kScratchRegister);
   MemOperand GCScanSlotPlace =
-      MemOperand(rbp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
+      MemOperand(rbp, StackSwitchFrameConstants::kGCScanSlotCountOffset);
   __ Move(GCScanSlotPlace, 0);
   // Switch stack!
   LoadJumpBuffer(masm, target_jmpbuf, false);
 }
 
-void ReloadParentContinuation(MacroAssembler* masm, Register wasm_instance,
-                              Register return_reg, Register tmp1,
-                              Register tmp2) {
+void SyncStackLimit(MacroAssembler* masm, const Register& keep1,
+                    const Register& keep2 = no_reg) {
+  using ER = ExternalReference;
+  __ Push(keep1);
+  if (keep2 != no_reg) {
+    __ Push(keep2);
+  }
+  {
+    FrameScope scope(masm, StackFrame::MANUAL);
+    __ Move(arg_reg_1, ExternalReference::isolate_address(masm->isolate()));
+    __ PrepareCallCFunction(1);
+    __ CallCFunction(ER::wasm_sync_stack_limit(), 1);
+  }
+  if (keep2 != no_reg) {
+    __ Pop(keep2);
+  }
+  __ Pop(keep1);
+}
+
+void ReloadParentContinuation(MacroAssembler* masm, Register promise,
+                              Register tmp1, Register tmp2) {
   Register active_continuation = tmp1;
   __ LoadRoot(active_continuation, RootIndex::kActiveContinuation);
 
@@ -3077,15 +3206,7 @@ void ReloadParentContinuation(MacroAssembler* masm, Register wasm_instance,
 
   // Switch stack!
   LoadJumpBuffer(masm, jmpbuf, false);
-  MemOperand GCScanSlotPlace =
-      MemOperand(rbp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
-  __ Move(GCScanSlotPlace, 1);
-  __ Push(return_reg);
-  __ Push(wasm_instance);  // Spill.
-  __ Move(kContextRegister, Smi::zero());
-  __ CallRuntime(Runtime::kWasmSyncStackLimit);
-  __ Pop(wasm_instance);
-  __ Pop(return_reg);
+  SyncStackLimit(masm, promise);
 }
 
 void RestoreParentSuspender(MacroAssembler* masm, Register tmp1,
@@ -3118,959 +3239,354 @@ void RestoreParentSuspender(MacroAssembler* masm, Register tmp1,
   __ movq(masm->RootAsOperand(RootIndex::kActiveSuspender), suspender);
 }
 
-void LoadFunctionDataAndWasmInstance(MacroAssembler* masm,
-                                     Register function_data,
-                                     Register wasm_instance) {
-  Register closure = function_data;
-  Register shared_function_info = closure;
+void ResetStackSwitchFrameStackSlots(MacroAssembler* masm) {
+  __ Move(kScratchRegister, Smi::zero());
+  __ movq(MemOperand(rbp, StackSwitchFrameConstants::kInstanceOffset),
+          kScratchRegister);
+  __ movq(MemOperand(rbp, StackSwitchFrameConstants::kResultArrayOffset),
+          kScratchRegister);
+}
+
+void SwitchToAllocatedStack(MacroAssembler* masm, Register wasm_instance,
+                            Register wrapper_buffer, Register original_fp,
+                            Register new_wrapper_buffer, Register scratch,
+                            Label* suspend) {
+  ResetStackSwitchFrameStackSlots(masm);
+  Register parent_continuation = new_wrapper_buffer;
+  __ LoadRoot(parent_continuation, RootIndex::kActiveContinuation);
   __ LoadTaggedField(
-      shared_function_info,
+      parent_continuation,
+      FieldOperand(parent_continuation, WasmContinuationObject::kParentOffset));
+  SaveState(masm, parent_continuation, scratch, suspend);
+  SyncStackLimit(masm, kWasmInstanceRegister, wrapper_buffer);
+  parent_continuation = no_reg;
+  Register target_continuation = scratch;
+  __ LoadRoot(target_continuation, RootIndex::kActiveContinuation);
+  // Save the old stack's rbp in r9, and use it to access the parameters in
+  // the parent frame.
+  __ movq(original_fp, rbp);
+  LoadTargetJumpBuffer(masm, target_continuation);
+  // Push the loaded rbp. We know it is null, because there is no frame yet,
+  // so we could also push 0 directly. In any case we need to push it, because
+  // this marks the base of the stack segment for the stack frame iterator.
+  __ EnterFrame(StackFrame::STACK_SWITCH);
+  int stack_space =
+      StackSwitchFrameConstants::kNumSpillSlots * kSystemPointerSize +
+      JSToWasmWrapperFrameConstants::kWrapperBufferSize;
+  __ AllocateStackSpace(stack_space);
+  __ movq(new_wrapper_buffer, rsp);
+  // Copy data needed for return handling from old wrapper buffer to new one.
+  // kWrapperBufferRefReturnCount will be copied too, because 8 bytes are copied
+  // at the same time.
+  static_assert(JSToWasmWrapperFrameConstants::kWrapperBufferRefReturnCount ==
+                JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount + 4);
+  __ movq(kScratchRegister,
+          MemOperand(wrapper_buffer,
+                     JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount));
+  __ movq(MemOperand(new_wrapper_buffer,
+                     JSToWasmWrapperFrameConstants::kWrapperBufferReturnCount),
+          kScratchRegister);
+  __ movq(
+      kScratchRegister,
       MemOperand(
-          closure,
-          wasm::ObjectAccess::SharedFunctionInfoOffsetInTaggedJSFunction()));
-  closure = no_reg;
-  __ LoadTaggedField(
-      function_data,
-      MemOperand(shared_function_info,
-                 SharedFunctionInfo::kFunctionDataOffset - kHeapObjectTag));
-  shared_function_info = no_reg;
+          wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferSigRepresentationArray));
+  __ movq(
+      MemOperand(
+          new_wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferSigRepresentationArray),
+      kScratchRegister);
+}
 
+void SwitchBackAndReturnPromise(MacroAssembler* masm, Register tmp1,
+                                Register tmp2, Label* return_promise) {
+  // The return value of the wasm function becomes the parameter of the
+  // FulfillPromise builtin, and the promise is the return value of this
+  // wrapper.
+  __ movq(tmp1, kReturnRegister0);
+  Register promise = kReturnRegister0;
+  __ LoadRoot(promise, RootIndex::kActiveSuspender);
   __ LoadTaggedField(
-      wasm_instance,
-      MemOperand(function_data,
-                 WasmExportedFunctionData::kInstanceOffset - kHeapObjectTag));
-}
+      promise, FieldOperand(promise, WasmSuspenderObject::kPromiseOffset));
+  __ movq(kContextRegister,
+          MemOperand(rbp, StackSwitchFrameConstants::kInstanceOffset));
+  __ LoadTaggedField(
+      kContextRegister,
+      FieldOperand(kContextRegister, WasmInstanceObject::kNativeContextOffset));
+  __ Move(MemOperand(rbp, StackSwitchFrameConstants::kGCScanSlotCountOffset),
+          1);
+  __ Push(promise);
+  __ CallBuiltin(Builtin::kFulfillPromise);
+  __ Pop(promise);
 
-void LoadValueTypesArray(MacroAssembler* masm, Register function_data,
-                         Register valuetypes_array_ptr, Register return_count,
-                         Register param_count) {
-  Register signature = valuetypes_array_ptr;
-  __ LoadExternalPointerField(
-      signature,
-      FieldOperand(function_data, WasmExportedFunctionData::kSigOffset),
-      kWasmExportedFunctionDataSignatureTag, kScratchRegister);
-  __ movq(return_count,
-          MemOperand(signature, wasm::FunctionSig::kReturnCountOffset));
-  __ movq(param_count,
-          MemOperand(signature, wasm::FunctionSig::kParameterCountOffset));
-  valuetypes_array_ptr = signature;
-  __ movq(valuetypes_array_ptr,
-          MemOperand(signature, wasm::FunctionSig::kRepsOffset));
+  __ bind(return_promise);
+  ReloadParentContinuation(masm, promise, tmp1, tmp2);
+  RestoreParentSuspender(masm, tmp1, tmp2);
 }
 
-void GenericJSToWasmWrapperHelper(MacroAssembler* masm, bool stack_switch) {
-  // Set up the stackframe.
-  __ EnterFrame(stack_switch ? StackFrame::STACK_SWITCH
-                             : StackFrame::JS_TO_WASM);
+void GenerateExceptionHandlingLandingPad(MacroAssembler* masm,
+                                         Label* return_promise) {
+  int catch_handler = __ pc_offset();
+  // Restore rsp to free the reserved stack slots for the sections.
+  __ leaq(rsp, MemOperand(rbp, StackSwitchFrameConstants::kLastSpillOffset));
 
-  // -------------------------------------------
-  // Compute offsets and prepare for GC.
-  // -------------------------------------------
-  constexpr int kGCScanSlotCountOffset =
-      BuiltinWasmWrapperConstants::kGCScanSlotCountOffset;
-  // The number of parameters passed to this function.
-  constexpr int kInParamCountOffset =
-      BuiltinWasmWrapperConstants::kInParamCountOffset;
-  // The number of parameters according to the signature.
-  constexpr int kParamCountOffset =
-      BuiltinWasmWrapperConstants::kParamCountOffset;
-  constexpr int kSuspenderOffset =
-      BuiltinWasmWrapperConstants::kSuspenderOffset;
-  constexpr int kReturnCountOffset = kSuspenderOffset - kSystemPointerSize;
-  constexpr int kValueTypesArrayStartOffset =
-      kReturnCountOffset - kSystemPointerSize;
-  // A boolean flag to check if one of the parameters is a reference. If so, we
-  // iterate over the parameters two times, first for all value types, and then
-  // for all references.
-  constexpr int kHasRefTypesOffset =
-      kValueTypesArrayStartOffset - kSystemPointerSize;
-  // We set and use this slot only when moving parameters into the parameter
-  // registers (so no GC scan is needed).
-  constexpr int kFunctionDataOffset = kHasRefTypesOffset - kSystemPointerSize;
-  constexpr int kLastSpillOffset = kFunctionDataOffset;
-  constexpr int kNumSpillSlots =
-      (-TypedFrameConstants::kFixedFrameSizeFromFp - kLastSpillOffset) >>
-      kSystemPointerSizeLog2;
-  __ subq(rsp, Immediate(kNumSpillSlots * kSystemPointerSize));
-  // Put the in_parameter count on the stack, we only  need it at the very end
-  // when we pop the parameters off the stack.
-  Register in_param_count = rax;
-  __ decq(in_param_count);  // Exclude receiver.
-  __ movq(MemOperand(rbp, kInParamCountOffset), in_param_count);
-  in_param_count = no_reg;
-
-  Register function_data = rdi;
-  Register wasm_instance = rsi;
-  LoadFunctionDataAndWasmInstance(masm, function_data, wasm_instance);
-
-  Label compile_wrapper, compile_wrapper_done;
-  if (!stack_switch) {
-    // -------------------------------------------
-    // Decrement the budget of the generic wrapper in function data.
-    // -------------------------------------------
-    __ SmiAddConstant(
-        MemOperand(
-            function_data,
-            WasmExportedFunctionData::kWrapperBudgetOffset - kHeapObjectTag),
-        Smi::FromInt(-1));
-
-    // -------------------------------------------
-    // Check if the budget of the generic wrapper reached 0 (zero).
-    // -------------------------------------------
-    // Instead of a specific comparison, we can directly use the flags set
-    // from the previous addition.
-    __ j(less_equal, &compile_wrapper);
-    __ bind(&compile_wrapper_done);
-  }
+  // Unset thread_in_wasm_flag.
+  Register thread_in_wasm_flag_addr = r8;
+  __ movq(
+      thread_in_wasm_flag_addr,
+      MemOperand(kRootRegister, Isolate::thread_in_wasm_flag_address_offset()));
+  __ movl(MemOperand(thread_in_wasm_flag_addr, 0), Immediate(0));
+  thread_in_wasm_flag_addr = no_reg;
 
-  Label suspend;
-  if (stack_switch) {
-    // Set the suspender spill slot to a sentinel value, in case a GC happens
-    // before we set the actual value.
-    __ LoadRoot(kScratchRegister, RootIndex::kUndefinedValue);
-    __ movq(MemOperand(rbp, kSuspenderOffset), kScratchRegister);
-    Register active_continuation = rbx;
-    __ LoadRoot(active_continuation, RootIndex::kActiveContinuation);
-    SaveState(masm, active_continuation, rcx, &suspend);
-    AllocateSuspender(masm, function_data, wasm_instance);
-    Register suspender = rax;  // Fixed.
-    __ movq(MemOperand(rbp, kSuspenderOffset), suspender);
-    Register target_continuation = rax;
-    __ LoadTaggedField(
-        target_continuation,
-        FieldOperand(suspender, WasmSuspenderObject::kContinuationOffset));
-    suspender = no_reg;
-    // Save the old stack's rbp in r9, and use it to access the parameters in
-    // the parent frame.
-    // We also distribute the spill slots across the two stacks as needed by
-    // creating a "shadow frame":
-    //
-    //      old stack:                    new stack:
-    //      +-----------------+
-    //      | <parent frame>  |
-    //      +-----------------+
-    //      | pc              |
-    //      +-----------------+           +-----------------+
-    //      | caller rbp      |           | 0 (jmpbuf rbp)  |
-    // r9-> +-----------------+     rbp-> +-----------------+
-    //      | frame marker    |           | frame marker    |
-    //      +-----------------+           +-----------------+
-    //      |kGCScanSlotCount |           |kGCScanSlotCount |
-    //      +-----------------+           +-----------------+
-    //      | kInParamCount   |           |      /          |
-    //      +-----------------+           +-----------------+
-    //      | kParamCount     |           |      /          |
-    //      +-----------------+           +-----------------+
-    //      | kSuspender      |           |      /          |
-    //      +-----------------+           +-----------------+
-    //      |      /          |           | kReturnCount    |
-    //      +-----------------+           +-----------------+
-    //      |      /          |           |kValueTypesArray |
-    //      +-----------------+           +-----------------+
-    //      |      /          |           | kHasRefTypes    |
-    //      +-----------------+           +-----------------+
-    //      |      /          |           | kFunctionData   |
-    //      +-----------------+    rsp->  +-----------------+
-    //          seal stack                         |
-    //                                             V
-    //
-    // - When we first enter the prompt, we have access to both frames, so it
-    // does not matter where the values are spilled.
-    // - When we suspend for the first time, we longjmp to the original frame
-    // (left).  So the frame needs to contain the necessary information to
-    // properly deconstruct itself (actual param count and signature param
-    // count).
-    // - When we suspend for the second time, we longjmp to the frame that was
-    // set up by the WasmResume builtin, which has the same layout as the
-    // original frame (left).
-    // - When the closure finally resolves, we use the value types pointer
-    // stored in the shadow frame to get the return type and convert the return
-    // value accordingly.
-    __ movq(r9, rbp);
-    LoadTargetJumpBuffer(masm, target_continuation);
-    // Push the loaded rbp. We know it is null, because there is no frame yet,
-    // so we could also push 0 directly. In any case we need to push it, because
-    // this marks the base of the stack segment for the stack frame iterator.
-    __ EnterFrame(StackFrame::STACK_SWITCH);
-    __ subq(rsp, Immediate(kNumSpillSlots * kSystemPointerSize));
-    // Set a sentinel value for the suspender spill slot in the new frame.
-    __ LoadRoot(kScratchRegister, RootIndex::kUndefinedValue);
-    __ movq(MemOperand(rbp, kSuspenderOffset), kScratchRegister);
-  }
-  Register original_fp = stack_switch ? r9 : rbp;
+  // The exception becomes the parameter of the RejectPromise builtin, and the
+  // promise is the return value of this wrapper.
+  __ movq(rbx, kReturnRegister0);
+  Register promise = rax;
+  __ LoadRoot(promise, RootIndex::kActiveSuspender);
+  __ LoadTaggedField(
+      promise, FieldOperand(promise, WasmSuspenderObject::kPromiseOffset));
+  __ movq(kContextRegister,
+          MemOperand(rbp, StackSwitchFrameConstants::kInstanceOffset));
+  __ LoadTaggedField(
+      kContextRegister,
+      FieldOperand(kContextRegister, WasmInstanceObject::kNativeContextOffset));
 
-  // -------------------------------------------
-  // Load values from the signature.
-  // -------------------------------------------
-  Register valuetypes_array_ptr = r11;
-  Register return_count = r8;
-  Register param_count = rcx;
-  LoadValueTypesArray(masm, function_data, valuetypes_array_ptr, return_count,
-                      param_count);
+  __ Move(MemOperand(rbp, StackSwitchFrameConstants::kGCScanSlotCountOffset),
+          1);
+  __ Push(promise);
+  static const Builtin_RejectPromise_InterfaceDescriptor desc;
+  static_assert(desc.GetRegisterParameter(0) == rax &&  // promise
+                desc.GetRegisterParameter(1) == rbx &&  // reason
+                desc.GetRegisterParameter(2) == rcx     // debugEvent
+  );
+  __ LoadRoot(rcx, RootIndex::kTrueValue);
+  __ CallBuiltin(Builtin::kRejectPromise);
+  __ Pop(promise);
 
-  // Initialize the {HasRefTypes} slot.
-  __ movq(MemOperand(rbp, kHasRefTypesOffset), Immediate(0));
+  // Run the rest of the wrapper normally (switch to the old stack,
+  // deconstruct the frame, ...).
+  __ jmp(return_promise);
 
-  // -------------------------------------------
-  // Store signature-related values to the stack.
-  // -------------------------------------------
-  // We store values on the stack to restore them after function calls.
-  // We cannot push values onto the stack right before the wasm call. The wasm
-  // function expects the parameters, that didn't fit into the registers, on the
-  // top of the stack.
-  __ movq(MemOperand(original_fp, kParamCountOffset), param_count);
-  __ movq(MemOperand(rbp, kReturnCountOffset), return_count);
-  __ movq(MemOperand(rbp, kValueTypesArrayStartOffset), valuetypes_array_ptr);
+  masm->isolate()->builtins()->SetJSPIPromptHandlerOffset(catch_handler);
+}
 
-  // -------------------------------------------
-  // Parameter handling.
-  // -------------------------------------------
-  Label prepare_for_wasm_call;
-  __ Cmp(param_count, 0);
+void JSToWasmWrapperHelper(MacroAssembler* masm, bool stack_switch) {
+  __ EnterFrame(stack_switch ? StackFrame::STACK_SWITCH
+                             : StackFrame::JS_TO_WASM);
 
-  // IF we have 0 params: jump through parameter handling.
-  __ j(equal, &prepare_for_wasm_call);
+  __ AllocateStackSpace(StackSwitchFrameConstants::kNumSpillSlots *
+                        kSystemPointerSize);
 
-  // -------------------------------------------
-  // Create 2 sections for integer and float params.
-  // -------------------------------------------
-  // We will create 2 sections on the stack for the evaluated parameters:
-  // Integer and Float section, both with parameter count size. We will place
-  // the parameters into these sections depending on their valuetype. This way
-  // we can easily fill the general purpose and floating point parameter
-  // registers and place the remaining parameters onto the stack in proper order
-  // for the Wasm function. These remaining params are the final stack
-  // parameters for the call to WebAssembly. Example of the stack layout after
-  // processing 2 int and 1 float parameters when param_count is 4.
-  //   +-----------------+
-  //   |      rbp        |
-  //   |-----------------|-------------------------------
-  //   |                 |   Slots we defined
-  //   |   Saved values  |    when setting up
-  //   |                 |     the stack
-  //   |                 |
-  //   +-Integer section-+--- <--- start_int_section ----
-  //   |  1st int param  |
-  //   |- - - - - - - - -|
-  //   |  2nd int param  |
-  //   |- - - - - - - - -|  <----- current_int_param_slot
-  //   |                 |       (points to the stackslot
-  //   |- - - - - - - - -|  where the next int param should be placed)
-  //   |                 |
-  //   +--Float section--+--- <--- start_float_section --
-  //   | 1st float param |
-  //   |- - - - - - - - -|  <----  current_float_param_slot
-  //   |                 |       (points to the stackslot
-  //   |- - - - - - - - -|  where the next float param should be placed)
-  //   |                 |
-  //   |- - - - - - - - -|
-  //   |                 |
-  //   +---Final stack---+------------------------------
-  //   +-parameters for--+------------------------------
-  //   +-the Wasm call---+------------------------------
-  //   |      . . .      |
-
-  constexpr int kIntegerSectionStartOffset =
-      kLastSpillOffset - kSystemPointerSize;
-  // For Integer section.
-  // Set the current_int_param_slot to point to the start of the section.
-  Register current_int_param_slot = r10;
-  __ leaq(current_int_param_slot, MemOperand(rsp, -kSystemPointerSize));
-  Register params_size = param_count;
-  param_count = no_reg;
-  __ shlq(params_size, Immediate(kSystemPointerSizeLog2));
-  __ subq(rsp, params_size);
-
-  // For Float section.
-  // Set the current_float_param_slot to point to the start of the section.
-  Register current_float_param_slot = r15;
-  __ leaq(current_float_param_slot, MemOperand(rsp, -kSystemPointerSize));
-  __ subq(rsp, params_size);
-  params_size = no_reg;
-  param_count = rcx;
-  __ movq(param_count, MemOperand(original_fp, kParamCountOffset));
+  Register wrapper_buffer =
+      WasmJSToWasmWrapperDescriptor::WrapperBufferRegister();
+  __ movq(kWasmInstanceRegister,
+          MemOperand(rbp, JSToWasmWrapperFrameConstants::kInstanceParamOffset));
 
-  // -------------------------------------------
-  // Set up for the param evaluation loop.
-  // -------------------------------------------
-  // We will loop through the params starting with the 1st param.
-  // The order of processing the params is important. We have to evaluate them
-  // in an increasing order.
-  //       +-----------------+---------------
-  //       |     param n     |
-  //       |- - - - - - - - -|
-  //       |    param n-1    |   Caller
-  //       |       ...       | frame slots
-  //       |     param 1     |
-  //       |- - - - - - - - -|
-  //       |    receiver     |
-  //       +-----------------+---------------
-  //       |  return addr    |
-  //   FP->|- - - - - - - - -|
-  //       |      rbp        |   Spill slots
-  //       |- - - - - - - - -|
-  //
-  // [rbp + current_param] gives us the parameter we are processing.
-  // We iterate through half-open interval <1st param, [rbp + param_limit]).
-
-  Register current_param = rbx;
-  Register param_limit = rdx;
-  __ Move(current_param,
-          kFPOnStackSize + kPCOnStackSize + kReceiverOnStackSize);
-  __ movq(param_limit, param_count);
-  __ shlq(param_limit, Immediate(kSystemPointerSizeLog2));
-  __ addq(param_limit,
-          Immediate(kFPOnStackSize + kPCOnStackSize + kReceiverOnStackSize));
-  const int increment = kSystemPointerSize;
-  Register param = rax;
-  // We have to check the types of the params. The ValueType array contains
-  // first the return then the param types.
-  constexpr int kValueTypeSize = sizeof(wasm::ValueType);
-  static_assert(kValueTypeSize == 4);
-  const int32_t kValueTypeSizeLog2 = log2(kValueTypeSize);
-  // Set the ValueType array pointer to point to the first parameter.
-  Register returns_size = return_count;
-  return_count = no_reg;
-  __ shlq(returns_size, Immediate(kValueTypeSizeLog2));
-  __ addq(valuetypes_array_ptr, returns_size);
-  returns_size = no_reg;
-  Register valuetype = r12;
-
-  Label numeric_params_done;
+  Register original_fp = stack_switch ? r9 : rbp;
+  Register new_wrapper_buffer = stack_switch ? rbx : wrapper_buffer;
+  Label suspend;
   if (stack_switch) {
-    // Prepare for materializing the suspender parameter. We don't materialize
-    // it here but in the next loop that processes references. Here we only
-    // adjust the pointers to keep the state consistent:
-    // - Skip the first valuetype in the signature,
-    // - Adjust the param limit which is off by one because of the extra
-    // param in the signature,
-    // - Set HasRefTypes to 1 to ensure that the reference loop is entered.
-    __ addq(valuetypes_array_ptr, Immediate(kValueTypeSize));
-    __ subq(param_limit, Immediate(kSystemPointerSize));
-    __ movq(MemOperand(rbp, kHasRefTypesOffset), Immediate(1));
-    __ cmpq(current_param, param_limit);
-    __ j(equal, &numeric_params_done);
+    SwitchToAllocatedStack(masm, kWasmInstanceRegister, wrapper_buffer,
+                           original_fp, new_wrapper_buffer, rax, &suspend);
   }
 
-  // -------------------------------------------
-  // Param evaluation loop.
-  // -------------------------------------------
-  Label loop_through_params;
-  __ bind(&loop_through_params);
-
-  __ movq(param, MemOperand(original_fp, current_param, times_1, 0));
-  __ movl(valuetype,
-          Operand(valuetypes_array_ptr, wasm::ValueType::bit_field_offset()));
-
-  // -------------------------------------------
-  // Param conversion.
-  // -------------------------------------------
-  // If param is a Smi we can easily convert it. Otherwise we'll call a builtin
-  // for conversion.
-  Label convert_param;
-  __ cmpq(valuetype, Immediate(wasm::kWasmI32.raw_bit_field()));
-  __ j(not_equal, &convert_param);
-  __ JumpIfNotSmi(param, &convert_param);
-  // Change the param from Smi to int32 (zero extend).
-  __ SmiToInt32(param);
-  // Place the param into the proper slot in Integer section.
-  __ movq(MemOperand(current_int_param_slot, 0), param);
-  __ subq(current_int_param_slot, Immediate(kSystemPointerSize));
-
-  // -------------------------------------------
-  // Param conversion done.
-  // -------------------------------------------
-  Label param_conversion_done;
-  __ bind(&param_conversion_done);
-
-  __ addq(current_param, Immediate(increment));
-  __ addq(valuetypes_array_ptr, Immediate(kValueTypeSize));
-
-  __ cmpq(current_param, param_limit);
-  __ j(not_equal, &loop_through_params);
-  __ bind(&numeric_params_done);
-
-  // -------------------------------------------
-  // Second loop to handle references.
-  // -------------------------------------------
-  // In this loop we iterate over all parameters for a second time and copy all
-  // reference parameters at the end of the integer parameters section.
-  Label ref_params_done;
-  // We check if we have seen a reference in the first parameter loop.
-  Register ref_param_count = param_count;
-  __ movq(ref_param_count, Immediate(0));
-  __ cmpq(MemOperand(rbp, kHasRefTypesOffset), Immediate(0));
-  __ j(equal, &ref_params_done);
-  // We re-calculate the beginning of the value-types array and the beginning of
-  // the parameters ({valuetypes_array_ptr} and {current_param}).
-  __ movq(valuetypes_array_ptr, MemOperand(rbp, kValueTypesArrayStartOffset));
-  return_count = current_param;
-  current_param = no_reg;
-  __ movq(return_count, MemOperand(rbp, kReturnCountOffset));
-  returns_size = return_count;
-  return_count = no_reg;
-  __ shlq(returns_size, Immediate(kValueTypeSizeLog2));
-  __ addq(valuetypes_array_ptr, returns_size);
-
-  current_param = returns_size;
-  returns_size = no_reg;
-  __ Move(current_param,
-          kFPOnStackSize + kPCOnStackSize + kReceiverOnStackSize);
-
+  __ movq(MemOperand(rbp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset),
+          new_wrapper_buffer);
   if (stack_switch) {
-    // Materialize the suspender param
-    __ movq(param, MemOperand(original_fp, kSuspenderOffset));
-    __ movq(MemOperand(current_int_param_slot, 0), param);
-    __ subq(current_int_param_slot, Immediate(kSystemPointerSize));
-    __ addq(valuetypes_array_ptr, Immediate(kValueTypeSize));
-    __ addq(ref_param_count, Immediate(1));
-    __ cmpq(current_param, param_limit);
-    __ j(equal, &ref_params_done);
+    __ movq(MemOperand(rbp, StackSwitchFrameConstants::kInstanceOffset),
+            kWasmInstanceRegister);
+    Register result_array = kScratchRegister;
+    __ movq(result_array,
+            MemOperand(original_fp,
+                       JSToWasmWrapperFrameConstants::kResultArrayParamOffset));
+    __ movq(MemOperand(rbp, StackSwitchFrameConstants::kResultArrayOffset),
+            result_array);
   }
 
-  Label ref_loop_through_params;
-  Label ref_loop_end;
-  // Start of the loop.
-  __ bind(&ref_loop_through_params);
-
-  // Load the current parameter with type.
-  __ movq(param, MemOperand(original_fp, current_param, times_1, 0));
-  __ movl(valuetype,
-          Operand(valuetypes_array_ptr, wasm::ValueType::bit_field_offset()));
-  // Extract the ValueKind of the type, to check for kRef and kRefNull.
-  __ andl(valuetype, Immediate(wasm::kWasmValueKindBitsMask));
-  Label move_ref_to_slot;
-  __ cmpq(valuetype, Immediate(wasm::ValueKind::kRefNull));
-  __ j(equal, &move_ref_to_slot);
-  __ cmpq(valuetype, Immediate(wasm::ValueKind::kRef));
-  __ j(equal, &move_ref_to_slot);
-  __ jmp(&ref_loop_end);
-
-  // Place the param into the proper slot in Integer section.
-  __ bind(&move_ref_to_slot);
-  __ addq(ref_param_count, Immediate(1));
-  __ movq(MemOperand(current_int_param_slot, 0), param);
-  __ subq(current_int_param_slot, Immediate(kSystemPointerSize));
-
-  // Move to the next parameter.
-  __ bind(&ref_loop_end);
-  __ addq(current_param, Immediate(increment));
-  __ addq(valuetypes_array_ptr, Immediate(kValueTypeSize));
-
-  // Check if we finished all parameters.
-  __ cmpq(current_param, param_limit);
-  __ j(not_equal, &ref_loop_through_params);
-
-  __ bind(&ref_params_done);
-  __ movq(valuetype, ref_param_count);
-  ref_param_count = valuetype;
-  valuetype = no_reg;
-  // -------------------------------------------
-  // Move the parameters into the proper param registers.
-  // -------------------------------------------
-  // The Wasm function expects that the params can be popped from the top of the
-  // stack in an increasing order.
-  // We can always move the values on the beginning of the sections into the GP
-  // or FP parameter registers. If the parameter count is less than the number
-  // of parameter registers, we may move values into the registers that are not
-  // in the section.
-  // ----------- S t a t e -------------
-  //  -- r8  : start_int_section
-  //  -- rdi : start_float_section
-  //  -- r10 : current_int_param_slot
-  //  -- r15 : current_float_param_slot
-  //  -- r11 : valuetypes_array_ptr
-  //  -- r12 : valuetype
-  //  -- rsi : wasm_instance
-  //  -- GpParamRegisters = rax, rdx, rcx, rbx, r9
-  // -----------------------------------
-
-  Register temp_params_size = rax;
-  __ movq(temp_params_size, MemOperand(original_fp, kParamCountOffset));
-  __ shlq(temp_params_size, Immediate(kSystemPointerSizeLog2));
-  // We want to use the register of the function_data = rdi.
-  __ movq(MemOperand(rbp, kFunctionDataOffset), function_data);
-  Register start_float_section = function_data;
-  function_data = no_reg;
-  __ movq(start_float_section, rbp);
-  __ addq(start_float_section, Immediate(kIntegerSectionStartOffset));
-  __ subq(start_float_section, temp_params_size);
-  temp_params_size = no_reg;
-  // Fill the FP param registers.
-  __ Movsd(xmm1, MemOperand(start_float_section, 0));
-  __ Movsd(xmm2, MemOperand(start_float_section, -kSystemPointerSize));
-  __ Movsd(xmm3, MemOperand(start_float_section, -2 * kSystemPointerSize));
-  __ Movsd(xmm4, MemOperand(start_float_section, -3 * kSystemPointerSize));
-  __ Movsd(xmm5, MemOperand(start_float_section, -4 * kSystemPointerSize));
-  __ Movsd(xmm6, MemOperand(start_float_section, -5 * kSystemPointerSize));
-  // We want the start to point to the last properly placed param.
-  __ subq(start_float_section, Immediate(5 * kSystemPointerSize));
-
-  Register start_int_section = r8;
-  __ movq(start_int_section, rbp);
-  __ addq(start_int_section, Immediate(kIntegerSectionStartOffset));
-  // Fill the GP param registers.
-  __ movq(rax, MemOperand(start_int_section, 0));
-  __ movq(rdx, MemOperand(start_int_section, -kSystemPointerSize));
-  __ movq(rcx, MemOperand(start_int_section, -2 * kSystemPointerSize));
-  __ movq(rbx, MemOperand(start_int_section, -3 * kSystemPointerSize));
-  __ movq(r9, MemOperand(start_int_section, -4 * kSystemPointerSize));
-  // We want the start to point to the last properly placed param.
-  __ subq(start_int_section, Immediate(4 * kSystemPointerSize));
+  Register result_size = rax;
+  __ movq(
+      result_size,
+      MemOperand(
+          wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferSize));
+  __ shlq(result_size, Immediate(kSystemPointerSizeLog2));
+  __ subq(rsp, result_size);
+  __ movq(
+      MemOperand(
+          new_wrapper_buffer,
+          JSToWasmWrapperFrameConstants::kWrapperBufferStackReturnBufferStart),
+      rsp);
+  Register call_target = rdi;
+  // param_start should not alias with any parameter registers.
+  Register params_start = r11;
+  __ movq(params_start,
+          MemOperand(wrapper_buffer,
+                     JSToWasmWrapperFrameConstants::kWrapperBufferParamStart));
+  Register params_end = rbx;
+  __ movq(params_end,
+          MemOperand(wrapper_buffer,
+                     JSToWasmWrapperFrameConstants::kWrapperBufferParamEnd));
+  __ movq(call_target,
+          MemOperand(wrapper_buffer,
+                     JSToWasmWrapperFrameConstants::kWrapperBufferCallTarget));
+
+  Register last_stack_param = rcx;
+
+  // The first GP parameter is the instance, which we handle specially.
+  int stack_params_offset =
+      (arraysize(wasm::kGpParamRegisters) - 1) * kSystemPointerSize +
+      arraysize(wasm::kFpParamRegisters) * kDoubleSize;
+
+  __ leaq(last_stack_param, MemOperand(params_start, stack_params_offset));
+
+  Label loop_start;
+  __ bind(&loop_start);
+
+  Label finish_stack_params;
+  __ cmpq(last_stack_param, params_end);
+  __ j(greater_equal, &finish_stack_params);
+
+  // Push parameter
+  __ subq(params_end, Immediate(kSystemPointerSize));
+  __ pushq(MemOperand(params_end, 0));
+  __ jmp(&loop_start);
+
+  __ bind(&finish_stack_params);
+
+  int next_offset = 0;
+  for (size_t i = 1; i < arraysize(wasm::kGpParamRegisters); ++i) {
+    // Check that {params_start} does not overlap with any of the parameter
+    // registers, so that we don't overwrite it by accident with the loads
+    // below.
+    DCHECK_NE(params_start, wasm::kGpParamRegisters[i]);
+    __ movq(wasm::kGpParamRegisters[i], MemOperand(params_start, next_offset));
+    next_offset += kSystemPointerSize;
+  }
 
-  // -------------------------------------------
-  // Place the final stack parameters to the proper place.
-  // -------------------------------------------
-  // We want the current_param_slot (insertion) pointers to point at the last
-  // param of the section instead of the next free slot.
-  __ addq(current_int_param_slot, Immediate(kSystemPointerSize));
-  __ addq(current_float_param_slot, Immediate(kSystemPointerSize));
+  for (size_t i = 0; i < arraysize(wasm::kFpParamRegisters); ++i) {
+    __ Movsd(wasm::kFpParamRegisters[i], MemOperand(params_start, next_offset));
+    next_offset += kDoubleSize;
+  }
+  DCHECK_EQ(next_offset, stack_params_offset);
 
-  // -------------------------------------------
-  // Final stack parameters loop.
-  // -------------------------------------------
-  // The parameters that didn't fit into the registers should be placed on the
-  // top of the stack contiguously. The interval of parameters between the
-  // start_section and the current_param_slot pointers define the remaining
-  // parameters of the section.
-  // We can iterate through the valuetypes array to decide from which section we
-  // need to push the parameter onto the top of the stack. By iterating in a
-  // reversed order we can easily pick the last parameter of the proper section.
-  // The parameter of the section is pushed on the top of the stack only if the
-  // interval of remaining params is not empty. This way we ensure that only
-  // params that didn't fit into param registers are pushed again.
-
-  Label loop_through_valuetypes;
-  Label loop_place_ref_params;
-  __ bind(&loop_place_ref_params);
-  __ testq(ref_param_count, ref_param_count);
-  __ j(zero, &loop_through_valuetypes);
-
-  __ cmpq(start_int_section, current_int_param_slot);
-  // if no int or ref param remains, directly iterate valuetypes
-  __ j(less_equal, &loop_through_valuetypes);
-
-  __ pushq(MemOperand(current_int_param_slot, 0));
-  __ addq(current_int_param_slot, Immediate(kSystemPointerSize));
-  __ subq(ref_param_count, Immediate(1));
-  __ jmp(&loop_place_ref_params);
-
-  valuetype = ref_param_count;
-  ref_param_count = no_reg;
-  __ bind(&loop_through_valuetypes);
-
-  // We iterated through the valuetypes array, we are one field over the end in
-  // the beginning. Also, we have to decrement it in each iteration.
-  __ subq(valuetypes_array_ptr, Immediate(kValueTypeSize));
-
-  // Check if there are still remaining integer params.
-  Label continue_loop;
-  __ cmpq(start_int_section, current_int_param_slot);
-  // If there are remaining integer params.
-  __ j(greater, &continue_loop);
-
-  // Check if there are still remaining float params.
-  __ cmpq(start_float_section, current_float_param_slot);
-  // If there aren't any params remaining.
-  Label params_done;
-  __ j(less_equal, &params_done);
-
-  __ bind(&continue_loop);
-  __ movl(valuetype,
-          Operand(valuetypes_array_ptr, wasm::ValueType::bit_field_offset()));
-  Label place_integer_param;
-  Label place_float_param;
-  __ cmpq(valuetype, Immediate(wasm::kWasmI32.raw_bit_field()));
-  __ j(equal, &place_integer_param);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmI64.raw_bit_field()));
-  __ j(equal, &place_integer_param);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmF32.raw_bit_field()));
-  __ j(equal, &place_float_param);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmF64.raw_bit_field()));
-  __ j(equal, &place_float_param);
-
-  // ref params have already been pushed, so go through directly
-  __ jmp(&loop_through_valuetypes);
-
-  // All other types are reference types. We can just fall through to place them
-  // in the integer section.
-
-  __ bind(&place_integer_param);
-  __ cmpq(start_int_section, current_int_param_slot);
-  // If there aren't any integer params remaining, just floats, then go to the
-  // next valuetype.
-  __ j(less_equal, &loop_through_valuetypes);
-
-  // Copy the param from the integer section to the actual parameter area.
-  __ pushq(MemOperand(current_int_param_slot, 0));
-  __ addq(current_int_param_slot, Immediate(kSystemPointerSize));
-  __ jmp(&loop_through_valuetypes);
-
-  __ bind(&place_float_param);
-  __ cmpq(start_float_section, current_float_param_slot);
-  // If there aren't any float params remaining, just integers, then go to the
-  // next valuetype.
-  __ j(less_equal, &loop_through_valuetypes);
-
-  // Copy the param from the float section to the actual parameter area.
-  __ pushq(MemOperand(current_float_param_slot, 0));
-  __ addq(current_float_param_slot, Immediate(kSystemPointerSize));
-  __ jmp(&loop_through_valuetypes);
-
-  __ bind(&params_done);
-  // Restore function_data after we are done with parameter placement.
-  function_data = rdi;
-  __ movq(function_data, MemOperand(rbp, kFunctionDataOffset));
-
-  __ bind(&prepare_for_wasm_call);
-  // -------------------------------------------
-  // Prepare for the Wasm call.
-  // -------------------------------------------
-  // Set thread_in_wasm_flag.
   Register thread_in_wasm_flag_addr = r12;
   __ movq(
       thread_in_wasm_flag_addr,
       MemOperand(kRootRegister, Isolate::thread_in_wasm_flag_address_offset()));
   __ movl(MemOperand(thread_in_wasm_flag_addr, 0), Immediate(1));
-  thread_in_wasm_flag_addr = no_reg;
 
-  Register function_entry = function_data;
-  Register scratch = r12;
-  __ LoadTaggedField(
-      function_entry,
-      FieldOperand(function_data, WasmExportedFunctionData::kInternalOffset));
-  __ LoadExternalPointerField(
-      function_entry,
-      FieldOperand(function_entry, WasmInternalFunction::kCallTargetOffset),
-      kWasmInternalFunctionCallTargetTag, scratch);
-  function_data = no_reg;
-  scratch = no_reg;
-
-  // We set the indicating value for the GC to the proper one for Wasm call.
-  constexpr int kWasmCallGCScanSlotCount = 0;
-  __ Move(MemOperand(rbp, kGCScanSlotCountOffset), kWasmCallGCScanSlotCount);
-
-  // -------------------------------------------
-  // Call the Wasm function.
-  // -------------------------------------------
-  __ call(function_entry);
-  // Note: we might be returning to a different frame if the stack was suspended
-  // and resumed during the call. The new frame is set up by WasmResume and has
-  // a compatible layout.
-  function_entry = no_reg;
-
-  // -------------------------------------------
-  // Resetting after the Wasm call.
-  // -------------------------------------------
-  // Restore rsp to free the reserved stack slots for the sections.
-  __ leaq(rsp, MemOperand(rbp, kLastSpillOffset));
+  __ call(call_target);
 
-  // Unset thread_in_wasm_flag.
-  thread_in_wasm_flag_addr = r8;
   __ movq(
       thread_in_wasm_flag_addr,
       MemOperand(kRootRegister, Isolate::thread_in_wasm_flag_address_offset()));
   __ movl(MemOperand(thread_in_wasm_flag_addr, 0), Immediate(0));
   thread_in_wasm_flag_addr = no_reg;
 
-  // -------------------------------------------
-  // Return handling.
-  // -------------------------------------------
-  return_count = r8;
-  __ movq(return_count, MemOperand(rbp, kReturnCountOffset));
-  Register return_reg = rax;
-
-  // If we have 1 return value, then jump to conversion.
-  __ cmpl(return_count, Immediate(1));
-  Label convert_return;
-  __ j(equal, &convert_return);
+  wrapper_buffer = rcx;
+  for (size_t i = 0; i < arraysize(wasm::kGpReturnRegisters); ++i) {
+    DCHECK_NE(wrapper_buffer, wasm::kGpReturnRegisters[i]);
+  }
 
-  // Otherwise load undefined.
-  __ LoadRoot(return_reg, RootIndex::kUndefinedValue);
+  __ movq(wrapper_buffer,
+          MemOperand(rbp, JSToWasmWrapperFrameConstants::kWrapperBufferOffset));
+
+  __ Movsd(MemOperand(
+               wrapper_buffer,
+               JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister1),
+           wasm::kFpReturnRegisters[0]);
+  __ Movsd(MemOperand(
+               wrapper_buffer,
+               JSToWasmWrapperFrameConstants::kWrapperBufferFPReturnRegister2),
+           wasm::kFpReturnRegisters[1]);
+  __ movq(MemOperand(
+              wrapper_buffer,
+              JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister1),
+          wasm::kGpReturnRegisters[0]);
+  __ movq(MemOperand(
+              wrapper_buffer,
+              JSToWasmWrapperFrameConstants::kWrapperBufferGPReturnRegister2),
+          wasm::kGpReturnRegisters[1]);
+
+  // Call the return value builtin with
+  // rax: wasm instance.
+  // rbx: the result JSArray for multi-return.
+  // rcx: pointer to the byte buffer which contains all parameters.
+  if (stack_switch) {
+    __ movq(rbx,
+            MemOperand(rbp, StackSwitchFrameConstants::kResultArrayOffset));
+    __ movq(rax, MemOperand(rbp, StackSwitchFrameConstants::kInstanceOffset));
+  } else {
+    __ movq(rbx,
+            MemOperand(rbp,
+                       JSToWasmWrapperFrameConstants::kResultArrayParamOffset));
+    __ movq(rax, MemOperand(
+                     rbp, JSToWasmWrapperFrameConstants::kInstanceParamOffset));
+  }
+  __ Call(BUILTIN_CODE(masm->isolate(), JSToWasmHandleReturns),
+          RelocInfo::CODE_TARGET);
 
-  Label return_done;
-  __ bind(&return_done);
+  Label return_promise;
   if (stack_switch) {
-    ReloadParentContinuation(masm, wasm_instance, return_reg, rbx, rcx);
-    RestoreParentSuspender(masm, rbx, rcx);
+    SwitchBackAndReturnPromise(masm, rbx, rcx, &return_promise);
   }
   __ bind(&suspend);
-  // No need to process the return value if the stack is suspended, there is a
-  // single 'externref' value (the promise) which doesn't require conversion.
-
-  __ movq(param_count, MemOperand(rbp, kParamCountOffset));
-
-  // Calculate the number of parameters we have to pop off the stack. This
-  // number is max(in_param_count, param_count).
-  in_param_count = rdx;
-  __ movq(in_param_count, MemOperand(rbp, kInParamCountOffset));
-  __ cmpq(param_count, in_param_count);
-  __ cmovq(less, param_count, in_param_count);
 
-  // -------------------------------------------
-  // Deconstrunct the stack frame.
-  // -------------------------------------------
   __ LeaveFrame(stack_switch ? StackFrame::STACK_SWITCH
                              : StackFrame::JS_TO_WASM);
-
-  // We have to remove the caller frame slots:
-  //  - JS arguments
-  //  - the receiver
-  // and transfer the control to the return address (the return address is
-  // expected to be on the top of the stack).
-  // We cannot use just the ret instruction for this, because we cannot pass the
-  // number of slots to remove in a Register as an argument.
-  __ DropArguments(param_count, rbx, MacroAssembler::kCountIsInteger,
-                   MacroAssembler::kCountExcludesReceiver);
   __ ret(0);
 
-  // --------------------------------------------------------------------------
-  //                          Deferred code.
-  // --------------------------------------------------------------------------
-
-  // -------------------------------------------
-  // Param conversion builtins.
-  // -------------------------------------------
-  __ bind(&convert_param);
-  // Restore function_data register (which was clobbered by the code above,
-  // but was valid when jumping here earlier).
-  function_data = rdi;
-  // The order of pushes is important. We want the heap objects, that should be
-  // scanned by GC, to be on the top of the stack.
-  // We have to set the indicating value for the GC to the number of values on
-  // the top of the stack that have to be scanned before calling the builtin
-  // function.
-  // The builtin expects the parameter to be in register param = rax.
-
-  constexpr int kBuiltinCallGCScanSlotCount = 2;
-  PrepareForBuiltinCall(masm, MemOperand(rbp, kGCScanSlotCountOffset),
-                        kBuiltinCallGCScanSlotCount, current_param, param_limit,
-                        current_int_param_slot, current_float_param_slot,
-                        valuetypes_array_ptr, wasm_instance, function_data,
-                        original_fp);
-
-  Label param_kWasmI32_not_smi;
-  Label param_kWasmI64;
-  Label param_kWasmF32;
-  Label param_kWasmF64;
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmI32.raw_bit_field()));
-  __ j(equal, &param_kWasmI32_not_smi);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmI64.raw_bit_field()));
-  __ j(equal, &param_kWasmI64);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmF32.raw_bit_field()));
-  __ j(equal, &param_kWasmF32);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmF64.raw_bit_field()));
-  __ j(equal, &param_kWasmF64);
-
-  // The parameter is a reference. We do not convert the parameter immediately.
-  // Instead we will later loop over all parameters again to handle reference
-  // parameters. The reason is that later value type parameters may trigger a
-  // GC, and we cannot keep reference parameters alive then. Instead we leave
-  // reference parameters at their initial place on the stack and only copy them
-  // once no GC can happen anymore.
-  // As an optimization we set a flag here that indicates that we have seen a
-  // reference so far. If there was no reference parameter, we would not iterate
-  // over the parameters for a second time.
-  __ movq(MemOperand(rbp, kHasRefTypesOffset), Immediate(1));
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, current_param,
-                          original_fp);
-  __ jmp(&param_conversion_done);
-
-  __ int3();
-
-  __ bind(&param_kWasmI32_not_smi);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmTaggedNonSmiToInt32),
-          RelocInfo::CODE_TARGET);
-  // Param is the result of the builtin.
-  __ AssertZeroExtended(param);
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, current_param,
-                          original_fp);
-  __ movq(MemOperand(current_int_param_slot, 0), param);
-  __ subq(current_int_param_slot, Immediate(kSystemPointerSize));
-  __ jmp(&param_conversion_done);
-
-  __ bind(&param_kWasmI64);
-  __ Call(BUILTIN_CODE(masm->isolate(), BigIntToI64), RelocInfo::CODE_TARGET);
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, current_param,
-                          original_fp);
-  __ movq(MemOperand(current_int_param_slot, 0), param);
-  __ subq(current_int_param_slot, Immediate(kSystemPointerSize));
-  __ jmp(&param_conversion_done);
-
-  __ bind(&param_kWasmF32);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmTaggedToFloat64),
-          RelocInfo::CODE_TARGET);
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, current_param,
-                          original_fp);
-  // Clear higher bits.
-  __ Xorpd(xmm1, xmm1);
-  // Truncate float64 to float32.
-  __ Cvtsd2ss(xmm1, xmm0);
-  __ Movsd(MemOperand(current_float_param_slot, 0), xmm1);
-  __ subq(current_float_param_slot, Immediate(kSystemPointerSize));
-  __ jmp(&param_conversion_done);
-
-  __ bind(&param_kWasmF64);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmTaggedToFloat64),
-          RelocInfo::CODE_TARGET);
-  RestoreAfterBuiltinCall(masm, function_data, wasm_instance,
-                          valuetypes_array_ptr, current_float_param_slot,
-                          current_int_param_slot, param_limit, current_param,
-                          original_fp);
-  __ Movsd(MemOperand(current_float_param_slot, 0), xmm0);
-  __ subq(current_float_param_slot, Immediate(kSystemPointerSize));
-  __ jmp(&param_conversion_done);
-
-  // -------------------------------------------
-  // Return conversions.
-  // -------------------------------------------
-  __ bind(&convert_return);
-  // We have to make sure that the kGCScanSlotCount is set correctly when we
-  // call the builtins for conversion. For these builtins it's the same as for
-  // the Wasm call, that is, kGCScanSlotCount = 0, so we don't have to reset it.
-  // We don't need the JS context for these builtin calls.
-
-  __ movq(valuetypes_array_ptr, MemOperand(rbp, kValueTypesArrayStartOffset));
-  // The first valuetype of the array is the return's valuetype.
-  __ movl(valuetype,
-          Operand(valuetypes_array_ptr, wasm::ValueType::bit_field_offset()));
-
-  Label return_kWasmI32;
-  Label return_kWasmI64;
-  Label return_kWasmF32;
-  Label return_kWasmF64;
-  Label return_kWasmFuncRef;
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmI32.raw_bit_field()));
-  __ j(equal, &return_kWasmI32);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmI64.raw_bit_field()));
-  __ j(equal, &return_kWasmI64);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmF32.raw_bit_field()));
-  __ j(equal, &return_kWasmF32);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmF64.raw_bit_field()));
-  __ j(equal, &return_kWasmF64);
-
-  __ cmpq(valuetype, Immediate(wasm::kWasmFuncRef.raw_bit_field()));
-  __ j(equal, &return_kWasmFuncRef);
-
-  // All types that are not SIMD are reference types.
-  __ cmpq(valuetype, Immediate(wasm::kWasmS128.raw_bit_field()));
-  // References can be passed to JavaScript as is.
-  __ j(not_equal, &return_done);
-
-  __ int3();
-
-  __ bind(&return_kWasmI32);
-  Label to_heapnumber;
-  // If pointer compression is disabled, we can convert the return to a smi.
-  if (SmiValuesAre32Bits()) {
-    __ SmiTag(return_reg);
-  } else {
-    Register temp = rbx;
-    __ movq(temp, return_reg);
-    // Double the return value to test if it can be a Smi.
-    __ addl(temp, return_reg);
-    temp = no_reg;
-    // If there was overflow, convert the return value to a HeapNumber.
-    __ j(overflow, &to_heapnumber);
-    // If there was no overflow, we can convert to Smi.
-    __ SmiTag(return_reg);
-  }
-  __ jmp(&return_done);
-
-  // Handle the conversion of the I32 return value to HeapNumber when it cannot
-  // be a smi.
-  __ bind(&to_heapnumber);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmInt32ToHeapNumber),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  __ bind(&return_kWasmI64);
-  __ Call(BUILTIN_CODE(masm->isolate(), I64ToBigInt), RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  __ bind(&return_kWasmF32);
-  // The builtin expects the value to be in xmm0.
-  __ Movss(xmm0, xmm1);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmFloat32ToNumber),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  __ bind(&return_kWasmF64);
-  // The builtin expects the value to be in xmm0.
-  __ Movsd(xmm0, xmm1);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmFloat64ToNumber),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  __ bind(&return_kWasmFuncRef);
-  __ Call(BUILTIN_CODE(masm->isolate(), WasmFuncRefToJS),
-          RelocInfo::CODE_TARGET);
-  __ jmp(&return_done);
-
-  if (!stack_switch) {
-    // -------------------------------------------
-    // Kick off compilation.
-    // -------------------------------------------
-    __ bind(&compile_wrapper);
-    // Enable GC.
-    MemOperand GCScanSlotPlace = MemOperand(rbp, kGCScanSlotCountOffset);
-    __ Move(GCScanSlotPlace, 4);
-    // Save registers to the stack.
-    __ pushq(wasm_instance);
-    __ pushq(function_data);
-    // Push the arguments for the runtime call.
-    __ Push(wasm_instance);  // first argument
-    __ Push(function_data);  // second argument
-                             // Set up context.
-    __ Move(kContextRegister, Smi::zero());
-    // Call the runtime function that kicks off compilation.
-    __ CallRuntime(Runtime::kWasmCompileWrapper, 2);
-    // Pop the result.
-    __ movq(r9, kReturnRegister0);
-    // Restore registers from the stack.
-    __ popq(function_data);
-    __ popq(wasm_instance);
-    __ jmp(&compile_wrapper_done);
+  // Catch handler for the stack-switching wrapper: reject the promise with the
+  // thrown exception.
+  if (stack_switch) {
+    GenerateExceptionHandlingLandingPad(masm, &return_promise);
   }
 }
 }  // namespace
 
-void Builtins::Generate_GenericJSToWasmWrapper(MacroAssembler* masm) {
-  GenericJSToWasmWrapperHelper(masm, false);
+void Builtins::Generate_JSToWasmWrapperAsm(MacroAssembler* masm) {
+  JSToWasmWrapperHelper(masm, false);
 }
 
-void Builtins::Generate_WasmReturnPromiseOnSuspend(MacroAssembler* masm) {
-  GenericJSToWasmWrapperHelper(masm, true);
+void Builtins::Generate_WasmReturnPromiseOnSuspendAsm(MacroAssembler* masm) {
+  JSToWasmWrapperHelper(masm, true);
+}
+
+void Builtins::Generate_WasmToJsWrapperAsm(MacroAssembler* masm) {
+  // Pop the return address into a scratch register and push it later again. The
+  // return address has to be on top of the stack after all registers have been
+  // pushed, so that the return instruction can find it.
+  __ popq(kScratchRegister);
+
+  int required_stack_space = arraysize(wasm::kFpParamRegisters) * kDoubleSize;
+  __ subq(rsp, Immediate(required_stack_space));
+  for (int i = 0; i < static_cast<int>(arraysize(wasm::kFpParamRegisters));
+       ++i) {
+    __ Movsd(MemOperand(rsp, i * kDoubleSize), wasm::kFpParamRegisters[i]);
+  }
+  // Push the GP registers in reverse order so that they are on the stack like
+  // in an array, with the first item being at the lowest address.
+  for (size_t i = arraysize(wasm::kGpParamRegisters) - 1; i > 0; --i) {
+    __ pushq(wasm::kGpParamRegisters[i]);
+  }
+  // Decrement the stack to allocate a stack slot. The signature gets written
+  // into the slot in Torque.
+  __ pushq(rax);
+  // Push the return address again.
+  __ pushq(kScratchRegister);
+  __ TailCallBuiltin(Builtin::kWasmToJsWrapperCSA);
 }
 
 void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   // Set up the stackframe.
   __ EnterFrame(StackFrame::STACK_SWITCH);
 
-  Register promise = rax;
-  Register suspender = rbx;
+  Register suspender = rax;
 
-  __ subq(rsp, Immediate(-(BuiltinWasmWrapperConstants::kGCScanSlotCountOffset -
-                           TypedFrameConstants::kFixedFrameSizeFromFp)));
+  __ AllocateStackSpace(StackSwitchFrameConstants::kNumSpillSlots *
+                        kSystemPointerSize);
+  // Set a sentinel value for the spill slots visited by the GC.
+  ResetStackSwitchFrameStackSlots(masm);
 
   // -------------------------------------------
   // Save current state in active jump buffer.
@@ -4127,21 +3643,17 @@ void Builtins::Generate_WasmSuspend(MacroAssembler* masm) {
   // -------------------------------------------
   // Load jump buffer.
   // -------------------------------------------
-  MemOperand GCScanSlotPlace =
-      MemOperand(rbp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
-  __ Move(GCScanSlotPlace, 2);
-  __ Push(promise);
-  __ Push(caller);
-  __ Move(kContextRegister, Smi::zero());
-  __ CallRuntime(Runtime::kWasmSyncStackLimit);
-  __ Pop(caller);
-  __ Pop(promise);
+  SyncStackLimit(masm, caller, suspender);
   jmpbuf = caller;
   __ LoadExternalPointerField(
       jmpbuf, FieldOperand(caller, WasmContinuationObject::kJmpbufOffset),
       kWasmContinuationJmpbufTag, r8);
   caller = no_reg;
-  __ movq(kReturnRegister0, promise);
+  __ LoadTaggedField(
+      kReturnRegister0,
+      FieldOperand(suspender, WasmSuspenderObject::kPromiseOffset));
+  MemOperand GCScanSlotPlace =
+      MemOperand(rbp, StackSwitchFrameConstants::kGCScanSlotCountOffset);
   __ Move(GCScanSlotPlace, 0);
   LoadJumpBuffer(masm, jmpbuf, true);
   __ Trap();
@@ -4162,20 +3674,10 @@ void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) {
   __ decq(param_count);                    // Exclude receiver.
   Register closure = kJSFunctionRegister;  // rdi
 
-  // These slots are not used in this builtin. But when we return from the
-  // resumed continuation, we return to the GenericJSToWasmWrapper code, which
-  // expects these slots to be set.
-  constexpr int kInParamCountOffset =
-      BuiltinWasmWrapperConstants::kInParamCountOffset;
-  constexpr int kParamCountOffset =
-      BuiltinWasmWrapperConstants::kParamCountOffset;
-  __ subq(rsp, Immediate(3 * kSystemPointerSize));
-  __ movq(MemOperand(rbp, kParamCountOffset), param_count);
-  __ movq(MemOperand(rbp, kInParamCountOffset), param_count);
-  // Set a sentinel value for the spill slot visited by the GC.
-  __ LoadRoot(kScratchRegister, RootIndex::kUndefinedValue);
-  __ movq(MemOperand(rbp, BuiltinWasmWrapperConstants::kSuspenderOffset),
-          kScratchRegister);
+  __ AllocateStackSpace(StackSwitchFrameConstants::kNumSpillSlots *
+                        kSystemPointerSize);
+  // Set a sentinel value for the spill slots visited by the GC.
+  ResetStackSwitchFrameStackSlots(masm);
 
   param_count = no_reg;
 
@@ -4258,13 +3760,7 @@ void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) {
   __ movq(masm->RootAsOperand(RootIndex::kActiveContinuation),
           target_continuation);
 
-  MemOperand GCScanSlotPlace =
-      MemOperand(rbp, BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
-  __ Move(GCScanSlotPlace, 1);
-  __ Push(target_continuation);
-  __ Move(kContextRegister, Smi::zero());
-  __ CallRuntime(Runtime::kWasmSyncStackLimit);
-  __ Pop(target_continuation);
+  SyncStackLimit(masm, target_continuation);
 
   // -------------------------------------------
   // Load state from target jmpbuf (longjmp).
@@ -4276,12 +3772,17 @@ void Generate_WasmResumeHelper(MacroAssembler* masm, wasm::OnResume on_resume) {
       kWasmContinuationJmpbufTag, rax);
   // Move resolved value to return register.
   __ movq(kReturnRegister0, Operand(rbp, 3 * kSystemPointerSize));
-  __ Move(GCScanSlotPlace, 0);
+  __ Move(MemOperand(rbp, StackSwitchFrameConstants::kGCScanSlotCountOffset),
+          0);
   if (on_resume == wasm::OnResume::kThrow) {
     // Switch to the continuation's stack without restoring the PC.
     LoadJumpBuffer(masm, target_jmpbuf, false);
+    // Pop this frame now. The unwinder expects that the first STACK_SWITCH
+    // frame is the outermost one.
+    __ LeaveFrame(StackFrame::STACK_SWITCH);
     // Forward the onRejected value to kThrow.
     __ pushq(kReturnRegister0);
+    __ Move(kContextRegister, Smi::zero());
     __ CallRuntime(Runtime::kThrow);
   } else {
     // Resume the continuation normally.
@@ -4310,10 +3811,108 @@ void Builtins::Generate_WasmOnStackReplace(MacroAssembler* masm) {
   __ jmp(kScratchRegister);
 }
 
+namespace {
+static constexpr Register kOldSPRegister = r12;
+
+void SwitchToTheCentralStackIfNeeded(MacroAssembler* masm,
+                                     int r12_stack_slot_index) {
+  using ER = ExternalReference;
+
+  // Store r12 value on the stack to restore on exit from the builtin.
+  __ movq(ExitFrameStackSlotOperand(r12_stack_slot_index * kSystemPointerSize),
+          r12);
+
+  // kOldSPRegister used as a switch flag, if it is zero - no switch performed
+  // if it is not zero, it contains old sp value.
+  __ Move(kOldSPRegister, 0);
+
+  // Using arg1-2 regs as temporary registers, because they will be rewritten
+  // before exiting to native code anyway.
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2, kOldSPRegister, rax, rbx, r15));
+
+  ER on_central_stack_flag = ER::Create(
+      IsolateAddressId::kIsOnCentralStackFlagAddress, masm->isolate());
+
+  Label do_not_need_to_switch;
+  __ cmpb(__ ExternalReferenceAsOperand(on_central_stack_flag), Immediate(0));
+  __ j(not_zero, &do_not_need_to_switch);
+
+  // Perform switching to the central stack.
+
+  __ movq(kOldSPRegister, rsp);
+
+  static constexpr Register argc_input = rax;
+  Register central_stack_sp = arg_reg_2;
+  DCHECK(!AreAliased(central_stack_sp, argc_input));
+  {
+    FrameScope scope(masm, StackFrame::MANUAL);
+    __ pushq(argc_input);
+
+    __ Move(arg_reg_1, ER::isolate_address(masm->isolate()));
+    __ Move(arg_reg_2, kOldSPRegister);
+    __ PrepareCallCFunction(2);
+    __ CallCFunction(ER::wasm_switch_to_the_central_stack(), 2);
+    __ movq(central_stack_sp, kReturnRegister0);
+
+    __ popq(argc_input);
+  }
+
+  static constexpr int kReturnAddressSlotOffset = 1 * kSystemPointerSize;
+  __ subq(central_stack_sp, Immediate(kReturnAddressSlotOffset));
+  __ movq(rsp, central_stack_sp);
+  // rsp should be aligned by 16 bytes,
+  // but it is not guaranteed for stored SP.
+  __ AlignStackPointer();
+
+#ifdef V8_TARGET_OS_WIN
+  // When we switch stack we leave home space allocated on the old stack.
+  // Allocate home space on the central stack to prevent stack corruption.
+  __ subq(rsp, Immediate(kWindowsHomeStackSlots * kSystemPointerSize));
+#endif  // V8_TARGET_OS_WIN
+
+  // Update the sp saved in the frame.
+  // It will be used to calculate the callee pc during GC.
+  // The pc is going to be on the new stack segment, so rewrite it here.
+  __ movq(Operand(rbp, ExitFrameConstants::kSPOffset), rsp);
+
+  __ bind(&do_not_need_to_switch);
+}
+
+void SwitchFromTheCentralStackIfNeeded(MacroAssembler* masm,
+                                       int r12_stack_slot_index) {
+  using ER = ExternalReference;
+
+  Label no_stack_change;
+  __ cmpq(kOldSPRegister, Immediate(0));
+  __ j(equal, &no_stack_change);
+  __ movq(rsp, kOldSPRegister);
+
+  {
+    FrameScope scope(masm, StackFrame::MANUAL);
+    __ pushq(kReturnRegister0);
+    __ pushq(kReturnRegister1);
+
+    __ Move(arg_reg_1, ER::isolate_address(masm->isolate()));
+    __ PrepareCallCFunction(1);
+    __ CallCFunction(ER::wasm_switch_from_the_central_stack(), 1);
+
+    __ popq(kReturnRegister1);
+    __ popq(kReturnRegister0);
+  }
+
+  __ bind(&no_stack_change);
+
+  // Restore previous value of r12.
+  __ movq(r12,
+          ExitFrameStackSlotOperand(r12_stack_slot_index * kSystemPointerSize));
+}
+}  // namespace
+
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
-                               ArgvMode argv_mode, bool builtin_exit_frame) {
+                               ArgvMode argv_mode, bool builtin_exit_frame,
+                               bool switch_to_central_stack) {
   CHECK(result_size == 1 || result_size == 2);
 
   using ER = ExternalReference;
@@ -4327,24 +3926,28 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
   // If argv_mode == ArgvMode::kRegister:
   // r15: pointer to the first argument
 
+  const int kSwitchToTheCentralStackSlots = switch_to_central_stack ? 1 : 0;
 #ifdef V8_TARGET_OS_WIN
   // Windows 64-bit ABI only allows a single-word to be returned in register
   // rax. Larger return sizes must be written to an address passed as a hidden
   // first argument.
   static constexpr int kMaxRegisterResultSize = 1;
-  const int kReservedStackSlots =
-      result_size <= kMaxRegisterResultSize ? 0 : result_size;
+  const int kReservedStackSlots = kSwitchToTheCentralStackSlots +
+      (result_size <= kMaxRegisterResultSize ? 0 : result_size);
 #else
   // Simple results are returned in rax, and a struct of two pointers are
   // returned in rax+rdx.
   static constexpr int kMaxRegisterResultSize = 2;
-  static constexpr int kReservedStackSlots = 0;
+  const int kReservedStackSlots = kSwitchToTheCentralStackSlots;
   CHECK_LE(result_size, kMaxRegisterResultSize);
 #endif  // V8_TARGET_OS_WIN
+#if V8_ENABLE_WEBASSEMBLY
+  const int kR12SpillSlot = kReservedStackSlots - 1;
+#endif  // V8_ENABLE_WEBASSEMBLY
 
-  __ EnterExitFrame(kReservedStackSlots, builtin_exit_frame
-                                             ? StackFrame::BUILTIN_EXIT
-                                             : StackFrame::EXIT);
+  __ EnterExitFrame(
+      kReservedStackSlots,
+      builtin_exit_frame ? StackFrame::BUILTIN_EXIT : StackFrame::EXIT, rbx);
 
   // Set up argv in a callee-saved register. It is reused below so it must be
   // retained across the C call. In case of ArgvMode::kRegister, r15 has
@@ -4363,6 +3966,12 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
   // rax: number of arguments including receiver
   // r15: argv pointer (C callee-saved).
 
+#if V8_ENABLE_WEBASSEMBLY
+  if (switch_to_central_stack) {
+    SwitchToTheCentralStackIfNeeded(masm, kR12SpillSlot);
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
+
   // Check stack alignment.
   if (v8_flags.debug_code) {
     __ CheckStackAlignment();
@@ -4380,7 +3989,7 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
 #ifdef V8_TARGET_OS_WIN
     DCHECK_LE(result_size, 2);
     // Pass a pointer to the result location as the first argument.
-    __ leaq(arg_reg_1, ExitFrameStackSlotOperand(0));
+    __ leaq(arg_reg_1, ExitFrameStackSlotOperand(0 * kSystemPointerSize));
     // Pass a pointer to the Arguments object as the second argument.
     __ movq(arg_reg_2, rax);            // argc.
     __ movq(arg_reg_3, kArgvRegister);  // argv.
@@ -4395,13 +4004,21 @@ void Builtins::Generate_CEntry(MacroAssembler* masm, int result_size,
   if (result_size > kMaxRegisterResultSize) {
     // Read result values stored on stack.
     DCHECK_EQ(result_size, 2);
-    __ movq(kReturnRegister0, ExitFrameStackSlotOperand(0));
-    __ movq(kReturnRegister1, ExitFrameStackSlotOperand(1));
+    __ movq(kReturnRegister0,
+            ExitFrameStackSlotOperand(0 * kSystemPointerSize));
+    __ movq(kReturnRegister1,
+            ExitFrameStackSlotOperand(1 * kSystemPointerSize));
   }
 #endif  // V8_TARGET_OS_WIN
 
   // Result is in rax or rdx:rax - do not destroy these registers!
 
+#if V8_ENABLE_WEBASSEMBLY
+  if (switch_to_central_stack) {
+    SwitchFromTheCentralStackIfNeeded(masm, kR12SpillSlot);
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
+
   // Check result for exception sentinel.
   Label exception_returned;
   __ CompareRoot(rax, RootIndex::kException);
@@ -4556,164 +4173,6 @@ void Builtins::Generate_DoubleToI(MacroAssembler* masm) {
   __ ret(0);
 }
 
-namespace {
-
-int Offset(ExternalReference ref0, ExternalReference ref1) {
-  int64_t offset = (ref0.address() - ref1.address());
-  // Check that fits into int.
-  DCHECK(static_cast<int>(offset) == offset);
-  return static_cast<int>(offset);
-}
-
-// Calls an API function.  Allocates HandleScope, extracts returned value
-// from handle and propagates exceptions.  Clobbers r12, r15, rbx and
-// caller-save registers.  Restores context.  On return removes
-// stack_space * kSystemPointerSize (GCed).
-void CallApiFunctionAndReturn(MacroAssembler* masm, Register function_address,
-                              ExternalReference thunk_ref,
-                              Register thunk_last_arg, int stack_space,
-                              Operand* stack_space_operand,
-                              Operand return_value_operand) {
-  Label promote_scheduled_exception;
-  Label delete_allocated_handles;
-  Label leave_exit_frame;
-
-  Isolate* isolate = masm->isolate();
-  Factory* factory = isolate->factory();
-  ExternalReference next_address =
-      ExternalReference::handle_scope_next_address(isolate);
-  const int kNextOffset = 0;
-  const int kLimitOffset = Offset(
-      ExternalReference::handle_scope_limit_address(isolate), next_address);
-  const int kLevelOffset = Offset(
-      ExternalReference::handle_scope_level_address(isolate), next_address);
-  ExternalReference scheduled_exception_address =
-      ExternalReference::scheduled_exception_address(isolate);
-
-  DCHECK(rdx == function_address || r8 == function_address);
-  // Allocate HandleScope in callee-save registers.
-  Register prev_next_address_reg = r12;
-  Register prev_limit_reg = rbx;
-  Register base_reg = r15;
-  __ Move(base_reg, next_address);
-  __ movq(prev_next_address_reg, Operand(base_reg, kNextOffset));
-  __ movq(prev_limit_reg, Operand(base_reg, kLimitOffset));
-  __ addl(Operand(base_reg, kLevelOffset), Immediate(1));
-
-  Label profiler_enabled, done_api_call;
-  __ cmpb(__ ExternalReferenceAsOperand(
-              ExternalReference::is_profiling_address(isolate), rax),
-          Immediate(0));
-  __ j(not_zero, &profiler_enabled);
-#ifdef V8_RUNTIME_CALL_STATS
-  __ Move(rax, ExternalReference::address_of_runtime_stats_flag());
-  __ cmpl(Operand(rax, 0), Immediate(0));
-  __ j(not_zero, &profiler_enabled);
-#endif  // V8_RUNTIME_CALL_STATS
-
-  // Call the api function directly.
-  __ call(function_address);
-  __ bind(&done_api_call);
-
-  // Load the value from ReturnValue
-  __ movq(rax, return_value_operand);
-
-  // No more valid handles (the result handle was the last one). Restore
-  // previous handle scope.
-  __ subl(Operand(base_reg, kLevelOffset), Immediate(1));
-  __ movq(Operand(base_reg, kNextOffset), prev_next_address_reg);
-  __ cmpq(prev_limit_reg, Operand(base_reg, kLimitOffset));
-  __ j(not_equal, &delete_allocated_handles);
-
-  // Leave the API exit frame.
-  __ bind(&leave_exit_frame);
-  if (stack_space_operand != nullptr) {
-    DCHECK_EQ(stack_space, 0);
-    __ movq(rbx, *stack_space_operand);
-  }
-  __ LeaveExitFrame();
-
-  // Check if the function scheduled an exception.
-  __ Move(rdi, scheduled_exception_address);
-  __ Cmp(Operand(rdi, 0), factory->the_hole_value());
-  __ j(not_equal, &promote_scheduled_exception);
-
-#if DEBUG
-  // Check if the function returned a valid JavaScript value.
-  Label ok;
-  Register return_value = rax;
-  Register map = rcx;
-
-  __ JumpIfSmi(return_value, &ok, Label::kNear);
-  __ LoadMap(map, return_value);
-  __ CmpInstanceType(map, LAST_NAME_TYPE);
-  __ j(below_equal, &ok, Label::kNear);
-
-  __ CmpInstanceType(map, FIRST_JS_RECEIVER_TYPE);
-  __ j(above_equal, &ok, Label::kNear);
-
-  __ CompareRoot(map, RootIndex::kHeapNumberMap);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(map, RootIndex::kBigIntMap);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(return_value, RootIndex::kUndefinedValue);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(return_value, RootIndex::kTrueValue);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(return_value, RootIndex::kFalseValue);
-  __ j(equal, &ok, Label::kNear);
-
-  __ CompareRoot(return_value, RootIndex::kNullValue);
-  __ j(equal, &ok, Label::kNear);
-
-  __ Abort(AbortReason::kAPICallReturnedInvalidObject);
-
-  __ bind(&ok);
-#endif
-
-  if (stack_space_operand == nullptr) {
-    DCHECK_NE(stack_space, 0);
-    __ ret(stack_space * kSystemPointerSize);
-  } else {
-    DCHECK_EQ(stack_space, 0);
-    __ PopReturnAddressTo(rcx);
-    // {stack_space_operand} was loaded into {rbx} above.
-    __ addq(rsp, rbx);
-    // Push and ret (instead of jmp) to keep the RSB and the CET shadow stack
-    // balanced.
-    __ PushReturnAddressFrom(rcx);
-    __ ret(0);
-  }
-
-  // Call the api function via thunk wrapper.
-  __ bind(&profiler_enabled);
-  // Third parameter is the address of the actual getter function.
-  __ Move(thunk_last_arg, function_address);
-  __ Move(rax, thunk_ref);
-  __ call(rax);
-  __ jmp(&done_api_call);
-
-  // Re-throw by promoting a scheduled exception.
-  __ bind(&promote_scheduled_exception);
-  __ TailCallRuntime(Runtime::kPromoteScheduledException);
-
-  // HandleScope limit has changed. Delete allocated extensions.
-  __ bind(&delete_allocated_handles);
-  __ movq(Operand(base_reg, kLimitOffset), prev_limit_reg);
-  __ movq(prev_limit_reg, rax);
-  __ LoadAddress(arg_reg_1, ExternalReference::isolate_address(isolate));
-  __ LoadAddress(rax, ExternalReference::delete_handle_scope_extensions());
-  __ call(rax);
-  __ movq(rax, prev_limit_reg);
-  __ jmp(&leave_exit_frame);
-}
-
-}  // namespace
-
 // TODO(jgruber): Instead of explicitly setting up implicit_args_ on the stack
 // in CallApiCallback, we could use the calling convention to set up the stack
 // correctly in the first place.
@@ -4721,13 +4180,20 @@ void CallApiFunctionAndReturn(MacroAssembler* masm, Register function_address,
 // TODO(jgruber): I suspect that most of CallApiCallback could be implemented
 // as a C++ trampoline, vastly simplifying the assembly implementation.
 
-void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
+void Builtins::Generate_CallApiCallbackImpl(MacroAssembler* masm,
+                                            CallApiCallbackMode mode) {
   // ----------- S t a t e -------------
-  //  -- rsi                 : context
+  // CallApiCallbackMode::kGeneric mode:
+  //  -- rcx                 : arguments count (not including the receiver)
+  //  -- rbx                 : call handler info
+  //  -- r8                  : holder
+  // CallApiCallbackMode::kOptimizedNoProfiling/kOptimized modes:
   //  -- rdx                 : api function address
   //  -- rcx                 : arguments count (not including the receiver)
   //  -- rbx                 : call data
   //  -- rdi                 : holder
+  // Both modes:
+  //  -- rsi                 : context
   //  -- rsp[0]              : return address
   //  -- rsp[8]              : argument 0 (receiver)
   //  -- rsp[16]             : argument 1
@@ -4736,22 +4202,44 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   //  -- rsp[(argc + 1) * 8] : argument argc
   // -----------------------------------
 
-  Register api_function_address = rdx;
-  Register argc = rcx;
-  Register call_data = rbx;
-  Register holder = rdi;
+  Register function_callback_info_arg = arg_reg_1;
 
-  DCHECK(!AreAliased(api_function_address, argc, holder, call_data,
-                     kScratchRegister));
+  Register api_function_address = no_reg;
+  Register argc = no_reg;
+  Register call_data = no_reg;
+  Register callback = no_reg;
+  Register holder = no_reg;
+  Register scratch = rax;
+  Register scratch2 = no_reg;
+
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      api_function_address = rdx;
+      scratch2 = r9;
+      argc = CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister();
+      callback = CallApiCallbackGenericDescriptor::CallHandlerInfoRegister();
+      holder = CallApiCallbackGenericDescriptor::HolderRegister();
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      api_function_address =
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister();
+      argc = CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister();
+      call_data = CallApiCallbackOptimizedDescriptor::CallDataRegister();
+      holder = CallApiCallbackOptimizedDescriptor::HolderRegister();
+      break;
+  }
+  DCHECK(!AreAliased(api_function_address, argc, holder, call_data, callback,
+                     scratch, scratch2, kScratchRegister));
 
-  using FCI = FunctionCallbackInfo<v8::Value>;
   using FCA = FunctionCallbackArguments;
 
   static_assert(FCA::kArgsLength == 6);
   static_assert(FCA::kNewTargetIndex == 5);
   static_assert(FCA::kDataIndex == 4);
   static_assert(FCA::kReturnValueIndex == 3);
-  static_assert(FCA::kReturnValueDefaultValueIndex == 2);
+  static_assert(FCA::kUnusedIndex == 2);
   static_assert(FCA::kIsolateIndex == 1);
   static_assert(FCA::kHolderIndex == 0);
 
@@ -4762,87 +4250,147 @@ void Builtins::Generate_CallApiCallback(MacroAssembler* masm) {
   //
   // Target state:
   //   rsp[0 * kSystemPointerSize]: return address
-  //   rsp[1 * kSystemPointerSize]: kHolder
+  //   rsp[1 * kSystemPointerSize]: kHolder   <= implicit_args_
   //   rsp[2 * kSystemPointerSize]: kIsolate
-  //   rsp[3 * kSystemPointerSize]: undefined (kReturnValueDefaultValue)
+  //   rsp[3 * kSystemPointerSize]: undefined (padding, unused)
   //   rsp[4 * kSystemPointerSize]: undefined (kReturnValue)
   //   rsp[5 * kSystemPointerSize]: kData
   //   rsp[6 * kSystemPointerSize]: undefined (kNewTarget)
+  // Existing state:
+  //   rsp[7 * kSystemPointerSize]:          <= FCA:::values_
 
-  __ PopReturnAddressTo(rax);
+  __ PopReturnAddressTo(scratch);
   __ LoadRoot(kScratchRegister, RootIndex::kUndefinedValue);
-  __ Push(kScratchRegister);
-  __ Push(call_data);
-  __ Push(kScratchRegister);
-  __ Push(kScratchRegister);
+  __ Push(kScratchRegister);  // kNewTarget
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      __ PushTaggedField(FieldOperand(callback, CallHandlerInfo::kDataOffset),
+                         scratch2);
+      break;
+
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+    case CallApiCallbackMode::kOptimized:
+      __ Push(call_data);
+      break;
+  }
+  __ Push(kScratchRegister);  // kReturnValue
+  __ Push(kScratchRegister);  // kUnused
   __ PushAddress(ExternalReference::isolate_address(masm->isolate()));
   __ Push(holder);
-  // Keep a pointer to kHolder (= implicit_args) in a scratch register.
+  // Keep a pointer to kHolder (= implicit_args) in a {holder} register.
   // We use it below to set up the FunctionCallbackInfo object.
-  Register scratch = rbx;
-  __ movq(scratch, rsp);
-
-  __ PushReturnAddressFrom(rax);
+  __ movq(holder, rsp);
 
-  // Allocate the v8::Arguments structure in the arguments' space since it's
-  // not controlled by GC.
+  // Allocate v8::FunctionCallbackInfo object and a number of bytes to drop
+  // from the stack after the callback in non-GCed space of the exit frame.
   static constexpr int kApiStackSpace = 4;
-  static_assert(kApiStackSpace == sizeof(FCI) / kSystemPointerSize + 1);
-
-  __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT);
+  static_assert((kApiStackSpace - 1) * kSystemPointerSize == FCA::kSize);
+  const int exit_frame_params_count =
+      mode == CallApiCallbackMode::kGeneric
+          ? ApiCallbackExitFrameConstants::kAdditionalParametersCount
+          : 0;
+
+  if (mode == CallApiCallbackMode::kGeneric) {
+    ASM_CODE_COMMENT_STRING(masm, "Push API_CALLBACK_EXIT frame arguments");
+
+    // No padding is required.
+    static_assert(ApiCallbackExitFrameConstants::kOptionalPaddingSize == 0);
+
+    // Context parameter.
+    static_assert(ApiCallbackExitFrameConstants::kContextOffset ==
+                  4 * kSystemPointerSize);
+    __ Push(kContextRegister);
+
+    // Argc parameter as a Smi.
+    static_assert(ApiCallbackExitFrameConstants::kArgcOffset ==
+                  3 * kSystemPointerSize);
+    __ Move(kScratchRegister, argc);
+    __ SmiTag(kScratchRegister);
+    __ Push(kScratchRegister);  // argc as a Smi
+
+    // Target parameter.
+    static_assert(ApiCallbackExitFrameConstants::kTargetOffset ==
+                  2 * kSystemPointerSize);
+    __ PushTaggedField(
+        FieldOperand(callback, CallHandlerInfo::kOwnerTemplateOffset),
+        scratch2);
 
-  // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
-  constexpr int kImplicitArgsOffset = 0;
-  static_assert(kImplicitArgsOffset ==
-                offsetof(FCI, implicit_args_) / kSystemPointerSize);
-  __ movq(ExitFrameStackSlotOperand(kImplicitArgsOffset), scratch);
+    __ PushReturnAddressFrom(scratch);
 
-  // FunctionCallbackInfo::values_ (points at the first varargs argument passed
-  // on the stack).
-  constexpr int kValuesOffset = 1;
-  static_assert(kValuesOffset == offsetof(FCI, values_) / kSystemPointerSize);
-  __ leaq(scratch,
-          Operand(scratch, (FCA::kArgsLength + 1) * kSystemPointerSize));
-  __ movq(ExitFrameStackSlotOperand(kValuesOffset), scratch);
+    __ LoadExternalPointerField(
+        api_function_address,
+        FieldOperand(callback, CallHandlerInfo::kMaybeRedirectedCallbackOffset),
+        kCallHandlerInfoCallbackTag, kScratchRegister);
 
-  // FunctionCallbackInfo::length_.
-  constexpr int kLengthOffset = 2;
-  static_assert(kLengthOffset == offsetof(FCI, length_) / kSystemPointerSize);
-  __ movq(ExitFrameStackSlotOperand(2), argc);
+    __ EnterExitFrame(kApiStackSpace, StackFrame::API_CALLBACK_EXIT,
+                      api_function_address);
+  } else {
+    __ PushReturnAddressFrom(scratch);
+    __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT, api_function_address);
+  }
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Initialize FunctionCallbackInfo");
+    // FunctionCallbackInfo::implicit_args_ (points at kHolder as set up above).
+    __ movq(ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset), holder);
+
+    // FunctionCallbackInfo::values_ (points at the first varargs argument
+    // passed on the stack).
+    __ leaq(holder,
+            Operand(holder, (FCA::kArgsLength + 1) * kSystemPointerSize));
+    __ movq(ExitFrameStackSlotOperand(FCA::kValuesOffset), holder);
+
+    // FunctionCallbackInfo::length_.
+    __ movq(ExitFrameStackSlotOperand(FCA::kLengthOffset), argc);
+  }
 
   // We also store the number of bytes to drop from the stack after returning
   // from the API function here.
-  constexpr int kBytesToDropOffset = kLengthOffset + 1;
-  static_assert(kBytesToDropOffset == kApiStackSpace - 1);
-  __ leaq(kScratchRegister, Operand(argc, times_system_pointer_size,
-                                    FCA::kArgsLength * kSystemPointerSize +
-                                        kReceiverOnStackSize));
+  constexpr int kBytesToDropOffset = FCA::kLengthOffset + kSystemPointerSize;
+  static_assert(kBytesToDropOffset ==
+                (kApiStackSpace - 1) * kSystemPointerSize);
+  __ leaq(kScratchRegister,
+          Operand(argc, times_system_pointer_size,
+                  (FCA::kArgsLength + exit_frame_params_count) *
+                          kSystemPointerSize +
+                      kReceiverOnStackSize));
   __ movq(ExitFrameStackSlotOperand(kBytesToDropOffset), kScratchRegister);
 
-  Register arguments_arg = arg_reg_1;
-  Register callback_arg = arg_reg_2;
-
-  // It's okay if api_function_address == callback_arg, but not arguments_arg.
-  DCHECK(api_function_address != arguments_arg);
+  __ RecordComment("v8::FunctionCallback's argument.");
+  __ leaq(function_callback_info_arg,
+          ExitFrameStackSlotOperand(FCA::kImplicitArgsOffset));
 
-  // v8::InvocationCallback's argument.
-  __ leaq(arguments_arg, ExitFrameStackSlotOperand(kImplicitArgsOffset));
+  DCHECK(!AreAliased(api_function_address, function_callback_info_arg));
 
-  ExternalReference thunk_ref = ExternalReference::invoke_function_callback();
+  ExternalReference thunk_ref =
+      ExternalReference::invoke_function_callback(mode);
+  // Pass api function address to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = api_function_address;
 
-  Operand return_value_operand =
-      ExitFrameCallerStackSlotOperand(FCA::kReturnValueIndex);
+  Operand return_value_operand = ExitFrameCallerStackSlotOperand(
+      FCA::kReturnValueIndex + exit_frame_params_count);
   static constexpr int kUseExitFrameStackSlotOperand = 0;
-  Operand stack_space_operand = ExitFrameStackSlotOperand(3);
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref, callback_arg,
-                           kUseExitFrameStackSlotOperand, &stack_space_operand,
-                           return_value_operand);
+  Operand stack_space_operand = ExitFrameStackSlotOperand(kBytesToDropOffset);
+
+  const bool with_profiling =
+      mode != CallApiCallbackMode::kOptimizedNoProfiling;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kUseExitFrameStackSlotOperand,
+                           &stack_space_operand, return_value_operand);
 }
 
 void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
+  // ----------- S t a t e -------------
+  //  -- rsi                 : context
+  //  -- rdx                 : receiver
+  //  -- rcx                 : holder
+  //  -- rbx                 : accessor info
+  //  -- rsp[0]              : return address
+  // -----------------------------------
+
   Register name_arg = arg_reg_1;
-  Register accessor_info_arg = arg_reg_2;
-  Register getter_arg = arg_reg_3;
+  Register property_callback_info_arg = arg_reg_2;
+
   Register api_function_address = r8;
   Register receiver = ApiGetterDescriptor::ReceiverRegister();
   Register holder = ApiGetterDescriptor::HolderRegister();
@@ -4854,74 +4402,98 @@ void Builtins::Generate_CallApiGetter(MacroAssembler* masm) {
 
   // Build v8::PropertyCallbackInfo::args_ array on the stack and push property
   // name below the exit frame to make GC aware of them.
+  using PCI = PropertyCallbackInfo<v8::Value>;
   using PCA = PropertyCallbackArguments;
   static_assert(PCA::kShouldThrowOnErrorIndex == 0);
   static_assert(PCA::kHolderIndex == 1);
   static_assert(PCA::kIsolateIndex == 2);
-  static_assert(PCA::kReturnValueDefaultValueIndex == 3);
+  static_assert(PCA::kUnusedIndex == 3);
   static_assert(PCA::kReturnValueIndex == 4);
   static_assert(PCA::kDataIndex == 5);
   static_assert(PCA::kThisIndex == 6);
   static_assert(PCA::kArgsLength == 7);
 
-  // Insert additional parameters into the stack frame above return address.
+  // Set up PropertyCallbackInfo's args_ on the stack as follows:
+  //
+  // Current state:
+  //   rsp[0]: return address
+  //
+  // Target state:
+  //   rsp[0 * kSystemPointerSize]: return address
+  //   rsp[1 * kSystemPointerSize]: name
+  //   rsp[2 * kSystemPointerSize]: kShouldThrowOnErrorIndex   <= PCI:args_
+  //   rsp[3 * kSystemPointerSize]: kHolderIndex
+  //   rsp[4 * kSystemPointerSize]: kIsolateIndex
+  //   rsp[5 * kSystemPointerSize]: kUnusedIndex
+  //   rsp[6 * kSystemPointerSize]: kReturnValueIndex
+  //   rsp[7 * kSystemPointerSize]: kDataIndex
+  //   rsp[8 * kSystemPointerSize]: kThisIndex / receiver
+
   __ PopReturnAddressTo(scratch);
   __ Push(receiver);
   __ PushTaggedField(FieldOperand(callback, AccessorInfo::kDataOffset),
                      decompr_scratch1);
   __ LoadRoot(kScratchRegister, RootIndex::kUndefinedValue);
   __ Push(kScratchRegister);  // return value
-  __ Push(kScratchRegister);  // return value default
+  __ Push(Smi::zero());       // unused value
   __ PushAddress(ExternalReference::isolate_address(masm->isolate()));
   __ Push(holder);
   __ Push(Smi::zero());  // should_throw_on_error -> false
+
+  // Initialize a pointer to PropertyCallbackInfo::args_ array (= &ShouldThrow).
+  Register args_array = ReassignRegister(holder);
+  __ Move(args_array, rsp);
+
   __ PushTaggedField(FieldOperand(callback, AccessorInfo::kNameOffset),
                      decompr_scratch1);
   __ PushReturnAddressFrom(scratch);
 
   // v8::PropertyCallbackInfo::args_ array and name handle.
-  static constexpr int kNameHandleStackSize = 1;
-  static constexpr int kStackUnwindSpace =
-      PCA::kArgsLength + kNameHandleStackSize;
-
-  // Load address of v8::PropertyAccessorInfo::args_ array.
-  __ leaq(scratch, Operand(rsp, 2 * kSystemPointerSize));
+  static constexpr int kNameOnStackSize = 1;
+  static constexpr int kStackUnwindSpace = PCA::kArgsLength + kNameOnStackSize;
 
   // Allocate v8::PropertyCallbackInfo in non-GCed stack space.
-  static constexpr int kArgStackSpace = 1;
-  static_assert(kArgStackSpace ==
-                sizeof(PropertyCallbackInfo<v8::Value>) / kSystemPointerSize);
+  static constexpr int kApiStackSpace = 1;
+  static_assert(kApiStackSpace * kSystemPointerSize == sizeof(PCI));
 
-  __ EnterExitFrame(kArgStackSpace, StackFrame::EXIT);
+  __ EnterExitFrame(kApiStackSpace, StackFrame::EXIT, api_function_address);
 
-  // Create v8::PropertyCallbackInfo object on the stack and initialize
-  // its args_ field.
+  __ RecordComment("Create v8::PropertyCallbackInfo object on the stack.");
+  // Initialize v8::PropertyCallbackInfo::args_ field.
   Operand info_object = ExitFrameStackSlotOperand(0);
-  __ movq(info_object, scratch);
+  __ movq(info_object, args_array);
 
-  __ leaq(name_arg, Operand(scratch, -kSystemPointerSize));
-  // The context register (rsi) has been saved in EnterApiExitFrame and
-  // could be used to pass arguments.
-  __ leaq(accessor_info_arg, info_object);
+  // name_arg = Handle<Name>(&name), name value was pushed to GC-ed stack space.
+  __ leaq(name_arg, Operand(args_array, -kSystemPointerSize));
+  // The context register (rsi) might overlap with property_callback_info_arg
+  // but the context value has been saved in EnterExitFrame and thus it could
+  // be used to pass arguments.
+  // property_callback_info_arg = v8::PropertyCallbackInfo&
+  __ leaq(property_callback_info_arg, info_object);
 
-  // It's okay if api_function_address == getter_arg, but not accessor_info_arg
-  // or name_arg.
-  DCHECK(api_function_address != accessor_info_arg);
-  DCHECK(api_function_address != name_arg);
+  __ RecordComment("Load api_function_address");
   __ LoadExternalPointerField(
       api_function_address,
       FieldOperand(callback, AccessorInfo::kMaybeRedirectedGetterOffset),
       kAccessorInfoGetterTag, kScratchRegister);
 
+  DCHECK(
+      !AreAliased(api_function_address, property_callback_info_arg, name_arg));
+
   ExternalReference thunk_ref =
       ExternalReference::invoke_accessor_getter_callback();
+  // Pass AccessorInfo to thunk wrapper in case profiler or side-effect
+  // checking is enabled.
+  Register thunk_arg = callback;
+
   Operand return_value_operand = ExitFrameCallerStackSlotOperand(
-      PCA::kReturnValueIndex + kNameHandleStackSize);
+      PCA::kReturnValueIndex + kNameOnStackSize);
   Operand* const kUseStackSpaceConstant = nullptr;
 
-  CallApiFunctionAndReturn(masm, api_function_address, thunk_ref, getter_arg,
-                           kStackUnwindSpace, kUseStackSpaceConstant,
-                           return_value_operand);
+  const bool with_profiling = true;
+  CallApiFunctionAndReturn(masm, with_profiling, api_function_address,
+                           thunk_ref, thunk_arg, kStackUnwindSpace,
+                           kUseStackSpaceConstant, return_value_operand);
 }
 
 void Builtins::Generate_DirectCEntry(MacroAssembler* masm) {
@@ -5149,10 +4721,15 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
 
   // Get the InstructionStream object from the shared function info.
   Register code_obj = rbx;
-  TaggedRegister shared_function_info(code_obj);
+  Register shared_function_info(code_obj);
   __ LoadTaggedField(
       shared_function_info,
       FieldOperand(closure, JSFunction::kSharedFunctionInfoOffset));
+
+  if (is_osr) {
+    ResetSharedFunctionInfoAge(masm, shared_function_info);
+  }
+
   __ LoadTaggedField(code_obj,
                      FieldOperand(shared_function_info,
                                   SharedFunctionInfo::kFunctionDataOffset));
@@ -5189,7 +4766,7 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
   __ LoadTaggedField(feedback_cell,
                      FieldOperand(closure, JSFunction::kFeedbackCellOffset));
   __ LoadTaggedField(feedback_vector,
-                     FieldOperand(feedback_cell, Cell::kValueOffset));
+                     FieldOperand(feedback_cell, FeedbackCell::kValueOffset));
 
   Label install_baseline_code;
   // Check if feedback vector is valid. If not, call prepare for baseline to
@@ -5247,12 +4824,11 @@ void Generate_BaselineOrInterpreterEntry(MacroAssembler* masm,
     __ movq(arg_reg_3, kInterpreterBytecodeArrayRegister);
     __ CallCFunction(get_baseline_pc, 3);
   }
-  __ LoadCodeEntry(code_obj, code_obj);
+  __ LoadCodeInstructionStart(code_obj, code_obj);
   __ addq(code_obj, kReturnRegister0);
   __ popq(kInterpreterAccumulatorRegister);
 
   if (is_osr) {
-    ResetBytecodeAge(masm, kInterpreterBytecodeArrayRegister);
     Generate_OSREntry(masm, code_obj);
   } else {
     __ jmp(code_obj);
diff --git a/deps/v8/src/codegen/arm/assembler-arm-inl.h b/deps/v8/src/codegen/arm/assembler-arm-inl.h
index 0a0880db06dd4b..2021142b91047c 100644
--- a/deps/v8/src/codegen/arm/assembler-arm-inl.h
+++ b/deps/v8/src/codegen/arm/assembler-arm-inl.h
@@ -91,7 +91,7 @@ Address RelocInfo::constant_pool_entry_address() {
 
 int RelocInfo::target_address_size() { return kPointerSize; }
 
-HeapObject RelocInfo::target_object(PtrComprCageBase cage_base) {
+Tagged<HeapObject> RelocInfo::target_object(PtrComprCageBase cage_base) {
   DCHECK(IsCodeTarget(rmode_) || IsFullEmbeddedObject(rmode_));
   return HeapObject::cast(
       Object(Assembler::target_address_at(pc_, constant_pool_)));
@@ -106,15 +106,11 @@ Handle<HeapObject> RelocInfo::target_object_handle(Assembler* origin) {
   return origin->relative_code_target_object_handle_at(pc_);
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(Tagged<HeapObject> target,
                                   ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTarget(rmode_) || IsFullEmbeddedObject(rmode_));
   Assembler::set_target_address_at(pc_, constant_pool_, target.ptr(),
                                    icache_flush_mode);
-  if (!instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target, write_barrier_mode);
-  }
 }
 
 Address RelocInfo::target_external_reference() {
@@ -171,7 +167,7 @@ Operand::Operand(const ExternalReference& f)
   value_.immediate = static_cast<int32_t>(f.address());
 }
 
-Operand::Operand(Smi value) : rmode_(RelocInfo::NO_INFO) {
+Operand::Operand(Tagged<Smi> value) : rmode_(RelocInfo::NO_INFO) {
   value_.immediate = static_cast<intptr_t>(value.ptr());
 }
 
@@ -191,7 +187,7 @@ void Assembler::emit(Instr x) {
 }
 
 void Assembler::deserialization_set_special_target_at(
-    Address constant_pool_entry, Code code, Address target) {
+    Address constant_pool_entry, Tagged<Code> code, Address target) {
   DCHECK(!Builtins::IsIsolateIndependentBuiltin(code));
   Memory<Address>(constant_pool_entry) = target;
 }
diff --git a/deps/v8/src/codegen/arm/assembler-arm.cc b/deps/v8/src/codegen/arm/assembler-arm.cc
index 179c309acbc662..defa349c741bce 100644
--- a/deps/v8/src/codegen/arm/assembler-arm.cc
+++ b/deps/v8/src/codegen/arm/assembler-arm.cc
@@ -455,7 +455,7 @@ void NeonMemOperand::SetAlignment(int align) {
   }
 }
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Handle<HeapObject> object =
@@ -522,7 +522,8 @@ Assembler::Assembler(const AssemblerOptions& options,
                      std::unique_ptr<AssemblerBuffer> buffer)
     : AssemblerBase(options, std::move(buffer)),
       pending_32_bit_constants_(),
-      scratch_register_list_({ip}) {
+      scratch_register_list_(DefaultTmpList()),
+      scratch_vfp_register_list_(DefaultFPTmpList()) {
   reloc_info_writer.Reposition(buffer_start_ + buffer_->size(), pc_);
   constant_pool_deadline_ = kMaxInt;
   const_pool_blocked_nesting_ = 0;
@@ -534,23 +535,35 @@ Assembler::Assembler(const AssemblerOptions& options,
     // it's awkward to use CpuFeatures::VFP32DREGS with CpuFeatureScope. To make
     // its use consistent with other features, we always enable it if we can.
     EnableCpuFeature(VFP32DREGS);
+  }
+}
+
+Assembler::~Assembler() {
+  DCHECK_EQ(const_pool_blocked_nesting_, 0);
+  DCHECK_EQ(first_const_pool_32_use_, -1);
+}
+
+// static
+RegList Assembler::DefaultTmpList() { return {ip}; }
+
+// static
+VfpRegList Assembler::DefaultFPTmpList() {
+  if (CpuFeatures::IsSupported(VFP32DREGS)) {
     // Make sure we pick two D registers which alias a Q register. This way, we
     // can use a Q as a scratch if NEON is supported.
-    scratch_vfp_register_list_ = d14.ToVfpRegList() | d15.ToVfpRegList();
+    return d14.ToVfpRegList() | d15.ToVfpRegList();
   } else {
     // When VFP32DREGS is not supported, d15 become allocatable. Therefore we
     // cannot use it as a scratch.
-    scratch_vfp_register_list_ = d14.ToVfpRegList();
+    return d14.ToVfpRegList();
   }
 }
 
-Assembler::~Assembler() {
-  DCHECK_EQ(const_pool_blocked_nesting_, 0);
-  DCHECK_EQ(first_const_pool_32_use_, -1);
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
 }
-
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
-                        SafepointTableBuilder* safepoint_table_builder,
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
+                        SafepointTableBuilderBase* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
   // raw workflow to create InstructionStream objects (mostly in tests), add
@@ -838,7 +851,7 @@ void Assembler::target_at_put(int pos, int target_pos) {
       // If the target fits in a byte then only patch with a mov
       // instruction.
       PatchingAssembler patcher(
-          options(), reinterpret_cast<byte*>(buffer_start_ + pos), 1);
+          options(), reinterpret_cast<uint8_t*>(buffer_start_ + pos), 1);
       patcher.mov(dst, Operand(target24));
     } else {
       uint16_t target16_0 = target24 & kImm16Mask;
@@ -847,12 +860,12 @@ void Assembler::target_at_put(int pos, int target_pos) {
         // Patch with movw/movt.
         if (target16_1 == 0) {
           PatchingAssembler patcher(
-              options(), reinterpret_cast<byte*>(buffer_start_ + pos), 1);
+              options(), reinterpret_cast<uint8_t*>(buffer_start_ + pos), 1);
           CpuFeatureScope scope(&patcher, ARMv7);
           patcher.movw(dst, target16_0);
         } else {
           PatchingAssembler patcher(
-              options(), reinterpret_cast<byte*>(buffer_start_ + pos), 2);
+              options(), reinterpret_cast<uint8_t*>(buffer_start_ + pos), 2);
           CpuFeatureScope scope(&patcher, ARMv7);
           patcher.movw(dst, target16_0);
           patcher.movt(dst, target16_1);
@@ -864,12 +877,12 @@ void Assembler::target_at_put(int pos, int target_pos) {
         uint8_t target8_2 = target16_1 & kImm8Mask;
         if (target8_2 == 0) {
           PatchingAssembler patcher(
-              options(), reinterpret_cast<byte*>(buffer_start_ + pos), 2);
+              options(), reinterpret_cast<uint8_t*>(buffer_start_ + pos), 2);
           patcher.mov(dst, Operand(target8_0));
           patcher.orr(dst, dst, Operand(target8_1 << 8));
         } else {
           PatchingAssembler patcher(
-              options(), reinterpret_cast<byte*>(buffer_start_ + pos), 3);
+              options(), reinterpret_cast<uint8_t*>(buffer_start_ + pos), 3);
           patcher.mov(dst, Operand(target8_0));
           patcher.orr(dst, dst, Operand(target8_1 << 8));
           patcher.orr(dst, dst, Operand(target8_2 << 16));
@@ -5192,22 +5205,22 @@ void Assembler::GrowBuffer() {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   int pc_delta = new_start - buffer_start_;
   int rc_delta = (new_start + new_size) - (buffer_start_ + old_size);
   size_t reloc_size = (buffer_start_ + old_size) - reloc_info_writer.pos();
   MemMove(new_start, buffer_start_, pc_offset());
-  byte* new_reloc_start = reinterpret_cast<byte*>(
+  uint8_t* new_reloc_start = reinterpret_cast<uint8_t*>(
       reinterpret_cast<Address>(reloc_info_writer.pos()) + rc_delta);
   MemMove(new_reloc_start, reloc_info_writer.pos(), reloc_size);
 
   // Switch buffers.
   buffer_ = std::move(new_buffer);
   buffer_start_ = new_start;
-  pc_ = reinterpret_cast<byte*>(reinterpret_cast<Address>(pc_) + pc_delta);
-  byte* new_last_pc = reinterpret_cast<byte*>(
+  pc_ = reinterpret_cast<uint8_t*>(reinterpret_cast<Address>(pc_) + pc_delta);
+  uint8_t* new_last_pc = reinterpret_cast<uint8_t*>(
       reinterpret_cast<Address>(reloc_info_writer.last_pc()) + pc_delta);
   reloc_info_writer.Reposition(new_reloc_start, new_last_pc);
 
@@ -5225,28 +5238,20 @@ void Assembler::db(uint8_t data) {
   pc_ += sizeof(uint8_t);
 }
 
-void Assembler::dd(uint32_t data, RelocInfo::Mode rmode) {
+void Assembler::dd(uint32_t data) {
   // dd is used to write raw data. The constant pool should be emitted or
   // blocked before using dd.
   DCHECK(is_const_pool_blocked() || pending_32_bit_constants_.empty());
   CheckBuffer();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   base::WriteUnalignedValue(reinterpret_cast<Address>(pc_), data);
   pc_ += sizeof(uint32_t);
 }
 
-void Assembler::dq(uint64_t value, RelocInfo::Mode rmode) {
+void Assembler::dq(uint64_t value) {
   // dq is used to write raw data. The constant pool should be emitted or
   // blocked before using dq.
   DCHECK(is_const_pool_blocked() || pending_32_bit_constants_.empty());
   CheckBuffer();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   base::WriteUnalignedValue(reinterpret_cast<Address>(pc_), value);
   pc_ += sizeof(uint64_t);
 }
@@ -5254,8 +5259,7 @@ void Assembler::dq(uint64_t value, RelocInfo::Mode rmode) {
 void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data) {
   if (!ShouldRecordRelocInfo(rmode)) return;
   DCHECK_GE(buffer_space(), kMaxRelocSize);  // too late to grow buffer here
-  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data, Code(),
-                  InstructionStream());
+  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data);
   reloc_info_writer.Write(&rinfo);
 }
 
@@ -5465,7 +5469,7 @@ void Assembler::CheckConstPool(bool force_emit, bool require_jump) {
 }
 
 PatchingAssembler::PatchingAssembler(const AssemblerOptions& options,
-                                     byte* address, int instructions)
+                                     uint8_t* address, int instructions)
     : Assembler(options, ExternalAssemblerBuffer(
                              address, instructions * kInstrSize + kGap)) {
   DCHECK_EQ(reloc_info_writer.pos(), buffer_start_ + buffer_->size());
@@ -5489,22 +5493,6 @@ void PatchingAssembler::PadWithNops() {
   }
 }
 
-UseScratchRegisterScope::UseScratchRegisterScope(Assembler* assembler)
-    : assembler_(assembler),
-      old_available_(*assembler->GetScratchRegisterList()),
-      old_available_vfp_(*assembler->GetScratchVfpRegisterList()) {}
-
-UseScratchRegisterScope::~UseScratchRegisterScope() {
-  *assembler_->GetScratchRegisterList() = old_available_;
-  *assembler_->GetScratchVfpRegisterList() = old_available_vfp_;
-}
-
-Register UseScratchRegisterScope::Acquire() {
-  RegList* available = assembler_->GetScratchRegisterList();
-  DCHECK_NOT_NULL(available);
-  return available->PopFirst();
-}
-
 LoadStoreLaneParams::LoadStoreLaneParams(MachineRepresentation rep,
                                          uint8_t laneidx) {
   if (rep == MachineRepresentation::kWord8) {
diff --git a/deps/v8/src/codegen/arm/assembler-arm.h b/deps/v8/src/codegen/arm/assembler-arm.h
index 9444abea1888a9..4f7fa673ddba56 100644
--- a/deps/v8/src/codegen/arm/assembler-arm.h
+++ b/deps/v8/src/codegen/arm/assembler-arm.h
@@ -52,7 +52,6 @@
 #include "src/codegen/constant-pool.h"
 #include "src/codegen/machine-type.h"
 #include "src/utils/boxed-float.h"
-
 namespace v8 {
 namespace internal {
 
@@ -93,7 +92,7 @@ class V8_EXPORT_PRIVATE Operand {
   V8_INLINE static Operand Zero();
   V8_INLINE explicit Operand(const ExternalReference& f);
   explicit Operand(Handle<HeapObject> handle);
-  V8_INLINE explicit Operand(Smi value);
+  V8_INLINE explicit Operand(Tagged<Smi> value);
 
   // rm
   V8_INLINE explicit Operand(Register rm);
@@ -309,6 +308,9 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   ~Assembler() override;
 
+  static RegList DefaultTmpList();
+  static VfpRegList DefaultFPTmpList();
+
   void AbortedCodeGeneration() override {
     pending_32_bit_constants_.clear();
     first_const_pool_32_use_ = -1;
@@ -316,13 +318,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   // GetCode emits any pending (non-emitted) code and fills the descriptor desc.
   static constexpr int kNoHandlerTable = 0;
-  static constexpr SafepointTableBuilder* kNoSafepointTable = nullptr;
-  void GetCode(Isolate* isolate, CodeDesc* desc,
-               SafepointTableBuilder* safepoint_table_builder,
+  static constexpr SafepointTableBuilderBase* kNoSafepointTable = nullptr;
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
+               SafepointTableBuilderBase* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -367,7 +371,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // This sets the branch destination (which is in the constant pool on ARM).
   // This is for calls and branches within generated code.
   inline static void deserialization_set_special_target_at(
-      Address constant_pool_entry, Code code, Address target);
+      Address constant_pool_entry, Tagged<Code> code, Address target);
 
   // Get the size of the special target encoded at 'location'.
   inline static int deserialization_special_target_size(Address location);
@@ -1093,11 +1097,9 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // called before any use of db/dd/dq/dp to ensure that constant pools
   // are not emitted as part of the tables generated.
   void db(uint8_t data);
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
-    dd(data, rmode);
-  }
+  void dd(uint32_t data);
+  void dq(uint64_t data);
+  void dp(uintptr_t data) { dd(data); }
 
   // Read/patch instructions
   Instr instr_at(int pos) {
@@ -1343,7 +1345,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data = 0);
   void ConstantPoolAddEntry(int position, RelocInfo::Mode rmode,
                             intptr_t value);
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
@@ -1360,7 +1362,7 @@ class EnsureSpace {
 
 class PatchingAssembler : public Assembler {
  public:
-  PatchingAssembler(const AssemblerOptions& options, byte* address,
+  PatchingAssembler(const AssemblerOptions& options, uint8_t* address,
                     int instructions);
   ~PatchingAssembler();
 
@@ -1379,11 +1381,20 @@ class PatchingAssembler : public Assembler {
 // constructors. We do not have assertions for this.
 class V8_EXPORT_PRIVATE V8_NODISCARD UseScratchRegisterScope {
  public:
-  explicit UseScratchRegisterScope(Assembler* assembler);
-  ~UseScratchRegisterScope();
+  explicit UseScratchRegisterScope(Assembler* assembler)
+      : assembler_(assembler),
+        old_available_(*assembler->GetScratchRegisterList()),
+        old_available_vfp_(*assembler->GetScratchVfpRegisterList()) {}
+
+  ~UseScratchRegisterScope() {
+    *assembler_->GetScratchRegisterList() = old_available_;
+    *assembler_->GetScratchVfpRegisterList() = old_available_vfp_;
+  }
 
   // Take a register from the list and return it.
-  Register Acquire();
+  Register Acquire() {
+    return assembler_->GetScratchRegisterList()->PopFirst();
+  }
   SwVfpRegister AcquireS() { return AcquireVfp<SwVfpRegister>(); }
   LowDwVfpRegister AcquireLowD() { return AcquireVfp<LowDwVfpRegister>(); }
   DwVfpRegister AcquireD() {
@@ -1405,6 +1416,16 @@ class V8_EXPORT_PRIVATE V8_NODISCARD UseScratchRegisterScope {
   bool CanAcquireD() const { return CanAcquireVfp<DwVfpRegister>(); }
   bool CanAcquireQ() const { return CanAcquireVfp<QwNeonRegister>(); }
 
+  RegList Available() { return *assembler_->GetScratchRegisterList(); }
+  void SetAvailable(RegList available) {
+    *assembler_->GetScratchRegisterList() = available;
+  }
+
+  VfpRegList AvailableVfp() { return *assembler_->GetScratchVfpRegisterList(); }
+  void SetAvailableVfp(VfpRegList available) {
+    *assembler_->GetScratchVfpRegisterList() = available;
+  }
+
   void Include(const Register& reg1, const Register& reg2 = no_reg) {
     RegList* available = assembler_->GetScratchRegisterList();
     DCHECK_NOT_NULL(available);
@@ -1413,6 +1434,11 @@ class V8_EXPORT_PRIVATE V8_NODISCARD UseScratchRegisterScope {
     available->set(reg1);
     available->set(reg2);
   }
+  void Include(RegList list) {
+    RegList* available = assembler_->GetScratchRegisterList();
+    DCHECK_NOT_NULL(available);
+    *available = *available | list;
+  }
   void Include(VfpRegList list) {
     VfpRegList* available = assembler_->GetScratchVfpRegisterList();
     DCHECK_NOT_NULL(available);
diff --git a/deps/v8/src/codegen/arm/constants-arm.h b/deps/v8/src/codegen/arm/constants-arm.h
index 5b8636d3b9db56..d8d52f154d4b2a 100644
--- a/deps/v8/src/codegen/arm/constants-arm.h
+++ b/deps/v8/src/codegen/arm/constants-arm.h
@@ -78,48 +78,49 @@ constexpr int kRootRegisterBias = 4095;
 // General constants are in an anonymous enum in class Instr.
 
 // Values for the condition field as defined in section A3.2
-using Condition = int;
-constexpr Condition kNoCondition = -1;
-
-constexpr Condition eq = 0 << 28;   // Z set            Equal.
-constexpr Condition ne = 1 << 28;   // Z clear          Not equal.
-constexpr Condition cs = 2 << 28;   // C set            Unsigned higher or same.
-constexpr Condition cc = 3 << 28;   // C clear          Unsigned lower.
-constexpr Condition mi = 4 << 28;   // N set            Negative.
-constexpr Condition pl = 5 << 28;   // N clear          Positive or zero.
-constexpr Condition vs = 6 << 28;   // V set            Overflow.
-constexpr Condition vc = 7 << 28;   // V clear          No overflow.
-constexpr Condition hi = 8 << 28;   // C set, Z clear   Unsigned higher.
-constexpr Condition ls = 9 << 28;   // C clear or Z set Unsigned lower or same.
-constexpr Condition ge = 10 << 28;  // N == V           Greater or equal.
-constexpr Condition lt = 11 << 28;  // N != V           Less than.
-constexpr Condition gt = 12 << 28;  // Z clear, N == V  Greater than.
-constexpr Condition le = 13 << 28;  // Z set or N != V  Less then or equal
-constexpr Condition al = 14 << 28;  //                  Always.
-
-// Special condition (refer to section A3.2.1).
-constexpr Condition kSpecialCondition = 15 << 28;
-constexpr Condition kNumberOfConditions = 16;
-
-// Aliases.
-constexpr Condition hs = cs;  // C set            Unsigned higher or same.
-constexpr Condition lo = cc;  // C clear          Unsigned lower.
-
-// Unified cross-platform condition names/aliases.
-constexpr Condition kEqual = eq;
-constexpr Condition kNotEqual = ne;
-constexpr Condition kLessThan = lt;
-constexpr Condition kGreaterThan = gt;
-constexpr Condition kLessThanEqual = le;
-constexpr Condition kGreaterThanEqual = ge;
-constexpr Condition kUnsignedLessThan = lo;
-constexpr Condition kUnsignedGreaterThan = hi;
-constexpr Condition kUnsignedLessThanEqual = ls;
-constexpr Condition kUnsignedGreaterThanEqual = hs;
-constexpr Condition kOverflow = vs;
-constexpr Condition kNoOverflow = vc;
-constexpr Condition kZero = eq;
-constexpr Condition kNotZero = ne;
+enum Condition : int {
+  kNoCondition = -1,
+
+  eq = 0 << 28,   // Z set            Equal.
+  ne = 1 << 28,   // Z clear          Not equal.
+  cs = 2 << 28,   // C set            Unsigned higher or same.
+  cc = 3 << 28,   // C clear          Unsigned lower.
+  mi = 4 << 28,   // N set            Negative.
+  pl = 5 << 28,   // N clear          Positive or zero.
+  vs = 6 << 28,   // V set            Overflow.
+  vc = 7 << 28,   // V clear          No overflow.
+  hi = 8 << 28,   // C set, Z clear   Unsigned higher.
+  ls = 9 << 28,   // C clear or Z set Unsigned lower or same.
+  ge = 10 << 28,  // N == V           Greater or equal.
+  lt = 11 << 28,  // N != V           Less than.
+  gt = 12 << 28,  // Z clear, N == V  Greater than.
+  le = 13 << 28,  // Z set or N != V  Less then or equal
+  al = 14 << 28,  //                  Always.
+
+  // Special condition (refer to section A3.2.1).
+  kSpecialCondition = 15 << 28,
+  kNumberOfConditions = 16,
+
+  // Aliases.
+  hs = cs,  // C set            Unsigned higher or same.
+  lo = cc,  // C clear          Unsigned lower.
+
+  // Unified cross-platform condition names/aliases.
+  kEqual = eq,
+  kNotEqual = ne,
+  kLessThan = lt,
+  kGreaterThan = gt,
+  kLessThanEqual = le,
+  kGreaterThanEqual = ge,
+  kUnsignedLessThan = lo,
+  kUnsignedGreaterThan = hi,
+  kUnsignedLessThanEqual = ls,
+  kUnsignedGreaterThanEqual = hs,
+  kOverflow = vs,
+  kNoOverflow = vc,
+  kZero = eq,
+  kNotZero = ne,
+};
 
 inline Condition NegateCondition(Condition cond) {
   DCHECK(cond != al);
@@ -436,7 +437,7 @@ inline Hint NegateHint(Hint ignored) { return no_hint; }
 // Example: Test whether the instruction at ptr does set the condition code
 // bits.
 //
-// bool InstructionSetsConditionCodes(byte* ptr) {
+// bool InstructionSetsConditionCodes(uint8_t* ptr) {
 //   Instruction* instr = Instruction::At(ptr);
 //   int type = instr->TypeValue();
 //   return ((type == 0) || (type == 1)) && instr->HasS();
diff --git a/deps/v8/src/codegen/arm/interface-descriptors-arm-inl.h b/deps/v8/src/codegen/arm/interface-descriptors-arm-inl.h
index f1affc1bee685f..4df3451f5e5cba 100644
--- a/deps/v8/src/codegen/arm/interface-descriptors-arm-inl.h
+++ b/deps/v8/src/codegen/arm/interface-descriptors-arm-inl.h
@@ -19,6 +19,31 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  // Construct the std::array explicitly here because on arm, the registers d0,
+  // d1, ... are not of type DoubleRegister but only support implicit casting to
+  // DoubleRegister. For template resolution, however, implicit casting is not
+  // sufficient.
+  std::array<DoubleRegister, 7> registers{d0, d1, d2, d3, d4, d5, d6};
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Construct the std::array explicitly here because on arm, the registers d0,
+  // d1, ... are not of type DoubleRegister but only support implicit casting to
+  // DoubleRegister. For template resolution, however, implicit casting is not
+  // sufficient.
+  // Padding to have as many double return registers as GP return registers.
+  std::array<DoubleRegister, 3> registers{kFPReturnRegister0, no_dreg, no_dreg};
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -129,6 +154,17 @@ constexpr Register TypeConversionDescriptor::ArgumentRegister() { return r0; }
 // static
 constexpr auto TypeofDescriptor::registers() { return RegisterArray(r0); }
 
+// static
+constexpr Register
+MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor::FlagsRegister() {
+  return r2;
+}
+// static
+constexpr Register MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor::
+    FeedbackVectorRegister() {
+  return r5;
+}
+
 // static
 constexpr auto CallTrampolineDescriptor::registers() {
   // r0 : number of arguments
@@ -269,11 +305,36 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  return RegisterArray(r1,   // kApiFunctionAddress
-                       r2,   // kArgc
-                       r3,   // kCallData
-                       r0);  // kHolder
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return r1;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return r2;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return r3;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return r0;
+}
+
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return r2;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return r3;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return r0;
 }
 
 // static
@@ -311,6 +372,10 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray(r0, r1);
 }
 
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(r8);
+}
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/arm/macro-assembler-arm.cc b/deps/v8/src/codegen/arm/macro-assembler-arm.cc
index 9be1d37e030d21..6ab47b8f629025 100644
--- a/deps/v8/src/codegen/arm/macro-assembler-arm.cc
+++ b/deps/v8/src/codegen/arm/macro-assembler-arm.cc
@@ -17,6 +17,7 @@
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/codegen/macro-assembler.h"
 #include "src/codegen/register-configuration.h"
+#include "src/codegen/register.h"
 #include "src/debug/debug.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/execution/frames-inl.h"
@@ -242,7 +243,8 @@ void MacroAssembler::Call(Handle<Code> code, RelocInfo::Mode rmode,
   Call(code.address(), rmode, cond, mode);
 }
 
-void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
+void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index,
+                                               Register target) {
   ASM_CODE_COMMENT(this);
   static_assert(kSystemPointerSize == 4);
   static_assert(kSmiShiftSize == 0);
@@ -250,17 +252,16 @@ void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
   static_assert(kSmiTag == 0);
 
   // The builtin_index register contains the builtin index as a Smi.
-  // Untagging is folded into the indexing operand below.
-  mov(builtin_index,
+  mov(target,
       Operand(builtin_index, LSL, kSystemPointerSizeLog2 - kSmiTagSize));
-  add(builtin_index, builtin_index,
-      Operand(IsolateData::builtin_entry_table_offset()));
-  ldr(builtin_index, MemOperand(kRootRegister, builtin_index));
+  add(target, target, Operand(IsolateData::builtin_entry_table_offset()));
+  ldr(target, MemOperand(kRootRegister, target));
 }
 
-void MacroAssembler::CallBuiltinByIndex(Register builtin_index) {
-  LoadEntryFromBuiltinIndex(builtin_index);
-  Call(builtin_index);
+void MacroAssembler::CallBuiltinByIndex(Register builtin_index,
+                                        Register target) {
+  LoadEntryFromBuiltinIndex(builtin_index, target);
+  Call(target);
 }
 
 void MacroAssembler::LoadEntryFromBuiltin(Builtin builtin,
@@ -339,24 +340,38 @@ void MacroAssembler::TailCallBuiltin(Builtin builtin, Condition cond) {
   }
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination, Register code_object) {
+void MacroAssembler::LoadCodeInstructionStart(Register destination,
+                                              Register code_object) {
   ASM_CODE_COMMENT(this);
-  ldr(destination, FieldMemOperand(code_object, Code::kCodeEntryPointOffset));
+  ldr(destination, FieldMemOperand(code_object, Code::kInstructionStartOffset));
 }
 
 void MacroAssembler::CallCodeObject(Register code_object) {
   ASM_CODE_COMMENT(this);
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   Call(code_object);
 }
 
 void MacroAssembler::JumpCodeObject(Register code_object, JumpMode jump_mode) {
   ASM_CODE_COMMENT(this);
   DCHECK_EQ(JumpMode::kJump, jump_mode);
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   Jump(code_object);
 }
 
+void MacroAssembler::CallJSFunction(Register function_object) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  ldr(code, FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  CallCodeObject(code);
+}
+
+void MacroAssembler::JumpJSFunction(Register function_object,
+                                    JumpMode jump_mode) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  ldr(code, FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  JumpCodeObject(code, jump_mode);
+}
+
 void MacroAssembler::StoreReturnAddressAndCall(Register target) {
   ASM_CODE_COMMENT(this);
   // This generates the final instruction sequence for calls to C functions
@@ -389,7 +404,7 @@ void MacroAssembler::Drop(Register count, Condition cond) {
 
 void MacroAssembler::TestCodeIsMarkedForDeoptimization(Register code,
                                                        Register scratch) {
-  ldr(scratch, FieldMemOperand(code, Code::kKindSpecificFlagsOffset));
+  ldr(scratch, FieldMemOperand(code, Code::kFlagsOffset));
   tst(scratch, Operand(1 << Code::kMarkedForDeoptimizationBit));
 }
 
@@ -407,13 +422,18 @@ void MacroAssembler::Push(Handle<HeapObject> handle) {
   push(scratch);
 }
 
-void MacroAssembler::Push(Smi smi) {
+void MacroAssembler::Push(Tagged<Smi> smi) {
   UseScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
   mov(scratch, Operand(smi));
   push(scratch);
 }
 
+void MacroAssembler::Push(Tagged<TaggedIndex> index) {
+  // TaggedIndex is the same as Smi for 32 bit archs.
+  Push(Smi::FromIntptr(index.value()));
+}
+
 void MacroAssembler::PushArray(Register array, Register size, Register scratch,
                                PushArrayOrder order) {
   ASM_CODE_COMMENT(this);
@@ -444,7 +464,9 @@ void MacroAssembler::PushArray(Register array, Register size, Register scratch,
   }
 }
 
-void MacroAssembler::Move(Register dst, Smi smi) { mov(dst, Operand(smi)); }
+void MacroAssembler::Move(Register dst, Tagged<Smi> smi) {
+  mov(dst, Operand(smi));
+}
 
 void MacroAssembler::Move(Register dst, Handle<HeapObject> value) {
   // TODO(jgruber,v8:8887): Also consider a root-relative load when generating
@@ -1420,7 +1442,8 @@ void MacroAssembler::EnterExitFrame(int stack_space,
                                     StackFrame::Type frame_type) {
   ASM_CODE_COMMENT(this);
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
   UseScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
 
@@ -1624,7 +1647,7 @@ void MacroAssembler::CallDebugOnFunctionCall(Register fun, Register new_target,
                                              Register actual_parameter_count) {
   ASM_CODE_COMMENT(this);
   // Load receiver to pass it later to DebugOnFunctionCall hook.
-  ldr(r4, ReceiverOperand(actual_parameter_count));
+  ldr(r4, ReceiverOperand());
   FrameScope frame(
       this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
 
@@ -1685,14 +1708,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // We call indirectly through the code field in the function to
   // allow recompilation to take effect without changing any of the
   // call sites.
-  Register code = kJavaScriptCallCodeStartRegister;
-  ldr(code, FieldMemOperand(function, JSFunction::kCodeOffset));
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(code);
+      CallJSFunction(function);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(code);
+      JumpJSFunction(function);
       break;
   }
   b(&done);
@@ -1921,7 +1942,7 @@ void TailCallOptimizedCodeSlot(MacroAssembler* masm,
   // into the optimized functions list, then tail call the optimized code.
   __ ReplaceClosureCodeWithOptimizedCode(optimized_code_entry, closure);
   static_assert(kJavaScriptCallCodeStartRegister == r2, "ABI mismatch");
-  __ LoadCodeEntry(r2, optimized_code_entry);
+  __ LoadCodeInstructionStart(r2, optimized_code_entry);
   __ Jump(r2);
 
   // Optimized code slot contains deoptimized code or code is cleared and
@@ -1985,9 +2006,8 @@ void MacroAssembler::GenerateTailCallToReturnedCode(
 
 // Read off the flags in the feedback vector and check if there
 // is optimized code or a tiering state that needs to be processed.
-void MacroAssembler::LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-    Register flags, Register feedback_vector, CodeKind current_code_kind,
-    Label* flags_need_processing) {
+Condition MacroAssembler::LoadFeedbackVectorFlagsAndCheckIfNeedsProcessing(
+    Register flags, Register feedback_vector, CodeKind current_code_kind) {
   ASM_CODE_COMMENT(this);
   DCHECK(!AreAliased(flags, feedback_vector));
   DCHECK(CodeKindCanTierUp(current_code_kind));
@@ -1999,7 +2019,16 @@ void MacroAssembler::LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
     kFlagsMask |= FeedbackVector::kFlagsMaybeHasMaglevCode;
   }
   tst(flags, Operand(kFlagsMask));
-  b(ne, flags_need_processing);
+  return ne;
+}
+
+void MacroAssembler::LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
+    Register flags, Register feedback_vector, CodeKind current_code_kind,
+    Label* flags_need_processing) {
+  ASM_CODE_COMMENT(this);
+  b(LoadFeedbackVectorFlagsAndCheckIfNeedsProcessing(flags, feedback_vector,
+                                                     current_code_kind),
+    flags_need_processing);
 }
 
 void MacroAssembler::OptimizeCodeOrTailCallOptimizedCodeSlot(
@@ -2114,20 +2143,32 @@ void MacroAssembler::AssertUnreachable(AbortReason reason) {
   if (v8_flags.debug_code) Abort(reason);
 }
 
-void MacroAssembler::AssertNotSmi(Register object) {
+void MacroAssembler::AssertNotSmi(Register object, AbortReason reason) {
   if (!v8_flags.debug_code) return;
   ASM_CODE_COMMENT(this);
   static_assert(kSmiTag == 0);
   tst(object, Operand(kSmiTagMask));
-  Check(ne, AbortReason::kOperandIsASmi);
+  Check(ne, reason);
 }
 
-void MacroAssembler::AssertSmi(Register object) {
+void MacroAssembler::AssertSmi(Register object, AbortReason reason) {
   if (!v8_flags.debug_code) return;
   ASM_CODE_COMMENT(this);
   static_assert(kSmiTag == 0);
   tst(object, Operand(kSmiTagMask));
-  Check(eq, AbortReason::kOperandIsNotASmi);
+  Check(eq, reason);
+}
+
+void MacroAssembler::AssertMap(Register object) {
+  if (!v8_flags.debug_code) return;
+  ASM_CODE_COMMENT(this);
+  AssertNotSmi(object, AbortReason::kOperandIsNotAMap);
+
+  UseScratchRegisterScope temps(this);
+  Register temp = temps.Acquire();
+
+  CompareObjectType(object, temp, temp, MAP_TYPE);
+  Check(eq, AbortReason::kOperandIsNotAMap);
 }
 
 void MacroAssembler::AssertConstructor(Register object) {
@@ -2217,6 +2258,47 @@ void MacroAssembler::AssertUndefinedOrAllocationSite(Register object,
   Assert(eq, AbortReason::kExpectedUndefinedOrCell);
   bind(&done_checking);
 }
+
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 Register tmp, AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp, tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok);
+
+  LoadMap(map_tmp, object);
+  CompareInstanceType(map_tmp, tmp, LAST_NAME_TYPE);
+  b(kUnsignedLessThanEqual, &ok);
+
+  CompareInstanceType(map_tmp, tmp, FIRST_JS_RECEIVER_TYPE);
+  b(kUnsignedGreaterThanEqual, &ok);
+
+  CompareRoot(map_tmp, RootIndex::kHeapNumberMap);
+  b(kEqual, &ok);
+
+  CompareRoot(map_tmp, RootIndex::kBigIntMap);
+  b(kEqual, &ok);
+
+  CompareRoot(object, RootIndex::kUndefinedValue);
+  b(kEqual, &ok);
+
+  CompareRoot(object, RootIndex::kTrueValue);
+  b(kEqual, &ok);
+
+  CompareRoot(object, RootIndex::kFalseValue);
+  b(kEqual, &ok);
+
+  CompareRoot(object, RootIndex::kNullValue);
+  b(kEqual, &ok);
+
+  Abort(abort_reason);
+
+  bind(&ok);
+}
+
 #endif  // V8_ENABLE_DEBUG_CODE
 
 void MacroAssembler::Check(Condition cond, AbortReason reason) {
@@ -2735,6 +2817,24 @@ void MacroAssembler::ComputeCodeStartAddress(Register dst) {
   sub(dst, pc, Operand(pc_offset() + Instruction::kPcLoadDelta));
 }
 
+// Check if the code object is marked for deoptimization. If it is, then it
+// jumps to the CompileLazyDeoptimizedCode builtin. In order to do this we need
+// to:
+//    1. read from memory the word that contains that bit, which can be found in
+//       the flags in the referenced {Code} object;
+//    2. test kMarkedForDeoptimizationBit in those flags; and
+//    3. if it is not zero then it jumps to the builtin.
+void MacroAssembler::BailoutIfDeoptimized() {
+  UseScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
+  ldr(scratch, MemOperand(kJavaScriptCallCodeStartRegister, offset));
+  ldr(scratch, FieldMemOperand(scratch, Code::kFlagsOffset));
+  tst(scratch, Operand(1 << Code::kMarkedForDeoptimizationBit));
+  Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
+       RelocInfo::CODE_TARGET, ne);
+}
+
 void MacroAssembler::CallForDeoptimization(Builtin target, int, Label* exit,
                                            DeoptimizeKind kind, Label* ret,
                                            Label*) {
@@ -2873,6 +2973,245 @@ void MacroAssembler::F64x2PromoteLowF32x4(QwNeonRegister dst,
   F64x2ConvertLowHelper(this, dst, src, &Assembler::vcvt_f64_f32);
 }
 
+void MacroAssembler::Switch(Register scratch, Register value,
+                            int case_value_base, Label** labels,
+                            int num_labels) {
+  Label fallthrough;
+  if (case_value_base != 0) {
+    sub(value, value, Operand(case_value_base));
+  }
+  // This {cmp} might still emit a constant pool entry.
+  cmp(value, Operand(num_labels));
+  // Ensure to emit the constant pool first if necessary.
+  CheckConstPool(true, true);
+  BlockConstPoolFor(num_labels + 2);
+  add(pc, pc, Operand(value, LSL, 2), LeaveCC, lo);
+  b(&fallthrough);
+  for (int i = 0; i < num_labels; ++i) {
+    b(labels[i]);
+  }
+  bind(&fallthrough);
+}
+
+void MacroAssembler::JumpIfCodeIsMarkedForDeoptimization(
+    Register code, Register scratch, Label* if_marked_for_deoptimization) {
+  ldr(scratch, FieldMemOperand(code, Code::kFlagsOffset));
+  tst(scratch, Operand(1 << Code::kMarkedForDeoptimizationBit));
+  b(if_marked_for_deoptimization, ne);
+}
+
+void MacroAssembler::JumpIfCodeIsTurbofanned(Register code, Register scratch,
+                                             Label* if_turbofanned) {
+  ldr(scratch, FieldMemOperand(code, Code::kFlagsOffset));
+  tst(scratch, Operand(1 << Code::kIsTurbofannedBit));
+  b(if_turbofanned, ne);
+}
+
+void MacroAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
+                                             CodeKind min_opt_level,
+                                             Register feedback_vector,
+                                             FeedbackSlot slot,
+                                             Label* on_result,
+                                             Label::Distance) {
+  Label fallthrough, clear_slot;
+  LoadTaggedField(
+      scratch_and_result,
+      FieldMemOperand(feedback_vector,
+                      FeedbackVector::OffsetOfElementAt(slot.ToInt())));
+  LoadWeakValue(scratch_and_result, scratch_and_result, &fallthrough);
+
+  // Is it marked_for_deoptimization? If yes, clear the slot.
+  {
+    UseScratchRegisterScope temps(this);
+    Register temp = temps.Acquire();
+    JumpIfCodeIsMarkedForDeoptimization(scratch_and_result, temp, &clear_slot);
+    if (min_opt_level == CodeKind::TURBOFAN) {
+      JumpIfCodeIsTurbofanned(scratch_and_result, temp, on_result);
+      b(&fallthrough);
+    } else {
+      b(on_result);
+    }
+  }
+
+  bind(&clear_slot);
+  Move(scratch_and_result, ClearedValue());
+  StoreTaggedField(
+      scratch_and_result,
+      FieldMemOperand(feedback_vector,
+                      FeedbackVector::OffsetOfElementAt(slot.ToInt())));
+
+  bind(&fallthrough);
+  Move(scratch_and_result, Operand(0));
+}
+
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand) {
+  ASM_CODE_COMMENT(masm);
+
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  Register return_value = r0;
+  Register scratch = r8;
+  Register scratch2 = r9;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = r4;
+  Register prev_limit_reg = r5;
+  Register prev_level_reg = r6;
+
+  // C arguments (arg_reg_1/2) are expected to be initialized outside, so this
+  // function must not corrupt them (return_value overlaps with arg_reg_1 but
+  // that's ok because we start using it only after the C call).
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2,  // C args
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ ldr(prev_next_address_reg, next_mem_op);
+    __ ldr(prev_limit_reg, limit_mem_op);
+    __ ldr(prev_level_reg, level_mem_op);
+    __ add(scratch, prev_level_reg, Operand(1));
+    __ str(scratch, level_mem_op);
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ ldrb(scratch, __ ExternalReferenceAsOperand(
+                         ER::execution_mode_address(isolate), no_reg));
+    __ cmp(scratch, Operand(0));
+    __ b(ne, &profiler_or_side_effects_check_enabled);
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ Move(scratch, ER::address_of_runtime_stats_flag());
+    __ ldr(scratch, MemOperand(scratch, 0));
+    __ cmp(scratch, Operand(0));
+    __ b(ne, &profiler_or_side_effects_check_enabled);
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ StoreReturnAddressAndCall(function_address);
+  __ bind(&done_api_call);
+
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  __ RecordComment("Load the value from ReturnValue");
+  __ ldr(return_value, return_value_operand);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ str(prev_next_address_reg, next_mem_op);
+    if (v8_flags.debug_code) {
+      __ ldr(scratch, level_mem_op);
+      __ sub(scratch, scratch, Operand(1));
+      __ cmp(scratch, prev_level_reg);
+      __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall);
+    }
+    __ str(prev_level_reg, level_mem_op);
+    __ ldr(scratch, limit_mem_op);
+    __ cmp(scratch, prev_limit_reg);
+    __ b(ne, &delete_allocated_handles);
+  }
+
+  __ RecordComment("Leave the API exit frame.");
+  __ bind(&leave_exit_frame);
+  // LeaveExitFrame expects unwind space to be in a register.
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand == nullptr) {
+    DCHECK_NE(stack_space, 0);
+    __ mov(stack_space_reg, Operand(stack_space));
+  } else {
+    DCHECK_EQ(stack_space, 0);
+    __ ldr(stack_space_reg, *stack_space_operand);
+  }
+  __ LeaveExitFrame(stack_space_reg, stack_space_operand != nullptr);
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ LoadRoot(scratch, RootIndex::kTheHoleValue);
+    __ ldr(scratch2, __ ExternalReferenceAsOperand(
+                         ER::scheduled_exception_address(isolate), no_reg));
+    __ cmp(scratch, scratch2);
+    __ b(ne, &promote_scheduled_exception);
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ CompareRoot(return_value, RootIndex::kTheHoleValue);
+    __ b(kNotEqual, &finish_return);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch, scratch2,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  __ mov(pc, lr);
+
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via thunk wrapper.");
+    __ bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback function.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ str(thunk_arg, thunk_arg_mem_op);
+    __ Move(scratch, thunk_ref);
+    __ StoreReturnAddressAndCall(scratch);
+    __ b(&done_api_call);
+  }
+
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ bind(&delete_allocated_handles);
+    __ str(prev_limit_reg, limit_mem_op);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ mov(saved_result, return_value);
+    __ PrepareCallCFunction(1);
+    __ Move(arg_reg_1, ER::isolate_address(isolate));
+    __ CallCFunction(ER::delete_handle_scope_extensions(), 1);
+    __ mov(return_value, saved_result);
+    __ jmp(&leave_exit_frame);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/arm/macro-assembler-arm.h b/deps/v8/src/codegen/arm/macro-assembler-arm.h
index 971b21661b439c..2bf55c94b8fd7d 100644
--- a/deps/v8/src/codegen/arm/macro-assembler-arm.h
+++ b/deps/v8/src/codegen/arm/macro-assembler-arm.h
@@ -13,6 +13,7 @@
 #include "src/codegen/arm/assembler-arm.h"
 #include "src/codegen/bailout-reason.h"
 #include "src/common/globals.h"
+#include "src/execution/frame-constants.h"
 #include "src/objects/tagged-index.h"
 
 namespace v8 {
@@ -93,7 +94,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void Push(Register src) { push(src); }
 
   void Push(Handle<HeapObject> handle);
-  void Push(Smi smi);
+  void Push(Tagged<Smi> smi);
+  void Push(Tagged<TaggedIndex> index);
 
   // Push two registers.  Pushes leftmost register first (to highest address).
   void Push(Register src1, Register src2, Condition cond = al) {
@@ -327,24 +329,29 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   MemOperand EntryFromBuiltinAsOperand(Builtin builtin);
   void LoadEntryFromBuiltin(Builtin builtin, Register destination);
-  // Load the builtin given by the Smi in |builtin| into the same
-  // register.
-  void LoadEntryFromBuiltinIndex(Register builtin_index);
-  void CallBuiltinByIndex(Register builtin_index);
+  // Load the builtin given by the Smi in |builtin| into |target|.
+  void LoadEntryFromBuiltinIndex(Register builtin_index, Register target);
+  void CallBuiltinByIndex(Register builtin_index, Register target);
   void CallBuiltin(Builtin builtin, Condition cond = al);
   void TailCallBuiltin(Builtin builtin, Condition cond = al);
 
   // Load the code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_object);
+  void LoadCodeInstructionStart(Register destination, Register code_object);
   void CallCodeObject(Register code_object);
   void JumpCodeObject(Register code_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object);
+  void JumpJSFunction(Register function_object,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   // Generates an instruction sequence s.t. the return address points to the
   // instruction following the call.
   // The return address on the stack is used by frame iteration.
   void StoreReturnAddressAndCall(Register target);
 
+  void BailoutIfDeoptimized();
   void CallForDeoptimization(Builtin target, int deopt_id, Label* exit,
                              DeoptimizeKind kind, Label* ret,
                              Label* jump_deoptimization_entry_label);
@@ -383,6 +390,10 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void CheckPageFlag(Register object, int mask, Condition cc,
                      Label* condition_met);
+  void CheckPageFlag(Register object, Register scratch, int mask, Condition cc,
+                     Label* condition_met) {
+    CheckPageFlag(object, mask, cc, condition_met);
+  }
 
   // Check whether d16-d31 are available on the CPU. The result is given by the
   // Z condition flag: Z==0 if d16-d31 available, Z==1 otherwise.
@@ -490,7 +501,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
                  NeonMemOperand dst);
 
   // Register move. May do nothing if the registers are identical.
-  void Move(Register dst, Smi smi);
+  void Move(Register dst, Tagged<Smi> smi);
   void Move(Register dst, Handle<HeapObject> value);
   void Move(Register dst, ExternalReference reference);
   void Move(Register dst, Register src, Condition cond = al);
@@ -534,8 +545,12 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   }
 
   void SmiToInt32(Register smi) { SmiUntag(smi); }
+  void SmiToInt32(Register dst, Register smi) { SmiUntag(dst, smi); }
 
   // Load an object from the root table.
+  void LoadTaggedRoot(Register destination, RootIndex index) {
+    LoadRoot(destination, index);
+  }
   void LoadRoot(Register destination, RootIndex index) final {
     LoadRoot(destination, index, al);
   }
@@ -549,6 +564,116 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void LoadMap(Register destination, Register object);
 
+  void PushAll(RegList registers) {
+    if (registers.is_empty()) return;
+    ASM_CODE_COMMENT(this);
+    // stm(db_w, sp, registers);
+    // TODO(victorgomes): {stm/ldm} pushes/pops registers in the opposite order
+    // as expected by Maglev frame. Consider massaging Maglev to accept this
+    // order instead.
+    for (Register reg : registers) {
+      push(reg);
+    }
+  }
+
+  void PopAll(RegList registers) {
+    if (registers.is_empty()) return;
+    ASM_CODE_COMMENT(this);
+    // ldm(ia_w, sp, registers);
+    for (Register reg : base::Reversed(registers)) {
+      pop(reg);
+    }
+  }
+
+  void PushAll(DoubleRegList registers, int stack_slot_size = kDoubleSize) {
+    if (registers.is_empty()) return;
+    ASM_CODE_COMMENT(this);
+    // TODO(victorgomes): vstm only works for consecutive double registers. We
+    // could check if it is the case and optimize here.
+    for (DoubleRegister reg : registers) {
+      vpush(reg);
+    }
+  }
+
+  void PopAll(DoubleRegList registers, int stack_slot_size = kDoubleSize) {
+    if (registers.is_empty()) return;
+    ASM_CODE_COMMENT(this);
+    // TODO(victorgomes): vldm only works for consecutive double registers. We
+    // could check if it is the case and optimize here.
+    for (DoubleRegister reg : base::Reversed(registers)) {
+      vpop(reg);
+    }
+  }
+
+  inline void Cmp(const Register& rn, int imm) { cmp(rn, Operand(imm)); }
+
+  inline void CmpTagged(const Register& r1, const Register& r2) { cmp(r1, r2); }
+
+  // Functions performing a check on a known or potential smi. Returns
+  // a condition that is satisfied if the check is successful.
+  Condition CheckSmi(Register src) {
+    SmiTst(src);
+    return eq;
+  }
+
+  void DecompressTagged(const Register& destination,
+                        const MemOperand& field_operand) {
+    // No pointer compression on arm, we do just a simple load.
+    LoadTaggedField(destination, field_operand);
+  }
+
+  void DecompressTagged(const Register& destination, const Register& source) {
+    // No pointer compression on arm. Do nothing.
+  }
+
+  void AssertMap(Register object) NOOP_UNLESS_DEBUG_CODE;
+
+  void LoadTaggedField(const Register& destination,
+                       const MemOperand& field_operand) {
+    ldr(destination, field_operand);
+  }
+
+  void LoadTaggedFieldWithoutDecompressing(const Register& destination,
+                                           const MemOperand& field_operand) {
+    LoadTaggedField(destination, field_operand);
+  }
+
+  void SmiUntagField(Register dst, const MemOperand& src) {
+    LoadTaggedField(dst, src);
+    SmiUntag(dst);
+  }
+
+  void StoreTaggedField(const Register& value,
+                        const MemOperand& dst_field_operand) {
+    str(value, dst_field_operand);
+  }
+
+  // For compatibility with platform-independent code.
+  void StoreTaggedField(const MemOperand& dst_field_operand,
+                        const Register& value) {
+    StoreTaggedField(value, dst_field_operand);
+  }
+
+  void Switch(Register scratch, Register value, int case_value_base,
+              Label** labels, int num_labels);
+
+  void JumpIfCodeIsMarkedForDeoptimization(Register code, Register scratch,
+                                           Label* if_marked_for_deoptimization);
+
+  void JumpIfCodeIsTurbofanned(Register code, Register scratch,
+                               Label* if_turbofanned);
+
+  // Falls through and sets scratch_and_result to 0 on failure, jumps to
+  // on_result on success.
+  void TryLoadOptimizedOsrCode(Register scratch_and_result,
+                               CodeKind min_opt_level, Register feedback_vector,
+                               FeedbackSlot slot, Label* on_result,
+                               Label::Distance distance);
+
+  void AssertZeroExtended(Register int32_register) {
+    // In arm32, we don't have top 32 bits, so do nothing.
+  }
+
   // Performs a truncating conversion of a floating point number as used by
   // the JS bitwise operations. See ECMA-262 9.5: ToInt32. Goes to 'done' if it
   // succeeds, otherwise falls through if result is saturated. On return
@@ -731,18 +856,15 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
                        unsigned higher_limit, Label* on_in_range);
 
   // It assumes that the arguments are located below the stack pointer.
-  // argc is the number of arguments not including the receiver.
-  // TODO(victorgomes): Remove this function once we stick with the reversed
-  // arguments order.
-  MemOperand ReceiverOperand(Register argc) {
-    return MemOperand(sp, 0);
-  }
+  MemOperand ReceiverOperand() { return MemOperand(sp, 0); }
 
   // Tiering support.
   void AssertFeedbackVector(Register object) NOOP_UNLESS_DEBUG_CODE;
   void ReplaceClosureCodeWithOptimizedCode(Register optimized_code,
                                            Register closure);
   void GenerateTailCallToReturnedCode(Runtime::FunctionId function_id);
+  Condition LoadFeedbackVectorFlagsAndCheckIfNeedsProcessing(
+      Register flags, Register feedback_vector, CodeKind current_code_kind);
   void LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
       Register flags, Register feedback_vector, CodeKind current_code_kind,
       Label* flags_need_processing);
@@ -813,8 +935,12 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void JumpIfNotSmi(Register value, Label* not_smi_label);
 
   // Abort execution if argument is a smi, enabled via --debug-code.
-  void AssertNotSmi(Register object) NOOP_UNLESS_DEBUG_CODE;
-  void AssertSmi(Register object) NOOP_UNLESS_DEBUG_CODE;
+  void AssertNotSmi(Register object,
+                    AbortReason reason = AbortReason::kOperandIsASmi)
+      NOOP_UNLESS_DEBUG_CODE;
+  void AssertSmi(Register object,
+                 AbortReason reason = AbortReason::kOperandIsNotASmi)
+      NOOP_UNLESS_DEBUG_CODE;
 
   // Abort execution if argument is not a Constructor, enabled via --debug-code.
   void AssertConstructor(Register object) NOOP_UNLESS_DEBUG_CODE;
@@ -839,6 +965,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void AssertUndefinedOrAllocationSite(Register object,
                                        Register scratch) NOOP_UNLESS_DEBUG_CODE;
 
+  void AssertJSAny(Register object, Register map_tmp, Register tmp,
+                   AbortReason abort_reason) NOOP_UNLESS_DEBUG_CODE;
+
   template <typename Field>
   void DecodeField(Register dst, Register src) {
     Ubfx(dst, src, Field::kShift, Field::kSize);
@@ -909,6 +1038,33 @@ struct MoveCycleState {
   int scratch_reg_code = -1;
 };
 
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameStackSlotOperand(int offset) {
+  // The slot at [sp] is reserved in all ExitFrames for storing the return
+  // address before doing the actual call, it's necessary for frame iteration
+  // (see StoreReturnAddressAndCall for details).
+  static constexpr int kSPOffset = 1 * kPointerSize;
+  return MemOperand(sp, kSPOffset + offset);
+}
+
+// Provides access to exit frame stack space (not GC-ed).
+inline MemOperand ExitFrameCallerStackSlotOperand(int index) {
+  return MemOperand(
+      fp, (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
+              kSystemPointerSize);
+}
+
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand);
+
 #define ACCESS_MASM(masm) masm->
 
 }  // namespace internal
diff --git a/deps/v8/src/codegen/arm/register-arm.h b/deps/v8/src/codegen/arm/register-arm.h
index 355d6b6f5e72e8..15bc1e88f05717 100644
--- a/deps/v8/src/codegen/arm/register-arm.h
+++ b/deps/v8/src/codegen/arm/register-arm.h
@@ -55,11 +55,6 @@ namespace internal {
   V(cr8)  V(cr9)  V(cr10) V(cr11) V(cr12) V(cr15)
 // clang-format on
 
-// The ARM ABI does not specify the usage of register r9, which may be reserved
-// as the static base or thread register on some platforms, in which case we
-// leave it alone. Adjust the value of kR9Available accordingly:
-const int kR9Available = 1;  // 1 if available to us, 0 if reserved
-
 enum RegisterCode {
 #define REGISTER_CODE(R) kRegCode_##R,
   GENERAL_REGISTERS(REGISTER_CODE)
@@ -77,6 +72,13 @@ ASSERT_TRIVIALLY_COPYABLE(Register);
 static_assert(sizeof(Register) <= sizeof(int),
               "Register can efficiently be passed by value");
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 // r7: context register
 #define DECLARE_REGISTER(R) \
   constexpr Register R = Register::from_code(kRegCode_##R);
@@ -84,6 +86,12 @@ GENERAL_REGISTERS(DECLARE_REGISTER)
 #undef DECLARE_REGISTER
 constexpr Register no_reg = Register::no_reg();
 
+// ARM calling convention
+constexpr Register arg_reg_1 = r0;
+constexpr Register arg_reg_2 = r1;
+constexpr Register arg_reg_3 = r2;
+constexpr Register arg_reg_4 = r3;
+
 // Returns the number of padding slots needed for stack pointer alignment.
 constexpr int ArgumentPaddingSlots(int argument_count) {
   // No argument padding required.
@@ -321,6 +329,8 @@ constexpr Register kRootRegister = r10;  // Roots array pointer.
 
 constexpr DoubleRegister kFPReturnRegister0 = d0;
 
+constexpr Register kMaglevExtraScratchRegister = r9;
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/arm/reglist-arm.h b/deps/v8/src/codegen/arm/reglist-arm.h
index c6834a5db5ad23..1bdf9efba10bff 100644
--- a/deps/v8/src/codegen/arm/reglist-arm.h
+++ b/deps/v8/src/codegen/arm/reglist-arm.h
@@ -28,13 +28,13 @@ const RegList kJSCallerSaved = {r0,   // r0 a1
 const int kNumJSCallerSaved = 4;
 
 // Callee-saved registers preserved when switching from C to JavaScript
-const RegList kCalleeSaved = {r4,  //  r4 v1
-                              r5,  //  r5 v2
-                              r6,  //  r6 v3
-                              r7,  //  r7 v4 (cp in JavaScript code)
-                              r8,  //  r8 v5 (pp in JavaScript code)
-                              kR9Available ? r9 : Register::no_reg(),  //  r9 v6
-                              r10,                                     // r10 v7
+const RegList kCalleeSaved = {r4,    //  r4 v1
+                              r5,    //  r5 v2
+                              r6,    //  r6 v3
+                              r7,    //  r7 v4 (cp in JavaScript code)
+                              r8,    //  r8 v5 (pp in JavaScript code)
+                              r9,    //  r9 v6
+                              r10,   // r10 v7
                               r11};  // r11 v8 (fp in JavaScript code)
 
 // When calling into C++ (only for C++ calls that can't cause a GC).
@@ -45,7 +45,7 @@ const RegList kCallerSaved = {r0,   // r0
                               r3,   // r3
                               r9};  // r9
 
-const int kNumCalleeSaved = 7 + kR9Available;
+const int kNumCalleeSaved = 8;
 
 // Double registers d8 to d15 are callee-saved.
 const int kNumDoubleCalleeSaved = 8;
diff --git a/deps/v8/src/codegen/arm64/assembler-arm64-inl.h b/deps/v8/src/codegen/arm64/assembler-arm64-inl.h
index d564d062745d15..4fcf4782570342 100644
--- a/deps/v8/src/codegen/arm64/assembler-arm64-inl.h
+++ b/deps/v8/src/codegen/arm64/assembler-arm64-inl.h
@@ -14,6 +14,7 @@
 #include "src/debug/debug.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/smi.h"
+#include "src/objects/tagged.h"
 
 namespace v8 {
 namespace internal {
@@ -33,7 +34,8 @@ void RelocInfo::apply(intptr_t delta) {
       Address old_target =
           reinterpret_cast<Address>(instr->ImmPCOffsetTarget());
       Address new_target = old_target - delta;
-      instr->SetBranchImmTarget(reinterpret_cast<Instruction*>(new_target));
+      instr->SetBranchImmTarget<UncondBranchType>(
+          reinterpret_cast<Instruction*>(new_target));
     }
   }
 }
@@ -202,9 +204,11 @@ struct ImmediateInitializer {
 };
 
 template <>
-struct ImmediateInitializer<Smi> {
-  static inline RelocInfo::Mode rmode_for(Smi t) { return RelocInfo::NO_INFO; }
-  static inline int64_t immediate_for(Smi t) {
+struct ImmediateInitializer<Tagged<Smi>> {
+  static inline RelocInfo::Mode rmode_for(Tagged<Smi> t) {
+    return RelocInfo::NO_INFO;
+  }
+  static inline int64_t immediate_for(Tagged<Smi> t) {
     return static_cast<int64_t>(t.ptr());
   }
 };
@@ -548,7 +552,7 @@ int Assembler::deserialization_special_target_size(Address location) {
 }
 
 void Assembler::deserialization_set_special_target_at(Address location,
-                                                      Code code,
+                                                      Tagged<Code> code,
                                                       Address target) {
   Instruction* instr = reinterpret_cast<Instruction*>(location);
   if (instr->IsBranchAndLink() || instr->IsUnconditionalBranch()) {
@@ -557,7 +561,8 @@ void Assembler::deserialization_set_special_target_at(Address location,
       // to zero instead.
       target = location;
     }
-    instr->SetBranchImmTarget(reinterpret_cast<Instruction*>(target));
+    instr->SetBranchImmTarget<UncondBranchType>(
+        reinterpret_cast<Instruction*>(target));
     FlushInstructionCache(location, kInstrSize);
   } else {
     DCHECK_EQ(instr->InstructionBits(), 0);
@@ -593,7 +598,8 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool,
       // to zero instead.
       target = pc;
     }
-    instr->SetBranchImmTarget(reinterpret_cast<Instruction*>(target));
+    instr->SetBranchImmTarget<UncondBranchType>(
+        reinterpret_cast<Instruction*>(target));
     if (icache_flush_mode != SKIP_ICACHE_FLUSH) {
       FlushInstructionCache(pc, kInstrSize);
     }
@@ -653,13 +659,13 @@ Address RelocInfo::constant_pool_entry_address() {
   return Assembler::target_pointer_address_at(pc_);
 }
 
-HeapObject RelocInfo::target_object(PtrComprCageBase cage_base) {
+Tagged<HeapObject> RelocInfo::target_object(PtrComprCageBase cage_base) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
     Tagged_t compressed =
         Assembler::target_compressed_address_at(pc_, constant_pool_);
     DCHECK(!HAS_SMI_TAG(compressed));
-    Object obj(
+    Tagged<Object> obj(
         V8HeapCompressionScheme::DecompressTagged(cage_base, compressed));
     // Embedding of compressed InstructionStream objects must not happen when
     // external code space is enabled, because Codes must be used
@@ -682,8 +688,7 @@ Handle<HeapObject> RelocInfo::target_object_handle(Assembler* origin) {
   }
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(Tagged<HeapObject> target,
                                   ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
@@ -696,9 +701,6 @@ void RelocInfo::set_target_object(Heap* heap, HeapObject target,
     Assembler::set_target_address_at(pc_, constant_pool_, target.ptr(),
                                      icache_flush_mode);
   }
-  if (!instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target, write_barrier_mode);
-  }
 }
 
 Address RelocInfo::target_external_reference() {
@@ -827,6 +829,42 @@ LoadLiteralOp Assembler::LoadLiteralOpFor(const CPURegister& rt) {
   }
 }
 
+inline void Assembler::LoadStoreScaledImmOffset(Instr memop, int offset,
+                                                unsigned size) {
+  Emit(LoadStoreUnsignedOffsetFixed | memop | ImmLSUnsigned(offset >> size));
+}
+
+inline void Assembler::LoadStoreUnscaledImmOffset(Instr memop, int offset) {
+  Emit(LoadStoreUnscaledOffsetFixed | memop | ImmLS(offset));
+}
+
+inline void Assembler::LoadStoreWRegOffset(Instr memop,
+                                           const Register& regoffset) {
+  Emit(LoadStoreRegisterOffsetFixed | memop | Rm(regoffset) | ExtendMode(UXTW));
+}
+
+inline void Assembler::DataProcPlainRegister(const Register& rd,
+                                             const Register& rn,
+                                             const Register& rm, Instr op) {
+  DCHECK(AreSameSizeAndType(rd, rn, rm));
+  Emit(SF(rd) | AddSubShiftedFixed | op | Rm(rm) | Rn(rn) | Rd(rd));
+}
+
+inline void Assembler::CmpPlainRegister(const Register& rn,
+                                        const Register& rm) {
+  DCHECK(AreSameSizeAndType(rn, rm));
+  Emit(SF(rn) | AddSubShiftedFixed | SUB | Flags(SetFlags) | Rm(rm) | Rn(rn) |
+       Rd(xzr));
+}
+
+inline void Assembler::DataProcImmediate(const Register& rd, const Register& rn,
+                                         int immediate, Instr op) {
+  DCHECK(AreSameSizeAndType(rd, rn));
+  DCHECK(IsImmAddSub(immediate));
+  Emit(SF(rd) | AddSubImmediateFixed | op | ImmAddSub(immediate) | RdSP(rd) |
+       RnSP(rn));
+}
+
 int Assembler::LinkAndGetInstructionOffsetTo(Label* label) {
   DCHECK_EQ(kStartOfLabelLinkChain, 0);
   int offset = LinkAndGetByteOffsetTo(label);
@@ -1016,17 +1054,17 @@ Instr Assembler::ImmBarrierType(int imm2) {
   return imm2 << ImmBarrierType_offset;
 }
 
-unsigned Assembler::CalcLSDataSize(LoadStoreOp op) {
+unsigned Assembler::CalcLSDataSizeLog2(LoadStoreOp op) {
   DCHECK((LSSize_offset + LSSize_width) == (kInstrSize * 8));
-  unsigned size = static_cast<Instr>(op >> LSSize_offset);
+  unsigned size_log2 = static_cast<Instr>(op >> LSSize_offset);
   if ((op & LSVector_mask) != 0) {
     // Vector register memory operations encode the access size in the "size"
     // and "opc" fields.
-    if ((size == 0) && ((op & LSOpc_mask) >> LSOpc_offset) >= 2) {
-      size = kQRegSizeLog2;
+    if (size_log2 == 0 && ((op & LSOpc_mask) >> LSOpc_offset) >= 2) {
+      size_log2 = kQRegSizeLog2;
     }
   }
-  return size;
+  return size_log2;
 }
 
 Instr Assembler::ImmMoveWide(int imm) {
diff --git a/deps/v8/src/codegen/arm64/assembler-arm64.cc b/deps/v8/src/codegen/arm64/assembler-arm64.cc
index f753e0bcc8221c..c1334d0d83c452 100644
--- a/deps/v8/src/codegen/arm64/assembler-arm64.cc
+++ b/deps/v8/src/codegen/arm64/assembler-arm64.cc
@@ -391,6 +391,7 @@ void Assembler::Reset() {
   pc_ = buffer_start_;
   reloc_info_writer.Reposition(buffer_start_ + buffer_->size(), pc_);
   constpool_.Clear();
+  constpool_.SetNextCheckIn(ConstantPool::kCheckInterval);
   next_veneer_pool_check_ = kMaxInt;
 }
 
@@ -402,7 +403,7 @@ win64_unwindinfo::BuiltinUnwindInfo Assembler::GetUnwindInfo() const {
 }
 #endif
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Address pc = reinterpret_cast<Address>(buffer_start_) + request.offset();
@@ -414,7 +415,10 @@ void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
   }
 }
 
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
+}
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
                         SafepointTableBuilderBase* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
@@ -519,8 +523,8 @@ void Assembler::RemoveBranchFromLabelLinkChain(Instruction* branch,
       // currently referring to this label.
       label->Unuse();
     } else {
-      label->link_to(
-          static_cast<int>(reinterpret_cast<byte*>(next_link) - buffer_start_));
+      label->link_to(static_cast<int>(reinterpret_cast<uint8_t*>(next_link) -
+                                      buffer_start_));
     }
 
   } else if (branch == next_link) {
@@ -683,23 +687,24 @@ void Assembler::DeleteUnresolvedBranchInfoForLabelTraverse(Label* label) {
 
   while (!end_of_chain) {
     Instruction* link = InstructionAt(link_offset);
-    link_pcoffset = static_cast<int>(link->ImmPCOffset());
-
-    // ADR instructions are not handled by veneers.
-    if (link->IsImmBranch()) {
-      int max_reachable_pc =
-          static_cast<int>(InstructionOffset(link) +
-                           Instruction::ImmBranchRange(link->BranchType()));
-      using unresolved_info_it = std::multimap<int, FarBranchInfo>::iterator;
-      std::pair<unresolved_info_it, unresolved_info_it> range;
-      range = unresolved_branches_.equal_range(max_reachable_pc);
-      unresolved_info_it it;
-      for (it = range.first; it != range.second; ++it) {
-        if (it->second.pc_offset_ == link_offset) {
-          unresolved_branches_.erase(it);
-          break;
-        }
-      }
+    int max_reachable_pc = static_cast<int>(InstructionOffset(link));
+
+    // ADR instructions and unconditional branches are not handled by veneers.
+    if (link->IsCondBranchImm() || link->IsCompareBranch()) {
+      static_assert(Instruction::ImmBranchRange(CondBranchType) ==
+                    Instruction::ImmBranchRange(CompareBranchType));
+      max_reachable_pc += Instruction::ImmBranchRange(CondBranchType);
+      unresolved_branches_.erase(max_reachable_pc);
+      link_pcoffset = link->ImmCondBranch() * kInstrSize;
+    } else if (link->IsTestBranch()) {
+      // Add one to account for branch type tag bit.
+      max_reachable_pc += Instruction::ImmBranchRange(TestBranchType) + 1;
+      unresolved_branches_.erase(max_reachable_pc);
+      link_pcoffset = link->ImmTestBranch() * kInstrSize;
+    } else if (link->IsUncondBranchImm()) {
+      link_pcoffset = link->ImmUncondBranch() * kInstrSize;
+    } else {
+      link_pcoffset = static_cast<int>(link->ImmPCOffset());
     }
 
     end_of_chain = (link_pcoffset == 0);
@@ -3731,10 +3736,10 @@ void Assembler::dcptr(Label* label) {
 // Below, a difference in case for the same letter indicates a
 // negated bit. If b is 1, then B is 0.
 uint32_t Assembler::FPToImm8(double imm) {
-  DCHECK(IsImmFP64(imm));
+  uint64_t bits = base::bit_cast<uint64_t>(imm);
+  DCHECK(IsImmFP64(bits));
   // bits: aBbb.bbbb.bbcd.efgh.0000.0000.0000.0000
   //       0000.0000.0000.0000.0000.0000.0000.0000
-  uint64_t bits = base::bit_cast<uint64_t>(imm);
   // bit7: a000.0000
   uint64_t bit7 = ((bits >> 63) & 0x1) << 7;
   // bit6: 0b00.0000
@@ -4107,29 +4112,18 @@ void Assembler::DataProcExtendedRegister(const Register& rd, const Register& rn,
        dest_reg | RnSP(rn));
 }
 
-bool Assembler::IsImmAddSub(int64_t immediate) {
-  return is_uint12(immediate) ||
-         (is_uint12(immediate >> 12) && ((immediate & 0xFFF) == 0));
-}
-
 void Assembler::LoadStore(const CPURegister& rt, const MemOperand& addr,
                           LoadStoreOp op) {
   Instr memop = op | Rt(rt) | RnSP(addr.base());
 
   if (addr.IsImmediateOffset()) {
-    unsigned size = CalcLSDataSize(op);
-    if (IsImmLSScaled(addr.offset(), size)) {
-      int offset = static_cast<int>(addr.offset());
-      // Use the scaled addressing mode.
-      Emit(LoadStoreUnsignedOffsetFixed | memop |
-           ImmLSUnsigned(offset >> size));
-    } else if (IsImmLSUnscaled(addr.offset())) {
-      int offset = static_cast<int>(addr.offset());
-      // Use the unscaled addressing mode.
-      Emit(LoadStoreUnscaledOffsetFixed | memop | ImmLS(offset));
+    unsigned size_log2 = CalcLSDataSizeLog2(op);
+    int offset = static_cast<int>(addr.offset());
+    if (IsImmLSScaled(addr.offset(), size_log2)) {
+      LoadStoreScaledImmOffset(memop, offset, size_log2);
     } else {
-      // This case is handled in the macro assembler.
-      UNREACHABLE();
+      DCHECK(IsImmLSUnscaled(addr.offset()));
+      LoadStoreUnscaledImmOffset(memop, offset);
     }
   } else if (addr.IsRegisterOffset()) {
     Extend ext = addr.extend();
@@ -4143,37 +4137,23 @@ void Assembler::LoadStore(const CPURegister& rt, const MemOperand& addr,
 
     // Shifts are encoded in one bit, indicating a left shift by the memory
     // access size.
-    DCHECK((shift_amount == 0) ||
-           (shift_amount == static_cast<unsigned>(CalcLSDataSize(op))));
+    DCHECK(shift_amount == 0 || shift_amount == CalcLSDataSizeLog2(op));
     Emit(LoadStoreRegisterOffsetFixed | memop | Rm(addr.regoffset()) |
          ExtendMode(ext) | ImmShiftLS((shift_amount > 0) ? 1 : 0));
   } else {
     // Pre-index and post-index modes.
+    DCHECK(IsImmLSUnscaled(addr.offset()));
     DCHECK_NE(rt, addr.base());
-    if (IsImmLSUnscaled(addr.offset())) {
-      int offset = static_cast<int>(addr.offset());
-      if (addr.IsPreIndex()) {
-        Emit(LoadStorePreIndexFixed | memop | ImmLS(offset));
-      } else {
-        DCHECK(addr.IsPostIndex());
-        Emit(LoadStorePostIndexFixed | memop | ImmLS(offset));
-      }
+    int offset = static_cast<int>(addr.offset());
+    if (addr.IsPreIndex()) {
+      Emit(LoadStorePreIndexFixed | memop | ImmLS(offset));
     } else {
-      // This case is handled in the macro assembler.
-      UNREACHABLE();
+      DCHECK(addr.IsPostIndex());
+      Emit(LoadStorePostIndexFixed | memop | ImmLS(offset));
     }
   }
 }
 
-bool Assembler::IsImmLSUnscaled(int64_t offset) { return is_int9(offset); }
-
-bool Assembler::IsImmLSScaled(int64_t offset, unsigned size) {
-  bool offset_is_size_multiple =
-      (static_cast<int64_t>(static_cast<uint64_t>(offset >> size) << size) ==
-       offset);
-  return offset_is_size_multiple && is_uint12(offset >> size);
-}
-
 bool Assembler::IsImmLSPair(int64_t offset, unsigned size) {
   bool offset_is_size_multiple =
       (static_cast<int64_t>(static_cast<uint64_t>(offset >> size) << size) ==
@@ -4396,10 +4376,9 @@ bool Assembler::IsImmConditionalCompare(int64_t immediate) {
   return is_uint5(immediate);
 }
 
-bool Assembler::IsImmFP32(float imm) {
+bool Assembler::IsImmFP32(uint32_t bits) {
   // Valid values will have the form:
   // aBbb.bbbc.defg.h000.0000.0000.0000.0000
-  uint32_t bits = base::bit_cast<uint32_t>(imm);
   // bits[19..0] are cleared.
   if ((bits & 0x7FFFF) != 0) {
     return false;
@@ -4419,11 +4398,10 @@ bool Assembler::IsImmFP32(float imm) {
   return true;
 }
 
-bool Assembler::IsImmFP64(double imm) {
+bool Assembler::IsImmFP64(uint64_t bits) {
   // Valid values will have the form:
   // aBbb.bbbb.bbcd.efgh.0000.0000.0000.0000
   // 0000.0000.0000.0000.0000.0000.0000.0000
-  uint64_t bits = base::bit_cast<uint64_t>(imm);
   // bits[47..0] are cleared.
   if ((bits & 0xFFFFFFFFFFFFL) != 0) {
     return false;
@@ -4457,7 +4435,7 @@ void Assembler::GrowBuffer() {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   intptr_t pc_delta = new_start - buffer_start_;
@@ -4491,19 +4469,17 @@ void Assembler::GrowBuffer() {
 
 void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data,
                                 ConstantPoolMode constant_pool_mode) {
-  if ((rmode == RelocInfo::INTERNAL_REFERENCE) ||
-      (rmode == RelocInfo::CONST_POOL) || (rmode == RelocInfo::VENEER_POOL) ||
-      (rmode == RelocInfo::DEOPT_SCRIPT_OFFSET) ||
-      (rmode == RelocInfo::DEOPT_INLINING_ID) ||
-      (rmode == RelocInfo::DEOPT_REASON) || (rmode == RelocInfo::DEOPT_ID) ||
-      (rmode == RelocInfo::LITERAL_CONSTANT) ||
-      (rmode == RelocInfo::DEOPT_NODE_ID)) {
+  if (rmode == RelocInfo::INTERNAL_REFERENCE ||
+      rmode == RelocInfo::CONST_POOL || rmode == RelocInfo::VENEER_POOL ||
+      rmode == RelocInfo::DEOPT_SCRIPT_OFFSET ||
+      rmode == RelocInfo::DEOPT_INLINING_ID ||
+      rmode == RelocInfo::DEOPT_REASON || rmode == RelocInfo::DEOPT_ID ||
+      rmode == RelocInfo::DEOPT_NODE_ID) {
     // Adjust code for new modes.
     DCHECK(RelocInfo::IsDeoptReason(rmode) || RelocInfo::IsDeoptId(rmode) ||
            RelocInfo::IsDeoptNodeId(rmode) ||
            RelocInfo::IsDeoptPosition(rmode) ||
            RelocInfo::IsInternalReference(rmode) ||
-           RelocInfo::IsLiteralConstant(rmode) ||
            RelocInfo::IsConstPool(rmode) || RelocInfo::IsVeneerPool(rmode));
     // These modes do not need an entry in the constant pool.
   } else if (constant_pool_mode == NEEDS_POOL_ENTRY) {
@@ -4533,9 +4509,7 @@ void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data,
   DCHECK(constpool_.IsBlocked());
 
   // We do not try to reuse pool constants.
-  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data, Code(),
-                  InstructionStream());
-
+  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data);
   DCHECK_GE(buffer_space(), kMaxRelocSize);  // too late to grow buffer here
   reloc_info_writer.Write(&rinfo);
 }
@@ -4660,8 +4634,7 @@ intptr_t Assembler::MaxPCOffsetAfterVeneerPoolIfEmittedNow(size_t margin) {
 void Assembler::RecordVeneerPool(int location_offset, int size) {
   Assembler::BlockPoolsScope block_pools(this, PoolEmissionCheck::kSkip);
   RelocInfo rinfo(reinterpret_cast<Address>(buffer_start_) + location_offset,
-                  RelocInfo::VENEER_POOL, static_cast<intptr_t>(size), Code(),
-                  InstructionStream());
+                  RelocInfo::VENEER_POOL, static_cast<intptr_t>(size));
   reloc_info_writer.Write(&rinfo);
 }
 
@@ -4693,29 +4666,49 @@ void Assembler::EmitVeneers(bool force_emit, bool need_protection,
   const intptr_t max_pc_after_veneers =
       MaxPCOffsetAfterVeneerPoolIfEmittedNow(margin);
 
-  // The `unresolved_branches_` multimap is sorted by max-reachable-pc in
-  // ascending order. For efficiency reasons, we want to call
+  // The `unresolved_branches_` map is sorted by max-reachable-pc in ascending
+  // order. For efficiency reasons, we want to call
   // RemoveBranchFromLabelLinkChain in descending order. The actual veneers are
   // then generated in ascending order.
   // TODO(jgruber): This is still inefficient in multiple ways, thoughts on how
   // we could improve in the future:
-  // - Don't erase individual elements from the multimap, erase a range instead.
-  // - Replace the multimap by a simpler data structure (like a plain vector or
-  //   a circular array).
   // - Refactor s.t. RemoveBranchFromLabelLinkChain does not need the linear
   //   lookup in the link chain.
 
+  class FarBranchInfo {
+   public:
+    FarBranchInfo(int offset, Label* label)
+        : pc_offset_(offset), label_(label) {}
+    // Offset of the branch in the code generation buffer.
+    int pc_offset_;
+    // The label branched to.
+    Label* label_;
+  };
+
   static constexpr int kStaticTasksSize = 16;  // Arbitrary.
   base::SmallVector<FarBranchInfo, kStaticTasksSize> tasks;
 
   {
     auto it = unresolved_branches_.begin();
     while (it != unresolved_branches_.end()) {
-      const int max_reachable_pc = it->first;
+      const int max_reachable_pc = it->first & ~1;
       if (!force_emit && max_reachable_pc > max_pc_after_veneers) break;
 
       // Found a task. We'll emit a veneer for this.
-      tasks.emplace_back(it->second);
+
+      // Calculate the branch location from the maximum reachable PC. Only
+      // B.cond, CB[N]Z and TB[N]Z are veneered, and the first two branch types
+      // have the same range. The LSB (branch type tag bit) is set for TB[N]Z,
+      // clear otherwise.
+      int pc_offset = it->first;
+      if (pc_offset & 1) {
+        pc_offset -= (Instruction::ImmBranchRange(TestBranchType) + 1);
+      } else {
+        static_assert(Instruction::ImmBranchRange(CondBranchType) ==
+                      Instruction::ImmBranchRange(CompareBranchType));
+        pc_offset -= Instruction::ImmBranchRange(CondBranchType);
+      }
+      tasks.emplace_back(FarBranchInfo{pc_offset, it->second});
       auto eraser_it = it++;
       unresolved_branches_.erase(eraser_it);
     }
diff --git a/deps/v8/src/codegen/arm64/assembler-arm64.h b/deps/v8/src/codegen/arm64/assembler-arm64.h
index 5c10dd869792ce..fea82ed1f7d57b 100644
--- a/deps/v8/src/codegen/arm64/assembler-arm64.h
+++ b/deps/v8/src/codegen/arm64/assembler-arm64.h
@@ -192,12 +192,14 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // GetCode emits any pending (non-emitted) code and fills the descriptor desc.
   static constexpr int kNoHandlerTable = 0;
   static constexpr SafepointTableBuilderBase* kNoSafepointTable = nullptr;
-  void GetCode(Isolate* isolate, CodeDesc* desc,
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
                SafepointTableBuilderBase* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -278,7 +280,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // an immediate branch or the address of an entry in the constant pool.
   // This is for calls and branches within generated code.
   inline static void deserialization_set_special_target_at(Address location,
-                                                           Code code,
+                                                           Tagged<Code> code,
                                                            Address target);
 
   // Get the size of the special target encoded at 'location'.
@@ -2690,28 +2692,16 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   // Required by V8.
   void db(uint8_t data) { dc8(data); }
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
+  void dd(uint32_t data) {
     BlockPoolsScope no_pool_scope(this);
-    if (!RelocInfo::IsNoInfo(rmode)) {
-      DCHECK(RelocInfo::IsLiteralConstant(rmode));
-      RecordRelocInfo(rmode);
-    }
     dc32(data);
   }
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
+  void dq(uint64_t data) {
     BlockPoolsScope no_pool_scope(this);
-    if (!RelocInfo::IsNoInfo(rmode)) {
-      DCHECK(RelocInfo::IsLiteralConstant(rmode));
-      RecordRelocInfo(rmode);
-    }
     dc64(data);
   }
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
+  void dp(uintptr_t data) {
     BlockPoolsScope no_pool_scope(this);
-    if (!RelocInfo::IsNoInfo(rmode)) {
-      DCHECK(RelocInfo::IsLiteralConstant(rmode));
-      RecordRelocInfo(rmode);
-    }
     dc64(data);
   }
 
@@ -2725,7 +2715,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   }
 
   ptrdiff_t InstructionOffset(Instruction* instr) const {
-    return reinterpret_cast<byte*>(instr) - buffer_start_;
+    return reinterpret_cast<uint8_t*>(instr) - buffer_start_;
   }
 
   // Register encoding.
@@ -2812,7 +2802,11 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   inline static Instr ImmCondCmp(unsigned imm);
   inline static Instr Nzcv(StatusFlags nzcv);
 
-  static bool IsImmAddSub(int64_t immediate);
+  static constexpr bool IsImmAddSub(int64_t immediate) {
+    return is_uint12(immediate) ||
+           (is_uint12(immediate >> 12) && ((immediate & 0xFFF) == 0));
+  }
+
   static bool IsImmLogical(uint64_t value, unsigned width, unsigned* n,
                            unsigned* imm_s, unsigned* imm_r);
 
@@ -2826,7 +2820,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   inline static Instr ImmHint(int imm7);
   inline static Instr ImmBarrierDomain(int imm2);
   inline static Instr ImmBarrierType(int imm2);
-  inline static unsigned CalcLSDataSize(LoadStoreOp op);
+  inline static unsigned CalcLSDataSizeLog2(LoadStoreOp op);
 
   // Instruction bits for vector format in data processing operations.
   static Instr VFormat(VRegister vd) {
@@ -2985,8 +2979,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
     return op << NEONModImmOp_offset;
   }
 
-  static bool IsImmLSUnscaled(int64_t offset);
-  static bool IsImmLSScaled(int64_t offset, unsigned size);
+  static constexpr bool IsImmLSUnscaled(int64_t offset) {
+    return is_int9(offset);
+  }
+  static constexpr bool IsImmLSScaled(int64_t offset, unsigned size_log2) {
+    bool offset_is_size_multiple =
+        (static_cast<int64_t>(static_cast<uint64_t>(offset >> size_log2)
+                              << size_log2) == offset);
+    return offset_is_size_multiple && is_uint12(offset >> size_log2);
+  }
   static bool IsImmLLiteral(int64_t offset);
 
   // Move immediates encoding.
@@ -3013,6 +3014,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Check if the const pool needs to be emitted while pretending that {margin}
   // more bytes of instructions have already been emitted.
   void EmitConstPoolWithJumpIfNeeded(size_t margin = 0) {
+    if (constpool_.IsEmpty()) return;
     constpool_.Check(Emission::kIfNeeded, Jump::kRequired, margin);
   }
 
@@ -3082,6 +3084,9 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   inline const Register& AppropriateZeroRegFor(const CPURegister& reg) const;
 
   void LoadStore(const CPURegister& rt, const MemOperand& addr, LoadStoreOp op);
+  inline void LoadStoreScaledImmOffset(Instr memop, int offset, unsigned size);
+  inline void LoadStoreUnscaledImmOffset(Instr memop, int offset);
+  inline void LoadStoreWRegOffset(Instr memop, const Register& regoffset);
   void LoadStorePair(const CPURegister& rt, const CPURegister& rt2,
                      const MemOperand& addr, LoadStorePairOp op);
   void LoadStoreStruct(const VRegister& vt, const MemOperand& addr,
@@ -3123,8 +3128,14 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void AddSub(const Register& rd, const Register& rn, const Operand& operand,
               FlagsUpdate S, AddSubOp op);
 
-  static bool IsImmFP32(float imm);
-  static bool IsImmFP64(double imm);
+  inline void DataProcPlainRegister(const Register& rd, const Register& rn,
+                                    const Register& rm, Instr op);
+  inline void CmpPlainRegister(const Register& rn, const Register& rm);
+  inline void DataProcImmediate(const Register& rd, const Register& rn,
+                                int immediate, Instr op);
+
+  static bool IsImmFP32(uint32_t bits);
+  static bool IsImmFP64(uint64_t bits);
 
   // Find an appropriate LoadStoreOp or LoadStorePairOp for the specified
   // registers. Only simple loads are supported; sign- and zero-extension (such
@@ -3318,30 +3329,28 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   }
 #endif
 
-  class FarBranchInfo {
-   public:
-    FarBranchInfo(int offset, Label* label)
-        : pc_offset_(offset), label_(label) {}
-    // Offset of the branch in the code generation buffer.
-    int pc_offset_;
-    // The label branched to.
-    Label* label_;
-  };
-
  protected:
   // Information about unresolved (forward) branches.
   // The Assembler is only allowed to delete out-of-date information from here
   // after a label is bound. The MacroAssembler uses this information to
   // generate veneers.
   //
-  // The second member gives information about the unresolved branch. The first
-  // member of the pair is the maximum offset that the branch can reach in the
-  // buffer. The map is sorted according to this reachable offset, allowing to
-  // easily check when veneers need to be emitted.
+  // The first member of the pair (max_pc) is the maximum offset that the branch
+  // can reach in the buffer, with the bottom bit set to indicate a
+  // test-and-branch instruction. This bit is used to help in calculating the
+  // address of the branch, ie.
+  //
+  //   branch_addr = { max_pc - 2^21,     if max_pc<0> == 0 (B.cond, CB[N]Z)
+  //                 { max_pc - 2^16 - 1, if max_pc<0> == 1 (TB[N]Z)
+  //
+  // The second member is a pointer to the Label targetted by the branch.
+  //
+  // The map is sorted according to the reachable offset, max_pc, allowing to
+  // check easily when veneers need to be emitted.
   // Note that the maximum reachable offset (first member of the pairs) should
   // always be positive but has the same type as the return value for
   // pc_offset() for convenience.
-  std::multimap<int, FarBranchInfo> unresolved_branches_;
+  std::map<int, Label*> unresolved_branches_;
 
   // We generate a veneer for a branch if we reach within this distance of the
   // limit of the range.
@@ -3354,8 +3363,11 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
       kVeneerNoProtectionFactor * kVeneerDistanceMargin;
   int unresolved_branches_first_limit() const {
     DCHECK(!unresolved_branches_.empty());
-    return unresolved_branches_.begin()->first;
+
+    // Mask branch type tag bit.
+    return unresolved_branches_.begin()->first & ~1;
   }
+
   // This PC-offset of the next veneer pool check helps reduce the overhead
   // of checking for veneer pools.
   // It is maintained to the closest unresolved branch limit minus the maximum
@@ -3381,7 +3393,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // the length of the label chain.
   void DeleteUnresolvedBranchInfoForLabelTraverse(Label* label);
 
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
@@ -3403,7 +3415,7 @@ class PatchingAssembler : public Assembler {
   // relocation information takes space in the buffer, the PatchingAssembler
   // will crash trying to grow the buffer.
   // Note that the instruction cache will not be flushed.
-  PatchingAssembler(const AssemblerOptions& options, byte* start,
+  PatchingAssembler(const AssemblerOptions& options, uint8_t* start,
                     unsigned count)
       : Assembler(options,
                   ExternalAssemblerBuffer(start, count * kInstrSize + kGap)),
diff --git a/deps/v8/src/codegen/arm64/constants-arm64.h b/deps/v8/src/codegen/arm64/constants-arm64.h
index 1866842f1ebd2b..da9621467e2e7b 100644
--- a/deps/v8/src/codegen/arm64/constants-arm64.h
+++ b/deps/v8/src/codegen/arm64/constants-arm64.h
@@ -300,7 +300,7 @@ SYSTEM_REGISTER_FIELDS_LIST(DECLARE_FIELDS_OFFSETS, NOTHING)
 constexpr int ImmPCRel_mask = ImmPCRelLo_mask | ImmPCRelHi_mask;
 
 // Condition codes.
-enum Condition : uint8_t {
+enum Condition : int {
   eq = 0,   // Equal
   ne = 1,   // Not equal
   hs = 2,   // Unsigned higher or same (or carry set)
diff --git a/deps/v8/src/codegen/arm64/instructions-arm64.cc b/deps/v8/src/codegen/arm64/instructions-arm64.cc
index 7d986f286d92de..e6bc524ba8d6d1 100644
--- a/deps/v8/src/codegen/arm64/instructions-arm64.cc
+++ b/deps/v8/src/codegen/arm64/instructions-arm64.cc
@@ -153,18 +153,17 @@ double Instruction::ImmNEONFP64() const {
   return Imm8ToFP64(ImmNEONabcdefgh());
 }
 
-unsigned CalcLSDataSize(LoadStoreOp op) {
-  DCHECK_EQ(static_cast<unsigned>(LSSize_offset + LSSize_width),
-            kInstrSize * 8);
-  unsigned size = static_cast<Instr>(op) >> LSSize_offset;
+unsigned CalcLSDataSizeLog2(LoadStoreOp op) {
+  DCHECK_EQ(LSSize_offset + LSSize_width, kInstrSize * 8);
+  unsigned size_log2 = static_cast<Instr>(op) >> LSSize_offset;
   if ((op & LSVector_mask) != 0) {
     // Vector register memory operations encode the access size in the "size"
     // and "opc" fields.
-    if ((size == 0) && ((op & LSOpc_mask) >> LSOpc_offset) >= 2) {
-      size = kQRegSizeLog2;
+    if (size_log2 == 0 && ((op & LSOpc_mask) >> LSOpc_offset) >= 2) {
+      size_log2 = kQRegSizeLog2;
     }
   }
-  return size;
+  return size_log2;
 }
 
 unsigned CalcLSPairDataSize(LoadStorePairOp op) {
@@ -210,12 +209,6 @@ Instruction* Instruction::ImmPCOffsetTarget() {
   return InstructionAtOffset(ImmPCOffset());
 }
 
-bool Instruction::IsValidImmPCOffset(ImmBranchType branch_type,
-                                     ptrdiff_t offset) {
-  DCHECK_EQ(offset % kInstrSize, 0);
-  return is_intn(offset / kInstrSize, ImmBranchRangeBitwidth(branch_type));
-}
-
 bool Instruction::IsTargetInImmPCOffsetRange(Instruction* target) {
   return IsValidImmPCOffset(BranchType(), DistanceTo(target));
 }
@@ -224,8 +217,14 @@ void Instruction::SetImmPCOffsetTarget(const AssemblerOptions& options,
                                        Instruction* target) {
   if (IsPCRelAddressing()) {
     SetPCRelImmTarget(options, target);
-  } else if (BranchType() != UnknownBranchType) {
-    SetBranchImmTarget(target);
+  } else if (IsCondBranchImm()) {
+    SetBranchImmTarget<CondBranchType>(target);
+  } else if (IsUncondBranchImm()) {
+    SetBranchImmTarget<UncondBranchType>(target);
+  } else if (IsCompareBranch()) {
+    SetBranchImmTarget<CompareBranchType>(target);
+  } else if (IsTestBranch()) {
+    SetBranchImmTarget<TestBranchType>(target);
   } else if (IsUnresolvedInternalReference()) {
     SetUnresolvedInternalReferenceImmTarget(options, target);
   } else {
@@ -245,45 +244,12 @@ void Instruction::SetPCRelImmTarget(const AssemblerOptions& options,
     imm = Assembler::ImmPCRelAddress(static_cast<int>(target_offset));
     SetInstructionBits(Mask(~ImmPCRel_mask) | imm);
   } else {
-    PatchingAssembler patcher(options, reinterpret_cast<byte*>(this),
+    PatchingAssembler patcher(options, reinterpret_cast<uint8_t*>(this),
                               PatchingAssembler::kAdrFarPatchableNInstrs);
     patcher.PatchAdrFar(target_offset);
   }
 }
 
-void Instruction::SetBranchImmTarget(Instruction* target) {
-  DCHECK(IsAligned(DistanceTo(target), kInstrSize));
-  DCHECK(IsValidImmPCOffset(BranchType(), DistanceTo(target)));
-  int offset = static_cast<int>(DistanceTo(target) >> kInstrSizeLog2);
-  Instr branch_imm = 0;
-  uint32_t imm_mask = 0;
-  switch (BranchType()) {
-    case CondBranchType: {
-      branch_imm = Assembler::ImmCondBranch(offset);
-      imm_mask = ImmCondBranch_mask;
-      break;
-    }
-    case UncondBranchType: {
-      branch_imm = Assembler::ImmUncondBranch(offset);
-      imm_mask = ImmUncondBranch_mask;
-      break;
-    }
-    case CompareBranchType: {
-      branch_imm = Assembler::ImmCmpBranch(offset);
-      imm_mask = ImmCmpBranch_mask;
-      break;
-    }
-    case TestBranchType: {
-      branch_imm = Assembler::ImmTestBranch(offset);
-      imm_mask = ImmTestBranch_mask;
-      break;
-    }
-    default:
-      UNREACHABLE();
-  }
-  SetInstructionBits(Mask(~imm_mask) | branch_imm);
-}
-
 void Instruction::SetUnresolvedInternalReferenceImmTarget(
     const AssemblerOptions& options, Instruction* target) {
   DCHECK(IsUnresolvedInternalReference());
@@ -294,7 +260,7 @@ void Instruction::SetUnresolvedInternalReferenceImmTarget(
   uint32_t high16 = unsigned_bitextract_32(31, 16, target_offset);
   uint32_t low16 = unsigned_bitextract_32(15, 0, target_offset);
 
-  PatchingAssembler patcher(options, reinterpret_cast<byte*>(this), 2);
+  PatchingAssembler patcher(options, reinterpret_cast<uint8_t*>(this), 2);
   patcher.brk(high16);
   patcher.brk(low16);
 }
diff --git a/deps/v8/src/codegen/arm64/instructions-arm64.h b/deps/v8/src/codegen/arm64/instructions-arm64.h
index 87a245584969a6..6bd4599452e9df 100644
--- a/deps/v8/src/codegen/arm64/instructions-arm64.h
+++ b/deps/v8/src/codegen/arm64/instructions-arm64.h
@@ -50,7 +50,7 @@ extern const float16 kFP16DefaultNaN;
 }  // end of extern "C"
 #endif
 
-unsigned CalcLSDataSize(LoadStoreOp op);
+unsigned CalcLSDataSizeLog2(LoadStoreOp op);
 unsigned CalcLSPairDataSize(LoadStorePairOp op);
 
 enum ImmBranchType {
@@ -144,7 +144,7 @@ class Instruction {
   double ImmNEONFP64() const;
 
   unsigned SizeLS() const {
-    return CalcLSDataSize(static_cast<LoadStoreOp>(Mask(LoadStoreMask)));
+    return CalcLSDataSizeLog2(static_cast<LoadStoreOp>(Mask(LoadStoreMask)));
   }
 
   unsigned SizeLSPair() const {
@@ -308,7 +308,7 @@ class Instruction {
     }
   }
 
-  static int ImmBranchRangeBitwidth(ImmBranchType branch_type) {
+  static constexpr int ImmBranchRangeBitwidth(ImmBranchType branch_type) {
     switch (branch_type) {
       case UncondBranchType:
         return ImmUncondBranch_width;
@@ -324,7 +324,7 @@ class Instruction {
   }
 
   // The range of the branch instruction, expressed as 'instr +- range'.
-  static int32_t ImmBranchRange(ImmBranchType branch_type) {
+  static constexpr int32_t ImmBranchRange(ImmBranchType branch_type) {
     return (1 << (ImmBranchRangeBitwidth(branch_type) + kInstrSizeLog2)) / 2 -
            kInstrSize;
   }
@@ -416,7 +416,12 @@ class Instruction {
 
   // Check if the offset is in range of a given branch type. The offset is
   // a byte offset, unscaled.
-  static bool IsValidImmPCOffset(ImmBranchType branch_type, ptrdiff_t offset);
+  static constexpr bool IsValidImmPCOffset(ImmBranchType branch_type,
+                                           ptrdiff_t offset) {
+    DCHECK_EQ(offset % kInstrSize, 0);
+    return is_intn(offset / kInstrSize, ImmBranchRangeBitwidth(branch_type));
+  }
+
   bool IsTargetInImmPCOffsetRange(Instruction* target);
   // Patch a PC-relative offset to refer to 'target'. 'this' may be a branch or
   // a PC-relative addressing instruction.
@@ -460,7 +465,35 @@ class Instruction {
   static const int ImmPCRelRangeBitwidth = 21;
   static bool IsValidPCRelOffset(ptrdiff_t offset) { return is_int21(offset); }
   void SetPCRelImmTarget(const AssemblerOptions& options, Instruction* target);
-  V8_EXPORT_PRIVATE void SetBranchImmTarget(Instruction* target);
+
+  template <ImmBranchType branch_type>
+  void SetBranchImmTarget(Instruction* target) {
+    DCHECK(IsAligned(DistanceTo(target), kInstrSize));
+    DCHECK(IsValidImmPCOffset(branch_type, DistanceTo(target)));
+    int offset = static_cast<int>(DistanceTo(target) >> kInstrSizeLog2);
+    Instr branch_imm = 0;
+    uint32_t imm_mask = 0;
+    switch (branch_type) {
+      case CondBranchType:
+      case CompareBranchType:
+        static_assert(ImmCondBranch_mask == ImmCmpBranch_mask);
+        static_assert(ImmCondBranch_offset == ImmCmpBranch_offset);
+        branch_imm = truncate_to_int19(offset) << ImmCondBranch_offset;
+        imm_mask = ImmCondBranch_mask;
+        break;
+      case UncondBranchType:
+        branch_imm = truncate_to_int26(offset) << ImmUncondBranch_offset;
+        imm_mask = ImmUncondBranch_mask;
+        break;
+      case TestBranchType:
+        branch_imm = truncate_to_int14(offset) << ImmTestBranch_offset;
+        imm_mask = ImmTestBranch_mask;
+        break;
+      default:
+        UNREACHABLE();
+    }
+    SetInstructionBits(Mask(~imm_mask) | branch_imm);
+  }
 };
 
 // Simulator/Debugger debug instructions ---------------------------------------
@@ -475,6 +508,10 @@ const Instr kImmExceptionIsRedirectedCall = 0xca11;
 // should not be reachable, such as in data encoded inline in the instructions.
 const Instr kImmExceptionIsUnreachable = 0xdebf;
 
+// Indicate that the stack is being switched, so the simulator must update its
+// stack limit. The new stack limit is passed in x16.
+const Instr kImmExceptionIsSwitchStackLimit = 0x5915;
+
 // A pseudo 'printf' instruction. The arguments will be passed to the platform
 // printf method.
 const Instr kImmExceptionIsPrintf = 0xdeb1;
diff --git a/deps/v8/src/codegen/arm64/interface-descriptors-arm64-inl.h b/deps/v8/src/codegen/arm64/interface-descriptors-arm64-inl.h
index 78027177da518b..129778faee0911 100644
--- a/deps/v8/src/codegen/arm64/interface-descriptors-arm64-inl.h
+++ b/deps/v8/src/codegen/arm64/interface-descriptors-arm64-inl.h
@@ -20,6 +20,23 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  auto registers = DoubleRegisterArray(d0, d1, d2, d3, d4, d5, d6);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Padding to have as many double return registers as GP return registers.
+  auto registers = DoubleRegisterArray(kFPReturnRegister0, no_dreg, no_dreg);
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -127,6 +144,17 @@ constexpr Register BaselineLeaveFrameDescriptor::WeightRegister() { return x4; }
 // static
 constexpr Register TypeConversionDescriptor::ArgumentRegister() { return x0; }
 
+// static
+constexpr Register
+MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor::FlagsRegister() {
+  return x8;
+}
+// static
+constexpr Register MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor::
+    FeedbackVectorRegister() {
+  return x9;
+}
+
 // static
 constexpr auto TypeofDescriptor::registers() { return RegisterArray(x0); }
 
@@ -276,11 +304,36 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  return RegisterArray(x1,   // kApiFunctionAddress
-                       x2,   // kArgc
-                       x3,   // kCallData
-                       x0);  // kHolder
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return x1;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return x2;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return x3;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return x0;
+}
+
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return x2;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return x3;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return x0;
 }
 
 // static
@@ -318,6 +371,11 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray(x0, x1);
 }
 
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(x8);
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/arm64/macro-assembler-arm64-inl.h b/deps/v8/src/codegen/arm64/macro-assembler-arm64-inl.h
index 9694fa77e01dd2..0eda579b9d12fb 100644
--- a/deps/v8/src/codegen/arm64/macro-assembler-arm64-inl.h
+++ b/deps/v8/src/codegen/arm64/macro-assembler-arm64-inl.h
@@ -21,6 +21,21 @@ MemOperand FieldMemOperand(Register object, int offset) {
   return MemOperand(object, offset - kHeapObjectTag);
 }
 
+// Provides access to exit frame parameters (GC-ed).
+MemOperand ExitFrameStackSlotOperand(int offset) {
+  // The slot at [sp] is reserved in all ExitFrames for storing the return
+  // address before doing the actual call, it's necessary for frame iteration
+  // (see StoreReturnAddressAndCall for details).
+  static constexpr int kSPOffset = 1 * kSystemPointerSize;
+  return MemOperand(sp, kSPOffset + offset);
+}
+
+// Provides access to exit frame parameters (GC-ed).
+MemOperand ExitFrameCallerStackSlotOperand(int index) {
+  return MemOperand(fp, (ExitFrameConstants::kFixedSlotCountAboveFp + index) *
+                            kSystemPointerSize);
+}
+
 void MacroAssembler::And(const Register& rd, const Register& rn,
                          const Operand& operand) {
   DCHECK(allow_macro_instructions());
@@ -114,12 +129,23 @@ void MacroAssembler::Ccmn(const Register& rn, const Operand& operand,
 void MacroAssembler::Add(const Register& rd, const Register& rn,
                          const Operand& operand) {
   DCHECK(allow_macro_instructions());
-  if (operand.IsImmediate() && (operand.ImmediateValue() < 0) &&
-      IsImmAddSub(-operand.ImmediateValue())) {
-    AddSubMacro(rd, rn, -operand.ImmediateValue(), LeaveFlags, SUB);
-  } else {
-    AddSubMacro(rd, rn, operand, LeaveFlags, ADD);
+  if (operand.IsImmediate()) {
+    int64_t imm = operand.ImmediateValue();
+    if ((imm > 0) && IsImmAddSub(imm)) {
+      DataProcImmediate(rd, rn, static_cast<int>(imm), ADD);
+      return;
+    } else if ((imm < 0) && IsImmAddSub(-imm)) {
+      DataProcImmediate(rd, rn, static_cast<int>(-imm), SUB);
+      return;
+    }
+  } else if (operand.IsShiftedRegister() && (operand.shift_amount() == 0)) {
+    if (!rd.IsSP() && !rn.IsSP() && !operand.reg().IsSP() &&
+        !operand.reg().IsZero()) {
+      DataProcPlainRegister(rd, rn, operand.reg(), ADD);
+      return;
+    }
   }
+  AddSubMacro(rd, rn, operand, LeaveFlags, ADD);
 }
 
 void MacroAssembler::Adds(const Register& rd, const Register& rn,
@@ -136,12 +162,23 @@ void MacroAssembler::Adds(const Register& rd, const Register& rn,
 void MacroAssembler::Sub(const Register& rd, const Register& rn,
                          const Operand& operand) {
   DCHECK(allow_macro_instructions());
-  if (operand.IsImmediate() && (operand.ImmediateValue() < 0) &&
-      IsImmAddSub(-operand.ImmediateValue())) {
-    AddSubMacro(rd, rn, -operand.ImmediateValue(), LeaveFlags, ADD);
-  } else {
-    AddSubMacro(rd, rn, operand, LeaveFlags, SUB);
+  if (operand.IsImmediate()) {
+    int64_t imm = operand.ImmediateValue();
+    if ((imm > 0) && IsImmAddSub(imm)) {
+      DataProcImmediate(rd, rn, static_cast<int>(imm), SUB);
+      return;
+    } else if ((imm < 0) && IsImmAddSub(-imm)) {
+      DataProcImmediate(rd, rn, static_cast<int>(-imm), ADD);
+      return;
+    }
+  } else if (operand.IsShiftedRegister() && (operand.shift_amount() == 0)) {
+    if (!rd.IsSP() && !rn.IsSP() && !operand.reg().IsSP() &&
+        !operand.reg().IsZero()) {
+      DataProcPlainRegister(rd, rn, operand.reg(), SUB);
+      return;
+    }
   }
+  AddSubMacro(rd, rn, operand, LeaveFlags, SUB);
 }
 
 void MacroAssembler::Subs(const Register& rd, const Register& rn,
@@ -162,6 +199,12 @@ void MacroAssembler::Cmn(const Register& rn, const Operand& operand) {
 
 void MacroAssembler::Cmp(const Register& rn, const Operand& operand) {
   DCHECK(allow_macro_instructions());
+  if (operand.IsShiftedRegister() && operand.shift_amount() == 0) {
+    if (!rn.IsSP() && !operand.reg().IsSP()) {
+      CmpPlainRegister(rn, operand.reg());
+      return;
+    }
+  }
   Subs(AppropriateZeroRegFor(rn), rn, operand);
 }
 
@@ -723,6 +766,12 @@ void MacroAssembler::Fmov(VRegister fd, Register rn) {
 
 void MacroAssembler::Fmov(VRegister vd, double imm) {
   DCHECK(allow_macro_instructions());
+  uint64_t bits = base::bit_cast<uint64_t>(imm);
+
+  if (bits == 0) {
+    Movi(vd.D(), 0);
+    return;
+  }
 
   if (vd.Is1S() || vd.Is2S() || vd.Is4S()) {
     Fmov(vd, static_cast<float>(imm));
@@ -730,49 +779,37 @@ void MacroAssembler::Fmov(VRegister vd, double imm) {
   }
 
   DCHECK(vd.Is1D() || vd.Is2D());
-  if (IsImmFP64(imm)) {
+  if (IsImmFP64(bits)) {
     fmov(vd, imm);
   } else {
-    uint64_t bits = base::bit_cast<uint64_t>(imm);
-    if (vd.IsScalar()) {
-      if (bits == 0) {
-        fmov(vd, xzr);
-      } else {
-        UseScratchRegisterScope temps(this);
-        Register tmp = temps.AcquireX();
-        Mov(tmp, bits);
-        fmov(vd, tmp);
-      }
-    } else {
-      Movi(vd, bits);
-    }
+    Movi64bitHelper(vd, bits);
   }
 }
 
 void MacroAssembler::Fmov(VRegister vd, float imm) {
   DCHECK(allow_macro_instructions());
+  uint32_t bits = base::bit_cast<uint32_t>(imm);
+
+  if (bits == 0) {
+    Movi(vd.D(), 0);
+    return;
+  }
+
   if (vd.Is1D() || vd.Is2D()) {
     Fmov(vd, static_cast<double>(imm));
     return;
   }
 
   DCHECK(vd.Is1S() || vd.Is2S() || vd.Is4S());
-  if (IsImmFP32(imm)) {
+  if (IsImmFP32(bits)) {
     fmov(vd, imm);
+  } else if (vd.IsScalar()) {
+    UseScratchRegisterScope temps(this);
+    Register tmp = temps.AcquireW();
+    Mov(tmp, bits);
+    Fmov(vd, tmp);
   } else {
-    uint32_t bits = base::bit_cast<uint32_t>(imm);
-    if (vd.IsScalar()) {
-      if (bits == 0) {
-        fmov(vd, wzr);
-      } else {
-        UseScratchRegisterScope temps(this);
-        Register tmp = temps.AcquireW();
-        Mov(tmp, bits);
-        Fmov(vd, tmp);
-      }
-    } else {
-      Movi(vd, bits);
-    }
+    Movi(vd, bits);
   }
 }
 
@@ -1434,17 +1471,28 @@ void MacroAssembler::PushArgument(const Register& arg) { Push(padreg, arg); }
 
 void MacroAssembler::CompareAndBranch(const Register& lhs, const Operand& rhs,
                                       Condition cond, Label* label) {
-  if (rhs.IsImmediate() && (rhs.ImmediateValue() == 0) &&
-      ((cond == eq) || (cond == ne) || (cond == hi) || (cond == ls))) {
-    if ((cond == eq) || (cond == ls)) {
-      Cbz(lhs, label);
-    } else {
-      Cbnz(lhs, label);
+  if (rhs.IsImmediate() && (rhs.ImmediateValue() == 0)) {
+    switch (cond) {
+      case eq:
+      case ls:
+        Cbz(lhs, label);
+        return;
+      case lt:
+        Tbnz(lhs, lhs.SizeInBits() - 1, label);
+        return;
+      case ge:
+        Tbz(lhs, lhs.SizeInBits() - 1, label);
+        return;
+      case ne:
+      case hi:
+        Cbnz(lhs, label);
+        return;
+      default:
+        break;
     }
-  } else {
-    Cmp(lhs, rhs);
-    B(cond, label);
   }
+  Cmp(lhs, rhs);
+  B(cond, label);
 }
 
 void MacroAssembler::CompareTaggedAndBranch(const Register& lhs,
@@ -1483,10 +1531,6 @@ void MacroAssembler::TestAndBranchIfAllClear(const Register& reg,
   }
 }
 
-void MacroAssembler::MoveHeapNumber(Register dst, double value) {
-  Mov(dst, Operand::EmbeddedHeapNumber(value));
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/arm64/macro-assembler-arm64.cc b/deps/v8/src/codegen/arm64/macro-assembler-arm64.cc
index 2e54ce8bd19188..2adc936f63c08e 100644
--- a/deps/v8/src/codegen/arm64/macro-assembler-arm64.cc
+++ b/deps/v8/src/codegen/arm64/macro-assembler-arm64.cc
@@ -217,9 +217,6 @@ void MacroAssembler::LogicalMacro(const Register& rd, const Register& rn,
 
     // Ignore the top 32 bits of an immediate if we're moving to a W register.
     if (rd.Is32Bits()) {
-      // Check that the top 32 bits are consistent.
-      DCHECK(((immediate >> kWRegSizeInBits) == 0) ||
-             ((immediate >> kWRegSizeInBits) == -1));
       immediate &= kWRegMask;
     }
 
@@ -447,7 +444,7 @@ void MacroAssembler::Mov(const Register& rd, const Operand& operand,
   }
 }
 
-void MacroAssembler::Mov(const Register& rd, Smi smi) {
+void MacroAssembler::Mov(const Register& rd, Tagged<Smi> smi) {
   return Mov(rd, Operand(smi));
 }
 
@@ -579,7 +576,7 @@ void MacroAssembler::Movi64bitHelper(const VRegister& vd, uint64_t imm) {
     Register temp = temps.AcquireX();
     Mov(temp, imm);
     if (vd.Is1D()) {
-      mov(vd.D(), 0, temp);
+      fmov(vd.D(), temp);
     } else {
       dup(vd.V2D(), temp);
     }
@@ -610,8 +607,14 @@ void MacroAssembler::Movi(const VRegister& vd, uint64_t imm, Shift shift,
 void MacroAssembler::Movi(const VRegister& vd, uint64_t hi, uint64_t lo) {
   // TODO(v8:11033): Move 128-bit values in a more efficient way.
   DCHECK(vd.Is128Bits());
-  Movi(vd.V2D(), lo);
-  if (lo != hi) {
+  if (hi == lo) {
+    Movi(vd.V2D(), lo);
+    return;
+  }
+
+  Movi(vd.V1D(), lo);
+
+  if (hi != 0) {
     UseScratchRegisterScope temps(this);
     Register temp = temps.AcquireX();
     Mov(temp, hi);
@@ -904,31 +907,56 @@ void MacroAssembler::AddSubWithCarryMacro(const Register& rd,
 
 void MacroAssembler::LoadStoreMacro(const CPURegister& rt,
                                     const MemOperand& addr, LoadStoreOp op) {
+  // Call the most common addressing modes used by Liftoff directly for improved
+  // compilation performance: X register + immediate, X register + W register.
+  Instr memop = op | Rt(rt) | RnSP(addr.base());
+  if (addr.IsImmediateOffset()) {
+    int64_t offset = addr.offset();
+    unsigned size_log2 = CalcLSDataSizeLog2(op);
+    if (IsImmLSScaled(offset, size_log2)) {
+      LoadStoreScaledImmOffset(memop, static_cast<int>(offset), size_log2);
+      return;
+    } else if (IsImmLSUnscaled(offset)) {
+      LoadStoreUnscaledImmOffset(memop, static_cast<int>(offset));
+      return;
+    }
+  } else if (addr.IsRegisterOffset() && (addr.extend() == UXTW) &&
+             (addr.shift_amount() == 0)) {
+    LoadStoreWRegOffset(memop, addr.regoffset());
+    return;
+  }
+
+  // Remaining complex cases handled in sub-function.
+  LoadStoreMacroComplex(rt, addr, op);
+}
+
+void MacroAssembler::LoadStoreMacroComplex(const CPURegister& rt,
+                                           const MemOperand& addr,
+                                           LoadStoreOp op) {
   int64_t offset = addr.offset();
-  unsigned size = CalcLSDataSize(op);
-
-  // Check if an immediate offset fits in the immediate field of the
-  // appropriate instruction. If not, emit two instructions to perform
-  // the operation.
-  if (addr.IsImmediateOffset() && !IsImmLSScaled(offset, size) &&
-      !IsImmLSUnscaled(offset)) {
-    // Immediate offset that can't be encoded using unsigned or unscaled
-    // addressing modes.
+  bool is_imm_unscaled = IsImmLSUnscaled(offset);
+  if (addr.IsRegisterOffset() ||
+      (is_imm_unscaled && (addr.IsPostIndex() || addr.IsPreIndex()))) {
+    // Load/store encodable in one instruction.
+    LoadStore(rt, addr, op);
+  } else if (addr.IsImmediateOffset()) {
+    // Load/stores with immediate offset addressing should have been handled by
+    // the caller.
+    DCHECK(!IsImmLSScaled(offset, CalcLSDataSizeLog2(op)) && !is_imm_unscaled);
     UseScratchRegisterScope temps(this);
     Register temp = temps.AcquireSameSizeAs(addr.base());
-    Mov(temp, addr.offset());
+    Mov(temp, offset);
     LoadStore(rt, MemOperand(addr.base(), temp), op);
-  } else if (addr.IsPostIndex() && !IsImmLSUnscaled(offset)) {
+  } else if (addr.IsPostIndex()) {
     // Post-index beyond unscaled addressing range.
+    DCHECK(!is_imm_unscaled);
     LoadStore(rt, MemOperand(addr.base()), op);
     add(addr.base(), addr.base(), offset);
-  } else if (addr.IsPreIndex() && !IsImmLSUnscaled(offset)) {
+  } else {
     // Pre-index beyond unscaled addressing range.
+    DCHECK(!is_imm_unscaled && addr.IsPreIndex());
     add(addr.base(), addr.base(), offset);
     LoadStore(rt, MemOperand(addr.base()), op);
-  } else {
-    // Encodable in one load/store instruction.
-    LoadStore(rt, addr, op);
   }
 }
 
@@ -936,8 +964,14 @@ void MacroAssembler::LoadStorePairMacro(const CPURegister& rt,
                                         const CPURegister& rt2,
                                         const MemOperand& addr,
                                         LoadStorePairOp op) {
-  // TODO(all): Should we support register offset for load-store-pair?
-  DCHECK(!addr.IsRegisterOffset());
+  if (addr.IsRegisterOffset()) {
+    UseScratchRegisterScope temps(this);
+    Register base = addr.base();
+    Register temp = temps.AcquireSameSizeAs(base);
+    Add(temp, base, addr.regoffset());
+    LoadStorePair(rt, rt2, MemOperand(temp), op);
+    return;
+  }
 
   int64_t offset = addr.offset();
   unsigned size = CalcLSPairDataSize(op);
@@ -965,29 +999,6 @@ void MacroAssembler::LoadStorePairMacro(const CPURegister& rt,
   }
 }
 
-bool MacroAssembler::NeedExtraInstructionsOrRegisterBranch(
-    Label* label, ImmBranchType b_type) {
-  bool need_longer_range = false;
-  // There are two situations in which we care about the offset being out of
-  // range:
-  //  - The label is bound but too far away.
-  //  - The label is not bound but linked, and the previous branch
-  //    instruction in the chain is too far away.
-  if (label->is_bound() || label->is_linked()) {
-    need_longer_range =
-        !Instruction::IsValidImmPCOffset(b_type, label->pos() - pc_offset());
-  }
-  if (!need_longer_range && !label->is_bound()) {
-    int max_reachable_pc = pc_offset() + Instruction::ImmBranchRange(b_type);
-    unresolved_branches_.insert(std::pair<int, FarBranchInfo>(
-        max_reachable_pc, FarBranchInfo(pc_offset(), label)));
-    // Also maintain the next pool check.
-    next_veneer_pool_check_ = std::min(
-        next_veneer_pool_check_, max_reachable_pc - kVeneerDistanceCheckMargin);
-  }
-  return need_longer_range;
-}
-
 void MacroAssembler::Adr(const Register& rd, Label* label, AdrHint hint) {
   DCHECK(allow_macro_instructions());
   DCHECK(!rd.IsZero());
@@ -1058,7 +1069,7 @@ void MacroAssembler::B(Label* label, Condition cond) {
 
   Label done;
   bool need_extra_instructions =
-      NeedExtraInstructionsOrRegisterBranch(label, CondBranchType);
+      NeedExtraInstructionsOrRegisterBranch<CondBranchType>(label);
 
   if (need_extra_instructions) {
     b(&done, NegateCondition(cond));
@@ -1074,7 +1085,7 @@ void MacroAssembler::Tbnz(const Register& rt, unsigned bit_pos, Label* label) {
 
   Label done;
   bool need_extra_instructions =
-      NeedExtraInstructionsOrRegisterBranch(label, TestBranchType);
+      NeedExtraInstructionsOrRegisterBranch<TestBranchType>(label);
 
   if (need_extra_instructions) {
     tbz(rt, bit_pos, &done);
@@ -1090,7 +1101,7 @@ void MacroAssembler::Tbz(const Register& rt, unsigned bit_pos, Label* label) {
 
   Label done;
   bool need_extra_instructions =
-      NeedExtraInstructionsOrRegisterBranch(label, TestBranchType);
+      NeedExtraInstructionsOrRegisterBranch<TestBranchType>(label);
 
   if (need_extra_instructions) {
     tbnz(rt, bit_pos, &done);
@@ -1106,7 +1117,7 @@ void MacroAssembler::Cbnz(const Register& rt, Label* label) {
 
   Label done;
   bool need_extra_instructions =
-      NeedExtraInstructionsOrRegisterBranch(label, CompareBranchType);
+      NeedExtraInstructionsOrRegisterBranch<CompareBranchType>(label);
 
   if (need_extra_instructions) {
     cbz(rt, &done);
@@ -1122,7 +1133,7 @@ void MacroAssembler::Cbz(const Register& rt, Label* label) {
 
   Label done;
   bool need_extra_instructions =
-      NeedExtraInstructionsOrRegisterBranch(label, CompareBranchType);
+      NeedExtraInstructionsOrRegisterBranch<CompareBranchType>(label);
 
   if (need_extra_instructions) {
     cbnz(rt, &done);
@@ -1450,11 +1461,11 @@ void MacroAssembler::ReplaceClosureCodeWithOptimizedCode(
   DCHECK(!AreAliased(optimized_code, closure));
   // Store code entry in the closure.
   AssertCode(optimized_code);
-  StoreTaggedField(optimized_code,
-                   FieldMemOperand(closure, JSFunction::kCodeOffset));
+  StoreMaybeIndirectPointerField(
+      optimized_code, FieldMemOperand(closure, JSFunction::kCodeOffset));
   RecordWriteField(closure, JSFunction::kCodeOffset, optimized_code,
-                   kLRHasNotBeenSaved, SaveFPRegsMode::kIgnore,
-                   SmiCheck::kOmit);
+                   kLRHasNotBeenSaved, SaveFPRegsMode::kIgnore, SmiCheck::kOmit,
+                   kCodePointerType);
 }
 
 void MacroAssembler::GenerateTailCallToReturnedCode(
@@ -1490,9 +1501,8 @@ void MacroAssembler::GenerateTailCallToReturnedCode(
 
 // Read off the flags in the feedback vector and check if there
 // is optimized code or a tiering state that needs to be processed.
-void MacroAssembler::LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-    Register flags, Register feedback_vector, CodeKind current_code_kind,
-    Label* flags_need_processing) {
+Condition MacroAssembler::LoadFeedbackVectorFlagsAndCheckIfNeedsProcessing(
+    Register flags, Register feedback_vector, CodeKind current_code_kind) {
   ASM_CODE_COMMENT(this);
   DCHECK(!AreAliased(flags, feedback_vector));
   DCHECK(CodeKindCanTierUp(current_code_kind));
@@ -1503,7 +1513,17 @@ void MacroAssembler::LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
   if (current_code_kind != CodeKind::MAGLEV) {
     kFlagsMask |= FeedbackVector::kFlagsMaybeHasMaglevCode;
   }
-  TestAndBranchIfAnySet(flags, kFlagsMask, flags_need_processing);
+  Tst(flags, kFlagsMask);
+  return ne;
+}
+
+void MacroAssembler::LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
+    Register flags, Register feedback_vector, CodeKind current_code_kind,
+    Label* flags_need_processing) {
+  ASM_CODE_COMMENT(this);
+  B(LoadFeedbackVectorFlagsAndCheckIfNeedsProcessing(flags, feedback_vector,
+                                                     current_code_kind),
+    flags_need_processing);
 }
 
 void MacroAssembler::OptimizeCodeOrTailCallOptimizedCodeSlot(
@@ -1674,6 +1694,20 @@ void MacroAssembler::AssertBoundFunction(Register object) {
   Check(eq, AbortReason::kOperandIsNotABoundFunction);
 }
 
+void MacroAssembler::AssertSmiOrHeapObjectInCompressionCage(Register object) {
+  DCHECK(PointerCompressionIsEnabled());
+  if (!v8_flags.debug_code) return;
+  ASM_CODE_COMMENT(this);
+  Label is_smi;
+  B(&is_smi, CheckSmi(object));
+  UseScratchRegisterScope temps(this);
+  Register temp = temps.AcquireX();
+  sub(temp, object, kPtrComprCageBaseRegister);
+  Cmp(temp, Immediate(UINT32_MAX));
+  Check(lo, AbortReason::kObjectNotTagged);
+  bind(&is_smi);
+}
+
 void MacroAssembler::AssertGeneratorObject(Register object) {
   if (!v8_flags.debug_code) return;
   ASM_CODE_COMMENT(this);
@@ -1715,6 +1749,46 @@ void MacroAssembler::AssertPositiveOrZero(Register value) {
   Bind(&done);
 }
 
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 Register tmp, AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp, tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok);
+
+  LoadMap(map_tmp, object);
+  CompareInstanceType(map_tmp, tmp, LAST_NAME_TYPE);
+  B(kUnsignedLessThanEqual, &ok);
+
+  CompareInstanceType(map_tmp, tmp, FIRST_JS_RECEIVER_TYPE);
+  B(kUnsignedGreaterThanEqual, &ok);
+
+  CompareRoot(map_tmp, RootIndex::kHeapNumberMap);
+  B(kEqual, &ok);
+
+  CompareRoot(map_tmp, RootIndex::kBigIntMap);
+  B(kEqual, &ok);
+
+  CompareRoot(object, RootIndex::kUndefinedValue);
+  B(kEqual, &ok);
+
+  CompareRoot(object, RootIndex::kTrueValue);
+  B(kEqual, &ok);
+
+  CompareRoot(object, RootIndex::kFalseValue);
+  B(kEqual, &ok);
+
+  CompareRoot(object, RootIndex::kNullValue);
+  B(kEqual, &ok);
+
+  Abort(abort_reason);
+
+  bind(&ok);
+}
+
 void MacroAssembler::Assert(Condition cond, AbortReason reason) {
   if (v8_flags.debug_code) {
     Check(cond, reason);
@@ -1864,7 +1938,7 @@ void MacroAssembler::PushRoot(RootIndex index) {
   Push(tmp);
 }
 
-void MacroAssembler::Move(Register dst, Smi src) { Mov(dst, src); }
+void MacroAssembler::Move(Register dst, Tagged<Smi> src) { Mov(dst, src); }
 void MacroAssembler::Move(Register dst, MemOperand src) { Ldr(dst, src); }
 void MacroAssembler::Move(Register dst, Register src) {
   if (dst == src) return;
@@ -1929,7 +2003,10 @@ void MacroAssembler::CallRuntime(const Runtime::Function* f,
   Mov(x0, num_arguments);
   Mov(x1, ExternalReference::Create(f));
 
-  Handle<Code> code = CodeFactory::CEntry(isolate(), f->result_size);
+  bool switch_to_central =
+      Runtime::SwitchToTheCentralStackForTarget(f->function_id);
+  Handle<Code> code = CodeFactory::CEntry(
+      isolate(), f->result_size, ArgvMode::kStack, false, switch_to_central);
   Call(code, RelocInfo::CODE_TARGET);
 }
 
@@ -2146,7 +2223,8 @@ void MacroAssembler::JumpHelper(int64_t offset, RelocInfo::Mode rmode,
 // * the offset of the target from the current PC, in instructions, for any
 //   other type of call.
 int64_t MacroAssembler::CalculateTargetOffset(Address target,
-                                              RelocInfo::Mode rmode, byte* pc) {
+                                              RelocInfo::Mode rmode,
+                                              uint8_t* pc) {
   int64_t offset = static_cast<int64_t>(target);
   if (rmode == RelocInfo::WASM_CALL || rmode == RelocInfo::WASM_STUB_CALL) {
     // The target of WebAssembly calls is still an index instead of an actual
@@ -2238,26 +2316,24 @@ void MacroAssembler::Call(ExternalReference target) {
   Call(temp);
 }
 
-void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
+void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index,
+                                               Register target) {
   ASM_CODE_COMMENT(this);
   // The builtin_index register contains the builtin index as a Smi.
-  // Untagging is folded into the indexing operand below.
   if (SmiValuesAre32Bits()) {
-    Asr(builtin_index, builtin_index, kSmiShift - kSystemPointerSizeLog2);
-    Add(builtin_index, builtin_index,
-        IsolateData::builtin_entry_table_offset());
-    Ldr(builtin_index, MemOperand(kRootRegister, builtin_index));
+    Asr(target, builtin_index, kSmiShift - kSystemPointerSizeLog2);
+    Add(target, target, IsolateData::builtin_entry_table_offset());
+    Ldr(target, MemOperand(kRootRegister, target));
   } else {
     DCHECK(SmiValuesAre31Bits());
     if (COMPRESS_POINTERS_BOOL) {
-      Add(builtin_index, kRootRegister,
+      Add(target, kRootRegister,
           Operand(builtin_index.W(), SXTW, kSystemPointerSizeLog2 - kSmiShift));
     } else {
-      Add(builtin_index, kRootRegister,
+      Add(target, kRootRegister,
           Operand(builtin_index, LSL, kSystemPointerSizeLog2 - kSmiShift));
     }
-    Ldr(builtin_index,
-        MemOperand(builtin_index, IsolateData::builtin_entry_table_offset()));
+    Ldr(target, MemOperand(target, IsolateData::builtin_entry_table_offset()));
   }
 }
 
@@ -2273,10 +2349,11 @@ MemOperand MacroAssembler::EntryFromBuiltinAsOperand(Builtin builtin) {
                     IsolateData::BuiltinEntrySlotOffset(builtin));
 }
 
-void MacroAssembler::CallBuiltinByIndex(Register builtin_index) {
+void MacroAssembler::CallBuiltinByIndex(Register builtin_index,
+                                        Register target) {
   ASM_CODE_COMMENT(this);
-  LoadEntryFromBuiltinIndex(builtin_index);
-  Call(builtin_index);
+  LoadEntryFromBuiltinIndex(builtin_index, target);
+  Call(target);
 }
 
 void MacroAssembler::CallBuiltin(Builtin builtin) {
@@ -2367,29 +2444,71 @@ void MacroAssembler::TailCallBuiltin(Builtin builtin, Condition cond) {
   }
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination, Register code_object) {
+void MacroAssembler::LoadCodeInstructionStart(Register destination,
+                                              Register code_object) {
   ASM_CODE_COMMENT(this);
-  Ldr(destination, FieldMemOperand(code_object, Code::kCodeEntryPointOffset));
+  LoadCodeEntrypointField(
+      destination, FieldMemOperand(code_object, Code::kInstructionStartOffset));
 }
 
 void MacroAssembler::CallCodeObject(Register code_object) {
   ASM_CODE_COMMENT(this);
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   Call(code_object);
 }
 
 void MacroAssembler::JumpCodeObject(Register code_object, JumpMode jump_mode) {
   ASM_CODE_COMMENT(this);
   DCHECK_EQ(JumpMode::kJump, jump_mode);
-  LoadCodeEntry(code_object, code_object);
-  UseScratchRegisterScope temps(this);
+  LoadCodeInstructionStart(code_object, code_object);
+  // We jump through x17 here because for Branch Identification (BTI) we use
+  // "Call" (`bti c`) rather than "Jump" (`bti j`) landing pads for tail-called
+  // code. See TailCallBuiltin for more information.
   if (code_object != x17) {
-    temps.Exclude(x17);
     Mov(x17, code_object);
   }
   Jump(x17);
 }
 
+void MacroAssembler::CallJSFunction(Register function_object) {
+  Register code = kJavaScriptCallCodeStartRegister;
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // When the sandbox is enabled, we can directly fetch the entrypoint pointer
+  // from the code pointer table instead of going through the Code object. In
+  // this way, we avoid one memory load on this code path.
+  LoadCodeEntrypointField(
+      code, FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  Call(code);
+#else
+  LoadTaggedField(code,
+                  FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  CallCodeObject(code);
+#endif
+}
+
+void MacroAssembler::JumpJSFunction(Register function_object,
+                                    JumpMode jump_mode) {
+  Register code = kJavaScriptCallCodeStartRegister;
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // When the sandbox is enabled, we can directly fetch the entrypoint pointer
+  // from the code pointer table instead of going through the Code object. In
+  // this way, we avoid one memory load on this code path.
+  LoadCodeEntrypointField(
+      code, FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  DCHECK_EQ(jump_mode, JumpMode::kJump);
+  // We jump through x17 here because for Branch Identification (BTI) we use
+  // "Call" (`bti c`) rather than "Jump" (`bti j`) landing pads for tail-called
+  // code. See TailCallBuiltin for more information.
+  DCHECK_NE(code, x17);
+  Mov(x17, code);
+  Jump(x17);
+#else
+  LoadTaggedField(code,
+                  FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  JumpCodeObject(code, jump_mode);
+#endif
+}
+
 void MacroAssembler::StoreReturnAddressAndCall(Register target) {
   ASM_CODE_COMMENT(this);
   // This generates the final instruction sequence for calls to C functions
@@ -2401,6 +2520,7 @@ void MacroAssembler::StoreReturnAddressAndCall(Register target) {
 
   UseScratchRegisterScope temps(this);
   temps.Exclude(x16, x17);
+  DCHECK(!AreAliased(x16, x17, target));
 
   Label return_location;
   Adr(x17, &return_location);
@@ -2408,7 +2528,7 @@ void MacroAssembler::StoreReturnAddressAndCall(Register target) {
   Add(x16, sp, kSystemPointerSize);
   Pacib1716();
 #endif
-  Poke(x17, 0);
+  Str(x17, MemOperand(sp));
 
   if (v8_flags.debug_code) {
     ASM_CODE_COMMENT_STRING(this, "Verify fp[kSPOffset]-8");
@@ -2449,7 +2569,7 @@ void MacroAssembler::BailoutIfDeoptimized() {
   int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
   LoadTaggedField(scratch,
                   MemOperand(kJavaScriptCallCodeStartRegister, offset));
-  Ldr(scratch.W(), FieldMemOperand(scratch, Code::kKindSpecificFlagsOffset));
+  Ldr(scratch.W(), FieldMemOperand(scratch, Code::kFlagsOffset));
   Label not_deoptimized;
   Tbz(scratch.W(), Code::kMarkedForDeoptimizationBit, &not_deoptimized);
   Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
@@ -2607,7 +2727,7 @@ void MacroAssembler::CallDebugOnFunctionCall(Register fun, Register new_target,
                                              Register actual_parameter_count) {
   ASM_CODE_COMMENT(this);
   // Load receiver to pass it later to DebugOnFunctionCall hook.
-  Peek(x4, ReceiverOperand(actual_parameter_count));
+  Peek(x4, ReceiverOperand());
   FrameScope frame(
       this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
 
@@ -2659,14 +2779,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // We call indirectly through the code field in the function to
   // allow recompilation to take effect without changing any of the
   // call sites.
-  Register code = kJavaScriptCallCodeStartRegister;
-  LoadTaggedField(code, FieldMemOperand(function, JSFunction::kCodeOffset));
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(code);
+      CallJSFunction(function);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(code);
+      JumpJSFunction(function);
       break;
   }
   B(&done);
@@ -2684,19 +2802,23 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
 
 void MacroAssembler::JumpIfCodeIsMarkedForDeoptimization(
     Register code, Register scratch, Label* if_marked_for_deoptimization) {
-  Ldr(scratch.W(), FieldMemOperand(code, Code::kKindSpecificFlagsOffset));
+  Ldr(scratch.W(), FieldMemOperand(code, Code::kFlagsOffset));
   Tbnz(scratch.W(), Code::kMarkedForDeoptimizationBit,
        if_marked_for_deoptimization);
 }
 
+void MacroAssembler::JumpIfCodeIsTurbofanned(Register code, Register scratch,
+                                             Label* if_turbofanned) {
+  Ldr(scratch.W(), FieldMemOperand(code, Code::kFlagsOffset));
+  Tbnz(scratch.W(), Code::kIsTurbofannedBit, if_turbofanned);
+}
+
 Operand MacroAssembler::ClearedValue() const {
   return Operand(
       static_cast<int32_t>(HeapObjectReference::ClearedValue(isolate()).ptr()));
 }
 
-Operand MacroAssembler::ReceiverOperand(Register arg_count) {
-  return Operand(0);
-}
+Operand MacroAssembler::ReceiverOperand() { return Operand(0); }
 
 void MacroAssembler::InvokeFunctionWithNewTarget(
     Register function, Register new_target, Register actual_parameter_count,
@@ -2843,7 +2965,7 @@ void MacroAssembler::EnterFrame(StackFrame::Type type) {
       Register type_reg = temps.AcquireX();
       Mov(type_reg, StackFrame::TypeToMarker(type));
       Register fourth_reg = no_reg;
-      if (type == StackFrame::CONSTRUCT) {
+      if (type == StackFrame::CONSTRUCT || type == StackFrame::FAST_CONSTRUCT) {
         fourth_reg = cp;
 #if V8_ENABLE_WEBASSEMBLY
       } else if (type == StackFrame::WASM ||
@@ -2876,7 +2998,8 @@ void MacroAssembler::EnterExitFrame(const Register& scratch, int extra_space,
                                     StackFrame::Type frame_type) {
   ASM_CODE_COMMENT(this);
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
 
   // Set up the new stack frame.
   Push<MacroAssembler::kSignLR>(lr, fp);
@@ -3289,7 +3412,7 @@ void MacroAssembler::RecordWriteField(Register object, int offset,
                                       Register value,
                                       LinkRegisterStatus lr_status,
                                       SaveFPRegsMode save_fp,
-                                      SmiCheck smi_check) {
+                                      SmiCheck smi_check, PointerType type) {
   ASM_CODE_COMMENT(this);
   DCHECK(!AreAliased(object, value));
   // First, check if a write barrier is even needed. The tests below
@@ -3319,12 +3442,12 @@ void MacroAssembler::RecordWriteField(Register object, int offset,
   }
 
   RecordWrite(object, Operand(offset - kHeapObjectTag), value, lr_status,
-              save_fp, SmiCheck::kOmit);
+              save_fp, SmiCheck::kOmit, type);
 
   Bind(&done);
 }
 
-void MacroAssembler::DecodeSandboxedPointer(const Register& value) {
+void MacroAssembler::DecodeSandboxedPointer(Register value) {
   ASM_CODE_COMMENT(this);
 #ifdef V8_ENABLE_SANDBOX
   Add(value, kPtrComprCageBaseRegister,
@@ -3334,8 +3457,8 @@ void MacroAssembler::DecodeSandboxedPointer(const Register& value) {
 #endif
 }
 
-void MacroAssembler::LoadSandboxedPointerField(
-    const Register& destination, const MemOperand& field_operand) {
+void MacroAssembler::LoadSandboxedPointerField(Register destination,
+                                               MemOperand field_operand) {
 #ifdef V8_ENABLE_SANDBOX
   ASM_CODE_COMMENT(this);
   Ldr(destination, field_operand);
@@ -3345,8 +3468,8 @@ void MacroAssembler::LoadSandboxedPointerField(
 #endif
 }
 
-void MacroAssembler::StoreSandboxedPointerField(
-    const Register& value, const MemOperand& dst_field_operand) {
+void MacroAssembler::StoreSandboxedPointerField(Register value,
+                                                MemOperand dst_field_operand) {
 #ifdef V8_ENABLE_SANDBOX
   ASM_CODE_COMMENT(this);
   UseScratchRegisterScope temps(this);
@@ -3374,23 +3497,82 @@ void MacroAssembler::LoadExternalPointerField(Register destination,
     DCHECK(root_array_available_);
     isolate_root = kRootRegister;
   }
-    Ldr(external_table,
-        MemOperand(isolate_root,
-                   IsolateData::external_pointer_table_offset() +
-                       Internals::kExternalPointerTableBufferOffset));
-    Ldr(destination.W(), field_operand);
-    // MemOperand doesn't support LSR currently (only LSL), so here we do the
-    // offset computation separately first.
-    static_assert(kExternalPointerIndexShift > kSystemPointerSizeLog2);
-    int shift_amount = kExternalPointerIndexShift - kSystemPointerSizeLog2;
-    Mov(destination, Operand(destination, LSR, shift_amount));
-    Ldr(destination, MemOperand(external_table, destination));
-    And(destination, destination, Immediate(~tag));
+  Ldr(external_table,
+      MemOperand(isolate_root,
+                 IsolateData::external_pointer_table_offset() +
+                     Internals::kExternalPointerTableBasePointerOffset));
+  Ldr(destination.W(), field_operand);
+  Mov(destination, Operand(destination, LSR, kExternalPointerIndexShift));
+  Ldr(destination, MemOperand(external_table, destination, LSL,
+                              kExternalPointerTableEntrySizeLog2));
+  // We need another scratch register for the 64-bit tag constant. Instead of
+  // forcing the `And` to allocate a new temp register (which we may not have),
+  // reuse the temp register that we used for the external pointer table base.
+  Register tag_reg = external_table;
+  Mov(tag_reg, Immediate(~tag));
+  And(destination, destination, tag_reg);
 #else
   Ldr(destination, field_operand);
 #endif  // V8_ENABLE_SANDBOX
 }
 
+void MacroAssembler::LoadIndirectPointerField(Register destination,
+                                              MemOperand field_operand) {
+  ASM_CODE_COMMENT(this);
+#ifdef V8_CODE_POINTER_SANDBOXING
+  UseScratchRegisterScope temps(this);
+  Register table = temps.AcquireX();
+  static_assert(kAllIndirectPointerObjectsAreCode);
+  Mov(table, ExternalReference::code_pointer_table_address());
+  Ldr(destination.W(), field_operand);
+  Mov(destination, Operand(destination, LSR, kCodePointerHandleShift));
+  Add(destination, table,
+      Operand(destination, LSL, kCodePointerTableEntrySizeLog2));
+  Ldr(destination,
+      MemOperand(destination,
+                 Immediate(kCodePointerTableEntryCodeObjectOffset)));
+  Orr(destination, destination, Immediate(kHeapObjectTag));
+#else
+  Ldr(destination, field_operand);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+void MacroAssembler::StoreIndirectPointerField(Register value,
+                                               MemOperand dst_field_operand) {
+  DCHECK(V8_CODE_POINTER_SANDBOXING_BOOL);
+  UseScratchRegisterScope temps(this);
+  Register scratch = temps.AcquireX();
+  static_assert(kAllIndirectPointerObjectsAreCode);
+  Ldr(scratch.W(), FieldMemOperand(value, Code::kCodePointerTableEntryOffset));
+  Str(scratch.W(), dst_field_operand);
+}
+
+void MacroAssembler::StoreMaybeIndirectPointerField(
+    Register value, MemOperand dst_field_operand) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  StoreIndirectPointerField(value, dst_field_operand);
+#else
+  StoreTaggedField(value, dst_field_operand);
+#endif
+}
+
+void MacroAssembler::LoadCodeEntrypointField(Register destination,
+                                             MemOperand field_operand) {
+  ASM_CODE_COMMENT(this);
+#ifdef V8_CODE_POINTER_SANDBOXING
+  UseScratchRegisterScope temps(this);
+  Register table = temps.AcquireX();
+  Mov(table, ExternalReference::code_pointer_table_address());
+  Ldr(destination.W(), field_operand);
+  // TODO(saelo): can the offset computation be done more efficiently?
+  Mov(destination, Operand(destination, LSR, kCodePointerHandleShift));
+  Mov(destination, Operand(destination, LSL, kCodePointerTableEntrySizeLog2));
+  Ldr(destination, MemOperand(table, destination));
+#else
+  Ldr(destination, field_operand);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
 void MacroAssembler::MaybeSaveRegisters(RegList registers) {
     if (registers.is_empty()) return;
     ASM_CODE_COMMENT(this);
@@ -3430,7 +3612,8 @@ void MacroAssembler::CallEphemeronKeyBarrier(Register object, Operand offset,
 void MacroAssembler::CallRecordWriteStubSaveRegisters(Register object,
                                                       Operand offset,
                                                       SaveFPRegsMode fp_mode,
-                                                      StubCallMode mode) {
+                                                      StubCallMode mode,
+                                                      PointerType type) {
     ASM_CODE_COMMENT(this);
     RegList registers = WriteBarrierDescriptor::ComputeSavedRegisters(object);
     MaybeSaveRegisters(registers);
@@ -3440,15 +3623,15 @@ void MacroAssembler::CallRecordWriteStubSaveRegisters(Register object,
         WriteBarrierDescriptor::SlotAddressRegister();
     MoveObjectAndSlot(object_parameter, slot_address_parameter, object, offset);
 
-    CallRecordWriteStub(object_parameter, slot_address_parameter, fp_mode,
-                        mode);
+    CallRecordWriteStub(object_parameter, slot_address_parameter, fp_mode, mode,
+                        type);
 
     MaybeRestoreRegisters(registers);
 }
 
 void MacroAssembler::CallRecordWriteStub(Register object, Register slot_address,
                                          SaveFPRegsMode fp_mode,
-                                         StubCallMode mode) {
+                                         StubCallMode mode, PointerType type) {
     ASM_CODE_COMMENT(this);
     DCHECK_EQ(WriteBarrierDescriptor::ObjectRegister(), object);
     DCHECK_EQ(WriteBarrierDescriptor::SlotAddressRegister(), slot_address);
@@ -3460,7 +3643,7 @@ void MacroAssembler::CallRecordWriteStub(Register object, Register slot_address,
   if (false) {
 #endif
   } else {
-    Builtin builtin = Builtins::GetRecordWriteStub(fp_mode);
+    Builtin builtin = Builtins::GetRecordWriteStub(fp_mode, type);
     CallBuiltin(builtin);
   }
 }
@@ -3505,7 +3688,8 @@ void MacroAssembler::MoveObjectAndSlot(Register dst_object, Register dst_slot,
 // shifted away.
 void MacroAssembler::RecordWrite(Register object, Operand offset,
                                  Register value, LinkRegisterStatus lr_status,
-                                 SaveFPRegsMode fp_mode, SmiCheck smi_check) {
+                                 SaveFPRegsMode fp_mode, SmiCheck smi_check,
+                                 PointerType type) {
   ASM_CODE_COMMENT(this);
   ASM_LOCATION_IN_ASSEMBLER("MacroAssembler::RecordWrite");
   DCHECK(!AreAliased(object, value));
@@ -3516,7 +3700,11 @@ void MacroAssembler::RecordWrite(Register object, Operand offset,
     Register temp = temps.AcquireX();
     DCHECK(!AreAliased(object, value, temp));
     Add(temp, object, offset);
-    LoadTaggedField(temp, MemOperand(temp));
+    if (type == PointerType::kIndirect) {
+      LoadIndirectPointerField(temp, MemOperand(temp));
+    } else {
+      LoadTaggedField(temp, MemOperand(temp));
+    }
     Cmp(temp, value);
     Check(eq, AbortReason::kWrongAddressOrValuePassedToRecordWrite);
   }
@@ -3548,7 +3736,8 @@ void MacroAssembler::RecordWrite(Register object, Operand offset,
   // TODO(cbruni): Turn offset into int.
   DCHECK(offset.IsImmediate());
   Add(slot_address, object, offset);
-  CallRecordWriteStub(object, slot_address, fp_mode);
+  CallRecordWriteStub(object, slot_address, fp_mode,
+                      StubCallMode::kCallBuiltinPointer, type);
   if (lr_status == kLRHasNotBeenSaved) {
     Pop<MacroAssembler::kAuthLR>(lr, padreg);
   }
@@ -3629,6 +3818,7 @@ void MacroAssembler::LoadNativeContextSlot(Register dst, int index) {
 }
 
 void MacroAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
+                                             CodeKind min_opt_level,
                                              Register feedback_vector,
                                              FeedbackSlot slot,
                                              Label* on_result,
@@ -3643,9 +3833,14 @@ void MacroAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
   // Is it marked_for_deoptimization? If yes, clear the slot.
   {
     UseScratchRegisterScope temps(this);
-    JumpIfCodeIsMarkedForDeoptimization(scratch_and_result, temps.AcquireX(),
-                                        &clear_slot);
-    B(on_result);
+    Register temp = temps.AcquireX();
+    JumpIfCodeIsMarkedForDeoptimization(scratch_and_result, temp, &clear_slot);
+    if (min_opt_level == CodeKind::TURBOFAN) {
+      JumpIfCodeIsTurbofanned(scratch_and_result, temp, on_result);
+      B(&fallthrough);
+    } else {
+      B(on_result);
+    }
   }
 
   bind(&clear_slot);
@@ -3917,29 +4112,6 @@ void MacroAssembler::Printf(const char* format, CPURegister arg0,
   FPTmpList()->set_bits(old_fp_tmp_list);
 }
 
-UseScratchRegisterScope::~UseScratchRegisterScope() {
-  available_->set_bits(old_available_);
-  availablefp_->set_bits(old_availablefp_);
-}
-
-Register UseScratchRegisterScope::AcquireSameSizeAs(const Register& reg) {
-  int code = AcquireNextAvailable(available_).code();
-  return Register::Create(code, reg.SizeInBits());
-}
-
-VRegister UseScratchRegisterScope::AcquireSameSizeAs(const VRegister& reg) {
-  int code = AcquireNextAvailable(availablefp_).code();
-  return VRegister::Create(code, reg.SizeInBits());
-}
-
-CPURegister UseScratchRegisterScope::AcquireNextAvailable(
-    CPURegList* available) {
-  CHECK(!available->IsEmpty());
-  CPURegister result = available->PopLowestIndex();
-  DCHECK(!AreAliased(result, xzr, sp));
-  return result;
-}
-
 void MacroAssembler::ComputeCodeStartAddress(const Register& rd) {
   // We can use adr to load a pc relative location.
   adr(rd, -pc_offset());
@@ -3986,15 +4158,58 @@ void MacroAssembler::PopcntHelper(Register dst, Register src) {
   Fmov(dst, tmp);
 }
 
+void MacroAssembler::I8x16BitMask(Register dst, VRegister src) {
+  ASM_CODE_COMMENT(this);
+  UseScratchRegisterScope temps(this);
+  VRegister tmp = temps.AcquireQ();
+  VRegister mask = temps.AcquireQ();
+  // Set i-th bit of each lane i. When AND with tmp, the lanes that
+  // are signed will have i-th bit set, unsigned will be 0.
+  Sshr(tmp.V16B(), src.V16B(), 7);
+  Movi(mask.V2D(), 0x8040'2010'0804'0201);
+  And(tmp.V16B(), mask.V16B(), tmp.V16B());
+  Ext(mask.V16B(), tmp.V16B(), tmp.V16B(), 8);
+  Zip1(tmp.V16B(), tmp.V16B(), mask.V16B());
+  Addv(tmp.H(), tmp.V8H());
+  Mov(dst.W(), tmp.V8H(), 0);
+}
+
+void MacroAssembler::I16x8BitMask(Register dst, VRegister src) {
+  ASM_CODE_COMMENT(this);
+  UseScratchRegisterScope temps(this);
+  VRegister tmp = temps.AcquireQ();
+  VRegister mask = temps.AcquireQ();
+  Sshr(tmp.V8H(), src.V8H(), 15);
+  // Set i-th bit of each lane i. When AND with tmp, the lanes that
+  // are signed will have i-th bit set, unsigned will be 0.
+  Movi(mask.V2D(), 0x0080'0040'0020'0010, 0x0008'0004'0002'0001);
+  And(tmp.V16B(), mask.V16B(), tmp.V16B());
+  Addv(tmp.H(), tmp.V8H());
+  Mov(dst.W(), tmp.V8H(), 0);
+}
+
+void MacroAssembler::I32x4BitMask(Register dst, VRegister src) {
+  ASM_CODE_COMMENT(this);
+  UseScratchRegisterScope temps(this);
+  Register tmp = temps.AcquireX();
+  Mov(dst.X(), src.D(), 1);
+  Fmov(tmp.X(), src.D());
+  And(dst.X(), dst.X(), 0x80000000'80000000);
+  And(tmp.X(), tmp.X(), 0x80000000'80000000);
+  Orr(dst.X(), dst.X(), Operand(dst.X(), LSL, 31));
+  Orr(tmp.X(), tmp.X(), Operand(tmp.X(), LSL, 31));
+  Lsr(dst.X(), dst.X(), 60);
+  Bfxil(dst.X(), tmp.X(), 62, 2);
+}
+
 void MacroAssembler::I64x2BitMask(Register dst, VRegister src) {
   ASM_CODE_COMMENT(this);
   UseScratchRegisterScope scope(this);
-  VRegister tmp1 = scope.AcquireV(kFormat2D);
-  Register tmp2 = scope.AcquireX();
-  Ushr(tmp1.V2D(), src.V2D(), 63);
-  Mov(dst.X(), tmp1.D(), 0);
-  Mov(tmp2.X(), tmp1.D(), 1);
-  Add(dst.W(), dst.W(), Operand(tmp2.W(), LSL, 1));
+  Register tmp = scope.AcquireX();
+  Mov(dst.X(), src.D(), 1);
+  Fmov(tmp.X(), src.D());
+  Lsr(dst.X(), dst.X(), 62);
+  Bfxil(dst.X(), tmp.X(), 63, 1);
 }
 
 void MacroAssembler::I64x2AllTrue(Register dst, VRegister src) {
@@ -4007,6 +4222,181 @@ void MacroAssembler::I64x2AllTrue(Register dst, VRegister src) {
   Cset(dst, eq);
 }
 
+// Calls an API function. Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand) {
+  ASM_CODE_COMMENT(masm);
+  ASM_LOCATION("CallApiFunctionAndReturn");
+
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  Register return_value = x0;
+  Register scratch = x4;
+  Register scratch2 = x5;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = x19;
+  Register prev_limit_reg = x20;
+  Register prev_level_reg = w21;
+
+  // C arguments (arg_reg_1/2) are expected to be initialized outside, so this
+  // function must not corrupt them (return_value overlaps with arg_reg_1 but
+  // that's ok because we start using it only after the C call).
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2,  // C args
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ Ldr(prev_next_address_reg, next_mem_op);
+    __ Ldr(prev_limit_reg, limit_mem_op);
+    __ Ldr(prev_level_reg, level_mem_op);
+    __ Add(scratch.W(), prev_level_reg, 1);
+    __ Str(scratch.W(), level_mem_op);
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ Ldrb(scratch.W(), __ ExternalReferenceAsOperand(
+                             ER::execution_mode_address(isolate), no_reg));
+    __ Cbnz(scratch.W(), &profiler_or_side_effects_check_enabled);
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ Mov(scratch, ER::address_of_runtime_stats_flag());
+    __ Ldrsw(scratch.W(), MemOperand(scratch));
+    __ Cbnz(scratch.W(), &profiler_or_side_effects_check_enabled);
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ StoreReturnAddressAndCall(function_address);
+  __ Bind(&done_api_call);
+
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  __ RecordComment("Load the value from ReturnValue");
+  __ Ldr(return_value, return_value_operand);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ Str(prev_next_address_reg, next_mem_op);
+    if (v8_flags.debug_code) {
+      __ Ldr(scratch.W(), level_mem_op);
+      __ Sub(scratch.W(), scratch.W(), 1);
+      __ Cmp(scratch.W(), prev_level_reg);
+      __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall);
+    }
+    __ Str(prev_level_reg, level_mem_op);
+
+    __ Ldr(scratch, limit_mem_op);
+    __ Cmp(prev_limit_reg, scratch);
+    __ B(ne, &delete_allocated_handles);
+  }
+
+  __ RecordComment("Leave the API exit frame.");
+  __ Bind(&leave_exit_frame);
+
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand != nullptr) {
+    DCHECK_EQ(stack_space, 0);
+    // Load the number of stack slots to drop before LeaveExitFrame modifies sp.
+    __ Ldr(stack_space_reg, *stack_space_operand);
+  }
+
+  __ LeaveExitFrame(scratch, scratch2);
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ Mov(scratch, ER::scheduled_exception_address(isolate));
+    __ Ldr(scratch, MemOperand(scratch));
+    __ JumpIfNotRoot(scratch, RootIndex::kTheHoleValue,
+                     &promote_scheduled_exception);
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ CompareRoot(return_value, RootIndex::kTheHoleValue);
+    __ B(kNotEqual, &finish_return);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch, scratch2,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  if (stack_space_operand == nullptr) {
+    DCHECK_NE(stack_space, 0);
+    __ DropSlots(stack_space);
+  } else {
+    DCHECK_EQ(stack_space, 0);
+    // {stack_space_operand} was loaded into {stack_space_reg} above.
+    __ DropArguments(stack_space_reg);
+  }
+
+  __ Ret();
+
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via thunk wrapper.");
+    __ Bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback function.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ Str(thunk_arg, thunk_arg_mem_op);
+    __ Mov(scratch, thunk_ref);
+    __ StoreReturnAddressAndCall(scratch);
+    __ B(&done_api_call);
+  }
+
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ Bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ Bind(&delete_allocated_handles);
+    __ Str(prev_limit_reg, limit_mem_op);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ Mov(saved_result, x0);
+    __ Mov(arg_reg_1, ER::isolate_address(isolate));
+    __ CallCFunction(ER::delete_handle_scope_extensions(), 1);
+    __ Mov(arg_reg_1, saved_result);
+    __ B(&leave_exit_frame);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/arm64/macro-assembler-arm64.h b/deps/v8/src/codegen/arm64/macro-assembler-arm64.h
index 887d3b0e01fd07..96d6738768f472 100644
--- a/deps/v8/src/codegen/arm64/macro-assembler-arm64.h
+++ b/deps/v8/src/codegen/arm64/macro-assembler-arm64.h
@@ -233,7 +233,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
     DCHECK(allow_macro_instructions());
     mov(vd, vd_index, vn, vn_index);
   }
-  void Mov(const Register& rd, Smi smi);
+  void Mov(const Register& rd, Tagged<Smi> smi);
   void Mov(const VRegister& vd, const VRegister& vn, int index) {
     DCHECK(allow_macro_instructions());
     mov(vd, vn, index);
@@ -249,7 +249,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   // These are required for compatibility with architecture independent code.
   // Remove if not needed.
-  void Move(Register dst, Smi src);
+  void Move(Register dst, Tagged<Smi> src);
   void Move(Register dst, MemOperand src);
   void Move(Register dst, Register src);
 
@@ -635,6 +635,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // not have zeros in the top 32 bits, enabled via --debug-code.
   void AssertZeroExtended(Register int32_register) NOOP_UNLESS_DEBUG_CODE;
 
+  void AssertJSAny(Register object, Register map_tmp, Register tmp,
+                   AbortReason abort_reason) NOOP_UNLESS_DEBUG_CODE;
+
   // Like Assert(), but always enabled.
   void Check(Condition cond, AbortReason reason);
 
@@ -913,12 +916,12 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void CallRecordWriteStubSaveRegisters(
       Register object, Operand offset, SaveFPRegsMode fp_mode,
-      StubCallMode mode = StubCallMode::kCallBuiltinPointer);
+      StubCallMode mode = StubCallMode::kCallBuiltinPointer,
+      PointerType type = PointerType::kDirect);
   void CallRecordWriteStub(
       Register object, Register slot_address, SaveFPRegsMode fp_mode,
-      StubCallMode mode = StubCallMode::kCallBuiltinPointer);
-
-  inline void MoveHeapNumber(Register dst, double value);
+      StubCallMode mode = StubCallMode::kCallBuiltinPointer,
+      PointerType type = PointerType::kDirect);
 
   // For a given |object| and |offset|:
   //   - Move |object| to |dst_object|.
@@ -966,6 +969,11 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void CheckPageFlag(const Register& object, int mask, Condition cc,
                      Label* condition_met);
 
+  void CheckPageFlag(const Register& object, Register scratch, int mask,
+                     Condition cc, Label* condition_met) {
+    CheckPageFlag(object, mask, cc, condition_met);
+  }
+
   // Compare a register with an operand, and branch to label depending on the
   // condition. May corrupt the status flags.
   inline void CompareAndBranch(const Register& lhs, const Operand& rhs,
@@ -1040,21 +1048,25 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // Generate an indirect call (for when a direct call's range is not adequate).
   void IndirectCall(Address target, RelocInfo::Mode rmode);
 
-  // Load the builtin given by the Smi in |builtin_| into the same
-  // register.
-  void LoadEntryFromBuiltinIndex(Register builtin);
+  // Load the builtin given by the Smi in |builtin| into |target|.
+  void LoadEntryFromBuiltinIndex(Register builtin, Register target);
   void LoadEntryFromBuiltin(Builtin builtin, Register destination);
   MemOperand EntryFromBuiltinAsOperand(Builtin builtin);
-  void CallBuiltinByIndex(Register builtin);
+  void CallBuiltinByIndex(Register builtin, Register target);
   void CallBuiltin(Builtin builtin);
   void TailCallBuiltin(Builtin builtin, Condition cond = al);
 
   // Load code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_object);
+  void LoadCodeInstructionStart(Register destination, Register code_object);
   void CallCodeObject(Register code_object);
   void JumpCodeObject(Register code_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object);
+  void JumpJSFunction(Register function_object,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   // Generates an instruction sequence s.t. the return address points to the
   // instruction following the call.
   // The return address on the stack is used by frame iteration.
@@ -1543,6 +1555,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // to native instructions. These helpers allow us to define the optimal code
   // sequence, and be used in both TurboFan and Liftoff.
   void PopcntHelper(Register dst, Register src);
+  void I8x16BitMask(Register dst, VRegister src);
+  void I16x8BitMask(Register dst, VRegister src);
+  void I32x4BitMask(Register dst, VRegister src);
   void I64x2BitMask(Register dst, VRegister src);
   void I64x2AllTrue(Register dst, VRegister src);
 
@@ -1552,18 +1567,33 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // Transform a SandboxedPointer from/to its encoded form, which is used when
   // the pointer is stored on the heap and ensures that the pointer will always
   // point into the sandbox.
-  void DecodeSandboxedPointer(const Register& value);
-  void LoadSandboxedPointerField(const Register& destination,
-                                 const MemOperand& field_operand);
-  void StoreSandboxedPointerField(const Register& value,
-                                  const MemOperand& dst_field_operand);
-
-  // Loads a field containing off-heap pointer and does necessary decoding
-  // if sandboxed external pointers are enabled.
+  void DecodeSandboxedPointer(Register value);
+  void LoadSandboxedPointerField(Register destination,
+                                 MemOperand field_operand);
+  void StoreSandboxedPointerField(Register value, MemOperand dst_field_operand);
+
+  // Loads a field containing an off-heap ("external") pointer and does
+  // necessary decoding if the sandbox is enabled.
   void LoadExternalPointerField(Register destination, MemOperand field_operand,
                                 ExternalPointerTag tag,
                                 Register isolate_root = Register::no_reg());
 
+  // Loads an indirect pointer from the heap.
+  void LoadIndirectPointerField(Register destination, MemOperand field_operand);
+
+  // Store an indirect pointer to the given object in the destination field.
+  void StoreIndirectPointerField(Register value, MemOperand dst_field_operand);
+
+  // Store an indirect (if the sandbox is enabled) or direct/tagged (otherwise)
+  // pointer to the given object in the destination field.
+  void StoreMaybeIndirectPointerField(Register value,
+                                      MemOperand dst_field_operand);
+
+  // Laod a pointer to a code entrypoint from the heap.
+  // When the sandbox is enabled the pointer is loaded indirectly via the code
+  // pointer table, otherwise it is loaded direclty as a raw pointer.
+  void LoadCodeEntrypointField(Register destination, MemOperand field_operand);
+
   // Instruction set functions ------------------------------------------------
   // Logical macros.
   inline void Bics(const Register& rd, const Register& rn,
@@ -1873,6 +1903,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void ReplaceClosureCodeWithOptimizedCode(Register optimized_code,
                                            Register closure);
   void GenerateTailCallToReturnedCode(Runtime::FunctionId function_id);
+  Condition LoadFeedbackVectorFlagsAndCheckIfNeedsProcessing(
+      Register flags, Register feedback_vector, CodeKind current_code_kind);
   void LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
       Register flags, Register feedback_vector, CodeKind current_code_kind,
       Label* flags_need_processing);
@@ -1895,9 +1927,11 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void JumpIfCodeIsMarkedForDeoptimization(Register code, Register scratch,
                                            Label* if_marked_for_deoptimization);
+  void JumpIfCodeIsTurbofanned(Register code, Register scratch,
+                               Label* if_marked_for_deoptimization);
   Operand ClearedValue() const;
 
-  Operand ReceiverOperand(const Register arg_count);
+  Operand ReceiverOperand();
 
   // ---- SMI and Number Utilities ----
 
@@ -1935,6 +1969,11 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // enabled via --debug-code.
   void AssertUndefinedOrAllocationSite(Register object) NOOP_UNLESS_DEBUG_CODE;
 
+  // Abort execution if argument is not smi nor in the pointer compresssion
+  // cage, enabled via --debug-code.
+  void AssertSmiOrHeapObjectInCompressionCage(Register object)
+      NOOP_UNLESS_DEBUG_CODE;
+
   // ---- Calling / Jumping helpers ----
 
   void CallRuntime(const Runtime::Function* f, int num_arguments);
@@ -2130,13 +2169,15 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // the tagged HeapObject pointer.  For use with FieldMemOperand(reg, off).
   void RecordWriteField(Register object, int offset, Register value,
                         LinkRegisterStatus lr_status, SaveFPRegsMode save_fp,
-                        SmiCheck smi_check = SmiCheck::kInline);
+                        SmiCheck smi_check = SmiCheck::kInline,
+                        PointerType type = PointerType::kDirect);
 
   // For a given |object| notify the garbage collector that the slot at |offset|
   // has been written. |value| is the object being stored.
   void RecordWrite(Register object, Operand offset, Register value,
                    LinkRegisterStatus lr_status, SaveFPRegsMode save_fp,
-                   SmiCheck smi_check = SmiCheck::kInline);
+                   SmiCheck smi_check = SmiCheck::kInline,
+                   PointerType type = PointerType::kDirect);
 
   // ---------------------------------------------------------------------------
   // Debugging.
@@ -2146,8 +2187,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // Falls through and sets scratch_and_result to 0 on failure, jumps to
   // on_result on success.
   void TryLoadOptimizedOsrCode(Register scratch_and_result,
-                               Register feedback_vector, FeedbackSlot slot,
-                               Label* on_result, Label::Distance distance);
+                               CodeKind min_opt_level, Register feedback_vector,
+                               FeedbackSlot slot, Label* on_result,
+                               Label::Distance distance);
 
  protected:
   // The actual Push and Pop implementations. These don't generate any code
@@ -2201,8 +2243,40 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // for generating appropriate code.
   // Otherwise it returns false.
   // This function also checks wether veneers need to be emitted.
-  bool NeedExtraInstructionsOrRegisterBranch(Label* label,
-                                             ImmBranchType branch_type);
+  template <ImmBranchType branch_type>
+  bool NeedExtraInstructionsOrRegisterBranch(Label* label) {
+    static_assert((branch_type == CondBranchType) ||
+                  (branch_type == CompareBranchType) ||
+                  (branch_type == TestBranchType));
+
+    bool need_longer_range = false;
+    // There are two situations in which we care about the offset being out of
+    // range:
+    //  - The label is bound but too far away.
+    //  - The label is not bound but linked, and the previous branch
+    //    instruction in the chain is too far away.
+    if (label->is_bound() || label->is_linked()) {
+      need_longer_range = !Instruction::IsValidImmPCOffset(
+          branch_type, label->pos() - pc_offset());
+    }
+    if (!need_longer_range && !label->is_bound()) {
+      int max_reachable_pc =
+          pc_offset() + Instruction::ImmBranchRange(branch_type);
+
+      // Use the LSB of the max_reachable_pc (always four-byte aligned) to
+      // encode the branch type. We need only distinguish between TB[N]Z and
+      // CB[N]Z/conditional branch, as the ranges for the latter are the same.
+      int branch_type_tag = (branch_type == TestBranchType) ? 1 : 0;
+
+      unresolved_branches_.insert(
+          std::pair<int, Label*>(max_reachable_pc + branch_type_tag, label));
+      // Also maintain the next pool check.
+      next_veneer_pool_check_ =
+          std::min(next_veneer_pool_check_,
+                   max_reachable_pc - kVeneerDistanceCheckMargin);
+    }
+    return need_longer_range;
+  }
 
   void Movi16bitHelper(const VRegister& vd, uint64_t imm);
   void Movi32bitHelper(const VRegister& vd, uint64_t imm);
@@ -2210,12 +2284,14 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void LoadStoreMacro(const CPURegister& rt, const MemOperand& addr,
                       LoadStoreOp op);
+  void LoadStoreMacroComplex(const CPURegister& rt, const MemOperand& addr,
+                             LoadStoreOp op);
 
   void LoadStorePairMacro(const CPURegister& rt, const CPURegister& rt2,
                           const MemOperand& addr, LoadStorePairOp op);
 
   int64_t CalculateTargetOffset(Address target, RelocInfo::Mode rmode,
-                                byte* pc);
+                                uint8_t* pc);
 
   void JumpHelper(int64_t offset, RelocInfo::Mode rmode, Condition cond = al);
 
@@ -2287,7 +2363,10 @@ class V8_NODISCARD UseScratchRegisterScope {
     DCHECK_EQ(availablefp_->type(), CPURegister::kVRegister);
   }
 
-  V8_EXPORT_PRIVATE ~UseScratchRegisterScope();
+  V8_EXPORT_PRIVATE ~UseScratchRegisterScope() {
+    available_->set_bits(old_available_);
+    availablefp_->set_bits(old_availablefp_);
+  }
 
   // Take a register from the appropriate temps list. It will be returned
   // automatically when the scope ends.
@@ -2303,8 +2382,15 @@ class V8_NODISCARD UseScratchRegisterScope {
   bool CanAcquire() const { return !available_->IsEmpty(); }
   bool CanAcquireFP() const { return !availablefp_->IsEmpty(); }
 
-  Register AcquireSameSizeAs(const Register& reg);
-  V8_EXPORT_PRIVATE VRegister AcquireSameSizeAs(const VRegister& reg);
+  Register AcquireSameSizeAs(const Register& reg) {
+    int code = AcquireNextAvailable(available_).code();
+    return Register::Create(code, reg.SizeInBits());
+  }
+
+  V8_EXPORT_PRIVATE VRegister AcquireSameSizeAs(const VRegister& reg) {
+    int code = AcquireNextAvailable(availablefp_).code();
+    return VRegister::Create(code, reg.SizeInBits());
+  }
 
   void Include(const CPURegList& list) { available_->Combine(list); }
   void IncludeFP(const CPURegList& list) { availablefp_->Combine(list); }
@@ -2346,7 +2432,12 @@ class V8_NODISCARD UseScratchRegisterScope {
 
  private:
   V8_EXPORT_PRIVATE static CPURegister AcquireNextAvailable(
-      CPURegList* available);
+      CPURegList* available) {
+    CHECK(!available->IsEmpty());
+    CPURegister result = available->PopLowestIndex();
+    DCHECK(!AreAliased(result, xzr, sp));
+    return result;
+  }
 
   // Available scratch registers.
   CPURegList* available_;    // kRegister
@@ -2369,6 +2460,23 @@ struct MoveCycleState {
   base::Optional<CPURegister> scratch_reg;
 };
 
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameStackSlotOperand(int offset);
+
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameCallerStackSlotOperand(int index);
+
+// Calls an API function. Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand);
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/arm64/register-arm64.h b/deps/v8/src/codegen/arm64/register-arm64.h
index 10ce9986a1b894..12caf0b70fa4a9 100644
--- a/deps/v8/src/codegen/arm64/register-arm64.h
+++ b/deps/v8/src/codegen/arm64/register-arm64.h
@@ -269,6 +269,13 @@ ASSERT_TRIVIALLY_COPYABLE(Register);
 static_assert(sizeof(Register) <= sizeof(int),
               "Register can efficiently be passed by value");
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 // Stack frame alignment and padding.
 constexpr int ArgumentPaddingSlots(int argument_count) {
   // Stack frames are aligned to 16 bytes.
@@ -525,6 +532,12 @@ ALIAS_REGISTER(VRegister, fp_scratch2, d31);
 
 #undef ALIAS_REGISTER
 
+// Arm64 calling convention
+constexpr Register arg_reg_1 = x0;
+constexpr Register arg_reg_2 = x1;
+constexpr Register arg_reg_3 = x2;
+constexpr Register arg_reg_4 = x3;
+
 // AreAliased returns true if any of the named registers overlap. Arguments set
 // to NoReg are ignored. The system stack pointer may be specified.
 V8_EXPORT_PRIVATE bool AreAliased(
diff --git a/deps/v8/src/codegen/arm64/utils-arm64.cc b/deps/v8/src/codegen/arm64/utils-arm64.cc
index cdc408db1dedcf..1f73cded4d141a 100644
--- a/deps/v8/src/codegen/arm64/utils-arm64.cc
+++ b/deps/v8/src/codegen/arm64/utils-arm64.cc
@@ -73,14 +73,6 @@ int float16classify(float16 value) {
   return FP_NORMAL;
 }
 
-int CountLeadingZeros(uint64_t value, int width) {
-  DCHECK(base::bits::IsPowerOfTwo(width) && (width <= 64));
-  if (value == 0) {
-    return width;
-  }
-  return base::bits::CountLeadingZeros64(value << (64 - width));
-}
-
 int CountLeadingSignBits(int64_t value, int width) {
   DCHECK(base::bits::IsPowerOfTwo(width) && (width <= 64));
   if (value >= 0) {
@@ -109,12 +101,6 @@ int HighestSetBitPosition(uint64_t value) {
   return 63 - CountLeadingZeros(value, 64);
 }
 
-uint64_t LargestPowerOf2Divisor(uint64_t value) {
-  // Simulate two's complement (instead of casting to signed and negating) to
-  // avoid undefined behavior on signed overflow.
-  return value & ((~value) + 1);
-}
-
 int MaskToBit(uint64_t mask) {
   DCHECK_EQ(CountSetBits(mask, 64), 1);
   return base::bits::CountTrailingZeros(mask);
diff --git a/deps/v8/src/codegen/arm64/utils-arm64.h b/deps/v8/src/codegen/arm64/utils-arm64.h
index 266cd525ccab04..f6bbc09b94189e 100644
--- a/deps/v8/src/codegen/arm64/utils-arm64.h
+++ b/deps/v8/src/codegen/arm64/utils-arm64.h
@@ -31,12 +31,22 @@ double double_pack(uint64_t sign, uint64_t exp, uint64_t mantissa);
 int float16classify(float16 value);
 
 // Bit counting.
-int CountLeadingZeros(uint64_t value, int width);
+inline static int CountLeadingZeros(uint64_t value, int width) {
+  DCHECK(base::bits::IsPowerOfTwo(width) && (width <= 64));
+  if (value == 0) {
+    return width;
+  }
+  return base::bits::CountLeadingZeros64(value << (64 - width));
+}
 int CountLeadingSignBits(int64_t value, int width);
 V8_EXPORT_PRIVATE int CountSetBits(uint64_t value, int width);
 int LowestSetBitPosition(uint64_t value);
 int HighestSetBitPosition(uint64_t value);
-uint64_t LargestPowerOf2Divisor(uint64_t value);
+inline static uint64_t LargestPowerOf2Divisor(uint64_t value) {
+  // Simulate two's complement (instead of casting to signed and negating) to
+  // avoid undefined behavior on signed overflow.
+  return value & ((~value) + 1);
+}
 int MaskToBit(uint64_t mask);
 
 template <typename T>
diff --git a/deps/v8/src/codegen/assembler.cc b/deps/v8/src/codegen/assembler.cc
index 30ec9118b900e1..ce7b1ebef088c5 100644
--- a/deps/v8/src/codegen/assembler.cc
+++ b/deps/v8/src/codegen/assembler.cc
@@ -70,7 +70,7 @@ AssemblerOptions AssemblerOptions::Default(Isolate* isolate) {
   options.enable_simulator_code = !serializer || v8_flags.target_is_simulator;
 #endif
 
-#if V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_ARM64
+#if V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_LOONG64
   options.code_range_base = isolate->heap()->code_range_base();
 #endif
   bool short_builtin_calls =
@@ -97,7 +97,7 @@ class DefaultAssemblerBuffer : public AssemblerBuffer {
 #endif
   }
 
-  byte* start() const override { return buffer_.begin(); }
+  uint8_t* start() const override { return buffer_.begin(); }
 
   int size() const override { return static_cast<int>(buffer_.size()); }
 
@@ -112,10 +112,10 @@ class DefaultAssemblerBuffer : public AssemblerBuffer {
 
 class ExternalAssemblerBufferImpl : public AssemblerBuffer {
  public:
-  ExternalAssemblerBufferImpl(byte* start, int size)
+  ExternalAssemblerBufferImpl(uint8_t* start, int size)
       : start_(start), size_(size) {}
 
-  byte* start() const override { return start_; }
+  uint8_t* start() const override { return start_; }
 
   int size() const override { return size_; }
 
@@ -127,7 +127,7 @@ class ExternalAssemblerBufferImpl : public AssemblerBuffer {
   void operator delete(void* ptr) noexcept;
 
  private:
-  byte* const start_;
+  uint8_t* const start_;
   const int size_;
 };
 
@@ -160,7 +160,7 @@ void ExternalAssemblerBufferImpl::operator delete(void* ptr) noexcept {
 std::unique_ptr<AssemblerBuffer> ExternalAssemblerBuffer(void* start,
                                                          int size) {
   return std::make_unique<ExternalAssemblerBufferImpl>(
-      reinterpret_cast<byte*>(start), size);
+      reinterpret_cast<uint8_t*>(start), size);
 }
 
 std::unique_ptr<AssemblerBuffer> NewAssemblerBuffer(int size) {
@@ -230,12 +230,19 @@ HeapNumberRequest::HeapNumberRequest(double heap_number, int offset)
 
 void Assembler::RecordDeoptReason(DeoptimizeReason reason, uint32_t node_id,
                                   SourcePosition position, int id) {
-  EnsureSpace ensure_space(this);
-  RecordRelocInfo(RelocInfo::DEOPT_SCRIPT_OFFSET, position.ScriptOffset());
-  RecordRelocInfo(RelocInfo::DEOPT_INLINING_ID, position.InliningId());
-  RecordRelocInfo(RelocInfo::DEOPT_REASON, static_cast<int>(reason));
-  RecordRelocInfo(RelocInfo::DEOPT_ID, id);
+  static_assert(RelocInfoWriter::kMaxSize * 2 <= kGap);
+  {
+    EnsureSpace space(this);
+    RecordRelocInfo(RelocInfo::DEOPT_SCRIPT_OFFSET, position.ScriptOffset());
+    RecordRelocInfo(RelocInfo::DEOPT_INLINING_ID, position.InliningId());
+  }
+  {
+    EnsureSpace space(this);
+    RecordRelocInfo(RelocInfo::DEOPT_REASON, static_cast<int>(reason));
+    RecordRelocInfo(RelocInfo::DEOPT_ID, id);
+  }
 #ifdef DEBUG
+  EnsureSpace space(this);
   RecordRelocInfo(RelocInfo::DEOPT_NODE_ID, node_id);
 #endif  // DEBUG
 }
diff --git a/deps/v8/src/codegen/assembler.h b/deps/v8/src/codegen/assembler.h
index e1ee4914e46592..ff7c1d426954e2 100644
--- a/deps/v8/src/codegen/assembler.h
+++ b/deps/v8/src/codegen/assembler.h
@@ -35,8 +35,11 @@
 #ifndef V8_CODEGEN_ASSEMBLER_H_
 #define V8_CODEGEN_ASSEMBLER_H_
 
+#include <algorithm>
 #include <forward_list>
+#include <map>
 #include <memory>
+#include <ostream>
 #include <unordered_map>
 
 #include "src/base/macros.h"
@@ -44,6 +47,7 @@
 #include "src/codegen/code-comments.h"
 #include "src/codegen/cpu-features.h"
 #include "src/codegen/external-reference.h"
+#include "src/codegen/label.h"
 #include "src/codegen/reglist.h"
 #include "src/codegen/reloc-info.h"
 #include "src/common/globals.h"
@@ -51,6 +55,7 @@
 #include "src/flags/flags.h"
 #include "src/handles/handles.h"
 #include "src/objects/objects.h"
+#include "src/utils/ostreams.h"
 
 namespace v8 {
 
@@ -70,36 +75,88 @@ class Isolate;
 class SCTableReference;
 class SourcePosition;
 class StatsCounter;
+class Label;
 
 // -----------------------------------------------------------------------------
 // Optimization for far-jmp like instructions that can be replaced by shorter.
 
-class JumpOptimizationInfo {
+struct JumpOptimizationInfo {
  public:
-  bool is_collecting() const { return stage_ == kCollection; }
-  bool is_optimizing() const { return stage_ == kOptimization; }
+  struct JumpInfo {
+    int pos;
+    int opcode_size;
+    // target_address-address_after_jmp_instr, 0 when distance not bind.
+    int distance;
+  };
+
+  bool is_collecting() const { return stage == kCollection; }
+  bool is_optimizing() const { return stage == kOptimization; }
   void set_optimizing() {
     DCHECK(is_optimizable());
-    stage_ = kOptimization;
+    stage = kOptimization;
   }
 
-  bool is_optimizable() const { return optimizable_; }
+  bool is_optimizable() const { return optimizable; }
   void set_optimizable() {
     DCHECK(is_collecting());
-    optimizable_ = true;
+    optimizable = true;
+  }
+
+  int MaxAlignInRange(int from, int to) {
+    int max_align = 0;
+
+    auto it = align_pos_size.upper_bound(from);
+
+    while (it != align_pos_size.end()) {
+      if (it->first <= to) {
+        max_align = std::max(max_align, it->second);
+        it++;
+      } else {
+        break;
+      }
+    }
+    return max_align;
+  }
+
+  // Debug
+  void Print() {
+    std::cout << "align_pos_size:" << std::endl;
+    for (auto p : align_pos_size) {
+      std::cout << "{" << p.first << "," << p.second << "}"
+                << " ";
+    }
+    std::cout << std::endl;
+
+    std::cout << "may_optimizable_farjmp:" << std::endl;
+
+    for (auto p : may_optimizable_farjmp) {
+      const auto& jmp_info = p.second;
+      printf("{postion:%d, opcode_size:%d, distance:%d, dest:%d}\n",
+             jmp_info.pos, jmp_info.opcode_size, jmp_info.distance,
+             jmp_info.pos + jmp_info.opcode_size + 4 + jmp_info.distance);
+    }
+    std::cout << std::endl;
   }
 
   // Used to verify the instruction sequence is always the same in two stages.
-  size_t hash_code() const { return hash_code_; }
-  void set_hash_code(size_t hash_code) { hash_code_ = hash_code; }
+  enum { kCollection, kOptimization } stage = kCollection;
 
-  std::vector<uint32_t>& farjmp_bitmap() { return farjmp_bitmap_; }
+  size_t hash_code = 0u;
 
- private:
-  enum { kCollection, kOptimization } stage_ = kCollection;
-  bool optimizable_ = false;
-  std::vector<uint32_t> farjmp_bitmap_;
-  size_t hash_code_ = 0u;
+  // {position: align_size}
+  std::map<int, int> align_pos_size;
+
+  int farjmp_num = 0;
+  // For collecting stage, should contains all far jump informatino after
+  // collecting.
+  std::vector<JumpInfo> farjmps;
+
+  bool optimizable = false;
+  // {index: JumpInfo}
+  std::map<int, JumpInfo> may_optimizable_farjmp;
+
+  // For label binding.
+  std::map<Label*, std::vector<int>> label_farjmp_maps;
 };
 
 class HeapNumberRequest {
@@ -198,7 +255,7 @@ struct V8_EXPORT_PRIVATE AssemblerOptions {
 class AssemblerBuffer {
  public:
   virtual ~AssemblerBuffer() = default;
-  virtual byte* start() const = 0;
+  virtual uint8_t* start() const = 0;
   virtual int size() const = 0;
   // Return a grown copy of this buffer. The contained data is uninitialized.
   // The data in {this} will still be read afterwards (until {this} is
@@ -265,7 +322,7 @@ class V8_EXPORT_PRIVATE AssemblerBase : public Malloced {
 
   // Overwrite a host NaN with a quiet target NaN.  Used by mksnapshot for
   // cross-snapshotting.
-  static void QuietNaN(HeapObject nan) {}
+  static void QuietNaN(Tagged<HeapObject> nan) {}
 
   int pc_offset() const { return static_cast<int>(pc_ - buffer_start_); }
 
@@ -279,7 +336,7 @@ class V8_EXPORT_PRIVATE AssemblerBase : public Malloced {
 #endif
   }
 
-  byte* buffer_start() const { return buffer_->start(); }
+  uint8_t* buffer_start() const { return buffer_->start(); }
   int buffer_size() const { return buffer_->size(); }
   int instruction_size() const { return pc_offset(); }
 
@@ -366,11 +423,11 @@ class V8_EXPORT_PRIVATE AssemblerBase : public Malloced {
   // The buffer into which code and relocation info are generated.
   std::unique_ptr<AssemblerBuffer> buffer_;
   // Cached from {buffer_->start()}, for faster access.
-  byte* buffer_start_;
+  uint8_t* buffer_start_;
   std::forward_list<HeapNumberRequest> heap_number_requests_;
   // The program counter, which points into the buffer above and moves forward.
   // TODO(jkummerow): This should probably have type {Address}.
-  byte* pc_;
+  uint8_t* pc_;
 
   void set_constant_pool_available(bool available) {
     if (V8_EMBEDDED_CONSTANT_POOL_BOOL) {
@@ -396,9 +453,13 @@ class V8_EXPORT_PRIVATE AssemblerBase : public Malloced {
         !v8_flags.debug_code) {
       return false;
     }
-#ifndef ENABLE_DISASSEMBLER
-    if (RelocInfo::IsLiteralConstant(rmode)) return false;
-#endif
+    if (RelocInfo::IsOnlyForDisassembler(rmode)) {
+#ifdef ENABLE_DISASSEMBLER
+      return true;
+#else
+      return false;
+#endif  // ENABLE_DISASSEMBLER
+    }
     return true;
   }
 
diff --git a/deps/v8/src/codegen/bailout-reason.h b/deps/v8/src/codegen/bailout-reason.h
index 423dbf411d6324..769595076114d4 100644
--- a/deps/v8/src/codegen/bailout-reason.h
+++ b/deps/v8/src/codegen/bailout-reason.h
@@ -59,6 +59,7 @@ namespace internal {
   V(kOperandIsNotACode, "Operand is not a Code object")                        \
   V(kOperandIsNotAMap, "Operand is not a Map object")                          \
   V(kOperandIsNotASmi, "Operand is not a smi")                                 \
+  V(kMaglevOsrTodo, "OSR into maglev is not implemented yet")                  \
   V(kPromiseAlreadySettled, "Promise already settled")                         \
   V(kReceivedInvalidReturnAddress, "Received invalid return address")          \
   V(kRegisterDidNotMatchExpectedRoot, "Register did not match expected root")  \
@@ -66,6 +67,7 @@ namespace internal {
   V(kShouldNotDirectlyEnterOsrFunction,                                        \
     "Should not directly enter OSR-compiled function")                         \
   V(kStackAccessBelowStackPointer, "Stack access below stack pointer")         \
+  V(kOsrUnexpectedStackSize, "Unexpected stack size on OSR entry")             \
   V(kStackFrameTypesMustMatch, "Stack frame types must match")                 \
   V(kUint32IsNotAInt32,                                                        \
     "Uint32 cannot be converted to Int32 without loss of precision")           \
@@ -114,6 +116,7 @@ namespace internal {
   V(kNativeFunctionLiteral, "Native function literal")                       \
   V(kOptimizationDisabled, "Optimization disabled")                          \
   V(kHigherTierAvailable, "A higher tier is already available")              \
+  V(kDetachedNativeContext, "The native context is detached")                \
   V(kNeverOptimize, "Optimization is always disabled")
 
 #define ERROR_MESSAGES_CONSTANTS(C, T) C,
diff --git a/deps/v8/src/codegen/code-desc.h b/deps/v8/src/codegen/code-desc.h
index 7aed2eb9621078..2f74cdb9c7cdbe 100644
--- a/deps/v8/src/codegen/code-desc.h
+++ b/deps/v8/src/codegen/code-desc.h
@@ -41,7 +41,7 @@ class CodeDesc {
 #endif
 
  public:
-  byte* buffer = nullptr;
+  uint8_t* buffer = nullptr;
   int buffer_size = 0;
 
   // The instruction area contains executable code plus inlined metadata.
@@ -88,7 +88,7 @@ class CodeDesc {
 
   // Unwinding information.
 
-  byte* unwinding_info = nullptr;
+  uint8_t* unwinding_info = nullptr;
   int unwinding_info_size = 0;
   int unwinding_info_offset_relative() const {
     // TODO(jgruber,v8:11036): Remove this function once unwinding_info setup
diff --git a/deps/v8/src/codegen/code-factory.cc b/deps/v8/src/codegen/code-factory.cc
index e3f3fe79e76b9f..cbb76edef841b6 100644
--- a/deps/v8/src/codegen/code-factory.cc
+++ b/deps/v8/src/codegen/code-factory.cc
@@ -14,18 +14,28 @@ namespace v8 {
 namespace internal {
 
 // static
-Handle<Code> CodeFactory::RuntimeCEntry(Isolate* isolate, int result_size) {
-  return CodeFactory::CEntry(isolate, result_size);
+Handle<Code> CodeFactory::RuntimeCEntry(Isolate* isolate, int result_size,
+                                        bool switch_to_central_stack) {
+  return CodeFactory::CEntry(isolate, result_size, ArgvMode::kStack, false,
+                             switch_to_central_stack);
 }
 
 // static
 Handle<Code> CodeFactory::CEntry(Isolate* isolate, int result_size,
-                                 ArgvMode argv_mode, bool builtin_exit_frame) {
+                                 ArgvMode argv_mode, bool builtin_exit_frame,
+                                 bool switch_to_central_stack) {
   // Aliases for readability below.
   const int rs = result_size;
   const ArgvMode am = argv_mode;
   const bool be = builtin_exit_frame;
 
+  if (switch_to_central_stack) {
+    DCHECK_EQ(result_size, 1);
+    DCHECK_EQ(argv_mode, ArgvMode::kStack);
+    DCHECK_EQ(builtin_exit_frame, false);
+    return BUILTIN_CODE(isolate, WasmCEntry);
+  }
+
   if (rs == 1 && am == ArgvMode::kStack && !be) {
     return BUILTIN_CODE(isolate, CEntry_Return1_ArgvOnStack_NoBuiltinExit);
   } else if (rs == 1 && am == ArgvMode::kStack && be) {
@@ -48,11 +58,6 @@ Callable CodeFactory::ApiGetter(Isolate* isolate) {
   return Builtins::CallableFor(isolate, Builtin::kCallApiGetter);
 }
 
-// static
-Callable CodeFactory::CallApiCallback(Isolate* isolate) {
-  return Builtins::CallableFor(isolate, Builtin::kCallApiCallback);
-}
-
 // static
 Callable CodeFactory::LoadGlobalIC(Isolate* isolate, TypeofMode typeof_mode) {
   return typeof_mode == TypeofMode::kNotInside
diff --git a/deps/v8/src/codegen/code-factory.h b/deps/v8/src/codegen/code-factory.h
index 1c332654989d77..e08c1f3323a094 100644
--- a/deps/v8/src/codegen/code-factory.h
+++ b/deps/v8/src/codegen/code-factory.h
@@ -26,11 +26,13 @@ class V8_EXPORT_PRIVATE CodeFactory final {
   // stack and the arguments count is passed via register) which currently
   // can't be expressed in CallInterfaceDescriptor. Therefore only the code
   // is exported here.
-  static Handle<Code> RuntimeCEntry(Isolate* isolate, int result_size = 1);
+  static Handle<Code> RuntimeCEntry(Isolate* isolate, int result_size = 1,
+                                    bool switch_to_central_stack = false);
 
   static Handle<Code> CEntry(Isolate* isolate, int result_size = 1,
                              ArgvMode argv_mode = ArgvMode::kStack,
-                             bool builtin_exit_frame = false);
+                             bool builtin_exit_frame = false,
+                             bool switch_to_central_stack = false);
 
   // Initial states for ICs.
   static Callable LoadGlobalIC(Isolate* isolate, TypeofMode typeof_mode);
diff --git a/deps/v8/src/codegen/code-reference.cc b/deps/v8/src/codegen/code-reference.cc
index df7a7cd57f1319..7f3893e3940998 100644
--- a/deps/v8/src/codegen/code-reference.cc
+++ b/deps/v8/src/codegen/code-reference.cc
@@ -22,11 +22,11 @@ struct CodeOps {
   Handle<Code> code;
 
   Address constant_pool() const { return code->constant_pool(); }
-  Address instruction_start() const { return code->InstructionStart(); }
-  Address instruction_end() const { return code->InstructionEnd(); }
-  int instruction_size() const { return code->InstructionSize(); }
-  const byte* relocation_start() const { return code->relocation_start(); }
-  const byte* relocation_end() const { return code->relocation_end(); }
+  Address instruction_start() const { return code->instruction_start(); }
+  Address instruction_end() const { return code->instruction_end(); }
+  int instruction_size() const { return code->instruction_size(); }
+  const uint8_t* relocation_start() const { return code->relocation_start(); }
+  const uint8_t* relocation_end() const { return code->relocation_end(); }
   int relocation_size() const { return code->relocation_size(); }
   Address code_comments() const { return code->code_comments(); }
   int code_comments_size() const { return code->code_comments_size(); }
@@ -45,8 +45,8 @@ struct WasmCodeOps {
                                      code->instructions().size());
   }
   int instruction_size() const { return code->instructions().length(); }
-  const byte* relocation_start() const { return code->reloc_info().begin(); }
-  const byte* relocation_end() const {
+  const uint8_t* relocation_start() const { return code->reloc_info().begin(); }
+  const uint8_t* relocation_end() const {
     return code->reloc_info().begin() + code->reloc_info().length();
   }
   int relocation_size() const { return code->reloc_info().length(); }
@@ -68,10 +68,10 @@ struct CodeDescOps {
     return instruction_start() + code_desc->instr_size;
   }
   int instruction_size() const { return code_desc->instr_size; }
-  const byte* relocation_start() const {
+  const uint8_t* relocation_start() const {
     return code_desc->buffer + code_desc->reloc_offset;
   }
-  const byte* relocation_end() const {
+  const uint8_t* relocation_end() const {
     return code_desc->buffer + code_desc->buffer_size;
   }
   int relocation_size() const { return code_desc->reloc_size; }
@@ -107,8 +107,8 @@ DISPATCH(Address, constant_pool)
 DISPATCH(Address, instruction_start)
 DISPATCH(Address, instruction_end)
 DISPATCH(int, instruction_size)
-DISPATCH(const byte*, relocation_start)
-DISPATCH(const byte*, relocation_end)
+DISPATCH(const uint8_t*, relocation_start)
+DISPATCH(const uint8_t*, relocation_end)
 DISPATCH(int, relocation_size)
 DISPATCH(Address, code_comments)
 DISPATCH(int, code_comments_size)
diff --git a/deps/v8/src/codegen/code-reference.h b/deps/v8/src/codegen/code-reference.h
index 8ba313aec14b08..c44ec54252e824 100644
--- a/deps/v8/src/codegen/code-reference.h
+++ b/deps/v8/src/codegen/code-reference.h
@@ -33,8 +33,8 @@ class CodeReference {
   Address instruction_start() const;
   Address instruction_end() const;
   int instruction_size() const;
-  const byte* relocation_start() const;
-  const byte* relocation_end() const;
+  const uint8_t* relocation_start() const;
+  const uint8_t* relocation_end() const;
   int relocation_size() const;
   Address code_comments() const;
   int code_comments_size() const;
diff --git a/deps/v8/src/codegen/code-stub-assembler.cc b/deps/v8/src/codegen/code-stub-assembler.cc
index c5fdaac2401e1e..5edbe168532fcc 100644
--- a/deps/v8/src/codegen/code-stub-assembler.cc
+++ b/deps/v8/src/codegen/code-stub-assembler.cc
@@ -59,7 +59,7 @@ Builtin BigIntComparisonBuiltinOf(Operation const& op) {
 CodeStubAssembler::CodeStubAssembler(compiler::CodeAssemblerState* state)
     : compiler::CodeAssembler(state),
       TorqueGeneratedExportedMacrosAssembler(state) {
-  if (DEBUG_BOOL && v8_flags.csa_trap_on_node != nullptr) {
+  if (v8_flags.csa_trap_on_node != nullptr) {
     HandleBreakOnNode();
   }
 }
@@ -235,14 +235,14 @@ TNode<IntPtrT> CodeStubAssembler::SelectIntPtrConstant(TNode<BoolT> condition,
                                  IntPtrConstant(false_value));
 }
 
-TNode<Oddball> CodeStubAssembler::SelectBooleanConstant(
+TNode<Boolean> CodeStubAssembler::SelectBooleanConstant(
     TNode<BoolT> condition) {
-  return SelectConstant<Oddball>(condition, TrueConstant(), FalseConstant());
+  return SelectConstant<Boolean>(condition, TrueConstant(), FalseConstant());
 }
 
 TNode<Smi> CodeStubAssembler::SelectSmiConstant(TNode<BoolT> condition,
-                                                Smi true_value,
-                                                Smi false_value) {
+                                                Tagged<Smi> true_value,
+                                                Tagged<Smi> false_value) {
   return SelectConstant<Smi>(condition, SmiConstant(true_value),
                              SmiConstant(false_value));
 }
@@ -251,24 +251,23 @@ TNode<Smi> CodeStubAssembler::NoContextConstant() {
   return SmiConstant(Context::kNoContext);
 }
 
-#define HEAP_CONSTANT_ACCESSOR(rootIndexName, rootAccessorName, name)        \
-  TNode<std::remove_pointer<std::remove_reference<decltype(                  \
-      std::declval<Heap>().rootAccessorName())>::type>::type>                \
-      CodeStubAssembler::name##Constant() {                                  \
-    return UncheckedCast<std::remove_pointer<std::remove_reference<decltype( \
-        std::declval<Heap>().rootAccessorName())>::type>::type>(             \
-        LoadRoot(RootIndex::k##rootIndexName));                              \
+#define HEAP_CONSTANT_ACCESSOR(rootIndexName, rootAccessorName, name)          \
+  TNode<RemoveTagged<decltype(std::declval<Heap>().rootAccessorName())>::type> \
+      CodeStubAssembler::name##Constant() {                                    \
+    return UncheckedCast<RemoveTagged<                                         \
+        decltype(std::declval<Heap>().rootAccessorName())>::type>(             \
+        LoadRoot(RootIndex::k##rootIndexName));                                \
   }
 HEAP_MUTABLE_IMMOVABLE_OBJECT_LIST(HEAP_CONSTANT_ACCESSOR)
 #undef HEAP_CONSTANT_ACCESSOR
 
-#define HEAP_CONSTANT_ACCESSOR(rootIndexName, rootAccessorName, name)        \
-  TNode<std::remove_pointer<std::remove_reference<decltype(                  \
-      std::declval<ReadOnlyRoots>().rootAccessorName())>::type>::type>       \
-      CodeStubAssembler::name##Constant() {                                  \
-    return UncheckedCast<std::remove_pointer<std::remove_reference<decltype( \
-        std::declval<ReadOnlyRoots>().rootAccessorName())>::type>::type>(    \
-        LoadRoot(RootIndex::k##rootIndexName));                              \
+#define HEAP_CONSTANT_ACCESSOR(rootIndexName, rootAccessorName, name)       \
+  TNode<RemoveTagged<                                                       \
+      decltype(std::declval<ReadOnlyRoots>().rootAccessorName())>::type>    \
+      CodeStubAssembler::name##Constant() {                                 \
+    return UncheckedCast<RemoveTagged<                                      \
+        decltype(std::declval<ReadOnlyRoots>().rootAccessorName())>::type>( \
+        LoadRoot(RootIndex::k##rootIndexName));                             \
   }
 HEAP_IMMUTABLE_IMMOVABLE_OBJECT_LIST(HEAP_CONSTANT_ACCESSOR)
 #undef HEAP_CONSTANT_ACCESSOR
@@ -315,7 +314,7 @@ TNode<RawPtrT> CodeStubAssembler::IntPtrOrSmiConstant<RawPtrT>(int value) {
 
 bool CodeStubAssembler::TryGetIntPtrOrSmiConstantValue(
     TNode<Smi> maybe_constant, int* value) {
-  Smi smi_constant;
+  Tagged<Smi> smi_constant;
   if (TryToSmiConstant(maybe_constant, &smi_constant)) {
     *value = Smi::ToInt(smi_constant);
     return true;
@@ -358,6 +357,25 @@ TNode<BoolT> CodeStubAssembler::WordIsPowerOfTwo(TNode<IntPtrT> value) {
       IntPtrConstant(0));
 }
 
+TNode<BoolT> CodeStubAssembler::Float64AlmostEqual(TNode<Float64T> x,
+                                                   TNode<Float64T> y,
+                                                   double max_relative_error) {
+  TVARIABLE(BoolT, result, BoolConstant(true));
+  Label done(this);
+
+  GotoIf(Float64Equal(x, y), &done);
+  GotoIf(Float64LessThan(Float64Div(Float64Abs(Float64Sub(x, y)),
+                                    Float64Max(Float64Abs(x), Float64Abs(y))),
+                         Float64Constant(max_relative_error)),
+         &done);
+
+  result = BoolConstant(false);
+  Goto(&done);
+
+  BIND(&done);
+  return result.value();
+}
+
 TNode<Float64T> CodeStubAssembler::Float64Round(TNode<Float64T> x) {
   TNode<Float64T> one = Float64Constant(1.0);
   TNode<Float64T> one_half = Float64Constant(0.5);
@@ -895,8 +913,8 @@ TNode<IntPtrT> CodeStubAssembler::SmiUntag(TNode<Smi> value) {
   }
   TNode<IntPtrT> raw_bits = BitcastTaggedToWordForTagAndSmiBits(value);
   if (COMPRESS_POINTERS_BOOL) {
-    // Clear the upper half using sign-extension.
-    raw_bits = ChangeInt32ToIntPtr(TruncateIntPtrToInt32(raw_bits));
+    return ChangeInt32ToIntPtr(Word32SarShiftOutZeros(
+        TruncateIntPtrToInt32(raw_bits), SmiShiftBitsConstant32()));
   }
   return Signed(WordSarShiftOutZeros(raw_bits, SmiShiftBitsConstant()));
 }
@@ -911,6 +929,15 @@ TNode<Int32T> CodeStubAssembler::SmiToInt32(TNode<Smi> value) {
   return TruncateIntPtrToInt32(result);
 }
 
+TNode<Uint32T> CodeStubAssembler::PositiveSmiToUint32(TNode<Smi> value) {
+  DCHECK(SmiGreaterThanOrEqual(value, SmiConstant(0)));
+  return Unsigned(SmiToInt32(value));
+}
+
+TNode<IntPtrT> CodeStubAssembler::PositiveSmiUntag(TNode<Smi> value) {
+  return ChangePositiveInt32ToIntPtr(SmiToInt32(value));
+}
+
 TNode<Float64T> CodeStubAssembler::SmiToFloat64(TNode<Smi> value) {
   return ChangeInt32ToFloat64(SmiToInt32(value));
 }
@@ -1251,6 +1278,17 @@ TNode<Smi> CodeStubAssembler::SmiLexicographicCompare(TNode<Smi> x,
                             std::make_pair(MachineType::AnyTagged(), y)));
 }
 
+TNode<Object> CodeStubAssembler::GetCoverageInfo(
+    TNode<SharedFunctionInfo> sfi) {
+  TNode<ExternalReference> f =
+      ExternalConstant(ExternalReference::debug_get_coverage_info_function());
+  TNode<ExternalReference> isolate_ptr =
+      ExternalConstant(ExternalReference::isolate_address(isolate()));
+  return CAST(CallCFunction(f, MachineType::AnyTagged(),
+                            std::make_pair(MachineType::Pointer(), isolate_ptr),
+                            std::make_pair(MachineType::TaggedPointer(), sfi)));
+}
+
 TNode<Int32T> CodeStubAssembler::TruncateWordToInt32(TNode<WordT> value) {
   if (Is64()) {
     return TruncateInt64ToInt32(ReinterpretCast<Int64T>(value));
@@ -1376,23 +1414,17 @@ TNode<HeapObject> CodeStubAssembler::AllocateRaw(TNode<IntPtrT> size_in_bytes,
   Label runtime_call(this, Label::kDeferred), no_runtime_call(this), out(this);
 
   bool needs_double_alignment = flags & AllocationFlag::kDoubleAlignment;
-  bool allow_large_object_allocation =
-      flags & AllocationFlag::kAllowLargeObjectAllocation;
 
-  if (allow_large_object_allocation) {
-    Label next(this);
-    GotoIf(IsRegularHeapObjectSize(size_in_bytes), &next);
+  Label next(this);
+  GotoIf(IsRegularHeapObjectSize(size_in_bytes), &next);
 
-    TNode<Smi> runtime_flags = SmiConstant(Smi::FromInt(
-        AllocateDoubleAlignFlag::encode(needs_double_alignment) |
-        AllowLargeObjectAllocationFlag::encode(allow_large_object_allocation)));
-    result =
-        CallRuntime(Runtime::kAllocateInYoungGeneration, NoContextConstant(),
-                    SmiTag(size_in_bytes), runtime_flags);
-    Goto(&out);
+  TNode<Smi> runtime_flags = SmiConstant(
+      Smi::FromInt(AllocateDoubleAlignFlag::encode(needs_double_alignment)));
+  result = CallRuntime(Runtime::kAllocateInYoungGeneration, NoContextConstant(),
+                       SmiTag(size_in_bytes), runtime_flags);
+  Goto(&out);
 
-    BIND(&next);
-  }
+  BIND(&next);
 
   TVARIABLE(IntPtrT, adjusted_size, size_in_bytes);
 
@@ -1415,9 +1447,8 @@ TNode<HeapObject> CodeStubAssembler::AllocateRaw(TNode<IntPtrT> size_in_bytes,
 
   BIND(&runtime_call);
   {
-    TNode<Smi> runtime_flags = SmiConstant(Smi::FromInt(
-        AllocateDoubleAlignFlag::encode(needs_double_alignment) |
-        AllowLargeObjectAllocationFlag::encode(allow_large_object_allocation)));
+    TNode<Smi> runtime_flags = SmiConstant(
+        Smi::FromInt(AllocateDoubleAlignFlag::encode(needs_double_alignment)));
     if (flags & AllocationFlag::kPretenured) {
       result =
           CallRuntime(Runtime::kAllocateInOldGeneration, NoContextConstant(),
@@ -1508,22 +1539,9 @@ TNode<HeapObject> CodeStubAssembler::Allocate(TNode<IntPtrT> size_in_bytes,
   Comment("Allocate");
   if (v8_flags.single_generation) flags |= AllocationFlag::kPretenured;
   bool const new_space = !(flags & AllocationFlag::kPretenured);
-  bool const allow_large_objects =
-      flags & AllocationFlag::kAllowLargeObjectAllocation;
-  if (!allow_large_objects) {
-    intptr_t size_constant;
-    if (TryToIntPtrConstant(size_in_bytes, &size_constant)) {
-      CHECK_LE(size_constant, kMaxRegularHeapObjectSize);
-    } else {
-      CSA_DCHECK(this, IsRegularHeapObjectSize(size_in_bytes));
-    }
-  }
   if (!(flags & AllocationFlag::kDoubleAlignment)) {
-    return OptimizedAllocate(
-        size_in_bytes,
-        new_space ? AllocationType::kYoung : AllocationType::kOld,
-        allow_large_objects ? AllowLargeObjects::kTrue
-                            : AllowLargeObjects::kFalse);
+    return OptimizedAllocate(size_in_bytes, new_space ? AllocationType::kYoung
+                                                      : AllocationType::kOld);
   }
   TNode<ExternalReference> top_address = ExternalConstant(
       new_space
@@ -1736,14 +1754,16 @@ TNode<RawPtrT> CodeStubAssembler::LoadExternalPointerFromObject(
       ExternalPointerTableAddress(tag);
   TNode<RawPtrT> table = UncheckedCast<RawPtrT>(
       Load(MachineType::Pointer(), external_pointer_table_address,
-           UintPtrConstant(Internals::kExternalPointerTableBufferOffset)));
+           UintPtrConstant(Internals::kExternalPointerTableBasePointerOffset)));
 
   TNode<ExternalPointerHandleT> handle =
       LoadObjectField<ExternalPointerHandleT>(object, offset);
+
+  // Use UniqueUint32Constant instead of Uint32Constant here in order to ensure
+  // that the graph structure does not depend on the configuration-specific
+  // constant value (Uint32Constant uses cached nodes).
   TNode<Uint32T> index =
-      Word32Shr(handle, Uint32Constant(kExternalPointerIndexShift));
-  // TODO(v8:10391): consider updating ElementOffsetFromIndex to generate code
-  // that does one shift right instead of two shifts (right and then left).
+      Word32Shr(handle, UniqueUint32Constant(kExternalPointerIndexShift));
   TNode<IntPtrT> table_offset = ElementOffsetFromIndex(
       ChangeUint32ToWord(index), SYSTEM_POINTER_ELEMENTS, 0);
 
@@ -1765,14 +1785,15 @@ void CodeStubAssembler::StoreExternalPointerToObject(TNode<HeapObject> object,
       ExternalPointerTableAddress(tag);
   TNode<RawPtrT> table = UncheckedCast<RawPtrT>(
       Load(MachineType::Pointer(), external_pointer_table_address,
-           UintPtrConstant(Internals::kExternalPointerTableBufferOffset)));
-
+           UintPtrConstant(Internals::kExternalPointerTableBasePointerOffset)));
   TNode<ExternalPointerHandleT> handle =
       LoadObjectField<ExternalPointerHandleT>(object, offset);
+
+  // Use UniqueUint32Constant instead of Uint32Constant here in order to ensure
+  // that the graph structure does not depend on the configuration-specific
+  // constant value (Uint32Constant uses cached nodes).
   TNode<Uint32T> index =
-      Word32Shr(handle, Uint32Constant(kExternalPointerIndexShift));
-  // TODO(v8:10391): consider updating ElementOffsetFromIndex to generate code
-  // that does one shift right instead of two shifts (right and then left).
+      Word32Shr(handle, UniqueUint32Constant(kExternalPointerIndexShift));
   TNode<IntPtrT> table_offset = ElementOffsetFromIndex(
       ChangeUint32ToWord(index), SYSTEM_POINTER_ELEMENTS, 0);
 
@@ -1785,6 +1806,67 @@ void CodeStubAssembler::StoreExternalPointerToObject(TNode<HeapObject> object,
 #endif  // V8_ENABLE_SANDBOX
 }
 
+#ifdef V8_CODE_POINTER_SANDBOXING
+TNode<UintPtrT> CodeStubAssembler::ComputeCodePointerTableEntryOffset(
+    TNode<HeapObject> object, TNode<IntPtrT> field_offset) {
+  TNode<IndirectPointerHandleT> handle =
+      LoadObjectField<IndirectPointerHandleT>(object, field_offset);
+  // Use UniqueUint32Constant instead of Uint32Constant here in order to ensure
+  // that the graph structure does not depend on the configuration-specific
+  // constant value (Uint32Constant uses cached nodes).
+  TNode<Uint32T> index =
+      Word32Shr(handle, UniqueUint32Constant(kCodePointerHandleShift));
+  // We're using a 32-bit shift here to reduce code size, but for that we need
+  // to be sure that the offset will always fit into a 32-bit integer.
+  static_assert(kCodePointerTableReservationSize <= 4ULL * GB);
+  TNode<UintPtrT> offset = ChangeUint32ToWord(
+      Word32Shl(index, UniqueUint32Constant(kCodePointerTableEntrySizeLog2)));
+  return offset;
+}
+#endif  // V8_CODE_POINTER_SANDBOXING
+
+TNode<RawPtrT> CodeStubAssembler::LoadCodeEntrypointFromObject(
+    TNode<HeapObject> object, TNode<IntPtrT> field_offset) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  TNode<RawPtrT> table =
+      ExternalConstant(ExternalReference::code_pointer_table_address());
+  TNode<UintPtrT> offset =
+      ComputeCodePointerTableEntryOffset(object, field_offset);
+  return Load<RawPtrT>(table, offset);
+#else
+  return LoadObjectField<RawPtrT>(object, field_offset);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+TNode<HeapObject> CodeStubAssembler::LoadIndirectPointerFromObject(
+    TNode<HeapObject> object, int field_offset) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  TNode<RawPtrT> table =
+      ExternalConstant(ExternalReference::code_pointer_table_address());
+  TNode<UintPtrT> offset =
+      ComputeCodePointerTableEntryOffset(object, IntPtrConstant(field_offset));
+  offset = UintPtrAdd(offset,
+                      UintPtrConstant(kCodePointerTableEntryCodeObjectOffset));
+  TNode<UintPtrT> value = Load<UintPtrT>(table, offset);
+  // The LSB is used as marking bit by the code pointer table, so here we have
+  // to set it using a bitwise OR as it may or may not be set.
+  value =
+      UncheckedCast<UintPtrT>(WordOr(value, UintPtrConstant(kHeapObjectTag)));
+  return UncheckedCast<HeapObject>(BitcastWordToTagged(value));
+#else
+  UNREACHABLE();
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+TNode<HeapObject> CodeStubAssembler::LoadMaybeIndirectPointerFromObject(
+    TNode<HeapObject> object, int field_offset) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  return LoadIndirectPointerFromObject(object, field_offset);
+#else
+  return LoadObjectField<HeapObject>(object, field_offset);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
 TNode<Object> CodeStubAssembler::LoadFromParentFrame(int offset) {
   TNode<RawPtrT> frame_pointer = LoadParentFramePointer();
   return LoadFullTagged(frame_pointer, IntPtrConstant(offset));
@@ -1802,18 +1884,11 @@ TNode<Uint64T> CodeStubAssembler::LoadUint64Ptr(TNode<RawPtrT> ptr,
                 IntPtrMul(index, IntPtrConstant(sizeof(uint64_t)))));
 }
 
-TNode<IntPtrT> CodeStubAssembler::LoadAndUntagObjectField(
+TNode<IntPtrT> CodeStubAssembler::LoadAndUntagPositiveSmiObjectField(
     TNode<HeapObject> object, int offset) {
-  // Please use LoadMap(object) instead.
-  DCHECK_NE(offset, HeapObject::kMapOffset);
-  if (SmiValuesAre32Bits()) {
-#if V8_TARGET_LITTLE_ENDIAN
-    offset += 4;
-#endif
-    return ChangeInt32ToIntPtr(LoadObjectField<Int32T>(object, offset));
-  } else {
-    return SmiToIntPtr(LoadObjectField<Smi>(object, offset));
-  }
+  TNode<Int32T> value = LoadAndUntagToWord32ObjectField(object, offset);
+  CSA_DCHECK(this, Int32GreaterThanOrEqual(value, Int32Constant(0)));
+  return Signed(ChangeUint32ToWord(value));
 }
 
 TNode<Int32T> CodeStubAssembler::LoadAndUntagToWord32ObjectField(
@@ -1832,8 +1907,8 @@ TNode<Int32T> CodeStubAssembler::LoadAndUntagToWord32ObjectField(
 
 TNode<Float64T> CodeStubAssembler::LoadHeapNumberValue(
     TNode<HeapObject> object) {
-  CSA_DCHECK(this, Word32Or(IsHeapNumber(object), IsOddball(object)));
-  static_assert(HeapNumber::kValueOffset == Oddball::kToNumberRawOffset);
+  CSA_DCHECK(this, Word32Or(IsHeapNumber(object), IsTheHole(object)));
+  static_assert(HeapNumber::kValueOffset == Hole::kRawNumericValueOffset);
   return LoadObjectField<Float64T>(object, HeapNumber::kValueOffset);
 }
 
@@ -1920,12 +1995,17 @@ void CodeStubAssembler::GotoIfMapHasSlowProperties(TNode<Map> map,
 }
 
 TNode<HeapObject> CodeStubAssembler::LoadFastProperties(
-    TNode<JSReceiver> object) {
+    TNode<JSReceiver> object, bool skip_empty_check) {
   CSA_SLOW_DCHECK(this, Word32BinaryNot(IsDictionaryMap(LoadMap(object))));
   TNode<Object> properties = LoadJSReceiverPropertiesOrHash(object);
-  return Select<HeapObject>(
-      TaggedIsSmi(properties), [=] { return EmptyFixedArrayConstant(); },
-      [=] { return CAST(properties); });
+  if (skip_empty_check) {
+    return CAST(properties);
+  } else {
+    // TODO(ishell): use empty_property_array instead of empty_fixed_array here.
+    return Select<HeapObject>(
+        TaggedIsSmi(properties), [=] { return EmptyFixedArrayConstant(); },
+        [=] { return CAST(properties); });
+  }
 }
 
 TNode<HeapObject> CodeStubAssembler::LoadSlowProperties(
@@ -1982,13 +2062,23 @@ TNode<Smi> CodeStubAssembler::LoadFixedArrayBaseLength(
 
 TNode<IntPtrT> CodeStubAssembler::LoadAndUntagFixedArrayBaseLength(
     TNode<FixedArrayBase> array) {
-  return LoadAndUntagObjectField(array, FixedArrayBase::kLengthOffset);
+  return LoadAndUntagPositiveSmiObjectField(array,
+                                            FixedArrayBase::kLengthOffset);
+}
+
+TNode<Uint32T> CodeStubAssembler::LoadAndUntagFixedArrayBaseLengthAsUint32(
+    TNode<FixedArrayBase> array) {
+  TNode<Int32T> value =
+      LoadAndUntagToWord32ObjectField(array, FixedArrayBase::kLengthOffset);
+  CSA_DCHECK(this, Int32GreaterThanOrEqual(value, Int32Constant(0)));
+  return Unsigned(value);
 }
 
 TNode<IntPtrT> CodeStubAssembler::LoadFeedbackVectorLength(
     TNode<FeedbackVector> vector) {
-  return ChangeInt32ToIntPtr(
-      LoadObjectField<Int32T>(vector, FeedbackVector::kLengthOffset));
+  TNode<Int32T> length =
+      LoadObjectField<Int32T>(vector, FeedbackVector::kLengthOffset);
+  return ChangePositiveInt32ToIntPtr(length);
 }
 
 TNode<Smi> CodeStubAssembler::LoadWeakFixedArrayLength(
@@ -1998,7 +2088,16 @@ TNode<Smi> CodeStubAssembler::LoadWeakFixedArrayLength(
 
 TNode<IntPtrT> CodeStubAssembler::LoadAndUntagWeakFixedArrayLength(
     TNode<WeakFixedArray> array) {
-  return LoadAndUntagObjectField(array, WeakFixedArray::kLengthOffset);
+  return LoadAndUntagPositiveSmiObjectField(array,
+                                            WeakFixedArray::kLengthOffset);
+}
+
+TNode<Uint32T> CodeStubAssembler::LoadAndUntagWeakFixedArrayLengthAsUint32(
+    TNode<WeakFixedArray> array) {
+  TNode<Int32T> length =
+      LoadAndUntagToWord32ObjectField(array, WeakFixedArray::kLengthOffset);
+  CSA_DCHECK(this, Int32GreaterThanOrEqual(length, Int32Constant(0)));
+  return Unsigned(length);
 }
 
 TNode<Int32T> CodeStubAssembler::LoadNumberOfDescriptors(
@@ -2061,6 +2160,22 @@ TNode<IntPtrT> CodeStubAssembler::LoadMapInobjectPropertiesStartInWords(
       map, Map::kInobjectPropertiesStartOrConstructorFunctionIndexOffset));
 }
 
+TNode<IntPtrT> CodeStubAssembler::MapUsedInstanceSizeInWords(TNode<Map> map) {
+  TNode<IntPtrT> used_or_unused =
+      ChangeInt32ToIntPtr(LoadMapUsedOrUnusedInstanceSizeInWords(map));
+
+  return Select<IntPtrT>(
+      UintPtrGreaterThanOrEqual(used_or_unused,
+                                IntPtrConstant(JSObject::kFieldsAdded)),
+      [=] { return used_or_unused; },
+      [=] { return LoadMapInstanceSizeInWords(map); });
+}
+
+TNode<IntPtrT> CodeStubAssembler::MapUsedInObjectProperties(TNode<Map> map) {
+  return IntPtrSub(MapUsedInstanceSizeInWords(map),
+                   LoadMapInobjectPropertiesStartInWords(map));
+}
+
 TNode<IntPtrT> CodeStubAssembler::LoadMapConstructorFunctionIndex(
     TNode<Map> map) {
   // See Map::GetConstructorFunctionIndex() for details.
@@ -2091,9 +2206,9 @@ TNode<Object> CodeStubAssembler::LoadMapConstructor(TNode<Map> map) {
   return result.value();
 }
 
-TNode<WordT> CodeStubAssembler::LoadMapEnumLength(TNode<Map> map) {
+TNode<Uint32T> CodeStubAssembler::LoadMapEnumLength(TNode<Map> map) {
   TNode<Uint32T> bit_field3 = LoadMapBitField3(map);
-  return DecodeWordFromWord32<Map::Bits3::EnumLengthBits>(bit_field3);
+  return DecodeWord32<Map::Bits3::EnumLengthBits>(bit_field3);
 }
 
 TNode<Object> CodeStubAssembler::LoadMapBackPointer(TNode<Map> map) {
@@ -2117,9 +2232,9 @@ TNode<Uint32T> CodeStubAssembler::EnsureOnlyHasSimpleProperties(
   return bit_field3;
 }
 
-TNode<IntPtrT> CodeStubAssembler::LoadJSReceiverIdentityHash(
+TNode<Uint32T> CodeStubAssembler::LoadJSReceiverIdentityHash(
     TNode<JSReceiver> receiver, Label* if_no_hash) {
-  TVARIABLE(IntPtrT, var_hash);
+  TVARIABLE(Uint32T, var_hash);
   Label done(this), if_smi(this), if_property_array(this),
       if_swiss_property_dictionary(this), if_property_dictionary(this),
       if_fixed_array(this);
@@ -2143,43 +2258,44 @@ TNode<IntPtrT> CodeStubAssembler::LoadJSReceiverIdentityHash(
 
   BIND(&if_fixed_array);
   {
-    var_hash = IntPtrConstant(PropertyArray::kNoHashSentinel);
+    var_hash = Uint32Constant(PropertyArray::kNoHashSentinel);
     Goto(&done);
   }
 
   BIND(&if_smi);
   {
-    var_hash = SmiUntag(CAST(properties_or_hash));
+    var_hash = PositiveSmiToUint32(CAST(properties_or_hash));
     Goto(&done);
   }
 
   BIND(&if_property_array);
   {
-    TNode<IntPtrT> length_and_hash = LoadAndUntagObjectField(
+    TNode<Int32T> length_and_hash = LoadAndUntagToWord32ObjectField(
         properties, PropertyArray::kLengthAndHashOffset);
-    var_hash = Signed(DecodeWord<PropertyArray::HashField>(length_and_hash));
+    var_hash = DecodeWord32<PropertyArray::HashField>(length_and_hash);
     Goto(&done);
   }
   if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
     BIND(&if_swiss_property_dictionary);
     {
-      var_hash = Signed(
-          ChangeUint32ToWord(LoadSwissNameDictionaryHash(CAST(properties))));
+      var_hash = LoadSwissNameDictionaryHash(CAST(properties));
+      CSA_DCHECK(this, Uint32LessThanOrEqual(var_hash.value(),
+                                             Uint32Constant(Smi::kMaxValue)));
       Goto(&done);
     }
   }
 
   BIND(&if_property_dictionary);
   {
-    var_hash = SmiUntag(CAST(LoadFixedArrayElement(
+    var_hash = PositiveSmiToUint32(CAST(LoadFixedArrayElement(
         CAST(properties), NameDictionary::kObjectHashIndex)));
     Goto(&done);
   }
 
   BIND(&done);
   if (if_no_hash != nullptr) {
-    GotoIf(IntPtrEqual(var_hash.value(),
-                       IntPtrConstant(PropertyArray::kNoHashSentinel)),
+    GotoIf(Word32Equal(var_hash.value(),
+                       Uint32Constant(PropertyArray::kNoHashSentinel)),
            if_no_hash);
   }
   return var_hash.value();
@@ -2484,7 +2600,7 @@ void CodeStubAssembler::FixedArrayBoundsCheck(TNode<FixedArrayBase> array,
   if (!v8_flags.fixed_array_bounds_checks) return;
   DCHECK(IsAligned(additional_offset, kTaggedSize));
   TNode<Smi> effective_index;
-  Smi constant_index;
+  Tagged<Smi> constant_index;
   bool index_is_constant = TryToSmiConstant(index, &constant_index);
   if (index_is_constant) {
     effective_index = SmiConstant(Smi::ToInt(constant_index) +
@@ -2517,9 +2633,10 @@ TNode<Object> CodeStubAssembler::LoadPropertyArrayElement(
 
 TNode<IntPtrT> CodeStubAssembler::LoadPropertyArrayLength(
     TNode<PropertyArray> object) {
-  TNode<IntPtrT> value =
-      LoadAndUntagObjectField(object, PropertyArray::kLengthAndHashOffset);
-  return Signed(DecodeWord<PropertyArray::LengthField>(value));
+  TNode<Int32T> value = LoadAndUntagToWord32ObjectField(
+      object, PropertyArray::kLengthAndHashOffset);
+  return Signed(
+      ChangeUint32ToWord(DecodeWord32<PropertyArray::LengthField>(value)));
 }
 
 TNode<RawPtrT> CodeStubAssembler::LoadJSTypedArrayDataPtr(
@@ -2982,16 +3099,16 @@ TNode<ScopeInfo> CodeStubAssembler::LoadScopeInfo(TNode<Context> context) {
 
 TNode<BoolT> CodeStubAssembler::LoadScopeInfoHasExtensionField(
     TNode<ScopeInfo> scope_info) {
-  TNode<IntPtrT> value =
-      LoadAndUntagObjectField(scope_info, ScopeInfo::kFlagsOffset);
-  return IsSetWord<ScopeInfo::HasContextExtensionSlotBit>(value);
+  TNode<Int32T> value =
+      LoadAndUntagToWord32ObjectField(scope_info, ScopeInfo::kFlagsOffset);
+  return IsSetWord32<ScopeInfo::HasContextExtensionSlotBit>(value);
 }
 
 TNode<BoolT> CodeStubAssembler::LoadScopeInfoClassScopeHasPrivateBrand(
     TNode<ScopeInfo> scope_info) {
-  TNode<IntPtrT> value =
-      LoadAndUntagObjectField(scope_info, ScopeInfo::kFlagsOffset);
-  return IsSetWord<ScopeInfo::ClassScopeHasPrivateBrandBit>(value);
+  TNode<Int32T> value =
+      LoadAndUntagToWord32ObjectField(scope_info, ScopeInfo::kFlagsOffset);
+  return IsSetWord32<ScopeInfo::ClassScopeHasPrivateBrandBit>(value);
 }
 
 void CodeStubAssembler::StoreContextElementNoWriteBarrier(
@@ -3062,6 +3179,19 @@ TNode<Map> CodeStubAssembler::LoadObjectFunctionInitialMap(
   return CAST(LoadJSFunctionPrototypeOrInitialMap(object_function));
 }
 
+TNode<Map> CodeStubAssembler::LoadCachedMap(TNode<NativeContext> native_context,
+                                            TNode<IntPtrT> number_of_properties,
+                                            Label* runtime) {
+  CSA_DCHECK(this, UintPtrLessThan(number_of_properties,
+                                   IntPtrConstant(JSObject::kMapCacheSize)));
+  TNode<WeakFixedArray> cache =
+      CAST(LoadContextElement(native_context, Context::MAP_CACHE_INDEX));
+  TNode<MaybeObject> value =
+      LoadWeakFixedArrayElement(cache, number_of_properties, 0);
+  TNode<Map> result = CAST(GetHeapObjectAssumeWeak(value, runtime));
+  return result;
+}
+
 TNode<Map> CodeStubAssembler::LoadSlowObjectWithNullPrototypeMap(
     TNode<NativeContext> native_context) {
   TNode<Map> map = CAST(LoadContextElement(
@@ -3157,6 +3287,11 @@ TNode<HeapObject> CodeStubAssembler::LoadJSFunctionPrototype(
   return var_result.value();
 }
 
+TNode<Code> CodeStubAssembler::LoadJSFunctionCode(TNode<JSFunction> function) {
+  return UncheckedCast<Code>(
+      LoadMaybeIndirectPointerFromObject(function, JSFunction::kCodeOffset));
+}
+
 TNode<BytecodeArray> CodeStubAssembler::LoadSharedFunctionInfoBytecodeArray(
     TNode<SharedFunctionInfo> shared) {
   TNode<HeapObject> function_data = LoadObjectField<HeapObject>(
@@ -3237,6 +3372,38 @@ void CodeStubAssembler::StoreObjectField(TNode<HeapObject> object,
   }
 }
 
+void CodeStubAssembler::StoreIndirectPointerField(TNode<HeapObject> object,
+                                                  int offset,
+                                                  TNode<Code> value) {
+  DCHECK(V8_CODE_POINTER_SANDBOXING_BOOL);
+  OptimizedStoreIndirectPointerField(object, offset, value);
+}
+
+void CodeStubAssembler::StoreIndirectPointerFieldNoWriteBarrier(
+    TNode<HeapObject> object, int offset, TNode<Code> value) {
+  DCHECK(V8_CODE_POINTER_SANDBOXING_BOOL);
+  OptimizedStoreIndirectPointerFieldNoWriteBarrier(object, offset, value);
+}
+
+void CodeStubAssembler::StoreMaybeIndirectPointerField(TNode<HeapObject> object,
+                                                       int offset,
+                                                       TNode<Code> value) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  StoreIndirectPointerField(object, offset, value);
+#else
+  StoreObjectField(object, offset, value);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+void CodeStubAssembler::StoreMaybeIndirectPointerFieldNoWriteBarrier(
+    TNode<HeapObject> object, int offset, TNode<Code> value) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  StoreIndirectPointerFieldNoWriteBarrier(object, offset, value);
+#else
+  StoreObjectFieldNoWriteBarrier(object, offset, value);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
 void CodeStubAssembler::UnsafeStoreObjectFieldNoWriteBarrier(
     TNode<HeapObject> object, int offset, TNode<Object> value) {
   DCHECK_NE(HeapObject::kMapOffset, offset);  // Use StoreMap instead.
@@ -3322,14 +3489,14 @@ void CodeStubAssembler::StoreFixedArrayOrPropertyArrayElement(
           Select<IntPtrT>(
               IsPropertyArray(object),
               [=] {
-                TNode<IntPtrT> length_and_hash = LoadAndUntagObjectField(
+                TNode<Int32T> length_and_hash = LoadAndUntagToWord32ObjectField(
                     object, PropertyArray::kLengthAndHashOffset);
-                return Signed(
-                    DecodeWord<PropertyArray::LengthField>(length_and_hash));
+                return Signed(ChangeUint32ToWord(
+                    DecodeWord32<PropertyArray::LengthField>(length_and_hash)));
               },
               [=] {
-                return LoadAndUntagObjectField(object,
-                                               FixedArrayBase::kLengthOffset);
+                return LoadAndUntagPositiveSmiObjectField(
+                    object, FixedArrayBase::kLengthOffset);
               }),
           FixedArray::kHeaderSize));
   if (barrier_mode == SKIP_WRITE_BARRIER) {
@@ -3605,8 +3772,7 @@ TNode<BigInt> CodeStubAssembler::AllocateRawBigInt(TNode<IntPtrT> length) {
   TNode<IntPtrT> size =
       IntPtrAdd(IntPtrConstant(BigInt::kHeaderSize),
                 Signed(WordShl(length, kSystemPointerSizeLog2)));
-  TNode<HeapObject> raw_result =
-      Allocate(size, AllocationFlag::kAllowLargeObjectAllocation);
+  TNode<HeapObject> raw_result = Allocate(size);
   StoreMapNoWriteBarrier(raw_result, RootIndex::kBigIntMap);
   if (FIELD_SIZE(BigInt::kOptionalPaddingOffset) != 0) {
     DCHECK_EQ(4, FIELD_SIZE(BigInt::kOptionalPaddingOffset));
@@ -3751,8 +3917,8 @@ TNode<String> CodeStubAssembler::AllocateSeqOneByteString(
                       IntPtrConstant(SeqOneByteString::SizeFor(length) -
                                      kObjectAlignment - kHeapObjectTag),
                       SmiConstant(0));
-  DCHECK(RootsTable::IsImmortalImmovable(RootIndex::kOneByteStringMap));
-  StoreMapNoWriteBarrier(result, RootIndex::kOneByteStringMap);
+  DCHECK(RootsTable::IsImmortalImmovable(RootIndex::kSeqOneByteStringMap));
+  StoreMapNoWriteBarrier(result, RootIndex::kSeqOneByteStringMap);
   StoreObjectFieldNoWriteBarrier(result, SeqOneByteString::kLengthOffset,
                                  Uint32Constant(length));
   StoreObjectFieldNoWriteBarrier(result, SeqOneByteString::kRawHashFieldOffset,
@@ -3777,8 +3943,8 @@ TNode<String> CodeStubAssembler::AllocateSeqTwoByteString(
                       IntPtrConstant(SeqTwoByteString::SizeFor(length) -
                                      kObjectAlignment - kHeapObjectTag),
                       SmiConstant(0));
-  DCHECK(RootsTable::IsImmortalImmovable(RootIndex::kStringMap));
-  StoreMapNoWriteBarrier(result, RootIndex::kStringMap);
+  DCHECK(RootsTable::IsImmortalImmovable(RootIndex::kSeqTwoByteStringMap));
+  StoreMapNoWriteBarrier(result, RootIndex::kSeqTwoByteStringMap);
   StoreObjectFieldNoWriteBarrier(result, SeqTwoByteString::kLengthOffset,
                                  Uint32Constant(length));
   StoreObjectFieldNoWriteBarrier(result, SeqTwoByteString::kRawHashFieldOffset,
@@ -3791,7 +3957,7 @@ TNode<String> CodeStubAssembler::AllocateSlicedString(RootIndex map_root_index,
                                                       TNode<String> parent,
                                                       TNode<Smi> offset) {
   DCHECK(map_root_index == RootIndex::kSlicedOneByteStringMap ||
-         map_root_index == RootIndex::kSlicedStringMap);
+         map_root_index == RootIndex::kSlicedTwoByteStringMap);
   TNode<HeapObject> result = Allocate(SlicedString::kSize);
   DCHECK(RootsTable::IsImmortalImmovable(map_root_index));
   StoreMapNoWriteBarrier(result, map_root_index);
@@ -3811,8 +3977,8 @@ TNode<String> CodeStubAssembler::AllocateSlicedOneByteString(
 
 TNode<String> CodeStubAssembler::AllocateSlicedTwoByteString(
     TNode<Uint32T> length, TNode<String> parent, TNode<Smi> offset) {
-  return AllocateSlicedString(RootIndex::kSlicedStringMap, length, parent,
-                              offset);
+  return AllocateSlicedString(RootIndex::kSlicedTwoByteStringMap, length,
+                              parent, offset);
 }
 
 TNode<NameDictionary> CodeStubAssembler::AllocateNameDictionary(
@@ -3880,7 +4046,7 @@ TNode<NameDictionary> CodeStubAssembler::AllocateNameDictionaryWithCapacity(
     TNode<IntPtrT> end_address = IntPtrAdd(
         result_word, IntPtrSub(store_size, IntPtrConstant(kHeapObjectTag)));
 
-    TNode<Oddball> filler = UndefinedConstant();
+    TNode<Undefined> filler = UndefinedConstant();
     DCHECK(RootsTable::IsImmortalImmovable(RootIndex::kUndefinedValue));
 
     StoreFieldsNoWriteBarrier(start_address, end_address, filler);
@@ -3892,14 +4058,15 @@ TNode<NameDictionary> CodeStubAssembler::AllocateNameDictionaryWithCapacity(
 TNode<NameDictionary> CodeStubAssembler::CopyNameDictionary(
     TNode<NameDictionary> dictionary, Label* large_object_fallback) {
   Comment("Copy boilerplate property dict");
-  TNode<IntPtrT> capacity = SmiUntag(GetCapacity<NameDictionary>(dictionary));
+  TNode<IntPtrT> capacity =
+      PositiveSmiUntag(GetCapacity<NameDictionary>(dictionary));
   CSA_DCHECK(this, IntPtrGreaterThanOrEqual(capacity, IntPtrConstant(0)));
   GotoIf(UintPtrGreaterThan(
              capacity, IntPtrConstant(NameDictionary::kMaxRegularCapacity)),
          large_object_fallback);
   TNode<NameDictionary> properties =
       AllocateNameDictionaryWithCapacity(capacity);
-  TNode<IntPtrT> length = SmiUntag(LoadFixedArrayBaseLength(dictionary));
+  TNode<IntPtrT> length = LoadAndUntagFixedArrayBaseLength(dictionary);
   CopyFixedArrayElements(PACKED_ELEMENTS, dictionary, properties, length,
                          SKIP_WRITE_BARRIER);
   return properties;
@@ -3939,9 +4106,9 @@ TNode<CollectionType> CodeStubAssembler::AllocateOrderedHashTableWithCapacity(
   const ElementsKind elements_kind = HOLEY_ELEMENTS;
   TNode<Map> fixed_array_map =
       HeapConstant(CollectionType::GetMap(ReadOnlyRoots(isolate())));
-  TNode<CollectionType> table = CAST(AllocateFixedArray(
-      elements_kind, fixed_array_length,
-      AllocationFlag::kAllowLargeObjectAllocation, fixed_array_map));
+  TNode<CollectionType> table =
+      CAST(AllocateFixedArray(elements_kind, fixed_array_length,
+                              AllocationFlag::kNone, fixed_array_map));
 
   Comment("Initialize the OrderedHashTable fields.");
   const WriteBarrierMode barrier_mode = SKIP_WRITE_BARRIER;
@@ -4091,11 +4258,14 @@ void CodeStubAssembler::InitializeJSObjectFromMap(
     StoreObjectFieldNoWriteBarrier(object, JSObject::kElementsOffset,
                                    *elements);
   }
-  if (slack_tracking_mode == kNoSlackTracking) {
-    InitializeJSObjectBodyNoSlackTracking(object, map, instance_size);
-  } else {
-    DCHECK_EQ(slack_tracking_mode, kWithSlackTracking);
-    InitializeJSObjectBodyWithSlackTracking(object, map, instance_size);
+  switch (slack_tracking_mode) {
+    case SlackTrackingMode::kDontInitializeInObjectProperties:
+      return;
+    case kNoSlackTracking:
+      return InitializeJSObjectBodyNoSlackTracking(object, map, instance_size);
+    case kWithSlackTracking:
+      return InitializeJSObjectBodyWithSlackTracking(object, map,
+                                                     instance_size);
   }
 }
 
@@ -4133,8 +4303,6 @@ void CodeStubAssembler::InitializeJSObjectBodyWithSlackTracking(
     TNode<Word32T> new_bit_field3 = Int32Sub(
         bit_field3,
         Int32Constant(1 << Map::Bits3::ConstructionCounterBits::kShift));
-    StoreObjectFieldNoWriteBarrier(map, Map::kBitField3Offset, new_bit_field3);
-    static_assert(Map::kSlackTrackingCounterEnd == 1);
 
     // The object still has in-object slack therefore the |unsed_or_unused|
     // field contain the "used" value.
@@ -4142,7 +4310,7 @@ void CodeStubAssembler::InitializeJSObjectBodyWithSlackTracking(
         Signed(TimesTaggedSize(ChangeUint32ToWord(LoadObjectField<Uint8T>(
             map, Map::kUsedOrUnusedInstanceSizeInWordsOffset))));
 
-    Comment("iInitialize filler fields");
+    Comment("Initialize filler fields");
     InitializeFieldsWithRoot(object, used_size, instance_size,
                              RootIndex::kOnePointerFillerMap);
 
@@ -4153,6 +4321,14 @@ void CodeStubAssembler::InitializeJSObjectBodyWithSlackTracking(
     static_assert(Map::kNoSlackTracking == 0);
     GotoIf(IsClearWord32<Map::Bits3::ConstructionCounterBits>(new_bit_field3),
            &complete);
+
+    // Setting ConstructionCounterBits to 0 requires taking the
+    // map_updater_access mutex, which we can't do from CSA, so we only manually
+    // update ConstructionCounterBits when its result is non-zero; otherwise we
+    // let the runtime do it (with the GotoIf right above this comment).
+    StoreObjectFieldNoWriteBarrier(map, Map::kBitField3Offset, new_bit_field3);
+    static_assert(Map::kSlackTrackingCounterEnd == 1);
+
     Goto(&end);
   }
 
@@ -4268,7 +4444,6 @@ CodeStubAssembler::AllocateUninitializedJSArrayWithElements(
     TNode<IntPtrT> capacity, AllocationFlags allocation_flags,
     int array_header_size) {
   Comment("begin allocation of JSArray with elements");
-  CHECK_EQ(allocation_flags & ~AllocationFlag::kAllowLargeObjectAllocation, 0);
   CSA_SLOW_DCHECK(this, TaggedIsPositiveSmi(length));
 
   TVARIABLE(JSArray, array);
@@ -4319,32 +4494,31 @@ CodeStubAssembler::AllocateUninitializedJSArrayWithElements(
     // folding trick. Instead, we first allocate the elements in large object
     // space, and then allocate the JSArray (and possibly the allocation
     // memento) in new space.
-    if (allocation_flags & AllocationFlag::kAllowLargeObjectAllocation) {
-      Label next(this);
-      GotoIf(IsRegularHeapObjectSize(size), &next);
+    Label next(this);
+    GotoIf(IsRegularHeapObjectSize(size), &next);
 
-      CSA_CHECK(this, IsValidFastJSArrayCapacity(capacity));
+    CSA_CHECK(this, IsValidFastJSArrayCapacity(capacity));
 
-      // Allocate and initialize the elements first. Full initialization is
-      // needed because the upcoming JSArray allocation could trigger GC.
-      elements = AllocateFixedArray(kind, capacity, allocation_flags);
+    // Allocate and initialize the elements first. Full initialization is
+    // needed because the upcoming JSArray allocation could trigger GC.
+    elements = AllocateFixedArray(kind, capacity, allocation_flags);
 
-      if (IsDoubleElementsKind(kind)) {
-        FillEntireFixedDoubleArrayWithZero(CAST(elements.value()), capacity);
-      } else {
-        FillEntireFixedArrayWithSmiZero(kind, CAST(elements.value()), capacity);
-      }
+    if (IsDoubleElementsKind(kind)) {
+      FillEntireFixedDoubleArrayWithZero(CAST(elements.value()), capacity);
+    } else {
+      FillEntireFixedArrayWithSmiZero(kind, CAST(elements.value()), capacity);
+    }
 
-      // The JSArray and possibly allocation memento next. Note that
-      // allocation_flags are *not* passed on here and the resulting JSArray
-      // will always be in new space.
-      array = AllocateJSArray(array_map, elements.value(), length,
-                              allocation_site, array_header_size);
+    // The JSArray and possibly allocation memento next. Note that
+    // allocation_flags are *not* passed on here and the resulting JSArray
+    // will always be in new space.
+    array = AllocateJSArray(array_map, elements.value(), length,
+                            allocation_site, array_header_size);
 
-      Goto(&out);
+    Goto(&out);
+
+    BIND(&next);
 
-      BIND(&next);
-    }
     // Fold all objects into a single new space allocation.
     array =
         AllocateUninitializedJSArray(array_map, length, allocation_site, size);
@@ -4800,7 +4974,7 @@ TNode<FixedArrayBase> CodeStubAssembler::ExtractFixedArray(
       var_holes_converted != nullptr ? HoleConversionMode::kConvertToUndefined
                                      : HoleConversionMode::kDontConvert;
   TVARIABLE(FixedArrayBase, var_result);
-  auto allocation_flags = AllocationFlag::kAllowLargeObjectAllocation;
+  auto allocation_flags = AllocationFlag::kNone;
   if (!first) {
     first = IntPtrOrSmiConstant<TIndex>(0);
   }
@@ -4919,7 +5093,7 @@ void CodeStubAssembler::FillPropertyArrayWithUndefined(
     TNode<PropertyArray> array, TNode<IntPtrT> from_index,
     TNode<IntPtrT> to_index) {
   ElementsKind kind = PACKED_ELEMENTS;
-  TNode<Oddball> value = UndefinedConstant();
+  TNode<Undefined> value = UndefinedConstant();
   BuildFastArrayForEach(
       array, kind, from_index, to_index,
       [this, value](TNode<HeapObject> array, TNode<IntPtrT> offset) {
@@ -5732,7 +5906,7 @@ TNode<Word32T> CodeStubAssembler::TruncateTaggedToWord32(TNode<Context> context,
   TVARIABLE(Word32T, var_result);
   Label done(this);
   TaggedToWord32OrBigIntImpl<Object::Conversion::kToNumber>(
-      context, value, &done, &var_result, IsKnownTaggedPointer::kNo);
+      context, value, &done, &var_result, IsKnownTaggedPointer::kNo, {});
   BIND(&done);
   return var_result.value();
 }
@@ -5744,7 +5918,7 @@ void CodeStubAssembler::TaggedToWord32OrBigInt(
     TVariable<Word32T>* var_word32, Label* if_bigint, Label* if_bigint64,
     TVariable<BigInt>* var_maybe_bigint) {
   TaggedToWord32OrBigIntImpl<Object::Conversion::kToNumeric>(
-      context, value, if_number, var_word32, IsKnownTaggedPointer::kNo,
+      context, value, if_number, var_word32, IsKnownTaggedPointer::kNo, {},
       if_bigint, if_bigint64, var_maybe_bigint);
 }
 
@@ -5754,10 +5928,10 @@ void CodeStubAssembler::TaggedToWord32OrBigInt(
 void CodeStubAssembler::TaggedToWord32OrBigIntWithFeedback(
     TNode<Context> context, TNode<Object> value, Label* if_number,
     TVariable<Word32T>* var_word32, Label* if_bigint, Label* if_bigint64,
-    TVariable<BigInt>* var_maybe_bigint, TVariable<Smi>* var_feedback) {
+    TVariable<BigInt>* var_maybe_bigint, const FeedbackValues& feedback) {
   TaggedToWord32OrBigIntImpl<Object::Conversion::kToNumeric>(
       context, value, if_number, var_word32, IsKnownTaggedPointer::kNo,
-      if_bigint, if_bigint64, var_maybe_bigint, var_feedback);
+      feedback, if_bigint, if_bigint64, var_maybe_bigint);
 }
 
 // Truncate {pointer} to word32 and jump to {if_number} if it is a Number,
@@ -5766,31 +5940,36 @@ void CodeStubAssembler::TaggedToWord32OrBigIntWithFeedback(
 void CodeStubAssembler::TaggedPointerToWord32OrBigIntWithFeedback(
     TNode<Context> context, TNode<HeapObject> pointer, Label* if_number,
     TVariable<Word32T>* var_word32, Label* if_bigint, Label* if_bigint64,
-    TVariable<BigInt>* var_maybe_bigint, TVariable<Smi>* var_feedback) {
+    TVariable<BigInt>* var_maybe_bigint, const FeedbackValues& feedback) {
   TaggedToWord32OrBigIntImpl<Object::Conversion::kToNumeric>(
       context, pointer, if_number, var_word32, IsKnownTaggedPointer::kYes,
-      if_bigint, if_bigint64, var_maybe_bigint, var_feedback);
+      feedback, if_bigint, if_bigint64, var_maybe_bigint);
 }
 
 template <Object::Conversion conversion>
 void CodeStubAssembler::TaggedToWord32OrBigIntImpl(
     TNode<Context> context, TNode<Object> value, Label* if_number,
     TVariable<Word32T>* var_word32,
-    IsKnownTaggedPointer is_known_tagged_pointer, Label* if_bigint,
-    Label* if_bigint64, TVariable<BigInt>* var_maybe_bigint,
-    TVariable<Smi>* var_feedback) {
+    IsKnownTaggedPointer is_known_tagged_pointer,
+    const FeedbackValues& feedback, Label* if_bigint, Label* if_bigint64,
+    TVariable<BigInt>* var_maybe_bigint) {
   // We might need to loop after conversion.
   TVARIABLE(Object, var_value, value);
-  OverwriteFeedback(var_feedback, BinaryOperationFeedback::kNone);
+  TVARIABLE(Object, var_exception);
+  OverwriteFeedback(feedback.var_feedback, BinaryOperationFeedback::kNone);
   VariableList loop_vars({&var_value}, zone());
-  if (var_feedback != nullptr) loop_vars.push_back(var_feedback);
+  if (feedback.var_feedback != nullptr) {
+    loop_vars.push_back(feedback.var_feedback);
+  }
   Label loop(this, loop_vars);
+  Label if_exception(this, Label::kDeferred);
   if (is_known_tagged_pointer == IsKnownTaggedPointer::kNo) {
     GotoIf(TaggedIsNotSmi(value), &loop);
 
     // {value} is a Smi.
     *var_word32 = SmiToInt32(CAST(value));
-    CombineFeedback(var_feedback, BinaryOperationFeedback::kSignedSmall);
+    CombineFeedback(feedback.var_feedback,
+                    BinaryOperationFeedback::kSignedSmall);
     Goto(if_number);
   } else {
     Goto(&loop);
@@ -5815,11 +5994,11 @@ void CodeStubAssembler::TaggedToWord32OrBigIntImpl(
 
     // Not HeapNumber (or BigInt if conversion == kToNumeric).
     {
-      if (var_feedback != nullptr) {
+      if (feedback.var_feedback != nullptr) {
         // We do not require an Or with earlier feedback here because once we
         // convert the value to a Numeric, we cannot reach this path. We can
         // only reach this path on the first pass when the feedback is kNone.
-        CSA_DCHECK(this, SmiEqual(var_feedback->value(),
+        CSA_DCHECK(this, SmiEqual(feedback.var_feedback->value(),
                                   SmiConstant(BinaryOperationFeedback::kNone)));
       }
       GotoIf(InstanceTypeEqual(instance_type, ODDBALL_TYPE), &is_oddball);
@@ -5827,20 +6006,36 @@ void CodeStubAssembler::TaggedToWord32OrBigIntImpl(
       auto builtin = conversion == Object::Conversion::kToNumeric
                          ? Builtin::kNonNumberToNumeric
                          : Builtin::kNonNumberToNumber;
-      var_value = CallBuiltin(builtin, context, value);
-      OverwriteFeedback(var_feedback, BinaryOperationFeedback::kAny);
+      if (feedback.var_feedback != nullptr) {
+        ScopedExceptionHandler handler(this, &if_exception, &var_exception);
+        var_value = CallBuiltin(builtin, context, value);
+      } else {
+        var_value = CallBuiltin(builtin, context, value);
+      }
+      OverwriteFeedback(feedback.var_feedback, BinaryOperationFeedback::kAny);
       Goto(&check_if_smi);
 
+      if (feedback.var_feedback != nullptr) {
+        BIND(&if_exception);
+        DCHECK(feedback.slot != nullptr);
+        DCHECK(feedback.maybe_feedback_vector != nullptr);
+        UpdateFeedback(SmiConstant(BinaryOperationFeedback::kAny),
+                       (*feedback.maybe_feedback_vector)(), *feedback.slot,
+                       feedback.update_mode);
+        CallRuntime(Runtime::kReThrow, context, var_exception.value());
+        Unreachable();
+      }
+
       BIND(&is_oddball);
       var_value = LoadObjectField(value_heap_object, Oddball::kToNumberOffset);
-      OverwriteFeedback(var_feedback,
+      OverwriteFeedback(feedback.var_feedback,
                         BinaryOperationFeedback::kNumberOrOddball);
       Goto(&check_if_smi);
     }
 
     BIND(&is_heap_number);
     *var_word32 = TruncateHeapNumberValueToWord32(CAST(value));
-    CombineFeedback(var_feedback, BinaryOperationFeedback::kNumber);
+    CombineFeedback(feedback.var_feedback, BinaryOperationFeedback::kNumber);
     Goto(if_number);
 
     if (conversion == Object::Conversion::kToNumeric) {
@@ -5850,7 +6045,8 @@ void CodeStubAssembler::TaggedToWord32OrBigIntImpl(
         if (var_maybe_bigint) {
           *var_maybe_bigint = CAST(value);
         }
-        CombineFeedback(var_feedback, BinaryOperationFeedback::kBigInt64);
+        CombineFeedback(feedback.var_feedback,
+                        BinaryOperationFeedback::kBigInt64);
         Goto(if_bigint64);
       }
 
@@ -5858,7 +6054,7 @@ void CodeStubAssembler::TaggedToWord32OrBigIntImpl(
       if (var_maybe_bigint) {
         *var_maybe_bigint = CAST(value);
       }
-      CombineFeedback(var_feedback, BinaryOperationFeedback::kBigInt);
+      CombineFeedback(feedback.var_feedback, BinaryOperationFeedback::kBigInt);
       Goto(if_bigint);
     }
 
@@ -5868,7 +6064,8 @@ void CodeStubAssembler::TaggedToWord32OrBigIntImpl(
 
     // {value} is a Smi.
     *var_word32 = SmiToInt32(CAST(value));
-    CombineFeedback(var_feedback, BinaryOperationFeedback::kSignedSmall);
+    CombineFeedback(feedback.var_feedback,
+                    BinaryOperationFeedback::kSignedSmall);
     Goto(if_number);
   }
 }
@@ -5895,107 +6092,89 @@ TNode<Int32T> CodeStubAssembler::TruncateHeapNumberValueToWord32(
   return Signed(TruncateFloat64ToWord32(value));
 }
 
-void CodeStubAssembler::TryHeapNumberToSmi(TNode<HeapNumber> number,
-                                           TVariable<Smi>* var_result_smi,
-                                           Label* if_smi) {
+TNode<Smi> CodeStubAssembler::TryHeapNumberToSmi(TNode<HeapNumber> number,
+                                                 Label* not_smi) {
   TNode<Float64T> value = LoadHeapNumberValue(number);
-  TryFloat64ToSmi(value, var_result_smi, if_smi);
+  return TryFloat64ToSmi(value, not_smi);
 }
 
-void CodeStubAssembler::TryFloat32ToSmi(TNode<Float32T> value,
-                                        TVariable<Smi>* var_result_smi,
-                                        Label* if_smi) {
+TNode<Smi> CodeStubAssembler::TryFloat32ToSmi(TNode<Float32T> value,
+                                              Label* not_smi) {
   TNode<Int32T> ivalue = TruncateFloat32ToInt32(value);
   TNode<Float32T> fvalue = RoundInt32ToFloat32(ivalue);
 
-  Label if_int32(this), if_heap_number(this);
+  Label if_int32(this);
 
-  GotoIfNot(Float32Equal(value, fvalue), &if_heap_number);
+  GotoIfNot(Float32Equal(value, fvalue), not_smi);
   GotoIfNot(Word32Equal(ivalue, Int32Constant(0)), &if_int32);
+  // if (value == -0.0)
   Branch(Int32LessThan(UncheckedCast<Int32T>(BitcastFloat32ToInt32(value)),
                        Int32Constant(0)),
-         &if_heap_number, &if_int32);
+         not_smi, &if_int32);
 
-  TVARIABLE(Number, var_result);
   BIND(&if_int32);
-  {
-    if (SmiValuesAre32Bits()) {
-      *var_result_smi = SmiTag(ChangeInt32ToIntPtr(ivalue));
-    } else {
-      DCHECK(SmiValuesAre31Bits());
-      TNode<PairT<Int32T, BoolT>> pair = Int32AddWithOverflow(ivalue, ivalue);
-      TNode<BoolT> overflow = Projection<1>(pair);
-      GotoIf(overflow, &if_heap_number);
-      *var_result_smi =
-          BitcastWordToTaggedSigned(ChangeInt32ToIntPtr(Projection<0>(pair)));
-    }
-    Goto(if_smi);
+  if (SmiValuesAre32Bits()) {
+    return SmiTag(ChangeInt32ToIntPtr(ivalue));
+  } else {
+    DCHECK(SmiValuesAre31Bits());
+    TNode<PairT<Int32T, BoolT>> pair = Int32AddWithOverflow(ivalue, ivalue);
+    TNode<BoolT> overflow = Projection<1>(pair);
+    GotoIf(overflow, not_smi);
+    return BitcastWordToTaggedSigned(ChangeInt32ToIntPtr(Projection<0>(pair)));
   }
-  BIND(&if_heap_number);
 }
 
-void CodeStubAssembler::TryFloat64ToSmi(TNode<Float64T> value,
-                                        TVariable<Smi>* var_result_smi,
-                                        Label* if_smi) {
+TNode<Smi> CodeStubAssembler::TryFloat64ToSmi(TNode<Float64T> value,
+                                              Label* not_smi) {
   TNode<Int32T> value32 = RoundFloat64ToInt32(value);
   TNode<Float64T> value64 = ChangeInt32ToFloat64(value32);
 
-  Label if_int32(this), if_heap_number(this, Label::kDeferred);
+  Label if_int32(this);
 
-  GotoIfNot(Float64Equal(value, value64), &if_heap_number);
+  GotoIfNot(Float64Equal(value, value64), not_smi);
   GotoIfNot(Word32Equal(value32, Int32Constant(0)), &if_int32);
   Branch(Int32LessThan(UncheckedCast<Int32T>(Float64ExtractHighWord32(value)),
                        Int32Constant(0)),
-         &if_heap_number, &if_int32);
+         not_smi, &if_int32);
 
   TVARIABLE(Number, var_result);
   BIND(&if_int32);
-  {
-    if (SmiValuesAre32Bits()) {
-      *var_result_smi = SmiTag(ChangeInt32ToIntPtr(value32));
-    } else {
-      DCHECK(SmiValuesAre31Bits());
-      TNode<PairT<Int32T, BoolT>> pair = Int32AddWithOverflow(value32, value32);
-      TNode<BoolT> overflow = Projection<1>(pair);
-      GotoIf(overflow, &if_heap_number);
-      *var_result_smi =
-          BitcastWordToTaggedSigned(ChangeInt32ToIntPtr(Projection<0>(pair)));
-    }
-    Goto(if_smi);
+  if (SmiValuesAre32Bits()) {
+    return SmiTag(ChangeInt32ToIntPtr(value32));
+  } else {
+    DCHECK(SmiValuesAre31Bits());
+    TNode<PairT<Int32T, BoolT>> pair = Int32AddWithOverflow(value32, value32);
+    TNode<BoolT> overflow = Projection<1>(pair);
+    GotoIf(overflow, not_smi);
+    return BitcastWordToTaggedSigned(ChangeInt32ToIntPtr(Projection<0>(pair)));
   }
-  BIND(&if_heap_number);
 }
 
 TNode<Number> CodeStubAssembler::ChangeFloat32ToTagged(TNode<Float32T> value) {
-  Label if_smi(this), done(this);
-  TVARIABLE(Smi, var_smi_result);
+  Label not_smi(this), done(this);
   TVARIABLE(Number, var_result);
-  TryFloat32ToSmi(value, &var_smi_result, &if_smi);
-
-  var_result = AllocateHeapNumberWithValue(ChangeFloat32ToFloat64(value));
+  var_result = TryFloat32ToSmi(value, &not_smi);
   Goto(&done);
 
-  BIND(&if_smi);
+  BIND(&not_smi);
   {
-    var_result = var_smi_result.value();
+    var_result = AllocateHeapNumberWithValue(ChangeFloat32ToFloat64(value));
     Goto(&done);
   }
+
   BIND(&done);
   return var_result.value();
 }
 
 TNode<Number> CodeStubAssembler::ChangeFloat64ToTagged(TNode<Float64T> value) {
-  Label if_smi(this), done(this);
-  TVARIABLE(Smi, var_smi_result);
+  Label not_smi(this), done(this);
   TVARIABLE(Number, var_result);
-  TryFloat64ToSmi(value, &var_smi_result, &if_smi);
-
-  var_result = AllocateHeapNumberWithValue(value);
+  var_result = TryFloat64ToSmi(value, &not_smi);
   Goto(&done);
 
-  BIND(&if_smi);
+  BIND(&not_smi);
   {
-    var_result = var_smi_result.value();
+    var_result = AllocateHeapNumberWithValue(value);
     Goto(&done);
   }
   BIND(&done);
@@ -6547,9 +6726,23 @@ TNode<BoolT> CodeStubAssembler::IsPromiseSpeciesProtectorCellInvalid() {
 }
 
 TNode<BoolT>
-CodeStubAssembler::IsNumberStringPrototypeNoReplaceProtectorCellInvalid() {
+CodeStubAssembler::IsNumberStringNotRegexpLikeProtectorCellInvalid() {
+  TNode<Smi> invalid = SmiConstant(Protectors::kProtectorInvalid);
+  TNode<PropertyCell> cell = NumberStringNotRegexpLikeProtectorConstant();
+  TNode<Object> cell_value = LoadObjectField(cell, PropertyCell::kValueOffset);
+  return TaggedEqual(cell_value, invalid);
+}
+
+TNode<BoolT> CodeStubAssembler::IsSetIteratorProtectorCellInvalid() {
+  TNode<Smi> invalid = SmiConstant(Protectors::kProtectorInvalid);
+  TNode<PropertyCell> cell = SetIteratorProtectorConstant();
+  TNode<Object> cell_value = LoadObjectField(cell, PropertyCell::kValueOffset);
+  return TaggedEqual(cell_value, invalid);
+}
+
+TNode<BoolT> CodeStubAssembler::IsMapIteratorProtectorCellInvalid() {
   TNode<Smi> invalid = SmiConstant(Protectors::kProtectorInvalid);
-  TNode<PropertyCell> cell = NumberStringPrototypeNoReplaceProtectorConstant();
+  TNode<PropertyCell> cell = MapIteratorProtectorConstant();
   TNode<Object> cell_value = LoadObjectField(cell, PropertyCell::kValueOffset);
   return TaggedEqual(cell_value, invalid);
 }
@@ -6646,7 +6839,7 @@ TNode<BoolT> CodeStubAssembler::IsCustomElementsReceiverInstanceType(
 
 TNode<BoolT> CodeStubAssembler::IsStringInstanceType(
     TNode<Int32T> instance_type) {
-  static_assert(INTERNALIZED_STRING_TYPE == FIRST_TYPE);
+  static_assert(INTERNALIZED_TWO_BYTE_STRING_TYPE == FIRST_TYPE);
   return Int32LessThan(instance_type, Int32Constant(FIRST_NONSTRING_TYPE));
 }
 
@@ -7014,6 +7207,20 @@ TNode<BoolT> CodeStubAssembler::IsHeapNumberInstanceType(
   return InstanceTypeEqual(instance_type, HEAP_NUMBER_TYPE);
 }
 
+TNode<BoolT> CodeStubAssembler::IsNotAnyHole(TNode<Object> object) {
+  return Select<BoolT>(
+      TaggedIsSmi(object), [=] { return Int32TrueConstant(); },
+      [=] {
+        return Word32BinaryNot(IsHoleInstanceType(
+            LoadInstanceType(UncheckedCast<HeapObject>(object))));
+      });
+}
+
+TNode<BoolT> CodeStubAssembler::IsHoleInstanceType(
+    TNode<Int32T> instance_type) {
+  return InstanceTypeEqual(instance_type, HOLE_TYPE);
+}
+
 TNode<BoolT> CodeStubAssembler::IsOddball(TNode<HeapObject> object) {
   return IsOddballInstanceType(LoadInstanceType(object));
 }
@@ -7532,8 +7739,8 @@ TNode<String> ToDirectStringAssembler::TryToDirect(Label* if_bailout) {
       Goto(if_bailout);
     } else {
       const TNode<String> string = var_string_.value();
-      const TNode<IntPtrT> sliced_offset =
-          LoadAndUntagObjectField(string, SlicedString::kOffsetOffset);
+      const TNode<IntPtrT> sliced_offset = LoadAndUntagPositiveSmiObjectField(
+          string, SlicedString::kOffsetOffset);
       var_offset_ = IntPtrAdd(var_offset_.value(), sliced_offset);
 
       const TNode<String> parent =
@@ -7639,60 +7846,31 @@ TNode<String> CodeStubAssembler::NumberToString(TNode<Number> input,
                                                 Label* bailout) {
   TVARIABLE(String, result);
   TVARIABLE(Smi, smi_input);
-  Label if_smi(this), if_heap_number(this), done(this, &result);
+  Label if_smi(this), not_smi(this), if_heap_number(this), done(this, &result);
 
   // Load the number string cache.
   TNode<FixedArray> number_string_cache = NumberStringCacheConstant();
 
   // Make the hash mask from the length of the number string cache. It
   // contains two elements (number and string) for each cache entry.
-  TNode<IntPtrT> number_string_cache_length =
-      LoadAndUntagFixedArrayBaseLength(number_string_cache);
+  TNode<Uint32T> number_string_cache_length =
+      LoadAndUntagFixedArrayBaseLengthAsUint32(number_string_cache);
   TNode<Int32T> one = Int32Constant(1);
-  TNode<Word32T> mask = Int32Sub(
-      Word32Shr(TruncateWordToInt32(number_string_cache_length), one), one);
+  TNode<Word32T> mask =
+      Int32Sub(Word32Shr(number_string_cache_length, one), one);
 
   GotoIfNot(TaggedIsSmi(input), &if_heap_number);
   smi_input = CAST(input);
   Goto(&if_smi);
 
   BIND(&if_heap_number);
+  TNode<HeapNumber> heap_number_input = CAST(input);
   {
     Comment("NumberToString - HeapNumber");
-    TNode<HeapNumber> heap_number_input = CAST(input);
     // Try normalizing the HeapNumber.
-    TryHeapNumberToSmi(heap_number_input, &smi_input, &if_smi);
-
-    // Make a hash from the two 32-bit values of the double.
-    TNode<Int32T> low =
-        LoadObjectField<Int32T>(heap_number_input, HeapNumber::kValueOffset);
-    TNode<Int32T> high = LoadObjectField<Int32T>(
-        heap_number_input, HeapNumber::kValueOffset + kIntSize);
-    TNode<Word32T> hash = Word32And(Word32Xor(low, high), mask);
-    TNode<IntPtrT> entry_index =
-        Signed(ChangeUint32ToWord(Int32Add(hash, hash)));
-
-    // Cache entry's key must be a heap number
-    TNode<Object> number_key =
-        UnsafeLoadFixedArrayElement(number_string_cache, entry_index);
-    GotoIf(TaggedIsSmi(number_key), bailout);
-    TNode<HeapObject> number_key_heap_object = CAST(number_key);
-    GotoIfNot(IsHeapNumber(number_key_heap_object), bailout);
-
-    // Cache entry's key must match the heap number value we're looking for.
-    TNode<Int32T> low_compare = LoadObjectField<Int32T>(
-        number_key_heap_object, HeapNumber::kValueOffset);
-    TNode<Int32T> high_compare = LoadObjectField<Int32T>(
-        number_key_heap_object, HeapNumber::kValueOffset + kIntSize);
-    GotoIfNot(Word32Equal(low, low_compare), bailout);
-    GotoIfNot(Word32Equal(high, high_compare), bailout);
-
-    // Heap number match, return value from cache entry.
-    result = CAST(UnsafeLoadFixedArrayElement(number_string_cache, entry_index,
-                                              kTaggedSize));
-    Goto(&done);
+    smi_input = TryHeapNumberToSmi(heap_number_input, &not_smi);
+    Goto(&if_smi);
   }
-
   BIND(&if_smi);
   {
     Comment("NumberToString - Smi");
@@ -7717,8 +7895,8 @@ TNode<String> CodeStubAssembler::NumberToString(TNode<Number> input,
       // Bailout when the cache is not full-size.
       const int kFullCacheSize =
           isolate()->heap()->MaxNumberToStringCacheSize();
-      Branch(IntPtrLessThan(number_string_cache_length,
-                            IntPtrConstant(kFullCacheSize)),
+      Branch(Uint32LessThan(number_string_cache_length,
+                            Uint32Constant(kFullCacheSize)),
              bailout, &store_to_cache);
 
       BIND(&store_to_cache);
@@ -7736,6 +7914,38 @@ TNode<String> CodeStubAssembler::NumberToString(TNode<Number> input,
       }
     }
   }
+
+  BIND(&not_smi);
+  {
+    // Make a hash from the two 32-bit values of the double.
+    TNode<Int32T> low =
+        LoadObjectField<Int32T>(heap_number_input, HeapNumber::kValueOffset);
+    TNode<Int32T> high = LoadObjectField<Int32T>(
+        heap_number_input, HeapNumber::kValueOffset + kIntSize);
+    TNode<Word32T> hash = Word32And(Word32Xor(low, high), mask);
+    TNode<IntPtrT> entry_index =
+        Signed(ChangeUint32ToWord(Int32Add(hash, hash)));
+
+    // Cache entry's key must be a heap number
+    TNode<Object> number_key =
+        UnsafeLoadFixedArrayElement(number_string_cache, entry_index);
+    GotoIf(TaggedIsSmi(number_key), bailout);
+    TNode<HeapObject> number_key_heap_object = CAST(number_key);
+    GotoIfNot(IsHeapNumber(number_key_heap_object), bailout);
+
+    // Cache entry's key must match the heap number value we're looking for.
+    TNode<Int32T> low_compare = LoadObjectField<Int32T>(
+        number_key_heap_object, HeapNumber::kValueOffset);
+    TNode<Int32T> high_compare = LoadObjectField<Int32T>(
+        number_key_heap_object, HeapNumber::kValueOffset + kIntSize);
+    GotoIfNot(Word32Equal(low, low_compare), bailout);
+    GotoIfNot(Word32Equal(high, high_compare), bailout);
+
+    // Heap number match, return value from cache entry.
+    result = CAST(UnsafeLoadFixedArrayElement(number_string_cache, entry_index,
+                                              kTaggedSize));
+    Goto(&done);
+  }
   BIND(&done);
   return result.value();
 }
@@ -8453,7 +8663,8 @@ void CodeStubAssembler::TryToName(TNode<Object> key, Label* if_keyisindex,
                  raw_hash_field, Name::HashFieldType::kIntegerIndex),
              if_bailout);
 
-      GotoIf(InstanceTypeEqual(var_instance_type.value(), THIN_STRING_TYPE),
+      static_assert(base::bits::CountPopulation(kThinStringTagBit) == 1);
+      GotoIf(IsSetWord32(var_instance_type.value(), kThinStringTagBit),
              &if_thinstring);
 
       // Check if the hash field encodes an internalized string forwarding
@@ -8925,7 +9136,8 @@ void CodeStubAssembler::NameDictionaryLookup(
 
   Label if_not_computed(this, Label::kDeferred);
 
-  TNode<IntPtrT> capacity = SmiUntag(GetCapacity<Dictionary>(dictionary));
+  TNode<IntPtrT> capacity =
+      PositiveSmiUntag(GetCapacity<Dictionary>(dictionary));
   TNode<IntPtrT> mask = IntPtrSub(capacity, IntPtrConstant(1));
   TNode<UintPtrT> hash =
       ChangeUint32ToWord(LoadNameHash(unique_name, &if_not_computed));
@@ -8933,7 +9145,7 @@ void CodeStubAssembler::NameDictionaryLookup(
   // See Dictionary::FirstProbe().
   TNode<IntPtrT> count = IntPtrConstant(0);
   TNode<IntPtrT> initial_entry = Signed(WordAnd(hash, mask));
-  TNode<Oddball> undefined = UndefinedConstant();
+  TNode<Undefined> undefined = UndefinedConstant();
 
   // Appease the variable merging algorithm for "Goto(&loop)" below.
   if (var_name_index) *var_name_index = IntPtrConstant(0);
@@ -9061,7 +9273,8 @@ void CodeStubAssembler::NumberDictionaryLookup(
   DCHECK_EQ(MachineType::PointerRepresentation(), var_entry->rep());
   Comment("NumberDictionaryLookup");
 
-  TNode<IntPtrT> capacity = SmiUntag(GetCapacity<NumberDictionary>(dictionary));
+  TNode<IntPtrT> capacity =
+      PositiveSmiUntag(GetCapacity<NumberDictionary>(dictionary));
   TNode<IntPtrT> mask = IntPtrSub(capacity, IntPtrConstant(1));
 
   TNode<UintPtrT> hash = ChangeUint32ToWord(ComputeSeededHash(intptr_index));
@@ -9071,8 +9284,8 @@ void CodeStubAssembler::NumberDictionaryLookup(
   TNode<IntPtrT> count = IntPtrConstant(0);
   TNode<IntPtrT> initial_entry = Signed(WordAnd(hash, mask));
 
-  TNode<Oddball> undefined = UndefinedConstant();
-  TNode<Oddball> the_hole = TheHoleConstant();
+  TNode<Undefined> undefined = UndefinedConstant();
+  TNode<Hole> the_hole = TheHoleConstant();
 
   TVARIABLE(IntPtrT, var_count, count);
   Label loop(this, {&var_count, var_entry});
@@ -9207,8 +9420,9 @@ void CodeStubAssembler::InsertEntry<GlobalDictionary>(
 }
 
 template <class Dictionary>
-void CodeStubAssembler::Add(TNode<Dictionary> dictionary, TNode<Name> key,
-                            TNode<Object> value, Label* bailout) {
+void CodeStubAssembler::AddToDictionary(TNode<Dictionary> dictionary,
+                                        TNode<Name> key, TNode<Object> value,
+                                        Label* bailout) {
   CSA_DCHECK(this, Word32BinaryNot(IsEmptyPropertyDictionary(dictionary)));
   TNode<Smi> capacity = GetCapacity<Dictionary>(dictionary);
   TNode<Smi> nof = GetNumberOfElements<Dictionary>(dictionary);
@@ -9243,9 +9457,9 @@ void CodeStubAssembler::Add(TNode<Dictionary> dictionary, TNode<Name> key,
 }
 
 template <>
-void CodeStubAssembler::Add(TNode<SwissNameDictionary> dictionary,
-                            TNode<Name> key, TNode<Object> value,
-                            Label* bailout) {
+void CodeStubAssembler::AddToDictionary(TNode<SwissNameDictionary> dictionary,
+                                        TNode<Name> key, TNode<Object> value,
+                                        Label* bailout) {
   PropertyDetails d(PropertyKind::kData, NONE,
                     PropertyDetails::kConstIfDictConstnessTracking);
 
@@ -9267,9 +9481,8 @@ void CodeStubAssembler::Add(TNode<SwissNameDictionary> dictionary,
   SwissNameDictionaryAdd(dictionary, key, value, var_details.value(), bailout);
 }
 
-template void CodeStubAssembler::Add<NameDictionary>(TNode<NameDictionary>,
-                                                     TNode<Name>, TNode<Object>,
-                                                     Label*);
+template void CodeStubAssembler::AddToDictionary<NameDictionary>(
+    TNode<NameDictionary>, TNode<Name>, TNode<Object>, Label*);
 
 template <class Dictionary>
 TNode<Smi> CodeStubAssembler::GetNumberOfElements(
@@ -9363,9 +9576,9 @@ TNode<Uint32T> CodeStubAssembler::NumberOfEntries<DescriptorArray>(
 template <>
 TNode<Uint32T> CodeStubAssembler::NumberOfEntries<TransitionArray>(
     TNode<TransitionArray> transitions) {
-  TNode<IntPtrT> length = LoadAndUntagWeakFixedArrayLength(transitions);
+  TNode<Uint32T> length = LoadAndUntagWeakFixedArrayLengthAsUint32(transitions);
   return Select<Uint32T>(
-      UintPtrLessThan(length, IntPtrConstant(TransitionArray::kFirstIndex)),
+      Uint32LessThan(length, Uint32Constant(TransitionArray::kFirstIndex)),
       [=] { return Unsigned(Int32Constant(0)); },
       [=] {
         return Unsigned(LoadAndUntagToWord32ArrayElement(
@@ -10093,7 +10306,7 @@ void CodeStubAssembler::LoadPropertyFromFastObject(
     BIND(&if_backing_store);
     {
       Comment("if_backing_store");
-      TNode<HeapObject> properties = LoadFastProperties(CAST(object));
+      TNode<HeapObject> properties = LoadFastProperties(CAST(object), true);
       field_index = Signed(IntPtrSub(field_index, instance_size_in_words));
       TNode<Object> value =
           LoadPropertyArrayElement(CAST(properties), field_index);
@@ -10153,7 +10366,7 @@ void CodeStubAssembler::LoadPropertyFromGlobalDictionary(
 
   TNode<Object> value =
       LoadObjectField(property_cell, PropertyCell::kValueOffset);
-  GotoIf(TaggedEqual(value, TheHoleConstant()), if_deleted);
+  GotoIf(TaggedEqual(value, PropertyCellHoleConstant()), if_deleted);
 
   *var_value = value;
 
@@ -10179,7 +10392,8 @@ template void CodeStubAssembler::LoadPropertyFromDictionary(
 TNode<Object> CodeStubAssembler::CallGetterIfAccessor(
     TNode<Object> value, TNode<HeapObject> holder, TNode<Uint32T> details,
     TNode<Context> context, TNode<Object> receiver, TNode<Object> name,
-    Label* if_bailout, GetOwnPropertyMode mode) {
+    Label* if_bailout, GetOwnPropertyMode mode,
+    ExpectedReceiverMode expected_receiver_mode) {
   TVARIABLE(Object, var_value, value);
   Label done(this), if_accessor_info(this, Label::kDeferred);
 
@@ -10212,15 +10426,16 @@ TNode<Object> CodeStubAssembler::CallGetterIfAccessor(
       {
         // Call the accessor. No need to check side-effect mode here, since it
         // will be checked later in DebugOnFunctionCall.
+        // It's too early to convert receiver to JSReceiver at this point
+        // (the Call builtin will do the conversion), so we ignore the
+        // |expected_receiver_mode| here.
         var_value = Call(context, getter, receiver);
         Goto(&done);
       }
 
       BIND(&if_function_template_info);
       {
-        Label runtime(this, Label::kDeferred);
         Label use_cached_property(this);
-        GotoIf(IsSideEffectFreeDebuggingActive(), &runtime);
         TNode<HeapObject> cached_property_name = LoadObjectField<HeapObject>(
             getter, FunctionTemplateInfo::kCachedPropertyNameOffset);
 
@@ -10229,12 +10444,24 @@ TNode<Object> CodeStubAssembler::CallGetterIfAccessor(
                                          : if_bailout;
         GotoIfNot(IsTheHole(cached_property_name), has_cached_property);
 
+        TNode<JSReceiver> js_receiver;
+        switch (expected_receiver_mode) {
+          case kExpectingJSReceiver:
+            js_receiver = CAST(receiver);
+            break;
+          case kExpectingAnyReceiver:
+            // TODO(ishell): in case the function template info has a signature
+            // and receiver is not a JSReceiver the signature check in
+            // CallFunctionTemplate builtin will fail anyway, so we can short
+            // cut it here and throw kIllegalInvocation immediately.
+            js_receiver = ToObject_Inline(context, receiver);
+            break;
+        }
         TNode<NativeContext> creation_context =
             GetCreationContext(CAST(holder), if_bailout);
         var_value = CallBuiltin(
-            Builtin::kCallFunctionTemplate_CheckAccessAndCompatibleReceiver,
-            creation_context, getter, IntPtrConstant(i::JSParameterCount(0)),
-            receiver);
+            Builtin::kCallFunctionTemplate_Generic, creation_context, getter,
+            Int32Constant(i::JSParameterCount(0)), js_receiver);
         Goto(&done);
 
         if (mode == kCallJSGetterUseCachedName) {
@@ -10244,13 +10471,6 @@ TNode<Object> CodeStubAssembler::CallGetterIfAccessor(
 
           Goto(&done);
         }
-
-        BIND(&runtime);
-        {
-          var_value = CallRuntime(Runtime::kGetProperty, context, holder, name,
-                                  receiver);
-          Goto(&done);
-        }
       }
     } else {
       DCHECK_EQ(mode, kReturnAccessorPair);
@@ -10322,12 +10542,13 @@ void CodeStubAssembler::TryGetOwnProperty(
     TNode<Context> context, TNode<Object> receiver, TNode<JSReceiver> object,
     TNode<Map> map, TNode<Int32T> instance_type, TNode<Name> unique_name,
     Label* if_found_value, TVariable<Object>* var_value, Label* if_not_found,
-    Label* if_bailout) {
+    Label* if_bailout, ExpectedReceiverMode expected_receiver_mode) {
   TryGetOwnProperty(context, receiver, object, map, instance_type, unique_name,
                     if_found_value, var_value, nullptr, nullptr, if_not_found,
                     if_bailout,
                     receiver == object ? kCallJSGetterUseCachedName
-                                       : kCallJSGetterDontUseCachedName);
+                                       : kCallJSGetterDontUseCachedName,
+                    expected_receiver_mode);
 }
 
 void CodeStubAssembler::TryGetOwnProperty(
@@ -10335,9 +10556,15 @@ void CodeStubAssembler::TryGetOwnProperty(
     TNode<Map> map, TNode<Int32T> instance_type, TNode<Name> unique_name,
     Label* if_found_value, TVariable<Object>* var_value,
     TVariable<Uint32T>* var_details, TVariable<Object>* var_raw_value,
-    Label* if_not_found, Label* if_bailout, GetOwnPropertyMode mode) {
+    Label* if_not_found, Label* if_bailout, GetOwnPropertyMode mode,
+    ExpectedReceiverMode expected_receiver_mode) {
   DCHECK_EQ(MachineRepresentation::kTagged, var_value->rep());
   Comment("TryGetOwnProperty");
+  if (receiver == object) {
+    // If |receiver| is exactly the same Node as the |object| which is
+    // guaranteed to be JSReceiver override the |expected_receiver_mode|.
+    expected_receiver_mode = kExpectingJSReceiver;
+  }
   CSA_DCHECK(this, IsUniqueNameNoCachedIndex(unique_name));
   TVARIABLE(HeapObject, var_meta_storage);
   TVARIABLE(IntPtrT, var_entry);
@@ -10386,9 +10613,9 @@ void CodeStubAssembler::TryGetOwnProperty(
     if (var_raw_value) {
       *var_raw_value = *var_value;
     }
-    TNode<Object> value =
-        CallGetterIfAccessor(var_value->value(), object, var_details->value(),
-                             context, receiver, unique_name, if_bailout, mode);
+    TNode<Object> value = CallGetterIfAccessor(
+        var_value->value(), object, var_details->value(), context, receiver,
+        unique_name, if_bailout, mode, expected_receiver_mode);
     *var_value = value;
     Goto(if_found_value);
   }
@@ -10508,7 +10735,7 @@ CodeStubAssembler::AllocatePropertyDescriptorObject(TNode<Context> context) {
   TNode<Smi> zero = SmiConstant(0);
   StoreObjectFieldNoWriteBarrier(result, PropertyDescriptorObject::kFlagsOffset,
                                  zero);
-  TNode<Oddball> the_hole = TheHoleConstant();
+  TNode<Hole> the_hole = TheHoleConstant();
   StoreObjectFieldNoWriteBarrier(result, PropertyDescriptorObject::kValueOffset,
                                  the_hole);
   StoreObjectFieldNoWriteBarrier(result, PropertyDescriptorObject::kGetOffset,
@@ -10518,6 +10745,103 @@ CodeStubAssembler::AllocatePropertyDescriptorObject(TNode<Context> context) {
   return CAST(result);
 }
 
+TNode<BoolT> CodeStubAssembler::IsInterestingProperty(TNode<Name> name) {
+  TVARIABLE(BoolT, var_result);
+  Label return_false(this), return_true(this), return_generic(this);
+  // TODO(ishell): consider using ReadOnlyRoots::IsNameForProtector() trick for
+  // these strings and interesting symbols.
+  GotoIf(IsToJSONString(name), &return_true);
+  GotoIf(IsGetString(name), &return_true);
+  GotoIfNot(InstanceTypeEqual(LoadMapInstanceType(LoadMap(name)), SYMBOL_TYPE),
+            &return_false);
+  Branch(IsSetWord32<Symbol::IsInterestingSymbolBit>(
+             LoadObjectField<Uint32T>(name, Symbol::kFlagsOffset)),
+         &return_true, &return_false);
+
+  BIND(&return_false);
+  var_result = BoolConstant(false);
+  Goto(&return_generic);
+
+  BIND(&return_true);
+  var_result = BoolConstant(true);
+  Goto(&return_generic);
+
+  BIND(&return_generic);
+  return var_result.value();
+}
+
+TNode<Object> CodeStubAssembler::GetInterestingProperty(
+    TNode<Context> context, TNode<JSReceiver> receiver, TNode<Name> name,
+    Label* if_not_found) {
+  TVARIABLE(HeapObject, var_holder, receiver);
+  TVARIABLE(Map, var_holder_map, LoadMap(receiver));
+
+  return GetInterestingProperty(context, receiver, &var_holder, &var_holder_map,
+                                name, if_not_found);
+}
+
+TNode<Object> CodeStubAssembler::GetInterestingProperty(
+    TNode<Context> context, TNode<Object> receiver,
+    TVariable<HeapObject>* var_holder, TVariable<Map>* var_holder_map,
+    TNode<Name> name, Label* if_not_found) {
+  CSA_DCHECK(this, IsInterestingProperty(name));
+  // The lookup starts at the var_holder and var_holder_map must contain
+  // var_holder's map.
+  CSA_DCHECK(this, TaggedEqual(LoadMap((*var_holder).value()),
+                               (*var_holder_map).value()));
+  TVARIABLE(Object, var_result, UndefinedConstant());
+
+  // Check if all relevant maps (including the prototype maps) don't
+  // have any interesting properties (i.e. that none of them have the
+  // @@toStringTag or @@toPrimitive property).
+  Label loop(this, {var_holder, var_holder_map}),
+      lookup(this, Label::kDeferred);
+  Goto(&loop);
+  BIND(&loop);
+  {
+    Label interesting_properties(this);
+    TNode<HeapObject> holder = (*var_holder).value();
+    TNode<Map> holder_map = (*var_holder_map).value();
+    GotoIf(IsNull(holder), if_not_found);
+    TNode<Uint32T> holder_bit_field3 = LoadMapBitField3(holder_map);
+    GotoIf(IsSetWord32<Map::Bits3::MayHaveInterestingPropertiesBit>(
+               holder_bit_field3),
+           &interesting_properties);
+    *var_holder = LoadMapPrototype(holder_map);
+    *var_holder_map = LoadMap((*var_holder).value());
+    Goto(&loop);
+    BIND(&interesting_properties);
+    {
+      // Check flags for dictionary objects.
+      GotoIf(IsClearWord32<Map::Bits3::IsDictionaryMapBit>(holder_bit_field3),
+             &lookup);
+      // JSProxy has dictionary properties but has to be handled in runtime.
+      GotoIf(InstanceTypeEqual(LoadMapInstanceType(holder_map), JS_PROXY_TYPE),
+             &lookup);
+      TNode<Object> properties =
+          LoadObjectField(holder, JSObject::kPropertiesOrHashOffset);
+      CSA_DCHECK(this, TaggedIsNotSmi(properties));
+      // TODO(pthier): Support swiss dictionaries.
+      if constexpr (!V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
+        CSA_DCHECK(this, IsNameDictionary(CAST(properties)));
+        TNode<Smi> flags =
+            GetNameDictionaryFlags<NameDictionary>(CAST(properties));
+        GotoIf(IsSetSmi(flags,
+                        NameDictionary::MayHaveInterestingPropertiesBit::kMask),
+               &lookup);
+        *var_holder = LoadMapPrototype(holder_map);
+        *var_holder_map = LoadMap((*var_holder).value());
+      }
+      Goto(&loop);
+    }
+  }
+
+  BIND(&lookup);
+  return CallBuiltin(Builtin::kGetPropertyWithReceiver, context,
+                     (*var_holder).value(), name, receiver,
+                     SmiConstant(OnNonExistent::kReturnUndefined));
+}
+
 void CodeStubAssembler::TryLookupElement(
     TNode<HeapObject> object, TNode<Map> map, TNode<Int32T> instance_type,
     TNode<IntPtrT> intptr_index, Label* if_found, Label* if_absent,
@@ -10617,7 +10941,7 @@ void CodeStubAssembler::TryLookupElement(
     GotoIfNot(UintPtrLessThan(intptr_index, length), &if_oob);
 
     TNode<Object> element = UnsafeLoadFixedArrayElement(elements, intptr_index);
-    TNode<Oddball> the_hole = TheHoleConstant();
+    TNode<Hole> the_hole = TheHoleConstant();
     Branch(TaggedEqual(element, the_hole), if_not_found, if_found);
   }
   BIND(&if_isdouble);
@@ -10828,10 +11152,10 @@ void CodeStubAssembler::TryPrototypeChainLookup(
   }
 }
 
-TNode<Oddball> CodeStubAssembler::HasInPrototypeChain(TNode<Context> context,
+TNode<Boolean> CodeStubAssembler::HasInPrototypeChain(TNode<Context> context,
                                                       TNode<HeapObject> object,
                                                       TNode<Object> prototype) {
-  TVARIABLE(Oddball, var_result);
+  TVARIABLE(Boolean, var_result);
   Label return_false(this), return_true(this),
       return_runtime(this, Label::kDeferred), return_result(this);
 
@@ -10892,10 +11216,10 @@ TNode<Oddball> CodeStubAssembler::HasInPrototypeChain(TNode<Context> context,
   return var_result.value();
 }
 
-TNode<Oddball> CodeStubAssembler::OrdinaryHasInstance(
+TNode<Boolean> CodeStubAssembler::OrdinaryHasInstance(
     TNode<Context> context, TNode<Object> callable_maybe_smi,
     TNode<Object> object_maybe_smi) {
-  TVARIABLE(Oddball, var_result);
+  TVARIABLE(Boolean, var_result);
   Label return_runtime(this, Label::kDeferred), return_result(this);
 
   GotoIfForceSlowPath(&return_runtime);
@@ -10978,7 +11302,7 @@ TNode<IntPtrT> CodeStubAssembler::ElementOffsetFromIndex(
     TNode<Smi> smi_index_node = ReinterpretCast<Smi>(index_node);
     int const kSmiShiftBits = kSmiShiftSize + kSmiTagSize;
     element_size_shift -= kSmiShiftBits;
-    Smi smi_index;
+    Tagged<Smi> smi_index;
     constant_index = TryToSmiConstant(smi_index_node, &smi_index);
     if (constant_index) {
       index = smi_index.value();
@@ -11177,10 +11501,6 @@ void CodeStubAssembler::UpdateFeedback(TNode<Smi> feedback,
 void CodeStubAssembler::ReportFeedbackUpdate(
     TNode<FeedbackVector> feedback_vector, TNode<UintPtrT> slot_id,
     const char* reason) {
-  // Reset profiler ticks.
-  StoreObjectFieldNoWriteBarrier(
-      feedback_vector, FeedbackVector::kProfilerTicksOffset, Int32Constant(0));
-
 #ifdef V8_TRACE_FEEDBACK_UPDATES
   // Trace the update.
   CallRuntime(Runtime::kTraceUpdateFeedback, NoContextConstant(),
@@ -11704,6 +12024,17 @@ TNode<BigInt> CodeStubAssembler::PrepareValueForWriteToTypedArray<BigInt>(
   return ToBigInt(context, input);
 }
 
+#if V8_ENABLE_WEBASSEMBLY
+TorqueStructInt64AsInt32Pair CodeStubAssembler::BigIntToRawBytes(
+    TNode<BigInt> value) {
+  TVARIABLE(UintPtrT, var_low);
+  // Only used on 32-bit platforms.
+  TVARIABLE(UintPtrT, var_high);
+  BigIntToRawBytes(value, &var_low, &var_high);
+  return {var_low.value(), var_high.value()};
+}
+#endif  // V8_ENABLE_WEBASSEMBLY
+
 void CodeStubAssembler::BigIntToRawBytes(TNode<BigInt> bigint,
                                          TVariable<UintPtrT>* var_low,
                                          TVariable<UintPtrT>* var_high) {
@@ -11970,7 +12301,7 @@ void CodeStubAssembler::EmitElementStore(
       },
       [=]() { return LoadFixedArrayBaseLength(elements); });
 
-  TNode<UintPtrT> length = Unsigned(SmiUntag(smi_length));
+  TNode<UintPtrT> length = Unsigned(PositiveSmiUntag(smi_length));
   if (IsGrowStoreMode(store_mode) &&
       !(IsSealedElementsKind(elements_kind) ||
         IsNonextensibleElementsKind(elements_kind))) {
@@ -12033,7 +12364,7 @@ TNode<FixedArrayBase> CodeStubAssembler::CheckForCapacityGrow(
   BIND(&grow_case);
   {
     TNode<IntPtrT> current_capacity =
-        SmiUntag(LoadFixedArrayBaseLength(elements));
+        LoadAndUntagFixedArrayBaseLength(elements);
     checked_elements = elements;
     Label fits_capacity(this);
     // If key is negative, we will notice in Runtime::kGrowArrayElements.
@@ -12087,7 +12418,7 @@ TNode<FixedArrayBase> CodeStubAssembler::CopyElementsOnWrite(
 
   GotoIfNot(IsFixedCOWArrayMap(LoadMap(elements)), &done);
   {
-    TNode<IntPtrT> capacity = SmiUntag(LoadFixedArrayBaseLength(elements));
+    TNode<IntPtrT> capacity = LoadAndUntagFixedArrayBaseLength(elements);
     TNode<FixedArrayBase> new_elements = GrowElementsCapacity(
         object, elements, kind, kind, length, capacity, bailout);
     new_elements_var = new_elements;
@@ -12116,13 +12447,12 @@ void CodeStubAssembler::TransitionElementsKind(TNode<JSObject> object,
     GotoIf(TaggedEqual(elements, EmptyFixedArrayConstant()), &done);
 
     // TODO(ishell): Use BInt for elements_length and array_length.
-    TNode<IntPtrT> elements_length =
-        SmiUntag(LoadFixedArrayBaseLength(elements));
+    TNode<IntPtrT> elements_length = LoadAndUntagFixedArrayBaseLength(elements);
     TNode<IntPtrT> array_length = Select<IntPtrT>(
         IsJSArray(object),
         [=]() {
           CSA_DCHECK(this, IsFastElementsKind(LoadElementsKind(object)));
-          return SmiUntag(LoadFastJSArrayLength(CAST(object)));
+          return PositiveSmiUntag(LoadFastJSArrayLength(CAST(object)));
         },
         [=]() { return elements_length; });
 
@@ -12306,6 +12636,12 @@ TNode<TIndex> CodeStubAssembler::BuildFastLoop(
     TNode<TIndex> start_index, TNode<TIndex> end_index,
     const FastLoopBody<TIndex>& body, int increment,
     LoopUnrollingMode unrolling_mode, IndexAdvanceMode advance_mode) {
+  // Update the index comparisons below in case we'd ever want to use Smi
+  // indexes.
+  static_assert(
+      !std::is_same<TIndex, Smi>::value,
+      "Smi indices are currently not supported because it's not clear whether "
+      "the use case allows unsigned comparisons or not");
   var_index = start_index;
   VariableList vars_copy(vars.begin(), vars.end(), zone());
   vars_copy.push_back(&var_index);
@@ -12330,7 +12666,7 @@ TNode<TIndex> CodeStubAssembler::BuildFastLoop(
   // forward to it from the pre-header). The extra branch is slower in the
   // case that the loop actually iterates.
   if (unrolling_mode == LoopUnrollingMode::kNo) {
-    TNode<BoolT> first_check = IntPtrOrSmiEqual(var_index.value(), end_index);
+    TNode<BoolT> first_check = UintPtrOrSmiEqual(var_index.value(), end_index);
     int32_t first_check_val;
     if (TryToInt32Constant(first_check, &first_check_val)) {
       if (first_check_val) return var_index.value();
@@ -12342,11 +12678,11 @@ TNode<TIndex> CodeStubAssembler::BuildFastLoop(
     BIND(&loop);
     {
       loop_body();
-      CSA_DCHECK(
-          this, increment > 0
-                    ? IntPtrOrSmiLessThanOrEqual(var_index.value(), end_index)
-                    : IntPtrOrSmiLessThanOrEqual(end_index, var_index.value()));
-      Branch(IntPtrOrSmiNotEqual(var_index.value(), end_index), &loop, &done);
+      CSA_DCHECK(this, increment > 0 ? UintPtrOrSmiLessThanOrEqual(
+                                           var_index.value(), end_index)
+                                     : UintPtrOrSmiLessThanOrEqual(
+                                           end_index, var_index.value()));
+      Branch(UintPtrOrSmiNotEqual(var_index.value(), end_index), &loop, &done);
     }
     BIND(&done);
   } else {
@@ -12354,13 +12690,13 @@ TNode<TIndex> CodeStubAssembler::BuildFastLoop(
     // end_index.
     DCHECK_EQ(unrolling_mode, LoopUnrollingMode::kYes);
     CSA_DCHECK(this, increment > 0
-                         ? IntPtrOrSmiLessThanOrEqual(start_index, end_index)
-                         : IntPtrOrSmiLessThanOrEqual(end_index, start_index));
+                         ? UintPtrOrSmiLessThanOrEqual(start_index, end_index)
+                         : UintPtrOrSmiLessThanOrEqual(end_index, start_index));
     TNode<TIndex> last_index =
         IntPtrOrSmiSub(end_index, IntPtrOrSmiConstant<TIndex>(increment));
     TNode<BoolT> first_check =
-        increment > 0 ? IntPtrOrSmiLessThan(start_index, last_index)
-                      : IntPtrOrSmiGreaterThan(start_index, last_index);
+        increment > 0 ? UintPtrOrSmiLessThan(start_index, last_index)
+                      : UintPtrOrSmiGreaterThan(start_index, last_index);
     int32_t first_check_val;
     if (TryToInt32Constant(first_check, &first_check_val)) {
       if (first_check_val) {
@@ -12378,13 +12714,14 @@ TNode<TIndex> CodeStubAssembler::BuildFastLoop(
       loop_body();
       loop_body();
       TNode<BoolT> loop_check =
-          increment > 0 ? IntPtrOrSmiLessThan(var_index.value(), last_index)
-                        : IntPtrOrSmiGreaterThan(var_index.value(), last_index);
+          increment > 0
+              ? UintPtrOrSmiLessThan(var_index.value(), last_index)
+              : UintPtrOrSmiGreaterThan(var_index.value(), last_index);
       Branch(loop_check, &loop, &after_loop);
     }
     BIND(&after_loop);
     {
-      GotoIfNot(IntPtrOrSmiEqual(var_index.value(), last_index), &done);
+      GotoIfNot(UintPtrOrSmiEqual(var_index.value(), last_index), &done);
       // Iteration count is odd.
       loop_body();
       Goto(&done);
@@ -12690,12 +13027,12 @@ void CodeStubAssembler::BigInt64Comparison(Operation op, TNode<Object>& left,
   Branch(condition, return_true, return_false);
 }
 
-TNode<Oddball> CodeStubAssembler::RelationalComparison(
+TNode<Boolean> CodeStubAssembler::RelationalComparison(
     Operation op, TNode<Object> left, TNode<Object> right,
     const LazyNode<Context>& context, TVariable<Smi>* var_type_feedback) {
   Label return_true(this), return_false(this), do_float_comparison(this),
       end(this);
-  TVARIABLE(Oddball, var_result);  // Actually only "true" or "false".
+  TVARIABLE(Boolean, var_result);
   TVARIABLE(Float64T, var_left_float);
   TVARIABLE(Float64T, var_right_float);
 
@@ -13236,7 +13573,7 @@ void CodeStubAssembler::GenerateEqual_Same(TNode<Object> value, Label* if_equal,
 }
 
 // ES6 section 7.2.12 Abstract Equality Comparison
-TNode<Oddball> CodeStubAssembler::Equal(TNode<Object> left, TNode<Object> right,
+TNode<Boolean> CodeStubAssembler::Equal(TNode<Object> left, TNode<Object> right,
                                         const LazyNode<Context>& context,
                                         TVariable<Smi>* var_type_feedback) {
   // This is a slightly optimized version of Object::Equals. Whenever you
@@ -13245,7 +13582,7 @@ TNode<Oddball> CodeStubAssembler::Equal(TNode<Object> left, TNode<Object> right,
 
   Label if_equal(this), if_notequal(this), do_float_comparison(this),
       do_right_stringtonumber(this, Label::kDeferred), end(this);
-  TVARIABLE(Oddball, result);
+  TVARIABLE(Boolean, result);
   TVARIABLE(Float64T, var_left_float);
   TVARIABLE(Float64T, var_right_float);
 
@@ -13693,7 +14030,7 @@ TNode<Oddball> CodeStubAssembler::Equal(TNode<Object> left, TNode<Object> right,
   return result.value();
 }
 
-TNode<Oddball> CodeStubAssembler::StrictEqual(
+TNode<Boolean> CodeStubAssembler::StrictEqual(
     TNode<Object> lhs, TNode<Object> rhs, TVariable<Smi>* var_type_feedback) {
   // Pseudo-code for the algorithm below:
   //
@@ -13701,9 +14038,9 @@ TNode<Oddball> CodeStubAssembler::StrictEqual(
   //   if (lhs->IsHeapNumber()) return HeapNumber::cast(lhs)->value() != NaN;
   //   return true;
   // }
-  // if (!lhs->IsSmi()) {
+  // if (!IsSmi(lhs)) {
   //   if (lhs->IsHeapNumber()) {
-  //     if (rhs->IsSmi()) {
+  //     if (IsSmi(rhs)) {
   //       return Smi::ToInt(rhs) == HeapNumber::cast(lhs)->value();
   //     } else if (rhs->IsHeapNumber()) {
   //       return HeapNumber::cast(rhs)->value() ==
@@ -13712,7 +14049,7 @@ TNode<Oddball> CodeStubAssembler::StrictEqual(
   //       return false;
   //     }
   //   } else {
-  //     if (rhs->IsSmi()) {
+  //     if (IsSmi(rhs)) {
   //       return false;
   //     } else {
   //       if (lhs->IsString()) {
@@ -13733,7 +14070,7 @@ TNode<Oddball> CodeStubAssembler::StrictEqual(
   //     }
   //   }
   // } else {
-  //   if (rhs->IsSmi()) {
+  //   if (IsSmi(rhs)) {
   //     return false;
   //   } else {
   //     if (rhs->IsHeapNumber()) {
@@ -13746,7 +14083,7 @@ TNode<Oddball> CodeStubAssembler::StrictEqual(
 
   Label if_equal(this), if_notequal(this), if_not_equivalent_types(this),
       end(this);
-  TVARIABLE(Oddball, result);
+  TVARIABLE(Boolean, result);
 
   OverwriteFeedback(var_type_feedback, CompareOperationFeedback::kNone);
 
@@ -14081,7 +14418,11 @@ void CodeStubAssembler::BranchIfStringEqual(TNode<String> lhs,
                                             TNode<String> rhs,
                                             TNode<IntPtrT> rhs_length,
                                             Label* if_true, Label* if_false,
-                                            TVariable<Oddball>* result) {
+                                            TVariable<Boolean>* result) {
+  // Callers must handle the case where {lhs} and {rhs} refer to the same
+  // String object.
+  CSA_DCHECK(this, TaggedNotEqual(lhs, rhs));
+
   Label length_equal(this), length_not_equal(this);
   Branch(IntPtrEqual(lhs_length, rhs_length), &length_equal, &length_not_equal);
 
@@ -14093,7 +14434,7 @@ void CodeStubAssembler::BranchIfStringEqual(TNode<String> lhs,
 
   BIND(&length_equal);
   {
-    TNode<Oddball> value = CAST(CallBuiltin(
+    TNode<Boolean> value = CAST(CallBuiltin(
         Builtin::kStringEqual, NoContextConstant(), lhs, rhs, lhs_length));
     if (result != nullptr) {
       *result = value;
@@ -14230,7 +14571,7 @@ void CodeStubAssembler::BranchIfSameNumberValue(TNode<Float64T> lhs_value,
   }
 }
 
-TNode<Oddball> CodeStubAssembler::HasProperty(TNode<Context> context,
+TNode<Boolean> CodeStubAssembler::HasProperty(TNode<Context> context,
                                               TNode<Object> object,
                                               TNode<Object> key,
                                               HasPropertyLookupMode mode) {
@@ -14260,7 +14601,7 @@ TNode<Oddball> CodeStubAssembler::HasProperty(TNode<Context> context,
                           lookup_element_in_holder, &return_false,
                           &call_runtime, &if_proxy, kHandlePrivateNames);
 
-  TVARIABLE(Oddball, result);
+  TVARIABLE(Boolean, result);
 
   BIND(&if_proxy);
   {
@@ -14329,9 +14670,9 @@ void CodeStubAssembler::ForInPrepare(TNode<HeapObject> enumerator,
   {
     // Load the enumeration length and cache from the {enumerator}.
     TNode<Map> map_enumerator = CAST(enumerator);
-    TNode<WordT> enum_length = LoadMapEnumLength(map_enumerator);
-    CSA_DCHECK(this, WordNotEqual(enum_length,
-                                  IntPtrConstant(kInvalidEnumCacheSentinel)));
+    TNode<Uint32T> enum_length = LoadMapEnumLength(map_enumerator);
+    CSA_DCHECK(this, Word32NotEqual(enum_length,
+                                    Uint32Constant(kInvalidEnumCacheSentinel)));
     TNode<DescriptorArray> descriptors = LoadMapDescriptors(map_enumerator);
     TNode<EnumCache> enum_cache = LoadObjectField<EnumCache>(
         descriptors, DescriptorArray::kEnumCacheOffset);
@@ -14341,16 +14682,16 @@ void CodeStubAssembler::ForInPrepare(TNode<HeapObject> enumerator,
     // Check if we have enum indices available.
     TNode<FixedArray> enum_indices =
         LoadObjectField<FixedArray>(enum_cache, EnumCache::kIndicesOffset);
-    TNode<IntPtrT> enum_indices_length =
-        LoadAndUntagFixedArrayBaseLength(enum_indices);
+    TNode<Uint32T> enum_indices_length =
+        LoadAndUntagFixedArrayBaseLengthAsUint32(enum_indices);
     TNode<Smi> feedback = SelectSmiConstant(
-        IntPtrLessThanOrEqual(enum_length, enum_indices_length),
+        Uint32LessThanOrEqual(enum_length, enum_indices_length),
         static_cast<int>(ForInFeedback::kEnumCacheKeysAndIndices),
         static_cast<int>(ForInFeedback::kEnumCacheKeys));
     UpdateFeedback(feedback, maybe_feedback_vector, slot, update_feedback_mode);
 
     cache_array = enum_keys;
-    cache_length = SmiTag(Signed(enum_length));
+    cache_length = SmiFromUint32(enum_length);
     Goto(&out);
   }
 
@@ -14467,10 +14808,9 @@ TNode<HeapObject> CodeStubAssembler::GetSuperConstructor(
   return LoadMapPrototype(map);
 }
 
-void CodeStubAssembler::FindNonDefaultConstructorOrConstruct(
-    TNode<Context> context, TNode<JSFunction> this_function,
-    TVariable<Object>& constructor, Label* found_default_base_ctor,
-    Label* found_something_else) {
+void CodeStubAssembler::FindNonDefaultConstructor(
+    TNode<JSFunction> this_function, TVariable<Object>& constructor,
+    Label* found_default_base_ctor, Label* found_something_else) {
   Label loop(this, &constructor);
 
   constructor = GetSuperConstructor(this_function);
@@ -14579,10 +14919,10 @@ TNode<JSReceiver> CodeStubAssembler::SpeciesConstructor(
   return var_result.value();
 }
 
-TNode<Oddball> CodeStubAssembler::InstanceOf(TNode<Object> object,
+TNode<Boolean> CodeStubAssembler::InstanceOf(TNode<Object> object,
                                              TNode<Object> callable,
                                              TNode<Context> context) {
-  TVARIABLE(Oddball, var_result);
+  TVARIABLE(Boolean, var_result);
   Label if_notcallable(this, Label::kDeferred),
       if_notreceiver(this, Label::kDeferred), if_otherhandler(this),
       if_nohandler(this, Label::kDeferred), return_true(this),
@@ -14866,7 +15206,7 @@ TNode<Number> CodeStubAssembler::BitwiseSmiOp(TNode<Smi> left, TNode<Smi> right,
 }
 
 TNode<JSObject> CodeStubAssembler::AllocateJSIteratorResult(
-    TNode<Context> context, TNode<Object> value, TNode<Oddball> done) {
+    TNode<Context> context, TNode<Object> value, TNode<Boolean> done) {
   CSA_DCHECK(this, IsBoolean(done));
   TNode<NativeContext> native_context = LoadNativeContext(context);
   TNode<Map> map = CAST(
@@ -14917,6 +15257,28 @@ TNode<JSObject> CodeStubAssembler::AllocateJSIteratorResultForEntry(
   return CAST(result);
 }
 
+TNode<JSObject> CodeStubAssembler::AllocatePromiseWithResolversResult(
+    TNode<Context> context, TNode<Object> promise, TNode<Object> resolve,
+    TNode<Object> reject) {
+  TNode<NativeContext> native_context = LoadNativeContext(context);
+  TNode<Map> map = CAST(LoadContextElement(
+      native_context, Context::PROMISE_WITHRESOLVERS_RESULT_MAP_INDEX));
+  TNode<HeapObject> result = Allocate(JSPromiseWithResolversResult::kSize);
+  StoreMapNoWriteBarrier(result, map);
+  StoreObjectFieldRoot(result,
+                       JSPromiseWithResolversResult::kPropertiesOrHashOffset,
+                       RootIndex::kEmptyFixedArray);
+  StoreObjectFieldRoot(result, JSPromiseWithResolversResult::kElementsOffset,
+                       RootIndex::kEmptyFixedArray);
+  StoreObjectFieldNoWriteBarrier(
+      result, JSPromiseWithResolversResult::kPromiseOffset, promise);
+  StoreObjectFieldNoWriteBarrier(
+      result, JSPromiseWithResolversResult::kResolveOffset, resolve);
+  StoreObjectFieldNoWriteBarrier(
+      result, JSPromiseWithResolversResult::kRejectOffset, reject);
+  return CAST(result);
+}
+
 TNode<JSReceiver> CodeStubAssembler::ArraySpeciesCreate(TNode<Context> context,
                                                         TNode<Object> o,
                                                         TNode<Number> len) {
@@ -15347,6 +15709,12 @@ TNode<Object> CodeStubArguments::GetOptionalArgumentValue(
   return result.value();
 }
 
+void CodeStubArguments::SetArgumentValue(TNode<IntPtrT> index,
+                                         TNode<Object> value) {
+  TNode<RawPtrT> slot = AtIndexPtr(index);
+  assembler_->StoreFullTaggedNoWriteBarrier(slot, value);
+}
+
 void CodeStubArguments::ForEach(
     const CodeStubAssembler::VariableList& vars,
     const CodeStubArguments::ForEachBodyFunction& body, TNode<IntPtrT> first,
@@ -15494,17 +15862,6 @@ TNode<BoolT> CodeStubAssembler::IsDebugActive() {
   return Word32NotEqual(is_debug_active, Int32Constant(0));
 }
 
-TNode<BoolT> CodeStubAssembler::IsSideEffectFreeDebuggingActive() {
-  TNode<Uint8T> debug_execution_mode = Load<Uint8T>(ExternalConstant(
-      ExternalReference::debug_execution_mode_address(isolate())));
-
-  TNode<BoolT> is_active =
-      Word32Equal(debug_execution_mode,
-                  Int32Constant(DebugInfo::ExecutionMode::kSideEffects));
-
-  return is_active;
-}
-
 TNode<BoolT> CodeStubAssembler::HasAsyncEventDelegate() {
   const TNode<RawPtrT> async_event_delegate = Load<RawPtrT>(ExternalConstant(
       ExternalReference::async_event_delegate_address(isolate())));
@@ -15661,7 +16018,7 @@ TNode<Code> CodeStubAssembler::GetSharedFunctionInfoCode(
 
   // IsFunctionTemplateInfo: API call
   BIND(&check_is_function_template_info);
-  sfi_code = HeapConstant(BUILTIN_CODE(isolate(), HandleApiCall));
+  sfi_code = HeapConstant(BUILTIN_CODE(isolate(), HandleApiCallOrConstruct));
   Goto(&done);
 
   // IsInterpreterData: Interpret bytecode
@@ -15698,14 +16055,14 @@ TNode<Code> CodeStubAssembler::GetSharedFunctionInfoCode(
   return sfi_code.value();
 }
 
-TNode<RawPtrT> CodeStubAssembler::GetCodeEntry(TNode<Code> code) {
-  return LoadObjectField<RawPtrT>(code,
-                                  IntPtrConstant(Code::kCodeEntryPointOffset));
+TNode<RawPtrT> CodeStubAssembler::LoadCodeInstructionStart(TNode<Code> code) {
+  return LoadCodeEntrypointFromObject(code, Code::kInstructionStartOffset);
 }
 
 TNode<BoolT> CodeStubAssembler::IsMarkedForDeoptimization(TNode<Code> code) {
+  static_assert(FIELD_SIZE(Code::kFlagsOffset) * kBitsPerByte == 32);
   return IsSetWord32<Code::MarkedForDeoptimizationField>(
-      LoadObjectField<Int16T>(code, Code::kKindSpecificFlagsOffset));
+      LoadObjectField<Int32T>(code, Code::kFlagsOffset));
 }
 
 TNode<JSFunction> CodeStubAssembler::AllocateFunctionWithMapAndContext(
@@ -15730,7 +16087,8 @@ TNode<JSFunction> CodeStubAssembler::AllocateFunctionWithMapAndContext(
   StoreObjectFieldNoWriteBarrier(fun, JSFunction::kSharedFunctionInfoOffset,
                                  shared_info);
   StoreObjectFieldNoWriteBarrier(fun, JSFunction::kContextOffset, context);
-  StoreObjectField(fun, JSFunction::kCodeOffset, code);
+  StoreMaybeIndirectPointerFieldNoWriteBarrier(fun, JSFunction::kCodeOffset,
+                                               code);
   return CAST(fun);
 }
 
@@ -15772,8 +16130,8 @@ void CodeStubAssembler::CheckPrototypeEnumCache(TNode<JSReceiver> receiver,
     // For all {object}s but the {receiver}, check that the cache is empty.
     var_object = CAST(object);
     object_map = LoadMap(object);
-    TNode<WordT> object_enum_length = LoadMapEnumLength(object_map.value());
-    Branch(WordEqual(object_enum_length, IntPtrConstant(0)), &loop, if_slow);
+    TNode<Uint32T> object_enum_length = LoadMapEnumLength(object_map.value());
+    Branch(Word32Equal(object_enum_length, Uint32Constant(0)), &loop, if_slow);
   }
 }
 
@@ -15785,9 +16143,9 @@ TNode<Map> CodeStubAssembler::CheckEnumCache(TNode<JSReceiver> receiver,
 
   // Check if the enum length field of the {receiver} is properly initialized,
   // indicating that there is an enum cache.
-  TNode<WordT> receiver_enum_length = LoadMapEnumLength(receiver_map);
-  Branch(WordEqual(receiver_enum_length,
-                   IntPtrConstant(kInvalidEnumCacheSentinel)),
+  TNode<Uint32T> receiver_enum_length = LoadMapEnumLength(receiver_map);
+  Branch(Word32Equal(receiver_enum_length,
+                     Uint32Constant(kInvalidEnumCacheSentinel)),
          &if_no_cache, &if_cache);
 
   BIND(&if_no_cache);
@@ -15846,6 +16204,12 @@ TNode<Object> CodeStubAssembler::GetArgumentValue(TorqueStructArguments args,
   return CodeStubArguments(this, args).GetOptionalArgumentValue(index);
 }
 
+void CodeStubAssembler::SetArgumentValue(TorqueStructArguments args,
+                                         TNode<IntPtrT> index,
+                                         TNode<Object> value) {
+  CodeStubArguments(this, args).SetArgumentValue(index, value);
+}
+
 TorqueStructArguments CodeStubAssembler::GetFrameArguments(
     TNode<RawPtrT> frame, TNode<IntPtrT> argc,
     FrameArgumentsArgcType argc_type) {
@@ -15875,6 +16239,14 @@ void CodeStubAssembler::Print(const char* prefix,
   PrintToStream(prefix, tagged_value, fileno(stdout));
 }
 
+void CodeStubAssembler::Print(const char* prefix, TNode<UintPtrT> value) {
+  PrintToStream(prefix, value, fileno(stdout));
+}
+
+void CodeStubAssembler::Print(const char* prefix, TNode<Float64T> value) {
+  PrintToStream(prefix, value, fileno(stdout));
+}
+
 void CodeStubAssembler::PrintErr(const char* prefix,
                                  TNode<MaybeObject> tagged_value) {
   PrintToStream(prefix, tagged_value, fileno(stderr));
@@ -15886,8 +16258,8 @@ void CodeStubAssembler::PrintToStream(const char* prefix,
   if (prefix != nullptr) {
     std::string formatted(prefix);
     formatted += ": ";
-    Handle<String> string = isolate()->factory()->NewStringFromAsciiChecked(
-        formatted.c_str(), AllocationType::kOld);
+    Handle<String> string =
+        isolate()->factory()->InternalizeString(formatted.c_str());
     CallRuntime(Runtime::kGlobalPrint, NoContextConstant(),
                 HeapConstant(string), SmiConstant(stream));
   }
@@ -15898,6 +16270,60 @@ void CodeStubAssembler::PrintToStream(const char* prefix,
               SmiConstant(stream));
 }
 
+void CodeStubAssembler::PrintToStream(const char* prefix, TNode<UintPtrT> value,
+                                      int stream) {
+  if (prefix != nullptr) {
+    std::string formatted(prefix);
+    formatted += ": ";
+    Handle<String> string =
+        isolate()->factory()->InternalizeString(formatted.c_str());
+    CallRuntime(Runtime::kGlobalPrint, NoContextConstant(),
+                HeapConstant(string), SmiConstant(stream));
+  }
+
+  // We use 16 bit per chunk.
+  TNode<Smi> chunks[4];
+  for (int i = 0; i < 4; ++i) {
+    chunks[i] = SmiFromUint32(ReinterpretCast<Uint32T>(Word32And(
+        TruncateIntPtrToInt32(ReinterpretCast<IntPtrT>(value)), 0xFFFF)));
+    value = WordShr(value, IntPtrConstant(16));
+  }
+
+  // Args are: <bits 63-48>, <bits 47-32>, <bits 31-16>, <bits 15-0>, stream.
+  CallRuntime(Runtime::kDebugPrintWord, NoContextConstant(), chunks[3],
+              chunks[2], chunks[1], chunks[0], SmiConstant(stream));
+}
+
+void CodeStubAssembler::PrintToStream(const char* prefix, TNode<Float64T> value,
+                                      int stream) {
+  if (prefix != nullptr) {
+    std::string formatted(prefix);
+    formatted += ": ";
+    Handle<String> string =
+        isolate()->factory()->InternalizeString(formatted.c_str());
+    CallRuntime(Runtime::kGlobalPrint, NoContextConstant(),
+                HeapConstant(string), SmiConstant(stream));
+  }
+
+  // We use word32 extraction instead of `BitcastFloat64ToInt64` to support 32
+  // bit architectures, too.
+  TNode<Uint32T> high = Float64ExtractHighWord32(value);
+  TNode<Uint32T> low = Float64ExtractLowWord32(value);
+
+  // We use 16 bit per chunk.
+  TNode<Smi> chunks[4];
+  chunks[0] = SmiFromUint32(ReinterpretCast<Uint32T>(Word32And(low, 0xFFFF)));
+  chunks[1] = SmiFromUint32(ReinterpretCast<Uint32T>(
+      Word32And(Word32Shr(low, Int32Constant(16)), 0xFFFF)));
+  chunks[2] = SmiFromUint32(ReinterpretCast<Uint32T>(Word32And(high, 0xFFFF)));
+  chunks[3] = SmiFromUint32(ReinterpretCast<Uint32T>(
+      Word32And(Word32Shr(high, Int32Constant(16)), 0xFFFF)));
+
+  // Args are: <bits 63-48>, <bits 47-32>, <bits 31-16>, <bits 15-0>, stream.
+  CallRuntime(Runtime::kDebugPrintFloat, NoContextConstant(), chunks[3],
+              chunks[2], chunks[1], chunks[0], SmiConstant(stream));
+}
+
 IntegerLiteral CodeStubAssembler::ConstexprIntegerLiteralAdd(
     const IntegerLiteral& lhs, const IntegerLiteral& rhs) {
   return lhs + rhs;
@@ -15928,22 +16354,6 @@ void CodeStubAssembler::PerformStackCheck(TNode<Context> context) {
   BIND(&ok);
 }
 
-TNode<Object> CodeStubAssembler::CallApiCallback(
-    TNode<Object> context, TNode<RawPtrT> callback, TNode<Int32T> argc,
-    TNode<Object> data, TNode<Object> holder, TNode<Object> receiver) {
-  Callable callable = CodeFactory::CallApiCallback(isolate());
-  return CallStub(callable, context, callback, argc, data, holder, receiver);
-}
-
-TNode<Object> CodeStubAssembler::CallApiCallback(
-    TNode<Object> context, TNode<RawPtrT> callback, TNode<Int32T> argc,
-    TNode<Object> data, TNode<Object> holder, TNode<Object> receiver,
-    TNode<Object> value) {
-  Callable callable = CodeFactory::CallApiCallback(isolate());
-  return CallStub(callable, context, callback, argc, data, holder, receiver,
-                  value);
-}
-
 TNode<Object> CodeStubAssembler::CallRuntimeNewArray(
     TNode<Context> context, TNode<Object> receiver, TNode<Object> length,
     TNode<Object> new_target, TNode<Object> allocation_site) {
@@ -16461,14 +16871,13 @@ CodeStubAssembler::AllocateSwissNameDictionaryWithCapacity(
       SwissNameDictionaryMetaTableSizeFor(capacity);
 
   TNode<ByteArray> meta_table =
-      AllocateNonEmptyByteArray(Unsigned(meta_table_payload_size),
-                                AllocationFlag::kAllowLargeObjectAllocation);
+      AllocateNonEmptyByteArray(Unsigned(meta_table_payload_size));
 
   Comment("SwissNameDictionary allocation.");
   TNode<IntPtrT> total_size = SwissNameDictionarySizeFor(capacity);
 
-  TNode<SwissNameDictionary> table = UncheckedCast<SwissNameDictionary>(
-      Allocate(total_size, AllocationFlag::kAllowLargeObjectAllocation));
+  TNode<SwissNameDictionary> table =
+      UncheckedCast<SwissNameDictionary>(Allocate(total_size));
 
   StoreMapNoWriteBarrier(table, RootIndex::kSwissNameDictionaryMap);
 
@@ -16561,14 +16970,13 @@ TNode<SwissNameDictionary> CodeStubAssembler::CopySwissNameDictionary(
       SwissNameDictionaryMetaTableSizeFor(capacity);
 
   TNode<ByteArray> meta_table =
-      AllocateNonEmptyByteArray(Unsigned(meta_table_payload_size),
-                                AllocationFlag::kAllowLargeObjectAllocation);
+      AllocateNonEmptyByteArray(Unsigned(meta_table_payload_size));
 
   Comment("SwissNameDictionary allocation.");
   TNode<IntPtrT> total_size = SwissNameDictionarySizeFor(capacity);
 
-  TNode<SwissNameDictionary> table = UncheckedCast<SwissNameDictionary>(
-      Allocate(total_size, AllocationFlag::kAllowLargeObjectAllocation));
+  TNode<SwissNameDictionary> table =
+      UncheckedCast<SwissNameDictionary>(Allocate(total_size));
 
   StoreMapNoWriteBarrier(table, RootIndex::kSwissNameDictionaryMap);
 
@@ -16968,5 +17376,115 @@ void CodeStubAssembler::SharedValueBarrier(
   BIND(&done);
 }
 
+TNode<ArrayList> CodeStubAssembler::AllocateArrayList(TNode<Smi> size) {
+  TVARIABLE(ArrayList, result);
+  Label empty(this), nonempty(this), done(this);
+
+  Branch(SmiEqual(size, SmiConstant(0)), &empty, &nonempty);
+
+  BIND(&nonempty);
+  {
+    TNode<Smi> fixed_array_size =
+        SmiAdd(size, SmiConstant(ArrayList::kFirstIndex));
+    result =
+        CAST(AllocateFixedArray(PACKED_ELEMENTS, fixed_array_size,
+                                AllocationFlag::kNone, ArrayListMapConstant()));
+    ArrayListSetLength(result.value(), SmiConstant(0));
+
+    Goto(&done);
+  }
+
+  BIND(&empty);
+  {
+    result = EmptyArrayListConstant();
+    Goto(&done);
+  }
+
+  BIND(&done);
+  return result.value();
+}
+
+TNode<ArrayList> CodeStubAssembler::ArrayListEnsureSpace(
+    TNode<ArrayList> array, TNode<Smi> requested_size) {
+  Label overflow(this, Label::kDeferred);
+  TNode<Smi> capacity = LoadFixedArrayBaseLength(array);
+  TNode<Smi> requested_capacity =
+      TrySmiAdd(requested_size, SmiConstant(ArrayList::kFirstIndex), &overflow);
+
+  Label grow(this), done(this);
+
+  TVARIABLE(ArrayList, result_array, array);
+
+  GotoIf(SmiLessThan(capacity, requested_capacity), &grow);
+  Goto(&done);
+
+  BIND(&grow);
+  {
+    // new_capacity = new_length;
+    // new_capacity = capacity + max(capacity / 2, 2);
+    //
+    // Ensure calculation matches ArrayList::EnsureSpace.
+    TNode<Smi> new_capacity = TrySmiAdd(
+        requested_capacity,
+        SmiMax(SmiShr(requested_capacity, 1), SmiConstant(2)), &overflow);
+    result_array = CAST(
+        ExtractFixedArray<Smi>(array, SmiConstant(0), capacity, new_capacity,
+                               ExtractFixedArrayFlag::kFixedArrays));
+    Goto(&done);
+  }
+
+  BIND(&overflow);
+  CallRuntime(Runtime::kFatalInvalidSize, NoContextConstant());
+  Unreachable();
+
+  BIND(&done);
+  return result_array.value();
+}
+
+TNode<ArrayList> CodeStubAssembler::ArrayListAdd(TNode<ArrayList> array,
+                                                 TNode<Object> object) {
+  TNode<Smi> length = ArrayListGetLength(array);
+  TNode<Smi> new_length = SmiAdd(length, SmiConstant(1));
+  TNode<ArrayList> array_with_space = ArrayListEnsureSpace(array, new_length);
+
+  CSA_DCHECK(this, SmiEqual(ArrayListGetLength(array_with_space), length));
+
+  ArrayListSet(array_with_space, length, object);
+  ArrayListSetLength(array_with_space, new_length);
+
+  return array_with_space;
+}
+
+void CodeStubAssembler::ArrayListSet(TNode<ArrayList> array, TNode<Smi> index,
+                                     TNode<Object> object) {
+  StoreFixedArrayElement(
+      array, SmiAdd(SmiConstant(ArrayList::kFirstIndex), index), object);
+}
+
+TNode<Smi> CodeStubAssembler::ArrayListGetLength(TNode<ArrayList> array) {
+  TNode<Smi> capacity = LoadFixedArrayBaseLength(array);
+  return Select<Smi>(
+      SmiEqual(capacity, SmiConstant(0)), [=]() { return SmiConstant(0); },
+      [=]() {
+        return CAST(
+            LoadFixedArrayElement(array, SmiConstant(ArrayList::kLengthIndex)));
+      });
+}
+
+void CodeStubAssembler::ArrayListSetLength(TNode<ArrayList> array,
+                                           TNode<Smi> length) {
+  StoreFixedArrayElement(array, SmiConstant(ArrayList::kLengthIndex), length);
+}
+
+TNode<FixedArray> CodeStubAssembler::ArrayListElements(TNode<ArrayList> array) {
+  // TODO(v8:12499): Consider supporting other ElementsKinds.
+  constexpr ElementsKind kind = ElementsKind::PACKED_ELEMENTS;
+  TNode<IntPtrT> length = PositiveSmiUntag(ArrayListGetLength(array));
+  TNode<FixedArrayBase> elements = AllocateFixedArray(kind, length);
+  CopyElements(kind, elements, IntPtrConstant(0), array,
+               IntPtrConstant(ArrayList::kFirstIndex), length);
+  return CAST(elements);
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/codegen/code-stub-assembler.h b/deps/v8/src/codegen/code-stub-assembler.h
index fa41984c6ac64a..24def3b60b9529 100644
--- a/deps/v8/src/codegen/code-stub-assembler.h
+++ b/deps/v8/src/codegen/code-stub-assembler.h
@@ -21,6 +21,7 @@
 #include "src/objects/cell.h"
 #include "src/objects/feedback-vector.h"
 #include "src/objects/heap-number.h"
+#include "src/objects/hole.h"
 #include "src/objects/js-function.h"
 #include "src/objects/js-promise.h"
 #include "src/objects/js-proxy.h"
@@ -28,6 +29,7 @@
 #include "src/objects/oddball.h"
 #include "src/objects/shared-function-info.h"
 #include "src/objects/smi.h"
+#include "src/objects/string.h"
 #include "src/objects/swiss-name-dictionary.h"
 #include "src/objects/tagged-index.h"
 #include "src/roots/roots.h"
@@ -51,6 +53,26 @@ enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol };
 #define HEAP_MUTABLE_IMMOVABLE_OBJECT_LIST(V)                                  \
   V(ArrayIteratorProtector, array_iterator_protector, ArrayIteratorProtector)  \
   V(ArraySpeciesProtector, array_species_protector, ArraySpeciesProtector)     \
+  V(IsConcatSpreadableProtector, is_concat_spreadable_protector,               \
+    IsConcatSpreadableProtector)                                               \
+  V(MapIteratorProtector, map_iterator_protector, MapIteratorProtector)        \
+  V(NoElementsProtector, no_elements_protector, NoElementsProtector)           \
+  V(MegaDOMProtector, mega_dom_protector, MegaDOMProtector)                    \
+  V(NumberStringCache, number_string_cache, NumberStringCache)                 \
+  V(NumberStringNotRegexpLikeProtector,                                        \
+    number_string_not_regexp_like_protector,                                   \
+    NumberStringNotRegexpLikeProtector)                                        \
+  V(PromiseResolveProtector, promise_resolve_protector,                        \
+    PromiseResolveProtector)                                                   \
+  V(PromiseSpeciesProtector, promise_species_protector,                        \
+    PromiseSpeciesProtector)                                                   \
+  V(PromiseThenProtector, promise_then_protector, PromiseThenProtector)        \
+  V(RegExpSpeciesProtector, regexp_species_protector, RegExpSpeciesProtector)  \
+  V(SetIteratorProtector, set_iterator_protector, SetIteratorProtector)        \
+  V(StringIteratorProtector, string_iterator_protector,                        \
+    StringIteratorProtector)                                                   \
+  V(TypedArraySpeciesProtector, typed_array_species_protector,                 \
+    TypedArraySpeciesProtector)                                                \
   V(AsyncFunctionAwaitRejectSharedFun, async_function_await_reject_shared_fun, \
     AsyncFunctionAwaitRejectSharedFun)                                         \
   V(AsyncFunctionAwaitResolveSharedFun,                                        \
@@ -76,15 +98,6 @@ enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol };
     AsyncGeneratorYieldWithAwaitResolveSharedFun)                              \
   V(AsyncIteratorValueUnwrapSharedFun, async_iterator_value_unwrap_shared_fun, \
     AsyncIteratorValueUnwrapSharedFun)                                         \
-  V(IsConcatSpreadableProtector, is_concat_spreadable_protector,               \
-    IsConcatSpreadableProtector)                                               \
-  V(MapIteratorProtector, map_iterator_protector, MapIteratorProtector)        \
-  V(NoElementsProtector, no_elements_protector, NoElementsProtector)           \
-  V(MegaDOMProtector, mega_dom_protector, MegaDOMProtector)                    \
-  V(NumberStringCache, number_string_cache, NumberStringCache)                 \
-  V(NumberStringPrototypeNoReplaceProtector,                                   \
-    number_string_prototype_no_replace_protector,                              \
-    NumberStringPrototypeNoReplaceProtector)                                   \
   V(PromiseAllResolveElementSharedFun, promise_all_resolve_element_shared_fun, \
     PromiseAllResolveElementSharedFun)                                         \
   V(PromiseAllSettledRejectElementSharedFun,                                   \
@@ -106,27 +119,16 @@ enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol };
   V(PromiseGetCapabilitiesExecutorSharedFun,                                   \
     promise_get_capabilities_executor_shared_fun,                              \
     PromiseGetCapabilitiesExecutorSharedFun)                                   \
-  V(PromiseResolveProtector, promise_resolve_protector,                        \
-    PromiseResolveProtector)                                                   \
-  V(PromiseSpeciesProtector, promise_species_protector,                        \
-    PromiseSpeciesProtector)                                                   \
   V(PromiseThenFinallySharedFun, promise_then_finally_shared_fun,              \
     PromiseThenFinallySharedFun)                                               \
-  V(PromiseThenProtector, promise_then_protector, PromiseThenProtector)        \
   V(PromiseThrowerFinallySharedFun, promise_thrower_finally_shared_fun,        \
     PromiseThrowerFinallySharedFun)                                            \
   V(PromiseValueThunkFinallySharedFun, promise_value_thunk_finally_shared_fun, \
     PromiseValueThunkFinallySharedFun)                                         \
   V(ProxyRevokeSharedFun, proxy_revoke_shared_fun, ProxyRevokeSharedFun)       \
-  V(RegExpSpeciesProtector, regexp_species_protector, RegExpSpeciesProtector)  \
-  V(SetIteratorProtector, set_iterator_protector, SetIteratorProtector)        \
   V(ShadowRealmImportValueFulfilledSFI,                                        \
     shadow_realm_import_value_fulfilled_sfi,                                   \
-    ShadowRealmImportValueFulfilledSFI)                                        \
-  V(StringIteratorProtector, string_iterator_protector,                        \
-    StringIteratorProtector)                                                   \
-  V(TypedArraySpeciesProtector, typed_array_species_protector,                 \
-    TypedArraySpeciesProtector)
+    ShadowRealmImportValueFulfilledSFI)
 
 #define UNIQUE_INSTANCE_TYPE_IMMUTABLE_IMMOVABLE_MAP_ADAPTER( \
     V, rootIndexName, rootAccessorName, class_name)           \
@@ -137,16 +139,18 @@ enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol };
     AllocationSiteWithoutWeakNextMap)                                        \
   V(AllocationSiteWithWeakNextMap, allocation_site_map, AllocationSiteMap)   \
   V(arguments_to_string, arguments_to_string, ArgumentsToString)             \
+  V(ArrayListMap, array_list_map, ArrayListMap)                              \
   V(Array_string, Array_string, ArrayString)                                 \
   V(array_to_string, array_to_string, ArrayToString)                         \
   V(BooleanMap, boolean_map, BooleanMap)                                     \
   V(boolean_to_string, boolean_to_string, BooleanToString)                   \
   V(class_fields_symbol, class_fields_symbol, ClassFieldsSymbol)             \
   V(ConsOneByteStringMap, cons_one_byte_string_map, ConsOneByteStringMap)    \
-  V(ConsStringMap, cons_string_map, ConsStringMap)                           \
+  V(ConsTwoByteStringMap, cons_two_byte_string_map, ConsTwoByteStringMap)    \
   V(constructor_string, constructor_string, ConstructorString)               \
   V(date_to_string, date_to_string, DateToString)                            \
   V(default_string, default_string, DefaultString)                           \
+  V(EmptyArrayList, empty_array_list, EmptyArrayList)                        \
   V(EmptyByteArray, empty_byte_array, EmptyByteArray)                        \
   V(EmptyFixedArray, empty_fixed_array, EmptyFixedArray)                     \
   V(EmptyScopeInfo, empty_scope_info, EmptyScopeInfo)                        \
@@ -166,11 +170,14 @@ enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol };
   V(FixedCOWArrayMap, fixed_cow_array_map, FixedCOWArrayMap)                 \
   V(Function_string, function_string, FunctionString)                        \
   V(function_to_string, function_to_string, FunctionToString)                \
+  V(get_string, get_string, GetString)                                       \
   V(has_instance_symbol, has_instance_symbol, HasInstanceSymbol)             \
+  V(has_string, has_string, HasString)                                       \
   V(Infinity_string, Infinity_string, InfinityString)                        \
   V(is_concat_spreadable_symbol, is_concat_spreadable_symbol,                \
     IsConcatSpreadableSymbol)                                                \
   V(iterator_symbol, iterator_symbol, IteratorSymbol)                        \
+  V(keys_string, keys_string, KeysString)                                    \
   V(length_string, length_string, LengthString)                              \
   V(ManyClosuresCellMap, many_closures_cell_map, ManyClosuresCellMap)        \
   V(match_symbol, match_symbol, MatchSymbol)                                 \
@@ -191,7 +198,7 @@ enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol };
   V(number_to_string, number_to_string, NumberToString)                      \
   V(Object_string, Object_string, ObjectString)                              \
   V(object_to_string, object_to_string, ObjectToString)                      \
-  V(OneByteStringMap, one_byte_string_map, OneByteStringMap)                 \
+  V(SeqOneByteStringMap, seq_one_byte_string_map, SeqOneByteStringMap)       \
   V(OneClosureCellMap, one_closure_cell_map, OneClosureCellMap)              \
   V(OnePointerFillerMap, one_pointer_filler_map, OnePointerFillerMap)        \
   V(PromiseCapabilityMap, promise_capability_map, PromiseCapabilityMap)      \
@@ -214,14 +221,17 @@ enum class PrimitiveType { kBoolean, kNumber, kString, kSymbol };
   V(search_symbol, search_symbol, SearchSymbol)                              \
   V(SingleCharacterStringTable, single_character_string_table,               \
     SingleCharacterStringTable)                                              \
+  V(size_string, size_string, SizeString)                                    \
   V(species_symbol, species_symbol, SpeciesSymbol)                           \
   V(StaleRegister, stale_register, StaleRegister)                            \
   V(StoreHandler0Map, store_handler0_map, StoreHandler0Map)                  \
   V(string_string, string_string, StringString)                              \
   V(string_to_string, string_to_string, StringToString)                      \
-  V(StringMap, string_map, StringMap)                                        \
+  V(SeqTwoByteStringMap, seq_two_byte_string_map, SeqTwoByteStringMap)       \
   V(TheHoleValue, the_hole_value, TheHole)                                   \
+  V(PropertyCellHoleValue, property_cell_hole_value, PropertyCellHole)       \
   V(then_string, then_string, ThenString)                                    \
+  V(toJSON_string, toJSON_string, ToJSONString)                              \
   V(toString_string, toString_string, ToStringString)                        \
   V(to_primitive_symbol, to_primitive_symbol, ToPrimitiveSymbol)             \
   V(to_string_tag_symbol, to_string_tag_symbol, ToStringTagSymbol)           \
@@ -340,11 +350,14 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   enum class AllocationFlag : uint8_t {
     kNone = 0,
     kDoubleAlignment = 1,
-    kPretenured = 1 << 1,
-    kAllowLargeObjectAllocation = 1 << 2,
+    kPretenured = 1 << 1
   };
 
-  enum SlackTrackingMode { kWithSlackTracking, kNoSlackTracking };
+  enum SlackTrackingMode {
+    kWithSlackTracking,
+    kNoSlackTracking,
+    kDontInitializeInObjectProperties,
+  };
 
   using AllocationFlags = base::Flags<AllocationFlag>;
 
@@ -490,25 +503,42 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   PARAMETER_BINOP(IntPtrOrSmiSub, IntPtrSub, SmiSub)
 #undef PARAMETER_BINOP
 
-#define PARAMETER_BINOP(OpName, IntPtrOpName, SmiOpName)                      \
+#define PARAMETER_BINOP(OpName, IntPtrOpName, SmiOpName)                       \
+  TNode<BoolT> OpName(TNode<Smi> a, TNode<Smi> b) { return SmiOpName(a, b); }  \
+  TNode<BoolT> OpName(TNode<IntPtrT> a, TNode<IntPtrT> b) {                    \
+    return IntPtrOpName(a, b);                                                 \
+  }                                                                            \
+  /* IntPtrXXX comparisons shouldn't be used with unsigned types, use          \
+   * UintPtrXXX operations explicitly instead. */                              \
+  TNode<BoolT> OpName(TNode<UintPtrT> a, TNode<UintPtrT> b) { UNREACHABLE(); } \
+  TNode<BoolT> OpName(TNode<RawPtrT> a, TNode<RawPtrT> b) { UNREACHABLE(); }
+  // TODO(v8:9708): Define BInt operations once all uses are ported.
+  PARAMETER_BINOP(IntPtrOrSmiEqual, WordEqual, SmiEqual)
+  PARAMETER_BINOP(IntPtrOrSmiNotEqual, WordNotEqual, SmiNotEqual)
+  PARAMETER_BINOP(IntPtrOrSmiLessThan, IntPtrLessThan, SmiLessThan)
+  PARAMETER_BINOP(IntPtrOrSmiLessThanOrEqual, IntPtrLessThanOrEqual,
+                  SmiLessThanOrEqual)
+  PARAMETER_BINOP(IntPtrOrSmiGreaterThan, IntPtrGreaterThan, SmiGreaterThan)
+#undef PARAMETER_BINOP
+
+#define PARAMETER_BINOP(OpName, UintPtrOpName, SmiOpName)                     \
   TNode<BoolT> OpName(TNode<Smi> a, TNode<Smi> b) { return SmiOpName(a, b); } \
   TNode<BoolT> OpName(TNode<IntPtrT> a, TNode<IntPtrT> b) {                   \
-    return IntPtrOpName(a, b);                                                \
+    return UintPtrOpName(Unsigned(a), Unsigned(b));                           \
   }                                                                           \
   TNode<BoolT> OpName(TNode<UintPtrT> a, TNode<UintPtrT> b) {                 \
-    return IntPtrOpName(Signed(a), Signed(b));                                \
+    return UintPtrOpName(a, b);                                               \
   }                                                                           \
   TNode<BoolT> OpName(TNode<RawPtrT> a, TNode<RawPtrT> b) {                   \
-    return IntPtrOpName(a, b);                                                \
+    return UintPtrOpName(a, b);                                               \
   }
   // TODO(v8:9708): Define BInt operations once all uses are ported.
-  PARAMETER_BINOP(IntPtrOrSmiEqual, WordEqual, SmiEqual)
-  PARAMETER_BINOP(IntPtrOrSmiNotEqual, WordNotEqual, SmiNotEqual)
-  PARAMETER_BINOP(IntPtrOrSmiLessThan, IntPtrLessThan, SmiLessThan)
-  PARAMETER_BINOP(IntPtrOrSmiLessThanOrEqual, IntPtrLessThanOrEqual,
-                  SmiLessThanOrEqual)
-  PARAMETER_BINOP(IntPtrOrSmiGreaterThan, IntPtrGreaterThan, SmiGreaterThan)
+  PARAMETER_BINOP(UintPtrOrSmiEqual, WordEqual, SmiEqual)
+  PARAMETER_BINOP(UintPtrOrSmiNotEqual, WordNotEqual, SmiNotEqual)
   PARAMETER_BINOP(UintPtrOrSmiLessThan, UintPtrLessThan, SmiBelow)
+  PARAMETER_BINOP(UintPtrOrSmiLessThanOrEqual, UintPtrLessThanOrEqual,
+                  SmiBelowOrEqual)
+  PARAMETER_BINOP(UintPtrOrSmiGreaterThan, UintPtrGreaterThan, SmiAbove)
   PARAMETER_BINOP(UintPtrOrSmiGreaterThanOrEqual, UintPtrGreaterThanOrEqual,
                   SmiAboveOrEqual)
 #undef PARAMETER_BINOP
@@ -535,16 +565,26 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
 
   TNode<Smi> NoContextConstant();
 
-#define HEAP_CONSTANT_ACCESSOR(rootIndexName, rootAccessorName, name)  \
-  TNode<std::remove_pointer<std::remove_reference<decltype(            \
-      std::declval<ReadOnlyRoots>().rootAccessorName())>::type>::type> \
+  TNode<IntPtrT> StackAlignmentInBytes() {
+    // This node makes the graph platform-specific. To make sure that the graph
+    // structure is still platform independent, UniqueIntPtrConstants are used
+    // here.
+#if V8_TARGET_ARCH_ARM64
+    return UniqueIntPtrConstant(16);
+#else
+    return UniqueIntPtrConstant(kSystemPointerSize);
+#endif
+  }
+
+#define HEAP_CONSTANT_ACCESSOR(rootIndexName, rootAccessorName, name)    \
+  TNode<RemoveTagged<                                                    \
+      decltype(std::declval<ReadOnlyRoots>().rootAccessorName())>::type> \
       name##Constant();
   HEAP_IMMUTABLE_IMMOVABLE_OBJECT_LIST(HEAP_CONSTANT_ACCESSOR)
 #undef HEAP_CONSTANT_ACCESSOR
 
-#define HEAP_CONSTANT_ACCESSOR(rootIndexName, rootAccessorName, name) \
-  TNode<std::remove_pointer<std::remove_reference<decltype(           \
-      std::declval<Heap>().rootAccessorName())>::type>::type>         \
+#define HEAP_CONSTANT_ACCESSOR(rootIndexName, rootAccessorName, name)          \
+  TNode<RemoveTagged<decltype(std::declval<Heap>().rootAccessorName())>::type> \
       name##Constant();
   HEAP_MUTABLE_IMMOVABLE_OBJECT_LIST(HEAP_CONSTANT_ACCESSOR)
 #undef HEAP_CONSTANT_ACCESSOR
@@ -581,6 +621,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<UintPtrT> UintPtrMin(TNode<UintPtrT> left, TNode<UintPtrT> right);
 
   // Float64 operations.
+  TNode<BoolT> Float64AlmostEqual(TNode<Float64T> x, TNode<Float64T> y,
+                                  double max_relative_error = 0.0000001);
   TNode<Float64T> Float64Ceil(TNode<Float64T> x);
   TNode<Float64T> Float64Floor(TNode<Float64T> x);
   TNode<Float64T> Float64Round(TNode<Float64T> x);
@@ -598,6 +640,9 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<Smi> SmiTag(TNode<IntPtrT> value);
   // Untag a Smi value as an IntPtr.
   TNode<IntPtrT> SmiUntag(TNode<Smi> value);
+  // Untag a positive Smi value as an IntPtr, it's slightly better than
+  // SmiUntag() because it doesn't have to do sign extension.
+  TNode<IntPtrT> PositiveSmiUntag(TNode<Smi> value);
 
   // Smi conversions.
   TNode<Float64T> SmiToFloat64(TNode<Smi> value);
@@ -606,6 +651,7 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<Smi> SmiFromUint32(TNode<Uint32T> value);
   TNode<IntPtrT> SmiToIntPtr(TNode<Smi> value) { return SmiUntag(value); }
   TNode<Int32T> SmiToInt32(TNode<Smi> value);
+  TNode<Uint32T> PositiveSmiToUint32(TNode<Smi> value);
 
   // Smi operations.
 #define SMI_ARITHMETIC_BINOP(SmiOpName, IntPtrOpName, Int32OpName)          \
@@ -724,6 +770,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   SMI_COMPARISON_OP(SmiAboveOrEqual, UintPtrGreaterThanOrEqual,
                     Uint32GreaterThanOrEqual)
   SMI_COMPARISON_OP(SmiBelow, UintPtrLessThan, Uint32LessThan)
+  SMI_COMPARISON_OP(SmiBelowOrEqual, UintPtrLessThanOrEqual,
+                    Uint32LessThanOrEqual)
   SMI_COMPARISON_OP(SmiLessThan, IntPtrLessThan, Int32LessThan)
   SMI_COMPARISON_OP(SmiLessThanOrEqual, IntPtrLessThanOrEqual,
                     Int32LessThanOrEqual)
@@ -748,6 +796,9 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   //  1 iff x > y.
   TNode<Smi> SmiLexicographicCompare(TNode<Smi> x, TNode<Smi> y);
 
+  // Returns Smi::zero() if no CoverageInfo exists.
+  TNode<Object> GetCoverageInfo(TNode<SharedFunctionInfo> sfi);
+
 #ifdef BINT_IS_SMI
 #define BINT_COMPARISON_OP(BIntOpName, SmiOpName, IntPtrOpName) \
   TNode<BoolT> BIntOpName(TNode<BInt> a, TNode<BInt> b) {       \
@@ -837,23 +888,7 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
 
   void FastCheck(TNode<BoolT> condition);
 
-  // TODO(v8:11880): remove once InstructionStream::bytecode_or_interpreter_data
-  // field is cached in or moved to Code.
-  TNode<InstructionStream> FromCodeNonBuiltin(TNode<Code> code) {
-    // Compute the InstructionStream object pointer from the code entry point.
-    TNode<RawPtrT> code_entry = Load<RawPtrT>(
-        code, IntPtrConstant(Code::kCodeEntryPointOffset - kHeapObjectTag));
-    TNode<Object> o = BitcastWordToTagged(IntPtrSub(
-        code_entry,
-        IntPtrConstant(InstructionStream::kHeaderSize - kHeapObjectTag)));
-    return CAST(o);
-  }
-
-  TNode<Code> ToCode(TNode<InstructionStream> code) {
-    return LoadObjectField<Code>(code, InstructionStream::kCodeOffset);
-  }
-
-  TNode<RawPtrT> GetCodeEntry(TNode<Code> code);
+  TNode<RawPtrT> LoadCodeInstructionStart(TNode<Code> code);
   TNode<BoolT> IsMarkedForDeoptimization(TNode<Code> code);
 
   // The following Call wrappers call an object according to the semantics that
@@ -945,14 +980,14 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                                     int false_value);
   TNode<IntPtrT> SelectIntPtrConstant(TNode<BoolT> condition, int true_value,
                                       int false_value);
-  TNode<Oddball> SelectBooleanConstant(TNode<BoolT> condition);
-  TNode<Smi> SelectSmiConstant(TNode<BoolT> condition, Smi true_value,
-                               Smi false_value);
+  TNode<Boolean> SelectBooleanConstant(TNode<BoolT> condition);
+  TNode<Smi> SelectSmiConstant(TNode<BoolT> condition, Tagged<Smi> true_value,
+                               Tagged<Smi> false_value);
   TNode<Smi> SelectSmiConstant(TNode<BoolT> condition, int true_value,
-                               Smi false_value) {
+                               Tagged<Smi> false_value) {
     return SelectSmiConstant(condition, Smi::FromInt(true_value), false_value);
   }
-  TNode<Smi> SelectSmiConstant(TNode<BoolT> condition, Smi true_value,
+  TNode<Smi> SelectSmiConstant(TNode<BoolT> condition, Tagged<Smi> true_value,
                                int false_value) {
     return SelectSmiConstant(condition, true_value, Smi::FromInt(false_value));
   }
@@ -1133,6 +1168,34 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                                     TNode<RawPtrT> pointer,
                                     ExternalPointerTag tag);
 
+  // Load an indirect pointer field.
+  TNode<HeapObject> LoadIndirectPointerFromObject(TNode<HeapObject> object,
+                                                  int offset);
+
+  // Load a field that contains either an indirect pointer (if the sandbox is
+  // enabled) or a regular/tagged pointer (otherwise).
+  TNode<HeapObject> LoadMaybeIndirectPointerFromObject(TNode<HeapObject> object,
+                                                       int offset);
+
+  // When the sandbox is enabled, this will load the Code object pointer from
+  // the code pointer table entry.
+  // Load a code entrypoint pointer from an object.
+  // When the sandbox is enabled, this will load the entrypoint pointer from the
+  // code pointer table entry.
+  TNode<RawPtrT> LoadCodeEntrypointFromObject(TNode<HeapObject> object,
+                                              int offset) {
+    return LoadCodeEntrypointFromObject(object, IntPtrConstant(offset));
+  }
+  TNode<RawPtrT> LoadCodeEntrypointFromObject(TNode<HeapObject> object,
+                                              TNode<IntPtrT> offset);
+
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // Helper function to load a CodePointerHandle from an object and compute the
+  // offset into the code pointer table from it.
+  TNode<UintPtrT> ComputeCodePointerTableEntryOffset(
+      TNode<HeapObject> object, TNode<IntPtrT> field_offset);
+#endif
+
   TNode<RawPtrT> LoadForeignForeignAddressPtr(TNode<Foreign> object) {
     return LoadExternalPointerFromObject(object, Foreign::kForeignAddressOffset,
                                          kForeignForeignAddressTag);
@@ -1180,6 +1243,13 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
     return LoadExternalPointerFromObject(
         object, WasmTypeInfo::kNativeTypeOffset, kWasmTypeInfoNativeTypeTag);
   }
+
+  TNode<RawPtrT> LoadWasmExportedFunctionDataSigPtr(
+      TNode<WasmExportedFunctionData> object) {
+    return LoadExternalPointerFromObject(object,
+                                         WasmExportedFunctionData::kSigOffset,
+                                         kWasmExportedFunctionDataSignatureTag);
+  }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   TNode<RawPtrT> LoadJSTypedArrayExternalPointerPtr(
@@ -1265,8 +1335,9 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
         LoadFromObject(MachineTypeOf<T>::value, object,
                        IntPtrSub(offset, IntPtrConstant(kHeapObjectTag))));
   }
-  // Load a SMI field and untag it.
-  TNode<IntPtrT> LoadAndUntagObjectField(TNode<HeapObject> object, int offset);
+  // Load a positive SMI field and untag it.
+  TNode<IntPtrT> LoadAndUntagPositiveSmiObjectField(TNode<HeapObject> object,
+                                                    int offset);
   // Load a SMI field, untag it, and convert to Word32.
   TNode<Int32T> LoadAndUntagToWord32ObjectField(TNode<HeapObject> object,
                                                 int offset);
@@ -1388,7 +1459,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
 
   // Load the properties backing store of a JSReceiver.
   TNode<HeapObject> LoadSlowProperties(TNode<JSReceiver> object);
-  TNode<HeapObject> LoadFastProperties(TNode<JSReceiver> object);
+  TNode<HeapObject> LoadFastProperties(TNode<JSReceiver> object,
+                                       bool skip_empty_check = false);
   // Load the elements backing store of a JSObject.
   TNode<FixedArrayBase> LoadElements(TNode<JSObject> object) {
     return LoadJSObjectElements(object);
@@ -1402,9 +1474,13 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<Smi> LoadFixedArrayBaseLength(TNode<FixedArrayBase> array);
   // Load the length of a fixed array base instance.
   TNode<IntPtrT> LoadAndUntagFixedArrayBaseLength(TNode<FixedArrayBase> array);
+  TNode<Uint32T> LoadAndUntagFixedArrayBaseLengthAsUint32(
+      TNode<FixedArrayBase> array);
   // Load the length of a WeakFixedArray.
   TNode<Smi> LoadWeakFixedArrayLength(TNode<WeakFixedArray> array);
   TNode<IntPtrT> LoadAndUntagWeakFixedArrayLength(TNode<WeakFixedArray> array);
+  TNode<Uint32T> LoadAndUntagWeakFixedArrayLengthAsUint32(
+      TNode<WeakFixedArray> array);
   // Load the number of descriptors in DescriptorArray.
   TNode<Int32T> LoadNumberOfDescriptors(TNode<DescriptorArray> array);
   // Load the number of own descriptors of a map.
@@ -1433,15 +1509,19 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   // Load the constructor of a Map (equivalent to Map::GetConstructor()).
   TNode<Object> LoadMapConstructor(TNode<Map> map);
   // Load the EnumLength of a Map.
-  TNode<WordT> LoadMapEnumLength(TNode<Map> map);
+  TNode<Uint32T> LoadMapEnumLength(TNode<Map> map);
   // Load the back-pointer of a Map.
   TNode<Object> LoadMapBackPointer(TNode<Map> map);
+  // Compute the used instance size in words of a map.
+  TNode<IntPtrT> MapUsedInstanceSizeInWords(TNode<Map> map);
+  // Compute the number of used inobject properties on a map.
+  TNode<IntPtrT> MapUsedInObjectProperties(TNode<Map> map);
   // Checks that |map| has only simple properties, returns bitfield3.
   TNode<Uint32T> EnsureOnlyHasSimpleProperties(TNode<Map> map,
                                                TNode<Int32T> instance_type,
                                                Label* bailout);
   // Load the identity hash of a JSRececiver.
-  TNode<IntPtrT> LoadJSReceiverIdentityHash(TNode<JSReceiver> receiver,
+  TNode<Uint32T> LoadJSReceiverIdentityHash(TNode<JSReceiver> receiver,
                                             Label* if_no_hash = nullptr);
 
   // This is only used on a newly allocated PropertyArray which
@@ -1668,6 +1748,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<Map> LoadObjectFunctionInitialMap(TNode<NativeContext> native_context);
   TNode<Map> LoadSlowObjectWithNullPrototypeMap(
       TNode<NativeContext> native_context);
+  TNode<Map> LoadCachedMap(TNode<NativeContext> native_context,
+                           TNode<IntPtrT> number_of_properties, Label* runtime);
 
   TNode<Map> LoadJSArrayElementsMap(ElementsKind kind,
                                     TNode<NativeContext> native_context);
@@ -1686,6 +1768,9 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<HeapObject> LoadJSFunctionPrototype(TNode<JSFunction> function,
                                             Label* if_bailout);
 
+  // Load the "code" property of a JSFunction.
+  TNode<Code> LoadJSFunctionCode(TNode<JSFunction> function);
+
   TNode<BytecodeArray> LoadSharedFunctionInfoBytecodeArray(
       TNode<SharedFunctionInfo> shared);
 
@@ -1703,6 +1788,26 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                         TNode<Object> value);
   void StoreObjectField(TNode<HeapObject> object, TNode<IntPtrT> offset,
                         TNode<Object> value);
+
+  // Store to an indirect pointer field. This involves loading the index for
+  // the pointer table entry owned by the pointed-to object (which points back
+  // to it) and storing that into the specified field.
+  // TODO(saelo) Currently, only Code objects can be referenced through
+  // indirect pointers, and so we only support these here, but we should
+  // generalize this.
+  void StoreIndirectPointerField(TNode<HeapObject> object, int offset,
+                                 TNode<Code> value);
+  void StoreIndirectPointerFieldNoWriteBarrier(TNode<HeapObject> object,
+                                               int offset, TNode<Code> value);
+
+  // Store to a field that either contains an indirect pointer (when the
+  // sandbox is enabled) or a regular (tagged) pointer otherwise.
+  void StoreMaybeIndirectPointerField(TNode<HeapObject> object, int offset,
+                                      TNode<Code> value);
+  void StoreMaybeIndirectPointerFieldNoWriteBarrier(TNode<HeapObject> object,
+                                                    int offset,
+                                                    TNode<Code> value);
+
   template <class T>
   void StoreObjectFieldNoWriteBarrier(TNode<HeapObject> object,
                                       TNode<IntPtrT> offset, TNode<T> value) {
@@ -1905,8 +2010,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                                   TNode<IntPtrT> digit_index);
 
   // Allocate a ByteArray with the given non-zero length.
-  TNode<ByteArray> AllocateNonEmptyByteArray(TNode<UintPtrT> length,
-                                             AllocationFlags flags);
+  TNode<ByteArray> AllocateNonEmptyByteArray(
+      TNode<UintPtrT> length, AllocationFlags flags = AllocationFlag::kNone);
 
   // Allocate a ByteArray with the given length.
   TNode<ByteArray> AllocateByteArray(
@@ -1995,14 +2100,14 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
       ElementsKind kind, TNode<Map> array_map, TNode<Smi> capacity,
       TNode<Smi> length, base::Optional<TNode<AllocationSite>> allocation_site,
       AllocationFlags allocation_flags = AllocationFlag::kNone) {
-    return AllocateJSArray(kind, array_map, SmiUntag(capacity), length,
+    return AllocateJSArray(kind, array_map, PositiveSmiUntag(capacity), length,
                            allocation_site, allocation_flags);
   }
   TNode<JSArray> AllocateJSArray(
       ElementsKind kind, TNode<Map> array_map, TNode<Smi> capacity,
       TNode<Smi> length,
       AllocationFlags allocation_flags = AllocationFlag::kNone) {
-    return AllocateJSArray(kind, array_map, SmiUntag(capacity), length,
+    return AllocateJSArray(kind, array_map, PositiveSmiUntag(capacity), length,
                            base::nullopt, allocation_flags);
   }
   TNode<JSArray> AllocateJSArray(
@@ -2052,11 +2157,10 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                                         Label* if_bailout);
   TNode<Object> GetConstructor(TNode<Map> map);
 
-  void FindNonDefaultConstructorOrConstruct(TNode<Context> context,
-                                            TNode<JSFunction> this_function,
-                                            TVariable<Object>& constructor,
-                                            Label* found_default_base_ctor,
-                                            Label* found_something_else);
+  void FindNonDefaultConstructor(TNode<JSFunction> this_function,
+                                 TVariable<Object>& constructor,
+                                 Label* found_default_base_ctor,
+                                 Label* found_something_else);
 
   TNode<Map> GetInstanceTypeMap(InstanceType instance_type);
 
@@ -2067,8 +2171,7 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
 
   TNode<FixedArray> AllocateZeroedFixedArray(TNode<IntPtrT> capacity) {
     TNode<FixedArray> result = UncheckedCast<FixedArray>(
-        AllocateFixedArray(PACKED_ELEMENTS, capacity,
-                           AllocationFlag::kAllowLargeObjectAllocation));
+        AllocateFixedArray(PACKED_ELEMENTS, capacity));
     FillEntireFixedArrayWithSmiZero(PACKED_ELEMENTS, result, capacity);
     return result;
   }
@@ -2076,14 +2179,13 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<FixedDoubleArray> AllocateZeroedFixedDoubleArray(
       TNode<IntPtrT> capacity) {
     TNode<FixedDoubleArray> result = UncheckedCast<FixedDoubleArray>(
-        AllocateFixedArray(PACKED_DOUBLE_ELEMENTS, capacity,
-                           AllocationFlag::kAllowLargeObjectAllocation));
+        AllocateFixedArray(PACKED_DOUBLE_ELEMENTS, capacity));
     FillEntireFixedDoubleArrayWithZero(result, capacity);
     return result;
   }
 
-  TNode<FixedArray> AllocateFixedArrayWithHoles(TNode<IntPtrT> capacity,
-                                                AllocationFlags flags) {
+  TNode<FixedArray> AllocateFixedArrayWithHoles(
+      TNode<IntPtrT> capacity, AllocationFlags flags = AllocationFlag::kNone) {
     TNode<FixedArray> result = UncheckedCast<FixedArray>(
         AllocateFixedArray(PACKED_ELEMENTS, capacity, flags));
     FillFixedArrayWithValue(PACKED_ELEMENTS, result, IntPtrConstant(0),
@@ -2092,7 +2194,7 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   }
 
   TNode<FixedDoubleArray> AllocateFixedDoubleArrayWithHoles(
-      TNode<IntPtrT> capacity, AllocationFlags flags) {
+      TNode<IntPtrT> capacity, AllocationFlags flags = AllocationFlag::kNone) {
     TNode<FixedDoubleArray> result = UncheckedCast<FixedDoubleArray>(
         AllocateFixedArray(PACKED_DOUBLE_ELEMENTS, capacity, flags));
     FillFixedArrayWithValue(PACKED_DOUBLE_ELEMENTS, result, IntPtrConstant(0),
@@ -2105,13 +2207,18 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   // TODO(v8:9722): Return type should be JSIteratorResult
   TNode<JSObject> AllocateJSIteratorResult(TNode<Context> context,
                                            TNode<Object> value,
-                                           TNode<Oddball> done);
+                                           TNode<Boolean> done);
 
   // TODO(v8:9722): Return type should be JSIteratorResult
   TNode<JSObject> AllocateJSIteratorResultForEntry(TNode<Context> context,
                                                    TNode<Object> key,
                                                    TNode<Object> value);
 
+  TNode<JSObject> AllocatePromiseWithResolversResult(TNode<Context> context,
+                                                     TNode<Object> promise,
+                                                     TNode<Object> resolve,
+                                                     TNode<Object> reject);
+
   TNode<JSReceiver> ArraySpeciesCreate(TNode<Context> context,
                                        TNode<Object> originalArray,
                                        TNode<Number> len);
@@ -2244,6 +2351,22 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
     return UncheckedCast<FixedDoubleArray>(base);
   }
 
+  TNode<ArrayList> AllocateArrayList(TNode<Smi> size);
+
+  TNode<ArrayList> ArrayListEnsureSpace(TNode<ArrayList> array,
+                                        TNode<Smi> size);
+
+  TNode<ArrayList> ArrayListAdd(TNode<ArrayList> array, TNode<Object> object);
+
+  void ArrayListSet(TNode<ArrayList> array, TNode<Smi> index,
+                    TNode<Object> object);
+
+  TNode<Smi> ArrayListGetLength(TNode<ArrayList> array);
+
+  void ArrayListSetLength(TNode<ArrayList> array, TNode<Smi> length);
+
+  TNode<FixedArray> ArrayListElements(TNode<ArrayList> array);
+
   template <typename T>
   bool ClassHasMapConstant() {
     return false;
@@ -2440,28 +2563,31 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                               Label* if_number, TVariable<Word32T>* var_word32,
                               Label* if_bigint, Label* if_bigint64,
                               TVariable<BigInt>* var_maybe_bigint);
+  struct FeedbackValues {
+    TVariable<Smi>* var_feedback = nullptr;
+    const LazyNode<HeapObject>* maybe_feedback_vector = nullptr;
+    TNode<UintPtrT>* slot = nullptr;
+    UpdateFeedbackMode update_mode = UpdateFeedbackMode::kNoFeedback;
+  };
   void TaggedToWord32OrBigIntWithFeedback(TNode<Context> context,
                                           TNode<Object> value, Label* if_number,
                                           TVariable<Word32T>* var_word32,
                                           Label* if_bigint, Label* if_bigint64,
                                           TVariable<BigInt>* var_maybe_bigint,
-                                          TVariable<Smi>* var_feedback);
+                                          const FeedbackValues& feedback);
   void TaggedPointerToWord32OrBigIntWithFeedback(
       TNode<Context> context, TNode<HeapObject> pointer, Label* if_number,
       TVariable<Word32T>* var_word32, Label* if_bigint, Label* if_bigint64,
-      TVariable<BigInt>* var_maybe_bigint, TVariable<Smi>* var_feedback);
+      TVariable<BigInt>* var_maybe_bigint, const FeedbackValues& feedback);
 
   TNode<Int32T> TruncateNumberToWord32(TNode<Number> value);
   // Truncate the floating point value of a HeapNumber to an Int32.
   TNode<Int32T> TruncateHeapNumberValueToWord32(TNode<HeapNumber> object);
 
   // Conversions.
-  void TryHeapNumberToSmi(TNode<HeapNumber> number, TVariable<Smi>* output,
-                          Label* if_smi);
-  void TryFloat32ToSmi(TNode<Float32T> number, TVariable<Smi>* output,
-                       Label* if_smi);
-  void TryFloat64ToSmi(TNode<Float64T> number, TVariable<Smi>* output,
-                       Label* if_smi);
+  TNode<Smi> TryHeapNumberToSmi(TNode<HeapNumber> number, Label* not_smi);
+  TNode<Smi> TryFloat32ToSmi(TNode<Float32T> number, Label* not_smi);
+  TNode<Smi> TryFloat64ToSmi(TNode<Float64T> number, Label* not_smi);
   TNode<Number> ChangeFloat32ToTagged(TNode<Float32T> value);
   TNode<Number> ChangeFloat64ToTagged(TNode<Float64T> value);
   TNode<Number> ChangeInt32ToTagged(TNode<Int32T> value);
@@ -2593,6 +2719,10 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<BoolT> IsHashTable(TNode<HeapObject> object);
   TNode<BoolT> IsEphemeronHashTable(TNode<HeapObject> object);
   TNode<BoolT> IsHeapNumberInstanceType(TNode<Int32T> instance_type);
+  // We only want to check for any hole in a negated way. For regular hole
+  // checks, we should check for a specific hole kind instead.
+  TNode<BoolT> IsNotAnyHole(TNode<Object> object);
+  TNode<BoolT> IsHoleInstanceType(TNode<Int32T> instance_type);
   TNode<BoolT> IsOddball(TNode<HeapObject> object);
   TNode<BoolT> IsOddballInstanceType(TNode<Int32T> instance_type);
   TNode<BoolT> IsIndirectStringInstanceType(TNode<Int32T> instance_type);
@@ -2706,7 +2836,9 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<BoolT> IsTypedArraySpeciesProtectorCellInvalid();
   TNode<BoolT> IsRegExpSpeciesProtectorCellInvalid();
   TNode<BoolT> IsPromiseSpeciesProtectorCellInvalid();
-  TNode<BoolT> IsNumberStringPrototypeNoReplaceProtectorCellInvalid();
+  TNode<BoolT> IsNumberStringNotRegexpLikeProtectorCellInvalid();
+  TNode<BoolT> IsSetIteratorProtectorCellInvalid();
+  TNode<BoolT> IsMapIteratorProtectorCellInvalid();
 
   TNode<IntPtrT> LoadBasicMemoryChunkFlags(TNode<HeapObject> object);
 
@@ -2732,12 +2864,6 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
         ExternalReference::address_of_shared_string_table_flag());
   }
 
-  TNode<BoolT> HasHarmonySymbolAsWeakmapKeyFlag() {
-    return LoadRuntimeFlag(
-        ExternalReference::
-            address_of_FLAG_harmony_symbol_as_weakmap_key());
-  }
-
   // True iff |object| is a Smi or a HeapNumber or a BigInt.
   TNode<BoolT> IsNumeric(TNode<Object> object);
 
@@ -2861,6 +2987,12 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   // ES#sec-touint32
   TNode<Number> ToUint32(TNode<Context> context, TNode<Object> input);
 
+  // No-op on 32-bit, otherwise zero extend.
+  TNode<IntPtrT> ChangePositiveInt32ToIntPtr(TNode<Int32T> input) {
+    CSA_DCHECK(this, Int32GreaterThanOrEqual(input, Int32Constant(0)));
+    return Signed(ChangeUint32ToWord(input));
+  }
+
   // Convert any object to a String.
   TNode<String> ToString_Inline(TNode<Context> context, TNode<Object> input);
 
@@ -3256,8 +3388,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                    TNode<Smi> enum_index);
 
   template <class Dictionary>
-  void Add(TNode<Dictionary> dictionary, TNode<Name> key, TNode<Object> value,
-           Label* bailout);
+  void AddToDictionary(TNode<Dictionary> dictionary, TNode<Name> key,
+                       TNode<Object> value, Label* bailout);
 
   // Tries to check if {object} has own {unique_name} property.
   void TryHasOwnProperty(TNode<HeapObject> object, TNode<Map> map,
@@ -3281,22 +3413,32 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
     // descriptor
     kReturnAccessorPair
   };
+  // Receiver handling mode for TryGetOwnProperty and CallGetterIfAccessor.
+  enum ExpectedReceiverMode {
+    // The receiver is guaranteed to be JSReceiver, no conversion is necessary
+    // in case a function callback template has to be called.
+    kExpectingJSReceiver,
+    // The receiver can be anything, it has to be converted to JSReceiver
+    // in case a function callback template has to be called.
+    kExpectingAnyReceiver,
+  };
   // Tries to get {object}'s own {unique_name} property value. If the property
   // is an accessor then it also calls a getter. If the property is a double
   // field it re-wraps value in an immutable heap number. {unique_name} must be
   // a unique name (Symbol or InternalizedString) that is not an array index.
-  void TryGetOwnProperty(TNode<Context> context, TNode<Object> receiver,
-                         TNode<JSReceiver> object, TNode<Map> map,
-                         TNode<Int32T> instance_type, TNode<Name> unique_name,
-                         Label* if_found_value, TVariable<Object>* var_value,
-                         Label* if_not_found, Label* if_bailout);
-  void TryGetOwnProperty(TNode<Context> context, TNode<Object> receiver,
-                         TNode<JSReceiver> object, TNode<Map> map,
-                         TNode<Int32T> instance_type, TNode<Name> unique_name,
-                         Label* if_found_value, TVariable<Object>* var_value,
-                         TVariable<Uint32T>* var_details,
-                         TVariable<Object>* var_raw_value, Label* if_not_found,
-                         Label* if_bailout, GetOwnPropertyMode mode);
+  void TryGetOwnProperty(
+      TNode<Context> context, TNode<Object> receiver, TNode<JSReceiver> object,
+      TNode<Map> map, TNode<Int32T> instance_type, TNode<Name> unique_name,
+      Label* if_found_value, TVariable<Object>* var_value, Label* if_not_found,
+      Label* if_bailout,
+      ExpectedReceiverMode expected_receiver_mode = kExpectingAnyReceiver);
+  void TryGetOwnProperty(
+      TNode<Context> context, TNode<Object> receiver, TNode<JSReceiver> object,
+      TNode<Map> map, TNode<Int32T> instance_type, TNode<Name> unique_name,
+      Label* if_found_value, TVariable<Object>* var_value,
+      TVariable<Uint32T>* var_details, TVariable<Object>* var_raw_value,
+      Label* if_not_found, Label* if_bailout, GetOwnPropertyMode mode,
+      ExpectedReceiverMode expected_receiver_mode = kExpectingAnyReceiver);
 
   TNode<PropertyDescriptorObject> AllocatePropertyDescriptorObject(
       TNode<Context> context);
@@ -3314,6 +3456,16 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
     return CallBuiltin(Builtin::kGetProperty, context, receiver, name);
   }
 
+  TNode<BoolT> IsInterestingProperty(TNode<Name> name);
+  TNode<Object> GetInterestingProperty(TNode<Context> context,
+                                       TNode<JSReceiver> receiver,
+                                       TNode<Name> name, Label* if_not_found);
+  TNode<Object> GetInterestingProperty(TNode<Context> context,
+                                       TNode<Object> receiver,
+                                       TVariable<HeapObject>* var_holder,
+                                       TVariable<Map>* var_holder_map,
+                                       TNode<Name> name, Label* if_not_found);
+
   TNode<Object> SetPropertyStrict(TNode<Context> context,
                                   TNode<Object> receiver, TNode<Object> key,
                                   TNode<Object> value) {
@@ -3454,11 +3606,11 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   // Returns true if {object} has {prototype} somewhere in it's prototype
   // chain, otherwise false is returned. Might cause arbitrary side effects
   // due to [[GetPrototypeOf]] invocations.
-  TNode<Oddball> HasInPrototypeChain(TNode<Context> context,
+  TNode<Boolean> HasInPrototypeChain(TNode<Context> context,
                                      TNode<HeapObject> object,
                                      TNode<Object> prototype);
   // ES6 section 7.3.19 OrdinaryHasInstance (C, O)
-  TNode<Oddball> OrdinaryHasInstance(TNode<Context> context,
+  TNode<Boolean> OrdinaryHasInstance(TNode<Context> context,
                                      TNode<Object> callable,
                                      TNode<Object> object);
 
@@ -3548,6 +3700,10 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   void BigIntToRawBytes(TNode<BigInt> bigint, TVariable<UintPtrT>* var_low,
                         TVariable<UintPtrT>* var_high);
 
+#if V8_ENABLE_WEBASSEMBLY
+  TorqueStructInt64AsInt32Pair BigIntToRawBytes(TNode<BigInt> value);
+#endif  // V8_ENABLE_WEBASSEMBLY
+
   void EmitElementStore(TNode<JSObject> object, TNode<Object> key,
                         TNode<Object> value, ElementsKind elements_kind,
                         KeyedAccessStoreMode store_mode, Label* bailout,
@@ -3680,14 +3836,14 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                                                     TNode<Uint32T> depth,
                                                     Label* target);
 
-  TNode<Oddball> RelationalComparison(
+  TNode<Boolean> RelationalComparison(
       Operation op, TNode<Object> left, TNode<Object> right,
       TNode<Context> context, TVariable<Smi>* var_type_feedback = nullptr) {
     return RelationalComparison(
         op, left, right, [=]() { return context; }, var_type_feedback);
   }
 
-  TNode<Oddball> RelationalComparison(
+  TNode<Boolean> RelationalComparison(
       Operation op, TNode<Object> left, TNode<Object> right,
       const LazyNode<Context>& context,
       TVariable<Smi>* var_type_feedback = nullptr);
@@ -3740,22 +3896,25 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   void GotoIfNumberGreaterThanOrEqual(TNode<Number> left, TNode<Number> right,
                                       Label* if_false);
 
-  TNode<Oddball> Equal(TNode<Object> lhs, TNode<Object> rhs,
+  TNode<Boolean> Equal(TNode<Object> lhs, TNode<Object> rhs,
                        TNode<Context> context,
                        TVariable<Smi>* var_type_feedback = nullptr) {
     return Equal(
         lhs, rhs, [=]() { return context; }, var_type_feedback);
   }
-  TNode<Oddball> Equal(TNode<Object> lhs, TNode<Object> rhs,
+  TNode<Boolean> Equal(TNode<Object> lhs, TNode<Object> rhs,
                        const LazyNode<Context>& context,
                        TVariable<Smi>* var_type_feedback = nullptr);
 
-  TNode<Oddball> StrictEqual(TNode<Object> lhs, TNode<Object> rhs,
+  TNode<Boolean> StrictEqual(TNode<Object> lhs, TNode<Object> rhs,
                              TVariable<Smi>* var_type_feedback = nullptr);
 
   void GotoIfStringEqual(TNode<String> lhs, TNode<IntPtrT> lhs_length,
                          TNode<String> rhs, Label* if_true) {
     Label if_false(this);
+    // Callers must handle the case where {lhs} and {rhs} refer to the same
+    // String object.
+    CSA_DCHECK(this, TaggedNotEqual(lhs, rhs));
     TNode<IntPtrT> rhs_length = LoadStringLengthAsWord(rhs);
     BranchIfStringEqual(lhs, lhs_length, rhs, rhs_length, if_true, &if_false,
                         nullptr);
@@ -3765,7 +3924,7 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
 
   void BranchIfStringEqual(TNode<String> lhs, TNode<String> rhs, Label* if_true,
                            Label* if_false,
-                           TVariable<Oddball>* result = nullptr) {
+                           TVariable<Boolean>* result = nullptr) {
     return BranchIfStringEqual(lhs, LoadStringLengthAsWord(lhs), rhs,
                                LoadStringLengthAsWord(rhs), if_true, if_false,
                                result);
@@ -3774,7 +3933,7 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   void BranchIfStringEqual(TNode<String> lhs, TNode<IntPtrT> lhs_length,
                            TNode<String> rhs, TNode<IntPtrT> rhs_length,
                            Label* if_true, Label* if_false,
-                           TVariable<Oddball>* result = nullptr);
+                           TVariable<Boolean>* result = nullptr);
 
   // ECMA#sec-samevalue
   // Similar to StrictEqual except that NaNs are treated as equal and minus zero
@@ -3791,11 +3950,11 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
 
   enum HasPropertyLookupMode { kHasProperty, kForInHasProperty };
 
-  TNode<Oddball> HasProperty(TNode<Context> context, TNode<Object> object,
+  TNode<Boolean> HasProperty(TNode<Context> context, TNode<Object> object,
                              TNode<Object> key, HasPropertyLookupMode mode);
 
   // Due to naming conflict with the builtin function namespace.
-  TNode<Oddball> HasProperty_Inline(TNode<Context> context,
+  TNode<Boolean> HasProperty_Inline(TNode<Context> context,
                                     TNode<JSReceiver> object,
                                     TNode<Object> key) {
     return HasProperty(context, object, key,
@@ -3816,12 +3975,11 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
                                        TNode<Object> object,
                                        TNode<JSReceiver> default_constructor);
 
-  TNode<Oddball> InstanceOf(TNode<Object> object, TNode<Object> callable,
+  TNode<Boolean> InstanceOf(TNode<Object> object, TNode<Object> callable,
                             TNode<Context> context);
 
   // Debug helpers
   TNode<BoolT> IsDebugActive();
-  TNode<BoolT> IsSideEffectFreeDebuggingActive();
 
   // JSArrayBuffer helpers
   TNode<UintPtrT> LoadJSArrayBufferByteLength(
@@ -3954,6 +4112,9 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   TNode<Object> GetArgumentValue(TorqueStructArguments args,
                                  TNode<IntPtrT> index);
 
+  void SetArgumentValue(TorqueStructArguments args, TNode<IntPtrT> index,
+                        TNode<Object> value);
+
   enum class FrameArgumentsArgcType {
     kCountIncludesReceiver,
     kCountExcludesReceiver
@@ -3977,6 +4138,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   void Print(TNode<MaybeObject> tagged_value) {
     return Print(nullptr, tagged_value);
   }
+  void Print(const char* prefix, TNode<UintPtrT> value);
+  void Print(const char* prefix, TNode<Float64T> value);
   void PrintErr(const char* s);
   void PrintErr(const char* prefix, TNode<MaybeObject> tagged_value);
   void PrintErr(TNode<MaybeObject> tagged_value) {
@@ -3985,6 +4148,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
   void PrintToStream(const char* s, int stream);
   void PrintToStream(const char* prefix, TNode<MaybeObject> tagged_value,
                      int stream);
+  void PrintToStream(const char* prefix, TNode<UintPtrT> value, int stream);
+  void PrintToStream(const char* prefix, TNode<Float64T> value, int stream);
 
   template <class... TArgs>
   TNode<HeapObject> MakeTypeError(MessageTemplate message,
@@ -4186,7 +4351,8 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
       TNode<Object> value, TNode<HeapObject> holder, TNode<Uint32T> details,
       TNode<Context> context, TNode<Object> receiver, TNode<Object> name,
       Label* if_bailout,
-      GetOwnPropertyMode mode = kCallJSGetterDontUseCachedName);
+      GetOwnPropertyMode mode = kCallJSGetterDontUseCachedName,
+      ExpectedReceiverMode expected_receiver_mode = kExpectingJSReceiver);
 
   TNode<IntPtrT> TryToIntptr(TNode<Object> key, Label* if_not_intptr,
                              TVariable<Int32T>* var_instance_type = nullptr);
@@ -4365,14 +4531,13 @@ class V8_EXPORT_PRIVATE CodeStubAssembler
 
   enum IsKnownTaggedPointer { kNo, kYes };
   template <Object::Conversion conversion>
-  void TaggedToWord32OrBigIntImpl(TNode<Context> context, TNode<Object> value,
-                                  Label* if_number,
-                                  TVariable<Word32T>* var_word32,
-                                  IsKnownTaggedPointer is_known_tagged_pointer,
-                                  Label* if_bigint = nullptr,
-                                  Label* if_bigint64 = nullptr,
-                                  TVariable<BigInt>* var_maybe_bigint = nullptr,
-                                  TVariable<Smi>* var_feedback = nullptr);
+  void TaggedToWord32OrBigIntImpl(
+      TNode<Context> context, TNode<Object> value, Label* if_number,
+      TVariable<Word32T>* var_word32,
+      IsKnownTaggedPointer is_known_tagged_pointer,
+      const FeedbackValues& feedback, Label* if_bigint = nullptr,
+      Label* if_bigint64 = nullptr,
+      TVariable<BigInt>* var_maybe_bigint = nullptr);
 
   // Low-level accessors for Descriptor arrays.
   template <typename T>
@@ -4498,6 +4663,8 @@ class V8_EXPORT_PRIVATE CodeStubArguments {
     return GetOptionalArgumentValue(assembler_->IntPtrConstant(index));
   }
 
+  void SetArgumentValue(TNode<IntPtrT> index, TNode<Object> value);
+
   // Iteration doesn't include the receiver. |first| and |last| are zero-based.
   using ForEachBodyFunction = std::function<void(TNode<Object> arg)>;
   void ForEach(const ForEachBodyFunction& body, TNode<IntPtrT> first = {},
diff --git a/deps/v8/src/codegen/compilation-cache.cc b/deps/v8/src/codegen/compilation-cache.cc
index 72b36071b82406..f7147eab10c62a 100644
--- a/deps/v8/src/codegen/compilation-cache.cc
+++ b/deps/v8/src/codegen/compilation-cache.cc
@@ -30,7 +30,7 @@ CompilationCache::CompilationCache(Isolate* isolate)
       enabled_script_and_eval_(true) {}
 
 Handle<CompilationCacheTable> CompilationCacheEvalOrScript::GetTable() {
-  if (table_.IsUndefined(isolate())) {
+  if (IsUndefined(table_, isolate())) {
     return CompilationCacheTable::New(isolate(), kInitialCacheSize);
   }
   return handle(CompilationCacheTable::cast(table_), isolate());
@@ -39,11 +39,11 @@ Handle<CompilationCacheTable> CompilationCacheEvalOrScript::GetTable() {
 Handle<CompilationCacheTable> CompilationCacheRegExp::GetTable(int generation) {
   DCHECK_LT(generation, kGenerations);
   Handle<CompilationCacheTable> result;
-  if (tables_[generation].IsUndefined(isolate())) {
+  if (IsUndefined(tables_[generation], isolate())) {
     result = CompilationCacheTable::New(isolate(), kInitialCacheSize);
     tables_[generation] = *result;
   } else {
-    CompilationCacheTable table =
+    Tagged<CompilationCacheTable> table =
         CompilationCacheTable::cast(tables_[generation]);
     result = Handle<CompilationCacheTable>(table, isolate());
   }
@@ -64,23 +64,22 @@ void CompilationCacheRegExp::Age() {
 
 void CompilationCacheScript::Age() {
   DisallowGarbageCollection no_gc;
-  if (!v8_flags.isolate_script_cache_ageing) return;
-  if (table_.IsUndefined(isolate())) return;
-  CompilationCacheTable table = CompilationCacheTable::cast(table_);
-
-  for (InternalIndex entry : table.IterateEntries()) {
-    Object key;
-    if (!table.ToKey(isolate(), entry, &key)) continue;
-    DCHECK(key.IsWeakFixedArray());
-
-    Object value = table.PrimaryValueAt(entry);
-    if (!value.IsUndefined(isolate())) {
-      SharedFunctionInfo info = SharedFunctionInfo::cast(value);
-      if (!info.HasBytecodeArray() ||
-          info.GetBytecodeArray(isolate()).IsOld()) {
-        table.SetPrimaryValueAt(entry,
-                                ReadOnlyRoots(isolate()).undefined_value(),
-                                SKIP_WRITE_BARRIER);
+  if (IsUndefined(table_, isolate())) return;
+  Tagged<CompilationCacheTable> table = CompilationCacheTable::cast(table_);
+
+  for (InternalIndex entry : table->IterateEntries()) {
+    Tagged<Object> key;
+    if (!table->ToKey(isolate(), entry, &key)) continue;
+    DCHECK(IsWeakFixedArray(key));
+
+    Tagged<Object> value = table->PrimaryValueAt(entry);
+    if (!IsUndefined(value, isolate())) {
+      Tagged<SharedFunctionInfo> info = SharedFunctionInfo::cast(value);
+      // Clear entries after Bytecode was flushed from SFI.
+      if (!info->HasBytecodeArray()) {
+        table->SetPrimaryValueAt(entry,
+                                 ReadOnlyRoots(isolate()).undefined_value(),
+                                 SKIP_WRITE_BARRIER);
       }
     }
   }
@@ -88,14 +87,14 @@ void CompilationCacheScript::Age() {
 
 void CompilationCacheEval::Age() {
   DisallowGarbageCollection no_gc;
-  if (table_.IsUndefined(isolate())) return;
-  CompilationCacheTable table = CompilationCacheTable::cast(table_);
+  if (IsUndefined(table_, isolate())) return;
+  Tagged<CompilationCacheTable> table = CompilationCacheTable::cast(table_);
 
-  for (InternalIndex entry : table.IterateEntries()) {
-    Object key;
-    if (!table.ToKey(isolate(), entry, &key)) continue;
+  for (InternalIndex entry : table->IterateEntries()) {
+    Tagged<Object> key;
+    if (!table->ToKey(isolate(), entry, &key)) continue;
 
-    if (key.IsNumber(isolate())) {
+    if (IsNumber(key, isolate())) {
       // The ageing mechanism for the initial dummy entry in the eval cache.
       // The 'key' is the hash represented as a Number. The 'value' is a smi
       // counting down from kHashGenerations. On reaching zero, the entry is
@@ -104,22 +103,22 @@ void CompilationCacheEval::Age() {
       // connection between initialization- and use-sites of the smi value
       // field.
       static_assert(CompilationCacheTable::kHashGenerations);
-      const int new_count = Smi::ToInt(table.PrimaryValueAt(entry)) - 1;
+      const int new_count = Smi::ToInt(table->PrimaryValueAt(entry)) - 1;
       if (new_count == 0) {
-        table.RemoveEntry(entry);
+        table->RemoveEntry(entry);
       } else {
         DCHECK_GT(new_count, 0);
-        table.SetPrimaryValueAt(entry, Smi::FromInt(new_count),
-                                SKIP_WRITE_BARRIER);
+        table->SetPrimaryValueAt(entry, Smi::FromInt(new_count),
+                                 SKIP_WRITE_BARRIER);
       }
     } else {
-      DCHECK(key.IsFixedArray());
+      DCHECK(IsFixedArray(key));
       // The ageing mechanism for eval caches.
-      SharedFunctionInfo info =
-          SharedFunctionInfo::cast(table.PrimaryValueAt(entry));
-      if (!info.HasBytecodeArray() ||
-          info.GetBytecodeArray(isolate()).IsOld()) {
-        table.RemoveEntry(entry);
+      Tagged<SharedFunctionInfo> info =
+          SharedFunctionInfo::cast(table->PrimaryValueAt(entry));
+      // Clear entries after Bytecode was flushed from SFI.
+      if (!info->HasBytecodeArray()) {
+        table->RemoveEntry(entry);
       }
     }
   }
@@ -147,8 +146,8 @@ void CompilationCacheRegExp::Clear() {
 
 void CompilationCacheEvalOrScript::Remove(
     Handle<SharedFunctionInfo> function_info) {
-  if (table_.IsUndefined(isolate())) return;
-  CompilationCacheTable::cast(table_).Remove(*function_info);
+  if (IsUndefined(table_, isolate())) return;
+  CompilationCacheTable::cast(table_)->Remove(*function_info);
 }
 
 CompilationCacheScript::LookupResult CompilationCacheScript::Lookup(
@@ -239,9 +238,9 @@ MaybeHandle<FixedArray> CompilationCacheRegExp::Lookup(Handle<String> source,
   for (generation = 0; generation < kGenerations; generation++) {
     Handle<CompilationCacheTable> table = GetTable(generation);
     result = table->LookupRegExp(source, flags);
-    if (result->IsFixedArray()) break;
+    if (IsFixedArray(*result)) break;
   }
-  if (result->IsFixedArray()) {
+  if (IsFixedArray(*result)) {
     Handle<FixedArray> data = Handle<FixedArray>::cast(result);
     if (generation != 0) {
       Put(source, flags, data);
@@ -287,7 +286,7 @@ InfoCellPair CompilationCache::LookupEval(Handle<String> source,
 
   const char* cache_type;
 
-  if (context->IsNativeContext()) {
+  if (IsNativeContext(*context)) {
     result = eval_global_.Lookup(source, outer_info, context, language_mode,
                                  position);
     cache_type = "eval-global";
@@ -331,7 +330,7 @@ void CompilationCache::PutEval(Handle<String> source,
 
   const char* cache_type;
   HandleScope scope(isolate());
-  if (context->IsNativeContext()) {
+  if (IsNativeContext(*context)) {
     eval_global_.Put(source, outer_info, function_info, context, feedback_cell,
                      position);
     cache_type = "eval-global";
@@ -365,9 +364,12 @@ void CompilationCache::Iterate(RootVisitor* v) {
 }
 
 void CompilationCache::MarkCompactPrologue() {
+  // Drop SFI entries with flushed bytecode.
   script_.Age();
   eval_global_.Age();
   eval_contextual_.Age();
+
+  // Drop entries in oldest generation.
   reg_exp_.Age();
 }
 
diff --git a/deps/v8/src/codegen/compilation-cache.h b/deps/v8/src/codegen/compilation-cache.h
index 536413322c34ce..6c93a7871ced3e 100644
--- a/deps/v8/src/codegen/compilation-cache.h
+++ b/deps/v8/src/codegen/compilation-cache.h
@@ -12,9 +12,6 @@
 namespace v8 {
 namespace internal {
 
-template <typename T>
-class Handle;
-
 class RootVisitor;
 struct ScriptDetails;
 
diff --git a/deps/v8/src/codegen/compiler.cc b/deps/v8/src/codegen/compiler.cc
index 31c5acceebc4f1..3204e37c88ee14 100644
--- a/deps/v8/src/codegen/compiler.cc
+++ b/deps/v8/src/codegen/compiler.cc
@@ -35,14 +35,14 @@
 #include "src/execution/isolate.h"
 #include "src/execution/local-isolate.h"
 #include "src/execution/vm-state-inl.h"
+#include "src/flags/flags.h"
 #include "src/handles/handles.h"
 #include "src/handles/maybe-handles.h"
 #include "src/handles/persistent-handles.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/local-factory-inl.h"
 #include "src/heap/local-heap-inl.h"
-#include "src/heap/local-heap.h"
-#include "src/heap/parked-scope.h"
+#include "src/heap/parked-scope-inl.h"
 #include "src/init/bootstrapper.h"
 #include "src/interpreter/interpreter.h"
 #include "src/logging/counters-scopes.h"
@@ -79,26 +79,18 @@ constexpr bool IsOSR(BytecodeOffset osr_offset) { return !osr_offset.IsNone(); }
 void SetTieringState(JSFunction function, BytecodeOffset osr_offset,
                      TieringState value) {
   if (IsOSR(osr_offset)) {
-    function.set_osr_tiering_state(value);
+    function->set_osr_tiering_state(value);
   } else {
-    function.set_tiering_state(value);
+    function->set_tiering_state(value);
   }
 }
 
 void ResetTieringState(JSFunction function, BytecodeOffset osr_offset) {
-  if (function.has_feedback_vector()) {
+  if (function->has_feedback_vector()) {
     SetTieringState(function, osr_offset, TieringState::kNone);
   }
 }
 
-void ResetProfilerTicks(JSFunction function, BytecodeOffset osr_offset) {
-  if (!IsOSR(osr_offset)) {
-    // Reset profiler ticks, the function is no longer considered hot.
-    // TODO(v8:7700): Update for Maglev tiering.
-    function.feedback_vector().set_profiler_ticks(0);
-  }
-}
-
 class CompilerTracer : public AllStatic {
  public:
   static void TraceStartBaselineCompile(Isolate* isolate,
@@ -110,11 +102,12 @@ class CompilerTracer : public AllStatic {
   }
 
   static void TraceStartMaglevCompile(Isolate* isolate,
-                                      Handle<JSFunction> function,
+                                      Handle<JSFunction> function, bool osr,
                                       ConcurrencyMode mode) {
     if (!v8_flags.trace_opt) return;
     CodeTracer::Scope scope(isolate->GetCodeTracer());
     PrintTracePrefix(scope, "compiling method", function, CodeKind::MAGLEV);
+    if (osr) PrintF(scope.file(), " OSR");
     PrintF(scope.file(), ", mode: %s", ToString(mode));
     PrintTraceSuffix(scope);
   }
@@ -180,7 +173,8 @@ class CompilerTracer : public AllStatic {
                                          double ms_creategraph,
                                          double ms_optimize,
                                          double ms_codegen) {
-    if (!v8_flags.trace_opt || !info->IsOptimizing()) return;
+    DCHECK(v8_flags.trace_opt);
+    DCHECK(info->IsOptimizing());
     CodeTracer::Scope scope(isolate->GetCodeTracer());
     PrintTracePrefix(scope, "completed compiling", info);
     if (info->is_osr()) PrintF(scope.file(), " OSR");
@@ -200,12 +194,13 @@ class CompilerTracer : public AllStatic {
   }
 
   static void TraceFinishMaglevCompile(Isolate* isolate,
-                                       Handle<JSFunction> function,
+                                       Handle<JSFunction> function, bool osr,
                                        double ms_prepare, double ms_execute,
                                        double ms_finalize) {
     if (!v8_flags.trace_opt) return;
     CodeTracer::Scope scope(isolate->GetCodeTracer());
     PrintTracePrefix(scope, "completed compiling", function, CodeKind::MAGLEV);
+    if (osr) PrintF(scope.file(), " OSR");
     PrintF(scope.file(), " - took %0.3f, %0.3f, %0.3f ms", ms_prepare,
            ms_execute, ms_finalize);
     PrintTraceSuffix(scope);
@@ -272,7 +267,7 @@ class CompilerTracer : public AllStatic {
     if (!v8_flags.trace_opt) return;
     CodeTracer::Scope scope(isolate->GetCodeTracer());
     PrintF(scope.file(), "[marking ");
-    function->ShortPrint(scope.file());
+    ShortPrint(*function, scope.file());
     PrintF(scope.file(),
            " for optimized recompilation because --always-turbofan");
     PrintF(scope.file(), "]\n");
@@ -289,7 +284,7 @@ class CompilerTracer : public AllStatic {
                                const char* header, Handle<JSFunction> function,
                                CodeKind code_kind) {
     PrintF(scope.file(), "[%s ", header);
-    function->ShortPrint(scope.file());
+    ShortPrint(*function, scope.file());
     PrintF(scope.file(), " (target %s)", CodeKindToString(code_kind));
   }
 
@@ -298,7 +293,7 @@ class CompilerTracer : public AllStatic {
                                Handle<SharedFunctionInfo> shared,
                                CodeKind code_kind) {
     PrintF(scope.file(), "[%s ", header);
-    shared->ShortPrint(scope.file());
+    ShortPrint(*shared, scope.file());
     PrintF(scope.file(), " (target %s)", CodeKindToString(code_kind));
   }
 
@@ -323,16 +318,14 @@ void Compiler::LogFunctionCompilation(Isolate* isolate,
   // Log the code generation. If source information is available include
   // script name and line number. Check explicitly whether logging is
   // enabled as finding the line number is not free.
-  if (!isolate->v8_file_logger()->is_listening_to_code_events() &&
-      !isolate->is_profiling() && !v8_flags.log_function_events &&
-      !isolate->logger()->is_listening_to_code_events()) {
-    return;
-  }
-
-  int line_num = Script::GetLineNumber(script, shared->StartPosition()) + 1;
-  int column_num = Script::GetColumnNumber(script, shared->StartPosition()) + 1;
-  Handle<String> script_name(script->name().IsString()
-                                 ? String::cast(script->name())
+  if (!isolate->IsLoggingCodeCreation()) return;
+
+  Script::PositionInfo info;
+  Script::GetPositionInfo(script, shared->StartPosition(), &info);
+  int line_num = info.line + 1;
+  int column_num = info.column + 1;
+  Handle<String> script_name(IsString(script->name())
+                                 ? Tagged<String>::cast(script->name())
                                  : ReadOnlyRoots(isolate).empty_string(),
                              isolate);
   LogEventListener::CodeTag log_tag =
@@ -379,19 +372,6 @@ void Compiler::LogFunctionCompilation(Isolate* isolate,
                              *debug_name));
 }
 
-// Helper that times a scoped region and records the elapsed time.
-struct ScopedTimer {
-  explicit ScopedTimer(base::TimeDelta* location) : location_(location) {
-    DCHECK_NOT_NULL(location_);
-    timer_.Start();
-  }
-
-  ~ScopedTimer() { *location_ += timer_.Elapsed(); }
-
-  base::ElapsedTimer timer_;
-  base::TimeDelta* location_;
-};
-
 namespace {
 
 ScriptOriginOptions OriginOptionsForEval(
@@ -399,8 +379,8 @@ ScriptOriginOptions OriginOptionsForEval(
   bool is_shared_cross_origin =
       parsing_while_debugging == ParsingWhileDebugging::kYes;
   bool is_opaque = false;
-  if (script.IsScript()) {
-    auto script_origin_options = Script::cast(script).origin_options();
+  if (IsScript(script)) {
+    auto script_origin_options = Script::cast(script)->origin_options();
     if (script_origin_options.IsSharedCrossOrigin()) {
       is_shared_cross_origin = true;
     }
@@ -419,7 +399,8 @@ ScriptOriginOptions OriginOptionsForEval(
 CompilationJob::Status UnoptimizedCompilationJob::ExecuteJob() {
   // Delegate to the underlying implementation.
   DCHECK_EQ(state(), State::kReadyToExecute);
-  ScopedTimer t(&time_taken_to_execute_);
+  base::ScopedTimer t(v8_flags.log_function_events ? &time_taken_to_execute_
+                                                   : nullptr);
   return UpdateState(ExecuteJobImpl(), State::kReadyToFinalize);
 }
 
@@ -431,7 +412,8 @@ CompilationJob::Status UnoptimizedCompilationJob::FinalizeJob(
 
   // Delegate to the underlying implementation.
   DCHECK_EQ(state(), State::kReadyToFinalize);
-  ScopedTimer t(&time_taken_to_finalize_);
+  base::ScopedTimer t(v8_flags.log_function_events ? &time_taken_to_finalize_
+                                                   : nullptr);
   return UpdateState(FinalizeJobImpl(shared_info, isolate), State::kSucceeded);
 }
 
@@ -439,7 +421,8 @@ CompilationJob::Status UnoptimizedCompilationJob::FinalizeJob(
     Handle<SharedFunctionInfo> shared_info, LocalIsolate* isolate) {
   // Delegate to the underlying implementation.
   DCHECK_EQ(state(), State::kReadyToFinalize);
-  ScopedTimer t(&time_taken_to_finalize_);
+  base::ScopedTimer t(v8_flags.log_function_events ? &time_taken_to_finalize_
+                                                   : nullptr);
   return UpdateState(FinalizeJobImpl(shared_info, isolate), State::kSucceeded);
 }
 
@@ -483,16 +466,17 @@ CompilationJob::Status OptimizedCompilationJob::PrepareJob(Isolate* isolate) {
 
   // Delegate to the underlying implementation.
   DCHECK_EQ(state(), State::kReadyToPrepare);
-  ScopedTimer t(&time_taken_to_prepare_);
+  base::ScopedTimer t(&time_taken_to_prepare_);
   return UpdateState(PrepareJobImpl(isolate), State::kReadyToExecute);
 }
 
 CompilationJob::Status OptimizedCompilationJob::ExecuteJob(
     RuntimeCallStats* stats, LocalIsolate* local_isolate) {
-  DCHECK_IMPLIES(local_isolate, local_isolate->heap()->IsParked());
+  DCHECK_IMPLIES(local_isolate && !local_isolate->is_main_thread(),
+                 local_isolate->heap()->IsParked());
   // Delegate to the underlying implementation.
   DCHECK_EQ(state(), State::kReadyToExecute);
-  ScopedTimer t(&time_taken_to_execute_);
+  base::ScopedTimer t(&time_taken_to_execute_);
   return UpdateState(ExecuteJobImpl(stats, local_isolate),
                      State::kReadyToFinalize);
 }
@@ -503,10 +487,38 @@ CompilationJob::Status OptimizedCompilationJob::FinalizeJob(Isolate* isolate) {
 
   // Delegate to the underlying implementation.
   DCHECK_EQ(state(), State::kReadyToFinalize);
-  ScopedTimer t(&time_taken_to_finalize_);
+  base::ScopedTimer t(&time_taken_to_finalize_);
   return UpdateState(FinalizeJobImpl(isolate), State::kSucceeded);
 }
 
+void OptimizedCompilationJob::RegisterWeakObjectsInOptimizedCode(
+    Isolate* isolate, Handle<NativeContext> context, Handle<Code> code) {
+  // TODO(choongwoo.han): Split this method into collecting maps on the
+  // background thread, and retaining them on the foreground thread.
+  std::vector<Handle<Map>> maps;
+  DCHECK(code->is_optimized_code());
+  {
+    DisallowGarbageCollection no_gc;
+    PtrComprCageBase cage_base(isolate);
+    int const mode_mask = RelocInfo::EmbeddedObjectModeMask();
+    for (RelocIterator it(*code, mode_mask); !it.done(); it.next()) {
+      DCHECK(RelocInfo::IsEmbeddedObjectMode(it.rinfo()->rmode()));
+      Tagged<HeapObject> target_object = it.rinfo()->target_object(cage_base);
+      if (code->IsWeakObjectInOptimizedCode(target_object)) {
+        if (IsMap(target_object, cage_base)) {
+          maps.push_back(handle(Map::cast(target_object), isolate));
+        }
+      }
+    }
+  }
+  for (Handle<Map> map : maps) {
+    // TODO(choongwoo.han): Batch this to avoid calling WeakArrayList::AddToEnd
+    // for each call.
+    isolate->heap()->AddRetainedMap(context, map);
+  }
+  code->set_can_have_weak_objects(true);
+}
+
 CompilationJob::Status TurbofanCompilationJob::RetryOptimization(
     BailoutReason reason) {
   DCHECK(compilation_info_->IsOptimizing());
@@ -524,71 +536,79 @@ CompilationJob::Status TurbofanCompilationJob::AbortOptimization(
 void TurbofanCompilationJob::RecordCompilationStats(ConcurrencyMode mode,
                                                     Isolate* isolate) const {
   DCHECK(compilation_info()->IsOptimizing());
-  Handle<JSFunction> function = compilation_info()->closure();
-  double ms_creategraph = time_taken_to_prepare_.InMillisecondsF();
-  double ms_optimize = time_taken_to_execute_.InMillisecondsF();
-  double ms_codegen = time_taken_to_finalize_.InMillisecondsF();
-  CompilerTracer::TraceFinishTurbofanCompile(
-      isolate, compilation_info(), ms_creategraph, ms_optimize, ms_codegen);
-  if (v8_flags.trace_opt_stats) {
-    static double compilation_time = 0.0;
-    static int compiled_functions = 0;
-    static int code_size = 0;
-
-    compilation_time += (ms_creategraph + ms_optimize + ms_codegen);
-    compiled_functions++;
-    code_size += function->shared().SourceSize();
-    PrintF("Compiled: %d functions with %d byte source size in %fms.\n",
-           compiled_functions, code_size, compilation_time);
+  if (v8_flags.trace_opt || v8_flags.trace_opt_stats) {
+    Handle<JSFunction> function = compilation_info()->closure();
+    double ms_creategraph = time_taken_to_prepare_.InMillisecondsF();
+    double ms_optimize = time_taken_to_execute_.InMillisecondsF();
+    double ms_codegen = time_taken_to_finalize_.InMillisecondsF();
+    if (v8_flags.trace_opt) {
+      CompilerTracer::TraceFinishTurbofanCompile(
+          isolate, compilation_info(), ms_creategraph, ms_optimize, ms_codegen);
+    }
+    if (v8_flags.trace_opt_stats) {
+      static double compilation_time = 0.0;
+      static int compiled_functions = 0;
+      static int code_size = 0;
+
+      compilation_time += (ms_creategraph + ms_optimize + ms_codegen);
+      compiled_functions++;
+      code_size += function->shared()->SourceSize();
+      PrintF(
+          "[turbofan] Compiled: %d functions with %d byte source size in "
+          "%fms.\n",
+          compiled_functions, code_size, compilation_time);
+    }
   }
   // Don't record samples from machines without high-resolution timers,
   // as that can cause serious reporting issues. See the thread at
   // http://g/chrome-metrics-team/NwwJEyL8odU/discussion for more details.
-  if (base::TimeTicks::IsHighResolution()) {
-    Counters* const counters = isolate->counters();
-    if (compilation_info()->is_osr()) {
-      counters->turbofan_osr_prepare()->AddSample(
-          static_cast<int>(time_taken_to_prepare_.InMicroseconds()));
-      counters->turbofan_osr_execute()->AddSample(
-          static_cast<int>(time_taken_to_execute_.InMicroseconds()));
-      counters->turbofan_osr_finalize()->AddSample(
-          static_cast<int>(time_taken_to_finalize_.InMicroseconds()));
-      counters->turbofan_osr_total_time()->AddSample(
-          static_cast<int>(ElapsedTime().InMicroseconds()));
-    } else {
-      counters->turbofan_optimize_prepare()->AddSample(
-          static_cast<int>(time_taken_to_prepare_.InMicroseconds()));
-      counters->turbofan_optimize_execute()->AddSample(
-          static_cast<int>(time_taken_to_execute_.InMicroseconds()));
-      counters->turbofan_optimize_finalize()->AddSample(
-          static_cast<int>(time_taken_to_finalize_.InMicroseconds()));
-      counters->turbofan_optimize_total_time()->AddSample(
-          static_cast<int>(ElapsedTime().InMicroseconds()));
-
-      // Compute foreground / background time.
-      base::TimeDelta time_background;
-      base::TimeDelta time_foreground =
-          time_taken_to_prepare_ + time_taken_to_finalize_;
-      switch (mode) {
-        case ConcurrencyMode::kConcurrent:
-          time_background += time_taken_to_execute_;
-          counters->turbofan_optimize_concurrent_total_time()->AddSample(
-              static_cast<int>(ElapsedTime().InMicroseconds()));
-          break;
-        case ConcurrencyMode::kSynchronous:
-          counters->turbofan_optimize_non_concurrent_total_time()->AddSample(
-              static_cast<int>(ElapsedTime().InMicroseconds()));
-          time_foreground += time_taken_to_execute_;
-          break;
-      }
-      counters->turbofan_optimize_total_background()->AddSample(
-          static_cast<int>(time_background.InMicroseconds()));
-      counters->turbofan_optimize_total_foreground()->AddSample(
-          static_cast<int>(time_foreground.InMicroseconds()));
-    }
-    counters->turbofan_ticks()->AddSample(static_cast<int>(
-        compilation_info()->tick_counter().CurrentTicks() / 1000));
+  if (!base::TimeTicks::IsHighResolution()) return;
+
+  int elapsed_microseconds = static_cast<int>(ElapsedTime().InMicroseconds());
+  Counters* const counters = isolate->counters();
+  counters->turbofan_ticks()->AddSample(static_cast<int>(
+      compilation_info()->tick_counter().CurrentTicks() / 1000));
+
+  if (compilation_info()->is_osr()) {
+    counters->turbofan_osr_prepare()->AddSample(
+        static_cast<int>(time_taken_to_prepare_.InMicroseconds()));
+    counters->turbofan_osr_execute()->AddSample(
+        static_cast<int>(time_taken_to_execute_.InMicroseconds()));
+    counters->turbofan_osr_finalize()->AddSample(
+        static_cast<int>(time_taken_to_finalize_.InMicroseconds()));
+    counters->turbofan_osr_total_time()->AddSample(elapsed_microseconds);
+    return;
   }
+
+  DCHECK(!compilation_info()->is_osr());
+  counters->turbofan_optimize_prepare()->AddSample(
+      static_cast<int>(time_taken_to_prepare_.InMicroseconds()));
+  counters->turbofan_optimize_execute()->AddSample(
+      static_cast<int>(time_taken_to_execute_.InMicroseconds()));
+  counters->turbofan_optimize_finalize()->AddSample(
+      static_cast<int>(time_taken_to_finalize_.InMicroseconds()));
+  counters->turbofan_optimize_total_time()->AddSample(elapsed_microseconds);
+
+  // Compute foreground / background time.
+  base::TimeDelta time_background;
+  base::TimeDelta time_foreground =
+      time_taken_to_prepare_ + time_taken_to_finalize_;
+  switch (mode) {
+    case ConcurrencyMode::kConcurrent:
+      time_background += time_taken_to_execute_;
+      counters->turbofan_optimize_concurrent_total_time()->AddSample(
+          elapsed_microseconds);
+      break;
+    case ConcurrencyMode::kSynchronous:
+      counters->turbofan_optimize_non_concurrent_total_time()->AddSample(
+          elapsed_microseconds);
+      time_foreground += time_taken_to_execute_;
+      break;
+  }
+  counters->turbofan_optimize_total_background()->AddSample(
+      static_cast<int>(time_background.InMicroseconds()));
+  counters->turbofan_optimize_total_foreground()->AddSample(
+      static_cast<int>(time_foreground.InMicroseconds()));
 }
 
 void TurbofanCompilationJob::RecordFunctionCompilation(
@@ -610,6 +630,14 @@ void TurbofanCompilationJob::RecordFunctionCompilation(
       time_taken_ms);
 }
 
+uint64_t TurbofanCompilationJob::trace_id() const {
+  // Xor together the this pointer and the optimization id, to try to make the
+  // id more unique on platforms where just the `this` pointer is likely to be
+  // reused.
+  return reinterpret_cast<uint64_t>(this) ^
+         compilation_info_->optimization_id();
+}
+
 // ----------------------------------------------------------------------------
 // Local helper methods that make up the compilation pipeline.
 
@@ -632,12 +660,14 @@ bool UseAsmWasm(FunctionLiteral* literal, bool asm_wasm_broken) {
 }
 #endif
 
-void InstallInterpreterTrampolineCopy(Isolate* isolate,
-                                      Handle<SharedFunctionInfo> shared_info,
-                                      LogEventListener::CodeTag log_tag) {
+}  // namespace
+
+void Compiler::InstallInterpreterTrampolineCopy(
+    Isolate* isolate, Handle<SharedFunctionInfo> shared_info,
+    LogEventListener::CodeTag log_tag) {
   DCHECK(v8_flags.interpreted_frames_native_stack);
-  if (!shared_info->function_data(kAcquireLoad).IsBytecodeArray()) {
-    DCHECK(!shared_info->HasBytecodeArray());
+  if (!IsBytecodeArray(shared_info->function_data(kAcquireLoad))) {
+    DCHECK(!shared_info->HasInterpreterData());
     return;
   }
   Handle<BytecodeArray> bytecode_array(shared_info->GetBytecodeArray(isolate),
@@ -653,22 +683,30 @@ void InstallInterpreterTrampolineCopy(Isolate* isolate,
   interpreter_data->set_bytecode_array(*bytecode_array);
   interpreter_data->set_interpreter_trampoline(*code);
 
-  shared_info->set_interpreter_data(*interpreter_data);
+  if (shared_info->HasBaselineCode()) {
+    shared_info->baseline_code(kAcquireLoad)
+        ->set_bytecode_or_interpreter_data(*interpreter_data);
+  } else {
+    // IsBytecodeArray
+    shared_info->set_interpreter_data(*interpreter_data);
+  }
 
   Handle<Script> script(Script::cast(shared_info->script()), isolate);
   Handle<AbstractCode> abstract_code = Handle<AbstractCode>::cast(code);
-  int line_num =
-      Script::GetLineNumber(script, shared_info->StartPosition()) + 1;
-  int column_num =
-      Script::GetColumnNumber(script, shared_info->StartPosition()) + 1;
+  Script::PositionInfo info;
+  Script::GetPositionInfo(script, shared_info->StartPosition(), &info);
+  int line_num = info.line + 1;
+  int column_num = info.column + 1;
   Handle<String> script_name =
-      handle(script->name().IsString() ? String::cast(script->name())
-                                       : ReadOnlyRoots(isolate).empty_string(),
+      handle(IsString(script->name()) ? Tagged<String>::cast(script->name())
+                                      : ReadOnlyRoots(isolate).empty_string(),
              isolate);
   PROFILE(isolate, CodeCreateEvent(log_tag, abstract_code, shared_info,
                                    script_name, line_num, column_num));
 }
 
+namespace {
+
 template <typename IsolateT>
 void InstallUnoptimizedCode(UnoptimizedCompilationInfo* compilation_info,
                             Handle<SharedFunctionInfo> shared_info,
@@ -687,6 +725,7 @@ void InstallUnoptimizedCode(UnoptimizedCompilationInfo* compilation_info,
 #endif  // V8_ENABLE_WEBASSEMBLY
 
     shared_info->set_bytecode_array(*compilation_info->bytecode_array());
+    shared_info->set_age(0);
 
     Handle<FeedbackMetadata> feedback_metadata = FeedbackMetadata::New(
         isolate, compilation_info->feedback_vector_spec());
@@ -712,7 +751,7 @@ void EnsureSharedFunctionInfosArrayOnScript(Handle<Script> script,
   DCHECK(parse_info->flags().is_toplevel());
   if (script->shared_function_info_count() > 0) {
     DCHECK_LE(script->shared_function_info_count(),
-              script->shared_function_infos().length());
+              script->shared_function_infos()->length());
     DCHECK_EQ(script->shared_function_info_count(),
               parse_info->max_function_literal_id() + 1);
     return;
@@ -724,22 +763,23 @@ void EnsureSharedFunctionInfosArrayOnScript(Handle<Script> script,
 
 void UpdateSharedFunctionFlagsAfterCompilation(FunctionLiteral* literal,
                                                SharedFunctionInfo shared_info) {
-  DCHECK_EQ(shared_info.language_mode(), literal->language_mode());
+  DCHECK_EQ(shared_info->language_mode(), literal->language_mode());
 
   // These fields are all initialised in ParseInfo from the SharedFunctionInfo,
   // and then set back on the literal after parse. Hence, they should already
   // match.
-  DCHECK_EQ(shared_info.requires_instance_members_initializer(),
+  DCHECK_EQ(shared_info->requires_instance_members_initializer(),
             literal->requires_instance_members_initializer());
-  DCHECK_EQ(shared_info.class_scope_has_private_brand(),
+  DCHECK_EQ(shared_info->class_scope_has_private_brand(),
             literal->class_scope_has_private_brand());
-  DCHECK_EQ(shared_info.has_static_private_methods_or_accessors(),
+  DCHECK_EQ(shared_info->has_static_private_methods_or_accessors(),
             literal->has_static_private_methods_or_accessors());
 
-  shared_info.set_has_duplicate_parameters(literal->has_duplicate_parameters());
-  shared_info.UpdateAndFinalizeExpectedNofPropertiesFromEstimate(literal);
+  shared_info->set_has_duplicate_parameters(
+      literal->has_duplicate_parameters());
+  shared_info->UpdateAndFinalizeExpectedNofPropertiesFromEstimate(literal);
 
-  shared_info.SetScopeInfo(*literal->scope()->scope_info());
+  shared_info->SetScopeInfo(*literal->scope()->scope_info());
 }
 
 // Finalize a single compilation job. This function can return
@@ -758,9 +798,13 @@ CompilationJob::Status FinalizeSingleUnoptimizedCompilationJob(
     InstallUnoptimizedCode(compilation_info, shared_info, isolate);
 
     MaybeHandle<CoverageInfo> coverage_info;
-    if (compilation_info->has_coverage_info() &&
-        !shared_info->HasCoverageInfo()) {
-      coverage_info = compilation_info->coverage_info();
+    if (compilation_info->has_coverage_info()) {
+      SharedMutexGuardIfOffThread<IsolateT, base::kShared> mutex_guard(
+          isolate->shared_function_info_access(), isolate);
+      if (!shared_info->HasCoverageInfo(
+              isolate->GetMainThreadIsolateUnsafe())) {
+        coverage_info = compilation_info->coverage_info();
+      }
     }
 
     finalize_unoptimized_compilation_data_list->emplace_back(
@@ -819,6 +863,7 @@ bool IterativelyExecuteAndFinalizeUnoptimizedCompilationJobs(
   std::vector<FunctionLiteral*> functions_to_compile;
   functions_to_compile.push_back(parse_info->literal());
 
+  bool compilation_succeeded = true;
   bool is_first = true;
   while (!functions_to_compile.empty()) {
     FunctionLiteral* literal = functions_to_compile.back();
@@ -843,7 +888,19 @@ bool IterativelyExecuteAndFinalizeUnoptimizedCompilationJobs(
                                                allocator, &functions_to_compile,
                                                isolate->AsLocalIsolate());
 
-    if (!job) return false;
+    if (!job) {
+      // Compilation failed presumably because of stack overflow, make sure
+      // the shared function info contains uncompiled data for the next
+      // compilation attempts.
+      if (!shared_info->HasUncompiledData()) {
+        SharedFunctionInfo::CreateAndSetUncompiledData(isolate, shared_info,
+                                                       literal);
+      }
+      compilation_succeeded = false;
+      // Proceed finalizing other functions in case they don't have uncompiled
+      // data.
+      continue;
+    }
 
     UpdateSharedFunctionFlagsAfterCompilation(literal, *shared_info);
 
@@ -861,7 +918,10 @@ bool IterativelyExecuteAndFinalizeUnoptimizedCompilationJobs(
         break;
 
       case CompilationJob::FAILED:
-        return false;
+        compilation_succeeded = false;
+        // Proceed finalizing other functions in case they don't have uncompiled
+        // data.
+        continue;
 
       case CompilationJob::RETRY_ON_MAIN_THREAD:
         // This should not happen on the main thread.
@@ -883,7 +943,7 @@ bool IterativelyExecuteAndFinalizeUnoptimizedCompilationJobs(
     parse_info->pending_error_handler()->PrepareWarnings(isolate);
   }
 
-  return true;
+  return compilation_succeeded;
 }
 
 bool FinalizeDeferredUnoptimizedCompilationJobs(
@@ -934,25 +994,25 @@ class OptimizedCodeCache : public AllStatic {
     Code code;
     FeedbackVector feedback_vector = function->feedback_vector();
     if (IsOSR(osr_offset)) {
-      Handle<BytecodeArray> bytecode(shared.GetBytecodeArray(isolate), isolate);
+      Handle<BytecodeArray> bytecode(shared->GetBytecodeArray(isolate),
+                                     isolate);
       interpreter::BytecodeArrayIterator it(bytecode, osr_offset.ToInt());
       DCHECK_EQ(it.current_bytecode(), interpreter::Bytecode::kJumpLoop);
       base::Optional<Code> maybe_code =
-          feedback_vector.GetOptimizedOsrCode(isolate, it.GetSlotOperand(2));
+          feedback_vector->GetOptimizedOsrCode(isolate, it.GetSlotOperand(2));
       if (maybe_code.has_value()) code = maybe_code.value();
     } else {
-      feedback_vector.EvictOptimizedCodeMarkedForDeoptimization(
+      feedback_vector->EvictOptimizedCodeMarkedForDeoptimization(
           isolate, shared, "OptimizedCodeCache::Get");
-      code = feedback_vector.optimized_code();
+      code = feedback_vector->optimized_code();
     }
 
-    DCHECK_IMPLIES(!code.is_null(), code.kind() <= code_kind);
-    if (code.is_null() || code.kind() != code_kind) return {};
+    if (code.is_null() || code->kind() != code_kind) return {};
 
-    DCHECK(!code.marked_for_deoptimization());
-    DCHECK(shared.is_compiled());
-    DCHECK(CodeKindIsStoredInOptimizedCodeCache(code.kind()));
-    DCHECK_IMPLIES(IsOSR(osr_offset), CodeKindCanOSR(code.kind()));
+    DCHECK(!code->marked_for_deoptimization());
+    DCHECK(shared->is_compiled());
+    DCHECK(CodeKindIsStoredInOptimizedCodeCache(code->kind()));
+    DCHECK_IMPLIES(IsOSR(osr_offset), CodeKindCanOSR(code->kind()));
 
     CompilerTracer::TraceOptimizedCodeCacheHit(isolate, function, osr_offset,
                                                code_kind);
@@ -962,19 +1022,20 @@ class OptimizedCodeCache : public AllStatic {
   static void Insert(Isolate* isolate, JSFunction function,
                      BytecodeOffset osr_offset, Code code,
                      bool is_function_context_specializing) {
-    const CodeKind kind = code.kind();
+    const CodeKind kind = code->kind();
     if (!CodeKindIsStoredInOptimizedCodeCache(kind)) return;
 
-    FeedbackVector feedback_vector = function.feedback_vector();
+    FeedbackVector feedback_vector = function->feedback_vector();
 
     if (IsOSR(osr_offset)) {
       DCHECK(CodeKindCanOSR(kind));
       DCHECK(!is_function_context_specializing);
-      SharedFunctionInfo shared = function.shared();
-      Handle<BytecodeArray> bytecode(shared.GetBytecodeArray(isolate), isolate);
+      SharedFunctionInfo shared = function->shared();
+      Handle<BytecodeArray> bytecode(shared->GetBytecodeArray(isolate),
+                                     isolate);
       interpreter::BytecodeArrayIterator it(bytecode, osr_offset.ToInt());
       DCHECK_EQ(it.current_bytecode(), interpreter::Bytecode::kJumpLoop);
-      feedback_vector.SetOptimizedOsrCode(it.GetSlotOperand(2), code);
+      feedback_vector->SetOptimizedOsrCode(isolate, it.GetSlotOperand(2), code);
       return;
     }
 
@@ -984,27 +1045,26 @@ class OptimizedCodeCache : public AllStatic {
       // Function context specialization folds-in the function context, so no
       // sharing can occur. Make sure the optimized code cache is cleared.
       // Only do so if the specialized code's kind matches the cached code kind.
-      if (feedback_vector.has_optimized_code() &&
-          feedback_vector.optimized_code().kind() == code.kind()) {
-        feedback_vector.ClearOptimizedCode();
+      if (feedback_vector->has_optimized_code() &&
+          feedback_vector->optimized_code()->kind() == code->kind()) {
+        feedback_vector->ClearOptimizedCode();
       }
       return;
     }
 
-    feedback_vector.SetOptimizedCode(code);
+    feedback_vector->SetOptimizedCode(code);
   }
 };
 
-// Runs PrepareJob in the proper compilation & canonical scopes. Handles will be
-// allocated in a persistent handle scope that is detached and handed off to the
+// Runs PrepareJob in the proper compilation scopes. Handles will be allocated
+// in a persistent handle scope that is detached and handed off to the
 // {compilation_info} after PrepareJob.
 bool PrepareJobWithHandleScope(OptimizedCompilationJob* job, Isolate* isolate,
                                OptimizedCompilationInfo* compilation_info,
                                ConcurrencyMode mode) {
   CompilationHandleScope compilation(isolate, compilation_info);
-  CanonicalHandleScopeForTurbofan canonical(isolate, compilation_info);
   CompilerTracer::TracePrepareJob(isolate, compilation_info, mode);
-  compilation_info->ReopenHandlesInNewHandleScope(isolate);
+  compilation_info->ReopenAndCanonicalizeHandlesInNewScope(isolate);
   return job->PrepareJob(isolate) == CompilationJob::SUCCEEDED;
 }
 
@@ -1026,17 +1086,12 @@ bool CompileTurbofan_NotConcurrent(Isolate* isolate,
     return false;
   }
 
-  {
-    // Park main thread here to be in the same state as background threads.
-    ParkedScope parked_scope(isolate->main_thread_local_isolate());
-    if (job->ExecuteJob(isolate->counters()->runtime_call_stats(),
-                        isolate->main_thread_local_isolate())) {
-      UnparkedScope unparked_scope(isolate->main_thread_local_isolate());
-      CompilerTracer::TraceAbortedJob(
-          isolate, compilation_info, job->prepare_in_ms(), job->execute_in_ms(),
-          job->finalize_in_ms());
-      return false;
-    }
+  if (job->ExecuteJob(isolate->counters()->runtime_call_stats(),
+                      isolate->main_thread_local_isolate())) {
+    CompilerTracer::TraceAbortedJob(isolate, compilation_info,
+                                    job->prepare_in_ms(), job->execute_in_ms(),
+                                    job->finalize_in_ms());
+    return false;
   }
 
   if (job->FinalizeJob(isolate) != CompilationJob::SUCCEEDED) {
@@ -1066,7 +1121,7 @@ bool CompileTurbofan_Concurrent(Isolate* isolate,
   if (!isolate->optimizing_compile_dispatcher()->IsQueueAvailable()) {
     if (v8_flags.trace_concurrent_recompilation) {
       PrintF("  ** Compilation queue full, will retry optimizing ");
-      function->ShortPrint();
+      ShortPrint(*function);
       PrintF(" later.\n");
     }
     return false;
@@ -1075,7 +1130,7 @@ bool CompileTurbofan_Concurrent(Isolate* isolate,
   if (isolate->heap()->HighMemoryPressure()) {
     if (v8_flags.trace_concurrent_recompilation) {
       PrintF("  ** High memory pressure, will retry optimizing ");
-      function->ShortPrint();
+      ShortPrint(*function);
       PrintF(" later.\n");
     }
     return false;
@@ -1084,7 +1139,7 @@ bool CompileTurbofan_Concurrent(Isolate* isolate,
   TimerEventScope<TimerEventRecompileSynchronous> timer(isolate);
   RCS_SCOPE(isolate, RuntimeCallCounterId::kOptimizeConcurrentPrepare);
   TRACE_EVENT_WITH_FLOW0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
-                         "V8.OptimizeConcurrentPrepare", job.get(),
+                         "V8.OptimizeConcurrentPrepare", job->trace_id(),
                          TRACE_EVENT_FLAG_FLOW_OUT);
 
   if (!PrepareJobWithHandleScope(job.get(), isolate, compilation_info,
@@ -1097,7 +1152,7 @@ bool CompileTurbofan_Concurrent(Isolate* isolate,
 
   if (v8_flags.trace_concurrent_recompilation) {
     PrintF("  ** Queued ");
-    function->ShortPrint();
+    ShortPrint(*function);
     PrintF(" for concurrent optimization.\n");
   }
 
@@ -1121,7 +1176,8 @@ bool ShouldOptimize(CodeKind code_kind, Handle<SharedFunctionInfo> shared) {
     case CodeKind::TURBOFAN:
       return v8_flags.turbofan && shared->PassesFilter(v8_flags.turbo_filter);
     case CodeKind::MAGLEV:
-      return v8_flags.maglev && shared->PassesFilter(v8_flags.maglev_filter);
+      return maglev::IsMaglevEnabled() &&
+             shared->PassesFilter(v8_flags.maglev_filter);
     default:
       UNREACHABLE();
   }
@@ -1140,8 +1196,8 @@ MaybeHandle<Code> CompileTurbofan(Isolate* isolate, Handle<JSFunction> function,
   DCHECK(!isolate->has_pending_exception());
   PostponeInterruptsScope postpone(isolate);
   const compiler::IsScriptAvailable has_script =
-      shared->script().IsScript() ? compiler::IsScriptAvailable::kYes
-                                  : compiler::IsScriptAvailable::kNo;
+      IsScript(shared->script()) ? compiler::IsScriptAvailable::kYes
+                                 : compiler::IsScriptAvailable::kNo;
   // BUG(5946): This DCHECK is necessary to make certain that we won't
   // tolerate the lack of a script without bytecode.
   DCHECK_IMPLIES(has_script == compiler::IsScriptAvailable::kNo,
@@ -1174,10 +1230,9 @@ MaybeHandle<Code> CompileTurbofan(Isolate* isolate, Handle<JSFunction> function,
 #ifdef V8_ENABLE_MAGLEV
 // TODO(v8:7700): Record maglev compilations better.
 void RecordMaglevFunctionCompilation(Isolate* isolate,
-                                     Handle<JSFunction> function) {
+                                     Handle<JSFunction> function,
+                                     Handle<AbstractCode> code) {
   PtrComprCageBase cage_base(isolate);
-  Handle<AbstractCode> abstract_code(
-      AbstractCode::cast(function->code(cage_base)), isolate);
   Handle<SharedFunctionInfo> shared(function->shared(cage_base), isolate);
   Handle<Script> script(Script::cast(shared->script(cage_base)), isolate);
   Handle<FeedbackVector> feedback_vector(function->feedback_vector(cage_base),
@@ -1188,8 +1243,7 @@ void RecordMaglevFunctionCompilation(Isolate* isolate,
 
   Compiler::LogFunctionCompilation(
       isolate, LogEventListener::CodeTag::kFunction, script, shared,
-      feedback_vector, abstract_code, abstract_code->kind(cage_base),
-      time_taken_ms);
+      feedback_vector, code, code->kind(cage_base), time_taken_ms);
 }
 #endif  // V8_ENABLE_MAGLEV
 
@@ -1197,9 +1251,7 @@ MaybeHandle<Code> CompileMaglev(Isolate* isolate, Handle<JSFunction> function,
                                 ConcurrencyMode mode, BytecodeOffset osr_offset,
                                 CompileResultBehavior result_behavior) {
 #ifdef V8_ENABLE_MAGLEV
-  DCHECK(v8_flags.maglev);
-  // TODO(v8:7700): Add missing support.
-  CHECK(!IsOSR(osr_offset));
+  DCHECK(maglev::IsMaglevEnabled());
   CHECK(result_behavior == CompileResultBehavior::kDefault);
 
   // TODO(v8:7700): Tracing, see CompileTurbofan.
@@ -1214,39 +1266,36 @@ MaybeHandle<Code> CompileMaglev(Isolate* isolate, Handle<JSFunction> function,
   // ...
 
   // Prepare the job.
-  auto job = maglev::MaglevCompilationJob::New(isolate, function);
+  auto job = maglev::MaglevCompilationJob::New(isolate, function, osr_offset);
+
+  if (IsConcurrent(mode) &&
+      !isolate->maglev_concurrent_dispatcher()->is_enabled()) {
+    mode = ConcurrencyMode::kSynchronous;
+  }
 
   {
     TRACE_EVENT_WITH_FLOW0(
         TRACE_DISABLED_BY_DEFAULT("v8.compile"),
         IsSynchronous(mode) ? "V8.MaglevPrepare" : "V8.MaglevConcurrentPrepare",
-        job.get(), TRACE_EVENT_FLAG_FLOW_OUT);
-    CompilerTracer::TraceStartMaglevCompile(isolate, function, mode);
+        job->trace_id(), TRACE_EVENT_FLAG_FLOW_OUT);
+    CompilerTracer::TraceStartMaglevCompile(isolate, function, job->is_osr(),
+                                            mode);
     CompilationJob::Status status = job->PrepareJob(isolate);
     CHECK_EQ(status, CompilationJob::SUCCEEDED);  // TODO(v8:7700): Use status.
   }
 
   if (IsSynchronous(mode)) {
-    {
-      // Park the main thread Isolate here, to be in the same state as
-      // background threads.
-      ParkedScope parked_scope(isolate->main_thread_local_isolate());
-      CompilationJob::Status status =
-          job->ExecuteJob(isolate->counters()->runtime_call_stats(),
-                          isolate->main_thread_local_isolate());
-      if (status == CompilationJob::FAILED) {
-        return {};
-      }
-      CHECK_EQ(status, CompilationJob::SUCCEEDED);
+    CompilationJob::Status status =
+        job->ExecuteJob(isolate->counters()->runtime_call_stats(),
+                        isolate->main_thread_local_isolate());
+    if (status == CompilationJob::FAILED) {
+      return {};
     }
+    CHECK_EQ(status, CompilationJob::SUCCEEDED);
 
-    {
-      // TODO(v8:7700): Support OSR in FinalizeMaglevCompilationJob.
-      DCHECK(osr_offset.IsNone());
-      Compiler::FinalizeMaglevCompilationJob(job.get(), isolate);
-    }
+    Compiler::FinalizeMaglevCompilationJob(job.get(), isolate);
 
-    return handle(function->code(), isolate);
+    return job->code();
   }
 
   DCHECK(IsConcurrent(mode));
@@ -1256,6 +1305,7 @@ MaybeHandle<Code> CompileMaglev(Isolate* isolate, Handle<JSFunction> function,
 
   // Remember that the function is currently being processed.
   SetTieringState(*function, osr_offset, TieringState::kInProgress);
+  function->SetInterruptBudget(isolate, CodeKind::MAGLEV);
 
   return {};
 #else   // V8_ENABLE_MAGLEV
@@ -1275,6 +1325,17 @@ MaybeHandle<Code> GetOrCompileOptimized(
   // re-optimize.
   if (!IsOSR(osr_offset)) {
     ResetTieringState(*function, osr_offset);
+    int invocation_count =
+        function->feedback_vector()->invocation_count(kRelaxedLoad);
+    if (!(V8_UNLIKELY(v8_flags.testing_d8_test_runner ||
+                      v8_flags.allow_natives_syntax) &&
+          ManualOptimizationTable::IsMarkedForManualOptimization(isolate,
+                                                                 *function)) &&
+        invocation_count < v8_flags.minimum_invocations_before_optimization) {
+      function->feedback_vector()->set_invocation_count(invocation_count + 1,
+                                                        kRelaxedStore);
+      return {};
+    }
   }
 
   // TODO(v8:7700): Distinguish between Maglev and Turbofan.
@@ -1287,7 +1348,7 @@ MaybeHandle<Code> GetOrCompileOptimized(
   if (isolate->debug()->needs_check_on_function_call()) return {};
 
   // Do not optimize if we need to be able to set break points.
-  if (shared->HasBreakInfo()) return {};
+  if (shared->HasBreakInfo(isolate)) return {};
 
   // Do not optimize if optimization is disabled or function doesn't pass
   // turbo_filter.
@@ -1296,12 +1357,26 @@ MaybeHandle<Code> GetOrCompileOptimized(
   Handle<Code> cached_code;
   if (OptimizedCodeCache::Get(isolate, function, osr_offset, code_kind)
           .ToHandle(&cached_code)) {
+    if (IsOSR(osr_offset)) {
+      if (!IsInProgress(function->osr_tiering_state())) {
+        function->feedback_vector()->reset_osr_urgency();
+      }
+    } else {
+      DCHECK_LE(cached_code->kind(), code_kind);
+    }
     return cached_code;
   }
 
-  DCHECK(shared->is_compiled());
+  if (IsOSR(osr_offset)) {
+    // One OSR job per function at a time.
+    if (IsInProgress(function->osr_tiering_state())) {
+      return {};
+    }
 
-  ResetProfilerTicks(*function, osr_offset);
+    function->feedback_vector()->reset_osr_urgency();
+  }
+
+  DCHECK(shared->is_compiled());
 
   if (code_kind == CodeKind::TURBOFAN) {
     return CompileTurbofan(isolate, function, shared, mode, osr_offset,
@@ -1385,9 +1460,9 @@ void FinalizeUnoptimizedCompilation(
     compile_state->pending_error_handler()->ReportWarnings(isolate, script);
   }
 
-  bool need_source_positions = v8_flags.stress_lazy_source_positions ||
-                               (!flags.collect_source_positions() &&
-                                isolate->NeedsSourcePositionsForProfiling());
+  bool need_source_positions =
+      v8_flags.stress_lazy_source_positions ||
+      (!flags.collect_source_positions() && isolate->NeedsSourcePositions());
 
   for (const auto& finalize_data : finalize_unoptimized_compilation_data_list) {
     Handle<SharedFunctionInfo> shared_info = finalize_data.function_handle();
@@ -1408,8 +1483,9 @@ void FinalizeUnoptimizedCompilation(
       log_tag = LogEventListener::CodeTag::kFunction;
     }
     log_tag = V8FileLogger::ToNativeByScript(log_tag, *script);
-    if (v8_flags.interpreted_frames_native_stack) {
-      InstallInterpreterTrampolineCopy(isolate, shared_info, log_tag);
+    if (v8_flags.interpreted_frames_native_stack &&
+        isolate->logger()->is_listening_to_code_events()) {
+      Compiler::InstallInterpreterTrampolineCopy(isolate, shared_info, log_tag);
     }
     Handle<CoverageInfo> coverage_info;
     if (finalize_data.coverage_info().ToHandle(&coverage_info)) {
@@ -1431,17 +1507,13 @@ void FinalizeUnoptimizedScriptCompilation(
   FinalizeUnoptimizedCompilation(isolate, script, flags, compile_state,
                                  finalize_unoptimized_compilation_data_list);
 
-  script->set_compilation_state(Script::COMPILATION_STATE_COMPILED);
-
-  if (isolate->NeedsSourcePositionsForProfiling()) {
-    Script::InitLineEnds(isolate, script);
-  }
+  script->set_compilation_state(Script::CompilationState::kCompiled);
+  DCHECK_IMPLIES(isolate->NeedsSourcePositions(), script->has_line_ends());
 }
 
 void CompileAllWithBaseline(Isolate* isolate,
                             const FinalizeUnoptimizedCompilationDataList&
                                 finalize_unoptimized_compilation_data_list) {
-  CodePageCollectionMemoryModificationScope code_allocation(isolate->heap());
   for (const auto& finalize_data : finalize_unoptimized_compilation_data_list) {
     Handle<SharedFunctionInfo> shared_info = finalize_data.function_handle();
     IsCompiledScope is_compiled_scope(*shared_info, isolate);
@@ -1579,7 +1651,8 @@ DeferredFinalizationJobData::DeferredFinalizationJobData(
 
 BackgroundCompileTask::BackgroundCompileTask(
     ScriptStreamingData* streamed_data, Isolate* isolate, ScriptType type,
-    ScriptCompiler::CompileOptions options)
+    ScriptCompiler::CompileOptions options,
+    CompileHintCallback compile_hint_callback, void* compile_hint_callback_data)
     : isolate_for_local_isolate_(isolate),
       flags_(UnoptimizedCompileFlags::ForToplevelCompile(
           isolate, true, construct_language_mode(v8_flags.use_strict),
@@ -1594,11 +1667,20 @@ BackgroundCompileTask::BackgroundCompileTask(
       timer_(isolate->counters()->compile_script_on_background()),
       start_position_(0),
       end_position_(0),
-      function_literal_id_(kFunctionLiteralIdTopLevel) {
+      function_literal_id_(kFunctionLiteralIdTopLevel),
+      compile_hint_callback_(compile_hint_callback),
+      compile_hint_callback_data_(compile_hint_callback_data) {
   if (options == ScriptCompiler::CompileOptions::kProduceCompileHints) {
     flags_.set_produce_compile_hints(true);
   }
   DCHECK(is_streaming_compilation());
+  if (options == ScriptCompiler::kConsumeCompileHints) {
+    DCHECK_NOT_NULL(compile_hint_callback);
+    DCHECK_NOT_NULL(compile_hint_callback_data);
+  } else {
+    DCHECK_NULL(compile_hint_callback);
+    DCHECK_NULL(compile_hint_callback_data);
+  }
 }
 
 BackgroundCompileTask::BackgroundCompileTask(
@@ -1639,24 +1721,24 @@ void SetScriptFieldsFromDetails(Isolate* isolate, Script script,
                                 DisallowGarbageCollection* no_gc) {
   Handle<Object> script_name;
   if (script_details.name_obj.ToHandle(&script_name)) {
-    script.set_name(*script_name);
-    script.set_line_offset(script_details.line_offset);
-    script.set_column_offset(script_details.column_offset);
+    script->set_name(*script_name);
+    script->set_line_offset(script_details.line_offset);
+    script->set_column_offset(script_details.column_offset);
   }
   // The API can provide a source map URL, but a source map URL could also have
-  // been inferred by the parser from a magic comment. The latter takes
-  // preference over the former, so we don't want to override the source mapping
-  // URL if it already exists.
+  // been inferred by the parser from a magic comment. The API source map URL
+  // takes precedence (as long as it is a non-empty string).
   Handle<Object> source_map_url;
   if (script_details.source_map_url.ToHandle(&source_map_url) &&
-      script.source_mapping_url(isolate).IsUndefined(isolate)) {
-    script.set_source_mapping_url(*source_map_url);
+      IsString(*source_map_url) &&
+      String::cast(*source_map_url)->length() > 0) {
+    script->set_source_mapping_url(*source_map_url);
   }
   Handle<Object> host_defined_options;
   if (script_details.host_defined_options.ToHandle(&host_defined_options)) {
     // TODO(cbruni, chromium:1244145): Remove once migrated to the context.
-    if (host_defined_options->IsFixedArray()) {
-      script.set_host_defined_options(FixedArray::cast(*host_defined_options));
+    if (IsFixedArray(*host_defined_options)) {
+      script->set_host_defined_options(FixedArray::cast(*host_defined_options));
     }
   }
 }
@@ -1672,54 +1754,54 @@ class MergeAssumptionChecker final : public ObjectVisitor {
   explicit MergeAssumptionChecker(PtrComprCageBase cage_base)
       : cage_base_(cage_base) {}
 
-  void IterateObjects(HeapObject start) {
+  void IterateObjects(Tagged<HeapObject> start) {
     QueueVisit(start, kNormalObject);
     while (to_visit_.size() > 0) {
       std::pair<HeapObject, ObjectKind> pair = to_visit_.top();
       to_visit_.pop();
-      HeapObject current = pair.first;
+      Tagged<HeapObject> current = pair.first;
       // The Script's shared_function_infos list and the constant pools for all
       // BytecodeArrays are expected to contain pointers to SharedFunctionInfos.
       // However, the type of those objects (FixedArray or WeakFixedArray)
       // doesn't have enough information to indicate their usage, so we enqueue
       // those objects here rather than during VisitPointers.
-      if (current.IsScript()) {
-        HeapObject sfis = Script::cast(current).shared_function_infos();
+      if (IsScript(current)) {
+        Tagged<HeapObject> sfis =
+            Script::cast(current)->shared_function_infos();
         QueueVisit(sfis, kScriptSfiList);
-      } else if (current.IsBytecodeArray()) {
-        HeapObject constants = BytecodeArray::cast(current).constant_pool();
+      } else if (IsBytecodeArray(current)) {
+        Tagged<HeapObject> constants =
+            BytecodeArray::cast(current)->constant_pool();
         QueueVisit(constants, kConstantPool);
       }
       current_object_kind_ = pair.second;
-      current.IterateBody(cage_base_, this);
-      QueueVisit(current.map(), kNormalObject);
+      current->IterateBody(cage_base_, this);
+      QueueVisit(current->map(), kNormalObject);
     }
   }
 
   // ObjectVisitor implementation:
-  void VisitPointers(HeapObject host, ObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                      ObjectSlot end) override {
     MaybeObjectSlot maybe_start(start);
     MaybeObjectSlot maybe_end(end);
     VisitPointers(host, maybe_start, maybe_end);
   }
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) override {
     for (MaybeObjectSlot current = start; current != end; ++current) {
       MaybeObject maybe_obj = current.load(cage_base_);
-      HeapObject obj;
+      Tagged<HeapObject> obj;
       bool is_weak = maybe_obj.IsWeak();
       if (maybe_obj.GetHeapObject(&obj)) {
-        if (obj.IsSharedFunctionInfo()) {
+        if (IsSharedFunctionInfo(obj)) {
           CHECK((current_object_kind_ == kConstantPool && !is_weak) ||
                 (current_object_kind_ == kScriptSfiList && is_weak));
-        } else if (obj.IsScript()) {
-          CHECK(host.IsSharedFunctionInfo() &&
-                current == MaybeObjectSlot(
-                               host.address() +
-                               SharedFunctionInfo::kScriptOrDebugInfoOffset));
-        } else if (obj.IsFixedArray() &&
-                   current_object_kind_ == kConstantPool) {
+        } else if (IsScript(obj)) {
+          CHECK(IsSharedFunctionInfo(host) &&
+                current == MaybeObjectSlot(host.address() +
+                                           SharedFunctionInfo::kScriptOffset));
+        } else if (IsFixedArray(obj) && current_object_kind_ == kConstantPool) {
           // Constant pools can contain nested fixed arrays, which in turn can
           // point to SFIs.
           QueueVisit(obj, kConstantPool);
@@ -1733,11 +1815,18 @@ class MergeAssumptionChecker final : public ObjectVisitor {
   // The object graph for a newly compiled Script shouldn't yet contain any
   // Code. If any of these functions are called, then that would indicate that
   // the graph was not disjoint from the rest of the heap as expected.
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
+    UNREACHABLE();
+  }
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
+    UNREACHABLE();
+  }
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
     UNREACHABLE();
   }
-  void VisitCodeTarget(RelocInfo* rinfo) override { UNREACHABLE(); }
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override { UNREACHABLE(); }
 
  private:
   enum ObjectKind {
@@ -1748,7 +1837,7 @@ class MergeAssumptionChecker final : public ObjectVisitor {
 
   // If the object hasn't yet been added to the worklist, add it. Subsequent
   // calls with the same object have no effect, even if kind is different.
-  void QueueVisit(HeapObject obj, ObjectKind kind) {
+  void QueueVisit(Tagged<HeapObject> obj, ObjectKind kind) {
     if (visited_.insert(obj).second) {
       to_visit_.push(std::make_pair(obj, kind));
     }
@@ -1776,7 +1865,6 @@ bool BackgroundCompileTask::is_streaming_compilation() const {
 }
 
 void BackgroundCompileTask::Run() {
-  RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
   DCHECK_NE(ThreadId::Current(), isolate_for_local_isolate_->thread_id());
   LocalIsolate isolate(isolate_for_local_isolate_, ThreadKind::kBackground);
   UnparkedScope unparked_scope(&isolate);
@@ -1807,6 +1895,8 @@ void BackgroundCompileTask::Run(
   ParseInfo info(isolate, flags_, &compile_state_, reusable_state,
                  GetCurrentStackPosition() - stack_size_ * KB);
   info.set_character_stream(std::move(character_stream_));
+  info.SetCompileHintCallbackAndData(compile_hint_callback_,
+                                     compile_hint_callback_data_);
   if (is_streaming_compilation()) info.set_is_streaming_compilation();
 
   if (toplevel_script_compilation) {
@@ -1838,7 +1928,7 @@ void BackgroundCompileTask::Run(
     if (shared_info->HasUncompiledDataWithPreparseData()) {
       info.set_consumed_preparse_data(ConsumedPreparseData::For(
           isolate, handle(shared_info->uncompiled_data_with_preparse_data()
-                              .preparse_data(isolate),
+                              ->preparse_data(isolate),
                           isolate)));
     }
   }
@@ -1918,12 +2008,12 @@ class ConstantPoolPointerForwarder {
       : cage_base_(cage_base), local_heap_(local_heap) {}
 
   void AddBytecodeArray(BytecodeArray bytecode_array) {
-    CHECK(bytecode_array.IsBytecodeArray());
+    CHECK(IsBytecodeArray(bytecode_array));
     bytecode_arrays_to_update_.push_back(handle(bytecode_array, local_heap_));
   }
 
   void Forward(SharedFunctionInfo from, SharedFunctionInfo to) {
-    forwarding_table_[from.function_literal_id()] = handle(to, local_heap_);
+    forwarding_table_[from->function_literal_id()] = handle(to, local_heap_);
   }
 
   // Runs the update after the setup functions above specified the work to do.
@@ -1941,20 +2031,20 @@ class ConstantPoolPointerForwarder {
 
  private:
   void IterateConstantPool(FixedArray constant_pool) {
-    for (int i = 0, length = constant_pool.length(); i < length; ++i) {
-      Object obj = constant_pool.get(i);
-      if (obj.IsSmi()) continue;
-      HeapObject heap_obj = HeapObject::cast(obj);
-      if (heap_obj.IsFixedArray(cage_base_)) {
+    for (int i = 0, length = constant_pool->length(); i < length; ++i) {
+      Object obj = constant_pool->get(i);
+      if (IsSmi(obj)) continue;
+      Tagged<HeapObject> heap_obj = HeapObject::cast(obj);
+      if (IsFixedArray(heap_obj, cage_base_)) {
         // Constant pools can have nested fixed arrays, but such relationships
         // are acyclic and never more than a few layers deep, so recursion is
         // fine here.
         IterateConstantPool(FixedArray::cast(heap_obj));
-      } else if (heap_obj.IsSharedFunctionInfo(cage_base_)) {
+      } else if (IsSharedFunctionInfo(heap_obj, cage_base_)) {
         auto it = forwarding_table_.find(
-            SharedFunctionInfo::cast(heap_obj).function_literal_id());
+            SharedFunctionInfo::cast(heap_obj)->function_literal_id());
         if (it != forwarding_table_.end()) {
-          constant_pool.set(i, *it->second);
+          constant_pool->set(i, *it->second);
         }
       }
     }
@@ -2023,7 +2113,7 @@ void BackgroundMergeTask::BeginMergeInBackground(LocalIsolate* isolate,
   {
     DisallowGarbageCollection no_gc;
     MaybeObject maybe_old_toplevel_sfi =
-        old_script->shared_function_infos().Get(kFunctionLiteralIdTopLevel);
+        old_script->shared_function_infos()->Get(kFunctionLiteralIdTopLevel);
     if (maybe_old_toplevel_sfi.IsWeak()) {
       SharedFunctionInfo old_toplevel_sfi = SharedFunctionInfo::cast(
           maybe_old_toplevel_sfi.GetHeapObjectAssumeWeak());
@@ -2034,44 +2124,44 @@ void BackgroundMergeTask::BeginMergeInBackground(LocalIsolate* isolate,
 
   // Iterate the SFI lists on both Scripts to set up the forwarding table and
   // follow-up worklists for the main thread.
-  CHECK_EQ(old_script->shared_function_infos().length(),
-           new_script->shared_function_infos().length());
-  for (int i = 0; i < old_script->shared_function_infos().length(); ++i) {
+  CHECK_EQ(old_script->shared_function_infos()->length(),
+           new_script->shared_function_infos()->length());
+  for (int i = 0; i < old_script->shared_function_infos()->length(); ++i) {
     DisallowGarbageCollection no_gc;
-    MaybeObject maybe_new_sfi = new_script->shared_function_infos().Get(i);
+    MaybeObject maybe_new_sfi = new_script->shared_function_infos()->Get(i);
     if (maybe_new_sfi.IsWeak()) {
       SharedFunctionInfo new_sfi =
           SharedFunctionInfo::cast(maybe_new_sfi.GetHeapObjectAssumeWeak());
-      MaybeObject maybe_old_sfi = old_script->shared_function_infos().Get(i);
+      MaybeObject maybe_old_sfi = old_script->shared_function_infos()->Get(i);
       if (maybe_old_sfi.IsWeak()) {
         // The old script and the new script both have SharedFunctionInfos for
         // this function literal.
         SharedFunctionInfo old_sfi =
             SharedFunctionInfo::cast(maybe_old_sfi.GetHeapObjectAssumeWeak());
         forwarder.Forward(new_sfi, old_sfi);
-        if (new_sfi.HasBytecodeArray()) {
-          if (old_sfi.HasBytecodeArray()) {
+        if (new_sfi->HasBytecodeArray()) {
+          if (old_sfi->HasBytecodeArray()) {
             // Reset the old SFI's bytecode age so that it won't likely get
             // flushed right away. This operation might be racing against
             // concurrent modification by another thread, but such a race is not
             // catastrophic.
-            old_sfi.GetBytecodeArray(isolate).set_bytecode_age(0);
+            old_sfi->set_age(0);
           } else {
             // The old SFI can use the compiled data from the new SFI.
             new_compiled_data_for_cached_sfis_.push_back(
                 {local_heap->NewPersistentHandle(old_sfi),
                  local_heap->NewPersistentHandle(new_sfi)});
-            forwarder.AddBytecodeArray(new_sfi.GetBytecodeArray(isolate));
+            forwarder.AddBytecodeArray(new_sfi->GetBytecodeArray(isolate));
           }
         }
       } else {
         // The old script didn't have a SharedFunctionInfo for this function
         // literal, so it can use the new SharedFunctionInfo.
-        DCHECK_EQ(i, new_sfi.function_literal_id());
-        new_sfi.set_script(*old_script);
+        DCHECK_EQ(i, new_sfi->function_literal_id());
+        new_sfi->set_script(*old_script, kReleaseStore);
         used_new_sfis_.push_back(local_heap->NewPersistentHandle(new_sfi));
-        if (new_sfi.HasBytecodeArray()) {
-          forwarder.AddBytecodeArray(new_sfi.GetBytecodeArray(isolate));
+        if (new_sfi->HasBytecodeArray()) {
+          forwarder.AddBytecodeArray(new_sfi->GetBytecodeArray(isolate));
         }
       }
     }
@@ -2101,22 +2191,21 @@ Handle<SharedFunctionInfo> BackgroundMergeTask::CompleteMergeInForeground(
         new_compiled_data.new_sfi->is_compiled()) {
       // Updating existing DebugInfos is not supported, but we don't expect
       // uncompiled SharedFunctionInfos to contain DebugInfos.
-      DCHECK(!new_compiled_data.cached_sfi->HasDebugInfo());
-      // The goal here is to copy every field except script_or_debug_info from
+      DCHECK(!new_compiled_data.cached_sfi->HasDebugInfo(isolate));
+      // The goal here is to copy every field except script from
       // new_sfi to cached_sfi. The safest way to do so (including a DCHECK that
-      // no fields were skipped) is to first copy the script_or_debug_info from
+      // no fields were skipped) is to first copy the script from
       // cached_sfi to new_sfi, and then copy every field using CopyFrom.
-      new_compiled_data.new_sfi->set_script_or_debug_info(
-          new_compiled_data.cached_sfi->script_or_debug_info(kAcquireLoad),
-          kReleaseStore);
+      new_compiled_data.new_sfi->set_script(
+          new_compiled_data.cached_sfi->script(kAcquireLoad), kReleaseStore);
       new_compiled_data.cached_sfi->CopyFrom(*new_compiled_data.new_sfi);
     }
   }
   for (Handle<SharedFunctionInfo> new_sfi : used_new_sfis_) {
     DisallowGarbageCollection no_gc;
     DCHECK_GE(new_sfi->function_literal_id(), 0);
-    MaybeObject maybe_old_sfi =
-        old_script->shared_function_infos().Get(new_sfi->function_literal_id());
+    MaybeObject maybe_old_sfi = old_script->shared_function_infos()->Get(
+        new_sfi->function_literal_id());
     if (maybe_old_sfi.IsWeak()) {
       // The old script's SFI didn't exist during the background work, but
       // does now. This means a re-merge is necessary so that any pointers to
@@ -2125,7 +2214,7 @@ Handle<SharedFunctionInfo> BackgroundMergeTask::CompleteMergeInForeground(
           SharedFunctionInfo::cast(maybe_old_sfi.GetHeapObjectAssumeWeak());
       forwarder.Forward(*new_sfi, old_sfi);
     } else {
-      old_script->shared_function_infos().Set(
+      old_script->shared_function_infos()->Set(
           new_sfi->function_literal_id(),
           MaybeObject::MakeWeak(MaybeObject::FromObject(*new_sfi)));
     }
@@ -2150,7 +2239,7 @@ Handle<SharedFunctionInfo> BackgroundMergeTask::CompleteMergeInForeground(
   }
 
   MaybeObject maybe_toplevel_sfi =
-      old_script->shared_function_infos().Get(kFunctionLiteralIdTopLevel);
+      old_script->shared_function_infos()->Get(kFunctionLiteralIdTopLevel);
   CHECK(maybe_toplevel_sfi.IsWeak());
   Handle<SharedFunctionInfo> result = handle(
       SharedFunctionInfo::cast(maybe_toplevel_sfi.GetHeapObjectAssumeWeak()),
@@ -2158,6 +2247,11 @@ Handle<SharedFunctionInfo> BackgroundMergeTask::CompleteMergeInForeground(
 
   state_ = kDone;
 
+  if (isolate->NeedsSourcePositions()) {
+    Script::InitLineEnds(isolate, new_script);
+    SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, result);
+  }
+
   return handle_scope.CloseAndEscape(result);
 }
 
@@ -2193,11 +2287,11 @@ MaybeHandle<SharedFunctionInfo> BackgroundCompileTask::FinalizeScript(
         merge.CompleteMergeInForeground(isolate, script);
     maybe_result = result;
     script = handle(Script::cast(result->script()), isolate);
-    DCHECK(script->source().StrictEquals(*source));
+    DCHECK(Object::StrictEquals(script->source(), *source));
     DCHECK(isolate->factory()->script_list()->Contains(
         MaybeObject::MakeWeak(MaybeObject::FromObject(*script))));
   } else {
-    script->set_source(*source);
+    Script::SetSource(isolate, script, source);
     script->set_origin_options(origin_options);
 
     // The one post-hoc fix-up: Add the script to the script list.
@@ -2300,7 +2394,6 @@ BackgroundDeserializeTask::BackgroundDeserializeTask(
 }
 
 void BackgroundDeserializeTask::Run() {
-  RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
   LocalIsolate isolate(isolate_for_local_isolate_, ThreadKind::kBackground);
   UnparkedScope unparked_scope(&isolate);
   LocalHandleScope handle_scope(&isolate);
@@ -2358,7 +2451,7 @@ bool Compiler::CollectSourcePositions(Isolate* isolate,
                                       Handle<SharedFunctionInfo> shared_info) {
   DCHECK(shared_info->is_compiled());
   DCHECK(shared_info->HasBytecodeArray());
-  DCHECK(!shared_info->GetBytecodeArray(isolate).HasSourcePositionTable());
+  DCHECK(!shared_info->GetBytecodeArray(isolate)->HasSourcePositionTable());
 
   // Source position collection should be context independent.
   NullContextScope null_context_scope(isolate);
@@ -2382,7 +2475,7 @@ bool Compiler::CollectSourcePositions(Isolate* isolate,
 
   // Unfinalized scripts don't yet have the proper source string attached and
   // thus can't be reparsed.
-  if (Script::cast(shared_info->script()).IsMaybeUnfinalized(isolate)) {
+  if (Script::cast(shared_info->script())->IsMaybeUnfinalized(isolate)) {
     bytecode->SetSourcePositionsFailedToCollect();
     return false;
   }
@@ -2444,12 +2537,14 @@ bool Compiler::CollectSourcePositions(Isolate* isolate,
 
   // If debugging, make sure that instrumented bytecode has the source position
   // table set on it as well.
-  if (shared_info->HasDebugInfo() &&
-      shared_info->GetDebugInfo().HasInstrumentedBytecodeArray()) {
-    ByteArray source_position_table =
-        job->compilation_info()->bytecode_array()->SourcePositionTable();
-    shared_info->GetActiveBytecodeArray().set_source_position_table(
-        source_position_table, kReleaseStore);
+  if (base::Optional<DebugInfo> debug_info =
+          shared_info->TryGetDebugInfo(isolate)) {
+    if (debug_info->HasInstrumentedBytecodeArray()) {
+      ByteArray source_position_table =
+          job->compilation_info()->bytecode_array()->SourcePositionTable();
+      shared_info->GetActiveBytecodeArray()->set_source_position_table(
+          source_position_table, kReleaseStore);
+    }
   }
 
   DCHECK(!isolate->has_pending_exception());
@@ -2505,7 +2600,7 @@ bool Compiler::Compile(Isolate* isolate, Handle<SharedFunctionInfo> shared_info,
     parse_info.set_consumed_preparse_data(ConsumedPreparseData::For(
         isolate,
         handle(
-            shared_info->uncompiled_data_with_preparse_data().preparse_data(),
+            shared_info->uncompiled_data_with_preparse_data()->preparse_data(),
             isolate)));
   }
 
@@ -2536,7 +2631,7 @@ bool Compiler::Compile(Isolate* isolate, Handle<SharedFunctionInfo> shared_info,
   if (script->produce_compile_hints()) {
     // Log lazy funtion compilation.
     Handle<ArrayList> list;
-    if (script->compiled_lazy_function_positions().IsUndefined()) {
+    if (IsUndefined(script->compiled_lazy_function_positions())) {
       constexpr int kInitialLazyFunctionPositionListSize = 100;
       list = ArrayList::New(isolate, kInitialLazyFunctionPositionListSize);
     } else {
@@ -2560,8 +2655,10 @@ bool Compiler::Compile(Isolate* isolate, Handle<JSFunction> function,
   // We should never reach here if the function is already compiled or
   // optimized.
   DCHECK(!function->is_compiled());
-  DCHECK(IsNone(function->tiering_state()));
-  DCHECK(!function->HasAvailableOptimizedCode());
+  DCHECK_IMPLIES(!IsNone(function->tiering_state()),
+                 function->shared()->is_compiled());
+  DCHECK_IMPLIES(function->HasAvailableOptimizedCode(),
+                 function->shared()->is_compiled());
 
   // Reset the JSFunction if we are recompiling due to the bytecode having been
   // flushed.
@@ -2589,7 +2686,7 @@ bool Compiler::Compile(Isolate* isolate, Handle<JSFunction> function,
 
   // Optimize now if --always-turbofan is enabled.
 #if V8_ENABLE_WEBASSEMBLY
-  if (v8_flags.always_turbofan && !function->shared().HasAsmWasmData()) {
+  if (v8_flags.always_turbofan && !function->shared()->HasAsmWasmData()) {
 #else
   if (v8_flags.always_turbofan) {
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -2622,7 +2719,7 @@ bool Compiler::Compile(Isolate* isolate, Handle<JSFunction> function,
 
   // Check postconditions on success.
   DCHECK(!isolate->has_pending_exception());
-  DCHECK(function->shared().is_compiled());
+  DCHECK(function->shared()->is_compiled());
   DCHECK(function->is_compiled());
   return true;
 }
@@ -2653,19 +2750,22 @@ bool Compiler::CompileSharedWithBaseline(Isolate* isolate,
   Handle<Code> code;
   base::TimeDelta time_taken;
   {
-    ScopedTimer timer(&time_taken);
+    base::ScopedTimer timer(
+        v8_flags.trace_baseline || v8_flags.log_function_events ? &time_taken
+                                                                : nullptr);
     if (!GenerateBaselineCode(isolate, shared).ToHandle(&code)) {
       // TODO(leszeks): This can only fail because of an OOM. Do we want to
       // report these somehow, or silently ignore them?
       return false;
     }
     shared->set_baseline_code(*code, kReleaseStore);
+    shared->set_age(0);
   }
   double time_taken_ms = time_taken.InMillisecondsF();
 
   CompilerTracer::TraceFinishBaselineCompile(isolate, shared, time_taken_ms);
 
-  if (shared->script().IsScript()) {
+  if (IsScript(shared->script())) {
     LogFunctionCompilation(isolate, LogEventListener::CodeTag::kFunction,
                            handle(Script::cast(shared->script()), isolate),
                            shared, Handle<FeedbackVector>(),
@@ -2688,7 +2788,7 @@ bool Compiler::CompileBaseline(Isolate* isolate, Handle<JSFunction> function,
   JSFunction::EnsureFeedbackVector(isolate, function, is_compiled_scope);
 
   Code baseline_code = shared->baseline_code(kAcquireLoad);
-  DCHECK_EQ(baseline_code.kind(), CodeKind::BASELINE);
+  DCHECK_EQ(baseline_code->kind(), CodeKind::BASELINE);
   function->set_code(baseline_code);
   return true;
 }
@@ -2740,7 +2840,7 @@ void Compiler::CompileOptimized(Isolate* isolate, Handle<JSFunction> function,
 #ifdef DEBUG
   DCHECK(!isolate->has_pending_exception());
   DCHECK(function->is_compiled());
-  DCHECK(function->shared().HasBytecodeArray());
+  DCHECK(function->shared()->HasBytecodeArray());
   const TieringState tiering_state = function->tiering_state();
   DCHECK(IsNone(tiering_state) || IsInProgress(tiering_state));
   DCHECK_IMPLIES(IsInProgress(tiering_state), function->ChecksTieringState());
@@ -2813,7 +2913,7 @@ MaybeHandle<JSFunction> Compiler::GetFunctionFromEval(
     parse_info.set_parameters_end_pos(parameters_end_pos);
 
     MaybeHandle<ScopeInfo> maybe_outer_scope_info;
-    if (!context->IsNativeContext()) {
+    if (!IsNativeContext(*context)) {
       maybe_outer_scope_info = handle(context->scope_info(), isolate);
     }
     script = parse_info.CreateScript(
@@ -2895,10 +2995,11 @@ MaybeHandle<JSFunction> Compiler::GetFunctionFromEval(
 
 // Check whether embedder allows code generation in this context.
 // (via v8::Isolate::SetAllowCodeGenerationFromStringsCallback)
-bool CodeGenerationFromStringsAllowed(Isolate* isolate, Handle<Context> context,
+bool CodeGenerationFromStringsAllowed(Isolate* isolate,
+                                      Handle<NativeContext> context,
                                       Handle<String> source) {
   RCS_SCOPE(isolate, RuntimeCallCounterId::kCodeGenerationFromStringsCallbacks);
-  DCHECK(context->allow_code_gen_from_strings().IsFalse(isolate));
+  DCHECK(IsFalse(context->allow_code_gen_from_strings(), isolate));
   DCHECK(isolate->allow_code_gen_callback());
   AllowCodeGenerationFromStringsCallback callback =
       isolate->allow_code_gen_callback();
@@ -2911,7 +3012,8 @@ bool CodeGenerationFromStringsAllowed(Isolate* isolate, Handle<Context> context,
 // Check whether embedder allows code generation in this context.
 // (via v8::Isolate::SetModifyCodeGenerationFromStringsCallback
 //  or v8::Isolate::SetModifyCodeGenerationFromStringsCallback2)
-bool ModifyCodeGenerationFromStrings(Isolate* isolate, Handle<Context> context,
+bool ModifyCodeGenerationFromStrings(Isolate* isolate,
+                                     Handle<NativeContext> context,
                                      Handle<i::Object>* source,
                                      bool is_code_like) {
   DCHECK(isolate->modify_code_gen_callback() ||
@@ -2953,14 +3055,14 @@ bool ModifyCodeGenerationFromStrings(Isolate* isolate, Handle<Context> context,
 
 // static
 std::pair<MaybeHandle<String>, bool> Compiler::ValidateDynamicCompilationSource(
-    Isolate* isolate, Handle<Context> context,
+    Isolate* isolate, Handle<NativeContext> context,
     Handle<i::Object> original_source, bool is_code_like) {
   // Check if the context unconditionally allows code gen from strings.
   // allow_code_gen_from_strings can be many things, so we'll always check
   // against the 'false' literal, so that e.g. undefined and 'true' are treated
   // the same.
-  if (!context->allow_code_gen_from_strings().IsFalse(isolate) &&
-      original_source->IsString()) {
+  if (!IsFalse(context->allow_code_gen_from_strings(), isolate) &&
+      IsString(*original_source)) {
     return {Handle<String>::cast(original_source), false};
   }
 
@@ -2971,9 +3073,9 @@ std::pair<MaybeHandle<String>, bool> Compiler::ValidateDynamicCompilationSource(
     // If we run into this condition, the embedder has marked some object
     // templates as "code like", but has given us a callback that only accepts
     // strings. That makes no sense.
-    DCHECK(!original_source->IsCodeLike(isolate));
+    DCHECK(!Object::IsCodeLike(*original_source, isolate));
 
-    if (!original_source->IsString()) {
+    if (!IsString(*original_source)) {
       return {MaybeHandle<String>(), true};
     }
     Handle<String> string_source = Handle<String>::cast(original_source);
@@ -2993,14 +3095,14 @@ std::pair<MaybeHandle<String>, bool> Compiler::ValidateDynamicCompilationSource(
                                          is_code_like)) {
       return {MaybeHandle<String>(), false};
     }
-    if (!modified_source->IsString()) {
+    if (!IsString(*modified_source)) {
       return {MaybeHandle<String>(), true};
     }
     return {Handle<String>::cast(modified_source), false};
   }
 
-  if (!context->allow_code_gen_from_strings().IsFalse(isolate) &&
-      original_source->IsCodeLike(isolate)) {
+  if (!IsFalse(context->allow_code_gen_from_strings(), isolate) &&
+      Object::IsCodeLike(*original_source, isolate)) {
     // Codegen is unconditionally allowed, and we're been given a CodeLike
     // object. Stringify.
     MaybeHandle<String> stringified_source =
@@ -3010,15 +3112,14 @@ std::pair<MaybeHandle<String>, bool> Compiler::ValidateDynamicCompilationSource(
 
   // If unconditional codegen was disabled, and no callback defined, we block
   // strings and allow all other objects.
-  return {MaybeHandle<String>(), !original_source->IsString()};
+  return {MaybeHandle<String>(), !IsString(*original_source)};
 }
 
 // static
 MaybeHandle<JSFunction> Compiler::GetFunctionFromValidatedString(
-    Handle<Context> context, MaybeHandle<String> source,
+    Handle<NativeContext> native_context, MaybeHandle<String> source,
     ParseRestriction restriction, int parameters_end_pos) {
-  Isolate* const isolate = context->GetIsolate();
-  Handle<Context> native_context(context->native_context(), isolate);
+  Isolate* const isolate = native_context->GetIsolate();
 
   // Raise an EvalError if we did not receive a string.
   if (source.is_null()) {
@@ -3034,7 +3135,7 @@ MaybeHandle<JSFunction> Compiler::GetFunctionFromValidatedString(
   int eval_scope_position = 0;
   int eval_position = kNoSourcePosition;
   Handle<SharedFunctionInfo> outer_info(
-      native_context->empty_function().shared(), isolate);
+      native_context->empty_function()->shared(), isolate);
   return Compiler::GetFunctionFromEval(source.ToHandleChecked(), outer_info,
                                        native_context, LanguageMode::kSloppy,
                                        restriction, parameters_end_pos,
@@ -3043,7 +3144,7 @@ MaybeHandle<JSFunction> Compiler::GetFunctionFromValidatedString(
 
 // static
 MaybeHandle<JSFunction> Compiler::GetFunctionFromString(
-    Handle<Context> context, Handle<Object> source,
+    Handle<NativeContext> context, Handle<Object> source,
     ParseRestriction restriction, int parameters_end_pos, bool is_code_like) {
   Isolate* const isolate = context->GetIsolate();
   MaybeHandle<String> validated_source =
@@ -3273,11 +3374,15 @@ MaybeHandle<SharedFunctionInfo> CompileScriptOnMainThread(
     const UnoptimizedCompileFlags flags, Handle<String> source,
     const ScriptDetails& script_details, NativesFlag natives,
     v8::Extension* extension, Isolate* isolate,
-    MaybeHandle<Script> maybe_script, IsCompiledScope* is_compiled_scope) {
+    MaybeHandle<Script> maybe_script, IsCompiledScope* is_compiled_scope,
+    CompileHintCallback compile_hint_callback = nullptr,
+    void* compile_hint_callback_data = nullptr) {
   UnoptimizedCompileState compile_state;
   ReusableUnoptimizedCompileState reusable_state(isolate);
   ParseInfo parse_info(isolate, flags, &compile_state, &reusable_state);
   parse_info.set_extension(extension);
+  parse_info.SetCompileHintCallbackAndData(compile_hint_callback,
+                                           compile_hint_callback_data);
 
   Handle<Script> script;
   if (!maybe_script.ToHandle(&script)) {
@@ -3289,11 +3394,11 @@ MaybeHandle<SharedFunctionInfo> CompileScriptOnMainThread(
                                    is_compiled_scope);
 }
 
-class StressBackgroundCompileThread : public base::Thread {
+class StressBackgroundCompileThread : public ParkingThread {
  public:
   StressBackgroundCompileThread(Isolate* isolate, Handle<String> source,
                                 const ScriptDetails& script_details)
-      : base::Thread(
+      : ParkingThread(
             base::Thread::Options("StressBackgroundCompileThread", 2 * i::MB)),
         source_(source),
         streamed_source_(std::make_unique<SourceStream>(source, isolate),
@@ -3354,7 +3459,7 @@ bool CanBackgroundCompile(const ScriptDetails& script_details,
 }
 
 bool CompilationExceptionIsRangeError(Isolate* isolate, Handle<Object> obj) {
-  if (!obj->IsJSError(isolate)) return false;
+  if (!IsJSError(*obj, isolate)) return false;
   Handle<JSReceiver> js_obj = Handle<JSReceiver>::cast(obj);
   Handle<JSReceiver> constructor;
   if (!JSReceiver::GetConstructor(isolate, js_obj).ToHandle(&constructor)) {
@@ -3397,10 +3502,7 @@ MaybeHandle<SharedFunctionInfo> CompileScriptOnBothBackgroundAndMainThread(
   }
 
   // Join with background thread and finalize compilation.
-  {
-    ParkedScope scope(isolate->main_thread_local_isolate());
-    background_compile_thread.Join();
-  }
+  background_compile_thread.ParkedJoin(isolate->main_thread_local_isolate());
 
   MaybeHandle<SharedFunctionInfo> maybe_result =
       Compiler::GetSharedFunctionInfoForStreamedScript(
@@ -3450,6 +3552,9 @@ MaybeHandle<SharedFunctionInfo> GetSharedFunctionInfoForScriptImpl(
   if (compile_options == ScriptCompiler::kConsumeCompileHints) {
     DCHECK_NOT_NULL(compile_hint_callback);
     DCHECK_NOT_NULL(compile_hint_callback_data);
+  } else {
+    DCHECK_NULL(compile_hint_callback);
+    DCHECK_NULL(compile_hint_callback_data);
   }
 
   LanguageMode language_mode = construct_language_mode(v8_flags.use_strict);
@@ -3556,7 +3661,8 @@ MaybeHandle<SharedFunctionInfo> GetSharedFunctionInfoForScriptImpl(
 
       maybe_result = CompileScriptOnMainThread(
           flags, source, script_details, natives, extension, isolate,
-          maybe_script, &is_compiled_scope);
+          maybe_script, &is_compiled_scope, compile_hint_callback,
+          compile_hint_callback_data);
     }
 
     // Add the result to the isolate cache.
@@ -3571,7 +3677,7 @@ MaybeHandle<SharedFunctionInfo> GetSharedFunctionInfoForScriptImpl(
   Handle<SharedFunctionInfo> result;
   if (compile_options == ScriptCompiler::CompileOptions::kProduceCompileHints &&
       maybe_result.ToHandle(&result)) {
-    Script::cast(result->script()).set_produce_compile_hints(true);
+    Script::cast(result->script())->set_produce_compile_hints(true);
   }
 
   return maybe_result;
@@ -3693,7 +3799,7 @@ MaybeHandle<JSFunction> Compiler::GetWrappedFunction(
     ParseInfo parse_info(isolate, flags, &compile_state, &reusable_state);
 
     MaybeHandle<ScopeInfo> maybe_outer_scope_info;
-    if (!context->IsNativeContext()) {
+    if (!IsNativeContext(*context)) {
       maybe_outer_scope_info = handle(context->scope_info(), isolate);
     }
 
@@ -3710,7 +3816,7 @@ MaybeHandle<JSFunction> Compiler::GetWrappedFunction(
     SharedFunctionInfo::ScriptIterator infos(isolate, *script);
     for (SharedFunctionInfo info = infos.Next(); !info.is_null();
          info = infos.Next()) {
-      if (info.is_wrapped()) {
+      if (info->is_wrapped()) {
         wrapped = Handle<SharedFunctionInfo>(info, isolate);
         break;
       }
@@ -3777,7 +3883,7 @@ Compiler::GetSharedFunctionInfoForStreamedScript(
     Handle<SharedFunctionInfo> result;
     if (maybe_result.ToHandle(&result)) {
       if (task->flags().produce_compile_hints()) {
-        Script::cast(result->script()).set_produce_compile_hints(true);
+        Script::cast(result->script())->set_produce_compile_hints(true);
       }
 
       // Add compiled code to the isolate cache.
@@ -3849,11 +3955,12 @@ template Handle<SharedFunctionInfo> Compiler::GetSharedFunctionInfo(
 MaybeHandle<Code> Compiler::CompileOptimizedOSR(Isolate* isolate,
                                                 Handle<JSFunction> function,
                                                 BytecodeOffset osr_offset,
-                                                ConcurrencyMode mode) {
+                                                ConcurrencyMode mode,
+                                                CodeKind code_kind) {
   DCHECK(IsOSR(osr_offset));
 
   if (V8_UNLIKELY(isolate->serializer_enabled())) return {};
-  if (V8_UNLIKELY(function->shared().optimization_disabled())) return {};
+  if (V8_UNLIKELY(function->shared()->optimization_disabled())) return {};
 
   // TODO(chromium:1031479): Currently, OSR triggering mechanism is tied to the
   // bytecode array. So, it might be possible to mark closure in one native
@@ -3862,23 +3969,15 @@ MaybeHandle<Code> Compiler::CompileOptimizedOSR(Isolate* isolate,
   // often.
   if (V8_UNLIKELY(!function->has_feedback_vector())) return {};
 
-  // One OSR job per function at a time.
-  if (IsInProgress(function->osr_tiering_state())) {
-    return {};
-  }
-
-  // -- Alright, decided to proceed. --
-
-  function->feedback_vector().reset_osr_urgency();
-
   CompilerTracer::TraceOptimizeOSRStarted(isolate, function, osr_offset, mode);
-  MaybeHandle<Code> result = GetOrCompileOptimized(
-      isolate, function, mode, CodeKind::TURBOFAN, osr_offset);
+  MaybeHandle<Code> result =
+      GetOrCompileOptimized(isolate, function, mode, code_kind, osr_offset);
 
   if (result.is_null()) {
     CompilerTracer::TraceOptimizeOSRUnavailable(isolate, function, osr_offset,
                                                 mode);
   } else {
+    DCHECK_GE(result.ToHandleChecked()->kind(), CodeKind::MAGLEV);
     CompilerTracer::TraceOptimizeOSRAvailable(isolate, function, osr_offset,
                                               mode);
   }
@@ -3893,7 +3992,7 @@ void Compiler::DisposeTurbofanCompilationJob(Isolate* isolate,
   Handle<JSFunction> function = job->compilation_info()->closure();
   ResetTieringState(*function, job->compilation_info()->osr_offset());
   if (restore_function_code) {
-    function->set_code(function->shared().GetCode(isolate));
+    function->set_code(function->shared()->GetCode(isolate));
   }
 }
 
@@ -3906,7 +4005,7 @@ void Compiler::FinalizeTurbofanCompilationJob(TurbofanCompilationJob* job,
   TimerEventScope<TimerEventRecompileSynchronous> timer(isolate);
   RCS_SCOPE(isolate, RuntimeCallCounterId::kOptimizeConcurrentFinalize);
   TRACE_EVENT_WITH_FLOW0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
-                         "V8.OptimizeConcurrentFinalize", job,
+                         "V8.OptimizeConcurrentFinalize", job->trace_id(),
                          TRACE_EVENT_FLAG_FLOW_IN);
 
   Handle<JSFunction> function = compilation_info->closure();
@@ -3915,11 +4014,7 @@ void Compiler::FinalizeTurbofanCompilationJob(TurbofanCompilationJob* job,
   const bool use_result = !compilation_info->discard_result_for_testing();
   const BytecodeOffset osr_offset = compilation_info->osr_offset();
 
-  if (V8_LIKELY(use_result)) {
-    ResetProfilerTicks(*function, osr_offset);
-  }
-
-  DCHECK(!shared->HasBreakInfo());
+  DCHECK(!shared->HasBreakInfo(isolate));
 
   // 1) Optimization on the concurrent thread may have failed.
   // 2) The function may have already been optimized by OSR.  Simply continue.
@@ -3970,7 +4065,7 @@ void Compiler::FinalizeMaglevCompilationJob(maglev::MaglevCompilationJob* job,
   VMState<COMPILER> state(isolate);
 
   Handle<JSFunction> function = job->function();
-  if (function->ActiveTierIsTurbofan()) {
+  if (function->ActiveTierIsTurbofan() && !job->is_osr()) {
     CompilerTracer::TraceAbortedMaglevCompile(
         isolate, function, BailoutReason::kHigherTierAvailable);
     return;
@@ -3982,56 +4077,60 @@ void Compiler::FinalizeMaglevCompilationJob(maglev::MaglevCompilationJob* job,
   // when all the bytecodes are implemented.
   USE(status);
 
-  static constexpr BytecodeOffset osr_offset = BytecodeOffset::None();
+  BytecodeOffset osr_offset = job->osr_offset();
   ResetTieringState(*function, osr_offset);
 
   if (status == CompilationJob::SUCCEEDED) {
+    Handle<SharedFunctionInfo> shared(function->shared(), isolate);
+    DCHECK(!shared->HasBreakInfo(isolate));
+
     // Note the finalized InstructionStream object has already been installed on
     // the function by MaglevCompilationJob::FinalizeJobImpl.
 
-    OptimizedCodeCache::Insert(isolate, *function, BytecodeOffset::None(),
-                               function->code(),
-                               job->specialize_to_function_context());
+    Handle<Code> code = job->code().ToHandleChecked();
+    if (!job->is_osr()) {
+      job->function()->set_code(*code);
+    }
 
-    // Reset ticks just after installation since ticks accumulated in lower
-    // tiers use a different (lower) budget than ticks collected in Maglev
-    // code.
-    ResetProfilerTicks(*function, osr_offset);
+    DCHECK(code->is_maglevved());
+    OptimizedCodeCache::Insert(isolate, *function, osr_offset, *code,
+                               job->specialize_to_function_context());
 
-    RecordMaglevFunctionCompilation(isolate, function);
+    RecordMaglevFunctionCompilation(isolate, function,
+                                    Handle<AbstractCode>::cast(code));
     job->RecordCompilationStats(isolate);
     CompilerTracer::TraceFinishMaglevCompile(
-        isolate, function, job->prepare_in_ms(), job->execute_in_ms(),
-        job->finalize_in_ms());
+        isolate, function, job->is_osr(), job->prepare_in_ms(),
+        job->execute_in_ms(), job->finalize_in_ms());
   }
 #endif
 }
 
 // static
-void Compiler::PostInstantiation(Handle<JSFunction> function) {
+void Compiler::PostInstantiation(Handle<JSFunction> function,
+                                 IsCompiledScope* is_compiled_scope) {
   Isolate* isolate = function->GetIsolate();
   Handle<SharedFunctionInfo> shared(function->shared(), isolate);
-  IsCompiledScope is_compiled_scope(shared->is_compiled_scope(isolate));
 
   // If code is compiled to bytecode (i.e., isn't asm.js), then allocate a
   // feedback and check for optimized code.
-  if (is_compiled_scope.is_compiled() && shared->HasBytecodeArray()) {
+  if (is_compiled_scope->is_compiled() && shared->HasBytecodeArray()) {
     // Don't reset budget if there is a closure feedback cell array already. We
     // are just creating a new closure that shares the same feedback cell.
-    JSFunction::InitializeFeedbackCell(function, &is_compiled_scope, false);
+    JSFunction::InitializeFeedbackCell(function, is_compiled_scope, false);
 
     if (function->has_feedback_vector()) {
       // Evict any deoptimized code on feedback vector. We need to do this after
       // creating the closure, since any heap allocations could trigger a GC and
       // deoptimized the code on the feedback vector. So check for any
       // deoptimized code just before installing it on the funciton.
-      function->feedback_vector().EvictOptimizedCodeMarkedForDeoptimization(
+      function->feedback_vector()->EvictOptimizedCodeMarkedForDeoptimization(
           isolate, *shared, "new function from shared function info");
-      Code code = function->feedback_vector().optimized_code();
+      Code code = function->feedback_vector()->optimized_code();
       if (!code.is_null()) {
         // Caching of optimized code enabled and optimized code found.
-        DCHECK(!code.marked_for_deoptimization());
-        DCHECK(function->shared().is_compiled());
+        DCHECK(!code->marked_for_deoptimization());
+        DCHECK(function->shared()->is_compiled());
 
         function->set_code(code);
       }
@@ -4041,7 +4140,7 @@ void Compiler::PostInstantiation(Handle<JSFunction> function) {
         !shared->optimization_disabled() &&
         !function->HasAvailableOptimizedCode()) {
       CompilerTracer::TraceMarkForAlwaysOpt(isolate, function);
-      JSFunction::EnsureFeedbackVector(isolate, function, &is_compiled_scope);
+      JSFunction::EnsureFeedbackVector(isolate, function, is_compiled_scope);
       function->MarkForOptimization(isolate, CodeKind::TURBOFAN,
                                     ConcurrencyMode::kSynchronous);
     }
diff --git a/deps/v8/src/codegen/compiler.h b/deps/v8/src/codegen/compiler.h
index 67c8c145f0fb65..8edcb1352dcb1c 100644
--- a/deps/v8/src/codegen/compiler.h
+++ b/deps/v8/src/codegen/compiler.h
@@ -47,6 +47,13 @@ struct ScriptStreamingData;
 
 namespace maglev {
 class MaglevCompilationJob;
+
+static inline bool IsMaglevEnabled() { return v8_flags.maglev; }
+
+static inline bool IsMaglevOsrEnabled() {
+  return IsMaglevEnabled() && v8_flags.maglev_osr;
+}
+
 }  // namespace maglev
 
 // The V8 compiler API.
@@ -97,7 +104,7 @@ class V8_EXPORT_PRIVATE Compiler : public AllStatic {
   // a future OSR request will pick up the resulting code object).
   V8_WARN_UNUSED_RESULT static MaybeHandle<Code> CompileOptimizedOSR(
       Isolate* isolate, Handle<JSFunction> function, BytecodeOffset osr_offset,
-      ConcurrencyMode mode);
+      ConcurrencyMode mode, CodeKind code_kind);
 
   V8_WARN_UNUSED_RESULT static MaybeHandle<SharedFunctionInfo>
   CompileForLiveEdit(ParseInfo* parse_info, Handle<Script> script,
@@ -130,7 +137,8 @@ class V8_EXPORT_PRIVATE Compiler : public AllStatic {
   // Give the compiler a chance to perform low-latency initialization tasks of
   // the given {function} on its instantiation. Note that only the runtime will
   // offer this chance, optimized closure instantiation will not call this.
-  static void PostInstantiation(Handle<JSFunction> function);
+  static void PostInstantiation(Handle<JSFunction> function,
+                                IsCompiledScope* is_compiled_scope);
 
   // ===========================================================================
   // The following family of methods instantiates new functions for scripts or
@@ -161,17 +169,18 @@ class V8_EXPORT_PRIVATE Compiler : public AllStatic {
 
   // Create a (bound) function for a String source within a context for eval.
   V8_WARN_UNUSED_RESULT static MaybeHandle<JSFunction> GetFunctionFromString(
-      Handle<Context> context, Handle<i::Object> source,
+      Handle<NativeContext> context, Handle<i::Object> source,
       ParseRestriction restriction, int parameters_end_pos, bool is_code_like);
 
   // Decompose GetFunctionFromString into two functions, to allow callers to
   // deal seperately with a case of object not handled by the embedder.
   V8_WARN_UNUSED_RESULT static std::pair<MaybeHandle<String>, bool>
-  ValidateDynamicCompilationSource(Isolate* isolate, Handle<Context> context,
+  ValidateDynamicCompilationSource(Isolate* isolate,
+                                   Handle<NativeContext> context,
                                    Handle<i::Object> source_object,
                                    bool is_code_like = false);
   V8_WARN_UNUSED_RESULT static MaybeHandle<JSFunction>
-  GetFunctionFromValidatedString(Handle<Context> context,
+  GetFunctionFromValidatedString(Handle<NativeContext> context,
                                  MaybeHandle<String> source,
                                  ParseRestriction restriction,
                                  int parameters_end_pos);
@@ -249,6 +258,10 @@ class V8_EXPORT_PRIVATE Compiler : public AllStatic {
                                      Handle<FeedbackVector> vector,
                                      Handle<AbstractCode> abstract_code,
                                      CodeKind kind, double time_taken_ms);
+
+  static void InstallInterpreterTrampolineCopy(
+      Isolate* isolate, Handle<SharedFunctionInfo> shared_info,
+      LogEventListener::CodeTag log_tag);
 };
 
 // A base class for compilation jobs intended to run concurrent to the main
@@ -264,18 +277,12 @@ class V8_EXPORT_PRIVATE CompilationJob {
     kFailed,
   };
 
-  explicit CompilationJob(State initial_state) : state_(initial_state) {
-    timer_.Start();
-  }
+  explicit CompilationJob(State initial_state) : state_(initial_state) {}
   virtual ~CompilationJob() = default;
 
   State state() const { return state_; }
 
  protected:
-  V8_WARN_UNUSED_RESULT base::TimeDelta ElapsedTime() const {
-    return timer_.Elapsed();
-  }
-
   V8_WARN_UNUSED_RESULT Status UpdateState(Status status, State next_state) {
     switch (status) {
       case SUCCEEDED:
@@ -293,7 +300,6 @@ class V8_EXPORT_PRIVATE CompilationJob {
 
  private:
   State state_;
-  base::ElapsedTimer timer_;
 };
 
 // A base class for unoptimized compilation jobs.
@@ -378,7 +384,9 @@ class UnoptimizedCompilationJob : public CompilationJob {
 class OptimizedCompilationJob : public CompilationJob {
  public:
   OptimizedCompilationJob(const char* compiler_name, State initial_state)
-      : CompilationJob(initial_state), compiler_name_(compiler_name) {}
+      : CompilationJob(initial_state), compiler_name_(compiler_name) {
+    timer_.Start();
+  }
 
   // Prepare the compile job. Must be called on the main thread.
   V8_EXPORT_PRIVATE V8_WARN_UNUSED_RESULT Status PrepareJob(Isolate* isolate);
@@ -390,6 +398,11 @@ class OptimizedCompilationJob : public CompilationJob {
   // Finalizes the compile job. Must be called on the main thread.
   V8_EXPORT_PRIVATE V8_WARN_UNUSED_RESULT Status FinalizeJob(Isolate* isolate);
 
+  // Registers weak object to optimized code dependencies.
+  void RegisterWeakObjectsInOptimizedCode(Isolate* isolate,
+                                          Handle<NativeContext> context,
+                                          Handle<Code> code);
+
   const char* compiler_name() const { return compiler_name_; }
 
   double prepare_in_ms() const {
@@ -402,6 +415,10 @@ class OptimizedCompilationJob : public CompilationJob {
     return time_taken_to_finalize_.InMillisecondsF();
   }
 
+  V8_WARN_UNUSED_RESULT base::TimeDelta ElapsedTime() const {
+    return timer_.Elapsed();
+  }
+
  protected:
   // Overridden by the actual implementation.
   virtual Status PrepareJobImpl(Isolate* isolate) = 0;
@@ -413,6 +430,8 @@ class OptimizedCompilationJob : public CompilationJob {
   base::TimeDelta time_taken_to_execute_;
   base::TimeDelta time_taken_to_finalize_;
 
+  base::ElapsedTimer timer_;
+
  private:
   const char* const compiler_name_;
 };
@@ -441,6 +460,9 @@ class TurbofanCompilationJob : public OptimizedCompilationJob {
   void RecordFunctionCompilation(LogEventListener::CodeTag code_type,
                                  Isolate* isolate) const;
 
+  // Intended for use as a globally unique id in trace events.
+  uint64_t trace_id() const;
+
  private:
   OptimizedCompilationInfo* const compilation_info_;
 };
@@ -533,7 +555,9 @@ class V8_EXPORT_PRIVATE BackgroundCompileTask {
   // Note: does not take ownership of |data|.
   BackgroundCompileTask(ScriptStreamingData* data, Isolate* isolate,
                         v8::ScriptType type,
-                        ScriptCompiler::CompileOptions options);
+                        ScriptCompiler::CompileOptions options,
+                        CompileHintCallback compile_hint_callback = nullptr,
+                        void* compile_hint_callback_data = nullptr);
   BackgroundCompileTask(const BackgroundCompileTask&) = delete;
   BackgroundCompileTask& operator=(const BackgroundCompileTask&) = delete;
   ~BackgroundCompileTask();
@@ -595,6 +619,9 @@ class V8_EXPORT_PRIVATE BackgroundCompileTask {
   int start_position_;
   int end_position_;
   int function_literal_id_;
+
+  CompileHintCallback compile_hint_callback_ = nullptr;
+  void* compile_hint_callback_data_ = nullptr;
 };
 
 // Contains all data which needs to be transmitted between threads for
diff --git a/deps/v8/src/codegen/constant-pool.cc b/deps/v8/src/codegen/constant-pool.cc
index f73cf5cf7d3ed3..e48905ccbda179 100644
--- a/deps/v8/src/codegen/constant-pool.cc
+++ b/deps/v8/src/codegen/constant-pool.cc
@@ -308,12 +308,14 @@ void ConstantPool::Clear() {
   entry32_count_ = 0;
   entry64_count_ = 0;
   next_check_ = 0;
+  old_next_check_ = 0;
 }
 
 void ConstantPool::StartBlock() {
   if (blocked_nesting_ == 0) {
     // Prevent constant pool checks from happening by setting the next check to
     // the biggest possible offset.
+    old_next_check_ = next_check_;
     next_check_ = kMaxInt;
   }
   ++blocked_nesting_;
@@ -323,8 +325,10 @@ void ConstantPool::EndBlock() {
   --blocked_nesting_;
   if (blocked_nesting_ == 0) {
     DCHECK(IsInImmRangeIfEmittedAt(assm_->pc_offset()));
-    // Make sure a check happens quickly after getting unblocked.
-    next_check_ = 0;
+    // Restore the old next_check_ value if it's less than the current
+    // next_check_. This accounts for any attempt to emit pools sooner whilst
+    // pools were blocked.
+    next_check_ = std::min(next_check_, old_next_check_);
   }
 }
 
diff --git a/deps/v8/src/codegen/constant-pool.h b/deps/v8/src/codegen/constant-pool.h
index 16ddc33c6fc0b4..d5949eef42e5be 100644
--- a/deps/v8/src/codegen/constant-pool.h
+++ b/deps/v8/src/codegen/constant-pool.h
@@ -343,6 +343,7 @@ class ConstantPool {
   size_t entry32_count_ = 0;
   size_t entry64_count_ = 0;
   int next_check_ = 0;
+  int old_next_check_ = 0;
   int blocked_nesting_ = 0;
 };
 
diff --git a/deps/v8/src/codegen/external-reference-table.cc b/deps/v8/src/codegen/external-reference-table.cc
index bd8976350d239d..96e2606b8fc14d 100644
--- a/deps/v8/src/codegen/external-reference-table.cc
+++ b/deps/v8/src/codegen/external-reference-table.cc
@@ -30,6 +30,7 @@ namespace internal {
   "Accessors::" #AccessorName "Getter",
 #define ADD_ACCESSOR_GETTER_NAME(name) "Accessors::" #name,
 #define ADD_ACCESSOR_SETTER_NAME(name) "Accessors::" #name,
+#define ADD_ACCESSOR_CALLBACK_NAME(_, name, ...) "Accessors::" #name,
 #define ADD_STATS_COUNTER_NAME(name, ...) "StatsCounter::" #name,
 // static
 // clang-format off
@@ -48,6 +49,8 @@ const char* const
         ACCESSOR_INFO_LIST_GENERATOR(ADD_ACCESSOR_INFO_NAME, /* not used */)
         ACCESSOR_GETTER_LIST(ADD_ACCESSOR_GETTER_NAME)
         ACCESSOR_SETTER_LIST(ADD_ACCESSOR_SETTER_NAME)
+        ACCESSOR_CALLBACK_LIST_GENERATOR(ADD_ACCESSOR_CALLBACK_NAME,
+                                         /* not used */)
 
         // === Isolate dependent ===
         // External references (with isolate):
@@ -77,6 +80,7 @@ const char* const
 #undef ADD_ISOLATE_ADDR
 #undef ADD_ACCESSOR_INFO_NAME
 #undef ADD_ACCESSOR_SETTER_NAME
+#undef ADD_ACCESSOR_CALLBACK_NAME
 #undef ADD_STATS_COUNTER_NAME
 
 namespace {
@@ -90,18 +94,27 @@ static Address ref_addr_isolate_independent_
 BUILTIN_LIST_C(FORWARD_DECLARE)
 #undef FORWARD_DECLARE
 
-void ExternalReferenceTable::Init(Isolate* isolate) {
-  int index = 0;
+void ExternalReferenceTable::InitIsolateIndependent() {
+  DCHECK_EQ(is_initialized_, kUninitialized);
 
+  int index = 0;
   CopyIsolateIndependentReferences(&index);
+  CHECK_EQ(kSizeIsolateIndependent, index);
+
+  is_initialized_ = kInitializedIsolateIndependent;
+}
+
+void ExternalReferenceTable::Init(Isolate* isolate) {
+  DCHECK_EQ(is_initialized_, kInitializedIsolateIndependent);
 
+  int index = kSizeIsolateIndependent;
   AddIsolateDependentReferences(isolate, &index);
   AddIsolateAddresses(isolate, &index);
   AddStubCache(isolate, &index);
   AddNativeCodeStatsCounters(isolate, &index);
-  is_initialized_ = static_cast<uint32_t>(true);
-
   CHECK_EQ(kSize, index);
+
+  is_initialized_ = kInitialized;
 }
 
 const char* ExternalReferenceTable::ResolveSymbol(void* address) {
@@ -238,21 +251,27 @@ void ExternalReferenceTable::AddAccessors(int* index) {
                kBuiltinsReferenceCount + kRuntimeReferenceCount,
            *index);
 
-  static const Address accessors[] = {
-  // Getters:
 #define ACCESSOR_INFO_DECLARATION(_, __, AccessorName, ...) \
   FUNCTION_ADDR(&Accessors::AccessorName##Getter),
+#define ACCESSOR_GETTER_DECLARATION(name) FUNCTION_ADDR(&Accessors::name),
+#define ACCESSOR_SETTER_DECLARATION(name) FUNCTION_ADDR(&Accessors::name),
+#define ACCESSOR_CALLBACK_DECLARATION(_, AccessorName, ...) \
+  FUNCTION_ADDR(&Accessors::AccessorName),
+
+  static const Address accessors[] = {
+      // Getters:
       ACCESSOR_INFO_LIST_GENERATOR(ACCESSOR_INFO_DECLARATION, /* not used */)
+      // More getters:
+      ACCESSOR_GETTER_LIST(ACCESSOR_GETTER_DECLARATION)
+      // Setters:
+      ACCESSOR_SETTER_LIST(ACCESSOR_SETTER_DECLARATION)
+      // Callbacks:
+      ACCESSOR_CALLBACK_LIST_GENERATOR(ACCESSOR_CALLBACK_DECLARATION,
+                                       /* not used */)};
 #undef ACCESSOR_INFO_DECLARATION
-
-#define ACCESSOR_GETTER_DECLARATION(name) FUNCTION_ADDR(&Accessors::name),
-          ACCESSOR_GETTER_LIST(ACCESSOR_GETTER_DECLARATION)
 #undef ACCESSOR_GETTER_DECLARATION
-  // Setters:
-#define ACCESSOR_SETTER_DECLARATION(name) FUNCTION_ADDR(&Accessors::name),
-              ACCESSOR_SETTER_LIST(ACCESSOR_SETTER_DECLARATION)
 #undef ACCESSOR_SETTER_DECLARATION
-  };
+#undef ACCESSOR_CALLBACK_DECLARATION
 
   for (Address addr : accessors) {
     AddIsolateIndependent(addr, index);
diff --git a/deps/v8/src/codegen/external-reference-table.h b/deps/v8/src/codegen/external-reference-table.h
index 82efe78a8bac2b..d00358a0853011 100644
--- a/deps/v8/src/codegen/external-reference-table.h
+++ b/deps/v8/src/codegen/external-reference-table.h
@@ -36,7 +36,7 @@ class ExternalReferenceTable {
   static constexpr int kIsolateAddressReferenceCount = kIsolateAddressCount;
   static constexpr int kAccessorReferenceCount =
       Accessors::kAccessorInfoCount + Accessors::kAccessorGetterCount +
-      Accessors::kAccessorSetterCount;
+      Accessors::kAccessorSetterCount + Accessors::kAccessorCallbackCount;
   // The number of stub cache external references, see AddStubCache.
   static constexpr int kStubCacheReferenceCount = 12;
   static constexpr int kStatsCountersReferenceCount =
@@ -58,7 +58,7 @@ class ExternalReferenceTable {
   Address address(uint32_t i) const { return ref_addr_[i]; }
   const char* name(uint32_t i) const { return ref_name_[i]; }
 
-  bool is_initialized() const { return is_initialized_ != 0; }
+  bool is_initialized() const { return is_initialized_ == kInitialized; }
 
   static const char* ResolveSymbol(void* address);
 
@@ -80,7 +80,9 @@ class ExternalReferenceTable {
   ExternalReferenceTable() = default;
   ExternalReferenceTable(const ExternalReferenceTable&) = delete;
   ExternalReferenceTable& operator=(const ExternalReferenceTable&) = delete;
-  void Init(Isolate* isolate);
+
+  void InitIsolateIndependent();  // Step 1.
+  void Init(Isolate* isolate);    // Step 2.
 
  private:
   static void AddIsolateIndependent(Address address, int* index);
@@ -101,11 +103,19 @@ class ExternalReferenceTable {
   void AddNativeCodeStatsCounters(Isolate* isolate, int* index);
 
   static_assert(sizeof(Address) == kEntrySize);
+#ifdef DEBUG
+  Address ref_addr_[kSize] = {kNullAddress};
+#else
   Address ref_addr_[kSize];
+#endif  // DEBUG
   static const char* const ref_name_[kSize];
 
-  // Not bool to guarantee deterministic size.
-  uint32_t is_initialized_ = 0;
+  enum InitializationState : uint32_t {
+    kUninitialized,
+    kInitializedIsolateIndependent,
+    kInitialized,
+  };
+  InitializationState is_initialized_ = kUninitialized;
 
   // Redirect disabled stats counters to this field. This is done to make sure
   // we can have a snapshot that includes native counters even when the embedder
diff --git a/deps/v8/src/codegen/external-reference.cc b/deps/v8/src/codegen/external-reference.cc
index 7990f521692b1c..1163601c26f76e 100644
--- a/deps/v8/src/codegen/external-reference.cc
+++ b/deps/v8/src/codegen/external-reference.cc
@@ -248,6 +248,17 @@ ExternalReference::shared_external_pointer_table_address_address(
   return ExternalReference(
       isolate->shared_external_pointer_table_address_address());
 }
+
+ExternalReference ExternalReference::code_pointer_table_address() {
+  // TODO(saelo) remove this ifdef when merging V8_CODE_POINTER_SANDBOXING into
+  // V8_ENABLE_SANDBOX
+#ifdef V8_CODE_POINTER_SANDBOXING
+  return ExternalReference(GetProcessWideCodePointerTable()->base_address());
+#else
+  return ExternalReference(kNullAddress);
+#endif
+}
+
 #endif  // V8_ENABLE_SANDBOX
 
 ExternalReference ExternalReference::interpreter_dispatch_table_address(
@@ -340,6 +351,9 @@ struct IsValidExternalReferenceType<Result (Class::*)(Args...)> {
 FUNCTION_REFERENCE(write_barrier_marking_from_code_function,
                    WriteBarrier::MarkingFromCode)
 
+FUNCTION_REFERENCE(write_barrier_indirect_pointer_marking_from_code_function,
+                   WriteBarrier::IndirectPointerMarkingFromCode)
+
 FUNCTION_REFERENCE(write_barrier_shared_marking_from_code_function,
                    WriteBarrier::SharedMarkingFromCode)
 
@@ -349,6 +363,29 @@ FUNCTION_REFERENCE(shared_barrier_from_code_function,
 FUNCTION_REFERENCE(insert_remembered_set_function,
                    Heap::InsertIntoRememberedSetFromCode)
 
+namespace {
+
+intptr_t DebugBreakAtEntry(Isolate* isolate, Address raw_sfi) {
+  DisallowGarbageCollection no_gc;
+  Tagged<SharedFunctionInfo> sfi = SharedFunctionInfo::cast(Object(raw_sfi));
+  return isolate->debug()->BreakAtEntry(sfi) ? 1 : 0;
+}
+
+Address DebugGetCoverageInfo(Isolate* isolate, Address raw_sfi) {
+  DisallowGarbageCollection no_gc;
+  Tagged<SharedFunctionInfo> sfi = SharedFunctionInfo::cast(Object(raw_sfi));
+  base::Optional<DebugInfo> debug_info = isolate->debug()->TryGetDebugInfo(sfi);
+  if (debug_info.has_value() && debug_info->HasCoverageInfo()) {
+    return debug_info->coverage_info().ptr();
+  }
+  return Smi::zero().ptr();
+}
+
+}  // namespace
+
+FUNCTION_REFERENCE(debug_break_at_entry_function, DebugBreakAtEntry)
+FUNCTION_REFERENCE(debug_get_coverage_info_function, DebugGetCoverageInfo)
+
 FUNCTION_REFERENCE(delete_handle_scope_extensions,
                    HandleScope::DeleteExtensions)
 
@@ -359,7 +396,8 @@ ExternalPointerHandle AllocateAndInitializeExternalPointerTableEntry(
     Isolate* isolate, Address pointer) {
 #ifdef V8_ENABLE_SANDBOX
   return isolate->external_pointer_table().AllocateAndInitializeEntry(
-      isolate, pointer, kExternalObjectValueTag);
+      isolate->heap()->external_pointer_space(), pointer,
+      kExternalObjectValueTag);
 #else
   return 0;
 #endif  // V8_ENABLE_SANDBOX
@@ -412,6 +450,11 @@ FUNCTION_REFERENCE(new_deoptimizer_function, Deoptimizer::New)
 FUNCTION_REFERENCE(compute_output_frames_function,
                    Deoptimizer::ComputeOutputFrames)
 
+IF_WASM(FUNCTION_REFERENCE, wasm_sync_stack_limit, wasm::sync_stack_limit)
+IF_WASM(FUNCTION_REFERENCE, wasm_switch_to_the_central_stack,
+        wasm::switch_to_the_central_stack)
+IF_WASM(FUNCTION_REFERENCE, wasm_switch_from_the_central_stack,
+        wasm::switch_from_the_central_stack)
 IF_WASM(FUNCTION_REFERENCE, wasm_f32_trunc, wasm::f32_trunc_wrapper)
 IF_WASM(FUNCTION_REFERENCE, wasm_f32_floor, wasm::f32_floor_wrapper)
 IF_WASM(FUNCTION_REFERENCE, wasm_f32_ceil, wasm::f32_ceil_wrapper)
@@ -470,10 +513,10 @@ IF_WASM(FUNCTION_REFERENCE, wasm_memory_init, wasm::memory_init_wrapper)
 IF_WASM(FUNCTION_REFERENCE, wasm_memory_copy, wasm::memory_copy_wrapper)
 IF_WASM(FUNCTION_REFERENCE, wasm_memory_fill, wasm::memory_fill_wrapper)
 IF_WASM(FUNCTION_REFERENCE, wasm_float64_pow, wasm::float64_pow_wrapper)
-IF_WASM(FUNCTION_REFERENCE, wasm_call_trap_callback_for_testing,
-        wasm::call_trap_callback_for_testing)
 IF_WASM(FUNCTION_REFERENCE, wasm_array_copy, wasm::array_copy_wrapper)
 IF_WASM(FUNCTION_REFERENCE, wasm_array_fill, wasm::array_fill_wrapper)
+IF_WASM(FUNCTION_REFERENCE_WITH_TYPE, wasm_string_to_f64,
+        wasm::flat_string_to_f64, BUILTIN_FP_POINTER_CALL)
 
 static void f64_acos_wrapper(Address data) {
   double input = ReadUnalignedValue<double>(data);
@@ -514,6 +557,15 @@ ExternalReference ExternalReference::address_of_jslimit(Isolate* isolate) {
   return ExternalReference(address);
 }
 
+ExternalReference ExternalReference::address_of_no_heap_write_interrupt_request(
+    Isolate* isolate) {
+  Address address = isolate->stack_guard()->address_of_interrupt_request(
+      StackGuard::InterruptLevel::kNoHeapWrites);
+  // For efficient generated code, this should be root-register-addressable.
+  DCHECK(isolate->root_register_addressable_region().contains(address));
+  return ExternalReference(address);
+}
+
 ExternalReference ExternalReference::address_of_real_jslimit(Isolate* isolate) {
   Address address = isolate->stack_guard()->address_of_real_jslimit();
   // For efficient generated code, this should be root-register-addressable.
@@ -615,11 +667,6 @@ ExternalReference ExternalReference::address_of_log_or_trace_osr() {
   return ExternalReference(&v8_flags.log_or_trace_osr);
 }
 
-ExternalReference
-ExternalReference::address_of_FLAG_harmony_symbol_as_weakmap_key() {
-  return ExternalReference(&v8_flags.harmony_symbol_as_weakmap_key);
-}
-
 ExternalReference ExternalReference::address_of_builtin_subclassing_flag() {
   return ExternalReference(&v8_flags.builtin_subclassing);
 }
@@ -749,21 +796,21 @@ namespace {
 static uintptr_t BaselinePCForBytecodeOffset(Address raw_code_obj,
                                              int bytecode_offset,
                                              Address raw_bytecode_array) {
-  Code code_obj = Code::cast(Object(raw_code_obj));
-  BytecodeArray bytecode_array =
+  Tagged<Code> code_obj = Code::cast(Object(raw_code_obj));
+  Tagged<BytecodeArray> bytecode_array =
       BytecodeArray::cast(Object(raw_bytecode_array));
-  return code_obj.GetBaselineStartPCForBytecodeOffset(bytecode_offset,
-                                                      bytecode_array);
+  return code_obj->GetBaselineStartPCForBytecodeOffset(bytecode_offset,
+                                                       bytecode_array);
 }
 
 static uintptr_t BaselinePCForNextExecutedBytecode(Address raw_code_obj,
                                                    int bytecode_offset,
                                                    Address raw_bytecode_array) {
-  Code code_obj = Code::cast(Object(raw_code_obj));
-  BytecodeArray bytecode_array =
+  Tagged<Code> code_obj = Code::cast(Object(raw_code_obj));
+  Tagged<BytecodeArray> bytecode_array =
       BytecodeArray::cast(Object(raw_bytecode_array));
-  return code_obj.GetBaselinePCForNextExecutedBytecode(bytecode_offset,
-                                                       bytecode_array);
+  return code_obj->GetBaselinePCForNextExecutedBytecode(bytecode_offset,
+                                                        bytecode_array);
 }
 
 }  // namespace
@@ -777,16 +824,36 @@ ExternalReference ExternalReference::thread_in_wasm_flag_address_address(
   return ExternalReference(isolate->thread_in_wasm_flag_address_address());
 }
 
-ExternalReference ExternalReference::invoke_function_callback() {
-  Address thunk_address = FUNCTION_ADDR(&InvokeFunctionCallback);
-  ExternalReference::Type thunk_type = ExternalReference::PROFILING_API_CALL;
+ExternalReference ExternalReference::invoke_function_callback_generic() {
+  Address thunk_address = FUNCTION_ADDR(&InvokeFunctionCallbackGeneric);
+  ExternalReference::Type thunk_type = ExternalReference::DIRECT_API_CALL;
+  ApiFunction thunk_fun(thunk_address);
+  return ExternalReference::Create(&thunk_fun, thunk_type);
+}
+
+ExternalReference ExternalReference::invoke_function_callback_optimized() {
+  Address thunk_address = FUNCTION_ADDR(&InvokeFunctionCallbackOptimized);
+  ExternalReference::Type thunk_type = ExternalReference::DIRECT_API_CALL;
   ApiFunction thunk_fun(thunk_address);
   return ExternalReference::Create(&thunk_fun, thunk_type);
 }
 
+// static
+ExternalReference ExternalReference::invoke_function_callback(
+    CallApiCallbackMode mode) {
+  switch (mode) {
+    case CallApiCallbackMode::kGeneric:
+      return invoke_function_callback_generic();
+    case CallApiCallbackMode::kOptimized:
+      return invoke_function_callback_optimized();
+    case CallApiCallbackMode::kOptimizedNoProfiling:
+      return ExternalReference();
+  }
+}
+
 ExternalReference ExternalReference::invoke_accessor_getter_callback() {
   Address thunk_address = FUNCTION_ADDR(&InvokeAccessorGetterCallback);
-  ExternalReference::Type thunk_type = ExternalReference::PROFILING_GETTER_CALL;
+  ExternalReference::Type thunk_type = ExternalReference::DIRECT_GETTER_CALL;
   ApiFunction thunk_fun(thunk_address);
   return ExternalReference::Create(&thunk_fun, thunk_type);
 }
@@ -949,7 +1016,7 @@ void* libc_memmove(void* dest, const void* src, size_t n) {
 FUNCTION_REFERENCE(libc_memmove_function, libc_memmove)
 
 void* libc_memset(void* dest, int value, size_t n) {
-  DCHECK_EQ(static_cast<byte>(value), value);
+  DCHECK_EQ(static_cast<uint8_t>(value), value);
   return memset(dest, value, n);
 }
 
@@ -1037,8 +1104,8 @@ const uint8_t* ExternalOneByteStringGetChars(Address string) {
   // merged by the linker, resulting in one of the input type's vtable address
   // failing the address range check.
   // TODO(chromium:1160961): Consider removing the CHECK when CFI is fixed.
-  CHECK(Object(string).IsExternalOneByteString(cage_base));
-  return ExternalOneByteString::cast(Object(string)).GetChars(cage_base);
+  CHECK(IsExternalOneByteString(Object(string), cage_base));
+  return ExternalOneByteString::cast(Object(string))->GetChars(cage_base);
 }
 const uint16_t* ExternalTwoByteStringGetChars(Address string) {
   PtrComprCageBase cage_base = GetPtrComprCageBaseFromOnHeapAddress(string);
@@ -1047,8 +1114,8 @@ const uint16_t* ExternalTwoByteStringGetChars(Address string) {
   // merged by the linker, resulting in one of the input type's vtable address
   // failing the address range check.
   // TODO(chromium:1160961): Consider removing the CHECK when CFI is fixed.
-  CHECK(Object(string).IsExternalTwoByteString(cage_base));
-  return ExternalTwoByteString::cast(Object(string)).GetChars(cage_base);
+  CHECK(IsExternalTwoByteString(Object(string), cage_base));
+  return ExternalTwoByteString::cast(Object(string))->GetChars(cage_base);
 }
 
 }  // namespace
@@ -1081,13 +1148,13 @@ FUNCTION_REFERENCE(orderedhashmap_gethash_raw, OrderedHashMap::GetHash)
 
 Address GetOrCreateHash(Isolate* isolate, Address raw_key) {
   DisallowGarbageCollection no_gc;
-  return Object(raw_key).GetOrCreateHash(isolate).ptr();
+  return Object::GetOrCreateHash(Object(raw_key), isolate).ptr();
 }
 
 FUNCTION_REFERENCE(get_or_create_hash_raw, GetOrCreateHash)
 
 static Address JSReceiverCreateIdentityHash(Isolate* isolate, Address raw_key) {
-  JSReceiver key = JSReceiver::cast(Object(raw_key));
+  Tagged<JSReceiver> key = JSReceiver::cast(Object(raw_key));
   return JSReceiver::CreateIdentityHash(isolate, key).ptr();
 }
 
@@ -1162,8 +1229,8 @@ FUNCTION_REFERENCE(array_indexof_includes_double, ArrayIndexOfIncludesDouble)
 
 static Address LexicographicCompareWrapper(Isolate* isolate, Address smi_x,
                                            Address smi_y) {
-  Smi x(smi_x);
-  Smi y(smi_y);
+  Tagged<Smi> x(smi_x);
+  Tagged<Smi> y(smi_y);
   return Smi::LexicographicCompare(isolate, x, y);
 }
 
@@ -1247,8 +1314,8 @@ FUNCTION_REFERENCE(check_object_type, CheckObjectType)
 #ifdef V8_INTL_SUPPORT
 
 static Address ConvertOneByteToLower(Address raw_src, Address raw_dst) {
-  String src = String::cast(Object(raw_src));
-  String dst = String::cast(Object(raw_dst));
+  Tagged<String> src = String::cast(Object(raw_src));
+  Tagged<String> dst = String::cast(Object(raw_dst));
   return Intl::ConvertOneByteToLower(src, dst).ptr();
 }
 FUNCTION_REFERENCE(intl_convert_one_byte_to_lower, ConvertOneByteToLower)
@@ -1303,11 +1370,6 @@ ExternalReference ExternalReference::async_event_delegate_address(
   return ExternalReference(isolate->async_event_delegate_address());
 }
 
-ExternalReference ExternalReference::debug_execution_mode_address(
-    Isolate* isolate) {
-  return ExternalReference(isolate->debug_execution_mode_address());
-}
-
 ExternalReference ExternalReference::debug_is_active_address(Isolate* isolate) {
   return ExternalReference(isolate->debug()->is_active_address());
 }
@@ -1324,7 +1386,7 @@ ExternalReference ExternalReference::runtime_function_table_address(
 }
 
 static Address InvalidatePrototypeChainsWrapper(Address raw_map) {
-  Map map = Map::cast(Object(raw_map));
+  Tagged<Map> map = Map::cast(Object(raw_map));
   return JSObject::InvalidatePrototypeChains(map).ptr();
 }
 
@@ -1359,14 +1421,20 @@ ExternalReference ExternalReference::fast_api_call_target_address(
       isolate->isolate_data()->fast_api_call_target_address());
 }
 
+ExternalReference ExternalReference::api_callback_thunk_argument_address(
+    Isolate* isolate) {
+  return ExternalReference(
+      isolate->isolate_data()->api_callback_thunk_argument_address());
+}
+
 ExternalReference ExternalReference::stack_is_iterable_address(
     Isolate* isolate) {
   return ExternalReference(
       isolate->isolate_data()->stack_is_iterable_address());
 }
 
-ExternalReference ExternalReference::is_profiling_address(Isolate* isolate) {
-  return ExternalReference(isolate->isolate_data()->is_profiling_address());
+ExternalReference ExternalReference::execution_mode_address(Isolate* isolate) {
+  return ExternalReference(isolate->isolate_data()->execution_mode_address());
 }
 
 FUNCTION_REFERENCE(call_enqueue_microtask_function,
@@ -1607,7 +1675,7 @@ IF_TSAN(FUNCTION_REFERENCE, tsan_relaxed_load_function_64_bits,
 
 static int EnterMicrotaskContextWrapper(HandleScopeImplementer* hsi,
                                         Address raw_context) {
-  Context context = Context::cast(Object(raw_context));
+  Tagged<NativeContext> context = NativeContext::cast(Object(raw_context));
   hsi->EnterMicrotaskContext(context);
   return 0;
 }
diff --git a/deps/v8/src/codegen/external-reference.h b/deps/v8/src/codegen/external-reference.h
index 503b5b681d9b7e..200f1d48b82e06 100644
--- a/deps/v8/src/codegen/external-reference.h
+++ b/deps/v8/src/codegen/external-reference.h
@@ -38,6 +38,9 @@ class StatsCounter;
   V(isolate_root, "Isolate::isolate_root()")                                   \
   V(allocation_sites_list_address, "Heap::allocation_sites_list_address()")    \
   V(address_of_jslimit, "StackGuard::address_of_jslimit()")                    \
+  V(address_of_no_heap_write_interrupt_request,                                \
+    "StackGuard::address_of_interrupt_request(StackGuard::InterruptLevel::"    \
+    "kNoHeapWrites)")                                                          \
   V(address_of_real_jslimit, "StackGuard::address_of_real_jslimit()")          \
   V(heap_is_marking_flag_address, "heap_is_marking_flag_address")              \
   V(heap_is_minor_marking_flag_address, "heap_is_minor_marking_flag_address")  \
@@ -58,13 +61,12 @@ class StatsCounter;
   V(promise_hook_flags_address, "Isolate::promise_hook_flags_address()")       \
   V(promise_hook_address, "Isolate::promise_hook_address()")                   \
   V(async_event_delegate_address, "Isolate::async_event_delegate_address()")   \
-  V(debug_execution_mode_address, "Isolate::debug_execution_mode_address()")   \
   V(debug_is_active_address, "Debug::is_active_address()")                     \
   V(debug_hook_on_function_call_address,                                       \
     "Debug::hook_on_function_call_address()")                                  \
   V(runtime_function_table_address,                                            \
     "Runtime::runtime_function_table_address()")                               \
-  V(is_profiling_address, "IsolateData::is_profiling")                         \
+  V(execution_mode_address, "IsolateData::execution_mode")                     \
   V(debug_suspended_generator_address,                                         \
     "Debug::step_suspended_generator_address()")                               \
   V(fast_c_call_caller_fp_address,                                             \
@@ -72,6 +74,8 @@ class StatsCounter;
   V(fast_c_call_caller_pc_address,                                             \
     "IsolateData::fast_c_call_caller_pc_address")                              \
   V(fast_api_call_target_address, "IsolateData::fast_api_call_target_address") \
+  V(api_callback_thunk_argument_address,                                       \
+    "IsolateData::api_callback_thunk_argument_address")                        \
   V(stack_is_iterable_address, "IsolateData::stack_is_iterable_address")       \
   V(address_of_regexp_stack_limit_address,                                     \
     "RegExpStack::limit_address_address()")                                    \
@@ -102,8 +106,6 @@ class StatsCounter;
   V(address_of_log_or_trace_osr, "v8_flags.log_or_trace_osr")                  \
   V(address_of_FLAG_harmony_regexp_unicode_sets,                               \
     "v8_flags.harmony_regexp_unicode_sets")                                    \
-  V(address_of_FLAG_harmony_symbol_as_weakmap_key,                             \
-    "v8_flags.harmony_symbol_as_weakmap_key")                                  \
   V(address_of_builtin_subclassing_flag, "v8_flags.builtin_subclassing")       \
   V(address_of_double_abs_constant, "double_absolute_constant")                \
   V(address_of_double_neg_constant, "double_negate_constant")                  \
@@ -135,6 +137,8 @@ class StatsCounter;
   V(copy_typed_array_elements_to_typed_array,                                  \
     "copy_typed_array_elements_to_typed_array")                                \
   V(cpu_features, "cpu_features")                                              \
+  V(debug_break_at_entry_function, "DebugBreakAtEntry")                        \
+  V(debug_get_coverage_info_function, "DebugGetCoverageInfo")                  \
   V(delete_handle_scope_extensions, "HandleScope::DeleteExtensions")           \
   V(ephemeron_key_write_barrier_function,                                      \
     "Heap::EphemeronKeyWriteBarrierFromCode")                                  \
@@ -169,7 +173,8 @@ class StatsCounter;
   V(invalidate_prototype_chains_function,                                      \
     "JSObject::InvalidatePrototypeChains()")                                   \
   V(invoke_accessor_getter_callback, "InvokeAccessorGetterCallback")           \
-  V(invoke_function_callback, "InvokeFunctionCallback")                        \
+  V(invoke_function_callback_generic, "InvokeFunctionCallbackGeneric")         \
+  V(invoke_function_callback_optimized, "InvokeFunctionCallbackOptimized")     \
   V(jsarray_array_join_concat_to_sequential_string,                            \
     "jsarray_array_join_concat_to_sequential_string")                          \
   V(jsreceiver_create_identity_hash, "jsreceiver_create_identity_hash")        \
@@ -250,8 +255,11 @@ class StatsCounter;
     "name_to_index_hashtable_lookup_forwarded_string")                         \
   V(name_to_index_hashtable_find_insertion_entry_forwarded_string,             \
     "name_to_index_hashtable_find_insertion_entry_forwarded_string")           \
-  IF_WASM(V, wasm_call_trap_callback_for_testing,                              \
-          "wasm::call_trap_callback_for_testing")                              \
+  IF_WASM(V, wasm_sync_stack_limit, "wasm_sync_stack_limit")                   \
+  IF_WASM(V, wasm_switch_to_the_central_stack,                                 \
+          "wasm::switch_to_the_central_stack")                                 \
+  IF_WASM(V, wasm_switch_from_the_central_stack,                               \
+          "wasm::switch_from_the_central_stack")                               \
   IF_WASM(V, wasm_f32_ceil, "wasm::f32_ceil_wrapper")                          \
   IF_WASM(V, wasm_f32_floor, "wasm::f32_floor_wrapper")                        \
   IF_WASM(V, wasm_f32_nearest_int, "wasm::f32_nearest_int_wrapper")            \
@@ -300,6 +308,7 @@ class StatsCounter;
   IF_WASM(V, wasm_memory_fill, "wasm::memory_fill")                            \
   IF_WASM(V, wasm_array_copy, "wasm::array_copy")                              \
   IF_WASM(V, wasm_array_fill, "wasm::array_fill")                              \
+  IF_WASM(V, wasm_string_to_f64, "wasm_string_to_f64")                         \
   V(address_of_wasm_i8x16_swizzle_mask, "wasm_i8x16_swizzle_mask")             \
   V(address_of_wasm_i8x16_popcnt_mask, "wasm_i8x16_popcnt_mask")               \
   V(address_of_wasm_i8x16_splat_0x01, "wasm_i8x16_splat_0x01")                 \
@@ -316,6 +325,8 @@ class StatsCounter;
   V(address_of_wasm_int32_overflow_as_float, "wasm_int32_overflow_as_float")   \
   V(supports_cetss_address, "CpuFeatures::supports_cetss_address")             \
   V(write_barrier_marking_from_code_function, "WriteBarrier::MarkingFromCode") \
+  V(write_barrier_indirect_pointer_marking_from_code_function,                 \
+    "WriteBarrier::IndirectPointerMarkingFromCode")                            \
   V(write_barrier_shared_marking_from_code_function,                           \
     "WriteBarrier::SharedMarkingFromCode")                                     \
   V(shared_barrier_from_code_function, "WriteBarrier::SharedFromCode")         \
@@ -384,10 +395,11 @@ class StatsCounter;
 #endif  // V8_INTL_SUPPORT
 
 #ifdef V8_ENABLE_SANDBOX
-#define EXTERNAL_REFERENCE_LIST_SANDBOX(V)   \
-  V(sandbox_base_address, "Sandbox::base()") \
-  V(sandbox_end_address, "Sandbox::end()")   \
-  V(empty_backing_store_buffer, "EmptyBackingStoreBuffer()")
+#define EXTERNAL_REFERENCE_LIST_SANDBOX(V)                   \
+  V(sandbox_base_address, "Sandbox::base()")                 \
+  V(sandbox_end_address, "Sandbox::end()")                   \
+  V(empty_backing_store_buffer, "EmptyBackingStoreBuffer()") \
+  V(code_pointer_table_address, "GetProcessWideCodePointerTable()")
 #else
 #define EXTERNAL_REFERENCE_LIST_SANDBOX(V)
 #endif  // V8_ENABLE_SANDBOX
@@ -429,23 +441,18 @@ class ExternalReference {
     // double f(double, int).
     BUILTIN_FP_INT_CALL,
 
+    // Builtin call that returns floating point.
+    // double f(Address tagged_ptr).
+    BUILTIN_FP_POINTER_CALL,
+
     // Direct call to API function callback.
     // void f(v8::FunctionCallbackInfo&)
     DIRECT_API_CALL,
 
-    // Call to function callback via InvokeFunctionCallback.
-    // void f(v8::FunctionCallbackInfo&, v8::FunctionCallback)
-    PROFILING_API_CALL,
-
     // Direct call to accessor getter callback.
     // void f(Local<Name> property, PropertyCallbackInfo& info)
     DIRECT_GETTER_CALL,
 
-    // Call to accessor getter callback via InvokeAccessorGetterCallback.
-    // void f(Local<Name> property, PropertyCallbackInfo& info,
-    //     AccessorNameGetterCallback callback)
-    PROFILING_GETTER_CALL,
-
     // C call, either representing a fast API call or used in tests.
     // Can have arbitrary signature from the types supported by the fast API.
     FAST_C_CALL
@@ -504,6 +511,8 @@ class ExternalReference {
   static V8_EXPORT_PRIVATE ExternalReference
   address_of_store_to_stack_count(const char* function_name);
 
+  static ExternalReference invoke_function_callback(CallApiCallbackMode mode);
+
   Address address() const { return address_; }
 
   // Creates a redirection trampoline for given C function and signature for
diff --git a/deps/v8/src/codegen/handler-table.cc b/deps/v8/src/codegen/handler-table.cc
index a00f9113ffbf20..e8f1e2e8ede5ad 100644
--- a/deps/v8/src/codegen/handler-table.cc
+++ b/deps/v8/src/codegen/handler-table.cc
@@ -19,8 +19,8 @@
 namespace v8 {
 namespace internal {
 
-HandlerTable::HandlerTable(Code code)
-    : HandlerTable(code.HandlerTableAddress(), code.handler_table_size(),
+HandlerTable::HandlerTable(Tagged<Code> code)
+    : HandlerTable(code->handler_table_address(), code->handler_table_size(),
                    kReturnAddressBasedEncoding) {}
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -29,12 +29,12 @@ HandlerTable::HandlerTable(const wasm::WasmCode* code)
                    kReturnAddressBasedEncoding) {}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-HandlerTable::HandlerTable(BytecodeArray bytecode_array)
-    : HandlerTable(bytecode_array.handler_table()) {}
+HandlerTable::HandlerTable(Tagged<BytecodeArray> bytecode_array)
+    : HandlerTable(bytecode_array->handler_table()) {}
 
-HandlerTable::HandlerTable(ByteArray byte_array)
-    : HandlerTable(reinterpret_cast<Address>(byte_array.GetDataStartAddress()),
-                   byte_array.length(), kRangeBasedEncoding) {}
+HandlerTable::HandlerTable(Tagged<ByteArray> byte_array)
+    : HandlerTable(reinterpret_cast<Address>(byte_array->GetDataStartAddress()),
+                   byte_array->length(), kRangeBasedEncoding) {}
 
 HandlerTable::HandlerTable(Address handler_table, int handler_table_size,
                            EncodingMode encoding_mode)
diff --git a/deps/v8/src/codegen/handler-table.h b/deps/v8/src/codegen/handler-table.h
index 7a4554796b4be8..55affff82faa1e 100644
--- a/deps/v8/src/codegen/handler-table.h
+++ b/deps/v8/src/codegen/handler-table.h
@@ -55,13 +55,13 @@ class V8_EXPORT_PRIVATE HandlerTable {
   enum EncodingMode { kRangeBasedEncoding, kReturnAddressBasedEncoding };
 
   // Constructors for the various encodings.
-  explicit HandlerTable(InstructionStream code);
-  explicit HandlerTable(Code code);
-  explicit HandlerTable(ByteArray byte_array);
+  explicit HandlerTable(Tagged<InstructionStream> code);
+  explicit HandlerTable(Tagged<Code> code);
+  explicit HandlerTable(Tagged<ByteArray> byte_array);
 #if V8_ENABLE_WEBASSEMBLY
   explicit HandlerTable(const wasm::WasmCode* code);
 #endif  // V8_ENABLE_WEBASSEMBLY
-  explicit HandlerTable(BytecodeArray bytecode_array);
+  explicit HandlerTable(Tagged<BytecodeArray> bytecode_array);
   HandlerTable(Address handler_table, int handler_table_size,
                EncodingMode encoding_mode);
 
diff --git a/deps/v8/src/codegen/ia32/assembler-ia32-inl.h b/deps/v8/src/codegen/ia32/assembler-ia32-inl.h
index d5040b8aa4d9cc..359489e858acff 100644
--- a/deps/v8/src/codegen/ia32/assembler-ia32-inl.h
+++ b/deps/v8/src/codegen/ia32/assembler-ia32-inl.h
@@ -80,7 +80,7 @@ Address RelocInfo::constant_pool_entry_address() { UNREACHABLE(); }
 
 int RelocInfo::target_address_size() { return Assembler::kSpecialTargetSize; }
 
-HeapObject RelocInfo::target_object(PtrComprCageBase cage_base) {
+Tagged<HeapObject> RelocInfo::target_object(PtrComprCageBase cage_base) {
   DCHECK(IsCodeTarget(rmode_) || IsFullEmbeddedObject(rmode_));
   return HeapObject::cast(Object(ReadUnalignedValue<Address>(pc_)));
 }
@@ -90,17 +90,13 @@ Handle<HeapObject> RelocInfo::target_object_handle(Assembler* origin) {
   return Handle<HeapObject>::cast(ReadUnalignedValue<Handle<Object>>(pc_));
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(Tagged<HeapObject> target,
                                   ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTarget(rmode_) || IsFullEmbeddedObject(rmode_));
   WriteUnalignedValue(pc_, target.ptr());
   if (icache_flush_mode != SKIP_ICACHE_FLUSH) {
     FlushInstructionCache(pc_, sizeof(Address));
   }
-  if (!instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target, write_barrier_mode);
-  }
 }
 
 Address RelocInfo::target_external_reference() {
@@ -224,9 +220,9 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool,
 }
 
 void Assembler::deserialization_set_special_target_at(
-    Address instruction_payload, Code code, Address target) {
+    Address instruction_payload, Tagged<Code> code, Address target) {
   set_target_address_at(instruction_payload,
-                        !code.is_null() ? code.constant_pool() : kNullAddress,
+                        !code.is_null() ? code->constant_pool() : kNullAddress,
                         target);
 }
 
@@ -250,11 +246,11 @@ void Assembler::emit_disp(Label* L, Displacement::Type type) {
 }
 
 void Assembler::emit_near_disp(Label* L) {
-  byte disp = 0x00;
+  uint8_t disp = 0x00;
   if (L->is_near_linked()) {
     int offset = L->near_link_pos() - pc_offset();
     DCHECK(is_int8(offset));
-    disp = static_cast<byte>(offset & 0xFF);
+    disp = static_cast<uint8_t>(offset & 0xFF);
   }
   L->link_to(pc_offset(), Label::kNear);
   *pc_++ = disp;
diff --git a/deps/v8/src/codegen/ia32/assembler-ia32.cc b/deps/v8/src/codegen/ia32/assembler-ia32.cc
index bb76c82a6f5c28..8f27ee024b2ace 100644
--- a/deps/v8/src/codegen/ia32/assembler-ia32.cc
+++ b/deps/v8/src/codegen/ia32/assembler-ia32.cc
@@ -285,7 +285,7 @@ Register Operand::reg() const {
 
 bool operator!=(Operand op, XMMRegister r) { return !op.is_reg(r); }
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Handle<HeapObject> object =
@@ -317,7 +317,10 @@ Assembler::Assembler(const AssemblerOptions& options,
   }
 }
 
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
+}
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
                         SafepointTableBuilder* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
@@ -363,17 +366,16 @@ void Assembler::FinalizeJumpOptimizationInfo() {
   // Collection stage
   auto jump_opt = jump_optimization_info();
   if (jump_opt && jump_opt->is_collecting()) {
-    auto& bitmap = jump_opt->farjmp_bitmap();
-    int num = static_cast<int>(farjmp_positions_.size());
-    if (num && bitmap.empty()) {
+    auto& dict = jump_opt->may_optimizable_farjmp;
+    int num = static_cast<int>(jump_opt->farjmps.size());
+    if (num && dict.empty()) {
       bool can_opt = false;
-
-      bitmap.resize((num + 31) / 32, 0);
       for (int i = 0; i < num; i++) {
-        int disp_pos = farjmp_positions_[i];
-        int disp = long_at(disp_pos);
+        auto jmp_info = jump_opt->farjmps[i];
+        int disp = long_at(jmp_info.pos + jmp_info.opcode_size);
         if (is_int8(disp)) {
-          bitmap[i / 32] |= 1 << (i & 31);
+          jmp_info.distance = disp;
+          dict[i] = jmp_info;
           can_opt = true;
         }
       }
@@ -392,7 +394,7 @@ void Assembler::Align(int m) {
 }
 
 bool Assembler::IsNop(Address addr) {
-  byte* a = reinterpret_cast<byte*>(addr);
+  uint8_t* a = reinterpret_cast<uint8_t*>(addr);
   while (*a == 0x66) a++;
   if (*a == 0x90) return true;
   if (a[0] == 0xF && a[1] == 0x1F) return true;
@@ -469,6 +471,10 @@ void Assembler::Nop(int bytes) {
 
 void Assembler::CodeTargetAlign() {
   Align(16);  // Preferred alignment of jump targets on ia32.
+  auto jump_opt = jump_optimization_info();
+  if (jump_opt && jump_opt->is_collecting()) {
+    jump_opt->align_pos_size[pc_offset()] = 16;
+  }
 }
 
 void Assembler::cpuid() {
@@ -1064,6 +1070,22 @@ void Assembler::lea(Register dst, Operand src) {
   emit_operand(dst, src);
 }
 
+void Assembler::lea(Register dst, Register src, Label* lbl) {
+  EnsureSpace ensure_space(this);
+  EMIT(0x8D);
+
+  // ModRM byte for dst,[src]+disp32.
+  EMIT(((0x2) << 6) | (dst.code() << 3) | src.code());
+
+  if (lbl->is_bound()) {
+    int offs = lbl->pos() - (pc_offset() + sizeof(int32_t));
+    DCHECK_LE(offs, 0);
+    emit(offs);
+  } else {
+    emit_disp(lbl, Displacement::OTHER);
+  }
+}
+
 void Assembler::mul(Register src) {
   EnsureSpace ensure_space(this);
   EMIT(0xF7);
@@ -1570,15 +1592,15 @@ void Assembler::bind_to(Label* L, int pos) {
   // Optimization stage
   auto jump_opt = jump_optimization_info();
   if (jump_opt && jump_opt->is_optimizing()) {
-    auto it = label_farjmp_maps_.find(L);
-    if (it != label_farjmp_maps_.end()) {
+    auto it = jump_opt->label_farjmp_maps.find(L);
+    if (it != jump_opt->label_farjmp_maps.end()) {
       auto& pos_vector = it->second;
       for (auto fixup_pos : pos_vector) {
         int disp = pos - (fixup_pos + sizeof(int8_t));
         CHECK(is_int8(disp));
         set_byte_at(fixup_pos, disp);
       }
-      label_farjmp_maps_.erase(it);
+      jump_opt->label_farjmp_maps.erase(it);
     }
   }
   L->bind_to(pos);
@@ -1591,7 +1613,7 @@ void Assembler::bind(Label* L) {
 }
 
 void Assembler::record_farjmp_position(Label* L, int pos) {
-  auto& pos_vector = label_farjmp_maps_[L];
+  auto& pos_vector = jump_optimization_info()->label_farjmp_maps[L];
   pos_vector.push_back(pos);
 }
 
@@ -1601,9 +1623,43 @@ bool Assembler::is_optimizable_farjmp(int idx) {
   auto jump_opt = jump_optimization_info();
   CHECK(jump_opt->is_optimizing());
 
-  auto& bitmap = jump_opt->farjmp_bitmap();
-  CHECK(idx < static_cast<int>(bitmap.size() * 32));
-  return !!(bitmap[idx / 32] & (1 << (idx & 31)));
+  auto& dict = jump_opt->may_optimizable_farjmp;
+  if (dict.find(idx) != dict.end()) {
+    auto record_jmp_info = dict[idx];
+
+    int record_pos = record_jmp_info.pos;
+
+    // 4 bytes for jmp rel32 operand.
+    const int operand_size = 4;
+    int record_dest = record_jmp_info.pos + record_jmp_info.opcode_size +
+                      operand_size + record_jmp_info.distance;
+
+    const int max_align_in_jmp_range =
+        jump_opt->MaxAlignInRange(record_pos, record_dest);
+
+    if (max_align_in_jmp_range == 0) {
+      return true;
+    }
+
+    // ja rel32 -> ja rel8, the opcode size 2bytes -> 1byte
+    // 0F 87 -> 77
+    const int saved_opcode_size = record_jmp_info.opcode_size - 1;
+
+    // jmp rel32 -> rel8, the operand size 4bytes -> 1byte
+    constexpr int saved_operand_size = 4 - 1;
+
+    // The shorter encoding may further decrease the base address of the
+    // relative jump, while the jump target could stay in place because of
+    // alignment.
+    int cur_jmp_length_max_increase =
+        (record_pos - pc_offset() + saved_opcode_size + saved_operand_size) %
+        max_align_in_jmp_range;
+
+    if (is_int8(record_jmp_info.distance + cur_jmp_length_max_increase)) {
+      return true;
+    }
+  }
+  return false;
 }
 
 void Assembler::call(Label* L) {
@@ -1678,14 +1734,15 @@ void Assembler::jmp(Label* L, Label::Distance distance) {
   } else {
     auto jump_opt = jump_optimization_info();
     if (V8_UNLIKELY(jump_opt)) {
-      if (jump_opt->is_optimizing() && is_optimizable_farjmp(farjmp_num_++)) {
+      if (jump_opt->is_optimizing() &&
+          is_optimizable_farjmp(jump_opt->farjmp_num++)) {
         EMIT(0xEB);
         record_farjmp_position(L, pc_offset());
         EMIT(0);
         return;
       }
       if (jump_opt->is_collecting()) {
-        farjmp_positions_.push_back(pc_offset() + 1);
+        jump_opt->farjmps.push_back({pc_offset(), 1, 0});
       }
     }
     // 1110 1001 #32-bit disp.
@@ -1742,7 +1799,8 @@ void Assembler::j(Condition cc, Label* L, Label::Distance distance) {
   } else {
     auto jump_opt = jump_optimization_info();
     if (V8_UNLIKELY(jump_opt)) {
-      if (jump_opt->is_optimizing() && is_optimizable_farjmp(farjmp_num_++)) {
+      if (jump_opt->is_optimizing() &&
+          is_optimizable_farjmp(jump_opt->farjmp_num++)) {
         // 0111 tttn #8-bit disp
         EMIT(0x70 | cc);
         record_farjmp_position(L, pc_offset());
@@ -1750,7 +1808,7 @@ void Assembler::j(Condition cc, Label* L, Label::Distance distance) {
         return;
       }
       if (jump_opt->is_collecting()) {
-        farjmp_positions_.push_back(pc_offset() + 2);
+        jump_opt->farjmps.push_back({pc_offset(), 2, 0});
       }
     }
     // 0000 1111 1000 tttn #32-bit disp
@@ -1762,7 +1820,7 @@ void Assembler::j(Condition cc, Label* L, Label::Distance distance) {
   }
 }
 
-void Assembler::j(Condition cc, byte* entry, RelocInfo::Mode rmode) {
+void Assembler::j(Condition cc, uint8_t* entry, RelocInfo::Mode rmode) {
   EnsureSpace ensure_space(this);
   DCHECK((0 <= cc) && (static_cast<int>(cc) < 16));
   // 0000 1111 1000 tttn #32-bit disp.
@@ -2246,7 +2304,7 @@ void Assembler::roundps(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   EMIT(0x08);
   emit_sse_operand(dst, src);
   // Mask precision exeption.
-  EMIT(static_cast<byte>(mode) | 0x8);
+  EMIT(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::roundpd(XMMRegister dst, XMMRegister src, RoundingMode mode) {
@@ -2258,7 +2316,7 @@ void Assembler::roundpd(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   EMIT(0x09);
   emit_sse_operand(dst, src);
   // Mask precision exeption.
-  EMIT(static_cast<byte>(mode) | 0x8);
+  EMIT(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::roundss(XMMRegister dst, XMMRegister src, RoundingMode mode) {
@@ -2270,7 +2328,7 @@ void Assembler::roundss(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   EMIT(0x0A);
   emit_sse_operand(dst, src);
   // Mask precision exeption.
-  EMIT(static_cast<byte>(mode) | 0x8);
+  EMIT(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::roundsd(XMMRegister dst, XMMRegister src, RoundingMode mode) {
@@ -2282,7 +2340,7 @@ void Assembler::roundsd(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   EMIT(0x0B);
   emit_sse_operand(dst, src);
   // Mask precision exeption.
-  EMIT(static_cast<byte>(mode) | 0x8);
+  EMIT(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::movmskpd(Register dst, XMMRegister src) {
@@ -2356,7 +2414,7 @@ void Assembler::movshdup(XMMRegister dst, XMMRegister src) {
   emit_sse_operand(dst, src);
 }
 
-void Assembler::shufps(XMMRegister dst, XMMRegister src, byte imm8) {
+void Assembler::shufps(XMMRegister dst, XMMRegister src, uint8_t imm8) {
   DCHECK(is_uint8(imm8));
   EnsureSpace ensure_space(this);
   EMIT(0x0F);
@@ -2365,7 +2423,7 @@ void Assembler::shufps(XMMRegister dst, XMMRegister src, byte imm8) {
   EMIT(imm8);
 }
 
-void Assembler::shufpd(XMMRegister dst, XMMRegister src, byte imm8) {
+void Assembler::shufpd(XMMRegister dst, XMMRegister src, uint8_t imm8) {
   DCHECK(is_uint8(imm8));
   EnsureSpace ensure_space(this);
   EMIT(0x66);
@@ -2523,7 +2581,7 @@ void Assembler::movd(Operand dst, XMMRegister src) {
   emit_sse_operand(src, dst);
 }
 
-void Assembler::extractps(Operand dst, XMMRegister src, byte imm8) {
+void Assembler::extractps(Operand dst, XMMRegister src, uint8_t imm8) {
   DCHECK(IsEnabled(SSE4_1));
   DCHECK(is_uint8(imm8));
   EnsureSpace ensure_space(this);
@@ -2535,7 +2593,7 @@ void Assembler::extractps(Operand dst, XMMRegister src, byte imm8) {
   EMIT(imm8);
 }
 
-void Assembler::extractps(Register dst, XMMRegister src, byte imm8) {
+void Assembler::extractps(Register dst, XMMRegister src, uint8_t imm8) {
   DCHECK(IsEnabled(SSE4_1));
   DCHECK(is_uint8(imm8));
   EnsureSpace ensure_space(this);
@@ -2818,7 +2876,7 @@ void Assembler::minss(XMMRegister dst, Operand src) {
 }
 
 // Packed single-precision floating-point SSE instructions.
-void Assembler::ps(byte opcode, XMMRegister dst, Operand src) {
+void Assembler::ps(uint8_t opcode, XMMRegister dst, Operand src) {
   EnsureSpace ensure_space(this);
   EMIT(0x0F);
   EMIT(opcode);
@@ -2826,7 +2884,7 @@ void Assembler::ps(byte opcode, XMMRegister dst, Operand src) {
 }
 
 // Packed double-precision floating-point SSE instructions.
-void Assembler::pd(byte opcode, XMMRegister dst, Operand src) {
+void Assembler::pd(uint8_t opcode, XMMRegister dst, Operand src) {
   EnsureSpace ensure_space(this);
   EMIT(0x66);
   EMIT(0x0F);
@@ -2836,20 +2894,23 @@ void Assembler::pd(byte opcode, XMMRegister dst, Operand src) {
 
 // AVX instructions
 
-void Assembler::vss(byte op, XMMRegister dst, XMMRegister src1, Operand src2) {
+void Assembler::vss(uint8_t op, XMMRegister dst, XMMRegister src1,
+                    Operand src2) {
   vinstr(op, dst, src1, src2, kF3, k0F, kWIG);
 }
 
-void Assembler::vps(byte op, XMMRegister dst, XMMRegister src1, Operand src2) {
+void Assembler::vps(uint8_t op, XMMRegister dst, XMMRegister src1,
+                    Operand src2) {
   vinstr(op, dst, src1, src2, kNoPrefix, k0F, kWIG);
 }
 
-void Assembler::vpd(byte op, XMMRegister dst, XMMRegister src1, Operand src2) {
+void Assembler::vpd(uint8_t op, XMMRegister dst, XMMRegister src1,
+                    Operand src2) {
   vinstr(op, dst, src1, src2, k66, k0F, kWIG);
 }
 
 void Assembler::vshufpd(XMMRegister dst, XMMRegister src1, Operand src2,
-                        byte imm8) {
+                        uint8_t imm8) {
   DCHECK(is_uint8(imm8));
   vpd(0xC6, dst, src1, src2);
   EMIT(imm8);
@@ -2892,7 +2953,7 @@ void Assembler::vcmppd(XMMRegister dst, XMMRegister src1, Operand src2,
 }
 
 void Assembler::vshufps(XMMRegister dst, XMMRegister src1, Operand src2,
-                        byte imm8) {
+                        uint8_t imm8) {
   DCHECK(is_uint8(imm8));
   vps(0xC6, dst, src1, src2);
   EMIT(imm8);
@@ -3033,20 +3094,20 @@ void Assembler::vpinsrd(XMMRegister dst, XMMRegister src1, Operand src2,
 void Assembler::vroundsd(XMMRegister dst, XMMRegister src1, XMMRegister src2,
                          RoundingMode mode) {
   vinstr(0x0b, dst, src1, src2, k66, k0F3A, kWIG);
-  EMIT(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+  EMIT(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
 }
 void Assembler::vroundss(XMMRegister dst, XMMRegister src1, XMMRegister src2,
                          RoundingMode mode) {
   vinstr(0x0a, dst, src1, src2, k66, k0F3A, kWIG);
-  EMIT(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+  EMIT(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
 }
 void Assembler::vroundps(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   vinstr(0x08, dst, xmm0, Operand(src), k66, k0F3A, kWIG);
-  EMIT(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+  EMIT(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
 }
 void Assembler::vroundpd(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   vinstr(0x09, dst, xmm0, Operand(src), k66, k0F3A, kWIG);
-  EMIT(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+  EMIT(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
 }
 
 void Assembler::vmovmskpd(Register dst, XMMRegister src) {
@@ -3073,7 +3134,7 @@ void Assembler::vpmovmskb(Register dst, XMMRegister src) {
   emit_sse_operand(dst, src);
 }
 
-void Assembler::vextractps(Operand dst, XMMRegister src, byte imm8) {
+void Assembler::vextractps(Operand dst, XMMRegister src, uint8_t imm8) {
   vinstr(0x17, src, xmm0, dst, k66, k0F3A, VexW::kWIG);
   EMIT(imm8);
 }
@@ -3082,7 +3143,7 @@ void Assembler::vpcmpgtq(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
   vinstr(0x37, dst, src1, src2, k66, k0F38, VexW::kWIG);
 }
 
-void Assembler::bmi1(byte op, Register reg, Register vreg, Operand rm) {
+void Assembler::bmi1(uint8_t op, Register reg, Register vreg, Operand rm) {
   DCHECK(IsEnabled(BMI1));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(vreg, kLZ, kNoPrefix, k0F38, kW0);
@@ -3117,7 +3178,7 @@ void Assembler::popcnt(Register dst, Operand src) {
   emit_operand(dst, src);
 }
 
-void Assembler::bmi2(SIMDPrefix pp, byte op, Register reg, Register vreg,
+void Assembler::bmi2(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
                      Operand rm) {
   DCHECK(IsEnabled(BMI2));
   EnsureSpace ensure_space(this);
@@ -3126,7 +3187,7 @@ void Assembler::bmi2(SIMDPrefix pp, byte op, Register reg, Register vreg,
   emit_operand(reg, rm);
 }
 
-void Assembler::rorx(Register dst, Operand src, byte imm8) {
+void Assembler::rorx(Register dst, Operand src, uint8_t imm8) {
   DCHECK(IsEnabled(BMI2));
   DCHECK(is_uint8(imm8));
   Register vreg = Register::from_code(0);  // VEX.vvvv unused
@@ -3137,16 +3198,16 @@ void Assembler::rorx(Register dst, Operand src, byte imm8) {
   EMIT(imm8);
 }
 
-void Assembler::sse_instr(XMMRegister dst, Operand src, byte escape,
-                          byte opcode) {
+void Assembler::sse_instr(XMMRegister dst, Operand src, uint8_t escape,
+                          uint8_t opcode) {
   EnsureSpace ensure_space(this);
   EMIT(escape);
   EMIT(opcode);
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse2_instr(XMMRegister dst, Operand src, byte prefix,
-                           byte escape, byte opcode) {
+void Assembler::sse2_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                           uint8_t escape, uint8_t opcode) {
   EnsureSpace ensure_space(this);
   EMIT(prefix);
   EMIT(escape);
@@ -3154,8 +3215,8 @@ void Assembler::sse2_instr(XMMRegister dst, Operand src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::ssse3_instr(XMMRegister dst, Operand src, byte prefix,
-                            byte escape1, byte escape2, byte opcode) {
+void Assembler::ssse3_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                            uint8_t escape1, uint8_t escape2, uint8_t opcode) {
   DCHECK(IsEnabled(SSSE3));
   EnsureSpace ensure_space(this);
   EMIT(prefix);
@@ -3165,8 +3226,8 @@ void Assembler::ssse3_instr(XMMRegister dst, Operand src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse4_instr(XMMRegister dst, Operand src, byte prefix,
-                           byte escape1, byte escape2, byte opcode) {
+void Assembler::sse4_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                           uint8_t escape1, uint8_t escape2, uint8_t opcode) {
   DCHECK(IsEnabled(SSE4_1));
   EnsureSpace ensure_space(this);
   EMIT(prefix);
@@ -3176,19 +3237,19 @@ void Assembler::sse4_instr(XMMRegister dst, Operand src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1,
+void Assembler::vinstr(uint8_t op, XMMRegister dst, XMMRegister src1,
                        XMMRegister src2, SIMDPrefix pp, LeadingOpcode m, VexW w,
                        CpuFeature feature) {
   vinstr(op, dst, src1, src2, kL128, pp, m, w, feature);
 }
 
-void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
-                       SIMDPrefix pp, LeadingOpcode m, VexW w,
+void Assembler::vinstr(uint8_t op, XMMRegister dst, XMMRegister src1,
+                       Operand src2, SIMDPrefix pp, LeadingOpcode m, VexW w,
                        CpuFeature feature) {
   vinstr(op, dst, src1, src2, kL128, pp, m, w, feature);
 }
 
-void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1,
+void Assembler::vinstr(uint8_t op, XMMRegister dst, XMMRegister src1,
                        XMMRegister src2, VectorLength l, SIMDPrefix pp,
                        LeadingOpcode m, VexW w, CpuFeature feature) {
   DCHECK(IsEnabled(feature));
@@ -3198,9 +3259,9 @@ void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1,
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
-                       VectorLength l, SIMDPrefix pp, LeadingOpcode m, VexW w,
-                       CpuFeature feature) {
+void Assembler::vinstr(uint8_t op, XMMRegister dst, XMMRegister src1,
+                       Operand src2, VectorLength l, SIMDPrefix pp,
+                       LeadingOpcode m, VexW w, CpuFeature feature) {
   DCHECK(IsEnabled(feature));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(src1, l, pp, m, w);
@@ -3261,7 +3322,7 @@ void Assembler::GrowBuffer() {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   intptr_t pc_delta = new_start - buffer_start_;
@@ -3287,9 +3348,9 @@ void Assembler::GrowBuffer() {
   // Relocate pc-relative references.
   int mode_mask = RelocInfo::ModeMask(RelocInfo::OFF_HEAP_TARGET);
   DCHECK_EQ(mode_mask, RelocInfo::kApplyMask & mode_mask);
-  base::Vector<byte> instructions{buffer_start_,
-                                  static_cast<size_t>(pc_offset())};
-  base::Vector<const byte> reloc_info{reloc_info_writer.pos(), reloc_size};
+  base::Vector<uint8_t> instructions{buffer_start_,
+                                     static_cast<size_t>(pc_offset())};
+  base::Vector<const uint8_t> reloc_info{reloc_info_writer.pos(), reloc_size};
   for (RelocIterator it(instructions, reloc_info, 0, mode_mask); !it.done();
        it.next()) {
     it.rinfo()->apply(pc_delta);
@@ -3384,18 +3445,13 @@ void Assembler::db(uint8_t data) {
   EMIT(data);
 }
 
-void Assembler::dd(uint32_t data, RelocInfo::Mode rmode) {
+void Assembler::dd(uint32_t data) {
   EnsureSpace ensure_space(this);
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   emit(data);
 }
 
-void Assembler::dq(uint64_t data, RelocInfo::Mode rmode) {
+void Assembler::dq(uint64_t data) {
   EnsureSpace ensure_space(this);
-  DCHECK(RelocInfo::IsNoInfo(rmode));
   emit_q(data);
 }
 
@@ -3407,8 +3463,7 @@ void Assembler::dd(Label* label) {
 
 void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data) {
   if (!ShouldRecordRelocInfo(rmode)) return;
-  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data, Code(),
-                  InstructionStream());
+  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data);
   reloc_info_writer.Write(&rinfo);
 }
 
diff --git a/deps/v8/src/codegen/ia32/assembler-ia32.h b/deps/v8/src/codegen/ia32/assembler-ia32.h
index 54cbbf6886d932..ad0813058fa9f7 100644
--- a/deps/v8/src/codegen/ia32/assembler-ia32.h
+++ b/deps/v8/src/codegen/ia32/assembler-ia32.h
@@ -124,7 +124,7 @@ class Immediate {
       : Immediate(ext.address(), RelocInfo::EXTERNAL_REFERENCE) {}
   inline explicit Immediate(Handle<HeapObject> handle)
       : Immediate(handle.address(), RelocInfo::FULL_EMBEDDED_OBJECT) {}
-  inline explicit Immediate(Smi value)
+  inline explicit Immediate(Tagged<Smi> value)
       : Immediate(static_cast<intptr_t>(value.ptr())) {}
 
   static Immediate EmbeddedNumber(double number);  // Smi or HeapNumber.
@@ -247,7 +247,7 @@ class V8_EXPORT_PRIVATE Operand {
   explicit Operand(Register base, int32_t disp,
                    RelocInfo::Mode rmode = RelocInfo::NO_INFO);
 
-  // [rip + disp/r]
+  // [disp/r]
   explicit Operand(Label* label) {
     set_modrm(0, ebp);
     set_dispr(reinterpret_cast<intptr_t>(label), RelocInfo::INTERNAL_REFERENCE);
@@ -281,7 +281,7 @@ class V8_EXPORT_PRIVATE Operand {
   // register.
   Register reg() const;
 
-  base::Vector<const byte> encoded_bytes() const { return {buf_, len_}; }
+  base::Vector<const uint8_t> encoded_bytes() const { return {buf_, len_}; }
   RelocInfo::Mode rmode() { return rmode_; }
 
  private:
@@ -308,7 +308,7 @@ class V8_EXPORT_PRIVATE Operand {
            && ((buf_[0] & 0x07) == reg_code);  // register codes match.
   }
 
-  byte buf_[6];
+  uint8_t buf_[6];
   // The number of bytes in buf_.
   uint8_t len_ = 0;
   // Only valid if len_ > 4.
@@ -397,12 +397,14 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // GetCode emits any pending (non-emitted) code and fills the descriptor desc.
   static constexpr int kNoHandlerTable = 0;
   static constexpr SafepointTableBuilder* kNoSafepointTable = nullptr;
-  void GetCode(Isolate* isolate, CodeDesc* desc,
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
                SafepointTableBuilder* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -421,7 +423,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // This sets the branch destination (which is in the instruction on x86).
   // This is for calls and branches within generated code.
   inline static void deserialization_set_special_target_at(
-      Address instruction_payload, Code code, Address target);
+      Address instruction_payload, Tagged<Code> code, Address target);
 
   // Get the size of the special target encoded at 'instruction_payload'.
   inline static int deserialization_special_target_size(
@@ -435,18 +437,18 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   static constexpr int kSpecialTargetSize = kSystemPointerSize;
 
   // One byte opcode for test al, 0xXX.
-  static constexpr byte kTestAlByte = 0xA8;
+  static constexpr uint8_t kTestAlByte = 0xA8;
   // One byte opcode for nop.
-  static constexpr byte kNopByte = 0x90;
+  static constexpr uint8_t kNopByte = 0x90;
 
   // One byte opcode for a short unconditional jump.
-  static constexpr byte kJmpShortOpcode = 0xEB;
+  static constexpr uint8_t kJmpShortOpcode = 0xEB;
   // One byte prefix for a short conditional jump.
-  static constexpr byte kJccShortPrefix = 0x70;
-  static constexpr byte kJncShortOpcode = kJccShortPrefix | not_carry;
-  static constexpr byte kJcShortOpcode = kJccShortPrefix | carry;
-  static constexpr byte kJnzShortOpcode = kJccShortPrefix | not_zero;
-  static constexpr byte kJzShortOpcode = kJccShortPrefix | zero;
+  static constexpr uint8_t kJccShortPrefix = 0x70;
+  static constexpr uint8_t kJncShortOpcode = kJccShortPrefix | not_carry;
+  static constexpr uint8_t kJcShortOpcode = kJccShortPrefix | carry;
+  static constexpr uint8_t kJnzShortOpcode = kJccShortPrefix | not_zero;
+  static constexpr uint8_t kJzShortOpcode = kJccShortPrefix | zero;
 
   // ---------------------------------------------------------------------------
   // InstructionStream generation
@@ -640,6 +642,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void inc(Operand dst);
 
   void lea(Register dst, Operand src);
+  void lea(Register dst, Register src, Label* lbl);
 
   // Unsigned multiply instruction.
   void mul(Register src);  // edx:eax = eax * reg.
@@ -778,7 +781,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   // Conditional jumps
   void j(Condition cc, Label* L, Label::Distance distance = Label::kFar);
-  void j(Condition cc, byte* entry, RelocInfo::Mode rmode);
+  void j(Condition cc, uint8_t* entry, RelocInfo::Mode rmode);
   void j(Condition cc, Handle<Code> code,
          RelocInfo::Mode rmode = RelocInfo::CODE_TARGET);
 
@@ -880,8 +883,8 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void movups(XMMRegister dst, XMMRegister src) { movups(dst, Operand(src)); }
   void movups(XMMRegister dst, Operand src);
   void movups(Operand dst, XMMRegister src);
-  void shufps(XMMRegister dst, XMMRegister src, byte imm8);
-  void shufpd(XMMRegister dst, XMMRegister src, byte imm8);
+  void shufps(XMMRegister dst, XMMRegister src, uint8_t imm8);
+  void shufpd(XMMRegister dst, XMMRegister src, uint8_t imm8);
 
   void movhlps(XMMRegister dst, XMMRegister src);
   void movlhps(XMMRegister dst, XMMRegister src);
@@ -1006,8 +1009,8 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void movss(Operand dst, XMMRegister src);
   void movss(XMMRegister dst, XMMRegister src) { movss(dst, Operand(src)); }
 
-  void extractps(Operand dst, XMMRegister src, byte imm8);
-  void extractps(Register dst, XMMRegister src, byte imm8);
+  void extractps(Operand dst, XMMRegister src, uint8_t imm8);
+  void extractps(Register dst, XMMRegister src, uint8_t imm8);
 
   void pcmpgtq(XMMRegister dst, XMMRegister src);
 
@@ -1125,7 +1128,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void vsqrtss(XMMRegister dst, XMMRegister src1, Operand src2) {
     vss(0x51, dst, src1, src2);
   }
-  void vss(byte op, XMMRegister dst, XMMRegister src1, Operand src2);
+  void vss(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2);
 
   void vhaddps(XMMRegister dst, XMMRegister src1, XMMRegister src2) {
     vhaddps(dst, src1, Operand(src2));
@@ -1156,7 +1159,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
     vinstr(0x10, dst, xmm0, src, kF2, k0F, kWIG);
   }
 
-  void vextractps(Operand dst, XMMRegister src, byte imm8);
+  void vextractps(Operand dst, XMMRegister src, uint8_t imm8);
 
   void vpcmpgtq(XMMRegister dst, XMMRegister src1, XMMRegister src2);
 
@@ -1168,14 +1171,16 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void vmovups(XMMRegister dst, XMMRegister src) { vmovups(dst, Operand(src)); }
   void vmovups(XMMRegister dst, Operand src) { vps(0x10, dst, xmm0, src); }
   void vmovupd(XMMRegister dst, Operand src) { vpd(0x10, dst, xmm0, src); }
-  void vshufps(XMMRegister dst, XMMRegister src1, XMMRegister src2, byte imm8) {
+  void vshufps(XMMRegister dst, XMMRegister src1, XMMRegister src2,
+               uint8_t imm8) {
     vshufps(dst, src1, Operand(src2), imm8);
   }
-  void vshufps(XMMRegister dst, XMMRegister src1, Operand src2, byte imm8);
-  void vshufpd(XMMRegister dst, XMMRegister src1, XMMRegister src2, byte imm8) {
+  void vshufps(XMMRegister dst, XMMRegister src1, Operand src2, uint8_t imm8);
+  void vshufpd(XMMRegister dst, XMMRegister src1, XMMRegister src2,
+               uint8_t imm8) {
     vshufpd(dst, src1, Operand(src2), imm8);
   }
-  void vshufpd(XMMRegister dst, XMMRegister src1, Operand src2, byte imm8);
+  void vshufpd(XMMRegister dst, XMMRegister src1, Operand src2, uint8_t imm8);
 
   void vmovhlps(XMMRegister dst, XMMRegister src1, XMMRegister src2);
   void vmovlhps(XMMRegister dst, XMMRegister src1, XMMRegister src2);
@@ -1429,15 +1434,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void shrx(Register dst, Operand src1, Register src2) {
     bmi2(kF2, 0xf7, dst, src2, src1);
   }
-  void rorx(Register dst, Register src, byte imm8) {
+  void rorx(Register dst, Register src, uint8_t imm8) {
     rorx(dst, Operand(src), imm8);
   }
-  void rorx(Register dst, Operand src, byte imm8);
+  void rorx(Register dst, Operand src, uint8_t imm8);
 
   // Implementation of packed single-precision floating-point SSE instructions.
-  void ps(byte op, XMMRegister dst, Operand src);
+  void ps(uint8_t op, XMMRegister dst, Operand src);
   // Implementation of packed double-precision floating-point SSE instructions.
-  void pd(byte op, XMMRegister dst, Operand src);
+  void pd(uint8_t op, XMMRegister dst, Operand src);
 
 #define PACKED_OP_LIST(V) \
   V(unpckl, 0x14)         \
@@ -1483,8 +1488,8 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 #undef AVX_PACKED_OP_DECLARE
 #undef PACKED_OP_LIST
 
-  void vps(byte op, XMMRegister dst, XMMRegister src1, Operand src2);
-  void vpd(byte op, XMMRegister dst, XMMRegister src1, Operand src2);
+  void vps(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2);
+  void vpd(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2);
 
   void vcmpps(XMMRegister dst, XMMRegister src1, Operand src2, uint8_t cmp);
   void vcmppd(XMMRegister dst, XMMRegister src1, Operand src2, uint8_t cmp);
@@ -1650,11 +1655,9 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Writes a single byte or word of data in the code stream.  Used for
   // inline tables, e.g., jump-tables.
   void db(uint8_t data);
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
-    dd(data, rmode);
-  }
+  void dd(uint32_t data);
+  void dq(uint64_t data);
+  void dp(uintptr_t data) { dd(data); }
   void dd(Label* label);
 
   // Check if there is less than kGap bytes available in the buffer.
@@ -1676,8 +1679,8 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Avoid overflows for displacements etc.
   static constexpr int kMaximalBufferSize = 512 * MB;
 
-  byte byte_at(int pos) { return buffer_start_[pos]; }
-  void set_byte_at(int pos, byte value) { buffer_start_[pos] = value; }
+  uint8_t byte_at(int pos) { return buffer_start_[pos]; }
+  void set_byte_at(int pos, uint8_t value) { buffer_start_[pos] = value; }
 
  protected:
   void emit_sse_operand(XMMRegister reg, Operand adr);
@@ -1750,29 +1753,30 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   inline void emit_disp(Label* L, Displacement::Type type);
   inline void emit_near_disp(Label* L);
 
-  void sse_instr(XMMRegister dst, Operand src, byte prefix, byte opcode);
-  void sse2_instr(XMMRegister dst, Operand src, byte prefix, byte escape,
-                  byte opcode);
-  void ssse3_instr(XMMRegister dst, Operand src, byte prefix, byte escape1,
-                   byte escape2, byte opcode);
-  void sse4_instr(XMMRegister dst, Operand src, byte prefix, byte escape1,
-                  byte escape2, byte opcode);
-  void vinstr(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+  void sse_instr(XMMRegister dst, Operand src, uint8_t prefix, uint8_t opcode);
+  void sse2_instr(XMMRegister dst, Operand src, uint8_t prefix, uint8_t escape,
+                  uint8_t opcode);
+  void ssse3_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                   uint8_t escape1, uint8_t escape2, uint8_t opcode);
+  void sse4_instr(XMMRegister dst, Operand src, uint8_t prefix, uint8_t escape1,
+                  uint8_t escape2, uint8_t opcode);
+  void vinstr(uint8_t op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
               SIMDPrefix pp, LeadingOpcode m, VexW w, CpuFeature = AVX);
-  void vinstr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
+  void vinstr(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2,
               SIMDPrefix pp, LeadingOpcode m, VexW w, CpuFeature = AVX);
-  void vinstr(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+  void vinstr(uint8_t op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
               VectorLength l, SIMDPrefix pp, LeadingOpcode m, VexW w,
               CpuFeature = AVX);
-  void vinstr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
+  void vinstr(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2,
               VectorLength l, SIMDPrefix pp, LeadingOpcode m, VexW w,
               CpuFeature = AVX);
   // Most BMI instructions are similar.
-  void bmi1(byte op, Register reg, Register vreg, Operand rm);
-  void bmi2(SIMDPrefix pp, byte op, Register reg, Register vreg, Operand rm);
-  void fma_instr(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
-                 VectorLength l, SIMDPrefix pp, LeadingOpcode m, VexW w);
-  void fma_instr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
+  void bmi1(uint8_t op, Register reg, Register vreg, Operand rm);
+  void bmi2(SIMDPrefix pp, uint8_t op, Register reg, Register vreg, Operand rm);
+  void fma_instr(uint8_t op, XMMRegister dst, XMMRegister src1,
+                 XMMRegister src2, VectorLength l, SIMDPrefix pp,
+                 LeadingOpcode m, VexW w);
+  void fma_instr(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2,
                  VectorLength l, SIMDPrefix pp, LeadingOpcode m, VexW w);
 
   // record reloc info for current pc_
@@ -1783,7 +1787,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   bool is_optimizable_farjmp(int idx);
 
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
@@ -1796,11 +1800,6 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   // code generation
   RelocInfoWriter reloc_info_writer;
-
-  // Variables for this instance of assembler
-  int farjmp_num_ = 0;
-  std::deque<int> farjmp_positions_;
-  std::map<Label*, std::vector<int>> label_farjmp_maps_;
 };
 
 // Helper class that ensures that there is enough space for generating
diff --git a/deps/v8/src/codegen/ia32/interface-descriptors-ia32-inl.h b/deps/v8/src/codegen/ia32/interface-descriptors-ia32-inl.h
index d3f6101f4ea4e8..01688a44fff53f 100644
--- a/deps/v8/src/codegen/ia32/interface-descriptors-ia32-inl.h
+++ b/deps/v8/src/codegen/ia32/interface-descriptors-ia32-inl.h
@@ -18,6 +18,24 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  // xmm0 isn't allocatable.
+  auto registers = DoubleRegisterArray(xmm1, xmm2, xmm3, xmm4, xmm5, xmm6);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Padding to have as many double return registers as GP return registers.
+  auto registers = DoubleRegisterArray(kFPReturnRegister0, no_dreg, no_dreg);
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -261,11 +279,36 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  return RegisterArray(edx,   // kApiFunctionAddress
-                       ecx,   // kArgc
-                       eax,   // kCallData
-                       edi);  // kHolder
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return eax;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return ecx;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return edx;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return edi;
+}
+
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return ecx;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return edx;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return edi;
 }
 
 // static
@@ -299,41 +342,10 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray();
 }
 
-// static
-constexpr auto WasmFloat32ToNumberDescriptor::registers() {
-  // Work around using eax, whose register code is 0, and leads to the FP
-  // parameter being passed via xmm0, which is not allocatable on ia32.
-  return RegisterArray(ecx);
-}
-
-// static
-constexpr auto WasmFloat64ToNumberDescriptor::registers() {
-  // Work around using eax, whose register code is 0, and leads to the FP
-  // parameter being passed via xmm0, which is not allocatable on ia32.
-  return RegisterArray(ecx);
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(edi);
 }
-
-// static
-constexpr auto NewHeapNumberDescriptor::registers() {
-  // Work around using eax, whose register code is 0, and leads to the FP
-  // parameter being passed via xmm0, which is not allocatable on ia32.
-  return RegisterArray(ecx);
-}
-
-// static
-constexpr auto CheckTurboshaftFloat32TypeDescriptor::registers() {
-  // Work around using eax, whose register code is 0, and leads to the FP
-  // parameter being passed via xmm0, which is not allocatable on ia32.
-  return RegisterArray(ecx);
-}
-
-// static
-constexpr auto CheckTurboshaftFloat64TypeDescriptor::registers() {
-  // Work around using eax, whose register code is 0, and leads to the FP
-  // parameter being passed via xmm0, which is not allocatable on ia32.
-  return RegisterArray(ecx);
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/ia32/macro-assembler-ia32.cc b/deps/v8/src/codegen/ia32/macro-assembler-ia32.cc
index 77d07785f5e5d5..20f16ac2014e8a 100644
--- a/deps/v8/src/codegen/ia32/macro-assembler-ia32.cc
+++ b/deps/v8/src/codegen/ia32/macro-assembler-ia32.cc
@@ -97,11 +97,11 @@ void MacroAssembler::LoadRoot(Register destination, RootIndex index) {
 
   if (RootsTable::IsImmortalImmovable(index)) {
     Handle<Object> object = isolate()->root_handle(index);
-    if (object->IsSmi()) {
+    if (IsSmi(*object)) {
       mov(destination, Immediate(Smi::cast(*object)));
       return;
     } else {
-      DCHECK(object->IsHeapObject());
+      DCHECK(IsHeapObject(*object));
       mov(destination, Handle<HeapObject>::cast(object));
       return;
     }
@@ -135,7 +135,7 @@ void MacroAssembler::CompareRoot(Register with, RootIndex index) {
 
   DCHECK(RootsTable::IsImmortalImmovable(index));
   Handle<Object> object = isolate()->root_handle(index);
-  if (object->IsHeapObject()) {
+  if (IsHeapObject(*object)) {
     cmp(with, Handle<HeapObject>::cast(object));
   } else {
     cmp(with, Immediate(Smi::cast(*object)));
@@ -153,7 +153,7 @@ void MacroAssembler::PushRoot(RootIndex index) {
   // TODO(v8:6666): Add a scratch register or remove all uses.
   DCHECK(RootsTable::IsImmortalImmovable(index));
   Handle<Object> object = isolate()->root_handle(index);
-  if (object->IsHeapObject()) {
+  if (IsHeapObject(*object)) {
     Push(Handle<HeapObject>::cast(object));
   } else {
     Push(Smi::cast(*object));
@@ -707,7 +707,7 @@ void MacroAssembler::CmpInstanceTypeRange(Register map,
 }
 
 void MacroAssembler::TestCodeIsMarkedForDeoptimization(Register code) {
-  test(FieldOperand(code, Code::kKindSpecificFlagsOffset),
+  test(FieldOperand(code, Code::kFlagsOffset),
        Immediate(1 << Code::kMarkedForDeoptimizationBit));
 }
 
@@ -750,7 +750,7 @@ void TailCallOptimizedCodeSlot(MacroAssembler* masm,
                                          ecx);
   static_assert(kJavaScriptCallCodeStartRegister == ecx, "ABI mismatch");
   __ Pop(optimized_code_entry);
-  __ LoadCodeEntry(ecx, optimized_code_entry);
+  __ LoadCodeInstructionStart(ecx, optimized_code_entry);
   __ Pop(edx);
   __ Pop(eax);
   __ jmp(ecx);
@@ -979,6 +979,47 @@ void MacroAssembler::AssertNotSmi(Register object) {
   }
 }
 
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok, Label::kNear);
+
+  mov(map_tmp, FieldOperand(object, HeapObject::kMapOffset));
+
+  CmpInstanceType(map_tmp, LAST_NAME_TYPE);
+  j(below_equal, &ok, Label::kNear);
+
+  CmpInstanceType(map_tmp, FIRST_JS_RECEIVER_TYPE);
+  j(above_equal, &ok, Label::kNear);
+
+  CompareRoot(map_tmp, RootIndex::kHeapNumberMap);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(map_tmp, RootIndex::kBigIntMap);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(object, RootIndex::kUndefinedValue);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(object, RootIndex::kTrueValue);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(object, RootIndex::kFalseValue);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(object, RootIndex::kNullValue);
+  j(equal, &ok, Label::kNear);
+
+  Abort(abort_reason);
+
+  bind(&ok);
+}
+
 void MacroAssembler::Assert(Condition cc, AbortReason reason) {
   if (v8_flags.debug_code) Check(cc, reason);
 }
@@ -1126,11 +1167,13 @@ void MacroAssembler::AllocateStackSpace(int bytes) {
 }
 #endif
 
-void MacroAssembler::EnterExitFrame(int argc, StackFrame::Type frame_type,
-                                    Register scratch) {
+void MacroAssembler::EnterExitFrame(int extra_slots,
+                                    StackFrame::Type frame_type,
+                                    Register c_function) {
   ASM_CODE_COMMENT(this);
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
 
   // Set up the frame structure on the stack.
   DCHECK_EQ(+2 * kSystemPointerSize, ExitFrameConstants::kCallerSPDisplacement);
@@ -1144,18 +1187,17 @@ void MacroAssembler::EnterExitFrame(int argc, StackFrame::Type frame_type,
   push(Immediate(0));  // Saved entry sp, patched below.
 
   // Save the frame pointer and the context in top.
-  DCHECK(!AreAliased(scratch, ebp, esi, edx));
+  DCHECK(!AreAliased(ebp, kContextRegister, c_function));
   using ER = ExternalReference;
   ER r0 = ER::Create(IsolateAddressId::kCEntryFPAddress, isolate());
-  mov(ExternalReferenceAsOperand(r0, scratch), ebp);
-  static_assert(esi == kContextRegister);
+  mov(ExternalReferenceAsOperand(r0, no_reg), ebp);
   ER r1 = ER::Create(IsolateAddressId::kContextAddress, isolate());
-  mov(ExternalReferenceAsOperand(r1, scratch), esi);
+  mov(ExternalReferenceAsOperand(r1, no_reg), kContextRegister);
   static_assert(edx == kRuntimeCallFunctionRegister);
   ER r2 = ER::Create(IsolateAddressId::kCFunctionAddress, isolate());
-  mov(ExternalReferenceAsOperand(r2, scratch), edx);
+  mov(ExternalReferenceAsOperand(r2, no_reg), c_function);
 
-  AllocateStackSpace(argc * kSystemPointerSize);
+  AllocateStackSpace(extra_slots * kSystemPointerSize);
 
   // Get the required frame alignment for the OS.
   const int kFrameAlignment = base::OS::ActivationFrameAlignment();
@@ -1395,8 +1437,21 @@ void MacroAssembler::CallDebugOnFunctionCall(Register fun, Register new_target,
                                              Register expected_parameter_count,
                                              Register actual_parameter_count) {
   ASM_CODE_COMMENT(this);
+
+  // We have no available register. So we spill the root register (ebx) and
+  // recover it later.
+  movd(xmm0, kRootRegister);
+
+  // Load receiver to pass it later to DebugOnFunctionCall hook.
+  // Receiver is located on top of the stack if we have a frame (usually a
+  // construct frame), or after the return address if we do not yet have a
+  // frame.
+  Register receiver = kRootRegister;
+  mov(receiver, Operand(esp, has_frame() ? 0 : kSystemPointerSize));
+
   FrameScope frame(
       this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
+
   SmiTag(expected_parameter_count);
   Push(expected_parameter_count);
 
@@ -1409,9 +1464,11 @@ void MacroAssembler::CallDebugOnFunctionCall(Register fun, Register new_target,
   }
   Push(fun);
   Push(fun);
-  // Arguments are located 2 words below the base pointer.
-  Operand receiver_op = Operand(ebp, kSystemPointerSize * 2);
-  Push(receiver_op);
+  Push(receiver);
+
+  // Recover root register.
+  movd(kRootRegister, xmm0);
+
   CallRuntime(Runtime::kDebugOnFunctionCall);
   Pop(fun);
   if (new_target.is_valid()) {
@@ -1458,14 +1515,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // We call indirectly through the code field in the function to
   // allow recompilation to take effect without changing any of the
   // call sites.
-  static_assert(kJavaScriptCallCodeStartRegister == ecx, "ABI mismatch");
-  mov(ecx, FieldOperand(function, JSFunction::kCodeOffset));
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(ecx);
+      CallJSFunction(function);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(ecx);
+      JumpJSFunction(function);
       break;
   }
   jmp(&done, Label::kNear);
@@ -1914,6 +1969,8 @@ void MacroAssembler::CallCFunction(Register function, int num_arguments,
 void MacroAssembler::PushPC() {
   // Push the current PC onto the stack as "return address" via calling
   // the next instruction.
+  // This does not pollute the RAS:
+  // see https://blog.stuffedcow.net/2018/04/ras-microbenchmarks/#call0.
   Label get_pc;
   call(&get_pc);
   bind(&get_pc);
@@ -1932,7 +1989,8 @@ void MacroAssembler::Call(Handle<Code> code_object, RelocInfo::Mode rmode) {
   call(code_object, rmode);
 }
 
-void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
+void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index,
+                                               Register target) {
   ASM_CODE_COMMENT(this);
   static_assert(kSystemPointerSize == 4);
   static_assert(kSmiShiftSize == 0);
@@ -1943,15 +2001,16 @@ void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
   // Untagging is folded into the indexing operand below (we use
   // times_half_system_pointer_size instead of times_system_pointer_size since
   // smis are already shifted by one).
-  mov(builtin_index,
+  mov(target,
       Operand(kRootRegister, builtin_index, times_half_system_pointer_size,
               IsolateData::builtin_entry_table_offset()));
 }
 
-void MacroAssembler::CallBuiltinByIndex(Register builtin_index) {
+void MacroAssembler::CallBuiltinByIndex(Register builtin_index,
+                                        Register target) {
   ASM_CODE_COMMENT(this);
-  LoadEntryFromBuiltinIndex(builtin_index);
-  call(builtin_index);
+  LoadEntryFromBuiltinIndex(builtin_index, target);
+  call(target);
 }
 
 void MacroAssembler::CallBuiltin(Builtin builtin) {
@@ -2000,18 +2059,19 @@ Operand MacroAssembler::EntryFromBuiltinAsOperand(Builtin builtin) {
   return Operand(kRootRegister, IsolateData::BuiltinEntrySlotOffset(builtin));
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination, Register code_object) {
+void MacroAssembler::LoadCodeInstructionStart(Register destination,
+                                              Register code_object) {
   ASM_CODE_COMMENT(this);
-  mov(destination, FieldOperand(code_object, Code::kCodeEntryPointOffset));
+  mov(destination, FieldOperand(code_object, Code::kInstructionStartOffset));
 }
 
 void MacroAssembler::CallCodeObject(Register code_object) {
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   call(code_object);
 }
 
 void MacroAssembler::JumpCodeObject(Register code_object, JumpMode jump_mode) {
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   switch (jump_mode) {
     case JumpMode::kJump:
       jmp(code_object);
@@ -2023,6 +2083,19 @@ void MacroAssembler::JumpCodeObject(Register code_object, JumpMode jump_mode) {
   }
 }
 
+void MacroAssembler::CallJSFunction(Register function_object) {
+  static_assert(kJavaScriptCallCodeStartRegister == ecx, "ABI mismatch");
+  mov(ecx, FieldOperand(function_object, JSFunction::kCodeOffset));
+  CallCodeObject(ecx);
+}
+
+void MacroAssembler::JumpJSFunction(Register function_object,
+                                    JumpMode jump_mode) {
+  static_assert(kJavaScriptCallCodeStartRegister == ecx, "ABI mismatch");
+  mov(ecx, FieldOperand(function_object, JSFunction::kCodeOffset));
+  JumpCodeObject(ecx, jump_mode);
+}
+
 void MacroAssembler::Jump(const ExternalReference& reference) {
   DCHECK(root_array_available());
   jmp(Operand(kRootRegister, RootRegisterOffsetForExternalReferenceTableEntry(
@@ -2041,6 +2114,25 @@ void MacroAssembler::Jump(Handle<Code> code_object, RelocInfo::Mode rmode) {
   jmp(code_object, rmode);
 }
 
+void MacroAssembler::LoadLabelAddress(Register dst, Label* lbl) {
+  // An lea of a label using position independent code
+  // The instruction delta 10 is the difference between the
+  // value of PC we obtain, from that what we need
+  // which is just after the lea instruction itself.
+  //
+
+  // The byte distance between acquired PC and end of sequence.
+  const int kInsDelta = 10;
+  PushPC();
+#ifdef DEBUG
+  const int kStart = pc_offset();
+#endif
+  pop(dst);
+  add(dst, Immediate(kInsDelta));  // point to after next instruction
+  lea(dst, dst, lbl);
+  DCHECK(pc_offset() - kStart == kInsDelta);
+}
+
 void MacroAssembler::CheckPageFlag(Register object, Register scratch, int mask,
                                    Condition cc, Label* condition_met,
                                    Label::Distance condition_met_distance) {
@@ -2088,6 +2180,168 @@ void MacroAssembler::CallForDeoptimization(Builtin target, int, Label* exit,
 void MacroAssembler::Trap() { int3(); }
 void MacroAssembler::DebugBreak() { int3(); }
 
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Clobbers esi, edi and caller-saved
+// registers.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, Operand* stack_space_operand,
+                              Operand return_value_operand) {
+  ASM_CODE_COMMENT(masm);
+
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  Register return_value = eax;
+  DCHECK(function_address == edx || function_address == eax);
+  // Use scratch as an "opposite" of function_address register.
+  Register scratch = function_address == edx ? ecx : edx;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = esi;
+  Register prev_limit_reg = edi;
+
+  DCHECK(!AreAliased(return_value, scratch, prev_next_address_reg,
+                     prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, prev_next_address_reg, prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, prev_next_address_reg, prev_limit_reg));
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ add(level_mem_op, Immediate(1));
+    __ mov(prev_next_address_reg, next_mem_op);
+    __ mov(prev_limit_reg, limit_mem_op);
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ cmpb(__ ExternalReferenceAsOperand(ER::execution_mode_address(isolate),
+                                          no_reg),
+            Immediate(0));
+    __ j(not_zero, &profiler_or_side_effects_check_enabled);
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ Move(scratch, Immediate(ER::address_of_runtime_stats_flag()));
+    __ cmp(Operand(scratch, 0), Immediate(0));
+    __ j(not_zero, &profiler_or_side_effects_check_enabled);
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ call(function_address);
+  __ bind(&done_api_call);
+
+  __ RecordComment("Load the value from ReturnValue");
+  __ mov(return_value, return_value_operand);
+
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ mov(next_mem_op, prev_next_address_reg);
+    __ sub(level_mem_op, Immediate(1));
+    __ Assert(above_equal, AbortReason::kInvalidHandleScopeLevel);
+    __ cmp(prev_limit_reg, limit_mem_op);
+    __ j(not_equal, &delete_allocated_handles);
+  }
+
+  __ RecordComment("Leave the API exit frame.");
+  __ bind(&leave_exit_frame);
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand != nullptr) {
+    DCHECK_EQ(stack_space, 0);
+    __ mov(stack_space_reg, *stack_space_operand);
+  }
+  __ LeaveExitFrame(scratch);
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ mov(scratch, __ ExternalReferenceAsOperand(
+                        ER::scheduled_exception_address(isolate), no_reg));
+    __ CompareRoot(scratch, RootIndex::kTheHoleValue);
+    __ j(not_equal, &promote_scheduled_exception);
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ CompareRoot(return_value, RootIndex::kTheHoleValue);
+    __ j(not_equal, &finish_return, Label::kNear);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  if (stack_space_operand == nullptr) {
+    DCHECK_NE(stack_space, 0);
+    __ ret(stack_space * kSystemPointerSize);
+  } else {
+    DCHECK_EQ(0, stack_space);
+    __ pop(scratch);
+    // {stack_space_operand} was loaded into {stack_space_reg} above.
+    __ add(esp, stack_space_reg);
+    __ jmp(scratch);
+  }
+
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via thunk wrapper.");
+    __ bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback function.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ mov(thunk_arg_mem_op, thunk_arg);
+    __ Move(scratch, Immediate(thunk_ref));
+    __ call(scratch);
+    __ jmp(&done_api_call);
+  }
+
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ bind(&delete_allocated_handles);
+    __ mov(limit_mem_op, prev_limit_reg);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ mov(saved_result, return_value);
+    __ Move(scratch, Immediate(ER::isolate_address(isolate)));
+    __ mov(Operand(esp, 0), scratch);
+    __ Move(scratch, Immediate(ER::delete_handle_scope_extensions()));
+    __ call(scratch);
+    __ mov(return_value, saved_result);
+    __ jmp(&leave_exit_frame);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/ia32/macro-assembler-ia32.h b/deps/v8/src/codegen/ia32/macro-assembler-ia32.h
index 39ee0f106e1d52..e255310d52ff07 100644
--- a/deps/v8/src/codegen/ia32/macro-assembler-ia32.h
+++ b/deps/v8/src/codegen/ia32/macro-assembler-ia32.h
@@ -26,6 +26,7 @@
 #include "src/codegen/reloc-info.h"
 #include "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h"
 #include "src/common/globals.h"
+#include "src/execution/frame-constants.h"
 #include "src/execution/frames.h"
 #include "src/handles/handles.h"
 #include "src/objects/heap-object.h"
@@ -128,7 +129,7 @@ class V8_EXPORT_PRIVATE MacroAssembler
     }
   }
   void Move(Register dst, const Immediate& src);
-  void Move(Register dst, Smi src) { Move(dst, Immediate(src)); }
+  void Move(Register dst, Tagged<Smi> src) { Move(dst, Immediate(src)); }
   void Move(Register dst, Handle<HeapObject> src);
   void Move(Register dst, Register src);
   void Move(Register dst, Operand src);
@@ -151,22 +152,28 @@ class V8_EXPORT_PRIVATE MacroAssembler
   void Call(Label* target) { call(target); }
   void Call(Handle<Code> code_object, RelocInfo::Mode rmode);
 
-  // Load the builtin given by the Smi in |builtin_index| into the same
-  // register.
-  void LoadEntryFromBuiltinIndex(Register builtin_index);
-  void CallBuiltinByIndex(Register builtin_index);
+  // Load the builtin given by the Smi in |builtin_index| into |target|.
+  void LoadEntryFromBuiltinIndex(Register builtin_index, Register target);
+  void CallBuiltinByIndex(Register builtin_index, Register target);
   void CallBuiltin(Builtin builtin);
   void TailCallBuiltin(Builtin builtin);
 
   // Load the code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_object);
+  void LoadCodeInstructionStart(Register destination, Register code_object);
   void CallCodeObject(Register code_object);
   void JumpCodeObject(Register code_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object);
+  void JumpJSFunction(Register function_object,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   void Jump(const ExternalReference& reference);
   void Jump(Handle<Code> code_object, RelocInfo::Mode rmode);
 
+  void LoadLabelAddress(Register dst, Label* lbl);
+
   void LoadMap(Register destination, Register object);
 
   void Trap();
@@ -356,7 +363,7 @@ class V8_EXPORT_PRIVATE MacroAssembler
   void Push(Operand src) { push(src); }
   void Push(Immediate value);
   void Push(Handle<HeapObject> handle) { push(Immediate(handle)); }
-  void Push(Smi smi) { Push(Immediate(smi)); }
+  void Push(Tagged<Smi> smi) { Push(Immediate(smi)); }
   void Push(XMMRegister src, Register scratch) {
     movd(scratch, src);
     push(scratch);
@@ -460,7 +467,10 @@ class V8_EXPORT_PRIVATE MacroAssembler
                    SaveFPRegsMode save_fp,
                    SmiCheck smi_check = SmiCheck::kInline);
 
-  void EnterExitFrame(int argc, StackFrame::Type frame_type, Register scratch);
+  // Allocates an EXIT/BUILTIN_EXIT/API_CALLBACK_EXIT frame with given number
+  // of slots in non-GCed area.
+  void EnterExitFrame(int extra_slots, StackFrame::Type frame_type,
+                      Register c_function);
   void LeaveExitFrame(Register scratch);
 
   // Load the global proxy from the current context.
@@ -581,6 +591,9 @@ class V8_EXPORT_PRIVATE MacroAssembler
   void AssertUndefinedOrAllocationSite(Register object,
                                        Register scratch) NOOP_UNLESS_DEBUG_CODE;
 
+  void AssertJSAny(Register object, Register map_tmp,
+                   AbortReason abort_reason) NOOP_UNLESS_DEBUG_CODE;
+
   // ---------------------------------------------------------------------------
   // Exception handling
 
@@ -673,11 +686,34 @@ inline Operand FieldOperand(Register object, Register index, ScaleFactor scale,
   return Operand(object, index, scale, offset - kHeapObjectTag);
 }
 
+// Provides access to exit frame stack space (not GC-ed).
+inline Operand ExitFrameStackSlotOperand(int offset) {
+  return Operand(esp, offset);
+}
+
+// Provides access to exit frame parameters (GC-ed).
+inline Operand ExitFrameCallerStackSlotOperand(int index) {
+  return Operand(ebp,
+                 (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
+                     kSystemPointerSize);
+}
+
 struct MoveCycleState {
   // Whether a move in the cycle needs the double scratch register.
   bool pending_double_scratch_register_use = false;
 };
 
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Clobbers esi, edi and caller-saved
+// registers.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, Operand* stack_space_operand,
+                              Operand return_value_operand);
+
 #define ACCESS_MASM(masm) masm->
 
 }  // namespace internal
diff --git a/deps/v8/src/codegen/ia32/register-ia32.h b/deps/v8/src/codegen/ia32/register-ia32.h
index 5f7585267bd8ff..35568925f2533a 100644
--- a/deps/v8/src/codegen/ia32/register-ia32.h
+++ b/deps/v8/src/codegen/ia32/register-ia32.h
@@ -69,6 +69,13 @@ ASSERT_TRIVIALLY_COPYABLE(Register);
 static_assert(sizeof(Register) <= sizeof(int),
               "Register can efficiently be passed by value");
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 #define DEFINE_REGISTER(R) \
   constexpr Register R = Register::from_code(kRegCode_##R);
 GENERAL_REGISTERS(DEFINE_REGISTER)
diff --git a/deps/v8/src/codegen/interface-descriptors-inl.h b/deps/v8/src/codegen/interface-descriptors-inl.h
index f94e50404ce667..ff21d69e24d830 100644
--- a/deps/v8/src/codegen/interface-descriptors-inl.h
+++ b/deps/v8/src/codegen/interface-descriptors-inl.h
@@ -10,6 +10,9 @@
 #include "src/base/logging.h"
 #include "src/codegen/interface-descriptors.h"
 #include "src/codegen/register.h"
+#if V8_ENABLE_WEBASSEMBLY
+#include "src/wasm/wasm-linkage.h"
+#endif
 
 #if V8_TARGET_ARCH_X64
 #include "src/codegen/x64/interface-descriptors-x64-inl.h"
@@ -50,6 +53,27 @@ constexpr auto StaticCallInterfaceDescriptor<DerivedDescriptor>::registers() {
   return CallInterfaceDescriptor::DefaultRegisterArray();
 }
 
+// static
+template <typename DerivedDescriptor>
+constexpr auto
+StaticCallInterfaceDescriptor<DerivedDescriptor>::double_registers() {
+  return CallInterfaceDescriptor::DefaultDoubleRegisterArray();
+}
+
+// static
+template <typename DerivedDescriptor>
+constexpr auto
+StaticCallInterfaceDescriptor<DerivedDescriptor>::return_registers() {
+  return CallInterfaceDescriptor::DefaultReturnRegisterArray();
+}
+
+// static
+template <typename DerivedDescriptor>
+constexpr auto
+StaticCallInterfaceDescriptor<DerivedDescriptor>::return_double_registers() {
+  return CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray();
+}
+
 // static
 template <typename DerivedDescriptor>
 constexpr auto StaticJSCallInterfaceDescriptor<DerivedDescriptor>::registers() {
@@ -66,7 +90,13 @@ void StaticCallInterfaceDescriptor<DerivedDescriptor>::Initialize(
     CallInterfaceDescriptorData* data) {
   // Static local copy of the Registers array, for platform-specific
   // initialization
-  static auto registers = DerivedDescriptor::registers();
+  static constexpr auto registers = DerivedDescriptor::registers();
+  static constexpr auto double_registers =
+      DerivedDescriptor::double_registers();
+  static constexpr auto return_registers =
+      DerivedDescriptor::return_registers();
+  static constexpr auto return_double_registers =
+      DerivedDescriptor::return_double_registers();
 
   // The passed pointer should be a modifiable pointer to our own data.
   DCHECK_EQ(data, this->data());
@@ -78,11 +108,19 @@ void StaticCallInterfaceDescriptor<DerivedDescriptor>::Initialize(
     DCHECK(!DerivedDescriptor::kCalleeSaveRegisters);
   }
 
+  // Make sure the defined arrays are big enough. The arrays can be filled up
+  // with `no_reg` and `no_dreg` to pass this DCHECK.
+  DCHECK_GE(registers.size(), GetRegisterParameterCount());
+  DCHECK_GE(double_registers.size(), GetRegisterParameterCount());
+  DCHECK_GE(return_registers.size(), DerivedDescriptor::kReturnCount);
+  DCHECK_GE(return_double_registers.size(), DerivedDescriptor::kReturnCount);
   data->InitializeRegisters(
       DerivedDescriptor::flags(), DerivedDescriptor::kReturnCount,
       DerivedDescriptor::GetParameterCount(),
       DerivedDescriptor::kStackArgumentOrder,
-      DerivedDescriptor::GetRegisterParameterCount(), registers.data());
+      DerivedDescriptor::GetRegisterParameterCount(), registers.data(),
+      double_registers.data(), return_registers.data(),
+      return_double_registers.data());
 
   // InitializeTypes is customizable by the DerivedDescriptor subclass.
   DerivedDescriptor::InitializeTypes(data);
@@ -189,6 +227,7 @@ StaticCallInterfaceDescriptor<DerivedDescriptor>::GetStackParameterCount() {
 template <typename DerivedDescriptor>
 constexpr Register
 StaticCallInterfaceDescriptor<DerivedDescriptor>::GetRegisterParameter(int i) {
+  DCHECK(!IsFloatingPoint(GetParameterType(i).representation()));
   return DerivedDescriptor::registers()[i];
 }
 
@@ -200,11 +239,32 @@ StaticCallInterfaceDescriptor<DerivedDescriptor>::GetStackParameterIndex(
   return i - DerivedDescriptor::GetRegisterParameterCount();
 }
 
+// static
+template <typename DerivedDescriptor>
+constexpr MachineType
+StaticCallInterfaceDescriptor<DerivedDescriptor>::GetParameterType(int i) {
+  if constexpr (!DerivedDescriptor::kCustomMachineTypes) {
+    // If there are no custom machine types, all results and parameters are
+    // tagged.
+    return MachineType::AnyTagged();
+  } else {
+    // All varags are tagged.
+    if (DerivedDescriptor::AllowVarArgs() &&
+        i >= DerivedDescriptor::GetParameterCount()) {
+      return MachineType::AnyTagged();
+    }
+    DCHECK_LT(i, DerivedDescriptor::GetParameterCount());
+    return DerivedDescriptor::kMachineTypes
+        [DerivedDescriptor::GetReturnCount() + i];
+  }
+}
+
 // static
 template <typename DerivedDescriptor>
 constexpr DoubleRegister
 StaticCallInterfaceDescriptor<DerivedDescriptor>::GetDoubleRegisterParameter(
     int i) {
+  DCHECK(IsFloatingPoint(GetParameterType(i).representation()));
   return DoubleRegister::from_code(DerivedDescriptor::registers()[i].code());
 }
 
@@ -391,7 +451,24 @@ constexpr auto BaselineLeaveFrameDescriptor::registers() {
 
 // static
 constexpr auto OnStackReplacementDescriptor::registers() {
+#if V8_TARGET_ARCH_MIPS64
+  return RegisterArray(kReturnRegister0, kJavaScriptCallArgCountRegister,
+                       kJavaScriptCallTargetRegister,
+                       kJavaScriptCallCodeStartRegister,
+                       kJavaScriptCallNewTargetRegister);
+#else
   return DefaultRegisterArray();
+#endif
+}
+
+// static
+constexpr auto
+MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor::registers() {
+#ifdef V8_ENABLE_MAGLEV
+  return RegisterArray(FlagsRegister(), FeedbackVectorRegister());
+#else
+  return DefaultRegisterArray();
+#endif
 }
 
 // static
@@ -554,6 +631,19 @@ constexpr auto DefineKeyedOwnWithVectorDescriptor::registers() {
                        StoreDescriptor::SlotRegister());
 }
 
+// static
+constexpr auto CallApiCallbackOptimizedDescriptor::registers() {
+  return RegisterArray(ApiFunctionAddressRegister(),
+                       ActualArgumentsCountRegister(), CallDataRegister(),
+                       HolderRegister());
+}
+
+// static
+constexpr auto CallApiCallbackGenericDescriptor::registers() {
+  return RegisterArray(ActualArgumentsCountRegister(),
+                       CallHandlerInfoRegister(), HolderRegister());
+}
+
 // static
 constexpr auto ApiGetterDescriptor::registers() {
   return RegisterArray(ReceiverRegister(), HolderRegister(),
@@ -595,12 +685,45 @@ constexpr auto ArraySingleArgumentConstructorDescriptor::registers() {
   return ArrayNArgumentsConstructorDescriptor::registers();
 }
 
-// static
 // static
 constexpr Register RunMicrotasksDescriptor::MicrotaskQueueRegister() {
   return GetRegisterParameter(0);
 }
 
+// static
+constexpr inline Register
+WasmJSToWasmWrapperDescriptor::WrapperBufferRegister() {
+  return std::get<kWrapperBuffer>(registers());
+}
+
+constexpr auto WasmToJSWrapperDescriptor::registers() {
+#if V8_ENABLE_WEBASSEMBLY
+  return RegisterArray(wasm::kGpParamRegisters[0]);
+#else
+  return EmptyRegisterArray();
+#endif
+}
+
+constexpr auto WasmToJSWrapperDescriptor::return_registers() {
+#if V8_ENABLE_WEBASSEMBLY
+  return RegisterArray(wasm::kGpReturnRegisters[0], wasm::kGpReturnRegisters[1],
+                       no_reg, no_reg);
+#else
+  // An arbitrary register array so that the code compiles.
+  return CallInterfaceDescriptor::DefaultRegisterArray();
+#endif
+}
+
+constexpr auto WasmToJSWrapperDescriptor::return_double_registers() {
+#if V8_ENABLE_WEBASSEMBLY
+  return DoubleRegisterArray(no_dreg, no_dreg, wasm::kFpReturnRegisters[0],
+                             wasm::kFpReturnRegisters[1]);
+#else
+  // An arbitrary register array so that the code compiles.
+  return CallInterfaceDescriptor::DefaultDoubleRegisterArray();
+#endif
+}
+
 #define DEFINE_STATIC_BUILTIN_DESCRIPTOR_GETTER(Name, DescriptorName) \
   template <>                                                         \
   struct CallInterfaceDescriptorFor<Builtin::k##Name> {               \
diff --git a/deps/v8/src/codegen/interface-descriptors.cc b/deps/v8/src/codegen/interface-descriptors.cc
index e5e26b580542f9..250b1963447e93 100644
--- a/deps/v8/src/codegen/interface-descriptors.cc
+++ b/deps/v8/src/codegen/interface-descriptors.cc
@@ -10,27 +10,45 @@
 namespace v8 {
 namespace internal {
 
-void CallInterfaceDescriptorData::InitializeRegisters(
-    Flags flags, int return_count, int parameter_count,
-    StackArgumentOrder stack_order, int register_parameter_count,
-    const Register* registers) {
-  DCHECK(!IsInitializedTypes());
-
 #ifdef DEBUG
-  {
-    // Make sure that the registers are all valid, and don't alias each other.
-    RegList reglist;
-    for (int i = 0; i < register_parameter_count; ++i) {
-      Register reg = registers[i];
-      DCHECK(reg.is_valid());
-      DCHECK(!reglist.has(reg));
-      DCHECK_NE(reg, kRootRegister);
+void CheckRegisterConfiguration(int count, const Register* registers,
+                                const DoubleRegister* double_registers) {
+  // Make sure that the registers are all valid, and don't alias each other.
+  RegList reglist;
+  DoubleRegList double_reglist;
+  for (int i = 0; i < count; ++i) {
+    Register reg = registers[i];
+    DoubleRegister dreg = double_registers[i];
+    DCHECK(reg.is_valid() || dreg.is_valid());
+    DCHECK_NE(reg, kRootRegister);
 #ifdef V8_COMPRESS_POINTERS
-      DCHECK_NE(reg, kPtrComprCageBaseRegister);
+    DCHECK_NE(reg, kPtrComprCageBaseRegister);
 #endif
+    if (reg.is_valid()) {
+      DCHECK(!reglist.has(reg));
       reglist.set(reg);
     }
+    if (dreg.is_valid()) {
+      DCHECK(!double_reglist.has(dreg));
+      double_reglist.set(dreg);
+    }
   }
+}
+#endif
+
+void CallInterfaceDescriptorData::InitializeRegisters(
+    Flags flags, int return_count, int parameter_count,
+    StackArgumentOrder stack_order, int register_parameter_count,
+    const Register* registers, const DoubleRegister* double_registers,
+    const Register* return_registers,
+    const DoubleRegister* return_double_registers) {
+  DCHECK(!IsInitializedTypes());
+
+#ifdef DEBUG
+  CheckRegisterConfiguration(register_parameter_count, registers,
+                             double_registers);
+  CheckRegisterConfiguration(return_count, return_registers,
+                             return_double_registers);
 #endif
 
   flags_ = flags;
@@ -41,6 +59,9 @@ void CallInterfaceDescriptorData::InitializeRegisters(
 
   // The caller owns the the registers array, so we just set the pointer.
   register_params_ = registers;
+  double_register_params_ = double_registers;
+  register_returns_ = return_registers;
+  double_register_returns_ = return_double_registers;
 }
 
 void CallInterfaceDescriptorData::InitializeTypes(
@@ -77,6 +98,9 @@ void CallInterfaceDescriptorData::Reset() {
   delete[] machine_types_;
   machine_types_ = nullptr;
   register_params_ = nullptr;
+  double_register_params_ = nullptr;
+  register_returns_ = nullptr;
+  double_register_returns_ = nullptr;
 }
 
 // static
@@ -94,7 +118,7 @@ void CallDescriptors::InitializeOncePerProcess() {
   DCHECK(!AllocateDescriptor{}.HasContextParameter());
   DCHECK(!AbortDescriptor{}.HasContextParameter());
   DCHECK(!WasmFloat32ToNumberDescriptor{}.HasContextParameter());
-  DCHECK(!WasmFloat64ToNumberDescriptor{}.HasContextParameter());
+  DCHECK(!WasmFloat64ToTaggedDescriptor{}.HasContextParameter());
 }
 
 void CallDescriptors::TearDown() {
diff --git a/deps/v8/src/codegen/interface-descriptors.h b/deps/v8/src/codegen/interface-descriptors.h
index 0322b43369e25d..33579e0ba6ad96 100644
--- a/deps/v8/src/codegen/interface-descriptors.h
+++ b/deps/v8/src/codegen/interface-descriptors.h
@@ -24,7 +24,8 @@ namespace internal {
 #define INTERFACE_DESCRIPTOR_LIST(V)                 \
   V(Abort)                                           \
   V(Allocate)                                        \
-  V(ApiCallback)                                     \
+  V(CallApiCallbackGeneric)                          \
+  V(CallApiCallbackOptimized)                        \
   V(ApiGetter)                                       \
   V(ArrayConstructor)                                \
   V(ArrayNArgumentsConstructor)                      \
@@ -108,6 +109,7 @@ namespace internal {
   V(LookupWithVector)                                \
   V(LookupTrampoline)                                \
   V(LookupBaseline)                                  \
+  V(MaglevOptimizeCodeOrTailCallOptimizedCodeSlot)   \
   V(NewHeapNumber)                                   \
   V(NoContext)                                       \
   V(OnStackReplacement)                              \
@@ -135,7 +137,9 @@ namespace internal {
   V(UnaryOp_WithFeedback)                            \
   V(Void)                                            \
   V(WasmFloat32ToNumber)                             \
-  V(WasmFloat64ToNumber)                             \
+  V(WasmFloat64ToTagged)                             \
+  V(WasmJSToWasmWrapper)                             \
+  V(WasmToJSWrapper)                                 \
   V(WasmSuspend)                                     \
   V(WriteBarrier)                                    \
   IF_TSAN(V, TSANLoad)                               \
@@ -184,7 +188,10 @@ class V8_EXPORT_PRIVATE CallInterfaceDescriptorData {
   void InitializeRegisters(Flags flags, int return_count, int parameter_count,
                            StackArgumentOrder stack_order,
                            int register_parameter_count,
-                           const Register* registers);
+                           const Register* registers,
+                           const DoubleRegister* double_registers,
+                           const Register* return_registers,
+                           const DoubleRegister* return_double_registers);
 
   // if machine_types is null, then an array of size
   // (return_count + parameter_count) will be created with
@@ -208,6 +215,13 @@ class V8_EXPORT_PRIVATE CallInterfaceDescriptorData {
   int param_count() const { return param_count_; }
   int register_param_count() const { return register_param_count_; }
   Register register_param(int index) const { return register_params_[index]; }
+  DoubleRegister double_register_param(int index) const {
+    return double_register_params_[index];
+  }
+  Register register_return(int index) const { return register_returns_[index]; }
+  DoubleRegister double_register_return(int index) const {
+    return double_register_returns_[index];
+  }
   MachineType return_type(int index) const {
     DCHECK_LT(index, return_count_);
     return machine_types_[index];
@@ -264,6 +278,9 @@ class V8_EXPORT_PRIVATE CallInterfaceDescriptorData {
   // is a static local stored in the caller function. The machine types are
   // allocated dynamically by the InterfaceDescriptor and freed on destruction.
   const Register* register_params_ = nullptr;
+  const DoubleRegister* double_register_params_ = nullptr;
+  const Register* register_returns_ = nullptr;
+  const DoubleRegister* double_register_returns_ = nullptr;
   MachineType* machine_types_ = nullptr;
 };
 
@@ -365,6 +382,21 @@ class V8_EXPORT_PRIVATE CallInterfaceDescriptor {
     return data()->register_param(index);
   }
 
+  DoubleRegister GetDoubleRegisterParameter(int index) const {
+    DCHECK_LT(index, data()->register_param_count());
+    return data()->double_register_param(index);
+  }
+
+  Register GetRegisterReturn(int index) const {
+    DCHECK_LT(index, data()->return_count());
+    return data()->register_return(index);
+  }
+
+  DoubleRegister GetDoubleRegisterReturn(int index) const {
+    DCHECK_LT(index, data()->return_count());
+    return data()->double_register_return(index);
+  }
+
   MachineType GetParameterType(int index) const {
     DCHECK_LT(index, data()->param_count());
     return data()->param_type(index);
@@ -396,6 +428,9 @@ class V8_EXPORT_PRIVATE CallInterfaceDescriptor {
   // Use auto for the return type to allow different architectures to have
   // differently sized default register arrays.
   static constexpr inline auto DefaultRegisterArray();
+  static constexpr inline auto DefaultDoubleRegisterArray();
+  static constexpr inline auto DefaultReturnRegisterArray();
+  static constexpr inline auto DefaultReturnDoubleRegisterArray();
   static constexpr inline std::array<Register, kJSBuiltinRegisterParams>
   DefaultJSRegisterArray();
 
@@ -442,6 +477,9 @@ class StaticCallInterfaceDescriptor : public CallInterfaceDescriptor {
   //
   // Defaults to CallInterfaceDescriptor::DefaultRegisterArray().
   static constexpr inline auto registers();
+  static constexpr inline auto double_registers();
+  static constexpr inline auto return_registers();
+  static constexpr inline auto return_double_registers();
 
   // An additional limit on the number of register parameters allowed. This is
   // here so that it can be overwritten to kMaxTFSBuiltinRegisterParams for TFS
@@ -456,6 +494,10 @@ class StaticCallInterfaceDescriptor : public CallInterfaceDescriptor {
   // If set to true, builtins will callee save the set returned by registers().
   static constexpr bool kCalleeSaveRegisters = false;
 
+  // If set to true, the descriptor will define a kMachineTypes array with the
+  // types of each result value and parameter.
+  static constexpr bool kCustomMachineTypes = false;
+
   // End of customization points.
   // ===========================================================================
 
@@ -487,6 +529,7 @@ class StaticCallInterfaceDescriptor : public CallInterfaceDescriptor {
   static constexpr inline Register* GetRegisterData();
   static constexpr inline Register GetRegisterParameter(int i);
   static constexpr inline int GetStackParameterIndex(int i);
+  static constexpr inline MachineType GetParameterType(int i);
 
   // Interface descriptors don't really support double registers.
   // This reinterprets the i-th register as a double with the same code.
@@ -514,6 +557,7 @@ class StaticCallInterfaceDescriptor : public CallInterfaceDescriptor {
   // is overwritable by subclasses. By default, all parameters have
   // MachineType::AnyTagged() type.
   static void InitializeTypes(CallInterfaceDescriptorData* data) {
+    DCHECK(!kCustomMachineTypes);
     data->InitializeTypes(nullptr, 0);
   }
 };
@@ -535,7 +579,7 @@ struct CallInterfaceDescriptorFor;
 // Stub class replacing std::array<Register, 0>, as a workaround for MSVC's
 // https://github.com/microsoft/STL/issues/942
 struct EmptyRegisterArray {
-  Register* data() { return nullptr; }
+  const Register* data() const { return nullptr; }
   size_t size() const { return 0; }
   Register operator[](size_t i) const { UNREACHABLE(); }
 };
@@ -550,6 +594,25 @@ constexpr std::array<Register, 1 + sizeof...(Registers)> RegisterArray(
 }
 constexpr EmptyRegisterArray RegisterArray() { return {}; }
 
+// Stub class replacing std::array<Register, 0>, as a workaround for MSVC's
+// https://github.com/microsoft/STL/issues/942
+struct EmptyDoubleRegisterArray {
+  const DoubleRegister* data() const { return nullptr; }
+  size_t size() const { return 0; }
+  DoubleRegister operator[](size_t i) const { UNREACHABLE(); }
+};
+
+// Helper method for defining an array of unique registers for the various
+// Descriptor::double_registers() methods.
+template <typename... Registers>
+constexpr std::array<DoubleRegister, 1 + sizeof...(Registers)>
+DoubleRegisterArray(DoubleRegister first_reg, Registers... regs) {
+  DCHECK(!AreAliased(first_reg, regs...));
+  return {first_reg, regs...};
+}
+
+constexpr EmptyDoubleRegisterArray DoubleRegisterArray() { return {}; }
+
 #define DECLARE_DESCRIPTOR_WITH_BASE(name, base)                  \
  public:                                                          \
   /* StaticCallInterfaceDescriptor can call Initialize methods */ \
@@ -623,12 +686,13 @@ constexpr EmptyRegisterArray RegisterArray() { return {}; }
   static constexpr bool kNoContext = true;
 
 #define DEFINE_RESULT_AND_PARAMETER_TYPES(...)                                \
+  static constexpr bool kCustomMachineTypes = true;                           \
+  static constexpr MachineType kMachineTypes[] = {__VA_ARGS__};               \
   static void InitializeTypes(CallInterfaceDescriptorData* data) {            \
-    MachineType machine_types[] = {__VA_ARGS__};                              \
     static_assert(                                                            \
-        kReturnCount + kParameterCount == arraysize(machine_types),           \
+        kReturnCount + kParameterCount == arraysize(kMachineTypes),           \
         "Parameter names definition is not consistent with parameter types"); \
-    data->InitializeTypes(machine_types, arraysize(machine_types));           \
+    data->InitializeTypes(kMachineTypes, arraysize(kMachineTypes));           \
   }
 
 #define DEFINE_PARAMETER_TYPES(...)                                        \
@@ -682,6 +746,8 @@ constexpr EmptyRegisterArray RegisterArray() { return {}; }
 class V8_EXPORT_PRIVATE VoidDescriptor
     : public StaticCallInterfaceDescriptor<VoidDescriptor> {
  public:
+  // The void descriptor could (and indeed probably should) also be NO_CONTEXT,
+  // but this breaks some code assembler unittests.
   DEFINE_PARAMETERS()
   DEFINE_PARAMETER_TYPES()
   DECLARE_DESCRIPTOR(VoidDescriptor)
@@ -733,11 +799,6 @@ class NewHeapNumberDescriptor
   DEFINE_RESULT_AND_PARAMETER_TYPES(MachineType::TaggedPointer(),  // Result
                                     MachineType::Float64())        // kValue
   DECLARE_DESCRIPTOR(NewHeapNumberDescriptor)
-
-#if V8_TARGET_ARCH_IA32
-  // We need a custom descriptor on ia32 to avoid using xmm0.
-  static constexpr inline auto registers();
-#endif
 };
 
 // This descriptor defines the JavaScript calling convention that can be used
@@ -882,6 +943,21 @@ class LookupBaselineDescriptor
   DECLARE_DESCRIPTOR(LookupBaselineDescriptor)
 };
 
+class MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor
+    : public StaticCallInterfaceDescriptor<
+          MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor> {
+ public:
+  DEFINE_PARAMETERS_NO_CONTEXT(kFlags, kFeedbackVector)
+  DEFINE_PARAMETER_TYPES(MachineType::Int32(),          // kFlags
+                         MachineType::TaggedPointer())  // kFeedbackVector
+  DECLARE_DESCRIPTOR(MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor)
+
+  static constexpr inline Register FlagsRegister();
+  static constexpr inline Register FeedbackVectorRegister();
+
+  static constexpr inline auto registers();
+};
+
 class StoreDescriptor : public StaticCallInterfaceDescriptor<StoreDescriptor> {
  public:
   DEFINE_PARAMETERS(kReceiver, kName, kValue, kSlot)
@@ -1309,7 +1385,7 @@ class GetPropertyDescriptor final
 class TypeofDescriptor
     : public StaticCallInterfaceDescriptor<TypeofDescriptor> {
  public:
-  DEFINE_PARAMETERS(kObject)
+  DEFINE_PARAMETERS_NO_CONTEXT(kObject)
   DEFINE_PARAMETER_TYPES(MachineType::AnyTagged())
   DECLARE_DESCRIPTOR(TypeofDescriptor)
 
@@ -1383,7 +1459,7 @@ class CallFunctionTemplateDescriptor
  public:
   DEFINE_PARAMETERS_VARARGS(kFunctionTemplateInfo, kArgumentsCount)
   DEFINE_PARAMETER_TYPES(MachineType::AnyTagged(),  // kFunctionTemplateInfo
-                         MachineType::IntPtr())     // kArgumentsCount
+                         MachineType::Int32())      // kArgumentsCount
   DECLARE_DESCRIPTOR(CallFunctionTemplateDescriptor)
 
   static constexpr inline auto registers();
@@ -1732,8 +1808,8 @@ class CEntry1ArgvOnStackDescriptor
   static constexpr auto registers();
 };
 
-class ApiCallbackDescriptor
-    : public StaticCallInterfaceDescriptor<ApiCallbackDescriptor> {
+class CallApiCallbackOptimizedDescriptor
+    : public StaticCallInterfaceDescriptor<CallApiCallbackOptimizedDescriptor> {
  public:
   DEFINE_PARAMETERS_VARARGS(kApiFunctionAddress, kActualArgumentsCount,
                             kCallData, kHolder)
@@ -1743,7 +1819,30 @@ class ApiCallbackDescriptor
                          MachineType::Int32(),      // kActualArgumentsCount
                          MachineType::AnyTagged(),  // kCallData
                          MachineType::AnyTagged())  // kHolder
-  DECLARE_DESCRIPTOR(ApiCallbackDescriptor)
+  DECLARE_DESCRIPTOR(CallApiCallbackOptimizedDescriptor)
+
+  static constexpr inline Register ApiFunctionAddressRegister();
+  static constexpr inline Register ActualArgumentsCountRegister();
+  static constexpr inline Register CallDataRegister();
+  static constexpr inline Register HolderRegister();
+
+  static constexpr inline auto registers();
+};
+
+class CallApiCallbackGenericDescriptor
+    : public StaticCallInterfaceDescriptor<CallApiCallbackGenericDescriptor> {
+ public:
+  DEFINE_PARAMETERS_VARARGS(kActualArgumentsCount, kCallHandlerInfo, kHolder)
+  //                           receiver is implicit stack argument 1
+  //                           argv are implicit stack arguments [2, 2 + kArgc[
+  DEFINE_PARAMETER_TYPES(MachineType::Int32(),      // kActualArgumentsCount
+                         MachineType::AnyTagged(),  // kCallHandlerInfo
+                         MachineType::AnyTagged())  // kHolder
+  DECLARE_DESCRIPTOR(CallApiCallbackGenericDescriptor)
+
+  static constexpr inline Register ActualArgumentsCountRegister();
+  static constexpr inline Register CallHandlerInfoRegister();
+  static constexpr inline Register HolderRegister();
 
   static constexpr inline auto registers();
 };
@@ -1768,7 +1867,7 @@ class ApiGetterDescriptor
 class GrowArrayElementsDescriptor
     : public StaticCallInterfaceDescriptor<GrowArrayElementsDescriptor> {
  public:
-  DEFINE_PARAMETERS(kObject, kKey)
+  DEFINE_PARAMETERS_NO_CONTEXT(kObject, kKey)
   DEFINE_PARAMETER_TYPES(MachineType::AnyTagged(),  // kObject
                          MachineType::AnyTagged())  // kKey
   DECLARE_DESCRIPTOR(GrowArrayElementsDescriptor)
@@ -1997,33 +2096,61 @@ class WasmFloat32ToNumberDescriptor final
   DEFINE_RESULT_AND_PARAMETER_TYPES(MachineType::AnyTagged(),  // result
                                     MachineType::Float32())    // value
   DECLARE_DESCRIPTOR(WasmFloat32ToNumberDescriptor)
-
-#if V8_TARGET_ARCH_IA32
-  // We need a custom descriptor on ia32 to avoid using xmm0.
-  static constexpr inline auto registers();
-#endif
 };
 
-class WasmFloat64ToNumberDescriptor final
-    : public StaticCallInterfaceDescriptor<WasmFloat64ToNumberDescriptor> {
+class WasmFloat64ToTaggedDescriptor final
+    : public StaticCallInterfaceDescriptor<WasmFloat64ToTaggedDescriptor> {
  public:
   DEFINE_PARAMETERS_NO_CONTEXT(kValue)
   DEFINE_RESULT_AND_PARAMETER_TYPES(MachineType::AnyTagged(),  // result
                                     MachineType::Float64())    // value
-  DECLARE_DESCRIPTOR(WasmFloat64ToNumberDescriptor)
+  DECLARE_DESCRIPTOR(WasmFloat64ToTaggedDescriptor)
+};
+
+class WasmJSToWasmWrapperDescriptor final
+    : public StaticCallInterfaceDescriptor<WasmJSToWasmWrapperDescriptor> {
+ public:
+  DEFINE_PARAMETERS_NO_CONTEXT(kWrapperBuffer, kInstance, kResultJSArray)
+  DEFINE_RESULT_AND_PARAMETER_TYPES(MachineType::AnyTagged(),  // result
+                                    MachineType::IntPtr(),     // ParamBuffer
+                                    MachineType::AnyTagged(),  // Instance
+                                    MachineType::AnyTagged())  // Result jsarray
+  DECLARE_DESCRIPTOR(WasmJSToWasmWrapperDescriptor)
+
+  static constexpr int kMaxRegisterParams = 1;
+  // Only the first parameter, `WrapperBuffer` gets passed over a register, the
+  // instance and the js-array get passed over the stack. The reason is that
+  // these parameters get forwarded to another function, and GC's may happen
+  // until this other function gets called. By passing these parameters over the
+  // stack the references get scanned as part of the caller frame, and the GC
+  // does not have to scan anything on the `WasmJSToWasmWrapper` frame.
+  static constexpr inline auto registers();
+  static constexpr inline Register WrapperBufferRegister();
+};
 
-#if V8_TARGET_ARCH_IA32
-  // We need a custom descriptor on ia32 to avoid using xmm0.
+class WasmToJSWrapperDescriptor final
+    : public StaticCallInterfaceDescriptor<WasmToJSWrapperDescriptor> {
+ public:
+  DEFINE_RESULT_AND_PARAMETERS_NO_CONTEXT(4, kWasmApiFunctionRef)
+  DEFINE_RESULT_AND_PARAMETER_TYPES(
+      MachineType::IntPtr(),     // GP return 1
+      MachineType::IntPtr(),     // GP return 2
+      MachineType::Float64(),    // FP return 1
+      MachineType::Float64(),    // FP return 2
+      MachineType::AnyTagged())  // WasmApiFunctionRef
+  DECLARE_DESCRIPTOR(WasmToJSWrapperDescriptor)
+
+  static constexpr int kMaxRegisterParams = 1;
   static constexpr inline auto registers();
-#endif
+  static constexpr inline auto return_registers();
+  static constexpr inline auto return_double_registers();
 };
 
 class WasmSuspendDescriptor final
     : public StaticCallInterfaceDescriptor<WasmSuspendDescriptor> {
  public:
-  DEFINE_RESULT_AND_PARAMETERS_NO_CONTEXT(1, kArg0, kArg1)
+  DEFINE_RESULT_AND_PARAMETERS_NO_CONTEXT(1, kArg0)
   DEFINE_RESULT_AND_PARAMETER_TYPES(MachineType::AnyTagged(),  // result
-                                    MachineType::AnyTagged(),  // value
                                     MachineType::AnyTagged())  // value
   DECLARE_DESCRIPTOR(WasmSuspendDescriptor)
 };
@@ -2214,11 +2341,6 @@ class CheckTurboshaftFloat32TypeDescriptor
                                     MachineType::TaggedPointer(),
                                     MachineType::TaggedSigned())
   DECLARE_DEFAULT_DESCRIPTOR(CheckTurboshaftFloat32TypeDescriptor)
-
-#if V8_TARGET_ARCH_IA32
-  // We need a custom descriptor on ia32 to avoid using xmm0.
-  static constexpr inline auto registers();
-#endif
 };
 
 class CheckTurboshaftFloat64TypeDescriptor
@@ -2231,19 +2353,33 @@ class CheckTurboshaftFloat64TypeDescriptor
                                     MachineType::TaggedPointer(),
                                     MachineType::TaggedSigned())
   DECLARE_DEFAULT_DESCRIPTOR(CheckTurboshaftFloat64TypeDescriptor)
+};
 
-#if V8_TARGET_ARCH_IA32
-  // We need a custom descriptor on ia32 to avoid using xmm0.
-  static constexpr inline auto registers();
-#endif
+class DebugPrintWordPtrDescriptor
+    : public StaticCallInterfaceDescriptor<DebugPrintWordPtrDescriptor> {
+ public:
+  DEFINE_RESULT_AND_PARAMETERS(1, kValue)
+  DEFINE_RESULT_AND_PARAMETER_TYPES(MachineType::TaggedPointer(),
+                                    MachineType::UintPtr())
+  DECLARE_DEFAULT_DESCRIPTOR(DebugPrintWordPtrDescriptor)
+};
+
+class DebugPrintFloat64Descriptor
+    : public StaticCallInterfaceDescriptor<DebugPrintFloat64Descriptor> {
+ public:
+  DEFINE_RESULT_AND_PARAMETERS(1, kValue)
+  DEFINE_RESULT_AND_PARAMETER_TYPES(MachineType::TaggedPointer(),
+                                    MachineType::Float64())
+  DECLARE_DEFAULT_DESCRIPTOR(DebugPrintFloat64Descriptor)
 };
 
-#define DEFINE_TFS_BUILTIN_DESCRIPTOR(Name, ...)                 \
-  class Name##Descriptor                                         \
-      : public StaticCallInterfaceDescriptor<Name##Descriptor> { \
-   public:                                                       \
-    DEFINE_PARAMETERS(__VA_ARGS__)                               \
-    DECLARE_DEFAULT_DESCRIPTOR(Name##Descriptor)                 \
+#define DEFINE_TFS_BUILTIN_DESCRIPTOR(Name, DoesNeedContext, ...)            \
+  class Name##Descriptor                                                     \
+      : public StaticCallInterfaceDescriptor<Name##Descriptor> {             \
+   public:                                                                   \
+    DEFINE_PARAMETERS(__VA_ARGS__)                                           \
+    static constexpr bool kNoContext = DoesNeedContext == NeedsContext::kNo; \
+    DECLARE_DEFAULT_DESCRIPTOR(Name##Descriptor)                             \
   };
 BUILTIN_LIST_TFS(DEFINE_TFS_BUILTIN_DESCRIPTOR)
 #undef DEFINE_TFS_BUILTIN_DESCRIPTOR
diff --git a/deps/v8/src/codegen/linkage-location.h b/deps/v8/src/codegen/linkage-location.h
new file mode 100644
index 00000000000000..662a8f8922f167
--- /dev/null
+++ b/deps/v8/src/codegen/linkage-location.h
@@ -0,0 +1,183 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_CODEGEN_LINKAGE_LOCATION_H_
+#define V8_CODEGEN_LINKAGE_LOCATION_H_
+
+#include "src/base/bit-field.h"
+#include "src/codegen/machine-type.h"
+#include "src/execution/frame-constants.h"
+
+#if !defined(__clang__) && defined(_M_ARM64)
+// _M_ARM64 is an MSVC-specific macro that clang-cl emulates.
+#define NO_INLINE_FOR_ARM64_MSVC __declspec(noinline)
+#else
+#define NO_INLINE_FOR_ARM64_MSVC
+#endif
+
+namespace v8 {
+namespace internal {
+template <typename T>
+class Signature;
+
+// Describes the location for a parameter or a return value to a call.
+class LinkageLocation {
+ public:
+  bool operator==(const LinkageLocation& other) const {
+    return bit_field_ == other.bit_field_ &&
+           machine_type_ == other.machine_type_;
+  }
+
+  bool operator!=(const LinkageLocation& other) const {
+    return !(*this == other);
+  }
+
+  static bool IsSameLocation(const LinkageLocation& a,
+                             const LinkageLocation& b) {
+    // Different MachineTypes may end up at the same physical location. With the
+    // sub-type check we make sure that types like {AnyTagged} and
+    // {TaggedPointer} which would end up with the same physical location are
+    // considered equal here.
+    return (a.bit_field_ == b.bit_field_) &&
+           (IsSubtype(a.machine_type_.representation(),
+                      b.machine_type_.representation()) ||
+            IsSubtype(b.machine_type_.representation(),
+                      a.machine_type_.representation()));
+  }
+
+  static LinkageLocation ForNullRegister(
+      int32_t reg, MachineType type = MachineType::None()) {
+    return LinkageLocation(REGISTER, reg, type);
+  }
+
+  static LinkageLocation ForAnyRegister(
+      MachineType type = MachineType::None()) {
+    return LinkageLocation(REGISTER, ANY_REGISTER, type);
+  }
+
+  static LinkageLocation ForRegister(int32_t reg,
+                                     MachineType type = MachineType::None()) {
+    DCHECK_LE(0, reg);
+    return LinkageLocation(REGISTER, reg, type);
+  }
+
+  static LinkageLocation ForCallerFrameSlot(int32_t slot, MachineType type) {
+    DCHECK_GT(0, slot);
+    return LinkageLocation(STACK_SLOT, slot, type);
+  }
+
+  static LinkageLocation ForCalleeFrameSlot(int32_t slot, MachineType type) {
+    // TODO(titzer): bailout instead of crashing here.
+    DCHECK(slot >= 0 && slot < LinkageLocation::MAX_STACK_SLOT);
+    return LinkageLocation(STACK_SLOT, slot, type);
+  }
+
+  // TODO(ahaas): Extract these TurboFan-specific functions from the
+  // LinkageLocation.
+  static LinkageLocation ForSavedCallerReturnAddress() {
+    return ForCalleeFrameSlot((StandardFrameConstants::kCallerPCOffset -
+                               StandardFrameConstants::kCallerPCOffset) /
+                                  kSystemPointerSize,
+                              MachineType::Pointer());
+  }
+
+  static LinkageLocation ForSavedCallerFramePtr() {
+    return ForCalleeFrameSlot((StandardFrameConstants::kCallerPCOffset -
+                               StandardFrameConstants::kCallerFPOffset) /
+                                  kSystemPointerSize,
+                              MachineType::Pointer());
+  }
+
+  static LinkageLocation ForSavedCallerConstantPool() {
+    DCHECK(V8_EMBEDDED_CONSTANT_POOL_BOOL);
+    return ForCalleeFrameSlot((StandardFrameConstants::kCallerPCOffset -
+                               StandardFrameConstants::kConstantPoolOffset) /
+                                  kSystemPointerSize,
+                              MachineType::AnyTagged());
+  }
+
+  static LinkageLocation ForSavedCallerFunction() {
+    return ForCalleeFrameSlot((StandardFrameConstants::kCallerPCOffset -
+                               StandardFrameConstants::kFunctionOffset) /
+                                  kSystemPointerSize,
+                              MachineType::AnyTagged());
+  }
+
+  static LinkageLocation ConvertToTailCallerLocation(
+      LinkageLocation caller_location, int stack_param_delta) {
+    if (!caller_location.IsRegister()) {
+      return LinkageLocation(STACK_SLOT,
+                             caller_location.GetLocation() + stack_param_delta,
+                             caller_location.GetType());
+    }
+    return caller_location;
+  }
+
+  MachineType GetType() const { return machine_type_; }
+
+  int GetSizeInPointers() const {
+    return ElementSizeInPointers(GetType().representation());
+  }
+
+  int32_t GetLocation() const {
+    // We can't use LocationField::decode here because it doesn't work for
+    // negative values!
+    return static_cast<int32_t>(bit_field_ & LocationField::kMask) >>
+           LocationField::kShift;
+  }
+
+  bool IsNullRegister() const {
+    return IsRegister() && GetLocation() < ANY_REGISTER;
+  }
+  NO_INLINE_FOR_ARM64_MSVC bool IsRegister() const {
+    return TypeField::decode(bit_field_) == REGISTER;
+  }
+  bool IsAnyRegister() const {
+    return IsRegister() && GetLocation() == ANY_REGISTER;
+  }
+  bool IsCallerFrameSlot() const { return !IsRegister() && GetLocation() < 0; }
+  bool IsCalleeFrameSlot() const { return !IsRegister() && GetLocation() >= 0; }
+
+  int32_t AsRegister() const {
+    DCHECK(IsRegister());
+    return GetLocation();
+  }
+  int32_t AsCallerFrameSlot() const {
+    DCHECK(IsCallerFrameSlot());
+    return GetLocation();
+  }
+  int32_t AsCalleeFrameSlot() const {
+    DCHECK(IsCalleeFrameSlot());
+    return GetLocation();
+  }
+
+ private:
+  enum LocationType { REGISTER, STACK_SLOT };
+
+  using TypeField = base::BitField<LocationType, 0, 1>;
+  using LocationField = TypeField::Next<int32_t, 31>;
+
+  static constexpr int32_t ANY_REGISTER = -1;
+  static constexpr int32_t MAX_STACK_SLOT = 32767;
+
+  LinkageLocation(LocationType type, int32_t location,
+                  MachineType machine_type) {
+    bit_field_ = TypeField::encode(type) |
+                 // {location} can be -1 (ANY_REGISTER).
+                 ((static_cast<uint32_t>(location) << LocationField::kShift) &
+                  LocationField::kMask);
+    machine_type_ = machine_type;
+  }
+
+  int32_t bit_field_;
+  MachineType machine_type_;
+};
+
+using LocationSignature = Signature<LinkageLocation>;
+
+}  // namespace internal
+}  // namespace v8
+#undef NO_INLINE_FOR_ARM64_MSVC
+
+#endif  // V8_CODEGEN_LINKAGE_LOCATION_H_
diff --git a/deps/v8/src/codegen/loong64/assembler-loong64-inl.h b/deps/v8/src/codegen/loong64/assembler-loong64-inl.h
index 6bacf8c5e3909a..f074991e4d8ef4 100644
--- a/deps/v8/src/codegen/loong64/assembler-loong64-inl.h
+++ b/deps/v8/src/codegen/loong64/assembler-loong64-inl.h
@@ -35,14 +35,14 @@ void RelocInfo::apply(intptr_t delta) {
     // Absolute code pointer inside code object moves with the code object.
     Assembler::RelocateInternalReference(rmode_, pc_, delta);
   } else {
-    DCHECK(IsRelativeCodeTarget(rmode_));
+    DCHECK(IsRelativeCodeTarget(rmode_) || IsNearBuiltinEntry(rmode_));
     Assembler::RelocateRelativeReference(rmode_, pc_, delta);
   }
 }
 
 Address RelocInfo::target_address() {
-  DCHECK(IsCodeTargetMode(rmode_) || IsWasmCall(rmode_) ||
-         IsWasmStubCall(rmode_));
+  DCHECK(IsCodeTargetMode(rmode_) || IsNearBuiltinEntry(rmode_) ||
+         IsWasmCall(rmode_) || IsWasmStubCall(rmode_));
   return Assembler::target_address_at(pc_, constant_pool_);
 }
 
@@ -70,9 +70,9 @@ Address RelocInfo::constant_pool_entry_address() { UNREACHABLE(); }
 int RelocInfo::target_address_size() { return Assembler::kSpecialTargetSize; }
 
 void Assembler::deserialization_set_special_target_at(
-    Address instruction_payload, Code code, Address target) {
+    Address instruction_payload, Tagged<Code> code, Address target) {
   set_target_address_at(instruction_payload,
-                        !code.is_null() ? code.constant_pool() : kNullAddress,
+                        !code.is_null() ? code->constant_pool() : kNullAddress,
                         target);
 }
 
@@ -103,14 +103,20 @@ Handle<Code> Assembler::code_target_object_handle_at(Address pc,
   return GetCodeTarget(index);
 }
 
-HeapObject RelocInfo::target_object(PtrComprCageBase cage_base) {
+Builtin Assembler::target_builtin_at(Address pc) {
+  int builtin_id = static_cast<int>(target_address_at(pc) - pc) >> 2;
+  DCHECK(Builtins::IsBuiltinId(builtin_id));
+  return static_cast<Builtin>(builtin_id);
+}
+
+Tagged<HeapObject> RelocInfo::target_object(PtrComprCageBase cage_base) {
   DCHECK(IsCodeTarget(rmode_) || IsFullEmbeddedObject(rmode_) ||
          IsCompressedEmbeddedObject(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
     Tagged_t compressed =
         Assembler::target_compressed_address_at(pc_, constant_pool_);
     DCHECK(!HAS_SMI_TAG(compressed));
-    Object obj(
+    Tagged<Object> obj(
         V8HeapCompressionScheme::DecompressTagged(cage_base, compressed));
     return HeapObject::cast(obj);
   } else {
@@ -132,10 +138,9 @@ Handle<HeapObject> RelocInfo::target_object_handle(Assembler* origin) {
   }
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(Tagged<HeapObject> target,
                                   ICacheFlushMode icache_flush_mode) {
-  DCHECK(IsCodeTarget(rmode_) || IsFullEmbeddedObject(rmode_));
+  DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
     Assembler::set_target_compressed_address_at(
         pc_, constant_pool_,
@@ -145,9 +150,6 @@ void RelocInfo::set_target_object(Heap* heap, HeapObject target,
     Assembler::set_target_address_at(pc_, constant_pool_, target.ptr(),
                                      icache_flush_mode);
   }
-  if (!instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target, write_barrier_mode);
-  }
 }
 
 Address RelocInfo::target_external_reference() {
@@ -184,7 +186,10 @@ Handle<Code> Assembler::relative_code_target_object_handle_at(
   return GetCodeTarget(code_target_index);
 }
 
-Builtin RelocInfo::target_builtin_at(Assembler* origin) { UNREACHABLE(); }
+Builtin RelocInfo::target_builtin_at(Assembler* origin) {
+  DCHECK(IsNearBuiltinEntry(rmode_));
+  return Assembler::target_builtin_at(pc_);
+}
 
 Address RelocInfo::target_off_heap_target() {
   DCHECK(IsOffHeapTarget(rmode_));
diff --git a/deps/v8/src/codegen/loong64/assembler-loong64.cc b/deps/v8/src/codegen/loong64/assembler-loong64.cc
index 58cd86a563267b..ae92d8faa2796a 100644
--- a/deps/v8/src/codegen/loong64/assembler-loong64.cc
+++ b/deps/v8/src/codegen/loong64/assembler-loong64.cc
@@ -92,6 +92,7 @@ Register ToRegister(int num) {
 // Implementation of RelocInfo.
 
 const int RelocInfo::kApplyMask =
+    RelocInfo::ModeMask(RelocInfo::NEAR_BUILTIN_ENTRY) |
     RelocInfo::ModeMask(RelocInfo::INTERNAL_REFERENCE) |
     RelocInfo::ModeMask(RelocInfo::RELATIVE_CODE_TARGET);
 
@@ -134,7 +135,7 @@ MemOperand::MemOperand(Register base, int32_t offset)
 MemOperand::MemOperand(Register base, Register index)
     : base_(base), index_(index), offset_(0) {}
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Handle<HeapObject> object;
@@ -176,8 +177,11 @@ Assembler::Assembler(const AssemblerOptions& options,
   block_buffer_growth_ = false;
 }
 
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
-                        SafepointTableBuilder* safepoint_table_builder,
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
+}
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
+                        SafepointTableBuilderBase* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
   // raw workflow to create InstructionStream objects (mostly in tests), add
@@ -2089,7 +2093,8 @@ int Assembler::RelocateInternalReference(RelocInfo::Mode rmode, Address pc,
 
 void Assembler::RelocateRelativeReference(RelocInfo::Mode rmode, Address pc,
                                           intptr_t pc_delta) {
-  DCHECK(RelocInfo::IsRelativeCodeTarget(rmode));
+  DCHECK(RelocInfo::IsRelativeCodeTarget(rmode) ||
+         RelocInfo::IsNearBuiltinEntry(rmode));
   Instr instr = instr_at(pc);
   int32_t offset = instr & kImm26Mask;
   offset = (((offset & 0x3ff) << 22 >> 6) | ((offset >> 10) & kImm16Mask)) << 2;
@@ -2115,7 +2120,7 @@ void Assembler::GrowBuffer() {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   intptr_t pc_delta = new_start - buffer_start_;
@@ -2156,26 +2161,18 @@ void Assembler::db(uint8_t data) {
   pc_ += sizeof(uint8_t);
 }
 
-void Assembler::dd(uint32_t data, RelocInfo::Mode rmode) {
+void Assembler::dd(uint32_t data) {
   if (!is_buffer_growth_blocked()) {
     CheckBuffer();
   }
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uint32_t*>(pc_) = data;
   pc_ += sizeof(uint32_t);
 }
 
-void Assembler::dq(uint64_t data, RelocInfo::Mode rmode) {
+void Assembler::dq(uint64_t data) {
   if (!is_buffer_growth_blocked()) {
     CheckBuffer();
   }
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uint64_t*>(pc_) = data;
   pc_ += sizeof(uint64_t);
 }
@@ -2199,8 +2196,7 @@ void Assembler::dd(Label* label) {
 void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data) {
   if (!ShouldRecordRelocInfo(rmode)) return;
   // We do not try to reuse pool constants.
-  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data, Code(),
-                  InstructionStream());
+  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data);
   DCHECK_GE(buffer_space(), kMaxRelocSize);  // Too late to grow buffer here.
   reloc_info_writer.Write(&rinfo);
 }
@@ -2383,35 +2379,6 @@ void Assembler::set_target_compressed_value_at(
   }
 }
 
-UseScratchRegisterScope::UseScratchRegisterScope(Assembler* assembler)
-    : available_(assembler->GetScratchRegisterList()),
-      availablefp_(assembler->GetScratchFPRegisterList()),
-      old_available_(*available_),
-      old_availablefp_(*availablefp_) {}
-
-UseScratchRegisterScope::~UseScratchRegisterScope() {
-  *available_ = old_available_;
-  *availablefp_ = old_availablefp_;
-}
-
-Register UseScratchRegisterScope::Acquire() {
-  DCHECK_NOT_NULL(available_);
-  return available_->PopFirst();
-}
-
-DoubleRegister UseScratchRegisterScope::AcquireFp() {
-  DCHECK_NOT_NULL(availablefp_);
-  return availablefp_->PopFirst();
-}
-
-bool UseScratchRegisterScope::hasAvailable() const {
-  return !available_->is_empty();
-}
-
-bool UseScratchRegisterScope::hasAvailableFp() const {
-  return !availablefp_->is_empty();
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/loong64/assembler-loong64.h b/deps/v8/src/codegen/loong64/assembler-loong64.h
index d420fcf54fae01..e90e9c712da6a9 100644
--- a/deps/v8/src/codegen/loong64/assembler-loong64.h
+++ b/deps/v8/src/codegen/loong64/assembler-loong64.h
@@ -127,13 +127,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   // GetCode emits any pending (non-emitted) code and fills the descriptor desc.
   static constexpr int kNoHandlerTable = 0;
-  static constexpr SafepointTableBuilder* kNoSafepointTable = nullptr;
-  void GetCode(Isolate* isolate, CodeDesc* desc,
-               SafepointTableBuilder* safepoint_table_builder,
+  static constexpr SafepointTableBuilderBase* kNoSafepointTable = nullptr;
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
+               SafepointTableBuilderBase* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -234,6 +236,11 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   inline Handle<Code> code_target_object_handle_at(Address pc,
                                                    Address constant_pool);
 
+  // During code generation builtin targets in PC-relative call/jump
+  // instructions are temporarily encoded as builtin ID until the generated
+  // code is moved into the code space.
+  static inline Builtin target_builtin_at(Address pc);
+
   static void set_target_value_at(
       Address pc, uint64_t target,
       ICacheFlushMode icache_flush_mode = FLUSH_ICACHE_IF_NEEDED);
@@ -247,7 +254,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // This is for calls and branches within generated code.  The serializer
   // has already deserialized the lui/ori instructions etc.
   inline static void deserialization_set_special_target_at(
-      Address instruction_payload, Code code, Address target);
+      Address instruction_payload, Tagged<Code> code, Address target);
 
   // Get the size of the special target encoded at 'instruction_payload'.
   inline static int deserialization_special_target_size(
@@ -756,11 +763,9 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Writes a single byte or word of data in the code stream.  Used for
   // inline tables, e.g., jump-tables.
   void db(uint8_t data);
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
-    dq(data, rmode);
-  }
+  void dd(uint32_t data);
+  void dq(uint64_t data);
+  void dp(uintptr_t data) { dq(data); }
   void dd(Label* label);
 
   // Postpone the generation of the trampoline pool for the specified number of
@@ -1079,14 +1084,14 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Keep track of the last Call's position to ensure that safepoint can get the
   // correct information even if there is a trampoline immediately after the
   // Call.
-  byte* pc_for_safepoint_;
+  uint8_t* pc_for_safepoint_;
 
   RegList scratch_register_list_;
 
   DoubleRegList scratch_fpregister_list_;
 
  private:
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
@@ -1103,13 +1108,28 @@ class EnsureSpace {
 
 class V8_EXPORT_PRIVATE V8_NODISCARD UseScratchRegisterScope {
  public:
-  explicit UseScratchRegisterScope(Assembler* assembler);
-  ~UseScratchRegisterScope();
+  explicit UseScratchRegisterScope(Assembler* assembler)
+      : available_(assembler->GetScratchRegisterList()),
+        availablefp_(assembler->GetScratchFPRegisterList()),
+        old_available_(*available_),
+        old_availablefp_(*availablefp_) {}
+
+  ~UseScratchRegisterScope() {
+    *available_ = old_available_;
+    *availablefp_ = old_availablefp_;
+  }
+
+  Register Acquire() {
+    return available_->PopFirst();
+  }
+
+  DoubleRegister AcquireFp() {
+    return availablefp_->PopFirst();
+  }
+
+  bool hasAvailable() const { return !available_->is_empty(); }
 
-  Register Acquire();
-  DoubleRegister AcquireFp();
-  bool hasAvailable() const;
-  bool hasAvailableFp() const;
+  bool hasAvailableFp() const { return !availablefp_->is_empty(); }
 
   void Include(const RegList& list) { *available_ |= list; }
   void IncludeFp(const DoubleRegList& list) { *availablefp_ |= list; }
diff --git a/deps/v8/src/codegen/loong64/constants-loong64.h b/deps/v8/src/codegen/loong64/constants-loong64.h
index 42c6b48a309219..df20f07307cafe 100644
--- a/deps/v8/src/codegen/loong64/constants-loong64.h
+++ b/deps/v8/src/codegen/loong64/constants-loong64.h
@@ -920,7 +920,7 @@ class Instruction : public InstructionGetters<InstructionBase> {
   // reference to an instruction is to convert a pointer. There is no way
   // to allocate or create instances of class Instruction.
   // Use the At(pc) function to create references to Instruction.
-  static Instruction* At(byte* pc) {
+  static Instruction* At(uint8_t* pc) {
     return reinterpret_cast<Instruction*>(pc);
   }
 
diff --git a/deps/v8/src/codegen/loong64/interface-descriptors-loong64-inl.h b/deps/v8/src/codegen/loong64/interface-descriptors-loong64-inl.h
index b039a5b3de61b0..3e9e9baf7e5331 100644
--- a/deps/v8/src/codegen/loong64/interface-descriptors-loong64-inl.h
+++ b/deps/v8/src/codegen/loong64/interface-descriptors-loong64-inl.h
@@ -19,6 +19,23 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  auto registers = DoubleRegisterArray(f0, f1, f2, f3, f4, f5, f6);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Padding to have as many double return registers as GP return registers.
+  auto registers = DoubleRegisterArray(kFPReturnRegister0, no_dreg, no_dreg);
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -269,12 +286,36 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  // a1 : kApiFunctionAddress
-  // a2 : kArgc
-  // a3 : kCallData
-  // a0 : kHolder
-  return RegisterArray(a1, a2, a3, a0);
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return a1;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return a2;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return a3;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return a0;
+}
+
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return a2;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return a3;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return a0;
 }
 
 // static
@@ -314,6 +355,11 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray(a0, a1);
 }
 
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(t0);
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/loong64/macro-assembler-loong64.cc b/deps/v8/src/codegen/loong64/macro-assembler-loong64.cc
index ceb2fef4d76858..61578e25bd453d 100644
--- a/deps/v8/src/codegen/loong64/macro-assembler-loong64.cc
+++ b/deps/v8/src/codegen/loong64/macro-assembler-loong64.cc
@@ -101,8 +101,24 @@ int MacroAssembler::PopCallerSaved(SaveFPRegsMode fp_mode, Register exclusion1,
 }
 
 void MacroAssembler::LoadRoot(Register destination, RootIndex index) {
+  if (V8_STATIC_ROOTS_BOOL && RootsTable::IsReadOnly(index) &&
+      is_int12(ReadOnlyRootPtr(index))) {
+    DecompressTagged(destination, ReadOnlyRootPtr(index));
+    return;
+  }
+  // Many roots have addresses that are too large to fit into addition immediate
+  // operands. Evidence suggests that the extra instruction for decompression
+  // costs us more than the load.
   Ld_d(destination, MemOperand(s6, RootRegisterOffsetForRootIndex(index)));
 }
+void MacroAssembler::LoadTaggedRoot(Register destination, RootIndex index) {
+  if (V8_STATIC_ROOTS_BOOL && RootsTable::IsReadOnly(index) &&
+      is_int12(ReadOnlyRootPtr(index))) {
+    li(destination, (int32_t)ReadOnlyRootPtr(index));
+    return;
+  }
+  Ld_w(destination, MemOperand(s6, RootRegisterOffsetForRootIndex(index)));
+}
 
 void MacroAssembler::PushCommonFrame(Register marker_reg) {
   if (marker_reg.is_valid()) {
@@ -165,6 +181,70 @@ void MacroAssembler::RecordWriteField(Register object, int offset,
   bind(&done);
 }
 
+void MacroAssembler::DecodeSandboxedPointer(Register value) {
+  ASM_CODE_COMMENT(this);
+#ifdef V8_ENABLE_SANDBOX
+  srli_d(value, value, kSandboxedPointerShift);
+  Add_d(value, value, kPtrComprCageBaseRegister);
+#else
+  UNREACHABLE();
+#endif
+}
+
+void MacroAssembler::LoadSandboxedPointerField(Register destination,
+                                               MemOperand field_operand) {
+#ifdef V8_ENABLE_SANDBOX
+  ASM_CODE_COMMENT(this);
+  Ld_d(destination, field_operand);
+  DecodeSandboxedPointer(destination);
+#else
+  UNREACHABLE();
+#endif
+}
+
+void MacroAssembler::StoreSandboxedPointerField(Register value,
+                                                MemOperand dst_field_operand) {
+#ifdef V8_ENABLE_SANDBOX
+  ASM_CODE_COMMENT(this);
+  UseScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  Sub_d(scratch, value, kPtrComprCageBaseRegister);
+  slli_d(scratch, scratch, kSandboxedPointerShift);
+  St_d(scratch, dst_field_operand);
+#else
+  UNREACHABLE();
+#endif
+}
+
+void MacroAssembler::LoadExternalPointerField(Register destination,
+                                              MemOperand field_operand,
+                                              ExternalPointerTag tag,
+                                              Register isolate_root) {
+  DCHECK(!AreAliased(destination, isolate_root));
+  ASM_CODE_COMMENT(this);
+#ifdef V8_ENABLE_SANDBOX
+  DCHECK_NE(tag, kExternalPointerNullTag);
+  DCHECK(!IsSharedExternalPointerType(tag));
+  UseScratchRegisterScope temps(this);
+  Register external_table = temps.Acquire();
+  if (isolate_root == no_reg) {
+    DCHECK(root_array_available_);
+    isolate_root = kRootRegister;
+  }
+  Ld_d(external_table,
+       MemOperand(isolate_root,
+                  IsolateData::external_pointer_table_offset() +
+                      Internals::kExternalPointerTableBasePointerOffset));
+  Ld_wu(destination, field_operand);
+  srli_d(destination, destination, kExternalPointerIndexShift);
+  slli_d(destination, destination, kExternalPointerTableEntrySizeLog2);
+  Ld_d(destination, MemOperand(external_table, destination));
+  And(destination, destination, Operand(~tag));
+#else
+  Ld_d(destination, field_operand);
+#endif  // V8_ENABLE_SANDBOX
+}
+
 void MacroAssembler::MaybeSaveRegisters(RegList registers) {
   if (registers.is_empty()) return;
   MultiPush(registers);
@@ -350,7 +430,7 @@ void MacroAssembler::Add_d(Register rd, Register rj, const Operand& rk) {
     } else {
       // li handles the relocation.
       UseScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
       DCHECK(rj != scratch);
       li(scratch, rk);
       add_d(rd, rj, scratch);
@@ -727,13 +807,17 @@ void MacroAssembler::Sle(Register rd, Register rj, const Operand& rk) {
   if (rk.is_reg()) {
     slt(rd, rk.rm(), rj);
   } else {
-    // li handles the relocation.
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
-    BlockTrampolinePoolScope block_trampoline_pool(this);
-    DCHECK(rj != scratch);
-    li(scratch, rk);
-    slt(rd, scratch, rj);
+    if (rk.immediate() == 0 && !MustUseReg(rk.rmode())) {
+      slt(rd, zero_reg, rj);
+    } else {
+      // li handles the relocation.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
+      BlockTrampolinePoolScope block_trampoline_pool(this);
+      DCHECK(rj != scratch);
+      li(scratch, rk);
+      slt(rd, scratch, rj);
+    }
   }
   xori(rd, rd, 1);
 }
@@ -742,13 +826,17 @@ void MacroAssembler::Sleu(Register rd, Register rj, const Operand& rk) {
   if (rk.is_reg()) {
     sltu(rd, rk.rm(), rj);
   } else {
-    // li handles the relocation.
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
-    BlockTrampolinePoolScope block_trampoline_pool(this);
-    DCHECK(rj != scratch);
-    li(scratch, rk);
-    sltu(rd, scratch, rj);
+    if (rk.immediate() == 0 && !MustUseReg(rk.rmode())) {
+      sltu(rd, zero_reg, rj);
+    } else {
+      // li handles the relocation.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
+      BlockTrampolinePoolScope block_trampoline_pool(this);
+      DCHECK(rj != scratch);
+      li(scratch, rk);
+      sltu(rd, scratch, rj);
+    }
   }
   xori(rd, rd, 1);
 }
@@ -767,13 +855,17 @@ void MacroAssembler::Sgt(Register rd, Register rj, const Operand& rk) {
   if (rk.is_reg()) {
     slt(rd, rk.rm(), rj);
   } else {
-    // li handles the relocation.
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
-    BlockTrampolinePoolScope block_trampoline_pool(this);
-    DCHECK(rj != scratch);
-    li(scratch, rk);
-    slt(rd, scratch, rj);
+    if (rk.immediate() == 0 && !MustUseReg(rk.rmode())) {
+      slt(rd, zero_reg, rj);
+    } else {
+      // li handles the relocation.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
+      BlockTrampolinePoolScope block_trampoline_pool(this);
+      DCHECK(rj != scratch);
+      li(scratch, rk);
+      slt(rd, scratch, rj);
+    }
   }
 }
 
@@ -781,13 +873,17 @@ void MacroAssembler::Sgtu(Register rd, Register rj, const Operand& rk) {
   if (rk.is_reg()) {
     sltu(rd, rk.rm(), rj);
   } else {
-    // li handles the relocation.
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
-    BlockTrampolinePoolScope block_trampoline_pool(this);
-    DCHECK(rj != scratch);
-    li(scratch, rk);
-    sltu(rd, scratch, rj);
+    if (rk.immediate() == 0 && !MustUseReg(rk.rmode())) {
+      sltu(rd, zero_reg, rj);
+    } else {
+      // li handles the relocation.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
+      BlockTrampolinePoolScope block_trampoline_pool(this);
+      DCHECK(rj != scratch);
+      li(scratch, rk);
+      sltu(rd, scratch, rj);
+    }
   }
 }
 
@@ -1910,90 +2006,6 @@ void MacroAssembler::Movn(Register rd, Register rj, Register rk) {
   or_(rd, rd, scratch);
 }
 
-void MacroAssembler::LoadZeroOnCondition(Register rd, Register rj,
-                                         const Operand& rk, Condition cond) {
-  BlockTrampolinePoolScope block_trampoline_pool(this);
-  switch (cond) {
-    case cc_always:
-      mov(rd, zero_reg);
-      break;
-    case eq:
-      if (rj == zero_reg) {
-        if (rk.is_reg()) {
-          LoadZeroIfConditionZero(rd, rk.rm());
-        } else if (rk.immediate() == 0) {
-          mov(rd, zero_reg);
-        }
-      } else if (IsZero(rk)) {
-        LoadZeroIfConditionZero(rd, rj);
-      } else {
-        Sub_d(t7, rj, rk);
-        LoadZeroIfConditionZero(rd, t7);
-      }
-      break;
-    case ne:
-      if (rj == zero_reg) {
-        if (rk.is_reg()) {
-          LoadZeroIfConditionNotZero(rd, rk.rm());
-        } else if (rk.immediate() != 0) {
-          mov(rd, zero_reg);
-        }
-      } else if (IsZero(rk)) {
-        LoadZeroIfConditionNotZero(rd, rj);
-      } else {
-        Sub_d(t7, rj, rk);
-        LoadZeroIfConditionNotZero(rd, t7);
-      }
-      break;
-
-    // Signed comparison.
-    case greater:
-      Sgt(t7, rj, rk);
-      LoadZeroIfConditionNotZero(rd, t7);
-      break;
-    case greater_equal:
-      Sge(t7, rj, rk);
-      LoadZeroIfConditionNotZero(rd, t7);
-      // rj >= rk
-      break;
-    case less:
-      Slt(t7, rj, rk);
-      LoadZeroIfConditionNotZero(rd, t7);
-      // rj < rk
-      break;
-    case less_equal:
-      Sle(t7, rj, rk);
-      LoadZeroIfConditionNotZero(rd, t7);
-      // rj <= rk
-      break;
-
-    // Unsigned comparison.
-    case Ugreater:
-      Sgtu(t7, rj, rk);
-      LoadZeroIfConditionNotZero(rd, t7);
-      // rj > rk
-      break;
-
-    case Ugreater_equal:
-      Sgeu(t7, rj, rk);
-      LoadZeroIfConditionNotZero(rd, t7);
-      // rj >= rk
-      break;
-    case Uless:
-      Sltu(t7, rj, rk);
-      LoadZeroIfConditionNotZero(rd, t7);
-      // rj < rk
-      break;
-    case Uless_equal:
-      Sleu(t7, rj, rk);
-      LoadZeroIfConditionNotZero(rd, t7);
-      // rj <= rk
-      break;
-    default:
-      UNREACHABLE();
-  }  // namespace internal
-}  // namespace internal
-
 void MacroAssembler::LoadZeroIfConditionNotZero(Register dest,
                                                 Register condition) {
   masknez(dest, dest, condition);
@@ -2182,6 +2194,72 @@ void MacroAssembler::TruncateDoubleToI(Isolate* isolate, Zone* zone,
   bind(&done);
 }
 
+void MacroAssembler::CompareWord(Condition cond, Register dst, Register lhs,
+                                 const Operand& rhs) {
+  switch (cond) {
+    case eq:
+    case ne: {
+      if (rhs.IsImmediate()) {
+        if (rhs.immediate() == 0) {
+          if (cond == eq) {
+            Sltu(dst, lhs, 1);
+          } else {
+            Sltu(dst, zero_reg, lhs);
+          }
+        } else if (is_int12(-rhs.immediate())) {
+          Add_d(dst, lhs, Operand(-rhs.immediate()));
+          if (cond == eq) {
+            Sltu(dst, dst, 1);
+          } else {
+            Sltu(dst, zero_reg, dst);
+          }
+        } else {
+          Xor(dst, lhs, rhs);
+          if (cond == eq) {
+            Sltu(dst, dst, 1);
+          } else {
+            Sltu(dst, zero_reg, dst);
+          }
+        }
+      } else {
+        Xor(dst, lhs, rhs);
+        if (cond == eq) {
+          Sltu(dst, dst, 1);
+        } else {
+          Sltu(dst, zero_reg, dst);
+        }
+      }
+      break;
+    }
+    case lt:
+      Slt(dst, lhs, rhs);
+      break;
+    case gt:
+      Sgt(dst, lhs, rhs);
+      break;
+    case le:
+      Sle(dst, lhs, rhs);
+      break;
+    case ge:
+      Sge(dst, lhs, rhs);
+      break;
+    case lo:
+      Sltu(dst, lhs, rhs);
+      break;
+    case hs:
+      Sgeu(dst, lhs, rhs);
+      break;
+    case hi:
+      Sgtu(dst, lhs, rhs);
+      break;
+    case ls:
+      Sleu(dst, lhs, rhs);
+      break;
+    default:
+      UNREACHABLE();
+  }
+}
+
 // BRANCH_ARGS_CHECK checks that conditional jump arguments are correct.
 #define BRANCH_ARGS_CHECK(cond, rj, rk)                                  \
   DCHECK((cond == cc_always && rj == zero_reg && rk.rm() == zero_reg) || \
@@ -2229,11 +2307,21 @@ void MacroAssembler::Branch(Label* L, Condition cond, Register rj,
 }
 
 void MacroAssembler::Branch(Label* L, Condition cond, Register rj,
-                            RootIndex index) {
+                            RootIndex index, bool need_sign_extend) {
   UseScratchRegisterScope temps(this);
-  Register scratch = temps.Acquire();
-  LoadRoot(scratch, index);
-  CompareTaggedAndBranch(L, cond, rj, Operand(scratch));
+  Register right = temps.Acquire();
+  if (COMPRESS_POINTERS_BOOL) {
+    Register left = rj;
+    if (need_sign_extend) {
+      left = temps.hasAvailable() ? temps.Acquire() : t8;
+      slli_w(left, rj, 0);
+    }
+    LoadTaggedRoot(right, index);
+    Branch(L, cond, left, Operand(right));
+  } else {
+    LoadRoot(right, index);
+    Branch(L, cond, rj, Operand(right));
+  }
 }
 
 int32_t MacroAssembler::GetOffset(Label* L, OffsetSize bits) {
@@ -2557,12 +2645,14 @@ MemOperand MacroAssembler::ExternalReferenceAsOperand(
       return MemOperand(kRootRegister, static_cast<int32_t>(offset));
     } else {
       // Otherwise, do a memory load from the external reference table.
+      DCHECK(scratch.is_valid());
       Ld_d(scratch, MemOperand(kRootRegister,
                                RootRegisterOffsetForExternalReferenceTableEntry(
                                    isolate(), reference)));
       return MemOperand(scratch, 0);
     }
   }
+  DCHECK(scratch.is_valid());
   li(scratch, reference);
   return MemOperand(scratch, 0);
 }
@@ -2690,18 +2780,17 @@ void MacroAssembler::Call(Handle<Code> code, RelocInfo::Mode rmode,
   Call(static_cast<Address>(target_index), rmode, cond, rj, rk);
 }
 
-void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
+void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index,
+                                               Register target) {
   ASM_CODE_COMMENT(this);
   static_assert(kSystemPointerSize == 8);
   static_assert(kSmiTagSize == 1);
   static_assert(kSmiTag == 0);
 
   // The builtin_index register contains the builtin index as a Smi.
-  SmiUntag(builtin_index, builtin_index);
-  Alsl_d(builtin_index, builtin_index, kRootRegister, kSystemPointerSizeLog2,
-         t7);
-  Ld_d(builtin_index,
-       MemOperand(builtin_index, IsolateData::builtin_entry_table_offset()));
+  SmiUntag(target, builtin_index);
+  Alsl_d(target, target, kRootRegister, kSystemPointerSizeLog2, t7);
+  Ld_d(target, MemOperand(target, IsolateData::builtin_entry_table_offset()));
 }
 
 void MacroAssembler::LoadEntryFromBuiltin(Builtin builtin,
@@ -2714,11 +2803,13 @@ MemOperand MacroAssembler::EntryFromBuiltinAsOperand(Builtin builtin) {
                     IsolateData::BuiltinEntrySlotOffset(builtin));
 }
 
-void MacroAssembler::CallBuiltinByIndex(Register builtin_index) {
+void MacroAssembler::CallBuiltinByIndex(Register builtin_index,
+                                        Register target) {
   ASM_CODE_COMMENT(this);
-  LoadEntryFromBuiltinIndex(builtin_index);
-  Call(builtin_index);
+  LoadEntryFromBuiltinIndex(builtin_index, target);
+  Call(target);
 }
+
 void MacroAssembler::CallBuiltin(Builtin builtin) {
   ASM_CODE_COMMENT_STRING(this, CommentForOffHeapTrampoline("call", builtin));
   UseScratchRegisterScope temps(this);
@@ -2729,6 +2820,12 @@ void MacroAssembler::CallBuiltin(Builtin builtin) {
       Call(temp);
       break;
     }
+    case BuiltinCallJumpMode::kPCRelative: {
+      RecordRelocInfo(RelocInfo::NEAR_BUILTIN_ENTRY);
+      bl(static_cast<int>(builtin));
+      set_pc_for_safepoint();
+      break;
+    }
     case BuiltinCallJumpMode::kIndirect: {
       LoadEntryFromBuiltin(builtin, temp);
       Call(temp);
@@ -2747,9 +2844,6 @@ void MacroAssembler::CallBuiltin(Builtin builtin) {
       }
       break;
     }
-    case BuiltinCallJumpMode::kPCRelative:
-      // Short builtin calls is unsupported in loongarch64.
-      UNREACHABLE();
   }
 }
 
@@ -2770,6 +2864,12 @@ void MacroAssembler::TailCallBuiltin(Builtin builtin) {
       Jump(temp);
       break;
     }
+    case BuiltinCallJumpMode::kPCRelative: {
+      RecordRelocInfo(RelocInfo::NEAR_BUILTIN_ENTRY);
+      b(static_cast<int>(builtin));
+      set_pc_for_safepoint();
+      break;
+    }
     case BuiltinCallJumpMode::kForMksnapshot: {
       if (options().use_pc_relative_calls_and_jumps_for_mksnapshot) {
         Handle<Code> code = isolate()->builtins()->code_handle(builtin);
@@ -2782,24 +2882,9 @@ void MacroAssembler::TailCallBuiltin(Builtin builtin) {
       }
       break;
     }
-    case BuiltinCallJumpMode::kPCRelative:
-      UNREACHABLE();
   }
 }
 
-void MacroAssembler::PatchAndJump(Address target) {
-  ASM_CODE_COMMENT(this);
-  UseScratchRegisterScope temps(this);
-  Register scratch = temps.Acquire();
-  pcaddi(scratch, 4);
-  Ld_d(t7, MemOperand(scratch, 0));
-  jirl(zero_reg, t7, 0);
-  nop();
-  DCHECK_EQ(reinterpret_cast<uint64_t>(pc_) % 8, 0);
-  *reinterpret_cast<uint64_t*>(pc_) = target;  // pc_ should be align.
-  pc_ += sizeof(uint64_t);
-}
-
 void MacroAssembler::StoreReturnAddressAndCall(Register target) {
   ASM_CODE_COMMENT(this);
   // This generates the final instruction sequence for calls to C functions
@@ -3024,8 +3109,7 @@ void MacroAssembler::StackOverflowCheck(Register num_args, Register scratch1,
 void MacroAssembler::TestCodeIsMarkedForDeoptimizationAndJump(
     Register code_data_container, Register scratch, Condition cond,
     Label* target) {
-  Ld_hu(scratch,
-        FieldMemOperand(code_data_container, Code::kKindSpecificFlagsOffset));
+  Ld_wu(scratch, FieldMemOperand(code_data_container, Code::kFlagsOffset));
   And(scratch, scratch, Operand(1 << Code::kMarkedForDeoptimizationBit));
   Branch(target, cond, scratch, Operand(zero_reg));
 }
@@ -3103,7 +3187,7 @@ void MacroAssembler::CallDebugOnFunctionCall(Register fun, Register new_target,
                                              Register expected_parameter_count,
                                              Register actual_parameter_count) {
   // Load receiver to pass it later to DebugOnFunctionCall hook.
-  LoadReceiver(t0, actual_parameter_count);
+  LoadReceiver(t0);
   FrameScope frame(
       this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
 
@@ -3161,14 +3245,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // We call indirectly through the code field in the function to
   // allow recompilation to take effect without changing any of the
   // call sites.
-  Register code = kJavaScriptCallCodeStartRegister;
-  LoadTaggedField(code, FieldMemOperand(function, JSFunction::kCodeOffset));
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(code);
+      CallJSFunction(function);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(code);
+      JumpJSFunction(function);
       break;
   }
 
@@ -3239,7 +3321,9 @@ void MacroAssembler::GetInstanceTypeRange(Register map, Register type_reg,
                                           InstanceType lower_limit,
                                           Register range) {
   Ld_hu(type_reg, FieldMemOperand(map, Map::kInstanceTypeOffset));
-  Sub_d(range, type_reg, Operand(lower_limit));
+  if (lower_limit != 0 || type_reg != range) {
+    Sub_d(range, type_reg, Operand(lower_limit));
+  }
 }
 
 // -----------------------------------------------------------------------------
@@ -3529,6 +3613,11 @@ void MacroAssembler::LoadMap(Register destination, Register object) {
   LoadTaggedField(destination, FieldMemOperand(object, HeapObject::kMapOffset));
 }
 
+void MacroAssembler::LoadCompressedMap(Register dst, Register object) {
+  ASM_CODE_COMMENT(this);
+  Ld_w(dst, FieldMemOperand(object, HeapObject::kMapOffset));
+}
+
 void MacroAssembler::LoadNativeContextSlot(Register dst, int index) {
   LoadMap(dst, cp);
   LoadTaggedField(
@@ -3572,7 +3661,8 @@ void MacroAssembler::EnterExitFrame(int stack_space,
                                     StackFrame::Type frame_type) {
   ASM_CODE_COMMENT(this);
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
 
   // Set up the frame structure on the stack.
   static_assert(2 * kSystemPointerSize ==
@@ -3725,6 +3815,66 @@ void MacroAssembler::JumpIfNotSmi(Register value, Label* not_smi_label) {
   Branch(not_smi_label, ne, scratch, Operand(zero_reg));
 }
 
+void MacroAssembler::JumpIfObjectType(Label* target, Condition cc,
+                                      Register object,
+                                      InstanceType instance_type,
+                                      Register scratch) {
+  DCHECK(cc == eq || cc == ne);
+  UseScratchRegisterScope temps(this);
+  if (scratch == no_reg) {
+    scratch = temps.Acquire();
+  }
+  if (V8_STATIC_ROOTS_BOOL) {
+    if (base::Optional<RootIndex> expected =
+            InstanceTypeChecker::UniqueMapOfInstanceType(instance_type)) {
+      Tagged_t ptr = ReadOnlyRootPtr(*expected);
+      LoadCompressedMap(scratch, object);
+      Branch(target, cc, scratch, Operand(ptr));
+      return;
+    }
+  }
+  GetObjectType(object, scratch, scratch);
+  Branch(target, cc, scratch, Operand(instance_type));
+}
+
+void MacroAssembler::JumpIfJSAnyIsNotPrimitive(Register heap_object,
+                                               Register scratch, Label* target,
+                                               Label::Distance distance,
+                                               Condition cc) {
+  CHECK(cc == Condition::kUnsignedLessThan ||
+        cc == Condition::kUnsignedGreaterThanEqual);
+  if (V8_STATIC_ROOTS_BOOL) {
+#ifdef DEBUG
+    Label ok;
+    LoadMap(scratch, heap_object);
+    GetInstanceTypeRange(scratch, scratch, FIRST_JS_RECEIVER_TYPE, scratch);
+    Branch(&ok, Condition::kUnsignedLessThanEqual, scratch,
+           Operand(LAST_JS_RECEIVER_TYPE - FIRST_JS_RECEIVER_TYPE));
+
+    LoadMap(scratch, heap_object);
+    GetInstanceTypeRange(scratch, scratch, FIRST_PRIMITIVE_HEAP_OBJECT_TYPE,
+                         scratch);
+    Branch(&ok, Condition::kUnsignedLessThanEqual, scratch,
+           Operand(LAST_PRIMITIVE_HEAP_OBJECT_TYPE -
+                   FIRST_PRIMITIVE_HEAP_OBJECT_TYPE));
+
+    Abort(AbortReason::kInvalidReceiver);
+    bind(&ok);
+#endif  // DEBUG
+
+    // All primitive object's maps are allocated at the start of the read only
+    // heap. Thus JS_RECEIVER's must have maps with larger (compressed)
+    // addresses.
+    LoadCompressedMap(scratch, heap_object);
+    Branch(target, cc, scratch,
+           Operand(InstanceTypeChecker::kNonJsReceiverMapLimit));
+  } else {
+    static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
+    GetObjectType(heap_object, scratch, scratch);
+    Branch(target, cc, scratch, Operand(FIRST_JS_RECEIVER_TYPE));
+  }
+}
+
 #ifdef V8_ENABLE_DEBUG_CODE
 
 void MacroAssembler::Assert(Condition cc, AbortReason reason, Register rs,
@@ -3732,6 +3882,38 @@ void MacroAssembler::Assert(Condition cc, AbortReason reason, Register rs,
   if (v8_flags.debug_code) Check(cc, reason, rs, rk);
 }
 
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 Register tmp, AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp, tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok);
+
+  GetObjectType(object, map_tmp, tmp);
+
+  Branch(&ok, kUnsignedLessThanEqual, tmp, Operand(LAST_NAME_TYPE));
+
+  Branch(&ok, kUnsignedGreaterThanEqual, tmp, Operand(FIRST_JS_RECEIVER_TYPE));
+
+  Branch(&ok, kEqual, map_tmp, RootIndex::kHeapNumberMap);
+
+  Branch(&ok, kEqual, map_tmp, RootIndex::kBigIntMap);
+
+  Branch(&ok, kEqual, object, RootIndex::kUndefinedValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kTrueValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kFalseValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kNullValue);
+
+  Abort(abort_reason);
+  bind(&ok);
+}
+
 void MacroAssembler::AssertNotSmi(Register object) {
   if (v8_flags.debug_code) {
     ASM_CODE_COMMENT(this);
@@ -4179,16 +4361,17 @@ void MacroAssembler::CallForDeoptimization(Builtin target, int, Label* exit,
                                             : Deoptimizer::kEagerDeoptExitSize);
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination,
-                                   Register code_data_container_object) {
+void MacroAssembler::LoadCodeInstructionStart(
+    Register destination, Register code_data_container_object) {
   ASM_CODE_COMMENT(this);
   Ld_d(destination, FieldMemOperand(code_data_container_object,
-                                    Code::kCodeEntryPointOffset));
+                                    Code::kInstructionStartOffset));
 }
 
 void MacroAssembler::CallCodeObject(Register code_data_container_object) {
   ASM_CODE_COMMENT(this);
-  LoadCodeEntry(code_data_container_object, code_data_container_object);
+  LoadCodeInstructionStart(code_data_container_object,
+                           code_data_container_object);
   Call(code_data_container_object);
 }
 
@@ -4196,10 +4379,26 @@ void MacroAssembler::JumpCodeObject(Register code_data_container_object,
                                     JumpMode jump_mode) {
   ASM_CODE_COMMENT(this);
   DCHECK_EQ(JumpMode::kJump, jump_mode);
-  LoadCodeEntry(code_data_container_object, code_data_container_object);
+  LoadCodeInstructionStart(code_data_container_object,
+                           code_data_container_object);
   Jump(code_data_container_object);
 }
 
+void MacroAssembler::CallJSFunction(Register function_object) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  LoadTaggedField(code,
+                  FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  CallCodeObject(code);
+}
+
+void MacroAssembler::JumpJSFunction(Register function_object,
+                                    JumpMode jump_mode) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  LoadTaggedField(code,
+                  FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  JumpCodeObject(code, jump_mode);
+}
+
 namespace {
 
 void TailCallOptimizedCodeSlot(MacroAssembler* masm,
@@ -4231,7 +4430,7 @@ void TailCallOptimizedCodeSlot(MacroAssembler* masm,
   __ ReplaceClosureCodeWithOptimizedCode(optimized_code_entry, closure);
 
   static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-  __ LoadCodeEntry(a2, optimized_code_entry);
+  __ LoadCodeInstructionStart(a2, optimized_code_entry);
   __ Jump(a2);
 
   // Optimized code slot contains deoptimized code or code is cleared and
@@ -4281,7 +4480,7 @@ void MacroAssembler::GenerateTailCallToReturnedCode(
          kJavaScriptCallArgCountRegister, kJavaScriptCallTargetRegister);
 
     CallRuntime(function_id, 1);
-    LoadCodeEntry(a2, a0);
+    LoadCodeInstructionStart(a2, a0);
     // Restore target function, new target and actual argument count.
     Pop(kJavaScriptCallTargetRegister, kJavaScriptCallNewTargetRegister,
         kJavaScriptCallArgCountRegister);
@@ -4411,6 +4610,11 @@ void MacroAssembler::DecompressTagged(Register dst, Register src) {
   Add_d(dst, kPtrComprCageBaseRegister, Operand(dst));
 }
 
+void MacroAssembler::DecompressTagged(Register dst, Tagged_t immediate) {
+  ASM_CODE_COMMENT(this);
+  Add_d(dst, kPtrComprCageBaseRegister, static_cast<int32_t>(immediate));
+}
+
 void MacroAssembler::AtomicDecompressTaggedSigned(Register dst,
                                                   const MemOperand& src) {
   ASM_CODE_COMMENT(this);
@@ -4430,6 +4634,173 @@ void MacroAssembler::AtomicDecompressTagged(Register dst,
   Add_d(dst, kPtrComprCageBaseRegister, dst);
 }
 
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand) {
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  Register return_value = a0;
+  Register scratch = a4;
+  Register scratch2 = a5;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = s0;
+  Register prev_limit_reg = s1;
+  Register prev_level_reg = s2;
+
+  // C arguments (arg_reg_1/2) are expected to be initialized outside, so this
+  // function must not corrupt them (return_value overlaps with arg_reg_1 but
+  // that's ok because we start using it only after the C call).
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2,  // C args
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ Ld_d(prev_next_address_reg, next_mem_op);
+    __ Ld_d(prev_limit_reg, limit_mem_op);
+    __ Ld_w(prev_level_reg, level_mem_op);
+    __ Add_w(scratch, prev_level_reg, Operand(1));
+    __ St_w(scratch, level_mem_op);
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ Ld_b(scratch, __ ExternalReferenceAsOperand(
+                         ER::execution_mode_address(isolate), no_reg));
+    __ Branch(&profiler_or_side_effects_check_enabled, ne, scratch,
+              Operand(zero_reg));
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ li(scratch, ER::address_of_runtime_stats_flag());
+    __ Ld_w(scratch, MemOperand(scratch, 0));
+    __ Branch(&profiler_or_side_effects_check_enabled, ne, scratch,
+              Operand(zero_reg));
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ StoreReturnAddressAndCall(function_address);
+  __ bind(&done_api_call);
+
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  __ RecordComment("Load the value from ReturnValue");
+  __ Ld_d(return_value, return_value_operand);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ St_d(prev_next_address_reg, next_mem_op);
+    if (v8_flags.debug_code) {
+      __ Ld_w(scratch, level_mem_op);
+      __ Sub_w(scratch, scratch, Operand(1));
+      __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall, scratch,
+               Operand(prev_level_reg));
+    }
+    __ St_w(prev_level_reg, level_mem_op);
+    __ Ld_d(scratch, limit_mem_op);
+    __ Branch(&delete_allocated_handles, ne, prev_limit_reg, Operand(scratch));
+  }
+
+  __ RecordComment("Leave the API exit frame.");
+  __ bind(&leave_exit_frame);
+
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand == nullptr) {
+    DCHECK_NE(stack_space, 0);
+    __ li(stack_space_reg, Operand(stack_space));
+  } else {
+    DCHECK_EQ(stack_space, 0);
+    __ Ld_d(stack_space_reg, *stack_space_operand);
+  }
+
+  static constexpr bool kRegisterContainsSlotCount = false;
+  __ LeaveExitFrame(stack_space_reg, NO_EMIT_RETURN,
+                    kRegisterContainsSlotCount);
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ LoadRoot(scratch, RootIndex::kTheHoleValue);
+    __ Ld_d(scratch2, __ ExternalReferenceAsOperand(
+                          ER::scheduled_exception_address(isolate), no_reg));
+    __ Branch(&promote_scheduled_exception, ne, scratch, Operand(scratch2));
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ Branch(&finish_return, ne, return_value, RootIndex::kTheHoleValue);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch, scratch2,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  __ Ret();
+
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via thunk wrapper.");
+    __ bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback function.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ St_d(thunk_arg, thunk_arg_mem_op);
+    __ li(scratch, thunk_ref);
+    __ StoreReturnAddressAndCall(scratch);
+    __ Branch(&done_api_call);
+  }
+
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ bind(&delete_allocated_handles);
+    __ St_d(prev_limit_reg, limit_mem_op);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ mov(saved_result, a0);
+    __ PrepareCallCFunction(1, prev_level_reg);
+    __ li(arg_reg_1, ER::isolate_address(isolate));
+    __ CallCFunction(ER::delete_handle_scope_extensions(), 1);
+    __ mov(arg_reg_1, saved_result);
+    __ jmp(&leave_exit_frame);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/loong64/macro-assembler-loong64.h b/deps/v8/src/codegen/loong64/macro-assembler-loong64.h
index 4930ef6c509024..5472eba34ad59b 100644
--- a/deps/v8/src/codegen/loong64/macro-assembler-loong64.h
+++ b/deps/v8/src/codegen/loong64/macro-assembler-loong64.h
@@ -12,6 +12,7 @@
 #include "src/codegen/assembler.h"
 #include "src/codegen/loong64/assembler-loong64.h"
 #include "src/common/globals.h"
+#include "src/execution/frame-constants.h"
 #include "src/execution/isolate-data.h"
 #include "src/objects/tagged-index.h"
 
@@ -88,7 +89,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
     ExternalReference isolate_root = ExternalReference::isolate_root(isolate());
     li(kRootRegister, Operand(isolate_root));
 #ifdef V8_COMPRESS_POINTERS
-    LoadRootRelative(kPtrComprCageBaseRegister, IsolateData::cage_base_offset());
+    LoadRootRelative(kPtrComprCageBaseRegister,
+                     IsolateData::cage_base_offset());
 #endif
   }
 
@@ -107,18 +109,24 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void Assert(Condition cc, AbortReason reason, Register rj,
               Operand rk) NOOP_UNLESS_DEBUG_CODE;
 
+  void AssertJSAny(Register object, Register map_tmp, Register tmp,
+                   AbortReason abort_reason) NOOP_UNLESS_DEBUG_CODE;
+
   // Like Assert(), but always enabled.
   void Check(Condition cc, AbortReason reason, Register rj, Operand rk);
 
   // Print a message to stdout and abort execution.
   void Abort(AbortReason msg);
 
+  void CompareWord(Condition cond, Register dst, Register lhs,
+                   const Operand& rhs);
   void Branch(Label* label, bool need_link = false);
   void Branch(Label* label, Condition cond, Register r1, const Operand& r2,
               bool need_link = false);
   void BranchShort(Label* label, Condition cond, Register r1, const Operand& r2,
                    bool need_link = false);
-  void Branch(Label* L, Condition cond, Register rj, RootIndex index);
+  void Branch(Label* L, Condition cond, Register rj, RootIndex index,
+              bool need_sign_extend = true);
 
   void CompareTaggedAndBranch(Label* label, Condition cond, Register r1,
                               const Operand& r2, bool need_link = false);
@@ -193,10 +201,6 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void Jump(Register target, COND_ARGS);
   void Jump(intptr_t target, RelocInfo::Mode rmode, COND_ARGS);
   void Jump(Address target, RelocInfo::Mode rmode, COND_ARGS);
-  // Deffer from li, this method save target to the memory, and then load
-  // it to register use ld_d, it can be used in wasm jump table for concurrent
-  // patching.
-  void PatchAndJump(Address target);
   void Jump(Handle<Code> code, RelocInfo::Mode rmode, COND_ARGS);
   void Jump(const ExternalReference& reference);
   void Call(Register target, COND_ARGS);
@@ -205,22 +209,27 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
             COND_ARGS);
   void Call(Label* target);
 
-  // Load the builtin given by the Smi in |builtin_index| into the same
-  // register.
-  void LoadEntryFromBuiltinIndex(Register builtin);
+  // Load the builtin given by the Smi in |builtin_index| into |target|.
+  void LoadEntryFromBuiltinIndex(Register builtin_index, Register target);
   void LoadEntryFromBuiltin(Builtin builtin, Register destination);
   MemOperand EntryFromBuiltinAsOperand(Builtin builtin);
 
-  void CallBuiltinByIndex(Register builtin);
+  void CallBuiltinByIndex(Register builtin_index, Register target);
   void CallBuiltin(Builtin builtin);
   void TailCallBuiltin(Builtin builtin);
 
   // Load the code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_data_container_object);
+  void LoadCodeInstructionStart(Register destination,
+                                Register code_data_container_object);
   void CallCodeObject(Register code_data_container_object);
   void JumpCodeObject(Register code_data_container_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object);
+  void JumpJSFunction(Register function_object,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   // Generates an instruction sequence s.t. the return address points to the
   // instruction following the call.
   // The return address on the stack is used by frame iteration.
@@ -546,8 +555,6 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void LoadZeroIfConditionNotZero(Register dest, Register condition);
   void LoadZeroIfConditionZero(Register dest, Register condition);
-  void LoadZeroOnCondition(Register rd, Register rj, const Operand& rk,
-                           Condition cond);
 
   void Clz_w(Register rd, Register rj);
   void Clz_d(Register rd, Register rj);
@@ -686,8 +693,10 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void LoadRoot(Register destination, RootIndex index) final;
   void LoadRoot(Register destination, RootIndex index, Condition cond,
                 Register src1, const Operand& src2);
+  void LoadTaggedRoot(Register destination, RootIndex index);
 
   void LoadMap(Register destination, Register object);
+  void LoadCompressedMap(Register dst, Register object);
 
   // If the value is a NaN, canonicalize the value else, do nothing.
   void FPUCanonicalizeNaN(const DoubleRegister dst, const DoubleRegister src);
@@ -809,10 +818,28 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void DecompressTaggedSigned(Register dst, const MemOperand& src);
   void DecompressTagged(Register dst, const MemOperand& src);
   void DecompressTagged(Register dst, Register src);
+  void DecompressTagged(Register dst, Tagged_t immediate);
 
   void AtomicDecompressTaggedSigned(Register dst, const MemOperand& src);
   void AtomicDecompressTagged(Register dst, const MemOperand& src);
 
+  // ---------------------------------------------------------------------------
+  // V8 Sandbox support
+
+  // Transform a SandboxedPointer from/to its encoded form, which is used when
+  // the pointer is stored on the heap and ensures that the pointer will always
+  // point into the sandbox.
+  void DecodeSandboxedPointer(Register value);
+  void LoadSandboxedPointerField(Register destination,
+                                 MemOperand field_operand);
+  void StoreSandboxedPointerField(Register value, MemOperand dst_field_operand);
+
+  // Loads a field containing off-heap pointer and does necessary decoding
+  // if sandboxed external pointers are enabled.
+  void LoadExternalPointerField(Register destination, MemOperand field_operand,
+                                ExternalPointerTag tag,
+                                Register isolate_root = no_reg);
+
   // Performs a truncating conversion of a floating point number as used by
   // the JS bitwise operations. See ECMA-262 9.5: ToInt32. Goes to 'done' if it
   // succeeds, otherwise falls through if result is saturated. On return
@@ -821,16 +848,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
                                   Label* done);
 
   // It assumes that the arguments are located below the stack pointer.
-  // argc is the number of arguments not including the receiver.
-  // TODO(LOONG_dev): LOONG64: Remove this function once we stick with the
-  // reversed arguments order.
-  void LoadReceiver(Register dest, Register argc) {
-    Ld_d(dest, MemOperand(sp, 0));
-  }
-
-  void StoreReceiver(Register rec, Register argc, Register scratch) {
-    St_d(rec, MemOperand(sp, 0));
-  }
+  void LoadReceiver(Register dest) { Ld_d(dest, MemOperand(sp, 0)); }
+  void StoreReceiver(Register rec) { St_d(rec, MemOperand(sp, 0)); }
 
   bool IsNear(Label* L, Condition cond, int rs_reg);
 
@@ -852,18 +871,12 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   // Compare the object in a register to a value and jump if they are equal.
   void JumpIfRoot(Register with, RootIndex index, Label* if_equal) {
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.Acquire();
-    LoadRoot(scratch, index);
-    CompareTaggedAndBranch(if_equal, eq, with, Operand(scratch));
+    Branch(if_equal, eq, with, index);
   }
 
   // Compare the object in a register to a value and jump if they are not equal.
   void JumpIfNotRoot(Register with, RootIndex index, Label* if_not_equal) {
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.Acquire();
-    LoadRoot(scratch, index);
-    CompareTaggedAndBranch(if_not_equal, ne, with, Operand(scratch));
+    Branch(if_not_equal, ne, with, index);
   }
 
   // Checks if value is in range [lower_limit, higher_limit] using a single
@@ -871,6 +884,21 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void JumpIfIsInRange(Register value, unsigned lower_limit,
                        unsigned higher_limit, Label* on_in_range);
 
+  void JumpIfObjectType(Label* target, Condition cc, Register object,
+                        InstanceType instance_type, Register scratch = no_reg);
+  // Fast check if the object is a js receiver type. Assumes only primitive
+  // objects or js receivers are passed.
+  void JumpIfJSAnyIsNotPrimitive(
+      Register heap_object, Register scratch, Label* target,
+      Label::Distance distance = Label::kFar,
+      Condition condition = Condition::kUnsignedGreaterThanEqual);
+  void JumpIfJSAnyIsPrimitive(Register heap_object, Register scratch,
+                              Label* target,
+                              Label::Distance distance = Label::kFar) {
+    return JumpIfJSAnyIsNotPrimitive(heap_object, scratch, target, distance,
+                                     Condition::kUnsignedLessThan);
+  }
+
   // ---------------------------------------------------------------------------
   // GC Support
 
@@ -1152,9 +1180,35 @@ struct MoveCycleState {
   base::Optional<DoubleRegister> scratch_fpreg;
 };
 
-#define ACCESS_MASM(masm) masm->
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameStackSlotOperand(int offset) {
+  // The slot at [sp] is reserved in all ExitFrames for storing the return
+  // address before doing the actual call, it's necessary for frame iteration
+  // (see StoreReturnAddressAndCall for details).
+  static constexpr int kSPOffset = 1 * kSystemPointerSize;
+  return MemOperand(sp, kSPOffset + offset);
+}
+
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameCallerStackSlotOperand(int index) {
+  return MemOperand(fp, (ExitFrameConstants::kFixedSlotCountAboveFp + index) *
+                            kSystemPointerSize);
+}
+
+// Calls an API function. Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand);
 
 }  // namespace internal
 }  // namespace v8
 
+#define ACCESS_MASM(masm) masm->
+
 #endif  // V8_CODEGEN_LOONG64_MACRO_ASSEMBLER_LOONG64_H_
diff --git a/deps/v8/src/codegen/loong64/register-loong64.h b/deps/v8/src/codegen/loong64/register-loong64.h
index 97e954b749e5b4..e0901adec1a4ef 100644
--- a/deps/v8/src/codegen/loong64/register-loong64.h
+++ b/deps/v8/src/codegen/loong64/register-loong64.h
@@ -112,6 +112,13 @@ int ToNumber(Register reg);
 
 Register ToRegister(int num);
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 // Returns the number of padding slots needed for stack pointer alignment.
 constexpr int ArgumentPaddingSlots(int argument_count) {
   // No argument padding required.
@@ -196,6 +203,12 @@ DEFINE_REGISTER_NAMES(Register, GENERAL_REGISTERS)
 DEFINE_REGISTER_NAMES(FPURegister, DOUBLE_REGISTERS)
 
 // Give alias names to registers for calling conventions.
+
+constexpr Register arg_reg_1 = a0;
+constexpr Register arg_reg_2 = a1;
+constexpr Register arg_reg_3 = a2;
+constexpr Register arg_reg_4 = a3;
+
 constexpr Register kReturnRegister0 = a0;
 constexpr Register kReturnRegister1 = a1;
 constexpr Register kReturnRegister2 = a2;
diff --git a/deps/v8/src/codegen/machine-type.cc b/deps/v8/src/codegen/machine-type.cc
index a633a1020b1211..0653b3f36cb4ea 100644
--- a/deps/v8/src/codegen/machine-type.cc
+++ b/deps/v8/src/codegen/machine-type.cc
@@ -57,6 +57,8 @@ const char* MachineReprToString(MachineRepresentation rep) {
       return "kRepCompressedPointer";
     case MachineRepresentation::kCompressed:
       return "kRepCompressed";
+    case MachineRepresentation::kIndirectPointer:
+      return "kRepIndirectPointer";
     case MachineRepresentation::kMapWord:
       return "kRepMapWord";
     case MachineRepresentation::kSandboxedPointer:
diff --git a/deps/v8/src/codegen/machine-type.h b/deps/v8/src/codegen/machine-type.h
index 286ce8e033cada..7eca02f05d1f2c 100644
--- a/deps/v8/src/codegen/machine-type.h
+++ b/deps/v8/src/codegen/machine-type.h
@@ -42,6 +42,7 @@ enum class MachineRepresentation : uint8_t {
   kTagged,             // (uncompressed) Object (Smi or HeapObject)
   kCompressedPointer,  // (compressed) HeapObject
   kCompressed,         // (compressed) Object (Smi or HeapObject)
+  kIndirectPointer,    // (indirect) HeapObject
   // A 64-bit pointer encoded in a way (e.g. as offset) that guarantees it will
   // point into the sandbox.
   kSandboxedPointer,
@@ -154,6 +155,9 @@ class MachineType {
   constexpr bool IsCompressedPointer() const {
     return representation() == MachineRepresentation::kCompressedPointer;
   }
+  constexpr bool IsIndirectPointer() const {
+    return representation() == MachineRepresentation::kIndirectPointer;
+  }
   constexpr static MachineRepresentation PointerRepresentation() {
     return (kSystemPointerSize == 4) ? MachineRepresentation::kWord32
                                      : MachineRepresentation::kWord64;
@@ -242,6 +246,10 @@ class MachineType {
     return MachineType(MachineRepresentation::kSandboxedPointer,
                        MachineSemantic::kInt64);
   }
+  constexpr static MachineType IndirectPointer() {
+    return MachineType(MachineRepresentation::kIndirectPointer,
+                       MachineSemantic::kInt32);
+  }
   constexpr static MachineType Bool() {
     return MachineType(MachineRepresentation::kBit, MachineSemantic::kBool);
   }
@@ -280,6 +288,8 @@ class MachineType {
         return MachineType::TaggedPointer();
       case MachineRepresentation::kCompressed:
         return MachineType::AnyCompressed();
+      case MachineRepresentation::kIndirectPointer:
+        return MachineType::IndirectPointer();
       case MachineRepresentation::kCompressedPointer:
         return MachineType::CompressedPointer();
       case MachineRepresentation::kSandboxedPointer:
@@ -327,7 +337,7 @@ class MachineType {
     return ElementSizeLog2Of(this->representation()) <= kSystemPointerSizeLog2;
   }
 
-  constexpr byte MemSize() const {
+  constexpr uint8_t MemSize() const {
     return 1 << i::ElementSizeLog2Of(this->representation());
   }
 
@@ -350,44 +360,55 @@ V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream& os,
 std::ostream& operator<<(std::ostream& os, MachineSemantic type);
 V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream& os, MachineType type);
 
-inline bool IsIntegral(MachineRepresentation rep) {
+constexpr inline bool IsIntegral(MachineRepresentation rep) {
   return rep >= MachineRepresentation::kWord8 &&
          rep <= MachineRepresentation::kWord64;
 }
 
-inline bool IsFloatingPoint(MachineRepresentation rep) {
+constexpr inline bool IsFloatingPoint(MachineRepresentation rep) {
   return rep >= MachineRepresentation::kFirstFPRepresentation;
 }
 
-inline bool IsSimd128(MachineRepresentation rep) {
+constexpr inline bool IsSimd128(MachineRepresentation rep) {
   return rep == MachineRepresentation::kSimd128;
 }
 
-inline bool CanBeTaggedPointer(MachineRepresentation rep) {
+constexpr inline bool CanBeTaggedPointer(MachineRepresentation rep) {
   return rep == MachineRepresentation::kTagged ||
          rep == MachineRepresentation::kTaggedPointer ||
          rep == MachineRepresentation::kMapWord;
 }
 
-inline bool CanBeTaggedSigned(MachineRepresentation rep) {
+constexpr inline bool CanBeTaggedSigned(MachineRepresentation rep) {
   return rep == MachineRepresentation::kTagged ||
          rep == MachineRepresentation::kTaggedSigned;
 }
 
-inline bool IsAnyTagged(MachineRepresentation rep) {
+constexpr inline bool IsAnyTagged(MachineRepresentation rep) {
   return CanBeTaggedPointer(rep) || rep == MachineRepresentation::kTaggedSigned;
 }
 
-inline bool CanBeCompressedPointer(MachineRepresentation rep) {
+constexpr inline bool CanBeCompressedPointer(MachineRepresentation rep) {
   return rep == MachineRepresentation::kCompressed ||
          rep == MachineRepresentation::kCompressedPointer;
 }
 
-inline bool CanBeTaggedOrCompressedPointer(MachineRepresentation rep) {
+constexpr inline bool CanBeIndirectPointer(MachineRepresentation rep) {
+  return rep == MachineRepresentation::kIndirectPointer;
+}
+
+constexpr inline bool CanBeTaggedOrCompressedPointer(
+    MachineRepresentation rep) {
   return CanBeTaggedPointer(rep) || CanBeCompressedPointer(rep);
 }
 
-inline bool IsAnyCompressed(MachineRepresentation rep) {
+constexpr inline bool CanBeTaggedOrCompressedOrIndirectPointer(
+    MachineRepresentation rep) {
+  return CanBeTaggedPointer(rep) || CanBeCompressedPointer(rep) ||
+         CanBeIndirectPointer(rep);
+}
+
+constexpr inline bool IsAnyCompressed(MachineRepresentation rep) {
   return CanBeCompressedPointer(rep);
 }
 
@@ -402,6 +423,7 @@ V8_EXPORT_PRIVATE inline constexpr int ElementSizeLog2Of(
       return 1;
     case MachineRepresentation::kWord32:
     case MachineRepresentation::kFloat32:
+    case MachineRepresentation::kIndirectPointer:
       return 2;
     case MachineRepresentation::kWord64:
     case MachineRepresentation::kFloat64:
diff --git a/deps/v8/src/codegen/macro-assembler-base.cc b/deps/v8/src/codegen/macro-assembler-base.cc
index 899f67830f4672..2e657dd3b89c58 100644
--- a/deps/v8/src/codegen/macro-assembler-base.cc
+++ b/deps/v8/src/codegen/macro-assembler-base.cc
@@ -30,12 +30,12 @@ Address MacroAssemblerBase::BuiltinEntry(Builtin builtin) {
   DCHECK(Builtins::IsBuiltinId(builtin));
   if (isolate_ != nullptr) {
     Address entry = isolate_->builtin_entry_table()[Builtins::ToInt(builtin)];
-    DCHECK_EQ(entry, EmbeddedData::FromBlob(isolate_).InstructionStartOfBuiltin(
-                         builtin));
+    DCHECK_EQ(entry,
+              EmbeddedData::FromBlob(isolate_).InstructionStartOf(builtin));
     return entry;
   }
   EmbeddedData d = EmbeddedData::FromBlob();
-  return d.InstructionStartOfBuiltin(builtin);
+  return d.InstructionStartOf(builtin);
 }
 
 void MacroAssemblerBase::IndirectLoadConstant(Register destination,
@@ -130,8 +130,8 @@ bool MacroAssemblerBase::IsAddressableThroughRootRegister(
 Tagged_t MacroAssemblerBase::ReadOnlyRootPtr(RootIndex index,
                                              Isolate* isolate) {
   DCHECK(CanBeImmediate(index));
-  Object obj = isolate->root(index);
-  CHECK(obj.IsHeapObject());
+  Tagged<Object> obj = isolate->root(index);
+  CHECK(IsHeapObject(obj));
   return V8HeapCompressionScheme::CompressObject(obj.ptr());
 }
 
diff --git a/deps/v8/src/codegen/macro-assembler-base.h b/deps/v8/src/codegen/macro-assembler-base.h
index a66f594aff69dc..b51a6847c0e630 100644
--- a/deps/v8/src/codegen/macro-assembler-base.h
+++ b/deps/v8/src/codegen/macro-assembler-base.h
@@ -48,6 +48,7 @@ class V8_EXPORT_PRIVATE MacroAssemblerBase : public Assembler {
   void set_abort_hard(bool v) { hard_abort_ = v; }
 
   void set_builtin(Builtin builtin) { maybe_builtin_ = builtin; }
+  Builtin builtin() const { return maybe_builtin_; }
 
   void set_has_frame(bool v) { has_frame_ = v; }
   bool has_frame() const { return has_frame_; }
diff --git a/deps/v8/src/codegen/maglev-safepoint-table.cc b/deps/v8/src/codegen/maglev-safepoint-table.cc
index 50adb61efd9850..934cc2a19febd4 100644
--- a/deps/v8/src/codegen/maglev-safepoint-table.cc
+++ b/deps/v8/src/codegen/maglev-safepoint-table.cc
@@ -13,17 +13,17 @@ namespace v8 {
 namespace internal {
 
 MaglevSafepointTable::MaglevSafepointTable(Isolate* isolate, Address pc,
-                                           Code code)
-    : MaglevSafepointTable(code.InstructionStart(isolate, pc),
-                           code.SafepointTableAddress()) {
-  DCHECK(code.is_maglevved());
+                                           Tagged<Code> code)
+    : MaglevSafepointTable(code->InstructionStart(isolate, pc),
+                           code->safepoint_table_address()) {
+  DCHECK(code->is_maglevved());
 }
 
 MaglevSafepointTable::MaglevSafepointTable(Isolate* isolate, Address pc,
-                                           GcSafeCode code)
-    : MaglevSafepointTable(code.InstructionStart(isolate, pc),
-                           code.SafepointTableAddress()) {
-  DCHECK(code.is_maglevved());
+                                           Tagged<GcSafeCode> code)
+    : MaglevSafepointTable(code->InstructionStart(isolate, pc),
+                           code->safepoint_table_address()) {
+  DCHECK(code->is_maglevved());
 }
 
 MaglevSafepointTable::MaglevSafepointTable(Address instruction_start,
@@ -73,17 +73,17 @@ MaglevSafepointEntry MaglevSafepointTable::FindEntry(Address pc) const {
   // This allows us to elide emitting entries for trivial calls.
   int deopt_index = MaglevSafepointEntry::kNoDeoptIndex;
   int trampoline_pc = MaglevSafepointEntry::kNoTrampolinePC;
-  uint8_t num_pushed_registers = 0;
+  uint8_t num_extra_spill_slots = 0;
   int tagged_register_indexes = 0;
 
   return MaglevSafepointEntry(pc_offset, deopt_index, num_tagged_slots_,
-                              num_untagged_slots_, num_pushed_registers,
+                              num_untagged_slots_, num_extra_spill_slots,
                               tagged_register_indexes, trampoline_pc);
 }
 
 // static
 MaglevSafepointEntry MaglevSafepointTable::FindEntry(Isolate* isolate,
-                                                     GcSafeCode code,
+                                                     Tagged<GcSafeCode> code,
                                                      Address pc) {
   MaglevSafepointTable table(isolate, pc, code);
   return table.FindEntry(pc);
@@ -99,8 +99,8 @@ void MaglevSafepointTable::Print(std::ostream& os) const {
     os << reinterpret_cast<const void*>(instruction_start_ + entry.pc()) << " "
        << std::setw(6) << std::hex << entry.pc() << std::dec;
 
-    os << "  num pushed registers: "
-       << static_cast<int>(entry.num_pushed_registers());
+    os << "  num extra spill slots: "
+       << static_cast<int>(entry.num_extra_spill_slots());
 
     if (entry.tagged_register_indexes() != 0) {
       os << "  registers: ";
@@ -245,7 +245,7 @@ void MaglevSafepointTableBuilder::Emit(Assembler* assembler) {
       emit_bytes(entry.deopt_index + 1, deopt_index_size);
       emit_bytes(entry.trampoline + 1, pc_size);
     }
-    assembler->db(entry.num_pushed_registers);
+    assembler->db(entry.num_extra_spill_slots);
     emit_bytes(entry.tagged_register_indexes, register_indexes_size);
   }
 }
diff --git a/deps/v8/src/codegen/maglev-safepoint-table.h b/deps/v8/src/codegen/maglev-safepoint-table.h
index 492346917f2e78..c134acc3c7f238 100644
--- a/deps/v8/src/codegen/maglev-safepoint-table.h
+++ b/deps/v8/src/codegen/maglev-safepoint-table.h
@@ -28,12 +28,12 @@ class MaglevSafepointEntry : public SafepointEntryBase {
 
   MaglevSafepointEntry(int pc, int deopt_index, uint32_t num_tagged_slots,
                        uint32_t num_untagged_slots,
-                       uint8_t num_pushed_registers,
+                       uint8_t num_extra_spill_slots,
                        uint32_t tagged_register_indexes, int trampoline_pc)
       : SafepointEntryBase(pc, deopt_index, trampoline_pc),
         num_tagged_slots_(num_tagged_slots),
         num_untagged_slots_(num_untagged_slots),
-        num_pushed_registers_(num_pushed_registers),
+        num_extra_spill_slots_(num_extra_spill_slots),
         tagged_register_indexes_(tagged_register_indexes) {
     DCHECK(is_initialized());
   }
@@ -42,13 +42,13 @@ class MaglevSafepointEntry : public SafepointEntryBase {
     return this->SafepointEntryBase::operator==(other) &&
            num_tagged_slots_ == other.num_tagged_slots_ &&
            num_untagged_slots_ == other.num_untagged_slots_ &&
-           num_pushed_registers_ == other.num_pushed_registers_ &&
+           num_extra_spill_slots_ == other.num_extra_spill_slots_ &&
            tagged_register_indexes_ == other.tagged_register_indexes_;
   }
 
   uint32_t num_tagged_slots() const { return num_tagged_slots_; }
   uint32_t num_untagged_slots() const { return num_untagged_slots_; }
-  uint8_t num_pushed_registers() const { return num_pushed_registers_; }
+  uint8_t num_extra_spill_slots() const { return num_extra_spill_slots_; }
   uint32_t tagged_register_indexes() const { return tagged_register_indexes_; }
 
   uint32_t register_input_count() const { return tagged_register_indexes_; }
@@ -56,7 +56,7 @@ class MaglevSafepointEntry : public SafepointEntryBase {
  private:
   uint32_t num_tagged_slots_ = 0;
   uint32_t num_untagged_slots_ = 0;
-  uint8_t num_pushed_registers_ = 0;
+  uint8_t num_extra_spill_slots_ = 0;
   uint32_t tagged_register_indexes_ = 0;
 };
 
@@ -66,7 +66,8 @@ class MaglevSafepointTable {
  public:
   // The isolate and pc arguments are used for figuring out whether pc
   // belongs to the embedded or un-embedded code blob.
-  explicit MaglevSafepointTable(Isolate* isolate, Address pc, Code code);
+  explicit MaglevSafepointTable(Isolate* isolate, Address pc,
+                                Tagged<Code> code);
   MaglevSafepointTable(const MaglevSafepointTable&) = delete;
   MaglevSafepointTable& operator=(const MaglevSafepointTable&) = delete;
 
@@ -96,24 +97,24 @@ class MaglevSafepointTable {
       DCHECK(trampoline_pc >= 0 ||
              trampoline_pc == MaglevSafepointEntry::kNoTrampolinePC);
     }
-    uint8_t num_pushed_registers = read_byte(&entry_ptr);
+    uint8_t num_extra_spill_slots = read_byte(&entry_ptr);
     int tagged_register_indexes =
         read_bytes(&entry_ptr, register_indexes_size());
 
     return MaglevSafepointEntry(pc, deopt_index, num_tagged_slots_,
-                                num_untagged_slots_, num_pushed_registers,
+                                num_untagged_slots_, num_extra_spill_slots,
                                 tagged_register_indexes, trampoline_pc);
   }
 
   // Returns the entry for the given pc.
   MaglevSafepointEntry FindEntry(Address pc) const;
-  static MaglevSafepointEntry FindEntry(Isolate* isolate, GcSafeCode code,
-                                        Address pc);
+  static MaglevSafepointEntry FindEntry(Isolate* isolate,
+                                        Tagged<GcSafeCode> code, Address pc);
 
   void Print(std::ostream&) const;
 
  private:
-  MaglevSafepointTable(Isolate* isolate, Address pc, GcSafeCode code);
+  MaglevSafepointTable(Isolate* isolate, Address pc, Tagged<GcSafeCode> code);
 
   // Layout information.
   static constexpr int kLengthOffset = 0;
@@ -187,7 +188,7 @@ class MaglevSafepointTableBuilder : public SafepointTableBuilderBase {
     int pc;
     int deopt_index = MaglevSafepointEntry::kNoDeoptIndex;
     int trampoline = MaglevSafepointEntry::kNoTrampolinePC;
-    uint8_t num_pushed_registers = 0;
+    uint8_t num_extra_spill_slots = 0;
     uint32_t tagged_register_indexes = 0;
     explicit EntryBuilder(int pc) : pc(pc) {}
   };
@@ -210,8 +211,8 @@ class MaglevSafepointTableBuilder : public SafepointTableBuilderBase {
                 kBitsPerByte * sizeof(EntryBuilder::tagged_register_indexes));
       entry_->tagged_register_indexes |= 1u << reg_code;
     }
-    void SetNumPushedRegisters(uint8_t num_registers) {
-      entry_->num_pushed_registers = num_registers;
+    void SetNumExtraSpillSlots(uint8_t num_slots) {
+      entry_->num_extra_spill_slots = num_slots;
     }
 
    private:
diff --git a/deps/v8/src/codegen/mips64/assembler-mips64-inl.h b/deps/v8/src/codegen/mips64/assembler-mips64-inl.h
index 4b0e0c641e7de4..92d5d7d8c48b8d 100644
--- a/deps/v8/src/codegen/mips64/assembler-mips64-inl.h
+++ b/deps/v8/src/codegen/mips64/assembler-mips64-inl.h
@@ -97,9 +97,9 @@ Address RelocInfo::constant_pool_entry_address() { UNREACHABLE(); }
 int RelocInfo::target_address_size() { return Assembler::kSpecialTargetSize; }
 
 void Assembler::deserialization_set_special_target_at(
-    Address instruction_payload, Code code, Address target) {
+    Address instruction_payload, Tagged<Code> code, Address target) {
   set_target_address_at(instruction_payload,
-                        !code.is_null() ? code.constant_pool() : kNullAddress,
+                        !code.is_null() ? code->constant_pool() : kNullAddress,
                         target);
 }
 
@@ -135,7 +135,7 @@ void Assembler::deserialization_set_target_internal_reference_at(
   }
 }
 
-HeapObject RelocInfo::target_object(PtrComprCageBase cage_base) {
+Tagged<HeapObject> RelocInfo::target_object(PtrComprCageBase cage_base) {
   DCHECK(IsCodeTarget(rmode_) || IsFullEmbeddedObject(rmode_));
   return HeapObject::cast(
       Object(Assembler::target_address_at(pc_, constant_pool_)));
@@ -147,15 +147,11 @@ Handle<HeapObject> RelocInfo::target_object_handle(Assembler* origin) {
       Assembler::target_address_at(pc_, constant_pool_)));
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(Tagged<HeapObject> target,
                                   ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTarget(rmode_) || IsFullEmbeddedObject(rmode_));
   Assembler::set_target_address_at(pc_, constant_pool_, target.ptr(),
                                    icache_flush_mode);
-  if (!instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target, write_barrier_mode);
-  }
 }
 
 Address RelocInfo::target_external_reference() {
diff --git a/deps/v8/src/codegen/mips64/assembler-mips64.cc b/deps/v8/src/codegen/mips64/assembler-mips64.cc
index accdd4532eb4e5..7a4e35e1ea36d1 100644
--- a/deps/v8/src/codegen/mips64/assembler-mips64.cc
+++ b/deps/v8/src/codegen/mips64/assembler-mips64.cc
@@ -201,7 +201,7 @@ MemOperand::MemOperand(Register rm, int32_t unit, int32_t multiplier,
   offset_ = unit * multiplier + offset_addend;
 }
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Handle<HeapObject> object;
@@ -271,8 +271,11 @@ Assembler::Assembler(const AssemblerOptions& options,
   block_buffer_growth_ = false;
 }
 
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
-                        SafepointTableBuilder* safepoint_table_builder,
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
+}
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
+                        SafepointTableBuilderBase* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
   // raw workflow to create InstructionStream objects (mostly in tests), add
@@ -3737,7 +3740,7 @@ void Assembler::GrowBuffer() {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   intptr_t pc_delta = new_start - buffer_start_;
@@ -3756,9 +3759,9 @@ void Assembler::GrowBuffer() {
                                reloc_info_writer.last_pc() + pc_delta);
 
   // Relocate runtime entries.
-  base::Vector<byte> instructions{buffer_start_,
-                                  static_cast<size_t>(pc_offset())};
-  base::Vector<const byte> reloc_info{reloc_info_writer.pos(), reloc_size};
+  base::Vector<uint8_t> instructions{buffer_start_,
+                                     static_cast<size_t>(pc_offset())};
+  base::Vector<const uint8_t> reloc_info{reloc_info_writer.pos(), reloc_size};
   for (RelocIterator it(instructions, reloc_info, 0); !it.done(); it.next()) {
     RelocInfo::Mode rmode = it.rinfo()->rmode();
     if (rmode == RelocInfo::INTERNAL_REFERENCE) {
@@ -3775,22 +3778,14 @@ void Assembler::db(uint8_t data) {
   pc_ += sizeof(uint8_t);
 }
 
-void Assembler::dd(uint32_t data, RelocInfo::Mode rmode) {
+void Assembler::dd(uint32_t data) {
   CheckForEmitInForbiddenSlot();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uint32_t*>(pc_) = data;
   pc_ += sizeof(uint32_t);
 }
 
-void Assembler::dq(uint64_t data, RelocInfo::Mode rmode) {
+void Assembler::dq(uint64_t data) {
   CheckForEmitInForbiddenSlot();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uint64_t*>(pc_) = data;
   pc_ += sizeof(uint64_t);
 }
@@ -3812,8 +3807,7 @@ void Assembler::dd(Label* label) {
 void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data) {
   if (!ShouldRecordRelocInfo(rmode)) return;
   // We do not try to reuse pool constants.
-  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data, Code(),
-                  InstructionStream());
+  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data);
   DCHECK_GE(buffer_space(), kMaxRelocSize);  // Too late to grow buffer here.
   reloc_info_writer.Write(&rinfo);
 }
@@ -3967,23 +3961,6 @@ void Assembler::set_target_value_at(Address pc, uint64_t target,
   }
 }
 
-UseScratchRegisterScope::UseScratchRegisterScope(Assembler* assembler)
-    : available_(assembler->GetScratchRegisterList()),
-      old_available_(*available_) {}
-
-UseScratchRegisterScope::~UseScratchRegisterScope() {
-  *available_ = old_available_;
-}
-
-Register UseScratchRegisterScope::Acquire() {
-  DCHECK_NOT_NULL(available_);
-  return available_->PopFirst();
-}
-
-bool UseScratchRegisterScope::hasAvailable() const {
-  return !available_->is_empty();
-}
-
 LoadStoreLaneParams::LoadStoreLaneParams(MachineRepresentation rep,
                                          uint8_t laneidx) {
   switch (rep) {
diff --git a/deps/v8/src/codegen/mips64/assembler-mips64.h b/deps/v8/src/codegen/mips64/assembler-mips64.h
index ccdc9f828ddcff..18e010fa8dd530 100644
--- a/deps/v8/src/codegen/mips64/assembler-mips64.h
+++ b/deps/v8/src/codegen/mips64/assembler-mips64.h
@@ -156,13 +156,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   // GetCode emits any pending (non-emitted) code and fills the descriptor desc.
   static constexpr int kNoHandlerTable = 0;
-  static constexpr SafepointTableBuilder* kNoSafepointTable = nullptr;
-  void GetCode(Isolate* isolate, CodeDesc* desc,
-               SafepointTableBuilder* safepoint_table_builder,
+  static constexpr SafepointTableBuilderBase* kNoSafepointTable = nullptr;
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
+               SafepointTableBuilderBase* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -273,7 +275,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // This is for calls and branches within generated code.  The serializer
   // has already deserialized the lui/ori instructions etc.
   inline static void deserialization_set_special_target_at(
-      Address instruction_payload, Code code, Address target);
+      Address instruction_payload, Tagged<Code> code, Address target);
 
   // Get the size of the special target encoded at 'instruction_payload'.
   inline static int deserialization_special_target_size(
@@ -1458,11 +1460,9 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Writes a single byte or word of data in the code stream.  Used for
   // inline tables, e.g., jump-tables.
   void db(uint8_t data);
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
-    dq(data, rmode);
-  }
+  void dd(uint32_t data);
+  void dq(uint64_t data);
+  void dp(uintptr_t data) { dq(data); }
   void dd(Label* label);
 
   // Postpone the generation of the trampoline pool for the specified number of
@@ -1902,12 +1902,12 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Keep track of the last Call's position to ensure that safepoint can get the
   // correct information even if there is a trampoline immediately after the
   // Call.
-  byte* pc_for_safepoint_;
+  uint8_t* pc_for_safepoint_;
 
   RegList scratch_register_list_;
 
  private:
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
@@ -1924,11 +1924,17 @@ class EnsureSpace {
 
 class V8_EXPORT_PRIVATE V8_NODISCARD UseScratchRegisterScope {
  public:
-  explicit UseScratchRegisterScope(Assembler* assembler);
-  ~UseScratchRegisterScope();
+  explicit UseScratchRegisterScope(Assembler* assembler)
+      : available_(assembler->GetScratchRegisterList()),
+        old_available_(*available_) {}
+
+  ~UseScratchRegisterScope() { *available_ = old_available_; }
+
+  Register Acquire() {
+    return available_->PopFirst();
+  }
 
-  Register Acquire();
-  bool hasAvailable() const;
+  bool hasAvailable() const { return !available_->is_empty(); }
 
   void Include(const RegList& list) { *available_ |= list; }
   void Exclude(const RegList& list) { available_->clear(list); }
diff --git a/deps/v8/src/codegen/mips64/constants-mips64.h b/deps/v8/src/codegen/mips64/constants-mips64.h
index 1b8790d8442a0b..4c6ff50e6928d4 100644
--- a/deps/v8/src/codegen/mips64/constants-mips64.h
+++ b/deps/v8/src/codegen/mips64/constants-mips64.h
@@ -1747,7 +1747,7 @@ class Instruction : public InstructionGetters<InstructionBase> {
   // reference to an instruction is to convert a pointer. There is no way
   // to allocate or create instances of class Instruction.
   // Use the At(pc) function to create references to Instruction.
-  static Instruction* At(byte* pc) {
+  static Instruction* At(uint8_t* pc) {
     return reinterpret_cast<Instruction*>(pc);
   }
 
diff --git a/deps/v8/src/codegen/mips64/interface-descriptors-mips64-inl.h b/deps/v8/src/codegen/mips64/interface-descriptors-mips64-inl.h
index 2965a5bc13ff86..9f9f8d5a016366 100644
--- a/deps/v8/src/codegen/mips64/interface-descriptors-mips64-inl.h
+++ b/deps/v8/src/codegen/mips64/interface-descriptors-mips64-inl.h
@@ -19,6 +19,23 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  auto registers = DoubleRegisterArray(f0, f2, f4, f6, f8, f10, f12);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Padding to have as many double return registers as GP return registers.
+  auto registers = DoubleRegisterArray(kFPReturnRegister0, no_dreg, no_dreg);
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -269,12 +286,36 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  // a1 : kApiFunctionAddress
-  // a2 : kArgc
-  // a3 : kCallData
-  // a0 : kHolder
-  return RegisterArray(a1, a2, a3, a0);
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return a1;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return a2;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return a3;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return a0;
+}
+
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return a2;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return a3;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return a0;
 }
 
 // static
@@ -314,6 +355,11 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray(a0, a1);
 }
 
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(t0);
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/mips64/macro-assembler-mips64.cc b/deps/v8/src/codegen/mips64/macro-assembler-mips64.cc
index ecbd3fdb9b619c..348891a36952b7 100644
--- a/deps/v8/src/codegen/mips64/macro-assembler-mips64.cc
+++ b/deps/v8/src/codegen/mips64/macro-assembler-mips64.cc
@@ -952,13 +952,17 @@ void MacroAssembler::Sle(Register rd, Register rs, const Operand& rt) {
   if (rt.is_reg()) {
     slt(rd, rt.rm(), rs);
   } else {
-    // li handles the relocation.
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
-    BlockTrampolinePoolScope block_trampoline_pool(this);
-    DCHECK(rs != scratch);
-    li(scratch, rt);
-    slt(rd, scratch, rs);
+    if (rt.immediate() == 0 && !MustUseReg(rt.rmode())) {
+      slt(rd, zero_reg, rs);
+    } else {
+      // li handles the relocation.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
+      BlockTrampolinePoolScope block_trampoline_pool(this);
+      DCHECK(rs != scratch);
+      li(scratch, rt);
+      slt(rd, scratch, rs);
+    }
   }
   xori(rd, rd, 1);
 }
@@ -967,13 +971,17 @@ void MacroAssembler::Sleu(Register rd, Register rs, const Operand& rt) {
   if (rt.is_reg()) {
     sltu(rd, rt.rm(), rs);
   } else {
-    // li handles the relocation.
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
-    BlockTrampolinePoolScope block_trampoline_pool(this);
-    DCHECK(rs != scratch);
-    li(scratch, rt);
-    sltu(rd, scratch, rs);
+    if (rt.immediate() == 0 && !MustUseReg(rt.rmode())) {
+      sltu(rd, zero_reg, rs);
+    } else {
+      // li handles the relocation.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
+      BlockTrampolinePoolScope block_trampoline_pool(this);
+      DCHECK(rs != scratch);
+      li(scratch, rt);
+      sltu(rd, scratch, rs);
+    }
   }
   xori(rd, rd, 1);
 }
@@ -992,13 +1000,17 @@ void MacroAssembler::Sgt(Register rd, Register rs, const Operand& rt) {
   if (rt.is_reg()) {
     slt(rd, rt.rm(), rs);
   } else {
-    // li handles the relocation.
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
-    BlockTrampolinePoolScope block_trampoline_pool(this);
-    DCHECK(rs != scratch);
-    li(scratch, rt);
-    slt(rd, scratch, rs);
+    if (rt.immediate() == 0 && !MustUseReg(rt.rmode())) {
+      slt(rd, zero_reg, rs);
+    } else {
+      // li handles the relocation.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
+      BlockTrampolinePoolScope block_trampoline_pool(this);
+      DCHECK(rs != scratch);
+      li(scratch, rt);
+      slt(rd, scratch, rs);
+    }
   }
 }
 
@@ -1006,13 +1018,17 @@ void MacroAssembler::Sgtu(Register rd, Register rs, const Operand& rt) {
   if (rt.is_reg()) {
     sltu(rd, rt.rm(), rs);
   } else {
-    // li handles the relocation.
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
-    BlockTrampolinePoolScope block_trampoline_pool(this);
-    DCHECK(rs != scratch);
-    li(scratch, rt);
-    sltu(rd, scratch, rs);
+    if (rt.immediate() == 0 && !MustUseReg(rt.rmode())) {
+      sltu(rd, zero_reg, rs);
+    } else {
+      // li handles the relocation.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.hasAvailable() ? temps.Acquire() : t8;
+      BlockTrampolinePoolScope block_trampoline_pool(this);
+      DCHECK(rs != scratch);
+      li(scratch, rt);
+      sltu(rd, scratch, rs);
+    }
   }
 }
 
@@ -3022,98 +3038,6 @@ void MacroAssembler::Movn(Register rd, Register rs, Register rt) {
   }
 }
 
-void MacroAssembler::LoadZeroOnCondition(Register rd, Register rs,
-                                         const Operand& rt, Condition cond) {
-  BlockTrampolinePoolScope block_trampoline_pool(this);
-  switch (cond) {
-    case cc_always:
-      mov(rd, zero_reg);
-      break;
-    case eq:
-      if (rs == zero_reg) {
-        if (rt.is_reg()) {
-          LoadZeroIfConditionZero(rd, rt.rm());
-        } else {
-          if (rt.immediate() == 0) {
-            mov(rd, zero_reg);
-          } else {
-            nop();
-          }
-        }
-      } else if (IsZero(rt)) {
-        LoadZeroIfConditionZero(rd, rs);
-      } else {
-        Dsubu(t9, rs, rt);
-        LoadZeroIfConditionZero(rd, t9);
-      }
-      break;
-    case ne:
-      if (rs == zero_reg) {
-        if (rt.is_reg()) {
-          LoadZeroIfConditionNotZero(rd, rt.rm());
-        } else {
-          if (rt.immediate() != 0) {
-            mov(rd, zero_reg);
-          } else {
-            nop();
-          }
-        }
-      } else if (IsZero(rt)) {
-        LoadZeroIfConditionNotZero(rd, rs);
-      } else {
-        Dsubu(t9, rs, rt);
-        LoadZeroIfConditionNotZero(rd, t9);
-      }
-      break;
-
-    // Signed comparison.
-    case greater:
-      Sgt(t9, rs, rt);
-      LoadZeroIfConditionNotZero(rd, t9);
-      break;
-    case greater_equal:
-      Sge(t9, rs, rt);
-      LoadZeroIfConditionNotZero(rd, t9);
-      // rs >= rt
-      break;
-    case less:
-      Slt(t9, rs, rt);
-      LoadZeroIfConditionNotZero(rd, t9);
-      // rs < rt
-      break;
-    case less_equal:
-      Sle(t9, rs, rt);
-      LoadZeroIfConditionNotZero(rd, t9);
-      // rs <= rt
-      break;
-
-    // Unsigned comparison.
-    case Ugreater:
-      Sgtu(t9, rs, rt);
-      LoadZeroIfConditionNotZero(rd, t9);
-      // rs > rt
-      break;
-
-    case Ugreater_equal:
-      Sgeu(t9, rs, rt);
-      LoadZeroIfConditionNotZero(rd, t9);
-      // rs >= rt
-      break;
-    case Uless:
-      Sltu(t9, rs, rt);
-      LoadZeroIfConditionNotZero(rd, t9);
-      // rs < rt
-      break;
-    case Uless_equal:
-      Sleu(t9, rs, rt);
-      LoadZeroIfConditionNotZero(rd, t9);
-      // rs <= rt
-      break;
-    default:
-      UNREACHABLE();
-  }
-}
-
 void MacroAssembler::LoadZeroIfConditionNotZero(Register dest,
                                                 Register condition) {
   if (kArchVariant == kMips64r6) {
@@ -3347,6 +3271,72 @@ void MacroAssembler::TruncateDoubleToI(Isolate* isolate, Zone* zone,
   bind(&done);
 }
 
+void MacroAssembler::CompareWord(Condition cond, Register dst, Register lhs,
+                                 const Operand& rhs) {
+  switch (cond) {
+    case eq:
+    case ne: {
+      if (rhs.IsImmediate()) {
+        if (rhs.immediate() == 0) {
+          if (cond == eq) {
+            Sltu(dst, lhs, 1);
+          } else {
+            Sltu(dst, zero_reg, lhs);
+          }
+        } else if (is_int16(-rhs.immediate())) {
+          Daddu(dst, lhs, Operand(-rhs.immediate()));
+          if (cond == eq) {
+            Sltu(dst, dst, 1);
+          } else {
+            Sltu(dst, zero_reg, dst);
+          }
+        } else {
+          Xor(dst, lhs, rhs);
+          if (cond == eq) {
+            Sltu(dst, dst, 1);
+          } else {
+            Sltu(dst, zero_reg, dst);
+          }
+        }
+      } else {
+        Xor(dst, lhs, rhs);
+        if (cond == eq) {
+          Sltu(dst, dst, 1);
+        } else {
+          Sltu(dst, zero_reg, dst);
+        }
+      }
+      break;
+    }
+    case lt:
+      Slt(dst, lhs, rhs);
+      break;
+    case gt:
+      Sgt(dst, lhs, rhs);
+      break;
+    case le:
+      Sle(dst, lhs, rhs);
+      break;
+    case ge:
+      Sge(dst, lhs, rhs);
+      break;
+    case lo:
+      Sltu(dst, lhs, rhs);
+      break;
+    case hs:
+      Sgeu(dst, lhs, rhs);
+      break;
+    case hi:
+      Sgtu(dst, lhs, rhs);
+      break;
+    case ls:
+      Sleu(dst, lhs, rhs);
+      break;
+    default:
+      UNREACHABLE();
+  }
+}
+
 // Emulated condtional branches do not emit a nop in the branch delay slot.
 //
 // BRANCH_ARGS_CHECK checks that conditional jump arguments are correct.
@@ -4258,12 +4248,14 @@ MemOperand MacroAssembler::ExternalReferenceAsOperand(
       return MemOperand(kRootRegister, static_cast<int32_t>(offset));
     } else {
       // Otherwise, do a memory load from the external reference table.
+      DCHECK(scratch.is_valid());
       Ld(scratch, MemOperand(kRootRegister,
                              RootRegisterOffsetForExternalReferenceTableEntry(
                                  isolate(), reference)));
       return MemOperand(scratch, 0);
     }
   }
+  DCHECK(scratch.is_valid());
   li(scratch, reference);
   return MemOperand(scratch, 0);
 }
@@ -4401,17 +4393,17 @@ void MacroAssembler::Call(Handle<Code> code, RelocInfo::Mode rmode,
   Call(code.address(), rmode, cond, rs, rt, bd);
 }
 
-void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
+void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index,
+                                               Register target) {
   ASM_CODE_COMMENT(this);
   static_assert(kSystemPointerSize == 8);
   static_assert(kSmiTagSize == 1);
   static_assert(kSmiTag == 0);
 
   // The builtin_index register contains the builtin index as a Smi.
-  SmiUntag(builtin_index, builtin_index);
-  Dlsa(builtin_index, kRootRegister, builtin_index, kSystemPointerSizeLog2);
-  Ld(builtin_index,
-     MemOperand(builtin_index, IsolateData::builtin_entry_table_offset()));
+  SmiUntag(target, builtin_index);
+  Dlsa(target, kRootRegister, target, kSystemPointerSizeLog2);
+  Ld(target, MemOperand(target, IsolateData::builtin_entry_table_offset()));
 }
 void MacroAssembler::LoadEntryFromBuiltin(Builtin builtin,
                                           Register destination) {
@@ -4423,10 +4415,11 @@ MemOperand MacroAssembler::EntryFromBuiltinAsOperand(Builtin builtin) {
                     IsolateData::BuiltinEntrySlotOffset(builtin));
 }
 
-void MacroAssembler::CallBuiltinByIndex(Register builtin_index) {
+void MacroAssembler::CallBuiltinByIndex(Register builtin_index,
+                                        Register target) {
   ASM_CODE_COMMENT(this);
-  LoadEntryFromBuiltinIndex(builtin_index);
-  Call(builtin_index);
+  LoadEntryFromBuiltinIndex(builtin_index, target);
+  Call(target);
 }
 void MacroAssembler::CallBuiltin(Builtin builtin) {
   ASM_CODE_COMMENT_STRING(this, CommentForOffHeapTrampoline("call", builtin));
@@ -4911,8 +4904,7 @@ void MacroAssembler::StackOverflowCheck(Register num_args, Register scratch1,
 void MacroAssembler::TestCodeIsMarkedForDeoptimizationAndJump(
     Register code_data_container, Register scratch, Condition cond,
     Label* target) {
-  Lhu(scratch,
-      FieldMemOperand(code_data_container, Code::kKindSpecificFlagsOffset));
+  Lwu(scratch, FieldMemOperand(code_data_container, Code::kFlagsOffset));
   And(scratch, scratch, Operand(1 << Code::kMarkedForDeoptimizationBit));
   Branch(target, cond, scratch, Operand(zero_reg));
 }
@@ -4998,7 +4990,7 @@ void MacroAssembler::CheckDebugHook(Register fun, Register new_target,
 
   {
     // Load receiver to pass it later to DebugOnFunctionCall hook.
-    LoadReceiver(t0, actual_parameter_count);
+    LoadReceiver(t0);
 
     FrameScope frame(
         this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
@@ -5052,14 +5044,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // We call indirectly through the code field in the function to
   // allow recompilation to take effect without changing any of the
   // call sites.
-  Register code = kJavaScriptCallCodeStartRegister;
-  Ld(code, FieldMemOperand(function, JSFunction::kCodeOffset));
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(code);
+      CallJSFunction(function);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(code);
+      JumpJSFunction(function);
       break;
   }
 
@@ -5445,7 +5435,8 @@ void MacroAssembler::EnterExitFrame(int stack_space,
                                     StackFrame::Type frame_type) {
   ASM_CODE_COMMENT(this);
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
 
   // Set up the frame structure on the stack.
   static_assert(2 * kPointerSize == ExitFrameConstants::kCallerSPDisplacement);
@@ -5602,6 +5593,38 @@ void MacroAssembler::Assert(Condition cc, AbortReason reason, Register rs,
   if (v8_flags.debug_code) Check(cc, reason, rs, rt);
 }
 
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 Register tmp, AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp, tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok);
+
+  GetObjectType(object, map_tmp, tmp);
+
+  Branch(&ok, kUnsignedLessThanEqual, tmp, Operand(LAST_NAME_TYPE));
+
+  Branch(&ok, kUnsignedGreaterThanEqual, tmp, Operand(FIRST_JS_RECEIVER_TYPE));
+
+  Branch(&ok, kEqual, map_tmp, RootIndex::kHeapNumberMap);
+
+  Branch(&ok, kEqual, map_tmp, RootIndex::kBigIntMap);
+
+  Branch(&ok, kEqual, object, RootIndex::kUndefinedValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kTrueValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kFalseValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kNullValue);
+
+  Abort(abort_reason);
+  bind(&ok);
+}
+
 void MacroAssembler::AssertNotSmi(Register object) {
   if (v8_flags.debug_code) {
     ASM_CODE_COMMENT(this);
@@ -6185,16 +6208,17 @@ void MacroAssembler::CallForDeoptimization(Builtin target, int, Label* exit,
                                             : Deoptimizer::kEagerDeoptExitSize);
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination,
-                                   Register code_data_container_object) {
+void MacroAssembler::LoadCodeInstructionStart(
+    Register destination, Register code_data_container_object) {
   ASM_CODE_COMMENT(this);
-  Ld(destination,
-     FieldMemOperand(code_data_container_object, Code::kCodeEntryPointOffset));
+  Ld(destination, FieldMemOperand(code_data_container_object,
+                                  Code::kInstructionStartOffset));
 }
 
 void MacroAssembler::CallCodeObject(Register code_data_container_object) {
   ASM_CODE_COMMENT(this);
-  LoadCodeEntry(code_data_container_object, code_data_container_object);
+  LoadCodeInstructionStart(code_data_container_object,
+                           code_data_container_object);
   Call(code_data_container_object);
 }
 
@@ -6202,10 +6226,24 @@ void MacroAssembler::JumpCodeObject(Register code_data_container_object,
                                     JumpMode jump_mode) {
   ASM_CODE_COMMENT(this);
   DCHECK_EQ(JumpMode::kJump, jump_mode);
-  LoadCodeEntry(code_data_container_object, code_data_container_object);
+  LoadCodeInstructionStart(code_data_container_object,
+                           code_data_container_object);
   Jump(code_data_container_object);
 }
 
+void MacroAssembler::CallJSFunction(Register function_object) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  Ld(code, FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  CallCodeObject(code);
+}
+
+void MacroAssembler::JumpJSFunction(Register function_object,
+                                    JumpMode jump_mode) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  Ld(code, FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  JumpCodeObject(code, jump_mode);
+}
+
 namespace {
 
 void TailCallOptimizedCodeSlot(MacroAssembler* masm,
@@ -6240,7 +6278,7 @@ void TailCallOptimizedCodeSlot(MacroAssembler* masm,
                                          scratch1, scratch2);
 
   static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-  __ LoadCodeEntry(a2, optimized_code_entry);
+  __ LoadCodeInstructionStart(a2, optimized_code_entry);
   __ Jump(a2);
 
   // Optimized code slot contains deoptimized code or code is cleared and
@@ -6300,7 +6338,7 @@ void MacroAssembler::GenerateTailCallToReturnedCode(
   }
 
   static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-  LoadCodeEntry(a2, v0);
+  LoadCodeInstructionStart(a2, v0);
   Jump(a2);
 }
 
@@ -6354,6 +6392,176 @@ void MacroAssembler::OptimizeCodeOrTailCallOptimizedCodeSlot(
   TailCallOptimizedCodeSlot(this, optimized_code_entry, t3, a5);
 }
 
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context. On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand) {
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  Register return_value = v0;
+  Register scratch = a4;
+  Register scratch2 = a5;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = s0;
+  Register prev_limit_reg = s1;
+  Register prev_level_reg = s2;
+
+  // C arguments (arg_reg_1/2) are expected to be initialized outside, so this
+  // function must not corrupt them (return_value overlaps with arg_reg_1 but
+  // that's ok because we start using it only after the C call).
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2,  // C args
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ Ld(prev_next_address_reg, next_mem_op);
+    __ Ld(prev_limit_reg, limit_mem_op);
+    __ Lw(prev_level_reg, level_mem_op);
+    __ Addu(scratch, prev_level_reg, Operand(1));
+    __ Sw(scratch, level_mem_op);
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ Lb(scratch, __ ExternalReferenceAsOperand(
+                       ER::execution_mode_address(isolate), no_reg));
+    __ Branch(&profiler_or_side_effects_check_enabled, ne, scratch,
+              Operand(zero_reg));
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ li(scratch, ER::address_of_runtime_stats_flag());
+    __ Lw(scratch, MemOperand(scratch, 0));
+    __ Branch(&profiler_or_side_effects_check_enabled, ne, scratch,
+              Operand(zero_reg));
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ StoreReturnAddressAndCall(function_address);
+  __ bind(&done_api_call);
+
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  __ RecordComment("Load value from ReturnValue.");
+  __ Ld(return_value, return_value_operand);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ Sd(prev_next_address_reg, next_mem_op);
+    if (v8_flags.debug_code) {
+      __ Lw(scratch, level_mem_op);
+      __ Subu(scratch, scratch, Operand(1));
+      __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall, scratch,
+               Operand(prev_level_reg));
+    }
+    __ Sw(prev_level_reg, level_mem_op);
+    __ Ld(scratch, limit_mem_op);
+    __ Branch(&delete_allocated_handles, ne, prev_limit_reg, Operand(scratch));
+  }
+
+  __ RecordComment("Leave the API exit frame.");
+  __ bind(&leave_exit_frame);
+
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand == nullptr) {
+    DCHECK_NE(stack_space, 0);
+    __ li(stack_space_reg, Operand(stack_space));
+  } else {
+    DCHECK_EQ(stack_space, 0);
+    static_assert(kCArgSlotCount == 0);
+    __ Ld(stack_space_reg, *stack_space_operand);
+  }
+
+  static constexpr bool kRegisterContainsSlotCount = false;
+  __ LeaveExitFrame(stack_space_reg, NO_EMIT_RETURN,
+                    kRegisterContainsSlotCount);
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ LoadRoot(scratch, RootIndex::kTheHoleValue);
+    __ Ld(scratch2, __ ExternalReferenceAsOperand(
+                        ER::scheduled_exception_address(isolate), no_reg));
+    __ Branch(&promote_scheduled_exception, ne, scratch, Operand(scratch2));
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ Branch(&finish_return, ne, return_value, RootIndex::kTheHoleValue);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch, scratch2,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  __ Ret();
+
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via thunk wrapper.");
+    __ bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ Sd(thunk_arg, thunk_arg_mem_op);
+    __ li(scratch, thunk_ref);
+    __ StoreReturnAddressAndCall(scratch);
+    __ Branch(&done_api_call);
+  }
+
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ bind(&delete_allocated_handles);
+    __ Sd(prev_limit_reg, limit_mem_op);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ mov(saved_result, v0);
+    __ mov(arg_reg_1, v0);
+    __ PrepareCallCFunction(1, prev_level_reg);
+    __ li(arg_reg_1, ER::isolate_address(isolate));
+    __ CallCFunction(ER::delete_handle_scope_extensions(), 1);
+    __ mov(v0, saved_result);
+    __ jmp(&leave_exit_frame);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/mips64/macro-assembler-mips64.h b/deps/v8/src/codegen/mips64/macro-assembler-mips64.h
index 2494edb2172822..61415c6d0f67b1 100644
--- a/deps/v8/src/codegen/mips64/macro-assembler-mips64.h
+++ b/deps/v8/src/codegen/mips64/macro-assembler-mips64.h
@@ -12,6 +12,7 @@
 #include "src/codegen/assembler.h"
 #include "src/codegen/mips64/assembler-mips64.h"
 #include "src/common/globals.h"
+#include "src/execution/frame-constants.h"
 #include "src/objects/tagged-index.h"
 
 namespace v8 {
@@ -137,6 +138,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void Assert(Condition cc, AbortReason reason, Register rs,
               Operand rt) NOOP_UNLESS_DEBUG_CODE;
 
+  void AssertJSAny(Register object, Register map_tmp, Register tmp,
+                   AbortReason abort_reason) NOOP_UNLESS_DEBUG_CODE;
+
   // Like Assert(), but always enabled.
   void Check(Condition cc, AbortReason reason, Register rs, Operand rt);
 
@@ -198,6 +202,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void BranchMSA(Label* target, MSABranchDF df, MSABranchCondition cond,
                  MSARegister wt, BranchDelaySlot bd = PROTECT);
 
+  void CompareWord(Condition cond, Register dst, Register lhs,
+                   const Operand& rhs);
+
   void BranchLong(int32_t offset, BranchDelaySlot bdslot = PROTECT);
   void Branch(Label* L, Condition cond, Register rs, RootIndex index,
               BranchDelaySlot bdslot = PROTECT);
@@ -253,22 +260,27 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void Call(Label* target);
   void LoadAddress(Register dst, Label* target);
 
-  // Load the builtin given by the Smi in |builtin_index| into the same
-  // register.
-  void LoadEntryFromBuiltinIndex(Register builtin);
+  // Load the builtin given by the Smi in |builtin_index| into |target|.
+  void LoadEntryFromBuiltinIndex(Register builtin_index, Register target);
   void LoadEntryFromBuiltin(Builtin builtin, Register destination);
   MemOperand EntryFromBuiltinAsOperand(Builtin builtin);
 
-  void CallBuiltinByIndex(Register builtin);
+  void CallBuiltinByIndex(Register builtin_index, Register target);
   void CallBuiltin(Builtin builtin);
   void TailCallBuiltin(Builtin builtin);
 
   // Load the code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_data_container_object);
+  void LoadCodeInstructionStart(Register destination,
+                                Register code_data_container_object);
   void CallCodeObject(Register code_data_container_object);
   void JumpCodeObject(Register code_data_container_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object);
+  void JumpJSFunction(Register function_object,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   // Generates an instruction sequence s.t. the return address points to the
   // instruction following the call.
   // The return address on the stack is used by frame iteration.
@@ -620,8 +632,6 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void LoadZeroIfConditionNotZero(Register dest, Register condition);
   void LoadZeroIfConditionZero(Register dest, Register condition);
-  void LoadZeroOnCondition(Register rd, Register rs, const Operand& rt,
-                           Condition cond);
 
   void Clz(Register rd, Register rs);
   void Dclz(Register rd, Register rs);
@@ -919,16 +929,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void BindExceptionHandler(Label* label) { bind(label); }
 
   // It assumes that the arguments are located below the stack pointer.
-  // argc is the number of arguments not including the receiver.
-  // TODO(victorgomes): Remove this function once we stick with the reversed
-  // arguments order.
-  void LoadReceiver(Register dest, Register argc) {
-    Ld(dest, MemOperand(sp, 0));
-  }
-
-  void StoreReceiver(Register rec, Register argc, Register scratch) {
-    Sd(rec, MemOperand(sp, 0));
-  }
+  void LoadReceiver(Register dest) { Ld(dest, MemOperand(sp, 0)); }
+  void StoreReceiver(Register rec) { Sd(rec, MemOperand(sp, 0)); }
 
   bool IsNear(Label* L, Condition cond, int rs_reg);
 
@@ -1317,9 +1319,35 @@ struct MoveCycleState {
   base::Optional<Register> scratch_reg;
 };
 
-#define ACCESS_MASM(masm) masm->
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameStackSlotOperand(int offset) {
+  // The slot at [sp] is reserved in all ExitFrames for storing the return
+  // address before doing the actual call, it's necessary for frame iteration
+  // (see StoreReturnAddressAndCall for details).
+  static constexpr int kSPOffset = 1 * kSystemPointerSize;
+  return MemOperand(sp, kSPOffset + offset);
+}
+
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameCallerStackSlotOperand(int index) {
+  return MemOperand(fp, (ExitFrameConstants::kFixedSlotCountAboveFp + index) *
+                            kSystemPointerSize);
+}
+
+// Calls an API function. Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand);
 
 }  // namespace internal
 }  // namespace v8
 
+#define ACCESS_MASM(masm) masm->
+
 #endif  // V8_CODEGEN_MIPS64_MACRO_ASSEMBLER_MIPS64_H_
diff --git a/deps/v8/src/codegen/mips64/register-mips64.h b/deps/v8/src/codegen/mips64/register-mips64.h
index f3abb8fbecf3ca..6788cb3b5f159d 100644
--- a/deps/v8/src/codegen/mips64/register-mips64.h
+++ b/deps/v8/src/codegen/mips64/register-mips64.h
@@ -114,6 +114,13 @@ int ToNumber(Register reg);
 
 Register ToRegister(int num);
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 // Returns the number of padding slots needed for stack pointer alignment.
 constexpr int ArgumentPaddingSlots(int argument_count) {
   // No argument padding required.
@@ -278,6 +285,12 @@ DEFINE_REGISTER_NAMES(FPURegister, DOUBLE_REGISTERS)
 DEFINE_REGISTER_NAMES(MSARegister, SIMD128_REGISTERS)
 
 // Give alias names to registers for calling conventions.
+
+constexpr Register arg_reg_1 = a0;
+constexpr Register arg_reg_2 = a1;
+constexpr Register arg_reg_3 = a2;
+constexpr Register arg_reg_4 = a3;
+
 constexpr Register kReturnRegister0 = v0;
 constexpr Register kReturnRegister1 = v1;
 constexpr Register kReturnRegister2 = a0;
diff --git a/deps/v8/src/codegen/optimized-compilation-info.cc b/deps/v8/src/codegen/optimized-compilation-info.cc
index 8690b0f7df31de..c2fae3881d7c2e 100644
--- a/deps/v8/src/codegen/optimized-compilation-info.cc
+++ b/deps/v8/src/codegen/optimized-compilation-info.cc
@@ -34,6 +34,8 @@ OptimizedCompilationInfo::OptimizedCompilationInfo(
   bytecode_array_ = handle(shared->GetBytecodeArray(isolate), isolate);
   shared_info_ = shared;
   closure_ = closure;
+  canonical_handles_ = std::make_unique<CanonicalHandlesMap>(
+      isolate->heap(), ZoneAllocationPolicy(zone));
 
   // Collect source positions for optimized code when profiling or if debugger
   // is active, to be able to get more precise source positions at the price of
@@ -80,6 +82,10 @@ void OptimizedCompilationInfo::ConfigureFlags() {
       if (v8_flags.turbo_splitting) set_splitting();
       break;
     case CodeKind::BUILTIN:
+#ifdef V8_ENABLE_BUILTIN_JUMP_TABLE_SWITCH
+      set_switch_jump_table();
+#endif  // V8_TARGET_ARCH_X64
+      V8_FALLTHROUGH;
     case CodeKind::FOR_TESTING:
       if (v8_flags.turbo_splitting) set_splitting();
       if (v8_flags.enable_allocation_folding) set_allocation_folding();
@@ -111,15 +117,16 @@ OptimizedCompilationInfo::~OptimizedCompilationInfo() {
   }
 }
 
-void OptimizedCompilationInfo::ReopenHandlesInNewHandleScope(Isolate* isolate) {
+void OptimizedCompilationInfo::ReopenAndCanonicalizeHandlesInNewScope(
+    Isolate* isolate) {
   if (!shared_info_.is_null()) {
-    shared_info_ = Handle<SharedFunctionInfo>(*shared_info_, isolate);
+    shared_info_ = CanonicalHandle(*shared_info_, isolate);
   }
   if (!bytecode_array_.is_null()) {
-    bytecode_array_ = Handle<BytecodeArray>(*bytecode_array_, isolate);
+    bytecode_array_ = CanonicalHandle(*bytecode_array_, isolate);
   }
   if (!closure_.is_null()) {
-    closure_ = Handle<JSFunction>(*closure_, isolate);
+    closure_ = CanonicalHandle(*closure_, isolate);
   }
   DCHECK(code_.is_null());
 }
@@ -194,7 +201,7 @@ bool OptimizedCompilationInfo::has_context() const {
   return !closure().is_null();
 }
 
-Context OptimizedCompilationInfo::context() const {
+Tagged<Context> OptimizedCompilationInfo::context() const {
   DCHECK(has_context());
   return closure()->context();
 }
@@ -203,7 +210,7 @@ bool OptimizedCompilationInfo::has_native_context() const {
   return !closure().is_null() && !closure()->native_context().is_null();
 }
 
-NativeContext OptimizedCompilationInfo::native_context() const {
+Tagged<NativeContext> OptimizedCompilationInfo::native_context() const {
   DCHECK(has_native_context());
   return closure()->native_context();
 }
@@ -212,9 +219,9 @@ bool OptimizedCompilationInfo::has_global_object() const {
   return has_native_context();
 }
 
-JSGlobalObject OptimizedCompilationInfo::global_object() const {
+Tagged<JSGlobalObject> OptimizedCompilationInfo::global_object() const {
   DCHECK(has_global_object());
-  return native_context().global_object();
+  return native_context()->global_object();
 }
 
 int OptimizedCompilationInfo::AddInlinedFunction(
@@ -233,6 +240,7 @@ void OptimizedCompilationInfo::SetTracingFlags(bool passes_filter) {
   if (v8_flags.trace_turbo_scheduled) set_trace_turbo_scheduled();
   if (v8_flags.trace_turbo_alloc) set_trace_turbo_allocation();
   if (v8_flags.trace_heap_broker) set_trace_heap_broker();
+  if (v8_flags.turboshaft_trace_reduction) set_turboshaft_trace_reduction();
 }
 
 OptimizedCompilationInfo::InlinedFunctionHolder::InlinedFunctionHolder(
diff --git a/deps/v8/src/codegen/optimized-compilation-info.h b/deps/v8/src/codegen/optimized-compilation-info.h
index 5a9c4a249137e6..54d13d672243c2 100644
--- a/deps/v8/src/codegen/optimized-compilation-info.h
+++ b/deps/v8/src/codegen/optimized-compilation-info.h
@@ -17,6 +17,7 @@
 #include "src/handles/handles.h"
 #include "src/handles/persistent-handles.h"
 #include "src/objects/objects.h"
+#include "src/objects/tagged.h"
 #include "src/utils/identity-map.h"
 #include "src/utils/utils.h"
 
@@ -36,6 +37,7 @@ class Zone;
 
 namespace compiler {
 class NodeObserver;
+class JSHeapBroker;
 }
 
 namespace wasm {
@@ -67,9 +69,9 @@ class V8_EXPORT_PRIVATE OptimizedCompilationInfo final {
   V(TraceTurboScheduled, trace_turbo_scheduled, 13)                  \
   V(TraceTurboAllocation, trace_turbo_allocation, 14)                \
   V(TraceHeapBroker, trace_heap_broker, 15)                          \
-  V(WasmRuntimeExceptionSupport, wasm_runtime_exception_support, 16) \
-  V(DiscardResultForTesting, discard_result_for_testing, 17)         \
-  V(InlineJSWasmCalls, inline_js_wasm_calls, 18)
+  V(DiscardResultForTesting, discard_result_for_testing, 16)         \
+  V(InlineJSWasmCalls, inline_js_wasm_calls, 17)                     \
+  V(TurboshaftTraceReduction, turboshaft_trace_reduction, 18)
 
   enum Flag {
 #define DEF_ENUM(Camel, Lower, Bit) k##Camel = 1 << Bit,
@@ -139,13 +141,13 @@ class V8_EXPORT_PRIVATE OptimizedCompilationInfo final {
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   bool has_context() const;
-  Context context() const;
+  Tagged<Context> context() const;
 
   bool has_native_context() const;
-  NativeContext native_context() const;
+  Tagged<NativeContext> native_context() const;
 
   bool has_global_object() const;
-  JSGlobalObject global_object() const;
+  Tagged<JSGlobalObject> global_object() const;
 
   // Accessors for the different compilation modes.
   bool IsOptimizing() const {
@@ -169,7 +171,18 @@ class V8_EXPORT_PRIVATE OptimizedCompilationInfo final {
     DCHECK_NOT_NULL(canonical_handles_);
   }
 
-  void ReopenHandlesInNewHandleScope(Isolate* isolate);
+  template <typename T>
+  Handle<T> CanonicalHandle(Tagged<T> object, Isolate* isolate) {
+    DCHECK_NOT_NULL(canonical_handles_);
+    DCHECK(PersistentHandlesScope::IsActive(isolate));
+    auto find_result = canonical_handles_->FindOrInsert(object);
+    if (!find_result.already_exists) {
+      *find_result.entry = Handle<T>(object, isolate).location();
+    }
+    return Handle<T>(*find_result.entry);
+  }
+
+  void ReopenAndCanonicalizeHandlesInNewScope(Isolate* isolate);
 
   void AbortOptimization(BailoutReason reason);
 
@@ -247,6 +260,14 @@ class V8_EXPORT_PRIVATE OptimizedCompilationInfo final {
 
   void SetTracingFlags(bool passes_filter);
 
+  // Storing the raw pointer to the CanonicalHandlesMap is generally not safe.
+  // Use DetachCanonicalHandles() to transfer ownership instead.
+  // We explicitly allow the JSHeapBroker to store the raw pointer as it is
+  // guaranteed that the OptimizedCompilationInfo's lifetime exceeds the
+  // lifetime of the broker.
+  CanonicalHandlesMap* canonical_handles() { return canonical_handles_.get(); }
+  friend class compiler::JSHeapBroker;
+
   // Compilation flags.
   unsigned flags_ = 0;
 
diff --git a/deps/v8/src/codegen/pending-optimization-table.cc b/deps/v8/src/codegen/pending-optimization-table.cc
index ff6f1f3d679af1..c0f0b8d6916795 100644
--- a/deps/v8/src/codegen/pending-optimization-table.cc
+++ b/deps/v8/src/codegen/pending-optimization-table.cc
@@ -16,14 +16,14 @@ namespace internal {
 void ManualOptimizationTable::MarkFunctionForManualOptimization(
     Isolate* isolate, Handle<JSFunction> function,
     IsCompiledScope* is_compiled_scope) {
-  DCHECK(v8_flags.testing_d8_test_runner);
+  DCHECK(v8_flags.testing_d8_test_runner || v8_flags.allow_natives_syntax);
   DCHECK(is_compiled_scope->is_compiled());
   DCHECK(function->has_feedback_vector());
 
   Handle<SharedFunctionInfo> shared_info(function->shared(), isolate);
 
   Handle<ObjectHashTable> table =
-      isolate->heap()->functions_marked_for_manual_optimization().IsUndefined()
+      IsUndefined(isolate->heap()->functions_marked_for_manual_optimization())
           ? ObjectHashTable::New(isolate, 1)
           : handle(ObjectHashTable::cast(
                        isolate->heap()
@@ -36,31 +36,33 @@ void ManualOptimizationTable::MarkFunctionForManualOptimization(
 }
 
 void ManualOptimizationTable::CheckMarkedForManualOptimization(
-    Isolate* isolate, JSFunction function) {
+    Isolate* isolate, Tagged<JSFunction> function) {
   if (!IsMarkedForManualOptimization(isolate, function)) {
     PrintF("Error: Function ");
-    function.ShortPrint();
+    ShortPrint(function);
     PrintF(
         " should be prepared for optimization with "
         "%%PrepareFunctionForOptimization before  "
-        "%%OptimizeFunctionOnNextCall / %%OptimizeOSR ");
+        "%%OptimizeFunctionOnNextCall / %%OptimizeMaglevOnNextCall / "
+        "%%OptimizeOSR ");
     UNREACHABLE();
   }
 }
 
 bool ManualOptimizationTable::IsMarkedForManualOptimization(
-    Isolate* isolate, JSFunction function) {
-  DCHECK(v8_flags.testing_d8_test_runner);
+    Isolate* isolate, Tagged<JSFunction> function) {
+  DCHECK(v8_flags.testing_d8_test_runner || v8_flags.allow_natives_syntax);
 
   Handle<Object> table = handle(
       isolate->heap()->functions_marked_for_manual_optimization(), isolate);
   Handle<Object> entry =
-      table->IsUndefined()
+      IsUndefined(*table)
           ? handle(ReadOnlyRoots(isolate).the_hole_value(), isolate)
           : handle(Handle<ObjectHashTable>::cast(table)->Lookup(
-                       handle(function.shared(), isolate)),
+                       handle(function->shared(), isolate)),
                    isolate);
-  return !entry->IsTheHole();
+
+  return !IsTheHole(*entry);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/codegen/pending-optimization-table.h b/deps/v8/src/codegen/pending-optimization-table.h
index 459f963874541c..2c739564164a7f 100644
--- a/deps/v8/src/codegen/pending-optimization-table.h
+++ b/deps/v8/src/codegen/pending-optimization-table.h
@@ -31,12 +31,12 @@ class ManualOptimizationTable {
   // via the intrinsics. This will check whether
   // MarkFunctionForManualOptimization was called with this function.
   static void CheckMarkedForManualOptimization(Isolate* isolate,
-                                               JSFunction function);
+                                               Tagged<JSFunction> function);
 
   // Returns true if MarkFunctionForManualOptimization was called with this
   // function.
   static bool IsMarkedForManualOptimization(Isolate* isolate,
-                                            JSFunction function);
+                                            Tagged<JSFunction> function);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/codegen/ppc/assembler-ppc-inl.h b/deps/v8/src/codegen/ppc/assembler-ppc-inl.h
index 4bead935f33c7f..0680f6db937bc2 100644
--- a/deps/v8/src/codegen/ppc/assembler-ppc-inl.h
+++ b/deps/v8/src/codegen/ppc/assembler-ppc-inl.h
@@ -145,7 +145,7 @@ Handle<Object> Assembler::code_target_object_handle_at(Address pc,
   return GetCodeTarget(index);
 }
 
-HeapObject RelocInfo::target_object(PtrComprCageBase cage_base) {
+Tagged<HeapObject> RelocInfo::target_object(PtrComprCageBase cage_base) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
     return HeapObject::cast(Object(V8HeapCompressionScheme::DecompressTagged(
@@ -176,8 +176,7 @@ Handle<HeapObject> RelocInfo::target_object_handle(Assembler* origin) {
   }
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(Tagged<HeapObject> target,
                                   ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
@@ -190,9 +189,6 @@ void RelocInfo::set_target_object(Heap* heap, HeapObject target,
     Assembler::set_target_address_at(pc_, constant_pool_, target.ptr(),
                                      icache_flush_mode);
   }
-  if (!instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target, write_barrier_mode);
-  }
 }
 
 Address RelocInfo::target_external_reference() {
@@ -401,9 +397,9 @@ Address Assembler::target_constant_pool_address_at(
 // has already deserialized the mov instructions etc.
 // There is a FIXED_SEQUENCE assumption here
 void Assembler::deserialization_set_special_target_at(
-    Address instruction_payload, Code code, Address target) {
+    Address instruction_payload, Tagged<Code> code, Address target) {
   set_target_address_at(instruction_payload,
-                        !code.is_null() ? code.constant_pool() : kNullAddress,
+                        !code.is_null() ? code->constant_pool() : kNullAddress,
                         target);
 }
 
diff --git a/deps/v8/src/codegen/ppc/assembler-ppc.cc b/deps/v8/src/codegen/ppc/assembler-ppc.cc
index a6bc4bc7ffdf9b..84e7581f776898 100644
--- a/deps/v8/src/codegen/ppc/assembler-ppc.cc
+++ b/deps/v8/src/codegen/ppc/assembler-ppc.cc
@@ -207,7 +207,7 @@ MemOperand::MemOperand(Register ra, Register rb)
 MemOperand::MemOperand(Register ra, Register rb, int64_t offset)
     : ra_(ra), offset_(offset), rb_(rb) {}
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Handle<HeapObject> object =
@@ -242,8 +242,11 @@ Assembler::Assembler(const AssemblerOptions& options,
   relocations_.reserve(128);
 }
 
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
-                        SafepointTableBuilder* safepoint_table_builder,
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
+}
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
+                        SafepointTableBuilderBase* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
   // raw workflow to create InstructionStream objects (mostly in tests), add
@@ -483,7 +486,7 @@ void Assembler::target_at_put(int pos, int target_pos, bool* is_branch) {
       int32_t offset =
           target_pos + (InstructionStream::kHeaderSize - kHeapObjectTag);
       PatchingAssembler patcher(
-          options(), reinterpret_cast<byte*>(buffer_start_ + pos), 2);
+          options(), reinterpret_cast<uint8_t*>(buffer_start_ + pos), 2);
       patcher.bitwise_mov32(dst, offset);
       break;
     }
@@ -498,7 +501,7 @@ void Assembler::target_at_put(int pos, int target_pos, bool* is_branch) {
                           : (SIGN_EXT_IMM22(operands & kImm22Mask));
       int32_t offset = target_pos + delta;
       PatchingAssembler patcher(
-          options(), reinterpret_cast<byte*>(buffer_start_ + pos),
+          options(), reinterpret_cast<uint8_t*>(buffer_start_ + pos),
           2 + static_cast<int32_t>(opcode == kUnboundAddLabelLongOffsetOpcode));
       patcher.bitwise_add32(dst, base, offset);
       if (opcode == kUnboundAddLabelLongOffsetOpcode) patcher.nop();
@@ -508,7 +511,7 @@ void Assembler::target_at_put(int pos, int target_pos, bool* is_branch) {
       // Load the address of the label in a register.
       Register dst = Register::from_code(instr_at(pos + kInstrSize));
       PatchingAssembler patcher(options(),
-                                reinterpret_cast<byte*>(buffer_start_ + pos),
+                                reinterpret_cast<uint8_t*>(buffer_start_ + pos),
                                 kMovInstructionsNoConstantPool);
       // Keep internal references relative until EmitRelocations.
       patcher.bitwise_mov(dst, target_pos);
@@ -516,7 +519,7 @@ void Assembler::target_at_put(int pos, int target_pos, bool* is_branch) {
     }
     case kUnboundJumpTableEntryOpcode: {
       PatchingAssembler patcher(options(),
-                                reinterpret_cast<byte*>(buffer_start_ + pos),
+                                reinterpret_cast<uint8_t*>(buffer_start_ + pos),
                                 kSystemPointerSize / kInstrSize);
       // Keep internal references relative until EmitRelocations.
       patcher.dp(target_pos);
@@ -2135,7 +2138,7 @@ void Assembler::GrowBuffer(int needed) {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   intptr_t pc_delta = new_start - buffer_start_;
@@ -2163,32 +2166,20 @@ void Assembler::db(uint8_t data) {
   pc_ += sizeof(uint8_t);
 }
 
-void Assembler::dd(uint32_t data, RelocInfo::Mode rmode) {
+void Assembler::dd(uint32_t data) {
   CheckBuffer();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uint32_t*>(pc_) = data;
   pc_ += sizeof(uint32_t);
 }
 
-void Assembler::dq(uint64_t value, RelocInfo::Mode rmode) {
+void Assembler::dq(uint64_t value) {
   CheckBuffer();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uint64_t*>(pc_) = value;
   pc_ += sizeof(uint64_t);
 }
 
-void Assembler::dp(uintptr_t data, RelocInfo::Mode rmode) {
+void Assembler::dp(uintptr_t data) {
   CheckBuffer();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uintptr_t*>(pc_) = data;
   pc_ += sizeof(uintptr_t);
 }
@@ -2206,7 +2197,7 @@ void Assembler::EmitRelocations() {
        it != relocations_.end(); it++) {
     RelocInfo::Mode rmode = it->rmode();
     Address pc = reinterpret_cast<Address>(buffer_start_) + it->position();
-    RelocInfo rinfo(pc, rmode, it->data(), Code(), InstructionStream());
+    RelocInfo rinfo(pc, rmode, it->data());
 
     // Fix up internal references now that they are guaranteed to be bound.
     if (RelocInfo::IsInternalReference(rmode)) {
@@ -2261,7 +2252,7 @@ void Assembler::CheckTrampolinePool() {
 }
 
 PatchingAssembler::PatchingAssembler(const AssemblerOptions& options,
-                                     byte* address, int instructions)
+                                     uint8_t* address, int instructions)
     : Assembler(options, ExternalAssemblerBuffer(
                              address, instructions * kInstrSize + kGap)) {
   DCHECK_EQ(reloc_info_writer.pos(), buffer_start_ + buffer_->size());
@@ -2273,20 +2264,6 @@ PatchingAssembler::~PatchingAssembler() {
   DCHECK_EQ(reloc_info_writer.pos(), buffer_start_ + buffer_->size());
 }
 
-UseScratchRegisterScope::UseScratchRegisterScope(Assembler* assembler)
-    : assembler_(assembler),
-      old_available_(*assembler->GetScratchRegisterList()) {}
-
-UseScratchRegisterScope::~UseScratchRegisterScope() {
-  *assembler_->GetScratchRegisterList() = old_available_;
-}
-
-Register UseScratchRegisterScope::Acquire() {
-  RegList* available = assembler_->GetScratchRegisterList();
-  DCHECK_NOT_NULL(available);
-  return available->PopFirst();
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/ppc/assembler-ppc.h b/deps/v8/src/codegen/ppc/assembler-ppc.h
index 6cff641b5b81cf..c59f20c25e5bf6 100644
--- a/deps/v8/src/codegen/ppc/assembler-ppc.h
+++ b/deps/v8/src/codegen/ppc/assembler-ppc.h
@@ -76,7 +76,7 @@ class V8_EXPORT_PRIVATE Operand {
     value_.immediate = static_cast<intptr_t>(f.address());
   }
   explicit Operand(Handle<HeapObject> handle);
-  V8_INLINE explicit Operand(Smi value) : rmode_(RelocInfo::NO_INFO) {
+  V8_INLINE explicit Operand(Tagged<Smi> value) : rmode_(RelocInfo::NO_INFO) {
     value_.immediate = static_cast<intptr_t>(value.ptr());
   }
   // rm
@@ -184,13 +184,15 @@ class Assembler : public AssemblerBase {
 
   // GetCode emits any pending (non-emitted) code and fills the descriptor desc.
   static constexpr int kNoHandlerTable = 0;
-  static constexpr SafepointTableBuilder* kNoSafepointTable = nullptr;
-  void GetCode(Isolate* isolate, CodeDesc* desc,
-               SafepointTableBuilder* safepoint_table_builder,
+  static constexpr SafepointTableBuilderBase* kNoSafepointTable = nullptr;
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
+               SafepointTableBuilderBase* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -276,7 +278,7 @@ class Assembler : public AssemblerBase {
   // This sets the branch destination.
   // This is for calls and branches within generated code.
   inline static void deserialization_set_special_target_at(
-      Address instruction_payload, Code code, Address target);
+      Address instruction_payload, Tagged<Code>, Address target);
 
   // Get the size of the special target encoded at 'instruction_payload'.
   inline static int deserialization_special_target_size(
@@ -472,10 +474,17 @@ class Assembler : public AssemblerBase {
 #undef DECLARE_PPC_XX2_VECTOR_INSTRUCTIONS
 #undef DECLARE_PPC_XX2_SCALAR_INSTRUCTIONS
 
-#define DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS(name, instr_name, instr_value) \
-  inline void name(const Simd128Register rt, const Simd128Register ra,     \
-                   const Simd128Register rb) {                             \
-    xx3_form(instr_name, rt, ra, rb);                                      \
+#define DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS_A_FORM(name, instr_name,     \
+                                                   instr_value)          \
+  inline void name(const Simd128Register rt, const Simd128Register ra,   \
+                   const Simd128Register rb, const RCBit rc = LeaveRC) { \
+    xx3_form(instr_name, rt, ra, rb, rc);                                \
+  }
+#define DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS_B_FORM(name, instr_name,   \
+                                                   instr_value)        \
+  inline void name(const Simd128Register rt, const Simd128Register ra, \
+                   const Simd128Register rb) {                         \
+    xx3_form(instr_name, rt, ra, rb);                                  \
   }
 #define DECLARE_PPC_XX3_SCALAR_INSTRUCTIONS(name, instr_name, instr_value) \
   inline void name(const DoubleRegister rt, const DoubleRegister ra,       \
@@ -483,6 +492,15 @@ class Assembler : public AssemblerBase {
     xx3_form(instr_name, rt, ra, rb);                                      \
   }
 
+  inline void xx3_form(Instr instr, Simd128Register t, Simd128Register a,
+                       Simd128Register b, int rc) {
+    // Using VR (high VSR) registers.
+    int AX = 1, BX = 1, TX = 1;
+
+    emit(instr | (t.code() & 0x1F) * B21 | (a.code() & 0x1F) * B16 |
+         (b.code() & 0x1F) * B11 | rc * B10 | AX * B2 | BX * B1 | TX);
+  }
+
   template <typename T>
   inline void xx3_form(Instr instr, T t, T a, T b) {
     static_assert(std::is_same<T, Simd128Register>::value ||
@@ -499,9 +517,11 @@ class Assembler : public AssemblerBase {
          (b.code() & 0x1F) * B11 | AX * B2 | BX * B1 | TX);
   }
 
-  PPC_XX3_OPCODE_VECTOR_LIST(DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS)
+  PPC_XX3_OPCODE_VECTOR_A_FORM_LIST(DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS_A_FORM)
+  PPC_XX3_OPCODE_VECTOR_B_FORM_LIST(DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS_B_FORM)
   PPC_XX3_OPCODE_SCALAR_LIST(DECLARE_PPC_XX3_SCALAR_INSTRUCTIONS)
-#undef DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS
+#undef DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS_A_FORM
+#undef DECLARE_PPC_XX3_VECTOR_INSTRUCTIONS_B_FORM
 #undef DECLARE_PPC_XX3_SCALAR_INSTRUCTIONS
 
 #define DECLARE_PPC_VX_INSTRUCTIONS_A_FORM(name, instr_name, instr_value) \
@@ -1245,9 +1265,9 @@ class Assembler : public AssemblerBase {
   // Writes a single byte or word of data in the code stream.  Used
   // for inline tables, e.g., jump-tables.
   void db(uint8_t data);
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
+  void dd(uint32_t data);
+  void dq(uint64_t data);
+  void dp(uintptr_t data);
 
   // Read/patch instructions
   Instr instr_at(int pos) {
@@ -1533,7 +1553,7 @@ class Assembler : public AssemblerBase {
   Trampoline trampoline_;
   bool internal_trampoline_exception_;
 
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
@@ -1551,17 +1571,24 @@ class EnsureSpace {
 
 class PatchingAssembler : public Assembler {
  public:
-  PatchingAssembler(const AssemblerOptions& options, byte* address,
+  PatchingAssembler(const AssemblerOptions& options, uint8_t* address,
                     int instructions);
   ~PatchingAssembler();
 };
 
 class V8_EXPORT_PRIVATE V8_NODISCARD UseScratchRegisterScope {
  public:
-  explicit UseScratchRegisterScope(Assembler* assembler);
-  ~UseScratchRegisterScope();
+  explicit UseScratchRegisterScope(Assembler* assembler)
+      : assembler_(assembler),
+        old_available_(*assembler->GetScratchRegisterList()) {}
 
-  Register Acquire();
+  ~UseScratchRegisterScope() {
+    *assembler_->GetScratchRegisterList() = old_available_;
+  }
+
+  Register Acquire() {
+    return assembler_->GetScratchRegisterList()->PopFirst();
+  }
 
   // Check if we have registers available to acquire.
   bool CanAcquire() const {
diff --git a/deps/v8/src/codegen/ppc/constants-ppc.h b/deps/v8/src/codegen/ppc/constants-ppc.h
index 6ddb3da4112992..8617217ef7078b 100644
--- a/deps/v8/src/codegen/ppc/constants-ppc.h
+++ b/deps/v8/src/codegen/ppc/constants-ppc.h
@@ -273,17 +273,19 @@ using Instr = uint32_t;
   /* VSX Scalar Test for software Divide Double-Precision */          \
   V(xstdivdp, XSTDIVDP, 0xF00001E8)
 
-#define PPC_XX3_OPCODE_VECTOR_LIST(V)                                         \
+#define PPC_XX3_OPCODE_VECTOR_A_FORM_LIST(V)         \
+  /* VSX Vector Compare Equal To Single-Precision */ \
+  V(xvcmpeqsp, XVCMPEQSP, 0xF0000218)                \
+  /* VSX Vector Compare Equal To Double-Precision */ \
+  V(xvcmpeqdp, XVCMPEQDP, 0xF0000318)
+
+#define PPC_XX3_OPCODE_VECTOR_B_FORM_LIST(V)                                  \
   /* VSX Vector Add Double-Precision */                                       \
   V(xvadddp, XVADDDP, 0xF0000300)                                             \
   /* VSX Vector Add Single-Precision */                                       \
   V(xvaddsp, XVADDSP, 0xF0000200)                                             \
-  /* VSX Vector Compare Equal To Double-Precision */                          \
-  V(xvcmpeqdp, XVCMPEQDP, 0xF0000318)                                         \
   /* VSX Vector Compare Equal To Double-Precision & record CR6 */             \
   V(xvcmpeqdpx, XVCMPEQDPx, 0xF0000718)                                       \
-  /* VSX Vector Compare Equal To Single-Precision */                          \
-  V(xvcmpeqsp, XVCMPEQSP, 0xF0000218)                                         \
   /* VSX Vector Compare Equal To Single-Precision & record CR6 */             \
   V(xvcmpeqspx, XVCMPEQSPx, 0xF0000618)                                       \
   /* VSX Vector Compare Greater Than or Equal To Double-Precision */          \
@@ -393,6 +395,10 @@ using Instr = uint32_t;
   /* VSX Splat Word */                                                        \
   V(xxspltw, XXSPLTW, 0xF0000290)
 
+#define PPC_XX3_OPCODE_VECTOR_LIST(V)  \
+  PPC_XX3_OPCODE_VECTOR_A_FORM_LIST(V) \
+  PPC_XX3_OPCODE_VECTOR_B_FORM_LIST(V)
+
 #define PPC_Z23_OPCODE_LIST(V)                                    \
   /* Decimal Quantize */                                          \
   V(dqua, DQUA, 0xEC000006)                                       \
@@ -2979,7 +2985,7 @@ const Instr rtCallRedirInstr = TWI;
 // Example: Test whether the instruction at ptr does set the condition code
 // bits.
 //
-// bool InstructionSetsConditionCodes(byte* ptr) {
+// bool InstructionSetsConditionCodes(uint8_t* ptr) {
 //   Instruction* instr = Instruction::At(ptr);
 //   int type = instr->TypeValue();
 //   return ((type == 0) || (type == 1)) && instr->HasS();
@@ -3150,10 +3156,15 @@ class Instruction {
       PPC_XS_OPCODE_LIST(OPCODE_CASES)
       return static_cast<Opcode>(opcode);
     }
+    opcode = extcode | BitField(9, 3);
+    switch (opcode) {
+      PPC_XX3_OPCODE_VECTOR_A_FORM_LIST(OPCODE_CASES)
+      return static_cast<Opcode>(opcode);
+    }
     opcode = extcode | BitField(10, 3);
     switch (opcode) {
       PPC_EVS_OPCODE_LIST(OPCODE_CASES)
-      PPC_XX3_OPCODE_VECTOR_LIST(OPCODE_CASES)
+      PPC_XX3_OPCODE_VECTOR_B_FORM_LIST(OPCODE_CASES)
       PPC_XX3_OPCODE_SCALAR_LIST(OPCODE_CASES)
       return static_cast<Opcode>(opcode);
     }
@@ -3212,7 +3223,7 @@ class Instruction {
   // reference to an instruction is to convert a pointer. There is no way
   // to allocate or create instances of class Instruction.
   // Use the At(pc) function to create references to Instruction.
-  static Instruction* At(byte* pc) {
+  static Instruction* At(uint8_t* pc) {
     return reinterpret_cast<Instruction*>(pc);
   }
 
diff --git a/deps/v8/src/codegen/ppc/cpu-ppc.cc b/deps/v8/src/codegen/ppc/cpu-ppc.cc
index 1ded190f0543b3..a5f1e32c9071c1 100644
--- a/deps/v8/src/codegen/ppc/cpu-ppc.cc
+++ b/deps/v8/src/codegen/ppc/cpu-ppc.cc
@@ -28,10 +28,10 @@ void CpuFeatures::FlushICache(void* buffer, size_t size) {
 
   const int kCacheLineSize = CpuFeatures::icache_line_size();
   intptr_t mask = kCacheLineSize - 1;
-  byte* start =
-      reinterpret_cast<byte*>(reinterpret_cast<intptr_t>(buffer) & ~mask);
-  byte* end = static_cast<byte*>(buffer) + size;
-  for (byte* pointer = start; pointer < end; pointer += kCacheLineSize) {
+  uint8_t* start =
+      reinterpret_cast<uint8_t*>(reinterpret_cast<intptr_t>(buffer) & ~mask);
+  uint8_t* end = static_cast<uint8_t*>(buffer) + size;
+  for (uint8_t* pointer = start; pointer < end; pointer += kCacheLineSize) {
     __asm__(
         "dcbf 0, %0  \n"
         "sync        \n"
diff --git a/deps/v8/src/codegen/ppc/interface-descriptors-ppc-inl.h b/deps/v8/src/codegen/ppc/interface-descriptors-ppc-inl.h
index a60716648c6882..c3d354732f23c9 100644
--- a/deps/v8/src/codegen/ppc/interface-descriptors-ppc-inl.h
+++ b/deps/v8/src/codegen/ppc/interface-descriptors-ppc-inl.h
@@ -19,6 +19,23 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  auto registers = DoubleRegisterArray(d1, d2, d3, d4, d5, d6, d7);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Padding to have as many double return registers as GP return registers.
+  auto registers = DoubleRegisterArray(kFPReturnRegister0, no_dreg, no_dreg);
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -260,11 +277,35 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  return RegisterArray(r4,   // kApiFunctionAddress
-                       r5,   // kArgc
-                       r6,   // kCallData
-                       r3);  // kHolder
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return r4;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return r5;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return r6;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return r3;
+}
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return r5;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return r6;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return r3;
 }
 
 // static
@@ -302,6 +343,10 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray(r3, r4);
 }
 
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(r3);
+}
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/ppc/macro-assembler-ppc.cc b/deps/v8/src/codegen/ppc/macro-assembler-ppc.cc
index c60b26f307aa15..ac2b70a2dab426 100644
--- a/deps/v8/src/codegen/ppc/macro-assembler-ppc.cc
+++ b/deps/v8/src/codegen/ppc/macro-assembler-ppc.cc
@@ -15,6 +15,7 @@
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/codegen/macro-assembler.h"
 #include "src/codegen/register-configuration.h"
+#include "src/codegen/register.h"
 #include "src/debug/debug.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/execution/frames-inl.h"
@@ -298,7 +299,7 @@ void MacroAssembler::CallBuiltin(Builtin builtin, Condition cond) {
              cond);
       } else {
         Label skip;
-        LoadU64(ip, EntryFromBuiltinAsOperand(builtin));
+        LoadU64(ip, EntryFromBuiltinAsOperand(builtin), r0);
         if (cond != al) b(NegateCondition(cond), &skip);
         Call(ip);
         bind(&skip);
@@ -365,8 +366,7 @@ void MacroAssembler::Drop(Register count, Register scratch) {
 void MacroAssembler::TestCodeIsMarkedForDeoptimization(Register code,
                                                        Register scratch1,
                                                        Register scratch2) {
-  LoadU16(scratch1, FieldMemOperand(code, Code::kKindSpecificFlagsOffset),
-          scratch2);
+  LoadU32(scratch1, FieldMemOperand(code, Code::kFlagsOffset), scratch2);
   TestBit(scratch1, Code::kMarkedForDeoptimizationBit, scratch2);
 }
 
@@ -382,7 +382,7 @@ void MacroAssembler::Push(Handle<HeapObject> handle) {
   push(r0);
 }
 
-void MacroAssembler::Push(Smi smi) {
+void MacroAssembler::Push(Tagged<Smi> smi) {
   mov(r0, Operand(smi));
   push(r0);
 }
@@ -1173,21 +1173,21 @@ void MacroAssembler::ShiftRightAlgPair(Register dst_low, Register dst_high,
 #endif
 
 void MacroAssembler::LoadConstantPoolPointerRegisterFromCodeTargetAddress(
-    Register code_target_address) {
+    Register code_target_address, Register scratch1, Register scratch2) {
   // Builtins do not use the constant pool (see is_constant_pool_available).
   static_assert(InstructionStream::kOnHeapBodyIsContiguous);
 
-  // TODO(miladfarca): Pass in scratch registers.
-  LoadU64(ip, FieldMemOperand(code_target_address, Code::kCodeEntryPointOffset),
-          r0);
-  LoadU32(r0,
+  LoadU64(scratch2,
+          FieldMemOperand(code_target_address, Code::kInstructionStartOffset),
+          scratch1);
+  LoadU32(scratch1,
           FieldMemOperand(code_target_address, Code::kInstructionSizeOffset),
-          r0);
-  add(ip, r0, ip);
+          scratch1);
+  add(scratch2, scratch1, scratch2);
   LoadU32(kConstantPoolRegister,
           FieldMemOperand(code_target_address, Code::kConstantPoolOffsetOffset),
-          r0);
-  add(kConstantPoolRegister, ip, kConstantPoolRegister);
+          scratch1);
+  add(kConstantPoolRegister, scratch2, kConstantPoolRegister);
 }
 
 void MacroAssembler::LoadPC(Register dst) {
@@ -1341,7 +1341,8 @@ int MacroAssembler::LeaveFrame(StackFrame::Type type, int stack_adjustment) {
 void MacroAssembler::EnterExitFrame(int stack_space,
                                     StackFrame::Type frame_type) {
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
   // Set up the frame structure on the stack.
   DCHECK_EQ(2 * kSystemPointerSize, ExitFrameConstants::kCallerSPDisplacement);
   DCHECK_EQ(1 * kSystemPointerSize, ExitFrameConstants::kCallerPCOffset);
@@ -1565,7 +1566,7 @@ void MacroAssembler::CheckDebugHook(Register fun, Register new_target,
 
   {
     // Load receiver to pass it later to DebugOnFunctionCall hook.
-    LoadReceiver(r7, actual_parameter_count);
+    LoadReceiver(r7);
     FrameScope frame(
         this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
 
@@ -1617,14 +1618,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // We call indirectly through the code field in the function to
   // allow recompilation to take effect without changing any of the
   // call sites.
-  Register code = kJavaScriptCallCodeStartRegister;
-  LoadTaggedField(code, FieldMemOperand(function, JSFunction::kCodeOffset), r0);
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(code);
+      CallJSFunction(function, r0);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(code);
+      JumpJSFunction(function, r0);
       break;
   }
 
@@ -2025,7 +2024,7 @@ void TailCallOptimizedCodeSlot(MacroAssembler* masm,
   __ ReplaceClosureCodeWithOptimizedCode(optimized_code_entry, closure, scratch,
                                          r8);
   static_assert(kJavaScriptCallCodeStartRegister == r5, "ABI mismatch");
-  __ LoadCodeEntry(r5, optimized_code_entry);
+  __ LoadCodeInstructionStart(r5, optimized_code_entry);
   __ Jump(r5);
 
   // Optimized code slot contains deoptimized code or code is cleared and
@@ -2392,6 +2391,47 @@ void MacroAssembler::AssertUndefinedOrAllocationSite(Register object,
     bind(&done_checking);
   }
 }
+
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 Register tmp, AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp, tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok);
+
+  LoadMap(map_tmp, object);
+  CompareInstanceType(map_tmp, tmp, LAST_NAME_TYPE);
+  ble(&ok);
+
+  CompareInstanceType(map_tmp, tmp, FIRST_JS_RECEIVER_TYPE);
+  bge(&ok);
+
+  CompareRoot(map_tmp, RootIndex::kHeapNumberMap);
+  beq(&ok);
+
+  CompareRoot(map_tmp, RootIndex::kBigIntMap);
+  beq(&ok);
+
+  CompareRoot(object, RootIndex::kUndefinedValue);
+  beq(&ok);
+
+  CompareRoot(object, RootIndex::kTrueValue);
+  beq(&ok);
+
+  CompareRoot(object, RootIndex::kFalseValue);
+  beq(&ok);
+
+  CompareRoot(object, RootIndex::kNullValue);
+  beq(&ok);
+
+  Abort(abort_reason);
+
+  bind(&ok);
+}
+
 #endif  // V8_ENABLE_DEBUG_CODE
 
 static const int kRegisterPassedArguments = 8;
@@ -4512,10 +4552,9 @@ void MacroAssembler::I8x16BitMask(Register dst, Simd128Register src,
 }
 
 void MacroAssembler::I32x4DotI16x8S(Simd128Register dst, Simd128Register src1,
-                                    Simd128Register src2,
-                                    Simd128Register scratch) {
-  vxor(scratch, scratch, scratch);
-  vmsumshm(dst, src1, src2, scratch);
+                                    Simd128Register src2) {
+  vxor(kSimd128RegZero, kSimd128RegZero, kSimd128RegZero);
+  vmsumshm(dst, src1, src2, kSimd128RegZero);
 }
 
 void MacroAssembler::I32x4DotI8x16AddS(Simd128Register dst,
@@ -4534,10 +4573,9 @@ void MacroAssembler::I16x8DotI8x16S(Simd128Register dst, Simd128Register src1,
 }
 
 void MacroAssembler::I16x8Q15MulRSatS(Simd128Register dst, Simd128Register src1,
-                                      Simd128Register src2,
-                                      Simd128Register scratch) {
-  vxor(scratch, scratch, scratch);
-  vmhraddshs(dst, src1, src2, scratch);
+                                      Simd128Register src2) {
+  vxor(kSimd128RegZero, kSimd128RegZero, kSimd128RegZero);
+  vmhraddshs(dst, src1, src2, kSimd128RegZero);
 }
 
 void MacroAssembler::I8x16Swizzle(Simd128Register dst, Simd128Register src1,
@@ -5048,28 +5086,29 @@ void MacroAssembler::JumpIfLessThan(Register x, int32_t y, Label* dest) {
   blt(dest);
 }
 
-void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
+void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index,
+                                               Register target) {
   static_assert(kSystemPointerSize == 8);
   static_assert(kSmiTagSize == 1);
   static_assert(kSmiTag == 0);
 
   // The builtin_index register contains the builtin index as a Smi.
   if (SmiValuesAre32Bits()) {
-    ShiftRightS64(builtin_index, builtin_index,
+    ShiftRightS64(target, builtin_index,
                   Operand(kSmiShift - kSystemPointerSizeLog2));
   } else {
     DCHECK(SmiValuesAre31Bits());
-    ShiftLeftU64(builtin_index, builtin_index,
+    ShiftLeftU64(target, builtin_index,
                  Operand(kSystemPointerSizeLog2 - kSmiShift));
   }
-  AddS64(builtin_index, builtin_index,
-         Operand(IsolateData::builtin_entry_table_offset()));
-  LoadU64(builtin_index, MemOperand(kRootRegister, builtin_index));
+  AddS64(target, target, Operand(IsolateData::builtin_entry_table_offset()));
+  LoadU64(target, MemOperand(kRootRegister, target));
 }
 
-void MacroAssembler::CallBuiltinByIndex(Register builtin_index) {
-  LoadEntryFromBuiltinIndex(builtin_index);
-  Call(builtin_index);
+void MacroAssembler::CallBuiltinByIndex(Register builtin_index,
+                                        Register target) {
+  LoadEntryFromBuiltinIndex(builtin_index, target);
+  Call(target);
 }
 
 void MacroAssembler::LoadEntryFromBuiltin(Builtin builtin,
@@ -5085,25 +5124,41 @@ MemOperand MacroAssembler::EntryFromBuiltinAsOperand(Builtin builtin) {
                     IsolateData::BuiltinEntrySlotOffset(builtin));
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination, Register code_object) {
+void MacroAssembler::LoadCodeInstructionStart(Register destination,
+                                              Register code_object) {
   ASM_CODE_COMMENT(this);
   LoadU64(destination,
-          FieldMemOperand(code_object, Code::kCodeEntryPointOffset), r0);
+          FieldMemOperand(code_object, Code::kInstructionStartOffset), r0);
 }
 
 void MacroAssembler::CallCodeObject(Register code_object) {
   ASM_CODE_COMMENT(this);
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   Call(code_object);
 }
 
 void MacroAssembler::JumpCodeObject(Register code_object, JumpMode jump_mode) {
   ASM_CODE_COMMENT(this);
   DCHECK_EQ(JumpMode::kJump, jump_mode);
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   Jump(code_object);
 }
 
+void MacroAssembler::CallJSFunction(Register function_object,
+                                    Register scratch) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  LoadTaggedField(
+      code, FieldMemOperand(function_object, JSFunction::kCodeOffset), scratch);
+  CallCodeObject(code);
+}
+void MacroAssembler::JumpJSFunction(Register function_object, Register scratch,
+                                    JumpMode jump_mode) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  LoadTaggedField(
+      code, FieldMemOperand(function_object, JSFunction::kCodeOffset), scratch);
+  JumpCodeObject(code, jump_mode);
+}
+
 void MacroAssembler::StoreReturnAddressAndCall(Register target) {
   // This generates the final instruction sequence for calls to C functions
   // once an exit frame has been constructed.
@@ -5262,6 +5317,173 @@ void MacroAssembler::ReverseBitsInSingleByteU64(Register dst, Register src,
   orx(dst, dst, scratch2);
 }
 
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand) {
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  // Additional parameter is the address of the actual callback.
+  Register return_value = r3;
+  Register scratch = ip;
+  Register scratch2 = r0;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = r14;
+  Register prev_limit_reg = r15;
+  Register prev_level_reg = r16;
+
+  // C arguments (arg_reg_1/2) are expected to be initialized outside, so this
+  // function must not corrupt them (return_value overlaps with arg_reg_1 but
+  // that's ok because we start using it only after the C call).
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2,  // C args
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ LoadU64(prev_next_address_reg, next_mem_op);
+    __ LoadU64(prev_limit_reg, limit_mem_op);
+    __ lwz(prev_level_reg, level_mem_op);
+    __ addi(scratch, prev_level_reg, Operand(1));
+    __ stw(scratch, level_mem_op);
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ lbz(scratch, __ ExternalReferenceAsOperand(
+                        ER::execution_mode_address(isolate), no_reg));
+    __ cmpi(scratch, Operand::Zero());
+    __ bne(&profiler_or_side_effects_check_enabled);
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ Move(scratch, ER::address_of_runtime_stats_flag());
+    __ lwz(scratch, MemOperand(scratch, 0));
+    __ cmpi(scratch, Operand::Zero());
+    __ bne(&profiler_or_side_effects_check_enabled);
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ StoreReturnAddressAndCall(function_address);
+  __ bind(&done_api_call);
+
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  // load value from ReturnValue
+  __ RecordComment("Load the value from ReturnValue");
+  __ LoadU64(r3, return_value_operand);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ StoreU64(prev_next_address_reg, next_mem_op);
+    if (v8_flags.debug_code) {
+      __ lwz(scratch, level_mem_op);
+      __ subi(scratch, scratch, Operand(1));
+      __ CmpS64(scratch, prev_level_reg);
+      __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall);
+    }
+    __ stw(prev_level_reg, level_mem_op);
+    __ LoadU64(scratch, limit_mem_op);
+    __ CmpS64(scratch, prev_limit_reg);
+    __ bne(&delete_allocated_handles);
+  }
+
+  __ RecordComment("Leave the API exit frame.");
+  __ bind(&leave_exit_frame);
+  // LeaveExitFrame expects unwind space to be in a register.
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand != nullptr) {
+    __ LoadU64(stack_space_reg, *stack_space_operand);
+  } else {
+    __ mov(stack_space_reg, Operand(stack_space));
+  }
+  __ LeaveExitFrame(stack_space_reg, stack_space_operand != nullptr);
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ LoadRoot(scratch, RootIndex::kTheHoleValue);
+    __ LoadU64(scratch2, __ ExternalReferenceAsOperand(
+                             ER::scheduled_exception_address(isolate), no_reg));
+    __ CmpS64(scratch, scratch2);
+    __ bne(&promote_scheduled_exception);
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ CompareRoot(return_value, RootIndex::kTheHoleValue);
+    __ bne(&finish_return);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch, scratch2,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  __ blr();
+
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via the thunk.");
+    __ bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback function.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ StoreU64(thunk_arg, thunk_arg_mem_op);
+    __ Move(scratch, thunk_ref);
+    __ StoreReturnAddressAndCall(scratch);
+    __ b(&done_api_call);
+  }
+
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ bind(&delete_allocated_handles);
+    __ StoreU64(prev_limit_reg, limit_mem_op);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ mr(saved_result, return_value);
+    __ PrepareCallCFunction(1, scratch);
+    __ Move(arg_reg_1, ER::isolate_address(isolate));
+    __ CallCFunction(ER::delete_handle_scope_extensions(), 1);
+    __ mr(return_value, saved_result);
+    __ b(&leave_exit_frame);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/ppc/macro-assembler-ppc.h b/deps/v8/src/codegen/ppc/macro-assembler-ppc.h
index c9e28283b21e03..1afdff0627574a 100644
--- a/deps/v8/src/codegen/ppc/macro-assembler-ppc.h
+++ b/deps/v8/src/codegen/ppc/macro-assembler-ppc.h
@@ -14,6 +14,7 @@
 #include "src/codegen/bailout-reason.h"
 #include "src/codegen/ppc/assembler-ppc.h"
 #include "src/common/globals.h"
+#include "src/execution/frame-constants.h"
 #include "src/execution/isolate-data.h"
 #include "src/objects/contexts.h"
 
@@ -472,7 +473,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void Push(Register src) { push(src); }
   // Push a handle.
   void Push(Handle<HeapObject> handle);
-  void Push(Smi smi);
+  void Push(Tagged<Smi> smi);
 
   // Push two registers.  Pushes leftmost register first (to highest address).
   void Push(Register src1, Register src2) {
@@ -738,19 +739,18 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
             Condition cond = al);
   void Call(Label* target);
 
-  // Load the builtin given by the Smi in |builtin_index| into the same
-  // register.
-  void LoadEntryFromBuiltinIndex(Register builtin_index);
+  // Load the builtin given by the Smi in |builtin_index| into |target|.
+  void LoadEntryFromBuiltinIndex(Register builtin_index, Register target);
   void LoadEntryFromBuiltin(Builtin builtin, Register destination);
   MemOperand EntryFromBuiltinAsOperand(Builtin builtin);
 
   // Load the code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_object);
+  void LoadCodeInstructionStart(Register destination, Register code_object);
   void CallCodeObject(Register code_object);
   void JumpCodeObject(Register code_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
-  void CallBuiltinByIndex(Register builtin_index);
+  void CallBuiltinByIndex(Register builtin_index, Register target);
   void CallForDeoptimization(Builtin target, int deopt_id, Label* exit,
                              DeoptimizeKind kind, Label* ret,
                              Label* jump_deoptimization_entry_label);
@@ -800,7 +800,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void MovIntToFloat(DoubleRegister dst, Register src, Register scratch);
   void MovFloatToInt(Register dst, DoubleRegister src, DoubleRegister scratch);
   // Register move. May do nothing if the registers are identical.
-  void Move(Register dst, Smi smi) { LoadSmiLiteral(dst, smi); }
+  void Move(Register dst, Tagged<Smi> smi) { LoadSmiLiteral(dst, smi); }
   void Move(Register dst, Handle<HeapObject> value,
             RelocInfo::Mode rmode = RelocInfo::FULL_EMBEDDED_OBJECT);
   void Move(Register dst, ExternalReference reference);
@@ -979,7 +979,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   // Loads the constant pool pointer (kConstantPoolRegister).
   void LoadConstantPoolPointerRegisterFromCodeTargetAddress(
-      Register code_target_address);
+      Register code_target_address, Register scratch1, Register scratch2);
   void AbortConstantPoolBuilding() {
 #ifdef DEBUG
     // Avoid DCHECK(!is_linked()) failure in ~Label()
@@ -987,6 +987,11 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 #endif
   }
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object, Register scratch);
+  void JumpJSFunction(Register function_object, Register scratch,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   // Generates an instruction sequence s.t. the return address points to the
   // instruction following the call.
   // The return address on the stack is used by frame iteration.
@@ -1123,6 +1128,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   V(I32x4Eq)               \
   V(I32x4GtS)              \
   V(I32x4GtU)              \
+  V(I32x4DotI16x8S)        \
   V(I16x8Add)              \
   V(I16x8Sub)              \
   V(I16x8Mul)              \
@@ -1140,6 +1146,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   V(I16x8SConvertI32x4)    \
   V(I16x8UConvertI32x4)    \
   V(I16x8RoundingAverageU) \
+  V(I16x8Q15MulRSatS)      \
   V(I8x16Add)              \
   V(I8x16Sub)              \
   V(I8x16MinS)             \
@@ -1187,7 +1194,6 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   V(I32x4ExtMulHighI16x8S)              \
   V(I32x4ExtMulLowI16x8U)               \
   V(I32x4ExtMulHighI16x8U)              \
-  V(I32x4DotI16x8S)                     \
   V(I16x8Ne)                            \
   V(I16x8GeS)                           \
   V(I16x8GeU)                           \
@@ -1195,7 +1201,6 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   V(I16x8ExtMulHighI8x16S)              \
   V(I16x8ExtMulLowI8x16U)               \
   V(I16x8ExtMulHighI8x16U)              \
-  V(I16x8Q15MulRSatS)                   \
   V(I16x8DotI8x16S)                     \
   V(I8x16Ne)                            \
   V(I8x16GeS)                           \
@@ -1479,16 +1484,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
                   Simd128Register src2, Simd128Register mask);
 
   // It assumes that the arguments are located below the stack pointer.
-  // argc is the number of arguments not including the receiver.
-  // TODO(victorgomes): Remove this function once we stick with the reversed
-  // arguments order.
-  void LoadReceiver(Register dest, Register argc) {
-    LoadU64(dest, MemOperand(sp, 0));
-  }
-
-  void StoreReceiver(Register rec, Register argc, Register scratch) {
-    StoreU64(rec, MemOperand(sp, 0));
-  }
+  void LoadReceiver(Register dest) { LoadU64(dest, MemOperand(sp, 0)); }
+  void StoreReceiver(Register rec) { StoreU64(rec, MemOperand(sp, 0)); }
 
   // ---------------------------------------------------------------------------
   // GC Support
@@ -1746,6 +1743,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void AssertUndefinedOrAllocationSite(Register object,
                                        Register scratch) NOOP_UNLESS_DEBUG_CODE;
 
+  void AssertJSAny(Register object, Register map_tmp, Register tmp,
+                   AbortReason abort_reason) NOOP_UNLESS_DEBUG_CODE;
   // ---------------------------------------------------------------------------
   // Patching helpers.
 
@@ -1787,6 +1786,34 @@ struct MoveCycleState {
   bool pending_double_scratch_register_use = false;
 };
 
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameStackSlotOperand(int offset) {
+  // The slot at [sp] is reserved in all ExitFrames for storing the return
+  // address before doing the actual call, it's necessary for frame iteration
+  // (see StoreReturnAddressAndCall for details).
+  static constexpr int kSPOffset = 1 * kSystemPointerSize;
+  return MemOperand(sp, (kStackFrameExtraParamSlot * kSystemPointerSize) +
+                            offset + kSPOffset);
+}
+
+// Provides access to exit frame stack space (not GC-ed).
+inline MemOperand ExitFrameCallerStackSlotOperand(int index) {
+  return MemOperand(
+      fp, (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
+              kSystemPointerSize);
+}
+
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand);
+
 #define ACCESS_MASM(masm) masm->
 
 }  // namespace internal
diff --git a/deps/v8/src/codegen/ppc/register-ppc.h b/deps/v8/src/codegen/ppc/register-ppc.h
index ee529b50fc3abb..ef933feb003f9c 100644
--- a/deps/v8/src/codegen/ppc/register-ppc.h
+++ b/deps/v8/src/codegen/ppc/register-ppc.h
@@ -136,6 +136,13 @@ ASSERT_TRIVIALLY_COPYABLE(Register);
 static_assert(sizeof(Register) <= sizeof(int),
               "Register can efficiently be passed by value");
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 #define DEFINE_REGISTER(R) \
   constexpr Register R = Register::from_code(kRegCode_##R);
 GENERAL_REGISTERS(DEFINE_REGISTER)
@@ -152,6 +159,12 @@ constexpr Register kPtrComprCageBaseRegister = r27;  // callee save
 constexpr Register kPtrComprCageBaseRegister = no_reg;
 #endif
 
+// PPC64 calling convention
+constexpr Register arg_reg_1 = r3;
+constexpr Register arg_reg_2 = r4;
+constexpr Register arg_reg_3 = r5;
+constexpr Register arg_reg_4 = r6;
+
 // Returns the number of padding slots needed for stack pointer alignment.
 constexpr int ArgumentPaddingSlots(int argument_count) {
   // No argument padding required.
diff --git a/deps/v8/src/codegen/register-configuration.cc b/deps/v8/src/codegen/register-configuration.cc
index 8b7b9f0010e591..67561fb13ce585 100644
--- a/deps/v8/src/codegen/register-configuration.cc
+++ b/deps/v8/src/codegen/register-configuration.cc
@@ -65,11 +65,12 @@ static_assert(RegisterConfiguration::kMaxFPRegisters >=
 
 static int get_num_simd128_registers() {
   return
-#if V8_TARGET_ARCH_RISCV64 || V8_TARGET_ARCH_PPC64
+#if V8_TARGET_ARCH_RISCV32 || V8_TARGET_ARCH_RISCV64 || V8_TARGET_ARCH_PPC64
       Simd128Register::kNumRegisters;
 #else
       0;
-#endif  // V8_TARGET_ARCH_RISCV64 || V8_TARGET_ARCH_PPC64
+#endif  // V8_TARGET_ARCH_RISCV32 || V8_TARGET_ARCH_RISCV64 ||
+        // V8_TARGET_ARCH_PPC64
 }
 
 static int get_num_simd256_registers() { return 0; }
diff --git a/deps/v8/src/codegen/register.h b/deps/v8/src/codegen/register.h
index 36561fe5077571..f8625f04d72c1e 100644
--- a/deps/v8/src/codegen/register.h
+++ b/deps/v8/src/codegen/register.h
@@ -23,7 +23,11 @@ template <typename... RegTypes,
           // All arguments must be either Register or DoubleRegister.
           typename = typename std::enable_if_t<
               std::conjunction_v<std::is_same<Register, RegTypes>...> ||
-              std::conjunction_v<std::is_same<DoubleRegister, RegTypes>...>>>
+              std::conjunction_v<std::is_same<DoubleRegister, RegTypes>...>
+#ifdef V8_TARGET_ARCH_X64
+              || std::conjunction_v<std::is_same<YMMRegister, RegTypes>...>
+#endif  // V8_TARGET_ARCH_X64
+              >>
 inline constexpr bool AreAliased(RegTypes... regs) {
   using FirstRegType = std::tuple_element_t<0, std::tuple<RegTypes...>>;
   int num_different_regs = RegListBase<FirstRegType>{regs...}.Count();
diff --git a/deps/v8/src/codegen/reloc-info-inl.h b/deps/v8/src/codegen/reloc-info-inl.h
new file mode 100644
index 00000000000000..62424d739f6fe3
--- /dev/null
+++ b/deps/v8/src/codegen/reloc-info-inl.h
@@ -0,0 +1,28 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_CODEGEN_RELOC_INFO_INL_H_
+#define V8_CODEGEN_RELOC_INFO_INL_H_
+
+#include "src/codegen/assembler-inl.h"
+#include "src/codegen/reloc-info.h"
+#include "src/heap/heap-write-barrier-inl.h"
+
+namespace v8 {
+namespace internal {
+
+void RelocInfo::set_target_object(Tagged<InstructionStream> host,
+                                  Tagged<HeapObject> target,
+                                  WriteBarrierMode write_barrier_mode,
+                                  ICacheFlushMode icache_flush_mode) {
+  set_target_object(target, icache_flush_mode);
+  if (!v8_flags.disable_write_barriers) {
+    WriteBarrierForCode(host, this, target, write_barrier_mode);
+  }
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_CODEGEN_RELOC_INFO_INL_H_
diff --git a/deps/v8/src/codegen/reloc-info.cc b/deps/v8/src/codegen/reloc-info.cc
index a7c4be40c4ca23..c09dd0765ac8bd 100644
--- a/deps/v8/src/codegen/reloc-info.cc
+++ b/deps/v8/src/codegen/reloc-info.cc
@@ -17,63 +17,7 @@
 namespace v8 {
 namespace internal {
 
-const char* const RelocInfo::kFillerCommentString = "DEOPTIMIZATION PADDING";
-
-// -----------------------------------------------------------------------------
-// Implementation of RelocInfoWriter and RelocIterator
-//
-// Relocation information is written backwards in memory, from high addresses
-// towards low addresses, byte by byte.  Therefore, in the encodings listed
-// below, the first byte listed it at the highest address, and successive
-// bytes in the record are at progressively lower addresses.
-//
-// Encoding
-//
-// The most common modes are given single-byte encodings.  Also, it is
-// easy to identify the type of reloc info and skip unwanted modes in
-// an iteration.
-//
-// The encoding relies on the fact that there are fewer than 14
-// different relocation modes using standard non-compact encoding.
-//
-// The first byte of a relocation record has a tag in its low 2 bits:
-// Here are the record schemes, depending on the low tag and optional higher
-// tags.
-//
-// Low tag:
-//   00: embedded_object:      [6-bit pc delta] 00
-//
-//   01: code_target:          [6-bit pc delta] 01
-//
-//   10: wasm_stub_call:       [6-bit pc delta] 10
-//
-//   11: long_record           [6 bit reloc mode] 11
-//                             followed by pc delta
-//                             followed by optional data depending on type.
-//
-//  If a pc delta exceeds 6 bits, it is split into a remainder that fits into
-//  6 bits and a part that does not. The latter is encoded as a long record
-//  with PC_JUMP as pseudo reloc info mode. The former is encoded as part of
-//  the following record in the usual way. The long pc jump record has variable
-//  length:
-//               pc-jump:        [PC_JUMP] 11
-//                               1 [7 bits data]
-//                                  ...
-//                               0 [7 bits data]
-//               (Bits 6..31 of pc delta, encoded with VLQ.)
-
-const int kTagBits = 2;
-const int kTagMask = (1 << kTagBits) - 1;
-const int kLongTagBits = 6;
-
-const int kEmbeddedObjectTag = 0;
-const int kCodeTargetTag = 1;
-const int kWasmStubCallTag = 2;
-const int kDefaultTag = 3;
-
-const int kSmallPCDeltaBits = kBitsPerByte - kTagBits;
-const int kSmallPCDeltaMask = (1 << kSmallPCDeltaBits) - 1;
-const int RelocInfo::kMaxSmallPCDelta = kSmallPCDeltaMask;
+using namespace detail;
 
 uint32_t RelocInfoWriter::WriteLongPCJump(uint32_t pc_delta) {
   // Return if the pc_delta can fit in kSmallPCDeltaBits bits.
@@ -84,7 +28,7 @@ uint32_t RelocInfoWriter::WriteLongPCJump(uint32_t pc_delta) {
   uint32_t pc_jump = pc_delta >> kSmallPCDeltaBits;
   DCHECK_GT(pc_jump, 0);
   base::VLQEncodeUnsigned(
-      [this](byte byte) {
+      [this](uint8_t byte) {
         *--pos_ = byte;
         return pos_;
       },
@@ -100,7 +44,7 @@ void RelocInfoWriter::WriteShortTaggedPC(uint32_t pc_delta, int tag) {
 }
 
 void RelocInfoWriter::WriteShortData(intptr_t data_delta) {
-  *--pos_ = static_cast<byte>(data_delta);
+  *--pos_ = static_cast<uint8_t>(data_delta);
 }
 
 void RelocInfoWriter::WriteMode(RelocInfo::Mode rmode) {
@@ -117,7 +61,7 @@ void RelocInfoWriter::WriteModeAndPC(uint32_t pc_delta, RelocInfo::Mode rmode) {
 
 void RelocInfoWriter::WriteIntData(int number) {
   for (int i = 0; i < kIntSize; i++) {
-    *--pos_ = static_cast<byte>(number);
+    *--pos_ = static_cast<uint8_t>(number);
     // Signed right shift is arithmetic shift.  Tested in test-utils.cc.
     number = number >> kBitsPerByte;
   }
@@ -126,7 +70,7 @@ void RelocInfoWriter::WriteIntData(int number) {
 void RelocInfoWriter::Write(const RelocInfo* rinfo) {
   RelocInfo::Mode rmode = rinfo->rmode();
 #ifdef DEBUG
-  byte* begin_pos = pos_;
+  uint8_t* begin_pos = pos_;
 #endif
   DCHECK(rinfo->rmode() < RelocInfo::NUMBER_OF_MODES);
   DCHECK_GE(rinfo->pc() - reinterpret_cast<Address>(last_pc_), 0);
@@ -150,29 +94,17 @@ void RelocInfoWriter::Write(const RelocInfo* rinfo) {
     } else if (RelocInfo::IsConstPool(rmode) ||
                RelocInfo::IsVeneerPool(rmode) || RelocInfo::IsDeoptId(rmode) ||
                RelocInfo::IsDeoptPosition(rmode) ||
-               RelocInfo::IsDeoptNodeId(rmode)) {
+               RelocInfo::IsDeoptNodeId(rmode) ||
+               RelocInfo::IsRelativeSwitchTableEntry(rmode)) {
       WriteIntData(static_cast<int>(rinfo->data()));
     }
   }
-  last_pc_ = reinterpret_cast<byte*>(rinfo->pc());
+  last_pc_ = reinterpret_cast<uint8_t*>(rinfo->pc());
 #ifdef DEBUG
   DCHECK_LE(begin_pos - pos_, kMaxSize);
 #endif
 }
 
-inline int RelocIterator::AdvanceGetTag() { return *--pos_ & kTagMask; }
-
-inline RelocInfo::Mode RelocIterator::GetMode() {
-  return static_cast<RelocInfo::Mode>((*pos_ >> kTagBits) &
-                                      ((1 << kLongTagBits) - 1));
-}
-
-inline void RelocIterator::ReadShortTaggedPC() {
-  rinfo_.pc_ += *pos_ >> kTagBits;
-}
-
-inline void RelocIterator::AdvanceReadPC() { rinfo_.pc_ += *--pos_; }
-
 void RelocIterator::AdvanceReadInt() {
   int x = 0;
   for (int i = 0; i < kIntSize; i++) {
@@ -181,14 +113,6 @@ void RelocIterator::AdvanceReadInt() {
   rinfo_.data_ = x;
 }
 
-void RelocIterator::AdvanceReadData() {
-  intptr_t x = 0;
-  for (int i = 0; i < kIntptrSize; i++) {
-    x |= static_cast<intptr_t>(*--pos_) << i * kBitsPerByte;
-  }
-  rinfo_.data_ = x;
-}
-
 void RelocIterator::AdvanceReadLongPCJump() {
   // Read the 32-kSmallPCDeltaBits most significant bits of the
   // pc jump as a VLQ encoded integer.
@@ -238,7 +162,8 @@ void RelocIterator::next() {
                    RelocInfo::IsVeneerPool(rmode) ||
                    RelocInfo::IsDeoptId(rmode) ||
                    RelocInfo::IsDeoptPosition(rmode) ||
-                   RelocInfo::IsDeoptNodeId(rmode)) {
+                   RelocInfo::IsDeoptNodeId(rmode) ||
+                   RelocInfo::IsRelativeSwitchTableEntry(rmode)) {
           if (SetMode(rmode)) {
             AdvanceReadInt();
             return;
@@ -253,65 +178,56 @@ void RelocIterator::next() {
   done_ = true;
 }
 
-RelocIterator::RelocIterator(Code code, int mode_mask)
-    : RelocIterator(code, code.unchecked_relocation_info(), mode_mask) {}
-
-RelocIterator::RelocIterator(Code code, ByteArray relocation_info,
-                             int mode_mask)
-    : RelocIterator(
-          code,
-          InstructionStream::unchecked_cast(code.raw_instruction_stream()),
-          InstructionStream::unchecked_cast(code.raw_instruction_stream())
-              .instruction_start(),
-          code.constant_pool(), relocation_info.GetDataEndAddress(),
-          relocation_info.GetDataStartAddress(), mode_mask) {}
-
-RelocIterator::RelocIterator(Code code, InstructionStream instruction_stream,
-                             ByteArray relocation_info, Address constant_pool,
-                             int mode_mask)
-    : RelocIterator(code, instruction_stream,
-                    instruction_stream.instruction_start(), constant_pool,
-                    relocation_info.GetDataEndAddress(),
-                    relocation_info.GetDataStartAddress(), mode_mask) {}
-
-RelocIterator::RelocIterator(const CodeReference code_reference, int mode_mask)
+RelocIterator::RelocIterator(Tagged<Code> code, int mode_mask)
     : RelocIterator(
-          Code(), InstructionStream(), code_reference.instruction_start(),
-          code_reference.constant_pool(), code_reference.relocation_end(),
-          code_reference.relocation_start(), mode_mask) {}
+          code->instruction_start(), code->constant_pool(),
+          code->instruction_stream()->relocation_info()->GetDataEndAddress(),
+          code->instruction_stream()->relocation_info()->GetDataStartAddress(),
+          mode_mask) {}
+
+RelocIterator::RelocIterator(Tagged<InstructionStream> istream,
+                             Address constant_pool, int mode_mask)
+    : RelocIterator(istream->instruction_start(), constant_pool,
+                    istream->relocation_info()->GetDataEndAddress(),
+                    istream->relocation_info()->GetDataStartAddress(),
+                    mode_mask) {}
 
-RelocIterator::RelocIterator(EmbeddedData* embedded_data, Code code,
+RelocIterator::RelocIterator(Tagged<Code> code,
+                             Tagged<InstructionStream> instruction_stream,
+                             Tagged<ByteArray> relocation_info, int mode_mask)
+    : RelocIterator(instruction_stream->instruction_start(),
+                    code->constant_pool(instruction_stream),
+                    relocation_info->GetDataEndAddress(),
+                    relocation_info->GetDataStartAddress(), mode_mask) {}
+
+RelocIterator::RelocIterator(const CodeReference code_reference)
+    : RelocIterator(code_reference.instruction_start(),
+                    code_reference.constant_pool(),
+                    code_reference.relocation_end(),
+                    code_reference.relocation_start(), kAllModesMask) {}
+
+RelocIterator::RelocIterator(EmbeddedData* embedded_data, Tagged<Code> code,
                              int mode_mask)
-    : RelocIterator(code, code.instruction_stream(),
-                    embedded_data->InstructionStartOfBuiltin(code.builtin_id()),
-                    code.constant_pool(),
-                    code.relocation_start() + code.relocation_size(),
-                    code.relocation_start(), mode_mask) {}
-
-RelocIterator::RelocIterator(const CodeDesc& desc, int mode_mask)
-    : RelocIterator(
-          Code(), InstructionStream(), reinterpret_cast<Address>(desc.buffer),
-          0, desc.buffer + desc.buffer_size,
-          desc.buffer + desc.buffer_size - desc.reloc_size, mode_mask) {}
+    : RelocIterator(embedded_data->InstructionStartOf(code->builtin_id()),
+                    code->constant_pool(), code->relocation_end(),
+                    code->relocation_start(), mode_mask) {}
 
-RelocIterator::RelocIterator(base::Vector<byte> instructions,
-                             base::Vector<const byte> reloc_info,
+RelocIterator::RelocIterator(base::Vector<uint8_t> instructions,
+                             base::Vector<const uint8_t> reloc_info,
                              Address const_pool, int mode_mask)
-    : RelocIterator(Code(), InstructionStream(),
-                    reinterpret_cast<Address>(instructions.begin()), const_pool,
+    : RelocIterator(reinterpret_cast<Address>(instructions.begin()), const_pool,
                     reloc_info.begin() + reloc_info.size(), reloc_info.begin(),
                     mode_mask) {}
 
-RelocIterator::RelocIterator(Code code, InstructionStream instruction_stream,
-                             Address pc, Address constant_pool, const byte* pos,
-                             const byte* end, int mode_mask)
-    : pos_(pos), end_(end), mode_mask_(mode_mask) {
+RelocIterator::RelocIterator(Address pc, Address constant_pool,
+                             const uint8_t* pos, const uint8_t* end,
+                             int mode_mask)
+    : pos_(pos),
+      end_(end),
+      rinfo_(pc, RelocInfo::NO_INFO, 0, constant_pool),
+      mode_mask_(mode_mask) {
   // Relocation info is read backwards.
   DCHECK_GE(pos_, end_);
-  rinfo_.code_ = code;
-  rinfo_.pc_ = pc;
-  rinfo_.instruction_stream_ = instruction_stream;
-  rinfo_.constant_pool_ = constant_pool;
   if (mode_mask_ == 0) pos_ = end_;
   next();
 }
@@ -357,18 +273,22 @@ void RelocInfo::set_wasm_stub_call_address(Address address,
 }
 
 void RelocInfo::set_target_address(Address target,
-                                   WriteBarrierMode write_barrier_mode,
                                    ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTargetMode(rmode_) || IsNearBuiltinEntry(rmode_) ||
          IsWasmCall(rmode_));
   Assembler::set_target_address_at(pc_, constant_pool_, target,
                                    icache_flush_mode);
-  if (!instruction_stream().is_null() && IsCodeTargetMode(rmode_) &&
-      !v8_flags.disable_write_barriers) {
-    InstructionStream target_code =
+}
+
+void RelocInfo::set_target_address(Tagged<InstructionStream> host,
+                                   Address target,
+                                   WriteBarrierMode write_barrier_mode,
+                                   ICacheFlushMode icache_flush_mode) {
+  set_target_address(target, icache_flush_mode);
+  if (IsCodeTargetMode(rmode_) && !v8_flags.disable_write_barriers) {
+    Tagged<InstructionStream> target_code =
         InstructionStream::FromTargetAddress(target);
-    WriteBarrierForCode(instruction_stream(), this, target_code,
-                        write_barrier_mode);
+    WriteBarrierForCode(host, this, target_code, write_barrier_mode);
   }
 }
 
@@ -416,6 +336,8 @@ const char* RelocInfo::RelocModeName(RelocInfo::Mode rmode) {
       return "internal reference";
     case INTERNAL_REFERENCE_ENCODED:
       return "encoded internal reference";
+    case RELATIVE_SWITCH_TABLE_ENTRY:
+      return "relative switch table entry";
     case OFF_HEAP_TARGET:
       return "off heap target";
     case NEAR_BUILTIN_ENTRY:
@@ -428,8 +350,6 @@ const char* RelocInfo::RelocModeName(RelocInfo::Mode rmode) {
       return "deopt reason";
     case DEOPT_ID:
       return "deopt index";
-    case LITERAL_CONSTANT:
-      return "literal constant";
     case DEOPT_NODE_ID:
       return "deopt node id";
     case CONST_POOL:
@@ -469,10 +389,10 @@ void RelocInfo::Print(Isolate* isolate, std::ostream& os) {
        << ")";
   } else if (IsCodeTargetMode(rmode_)) {
     const Address code_target = target_address();
-    Code target_code = Code::FromTargetAddress(code_target);
-    os << " (" << CodeKindToString(target_code.kind());
+    Tagged<Code> target_code = Code::FromTargetAddress(code_target);
+    os << " (" << CodeKindToString(target_code->kind());
     if (Builtins::IsBuiltin(target_code)) {
-      os << " " << Builtins::name(target_code.builtin_id());
+      os << " " << Builtins::name(target_code->builtin_id());
     }
     os << ")  (" << reinterpret_cast<const void*>(target_address()) << ")";
   } else if (IsConstPool(rmode_)) {
@@ -508,18 +428,20 @@ void RelocInfo::Verify(Isolate* isolate) {
       Address addr = target_address();
       CHECK_NE(addr, kNullAddress);
       // Check that we can find the right code object.
-      InstructionStream code = InstructionStream::FromTargetAddress(addr);
-      Code lookup_result = isolate->heap()->FindCodeForInnerPointer(addr);
-      CHECK_EQ(code.address(), lookup_result.instruction_stream().address());
+      Tagged<InstructionStream> code =
+          InstructionStream::FromTargetAddress(addr);
+      Tagged<Code> lookup_result =
+          isolate->heap()->FindCodeForInnerPointer(addr);
+      CHECK_EQ(code.address(), lookup_result->instruction_stream().address());
       break;
     }
     case INTERNAL_REFERENCE:
     case INTERNAL_REFERENCE_ENCODED: {
       Address target = target_internal_reference();
       Address pc = target_internal_reference_address();
-      Code lookup_result = isolate->heap()->FindCodeForInnerPointer(pc);
-      CHECK_GE(target, lookup_result.InstructionStart());
-      CHECK_LT(target, lookup_result.InstructionEnd());
+      Tagged<Code> lookup_result = isolate->heap()->FindCodeForInnerPointer(pc);
+      CHECK_GE(target, lookup_result->instruction_start());
+      CHECK_LT(target, lookup_result->instruction_end());
       break;
     }
     case OFF_HEAP_TARGET: {
@@ -542,12 +464,12 @@ void RelocInfo::Verify(Isolate* isolate) {
     case DEOPT_INLINING_ID:
     case DEOPT_REASON:
     case DEOPT_ID:
-    case LITERAL_CONSTANT:
     case DEOPT_NODE_ID:
     case CONST_POOL:
     case VENEER_POOL:
     case WASM_CALL:
     case NO_INFO:
+    case RELATIVE_SWITCH_TABLE_ENTRY:
       break;
     case NUMBER_OF_MODES:
     case PC_JUMP:
diff --git a/deps/v8/src/codegen/reloc-info.h b/deps/v8/src/codegen/reloc-info.h
index 0f5b64757c956a..5da3a1c2dc0804 100644
--- a/deps/v8/src/codegen/reloc-info.h
+++ b/deps/v8/src/codegen/reloc-info.h
@@ -7,6 +7,7 @@
 
 #include "src/common/globals.h"
 #include "src/objects/code.h"
+#include "src/objects/instruction-stream.h"
 
 namespace v8 {
 namespace internal {
@@ -21,6 +22,63 @@ class EmbeddedData;
 // executed).
 enum ICacheFlushMode { FLUSH_ICACHE_IF_NEEDED, SKIP_ICACHE_FLUSH };
 
+namespace detail {
+// -----------------------------------------------------------------------------
+// Implementation of RelocInfoWriter and RelocIterator
+//
+// Relocation information is written backwards in memory, from high addresses
+// towards low addresses, byte by byte.  Therefore, in the encodings listed
+// below, the first byte listed it at the highest address, and successive
+// bytes in the record are at progressively lower addresses.
+//
+// Encoding
+//
+// The most common modes are given single-byte encodings.  Also, it is
+// easy to identify the type of reloc info and skip unwanted modes in
+// an iteration.
+//
+// The encoding relies on the fact that there are fewer than 14
+// different relocation modes using standard non-compact encoding.
+//
+// The first byte of a relocation record has a tag in its low 2 bits:
+// Here are the record schemes, depending on the low tag and optional higher
+// tags.
+//
+// Low tag:
+//   00: embedded_object:      [6-bit pc delta] 00
+//
+//   01: code_target:          [6-bit pc delta] 01
+//
+//   10: wasm_stub_call:       [6-bit pc delta] 10
+//
+//   11: long_record           [6 bit reloc mode] 11
+//                             followed by pc delta
+//                             followed by optional data depending on type.
+//
+//  If a pc delta exceeds 6 bits, it is split into a remainder that fits into
+//  6 bits and a part that does not. The latter is encoded as a long record
+//  with PC_JUMP as pseudo reloc info mode. The former is encoded as part of
+//  the following record in the usual way. The long pc jump record has variable
+//  length:
+//               pc-jump:        [PC_JUMP] 11
+//                               1 [7 bits data]
+//                                  ...
+//                               0 [7 bits data]
+//               (Bits 6..31 of pc delta, encoded with VLQ.)
+
+constexpr int kTagBits = 2;
+constexpr int kTagMask = (1 << kTagBits) - 1;
+constexpr int kLongTagBits = 6;
+
+constexpr int kEmbeddedObjectTag = 0;
+constexpr int kCodeTargetTag = 1;
+constexpr int kWasmStubCallTag = 2;
+constexpr int kDefaultTag = 3;
+
+constexpr int kSmallPCDeltaBits = kBitsPerByte - kTagBits;
+constexpr int kSmallPCDeltaMask = (1 << kSmallPCDeltaBits) - 1;
+}  // namespace detail
+
 // -----------------------------------------------------------------------------
 // Relocation information
 
@@ -33,21 +91,15 @@ enum ICacheFlushMode { FLUSH_ICACHE_IF_NEEDED, SKIP_ICACHE_FLUSH };
 
 class RelocInfo {
  public:
-  // This string is used to add padding comments to the reloc info in cases
-  // where we are not sure to have enough space for patching in during
-  // lazy deoptimization. This is the case if we have indirect calls for which
-  // we do not normally record relocation info.
-  static const char* const kFillerCommentString;
-
   // The minimum size of a comment is equal to two bytes for the extra tagged
   // pc and kSystemPointerSize for the actual pointer to the comment.
-  static const int kMinRelocCommentSize = 2 + kSystemPointerSize;
+  static constexpr int kMinRelocCommentSize = 2 + kSystemPointerSize;
 
   // The maximum size for a call instruction including pc-jump.
-  static const int kMaxCallSize = 6;
+  static constexpr int kMaxCallSize = 6;
 
   // The maximum pc delta that will use the short encoding.
-  static const int kMaxSmallPCDelta;
+  static constexpr int kMaxSmallPCDelta = detail::kSmallPCDeltaMask;
 
   enum Mode : int8_t {
     // Please note the order is important (see IsRealRelocMode, IsGCRelocMode,
@@ -67,6 +119,9 @@ class RelocInfo {
     EXTERNAL_REFERENCE,  // The address of an external C++ function.
     INTERNAL_REFERENCE,  // An address inside the same function.
 
+    // The relative address (target-table) in the switch table.
+    RELATIVE_SWITCH_TABLE_ENTRY,
+
     // Encoded internal reference, used only on RISCV64, RISCV32, MIPS64
     // and PPC.
     INTERNAL_REFERENCE_ENCODED,
@@ -90,8 +145,6 @@ class RelocInfo {
     DEOPT_NODE_ID,      // Id of the node that caused deoptimization. This
                         // information is only recorded in debug builds.
 
-    LITERAL_CONSTANT,  // An constant embedded in the instruction stream.
-
     // This is not an actual reloc mode, but used to encode a long pc jump that
     // cannot be encoded as part of another record.
     PC_JUMP,
@@ -114,19 +167,16 @@ class RelocInfo {
 
   RelocInfo() = default;
 
-  RelocInfo(Address pc, Mode rmode, intptr_t data, Code code,
-            InstructionStream instruction_stream,
+  RelocInfo(Address pc, Mode rmode, intptr_t data,
             Address constant_pool = kNullAddress)
-      : pc_(pc),
-        rmode_(rmode),
-        data_(data),
-        code_(code),
-        instruction_stream_(instruction_stream),
-        constant_pool_(constant_pool) {
+      : pc_(pc), rmode_(rmode), data_(data), constant_pool_(constant_pool) {
     DCHECK_IMPLIES(!COMPRESS_POINTERS_BOOL,
                    rmode != COMPRESSED_EMBEDDED_OBJECT);
   }
 
+  // Convenience ctor.
+  RelocInfo(Address pc, Mode rmode) : RelocInfo(pc, rmode, 0) {}
+
   static constexpr bool IsRealRelocMode(Mode mode) {
     return mode >= FIRST_REAL_RELOC_MODE && mode <= LAST_REAL_RELOC_MODE;
   }
@@ -169,9 +219,6 @@ class RelocInfo {
     return mode == DEOPT_REASON;
   }
   static constexpr bool IsDeoptId(Mode mode) { return mode == DEOPT_ID; }
-  static constexpr bool IsLiteralConstant(Mode mode) {
-    return mode == LITERAL_CONSTANT;
-  }
   static constexpr bool IsDeoptNodeId(Mode mode) {
     return mode == DEOPT_NODE_ID;
   }
@@ -181,6 +228,9 @@ class RelocInfo {
   static constexpr bool IsInternalReference(Mode mode) {
     return mode == INTERNAL_REFERENCE;
   }
+  static constexpr bool IsRelativeSwitchTableEntry(Mode mode) {
+    return mode == RELATIVE_SWITCH_TABLE_ENTRY;
+  }
   static constexpr bool IsInternalReferenceEncoded(Mode mode) {
     return mode == INTERNAL_REFERENCE_ENCODED;
   }
@@ -209,15 +259,16 @@ class RelocInfo {
 #endif
   }
 
+  static bool IsOnlyForDisassembler(Mode mode) {
+    return mode == RELATIVE_SWITCH_TABLE_ENTRY;
+  }
+
   static constexpr int ModeMask(Mode mode) { return 1 << mode; }
 
   // Accessors
   Address pc() const { return pc_; }
   Mode rmode() const { return rmode_; }
   intptr_t data() const { return data_; }
-  Code code() const { return code_; }
-  InstructionStream instruction_stream() const { return instruction_stream_; }
-  Address constant_pool() const { return constant_pool_; }
 
   // Apply a relocation by delta bytes. When the code object is moved, PC
   // relative addresses have to be updated as well as absolute addresses
@@ -249,9 +300,12 @@ class RelocInfo {
       Address, ICacheFlushMode icache_flush_mode = FLUSH_ICACHE_IF_NEEDED);
 
   void set_target_address(
-      Address target,
+      Tagged<InstructionStream> host, Address target,
       WriteBarrierMode write_barrier_mode = UPDATE_WRITE_BARRIER,
       ICacheFlushMode icache_flush_mode = FLUSH_ICACHE_IF_NEEDED);
+  // Use this overload only when an InstructionStream host is not available.
+  void set_target_address(Address target, ICacheFlushMode icache_flush_mode =
+                                              FLUSH_ICACHE_IF_NEEDED);
 
   void set_off_heap_target_address(
       Address target,
@@ -261,14 +315,19 @@ class RelocInfo {
   // can only be called if IsCodeTarget(rmode_)
   V8_INLINE Address target_address();
   // Cage base value is used for decompressing compressed embedded references.
-  V8_INLINE HeapObject target_object(PtrComprCageBase cage_base);
+  V8_INLINE Tagged<HeapObject> target_object(PtrComprCageBase cage_base);
 
   V8_INLINE Handle<HeapObject> target_object_handle(Assembler* origin);
 
   V8_INLINE void set_target_object(
-      Heap* heap, HeapObject target,
+      Tagged<InstructionStream> host, Tagged<HeapObject> target,
       WriteBarrierMode write_barrier_mode = UPDATE_WRITE_BARRIER,
       ICacheFlushMode icache_flush_mode = FLUSH_ICACHE_IF_NEEDED);
+  // Use this overload only when an InstructionStream host is not available.
+  V8_INLINE void set_target_object(
+      Tagged<HeapObject> target,
+      ICacheFlushMode icache_flush_mode = FLUSH_ICACHE_IF_NEEDED);
+
   // Decodes builtin ID encoded as a PC-relative offset. This encoding is used
   // during code generation of call/jump with NEAR_BUILTIN_ENTRY.
   V8_INLINE Builtin target_builtin_at(Assembler* origin);
@@ -317,18 +376,18 @@ class RelocInfo {
   V8_INLINE void WipeOut();
 
   template <typename ObjectVisitor>
-  void Visit(ObjectVisitor* visitor) {
+  void Visit(Tagged<InstructionStream> host, ObjectVisitor* visitor) {
     Mode mode = rmode();
     if (IsEmbeddedObjectMode(mode)) {
-      visitor->VisitEmbeddedPointer(this);
+      visitor->VisitEmbeddedPointer(host, this);
     } else if (IsCodeTargetMode(mode)) {
-      visitor->VisitCodeTarget(this);
+      visitor->VisitCodeTarget(host, this);
     } else if (IsExternalReference(mode)) {
-      visitor->VisitExternalReference(this);
+      visitor->VisitExternalReference(host, this);
     } else if (IsInternalReference(mode) || IsInternalReferenceEncoded(mode)) {
-      visitor->VisitInternalReference(this);
+      visitor->VisitInternalReference(host, this);
     } else if (IsBuiltinEntryMode(mode)) {
-      visitor->VisitOffHeapTarget(this);
+      visitor->VisitOffHeapTarget(host, this);
     }
   }
 
@@ -373,9 +432,8 @@ class RelocInfo {
   Address pc_;
   Mode rmode_;
   intptr_t data_ = 0;
-  Code code_;
-  InstructionStream instruction_stream_;
   Address constant_pool_ = kNullAddress;
+
   friend class RelocIterator;
 };
 
@@ -388,14 +446,14 @@ class RelocInfoWriter {
   RelocInfoWriter(const RelocInfoWriter&) = delete;
   RelocInfoWriter& operator=(const RelocInfoWriter&) = delete;
 
-  byte* pos() const { return pos_; }
-  byte* last_pc() const { return last_pc_; }
+  uint8_t* pos() const { return pos_; }
+  uint8_t* last_pc() const { return last_pc_; }
 
   void Write(const RelocInfo* rinfo);
 
   // Update the state of the stream after reloc info buffer
   // and/or code is moved while the stream is active.
-  void Reposition(byte* pos, byte* pc) {
+  void Reposition(uint8_t* pos, uint8_t* pc) {
     pos_ = pos;
     last_pc_ = pc;
   }
@@ -414,8 +472,8 @@ class RelocInfoWriter {
   inline void WriteModeAndPC(uint32_t pc_delta, RelocInfo::Mode rmode);
   inline void WriteIntData(int data_delta);
 
-  byte* pos_;
-  byte* last_pc_;
+  uint8_t* pos_;
+  uint8_t* last_pc_;
 };
 
 // A RelocIterator iterates over relocation information.
@@ -426,67 +484,77 @@ class RelocInfoWriter {
 //   }
 //
 // A mask can be specified to skip unwanted modes.
-class V8_EXPORT_PRIVATE RelocIterator : public Malloced {
+class V8_EXPORT_PRIVATE RelocIterator {
+  static constexpr int kAllModesMask = -1;
+
  public:
-  // Create a new iterator positioned at the beginning of the reloc info.
-  // Relocation information with mode k is included in the iteration iff bit k
-  // of mode_mask is set.
-  explicit RelocIterator(Code code, int mode_mask = -1);
-  explicit RelocIterator(Code code, ByteArray relocation_info, int mode_mask);
-  explicit RelocIterator(Code code, InstructionStream instruction_stream,
-                         ByteArray relocation_info, Address constant_pool,
+  // Prefer using this ctor when possible:
+  explicit RelocIterator(Tagged<Code> code, int mode_mask = kAllModesMask);
+
+  // Relocation during InstructionStream initialization. Pass the instruction
+  // stream directly since we want to avoid reading from the Code object for
+  // CFI. I.e. the istream lives in trusted memory but the code object doesn't.
+  RelocIterator(Tagged<InstructionStream> istream, Address constant_pool,
+                int mode_mask);
+
+  // For when GC may be in progress and thus pointers on the Code object may be
+  // stale (or forwarding pointers); or when objects are not fully constructed,
+  // or we're operating on fake objects for some reason. Then, we pass relevant
+  // objects explicitly. Note they must all refer to the same underlying
+  // {Code,IStream} composite object.
+  explicit RelocIterator(Tagged<Code> code,
+                         Tagged<InstructionStream> instruction_stream,
+                         Tagged<ByteArray> relocation_info, int mode_mask);
+  // For Wasm.
+  explicit RelocIterator(base::Vector<uint8_t> instructions,
+                         base::Vector<const uint8_t> reloc_info,
+                         Address const_pool, int mode_mask = kAllModesMask);
+  // For the disassembler.
+  explicit RelocIterator(const CodeReference code_reference);
+  // For FinalizeEmbeddedCodeTargets when creating embedded builtins.
+  explicit RelocIterator(EmbeddedData* embedded_data, Tagged<Code> code,
                          int mode_mask);
-  explicit RelocIterator(EmbeddedData* embedded_data, Code code, int mode_mask);
-  explicit RelocIterator(const CodeDesc& desc, int mode_mask = -1);
-  explicit RelocIterator(const CodeReference code_reference,
-                         int mode_mask = -1);
-  explicit RelocIterator(base::Vector<byte> instructions,
-                         base::Vector<const byte> reloc_info,
-                         Address const_pool, int mode_mask = -1);
-  RelocIterator(RelocIterator&&) V8_NOEXCEPT = default;
 
+  RelocIterator(RelocIterator&&) V8_NOEXCEPT = default;
   RelocIterator(const RelocIterator&) = delete;
   RelocIterator& operator=(const RelocIterator&) = delete;
 
-  // Iteration
   bool done() const { return done_; }
   void next();
 
-  // Return pointer valid until next next().
+  // The returned pointer is valid until the next call to next().
   RelocInfo* rinfo() {
     DCHECK(!done());
     return &rinfo_;
   }
 
  private:
-  RelocIterator(Code code, InstructionStream instruction_stream, Address pc,
-                Address constant_pool, const byte* pos, const byte* end,
-                int mode_mask);
-
-  // Advance* moves the position before/after reading.
-  // *Read* reads from current byte(s) into rinfo_.
-  // *Get* just reads and returns info on current byte.
-  void Advance(int bytes = 1) { pos_ -= bytes; }
-  int AdvanceGetTag();
-  RelocInfo::Mode GetMode();
+  RelocIterator(Address pc, Address constant_pool, const uint8_t* pos,
+                const uint8_t* end, int mode_mask);
 
-  void AdvanceReadLongPCJump();
+  // Used for efficiently skipping unwanted modes.
+  bool SetMode(RelocInfo::Mode mode) {
+    if ((mode_mask_ & (1 << mode)) == 0) return false;
+    rinfo_.rmode_ = mode;
+    return true;
+  }
 
-  void ReadShortTaggedPC();
-  void ReadShortData();
+  RelocInfo::Mode GetMode() const {
+    return static_cast<RelocInfo::Mode>((*pos_ >> detail::kTagBits) &
+                                        ((1 << detail::kLongTagBits) - 1));
+  }
 
-  void AdvanceReadPC();
+  void Advance(int bytes = 1) { pos_ -= bytes; }
+  int AdvanceGetTag() { return *--pos_ & detail::kTagMask; }
+  void AdvanceReadLongPCJump();
+  void AdvanceReadPC() { rinfo_.pc_ += *--pos_; }
   void AdvanceReadInt();
-  void AdvanceReadData();
 
-  // If the given mode is wanted, set it in rinfo_ and return true.
-  // Else return false. Used for efficiently skipping unwanted modes.
-  bool SetMode(RelocInfo::Mode mode) {
-    return (mode_mask_ & (1 << mode)) ? (rinfo_.rmode_ = mode, true) : false;
-  }
+  void ReadShortTaggedPC() { rinfo_.pc_ += *pos_ >> detail::kTagBits; }
+  void ReadShortData();
 
-  const byte* pos_;
-  const byte* end_;
+  const uint8_t* pos_;
+  const uint8_t* const end_;
   RelocInfo rinfo_;
   bool done_ = false;
   const int mode_mask_;
diff --git a/deps/v8/src/codegen/riscv/assembler-riscv-inl.h b/deps/v8/src/codegen/riscv/assembler-riscv-inl.h
index 55f191e6afe76e..773dc560da1e64 100644
--- a/deps/v8/src/codegen/riscv/assembler-riscv-inl.h
+++ b/deps/v8/src/codegen/riscv/assembler-riscv-inl.h
@@ -186,8 +186,7 @@ Handle<HeapObject> RelocInfo::target_object_handle(Assembler* origin) {
   }
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(HeapObject target,
                                   ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
@@ -200,10 +199,6 @@ void RelocInfo::set_target_object(Heap* heap, HeapObject target,
     Assembler::set_target_address_at(pc_, constant_pool_, target.ptr(),
                                      icache_flush_mode);
   }
-  if (write_barrier_mode == UPDATE_WRITE_BARRIER &&
-      !instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target);
-  }
 }
 
 Address RelocInfo::target_external_reference() {
diff --git a/deps/v8/src/codegen/riscv/assembler-riscv.cc b/deps/v8/src/codegen/riscv/assembler-riscv.cc
index b6844a6f37d95b..671d2372eaac14 100644
--- a/deps/v8/src/codegen/riscv/assembler-riscv.cc
+++ b/deps/v8/src/codegen/riscv/assembler-riscv.cc
@@ -38,7 +38,6 @@
 #include "src/base/cpu.h"
 #include "src/codegen/assembler-inl.h"
 #include "src/codegen/safepoint-table.h"
-#include "src/codegen/string-constants.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/diagnostics/disasm.h"
 #include "src/diagnostics/disassembler.h"
@@ -72,6 +71,10 @@ void CpuFeatures::ProbeImpl(bool cross_compile) {
   base::CPU cpu;
   if (cpu.has_fpu()) supported_ |= 1u << FPU;
   if (cpu.has_rvv()) supported_ |= 1u << RISCV_SIMD;
+  if (cpu.riscv_mmu() == base::CPU::RV_MMU_MODE::kRiscvSV57) {
+    FATAL("SV57 is not supported");
+    UNIMPLEMENTED();
+  }
   // Set a static value on whether SIMD is supported.
   // This variable is only used for certain archs to query SupportWasmSimd128()
   // at runtime in builtins using an extern ref. Other callers should use
@@ -179,7 +182,7 @@ MemOperand::MemOperand(Register rm, int32_t unit, int32_t multiplier,
   offset_ = unit * multiplier + offset_addend;
 }
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Handle<HeapObject> object =
@@ -220,7 +223,10 @@ Assembler::Assembler(const AssemblerOptions& options,
 void Assembler::AbortedCodeGeneration() { constpool_.Clear(); }
 Assembler::~Assembler() { CHECK(constpool_.IsEmpty()); }
 
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
+}
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
                         SafepointTableBuilder* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
@@ -489,7 +495,7 @@ void Assembler::disassembleInstr(Instr instr) {
   disasm::Disassembler disasm(converter);
   base::EmbeddedVector<char, 128> disasm_buffer;
 
-  disasm.InstructionDecode(disasm_buffer, reinterpret_cast<byte*>(&instr));
+  disasm.InstructionDecode(disasm_buffer, reinterpret_cast<uint8_t*>(&instr));
   DEBUG_PRINTF("%s\n", disasm_buffer.begin());
 }
 
@@ -1061,21 +1067,26 @@ void Assembler::GeneralLi(Register rd, int64_t imm) {
 }
 
 void Assembler::li_ptr(Register rd, int64_t imm) {
-  // Initialize rd with an address
-  // Pointers are 48 bits
-  // 6 fixed instructions are generated
-  DCHECK_EQ((imm & 0xfff0000000000000ll), 0);
-  int64_t a6 = imm & 0x3f;                      // bits 0:5. 6 bits
-  int64_t b11 = (imm >> 6) & 0x7ff;             // bits 6:11. 11 bits
-  int64_t high_31 = (imm >> 17) & 0x7fffffff;   // 31 bits
-  int64_t high_20 = ((high_31 + 0x800) >> 12);  // 19 bits
-  int64_t low_12 = high_31 & 0xfff;             // 12 bits
-  lui(rd, (int32_t)high_20);
-  addi(rd, rd, low_12);  // 31 bits in rd.
-  slli(rd, rd, 11);      // Space for next 11 bis
-  ori(rd, rd, b11);      // 11 bits are put in. 42 bit in rd
-  slli(rd, rd, 6);       // Space for next 6 bits
-  ori(rd, rd, a6);       // 6 bits are put in. 48 bis in rd
+  base::CPU cpu;
+  if (cpu.riscv_mmu() != base::CPU::RV_MMU_MODE::kRiscvSV57) {
+    // Initialize rd with an address
+    // Pointers are 48 bits
+    // 6 fixed instructions are generated
+    DCHECK_EQ((imm & 0xfff0000000000000ll), 0);
+    int64_t a6 = imm & 0x3f;                      // bits 0:5. 6 bits
+    int64_t b11 = (imm >> 6) & 0x7ff;             // bits 6:11. 11 bits
+    int64_t high_31 = (imm >> 17) & 0x7fffffff;   // 31 bits
+    int64_t high_20 = ((high_31 + 0x800) >> 12);  // 19 bits
+    int64_t low_12 = high_31 & 0xfff;             // 12 bits
+    lui(rd, (int32_t)high_20);
+    addi(rd, rd, low_12);  // 31 bits in rd.
+    slli(rd, rd, 11);      // Space for next 11 bis
+    ori(rd, rd, b11);      // 11 bits are put in. 42 bit in rd
+    slli(rd, rd, 6);       // Space for next 6 bits
+    ori(rd, rd, a6);       // 6 bits are put in. 48 bis in rd
+  } else {
+    FATAL("SV57 is not supported");
+  }
 }
 
 void Assembler::li_constant(Register rd, int64_t imm) {
@@ -1278,7 +1289,7 @@ void Assembler::GrowBuffer() {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   intptr_t pc_delta = new_start - buffer_start_;
@@ -1297,9 +1308,9 @@ void Assembler::GrowBuffer() {
                                reloc_info_writer.last_pc() + pc_delta);
 
   // Relocate runtime entries.
-  base::Vector<byte> instructions{buffer_start_,
-                                  static_cast<size_t>(pc_offset())};
-  base::Vector<const byte> reloc_info{reloc_info_writer.pos(), reloc_size};
+  base::Vector<uint8_t> instructions{buffer_start_,
+                                     static_cast<size_t>(pc_offset())};
+  base::Vector<const uint8_t> reloc_info{reloc_info_writer.pos(), reloc_size};
   for (RelocIterator it(instructions, reloc_info, 0); !it.done(); it.next()) {
     RelocInfo::Mode rmode = it.rinfo()->rmode();
     if (rmode == RelocInfo::INTERNAL_REFERENCE) {
@@ -1316,21 +1327,13 @@ void Assembler::db(uint8_t data) {
   EmitHelper(data);
 }
 
-void Assembler::dd(uint32_t data, RelocInfo::Mode rmode) {
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
+void Assembler::dd(uint32_t data) {
   if (!is_buffer_growth_blocked()) CheckBuffer();
   DEBUG_PRINTF("%p(%x): constant 0x%x\n", pc_, pc_offset(), data);
   EmitHelper(data);
 }
 
-void Assembler::dq(uint64_t data, RelocInfo::Mode rmode) {
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
+void Assembler::dq(uint64_t data) {
   if (!is_buffer_growth_blocked()) CheckBuffer();
   EmitHelper(data);
 }
@@ -1351,8 +1354,7 @@ void Assembler::dd(Label* label) {
 void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data) {
   if (!ShouldRecordRelocInfo(rmode)) return;
   // We do not try to reuse pool constants.
-  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data, Code(),
-                  InstructionStream());
+  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data);
   DCHECK_GE(buffer_space(), kMaxRelocSize);  // Too late to grow buffer here.
   reloc_info_writer.Write(&rinfo);
 }
@@ -1613,24 +1615,6 @@ void Assembler::set_target_value_at(Address pc, uint32_t target,
 }
 #endif
 
-UseScratchRegisterScope::UseScratchRegisterScope(Assembler* assembler)
-    : available_(assembler->GetScratchRegisterList()),
-      old_available_(*available_) {}
-
-UseScratchRegisterScope::~UseScratchRegisterScope() {
-  *available_ = old_available_;
-}
-
-Register UseScratchRegisterScope::Acquire() {
-  DCHECK_NOT_NULL(available_);
-  DCHECK(!available_->is_empty());
-  int index =
-      static_cast<int>(base::bits::CountTrailingZeros32(available_->bits()));
-  *available_ &= RegList::FromBits(~(1U << index));
-
-  return Register::from_code(index);
-}
-
 bool UseScratchRegisterScope::hasAvailable() const {
   return !available_->is_empty();
 }
diff --git a/deps/v8/src/codegen/riscv/assembler-riscv.h b/deps/v8/src/codegen/riscv/assembler-riscv.h
index ed222b52d69279..65c317ad018126 100644
--- a/deps/v8/src/codegen/riscv/assembler-riscv.h
+++ b/deps/v8/src/codegen/riscv/assembler-riscv.h
@@ -188,12 +188,14 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase,
   // GetCode emits any pending (non-emitted) code and fills the descriptor desc.
   static constexpr int kNoHandlerTable = 0;
   static constexpr SafepointTableBuilder* kNoSafepointTable = nullptr;
-  void GetCode(Isolate* isolate, CodeDesc* desc,
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
                SafepointTableBuilder* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -455,11 +457,9 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase,
   // Writes a single byte or word of data in the code stream.  Used for
   // inline tables, e.g., jump-tables.
   void db(uint8_t data);
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
-    dq(data, rmode);
-  }
+  void dd(uint32_t data);
+  void dq(uint64_t data);
+  void dp(uintptr_t data) { dq(data); }
   void dd(Label* label);
 
   Instruction* pc() const { return reinterpret_cast<Instruction*>(pc_); }
@@ -825,7 +825,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase,
  private:
   ConstantPool constpool_;
 
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
@@ -841,12 +841,33 @@ class EnsureSpace {
   explicit inline EnsureSpace(Assembler* assembler);
 };
 
+// This scope utility allows scratch registers to be managed safely. The
+// Assembler's GetScratchRegisterList() is used as a pool of scratch
+// registers. These registers can be allocated on demand, and will be returned
+// at the end of the scope.
+//
+// When the scope ends, the Assembler's list will be restored to its original
+// state, even if the list is modified by some other means. Note that this scope
+// can be nested but the destructors need to run in the opposite order as the
+// constructors. We do not have assertions for this.
 class V8_EXPORT_PRIVATE UseScratchRegisterScope {
  public:
-  explicit UseScratchRegisterScope(Assembler* assembler);
-  ~UseScratchRegisterScope();
+  explicit UseScratchRegisterScope(Assembler* assembler)
+      : available_(assembler->GetScratchRegisterList()),
+        old_available_(*available_) {}
+
+  ~UseScratchRegisterScope() { *available_ = old_available_; }
 
-  Register Acquire();
+  // Take a register from the list and return it.
+  Register Acquire() {
+    DCHECK_NOT_NULL(available_);
+    DCHECK(!available_->is_empty());
+    int index =
+        static_cast<int>(base::bits::CountTrailingZeros32(available_->bits()));
+    *available_ &= RegList::FromBits(~(1U << index));
+
+    return Register::from_code(index);
+  }
   bool hasAvailable() const;
   void Include(const RegList& list) { *available_ |= list; }
   void Exclude(const RegList& list) {
diff --git a/deps/v8/src/codegen/riscv/base-assembler-riscv.h b/deps/v8/src/codegen/riscv/base-assembler-riscv.h
index 7c2d02b2082292..00662eb49dd199 100644
--- a/deps/v8/src/codegen/riscv/base-assembler-riscv.h
+++ b/deps/v8/src/codegen/riscv/base-assembler-riscv.h
@@ -44,6 +44,7 @@
 #include "src/codegen/constant-pool.h"
 #include "src/codegen/external-reference.h"
 #include "src/codegen/label.h"
+#include "src/codegen/machine-type.h"
 #include "src/codegen/riscv/constants-riscv.h"
 #include "src/codegen/riscv/register-riscv.h"
 #include "src/objects/contexts.h"
diff --git a/deps/v8/src/codegen/riscv/base-constants-riscv.h b/deps/v8/src/codegen/riscv/base-constants-riscv.h
index 9acbf86f153188..0c1018c118f4a9 100644
--- a/deps/v8/src/codegen/riscv/base-constants-riscv.h
+++ b/deps/v8/src/codegen/riscv/base-constants-riscv.h
@@ -1223,7 +1223,7 @@ class Instruction : public InstructionGetters<InstructionBase> {
   // reference to an instruction is to convert a pointer. There is no way
   // to allocate or create instances of class Instruction.
   // Use the At(pc) function to create references to Instruction.
-  static Instruction* At(byte* pc) {
+  static Instruction* At(uint8_t* pc) {
     return reinterpret_cast<Instruction*>(pc);
   }
 
diff --git a/deps/v8/src/codegen/riscv/constant-riscv-v.h b/deps/v8/src/codegen/riscv/constant-riscv-v.h
index b5dddcc6663b7d..4bbe096c5a734d 100644
--- a/deps/v8/src/codegen/riscv/constant-riscv-v.h
+++ b/deps/v8/src/codegen/riscv/constant-riscv-v.h
@@ -264,6 +264,7 @@ constexpr Opcode RO_V_VFMV_VF = OP_FVF | (VMV_FUNCT6 << kRvvFunct6Shift);
 constexpr Opcode RO_V_VMERGE_VI = RO_V_VMV_VI;
 constexpr Opcode RO_V_VMERGE_VV = RO_V_VMV_VV;
 constexpr Opcode RO_V_VMERGE_VX = RO_V_VMV_VX;
+constexpr Opcode RO_V_VFMERGE_VF = RO_V_VFMV_VF;
 
 constexpr Opcode VMSEQ_FUNCT6 = 0b011000;
 constexpr Opcode RO_V_VMSEQ_VI = OP_IVI | (VMSEQ_FUNCT6 << kRvvFunct6Shift);
@@ -306,12 +307,20 @@ constexpr Opcode RO_V_VSLIDEUP_VI =
     OP_IVI | (VSLIDEUP_FUNCT6 << kRvvFunct6Shift);
 constexpr Opcode RO_V_VSLIDEUP_VX =
     OP_IVX | (VSLIDEUP_FUNCT6 << kRvvFunct6Shift);
+constexpr Opcode RO_V_VSLIDE1UP_VX =
+    OP_MVX | (VSLIDEUP_FUNCT6 << kRvvFunct6Shift);
+constexpr Opcode RO_V_VFSLIDE1UP_VF =
+    OP_FVF | (VSLIDEUP_FUNCT6 << kRvvFunct6Shift);
 
 constexpr Opcode VSLIDEDOWN_FUNCT6 = 0b001111;
 constexpr Opcode RO_V_VSLIDEDOWN_VI =
     OP_IVI | (VSLIDEDOWN_FUNCT6 << kRvvFunct6Shift);
 constexpr Opcode RO_V_VSLIDEDOWN_VX =
     OP_IVX | (VSLIDEDOWN_FUNCT6 << kRvvFunct6Shift);
+constexpr Opcode RO_V_VSLIDE1DOWN_VX =
+    OP_MVX | (VSLIDEDOWN_FUNCT6 << kRvvFunct6Shift);
+constexpr Opcode RO_V_VFSLIDE1DOWN_VF =
+    OP_FVF | (VSLIDEDOWN_FUNCT6 << kRvvFunct6Shift);
 
 constexpr Opcode VSRL_FUNCT6 = 0b101000;
 constexpr Opcode RO_V_VSRL_VI = OP_IVI | (VSRL_FUNCT6 << kRvvFunct6Shift);
@@ -435,11 +444,11 @@ constexpr Opcode RO_V_VFWSUB_W_VF =
 
 // Vector Widening Floating-Point Reduction Instructions
 constexpr Opcode VFWREDUSUM_FUNCT6 = 0b110001;
-constexpr Opcode RO_V_VFWREDUSUM_VV =
+constexpr Opcode RO_V_VFWREDUSUM_VS =
     OP_FVV | (VFWREDUSUM_FUNCT6 << kRvvFunct6Shift);
 
 constexpr Opcode VFWREDOSUM_FUNCT6 = 0b110011;
-constexpr Opcode RO_V_VFWREDOSUM_VV =
+constexpr Opcode RO_V_VFWREDOSUM_VS =
     OP_FVV | (VFWREDOSUM_FUNCT6 << kRvvFunct6Shift);
 
 // Vector Widening Floating-Point Multiply
diff --git a/deps/v8/src/codegen/riscv/cpu-riscv.cc b/deps/v8/src/codegen/riscv/cpu-riscv.cc
index 205e13fa988cac..613c54439a59fb 100644
--- a/deps/v8/src/codegen/riscv/cpu-riscv.cc
+++ b/deps/v8/src/codegen/riscv/cpu-riscv.cc
@@ -15,12 +15,16 @@ namespace internal {
 void CpuFeatures::FlushICache(void* start, size_t size) {
 #if !defined(USE_SIMULATOR)
   char* end = reinterpret_cast<char*>(start) + size;
-  // The definition of this syscall is
+  // The definition of this syscall is equal to
   // SYSCALL_DEFINE3(riscv_flush_icache, uintptr_t, start,
   //                 uintptr_t, end, uintptr_t, flags)
   // The flag here is set to be SYS_RISCV_FLUSH_ICACHE_LOCAL, which is
   // defined as 1 in the Linux kernel.
-  syscall(SYS_riscv_flush_icache, start, end, 1);
+  // SYS_riscv_flush_icache is a symbolic constant used in user-space code to
+  // identify the flush_icache system call, while __NR_riscv_flush_icache is the
+  // corresponding system call number used in the kernel to dispatch the system
+  // call.
+  syscall(__NR_riscv_flush_icache, start, end, 1);
 #endif  // !USE_SIMULATOR.
 }
 
diff --git a/deps/v8/src/codegen/riscv/extension-riscv-v.cc b/deps/v8/src/codegen/riscv/extension-riscv-v.cc
index f43aea40d4ce71..51f3d619700435 100644
--- a/deps/v8/src/codegen/riscv/extension-riscv-v.cc
+++ b/deps/v8/src/codegen/riscv/extension-riscv-v.cc
@@ -199,8 +199,8 @@ void AssemblerRISCVV::vid_v(VRegister vd, MaskType mask) {
     GenInstrV(VXUNARY0_FUNCT6, OP_MVV, vd, vs1, vs2, mask);                \
   }
 
-void AssemblerRISCVV::vfmv_vf(VRegister vd, FPURegister fs1, MaskType mask) {
-  GenInstrV(VMV_FUNCT6, OP_FVF, vd, fs1, v0, mask);
+void AssemblerRISCVV::vfmv_vf(VRegister vd, FPURegister fs1) {
+  GenInstrV(VMV_FUNCT6, OP_FVF, vd, fs1, v0, NoMask);
 }
 
 void AssemblerRISCVV::vfmv_fs(FPURegister fd, VRegister vs2) {
@@ -211,6 +211,10 @@ void AssemblerRISCVV::vfmv_sf(VRegister vd, FPURegister fs) {
   GenInstrV(VRFUNARY0_FUNCT6, OP_FVF, vd, fs, v0, NoMask);
 }
 
+void AssemblerRISCVV::vfmerge_vf(VRegister vd, FPURegister fs1, VRegister vs2) {
+  GenInstrV(VMV_FUNCT6, OP_FVF, vd, fs1, vs2, Mask);
+}
+
 DEFINE_OPIVV(vadd, VADD_FUNCT6)
 DEFINE_OPIVX(vadd, VADD_FUNCT6)
 DEFINE_OPIVI(vadd, VADD_FUNCT6)
@@ -265,8 +269,12 @@ DEFINE_OPIVI(vxor, VXOR_FUNCT6)
 
 DEFINE_OPIVX(vslidedown, VSLIDEDOWN_FUNCT6)
 DEFINE_OPIVI(vslidedown, VSLIDEDOWN_FUNCT6)
+DEFINE_OPMVX(vslide1down, VSLIDEDOWN_FUNCT6)
+DEFINE_OPFVF(vfslide1down, VSLIDEDOWN_FUNCT6)
 DEFINE_OPIVX(vslideup, VSLIDEUP_FUNCT6)
 DEFINE_OPIVI(vslideup, VSLIDEUP_FUNCT6)
+DEFINE_OPMVX(vslide1up, VSLIDEUP_FUNCT6)
+DEFINE_OPFVF(vfslide1up, VSLIDEUP_FUNCT6)
 
 DEFINE_OPIVV(vmseq, VMSEQ_FUNCT6)
 DEFINE_OPIVX(vmseq, VMSEQ_FUNCT6)
@@ -337,8 +345,8 @@ DEFINE_OPFWV(vfwsub, VFWSUB_W_FUNCT6)
 DEFINE_OPFWF(vfwsub, VFWSUB_W_FUNCT6)
 
 // Vector Widening Floating-Point Reduction Instructions
-DEFINE_OPFVV(vfwredusum, VFWREDUSUM_FUNCT6)
-DEFINE_OPFVV(vfwredosum, VFWREDOSUM_FUNCT6)
+DEFINE_OPFRED(vfwredusum, VFWREDUSUM_FUNCT6)
+DEFINE_OPFRED(vfwredosum, VFWREDOSUM_FUNCT6)
 
 // Vector Widening Floating-Point Multiply
 DEFINE_OPFVV(vfwmul, VFWMUL_FUNCT6)
diff --git a/deps/v8/src/codegen/riscv/extension-riscv-v.h b/deps/v8/src/codegen/riscv/extension-riscv-v.h
index 576d349eb453b0..920a3d0fe16276 100644
--- a/deps/v8/src/codegen/riscv/extension-riscv-v.h
+++ b/deps/v8/src/codegen/riscv/extension-riscv-v.h
@@ -6,6 +6,7 @@
 #define V8_CODEGEN_RISCV_EXTENSION_RISCV_V_H_
 
 #include "src/codegen/assembler.h"
+#include "src/codegen/machine-type.h"
 #include "src/codegen/riscv/base-assembler-riscv.h"
 #include "src/codegen/riscv/constant-riscv-v.h"
 #include "src/codegen/riscv/register-riscv.h"
@@ -94,9 +95,10 @@ class AssemblerRISCVV : public AssemblerRiscvBase {
   void vmadc_vx(VRegister vd, Register rs1, VRegister vs2);
   void vmadc_vi(VRegister vd, uint8_t imm5, VRegister vs2);
 
-  void vfmv_vf(VRegister vd, FPURegister fs1, MaskType mask = NoMask);
+  void vfmv_vf(VRegister vd, FPURegister fs1);
   void vfmv_fs(FPURegister fd, VRegister vs2);
   void vfmv_sf(VRegister vd, FPURegister fs);
+  void vfmerge_vf(VRegister vd, FPURegister fs1, VRegister vs2);
 
   void vwaddu_wx(VRegister vd, VRegister vs2, Register rs1,
                  MaskType mask = NoMask);
@@ -178,7 +180,7 @@ class AssemblerRISCVV : public AssemblerRiscvBase {
   DEFINE_OPIVX(vsadd, VSADD_FUNCT6)
   DEFINE_OPIVV(vsadd, VSADD_FUNCT6)
   DEFINE_OPIVI(vsadd, VSADD_FUNCT6)
-  DEFINE_OPIVX(vsaddu, VSADD_FUNCT6)
+  DEFINE_OPIVX(vsaddu, VSADDU_FUNCT6)
   DEFINE_OPIVV(vsaddu, VSADDU_FUNCT6)
   DEFINE_OPIVI(vsaddu, VSADDU_FUNCT6)
   DEFINE_OPIVX(vssub, VSSUB_FUNCT6)
@@ -210,8 +212,12 @@ class AssemblerRISCVV : public AssemblerRiscvBase {
 
   DEFINE_OPIVX(vslidedown, VSLIDEDOWN_FUNCT6)
   DEFINE_OPIVI(vslidedown, VSLIDEDOWN_FUNCT6)
+  DEFINE_OPMVX(vslide1down, VSLIDEDOWN_FUNCT6)
+  DEFINE_OPFVF(vfslide1down, VSLIDEDOWN_FUNCT6)
   DEFINE_OPIVX(vslideup, VSLIDEUP_FUNCT6)
   DEFINE_OPIVI(vslideup, VSLIDEUP_FUNCT6)
+  DEFINE_OPMVX(vslide1up, VSLIDEUP_FUNCT6)
+  DEFINE_OPFVF(vfslide1up, VSLIDEUP_FUNCT6)
 
   DEFINE_OPIVV(vmseq, VMSEQ_FUNCT6)
   DEFINE_OPIVX(vmseq, VMSEQ_FUNCT6)
@@ -276,8 +282,8 @@ class AssemblerRISCVV : public AssemblerRiscvBase {
   DEFINE_OPFWF(vfwsub, VFWSUB_W_FUNCT6)
 
   // Vector Widening Floating-Point Reduction Instructions
-  DEFINE_OPFVV(vfwredusum, VFWREDUSUM_FUNCT6)
-  DEFINE_OPFVV(vfwredosum, VFWREDOSUM_FUNCT6)
+  DEFINE_OPFRED(vfwredusum, VFWREDUSUM_FUNCT6)
+  DEFINE_OPFRED(vfwredosum, VFWREDOSUM_FUNCT6)
 
   // Vector Widening Floating-Point Multiply
   DEFINE_OPFVV(vfwmul, VFWMUL_FUNCT6)
@@ -399,6 +405,18 @@ class AssemblerRISCVV : public AssemblerRiscvBase {
 
   void vcpop_m(Register rd, VRegister vs2, MaskType mask = NoMask);
 
+  void vmslt_vi(VRegister vd, VRegister vs1, int8_t imm5,
+                MaskType mask = NoMask) {
+    DCHECK(imm5 >= -15 && imm5 <= 16);
+    vmsle_vi(vd, vs1, imm5 - 1, mask);
+  }
+
+  void vmsltu_vi(VRegister vd, VRegister vs1, int8_t imm5,
+                 MaskType mask = NoMask) {
+    DCHECK(imm5 >= 1 && imm5 <= 16);
+    vmsleu_vi(vd, vs1, imm5 - 1, mask);
+  }
+
  protected:
   void vsetvli(Register rd, Register rs1, VSew vsew, Vlmul vlmul,
                TailAgnosticType tail = tu, MaskAgnosticType mask = mu);
diff --git a/deps/v8/src/codegen/riscv/interface-descriptors-riscv-inl.h b/deps/v8/src/codegen/riscv/interface-descriptors-riscv-inl.h
index dfda1ef7201ca2..e327af151d8dbf 100644
--- a/deps/v8/src/codegen/riscv/interface-descriptors-riscv-inl.h
+++ b/deps/v8/src/codegen/riscv/interface-descriptors-riscv-inl.h
@@ -18,6 +18,23 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  auto registers = DoubleRegisterArray(ft1, ft2, ft3, ft4, ft5, ft6, ft7);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Padding to have as many double return registers as GP return registers.
+  auto registers = DoubleRegisterArray(kFPReturnRegister0, no_dreg, no_dreg);
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -277,11 +294,36 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  return RegisterArray(a1,   // kApiFunctionAddress
-                       a2,   // kArgc
-                       a3,   // kCallData
-                       a0);  // kHolder
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return a1;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return a2;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return a3;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return a0;
+}
+
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return a2;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return a3;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return a0;
 }
 
 // static
@@ -319,6 +361,11 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray(a0, a1);
 }
 
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(t0);
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/riscv/macro-assembler-riscv.cc b/deps/v8/src/codegen/riscv/macro-assembler-riscv.cc
index b39661c7715c5f..82a57065bb5771 100644
--- a/deps/v8/src/codegen/riscv/macro-assembler-riscv.cc
+++ b/deps/v8/src/codegen/riscv/macro-assembler-riscv.cc
@@ -124,7 +124,7 @@ static void TailCallOptimizedCodeSlot(MacroAssembler* masm,
   __ ReplaceClosureCodeWithOptimizedCode(optimized_code_entry, closure);
 
   static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-  __ LoadCodeEntry(a2, optimized_code_entry);
+  __ LoadCodeInstructionStart(a2, optimized_code_entry);
   __ Jump(a2);
 
   // Optimized code slot contains deoptimized code or code is cleared and
@@ -175,7 +175,7 @@ void MacroAssembler::GenerateTailCallToReturnedCode(
 
     CallRuntime(function_id, 1);
     // Use the return value before restoring a0
-    LoadCodeEntry(a2, a0);
+    LoadCodeInstructionStart(a2, a0);
     // Restore target function, new target and actual argument count.
     Pop(kJavaScriptCallTargetRegister, kJavaScriptCallNewTargetRegister,
         kJavaScriptCallArgCountRegister);
@@ -246,20 +246,29 @@ void MacroAssembler::OptimizeCodeOrTailCallOptimizedCodeSlot(
 }
 
 void MacroAssembler::LoadRoot(Register destination, RootIndex index) {
+#if V8_TARGET_ARCH_RISCV64
+  if (V8_STATIC_ROOTS_BOOL && RootsTable::IsReadOnly(index) &&
+      is_int12(ReadOnlyRootPtr(index))) {
+    DecompressTagged(destination, ReadOnlyRootPtr(index));
+    return;
+  }
+#endif
+  // Many roots have addresses that are too large to fit into addition immediate
+  // operands. Evidence suggests that the extra instruction for decompression
+  // costs us more than the load.
   LoadWord(destination,
            MemOperand(kRootRegister, RootRegisterOffsetForRootIndex(index)));
 }
 
-void MacroAssembler::LoadRoot(Register destination, RootIndex index,
-                              Condition cond, Register src1,
-                              const Operand& src2) {
-  Label skip;
-  BranchShort(&skip, NegateCondition(cond), src1, src2);
+void MacroAssembler::LoadTaggedRoot(Register destination, RootIndex index) {
+  if (V8_STATIC_ROOTS_BOOL && RootsTable::IsReadOnly(index) &&
+      is_int12(ReadOnlyRootPtr(index))) {
+    li(destination, (int32_t)ReadOnlyRootPtr(index));
+    return;
+  }
   LoadWord(destination,
            MemOperand(kRootRegister, RootRegisterOffsetForRootIndex(index)));
-  bind(&skip);
 }
-
 void MacroAssembler::PushCommonFrame(Register marker_reg) {
   if (marker_reg.is_valid()) {
     Push(ra, fp, marker_reg);
@@ -327,6 +336,36 @@ void MacroAssembler::RecordWriteField(Register object, int offset,
   bind(&done);
 }
 
+void MacroAssembler::LoadExternalPointerField(Register destination,
+                                              MemOperand field_operand,
+                                              ExternalPointerTag tag,
+                                              Register isolate_root) {
+  DCHECK(!AreAliased(destination, isolate_root));
+  ASM_CODE_COMMENT(this);
+#ifdef V8_ENABLE_SANDBOX
+  DCHECK_NE(tag, kExternalPointerNullTag);
+  DCHECK(!IsSharedExternalPointerType(tag));
+  UseScratchRegisterScope temps(this);
+  Register external_table = temps.Acquire();
+  if (isolate_root == no_reg) {
+    DCHECK(root_array_available_);
+    isolate_root = kRootRegister;
+  }
+  LoadWord(external_table,
+           MemOperand(isolate_root,
+                      IsolateData::external_pointer_table_offset() +
+                          Internals::kExternalPointerTableBasePointerOffset));
+  lwu(destination, field_operand);
+  srli(destination, destination, kExternalPointerIndexShift);
+  slli(destination, destination, kExternalPointerTableEntrySizeLog2);
+  AddWord(external_table, external_table, destination);
+  LoadWord(destination, MemOperand(external_table, 0));
+  And(destination, destination, Operand(~tag));
+#else
+  LoadWord(destination, field_operand);
+#endif  // V8_ENABLE_SANDBOX
+}
+
 void MacroAssembler::MaybeSaveRegisters(RegList registers) {
   if (registers.is_empty()) return;
   MultiPush(registers);
@@ -468,6 +507,41 @@ void MacroAssembler::RecordWrite(Register object, Operand offset,
 // ---------------------------------------------------------------------------
 // Instruction macros.
 #if V8_TARGET_ARCH_RISCV64
+void MacroAssembler::DecodeSandboxedPointer(Register value) {
+  ASM_CODE_COMMENT(this);
+#ifdef V8_ENABLE_SANDBOX
+  srli(value, value, kSandboxedPointerShift);
+  AddWord(value, value, kPtrComprCageBaseRegister);
+#else
+  UNREACHABLE();
+#endif
+}
+
+void MacroAssembler::LoadSandboxedPointerField(
+    Register destination, const MemOperand& field_operand) {
+#ifdef V8_ENABLE_SANDBOX
+  ASM_CODE_COMMENT(this);
+  LoadWord(destination, field_operand);
+  DecodeSandboxedPointer(destination);
+#else
+  UNREACHABLE();
+#endif
+}
+
+void MacroAssembler::StoreSandboxedPointerField(
+    Register value, const MemOperand& dst_field_operand) {
+#ifdef V8_ENABLE_SANDBOX
+  ASM_CODE_COMMENT(this);
+  UseScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  SubWord(scratch, value, kPtrComprCageBaseRegister);
+  slli(scratch, scratch, kSandboxedPointerShift);
+  StoreWord(scratch, dst_field_operand);
+#else
+  UNREACHABLE();
+#endif
+}
+
 void MacroAssembler::Add32(Register rd, Register rs, const Operand& rt) {
   if (rt.is_reg()) {
     if (v8_flags.riscv_c_extension && (rd.code() == rs.code()) &&
@@ -3097,8 +3171,8 @@ void MacroAssembler::RoundHelper(VRegister dst, VRegister src, Register scratch,
     } else {
 #ifdef V8_TARGET_ARCH_RISCV64
       fmv_d_x(kScratchDoubleReg, zero_reg);
-#else
-      UNIMPLEMENTED();
+#elif V8_TARGET_ARCH_RISCV32
+      fcvt_d_w(kScratchDoubleReg, zero_reg);
 #endif
     }
     vfadd_vf(dst, src, kScratchDoubleReg, MaskType::Mask);
@@ -3856,7 +3930,7 @@ void MacroAssembler::Branch(int32_t offset) {
 }
 
 void MacroAssembler::Branch(int32_t offset, Condition cond, Register rs,
-                            const Operand& rt, Label::Distance near_jump) {
+                            const Operand& rt, Label::Distance distance) {
   bool is_near = BranchShortCheck(offset, nullptr, cond, rs, rt);
   DCHECK(is_near);
   USE(is_near);
@@ -3879,7 +3953,7 @@ void MacroAssembler::Branch(Label* L) {
 }
 
 void MacroAssembler::Branch(Label* L, Condition cond, Register rs,
-                            const Operand& rt, Label::Distance near_jump) {
+                            const Operand& rt, Label::Distance distance) {
   if (L->is_bound()) {
     if (!BranchShortCheck(0, L, cond, rs, rt)) {
       if (cond != cc_always) {
@@ -3894,7 +3968,7 @@ void MacroAssembler::Branch(Label* L, Condition cond, Register rs,
       }
     }
   } else {
-    if (is_trampoline_emitted() && near_jump == Label::Distance::kFar) {
+    if (is_trampoline_emitted() && distance == Label::Distance::kFar) {
       if (cond != cc_always) {
         Label skip;
         Condition neg_cond = NegateCondition(cond);
@@ -3912,11 +3986,45 @@ void MacroAssembler::Branch(Label* L, Condition cond, Register rs,
 }
 
 void MacroAssembler::Branch(Label* L, Condition cond, Register rs,
-                            RootIndex index) {
+                            RootIndex index, Label::Distance distance) {
   UseScratchRegisterScope temps(this);
-  Register scratch = temps.Acquire();
-  LoadRoot(scratch, index);
-  Branch(L, cond, rs, Operand(scratch));
+  Register right = temps.Acquire();
+  if (COMPRESS_POINTERS_BOOL) {
+    Register left = rs;
+    if (V8_STATIC_ROOTS_BOOL && RootsTable::IsReadOnly(index) &&
+        is_int12(ReadOnlyRootPtr(index))) {
+      left = temps.Acquire();
+      Sll32(left, rs, 0);
+    }
+    LoadTaggedRoot(right, index);
+    Branch(L, cond, left, Operand(right));
+  } else {
+    LoadRoot(right, index);
+    Branch(L, cond, rs, Operand(right));
+  }
+}
+
+void MacroAssembler::CompareTaggedAndBranch(Label* label, Condition cond,
+                                            Register r1, const Operand& r2,
+                                            bool need_link) {
+  if (COMPRESS_POINTERS_BOOL) {
+    UseScratchRegisterScope temps(this);
+    Register scratch0 = temps.Acquire();
+    Sll32(scratch0, r1, 0);
+    if (IsZero(r2)) {
+      Branch(label, cond, scratch0, Operand(zero_reg));
+    } else {
+      Register scratch1 = temps.Acquire();
+      if (r2.is_reg()) {
+        Sll32(scratch1, r2.rm(), 0);
+      } else {
+        li(scratch1, r2);
+      }
+      Branch(label, cond, scratch0, Operand(scratch1));
+    }
+  } else {
+    Branch(label, cond, r1, r2);
+  }
 }
 
 void MacroAssembler::BranchShortHelper(int32_t offset, Label* L) {
@@ -4242,6 +4350,38 @@ void MacroAssembler::LoadRootRelative(Register destination, int32_t offset) {
   LoadWord(destination, MemOperand(kRootRegister, offset));
 }
 
+MemOperand MacroAssembler::ExternalReferenceAsOperand(
+    ExternalReference reference, Register scratch) {
+  if (root_array_available_ && options().enable_root_relative_access) {
+    int64_t offset =
+        RootRegisterOffsetForExternalReference(isolate(), reference);
+    if (is_int32(offset)) {
+      return MemOperand(kRootRegister, static_cast<int32_t>(offset));
+    }
+  }
+  if (root_array_available_ && options().isolate_independent_code) {
+    if (IsAddressableThroughRootRegister(isolate(), reference)) {
+      // Some external references can be efficiently loaded as an offset from
+      // kRootRegister.
+      intptr_t offset =
+          RootRegisterOffsetForExternalReference(isolate(), reference);
+      CHECK(is_int32(offset));
+      return MemOperand(kRootRegister, static_cast<int32_t>(offset));
+    } else {
+      // Otherwise, do a memory load from the external reference table.
+      DCHECK(scratch.is_valid());
+      LoadWord(scratch,
+               MemOperand(kRootRegister,
+                          RootRegisterOffsetForExternalReferenceTableEntry(
+                              isolate(), reference)));
+      return MemOperand(scratch, 0);
+    }
+  }
+  DCHECK(scratch.is_valid());
+  li(scratch, reference);
+  return MemOperand(scratch, 0);
+}
+
 void MacroAssembler::LoadRootRegisterOffset(Register destination,
                                             intptr_t offset) {
   if (offset == 0) {
@@ -4385,7 +4525,8 @@ void MacroAssembler::Call(Handle<Code> code, RelocInfo::Mode rmode,
   }
 }
 
-void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin) {
+void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index,
+                                               Register target) {
 #if V8_TARGET_ARCH_RISCV64
   static_assert(kSystemPointerSize == 8);
 #elif V8_TARGET_ARCH_RISCV32
@@ -4395,15 +4536,16 @@ void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin) {
   static_assert(kSmiTag == 0);
 
   // The builtin register contains the builtin index as a Smi.
-  SmiUntag(builtin, builtin);
-  CalcScaledAddress(builtin, kRootRegister, builtin, kSystemPointerSizeLog2);
-  LoadWord(builtin,
-           MemOperand(builtin, IsolateData::builtin_entry_table_offset()));
+  SmiUntag(target, builtin_index);
+  CalcScaledAddress(target, kRootRegister, target, kSystemPointerSizeLog2);
+  LoadWord(target,
+           MemOperand(target, IsolateData::builtin_entry_table_offset()));
 }
 
-void MacroAssembler::CallBuiltinByIndex(Register builtin) {
-  LoadEntryFromBuiltinIndex(builtin);
-  Call(builtin);
+void MacroAssembler::CallBuiltinByIndex(Register builtin_index,
+                                        Register target) {
+  LoadEntryFromBuiltinIndex(builtin_index, target);
+  Call(target);
 }
 
 void MacroAssembler::CallBuiltin(Builtin builtin) {
@@ -4872,7 +5014,7 @@ void MacroAssembler::CheckDebugHook(Register fun, Register new_target,
     // Load receiver to pass it later to DebugOnFunctionCall hook.
     UseScratchRegisterScope temps(this);
     Register receiver = temps.Acquire();
-    LoadReceiver(receiver, actual_parameter_count);
+    LoadReceiver(receiver);
 
     FrameScope frame(
         this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
@@ -4926,14 +5068,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // We call indirectly through the code field in the function to
   // allow recompilation to take effect without changing any of the
   // call sites.
-  Register code = kJavaScriptCallCodeStartRegister;
-  LoadTaggedField(code, FieldMemOperand(function, JSFunction::kCodeOffset));
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(code);
+      CallJSFunction(function);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(code);
+      JumpJSFunction(function);
       break;
   }
 
@@ -5055,6 +5195,7 @@ void MacroAssembler::WasmRvvGtU(VRegister dst, VRegister lhs, VRegister rhs,
   vmerge_vx(dst, kScratchReg, dst);
 }
 
+#if V8_TARGET_ARCH_RISCV64
 void MacroAssembler::WasmRvvS128const(VRegister dst, const uint8_t imms[16]) {
   uint64_t vals[2];
   memcpy(vals, imms, sizeof(vals));
@@ -5065,12 +5206,28 @@ void MacroAssembler::WasmRvvS128const(VRegister dst, const uint8_t imms[16]) {
   li(kScratchReg, vals[0]);
   vmv_sx(dst, kScratchReg);
 }
+#elif V8_TARGET_ARCH_RISCV32
+void MacroAssembler::WasmRvvS128const(VRegister dst, const uint8_t imms[16]) {
+  uint32_t vals[4];
+  memcpy(vals, imms, sizeof(vals));
+  VU.set(kScratchReg, VSew::E32, Vlmul::m1);
+  li(kScratchReg, vals[3]);
+  vmv_vx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, vals[2]);
+  vmv_sx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, vals[1]);
+  vmv_vx(dst, kScratchReg);
+  li(kScratchReg, vals[0]);
+  vmv_sx(dst, kScratchReg);
+  vslideup_vi(dst, kSimd128ScratchReg, 2);
+}
+#endif
 
 void MacroAssembler::LoadLane(int ts, VRegister dst, uint8_t laneidx,
                               MemOperand src) {
   if (ts == 8) {
     Lbu(kScratchReg2, src);
-    VU.set(kScratchReg, E64, m1);
+    VU.set(kScratchReg, E32, m1);
     li(kScratchReg, 0x1 << laneidx);
     vmv_sx(v0, kScratchReg);
     VU.set(kScratchReg, E8, m1);
@@ -5088,11 +5245,19 @@ void MacroAssembler::LoadLane(int ts, VRegister dst, uint8_t laneidx,
     vmv_sx(v0, kScratchReg);
     vmerge_vx(dst, kScratchReg2, dst);
   } else if (ts == 64) {
+#if V8_TARGET_ARCH_RISCV64
     LoadWord(kScratchReg2, src);
     VU.set(kScratchReg, E64, m1);
     li(kScratchReg, 0x1 << laneidx);
     vmv_sx(v0, kScratchReg);
     vmerge_vx(dst, kScratchReg2, dst);
+#elif V8_TARGET_ARCH_RISCV32
+    LoadDouble(kScratchDoubleReg, src);
+    VU.set(kScratchReg, E64, m1);
+    li(kScratchReg, 0x1 << laneidx);
+    vmv_sx(v0, kScratchReg);
+    vfmerge_vf(dst, kScratchDoubleReg, dst);
+#endif
   } else {
     UNREACHABLE();
   }
@@ -5119,8 +5284,13 @@ void MacroAssembler::StoreLane(int sz, VRegister src, uint8_t laneidx,
     DCHECK_EQ(sz, 64);
     VU.set(kScratchReg, E64, m1);
     vslidedown_vi(kSimd128ScratchReg, src, laneidx);
+#if V8_TARGET_ARCH_RISCV64
     vmv_xs(kScratchReg, kSimd128ScratchReg);
     StoreWord(kScratchReg, dst);
+#elif V8_TARGET_ARCH_RISCV32
+    vfmv_fs(kScratchDoubleReg, kSimd128ScratchReg);
+    StoreDouble(kScratchDoubleReg, dst);
+#endif
   }
 }
 // -----------------------------------------------------------------------------
@@ -5374,7 +5544,8 @@ void MacroAssembler::JumpToExternalReference(const ExternalReference& builtin,
 void MacroAssembler::LoadWeakValue(Register out, Register in,
                                    Label* target_if_cleared) {
   ASM_CODE_COMMENT(this);
-  Branch(target_if_cleared, eq, in, Operand(kClearedWeakHeapObjectLower32));
+  CompareTaggedAndBranch(target_if_cleared, eq, in,
+                         Operand(kClearedWeakHeapObjectLower32));
   And(out, in, Operand(~kWeakHeapObjectMask));
 }
 
@@ -5421,6 +5592,38 @@ void MacroAssembler::Assert(Condition cc, AbortReason reason, Register rs,
   if (v8_flags.debug_code) Check(cc, reason, rs, rt);
 }
 
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 Register tmp, AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp, tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok);
+
+  GetObjectType(object, map_tmp, tmp);
+
+  Branch(&ok, kUnsignedLessThanEqual, tmp, Operand(LAST_NAME_TYPE));
+
+  Branch(&ok, kUnsignedGreaterThanEqual, tmp, Operand(FIRST_JS_RECEIVER_TYPE));
+
+  Branch(&ok, kEqual, map_tmp, RootIndex::kHeapNumberMap);
+
+  Branch(&ok, kEqual, map_tmp, RootIndex::kBigIntMap);
+
+  Branch(&ok, kEqual, object, RootIndex::kUndefinedValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kTrueValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kFalseValue);
+
+  Branch(&ok, kEqual, object, RootIndex::kNullValue);
+
+  Abort(abort_reason);
+  bind(&ok);
+}
+
 void MacroAssembler::Check(Condition cc, AbortReason reason, Register rs,
                            Operand rt) {
   Label L;
@@ -5492,6 +5695,11 @@ void MacroAssembler::LoadMap(Register destination, Register object) {
   LoadTaggedField(destination, FieldMemOperand(object, HeapObject::kMapOffset));
 }
 
+void MacroAssembler::LoadCompressedMap(Register dst, Register object) {
+  ASM_CODE_COMMENT(this);
+  Lw(dst, FieldMemOperand(object, HeapObject::kMapOffset));
+}
+
 void MacroAssembler::LoadNativeContextSlot(Register dst, int index) {
   ASM_CODE_COMMENT(this);
   LoadMap(dst, cp);
@@ -5539,7 +5747,8 @@ void MacroAssembler::EnterExitFrame(int stack_space,
                                     StackFrame::Type frame_type) {
   ASM_CODE_COMMENT(this);
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
 
   // Set up the frame structure on the stack.
   static_assert(2 * kSystemPointerSize ==
@@ -5713,18 +5922,19 @@ void MacroAssembler::SmiToInt32(Register smi) {
   SmiUntag(smi);
 }
 
-void MacroAssembler::JumpIfSmi(Register value, Label* smi_label) {
+void MacroAssembler::JumpIfSmi(Register value, Label* smi_label,
+                               Label::Distance distance) {
   ASM_CODE_COMMENT(this);
   DCHECK_EQ(0, kSmiTag);
   UseScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
   andi(scratch, value, kSmiTagMask);
-  Branch(smi_label, eq, scratch, Operand(zero_reg));
+  Branch(smi_label, eq, scratch, Operand(zero_reg), distance);
 }
 
 void MacroAssembler::JumpIfCodeIsMarkedForDeoptimization(
     Register code, Register scratch, Label* if_marked_for_deoptimization) {
-  Load32U(scratch, FieldMemOperand(code, Code::kKindSpecificFlagsOffset));
+  Load32U(scratch, FieldMemOperand(code, Code::kFlagsOffset));
   And(scratch, scratch, Operand(1 << Code::kMarkedForDeoptimizationBit));
   Branch(if_marked_for_deoptimization, ne, scratch, Operand(zero_reg));
 }
@@ -5734,13 +5944,74 @@ Operand MacroAssembler::ClearedValue() const {
       static_cast<int32_t>(HeapObjectReference::ClearedValue(isolate()).ptr()));
 }
 
-void MacroAssembler::JumpIfNotSmi(Register value, Label* not_smi_label) {
+void MacroAssembler::JumpIfNotSmi(Register value, Label* not_smi_label,
+                                  Label::Distance distance) {
   ASM_CODE_COMMENT(this);
   UseScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
   DCHECK_EQ(0, kSmiTag);
   andi(scratch, value, kSmiTagMask);
-  Branch(not_smi_label, ne, scratch, Operand(zero_reg));
+  Branch(not_smi_label, ne, scratch, Operand(zero_reg), distance);
+}
+
+void MacroAssembler::JumpIfObjectType(Label* target, Condition cc,
+                                      Register object,
+                                      InstanceType instance_type,
+                                      Register scratch) {
+  DCHECK(cc == eq || cc == ne);
+  UseScratchRegisterScope temps(this);
+  if (scratch == no_reg) {
+    scratch = temps.Acquire();
+  }
+  if (V8_STATIC_ROOTS_BOOL) {
+    if (base::Optional<RootIndex> expected =
+            InstanceTypeChecker::UniqueMapOfInstanceType(instance_type)) {
+      Tagged_t ptr = ReadOnlyRootPtr(*expected);
+      LoadCompressedMap(scratch, object);
+      Branch(target, cc, scratch, Operand(ptr));
+      return;
+    }
+  }
+  GetObjectType(object, scratch, scratch);
+  Branch(target, cc, scratch, Operand(instance_type));
+}
+
+void MacroAssembler::JumpIfJSAnyIsNotPrimitive(Register heap_object,
+                                               Register scratch, Label* target,
+                                               Label::Distance distance,
+                                               Condition cc) {
+  CHECK(cc == Condition::kUnsignedLessThan ||
+        cc == Condition::kUnsignedGreaterThanEqual);
+  if (V8_STATIC_ROOTS_BOOL) {
+#ifdef DEBUG
+    Label ok;
+    LoadMap(scratch, heap_object);
+    GetInstanceTypeRange(scratch, scratch, FIRST_JS_RECEIVER_TYPE, scratch);
+    Branch(&ok, Condition::kUnsignedLessThanEqual, scratch,
+           Operand(LAST_JS_RECEIVER_TYPE - FIRST_JS_RECEIVER_TYPE));
+
+    LoadMap(scratch, heap_object);
+    GetInstanceTypeRange(scratch, scratch, FIRST_PRIMITIVE_HEAP_OBJECT_TYPE,
+                         scratch);
+    Branch(&ok, Condition::kUnsignedLessThanEqual, scratch,
+           Operand(LAST_PRIMITIVE_HEAP_OBJECT_TYPE -
+                   FIRST_PRIMITIVE_HEAP_OBJECT_TYPE));
+
+    Abort(AbortReason::kInvalidReceiver);
+    bind(&ok);
+#endif  // DEBUG
+
+    // All primitive object's maps are allocated at the start of the read only
+    // heap. Thus JS_RECEIVER's must have maps with larger (compressed)
+    // addresses.
+    LoadCompressedMap(scratch, heap_object);
+    Branch(target, cc, scratch,
+           Operand(InstanceTypeChecker::kNonJsReceiverMapLimit));
+  } else {
+    static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
+    GetObjectType(heap_object, scratch, scratch);
+    Branch(target, cc, scratch, Operand(FIRST_JS_RECEIVER_TYPE));
+  }
 }
 
 void MacroAssembler::AssertNotSmi(Register object, AbortReason reason) {
@@ -6160,24 +6431,64 @@ void MacroAssembler::CallForDeoptimization(Builtin target, int, Label* exit,
                                             : Deoptimizer::kEagerDeoptExitSize);
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination, Register code) {
+void MacroAssembler::LoadCodeInstructionStart(Register destination,
+                                              Register code) {
   ASM_CODE_COMMENT(this);
-  LoadWord(destination, FieldMemOperand(code, Code::kCodeEntryPointOffset));
+  LoadWord(destination, FieldMemOperand(code, Code::kInstructionStartOffset));
 }
 
 void MacroAssembler::CallCodeObject(Register code) {
   ASM_CODE_COMMENT(this);
-  LoadCodeEntry(code, code);
+  LoadCodeInstructionStart(code, code);
   Call(code);
 }
 
 void MacroAssembler::JumpCodeObject(Register code, JumpMode jump_mode) {
   ASM_CODE_COMMENT(this);
   DCHECK_EQ(JumpMode::kJump, jump_mode);
-  LoadCodeEntry(code, code);
+  LoadCodeInstructionStart(code, code);
   Jump(code);
 }
 
+void MacroAssembler::CallJSFunction(Register function_object) {
+  Register code = kJavaScriptCallCodeStartRegister;
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // When the sandbox is enabled, we can directly fetch the entrypoint pointer
+  // from the code pointer table instead of going through the Code object. In
+  // this way, we avoid one memory load on this code path.
+  LoadCodeEntrypointField(
+      code, FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  Call(code);
+#else
+  LoadTaggedField(code,
+                  FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  CallCodeObject(code);
+#endif
+}
+
+void MacroAssembler::JumpJSFunction(Register function_object,
+                                    JumpMode jump_mode) {
+  Register code = kJavaScriptCallCodeStartRegister;
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // When the sandbox is enabled, we can directly fetch the entrypoint pointer
+  // from the code pointer table instead of going through the Code object. In
+  // this way, we avoid one memory load on this code path.
+  LoadCodeEntrypointField(
+      code, FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  DCHECK_EQ(jump_mode, JumpMode::kJump);
+  // We jump through x17 here because for Branch Identification (BTI) we use
+  // "Call" (`bti c`) rather than "Jump" (`bti j`) landing pads for tail-called
+  // code. See TailCallBuiltin for more information.
+  DCHECK_NE(code, t6);
+  Mov(t6, code);
+  Jump(t6);
+#else
+  LoadTaggedField(code,
+                  FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  JumpCodeObject(code, jump_mode);
+#endif
+}
+
 #if V8_TARGET_ARCH_RISCV64
 void MacroAssembler::LoadTaggedField(const Register& destination,
                                      const MemOperand& field_operand) {
@@ -6210,6 +6521,18 @@ void MacroAssembler::StoreTaggedField(const Register& value,
   }
 }
 
+void MacroAssembler::AtomicStoreTaggedField(Register src,
+                                            const MemOperand& dst) {
+  UseScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  AddWord(scratch, dst.rm(), dst.offset());
+  if (COMPRESS_POINTERS_BOOL) {
+    amoswap_w(true, true, zero_reg, src, scratch);
+  } else {
+    amoswap_d(true, true, zero_reg, src, scratch);
+  }
+}
+
 void MacroAssembler::DecompressTaggedSigned(const Register& destination,
                                             const MemOperand& field_operand) {
   ASM_CODE_COMMENT(this);
@@ -6234,18 +6557,44 @@ void MacroAssembler::DecompressTagged(const Register& destination,
   And(destination, source, Operand(0xFFFFFFFF));
   AddWord(destination, kPtrComprCageBaseRegister, Operand(destination));
 }
+
+void MacroAssembler::DecompressTagged(Register dst, Tagged_t immediate) {
+  ASM_CODE_COMMENT(this);
+  AddWord(dst, kPtrComprCageBaseRegister, static_cast<int32_t>(immediate));
+}
+
+void MacroAssembler::AtomicDecompressTaggedSigned(Register dst,
+                                                  const MemOperand& src) {
+  ASM_CODE_COMMENT(this);
+  Lwu(dst, src);
+  sync();
+  if (v8_flags.debug_code) {
+    // Corrupt the top 32 bits. Made up of 16 fixed bits and 16 pc offset bits.
+    AddWord(dst, dst,
+            Operand(((kDebugZapValue << 16) | (pc_offset() & 0xffff)) << 32));
+  }
+}
+
+void MacroAssembler::AtomicDecompressTagged(Register dst,
+                                            const MemOperand& src) {
+  ASM_CODE_COMMENT(this);
+  Lwu(dst, src);
+  sync();
+  AddWord(dst, kPtrComprCageBaseRegister, dst);
+}
+
 #endif
 void MacroAssembler::DropArguments(Register count, ArgumentsCountType type,
                                    ArgumentsCountMode mode, Register scratch) {
   switch (type) {
     case kCountIsInteger: {
-      CalcScaledAddress(sp, sp, count, kPointerSizeLog2);
+      CalcScaledAddress(sp, sp, count, kSystemPointerSizeLog2);
       break;
     }
     case kCountIsSmi: {
       static_assert(kSmiTagSize == 1 && kSmiTag == 0);
       DCHECK_NE(scratch, no_reg);
-      SmiScale(scratch, count, kPointerSizeLog2);
+      SmiScale(scratch, count, kSystemPointerSizeLog2);
       AddWord(sp, sp, scratch);
       break;
     }
@@ -6274,6 +6623,175 @@ void MacroAssembler::DropArgumentsAndPushNewReceiver(Register argc,
     push(receiver);
   }
 }
+
+// Calls an API function. Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand) {
+  ASM_CODE_COMMENT(masm);
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  Register return_value = a0;
+  Register scratch = a4;
+  Register scratch2 = a5;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = kScratchReg;
+  Register prev_limit_reg = s1;
+  Register prev_level_reg = s2;
+
+  // C arguments (arg_reg_1/2) are expected to be initialized outside, so this
+  // function must not corrupt them (return_value overlaps with arg_reg_1 but
+  // that's ok because we start using it only after the C call).
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2,  // C args
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ LoadWord(prev_next_address_reg, next_mem_op);
+    __ LoadWord(prev_limit_reg, limit_mem_op);
+    __ Lw(prev_level_reg, level_mem_op);
+    __ Add32(scratch, prev_level_reg, Operand(1));
+    __ Sw(scratch, level_mem_op);
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ Lb(scratch, __ ExternalReferenceAsOperand(
+                       ER::execution_mode_address(isolate), no_reg));
+    __ Branch(&profiler_or_side_effects_check_enabled, ne, scratch,
+              Operand(zero_reg));
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ li(scratch, ER::address_of_runtime_stats_flag());
+    __ Lw(scratch, MemOperand(scratch, 0));
+    __ Branch(&profiler_or_side_effects_check_enabled, ne, scratch,
+              Operand(zero_reg));
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ StoreReturnAddressAndCall(function_address);
+  __ bind(&done_api_call);
+
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  __ RecordComment("Load the value from ReturnValue");
+  __ LoadWord(return_value, return_value_operand);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ StoreWord(prev_next_address_reg, next_mem_op);
+    if (v8_flags.debug_code) {
+      __ Lw(scratch, level_mem_op);
+      __ Sub32(scratch, scratch, Operand(1));
+      __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall, scratch,
+               Operand(prev_level_reg));
+    }
+    __ Sw(prev_level_reg, level_mem_op);
+    __ LoadWord(scratch, limit_mem_op);
+    __ Branch(&delete_allocated_handles, ne, prev_limit_reg, Operand(scratch));
+  }
+  __ RecordComment("Leave the API exit frame.");
+  __ bind(&leave_exit_frame);
+
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand == nullptr) {
+    DCHECK_NE(stack_space, 0);
+    __ li(stack_space_reg, Operand(stack_space));
+  } else {
+    DCHECK_EQ(stack_space, 0);
+    static_assert(kCArgSlotCount == 0);
+    __ LoadWord(stack_space_reg, *stack_space_operand);
+  }
+
+  static constexpr bool kRegisterContainsSlotCount = false;
+  __ LeaveExitFrame(stack_space_reg, NO_EMIT_RETURN,
+                    kRegisterContainsSlotCount);
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ LoadRoot(scratch2, RootIndex::kTheHoleValue);
+    __ LoadWord(scratch, __ ExternalReferenceAsOperand(
+                             ER::scheduled_exception_address(isolate), no_reg));
+    __ Branch(&promote_scheduled_exception, ne, scratch2, Operand(scratch),
+              Label::Distance::kNear);
+  }
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ Branch(&finish_return, ne, return_value, RootIndex::kTheHoleValue);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch, scratch2,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  __ Ret();
+
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via thunk wrapper.");
+    __ bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback function.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ StoreWord(thunk_arg, thunk_arg_mem_op);
+    __ li(scratch, thunk_ref);
+    __ StoreReturnAddressAndCall(scratch);
+    __ Branch(&done_api_call);
+  }
+
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ bind(&delete_allocated_handles);
+    __ StoreWord(prev_limit_reg, limit_mem_op);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ Move(saved_result, a0);
+    __ PrepareCallCFunction(1, prev_level_reg);
+    __ li(arg_reg_1, ER::isolate_address(isolate));
+    __ CallCFunction(ER::delete_handle_scope_extensions(), 1);
+    __ Move(arg_reg_1, saved_result);
+    __ Branch(&leave_exit_frame);
+  }
+}
+
 #undef __
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/codegen/riscv/macro-assembler-riscv.h b/deps/v8/src/codegen/riscv/macro-assembler-riscv.h
index 193b10658f753e..7c1d95b4592012 100644
--- a/deps/v8/src/codegen/riscv/macro-assembler-riscv.h
+++ b/deps/v8/src/codegen/riscv/macro-assembler-riscv.h
@@ -11,7 +11,9 @@
 
 #include "src/codegen/assembler-arch.h"
 #include "src/codegen/assembler.h"
+#include "src/codegen/bailout-reason.h"
 #include "src/common/globals.h"
+#include "src/execution/frame-constants.h"
 #include "src/execution/isolate-data.h"
 #include "src/objects/tagged-index.h"
 
@@ -116,7 +118,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   }
 
   // Jump unconditionally to given label.
-  void jmp(Label* L) { Branch(L); }
+  void jmp(Label* L, Label::Distance distance = Label::kFar) {
+    Branch(L, distance);
+  }
 
   // -------------------------------------------------------------------------
   // Debugging.
@@ -131,6 +135,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // Use --debug_code to enable.
   void Assert(Condition cc, AbortReason reason, Register rs, Operand rt);
 
+  void AssertJSAny(Register object, Register map_tmp, Register tmp,
+                   AbortReason abort_reason);
+
   // Like Assert(), but always enabled.
   void Check(Condition cc, AbortReason reason, Register rs, Operand rt);
 
@@ -157,9 +164,14 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void Branch(int32_t target);
   void BranchLong(Label* L);
   void Branch(Label* target, Condition cond, Register r1, const Operand& r2,
-              Label::Distance near_jump = Label::kFar);
+              Label::Distance distance = Label::kFar);
+  void Branch(Label* target, Label::Distance distance) {
+    Branch(target, cc_always, zero_reg, Operand(zero_reg), distance);
+  }
   void Branch(int32_t target, Condition cond, Register r1, const Operand& r2,
-              Label::Distance near_jump = Label::kFar);
+              Label::Distance distance = Label::kFar);
+  void Branch(Label* L, Condition cond, Register rj, RootIndex index,
+              Label::Distance distance = Label::kFar);
 #undef DECLARE_BRANCH_PROTOTYPES
 #undef COND_TYPED_ARGS
 #undef COND_ARGS
@@ -192,8 +204,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void BranchTrueF(Register rs, Label* target);
   void BranchFalseF(Register rs, Label* target);
 
-  void Branch(Label* L, Condition cond, Register rs, RootIndex index);
-
+  void CompareTaggedAndBranch(Label* label, Condition cond, Register r1,
+                              const Operand& r2, bool need_link = false);
   static int InstrCountForLi64Bit(int64_t value);
   inline void LiLower32BitHelper(Register rd, Operand j);
   void li_optimized(Register rd, Operand j, LiFlags mode = OPTIMIZE_SIZE);
@@ -213,6 +225,14 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void LoadFromConstantsTable(Register destination, int constant_index) final;
   void LoadRootRegisterOffset(Register destination, intptr_t offset) final;
   void LoadRootRelative(Register destination, int32_t offset) final;
+  // Operand pointing to an external reference.
+  // May emit code to set up the scratch register. The operand is
+  // only guaranteed to be correct as long as the scratch register
+  // isn't changed.
+  // If the operand is used more than once, use a scratch register
+  // that is guaranteed not to be clobbered.
+  MemOperand ExternalReferenceAsOperand(ExternalReference reference,
+                                        Register scratch);
 
   inline void GenPCRelativeJump(Register rd, int32_t imm32) {
     BlockTrampolinePoolScope block_trampoline_pool(this);
@@ -285,17 +305,23 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
       RelocInfo::Mode rmode = RelocInfo::INTERNAL_REFERENCE_ENCODED);
 
   // Load the code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_object);
+  void LoadCodeInstructionStart(Register destination, Register code_object);
   void CallCodeObject(Register code_object);
   void JumpCodeObject(Register code_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object);
+  void JumpJSFunction(Register function_object,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   // Load the builtin given by the Smi in |builtin| into the same
   // register.
-  void LoadEntryFromBuiltinIndex(Register builtin);
+  // Load the builtin given by the Smi in |builtin_index| into |target|.
+  void LoadEntryFromBuiltinIndex(Register builtin_index, Register target);
   void LoadEntryFromBuiltin(Builtin builtin, Register destination);
   MemOperand EntryFromBuiltinAsOperand(Builtin builtin);
-  void CallBuiltinByIndex(Register builtin);
+  void CallBuiltinByIndex(Register builtin_index, Register target);
   void CallBuiltin(Builtin builtin);
   void TailCallBuiltin(Builtin builtin);
 
@@ -927,10 +953,10 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   // Load an object from the root table.
   void LoadRoot(Register destination, RootIndex index) final;
-  void LoadRoot(Register destination, RootIndex index, Condition cond,
-                Register src1, const Operand& src2);
+  void LoadTaggedRoot(Register destination, RootIndex index);
 
   void LoadMap(Register destination, Register object);
+  void LoadCompressedMap(Register dst, Register object);
 
   // If the value is a NaN, canonicalize the value else, do nothing.
   void FPUCanonicalizeNaN(const DoubleRegister dst, const DoubleRegister src);
@@ -1050,7 +1076,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void SmiTag(Register reg) { SmiTag(reg, reg); }
 
   // Jump the register contains a smi.
-  void JumpIfSmi(Register value, Label* smi_label);
+  void JumpIfSmi(Register value, Label* smi_label,
+                 Label::Distance distance = Label::kFar);
 
   void JumpIfEqual(Register a, int32_t b, Label* dest) {
     Branch(dest, eq, a, Operand(b));
@@ -1092,12 +1119,30 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // Compresses and stores tagged value to given on-heap location.
   void StoreTaggedField(const Register& value,
                         const MemOperand& dst_field_operand);
+  void AtomicStoreTaggedField(Register dst, const MemOperand& src);
 
   void DecompressTaggedSigned(const Register& destination,
                               const MemOperand& field_operand);
   void DecompressTagged(const Register& destination,
                         const MemOperand& field_operand);
   void DecompressTagged(const Register& destination, const Register& source);
+  void DecompressTagged(Register dst, Tagged_t immediate);
+
+  // ---------------------------------------------------------------------------
+  // V8 Sandbox support
+
+  // Transform a SandboxedPointer from/to its encoded form, which is used when
+  // the pointer is stored on the heap and ensures that the pointer will always
+  // point into the sandbox.
+  void DecodeSandboxedPointer(Register value);
+  void LoadSandboxedPointerField(Register destination,
+                                 const MemOperand& field_operand);
+  void StoreSandboxedPointerField(Register value,
+                                  const MemOperand& dst_field_operand);
+
+  void AtomicDecompressTaggedSigned(Register dst, const MemOperand& src);
+  void AtomicDecompressTagged(Register dst, const MemOperand& src);
+
   void CmpTagged(const Register& rd, const Register& rs1, const Register& rs2) {
     if (COMPRESS_POINTERS_BOOL) {
       Sub32(rd, rs1, rs2);
@@ -1129,6 +1174,11 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
     Sw(value, dst_field_operand);
   }
 #endif
+  // Loads a field containing off-heap pointer and does necessary decoding
+  // if sandboxed external pointers are enabled.
+  void LoadExternalPointerField(Register destination, MemOperand field_operand,
+                                ExternalPointerTag tag,
+                                Register isolate_root = no_reg);
   // Control-flow integrity:
 
   // Define a function entrypoint. This doesn't emit any code for this
@@ -1151,7 +1201,6 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void WasmRvvEq(VRegister dst, VRegister lhs, VRegister rhs, VSew sew,
                  Vlmul lmul);
-
   void WasmRvvNe(VRegister dst, VRegister lhs, VRegister rhs, VSew sew,
                  Vlmul lmul);
   void WasmRvvGeS(VRegister dst, VRegister lhs, VRegister rhs, VSew sew,
@@ -1162,22 +1211,15 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
                   Vlmul lmul);
   void WasmRvvGtU(VRegister dst, VRegister lhs, VRegister rhs, VSew sew,
                   Vlmul lmul);
+
   void WasmRvvS128const(VRegister dst, const uint8_t imms[16]);
 
   void LoadLane(int sz, VRegister dst, uint8_t laneidx, MemOperand src);
   void StoreLane(int sz, VRegister src, uint8_t laneidx, MemOperand dst);
 
   // It assumes that the arguments are located below the stack pointer.
-  // argc is the number of arguments not including the receiver.
-  // TODO(victorgomes): Remove this function once we stick with the reversed
-  // arguments order.
-  void LoadReceiver(Register dest, Register argc) {
-    LoadWord(dest, MemOperand(sp, 0));
-  }
-
-  void StoreReceiver(Register rec, Register argc, Register scratch) {
-    StoreWord(rec, MemOperand(sp, 0));
-  }
+  void LoadReceiver(Register dest) { LoadWord(dest, MemOperand(sp, 0)); }
+  void StoreReceiver(Register rec) { StoreWord(rec, MemOperand(sp, 0)); }
 
   bool IsNear(Label* L, Condition cond, int rs_reg);
 
@@ -1193,26 +1235,35 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   }
 
   // Compare the object in a register to a value and jump if they are equal.
-  void JumpIfRoot(Register with, RootIndex index, Label* if_equal) {
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.Acquire();
-    LoadRoot(scratch, index);
-    Branch(if_equal, eq, with, Operand(scratch));
+  void JumpIfRoot(Register with, RootIndex index, Label* if_equal,
+                  Label::Distance distance = Label::kFar) {
+    Branch(if_equal, eq, with, index, distance);
   }
 
   // Compare the object in a register to a value and jump if they are not equal.
-  void JumpIfNotRoot(Register with, RootIndex index, Label* if_not_equal) {
-    UseScratchRegisterScope temps(this);
-    Register scratch = temps.Acquire();
-    LoadRoot(scratch, index);
-    Branch(if_not_equal, ne, with, Operand(scratch));
+  void JumpIfNotRoot(Register with, RootIndex index, Label* if_not_equal,
+                     Label::Distance distance = Label::kFar) {
+    Branch(if_not_equal, ne, with, index, distance);
   }
 
   // Checks if value is in range [lower_limit, higher_limit] using a single
   // comparison.
   void JumpIfIsInRange(Register value, unsigned lower_limit,
                        unsigned higher_limit, Label* on_in_range);
-
+  void JumpIfObjectType(Label* target, Condition cc, Register object,
+                        InstanceType instance_type, Register scratch = no_reg);
+  // Fast check if the object is a js receiver type. Assumes only primitive
+  // objects or js receivers are passed.
+  void JumpIfJSAnyIsNotPrimitive(
+      Register heap_object, Register scratch, Label* target,
+      Label::Distance distance = Label::kFar,
+      Condition condition = Condition::kUnsignedGreaterThanEqual);
+  void JumpIfJSAnyIsPrimitive(Register heap_object, Register scratch,
+                              Label* target,
+                              Label::Distance distance = Label::kFar) {
+    return JumpIfJSAnyIsNotPrimitive(heap_object, scratch, target, distance,
+                                     Condition::kUnsignedLessThan);
+  }
   // ---------------------------------------------------------------------------
   // GC Support
 
@@ -1411,8 +1462,8 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   Operand ClearedValue() const;
 
   // Jump if the register contains a non-smi.
-  void JumpIfNotSmi(Register value, Label* not_smi_label);
-
+  void JumpIfNotSmi(Register value, Label* not_smi_label,
+                    Label::Distance dist = Label::kFar);
   // Abort execution if argument is not a Constructor, enabled via --debug-code.
   void AssertConstructor(Register object);
 
@@ -1452,7 +1503,6 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
  private:
   bool has_double_zero_reg_set_ = false;
   bool has_single_zero_reg_set_ = false;
-
   // Performs a truncating conversion of a floating point number as used by
   // the JS bitwise operations. See ECMA-262 9.5: ToInt32. Goes to 'done' if it
   // succeeds, otherwise falls through if result is saturated. On return
@@ -1561,6 +1611,22 @@ struct MoveCycleState {
   base::Optional<Register> scratch_reg;
 };
 
+inline MemOperand ExitFrameStackSlotOperand(int offset) {
+  static constexpr int kSPOffset = 1 * kSystemPointerSize;
+  return MemOperand(sp, kSPOffset + offset);
+}
+
+inline MemOperand ExitFrameCallerStackSlotOperand(int index) {
+  return MemOperand(fp, (ExitFrameConstants::kFixedSlotCountAboveFp + index) *
+                            kSystemPointerSize);
+}
+
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand);
+
 #define ACCESS_MASM(masm) masm->
 
 }  // namespace internal
diff --git a/deps/v8/src/codegen/riscv/register-riscv.h b/deps/v8/src/codegen/riscv/register-riscv.h
index 915ecf6a3a1cb1..85c1c5b75dd888 100644
--- a/deps/v8/src/codegen/riscv/register-riscv.h
+++ b/deps/v8/src/codegen/riscv/register-riscv.h
@@ -65,6 +65,7 @@ namespace internal {
   V(ft9)  V(ft10) V(ft11) V(fa0) V(fa1) V(fa2) V(fa3) V(fa4) V(fa5)  \
   V(fa6)  V(fa7)
 
+
 // Returns the number of padding slots needed for stack pointer alignment.
 constexpr int ArgumentPaddingSlots(int argument_count) {
   // No argument padding required.
@@ -253,6 +254,13 @@ VECTOR_REGISTERS(DECLARE_VECTOR_REGISTER)
 
 const VRegister no_msareg = VRegister::no_reg();
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 // Register aliases.
 // cp is assumed to be a callee saved register.
 constexpr Register kRootRegister = s6;
@@ -271,6 +279,11 @@ DEFINE_REGISTER_NAMES(FPURegister, DOUBLE_REGISTERS)
 DEFINE_REGISTER_NAMES(VRegister, VECTOR_REGISTERS)
 
 // Give alias names to registers for calling conventions.
+constexpr Register arg_reg_1 = a0;
+constexpr Register arg_reg_2 = a1;
+constexpr Register arg_reg_3 = a2;
+constexpr Register arg_reg_4 = a3;
+
 constexpr Register kReturnRegister0 = a0;
 constexpr Register kReturnRegister1 = a1;
 constexpr Register kReturnRegister2 = a2;
diff --git a/deps/v8/src/codegen/s390/assembler-s390-inl.h b/deps/v8/src/codegen/s390/assembler-s390-inl.h
index f9da5f713c8257..0a753f49d4a3c9 100644
--- a/deps/v8/src/codegen/s390/assembler-s390-inl.h
+++ b/deps/v8/src/codegen/s390/assembler-s390-inl.h
@@ -56,14 +56,14 @@ void RelocInfo::apply(intptr_t delta) {
     Memory<Address>(pc_) = target + delta;
   } else if (IsCodeTarget(rmode_)) {
     SixByteInstr instr =
-        Instruction::InstructionBits(reinterpret_cast<const byte*>(pc_));
+        Instruction::InstructionBits(reinterpret_cast<const uint8_t*>(pc_));
     int32_t dis = static_cast<int32_t>(instr & 0xFFFFFFFF) * 2  // halfwords
                   - static_cast<int32_t>(delta);
     instr >>= 32;  // Clear the 4-byte displacement field.
     instr <<= 32;
     instr |= static_cast<uint32_t>(dis / 2);
-    Instruction::SetInstructionBits<SixByteInstr>(reinterpret_cast<byte*>(pc_),
-                                                  instr);
+    Instruction::SetInstructionBits<SixByteInstr>(
+        reinterpret_cast<uint8_t*>(pc_), instr);
   } else {
     // mov sequence
     DCHECK(IsInternalReferenceEncoded(rmode_));
@@ -134,12 +134,12 @@ Tagged_t Assembler::target_compressed_address_at(Address pc,
 
 Handle<Object> Assembler::code_target_object_handle_at(Address pc) {
   SixByteInstr instr =
-      Instruction::InstructionBits(reinterpret_cast<const byte*>(pc));
+      Instruction::InstructionBits(reinterpret_cast<const uint8_t*>(pc));
   int index = instr & 0xFFFFFFFF;
   return GetCodeTarget(index);
 }
 
-HeapObject RelocInfo::target_object(PtrComprCageBase cage_base) {
+Tagged<HeapObject> RelocInfo::target_object(PtrComprCageBase cage_base) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
     return HeapObject::cast(Object(V8HeapCompressionScheme::DecompressTagged(
@@ -170,8 +170,7 @@ Handle<HeapObject> RelocInfo::target_object_handle(Assembler* origin) {
   }
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(Tagged<HeapObject> target,
                                   ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
@@ -184,9 +183,6 @@ void RelocInfo::set_target_object(Heap* heap, HeapObject target,
     Assembler::set_target_address_at(pc_, constant_pool_, target.ptr(),
                                      icache_flush_mode);
   }
-  if (!instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target, write_barrier_mode);
-  }
 }
 
 Address RelocInfo::target_external_reference() {
@@ -235,9 +231,10 @@ Operand::Operand(Register rm) : rm_(rm), rmode_(RelocInfo::NO_INFO) {}
 Address Assembler::target_address_at(Address pc, Address constant_pool) {
   // S390 Instruction!
   // We want to check for instructions generated by Asm::mov()
-  Opcode op1 = Instruction::S390OpcodeValue(reinterpret_cast<const byte*>(pc));
+  Opcode op1 =
+      Instruction::S390OpcodeValue(reinterpret_cast<const uint8_t*>(pc));
   SixByteInstr instr_1 =
-      Instruction::InstructionBits(reinterpret_cast<const byte*>(pc));
+      Instruction::InstructionBits(reinterpret_cast<const uint8_t*>(pc));
 
   if (BRASL == op1 || BRCL == op1) {
     int32_t dis = static_cast<int32_t>(instr_1 & 0xFFFFFFFF) * 2;
@@ -246,11 +243,11 @@ Address Assembler::target_address_at(Address pc, Address constant_pool) {
 
 #if V8_TARGET_ARCH_S390X
   int instr1_length =
-      Instruction::InstructionLength(reinterpret_cast<const byte*>(pc));
+      Instruction::InstructionLength(reinterpret_cast<const uint8_t*>(pc));
   Opcode op2 = Instruction::S390OpcodeValue(
-      reinterpret_cast<const byte*>(pc + instr1_length));
+      reinterpret_cast<const uint8_t*>(pc + instr1_length));
   SixByteInstr instr_2 = Instruction::InstructionBits(
-      reinterpret_cast<const byte*>(pc + instr1_length));
+      reinterpret_cast<const uint8_t*>(pc + instr1_length));
   // IIHF for hi_32, IILF for lo_32
   if (IIHF == op1 && IILF == op2) {
     return static_cast<Address>(((instr_1 & 0xFFFFFFFF) << 32) |
@@ -272,9 +269,9 @@ Address Assembler::target_address_at(Address pc, Address constant_pool) {
 // has already deserialized the mov instructions etc.
 // There is a FIXED_SEQUENCE assumption here
 void Assembler::deserialization_set_special_target_at(
-    Address instruction_payload, Code code, Address target) {
+    Address instruction_payload, Tagged<Code> code, Address target) {
   set_target_address_at(instruction_payload,
-                        !code.is_null() ? code.constant_pool() : kNullAddress,
+                        !code.is_null() ? code->constant_pool() : kNullAddress,
                         target);
 }
 
@@ -297,9 +294,10 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool,
                                       Address target,
                                       ICacheFlushMode icache_flush_mode) {
   // Check for instructions generated by Asm::mov()
-  Opcode op1 = Instruction::S390OpcodeValue(reinterpret_cast<const byte*>(pc));
+  Opcode op1 =
+      Instruction::S390OpcodeValue(reinterpret_cast<const uint8_t*>(pc));
   SixByteInstr instr_1 =
-      Instruction::InstructionBits(reinterpret_cast<const byte*>(pc));
+      Instruction::InstructionBits(reinterpret_cast<const uint8_t*>(pc));
   bool patched = false;
 
   if (BRASL == op1 || BRCL == op1) {
@@ -307,8 +305,8 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool,
     instr_1 <<= 32;
     int32_t halfwords = (target - pc) / 2;  // number of halfwords
     instr_1 |= static_cast<uint32_t>(halfwords);
-    Instruction::SetInstructionBits<SixByteInstr>(reinterpret_cast<byte*>(pc),
-                                                  instr_1);
+    Instruction::SetInstructionBits<SixByteInstr>(
+        reinterpret_cast<uint8_t*>(pc), instr_1);
     if (icache_flush_mode != SKIP_ICACHE_FLUSH) {
       FlushInstructionCache(pc, 6);
     }
@@ -316,11 +314,11 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool,
   } else {
 #if V8_TARGET_ARCH_S390X
     int instr1_length =
-        Instruction::InstructionLength(reinterpret_cast<const byte*>(pc));
+        Instruction::InstructionLength(reinterpret_cast<const uint8_t*>(pc));
     Opcode op2 = Instruction::S390OpcodeValue(
-        reinterpret_cast<const byte*>(pc + instr1_length));
+        reinterpret_cast<const uint8_t*>(pc + instr1_length));
     SixByteInstr instr_2 = Instruction::InstructionBits(
-        reinterpret_cast<const byte*>(pc + instr1_length));
+        reinterpret_cast<const uint8_t*>(pc + instr1_length));
     // IIHF for hi_32, IILF for lo_32
     if (IIHF == op1 && IILF == op2) {
       // IIHF
@@ -328,8 +326,8 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool,
       instr_1 <<= 32;
       instr_1 |= reinterpret_cast<uint64_t>(target) >> 32;
 
-      Instruction::SetInstructionBits<SixByteInstr>(reinterpret_cast<byte*>(pc),
-                                                    instr_1);
+      Instruction::SetInstructionBits<SixByteInstr>(
+          reinterpret_cast<uint8_t*>(pc), instr_1);
 
       // IILF
       instr_2 >>= 32;
@@ -337,7 +335,7 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool,
       instr_2 |= reinterpret_cast<uint64_t>(target) & 0xFFFFFFFF;
 
       Instruction::SetInstructionBits<SixByteInstr>(
-          reinterpret_cast<byte*>(pc + instr1_length), instr_2);
+          reinterpret_cast<uint8_t*>(pc + instr1_length), instr_2);
       if (icache_flush_mode != SKIP_ICACHE_FLUSH) {
         FlushInstructionCache(pc, 12);
       }
@@ -350,8 +348,8 @@ void Assembler::set_target_address_at(Address pc, Address constant_pool,
       instr_1 <<= 32;
       instr_1 |= reinterpret_cast<uint32_t>(target);
 
-      Instruction::SetInstructionBits<SixByteInstr>(reinterpret_cast<byte*>(pc),
-                                                    instr_1);
+      Instruction::SetInstructionBits<SixByteInstr>(
+          reinterpret_cast<uint8_t*>(pc), instr_1);
       if (icache_flush_mode != SKIP_ICACHE_FLUSH) {
         FlushInstructionCache(pc, 6);
       }
diff --git a/deps/v8/src/codegen/s390/assembler-s390.cc b/deps/v8/src/codegen/s390/assembler-s390.cc
index 91653d4dc64694..c78cb66865198c 100644
--- a/deps/v8/src/codegen/s390/assembler-s390.cc
+++ b/deps/v8/src/codegen/s390/assembler-s390.cc
@@ -338,7 +338,7 @@ MemOperand::MemOperand(Register rn, int32_t offset)
 MemOperand::MemOperand(Register rx, Register rb, int32_t offset)
     : baseRegister(rb), indexRegister(rx), offset_(offset) {}
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Address pc = reinterpret_cast<Address>(buffer_start_) + request.offset();
@@ -361,8 +361,11 @@ Assembler::Assembler(const AssemblerOptions& options,
   relocations_.reserve(128);
 }
 
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
-                        SafepointTableBuilder* safepoint_table_builder,
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
+}
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
+                        SafepointTableBuilderBase* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
   // raw workflow to create Code objects (mostly in tests), add another Align
@@ -753,7 +756,7 @@ void Assembler::GrowBuffer(int needed) {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   intptr_t pc_delta = new_start - buffer_start_;
@@ -781,32 +784,20 @@ void Assembler::db(uint8_t data) {
   pc_ += sizeof(uint8_t);
 }
 
-void Assembler::dd(uint32_t data, RelocInfo::Mode rmode) {
+void Assembler::dd(uint32_t data) {
   CheckBuffer();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uint32_t*>(pc_) = data;
   pc_ += sizeof(uint32_t);
 }
 
-void Assembler::dq(uint64_t value, RelocInfo::Mode rmode) {
+void Assembler::dq(uint64_t value) {
   CheckBuffer();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uint64_t*>(pc_) = value;
   pc_ += sizeof(uint64_t);
 }
 
-void Assembler::dp(uintptr_t data, RelocInfo::Mode rmode) {
+void Assembler::dp(uintptr_t data) {
   CheckBuffer();
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   *reinterpret_cast<uintptr_t*>(pc_) = data;
   pc_ += sizeof(uintptr_t);
 }
@@ -833,7 +824,7 @@ void Assembler::EmitRelocations() {
        it != relocations_.end(); it++) {
     RelocInfo::Mode rmode = it->rmode();
     Address pc = reinterpret_cast<Address>(buffer_start_) + it->position();
-    RelocInfo rinfo(pc, rmode, it->data(), Code(), InstructionStream());
+    RelocInfo rinfo(pc, rmode, it->data());
 
     // Fix up internal references now that they are guaranteed to be bound.
     if (RelocInfo::IsInternalReference(rmode)) {
@@ -852,19 +843,6 @@ void Assembler::EmitRelocations() {
   }
 }
 
-UseScratchRegisterScope::UseScratchRegisterScope(Assembler* assembler)
-    : assembler_(assembler),
-      old_available_(*assembler->GetScratchRegisterList()) {}
-
-UseScratchRegisterScope::~UseScratchRegisterScope() {
-  *assembler_->GetScratchRegisterList() = old_available_;
-}
-
-Register UseScratchRegisterScope::Acquire() {
-  RegList* available = assembler_->GetScratchRegisterList();
-  DCHECK_NOT_NULL(available);
-  return available->PopFirst();
-}
 }  // namespace internal
 }  // namespace v8
 #endif  // V8_TARGET_ARCH_S390
diff --git a/deps/v8/src/codegen/s390/assembler-s390.h b/deps/v8/src/codegen/s390/assembler-s390.h
index 62d9b36ac2a834..1434daa3ec1c3b 100644
--- a/deps/v8/src/codegen/s390/assembler-s390.h
+++ b/deps/v8/src/codegen/s390/assembler-s390.h
@@ -103,7 +103,7 @@ class V8_EXPORT_PRIVATE Operand {
     value_.immediate = static_cast<intptr_t>(f.address());
   }
   explicit Operand(Handle<HeapObject> handle);
-  V8_INLINE explicit Operand(Smi value) : rmode_(RelocInfo::NO_INFO) {
+  V8_INLINE explicit Operand(Tagged<Smi> value) : rmode_(RelocInfo::NO_INFO) {
     value_.immediate = static_cast<intptr_t>(value.ptr());
   }
 
@@ -230,13 +230,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   // GetCode emits any pending (non-emitted) code and fills the descriptor desc.
   static constexpr int kNoHandlerTable = 0;
-  static constexpr SafepointTableBuilder* kNoSafepointTable = nullptr;
-  void GetCode(Isolate* isolate, CodeDesc* desc,
-               SafepointTableBuilder* safepoint_table_builder,
+  static constexpr SafepointTableBuilderBase* kNoSafepointTable = nullptr;
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
+               SafepointTableBuilderBase* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -292,7 +294,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // This sets the branch destination.
   // This is for calls and branches within generated code.
   inline static void deserialization_set_special_target_at(
-      Address instruction_payload, Code code, Address target);
+      Address instruction_payload, Tagged<Code> code, Address target);
 
   // Get the size of the special target encoded at 'instruction_payload'.
   inline static int deserialization_special_target_size(
@@ -1311,9 +1313,9 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Writes a single byte or word of data in the code stream.  Used
   // for inline tables, e.g., jump-tables.
   void db(uint8_t data);
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
+  void dd(uint32_t data);
+  void dq(uint64_t data);
+  void dp(uintptr_t data);
 
   // Read/patch instructions
   SixByteInstr instr_at(int pos) {
@@ -1329,7 +1331,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
     return Instruction::InstructionLength(buffer_start_ + pos);
   }
 
-  static SixByteInstr instr_at(byte* pc) {
+  static SixByteInstr instr_at(uint8_t* pc) {
     return Instruction::InstructionBits(pc);
   }
 
@@ -1357,7 +1359,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void emit_label_addr(Label* label);
 
  public:
-  byte* buffer_pos() const { return buffer_start_; }
+  uint8_t* buffer_pos() const { return buffer_start_; }
 
   // InstructionStream generation
   // The relocation writer's position is at least kGap bytes below the end of
@@ -1465,7 +1467,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void bind_to(Label* L, int pos);
   void next(Label* L);
 
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
@@ -1482,10 +1484,17 @@ class EnsureSpace {
 
 class V8_EXPORT_PRIVATE V8_NODISCARD UseScratchRegisterScope {
  public:
-  explicit UseScratchRegisterScope(Assembler* assembler);
-  ~UseScratchRegisterScope();
+  explicit UseScratchRegisterScope(Assembler* assembler)
+      : assembler_(assembler),
+        old_available_(*assembler->GetScratchRegisterList()) {}
 
-  Register Acquire();
+  ~UseScratchRegisterScope() {
+    *assembler_->GetScratchRegisterList() = old_available_;
+  }
+
+  Register Acquire() {
+    return assembler_->GetScratchRegisterList()->PopFirst();
+  }
 
   // Check if we have registers available to acquire.
   bool CanAcquire() const {
diff --git a/deps/v8/src/codegen/s390/constants-s390.h b/deps/v8/src/codegen/s390/constants-s390.h
index 3de1a2f3728b81..1ad001c7dfaa55 100644
--- a/deps/v8/src/codegen/s390/constants-s390.h
+++ b/deps/v8/src/codegen/s390/constants-s390.h
@@ -1908,7 +1908,8 @@ class Instruction {
   // Get the raw instruction bits.
   template <typename T>
   inline T InstructionBits() const {
-    return Instruction::InstructionBits<T>(reinterpret_cast<const byte*>(this));
+    return Instruction::InstructionBits<T>(
+        reinterpret_cast<const uint8_t*>(this));
   }
   inline Instr InstructionBits() const {
     return *reinterpret_cast<const Instr*>(this);
@@ -1917,7 +1918,7 @@ class Instruction {
   // Set the raw instruction bits to value.
   template <typename T>
   inline void SetInstructionBits(T value) const {
-    Instruction::SetInstructionBits<T>(reinterpret_cast<const byte*>(this),
+    Instruction::SetInstructionBits<T>(reinterpret_cast<const uint8_t*>(this),
                                        value);
   }
   inline void SetInstructionBits(Instr value) {
@@ -1945,11 +1946,12 @@ class Instruction {
 
   // Determine the instruction length
   inline int InstructionLength() {
-    return Instruction::InstructionLength(reinterpret_cast<const byte*>(this));
+    return Instruction::InstructionLength(
+        reinterpret_cast<const uint8_t*>(this));
   }
   // Extract the Instruction Opcode
   inline Opcode S390OpcodeValue() {
-    return Instruction::S390OpcodeValue(reinterpret_cast<const byte*>(this));
+    return Instruction::S390OpcodeValue(reinterpret_cast<const uint8_t*>(this));
   }
 
   // Static support.
@@ -1968,12 +1970,12 @@ class Instruction {
   }
 
   // Determine the instruction length of the given instruction
-  static inline int InstructionLength(const byte* instr) {
+  static inline int InstructionLength(const uint8_t* instr) {
     // Length can be determined by the first nibble.
     // 0x0 to 0x3 => 2-bytes
     // 0x4 to 0xB => 4-bytes
     // 0xC to 0xF => 6-bytes
-    byte topNibble = (*instr >> 4) & 0xF;
+    uint8_t topNibble = (*instr >> 4) & 0xF;
     if (topNibble <= 3)
       return 2;
     else if (topNibble <= 0xB)
@@ -1982,7 +1984,7 @@ class Instruction {
   }
 
   // Returns the instruction bits of the given instruction
-  static inline uint64_t InstructionBits(const byte* instr) {
+  static inline uint64_t InstructionBits(const uint8_t* instr) {
     int length = InstructionLength(instr);
     if (2 == length)
       return static_cast<uint64_t>(InstructionBits<TwoByteInstr>(instr));
@@ -1994,7 +1996,7 @@ class Instruction {
 
   // Extract the raw instruction bits
   template <typename T>
-  static inline T InstructionBits(const byte* instr) {
+  static inline T InstructionBits(const uint8_t* instr) {
 #if !V8_TARGET_LITTLE_ENDIAN
     if (sizeof(T) <= 4) {
       return *reinterpret_cast<const T*>(instr);
@@ -2025,7 +2027,7 @@ class Instruction {
 
   // Set the Instruction Bits to value
   template <typename T>
-  static inline void SetInstructionBits(byte* instr, T value) {
+  static inline void SetInstructionBits(uint8_t* instr, T value) {
 #if V8_TARGET_LITTLE_ENDIAN
     // The instruction bits are stored in big endian format even on little
     // endian hosts, in order to decode instruction length and opcode.
@@ -2067,18 +2069,18 @@ class Instruction {
   }
 
   // Get Instruction Format Type
-  static OpcodeFormatType getOpcodeFormatType(const byte* instr) {
-    const byte firstByte = *instr;
+  static OpcodeFormatType getOpcodeFormatType(const uint8_t* instr) {
+    const uint8_t firstByte = *instr;
     return OpcodeFormatTable[firstByte];
   }
 
   // Extract the full opcode from the instruction.
-  static inline Opcode S390OpcodeValue(const byte* instr) {
+  static inline Opcode S390OpcodeValue(const uint8_t* instr) {
     OpcodeFormatType opcodeType = getOpcodeFormatType(instr);
 
     // The native instructions are encoded in big-endian format
     // even if running on little-endian host.  Hence, we need
-    // to ensure we use byte* based bit-wise logic.
+    // to ensure we use uint8_t* based bit-wise logic.
     switch (opcodeType) {
       case ONE_BYTE_OPCODE:
         // One Byte - Bits 0 to 7
@@ -2107,7 +2109,7 @@ class Instruction {
   // reference to an instruction is to convert a pointer. There is no way
   // to allocate or create instances of class Instruction.
   // Use the At(pc) function to create references to Instruction.
-  static Instruction* At(byte* pc) {
+  static Instruction* At(uint8_t* pc) {
     return reinterpret_cast<Instruction*>(pc);
   }
 
diff --git a/deps/v8/src/codegen/s390/interface-descriptors-s390-inl.h b/deps/v8/src/codegen/s390/interface-descriptors-s390-inl.h
index f2a406394bceaf..a2348c30686439 100644
--- a/deps/v8/src/codegen/s390/interface-descriptors-s390-inl.h
+++ b/deps/v8/src/codegen/s390/interface-descriptors-s390-inl.h
@@ -19,6 +19,23 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  auto registers = DoubleRegisterArray(d1, d2, d3, d4, d5, d6, d7);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Padding to have as many double return registers as GP return registers.
+  auto registers = DoubleRegisterArray(kFPReturnRegister0, no_dreg, no_dreg);
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -264,11 +281,35 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  return RegisterArray(r3,   // kApiFunctionAddress
-                       r4,   // kArgc
-                       r5,   // kCallData
-                       r2);  // kHolder
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return r3;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return r4;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return r5;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return r2;
+}
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return r4;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return r5;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return r2;
 }
 
 // static
@@ -306,6 +347,10 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray(r2, r3);
 }
 
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(r2);
+}
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/s390/macro-assembler-s390.cc b/deps/v8/src/codegen/s390/macro-assembler-s390.cc
index 4dcfb9b00475a6..e9237167087679 100644
--- a/deps/v8/src/codegen/s390/macro-assembler-s390.cc
+++ b/deps/v8/src/codegen/s390/macro-assembler-s390.cc
@@ -15,6 +15,7 @@
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/codegen/macro-assembler.h"
 #include "src/codegen/register-configuration.h"
+#include "src/codegen/register.h"
 #include "src/debug/debug.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/execution/frames-inl.h"
@@ -558,7 +559,7 @@ void MacroAssembler::Drop(Register count, Register scratch) {
 
 void MacroAssembler::TestCodeIsMarkedForDeoptimization(Register code,
                                                        Register scratch) {
-  LoadU16(scratch, FieldMemOperand(code, Code::kKindSpecificFlagsOffset));
+  LoadU32(scratch, FieldMemOperand(code, Code::kFlagsOffset));
   TestBit(scratch, Code::kMarkedForDeoptimizationBit, scratch);
 }
 
@@ -574,7 +575,7 @@ void MacroAssembler::Push(Handle<HeapObject> handle) {
   push(r0);
 }
 
-void MacroAssembler::Push(Smi smi) {
+void MacroAssembler::Push(Tagged<Smi> smi) {
   mov(r0, Operand(smi));
   push(r0);
 }
@@ -920,7 +921,7 @@ void MacroAssembler::DecompressTaggedSigned(Register destination,
 void MacroAssembler::DecompressTagged(Register destination, Register source) {
   RecordComment("[ DecompressTagged");
   llgfr(destination, source);
-  agr(destination, kRootRegister);
+  agr(destination, kPtrComprCageBaseRegister);
   RecordComment("]");
 }
 
@@ -928,7 +929,7 @@ void MacroAssembler::DecompressTagged(Register destination,
                                       MemOperand field_operand) {
   RecordComment("[ DecompressTagged");
   llgf(destination, field_operand);
-  agr(destination, kRootRegister);
+  agr(destination, kPtrComprCageBaseRegister);
   RecordComment("]");
 }
 
@@ -1532,7 +1533,8 @@ int MacroAssembler::LeaveFrame(StackFrame::Type type, int stack_adjustment) {
 void MacroAssembler::EnterExitFrame(int stack_space,
                                     StackFrame::Type frame_type) {
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
   // Set up the frame structure on the stack.
   DCHECK_EQ(2 * kSystemPointerSize, ExitFrameConstants::kCallerSPDisplacement);
   DCHECK_EQ(1 * kSystemPointerSize, ExitFrameConstants::kCallerPCOffset);
@@ -1745,7 +1747,7 @@ void MacroAssembler::CheckDebugHook(Register fun, Register new_target,
 
   {
     // Load receiver to pass it later to DebugOnFunctionCall hook.
-    LoadReceiver(r6, actual_parameter_count);
+    LoadReceiver(r6);
     FrameScope frame(
         this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
 
@@ -1797,14 +1799,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // We call indirectly through the code field in the function to
   // allow recompilation to take effect without changing any of the
   // call sites.
-  Register code = kJavaScriptCallCodeStartRegister;
-  LoadTaggedField(code, FieldMemOperand(function, JSFunction::kCodeOffset));
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(code);
+      CallJSFunction(function);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(code);
+      JumpJSFunction(function);
       break;
   }
   // Continue here if InvokePrologue does handle the invocation due to
@@ -1826,10 +1826,9 @@ void MacroAssembler::InvokeFunctionWithNewTarget(
   LoadTaggedField(cp, FieldMemOperand(fun, JSFunction::kContextOffset));
   LoadTaggedField(temp_reg,
                   FieldMemOperand(fun, JSFunction::kSharedFunctionInfoOffset));
-  LoadU16(
-      expected_reg,
-      FieldMemOperand(temp_reg,
-                      SharedFunctionInfo::kFormalParameterCountOffset));
+  LoadU16(expected_reg,
+          FieldMemOperand(temp_reg,
+                          SharedFunctionInfo::kFormalParameterCountOffset));
 
   InvokeFunctionCode(fun, new_target, expected_reg, actual_parameter_count,
                      type);
@@ -2020,7 +2019,7 @@ void TailCallOptimizedCodeSlot(MacroAssembler* masm,
   __ ReplaceClosureCodeWithOptimizedCode(optimized_code_entry, closure, scratch,
                                          r7);
   static_assert(kJavaScriptCallCodeStartRegister == r4, "ABI mismatch");
-  __ LoadCodeEntry(r4, optimized_code_entry);
+  __ LoadCodeInstructionStart(r4, optimized_code_entry);
   __ Jump(r4);
 
   // Optimized code slot contains deoptimized code or code is cleared and
@@ -2130,7 +2129,7 @@ void MacroAssembler::OptimizeCodeOrTailCallOptimizedCodeSlot(
   LoadTaggedField(optimized_code_entry,
                   FieldMemOperand(feedback_vector,
                                   FeedbackVector::kMaybeOptimizedCodeOffset));
-  TailCallOptimizedCodeSlot(this, optimized_code_entry, r8);
+  TailCallOptimizedCodeSlot(this, optimized_code_entry, r1);
 }
 
 void MacroAssembler::CallRuntime(const Runtime::Function* f,
@@ -2384,6 +2383,47 @@ void MacroAssembler::AssertUndefinedOrAllocationSite(Register object,
     bind(&done_checking);
   }
 }
+
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 Register tmp, AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp, tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok);
+
+  LoadMap(map_tmp, object);
+  CompareInstanceType(map_tmp, tmp, LAST_NAME_TYPE);
+  ble(&ok);
+
+  CompareInstanceType(map_tmp, tmp, FIRST_JS_RECEIVER_TYPE);
+  bge(&ok);
+
+  CompareRoot(map_tmp, RootIndex::kHeapNumberMap);
+  beq(&ok);
+
+  CompareRoot(map_tmp, RootIndex::kBigIntMap);
+  beq(&ok);
+
+  CompareRoot(object, RootIndex::kUndefinedValue);
+  beq(&ok);
+
+  CompareRoot(object, RootIndex::kTrueValue);
+  beq(&ok);
+
+  CompareRoot(object, RootIndex::kFalseValue);
+  beq(&ok);
+
+  CompareRoot(object, RootIndex::kNullValue);
+  beq(&ok);
+
+  Abort(abort_reason);
+
+  bind(&ok);
+}
+
 #endif  // V8_ENABLE_DEBUG_CODE
 
 static const int kRegisterPassedArguments = 5;
@@ -2695,7 +2735,7 @@ void MacroAssembler::MulHighS32(Register dst, Register src1,
   {                                \
     lr(r1, src1);                  \
     instr(r0, src2);               \
-    LoadU32(dst, r0);               \
+    LoadU32(dst, r0);              \
   }
 
 void MacroAssembler::MulHighU32(Register dst, Register src1,
@@ -2751,7 +2791,7 @@ void MacroAssembler::Mul32WithOverflowIfCCUnequal(Register dst, Register src1,
   {                           \
     lgfr(r1, src1);           \
     instr(r0, src2);          \
-    LoadU32(dst, r1);          \
+    LoadU32(dst, r1);         \
   }
 
 void MacroAssembler::DivS32(Register dst, Register src1,
@@ -2770,7 +2810,7 @@ void MacroAssembler::DivS32(Register dst, Register src1, Register src2) {
     lr(r0, src1);              \
     srdl(r0, Operand(32));     \
     instr(r0, src2);           \
-    LoadU32(dst, r1);           \
+    LoadU32(dst, r1);          \
   }
 
 void MacroAssembler::DivU32(Register dst, Register src1,
@@ -2825,7 +2865,7 @@ void MacroAssembler::DivU64(Register dst, Register src1, Register src2) {
   {                           \
     lgfr(r1, src1);           \
     instr(r0, src2);          \
-    LoadU32(dst, r0);          \
+    LoadU32(dst, r0);         \
   }
 
 void MacroAssembler::ModS32(Register dst, Register src1,
@@ -2844,7 +2884,7 @@ void MacroAssembler::ModS32(Register dst, Register src1, Register src2) {
     lr(r0, src1);              \
     srdl(r0, Operand(32));     \
     instr(r0, src2);           \
-    LoadU32(dst, r0);           \
+    LoadU32(dst, r0);          \
   }
 
 void MacroAssembler::ModU32(Register dst, Register src1,
@@ -4922,26 +4962,28 @@ void MacroAssembler::JumpIfLessThan(Register x, int32_t y, Label* dest) {
   blt(dest);
 }
 
-void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index) {
+void MacroAssembler::LoadEntryFromBuiltinIndex(Register builtin_index,
+                                               Register target) {
   static_assert(kSystemPointerSize == 8);
   static_assert(kSmiTagSize == 1);
   static_assert(kSmiTag == 0);
   // The builtin_index register contains the builtin index as a Smi.
   if (SmiValuesAre32Bits()) {
-    ShiftRightS64(builtin_index, builtin_index,
+    ShiftRightS64(target, builtin_index,
                   Operand(kSmiShift - kSystemPointerSizeLog2));
   } else {
     DCHECK(SmiValuesAre31Bits());
-    ShiftLeftU64(builtin_index, builtin_index,
+    ShiftLeftU64(target, builtin_index,
                  Operand(kSystemPointerSizeLog2 - kSmiShift));
   }
-  LoadU64(builtin_index, MemOperand(kRootRegister, builtin_index,
-                                    IsolateData::builtin_entry_table_offset()));
+  LoadU64(target, MemOperand(kRootRegister, target,
+                             IsolateData::builtin_entry_table_offset()));
 }
 
-void MacroAssembler::CallBuiltinByIndex(Register builtin_index) {
-  LoadEntryFromBuiltinIndex(builtin_index);
-  Call(builtin_index);
+void MacroAssembler::CallBuiltinByIndex(Register builtin_index,
+                                        Register target) {
+  LoadEntryFromBuiltinIndex(builtin_index, target);
+  Call(target);
 }
 
 void MacroAssembler::LoadEntryFromBuiltin(Builtin builtin,
@@ -4957,25 +4999,41 @@ MemOperand MacroAssembler::EntryFromBuiltinAsOperand(Builtin builtin) {
                     IsolateData::BuiltinEntrySlotOffset(builtin));
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination, Register code_object) {
+void MacroAssembler::LoadCodeInstructionStart(Register destination,
+                                              Register code_object) {
   ASM_CODE_COMMENT(this);
   LoadU64(destination,
-          FieldMemOperand(code_object, Code::kCodeEntryPointOffset));
+          FieldMemOperand(code_object, Code::kInstructionStartOffset));
 }
 
 void MacroAssembler::CallCodeObject(Register code_object) {
   ASM_CODE_COMMENT(this);
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   Call(code_object);
 }
 
 void MacroAssembler::JumpCodeObject(Register code_object, JumpMode jump_mode) {
   ASM_CODE_COMMENT(this);
   DCHECK_EQ(JumpMode::kJump, jump_mode);
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   Jump(code_object);
 }
 
+void MacroAssembler::CallJSFunction(Register function_object) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  LoadTaggedField(code,
+                  FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  CallCodeObject(code);
+}
+
+void MacroAssembler::JumpJSFunction(Register function_object,
+                                    JumpMode jump_mode) {
+  Register code = kJavaScriptCallCodeStartRegister;
+  LoadTaggedField(code,
+                  FieldMemOperand(function_object, JSFunction::kCodeOffset));
+  JumpCodeObject(code, jump_mode);
+}
+
 void MacroAssembler::StoreReturnAddressAndCall(Register target) {
   // This generates the final instruction sequence for calls to C functions
   // once an exit frame has been constructed.
@@ -6057,10 +6115,16 @@ void MacroAssembler::I32x4ExtAddPairwiseI16x8S(Simd128Register dst,
 
 void MacroAssembler::I32x4ExtAddPairwiseI16x8U(Simd128Register dst,
                                                Simd128Register src,
-                                               Simd128Register scratch,
-                                               Simd128Register scratch2) {
-  vx(scratch, scratch, scratch, Condition(0), Condition(0), Condition(3));
-  vsum(dst, src, scratch, Condition(0), Condition(0), Condition(1));
+                                               Simd128Register /* scratch1 */,
+                                               Simd128Register /* scratch2 */) {
+  // Unnamed scratch parameters are still kept to make this function
+  // have the same signature as the other ExtAddPairwise functions.
+  // TF and Liftoff use a uniform Macro for all of them.
+  // TODO(miladfarca): Add a default argument or separate them in TF and
+  // Liftoff.
+  vx(kDoubleRegZero, kDoubleRegZero, kDoubleRegZero, Condition(0), Condition(0),
+     Condition(3));
+  vsum(dst, src, kDoubleRegZero, Condition(0), Condition(0), Condition(1));
 }
 
 void MacroAssembler::I16x8ExtAddPairwiseI8x16S(Simd128Register dst,
@@ -6082,8 +6146,7 @@ void MacroAssembler::I32x4TruncSatF64x2SZero(Simd128Register dst,
                                              Simd128Register src,
                                              Simd128Register scratch) {
   // NaN to 0.
-  vlr(scratch, src, Condition(0), Condition(0), Condition(0));
-  vfce(scratch, scratch, scratch, Condition(0), Condition(0), Condition(3));
+  vfce(scratch, src, src, Condition(0), Condition(0), Condition(3));
   vn(scratch, src, scratch, Condition(0), Condition(0), Condition(0));
   vcgd(scratch, scratch, Condition(5), Condition(0), Condition(3));
   vx(dst, dst, dst, Condition(0), Condition(0), Condition(2));
@@ -6107,22 +6170,21 @@ void MacroAssembler::S128Const(Simd128Register dst, uint64_t high, uint64_t low,
 
 void MacroAssembler::I8x16Swizzle(Simd128Register dst, Simd128Register src1,
                                   Simd128Register src2, Register scratch1,
-                                  Register scratch2, Simd128Register scratch3,
-                                  Simd128Register scratch4) {
-  DCHECK(!AreAliased(src1, src2, scratch3, scratch4));
+                                  Register scratch2, Simd128Register scratch3) {
+  DCHECK(!AreAliased(src1, src2, scratch3));
   // Saturate the indices to 5 bits. Input indices more than 31 should
   // return 0.
   vrepi(scratch3, Operand(31), Condition(0));
-  vmnl(scratch4, src2, scratch3, Condition(0), Condition(0), Condition(0));
+  vmnl(scratch3, src2, scratch3, Condition(0), Condition(0), Condition(0));
   // Input needs to be reversed.
   vlgv(scratch1, src1, MemOperand(r0, 0), Condition(3));
   vlgv(scratch2, src1, MemOperand(r0, 1), Condition(3));
   lrvgr(scratch1, scratch1);
   lrvgr(scratch2, scratch2);
   vlvgp(dst, scratch2, scratch1);
-  // Clear scratch.
-  vx(scratch3, scratch3, scratch3, Condition(0), Condition(0), Condition(0));
-  vperm(dst, dst, scratch3, scratch4, Condition(0), Condition(0));
+  vx(kDoubleRegZero, kDoubleRegZero, kDoubleRegZero, Condition(0), Condition(0),
+     Condition(0));
+  vperm(dst, dst, kDoubleRegZero, scratch3, Condition(0), Condition(0));
 }
 
 void MacroAssembler::I8x16Shuffle(Simd128Register dst, Simd128Register src1,
@@ -6326,6 +6388,173 @@ void MacroAssembler::LoadStackLimit(Register destination, StackLimitKind kind) {
   LoadU64(destination, MemOperand(kRootRegister, offset));
 }
 
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand) {
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  Register return_value = r2;
+  Register scratch = ip;
+  Register scratch2 = r1;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = r6;
+  Register prev_limit_reg = r7;
+  Register prev_level_reg = r8;
+
+  // C arguments (arg_reg_1/2) are expected to be initialized outside, so this
+  // function must not corrupt them (return_value overlaps with arg_reg_1 but
+  // that's ok because we start using it only after the C call).
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2,  // C args
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, scratch2, prev_next_address_reg, prev_limit_reg));
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ LoadU64(prev_next_address_reg, next_mem_op);
+    __ LoadU64(prev_limit_reg, limit_mem_op);
+    __ LoadU32(prev_level_reg, level_mem_op);
+    __ AddS64(scratch, prev_level_reg, Operand(1));
+    __ StoreU32(scratch, level_mem_op);
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ LoadU8(scratch, __ ExternalReferenceAsOperand(
+                           ER::execution_mode_address(isolate), no_reg));
+    __ CmpS64(scratch, Operand::Zero());
+    __ bne(&profiler_or_side_effects_check_enabled, Label::kNear);
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ Move(scratch, ER::address_of_runtime_stats_flag());
+    __ LoadU32(scratch, MemOperand(scratch, 0));
+    __ CmpS64(scratch, Operand::Zero());
+    __ bne(&profiler_or_side_effects_check_enabled, Label::kNear);
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ StoreReturnAddressAndCall(function_address);
+  __ bind(&done_api_call);
+
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  __ RecordComment("Load the value from ReturnValue");
+  __ LoadU64(r2, return_value_operand);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ StoreU64(prev_next_address_reg, next_mem_op);
+    if (v8_flags.debug_code) {
+      __ LoadU32(scratch, level_mem_op);
+      __ SubS64(scratch, Operand(1));
+      __ CmpS64(scratch, prev_level_reg);
+      __ Check(eq, AbortReason::kUnexpectedLevelAfterReturnFromApiCall);
+    }
+    __ StoreU32(prev_level_reg, level_mem_op);
+    __ CmpS64(prev_limit_reg, limit_mem_op);
+    __ bne(&delete_allocated_handles, Label::kNear);
+  }
+
+  __ RecordComment("Leave the API exit frame.");
+  __ bind(&leave_exit_frame);
+  // LeaveExitFrame expects unwind space to be in a register.
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand == nullptr) {
+    DCHECK_NE(stack_space, 0);
+    __ mov(stack_space_reg, Operand(stack_space));
+  } else {
+    DCHECK_EQ(stack_space, 0);
+    __ LoadU64(stack_space_reg, *stack_space_operand);
+  }
+  __ LeaveExitFrame(stack_space_reg, stack_space_operand != nullptr);
+
+  // Check if the function scheduled an exception.
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ LoadU64(scratch2, __ ExternalReferenceAsOperand(
+                             ER::scheduled_exception_address(isolate), no_reg));
+    __ CompareRoot(scratch2, RootIndex::kTheHoleValue);
+    __ bne(&promote_scheduled_exception, Label::kNear);
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ CompareRoot(return_value, RootIndex::kTheHoleValue);
+    __ bne(&finish_return);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch, scratch2,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  __ b(r14);
+
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via thunk wrapper.");
+    __ bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback function.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ StoreU64(thunk_arg, thunk_arg_mem_op);
+    __ Move(scratch, thunk_ref);
+    __ StoreReturnAddressAndCall(scratch);
+    __ b(&done_api_call);
+  }
+
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+
+  // HandleScope limit has changed. Delete allocated extensions.
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ bind(&delete_allocated_handles);
+    __ StoreU64(prev_limit_reg, limit_mem_op);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ mov(saved_result, return_value);
+    __ PrepareCallCFunction(1, scratch);
+    __ Move(arg_reg_1, ER::isolate_address(isolate));
+    __ CallCFunction(ER::delete_handle_scope_extensions(), 1);
+    __ mov(return_value, saved_result);
+    __ b(&leave_exit_frame, Label::kNear);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/s390/macro-assembler-s390.h b/deps/v8/src/codegen/s390/macro-assembler-s390.h
index 06edec65162ca4..fe6f2017ad7bd8 100644
--- a/deps/v8/src/codegen/s390/macro-assembler-s390.h
+++ b/deps/v8/src/codegen/s390/macro-assembler-s390.h
@@ -13,6 +13,8 @@
 #include "src/codegen/bailout-reason.h"
 #include "src/codegen/s390/assembler-s390.h"
 #include "src/common/globals.h"
+#include "src/execution/frame-constants.h"
+#include "src/execution/isolate-data.h"
 #include "src/objects/contexts.h"
 
 namespace v8 {
@@ -131,22 +133,21 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   void Call(Label* target);
 
-  // Load the builtin given by the Smi in |builtin_index| into the same
-  // register.
-  void LoadEntryFromBuiltinIndex(Register builtin_index);
+  // Load the builtin given by the Smi in |builtin_index| into |target|.
+  void LoadEntryFromBuiltinIndex(Register builtin_index, Register target);
   void LoadEntryFromBuiltin(Builtin builtin, Register destination);
   MemOperand EntryFromBuiltinAsOperand(Builtin builtin);
 
   // Load the code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_object);
+  void LoadCodeInstructionStart(Register destination, Register code_object);
   void CallCodeObject(Register code_object);
   void JumpCodeObject(Register code_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
-  void CallBuiltinByIndex(Register builtin_index);
+  void CallBuiltinByIndex(Register builtin_index, Register target);
 
   // Register move. May do nothing if the registers are identical.
-  void Move(Register dst, Smi smi) { LoadSmiLiteral(dst, smi); }
+  void Move(Register dst, Tagged<Smi> smi) { LoadSmiLiteral(dst, smi); }
   void Move(Register dst, Handle<HeapObject> source,
             RelocInfo::Mode rmode = RelocInfo::FULL_EMBEDDED_OBJECT);
   void Move(Register dst, ExternalReference reference);
@@ -626,7 +627,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
 
   // Push a handle.
   void Push(Handle<HeapObject> handle);
-  void Push(Smi smi);
+  void Push(Tagged<Smi> smi);
 
   // Push two registers.  Pushes leftmost register first (to highest address).
   void Push(Register src1, Register src2) {
@@ -731,6 +732,10 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void InitializeRootRegister() {
     ExternalReference isolate_root = ExternalReference::isolate_root(isolate());
     mov(kRootRegister, Operand(isolate_root));
+#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
+    LoadRootRelative(kPtrComprCageBaseRegister,
+                     IsolateData::cage_base_offset());
+#endif
   }
 
   // If the value is a NaN, canonicalize the value else, do nothing.
@@ -1126,6 +1131,11 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   // Define an exception handler and bind a label.
   void BindExceptionHandler(Label* label) { bind(label); }
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object);
+  void JumpJSFunction(Register function_object,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   // Generates an instruction sequence s.t. the return address points to the
   // instruction following the call.
   // The return address on the stack is used by frame iteration.
@@ -1214,7 +1224,7 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
                                Simd128Register scratch);
   void I8x16Swizzle(Simd128Register dst, Simd128Register src1,
                     Simd128Register src2, Register scratch1, Register scratch2,
-                    Simd128Register scratch3, Simd128Register scratch4);
+                    Simd128Register scratch3);
   void S128Const(Simd128Register dst, uint64_t high, uint64_t low,
                  Register scratch1, Register scratch2);
   void I8x16Shuffle(Simd128Register dst, Simd128Register src1,
@@ -1505,17 +1515,10 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
                              Register scratch_pair = r0);
 
   void LoadStackLimit(Register destination, StackLimitKind kind);
-  // It assumes that the arguments are located below the stack pointer.
-  // argc is the number of arguments not including the receiver.
-  // TODO(victorgomes): Remove this function once we stick with the reversed
-  // arguments order.
-  void LoadReceiver(Register dest, Register argc) {
-    LoadU64(dest, MemOperand(sp, 0));
-  }
 
-  void StoreReceiver(Register rec, Register argc, Register scratch) {
-    StoreU64(rec, MemOperand(sp, 0));
-  }
+  // It assumes that the arguments are located below the stack pointer.
+  void LoadReceiver(Register dest) { LoadU64(dest, MemOperand(sp, 0)); }
+  void StoreReceiver(Register rec) { StoreU64(rec, MemOperand(sp, 0)); }
 
   void CallRuntime(const Runtime::Function* f, int num_arguments);
 
@@ -1731,6 +1734,9 @@ class V8_EXPORT_PRIVATE MacroAssembler : public MacroAssemblerBase {
   void AssertUndefinedOrAllocationSite(Register object,
                                        Register scratch) NOOP_UNLESS_DEBUG_CODE;
 
+  void AssertJSAny(Register object, Register map_tmp, Register tmp,
+                   AbortReason abort_reason) NOOP_UNLESS_DEBUG_CODE;
+
   template <typename Field>
   void DecodeField(Register dst, Register src) {
     ExtractBitRange(dst, src, Field::kShift + Field::kSize - 1, Field::kShift);
@@ -1808,6 +1814,34 @@ struct MoveCycleState {
   bool pending_double_scratch_register_use = false;
 };
 
+// Provides access to exit frame parameters (GC-ed).
+inline MemOperand ExitFrameStackSlotOperand(int offset) {
+  // The slot at [sp] is reserved in all ExitFrames for storing the return
+  // address before doing the actual call, it's necessary for frame iteration
+  // (see StoreReturnAddressAndCall for details).
+  static constexpr int kSPOffset = 1 * kSystemPointerSize;
+  return MemOperand(sp, (kStackFrameExtraParamSlot * kSystemPointerSize) +
+                            offset + kSPOffset);
+}
+
+// Provides access to exit frame stack space (not GC-ed).
+inline MemOperand ExitFrameCallerStackSlotOperand(int index) {
+  return MemOperand(
+      fp, (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
+              kSystemPointerSize);
+}
+
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, MemOperand* stack_space_operand,
+                              MemOperand return_value_operand);
+
 #define ACCESS_MASM(masm) masm->
 
 }  // namespace internal
diff --git a/deps/v8/src/codegen/s390/register-s390.h b/deps/v8/src/codegen/s390/register-s390.h
index fc66830f0e6b96..ed3784f2bd3aae 100644
--- a/deps/v8/src/codegen/s390/register-s390.h
+++ b/deps/v8/src/codegen/s390/register-s390.h
@@ -15,9 +15,19 @@ namespace internal {
   V(r0)  V(r1)  V(r2)  V(r3)  V(r4)  V(r5)  V(r6)  V(r7)  \
   V(r8)  V(r9)  V(r10) V(fp) V(ip) V(r13) V(r14) V(sp)
 
-#define ALLOCATABLE_GENERAL_REGISTERS(V)                  \
+#define ALWAYS_ALLOCATABLE_GENERAL_REGISTERS(V)                  \
   V(r2)  V(r3)  V(r4)  V(r5)  V(r6)  V(r7)                \
-  V(r8)  V(r9)  V(r13)
+  V(r8)  V(r13)
+
+#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
+#define MAYBE_ALLOCATABLE_GENERAL_REGISTERS(V)
+#else
+#define MAYBE_ALLOCATABLE_GENERAL_REGISTERS(V) V(r9)
+#endif
+
+#define ALLOCATABLE_GENERAL_REGISTERS(V)  \
+  ALWAYS_ALLOCATABLE_GENERAL_REGISTERS(V) \
+  MAYBE_ALLOCATABLE_GENERAL_REGISTERS(V)
 
 #define DOUBLE_REGISTERS(V)                               \
   V(d0)  V(d1)  V(d2)  V(d3)  V(d4)  V(d5)  V(d6)  V(d7)  \
@@ -106,6 +116,13 @@ ASSERT_TRIVIALLY_COPYABLE(Register);
 static_assert(sizeof(Register) <= sizeof(int),
               "Register can efficiently be passed by value");
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 #define DEFINE_REGISTER(R) \
   constexpr Register R = Register::from_code(kRegCode_##R);
 GENERAL_REGISTERS(DEFINE_REGISTER)
@@ -114,8 +131,19 @@ constexpr Register no_reg = Register::no_reg();
 
 // Register aliases
 constexpr Register kRootRegister = r10;  // Roots array pointer.
+#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
+constexpr Register kPtrComprCageBaseRegister = r9;  // callee save
+#else
+constexpr Register kPtrComprCageBaseRegister = kRootRegister;
+#endif
 constexpr Register cp = r13;             // JavaScript context pointer.
 
+// s390x calling convention
+constexpr Register arg_reg_1 = r2;
+constexpr Register arg_reg_2 = r3;
+constexpr Register arg_reg_3 = r4;
+constexpr Register arg_reg_4 = r5;
+
 // Returns the number of padding slots needed for stack pointer alignment.
 constexpr int ArgumentPaddingSlots(int argument_count) {
   // No argument padding required.
diff --git a/deps/v8/src/codegen/safepoint-table.cc b/deps/v8/src/codegen/safepoint-table.cc
index b1ae0d8a7ebe8f..a3dda0f23305ea 100644
--- a/deps/v8/src/codegen/safepoint-table.cc
+++ b/deps/v8/src/codegen/safepoint-table.cc
@@ -20,13 +20,14 @@
 namespace v8 {
 namespace internal {
 
-SafepointTable::SafepointTable(Isolate* isolate, Address pc, Code code)
-    : SafepointTable(code.InstructionStart(isolate, pc),
-                     code.SafepointTableAddress()) {}
+SafepointTable::SafepointTable(Isolate* isolate, Address pc, Tagged<Code> code)
+    : SafepointTable(code->InstructionStart(isolate, pc),
+                     code->safepoint_table_address()) {}
 
-SafepointTable::SafepointTable(Isolate* isolate, Address pc, GcSafeCode code)
-    : SafepointTable(code.InstructionStart(isolate, pc),
-                     code.SafepointTableAddress()) {}
+SafepointTable::SafepointTable(Isolate* isolate, Address pc,
+                               Tagged<GcSafeCode> code)
+    : SafepointTable(code->InstructionStart(isolate, pc),
+                     code->safepoint_table_address()) {}
 
 #if V8_ENABLE_WEBASSEMBLY
 SafepointTable::SafepointTable(const wasm::WasmCode* code)
@@ -78,8 +79,8 @@ SafepointEntry SafepointTable::FindEntry(Address pc) const {
 }
 
 // static
-SafepointEntry SafepointTable::FindEntry(Isolate* isolate, GcSafeCode code,
-                                         Address pc) {
+SafepointEntry SafepointTable::FindEntry(Isolate* isolate,
+                                         Tagged<GcSafeCode> code, Address pc) {
   SafepointTable table(isolate, pc, code);
   return table.FindEntry(pc);
 }
diff --git a/deps/v8/src/codegen/safepoint-table.h b/deps/v8/src/codegen/safepoint-table.h
index 3676ae1c117def..0db461f2f1304d 100644
--- a/deps/v8/src/codegen/safepoint-table.h
+++ b/deps/v8/src/codegen/safepoint-table.h
@@ -62,8 +62,9 @@ class SafepointTable {
  public:
   // The isolate and pc arguments are used for figuring out whether pc
   // belongs to the embedded or un-embedded code blob.
-  explicit SafepointTable(Isolate* isolate, Address pc, InstructionStream code);
-  explicit SafepointTable(Isolate* isolate, Address pc, Code code);
+  explicit SafepointTable(Isolate* isolate, Address pc,
+                          Tagged<InstructionStream> code);
+  explicit SafepointTable(Isolate* isolate, Address pc, Tagged<Code> code);
 #if V8_ENABLE_WEBASSEMBLY
   explicit SafepointTable(const wasm::WasmCode* code);
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -115,13 +116,13 @@ class SafepointTable {
 
   // Returns the entry for the given pc.
   SafepointEntry FindEntry(Address pc) const;
-  static SafepointEntry FindEntry(Isolate* isolate, GcSafeCode code,
+  static SafepointEntry FindEntry(Isolate* isolate, Tagged<GcSafeCode> code,
                                   Address pc);
 
   void Print(std::ostream&) const;
 
  private:
-  SafepointTable(Isolate* isolate, Address pc, GcSafeCode code);
+  SafepointTable(Isolate* isolate, Address pc, Tagged<GcSafeCode> code);
 
   // Layout information.
   static constexpr int kLengthOffset = 0;
diff --git a/deps/v8/src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.cc b/deps/v8/src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.cc
index fb7fb8d5823db3..3e4997efc039a6 100644
--- a/deps/v8/src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.cc
+++ b/deps/v8/src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.cc
@@ -224,7 +224,7 @@ void SharedMacroAssemblerBase::F32x4Min(XMMRegister dst, XMMRegister lhs,
   // Canonicalize NaNs by quieting and clearing the payload.
   Cmpunordps(dst, dst, scratch);
   Orps(scratch, dst);
-  Psrld(dst, dst, byte{10});
+  Psrld(dst, dst, uint8_t{10});
   Andnps(dst, dst, scratch);
 }
 
@@ -256,7 +256,7 @@ void SharedMacroAssemblerBase::F32x4Max(XMMRegister dst, XMMRegister lhs,
   Subps(scratch, scratch, dst);
   // Canonicalize NaNs by clearing the payload. Sign is non-deterministic.
   Cmpunordps(dst, dst, scratch);
-  Psrld(dst, dst, byte{10});
+  Psrld(dst, dst, uint8_t{10});
   Andnps(dst, dst, scratch);
 }
 
@@ -274,7 +274,7 @@ void SharedMacroAssemblerBase::F64x2Min(XMMRegister dst, XMMRegister lhs,
     // Canonicalize NaNs by quieting and clearing the payload.
     vcmpunordpd(dst, dst, scratch);
     vorpd(scratch, scratch, dst);
-    vpsrlq(dst, dst, byte{13});
+    vpsrlq(dst, dst, uint8_t{13});
     vandnpd(dst, dst, scratch);
   } else {
     // Compare lhs with rhs, and rhs with lhs, and have the results in scratch
@@ -293,7 +293,7 @@ void SharedMacroAssemblerBase::F64x2Min(XMMRegister dst, XMMRegister lhs,
     orpd(scratch, dst);
     cmpunordpd(dst, scratch);
     orpd(scratch, dst);
-    psrlq(dst, byte{13});
+    psrlq(dst, uint8_t{13});
     andnpd(dst, scratch);
   }
 }
@@ -315,7 +315,7 @@ void SharedMacroAssemblerBase::F64x2Max(XMMRegister dst, XMMRegister lhs,
     vsubpd(scratch, scratch, dst);
     // Canonicalize NaNs by clearing the payload. Sign is non-deterministic.
     vcmpunordpd(dst, dst, scratch);
-    vpsrlq(dst, dst, byte{13});
+    vpsrlq(dst, dst, uint8_t{13});
     vandnpd(dst, dst, scratch);
   } else {
     if (dst == lhs || dst == rhs) {
@@ -333,7 +333,7 @@ void SharedMacroAssemblerBase::F64x2Max(XMMRegister dst, XMMRegister lhs,
     orpd(scratch, dst);
     subpd(scratch, dst);
     cmpunordpd(dst, scratch);
-    psrlq(dst, byte{13});
+    psrlq(dst, uint8_t{13});
     andnpd(dst, scratch);
   }
 }
@@ -436,7 +436,7 @@ void SharedMacroAssemblerBase::I8x16Shl(XMMRegister dst, XMMRegister src1,
   }
 
   uint8_t shift = truncate_to_int3(src2);
-  Psllw(dst, src1, byte{shift});
+  Psllw(dst, src1, uint8_t{shift});
 
   uint8_t bmask = static_cast<uint8_t>(0xff << shift);
   uint32_t mask = bmask << 24 | bmask << 16 | bmask << 8 | bmask;
@@ -526,7 +526,7 @@ void SharedMacroAssemblerBase::I8x16ShrU(XMMRegister dst, XMMRegister src1,
   uint32_t mask = bmask << 24 | bmask << 16 | bmask << 8 | bmask;
   Move(tmp1, mask);
   Movd(tmp2, tmp1);
-  Pshufd(tmp2, tmp2, byte{0});
+  Pshufd(tmp2, tmp2, uint8_t{0});
   Pand(dst, tmp2);
 }
 
@@ -723,7 +723,7 @@ void SharedMacroAssemblerBase::I16x8Q15MulRSatS(XMMRegister dst,
   ASM_CODE_COMMENT(this);
   // k = i16x8.splat(0x8000)
   Pcmpeqd(scratch, scratch);
-  Psllw(scratch, scratch, byte{15});
+  Psllw(scratch, scratch, uint8_t{15});
 
   if (!CpuFeatures::IsSupported(AVX) && (dst != src1)) {
     movaps(dst, src1);
@@ -756,7 +756,7 @@ void SharedMacroAssemblerBase::I32x4DotI8x16I7x16AddS(
   ASM_CODE_COMMENT(this);
   // k = i16x8.splat(1)
   Pcmpeqd(splat_reg, splat_reg);
-  Psrlw(splat_reg, splat_reg, byte{15});
+  Psrlw(splat_reg, splat_reg, uint8_t{15});
 
   if (CpuFeatures::IsSupported(AVX)) {
     CpuFeatureScope avx_scope(this, AVX);
@@ -802,14 +802,14 @@ void SharedMacroAssemblerBase::I32x4ExtAddPairwiseI16x8U(XMMRegister dst,
     // src = |a|b|c|d|e|f|g|h|
     // tmp = i32x4.splat(0x0000FFFF)
     pcmpeqd(tmp, tmp);
-    psrld(tmp, byte{16});
+    psrld(tmp, uint8_t{16});
     // tmp =|0|b|0|d|0|f|0|h|
     andps(tmp, src);
     // dst = |0|a|0|c|0|e|0|g|
     if (dst != src) {
       movaps(dst, src);
     }
-    psrld(dst, byte{16});
+    psrld(dst, uint8_t{16});
     // dst = |a+b|c+d|e+f|g+h|
     paddd(dst, tmp);
   }
@@ -1010,7 +1010,7 @@ void SharedMacroAssemblerBase::I64x2ShrS(XMMRegister dst, XMMRegister src,
 
   // xmm_tmp = wasm_i64x2_const(0x80000000'00000000).
   Pcmpeqd(xmm_tmp, xmm_tmp);
-  Psllq(xmm_tmp, byte{63});
+  Psllq(xmm_tmp, uint8_t{63});
 
   if (!CpuFeatures::IsSupported(AVX) && (dst != src)) {
     movaps(dst, src);
@@ -1039,7 +1039,7 @@ void SharedMacroAssemblerBase::I64x2ShrS(XMMRegister dst, XMMRegister src,
 
   // See I64x2ShrS with constant shift for explanation of this algorithm.
   Pcmpeqd(xmm_tmp, xmm_tmp);
-  Psllq(xmm_tmp, byte{63});
+  Psllq(xmm_tmp, uint8_t{63});
 
   // Shift modulo 64.
   Move(tmp_shift, shift);
@@ -1067,14 +1067,14 @@ void SharedMacroAssemblerBase::I64x2Mul(XMMRegister dst, XMMRegister lhs,
   if (CpuFeatures::IsSupported(AVX)) {
     CpuFeatureScope avx_scope(this, AVX);
     // 1. Multiply high dword of each qword of left with right.
-    vpsrlq(tmp1, lhs, byte{32});
+    vpsrlq(tmp1, lhs, uint8_t{32});
     vpmuludq(tmp1, tmp1, rhs);
     // 2. Multiply high dword of each qword of right with left.
-    vpsrlq(tmp2, rhs, byte{32});
+    vpsrlq(tmp2, rhs, uint8_t{32});
     vpmuludq(tmp2, tmp2, lhs);
     // 3. Add 1 and 2, then shift left by 32 (this is the high dword of result).
     vpaddq(tmp2, tmp2, tmp1);
-    vpsllq(tmp2, tmp2, byte{32});
+    vpsllq(tmp2, tmp2, uint8_t{32});
     // 4. Multiply low dwords (this is the low dword of result).
     vpmuludq(dst, lhs, rhs);
     // 5. Add 3 and 4.
@@ -1083,12 +1083,12 @@ void SharedMacroAssemblerBase::I64x2Mul(XMMRegister dst, XMMRegister lhs,
     // Same algorithm as AVX version, but with moves to not overwrite inputs.
     movaps(tmp1, lhs);
     movaps(tmp2, rhs);
-    psrlq(tmp1, byte{32});
+    psrlq(tmp1, uint8_t{32});
     pmuludq(tmp1, rhs);
-    psrlq(tmp2, byte{32});
+    psrlq(tmp2, uint8_t{32});
     pmuludq(tmp2, lhs);
     paddq(tmp2, tmp1);
-    psllq(tmp2, byte{32});
+    psllq(tmp2, uint8_t{32});
     if (dst == rhs) {
       // pmuludq is commutative
       pmuludq(dst, lhs);
@@ -1266,7 +1266,7 @@ void SharedMacroAssemblerBase::S128Load32Splat(XMMRegister dst, Operand src) {
     vbroadcastss(dst, src);
   } else {
     movss(dst, src);
-    shufps(dst, dst, byte{0});
+    shufps(dst, dst, uint8_t{0});
   }
 }
 
diff --git a/deps/v8/src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h b/deps/v8/src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h
index ae97572783fd0f..7778fdfacae496 100644
--- a/deps/v8/src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h
+++ b/deps/v8/src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h
@@ -804,7 +804,7 @@ class V8_EXPORT_PRIVATE SharedMacroAssembler : public SharedMacroAssemblerBase {
     // the exponent, which means multiply by 2 (or addps to itself).
     Addps(dst, dst, dst);
     // Then shift to get the bit representation of the int.
-    Pslld(dst, byte{8});
+    Pslld(dst, uint8_t{8});
     // Merge the converted lanes and bit shifted lanes.
     Paddd(dst, tmp);
   }
diff --git a/deps/v8/src/codegen/signature.h b/deps/v8/src/codegen/signature.h
index 5a17688a54cedd..aa1b930d6bdecb 100644
--- a/deps/v8/src/codegen/signature.h
+++ b/deps/v8/src/codegen/signature.h
@@ -41,6 +41,10 @@ class Signature : public ZoneObject {
     return reps_[index];
   }
 
+  bool contains(T element) const {
+    return std::find(all().cbegin(), all().cend(), element) != all().cend();
+  }
+
   // Iteration support.
   base::iterator_range<const T*> parameters() const {
     return {reps_ + return_count_, reps_ + return_count_ + parameter_count_};
diff --git a/deps/v8/src/codegen/source-position-table.cc b/deps/v8/src/codegen/source-position-table.cc
index efa3e9d8b145d4..7e4cfa815a8f38 100644
--- a/deps/v8/src/codegen/source-position-table.cc
+++ b/deps/v8/src/codegen/source-position-table.cc
@@ -54,7 +54,7 @@ void SubtractFromEntry(PositionTableEntry* value,
 
 // Helper: Encode an integer.
 template <typename T>
-void EncodeInt(ZoneVector<byte>* bytes, T value) {
+void EncodeInt(ZoneVector<uint8_t>* bytes, T value) {
   using unsigned_type = typename std::make_unsigned<T>::type;
   // Zig-zag encoding.
   static constexpr int kShift = sizeof(T) * kBitsPerByte - 1;
@@ -64,7 +64,7 @@ void EncodeInt(ZoneVector<byte>* bytes, T value) {
   bool more;
   do {
     more = encoded > ValueBits::kMax;
-    byte current =
+    uint8_t current =
         MoreBit::encode(more) | ValueBits::encode(encoded & ValueBits::kMask);
     bytes->push_back(current);
     encoded >>= ValueBits::kSize;
@@ -72,7 +72,7 @@ void EncodeInt(ZoneVector<byte>* bytes, T value) {
 }
 
 // Encode a PositionTableEntry.
-void EncodeEntry(ZoneVector<byte>* bytes, const PositionTableEntry& entry) {
+void EncodeEntry(ZoneVector<uint8_t>* bytes, const PositionTableEntry& entry) {
   // We only accept ascending code offsets.
   DCHECK_LE(0, entry.code_offset);
   // All but the first entry must be *strictly* ascending (no two entries for
@@ -87,8 +87,8 @@ void EncodeEntry(ZoneVector<byte>* bytes, const PositionTableEntry& entry) {
 
 // Helper: Decode an integer.
 template <typename T>
-T DecodeInt(base::Vector<const byte> bytes, int* index) {
-  byte current;
+T DecodeInt(base::Vector<const uint8_t> bytes, int* index) {
+  uint8_t current;
   int shift = 0;
   T decoded = 0;
   bool more;
@@ -105,7 +105,7 @@ T DecodeInt(base::Vector<const byte> bytes, int* index) {
   return decoded;
 }
 
-void DecodeEntry(base::Vector<const byte> bytes, int* index,
+void DecodeEntry(base::Vector<const uint8_t> bytes, int* index,
                  PositionTableEntry* entry) {
   int tmp = DecodeInt<int>(bytes, index);
   if (tmp >= 0) {
@@ -118,9 +118,9 @@ void DecodeEntry(base::Vector<const byte> bytes, int* index,
   entry->source_position = DecodeInt<int64_t>(bytes, index);
 }
 
-base::Vector<const byte> VectorFromByteArray(ByteArray byte_array) {
-  return base::Vector<const byte>(byte_array.GetDataStartAddress(),
-                                  byte_array.length());
+base::Vector<const uint8_t> VectorFromByteArray(Tagged<ByteArray> byte_array) {
+  return base::Vector<const uint8_t>(byte_array->GetDataStartAddress(),
+                                     byte_array->length());
 }
 
 #ifdef ENABLE_SLOW_DCHECKS
@@ -201,12 +201,12 @@ template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
     Handle<ByteArray> SourcePositionTableBuilder::ToSourcePositionTable(
         LocalIsolate* isolate);
 
-base::OwnedVector<byte>
+base::OwnedVector<uint8_t>
 SourcePositionTableBuilder::ToSourcePositionTableVector() {
-  if (bytes_.empty()) return base::OwnedVector<byte>();
+  if (bytes_.empty()) return base::OwnedVector<uint8_t>();
   DCHECK(!Omit());
 
-  base::OwnedVector<byte> table = base::OwnedVector<byte>::Of(bytes_);
+  base::OwnedVector<uint8_t> table = base::OwnedVector<uint8_t>::Of(bytes_);
 
 #ifdef ENABLE_SLOW_DCHECKS
   // Brute force testing: Record all positions and decode
@@ -230,7 +230,7 @@ void SourcePositionTableIterator::Initialize() {
 }
 
 SourcePositionTableIterator::SourcePositionTableIterator(
-    ByteArray byte_array, IterationFilter iteration_filter,
+    Tagged<ByteArray> byte_array, IterationFilter iteration_filter,
     FunctionEntryFilter function_entry_filter)
     : raw_table_(VectorFromByteArray(byte_array)),
       iteration_filter_(iteration_filter),
@@ -252,7 +252,7 @@ SourcePositionTableIterator::SourcePositionTableIterator(
 }
 
 SourcePositionTableIterator::SourcePositionTableIterator(
-    base::Vector<const byte> bytes, IterationFilter iteration_filter,
+    base::Vector<const uint8_t> bytes, IterationFilter iteration_filter,
     FunctionEntryFilter function_entry_filter)
     : raw_table_(bytes),
       iteration_filter_(iteration_filter),
@@ -265,7 +265,7 @@ SourcePositionTableIterator::SourcePositionTableIterator(
 }
 
 void SourcePositionTableIterator::Advance() {
-  base::Vector<const byte> bytes =
+  base::Vector<const uint8_t> bytes =
       table_.is_null() ? raw_table_ : VectorFromByteArray(*table_);
   DCHECK(!done());
   DCHECK(index_ >= 0 && index_ <= bytes.length());
diff --git a/deps/v8/src/codegen/source-position-table.h b/deps/v8/src/codegen/source-position-table.h
index 13bf2adf5f3afb..4d8e6de0a05de5 100644
--- a/deps/v8/src/codegen/source-position-table.h
+++ b/deps/v8/src/codegen/source-position-table.h
@@ -17,9 +17,6 @@ namespace v8 {
 namespace internal {
 
 class ByteArray;
-template <typename T>
-class Handle;
-class Isolate;
 class Zone;
 
 struct PositionTableEntry {
@@ -57,7 +54,7 @@ class V8_EXPORT_PRIVATE SourcePositionTableBuilder {
   template <typename IsolateT>
   EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
   Handle<ByteArray> ToSourcePositionTable(IsolateT* isolate);
-  base::OwnedVector<byte> ToSourcePositionTableVector();
+  base::OwnedVector<uint8_t> ToSourcePositionTableVector();
 
   inline bool Omit() const { return mode_ != RECORD_SOURCE_POSITIONS; }
   inline bool Lazy() const { return mode_ == LAZY_SOURCE_POSITIONS; }
@@ -66,7 +63,7 @@ class V8_EXPORT_PRIVATE SourcePositionTableBuilder {
   void AddEntry(const PositionTableEntry& entry);
 
   RecordingMode mode_;
-  ZoneVector<byte> bytes_;
+  ZoneVector<uint8_t> bytes_;
 #ifdef ENABLE_SLOW_DCHECKS
   ZoneVector<PositionTableEntry> raw_entries_;
 #endif
@@ -108,13 +105,14 @@ class V8_EXPORT_PRIVATE SourcePositionTableIterator {
   // allocation during its lifetime. This is useful if there is no handle
   // scope around.
   explicit SourcePositionTableIterator(
-      ByteArray byte_array, IterationFilter iteration_filter = kJavaScriptOnly,
+      Tagged<ByteArray> byte_array,
+      IterationFilter iteration_filter = kJavaScriptOnly,
       FunctionEntryFilter function_entry_filter = kSkipFunctionEntry);
 
   // Handle-safe iterator based on an a vector located outside the garbage
   // collected heap, allows allocation during its lifetime.
   explicit SourcePositionTableIterator(
-      base::Vector<const byte> bytes,
+      base::Vector<const uint8_t> bytes,
       IterationFilter iteration_filter = kJavaScriptOnly,
       FunctionEntryFilter function_entry_filter = kSkipFunctionEntry);
 
@@ -152,7 +150,7 @@ class V8_EXPORT_PRIVATE SourcePositionTableIterator {
 
   static const int kDone = -1;
 
-  base::Vector<const byte> raw_table_;
+  base::Vector<const uint8_t> raw_table_;
   Handle<ByteArray> table_;
   int index_ = 0;
   PositionTableEntry current_;
diff --git a/deps/v8/src/codegen/source-position.cc b/deps/v8/src/codegen/source-position.cc
index 60ff9f8f98054c..eb433fdae3a694 100644
--- a/deps/v8/src/codegen/source-position.cc
+++ b/deps/v8/src/codegen/source-position.cc
@@ -3,7 +3,9 @@
 // found in the LICENSE file.
 
 #include "src/codegen/source-position.h"
+
 #include "src/codegen/optimized-compilation-info.h"
+#include "src/common/assert-scope.h"
 #include "src/objects/objects-inl.h"
 
 namespace v8 {
@@ -11,8 +13,8 @@ namespace internal {
 
 std::ostream& operator<<(std::ostream& out, const SourcePositionInfo& pos) {
   out << "<";
-  if (!pos.script.is_null() && pos.script->name().IsString()) {
-    out << String::cast(pos.script->name()).ToCString(DISALLOW_NULLS).get();
+  if (!pos.script.is_null() && IsString(pos.script->name())) {
+    out << String::cast(pos.script->name())->ToCString(DISALLOW_NULLS).get();
   } else {
     out << "unknown";
   }
@@ -59,55 +61,57 @@ std::vector<SourcePositionInfo> SourcePosition::InliningStack(
   return stack;
 }
 
-std::vector<SourcePositionInfo> SourcePosition::InliningStack(Isolate* isolate,
-                                                              Code code) const {
-  DeoptimizationData deopt_data =
-      DeoptimizationData::cast(code.deoptimization_data());
+std::vector<SourcePositionInfo> SourcePosition::InliningStack(
+    Isolate* isolate, Tagged<Code> code) const {
+  Tagged<DeoptimizationData> deopt_data =
+      DeoptimizationData::cast(code->deoptimization_data());
   SourcePosition pos = *this;
   std::vector<SourcePositionInfo> stack;
   while (pos.isInlined()) {
-    InliningPosition inl = deopt_data.InliningPositions().get(pos.InliningId());
+    InliningPosition inl =
+        deopt_data->InliningPositions()->get(pos.InliningId());
     Handle<SharedFunctionInfo> function(
-        deopt_data.GetInlinedFunction(inl.inlined_function_id), isolate);
+        deopt_data->GetInlinedFunction(inl.inlined_function_id), isolate);
     stack.push_back(SourcePositionInfo(isolate, pos, function));
     pos = inl.position;
   }
   Handle<SharedFunctionInfo> function(
-      SharedFunctionInfo::cast(deopt_data.SharedFunctionInfo()), isolate);
+      SharedFunctionInfo::cast(deopt_data->SharedFunctionInfo()), isolate);
   stack.push_back(SourcePositionInfo(isolate, pos, function));
   return stack;
 }
 
 SourcePositionInfo SourcePosition::FirstInfo(Isolate* isolate,
-                                             Code code) const {
+                                             Tagged<Code> code) const {
   DisallowGarbageCollection no_gc;
-  DeoptimizationData deopt_data =
-      DeoptimizationData::cast(code.deoptimization_data());
+  Tagged<DeoptimizationData> deopt_data =
+      DeoptimizationData::cast(code->deoptimization_data());
   SourcePosition pos = *this;
   if (pos.isInlined()) {
-    InliningPosition inl = deopt_data.InliningPositions().get(pos.InliningId());
+    InliningPosition inl =
+        deopt_data->InliningPositions()->get(pos.InliningId());
     Handle<SharedFunctionInfo> function(
-        deopt_data.GetInlinedFunction(inl.inlined_function_id), isolate);
+        deopt_data->GetInlinedFunction(inl.inlined_function_id), isolate);
     return SourcePositionInfo(isolate, pos, function);
   }
   Handle<SharedFunctionInfo> function(
-      SharedFunctionInfo::cast(deopt_data.SharedFunctionInfo()), isolate);
+      SharedFunctionInfo::cast(deopt_data->SharedFunctionInfo()), isolate);
   return SourcePositionInfo(isolate, pos, function);
 }
 
 void SourcePosition::Print(std::ostream& out,
-                           SharedFunctionInfo function) const {
+                           Tagged<SharedFunctionInfo> function) const {
   Script::PositionInfo pos;
-  Object source_name;
-  if (function.script().IsScript()) {
-    Script script = Script::cast(function.script());
-    source_name = script.name();
-    script.GetPositionInfo(ScriptOffset(), &pos, Script::WITH_OFFSET);
+  Tagged<Object> source_name;
+  if (IsScript(function->script())) {
+    Tagged<Script> script = Script::cast(function->script());
+    source_name = script->name();
+    script->GetPositionInfo(ScriptOffset(), &pos);
   }
   out << "<";
-  if (source_name.IsString()) {
+  if (IsString(source_name)) {
     out << String::cast(source_name)
-               .ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL)
+               ->ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL)
                .get();
   } else {
     out << "unknown";
@@ -126,20 +130,20 @@ void SourcePosition::PrintJson(std::ostream& out) const {
   }
 }
 
-void SourcePosition::Print(std::ostream& out, Code code) const {
-  DeoptimizationData deopt_data =
-      DeoptimizationData::cast(code.deoptimization_data());
+void SourcePosition::Print(std::ostream& out, Tagged<Code> code) const {
+  Tagged<DeoptimizationData> deopt_data =
+      DeoptimizationData::cast(code->deoptimization_data());
   if (!isInlined()) {
-    SharedFunctionInfo function(
-        SharedFunctionInfo::cast(deopt_data.SharedFunctionInfo()));
+    Tagged<SharedFunctionInfo> function(
+        SharedFunctionInfo::cast(deopt_data->SharedFunctionInfo()));
     Print(out, function);
   } else {
-    InliningPosition inl = deopt_data.InliningPositions().get(InliningId());
+    InliningPosition inl = deopt_data->InliningPositions()->get(InliningId());
     if (inl.inlined_function_id == -1) {
       out << *this;
     } else {
-      SharedFunctionInfo function =
-          deopt_data.GetInlinedFunction(inl.inlined_function_id);
+      Tagged<SharedFunctionInfo> function =
+          deopt_data->GetInlinedFunction(inl.inlined_function_id);
       Print(out, function);
     }
     out << " inlined at ";
@@ -148,19 +152,19 @@ void SourcePosition::Print(std::ostream& out, Code code) const {
 }
 
 SourcePositionInfo::SourcePositionInfo(Isolate* isolate, SourcePosition pos,
-                                       Handle<SharedFunctionInfo> f)
-    : position(pos),
-      shared(f),
-      script(f.is_null() || !f->script().IsScript()
-                 ? Handle<Script>::null()
-                 : handle(Script::cast(f->script()), isolate)) {
-  if (!script.is_null()) {
-    Script::PositionInfo info;
-    if (Script::GetPositionInfo(script, pos.ScriptOffset(), &info,
-                                Script::WITH_OFFSET)) {
-      line = info.line;
-      column = info.column;
-    }
+                                       Handle<SharedFunctionInfo> sfi)
+    : position(pos), shared(sfi), script(Handle<Script>::null()) {
+  {
+    DisallowGarbageCollection no_gc;
+    if (sfi.is_null()) return;
+    Tagged<Object> maybe_script = sfi->script();
+    if (!IsScript(maybe_script)) return;
+    script = handle(Script::cast(maybe_script), isolate);
+  }
+  Script::PositionInfo info;
+  if (Script::GetPositionInfo(script, pos.ScriptOffset(), &info)) {
+    line = info.line;
+    column = info.column;
   }
 }
 
diff --git a/deps/v8/src/codegen/source-position.h b/deps/v8/src/codegen/source-position.h
index 5d6b1a93f76045..74bd2cfa8c02ee 100644
--- a/deps/v8/src/codegen/source-position.h
+++ b/deps/v8/src/codegen/source-position.h
@@ -80,12 +80,12 @@ class SourcePosition final {
 
   // Assumes that the code object is optimized.
   std::vector<SourcePositionInfo> InliningStack(Isolate* isolate,
-                                                Code code) const;
+                                                Tagged<Code> code) const;
   std::vector<SourcePositionInfo> InliningStack(
       Isolate* isolate, OptimizedCompilationInfo* cinfo) const;
-  SourcePositionInfo FirstInfo(Isolate* isolate, Code code) const;
+  SourcePositionInfo FirstInfo(Isolate* isolate, Tagged<Code> code) const;
 
-  void Print(std::ostream& out, Code code) const;
+  void Print(std::ostream& out, Tagged<Code> code) const;
   void PrintJson(std::ostream& out) const;
 
   int ScriptOffset() const {
@@ -140,7 +140,7 @@ class SourcePosition final {
     SetInliningId(inlining_id);
   }
 
-  void Print(std::ostream& out, SharedFunctionInfo function) const;
+  void Print(std::ostream& out, Tagged<SharedFunctionInfo> function) const;
 
   using IsExternalField = base::BitField64<bool, 0, 1>;
 
diff --git a/deps/v8/src/codegen/string-constants.cc b/deps/v8/src/codegen/string-constants.cc
deleted file mode 100644
index c1ad5a7b4b6d3b..00000000000000
--- a/deps/v8/src/codegen/string-constants.cc
+++ /dev/null
@@ -1,187 +0,0 @@
-// Copyright 2018 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/codegen/string-constants.h"
-
-#include "src/base/functional.h"
-#include "src/objects/objects.h"
-#include "src/objects/string-inl.h"
-
-namespace v8 {
-namespace internal {
-
-Handle<String> StringConstantBase::AllocateStringConstant(
-    Isolate* isolate) const {
-  if (!flattened_.is_null()) {
-    return flattened_;
-  }
-
-  Handle<String> result;
-  switch (kind()) {
-    case StringConstantKind::kStringLiteral: {
-      result = static_cast<const StringLiteral*>(this)->str();
-      CHECK(!result.is_null());
-      break;
-    }
-    case StringConstantKind::kNumberToStringConstant: {
-      auto num_constant = static_cast<const NumberToStringConstant*>(this);
-      Handle<Object> num_obj =
-          isolate->factory()->NewNumber(num_constant->num());
-      result = isolate->factory()->NumberToString(num_obj);
-      CHECK(!result.is_null());
-      break;
-    }
-    case StringConstantKind::kStringCons: {
-      Handle<String> lhs =
-          static_cast<const StringCons*>(this)->lhs()->AllocateStringConstant(
-              isolate);
-      Handle<String> rhs =
-          static_cast<const StringCons*>(this)->rhs()->AllocateStringConstant(
-              isolate);
-      result = isolate->factory()->NewConsString(lhs, rhs).ToHandleChecked();
-      break;
-    }
-  }
-
-  // TODO(mslekova): Normally we'd want to flatten the string here
-  // but that results in OOM for too long strings.
-  Memoize(result);
-  return flattened_;
-}
-
-bool StringConstantBase::operator==(const StringConstantBase& other) const {
-  if (kind() != other.kind()) return false;
-
-  switch (kind()) {
-    case StringConstantKind::kStringLiteral: {
-      return static_cast<const StringLiteral*>(this) ==
-             static_cast<const StringLiteral*>(&other);
-    }
-    case StringConstantKind::kNumberToStringConstant: {
-      return static_cast<const NumberToStringConstant*>(this) ==
-             static_cast<const NumberToStringConstant*>(&other);
-    }
-    case StringConstantKind::kStringCons: {
-      return static_cast<const StringCons*>(this) ==
-             static_cast<const StringCons*>(&other);
-    }
-  }
-  UNREACHABLE();
-}
-
-size_t hash_value(StringConstantBase const& base) {
-  switch (base.kind()) {
-    case StringConstantKind::kStringLiteral: {
-      return hash_value(*static_cast<const StringLiteral*>(&base));
-    }
-    case StringConstantKind::kNumberToStringConstant: {
-      return hash_value(*static_cast<const NumberToStringConstant*>(&base));
-    }
-    case StringConstantKind::kStringCons: {
-      return hash_value(*static_cast<const StringCons*>(&base));
-    }
-  }
-  UNREACHABLE();
-}
-
-bool operator==(StringLiteral const& lhs, StringLiteral const& rhs) {
-  return lhs.str().address() == rhs.str().address();
-}
-
-bool operator!=(StringLiteral const& lhs, StringLiteral const& rhs) {
-  return !(lhs == rhs);
-}
-
-size_t hash_value(StringLiteral const& p) {
-  return base::hash_combine(p.str().address());
-}
-
-std::ostream& operator<<(std::ostream& os, StringLiteral const& p) {
-  return os << Brief(*p.str());
-}
-
-bool operator==(NumberToStringConstant const& lhs,
-                NumberToStringConstant const& rhs) {
-  return lhs.num() == rhs.num();
-}
-
-bool operator!=(NumberToStringConstant const& lhs,
-                NumberToStringConstant const& rhs) {
-  return !(lhs == rhs);
-}
-
-size_t hash_value(NumberToStringConstant const& p) {
-  return base::hash_combine(p.num());
-}
-
-std::ostream& operator<<(std::ostream& os, NumberToStringConstant const& p) {
-  return os << p.num();
-}
-
-bool operator==(StringCons const& lhs, StringCons const& rhs) {
-  // TODO(mslekova): Think if we can express this in a more readable manner
-  return *(lhs.lhs()) == *(rhs.lhs()) && *(lhs.rhs()) == *(rhs.rhs());
-}
-
-bool operator!=(StringCons const& lhs, StringCons const& rhs) {
-  return !(lhs == rhs);
-}
-
-size_t hash_value(StringCons const& p) {
-  return base::hash_combine(*(p.lhs()), *(p.rhs()));
-}
-
-std::ostream& operator<<(std::ostream& os, const StringConstantBase* base) {
-  os << "DelayedStringConstant: ";
-  switch (base->kind()) {
-    case StringConstantKind::kStringLiteral: {
-      os << *static_cast<const StringLiteral*>(base);
-      break;
-    }
-    case StringConstantKind::kNumberToStringConstant: {
-      os << *static_cast<const NumberToStringConstant*>(base);
-      break;
-    }
-    case StringConstantKind::kStringCons: {
-      os << *static_cast<const StringCons*>(base);
-      break;
-    }
-  }
-  return os;
-}
-
-std::ostream& operator<<(std::ostream& os, StringCons const& p) {
-  return os << p.lhs() << ", " << p.rhs();
-}
-
-size_t StringConstantBase::GetMaxStringConstantLength() const {
-  switch (kind()) {
-    case StringConstantKind::kStringLiteral: {
-      return static_cast<const StringLiteral*>(this)
-          ->GetMaxStringConstantLength();
-    }
-    case StringConstantKind::kNumberToStringConstant: {
-      return static_cast<const NumberToStringConstant*>(this)
-          ->GetMaxStringConstantLength();
-    }
-    case StringConstantKind::kStringCons: {
-      return static_cast<const StringCons*>(this)->GetMaxStringConstantLength();
-    }
-  }
-  UNREACHABLE();
-}
-
-size_t StringLiteral::GetMaxStringConstantLength() const { return length_; }
-
-size_t NumberToStringConstant::GetMaxStringConstantLength() const {
-  return kMaxDoubleStringLength;
-}
-
-size_t StringCons::GetMaxStringConstantLength() const {
-  return lhs()->GetMaxStringConstantLength() +
-         rhs()->GetMaxStringConstantLength();
-}
-
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/src/codegen/string-constants.h b/deps/v8/src/codegen/string-constants.h
deleted file mode 100644
index 8043c605c3be93..00000000000000
--- a/deps/v8/src/codegen/string-constants.h
+++ /dev/null
@@ -1,116 +0,0 @@
-// Copyright 2018 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_CODEGEN_STRING_CONSTANTS_H_
-#define V8_CODEGEN_STRING_CONSTANTS_H_
-
-#include "src/handles/handles.h"
-#include "src/objects/string.h"
-#include "src/zone/zone.h"
-
-namespace v8 {
-namespace internal {
-
-enum class StringConstantKind {
-  kStringLiteral,
-  kNumberToStringConstant,
-  kStringCons
-};
-
-class StringConstantBase : public ZoneObject {
- public:
-  explicit StringConstantBase(StringConstantKind kind) : kind_(kind) {}
-
-  StringConstantKind kind() const { return kind_; }
-  Handle<String> AllocateStringConstant(Isolate* isolate) const;
-
-  size_t GetMaxStringConstantLength() const;
-
-  bool operator==(const StringConstantBase& other) const;
-
- private:
-  void Memoize(Handle<String> flattened) const { flattened_ = flattened; }
-
-  StringConstantKind kind_;
-  mutable Handle<String> flattened_ = Handle<String>::null();
-};
-
-size_t hash_value(StringConstantBase const& base);
-
-class StringLiteral final : public StringConstantBase {
- public:
-  explicit StringLiteral(Handle<String> str, size_t length)
-      : StringConstantBase(StringConstantKind::kStringLiteral),
-        str_(str),
-        length_(length) {}
-
-  Handle<String> str() const { return str_; }
-
-  size_t GetMaxStringConstantLength() const;
-
- private:
-  Handle<String> str_;
-  size_t length_;  // We store this separately to avoid accessing the heap.
-};
-
-bool operator==(StringLiteral const& lhs, StringLiteral const& rhs);
-bool operator!=(StringLiteral const& lhs, StringLiteral const& rhs);
-
-size_t hash_value(StringLiteral const& parameters);
-
-std::ostream& operator<<(std::ostream& os, StringLiteral const& parameters);
-
-class NumberToStringConstant final : public StringConstantBase {
- public:
-  explicit NumberToStringConstant(double num)
-      : StringConstantBase(StringConstantKind::kNumberToStringConstant),
-        num_(num) {}
-
-  double num() const { return num_; }
-
-  size_t GetMaxStringConstantLength() const;
-
- private:
-  double num_;
-};
-
-bool operator==(NumberToStringConstant const& lhs,
-                NumberToStringConstant const& rhs);
-bool operator!=(NumberToStringConstant const& lhs,
-                NumberToStringConstant const& rhs);
-
-size_t hash_value(NumberToStringConstant const& parameters);
-
-std::ostream& operator<<(std::ostream& os,
-                         NumberToStringConstant const& parameters);
-
-class StringCons final : public StringConstantBase {
- public:
-  explicit StringCons(const StringConstantBase* lhs,
-                      const StringConstantBase* rhs)
-      : StringConstantBase(StringConstantKind::kStringCons),
-        lhs_(lhs),
-        rhs_(rhs) {}
-
-  const StringConstantBase* lhs() const { return lhs_; }
-  const StringConstantBase* rhs() const { return rhs_; }
-
-  size_t GetMaxStringConstantLength() const;
-
- private:
-  const StringConstantBase* lhs_;
-  const StringConstantBase* rhs_;
-};
-
-bool operator==(StringCons const& lhs, StringCons const& rhs);
-bool operator!=(StringCons const& lhs, StringCons const& rhs);
-
-size_t hash_value(StringCons const& parameters);
-
-std::ostream& operator<<(std::ostream& os, StringCons const& parameters);
-
-}  // namespace internal
-}  // namespace v8
-
-#endif  // V8_CODEGEN_STRING_CONSTANTS_H_
diff --git a/deps/v8/src/codegen/tnode.h b/deps/v8/src/codegen/tnode.h
index 7629e89ad693fe..2b4d3b4c2e9f3f 100644
--- a/deps/v8/src/codegen/tnode.h
+++ b/deps/v8/src/codegen/tnode.h
@@ -88,6 +88,10 @@ struct ExternalPointerHandleT : Uint32T {
   static constexpr MachineType kMachineType = MachineType::Uint32();
 };
 
+struct IndirectPointerHandleT : Uint32T {
+  static constexpr MachineType kMachineType = MachineType::Uint32();
+};
+
 #ifdef V8_ENABLE_SANDBOX
 struct ExternalPointerT : Uint32T {
   static constexpr MachineType kMachineType = MachineType::Uint32();
@@ -117,7 +121,9 @@ using TaggedT = IntPtrT;
 #endif
 
 // Result of a comparison operation.
-struct BoolT : Word32T {};
+struct BoolT : Word32T {
+  static constexpr MachineType kMachineType = MachineType::Int32();
+};
 
 // Value type of a Turbofan node with two results.
 template <class T1, class T2>
@@ -360,11 +366,11 @@ class TNode {
  public:
   template <class U,
             typename std::enable_if<is_subtype<U, T>::value, int>::type = 0>
-  TNode(const TNode<U>& other) V8_NOEXCEPT : node_(other) {
+  TNode(const TNode<U>& other) V8_NOEXCEPT : node_(other.node_) {
     LazyTemplateChecks();
   }
-  TNode(const TNode& other) V8_NOEXCEPT : node_(other) { LazyTemplateChecks(); }
-  TNode() : TNode(nullptr) {}
+  TNode(const TNode& other) V8_NOEXCEPT : node_(other.node_) {}
+  TNode() : node_(nullptr) {}
 
   TNode operator=(TNode other) {
     DCHECK_NOT_NULL(other.node_);
@@ -374,12 +380,17 @@ class TNode {
 
   operator compiler::Node*() const { return node_; }
 
+  explicit operator bool() const { return node_ != nullptr; }
+
   static TNode UncheckedCast(compiler::Node* node) { return TNode(node); }
 
  protected:
+  template <typename U>
+  friend class TNode;
+
   explicit TNode(compiler::Node* node) : node_(node) { LazyTemplateChecks(); }
   // These checks shouldn't be checked before TNode is actually used.
-  void LazyTemplateChecks() {
+  void LazyTemplateChecks() const {
     static_assert(is_valid_type_tag<T>::value, "invalid type tag");
   }
 
diff --git a/deps/v8/src/codegen/x64/assembler-x64-inl.h b/deps/v8/src/codegen/x64/assembler-x64-inl.h
index dc51e84ff4e611..5d196ac4152bcb 100644
--- a/deps/v8/src/codegen/x64/assembler-x64-inl.h
+++ b/deps/v8/src/codegen/x64/assembler-x64-inl.h
@@ -64,32 +64,32 @@ void Assembler::emit_rex_32(Register rm_reg) { emit(0x40 | rm_reg.high_bit()); }
 void Assembler::emit_rex_32(Operand op) { emit(0x40 | op.rex()); }
 
 void Assembler::emit_optional_rex_32(Register reg, Register rm_reg) {
-  byte rex_bits = reg.high_bit() << 2 | rm_reg.high_bit();
+  uint8_t rex_bits = reg.high_bit() << 2 | rm_reg.high_bit();
   if (rex_bits != 0) emit(0x40 | rex_bits);
 }
 
 void Assembler::emit_optional_rex_32(Register reg, Operand op) {
-  byte rex_bits = reg.high_bit() << 2 | op.rex();
+  uint8_t rex_bits = reg.high_bit() << 2 | op.rex();
   if (rex_bits != 0) emit(0x40 | rex_bits);
 }
 
 void Assembler::emit_optional_rex_32(XMMRegister reg, Operand op) {
-  byte rex_bits = (reg.code() & 0x8) >> 1 | op.rex();
+  uint8_t rex_bits = (reg.code() & 0x8) >> 1 | op.rex();
   if (rex_bits != 0) emit(0x40 | rex_bits);
 }
 
 void Assembler::emit_optional_rex_32(XMMRegister reg, XMMRegister base) {
-  byte rex_bits = (reg.code() & 0x8) >> 1 | (base.code() & 0x8) >> 3;
+  uint8_t rex_bits = (reg.code() & 0x8) >> 1 | (base.code() & 0x8) >> 3;
   if (rex_bits != 0) emit(0x40 | rex_bits);
 }
 
 void Assembler::emit_optional_rex_32(XMMRegister reg, Register base) {
-  byte rex_bits = (reg.code() & 0x8) >> 1 | (base.code() & 0x8) >> 3;
+  uint8_t rex_bits = (reg.code() & 0x8) >> 1 | (base.code() & 0x8) >> 3;
   if (rex_bits != 0) emit(0x40 | rex_bits);
 }
 
 void Assembler::emit_optional_rex_32(Register reg, XMMRegister base) {
-  byte rex_bits = (reg.code() & 0x8) >> 1 | (base.code() & 0x8) >> 3;
+  uint8_t rex_bits = (reg.code() & 0x8) >> 1 | (base.code() & 0x8) >> 3;
   if (rex_bits != 0) emit(0x40 | rex_bits);
 }
 
@@ -124,20 +124,21 @@ void Assembler::emit_optional_rex_8(Register reg, Operand op) {
 // byte 1 of 3-byte VEX
 void Assembler::emit_vex3_byte1(XMMRegister reg, XMMRegister rm,
                                 LeadingOpcode m) {
-  byte rxb = static_cast<byte>(~((reg.high_bit() << 2) | rm.high_bit())) << 5;
+  uint8_t rxb = static_cast<uint8_t>(~((reg.high_bit() << 2) | rm.high_bit()))
+                << 5;
   emit(rxb | m);
 }
 
 // byte 1 of 3-byte VEX
 void Assembler::emit_vex3_byte1(XMMRegister reg, Operand rm, LeadingOpcode m) {
-  byte rxb = static_cast<byte>(~((reg.high_bit() << 2) | rm.rex())) << 5;
+  uint8_t rxb = static_cast<uint8_t>(~((reg.high_bit() << 2) | rm.rex())) << 5;
   emit(rxb | m);
 }
 
 // byte 1 of 2-byte VEX
 void Assembler::emit_vex2_byte1(XMMRegister reg, XMMRegister v, VectorLength l,
                                 SIMDPrefix pp) {
-  byte rv = static_cast<byte>(~((reg.high_bit() << 4) | v.code())) << 3;
+  uint8_t rv = static_cast<uint8_t>(~((reg.high_bit() << 4) | v.code())) << 3;
   emit(rv | l | pp);
 }
 
@@ -215,9 +216,9 @@ void Assembler::deserialization_set_target_internal_reference_at(
 }
 
 void Assembler::deserialization_set_special_target_at(
-    Address instruction_payload, Code code, Address target) {
+    Address instruction_payload, Tagged<Code> code, Address target) {
   set_target_address_at(instruction_payload,
-                        !code.is_null() ? code.constant_pool() : kNullAddress,
+                        !code.is_null() ? code->constant_pool() : kNullAddress,
                         target);
 }
 
@@ -279,12 +280,12 @@ int RelocInfo::target_address_size() {
   }
 }
 
-HeapObject RelocInfo::target_object(PtrComprCageBase cage_base) {
+Tagged<HeapObject> RelocInfo::target_object(PtrComprCageBase cage_base) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
     Tagged_t compressed = ReadUnalignedValue<Tagged_t>(pc_);
     DCHECK(!HAS_SMI_TAG(compressed));
-    Object obj(
+    Tagged<Object> obj(
         V8HeapCompressionScheme::DecompressTagged(cage_base, compressed));
     // Embedding of compressed InstructionStream objects must not happen when
     // external code space is enabled, because Codes must be used
@@ -334,8 +335,7 @@ Address RelocInfo::target_internal_reference_address() {
   return pc_;
 }
 
-void RelocInfo::set_target_object(Heap* heap, HeapObject target,
-                                  WriteBarrierMode write_barrier_mode,
+void RelocInfo::set_target_object(Tagged<HeapObject> target,
                                   ICacheFlushMode icache_flush_mode) {
   DCHECK(IsCodeTarget(rmode_) || IsEmbeddedObjectMode(rmode_));
   if (IsCompressedEmbeddedObject(rmode_)) {
@@ -349,9 +349,6 @@ void RelocInfo::set_target_object(Heap* heap, HeapObject target,
   if (icache_flush_mode != SKIP_ICACHE_FLUSH) {
     FlushInstructionCache(pc_, sizeof(Address));
   }
-  if (!instruction_stream().is_null() && !v8_flags.disable_write_barriers) {
-    WriteBarrierForCode(instruction_stream(), this, target, write_barrier_mode);
-  }
 }
 
 Builtin RelocInfo::target_builtin_at(Assembler* origin) {
diff --git a/deps/v8/src/codegen/x64/assembler-x64.cc b/deps/v8/src/codegen/x64/assembler-x64.cc
index b271271de5824f..b6134e0bf7cbef 100644
--- a/deps/v8/src/codegen/x64/assembler-x64.cc
+++ b/deps/v8/src/codegen/x64/assembler-x64.cc
@@ -6,6 +6,8 @@
 
 #include <cstring>
 
+#include "src/utils/utils.h"
+
 #if V8_TARGET_ARCH_X64
 
 #if V8_LIBC_MSVCRT
@@ -168,10 +170,10 @@ uint32_t RelocInfo::wasm_call_tag() const {
 Operand::Operand(Operand operand, int32_t offset) {
   DCHECK_GE(operand.memory().len, 1);
   // Operand encodes REX ModR/M [SIB] [Disp].
-  byte modrm = operand.memory().buf[0];
+  uint8_t modrm = operand.memory().buf[0];
   DCHECK_LT(modrm, 0xC0);  // Disallow mode 3 (register target).
   bool has_sib = ((modrm & 0x07) == 0x04);
-  byte mode = modrm & 0xC0;
+  uint8_t mode = modrm & 0xC0;
   int disp_offset = has_sib ? 2 : 1;
   int base_reg = (has_sib ? operand.memory().buf[1] : modrm) & 0x07;
   // Mode 0 with rbp/r13 as ModR/M or SIB base register always has a 32-bit
@@ -202,7 +204,7 @@ Operand::Operand(Operand operand, int32_t offset) {
     // Need 8 bits of displacement.
     memory_.buf[0] = (modrm & 0x3F) | 0x40;  // Mode 1.
     memory_.len = disp_offset + 1;
-    memory_.buf[disp_offset] = static_cast<byte>(disp_value);
+    memory_.buf[disp_offset] = static_cast<uint8_t>(disp_value);
   } else {
     // Need no displacement.
     memory_.buf[0] = (modrm & 0x3F);  // Mode 0.
@@ -241,7 +243,7 @@ bool Operand::AddressUsesRegister(Register reg) const {
   }
 }
 
-void Assembler::AllocateAndInstallRequestedHeapNumbers(Isolate* isolate) {
+void Assembler::AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate) {
   DCHECK_IMPLIES(isolate == nullptr, heap_number_requests_.empty());
   for (auto& request : heap_number_requests_) {
     Address pc = reinterpret_cast<Address>(buffer_start_) + request.offset();
@@ -365,7 +367,10 @@ Assembler::Assembler(const AssemblerOptions& options,
 #endif
 }
 
-void Assembler::GetCode(Isolate* isolate, CodeDesc* desc,
+void Assembler::GetCode(Isolate* isolate, CodeDesc* desc) {
+  GetCode(isolate->main_thread_local_isolate(), desc);
+}
+void Assembler::GetCode(LocalIsolate* isolate, CodeDesc* desc,
                         SafepointTableBuilderBase* safepoint_table_builder,
                         int handler_table_offset) {
   // As a crutch to avoid having to add manual Align calls wherever we use a
@@ -415,17 +420,16 @@ void Assembler::FinalizeJumpOptimizationInfo() {
   // Collection stage
   auto jump_opt = jump_optimization_info();
   if (jump_opt && jump_opt->is_collecting()) {
-    auto& bitmap = jump_opt->farjmp_bitmap();
-    int num = static_cast<int>(farjmp_positions_.size());
-    if (num && bitmap.empty()) {
+    auto& dict = jump_opt->may_optimizable_farjmp;
+    int num = static_cast<int>(jump_opt->farjmps.size());
+    if (num && dict.empty()) {
       bool can_opt = false;
-
-      bitmap.resize((num + 31) / 32, 0);
       for (int i = 0; i < num; i++) {
-        int disp_pos = farjmp_positions_[i];
-        int disp = long_at(disp_pos);
+        auto jmp_info = jump_opt->farjmps[i];
+        int disp = long_at(jmp_info.pos + jmp_info.opcode_size);
         if (is_int8(disp)) {
-          bitmap[i / 32] |= 1 << (i & 31);
+          jmp_info.distance = disp;
+          dict[i] = jmp_info;
           can_opt = true;
         }
       }
@@ -452,14 +456,22 @@ void Assembler::Align(int m) {
 
 void Assembler::CodeTargetAlign() {
   Align(16);  // Preferred alignment of jump targets on x64.
+  auto jump_opt = jump_optimization_info();
+  if (jump_opt && jump_opt->is_collecting()) {
+    jump_opt->align_pos_size[pc_offset()] = 16;
+  }
 }
 
 void Assembler::LoopHeaderAlign() {
   Align(64);  // Preferred alignment of loop header on x64.
+  auto jump_opt = jump_optimization_info();
+  if (jump_opt && jump_opt->is_collecting()) {
+    jump_opt->align_pos_size[pc_offset()] = 64;
+  }
 }
 
 bool Assembler::IsNop(Address addr) {
-  byte* a = reinterpret_cast<byte*>(addr);
+  uint8_t* a = reinterpret_cast<uint8_t*>(addr);
   while (*a == 0x66) a++;
   if (*a == 0x90) return true;
   if (a[0] == 0xF && a[1] == 0x1F) return true;
@@ -516,15 +528,15 @@ void Assembler::bind_to(Label* L, int pos) {
   // Optimization stage
   auto jump_opt = jump_optimization_info();
   if (jump_opt && jump_opt->is_optimizing()) {
-    auto it = label_farjmp_maps_.find(L);
-    if (it != label_farjmp_maps_.end()) {
+    auto it = jump_opt->label_farjmp_maps.find(L);
+    if (it != jump_opt->label_farjmp_maps.end()) {
       auto& pos_vector = it->second;
       for (auto fixup_pos : pos_vector) {
         int disp = pos - (fixup_pos + sizeof(int8_t));
         CHECK(is_int8(disp));
         set_byte_at(fixup_pos, disp);
       }
-      label_farjmp_maps_.erase(it);
+      jump_opt->label_farjmp_maps.erase(it);
     }
   }
   L->bind_to(pos);
@@ -533,7 +545,7 @@ void Assembler::bind_to(Label* L, int pos) {
 void Assembler::bind(Label* L) { bind_to(L, pc_offset()); }
 
 void Assembler::record_farjmp_position(Label* L, int pos) {
-  auto& pos_vector = label_farjmp_maps_[L];
+  auto& pos_vector = jump_optimization_info()->label_farjmp_maps[L];
   pos_vector.push_back(pos);
 }
 
@@ -543,9 +555,43 @@ bool Assembler::is_optimizable_farjmp(int idx) {
   auto jump_opt = jump_optimization_info();
   CHECK(jump_opt->is_optimizing());
 
-  auto& bitmap = jump_opt->farjmp_bitmap();
-  CHECK(idx < static_cast<int>(bitmap.size() * 32));
-  return !!(bitmap[idx / 32] & (1 << (idx & 31)));
+  auto& dict = jump_opt->may_optimizable_farjmp;
+  if (dict.find(idx) != dict.end()) {
+    auto record_jmp_info = dict[idx];
+
+    int record_pos = record_jmp_info.pos;
+
+    // 4 bytes for jmp rel32 operand.
+    const int operand_size = 4;
+    int record_dest = record_jmp_info.pos + record_jmp_info.opcode_size +
+                      operand_size + record_jmp_info.distance;
+
+    const int max_align_in_jmp_range =
+        jump_opt->MaxAlignInRange(record_pos, record_dest);
+
+    if (max_align_in_jmp_range == 0) {
+      return true;
+    }
+
+    // ja rel32 -> ja rel8, the opcode size 2bytes -> 1byte
+    // 0F 87 -> 77
+    const int saved_opcode_size = record_jmp_info.opcode_size - 1;
+
+    // jmp rel32 -> rel8, the operand size 4bytes -> 1byte
+    constexpr int saved_operand_size = 4 - 1;
+
+    // The shorter encoding may further decrease the base address of the
+    // relative jump, while the jump target could stay in place because of
+    // alignment.
+    int cur_jmp_length_max_increase =
+        (record_pos - pc_offset() + saved_opcode_size + saved_operand_size) %
+        max_align_in_jmp_range;
+
+    if (is_int8(record_jmp_info.distance + cur_jmp_length_max_increase)) {
+      return true;
+    }
+  }
+  return false;
 }
 
 void Assembler::GrowBuffer() {
@@ -565,7 +611,7 @@ void Assembler::GrowBuffer() {
   // Set up new buffer.
   std::unique_ptr<AssemblerBuffer> new_buffer = buffer_->Grow(new_size);
   DCHECK_EQ(new_size, new_buffer->size());
-  byte* new_start = new_buffer->start();
+  uint8_t* new_start = new_buffer->start();
 
   // Copy the data.
   intptr_t pc_delta = new_start - buffer_start_;
@@ -603,7 +649,7 @@ void Assembler::emit_operand(int code, Operand adr) {
 
   // Compute the opcode extension to be encoded in the ModR/M byte.
   V8_ASSUME(0 <= code && code <= 7);
-  DCHECK((adr.memory().buf[0] & 0x38) == 0);
+  DCHECK_EQ((adr.memory().buf[0] & 0x38), 0);
   uint8_t opcode_extension = code << 3;
 
   // Use an optimized routine for copying the 1-6 bytes into the assembler
@@ -656,14 +702,15 @@ void Assembler::emit_label_operand(int code, Label* label, int addend) {
 
 // Assembler Instruction implementations.
 
-void Assembler::arithmetic_op(byte opcode, Register reg, Operand op, int size) {
+void Assembler::arithmetic_op(uint8_t opcode, Register reg, Operand op,
+                              int size) {
   EnsureSpace ensure_space(this);
   emit_rex(reg, op, size);
   emit(opcode);
   emit_operand(reg, op);
 }
 
-void Assembler::arithmetic_op(byte opcode, Register reg, Register rm_reg,
+void Assembler::arithmetic_op(uint8_t opcode, Register reg, Register rm_reg,
                               int size) {
   EnsureSpace ensure_space(this);
   DCHECK_EQ(opcode & 0xC6, 2);
@@ -679,7 +726,8 @@ void Assembler::arithmetic_op(byte opcode, Register reg, Register rm_reg,
   }
 }
 
-void Assembler::arithmetic_op_16(byte opcode, Register reg, Register rm_reg) {
+void Assembler::arithmetic_op_16(uint8_t opcode, Register reg,
+                                 Register rm_reg) {
   EnsureSpace ensure_space(this);
   DCHECK_EQ(opcode & 0xC6, 2);
   if (rm_reg.low_bits() == 4) {  // Forces SIB byte.
@@ -696,7 +744,7 @@ void Assembler::arithmetic_op_16(byte opcode, Register reg, Register rm_reg) {
   }
 }
 
-void Assembler::arithmetic_op_16(byte opcode, Register reg, Operand rm_reg) {
+void Assembler::arithmetic_op_16(uint8_t opcode, Register reg, Operand rm_reg) {
   EnsureSpace ensure_space(this);
   emit(0x66);
   emit_optional_rex_32(reg, rm_reg);
@@ -704,7 +752,7 @@ void Assembler::arithmetic_op_16(byte opcode, Register reg, Operand rm_reg) {
   emit_operand(reg, rm_reg);
 }
 
-void Assembler::arithmetic_op_8(byte opcode, Register reg, Operand op) {
+void Assembler::arithmetic_op_8(uint8_t opcode, Register reg, Operand op) {
   EnsureSpace ensure_space(this);
   if (!reg.is_byte_register()) {
     emit_rex_32(reg, op);
@@ -715,7 +763,7 @@ void Assembler::arithmetic_op_8(byte opcode, Register reg, Operand op) {
   emit_operand(reg, op);
 }
 
-void Assembler::arithmetic_op_8(byte opcode, Register reg, Register rm_reg) {
+void Assembler::arithmetic_op_8(uint8_t opcode, Register reg, Register rm_reg) {
   EnsureSpace ensure_space(this);
   DCHECK_EQ(opcode & 0xC6, 2);
   if (rm_reg.low_bits() == 4) {  // Forces SIB byte.
@@ -736,7 +784,7 @@ void Assembler::arithmetic_op_8(byte opcode, Register reg, Register rm_reg) {
   }
 }
 
-void Assembler::immediate_arithmetic_op(byte subcode, Register dst,
+void Assembler::immediate_arithmetic_op(uint8_t subcode, Register dst,
                                         Immediate src, int size) {
   EnsureSpace ensure_space(this);
   emit_rex(dst, size);
@@ -754,7 +802,7 @@ void Assembler::immediate_arithmetic_op(byte subcode, Register dst,
   }
 }
 
-void Assembler::immediate_arithmetic_op(byte subcode, Operand dst,
+void Assembler::immediate_arithmetic_op(uint8_t subcode, Operand dst,
                                         Immediate src, int size) {
   EnsureSpace ensure_space(this);
   emit_rex(dst, size);
@@ -769,7 +817,7 @@ void Assembler::immediate_arithmetic_op(byte subcode, Operand dst,
   }
 }
 
-void Assembler::immediate_arithmetic_op_16(byte subcode, Register dst,
+void Assembler::immediate_arithmetic_op_16(uint8_t subcode, Register dst,
                                            Immediate src) {
   EnsureSpace ensure_space(this);
   emit(0x66);  // Operand size override prefix.
@@ -788,7 +836,7 @@ void Assembler::immediate_arithmetic_op_16(byte subcode, Register dst,
   }
 }
 
-void Assembler::immediate_arithmetic_op_16(byte subcode, Operand dst,
+void Assembler::immediate_arithmetic_op_16(uint8_t subcode, Operand dst,
                                            Immediate src) {
   EnsureSpace ensure_space(this);
   emit(0x66);  // Operand size override prefix.
@@ -804,7 +852,7 @@ void Assembler::immediate_arithmetic_op_16(byte subcode, Operand dst,
   }
 }
 
-void Assembler::immediate_arithmetic_op_8(byte subcode, Operand dst,
+void Assembler::immediate_arithmetic_op_8(uint8_t subcode, Operand dst,
                                           Immediate src) {
   EnsureSpace ensure_space(this);
   emit_optional_rex_32(dst);
@@ -814,7 +862,7 @@ void Assembler::immediate_arithmetic_op_8(byte subcode, Operand dst,
   emit(src.value_);
 }
 
-void Assembler::immediate_arithmetic_op_8(byte subcode, Register dst,
+void Assembler::immediate_arithmetic_op_8(uint8_t subcode, Register dst,
                                           Immediate src) {
   EnsureSpace ensure_space(this);
   if (!dst.is_byte_register()) {
@@ -1389,18 +1437,19 @@ void Assembler::j(Condition cc, Label* L, Label::Distance distance) {
   } else if (distance == Label::kNear) {
     // 0111 tttn #8-bit disp
     emit(0x70 | cc);
-    byte disp = 0x00;
+    uint8_t disp = 0x00;
     if (L->is_near_linked()) {
       int offset = L->near_link_pos() - pc_offset();
       DCHECK(is_int8(offset));
-      disp = static_cast<byte>(offset & 0xFF);
+      disp = static_cast<uint8_t>(offset & 0xFF);
     }
     L->link_to(pc_offset(), Label::kNear);
     emit(disp);
   } else {
     auto jump_opt = jump_optimization_info();
     if (V8_UNLIKELY(jump_opt)) {
-      if (jump_opt->is_optimizing() && is_optimizable_farjmp(farjmp_num_++)) {
+      if (jump_opt->is_optimizing() &&
+          is_optimizable_farjmp(jump_opt->farjmp_num++)) {
         // 0111 tttn #8-bit disp
         emit(0x70 | cc);
         record_farjmp_position(L, pc_offset());
@@ -1408,7 +1457,7 @@ void Assembler::j(Condition cc, Label* L, Label::Distance distance) {
         return;
       }
       if (jump_opt->is_collecting()) {
-        farjmp_positions_.push_back(pc_offset() + 2);
+        jump_opt->farjmps.push_back({pc_offset(), 2, 0});
       }
     }
     if (L->is_linked()) {
@@ -1418,6 +1467,9 @@ void Assembler::j(Condition cc, Label* L, Label::Distance distance) {
       emitl(L->pos());
       L->link_to(pc_offset() - sizeof(int32_t));
     } else {
+      // If this fires a near label is reused for a far jump, missing an
+      // optimization opportunity.
+      DCHECK(!L->is_near_linked());
       DCHECK(L->is_unused());
       emit(0x0F);
       emit(0x80 | cc);
@@ -1480,25 +1532,26 @@ void Assembler::jmp(Label* L, Label::Distance distance) {
   EnsureSpace ensure_space(this);
   if (distance == Label::kNear) {
     emit(0xEB);
-    byte disp = 0x00;
+    uint8_t disp = 0x00;
     if (L->is_near_linked()) {
       int offset = L->near_link_pos() - pc_offset();
       DCHECK(is_int8(offset));
-      disp = static_cast<byte>(offset & 0xFF);
+      disp = static_cast<uint8_t>(offset & 0xFF);
     }
     L->link_to(pc_offset(), Label::kNear);
     emit(disp);
   } else {
     auto jump_opt = jump_optimization_info();
     if (V8_UNLIKELY(jump_opt)) {
-      if (jump_opt->is_optimizing() && is_optimizable_farjmp(farjmp_num_++)) {
+      if (jump_opt->is_optimizing() &&
+          is_optimizable_farjmp(jump_opt->farjmp_num++)) {
         emit(0xEB);
         record_farjmp_position(L, pc_offset());
         emit(0);
         return;
       }
       if (jump_opt->is_collecting()) {
-        farjmp_positions_.push_back(pc_offset() + 1);
+        jump_opt->farjmps.push_back({pc_offset(), 1, 0});
       }
     }
     if (L->is_linked()) {
@@ -1508,6 +1561,9 @@ void Assembler::jmp(Label* L, Label::Distance distance) {
       L->link_to(pc_offset() - long_size);
     } else {
       // 1110 1001 #32-bit disp.
+      // If this fires a near label is reused for a far jump, missing an
+      // optimization opportunity.
+      DCHECK(!L->is_near_linked());
       DCHECK(L->is_unused());
       emit(0xE9);
       int32_t current = pc_offset();
@@ -1605,7 +1661,7 @@ void Assembler::movb(Operand dst, Immediate imm) {
   emit_optional_rex_32(dst);
   emit(0xC6);
   emit_operand(0x0, dst);
-  emit(static_cast<byte>(imm.value_));
+  emit(static_cast<uint8_t>(imm.value_));
 }
 
 void Assembler::movw(Register dst, Operand src) {
@@ -1630,8 +1686,8 @@ void Assembler::movw(Operand dst, Immediate imm) {
   emit_optional_rex_32(dst);
   emit(0xC7);
   emit_operand(0x0, dst);
-  emit(static_cast<byte>(imm.value_ & 0xFF));
-  emit(static_cast<byte>(imm.value_ >> 8));
+  emit(static_cast<uint8_t>(imm.value_ & 0xFF));
+  emit(static_cast<uint8_t>(imm.value_ >> 8));
 }
 
 void Assembler::emit_mov(Register dst, Operand src, int size) {
@@ -2927,13 +2983,13 @@ void Assembler::pinsrb(XMMRegister dst, Operand src, uint8_t imm8) {
   emit(imm8);
 }
 
-void Assembler::insertps(XMMRegister dst, XMMRegister src, byte imm8) {
+void Assembler::insertps(XMMRegister dst, XMMRegister src, uint8_t imm8) {
   DCHECK(is_uint8(imm8));
   sse4_instr(dst, src, 0x66, 0x0F, 0x3A, 0x21);
   emit(imm8);
 }
 
-void Assembler::insertps(XMMRegister dst, Operand src, byte imm8) {
+void Assembler::insertps(XMMRegister dst, Operand src, uint8_t imm8) {
   DCHECK(is_uint8(imm8));
   sse4_instr(dst, src, 0x66, 0x0F, 0x3A, 0x21);
   emit(imm8);
@@ -2995,7 +3051,7 @@ void Assembler::movaps(XMMRegister dst, Operand src) {
   emit_sse_operand(dst, src);
 }
 
-void Assembler::shufps(XMMRegister dst, XMMRegister src, byte imm8) {
+void Assembler::shufps(XMMRegister dst, XMMRegister src, uint8_t imm8) {
   DCHECK(is_uint8(imm8));
   EnsureSpace ensure_space(this);
   emit_optional_rex_32(dst, src);
@@ -3421,42 +3477,42 @@ void Assembler::roundss(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   DCHECK(!IsEnabled(AVX));
   sse4_instr(dst, src, 0x66, 0x0F, 0x3A, 0x0A);
   // Mask precision exception.
-  emit(static_cast<byte>(mode) | 0x8);
+  emit(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::roundss(XMMRegister dst, Operand src, RoundingMode mode) {
   DCHECK(!IsEnabled(AVX));
   sse4_instr(dst, src, 0x66, 0x0F, 0x3A, 0x0A);
   // Mask precision exception.
-  emit(static_cast<byte>(mode) | 0x8);
+  emit(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::roundsd(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   DCHECK(!IsEnabled(AVX));
   sse4_instr(dst, src, 0x66, 0x0F, 0x3A, 0x0B);
   // Mask precision exception.
-  emit(static_cast<byte>(mode) | 0x8);
+  emit(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::roundsd(XMMRegister dst, Operand src, RoundingMode mode) {
   DCHECK(!IsEnabled(AVX));
   sse4_instr(dst, src, 0x66, 0x0F, 0x3A, 0x0B);
   // Mask precision exception.
-  emit(static_cast<byte>(mode) | 0x8);
+  emit(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::roundps(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   DCHECK(!IsEnabled(AVX));
   sse4_instr(dst, src, 0x66, 0x0F, 0x3A, 0x08);
   // Mask precision exception.
-  emit(static_cast<byte>(mode) | 0x8);
+  emit(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::roundpd(XMMRegister dst, XMMRegister src, RoundingMode mode) {
   DCHECK(!IsEnabled(AVX));
   sse4_instr(dst, src, 0x66, 0x0F, 0x3A, 0x09);
   // Mask precision exception.
-  emit(static_cast<byte>(mode) | 0x8);
+  emit(static_cast<uint8_t>(mode) | 0x8);
 }
 
 void Assembler::movmskpd(Register dst, XMMRegister src) {
@@ -3514,26 +3570,48 @@ VMOV_DUP(XMMRegister, L128)
 VMOV_DUP(YMMRegister, L256)
 #undef VMOV_DUP
 
-#define BROADCASTSS(SIMDRegister, length)                           \
-  void Assembler::vbroadcastss(SIMDRegister dst, Operand src) {     \
-    DCHECK(IsEnabled(AVX));                                         \
-    EnsureSpace ensure_space(this);                                 \
-    emit_vex_prefix(dst, xmm0, src, k##length, k66, k0F38, kW0);    \
-    emit(0x18);                                                     \
-    emit_sse_operand(dst, src);                                     \
-  }                                                                 \
-  void Assembler::vbroadcastss(SIMDRegister dst, XMMRegister src) { \
-    DCHECK(IsEnabled(AVX2));                                        \
-    EnsureSpace ensure_space(this);                                 \
-    emit_vex_prefix(dst, xmm0, src, k##length, k66, k0F38, kW0);    \
-    emit(0x18);                                                     \
-    emit_sse_operand(dst, src);                                     \
+#define BROADCAST(suffix, SIMDRegister, length, opcode)                   \
+  void Assembler::vbroadcast##suffix(SIMDRegister dst, Operand src) {     \
+    DCHECK(IsEnabled(AVX));                                               \
+    EnsureSpace ensure_space(this);                                       \
+    emit_vex_prefix(dst, xmm0, src, k##length, k66, k0F38, kW0);          \
+    emit(0x##opcode);                                                     \
+    emit_sse_operand(dst, src);                                           \
+  }                                                                       \
+  void Assembler::vbroadcast##suffix(SIMDRegister dst, XMMRegister src) { \
+    DCHECK(IsEnabled(AVX2));                                              \
+    EnsureSpace ensure_space(this);                                       \
+    emit_vex_prefix(dst, xmm0, src, k##length, k66, k0F38, kW0);          \
+    emit(0x##opcode);                                                     \
+    emit_sse_operand(dst, src);                                           \
   }
-BROADCASTSS(XMMRegister, L128)
-BROADCASTSS(YMMRegister, L256)
-#undef BROADCASTSS
+BROADCAST(ss, XMMRegister, L128, 18)
+BROADCAST(ss, YMMRegister, L256, 18)
+BROADCAST(sd, YMMRegister, L256, 19)
+#undef BROADCAST
 
-void Assembler::fma_instr(byte op, XMMRegister dst, XMMRegister src1,
+void Assembler::vinserti128(YMMRegister dst, YMMRegister src1, XMMRegister src2,
+                            uint8_t imm8) {
+  DCHECK(IsEnabled(AVX2));
+  EnsureSpace ensure_space(this);
+  emit_vex_prefix(dst, src1, src2, kL256, k66, k0F3A, kW0);
+  emit(0x38);
+  emit_sse_operand(dst, src2);
+  emit(imm8);
+}
+
+void Assembler::vperm2f128(YMMRegister dst, YMMRegister src1, YMMRegister src2,
+                           uint8_t imm8) {
+  DCHECK(IsEnabled(AVX));
+  DCHECK(is_uint8(imm8));
+  EnsureSpace ensure_space(this);
+  emit_vex_prefix(dst, src1, src2, kL256, k66, k0F3A, kW0);
+  emit(0x06);
+  emit_sse_operand(dst, src2);
+  emit(imm8);
+}
+
+void Assembler::fma_instr(uint8_t op, XMMRegister dst, XMMRegister src1,
                           XMMRegister src2, VectorLength l, SIMDPrefix pp,
                           LeadingOpcode m, VexW w) {
   DCHECK(IsEnabled(FMA3));
@@ -3543,7 +3621,7 @@ void Assembler::fma_instr(byte op, XMMRegister dst, XMMRegister src1,
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::fma_instr(byte op, XMMRegister dst, XMMRegister src1,
+void Assembler::fma_instr(uint8_t op, XMMRegister dst, XMMRegister src1,
                           Operand src2, VectorLength l, SIMDPrefix pp,
                           LeadingOpcode m, VexW w) {
   DCHECK(IsEnabled(FMA3));
@@ -3717,7 +3795,7 @@ void Assembler::vmovhps(Operand dst, XMMRegister src) {
   emit_sse_operand(src, dst);
 }
 
-void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1,
+void Assembler::vinstr(uint8_t op, XMMRegister dst, XMMRegister src1,
                        XMMRegister src2, SIMDPrefix pp, LeadingOpcode m, VexW w,
                        CpuFeature feature) {
   DCHECK(IsEnabled(feature));
@@ -3728,8 +3806,8 @@ void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1,
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
-                       SIMDPrefix pp, LeadingOpcode m, VexW w,
+void Assembler::vinstr(uint8_t op, XMMRegister dst, XMMRegister src1,
+                       Operand src2, SIMDPrefix pp, LeadingOpcode m, VexW w,
                        CpuFeature feature) {
   DCHECK(IsEnabled(feature));
   DCHECK(feature == AVX || feature == AVX2);
@@ -3740,10 +3818,12 @@ void Assembler::vinstr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
 }
 
 template <typename Reg1, typename Reg2, typename Op>
-void Assembler::vinstr(byte op, Reg1 dst, Reg2 src1, Op src2, SIMDPrefix pp,
+void Assembler::vinstr(uint8_t op, Reg1 dst, Reg2 src1, Op src2, SIMDPrefix pp,
                        LeadingOpcode m, VexW w, CpuFeature feature) {
   DCHECK(IsEnabled(feature));
   DCHECK(feature == AVX || feature == AVX2);
+  DCHECK(
+      (std::is_same_v<Reg1, YMMRegister> || std::is_same_v<Reg2, YMMRegister>));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(dst, src1, src2, kL256, pp, m, w);
   emit(op);
@@ -3751,22 +3831,25 @@ void Assembler::vinstr(byte op, Reg1 dst, Reg2 src1, Op src2, SIMDPrefix pp,
 }
 
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Assembler::vinstr(
-    byte op, YMMRegister dst, YMMRegister src1, YMMRegister src2, SIMDPrefix pp,
-    LeadingOpcode m, VexW w, CpuFeature feature);
+    uint8_t op, YMMRegister dst, YMMRegister src1, YMMRegister src2,
+    SIMDPrefix pp, LeadingOpcode m, VexW w, CpuFeature feature);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Assembler::vinstr(
-    byte op, YMMRegister dst, XMMRegister src1, XMMRegister src2, SIMDPrefix pp,
-    LeadingOpcode m, VexW w, CpuFeature feature);
+    uint8_t op, YMMRegister dst, XMMRegister src1, XMMRegister src2,
+    SIMDPrefix pp, LeadingOpcode m, VexW w, CpuFeature feature);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Assembler::vinstr(
-    byte op, YMMRegister dst, YMMRegister src1, Operand src2, SIMDPrefix pp,
+    uint8_t op, YMMRegister dst, YMMRegister src1, Operand src2, SIMDPrefix pp,
     LeadingOpcode m, VexW w, CpuFeature feature);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Assembler::vinstr(
-    byte op, YMMRegister dst, YMMRegister src1, XMMRegister src2, SIMDPrefix pp,
-    LeadingOpcode m, VexW w, CpuFeature feature);
+    uint8_t op, YMMRegister dst, YMMRegister src1, XMMRegister src2,
+    SIMDPrefix pp, LeadingOpcode m, VexW w, CpuFeature feature);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Assembler::vinstr(
-    byte op, YMMRegister dst, XMMRegister src1, Operand src2, SIMDPrefix pp,
+    uint8_t op, YMMRegister dst, XMMRegister src1, Operand src2, SIMDPrefix pp,
     LeadingOpcode m, VexW w, CpuFeature feature);
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Assembler::vinstr(
+    uint8_t op, YMMRegister dst, XMMRegister src1, YMMRegister src2,
+    SIMDPrefix pp, LeadingOpcode m, VexW w, CpuFeature feature);
 
-void Assembler::vps(byte op, XMMRegister dst, XMMRegister src1,
+void Assembler::vps(uint8_t op, XMMRegister dst, XMMRegister src1,
                     XMMRegister src2) {
   DCHECK(IsEnabled(AVX));
   EnsureSpace ensure_space(this);
@@ -3775,7 +3858,7 @@ void Assembler::vps(byte op, XMMRegister dst, XMMRegister src1,
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::vps(byte op, YMMRegister dst, YMMRegister src1,
+void Assembler::vps(uint8_t op, YMMRegister dst, YMMRegister src1,
                     YMMRegister src2) {
   DCHECK(IsEnabled(AVX));
   EnsureSpace ensure_space(this);
@@ -3784,7 +3867,8 @@ void Assembler::vps(byte op, YMMRegister dst, YMMRegister src1,
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::vps(byte op, XMMRegister dst, XMMRegister src1, Operand src2) {
+void Assembler::vps(uint8_t op, XMMRegister dst, XMMRegister src1,
+                    Operand src2) {
   DCHECK(IsEnabled(AVX));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(dst, src1, src2, kL128, kNoPrefix, k0F, kWIG);
@@ -3792,7 +3876,8 @@ void Assembler::vps(byte op, XMMRegister dst, XMMRegister src1, Operand src2) {
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::vps(byte op, YMMRegister dst, YMMRegister src1, Operand src2) {
+void Assembler::vps(uint8_t op, YMMRegister dst, YMMRegister src1,
+                    Operand src2) {
   DCHECK(IsEnabled(AVX));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(dst, src1, src2, kL256, kNoPrefix, k0F, kWIG);
@@ -3800,8 +3885,8 @@ void Assembler::vps(byte op, YMMRegister dst, YMMRegister src1, Operand src2) {
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::vps(byte op, XMMRegister dst, XMMRegister src1,
-                    XMMRegister src2, byte imm8) {
+void Assembler::vps(uint8_t op, XMMRegister dst, XMMRegister src1,
+                    XMMRegister src2, uint8_t imm8) {
   DCHECK(IsEnabled(AVX));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(dst, src1, src2, kL128, kNoPrefix, k0F, kWIG);
@@ -3810,8 +3895,8 @@ void Assembler::vps(byte op, XMMRegister dst, XMMRegister src1,
   emit(imm8);
 }
 
-void Assembler::vps(byte op, YMMRegister dst, YMMRegister src1,
-                    YMMRegister src2, byte imm8) {
+void Assembler::vps(uint8_t op, YMMRegister dst, YMMRegister src1,
+                    YMMRegister src2, uint8_t imm8) {
   DCHECK(IsEnabled(AVX));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(dst, src1, src2, kL256, kNoPrefix, k0F, kWIG);
@@ -3820,23 +3905,23 @@ void Assembler::vps(byte op, YMMRegister dst, YMMRegister src1,
   emit(imm8);
 }
 
-#define VPD(DSTRegister, SRCRegister, length)                     \
-  void Assembler::vpd(byte op, DSTRegister dst, SRCRegister src1, \
-                      SRCRegister src2) {                         \
-    DCHECK(IsEnabled(AVX));                                       \
-    EnsureSpace ensure_space(this);                               \
-    emit_vex_prefix(dst, src1, src2, k##length, k66, k0F, kWIG);  \
-    emit(op);                                                     \
-    emit_sse_operand(dst, src2);                                  \
-  }                                                               \
-                                                                  \
-  void Assembler::vpd(byte op, DSTRegister dst, SRCRegister src1, \
-                      Operand src2) {                             \
-    DCHECK(IsEnabled(AVX));                                       \
-    EnsureSpace ensure_space(this);                               \
-    emit_vex_prefix(dst, src1, src2, k##length, k66, k0F, kWIG);  \
-    emit(op);                                                     \
-    emit_sse_operand(dst, src2);                                  \
+#define VPD(DSTRegister, SRCRegister, length)                        \
+  void Assembler::vpd(uint8_t op, DSTRegister dst, SRCRegister src1, \
+                      SRCRegister src2) {                            \
+    DCHECK(IsEnabled(AVX));                                          \
+    EnsureSpace ensure_space(this);                                  \
+    emit_vex_prefix(dst, src1, src2, k##length, k66, k0F, kWIG);     \
+    emit(op);                                                        \
+    emit_sse_operand(dst, src2);                                     \
+  }                                                                  \
+                                                                     \
+  void Assembler::vpd(uint8_t op, DSTRegister dst, SRCRegister src1, \
+                      Operand src2) {                                \
+    DCHECK(IsEnabled(AVX));                                          \
+    EnsureSpace ensure_space(this);                                  \
+    emit_vex_prefix(dst, src1, src2, k##length, k66, k0F, kWIG);     \
+    emit(op);                                                        \
+    emit_sse_operand(dst, src2);                                     \
   }
 VPD(XMMRegister, XMMRegister, L128)
 VPD(XMMRegister, YMMRegister, L256)
@@ -3868,7 +3953,7 @@ void Assembler::vpmovmskb(Register dst, XMMRegister src) {
   emit_sse_operand(idst, src);
 }
 
-void Assembler::vss(byte op, XMMRegister dst, XMMRegister src1,
+void Assembler::vss(uint8_t op, XMMRegister dst, XMMRegister src1,
                     XMMRegister src2) {
   DCHECK(IsEnabled(AVX));
   EnsureSpace ensure_space(this);
@@ -3877,7 +3962,8 @@ void Assembler::vss(byte op, XMMRegister dst, XMMRegister src1,
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::vss(byte op, XMMRegister dst, XMMRegister src1, Operand src2) {
+void Assembler::vss(uint8_t op, XMMRegister dst, XMMRegister src1,
+                    Operand src2) {
   DCHECK(IsEnabled(AVX));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(dst, src1, src2, kLIG, kF3, k0F, kWIG);
@@ -3885,7 +3971,7 @@ void Assembler::vss(byte op, XMMRegister dst, XMMRegister src1, Operand src2) {
   emit_sse_operand(dst, src2);
 }
 
-void Assembler::bmi1q(byte op, Register reg, Register vreg, Register rm) {
+void Assembler::bmi1q(uint8_t op, Register reg, Register vreg, Register rm) {
   DCHECK(IsEnabled(BMI1));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(reg, vreg, rm, kLZ, kNoPrefix, k0F38, kW1);
@@ -3893,7 +3979,7 @@ void Assembler::bmi1q(byte op, Register reg, Register vreg, Register rm) {
   emit_modrm(reg, rm);
 }
 
-void Assembler::bmi1q(byte op, Register reg, Register vreg, Operand rm) {
+void Assembler::bmi1q(uint8_t op, Register reg, Register vreg, Operand rm) {
   DCHECK(IsEnabled(BMI1));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(reg, vreg, rm, kLZ, kNoPrefix, k0F38, kW1);
@@ -3901,7 +3987,7 @@ void Assembler::bmi1q(byte op, Register reg, Register vreg, Operand rm) {
   emit_operand(reg, rm);
 }
 
-void Assembler::bmi1l(byte op, Register reg, Register vreg, Register rm) {
+void Assembler::bmi1l(uint8_t op, Register reg, Register vreg, Register rm) {
   DCHECK(IsEnabled(BMI1));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(reg, vreg, rm, kLZ, kNoPrefix, k0F38, kW0);
@@ -3909,7 +3995,7 @@ void Assembler::bmi1l(byte op, Register reg, Register vreg, Register rm) {
   emit_modrm(reg, rm);
 }
 
-void Assembler::bmi1l(byte op, Register reg, Register vreg, Operand rm) {
+void Assembler::bmi1l(uint8_t op, Register reg, Register vreg, Operand rm) {
   DCHECK(IsEnabled(BMI1));
   EnsureSpace ensure_space(this);
   emit_vex_prefix(reg, vreg, rm, kLZ, kNoPrefix, k0F38, kW0);
@@ -4037,7 +4123,7 @@ void Assembler::popcntl(Register dst, Operand src) {
   emit_operand(dst, src);
 }
 
-void Assembler::bmi2q(SIMDPrefix pp, byte op, Register reg, Register vreg,
+void Assembler::bmi2q(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
                       Register rm) {
   DCHECK(IsEnabled(BMI2));
   EnsureSpace ensure_space(this);
@@ -4046,7 +4132,7 @@ void Assembler::bmi2q(SIMDPrefix pp, byte op, Register reg, Register vreg,
   emit_modrm(reg, rm);
 }
 
-void Assembler::bmi2q(SIMDPrefix pp, byte op, Register reg, Register vreg,
+void Assembler::bmi2q(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
                       Operand rm) {
   DCHECK(IsEnabled(BMI2));
   EnsureSpace ensure_space(this);
@@ -4055,7 +4141,7 @@ void Assembler::bmi2q(SIMDPrefix pp, byte op, Register reg, Register vreg,
   emit_operand(reg, rm);
 }
 
-void Assembler::bmi2l(SIMDPrefix pp, byte op, Register reg, Register vreg,
+void Assembler::bmi2l(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
                       Register rm) {
   DCHECK(IsEnabled(BMI2));
   EnsureSpace ensure_space(this);
@@ -4064,7 +4150,7 @@ void Assembler::bmi2l(SIMDPrefix pp, byte op, Register reg, Register vreg,
   emit_modrm(reg, rm);
 }
 
-void Assembler::bmi2l(SIMDPrefix pp, byte op, Register reg, Register vreg,
+void Assembler::bmi2l(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
                       Operand rm) {
   DCHECK(IsEnabled(BMI2));
   EnsureSpace ensure_space(this);
@@ -4073,7 +4159,7 @@ void Assembler::bmi2l(SIMDPrefix pp, byte op, Register reg, Register vreg,
   emit_operand(reg, rm);
 }
 
-void Assembler::rorxq(Register dst, Register src, byte imm8) {
+void Assembler::rorxq(Register dst, Register src, uint8_t imm8) {
   DCHECK(IsEnabled(BMI2));
   DCHECK(is_uint8(imm8));
   Register vreg = Register::from_code(0);  // VEX.vvvv unused
@@ -4084,7 +4170,7 @@ void Assembler::rorxq(Register dst, Register src, byte imm8) {
   emit(imm8);
 }
 
-void Assembler::rorxq(Register dst, Operand src, byte imm8) {
+void Assembler::rorxq(Register dst, Operand src, uint8_t imm8) {
   DCHECK(IsEnabled(BMI2));
   DCHECK(is_uint8(imm8));
   Register vreg = Register::from_code(0);  // VEX.vvvv unused
@@ -4095,7 +4181,7 @@ void Assembler::rorxq(Register dst, Operand src, byte imm8) {
   emit(imm8);
 }
 
-void Assembler::rorxl(Register dst, Register src, byte imm8) {
+void Assembler::rorxl(Register dst, Register src, uint8_t imm8) {
   DCHECK(IsEnabled(BMI2));
   DCHECK(is_uint8(imm8));
   Register vreg = Register::from_code(0);  // VEX.vvvv unused
@@ -4106,7 +4192,7 @@ void Assembler::rorxl(Register dst, Register src, byte imm8) {
   emit(imm8);
 }
 
-void Assembler::rorxl(Register dst, Operand src, byte imm8) {
+void Assembler::rorxl(Register dst, Operand src, uint8_t imm8) {
   DCHECK(IsEnabled(BMI2));
   DCHECK(is_uint8(imm8));
   Register vreg = Register::from_code(0);  // VEX.vvvv unused
@@ -4154,8 +4240,8 @@ void Assembler::movups(Operand dst, XMMRegister src) {
   emit_sse_operand(src, dst);
 }
 
-void Assembler::sse_instr(XMMRegister dst, XMMRegister src, byte escape,
-                          byte opcode) {
+void Assembler::sse_instr(XMMRegister dst, XMMRegister src, uint8_t escape,
+                          uint8_t opcode) {
   EnsureSpace ensure_space(this);
   emit_optional_rex_32(dst, src);
   emit(escape);
@@ -4163,8 +4249,8 @@ void Assembler::sse_instr(XMMRegister dst, XMMRegister src, byte escape,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse_instr(XMMRegister dst, Operand src, byte escape,
-                          byte opcode) {
+void Assembler::sse_instr(XMMRegister dst, Operand src, uint8_t escape,
+                          uint8_t opcode) {
   EnsureSpace ensure_space(this);
   emit_optional_rex_32(dst, src);
   emit(escape);
@@ -4172,8 +4258,8 @@ void Assembler::sse_instr(XMMRegister dst, Operand src, byte escape,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse2_instr(XMMRegister dst, XMMRegister src, byte prefix,
-                           byte escape, byte opcode) {
+void Assembler::sse2_instr(XMMRegister dst, XMMRegister src, uint8_t prefix,
+                           uint8_t escape, uint8_t opcode) {
   EnsureSpace ensure_space(this);
   emit(prefix);
   emit_optional_rex_32(dst, src);
@@ -4182,8 +4268,8 @@ void Assembler::sse2_instr(XMMRegister dst, XMMRegister src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse2_instr(XMMRegister dst, Operand src, byte prefix,
-                           byte escape, byte opcode) {
+void Assembler::sse2_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                           uint8_t escape, uint8_t opcode) {
   EnsureSpace ensure_space(this);
   emit(prefix);
   emit_optional_rex_32(dst, src);
@@ -4192,8 +4278,8 @@ void Assembler::sse2_instr(XMMRegister dst, Operand src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::ssse3_instr(XMMRegister dst, XMMRegister src, byte prefix,
-                            byte escape1, byte escape2, byte opcode) {
+void Assembler::ssse3_instr(XMMRegister dst, XMMRegister src, uint8_t prefix,
+                            uint8_t escape1, uint8_t escape2, uint8_t opcode) {
   DCHECK(IsEnabled(SSSE3));
   EnsureSpace ensure_space(this);
   emit(prefix);
@@ -4204,8 +4290,8 @@ void Assembler::ssse3_instr(XMMRegister dst, XMMRegister src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::ssse3_instr(XMMRegister dst, Operand src, byte prefix,
-                            byte escape1, byte escape2, byte opcode) {
+void Assembler::ssse3_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                            uint8_t escape1, uint8_t escape2, uint8_t opcode) {
   DCHECK(IsEnabled(SSSE3));
   EnsureSpace ensure_space(this);
   emit(prefix);
@@ -4216,8 +4302,8 @@ void Assembler::ssse3_instr(XMMRegister dst, Operand src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse4_instr(XMMRegister dst, Register src, byte prefix,
-                           byte escape1, byte escape2, byte opcode,
+void Assembler::sse4_instr(XMMRegister dst, Register src, uint8_t prefix,
+                           uint8_t escape1, uint8_t escape2, uint8_t opcode,
                            int8_t imm8) {
   DCHECK(is_uint8(imm8));
   DCHECK(IsEnabled(SSE4_1));
@@ -4231,8 +4317,8 @@ void Assembler::sse4_instr(XMMRegister dst, Register src, byte prefix,
   emit(imm8);
 }
 
-void Assembler::sse4_instr(XMMRegister dst, XMMRegister src, byte prefix,
-                           byte escape1, byte escape2, byte opcode) {
+void Assembler::sse4_instr(XMMRegister dst, XMMRegister src, uint8_t prefix,
+                           uint8_t escape1, uint8_t escape2, uint8_t opcode) {
   DCHECK(IsEnabled(SSE4_1));
   EnsureSpace ensure_space(this);
   emit(prefix);
@@ -4243,8 +4329,8 @@ void Assembler::sse4_instr(XMMRegister dst, XMMRegister src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse4_instr(XMMRegister dst, Operand src, byte prefix,
-                           byte escape1, byte escape2, byte opcode) {
+void Assembler::sse4_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                           uint8_t escape1, uint8_t escape2, uint8_t opcode) {
   DCHECK(IsEnabled(SSE4_1));
   EnsureSpace ensure_space(this);
   emit(prefix);
@@ -4255,8 +4341,8 @@ void Assembler::sse4_instr(XMMRegister dst, Operand src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse4_instr(Register dst, XMMRegister src, byte prefix,
-                           byte escape1, byte escape2, byte opcode,
+void Assembler::sse4_instr(Register dst, XMMRegister src, uint8_t prefix,
+                           uint8_t escape1, uint8_t escape2, uint8_t opcode,
                            int8_t imm8) {
   DCHECK(is_uint8(imm8));
   DCHECK(IsEnabled(SSE4_1));
@@ -4270,8 +4356,8 @@ void Assembler::sse4_instr(Register dst, XMMRegister src, byte prefix,
   emit(imm8);
 }
 
-void Assembler::sse4_instr(Operand dst, XMMRegister src, byte prefix,
-                           byte escape1, byte escape2, byte opcode,
+void Assembler::sse4_instr(Operand dst, XMMRegister src, uint8_t prefix,
+                           uint8_t escape1, uint8_t escape2, uint8_t opcode,
                            int8_t imm8) {
   DCHECK(is_uint8(imm8));
   DCHECK(IsEnabled(SSE4_1));
@@ -4285,8 +4371,8 @@ void Assembler::sse4_instr(Operand dst, XMMRegister src, byte prefix,
   emit(imm8);
 }
 
-void Assembler::sse4_2_instr(XMMRegister dst, XMMRegister src, byte prefix,
-                             byte escape1, byte escape2, byte opcode) {
+void Assembler::sse4_2_instr(XMMRegister dst, XMMRegister src, uint8_t prefix,
+                             uint8_t escape1, uint8_t escape2, uint8_t opcode) {
   DCHECK(IsEnabled(SSE4_2));
   EnsureSpace ensure_space(this);
   emit(prefix);
@@ -4297,8 +4383,8 @@ void Assembler::sse4_2_instr(XMMRegister dst, XMMRegister src, byte prefix,
   emit_sse_operand(dst, src);
 }
 
-void Assembler::sse4_2_instr(XMMRegister dst, Operand src, byte prefix,
-                             byte escape1, byte escape2, byte opcode) {
+void Assembler::sse4_2_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                             uint8_t escape1, uint8_t escape2, uint8_t opcode) {
   DCHECK(IsEnabled(SSE4_2));
   EnsureSpace ensure_space(this);
   emit(prefix);
@@ -4449,21 +4535,13 @@ void Assembler::db(uint8_t data) {
   emit(data);
 }
 
-void Assembler::dd(uint32_t data, RelocInfo::Mode rmode) {
+void Assembler::dd(uint32_t data) {
   EnsureSpace ensure_space(this);
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   emitl(data);
 }
 
-void Assembler::dq(uint64_t data, RelocInfo::Mode rmode) {
+void Assembler::dq(uint64_t data) {
   EnsureSpace ensure_space(this);
-  if (!RelocInfo::IsNoInfo(rmode)) {
-    DCHECK(RelocInfo::IsLiteralConstant(rmode));
-    RecordRelocInfo(rmode);
-  }
   emitq(data);
 }
 
@@ -4488,12 +4566,19 @@ void Assembler::dq(Label* label) {
   }
 }
 
+void Assembler::WriteBuiltinJumpTableEntry(Label* label, const int table_pos) {
+  EnsureSpace ensure_space(this);
+  CHECK(label->is_bound());
+  int32_t value = label->pos() - table_pos;
+  RecordRelocInfo(RelocInfo::RELATIVE_SWITCH_TABLE_ENTRY, label->pos());
+  emitl(value);
+}
+
 // Relocation information implementations.
 
 void Assembler::RecordRelocInfo(RelocInfo::Mode rmode, intptr_t data) {
   if (!ShouldRecordRelocInfo(rmode)) return;
-  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data, Code(),
-                  InstructionStream());
+  RelocInfo rinfo(reinterpret_cast<Address>(pc_), rmode, data);
   reloc_info_writer.Write(&rinfo);
 }
 
diff --git a/deps/v8/src/codegen/x64/assembler-x64.h b/deps/v8/src/codegen/x64/assembler-x64.h
index a8b7d775361c74..6c65ea6303aa32 100644
--- a/deps/v8/src/codegen/x64/assembler-x64.h
+++ b/deps/v8/src/codegen/x64/assembler-x64.h
@@ -51,6 +51,7 @@
 #include "src/codegen/x64/register-x64.h"
 #include "src/codegen/x64/sse-instr.h"
 #include "src/objects/smi.h"
+
 #if defined(V8_OS_WIN_X64)
 #include "src/diagnostics/unwinding-info-win64.h"
 #endif
@@ -63,7 +64,7 @@ class MaglevSafepointTableBuilder;
 
 // Utility functions
 
-enum Condition : uint8_t {
+enum Condition : int {
   overflow = 0,
   no_overflow = 1,
   below = 2,
@@ -126,7 +127,7 @@ class Immediate {
   explicit constexpr Immediate(int32_t value) : value_(value) {}
   explicit constexpr Immediate(int32_t value, RelocInfo::Mode rmode)
       : value_(value), rmode_(rmode) {}
-  explicit Immediate(Smi value)
+  explicit Immediate(Tagged<Smi> value)
       : value_(static_cast<int32_t>(static_cast<intptr_t>(value.ptr()))) {
     DCHECK(SmiValuesAre31Bits());  // Only available for 31-bit SMI.
   }
@@ -172,6 +173,7 @@ enum ScaleFactor : int8_t {
   times_half_system_pointer_size = times_4,
   times_system_pointer_size = times_8,
   times_tagged_size = (kTaggedSize == 8) ? times_8 : times_4,
+  times_external_pointer_size = V8_ENABLE_SANDBOX_BOOL ? times_4 : times_8,
 };
 
 class V8_EXPORT_PRIVATE Operand {
@@ -182,7 +184,7 @@ class V8_EXPORT_PRIVATE Operand {
     // introduces additional padding between them and the union, increasing the
     // size unnecessarily.
     bool is_label_operand = true;
-    byte rex = 0;  // REX prefix, always zero for label operands.
+    uint8_t rex = 0;  // REX prefix, always zero for label operands.
 
     int8_t addend;  // Used for rip + offset + addend operands.
     Label* label;
@@ -190,10 +192,10 @@ class V8_EXPORT_PRIVATE Operand {
 
   struct MemoryOperand {
     bool is_label_operand = false;
-    byte rex = 0;  // REX prefix.
+    uint8_t rex = 0;  // REX prefix.
 
     // Register (1 byte) + SIB (0 or 1 byte) + displacement (0, 1, or 4 byte).
-    byte buf[6] = {0};
+    uint8_t buf[6] = {0};
     // Number of bytes of buf in use.
     // We must keep {len} and {buf} together for the compiler to elide the
     // stack canary protection code.
@@ -283,7 +285,7 @@ class V8_EXPORT_PRIVATE Operand {
     return memory_.is_label_operand;
   }
 
-  V8_INLINE constexpr byte rex() const {
+  V8_INLINE constexpr uint8_t rex() const {
     // Since both fields are in the common initial sequence of {label_} and
     // {memory_}, the access is valid regardless of the active union member.
     // Label operands always have a REX prefix of zero.
@@ -494,12 +496,14 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   static constexpr int kNoHandlerTable = 0;
   static constexpr SafepointTableBuilderBase* kNoSafepointTable = nullptr;
 
-  void GetCode(Isolate* isolate, CodeDesc* desc,
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
                SafepointTableBuilderBase* safepoint_table_builder,
                int handler_table_offset);
 
+  // Convenience wrapper for allocating with an Isolate.
+  void GetCode(Isolate* isolate, CodeDesc* desc);
   // Convenience wrapper for code without safepoint or handler tables.
-  void GetCode(Isolate* isolate, CodeDesc* desc) {
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc) {
     GetCode(isolate, desc, kNoSafepointTable, kNoHandlerTable);
   }
 
@@ -530,7 +534,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // This sets the branch destination (which is in the instruction on x64).
   // This is for calls and branches within generated code.
   inline static void deserialization_set_special_target_at(
-      Address instruction_payload, Code code, Address target);
+      Address instruction_payload, Tagged<Code> code, Address target);
 
   // Get the size of the special target encoded at 'instruction_payload'.
   inline static int deserialization_special_target_size(
@@ -548,18 +552,18 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   static constexpr int kSpecialTargetSize = 4;  // 32-bit displacement.
 
   // One byte opcode for test eax,0xXXXXXXXX.
-  static constexpr byte kTestEaxByte = 0xA9;
+  static constexpr uint8_t kTestEaxByte = 0xA9;
   // One byte opcode for test al, 0xXX.
-  static constexpr byte kTestAlByte = 0xA8;
+  static constexpr uint8_t kTestAlByte = 0xA8;
   // One byte opcode for nop.
-  static constexpr byte kNopByte = 0x90;
+  static constexpr uint8_t kNopByte = 0x90;
 
   // One byte prefix for a short conditional jump.
-  static constexpr byte kJccShortPrefix = 0x70;
-  static constexpr byte kJncShortOpcode = kJccShortPrefix | not_carry;
-  static constexpr byte kJcShortOpcode = kJccShortPrefix | carry;
-  static constexpr byte kJnzShortOpcode = kJccShortPrefix | not_zero;
-  static constexpr byte kJzShortOpcode = kJccShortPrefix | zero;
+  static constexpr uint8_t kJccShortPrefix = 0x70;
+  static constexpr uint8_t kJncShortOpcode = kJccShortPrefix | not_carry;
+  static constexpr uint8_t kJcShortOpcode = kJccShortPrefix | carry;
+  static constexpr uint8_t kJnzShortOpcode = kJccShortPrefix | not_zero;
+  static constexpr uint8_t kJzShortOpcode = kJccShortPrefix | zero;
 
   // VEX prefix encodings.
   enum SIMDPrefix { kNoPrefix = 0x0, k66 = 0x1, kF3 = 0x2, kF2 = 0x3 };
@@ -862,6 +866,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void palignr(XMMRegister dst, Operand src, uint8_t mask);
   void palignr(XMMRegister dst, XMMRegister src, uint8_t mask);
 
+  void vpermq(YMMRegister dst, Operand src, uint8_t imm8) {
+    vinstr(0x0, dst, ymm0, src, k66, k0F3A, kW1, AVX2);
+    emit(imm8);
+  }
+  void vpermq(YMMRegister dst, YMMRegister src, uint8_t imm8) {
+    vinstr(0x0, dst, ymm0, src, k66, k0F3A, kW1, AVX2);
+    emit(imm8);
+  }
+
   // Label operations & relative jumps (PPUM Appendix D)
   //
   // Takes a branch opcode (cc) and a label (L) and generates
@@ -1007,7 +1020,7 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void movhps(XMMRegister dst, Operand src);
   void movhps(Operand dst, XMMRegister src);
 
-  void shufps(XMMRegister dst, XMMRegister src, byte imm8);
+  void shufps(XMMRegister dst, XMMRegister src, uint8_t imm8);
 
   void cvttss2si(Register dst, Operand src);
   void cvttss2si(Register dst, XMMRegister src);
@@ -1016,18 +1029,19 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 
   void movmskps(Register dst, XMMRegister src);
 
-  void vinstr(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+  void vinstr(uint8_t op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
               SIMDPrefix pp, LeadingOpcode m, VexW w, CpuFeature feature = AVX);
-  void vinstr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
+  void vinstr(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2,
               SIMDPrefix pp, LeadingOpcode m, VexW w, CpuFeature feature = AVX);
 
   template <typename Reg1, typename Reg2, typename Op>
-  void vinstr(byte op, Reg1 dst, Reg2 src1, Op src2, SIMDPrefix pp,
+  void vinstr(uint8_t op, Reg1 dst, Reg2 src1, Op src2, SIMDPrefix pp,
               LeadingOpcode m, VexW w, CpuFeature feature = AVX2);
 
   // SSE instructions
-  void sse_instr(XMMRegister dst, XMMRegister src, byte escape, byte opcode);
-  void sse_instr(XMMRegister dst, Operand src, byte escape, byte opcode);
+  void sse_instr(XMMRegister dst, XMMRegister src, uint8_t escape,
+                 uint8_t opcode);
+  void sse_instr(XMMRegister dst, Operand src, uint8_t escape, uint8_t opcode);
 #define DECLARE_SSE_INSTRUCTION(instruction, escape, opcode) \
   void instruction(XMMRegister dst, XMMRegister src) {       \
     sse_instr(dst, src, 0x##escape, 0x##opcode);             \
@@ -1041,10 +1055,10 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 #undef DECLARE_SSE_INSTRUCTION
 
   // SSE instructions with prefix and SSE2 instructions
-  void sse2_instr(XMMRegister dst, XMMRegister src, byte prefix, byte escape,
-                  byte opcode);
-  void sse2_instr(XMMRegister dst, Operand src, byte prefix, byte escape,
-                  byte opcode);
+  void sse2_instr(XMMRegister dst, XMMRegister src, uint8_t prefix,
+                  uint8_t escape, uint8_t opcode);
+  void sse2_instr(XMMRegister dst, Operand src, uint8_t prefix, uint8_t escape,
+                  uint8_t opcode);
 #define DECLARE_SSE2_INSTRUCTION(instruction, prefix, escape, opcode) \
   void instruction(XMMRegister dst, XMMRegister src) {                \
     sse2_instr(dst, src, 0x##prefix, 0x##escape, 0x##opcode);         \
@@ -1060,15 +1074,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   SSE2_UNOP_INSTRUCTION_LIST(DECLARE_SSE2_INSTRUCTION)
 #undef DECLARE_SSE2_INSTRUCTION
 
-  void sse2_instr(XMMRegister reg, byte imm8, byte prefix, byte escape,
-                  byte opcode, int extension) {
+  void sse2_instr(XMMRegister reg, uint8_t imm8, uint8_t prefix, uint8_t escape,
+                  uint8_t opcode, int extension) {
     XMMRegister ext_reg = XMMRegister::from_code(extension);
     sse2_instr(ext_reg, reg, prefix, escape, opcode);
     emit(imm8);
   }
 
 #define DECLARE_SSE2_SHIFT_IMM(instruction, prefix, escape, opcode, extension) \
-  void instruction(XMMRegister reg, byte imm8) {                               \
+  void instruction(XMMRegister reg, uint8_t imm8) {                            \
     sse2_instr(reg, imm8, 0x##prefix, 0x##escape, 0x##opcode, 0x##extension);  \
   }
   SSE2_INSTRUCTION_LIST_SHIFT_IMM(DECLARE_SSE2_SHIFT_IMM)
@@ -1156,10 +1170,10 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void movshdup(XMMRegister dst, XMMRegister src);
 
   // SSSE3
-  void ssse3_instr(XMMRegister dst, XMMRegister src, byte prefix, byte escape1,
-                   byte escape2, byte opcode);
-  void ssse3_instr(XMMRegister dst, Operand src, byte prefix, byte escape1,
-                   byte escape2, byte opcode);
+  void ssse3_instr(XMMRegister dst, XMMRegister src, uint8_t prefix,
+                   uint8_t escape1, uint8_t escape2, uint8_t opcode);
+  void ssse3_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                   uint8_t escape1, uint8_t escape2, uint8_t opcode);
 
 #define DECLARE_SSSE3_INSTRUCTION(instruction, prefix, escape1, escape2,     \
                                   opcode)                                    \
@@ -1175,16 +1189,18 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 #undef DECLARE_SSSE3_INSTRUCTION
 
   // SSE4
-  void sse4_instr(Register dst, XMMRegister src, byte prefix, byte escape1,
-                  byte escape2, byte opcode, int8_t imm8);
-  void sse4_instr(Operand dst, XMMRegister src, byte prefix, byte escape1,
-                  byte escape2, byte opcode, int8_t imm8);
-  void sse4_instr(XMMRegister dst, Register src, byte prefix, byte escape1,
-                  byte escape2, byte opcode, int8_t imm8);
-  void sse4_instr(XMMRegister dst, XMMRegister src, byte prefix, byte escape1,
-                  byte escape2, byte opcode);
-  void sse4_instr(XMMRegister dst, Operand src, byte prefix, byte escape1,
-                  byte escape2, byte opcode);
+  void sse4_instr(Register dst, XMMRegister src, uint8_t prefix,
+                  uint8_t escape1, uint8_t escape2, uint8_t opcode,
+                  int8_t imm8);
+  void sse4_instr(Operand dst, XMMRegister src, uint8_t prefix, uint8_t escape1,
+                  uint8_t escape2, uint8_t opcode, int8_t imm8);
+  void sse4_instr(XMMRegister dst, Register src, uint8_t prefix,
+                  uint8_t escape1, uint8_t escape2, uint8_t opcode,
+                  int8_t imm8);
+  void sse4_instr(XMMRegister dst, XMMRegister src, uint8_t prefix,
+                  uint8_t escape1, uint8_t escape2, uint8_t opcode);
+  void sse4_instr(XMMRegister dst, Operand src, uint8_t prefix, uint8_t escape1,
+                  uint8_t escape2, uint8_t opcode);
 #define DECLARE_SSE4_INSTRUCTION(instruction, prefix, escape1, escape2,     \
                                  opcode)                                    \
   void instruction(XMMRegister dst, XMMRegister src) {                      \
@@ -1216,10 +1232,10 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 #undef DECLARE_SSE4_EXTRACT_INSTRUCTION
 
   // SSE4.2
-  void sse4_2_instr(XMMRegister dst, XMMRegister src, byte prefix, byte escape1,
-                    byte escape2, byte opcode);
-  void sse4_2_instr(XMMRegister dst, Operand src, byte prefix, byte escape1,
-                    byte escape2, byte opcode);
+  void sse4_2_instr(XMMRegister dst, XMMRegister src, uint8_t prefix,
+                    uint8_t escape1, uint8_t escape2, uint8_t opcode);
+  void sse4_2_instr(XMMRegister dst, Operand src, uint8_t prefix,
+                    uint8_t escape1, uint8_t escape2, uint8_t opcode);
 #define DECLARE_SSE4_2_INSTRUCTION(instruction, prefix, escape1, escape2,     \
                                    opcode)                                    \
   void instruction(XMMRegister dst, XMMRegister src) {                        \
@@ -1322,6 +1338,24 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   SSE4_UNOP_INSTRUCTION_LIST(DECLARE_SSE4_PMOV_AVX_INSTRUCTION)
 #undef DECLARE_SSE4_PMOV_AVX_INSTRUCTION
 
+#define DECLARE_SSE4_PMOV_AVX2_INSTRUCTION(instruction, prefix, escape1,     \
+                                           escape2, opcode)                  \
+  void v##instruction(YMMRegister dst, XMMRegister src) {                    \
+    vinstr(0x##opcode, dst, xmm0, src, k##prefix, k##escape1##escape2, kW0); \
+  }                                                                          \
+  void v##instruction(YMMRegister dst, Operand src) {                        \
+    vinstr(0x##opcode, dst, xmm0, src, k##prefix, k##escape1##escape2, kW0); \
+  }
+  SSE4_UNOP_INSTRUCTION_LIST_PMOV(DECLARE_SSE4_PMOV_AVX2_INSTRUCTION)
+#undef DECLARE_SSE4_PMOV_AVX2_INSTRUCTION
+
+  void vptest(YMMRegister dst, YMMRegister src) {
+    vinstr(0x17, dst, ymm0, src, k66, k0F38, kW0, AVX);
+  }
+  void vptest(YMMRegister dst, Operand src) {
+    vinstr(0x17, dst, ymm0, src, k66, k0F38, kW0, AVX);
+  }
+
 #define DECLARE_AVX_INSTRUCTION(instruction, prefix, escape1, escape2, opcode) \
   void v##instruction(Register dst, XMMRegister src, uint8_t imm8) {           \
     XMMRegister idst = XMMRegister::from_code(dst.code());                     \
@@ -1403,8 +1437,8 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void pinsrw(XMMRegister dst, Operand src, uint8_t imm8);
 
   // SSE 4.1 instruction
-  void insertps(XMMRegister dst, XMMRegister src, byte imm8);
-  void insertps(XMMRegister dst, Operand src, byte imm8);
+  void insertps(XMMRegister dst, XMMRegister src, uint8_t imm8);
+  void insertps(XMMRegister dst, Operand src, uint8_t imm8);
   void pextrq(Register dst, XMMRegister src, int8_t imm8);
   void pinsrb(XMMRegister dst, Register src, uint8_t imm8);
   void pinsrb(XMMRegister dst, Operand src, uint8_t imm8);
@@ -1470,10 +1504,18 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void vbroadcastss(XMMRegister dst, XMMRegister src);
   void vbroadcastss(YMMRegister dst, Operand src);
   void vbroadcastss(YMMRegister dst, XMMRegister src);
-
-  void fma_instr(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
-                 VectorLength l, SIMDPrefix pp, LeadingOpcode m, VexW w);
-  void fma_instr(byte op, XMMRegister dst, XMMRegister src1, Operand src2,
+  void vbroadcastsd(YMMRegister dst, XMMRegister src);
+  void vbroadcastsd(YMMRegister dst, Operand src);
+
+  void vinserti128(YMMRegister dst, YMMRegister src1, XMMRegister src2,
+                   uint8_t lane);
+  void vperm2f128(YMMRegister dst, YMMRegister src1, YMMRegister src2,
+                  uint8_t lane);
+
+  void fma_instr(uint8_t op, XMMRegister dst, XMMRegister src1,
+                 XMMRegister src2, VectorLength l, SIMDPrefix pp,
+                 LeadingOpcode m, VexW w);
+  void fma_instr(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2,
                  VectorLength l, SIMDPrefix pp, LeadingOpcode m, VexW w);
 
 #define FMA(instr, length, prefix, escape1, escape2, extension, opcode) \
@@ -1574,10 +1616,16 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 #undef AVX_3
 
 #define AVX_SSE2_SHIFT_IMM(instr, prefix, escape, opcode, extension)   \
-  void v##instr(XMMRegister dst, XMMRegister src, byte imm8) {         \
+  void v##instr(XMMRegister dst, XMMRegister src, uint8_t imm8) {      \
     XMMRegister ext_reg = XMMRegister::from_code(extension);           \
     vinstr(0x##opcode, ext_reg, dst, src, k##prefix, k##escape, kWIG); \
     emit(imm8);                                                        \
+  }                                                                    \
+                                                                       \
+  void v##instr(YMMRegister dst, YMMRegister src, uint8_t imm8) {      \
+    YMMRegister ext_reg = YMMRegister::from_code(extension);           \
+    vinstr(0x##opcode, ext_reg, dst, src, k##prefix, k##escape, kWIG); \
+    emit(imm8);                                                        \
   }
   SSE2_INSTRUCTION_LIST_SHIFT_IMM(AVX_SSE2_SHIFT_IMM)
 #undef AVX_SSE2_SHIFT_IMM
@@ -1673,42 +1721,42 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void vroundss(XMMRegister dst, XMMRegister src1, XMMRegister src2,
                 RoundingMode mode) {
     vinstr(0x0a, dst, src1, src2, k66, k0F3A, kWIG);
-    emit(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+    emit(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
   }
   void vroundss(XMMRegister dst, XMMRegister src1, Operand src2,
                 RoundingMode mode) {
     vinstr(0x0a, dst, src1, src2, k66, k0F3A, kWIG);
-    emit(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+    emit(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
   }
   void vroundsd(XMMRegister dst, XMMRegister src1, XMMRegister src2,
                 RoundingMode mode) {
     vinstr(0x0b, dst, src1, src2, k66, k0F3A, kWIG);
-    emit(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+    emit(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
   }
   void vroundsd(XMMRegister dst, XMMRegister src1, Operand src2,
                 RoundingMode mode) {
     vinstr(0x0b, dst, src1, src2, k66, k0F3A, kWIG);
-    emit(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+    emit(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
   }
   void vroundps(XMMRegister dst, XMMRegister src, RoundingMode mode) {
     vinstr(0x08, dst, xmm0, src, k66, k0F3A, kWIG);
-    emit(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+    emit(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
   }
   void vroundps(YMMRegister dst, YMMRegister src, RoundingMode mode) {
     vinstr(0x08, dst, ymm0, src, k66, k0F3A, kWIG, AVX);
-    emit(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+    emit(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
   }
   void vroundpd(XMMRegister dst, XMMRegister src, RoundingMode mode) {
     vinstr(0x09, dst, xmm0, src, k66, k0F3A, kWIG);
-    emit(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+    emit(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
   }
   void vroundpd(YMMRegister dst, YMMRegister src, RoundingMode mode) {
     vinstr(0x09, dst, ymm0, src, k66, k0F3A, kWIG, AVX);
-    emit(static_cast<byte>(mode) | 0x8);  // Mask precision exception.
+    emit(static_cast<uint8_t>(mode) | 0x8);  // Mask precision exception.
   }
 
   template <typename Reg, typename Op>
-  void vsd(byte op, Reg dst, Reg src1, Op src2) {
+  void vsd(uint8_t op, Reg dst, Reg src1, Op src2) {
     vinstr(op, dst, src1, src2, kF2, k0F, kWIG, AVX);
   }
 
@@ -1719,13 +1767,15 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void vmovss(Operand dst, XMMRegister src) { vss(0x11, src, xmm0, dst); }
   void vucomiss(XMMRegister dst, XMMRegister src);
   void vucomiss(XMMRegister dst, Operand src);
-  void vss(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
-  void vss(byte op, XMMRegister dst, XMMRegister src1, Operand src2);
+  void vss(uint8_t op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
+  void vss(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2);
 
-  void vshufps(XMMRegister dst, XMMRegister src1, XMMRegister src2, byte imm8) {
+  void vshufps(XMMRegister dst, XMMRegister src1, XMMRegister src2,
+               uint8_t imm8) {
     vps(0xC6, dst, src1, src2, imm8);
   }
-  void vshufps(YMMRegister dst, YMMRegister src1, YMMRegister src2, byte imm8) {
+  void vshufps(YMMRegister dst, YMMRegister src1, YMMRegister src2,
+               uint8_t imm8) {
     vps(0xC6, dst, src1, src2, imm8);
   }
 
@@ -1831,11 +1881,12 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
     vinstr(0xF0, dst, xmm0, src, kF2, k0F, kWIG);
   }
   void vinsertps(XMMRegister dst, XMMRegister src1, XMMRegister src2,
-                 byte imm8) {
+                 uint8_t imm8) {
     vinstr(0x21, dst, src1, src2, k66, k0F3A, kWIG);
     emit(imm8);
   }
-  void vinsertps(XMMRegister dst, XMMRegister src1, Operand src2, byte imm8) {
+  void vinsertps(XMMRegister dst, XMMRegister src1, Operand src2,
+                 uint8_t imm8) {
     vinstr(0x21, dst, src1, src2, k66, k0F3A, kWIG);
     emit(imm8);
   }
@@ -1968,20 +2019,20 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
     emit(imm8);
   }
 
-  void vps(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
-  void vps(byte op, YMMRegister dst, YMMRegister src1, YMMRegister src2);
-  void vps(byte op, XMMRegister dst, XMMRegister src1, Operand src2);
-  void vps(byte op, YMMRegister dst, YMMRegister src1, Operand src2);
-  void vps(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
-           byte imm8);
-  void vps(byte op, YMMRegister dst, YMMRegister src1, YMMRegister src2,
-           byte imm8);
-  void vpd(byte op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
-  void vpd(byte op, YMMRegister dst, YMMRegister src1, YMMRegister src2);
-  void vpd(byte op, XMMRegister dst, YMMRegister src1, YMMRegister src2);
-  void vpd(byte op, XMMRegister dst, XMMRegister src1, Operand src2);
-  void vpd(byte op, YMMRegister dst, YMMRegister src1, Operand src2);
-  void vpd(byte op, XMMRegister dst, YMMRegister src1, Operand src2);
+  void vps(uint8_t op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
+  void vps(uint8_t op, YMMRegister dst, YMMRegister src1, YMMRegister src2);
+  void vps(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2);
+  void vps(uint8_t op, YMMRegister dst, YMMRegister src1, Operand src2);
+  void vps(uint8_t op, XMMRegister dst, XMMRegister src1, XMMRegister src2,
+           uint8_t imm8);
+  void vps(uint8_t op, YMMRegister dst, YMMRegister src1, YMMRegister src2,
+           uint8_t imm8);
+  void vpd(uint8_t op, XMMRegister dst, XMMRegister src1, XMMRegister src2);
+  void vpd(uint8_t op, YMMRegister dst, YMMRegister src1, YMMRegister src2);
+  void vpd(uint8_t op, XMMRegister dst, YMMRegister src1, YMMRegister src2);
+  void vpd(uint8_t op, XMMRegister dst, XMMRegister src1, Operand src2);
+  void vpd(uint8_t op, YMMRegister dst, YMMRegister src1, Operand src2);
+  void vpd(uint8_t op, XMMRegister dst, YMMRegister src1, Operand src2);
 
   // AVX2 instructions
 #define AVX2_INSTRUCTION(instr, prefix, escape1, escape2, opcode)           \
@@ -2129,10 +2180,10 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   void shrxl(Register dst, Operand src1, Register src2) {
     bmi2l(kF2, 0xf7, dst, src2, src1);
   }
-  void rorxq(Register dst, Register src, byte imm8);
-  void rorxq(Register dst, Operand src, byte imm8);
-  void rorxl(Register dst, Register src, byte imm8);
-  void rorxl(Register dst, Operand src, byte imm8);
+  void rorxq(Register dst, Register src, uint8_t imm8);
+  void rorxq(Register dst, Operand src, uint8_t imm8);
+  void rorxl(Register dst, Register src, uint8_t imm8);
+  void rorxl(Register dst, Operand src, uint8_t imm8);
 
   void mfence();
   void lfence();
@@ -2151,13 +2202,13 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Writes a single word of data in the code stream.
   // Used for inline tables, e.g., jump-tables.
   void db(uint8_t data);
-  void dd(uint32_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dq(uint64_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO);
-  void dp(uintptr_t data, RelocInfo::Mode rmode = RelocInfo::NO_INFO) {
-    dq(data, rmode);
-  }
+  void dd(uint32_t data);
+  void dq(uint64_t data);
+  void dp(uintptr_t data) { dq(data); }
   void dq(Label* label);
 
+  void WriteBuiltinJumpTableEntry(Label* label, const int table_pos);
+
   // Patch entries for partial constant pool.
   void PatchConstPool();
 
@@ -2181,8 +2232,8 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // Avoid overflows for displacements etc.
   static constexpr int kMaximalBufferSize = 512 * MB;
 
-  byte byte_at(int pos) { return buffer_start_[pos]; }
-  void set_byte_at(int pos, byte value) { buffer_start_[pos] = value; }
+  uint8_t byte_at(int pos) { return buffer_start_[pos]; }
+  void set_byte_at(int pos, uint8_t value) { buffer_start_[pos] = value; }
 
 #if defined(V8_OS_WIN_X64)
   win64_unwindinfo::BuiltinUnwindInfo GetUnwindInfo() const;
@@ -2415,23 +2466,23 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // AND, OR, XOR, or CMP.  The encodings of these operations are all
   // similar, differing just in the opcode or in the reg field of the
   // ModR/M byte.
-  void arithmetic_op_8(byte opcode, Register reg, Register rm_reg);
-  void arithmetic_op_8(byte opcode, Register reg, Operand rm_reg);
-  void arithmetic_op_16(byte opcode, Register reg, Register rm_reg);
-  void arithmetic_op_16(byte opcode, Register reg, Operand rm_reg);
+  void arithmetic_op_8(uint8_t opcode, Register reg, Register rm_reg);
+  void arithmetic_op_8(uint8_t opcode, Register reg, Operand rm_reg);
+  void arithmetic_op_16(uint8_t opcode, Register reg, Register rm_reg);
+  void arithmetic_op_16(uint8_t opcode, Register reg, Operand rm_reg);
   // Operate on operands/registers with pointer size, 32-bit or 64-bit size.
-  void arithmetic_op(byte opcode, Register reg, Register rm_reg, int size);
-  void arithmetic_op(byte opcode, Register reg, Operand rm_reg, int size);
+  void arithmetic_op(uint8_t opcode, Register reg, Register rm_reg, int size);
+  void arithmetic_op(uint8_t opcode, Register reg, Operand rm_reg, int size);
   // Operate on a byte in memory or register.
-  void immediate_arithmetic_op_8(byte subcode, Register dst, Immediate src);
-  void immediate_arithmetic_op_8(byte subcode, Operand dst, Immediate src);
+  void immediate_arithmetic_op_8(uint8_t subcode, Register dst, Immediate src);
+  void immediate_arithmetic_op_8(uint8_t subcode, Operand dst, Immediate src);
   // Operate on a word in memory or register.
-  void immediate_arithmetic_op_16(byte subcode, Register dst, Immediate src);
-  void immediate_arithmetic_op_16(byte subcode, Operand dst, Immediate src);
+  void immediate_arithmetic_op_16(uint8_t subcode, Register dst, Immediate src);
+  void immediate_arithmetic_op_16(uint8_t subcode, Operand dst, Immediate src);
   // Operate on operands/registers with pointer size, 32-bit or 64-bit size.
-  void immediate_arithmetic_op(byte subcode, Register dst, Immediate src,
+  void immediate_arithmetic_op(uint8_t subcode, Register dst, Immediate src,
                                int size);
-  void immediate_arithmetic_op(byte subcode, Operand dst, Immediate src,
+  void immediate_arithmetic_op(uint8_t subcode, Operand dst, Immediate src,
                                int size);
 
   // Emit machine code for a shift operation.
@@ -2641,26 +2692,30 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   }
 
   // Most BMI instructions are similar.
-  void bmi1q(byte op, Register reg, Register vreg, Register rm);
-  void bmi1q(byte op, Register reg, Register vreg, Operand rm);
-  void bmi1l(byte op, Register reg, Register vreg, Register rm);
-  void bmi1l(byte op, Register reg, Register vreg, Operand rm);
-  void bmi2q(SIMDPrefix pp, byte op, Register reg, Register vreg, Register rm);
-  void bmi2q(SIMDPrefix pp, byte op, Register reg, Register vreg, Operand rm);
-  void bmi2l(SIMDPrefix pp, byte op, Register reg, Register vreg, Register rm);
-  void bmi2l(SIMDPrefix pp, byte op, Register reg, Register vreg, Operand rm);
+  void bmi1q(uint8_t op, Register reg, Register vreg, Register rm);
+  void bmi1q(uint8_t op, Register reg, Register vreg, Operand rm);
+  void bmi1l(uint8_t op, Register reg, Register vreg, Register rm);
+  void bmi1l(uint8_t op, Register reg, Register vreg, Operand rm);
+  void bmi2q(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
+             Register rm);
+  void bmi2q(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
+             Operand rm);
+  void bmi2l(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
+             Register rm);
+  void bmi2l(SIMDPrefix pp, uint8_t op, Register reg, Register vreg,
+             Operand rm);
 
   // record the position of jmp/jcc instruction
   void record_farjmp_position(Label* L, int pos);
 
   bool is_optimizable_farjmp(int idx);
 
-  void AllocateAndInstallRequestedHeapNumbers(Isolate* isolate);
+  void AllocateAndInstallRequestedHeapNumbers(LocalIsolate* isolate);
 
   int WriteCodeComments();
 
-  void GetCode(Isolate* isolate, CodeDesc* desc, int safepoint_table_offset,
-               int handler_table_offset);
+  void GetCode(LocalIsolate* isolate, CodeDesc* desc,
+               int safepoint_table_offset, int handler_table_offset);
 
   friend class EnsureSpace;
   friend class RegExpMacroAssemblerX64;
@@ -2673,11 +2728,6 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
   // are already bound.
   std::deque<int> internal_reference_positions_;
 
-  // Variables for this instance of assembler
-  int farjmp_num_ = 0;
-  std::deque<int> farjmp_positions_;
-  std::map<Label*, std::vector<int>> label_farjmp_maps_;
-
   ConstPool constpool_;
 
   friend class ConstPool;
@@ -2687,26 +2737,40 @@ class V8_EXPORT_PRIVATE Assembler : public AssemblerBase {
 #endif
 };
 
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void Assembler::vinstr(byte op, YMMRegister dst, YMMRegister src1,
-                       YMMRegister src2, SIMDPrefix pp,
-                       LeadingOpcode m, VexW w, CpuFeature feature);
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void Assembler::vinstr(byte op, YMMRegister dst, XMMRegister src1,
-                       XMMRegister src2, SIMDPrefix pp,
-                       LeadingOpcode m, VexW w, CpuFeature feature);
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void Assembler::vinstr(byte op, YMMRegister dst, YMMRegister src1,
-                       Operand src2, SIMDPrefix pp, LeadingOpcode m,
-                       VexW w, CpuFeature feature);
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void Assembler::vinstr(byte op, YMMRegister dst, YMMRegister src1,
-                       XMMRegister src2, SIMDPrefix pp,
-                       LeadingOpcode m, VexW w, CpuFeature feature);
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void Assembler::vinstr(byte op, YMMRegister dst, XMMRegister src1,
-                       Operand src2, SIMDPrefix pp, LeadingOpcode m,
-                       VexW w, CpuFeature feature);
+extern template EXPORT_TEMPLATE_DECLARE(
+    V8_EXPORT_PRIVATE) void Assembler::vinstr(uint8_t op, YMMRegister dst,
+                                              YMMRegister src1,
+                                              YMMRegister src2, SIMDPrefix pp,
+                                              LeadingOpcode m, VexW w,
+                                              CpuFeature feature);
+extern template EXPORT_TEMPLATE_DECLARE(
+    V8_EXPORT_PRIVATE) void Assembler::vinstr(uint8_t op, YMMRegister dst,
+                                              XMMRegister src1,
+                                              XMMRegister src2, SIMDPrefix pp,
+                                              LeadingOpcode m, VexW w,
+                                              CpuFeature feature);
+extern template EXPORT_TEMPLATE_DECLARE(
+    V8_EXPORT_PRIVATE) void Assembler::vinstr(uint8_t op, YMMRegister dst,
+                                              YMMRegister src1, Operand src2,
+                                              SIMDPrefix pp, LeadingOpcode m,
+                                              VexW w, CpuFeature feature);
+extern template EXPORT_TEMPLATE_DECLARE(
+    V8_EXPORT_PRIVATE) void Assembler::vinstr(uint8_t op, YMMRegister dst,
+                                              YMMRegister src1,
+                                              XMMRegister src2, SIMDPrefix pp,
+                                              LeadingOpcode m, VexW w,
+                                              CpuFeature feature);
+extern template EXPORT_TEMPLATE_DECLARE(
+    V8_EXPORT_PRIVATE) void Assembler::vinstr(uint8_t op, YMMRegister dst,
+                                              XMMRegister src1, Operand src2,
+                                              SIMDPrefix pp, LeadingOpcode m,
+                                              VexW w, CpuFeature feature);
+extern template EXPORT_TEMPLATE_DECLARE(
+    V8_EXPORT_PRIVATE) void Assembler::vinstr(uint8_t op, YMMRegister dst,
+                                              XMMRegister src1,
+                                              YMMRegister src2, SIMDPrefix pp,
+                                              LeadingOpcode m, VexW w,
+                                              CpuFeature feature);
 
 // Helper class that ensures that there is enough space for generating
 // instructions and relocation information.  The constructor makes
diff --git a/deps/v8/src/codegen/x64/interface-descriptors-x64-inl.h b/deps/v8/src/codegen/x64/interface-descriptors-x64-inl.h
index cc662c4899df1e..ad89e9877096a2 100644
--- a/deps/v8/src/codegen/x64/interface-descriptors-x64-inl.h
+++ b/deps/v8/src/codegen/x64/interface-descriptors-x64-inl.h
@@ -18,6 +18,24 @@ constexpr auto CallInterfaceDescriptor::DefaultRegisterArray() {
   return registers;
 }
 
+constexpr auto CallInterfaceDescriptor::DefaultDoubleRegisterArray() {
+  auto registers =
+      DoubleRegisterArray(xmm0, xmm1, xmm2, xmm3, xmm4, xmm5, xmm6);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnRegisterArray() {
+  auto registers =
+      RegisterArray(kReturnRegister0, kReturnRegister1, kReturnRegister2);
+  return registers;
+}
+
+constexpr auto CallInterfaceDescriptor::DefaultReturnDoubleRegisterArray() {
+  // Padding to have as many double return registers as GP return registers.
+  auto registers = DoubleRegisterArray(kFPReturnRegister0, no_dreg, no_dreg);
+  return registers;
+}
+
 #if DEBUG
 template <typename DerivedDescriptor>
 void StaticCallInterfaceDescriptor<DerivedDescriptor>::
@@ -136,6 +154,17 @@ constexpr Register BaselineLeaveFrameDescriptor::WeightRegister() {
   return rcx;
 }
 
+// static
+constexpr Register
+MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor::FlagsRegister() {
+  return r8;
+}
+// static
+constexpr Register MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor::
+    FeedbackVectorRegister() {
+  return r9;
+}
+
 // static
 constexpr Register TypeConversionDescriptor::ArgumentRegister() { return rax; }
 
@@ -276,11 +305,36 @@ constexpr auto BinarySmiOp_BaselineDescriptor::registers() {
 }
 
 // static
-constexpr auto ApiCallbackDescriptor::registers() {
-  return RegisterArray(rdx,   // api function address
-                       rcx,   // argument count (not including receiver)
-                       rbx,   // call data
-                       rdi);  // holder
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister() {
+  return rdx;
+}
+// static
+constexpr Register
+CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister() {
+  return rcx;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::CallDataRegister() {
+  return rbx;
+}
+// static
+constexpr Register CallApiCallbackOptimizedDescriptor::HolderRegister() {
+  return rdi;
+}
+
+// static
+constexpr Register
+CallApiCallbackGenericDescriptor::ActualArgumentsCountRegister() {
+  return rcx;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::CallHandlerInfoRegister() {
+  return rbx;
+}
+// static
+constexpr Register CallApiCallbackGenericDescriptor::HolderRegister() {
+  return r8;
 }
 
 // static
@@ -319,6 +373,10 @@ constexpr auto RunMicrotasksEntryDescriptor::registers() {
   return RegisterArray(arg_reg_1, arg_reg_2);
 }
 
+constexpr auto WasmJSToWasmWrapperDescriptor::registers() {
+  // Arbitrarily picked register.
+  return RegisterArray(rdi);
+}
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/x64/macro-assembler-x64.cc b/deps/v8/src/codegen/x64/macro-assembler-x64.cc
index f362456e7f5eb2..04922494c786d7 100644
--- a/deps/v8/src/codegen/x64/macro-assembler-x64.cc
+++ b/deps/v8/src/codegen/x64/macro-assembler-x64.cc
@@ -2,6 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include <climits>
 #include <cstdint>
 
 #if V8_TARGET_ARCH_X64
@@ -16,6 +17,7 @@
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/codegen/macro-assembler.h"
 #include "src/codegen/register-configuration.h"
+#include "src/codegen/register.h"
 #include "src/codegen/x64/assembler-x64.h"
 #include "src/codegen/x64/register-x64.h"
 #include "src/common/globals.h"
@@ -311,7 +313,7 @@ void MacroAssembler::StoreTaggedField(Operand dst_field_operand,
 }
 
 void MacroAssembler::StoreTaggedSignedField(Operand dst_field_operand,
-                                            Smi value) {
+                                            Tagged<Smi> value) {
   if (SmiValuesAre32Bits()) {
     Move(kScratchRegister, value);
     movq(dst_field_operand, kScratchRegister);
@@ -360,7 +362,7 @@ void MacroAssembler::DecompressTagged(Register destination,
 void MacroAssembler::RecordWriteField(Register object, int offset,
                                       Register value, Register slot_address,
                                       SaveFPRegsMode save_fp,
-                                      SmiCheck smi_check) {
+                                      SmiCheck smi_check, PointerType type) {
   ASM_CODE_COMMENT(this);
   DCHECK(!AreAliased(object, value, slot_address));
   // First, check if a write barrier is even needed. The tests below
@@ -386,7 +388,7 @@ void MacroAssembler::RecordWriteField(Register object, int offset,
     bind(&ok);
   }
 
-  RecordWrite(object, slot_address, value, save_fp, SmiCheck::kOmit);
+  RecordWrite(object, slot_address, value, save_fp, SmiCheck::kOmit, type);
 
   bind(&done);
 
@@ -446,25 +448,83 @@ void MacroAssembler::LoadExternalPointerField(
   DCHECK(!field_operand.AddressUsesRegister(scratch));
   if (isolateRootLocation == IsolateRootLocation::kInRootRegister) {
     DCHECK(root_array_available_);
-    movq(scratch, Operand(kRootRegister,
-                          IsolateData::external_pointer_table_offset() +
-                              Internals::kExternalPointerTableBufferOffset));
+    movq(scratch,
+         Operand(kRootRegister,
+                 IsolateData::external_pointer_table_offset() +
+                     Internals::kExternalPointerTableBasePointerOffset));
   } else {
     DCHECK(isolateRootLocation == IsolateRootLocation::kInScratchRegister);
     movq(scratch,
-         Operand(scratch, IsolateData::external_pointer_table_offset() +
-                              Internals::kExternalPointerTableBufferOffset));
-  }
-    movl(destination, field_operand);
-    shrq(destination, Immediate(kExternalPointerIndexShift));
-    movq(destination, Operand(scratch, destination, times_8, 0));
-    movq(scratch, Immediate64(~tag));
-    andq(destination, scratch);
+         Operand(scratch,
+                 IsolateData::external_pointer_table_offset() +
+                     Internals::kExternalPointerTableBasePointerOffset));
+  }
+  movl(destination, field_operand);
+  shrq(destination, Immediate(kExternalPointerIndexShift));
+  static_assert(kExternalPointerTableEntrySize == 8);
+  movq(destination, Operand(scratch, destination, times_8, 0));
+  movq(scratch, Immediate64(~tag));
+  andq(destination, scratch);
 #else
   movq(destination, field_operand);
 #endif  // V8_ENABLE_SANDBOX
 }
 
+void MacroAssembler::LoadIndirectPointerField(Register destination,
+                                              Operand field_operand,
+                                              Register scratch) {
+  DCHECK(!AreAliased(destination, scratch));
+#ifdef V8_CODE_POINTER_SANDBOXING
+  DCHECK(!field_operand.AddressUsesRegister(scratch));
+  static_assert(kAllIndirectPointerObjectsAreCode);
+  LoadAddress(scratch, ExternalReference::code_pointer_table_address());
+  movl(destination, field_operand);
+  shrl(destination, Immediate(kCodePointerHandleShift));
+  shll(destination, Immediate(kCodePointerTableEntrySizeLog2));
+  movq(destination, Operand(scratch, destination, times_1,
+                            kCodePointerTableEntryCodeObjectOffset));
+  // The LSB is used as marking bit by the code pointer table, so here we have
+  // to set it using a bitwise OR as it may or may not be set.
+  orq(destination, Immediate(kHeapObjectTag));
+#else
+  movq(destination, field_operand);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+void MacroAssembler::StoreIndirectPointerField(Operand dst_field_operand,
+                                               Register value) {
+  DCHECK(V8_CODE_POINTER_SANDBOXING_BOOL);
+  static_assert(kAllIndirectPointerObjectsAreCode);
+  movl(kScratchRegister,
+       FieldOperand(value, Code::kCodePointerTableEntryOffset));
+  movl(dst_field_operand, kScratchRegister);
+}
+
+void MacroAssembler::StoreMaybeIndirectPointerField(Operand dst_field_operand,
+                                                    Register value) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  StoreIndirectPointerField(dst_field_operand, value);
+#else
+  StoreTaggedField(dst_field_operand, value);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+void MacroAssembler::LoadCodeEntrypointField(Register destination,
+                                             Operand field_operand) {
+  DCHECK(!AreAliased(destination, kScratchRegister));
+#ifdef V8_CODE_POINTER_SANDBOXING
+  DCHECK(!field_operand.AddressUsesRegister(kScratchRegister));
+  LoadAddress(kScratchRegister,
+              ExternalReference::code_pointer_table_address());
+  movl(destination, field_operand);
+  shrl(destination, Immediate(kCodePointerHandleShift));
+  shll(destination, Immediate(kCodePointerTableEntrySizeLog2));
+  movq(destination, Operand(kScratchRegister, destination, times_1, 0));
+#else
+  movq(destination, field_operand);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
 void MacroAssembler::CallEphemeronKeyBarrier(Register object,
                                              Register slot_address,
                                              SaveFPRegsMode fp_mode) {
@@ -488,7 +548,8 @@ void MacroAssembler::CallEphemeronKeyBarrier(Register object,
 void MacroAssembler::CallRecordWriteStubSaveRegisters(Register object,
                                                       Register slot_address,
                                                       SaveFPRegsMode fp_mode,
-                                                      StubCallMode mode) {
+                                                      StubCallMode mode,
+                                                      PointerType type) {
   ASM_CODE_COMMENT(this);
   DCHECK(!AreAliased(object, slot_address));
   RegList registers =
@@ -499,13 +560,14 @@ void MacroAssembler::CallRecordWriteStubSaveRegisters(Register object,
       WriteBarrierDescriptor::SlotAddressRegister();
   MovePair(object_parameter, object, slot_address_parameter, slot_address);
 
-  CallRecordWriteStub(object_parameter, slot_address_parameter, fp_mode, mode);
+  CallRecordWriteStub(object_parameter, slot_address_parameter, fp_mode, mode,
+                      type);
   PopAll(registers);
 }
 
 void MacroAssembler::CallRecordWriteStub(Register object, Register slot_address,
                                          SaveFPRegsMode fp_mode,
-                                         StubCallMode mode) {
+                                         StubCallMode mode, PointerType type) {
   ASM_CODE_COMMENT(this);
   // Use CallRecordWriteStubSaveRegisters if the object and slot registers
   // need to be caller saved.
@@ -513,6 +575,7 @@ void MacroAssembler::CallRecordWriteStub(Register object, Register slot_address,
   DCHECK_EQ(WriteBarrierDescriptor::SlotAddressRegister(), slot_address);
 #if V8_ENABLE_WEBASSEMBLY
   if (mode == StubCallMode::kCallWasmRuntimeStub) {
+    DCHECK_EQ(type, PointerType::kDirect);
     // Use {near_call} for direct Wasm call within a module.
     auto wasm_target = wasm::WasmCode::GetRecordWriteStub(fp_mode);
     near_call(wasm_target, RelocInfo::WASM_STUB_CALL);
@@ -520,7 +583,7 @@ void MacroAssembler::CallRecordWriteStub(Register object, Register slot_address,
   if (false) {
 #endif
   } else {
-    Builtin builtin = Builtins::GetRecordWriteStub(fp_mode);
+    Builtin builtin = Builtins::GetRecordWriteStub(fp_mode, type);
     CallBuiltin(builtin);
   }
 }
@@ -616,7 +679,7 @@ void MacroAssembler::CallTSANRelaxedLoadStub(Register address,
 
 void MacroAssembler::RecordWrite(Register object, Register slot_address,
                                  Register value, SaveFPRegsMode fp_mode,
-                                 SmiCheck smi_check) {
+                                 SmiCheck smi_check, PointerType type) {
   ASM_CODE_COMMENT(this);
   DCHECK(!AreAliased(object, slot_address, value));
   AssertNotSmi(object);
@@ -628,7 +691,21 @@ void MacroAssembler::RecordWrite(Register object, Register slot_address,
   if (v8_flags.debug_code) {
     ASM_CODE_COMMENT_STRING(this, "Debug check slot_address");
     Label ok;
-    cmp_tagged(value, Operand(slot_address, 0));
+    if (type == PointerType::kIndirect) {
+      Push(object);  // Use object register as scratch
+      Register scratch = object;
+      Push(slot_address);  // Use slot address register to load the value into
+      Register value_in_slot = slot_address;
+      LoadIndirectPointerField(value_in_slot, Operand(slot_address, 0),
+                               scratch);
+      cmp_tagged(value, value_in_slot);
+      // These pops don't affect the flag registers, so we can do them before
+      // the conditional jump below.
+      Pop(slot_address);
+      Pop(object);
+    } else {
+      cmp_tagged(value, Operand(slot_address, 0));
+    }
     j(equal, &ok, Label::kNear);
     int3();
     bind(&ok);
@@ -653,7 +730,8 @@ void MacroAssembler::RecordWrite(Register object, Register slot_address,
                 MemoryChunk::kPointersFromHereAreInterestingMask, zero, &done,
                 Label::kNear);
 
-  CallRecordWriteStub(object, slot_address, fp_mode);
+  CallRecordWriteStub(object, slot_address, fp_mode,
+                      StubCallMode::kCallBuiltinPointer, type);
 
   bind(&done);
 
@@ -689,6 +767,15 @@ void MacroAssembler::CheckStackAlignment() {
   }
 }
 
+void MacroAssembler::AlignStackPointer() {
+  const int kFrameAlignment = base::OS::ActivationFrameAlignment();
+  if (kFrameAlignment > 0) {
+    DCHECK(base::bits::IsPowerOfTwo(kFrameAlignment));
+    DCHECK(is_int8(kFrameAlignment));
+    andq(rsp, Immediate(-kFrameAlignment));
+  }
+}
+
 void MacroAssembler::Abort(AbortReason reason) {
   ASM_CODE_COMMENT(this);
   if (v8_flags.code_comments) {
@@ -748,7 +835,10 @@ void MacroAssembler::CallRuntime(const Runtime::Function* f,
   // smarter.
   Move(rax, num_arguments);
   LoadAddress(rbx, ExternalReference::Create(f));
-  Handle<Code> code = CodeFactory::CEntry(isolate(), f->result_size);
+  bool switch_to_central =
+      Runtime::SwitchToTheCentralStackForTarget(f->function_id);
+  Handle<Code> code = CodeFactory::CEntry(
+      isolate(), f->result_size, ArgvMode::kStack, false, switch_to_central);
   Call(code, RelocInfo::CODE_TARGET);
 }
 
@@ -876,53 +966,62 @@ void MacroAssembler::ReplaceClosureCodeWithOptimizedCode(
   DCHECK_EQ(closure, kJSFunctionRegister);
   // Store the optimized code in the closure.
   AssertCode(optimized_code);
-  StoreTaggedField(FieldOperand(closure, JSFunction::kCodeOffset),
-                   optimized_code);
+  StoreMaybeIndirectPointerField(FieldOperand(closure, JSFunction::kCodeOffset),
+                                 optimized_code);
+
   // Write barrier clobbers scratch1 below.
   Register value = scratch1;
   movq(value, optimized_code);
 
   RecordWriteField(closure, JSFunction::kCodeOffset, value, slot_address,
-                   SaveFPRegsMode::kIgnore, SmiCheck::kOmit);
+                   SaveFPRegsMode::kIgnore, SmiCheck::kOmit, kCodePointerType);
 }
 
 // Read off the flags in the feedback vector and check if there
 // is optimized code or a tiering state that needs to be processed.
-void MacroAssembler::LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-    Register flags, Register feedback_vector, CodeKind current_code_kind,
-    Label* flags_need_processing) {
+Condition MacroAssembler::CheckFeedbackVectorFlagsNeedsProcessing(
+    Register feedback_vector, CodeKind current_code_kind) {
   ASM_CODE_COMMENT(this);
   DCHECK(CodeKindCanTierUp(current_code_kind));
-  movzxwl(flags, FieldOperand(feedback_vector, FeedbackVector::kFlagsOffset));
   uint32_t kFlagsMask = FeedbackVector::kFlagsTieringStateIsAnyRequested |
                         FeedbackVector::kFlagsMaybeHasTurbofanCode |
                         FeedbackVector::kFlagsLogNextExecution;
   if (current_code_kind != CodeKind::MAGLEV) {
     kFlagsMask |= FeedbackVector::kFlagsMaybeHasMaglevCode;
   }
-  testw(flags, Immediate(kFlagsMask));
-  j(not_zero, flags_need_processing);
+  testw(FieldOperand(feedback_vector, FeedbackVector::kFlagsOffset),
+        Immediate(kFlagsMask));
+  return not_zero;
+}
+
+void MacroAssembler::CheckFeedbackVectorFlagsAndJumpIfNeedsProcessing(
+    Register feedback_vector, CodeKind current_code_kind,
+    Label* flags_need_processing) {
+  ASM_CODE_COMMENT(this);
+  j(CheckFeedbackVectorFlagsNeedsProcessing(feedback_vector, current_code_kind),
+    flags_need_processing);
 }
 
 void MacroAssembler::OptimizeCodeOrTailCallOptimizedCodeSlot(
-    Register flags, Register feedback_vector, Register closure,
-    JumpMode jump_mode) {
+    Register feedback_vector, Register closure, JumpMode jump_mode) {
   ASM_CODE_COMMENT(this);
-  DCHECK(!AreAliased(flags, feedback_vector, closure));
+  DCHECK(!AreAliased(feedback_vector, closure));
   Label maybe_has_optimized_code, maybe_needs_logging;
   // Check if optimized code is available.
-  testl(flags, Immediate(FeedbackVector::kFlagsTieringStateIsAnyRequested));
+  testw(FieldOperand(feedback_vector, FeedbackVector::kFlagsOffset),
+        Immediate(FeedbackVector::kFlagsTieringStateIsAnyRequested));
   j(zero, &maybe_needs_logging);
 
   GenerateTailCallToReturnedCode(Runtime::kCompileOptimized, jump_mode);
 
   bind(&maybe_needs_logging);
-  testl(flags, Immediate(FeedbackVector::LogNextExecutionBit::kMask));
+  testw(FieldOperand(feedback_vector, FeedbackVector::kFlagsOffset),
+        Immediate(FeedbackVector::LogNextExecutionBit::kMask));
   j(zero, &maybe_has_optimized_code);
   GenerateTailCallToReturnedCode(Runtime::kFunctionLogNextExecution, jump_mode);
 
   bind(&maybe_has_optimized_code);
-  Register optimized_code_entry = flags;
+  Register optimized_code_entry = kJavaScriptCallCodeStartRegister;
   LoadTaggedField(
       optimized_code_entry,
       FieldOperand(feedback_vector, FeedbackVector::kMaybeOptimizedCodeOffset));
@@ -1437,10 +1536,35 @@ void MacroAssembler::Cmpeqsd(XMMRegister dst, XMMRegister src) {
   }
 }
 
+void MacroAssembler::S256Not(YMMRegister dst, YMMRegister src,
+                             YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  CpuFeatureScope avx2_scope(this, AVX2);
+  if (dst == src) {
+    vpcmpeqd(scratch, scratch, scratch);
+    vpxor(dst, dst, scratch);
+  } else {
+    vpcmpeqd(dst, dst, dst);
+    vpxor(dst, dst, src);
+  }
+}
+
+void MacroAssembler::S256Select(YMMRegister dst, YMMRegister mask,
+                                YMMRegister src1, YMMRegister src2,
+                                YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  CpuFeatureScope avx2_scope(this, AVX2);
+  // v256.select = v256.or(v256.and(v1, c), v256.andnot(v2, c)).
+  // pandn(x, y) = !x & y, so we have to flip the mask and input.
+  vpandn(scratch, mask, src2);
+  vpand(dst, src1, mask);
+  vpor(dst, dst, scratch);
+}
+
 // ----------------------------------------------------------------------------
 // Smi tagging, untagging and tag detection.
 
-Register MacroAssembler::GetSmiConstant(Smi source) {
+Register MacroAssembler::GetSmiConstant(Tagged<Smi> source) {
   Move(kScratchRegister, source);
   return kScratchRegister;
 }
@@ -1453,6 +1577,224 @@ void MacroAssembler::Cmp(Register dst, int32_t src) {
   }
 }
 
+void MacroAssembler::I64x4Mul(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                              YMMRegister tmp1, YMMRegister tmp2) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(dst, tmp1, tmp2));
+  DCHECK(!AreAliased(lhs, tmp1, tmp2));
+  DCHECK(!AreAliased(rhs, tmp1, tmp2));
+  DCHECK(CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx_scope(this, AVX2);
+  // 1. Multiply high dword of each qword of left with right.
+  vpsrlq(tmp1, lhs, uint8_t{32});
+  vpmuludq(tmp1, tmp1, rhs);
+  // 2. Multiply high dword of each qword of right with left.
+  vpsrlq(tmp2, rhs, uint8_t{32});
+  vpmuludq(tmp2, tmp2, lhs);
+  // 3. Add 1 and 2, then shift left by 32 (this is the high dword of result).
+  vpaddq(tmp2, tmp2, tmp1);
+  vpsllq(tmp2, tmp2, uint8_t{32});
+  // 4. Multiply low dwords (this is the low dword of result).
+  vpmuludq(dst, lhs, rhs);
+  // 5. Add 3 and 4.
+  vpaddq(dst, dst, tmp2);
+}
+
+#define DEFINE_ISPLAT(name, suffix, instr_mov)               \
+  void MacroAssembler::name(YMMRegister dst, Register src) { \
+    ASM_CODE_COMMENT(this);                                  \
+    DCHECK(CpuFeatures::IsSupported(AVX2));                  \
+    CpuFeatureScope avx2_scope(this, AVX2);                  \
+    instr_mov(dst, src);                                     \
+    vpbroadcast##suffix(dst, dst);                           \
+  }                                                          \
+                                                             \
+  void MacroAssembler::name(YMMRegister dst, Operand src) {  \
+    ASM_CODE_COMMENT(this);                                  \
+    DCHECK(CpuFeatures::IsSupported(AVX2));                  \
+    CpuFeatureScope avx2_scope(this, AVX2);                  \
+    vpbroadcast##suffix(dst, src);                           \
+  }
+
+MACRO_ASM_X64_ISPLAT_LIST(DEFINE_ISPLAT)
+
+#undef DEFINE_ISPLAT
+
+void MacroAssembler::F64x4Splat(YMMRegister dst, XMMRegister src) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx2_scope(this, AVX2);
+  vbroadcastsd(dst, src);
+}
+
+void MacroAssembler::F32x8Splat(YMMRegister dst, XMMRegister src) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx2_scope(this, AVX2);
+  vbroadcastss(dst, src);
+}
+
+void MacroAssembler::F64x4Min(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                              YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX) && CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx_scope(this, AVX);
+  CpuFeatureScope avx2_scope(this, AVX2);
+  vminpd(scratch, lhs, rhs);
+  vminpd(dst, rhs, lhs);
+  vorpd(scratch, scratch, dst);
+  vcmpunordpd(dst, dst, scratch);
+  vorpd(scratch, scratch, dst);
+  vpsrlq(dst, dst, uint8_t{13});
+  vandnpd(dst, dst, scratch);
+}
+
+void MacroAssembler::F64x4Max(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                              YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX) && CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx_scope(this, AVX);
+  CpuFeatureScope avx2_scope(this, AVX2);
+  vmaxpd(scratch, lhs, rhs);
+  vmaxpd(dst, rhs, lhs);
+  vxorpd(dst, dst, scratch);
+  vorpd(scratch, scratch, dst);
+  vsubpd(scratch, scratch, dst);
+  vcmpunordpd(dst, dst, scratch);
+  vpsrlq(dst, dst, uint8_t{13});
+  vandnpd(dst, dst, scratch);
+}
+
+void MacroAssembler::F32x8Min(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                              YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX) && CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx_scope(this, AVX);
+  CpuFeatureScope avx2_scope(this, AVX2);
+  vminps(scratch, lhs, rhs);
+  vminps(dst, rhs, lhs);
+  vorps(scratch, scratch, dst);
+  vcmpunordps(dst, dst, scratch);
+  vorps(scratch, scratch, dst);
+  vpsrld(dst, dst, uint8_t{10});
+  vandnps(dst, dst, scratch);
+}
+
+void MacroAssembler::F32x8Max(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                              YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX) && CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx_scope(this, AVX);
+  CpuFeatureScope avx2_scope(this, AVX2);
+  vmaxps(scratch, lhs, rhs);
+  vmaxps(dst, rhs, lhs);
+  vxorps(dst, dst, scratch);
+  vorps(scratch, scratch, dst);
+  vsubps(scratch, scratch, dst);
+  vcmpunordps(dst, dst, scratch);
+  vpsrld(dst, dst, uint8_t{10});
+  vandnps(dst, dst, scratch);
+}
+
+// 1. Zero extend 4 packed 32-bit integers in src1 to 4 packed 64-bit integers
+// in scratch
+// 2. Zero extend 4 packed 32-bit integers in src2 to 4 packed 64-bit integers
+// in dst
+// 3. Multiply packed doubleword integers in scratch with dst, the extended zero
+// are ignored
+void MacroAssembler::I64x4ExtMul(YMMRegister dst, XMMRegister src1,
+                                 XMMRegister src2, YMMRegister scratch,
+                                 bool is_signed) {
+  ASM_CODE_COMMENT(this);
+  CpuFeatureScope avx_scope(this, AVX2);
+  vpmovzxdq(scratch, src1);
+  vpmovzxdq(dst, src2);
+  if (is_signed) {
+    vpmuldq(dst, scratch, dst);
+  } else {
+    vpmuludq(dst, scratch, dst);
+  }
+}
+
+// 1. Extend 8 packed 16-bit integers in src1 to 8 packed 32-bit integers in
+// scratch
+// 2. Extend 8 packed 16-bit integers in src2 to 8 packed 32-bit integers in dst
+// 3. Multiply the packed doubleword integers in scratch and dst and store the
+// low 32 bits of each product in dst.
+void MacroAssembler::I32x8ExtMul(YMMRegister dst, XMMRegister src1,
+                                 XMMRegister src2, YMMRegister scratch,
+                                 bool is_signed) {
+  ASM_CODE_COMMENT(this);
+  CpuFeatureScope avx_scope(this, AVX2);
+  is_signed ? vpmovsxwd(scratch, src1) : vpmovzxwd(scratch, src1);
+  is_signed ? vpmovsxwd(dst, src2) : vpmovzxwd(dst, src2);
+  vpmulld(dst, dst, scratch);
+}
+
+void MacroAssembler::I16x16ExtMul(YMMRegister dst, XMMRegister src1,
+                                  XMMRegister src2, YMMRegister scratch,
+                                  bool is_signed) {
+  ASM_CODE_COMMENT(this);
+  is_signed ? vpmovsxbw(scratch, src1) : vpmovzxbw(scratch, src1);
+  is_signed ? vpmovsxbw(dst, src2) : vpmovzxbw(dst, src2);
+  vpmullw(dst, dst, scratch);
+}
+
+void MacroAssembler::I32x8ExtAddPairwiseI16x16S(YMMRegister dst,
+                                                YMMRegister src,
+                                                YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx2_scope(this, AVX2);
+  Move(scratch, uint32_t{1});
+  vpbroadcastw(scratch, scratch);
+  // vpmaddwd multiplies signed words in src and op, producing
+  // signed doublewords, then adds pairwise.
+  // src = |l0|l1|...|l14|l15|
+  // dst = |l0*1+l1*1|l2*1+l3*1|...|l14*1+l15*1|
+  vpmaddwd(dst, src, scratch);
+}
+
+void MacroAssembler::I32x8ExtAddPairwiseI16x16U(YMMRegister dst,
+                                                YMMRegister src,
+                                                YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx2_scope(this, AVX2);
+  // src = |l0|l1|...l14|l15|
+  // scratch = |0|l0|0|l2|...|0|l14|
+  vpsrld(scratch, src, 16);
+  // dst = |0|l1|0|l3|...|0|l15|
+  vpblendw(dst, src, scratch, 0xAA);
+  vpaddd(dst, dst, scratch);
+}
+
+void MacroAssembler::I16x16ExtAddPairwiseI8x32S(YMMRegister dst,
+                                                YMMRegister src,
+                                                YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx2_scope(this, AVX2);
+  Move(scratch, uint32_t{1});
+  vpbroadcastb(scratch, scratch);
+  // pmaddubsw treats the first operand as unsigned, so scratch here should
+  // be first operand
+  // src = |l0|l1|...|l34|l35|
+  // dst = |l0*1+l1*1|l2*1+l3*1|...|l34*1+l35*1|
+  vpmaddubsw(dst, scratch, src);
+}
+
+void MacroAssembler::I16x16ExtAddPairwiseI8x32U(YMMRegister dst,
+                                                YMMRegister src,
+                                                YMMRegister scratch) {
+  ASM_CODE_COMMENT(this);
+  DCHECK(CpuFeatures::IsSupported(AVX2));
+  CpuFeatureScope avx2_scope(this, AVX2);
+  Move(scratch, uint32_t{1});
+  vpbroadcastb(scratch, scratch);
+  vpmaddubsw(dst, src, scratch);
+}
+
 void MacroAssembler::SmiTag(Register reg) {
   static_assert(kSmiTag == 0);
   DCHECK(SmiValuesAre32Bits() || SmiValuesAre31Bits());
@@ -1480,9 +1822,11 @@ void MacroAssembler::SmiUntag(Register reg) {
   // TODO(v8:7703): Is there a way to avoid this sign extension when pointer
   // compression is enabled?
   if (COMPRESS_POINTERS_BOOL) {
+    sarl(reg, Immediate(kSmiShift));
     movsxlq(reg, reg);
+  } else {
+    sarq(reg, Immediate(kSmiShift));
   }
-  sarq(reg, Immediate(kSmiShift));
 }
 
 void MacroAssembler::SmiUntagUnsigned(Register reg) {
@@ -1553,8 +1897,9 @@ void MacroAssembler::SmiToInt32(Register reg) {
 }
 
 void MacroAssembler::SmiToInt32(Register dst, Register src) {
-  DCHECK(dst != src);
-  mov_tagged(dst, src);
+  if (dst != src) {
+    mov_tagged(dst, src);
+  }
   SmiToInt32(dst);
 }
 
@@ -1564,12 +1909,12 @@ void MacroAssembler::SmiCompare(Register smi1, Register smi2) {
   cmp_tagged(smi1, smi2);
 }
 
-void MacroAssembler::SmiCompare(Register dst, Smi src) {
+void MacroAssembler::SmiCompare(Register dst, Tagged<Smi> src) {
   AssertSmi(dst);
   Cmp(dst, src);
 }
 
-void MacroAssembler::Cmp(Register dst, Smi src) {
+void MacroAssembler::Cmp(Register dst, Tagged<Smi> src) {
   if (src.value() == 0) {
     test_tagged(dst, dst);
   } else if (COMPRESS_POINTERS_BOOL) {
@@ -1593,7 +1938,7 @@ void MacroAssembler::SmiCompare(Operand dst, Register src) {
   cmp_tagged(dst, src);
 }
 
-void MacroAssembler::SmiCompare(Operand dst, Smi src) {
+void MacroAssembler::SmiCompare(Operand dst, Tagged<Smi> src) {
   AssertSmi(dst);
   if (SmiValuesAre32Bits()) {
     cmpl(Operand(dst, kSmiShift / kBitsPerByte), Immediate(src.value()));
@@ -1603,7 +1948,7 @@ void MacroAssembler::SmiCompare(Operand dst, Smi src) {
   }
 }
 
-void MacroAssembler::Cmp(Operand dst, Smi src) {
+void MacroAssembler::Cmp(Operand dst, Tagged<Smi> src) {
   // The Operand cannot use the smi register.
   Register smi_reg = GetSmiConstant(src);
   DCHECK(!dst.AddressUsesRegister(smi_reg));
@@ -1640,7 +1985,7 @@ void MacroAssembler::JumpIfNotSmi(Operand src, Label* on_not_smi,
   j(NegateCondition(smi), on_not_smi, near_jump);
 }
 
-void MacroAssembler::SmiAddConstant(Operand dst, Smi constant) {
+void MacroAssembler::SmiAddConstant(Operand dst, Tagged<Smi> constant) {
   if (constant.value() != 0) {
     if (SmiValuesAre32Bits()) {
       addl(Operand(dst, kSmiShift / kBitsPerByte), Immediate(constant.value()));
@@ -1711,7 +2056,7 @@ void MacroAssembler::Switch(Register scratch, Register reg, int case_value_base,
   bind(&fallthrough);
 }
 
-void MacroAssembler::Push(Smi source) {
+void MacroAssembler::Push(Tagged<Smi> source) {
   intptr_t smi = static_cast<intptr_t>(source.ptr());
   if (is_int32(smi)) {
     Push(Immediate(static_cast<int32_t>(smi)));
@@ -1732,7 +2077,7 @@ void MacroAssembler::Push(Smi source) {
 
 // ----------------------------------------------------------------------------
 
-void MacroAssembler::Move(Register dst, Smi source) {
+void MacroAssembler::Move(Register dst, Tagged<Smi> source) {
   static_assert(kSmiTag == 0);
   int value = source.value();
   if (value == 0) {
@@ -1824,8 +2169,8 @@ void MacroAssembler::Move(XMMRegister dst, uint32_t src) {
     DCHECK_NE(0u, pop);
     if (pop + ntz + nlz == 32) {
       Pcmpeqd(dst, dst);
-      if (ntz) Pslld(dst, static_cast<byte>(ntz + nlz));
-      if (nlz) Psrld(dst, static_cast<byte>(nlz));
+      if (ntz) Pslld(dst, static_cast<uint8_t>(ntz + nlz));
+      if (nlz) Psrld(dst, static_cast<uint8_t>(nlz));
     } else {
       movl(kScratchRegister, Immediate(src));
       Movd(dst, kScratchRegister);
@@ -1843,8 +2188,8 @@ void MacroAssembler::Move(XMMRegister dst, uint64_t src) {
     DCHECK_NE(0u, pop);
     if (pop + ntz + nlz == 64) {
       Pcmpeqd(dst, dst);
-      if (ntz) Psllq(dst, static_cast<byte>(ntz + nlz));
-      if (nlz) Psrlq(dst, static_cast<byte>(nlz));
+      if (ntz) Psllq(dst, static_cast<uint8_t>(ntz + nlz));
+      if (nlz) Psrlq(dst, static_cast<uint8_t>(nlz));
     } else {
       uint32_t lower = static_cast<uint32_t>(src);
       uint32_t upper = static_cast<uint32_t>(src >> 32);
@@ -1873,7 +2218,7 @@ void MacroAssembler::Move(XMMRegister dst, uint64_t high, uint64_t low) {
 // ----------------------------------------------------------------------------
 
 void MacroAssembler::Cmp(Register dst, Handle<Object> source) {
-  if (source->IsSmi()) {
+  if (IsSmi(*source)) {
     Cmp(dst, Smi::cast(*source));
   } else if (root_array_available_ && options().isolate_independent_code) {
     // TODO(jgruber,v8:8887): Also consider a root-relative load when generating
@@ -1897,7 +2242,7 @@ void MacroAssembler::Cmp(Register dst, Handle<Object> source) {
 }
 
 void MacroAssembler::Cmp(Operand dst, Handle<Object> source) {
-  if (source->IsSmi()) {
+  if (IsSmi(*source)) {
     Cmp(dst, Smi::cast(*source));
   } else if (root_array_available_ && options().isolate_independent_code) {
     // TODO(jgruber,v8:8887): Also consider a root-relative load when generating
@@ -2180,8 +2525,9 @@ Operand MacroAssembler::EntryFromBuiltinAsOperand(Builtin builtin) {
 Operand MacroAssembler::EntryFromBuiltinIndexAsOperand(Register builtin_index) {
   if (SmiValuesAre32Bits()) {
     // The builtin_index register contains the builtin index as a Smi.
-    SmiUntagUnsigned(builtin_index);
-    return Operand(kRootRegister, builtin_index, times_system_pointer_size,
+    Move(kScratchRegister, builtin_index);  // Callee checks for equality.
+    SmiUntagUnsigned(kScratchRegister);
+    return Operand(kRootRegister, kScratchRegister, times_system_pointer_size,
                    IsolateData::builtin_entry_table_offset());
   } else {
     DCHECK(SmiValuesAre31Bits());
@@ -2260,18 +2606,20 @@ void MacroAssembler::TailCallBuiltin(Builtin builtin, Condition cc) {
   }
 }
 
-void MacroAssembler::LoadCodeEntry(Register destination, Register code_object) {
+void MacroAssembler::LoadCodeInstructionStart(Register destination,
+                                              Register code_object) {
   ASM_CODE_COMMENT(this);
-  movq(destination, FieldOperand(code_object, Code::kCodeEntryPointOffset));
+  LoadCodeEntrypointField(
+      destination, FieldOperand(code_object, Code::kInstructionStartOffset));
 }
 
 void MacroAssembler::CallCodeObject(Register code_object) {
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   call(code_object);
 }
 
 void MacroAssembler::JumpCodeObject(Register code_object, JumpMode jump_mode) {
-  LoadCodeEntry(code_object, code_object);
+  LoadCodeInstructionStart(code_object, code_object);
   switch (jump_mode) {
     case JumpMode::kJump:
       jmp(code_object);
@@ -2283,6 +2631,38 @@ void MacroAssembler::JumpCodeObject(Register code_object, JumpMode jump_mode) {
   }
 }
 
+void MacroAssembler::CallJSFunction(Register function_object) {
+  static_assert(kJavaScriptCallCodeStartRegister == rcx, "ABI mismatch");
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // When the sandbox is enabled, we can directly fetch the entrypoint pointer
+  // from the code pointer table instead of going through the Code object. In
+  // this way, we avoid one memory load on this code path.
+  LoadCodeEntrypointField(
+      rcx, FieldOperand(function_object, JSFunction::kCodeOffset));
+  call(rcx);
+#else
+  LoadTaggedField(rcx, FieldOperand(function_object, JSFunction::kCodeOffset));
+  CallCodeObject(rcx);
+#endif
+}
+
+void MacroAssembler::JumpJSFunction(Register function_object,
+                                    JumpMode jump_mode) {
+  static_assert(kJavaScriptCallCodeStartRegister == rcx, "ABI mismatch");
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // When the sandbox is enabled, we can directly fetch the entrypoint pointer
+  // from the code pointer table instead of going through the Code object. In
+  // this way, we avoid one memory load on this code path.
+  LoadCodeEntrypointField(
+      rcx, FieldOperand(function_object, JSFunction::kCodeOffset));
+  DCHECK_EQ(jump_mode, JumpMode::kJump);
+  jmp(rcx);
+#else
+  LoadTaggedField(rcx, FieldOperand(function_object, JSFunction::kCodeOffset));
+  JumpCodeObject(rcx, jump_mode);
+#endif
+}
+
 void MacroAssembler::PextrdPreSse41(Register dst, XMMRegister src,
                                     uint8_t imm8) {
   if (imm8 == 0) {
@@ -2597,8 +2977,19 @@ void MacroAssembler::CmpInstanceTypeRange(Register map,
 }
 
 void MacroAssembler::TestCodeIsMarkedForDeoptimization(Register code) {
-  testl(FieldOperand(code, Code::kKindSpecificFlagsOffset),
-        Immediate(1 << Code::kMarkedForDeoptimizationBit));
+  const int kByte4Offset = 3 * kByteSize;
+  const int kByte4OffsetInBits = kByte4Offset * 8;
+  static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
+  static_assert(FIELD_SIZE(Code::kFlagsOffset) * kBitsPerByte == 32);
+  static_assert(Code::kMarkedForDeoptimizationBit > kByte4OffsetInBits);
+  testb(
+      FieldOperand(code, Code::kFlagsOffset + kByte4Offset),
+      Immediate(1 << (Code::kMarkedForDeoptimizationBit - kByte4OffsetInBits)));
+}
+
+void MacroAssembler::TestCodeIsTurbofanned(Register code) {
+  testl(FieldOperand(code, Code::kFlagsOffset),
+        Immediate(1 << Code::kIsTurbofannedBit));
 }
 
 Immediate MacroAssembler::ClearedValue() const {
@@ -2669,6 +3060,19 @@ void MacroAssembler::AssertCode(Register object) {
   Check(equal, AbortReason::kOperandIsNotACode);
 }
 
+void MacroAssembler::AssertSmiOrHeapObjectInCompressionCage(Register object) {
+  DCHECK(PointerCompressionIsEnabled());
+  if (!v8_flags.debug_code) return;
+  ASM_CODE_COMMENT(this);
+  Label is_smi;
+  j(CheckSmi(object), &is_smi, Label::kNear);
+  movq(kScratchRegister, object);
+  subq(kScratchRegister, kPtrComprCageBaseRegister);
+  cmpq(kScratchRegister, Immediate(UINT32_MAX));
+  Check(below, AbortReason::kObjectNotTagged);
+  bind(&is_smi);
+}
+
 void MacroAssembler::AssertConstructor(Register object) {
   if (!v8_flags.debug_code) return;
   ASM_CODE_COMMENT(this);
@@ -2754,6 +3158,46 @@ void MacroAssembler::AssertUndefinedOrAllocationSite(Register object) {
   bind(&done_checking);
 }
 
+void MacroAssembler::AssertJSAny(Register object, Register map_tmp,
+                                 AbortReason abort_reason) {
+  if (!v8_flags.debug_code) return;
+
+  ASM_CODE_COMMENT(this);
+  DCHECK(!AreAliased(object, map_tmp));
+  Label ok;
+
+  JumpIfSmi(object, &ok, Label::kNear);
+
+  LoadMap(map_tmp, object);
+  CmpInstanceType(map_tmp, LAST_NAME_TYPE);
+  j(below_equal, &ok, Label::kNear);
+
+  CmpInstanceType(map_tmp, FIRST_JS_RECEIVER_TYPE);
+  j(above_equal, &ok, Label::kNear);
+
+  CompareRoot(map_tmp, RootIndex::kHeapNumberMap);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(map_tmp, RootIndex::kBigIntMap);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(object, RootIndex::kUndefinedValue);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(object, RootIndex::kTrueValue);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(object, RootIndex::kFalseValue);
+  j(equal, &ok, Label::kNear);
+
+  CompareRoot(object, RootIndex::kNullValue);
+  j(equal, &ok, Label::kNear);
+
+  Abort(abort_reason);
+
+  bind(&ok);
+}
+
 void MacroAssembler::Assert(Condition cc, AbortReason reason) {
   if (v8_flags.debug_code) Check(cc, reason);
 }
@@ -2861,13 +3305,12 @@ void MacroAssembler::InvokeFunctionCode(Register function, Register new_target,
   // allow recompilation to take effect without changing any of the
   // call sites.
   static_assert(kJavaScriptCallCodeStartRegister == rcx, "ABI mismatch");
-  LoadTaggedField(rcx, FieldOperand(function, JSFunction::kCodeOffset));
   switch (type) {
     case InvokeType::kCall:
-      CallCodeObject(rcx);
+      CallJSFunction(function);
       break;
     case InvokeType::kJump:
-      JumpCodeObject(rcx);
+      JumpJSFunction(function);
       break;
   }
   jmp(&done, Label::kNear);
@@ -2990,6 +3433,12 @@ void MacroAssembler::CallDebugOnFunctionCall(Register fun, Register new_target,
                                              Register expected_parameter_count,
                                              Register actual_parameter_count) {
   ASM_CODE_COMMENT(this);
+  // Load receiver to pass it later to DebugOnFunctionCall hook.
+  // Receiver is located on top of the stack if we have a frame (usually a
+  // construct frame), or after the return address if we do not yet have a
+  // frame.
+  movq(kScratchRegister, Operand(rsp, has_frame() ? 0 : kSystemPointerSize));
+
   FrameScope frame(
       this, has_frame() ? StackFrame::NO_FRAME_TYPE : StackFrame::INTERNAL);
 
@@ -3005,9 +3454,7 @@ void MacroAssembler::CallDebugOnFunctionCall(Register fun, Register new_target,
   }
   Push(fun);
   Push(fun);
-  // Arguments are located 2 words below the base pointer.
-  Operand receiver_op = Operand(rbp, kSystemPointerSize * 2);
-  Push(receiver_op);
+  Push(kScratchRegister);
   CallRuntime(Runtime::kDebugOnFunctionCall);
   Pop(fun);
   if (new_target.is_valid()) {
@@ -3099,11 +3546,13 @@ void MacroAssembler::AllocateStackSpace(int bytes) {
 }
 #endif
 
-void MacroAssembler::EnterExitFrame(int reserved_stack_slots,
-                                    StackFrame::Type frame_type) {
+void MacroAssembler::EnterExitFrame(int extra_slots,
+                                    StackFrame::Type frame_type,
+                                    Register c_function) {
   ASM_CODE_COMMENT(this);
   DCHECK(frame_type == StackFrame::EXIT ||
-         frame_type == StackFrame::BUILTIN_EXIT);
+         frame_type == StackFrame::BUILTIN_EXIT ||
+         frame_type == StackFrame::API_CALLBACK_EXIT);
 
   // Set up the frame structure on the stack.
   // All constants are relative to the frame pointer of the exit frame.
@@ -3118,10 +3567,12 @@ void MacroAssembler::EnterExitFrame(int reserved_stack_slots,
   DCHECK_EQ(-2 * kSystemPointerSize, ExitFrameConstants::kSPOffset);
   Push(Immediate(0));  // Saved entry sp, patched below.
 
+  DCHECK(!AreAliased(rbp, kContextRegister, c_function));
   using ER = ExternalReference;
   Store(ER::Create(IsolateAddressId::kCEntryFPAddress, isolate()), rbp);
-  Store(ER::Create(IsolateAddressId::kContextAddress, isolate()), rsi);
-  Store(ER::Create(IsolateAddressId::kCFunctionAddress, isolate()), rbx);
+  Store(ER::Create(IsolateAddressId::kContextAddress, isolate()),
+        kContextRegister);
+  Store(ER::Create(IsolateAddressId::kCFunctionAddress, isolate()), c_function);
 
 #ifdef V8_TARGET_OS_WIN
   // Note this is only correct under the assumption that the caller hasn't
@@ -3129,17 +3580,11 @@ void MacroAssembler::EnterExitFrame(int reserved_stack_slots,
   // TODO(jgruber): This is a bit hacky since the caller in most cases still
   // needs to know about the home stack slots in order to address reserved
   // slots. Consider moving this fully into caller code.
-  reserved_stack_slots += kWindowsHomeStackSlots;
+  extra_slots += kWindowsHomeStackSlots;
 #endif
-  AllocateStackSpace(reserved_stack_slots * kSystemPointerSize);
+  AllocateStackSpace(extra_slots * kSystemPointerSize);
 
-  // Get the required frame alignment for the OS.
-  const int kFrameAlignment = base::OS::ActivationFrameAlignment();
-  if (kFrameAlignment > 0) {
-    DCHECK(base::bits::IsPowerOfTwo(kFrameAlignment));
-    DCHECK(is_int8(kFrameAlignment));
-    andq(rsp, Immediate(-kFrameAlignment));
-  }
+  AlignStackPointer();
 
   // Patch the saved entry sp.
   movq(Operand(rbp, ExitFrameConstants::kSPOffset), rsp);
@@ -3178,11 +3623,13 @@ void MacroAssembler::LoadNativeContextSlot(Register dst, int index) {
 }
 
 void MacroAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
+                                             CodeKind min_opt_level,
                                              Register feedback_vector,
                                              FeedbackSlot slot,
                                              Label* on_result,
                                              Label::Distance distance) {
-  Label fallthrough;
+  ASM_CODE_COMMENT(this);
+  Label fallthrough, on_mark_deopt;
   LoadTaggedField(
       scratch_and_result,
       FieldOperand(feedback_vector,
@@ -3192,7 +3639,19 @@ void MacroAssembler::TryLoadOptimizedOsrCode(Register scratch_and_result,
   // Is it marked_for_deoptimization? If yes, clear the slot.
   {
     TestCodeIsMarkedForDeoptimization(scratch_and_result);
-    j(equal, on_result, distance);
+
+    if (min_opt_level == CodeKind::TURBOFAN) {
+      j(not_zero, &on_mark_deopt, Label::Distance::kNear);
+
+      TestCodeIsTurbofanned(scratch_and_result);
+      j(not_zero, on_result, distance);
+      jmp(&fallthrough);
+    } else {
+      DCHECK_EQ(min_opt_level, CodeKind::MAGLEV);
+      j(equal, on_result, distance);
+    }
+
+    bind(&on_mark_deopt);
     StoreTaggedField(
         FieldOperand(feedback_vector,
                      FeedbackVector::OffsetOfElementAt(slot.ToInt())),
@@ -3355,8 +3814,7 @@ void MacroAssembler::ComputeCodeStartAddress(Register dst) {
 void MacroAssembler::BailoutIfDeoptimized(Register scratch) {
   int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
   LoadTaggedField(scratch, Operand(kJavaScriptCallCodeStartRegister, offset));
-  testl(FieldOperand(scratch, Code::kKindSpecificFlagsOffset),
-        Immediate(1 << Code::kMarkedForDeoptimizationBit));
+  TestCodeIsMarkedForDeoptimization(scratch);
   Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
        RelocInfo::CODE_TARGET, not_zero);
 }
@@ -3377,6 +3835,171 @@ void MacroAssembler::CallForDeoptimization(Builtin target, int, Label* exit,
 void MacroAssembler::Trap() { int3(); }
 void MacroAssembler::DebugBreak() { int3(); }
 
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Clobbers r12, r15 and caller-saved
+// registers.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, Operand* stack_space_operand,
+                              Operand return_value_operand) {
+  ASM_CODE_COMMENT(masm);
+  Label promote_scheduled_exception;
+  Label delete_allocated_handles;
+  Label leave_exit_frame;
+
+  using ER = ExternalReference;
+
+  Isolate* isolate = masm->isolate();
+  MemOperand next_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_next_address(isolate), no_reg);
+  MemOperand limit_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_limit_address(isolate), no_reg);
+  MemOperand level_mem_op = __ ExternalReferenceAsOperand(
+      ER::handle_scope_level_address(isolate), no_reg);
+
+  Register return_value = rax;
+  Register scratch = arg_reg_4;
+
+  // Allocate HandleScope in callee-saved registers.
+  // We will need to restore the HandleScope after the call to the API function,
+  // by allocating it in callee-saved registers it'll be preserved by C code.
+  Register prev_next_address_reg = r12;
+  Register prev_limit_reg = r15;
+
+  // C arguments (arg_reg_1/2) are expected to be initialized outside, so this
+  // function must not corrupt them. kScratchRegister might be used implicitly
+  // by the macro assembler.
+  DCHECK(!AreAliased(arg_reg_1, arg_reg_2,  // C args
+                     return_value, scratch, kScratchRegister,
+                     prev_next_address_reg, prev_limit_reg));
+  // function_address and thunk_arg might overlap but this function must not
+  // corrupted them until the call is made (i.e. overlap with return_value is
+  // fine).
+  DCHECK(!AreAliased(function_address,  // incoming parameters
+                     scratch, kScratchRegister, prev_next_address_reg,
+                     prev_limit_reg));
+  DCHECK(!AreAliased(thunk_arg,  // incoming parameters
+                     scratch, kScratchRegister, prev_next_address_reg,
+                     prev_limit_reg));
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Allocate HandleScope in callee-save registers.");
+    __ movq(prev_next_address_reg, next_mem_op);
+    __ movq(prev_limit_reg, limit_mem_op);
+    __ addl(level_mem_op, Immediate(1));
+  }
+
+  Label profiler_or_side_effects_check_enabled, done_api_call;
+  if (with_profiling) {
+    __ RecordComment("Check if profiler or side effects check is enabled");
+    __ cmpb(__ ExternalReferenceAsOperand(ER::execution_mode_address(isolate),
+                                          no_reg),
+            Immediate(0));
+    __ j(not_zero, &profiler_or_side_effects_check_enabled);
+#ifdef V8_RUNTIME_CALL_STATS
+    __ RecordComment("Check if RCS is enabled");
+    __ Move(scratch, ER::address_of_runtime_stats_flag());
+    __ cmpl(Operand(scratch, 0), Immediate(0));
+    __ j(not_zero, &profiler_or_side_effects_check_enabled);
+#endif  // V8_RUNTIME_CALL_STATS
+  }
+
+  __ RecordComment("Call the api function directly.");
+  __ call(function_address);
+  __ bind(&done_api_call);
+
+  __ RecordComment("Load the value from ReturnValue");
+  __ movq(return_value, return_value_operand);
+
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm,
+        "No more valid handles (the result handle was the last one)."
+        "Restore previous handle scope.");
+    __ subl(level_mem_op, Immediate(1));
+    __ Assert(above_equal, AbortReason::kInvalidHandleScopeLevel);
+    __ movq(next_mem_op, prev_next_address_reg);
+    __ cmpq(prev_limit_reg, limit_mem_op);
+    __ j(not_equal, &delete_allocated_handles);
+  }
+
+  __ RecordComment("Leave the API exit frame.");
+  __ bind(&leave_exit_frame);
+
+  Register stack_space_reg = prev_limit_reg;
+  if (stack_space_operand != nullptr) {
+    DCHECK_EQ(stack_space, 0);
+    __ movq(stack_space_reg, *stack_space_operand);
+  }
+  __ LeaveExitFrame();
+
+  {
+    ASM_CODE_COMMENT_STRING(masm,
+                            "Check if the function scheduled an exception.");
+    __ CompareRoot(__ ExternalReferenceAsOperand(
+                       ER::scheduled_exception_address(isolate), no_reg),
+                   RootIndex::kTheHoleValue);
+    __ j(not_equal, &promote_scheduled_exception);
+  }
+
+  {
+    ASM_CODE_COMMENT_STRING(masm, "Convert return value");
+    Label finish_return;
+    __ CompareRoot(return_value, RootIndex::kTheHoleValue);
+    __ j(not_equal, &finish_return, Label::kNear);
+    __ LoadRoot(return_value, RootIndex::kUndefinedValue);
+    __ bind(&finish_return);
+  }
+
+  __ AssertJSAny(return_value, scratch,
+                 AbortReason::kAPICallReturnedInvalidObject);
+
+  if (stack_space_operand == nullptr) {
+    DCHECK_NE(stack_space, 0);
+    __ ret(stack_space * kSystemPointerSize);
+  } else {
+    DCHECK_EQ(stack_space, 0);
+    __ PopReturnAddressTo(scratch);
+    // {stack_space_operand} was loaded into {stack_space_reg} above.
+    __ addq(rsp, stack_space_reg);
+    // Push and ret (instead of jmp) to keep the RSB and the CET shadow stack
+    // balanced.
+    __ PushReturnAddressFrom(scratch);
+    __ ret(0);
+  }
+  if (with_profiling) {
+    ASM_CODE_COMMENT_STRING(masm, "Call the api function via thunk wrapper.");
+    // Call the api function via thunk wrapper.
+    __ bind(&profiler_or_side_effects_check_enabled);
+    // Additional parameter is the address of the actual callback function.
+    MemOperand thunk_arg_mem_op = __ ExternalReferenceAsOperand(
+        ER::api_callback_thunk_argument_address(isolate), no_reg);
+    __ movq(thunk_arg_mem_op, thunk_arg);
+    __ Call(thunk_ref);
+    __ jmp(&done_api_call);
+  }
+  __ RecordComment("Re-throw by promoting a scheduled exception.");
+  __ bind(&promote_scheduled_exception);
+  __ TailCallRuntime(Runtime::kPromoteScheduledException);
+  {
+    ASM_CODE_COMMENT_STRING(
+        masm, "HandleScope limit has changed. Delete allocated extensions.");
+    __ bind(&delete_allocated_handles);
+    __ movq(limit_mem_op, prev_limit_reg);
+    // Save the return value in a callee-save register.
+    Register saved_result = prev_limit_reg;
+    __ movq(saved_result, return_value);
+    __ LoadAddress(arg_reg_1, ER::isolate_address(isolate));
+    __ Call(ER::delete_handle_scope_extensions());
+    __ movq(return_value, saved_result);
+    __ jmp(&leave_exit_frame);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/codegen/x64/macro-assembler-x64.h b/deps/v8/src/codegen/x64/macro-assembler-x64.h
index 9c84b4956c83f2..a1bf09bc0969a7 100644
--- a/deps/v8/src/codegen/x64/macro-assembler-x64.h
+++ b/deps/v8/src/codegen/x64/macro-assembler-x64.h
@@ -14,6 +14,7 @@
 #include "src/codegen/shared-ia32-x64/macro-assembler-shared-ia32-x64.h"
 #include "src/codegen/x64/assembler-x64.h"
 #include "src/common/globals.h"
+#include "src/execution/frame-constants.h"
 #include "src/execution/isolate-data.h"
 #include "src/objects/contexts.h"
 #include "src/objects/tagged-index.h"
@@ -86,8 +87,8 @@ class V8_EXPORT_PRIVATE MacroAssembler
   void Push(Register src);
   void Push(Operand src);
   void Push(Immediate value);
-  void Push(Smi smi);
-  void Push(TaggedIndex index) {
+  void Push(Tagged<Smi> smi);
+  void Push(Tagged<TaggedIndex> index) {
     Push(Immediate(static_cast<uint32_t>(index.ptr())));
   }
   void Push(Handle<HeapObject> source);
@@ -209,14 +210,65 @@ class V8_EXPORT_PRIVATE MacroAssembler
   void Popcntq(Register dst, Register src);
   void Popcntq(Register dst, Operand src);
 
-  void Cmp(Register dst, Smi src);
-  void Cmp(Operand dst, Smi src);
+  void Cmp(Register dst, Tagged<Smi> src);
+  void Cmp(Operand dst, Tagged<Smi> src);
   void Cmp(Register dst, int32_t src);
 
   void CmpTagged(const Register& src1, const Register& src2) {
     cmp_tagged(src1, src2);
   }
 
+  // SIMD256
+  void I64x4Mul(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                YMMRegister tmp1, YMMRegister tmp2);
+  void F64x4Min(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                YMMRegister scratch);
+  void F64x4Max(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                YMMRegister scratch);
+  void F32x8Min(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                YMMRegister scratch);
+  void F32x8Max(YMMRegister dst, YMMRegister lhs, YMMRegister rhs,
+                YMMRegister scratch);
+  void I64x4ExtMul(YMMRegister dst, XMMRegister src1, XMMRegister src2,
+                   YMMRegister scratch, bool is_signed);
+  void I32x8ExtMul(YMMRegister dst, XMMRegister src1, XMMRegister src2,
+                   YMMRegister scratch, bool is_signed);
+  void I16x16ExtMul(YMMRegister dst, XMMRegister src1, XMMRegister src2,
+                    YMMRegister scratch, bool is_signed);
+#define MACRO_ASM_X64_IEXTADDPAIRWISE_LIST(V) \
+  V(I32x8ExtAddPairwiseI16x16S)               \
+  V(I32x8ExtAddPairwiseI16x16U)               \
+  V(I16x16ExtAddPairwiseI8x32S)               \
+  V(I16x16ExtAddPairwiseI8x32U)
+
+#define DECLARE_IEXTADDPAIRWISE(ExtAddPairwiseOp) \
+  void ExtAddPairwiseOp(YMMRegister dst, YMMRegister src, YMMRegister scratch);
+  MACRO_ASM_X64_IEXTADDPAIRWISE_LIST(DECLARE_IEXTADDPAIRWISE)
+#undef DECLARE_IEXTADDPAIRWISE
+#undef MACRO_ASM_X64_IEXTADDPAIRWISE_LIST
+
+  void S256Not(YMMRegister dst, YMMRegister src, YMMRegister scratch);
+  void S256Select(YMMRegister dst, YMMRegister mask, YMMRegister src1,
+                  YMMRegister src2, YMMRegister scratch);
+
+// Splat
+#define MACRO_ASM_X64_ISPLAT_LIST(V) \
+  V(I8x32Splat, b, vmovd)            \
+  V(I16x16Splat, w, vmovd)           \
+  V(I32x8Splat, d, vmovd)            \
+  V(I64x4Splat, q, vmovq)
+
+#define DECLARE_ISPLAT(name, suffix, instr_mov) \
+  void name(YMMRegister dst, Register src);     \
+  void name(YMMRegister dst, Operand src);
+
+  MACRO_ASM_X64_ISPLAT_LIST(DECLARE_ISPLAT)
+
+#undef DECLARE_ISPLAT
+
+  void F64x4Splat(YMMRegister dst, XMMRegister src);
+  void F32x8Splat(YMMRegister dst, XMMRegister src);
+
   // ---------------------------------------------------------------------------
   // Conversions between tagged smi values and non-tagged integer values.
 
@@ -228,10 +280,10 @@ class V8_EXPORT_PRIVATE MacroAssembler
   // Simple comparison of smis.  Both sides must be known smis to use these,
   // otherwise use Cmp.
   void SmiCompare(Register smi1, Register smi2);
-  void SmiCompare(Register dst, Smi src);
+  void SmiCompare(Register dst, Tagged<Smi> src);
   void SmiCompare(Register dst, Operand src);
   void SmiCompare(Operand dst, Register src);
-  void SmiCompare(Operand dst, Smi src);
+  void SmiCompare(Operand dst, Tagged<Smi> src);
 
   // Functions performing a check on a known or potential smi. Returns
   // a condition that is satisfied if the check is successful.
@@ -267,7 +319,7 @@ class V8_EXPORT_PRIVATE MacroAssembler
 
   // Add an integer constant to a tagged smi, giving a tagged smi as result.
   // No overflow testing on the result is done.
-  void SmiAddConstant(Operand dst, Smi constant);
+  void SmiAddConstant(Operand dst, Tagged<Smi> constant);
 
   // Specialized operations
 
@@ -320,16 +372,20 @@ class V8_EXPORT_PRIVATE MacroAssembler
     }
   }
   void Move(Operand dst, intptr_t x);
-  void Move(Register dst, Smi source);
+  void Move(Register dst, Tagged<Smi> source);
 
-  void Move(Operand dst, Smi source) {
+  void Move(Operand dst, Tagged<Smi> source) {
     Register constant = GetSmiConstant(source);
     movq(dst, constant);
   }
 
-  void Move(Register dst, TaggedIndex source) { Move(dst, source.ptr()); }
+  void Move(Register dst, Tagged<TaggedIndex> source) {
+    Move(dst, source.ptr());
+  }
 
-  void Move(Operand dst, TaggedIndex source) { Move(dst, source.ptr()); }
+  void Move(Operand dst, Tagged<TaggedIndex> source) {
+    Move(dst, source.ptr());
+  }
 
   void Move(Register dst, ExternalReference ext);
 
@@ -410,11 +466,16 @@ class V8_EXPORT_PRIVATE MacroAssembler
   void TailCallBuiltin(Builtin builtin, Condition cc);
 
   // Load the code entry point from the Code object.
-  void LoadCodeEntry(Register destination, Register code_object);
+  void LoadCodeInstructionStart(Register destination, Register code_object);
   void CallCodeObject(Register code_object);
   void JumpCodeObject(Register code_object,
                       JumpMode jump_mode = JumpMode::kJump);
 
+  // Convenience functions to call/jmp to the code of a JSFunction object.
+  void CallJSFunction(Register function_object);
+  void JumpJSFunction(Register function_object,
+                      JumpMode jump_mode = JumpMode::kJump);
+
   void Jump(Address destination, RelocInfo::Mode rmode);
   void Jump(Address destination, RelocInfo::Mode rmode, Condition cc);
   void Jump(const ExternalReference& reference);
@@ -483,12 +544,18 @@ class V8_EXPORT_PRIVATE MacroAssembler
   // --debug-code.
   void AssertCode(Register object) NOOP_UNLESS_DEBUG_CODE;
 
+  // Abort execution if argument is not smi nor in the pointer compresssion
+  // cage, enabled via --debug-code.
+  void AssertSmiOrHeapObjectInCompressionCage(Register object)
+      NOOP_UNLESS_DEBUG_CODE;
+
   // Print a message to stdout and abort execution.
   void Abort(AbortReason msg);
 
-  // Check that the stack is aligned.
   void CheckStackAlignment();
 
+  void AlignStackPointer();
+
   // Activation support.
   void EnterFrame(StackFrame::Type type);
   void EnterFrame(StackFrame::Type type, bool load_constant_pool_pointer_reg) {
@@ -528,10 +595,12 @@ class V8_EXPORT_PRIVATE MacroAssembler
 
   void CallRecordWriteStubSaveRegisters(
       Register object, Register slot_address, SaveFPRegsMode fp_mode,
-      StubCallMode mode = StubCallMode::kCallBuiltinPointer);
+      StubCallMode mode = StubCallMode::kCallBuiltinPointer,
+      PointerType type = PointerType::kDirect);
   void CallRecordWriteStub(
       Register object, Register slot_address, SaveFPRegsMode fp_mode,
-      StubCallMode mode = StubCallMode::kCallBuiltinPointer);
+      StubCallMode mode = StubCallMode::kCallBuiltinPointer,
+      PointerType type = PointerType::kDirect);
 
 #ifdef V8_IS_TSAN
   void CallTSANStoreStub(Register address, Register value,
@@ -612,7 +681,7 @@ class V8_EXPORT_PRIVATE MacroAssembler
   // location.
   void StoreTaggedField(Operand dst_field_operand, Immediate immediate);
   void StoreTaggedField(Operand dst_field_operand, Register value);
-  void StoreTaggedSignedField(Operand dst_field_operand, Smi value);
+  void StoreTaggedSignedField(Operand dst_field_operand, Tagged<Smi> value);
   void AtomicStoreTaggedField(Operand dst_field_operand, Register value);
 
   // The following macros work even when pointer compression is not enabled.
@@ -643,6 +712,23 @@ class V8_EXPORT_PRIVATE MacroAssembler
                                 IsolateRootLocation isolateRootLocation =
                                     IsolateRootLocation::kInRootRegister);
 
+  // Loads an indirect pointer from the heap.
+  void LoadIndirectPointerField(Register destination, Operand field_operand,
+                                Register scratch);
+
+  // Store an indirect pointer to the given object in the destination field.
+  void StoreIndirectPointerField(Operand dst_field_operand, Register value);
+
+  // Store an indirect (if the sandbox is enabled) or direct/tagged (otherwise)
+  // pointer to the given object in the destination field.
+  void StoreMaybeIndirectPointerField(Operand dst_field_operand,
+                                      Register value);
+
+  // Laod a pointer to a code entrypoint from the heap.
+  // When the sandbox is enabled the pointer is loaded indirectly via the code
+  // pointer table, otherwise it is loaded direclty as a raw pointer.
+  void LoadCodeEntrypointField(Register destination, Operand field_operand);
+
   // Loads and stores the value of an external reference.
   // Special case code for load and store to take advantage of
   // load_rax/store_rax if possible/necessary.
@@ -695,7 +781,8 @@ class V8_EXPORT_PRIVATE MacroAssembler
   // the tagged HeapObject pointer.  For use with FieldOperand(reg, off).
   void RecordWriteField(Register object, int offset, Register value,
                         Register slot_address, SaveFPRegsMode save_fp,
-                        SmiCheck smi_check = SmiCheck::kInline);
+                        SmiCheck smi_check = SmiCheck::kInline,
+                        PointerType type = PointerType::kDirect);
 
   // For page containing |object| mark region covering |address|
   // dirty. |object| is the object being stored into, |value| is the
@@ -704,9 +791,13 @@ class V8_EXPORT_PRIVATE MacroAssembler
   // the write barrier if the value is a smi.
   void RecordWrite(Register object, Register slot_address, Register value,
                    SaveFPRegsMode save_fp,
-                   SmiCheck smi_check = SmiCheck::kInline);
+                   SmiCheck smi_check = SmiCheck::kInline,
+                   PointerType type = PointerType::kDirect);
 
-  void EnterExitFrame(int reserved_stack_slots, StackFrame::Type frame_type);
+  // Allocates an EXIT/BUILTIN_EXIT/API_CALLBACK_EXIT frame with given number
+  // of slots in non-GCed area.
+  void EnterExitFrame(int extra_slots, StackFrame::Type frame_type,
+                      Register c_function);
   void LeaveExitFrame();
 
   // ---------------------------------------------------------------------------
@@ -797,6 +888,7 @@ class V8_EXPORT_PRIVATE MacroAssembler
   }
 
   void TestCodeIsMarkedForDeoptimization(Register code);
+  void TestCodeIsTurbofanned(Register code);
   Immediate ClearedValue() const;
 
   // Tiering support.
@@ -806,12 +898,20 @@ class V8_EXPORT_PRIVATE MacroAssembler
                                            Register slot_address);
   void GenerateTailCallToReturnedCode(Runtime::FunctionId function_id,
                                       JumpMode jump_mode = JumpMode::kJump);
-  void LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-      Register flags, Register feedback_vector, CodeKind current_code_kind,
+  Condition CheckFeedbackVectorFlagsNeedsProcessing(Register feedback_vector,
+                                                    CodeKind current_code_kind);
+  void CheckFeedbackVectorFlagsAndJumpIfNeedsProcessing(
+      Register feedback_vector, CodeKind current_code_kind,
       Label* flags_need_processing);
-  void OptimizeCodeOrTailCallOptimizedCodeSlot(
-      Register flags, Register feedback_vector, Register closure,
-      JumpMode jump_mode = JumpMode::kJump);
+  void OptimizeCodeOrTailCallOptimizedCodeSlot(Register feedback_vector,
+                                               Register closure,
+                                               JumpMode jump_mode);
+  // For compatibility with other archs.
+  void OptimizeCodeOrTailCallOptimizedCodeSlot(Register flags,
+                                               Register feedback_vector) {
+    OptimizeCodeOrTailCallOptimizedCodeSlot(
+        feedback_vector, kJSFunctionRegister, JumpMode::kJump);
+  }
 
   // Abort execution if argument is not a Constructor, enabled via --debug-code.
   void AssertConstructor(Register object) NOOP_UNLESS_DEBUG_CODE;
@@ -835,6 +935,9 @@ class V8_EXPORT_PRIVATE MacroAssembler
   // via --debug-code.
   void AssertUndefinedOrAllocationSite(Register object) NOOP_UNLESS_DEBUG_CODE;
 
+  void AssertJSAny(Register object, Register map_tmp,
+                   AbortReason abort_reason) NOOP_UNLESS_DEBUG_CODE;
+
   // ---------------------------------------------------------------------------
   // Exception handling
 
@@ -858,8 +961,9 @@ class V8_EXPORT_PRIVATE MacroAssembler
   // Falls through and sets scratch_and_result to 0 on failure, jumps to
   // on_result on success.
   void TryLoadOptimizedOsrCode(Register scratch_and_result,
-                               Register feedback_vector, FeedbackSlot slot,
-                               Label* on_result, Label::Distance distance);
+                               CodeKind min_opt_level, Register feedback_vector,
+                               FeedbackSlot slot, Label* on_result,
+                               Label::Distance distance);
 
   // ---------------------------------------------------------------------------
   // Runtime calls
@@ -914,7 +1018,7 @@ class V8_EXPORT_PRIVATE MacroAssembler
 
   // Returns a register holding the smi value. The register MUST NOT be
   // modified. It may be the "smi 1 constant" register.
-  Register GetSmiConstant(Smi value);
+  Register GetSmiConstant(Tagged<Smi> value);
 
   // Drops arguments assuming that the return address was already popped.
   void DropArguments(Register count, ArgumentsCountType type = kCountIsInteger,
@@ -958,12 +1062,40 @@ inline Operand FieldOperand(Register object, Register index, ScaleFactor scale,
   return Operand(object, index, scale, offset - kHeapObjectTag);
 }
 
+// Provides access to exit frame stack space (not GC-ed).
+inline Operand ExitFrameStackSlotOperand(int offset) {
+#ifdef V8_TARGET_OS_WIN
+  return Operand(rsp, offset + kWindowsHomeStackSlots * kSystemPointerSize);
+#else
+  return Operand(rsp, offset);
+#endif
+}
+
+// Provides access to exit frame parameters (GC-ed).
+inline Operand ExitFrameCallerStackSlotOperand(int index) {
+  return Operand(rbp,
+                 (BuiltinExitFrameConstants::kFixedSlotCountAboveFp + index) *
+                     kSystemPointerSize);
+}
+
 struct MoveCycleState {
   // Whether a move in the cycle needs the scratch or double scratch register.
   bool pending_scratch_register_use = false;
   bool pending_double_scratch_register_use = false;
 };
 
+// Calls an API function.  Allocates HandleScope, extracts returned value
+// from handle and propagates exceptions.  Clobbers r12, r15 and caller-saved
+// registers.  Restores context.  On return removes
+// *stack_space_operand * kSystemPointerSize or stack_space * kSystemPointerSize
+// (GCed, includes the call JS arguments space and the additional space
+// allocated for the fast call).
+void CallApiFunctionAndReturn(MacroAssembler* masm, bool with_profiling,
+                              Register function_address,
+                              ExternalReference thunk_ref, Register thunk_arg,
+                              int stack_space, Operand* stack_space_operand,
+                              Operand return_value_operand);
+
 #define ACCESS_MASM(masm) masm->
 
 }  // namespace internal
diff --git a/deps/v8/src/codegen/x64/register-x64.h b/deps/v8/src/codegen/x64/register-x64.h
index 6adf816dd3cc1d..7dc9b8bc4d022c 100644
--- a/deps/v8/src/codegen/x64/register-x64.h
+++ b/deps/v8/src/codegen/x64/register-x64.h
@@ -88,6 +88,13 @@ ASSERT_TRIVIALLY_COPYABLE(Register);
 static_assert(sizeof(Register) <= sizeof(int),
               "Register can efficiently be passed by value");
 
+// Assign |source| value to |no_reg| and return the |source|'s previous value.
+inline Register ReassignRegister(Register& source) {
+  Register result = source;
+  source = Register::no_reg();
+  return result;
+}
+
 #define DECLARE_REGISTER(R) \
   constexpr Register R = Register::from_code(kRegCode_##R);
 GENERAL_REGISTERS(DECLARE_REGISTER)
diff --git a/deps/v8/src/codegen/x64/sse-instr.h b/deps/v8/src/codegen/x64/sse-instr.h
index 8b0b2935ce5b86..5b075958c36137 100644
--- a/deps/v8/src/codegen/x64/sse-instr.h
+++ b/deps/v8/src/codegen/x64/sse-instr.h
@@ -183,12 +183,15 @@
 // SSE instructions whose AVX version has two operands.
 #define SSE4_UNOP_INSTRUCTION_LIST(V) \
   V(ptest, 66, 0F, 38, 17)            \
-  V(pmovsxbw, 66, 0F, 38, 20)         \
-  V(pmovsxwd, 66, 0F, 38, 23)         \
-  V(pmovsxdq, 66, 0F, 38, 25)         \
-  V(pmovzxbw, 66, 0F, 38, 30)         \
-  V(pmovzxbd, 66, 0F, 38, 31)         \
-  V(pmovzxwd, 66, 0F, 38, 33)         \
+  SSE4_UNOP_INSTRUCTION_LIST_PMOV(V)
+
+#define SSE4_UNOP_INSTRUCTION_LIST_PMOV(V) \
+  V(pmovsxbw, 66, 0F, 38, 20)              \
+  V(pmovsxwd, 66, 0F, 38, 23)              \
+  V(pmovsxdq, 66, 0F, 38, 25)              \
+  V(pmovzxbw, 66, 0F, 38, 30)              \
+  V(pmovzxbd, 66, 0F, 38, 31)              \
+  V(pmovzxwd, 66, 0F, 38, 33)              \
   V(pmovzxdq, 66, 0F, 38, 35)
 
 #define SSE4_EXTRACT_INSTRUCTION_LIST(V) \
@@ -201,8 +204,9 @@
 
 // These require AVX2.
 #define AVX2_BROADCAST_LIST(V)    \
-  V(vpbroadcastd, 66, 0F, 38, 58) \
   V(vpbroadcastb, 66, 0F, 38, 78) \
-  V(vpbroadcastw, 66, 0F, 38, 79)
+  V(vpbroadcastw, 66, 0F, 38, 79) \
+  V(vpbroadcastd, 66, 0F, 38, 58) \
+  V(vpbroadcastq, 66, 0F, 38, 59)
 
 #endif  // V8_CODEGEN_X64_SSE_INSTR_H_
diff --git a/deps/v8/src/common/assert-scope.h b/deps/v8/src/common/assert-scope.h
index 5eb04c59bbb1c5..42d9649c5250c0 100644
--- a/deps/v8/src/common/assert-scope.h
+++ b/deps/v8/src/common/assert-scope.h
@@ -296,7 +296,7 @@ class DisallowHeapAccessIf {
 class V8_NODISCARD NoGarbageCollectionMutexGuard {
  public:
   explicit NoGarbageCollectionMutexGuard(base::Mutex* mutex)
-      : guard_(mutex), mutex_(mutex), no_gc_(new DisallowGarbageCollection()) {}
+      : guard_(mutex), mutex_(mutex), no_gc_(base::in_place) {}
 
   void Unlock() {
     mutex_->Unlock();
@@ -304,13 +304,13 @@ class V8_NODISCARD NoGarbageCollectionMutexGuard {
   }
   void Lock() {
     mutex_->Lock();
-    no_gc_.reset(new DisallowGarbageCollection());
+    no_gc_.emplace();
   }
 
  private:
   base::MutexGuard guard_;
   base::Mutex* mutex_;
-  std::unique_ptr<DisallowGarbageCollection> no_gc_;
+  base::Optional<DisallowGarbageCollection> no_gc_;
 };
 
 // Explicit instantiation declarations.
diff --git a/deps/v8/src/common/code-memory-access-inl.h b/deps/v8/src/common/code-memory-access-inl.h
index 2b504b86f34390..e357648966ed05 100644
--- a/deps/v8/src/common/code-memory-access-inl.h
+++ b/deps/v8/src/common/code-memory-access-inl.h
@@ -18,7 +18,6 @@ namespace v8 {
 namespace internal {
 
 RwxMemoryWriteScope::RwxMemoryWriteScope(const char* comment) {
-  DCHECK(is_key_permissions_initialized_for_current_thread());
   if (!v8_flags.jitless) {
     SetWritable();
   }
@@ -30,11 +29,82 @@ RwxMemoryWriteScope::~RwxMemoryWriteScope() {
   }
 }
 
+ThreadIsolation::WritableJitAllocation::WritableJitAllocation(
+    Address addr, size_t size, JitAllocationType type,
+    JitAllocationSource source)
+    : address_(addr),
+      // The order of these is important. We need to create the write scope
+      // before we lookup the Jit page, since the latter will take a mutex in
+      // protected memory.
+      write_scope_("WritableJitAllocation"),
+      page_ref_(ThreadIsolation::LookupJitPage(addr, size)),
+      allocation_(source == JitAllocationSource::kRegister
+                      ? page_ref_.RegisterAllocation(addr, size, type)
+                      : page_ref_.LookupAllocation(addr, size, type)) {}
+
+template <typename T, size_t offset>
+void ThreadIsolation::WritableJitAllocation::WriteHeaderSlot(T value) {
+  // These asserts are no strict requirements, they just guard against
+  // non-implemented functionality.
+  static_assert(!std::is_convertible_v<T, Object>);
+  static_assert(offset != HeapObject::kMapOffset);
+
+  WriteMaybeUnalignedValue<T>(address_ + offset, value);
+}
+
+template <typename T, size_t offset>
+void ThreadIsolation::WritableJitAllocation::WriteHeaderSlot(T value,
+                                                             ReleaseStoreTag) {
+  // These asserts are no strict requirements, they just guard against
+  // non-implemented functionality.
+  static_assert(std::is_convertible_v<T, Object>);
+  static_assert(offset != HeapObject::kMapOffset);
+
+  TaggedField<T, offset>::Release_Store(HeapObject::FromAddress(address_),
+                                        value);
+}
+
+template <typename T, size_t offset>
+void ThreadIsolation::WritableJitAllocation::WriteHeaderSlot(T value,
+                                                             RelaxedStoreTag) {
+  // These asserts are no strict requirements, they just guard against
+  // non-implemented functionality.
+  static_assert(std::is_convertible_v<T, Object>);
+
+  if constexpr (offset == HeapObject::kMapOffset) {
+    TaggedField<T, offset>::Relaxed_Store_Map_Word(
+        HeapObject::FromAddress(address_), value);
+  } else {
+    TaggedField<T, offset>::Relaxed_Store(HeapObject::FromAddress(address_),
+                                          value);
+  }
+}
+
+void ThreadIsolation::WritableJitAllocation::CopyCode(size_t dst_offset,
+                                                      const uint8_t* src,
+                                                      size_t num_bytes) {
+  CopyBytes(reinterpret_cast<uint8_t*>(address_ + dst_offset), src, num_bytes);
+}
+
+void ThreadIsolation::WritableJitAllocation::CopyData(size_t dst_offset,
+                                                      const uint8_t* src,
+                                                      size_t num_bytes) {
+  CopyBytes(reinterpret_cast<uint8_t*>(address_ + dst_offset), src, num_bytes);
+}
+
+void ThreadIsolation::WritableJitAllocation::ClearBytes(size_t offset,
+                                                        size_t len) {
+  memset(reinterpret_cast<void*>(address_ + offset), 0, len);
+}
+
 #if V8_HAS_PTHREAD_JIT_WRITE_PROTECT
 
 // static
 bool RwxMemoryWriteScope::IsSupported() { return true; }
 
+// static
+bool RwxMemoryWriteScope::IsSupportedUntrusted() { return true; }
+
 // static
 void RwxMemoryWriteScope::SetWritable() {
   if (code_space_write_nesting_level_ == 0) {
@@ -55,35 +125,45 @@ void RwxMemoryWriteScope::SetExecutable() {
 // static
 bool RwxMemoryWriteScope::IsSupported() {
   static_assert(base::MemoryProtectionKey::kNoMemoryProtectionKey == -1);
-  DCHECK(pkey_initialized);
-  return memory_protection_key_ >= 0;
+  DCHECK(ThreadIsolation::initialized());
+  // TODO(sroettger): can we check this at initialization time instead? The
+  // tests won't be able to run with/without pkey support anymore in the same
+  // process.
+  return v8_flags.memory_protection_keys && ThreadIsolation::pkey() >= 0;
+}
+
+// static
+bool RwxMemoryWriteScope::IsSupportedUntrusted() {
+  DCHECK(ThreadIsolation::initialized());
+  return v8_flags.memory_protection_keys &&
+         ThreadIsolation::untrusted_pkey() >= 0;
 }
 
 // static
 void RwxMemoryWriteScope::SetWritable() {
-  DCHECK(pkey_initialized);
+  DCHECK(ThreadIsolation::initialized());
   if (!IsSupported()) return;
   if (code_space_write_nesting_level_ == 0) {
     DCHECK_NE(
-        base::MemoryProtectionKey::GetKeyPermission(memory_protection_key_),
+        base::MemoryProtectionKey::GetKeyPermission(ThreadIsolation::pkey()),
         base::MemoryProtectionKey::kNoRestrictions);
     base::MemoryProtectionKey::SetPermissionsForKey(
-        memory_protection_key_, base::MemoryProtectionKey::kNoRestrictions);
+        ThreadIsolation::pkey(), base::MemoryProtectionKey::kNoRestrictions);
   }
   code_space_write_nesting_level_++;
 }
 
 // static
 void RwxMemoryWriteScope::SetExecutable() {
-  DCHECK(pkey_initialized);
+  DCHECK(ThreadIsolation::initialized());
   if (!IsSupported()) return;
   code_space_write_nesting_level_--;
   if (code_space_write_nesting_level_ == 0) {
     DCHECK_EQ(
-        base::MemoryProtectionKey::GetKeyPermission(memory_protection_key_),
+        base::MemoryProtectionKey::GetKeyPermission(ThreadIsolation::pkey()),
         base::MemoryProtectionKey::kNoRestrictions);
     base::MemoryProtectionKey::SetPermissionsForKey(
-        memory_protection_key_, base::MemoryProtectionKey::kDisableWrite);
+        ThreadIsolation::pkey(), base::MemoryProtectionKey::kDisableWrite);
   }
 }
 
@@ -92,6 +172,9 @@ void RwxMemoryWriteScope::SetExecutable() {
 // static
 bool RwxMemoryWriteScope::IsSupported() { return false; }
 
+// static
+bool RwxMemoryWriteScope::IsSupportedUntrusted() { return false; }
+
 // static
 void RwxMemoryWriteScope::SetWritable() {}
 
diff --git a/deps/v8/src/common/code-memory-access.cc b/deps/v8/src/common/code-memory-access.cc
index aaad4e000ce115..34ee8c78ca5dbc 100644
--- a/deps/v8/src/common/code-memory-access.cc
+++ b/deps/v8/src/common/code-memory-access.cc
@@ -3,101 +3,608 @@
 // found in the LICENSE file.
 
 #include "src/common/code-memory-access-inl.h"
+#include "src/utils/allocation.h"
 
 namespace v8 {
 namespace internal {
 
+ThreadIsolation::TrustedData ThreadIsolation::trusted_data_;
+ThreadIsolation::UntrustedData ThreadIsolation::untrusted_data_;
+
 #if V8_HAS_PTHREAD_JIT_WRITE_PROTECT || V8_HAS_PKU_JIT_WRITE_PROTECT
 thread_local int RwxMemoryWriteScope::code_space_write_nesting_level_ = 0;
 #endif  // V8_HAS_PTHREAD_JIT_WRITE_PROTECT || V8_HAS_PKU_JIT_WRITE_PROTECT
 
 #if V8_HAS_PKU_JIT_WRITE_PROTECT
-int RwxMemoryWriteScope::memory_protection_key_ =
-    base::MemoryProtectionKey::kNoMemoryProtectionKey;
 
-#if DEBUG
-thread_local bool
-    RwxMemoryWriteScope::is_key_permissions_initialized_for_current_thread_ =
-        false;
-bool RwxMemoryWriteScope::pkey_initialized = false;
+// static
+int RwxMemoryWriteScope::memory_protection_key() {
+  return ThreadIsolation::pkey();
+}
 
-bool RwxMemoryWriteScope::is_key_permissions_initialized_for_current_thread() {
-  return is_key_permissions_initialized_for_current_thread_;
+bool RwxMemoryWriteScope::IsPKUWritable() {
+  DCHECK(ThreadIsolation::initialized());
+  return base::MemoryProtectionKey::GetKeyPermission(ThreadIsolation::pkey()) ==
+         base::MemoryProtectionKey::kNoRestrictions;
 }
-#endif  // DEBUG
 
-void RwxMemoryWriteScope::InitializeMemoryProtectionKey() {
-  // Flip {pkey_initialized} (in debug mode) and check the new value.
-  DCHECK_EQ(true, pkey_initialized = !pkey_initialized);
-  memory_protection_key_ = base::MemoryProtectionKey::AllocateKey();
-  DCHECK(memory_protection_key_ > 0 ||
-         memory_protection_key_ ==
-             base::MemoryProtectionKey::kNoMemoryProtectionKey);
+void RwxMemoryWriteScope::SetDefaultPermissionsForSignalHandler() {
+  DCHECK(ThreadIsolation::initialized());
+  if (!RwxMemoryWriteScope::IsSupportedUntrusted()) return;
+  base::MemoryProtectionKey::SetPermissionsForKey(
+      ThreadIsolation::untrusted_pkey(),
+      base::MemoryProtectionKey::kDisableWrite);
 }
 
-bool RwxMemoryWriteScope::IsPKUWritable() {
-  DCHECK(pkey_initialized);
-  return base::MemoryProtectionKey::GetKeyPermission(memory_protection_key_) ==
-         base::MemoryProtectionKey::kNoRestrictions;
+#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
+
+RwxMemoryWriteScopeForTesting::RwxMemoryWriteScopeForTesting()
+    : RwxMemoryWriteScope("For Testing") {}
+
+RwxMemoryWriteScopeForTesting::~RwxMemoryWriteScopeForTesting() {}
+
+// static
+bool ThreadIsolation::Enabled() {
+#if V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
+  return allocator() != nullptr;
+#else
+  return false;
+#endif
 }
 
-ResetPKUPermissionsForThreadSpawning::ResetPKUPermissionsForThreadSpawning() {
-  if (!RwxMemoryWriteScope::IsSupported()) return;
-  was_writable_ = RwxMemoryWriteScope::IsPKUWritable();
-  if (was_writable_) {
-    base::MemoryProtectionKey::SetPermissionsForKey(
-        RwxMemoryWriteScope::memory_protection_key(),
-        base::MemoryProtectionKey::kDisableWrite);
+// static
+template <typename T, typename... Args>
+void ThreadIsolation::ConstructNew(T** ptr, Args&&... args) {
+  if (Enabled()) {
+    *ptr = reinterpret_cast<T*>(trusted_data_.allocator->Allocate(sizeof(T)));
+    if (!*ptr) return;
+    new (*ptr) T(std::forward<Args>(args)...);
+  } else {
+    *ptr = new T(std::forward<Args>(args)...);
   }
 }
 
-ResetPKUPermissionsForThreadSpawning::~ResetPKUPermissionsForThreadSpawning() {
-  if (!RwxMemoryWriteScope::IsSupported()) return;
-  if (was_writable_) {
-    base::MemoryProtectionKey::SetPermissionsForKey(
-        RwxMemoryWriteScope::memory_protection_key(),
-        base::MemoryProtectionKey::kNoRestrictions);
+// static
+template <typename T>
+void ThreadIsolation::Delete(T* ptr) {
+  if (Enabled()) {
+    ptr->~T();
+    trusted_data_.allocator->Free(ptr);
+  } else {
+    delete ptr;
   }
 }
 
-void RwxMemoryWriteScope::SetDefaultPermissionsForNewThread() {
-  // TODO(v8:13023): consider initializing the permissions only once per thread
-  // if the SetPermissionsForKey() call is too heavy.
-  if (RwxMemoryWriteScope::IsSupported() &&
-      base::MemoryProtectionKey::GetKeyPermission(
-          RwxMemoryWriteScope::memory_protection_key()) ==
-          base::MemoryProtectionKey::kDisableAccess) {
-    base::MemoryProtectionKey::SetPermissionsForKey(
-        RwxMemoryWriteScope::memory_protection_key(),
-        base::MemoryProtectionKey::kDisableWrite);
-  }
+// static
+void ThreadIsolation::Initialize(
+    ThreadIsolatedAllocator* thread_isolated_allocator) {
 #if DEBUG
-  is_key_permissions_initialized_for_current_thread_ = true;
+  untrusted_data_.initialized = true;
+#endif
+
+  bool enable = thread_isolated_allocator != nullptr && !v8_flags.jitless;
+
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  if (enable &&
+      !base::MemoryProtectionKey::InitializeMemoryProtectionKeySupport()) {
+    enable = false;
+  }
+#endif
+
+  if (enable) {
+    trusted_data_.allocator = thread_isolated_allocator;
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+    trusted_data_.pkey = trusted_data_.allocator->Pkey();
+    untrusted_data_.pkey = trusted_data_.pkey;
+#endif
+  }
+
+  {
+    // We need to allocate the memory for jit page tracking even if we don't
+    // enable the ThreadIsolation protections.
+    RwxMemoryWriteScope write_scope("Initialize thread isolation.");
+    ConstructNew(&trusted_data_.jit_pages_mutex_);
+    ConstructNew(&trusted_data_.jit_pages_);
+  }
+
+  if (!enable) {
+    return;
+  }
+
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  // Check that our compile time assumed page size that we use for padding was
+  // large enough.
+  CHECK_GE(THREAD_ISOLATION_ALIGN_SZ,
+           GetPlatformPageAllocator()->CommitPageSize());
+
+  base::MemoryProtectionKey::SetPermissionsAndKey(
+      {reinterpret_cast<Address>(&trusted_data_), sizeof(trusted_data_)},
+      v8::PageAllocator::Permission::kRead, trusted_data_.pkey);
 #endif
 }
 
-void RwxMemoryWriteScope::SetDefaultPermissionsForSignalHandler() {
-  DCHECK(pkey_initialized);
-  DCHECK(is_key_permissions_initialized_for_current_thread_);
-  if (!RwxMemoryWriteScope::IsSupported()) return;
-  base::MemoryProtectionKey::SetPermissionsForKey(
-      memory_protection_key_, base::MemoryProtectionKey::kDisableWrite);
+// static
+ThreadIsolation::JitPageReference ThreadIsolation::LookupJitPageLocked(
+    Address addr, size_t size) {
+  trusted_data_.jit_pages_mutex_->AssertHeld();
+  base::Optional<JitPageReference> jit_page =
+      TryLookupJitPageLocked(addr, size);
+  CHECK(jit_page.has_value());
+  return std::move(jit_page.value());
 }
-#else  // !V8_HAS_PKU_JIT_WRITE_PROTECT
 
-void RwxMemoryWriteScope::SetDefaultPermissionsForNewThread() {}
+// static
+ThreadIsolation::JitPageReference ThreadIsolation::LookupJitPage(Address addr,
+                                                                 size_t size) {
+  base::MutexGuard guard(trusted_data_.jit_pages_mutex_);
+  return LookupJitPageLocked(addr, size);
+}
 
-#if DEBUG
-bool RwxMemoryWriteScope::is_key_permissions_initialized_for_current_thread() {
+// static
+base::Optional<ThreadIsolation::JitPageReference>
+ThreadIsolation::TryLookupJitPage(Address addr, size_t size) {
+  base::MutexGuard guard(trusted_data_.jit_pages_mutex_);
+  return TryLookupJitPageLocked(addr, size);
+}
+
+// static
+base::Optional<ThreadIsolation::JitPageReference>
+ThreadIsolation::TryLookupJitPageLocked(Address addr, size_t size) {
+  trusted_data_.jit_pages_mutex_->AssertHeld();
+
+  Address end = addr + size;
+  CHECK_GT(end, addr);
+
+  // upper_bound gives us an iterator to the position after address.
+  auto it = trusted_data_.jit_pages_->upper_bound(addr);
+
+  // The previous page should be the one we're looking for.
+  if (it == trusted_data_.jit_pages_->begin()) {
+    return {};
+  }
+
+  it--;
+
+  JitPageReference jit_page(it->second, it->first);
+
+  // If the address is not in the range of the jit page, return.
+  if (jit_page.End() <= addr) {
+    return {};
+  }
+
+  if (jit_page.End() >= end) {
+    return jit_page;
+  }
+
+  // It's possible that the allocation spans multiple pages, merge them.
+  auto to_delete_start = ++it;
+  for (; jit_page.End() < end && it != trusted_data_.jit_pages_->end(); it++) {
+    {
+      JitPageReference next_page(it->second, it->first);
+      CHECK_EQ(next_page.Address(), jit_page.End());
+      jit_page.Merge(next_page);
+    }
+    Delete(it->second);
+  }
+
+  trusted_data_.jit_pages_->erase(to_delete_start, it);
+
+  if (jit_page.End() < end) {
+    return {};
+  }
+
+  return jit_page;
+}
+
+namespace {
+
+size_t GetSize(ThreadIsolation::JitPage* jit_page) {
+  return ThreadIsolation::JitPageReference(jit_page, 0).Size();
+}
+
+size_t GetSize(ThreadIsolation::JitAllocation allocation) {
+  return allocation.Size();
+}
+
+template <class T>
+void CheckForRegionOverlap(const T& map, Address addr, size_t size) {
+  // The data is untrusted from the pov of CFI, so we check that there's no
+  // overlaps with existing regions etc.
+  CHECK_GE(addr + size, addr);
+
+  // Find an entry in the map with key > addr
+  auto it = map.upper_bound(addr);
+  bool is_begin = it == map.begin();
+  bool is_end = it == map.end();
+
+  // Check for overlap with the next entry
+  if (!is_end) {
+    Address next_addr = it->first;
+    Address offset = next_addr - addr;
+    CHECK_LE(size, offset);
+  }
+
+  // Check the previous entry for overlap
+  if (!is_begin) {
+    it--;
+    Address prev_addr = it->first;
+    const typename T::value_type::second_type& prev_entry = it->second;
+    Address offset = addr - prev_addr;
+    CHECK_LE(GetSize(prev_entry), offset);
+  }
+}
+
+}  // namespace
+
+ThreadIsolation::JitPageReference::JitPageReference(class JitPage* jit_page,
+                                                    base::Address address)
+    : page_lock_(&jit_page->mutex_), jit_page_(jit_page), address_(address) {}
+
+ThreadIsolation::JitPage::~JitPage() {
+  // TODO(sroettger): check that the page is not in use (scan shadow stacks).
+}
+
+size_t ThreadIsolation::JitPageReference::Size() const {
+  return jit_page_->size_;
+}
+
+bool ThreadIsolation::JitPageReference::Empty() const {
+  return jit_page_->allocations_.empty();
+}
+
+void ThreadIsolation::JitPageReference::Shrink(class JitPage* tail) {
+  jit_page_->size_ -= tail->size_;
+  // Move all allocations that are out of bounds.
+  auto it = jit_page_->allocations_.lower_bound(End());
+  tail->allocations_.insert(it, jit_page_->allocations_.end());
+  jit_page_->allocations_.erase(it, jit_page_->allocations_.end());
+}
+
+void ThreadIsolation::JitPageReference::Expand(size_t offset) {
+  jit_page_->size_ += offset;
+}
+
+void ThreadIsolation::JitPageReference::Merge(JitPageReference& next) {
+  DCHECK_EQ(End(), next.Address());
+  jit_page_->size_ += next.jit_page_->size_;
+  next.jit_page_->size_ = 0;
+  jit_page_->allocations_.merge(next.jit_page_->allocations_);
+  DCHECK(next.jit_page_->allocations_.empty());
+}
+
+ThreadIsolation::JitAllocation&
+ThreadIsolation::JitPageReference::RegisterAllocation(base::Address addr,
+                                                      size_t size,
+                                                      JitAllocationType type) {
+  // The data is untrusted from the pov of CFI, so the checks are security
+  // sensitive.
+  CHECK_GE(addr, address_);
+  base::Address offset = addr - address_;
+  base::Address end_offset = offset + size;
+  CHECK_GT(end_offset, offset);
+  CHECK_GT(jit_page_->size_, offset);
+  CHECK_GE(jit_page_->size_, end_offset);
+
+  CheckForRegionOverlap(jit_page_->allocations_, addr, size);
+  return jit_page_->allocations_.emplace(addr, JitAllocation(size, type))
+      .first->second;
+}
+
+ThreadIsolation::JitAllocation&
+ThreadIsolation::JitPageReference::LookupAllocation(base::Address addr,
+                                                    size_t size,
+                                                    JitAllocationType type) {
+  auto it = jit_page_->allocations_.find(addr);
+  CHECK_NE(it, jit_page_->allocations_.end());
+  return it->second;
+}
+
+void ThreadIsolation::JitPageReference::UnregisterAllocation(
+    base::Address addr) {
+  // TODO(sroettger): check that the memory is not in use (scan shadow stacks).
+  CHECK_EQ(jit_page_->allocations_.erase(addr), 1);
+}
+
+void ThreadIsolation::JitPageReference::UnregisterAllocationsExcept(
+    base::Address start, size_t size, const std::vector<base::Address>& keep) {
+  // TODO(sroettger): check that the page is not in use (scan shadow stacks).
+  JitPage::AllocationMap keep_allocations;
+
+  auto keep_before = jit_page_->allocations_.lower_bound(start);
+  auto keep_after = jit_page_->allocations_.lower_bound(start + size);
+
+  // keep all allocations before the start address.
+  if (keep_before != jit_page_->allocations_.begin()) {
+    keep_before--;
+    keep_allocations.insert(jit_page_->allocations_.begin(), keep_before);
+  }
+
+  // from the start address, keep only allocations passed in the vector
+  auto keep_iterator = keep.begin();
+  for (auto it = keep_before; it != keep_after; it++) {
+    if (keep_iterator == keep.end()) break;
+    if (it->first == *keep_iterator) {
+      keep_allocations.emplace_hint(keep_allocations.end(), it->first,
+                                    it->second);
+      keep_iterator++;
+    }
+  }
+  CHECK_EQ(keep_iterator, keep.end());
+
+  // keep all allocations after the region
+  keep_allocations.insert(keep_after, jit_page_->allocations_.end());
+
+  jit_page_->allocations_.swap(keep_allocations);
+}
+
+base::Address ThreadIsolation::JitPageReference::StartOfAllocationAt(
+    base::Address inner_pointer) {
+  auto it = jit_page_->allocations_.upper_bound(inner_pointer);
+  CHECK_NE(it, jit_page_->allocations_.begin());
+  it--;
+  size_t offset = inner_pointer - it->first;
+  CHECK_GT(it->second.Size(), offset);
+  return it->first;
+}
+
+bool ThreadIsolation::JitPageReference::HasAllocation(base::Address address,
+                                                      size_t size) {
+  const auto it = jit_page_->allocations_.find(address);
+  if (it == jit_page_->allocations_.end()) {
+    return false;
+  }
+  CHECK_EQ(it->second.Size(), size);
   return true;
 }
-#endif  // DEBUG
+
+// static
+void ThreadIsolation::RegisterJitPage(Address address, size_t size) {
+  RwxMemoryWriteScope write_scope("Adding new executable memory.");
+
+  base::MutexGuard guard(trusted_data_.jit_pages_mutex_);
+  CheckForRegionOverlap(*trusted_data_.jit_pages_, address, size);
+  JitPage* jit_page;
+  ConstructNew(&jit_page, size);
+  trusted_data_.jit_pages_->emplace(address, jit_page);
+}
+
+void ThreadIsolation::UnregisterJitPage(Address address, size_t size) {
+  RwxMemoryWriteScope write_scope("Removing executable memory.");
+
+  JitPage* to_delete;
+  {
+    base::MutexGuard guard(trusted_data_.jit_pages_mutex_);
+    JitPageReference jit_page = LookupJitPageLocked(address, size);
+
+    // We're merging jit pages together, so potentially split them back up
+    // if we're only freeing a subrange.
+
+    Address to_free_end = address + size;
+    Address jit_page_end = jit_page.Address() + jit_page.Size();
+
+    if (to_free_end < jit_page_end) {
+      // There's a tail after the page that we release. Shrink the page and
+      // add the tail to the map.
+      size_t tail_size = jit_page_end - to_free_end;
+      JitPage* tail;
+      ConstructNew(&tail, tail_size);
+      jit_page.Shrink(tail);
+      trusted_data_.jit_pages_->emplace(to_free_end, tail);
+    }
+
+    DCHECK_EQ(to_free_end, jit_page.Address() + jit_page.Size());
+
+    if (address == jit_page.Address()) {
+      // We remove the start of the region, just remove it from the map.
+      to_delete = jit_page.JitPage();
+      trusted_data_.jit_pages_->erase(address);
+    } else {
+      // Otherwise, we need to shrink the region.
+      DCHECK_GT(address, jit_page.Address());
+      JitPage* tail;
+      ConstructNew(&tail, size);
+      jit_page.Shrink(tail);
+      to_delete = tail;
+    }
+  }
+  Delete(to_delete);
+}
+
+// static
+bool ThreadIsolation::MakeExecutable(Address address, size_t size) {
+  DCHECK(Enabled());
+
+  // TODO(sroettger): need to make sure that the memory is zero-initialized.
+  // maybe map over it with MAP_FIXED, or call MADV_DONTNEED, or fall back to
+  // memset.
+
+  // Check that the range is inside a tracked jit page.
+  JitPageReference jit_page = LookupJitPage(address, size);
+
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  return base::MemoryProtectionKey::SetPermissionsAndKey(
+      {address, size}, PageAllocator::Permission::kReadWriteExecute, pkey());
+#else   // V8_HAS_PKU_JIT_WRITE_PROTECT
+  UNREACHABLE();
 #endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
+}
 
-RwxMemoryWriteScopeForTesting::RwxMemoryWriteScopeForTesting()
-    : RwxMemoryWriteScope("For Testing") {}
+// static
+ThreadIsolation::WritableJitAllocation ThreadIsolation::RegisterJitAllocation(
+    Address obj, size_t size, JitAllocationType type) {
+  return WritableJitAllocation(
+      obj, size, type, WritableJitAllocation::JitAllocationSource::kRegister);
+}
 
-RwxMemoryWriteScopeForTesting::~RwxMemoryWriteScopeForTesting() {}
+// static
+ThreadIsolation::WritableJitAllocation
+ThreadIsolation::RegisterInstructionStreamAllocation(Address addr,
+                                                     size_t size) {
+  return RegisterJitAllocation(addr, size,
+                               JitAllocationType::kInstructionStream);
+}
+
+// static
+ThreadIsolation::WritableJitAllocation ThreadIsolation::LookupJitAllocation(
+    Address addr, size_t size, JitAllocationType type) {
+  return WritableJitAllocation(
+      addr, size, type, WritableJitAllocation::JitAllocationSource::kLookup);
+}
+
+// static
+void ThreadIsolation::RegisterJitAllocations(Address start,
+                                             const std::vector<size_t>& sizes,
+                                             JitAllocationType type) {
+  RwxMemoryWriteScope write_scope("Register bulk allocations.");
+
+  size_t total_size = 0;
+  for (auto size : sizes) {
+    total_size += size;
+  }
+
+  constexpr size_t kSplitThreshold = 0x40000;
+  JitPageReference page_ref = total_size >= kSplitThreshold
+                                  ? SplitJitPage(start, total_size)
+                                  : LookupJitPage(start, total_size);
+
+  for (auto size : sizes) {
+    page_ref.RegisterAllocation(start, size, type);
+    start += size;
+  }
+}
+
+// static
+void ThreadIsolation::UnregisterJitAllocationsInPageExceptForTesting(
+    Address page, size_t page_size, const std::vector<Address>& keep) {
+  LookupJitPage(page, page_size)
+      .UnregisterAllocationsExcept(page, page_size, keep);
+}
+
+void ThreadIsolation::RegisterJitAllocationForTesting(Address obj,
+                                                      size_t size) {
+  RegisterJitAllocation(obj, size, JitAllocationType::kInstructionStream);
+}
+
+// static
+void ThreadIsolation::UnregisterJitAllocationForTesting(Address addr,
+                                                        size_t size) {
+  LookupJitPage(addr, size).UnregisterAllocation(addr);
+}
+
+// static
+void ThreadIsolation::UnregisterInstructionStreamsInPageExcept(
+    MemoryChunk* chunk, const std::vector<Address>& keep) {
+  Address page = chunk->area_start();
+  size_t page_size = chunk->area_size();
+  LookupJitPage(page, page_size)
+      .UnregisterAllocationsExcept(page, page_size, keep);
+}
+
+// static
+void ThreadIsolation::RegisterWasmAllocation(Address addr, size_t size) {
+  LookupJitPage(addr, size)
+      .RegisterAllocation(addr, size, JitAllocationType::kWasmCode);
+}
+
+// static
+void ThreadIsolation::UnregisterWasmAllocation(Address addr, size_t size) {
+  LookupJitPage(addr, size).UnregisterAllocation(addr);
+}
+
+ThreadIsolation::JitPageReference ThreadIsolation::SplitJitPage(Address addr,
+                                                                size_t size) {
+  base::MutexGuard guard(trusted_data_.jit_pages_mutex_);
+
+  JitPageReference jit_page = LookupJitPageLocked(addr, size);
+
+  // Split the JitPage into upto three pages.
+  size_t head_size = addr - jit_page.Address();
+  size_t tail_size = jit_page.Size() - size - head_size;
+  if (tail_size > 0) {
+    JitPage* tail;
+    ConstructNew(&tail, tail_size);
+    jit_page.Shrink(tail);
+    trusted_data_.jit_pages_->emplace(addr + size, tail);
+  }
+  if (head_size > 0) {
+    JitPage* mid;
+    ConstructNew(&mid, size);
+    jit_page.Shrink(mid);
+    trusted_data_.jit_pages_->emplace(addr, mid);
+    return JitPageReference(mid, addr);
+  }
+
+  return jit_page;
+}
+
+// static
+base::Optional<Address> ThreadIsolation::StartOfJitAllocationAt(
+    Address inner_pointer) {
+  base::Optional<JitPageReference> page = TryLookupJitPage(inner_pointer, 1);
+  if (!page) {
+    return {};
+  }
+  return page->StartOfAllocationAt(inner_pointer);
+}
+
+namespace {
+
+class MutexUnlocker {
+ public:
+  explicit MutexUnlocker(base::Mutex& mutex) : mutex_(mutex) {
+    mutex_.AssertHeld();
+  }
+
+  ~MutexUnlocker() {
+    mutex_.AssertHeld();
+    mutex_.Unlock();
+  }
+
+ private:
+  base::Mutex& mutex_;
+};
+
+}  // namespace
+
+// static
+bool ThreadIsolation::CanLookupStartOfJitAllocationAt(Address inner_pointer) {
+  // Try to lock the pages mutex and the mutex of the page itself to prevent
+  // potential dead locks. The profiler can try to do a lookup from a signal
+  // handler. If that signal handler runs while the thread locked one of these
+  // mutexes, it would result in a dead lock.
+  bool pages_mutex_locked = trusted_data_.jit_pages_mutex_->TryLock();
+  if (!pages_mutex_locked) {
+    return false;
+  }
+  MutexUnlocker pages_mutex_unlocker(*trusted_data_.jit_pages_mutex_);
+
+  // upper_bound gives us an iterator to the position after address.
+  auto it = trusted_data_.jit_pages_->upper_bound(inner_pointer);
+
+  // The previous page should be the one we're looking for.
+  if (it == trusted_data_.jit_pages_->begin()) {
+    return {};
+  }
+  it--;
+
+  JitPage* jit_page = it->second;
+  bool jit_page_locked = jit_page->mutex_.TryLock();
+  if (!jit_page_locked) {
+    return false;
+  }
+  jit_page->mutex_.Unlock();
+
+  return true;
+}
+
+#if DEBUG
+
+// static
+void ThreadIsolation::CheckTrackedMemoryEmpty() {
+  DCHECK(trusted_data_.jit_pages_->empty());
+}
+
+#endif  // DEBUG
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/common/code-memory-access.h b/deps/v8/src/common/code-memory-access.h
index 253cb720fe67f1..c44982d2256025 100644
--- a/deps/v8/src/common/code-memory-access.h
+++ b/deps/v8/src/common/code-memory-access.h
@@ -5,20 +5,69 @@
 #ifndef V8_COMMON_CODE_MEMORY_ACCESS_H_
 #define V8_COMMON_CODE_MEMORY_ACCESS_H_
 
+#include <map>
+
+#include "include/v8-internal.h"
+#include "include/v8-platform.h"
 #include "src/base/build_config.h"
 #include "src/base/macros.h"
+#include "src/base/platform/mutex.h"
+#include "src/heap/memory-chunk.h"
 
 namespace v8 {
 namespace internal {
 
-class CodePageCollectionMemoryModificationScope;
+// We protect writes to executable memory in some configurations and whenever
+// we write to it, we need to explicitely allow it first.
+//
+// For this purposed, there are a few scope objects with different semantics:
+//
+// - CodePageHeaderModificationScope:
+//     Used when we write to the page header of CodeSpace pages. Only needed on
+//     Apple Silicon where we can't have RW- pages in the RWX space.
+// - CodePageMemoryModificationScope:
+//     Allows access to the allocation area of the CodeSpace pages.
+// - CodePageMemoryModificationScopeForDebugging:
+//     A scope only used in non-release builds, e.g. for code zapping.
+// - wasm::CodeSpaceWriteScope:
+//     Allows access to Wasm code
+//
+// - RwxMemoryWriteScope:
+//     A scope that uses per-thread permissions to allow access. Should not be
+//     used directly, but rather is the implementation of one of the above.
+// - RwxMemoryWriteScopeForTesting:
+//     Same, but for use in testing.
+
 class CodePageMemoryModificationScope;
-class CodeSpaceMemoryModificationScope;
 class RwxMemoryWriteScopeForTesting;
 namespace wasm {
 class CodeSpaceWriteScope;
 }
 
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+
+// Alignment macros.
+// Adapted from partition_allocator/thread_isolation/alignment.h.
+
+// Page size is not a compile time constant, but we need it for alignment and
+// padding of our global memory.
+// We use the maximum expected value here (currently x64 only) and test in
+// ThreadIsolation::Initialize() that it's a multiple of the real pagesize.
+#define THREAD_ISOLATION_ALIGN_SZ 0x1000
+#define THREAD_ISOLATION_ALIGN alignas(THREAD_ISOLATION_ALIGN_SZ)
+#define THREAD_ISOLATION_ALIGN_OFFSET_MASK (THREAD_ISOLATION_ALIGN_SZ - 1)
+#define THREAD_ISOLATION_FILL_PAGE_SZ(size)                                    \
+  ((THREAD_ISOLATION_ALIGN_SZ - ((size)&THREAD_ISOLATION_ALIGN_OFFSET_MASK)) % \
+   THREAD_ISOLATION_ALIGN_SZ)
+
+#else  // V8_HAS_PKU_JIT_WRITE_PROTECT
+
+#define THREAD_ISOLATION_ALIGN_SZ 0
+#define THREAD_ISOLATION_ALIGN
+#define THREAD_ISOLATION_FILL_PAGE_SZ(size) 0
+
+#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
+
 // This scope is a wrapper for APRR/MAP_JIT machinery on MacOS on ARM64
 // ("Apple M1"/Apple Silicon) or Intel PKU (aka. memory protection keys)
 // with respective low-level semantics.
@@ -56,32 +105,25 @@ class V8_NODISCARD RwxMemoryWriteScope {
   // Returns true if current configuration supports fast write-protection of
   // executable pages.
   V8_INLINE static bool IsSupported();
-
-  // Sets key's permissions to default state (kDisableWrite) for current thread
-  // if it wasn't done before. V8 doesn't have control of the worker threads
-  // used by v8::TaskRunner and thus it's not guaranteed that a thread executing
-  // a V8 task has the right permissions for the key. V8 tasks that access code
-  // page bodies must call this function to ensure that they have at least read
-  // access.
-  V8_EXPORT_PRIVATE static void SetDefaultPermissionsForNewThread();
+  // An untrusted version of this check, i.e. the result might be
+  // attacker-controlled if we assume memory corruption. This is needed in
+  // signal handlers in which we might not have read access to the trusted
+  // memory.
+  V8_INLINE static bool IsSupportedUntrusted();
 
 #if V8_HAS_PKU_JIT_WRITE_PROTECT
-  static int memory_protection_key() { return memory_protection_key_; }
-
-  static void InitializeMemoryProtectionKey();
+  static int memory_protection_key();
 
   static bool IsPKUWritable();
 
   // Linux resets key's permissions to kDisableAccess before executing signal
   // handlers. If the handler requires access to code page bodies it should take
   // care of changing permissions to the default state (kDisableWrite).
-  static void SetDefaultPermissionsForSignalHandler();
+  static V8_EXPORT void SetDefaultPermissionsForSignalHandler();
 #endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
 
  private:
-  friend class CodePageCollectionMemoryModificationScope;
   friend class CodePageMemoryModificationScope;
-  friend class CodeSpaceMemoryModificationScope;
   friend class RwxMemoryWriteScopeForTesting;
   friend class wasm::CodeSpaceWriteScope;
 
@@ -93,29 +135,308 @@ class V8_NODISCARD RwxMemoryWriteScope {
 
 #if V8_HAS_PTHREAD_JIT_WRITE_PROTECT || V8_HAS_PKU_JIT_WRITE_PROTECT
   // This counter is used for supporting scope reentrance.
-  static thread_local int code_space_write_nesting_level_;
+  V8_EXPORT_PRIVATE static thread_local int code_space_write_nesting_level_;
 #endif  // V8_HAS_PTHREAD_JIT_WRITE_PROTECT || V8_HAS_PKU_JIT_WRITE_PROTECT
+};
+
+// The ThreadIsolation API is used to protect executable memory using per-thread
+// memory permissions and perform validation for any writes into it.
+//
+// It keeps metadata about all JIT regions in write-protected memory and will
+// use it to validate that the writes are safe from a CFI perspective.
+// Its tasks are:
+// * track JIT pages and allocations and check for validity
+// * check for dangling pointers on the shadow stack (not implemented)
+// * validate code writes like code creation, relocation, etc. (not implemented)
+class V8_EXPORT ThreadIsolation {
+ public:
+  static bool Enabled();
+  static void Initialize(ThreadIsolatedAllocator* allocator);
+
+  enum class JitAllocationType {
+    kInstructionStream,
+    kWasmCode,
+  };
+
+  // Register a new JIT region.
+  static void RegisterJitPage(Address address, size_t size);
+  // Unregister a JIT region that is about to be unmpapped.
+  static void UnregisterJitPage(Address address, size_t size);
+  // Make a page executable. Needs to be registered first. Should only be called
+  // if Enabled() is true.
+  V8_NODISCARD static bool MakeExecutable(Address address, size_t size);
+
+  class WritableJitAllocation;
+
+  // Register a new InstructionStream allocation for tracking and return a
+  // writable reference to it. All writes should go through the returned
+  // WritableJitAllocation object.
+  static WritableJitAllocation RegisterInstructionStreamAllocation(Address addr,
+                                                                   size_t size);
+  // Register multiple consecutive allocations together.
+  static void RegisterJitAllocations(Address start,
+                                     const std::vector<size_t>& sizes,
+                                     JitAllocationType type);
+  static WritableJitAllocation LookupJitAllocation(Address addr, size_t size,
+                                                   JitAllocationType type);
+  static void UnregisterInstructionStreamsInPageExcept(
+      MemoryChunk* chunk, const std::vector<Address>& keep);
+  static void RegisterWasmAllocation(Address addr, size_t size);
+  static void UnregisterWasmAllocation(Address addr, size_t size);
+
+  // Check for a potential dead lock in case we want to lookup the jit
+  // allocation from inside a signal handler.
+  static bool CanLookupStartOfJitAllocationAt(Address inner_pointer);
+  static base::Optional<Address> StartOfJitAllocationAt(Address inner_pointer);
+
+  // Public for testing. Please use the wasm/js specific functions above.
+  static void UnregisterJitAllocationsInPageExceptForTesting(
+      Address page, size_t page_size, const std::vector<Address>& keep);
+  static void RegisterJitAllocationForTesting(Address obj, size_t size);
+  static void UnregisterJitAllocationForTesting(Address addr, size_t size);
 
 #if V8_HAS_PKU_JIT_WRITE_PROTECT
-  static int memory_protection_key_;
-#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
+  static int pkey() { return trusted_data_.pkey; }
+  // A copy of the pkey, but taken from untrusted memory. This function should
+  // only be used to grant read access to the pkey, never for write access.
+  static int untrusted_pkey() { return untrusted_data_.pkey; }
+#endif
 
 #if DEBUG
-  V8_EXPORT_PRIVATE static bool
-  is_key_permissions_initialized_for_current_thread();
+  static bool initialized() { return untrusted_data_.initialized; }
+  static void CheckTrackedMemoryEmpty();
+#endif
+
+  // A std::allocator implementation that wraps the ThreadIsolated allocator.
+  // This is needed to create STL containers backed by ThreadIsolated memory.
+  template <class T>
+  struct StlAllocator {
+    typedef T value_type;
+
+    StlAllocator() = default;
+    template <class U>
+    explicit StlAllocator(const StlAllocator<U>&) noexcept {}
+
+    value_type* allocate(size_t n) {
+      if (Enabled()) {
+        return static_cast<value_type*>(
+            ThreadIsolation::allocator()->Allocate(n * sizeof(value_type)));
+      } else {
+        return static_cast<value_type*>(::operator new(n * sizeof(T)));
+      }
+    }
+
+    void deallocate(value_type* ptr, size_t n) {
+      if (Enabled()) {
+        ThreadIsolation::allocator()->Free(ptr);
+      } else {
+        ::operator delete(ptr);
+      }
+    }
+  };
+
+  class JitAllocation {
+   public:
+    explicit JitAllocation(size_t size, JitAllocationType type)
+        : size_(size), type_(type) {}
+    size_t Size() const { return size_; }
+    JitAllocationType Type() const { return type_; }
+
+   private:
+    size_t size_;
+    JitAllocationType type_;
+  };
+
+  class JitPage;
+
+  // All accesses to the JitPage go through the JitPageReference class, which
+  // will guard it against concurrent access.
+  class JitPageReference {
+   public:
+    JitPageReference(class JitPage* page, Address address);
+    JitPageReference(JitPageReference&&) V8_NOEXCEPT = default;
+    JitPageReference(const JitPageReference&) = delete;
+    JitPageReference& operator=(const JitPageReference&) = delete;
+
+    base::Address Address() const { return address_; }
+    size_t Size() const;
+    base::Address End() const { return Address() + Size(); }
+    JitAllocation& RegisterAllocation(base::Address addr, size_t size,
+                                      JitAllocationType type);
+    JitAllocation& LookupAllocation(base::Address addr, size_t size,
+                                    JitAllocationType type);
+    void UnregisterAllocation(base::Address addr);
+    void UnregisterAllocationsExcept(base::Address start, size_t size,
+                                     const std::vector<base::Address>& addr);
+
+    base::Address StartOfAllocationAt(base::Address inner_pointer);
+    bool HasAllocation(base::Address address, size_t size);
+
+    bool Empty() const;
+    void Shrink(class JitPage* tail);
+    void Expand(size_t offset);
+    void Merge(JitPageReference& next);
+    class JitPage* JitPage() { return jit_page_; }
+
+   private:
+    base::MutexGuard page_lock_;
+    class JitPage* jit_page_;
+    // We get the address from the key of the map when we do a JitPage lookup.
+    // We can save some memory by storing it as part of the reference instead.
+    base::Address address_;
+  };
+
+  // A scope class that temporarily makes the JitAllocation writable. All writes
+  // to executable memory should go through this object since it adds validation
+  // that the writes are safe for CFI.
+  class WritableJitAllocation {
+   public:
+    WritableJitAllocation(const WritableJitAllocation&) = delete;
+    WritableJitAllocation& operator=(const WritableJitAllocation&) = delete;
+
+    // Writes a header slot either as a primitive or as a Tagged value.
+    // Important: this function will not trigger a write barrier by itself,
+    // since we want to keep the code running with write access to executable
+    // memory to a minimum. You should trigger the write barriers after this
+    // function goes out of scope.
+    template <typename T, size_t offset>
+    V8_INLINE void WriteHeaderSlot(T value);
+    template <typename T, size_t offset>
+    V8_INLINE void WriteHeaderSlot(T value, ReleaseStoreTag);
+    template <typename T, size_t offset>
+    V8_INLINE void WriteHeaderSlot(T value, RelaxedStoreTag);
+
+    // CopyCode and CopyData have the same implementation at the moment, but
+    // they will diverge once we implement validation.
+    V8_INLINE void CopyCode(size_t dst_offset, const uint8_t* src,
+                            size_t num_bytes);
+    V8_INLINE void CopyData(size_t dst_offset, const uint8_t* src,
+                            size_t num_bytes);
+
+    V8_INLINE void ClearBytes(size_t offset, size_t len);
+
+    Address address() const { return address_; }
+    size_t size() const { return allocation_.Size(); }
+
+   private:
+    enum class JitAllocationSource {
+      kRegister,
+      kLookup,
+    };
+    V8_INLINE WritableJitAllocation(Address addr, size_t size,
+                                    JitAllocationType type,
+                                    JitAllocationSource source);
+
+    JitPageReference& page_ref() { return page_ref_; }
+
+    const Address address_;
+    // TODO(sroettger): we can move the memory write scopes into the Write*
+    // functions in debug builds. This would allow us to ensure that all writes
+    // go through this object.
+    RwxMemoryWriteScope write_scope_;
+    JitPageReference page_ref_;
+    const JitAllocation& allocation_;
+
+    friend class ThreadIsolation;
+  };
+
+  class JitPage {
+   public:
+    explicit JitPage(size_t size) : size_(size) {}
+    ~JitPage();
+
+   private:
+    base::Mutex mutex_;
+    typedef std::map<Address, JitAllocation, std::less<Address>,
+                     StlAllocator<std::pair<const Address, JitAllocation>>>
+        AllocationMap;
+    AllocationMap allocations_;
+    size_t size_;
+
+    friend class JitPageReference;
+    // Allow CanLookupStartOfJitAllocationAt to check if the mutex is locked.
+    friend bool ThreadIsolation::CanLookupStartOfJitAllocationAt(Address);
+  };
+
+ private:
+  static ThreadIsolatedAllocator* allocator() {
+    return trusted_data_.allocator;
+  }
+
+  // We store pointers in the map since we want to use the entries without
+  // keeping the map locked.
+  typedef std::map<Address, JitPage*, std::less<Address>,
+                   StlAllocator<std::pair<const Address, JitPage*>>>
+      JitPageMap;
+
+  // The TrustedData needs to be page aligned so that we can protect it using
+  // per-thread memory permissions (e.g. pkeys on x64).
+  struct THREAD_ISOLATION_ALIGN TrustedData {
+    ThreadIsolatedAllocator* allocator = nullptr;
+
 #if V8_HAS_PKU_JIT_WRITE_PROTECT
-  // The state of the PKU key permissions are inherited from the parent
-  // thread when a new thread is created. Since we don't always control
-  // the parent thread, we ensure that the new thread resets their key's
-  // permissions to the default kDisableWrite state.
-  // This flag is used for checking that threads have initialized the
-  // permissions.
-  static thread_local bool is_key_permissions_initialized_for_current_thread_;
-  static bool pkey_initialized;
-#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
-#endif  // DEBUG
+    int pkey = -1;
+#endif
+
+    base::Mutex* jit_pages_mutex_;
+    JitPageMap* jit_pages_;
+  };
+
+  struct UntrustedData {
+#if DEBUG
+    bool initialized = false;
+#endif
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+    int pkey = -1;
+#endif
+  };
+
+  static struct TrustedData trusted_data_;
+  static struct UntrustedData untrusted_data_;
+
+  static_assert(THREAD_ISOLATION_ALIGN_SZ == 0 ||
+                sizeof(trusted_data_) == THREAD_ISOLATION_ALIGN_SZ);
+
+  // Allocate and construct C++ objects using memory backed by the
+  // ThreadIsolated allocator.
+  template <typename T, typename... Args>
+  static void ConstructNew(T** ptr, Args&&... args);
+  template <typename T>
+  static void Delete(T* ptr);
+
+  static WritableJitAllocation RegisterJitAllocation(Address addr, size_t size,
+                                                     JitAllocationType type);
+
+  // Lookup a JitPage that spans a given range. Note that JitPages are not
+  // required to align with OS pages. There are no minimum size requirements and
+  // we can split and merge them under the hood for performance optimizations.
+  // IOW, the returned JitPage is guaranteed to span the given range, but
+  // doesn't need to be the exact previously registered JitPage.
+  static JitPageReference LookupJitPage(Address addr, size_t size);
+  static JitPageReference LookupJitPageLocked(Address addr, size_t size);
+  static base::Optional<JitPageReference> TryLookupJitPage(Address addr,
+                                                           size_t size);
+  // The caller needs to hold a lock of the jit_pages_mutex_
+  static base::Optional<JitPageReference> TryLookupJitPageLocked(Address addr,
+                                                                 size_t size);
+  static JitPageReference SplitJitPage(Address addr, size_t size);
+
+  template <class T>
+  friend struct StlAllocator;
 };
 
+template <class T>
+bool operator==(const ThreadIsolation::StlAllocator<T>&,
+                const ThreadIsolation::StlAllocator<T>&) {
+  return true;
+}
+
+template <class T>
+bool operator!=(const ThreadIsolation::StlAllocator<T>&,
+                const ThreadIsolation::StlAllocator<T>&) {
+  return false;
+}
+
 // This class is a no-op version of the RwxMemoryWriteScope class above.
 // It's used as a target type for other scope type definitions when a no-op
 // semantics is required.
@@ -126,27 +447,6 @@ class V8_NODISCARD NopRwxMemoryWriteScope final {
   }
 };
 
-// Sometimes we need to call a function which will / might spawn a new thread,
-// like {JobHandle::NotifyConcurrencyIncrease}, while holding a
-// {RwxMemoryWriteScope}. This is problematic since the new thread will inherit
-// the parent thread's PKU permissions.
-// The {ResetPKUPermissionsForThreadSpawning} scope will thus reset the PKU
-// permissions as long as it is in scope, such that it is safe to spawn new
-// threads.
-class V8_NODISCARD ResetPKUPermissionsForThreadSpawning {
- public:
-#if V8_HAS_PKU_JIT_WRITE_PROTECT
-  V8_EXPORT_PRIVATE ResetPKUPermissionsForThreadSpawning();
-  V8_EXPORT_PRIVATE ~ResetPKUPermissionsForThreadSpawning();
-
- private:
-  bool was_writable_;
-#else
-  // Define an empty constructor to avoid "unused variable" warnings.
-  ResetPKUPermissionsForThreadSpawning() {}
-#endif
-};
-
 // Same as the RwxMemoryWriteScope but without inlining the code.
 // This is a workaround for component build issue (crbug/1316800), when
 // a thread_local value can't be properly exported.
diff --git a/deps/v8/src/common/globals.h b/deps/v8/src/common/globals.h
index 17057b4c5fc078..1ac3d858cb8503 100644
--- a/deps/v8/src/common/globals.h
+++ b/deps/v8/src/common/globals.h
@@ -21,6 +21,12 @@
 
 #define V8_INFINITY std::numeric_limits<double>::infinity()
 
+// AIX has jmpbuf redefined as __jmpbuf in /usr/include/sys/context.h
+// which replaces v8's jmpbuf , resulting in undefined symbol errors
+#if defined(V8_OS_AIX) && defined(jmpbuf)
+#undef jmpbuf
+#endif
+
 namespace v8 {
 
 namespace base {
@@ -71,9 +77,7 @@ namespace internal {
 
 // Determine whether the architecture uses an embedded constant pool
 // (contiguous constant pool embedded in code object).
-// Need to temporary disable the constant pool on PPC, more details can be found
-// under https://crrev.com/c/4341976.
-#if 0 && (V8_TARGET_ARCH_PPC || V8_TARGET_ARCH_PPC64)
+#if V8_TARGET_ARCH_PPC || V8_TARGET_ARCH_PPC64
 #define V8_EMBEDDED_CONSTANT_POOL_BOOL true
 #else
 #define V8_EMBEDDED_CONSTANT_POOL_BOOL false
@@ -124,10 +128,10 @@ namespace internal {
 #define V8_CAN_CREATE_SHARED_HEAP_BOOL false
 #endif
 
-#ifdef V8_STATIC_ROOT_GENERATION
-#define V8_STATIC_ROOT_GENERATION_BOOL true
+#ifdef V8_STATIC_ROOTS_GENERATION
+#define V8_STATIC_ROOTS_GENERATION_BOOL true
 #else
-#define V8_STATIC_ROOT_GENERATION_BOOL false
+#define V8_STATIC_ROOTS_GENERATION_BOOL false
 #endif
 
 #ifdef V8_ENABLE_SANDBOX
@@ -136,6 +140,12 @@ namespace internal {
 #define V8_ENABLE_SANDBOX_BOOL false
 #endif
 
+#ifdef V8_CODE_POINTER_SANDBOXING
+#define V8_CODE_POINTER_SANDBOXING_BOOL true
+#else
+#define V8_CODE_POINTER_SANDBOXING_BOOL false
+#endif
+
 // D8's MultiMappedAllocator is only available on Linux, and only if the sandbox
 // is not enabled.
 #if V8_OS_LINUX && !V8_ENABLE_SANDBOX_BOOL
@@ -293,19 +303,6 @@ const size_t kShortBuiltinCallsOldSpaceSizeThreshold = size_t{2} * GB;
 #define TAGGED_SIZE_8_BYTES false
 #endif
 
-// Some types of tracing require the SFI to store a unique ID.
-#if defined(V8_TRACE_MAPS) || defined(V8_TRACE_UNOPTIMIZED)
-#define V8_SFI_HAS_UNIQUE_ID true
-#else
-#define V8_SFI_HAS_UNIQUE_ID false
-#endif
-
-#if V8_SFI_HAS_UNIQUE_ID && TAGGED_SIZE_8_BYTES
-#define V8_SFI_NEEDS_PADDING true
-#else
-#define V8_SFI_NEEDS_PADDING false
-#endif
-
 #if defined(V8_OS_WIN) && defined(V8_TARGET_ARCH_X64)
 #define V8_OS_WIN_X64 true
 #endif
@@ -318,6 +315,15 @@ const size_t kShortBuiltinCallsOldSpaceSizeThreshold = size_t{2} * GB;
 #define V8_OS_WIN64 true
 #endif
 
+// Support for floating point parameters in calls to C.
+// It's currently enabled only for the platforms listed below. We don't plan
+// to add support for IA32, because it has a totally different approach
+// (using FP stack).
+#if defined(V8_TARGET_ARCH_X64) || defined(V8_TARGET_ARCH_ARM64) || \
+    defined(V8_TARGET_ARCH_MIPS64) || defined(V8_TARGET_ARCH_LOONG64)
+#define V8_ENABLE_FP_PARAMS_IN_C_LINKAGE 1
+#endif
+
 // Superclass for classes only using static method functions.
 // The subclass of AllStatic cannot be instantiated at all.
 class AllStatic {
@@ -327,8 +333,6 @@ class AllStatic {
 #endif
 };
 
-using byte = uint8_t;
-
 // -----------------------------------------------------------------------------
 // Constants
 
@@ -350,7 +354,7 @@ constexpr int kMinUInt32 = 0;
 
 constexpr int kInt8Size = sizeof(int8_t);
 constexpr int kUInt8Size = sizeof(uint8_t);
-constexpr int kByteSize = sizeof(byte);
+constexpr int kByteSize = 1;
 constexpr int kCharSize = sizeof(char);
 constexpr int kShortSize = sizeof(short);  // NOLINT
 constexpr int kInt16Size = sizeof(int16_t);
@@ -395,8 +399,8 @@ constexpr uint32_t kMaxCommittedWasmCodeMB = 4095;
 // The actual maximum code space size used can be configured with
 // --max-wasm-code-space-size. This constant is the default value, and at the
 // same time the maximum allowed value (checked by the WasmCodeManager).
-#if V8_TARGET_ARCH_ARM64
-// ARM64 only supports direct calls within a 128 MB range.
+#if V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_LOONG64
+// ARM64 and Loong64 only supports direct calls within a 128 MB range.
 constexpr uint32_t kDefaultMaxWasmCodeSpaceSizeMb = 128;
 #elif V8_TARGET_ARCH_PPC64
 // Branches only take 26 bits.
@@ -418,7 +422,7 @@ constexpr bool kPlatformRequiresCodeRange = true;
     (V8_TARGET_ARCH_PPC || V8_TARGET_ARCH_PPC64) && V8_OS_LINUX
 constexpr size_t kMaximalCodeRangeSize = 512 * MB;
 constexpr size_t kMinExpectedOSPageSize = 64 * KB;  // OS page on PPC Linux
-#elif V8_TARGET_ARCH_ARM64
+#elif V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_LOONG64 || V8_TARGET_ARCH_RISCV64
 constexpr size_t kMaximalCodeRangeSize =
     (COMPRESS_POINTERS_BOOL && !V8_EXTERNAL_CODE_SPACE_BOOL) ? 128 * MB
                                                              : 256 * MB;
@@ -524,7 +528,7 @@ static_assert(kPointerSize == (1 << kPointerSizeLog2));
 #define V8_COMPRESS_POINTERS_8GB_BOOL false
 #endif
 
-// This type defines raw storage type for external (or off-V8 heap) pointers
+// This type defines the raw storage type for external (or off-V8 heap) pointers
 // stored on V8 heap.
 constexpr int kExternalPointerSlotSize = sizeof(ExternalPointer_t);
 #ifdef V8_ENABLE_SANDBOX
@@ -533,6 +537,8 @@ static_assert(kExternalPointerSlotSize == kTaggedSize);
 static_assert(kExternalPointerSlotSize == kSystemPointerSize);
 #endif
 
+constexpr int kIndirectPointerSlotSize = sizeof(IndirectPointerHandle);
+
 constexpr int kEmbedderDataSlotSize = kSystemPointerSize;
 
 constexpr int kEmbedderDataSlotSizeInTaggedSlots =
@@ -589,7 +595,7 @@ constexpr unsigned kMaxModuleAsyncEvaluatingOrdinal = (1 << 30) - 1;
 // FUNCTION_CAST<F>(addr) casts an address into a function
 // of type F. Used to invoke generated code from within C.
 template <typename F>
-F FUNCTION_CAST(byte* addr) {
+F FUNCTION_CAST(uint8_t* addr) {
   return reinterpret_cast<F>(reinterpret_cast<Address>(addr));
 }
 
@@ -680,10 +686,55 @@ enum class TypeofMode { kInside, kNotInside };
 // Whether floating point registers should be saved (and restored).
 enum class SaveFPRegsMode { kIgnore, kSave };
 
+// Whether a field contains a direct (i.e. tagged) pointer to another HeapObject
+// or an indirect (i.e. an index into a pointer table) one.
+enum class PointerType { kDirect, kIndirect };
+
+// The type of pointers to Code objects. When the sandbox is enabled, these are
+// referenced through indirect pointers, otherwise regular/direct pointers.
+constexpr PointerType kCodePointerType = V8_CODE_POINTER_SANDBOXING_BOOL
+                                             ? PointerType::kIndirect
+                                             : PointerType::kDirect;
+
+// This enum describes the ownership semantics of an indirect pointer.
+enum class IndirectPointerMode {
+  // A regular reference from one HeapObject to another one through an indirect
+  // pointer, where the referenced object should be kept alive as long as the
+  // referencing object is alive.
+  kStrong,
+  // A reference from one HeapObject to another one through an indirect pointer
+  // with custom ownership semantics. Used for example for references from
+  // JSFunctions to Code objects which follow custom weak ownership semantics.
+  kCustom
+};
+
 // Whether arguments are passed on a known stack location or through a
 // register.
 enum class ArgvMode { kStack, kRegister };
 
+enum class CallApiCallbackMode {
+  // This version of CallApiCallback used by IC system, it gets additional
+  // target function argument which is used both for stack trace reconstruction
+  // in case exception is thrown inside the callback and for callback
+  // side-effects checking by debugger.
+  kGeneric,
+
+  // The following two versions are used for generating calls from optimized
+  // code. They don't need to support side effects checking because function
+  // will be deoptimized when side effects checking is enabled, and they don't
+  // get the target function because it can be reconstructed from the lazy
+  // deopt info in case exception is thrown.
+
+  // This version is used for compiling code when Isolate profiling or runtime
+  // call stats is disabled. The code that uses this version must be created
+  // with a dependency on NoProfilingProtector.
+  kOptimizedNoProfiling,
+
+  // This version contains a dynamic check for enabled profiler and it supports
+  // runtime call stats.
+  kOptimized,
+};
+
 // This constant is used as an undefined value when passing source positions.
 constexpr int kNoSourcePosition = -1;
 
@@ -855,7 +906,7 @@ static const intptr_t kPageAlignmentMask = (intptr_t{1} << kPageSizeBits) - 1;
 // If looking only at the top 32 bits, the QNaN mask is bits 19 to 30.
 constexpr uint32_t kQuietNaNHighBitsMask = 0xfff << (51 - 32);
 
-enum class HeapObjectReferenceType {
+enum class V8_EXPORT_ENUM HeapObjectReferenceType {
   WEAK,
   STRONG,
 };
@@ -884,6 +935,10 @@ class Debug;
 class DebugInfo;
 class Descriptor;
 class DescriptorArray;
+#ifdef V8_ENABLE_DIRECT_HANDLE
+template <typename T>
+class DirectHandle;
+#endif
 class TransitionArray;
 class ExternalReference;
 class FeedbackVector;
@@ -894,10 +949,16 @@ class FunctionTemplateInfo;
 class GlobalDictionary;
 template <typename T>
 class Handle;
+#ifndef V8_ENABLE_DIRECT_HANDLE
+template <typename T>
+using DirectHandle = Handle<T>;
+#endif
 class Heap;
 class HeapObject;
 class HeapObjectReference;
 class IC;
+template <typename T>
+using IndirectHandle = Handle<T>;
 class InterceptorInfo;
 class Isolate;
 class JSReceiver;
@@ -908,9 +969,27 @@ class LocalIsolate;
 class MacroAssembler;
 class Map;
 class MarkCompactCollector;
+#ifdef V8_ENABLE_DIRECT_HANDLE
+template <typename T>
+class MaybeDirectHandle;
+#endif
 template <typename T>
 class MaybeHandle;
+#ifndef V8_ENABLE_DIRECT_HANDLE
+template <typename T>
+using MaybeDirectHandle = MaybeHandle<T>;
+#endif
+template <typename T>
+using MaybeIndirectHandle = MaybeHandle<T>;
 class MaybeObject;
+#ifdef V8_ENABLE_DIRECT_HANDLE
+class MaybeObjectDirectHandle;
+#endif
+class MaybeObjectHandle;
+#ifndef V8_ENABLE_DIRECT_HANDLE
+using MaybeObjectDirectHandle = MaybeObjectHandle;
+#endif
+using MaybeObjectIndirectHandle = MaybeObjectHandle;
 class MemoryChunk;
 class MessageLocation;
 class ModuleScope;
@@ -952,6 +1031,8 @@ class String;
 class StringStream;
 class Struct;
 class Symbol;
+template <typename T>
+class Tagged;
 class Variable;
 
 // Slots are either full-pointer slots or compressed slots depending on whether
@@ -964,17 +1045,17 @@ struct SlotTraits {
   using TOffHeapObjectSlot =
       OffHeapCompressedObjectSlot<V8HeapCompressionScheme>;
 #ifdef V8_EXTERNAL_CODE_SPACE
-  using TCodeObjectSlot =
+  using TInstructionStreamSlot =
       OffHeapCompressedObjectSlot<ExternalCodeCompressionScheme>;
 #else
-  using TCodeObjectSlot = TObjectSlot;
+  using TInstructionStreamSlot = TObjectSlot;
 #endif  // V8_EXTERNAL_CODE_SPACE
 #else
   using TObjectSlot = FullObjectSlot;
   using TMaybeObjectSlot = FullMaybeObjectSlot;
   using THeapObjectSlot = FullHeapObjectSlot;
   using TOffHeapObjectSlot = OffHeapFullObjectSlot;
-  using TCodeObjectSlot = OffHeapFullObjectSlot;
+  using TInstructionStreamSlot = OffHeapFullObjectSlot;
 #endif  // V8_COMPRESS_POINTERS
 };
 
@@ -996,12 +1077,12 @@ using HeapObjectSlot = SlotTraits::THeapObjectSlot;
 // off-heap.
 using OffHeapObjectSlot = SlotTraits::TOffHeapObjectSlot;
 
-// A CodeObjectSlot instance describes a kTaggedSize-sized field ("slot")
-// holding a strong pointer to a InstructionStream object. The InstructionStream
-// object slots might be compressed and since code space might be allocated off
-// the main heap the load operations require explicit cage base value for code
-// space.
-using CodeObjectSlot = SlotTraits::TCodeObjectSlot;
+// A InstructionStreamSlot instance describes a kTaggedSize-sized field
+// ("slot") holding a strong pointer to a InstructionStream object. The
+// InstructionStream object slots might be compressed and since code space might
+// be allocated off the main heap the load operations require explicit cage base
+// value for code space.
+using InstructionStreamSlot = SlotTraits::TInstructionStreamSlot;
 
 using WeakSlotCallback = bool (*)(FullObjectSlot pointer);
 
@@ -1015,7 +1096,7 @@ using WeakSlotCallbackWithHeap = bool (*)(Heap* heap, FullObjectSlot pointer);
 enum AllocationSpace {
   RO_SPACE,         // Immortal, immovable and immutable objects,
   NEW_SPACE,        // Young generation space for regular objects collected
-                    // with Scavenger/MinorMC.
+                    // with Scavenger/MinorMS.
   OLD_SPACE,        // Old generation regular object space.
   CODE_SPACE,       // Old generation code object space, marked executable.
   SHARED_SPACE,     // Space shared between multiple isolates. Optional.
@@ -1036,16 +1117,72 @@ enum AllocationSpace {
 constexpr int kSpaceTagSize = 4;
 static_assert(FIRST_SPACE == 0);
 
+constexpr bool IsAnyCodeSpace(AllocationSpace space) {
+  return space == CODE_SPACE || space == CODE_LO_SPACE;
+}
+
+constexpr const char* ToString(AllocationSpace space) {
+  switch (space) {
+    case AllocationSpace::RO_SPACE:
+      return "read_only_space";
+    case AllocationSpace::NEW_SPACE:
+      return "new_space";
+    case AllocationSpace::OLD_SPACE:
+      return "old_space";
+    case AllocationSpace::CODE_SPACE:
+      return "code_space";
+    case AllocationSpace::SHARED_SPACE:
+      return "shared_space";
+    case AllocationSpace::NEW_LO_SPACE:
+      return "new_large_object_space";
+    case AllocationSpace::LO_SPACE:
+      return "large_object_space";
+    case AllocationSpace::CODE_LO_SPACE:
+      return "code_large_object_space";
+    case AllocationSpace::SHARED_LO_SPACE:
+      return "shared_large_object_space";
+  }
+}
+
+inline std::ostream& operator<<(std::ostream& os, AllocationSpace space) {
+  return os << ToString(space);
+}
+
 enum class AllocationType : uint8_t {
-  kYoung,  // Regular object allocated in NEW_SPACE or NEW_LO_SPACE
-  kOld,    // Regular object allocated in OLD_SPACE or LO_SPACE
-  kCode,   // InstructionStream object allocated in CODE_SPACE or CODE_LO_SPACE
-  kMap,    // Map object allocated in OLD_SPACE
-  kReadOnly,   // Object allocated in RO_SPACE
-  kSharedOld,  // Regular object allocated in OLD_SPACE in the shared heap
-  kSharedMap,  // Map object in OLD_SPACE in the shared heap
+  kYoung,  // Regular object allocated in NEW_SPACE or NEW_LO_SPACE.
+  kOld,    // Regular object allocated in OLD_SPACE or LO_SPACE.
+  kCode,   // InstructionStream object allocated in CODE_SPACE or CODE_LO_SPACE.
+  kMap,    // Map object allocated in OLD_SPACE.
+  kReadOnly,   // Object allocated in RO_SPACE.
+  kSharedOld,  // Regular object allocated in OLD_SPACE in the shared heap.
+  kSharedMap,  // Map object in OLD_SPACE in the shared heap.
 };
 
+constexpr const char* ToString(AllocationType kind) {
+  switch (kind) {
+    case AllocationType::kYoung:
+      return "Young";
+    case AllocationType::kOld:
+      return "Old";
+    case AllocationType::kCode:
+      return "Code";
+    case AllocationType::kMap:
+      return "Map";
+    case AllocationType::kReadOnly:
+      return "ReadOnly";
+    case AllocationType::kSharedOld:
+      return "SharedOld";
+    case AllocationType::kSharedMap:
+      return "SharedMap";
+  }
+}
+
+inline std::ostream& operator<<(std::ostream& os, AllocationType type) {
+  return os << ToString(type);
+}
+
+// Reason for a garbage collection.
+//
 // These values are persisted to logs. Entries should not be renumbered and
 // numeric values should never be reused. If you add new items here, update
 // src/tools/metrics/histograms/enums.xml in chromium.
@@ -1076,38 +1213,86 @@ enum class GarbageCollectionReason : int {
   kGlobalAllocationLimit = 23,
   kMeasureMemory = 24,
   kBackgroundAllocationFailure = 25,
-  kFinalizeMinorMC = 26,
+  kFinalizeConcurrentMinorMS = 26,
   kCppHeapAllocationFailure = 27,
 
-  kLastReason = kCppHeapAllocationFailure,
+  NUM_REASONS,
 };
 
 static_assert(kGarbageCollectionReasonMaxValue ==
-                  static_cast<int>(GarbageCollectionReason::kLastReason),
+                  static_cast<int>(GarbageCollectionReason::NUM_REASONS) - 1,
               "The value of kGarbageCollectionReasonMaxValue is inconsistent.");
 
-inline size_t hash_value(AllocationType kind) {
-  return static_cast<uint8_t>(kind);
+constexpr const char* ToString(GarbageCollectionReason reason) {
+  switch (reason) {
+    case GarbageCollectionReason::kAllocationFailure:
+      return "allocation failure";
+    case GarbageCollectionReason::kAllocationLimit:
+      return "allocation limit";
+    case GarbageCollectionReason::kContextDisposal:
+      return "context disposal";
+    case GarbageCollectionReason::kCountersExtension:
+      return "counters extension";
+    case GarbageCollectionReason::kDebugger:
+      return "debugger";
+    case GarbageCollectionReason::kDeserializer:
+      return "deserialize";
+    case GarbageCollectionReason::kExternalMemoryPressure:
+      return "external memory pressure";
+    case GarbageCollectionReason::kFinalizeMarkingViaStackGuard:
+      return "finalize incremental marking via stack guard";
+    case GarbageCollectionReason::kFinalizeMarkingViaTask:
+      return "finalize incremental marking via task";
+    case GarbageCollectionReason::kFullHashtable:
+      return "full hash-table";
+    case GarbageCollectionReason::kHeapProfiler:
+      return "heap profiler";
+    case GarbageCollectionReason::kTask:
+      return "task";
+    case GarbageCollectionReason::kLastResort:
+      return "last resort";
+    case GarbageCollectionReason::kLowMemoryNotification:
+      return "low memory notification";
+    case GarbageCollectionReason::kMakeHeapIterable:
+      return "make heap iterable";
+    case GarbageCollectionReason::kMemoryPressure:
+      return "memory pressure";
+    case GarbageCollectionReason::kMemoryReducer:
+      return "memory reducer";
+    case GarbageCollectionReason::kRuntime:
+      return "runtime";
+    case GarbageCollectionReason::kSamplingProfiler:
+      return "sampling profiler";
+    case GarbageCollectionReason::kSnapshotCreator:
+      return "snapshot creator";
+    case GarbageCollectionReason::kTesting:
+      return "testing";
+    case GarbageCollectionReason::kExternalFinalize:
+      return "external finalize";
+    case GarbageCollectionReason::kGlobalAllocationLimit:
+      return "global allocation limit";
+    case GarbageCollectionReason::kMeasureMemory:
+      return "measure memory";
+    case GarbageCollectionReason::kUnknown:
+      return "unknown";
+    case GarbageCollectionReason::kBackgroundAllocationFailure:
+      return "background allocation failure";
+    case GarbageCollectionReason::kFinalizeConcurrentMinorMS:
+      return "finalize concurrent MinorMS";
+    case GarbageCollectionReason::kCppHeapAllocationFailure:
+      return "CppHeap allocation failure";
+    case GarbageCollectionReason::NUM_REASONS:
+      UNREACHABLE();
+  }
 }
 
-inline std::ostream& operator<<(std::ostream& os, AllocationType kind) {
-  switch (kind) {
-    case AllocationType::kYoung:
-      return os << "Young";
-    case AllocationType::kOld:
-      return os << "Old";
-    case AllocationType::kCode:
-      return os << "Code";
-    case AllocationType::kMap:
-      return os << "Map";
-    case AllocationType::kReadOnly:
-      return os << "ReadOnly";
-    case AllocationType::kSharedOld:
-      return os << "SharedOld";
-    case AllocationType::kSharedMap:
-      return os << "SharedMap";
-  }
-  UNREACHABLE();
+inline std::ostream& operator<<(std::ostream& os,
+                                GarbageCollectionReason reason) {
+  return os << ToString(reason);
+}
+
+inline size_t hash_value(AllocationType kind) {
+  return static_cast<uint8_t>(kind);
 }
 
 inline constexpr bool IsSharedAllocationType(AllocationType kind) {
@@ -1133,20 +1318,33 @@ enum AllocationAlignment {
 
 enum class AccessMode { ATOMIC, NON_ATOMIC };
 
-enum class AllowLargeObjects { kFalse, kTrue };
-
 enum MinimumCapacity {
   USE_DEFAULT_MINIMUM_CAPACITY,
   USE_CUSTOM_MINIMUM_CAPACITY
 };
 
-enum class GarbageCollector { SCAVENGER, MARK_COMPACTOR, MINOR_MARK_COMPACTOR };
+enum class GarbageCollector { SCAVENGER, MARK_COMPACTOR, MINOR_MARK_SWEEPER };
+
+constexpr const char* ToString(GarbageCollector collector) {
+  switch (collector) {
+    case GarbageCollector::SCAVENGER:
+      return "Scavenger";
+    case GarbageCollector::MARK_COMPACTOR:
+      return "Mark-Sweep-Compact";
+    case GarbageCollector::MINOR_MARK_SWEEPER:
+      return "Minor Mark-Sweep";
+  }
+}
+
+inline std::ostream& operator<<(std::ostream& os, GarbageCollector collector) {
+  return os << ToString(collector);
+}
 
 enum class CompactionSpaceKind {
   kNone,
   kCompactionSpaceForScavenge,
   kCompactionSpaceForMarkCompact,
-  kCompactionSpaceForMinorMarkCompact,
+  kCompactionSpaceForMinorMarkSweep,
 };
 
 enum Executability { NOT_EXECUTABLE, EXECUTABLE };
@@ -1159,7 +1357,11 @@ enum class CodeFlushMode {
   kStressFlushCode,
 };
 
-enum ExternalBackingStoreType { kArrayBuffer, kExternalString, kNumTypes };
+enum class ExternalBackingStoreType {
+  kArrayBuffer,
+  kExternalString,
+  kNumValues
+};
 
 bool inline IsBaselineCodeFlushingEnabled(base::EnumSet<CodeFlushMode> mode) {
   return mode.contains(CodeFlushMode::kFlushBaselineCode);
@@ -1856,6 +2058,17 @@ inline std::ostream& operator<<(std::ostream& os, CollectionKind kind) {
   UNREACHABLE();
 }
 
+enum class IsolateExecutionModeFlag : uint8_t {
+  // Default execution mode.
+  kNoFlags = 0,
+  // Set if the Isolate is being profiled. Causes collection of extra compile
+  // info.
+  kIsProfiling = 1 << 0,
+  // Set if side effect checking is enabled for the Isolate.
+  // See Debug::StartSideEffectCheckMode().
+  kCheckSideEffects = 1 << 1,
+};
+
 // Flags for the runtime function kDefineKeyedOwnPropertyInLiteral.
 // - Whether the function name should be set or not.
 enum class DefineKeyedOwnPropertyInLiteralFlag {
@@ -2024,6 +2237,7 @@ enum class AliasingKind {
   C(PendingHandlerSP, pending_handler_sp)                           \
   C(NumFramesAbovePendingHandler, num_frames_above_pending_handler) \
   C(ExternalCaughtException, external_caught_exception)             \
+  C(IsOnCentralStackFlag, is_on_central_stack_flag)                 \
   C(JSEntrySP, js_entry_sp)
 
 enum IsolateAddressId {
@@ -2095,6 +2309,8 @@ enum class StubCallMode {
   kCallBuiltinPointer,
 };
 
+enum class NeedsContext { kYes, kNo };
+
 constexpr int kFunctionLiteralIdInvalid = -1;
 constexpr int kFunctionLiteralIdTopLevel = 0;
 
diff --git a/deps/v8/src/common/message-template.h b/deps/v8/src/common/message-template.h
index 99c9230107368d..c8485f7d9ecb1b 100644
--- a/deps/v8/src/common/message-template.h
+++ b/deps/v8/src/common/message-template.h
@@ -34,6 +34,7 @@ namespace internal {
   T(ArgumentsDisallowedInInitializerAndStaticBlock,                            \
     "'arguments' is not allowed in class field initializer or static "         \
     "initialization block")                                                    \
+  T(ArgumentIsNonObject, "% argument must be an object")                       \
   T(ArrayBufferDetachKeyDoesntMatch,                                           \
     "Provided key doesn't match [[ArrayBufferDetachKey]]")                     \
   T(ArrayBufferTooShort,                                                       \
@@ -100,7 +101,7 @@ namespace internal {
   T(DeclarationMissingInitializer, "Missing initializer in % declaration")     \
   T(DefineDisallowed, "Cannot define property %, object is not extensible")    \
   T(DefineDisallowedFixedLayout,                                               \
-    "Cannot define property %, object is fixed layout")                        \
+    "Cannot define property %, object has fixed layout")                       \
   T(DetachedOperation, "Cannot perform % on a detached ArrayBuffer")           \
   T(DoNotUse, "Do not use %; %")                                               \
   T(DuplicateTemplateProperty, "Object template has duplicate property '%'")   \
@@ -130,6 +131,8 @@ namespace internal {
     "RegExp exec method returned something other than an Object or null")      \
   T(InvalidUnit, "Invalid unit argument for %() '%'")                          \
   T(IterableYieldedNonString, "Iterable yielded % which is not a string")      \
+  T(IteratorReduceNoInitial,                                                   \
+    "Reduce of a done iterator with no initial value")                         \
   T(IteratorResultNotAnObject, "Iterator result % is not an object")           \
   T(SpreadIteratorSymbolNonCallable,                                           \
     "Spread syntax requires ...iterable[Symbol.iterator] to be a function")    \
@@ -137,6 +140,7 @@ namespace internal {
     "% requires that the property of the first argument, "                     \
     "items[Symbol.iterator], when exists, be a function")                      \
   T(IteratorValueNotAnObject, "Iterator value % is not an entry object")       \
+  T(KeysMethodInvalid, "Result of the keys method is not an object")           \
   T(LanguageID, "Language ID should be string or object.")                     \
   T(LocaleNotEmpty,                                                            \
     "First argument to Intl.Locale constructor can't be empty or missing")     \
@@ -189,6 +193,7 @@ namespace internal {
   T(NotInt32OrBigInt64TypedArray,                                              \
     "% is not an int32 or BigInt64 typed array.")                              \
   T(NotSharedTypedArray, "% is not a shared typed array.")                     \
+  T(ObjectFixedLayout, "Cannot add property %, object has fixed layout")       \
   T(ObjectGetterExpectingFunction,                                             \
     "Object.prototype.__defineGetter__: Expecting function")                   \
   T(ObjectGetterCallable, "Getter must be a function: %")                      \
@@ -316,6 +321,7 @@ namespace internal {
     "Incorrect RelativeDateTimeFormatter provided")                            \
   T(ResolverNotAFunction, "Promise resolver % is not a function")              \
   T(ReturnMethodNotCallable, "The iterator's 'return' method is not callable") \
+  T(SizeIsNaN, "The .size property is NaN")                                    \
   T(SharedArrayBufferTooShort,                                                 \
     "Derived SharedArrayBuffer constructor created a buffer which was too "    \
     "small")                                                                   \
@@ -398,8 +404,6 @@ namespace internal {
     "maximumFractionDigits not equal to minimumFractionDigits")                \
   T(NormalizationForm, "The normalization form should be one of %.")           \
   T(OutOfMemory, "%: Out of memory")                                           \
-  T(ParameterOfFunctionOutOfRange,                                             \
-    "Paramenter % of function %() is % and out of range")                      \
   T(ZeroDigitNumericSeparator,                                                 \
     "Numeric separator can not be used after leading 0.")                      \
   T(NumberFormatRange, "% argument must be between 0 and 100")                 \
@@ -501,34 +505,43 @@ namespace internal {
   T(InvalidUnusedPrivateStaticMethodAccessedByDebugger,                        \
     "Unused static private method '%' cannot be accessed at debug time")       \
   T(JsonParseUnexpectedEOS, "Unexpected end of JSON input")                    \
-  T(JsonParseUnexpectedTokenNumber, "Unexpected number in JSON at position %") \
-  T(JsonParseUnexpectedTokenString, "Unexpected string in JSON at position %") \
-  T(JsonParseUnterminatedString, "Unterminated string in JSON at position %")  \
+  T(JsonParseUnexpectedTokenNumber,                                            \
+    "Unexpected number in JSON at position % (line % column %)")               \
+  T(JsonParseUnexpectedTokenString,                                            \
+    "Unexpected string in JSON at position % (line % column %)")               \
+  T(JsonParseUnterminatedString,                                               \
+    "Unterminated string in JSON at position % (line % column %)")             \
   T(JsonParseExpectedPropNameOrRBrace,                                         \
-    "Expected property name or '}' in JSON at position %")                     \
+    "Expected property name or '}' in JSON at position % (line % column %)")   \
   T(JsonParseExpectedCommaOrRBrack,                                            \
-    "Expected ',' or ']' after array element in JSON at position %")           \
+    "Expected ',' or ']' after array element in JSON at position % (line % "   \
+    "column %)")                                                               \
   T(JsonParseExpectedCommaOrRBrace,                                            \
     "Expected ',' or '}' after property value in JSON at position "            \
-    "%")                                                                       \
+    "% (line % column %)")                                                     \
   T(JsonParseExpectedDoubleQuotedPropertyName,                                 \
-    "Expected double-quoted property name in JSON at position %")              \
+    "Expected double-quoted property name in JSON at position % (line % "      \
+    "column %)")                                                               \
   T(JsonParseExponentPartMissingNumber,                                        \
-    "Exponent part is missing a number in JSON at position %")                 \
+    "Exponent part is missing a number in JSON at position % (line % column "  \
+    "%)")                                                                      \
   T(JsonParseExpectedColonAfterPropertyName,                                   \
-    "Expected ':' after property name in JSON at position %")                  \
+    "Expected ':' after property name in JSON at position % (line % column "   \
+    "%)")                                                                      \
   T(JsonParseUnterminatedFractionalNumber,                                     \
-    "Unterminated fractional number in JSON at position %")                    \
+    "Unterminated fractional number in JSON at position % (line % column %)")  \
   T(JsonParseUnexpectedNonWhiteSpaceCharacter,                                 \
     "Unexpected non-whitespace character after JSON at position "              \
-    "%")                                                                       \
+    "% (line % column %)")                                                     \
   T(JsonParseBadEscapedCharacter,                                              \
-    "Bad escaped character in JSON at position %")                             \
+    "Bad escaped character in JSON at position % (line % column %)")           \
   T(JsonParseBadControlCharacter,                                              \
-    "Bad control character in string literal in JSON at position %")           \
-  T(JsonParseBadUnicodeEscape, "Bad Unicode escape in JSON at position %")     \
+    "Bad control character in string literal in JSON at position % (line % "   \
+    "column %)")                                                               \
+  T(JsonParseBadUnicodeEscape,                                                 \
+    "Bad Unicode escape in JSON at position % (line % column %)")              \
   T(JsonParseNoNumberAfterMinusSign,                                           \
-    "No number after minus sign in JSON at position %")                        \
+    "No number after minus sign in JSON at position % (line % column %)")      \
   T(JsonParseShortString, "\"%\" is not valid JSON")                           \
   T(JsonParseUnexpectedTokenShortString,                                       \
     "Unexpected token '%', \"%\" is not valid JSON")                           \
@@ -669,6 +682,7 @@ namespace internal {
   T(WasmTrapBadSuspender, "invalid suspender object for suspend")              \
   T(WasmTrapStringIsolatedSurrogate,                                           \
     "Failed to encode string as UTF-8: contains unpaired surrogate")           \
+  T(WasmTrapSuspendJSFrames, "trying to suspend JS frames")                    \
   T(WasmExceptionError, "wasm exception")                                      \
   T(WasmObjectsAreOpaque, "WebAssembly objects are opaque")                    \
   /* Asm.js validation related */                                              \
diff --git a/deps/v8/src/common/ptr-compr-inl.h b/deps/v8/src/common/ptr-compr-inl.h
index 10d984921aaf13..abba4502a29c65 100644
--- a/deps/v8/src/common/ptr-compr-inl.h
+++ b/deps/v8/src/common/ptr-compr-inl.h
@@ -41,31 +41,37 @@ Address V8HeapCompressionScheme::GetPtrComprCageBaseAddress(
   return base;
 }
 
-#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
-
 // static
 void V8HeapCompressionScheme::InitBase(Address base) {
   CHECK_EQ(base, GetPtrComprCageBaseAddress(base));
+#if defined(USING_V8_SHARED) && defined(V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE)
+  set_base_non_inlined(base);
+#else
   base_ = base;
+#endif
 }
 
 // static
 V8_CONST Address V8HeapCompressionScheme::base() {
+#if defined(USING_V8_SHARED) && defined(V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE)
+  Address base = base_non_inlined();
+#else
+  Address base = base_;
+#endif
   // V8_ASSUME_ALIGNED is often not preserved across ptr-to-int casts (i.e. when
   // casting to an Address). To increase our chances we additionally encode the
   // same information in this V8_ASSUME.
-  V8_ASSUME((base_ & kPtrComprCageBaseMask) == base_);
+  V8_ASSUME((base & kPtrComprCageBaseMask) == base);
   return reinterpret_cast<Address>(V8_ASSUME_ALIGNED(
-      reinterpret_cast<void*>(base_), kPtrComprCageBaseAlignment));
+      reinterpret_cast<void*>(base), kPtrComprCageBaseAlignment));
 }
-#endif  // V8_COMPRESS_POINTERS_IN_SHARED_CAGE
 
 // static
 Tagged_t V8HeapCompressionScheme::CompressObject(Address tagged) {
   // This is used to help clang produce better code. Values which could be
   // invalid pointers need to be compressed with CompressAny.
 #ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
-  V8_ASSUME((tagged & kPtrComprCageBaseMask) == base_ || HAS_SMI_TAG(tagged));
+  V8_ASSUME((tagged & kPtrComprCageBaseMask) == base() || HAS_SMI_TAG(tagged));
 #endif
   return static_cast<Tagged_t>(static_cast<uint32_t>(tagged));
 }
@@ -134,31 +140,37 @@ Address ExternalCodeCompressionScheme::GetPtrComprCageBaseAddress(
   return base;
 }
 
-#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
-
 // static
 void ExternalCodeCompressionScheme::InitBase(Address base) {
   CHECK_EQ(base, PrepareCageBaseAddress(base));
+#if defined(USING_V8_SHARED) && defined(V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE)
+  set_base_non_inlined(base);
+#else
   base_ = base;
+#endif
 }
 
 // static
 V8_CONST Address ExternalCodeCompressionScheme::base() {
+#if defined(USING_V8_SHARED) && defined(V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE)
+  Address base = base_non_inlined();
+#else
+  Address base = base_;
+#endif
   // V8_ASSUME_ALIGNED is often not preserved across ptr-to-int casts (i.e. when
   // casting to an Address). To increase our chances we additionally encode the
   // same information in this V8_ASSUME.
-  V8_ASSUME((base_ & kPtrComprCageBaseMask) == base_);
+  V8_ASSUME((base & kPtrComprCageBaseMask) == base);
   return reinterpret_cast<Address>(V8_ASSUME_ALIGNED(
-      reinterpret_cast<void*>(base_), kPtrComprCageBaseAlignment));
+      reinterpret_cast<void*>(base), kPtrComprCageBaseAlignment));
 }
-#endif  // V8_COMPRESS_POINTERS_IN_SHARED_CAGE
 
 // static
 Tagged_t ExternalCodeCompressionScheme::CompressObject(Address tagged) {
   // This is used to help clang produce better code. Values which could be
   // invalid pointers need to be compressed with CompressAny.
 #ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
-  V8_ASSUME((tagged & kPtrComprCageBaseMask) == base_ || HAS_SMI_TAG(tagged));
+  V8_ASSUME((tagged & kPtrComprCageBaseMask) == base() || HAS_SMI_TAG(tagged));
 #endif
   return static_cast<Tagged_t>(static_cast<uint32_t>(tagged));
 }
@@ -201,6 +213,11 @@ GetPtrComprCageBaseFromOnHeapAddress(Address address) {
       V8HeapCompressionScheme::GetPtrComprCageBaseAddress(address));
 }
 
+// Load the main pointer compression cage base.
+V8_INLINE PtrComprCageBase GetPtrComprCageBase() {
+  return PtrComprCageBase(V8HeapCompressionScheme::base());
+}
+
 #else
 
 //
@@ -250,9 +267,11 @@ V8_INLINE constexpr PtrComprCageBase GetPtrComprCageBaseFromOnHeapAddress(
   return PtrComprCageBase();
 }
 
+V8_INLINE PtrComprCageBase GetPtrComprCageBase() { return PtrComprCageBase(); }
+
 #endif  // V8_COMPRESS_POINTERS
 
-V8_INLINE PtrComprCageBase GetPtrComprCageBase(HeapObject object) {
+V8_INLINE PtrComprCageBase GetPtrComprCageBase(Tagged<HeapObject> object) {
   return GetPtrComprCageBaseFromOnHeapAddress(object.ptr());
 }
 
diff --git a/deps/v8/src/common/ptr-compr.cc b/deps/v8/src/common/ptr-compr.cc
index 899bb4798a44e8..1b5dd2a5f77eaf 100644
--- a/deps/v8/src/common/ptr-compr.cc
+++ b/deps/v8/src/common/ptr-compr.cc
@@ -2,18 +2,45 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include "src/common/ptr-compr.h"
+#include "src/common/ptr-compr-inl.h"
 
 namespace v8::internal {
 
+#ifdef V8_COMPRESS_POINTERS
+
 #ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
+#define THREAD_LOCAL_IF_MULTICAGE
+#else
+#define THREAD_LOCAL_IF_MULTICAGE thread_local
+#endif  // V8_COMPRESS_POINTERS_IN_SHARED_CAGE
+
+THREAD_LOCAL_IF_MULTICAGE uintptr_t V8HeapCompressionScheme::base_ =
+    kNullAddress;
 
-uintptr_t V8HeapCompressionScheme::base_ = kNullAddress;
+// static
+Address V8HeapCompressionScheme::base_non_inlined() { return base_; }
+
+// static
+void V8HeapCompressionScheme::set_base_non_inlined(Address base) {
+  base_ = base;
+}
 
 #ifdef V8_EXTERNAL_CODE_SPACE
-uintptr_t ExternalCodeCompressionScheme::base_ = kNullAddress;
+
+THREAD_LOCAL_IF_MULTICAGE uintptr_t ExternalCodeCompressionScheme::base_ =
+    kNullAddress;
+
+// static
+Address ExternalCodeCompressionScheme::base_non_inlined() { return base_; }
+
+// static
+void ExternalCodeCompressionScheme::set_base_non_inlined(Address base) {
+  base_ = base;
+}
 #endif  // V8_EXTERNAL_CODE_SPACE
 
-#endif  // V8_COMPRESS_POINTERS_IN_SHARED_CAGE
+#undef THREAD_LOCAL_IF_MULTICAGE
+
+#endif  // V8_COMPRESS_POINTERS
 
 }  // namespace v8::internal
diff --git a/deps/v8/src/common/ptr-compr.h b/deps/v8/src/common/ptr-compr.h
index bfe99cea9ea89a..ca5f0e1f9b328d 100644
--- a/deps/v8/src/common/ptr-compr.h
+++ b/deps/v8/src/common/ptr-compr.h
@@ -14,7 +14,7 @@ namespace v8::internal {
 // such a class allows plugging different decompression scheme in certain
 // places by introducing another CompressionScheme class with a customized
 // implementation. This is useful, for example, for Code::code
-// field (see CodeObjectSlot).
+// field (see InstructionStreamSlot).
 class V8HeapCompressionScheme {
  public:
   V8_INLINE static Address GetPtrComprCageBaseAddress(Address on_heap_addr);
@@ -48,13 +48,20 @@ class V8HeapCompressionScheme {
       PtrComprCageBase cage_base, Address raw_value,
       ProcessPointerCallback callback);
 
-#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
   // Process-wide cage base value used for decompression.
   V8_INLINE static void InitBase(Address base);
   V8_INLINE static Address base();
 
  private:
+  // These non-inlined accessors to base_ field are used in component builds
+  // where cross-component access to thread local variables is not allowed.
+  static Address base_non_inlined();
+  static void set_base_non_inlined(Address base);
+
+#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
   static V8_EXPORT_PRIVATE uintptr_t base_ V8_CONSTINIT;
+#else
+  static thread_local uintptr_t base_ V8_CONSTINIT;
 #endif  // V8_COMPRESS_POINTERS_IN_SHARED_CAGE
 };
 
@@ -92,13 +99,20 @@ class ExternalCodeCompressionScheme {
   V8_INLINE static Address DecompressTagged(TOnHeapAddress on_heap_addr,
                                             Tagged_t raw_value);
 
-#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
   // Process-wide cage base value used for decompression.
   V8_INLINE static void InitBase(Address base);
   V8_INLINE static Address base();
 
  private:
+  // These non-inlined accessors to base_ field are used in component builds
+  // where cross-component access to thread local variables is not allowed.
+  static Address base_non_inlined();
+  static void set_base_non_inlined(Address base);
+
+#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
   static V8_EXPORT_PRIVATE uintptr_t base_ V8_CONSTINIT;
+#else
+  static thread_local uintptr_t base_ V8_CONSTINIT;
 #endif  // V8_COMPRESS_POINTERS_IN_SHARED_CAGE
 };
 
diff --git a/deps/v8/src/compiler-dispatcher/lazy-compile-dispatcher.cc b/deps/v8/src/compiler-dispatcher/lazy-compile-dispatcher.cc
index a8148b7700ddf7..b69ad1ec12663b 100644
--- a/deps/v8/src/compiler-dispatcher/lazy-compile-dispatcher.cc
+++ b/deps/v8/src/compiler-dispatcher/lazy-compile-dispatcher.cc
@@ -94,43 +94,44 @@ namespace {
 void SetUncompiledDataJobPointer(LocalIsolate* isolate,
                                  Handle<SharedFunctionInfo> shared_info,
                                  Address job_address) {
-  UncompiledData uncompiled_data = shared_info->uncompiled_data();
-  switch (uncompiled_data.map(isolate).instance_type()) {
+  Tagged<UncompiledData> uncompiled_data = shared_info->uncompiled_data();
+  switch (uncompiled_data->map(isolate)->instance_type()) {
     // The easy cases -- we already have a job slot, so can write into it and
     // return.
     case UNCOMPILED_DATA_WITH_PREPARSE_DATA_AND_JOB_TYPE:
       UncompiledDataWithPreparseDataAndJob::cast(uncompiled_data)
-          .set_job(job_address);
+          ->set_job(job_address);
       break;
     case UNCOMPILED_DATA_WITHOUT_PREPARSE_DATA_WITH_JOB_TYPE:
       UncompiledDataWithoutPreparseDataWithJob::cast(uncompiled_data)
-          .set_job(job_address);
+          ->set_job(job_address);
       break;
 
     // Otherwise, we'll have to allocate a new UncompiledData (with or without
     // preparse data as appropriate), set the job pointer on that, and update
     // the SharedFunctionInfo to use the new UncompiledData
     case UNCOMPILED_DATA_WITH_PREPARSE_DATA_TYPE: {
-      Handle<String> inferred_name(uncompiled_data.inferred_name(), isolate);
+      Handle<String> inferred_name(uncompiled_data->inferred_name(), isolate);
       Handle<PreparseData> preparse_data(
-          UncompiledDataWithPreparseData::cast(uncompiled_data).preparse_data(),
+          UncompiledDataWithPreparseData::cast(uncompiled_data)
+              ->preparse_data(),
           isolate);
       Handle<UncompiledDataWithPreparseDataAndJob> new_uncompiled_data =
           isolate->factory()->NewUncompiledDataWithPreparseDataAndJob(
-              inferred_name, uncompiled_data.start_position(),
-              uncompiled_data.end_position(), preparse_data);
+              inferred_name, uncompiled_data->start_position(),
+              uncompiled_data->end_position(), preparse_data);
 
       new_uncompiled_data->set_job(job_address);
       shared_info->set_uncompiled_data(*new_uncompiled_data);
       break;
     }
     case UNCOMPILED_DATA_WITHOUT_PREPARSE_DATA_TYPE: {
-      DCHECK(uncompiled_data.IsUncompiledDataWithoutPreparseData());
-      Handle<String> inferred_name(uncompiled_data.inferred_name(), isolate);
+      DCHECK(IsUncompiledDataWithoutPreparseData(uncompiled_data));
+      Handle<String> inferred_name(uncompiled_data->inferred_name(), isolate);
       Handle<UncompiledDataWithoutPreparseDataWithJob> new_uncompiled_data =
           isolate->factory()->NewUncompiledDataWithoutPreparseDataWithJob(
-              inferred_name, uncompiled_data.start_position(),
-              uncompiled_data.end_position());
+              inferred_name, uncompiled_data->start_position(),
+              uncompiled_data->end_position());
 
       new_uncompiled_data->set_job(job_address);
       shared_info->set_uncompiled_data(*new_uncompiled_data);
@@ -165,7 +166,7 @@ void LazyCompileDispatcher::Enqueue(
     base::MutexGuard lock(&mutex_);
     if (trace_compiler_dispatcher_) {
       PrintF("LazyCompileDispatcher: enqueued job for ");
-      shared_info->ShortPrint();
+      ShortPrint(*shared_info);
       PrintF("\n");
     }
 
@@ -182,13 +183,13 @@ void LazyCompileDispatcher::Enqueue(
 bool LazyCompileDispatcher::IsEnqueued(
     Handle<SharedFunctionInfo> function) const {
   Job* job = nullptr;
-  Object function_data = function->function_data(kAcquireLoad);
-  if (function_data.IsUncompiledDataWithPreparseDataAndJob()) {
+  Tagged<Object> function_data = function->function_data(kAcquireLoad);
+  if (IsUncompiledDataWithPreparseDataAndJob(function_data)) {
     job = reinterpret_cast<Job*>(
-        UncompiledDataWithPreparseDataAndJob::cast(function_data).job());
-  } else if (function_data.IsUncompiledDataWithoutPreparseDataWithJob()) {
+        UncompiledDataWithPreparseDataAndJob::cast(function_data)->job());
+  } else if (IsUncompiledDataWithoutPreparseDataWithJob(function_data)) {
     job = reinterpret_cast<Job*>(
-        UncompiledDataWithoutPreparseDataWithJob::cast(function_data).job());
+        UncompiledDataWithoutPreparseDataWithJob::cast(function_data)->job());
   }
   return job != nullptr;
 }
@@ -249,7 +250,7 @@ bool LazyCompileDispatcher::FinishNow(Handle<SharedFunctionInfo> function) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kCompileFinishNowOnDispatcher);
   if (trace_compiler_dispatcher_) {
     PrintF("LazyCompileDispatcher: finishing ");
-    function->ShortPrint();
+    ShortPrint(*function);
     PrintF(" now\n");
   }
 
@@ -297,7 +298,7 @@ bool LazyCompileDispatcher::FinishNow(Handle<SharedFunctionInfo> function) {
 void LazyCompileDispatcher::AbortJob(Handle<SharedFunctionInfo> shared_info) {
   if (trace_compiler_dispatcher_) {
     PrintF("LazyCompileDispatcher: aborting job for ");
-    shared_info->ShortPrint();
+    ShortPrint(*shared_info);
     PrintF("\n");
   }
   base::LockGuard<base::Mutex> lock(&mutex_);
@@ -368,13 +369,13 @@ void LazyCompileDispatcher::AbortAll() {
 
 LazyCompileDispatcher::Job* LazyCompileDispatcher::GetJobFor(
     Handle<SharedFunctionInfo> shared, const base::MutexGuard&) const {
-  Object function_data = shared->function_data(kAcquireLoad);
-  if (function_data.IsUncompiledDataWithPreparseDataAndJob()) {
+  Tagged<Object> function_data = shared->function_data(kAcquireLoad);
+  if (IsUncompiledDataWithPreparseDataAndJob(function_data)) {
     return reinterpret_cast<Job*>(
-        UncompiledDataWithPreparseDataAndJob::cast(function_data).job());
-  } else if (function_data.IsUncompiledDataWithoutPreparseDataWithJob()) {
+        UncompiledDataWithPreparseDataAndJob::cast(function_data)->job());
+  } else if (IsUncompiledDataWithoutPreparseDataWithJob(function_data)) {
     return reinterpret_cast<Job*>(
-        UncompiledDataWithoutPreparseDataWithJob::cast(function_data).job());
+        UncompiledDataWithoutPreparseDataWithJob::cast(function_data)->job());
   }
   return nullptr;
 }
diff --git a/deps/v8/src/compiler-dispatcher/lazy-compile-dispatcher.h b/deps/v8/src/compiler-dispatcher/lazy-compile-dispatcher.h
index 7e6702851a10aa..3689abdce9c3d9 100644
--- a/deps/v8/src/compiler-dispatcher/lazy-compile-dispatcher.h
+++ b/deps/v8/src/compiler-dispatcher/lazy-compile-dispatcher.h
@@ -34,7 +34,6 @@ class CancelableTaskManager;
 class UnoptimizedCompileJob;
 class UnoptimizedCompileState;
 class FunctionLiteral;
-class Isolate;
 class ParseInfo;
 class ProducedPreparseData;
 class SharedFunctionInfo;
@@ -43,8 +42,6 @@ class Utf16CharacterStream;
 class WorkerThreadRuntimeCallStats;
 class Zone;
 
-template <typename T>
-class Handle;
 
 // The LazyCompileDispatcher uses a combination of idle tasks and background
 // tasks to parse and compile lazily parsed functions.
diff --git a/deps/v8/src/compiler-dispatcher/optimizing-compile-dispatcher.cc b/deps/v8/src/compiler-dispatcher/optimizing-compile-dispatcher.cc
index 73e181b4086a36..9a71d563c19832 100644
--- a/deps/v8/src/compiler-dispatcher/optimizing-compile-dispatcher.cc
+++ b/deps/v8/src/compiler-dispatcher/optimizing-compile-dispatcher.cc
@@ -8,9 +8,9 @@
 #include "src/codegen/compiler.h"
 #include "src/codegen/optimized-compilation-info.h"
 #include "src/execution/isolate.h"
-#include "src/execution/local-isolate.h"
+#include "src/execution/local-isolate-inl.h"
 #include "src/handles/handles-inl.h"
-#include "src/heap/local-heap.h"
+#include "src/heap/local-heap-inl.h"
 #include "src/init/v8.h"
 #include "src/logging/counters.h"
 #include "src/logging/log.h"
@@ -22,26 +22,16 @@
 namespace v8 {
 namespace internal {
 
-class OptimizingCompileDispatcher::CompileTask : public CancelableTask {
+class OptimizingCompileDispatcher::CompileTask : public v8::JobTask {
  public:
   explicit CompileTask(Isolate* isolate,
                        OptimizingCompileDispatcher* dispatcher)
-      : CancelableTask(isolate),
-        isolate_(isolate),
+      : isolate_(isolate),
         worker_thread_runtime_call_stats_(
             isolate->counters()->worker_thread_runtime_call_stats()),
-        dispatcher_(dispatcher) {
-    ++dispatcher_->ref_count_;
-  }
-
-  CompileTask(const CompileTask&) = delete;
-  CompileTask& operator=(const CompileTask&) = delete;
+        dispatcher_(dispatcher) {}
 
-  ~CompileTask() override = default;
-
- private:
-  // v8::Task overrides.
-  void RunInternal() override {
+  void Run(JobDelegate* delegate) override {
     LocalIsolate local_isolate(isolate_, ThreadKind::kBackground);
     DCHECK(local_isolate.heap()->IsParked());
 
@@ -50,38 +40,46 @@ class OptimizingCompileDispatcher::CompileTask : public CancelableTask {
                 RuntimeCallCounterId::kOptimizeBackgroundDispatcherJob);
 
       TimerEventScope<TimerEventRecompileConcurrent> timer(isolate_);
-      TurbofanCompilationJob* job = dispatcher_->NextInput(&local_isolate);
-      TRACE_EVENT_WITH_FLOW0(
-          TRACE_DISABLED_BY_DEFAULT("v8.compile"), "V8.OptimizeBackground", job,
-          TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
-
-      if (dispatcher_->recompilation_delay_ != 0) {
-        base::OS::Sleep(base::TimeDelta::FromMilliseconds(
-            dispatcher_->recompilation_delay_));
+      while (!delegate->ShouldYield()) {
+        TurbofanCompilationJob* job = dispatcher_->NextInput(&local_isolate);
+        if (!job) break;
+        TRACE_EVENT_WITH_FLOW0(
+            TRACE_DISABLED_BY_DEFAULT("v8.compile"), "V8.OptimizeBackground",
+            job->trace_id(),
+            TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
+
+        if (dispatcher_->recompilation_delay_ != 0) {
+          base::OS::Sleep(base::TimeDelta::FromMilliseconds(
+              dispatcher_->recompilation_delay_));
+        }
+
+        dispatcher_->CompileNext(job, &local_isolate);
       }
-
-      // This task doesn't modify code objects but it needs a read access to the
-      // code space in order to be able to get a bytecode array from a baseline
-      // code. See SharedFunctionInfo::GetActiveBytecodeArray() for details.
-      RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
-      dispatcher_->CompileNext(job, &local_isolate);
     }
-    {
-      base::MutexGuard lock_guard(&dispatcher_->ref_count_mutex_);
-      if (--dispatcher_->ref_count_ == 0) {
-        dispatcher_->ref_count_zero_.NotifyOne();
-      }
+  }
+
+  size_t GetMaxConcurrency(size_t worker_count) const override {
+    size_t num_tasks = dispatcher_->InputQueueLength() + worker_count;
+    size_t max_threads = v8_flags.concurrent_turbofan_max_threads;
+    if (max_threads > 0) {
+      return std::min(max_threads, num_tasks);
     }
+    return num_tasks;
   }
 
+ private:
   Isolate* isolate_;
   WorkerThreadRuntimeCallStats* worker_thread_runtime_call_stats_;
   OptimizingCompileDispatcher* dispatcher_;
 };
 
 OptimizingCompileDispatcher::~OptimizingCompileDispatcher() {
-  DCHECK_EQ(0, ref_count_);
   DCHECK_EQ(0, input_queue_length_);
+  if (job_handle_ && job_handle_->IsValid()) {
+    // Wait for the job handle to complete, so that we know the queue
+    // pointers are safe.
+    job_handle_->Cancel();
+  }
   DeleteArray(input_queue_);
 }
 
@@ -146,12 +144,12 @@ void OptimizingCompileDispatcher::FlushInputQueue() {
 void OptimizingCompileDispatcher::AwaitCompileTasks() {
   {
     AllowGarbageCollection allow_before_parking;
-    ParkedScope parked_scope(isolate_->main_thread_local_isolate());
-    base::MutexGuard lock_guard(&ref_count_mutex_);
-    while (ref_count_ > 0) {
-      ref_count_zero_.ParkedWait(parked_scope, &ref_count_mutex_);
-    }
+    isolate_->main_thread_local_isolate()->BlockMainThreadWhileParked(
+        [this]() { job_handle_->Join(); });
   }
+  // Join kills the job handle, so drop it and post a new one.
+  job_handle_ = V8::GetCurrentPlatform()->PostJob(
+      kTaskPriority, std::make_unique<CompileTask>(isolate_, this));
 
 #ifdef DEBUG
   base::MutexGuard access_input_queue(&input_queue_mutex_);
@@ -203,7 +201,7 @@ void OptimizingCompileDispatcher::InstallOptimizedFunctions() {
     if (!info->is_osr() && function->HasAvailableCodeKind(info->code_kind())) {
       if (v8_flags.trace_concurrent_recompilation) {
         PrintF("  ** Aborting compilation for ");
-        function->ShortPrint();
+        ShortPrint(*function);
         PrintF(" as it has already been optimized.\n");
       }
       Compiler::DisposeTurbofanCompilationJob(isolate_, job.get(), false);
@@ -216,10 +214,7 @@ void OptimizingCompileDispatcher::InstallOptimizedFunctions() {
 
 bool OptimizingCompileDispatcher::HasJobs() {
   DCHECK_EQ(ThreadId::Current(), isolate_->thread_id());
-  // Note: This relies on {output_queue_} being mutated by a background thread
-  // only when {ref_count_} is not zero. Also, {ref_count_} is never incremented
-  // by a background thread.
-  return ref_count_ != 0 || !output_queue_.empty();
+  return job_handle_->IsActive() || !output_queue_.empty();
 }
 
 void OptimizingCompileDispatcher::QueueForOptimization(
@@ -232,8 +227,20 @@ void OptimizingCompileDispatcher::QueueForOptimization(
     input_queue_[InputQueueIndex(input_queue_length_)] = job;
     input_queue_length_++;
   }
-  V8::GetCurrentPlatform()->CallOnWorkerThread(
-      std::make_unique<CompileTask>(isolate_, this));
+  job_handle_->NotifyConcurrencyIncrease();
+}
+
+OptimizingCompileDispatcher::OptimizingCompileDispatcher(Isolate* isolate)
+    : isolate_(isolate),
+      input_queue_capacity_(v8_flags.concurrent_recompilation_queue_length),
+      input_queue_length_(0),
+      input_queue_shift_(0),
+      recompilation_delay_(v8_flags.concurrent_recompilation_delay) {
+  input_queue_ = NewArray<TurbofanCompilationJob*>(input_queue_capacity_);
+  if (v8_flags.concurrent_recompilation) {
+    job_handle_ = V8::GetCurrentPlatform()->PostJob(
+        kTaskPriority, std::make_unique<CompileTask>(isolate, this));
+  }
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/compiler-dispatcher/optimizing-compile-dispatcher.h b/deps/v8/src/compiler-dispatcher/optimizing-compile-dispatcher.h
index 9794ed1935e9f3..260d541fa8cb06 100644
--- a/deps/v8/src/compiler-dispatcher/optimizing-compile-dispatcher.h
+++ b/deps/v8/src/compiler-dispatcher/optimizing-compile-dispatcher.h
@@ -25,15 +25,7 @@ class SharedFunctionInfo;
 
 class V8_EXPORT_PRIVATE OptimizingCompileDispatcher {
  public:
-  explicit OptimizingCompileDispatcher(Isolate* isolate)
-      : isolate_(isolate),
-        input_queue_capacity_(v8_flags.concurrent_recompilation_queue_length),
-        input_queue_length_(0),
-        input_queue_shift_(0),
-        ref_count_(0),
-        recompilation_delay_(v8_flags.concurrent_recompilation_delay) {
-    input_queue_ = NewArray<TurbofanCompilationJob*>(input_queue_capacity_);
-  }
+  explicit OptimizingCompileDispatcher(Isolate* isolate);
 
   ~OptimizingCompileDispatcher();
 
@@ -49,6 +41,11 @@ class V8_EXPORT_PRIVATE OptimizingCompileDispatcher {
     return input_queue_length_ < input_queue_capacity_;
   }
 
+  inline int InputQueueLength() {
+    base::MutexGuard access_input_queue(&input_queue_mutex_);
+    return input_queue_length_;
+  }
+
   static bool Enabled() { return v8_flags.concurrent_recompilation; }
 
   // This method must be called on the main thread.
@@ -67,6 +64,7 @@ class V8_EXPORT_PRIVATE OptimizingCompileDispatcher {
   class CompileTask;
 
   enum ModeFlag { COMPILE, FLUSH };
+  static constexpr TaskPriority kTaskPriority = TaskPriority::kUserVisible;
 
   void FlushQueues(BlockingBehavior blocking_behavior,
                    bool restore_function_code);
@@ -97,9 +95,7 @@ class V8_EXPORT_PRIVATE OptimizingCompileDispatcher {
   // different threads.
   base::Mutex output_queue_mutex_;
 
-  std::atomic<int> ref_count_;
-  base::Mutex ref_count_mutex_;
-  ParkingConditionVariable ref_count_zero_;
+  std::unique_ptr<JobHandle> job_handle_;
 
   // Copy of v8_flags.concurrent_recompilation_delay that will be used from the
   // background thread.
diff --git a/deps/v8/src/compiler/OWNERS b/deps/v8/src/compiler/OWNERS
index be0785d50f82c7..1243a1d1fbfd01 100644
--- a/deps/v8/src/compiler/OWNERS
+++ b/deps/v8/src/compiler/OWNERS
@@ -1,16 +1,18 @@
+dmercadier@chromium.org
 jgruber@chromium.org
-mslekova@chromium.org
+manoskouk@chromium.org
+mliedtke@chromium.org
 nicohartmann@chromium.org
 tebbi@chromium.org
 thibaudm@chromium.org
-dmercadier@chromium.org
 
 per-file wasm-*=ahaas@chromium.org
 per-file wasm-*=clemensb@chromium.org
+per-file wasm-*=dlehmann@chromium.org
 per-file wasm-*=gdeepti@chromium.org
 per-file wasm-*=jkummerow@chromium.org
-per-file wasm-*=manoskouk@chromium.org
-per-file wasm-*=mliedtke@chromium.org
+
+per-file pipeline.*=jkummerow@chromium.org
 
 per-file int64-lowering.*=ahaas@chromium.org
 
diff --git a/deps/v8/src/compiler/access-builder.cc b/deps/v8/src/compiler/access-builder.cc
index 376170cce7e46a..dd5c01ff7fcb31 100644
--- a/deps/v8/src/compiler/access-builder.cc
+++ b/deps/v8/src/compiler/access-builder.cc
@@ -21,16 +21,17 @@ namespace compiler {
 
 // static
 FieldAccess AccessBuilder::ForExternalIntPtr() {
-  FieldAccess access = {kUntaggedBase,      0,           MaybeHandle<Name>(),
-                        MaybeHandle<Map>(), Type::Any(), MachineType::IntPtr(),
-                        kNoWriteBarrier,    "ExternalIntPtr"};
+  FieldAccess access = {kUntaggedBase,       0,
+                        MaybeHandle<Name>(), OptionalMapRef(),
+                        Type::Any(),         MachineType::IntPtr(),
+                        kNoWriteBarrier,     "ExternalIntPtr"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForMap(WriteBarrierKind write_barrier) {
   FieldAccess access = {kTaggedBase,           HeapObject::kMapOffset,
-                        MaybeHandle<Name>(),   MaybeHandle<Map>(),
+                        MaybeHandle<Name>(),   OptionalMapRef(),
                         Type::OtherInternal(), MachineType::MapInHeader(),
                         write_barrier,         "Map"};
   return access;
@@ -39,18 +40,18 @@ FieldAccess AccessBuilder::ForMap(WriteBarrierKind write_barrier) {
 // static
 FieldAccess AccessBuilder::ForHeapNumberValue() {
   FieldAccess access = {
-      kTaggedBase,        HeapNumber::kValueOffset,   MaybeHandle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kFloat64, MachineType::Float64(),
-      kNoWriteBarrier,    "HeapNumberValue"};
+      kTaggedBase,      HeapNumber::kValueOffset,   MaybeHandle<Name>(),
+      OptionalMapRef(), TypeCache::Get()->kFloat64, MachineType::Float64(),
+      kNoWriteBarrier,  "HeapNumberValue"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForBigIntBitfield() {
   FieldAccess access = {
-      kTaggedBase,        BigInt::kBitfieldOffset,  MaybeHandle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kInt32, MachineType::Uint32(),
-      kNoWriteBarrier,    "BigIntBitfield"};
+      kTaggedBase,      BigInt::kBitfieldOffset,  MaybeHandle<Name>(),
+      OptionalMapRef(), TypeCache::Get()->kInt32, MachineType::Uint32(),
+      kNoWriteBarrier,  "BigIntBitfield"};
   return access;
 }
 
@@ -58,9 +59,9 @@ FieldAccess AccessBuilder::ForBigIntBitfield() {
 FieldAccess AccessBuilder::ForBigIntOptionalPadding() {
   DCHECK_EQ(FIELD_SIZE(BigInt::kOptionalPaddingOffset), 4);
   FieldAccess access = {
-      kTaggedBase,        BigInt::kOptionalPaddingOffset, MaybeHandle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kInt32,       MachineType::Uint32(),
-      kNoWriteBarrier,    "BigIntOptionalPadding"};
+      kTaggedBase,      BigInt::kOptionalPaddingOffset, MaybeHandle<Name>(),
+      OptionalMapRef(), TypeCache::Get()->kInt32,       MachineType::Uint32(),
+      kNoWriteBarrier,  "BigIntOptionalPadding"};
   return access;
 }
 
@@ -68,16 +69,16 @@ FieldAccess AccessBuilder::ForBigIntOptionalPadding() {
 FieldAccess AccessBuilder::ForBigIntLeastSignificantDigit64() {
   DCHECK_EQ(BigInt::SizeFor(1) - BigInt::SizeFor(0), 8);
   FieldAccess access = {
-      kTaggedBase,        BigInt::kDigitsOffset,        MaybeHandle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kBigUint64, MachineType::Uint64(),
-      kNoWriteBarrier,    "BigIntLeastSignificantDigit64"};
+      kTaggedBase,      BigInt::kDigitsOffset,          MaybeHandle<Name>(),
+      OptionalMapRef(), TypeCache::Get()->kBigUint64,   MachineType::Uint64(),
+      kNoWriteBarrier,  "BigIntLeastSignificantDigit64"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForJSObjectPropertiesOrHash() {
   FieldAccess access = {kTaggedBase,         JSObject::kPropertiesOrHashOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::Any(),         MachineType::AnyTagged(),
                         kFullWriteBarrier,   "JSObjectPropertiesOrHash"};
   return access;
@@ -85,18 +86,18 @@ FieldAccess AccessBuilder::ForJSObjectPropertiesOrHash() {
 
 // static
 FieldAccess AccessBuilder::ForJSObjectPropertiesOrHashKnownPointer() {
-  FieldAccess access = {kTaggedBase,         JSObject::kPropertiesOrHashOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
-                        Type::Any(),         MachineType::TaggedPointer(),
-                        kPointerWriteBarrier,
-                        "JSObjectPropertiesOrHashKnownPointer"};
+  FieldAccess access = {
+      kTaggedBase,          JSObject::kPropertiesOrHashOffset,
+      MaybeHandle<Name>(),  OptionalMapRef(),
+      Type::Any(),          MachineType::TaggedPointer(),
+      kPointerWriteBarrier, "JSObjectPropertiesOrHashKnownPointer"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForJSObjectElements() {
   FieldAccess access = {kTaggedBase,          JSObject::kElementsOffset,
-                        MaybeHandle<Name>(),  MaybeHandle<Map>(),
+                        MaybeHandle<Name>(),  OptionalMapRef(),
                         Type::Internal(),     MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "JSObjectElements"};
   return access;
@@ -104,10 +105,10 @@ FieldAccess AccessBuilder::ForJSObjectElements() {
 
 // static
 FieldAccess AccessBuilder::ForJSObjectInObjectProperty(
-    const MapRef& map, int index, MachineType machine_type) {
+    MapRef map, int index, MachineType machine_type) {
   int const offset = map.GetInObjectPropertyOffset(index);
   FieldAccess access = {kTaggedBase,         offset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::NonInternal(), machine_type,
                         kFullWriteBarrier,   "JSObjectInObjectProperty"};
   return access;
@@ -117,7 +118,7 @@ FieldAccess AccessBuilder::ForJSObjectInObjectProperty(
 FieldAccess AccessBuilder::ForJSObjectOffset(
     int offset, WriteBarrierKind write_barrier_kind) {
   FieldAccess access = {kTaggedBase,         offset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         write_barrier_kind,  "JSObjectOffset"};
   return access;
@@ -126,7 +127,7 @@ FieldAccess AccessBuilder::ForJSObjectOffset(
 // static
 FieldAccess AccessBuilder::ForJSCollectionTable() {
   FieldAccess access = {kTaggedBase,           JSCollection::kTableOffset,
-                        MaybeHandle<Name>(),   MaybeHandle<Map>(),
+                        MaybeHandle<Name>(),   OptionalMapRef(),
                         Type::OtherInternal(), MachineType::TaggedPointer(),
                         kPointerWriteBarrier,  "JSCollectionTable"};
   return access;
@@ -136,7 +137,7 @@ FieldAccess AccessBuilder::ForJSCollectionTable() {
 FieldAccess AccessBuilder::ForJSCollectionIteratorTable() {
   FieldAccess access = {
       kTaggedBase,           JSCollectionIterator::kTableOffset,
-      MaybeHandle<Name>(),   MaybeHandle<Map>(),
+      MaybeHandle<Name>(),   OptionalMapRef(),
       Type::OtherInternal(), MachineType::TaggedPointer(),
       kPointerWriteBarrier,  "JSCollectionIteratorTable"};
   return access;
@@ -147,7 +148,7 @@ FieldAccess AccessBuilder::ForJSCollectionIteratorIndex() {
   FieldAccess access = {kTaggedBase,
                         JSCollectionIterator::kIndexOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kFixedArrayLengthType,
                         MachineType::TaggedSigned(),
                         kNoWriteBarrier,
@@ -161,7 +162,7 @@ FieldAccess AccessBuilder::ForJSExternalObjectValue() {
       kTaggedBase,
       JSExternalObject::kValueOffset,
       MaybeHandle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
       Type::ExternalPointer(),
       MachineType::Pointer(),
       kNoWriteBarrier,
@@ -177,9 +178,9 @@ FieldAccess AccessBuilder::ForJSExternalObjectValue() {
 // static
 FieldAccess AccessBuilder::ForJSExternalObjectPointerHandle() {
   FieldAccess access = {
-      kTaggedBase,        JSExternalObject::kValueOffset, MaybeHandle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kUint32,      MachineType::Uint32(),
-      kNoWriteBarrier,    "JSExternalObjectPointerHandle"};
+      kTaggedBase,      JSExternalObject::kValueOffset, MaybeHandle<Name>(),
+      OptionalMapRef(), TypeCache::Get()->kUint32,      MachineType::Uint32(),
+      kNoWriteBarrier,  "JSExternalObjectPointerHandle"};
   return access;
 }
 #endif
@@ -188,7 +189,7 @@ FieldAccess AccessBuilder::ForJSExternalObjectPointerHandle() {
 FieldAccess AccessBuilder::ForJSFunctionPrototypeOrInitialMap() {
   FieldAccess access = {
       kTaggedBase,          JSFunction::kPrototypeOrInitialMapOffset,
-      MaybeHandle<Name>(),  MaybeHandle<Map>(),
+      MaybeHandle<Name>(),  OptionalMapRef(),
       Type::Any(),          MachineType::TaggedPointer(),
       kPointerWriteBarrier, "JSFunctionPrototypeOrInitialMap"};
   return access;
@@ -197,17 +198,42 @@ FieldAccess AccessBuilder::ForJSFunctionPrototypeOrInitialMap() {
 // static
 FieldAccess AccessBuilder::ForJSFunctionContext() {
   FieldAccess access = {kTaggedBase,          JSFunction::kContextOffset,
-                        MaybeHandle<Name>(),  MaybeHandle<Map>(),
+                        MaybeHandle<Name>(),  OptionalMapRef(),
                         Type::Internal(),     MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "JSFunctionContext"};
   return access;
 }
 
+#ifdef V8_CODE_POINTER_SANDBOXING
+// static
+FieldAccess AccessBuilder::ForJSFunctionCode() {
+  FieldAccess access = {kTaggedBase,
+                        JSFunction::kCodeOffset,
+                        MaybeHandle<Name>(),
+                        OptionalMapRef(),
+                        Type::OtherInternal(),
+                        MachineType::IndirectPointer(),
+                        kIndirectPointerWriteBarrier,
+                        "JSFunctionCode"};
+  return access;
+}
+#else
+// static
+FieldAccess AccessBuilder::ForJSFunctionCode() {
+  FieldAccess access = {kTaggedBase,           JSFunction::kCodeOffset,
+                        Handle<Name>(),        OptionalMapRef(),
+                        Type::OtherInternal(), MachineType::TaggedPointer(),
+                        kPointerWriteBarrier,  "JSFunctionCode"};
+  return access;
+}
+
+#endif
+
 // static
 FieldAccess AccessBuilder::ForJSFunctionSharedFunctionInfo() {
   FieldAccess access = {
       kTaggedBase,           JSFunction::kSharedFunctionInfoOffset,
-      Handle<Name>(),        MaybeHandle<Map>(),
+      Handle<Name>(),        OptionalMapRef(),
       Type::OtherInternal(), MachineType::TaggedPointer(),
       kPointerWriteBarrier,  "JSFunctionSharedFunctionInfo"};
   return access;
@@ -216,26 +242,17 @@ FieldAccess AccessBuilder::ForJSFunctionSharedFunctionInfo() {
 // static
 FieldAccess AccessBuilder::ForJSFunctionFeedbackCell() {
   FieldAccess access = {kTaggedBase,          JSFunction::kFeedbackCellOffset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
+                        Handle<Name>(),       OptionalMapRef(),
                         Type::Internal(),     MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "JSFunctionFeedbackCell"};
   return access;
 }
 
-// static
-FieldAccess AccessBuilder::ForJSFunctionCode() {
-  FieldAccess access = {kTaggedBase,           JSFunction::kCodeOffset,
-                        Handle<Name>(),        MaybeHandle<Map>(),
-                        Type::OtherInternal(), MachineType::TaggedPointer(),
-                        kPointerWriteBarrier,  "JSFunctionCode"};
-  return access;
-}
-
 // static
 FieldAccess AccessBuilder::ForJSBoundFunctionBoundTargetFunction() {
   FieldAccess access = {
       kTaggedBase,          JSBoundFunction::kBoundTargetFunctionOffset,
-      Handle<Name>(),       MaybeHandle<Map>(),
+      Handle<Name>(),       OptionalMapRef(),
       Type::Callable(),     MachineType::TaggedPointer(),
       kPointerWriteBarrier, "JSBoundFunctionBoundTargetFunction"};
   return access;
@@ -244,7 +261,7 @@ FieldAccess AccessBuilder::ForJSBoundFunctionBoundTargetFunction() {
 // static
 FieldAccess AccessBuilder::ForJSBoundFunctionBoundThis() {
   FieldAccess access = {kTaggedBase,         JSBoundFunction::kBoundThisOffset,
-                        Handle<Name>(),      MaybeHandle<Map>(),
+                        Handle<Name>(),      OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,   "JSBoundFunctionBoundThis"};
   return access;
@@ -254,7 +271,7 @@ FieldAccess AccessBuilder::ForJSBoundFunctionBoundThis() {
 FieldAccess AccessBuilder::ForJSBoundFunctionBoundArguments() {
   FieldAccess access = {
       kTaggedBase,          JSBoundFunction::kBoundArgumentsOffset,
-      Handle<Name>(),       MaybeHandle<Map>(),
+      Handle<Name>(),       OptionalMapRef(),
       Type::Internal(),     MachineType::TaggedPointer(),
       kPointerWriteBarrier, "JSBoundFunctionBoundArguments"};
   return access;
@@ -263,7 +280,7 @@ FieldAccess AccessBuilder::ForJSBoundFunctionBoundArguments() {
 // static
 FieldAccess AccessBuilder::ForJSGeneratorObjectContext() {
   FieldAccess access = {kTaggedBase,          JSGeneratorObject::kContextOffset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
+                        Handle<Name>(),       OptionalMapRef(),
                         Type::Internal(),     MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "JSGeneratorObjectContext"};
   return access;
@@ -274,7 +291,7 @@ FieldAccess AccessBuilder::ForJSGeneratorObjectFunction() {
   FieldAccess access = {kTaggedBase,
                         JSGeneratorObject::kFunctionOffset,
                         Handle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         Type::CallableFunction(),
                         MachineType::TaggedPointer(),
                         kPointerWriteBarrier,
@@ -284,10 +301,11 @@ FieldAccess AccessBuilder::ForJSGeneratorObjectFunction() {
 
 // static
 FieldAccess AccessBuilder::ForJSGeneratorObjectReceiver() {
-  FieldAccess access = {kTaggedBase,          JSGeneratorObject::kReceiverOffset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
-                        Type::Internal(),     MachineType::TaggedPointer(),
-                        kPointerWriteBarrier, "JSGeneratorObjectReceiver"};
+  FieldAccess access = {
+      kTaggedBase,          JSGeneratorObject::kReceiverOffset,
+      Handle<Name>(),       OptionalMapRef(),
+      Type::Internal(),     MachineType::TaggedPointer(),
+      kPointerWriteBarrier, "JSGeneratorObjectReceiver"};
   return access;
 }
 
@@ -295,7 +313,7 @@ FieldAccess AccessBuilder::ForJSGeneratorObjectReceiver() {
 FieldAccess AccessBuilder::ForJSGeneratorObjectContinuation() {
   FieldAccess access = {
       kTaggedBase,         JSGeneratorObject::kContinuationOffset,
-      Handle<Name>(),      MaybeHandle<Map>(),
+      Handle<Name>(),      OptionalMapRef(),
       Type::SignedSmall(), MachineType::TaggedSigned(),
       kNoWriteBarrier,     "JSGeneratorObjectContinuation"};
   return access;
@@ -305,7 +323,7 @@ FieldAccess AccessBuilder::ForJSGeneratorObjectContinuation() {
 FieldAccess AccessBuilder::ForJSGeneratorObjectInputOrDebugPos() {
   FieldAccess access = {
       kTaggedBase,         JSGeneratorObject::kInputOrDebugPosOffset,
-      Handle<Name>(),      MaybeHandle<Map>(),
+      Handle<Name>(),      OptionalMapRef(),
       Type::NonInternal(), MachineType::AnyTagged(),
       kFullWriteBarrier,   "JSGeneratorObjectInputOrDebugPos"};
   return access;
@@ -315,7 +333,7 @@ FieldAccess AccessBuilder::ForJSGeneratorObjectInputOrDebugPos() {
 FieldAccess AccessBuilder::ForJSGeneratorObjectParametersAndRegisters() {
   FieldAccess access = {
       kTaggedBase,          JSGeneratorObject::kParametersAndRegistersOffset,
-      Handle<Name>(),       MaybeHandle<Map>(),
+      Handle<Name>(),       OptionalMapRef(),
       Type::Internal(),     MachineType::TaggedPointer(),
       kPointerWriteBarrier, "JSGeneratorObjectParametersAndRegisters"};
   return access;
@@ -325,7 +343,7 @@ FieldAccess AccessBuilder::ForJSGeneratorObjectParametersAndRegisters() {
 FieldAccess AccessBuilder::ForJSGeneratorObjectResumeMode() {
   FieldAccess access = {
       kTaggedBase,         JSGeneratorObject::kResumeModeOffset,
-      Handle<Name>(),      MaybeHandle<Map>(),
+      Handle<Name>(),      OptionalMapRef(),
       Type::SignedSmall(), MachineType::TaggedSigned(),
       kNoWriteBarrier,     "JSGeneratorObjectResumeMode"};
   return access;
@@ -335,7 +353,7 @@ FieldAccess AccessBuilder::ForJSGeneratorObjectResumeMode() {
 FieldAccess AccessBuilder::ForJSAsyncFunctionObjectPromise() {
   FieldAccess access = {
       kTaggedBase,          JSAsyncFunctionObject::kPromiseOffset,
-      Handle<Name>(),       MaybeHandle<Map>(),
+      Handle<Name>(),       OptionalMapRef(),
       Type::OtherObject(),  MachineType::TaggedPointer(),
       kPointerWriteBarrier, "JSAsyncFunctionObjectPromise"};
   return access;
@@ -345,7 +363,7 @@ FieldAccess AccessBuilder::ForJSAsyncFunctionObjectPromise() {
 FieldAccess AccessBuilder::ForJSAsyncGeneratorObjectQueue() {
   FieldAccess access = {
       kTaggedBase,         JSAsyncGeneratorObject::kQueueOffset,
-      Handle<Name>(),      MaybeHandle<Map>(),
+      Handle<Name>(),      OptionalMapRef(),
       Type::NonInternal(), MachineType::AnyTagged(),
       kFullWriteBarrier,   "JSAsyncGeneratorObjectQueue"};
   return access;
@@ -355,7 +373,7 @@ FieldAccess AccessBuilder::ForJSAsyncGeneratorObjectQueue() {
 FieldAccess AccessBuilder::ForJSAsyncGeneratorObjectIsAwaiting() {
   FieldAccess access = {
       kTaggedBase,         JSAsyncGeneratorObject::kIsAwaitingOffset,
-      Handle<Name>(),      MaybeHandle<Map>(),
+      Handle<Name>(),      OptionalMapRef(),
       Type::SignedSmall(), MachineType::TaggedSigned(),
       kNoWriteBarrier,     "JSAsyncGeneratorObjectIsAwaiting"};
   return access;
@@ -367,7 +385,7 @@ FieldAccess AccessBuilder::ForJSArrayLength(ElementsKind elements_kind) {
   FieldAccess access = {kTaggedBase,
                         JSArray::kLengthOffset,
                         Handle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         type_cache->kJSArrayLengthType,
                         MachineType::AnyTagged(),
                         kFullWriteBarrier,
@@ -387,9 +405,9 @@ FieldAccess AccessBuilder::ForJSArrayLength(ElementsKind elements_kind) {
 // static
 FieldAccess AccessBuilder::ForJSArrayBufferBitField() {
   FieldAccess access = {
-      kTaggedBase,        JSArrayBuffer::kBitFieldOffset, MaybeHandle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kUint8,       MachineType::Uint32(),
-      kNoWriteBarrier,    "JSArrayBufferBitField"};
+      kTaggedBase,      JSArrayBuffer::kBitFieldOffset, MaybeHandle<Name>(),
+      OptionalMapRef(), TypeCache::Get()->kUint8,       MachineType::Uint32(),
+      kNoWriteBarrier,  "JSArrayBufferBitField"};
   return access;
 }
 
@@ -398,7 +416,7 @@ FieldAccess AccessBuilder::ForJSArrayBufferByteLength() {
   FieldAccess access = {kTaggedBase,
                         JSArrayBuffer::kRawByteLengthOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kJSArrayBufferByteLengthType,
                         MachineType::UintPtr(),
                         kNoWriteBarrier,
@@ -412,7 +430,7 @@ FieldAccess AccessBuilder::ForJSArrayBufferByteLength() {
 // static
 FieldAccess AccessBuilder::ForJSArrayBufferViewBuffer() {
   FieldAccess access = {kTaggedBase,           JSArrayBufferView::kBufferOffset,
-                        MaybeHandle<Name>(),   MaybeHandle<Map>(),
+                        MaybeHandle<Name>(),   OptionalMapRef(),
                         Type::OtherInternal(), MachineType::TaggedPointer(),
                         kPointerWriteBarrier,  "JSArrayBufferViewBuffer"};
   return access;
@@ -423,7 +441,7 @@ FieldAccess AccessBuilder::ForJSArrayBufferViewByteLength() {
   FieldAccess access = {kTaggedBase,
                         JSArrayBufferView::kRawByteLengthOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kJSArrayBufferViewByteLengthType,
                         MachineType::UintPtr(),
                         kNoWriteBarrier,
@@ -439,7 +457,7 @@ FieldAccess AccessBuilder::ForJSArrayBufferViewByteOffset() {
   FieldAccess access = {kTaggedBase,
                         JSArrayBufferView::kRawByteOffsetOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kJSArrayBufferViewByteOffsetType,
                         MachineType::UintPtr(),
                         kNoWriteBarrier,
@@ -455,7 +473,7 @@ FieldAccess AccessBuilder::ForJSArrayBufferViewBitField() {
   FieldAccess access = {kTaggedBase,
                         JSArrayBufferView::kBitFieldOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kUint32,
                         MachineType::Uint32(),
                         kNoWriteBarrier,
@@ -468,7 +486,7 @@ FieldAccess AccessBuilder::ForJSTypedArrayLength() {
   FieldAccess access = {kTaggedBase,
                         JSTypedArray::kRawLengthOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kJSTypedArrayLengthType,
                         MachineType::UintPtr(),
                         kNoWriteBarrier,
@@ -482,7 +500,7 @@ FieldAccess AccessBuilder::ForJSTypedArrayLength() {
 // static
 FieldAccess AccessBuilder::ForJSTypedArrayBasePointer() {
   FieldAccess access = {kTaggedBase,           JSTypedArray::kBasePointerOffset,
-                        MaybeHandle<Name>(),   MaybeHandle<Map>(),
+                        MaybeHandle<Name>(),   OptionalMapRef(),
                         Type::OtherInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,     "JSTypedArrayBasePointer"};
   return access;
@@ -494,7 +512,7 @@ FieldAccess AccessBuilder::ForJSTypedArrayExternalPointer() {
       kTaggedBase,
       JSTypedArray::kExternalPointerOffset,
       MaybeHandle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
 #ifdef V8_ENABLE_SANDBOX
       Type::SandboxedPointer(),
       MachineType::SandboxedPointer(),
@@ -516,7 +534,7 @@ FieldAccess AccessBuilder::ForJSDataViewDataPointer() {
       kTaggedBase,
       JSDataView::kDataPointerOffset,
       MaybeHandle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
 #ifdef V8_ENABLE_SANDBOX
       Type::SandboxedPointer(),
       MachineType::SandboxedPointer(),
@@ -537,7 +555,7 @@ FieldAccess AccessBuilder::ForJSDateValue() {
   FieldAccess access = {kTaggedBase,
                         JSDate::kValueOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kJSDateValueType,
                         MachineType::AnyTagged(),
                         kFullWriteBarrier,
@@ -549,7 +567,7 @@ FieldAccess AccessBuilder::ForJSDateValue() {
 FieldAccess AccessBuilder::ForJSDateField(JSDate::FieldIndex index) {
   FieldAccess access = {
       kTaggedBase,         JSDate::kValueOffset + index * kTaggedSize,
-      MaybeHandle<Name>(), MaybeHandle<Map>(),
+      MaybeHandle<Name>(), OptionalMapRef(),
       Type::Number(),      MachineType::AnyTagged(),
       kFullWriteBarrier,   "JSDateField"};
   return access;
@@ -558,7 +576,7 @@ FieldAccess AccessBuilder::ForJSDateField(JSDate::FieldIndex index) {
 // static
 FieldAccess AccessBuilder::ForJSIteratorResultDone() {
   FieldAccess access = {kTaggedBase,         JSIteratorResult::kDoneOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,   "JSIteratorResultDone"};
   return access;
@@ -567,7 +585,7 @@ FieldAccess AccessBuilder::ForJSIteratorResultDone() {
 // static
 FieldAccess AccessBuilder::ForJSIteratorResultValue() {
   FieldAccess access = {kTaggedBase,         JSIteratorResult::kValueOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,   "JSIteratorResultValue"};
   return access;
@@ -576,7 +594,7 @@ FieldAccess AccessBuilder::ForJSIteratorResultValue() {
 // static
 FieldAccess AccessBuilder::ForJSRegExpData() {
   FieldAccess access = {kTaggedBase,         JSRegExp::kDataOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,   "JSRegExpData"};
   return access;
@@ -585,7 +603,7 @@ FieldAccess AccessBuilder::ForJSRegExpData() {
 // static
 FieldAccess AccessBuilder::ForJSRegExpFlags() {
   FieldAccess access = {kTaggedBase,         JSRegExp::kFlagsOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,   "JSRegExpFlags"};
   return access;
@@ -594,7 +612,7 @@ FieldAccess AccessBuilder::ForJSRegExpFlags() {
 // static
 FieldAccess AccessBuilder::ForJSRegExpLastIndex() {
   FieldAccess access = {kTaggedBase,         JSRegExp::kLastIndexOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,   "JSRegExpLastIndex"};
   return access;
@@ -603,7 +621,7 @@ FieldAccess AccessBuilder::ForJSRegExpLastIndex() {
 // static
 FieldAccess AccessBuilder::ForJSRegExpSource() {
   FieldAccess access = {kTaggedBase,         JSRegExp::kSourceOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,   "JSRegExpSource"};
   return access;
@@ -614,7 +632,7 @@ FieldAccess AccessBuilder::ForFixedArrayLength() {
   FieldAccess access = {kTaggedBase,
                         FixedArray::kLengthOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kFixedArrayLengthType,
                         MachineType::TaggedSigned(),
                         kNoWriteBarrier,
@@ -627,7 +645,7 @@ FieldAccess AccessBuilder::ForWeakFixedArrayLength() {
   FieldAccess access = {kTaggedBase,
                         WeakFixedArray::kLengthOffset,
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kWeakFixedArrayLengthType,
                         MachineType::TaggedSigned(),
                         kNoWriteBarrier,
@@ -639,7 +657,7 @@ FieldAccess AccessBuilder::ForWeakFixedArrayLength() {
 FieldAccess AccessBuilder::ForSloppyArgumentsElementsContext() {
   FieldAccess access = {
       kTaggedBase,          SloppyArgumentsElements::kContextOffset,
-      MaybeHandle<Name>(),  MaybeHandle<Map>(),
+      MaybeHandle<Name>(),  OptionalMapRef(),
       Type::Any(),          MachineType::TaggedPointer(),
       kPointerWriteBarrier, "SloppyArgumentsElementsContext"};
   return access;
@@ -649,7 +667,7 @@ FieldAccess AccessBuilder::ForSloppyArgumentsElementsContext() {
 FieldAccess AccessBuilder::ForSloppyArgumentsElementsArguments() {
   FieldAccess access = {
       kTaggedBase,          SloppyArgumentsElements::kArgumentsOffset,
-      MaybeHandle<Name>(),  MaybeHandle<Map>(),
+      MaybeHandle<Name>(),  OptionalMapRef(),
       Type::Any(),          MachineType::TaggedPointer(),
       kPointerWriteBarrier, "SloppyArgumentsElementsArguments"};
   return access;
@@ -659,7 +677,7 @@ FieldAccess AccessBuilder::ForSloppyArgumentsElementsArguments() {
 FieldAccess AccessBuilder::ForPropertyArrayLengthAndHash() {
   FieldAccess access = {
       kTaggedBase,         PropertyArray::kLengthAndHashOffset,
-      MaybeHandle<Name>(), MaybeHandle<Map>(),
+      MaybeHandle<Name>(), OptionalMapRef(),
       Type::SignedSmall(), MachineType::TaggedSigned(),
       kNoWriteBarrier,     "PropertyArrayLengthAndHash"};
   return access;
@@ -669,7 +687,7 @@ FieldAccess AccessBuilder::ForPropertyArrayLengthAndHash() {
 FieldAccess AccessBuilder::ForDescriptorArrayEnumCache() {
   FieldAccess access = {
       kTaggedBase,           DescriptorArray::kEnumCacheOffset,
-      Handle<Name>(),        MaybeHandle<Map>(),
+      Handle<Name>(),        OptionalMapRef(),
       Type::OtherInternal(), MachineType::TaggedPointer(),
       kPointerWriteBarrier,  "DescriptorArrayEnumCache"};
   return access;
@@ -677,35 +695,47 @@ FieldAccess AccessBuilder::ForDescriptorArrayEnumCache() {
 
 // static
 FieldAccess AccessBuilder::ForMapBitField() {
-  FieldAccess access = {
-      kTaggedBase,        Map::kBitFieldOffset,     Handle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kUint8, MachineType::Uint8(),
-      kNoWriteBarrier,    "MapBitField"};
+  FieldAccess access = {kTaggedBase,
+                        Map::kBitFieldOffset,
+                        Handle<Name>(),
+                        OptionalMapRef(),
+                        TypeCache::Get()->kUint8,
+                        MachineType::Uint8(),
+                        kNoWriteBarrier,
+                        "MapBitField"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForMapBitField2() {
-  FieldAccess access = {
-      kTaggedBase,        Map::kBitField2Offset,    Handle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kUint8, MachineType::Uint8(),
-      kNoWriteBarrier,    "MapBitField2"};
+  FieldAccess access = {kTaggedBase,
+                        Map::kBitField2Offset,
+                        Handle<Name>(),
+                        OptionalMapRef(),
+                        TypeCache::Get()->kUint8,
+                        MachineType::Uint8(),
+                        kNoWriteBarrier,
+                        "MapBitField2"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForMapBitField3() {
-  FieldAccess access = {
-      kTaggedBase,        Map::kBitField3Offset,    Handle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kInt32, MachineType::Int32(),
-      kNoWriteBarrier,    "MapBitField3"};
+  FieldAccess access = {kTaggedBase,
+                        Map::kBitField3Offset,
+                        Handle<Name>(),
+                        OptionalMapRef(),
+                        TypeCache::Get()->kInt32,
+                        MachineType::Int32(),
+                        kNoWriteBarrier,
+                        "MapBitField3"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForMapDescriptors() {
   FieldAccess access = {kTaggedBase,           Map::kInstanceDescriptorsOffset,
-                        Handle<Name>(),        MaybeHandle<Map>(),
+                        Handle<Name>(),        OptionalMapRef(),
                         Type::OtherInternal(), MachineType::TaggedPointer(),
                         kPointerWriteBarrier,  "MapDescriptors"};
   return access;
@@ -714,16 +744,16 @@ FieldAccess AccessBuilder::ForMapDescriptors() {
 // static
 FieldAccess AccessBuilder::ForMapInstanceType() {
   FieldAccess access = {
-      kTaggedBase,        Map::kInstanceTypeOffset,  Handle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kUint16, MachineType::Uint16(),
-      kNoWriteBarrier,    "MapInstanceType"};
+      kTaggedBase,      Map::kInstanceTypeOffset,  Handle<Name>(),
+      OptionalMapRef(), TypeCache::Get()->kUint16, MachineType::Uint16(),
+      kNoWriteBarrier,  "MapInstanceType"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForMapPrototype() {
   FieldAccess access = {kTaggedBase,          Map::kPrototypeOffset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
+                        Handle<Name>(),       OptionalMapRef(),
                         Type::Any(),          MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "MapPrototype"};
   return access;
@@ -733,7 +763,7 @@ FieldAccess AccessBuilder::ForMapPrototype() {
 FieldAccess AccessBuilder::ForMapNativeContext() {
   FieldAccess access = {
       kTaggedBase,          Map::kConstructorOrBackPointerOrNativeContextOffset,
-      Handle<Name>(),       MaybeHandle<Map>(),
+      Handle<Name>(),       OptionalMapRef(),
       Type::Any(),          MachineType::TaggedPointer(),
       kPointerWriteBarrier, "MapNativeContext"};
   return access;
@@ -743,7 +773,7 @@ FieldAccess AccessBuilder::ForMapNativeContext() {
 FieldAccess AccessBuilder::ForModuleRegularExports() {
   FieldAccess access = {
       kTaggedBase,           SourceTextModule::kRegularExportsOffset,
-      Handle<Name>(),        MaybeHandle<Map>(),
+      Handle<Name>(),        OptionalMapRef(),
       Type::OtherInternal(), MachineType::TaggedPointer(),
       kPointerWriteBarrier,  "ModuleRegularExports"};
   return access;
@@ -753,7 +783,7 @@ FieldAccess AccessBuilder::ForModuleRegularExports() {
 FieldAccess AccessBuilder::ForModuleRegularImports() {
   FieldAccess access = {
       kTaggedBase,           SourceTextModule::kRegularImportsOffset,
-      Handle<Name>(),        MaybeHandle<Map>(),
+      Handle<Name>(),        OptionalMapRef(),
       Type::OtherInternal(), MachineType::TaggedPointer(),
       kPointerWriteBarrier,  "ModuleRegularImports"};
   return access;
@@ -762,16 +792,16 @@ FieldAccess AccessBuilder::ForModuleRegularImports() {
 // static
 FieldAccess AccessBuilder::ForNameRawHashField() {
   FieldAccess access = {kTaggedBase,        Name::kRawHashFieldOffset,
-                        Handle<Name>(),     MaybeHandle<Map>(),
+                        Handle<Name>(),     OptionalMapRef(),
                         Type::Unsigned32(), MachineType::Uint32(),
-                        kNoWriteBarrier ,   "NameRawHashField"};
+                        kNoWriteBarrier,    "NameRawHashField"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForFreeSpaceSize() {
   FieldAccess access = {kTaggedBase,         FreeSpace::kSizeOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::SignedSmall(), MachineType::TaggedSigned(),
                         kNoWriteBarrier};
   return access;
@@ -782,7 +812,7 @@ FieldAccess AccessBuilder::ForStringLength() {
   FieldAccess access = {kTaggedBase,
                         String::kLengthOffset,
                         Handle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kStringLengthType,
                         MachineType::Uint32(),
                         kNoWriteBarrier,
@@ -792,18 +822,17 @@ FieldAccess AccessBuilder::ForStringLength() {
 
 // static
 FieldAccess AccessBuilder::ForConsStringFirst() {
-  FieldAccess access = {kTaggedBase,         ConsString::kFirstOffset,
-                        Handle<Name>(),      MaybeHandle<Map>(),
-                        Type::String(),      MachineType::TaggedPointer(),
-                        kPointerWriteBarrier,
-                        "ConsStringFirst"};
+  FieldAccess access = {kTaggedBase,          ConsString::kFirstOffset,
+                        Handle<Name>(),       OptionalMapRef(),
+                        Type::String(),       MachineType::TaggedPointer(),
+                        kPointerWriteBarrier, "ConsStringFirst"};
   return access;
 }
 
 // static
 FieldAccess AccessBuilder::ForConsStringSecond() {
   FieldAccess access = {kTaggedBase,          ConsString::kSecondOffset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
+                        Handle<Name>(),       OptionalMapRef(),
                         Type::String(),       MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "ConsStringSecond"};
   return access;
@@ -812,7 +841,7 @@ FieldAccess AccessBuilder::ForConsStringSecond() {
 // static
 FieldAccess AccessBuilder::ForThinStringActual() {
   FieldAccess access = {kTaggedBase,          ThinString::kActualOffset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
+                        Handle<Name>(),       OptionalMapRef(),
                         Type::String(),       MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "ThinStringActual"};
   return access;
@@ -821,7 +850,7 @@ FieldAccess AccessBuilder::ForThinStringActual() {
 // static
 FieldAccess AccessBuilder::ForSlicedStringOffset() {
   FieldAccess access = {kTaggedBase,         SlicedString::kOffsetOffset,
-                        Handle<Name>(),      MaybeHandle<Map>(),
+                        Handle<Name>(),      OptionalMapRef(),
                         Type::SignedSmall(), MachineType::TaggedSigned(),
                         kNoWriteBarrier,     "SlicedStringOffset"};
   return access;
@@ -830,7 +859,7 @@ FieldAccess AccessBuilder::ForSlicedStringOffset() {
 // static
 FieldAccess AccessBuilder::ForSlicedStringParent() {
   FieldAccess access = {kTaggedBase,          SlicedString::kParentOffset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
+                        Handle<Name>(),       OptionalMapRef(),
                         Type::String(),       MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "SlicedStringParent"};
   return access;
@@ -842,7 +871,7 @@ FieldAccess AccessBuilder::ForExternalStringResourceData() {
       kTaggedBase,
       ExternalString::kResourceDataOffset,
       Handle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
       Type::ExternalPointer(),
       MachineType::Pointer(),
       kNoWriteBarrier,
@@ -874,7 +903,7 @@ ElementAccess AccessBuilder::ForSeqTwoByteStringCharacter() {
 FieldAccess AccessBuilder::ForJSGlobalProxyNativeContext() {
   FieldAccess access = {
       kTaggedBase,          JSGlobalProxy::kNativeContextOffset,
-      Handle<Name>(),       MaybeHandle<Map>(),
+      Handle<Name>(),       OptionalMapRef(),
       Type::Internal(),     MachineType::TaggedPointer(),
       kPointerWriteBarrier, "JSGlobalProxyNativeContext"};
   return access;
@@ -884,7 +913,7 @@ FieldAccess AccessBuilder::ForJSGlobalProxyNativeContext() {
 FieldAccess AccessBuilder::ForJSArrayIteratorIteratedObject() {
   FieldAccess access = {
       kTaggedBase,          JSArrayIterator::kIteratedObjectOffset,
-      Handle<Name>(),       MaybeHandle<Map>(),
+      Handle<Name>(),       OptionalMapRef(),
       Type::Receiver(),     MachineType::TaggedPointer(),
       kPointerWriteBarrier, "JSArrayIteratorIteratedObject"};
   return access;
@@ -897,7 +926,7 @@ FieldAccess AccessBuilder::ForJSArrayIteratorNextIndex() {
   FieldAccess access = {kTaggedBase,
                         JSArrayIterator::kNextIndexOffset,
                         Handle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kPositiveSafeInteger,
                         MachineType::AnyTagged(),
                         kFullWriteBarrier,
@@ -910,7 +939,7 @@ FieldAccess AccessBuilder::ForJSArrayIteratorKind() {
   FieldAccess access = {kTaggedBase,
                         JSArrayIterator::kKindOffset,
                         Handle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kJSArrayIteratorKindType,
                         MachineType::TaggedSigned(),
                         kNoWriteBarrier,
@@ -921,7 +950,7 @@ FieldAccess AccessBuilder::ForJSArrayIteratorKind() {
 // static
 FieldAccess AccessBuilder::ForJSStringIteratorString() {
   FieldAccess access = {kTaggedBase,          JSStringIterator::kStringOffset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
+                        Handle<Name>(),       OptionalMapRef(),
                         Type::String(),       MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "JSStringIteratorString"};
   return access;
@@ -932,7 +961,7 @@ FieldAccess AccessBuilder::ForJSStringIteratorIndex() {
   FieldAccess access = {kTaggedBase,
                         JSStringIterator::kIndexOffset,
                         Handle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kStringLengthType,
                         MachineType::TaggedSigned(),
                         kNoWriteBarrier,
@@ -945,7 +974,7 @@ FieldAccess AccessBuilder::ForArgumentsLength() {
   constexpr int offset = JSStrictArgumentsObject::kLengthOffset;
   static_assert(offset == JSSloppyArgumentsObject::kLengthOffset);
   FieldAccess access = {kTaggedBase,         offset,
-                        Handle<Name>(),      MaybeHandle<Map>(),
+                        Handle<Name>(),      OptionalMapRef(),
                         Type::NonInternal(), MachineType::AnyTagged(),
                         kFullWriteBarrier,   "ArgumentsLength"};
   return access;
@@ -955,7 +984,7 @@ FieldAccess AccessBuilder::ForArgumentsLength() {
 FieldAccess AccessBuilder::ForArgumentsCallee() {
   FieldAccess access = {
       kTaggedBase,         JSSloppyArgumentsObject::kCalleeOffset,
-      Handle<Name>(),      MaybeHandle<Map>(),
+      Handle<Name>(),      OptionalMapRef(),
       Type::NonInternal(), MachineType::AnyTagged(),
       kFullWriteBarrier,   "ArgumentsCallee"};
   return access;
@@ -966,7 +995,7 @@ FieldAccess AccessBuilder::ForFixedArraySlot(
     size_t index, WriteBarrierKind write_barrier_kind) {
   int offset = FixedArray::OffsetOfElementAt(static_cast<int>(index));
   FieldAccess access = {kTaggedBase,        offset,
-                        Handle<Name>(),     MaybeHandle<Map>(),
+                        Handle<Name>(),     OptionalMapRef(),
                         Type::Any(),        MachineType::AnyTagged(),
                         write_barrier_kind, "FixedArraySlot"};
   return access;
@@ -976,7 +1005,7 @@ FieldAccess AccessBuilder::ForFixedArraySlot(
 FieldAccess AccessBuilder::ForFeedbackVectorSlot(int index) {
   int offset = FeedbackVector::OffsetOfElementAt(index);
   FieldAccess access = {kTaggedBase,       offset,
-                        Handle<Name>(),    MaybeHandle<Map>(),
+                        Handle<Name>(),    OptionalMapRef(),
                         Type::Any(),       MachineType::AnyTagged(),
                         kFullWriteBarrier, "FeedbackVectorSlot"};
   return access;
@@ -986,7 +1015,7 @@ FieldAccess AccessBuilder::ForFeedbackVectorSlot(int index) {
 FieldAccess AccessBuilder::ForWeakFixedArraySlot(int index) {
   int offset = WeakFixedArray::OffsetOfElementAt(index);
   FieldAccess access = {kTaggedBase,       offset,
-                        Handle<Name>(),    MaybeHandle<Map>(),
+                        Handle<Name>(),    OptionalMapRef(),
                         Type::Any(),       MachineType::AnyTagged(),
                         kFullWriteBarrier, "WeakFixedArraySlot"};
   return access;
@@ -994,7 +1023,7 @@ FieldAccess AccessBuilder::ForWeakFixedArraySlot(int index) {
 // static
 FieldAccess AccessBuilder::ForCellValue() {
   FieldAccess access = {kTaggedBase,       Cell::kValueOffset,
-                        Handle<Name>(),    MaybeHandle<Map>(),
+                        Handle<Name>(),    OptionalMapRef(),
                         Type::Any(),       MachineType::AnyTagged(),
                         kFullWriteBarrier, "CellValue"};
   return access;
@@ -1003,7 +1032,7 @@ FieldAccess AccessBuilder::ForCellValue() {
 // static
 FieldAccess AccessBuilder::ForScopeInfoFlags() {
   FieldAccess access = {kTaggedBase,         ScopeInfo::kFlagsOffset,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
+                        MaybeHandle<Name>(), OptionalMapRef(),
                         Type::SignedSmall(), MachineType::TaggedSigned(),
                         kNoWriteBarrier,     "ScopeInfoFlags"};
   return access;
@@ -1015,7 +1044,7 @@ FieldAccess AccessBuilder::ForContextSlot(size_t index) {
   DCHECK_EQ(offset,
             Context::SlotOffset(static_cast<int>(index)) + kHeapObjectTag);
   FieldAccess access = {kTaggedBase,       offset,
-                        Handle<Name>(),    MaybeHandle<Map>(),
+                        Handle<Name>(),    OptionalMapRef(),
                         Type::Any(),       MachineType::AnyTagged(),
                         kFullWriteBarrier, "ContextSlot"};
   return access;
@@ -1027,7 +1056,7 @@ FieldAccess AccessBuilder::ForContextSlotKnownPointer(size_t index) {
   DCHECK_EQ(offset,
             Context::SlotOffset(static_cast<int>(index)) + kHeapObjectTag);
   FieldAccess access = {kTaggedBase,          offset,
-                        Handle<Name>(),       MaybeHandle<Map>(),
+                        Handle<Name>(),       OptionalMapRef(),
                         Type::Any(),          MachineType::TaggedPointer(),
                         kPointerWriteBarrier, "ContextSlotKnownPointer"};
   return access;
@@ -1080,7 +1109,7 @@ ElementAccess AccessBuilder::ForFixedArrayElement(ElementsKind kind) {
       access.machine_type = MachineType::Float64();
       break;
     case HOLEY_DOUBLE_ELEMENTS:
-      access.type = Type::NumberOrHole();
+      access.type = Type::NumberOrTheHole();
       access.write_barrier_kind = kNoWriteBarrier;
       access.machine_type = MachineType::Float64();
       break;
@@ -1111,7 +1140,7 @@ ElementAccess AccessBuilder::ForFixedDoubleArrayElement() {
 // static
 FieldAccess AccessBuilder::ForEnumCacheKeys() {
   FieldAccess access = {kTaggedBase,           EnumCache::kKeysOffset,
-                        MaybeHandle<Name>(),   MaybeHandle<Map>(),
+                        MaybeHandle<Name>(),   OptionalMapRef(),
                         Type::OtherInternal(), MachineType::TaggedPointer(),
                         kPointerWriteBarrier,  "EnumCacheKeys"};
   return access;
@@ -1120,7 +1149,7 @@ FieldAccess AccessBuilder::ForEnumCacheKeys() {
 // static
 FieldAccess AccessBuilder::ForEnumCacheIndices() {
   FieldAccess access = {kTaggedBase,           EnumCache::kIndicesOffset,
-                        MaybeHandle<Name>(),   MaybeHandle<Map>(),
+                        MaybeHandle<Name>(),   OptionalMapRef(),
                         Type::OtherInternal(), MachineType::TaggedPointer(),
                         kPointerWriteBarrier,  "EnumCacheIndices"};
   return access;
@@ -1203,7 +1232,7 @@ FieldAccess AccessBuilder::ForHashTableBaseNumberOfElements() {
       kTaggedBase,
       FixedArray::OffsetOfElementAt(HashTableBase::kNumberOfElementsIndex),
       MaybeHandle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
       Type::SignedSmall(),
       MachineType::TaggedSigned(),
       kNoWriteBarrier,
@@ -1217,7 +1246,7 @@ FieldAccess AccessBuilder::ForHashTableBaseNumberOfDeletedElement() {
                         FixedArray::OffsetOfElementAt(
                             HashTableBase::kNumberOfDeletedElementsIndex),
                         MaybeHandle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         Type::SignedSmall(),
                         MachineType::TaggedSigned(),
                         kNoWriteBarrier,
@@ -1231,7 +1260,7 @@ FieldAccess AccessBuilder::ForHashTableBaseCapacity() {
       kTaggedBase,
       FixedArray::OffsetOfElementAt(HashTableBase::kCapacityIndex),
       MaybeHandle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
       Type::SignedSmall(),
       MachineType::TaggedSigned(),
       kNoWriteBarrier,
@@ -1247,7 +1276,7 @@ FieldAccess AccessBuilder::ForOrderedHashMapOrSetNextTable() {
                 OrderedHashSet::NextTableOffset());
   FieldAccess const access = {
       kTaggedBase,         OrderedHashMap::NextTableOffset(),
-      MaybeHandle<Name>(), MaybeHandle<Map>(),
+      MaybeHandle<Name>(), OptionalMapRef(),
       Type::Any(),         MachineType::AnyTagged(),
       kFullWriteBarrier,   "OrderedHashMapOrSetNextTable"};
   return access;
@@ -1262,7 +1291,7 @@ FieldAccess AccessBuilder::ForOrderedHashMapOrSetNumberOfBuckets() {
   FieldAccess const access = {kTaggedBase,
                               OrderedHashMap::NumberOfBucketsOffset(),
                               MaybeHandle<Name>(),
-                              MaybeHandle<Map>(),
+                              OptionalMapRef(),
                               TypeCache::Get()->kFixedArrayLengthType,
                               MachineType::TaggedSigned(),
                               kNoWriteBarrier,
@@ -1279,7 +1308,7 @@ FieldAccess AccessBuilder::ForOrderedHashMapOrSetNumberOfDeletedElements() {
   FieldAccess const access = {kTaggedBase,
                               OrderedHashMap::NumberOfDeletedElementsOffset(),
                               MaybeHandle<Name>(),
-                              MaybeHandle<Map>(),
+                              OptionalMapRef(),
                               TypeCache::Get()->kFixedArrayLengthType,
                               MachineType::TaggedSigned(),
                               kNoWriteBarrier,
@@ -1296,7 +1325,7 @@ FieldAccess AccessBuilder::ForOrderedHashMapOrSetNumberOfElements() {
   FieldAccess const access = {kTaggedBase,
                               OrderedHashMap::NumberOfElementsOffset(),
                               MaybeHandle<Name>(),
-                              MaybeHandle<Map>(),
+                              OptionalMapRef(),
                               TypeCache::Get()->kFixedArrayLengthType,
                               MachineType::TaggedSigned(),
                               kNoWriteBarrier,
@@ -1320,7 +1349,7 @@ FieldAccess AccessBuilder::ForDictionaryNextEnumerationIndex() {
       kTaggedBase,
       FixedArray::OffsetOfElementAt(NameDictionary::kNextEnumerationIndexIndex),
       MaybeHandle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
       Type::SignedSmall(),
       MachineType::TaggedSigned(),
       kNoWriteBarrier,
@@ -1334,7 +1363,7 @@ FieldAccess AccessBuilder::ForDictionaryObjectHashIndex() {
       kTaggedBase,
       FixedArray::OffsetOfElementAt(NameDictionary::kObjectHashIndex),
       MaybeHandle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
       Type::SignedSmall(),
       MachineType::TaggedSigned(),
       kNoWriteBarrier,
@@ -1348,7 +1377,7 @@ FieldAccess AccessBuilder::ForNameDictionaryFlagsIndex() {
       kTaggedBase,
       FixedArray::OffsetOfElementAt(NameDictionary::kFlagsIndex),
       MaybeHandle<Name>(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
       Type::SignedSmall(),
       MachineType::TaggedSigned(),
       kNoWriteBarrier,
@@ -1361,7 +1390,7 @@ FieldAccess AccessBuilder::ForFeedbackCellInterruptBudget() {
   FieldAccess access = {kTaggedBase,
                         FeedbackCell::kInterruptBudgetOffset,
                         Handle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kInt32,
                         MachineType::Int32(),
                         kNoWriteBarrier,
@@ -1374,7 +1403,7 @@ FieldAccess AccessBuilder::ForFeedbackVectorInvocationCount() {
   FieldAccess access = {kTaggedBase,
                         FeedbackVector::kInvocationCountOffset,
                         Handle<Name>(),
-                        MaybeHandle<Map>(),
+                        OptionalMapRef(),
                         TypeCache::Get()->kInt32,
                         MachineType::Int32(),
                         kNoWriteBarrier,
@@ -1385,9 +1414,9 @@ FieldAccess AccessBuilder::ForFeedbackVectorInvocationCount() {
 // static
 FieldAccess AccessBuilder::ForFeedbackVectorFlags() {
   FieldAccess access = {
-      kTaggedBase,        FeedbackVector::kFlagsOffset, Handle<Name>(),
-      MaybeHandle<Map>(), TypeCache::Get()->kUint16,    MachineType::Uint16(),
-      kNoWriteBarrier,    "FeedbackVectorFlags"};
+      kTaggedBase,      FeedbackVector::kFlagsOffset, Handle<Name>(),
+      OptionalMapRef(), TypeCache::Get()->kUint16,    MachineType::Uint16(),
+      kNoWriteBarrier,  "FeedbackVectorFlags"};
   return access;
 }
 
@@ -1395,7 +1424,7 @@ FieldAccess AccessBuilder::ForFeedbackVectorFlags() {
 FieldAccess AccessBuilder::ForFeedbackVectorClosureFeedbackCellArray() {
   FieldAccess access = {
       kTaggedBase,       FeedbackVector::kClosureFeedbackCellArrayOffset,
-      Handle<Name>(),    MaybeHandle<Map>(),
+      Handle<Name>(),    OptionalMapRef(),
       Type::Any(),       MachineType::TaggedPointer(),
       kFullWriteBarrier, "FeedbackVectorClosureFeedbackCellArray"};
   return access;
diff --git a/deps/v8/src/compiler/access-builder.h b/deps/v8/src/compiler/access-builder.h
index b8004366154887..8333eace026862 100644
--- a/deps/v8/src/compiler/access-builder.h
+++ b/deps/v8/src/compiler/access-builder.h
@@ -60,7 +60,7 @@ class V8_EXPORT_PRIVATE AccessBuilder final
 
   // Provides access to JSObject inobject property fields.
   static FieldAccess ForJSObjectInObjectProperty(
-      const MapRef& map, int index,
+      MapRef map, int index,
       MachineType machine_type = MachineType::AnyTagged());
   static FieldAccess ForJSObjectOffset(
       int offset, WriteBarrierKind write_barrier_kind = kFullWriteBarrier);
@@ -89,15 +89,15 @@ class V8_EXPORT_PRIVATE AccessBuilder final
   // Provides access to JSFunction::context() field.
   static FieldAccess ForJSFunctionContext();
 
+  // Provides access to JSFunction::code() field.
+  static FieldAccess ForJSFunctionCode();
+
   // Provides access to JSFunction::shared() field.
   static FieldAccess ForJSFunctionSharedFunctionInfo();
 
   // Provides access to JSFunction::feedback_cell() field.
   static FieldAccess ForJSFunctionFeedbackCell();
 
-  // Provides access to JSFunction::code() field.
-  static FieldAccess ForJSFunctionCode();
-
   // Provides access to JSBoundFunction::bound_target_function() field.
   static FieldAccess ForJSBoundFunctionBoundTargetFunction();
 
diff --git a/deps/v8/src/compiler/access-info.cc b/deps/v8/src/compiler/access-info.cc
index 3120077a771026..e0c3cb94712753 100644
--- a/deps/v8/src/compiler/access-info.cc
+++ b/deps/v8/src/compiler/access-info.cc
@@ -10,6 +10,7 @@
 #include "src/builtins/accessors.h"
 #include "src/compiler/compilation-dependencies.h"
 #include "src/compiler/heap-refs.h"
+#include "src/compiler/js-heap-broker-inl.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/compiler/type-cache.h"
 #include "src/ic/call-optimization.h"
@@ -35,9 +36,9 @@ bool CanInlinePropertyAccess(MapRef map, AccessMode access_mode) {
   // relationship between the map and the object (and therefore the property
   // dictionary).
   static_assert(ODDBALL_TYPE == LAST_PRIMITIVE_HEAP_OBJECT_TYPE);
-  if (map.object()->IsBooleanMap()) return true;
+  if (IsBooleanMap(*map.object())) return true;
   if (map.instance_type() < LAST_PRIMITIVE_HEAP_OBJECT_TYPE) return true;
-  if (map.object()->IsJSObjectMap()) {
+  if (IsJSObjectMap(*map.object())) {
     if (map.is_dictionary_map()) {
       if (!V8_DICT_PROPERTY_CONST_TRACKING_BOOL) return false;
       return access_mode == AccessMode::kLoad &&
@@ -352,7 +353,7 @@ bool PropertyAccessInfo::Merge(PropertyAccessInfo const* that,
 }
 
 ConstFieldInfo PropertyAccessInfo::GetConstFieldInfo() const {
-  return IsFastDataConstant() ? ConstFieldInfo(field_owner_map_->object())
+  return IsFastDataConstant() ? ConstFieldInfo(*field_owner_map_)
                               : ConstFieldInfo::None();
 }
 
@@ -434,18 +435,23 @@ PropertyAccessInfo AccessInfoFactory::ComputeDataFieldAccessInfo(
       TryMakeRef<Object>(broker(), descriptors_field_type);
   if (!descriptors_field_type_ref.has_value()) return Invalid();
 
+  // Note: FindFieldOwner may be called multiple times throughout one
+  // compilation. This is safe since its result is fixed for a given map and
+  // descriptor.
+  MapRef field_owner_map = map.FindFieldOwner(broker(), descriptor);
+
   if (details_representation.IsSmi()) {
     field_type = Type::SignedSmall();
     unrecorded_dependencies.push_back(
         dependencies()->FieldRepresentationDependencyOffTheRecord(
-            map, descriptor, details_representation));
+            map, field_owner_map, descriptor, details_representation));
   } else if (details_representation.IsDouble()) {
     field_type = type_cache_->kFloat64;
     unrecorded_dependencies.push_back(
         dependencies()->FieldRepresentationDependencyOffTheRecord(
-            map, descriptor, details_representation));
+            map, field_owner_map, descriptor, details_representation));
   } else if (details_representation.IsHeapObject()) {
-    if (descriptors_field_type->IsNone()) {
+    if (IsNone(*descriptors_field_type)) {
       switch (access_mode) {
         case AccessMode::kStore:
         case AccessMode::kStoreInLiteral:
@@ -462,11 +468,11 @@ PropertyAccessInfo AccessInfoFactory::ComputeDataFieldAccessInfo(
     }
     unrecorded_dependencies.push_back(
         dependencies()->FieldRepresentationDependencyOffTheRecord(
-            map, descriptor, details_representation));
-    if (descriptors_field_type->IsClass()) {
+            map, field_owner_map, descriptor, details_representation));
+    if (IsClass(*descriptors_field_type)) {
       // Remember the field map, and try to infer a useful type.
       OptionalMapRef maybe_field_map =
-          TryMakeRef(broker(), descriptors_field_type->AsClass());
+          TryMakeRef(broker(), (*descriptors_field_type)->AsClass());
       if (!maybe_field_map.has_value()) return Invalid();
       field_type = Type::For(maybe_field_map.value(), broker());
       field_map = maybe_field_map;
@@ -478,15 +484,11 @@ PropertyAccessInfo AccessInfoFactory::ComputeDataFieldAccessInfo(
   // of the access info.
   unrecorded_dependencies.push_back(
       dependencies()->FieldTypeDependencyOffTheRecord(
-          map, descriptor, descriptors_field_type_ref.value()));
+          map, field_owner_map, descriptor,
+          descriptors_field_type_ref.value()));
 
   PropertyConstness constness =
-      dependencies()->DependOnFieldConstness(map, descriptor);
-
-  // Note: FindFieldOwner may be called multiple times throughout one
-  // compilation. This is safe since its result is fixed for a given map and
-  // descriptor.
-  MapRef field_owner_map = map.FindFieldOwner(broker(), descriptor);
+      dependencies()->DependOnFieldConstness(map, field_owner_map, descriptor);
 
   switch (constness) {
     case PropertyConstness::kMutable:
@@ -511,19 +513,20 @@ using AccessorsObjectGetter = std::function<Handle<Object>()>;
 PropertyAccessInfo AccessorAccessInfoHelper(
     Isolate* isolate, Zone* zone, JSHeapBroker* broker,
     const AccessInfoFactory* ai_factory, MapRef receiver_map, NameRef name,
-    MapRef map, OptionalJSObjectRef holder, AccessMode access_mode,
+    MapRef holder_map, OptionalJSObjectRef holder, AccessMode access_mode,
     AccessorsObjectGetter get_accessors) {
-  if (map.instance_type() == JS_MODULE_NAMESPACE_TYPE) {
-    DCHECK(map.object()->is_prototype_map());
+  if (holder_map.instance_type() == JS_MODULE_NAMESPACE_TYPE) {
+    DCHECK(holder_map.object()->is_prototype_map());
     Handle<PrototypeInfo> proto_info = broker->CanonicalPersistentHandle(
-        PrototypeInfo::cast(map.object()->prototype_info()));
+        PrototypeInfo::cast(holder_map.object()->prototype_info()));
     Handle<JSModuleNamespace> module_namespace =
         broker->CanonicalPersistentHandle(
             JSModuleNamespace::cast(proto_info->module_namespace()));
     Handle<Cell> cell = broker->CanonicalPersistentHandle(
-        Cell::cast(module_namespace->module().exports().Lookup(
-            isolate, name.object(), Smi::ToInt(name.object()->GetHash()))));
-    if (cell->value(kRelaxedLoad).IsTheHole(isolate)) {
+        Cell::cast(module_namespace->module()->exports()->Lookup(
+            isolate, name.object(),
+            Smi::ToInt(Object::GetHash(*name.object())))));
+    if (IsTheHole(cell->value(kRelaxedLoad), isolate)) {
       // This module has not been fully initialized yet.
       return PropertyAccessInfo::Invalid(zone);
     }
@@ -536,14 +539,14 @@ PropertyAccessInfo AccessorAccessInfoHelper(
   }
   if (access_mode == AccessMode::kHas) {
     // kHas is not supported for dictionary mode objects.
-    DCHECK(!map.is_dictionary_map());
+    DCHECK(!holder_map.is_dictionary_map());
 
     // HasProperty checks don't call getter/setters, existence is sufficient.
     return PropertyAccessInfo::FastAccessorConstant(zone, receiver_map, holder,
                                                     {}, {});
   }
   Handle<Object> maybe_accessors = get_accessors();
-  if (!maybe_accessors->IsAccessorPair()) {
+  if (!IsAccessorPair(*maybe_accessors)) {
     return PropertyAccessInfo::Invalid(zone);
   }
   Handle<AccessorPair> accessors = Handle<AccessorPair>::cast(maybe_accessors);
@@ -555,13 +558,20 @@ PropertyAccessInfo AccessorAccessInfoHelper(
   if (!accessor_ref.has_value()) return PropertyAccessInfo::Invalid(zone);
 
   OptionalJSObjectRef api_holder_ref;
-  if (!accessor->IsJSFunction()) {
+  if (!IsJSFunction(*accessor)) {
     CallOptimization optimization(broker->local_isolate_or_isolate(), accessor);
     if (!optimization.is_simple_api_call() ||
         optimization.IsCrossContextLazyAccessorPair(
-            *broker->target_native_context().object(), *map.object())) {
+            *broker->target_native_context().object(), *holder_map.object())) {
       return PropertyAccessInfo::Invalid(zone);
     }
+    if (DEBUG_BOOL && holder.has_value()) {
+      base::Optional<NativeContext> holder_creation_context =
+          holder->object()->GetCreationContextRaw();
+      CHECK(holder_creation_context.has_value());
+      CHECK_EQ(*broker->target_native_context().object(),
+               holder_creation_context.value());
+    }
 
     CallOptimization::HolderLookup holder_lookup;
     Handle<JSObject> api_holder = broker->CanonicalPersistentHandle(
@@ -589,13 +599,13 @@ PropertyAccessInfo AccessorAccessInfoHelper(
           TryMakeRef(broker, cached_property_name.value());
       if (cached_property_name_ref.has_value()) {
         PropertyAccessInfo access_info = ai_factory->ComputePropertyAccessInfo(
-            map, cached_property_name_ref.value(), access_mode);
+            holder_map, cached_property_name_ref.value(), access_mode);
         if (!access_info.IsInvalid()) return access_info;
       }
     }
   }
 
-  if (map.is_dictionary_map()) {
+  if (holder_map.is_dictionary_map()) {
     CHECK(!api_holder_ref.has_value());
     return PropertyAccessInfo::DictionaryProtoAccessorConstant(
         zone, receiver_map, holder, accessor_ref.value(), api_holder_ref, name);
@@ -615,7 +625,7 @@ PropertyAccessInfo AccessInfoFactory::ComputeAccessorDescriptorAccessInfo(
   Handle<DescriptorArray> descriptors = broker()->CanonicalPersistentHandle(
       holder_map.object()->instance_descriptors(kRelaxedLoad));
   SLOW_DCHECK(descriptor ==
-              descriptors->Search(*name.object(), *holder_map.object()));
+              descriptors->Search(*name.object(), *holder_map.object(), true));
 
   auto get_accessors = [&]() {
     return broker()->CanonicalPersistentHandle(
@@ -673,23 +683,24 @@ bool AccessInfoFactory::TryLoadPropertyDetails(
 
     Handle<JSObject> holder = maybe_holder->object();
     if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-      SwissNameDictionary dict = holder->property_dictionary_swiss();
-      *index_out = dict.FindEntry(isolate(), name.object());
+      Tagged<SwissNameDictionary> dict = holder->property_dictionary_swiss();
+      *index_out = dict->FindEntry(isolate(), name.object());
       if (index_out->is_found()) {
-        *details_out = dict.DetailsAt(*index_out);
+        *details_out = dict->DetailsAt(*index_out);
       }
     } else {
-      NameDictionary dict = holder->property_dictionary();
-      *index_out = dict.FindEntry(isolate(), name.object());
+      Tagged<NameDictionary> dict = holder->property_dictionary();
+      *index_out = dict->FindEntry(isolate(), name.object());
       if (index_out->is_found()) {
-        *details_out = dict.DetailsAt(*index_out);
+        *details_out = dict->DetailsAt(*index_out);
       }
     }
   } else {
-    DescriptorArray descriptors = *map.instance_descriptors(broker()).object();
-    *index_out = descriptors.Search(*name.object(), *map.object(), true);
+    Tagged<DescriptorArray> descriptors =
+        *map.instance_descriptors(broker()).object();
+    *index_out = descriptors->Search(*name.object(), *map.object(), true);
     if (index_out->is_found()) {
-      *details_out = descriptors.GetDetails(*index_out);
+      *details_out = descriptors->GetDetails(*index_out);
     }
   }
 
@@ -705,7 +716,7 @@ PropertyAccessInfo AccessInfoFactory::ComputePropertyAccessInfo(
 
   JSHeapBroker::MapUpdaterGuardIfNeeded mumd_scope(broker());
 
-  if (access_mode == AccessMode::kHas && !map.object()->IsJSReceiverMap()) {
+  if (access_mode == AccessMode::kHas && !IsJSReceiverMap(*map.object())) {
     return Invalid();
   }
 
@@ -749,8 +760,7 @@ PropertyAccessInfo AccessInfoFactory::ComputePropertyAccessInfo(
     }
 
     if (index.is_found()) {
-      if (access_mode == AccessMode::kStore ||
-          access_mode == AccessMode::kStoreInLiteral) {
+      if (IsAnyStore(access_mode)) {
         DCHECK(!map.is_dictionary_map());
 
         // Don't bother optimizing stores to read-only properties.
@@ -823,7 +833,7 @@ PropertyAccessInfo AccessInfoFactory::ComputePropertyAccessInfo(
 
     // Don't search on the prototype chain for special indices in case of
     // integer indexed exotic objects (see ES6 section 9.4.5).
-    if (map.object()->IsJSTypedArrayMap() && name.IsString()) {
+    if (IsJSTypedArrayMap(*map.object()) && name.IsString()) {
       // TODO(jgruber,v8:12790): Extend this to other strings in read-only
       // space. When doing so, make sure there are no unexpected regressions on
       // jetstream2.
@@ -854,7 +864,7 @@ PropertyAccessInfo AccessInfoFactory::ComputePropertyAccessInfo(
 
     if (V8_DICT_PROPERTY_CONST_TRACKING_BOOL && holder.has_value()) {
       // At this point, we are past the first loop iteration.
-      DCHECK(holder->object()->map().is_prototype_map());
+      DCHECK(holder->object()->map()->is_prototype_map());
       DCHECK(!holder->map(broker()).equals(receiver_map));
 
       fast_mode_prototype_on_chain =
@@ -869,11 +879,11 @@ PropertyAccessInfo AccessInfoFactory::ComputePropertyAccessInfo(
     HeapObjectRef prototype = map.prototype(broker());
 
     MapRef map_prototype_map = prototype.map(broker());
-    if (!map_prototype_map.object()->IsJSObjectMap()) {
+    if (!IsJSObjectMap(*map_prototype_map.object())) {
       // Don't allow proxies on the prototype chain.
       if (!prototype.IsNull()) {
-        DCHECK(prototype.object()->IsJSProxy() ||
-               prototype.object()->IsWasmObject());
+        DCHECK(IsJSProxy(*prototype.object()) ||
+               IsWasmObject(*prototype.object()));
         return Invalid();
       }
 
@@ -1031,7 +1041,7 @@ base::Optional<ElementAccessInfo> AccessInfoFactory::ConsolidateElementLoad(
 PropertyAccessInfo AccessInfoFactory::LookupSpecialFieldAccessor(
     MapRef map, NameRef name) const {
   // Check for String::length field accessor.
-  if (map.object()->IsStringMap()) {
+  if (IsStringMap(*map.object())) {
     if (Name::Equals(isolate(), name.object(),
                      isolate()->factory()->length_string())) {
       return PropertyAccessInfo::StringLength(zone(), map);
@@ -1044,7 +1054,7 @@ PropertyAccessInfo AccessInfoFactory::LookupSpecialFieldAccessor(
                                          &field_index)) {
     Type field_type = Type::NonInternal();
     Representation field_representation = Representation::Tagged();
-    if (map.object()->IsJSArrayMap()) {
+    if (IsJSArrayMap(*map.object())) {
       DCHECK(Name::Equals(isolate(), isolate()->factory()->length_string(),
                           name.object()));
       // The JSArray::length property is a smi in the range
@@ -1074,7 +1084,7 @@ PropertyAccessInfo AccessInfoFactory::LookupTransition(
     MapRef map, NameRef name, OptionalJSObjectRef holder,
     PropertyAttributes attrs) const {
   // Check if the {map} has a data transition with the given {name}.
-  Map transition =
+  Tagged<Map> transition =
       TransitionsAccessor(isolate(), *map.object(), true)
           .SearchTransition(*name.object(), PropertyKind::kData, attrs);
   if (transition.is_null()) return Invalid();
@@ -1102,17 +1112,19 @@ PropertyAccessInfo AccessInfoFactory::LookupTransition(
   Type field_type = Type::NonInternal();
   OptionalMapRef field_map;
 
+  DCHECK_EQ(transition_map, transition_map.FindFieldOwner(broker(), number));
+
   ZoneVector<CompilationDependency const*> unrecorded_dependencies(zone());
   if (details_representation.IsSmi()) {
     field_type = Type::SignedSmall();
     unrecorded_dependencies.push_back(
         dependencies()->FieldRepresentationDependencyOffTheRecord(
-            transition_map, number, details_representation));
+            transition_map, transition_map, number, details_representation));
   } else if (details_representation.IsDouble()) {
     field_type = type_cache_->kFloat64;
     unrecorded_dependencies.push_back(
         dependencies()->FieldRepresentationDependencyOffTheRecord(
-            transition_map, number, details_representation));
+            transition_map, transition_map, number, details_representation));
   } else if (details_representation.IsHeapObject()) {
     // Extract the field type from the property details (make sure its
     // representation is TaggedPointer to reflect the heap object case).
@@ -1123,20 +1135,21 @@ PropertyAccessInfo AccessInfoFactory::LookupTransition(
         TryMakeRef<Object>(broker(), descriptors_field_type);
     if (!descriptors_field_type_ref.has_value()) return Invalid();
 
-    if (descriptors_field_type->IsNone()) {
+    if (IsNone(*descriptors_field_type)) {
       // Store is not safe if the field type was cleared.
       return Invalid();
     }
     unrecorded_dependencies.push_back(
         dependencies()->FieldRepresentationDependencyOffTheRecord(
-            transition_map, number, details_representation));
-    if (descriptors_field_type->IsClass()) {
+            transition_map, transition_map, number, details_representation));
+    if (IsClass(*descriptors_field_type)) {
       unrecorded_dependencies.push_back(
           dependencies()->FieldTypeDependencyOffTheRecord(
-              transition_map, number, *descriptors_field_type_ref));
+              transition_map, transition_map, number,
+              *descriptors_field_type_ref));
       // Remember the field map, and try to infer a useful type.
       OptionalMapRef maybe_field_map =
-          TryMakeRef(broker(), descriptors_field_type->AsClass());
+          TryMakeRef(broker(), (*descriptors_field_type)->AsClass());
       if (!maybe_field_map.has_value()) return Invalid();
       field_type = Type::For(maybe_field_map.value(), broker());
       field_map = maybe_field_map;
@@ -1148,7 +1161,8 @@ PropertyAccessInfo AccessInfoFactory::LookupTransition(
   // Transitioning stores *may* store to const fields. The resulting
   // DataConstant access infos can be distinguished from later, i.e. redundant,
   // stores to the same constant field by the presence of a transition map.
-  switch (dependencies()->DependOnFieldConstness(transition_map, number)) {
+  switch (dependencies()->DependOnFieldConstness(transition_map, transition_map,
+                                                 number)) {
     case PropertyConstness::kMutable:
       return PropertyAccessInfo::DataField(
           broker(), zone(), map, std::move(unrecorded_dependencies),
diff --git a/deps/v8/src/compiler/add-type-assertions-reducer.cc b/deps/v8/src/compiler/add-type-assertions-reducer.cc
index e1b005e74181bb..3bc4d29f393d03 100644
--- a/deps/v8/src/compiler/add-type-assertions-reducer.cc
+++ b/deps/v8/src/compiler/add-type-assertions-reducer.cc
@@ -5,46 +5,82 @@
 #include "src/compiler/add-type-assertions-reducer.h"
 
 #include "src/compiler/node-properties.h"
+#include "src/compiler/schedule.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
-AddTypeAssertionsReducer::AddTypeAssertionsReducer(Editor* editor,
-                                                   JSGraph* jsgraph, Zone* zone)
-    : AdvancedReducer(editor),
-      jsgraph_(jsgraph),
-      visited_(jsgraph->graph()->NodeCount(), zone) {}
-
-AddTypeAssertionsReducer::~AddTypeAssertionsReducer() = default;
-
-Reduction AddTypeAssertionsReducer::Reduce(Node* node) {
-  if (node->opcode() == IrOpcode::kAssertType ||
-      node->opcode() == IrOpcode::kAllocate ||
-      node->opcode() == IrOpcode::kObjectState ||
-      node->opcode() == IrOpcode::kObjectId ||
-      node->opcode() == IrOpcode::kPhi || !NodeProperties::IsTyped(node) ||
-      node->opcode() == IrOpcode::kUnreachable || visited_.Get(node)) {
-    return NoChange();
-  }
-  visited_.Set(node, true);
+namespace {
+struct AddTypeAssertionsImpl {
+  JSGraph* jsgraph;
+  Schedule* schedule;
+  Zone* phase_zone;
+
+  SimplifiedOperatorBuilder* simplified = jsgraph->simplified();
+  Graph* graph = jsgraph->graph();
 
-  Type type = NodeProperties::GetType(node);
-  if (!type.CanBeAsserted()) return NoChange();
+  void Run();
+  void ProcessBlock(BasicBlock* block);
+  void InsertAssertion(Node* asserted, Node* effect_successor);
+};
 
-  Node* assertion = graph()->NewNode(simplified()->AssertType(type), node);
-  NodeProperties::SetType(assertion, type);
+void AddTypeAssertionsImpl::Run() {
+  for (BasicBlock* block : *(schedule->rpo_order())) {
+    ProcessBlock(block);
+  }
+}
 
-  for (Edge edge : node->use_edges()) {
-    Node* const user = edge.from();
-    DCHECK(!user->IsDead());
-    if (NodeProperties::IsValueEdge(edge) && user != assertion) {
-      edge.UpdateTo(assertion);
-      Revisit(user);
+void AddTypeAssertionsImpl::ProcessBlock(BasicBlock* block) {
+  // To keep things simple, this only inserts type assertions for nodes that are
+  // followed by an effectful operation in the same basic block. We could build
+  // a proper new effect chain like in the EffectControlLinearizer, but right
+  // now, this doesn't quite seem worth the effort.
+  std::vector<Node*> pending;
+  bool inside_of_region = false;
+  for (Node* node : *block) {
+    if (node->opcode() == IrOpcode::kBeginRegion) {
+      inside_of_region = true;
+    } else if (inside_of_region) {
+      if (node->opcode() == IrOpcode::kFinishRegion) {
+        inside_of_region = false;
+      }
+      continue;
+    }
+    if (node->op()->EffectOutputCount() == 1 &&
+        node->op()->EffectInputCount() == 1) {
+      for (Node* pending_node : pending) {
+        InsertAssertion(pending_node, node);
+      }
+      pending.clear();
+    }
+    if (node->opcode() == IrOpcode::kAssertType ||
+        node->opcode() == IrOpcode::kAllocate ||
+        node->opcode() == IrOpcode::kObjectState ||
+        node->opcode() == IrOpcode::kObjectId ||
+        node->opcode() == IrOpcode::kPhi || !NodeProperties::IsTyped(node) ||
+        node->opcode() == IrOpcode::kUnreachable) {
+      continue;
+    }
+    Type type = NodeProperties::GetType(node);
+    if (type.CanBeAsserted()) {
+      pending.push_back(node);
     }
   }
+}
+
+void AddTypeAssertionsImpl::InsertAssertion(Node* asserted,
+                                            Node* effect_successor) {
+  Node* assertion = graph->NewNode(
+      simplified->AssertType(NodeProperties::GetType(asserted)), asserted,
+      NodeProperties::GetEffectInput(effect_successor));
+  NodeProperties::ReplaceEffectInput(effect_successor, assertion);
+}
+
+}  // namespace
 
-  return NoChange();
+void AddTypeAssertions(JSGraph* jsgraph, Schedule* schedule, Zone* phase_zone) {
+  AddTypeAssertionsImpl{jsgraph, schedule, phase_zone}.Run();
 }
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/add-type-assertions-reducer.h b/deps/v8/src/compiler/add-type-assertions-reducer.h
index ab2ee8c50fab7f..3fc8f3e76eec84 100644
--- a/deps/v8/src/compiler/add-type-assertions-reducer.h
+++ b/deps/v8/src/compiler/add-type-assertions-reducer.h
@@ -14,29 +14,9 @@ namespace v8 {
 namespace internal {
 
 namespace compiler {
+class Schedule;
 
-class V8_EXPORT_PRIVATE AddTypeAssertionsReducer final
-    : public NON_EXPORTED_BASE(AdvancedReducer) {
- public:
-  AddTypeAssertionsReducer(Editor* editor, JSGraph* jsgraph, Zone* zone);
-  ~AddTypeAssertionsReducer() final;
-
-  AddTypeAssertionsReducer(const AddTypeAssertionsReducer&) = delete;
-  AddTypeAssertionsReducer& operator=(const AddTypeAssertionsReducer&) = delete;
-
-  const char* reducer_name() const override {
-    return "AddTypeAssertionsReducer";
-  }
-
-  Reduction Reduce(Node* node) final;
-
- private:
-  JSGraph* const jsgraph_;
-  NodeAuxData<bool> visited_;
-
-  Graph* graph() { return jsgraph_->graph(); }
-  SimplifiedOperatorBuilder* simplified() { return jsgraph_->simplified(); }
-};
+void AddTypeAssertions(JSGraph* jsgraph, Schedule* schedule, Zone* phase_zone);
 
 }  // namespace compiler
 }  // namespace internal
diff --git a/deps/v8/src/compiler/allocation-builder.h b/deps/v8/src/compiler/allocation-builder.h
index cab3782c972eef..1196a63a2fbb11 100644
--- a/deps/v8/src/compiler/allocation-builder.h
+++ b/deps/v8/src/compiler/allocation-builder.h
@@ -62,7 +62,7 @@ class AllocationBuilder final {
       AllocationType allocation = AllocationType::kYoung);
 
   // Compound store of a constant into a field.
-  void Store(const FieldAccess& access, const ObjectRef& value) {
+  void Store(const FieldAccess& access, ObjectRef value) {
     Store(access, jsgraph()->Constant(value, broker_));
   }
 
diff --git a/deps/v8/src/compiler/backend/arm/code-generator-arm.cc b/deps/v8/src/compiler/backend/arm/code-generator-arm.cc
index 43c94b3e9dbf3c..4321626606919d 100644
--- a/deps/v8/src/compiler/backend/arm/code-generator-arm.cc
+++ b/deps/v8/src/compiler/backend/arm/code-generator-arm.cc
@@ -643,16 +643,7 @@ void CodeGenerator::AssembleCodeStartRegisterCheck() {
 //       the flags in the referenced {Code} object;
 //    2. test kMarkedForDeoptimizationBit in those flags; and
 //    3. if it is not zero then it jumps to the builtin.
-void CodeGenerator::BailoutIfDeoptimized() {
-  UseScratchRegisterScope temps(masm());
-  Register scratch = temps.Acquire();
-  int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
-  __ ldr(scratch, MemOperand(kJavaScriptCallCodeStartRegister, offset));
-  __ ldr(scratch, FieldMemOperand(scratch, Code::kKindSpecificFlagsOffset));
-  __ tst(scratch, Operand(1 << Code::kMarkedForDeoptimizationBit));
-  __ Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
-          RelocInfo::CODE_TARGET, ne);
-}
+void CodeGenerator::BailoutIfDeoptimized() { __ BailoutIfDeoptimized(); }
 
 // Assembles an instruction after register allocation, producing machine code.
 CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
@@ -681,7 +672,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchCallBuiltinPointer: {
       DCHECK(!instr->InputAt(0)->IsImmediate());
       Register builtin_index = i.InputRegister(0);
-      __ CallBuiltinByIndex(builtin_index);
+      Register target =
+          instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister)
+              ? kJavaScriptCallCodeStartRegister
+              : builtin_index;
+      __ CallBuiltinByIndex(builtin_index, target);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -753,9 +748,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ cmp(cp, scratch);
         __ Assert(eq, AbortReason::kWrongFunctionContext);
       }
-      static_assert(kJavaScriptCallCodeStartRegister == r2, "ABI mismatch");
-      __ ldr(r2, FieldMemOperand(func, JSFunction::kCodeOffset));
-      __ CallCodeObject(r2);
+      __ CallJSFunction(func);
       RecordCallPosition(instr);
       DCHECK_EQ(LeaveCC, i.OutputSBit());
       frame_access_state()->ClearSPDelta();
@@ -977,6 +970,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier:
+      UNREACHABLE();
     case kArchStackSlot: {
       FrameOffset offset =
           frame_access_state()->GetFrameOffset(i.InputInt32(0));
@@ -3624,31 +3619,16 @@ void CodeGenerator::AssembleArchTrap(Instruction* instr,
 
    private:
     void GenerateCallToTrap(TrapId trap_id) {
-      if (trap_id == TrapId::kInvalid) {
-        // We cannot test calls to the runtime in cctest/test-run-wasm.
-        // Therefore we emit a call to C here instead of a call to the runtime.
-        // We use the context register as the scratch register, because we do
-        // not have a context here.
-        __ PrepareCallCFunction(0, 0);
-        __ CallCFunction(
-            ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-        __ LeaveFrame(StackFrame::WASM);
-        auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-        int pop_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-        __ Drop(pop_count);
-        __ Ret();
-      } else {
-        gen_->AssembleSourcePosition(instr_);
-        // A direct call to a wasm runtime stub defined in this module.
-        // Just encode the stub index. This will be patched when the code
-        // is added to the native module and copied into wasm code space.
-        __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-        ReferenceMap* reference_map =
-            gen_->zone()->New<ReferenceMap>(gen_->zone());
-        gen_->RecordSafepoint(reference_map);
-        if (v8_flags.debug_code) {
-          __ stop();
-        }
+      gen_->AssembleSourcePosition(instr_);
+      // A direct call to a wasm runtime stub defined in this module.
+      // Just encode the stub index. This will be patched when the code
+      // is added to the native module and copied into wasm code space.
+      __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+      ReferenceMap* reference_map =
+          gen_->zone()->New<ReferenceMap>(gen_->zone());
+      gen_->RecordSafepoint(reference_map);
+      if (v8_flags.debug_code) {
+        __ stop();
       }
     }
 
@@ -4136,12 +4116,13 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 }
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
-  int new_slots = ElementSizeInPointers(rep);
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = ElementSizeInPointers(rep);
   ArmOperandConverter g(this, nullptr);
   if (dest->IsRegister()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ pop(g.ToRegister(dest));
   } else if (dest->IsStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     UseScratchRegisterScope temps(masm());
     Register scratch = temps.Acquire();
     __ pop(scratch);
@@ -4150,12 +4131,13 @@ void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ add(sp, sp, Operand(new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ add(sp, sp, Operand(dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
diff --git a/deps/v8/src/compiler/backend/arm/instruction-selector-arm.cc b/deps/v8/src/compiler/backend/arm/instruction-selector-arm.cc
index 1a19523d029e7e..f9a7e144f1d85e 100644
--- a/deps/v8/src/compiler/backend/arm/instruction-selector-arm.cc
+++ b/deps/v8/src/compiler/backend/arm/instruction-selector-arm.cc
@@ -5,20 +5,27 @@
 #include "src/base/bits.h"
 #include "src/base/enum-set.h"
 #include "src/base/iterator.h"
+#include "src/base/logging.h"
 #include "src/codegen/machine-type.h"
+#include "src/compiler/backend/instruction-selector-adapter.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
+#include "src/compiler/backend/instruction-selector.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
+#include "src/compiler/turboshaft/operations.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
 // Adds Arm-specific methods for generating InstructionOperands.
-class ArmOperandGenerator : public OperandGenerator {
+template <typename Adapter>
+class ArmOperandGeneratorT : public OperandGeneratorT<Adapter> {
  public:
-  explicit ArmOperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit ArmOperandGeneratorT(InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
 
   bool CanBeImmediate(int32_t value) const {
     return Assembler::ImmediateFitsAddrMode1Instruction(value);
@@ -79,24 +86,35 @@ class ArmOperandGenerator : public OperandGenerator {
 
 namespace {
 
-void VisitRR(InstructionSelector* selector, InstructionCode opcode,
-             Node* node) {
-  ArmOperandGenerator g(selector);
+template <typename T>
+void VisitRR(InstructionSelectorT<TurboshaftAdapter>*, InstructionCode, T) {
+  UNIMPLEMENTED();
+}
+
+void VisitRR(InstructionSelectorT<TurbofanAdapter>* selector,
+             InstructionCode opcode, Node* node) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)));
 }
 
-void VisitRRR(InstructionSelector* selector, InstructionCode opcode,
-              Node* node) {
-  ArmOperandGenerator g(selector);
+template <typename T>
+void VisitRRR(InstructionSelectorT<TurboshaftAdapter>*, InstructionCode, T) {
+  UNIMPLEMENTED();
+}
+
+void VisitRRR(InstructionSelectorT<TurbofanAdapter>* selector,
+              InstructionCode opcode, Node* node) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
 }
 
-void VisitSimdShiftRRR(InstructionSelector* selector, ArchOpcode opcode,
-                       Node* node, int width) {
-  ArmOperandGenerator g(selector);
+template <typename Adapter>
+void VisitSimdShiftRRR(InstructionSelectorT<Adapter>* selector,
+                       ArchOpcode opcode, Node* node, int width) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   Int32Matcher m(node->InputAt(1));
   if (m.HasResolvedValue()) {
     if (m.IsMultipleOf(width)) {
@@ -112,9 +130,10 @@ void VisitSimdShiftRRR(InstructionSelector* selector, ArchOpcode opcode,
 }
 
 #if V8_ENABLE_WEBASSEMBLY
-void VisitRRRShuffle(InstructionSelector* selector, ArchOpcode opcode,
+template <typename Adapter>
+void VisitRRRShuffle(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
                      Node* node) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   // Swap inputs to save an instruction in the CodeGenerator for High ops.
   if (opcode == kArmS32x4ZipRight || opcode == kArmS32x4UnzipRight ||
       opcode == kArmS32x4TransposeRight || opcode == kArmS16x8ZipRight ||
@@ -134,28 +153,32 @@ void VisitRRRShuffle(InstructionSelector* selector, ArchOpcode opcode,
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void VisitRRI(InstructionSelector* selector, ArchOpcode opcode, Node* node) {
-  ArmOperandGenerator g(selector);
+template <typename Adapter>
+void VisitRRI(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+              Node* node) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm));
 }
 
-void VisitRRIR(InstructionSelector* selector, ArchOpcode opcode, Node* node) {
-  ArmOperandGenerator g(selector);
+template <typename Adapter>
+void VisitRRIR(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+               Node* node) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm),
                  g.UseUniqueRegister(node->InputAt(1)));
 }
 
-template <IrOpcode::Value kOpcode, int kImmMin, int kImmMax,
+template <typename Adapter, IrOpcode::Value kOpcode, int kImmMin, int kImmMax,
           AddressingMode kImmMode, AddressingMode kRegMode>
-bool TryMatchShift(InstructionSelector* selector,
+bool TryMatchShift(InstructionSelectorT<Adapter>* selector,
                    InstructionCode* opcode_return, Node* node,
                    InstructionOperand* value_return,
                    InstructionOperand* shift_return) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   if (node->opcode() == kOpcode) {
     Int32BinopMatcher m(node);
     *value_return = g.UseRegister(m.left().node());
@@ -171,13 +194,13 @@ bool TryMatchShift(InstructionSelector* selector,
   return false;
 }
 
-template <IrOpcode::Value kOpcode, int kImmMin, int kImmMax,
+template <typename Adapter, IrOpcode::Value kOpcode, int kImmMin, int kImmMax,
           AddressingMode kImmMode>
-bool TryMatchShiftImmediate(InstructionSelector* selector,
+bool TryMatchShiftImmediate(InstructionSelectorT<Adapter>* selector,
                             InstructionCode* opcode_return, Node* node,
                             InstructionOperand* value_return,
                             InstructionOperand* shift_return) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   if (node->opcode() == kOpcode) {
     Int32BinopMatcher m(node);
     if (m.right().IsInRange(kImmMin, kImmMax)) {
@@ -190,48 +213,58 @@ bool TryMatchShiftImmediate(InstructionSelector* selector,
   return false;
 }
 
-bool TryMatchROR(InstructionSelector* selector, InstructionCode* opcode_return,
-                 Node* node, InstructionOperand* value_return,
+template <typename Adapter>
+bool TryMatchROR(InstructionSelectorT<Adapter>* selector,
+                 InstructionCode* opcode_return, Node* node,
+                 InstructionOperand* value_return,
                  InstructionOperand* shift_return) {
-  return TryMatchShift<IrOpcode::kWord32Ror, 1, 31, kMode_Operand2_R_ROR_I,
-                       kMode_Operand2_R_ROR_R>(selector, opcode_return, node,
-                                               value_return, shift_return);
+  return TryMatchShift<Adapter, IrOpcode::kWord32Ror, 1, 31,
+                       kMode_Operand2_R_ROR_I, kMode_Operand2_R_ROR_R>(
+      selector, opcode_return, node, value_return, shift_return);
 }
 
-bool TryMatchASR(InstructionSelector* selector, InstructionCode* opcode_return,
-                 Node* node, InstructionOperand* value_return,
+template <typename Adapter>
+bool TryMatchASR(InstructionSelectorT<Adapter>* selector,
+                 InstructionCode* opcode_return, Node* node,
+                 InstructionOperand* value_return,
                  InstructionOperand* shift_return) {
-  return TryMatchShift<IrOpcode::kWord32Sar, 1, 32, kMode_Operand2_R_ASR_I,
-                       kMode_Operand2_R_ASR_R>(selector, opcode_return, node,
-                                               value_return, shift_return);
+  return TryMatchShift<Adapter, IrOpcode::kWord32Sar, 1, 32,
+                       kMode_Operand2_R_ASR_I, kMode_Operand2_R_ASR_R>(
+      selector, opcode_return, node, value_return, shift_return);
 }
 
-bool TryMatchLSL(InstructionSelector* selector, InstructionCode* opcode_return,
-                 Node* node, InstructionOperand* value_return,
+template <typename Adapter>
+bool TryMatchLSL(InstructionSelectorT<Adapter>* selector,
+                 InstructionCode* opcode_return, Node* node,
+                 InstructionOperand* value_return,
                  InstructionOperand* shift_return) {
-  return TryMatchShift<IrOpcode::kWord32Shl, 0, 31, kMode_Operand2_R_LSL_I,
-                       kMode_Operand2_R_LSL_R>(selector, opcode_return, node,
-                                               value_return, shift_return);
+  return TryMatchShift<Adapter, IrOpcode::kWord32Shl, 0, 31,
+                       kMode_Operand2_R_LSL_I, kMode_Operand2_R_LSL_R>(
+      selector, opcode_return, node, value_return, shift_return);
 }
 
-bool TryMatchLSLImmediate(InstructionSelector* selector,
+template <typename Adapter>
+bool TryMatchLSLImmediate(InstructionSelectorT<Adapter>* selector,
                           InstructionCode* opcode_return, Node* node,
                           InstructionOperand* value_return,
                           InstructionOperand* shift_return) {
-  return TryMatchShiftImmediate<IrOpcode::kWord32Shl, 0, 31,
+  return TryMatchShiftImmediate<Adapter, IrOpcode::kWord32Shl, 0, 31,
                                 kMode_Operand2_R_LSL_I>(
       selector, opcode_return, node, value_return, shift_return);
 }
 
-bool TryMatchLSR(InstructionSelector* selector, InstructionCode* opcode_return,
-                 Node* node, InstructionOperand* value_return,
+template <typename Adapter>
+bool TryMatchLSR(InstructionSelectorT<Adapter>* selector,
+                 InstructionCode* opcode_return, Node* node,
+                 InstructionOperand* value_return,
                  InstructionOperand* shift_return) {
-  return TryMatchShift<IrOpcode::kWord32Shr, 1, 32, kMode_Operand2_R_LSR_I,
-                       kMode_Operand2_R_LSR_R>(selector, opcode_return, node,
-                                               value_return, shift_return);
+  return TryMatchShift<Adapter, IrOpcode::kWord32Shr, 1, 32,
+                       kMode_Operand2_R_LSR_I, kMode_Operand2_R_LSR_R>(
+      selector, opcode_return, node, value_return, shift_return);
 }
 
-bool TryMatchShift(InstructionSelector* selector,
+template <typename Adapter>
+bool TryMatchShift(InstructionSelectorT<Adapter>* selector,
                    InstructionCode* opcode_return, Node* node,
                    InstructionOperand* value_return,
                    InstructionOperand* shift_return) {
@@ -242,11 +275,12 @@ bool TryMatchShift(InstructionSelector* selector,
       TryMatchROR(selector, opcode_return, node, value_return, shift_return));
 }
 
-bool TryMatchImmediateOrShift(InstructionSelector* selector,
+template <typename Adapter>
+bool TryMatchImmediateOrShift(InstructionSelectorT<Adapter>* selector,
                               InstructionCode* opcode_return, Node* node,
                               size_t* input_count_return,
                               InstructionOperand* inputs) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   if (g.CanBeImmediate(node, *opcode_return)) {
     *opcode_return |= AddressingModeField::encode(kMode_Operand2_I);
     inputs[0] = g.UseImmediate(node);
@@ -260,10 +294,11 @@ bool TryMatchImmediateOrShift(InstructionSelector* selector,
   return false;
 }
 
-void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                 InstructionCode opcode, InstructionCode reverse_opcode,
-                FlagsContinuation* cont) {
-  ArmOperandGenerator g(selector);
+                FlagsContinuationT<Adapter>* cont) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   InstructionOperand inputs[3];
   size_t input_count = 0;
@@ -310,17 +345,24 @@ void VisitBinop(InstructionSelector* selector, Node* node,
                                  inputs, cont);
 }
 
-void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename T>
+void VisitBinop(InstructionSelectorT<TurboshaftAdapter>*, T, InstructionCode,
+                InstructionCode) {
+  UNIMPLEMENTED();
+}
+
+void VisitBinop(InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
                 InstructionCode opcode, InstructionCode reverse_opcode) {
-  FlagsContinuation cont;
+  FlagsContinuationT<TurbofanAdapter> cont;
   VisitBinop(selector, node, opcode, reverse_opcode, &cont);
 }
 
-void EmitDiv(InstructionSelector* selector, ArchOpcode div_opcode,
+template <typename Adapter>
+void EmitDiv(InstructionSelectorT<Adapter>* selector, ArchOpcode div_opcode,
              ArchOpcode f64i32_opcode, ArchOpcode i32f64_opcode,
              InstructionOperand result_operand, InstructionOperand left_operand,
              InstructionOperand right_operand) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   if (selector->IsSupported(SUDIV)) {
     selector->Emit(div_opcode, result_operand, left_operand, right_operand);
     return;
@@ -335,33 +377,45 @@ void EmitDiv(InstructionSelector* selector, ArchOpcode div_opcode,
   selector->Emit(i32f64_opcode, result_operand, result_double_operand);
 }
 
-void VisitDiv(InstructionSelector* selector, Node* node, ArchOpcode div_opcode,
+template <typename Adapter>
+void VisitDiv(InstructionSelectorT<Adapter>* selector,
+              typename Adapter::node_t node, ArchOpcode div_opcode,
               ArchOpcode f64i32_opcode, ArchOpcode i32f64_opcode) {
-  ArmOperandGenerator g(selector);
-  Int32BinopMatcher m(node);
-  EmitDiv(selector, div_opcode, f64i32_opcode, i32f64_opcode,
-          g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-          g.UseRegister(m.right().node()));
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(selector);
+    Int32BinopMatcher m(node);
+    EmitDiv(selector, div_opcode, f64i32_opcode, i32f64_opcode,
+            g.DefineAsRegister(node), g.UseRegister(m.left().node()),
+            g.UseRegister(m.right().node()));
+  }
 }
 
-void VisitMod(InstructionSelector* selector, Node* node, ArchOpcode div_opcode,
+template <typename Adapter>
+void VisitMod(InstructionSelectorT<Adapter>* selector,
+              typename Adapter::node_t node, ArchOpcode div_opcode,
               ArchOpcode f64i32_opcode, ArchOpcode i32f64_opcode) {
-  ArmOperandGenerator g(selector);
-  Int32BinopMatcher m(node);
-  InstructionOperand div_operand = g.TempRegister();
-  InstructionOperand result_operand = g.DefineAsRegister(node);
-  InstructionOperand left_operand = g.UseRegister(m.left().node());
-  InstructionOperand right_operand = g.UseRegister(m.right().node());
-  EmitDiv(selector, div_opcode, f64i32_opcode, i32f64_opcode, div_operand,
-          left_operand, right_operand);
-  if (selector->IsSupported(ARMv7)) {
-    selector->Emit(kArmMls, result_operand, div_operand, right_operand,
-                   left_operand);
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    InstructionOperand mul_operand = g.TempRegister();
-    selector->Emit(kArmMul, mul_operand, div_operand, right_operand);
-    selector->Emit(kArmSub | AddressingModeField::encode(kMode_Operand2_R),
-                   result_operand, left_operand, mul_operand);
+    ArmOperandGeneratorT<Adapter> g(selector);
+    Int32BinopMatcher m(node);
+    InstructionOperand div_operand = g.TempRegister();
+    InstructionOperand result_operand = g.DefineAsRegister(node);
+    InstructionOperand left_operand = g.UseRegister(m.left().node());
+    InstructionOperand right_operand = g.UseRegister(m.right().node());
+    EmitDiv(selector, div_opcode, f64i32_opcode, i32f64_opcode, div_operand,
+            left_operand, right_operand);
+    if (selector->IsSupported(ARMv7)) {
+      selector->Emit(kArmMls, result_operand, div_operand, right_operand,
+                     left_operand);
+    } else {
+      InstructionOperand mul_operand = g.TempRegister();
+      selector->Emit(kArmMul, mul_operand, div_operand, right_operand);
+      selector->Emit(kArmSub | AddressingModeField::encode(kMode_Operand2_R),
+                     result_operand, left_operand, mul_operand);
+    }
   }
 }
 
@@ -370,11 +424,12 @@ void VisitMod(InstructionSelector* selector, Node* node, ArchOpcode div_opcode,
 // vld1 and vst1, when given two registers, will post-increment the offset, i.e.
 // perform the operation at base, then add offset to base. What we intend is to
 // access at (base+offset).
-void EmitAddBeforeS128LoadStore(InstructionSelector* selector,
+template <typename Adapter>
+void EmitAddBeforeS128LoadStore(InstructionSelectorT<Adapter>* selector,
                                 InstructionCode* opcode_return,
                                 size_t* input_count_return,
                                 InstructionOperand* inputs) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   InstructionOperand addr = g.TempRegister();
   InstructionCode op = kArmAdd;
   op |= AddressingModeField::encode(kMode_Operand2_R);
@@ -384,9 +439,16 @@ void EmitAddBeforeS128LoadStore(InstructionSelector* selector,
   inputs[0] = addr;
 }
 
-void EmitLoad(InstructionSelector* selector, InstructionCode opcode,
-              InstructionOperand* output, Node* base, Node* index) {
-  ArmOperandGenerator g(selector);
+void EmitLoad(InstructionSelectorT<TurboshaftAdapter>* selector,
+              InstructionCode opcode, InstructionOperand* output,
+              turboshaft::OpIndex base, turboshaft::OpIndex index) {
+  UNIMPLEMENTED();
+}
+
+void EmitLoad(InstructionSelectorT<TurbofanAdapter>* selector,
+              InstructionCode opcode, InstructionOperand* output, Node* base,
+              Node* index) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(selector);
   InstructionOperand inputs[3];
   size_t input_count = 2;
 
@@ -435,9 +497,10 @@ void EmitLoad(InstructionSelector* selector, InstructionCode opcode,
   selector->Emit(opcode, 1, output, input_count, inputs);
 }
 
-void EmitStore(InstructionSelector* selector, InstructionCode opcode,
+template <typename Adapter>
+void EmitStore(InstructionSelectorT<Adapter>* selector, InstructionCode opcode,
                size_t input_count, InstructionOperand* inputs, Node* index) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   ArchOpcode arch_opcode = ArchOpcodeField::decode(opcode);
 
   if (g.CanBeImmediate(index, opcode)) {
@@ -459,9 +522,10 @@ void EmitStore(InstructionSelector* selector, InstructionCode opcode,
   selector->Emit(opcode, 0, nullptr, input_count, inputs);
 }
 
-void VisitPairAtomicBinOp(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitPairAtomicBinOp(InstructionSelectorT<Adapter>* selector, Node* node,
                           ArchOpcode opcode) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -497,28 +561,40 @@ void VisitPairAtomicBinOp(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
-  int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
-  OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+    int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
+    OperandGenerator g(this);
 
-  Emit(kArchStackSlot, g.DefineAsRegister(node),
-       sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+    Emit(kArchStackSlot, g.DefineAsRegister(node),
+         sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+  }
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  ArmOperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), r1));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    // This is currently not used by Turboshaft.
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), r1));
+  }
 }
 
-void InstructionSelector::VisitStoreLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
   StoreLaneParameters params = StoreLaneParametersOf(node->op());
   LoadStoreLaneParams f(params.rep, params.laneidx);
   InstructionCode opcode =
       f.low_op ? kArmS128StoreLaneLow : kArmS128StoreLaneHigh;
   opcode |= MiscField::encode(f.sz);
 
-  ArmOperandGenerator g(this);
+  ArmOperandGeneratorT<Adapter> g(this);
   InstructionOperand inputs[4];
   size_t input_count = 4;
   inputs[0] = g.UseRegister(node->InputAt(2));
@@ -529,14 +605,15 @@ void InstructionSelector::VisitStoreLane(Node* node) {
   Emit(opcode, 0, nullptr, input_count, inputs);
 }
 
-void InstructionSelector::VisitLoadLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
   LoadLaneParameters params = LoadLaneParametersOf(node->op());
   LoadStoreLaneParams f(params.rep.representation(), params.laneidx);
   InstructionCode opcode =
       f.low_op ? kArmS128LoadLaneLow : kArmS128LoadLaneHigh;
   opcode |= MiscField::encode(f.sz);
 
-  ArmOperandGenerator g(this);
+  ArmOperandGeneratorT<Adapter> g(this);
   InstructionOperand output = g.DefineSameAsFirst(node);
   InstructionOperand inputs[4];
   size_t input_count = 4;
@@ -548,7 +625,8 @@ void InstructionSelector::VisitLoadLane(Node* node) {
   Emit(opcode, 1, &output, input_count, inputs);
 }
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
   InstructionCode opcode = kArchNop;
   switch (params.transformation) {
@@ -592,7 +670,7 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
       UNIMPLEMENTED();
   }
 
-  ArmOperandGenerator g(this);
+  ArmOperandGeneratorT<Adapter> g(this);
   InstructionOperand output = g.DefineAsRegister(node);
   InstructionOperand inputs[2];
   size_t input_count = 2;
@@ -602,11 +680,13 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   Emit(opcode, 1, &output, input_count, inputs);
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
-  ArmOperandGenerator g(this);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  typename Adapter::LoadView load = this->load_view(node);
+  LoadRepresentation load_rep = load.loaded_rep();
+  ArmOperandGeneratorT<Adapter> g(this);
+  node_t base = load.base();
+  node_t index = load.index();
 
   InstructionCode opcode = kArchNop;
   switch (load_rep.representation()) {
@@ -635,6 +715,7 @@ void InstructionSelector::VisitLoad(Node* node) {
     case MachineRepresentation::kSimd256:            // Fall through.
     case MachineRepresentation::kCompressedPointer:  // Fall through.
     case MachineRepresentation::kCompressed:         // Fall through.
+    case MachineRepresentation::kIndirectPointer:    // Fall through.
     case MachineRepresentation::kSandboxedPointer:   // Fall through.
     case MachineRepresentation::kWord64:             // Fall through.
     case MachineRepresentation::kMapWord:            // Fall through.
@@ -646,7 +727,8 @@ void InstructionSelector::VisitLoad(Node* node) {
   EmitLoad(this, opcode, &output, base, index);
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
@@ -674,6 +756,7 @@ ArchOpcode GetStoreOpcode(MachineRepresentation rep) {
     case MachineRepresentation::kSimd256:            // Fall through.
     case MachineRepresentation::kCompressedPointer:  // Fall through.
     case MachineRepresentation::kCompressed:         // Fall through.
+    case MachineRepresentation::kIndirectPointer:    // Fall through.
     case MachineRepresentation::kSandboxedPointer:   // Fall through.
     case MachineRepresentation::kWord64:             // Fall through.
     case MachineRepresentation::kMapWord:            // Fall through.
@@ -698,10 +781,11 @@ ArchOpcode GetAtomicStoreOpcode(MachineRepresentation rep) {
   }
 }
 
-void VisitStoreCommon(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitStoreCommon(InstructionSelectorT<Adapter>* selector, Node* node,
                       StoreRepresentation store_rep,
                       base::Optional<AtomicMemoryOrder> atomic_order) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -794,83 +878,105 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStore(Node* node) {
-  VisitStoreCommon(this, node, StoreRepresentationOf(node->op()),
-                   base::nullopt);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitStoreCommon(this, node, StoreRepresentationOf(node->op()),
+                     base::nullopt);
+  }
 }
 
-void InstructionSelector::VisitProtectedStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitUnalignedLoad(Node* node) {
-  MachineRepresentation load_rep =
-      LoadRepresentationOf(node->op()).representation();
-  ArmOperandGenerator g(this);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
-
-  InstructionCode opcode = kArmLdr;
-  // Only floating point loads need to be specially handled; integer loads
-  // support unaligned access. We support unaligned FP loads by loading to
-  // integer registers first, then moving to the destination FP register. If
-  // NEON is supported, we use the vld1.8 instruction.
-  switch (load_rep) {
-    case MachineRepresentation::kFloat32: {
-      InstructionOperand temp = g.TempRegister();
-      EmitLoad(this, opcode, &temp, base, index);
-      Emit(kArmVmovF32U32, g.DefineAsRegister(node), temp);
-      return;
-    }
-    case MachineRepresentation::kFloat64: {
-      // Compute the address of the least-significant byte of the FP value.
-      // We assume that the base node is unlikely to be an encodable immediate
-      // or the result of a shift operation, so only consider the addressing
-      // mode that should be used for the index node.
-      InstructionCode add_opcode = kArmAdd;
-      InstructionOperand inputs[3];
-      inputs[0] = g.UseRegister(base);
-
-      size_t input_count;
-      if (TryMatchImmediateOrShift(this, &add_opcode, index, &input_count,
-                                   &inputs[1])) {
-        // input_count has been set by TryMatchImmediateOrShift(), so
-        // increment it to account for the base register in inputs[0].
-        input_count++;
-      } else {
-        add_opcode |= AddressingModeField::encode(kMode_Operand2_R);
-        inputs[1] = g.UseRegister(index);
-        input_count = 2;  // Base register and index.
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    MachineRepresentation load_rep =
+        LoadRepresentationOf(node->op()).representation();
+    ArmOperandGeneratorT<Adapter> g(this);
+    Node* base = node->InputAt(0);
+    Node* index = node->InputAt(1);
+
+    InstructionCode opcode = kArmLdr;
+    // Only floating point loads need to be specially handled; integer loads
+    // support unaligned access. We support unaligned FP loads by loading to
+    // integer registers first, then moving to the destination FP register. If
+    // NEON is supported, we use the vld1.8 instruction.
+    switch (load_rep) {
+      case MachineRepresentation::kFloat32: {
+        InstructionOperand temp = g.TempRegister();
+        EmitLoad(this, opcode, &temp, base, index);
+        Emit(kArmVmovF32U32, g.DefineAsRegister(node), temp);
+        return;
       }
+      case MachineRepresentation::kFloat64: {
+        // Compute the address of the least-significant byte of the FP value.
+        // We assume that the base node is unlikely to be an encodable immediate
+        // or the result of a shift operation, so only consider the addressing
+        // mode that should be used for the index node.
+        InstructionCode add_opcode = kArmAdd;
+        InstructionOperand inputs[3];
+        inputs[0] = g.UseRegister(base);
+
+        size_t input_count;
+        if (TryMatchImmediateOrShift(this, &add_opcode, index, &input_count,
+                                     &inputs[1])) {
+          // input_count has been set by TryMatchImmediateOrShift(), so
+          // increment it to account for the base register in inputs[0].
+          input_count++;
+        } else {
+          add_opcode |= AddressingModeField::encode(kMode_Operand2_R);
+          inputs[1] = g.UseRegister(index);
+          input_count = 2;  // Base register and index.
+        }
 
-      InstructionOperand addr = g.TempRegister();
-      Emit(add_opcode, 1, &addr, input_count, inputs);
-
-      if (CpuFeatures::IsSupported(NEON)) {
-        // With NEON we can load directly from the calculated address.
-        InstructionCode op = kArmVld1F64;
-        op |= AddressingModeField::encode(kMode_Operand2_R);
-        Emit(op, g.DefineAsRegister(node), addr);
-      } else {
-        // Load both halves and move to an FP register.
-        InstructionOperand fp_lo = g.TempRegister();
-        InstructionOperand fp_hi = g.TempRegister();
-        opcode |= AddressingModeField::encode(kMode_Offset_RI);
-        Emit(opcode, fp_lo, addr, g.TempImmediate(0));
-        Emit(opcode, fp_hi, addr, g.TempImmediate(4));
-        Emit(kArmVmovF64U32U32, g.DefineAsRegister(node), fp_lo, fp_hi);
+        InstructionOperand addr = g.TempRegister();
+        Emit(add_opcode, 1, &addr, input_count, inputs);
+
+        if (CpuFeatures::IsSupported(NEON)) {
+          // With NEON we can load directly from the calculated address.
+          InstructionCode op = kArmVld1F64;
+          op |= AddressingModeField::encode(kMode_Operand2_R);
+          Emit(op, g.DefineAsRegister(node), addr);
+        } else {
+          // Load both halves and move to an FP register.
+          InstructionOperand fp_lo = g.TempRegister();
+          InstructionOperand fp_hi = g.TempRegister();
+          opcode |= AddressingModeField::encode(kMode_Offset_RI);
+          Emit(opcode, fp_lo, addr, g.TempImmediate(0));
+          Emit(opcode, fp_hi, addr, g.TempImmediate(4));
+          Emit(kArmVmovF64U32U32, g.DefineAsRegister(node), fp_lo, fp_hi);
+        }
+        return;
       }
-      return;
+      default:
+        // All other cases should support unaligned accesses.
+        UNREACHABLE();
     }
-    default:
-      // All other cases should support unaligned accesses.
-      UNREACHABLE();
   }
 }
 
-void InstructionSelector::VisitUnalignedStore(Node* node) {
-  ArmOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitUnalignedStore(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitUnalignedStore(Node* node) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -957,9 +1063,10 @@ void InstructionSelector::VisitUnalignedStore(Node* node) {
 
 namespace {
 
-void EmitBic(InstructionSelector* selector, Node* node, Node* left,
+template <typename Adapter>
+void EmitBic(InstructionSelectorT<Adapter>* selector, Node* node, Node* left,
              Node* right) {
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   InstructionCode opcode = kArmBic;
   InstructionOperand value_operand;
   InstructionOperand shift_operand;
@@ -973,145 +1080,171 @@ void EmitBic(InstructionSelector* selector, Node* node, Node* left,
                  g.UseRegister(right));
 }
 
-void EmitUbfx(InstructionSelector* selector, Node* node, Node* left,
+template <typename Adapter>
+void EmitUbfx(InstructionSelectorT<Adapter>* selector, Node* node, Node* left,
               uint32_t lsb, uint32_t width) {
   DCHECK_LE(lsb, 31u);
   DCHECK_LE(1u, width);
   DCHECK_LE(width, 32u - lsb);
-  ArmOperandGenerator g(selector);
+  ArmOperandGeneratorT<Adapter> g(selector);
   selector->Emit(kArmUbfx, g.DefineAsRegister(node), g.UseRegister(left),
                  g.TempImmediate(lsb), g.TempImmediate(width));
 }
 
 }  // namespace
 
-void InstructionSelector::VisitWord32And(Node* node) {
-  ArmOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.left().IsWord32Xor() && CanCover(node, m.left().node())) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (mleft.right().Is(-1)) {
-      EmitBic(this, node, m.right().node(), mleft.left().node());
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32And(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.left().IsWord32Xor() && CanCover(node, m.left().node())) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (mleft.right().Is(-1)) {
+        EmitBic(this, node, m.right().node(), mleft.left().node());
+        return;
+      }
     }
-  }
-  if (m.right().IsWord32Xor() && CanCover(node, m.right().node())) {
-    Int32BinopMatcher mright(m.right().node());
-    if (mright.right().Is(-1)) {
-      EmitBic(this, node, m.left().node(), mright.left().node());
-      return;
+    if (m.right().IsWord32Xor() && CanCover(node, m.right().node())) {
+      Int32BinopMatcher mright(m.right().node());
+      if (mright.right().Is(-1)) {
+        EmitBic(this, node, m.left().node(), mright.left().node());
+        return;
+      }
     }
-  }
-  if (m.right().HasResolvedValue()) {
-    uint32_t const value = m.right().ResolvedValue();
-    uint32_t width = base::bits::CountPopulation(value);
-    uint32_t leading_zeros = base::bits::CountLeadingZeros32(value);
-
-    // Try to merge SHR operations on the left hand input into this AND.
-    if (m.left().IsWord32Shr()) {
-      Int32BinopMatcher mshr(m.left().node());
-      if (mshr.right().HasResolvedValue()) {
-        uint32_t const shift = mshr.right().ResolvedValue();
-
-        if (((shift == 8) || (shift == 16) || (shift == 24)) &&
-            (value == 0xFF)) {
-          // Merge SHR into AND by emitting a UXTB instruction with a
-          // bytewise rotation.
-          Emit(kArmUxtb, g.DefineAsRegister(m.node()),
-               g.UseRegister(mshr.left().node()),
-               g.TempImmediate(mshr.right().ResolvedValue()));
-          return;
-        } else if (((shift == 8) || (shift == 16)) && (value == 0xFFFF)) {
-          // Merge SHR into AND by emitting a UXTH instruction with a
-          // bytewise rotation.
-          Emit(kArmUxth, g.DefineAsRegister(m.node()),
-               g.UseRegister(mshr.left().node()),
-               g.TempImmediate(mshr.right().ResolvedValue()));
-          return;
-        } else if (IsSupported(ARMv7) && (width != 0) &&
-                   ((leading_zeros + width) == 32)) {
-          // Merge Shr into And by emitting a UBFX instruction.
-          DCHECK_EQ(0u, base::bits::CountTrailingZeros32(value));
-          if ((1 <= shift) && (shift <= 31)) {
-            // UBFX cannot extract bits past the register size, however since
-            // shifting the original value would have introduced some zeros we
-            // can still use UBFX with a smaller mask and the remaining bits
-            // will be zeros.
-            EmitUbfx(this, node, mshr.left().node(), shift,
-                     std::min(width, 32 - shift));
+    if (m.right().HasResolvedValue()) {
+      uint32_t const value = m.right().ResolvedValue();
+      uint32_t width = base::bits::CountPopulation(value);
+      uint32_t leading_zeros = base::bits::CountLeadingZeros32(value);
+
+      // Try to merge SHR operations on the left hand input into this AND.
+      if (m.left().IsWord32Shr()) {
+        Int32BinopMatcher mshr(m.left().node());
+        if (mshr.right().HasResolvedValue()) {
+          uint32_t const shift = mshr.right().ResolvedValue();
+
+          if (((shift == 8) || (shift == 16) || (shift == 24)) &&
+              (value == 0xFF)) {
+            // Merge SHR into AND by emitting a UXTB instruction with a
+            // bytewise rotation.
+            Emit(kArmUxtb, g.DefineAsRegister(m.node()),
+                 g.UseRegister(mshr.left().node()),
+                 g.TempImmediate(mshr.right().ResolvedValue()));
+            return;
+          } else if (((shift == 8) || (shift == 16)) && (value == 0xFFFF)) {
+            // Merge SHR into AND by emitting a UXTH instruction with a
+            // bytewise rotation.
+            Emit(kArmUxth, g.DefineAsRegister(m.node()),
+                 g.UseRegister(mshr.left().node()),
+                 g.TempImmediate(mshr.right().ResolvedValue()));
             return;
+          } else if (IsSupported(ARMv7) && (width != 0) &&
+                     ((leading_zeros + width) == 32)) {
+            // Merge Shr into And by emitting a UBFX instruction.
+            DCHECK_EQ(0u, base::bits::CountTrailingZeros32(value));
+            if ((1 <= shift) && (shift <= 31)) {
+              // UBFX cannot extract bits past the register size, however since
+              // shifting the original value would have introduced some zeros we
+              // can still use UBFX with a smaller mask and the remaining bits
+              // will be zeros.
+              EmitUbfx(this, node, mshr.left().node(), shift,
+                       std::min(width, 32 - shift));
+              return;
+            }
           }
         }
+      } else if (value == 0xFFFF) {
+        // Emit UXTH for this AND. We don't bother testing for UXTB, as it's no
+        // better than AND 0xFF for this operation.
+        Emit(kArmUxth, g.DefineAsRegister(m.node()),
+             g.UseRegister(m.left().node()), g.TempImmediate(0));
+        return;
       }
-    } else if (value == 0xFFFF) {
-      // Emit UXTH for this AND. We don't bother testing for UXTB, as it's no
-      // better than AND 0xFF for this operation.
-      Emit(kArmUxth, g.DefineAsRegister(m.node()),
-           g.UseRegister(m.left().node()), g.TempImmediate(0));
-      return;
-    }
-    if (g.CanBeImmediate(~value)) {
-      // Emit BIC for this AND by inverting the immediate value first.
-      Emit(kArmBic | AddressingModeField::encode(kMode_Operand2_I),
-           g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-           g.TempImmediate(~value));
-      return;
-    }
-    if (!g.CanBeImmediate(value) && IsSupported(ARMv7)) {
-      // If value has 9 to 23 contiguous set bits, and has the lsb set, we can
-      // replace this AND with UBFX. Other contiguous bit patterns have already
-      // been handled by BIC or will be handled by AND.
-      if ((width != 0) && ((leading_zeros + width) == 32) &&
-          (9 <= leading_zeros) && (leading_zeros <= 23)) {
-        DCHECK_EQ(0u, base::bits::CountTrailingZeros32(value));
-        EmitUbfx(this, node, m.left().node(), 0, width);
+      if (g.CanBeImmediate(~value)) {
+        // Emit BIC for this AND by inverting the immediate value first.
+        Emit(kArmBic | AddressingModeField::encode(kMode_Operand2_I),
+             g.DefineAsRegister(node), g.UseRegister(m.left().node()),
+             g.TempImmediate(~value));
         return;
       }
+      if (!g.CanBeImmediate(value) && IsSupported(ARMv7)) {
+        // If value has 9 to 23 contiguous set bits, and has the lsb set, we can
+        // replace this AND with UBFX. Other contiguous bit patterns have
+        // already been handled by BIC or will be handled by AND.
+        if ((width != 0) && ((leading_zeros + width) == 32) &&
+            (9 <= leading_zeros) && (leading_zeros <= 23)) {
+          DCHECK_EQ(0u, base::bits::CountTrailingZeros32(value));
+          EmitUbfx(this, node, m.left().node(), 0, width);
+          return;
+        }
 
-      width = 32 - width;
-      leading_zeros = base::bits::CountLeadingZeros32(~value);
-      uint32_t lsb = base::bits::CountTrailingZeros32(~value);
-      if ((leading_zeros + width + lsb) == 32) {
-        // This AND can be replaced with BFC.
-        Emit(kArmBfc, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-             g.TempImmediate(lsb), g.TempImmediate(width));
-        return;
+        width = 32 - width;
+        leading_zeros = base::bits::CountLeadingZeros32(~value);
+        uint32_t lsb = base::bits::CountTrailingZeros32(~value);
+        if ((leading_zeros + width + lsb) == 32) {
+          // This AND can be replaced with BFC.
+          Emit(kArmBfc, g.DefineSameAsFirst(node),
+               g.UseRegister(m.left().node()), g.TempImmediate(lsb),
+               g.TempImmediate(width));
+          return;
+        }
       }
     }
+    VisitBinop(this, node, kArmAnd, kArmAnd);
   }
-  VisitBinop(this, node, kArmAnd, kArmAnd);
 }
 
-void InstructionSelector::VisitWord32Or(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
   VisitBinop(this, node, kArmOrr, kArmOrr);
 }
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  ArmOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(-1)) {
-    InstructionCode opcode = kArmMvn;
-    InstructionOperand value_operand;
-    InstructionOperand shift_operand;
-    if (TryMatchShift(this, &opcode, m.left().node(), &value_operand,
-                      &shift_operand)) {
-      Emit(opcode, g.DefineAsRegister(node), value_operand, shift_operand);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.right().Is(-1)) {
+      InstructionCode opcode = kArmMvn;
+      InstructionOperand value_operand;
+      InstructionOperand shift_operand;
+      if (TryMatchShift(this, &opcode, m.left().node(), &value_operand,
+                        &shift_operand)) {
+        Emit(opcode, g.DefineAsRegister(node), value_operand, shift_operand);
+        return;
+      }
+      Emit(opcode | AddressingModeField::encode(kMode_Operand2_R),
+           g.DefineAsRegister(node), g.UseRegister(m.left().node()));
       return;
     }
-    Emit(opcode | AddressingModeField::encode(kMode_Operand2_R),
-         g.DefineAsRegister(node), g.UseRegister(m.left().node()));
-    return;
+    VisitBinop(this, node, kArmEor, kArmEor);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuation* cont) {
+  StackCheckKind kind;
+  node_t value;
+  if constexpr (Adapter::IsTurboshaft) {
+    const auto& op =
+        this->turboshaft_graph()
+            ->Get(node)
+            .template Cast<turboshaft::StackPointerGreaterThanOp>();
+    kind = op.kind;
+    value = op.stack_limit();
+  } else {
+    kind = StackCheckKindOf(node->op());
+    value = node->InputAt(0);
   }
-  VisitBinop(this, node, kArmEor, kArmEor);
-}
-
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
-  ArmOperandGenerator g(this);
+  ArmOperandGeneratorT<Adapter> g(this);
 
   // No outputs.
   InstructionOperand* const outputs = nullptr;
@@ -1126,7 +1259,6 @@ void InstructionSelector::VisitStackPointerGreaterThan(
                                  ? OperandGenerator::kUniqueRegister
                                  : OperandGenerator::kRegister;
 
-  Node* const value = node->InputAt(0);
   InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
   static constexpr int input_count = arraysize(inputs);
 
@@ -1136,10 +1268,17 @@ void InstructionSelector::VisitStackPointerGreaterThan(
 
 namespace {
 
+template <typename T, typename TryMatchShift>
+void VisitShift(InstructionSelectorT<TurboshaftAdapter>*, T, TryMatchShift,
+                FlagsContinuationT<TurboshaftAdapter>*) {
+  UNIMPLEMENTED();
+}
+
 template <typename TryMatchShift>
-void VisitShift(InstructionSelector* selector, Node* node,
-                TryMatchShift try_match_shift, FlagsContinuation* cont) {
-  ArmOperandGenerator g(selector);
+void VisitShift(InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
+                TryMatchShift try_match_shift,
+                FlagsContinuationT<TurbofanAdapter>* cont) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(selector);
   InstructionCode opcode = kArmMov;
   InstructionOperand inputs[2];
   size_t input_count = 2;
@@ -1160,69 +1299,91 @@ void VisitShift(InstructionSelector* selector, Node* node,
                                  inputs, cont);
 }
 
+template <typename T, typename TryMatchShift>
+void VisitShift(InstructionSelectorT<TurboshaftAdapter>*, T, TryMatchShift) {
+  UNIMPLEMENTED();
+}
+
 template <typename TryMatchShift>
-void VisitShift(InstructionSelector* selector, Node* node,
+void VisitShift(InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
                 TryMatchShift try_match_shift) {
-  FlagsContinuation cont;
+  FlagsContinuationT<TurbofanAdapter> cont;
   VisitShift(selector, node, try_match_shift, &cont);
 }
 
 }  // namespace
 
-void InstructionSelector::VisitWord32Shl(Node* node) {
-  VisitShift(this, node, TryMatchLSL);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shl(node_t node) {
+  VisitShift(this, node, TryMatchLSL<Adapter>);
 }
 
-void InstructionSelector::VisitWord32Shr(Node* node) {
-  ArmOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (IsSupported(ARMv7) && m.left().IsWord32And() &&
-      m.right().IsInRange(0, 31)) {
-    uint32_t lsb = m.right().ResolvedValue();
-    Int32BinopMatcher mleft(m.left().node());
-    if (mleft.right().HasResolvedValue()) {
-      uint32_t value =
-          static_cast<uint32_t>(mleft.right().ResolvedValue() >> lsb) << lsb;
-      uint32_t width = base::bits::CountPopulation(value);
-      uint32_t msb = base::bits::CountLeadingZeros32(value);
-      if ((width != 0) && (msb + width + lsb == 32)) {
-        DCHECK_EQ(lsb, base::bits::CountTrailingZeros32(value));
-        return EmitUbfx(this, node, mleft.left().node(), lsb, width);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (IsSupported(ARMv7) && m.left().IsWord32And() &&
+        m.right().IsInRange(0, 31)) {
+      uint32_t lsb = m.right().ResolvedValue();
+      Int32BinopMatcher mleft(m.left().node());
+      if (mleft.right().HasResolvedValue()) {
+        uint32_t value =
+            static_cast<uint32_t>(mleft.right().ResolvedValue() >> lsb) << lsb;
+        uint32_t width = base::bits::CountPopulation(value);
+        uint32_t msb = base::bits::CountLeadingZeros32(value);
+        if ((width != 0) && (msb + width + lsb == 32)) {
+          DCHECK_EQ(lsb, base::bits::CountTrailingZeros32(value));
+          return EmitUbfx(this, node, mleft.left().node(), lsb, width);
+        }
       }
     }
+    VisitShift(this, node, TryMatchLSR<Adapter>);
   }
-  VisitShift(this, node, TryMatchLSR);
 }
 
-void InstructionSelector::VisitWord32Sar(Node* node) {
-  ArmOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (CanCover(m.node(), m.left().node()) && m.left().IsWord32Shl()) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (m.right().HasResolvedValue() && mleft.right().HasResolvedValue()) {
-      uint32_t sar = m.right().ResolvedValue();
-      uint32_t shl = mleft.right().ResolvedValue();
-      if ((sar == shl) && (sar == 16)) {
-        Emit(kArmSxth, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()), g.TempImmediate(0));
-        return;
-      } else if ((sar == shl) && (sar == 24)) {
-        Emit(kArmSxtb, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()), g.TempImmediate(0));
-        return;
-      } else if (IsSupported(ARMv7) && (sar >= shl)) {
-        Emit(kArmSbfx, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()), g.TempImmediate(sar - shl),
-             g.TempImmediate(32 - sar));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Sar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (CanCover(m.node(), m.left().node()) && m.left().IsWord32Shl()) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (m.right().HasResolvedValue() && mleft.right().HasResolvedValue()) {
+        uint32_t sar = m.right().ResolvedValue();
+        uint32_t shl = mleft.right().ResolvedValue();
+        if ((sar == shl) && (sar == 16)) {
+          Emit(kArmSxth, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()), g.TempImmediate(0));
+          return;
+        } else if ((sar == shl) && (sar == 24)) {
+          Emit(kArmSxtb, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()), g.TempImmediate(0));
+          return;
+        } else if (IsSupported(ARMv7) && (sar >= shl)) {
+          Emit(kArmSbfx, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()), g.TempImmediate(sar - shl),
+               g.TempImmediate(32 - sar));
+          return;
+        }
       }
     }
+    VisitShift(this, node, TryMatchASR<Adapter>);
   }
-  VisitShift(this, node, TryMatchASR);
 }
 
-void InstructionSelector::VisitInt32PairAdd(Node* node) {
-  ArmOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32PairAdd(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32PairAdd(node_t node) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(this);
 
   Node* projection1 = NodeProperties::FindProjection(node, 1);
   if (projection1) {
@@ -1246,8 +1407,14 @@ void InstructionSelector::VisitInt32PairAdd(Node* node) {
   }
 }
 
-void InstructionSelector::VisitInt32PairSub(Node* node) {
-  ArmOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32PairSub(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32PairSub(node_t node) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(this);
 
   Node* projection1 = NodeProperties::FindProjection(node, 1);
   if (projection1) {
@@ -1271,8 +1438,14 @@ void InstructionSelector::VisitInt32PairSub(Node* node) {
   }
 }
 
-void InstructionSelector::VisitInt32PairMul(Node* node) {
-  ArmOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32PairMul(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32PairMul(node_t node) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(this);
   Node* projection1 = NodeProperties::FindProjection(node, 1);
   if (projection1) {
     InstructionOperand inputs[] = {g.UseUniqueRegister(node->InputAt(0)),
@@ -1296,9 +1469,10 @@ void InstructionSelector::VisitInt32PairMul(Node* node) {
 
 namespace {
 // Shared routine for multiple shift operations.
-void VisitWord32PairShift(InstructionSelector* selector, InstructionCode opcode,
-                          Node* node) {
-  ArmOperandGenerator g(selector);
+template <typename Adapter>
+void VisitWord32PairShift(InstructionSelectorT<Adapter>* selector,
+                          InstructionCode opcode, Node* node) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   // We use g.UseUniqueRegister here to guarantee that there is
   // no register aliasing of input registers with output registers.
   Int32Matcher m(node->InputAt(2));
@@ -1330,45 +1504,82 @@ void VisitWord32PairShift(InstructionSelector* selector, InstructionCode opcode,
   selector->Emit(opcode, output_count, outputs, 3, inputs, temp_count, temps);
 }
 }  // namespace
-void InstructionSelector::VisitWord32PairShl(Node* node) {
-  VisitWord32PairShift(this, kArmLslPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairShl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kArmLslPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32PairShr(Node* node) {
-  VisitWord32PairShift(this, kArmLsrPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairShr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kArmLsrPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32PairSar(Node* node) {
-  VisitWord32PairShift(this, kArmAsrPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairSar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kArmAsrPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32Ror(Node* node) {
-  VisitShift(this, node, TryMatchROR);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
+  VisitShift(this, node, TryMatchROR<Adapter>);
 }
 
-void InstructionSelector::VisitWord32Ctz(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ctz(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
   DCHECK(IsSupported(ARMv7));
   VisitRR(this, kArmRbit, node);
 }
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
   VisitRR(this, kArmRev, node);
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitWord32Popcnt(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Popcnt(node_t node) {
+  UNREACHABLE();
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Add(node_t node) {
+  UNIMPLEMENTED();
+}
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  ArmOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Add(Node* node) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   if (CanCover(node, m.left().node())) {
     switch (m.left().opcode()) {
@@ -1485,24 +1696,32 @@ void InstructionSelector::VisitInt32Add(Node* node) {
   VisitBinop(this, node, kArmAdd, kArmAdd);
 }
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  ArmOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (IsSupported(ARMv7) && m.right().IsInt32Mul() &&
-      CanCover(node, m.right().node())) {
-    Int32BinopMatcher mright(m.right().node());
-    Emit(kArmMls, g.DefineAsRegister(node), g.UseRegister(mright.left().node()),
-         g.UseRegister(mright.right().node()), g.UseRegister(m.left().node()));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (IsSupported(ARMv7) && m.right().IsInt32Mul() &&
+        CanCover(node, m.right().node())) {
+      Int32BinopMatcher mright(m.right().node());
+      Emit(kArmMls, g.DefineAsRegister(node),
+           g.UseRegister(mright.left().node()),
+           g.UseRegister(mright.right().node()),
+           g.UseRegister(m.left().node()));
+      return;
+    }
+    VisitBinop(this, node, kArmSub, kArmRsb);
   }
-  VisitBinop(this, node, kArmSub, kArmRsb);
 }
 
 namespace {
 
-void EmitInt32MulWithOverflow(InstructionSelector* selector, Node* node,
-                              FlagsContinuation* cont) {
-  ArmOperandGenerator g(selector);
+template <typename Adapter>
+void EmitInt32MulWithOverflow(InstructionSelectorT<Adapter>* selector,
+                              Node* node, FlagsContinuationT<Adapter>* cont) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   InstructionOperand result_operand = g.DefineAsRegister(node);
   InstructionOperand temp_operand = g.TempRegister();
@@ -1521,88 +1740,101 @@ void EmitInt32MulWithOverflow(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
-  ArmOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
-    int32_t value = m.right().ResolvedValue();
-    if (base::bits::IsPowerOfTwo(value - 1)) {
-      Emit(kArmAdd | AddressingModeField::encode(kMode_Operand2_R_LSL_I),
-           g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-           g.UseRegister(m.left().node()),
-           g.TempImmediate(base::bits::WhichPowerOfTwo(value - 1)));
-      return;
-    }
-    if (value < kMaxInt && base::bits::IsPowerOfTwo(value + 1)) {
-      Emit(kArmRsb | AddressingModeField::encode(kMode_Operand2_R_LSL_I),
-           g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-           g.UseRegister(m.left().node()),
-           g.TempImmediate(base::bits::WhichPowerOfTwo(value + 1)));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
+      int32_t value = m.right().ResolvedValue();
+      if (base::bits::IsPowerOfTwo(value - 1)) {
+        Emit(kArmAdd | AddressingModeField::encode(kMode_Operand2_R_LSL_I),
+             g.DefineAsRegister(node), g.UseRegister(m.left().node()),
+             g.UseRegister(m.left().node()),
+             g.TempImmediate(base::bits::WhichPowerOfTwo(value - 1)));
+        return;
+      }
+      if (value < kMaxInt && base::bits::IsPowerOfTwo(value + 1)) {
+        Emit(kArmRsb | AddressingModeField::encode(kMode_Operand2_R_LSL_I),
+             g.DefineAsRegister(node), g.UseRegister(m.left().node()),
+             g.UseRegister(m.left().node()),
+             g.TempImmediate(base::bits::WhichPowerOfTwo(value + 1)));
+        return;
+      }
     }
+    VisitRRR(this, kArmMul, node);
   }
-  VisitRRR(this, kArmMul, node);
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
+  auto binop = this->word_binop_view(node);
+  ArmOperandGeneratorT<Adapter> g(this);
   InstructionOperand outputs[] = {g.TempRegister(), g.DefineAsRegister(node)};
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0)),
-                                 g.UseRegister(node->InputAt(1))};
+  InstructionOperand inputs[] = {g.UseRegister(binop.left()),
+                                 g.UseRegister(binop.right())};
   Emit(kArmUmull, arraysize(outputs), outputs, arraysize(inputs), inputs);
 }
 
-void InstructionSelector::VisitInt32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Div(node_t node) {
   VisitDiv(this, node, kArmSdiv, kArmVcvtF64S32, kArmVcvtS32F64);
 }
 
-void InstructionSelector::VisitUint32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Div(node_t node) {
   VisitDiv(this, node, kArmUdiv, kArmVcvtF64U32, kArmVcvtU32F64);
 }
 
-void InstructionSelector::VisitInt32Mod(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mod(node_t node) {
   VisitMod(this, node, kArmSdiv, kArmVcvtF64S32, kArmVcvtS32F64);
 }
 
-void InstructionSelector::VisitUint32Mod(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Mod(node_t node) {
   VisitMod(this, node, kArmUdiv, kArmVcvtF64U32, kArmVcvtU32F64);
 }
 
-#define RR_OP_LIST(V)                                \
-  V(Word32Clz, kArmClz)                              \
-  V(ChangeFloat32ToFloat64, kArmVcvtF64F32)          \
-  V(RoundInt32ToFloat32, kArmVcvtF32S32)             \
-  V(RoundUint32ToFloat32, kArmVcvtF32U32)            \
+#define RR_OP_T_LIST(V)                              \
   V(ChangeInt32ToFloat64, kArmVcvtF64S32)            \
   V(ChangeUint32ToFloat64, kArmVcvtF64U32)           \
+  V(ChangeFloat32ToFloat64, kArmVcvtF64F32)          \
   V(ChangeFloat64ToInt32, kArmVcvtS32F64)            \
   V(ChangeFloat64ToUint32, kArmVcvtU32F64)           \
-  V(TruncateFloat64ToUint32, kArmVcvtU32F64)         \
+  V(RoundInt32ToFloat32, kArmVcvtF32S32)             \
+  V(RoundUint32ToFloat32, kArmVcvtF32U32)            \
+  V(Float64ExtractLowWord32, kArmVmovLowU32F64)      \
+  V(Float64ExtractHighWord32, kArmVmovHighU32F64)    \
   V(TruncateFloat64ToFloat32, kArmVcvtF32F64)        \
   V(TruncateFloat64ToWord32, kArchTruncateDoubleToI) \
-  V(RoundFloat64ToInt32, kArmVcvtS32F64)             \
+  V(TruncateFloat64ToUint32, kArmVcvtU32F64)         \
   V(BitcastFloat32ToInt32, kArmVmovU32F32)           \
   V(BitcastInt32ToFloat32, kArmVmovF32U32)           \
-  V(Float64ExtractLowWord32, kArmVmovLowU32F64)      \
-  V(Float64ExtractHighWord32, kArmVmovHighU32F64)    \
+  V(RoundFloat64ToInt32, kArmVcvtS32F64)             \
   V(Float64SilenceNaN, kArmFloat64SilenceNaN)        \
   V(Float32Abs, kArmVabsF32)                         \
   V(Float64Abs, kArmVabsF64)                         \
   V(Float32Neg, kArmVnegF32)                         \
   V(Float64Neg, kArmVnegF64)                         \
   V(Float32Sqrt, kArmVsqrtF32)                       \
-  V(Float64Sqrt, kArmVsqrtF64)
+  V(Float64Sqrt, kArmVsqrtF64)                       \
+  V(Word32Clz, kArmClz)
+
+#define RR_OP_T_LIST_V8(V)               \
+  V(Float32RoundDown, kArmVrintmF32)     \
+  V(Float64RoundDown, kArmVrintmF64)     \
+  V(Float32RoundUp, kArmVrintpF32)       \
+  V(Float64RoundUp, kArmVrintpF64)       \
+  V(Float32RoundTruncate, kArmVrintzF32) \
+  V(Float64RoundTruncate, kArmVrintzF64) \
+  V(Float64RoundTiesAway, kArmVrintaF64) \
+  V(Float32RoundTiesEven, kArmVrintnF32) \
+  V(Float64RoundTiesEven, kArmVrintnF64)
 
 #define RR_OP_LIST_V8(V)                  \
-  V(Float32RoundDown, kArmVrintmF32)      \
-  V(Float64RoundDown, kArmVrintmF64)      \
-  V(Float32RoundUp, kArmVrintpF32)        \
-  V(Float64RoundUp, kArmVrintpF64)        \
-  V(Float32RoundTruncate, kArmVrintzF32)  \
-  V(Float64RoundTruncate, kArmVrintzF64)  \
-  V(Float64RoundTiesAway, kArmVrintaF64)  \
-  V(Float32RoundTiesEven, kArmVrintnF32)  \
-  V(Float64RoundTiesEven, kArmVrintnF64)  \
   V(F64x2Ceil, kArmF64x2Ceil)             \
   V(F64x2Floor, kArmF64x2Floor)           \
   V(F64x2Trunc, kArmF64x2Trunc)           \
@@ -1612,238 +1844,319 @@ void InstructionSelector::VisitUint32Mod(Node* node) {
   V(F32x4Trunc, kArmVrintzF32)            \
   V(F32x4NearestInt, kArmVrintnF32)
 
-#define RRR_OP_LIST(V)          \
-  V(Int32MulHigh, kArmSmmul)    \
+#define RRR_OP_T_LIST(V)        \
+  V(Float64Div, kArmVdivF64)    \
   V(Float32Mul, kArmVmulF32)    \
   V(Float64Mul, kArmVmulF64)    \
   V(Float32Div, kArmVdivF32)    \
-  V(Float64Div, kArmVdivF64)    \
   V(Float32Max, kArmFloat32Max) \
   V(Float64Max, kArmFloat64Max) \
   V(Float32Min, kArmFloat32Min) \
-  V(Float64Min, kArmFloat64Min)
+  V(Float64Min, kArmFloat64Min) \
+  V(Int32MulHigh, kArmSmmul)
 
-#define RR_VISITOR(Name, opcode)                      \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, opcode, node);                      \
+#define RR_VISITOR(Name, opcode)                                 \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRR(this, opcode, node);                                 \
   }
-RR_OP_LIST(RR_VISITOR)
+RR_OP_T_LIST(RR_VISITOR)
 #undef RR_VISITOR
-#undef RR_OP_LIST
+#undef RR_OP_T_LIST
 
-#define RR_VISITOR_V8(Name, opcode)                   \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    DCHECK(CpuFeatures::IsSupported(ARMv8));          \
-    VisitRR(this, opcode, node);                      \
+#define RR_VISITOR_V8(Name, opcode)                             \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    DCHECK(CpuFeatures::IsSupported(ARMv8));                    \
+    VisitRR(this, opcode, node);                                \
   }
 RR_OP_LIST_V8(RR_VISITOR_V8)
 #undef RR_VISITOR_V8
 #undef RR_OP_LIST_V8
 
-#define RRR_VISITOR(Name, opcode)                     \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRR(this, opcode, node);                     \
+#define RR_VISITOR_V8(Name, opcode)                              \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    DCHECK(CpuFeatures::IsSupported(ARMv8));                     \
+    VisitRR(this, opcode, node);                                 \
   }
-RRR_OP_LIST(RRR_VISITOR)
-#undef RRR_VISITOR
-#undef RRR_OP_LIST
-
-void InstructionSelector::VisitFloat32Add(Node* node) {
-  ArmOperandGenerator g(this);
-  Float32BinopMatcher m(node);
-  if (m.left().IsFloat32Mul() && CanCover(node, m.left().node())) {
-    Float32BinopMatcher mleft(m.left().node());
-    Emit(kArmVmlaF32, g.DefineSameAsFirst(node),
-         g.UseRegister(m.right().node()), g.UseRegister(mleft.left().node()),
-         g.UseRegister(mleft.right().node()));
-    return;
+RR_OP_T_LIST_V8(RR_VISITOR_V8)
+#undef RR_VISITOR_V8
+#undef RR_OP_T_LIST_V8
+
+#define RRR_VISITOR(Name, opcode)                                \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRRR(this, opcode, node);                                \
   }
-  if (m.right().IsFloat32Mul() && CanCover(node, m.right().node())) {
-    Float32BinopMatcher mright(m.right().node());
-    Emit(kArmVmlaF32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-         g.UseRegister(mright.left().node()),
-         g.UseRegister(mright.right().node()));
-    return;
+RRR_OP_T_LIST(RRR_VISITOR)
+#undef RRR_VISITOR
+#undef RRR_OP_T_LIST
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Float32BinopMatcher m(node);
+    if (m.left().IsFloat32Mul() && CanCover(node, m.left().node())) {
+      Float32BinopMatcher mleft(m.left().node());
+      Emit(kArmVmlaF32, g.DefineSameAsFirst(node),
+           g.UseRegister(m.right().node()), g.UseRegister(mleft.left().node()),
+           g.UseRegister(mleft.right().node()));
+      return;
+    }
+    if (m.right().IsFloat32Mul() && CanCover(node, m.right().node())) {
+      Float32BinopMatcher mright(m.right().node());
+      Emit(kArmVmlaF32, g.DefineSameAsFirst(node),
+           g.UseRegister(m.left().node()), g.UseRegister(mright.left().node()),
+           g.UseRegister(mright.right().node()));
+      return;
+    }
+    VisitRRR(this, kArmVaddF32, node);
   }
-  VisitRRR(this, kArmVaddF32, node);
 }
 
-void InstructionSelector::VisitFloat64Add(Node* node) {
-  ArmOperandGenerator g(this);
-  Float64BinopMatcher m(node);
-  if (m.left().IsFloat64Mul() && CanCover(node, m.left().node())) {
-    Float64BinopMatcher mleft(m.left().node());
-    Emit(kArmVmlaF64, g.DefineSameAsFirst(node),
-         g.UseRegister(m.right().node()), g.UseRegister(mleft.left().node()),
-         g.UseRegister(mleft.right().node()));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Float64BinopMatcher m(node);
+    if (m.left().IsFloat64Mul() && CanCover(node, m.left().node())) {
+      Float64BinopMatcher mleft(m.left().node());
+      Emit(kArmVmlaF64, g.DefineSameAsFirst(node),
+           g.UseRegister(m.right().node()), g.UseRegister(mleft.left().node()),
+           g.UseRegister(mleft.right().node()));
+      return;
+    }
+    if (m.right().IsFloat64Mul() && CanCover(node, m.right().node())) {
+      Float64BinopMatcher mright(m.right().node());
+      Emit(kArmVmlaF64, g.DefineSameAsFirst(node),
+           g.UseRegister(m.left().node()), g.UseRegister(mright.left().node()),
+           g.UseRegister(mright.right().node()));
+      return;
+    }
+    VisitRRR(this, kArmVaddF64, node);
   }
-  if (m.right().IsFloat64Mul() && CanCover(node, m.right().node())) {
-    Float64BinopMatcher mright(m.right().node());
-    Emit(kArmVmlaF64, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-         g.UseRegister(mright.left().node()),
-         g.UseRegister(mright.right().node()));
-    return;
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Float32BinopMatcher m(node);
+    if (m.right().IsFloat32Mul() && CanCover(node, m.right().node())) {
+      Float32BinopMatcher mright(m.right().node());
+      Emit(kArmVmlsF32, g.DefineSameAsFirst(node),
+           g.UseRegister(m.left().node()), g.UseRegister(mright.left().node()),
+           g.UseRegister(mright.right().node()));
+      return;
+    }
+    VisitRRR(this, kArmVsubF32, node);
   }
-  VisitRRR(this, kArmVaddF64, node);
 }
 
-void InstructionSelector::VisitFloat32Sub(Node* node) {
-  ArmOperandGenerator g(this);
-  Float32BinopMatcher m(node);
-  if (m.right().IsFloat32Mul() && CanCover(node, m.right().node())) {
-    Float32BinopMatcher mright(m.right().node());
-    Emit(kArmVmlsF32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-         g.UseRegister(mright.left().node()),
-         g.UseRegister(mright.right().node()));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Float64BinopMatcher m(node);
+    if (m.right().IsFloat64Mul() && CanCover(node, m.right().node())) {
+      Float64BinopMatcher mright(m.right().node());
+      Emit(kArmVmlsF64, g.DefineSameAsFirst(node),
+           g.UseRegister(m.left().node()), g.UseRegister(mright.left().node()),
+           g.UseRegister(mright.right().node()));
+      return;
+    }
+    VisitRRR(this, kArmVsubF64, node);
   }
-  VisitRRR(this, kArmVsubF32, node);
 }
 
-void InstructionSelector::VisitFloat64Sub(Node* node) {
-  ArmOperandGenerator g(this);
-  Float64BinopMatcher m(node);
-  if (m.right().IsFloat64Mul() && CanCover(node, m.right().node())) {
-    Float64BinopMatcher mright(m.right().node());
-    Emit(kArmVmlsF64, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-         g.UseRegister(mright.left().node()),
-         g.UseRegister(mright.right().node()));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Emit(kArmVmodF64, g.DefineAsFixed(node, d0),
+         g.UseFixed(node->InputAt(0), d0), g.UseFixed(node->InputAt(1), d1))
+        ->MarkAsCall();
   }
-  VisitRRR(this, kArmVsubF64, node);
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  ArmOperandGenerator g(this);
-  Emit(kArmVmodF64, g.DefineAsFixed(node, d0), g.UseFixed(node->InputAt(0), d0),
-       g.UseFixed(node->InputAt(1), d1))
-      ->MarkAsCall();
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  ArmOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Binop(
+    Node* node, InstructionCode opcode) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, d0), g.UseFixed(node->InputAt(0), d0),
        g.UseFixed(node->InputAt(1), d1))
       ->MarkAsCall();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  ArmOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Unop(
+    Node* node, InstructionCode opcode) {
+  ArmOperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, d0), g.UseFixed(node->InputAt(0), d0))
       ->MarkAsCall();
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int index) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node, int index) {
+}
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {}
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  ArmOperandGenerator g(this);
-
-  // Prepare for C function call.
-  if (call_descriptor->IsCFunctionCall()) {
-    Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
-                                         call_descriptor->ParameterCount())),
-         0, nullptr, 0, nullptr);
-
-    // Poke any stack arguments.
-    for (size_t n = 0; n < arguments->size(); ++n) {
-      PushParameter input = (*arguments)[n];
-      if (input.node) {
-        int slot = static_cast<int>(n);
-        Emit(kArmPoke | MiscField::encode(slot), g.NoOutput(),
-             g.UseRegister(input.node));
-      }
-    }
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    // Push any stack arguments.
-    int stack_decrement = 0;
-    for (PushParameter input : base::Reversed(*arguments)) {
-      stack_decrement += kSystemPointerSize;
-      // Skip any alignment holes in pushed nodes.
-      if (input.node == nullptr) continue;
-      InstructionOperand decrement = g.UseImmediate(stack_decrement);
-      stack_decrement = 0;
-      Emit(kArmPush, g.NoOutput(), decrement, g.UseRegister(input.node));
+    ArmOperandGeneratorT<Adapter> g(this);
+
+    // Prepare for C function call.
+    if (call_descriptor->IsCFunctionCall()) {
+      Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
+                                           call_descriptor->ParameterCount())),
+           0, nullptr, 0, nullptr);
+
+      // Poke any stack arguments.
+      for (size_t n = 0; n < arguments->size(); ++n) {
+        PushParameter input = (*arguments)[n];
+        if (input.node) {
+          int slot = static_cast<int>(n);
+          Emit(kArmPoke | MiscField::encode(slot), g.NoOutput(),
+               g.UseRegister(input.node));
+        }
+      }
+    } else {
+      // Push any stack arguments.
+      int stack_decrement = 0;
+      for (PushParameter input : base::Reversed(*arguments)) {
+        stack_decrement += kSystemPointerSize;
+        // Skip any alignment holes in pushed nodes.
+        if (input.node == nullptr) continue;
+        InstructionOperand decrement = g.UseImmediate(stack_decrement);
+        stack_decrement = 0;
+        Emit(kArmPush, g.NoOutput(), decrement, g.UseRegister(input.node));
+      }
     }
   }
 }
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  ArmOperandGenerator g(this);
-
-  for (PushParameter output : *results) {
-    if (!output.location.IsCallerFrameSlot()) continue;
-    // Skip any alignment holes in nodes.
-    if (output.node != nullptr) {
-      DCHECK(!call_descriptor->IsCFunctionCall());
-      if (output.location.GetType() == MachineType::Float32()) {
-        MarkAsFloat32(output.node);
-      } else if (output.location.GetType() == MachineType::Float64()) {
-        MarkAsFloat64(output.node);
-      } else if (output.location.GetType() == MachineType::Simd128()) {
-        MarkAsSimd128(output.node);
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+
+    for (PushParameter output : *results) {
+      if (!output.location.IsCallerFrameSlot()) continue;
+      // Skip any alignment holes in nodes.
+      if (output.node != nullptr) {
+        DCHECK(!call_descriptor->IsCFunctionCall());
+        if (output.location.GetType() == MachineType::Float32()) {
+          MarkAsFloat32(output.node);
+        } else if (output.location.GetType() == MachineType::Float64()) {
+          MarkAsFloat64(output.node);
+        } else if (output.location.GetType() == MachineType::Simd128()) {
+          MarkAsSimd128(output.node);
+        }
+        int offset = call_descriptor->GetOffsetToReturns();
+        int reverse_slot = -output.location.GetLocation() - offset;
+        Emit(kArmPeek, g.DefineAsRegister(output.node),
+             g.UseImmediate(reverse_slot));
       }
-      int offset = call_descriptor->GetOffsetToReturns();
-      int reverse_slot = -output.location.GetLocation() - offset;
-      Emit(kArmPeek, g.DefineAsRegister(output.node),
-           g.UseImmediate(reverse_slot));
     }
   }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return false; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return false;
+}
 
 namespace {
 
 // Shared routine for multiple compare operations.
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  InstructionOperand left, InstructionOperand right,
-                  FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, InstructionOperand left,
+                  InstructionOperand right, FlagsContinuationT<Adapter>* cont) {
   selector->EmitWithContinuation(opcode, left, right, cont);
 }
 
 // Shared routine for multiple float32 compare operations.
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  ArmOperandGenerator g(selector);
-  Float32BinopMatcher m(node);
-  if (m.right().Is(0.0f)) {
-    VisitCompare(selector, kArmVcmpF32, g.UseRegister(m.left().node()),
-                 g.UseImmediate(m.right().node()), cont);
-  } else if (m.left().Is(0.0f)) {
-    cont->Commute();
-    VisitCompare(selector, kArmVcmpF32, g.UseRegister(m.right().node()),
-                 g.UseImmediate(m.left().node()), cont);
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitCompare(selector, kArmVcmpF32, g.UseRegister(m.left().node()),
-                 g.UseRegister(m.right().node()), cont);
+    ArmOperandGeneratorT<Adapter> g(selector);
+    Float32BinopMatcher m(node);
+    if (m.right().Is(0.0f)) {
+      VisitCompare(selector, kArmVcmpF32, g.UseRegister(m.left().node()),
+                   g.UseImmediate(m.right().node()), cont);
+    } else if (m.left().Is(0.0f)) {
+      cont->Commute();
+      VisitCompare(selector, kArmVcmpF32, g.UseRegister(m.right().node()),
+                   g.UseImmediate(m.left().node()), cont);
+    } else {
+      VisitCompare(selector, kArmVcmpF32, g.UseRegister(m.left().node()),
+                   g.UseRegister(m.right().node()), cont);
+    }
   }
 }
 
 // Shared routine for multiple float64 compare operations.
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  ArmOperandGenerator g(selector);
-  Float64BinopMatcher m(node);
-  if (m.right().Is(0.0)) {
-    VisitCompare(selector, kArmVcmpF64, g.UseRegister(m.left().node()),
-                 g.UseImmediate(m.right().node()), cont);
-  } else if (m.left().Is(0.0)) {
-    cont->Commute();
-    VisitCompare(selector, kArmVcmpF64, g.UseRegister(m.right().node()),
-                 g.UseImmediate(m.left().node()), cont);
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitCompare(selector, kArmVcmpF64, g.UseRegister(m.left().node()),
-                 g.UseRegister(m.right().node()), cont);
+    ArmOperandGeneratorT<Adapter> g(selector);
+    Float64BinopMatcher m(node);
+    if (m.right().Is(0.0)) {
+      VisitCompare(selector, kArmVcmpF64, g.UseRegister(m.left().node()),
+                   g.UseImmediate(m.right().node()), cont);
+    } else if (m.left().Is(0.0)) {
+      cont->Commute();
+      VisitCompare(selector, kArmVcmpF64, g.UseRegister(m.right().node()),
+                   g.UseImmediate(m.left().node()), cont);
+    } else {
+      VisitCompare(selector, kArmVcmpF64, g.UseRegister(m.left().node()),
+                   g.UseRegister(m.right().node()), cont);
+    }
   }
 }
 
@@ -1899,11 +2212,11 @@ FlagsCondition MapForFlagSettingBinop(FlagsCondition cond) {
 // (a <ops> b), b.<cond'>
 // where <ops> is the flag setting version of <op>, and if so,
 // updates {node}, {opcode} and {cont} accordingly.
-void MaybeReplaceCmpZeroWithFlagSettingBinop(InstructionSelector* selector,
-                                             Node** node, Node* binop,
-                                             InstructionCode* opcode,
-                                             FlagsCondition cond,
-                                             FlagsContinuation* cont) {
+template <typename Adapter>
+void MaybeReplaceCmpZeroWithFlagSettingBinop(
+    InstructionSelectorT<Adapter>* selector, Node** node, Node* binop,
+    InstructionCode* opcode, FlagsCondition cond,
+    FlagsContinuationT<Adapter>* cont) {
   InstructionCode binop_opcode;
   InstructionCode no_output_opcode;
   switch (binop->opcode()) {
@@ -1942,369 +2255,443 @@ void MaybeReplaceCmpZeroWithFlagSettingBinop(InstructionSelector* selector,
 }
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont) {
-  ArmOperandGenerator g(selector);
-  Int32BinopMatcher m(node);
-  InstructionOperand inputs[3];
-  size_t input_count = 0;
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  bool has_result = (opcode != kArmCmp) && (opcode != kArmCmn) &&
-                    (opcode != kArmTst) && (opcode != kArmTeq);
-
-  if (TryMatchImmediateOrShift(selector, &opcode, m.right().node(),
-                               &input_count, &inputs[1])) {
-    inputs[0] = g.UseRegister(m.left().node());
-    input_count++;
-  } else if (TryMatchImmediateOrShift(selector, &opcode, m.left().node(),
-                                      &input_count, &inputs[1])) {
-    if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute();
-    inputs[0] = g.UseRegister(m.right().node());
-    input_count++;
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node, InstructionCode opcode,
+                      FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    opcode |= AddressingModeField::encode(kMode_Operand2_R);
-    inputs[input_count++] = g.UseRegister(m.left().node());
-    inputs[input_count++] = g.UseRegister(m.right().node());
-  }
-
-  if (has_result) {
-    if (cont->IsDeoptimize()) {
-      // If we can deoptimize as a result of the binop, we need to make sure
-      // that the deopt inputs are not overwritten by the binop result. One way
-      // to achieve that is to declare the output register as same-as-first.
-      outputs[output_count++] = g.DefineSameAsFirst(node);
+    ArmOperandGeneratorT<Adapter> g(selector);
+    Int32BinopMatcher m(node);
+    InstructionOperand inputs[3];
+    size_t input_count = 0;
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    bool has_result = (opcode != kArmCmp) && (opcode != kArmCmn) &&
+                      (opcode != kArmTst) && (opcode != kArmTeq);
+
+    if (TryMatchImmediateOrShift(selector, &opcode, m.right().node(),
+                                 &input_count, &inputs[1])) {
+      inputs[0] = g.UseRegister(m.left().node());
+      input_count++;
+    } else if (TryMatchImmediateOrShift(selector, &opcode, m.left().node(),
+                                        &input_count, &inputs[1])) {
+      if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute();
+      inputs[0] = g.UseRegister(m.right().node());
+      input_count++;
     } else {
-      outputs[output_count++] = g.DefineAsRegister(node);
+      opcode |= AddressingModeField::encode(kMode_Operand2_R);
+      inputs[input_count++] = g.UseRegister(m.left().node());
+      inputs[input_count++] = g.UseRegister(m.right().node());
     }
-  }
 
-  DCHECK_NE(0u, input_count);
-  DCHECK_GE(arraysize(inputs), input_count);
-  DCHECK_GE(arraysize(outputs), output_count);
+    if (has_result) {
+      if (cont->IsDeoptimize()) {
+        // If we can deoptimize as a result of the binop, we need to make sure
+        // that the deopt inputs are not overwritten by the binop result. One
+        // way to achieve that is to declare the output register as
+        // same-as-first.
+        outputs[output_count++] = g.DefineSameAsFirst(node);
+      } else {
+        outputs[output_count++] = g.DefineAsRegister(node);
+      }
+    }
 
-  selector->EmitWithContinuation(opcode, output_count, outputs, input_count,
-                                 inputs, cont);
+    DCHECK_NE(0u, input_count);
+    DCHECK_GE(arraysize(inputs), input_count);
+    DCHECK_GE(arraysize(outputs), output_count);
+
+    selector->EmitWithContinuation(opcode, output_count, outputs, input_count,
+                                   inputs, cont);
+  }
 }
 
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      FlagsContinuation* cont) {
-  InstructionCode opcode = kArmCmp;
-  Int32BinopMatcher m(node);
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node,
+                      FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    InstructionCode opcode = kArmCmp;
+    Int32BinopMatcher m(node);
 
-  FlagsCondition cond = cont->condition();
-  if (m.right().Is(0) && (m.left().IsInt32Add() || m.left().IsWord32Or() ||
-                          m.left().IsWord32And() || m.left().IsWord32Xor())) {
-    // Emit flag setting instructions for comparisons against zero.
-    if (CanUseFlagSettingBinop(cond)) {
-      Node* binop = m.left().node();
-      MaybeReplaceCmpZeroWithFlagSettingBinop(selector, &node, binop, &opcode,
-                                              cond, cont);
-    }
-  } else if (m.left().Is(0) &&
-             (m.right().IsInt32Add() || m.right().IsWord32Or() ||
-              m.right().IsWord32And() || m.right().IsWord32Xor())) {
-    // Same as above, but we need to commute the condition before we
-    // continue with the rest of the checks.
-    cond = CommuteFlagsCondition(cond);
-    if (CanUseFlagSettingBinop(cond)) {
-      Node* binop = m.right().node();
-      MaybeReplaceCmpZeroWithFlagSettingBinop(selector, &node, binop, &opcode,
-                                              cond, cont);
+    FlagsCondition cond = cont->condition();
+    if (m.right().Is(0) && (m.left().IsInt32Add() || m.left().IsWord32Or() ||
+                            m.left().IsWord32And() || m.left().IsWord32Xor())) {
+      // Emit flag setting instructions for comparisons against zero.
+      if (CanUseFlagSettingBinop(cond)) {
+        Node* binop = m.left().node();
+        MaybeReplaceCmpZeroWithFlagSettingBinop(selector, &node, binop, &opcode,
+                                                cond, cont);
+      }
+    } else if (m.left().Is(0) &&
+               (m.right().IsInt32Add() || m.right().IsWord32Or() ||
+                m.right().IsWord32And() || m.right().IsWord32Xor())) {
+      // Same as above, but we need to commute the condition before we
+      // continue with the rest of the checks.
+      cond = CommuteFlagsCondition(cond);
+      if (CanUseFlagSettingBinop(cond)) {
+        Node* binop = m.right().node();
+        MaybeReplaceCmpZeroWithFlagSettingBinop(selector, &node, binop, &opcode,
+                                                cond, cont);
+      }
     }
-  }
 
-  VisitWordCompare(selector, node, opcode, cont);
+    VisitWordCompare(selector, node, opcode, cont);
+  }
 }
 
 }  // namespace
 
 // Shared routine for word comparisons against zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
-    Int32BinopMatcher m(value);
-    if (!m.right().Is(0)) break;
-
-    user = value;
-    value = m.left().node();
-    cont->Negate();
-  }
-
-  if (CanCover(user, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kFloat32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThan:
-        cont->OverwriteAndNegateIfEqual(kFloatLessThan);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThan:
-        cont->OverwriteAndNegateIfEqual(kFloatLessThan);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kProjection:
-        // Check if this is the overflow output projection of an
-        // <Operation>WithOverflow node.
-        if (ProjectionIndexOf(value->op()) == 1u) {
-          // We cannot combine the <Operation>WithOverflow with this branch
-          // unless the 0th projection (the use of the actual value of the
-          // <Operation> is either nullptr, which means there's no use of the
-          // actual value, or was already defined, which means it is scheduled
-          // *AFTER* this branch).
-          Node* const node = value->InputAt(0);
-          Node* const result = NodeProperties::FindProjection(node, 0);
-          if (!result || IsDefined(result)) {
-            switch (node->opcode()) {
-              case IrOpcode::kInt32AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kArmAdd, kArmAdd, cont);
-              case IrOpcode::kInt32SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kArmSub, kArmRsb, cont);
-              case IrOpcode::kInt32MulWithOverflow:
-                // ARM doesn't set the overflow flag for multiplication, so we
-                // need to test on kNotEqual. Here is the code sequence used:
-                //   smull resultlow, resulthigh, left, right
-                //   cmp resulthigh, Operand(resultlow, ASR, 31)
-                cont->OverwriteAndNegateIfEqual(kNotEqual);
-                return EmitInt32MulWithOverflow(this, node, cont);
-              default:
-                break;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuation* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
+      Int32BinopMatcher m(value);
+      if (!m.right().Is(0)) break;
+
+      user = value;
+      value = m.left().node();
+      cont->Negate();
+    }
+
+    if (CanCover(user, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kFloat32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThan:
+          cont->OverwriteAndNegateIfEqual(kFloatLessThan);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThan:
+          cont->OverwriteAndNegateIfEqual(kFloatLessThan);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kProjection:
+          // Check if this is the overflow output projection of an
+          // <Operation>WithOverflow node.
+          if (ProjectionIndexOf(value->op()) == 1u) {
+            // We cannot combine the <Operation>WithOverflow with this branch
+            // unless the 0th projection (the use of the actual value of the
+            // <Operation> is either nullptr, which means there's no use of the
+            // actual value, or was already defined, which means it is scheduled
+            // *AFTER* this branch).
+            Node* const node = value->InputAt(0);
+            Node* const result = NodeProperties::FindProjection(node, 0);
+            if (!result || IsDefined(result)) {
+              switch (node->opcode()) {
+                case IrOpcode::kInt32AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kArmAdd, kArmAdd, cont);
+                case IrOpcode::kInt32SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kArmSub, kArmRsb, cont);
+                case IrOpcode::kInt32MulWithOverflow:
+                  // ARM doesn't set the overflow flag for multiplication, so we
+                  // need to test on kNotEqual. Here is the code sequence used:
+                  //   smull resultlow, resulthigh, left, right
+                  //   cmp resulthigh, Operand(resultlow, ASR, 31)
+                  cont->OverwriteAndNegateIfEqual(kNotEqual);
+                  return EmitInt32MulWithOverflow(this, node, cont);
+                default:
+                  break;
+              }
             }
           }
-        }
-        break;
-      case IrOpcode::kInt32Add:
-        return VisitWordCompare(this, value, kArmCmn, cont);
-      case IrOpcode::kInt32Sub:
-        return VisitWordCompare(this, value, kArmCmp, cont);
-      case IrOpcode::kWord32And:
-        return VisitWordCompare(this, value, kArmTst, cont);
-      case IrOpcode::kWord32Or:
-        return VisitBinop(this, value, kArmOrr, kArmOrr, cont);
-      case IrOpcode::kWord32Xor:
-        return VisitWordCompare(this, value, kArmTeq, cont);
-      case IrOpcode::kWord32Sar:
-        return VisitShift(this, value, TryMatchASR, cont);
-      case IrOpcode::kWord32Shl:
-        return VisitShift(this, value, TryMatchLSL, cont);
-      case IrOpcode::kWord32Shr:
-        return VisitShift(this, value, TryMatchLSR, cont);
-      case IrOpcode::kWord32Ror:
-        return VisitShift(this, value, TryMatchROR, cont);
-      case IrOpcode::kStackPointerGreaterThan:
-        cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
-        return VisitStackPointerGreaterThan(value, cont);
-      default:
-        break;
+          break;
+        case IrOpcode::kInt32Add:
+          return VisitWordCompare(this, value, kArmCmn, cont);
+        case IrOpcode::kInt32Sub:
+          return VisitWordCompare(this, value, kArmCmp, cont);
+        case IrOpcode::kWord32And:
+          return VisitWordCompare(this, value, kArmTst, cont);
+        case IrOpcode::kWord32Or:
+          return VisitBinop(this, value, kArmOrr, kArmOrr, cont);
+        case IrOpcode::kWord32Xor:
+          return VisitWordCompare(this, value, kArmTeq, cont);
+        case IrOpcode::kWord32Sar:
+          return VisitShift(this, value, TryMatchASR<Adapter>, cont);
+        case IrOpcode::kWord32Shl:
+          return VisitShift(this, value, TryMatchLSL<Adapter>, cont);
+        case IrOpcode::kWord32Shr:
+          return VisitShift(this, value, TryMatchLSR<Adapter>, cont);
+        case IrOpcode::kWord32Ror:
+          return VisitShift(this, value, TryMatchROR<Adapter>, cont);
+        case IrOpcode::kStackPointerGreaterThan:
+          cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
+          return VisitStackPointerGreaterThan(value, cont);
+        default:
+          break;
+      }
+    }
+
+    if (user->opcode() == IrOpcode::kWord32Equal) {
+      return VisitWordCompare(this, user, cont);
     }
+
+    // Continuation could not be combined with a compare, emit compare against
+    // 0.
+    ArmOperandGeneratorT<Adapter> g(this);
+    InstructionCode const opcode =
+        kArmTst | AddressingModeField::encode(kMode_Operand2_R);
+    InstructionOperand const value_operand = g.UseRegister(value);
+    EmitWithContinuation(opcode, value_operand, value_operand, cont);
   }
+}
 
-  if (user->opcode() == IrOpcode::kWord32Equal) {
-    return VisitWordCompare(this, user, cont);
-  }
-
-  // Continuation could not be combined with a compare, emit compare against 0.
-  ArmOperandGenerator g(this);
-  InstructionCode const opcode =
-      kArmTst | AddressingModeField::encode(kMode_Operand2_R);
-  InstructionOperand const value_operand = g.UseRegister(value);
-  EmitWithContinuation(opcode, value_operand, value_operand, cont);
-}
-
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  ArmOperandGenerator g(this);
-  InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
-
-  // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
-    static const size_t kMaxTableSwitchValueRange = 2 << 16;
-    size_t table_space_cost = 4 + sw.value_range();
-    size_t table_time_cost = 3;
-    size_t lookup_space_cost = 3 + 2 * sw.case_count();
-    size_t lookup_time_cost = sw.case_count();
-    if (sw.case_count() > 0 &&
-        table_space_cost + 3 * table_time_cost <=
-            lookup_space_cost + 3 * lookup_time_cost &&
-        sw.min_value() > std::numeric_limits<int32_t>::min() &&
-        sw.value_range() <= kMaxTableSwitchValueRange) {
-      InstructionOperand index_operand = value_operand;
-      if (sw.min_value()) {
-        index_operand = g.TempRegister();
-        Emit(kArmSub | AddressingModeField::encode(kMode_Operand2_I),
-             index_operand, value_operand, g.TempImmediate(sw.min_value()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
+
+    // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
+    if (enable_switch_jump_table_ ==
+        InstructionSelector::kEnableSwitchJumpTable) {
+      static const size_t kMaxTableSwitchValueRange = 2 << 16;
+      size_t table_space_cost = 4 + sw.value_range();
+      size_t table_time_cost = 3;
+      size_t lookup_space_cost = 3 + 2 * sw.case_count();
+      size_t lookup_time_cost = sw.case_count();
+      if (sw.case_count() > 0 &&
+          table_space_cost + 3 * table_time_cost <=
+              lookup_space_cost + 3 * lookup_time_cost &&
+          sw.min_value() > std::numeric_limits<int32_t>::min() &&
+          sw.value_range() <= kMaxTableSwitchValueRange) {
+        InstructionOperand index_operand = value_operand;
+        if (sw.min_value()) {
+          index_operand = g.TempRegister();
+          Emit(kArmSub | AddressingModeField::encode(kMode_Operand2_I),
+               index_operand, value_operand, g.TempImmediate(sw.min_value()));
+        }
+        // Generate a table lookup.
+        return EmitTableSwitch(sw, index_operand);
       }
-      // Generate a table lookup.
-      return EmitTableSwitch(sw, index_operand);
     }
-  }
 
-  // Generate a tree of conditional jumps.
-  return EmitBinarySearchSwitch(sw, value_operand);
+    // Generate a tree of conditional jumps.
+    return EmitBinarySearchSwitch(sw, value_operand);
+  }
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(0)) {
-    return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    if (m.right().Is(0)) {
+      return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+    }
   }
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kArmAdd, kArmAdd, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kArmAdd, kArmAdd, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kArmAdd, kArmAdd, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kArmAdd, kArmAdd, &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kArmSub, kArmRsb, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kArmSub, kArmRsb, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kArmSub, kArmRsb, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kArmSub, kArmRsb, &cont);
 }
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    // ARM doesn't set the overflow flag for multiplication, so we need to test
-    // on kNotEqual. Here is the code sequence used:
-    //   smull resultlow, resulthigh, left, right
-    //   cmp resulthigh, Operand(resultlow, ASR, 31)
-    FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
-    return EmitInt32MulWithOverflow(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      // ARM doesn't set the overflow flag for multiplication, so we need to
+      // test on kNotEqual. Here is the code sequence used:
+      //   smull resultlow, resulthigh, left, right
+      //   cmp resulthigh, Operand(resultlow, ASR, 31)
+      FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
+      return EmitInt32MulWithOverflow(this, node, &cont);
+    }
+    FlagsContinuation cont;
+    EmitInt32MulWithOverflow(this, node, &cont);
   }
-  FlagsContinuation cont;
-  EmitInt32MulWithOverflow(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kFloatLessThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kFloatLessThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kFloatLessThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kFloatLessThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
-  ArmOperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (left->opcode() == IrOpcode::kFloat64InsertHighWord32 &&
-      CanCover(node, left)) {
-    left = left->InputAt(1);
-    Emit(kArmVmovF64U32U32, g.DefineAsRegister(node), g.UseRegister(right),
-         g.UseRegister(left));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    if (left->opcode() == IrOpcode::kFloat64InsertHighWord32 &&
+        CanCover(node, left)) {
+      left = left->InputAt(1);
+      Emit(kArmVmovF64U32U32, g.DefineAsRegister(node), g.UseRegister(right),
+           g.UseRegister(left));
+      return;
+    }
+    Emit(kArmVmovLowF64U32, g.DefineSameAsFirst(node), g.UseRegister(left),
+         g.UseRegister(right));
   }
-  Emit(kArmVmovLowF64U32, g.DefineSameAsFirst(node), g.UseRegister(left),
-       g.UseRegister(right));
 }
 
-void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
-  ArmOperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (left->opcode() == IrOpcode::kFloat64InsertLowWord32 &&
-      CanCover(node, left)) {
-    left = left->InputAt(1);
-    Emit(kArmVmovF64U32U32, g.DefineAsRegister(node), g.UseRegister(left),
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    if (left->opcode() == IrOpcode::kFloat64InsertLowWord32 &&
+        CanCover(node, left)) {
+      left = left->InputAt(1);
+      Emit(kArmVmovF64U32U32, g.DefineAsRegister(node), g.UseRegister(left),
+           g.UseRegister(right));
+      return;
+    }
+    Emit(kArmVmovHighF64U32, g.DefineSameAsFirst(node), g.UseRegister(left),
          g.UseRegister(right));
-    return;
   }
-  Emit(kArmVmovHighF64U32, g.DefineSameAsFirst(node), g.UseRegister(left),
-       g.UseRegister(right));
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32PairToFloat64(
+    node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
   // Use DMB ISH for both acquire-release and sequentially consistent barriers.
-  ArmOperandGenerator g(this);
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmDmbIsh, g.NoOutput());
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
   // The memory order is ignored as both acquire and sequentially consistent
   // loads can emit LDR; DMB ISH.
   // https://www.cl.cam.ac.uk/~pes20/cpp/cpp0xmappings.html
   AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
   LoadRepresentation load_rep = atomic_load_params.representation();
-  ArmOperandGenerator g(this);
+  ArmOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   ArchOpcode opcode;
@@ -2328,14 +2715,20 @@ void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
        g.DefineAsRegister(node), g.UseRegister(base), g.UseRegister(index));
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
-  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
-  VisitStoreCommon(this, node, store_params.store_representation(),
-                   store_params.order());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
+    VisitStoreCommon(this, node, store_params.store_representation(),
+                     store_params.order());
+  }
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2368,8 +2761,10 @@ void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
   Emit(code, 1, outputs, input_count, inputs, arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -2405,10 +2800,17 @@ void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
   Emit(code, 1, outputs, input_count, inputs, arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode, ArchOpcode, ArchOpcode, ArchOpcode, ArchOpcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32AtomicBinaryOperation(
     Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
-  ArmOperandGenerator g(this);
+  ArmOperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2442,11 +2844,12 @@ void InstructionSelector::VisitWord32AtomicBinaryOperation(
   Emit(code, 1, outputs, input_count, inputs, arraysize(temps), temps);
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                            \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) { \
+    VisitWord32AtomicBinaryOperation(                                     \
+        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16,  \
+        kAtomic##op##Uint16, kAtomic##op##Word32);                        \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -2455,8 +2858,9 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitWord32AtomicPairLoad(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairLoad(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   InstructionOperand inputs[3];
@@ -2489,8 +2893,9 @@ void InstructionSelector::VisitWord32AtomicPairLoad(Node* node) {
        temp_count, temps);
 }
 
-void InstructionSelector::VisitWord32AtomicPairStore(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairStore(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value_low = node->InputAt(2);
@@ -2506,28 +2911,34 @@ void InstructionSelector::VisitWord32AtomicPairStore(Node* node) {
   Emit(code, 0, nullptr, arraysize(inputs), inputs, arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitWord32AtomicPairAdd(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairAdd(Node* node) {
   VisitPairAtomicBinOp(this, node, kArmWord32AtomicPairAdd);
 }
 
-void InstructionSelector::VisitWord32AtomicPairSub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairSub(Node* node) {
   VisitPairAtomicBinOp(this, node, kArmWord32AtomicPairSub);
 }
 
-void InstructionSelector::VisitWord32AtomicPairAnd(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairAnd(Node* node) {
   VisitPairAtomicBinOp(this, node, kArmWord32AtomicPairAnd);
 }
 
-void InstructionSelector::VisitWord32AtomicPairOr(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairOr(Node* node) {
   VisitPairAtomicBinOp(this, node, kArmWord32AtomicPairOr);
 }
 
-void InstructionSelector::VisitWord32AtomicPairXor(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairXor(Node* node) {
   VisitPairAtomicBinOp(this, node, kArmWord32AtomicPairXor);
 }
 
-void InstructionSelector::VisitWord32AtomicPairExchange(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairExchange(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2560,8 +2971,10 @@ void InstructionSelector::VisitWord32AtomicPairExchange(Node* node) {
        temps);
 }
 
-void InstructionSelector::VisitWord32AtomicPairCompareExchange(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairCompareExchange(
+    Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   AddressingMode addressing_mode = kMode_Offset_RR;
   InstructionOperand inputs[] = {g.UseFixed(node->InputAt(2), r4),
                                  g.UseFixed(node->InputAt(3), r5),
@@ -2737,22 +3150,25 @@ void InstructionSelector::VisitWord32AtomicPairCompareExchange(Node* node) {
   V(S128Xor, kArmS128Xor)                             \
   V(S128AndNot, kArmS128AndNot)
 
-void InstructionSelector::VisitI32x4DotI16x8S(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI16x8S(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmI32x4DotI16x8S, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)),
        g.UseUniqueRegister(node->InputAt(1)));
 }
 
-void InstructionSelector::VisitI16x8DotI8x16I7x16S(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8DotI8x16I7x16S(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmI16x8DotI8x16S, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)),
        g.UseUniqueRegister(node->InputAt(1)));
 }
 
-void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI8x16I7x16AddS(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kArmI32x4DotI8x16AddS, g.DefineSameAsInput(node, 2),
        g.UseUniqueRegister(node->InputAt(0)),
@@ -2760,8 +3176,9 @@ void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
        g.UseUniqueRegister(node->InputAt(2)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitS128Const(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   uint32_t val[kSimd128Size / sizeof(uint32_t)];
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
   // If all bytes are zeros, avoid emitting code for generic constants.
@@ -2779,22 +3196,26 @@ void InstructionSelector::VisitS128Const(Node* node) {
   }
 }
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmS128Zero, g.DefineAsRegister(node));
 }
 
-#define SIMD_VISIT_SPLAT(Type)                               \
-  void InstructionSelector::Visit##Type##Splat(Node* node) { \
-    VisitRR(this, kArm##Type##Splat, node);                  \
+#define SIMD_VISIT_SPLAT(Type)                                         \
+  template <typename Adapter>                                          \
+  void InstructionSelectorT<Adapter>::Visit##Type##Splat(Node* node) { \
+    VisitRR(this, kArm##Type##Splat, node);                            \
   }
 SIMD_TYPE_LIST(SIMD_VISIT_SPLAT)
 SIMD_VISIT_SPLAT(F64x2)
 #undef SIMD_VISIT_SPLAT
 
-#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                              \
-  void InstructionSelector::Visit##Type##ExtractLane##Sign(Node* node) { \
-    VisitRRI(this, kArm##Type##ExtractLane##Sign, node);                 \
+#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                           \
+  template <typename Adapter>                                         \
+  void InstructionSelectorT<Adapter>::Visit##Type##ExtractLane##Sign( \
+      Node* node) {                                                   \
+    VisitRRI(this, kArm##Type##ExtractLane##Sign, node);              \
   }
 SIMD_VISIT_EXTRACT_LANE(F64x2, )
 SIMD_VISIT_EXTRACT_LANE(F32x4, )
@@ -2805,92 +3226,99 @@ SIMD_VISIT_EXTRACT_LANE(I8x16, U)
 SIMD_VISIT_EXTRACT_LANE(I8x16, S)
 #undef SIMD_VISIT_EXTRACT_LANE
 
-#define SIMD_VISIT_REPLACE_LANE(Type)                              \
-  void InstructionSelector::Visit##Type##ReplaceLane(Node* node) { \
-    VisitRRIR(this, kArm##Type##ReplaceLane, node);                \
+#define SIMD_VISIT_REPLACE_LANE(Type)                                        \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##ReplaceLane(Node* node) { \
+    VisitRRIR(this, kArm##Type##ReplaceLane, node);                          \
   }
 SIMD_TYPE_LIST(SIMD_VISIT_REPLACE_LANE)
 SIMD_VISIT_REPLACE_LANE(F64x2)
 #undef SIMD_VISIT_REPLACE_LANE
 #undef SIMD_TYPE_LIST
 
-#define SIMD_VISIT_UNOP(Name, instruction)            \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, instruction, node);                 \
+#define SIMD_VISIT_UNOP(Name, instruction)                      \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRR(this, instruction, node);                           \
   }
 SIMD_UNOP_LIST(SIMD_VISIT_UNOP)
 #undef SIMD_VISIT_UNOP
 #undef SIMD_UNOP_LIST
 
-#define SIMD_VISIT_SHIFT_OP(Name, width)              \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitSimdShiftRRR(this, kArm##Name, node, width); \
+#define SIMD_VISIT_SHIFT_OP(Name, width)                        \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitSimdShiftRRR(this, kArm##Name, node, width);           \
   }
 SIMD_SHIFT_OP_LIST(SIMD_VISIT_SHIFT_OP)
 #undef SIMD_VISIT_SHIFT_OP
 #undef SIMD_SHIFT_OP_LIST
 
-#define SIMD_VISIT_BINOP(Name, instruction)           \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRR(this, instruction, node);                \
+#define SIMD_VISIT_BINOP(Name, instruction)                     \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRRR(this, instruction, node);                          \
   }
 SIMD_BINOP_LIST(SIMD_VISIT_BINOP)
 #undef SIMD_VISIT_BINOP
 #undef SIMD_BINOP_LIST
 
-#define VISIT_SIMD_ADD(Type, PairwiseType, NeonWidth)             \
-  void InstructionSelector::Visit##Type##Add(Node* node) {        \
-    ArmOperandGenerator g(this);                                  \
-    Node* left = node->InputAt(0);                                \
-    Node* right = node->InputAt(1);                               \
-    if (left->opcode() ==                                         \
-            IrOpcode::k##Type##ExtAddPairwise##PairwiseType##S && \
-        CanCover(node, left)) {                                   \
-      Emit(kArmVpadal | MiscField::encode(NeonS##NeonWidth),      \
-           g.DefineSameAsFirst(node), g.UseRegister(right),       \
-           g.UseRegister(left->InputAt(0)));                      \
-      return;                                                     \
-    }                                                             \
-    if (left->opcode() ==                                         \
-            IrOpcode::k##Type##ExtAddPairwise##PairwiseType##U && \
-        CanCover(node, left)) {                                   \
-      Emit(kArmVpadal | MiscField::encode(NeonU##NeonWidth),      \
-           g.DefineSameAsFirst(node), g.UseRegister(right),       \
-           g.UseRegister(left->InputAt(0)));                      \
-      return;                                                     \
-    }                                                             \
-    if (right->opcode() ==                                        \
-            IrOpcode::k##Type##ExtAddPairwise##PairwiseType##S && \
-        CanCover(node, right)) {                                  \
-      Emit(kArmVpadal | MiscField::encode(NeonS##NeonWidth),      \
-           g.DefineSameAsFirst(node), g.UseRegister(left),        \
-           g.UseRegister(right->InputAt(0)));                     \
-      return;                                                     \
-    }                                                             \
-    if (right->opcode() ==                                        \
-            IrOpcode::k##Type##ExtAddPairwise##PairwiseType##U && \
-        CanCover(node, right)) {                                  \
-      Emit(kArmVpadal | MiscField::encode(NeonU##NeonWidth),      \
-           g.DefineSameAsFirst(node), g.UseRegister(left),        \
-           g.UseRegister(right->InputAt(0)));                     \
-      return;                                                     \
-    }                                                             \
-    VisitRRR(this, kArm##Type##Add, node);                        \
+#define VISIT_SIMD_ADD(Type, PairwiseType, NeonWidth)                \
+  template <typename Adapter>                                        \
+  void InstructionSelectorT<Adapter>::Visit##Type##Add(Node* node) { \
+    ArmOperandGeneratorT<Adapter> g(this);                           \
+    Node* left = node->InputAt(0);                                   \
+    Node* right = node->InputAt(1);                                  \
+    if (left->opcode() ==                                            \
+            IrOpcode::k##Type##ExtAddPairwise##PairwiseType##S &&    \
+        CanCover(node, left)) {                                      \
+      Emit(kArmVpadal | MiscField::encode(NeonS##NeonWidth),         \
+           g.DefineSameAsFirst(node), g.UseRegister(right),          \
+           g.UseRegister(left->InputAt(0)));                         \
+      return;                                                        \
+    }                                                                \
+    if (left->opcode() ==                                            \
+            IrOpcode::k##Type##ExtAddPairwise##PairwiseType##U &&    \
+        CanCover(node, left)) {                                      \
+      Emit(kArmVpadal | MiscField::encode(NeonU##NeonWidth),         \
+           g.DefineSameAsFirst(node), g.UseRegister(right),          \
+           g.UseRegister(left->InputAt(0)));                         \
+      return;                                                        \
+    }                                                                \
+    if (right->opcode() ==                                           \
+            IrOpcode::k##Type##ExtAddPairwise##PairwiseType##S &&    \
+        CanCover(node, right)) {                                     \
+      Emit(kArmVpadal | MiscField::encode(NeonS##NeonWidth),         \
+           g.DefineSameAsFirst(node), g.UseRegister(left),           \
+           g.UseRegister(right->InputAt(0)));                        \
+      return;                                                        \
+    }                                                                \
+    if (right->opcode() ==                                           \
+            IrOpcode::k##Type##ExtAddPairwise##PairwiseType##U &&    \
+        CanCover(node, right)) {                                     \
+      Emit(kArmVpadal | MiscField::encode(NeonU##NeonWidth),         \
+           g.DefineSameAsFirst(node), g.UseRegister(left),           \
+           g.UseRegister(right->InputAt(0)));                        \
+      return;                                                        \
+    }                                                                \
+    VisitRRR(this, kArm##Type##Add, node);                           \
   }
 
 VISIT_SIMD_ADD(I16x8, I8x16, 8)
 VISIT_SIMD_ADD(I32x4, I16x8, 16)
 #undef VISIT_SIMD_ADD
 
-void InstructionSelector::VisitI64x2SplatI32Pair(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2SplatI32Pair(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   InstructionOperand operand1 = g.UseRegister(node->InputAt(1));
   Emit(kArmI64x2SplatI32Pair, g.DefineAsRegister(node), operand0, operand1);
 }
 
-void InstructionSelector::VisitI64x2ReplaceLaneI32Pair(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ReplaceLaneI32Pair(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   InstructionOperand operand = g.UseRegister(node->InputAt(0));
   InstructionOperand lane = g.UseImmediate(OpParameter<int32_t>(node->op()));
   InstructionOperand low = g.UseRegister(node->InputAt(1));
@@ -2899,66 +3327,76 @@ void InstructionSelector::VisitI64x2ReplaceLaneI32Pair(Node* node) {
        low, high);
 }
 
-void InstructionSelector::VisitI64x2Neg(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Neg(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmI64x2Neg, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI64x2Mul(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Mul(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kArmI64x2Mul, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)),
        g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitF32x4Sqrt(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Sqrt(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   // Use fixed registers in the lower 8 Q-registers so we can directly access
   // mapped registers S0-S31.
   Emit(kArmF32x4Sqrt, g.DefineAsFixed(node, q0),
        g.UseFixed(node->InputAt(0), q0));
 }
 
-void InstructionSelector::VisitF32x4Div(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Div(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   // Use fixed registers in the lower 8 Q-registers so we can directly access
   // mapped registers S0-S31.
   Emit(kArmF32x4Div, g.DefineAsFixed(node, q0),
        g.UseFixed(node->InputAt(0), q0), g.UseFixed(node->InputAt(1), q1));
 }
 
-void InstructionSelector::VisitS128Select(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmS128Select, g.DefineSameAsFirst(node),
        g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
        g.UseRegister(node->InputAt(2)));
 }
 
-void InstructionSelector::VisitI8x16RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI16x8RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI32x4RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI64x2RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-#define VISIT_SIMD_QFMOP(op)                        \
-  void InstructionSelector::Visit##op(Node* node) { \
-    ArmOperandGenerator g(this);                    \
-    Emit(kArm##op, g.DefineAsRegister(node),        \
-         g.UseUniqueRegister(node->InputAt(0)),     \
-         g.UseUniqueRegister(node->InputAt(1)),     \
-         g.UseUniqueRegister(node->InputAt(2)));    \
+#define VISIT_SIMD_QFMOP(op)                                  \
+  template <typename Adapter>                                 \
+  void InstructionSelectorT<Adapter>::Visit##op(Node* node) { \
+    ArmOperandGeneratorT<Adapter> g(this);                    \
+    Emit(kArm##op, g.DefineAsRegister(node),                  \
+         g.UseUniqueRegister(node->InputAt(0)),               \
+         g.UseUniqueRegister(node->InputAt(1)),               \
+         g.UseUniqueRegister(node->InputAt(2)));              \
   }
 VISIT_SIMD_QFMOP(F64x2Qfma)
 VISIT_SIMD_QFMOP(F64x2Qfms)
@@ -3040,8 +3478,10 @@ bool TryMatchArchShuffle(const uint8_t* shuffle, const ShuffleEntry* table,
   return false;
 }
 
-void ArrangeShuffleTable(ArmOperandGenerator* g, Node* input0, Node* input1,
-                         InstructionOperand* src0, InstructionOperand* src1) {
+template <typename Adapter>
+void ArrangeShuffleTable(ArmOperandGeneratorT<Adapter>* g, Node* input0,
+                         Node* input1, InstructionOperand* src0,
+                         InstructionOperand* src1) {
   if (input0 == input1) {
     // Unary, any q-register can be the table.
     *src0 = *src1 = g->UseRegister(input0);
@@ -3054,14 +3494,15 @@ void ArrangeShuffleTable(ArmOperandGenerator* g, Node* input0, Node* input1,
 
 }  // namespace
 
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
   Node* input0 = node->InputAt(0);
   Node* input1 = node->InputAt(1);
   uint8_t shuffle32x4[4];
-  ArmOperandGenerator g(this);
+  ArmOperandGeneratorT<Adapter> g(this);
   int index = 0;
   if (wasm::SimdShuffle::TryMatch32x4Shuffle(shuffle, shuffle32x4)) {
     if (wasm::SimdShuffle::TryMatchSplat<4>(shuffle, &index)) {
@@ -3114,67 +3555,88 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
        g.UseImmediate(wasm::SimdShuffle::Pack4Lanes(shuffle + 12)));
 }
 #else
-void InstructionSelector::VisitI8x16Shuffle(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
+  UNREACHABLE();
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void InstructionSelector::VisitI8x16Swizzle(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   // We don't want input 0 (the table) to be the same as output, since we will
   // modify output twice (low and high), and need to keep the table the same.
   Emit(kArmI8x16Swizzle, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt32(Node* node) {
-  ArmOperandGenerator g(this);
-  Emit(kArmSxtb, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
-       g.TempImmediate(0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Emit(kArmSxtb, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
+         g.TempImmediate(0));
+  }
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt32(Node* node) {
-  ArmOperandGenerator g(this);
-  Emit(kArmSxth, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
-       g.TempImmediate(0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
+    Emit(kArmSxth, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
+         g.TempImmediate(0));
+  }
 }
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
 namespace {
-template <ArchOpcode opcode>
-void VisitBitMask(InstructionSelector* selector, Node* node) {
-  ArmOperandGenerator g(selector);
+template <typename Adapter, ArchOpcode opcode>
+void VisitBitMask(InstructionSelectorT<Adapter>* selector, Node* node) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), arraysize(temps), temps);
 }
 }  // namespace
 
-void InstructionSelector::VisitI8x16BitMask(Node* node) {
-  VisitBitMask<kArmI8x16BitMask>(this, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16BitMask(Node* node) {
+  VisitBitMask<Adapter, kArmI8x16BitMask>(this, node);
 }
 
-void InstructionSelector::VisitI16x8BitMask(Node* node) {
-  VisitBitMask<kArmI16x8BitMask>(this, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8BitMask(Node* node) {
+  VisitBitMask<Adapter, kArmI16x8BitMask>(this, node);
 }
 
-void InstructionSelector::VisitI32x4BitMask(Node* node) {
-  VisitBitMask<kArmI32x4BitMask>(this, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4BitMask(Node* node) {
+  VisitBitMask<Adapter, kArmI32x4BitMask>(this, node);
 }
 
-void InstructionSelector::VisitI64x2BitMask(Node* node) {
-  VisitBitMask<kArmI64x2BitMask>(this, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2BitMask(Node* node) {
+  VisitBitMask<Adapter, kArmI64x2BitMask>(this, node);
 }
 
 namespace {
-void VisitF32x4PminOrPmax(InstructionSelector* selector, ArchOpcode opcode,
-                          Node* node) {
-  ArmOperandGenerator g(selector);
+template <typename Adapter>
+void VisitF32x4PminOrPmax(InstructionSelectorT<Adapter>* selector,
+                          ArchOpcode opcode, Node* node) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   // Need all unique registers because we first compare the two inputs, then we
   // need the inputs to remain unchanged for the bitselect later.
   selector->Emit(opcode, g.DefineAsRegister(node),
@@ -3182,36 +3644,43 @@ void VisitF32x4PminOrPmax(InstructionSelector* selector, ArchOpcode opcode,
                  g.UseUniqueRegister(node->InputAt(1)));
 }
 
-void VisitF64x2PminOrPMax(InstructionSelector* selector, ArchOpcode opcode,
-                          Node* node) {
-  ArmOperandGenerator g(selector);
+template <typename Adapter>
+void VisitF64x2PminOrPMax(InstructionSelectorT<Adapter>* selector,
+                          ArchOpcode opcode, Node* node) {
+  ArmOperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineSameAsFirst(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
 }
 }  // namespace
 
-void InstructionSelector::VisitF32x4Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmin(Node* node) {
   VisitF32x4PminOrPmax(this, kArmF32x4Pmin, node);
 }
 
-void InstructionSelector::VisitF32x4Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmax(Node* node) {
   VisitF32x4PminOrPmax(this, kArmF32x4Pmax, node);
 }
 
-void InstructionSelector::VisitF64x2Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmin(Node* node) {
   VisitF64x2PminOrPMax(this, kArmF64x2Pmin, node);
 }
 
-void InstructionSelector::VisitF64x2Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmax(Node* node) {
   VisitF64x2PminOrPMax(this, kArmF64x2Pmax, node);
 }
 
-void InstructionSelector::VisitF64x2RelaxedMin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2RelaxedMin(Node* node) {
   VisitF64x2Pmin(node);
 }
 
-void InstructionSelector::VisitF64x2RelaxedMax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2RelaxedMax(Node* node) {
   VisitF64x2Pmax(node);
 }
 
@@ -3229,9 +3698,10 @@ void InstructionSelector::VisitF64x2RelaxedMax(Node* node) {
   V(I64x2ExtMulLowI32x4U, kArmVmullLow, NeonU32)   \
   V(I64x2ExtMulHighI32x4U, kArmVmullHigh, NeonU32)
 
-#define VISIT_EXT_MUL(OPCODE, VMULL, NEONSIZE)                 \
-  void InstructionSelector::Visit##OPCODE(Node* node) {        \
-    VisitRRR(this, VMULL | MiscField::encode(NEONSIZE), node); \
+#define VISIT_EXT_MUL(OPCODE, VMULL, NEONSIZE)                    \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE(Node* node) { \
+    VisitRRR(this, VMULL | MiscField::encode(NEONSIZE), node);    \
   }
 
 EXT_MUL_LIST(VISIT_EXT_MUL)
@@ -3240,7 +3710,8 @@ EXT_MUL_LIST(VISIT_EXT_MUL)
 #undef EXT_MUL_LIST
 
 #define VISIT_EXTADD_PAIRWISE(OPCODE, NEONSIZE)                    \
-  void InstructionSelector::Visit##OPCODE(Node* node) {            \
+  template <typename Adapter>                                      \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE(Node* node) {  \
     VisitRR(this, kArmVpaddl | MiscField::encode(NEONSIZE), node); \
   }
 VISIT_EXTADD_PAIRWISE(I16x8ExtAddPairwiseI8x16S, NeonS8)
@@ -3249,83 +3720,116 @@ VISIT_EXTADD_PAIRWISE(I32x4ExtAddPairwiseI16x8S, NeonS16)
 VISIT_EXTADD_PAIRWISE(I32x4ExtAddPairwiseI16x8U, NeonU16)
 #undef VISIT_EXTADD_PAIRWISE
 
-void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
 
-  InstructionCode opcode = kArmVcvtS32F32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
-  }
+    InstructionCode opcode = kArmVcvtS32F32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
 
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArmOperandGeneratorT<Adapter> g(this);
 
-  InstructionCode opcode = kArmVcvtU32F32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
-  }
+    InstructionCode opcode = kArmVcvtU32F32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
 
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+  }
 }
 
 // TODO(v8:9780)
 // These double precision conversion instructions need a low Q register (q0-q7)
 // because the codegen accesses the S registers they overlap with.
-void InstructionSelector::VisitF64x2ConvertLowI32x4S(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2ConvertLowI32x4S(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmF64x2ConvertLowI32x4S, g.DefineAsRegister(node),
        g.UseFixed(node->InputAt(0), q0));
 }
 
-void InstructionSelector::VisitF64x2ConvertLowI32x4U(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2ConvertLowI32x4U(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmF64x2ConvertLowI32x4U, g.DefineAsRegister(node),
        g.UseFixed(node->InputAt(0), q0));
 }
 
-void InstructionSelector::VisitI32x4TruncSatF64x2SZero(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4TruncSatF64x2SZero(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmI32x4TruncSatF64x2SZero, g.DefineAsFixed(node, q0),
        g.UseUniqueRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI32x4TruncSatF64x2UZero(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4TruncSatF64x2UZero(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmI32x4TruncSatF64x2UZero, g.DefineAsFixed(node, q0),
        g.UseUniqueRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitF32x4DemoteF64x2Zero(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4DemoteF64x2Zero(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmF32x4DemoteF64x2Zero, g.DefineAsFixed(node, q0),
        g.UseUniqueRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitF64x2PromoteLowF32x4(Node* node) {
-  ArmOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2PromoteLowF32x4(Node* node) {
+  ArmOperandGeneratorT<Adapter> g(this);
   Emit(kArmF64x2PromoteLowF32x4, g.DefineAsRegister(node),
        g.UseFixed(node->InputAt(0), q0));
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF64x2SZero(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF64x2SZero(
+    Node* node) {
   VisitI32x4TruncSatF64x2SZero(node);
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF64x2UZero(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF64x2UZero(
+    Node* node) {
   VisitI32x4TruncSatF64x2UZero(node);
 }
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGenerator* g, int first_input_index, node_t node) {
   UNREACHABLE();
 }
 
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
+
+template <>
+TurboshaftAdapter::node_t
+InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    node_t node, size_t projection_index) {
+  UNIMPLEMENTED();
+}
+
 // static
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
@@ -3364,6 +3868,11 @@ InstructionSelector::AlignmentRequirements() {
       SomeUnalignedAccessUnsupported(req_aligned, req_aligned);
 }
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/arm64/code-generator-arm64.cc b/deps/v8/src/compiler/backend/arm64/code-generator-arm64.cc
index 22f52dfcb651f9..c25312d986a40d 100644
--- a/deps/v8/src/compiler/backend/arm64/code-generator-arm64.cc
+++ b/deps/v8/src/compiler/backend/arm64/code-generator-arm64.cc
@@ -64,9 +64,13 @@ class Arm64OperandConverter final : public InstructionOperandConverter {
 
   size_t OutputCount() { return instr_->OutputCount(); }
 
-  DoubleRegister OutputFloat32Register() { return OutputDoubleRegister().S(); }
+  DoubleRegister OutputFloat32Register(size_t index = 0) {
+    return OutputDoubleRegister(index).S();
+  }
 
-  DoubleRegister OutputFloat64Register() { return OutputDoubleRegister(); }
+  DoubleRegister OutputFloat64Register(size_t index = 0) {
+    return OutputDoubleRegister(index);
+  }
 
   DoubleRegister OutputSimd128Register() { return OutputDoubleRegister().Q(); }
 
@@ -104,9 +108,11 @@ class Arm64OperandConverter final : public InstructionOperandConverter {
     return ToOperand32(instr_->InputAt(index));
   }
 
-  Register OutputRegister64() { return OutputRegister(); }
+  Register OutputRegister64(size_t index = 0) { return OutputRegister(index); }
 
-  Register OutputRegister32() { return OutputRegister().W(); }
+  Register OutputRegister32(size_t index = 0) {
+    return OutputRegister(index).W();
+  }
 
   Register TempRegister32(size_t index) {
     return ToRegister(instr_->TempAt(index)).W();
@@ -296,11 +302,16 @@ class OutOfLineRecordWrite final : public OutOfLineCode {
   }
 
   void Generate() final {
-    if (COMPRESS_POINTERS_BOOL) {
+    // When storing an indirect pointer, the value will always be a
+    // full/decompressed pointer.
+    if (COMPRESS_POINTERS_BOOL &&
+        mode_ != RecordWriteMode::kValueIsIndirectPointer) {
       __ DecompressTagged(value_, value_);
     }
+
     __ CheckPageFlag(value_, MemoryChunk::kPointersToHereAreInterestingMask, eq,
                      exit());
+
     SaveFPRegsMode const save_fp_mode = frame()->DidAllocateDoubleRegisters()
                                             ? SaveFPRegsMode::kSave
                                             : SaveFPRegsMode::kIgnore;
@@ -311,6 +322,10 @@ class OutOfLineRecordWrite final : public OutOfLineCode {
     }
     if (mode_ == RecordWriteMode::kValueIsEphemeronKey) {
       __ CallEphemeronKeyBarrier(object_, offset_, save_fp_mode);
+    } else if (mode_ == RecordWriteMode::kValueIsIndirectPointer) {
+      __ CallRecordWriteStubSaveRegisters(object_, offset_, save_fp_mode,
+                                          StubCallMode::kCallBuiltinPointer,
+                                          PointerType::kIndirect);
 #if V8_ENABLE_WEBASSEMBLY
     } else if (stub_mode_ == StubCallMode::kCallWasmRuntimeStub) {
       // A direct call to a wasm runtime stub defined in this module.
@@ -413,36 +428,11 @@ class WasmOutOfLineTrap : public OutOfLineCode {
 
  private:
   void GenerateCallToTrap(TrapId trap_id) {
-    if (!gen_->wasm_runtime_exception_support()) {
-      // We cannot test calls to the runtime in cctest/test-run-wasm.
-      // Therefore we emit a call to C here instead of a call to the runtime.
-      __ CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(),
-                       0);
-      __ LeaveFrame(StackFrame::WASM);
-      auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-      int pop_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-      pop_count += (pop_count & 1);  // align
-      __ Drop(pop_count);
-      __ Ret();
-    } else {
-      gen_->AssembleSourcePosition(instr_);
-      // A direct call to a wasm runtime stub defined in this module.
-      // Just encode the stub index. This will be patched when the code
-      // is added to the native module and copied into wasm code space.
-      if (gen_->IsWasm() || PointerCompressionIsEnabled()) {
-        __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-      } else {
-        // For wasm traps inlined into JavaScript force indirect call if pointer
-        // compression is disabled as it can't be guaranteed that the built-in's
-        // address is close enough for a near call.
-        __ IndirectCall(static_cast<Address>(trap_id),
-                        RelocInfo::WASM_STUB_CALL);
-      }
-      ReferenceMap* reference_map =
-          gen_->zone()->New<ReferenceMap>(gen_->zone());
-      gen_->RecordSafepoint(reference_map);
-      __ AssertUnreachable(AbortReason::kUnexpectedReturnFromWasmTrap);
-    }
+    gen_->AssembleSourcePosition(instr_);
+    __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+    ReferenceMap* reference_map = gen_->zone()->New<ReferenceMap>(gen_->zone());
+    gen_->RecordSafepoint(reference_map);
+    __ AssertUnreachable(AbortReason::kUnexpectedReturnFromWasmTrap);
   }
 
   Instruction* instr_;
@@ -775,7 +765,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchCallBuiltinPointer: {
       DCHECK(!instr->InputAt(0)->IsImmediate());
       Register builtin_index = i.InputRegister(0);
-      __ CallBuiltinByIndex(builtin_index);
+      Register target =
+          instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister)
+              ? kJavaScriptCallCodeStartRegister
+              : builtin_index;
+      __ CallBuiltinByIndex(builtin_index, target);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -853,9 +847,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ cmp(cp, temp);
         __ Assert(eq, AbortReason::kWrongFunctionContext);
       }
-      static_assert(kJavaScriptCallCodeStartRegister == x2, "ABI mismatch");
-      __ LoadTaggedField(x2, FieldMemOperand(func, JSFunction::kCodeOffset));
-      __ CallCodeObject(x2);
+      __ CallJSFunction(func);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -1024,6 +1016,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       break;
     case kArchStoreWithWriteBarrier: {
       RecordWriteMode mode = RecordWriteModeField::decode(instr->opcode());
+      // Indirect pointer writes must use a different opcode.
+      DCHECK_NE(mode, RecordWriteMode::kValueIsIndirectPointer);
       AddressingMode addressing_mode =
           AddressingModeField::decode(instr->opcode());
       Register object = i.InputRegister(0);
@@ -1048,7 +1042,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           &unwinding_info_writer_);
       EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
       __ StoreTaggedField(value, MemOperand(object, offset));
-      if (mode > RecordWriteMode::kValueIsPointer) {
+      if (mode > RecordWriteMode::kValueIsIndirectPointer) {
         __ JumpIfSmi(value, ool->exit());
       }
       __ CheckPageFlag(object, MemoryChunk::kPointersFromHereAreInterestingMask,
@@ -1059,6 +1053,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchAtomicStoreWithWriteBarrier: {
       DCHECK_EQ(AddressingModeField::decode(instr->opcode()), kMode_MRR);
       RecordWriteMode mode = RecordWriteModeField::decode(instr->opcode());
+      // Indirect pointer writes must use a different opcode.
+      DCHECK_NE(mode, RecordWriteMode::kValueIsIndirectPointer);
       Register object = i.InputRegister(0);
       Register offset = i.InputRegister(1);
       Register value = i.InputRegister(2);
@@ -1066,7 +1062,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           this, object, offset, value, mode, DetermineStubCallMode(),
           &unwinding_info_writer_);
       __ AtomicStoreTaggedField(value, object, offset, i.TempRegister(0));
-      if (mode > RecordWriteMode::kValueIsPointer) {
+      // Skip the write barrier if the value is a Smi. However, this is only
+      // valid if the value isn't an indirect pointer. Otherwise the value will
+      // be a pointer table index, which will always look like a Smi (but
+      // actually reference a pointer in the pointer table).
+      if (mode > RecordWriteMode::kValueIsIndirectPointer) {
         __ JumpIfSmi(value, ool->exit());
       }
       __ CheckPageFlag(object, MemoryChunk::kPointersFromHereAreInterestingMask,
@@ -1074,6 +1074,31 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ Bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier: {
+      RecordWriteMode mode = RecordWriteModeField::decode(instr->opcode());
+      DCHECK_EQ(mode, RecordWriteMode::kValueIsIndirectPointer);
+      AddressingMode addressing_mode =
+          AddressingModeField::decode(instr->opcode());
+      Register object = i.InputRegister(0);
+      Operand offset(0);
+      if (addressing_mode == kMode_MRI) {
+        offset = Operand(i.InputInt64(1));
+      } else {
+        DCHECK_EQ(addressing_mode, kMode_MRR);
+        offset = Operand(i.InputRegister(1));
+      }
+      Register value = i.InputRegister(2);
+
+      auto ool = zone()->New<OutOfLineRecordWrite>(
+          this, object, offset, value, mode, DetermineStubCallMode(),
+          &unwinding_info_writer_);
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ StoreIndirectPointerField(value, MemOperand(object, offset));
+      __ CheckPageFlag(object, MemoryChunk::kPointersFromHereAreInterestingMask,
+                       ne, ool->entry());
+      __ Bind(ool->exit());
+      break;
+    }
     case kArchStackSlot: {
       FrameOffset offset =
           frame_access_state()->GetFrameOffset(i.InputInt32(0));
@@ -1977,6 +2002,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
       __ Str(i.InputOrZeroRegister32(0), i.MemoryOperand(1));
       break;
+    case kArm64StrWPair:
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ Stp(i.InputOrZeroRegister32(0), i.InputOrZeroRegister32(1),
+             i.MemoryOperand(2));
+      break;
     case kArm64Ldr:
       EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
       __ Ldr(i.OutputRegister(), i.MemoryOperand());
@@ -2004,6 +2034,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
       __ Str(i.InputOrZeroRegister64(0), i.MemoryOperand(1));
       break;
+    case kArm64StrPair:
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ Stp(i.InputOrZeroRegister64(0), i.InputOrZeroRegister64(1),
+             i.MemoryOperand(2));
+      break;
     case kArm64StrCompressTagged:
       EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
       __ StoreTaggedField(i.InputOrZeroRegister64(0), i.MemoryOperand(1));
@@ -2014,6 +2049,10 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ AtomicStoreTaggedField(i.InputRegister(2), i.InputRegister(0),
                                 i.InputRegister(1), i.TempRegister(0));
       break;
+    case kArm64StrIndirectPointer:
+      __ StoreIndirectPointerField(i.InputOrZeroRegister64(0),
+                                   i.MemoryOperand(1));
+      break;
     case kArm64StrEncodeSandboxedPointer:
       __ StoreSandboxedPointerField(i.InputOrZeroRegister64(0),
                                     i.MemoryOperand(1));
@@ -2594,19 +2633,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       SIMD_BINOP_LANE_SIZE_CASE(kArm64IGtU, Cmhi);
       SIMD_BINOP_LANE_SIZE_CASE(kArm64IGeU, Cmhs);
     case kArm64I32x4BitMask: {
-      UseScratchRegisterScope scope(masm());
-      Register dst = i.OutputRegister32();
-      VRegister src = i.InputSimd128Register(0);
-      VRegister tmp = scope.AcquireQ();
-      VRegister mask = scope.AcquireQ();
-
-      __ Sshr(tmp.V4S(), src.V4S(), 31);
-      // Set i-th bit of each lane i. When AND with tmp, the lanes that
-      // are signed will have i-th bit set, unsigned will be 0.
-      __ Movi(mask.V2D(), 0x0000'0008'0000'0004, 0x0000'0002'0000'0001);
-      __ And(tmp.V16B(), mask.V16B(), tmp.V16B());
-      __ Addv(tmp.S(), tmp.V4S());
-      __ Mov(dst.W(), tmp.V4S(), 0);
+      __ I32x4BitMask(i.OutputRegister32(), i.InputSimd128Register(0));
       break;
     }
     case kArm64I32x4DotI16x8S: {
@@ -2712,19 +2739,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       SIMD_BINOP_LANE_SIZE_CASE(kArm64ISubSatU, Uqsub);
       SIMD_BINOP_CASE(kArm64I16x8Q15MulRSatS, Sqrdmulh, 8H);
     case kArm64I16x8BitMask: {
-      UseScratchRegisterScope scope(masm());
-      Register dst = i.OutputRegister32();
-      VRegister src = i.InputSimd128Register(0);
-      VRegister tmp = scope.AcquireQ();
-      VRegister mask = scope.AcquireQ();
-
-      __ Sshr(tmp.V8H(), src.V8H(), 15);
-      // Set i-th bit of each lane i. When AND with tmp, the lanes that
-      // are signed will have i-th bit set, unsigned will be 0.
-      __ Movi(mask.V2D(), 0x0080'0040'0020'0010, 0x0008'0004'0002'0001);
-      __ And(tmp.V16B(), mask.V16B(), tmp.V16B());
-      __ Addv(tmp.H(), tmp.V8H());
-      __ Mov(dst.W(), tmp.V8H(), 0);
+      __ I16x8BitMask(i.OutputRegister32(), i.InputSimd128Register(0));
       break;
     }
     case kArm64I8x16Shl: {
@@ -2768,21 +2783,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       break;
     }
     case kArm64I8x16BitMask: {
-      UseScratchRegisterScope scope(masm());
-      Register dst = i.OutputRegister32();
-      VRegister src = i.InputSimd128Register(0);
-      VRegister tmp = scope.AcquireQ();
-      VRegister mask = scope.AcquireQ();
-
-      // Set i-th bit of each lane i. When AND with tmp, the lanes that
-      // are signed will have i-th bit set, unsigned will be 0.
-      __ Sshr(tmp.V16B(), src.V16B(), 7);
-      __ Movi(mask.V2D(), 0x8040'2010'0804'0201);
-      __ And(tmp.V16B(), mask.V16B(), tmp.V16B());
-      __ Ext(mask.V16B(), tmp.V16B(), tmp.V16B(), 8);
-      __ Zip1(tmp.V16B(), tmp.V16B(), mask.V16B());
-      __ Addv(tmp.H(), tmp.V8H());
-      __ Mov(dst.W(), tmp.V8H(), 0);
+      __ I8x16BitMask(i.OutputRegister32(), i.InputSimd128Register(0));
       break;
     }
     case kArm64S128Const: {
@@ -2790,11 +2791,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       uint64_t imm2 = make_uint64(i.InputUint32(3), i.InputUint32(2));
       __ Movi(i.OutputSimd128Register().V16B(), imm2, imm1);
       break;
-    }
-    case kArm64S128Zero: {
-      VRegister dst = i.OutputSimd128Register().V16B();
-      __ Eor(dst, dst, dst);
-      break;
     }
       SIMD_BINOP_CASE(kArm64S128And, And, 16B);
       SIMD_BINOP_CASE(kArm64S128Or, Orr, 16B);
@@ -3136,8 +3132,10 @@ void CodeGenerator::AssembleArchBoolean(Instruction* instr,
 void CodeGenerator::AssembleArchSelect(Instruction* instr,
                                        FlagsCondition condition) {
   Arm64OperandConverter i(this, instr);
+  // The result register is always the last output of the instruction.
+  size_t output_index = instr->OutputCount() - 1;
   MachineRepresentation rep =
-      LocationOperand::cast(instr->OutputAt(0))->representation();
+      LocationOperand::cast(instr->OutputAt(output_index))->representation();
   Condition cc = FlagsConditionToCondition(condition);
   // We don't now how many inputs were consumed by the condition, so we have to
   // calculate the indices of the last two inputs.
@@ -3145,14 +3143,22 @@ void CodeGenerator::AssembleArchSelect(Instruction* instr,
   size_t true_value_index = instr->InputCount() - 2;
   size_t false_value_index = instr->InputCount() - 1;
   if (rep == MachineRepresentation::kFloat32) {
-    __ Fcsel(i.OutputFloat32Register(),
+    __ Fcsel(i.OutputFloat32Register(output_index),
              i.InputFloat32Register(true_value_index),
              i.InputFloat32Register(false_value_index), cc);
-  } else {
-    DCHECK_EQ(rep, MachineRepresentation::kFloat64);
-    __ Fcsel(i.OutputFloat64Register(),
+  } else if (rep == MachineRepresentation::kFloat64) {
+    __ Fcsel(i.OutputFloat64Register(output_index),
              i.InputFloat64Register(true_value_index),
              i.InputFloat64Register(false_value_index), cc);
+  } else if (rep == MachineRepresentation::kWord32) {
+    __ Csel(i.OutputRegister32(output_index),
+            i.InputRegister32(true_value_index),
+            i.InputRegister32(false_value_index), cc);
+  } else {
+    DCHECK_EQ(rep, MachineRepresentation::kWord64);
+    __ Csel(i.OutputRegister64(output_index),
+            i.InputRegister64(true_value_index),
+            i.InputRegister64(false_value_index), cc);
   }
 }
 
@@ -3558,12 +3564,13 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 }
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
-  int new_slots = RoundUp<2>(ElementSizeInPointers(rep));
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = RoundUp<2>(ElementSizeInPointers(rep));
   Arm64OperandConverter g(this, nullptr);
   if (dest->IsRegister()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ Pop(g.ToRegister(dest), padreg);
   } else if (dest->IsStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     UseScratchRegisterScope temps(masm());
     Register scratch = temps.AcquireX();
     __ Pop(scratch, padreg);
@@ -3572,12 +3579,13 @@ void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ Add(sp, sp, Operand(new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ Add(sp, sp, Operand(dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
@@ -3692,16 +3700,16 @@ void CodeGenerator::SetPendingMove(MoveOperands* move) {
       move_cycle_.scratch_regs.set(temp);
     }
     int64_t src_offset = src.offset();
-    unsigned src_size = CalcLSDataSize(LDR_x);
+    unsigned src_size_log2 = CalcLSDataSizeLog2(LDR_x);
     int64_t dst_offset = dst.offset();
-    unsigned dst_size = CalcLSDataSize(STR_x);
+    unsigned dst_size_log2 = CalcLSDataSizeLog2(STR_x);
     // Offset doesn't fit into the immediate field so the assembler will emit
     // two instructions and use a second temp register.
     if ((src.IsImmediateOffset() &&
-         !masm()->IsImmLSScaled(src_offset, src_size) &&
+         !masm()->IsImmLSScaled(src_offset, src_size_log2) &&
          !masm()->IsImmLSUnscaled(src_offset)) ||
         (dst.IsImmediateOffset() &&
-         !masm()->IsImmLSScaled(dst_offset, dst_size) &&
+         !masm()->IsImmLSScaled(dst_offset, dst_size_log2) &&
          !masm()->IsImmLSUnscaled(dst_offset))) {
       Register temp = temps.AcquireX();
       move_cycle_.scratch_regs.set(temp);
diff --git a/deps/v8/src/compiler/backend/arm64/instruction-codes-arm64.h b/deps/v8/src/compiler/backend/arm64/instruction-codes-arm64.h
index 855a5cedcdbce5..6d05440c9a8591 100644
--- a/deps/v8/src/compiler/backend/arm64/instruction-codes-arm64.h
+++ b/deps/v8/src/compiler/backend/arm64/instruction-codes-arm64.h
@@ -36,12 +36,14 @@ namespace compiler {
   V(Arm64S128Load8x8U)                                     \
   V(Arm64StoreLane)                                        \
   V(Arm64Str)                                              \
+  V(Arm64StrPair)                                          \
   V(Arm64Strb)                                             \
   V(Arm64StrD)                                             \
   V(Arm64Strh)                                             \
   V(Arm64StrQ)                                             \
   V(Arm64StrS)                                             \
   V(Arm64StrW)                                             \
+  V(Arm64StrWPair)                                         \
   V(Arm64LdrDecompressTaggedSigned)                        \
   V(Arm64LdrDecompressTagged)                              \
   V(Arm64StrCompressTagged)                                \
@@ -204,6 +206,7 @@ namespace compiler {
   V(Arm64LdarDecompressTaggedSigned)                 \
   V(Arm64LdarDecompressTagged)                       \
   V(Arm64StlrCompressTagged)                         \
+  V(Arm64StrIndirectPointer)                         \
   V(Arm64LdrDecodeSandboxedPointer)                  \
   V(Arm64StrEncodeSandboxedPointer)                  \
   V(Arm64DmbIsh)                                     \
@@ -305,7 +308,6 @@ namespace compiler {
   V(Arm64I8x16UConvertI16x8)                         \
   V(Arm64I8x16BitMask)                               \
   V(Arm64S128Const)                                  \
-  V(Arm64S128Zero)                                   \
   V(Arm64S128Dup)                                    \
   V(Arm64S128And)                                    \
   V(Arm64S128Or)                                     \
diff --git a/deps/v8/src/compiler/backend/arm64/instruction-scheduler-arm64.cc b/deps/v8/src/compiler/backend/arm64/instruction-scheduler-arm64.cc
index dcfb0151f3fc58..a0c25795c76434 100644
--- a/deps/v8/src/compiler/backend/arm64/instruction-scheduler-arm64.cc
+++ b/deps/v8/src/compiler/backend/arm64/instruction-scheduler-arm64.cc
@@ -253,7 +253,6 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kArm64I8x16ShrU:
     case kArm64I8x16BitMask:
     case kArm64S128Const:
-    case kArm64S128Zero:
     case kArm64S128Dup:
     case kArm64S128And:
     case kArm64S128Or:
@@ -339,9 +338,12 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kArm64Strb:
     case kArm64Strh:
     case kArm64StrW:
+    case kArm64StrWPair:
     case kArm64Str:
+    case kArm64StrPair:
     case kArm64StrCompressTagged:
     case kArm64StlrCompressTagged:
+    case kArm64StrIndirectPointer:
     case kArm64StrEncodeSandboxedPointer:
     case kArm64DmbIsh:
     case kArm64DsbIsb:
diff --git a/deps/v8/src/compiler/backend/arm64/instruction-selector-arm64.cc b/deps/v8/src/compiler/backend/arm64/instruction-selector-arm64.cc
index f8cbca8b5e9796..2225f726707fb5 100644
--- a/deps/v8/src/compiler/backend/arm64/instruction-selector-arm64.cc
+++ b/deps/v8/src/compiler/backend/arm64/instruction-selector-arm64.cc
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 #include "src/base/bits.h"
+#include "src/base/logging.h"
 #include "src/codegen/assembler-inl.h"
 #include "src/codegen/machine-type.h"
 #include "src/common/globals.h"
@@ -12,6 +13,7 @@
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
+#include "src/compiler/turboshaft/operations.h"
 
 namespace v8 {
 namespace internal {
@@ -31,10 +33,13 @@ enum ImmediateMode {
 };
 
 // Adds Arm64-specific methods for generating operands.
-class Arm64OperandGenerator final : public OperandGenerator {
+template <typename Adapter>
+class Arm64OperandGeneratorT final : public OperandGeneratorT<Adapter> {
  public:
-  explicit Arm64OperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit Arm64OperandGeneratorT(InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
 
   InstructionOperand UseOperand(Node* node, ImmediateMode mode) {
     if (CanBeImmediate(node, mode)) {
@@ -119,7 +124,7 @@ class Arm64OperandGenerator final : public OperandGenerator {
       case kLogical32Imm:
         // TODO(dcarney): some unencodable values can be handled by
         // switching instructions.
-        return Assembler::IsImmLogical(static_cast<uint64_t>(value), 32,
+        return Assembler::IsImmLogical(static_cast<uint32_t>(value), 32,
                                        &ignored, &ignored, &ignored);
       case kLogical64Imm:
         return Assembler::IsImmLogical(static_cast<uint64_t>(value), 64,
@@ -162,37 +167,52 @@ class Arm64OperandGenerator final : public OperandGenerator {
 
 namespace {
 
-void VisitRR(InstructionSelector* selector, ArchOpcode opcode, Node* node) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitRR(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+             Node* node) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)));
 }
 
-void VisitRR(InstructionSelector* selector, InstructionCode opcode,
-             Node* node) {
-  Arm64OperandGenerator g(selector);
+template <typename T>
+void VisitRR(InstructionSelectorT<TurboshaftAdapter>*, InstructionCode, T) {
+  UNIMPLEMENTED();
+}
+
+void VisitRR(InstructionSelectorT<TurbofanAdapter>* selector,
+             InstructionCode opcode, Node* node) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)));
 }
 
-void VisitRRR(InstructionSelector* selector, ArchOpcode opcode, Node* node) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitRRR(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+              Node* node) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
 }
 
-void VisitRRR(InstructionSelector* selector, InstructionCode opcode,
-              Node* node) {
-  Arm64OperandGenerator g(selector);
+template <typename T>
+void VisitRRR(InstructionSelectorT<TurboshaftAdapter>*, InstructionCode, T) {
+  UNIMPLEMENTED();
+}
+
+void VisitRRR(InstructionSelectorT<TurbofanAdapter>* selector,
+              InstructionCode opcode, Node* node) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
 }
 
-void VisitSimdShiftRRR(InstructionSelector* selector, ArchOpcode opcode,
-                       Node* node, int width) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitSimdShiftRRR(InstructionSelectorT<Adapter>* selector,
+                       ArchOpcode opcode, Node* node, int width) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   if (g.IsIntegerConstant(node->InputAt(1))) {
     if (g.GetIntegerConstantValue(node->InputAt(1)) % width == 0) {
       selector->EmitIdentity(node);
@@ -208,33 +228,41 @@ void VisitSimdShiftRRR(InstructionSelector* selector, ArchOpcode opcode,
   }
 }
 
-void VisitRRI(InstructionSelector* selector, InstructionCode opcode,
+template <typename Adapter>
+void VisitRRI(InstructionSelectorT<Adapter>* selector, InstructionCode opcode,
               Node* node) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm));
 }
 
-void VisitRRO(InstructionSelector* selector, ArchOpcode opcode, Node* node,
-              ImmediateMode operand_mode) {
-  Arm64OperandGenerator g(selector);
-  selector->Emit(opcode, g.DefineAsRegister(node),
-                 g.UseRegister(node->InputAt(0)),
-                 g.UseOperand(node->InputAt(1), operand_mode));
+template <typename Adapter>
+void VisitRRO(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+              typename Adapter::node_t node, ImmediateMode operand_mode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(selector);
+    selector->Emit(opcode, g.DefineAsRegister(node),
+                   g.UseRegister(node->InputAt(0)),
+                   g.UseOperand(node->InputAt(1), operand_mode));
+  }
 }
 
-void VisitRRIR(InstructionSelector* selector, InstructionCode opcode,
+template <typename Adapter>
+void VisitRRIR(InstructionSelectorT<Adapter>* selector, InstructionCode opcode,
                Node* node) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm),
                  g.UseUniqueRegister(node->InputAt(1)));
 }
 
+template <typename Adapter>
 struct ExtendingLoadMatcher {
-  ExtendingLoadMatcher(Node* node, InstructionSelector* selector)
+  ExtendingLoadMatcher(Node* node, InstructionSelectorT<Adapter>* selector)
       : matches_(false), selector_(selector), base_(nullptr), immediate_(0) {
     Initialize(node);
   }
@@ -256,7 +284,7 @@ struct ExtendingLoadMatcher {
 
  private:
   bool matches_;
-  InstructionSelector* selector_;
+  InstructionSelectorT<Adapter>* selector_;
   Node* base_;
   int64_t immediate_;
   ArchOpcode opcode_;
@@ -269,7 +297,7 @@ struct ExtendingLoadMatcher {
     DCHECK(m.IsWord64Sar());
     if (m.left().IsLoad() && m.right().Is(32) &&
         selector_->CanCover(m.node(), m.left().node())) {
-      Arm64OperandGenerator g(selector_);
+      Arm64OperandGeneratorT<Adapter> g(selector_);
       Node* load = m.left().node();
       Node* offset = load->InputAt(1);
       base_ = load->InputAt(0);
@@ -282,14 +310,17 @@ struct ExtendingLoadMatcher {
   }
 };
 
-bool TryMatchExtendingLoad(InstructionSelector* selector, Node* node) {
-  ExtendingLoadMatcher m(node, selector);
+template <typename Adapter>
+bool TryMatchExtendingLoad(InstructionSelectorT<Adapter>* selector,
+                           Node* node) {
+  ExtendingLoadMatcher<Adapter> m(node, selector);
   return m.Matches();
 }
 
-bool TryEmitExtendingLoad(InstructionSelector* selector, Node* node) {
-  ExtendingLoadMatcher m(node, selector);
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+bool TryEmitExtendingLoad(InstructionSelectorT<Adapter>* selector, Node* node) {
+  ExtendingLoadMatcher<Adapter> m(node, selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   if (m.Matches()) {
     InstructionOperand inputs[2];
     inputs[0] = g.UseRegister(m.base());
@@ -305,10 +336,11 @@ bool TryEmitExtendingLoad(InstructionSelector* selector, Node* node) {
   return false;
 }
 
-bool TryMatchAnyShift(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+bool TryMatchAnyShift(InstructionSelectorT<Adapter>* selector, Node* node,
                       Node* input_node, InstructionCode* opcode, bool try_ror,
                       MachineRepresentation rep) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
 
   if (!selector->CanCover(node, input_node)) return false;
   if (input_node->InputCount() != 2) return false;
@@ -359,8 +391,10 @@ bool TryMatchAnyShift(InstructionSelector* selector, Node* node,
   }
 }
 
-bool TryMatchAnyExtend(Arm64OperandGenerator* g, InstructionSelector* selector,
-                       Node* node, Node* left_node, Node* right_node,
+template <typename Adapter>
+bool TryMatchAnyExtend(Arm64OperandGeneratorT<Adapter>* g,
+                       InstructionSelectorT<Adapter>* selector, Node* node,
+                       Node* left_node, Node* right_node,
                        InstructionOperand* left_op,
                        InstructionOperand* right_op, InstructionCode* opcode) {
   if (!selector->CanCover(node, right_node)) return false;
@@ -402,8 +436,9 @@ bool TryMatchAnyExtend(Arm64OperandGenerator* g, InstructionSelector* selector,
   return false;
 }
 
-bool TryMatchLoadStoreShift(Arm64OperandGenerator* g,
-                            InstructionSelector* selector,
+template <typename Adapter>
+bool TryMatchLoadStoreShift(Arm64OperandGeneratorT<Adapter>* g,
+                            InstructionSelectorT<Adapter>* selector,
                             MachineRepresentation rep, Node* node, Node* index,
                             InstructionOperand* index_op,
                             InstructionOperand* shift_immediate_op) {
@@ -491,11 +526,11 @@ uint8_t GetBinopProperties(InstructionCode opcode) {
 }
 
 // Shared routine for multiple binary operations.
-template <typename Matcher>
-void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter, typename Matcher>
+void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                 InstructionCode opcode, ImmediateMode operand_mode,
-                FlagsContinuation* cont) {
-  Arm64OperandGenerator g(selector);
+                FlagsContinuationT<Adapter>* cont) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   InstructionOperand inputs[5];
   size_t input_count = 0;
   InstructionOperand outputs[1];
@@ -553,8 +588,11 @@ void VisitBinop(InstructionSelector* selector, Node* node,
   }
 
   if (cont->IsSelect()) {
-    inputs[input_count++] = g.UseRegister(cont->true_value());
-    inputs[input_count++] = g.UseRegister(cont->false_value());
+    // Keep the values live until the end so that we can use operations that
+    // write registers to generate the condition, without accidently
+    // overwriting the inputs.
+    inputs[input_count++] = g.UseRegisterAtEnd(cont->true_value());
+    inputs[input_count++] = g.UseRegisterAtEnd(cont->false_value());
   }
 
   DCHECK_NE(0u, input_count);
@@ -567,17 +605,17 @@ void VisitBinop(InstructionSelector* selector, Node* node,
 }
 
 // Shared routine for multiple binary operations.
-template <typename Matcher>
-void VisitBinop(InstructionSelector* selector, Node* node, ArchOpcode opcode,
-                ImmediateMode operand_mode) {
-  FlagsContinuation cont;
-  VisitBinop<Matcher>(selector, node, opcode, operand_mode, &cont);
+template <typename Adapter, typename Matcher>
+void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
+                ArchOpcode opcode, ImmediateMode operand_mode) {
+  FlagsContinuationT<Adapter> cont;
+  VisitBinop<Adapter, Matcher>(selector, node, opcode, operand_mode, &cont);
 }
 
-template <typename Matcher>
-void VisitAddSub(InstructionSelector* selector, Node* node, ArchOpcode opcode,
-                 ArchOpcode negate_opcode) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter, typename Matcher>
+void VisitAddSub(InstructionSelectorT<Adapter>* selector, Node* node,
+                 ArchOpcode opcode, ArchOpcode negate_opcode) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Matcher m(node);
   if (m.right().HasResolvedValue() && (m.right().ResolvedValue() < 0) &&
       (m.right().ResolvedValue() > std::numeric_limits<int>::min()) &&
@@ -586,7 +624,7 @@ void VisitAddSub(InstructionSelector* selector, Node* node, ArchOpcode opcode,
         negate_opcode, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
         g.TempImmediate(static_cast<int32_t>(-m.right().ResolvedValue())));
   } else {
-    VisitBinop<Matcher>(selector, node, opcode, kArithmeticImm);
+    VisitBinop<Adapter, Matcher>(selector, node, opcode, kArithmeticImm);
   }
 }
 
@@ -607,26 +645,38 @@ int32_t LeftShiftForReducedMultiply(Matcher* m) {
 
 }  // namespace
 
-void InstructionSelector::VisitTraceInstruction(Node* node) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTraceInstruction(node_t node) {}
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
-  int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
-  OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+    int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
+    OperandGenerator g(this);
 
-  Emit(kArchStackSlot, g.DefineAsRegister(node),
-       sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+    Emit(kArchStackSlot, g.DefineAsRegister(node),
+         sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+  }
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  Arm64OperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), x1));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), x1));
+  }
 }
 
-void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
-              ImmediateMode immediate_mode, MachineRepresentation rep,
-              Node* output = nullptr) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+void EmitLoad(InstructionSelectorT<Adapter>* selector, Node* node,
+              InstructionCode opcode, ImmediateMode immediate_mode,
+              MachineRepresentation rep, Node* output = nullptr) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   InstructionOperand inputs[3];
@@ -686,10 +736,11 @@ namespace {
 // Manually add base and index into a register to get the actual address.
 // This should be used prior to instructions that only support
 // immediate/post-index addressing, like ld1 and st1.
-InstructionOperand EmitAddBeforeLoadOrStore(InstructionSelector* selector,
-                                            Node* node,
-                                            InstructionCode* opcode) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+InstructionOperand EmitAddBeforeLoadOrStore(
+    InstructionSelectorT<Adapter>* selector, Node* node,
+    InstructionCode* opcode) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   InstructionOperand addr = g.TempRegister();
   selector->Emit(kArm64Add, addr, g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
@@ -698,7 +749,8 @@ InstructionOperand EmitAddBeforeLoadOrStore(InstructionSelector* selector,
 }
 }  // namespace
 
-void InstructionSelector::VisitLoadLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
   LoadLaneParameters params = LoadLaneParametersOf(node->op());
   DCHECK(
       params.rep == MachineType::Int8() || params.rep == MachineType::Int16() ||
@@ -710,13 +762,14 @@ void InstructionSelector::VisitLoadLane(Node* node) {
     opcode |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
   }
 
-  Arm64OperandGenerator g(this);
+  Arm64OperandGeneratorT<Adapter> g(this);
   InstructionOperand addr = EmitAddBeforeLoadOrStore(this, node, &opcode);
   Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(2)),
        g.UseImmediate(params.laneidx), addr, g.TempImmediate(0));
 }
 
-void InstructionSelector::VisitStoreLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
   StoreLaneParameters params = StoreLaneParametersOf(node->op());
   DCHECK_LE(MachineRepresentation::kWord8, params.rep);
   DCHECK_GE(MachineRepresentation::kWord64, params.rep);
@@ -728,7 +781,7 @@ void InstructionSelector::VisitStoreLane(Node* node) {
     opcode |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
   }
 
-  Arm64OperandGenerator g(this);
+  Arm64OperandGeneratorT<Adapter> g(this);
   InstructionOperand addr = EmitAddBeforeLoadOrStore(this, node, &opcode);
   InstructionOperand inputs[4] = {
       g.UseRegister(node->InputAt(2)),
@@ -740,7 +793,8 @@ void InstructionSelector::VisitStoreLane(Node* node) {
   Emit(opcode, 0, nullptr, 4, inputs);
 }
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
   InstructionCode opcode = kArchNop;
   bool require_add = false;
@@ -795,7 +849,7 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   // ARM64 supports unaligned loads
   DCHECK_NE(params.kind, MemoryAccessKind::kUnaligned);
 
-  Arm64OperandGenerator g(this);
+  Arm64OperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   InstructionOperand inputs[2];
@@ -820,43 +874,43 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   Emit(opcode, 1, outputs, 2, inputs);
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  InstructionCode opcode = kArchNop;
-  ImmediateMode immediate_mode = kNoImmediate;
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
-  MachineRepresentation rep = load_rep.representation();
-  switch (rep) {
-    case MachineRepresentation::kFloat32:
-      opcode = kArm64LdrS;
-      immediate_mode = kLoadStoreImm32;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kArm64LdrD;
-      immediate_mode = kLoadStoreImm64;
-      break;
-    case MachineRepresentation::kBit:  // Fall through.
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsUnsigned()
-                   ? kArm64Ldrb
-                   : load_rep.semantic() == MachineSemantic::kInt32
-                         ? kArm64LdrsbW
-                         : kArm64Ldrsb;
-      immediate_mode = kLoadStoreImm8;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsUnsigned()
-                   ? kArm64Ldrh
-                   : load_rep.semantic() == MachineSemantic::kInt32
-                         ? kArm64LdrshW
-                         : kArm64Ldrsh;
-      immediate_mode = kLoadStoreImm16;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kArm64LdrW;
-      immediate_mode = kLoadStoreImm32;
-      break;
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kCompressed:
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    InstructionCode opcode = kArchNop;
+    ImmediateMode immediate_mode = kNoImmediate;
+    LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+    MachineRepresentation rep = load_rep.representation();
+    switch (rep) {
+      case MachineRepresentation::kFloat32:
+        opcode = kArm64LdrS;
+        immediate_mode = kLoadStoreImm32;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kArm64LdrD;
+        immediate_mode = kLoadStoreImm64;
+        break;
+      case MachineRepresentation::kBit:  // Fall through.
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsUnsigned()                            ? kArm64Ldrb
+                 : load_rep.semantic() == MachineSemantic::kInt32 ? kArm64LdrsbW
+                                                                  : kArm64Ldrsb;
+        immediate_mode = kLoadStoreImm8;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsUnsigned()                            ? kArm64Ldrh
+                 : load_rep.semantic() == MachineSemantic::kInt32 ? kArm64LdrshW
+                                                                  : kArm64Ldrsh;
+        immediate_mode = kLoadStoreImm16;
+        break;
+      case MachineRepresentation::kWord32:
+        opcode = kArm64LdrW;
+        immediate_mode = kLoadStoreImm32;
+        break;
+      case MachineRepresentation::kCompressedPointer:  // Fall through.
+      case MachineRepresentation::kCompressed:
 #ifdef V8_COMPRESS_POINTERS
       opcode = kArm64LdrW;
       immediate_mode = kLoadStoreImm32;
@@ -893,9 +947,10 @@ void InstructionSelector::VisitLoad(Node* node) {
       break;
     case MachineRepresentation::kSimd256:  // Fall through.
     case MachineRepresentation::kMapWord:  // Fall through.
+    case MachineRepresentation::kIndirectPointer:  // Fall through.
     case MachineRepresentation::kNone:
       UNREACHABLE();
-  }
+    }
   if (node->opcode() == IrOpcode::kProtectedLoad) {
     opcode |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
   } else if (node->opcode() == IrOpcode::kLoadTrapOnNull) {
@@ -903,29 +958,54 @@ void InstructionSelector::VisitLoad(Node* node) {
   }
 
   EmitLoad(this, node, opcode, immediate_mode, rep);
+  }
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) { VisitLoad(node); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
+  VisitLoad(node);
+}
 
-void InstructionSelector::VisitStore(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  VisitStore(node);
+  }
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitStore(turboshaft::OpIndex) {
+  UNREACHABLE();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitStore(Node* node) {
+  const bool kStorePair = node->opcode() == IrOpcode::kStorePair;
+
+  Arm64OperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
 
-  StoreRepresentation store_rep = StoreRepresentationOf(node->op());
-  WriteBarrierKind write_barrier_kind = store_rep.write_barrier_kind();
-  MachineRepresentation rep = store_rep.representation();
-
-  if (v8_flags.enable_unconditional_write_barriers &&
-      CanBeTaggedOrCompressedPointer(rep)) {
-    write_barrier_kind = kFullWriteBarrier;
+  WriteBarrierKind write_barrier_kind;
+  if (kStorePair) {
+    auto store_rep = StorePairRepresentationOf(node->op());
+    write_barrier_kind = store_rep.first.write_barrier_kind();
+    CHECK_EQ(write_barrier_kind, kNoWriteBarrier);
+    CHECK_EQ(store_rep.second.write_barrier_kind(), write_barrier_kind);
+  } else {
+    write_barrier_kind = StoreRepresentationOf(node->op()).write_barrier_kind();
   }
 
   // TODO(arm64): I guess this could be done in a better way.
   if (write_barrier_kind != kNoWriteBarrier &&
       !v8_flags.disable_write_barriers) {
-    DCHECK(CanBeTaggedOrCompressedPointer(rep));
+    CHECK(!kStorePair);
+    MachineRepresentation representation =
+        StoreRepresentationOf(node->op()).representation();
+    DCHECK(CanBeTaggedOrCompressedOrIndirectPointer(representation));
     AddressingMode addressing_mode;
     InstructionOperand inputs[3];
     size_t input_count = 0;
@@ -944,44 +1024,52 @@ void InstructionSelector::VisitStore(Node* node) {
     inputs[input_count++] = g.UseUniqueRegister(value);
     RecordWriteMode record_write_mode =
         WriteBarrierKindToRecordWriteMode(write_barrier_kind);
-    InstructionCode code = kArchStoreWithWriteBarrier;
+    InstructionCode code =
+        representation == MachineRepresentation::kIndirectPointer
+            ? kArchStoreIndirectWithWriteBarrier
+            : kArchStoreWithWriteBarrier;
     code |= AddressingModeField::encode(addressing_mode);
     code |= RecordWriteModeField::encode(record_write_mode);
     if (node->opcode() == IrOpcode::kStoreTrapOnNull) {
       code |= AccessModeField::encode(kMemoryAccessProtectedNullDereference);
     }
     Emit(code, 0, nullptr, input_count, inputs);
-  } else {
-    InstructionOperand inputs[4];
-    size_t input_count = 0;
+    return;
+  }
+
+  auto GetOpcodeAndImmediate = [](MachineRepresentation rep, bool paired) {
     InstructionCode opcode = kArchNop;
     ImmediateMode immediate_mode = kNoImmediate;
     switch (rep) {
       case MachineRepresentation::kFloat32:
+        CHECK(!paired);
         opcode = kArm64StrS;
         immediate_mode = kLoadStoreImm32;
         break;
       case MachineRepresentation::kFloat64:
+        CHECK(!paired);
         opcode = kArm64StrD;
         immediate_mode = kLoadStoreImm64;
         break;
       case MachineRepresentation::kBit:  // Fall through.
       case MachineRepresentation::kWord8:
+        CHECK(!paired);
         opcode = kArm64Strb;
         immediate_mode = kLoadStoreImm8;
         break;
       case MachineRepresentation::kWord16:
+        CHECK(!paired);
         opcode = kArm64Strh;
         immediate_mode = kLoadStoreImm16;
         break;
       case MachineRepresentation::kWord32:
-        opcode = kArm64StrW;
+        opcode = paired ? kArm64StrWPair : kArm64StrW;
         immediate_mode = kLoadStoreImm32;
         break;
       case MachineRepresentation::kCompressedPointer:  // Fall through.
       case MachineRepresentation::kCompressed:
 #ifdef V8_COMPRESS_POINTERS
-        opcode = kArm64StrCompressTagged;
+        opcode = paired ? kArm64StrWPair : kArm64StrCompressTagged;
         immediate_mode = kLoadStoreImm32;
         break;
 #else
@@ -990,19 +1078,42 @@ void InstructionSelector::VisitStore(Node* node) {
       case MachineRepresentation::kTaggedSigned:   // Fall through.
       case MachineRepresentation::kTaggedPointer:  // Fall through.
       case MachineRepresentation::kTagged:
-        opcode = kArm64StrCompressTagged;
+        if (paired) {
+          // There is an inconsistency here on how we treat stores vs. paired
+          // stores. In the normal store case we have special opcodes for
+          // compressed fields and the backend decides whether to write 32 or 64
+          // bits. However, for pairs this does not make sense, since the
+          // paired values could have different representations (e.g.,
+          // compressed paired with word32). Therefore, we decide on the actual
+          // machine representation already in instruction selection.
+#ifdef V8_COMPRESS_POINTERS
+          static_assert(ElementSizeLog2Of(MachineRepresentation::kTagged) == 2);
+          opcode = kArm64StrWPair;
+#else
+          static_assert(ElementSizeLog2Of(MachineRepresentation::kTagged) == 3);
+          opcode = kArm64StrPair;
+#endif
+        } else {
+          opcode = kArm64StrCompressTagged;
+        }
         immediate_mode =
             COMPRESS_POINTERS_BOOL ? kLoadStoreImm32 : kLoadStoreImm64;
         break;
+      case MachineRepresentation::kIndirectPointer:
+        opcode = kArm64StrIndirectPointer;
+        immediate_mode = kLoadStoreImm32;
+        break;
       case MachineRepresentation::kSandboxedPointer:
+        CHECK(!paired);
         opcode = kArm64StrEncodeSandboxedPointer;
         immediate_mode = kLoadStoreImm64;
         break;
       case MachineRepresentation::kWord64:
-        opcode = kArm64Str;
+        opcode = paired ? kArm64StrPair : kArm64Str;
         immediate_mode = kLoadStoreImm64;
         break;
       case MachineRepresentation::kSimd128:
+        CHECK(!paired);
         opcode = kArm64StrQ;
         immediate_mode = kNoImmediate;
         break;
@@ -1011,79 +1122,134 @@ void InstructionSelector::VisitStore(Node* node) {
       case MachineRepresentation::kNone:
         UNREACHABLE();
     }
+    return std::tuple{opcode, immediate_mode};
+  };
 
-    ExternalReferenceMatcher m(base);
-    if (m.HasResolvedValue() && g.IsIntegerConstant(index) &&
-        CanAddressRelativeToRootsRegister(m.ResolvedValue())) {
-      ptrdiff_t const delta =
-          g.GetIntegerConstantValue(index) +
-          MacroAssemblerBase::RootRegisterOffsetForExternalReference(
-              isolate(), m.ResolvedValue());
-      if (is_int32(delta)) {
-        input_count = 2;
-        InstructionOperand inputs[2];
-        inputs[0] = g.UseRegister(value);
-        inputs[1] = g.UseImmediate(static_cast<int32_t>(delta));
-        opcode |= AddressingModeField::encode(kMode_Root);
-        Emit(opcode, 0, nullptr, input_count, inputs);
-        return;
-      }
+  InstructionOperand inputs[4];
+  size_t input_count = 0;
+
+  InstructionCode opcode = kArchNop;
+  ImmediateMode immediate_mode = kNoImmediate;
+  MachineRepresentation approx_rep;
+  if (kStorePair) {
+    auto rep_pair = StorePairRepresentationOf(node->op());
+    auto info1 = GetOpcodeAndImmediate(rep_pair.first.representation(), true);
+    auto info2 = GetOpcodeAndImmediate(rep_pair.second.representation(), true);
+    CHECK_EQ(ElementSizeLog2Of(rep_pair.first.representation()),
+             ElementSizeLog2Of(rep_pair.second.representation()));
+    switch (ElementSizeLog2Of(rep_pair.first.representation())) {
+      case 2:
+        approx_rep = MachineRepresentation::kWord32;
+        break;
+      case 3:
+        approx_rep = MachineRepresentation::kWord64;
+        break;
+      default:
+        UNREACHABLE();
     }
+    opcode = std::get<InstructionCode>(info1);
+    immediate_mode = std::get<ImmediateMode>(info1);
+    CHECK_EQ(opcode, std::get<InstructionCode>(info2));
+    CHECK_EQ(immediate_mode, std::get<ImmediateMode>(info2));
+  } else {
+    approx_rep = StoreRepresentationOf(node->op()).representation();
+    auto info = GetOpcodeAndImmediate(approx_rep, false);
+    opcode = std::get<InstructionCode>(info);
+    immediate_mode = std::get<ImmediateMode>(info);
+  }
 
-    inputs[0] = g.UseRegisterOrImmediateZero(value);
+  if (v8_flags.enable_unconditional_write_barriers) {
+    CHECK(!kStorePair);
+    if (CanBeTaggedOrCompressedPointer(
+            StoreRepresentationOf(node->op()).representation())) {
+      write_barrier_kind = kFullWriteBarrier;
+    }
+  }
 
-    if (base != nullptr && base->opcode() == IrOpcode::kLoadRootRegister) {
+  ExternalReferenceMatcher m(base);
+  if (m.HasResolvedValue() && g.IsIntegerConstant(index) &&
+      CanAddressRelativeToRootsRegister(m.ResolvedValue())) {
+    CHECK(!kStorePair);
+    ptrdiff_t const delta =
+        g.GetIntegerConstantValue(index) +
+        MacroAssemblerBase::RootRegisterOffsetForExternalReference(
+            isolate(), m.ResolvedValue());
+    if (is_int32(delta)) {
       input_count = 2;
-      // This will only work if {index} is a constant.
-      inputs[1] = g.UseImmediate(index);
+      InstructionOperand inputs[2];
+      inputs[0] = g.UseRegister(value);
+      inputs[1] = g.UseImmediate(static_cast<int32_t>(delta));
       opcode |= AddressingModeField::encode(kMode_Root);
       Emit(opcode, 0, nullptr, input_count, inputs);
       return;
     }
+  }
 
-    inputs[1] = g.UseRegister(base);
+  inputs[input_count++] = g.UseRegisterOrImmediateZero(value);
 
-    if (g.CanBeImmediate(index, immediate_mode)) {
-      input_count = 3;
-      inputs[2] = g.UseImmediate(index);
-      opcode |= AddressingModeField::encode(kMode_MRI);
-    } else if (TryMatchLoadStoreShift(&g, this, rep, node, index, &inputs[2],
-                                      &inputs[3])) {
-      input_count = 4;
-      opcode |= AddressingModeField::encode(kMode_Operand2_R_LSL_I);
-    } else {
-      input_count = 3;
-      inputs[2] = g.UseRegister(index);
-      opcode |= AddressingModeField::encode(kMode_MRR);
-    }
-
-    if (node->opcode() == IrOpcode::kProtectedStore) {
-      opcode |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
-    } else if (node->opcode() == IrOpcode::kStoreTrapOnNull) {
-      opcode |= AccessModeField::encode(kMemoryAccessProtectedNullDereference);
-    }
+  if (kStorePair) {
+    inputs[input_count++] = g.UseRegisterOrImmediateZero(node->InputAt(3));
+  }
 
+  if (base != nullptr && base->opcode() == IrOpcode::kLoadRootRegister) {
+    // This will only work if {index} is a constant.
+    inputs[input_count++] = g.UseImmediate(index);
+    opcode |= AddressingModeField::encode(kMode_Root);
     Emit(opcode, 0, nullptr, input_count, inputs);
+    return;
+  }
+
+  inputs[input_count++] = g.UseRegister(base);
+
+  if (g.CanBeImmediate(index, immediate_mode)) {
+    inputs[input_count++] = g.UseImmediate(index);
+    opcode |= AddressingModeField::encode(kMode_MRI);
+  } else if (TryMatchLoadStoreShift(&g, this, approx_rep, node, index,
+                                    &inputs[input_count],
+                                    &inputs[input_count + 1])) {
+    input_count += 2;
+    opcode |= AddressingModeField::encode(kMode_Operand2_R_LSL_I);
+  } else {
+    inputs[input_count++] = g.UseRegister(index);
+    opcode |= AddressingModeField::encode(kMode_MRR);
   }
+
+  if (node->opcode() == IrOpcode::kProtectedStore) {
+    opcode |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
+  } else if (node->opcode() == IrOpcode::kStoreTrapOnNull) {
+    opcode |= AccessModeField::encode(kMemoryAccessProtectedNullDereference);
+  }
+
+  Emit(opcode, 0, nullptr, input_count, inputs);
 }
 
-void InstructionSelector::VisitProtectedStore(Node* node) { VisitStore(node); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
+  VisitStore(node);
+}
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
   UNREACHABLE();
 }
 
 // Architecture supports unaligned access, therefore VisitLoad is used instead
-void InstructionSelector::VisitUnalignedLoad(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  UNREACHABLE();
+}
 
 // Architecture supports unaligned access, therefore VisitStore is used instead
-void InstructionSelector::VisitUnalignedStore(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedStore(node_t node) {
+  UNREACHABLE();
+}
 
-template <typename Matcher>
-static void VisitLogical(InstructionSelector* selector, Node* node, Matcher* m,
-                         ArchOpcode opcode, bool left_can_cover,
+template <typename Adapter, typename Matcher>
+static void VisitLogical(InstructionSelectorT<Adapter>* selector, Node* node,
+                         Matcher* m, ArchOpcode opcode, bool left_can_cover,
                          bool right_can_cover, ImmediateMode imm_mode) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
 
   // Map instruction to equivalent operation with inverted right input.
   ArchOpcode inv_opcode = opcode;
@@ -1142,12 +1308,19 @@ static void VisitLogical(InstructionSelector* selector, Node* node, Matcher* m,
     selector->Emit(kArm64Not, g.DefineAsRegister(node),
                    g.UseRegister(m->left().node()));
   } else {
-    VisitBinop<Matcher>(selector, node, opcode, imm_mode);
+    VisitBinop<Adapter, Matcher>(selector, node, opcode, imm_mode);
   }
 }
 
-void InstructionSelector::VisitWord32And(Node* node) {
-  Arm64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32And(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32And(Node* node) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   if (m.left().IsWord32Shr() && CanCover(node, m.left().node()) &&
       m.right().HasResolvedValue()) {
@@ -1181,13 +1354,19 @@ void InstructionSelector::VisitWord32And(Node* node) {
       // Other cases fall through to the normal And operation.
     }
   }
-  VisitLogical<Int32BinopMatcher>(
+  VisitLogical<TurbofanAdapter, Int32BinopMatcher>(
       this, node, &m, kArm64And32, CanCover(node, m.left().node()),
       CanCover(node, m.right().node()), kLogical32Imm);
 }
 
-void InstructionSelector::VisitWord64And(Node* node) {
-  Arm64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord64And(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64And(Node* node) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(this);
   Int64BinopMatcher m(node);
   if (m.left().IsWord64Shr() && CanCover(node, m.left().node()) &&
       m.right().HasResolvedValue()) {
@@ -1222,44 +1401,70 @@ void InstructionSelector::VisitWord64And(Node* node) {
       // Other cases fall through to the normal And operation.
     }
   }
-  VisitLogical<Int64BinopMatcher>(
+  VisitLogical<TurbofanAdapter, Int64BinopMatcher>(
       this, node, &m, kArm64And, CanCover(node, m.left().node()),
       CanCover(node, m.right().node()), kLogical64Imm);
 }
 
-void InstructionSelector::VisitWord32Or(Node* node) {
-  Int32BinopMatcher m(node);
-  VisitLogical<Int32BinopMatcher>(
-      this, node, &m, kArm64Or32, CanCover(node, m.left().node()),
-      CanCover(node, m.right().node()), kLogical32Imm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    VisitLogical<Adapter, Int32BinopMatcher>(
+        this, node, &m, kArm64Or32, CanCover(node, m.left().node()),
+        CanCover(node, m.right().node()), kLogical32Imm);
+  }
 }
 
-void InstructionSelector::VisitWord64Or(Node* node) {
-  Int64BinopMatcher m(node);
-  VisitLogical<Int64BinopMatcher>(
-      this, node, &m, kArm64Or, CanCover(node, m.left().node()),
-      CanCover(node, m.right().node()), kLogical64Imm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int64BinopMatcher m(node);
+    VisitLogical<Adapter, Int64BinopMatcher>(
+        this, node, &m, kArm64Or, CanCover(node, m.left().node()),
+        CanCover(node, m.right().node()), kLogical64Imm);
+  }
 }
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  Int32BinopMatcher m(node);
-  VisitLogical<Int32BinopMatcher>(
-      this, node, &m, kArm64Eor32, CanCover(node, m.left().node()),
-      CanCover(node, m.right().node()), kLogical32Imm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    VisitLogical<Adapter, Int32BinopMatcher>(
+        this, node, &m, kArm64Eor32, CanCover(node, m.left().node()),
+        CanCover(node, m.right().node()), kLogical32Imm);
+  }
 }
 
-void InstructionSelector::VisitWord64Xor(Node* node) {
-  Int64BinopMatcher m(node);
-  VisitLogical<Int64BinopMatcher>(
-      this, node, &m, kArm64Eor, CanCover(node, m.left().node()),
-      CanCover(node, m.right().node()), kLogical64Imm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int64BinopMatcher m(node);
+    VisitLogical<Adapter, Int64BinopMatcher>(
+        this, node, &m, kArm64Eor, CanCover(node, m.left().node()),
+        CanCover(node, m.right().node()), kLogical64Imm);
+  }
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Shl(node_t node) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitWord32Shl(Node* node) {
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Shl(Node* node) {
   Int32BinopMatcher m(node);
   if (m.left().IsWord32And() && CanCover(node, m.left().node()) &&
       m.right().IsInRange(1, 31)) {
-    Arm64OperandGenerator g(this);
+    Arm64OperandGeneratorT<TurbofanAdapter> g(this);
     Int32BinopMatcher mleft(m.left().node());
     if (mleft.right().HasResolvedValue()) {
       uint32_t mask = mleft.right().ResolvedValue();
@@ -1291,28 +1496,47 @@ void InstructionSelector::VisitWord32Shl(Node* node) {
   VisitRRO(this, kArm64Lsl32, node, kShift32Imm);
 }
 
-void InstructionSelector::VisitWord64Shl(Node* node) {
-  Arm64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if ((m.left().IsChangeInt32ToInt64() || m.left().IsChangeUint32ToUint64()) &&
-      m.right().IsInRange(32, 63) && CanCover(node, m.left().node())) {
-    // There's no need to sign/zero-extend to 64-bit if we shift out the upper
-    // 32 bits anyway.
-    Emit(kArm64Lsl, g.DefineAsRegister(node),
-         g.UseRegister(m.left().node()->InputAt(0)),
-         g.UseImmediate(m.right().node()));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if ((m.left().IsChangeInt32ToInt64() ||
+         m.left().IsChangeUint32ToUint64()) &&
+        m.right().IsInRange(32, 63) && CanCover(node, m.left().node())) {
+      // There's no need to sign/zero-extend to 64-bit if we shift out the upper
+      // 32 bits anyway.
+      Emit(kArm64Lsl, g.DefineAsRegister(node),
+           g.UseRegister(m.left().node()->InputAt(0)),
+           g.UseImmediate(m.right().node()));
+      return;
+    }
+    VisitRRO(this, kArm64Lsl, node, kShift64Imm);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuationT<Adapter>* cont) {
+  StackCheckKind kind;
+  node_t value;
+  if constexpr (Adapter::IsTurboshaft) {
+    const auto& op =
+        this->turboshaft_graph()
+            ->Get(node)
+            .template Cast<turboshaft::StackPointerGreaterThanOp>();
+    kind = op.kind;
+    value = op.stack_limit();
+  } else {
+    kind = StackCheckKindOf(node->op());
+    value = node->InputAt(0);
   }
-  VisitRRO(this, kArm64Lsl, node, kShift64Imm);
-}
-
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
-  Arm64OperandGenerator g(this);
+  Arm64OperandGeneratorT<Adapter> g(this);
 
   // No outputs.
   InstructionOperand* const outputs = nullptr;
@@ -1327,7 +1551,6 @@ void InstructionSelector::VisitStackPointerGreaterThan(
                                  ? OperandGenerator::kUniqueRegister
                                  : OperandGenerator::kRegister;
 
-  Node* const value = node->InputAt(0);
   InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
   static constexpr int input_count = arraysize(inputs);
 
@@ -1337,8 +1560,10 @@ void InstructionSelector::VisitStackPointerGreaterThan(
 
 namespace {
 
-bool TryEmitBitfieldExtract32(InstructionSelector* selector, Node* node) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+bool TryEmitBitfieldExtract32(InstructionSelectorT<Adapter>* selector,
+                              Node* node) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   if (selector->CanCover(node, m.left().node()) && m.left().IsWord32Shl()) {
     // Select Ubfx or Sbfx for (x << (K & 0x1F)) OP (K & 0x1F), where
@@ -1364,8 +1589,13 @@ bool TryEmitBitfieldExtract32(InstructionSelector* selector, Node* node) {
 }
 
 }  // namespace
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Shr(node_t node) {
+  UNIMPLEMENTED();
+}
 
-void InstructionSelector::VisitWord32Shr(Node* node) {
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Shr(Node* node) {
   Int32BinopMatcher m(node);
   if (m.left().IsWord32And() && m.right().HasResolvedValue()) {
     uint32_t lsb = m.right().ResolvedValue() & 0x1F;
@@ -1379,7 +1609,7 @@ void InstructionSelector::VisitWord32Shr(Node* node) {
       unsigned mask_width = base::bits::CountPopulation(mask);
       unsigned mask_msb = base::bits::CountLeadingZeros32(mask);
       if ((mask_msb + mask_width + lsb) == 32) {
-        Arm64OperandGenerator g(this);
+        Arm64OperandGeneratorT<TurbofanAdapter> g(this);
         DCHECK_EQ(lsb, base::bits::CountTrailingZeros32(mask));
         Emit(kArm64Ubfx32, g.DefineAsRegister(node),
              g.UseRegister(mleft.left().node()),
@@ -1396,7 +1626,7 @@ void InstructionSelector::VisitWord32Shr(Node* node) {
       CanCover(node, node->InputAt(0))) {
     // Combine this shift with the multiply and shift that would be generated
     // by Uint32MulHigh.
-    Arm64OperandGenerator g(this);
+    Arm64OperandGeneratorT<TurbofanAdapter> g(this);
     Node* left = m.left().node();
     int shift = m.right().ResolvedValue() & 0x1F;
     InstructionOperand const smull_operand = g.TempRegister();
@@ -1410,7 +1640,13 @@ void InstructionSelector::VisitWord32Shr(Node* node) {
   VisitRRO(this, kArm64Lsr32, node, kShift32Imm);
 }
 
-void InstructionSelector::VisitWord64Shr(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord64Shr(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64Shr(Node* node) {
   Int64BinopMatcher m(node);
   if (m.left().IsWord64And() && m.right().HasResolvedValue()) {
     uint32_t lsb = m.right().ResolvedValue() & 0x3F;
@@ -1424,7 +1660,7 @@ void InstructionSelector::VisitWord64Shr(Node* node) {
       unsigned mask_width = base::bits::CountPopulation(mask);
       unsigned mask_msb = base::bits::CountLeadingZeros64(mask);
       if ((mask_msb + mask_width + lsb) == 64) {
-        Arm64OperandGenerator g(this);
+        Arm64OperandGeneratorT<TurbofanAdapter> g(this);
         DCHECK_EQ(lsb, base::bits::CountTrailingZeros64(mask));
         Emit(kArm64Ubfx, g.DefineAsRegister(node),
              g.UseRegister(mleft.left().node()),
@@ -1437,7 +1673,14 @@ void InstructionSelector::VisitWord64Shr(Node* node) {
   VisitRRO(this, kArm64Lsr, node, kShift64Imm);
 }
 
-void InstructionSelector::VisitWord32Sar(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Sar(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Sar(Node* node) {
   if (TryEmitBitfieldExtract32(this, node)) {
     return;
   }
@@ -1447,7 +1690,7 @@ void InstructionSelector::VisitWord32Sar(Node* node) {
       CanCover(node, node->InputAt(0))) {
     // Combine this shift with the multiply and shift that would be generated
     // by Int32MulHigh.
-    Arm64OperandGenerator g(this);
+    Arm64OperandGeneratorT<TurbofanAdapter> g(this);
     Node* left = m.left().node();
     int shift = m.right().ResolvedValue() & 0x1F;
     InstructionOperand const smull_operand = g.TempRegister();
@@ -1468,7 +1711,7 @@ void InstructionSelector::VisitWord32Sar(Node* node) {
       // on the left of this Sar operation. We do it here, as the result of the
       // add potentially has 33 bits, so we have to ensure the result is
       // truncated by being the input to this 32-bit Sar operation.
-      Arm64OperandGenerator g(this);
+      Arm64OperandGeneratorT<TurbofanAdapter> g(this);
       Node* mul_node = madd_node.left().node();
 
       InstructionOperand const smull_operand = g.TempRegister();
@@ -1489,66 +1732,81 @@ void InstructionSelector::VisitWord32Sar(Node* node) {
   VisitRRO(this, kArm64Asr32, node, kShift32Imm);
 }
 
-void InstructionSelector::VisitWord64Sar(Node* node) {
-  if (TryEmitExtendingLoad(this, node)) return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Sar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (TryEmitExtendingLoad(this, node)) return;
 
-  // Select Sbfx(x, imm, 32-imm) for Word64Sar(ChangeInt32ToInt64(x), imm)
-  // where possible
-  Int64BinopMatcher m(node);
-  if (m.left().IsChangeInt32ToInt64() && m.right().HasResolvedValue() &&
-      is_uint5(m.right().ResolvedValue()) && CanCover(node, m.left().node())) {
-    // Don't select Sbfx here if Asr(Ldrsw(x), imm) can be selected for
-    // Word64Sar(ChangeInt32ToInt64(Load(x)), imm)
-    if ((m.left().InputAt(0)->opcode() != IrOpcode::kLoad &&
-         m.left().InputAt(0)->opcode() != IrOpcode::kLoadImmutable) ||
-        !CanCover(m.left().node(), m.left().InputAt(0))) {
-      Arm64OperandGenerator g(this);
-      int right = static_cast<int>(m.right().ResolvedValue());
-      Emit(kArm64Sbfx, g.DefineAsRegister(node),
-           g.UseRegister(m.left().node()->InputAt(0)),
-           g.UseImmediate(m.right().node()), g.UseImmediate(32 - right));
-      return;
+    // Select Sbfx(x, imm, 32-imm) for Word64Sar(ChangeInt32ToInt64(x), imm)
+    // where possible
+    Int64BinopMatcher m(node);
+    if (m.left().IsChangeInt32ToInt64() && m.right().HasResolvedValue() &&
+        is_uint5(m.right().ResolvedValue()) &&
+        CanCover(node, m.left().node())) {
+      // Don't select Sbfx here if Asr(Ldrsw(x), imm) can be selected for
+      // Word64Sar(ChangeInt32ToInt64(Load(x)), imm)
+      if ((m.left().InputAt(0)->opcode() != IrOpcode::kLoad &&
+           m.left().InputAt(0)->opcode() != IrOpcode::kLoadImmutable) ||
+          !CanCover(m.left().node(), m.left().InputAt(0))) {
+        Arm64OperandGeneratorT<Adapter> g(this);
+        int right = static_cast<int>(m.right().ResolvedValue());
+        Emit(kArm64Sbfx, g.DefineAsRegister(node),
+             g.UseRegister(m.left().node()->InputAt(0)),
+             g.UseImmediate(m.right().node()), g.UseImmediate(32 - right));
+        return;
+      }
     }
-  }
 
-  VisitRRO(this, kArm64Asr, node, kShift64Imm);
+    VisitRRO(this, kArm64Asr, node, kShift64Imm);
+  }
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
   VisitRRO(this, kArm64Ror32, node, kShift32Imm);
 }
 
-void InstructionSelector::VisitWord64Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ror(node_t node) {
   VisitRRO(this, kArm64Ror, node, kShift64Imm);
 }
 
-#define RR_OP_LIST(V)                                         \
-  V(Word64Clz, kArm64Clz)                                     \
-  V(Word32Clz, kArm64Clz32)                                   \
-  V(Word32Popcnt, kArm64Cnt32)                                \
-  V(Word64Popcnt, kArm64Cnt64)                                \
-  V(Word32ReverseBits, kArm64Rbit32)                          \
-  V(Word64ReverseBits, kArm64Rbit)                            \
-  V(Word32ReverseBytes, kArm64Rev32)                          \
-  V(Word64ReverseBytes, kArm64Rev)                            \
+#define RR_OP_T_LIST(V)                                       \
+  V(Float32Sqrt, kArm64Float32Sqrt)                           \
+  V(Float64Sqrt, kArm64Float64Sqrt)                           \
+  V(Float32RoundDown, kArm64Float32RoundDown)                 \
+  V(Float64RoundDown, kArm64Float64RoundDown)                 \
+  V(Float32RoundUp, kArm64Float32RoundUp)                     \
+  V(Float64RoundUp, kArm64Float64RoundUp)                     \
+  V(Float32RoundTruncate, kArm64Float32RoundTruncate)         \
+  V(Float64RoundTruncate, kArm64Float64RoundTruncate)         \
+  V(Float64RoundTiesAway, kArm64Float64RoundTiesAway)         \
+  V(Float32RoundTiesEven, kArm64Float32RoundTiesEven)         \
+  V(Float64RoundTiesEven, kArm64Float64RoundTiesEven)         \
+  V(Float64SilenceNaN, kArm64Float64SilenceNaN)               \
+  V(ChangeInt32ToFloat64, kArm64Int32ToFloat64)               \
+  V(RoundFloat64ToInt32, kArm64Float64ToInt32)                \
   V(ChangeFloat32ToFloat64, kArm64Float32ToFloat64)           \
   V(RoundInt32ToFloat32, kArm64Int32ToFloat32)                \
   V(RoundUint32ToFloat32, kArm64Uint32ToFloat32)              \
-  V(ChangeInt32ToFloat64, kArm64Int32ToFloat64)               \
   V(ChangeInt64ToFloat64, kArm64Int64ToFloat64)               \
   V(ChangeUint32ToFloat64, kArm64Uint32ToFloat64)             \
   V(ChangeFloat64ToInt32, kArm64Float64ToInt32)               \
   V(ChangeFloat64ToInt64, kArm64Float64ToInt64)               \
   V(ChangeFloat64ToUint32, kArm64Float64ToUint32)             \
   V(ChangeFloat64ToUint64, kArm64Float64ToUint64)             \
-  V(TruncateFloat64ToUint32, kArm64Float64ToUint32)           \
-  V(TruncateFloat64ToFloat32, kArm64Float64ToFloat32)         \
-  V(TruncateFloat64ToWord32, kArchTruncateDoubleToI)          \
-  V(RoundFloat64ToInt32, kArm64Float64ToInt32)                \
   V(RoundInt64ToFloat32, kArm64Int64ToFloat32)                \
   V(RoundInt64ToFloat64, kArm64Int64ToFloat64)                \
   V(RoundUint64ToFloat32, kArm64Uint64ToFloat32)              \
@@ -1557,30 +1815,31 @@ void InstructionSelector::VisitWord64Ror(Node* node) {
   V(BitcastFloat64ToInt64, kArm64U64MoveFloat64)              \
   V(BitcastInt32ToFloat32, kArm64Float64MoveU64)              \
   V(BitcastInt64ToFloat64, kArm64Float64MoveU64)              \
-  V(Float32Sqrt, kArm64Float32Sqrt)                           \
-  V(Float64Sqrt, kArm64Float64Sqrt)                           \
-  V(Float32RoundDown, kArm64Float32RoundDown)                 \
-  V(Float64RoundDown, kArm64Float64RoundDown)                 \
-  V(Float32RoundUp, kArm64Float32RoundUp)                     \
-  V(Float64RoundUp, kArm64Float64RoundUp)                     \
-  V(Float32RoundTruncate, kArm64Float32RoundTruncate)         \
-  V(Float64RoundTruncate, kArm64Float64RoundTruncate)         \
-  V(Float64RoundTiesAway, kArm64Float64RoundTiesAway)         \
-  V(Float32RoundTiesEven, kArm64Float32RoundTiesEven)         \
-  V(Float64RoundTiesEven, kArm64Float64RoundTiesEven)         \
+  V(TruncateFloat64ToFloat32, kArm64Float64ToFloat32)         \
+  V(TruncateFloat64ToWord32, kArchTruncateDoubleToI)          \
+  V(TruncateFloat64ToUint32, kArm64Float64ToUint32)           \
   V(Float64ExtractLowWord32, kArm64Float64ExtractLowWord32)   \
   V(Float64ExtractHighWord32, kArm64Float64ExtractHighWord32) \
-  V(Float64SilenceNaN, kArm64Float64SilenceNaN)               \
-  V(F32x4Ceil, kArm64Float32RoundUp)                          \
-  V(F32x4Floor, kArm64Float32RoundDown)                       \
-  V(F32x4Trunc, kArm64Float32RoundTruncate)                   \
-  V(F32x4NearestInt, kArm64Float32RoundTiesEven)              \
-  V(F64x2Ceil, kArm64Float64RoundUp)                          \
-  V(F64x2Floor, kArm64Float64RoundDown)                       \
-  V(F64x2Trunc, kArm64Float64RoundTruncate)                   \
+  V(Word64Clz, kArm64Clz)                                     \
+  V(Word32Clz, kArm64Clz32)                                   \
+  V(Word32Popcnt, kArm64Cnt32)                                \
+  V(Word64Popcnt, kArm64Cnt64)                                \
+  V(Word32ReverseBits, kArm64Rbit32)                          \
+  V(Word64ReverseBits, kArm64Rbit)                            \
+  V(Word32ReverseBytes, kArm64Rev32)                          \
+  V(Word64ReverseBytes, kArm64Rev)
+
+#define RR_OP_LIST(V)                            \
+  V(F32x4Ceil, kArm64Float32RoundUp)             \
+  V(F32x4Floor, kArm64Float32RoundDown)          \
+  V(F32x4Trunc, kArm64Float32RoundTruncate)      \
+  V(F32x4NearestInt, kArm64Float32RoundTiesEven) \
+  V(F64x2Ceil, kArm64Float64RoundUp)             \
+  V(F64x2Floor, kArm64Float64RoundDown)          \
+  V(F64x2Trunc, kArm64Float64RoundTruncate)      \
   V(F64x2NearestInt, kArm64Float64RoundTiesEven)
 
-#define RRR_OP_LIST(V)            \
+#define RRR_OP_T_LIST(V)          \
   V(Int32Div, kArm64Idiv32)       \
   V(Int64Div, kArm64Idiv)         \
   V(Uint32Div, kArm64Udiv32)      \
@@ -1598,31 +1857,64 @@ void InstructionSelector::VisitWord64Ror(Node* node) {
   V(Float32Max, kArm64Float32Max) \
   V(Float64Max, kArm64Float64Max) \
   V(Float32Min, kArm64Float32Min) \
-  V(Float64Min, kArm64Float64Min) \
-  V(I8x16Swizzle, kArm64I8x16Swizzle)
+  V(Float64Min, kArm64Float64Min)
 
-#define RR_VISITOR(Name, opcode)                      \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, opcode, node);                      \
+#define RRR_OP_LIST(V) V(I8x16Swizzle, kArm64I8x16Swizzle)
+
+#define RR_VISITOR(Name, opcode)                                \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRR(this, opcode, node);                                \
   }
 RR_OP_LIST(RR_VISITOR)
 #undef RR_VISITOR
 #undef RR_OP_LIST
 
-#define RRR_VISITOR(Name, opcode)                     \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRR(this, opcode, node);                     \
+#define RR_VISITOR(Name, opcode)                                 \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRR(this, opcode, node);                                 \
+  }
+RR_OP_T_LIST(RR_VISITOR)
+#undef RR_VISITOR
+#undef RR_OP_T_LIST
+
+#define RRR_VISITOR(Name, opcode)                               \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRRR(this, opcode, node);                               \
   }
 RRR_OP_LIST(RRR_VISITOR)
 #undef RRR_VISITOR
 #undef RRR_OP_LIST
 
-void InstructionSelector::VisitWord32Ctz(Node* node) { UNREACHABLE(); }
+#define RRR_VISITOR(Name, opcode)                                \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRRR(this, opcode, node);                                \
+  }
+RRR_OP_T_LIST(RRR_VISITOR)
+#undef RRR_VISITOR
+#undef RRR_OP_T_LIST
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ctz(node_t node) {
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ctz(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64Ctz(Node* node) { UNREACHABLE(); }
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Add(node_t node) {
+  UNIMPLEMENTED();
+}
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  Arm64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Add(Node* node) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   // Select Madd(x, y, z) for Add(Mul(x, y), z).
   if (m.left().IsInt32Mul() && CanCover(node, m.left().node())) {
@@ -1648,84 +1940,102 @@ void InstructionSelector::VisitInt32Add(Node* node) {
       return;
     }
   }
-  VisitAddSub<Int32BinopMatcher>(this, node, kArm64Add32, kArm64Sub32);
+  VisitAddSub<TurbofanAdapter, Int32BinopMatcher>(this, node, kArm64Add32,
+                                                  kArm64Sub32);
 }
 
-void InstructionSelector::VisitInt64Add(Node* node) {
-  Arm64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  // Select Madd(x, y, z) for Add(Mul(x, y), z).
-  if (m.left().IsInt64Mul() && CanCover(node, m.left().node())) {
-    Int64BinopMatcher mleft(m.left().node());
-    // Check multiply can't be later reduced to addition with shift.
-    if (LeftShiftForReducedMultiply(&mleft) == 0) {
-      Emit(kArm64Madd, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()),
-           g.UseRegister(mleft.right().node()),
-           g.UseRegister(m.right().node()));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    // Select Madd(x, y, z) for Add(Mul(x, y), z).
+    if (m.left().IsInt64Mul() && CanCover(node, m.left().node())) {
+      Int64BinopMatcher mleft(m.left().node());
+      // Check multiply can't be later reduced to addition with shift.
+      if (LeftShiftForReducedMultiply(&mleft) == 0) {
+        Emit(kArm64Madd, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()),
+             g.UseRegister(mleft.right().node()),
+             g.UseRegister(m.right().node()));
+        return;
+      }
     }
-  }
-  // Select Madd(x, y, z) for Add(z, Mul(x, y)).
-  if (m.right().IsInt64Mul() && CanCover(node, m.right().node())) {
-    Int64BinopMatcher mright(m.right().node());
-    // Check multiply can't be later reduced to addition with shift.
-    if (LeftShiftForReducedMultiply(&mright) == 0) {
-      Emit(kArm64Madd, g.DefineAsRegister(node),
-           g.UseRegister(mright.left().node()),
-           g.UseRegister(mright.right().node()),
-           g.UseRegister(m.left().node()));
-      return;
+    // Select Madd(x, y, z) for Add(z, Mul(x, y)).
+    if (m.right().IsInt64Mul() && CanCover(node, m.right().node())) {
+      Int64BinopMatcher mright(m.right().node());
+      // Check multiply can't be later reduced to addition with shift.
+      if (LeftShiftForReducedMultiply(&mright) == 0) {
+        Emit(kArm64Madd, g.DefineAsRegister(node),
+             g.UseRegister(mright.left().node()),
+             g.UseRegister(mright.right().node()),
+             g.UseRegister(m.left().node()));
+        return;
+      }
     }
+    VisitAddSub<Adapter, Int64BinopMatcher>(this, node, kArm64Add, kArm64Sub);
   }
-  VisitAddSub<Int64BinopMatcher>(this, node, kArm64Add, kArm64Sub);
 }
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  Arm64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-
-  // Select Msub(x, y, a) for Sub(a, Mul(x, y)).
-  if (m.right().IsInt32Mul() && CanCover(node, m.right().node())) {
-    Int32BinopMatcher mright(m.right().node());
-    // Check multiply can't be later reduced to addition with shift.
-    if (LeftShiftForReducedMultiply(&mright) == 0) {
-      Emit(kArm64Msub32, g.DefineAsRegister(node),
-           g.UseRegister(mright.left().node()),
-           g.UseRegister(mright.right().node()),
-           g.UseRegister(m.left().node()));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+
+    // Select Msub(x, y, a) for Sub(a, Mul(x, y)).
+    if (m.right().IsInt32Mul() && CanCover(node, m.right().node())) {
+      Int32BinopMatcher mright(m.right().node());
+      // Check multiply can't be later reduced to addition with shift.
+      if (LeftShiftForReducedMultiply(&mright) == 0) {
+        Emit(kArm64Msub32, g.DefineAsRegister(node),
+             g.UseRegister(mright.left().node()),
+             g.UseRegister(mright.right().node()),
+             g.UseRegister(m.left().node()));
+        return;
+      }
     }
-  }
 
-  VisitAddSub<Int32BinopMatcher>(this, node, kArm64Sub32, kArm64Add32);
+    VisitAddSub<Adapter, Int32BinopMatcher>(this, node, kArm64Sub32,
+                                            kArm64Add32);
+  }
 }
 
-void InstructionSelector::VisitInt64Sub(Node* node) {
-  Arm64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
 
-  // Select Msub(x, y, a) for Sub(a, Mul(x, y)).
-  if (m.right().IsInt64Mul() && CanCover(node, m.right().node())) {
-    Int64BinopMatcher mright(m.right().node());
-    // Check multiply can't be later reduced to addition with shift.
-    if (LeftShiftForReducedMultiply(&mright) == 0) {
-      Emit(kArm64Msub, g.DefineAsRegister(node),
-           g.UseRegister(mright.left().node()),
-           g.UseRegister(mright.right().node()),
-           g.UseRegister(m.left().node()));
-      return;
+    // Select Msub(x, y, a) for Sub(a, Mul(x, y)).
+    if (m.right().IsInt64Mul() && CanCover(node, m.right().node())) {
+      Int64BinopMatcher mright(m.right().node());
+      // Check multiply can't be later reduced to addition with shift.
+      if (LeftShiftForReducedMultiply(&mright) == 0) {
+        Emit(kArm64Msub, g.DefineAsRegister(node),
+             g.UseRegister(mright.left().node()),
+             g.UseRegister(mright.right().node()),
+             g.UseRegister(m.left().node()));
+        return;
+      }
     }
-  }
 
-  VisitAddSub<Int64BinopMatcher>(this, node, kArm64Sub, kArm64Add);
+    VisitAddSub<Adapter, Int64BinopMatcher>(this, node, kArm64Sub, kArm64Add);
+  }
 }
 
 namespace {
 
-void EmitInt32MulWithOverflow(InstructionSelector* selector, Node* node,
-                              FlagsContinuation* cont) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+void EmitInt32MulWithOverflow(InstructionSelectorT<Adapter>* selector,
+                              Node* node, FlagsContinuationT<Adapter>* cont) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   InstructionOperand result = g.DefineAsRegister(node);
   InstructionOperand left = g.UseRegister(m.left().node());
@@ -1746,9 +2056,10 @@ void EmitInt32MulWithOverflow(InstructionSelector* selector, Node* node,
   selector->EmitWithContinuation(opcode, result, result, cont);
 }
 
-void EmitInt64MulWithOverflow(InstructionSelector* selector, Node* node,
-                              FlagsContinuation* cont) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+void EmitInt64MulWithOverflow(InstructionSelectorT<Adapter>* selector,
+                              Node* node, FlagsContinuationT<Adapter>* cont) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Int64BinopMatcher m(node);
   InstructionOperand result = g.DefineAsRegister(node);
   InstructionOperand left = g.UseRegister(m.left().node());
@@ -1767,8 +2078,14 @@ void EmitInt64MulWithOverflow(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
-  Arm64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Mul(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Mul(Node* node) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
 
   // First, try to reduce the multiplication to addition with left shift.
@@ -1808,8 +2125,14 @@ void InstructionSelector::VisitInt32Mul(Node* node) {
   VisitRRR(this, kArm64Mul32, node);
 }
 
-void InstructionSelector::VisitInt64Mul(Node* node) {
-  Arm64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt64Mul(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt64Mul(Node* node) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(this);
   Int64BinopMatcher m(node);
 
   // First, try to reduce the multiplication to addition with left shift.
@@ -1849,294 +2172,395 @@ void InstructionSelector::VisitInt64Mul(Node* node) {
 }
 
 namespace {
-void VisitExtMul(InstructionSelector* selector, ArchOpcode opcode, Node* node,
-                 int dst_lane_size) {
+template <typename Adapter>
+void VisitExtMul(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+                 Node* node, int dst_lane_size) {
   InstructionCode code = opcode;
   code |= LaneSizeField::encode(dst_lane_size);
   VisitRRR(selector, code, node);
 }
 }  // namespace
 
-void InstructionSelector::VisitI16x8ExtMulLowI8x16S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtMulLowI8x16S(Node* node) {
   VisitExtMul(this, kArm64Smull, node, 16);
 }
 
-void InstructionSelector::VisitI16x8ExtMulHighI8x16S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtMulHighI8x16S(Node* node) {
   VisitExtMul(this, kArm64Smull2, node, 16);
 }
 
-void InstructionSelector::VisitI16x8ExtMulLowI8x16U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtMulLowI8x16U(Node* node) {
   VisitExtMul(this, kArm64Umull, node, 16);
 }
 
-void InstructionSelector::VisitI16x8ExtMulHighI8x16U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtMulHighI8x16U(Node* node) {
   VisitExtMul(this, kArm64Umull2, node, 16);
 }
 
-void InstructionSelector::VisitI32x4ExtMulLowI16x8S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtMulLowI16x8S(Node* node) {
   VisitExtMul(this, kArm64Smull, node, 32);
 }
 
-void InstructionSelector::VisitI32x4ExtMulHighI16x8S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtMulHighI16x8S(Node* node) {
   VisitExtMul(this, kArm64Smull2, node, 32);
 }
 
-void InstructionSelector::VisitI32x4ExtMulLowI16x8U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtMulLowI16x8U(Node* node) {
   VisitExtMul(this, kArm64Umull, node, 32);
 }
 
-void InstructionSelector::VisitI32x4ExtMulHighI16x8U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtMulHighI16x8U(Node* node) {
   VisitExtMul(this, kArm64Umull2, node, 32);
 }
 
-void InstructionSelector::VisitI64x2ExtMulLowI32x4S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ExtMulLowI32x4S(Node* node) {
   VisitExtMul(this, kArm64Smull, node, 64);
 }
 
-void InstructionSelector::VisitI64x2ExtMulHighI32x4S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ExtMulHighI32x4S(Node* node) {
   VisitExtMul(this, kArm64Smull2, node, 64);
 }
 
-void InstructionSelector::VisitI64x2ExtMulLowI32x4U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ExtMulLowI32x4U(Node* node) {
   VisitExtMul(this, kArm64Umull, node, 64);
 }
 
-void InstructionSelector::VisitI64x2ExtMulHighI32x4U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ExtMulHighI32x4U(Node* node) {
   VisitExtMul(this, kArm64Umull2, node, 64);
 }
 
 namespace {
-void VisitExtAddPairwise(InstructionSelector* selector, ArchOpcode opcode,
-                         Node* node, int dst_lane_size) {
+template <typename Adapter>
+void VisitExtAddPairwise(InstructionSelectorT<Adapter>* selector,
+                         ArchOpcode opcode, Node* node, int dst_lane_size) {
   InstructionCode code = opcode;
   code |= LaneSizeField::encode(dst_lane_size);
   VisitRR(selector, code, node);
 }
 }  // namespace
 
-void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
   VisitExtAddPairwise(this, kArm64Saddlp, node, 32);
 }
 
-void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
   VisitExtAddPairwise(this, kArm64Uaddlp, node, 32);
 }
 
-void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
   VisitExtAddPairwise(this, kArm64Saddlp, node, 16);
 }
 
-void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
   VisitExtAddPairwise(this, kArm64Uaddlp, node, 16);
 }
 
-void InstructionSelector::VisitInt32MulHigh(Node* node) {
-  Arm64OperandGenerator g(this);
-  InstructionOperand const smull_operand = g.TempRegister();
-  Emit(kArm64Smull, smull_operand, g.UseRegister(node->InputAt(0)),
-       g.UseRegister(node->InputAt(1)));
-  Emit(kArm64Asr, g.DefineAsRegister(node), smull_operand, g.TempImmediate(32));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand const smull_operand = g.TempRegister();
+    Emit(kArm64Smull, smull_operand, g.UseRegister(node->InputAt(0)),
+         g.UseRegister(node->InputAt(1)));
+    Emit(kArm64Asr, g.DefineAsRegister(node), smull_operand,
+         g.TempImmediate(32));
+  }
 }
 
-void InstructionSelector::VisitInt64MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulHigh(node_t node) {
   return VisitRRR(this, kArm64Smulh, node);
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
-  Arm64OperandGenerator g(this);
-  InstructionOperand const smull_operand = g.TempRegister();
-  Emit(kArm64Umull, smull_operand, g.UseRegister(node->InputAt(0)),
-       g.UseRegister(node->InputAt(1)));
-  Emit(kArm64Lsr, g.DefineAsRegister(node), smull_operand, g.TempImmediate(32));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand const smull_operand = g.TempRegister();
+    Emit(kArm64Umull, smull_operand, g.UseRegister(node->InputAt(0)),
+         g.UseRegister(node->InputAt(1)));
+    Emit(kArm64Lsr, g.DefineAsRegister(node), smull_operand,
+         g.TempImmediate(32));
+  }
 }
 
-void InstructionSelector::VisitUint64MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64MulHigh(node_t node) {
   return VisitRRR(this, kArm64Umulh, node);
 }
 
-void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
 
-  InstructionCode opcode = kArm64Float32ToInt32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  opcode |= MiscField::encode(kind == TruncateKind::kSetOverflowToMin);
+    InstructionCode opcode = kArm64Float32ToInt32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    opcode |= MiscField::encode(kind == TruncateKind::kSetOverflowToMin);
 
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
 
-  InstructionCode opcode = kArm64Float32ToUint32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
-  }
+    InstructionCode opcode = kArm64Float32ToUint32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
 
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
 
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
-  }
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Emit(kArm64Float32ToInt64, output_count, outputs, 1, inputs);
+    Emit(kArm64Float32ToInt64, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat64ToInt64(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
 
-  InstructionCode opcode = kArm64Float64ToInt64;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
-  }
+    InstructionCode opcode = kArm64Float64ToInt64;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
 
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
 
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
-  }
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Emit(kArm64Float64ToInt64, output_count, outputs, 1, inputs);
+    Emit(kArm64Float64ToInt64, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
 
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
-  }
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Emit(kArm64Float32ToUint64, output_count, outputs, 1, inputs);
+    Emit(kArm64Float32ToUint64, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
 
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
-  }
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Emit(kArm64Float64ToUint64, output_count, outputs, 1, inputs);
+    Emit(kArm64Float64ToUint64, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
-  Arm64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt32(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
-  }
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Emit(kArm64Float64ToInt32, output_count, outputs, 1, inputs);
+    Emit(kArm64Float64ToInt32, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
-  Arm64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint32(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
-  }
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Emit(kArm64Float64ToUint32, output_count, outputs, 1, inputs);
+    Emit(kArm64Float64ToUint32, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitBitcastWord32ToWord64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32ToWord64(node_t node) {
   DCHECK(SmiValuesAre31Bits());
   DCHECK(COMPRESS_POINTERS_BOOL);
   EmitIdentity(node);
 }
 
-void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
-  Node* value = node->InputAt(0);
-  if ((value->opcode() == IrOpcode::kLoad ||
-       value->opcode() == IrOpcode::kLoadImmutable) &&
-      CanCover(node, value)) {
-    // Generate sign-extending load.
-    LoadRepresentation load_rep = LoadRepresentationOf(value->op());
-    MachineRepresentation rep = load_rep.representation();
-    InstructionCode opcode = kArchNop;
-    ImmediateMode immediate_mode = kNoImmediate;
-    switch (rep) {
-      case MachineRepresentation::kBit:  // Fall through.
-      case MachineRepresentation::kWord8:
-        opcode = load_rep.IsSigned() ? kArm64Ldrsb : kArm64Ldrb;
-        immediate_mode = kLoadStoreImm8;
-        break;
-      case MachineRepresentation::kWord16:
-        opcode = load_rep.IsSigned() ? kArm64Ldrsh : kArm64Ldrh;
-        immediate_mode = kLoadStoreImm16;
-        break;
-      case MachineRepresentation::kWord32:
-      case MachineRepresentation::kTaggedSigned:
-      case MachineRepresentation::kTagged:
-        opcode = kArm64Ldrsw;
-        immediate_mode = kLoadStoreImm32;
-        break;
-      default:
-        UNREACHABLE();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Node* value = node->InputAt(0);
+    if ((value->opcode() == IrOpcode::kLoad ||
+         value->opcode() == IrOpcode::kLoadImmutable) &&
+        CanCover(node, value)) {
+      // Generate sign-extending load.
+      LoadRepresentation load_rep = LoadRepresentationOf(value->op());
+      MachineRepresentation rep = load_rep.representation();
+      InstructionCode opcode = kArchNop;
+      ImmediateMode immediate_mode = kNoImmediate;
+      switch (rep) {
+        case MachineRepresentation::kBit:  // Fall through.
+        case MachineRepresentation::kWord8:
+          opcode = load_rep.IsSigned() ? kArm64Ldrsb : kArm64Ldrb;
+          immediate_mode = kLoadStoreImm8;
+          break;
+        case MachineRepresentation::kWord16:
+          opcode = load_rep.IsSigned() ? kArm64Ldrsh : kArm64Ldrh;
+          immediate_mode = kLoadStoreImm16;
+          break;
+        case MachineRepresentation::kWord32:
+        case MachineRepresentation::kWord64:
+          // Since BitcastElider may remove nodes of
+          // IrOpcode::kTruncateInt64ToInt32 and directly use the inputs, values
+          // with kWord64 can also reach this line.
+        case MachineRepresentation::kTaggedSigned:
+        case MachineRepresentation::kTagged:
+          opcode = kArm64Ldrsw;
+          immediate_mode = kLoadStoreImm32;
+          break;
+        default:
+          UNREACHABLE();
+      }
+      EmitLoad(this, value, opcode, immediate_mode, rep, node);
+      return;
     }
-    EmitLoad(this, value, opcode, immediate_mode, rep, node);
-    return;
-  }
 
-  if (value->opcode() == IrOpcode::kWord32Sar && CanCover(node, value)) {
-    Int32BinopMatcher m(value);
-    if (m.right().HasResolvedValue()) {
-      Arm64OperandGenerator g(this);
-      // Mask the shift amount, to keep the same semantics as Word32Sar.
-      int right = m.right().ResolvedValue() & 0x1F;
-      Emit(kArm64Sbfx, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-           g.TempImmediate(right), g.TempImmediate(32 - right));
-      return;
+    if (value->opcode() == IrOpcode::kWord32Sar && CanCover(node, value)) {
+      Int32BinopMatcher m(value);
+      if (m.right().HasResolvedValue()) {
+        Arm64OperandGeneratorT<Adapter> g(this);
+        // Mask the shift amount, to keep the same semantics as Word32Sar.
+        int right = m.right().ResolvedValue() & 0x1F;
+        Emit(kArm64Sbfx, g.DefineAsRegister(node),
+             g.UseRegister(m.left().node()), g.TempImmediate(right),
+             g.TempImmediate(32 - right));
+        return;
+      }
     }
-  }
 
-  VisitRR(this, kArm64Sxtw, node);
+    VisitRR(this, kArm64Sxtw, node);
+  }
+}
+template <>
+bool InstructionSelectorT<TurboshaftAdapter>::ZeroExtendsWord32ToWord64NoPhis(
+    node_t node) {
+  UNIMPLEMENTED();
 }
 
-bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
+template <>
+bool InstructionSelectorT<TurbofanAdapter>::ZeroExtendsWord32ToWord64NoPhis(
+    Node* node) {
   DCHECK_NE(node->opcode(), IrOpcode::kPhi);
   switch (node->opcode()) {
     case IrOpcode::kWord32And:
@@ -2186,107 +2610,141 @@ bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
   }
 }
 
-void InstructionSelector::VisitChangeUint32ToUint64(Node* node) {
-  Arm64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  if (ZeroExtendsWord32ToWord64(value)) {
-    return EmitIdentity(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToUint64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    if (ZeroExtendsWord32ToWord64(value)) {
+      return EmitIdentity(node);
+    }
+    Emit(kArm64Mov32, g.DefineAsRegister(node), g.UseRegister(value));
   }
-  Emit(kArm64Mov32, g.DefineAsRegister(node), g.UseRegister(value));
 }
 
-void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateInt64ToInt32(node_t node) {
+  Arm64OperandGeneratorT<Adapter> g(this);
   // The top 32 bits in the 64-bit register will be undefined, and
   // must not be used by a dependent node.
   EmitIdentity(node);
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  Arm64OperandGenerator g(this);
-  Emit(kArm64Float64Mod, g.DefineAsFixed(node, d0),
-       g.UseFixed(node->InputAt(0), d0), g.UseFixed(node->InputAt(1), d1))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Emit(kArm64Float64Mod, g.DefineAsFixed(node, d0),
+         g.UseFixed(node->InputAt(0), d0), g.UseFixed(node->InputAt(1), d1))
+        ->MarkAsCall();
+  }
+}
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  Arm64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Binop(
+    Node* node, InstructionCode opcode) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, d0), g.UseFixed(node->InputAt(0), d0),
        g.UseFixed(node->InputAt(1), d1))
       ->MarkAsCall();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  Arm64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Unop(
+    Node* node, InstructionCode opcode) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, d0), g.UseFixed(node->InputAt(0), d0))
       ->MarkAsCall();
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int index) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node, int index) {
+}
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {}
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  Arm64OperandGenerator g(this);
-
-  // `arguments` includes alignment "holes". This means that slots bigger than
-  // kSystemPointerSize, e.g. Simd128, will span across multiple arguments.
-  int claim_count = static_cast<int>(arguments->size());
-  bool needs_padding = claim_count % 2 != 0;
-  int slot = claim_count - 1;
-  claim_count = RoundUp(claim_count, 2);
-  // Bump the stack pointer.
-  if (claim_count > 0) {
-    // TODO(titzer): claim and poke probably take small immediates.
-    // TODO(titzer): it would be better to bump the sp here only
-    //               and emit paired stores with increment for non c frames.
-    Emit(kArm64Claim, g.NoOutput(), g.TempImmediate(claim_count));
-
-    if (needs_padding) {
-      Emit(kArm64Poke, g.NoOutput(), g.UseImmediate(0),
-           g.TempImmediate(claim_count - 1));
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+
+    // `arguments` includes alignment "holes". This means that slots bigger than
+    // kSystemPointerSize, e.g. Simd128, will span across multiple arguments.
+    int claim_count = static_cast<int>(arguments->size());
+    bool needs_padding = claim_count % 2 != 0;
+    int slot = claim_count - 1;
+    claim_count = RoundUp(claim_count, 2);
+    // Bump the stack pointer.
+    if (claim_count > 0) {
+      // TODO(titzer): claim and poke probably take small immediates.
+      // TODO(titzer): it would be better to bump the sp here only
+      //               and emit paired stores with increment for non c frames.
+      Emit(kArm64Claim, g.NoOutput(), g.TempImmediate(claim_count));
+
+      if (needs_padding) {
+        Emit(kArm64Poke, g.NoOutput(), g.UseImmediate(0),
+             g.TempImmediate(claim_count - 1));
+      }
     }
-  }
 
-  // Poke the arguments into the stack.
-  while (slot >= 0) {
-    PushParameter input0 = (*arguments)[slot];
-    // Skip holes in the param array. These represent both extra slots for
-    // multi-slot values and padding slots for alignment.
-    if (input0.node == nullptr) {
-      slot--;
-      continue;
-    }
-    PushParameter input1 = slot > 0 ? (*arguments)[slot - 1] : PushParameter();
-    // Emit a poke-pair if consecutive parameters have the same type.
-    // TODO(arm): Support consecutive Simd128 parameters.
-    if (input1.node != nullptr &&
-        input0.location.GetType() == input1.location.GetType()) {
-      Emit(kArm64PokePair, g.NoOutput(), g.UseRegister(input0.node),
-           g.UseRegister(input1.node), g.TempImmediate(slot));
-      slot -= 2;
-    } else {
-      Emit(kArm64Poke, g.NoOutput(), g.UseRegister(input0.node),
-           g.TempImmediate(slot));
-      slot--;
+    // Poke the arguments into the stack.
+    while (slot >= 0) {
+      PushParameter input0 = (*arguments)[slot];
+      // Skip holes in the param array. These represent both extra slots for
+      // multi-slot values and padding slots for alignment.
+      if (input0.node == nullptr) {
+        slot--;
+        continue;
+      }
+      PushParameter input1 =
+          slot > 0 ? (*arguments)[slot - 1] : PushParameter();
+      // Emit a poke-pair if consecutive parameters have the same type.
+      // TODO(arm): Support consecutive Simd128 parameters.
+      if (input1.node != nullptr &&
+          input0.location.GetType() == input1.location.GetType()) {
+        Emit(kArm64PokePair, g.NoOutput(), g.UseRegister(input0.node),
+             g.UseRegister(input1.node), g.TempImmediate(slot));
+        slot -= 2;
+      } else {
+        Emit(kArm64Poke, g.NoOutput(), g.UseRegister(input0.node),
+             g.TempImmediate(slot));
+        slot--;
+      }
     }
   }
 }
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  Arm64OperandGenerator g(this);
+    node_t node) {
+  Arm64OperandGeneratorT<Adapter> g(this);
 
   for (PushParameter output : *results) {
     if (!output.location.IsCallerFrameSlot()) continue;
     // Skip any alignment holes in nodes.
-    if (output.node != nullptr) {
+    if (this->valid(output.node)) {
       DCHECK(!call_descriptor->IsCFunctionCall());
 
       if (output.location.GetType() == MachineType::Float32()) {
@@ -2305,16 +2763,20 @@ void InstructionSelector::EmitPrepareResults(
   }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return false; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return false;
+}
 
 namespace {
 
 // Shared routine for multiple compare operations.
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  InstructionOperand left, InstructionOperand right,
-                  FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, InstructionOperand left,
+                  InstructionOperand right, FlagsContinuationT<Adapter>* cont) {
   if (cont->IsSelect()) {
-    Arm64OperandGenerator g(selector);
+    Arm64OperandGeneratorT<Adapter> g(selector);
     InstructionOperand inputs[] = {left, right,
                                    g.UseRegister(cont->true_value()),
                                    g.UseRegister(cont->false_value())};
@@ -2376,12 +2838,11 @@ FlagsCondition MapForFlagSettingBinop(FlagsCondition cond) {
 // (a <ops> b), b.<cond'>
 // where <ops> is the flag setting version of <op>, and if so,
 // updates {node}, {opcode} and {cont} accordingly.
-void MaybeReplaceCmpZeroWithFlagSettingBinop(InstructionSelector* selector,
-                                             Node** node, Node* binop,
-                                             ArchOpcode* opcode,
-                                             FlagsCondition cond,
-                                             FlagsContinuation* cont,
-                                             ImmediateMode* immediate_mode) {
+template <typename Adapter>
+void MaybeReplaceCmpZeroWithFlagSettingBinop(
+    InstructionSelectorT<Adapter>* selector, Node** node, Node* binop,
+    ArchOpcode* opcode, FlagsCondition cond, FlagsContinuationT<Adapter>* cont,
+    ImmediateMode* immediate_mode) {
   ArchOpcode binop_opcode;
   ArchOpcode no_output_opcode;
   ImmediateMode binop_immediate_mode;
@@ -2448,9 +2909,10 @@ FlagsCondition MapForCbz(FlagsCondition cond) {
   }
 }
 
-void EmitBranchOrDeoptimize(InstructionSelector* selector,
+template <typename Adapter>
+void EmitBranchOrDeoptimize(InstructionSelectorT<Adapter>* selector,
                             InstructionCode opcode, InstructionOperand value,
-                            FlagsContinuation* cont) {
+                            FlagsContinuationT<Adapter>* cont) {
   DCHECK(cont->IsBranch() || cont->IsDeoptimize());
   selector->EmitWithContinuation(opcode, value, cont);
 }
@@ -2481,10 +2943,11 @@ struct CbzOrTbzMatchTrait<64> {
 
 // Try to emit TBZ, TBNZ, CBZ or CBNZ for certain comparisons of {node}
 // against {value}, depending on the condition.
-template <int N>
-bool TryEmitCbzOrTbz(InstructionSelector* selector, Node* node,
+template <typename Adapter, int N>
+bool TryEmitCbzOrTbz(InstructionSelectorT<Adapter>* selector, Node* node,
                      typename CbzOrTbzMatchTrait<N>::IntegralType value,
-                     Node* user, FlagsCondition cond, FlagsContinuation* cont) {
+                     Node* user, FlagsCondition cond,
+                     FlagsContinuationT<Adapter>* cont) {
   // Only handle branches and deoptimisations.
   if (!cont->IsBranch() && !cont->IsDeoptimize()) return false;
 
@@ -2497,7 +2960,7 @@ bool TryEmitCbzOrTbz(InstructionSelector* selector, Node* node,
       // shorter range than conditional branches and generating them for
       // deoptimisations results in more veneers.
       if (cont->IsDeoptimize()) return false;
-      Arm64OperandGenerator g(selector);
+      Arm64OperandGeneratorT<Adapter> g(selector);
       cont->Overwrite(MapForTbz(cond));
 
       if (N == 32) {
@@ -2528,7 +2991,7 @@ bool TryEmitCbzOrTbz(InstructionSelector* selector, Node* node,
         typename CbzOrTbzMatchTrait<N>::BinopMatcher m_and(node);
         if (cont->IsBranch() && base::bits::IsPowerOfTwo(value) &&
             m_and.right().Is(value) && selector->CanCover(user, node)) {
-          Arm64OperandGenerator g(selector);
+          Arm64OperandGeneratorT<Adapter> g(selector);
           // In the code generator, Equal refers to a bit being cleared. We want
           // the opposite here so negate the condition.
           cont->Negate();
@@ -2544,7 +3007,7 @@ bool TryEmitCbzOrTbz(InstructionSelector* selector, Node* node,
     case kUnsignedLessThanOrEqual:
     case kUnsignedGreaterThan: {
       if (value != 0) return false;
-      Arm64OperandGenerator g(selector);
+      Arm64OperandGeneratorT<Adapter> g(selector);
       cont->Overwrite(MapForCbz(cond));
       EmitBranchOrDeoptimize(selector,
                              CbzOrTbzMatchTrait<N>::kCompareAndBranchOpcode,
@@ -2557,10 +3020,11 @@ bool TryEmitCbzOrTbz(InstructionSelector* selector, Node* node,
 }
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont,
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector, Node* node,
+                      InstructionCode opcode, FlagsContinuationT<Adapter>* cont,
                       ImmediateMode immediate_mode) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
 
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
@@ -2575,8 +3039,8 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
   if (opcode == kArm64Cmp) {
     Int64Matcher m(right);
     if (m.HasResolvedValue()) {
-      if (TryEmitCbzOrTbz<64>(selector, left, m.ResolvedValue(), node,
-                              cont->condition(), cont)) {
+      if (TryEmitCbzOrTbz<Adapter, 64>(selector, left, m.ResolvedValue(), node,
+                                       cont->condition(), cont)) {
         return;
       }
     }
@@ -2586,88 +3050,100 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
                g.UseOperand(right, immediate_mode), cont);
 }
 
-void VisitWord32Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
-  Int32BinopMatcher m(node);
-  FlagsCondition cond = cont->condition();
-  if (m.right().HasResolvedValue()) {
-    if (TryEmitCbzOrTbz<32>(selector, m.left().node(),
-                            m.right().ResolvedValue(), node, cond, cont)) {
-      return;
-    }
-  } else if (m.left().HasResolvedValue()) {
-    FlagsCondition commuted_cond = CommuteFlagsCondition(cond);
-    if (TryEmitCbzOrTbz<32>(selector, m.right().node(),
-                            m.left().ResolvedValue(), node, commuted_cond,
-                            cont)) {
-      return;
-    }
-  }
-  ArchOpcode opcode = kArm64Cmp32;
-  ImmediateMode immediate_mode = kArithmeticImm;
-  if (m.right().Is(0) && (m.left().IsInt32Add() || m.left().IsWord32And())) {
-    // Emit flag setting add/and instructions for comparisons against zero.
-    if (CanUseFlagSettingBinop(cond)) {
-      Node* binop = m.left().node();
-      MaybeReplaceCmpZeroWithFlagSettingBinop(selector, &node, binop, &opcode,
-                                              cond, cont, &immediate_mode);
-    }
-  } else if (m.left().Is(0) &&
-             (m.right().IsInt32Add() || m.right().IsWord32And())) {
-    // Same as above, but we need to commute the condition before we
-    // continue with the rest of the checks.
-    FlagsCondition commuted_cond = CommuteFlagsCondition(cond);
-    if (CanUseFlagSettingBinop(commuted_cond)) {
-      Node* binop = m.right().node();
-      MaybeReplaceCmpZeroWithFlagSettingBinop(selector, &node, binop, &opcode,
-                                              commuted_cond, cont,
-                                              &immediate_mode);
+template <typename Adapter>
+void VisitWord32Compare(InstructionSelectorT<Adapter>* selector,
+                        typename Adapter::node_t node,
+                        FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    FlagsCondition cond = cont->condition();
+    if (m.right().HasResolvedValue()) {
+      if (TryEmitCbzOrTbz<Adapter, 32>(selector, m.left().node(),
+                                       m.right().ResolvedValue(), node, cond,
+                                       cont)) {
+        return;
+      }
+    } else if (m.left().HasResolvedValue()) {
+      FlagsCondition commuted_cond = CommuteFlagsCondition(cond);
+      if (TryEmitCbzOrTbz<Adapter, 32>(selector, m.right().node(),
+                                       m.left().ResolvedValue(), node,
+                                       commuted_cond, cont)) {
+        return;
+      }
     }
-  } else if (m.right().IsInt32Sub() && (cond == kEqual || cond == kNotEqual)) {
-    // Select negated compare for comparisons with negated right input.
-    // Only do this for kEqual and kNotEqual, which do not depend on the
-    // C and V flags, as those flags will be different with CMN when the
-    // right-hand side of the original subtraction is INT_MIN.
-    Node* sub = m.right().node();
-    Int32BinopMatcher msub(sub);
-    if (msub.left().Is(0)) {
-      bool can_cover = selector->CanCover(node, sub);
-      node->ReplaceInput(1, msub.right().node());
-      // Even if the comparison node covers the subtraction, after the input
-      // replacement above, the node still won't cover the input to the
-      // subtraction; the subtraction still uses it.
-      // In order to get shifted operations to work, we must remove the rhs
-      // input to the subtraction, as TryMatchAnyShift requires this node to
-      // cover the input shift. We do this by setting it to the lhs input,
-      // as we know it's zero, and the result of the subtraction isn't used by
-      // any other node.
-      if (can_cover) sub->ReplaceInput(1, msub.left().node());
-      opcode = kArm64Cmn32;
+    ArchOpcode opcode = kArm64Cmp32;
+    ImmediateMode immediate_mode = kArithmeticImm;
+    if (m.right().Is(0) && (m.left().IsInt32Add() || m.left().IsWord32And())) {
+      // Emit flag setting add/and instructions for comparisons against zero.
+      if (CanUseFlagSettingBinop(cond)) {
+        Node* binop = m.left().node();
+        MaybeReplaceCmpZeroWithFlagSettingBinop(selector, &node, binop, &opcode,
+                                                cond, cont, &immediate_mode);
+      }
+    } else if (m.left().Is(0) &&
+               (m.right().IsInt32Add() || m.right().IsWord32And())) {
+      // Same as above, but we need to commute the condition before we
+      // continue with the rest of the checks.
+      FlagsCondition commuted_cond = CommuteFlagsCondition(cond);
+      if (CanUseFlagSettingBinop(commuted_cond)) {
+        Node* binop = m.right().node();
+        MaybeReplaceCmpZeroWithFlagSettingBinop(selector, &node, binop, &opcode,
+                                                commuted_cond, cont,
+                                                &immediate_mode);
+      }
+    } else if (m.right().IsInt32Sub() &&
+               (cond == kEqual || cond == kNotEqual)) {
+      // Select negated compare for comparisons with negated right input.
+      // Only do this for kEqual and kNotEqual, which do not depend on the
+      // C and V flags, as those flags will be different with CMN when the
+      // right-hand side of the original subtraction is INT_MIN.
+      Node* sub = m.right().node();
+      Int32BinopMatcher msub(sub);
+      if (msub.left().Is(0)) {
+        bool can_cover = selector->CanCover(node, sub);
+        node->ReplaceInput(1, msub.right().node());
+        // Even if the comparison node covers the subtraction, after the input
+        // replacement above, the node still won't cover the input to the
+        // subtraction; the subtraction still uses it.
+        // In order to get shifted operations to work, we must remove the rhs
+        // input to the subtraction, as TryMatchAnyShift requires this node to
+        // cover the input shift. We do this by setting it to the lhs input,
+        // as we know it's zero, and the result of the subtraction isn't used by
+        // any other node.
+        if (can_cover) sub->ReplaceInput(1, msub.left().node());
+        opcode = kArm64Cmn32;
+      }
     }
+    VisitBinop<Adapter, Int32BinopMatcher>(selector, node, opcode,
+                                           immediate_mode, cont);
   }
-  VisitBinop<Int32BinopMatcher>(selector, node, opcode, immediate_mode, cont);
 }
 
-void VisitWordTest(InstructionSelector* selector, Node* node,
-                   InstructionCode opcode, FlagsContinuation* cont) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitWordTest(InstructionSelectorT<Adapter>* selector, Node* node,
+                   InstructionCode opcode, FlagsContinuationT<Adapter>* cont) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   VisitCompare(selector, opcode, g.UseRegister(node), g.UseRegister(node),
                cont);
 }
 
-void VisitWord32Test(InstructionSelector* selector, Node* node,
-                     FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWord32Test(InstructionSelectorT<Adapter>* selector, Node* node,
+                     FlagsContinuationT<Adapter>* cont) {
   VisitWordTest(selector, node, kArm64Tst32, cont);
 }
 
-void VisitWord64Test(InstructionSelector* selector, Node* node,
-                     FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWord64Test(InstructionSelectorT<Adapter>* selector, Node* node,
+                     FlagsContinuationT<Adapter>* cont) {
   VisitWordTest(selector, node, kArm64Tst, cont);
 }
 
-template <typename Matcher>
+template <typename Adapter, typename Matcher>
 struct TestAndBranchMatcher {
-  TestAndBranchMatcher(Node* node, FlagsContinuation* cont)
+  TestAndBranchMatcher(Node* node, FlagsContinuationT<Adapter>* cont)
       : matches_(false), cont_(cont), matcher_(node) {
     Initialize();
   }
@@ -2685,7 +3161,7 @@ struct TestAndBranchMatcher {
 
  private:
   bool matches_;
-  FlagsContinuation* cont_;
+  FlagsContinuationT<Adapter>* cont_;
   Matcher matcher_;
 
   void Initialize() {
@@ -2702,45 +3178,58 @@ struct TestAndBranchMatcher {
 };
 
 // Shared routine for multiple float32 compare operations.
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Arm64OperandGenerator g(selector);
-  Float32BinopMatcher m(node);
-  if (m.right().Is(0.0f)) {
-    VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.left().node()),
-                 g.UseImmediate(m.right().node()), cont);
-  } else if (m.left().Is(0.0f)) {
-    cont->Commute();
-    VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.right().node()),
-                 g.UseImmediate(m.left().node()), cont);
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.left().node()),
-                 g.UseRegister(m.right().node()), cont);
+    Arm64OperandGeneratorT<Adapter> g(selector);
+    Float32BinopMatcher m(node);
+    if (m.right().Is(0.0f)) {
+      VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.left().node()),
+                   g.UseImmediate(m.right().node()), cont);
+    } else if (m.left().Is(0.0f)) {
+      cont->Commute();
+      VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.right().node()),
+                   g.UseImmediate(m.left().node()), cont);
+    } else {
+      VisitCompare(selector, kArm64Float32Cmp, g.UseRegister(m.left().node()),
+                   g.UseRegister(m.right().node()), cont);
+    }
   }
 }
 
 // Shared routine for multiple float64 compare operations.
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Arm64OperandGenerator g(selector);
-  Float64BinopMatcher m(node);
-  if (m.right().Is(0.0)) {
-    VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.left().node()),
-                 g.UseImmediate(m.right().node()), cont);
-  } else if (m.left().Is(0.0)) {
-    cont->Commute();
-    VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.right().node()),
-                 g.UseImmediate(m.left().node()), cont);
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.left().node()),
-                 g.UseRegister(m.right().node()), cont);
+    Arm64OperandGeneratorT<Adapter> g(selector);
+    Float64BinopMatcher m(node);
+    if (m.right().Is(0.0)) {
+      VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.left().node()),
+                   g.UseImmediate(m.right().node()), cont);
+    } else if (m.left().Is(0.0)) {
+      cont->Commute();
+      VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.right().node()),
+                   g.UseImmediate(m.left().node()), cont);
+    } else {
+      VisitCompare(selector, kArm64Float64Cmp, g.UseRegister(m.left().node()),
+                   g.UseRegister(m.right().node()), cont);
+    }
   }
 }
 
-void VisitAtomicExchange(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicExchange(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode, AtomicWidth width,
                          MemoryAccessKind access_kind) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2763,10 +3252,12 @@ void VisitAtomicExchange(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
-                                ArchOpcode opcode, AtomicWidth width,
+template <typename Adapter>
+void VisitAtomicCompareExchange(InstructionSelectorT<Adapter>* selector,
+                                Node* node, ArchOpcode opcode,
+                                AtomicWidth width,
                                 MemoryAccessKind access_kind) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -2793,9 +3284,10 @@ void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitAtomicLoad(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicLoad(InstructionSelectorT<Adapter>* selector, Node* node,
                      AtomicWidth width) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   InstructionOperand inputs[] = {g.UseRegister(base), g.UseRegister(index)};
@@ -2863,9 +3355,15 @@ void VisitAtomicLoad(InstructionSelector* selector, Node* node,
                  arraysize(temps), temps);
 }
 
-void VisitAtomicStore(InstructionSelector* selector, Node* node,
-                      AtomicWidth width) {
-  Arm64OperandGenerator g(selector);
+template <typename T>
+void VisitAtomicStore(InstructionSelectorT<TurboshaftAdapter>*, T,
+                      AtomicWidth) {
+  UNIMPLEMENTED();
+}
+
+void VisitAtomicStore(InstructionSelectorT<TurbofanAdapter>* selector,
+                      Node* node, AtomicWidth width) {
+  Arm64OperandGeneratorT<TurbofanAdapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2938,10 +3436,11 @@ void VisitAtomicStore(InstructionSelector* selector, Node* node,
                  temps);
 }
 
-void VisitAtomicBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                       ArchOpcode opcode, AtomicWidth width,
                       MemoryAccessKind access_kind) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2969,618 +3468,759 @@ void VisitAtomicBinop(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  Arm64OperandGenerator g(this);
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
-    Int32BinopMatcher m(value);
-    if (!m.right().Is(0)) break;
-
-    user = value;
-    value = m.left().node();
-    cont->Negate();
-  }
-
-  // Try to match bit checks to create TBZ/TBNZ instructions.
-  // Unlike the switch below, CanCover check is not needed here.
-  // If there are several uses of the given operation, we will generate a TBZ
-  // instruction for each. This is useful even if there are other uses of the
-  // arithmetic result, because it moves dependencies further back.
-  switch (value->opcode()) {
-    case IrOpcode::kWord64Equal: {
-      Int64BinopMatcher m(value);
-      if (m.right().Is(0)) {
-        Node* const left = m.left().node();
-        if (left->opcode() == IrOpcode::kWord64And) {
-          // Attempt to merge the Word64Equal(Word64And(x, y), 0) comparison
-          // into a tbz/tbnz instruction.
-          TestAndBranchMatcher<Uint64BinopMatcher> tbm(left, cont);
-          if (tbm.Matches()) {
-            Arm64OperandGenerator gen(this);
-            cont->OverwriteAndNegateIfEqual(kEqual);
-            this->EmitWithContinuation(kArm64TestAndBranch,
-                                       gen.UseRegister(tbm.input()),
-                                       gen.TempImmediate(tbm.bit()), cont);
-            return;
-          }
-        }
-      }
-      break;
-    }
-    case IrOpcode::kWord32And: {
-      TestAndBranchMatcher<Uint32BinopMatcher> tbm(value, cont);
-      if (tbm.Matches()) {
-        Arm64OperandGenerator gen(this);
-        this->EmitWithContinuation(kArm64TestAndBranch32,
-                                   gen.UseRegister(tbm.input()),
-                                   gen.TempImmediate(tbm.bit()), cont);
-        return;
-      }
-      break;
-    }
-    case IrOpcode::kWord64And: {
-      TestAndBranchMatcher<Uint64BinopMatcher> tbm(value, cont);
-      if (tbm.Matches()) {
-        Arm64OperandGenerator gen(this);
-        this->EmitWithContinuation(kArm64TestAndBranch,
-                                   gen.UseRegister(tbm.input()),
-                                   gen.TempImmediate(tbm.bit()), cont);
-        return;
-      }
-      break;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuation* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
+      Int32BinopMatcher m(value);
+      if (!m.right().Is(0)) break;
+
+      user = value;
+      value = m.left().node();
+      cont->Negate();
     }
-    default:
-      break;
-  }
 
-  if (CanCover(user, value)) {
+    // Try to match bit checks to create TBZ/TBNZ instructions.
+    // Unlike the switch below, CanCover check is not needed here.
+    // If there are several uses of the given operation, we will generate a TBZ
+    // instruction for each. This is useful even if there are other uses of the
+    // arithmetic result, because it moves dependencies further back.
     switch (value->opcode()) {
-      case IrOpcode::kWord32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
       case IrOpcode::kWord64Equal: {
-        cont->OverwriteAndNegateIfEqual(kEqual);
         Int64BinopMatcher m(value);
         if (m.right().Is(0)) {
           Node* const left = m.left().node();
-          if (CanCover(value, left) && left->opcode() == IrOpcode::kWord64And) {
-            return VisitWordCompare(this, left, kArm64Tst, cont, kLogical64Imm);
+          if (left->opcode() == IrOpcode::kWord64And) {
+            // Attempt to merge the Word64Equal(Word64And(x, y), 0) comparison
+            // into a tbz/tbnz instruction.
+            TestAndBranchMatcher<Adapter, Uint64BinopMatcher> tbm(left, cont);
+            if (tbm.Matches()) {
+              Arm64OperandGeneratorT<Adapter> gen(this);
+              cont->OverwriteAndNegateIfEqual(kEqual);
+              this->EmitWithContinuation(kArm64TestAndBranch,
+                                         gen.UseRegister(tbm.input()),
+                                         gen.TempImmediate(tbm.bit()), cont);
+              return;
+            }
           }
         }
-        return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
+        break;
       }
-      case IrOpcode::kInt64LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
-      case IrOpcode::kInt64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
-      case IrOpcode::kUint64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
-      case IrOpcode::kUint64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
-      case IrOpcode::kFloat32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThan:
-        cont->OverwriteAndNegateIfEqual(kFloatLessThan);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThan:
-        cont->OverwriteAndNegateIfEqual(kFloatLessThan);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kProjection:
-        // Check if this is the overflow output projection of an
-        // <Operation>WithOverflow node.
-        if (ProjectionIndexOf(value->op()) == 1u) {
-          // We cannot combine the <Operation>WithOverflow with this branch
-          // unless the 0th projection (the use of the actual value of the
-          // <Operation> is either nullptr, which means there's no use of the
-          // actual value, or was already defined, which means it is scheduled
-          // *AFTER* this branch).
-          Node* const node = value->InputAt(0);
-          Node* const result = NodeProperties::FindProjection(node, 0);
-          if (result == nullptr || IsDefined(result)) {
-            switch (node->opcode()) {
-              case IrOpcode::kInt32AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop<Int32BinopMatcher>(this, node, kArm64Add32,
-                                                     kArithmeticImm, cont);
-              case IrOpcode::kInt32SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop<Int32BinopMatcher>(this, node, kArm64Sub32,
-                                                     kArithmeticImm, cont);
-              case IrOpcode::kInt32MulWithOverflow:
-                // ARM64 doesn't set the overflow flag for multiplication, so we
-                // need to test on kNotEqual. Here is the code sequence used:
-                //   smull result, left, right
-                //   cmp result.X(), Operand(result, SXTW)
-                cont->OverwriteAndNegateIfEqual(kNotEqual);
-                return EmitInt32MulWithOverflow(this, node, cont);
-              case IrOpcode::kInt64AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop<Int64BinopMatcher>(this, node, kArm64Add,
-                                                     kArithmeticImm, cont);
-              case IrOpcode::kInt64SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop<Int64BinopMatcher>(this, node, kArm64Sub,
-                                                     kArithmeticImm, cont);
-              case IrOpcode::kInt64MulWithOverflow:
-                // ARM64 doesn't set the overflow flag for multiplication, so we
-                // need to test on kNotEqual. Here is the code sequence used:
-                //   mul result, left, right
-                //   smulh high, left, right
-                //   cmp high, result, asr 63
-                cont->OverwriteAndNegateIfEqual(kNotEqual);
-                return EmitInt64MulWithOverflow(this, node, cont);
-              default:
-                break;
-            }
-          }
+      case IrOpcode::kWord32And: {
+        TestAndBranchMatcher<Adapter, Uint32BinopMatcher> tbm(value, cont);
+        if (tbm.Matches()) {
+          Arm64OperandGeneratorT<Adapter> gen(this);
+          this->EmitWithContinuation(kArm64TestAndBranch32,
+                                     gen.UseRegister(tbm.input()),
+                                     gen.TempImmediate(tbm.bit()), cont);
+          return;
         }
         break;
-      case IrOpcode::kInt32Add:
-        return VisitWordCompare(this, value, kArm64Cmn32, cont, kArithmeticImm);
-      case IrOpcode::kInt32Sub:
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kWord32And:
-        return VisitWordCompare(this, value, kArm64Tst32, cont, kLogical32Imm);
-      case IrOpcode::kWord64And:
-        return VisitWordCompare(this, value, kArm64Tst, cont, kLogical64Imm);
-      case IrOpcode::kStackPointerGreaterThan:
-        cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
-        return VisitStackPointerGreaterThan(value, cont);
-      default:
+      }
+      case IrOpcode::kWord64And: {
+        TestAndBranchMatcher<Adapter, Uint64BinopMatcher> tbm(value, cont);
+        if (tbm.Matches()) {
+          Arm64OperandGeneratorT<Adapter> gen(this);
+          this->EmitWithContinuation(kArm64TestAndBranch,
+                                     gen.UseRegister(tbm.input()),
+                                     gen.TempImmediate(tbm.bit()), cont);
+          return;
+        }
         break;
-    }
-  }
-
-  // Branch could not be combined with a compare, compare against 0 and branch.
-  if (cont->IsBranch()) {
-    Emit(cont->Encode(kArm64CompareAndBranch32), g.NoOutput(),
-         g.UseRegister(value), g.Label(cont->true_block()),
-         g.Label(cont->false_block()));
-  } else {
-    VisitCompare(this, cont->Encode(kArm64Tst32), g.UseRegister(value),
-                 g.UseRegister(value), cont);
-  }
-}
-
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  Arm64OperandGenerator g(this);
-  InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
-
-  // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
-    static const size_t kMaxTableSwitchValueRange = 2 << 16;
-    size_t table_space_cost = 4 + sw.value_range();
-    size_t table_time_cost = 3;
-    size_t lookup_space_cost = 3 + 2 * sw.case_count();
-    size_t lookup_time_cost = sw.case_count();
-    if (sw.case_count() > 4 &&
-        table_space_cost + 3 * table_time_cost <=
-            lookup_space_cost + 3 * lookup_time_cost &&
-        sw.min_value() > std::numeric_limits<int32_t>::min() &&
-        sw.value_range() <= kMaxTableSwitchValueRange) {
-      InstructionOperand index_operand = value_operand;
-      if (sw.min_value()) {
-        index_operand = g.TempRegister();
-        Emit(kArm64Sub32, index_operand, value_operand,
-             g.TempImmediate(sw.min_value()));
       }
-      // Generate a table lookup.
-      return EmitTableSwitch(sw, index_operand);
+      default:
+        break;
     }
-  }
-
-  // Generate a tree of conditional jumps.
-  return EmitBinarySearchSwitch(sw, value_operand);
-}
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
-  Node* const user = node;
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int32BinopMatcher m(user);
-  if (m.right().Is(0)) {
-    Node* const value = m.left().node();
     if (CanCover(user, value)) {
       switch (value->opcode()) {
+        case IrOpcode::kWord32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kWord64Equal: {
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          Int64BinopMatcher m(value);
+          if (m.right().Is(0)) {
+            Node* const left = m.left().node();
+            if (CanCover(value, left) &&
+                left->opcode() == IrOpcode::kWord64And) {
+              return VisitWordCompare(this, left, kArm64Tst, cont,
+                                      kLogical64Imm);
+            }
+          }
+          return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
+        }
+        case IrOpcode::kInt64LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
+        case IrOpcode::kInt64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
+        case IrOpcode::kUint64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
+        case IrOpcode::kUint64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWordCompare(this, value, kArm64Cmp, cont, kArithmeticImm);
+        case IrOpcode::kFloat32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThan:
+          cont->OverwriteAndNegateIfEqual(kFloatLessThan);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThan:
+          cont->OverwriteAndNegateIfEqual(kFloatLessThan);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kFloatLessThanOrEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kProjection:
+          // Check if this is the overflow output projection of an
+          // <Operation>WithOverflow node.
+          if (ProjectionIndexOf(value->op()) == 1u) {
+            // We cannot combine the <Operation>WithOverflow with this branch
+            // unless the 0th projection (the use of the actual value of the
+            // <Operation> is either nullptr, which means there's no use of the
+            // actual value, or was already defined, which means it is scheduled
+            // *AFTER* this branch).
+            Node* const node = value->InputAt(0);
+            Node* const result = NodeProperties::FindProjection(node, 0);
+            if (result == nullptr || IsDefined(result)) {
+              switch (node->opcode()) {
+                case IrOpcode::kInt32AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kArm64Add32, kArithmeticImm, cont);
+                case IrOpcode::kInt32SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kArm64Sub32, kArithmeticImm, cont);
+                case IrOpcode::kInt32MulWithOverflow:
+                  // ARM64 doesn't set the overflow flag for multiplication, so
+                  // we need to test on kNotEqual. Here is the code sequence
+                  // used:
+                  //   smull result, left, right
+                  //   cmp result.X(), Operand(result, SXTW)
+                  cont->OverwriteAndNegateIfEqual(kNotEqual);
+                  return EmitInt32MulWithOverflow(this, node, cont);
+                case IrOpcode::kInt64AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int64BinopMatcher>(
+                      this, node, kArm64Add, kArithmeticImm, cont);
+                case IrOpcode::kInt64SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int64BinopMatcher>(
+                      this, node, kArm64Sub, kArithmeticImm, cont);
+                case IrOpcode::kInt64MulWithOverflow:
+                  // ARM64 doesn't set the overflow flag for multiplication, so
+                  // we need to test on kNotEqual. Here is the code sequence
+                  // used:
+                  //   mul result, left, right
+                  //   smulh high, left, right
+                  //   cmp high, result, asr 63
+                  cont->OverwriteAndNegateIfEqual(kNotEqual);
+                  return EmitInt64MulWithOverflow(this, node, cont);
+                default:
+                  break;
+              }
+            }
+          }
+          break;
         case IrOpcode::kInt32Add:
-        case IrOpcode::kWord32And:
-          return VisitWord32Compare(this, node, &cont);
-        case IrOpcode::kInt32Sub:
-          return VisitWordCompare(this, value, kArm64Cmp32, &cont,
+          return VisitWordCompare(this, value, kArm64Cmn32, cont,
                                   kArithmeticImm);
-        case IrOpcode::kWord32Equal: {
-          // Word32Equal(Word32Equal(x, y), 0) => Word32Compare(x, y, ne).
-          Int32BinopMatcher mequal(value);
-          node->ReplaceInput(0, mequal.left().node());
-          node->ReplaceInput(1, mequal.right().node());
-          cont.Negate();
-          // {node} still does not cover its new operands, because {mequal} is
-          // still using them.
-          // Since we won't generate any more code for {mequal}, set its
-          // operands to zero to make sure {node} can cover them.
-          // This improves pattern matching in VisitWord32Compare.
-          mequal.node()->ReplaceInput(0, m.right().node());
-          mequal.node()->ReplaceInput(1, m.right().node());
-          return VisitWord32Compare(this, node, &cont);
-        }
+        case IrOpcode::kInt32Sub:
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kWord32And:
+          return VisitWordCompare(this, value, kArm64Tst32, cont,
+                                  kLogical32Imm);
+        case IrOpcode::kWord64And:
+          return VisitWordCompare(this, value, kArm64Tst, cont, kLogical64Imm);
+        case IrOpcode::kStackPointerGreaterThan:
+          cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
+          return VisitStackPointerGreaterThan(value, cont);
         default:
           break;
       }
-      return VisitWord32Test(this, value, &cont);
+    }
+
+    // Branch could not be combined with a compare, compare against 0 and
+    // branch.
+    if (cont->IsBranch()) {
+      Emit(cont->Encode(kArm64CompareAndBranch32), g.NoOutput(),
+           g.UseRegister(value), g.Label(cont->true_block()),
+           g.Label(cont->false_block()));
+    } else {
+      VisitCompare(this, cont->Encode(kArm64Tst32), g.UseRegister(value),
+                   g.UseRegister(value), cont);
     }
   }
+}
 
-  if (isolate() && (V8_STATIC_ROOTS_BOOL ||
-                    (COMPRESS_POINTERS_BOOL && !isolate()->bootstrapper()))) {
-    Arm64OperandGenerator g(this);
-    const RootsTable& roots_table = isolate()->roots_table();
-    RootIndex root_index;
-    Node* left = nullptr;
-    Handle<HeapObject> right;
-    // HeapConstants and CompressedHeapConstants can be treated the same when
-    // using them as an input to a 32-bit comparison. Check whether either is
-    // present.
-    {
-      CompressedHeapObjectBinopMatcher m(node);
-      if (m.right().HasResolvedValue()) {
-        left = m.left().node();
-        right = m.right().ResolvedValue();
-      } else {
-        HeapObjectBinopMatcher m2(node);
-        if (m2.right().HasResolvedValue()) {
-          left = m2.left().node();
-          right = m2.right().ResolvedValue();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
+
+    // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
+    if (enable_switch_jump_table_ ==
+        InstructionSelector::kEnableSwitchJumpTable) {
+      static const size_t kMaxTableSwitchValueRange = 2 << 16;
+      size_t table_space_cost = 4 + sw.value_range();
+      size_t table_time_cost = 3;
+      size_t lookup_space_cost = 3 + 2 * sw.case_count();
+      size_t lookup_time_cost = sw.case_count();
+      if (sw.case_count() > 4 &&
+          table_space_cost + 3 * table_time_cost <=
+              lookup_space_cost + 3 * lookup_time_cost &&
+          sw.min_value() > std::numeric_limits<int32_t>::min() &&
+          sw.value_range() <= kMaxTableSwitchValueRange) {
+        InstructionOperand index_operand = value_operand;
+        if (sw.min_value()) {
+          index_operand = g.TempRegister();
+          Emit(kArm64Sub32, index_operand, value_operand,
+               g.TempImmediate(sw.min_value()));
         }
+        // Generate a table lookup.
+        return EmitTableSwitch(sw, index_operand);
       }
     }
-    if (!right.is_null() && roots_table.IsRootHandle(right, &root_index)) {
-      DCHECK_NE(left, nullptr);
-      if (RootsTable::IsReadOnly(root_index)) {
-        Tagged_t ptr =
-            MacroAssemblerBase::ReadOnlyRootPtr(root_index, isolate());
-        if (g.CanBeImmediate(ptr, ImmediateMode::kArithmeticImm)) {
-          return VisitCompare(this, kArm64Cmp32, g.UseRegister(left),
-                              g.TempImmediate(ptr), &cont);
+
+    // Generate a tree of conditional jumps.
+    return EmitBinarySearchSwitch(sw, value_operand);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Node* const user = node;
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    Int32BinopMatcher m(user);
+    if (m.right().Is(0)) {
+      Node* const value = m.left().node();
+      if (CanCover(user, value)) {
+        switch (value->opcode()) {
+          case IrOpcode::kInt32Add:
+          case IrOpcode::kWord32And:
+            return VisitWord32Compare(this, node, &cont);
+          case IrOpcode::kInt32Sub:
+            return VisitWordCompare(this, value, kArm64Cmp32, &cont,
+                                    kArithmeticImm);
+          case IrOpcode::kWord32Equal: {
+            // Word32Equal(Word32Equal(x, y), 0) => Word32Compare(x, y, ne).
+            Int32BinopMatcher mequal(value);
+            node->ReplaceInput(0, mequal.left().node());
+            node->ReplaceInput(1, mequal.right().node());
+            cont.Negate();
+            // {node} still does not cover its new operands, because {mequal} is
+            // still using them.
+            // Since we won't generate any more code for {mequal}, set its
+            // operands to zero to make sure {node} can cover them.
+            // This improves pattern matching in VisitWord32Compare.
+            mequal.node()->ReplaceInput(0, m.right().node());
+            mequal.node()->ReplaceInput(1, m.right().node());
+            return VisitWord32Compare(this, node, &cont);
+          }
+          default:
+            break;
         }
+        return VisitWord32Test(this, value, &cont);
       }
     }
-  }
 
-  VisitWord32Compare(this, node, &cont);
+    if (isolate() && (V8_STATIC_ROOTS_BOOL ||
+                      (COMPRESS_POINTERS_BOOL && !isolate()->bootstrapper()))) {
+      Arm64OperandGeneratorT<Adapter> g(this);
+      const RootsTable& roots_table = isolate()->roots_table();
+      RootIndex root_index;
+      Node* left = nullptr;
+      Handle<HeapObject> right;
+      // HeapConstants and CompressedHeapConstants can be treated the same when
+      // using them as an input to a 32-bit comparison. Check whether either is
+      // present.
+      {
+        CompressedHeapObjectBinopMatcher m(node);
+        if (m.right().HasResolvedValue()) {
+          left = m.left().node();
+          right = m.right().ResolvedValue();
+        } else {
+          HeapObjectBinopMatcher m2(node);
+          if (m2.right().HasResolvedValue()) {
+            left = m2.left().node();
+            right = m2.right().ResolvedValue();
+          }
+        }
+      }
+      if (!right.is_null() && roots_table.IsRootHandle(right, &root_index)) {
+        DCHECK_NE(left, nullptr);
+        if (RootsTable::IsReadOnly(root_index)) {
+          Tagged_t ptr =
+              MacroAssemblerBase::ReadOnlyRootPtr(root_index, isolate());
+          if (g.CanBeImmediate(ptr, ImmediateMode::kArithmeticImm)) {
+            return VisitCompare(this, kArm64Cmp32, g.UseRegister(left),
+                                g.TempImmediate(ptr), &cont);
+          }
+        }
+      }
+    }
+
+    VisitWord32Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitWord64Equal(Node* const node) {
-  Node* const user = node;
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int64BinopMatcher m(user);
-  if (m.right().Is(0)) {
-    Node* const value = m.left().node();
-    if (CanCover(user, value)) {
-      switch (value->opcode()) {
-        case IrOpcode::kWord64And:
-          return VisitWordCompare(this, value, kArm64Tst, &cont, kLogical64Imm);
-        default:
-          break;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Node* const user = node;
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    Int64BinopMatcher m(user);
+    if (m.right().Is(0)) {
+      Node* const value = m.left().node();
+      if (CanCover(user, value)) {
+        switch (value->opcode()) {
+          case IrOpcode::kWord64And:
+            return VisitWordCompare(this, value, kArm64Tst, &cont,
+                                    kLogical64Imm);
+          default:
+            break;
+        }
+        return VisitWord64Test(this, value, &cont);
       }
-      return VisitWord64Test(this, value, &cont);
     }
+    VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
   }
-  VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop<Int32BinopMatcher>(this, node, kArm64Add32,
-                                         kArithmeticImm, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(this, node, kArm64Add32,
+                                                    kArithmeticImm, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kArm64Add32,
+                                           kArithmeticImm, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop<Int32BinopMatcher>(this, node, kArm64Add32, kArithmeticImm, &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop<Int32BinopMatcher>(this, node, kArm64Sub32,
-                                         kArithmeticImm, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(this, node, kArm64Sub32,
+                                                    kArithmeticImm, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kArm64Sub32,
+                                           kArithmeticImm, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop<Int32BinopMatcher>(this, node, kArm64Sub32, kArithmeticImm, &cont);
 }
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    // ARM64 doesn't set the overflow flag for multiplication, so we need to
-    // test on kNotEqual. Here is the code sequence used:
-    //   smull result, left, right
-    //   cmp result.X(), Operand(result, SXTW)
-    FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
-    return EmitInt32MulWithOverflow(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      // ARM64 doesn't set the overflow flag for multiplication, so we need to
+      // test on kNotEqual. Here is the code sequence used:
+      //   smull result, left, right
+      //   cmp result.X(), Operand(result, SXTW)
+      FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
+      return EmitInt32MulWithOverflow(this, node, &cont);
+    }
+    FlagsContinuation cont;
+    EmitInt32MulWithOverflow(this, node, &cont);
   }
-  FlagsContinuation cont;
-  EmitInt32MulWithOverflow(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt64AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop<Int64BinopMatcher>(this, node, kArm64Add, kArithmeticImm,
-                                         &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int64BinopMatcher>(this, node, kArm64Add,
+                                                    kArithmeticImm, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kArm64Add,
+                                           kArithmeticImm, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop<Int64BinopMatcher>(this, node, kArm64Add, kArithmeticImm, &cont);
 }
 
-void InstructionSelector::VisitInt64SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop<Int64BinopMatcher>(this, node, kArm64Sub, kArithmeticImm,
-                                         &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int64BinopMatcher>(this, node, kArm64Sub,
+                                                    kArithmeticImm, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kArm64Sub,
+                                           kArithmeticImm, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop<Int64BinopMatcher>(this, node, kArm64Sub, kArithmeticImm, &cont);
 }
 
-void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    // ARM64 doesn't set the overflow flag for multiplication, so we need to
-    // test on kNotEqual. Here is the code sequence used:
-    //   mul result, left, right
-    //   smulh high, left, right
-    //   cmp high, result, asr 63
-    FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
-    return EmitInt64MulWithOverflow(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      // ARM64 doesn't set the overflow flag for multiplication, so we need to
+      // test on kNotEqual. Here is the code sequence used:
+      //   mul result, left, right
+      //   smulh high, left, right
+      //   cmp high, result, asr 63
+      FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
+      return EmitInt64MulWithOverflow(this, node, &cont);
+    }
+    FlagsContinuation cont;
+    EmitInt64MulWithOverflow(this, node, &cont);
   }
-  FlagsContinuation cont;
-  EmitInt64MulWithOverflow(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
-  VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
+    VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
-  VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont =
+        FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
+    VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
-  VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
+    VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
-  VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont =
+        FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
+    VisitWordCompare(this, node, kArm64Cmp, &cont, kArithmeticImm);
+  }
 }
 
-void InstructionSelector::VisitFloat32Neg(Node* node) {
-  Arm64OperandGenerator g(this);
-  Node* in = node->InputAt(0);
-  if (in->opcode() == IrOpcode::kFloat32Mul && CanCover(node, in)) {
-    Float32BinopMatcher m(in);
-    Emit(kArm64Float32Fnmul, g.DefineAsRegister(node),
-         g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Neg(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Node* in = node->InputAt(0);
+    if (in->opcode() == IrOpcode::kFloat32Mul && CanCover(node, in)) {
+      Float32BinopMatcher m(in);
+      Emit(kArm64Float32Fnmul, g.DefineAsRegister(node),
+           g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
+      return;
+    }
+    VisitRR(this, kArm64Float32Neg, node);
   }
-  VisitRR(this, kArm64Float32Neg, node);
 }
 
-void InstructionSelector::VisitFloat32Mul(Node* node) {
-  Arm64OperandGenerator g(this);
-  Float32BinopMatcher m(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Float32BinopMatcher m(node);
 
-  if (m.left().IsFloat32Neg() && CanCover(node, m.left().node())) {
-    Emit(kArm64Float32Fnmul, g.DefineAsRegister(node),
-         g.UseRegister(m.left().node()->InputAt(0)),
-         g.UseRegister(m.right().node()));
-    return;
-  }
+    if (m.left().IsFloat32Neg() && CanCover(node, m.left().node())) {
+      Emit(kArm64Float32Fnmul, g.DefineAsRegister(node),
+           g.UseRegister(m.left().node()->InputAt(0)),
+           g.UseRegister(m.right().node()));
+      return;
+    }
 
-  if (m.right().IsFloat32Neg() && CanCover(node, m.right().node())) {
-    Emit(kArm64Float32Fnmul, g.DefineAsRegister(node),
-         g.UseRegister(m.right().node()->InputAt(0)),
-         g.UseRegister(m.left().node()));
-    return;
+    if (m.right().IsFloat32Neg() && CanCover(node, m.right().node())) {
+      Emit(kArm64Float32Fnmul, g.DefineAsRegister(node),
+           g.UseRegister(m.right().node()->InputAt(0)),
+           g.UseRegister(m.left().node()));
+      return;
+    }
+    return VisitRRR(this, kArm64Float32Mul, node);
   }
-  return VisitRRR(this, kArm64Float32Mul, node);
 }
 
-void InstructionSelector::VisitFloat32Abs(Node* node) {
-  Arm64OperandGenerator g(this);
-  Node* in = node->InputAt(0);
-  if (in->opcode() == IrOpcode::kFloat32Sub && CanCover(node, in)) {
-    Emit(kArm64Float32Abd, g.DefineAsRegister(node),
-         g.UseRegister(in->InputAt(0)), g.UseRegister(in->InputAt(1)));
-    return;
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Abs(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Node* in = node->InputAt(0);
+    if (in->opcode() == IrOpcode::kFloat32Sub && CanCover(node, in)) {
+      Emit(kArm64Float32Abd, g.DefineAsRegister(node),
+           g.UseRegister(in->InputAt(0)), g.UseRegister(in->InputAt(1)));
+      return;
+    }
 
-  return VisitRR(this, kArm64Float32Abs, node);
+    return VisitRR(this, kArm64Float32Abs, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Abs(Node* node) {
-  Arm64OperandGenerator g(this);
-  Node* in = node->InputAt(0);
-  if (in->opcode() == IrOpcode::kFloat64Sub && CanCover(node, in)) {
-    Emit(kArm64Float64Abd, g.DefineAsRegister(node),
-         g.UseRegister(in->InputAt(0)), g.UseRegister(in->InputAt(1)));
-    return;
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Abs(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Node* in = node->InputAt(0);
+    if (in->opcode() == IrOpcode::kFloat64Sub && CanCover(node, in)) {
+      Emit(kArm64Float64Abd, g.DefineAsRegister(node),
+           g.UseRegister(in->InputAt(0)), g.UseRegister(in->InputAt(1)));
+      return;
+    }
 
-  return VisitRR(this, kArm64Float64Abs, node);
+    return VisitRR(this, kArm64Float64Abs, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kFloatLessThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kFloatLessThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kFloatLessThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kFloatLessThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
-  Arm64OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (left->opcode() == IrOpcode::kFloat64InsertHighWord32 &&
-      CanCover(node, left)) {
-    Node* right_of_left = left->InputAt(1);
-    Emit(kArm64Bfi, g.DefineSameAsFirst(right), g.UseRegister(right),
-         g.UseRegister(right_of_left), g.TempImmediate(32),
-         g.TempImmediate(32));
-    Emit(kArm64Float64MoveU64, g.DefineAsRegister(node), g.UseRegister(right));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    if (left->opcode() == IrOpcode::kFloat64InsertHighWord32 &&
+        CanCover(node, left)) {
+      Node* right_of_left = left->InputAt(1);
+      Emit(kArm64Bfi, g.DefineSameAsFirst(right), g.UseRegister(right),
+           g.UseRegister(right_of_left), g.TempImmediate(32),
+           g.TempImmediate(32));
+      Emit(kArm64Float64MoveU64, g.DefineAsRegister(node),
+           g.UseRegister(right));
+      return;
+    }
+    Emit(kArm64Float64InsertLowWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.UseRegister(right));
   }
-  Emit(kArm64Float64InsertLowWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.UseRegister(right));
 }
 
-void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
-  Arm64OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (left->opcode() == IrOpcode::kFloat64InsertLowWord32 &&
-      CanCover(node, left)) {
-    Node* right_of_left = left->InputAt(1);
-    Emit(kArm64Bfi, g.DefineSameAsFirst(left), g.UseRegister(right_of_left),
-         g.UseRegister(right), g.TempImmediate(32), g.TempImmediate(32));
-    Emit(kArm64Float64MoveU64, g.DefineAsRegister(node), g.UseRegister(left));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    if (left->opcode() == IrOpcode::kFloat64InsertLowWord32 &&
+        CanCover(node, left)) {
+      Node* right_of_left = left->InputAt(1);
+      Emit(kArm64Bfi, g.DefineSameAsFirst(left), g.UseRegister(right_of_left),
+           g.UseRegister(right), g.TempImmediate(32), g.TempImmediate(32));
+      Emit(kArm64Float64MoveU64, g.DefineAsRegister(node), g.UseRegister(left));
+      return;
+    }
+    Emit(kArm64Float64InsertHighWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.UseRegister(right));
   }
-  Emit(kArm64Float64InsertHighWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.UseRegister(right));
 }
 
-void InstructionSelector::VisitFloat64Neg(Node* node) {
-  Arm64OperandGenerator g(this);
-  Node* in = node->InputAt(0);
-  if (in->opcode() == IrOpcode::kFloat64Mul && CanCover(node, in)) {
-    Float64BinopMatcher m(in);
-    Emit(kArm64Float64Fnmul, g.DefineAsRegister(node),
-         g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Neg(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Node* in = node->InputAt(0);
+    if (in->opcode() == IrOpcode::kFloat64Mul && CanCover(node, in)) {
+      Float64BinopMatcher m(in);
+      Emit(kArm64Float64Fnmul, g.DefineAsRegister(node),
+           g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
+      return;
+    }
+    VisitRR(this, kArm64Float64Neg, node);
   }
-  VisitRR(this, kArm64Float64Neg, node);
 }
 
-void InstructionSelector::VisitFloat64Mul(Node* node) {
-  Arm64OperandGenerator g(this);
-  Float64BinopMatcher m(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Arm64OperandGeneratorT<Adapter> g(this);
+    Float64BinopMatcher m(node);
 
-  if (m.left().IsFloat64Neg() && CanCover(node, m.left().node())) {
-    Emit(kArm64Float64Fnmul, g.DefineAsRegister(node),
-         g.UseRegister(m.left().node()->InputAt(0)),
-         g.UseRegister(m.right().node()));
-    return;
-  }
+    if (m.left().IsFloat64Neg() && CanCover(node, m.left().node())) {
+      Emit(kArm64Float64Fnmul, g.DefineAsRegister(node),
+           g.UseRegister(m.left().node()->InputAt(0)),
+           g.UseRegister(m.right().node()));
+      return;
+    }
 
-  if (m.right().IsFloat64Neg() && CanCover(node, m.right().node())) {
-    Emit(kArm64Float64Fnmul, g.DefineAsRegister(node),
-         g.UseRegister(m.right().node()->InputAt(0)),
-         g.UseRegister(m.left().node()));
-    return;
+    if (m.right().IsFloat64Neg() && CanCover(node, m.right().node())) {
+      Emit(kArm64Float64Fnmul, g.DefineAsRegister(node),
+           g.UseRegister(m.right().node()->InputAt(0)),
+           g.UseRegister(m.left().node()));
+      return;
+    }
+    return VisitRRR(this, kArm64Float64Mul, node);
   }
-  return VisitRRR(this, kArm64Float64Mul, node);
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
   // Use DMB ISH for both acquire-release and sequentially consistent barriers.
-  Arm64OperandGenerator g(this);
+  Arm64OperandGeneratorT<Adapter> g(this);
   Emit(kArm64DmbIsh, g.NoOutput());
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
   VisitAtomicLoad(this, node, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicLoad(Node* node) {
   VisitAtomicLoad(this, node, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
   VisitAtomicStore(this, node, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicStore(node_t node) {
   VisitAtomicStore(this, node, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
   ArchOpcode opcode;
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
   if (params.type() == MachineType::Int8()) {
@@ -3600,7 +4240,8 @@ void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32, params.kind());
 }
 
-void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicExchange(Node* node) {
   ArchOpcode opcode;
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
   if (params.type() == MachineType::Uint8()) {
@@ -3617,7 +4258,9 @@ void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord64, params.kind());
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
   ArchOpcode opcode;
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
   if (params.type() == MachineType::Int8()) {
@@ -3638,7 +4281,9 @@ void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
                              params.kind());
 }
 
-void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicCompareExchange(
+    Node* node) {
   ArchOpcode opcode;
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
   if (params.type() == MachineType::Uint8()) {
@@ -3656,33 +4301,39 @@ void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
                              params.kind());
 }
 
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
-    Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
-  ArchOpcode opcode;
-  AtomicOpParameters params = AtomicOpParametersOf(node->op());
-  if (params.type() == MachineType::Int8()) {
-    opcode = int8_op;
-  } else if (params.type() == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (params.type() == MachineType::Int16()) {
-    opcode = int16_op;
-  } else if (params.type() == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (params.type() == MachineType::Int32()
-    || params.type() == MachineType::Uint32()) {
-    opcode = word32_op;
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    ArchOpcode opcode;
+    AtomicOpParameters params = AtomicOpParametersOf(node->op());
+    if (params.type() == MachineType::Int8()) {
+      opcode = int8_op;
+    } else if (params.type() == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (params.type() == MachineType::Int16()) {
+      opcode = int16_op;
+    } else if (params.type() == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (params.type() == MachineType::Int32() ||
+               params.type() == MachineType::Uint32()) {
+      opcode = word32_op;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32, params.kind());
   }
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32, params.kind());
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                            \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) { \
+    VisitWord32AtomicBinaryOperation(                                     \
+        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16,  \
+        kAtomic##op##Uint16, kAtomic##op##Word32);                        \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -3691,27 +4342,33 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitWord64AtomicBinaryOperation(
-    Node* node, ArchOpcode uint8_op, ArchOpcode uint16_op, ArchOpcode uint32_op,
-    ArchOpcode uint64_op) {
-  ArchOpcode opcode;
-  AtomicOpParameters params = AtomicOpParametersOf(node->op());
-  if (params.type() == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (params.type() == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (params.type() == MachineType::Uint32()) {
-    opcode = uint32_op;
-  } else if (params.type() == MachineType::Uint64()) {
-    opcode = uint64_op;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicBinaryOperation(
+    node_t node, ArchOpcode uint8_op, ArchOpcode uint16_op,
+    ArchOpcode uint32_op, ArchOpcode uint64_op) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    ArchOpcode opcode;
+    AtomicOpParameters params = AtomicOpParametersOf(node->op());
+    if (params.type() == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (params.type() == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (params.type() == MachineType::Uint32()) {
+      opcode = uint32_op;
+    } else if (params.type() == MachineType::Uint64()) {
+      opcode = uint64_op;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64, params.kind());
   }
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64, params.kind());
 }
 
 #define VISIT_ATOMIC_BINOP(op)                                                 \
-  void InstructionSelector::VisitWord64Atomic##op(Node* node) {                \
+  template <typename Adapter>                                                  \
+  void InstructionSelectorT<Adapter>::VisitWord64Atomic##op(Node* node) {      \
     VisitWord64AtomicBinaryOperation(node, kAtomic##op##Uint8,                 \
                                      kAtomic##op##Uint16, kAtomic##op##Word32, \
                                      kArm64Word64Atomic##op##Uint64);          \
@@ -3723,11 +4380,13 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
@@ -3853,22 +4512,15 @@ void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
   V(I8x16MinU, kArm64IMinU, 8)                         \
   V(I8x16MaxU, kArm64IMaxU, 8)
 
-void InstructionSelector::VisitS128Const(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  Arm64OperandGeneratorT<Adapter> g(this);
   static const int kUint32Immediates = 4;
   uint32_t val[kUint32Immediates];
   static_assert(sizeof(val) == kSimd128Size);
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
-  // If all bytes are zeros, avoid emitting code for generic constants
-  bool all_zeros = !(val[0] || val[1] || val[2] || val[3]);
-  InstructionOperand dst = g.DefineAsRegister(node);
-  if (all_zeros) {
-    Emit(kArm64S128Zero, dst);
-  } else {
-    Emit(kArm64S128Const, g.DefineAsRegister(node), g.UseImmediate(val[0]),
-         g.UseImmediate(val[1]), g.UseImmediate(val[2]),
-         g.UseImmediate(val[3]));
-  }
+  Emit(kArm64S128Const, g.DefineAsRegister(node), g.UseImmediate(val[0]),
+       g.UseImmediate(val[1]), g.UseImmediate(val[2]), g.UseImmediate(val[3]));
 }
 
 namespace {
@@ -3945,9 +4597,10 @@ base::Optional<BicImmResult> BicImmHelper(Node* and_node, bool not_imm) {
   return base::nullopt;
 }
 
-bool TryEmitS128AndNotImm(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+bool TryEmitS128AndNotImm(InstructionSelectorT<Adapter>* selector, Node* node,
                           bool not_imm) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   base::Optional<BicImmResult> result = BicImmHelper(node, not_imm);
   if (!result.has_value()) return false;
   base::Optional<BicImmParam> param = result->param;
@@ -3965,26 +4618,31 @@ bool TryEmitS128AndNotImm(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitS128AndNot(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128AndNot(Node* node) {
   if (!TryEmitS128AndNotImm(this, node, false)) {
     VisitRRR(this, kArm64S128AndNot, node);
   }
 }
 
-void InstructionSelector::VisitS128And(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128And(Node* node) {
   // AndNot can be used if we negate the immediate input of And.
   if (!TryEmitS128AndNotImm(this, node, true)) {
     VisitRRR(this, kArm64S128And, node);
   }
 }
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  Arm64OperandGenerator g(this);
-  Emit(kArm64S128Zero, g.DefineAsRegister(node));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  Arm64OperandGeneratorT<Adapter> g(this);
+  Emit(kArm64S128Const, g.DefineAsRegister(node), g.UseImmediate(0),
+       g.UseImmediate(0), g.UseImmediate(0), g.UseImmediate(0));
 }
 
-void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI8x16I7x16AddS(Node* node) {
+  Arm64OperandGeneratorT<Adapter> g(this);
   InstructionOperand output = CpuFeatures::IsSupported(DOTPROD)
                                   ? g.DefineSameAsInput(node, 2)
                                   : g.DefineAsRegister(node);
@@ -3993,7 +4651,9 @@ void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
 }
 
 #define SIMD_VISIT_EXTRACT_LANE(Type, T, Sign, LaneSize)                     \
-  void InstructionSelector::Visit##Type##ExtractLane##Sign(Node* node) {     \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##ExtractLane##Sign(        \
+      Node* node) {                                                          \
     VisitRRI(this,                                                           \
              kArm64##T##ExtractLane##Sign | LaneSizeField::encode(LaneSize), \
              node);                                                          \
@@ -4009,7 +4669,8 @@ SIMD_VISIT_EXTRACT_LANE(I8x16, I, S, 8)
 #undef SIMD_VISIT_EXTRACT_LANE
 
 #define SIMD_VISIT_REPLACE_LANE(Type, T, LaneSize)                            \
-  void InstructionSelector::Visit##Type##ReplaceLane(Node* node) {            \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::Visit##Type##ReplaceLane(Node* node) {  \
     VisitRRIR(this, kArm64##T##ReplaceLane | LaneSizeField::encode(LaneSize), \
               node);                                                          \
   }
@@ -4021,32 +4682,36 @@ SIMD_VISIT_REPLACE_LANE(I16x8, I, 16)
 SIMD_VISIT_REPLACE_LANE(I8x16, I, 8)
 #undef SIMD_VISIT_REPLACE_LANE
 
-#define SIMD_VISIT_UNOP(Name, instruction)            \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, instruction, node);                 \
+#define SIMD_VISIT_UNOP(Name, instruction)                      \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRR(this, instruction, node);                           \
   }
 SIMD_UNOP_LIST(SIMD_VISIT_UNOP)
 #undef SIMD_VISIT_UNOP
 #undef SIMD_UNOP_LIST
 
-#define SIMD_VISIT_SHIFT_OP(Name, width)                \
-  void InstructionSelector::Visit##Name(Node* node) {   \
-    VisitSimdShiftRRR(this, kArm64##Name, node, width); \
+#define SIMD_VISIT_SHIFT_OP(Name, width)                        \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitSimdShiftRRR(this, kArm64##Name, node, width);         \
   }
 SIMD_SHIFT_OP_LIST(SIMD_VISIT_SHIFT_OP)
 #undef SIMD_VISIT_SHIFT_OP
 #undef SIMD_SHIFT_OP_LIST
 
-#define SIMD_VISIT_BINOP(Name, instruction)           \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRR(this, instruction, node);                \
+#define SIMD_VISIT_BINOP(Name, instruction)                     \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRRR(this, instruction, node);                          \
   }
 SIMD_BINOP_LIST(SIMD_VISIT_BINOP)
 #undef SIMD_VISIT_BINOP
 #undef SIMD_BINOP_LIST
 
 #define SIMD_VISIT_BINOP_LANE_SIZE(Name, instruction, LaneSize)          \
-  void InstructionSelector::Visit##Name(Node* node) {                    \
+  template <typename Adapter>                                            \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {          \
     VisitRRR(this, instruction | LaneSizeField::encode(LaneSize), node); \
   }
 SIMD_BINOP_LANE_SIZE_LIST(SIMD_VISIT_BINOP_LANE_SIZE)
@@ -4054,7 +4719,8 @@ SIMD_BINOP_LANE_SIZE_LIST(SIMD_VISIT_BINOP_LANE_SIZE)
 #undef SIMD_BINOP_LANE_SIZE_LIST
 
 #define SIMD_VISIT_UNOP_LANE_SIZE(Name, instruction, LaneSize)          \
-  void InstructionSelector::Visit##Name(Node* node) {                   \
+  template <typename Adapter>                                           \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {         \
     VisitRR(this, instruction | LaneSizeField::encode(LaneSize), node); \
   }
 SIMD_UNOP_LANE_SIZE_LIST(SIMD_VISIT_UNOP_LANE_SIZE)
@@ -4119,9 +4785,10 @@ MulWithDupResult TryMatchMulWithDup(Node* node) {
 }
 }  // namespace
 
-void InstructionSelector::VisitF32x4Mul(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Mul(Node* node) {
   if (MulWithDupResult result = TryMatchMulWithDup<4>(node)) {
-    Arm64OperandGenerator g(this);
+    Arm64OperandGeneratorT<Adapter> g(this);
     Emit(kArm64FMulElement | LaneSizeField::encode(32),
          g.DefineAsRegister(node), g.UseRegister(result.input),
          g.UseRegister(result.dup_node), g.UseImmediate(result.index));
@@ -4130,9 +4797,10 @@ void InstructionSelector::VisitF32x4Mul(Node* node) {
   }
 }
 
-void InstructionSelector::VisitF64x2Mul(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Mul(Node* node) {
   if (MulWithDupResult result = TryMatchMulWithDup<2>(node)) {
-    Arm64OperandGenerator g(this);
+    Arm64OperandGeneratorT<Adapter> g(this);
     Emit(kArm64FMulElement | LaneSizeField::encode(64),
          g.DefineAsRegister(node), g.UseRegister(result.input),
          g.UseRegister(result.dup_node), g.UseImmediate(result.index));
@@ -4141,8 +4809,9 @@ void InstructionSelector::VisitF64x2Mul(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI64x2Mul(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Mul(Node* node) {
+  Arm64OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kArm64I64x2Mul, g.DefineAsRegister(node),
        g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
@@ -4180,10 +4849,11 @@ struct SimdAddOpMatcher : public NodeMatcher {
   Node* right_;
 };
 
-bool ShraHelper(InstructionSelector* selector, Node* node, int lane_size,
-                InstructionCode shra_code, InstructionCode add_code,
-                IrOpcode::Value shift_op) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+bool ShraHelper(InstructionSelectorT<Adapter>* selector, Node* node,
+                int lane_size, InstructionCode shra_code,
+                InstructionCode add_code, IrOpcode::Value shift_op) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   SimdAddOpMatcher m(node, shift_op);
   if (!m.Matches() || !selector->CanCover(node, m.left())) return false;
   if (!g.IsIntegerConstant(m.left()->InputAt(1))) return false;
@@ -4202,9 +4872,11 @@ bool ShraHelper(InstructionSelector* selector, Node* node, int lane_size,
   return true;
 }
 
-bool AdalpHelper(InstructionSelector* selector, Node* node, int lane_size,
-                 InstructionCode adalp_code, IrOpcode::Value ext_op) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+bool AdalpHelper(InstructionSelectorT<Adapter>* selector, Node* node,
+                 int lane_size, InstructionCode adalp_code,
+                 IrOpcode::Value ext_op) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   SimdAddOpMatcher m(node, ext_op);
   if (!m.Matches() || !selector->CanCover(node, m.left())) return false;
   selector->Emit(adalp_code | LaneSizeField::encode(lane_size),
@@ -4213,9 +4885,10 @@ bool AdalpHelper(InstructionSelector* selector, Node* node, int lane_size,
   return true;
 }
 
-bool MlaHelper(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+bool MlaHelper(InstructionSelectorT<Adapter>* selector, Node* node,
                InstructionCode mla_code, IrOpcode::Value mul_op) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   SimdAddOpMatcher m(node, mul_op);
   if (!m.Matches() || !selector->CanCover(node, m.left())) return false;
   selector->Emit(mla_code, g.DefineSameAsFirst(node), g.UseRegister(m.right()),
@@ -4224,9 +4897,11 @@ bool MlaHelper(InstructionSelector* selector, Node* node,
   return true;
 }
 
-bool SmlalHelper(InstructionSelector* selector, Node* node, int lane_size,
-                 InstructionCode smlal_code, IrOpcode::Value ext_mul_op) {
-  Arm64OperandGenerator g(selector);
+template <typename Adapter>
+bool SmlalHelper(InstructionSelectorT<Adapter>* selector, Node* node,
+                 int lane_size, InstructionCode smlal_code,
+                 IrOpcode::Value ext_mul_op) {
+  Arm64OperandGeneratorT<Adapter> g(selector);
   SimdAddOpMatcher m(node, ext_mul_op);
   if (!m.Matches() || !selector->CanCover(node, m.left())) return false;
 
@@ -4239,7 +4914,8 @@ bool SmlalHelper(InstructionSelector* selector, Node* node, int lane_size,
 
 }  // namespace
 
-void InstructionSelector::VisitI64x2Add(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Add(Node* node) {
   if (!ShraHelper(this, node, 64, kArm64Ssra,
                   kArm64IAdd | LaneSizeField::encode(64),
                   IrOpcode::kI64x2ShrS) &&
@@ -4250,7 +4926,8 @@ void InstructionSelector::VisitI64x2Add(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI8x16Add(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Add(Node* node) {
   if (!ShraHelper(this, node, 8, kArm64Ssra,
                   kArm64IAdd | LaneSizeField::encode(8),
                   IrOpcode::kI8x16ShrS) &&
@@ -4262,7 +4939,8 @@ void InstructionSelector::VisitI8x16Add(Node* node) {
 }
 
 #define VISIT_SIMD_ADD(Type, PairwiseType, LaneSize)                       \
-  void InstructionSelector::Visit##Type##Add(Node* node) {                 \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::Visit##Type##Add(Node* node) {       \
     /* Select Mla(z, x, y) for Add(x, Mul(y, z)). */                       \
     if (MlaHelper(this, node, kArm64Mla | LaneSizeField::encode(LaneSize), \
                   IrOpcode::k##Type##Mul)) {                               \
@@ -4304,8 +4982,9 @@ VISIT_SIMD_ADD(I16x8, I8x16, 16)
 #undef VISIT_SIMD_ADD
 
 #define VISIT_SIMD_SUB(Type, LaneSize)                                        \
-  void InstructionSelector::Visit##Type##Sub(Node* node) {                    \
-    Arm64OperandGenerator g(this);                                            \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::Visit##Type##Sub(Node* node) {          \
+    Arm64OperandGeneratorT<Adapter> g(this);                                  \
     Node* left = node->InputAt(0);                                            \
     Node* right = node->InputAt(1);                                           \
     /* Select Mls(z, x, y) for Sub(z, Mul(x, y)). */                          \
@@ -4324,7 +5003,8 @@ VISIT_SIMD_SUB(I16x8, 16)
 #undef VISIT_SIMD_SUB
 
 namespace {
-bool isSimdZero(Arm64OperandGenerator& g, Node* node) {
+template <typename Adapter>
+bool isSimdZero(Arm64OperandGeneratorT<Adapter>& g, Node* node) {
   auto m = V128ConstMatcher(node);
   if (m.HasResolvedValue()) {
     auto imms = m.ResolvedValue().immediate();
@@ -4335,8 +5015,9 @@ bool isSimdZero(Arm64OperandGenerator& g, Node* node) {
 }  // namespace
 
 #define VISIT_SIMD_CM(Type, T, CmOp, CmOpposite, LaneSize)                   \
-  void InstructionSelector::Visit##Type##CmOp(Node* node) {                  \
-    Arm64OperandGenerator g(this);                                           \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##CmOp(Node* node) {        \
+    Arm64OperandGeneratorT<Adapter> g(this);                                 \
     Node* left = node->InputAt(0);                                           \
     Node* right = node->InputAt(1);                                          \
     if (isSimdZero(g, left)) {                                               \
@@ -4378,32 +5059,38 @@ VISIT_SIMD_CM(I8x16, I, GtS, LtS, 8)
 VISIT_SIMD_CM(I8x16, I, GeS, LeS, 8)
 #undef VISIT_SIMD_CM
 
-void InstructionSelector::VisitS128Select(Node* node) {
-  Arm64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
+  Arm64OperandGeneratorT<Adapter> g(this);
   Emit(kArm64S128Select, g.DefineSameAsFirst(node),
        g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
        g.UseRegister(node->InputAt(2)));
 }
 
-void InstructionSelector::VisitI8x16RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI16x8RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI32x4RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI64x2RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
 #define VISIT_SIMD_QFMOP(op)                                               \
-  void InstructionSelector::Visit##op(Node* node) {                        \
-    Arm64OperandGenerator g(this);                                         \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::Visit##op(Node* node) {              \
+    Arm64OperandGeneratorT<Adapter> g(this);                               \
     Emit(kArm64##op, g.DefineSameAsInput(node, 2),                         \
          g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)), \
          g.UseRegister(node->InputAt(2)));                                 \
@@ -4492,8 +5179,10 @@ bool TryMatchArchShuffle(const uint8_t* shuffle, const ShuffleEntry* table,
   return false;
 }
 
-void ArrangeShuffleTable(Arm64OperandGenerator* g, Node* input0, Node* input1,
-                         InstructionOperand* src0, InstructionOperand* src1) {
+template <typename Adapter>
+void ArrangeShuffleTable(Arm64OperandGeneratorT<Adapter>* g, Node* input0,
+                         Node* input1, InstructionOperand* src0,
+                         InstructionOperand* src1) {
   if (input0 == input1) {
     // Unary, any q-register can be the table.
     *src0 = *src1 = g->UseRegister(input0);
@@ -4506,12 +5195,13 @@ void ArrangeShuffleTable(Arm64OperandGenerator* g, Node* input0, Node* input1,
 
 }  // namespace
 
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
   uint8_t shuffle32x4[4];
-  Arm64OperandGenerator g(this);
+  Arm64OperandGeneratorT<Adapter> g(this);
   ArchOpcode opcode;
   if (TryMatchArchShuffle(shuffle, arch_shuffles, arraysize(arch_shuffles),
                           is_swizzle, &opcode)) {
@@ -4563,33 +5253,42 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
        g.UseImmediate(wasm::SimdShuffle::Pack4Lanes(shuffle + 12)));
 }
 #else
-void InstructionSelector::VisitI8x16Shuffle(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
+  UNREACHABLE();
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void InstructionSelector::VisitSignExtendWord8ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt32(node_t node) {
   VisitRR(this, kArm64Sxtb32, node);
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt32(node_t node) {
   VisitRR(this, kArm64Sxth32, node);
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt64(node_t node) {
   VisitRR(this, kArm64Sxtb, node);
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt64(node_t node) {
   VisitRR(this, kArm64Sxth, node);
 }
 
-void InstructionSelector::VisitSignExtendWord32ToInt64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord32ToInt64(node_t node) {
   VisitRR(this, kArm64Sxtw, node);
 }
 
 namespace {
-void VisitPminOrPmax(InstructionSelector* selector, ArchOpcode opcode,
+template <typename Adapter>
+void VisitPminOrPmax(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
                      Node* node) {
-  Arm64OperandGenerator g(selector);
+  Arm64OperandGeneratorT<Adapter> g(selector);
   // Need all unique registers because we first compare the two inputs, then we
   // need the inputs to remain unchanged for the bitselect later.
   selector->Emit(opcode, g.DefineAsRegister(node),
@@ -4598,91 +5297,122 @@ void VisitPminOrPmax(InstructionSelector* selector, ArchOpcode opcode,
 }
 }  // namespace
 
-void InstructionSelector::VisitF32x4Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmin(Node* node) {
   VisitPminOrPmax(this, kArm64F32x4Pmin, node);
 }
 
-void InstructionSelector::VisitF32x4Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmax(Node* node) {
   VisitPminOrPmax(this, kArm64F32x4Pmax, node);
 }
 
-void InstructionSelector::VisitF64x2Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmin(Node* node) {
   VisitPminOrPmax(this, kArm64F64x2Pmin, node);
 }
 
-void InstructionSelector::VisitF64x2Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmax(Node* node) {
   VisitPminOrPmax(this, kArm64F64x2Pmax, node);
 }
 
 namespace {
-void VisitSignExtendLong(InstructionSelector* selector, ArchOpcode opcode,
-                         Node* node, int lane_size) {
+template <typename Adapter>
+void VisitSignExtendLong(InstructionSelectorT<Adapter>* selector,
+                         ArchOpcode opcode, Node* node, int lane_size) {
   InstructionCode code = opcode;
   code |= LaneSizeField::encode(lane_size);
   VisitRR(selector, code, node);
 }
 }  // namespace
 
-void InstructionSelector::VisitI64x2SConvertI32x4Low(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2SConvertI32x4Low(Node* node) {
   VisitSignExtendLong(this, kArm64Sxtl, node, 64);
 }
 
-void InstructionSelector::VisitI64x2SConvertI32x4High(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2SConvertI32x4High(Node* node) {
   VisitSignExtendLong(this, kArm64Sxtl2, node, 64);
 }
 
-void InstructionSelector::VisitI64x2UConvertI32x4Low(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2UConvertI32x4Low(Node* node) {
   VisitSignExtendLong(this, kArm64Uxtl, node, 64);
 }
 
-void InstructionSelector::VisitI64x2UConvertI32x4High(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2UConvertI32x4High(Node* node) {
   VisitSignExtendLong(this, kArm64Uxtl2, node, 64);
 }
 
-void InstructionSelector::VisitI32x4SConvertI16x8Low(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4SConvertI16x8Low(Node* node) {
   VisitSignExtendLong(this, kArm64Sxtl, node, 32);
 }
 
-void InstructionSelector::VisitI32x4SConvertI16x8High(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4SConvertI16x8High(Node* node) {
   VisitSignExtendLong(this, kArm64Sxtl2, node, 32);
 }
 
-void InstructionSelector::VisitI32x4UConvertI16x8Low(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4UConvertI16x8Low(Node* node) {
   VisitSignExtendLong(this, kArm64Uxtl, node, 32);
 }
 
-void InstructionSelector::VisitI32x4UConvertI16x8High(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4UConvertI16x8High(Node* node) {
   VisitSignExtendLong(this, kArm64Uxtl2, node, 32);
 }
 
-void InstructionSelector::VisitI16x8SConvertI8x16Low(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8SConvertI8x16Low(Node* node) {
   VisitSignExtendLong(this, kArm64Sxtl, node, 16);
 }
 
-void InstructionSelector::VisitI16x8SConvertI8x16High(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8SConvertI8x16High(Node* node) {
   VisitSignExtendLong(this, kArm64Sxtl2, node, 16);
 }
 
-void InstructionSelector::VisitI16x8UConvertI8x16Low(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8UConvertI8x16Low(Node* node) {
   VisitSignExtendLong(this, kArm64Uxtl, node, 16);
 }
 
-void InstructionSelector::VisitI16x8UConvertI8x16High(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8UConvertI8x16High(Node* node) {
   VisitSignExtendLong(this, kArm64Uxtl2, node, 16);
 }
 
-void InstructionSelector::VisitI8x16Popcnt(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Popcnt(Node* node) {
   InstructionCode code = kArm64Cnt;
   code |= LaneSizeField::encode(8);
   VisitRR(this, code, node);
 }
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGenerator* g, int first_input_index, node_t node) {
   continuation_outputs_.push_back(g->DefineAsRegister(node));
 }
 
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
+
+template <>
+TurboshaftAdapter::node_t
+InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    node_t node, size_t projection_index) {
+  UNIMPLEMENTED();
+}
+
 // static
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
@@ -4704,7 +5434,10 @@ InstructionSelector::SupportedMachineOperatorFlags() {
          MachineOperatorBuilder::kWord64ReverseBits |
          MachineOperatorBuilder::kSatConversionIsSafe |
          MachineOperatorBuilder::kFloat32Select |
-         MachineOperatorBuilder::kFloat64Select;
+         MachineOperatorBuilder::kFloat64Select |
+         MachineOperatorBuilder::kWord32Select |
+         MachineOperatorBuilder::kWord64Select |
+         MachineOperatorBuilder::kLoadStorePairs;
 }
 
 // static
@@ -4714,6 +5447,11 @@ InstructionSelector::AlignmentRequirements() {
       FullUnalignedAccessSupport();
 }
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/bitcast-elider.cc b/deps/v8/src/compiler/backend/bitcast-elider.cc
index 403e6d318c1a43..98d153783c0f80 100644
--- a/deps/v8/src/compiler/backend/bitcast-elider.cc
+++ b/deps/v8/src/compiler/backend/bitcast-elider.cc
@@ -21,7 +21,7 @@ bool IsBitcast(Node* node) {
 }
 
 bool OwnedByWord32Op(Node* node) {
-#if V8_TARGET_ARCH_LOONG64 || V8_TARGET_ARCH_MIPS64
+#if V8_TARGET_ARCH_LOONG64 || V8_TARGET_ARCH_MIPS64 || V8_TARGET_ARCH_RISCV64
   return false;
 #else
   for (Node* const use : node->uses()) {
diff --git a/deps/v8/src/compiler/backend/code-generator-impl.h b/deps/v8/src/compiler/backend/code-generator-impl.h
index 9ece920f307ab1..d3251e0199b39d 100644
--- a/deps/v8/src/compiler/backend/code-generator-impl.h
+++ b/deps/v8/src/compiler/backend/code-generator-impl.h
@@ -108,12 +108,12 @@ class InstructionOperandConverter {
     return ToRegister(instr_->TempAt(index));
   }
 
-  FloatRegister OutputFloatRegister() {
-    return ToFloatRegister(instr_->Output());
+  FloatRegister OutputFloatRegister(size_t index = 0) {
+    return ToFloatRegister(instr_->OutputAt(index));
   }
 
-  DoubleRegister OutputDoubleRegister() {
-    return ToDoubleRegister(instr_->Output());
+  DoubleRegister OutputDoubleRegister(size_t index = 0) {
+    return ToDoubleRegister(instr_->OutputAt(index));
   }
 
   DoubleRegister TempDoubleRegister(size_t index) {
diff --git a/deps/v8/src/compiler/backend/code-generator.cc b/deps/v8/src/compiler/backend/code-generator.cc
index 04826d22b172a3..77511bd3514c83 100644
--- a/deps/v8/src/compiler/backend/code-generator.cc
+++ b/deps/v8/src/compiler/backend/code-generator.cc
@@ -12,16 +12,14 @@
 #include "src/compiler/globals.h"
 #include "src/compiler/linkage.h"
 #include "src/compiler/pipeline.h"
+#include "src/deoptimizer/translated-state.h"
 #include "src/diagnostics/eh-frame.h"
 #include "src/execution/frames.h"
 #include "src/logging/counters.h"
 #include "src/logging/log.h"
 #include "src/objects/smi.h"
 #include "src/utils/address-map.h"
-
-#if V8_ENABLE_WEBASSEMBLY
-#include "src/wasm/assembler-buffer-cache.h"
-#endif  // V8_ENABLE_WEBASSEMBLY
+#include "src/utils/utils.h"
 
 namespace v8 {
 namespace internal {
@@ -44,14 +42,16 @@ class CodeGenerator::JumpTable final : public ZoneObject {
   size_t const target_count_;
 };
 
-CodeGenerator::CodeGenerator(
-    Zone* codegen_zone, Frame* frame, Linkage* linkage,
-    InstructionSequence* instructions, OptimizedCompilationInfo* info,
-    Isolate* isolate, base::Optional<OsrHelper> osr_helper,
-    int start_source_position, JumpOptimizationInfo* jump_opt,
-    const AssemblerOptions& options, wasm::AssemblerBufferCache* buffer_cache,
-    Builtin builtin, size_t max_unoptimized_frame_height,
-    size_t max_pushed_argument_count, const char* debug_name)
+CodeGenerator::CodeGenerator(Zone* codegen_zone, Frame* frame, Linkage* linkage,
+                             InstructionSequence* instructions,
+                             OptimizedCompilationInfo* info, Isolate* isolate,
+                             base::Optional<OsrHelper> osr_helper,
+                             int start_source_position,
+                             JumpOptimizationInfo* jump_opt,
+                             const AssemblerOptions& options, Builtin builtin,
+                             size_t max_unoptimized_frame_height,
+                             size_t max_pushed_argument_count,
+                             const char* debug_name)
     : zone_(codegen_zone),
       isolate_(isolate),
       frame_access_state_(nullptr),
@@ -59,18 +59,13 @@ CodeGenerator::CodeGenerator(
       instructions_(instructions),
       unwinding_info_writer_(codegen_zone),
       info_(info),
-      labels_(
-          codegen_zone->NewArray<Label>(instructions->InstructionBlockCount())),
+      labels_(codegen_zone->AllocateArray<Label>(
+          instructions->InstructionBlockCount())),
       current_block_(RpoNumber::Invalid()),
       start_source_position_(start_source_position),
       current_source_position_(SourcePosition::Unknown()),
       masm_(isolate, options, CodeObjectRequired::kNo,
-#if V8_ENABLE_WEBASSEMBLY
-            buffer_cache ? buffer_cache->GetAssemblerBuffer(
-                               AssemblerBase::kDefaultBufferSize)
-                         :
-#endif  // V8_ENABLE_WEBASSEMBLY
-                         std::unique_ptr<AssemblerBuffer>{}),
+            std::unique_ptr<AssemblerBuffer>{}),
       resolver_(this),
       safepoints_(codegen_zone),
       handlers_(codegen_zone),
@@ -109,11 +104,6 @@ CodeGenerator::CodeGenerator(
   masm_.set_builtin(builtin);
 }
 
-bool CodeGenerator::wasm_runtime_exception_support() const {
-  DCHECK_NOT_NULL(info_);
-  return info_->wasm_runtime_exception_support();
-}
-
 void CodeGenerator::AddProtectedInstructionLanding(uint32_t instr_offset,
                                                    uint32_t landing_offset) {
 #if V8_ENABLE_WEBASSEMBLY
@@ -256,7 +246,13 @@ void CodeGenerator::AssembleCode() {
   }
   for (OptimizedCompilationInfo::InlinedFunctionHolder& inlined :
        info->inlined_functions()) {
-    DefineDeoptimizationLiteral(DeoptimizationLiteral(inlined.bytecode_array));
+    if (!inlined.bytecode_array.is_null()) {
+      DefineDeoptimizationLiteral(
+          DeoptimizationLiteral(inlined.bytecode_array));
+    } else {
+      // Inlined wasm functions do not have a bytecode array.
+      DCHECK(info->inline_js_wasm_calls());
+    }
   }
 
   unwinding_info_writer_.SetNumberOfInstructionBlocks(
@@ -270,20 +266,19 @@ void CodeGenerator::AssembleCode() {
   offsets_info_.blocks_start = masm()->pc_offset();
   for (const InstructionBlock* block : instructions()->ao_blocks()) {
     // Align loop headers on vendor recommended boundaries.
-    if (!masm()->jump_optimization_info()) {
-      if (block->ShouldAlignLoopHeader()) {
-        masm()->LoopHeaderAlign();
-      } else if (block->ShouldAlignCodeTarget()) {
-        masm()->CodeTargetAlign();
-      }
+    if (block->ShouldAlignLoopHeader()) {
+      masm()->LoopHeaderAlign();
+    } else if (block->ShouldAlignCodeTarget()) {
+      masm()->CodeTargetAlign();
     }
+
     if (info->trace_turbo_json()) {
       block_starts_[block->rpo_number().ToInt()] = masm()->pc_offset();
     }
     // Bind a label for a block.
     current_block_ = block->rpo_number();
     unwinding_info_writer_.BeginInstructionBlock(masm()->pc_offset(), block);
-    if (v8_flags.code_comments) {
+    if (v8_flags.code_comments && !block->omitted_by_jump_threading()) {
       std::ostringstream buffer;
       buffer << "-- B" << block->rpo_number().ToInt() << " start";
       if (block->IsDeferred()) buffer << " (deferred)";
@@ -315,7 +310,7 @@ void CodeGenerator::AssembleCode() {
         masm()->InitializeRootRegister();
       }
     }
-#ifdef V8_TARGET_ARCH_RISCV64
+#ifdef CAN_USE_RVV_INSTRUCTIONS
     // RVV uses VectorUnit to emit vset{i}vl{i}, reducing the static and dynamic
     // overhead of the vset{i}vl{i} instruction. However there are some jumps
     // back between blocks. the Rvv instruction may get an incorrect vtype. so
@@ -465,14 +460,14 @@ void CodeGenerator::AssembleArchJump(RpoNumber target) {
     AssembleArchJumpRegardlessOfAssemblyOrder(target);
 }
 
-base::OwnedVector<byte> CodeGenerator::GetSourcePositionTable() {
+base::OwnedVector<uint8_t> CodeGenerator::GetSourcePositionTable() {
   return source_position_table_builder_.ToSourcePositionTableVector();
 }
 
-base::OwnedVector<byte> CodeGenerator::GetProtectedInstructionsData() {
+base::OwnedVector<uint8_t> CodeGenerator::GetProtectedInstructionsData() {
 #if V8_ENABLE_WEBASSEMBLY
-  return base::OwnedVector<byte>::Of(
-      base::Vector<byte>::cast(base::VectorOf(protected_instructions_)));
+  return base::OwnedVector<uint8_t>::Of(
+      base::Vector<uint8_t>::cast(base::VectorOf(protected_instructions_)));
 #else
   return {};
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -493,7 +488,8 @@ MaybeHandle<Code> CodeGenerator::FinalizeCode() {
 
   // Allocate and install the code.
   CodeDesc desc;
-  masm()->GetCode(isolate(), &desc, safepoints(), handler_table_offset_);
+  masm()->GetCode(isolate()->main_thread_local_isolate(), &desc, safepoints(),
+                  handler_table_offset_);
 
 #if defined(V8_OS_WIN64)
   if (Builtins::IsBuiltinId(info_->builtin())) {
@@ -523,9 +519,9 @@ MaybeHandle<Code> CodeGenerator::FinalizeCode() {
     return {};
   }
 
-  LOG_CODE_EVENT(isolate(), CodeLinePosInfoRecordEvent(code->InstructionStart(),
-                                                       *source_positions,
-                                                       JitCodeEvent::JIT_CODE));
+  LOG_CODE_EVENT(isolate(), CodeLinePosInfoRecordEvent(
+                                code->instruction_start(), *source_positions,
+                                JitCodeEvent::JIT_CODE));
 
   return code;
 }
@@ -921,10 +917,11 @@ Handle<DeoptimizationData> CodeGenerator::GenerateDeoptimizationData() {
   Handle<DeoptimizationData> data =
       DeoptimizationData::New(isolate(), deopt_count, AllocationType::kOld);
 
-  Handle<TranslationArray> translation_array =
-      translations_.ToTranslationArray(isolate()->factory());
+  Handle<DeoptimizationFrameTranslation> translation_array =
+      translations_.ToFrameTranslation(
+          isolate()->main_thread_local_isolate()->factory());
 
-  data->SetTranslationByteArray(*translation_array);
+  data->SetFrameTranslation(*translation_array);
   data->SetInlinedFunctionCount(
       Smi::FromInt(static_cast<int>(inlined_function_count_)));
   data->SetOptimizationId(Smi::FromInt(info->optimization_id()));
@@ -977,6 +974,9 @@ Handle<DeoptimizationData> CodeGenerator::GenerateDeoptimizationData() {
 #endif  // DEBUG
   }
 
+#ifdef DEBUG
+  data->Verify(info->bytecode_array());
+#endif  // DEBUG
   return data;
 }
 
@@ -999,7 +999,6 @@ void CodeGenerator::RecordCallPosition(Instruction* instr) {
   }
 
   if (needs_frame_state) {
-    MarkLazyDeoptSite();
     // If the frame state is present, it starts at argument 1 - after
     // the code address.
     size_t frame_state_offset = 1;
@@ -1101,9 +1100,11 @@ void CodeGenerator::BuildTranslationForFrameStateDescriptor(
     case FrameStateType::kInlinedExtraArguments:
       translations_.BeginInlinedExtraArguments(shared_info_id, height);
       break;
-    case FrameStateType::kConstructStub:
-      DCHECK(bailout_id.IsValidForConstructStub());
-      translations_.BeginConstructStubFrame(bailout_id, shared_info_id, height);
+    case FrameStateType::kConstructCreateStub:
+      translations_.BeginConstructCreateStubFrame(shared_info_id, height);
+      break;
+    case FrameStateType::kConstructInvokeStub:
+      translations_.BeginConstructInvokeStubFrame(shared_info_id);
       break;
     case FrameStateType::kBuiltinContinuation: {
       translations_.BeginBuiltinContinuationFrame(bailout_id, shared_info_id,
@@ -1111,6 +1112,10 @@ void CodeGenerator::BuildTranslationForFrameStateDescriptor(
       break;
     }
 #if V8_ENABLE_WEBASSEMBLY
+    case FrameStateType::kWasmInlinedIntoJS:
+      translations_.BeginWasmInlinedIntoJSFrame(bailout_id, shared_info_id,
+                                                height);
+      break;
     case FrameStateType::kJSToWasmBuiltinContinuation: {
       const JSToWasmFrameStateDescriptor* js_to_wasm_descriptor =
           static_cast<const JSToWasmFrameStateDescriptor*>(descriptor);
@@ -1258,8 +1263,8 @@ void CodeGenerator::AddTranslationForOperand(Instruction* instr,
           // When pointers are 4 bytes, we can use int32 constants to represent
           // Smis.
           DCHECK_EQ(4, kSystemPointerSize);
-          Smi smi(static_cast<Address>(constant.ToInt32()));
-          DCHECK(smi.IsSmi());
+          Tagged<Smi> smi(static_cast<Address>(constant.ToInt32()));
+          DCHECK(IsSmi(smi));
           literal = DeoptimizationLiteral(static_cast<double>(smi.value()));
         } else if (type.representation() == MachineRepresentation::kBit) {
           if (constant.ToInt32() == 0) {
@@ -1302,8 +1307,8 @@ void CodeGenerator::AddTranslationForOperand(Instruction* instr,
           // When pointers are 8 bytes, we can use int64 constants to represent
           // Smis.
           DCHECK_EQ(MachineRepresentation::kTagged, type.representation());
-          Smi smi(static_cast<Address>(constant.ToInt64()));
-          DCHECK(smi.IsSmi());
+          Tagged<Smi> smi(static_cast<Address>(constant.ToInt64()));
+          DCHECK(IsSmi(smi));
           literal = DeoptimizationLiteral(static_cast<double>(smi.value()));
         }
         break;
@@ -1338,10 +1343,6 @@ void CodeGenerator::AddTranslationForOperand(Instruction* instr,
   }
 }
 
-void CodeGenerator::MarkLazyDeoptSite() {
-  last_lazy_deopt_pc_ = masm()->pc_offset();
-}
-
 DeoptimizationExit* CodeGenerator::AddDeoptimizationExit(
     Instruction* instr, size_t frame_state_offset,
     size_t immediate_args_count) {
diff --git a/deps/v8/src/compiler/backend/code-generator.h b/deps/v8/src/compiler/backend/code-generator.h
index 1709a398b8081e..e5f04e66a256e8 100644
--- a/deps/v8/src/compiler/backend/code-generator.h
+++ b/deps/v8/src/compiler/backend/code-generator.h
@@ -23,10 +23,6 @@
 #include "src/trap-handler/trap-handler.h"
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-namespace v8::internal::wasm {
-class AssemblerBufferCache;
-}
-
 namespace v8::internal::compiler {
 
 // Forward declarations.
@@ -146,14 +142,16 @@ struct TurbolizerInstructionStartInfo {
 // Generates native code for a sequence of instructions.
 class V8_EXPORT_PRIVATE CodeGenerator final : public GapResolver::Assembler {
  public:
-  explicit CodeGenerator(
-      Zone* codegen_zone, Frame* frame, Linkage* linkage,
-      InstructionSequence* instructions, OptimizedCompilationInfo* info,
-      Isolate* isolate, base::Optional<OsrHelper> osr_helper,
-      int start_source_position, JumpOptimizationInfo* jump_opt,
-      const AssemblerOptions& options, wasm::AssemblerBufferCache* buffer_cache,
-      Builtin builtin, size_t max_unoptimized_frame_height,
-      size_t max_pushed_argument_count, const char* debug_name = nullptr);
+  explicit CodeGenerator(Zone* codegen_zone, Frame* frame, Linkage* linkage,
+                         InstructionSequence* instructions,
+                         OptimizedCompilationInfo* info, Isolate* isolate,
+                         base::Optional<OsrHelper> osr_helper,
+                         int start_source_position,
+                         JumpOptimizationInfo* jump_opt,
+                         const AssemblerOptions& options, Builtin builtin,
+                         size_t max_unoptimized_frame_height,
+                         size_t max_pushed_argument_count,
+                         const char* debug_name = nullptr);
 
   // Generate native code. After calling AssembleCode, call FinalizeCode to
   // produce the actual code object. If an error occurs during either phase,
@@ -161,8 +159,8 @@ class V8_EXPORT_PRIVATE CodeGenerator final : public GapResolver::Assembler {
   void AssembleCode();  // Does not need to run on main thread.
   MaybeHandle<Code> FinalizeCode();
 
-  base::OwnedVector<byte> GetSourcePositionTable();
-  base::OwnedVector<byte> GetProtectedInstructionsData();
+  base::OwnedVector<uint8_t> GetSourcePositionTable();
+  base::OwnedVector<uint8_t> GetProtectedInstructionsData();
 
   InstructionSequence* instructions() const { return instructions_; }
   FrameAccessState* frame_access_state() const { return frame_access_state_; }
@@ -175,8 +173,6 @@ class V8_EXPORT_PRIVATE CodeGenerator final : public GapResolver::Assembler {
   void AddProtectedInstructionLanding(uint32_t instr_offset,
                                       uint32_t landing_offset);
 
-  bool wasm_runtime_exception_support() const;
-
   SourcePosition start_source_position() const {
     return start_source_position_;
   }
@@ -265,6 +261,11 @@ class V8_EXPORT_PRIVATE CodeGenerator final : public GapResolver::Assembler {
 
   CodeGenResult AssembleDeoptimizerCall(DeoptimizationExit* exit);
 
+  DeoptimizationExit* BuildTranslation(Instruction* instr, int pc_offset,
+                                       size_t frame_state_offset,
+                                       size_t immediate_args_count,
+                                       OutputFrameStateCombine state_combine);
+
   // ===========================================================================
   // ============= Architecture-specific code generation methods. ==============
   // ===========================================================================
@@ -415,10 +416,7 @@ class V8_EXPORT_PRIVATE CodeGenerator final : public GapResolver::Assembler {
   int DefineDeoptimizationLiteral(DeoptimizationLiteral literal);
   DeoptimizationEntry const& GetDeoptimizationEntry(Instruction* instr,
                                                     size_t frame_state_offset);
-  DeoptimizationExit* BuildTranslation(Instruction* instr, int pc_offset,
-                                       size_t frame_state_offset,
-                                       size_t immediate_args_count,
-                                       OutputFrameStateCombine state_combine);
+
   void BuildTranslationForFrameStateDescriptor(
       FrameStateDescriptor* descriptor, InstructionOperandIterator* iter,
       OutputFrameStateCombine state_combine);
@@ -429,7 +427,6 @@ class V8_EXPORT_PRIVATE CodeGenerator final : public GapResolver::Assembler {
                                              InstructionOperandIterator* iter);
   void AddTranslationForOperand(Instruction* instr, InstructionOperand* op,
                                 MachineType type);
-  void MarkLazyDeoptSite();
 
   void PrepareForDeoptimizationExits(ZoneDeque<DeoptimizationExit*>* exits);
   DeoptimizationExit* AddDeoptimizationExit(Instruction* instr,
@@ -469,9 +466,8 @@ class V8_EXPORT_PRIVATE CodeGenerator final : public GapResolver::Assembler {
   ZoneDeque<DeoptimizationExit*> deoptimization_exits_;
   ZoneDeque<DeoptimizationLiteral> deoptimization_literals_;
   size_t inlined_function_count_ = 0;
-  TranslationArrayBuilder translations_;
+  FrameTranslationBuilder translations_;
   int handler_table_offset_ = 0;
-  int last_lazy_deopt_pc_ = 0;
 
   // Deoptimization exits must be as small as possible, since their count grows
   // with function size. {jump_deoptimization_entry_labels_} is an optimization
diff --git a/deps/v8/src/compiler/backend/frame-elider.cc b/deps/v8/src/compiler/backend/frame-elider.cc
index 5454996b3812c3..add7d38860b77f 100644
--- a/deps/v8/src/compiler/backend/frame-elider.cc
+++ b/deps/v8/src/compiler/backend/frame-elider.cc
@@ -10,7 +10,8 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-FrameElider::FrameElider(InstructionSequence* code) : code_(code) {}
+FrameElider::FrameElider(InstructionSequence* code, bool has_dummy_end_block)
+    : code_(code), has_dummy_end_block_(has_dummy_end_block) {}
 
 void FrameElider::Run() {
   MarkBlocks();
@@ -107,9 +108,13 @@ bool FrameElider::PropagateIntoBlock(InstructionBlock* block) {
   // Already marked, nothing to do...
   if (block->needs_frame()) return false;
 
-  // Never mark the dummy end node, otherwise we might incorrectly decide to
-  // put frame deconstruction code there later,
-  if (block->successors().empty()) return false;
+  // Turbofan does have an empty dummy end block, which we need to ignore here.
+  // However, Turboshaft does not have such a block.
+  if (has_dummy_end_block_) {
+    // Never mark the dummy end node, otherwise we might incorrectly decide to
+    // put frame deconstruction code there later,
+    if (block->successors().empty()) return false;
+  }
 
   // Propagate towards the end ("downwards") if there is a predecessor needing
   // a frame, but don't "bleed" from deferred code to non-deferred code.
diff --git a/deps/v8/src/compiler/backend/frame-elider.h b/deps/v8/src/compiler/backend/frame-elider.h
index 11dfce2c52cfea..3f4670e9fcc64c 100644
--- a/deps/v8/src/compiler/backend/frame-elider.h
+++ b/deps/v8/src/compiler/backend/frame-elider.h
@@ -15,7 +15,7 @@ namespace compiler {
 // constructed/deconstructed.
 class FrameElider {
  public:
-  explicit FrameElider(InstructionSequence* code);
+  explicit FrameElider(InstructionSequence* code, bool has_dummy_end_block);
   void Run();
 
  private:
@@ -30,6 +30,7 @@ class FrameElider {
   Instruction* InstructionAt(int index) const;
 
   InstructionSequence* const code_;
+  const bool has_dummy_end_block_;
 };
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/backend/ia32/code-generator-ia32.cc b/deps/v8/src/compiler/backend/ia32/code-generator-ia32.cc
index fe1df09b985f01..e1437980ded485 100644
--- a/deps/v8/src/compiler/backend/ia32/code-generator-ia32.cc
+++ b/deps/v8/src/compiler/backend/ia32/code-generator-ia32.cc
@@ -507,21 +507,21 @@ class OutOfLineRecordWrite final : public OutOfLineCode {
     __ cmov(zero, dst, tmp);                         \
   } while (false)
 
-#define ASSEMBLE_SIMD_SHIFT(opcode, width)             \
-  do {                                                 \
-    XMMRegister dst = i.OutputSimd128Register();       \
-    DCHECK_EQ(dst, i.InputSimd128Register(0));         \
-    if (HasImmediateInput(instr, 1)) {                 \
-      __ opcode(dst, dst, byte{i.InputInt##width(1)}); \
-    } else {                                           \
-      XMMRegister tmp = i.TempSimd128Register(0);      \
-      Register tmp_shift = i.TempRegister(1);          \
-      constexpr int mask = (1 << width) - 1;           \
-      __ mov(tmp_shift, i.InputRegister(1));           \
-      __ and_(tmp_shift, Immediate(mask));             \
-      __ Movd(tmp, tmp_shift);                         \
-      __ opcode(dst, dst, tmp);                        \
-    }                                                  \
+#define ASSEMBLE_SIMD_SHIFT(opcode, width)                \
+  do {                                                    \
+    XMMRegister dst = i.OutputSimd128Register();          \
+    DCHECK_EQ(dst, i.InputSimd128Register(0));            \
+    if (HasImmediateInput(instr, 1)) {                    \
+      __ opcode(dst, dst, uint8_t{i.InputInt##width(1)}); \
+    } else {                                              \
+      XMMRegister tmp = i.TempSimd128Register(0);         \
+      Register tmp_shift = i.TempRegister(1);             \
+      constexpr int mask = (1 << width) - 1;              \
+      __ mov(tmp_shift, i.InputRegister(1));              \
+      __ and_(tmp_shift, Immediate(mask));                \
+      __ Movd(tmp, tmp_shift);                            \
+      __ opcode(dst, dst, tmp);                           \
+    }                                                     \
   } while (false)
 
 #define ASSEMBLE_SIMD_PINSR(OPCODE, CPU_FEATURE)             \
@@ -663,7 +663,7 @@ void CodeGenerator::BailoutIfDeoptimized() {
   int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
   __ push(eax);  // Push eax so we can use it as a scratch register.
   __ mov(eax, Operand(kJavaScriptCallCodeStartRegister, offset));
-  __ test(FieldOperand(eax, Code::kKindSpecificFlagsOffset),
+  __ test(FieldOperand(eax, Code::kFlagsOffset),
           Immediate(1 << Code::kMarkedForDeoptimizationBit));
   __ pop(eax);  // Restore eax.
 
@@ -700,7 +700,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchCallBuiltinPointer: {
       DCHECK(!HasImmediateInput(instr, 0));
       Register builtin_index = i.InputRegister(0);
-      __ CallBuiltinByIndex(builtin_index);
+      Register target =
+          instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister)
+              ? kJavaScriptCallCodeStartRegister
+              : builtin_index;
+      __ CallBuiltinByIndex(builtin_index, target);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -768,9 +772,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ cmp(esi, FieldOperand(func, JSFunction::kContextOffset));
         __ Assert(equal, AbortReason::kWrongFunctionContext);
       }
-      static_assert(kJavaScriptCallCodeStartRegister == ecx, "ABI mismatch");
-      __ mov(ecx, FieldOperand(func, JSFunction::kCodeOffset));
-      __ CallCodeObject(ecx);
+      __ CallJSFunction(func);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -822,12 +824,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         // Put the return address in a stack slot.
         Register scratch = eax;
         __ push(scratch);
-        __ PushPC();
-        int pc = __ pc_offset();
-        __ pop(scratch);
-        __ sub(scratch,
-               Immediate(pc + InstructionStream::kHeaderSize - kHeapObjectTag));
-        __ add(scratch, Immediate::CodeRelativeOffset(&return_location));
+        __ LoadLabelAddress(scratch, &return_location);
         __ mov(MemOperand(ebp, WasmExitFrameConstants::kCallingPCOffset),
                scratch);
         __ pop(scratch);
@@ -983,6 +980,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier:
+      UNREACHABLE();
     case kArchStackSlot: {
       FrameOffset offset =
           frame_access_state()->GetFrameOffset(i.InputInt32(0));
@@ -2131,7 +2130,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ Pblendw(kScratchDoubleReg, src, uint8_t{0x55});  // get lo 16 bits
       __ Psubd(dst, src, kScratchDoubleReg);              // get hi 16 bits
       __ Cvtdq2ps(kScratchDoubleReg, kScratchDoubleReg);  // convert lo exactly
-      __ Psrld(dst, dst, byte{1});  // divide by 2 to get in unsigned range
+      __ Psrld(dst, dst, uint8_t{1});  // divide by 2 to get in unsigned range
       __ Cvtdq2ps(dst, dst);    // convert hi exactly
       __ Addps(dst, dst, dst);  // double hi, exactly
       __ Addps(dst, dst, kScratchDoubleReg);  // add hi and lo, may round.
@@ -3773,29 +3772,15 @@ void CodeGenerator::AssembleArchTrap(Instruction* instr,
 
    private:
     void GenerateCallToTrap(TrapId trap_id) {
-      if (trap_id == TrapId::kInvalid) {
-        // We cannot test calls to the runtime in cctest/test-run-wasm.
-        // Therefore we emit a call to C here instead of a call to the runtime.
-        __ PrepareCallCFunction(0, esi);
-        __ CallCFunction(
-            ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-        __ LeaveFrame(StackFrame::WASM);
-        auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-        size_t pop_size =
-            call_descriptor->ParameterSlotCount() * kSystemPointerSize;
-        // Use ecx as a scratch register, we return anyways immediately.
-        __ Ret(static_cast<int>(pop_size), ecx);
-      } else {
-        gen_->AssembleSourcePosition(instr_);
-        // A direct call to a wasm runtime stub defined in this module.
-        // Just encode the stub index. This will be patched when the code
-        // is added to the native module and copied into wasm code space.
-        __ wasm_call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-        ReferenceMap* reference_map =
-            gen_->zone()->New<ReferenceMap>(gen_->zone());
-        gen_->RecordSafepoint(reference_map);
-        __ AssertUnreachable(AbortReason::kUnexpectedReturnFromWasmTrap);
-      }
+      gen_->AssembleSourcePosition(instr_);
+      // A direct call to a wasm runtime stub defined in this module.
+      // Just encode the stub index. This will be patched when the code
+      // is added to the native module and copied into wasm code space.
+      __ wasm_call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+      ReferenceMap* reference_map =
+          gen_->zone()->New<ReferenceMap>(gen_->zone());
+      gen_->RecordSafepoint(reference_map);
+      __ AssertUnreachable(AbortReason::kUnexpectedReturnFromWasmTrap);
     }
 
     Instruction* instr_;
@@ -3868,7 +3853,7 @@ void CodeGenerator::AssembleArchTableSwitch(Instruction* instr) {
   IA32OperandConverter i(this, instr);
   Register input = i.InputRegister(0);
   size_t const case_count = instr->InputCount() - 2;
-  Label** cases = zone()->NewArray<Label*>(case_count);
+  Label** cases = zone()->AllocateArray<Label*>(case_count);
   for (size_t index = 0; index < case_count; ++index) {
     cases[index] = GetLabel(i.InputRpo(index + 2));
   }
@@ -4221,7 +4206,7 @@ void CodeGenerator::AssembleReturn(InstructionOperand* additional_pop_count) {
     }
   } else {
     Register pop_reg = g.ToRegister(additional_pop_count);
-    Register scratch_reg = pop_reg == ecx ? edx : ecx;
+    Register scratch_reg = pop_reg == ecx ? edi : ecx;
     DCHECK(!call_descriptor->CalleeSavedRegisters().has(scratch_reg));
     DCHECK(!call_descriptor->CalleeSavedRegisters().has(pop_reg));
     int pop_size = static_cast<int>(parameter_slots * kSystemPointerSize);
@@ -4266,22 +4251,24 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
   IA32OperandConverter g(this, nullptr);
-  int new_slots = ElementSizeInPointers(rep);
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = ElementSizeInPointers(rep);
   if (dest->IsRegister()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ pop(g.ToRegister(dest));
   } else if (dest->IsStackSlot() || dest->IsFloatStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ pop(g.ToOperand(dest));
   } else {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ add(esp, Immediate(new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ add(esp, Immediate(dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
diff --git a/deps/v8/src/compiler/backend/ia32/instruction-selector-ia32.cc b/deps/v8/src/compiler/backend/ia32/instruction-selector-ia32.cc
index eb9195b0d12360..630a9fd5d9fb15 100644
--- a/deps/v8/src/compiler/backend/ia32/instruction-selector-ia32.cc
+++ b/deps/v8/src/compiler/backend/ia32/instruction-selector-ia32.cc
@@ -21,6 +21,7 @@
 #include "src/codegen/macro-assembler-base.h"
 #include "src/common/globals.h"
 #include "src/compiler/backend/instruction-codes.h"
+#include "src/compiler/backend/instruction-selector-adapter.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
 #include "src/compiler/backend/instruction-selector.h"
 #include "src/compiler/backend/instruction.h"
@@ -48,10 +49,13 @@ namespace internal {
 namespace compiler {
 
 // Adds IA32-specific methods for generating operands.
-class IA32OperandGenerator final : public OperandGenerator {
+template <typename Adapter>
+class IA32OperandGeneratorT final : public OperandGeneratorT<Adapter> {
  public:
-  explicit IA32OperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit IA32OperandGeneratorT(InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
 
   InstructionOperand UseByteRegister(Node* node) {
     // TODO(titzer): encode byte register use constraints.
@@ -129,7 +133,8 @@ class IA32OperandGenerator final : public OperandGenerator {
   AddressingMode GenerateMemoryOperandInputs(
       Node* index, int scale, Node* base, int32_t displacement,
       DisplacementMode displacement_mode, InstructionOperand inputs[],
-      size_t* input_count, RegisterMode register_mode = kRegister) {
+      size_t* input_count,
+      RegisterMode register_mode = RegisterMode::kRegister) {
     AddressingMode mode = kMode_MRI;
     if (displacement_mode == kNegativeDisplacement) {
       displacement = base::bits::WraparoundNeg32(displacement);
@@ -189,7 +194,8 @@ class IA32OperandGenerator final : public OperandGenerator {
   AddressingMode GenerateMemoryOperandInputs(
       Node* index, int scale, Node* base, Node* displacement_node,
       DisplacementMode displacement_mode, InstructionOperand inputs[],
-      size_t* input_count, RegisterMode register_mode = kRegister) {
+      size_t* input_count,
+      RegisterMode register_mode = RegisterMode::kRegister) {
     int32_t displacement = (displacement_node == nullptr)
                                ? 0
                                : OpParameter<int32_t>(displacement_node->op());
@@ -198,44 +204,51 @@ class IA32OperandGenerator final : public OperandGenerator {
                                        register_mode);
   }
 
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(AddressingMode,
+                                          GetEffectiveAddressMemoryOperand)
   AddressingMode GetEffectiveAddressMemoryOperand(
-      Node* node, InstructionOperand inputs[], size_t* input_count,
-      RegisterMode register_mode = kRegister) {
-    {
-      LoadMatcher<ExternalReferenceMatcher> m(node);
-      if (m.index().HasResolvedValue() && m.object().HasResolvedValue() &&
-          selector()->CanAddressRelativeToRootsRegister(
-              m.object().ResolvedValue())) {
-        ptrdiff_t const delta =
-            m.index().ResolvedValue() +
-            MacroAssemblerBase::RootRegisterOffsetForExternalReference(
-                selector()->isolate(), m.object().ResolvedValue());
-        if (is_int32(delta)) {
-          inputs[(*input_count)++] = TempImmediate(static_cast<int32_t>(delta));
-          return kMode_Root;
+      node_t node, InstructionOperand inputs[], size_t* input_count,
+      RegisterMode register_mode = RegisterMode::kRegister) {
+    if constexpr (Adapter::IsTurboshaft) {
+      UNIMPLEMENTED();
+    } else {
+      {
+        LoadMatcher<ExternalReferenceMatcher> m(node);
+        if (m.index().HasResolvedValue() && m.object().HasResolvedValue() &&
+            selector()->CanAddressRelativeToRootsRegister(
+                m.object().ResolvedValue())) {
+          ptrdiff_t const delta =
+              m.index().ResolvedValue() +
+              MacroAssemblerBase::RootRegisterOffsetForExternalReference(
+                  selector()->isolate(), m.object().ResolvedValue());
+          if (is_int32(delta)) {
+            inputs[(*input_count)++] =
+                TempImmediate(static_cast<int32_t>(delta));
+            return kMode_Root;
+          }
         }
       }
-    }
 
-    BaseWithIndexAndDisplacement32Matcher m(node, AddressOption::kAllowAll);
-    DCHECK(m.matches());
-    if (m.base() != nullptr &&
-        m.base()->opcode() == IrOpcode::kLoadRootRegister) {
-      DCHECK_EQ(m.index(), nullptr);
-      DCHECK_EQ(m.scale(), 0);
-      inputs[(*input_count)++] = UseImmediate(m.displacement());
-      return kMode_Root;
-    } else if ((m.displacement() == nullptr ||
-                CanBeImmediate(m.displacement()))) {
-      return GenerateMemoryOperandInputs(
-          m.index(), m.scale(), m.base(), m.displacement(),
-          m.displacement_mode(), inputs, input_count, register_mode);
-    } else {
-      inputs[(*input_count)++] =
-          UseRegisterWithMode(node->InputAt(0), register_mode);
-      inputs[(*input_count)++] =
-          UseRegisterWithMode(node->InputAt(1), register_mode);
-      return kMode_MR1;
+      BaseWithIndexAndDisplacement32Matcher m(node, AddressOption::kAllowAll);
+      DCHECK(m.matches());
+      if (m.base() != nullptr &&
+          m.base()->opcode() == IrOpcode::kLoadRootRegister) {
+        DCHECK_EQ(m.index(), nullptr);
+        DCHECK_EQ(m.scale(), 0);
+        inputs[(*input_count)++] = UseImmediate(m.displacement());
+        return kMode_Root;
+      } else if ((m.displacement() == nullptr ||
+                  CanBeImmediate(m.displacement()))) {
+        return GenerateMemoryOperandInputs(
+            m.index(), m.scale(), m.base(), m.displacement(),
+            m.displacement_mode(), inputs, input_count, register_mode);
+      } else {
+        inputs[(*input_count)++] =
+            UseRegisterWithMode(node->InputAt(0), register_mode);
+        inputs[(*input_count)++] =
+            UseRegisterWithMode(node->InputAt(1), register_mode);
+        return kMode_MR1;
+      }
     }
   }
 
@@ -250,7 +263,8 @@ class IA32OperandGenerator final : public OperandGenerator {
     }
   }
 
-  bool CanBeBetterLeftOperand(Node* node) const {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(bool, CanBeBetterLeftOperand)
+  bool CanBeBetterLeftOperand(node_t node) const {
     return !selector()->IsLive(node);
   }
 };
@@ -285,6 +299,7 @@ ArchOpcode GetLoadOpcode(LoadRepresentation load_rep) {
     case MachineRepresentation::kSimd256:            // Fall through.
     case MachineRepresentation::kCompressedPointer:  // Fall through.
     case MachineRepresentation::kCompressed:         // Fall through.
+    case MachineRepresentation::kIndirectPointer:    // Fall through.
     case MachineRepresentation::kSandboxedPointer:   // Fall through.
     case MachineRepresentation::kWord64:             // Fall through.
     case MachineRepresentation::kMapWord:            // Fall through.
@@ -294,8 +309,14 @@ ArchOpcode GetLoadOpcode(LoadRepresentation load_rep) {
   return opcode;
 }
 
-void VisitRO(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+template <typename T>
+void VisitRO(InstructionSelectorT<TurboshaftAdapter>* selector, T, ArchOpcode) {
+  UNIMPLEMENTED();
+}
+
+void VisitRO(InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
+             ArchOpcode opcode) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(selector);
   Node* input = node->InputAt(0);
   // We have to use a byte register as input to movsxb.
   InstructionOperand input_op =
@@ -303,33 +324,55 @@ void VisitRO(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
   selector->Emit(opcode, g.DefineAsRegister(node), input_op);
 }
 
-void VisitROWithTemp(InstructionSelector* selector, Node* node,
-                     ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
-  InstructionOperand temps[] = {g.TempRegister()};
-  selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0)),
-                 arraysize(temps), temps);
+template <typename Adapter>
+void VisitROWithTemp(InstructionSelectorT<Adapter>* selector,
+                     typename Adapter::node_t node, ArchOpcode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(selector);
+    InstructionOperand temps[] = {g.TempRegister()};
+    selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0)),
+                   arraysize(temps), temps);
+  }
 }
 
-void VisitROWithTempSimd(InstructionSelector* selector, Node* node,
-                         ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+template <typename T>
+void VisitROWithTempSimd(InstructionSelectorT<TurboshaftAdapter>*, T,
+                         ArchOpcode) {
+  UNIMPLEMENTED();
+}
+
+void VisitROWithTempSimd(InstructionSelectorT<TurbofanAdapter>* selector,
+                         Node* node, ArchOpcode opcode) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(selector);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseUniqueRegister(node->InputAt(0)), arraysize(temps),
                  temps);
 }
 
-void VisitRR(InstructionSelector* selector, Node* node,
+template <typename T>
+void VisitRR(InstructionSelectorT<TurboshaftAdapter>*, T, InstructionCode) {
+  UNIMPLEMENTED();
+}
+
+void VisitRR(InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
              InstructionCode opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)));
 }
 
-void VisitRROFloat(InstructionSelector* selector, Node* node,
+template <typename T>
+void VisitRROFloat(InstructionSelectorT<TurboshaftAdapter>* selector, T,
+                   ArchOpcode) {
+  UNIMPLEMENTED();
+}
+
+void VisitRROFloat(InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
                    ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<TurbofanAdapter> g(selector);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   InstructionOperand operand1 = g.Use(node->InputAt(1));
   if (selector->IsSupported(AVX)) {
@@ -342,9 +385,16 @@ void VisitRROFloat(InstructionSelector* selector, Node* node,
 // For float unary operations. Also allocates a temporary general register for
 // used in external operands. If a temp is not required, use VisitRRSimd (since
 // float and SIMD registers are the same on IA32.
-void VisitFloatUnop(InstructionSelector* selector, Node* node, Node* input,
-                    ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+void VisitFloatUnop(InstructionSelectorT<TurboshaftAdapter>*, Node*, Node*,
+                    ArchOpcode) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void VisitFloatUnop(InstructionSelectorT<Adapter>* selector,
+                    typename Adapter::node_t node,
+                    typename Adapter::node_t input, ArchOpcode opcode) {
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand temps[] = {g.TempRegister()};
   // No need for unique because inputs are float but temp is general.
   if (selector->IsSupported(AVX)) {
@@ -356,9 +406,10 @@ void VisitFloatUnop(InstructionSelector* selector, Node* node, Node* input,
   }
 }
 
-void VisitRRSimd(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitRRSimd(InstructionSelectorT<Adapter>* selector, Node* node,
                  ArchOpcode avx_opcode, ArchOpcode sse_opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   if (selector->IsSupported(AVX)) {
     selector->Emit(avx_opcode, g.DefineAsRegister(node), operand0);
@@ -367,7 +418,9 @@ void VisitRRSimd(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitRRSimd(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
+template <typename Adapter>
+void VisitRRSimd(InstructionSelectorT<Adapter>* selector, Node* node,
+                 ArchOpcode opcode) {
   VisitRRSimd(selector, node, opcode, opcode);
 }
 
@@ -375,9 +428,10 @@ void VisitRRSimd(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
 // a register as we don't have memory alignment yet. For AVX, memory operands
 // are fine, but can have performance issues if not aligned to 16/32 bytes
 // (based on load size), see SDM Vol 1, chapter 14.9
-void VisitRROSimd(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitRROSimd(InstructionSelectorT<Adapter>* selector, Node* node,
                   ArchOpcode avx_opcode, ArchOpcode sse_opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   if (selector->IsSupported(AVX)) {
     selector->Emit(avx_opcode, g.DefineAsRegister(node), operand0,
@@ -387,9 +441,11 @@ void VisitRROSimd(InstructionSelector* selector, Node* node,
                    g.UseRegister(node->InputAt(1)));
   }
 }
-void VisitRRRSimd(InstructionSelector* selector, Node* node,
+
+template <typename Adapter>
+void VisitRRRSimd(InstructionSelectorT<Adapter>* selector, Node* node,
                   ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand dst = selector->IsSupported(AVX)
                                ? g.DefineAsRegister(node)
                                : g.DefineSameAsFirst(node);
@@ -398,9 +454,10 @@ void VisitRRRSimd(InstructionSelector* selector, Node* node,
   selector->Emit(opcode, dst, operand0, operand1);
 }
 
-void VisitRRISimd(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitRRISimd(InstructionSelectorT<Adapter>* selector, Node* node,
                   ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   InstructionOperand operand1 =
       g.UseImmediate(OpParameter<int32_t>(node->op()));
@@ -412,9 +469,10 @@ void VisitRRISimd(InstructionSelector* selector, Node* node,
   selector->Emit(opcode, dest, operand0, operand1);
 }
 
-void VisitRRISimd(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitRRISimd(InstructionSelectorT<Adapter>* selector, Node* node,
                   ArchOpcode avx_opcode, ArchOpcode sse_opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   InstructionOperand operand1 =
       g.UseImmediate(OpParameter<int32_t>(node->op()));
@@ -425,9 +483,10 @@ void VisitRRISimd(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitRROSimdShift(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitRROSimdShift(InstructionSelectorT<Adapter>* selector, Node* node,
                        ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   if (g.CanBeImmediate(node->InputAt(1))) {
     selector->Emit(opcode, g.DefineSameAsFirst(node),
                    g.UseRegister(node->InputAt(0)),
@@ -441,17 +500,19 @@ void VisitRROSimdShift(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitRRRR(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitRRRR(InstructionSelectorT<Adapter>* selector, Node* node,
                InstructionCode opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   selector->Emit(
       opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
       g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2)));
 }
 
-void VisitI8x16Shift(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitI8x16Shift(InstructionSelectorT<Adapter>* selector, Node* node,
                      ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand output = CpuFeatures::IsSupported(AVX)
                                   ? g.UseRegister(node)
                                   : g.DefineSameAsFirst(node);
@@ -474,21 +535,32 @@ void VisitI8x16Shift(InstructionSelector* selector, Node* node,
 }
 }  // namespace
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
-  int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
-  OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+    int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
+    OperandGenerator g(this);
 
-  Emit(kArchStackSlot, g.DefineAsRegister(node),
-       sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+    Emit(kArchStackSlot, g.DefineAsRegister(node),
+         sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+  }
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  IA32OperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), edx));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), edx));
+  }
 }
 
-void InstructionSelector::VisitLoadLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
   LoadLaneParameters params = LoadLaneParametersOf(node->op());
   InstructionCode opcode = kArchNop;
   if (params.rep == MachineType::Int8()) {
@@ -509,7 +581,7 @@ void InstructionSelector::VisitLoadLane(Node* node) {
     UNREACHABLE();
   }
 
-  IA32OperandGenerator g(this);
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand outputs[] = {IsSupported(AVX) ? g.DefineAsRegister(node)
                                                    : g.DefineSameAsFirst(node)};
   // Input 0 is value node, 1 is lane idx, and GetEffectiveAddressMemoryOperand
@@ -535,7 +607,8 @@ void InstructionSelector::VisitLoadLane(Node* node) {
   Emit(opcode, 1, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
   InstructionCode opcode;
   switch (params.transformation) {
@@ -584,7 +657,7 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   // Trap handler is not supported on IA32.
   DCHECK_NE(params.kind, MemoryAccessKind::kProtected);
 
-  IA32OperandGenerator g(this);
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand outputs[1];
   outputs[0] = g.DefineAsRegister(node);
   InstructionOperand inputs[3];
@@ -595,9 +668,10 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   Emit(code, 1, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitLoad(Node* node, Node* value,
-                                    InstructionCode opcode) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node, node_t value,
+                                              InstructionCode opcode) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand outputs[1];
   outputs[0] = g.DefineAsRegister(node);
   InstructionOperand inputs[3];
@@ -608,13 +682,15 @@ void InstructionSelector::VisitLoad(Node* node, Node* value,
   Emit(code, 1, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  LoadRepresentation load_rep = this->load_view(node).loaded_rep();
   DCHECK(!load_rep.IsMapWord());
   VisitLoad(node, node, GetLoadOpcode(load_rep));
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
@@ -642,6 +718,7 @@ ArchOpcode GetStoreOpcode(MachineRepresentation rep) {
     case MachineRepresentation::kSimd256:            // Fall through.
     case MachineRepresentation::kCompressedPointer:  // Fall through.
     case MachineRepresentation::kCompressed:         // Fall through.
+    case MachineRepresentation::kIndirectPointer:    // Fall through.
     case MachineRepresentation::kSandboxedPointer:   // Fall through.
     case MachineRepresentation::kWord64:             // Fall through.
     case MachineRepresentation::kMapWord:            // Fall through.
@@ -666,9 +743,10 @@ ArchOpcode GetSeqCstStoreOpcode(MachineRepresentation rep) {
   }
 }
 
-void VisitAtomicExchange(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicExchange(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode, MachineRepresentation rep) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -689,10 +767,11 @@ void VisitAtomicExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, arraysize(inputs), inputs);
 }
 
-void VisitStoreCommon(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitStoreCommon(InstructionSelectorT<Adapter>* selector, Node* node,
                       StoreRepresentation store_rep,
                       base::Optional<AtomicMemoryOrder> atomic_order) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -754,18 +833,30 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStore(Node* node) {
-  VisitStoreCommon(this, node, StoreRepresentationOf(node->op()),
-                   base::nullopt);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitStoreCommon(this, node, StoreRepresentationOf(node->op()),
+                     base::nullopt);
+  }
 }
 
-void InstructionSelector::VisitProtectedStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitStoreLane(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
 
   StoreLaneParameters params = StoreLaneParametersOf(node->op());
   InstructionCode opcode = kArchNop;
@@ -800,17 +891,24 @@ void InstructionSelector::VisitStoreLane(Node* node) {
 }
 
 // Architecture supports unaligned access, therefore VisitLoad is used instead
-void InstructionSelector::VisitUnalignedLoad(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  UNREACHABLE();
+}
 
 // Architecture supports unaligned access, therefore VisitStore is used instead
-void InstructionSelector::VisitUnalignedStore(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedStore(node_t node) {
+  UNREACHABLE();
+}
 
 namespace {
 
 // Shared routine for multiple binary operations.
-void VisitBinop(InstructionSelector* selector, Node* node,
-                InstructionCode opcode, FlagsContinuation* cont) {
-  IA32OperandGenerator g(selector);
+template <typename Adapter>
+void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
+                InstructionCode opcode, FlagsContinuationT<Adapter>* cont) {
+  IA32OperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   Node* left = m.left().node();
   Node* right = m.right().node();
@@ -865,84 +963,108 @@ void VisitBinop(InstructionSelector* selector, Node* node,
 }
 
 // Shared routine for multiple binary operations.
-void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename T>
+void VisitBinop(InstructionSelectorT<TurboshaftAdapter>*, T, InstructionCode) {
+  UNIMPLEMENTED();
+}
+
+void VisitBinop(InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
                 InstructionCode opcode) {
-  FlagsContinuation cont;
+  FlagsContinuationT<TurbofanAdapter> cont;
   VisitBinop(selector, node, opcode, &cont);
 }
 
 }  // namespace
 
-void InstructionSelector::VisitWord32And(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32And(node_t node) {
   VisitBinop(this, node, kIA32And);
 }
 
-void InstructionSelector::VisitWord32Or(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
   VisitBinop(this, node, kIA32Or);
 }
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  IA32OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(-1)) {
-    Emit(kIA32Not, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitBinop(this, node, kIA32Xor);
+    IA32OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.right().Is(-1)) {
+      Emit(kIA32Not, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()));
+    } else {
+      VisitBinop(this, node, kIA32Xor);
+    }
   }
 }
 
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
-  InstructionCode opcode =
-      kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
-
-  int effect_level = GetEffectLevel(node, cont);
-
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuation* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackCheckKind kind = StackCheckKindOf(node->op());
+    InstructionCode opcode = kArchStackPointerGreaterThan |
+                             MiscField::encode(static_cast<int>(kind));
 
-  // No outputs.
-  InstructionOperand* const outputs = nullptr;
-  const int output_count = 0;
+    int effect_level = GetEffectLevel(node, cont);
 
-  // Applying an offset to this stack check requires a temp register. Offsets
-  // are only applied to the first stack check. If applying an offset, we must
-  // ensure the input and temp registers do not alias, thus kUniqueRegister.
-  InstructionOperand temps[] = {g.TempRegister()};
-  const int temp_count = (kind == StackCheckKind::kJSFunctionEntry) ? 1 : 0;
-  const auto register_mode = (kind == StackCheckKind::kJSFunctionEntry)
-                                 ? OperandGenerator::kUniqueRegister
-                                 : OperandGenerator::kRegister;
+    IA32OperandGeneratorT<Adapter> g(this);
 
-  Node* const value = node->InputAt(0);
-  if (g.CanBeMemoryOperand(kIA32Cmp, node, value, effect_level)) {
-    DCHECK(value->opcode() == IrOpcode::kLoad ||
-           value->opcode() == IrOpcode::kLoadImmutable);
+    // No outputs.
+    InstructionOperand* const outputs = nullptr;
+    const int output_count = 0;
 
-    // GetEffectiveAddressMemoryOperand can create at most 3 inputs.
-    static constexpr int kMaxInputCount = 3;
-
-    size_t input_count = 0;
-    InstructionOperand inputs[kMaxInputCount];
-    AddressingMode addressing_mode = g.GetEffectiveAddressMemoryOperand(
-        value, inputs, &input_count, register_mode);
-    opcode |= AddressingModeField::encode(addressing_mode);
-    DCHECK_LE(input_count, kMaxInputCount);
+    // Applying an offset to this stack check requires a temp register. Offsets
+    // are only applied to the first stack check. If applying an offset, we must
+    // ensure the input and temp registers do not alias, thus kUniqueRegister.
+    InstructionOperand temps[] = {g.TempRegister()};
+    const int temp_count = (kind == StackCheckKind::kJSFunctionEntry) ? 1 : 0;
+    const auto register_mode = (kind == StackCheckKind::kJSFunctionEntry)
+                                   ? OperandGenerator::kUniqueRegister
+                                   : OperandGenerator::kRegister;
+
+    Node* const value = node->InputAt(0);
+    if (g.CanBeMemoryOperand(kIA32Cmp, node, value, effect_level)) {
+      DCHECK(value->opcode() == IrOpcode::kLoad ||
+             value->opcode() == IrOpcode::kLoadImmutable);
+
+      // GetEffectiveAddressMemoryOperand can create at most 3 inputs.
+      static constexpr int kMaxInputCount = 3;
+
+      size_t input_count = 0;
+      InstructionOperand inputs[kMaxInputCount];
+      AddressingMode addressing_mode = g.GetEffectiveAddressMemoryOperand(
+          value, inputs, &input_count, register_mode);
+      opcode |= AddressingModeField::encode(addressing_mode);
+      DCHECK_LE(input_count, kMaxInputCount);
 
-    EmitWithContinuation(opcode, output_count, outputs, input_count, inputs,
-                         temp_count, temps, cont);
-  } else {
-    InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
-    static constexpr int input_count = arraysize(inputs);
-    EmitWithContinuation(opcode, output_count, outputs, input_count, inputs,
-                         temp_count, temps, cont);
+      EmitWithContinuation(opcode, output_count, outputs, input_count, inputs,
+                           temp_count, temps, cont);
+    } else {
+      InstructionOperand inputs[] = {
+          g.UseRegisterWithMode(value, register_mode)};
+      static constexpr int input_count = arraysize(inputs);
+      EmitWithContinuation(opcode, output_count, outputs, input_count, inputs,
+                           temp_count, temps, cont);
+    }
   }
 }
 
 // Shared routine for multiple shift operations.
-static inline void VisitShift(InstructionSelector* selector, Node* node,
-                              ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+template <typename T>
+static inline void VisitShift(InstructionSelectorT<TurboshaftAdapter>*, T,
+                              ArchOpcode) {
+  UNIMPLEMENTED();
+}
+
+static inline void VisitShift(InstructionSelectorT<TurbofanAdapter>* selector,
+                              Node* node, ArchOpcode opcode) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(selector);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
 
@@ -957,35 +1079,53 @@ static inline void VisitShift(InstructionSelector* selector, Node* node,
 
 namespace {
 
-void VisitMulHigh(InstructionSelector* selector, Node* node,
-                  ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
-  InstructionOperand temps[] = {g.TempRegister(eax)};
-  selector->Emit(
-      opcode, g.DefineAsFixed(node, edx), g.UseFixed(node->InputAt(0), eax),
-      g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
+template <typename Adapter>
+void VisitMulHigh(InstructionSelectorT<Adapter>* selector,
+                  typename Adapter::node_t node, ArchOpcode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(selector);
+    InstructionOperand temps[] = {g.TempRegister(eax)};
+    selector->Emit(
+        opcode, g.DefineAsFixed(node, edx), g.UseFixed(node->InputAt(0), eax),
+        g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
+  }
 }
 
-void VisitDiv(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
-  InstructionOperand temps[] = {g.TempRegister(edx)};
-  selector->Emit(opcode, g.DefineAsFixed(node, eax),
-                 g.UseFixed(node->InputAt(0), eax),
-                 g.UseUnique(node->InputAt(1)), arraysize(temps), temps);
+template <typename Adapter>
+void VisitDiv(InstructionSelectorT<Adapter>* selector,
+              typename Adapter::node_t node, ArchOpcode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(selector);
+    InstructionOperand temps[] = {g.TempRegister(edx)};
+    selector->Emit(opcode, g.DefineAsFixed(node, eax),
+                   g.UseFixed(node->InputAt(0), eax),
+                   g.UseUnique(node->InputAt(1)), arraysize(temps), temps);
+  }
 }
 
-void VisitMod(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
-  InstructionOperand temps[] = {g.TempRegister(eax)};
-  selector->Emit(opcode, g.DefineAsFixed(node, edx),
-                 g.UseFixed(node->InputAt(0), eax),
-                 g.UseUnique(node->InputAt(1)), arraysize(temps), temps);
+template <typename Adapter>
+void VisitMod(InstructionSelectorT<Adapter>* selector,
+              typename Adapter::node_t node, ArchOpcode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(selector);
+    InstructionOperand temps[] = {g.TempRegister(eax)};
+    selector->Emit(opcode, g.DefineAsFixed(node, edx),
+                   g.UseFixed(node->InputAt(0), eax),
+                   g.UseUnique(node->InputAt(1)), arraysize(temps), temps);
+  }
 }
 
-void EmitLea(InstructionSelector* selector, Node* result, Node* index,
+template <typename Adapter>
+void EmitLea(InstructionSelectorT<Adapter>* selector, Node* result, Node* index,
              int scale, Node* base, Node* displacement,
              DisplacementMode displacement_mode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand inputs[4];
   size_t input_count = 0;
   AddressingMode mode =
@@ -1005,27 +1145,41 @@ void EmitLea(InstructionSelector* selector, Node* result, Node* index,
 
 }  // namespace
 
-void InstructionSelector::VisitWord32Shl(Node* node) {
-  Int32ScaleMatcher m(node, true);
-  if (m.matches()) {
-    Node* index = node->InputAt(0);
-    Node* base = m.power_of_two_plus_one() ? index : nullptr;
-    EmitLea(this, node, index, m.scale(), base, nullptr, kPositiveDisplacement);
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32ScaleMatcher m(node, true);
+    if (m.matches()) {
+      Node* index = node->InputAt(0);
+      Node* base = m.power_of_two_plus_one() ? index : nullptr;
+      EmitLea(this, node, index, m.scale(), base, nullptr,
+              kPositiveDisplacement);
+      return;
+    }
+    VisitShift(this, node, kIA32Shl);
   }
-  VisitShift(this, node, kIA32Shl);
 }
 
-void InstructionSelector::VisitWord32Shr(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shr(node_t node) {
   VisitShift(this, node, kIA32Shr);
 }
 
-void InstructionSelector::VisitWord32Sar(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Sar(node_t node) {
   VisitShift(this, node, kIA32Sar);
 }
 
-void InstructionSelector::VisitInt32PairAdd(Node* node) {
-  IA32OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32PairAdd(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32PairAdd(node_t node) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(this);
 
   Node* projection1 = NodeProperties::FindProjection(node, 1);
   if (projection1) {
@@ -1050,8 +1204,14 @@ void InstructionSelector::VisitInt32PairAdd(Node* node) {
   }
 }
 
-void InstructionSelector::VisitInt32PairSub(Node* node) {
-  IA32OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32PairSub(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32PairSub(node_t node) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(this);
 
   Node* projection1 = NodeProperties::FindProjection(node, 1);
   if (projection1) {
@@ -1076,8 +1236,14 @@ void InstructionSelector::VisitInt32PairSub(Node* node) {
   }
 }
 
-void InstructionSelector::VisitInt32PairMul(Node* node) {
-  IA32OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32PairMul(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32PairMul(node_t node) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(this);
 
   Node* projection1 = NodeProperties::FindProjection(node, 1);
   if (projection1) {
@@ -1104,9 +1270,10 @@ void InstructionSelector::VisitInt32PairMul(Node* node) {
   }
 }
 
-void VisitWord32PairShift(InstructionSelector* selector, InstructionCode opcode,
-                          Node* node) {
-  IA32OperandGenerator g(selector);
+template <typename Adapter>
+void VisitWord32PairShift(InstructionSelectorT<Adapter>* selector,
+                          InstructionCode opcode, Node* node) {
+  IA32OperandGeneratorT<Adapter> g(selector);
 
   Node* shift = node->InputAt(2);
   InstructionOperand shift_operand;
@@ -1134,56 +1301,73 @@ void VisitWord32PairShift(InstructionSelector* selector, InstructionCode opcode,
   selector->Emit(opcode, output_count, outputs, 3, inputs, temp_count, temps);
 }
 
-void InstructionSelector::VisitWord32PairShl(Node* node) {
-  VisitWord32PairShift(this, kIA32ShlPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairShl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kIA32ShlPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32PairShr(Node* node) {
-  VisitWord32PairShift(this, kIA32ShrPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairShr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kIA32ShrPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32PairSar(Node* node) {
-  VisitWord32PairShift(this, kIA32SarPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairSar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kIA32SarPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
   VisitShift(this, node, kIA32Rol);
 }
 
-void InstructionSelector::VisitWord32Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
   VisitShift(this, node, kIA32Ror);
 }
 
-#define RO_OP_LIST(V)                                        \
-  V(Word32Clz, kIA32Lzcnt)                                   \
-  V(Word32Ctz, kIA32Tzcnt)                                   \
-  V(Word32Popcnt, kIA32Popcnt)                               \
-  V(ChangeFloat32ToFloat64, kIA32Float32ToFloat64)           \
-  V(RoundInt32ToFloat32, kSSEInt32ToFloat32)                 \
+#define RO_OP_T_LIST(V)                                      \
+  V(Float32Sqrt, kIA32Float32Sqrt)                           \
+  V(Float64Sqrt, kIA32Float64Sqrt)                           \
   V(ChangeInt32ToFloat64, kSSEInt32ToFloat64)                \
   V(TruncateFloat32ToInt32, kIA32Float32ToInt32)             \
-  V(ChangeFloat64ToInt32, kIA32Float64ToInt32)               \
   V(TruncateFloat64ToFloat32, kIA32Float64ToFloat32)         \
-  V(RoundFloat64ToInt32, kIA32Float64ToInt32)                \
   V(BitcastFloat32ToInt32, kIA32BitcastFI)                   \
   V(BitcastInt32ToFloat32, kIA32BitcastIF)                   \
-  V(Float32Sqrt, kIA32Float32Sqrt)                           \
-  V(Float64Sqrt, kIA32Float64Sqrt)                           \
   V(Float64ExtractLowWord32, kIA32Float64ExtractLowWord32)   \
   V(Float64ExtractHighWord32, kIA32Float64ExtractHighWord32) \
+  V(ChangeFloat64ToInt32, kIA32Float64ToInt32)               \
+  V(ChangeFloat32ToFloat64, kIA32Float32ToFloat64)           \
+  V(RoundInt32ToFloat32, kSSEInt32ToFloat32)                 \
+  V(RoundFloat64ToInt32, kIA32Float64ToInt32)                \
+  V(Word32Clz, kIA32Lzcnt)                                   \
+  V(Word32Ctz, kIA32Tzcnt)                                   \
+  V(Word32Popcnt, kIA32Popcnt)                               \
   V(SignExtendWord8ToInt32, kIA32Movsxbl)                    \
-  V(SignExtendWord16ToInt32, kIA32Movsxwl)                   \
-  V(F64x2Sqrt, kIA32F64x2Sqrt)
+  V(SignExtendWord16ToInt32, kIA32Movsxwl)
 
-#define RO_WITH_TEMP_OP_LIST(V) V(ChangeUint32ToFloat64, kIA32Uint32ToFloat64)
+#define RO_OP_LIST(V) V(F64x2Sqrt, kIA32F64x2Sqrt)
 
-#define RO_WITH_TEMP_SIMD_OP_LIST(V)               \
+#define RO_WITH_TEMP_OP_T_LIST(V) V(ChangeUint32ToFloat64, kIA32Uint32ToFloat64)
+
+#define RO_WITH_TEMP_SIMD_OP_T_LIST(V)             \
+  V(TruncateFloat64ToUint32, kIA32Float64ToUint32) \
   V(TruncateFloat32ToUint32, kIA32Float32ToUint32) \
-  V(ChangeFloat64ToUint32, kIA32Float64ToUint32)   \
-  V(TruncateFloat64ToUint32, kIA32Float64ToUint32)
+  V(ChangeFloat64ToUint32, kIA32Float64ToUint32)
 
-#define RR_OP_LIST(V)                                                          \
-  V(TruncateFloat64ToWord32, kArchTruncateDoubleToI)                           \
+#define RR_OP_T_LIST(V)                                                        \
   V(Float32RoundDown, kIA32Float32Round | MiscField::encode(kRoundDown))       \
   V(Float64RoundDown, kIA32Float64Round | MiscField::encode(kRoundDown))       \
   V(Float32RoundUp, kIA32Float32Round | MiscField::encode(kRoundUp))           \
@@ -1194,24 +1378,29 @@ void InstructionSelector::VisitWord32Ror(Node* node) {
     kIA32Float32Round | MiscField::encode(kRoundToNearest))                    \
   V(Float64RoundTiesEven,                                                      \
     kIA32Float64Round | MiscField::encode(kRoundToNearest))                    \
-  V(F32x4Ceil, kIA32F32x4Round | MiscField::encode(kRoundUp))                  \
-  V(F32x4Floor, kIA32F32x4Round | MiscField::encode(kRoundDown))               \
-  V(F32x4Trunc, kIA32F32x4Round | MiscField::encode(kRoundToZero))             \
-  V(F32x4NearestInt, kIA32F32x4Round | MiscField::encode(kRoundToNearest))     \
-  V(F64x2Ceil, kIA32F64x2Round | MiscField::encode(kRoundUp))                  \
-  V(F64x2Floor, kIA32F64x2Round | MiscField::encode(kRoundDown))               \
-  V(F64x2Trunc, kIA32F64x2Round | MiscField::encode(kRoundToZero))             \
+  V(TruncateFloat64ToWord32, kArchTruncateDoubleToI)
+
+#define RR_OP_LIST(V)                                                      \
+  V(F32x4Ceil, kIA32F32x4Round | MiscField::encode(kRoundUp))              \
+  V(F32x4Floor, kIA32F32x4Round | MiscField::encode(kRoundDown))           \
+  V(F32x4Trunc, kIA32F32x4Round | MiscField::encode(kRoundToZero))         \
+  V(F32x4NearestInt, kIA32F32x4Round | MiscField::encode(kRoundToNearest)) \
+  V(F64x2Ceil, kIA32F64x2Round | MiscField::encode(kRoundUp))              \
+  V(F64x2Floor, kIA32F64x2Round | MiscField::encode(kRoundDown))           \
+  V(F64x2Trunc, kIA32F64x2Round | MiscField::encode(kRoundToZero))         \
   V(F64x2NearestInt, kIA32F64x2Round | MiscField::encode(kRoundToNearest))
 
+#define RRO_FLOAT_OP_T_LIST(V) \
+  V(Float32Add, kFloat32Add)   \
+  V(Float64Add, kFloat64Add)   \
+  V(Float32Sub, kFloat32Sub)   \
+  V(Float64Sub, kFloat64Sub)   \
+  V(Float32Mul, kFloat32Mul)   \
+  V(Float64Mul, kFloat64Mul)   \
+  V(Float32Div, kFloat32Div)   \
+  V(Float64Div, kFloat64Div)
+
 #define RRO_FLOAT_OP_LIST(V) \
-  V(Float32Add, kFloat32Add) \
-  V(Float64Add, kFloat64Add) \
-  V(Float32Sub, kFloat32Sub) \
-  V(Float64Sub, kFloat64Sub) \
-  V(Float32Mul, kFloat32Mul) \
-  V(Float64Mul, kFloat64Mul) \
-  V(Float32Div, kFloat32Div) \
-  V(Float64Div, kFloat64Div) \
   V(F64x2Add, kIA32F64x2Add) \
   V(F64x2Sub, kIA32F64x2Sub) \
   V(F64x2Mul, kIA32F64x2Mul) \
@@ -1221,79 +1410,140 @@ void InstructionSelector::VisitWord32Ror(Node* node) {
   V(F64x2Lt, kIA32F64x2Lt)   \
   V(F64x2Le, kIA32F64x2Le)
 
-#define FLOAT_UNOP_LIST(V)   \
+#define FLOAT_UNOP_T_LIST(V) \
   V(Float32Abs, kFloat32Abs) \
   V(Float64Abs, kFloat64Abs) \
   V(Float32Neg, kFloat32Neg) \
-  V(Float64Neg, kFloat64Neg) \
-  V(F32x4Abs, kFloat32Abs)   \
-  V(F32x4Neg, kFloat32Neg)   \
-  V(F64x2Abs, kFloat64Abs)   \
+  V(Float64Neg, kFloat64Neg)
+
+#define FLOAT_UNOP_LIST(V) \
+  V(F32x4Abs, kFloat32Abs) \
+  V(F32x4Neg, kFloat32Neg) \
+  V(F64x2Abs, kFloat64Abs) \
   V(F64x2Neg, kFloat64Neg)
 
-#define RO_VISITOR(Name, opcode)                      \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRO(this, node, opcode);                      \
+#define RO_VISITOR(Name, opcode)                                \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRO(this, node, opcode);                                \
   }
 RO_OP_LIST(RO_VISITOR)
 #undef RO_VISITOR
 #undef RO_OP_LIST
 
-#define RO_WITH_TEMP_VISITOR(Name, opcode)            \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitROWithTemp(this, node, opcode);              \
+#define RO_VISITOR(Name, opcode)                                 \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRO(this, node, opcode);                                 \
+  }
+RO_OP_T_LIST(RO_VISITOR)
+#undef RO_VISITOR
+#undef RO_OP_T_LIST
+
+#define RO_WITH_TEMP_VISITOR(Name, opcode)                       \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitROWithTemp(this, node, opcode);                         \
   }
-RO_WITH_TEMP_OP_LIST(RO_WITH_TEMP_VISITOR)
+RO_WITH_TEMP_OP_T_LIST(RO_WITH_TEMP_VISITOR)
 #undef RO_WITH_TEMP_VISITOR
-#undef RO_WITH_TEMP_OP_LIST
+#undef RO_WITH_TEMP_OP_T_LIST
 
-#define RO_WITH_TEMP_SIMD_VISITOR(Name, opcode)       \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitROWithTempSimd(this, node, opcode);          \
+#define RO_WITH_TEMP_SIMD_VISITOR(Name, opcode)                  \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitROWithTempSimd(this, node, opcode);                     \
   }
-RO_WITH_TEMP_SIMD_OP_LIST(RO_WITH_TEMP_SIMD_VISITOR)
+RO_WITH_TEMP_SIMD_OP_T_LIST(RO_WITH_TEMP_SIMD_VISITOR)
 #undef RO_WITH_TEMP_SIMD_VISITOR
-#undef RO_WITH_TEMP_SIMD_OP_LIST
+#undef RO_WITH_TEMP_SIMD_OP_T_LIST
 
-#define RR_VISITOR(Name, opcode)                      \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, node, opcode);                      \
+#define RR_VISITOR(Name, opcode)                                \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRR(this, node, opcode);                                \
   }
 RR_OP_LIST(RR_VISITOR)
 #undef RR_VISITOR
 #undef RR_OP_LIST
 
-#define RRO_FLOAT_VISITOR(Name, opcode)               \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRROFloat(this, node, opcode);                \
+#define RR_VISITOR(Name, opcode)                                 \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRR(this, node, opcode);                                 \
+  }
+RR_OP_T_LIST(RR_VISITOR)
+#undef RR_VISITOR
+#undef RR_OP_T_LIST
+
+#define RRO_FLOAT_VISITOR(Name, opcode)                         \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRROFloat(this, node, opcode);                          \
   }
 RRO_FLOAT_OP_LIST(RRO_FLOAT_VISITOR)
 #undef RRO_FLOAT_VISITOR
 #undef RRO_FLOAT_OP_LIST
 
-#define FLOAT_UNOP_VISITOR(Name, opcode)                  \
-  void InstructionSelector::Visit##Name(Node* node) {     \
-    VisitFloatUnop(this, node, node->InputAt(0), opcode); \
+#define RRO_FLOAT_VISITOR(Name, opcode)                          \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRROFloat(this, node, opcode);                           \
+  }
+RRO_FLOAT_OP_T_LIST(RRO_FLOAT_VISITOR)
+#undef RRO_FLOAT_VISITOR
+#undef RRO_FLOAT_OP_T_LIST
+
+#define FLOAT_UNOP_VISITOR(Name, opcode)                        \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitFloatUnop(this, node, node->InputAt(0), opcode);       \
   }
 FLOAT_UNOP_LIST(FLOAT_UNOP_VISITOR)
 #undef FLOAT_UNOP_VISITOR
 #undef FLOAT_UNOP_LIST
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); }
+#define FLOAT_UNOP_VISITOR(Name, opcode)                         \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    DCHECK_EQ(this->value_input_count(node), 1);                 \
+    VisitFloatUnop(this, node, this->input_at(node, 0), opcode); \
+  }
+FLOAT_UNOP_T_LIST(FLOAT_UNOP_VISITOR)
+#undef FLOAT_UNOP_VISITOR
+#undef FLOAT_UNOP_T_LIST
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
-  IA32OperandGenerator g(this);
-  Emit(kIA32Bswap, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  UNREACHABLE();
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
+  IA32OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
+  Emit(kIA32Bswap, g.DefineSameAsFirst(node),
+       g.UseRegister(this->input_at(node, 0)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  IA32OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Add(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Add(Node* node) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(this);
 
   // Try to match the Add to a lea pattern
   BaseWithIndexAndDisplacement32Matcher m(node);
@@ -1320,17 +1570,28 @@ void InstructionSelector::VisitInt32Add(Node* node) {
   VisitBinop(this, node, kIA32Add);
 }
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  IA32OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.left().Is(0)) {
-    Emit(kIA32Neg, g.DefineSameAsFirst(node), g.Use(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitBinop(this, node, kIA32Sub);
+    IA32OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.left().Is(0)) {
+      Emit(kIA32Neg, g.DefineSameAsFirst(node), g.Use(m.right().node()));
+    } else {
+      VisitBinop(this, node, kIA32Sub);
+    }
   }
 }
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Mul(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Mul(Node* node) {
   Int32ScaleMatcher m(node, true);
   if (m.matches()) {
     Node* index = node->InputAt(0);
@@ -1338,7 +1599,7 @@ void InstructionSelector::VisitInt32Mul(Node* node) {
     EmitLea(this, node, index, m.scale(), base, nullptr, kPositiveDisplacement);
     return;
   }
-  IA32OperandGenerator g(this);
+  IA32OperandGeneratorT<TurbofanAdapter> g(this);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
   if (g.CanBeImmediate(right)) {
@@ -1353,196 +1614,265 @@ void InstructionSelector::VisitInt32Mul(Node* node) {
   }
 }
 
-void InstructionSelector::VisitInt32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulHigh(node_t node) {
   VisitMulHigh(this, node, kIA32ImulHigh);
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
   VisitMulHigh(this, node, kIA32UmulHigh);
 }
 
-void InstructionSelector::VisitInt32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Div(node_t node) {
   VisitDiv(this, node, kIA32Idiv);
 }
 
-void InstructionSelector::VisitUint32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Div(node_t node) {
   VisitDiv(this, node, kIA32Udiv);
 }
 
-void InstructionSelector::VisitInt32Mod(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mod(node_t node) {
   VisitMod(this, node, kIA32Idiv);
 }
 
-void InstructionSelector::VisitUint32Mod(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Mod(node_t node) {
   VisitMod(this, node, kIA32Udiv);
 }
 
-void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) {
-  IA32OperandGenerator g(this);
-  InstructionOperand temps[] = {g.TempRegister()};
-  Emit(kIA32Uint32ToFloat32, g.DefineAsRegister(node), g.Use(node->InputAt(0)),
-       arraysize(temps), temps);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    InstructionOperand temps[] = {g.TempRegister()};
+    Emit(kIA32Uint32ToFloat32, g.DefineAsRegister(node),
+         g.Use(node->InputAt(0)), arraysize(temps), temps);
+  }
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  IA32OperandGenerator g(this);
-  InstructionOperand temps[] = {g.TempRegister(eax), g.TempRegister()};
-  Emit(kIA32Float64Mod, g.DefineSameAsFirst(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
-       arraysize(temps), temps);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    InstructionOperand temps[] = {g.TempRegister(eax), g.TempRegister()};
+    Emit(kIA32Float64Mod, g.DefineSameAsFirst(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
+         arraysize(temps), temps);
+  }
 }
 
-void InstructionSelector::VisitFloat32Max(Node* node) {
-  IA32OperandGenerator g(this);
-  InstructionOperand temps[] = {g.TempRegister()};
-  Emit(kIA32Float32Max, g.DefineSameAsFirst(node),
-       g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)),
-       arraysize(temps), temps);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Max(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    InstructionOperand temps[] = {g.TempRegister()};
+    Emit(kIA32Float32Max, g.DefineSameAsFirst(node),
+         g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)),
+         arraysize(temps), temps);
+  }
 }
 
-void InstructionSelector::VisitFloat64Max(Node* node) {
-  IA32OperandGenerator g(this);
-  InstructionOperand temps[] = {g.TempRegister()};
-  Emit(kIA32Float64Max, g.DefineSameAsFirst(node),
-       g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)),
-       arraysize(temps), temps);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Max(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    InstructionOperand temps[] = {g.TempRegister()};
+    Emit(kIA32Float64Max, g.DefineSameAsFirst(node),
+         g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)),
+         arraysize(temps), temps);
+  }
 }
 
-void InstructionSelector::VisitFloat32Min(Node* node) {
-  IA32OperandGenerator g(this);
-  InstructionOperand temps[] = {g.TempRegister()};
-  Emit(kIA32Float32Min, g.DefineSameAsFirst(node),
-       g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)),
-       arraysize(temps), temps);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Min(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    InstructionOperand temps[] = {g.TempRegister()};
+    Emit(kIA32Float32Min, g.DefineSameAsFirst(node),
+         g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)),
+         arraysize(temps), temps);
+  }
 }
 
-void InstructionSelector::VisitFloat64Min(Node* node) {
-  IA32OperandGenerator g(this);
-  InstructionOperand temps[] = {g.TempRegister()};
-  Emit(kIA32Float64Min, g.DefineSameAsFirst(node),
-       g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)),
-       arraysize(temps), temps);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Min(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    InstructionOperand temps[] = {g.TempRegister()};
+    Emit(kIA32Float64Min, g.DefineSameAsFirst(node),
+         g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)),
+         arraysize(temps), temps);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesAway(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  IA32OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Binop(
+    Node* node, InstructionCode opcode) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)),
        g.UseRegister(node->InputAt(1)))
       ->MarkAsCall();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  IA32OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Unop(
+    Node* node, InstructionCode opcode) {
+  IA32OperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)))
       ->MarkAsCall();
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int index) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node, int index) {
+}
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {}
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  IA32OperandGenerator g(this);
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
 
-  // Prepare for C function call.
-  if (call_descriptor->IsCFunctionCall()) {
-    InstructionOperand temps[] = {g.TempRegister()};
-    size_t const temp_count = arraysize(temps);
-    Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
-                                         call_descriptor->ParameterCount())),
-         0, nullptr, 0, nullptr, temp_count, temps);
-
-    // Poke any stack arguments.
-    for (size_t n = 0; n < arguments->size(); ++n) {
-      PushParameter input = (*arguments)[n];
-      if (input.node) {
-        int const slot = static_cast<int>(n);
-        InstructionOperand value = g.CanBeImmediate(node)
-                                       ? g.UseImmediate(input.node)
-                                       : g.UseRegister(input.node);
-        Emit(kIA32Poke | MiscField::encode(slot), g.NoOutput(), value);
+    // Prepare for C function call.
+    if (call_descriptor->IsCFunctionCall()) {
+      InstructionOperand temps[] = {g.TempRegister()};
+      size_t const temp_count = arraysize(temps);
+      Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
+                                           call_descriptor->ParameterCount())),
+           0, nullptr, 0, nullptr, temp_count, temps);
+
+      // Poke any stack arguments.
+      for (size_t n = 0; n < arguments->size(); ++n) {
+        PushParameter input = (*arguments)[n];
+        if (input.node) {
+          int const slot = static_cast<int>(n);
+          InstructionOperand value = g.CanBeImmediate(node)
+                                         ? g.UseImmediate(input.node)
+                                         : g.UseRegister(input.node);
+          Emit(kIA32Poke | MiscField::encode(slot), g.NoOutput(), value);
+        }
       }
-    }
-  } else {
-    // Push any stack arguments.
-    int effect_level = GetEffectLevel(node);
-    int stack_decrement = 0;
-    for (PushParameter input : base::Reversed(*arguments)) {
-      stack_decrement += kSystemPointerSize;
-      // Skip holes in the param array. These represent both extra slots for
-      // multi-slot values and padding slots for alignment.
-      if (input.node == nullptr) continue;
-      InstructionOperand decrement = g.UseImmediate(stack_decrement);
-      stack_decrement = 0;
-      if (g.CanBeImmediate(input.node)) {
-        Emit(kIA32Push, g.NoOutput(), decrement, g.UseImmediate(input.node));
-      } else if (IsSupported(INTEL_ATOM) ||
-                 sequence()->IsFP(GetVirtualRegister(input.node))) {
-        // TODO(bbudge): IA32Push cannot handle stack->stack double moves
-        // because there is no way to encode fixed double slots.
-        Emit(kIA32Push, g.NoOutput(), decrement, g.UseRegister(input.node));
-      } else if (g.CanBeMemoryOperand(kIA32Push, node, input.node,
-                                      effect_level)) {
-        InstructionOperand outputs[1];
-        InstructionOperand inputs[5];
-        size_t input_count = 0;
-        inputs[input_count++] = decrement;
-        AddressingMode mode = g.GetEffectiveAddressMemoryOperand(
-            input.node, inputs, &input_count);
-        InstructionCode opcode = kIA32Push | AddressingModeField::encode(mode);
-        Emit(opcode, 0, outputs, input_count, inputs);
-      } else {
-        Emit(kIA32Push, g.NoOutput(), decrement, g.UseAny(input.node));
+    } else {
+      // Push any stack arguments.
+      int effect_level = GetEffectLevel(node);
+      int stack_decrement = 0;
+      for (PushParameter input : base::Reversed(*arguments)) {
+        stack_decrement += kSystemPointerSize;
+        // Skip holes in the param array. These represent both extra slots for
+        // multi-slot values and padding slots for alignment.
+        if (input.node == nullptr) continue;
+        InstructionOperand decrement = g.UseImmediate(stack_decrement);
+        stack_decrement = 0;
+        if (g.CanBeImmediate(input.node)) {
+          Emit(kIA32Push, g.NoOutput(), decrement, g.UseImmediate(input.node));
+        } else if (IsSupported(INTEL_ATOM) ||
+                   sequence()->IsFP(GetVirtualRegister(input.node))) {
+          // TODO(bbudge): IA32Push cannot handle stack->stack double moves
+          // because there is no way to encode fixed double slots.
+          Emit(kIA32Push, g.NoOutput(), decrement, g.UseRegister(input.node));
+        } else if (g.CanBeMemoryOperand(kIA32Push, node, input.node,
+                                        effect_level)) {
+          InstructionOperand outputs[1];
+          InstructionOperand inputs[5];
+          size_t input_count = 0;
+          inputs[input_count++] = decrement;
+          AddressingMode mode = g.GetEffectiveAddressMemoryOperand(
+              input.node, inputs, &input_count);
+          InstructionCode opcode =
+              kIA32Push | AddressingModeField::encode(mode);
+          Emit(opcode, 0, outputs, input_count, inputs);
+        } else {
+          Emit(kIA32Push, g.NoOutput(), decrement, g.UseAny(input.node));
+        }
       }
     }
   }
 }
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  IA32OperandGenerator g(this);
-
-  for (PushParameter output : *results) {
-    if (!output.location.IsCallerFrameSlot()) continue;
-    // Skip any alignment holes in nodes.
-    if (output.node != nullptr) {
-      DCHECK(!call_descriptor->IsCFunctionCall());
-      if (output.location.GetType() == MachineType::Float32()) {
-        MarkAsFloat32(output.node);
-      } else if (output.location.GetType() == MachineType::Float64()) {
-        MarkAsFloat64(output.node);
-      } else if (output.location.GetType() == MachineType::Simd128()) {
-        MarkAsSimd128(output.node);
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+
+    for (PushParameter output : *results) {
+      if (!output.location.IsCallerFrameSlot()) continue;
+      // Skip any alignment holes in nodes.
+      if (output.node != nullptr) {
+        DCHECK(!call_descriptor->IsCFunctionCall());
+        if (output.location.GetType() == MachineType::Float32()) {
+          MarkAsFloat32(output.node);
+        } else if (output.location.GetType() == MachineType::Float64()) {
+          MarkAsFloat64(output.node);
+        } else if (output.location.GetType() == MachineType::Simd128()) {
+          MarkAsSimd128(output.node);
+        }
+        int offset = call_descriptor->GetOffsetToReturns();
+        int reverse_slot = -output.location.GetLocation() - offset;
+        Emit(kIA32Peek, g.DefineAsRegister(output.node),
+             g.UseImmediate(reverse_slot));
       }
-      int offset = call_descriptor->GetOffsetToReturns();
-      int reverse_slot = -output.location.GetLocation() - offset;
-      Emit(kIA32Peek, g.DefineAsRegister(output.node),
-           g.UseImmediate(reverse_slot));
     }
   }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return true; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return true;
+}
 
 namespace {
 
-void VisitCompareWithMemoryOperand(InstructionSelector* selector,
+template <typename Adapter>
+void VisitCompareWithMemoryOperand(InstructionSelectorT<Adapter>* selector,
                                    InstructionCode opcode, Node* left,
                                    InstructionOperand right,
-                                   FlagsContinuation* cont) {
+                                   FlagsContinuationT<Adapter>* cont) {
   DCHECK(left->opcode() == IrOpcode::kLoad ||
          left->opcode() == IrOpcode::kLoadImmutable);
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   size_t input_count = 0;
   InstructionOperand inputs[4];
   AddressingMode addressing_mode =
@@ -1554,17 +1884,20 @@ void VisitCompareWithMemoryOperand(InstructionSelector* selector,
 }
 
 // Shared routine for multiple compare operations.
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  InstructionOperand left, InstructionOperand right,
-                  FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, InstructionOperand left,
+                  InstructionOperand right, FlagsContinuationT<Adapter>* cont) {
   selector->EmitWithContinuation(opcode, left, right, cont);
 }
 
 // Shared routine for multiple compare operations.
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  Node* left, Node* right, FlagsContinuation* cont,
-                  bool commutative) {
-  IA32OperandGenerator g(selector);
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, typename Adapter::node_t left,
+                  typename Adapter::node_t right,
+                  FlagsContinuationT<Adapter>* cont, bool commutative) {
+  IA32OperandGeneratorT<Adapter> g(selector);
   if (commutative && g.CanBeBetterLeftOperand(right)) {
     std::swap(left, right);
   }
@@ -1615,8 +1948,10 @@ MachineType MachineTypeForNarrow(Node* node, Node* hint_node) {
 
 // Tries to match the size of the given opcode to that of the operands, if
 // possible.
+template <typename Adapter>
 InstructionCode TryNarrowOpcodeSize(InstructionCode opcode, Node* left,
-                                    Node* right, FlagsContinuation* cont) {
+                                    Node* right,
+                                    FlagsContinuationT<Adapter>* cont) {
   // TODO(epertoso): we can probably get some size information out of phi nodes.
   // If the load representations don't match, both operands will be
   // zero/sign-extended to 32bit.
@@ -1656,75 +1991,88 @@ InstructionCode TryNarrowOpcodeSize(InstructionCode opcode, Node* left,
 }
 
 // Shared routine for multiple float32 compare operations (inputs commuted).
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Node* const left = node->InputAt(0);
-  Node* const right = node->InputAt(1);
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
   VisitCompare(selector, kIA32Float32Cmp, right, left, cont, false);
 }
 
 // Shared routine for multiple float64 compare operations (inputs commuted).
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Node* const left = node->InputAt(0);
-  Node* const right = node->InputAt(1);
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
   VisitCompare(selector, kIA32Float64Cmp, right, left, cont, false);
 }
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont) {
-  IA32OperandGenerator g(selector);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node, InstructionCode opcode,
+                      FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<TurbofanAdapter> g(selector);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
 
-  InstructionCode narrowed_opcode =
-      TryNarrowOpcodeSize(opcode, left, right, cont);
+    InstructionCode narrowed_opcode =
+        TryNarrowOpcodeSize(opcode, left, right, cont);
 
-  int effect_level = selector->GetEffectLevel(node, cont);
+    int effect_level = selector->GetEffectLevel(node, cont);
 
-  // If one of the two inputs is an immediate, make sure it's on the right, or
-  // if one of the two inputs is a memory operand, make sure it's on the left.
-  if ((!g.CanBeImmediate(right) && g.CanBeImmediate(left)) ||
-      (g.CanBeMemoryOperand(narrowed_opcode, node, right, effect_level) &&
-       !g.CanBeMemoryOperand(narrowed_opcode, node, left, effect_level))) {
-    if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute();
-    std::swap(left, right);
-  }
+    // If one of the two inputs is an immediate, make sure it's on the right, or
+    // if one of the two inputs is a memory operand, make sure it's on the left.
+    if ((!g.CanBeImmediate(right) && g.CanBeImmediate(left)) ||
+        (g.CanBeMemoryOperand(narrowed_opcode, node, right, effect_level) &&
+         !g.CanBeMemoryOperand(narrowed_opcode, node, left, effect_level))) {
+      if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute();
+      std::swap(left, right);
+    }
 
-  // Match immediates on right side of comparison.
-  if (g.CanBeImmediate(right)) {
+    // Match immediates on right side of comparison.
+    if (g.CanBeImmediate(right)) {
+      if (g.CanBeMemoryOperand(narrowed_opcode, node, left, effect_level)) {
+        return VisitCompareWithMemoryOperand(selector, narrowed_opcode, left,
+                                             g.UseImmediate(right), cont);
+      }
+      return VisitCompare(selector, opcode, g.Use(left), g.UseImmediate(right),
+                          cont);
+    }
+
+    // Match memory operands on left side of comparison.
     if (g.CanBeMemoryOperand(narrowed_opcode, node, left, effect_level)) {
-      return VisitCompareWithMemoryOperand(selector, narrowed_opcode, left,
-                                           g.UseImmediate(right), cont);
+      bool needs_byte_register =
+          narrowed_opcode == kIA32Test8 || narrowed_opcode == kIA32Cmp8;
+      return VisitCompareWithMemoryOperand(
+          selector, narrowed_opcode, left,
+          needs_byte_register ? g.UseByteRegister(right) : g.UseRegister(right),
+          cont);
     }
-    return VisitCompare(selector, opcode, g.Use(left), g.UseImmediate(right),
-                        cont);
-  }
 
-  // Match memory operands on left side of comparison.
-  if (g.CanBeMemoryOperand(narrowed_opcode, node, left, effect_level)) {
-    bool needs_byte_register =
-        narrowed_opcode == kIA32Test8 || narrowed_opcode == kIA32Cmp8;
-    return VisitCompareWithMemoryOperand(
-        selector, narrowed_opcode, left,
-        needs_byte_register ? g.UseByteRegister(right) : g.UseRegister(right),
-        cont);
+    return VisitCompare(selector, opcode, left, right, cont,
+                        node->op()->HasProperty(Operator::kCommutative));
   }
-
-  return VisitCompare(selector, opcode, left, right, cont,
-                      node->op()->HasProperty(Operator::kCommutative));
 }
 
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node,
+                      FlagsContinuationT<Adapter>* cont) {
   VisitWordCompare(selector, node, kIA32Cmp, cont);
 }
 
-void VisitAtomicBinOp(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicBinOp(InstructionSelectorT<Adapter>* selector, Node* node,
                       ArchOpcode opcode, MachineRepresentation rep) {
   AddressingMode addressing_mode;
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -1740,9 +2088,10 @@ void VisitAtomicBinOp(InstructionSelector* selector, Node* node,
                  arraysize(temp), temp);
 }
 
-void VisitPairAtomicBinOp(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitPairAtomicBinOp(InstructionSelectorT<Adapter>* selector, Node* node,
                           ArchOpcode opcode) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -1781,262 +2130,332 @@ void VisitPairAtomicBinOp(InstructionSelector* selector, Node* node,
 }  // namespace
 
 // Shared routine for word comparison with zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
-    Int32BinopMatcher m(value);
-    if (!m.right().Is(0)) break;
-
-    user = value;
-    value = m.left().node();
-    cont->Negate();
-  }
-
-  if (CanCover(user, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kFloat32Equal:
-        cont->OverwriteAndNegateIfEqual(kUnorderedEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat64Equal:
-        cont->OverwriteAndNegateIfEqual(kUnorderedEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kProjection:
-        // Check if this is the overflow output projection of an
-        // <Operation>WithOverflow node.
-        if (ProjectionIndexOf(value->op()) == 1u) {
-          // We cannot combine the <Operation>WithOverflow with this branch
-          // unless the 0th projection (the use of the actual value of the
-          // <Operation> is either nullptr, which means there's no use of the
-          // actual value, or was already defined, which means it is scheduled
-          // *AFTER* this branch).
-          Node* const node = value->InputAt(0);
-          Node* const result = NodeProperties::FindProjection(node, 0);
-          if (result == nullptr || IsDefined(result)) {
-            switch (node->opcode()) {
-              case IrOpcode::kInt32AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kIA32Add, cont);
-              case IrOpcode::kInt32SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kIA32Sub, cont);
-              case IrOpcode::kInt32MulWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kIA32Imul, cont);
-              default:
-                break;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuation* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
+      Int32BinopMatcher m(value);
+      if (!m.right().Is(0)) break;
+
+      user = value;
+      value = m.left().node();
+      cont->Negate();
+    }
+
+    if (CanCover(user, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kFloat32Equal:
+          cont->OverwriteAndNegateIfEqual(kUnorderedEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat64Equal:
+          cont->OverwriteAndNegateIfEqual(kUnorderedEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kProjection:
+          // Check if this is the overflow output projection of an
+          // <Operation>WithOverflow node.
+          if (ProjectionIndexOf(value->op()) == 1u) {
+            // We cannot combine the <Operation>WithOverflow with this branch
+            // unless the 0th projection (the use of the actual value of the
+            // <Operation> is either nullptr, which means there's no use of the
+            // actual value, or was already defined, which means it is scheduled
+            // *AFTER* this branch).
+            Node* const node = value->InputAt(0);
+            Node* const result = NodeProperties::FindProjection(node, 0);
+            if (result == nullptr || IsDefined(result)) {
+              switch (node->opcode()) {
+                case IrOpcode::kInt32AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kIA32Add, cont);
+                case IrOpcode::kInt32SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kIA32Sub, cont);
+                case IrOpcode::kInt32MulWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kIA32Imul, cont);
+                default:
+                  break;
+              }
             }
           }
-        }
-        break;
-      case IrOpcode::kInt32Sub:
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kWord32And:
-        return VisitWordCompare(this, value, kIA32Test, cont);
-      case IrOpcode::kStackPointerGreaterThan:
-        cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
-        return VisitStackPointerGreaterThan(value, cont);
-      default:
-        break;
+          break;
+        case IrOpcode::kInt32Sub:
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kWord32And:
+          return VisitWordCompare(this, value, kIA32Test, cont);
+        case IrOpcode::kStackPointerGreaterThan:
+          cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
+          return VisitStackPointerGreaterThan(value, cont);
+        default:
+          break;
+      }
     }
+
+    // Continuation could not be combined with a compare, emit compare against
+    // 0.
+    IA32OperandGeneratorT<Adapter> g(this);
+    VisitCompare(this, kIA32Cmp, g.Use(value), g.TempImmediate(0), cont);
   }
+}
 
-  // Continuation could not be combined with a compare, emit compare against 0.
-  IA32OperandGenerator g(this);
-  VisitCompare(this, kIA32Cmp, g.Use(value), g.TempImmediate(0), cont);
-}
-
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  IA32OperandGenerator g(this);
-  InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
-
-  // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
-    static const size_t kMaxTableSwitchValueRange = 2 << 16;
-    size_t table_space_cost = 4 + sw.value_range();
-    size_t table_time_cost = 3;
-    size_t lookup_space_cost = 3 + 2 * sw.case_count();
-    size_t lookup_time_cost = sw.case_count();
-    if (sw.case_count() > 4 &&
-        table_space_cost + 3 * table_time_cost <=
-            lookup_space_cost + 3 * lookup_time_cost &&
-        sw.min_value() > std::numeric_limits<int32_t>::min() &&
-        sw.value_range() <= kMaxTableSwitchValueRange) {
-      InstructionOperand index_operand = value_operand;
-      if (sw.min_value()) {
-        index_operand = g.TempRegister();
-        Emit(kIA32Lea | AddressingModeField::encode(kMode_MRI), index_operand,
-             value_operand, g.TempImmediate(-sw.min_value()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
+
+    // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
+    if (enable_switch_jump_table_ ==
+        InstructionSelector::kEnableSwitchJumpTable) {
+      static const size_t kMaxTableSwitchValueRange = 2 << 16;
+      size_t table_space_cost = 4 + sw.value_range();
+      size_t table_time_cost = 3;
+      size_t lookup_space_cost = 3 + 2 * sw.case_count();
+      size_t lookup_time_cost = sw.case_count();
+      if (sw.case_count() > 4 &&
+          table_space_cost + 3 * table_time_cost <=
+              lookup_space_cost + 3 * lookup_time_cost &&
+          sw.min_value() > std::numeric_limits<int32_t>::min() &&
+          sw.value_range() <= kMaxTableSwitchValueRange) {
+        InstructionOperand index_operand = value_operand;
+        if (sw.min_value()) {
+          index_operand = g.TempRegister();
+          Emit(kIA32Lea | AddressingModeField::encode(kMode_MRI), index_operand,
+               value_operand, g.TempImmediate(-sw.min_value()));
+        }
+        // Generate a table lookup.
+        return EmitTableSwitch(sw, index_operand);
       }
-      // Generate a table lookup.
-      return EmitTableSwitch(sw, index_operand);
     }
-  }
 
-  // Generate a tree of conditional jumps.
-  return EmitBinarySearchSwitch(sw, value_operand);
+    // Generate a tree of conditional jumps.
+    return EmitBinarySearchSwitch(sw, value_operand);
+  }
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(0)) {
-    return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    if (m.right().Is(0)) {
+      return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+    }
   }
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kIA32Add, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kIA32Add, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kIA32Add, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kIA32Add, &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kIA32Sub, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kIA32Sub, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kIA32Sub, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kIA32Sub, &cont);
 }
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kIA32Imul, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kIA32Imul, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kIA32Imul, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kIA32Imul, &cont);
 }
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnorderedEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedGreaterThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedGreaterThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnorderedEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedGreaterThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedGreaterThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
-  IA32OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Float64Matcher mleft(left);
-  if (mleft.HasResolvedValue() &&
-      (base::bit_cast<uint64_t>(mleft.ResolvedValue()) >> 32) == 0u) {
-    Emit(kIA32Float64LoadLowWord32, g.DefineAsRegister(node), g.Use(right));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    Float64Matcher mleft(left);
+    if (mleft.HasResolvedValue() &&
+        (base::bit_cast<uint64_t>(mleft.ResolvedValue()) >> 32) == 0u) {
+      Emit(kIA32Float64LoadLowWord32, g.DefineAsRegister(node), g.Use(right));
+      return;
+    }
+    Emit(kIA32Float64InsertLowWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.Use(right));
   }
-  Emit(kIA32Float64InsertLowWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.Use(right));
 }
 
-void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
-  IA32OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Emit(kIA32Float64InsertHighWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.Use(right));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    Emit(kIA32Float64InsertHighWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.Use(right));
+  }
 }
 
-void InstructionSelector::VisitFloat64SilenceNaN(Node* node) {
-  IA32OperandGenerator g(this);
-  Emit(kIA32Float64SilenceNaN, g.DefineSameAsFirst(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32PairToFloat64(
+    node_t node) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
-  // ia32 is no weaker than release-acquire and only needs to emit an
-  // instruction for SeqCst memory barriers.
-  AtomicMemoryOrder order = OpParameter<AtomicMemoryOrder>(node->op());
-  if (order == AtomicMemoryOrder::kSeqCst) {
-    IA32OperandGenerator g(this);
-    Emit(kIA32MFence, g.NoOutput());
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64SilenceNaN(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    IA32OperandGeneratorT<Adapter> g(this);
+    Emit(kIA32Float64SilenceNaN, g.DefineSameAsFirst(node),
+         g.UseRegister(node->InputAt(0)));
   }
-  DCHECK_EQ(AtomicMemoryOrder::kAcqRel, order);
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // ia32 is no weaker than release-acquire and only needs to emit an
+    // instruction for SeqCst memory barriers.
+    AtomicMemoryOrder order = OpParameter<AtomicMemoryOrder>(node->op());
+    if (order == AtomicMemoryOrder::kSeqCst) {
+      IA32OperandGeneratorT<Adapter> g(this);
+      Emit(kIA32MFence, g.NoOutput());
+      return;
+    }
+    DCHECK_EQ(AtomicMemoryOrder::kAcqRel, order);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
   AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
   LoadRepresentation load_rep = atomic_load_params.representation();
   DCHECK(load_rep.representation() == MachineRepresentation::kWord8 ||
@@ -2052,14 +2471,20 @@ void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
   VisitLoad(node, node, GetLoadOpcode(load_rep));
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
-  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
-  VisitStoreCommon(this, node, store_params.store_representation(),
-                   store_params.order());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
+    VisitStoreCommon(this, node, store_params.store_representation(),
+                     store_params.order());
+  }
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   MachineType type = AtomicOpType(node->op());
   ArchOpcode opcode;
   if (type == MachineType::Int8()) {
@@ -2078,8 +2503,10 @@ void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, type.representation());
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -2113,32 +2540,38 @@ void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
   Emit(code, 1, outputs, arraysize(inputs), inputs);
 }
 
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
-    Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
-  MachineType type = AtomicOpType(node->op());
-  ArchOpcode opcode;
-  if (type == MachineType::Int8()) {
-    opcode = int8_op;
-  } else if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Int16()) {
-    opcode = int16_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = word32_op;
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    MachineType type = AtomicOpType(node->op());
+    ArchOpcode opcode;
+    if (type == MachineType::Int8()) {
+      opcode = int8_op;
+    } else if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Int16()) {
+      opcode = int16_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = word32_op;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicBinOp(this, node, opcode, type.representation());
   }
-  VisitAtomicBinOp(this, node, opcode, type.representation());
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                            \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) { \
+    VisitWord32AtomicBinaryOperation(                                     \
+        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16,  \
+        kAtomic##op##Uint16, kAtomic##op##Word32);                        \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -2147,10 +2580,11 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitWord32AtomicPairLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairLoad(Node* node) {
   // Both acquire and sequentially consistent loads can emit MOV.
   // https://www.cl.cam.ac.uk/~pes20/cpp/cpp0xmappings.html
-  IA32OperandGenerator g(this);
+  IA32OperandGeneratorT<Adapter> g(this);
   AddressingMode mode;
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
@@ -2183,12 +2617,13 @@ void InstructionSelector::VisitWord32AtomicPairLoad(Node* node) {
   }
 }
 
-void InstructionSelector::VisitWord32AtomicPairStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairStore(Node* node) {
   // Release pair stores emit a MOVQ via a double register, and sequentially
   // consistent stores emit CMPXCHG8B.
   // https://www.cl.cam.ac.uk/~pes20/cpp/cpp0xmappings.html
 
-  IA32OperandGenerator g(this);
+  IA32OperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2225,32 +2660,40 @@ void InstructionSelector::VisitWord32AtomicPairStore(Node* node) {
   }
 }
 
-void InstructionSelector::VisitWord32AtomicPairAdd(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairAdd(Node* node) {
   VisitPairAtomicBinOp(this, node, kIA32Word32AtomicPairAdd);
 }
 
-void InstructionSelector::VisitWord32AtomicPairSub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairSub(Node* node) {
   VisitPairAtomicBinOp(this, node, kIA32Word32AtomicPairSub);
 }
 
-void InstructionSelector::VisitWord32AtomicPairAnd(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairAnd(Node* node) {
   VisitPairAtomicBinOp(this, node, kIA32Word32AtomicPairAnd);
 }
 
-void InstructionSelector::VisitWord32AtomicPairOr(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairOr(Node* node) {
   VisitPairAtomicBinOp(this, node, kIA32Word32AtomicPairOr);
 }
 
-void InstructionSelector::VisitWord32AtomicPairXor(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairXor(Node* node) {
   VisitPairAtomicBinOp(this, node, kIA32Word32AtomicPairXor);
 }
 
-void InstructionSelector::VisitWord32AtomicPairExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairExchange(Node* node) {
   VisitPairAtomicBinOp(this, node, kIA32Word32AtomicPairExchange);
 }
 
-void InstructionSelector::VisitWord32AtomicPairCompareExchange(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairCompareExchange(
+    Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   Node* index = node->InputAt(1);
   AddressingMode addressing_mode;
 
@@ -2427,8 +2870,9 @@ void InstructionSelector::VisitWord32AtomicPairCompareExchange(Node* node) {
   V(I16x8ShrS)                               \
   V(I16x8ShrU)
 
-void InstructionSelector::VisitS128Const(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   static const int kUint32Immediates = kSimd128Size / sizeof(uint32_t);
   uint32_t val[kUint32Immediates];
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
@@ -2451,8 +2895,9 @@ void InstructionSelector::VisitS128Const(Node* node) {
   }
 }
 
-void InstructionSelector::VisitF64x2Min(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Min(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   InstructionOperand operand1 = g.UseRegister(node->InputAt(1));
 
@@ -2463,8 +2908,9 @@ void InstructionSelector::VisitF64x2Min(Node* node) {
   }
 }
 
-void InstructionSelector::VisitF64x2Max(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Max(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   InstructionOperand operand1 = g.UseRegister(node->InputAt(1));
   if (IsSupported(AVX)) {
@@ -2474,16 +2920,19 @@ void InstructionSelector::VisitF64x2Max(Node* node) {
   }
 }
 
-void InstructionSelector::VisitF64x2Splat(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Splat(Node* node) {
   VisitRRSimd(this, node, kIA32F64x2Splat);
 }
 
-void InstructionSelector::VisitF64x2ExtractLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2ExtractLane(Node* node) {
   VisitRRISimd(this, node, kIA32F64x2ExtractLane, kIA32F64x2ExtractLane);
 }
 
-void InstructionSelector::VisitI64x2SplatI32Pair(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2SplatI32Pair(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   Int32Matcher match_left(node->InputAt(0));
   Int32Matcher match_right(node->InputAt(1));
   if (match_left.Is(0) && match_right.Is(0)) {
@@ -2495,8 +2944,9 @@ void InstructionSelector::VisitI64x2SplatI32Pair(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI64x2ReplaceLaneI32Pair(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ReplaceLaneI32Pair(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand operand = g.UseRegister(node->InputAt(0));
   InstructionOperand lane = g.UseImmediate(OpParameter<int32_t>(node->op()));
   InstructionOperand low = g.Use(node->InputAt(1));
@@ -2505,8 +2955,9 @@ void InstructionSelector::VisitI64x2ReplaceLaneI32Pair(Node* node) {
        low, high);
 }
 
-void InstructionSelector::VisitI64x2Neg(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Neg(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   // If AVX unsupported, make sure dst != src to avoid a move.
   InstructionOperand operand0 = IsSupported(AVX)
                                     ? g.UseRegister(node->InputAt(0))
@@ -2514,8 +2965,9 @@ void InstructionSelector::VisitI64x2Neg(Node* node) {
   Emit(kIA32I64x2Neg, g.DefineAsRegister(node), operand0);
 }
 
-void InstructionSelector::VisitI64x2ShrS(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ShrS(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
 
@@ -2529,8 +2981,9 @@ void InstructionSelector::VisitI64x2ShrS(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI64x2Mul(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Mul(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register(),
                                 g.TempSimd128Register()};
   Emit(kIA32I64x2Mul, g.DefineAsRegister(node),
@@ -2538,24 +2991,28 @@ void InstructionSelector::VisitI64x2Mul(Node* node) {
        g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitF32x4Splat(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Splat(Node* node) {
   VisitRRSimd(this, node, kIA32F32x4Splat);
 }
 
-void InstructionSelector::VisitF32x4ExtractLane(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4ExtractLane(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   InstructionOperand operand1 =
       g.UseImmediate(OpParameter<int32_t>(node->op()));
   Emit(kIA32F32x4ExtractLane, g.DefineAsRegister(node), operand0, operand1);
 }
 
-void InstructionSelector::VisitF32x4UConvertI32x4(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4UConvertI32x4(Node* node) {
   VisitRRSimd(this, node, kIA32F32x4UConvertI32x4);
 }
 
-void InstructionSelector::VisitI32x4SConvertF32x4(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4SConvertF32x4(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempRegister()};
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
@@ -2563,8 +3020,9 @@ void InstructionSelector::VisitI32x4SConvertF32x4(Node* node) {
        arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitI32x4UConvertF32x4(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4UConvertF32x4(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   InstructionCode opcode =
       IsSupported(AVX) ? kAVXI32x4UConvertF32x4 : kSSEI32x4UConvertF32x4;
@@ -2572,21 +3030,24 @@ void InstructionSelector::VisitI32x4UConvertF32x4(Node* node) {
        arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   Emit(kIA32S128Zero, g.DefineAsRegister(node));
 }
 
-void InstructionSelector::VisitS128Select(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
   Emit(kIA32S128Select, dst, g.UseRegister(node->InputAt(0)),
        g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2)));
 }
 
-void InstructionSelector::VisitS128AndNot(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128AndNot(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   // andnps a b does ~a & b, but we want a & !b, so flip the input.
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
@@ -2594,37 +3055,43 @@ void InstructionSelector::VisitS128AndNot(Node* node) {
        g.UseRegister(node->InputAt(0)));
 }
 
-#define VISIT_SIMD_SPLAT(Type)                               \
-  void InstructionSelector::Visit##Type##Splat(Node* node) { \
-    Int32Matcher int32_matcher(node->InputAt(0));            \
-    if (int32_matcher.Is(0)) {                               \
-      IA32OperandGenerator g(this);                          \
-      Emit(kIA32S128Zero, g.DefineAsRegister(node));         \
-    } else {                                                 \
-      VisitRO(this, node, kIA32##Type##Splat);               \
-    }                                                        \
+#define VISIT_SIMD_SPLAT(Type)                                         \
+  template <typename Adapter>                                          \
+  void InstructionSelectorT<Adapter>::Visit##Type##Splat(Node* node) { \
+    Int32Matcher int32_matcher(node->InputAt(0));                      \
+    if (int32_matcher.Is(0)) {                                         \
+      IA32OperandGeneratorT<Adapter> g(this);                          \
+      Emit(kIA32S128Zero, g.DefineAsRegister(node));                   \
+    } else {                                                           \
+      VisitRO(this, node, kIA32##Type##Splat);                         \
+    }                                                                  \
   }
 SIMD_INT_TYPES(VISIT_SIMD_SPLAT)
 #undef SIMD_INT_TYPES
 #undef VISIT_SIMD_SPLAT
 
-void InstructionSelector::VisitI8x16ExtractLaneU(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16ExtractLaneU(Node* node) {
   VisitRRISimd(this, node, kIA32Pextrb);
 }
 
-void InstructionSelector::VisitI8x16ExtractLaneS(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16ExtractLaneS(Node* node) {
   VisitRRISimd(this, node, kIA32I8x16ExtractLaneS);
 }
 
-void InstructionSelector::VisitI16x8ExtractLaneU(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtractLaneU(Node* node) {
   VisitRRISimd(this, node, kIA32Pextrw);
 }
 
-void InstructionSelector::VisitI16x8ExtractLaneS(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtractLaneS(Node* node) {
   VisitRRISimd(this, node, kIA32I16x8ExtractLaneS);
 }
 
-void InstructionSelector::VisitI32x4ExtractLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtractLane(Node* node) {
   VisitRRISimd(this, node, kIA32I32x4ExtractLane);
 }
 
@@ -2634,23 +3101,25 @@ void InstructionSelector::VisitI32x4ExtractLane(Node* node) {
   V(I8x16, kIA32Pinsrb)              \
   V(F32x4, kIA32Insertps)
 
-#define VISIT_SIMD_REPLACE_LANE(TYPE, OPCODE)                              \
-  void InstructionSelector::Visit##TYPE##ReplaceLane(Node* node) {         \
-    IA32OperandGenerator g(this);                                          \
-    InstructionOperand operand0 = g.UseRegister(node->InputAt(0));         \
-    InstructionOperand operand1 =                                          \
-        g.UseImmediate(OpParameter<int32_t>(node->op()));                  \
-    InstructionOperand operand2 = g.Use(node->InputAt(1));                 \
-    InstructionOperand dst = IsSupported(AVX) ? g.DefineAsRegister(node)   \
-                                              : g.DefineSameAsFirst(node); \
-    Emit(OPCODE, dst, operand0, operand1, operand2);                       \
+#define VISIT_SIMD_REPLACE_LANE(TYPE, OPCODE)                                \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##TYPE##ReplaceLane(Node* node) { \
+    IA32OperandGeneratorT<Adapter> g(this);                                  \
+    InstructionOperand operand0 = g.UseRegister(node->InputAt(0));           \
+    InstructionOperand operand1 =                                            \
+        g.UseImmediate(OpParameter<int32_t>(node->op()));                    \
+    InstructionOperand operand2 = g.Use(node->InputAt(1));                   \
+    InstructionOperand dst = IsSupported(AVX) ? g.DefineAsRegister(node)     \
+                                              : g.DefineSameAsFirst(node);   \
+    Emit(OPCODE, dst, operand0, operand1, operand2);                         \
   }
 SIMD_REPLACE_LANE_TYPE_OP(VISIT_SIMD_REPLACE_LANE)
 #undef VISIT_SIMD_REPLACE_LANE
 #undef SIMD_REPLACE_LANE_TYPE_OP
 
-void InstructionSelector::VisitF64x2ReplaceLane(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2ReplaceLane(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   int32_t lane = OpParameter<int32_t>(node->op());
   // When no-AVX, define dst == src to save a move.
   InstructionOperand dst =
@@ -2659,9 +3128,10 @@ void InstructionSelector::VisitF64x2ReplaceLane(Node* node) {
        g.UseImmediate(lane), g.UseRegister(node->InputAt(1)));
 }
 
-#define VISIT_SIMD_SHIFT_UNIFIED_SSE_AVX(Opcode)        \
-  void InstructionSelector::Visit##Opcode(Node* node) { \
-    VisitRROSimdShift(this, node, kIA32##Opcode);       \
+#define VISIT_SIMD_SHIFT_UNIFIED_SSE_AVX(Opcode)                  \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) { \
+    VisitRROSimdShift(this, node, kIA32##Opcode);                 \
   }
 SIMD_SHIFT_OPCODES_UNIFED_SSE_AVX(VISIT_SIMD_SHIFT_UNIFIED_SSE_AVX)
 #undef VISIT_SIMD_SHIFT_UNIFIED_SSE_AVX
@@ -2671,26 +3141,29 @@ SIMD_SHIFT_OPCODES_UNIFED_SSE_AVX(VISIT_SIMD_SHIFT_UNIFIED_SSE_AVX)
 // alignment yet. For AVX, memory operands are fine, but can have performance
 // issues if not aligned to 16/32 bytes (based on load size), see SDM Vol 1,
 // chapter 14.9
-#define VISIT_SIMD_UNOP(Opcode)                         \
-  void InstructionSelector::Visit##Opcode(Node* node) { \
-    IA32OperandGenerator g(this);                       \
-    Emit(kIA32##Opcode, g.DefineAsRegister(node),       \
-         g.UseRegister(node->InputAt(0)));              \
+#define VISIT_SIMD_UNOP(Opcode)                                   \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) { \
+    IA32OperandGeneratorT<Adapter> g(this);                       \
+    Emit(kIA32##Opcode, g.DefineAsRegister(node),                 \
+         g.UseRegister(node->InputAt(0)));                        \
   }
 SIMD_UNOP_LIST(VISIT_SIMD_UNOP)
 #undef VISIT_SIMD_UNOP
 #undef SIMD_UNOP_LIST
 
-void InstructionSelector::VisitV128AnyTrue(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitV128AnyTrue(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempRegister()};
   Emit(kIA32S128AnyTrue, g.DefineAsRegister(node),
        g.UseRegister(node->InputAt(0)), arraysize(temps), temps);
 }
 
 #define VISIT_SIMD_ALLTRUE(Opcode)                                            \
-  void InstructionSelector::Visit##Opcode(Node* node) {                       \
-    IA32OperandGenerator g(this);                                             \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {             \
+    IA32OperandGeneratorT<Adapter> g(this);                                   \
     InstructionOperand temps[] = {g.TempRegister(), g.TempSimd128Register()}; \
     Emit(kIA32##Opcode, g.DefineAsRegister(node),                             \
          g.UseUniqueRegister(node->InputAt(0)), arraysize(temps), temps);     \
@@ -2699,54 +3172,63 @@ SIMD_ALLTRUE_LIST(VISIT_SIMD_ALLTRUE)
 #undef VISIT_SIMD_ALLTRUE
 #undef SIMD_ALLTRUE_LIST
 
-#define VISIT_SIMD_BINOP(Opcode)                          \
-  void InstructionSelector::Visit##Opcode(Node* node) {   \
-    VisitRROSimd(this, node, kAVX##Opcode, kSSE##Opcode); \
+#define VISIT_SIMD_BINOP(Opcode)                                  \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) { \
+    VisitRROSimd(this, node, kAVX##Opcode, kSSE##Opcode);         \
   }
 SIMD_BINOP_LIST(VISIT_SIMD_BINOP)
 #undef VISIT_SIMD_BINOP
 #undef SIMD_BINOP_LIST
 
-#define VISIT_SIMD_BINOP_UNIFIED_SSE_AVX(Opcode)            \
-  void InstructionSelector::Visit##Opcode(Node* node) {     \
-    VisitRROSimd(this, node, kIA32##Opcode, kIA32##Opcode); \
+#define VISIT_SIMD_BINOP_UNIFIED_SSE_AVX(Opcode)                  \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) { \
+    VisitRROSimd(this, node, kIA32##Opcode, kIA32##Opcode);       \
   }
 SIMD_BINOP_UNIFIED_SSE_AVX_LIST(VISIT_SIMD_BINOP_UNIFIED_SSE_AVX)
 #undef VISIT_SIMD_BINOP_UNIFIED_SSE_AVX
 #undef SIMD_BINOP_UNIFIED_SSE_AVX_LIST
 
-#define VISIT_SIMD_BINOP_RRR(OPCODE)                    \
-  void InstructionSelector::Visit##OPCODE(Node* node) { \
-    VisitRRRSimd(this, node, kIA32##OPCODE);            \
+#define VISIT_SIMD_BINOP_RRR(OPCODE)                              \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE(Node* node) { \
+    VisitRRRSimd(this, node, kIA32##OPCODE);                      \
   }
 SIMD_BINOP_RRR(VISIT_SIMD_BINOP_RRR)
 #undef VISIT_SIMD_BINOP_RRR
 #undef SIMD_BINOP_RRR
 
-void InstructionSelector::VisitI16x8BitMask(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8BitMask(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kIA32I16x8BitMask, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitI8x16Shl(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shl(Node* node) {
   VisitI8x16Shift(this, node, kIA32I8x16Shl);
 }
 
-void InstructionSelector::VisitI8x16ShrS(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16ShrS(Node* node) {
   VisitI8x16Shift(this, node, kIA32I8x16ShrS);
 }
 
-void InstructionSelector::VisitI8x16ShrU(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16ShrU(Node* node) {
   VisitI8x16Shift(this, node, kIA32I8x16ShrU);
 }
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
@@ -2889,7 +3371,8 @@ bool TryMatchArchShuffle(const uint8_t* shuffle, const ShuffleEntry* table,
 
 }  // namespace
 
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
@@ -2901,7 +3384,7 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
   static const int kMaxTemps = 2;
   InstructionOperand temps[kMaxTemps];
 
-  IA32OperandGenerator g(this);
+  IA32OperandGeneratorT<Adapter> g(this);
   bool use_avx = CpuFeatures::IsSupported(AVX);
   // AVX and swizzles don't generally need DefineSameAsFirst to avoid a move.
   bool no_same_as_first = use_avx || is_swizzle;
@@ -3041,7 +3524,8 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
   Emit(opcode, 1, &dst, input_count, inputs, temp_count, temps);
 }
 
-void InstructionSelector::VisitI8x16Swizzle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
   InstructionCode op = kIA32I8x16Swizzle;
 
   bool relaxed = OpParameter<bool>(node->op());
@@ -3058,7 +3542,7 @@ void InstructionSelector::VisitI8x16Swizzle(Node* node) {
     }
   }
 
-  IA32OperandGenerator g(this);
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempRegister()};
   Emit(op,
        IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node),
@@ -3066,16 +3550,23 @@ void InstructionSelector::VisitI8x16Swizzle(Node* node) {
        arraysize(temps), temps);
 }
 #else
-void InstructionSelector::VisitI8x16Shuffle(Node* node) { UNREACHABLE(); }
-void InstructionSelector::VisitI8x16Swizzle(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
+  UNREACHABLE();
+}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
+  UNREACHABLE();
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 namespace {
-void VisitMinOrMax(InstructionSelector* selector, Node* node, ArchOpcode opcode,
-                   bool flip_inputs) {
+template <typename Adapter>
+void VisitMinOrMax(InstructionSelectorT<Adapter>* selector, Node* node,
+                   ArchOpcode opcode, bool flip_inputs) {
   // Due to the way minps/minpd work, we want the dst to be same as the second
   // input: b = pmin(a, b) directly maps to minps b a.
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand dst = selector->IsSupported(AVX)
                                ? g.DefineAsRegister(node)
                                : g.DefineSameAsFirst(node);
@@ -3091,42 +3582,51 @@ void VisitMinOrMax(InstructionSelector* selector, Node* node, ArchOpcode opcode,
 }
 }  // namespace
 
-void InstructionSelector::VisitF32x4Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmin(Node* node) {
   VisitMinOrMax(this, node, kIA32Minps, true);
 }
 
-void InstructionSelector::VisitF32x4Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmax(Node* node) {
   VisitMinOrMax(this, node, kIA32Maxps, true);
 }
 
-void InstructionSelector::VisitF64x2Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmin(Node* node) {
   VisitMinOrMax(this, node, kIA32Minpd, true);
 }
 
-void InstructionSelector::VisitF64x2Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmax(Node* node) {
   VisitMinOrMax(this, node, kIA32Maxpd, true);
 }
 
-void InstructionSelector::VisitF32x4RelaxedMin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4RelaxedMin(Node* node) {
   VisitMinOrMax(this, node, kIA32Minps, false);
 }
 
-void InstructionSelector::VisitF32x4RelaxedMax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4RelaxedMax(Node* node) {
   VisitMinOrMax(this, node, kIA32Maxps, false);
 }
 
-void InstructionSelector::VisitF64x2RelaxedMin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2RelaxedMin(Node* node) {
   VisitMinOrMax(this, node, kIA32Minpd, false);
 }
 
-void InstructionSelector::VisitF64x2RelaxedMax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2RelaxedMax(Node* node) {
   VisitMinOrMax(this, node, kIA32Maxpd, false);
 }
 
 namespace {
-void VisitExtAddPairwise(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitExtAddPairwise(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode, bool need_temp) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   InstructionOperand operand0 = g.UseRegister(node->InputAt(0));
   InstructionOperand dst = (selector->IsSupported(AVX))
                                ? g.DefineAsRegister(node)
@@ -3140,24 +3640,29 @@ void VisitExtAddPairwise(InstructionSelector* selector, Node* node,
 }
 }  // namespace
 
-void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
   VisitExtAddPairwise(this, node, kIA32I32x4ExtAddPairwiseI16x8S, true);
 }
 
-void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
   VisitExtAddPairwise(this, node, kIA32I32x4ExtAddPairwiseI16x8U, false);
 }
 
-void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
   VisitExtAddPairwise(this, node, kIA32I16x8ExtAddPairwiseI8x16S, true);
 }
 
-void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
   VisitExtAddPairwise(this, node, kIA32I16x8ExtAddPairwiseI8x16U, true);
 }
 
-void InstructionSelector::VisitI8x16Popcnt(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Popcnt(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst = CpuFeatures::IsSupported(AVX)
                                ? g.DefineAsRegister(node)
                                : g.DefineAsRegister(node);
@@ -3166,8 +3671,9 @@ void InstructionSelector::VisitI8x16Popcnt(Node* node) {
        arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitF64x2ConvertLowI32x4U(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2ConvertLowI32x4U(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempRegister()};
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
@@ -3175,8 +3681,9 @@ void InstructionSelector::VisitF64x2ConvertLowI32x4U(Node* node) {
        arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitI32x4TruncSatF64x2SZero(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4TruncSatF64x2SZero(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempRegister()};
   if (IsSupported(AVX)) {
     // Requires dst != src.
@@ -3188,8 +3695,9 @@ void InstructionSelector::VisitI32x4TruncSatF64x2SZero(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI32x4TruncSatF64x2UZero(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4TruncSatF64x2UZero(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempRegister()};
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
@@ -3197,24 +3705,31 @@ void InstructionSelector::VisitI32x4TruncSatF64x2UZero(Node* node) {
        arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF64x2SZero(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF64x2SZero(
+    Node* node) {
   VisitRRSimd(this, node, kIA32Cvttpd2dq);
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF64x2UZero(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF64x2UZero(
+    Node* node) {
   VisitFloatUnop(this, node, node->InputAt(0), kIA32I32x4TruncF64x2UZero);
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF32x4S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF32x4S(Node* node) {
   VisitRRSimd(this, node, kIA32Cvttps2dq);
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF32x4U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF32x4U(Node* node) {
   VisitFloatUnop(this, node, node->InputAt(0), kIA32I32x4TruncF32x4U);
 }
 
-void InstructionSelector::VisitI64x2GtS(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2GtS(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   if (CpuFeatures::IsSupported(AVX)) {
     Emit(kIA32I64x2GtS, g.DefineAsRegister(node),
          g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
@@ -3228,8 +3743,9 @@ void InstructionSelector::VisitI64x2GtS(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI64x2GeS(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2GeS(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   if (CpuFeatures::IsSupported(AVX)) {
     Emit(kIA32I64x2GeS, g.DefineAsRegister(node),
          g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
@@ -3244,12 +3760,14 @@ void InstructionSelector::VisitI64x2GeS(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI64x2Abs(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Abs(Node* node) {
   VisitRRSimd(this, node, kIA32I64x2Abs, kIA32I64x2Abs);
 }
 
-void InstructionSelector::VisitF64x2PromoteLowF32x4(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2PromoteLowF32x4(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionCode code = kIA32F64x2PromoteLowF32x4;
   Node* input = node->InputAt(0);
   LoadTransformMatcher m(input);
@@ -3268,9 +3786,10 @@ void InstructionSelector::VisitF64x2PromoteLowF32x4(Node* node) {
 }
 
 namespace {
-void VisitRelaxedLaneSelect(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitRelaxedLaneSelect(InstructionSelectorT<Adapter>* selector, Node* node,
                             InstructionCode code = kIA32Pblendvb) {
-  IA32OperandGenerator g(selector);
+  IA32OperandGeneratorT<Adapter> g(selector);
   // pblendvb/blendvps/blendvpd copies src2 when mask is set, opposite from Wasm
   // semantics. node's inputs are: mask, lhs, rhs (determined in
   // wasm-compiler.cc).
@@ -3288,43 +3807,53 @@ void VisitRelaxedLaneSelect(InstructionSelector* selector, Node* node,
 }
 }  // namespace
 
-void InstructionSelector::VisitI8x16RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16RelaxedLaneSelect(Node* node) {
   VisitRelaxedLaneSelect(this, node);
 }
-void InstructionSelector::VisitI16x8RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8RelaxedLaneSelect(Node* node) {
   VisitRelaxedLaneSelect(this, node);
 }
-void InstructionSelector::VisitI32x4RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedLaneSelect(Node* node) {
   VisitRelaxedLaneSelect(this, node, kIA32Blendvps);
 }
-void InstructionSelector::VisitI64x2RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2RelaxedLaneSelect(Node* node) {
   VisitRelaxedLaneSelect(this, node, kIA32Blendvpd);
 }
 
-void InstructionSelector::VisitF64x2Qfma(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Qfma(Node* node) {
   VisitRRRR(this, node, kIA32F64x2Qfma);
 }
 
-void InstructionSelector::VisitF64x2Qfms(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Qfms(Node* node) {
   VisitRRRR(this, node, kIA32F64x2Qfms);
 }
 
-void InstructionSelector::VisitF32x4Qfma(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Qfma(Node* node) {
   VisitRRRR(this, node, kIA32F32x4Qfma);
 }
 
-void InstructionSelector::VisitF32x4Qfms(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Qfms(Node* node) {
   VisitRRRR(this, node, kIA32F32x4Qfms);
 }
 
-void InstructionSelector::VisitI16x8DotI8x16I7x16S(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8DotI8x16I7x16S(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   Emit(kIA32I16x8DotI8x16I7x16S, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
 }
 
-void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
-  IA32OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI8x16I7x16AddS(Node* node) {
+  IA32OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kIA32I32x4DotI8x16I7x16AddS, g.DefineSameAsInput(node, 2),
        g.UseUniqueRegister(node->InputAt(0)),
@@ -3332,12 +3861,25 @@ void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
        g.UseUniqueRegister(node->InputAt(2)), arraysize(temps), temps);
 }
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGeneratorT<Adapter>* g, int first_input_index, node_t node) {
   UNREACHABLE();
 }
 
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
+
+template <>
+TurboshaftAdapter::node_t
+InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    node_t node, size_t projection_index) {
+  UNIMPLEMENTED();
+}
+
 // static
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
@@ -3367,6 +3909,11 @@ InstructionSelector::AlignmentRequirements() {
       FullUnalignedAccessSupport();
 }
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/instruction-codes.h b/deps/v8/src/compiler/backend/instruction-codes.h
index 87adf068bbfca9..946745b62a4aa8 100644
--- a/deps/v8/src/compiler/backend/instruction-codes.h
+++ b/deps/v8/src/compiler/backend/instruction-codes.h
@@ -41,6 +41,7 @@ namespace compiler {
 enum class RecordWriteMode {
   kValueIsMap,
   kValueIsPointer,
+  kValueIsIndirectPointer,
   kValueIsEphemeronKey,
   kValueIsAny,
 };
@@ -52,6 +53,8 @@ inline RecordWriteMode WriteBarrierKindToRecordWriteMode(
       return RecordWriteMode::kValueIsMap;
     case kPointerWriteBarrier:
       return RecordWriteMode::kValueIsPointer;
+    case kIndirectPointerWriteBarrier:
+      return RecordWriteMode::kValueIsIndirectPointer;
     case kEphemeronKeyWriteBarrier:
       return RecordWriteMode::kValueIsEphemeronKey;
     case kFullWriteBarrier:
@@ -102,6 +105,7 @@ inline RecordWriteMode WriteBarrierKindToRecordWriteMode(
   V(AtomicXorWord32)                                       \
   V(ArchStoreWithWriteBarrier)                             \
   V(ArchAtomicStoreWithWriteBarrier)                       \
+  V(ArchStoreIndirectWithWriteBarrier)                     \
   V(AtomicLoadInt8)                                        \
   V(AtomicLoadUint8)                                       \
   V(AtomicLoadInt16)                                       \
@@ -332,7 +336,7 @@ using AtomicStoreRecordWriteModeField =
     AtomicMemoryOrderField::Next<RecordWriteMode, 4>;
 
 // Write modes for writes with barrier.
-using RecordWriteModeField = FlagsConditionField::Next<RecordWriteMode, 2>;
+using RecordWriteModeField = FlagsConditionField::Next<RecordWriteMode, 3>;
 
 // LaneSizeField and AccessModeField are helper types to encode/decode a lane
 // size, an access mode, or both inside the overlapping MiscField.
diff --git a/deps/v8/src/compiler/backend/instruction-scheduler.cc b/deps/v8/src/compiler/backend/instruction-scheduler.cc
index af339c15585796..ce22840342da9b 100644
--- a/deps/v8/src/compiler/backend/instruction-scheduler.cc
+++ b/deps/v8/src/compiler/backend/instruction-scheduler.cc
@@ -333,6 +333,7 @@ int InstructionScheduler::GetInstructionFlags(const Instruction* instr) const {
 
     case kArchStoreWithWriteBarrier:
     case kArchAtomicStoreWithWriteBarrier:
+    case kArchStoreIndirectWithWriteBarrier:
       return kHasSideEffect;
 
     case kAtomicLoadInt8:
diff --git a/deps/v8/src/compiler/backend/instruction-selector-adapter.h b/deps/v8/src/compiler/backend/instruction-selector-adapter.h
new file mode 100644
index 00000000000000..0e58e9d326521f
--- /dev/null
+++ b/deps/v8/src/compiler/backend/instruction-selector-adapter.h
@@ -0,0 +1,963 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_BACKEND_INSTRUCTION_SELECTOR_ADAPTER_H_
+#define V8_COMPILER_BACKEND_INSTRUCTION_SELECTOR_ADAPTER_H_
+
+#include "src/codegen/machine-type.h"
+#include "src/compiler/backend/instruction.h"
+#include "src/compiler/common-operator.h"
+#include "src/compiler/machine-operator.h"
+#include "src/compiler/node-matchers.h"
+#include "src/compiler/opcodes.h"
+#include "src/compiler/operator.h"
+#include "src/compiler/schedule.h"
+#include "src/compiler/turboshaft/graph.h"
+#include "src/compiler/turboshaft/operation-matcher.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/use-map.h"
+
+// TODO(nicohartmann@):
+// During the transition period to a generic instruction selector, some
+// instantiations with TurboshaftAdapter will still call functions with
+// Node* arguments. Use `DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK` to define
+// a temporary fallback for these functions such that compilation is possible
+// while transitioning the instruction selector incrementally. Once all uses
+// of Node*, BasicBlock*, ... have been replaced, remove those fallbacks.
+#define DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(ret, name)                     \
+  template <typename... Args>                                                  \
+  std::enable_if_t<Adapter::IsTurboshaft &&                                    \
+                       v8::internal::compiler::detail::AnyTurbofanNodeOrBlock< \
+                           Args...>::value,                                    \
+                   ret>                                                        \
+  name(Args...) {                                                              \
+    UNREACHABLE();                                                             \
+  }
+
+namespace v8::internal::compiler {
+namespace detail {
+template <typename...>
+struct AnyTurbofanNodeOrBlock;
+template <typename Head, typename... Tail>
+struct AnyTurbofanNodeOrBlock<Head, Tail...> {
+  static constexpr bool value = std::is_same_v<Head, Node*> ||
+                                std::is_same_v<Head, BasicBlock*> ||
+                                AnyTurbofanNodeOrBlock<Tail...>::value;
+};
+template <>
+struct AnyTurbofanNodeOrBlock<> {
+  static constexpr bool value = false;
+};
+}  // namespace detail
+
+struct TurbofanAdapter {
+  static constexpr bool IsTurbofan = true;
+  static constexpr bool IsTurboshaft = false;
+  static constexpr bool AllowsImplicitWord64ToWord32Truncation = false;
+  using schedule_t = Schedule*;
+  using block_t = BasicBlock*;
+  using block_range_t = ZoneVector<block_t>;
+  using node_t = Node*;
+  using inputs_t = Node::Inputs;
+  using opcode_t = IrOpcode::Value;
+  using id_t = uint32_t;
+  using source_position_table_t = SourcePositionTable;
+
+  explicit TurbofanAdapter(Schedule*) {}
+
+  class ConstantView {
+   public:
+    explicit ConstantView(node_t node) : node_(node) {
+      DCHECK(node_->opcode() == IrOpcode::kInt32Constant ||
+             node_->opcode() == IrOpcode::kInt64Constant ||
+             node_->opcode() == IrOpcode::kRelocatableInt32Constant ||
+             node_->opcode() == IrOpcode::kRelocatableInt64Constant ||
+             node_->opcode() == IrOpcode::kHeapConstant ||
+             node_->opcode() == IrOpcode::kCompressedHeapConstant ||
+             node_->opcode() == IrOpcode::kNumberConstant);
+    }
+
+    bool is_int32() const {
+      return node_->opcode() == IrOpcode::kInt32Constant;
+    }
+    bool is_relocatable_int32() const {
+      return node_->opcode() == IrOpcode::kRelocatableInt32Constant;
+    }
+    int32_t int32_value() const {
+      DCHECK(is_int32() || is_relocatable_int32());
+      return OpParameter<int32_t>(node_->op());
+    }
+    bool is_int64() const {
+      return node_->opcode() == IrOpcode::kInt64Constant;
+    }
+    bool is_relocatable_int64() const {
+      return node_->opcode() == IrOpcode::kRelocatableInt64Constant;
+    }
+    int64_t int64_value() const {
+      DCHECK(is_int64() || is_relocatable_int64());
+      return OpParameter<int64_t>(node_->op());
+    }
+    bool is_heap_object() const {
+      return node_->opcode() == IrOpcode::kHeapConstant;
+    }
+    bool is_compressed_heap_object() const {
+      return node_->opcode() == IrOpcode::kCompressedHeapConstant;
+    }
+    Handle<HeapObject> heap_object_value() const {
+      DCHECK(is_heap_object() || is_compressed_heap_object());
+      return OpParameter<Handle<HeapObject>>(node_->op());
+    }
+    bool is_number() const {
+      return node_->opcode() == IrOpcode::kNumberConstant;
+    }
+    double number_value() const {
+      DCHECK(is_number());
+      return OpParameter<double>(node_->op());
+    }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+  };
+
+  class CallView {
+   public:
+    explicit CallView(node_t node) : node_(node) {
+      DCHECK(node_->opcode() == IrOpcode::kCall ||
+             node_->opcode() == IrOpcode::kTailCall);
+    }
+
+    int return_count() const { return node_->op()->ValueOutputCount(); }
+    node_t callee() const { return node_->InputAt(0); }
+    node_t frame_state() const {
+      return node_->InputAt(static_cast<int>(call_descriptor()->InputCount()));
+    }
+    base::Vector<node_t> arguments() const {
+      base::Vector<node_t> inputs = node_->inputs_vector();
+      return inputs.SubVector(1, inputs.size());
+    }
+    const CallDescriptor* call_descriptor() const {
+      return CallDescriptorOf(node_->op());
+    }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+  };
+
+  class BranchView {
+   public:
+    explicit BranchView(node_t node) : node_(node) {
+      DCHECK_EQ(node_->opcode(), IrOpcode::kBranch);
+    }
+
+    node_t condition() const { return node_->InputAt(0); }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+  };
+
+  class WordBinopView {
+   public:
+    explicit WordBinopView(node_t node) : node_(node), m_(node) {}
+
+    void EnsureConstantIsRightIfCommutative() {
+      // Nothing to do. Matcher already ensures that.
+    }
+
+    node_t left() const { return m_.left().node(); }
+    node_t right() const { return m_.right().node(); }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+    Int32BinopMatcher m_;
+  };
+
+  class LoadView {
+   public:
+    explicit LoadView(node_t node) : node_(node) {
+      DCHECK(node_->opcode() == IrOpcode::kLoad ||
+             node_->opcode() == IrOpcode::kLoadImmutable ||
+             node_->opcode() == IrOpcode::kProtectedLoad ||
+             node_->opcode() == IrOpcode::kLoadTrapOnNull);
+    }
+
+    LoadRepresentation loaded_rep() const {
+      return LoadRepresentationOf(node_->op());
+    }
+
+    node_t base() const { return node_->InputAt(0); }
+    node_t index() const { return node_->InputAt(1); }
+    int32_t displacement() const { return 0; }
+    uint8_t element_size_log2() const { return 0; }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+  };
+
+  class StoreView {
+   public:
+    explicit StoreView(node_t node) : node_(node) {
+      DCHECK(node->opcode() == IrOpcode::kStore ||
+             node->opcode() == IrOpcode::kProtectedStore ||
+             node->opcode() == IrOpcode::kStoreTrapOnNull ||
+             node->opcode() == IrOpcode::kWord32AtomicStore ||
+             node->opcode() == IrOpcode::kWord64AtomicStore);
+    }
+
+    StoreRepresentation stored_rep() const {
+      switch (node_->opcode()) {
+        case IrOpcode::kStore:
+        case IrOpcode::kProtectedStore:
+        case IrOpcode::kStoreTrapOnNull:
+          return StoreRepresentationOf(node_->op());
+        case IrOpcode::kWord32AtomicStore:
+        case IrOpcode::kWord64AtomicStore:
+          return AtomicStoreParametersOf(node_->op()).store_representation();
+        default:
+          UNREACHABLE();
+      }
+    }
+    base::Optional<AtomicMemoryOrder> memory_order() const {
+      switch (node_->opcode()) {
+        case IrOpcode::kStore:
+        case IrOpcode::kProtectedStore:
+        case IrOpcode::kStoreTrapOnNull:
+          return base::nullopt;
+        case IrOpcode::kWord32AtomicStore:
+        case IrOpcode::kWord64AtomicStore:
+          return AtomicStoreParametersOf(node_->op()).order();
+        default:
+          UNREACHABLE();
+      }
+    }
+    MemoryAccessKind access_kind() const {
+      switch (node_->opcode()) {
+        case IrOpcode::kStore:
+          return MemoryAccessKind::kNormal;
+        case IrOpcode::kProtectedStore:
+        case IrOpcode::kStoreTrapOnNull:
+          return MemoryAccessKind::kProtected;
+        case IrOpcode::kWord32AtomicStore:
+        case IrOpcode::kWord64AtomicStore:
+          return AtomicStoreParametersOf(node_->op()).kind();
+        default:
+          UNREACHABLE();
+      }
+    }
+
+    node_t base() const { return node_->InputAt(0); }
+    node_t index() const { return node_->InputAt(1); }
+    node_t value() const { return node_->InputAt(2); }
+    int32_t displacement() const { return 0; }
+    uint8_t element_size_log2() const { return 0; }
+
+    bool is_store_trap_on_null() const {
+      return node_->opcode() == IrOpcode::kStoreTrapOnNull;
+    }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+  };
+
+  class DeoptimizeView {
+   public:
+    explicit DeoptimizeView(node_t node) : node_(node) {
+      DCHECK(node_->opcode() == IrOpcode::kDeoptimize ||
+             node_->opcode() == IrOpcode::kDeoptimizeIf ||
+             node_->opcode() == IrOpcode::kDeoptimizeUnless);
+    }
+
+    DeoptimizeReason reason() const {
+      return DeoptimizeParametersOf(node_->op()).reason();
+    }
+    FeedbackSource feedback() const {
+      return DeoptimizeParametersOf(node_->op()).feedback();
+    }
+    node_t frame_state() const {
+      if (is_deoptimize()) {
+        DCHECK_EQ(node_->InputAt(0)->opcode(), IrOpcode::kFrameState);
+        return node_->InputAt(0);
+      }
+      DCHECK(is_deoptimize_if() || is_deoptimize_unless());
+      DCHECK_EQ(node_->InputAt(1)->opcode(), IrOpcode::kFrameState);
+      return node_->InputAt(1);
+    }
+
+    bool is_deoptimize() const {
+      return node_->opcode() == IrOpcode::kDeoptimize;
+    }
+    bool is_deoptimize_if() const {
+      return node_->opcode() == IrOpcode::kDeoptimizeIf;
+    }
+    bool is_deoptimize_unless() const {
+      return node_->opcode() == IrOpcode::kDeoptimizeUnless;
+    }
+
+    node_t condition() const {
+      DCHECK(is_deoptimize_if() || is_deoptimize_unless());
+      return node_->InputAt(0);
+    }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+  };
+
+  bool is_constant(node_t node) const {
+    switch (node->opcode()) {
+      case IrOpcode::kInt32Constant:
+      case IrOpcode::kInt64Constant:
+      case IrOpcode::kRelocatableInt32Constant:
+      case IrOpcode::kRelocatableInt64Constant:
+      case IrOpcode::kHeapConstant:
+      case IrOpcode::kCompressedHeapConstant:
+      case IrOpcode::kNumberConstant:
+        // For those, a view must be constructible.
+        DCHECK_EQ(constant_view(node), node);
+        return true;
+      default:
+        return false;
+    }
+  }
+  bool is_load(node_t node) const {
+    return node->opcode() == IrOpcode::kLoad ||
+           node->opcode() == IrOpcode::kLoadImmutable ||
+           node->opcode() == IrOpcode::kProtectedLoad ||
+           node->opcode() == IrOpcode::kLoadTrapOnNull;
+  }
+  ConstantView constant_view(node_t node) const { return ConstantView{node}; }
+  CallView call_view(node_t node) { return CallView{node}; }
+  BranchView branch_view(node_t node) { return BranchView(node); }
+  WordBinopView word_binop_view(node_t node) { return WordBinopView(node); }
+  LoadView load_view(node_t node) {
+    DCHECK(is_load(node));
+    return LoadView(node);
+  }
+  StoreView store_view(node_t node) { return StoreView(node); }
+  DeoptimizeView deoptimize_view(node_t node) { return DeoptimizeView(node); }
+
+  block_t block(schedule_t schedule, node_t node) const {
+    return schedule->block(node);
+  }
+
+  RpoNumber rpo_number(block_t block) const {
+    return RpoNumber::FromInt(block->rpo_number());
+  }
+
+  const block_range_t& rpo_order(schedule_t schedule) const {
+    return *schedule->rpo_order();
+  }
+
+  bool IsLoopHeader(block_t block) const { return block->IsLoopHeader(); }
+
+  size_t PredecessorCount(block_t block) const {
+    return block->PredecessorCount();
+  }
+  block_t PredecessorAt(block_t block, size_t index) const {
+    return block->PredecessorAt(index);
+  }
+
+  base::iterator_range<NodeVector::iterator> nodes(block_t block) {
+    return {block->begin(), block->end()};
+  }
+
+  bool IsPhi(node_t node) const { return node->opcode() == IrOpcode::kPhi; }
+  MachineRepresentation phi_representation_of(node_t node) const {
+    DCHECK(IsPhi(node));
+    return PhiRepresentationOf(node->op());
+  }
+  bool IsRetain(node_t node) const {
+    return node->opcode() == IrOpcode::kRetain;
+  }
+  bool IsHeapConstant(node_t node) const {
+    return node->opcode() == IrOpcode::kHeapConstant;
+  }
+  bool IsExternalConstant(node_t node) const {
+    return node->opcode() == IrOpcode::kExternalConstant;
+  }
+  bool IsRelocatableWasmConstant(node_t node) const {
+    return node->opcode() == IrOpcode::kRelocatableInt32Constant ||
+           node->opcode() == IrOpcode::kRelocatableInt64Constant;
+  }
+  bool IsLoadOrLoadImmutable(node_t node) const {
+    return node->opcode() == IrOpcode::kLoad ||
+           node->opcode() == IrOpcode::kLoadImmutable;
+  }
+
+  int value_input_count(node_t node) const {
+    return node->op()->ValueInputCount();
+  }
+  node_t input_at(node_t node, size_t index) const {
+    return node->InputAt(static_cast<int>(index));
+  }
+  inputs_t inputs(node_t node) const { return node->inputs(); }
+  opcode_t opcode(node_t node) const { return node->opcode(); }
+  bool is_exclusive_user_of(node_t user, node_t value) const {
+    for (Edge const edge : value->use_edges()) {
+      if (edge.from() != user && NodeProperties::IsValueEdge(edge)) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  id_t id(node_t node) const { return node->id(); }
+  static bool valid(node_t node) { return node != nullptr; }
+
+  node_t block_terminator(block_t block) const {
+    return block->control_input();
+  }
+  node_t parent_frame_state(node_t node) const {
+    DCHECK_EQ(node->opcode(), IrOpcode::kFrameState);
+    DCHECK_EQ(FrameState{node}.outer_frame_state(),
+              NodeProperties::GetFrameStateInput(node));
+    return NodeProperties::GetFrameStateInput(node);
+  }
+  int parameter_index_of(node_t node) const {
+    DCHECK_EQ(node->opcode(), IrOpcode::kParameter);
+    return ParameterIndexOf(node->op());
+  }
+  bool is_projection(node_t node) const {
+    return node->opcode() == IrOpcode::kProjection;
+  }
+  size_t projection_index_of(node_t node) const {
+    DCHECK(is_projection(node));
+    return ProjectionIndexOf(node->op());
+  }
+  int osr_value_index_of(node_t node) const {
+    DCHECK_EQ(node->opcode(), IrOpcode::kOsrValue);
+    return OsrValueIndexOf(node->op());
+  }
+
+  bool is_truncate_word64_to_word32(node_t node) const {
+    return node->opcode() == IrOpcode::kTruncateInt64ToInt32;
+  }
+
+  bool is_stack_slot(node_t node) const {
+    return node->opcode() == IrOpcode::kStackSlot;
+  }
+  StackSlotRepresentation stack_slot_representation_of(node_t node) const {
+    DCHECK(is_stack_slot(node));
+    return StackSlotRepresentationOf(node->op());
+  }
+  bool is_integer_constant(node_t node) const {
+    return node->opcode() == IrOpcode::kInt32Constant ||
+           node->opcode() == IrOpcode::kInt64Constant;
+  }
+  int64_t integer_constant(node_t node) const {
+    if (node->opcode() == IrOpcode::kInt32Constant) {
+      return OpParameter<int32_t>(node->op());
+    }
+    DCHECK_EQ(node->opcode(), IrOpcode::kInt64Constant);
+    return OpParameter<int64_t>(node->op());
+  }
+
+  bool IsRequiredWhenUnused(node_t node) const {
+    return !node->op()->HasProperty(Operator::kEliminatable);
+  }
+  bool IsCommutative(node_t node) const {
+    return node->op()->HasProperty(Operator::kCommutative);
+  }
+};
+
+struct TurboshaftAdapter : public turboshaft::OperationMatcher {
+  static constexpr bool IsTurbofan = false;
+  static constexpr bool IsTurboshaft = true;
+  static constexpr bool AllowsImplicitWord64ToWord32Truncation = true;
+  // TODO(nicohartmann@): Rename schedule_t once Turbofan is gone.
+  using schedule_t = turboshaft::Graph*;
+  using block_t = turboshaft::Block*;
+  using block_range_t = ZoneVector<block_t>;
+  using node_t = turboshaft::OpIndex;
+  using inputs_t = base::Vector<const node_t>;
+  using opcode_t = turboshaft::Opcode;
+  using id_t = uint32_t;
+  using source_position_table_t = turboshaft::GrowingSidetable<SourcePosition>;
+
+  explicit TurboshaftAdapter(turboshaft::Graph* graph)
+      : turboshaft::OperationMatcher(*graph), graph_(graph) {}
+
+  class ConstantView {
+    using Kind = turboshaft::ConstantOp::Kind;
+
+   public:
+    ConstantView(turboshaft::Graph* graph, node_t node) : node_(node) {
+      op_ = &graph->Get(node_).Cast<turboshaft::ConstantOp>();
+    }
+
+    bool is_int32() const { return op_->kind == Kind::kWord32; }
+    bool is_relocatable_int32() const {
+      // We don't have this in turboshaft currently.
+      return false;
+    }
+    int32_t int32_value() const {
+      DCHECK(is_int32() || is_relocatable_int32());
+      return op_->word32();
+    }
+    bool is_int64() const { return op_->kind == Kind::kWord64; }
+    bool is_relocatable_int64() const {
+      return op_->kind == Kind::kRelocatableWasmCall ||
+             op_->kind == Kind::kRelocatableWasmStubCall;
+    }
+    int64_t int64_value() const {
+      if (is_int64()) return op_->word64();
+      DCHECK(is_relocatable_int64());
+      return static_cast<int64_t>(op_->integral());
+    }
+    bool is_heap_object() const { return op_->kind == Kind::kHeapObject; }
+    bool is_compressed_heap_object() const {
+      return op_->kind == Kind::kCompressedHeapObject;
+    }
+    Handle<HeapObject> heap_object_value() const {
+      DCHECK(is_heap_object() || is_compressed_heap_object());
+      return op_->handle();
+    }
+    bool is_number() const { return op_->kind == Kind::kNumber; }
+    double number_value() const {
+      DCHECK(is_number());
+      return op_->number();
+    }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+    const turboshaft::ConstantOp* op_;
+  };
+
+  class CallView {
+   public:
+    explicit CallView(turboshaft::Graph* graph, node_t node) : node_(node) {
+      call_op_ = graph->Get(node_).TryCast<turboshaft::CallOp>();
+      if (call_op_ != nullptr) return;
+      tail_call_op_ = graph->Get(node_).TryCast<turboshaft::TailCallOp>();
+      if (tail_call_op_ != nullptr) return;
+      UNREACHABLE();
+    }
+
+    int return_count() const {
+      if (call_op_) {
+        return static_cast<int>(call_op_->results_rep().size());
+      }
+      if (tail_call_op_) {
+        return static_cast<int>(tail_call_op_->outputs_rep().size());
+      }
+      UNREACHABLE();
+    }
+    node_t callee() const {
+      if (call_op_) return call_op_->callee();
+      if (tail_call_op_) return tail_call_op_->callee();
+      UNREACHABLE();
+    }
+    node_t frame_state() const {
+      if (call_op_) return call_op_->frame_state();
+      UNREACHABLE();
+    }
+    base::Vector<const node_t> arguments() const {
+      if (call_op_) return call_op_->arguments();
+      if (tail_call_op_) return tail_call_op_->arguments();
+      UNREACHABLE();
+    }
+    const CallDescriptor* call_descriptor() const {
+      if (call_op_) return call_op_->descriptor->descriptor;
+      if (tail_call_op_) return tail_call_op_->descriptor->descriptor;
+      UNREACHABLE();
+    }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+    const turboshaft::CallOp* call_op_;
+    const turboshaft::TailCallOp* tail_call_op_;
+  };
+
+  class BranchView {
+   public:
+    explicit BranchView(turboshaft::Graph* graph, node_t node) : node_(node) {
+      op_ = &graph->Get(node_).Cast<turboshaft::BranchOp>();
+    }
+
+    node_t condition() const { return op_->condition(); }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+    const turboshaft::BranchOp* op_;
+  };
+
+  class WordBinopView {
+   public:
+    explicit WordBinopView(turboshaft::Graph* graph, node_t node)
+        : node_(node) {
+      op_ = &graph->Get(node_).Cast<turboshaft::WordBinopOp>();
+      left_ = op_->left();
+      right_ = op_->right();
+      can_put_constant_right_ =
+          op_->IsCommutative(op_->kind) &&
+          graph->Get(left_).Is<turboshaft::ConstantOp>() &&
+          !graph->Get(right_).Is<turboshaft::ConstantOp>();
+    }
+
+    void EnsureConstantIsRightIfCommutative() {
+      if (can_put_constant_right_) {
+        std::swap(left_, right_);
+        can_put_constant_right_ = false;
+      }
+    }
+
+    node_t left() const { return left_; }
+    node_t right() const { return right_; }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+    const turboshaft::WordBinopOp* op_;
+    node_t left_;
+    node_t right_;
+    bool can_put_constant_right_;
+  };
+
+  class LoadView {
+   public:
+    LoadView(turboshaft::Graph* graph, node_t node) : node_(node) {
+      op_ = &graph->Get(node_).Cast<turboshaft::LoadOp>();
+    }
+
+    LoadRepresentation loaded_rep() const {
+      return op_->loaded_rep.ToMachineType();
+    }
+
+    node_t base() const { return op_->base(); }
+    node_t index() const { return op_->index(); }
+    int32_t displacement() const {
+      static_assert(
+          std::is_same_v<decltype(turboshaft::StoreOp::offset), int32_t>);
+      int32_t offset = op_->offset;
+      if (op_->kind.tagged_base) {
+        CHECK_GE(offset, std::numeric_limits<int32_t>::min() + kHeapObjectTag);
+        offset -= kHeapObjectTag;
+      }
+      return offset;
+    }
+    uint8_t element_size_log2() const {
+      static_assert(
+          std::is_same_v<decltype(turboshaft::StoreOp::element_size_log2),
+                         uint8_t>);
+      return op_->element_size_log2;
+    }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+    const turboshaft::LoadOp* op_;
+  };
+
+  class StoreView {
+   public:
+    StoreView(turboshaft::Graph* graph, node_t node) : node_(node) {
+      op_ = &graph->Get(node_).Cast<turboshaft::StoreOp>();
+    }
+
+    StoreRepresentation stored_rep() const {
+      return {op_->stored_rep.ToMachineType().representation(),
+              op_->write_barrier};
+    }
+    base::Optional<AtomicMemoryOrder> memory_order() const {
+      // TODO(nicohartmann@): Currently we only have non-atomic stores.
+      return base::nullopt;
+    }
+    MemoryAccessKind access_kind() const {
+      // TODO(nicohartmann@): Currently we only have non-atomic stores.
+      return MemoryAccessKind::kNormal;
+    }
+
+    node_t base() const { return op_->base(); }
+    node_t index() const { return op_->index(); }
+    node_t value() const { return op_->value(); }
+    int32_t displacement() const {
+      static_assert(
+          std::is_same_v<decltype(turboshaft::StoreOp::offset), int32_t>);
+      int32_t offset = op_->offset;
+      if (op_->kind.tagged_base) {
+        CHECK_GE(offset, std::numeric_limits<int32_t>::min() + kHeapObjectTag);
+        offset -= kHeapObjectTag;
+      }
+      return offset;
+    }
+    uint8_t element_size_log2() const {
+      static_assert(
+          std::is_same_v<decltype(turboshaft::StoreOp::element_size_log2),
+                         uint8_t>);
+      return op_->element_size_log2;
+    }
+
+    bool is_store_trap_on_null() const { return false; }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+    const turboshaft::StoreOp* op_;
+  };
+
+  class DeoptimizeView {
+   public:
+    explicit DeoptimizeView(const turboshaft::Graph* graph, node_t node)
+        : node_(node) {
+      const auto& op = graph->Get(node);
+      if (op.Is<turboshaft::DeoptimizeOp>()) {
+        deoptimize_op_ = &op.Cast<turboshaft::DeoptimizeOp>();
+        parameters_ = deoptimize_op_->parameters;
+      } else {
+        DCHECK(op.Is<turboshaft::DeoptimizeIfOp>());
+        deoptimize_if_op_ = &op.Cast<turboshaft::DeoptimizeIfOp>();
+        parameters_ = deoptimize_if_op_->parameters;
+      }
+    }
+
+    DeoptimizeReason reason() const { return parameters_->reason(); }
+    FeedbackSource feedback() const { return parameters_->feedback(); }
+    node_t frame_state() const {
+      return deoptimize_op_ ? deoptimize_op_->frame_state()
+                            : deoptimize_if_op_->frame_state();
+    }
+
+    bool is_deoptimize() const { return deoptimize_op_ != nullptr; }
+    bool is_deoptimize_if() const {
+      return deoptimize_if_op_ != nullptr && !deoptimize_if_op_->negated;
+    }
+    bool is_deoptimize_unless() const {
+      return deoptimize_if_op_ != nullptr && deoptimize_if_op_->negated;
+    }
+
+    node_t condition() const {
+      DCHECK(is_deoptimize_if() || is_deoptimize_unless());
+      return deoptimize_if_op_->condition();
+    }
+
+    operator node_t() const { return node_; }
+
+   private:
+    node_t node_;
+    const turboshaft::DeoptimizeOp* deoptimize_op_ = nullptr;
+    const turboshaft::DeoptimizeIfOp* deoptimize_if_op_ = nullptr;
+    const DeoptimizeParameters* parameters_;
+  };
+
+  bool is_constant(node_t node) const {
+    return graph_->Get(node).Is<turboshaft::ConstantOp>();
+  }
+  bool is_load(node_t node) const {
+    return graph_->Get(node).Is<turboshaft::LoadOp>();
+  }
+  ConstantView constant_view(node_t node) { return ConstantView{graph_, node}; }
+  CallView call_view(node_t node) { return CallView{graph_, node}; }
+  BranchView branch_view(node_t node) { return BranchView(graph_, node); }
+  WordBinopView word_binop_view(node_t node) {
+    return WordBinopView(graph_, node);
+  }
+  LoadView load_view(node_t node) {
+    DCHECK(is_load(node));
+    return LoadView(graph_, node);
+  }
+  StoreView store_view(node_t node) { return StoreView(graph_, node); }
+  DeoptimizeView deoptimize_view(node_t node) {
+    return DeoptimizeView(graph_, node);
+  }
+
+  turboshaft::Graph* turboshaft_graph() const { return graph_; }
+
+  block_t block(schedule_t schedule, node_t node) const {
+    // TODO(nicohartmann@): This might be too slow and we should consider
+    // precomputing.
+    return &schedule->Get(schedule->BlockOf(node));
+  }
+
+  RpoNumber rpo_number(block_t block) const {
+    return RpoNumber::FromInt(block->index().id());
+  }
+
+  const block_range_t& rpo_order(schedule_t schedule) {
+    return schedule->blocks_vector();
+  }
+
+  bool IsLoopHeader(block_t block) const { return block->IsLoop(); }
+
+  size_t PredecessorCount(block_t block) const {
+    return block->PredecessorCount();
+  }
+  block_t PredecessorAt(block_t block, size_t index) const {
+    return block->Predecessors()[index];
+  }
+
+  base::iterator_range<turboshaft::Graph::OpIndexIterator> nodes(
+      block_t block) {
+    return graph_->OperationIndices(*block);
+  }
+
+  bool IsPhi(node_t node) const {
+    return graph_->Get(node).Is<turboshaft::PhiOp>();
+  }
+  MachineRepresentation phi_representation_of(node_t node) const {
+    DCHECK(IsPhi(node));
+    const turboshaft::PhiOp& phi = graph_->Get(node).Cast<turboshaft::PhiOp>();
+    return phi.rep.machine_representation();
+  }
+  bool IsRetain(node_t node) const {
+    return graph_->Get(node).Is<turboshaft::RetainOp>();
+  }
+  bool IsHeapConstant(node_t node) const {
+    turboshaft::ConstantOp* constant =
+        graph_->Get(node).TryCast<turboshaft::ConstantOp>();
+    if (constant == nullptr) return false;
+    return constant->kind == turboshaft::ConstantOp::Kind::kHeapObject;
+  }
+  bool IsExternalConstant(node_t node) const {
+    turboshaft::ConstantOp* constant =
+        graph_->Get(node).TryCast<turboshaft::ConstantOp>();
+    if (constant == nullptr) return false;
+    return constant->kind == turboshaft::ConstantOp::Kind::kExternal;
+  }
+  bool IsRelocatableWasmConstant(node_t node) const {
+    turboshaft::ConstantOp* constant =
+        graph_->Get(node).TryCast<turboshaft::ConstantOp>();
+    if (constant == nullptr) return false;
+    return constant->kind ==
+           turboshaft::any_of(
+               turboshaft::ConstantOp::Kind::kRelocatableWasmCall,
+               turboshaft::ConstantOp::Kind::kRelocatableWasmStubCall);
+  }
+  bool IsLoadOrLoadImmutable(node_t node) const {
+    return graph_->Get(node).opcode == turboshaft::Opcode::kLoad;
+  }
+
+  int value_input_count(node_t node) const {
+    return graph_->Get(node).input_count;
+  }
+  node_t input_at(node_t node, size_t index) const {
+    return graph_->Get(node).input(index);
+  }
+  inputs_t inputs(node_t node) const { return graph_->Get(node).inputs(); }
+  opcode_t opcode(node_t node) const { return graph_->Get(node).opcode; }
+  bool is_exclusive_user_of(node_t user, node_t value) const {
+    DCHECK(valid(user));
+    DCHECK(valid(value));
+    const size_t use_count = base::count_if(
+        graph_->Get(user).inputs(),
+        [value](turboshaft::OpIndex input) { return input == value; });
+    DCHECK_LT(0, use_count);
+    DCHECK_LE(use_count, graph_->Get(value).saturated_use_count.Get());
+    const turboshaft::Operation& value_op = graph_->Get(value);
+    return (value_op.saturated_use_count.Get() == use_count) &&
+           !value_op.saturated_use_count.IsSaturated();
+  }
+
+  id_t id(node_t node) const { return node.id(); }
+  static bool valid(node_t node) { return node.valid(); }
+
+  node_t block_terminator(block_t block) const {
+    return graph_->PreviousIndex(block->end());
+  }
+  node_t parent_frame_state(node_t node) const {
+    const turboshaft::FrameStateOp& frame_state =
+        graph_->Get(node).Cast<turboshaft::FrameStateOp>();
+    return frame_state.parent_frame_state();
+  }
+  int parameter_index_of(node_t node) const {
+    const turboshaft::ParameterOp& parameter =
+        graph_->Get(node).Cast<turboshaft::ParameterOp>();
+    return parameter.parameter_index;
+  }
+  bool is_projection(node_t node) const {
+    return graph_->Get(node).Is<turboshaft::ProjectionOp>();
+  }
+  size_t projection_index_of(node_t node) const {
+    DCHECK(is_projection(node));
+    const turboshaft::ProjectionOp& projection =
+        graph_->Get(node).Cast<turboshaft::ProjectionOp>();
+    return projection.index;
+  }
+  int osr_value_index_of(node_t node) const {
+    const turboshaft::OsrValueOp& osr_value =
+        graph_->Get(node).Cast<turboshaft::OsrValueOp>();
+    return osr_value.index;
+  }
+
+  bool is_truncate_word64_to_word32(node_t node) const {
+    if (auto change_op = graph_->Get(node).TryCast<turboshaft::ChangeOp>()) {
+      if (change_op->kind == turboshaft::ChangeOp::Kind::kTruncate) {
+        DCHECK_EQ(change_op->from,
+                  turboshaft::RegisterRepresentation::Word64());
+        DCHECK_EQ(change_op->to, turboshaft::RegisterRepresentation::Word32());
+        return true;
+      }
+    }
+    return false;
+  }
+
+  bool is_stack_slot(node_t node) const {
+    return graph_->Get(node).Is<turboshaft::StackSlotOp>();
+  }
+  StackSlotRepresentation stack_slot_representation_of(node_t node) const {
+    DCHECK(is_stack_slot(node));
+    const turboshaft::StackSlotOp& stack_slot =
+        graph_->Get(node).Cast<turboshaft::StackSlotOp>();
+    return StackSlotRepresentation(stack_slot.size, stack_slot.alignment);
+  }
+  bool is_integer_constant(node_t node) const {
+    if (const auto constant =
+            graph_->Get(node).TryCast<turboshaft::ConstantOp>()) {
+      return constant->kind == turboshaft::ConstantOp::Kind::kWord32 ||
+             constant->kind == turboshaft::ConstantOp::Kind::kWord64;
+    }
+    return false;
+  }
+  int64_t integer_constant(node_t node) const {
+    const turboshaft::ConstantOp* constant =
+        graph_->Get(node).TryCast<turboshaft::ConstantOp>();
+    DCHECK_NOT_NULL(constant);
+    return constant->signed_integral();
+  }
+
+  bool IsRequiredWhenUnused(node_t node) const {
+    return graph_->Get(node).IsRequiredWhenUnused();
+  }
+  bool IsCommutative(node_t node) const {
+    const turboshaft::Operation& op = graph_->Get(node);
+    if (const auto binop = op.TryCast<turboshaft::WordBinopOp>()) {
+      return turboshaft::WordBinopOp::IsCommutative(binop->kind);
+    } else if (const auto binop =
+                   op.TryCast<turboshaft::OverflowCheckedBinopOp>()) {
+      return turboshaft::OverflowCheckedBinopOp::IsCommutative(binop->kind);
+    } else if (const auto binop = op.TryCast<turboshaft::FloatBinopOp>()) {
+      return turboshaft::FloatBinopOp::IsCommutative(binop->kind);
+    } else if (op.Is<turboshaft::EqualOp>()) {
+      return turboshaft::EqualOp::IsCommutative();
+    }
+    return false;
+  }
+
+ private:
+  turboshaft::Graph* graph_;
+};
+
+}  // namespace v8::internal::compiler
+
+#endif  // V8_COMPILER_BACKEND_INSTRUCTION_SELECTOR_ADAPTER_H_
diff --git a/deps/v8/src/compiler/backend/instruction-selector-impl.h b/deps/v8/src/compiler/backend/instruction-selector-impl.h
index e46c5c22f3da84..37d79a49d05283 100644
--- a/deps/v8/src/compiler/backend/instruction-selector-impl.h
+++ b/deps/v8/src/compiler/backend/instruction-selector-impl.h
@@ -17,21 +17,28 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-struct CaseInfo {
+template <typename Adapter>
+struct CaseInfoT {
   int32_t value;  // The case value.
   int32_t order;  // The order for lowering to comparisons (less means earlier).
-  BasicBlock* branch;  // The basic blocks corresponding to the case value.
+  typename Adapter::block_t
+      branch;  // The basic blocks corresponding to the case value.
 };
 
-inline bool operator<(const CaseInfo& l, const CaseInfo& r) {
+template <typename Adapter>
+inline bool operator<(const CaseInfoT<Adapter>& l,
+                      const CaseInfoT<Adapter>& r) {
   return l.order < r.order;
 }
 
 // Helper struct containing data about a table or lookup switch.
-class SwitchInfo {
+template <typename Adapter>
+class SwitchInfoT {
  public:
-  SwitchInfo(ZoneVector<CaseInfo> const& cases, int32_t min_value,
-             int32_t max_value, BasicBlock* default_branch)
+  using CaseInfo = CaseInfoT<Adapter>;
+  using block_t = typename Adapter::block_t;
+  SwitchInfoT(ZoneVector<CaseInfo> const& cases, int32_t min_value,
+              int32_t max_value, block_t default_branch)
       : cases_(cases),
         min_value_(min_value),
         max_value_(max_value),
@@ -58,65 +65,93 @@ class SwitchInfo {
   int32_t max_value() const { return max_value_; }
   size_t value_range() const { return value_range_; }
   size_t case_count() const { return cases_.size(); }
-  BasicBlock* default_branch() const { return default_branch_; }
+  block_t default_branch() const { return default_branch_; }
 
  private:
   const ZoneVector<CaseInfo>& cases_;
   int32_t min_value_;   // minimum value of {cases_}
   int32_t max_value_;   // maximum value of {cases_}
   size_t value_range_;  // |max_value - min_value| + 1
-  BasicBlock* default_branch_;
+  block_t default_branch_;
 };
 
+#define OPERAND_GENERATOR_T_BOILERPLATE(adapter)           \
+  using super = OperandGeneratorT<adapter>;                \
+  using node_t = typename adapter::node_t;                 \
+  using RegisterMode = typename super::RegisterMode;       \
+  using RegisterUseKind = typename super::RegisterUseKind; \
+  using super::selector;                                   \
+  using super::DefineAsRegister;                           \
+  using super::TempImmediate;                              \
+  using super::UseFixed;                                   \
+  using super::UseImmediate;                               \
+  using super::UseImmediate64;                             \
+  using super::UseNegatedImmediate;                        \
+  using super::UseRegister;                                \
+  using super::UseRegisterWithMode;                        \
+  using super::UseUniqueRegister;
+
 // A helper class for the instruction selector that simplifies construction of
 // Operands. This class implements a base for architecture-specific helpers.
-class OperandGenerator {
+template <typename Adapter>
+class OperandGeneratorT : public Adapter {
  public:
-  explicit OperandGenerator(InstructionSelector* selector)
-      : selector_(selector) {}
+  using block_t = typename Adapter::block_t;
+  using node_t = typename Adapter::node_t;
+
+  explicit OperandGeneratorT(InstructionSelectorT<Adapter>* selector)
+      : Adapter(selector->schedule()), selector_(selector) {}
 
   InstructionOperand NoOutput() {
     return InstructionOperand();  // Generates an invalid operand.
   }
 
-  InstructionOperand DefineAsRegister(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, DefineAsRegister)
+  InstructionOperand DefineAsRegister(node_t node) {
     return Define(node,
                   UnallocatedOperand(UnallocatedOperand::MUST_HAVE_REGISTER,
                                      GetVReg(node)));
   }
 
-  InstructionOperand DefineSameAsInput(Node* node, int input_index) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, DefineSameAsInput)
+  InstructionOperand DefineSameAsInput(node_t node, int input_index) {
     return Define(node, UnallocatedOperand(GetVReg(node), input_index));
   }
 
-  InstructionOperand DefineSameAsFirst(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, DefineSameAsFirst)
+  InstructionOperand DefineSameAsFirst(node_t node) {
     return DefineSameAsInput(node, 0);
   }
 
-  InstructionOperand DefineAsFixed(Node* node, Register reg) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, DefineAsFixed)
+  InstructionOperand DefineAsFixed(node_t node, Register reg) {
     return Define(node, UnallocatedOperand(UnallocatedOperand::FIXED_REGISTER,
                                            reg.code(), GetVReg(node)));
   }
 
   template <typename FPRegType>
-  InstructionOperand DefineAsFixed(Node* node, FPRegType reg) {
+  InstructionOperand DefineAsFixed(node_t node, FPRegType reg) {
     return Define(node,
                   UnallocatedOperand(UnallocatedOperand::FIXED_FP_REGISTER,
                                      reg.code(), GetVReg(node)));
   }
 
-  InstructionOperand DefineAsConstant(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, DefineAsConstant)
+  InstructionOperand DefineAsConstant(node_t node) {
     selector()->MarkAsDefined(node);
     int virtual_register = GetVReg(node);
     sequence()->AddConstant(virtual_register, ToConstant(node));
     return ConstantOperand(virtual_register);
   }
 
-  InstructionOperand DefineAsLocation(Node* node, LinkageLocation location) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, DefineAsLocation)
+  InstructionOperand DefineAsLocation(node_t node, LinkageLocation location) {
     return Define(node, ToUnallocatedOperand(location, GetVReg(node)));
   }
 
-  InstructionOperand DefineAsDualLocation(Node* node,
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand,
+                                          DefineAsDualLocation)
+  InstructionOperand DefineAsDualLocation(node_t node,
                                           LinkageLocation primary_location,
                                           LinkageLocation secondary_location) {
     return Define(node,
@@ -124,63 +159,81 @@ class OperandGenerator {
                       primary_location, secondary_location, GetVReg(node)));
   }
 
-  InstructionOperand Use(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, Use)
+  InstructionOperand Use(node_t node) {
     return Use(node, UnallocatedOperand(UnallocatedOperand::NONE,
                                         UnallocatedOperand::USED_AT_START,
                                         GetVReg(node)));
   }
 
-  InstructionOperand UseAnyAtEnd(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseAnyAtEnd)
+  InstructionOperand UseAnyAtEnd(node_t node) {
     return Use(node, UnallocatedOperand(UnallocatedOperand::REGISTER_OR_SLOT,
                                         UnallocatedOperand::USED_AT_END,
                                         GetVReg(node)));
   }
 
-  InstructionOperand UseAny(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseAny)
+  InstructionOperand UseAny(node_t node) {
     return Use(node, UnallocatedOperand(UnallocatedOperand::REGISTER_OR_SLOT,
                                         UnallocatedOperand::USED_AT_START,
                                         GetVReg(node)));
   }
 
-  InstructionOperand UseRegisterOrSlotOrConstant(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand,
+                                          UseRegisterOrSlotOrConstant)
+  InstructionOperand UseRegisterOrSlotOrConstant(node_t node) {
     return Use(node, UnallocatedOperand(
                          UnallocatedOperand::REGISTER_OR_SLOT_OR_CONSTANT,
                          UnallocatedOperand::USED_AT_START, GetVReg(node)));
   }
 
-  InstructionOperand UseUniqueRegisterOrSlotOrConstant(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand,
+                                          UseUniqueRegisterOrSlotOrConstant)
+  InstructionOperand UseUniqueRegisterOrSlotOrConstant(node_t node) {
     return Use(node, UnallocatedOperand(
                          UnallocatedOperand::REGISTER_OR_SLOT_OR_CONSTANT,
                          GetVReg(node)));
   }
 
-  InstructionOperand UseRegister(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseRegister)
+  InstructionOperand UseRegister(node_t node) {
     return Use(node, UnallocatedOperand(UnallocatedOperand::MUST_HAVE_REGISTER,
                                         UnallocatedOperand::USED_AT_START,
                                         GetVReg(node)));
   }
 
-  InstructionOperand UseUniqueSlot(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseRegisterAtEnd)
+  InstructionOperand UseRegisterAtEnd(node_t node) {
+    return Use(node, UnallocatedOperand(UnallocatedOperand::MUST_HAVE_REGISTER,
+                                        UnallocatedOperand::USED_AT_END,
+                                        GetVReg(node)));
+  }
+
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseUniqueSlot)
+  InstructionOperand UseUniqueSlot(node_t node) {
     return Use(node, UnallocatedOperand(UnallocatedOperand::MUST_HAVE_SLOT,
                                         GetVReg(node)));
   }
 
   // Use register or operand for the node. If a register is chosen, it won't
   // alias any temporary or output registers.
-  InstructionOperand UseUnique(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseUnique)
+  InstructionOperand UseUnique(node_t node) {
     return Use(node,
                UnallocatedOperand(UnallocatedOperand::NONE, GetVReg(node)));
   }
 
   // Use a unique register for the node that does not alias any temporary or
   // output registers.
-  InstructionOperand UseUniqueRegister(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseUniqueRegister)
+  InstructionOperand UseUniqueRegister(node_t node) {
     return Use(node, UnallocatedOperand(UnallocatedOperand::MUST_HAVE_REGISTER,
                                         GetVReg(node)));
   }
 
   enum class RegisterUseKind { kUseRegister, kUseUniqueRegister };
-  InstructionOperand UseRegister(Node* node, RegisterUseKind unique_reg) {
+  InstructionOperand UseRegister(node_t node, RegisterUseKind unique_reg) {
     if (V8_LIKELY(unique_reg == RegisterUseKind::kUseRegister)) {
       return UseRegister(node);
     } else {
@@ -189,13 +242,14 @@ class OperandGenerator {
     }
   }
 
-  InstructionOperand UseFixed(Node* node, Register reg) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseFixed)
+  InstructionOperand UseFixed(node_t node, Register reg) {
     return Use(node, UnallocatedOperand(UnallocatedOperand::FIXED_REGISTER,
                                         reg.code(), GetVReg(node)));
   }
 
   template <typename FPRegType>
-  InstructionOperand UseFixed(Node* node, FPRegType reg) {
+  InstructionOperand UseFixed(node_t node, FPRegType reg) {
     return Use(node, UnallocatedOperand(UnallocatedOperand::FIXED_FP_REGISTER,
                                         reg.code(), GetVReg(node)));
   }
@@ -208,15 +262,19 @@ class OperandGenerator {
     return sequence()->AddImmediate(Constant(immediate));
   }
 
-  InstructionOperand UseImmediate(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseImmediate)
+  InstructionOperand UseImmediate(node_t node) {
     return sequence()->AddImmediate(ToConstant(node));
   }
 
-  InstructionOperand UseNegatedImmediate(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand,
+                                          UseNegatedImmediate)
+  InstructionOperand UseNegatedImmediate(node_t node) {
     return sequence()->AddImmediate(ToNegatedConstant(node));
   }
 
-  InstructionOperand UseLocation(Node* node, LinkageLocation location) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, UseLocation)
+  InstructionOperand UseLocation(node_t node, LinkageLocation location) {
     return Use(node, ToUnallocatedOperand(location, GetVReg(node)));
   }
 
@@ -259,7 +317,9 @@ class OperandGenerator {
     kUniqueRegister,
   };
 
-  InstructionOperand UseRegisterWithMode(Node* node,
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand,
+                                          UseRegisterWithMode)
+  InstructionOperand UseRegisterWithMode(node_t node,
                                          RegisterMode register_mode) {
     return register_mode == kRegister ? UseRegister(node)
                                       : UseUniqueRegister(node);
@@ -283,6 +343,15 @@ class OperandGenerator {
     return op;
   }
 
+  InstructionOperand TempSimd256Register() {
+    UnallocatedOperand op = UnallocatedOperand(
+        UnallocatedOperand::MUST_HAVE_REGISTER,
+        UnallocatedOperand::USED_AT_START, sequence()->NextVirtualRegister());
+    sequence()->MarkAsRepresentation(MachineRepresentation::kSimd256,
+                                     op.virtual_register());
+    return op;
+  }
+
   InstructionOperand TempRegister(Register reg) {
     return UnallocatedOperand(UnallocatedOperand::FIXED_REGISTER, reg.code(),
                               InstructionOperand::kInvalidVirtualRegister);
@@ -311,108 +380,157 @@ class OperandGenerator {
     return ToUnallocatedOperand(location, sequence()->NextVirtualRegister());
   }
 
-  InstructionOperand Label(BasicBlock* block) {
-    return sequence()->AddImmediate(
-        Constant(RpoNumber::FromInt(block->rpo_number())));
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(InstructionOperand, Label)
+  InstructionOperand Label(block_t block) {
+    return sequence()->AddImmediate(Constant(this->rpo_number(block)));
   }
 
  protected:
-  InstructionSelector* selector() const { return selector_; }
+  InstructionSelectorT<Adapter>* selector() const { return selector_; }
   InstructionSequence* sequence() const { return selector()->sequence(); }
   Zone* zone() const { return selector()->instruction_zone(); }
 
  private:
-  int GetVReg(Node* node) const { return selector_->GetVirtualRegister(node); }
-
-  static Constant ToConstant(const Node* node) {
-    switch (node->opcode()) {
-      case IrOpcode::kInt32Constant:
-        return Constant(OpParameter<int32_t>(node->op()));
-      case IrOpcode::kInt64Constant:
-        return Constant(OpParameter<int64_t>(node->op()));
-      case IrOpcode::kTaggedIndexConstant: {
-        // Unencoded index value.
-        intptr_t value =
-            static_cast<intptr_t>(OpParameter<int32_t>(node->op()));
-        DCHECK(TaggedIndex::IsValid(value));
-        // Generate it as 32/64-bit constant in a tagged form.
-        Address tagged_index = TaggedIndex::FromIntptr(value).ptr();
-        if (kSystemPointerSize == kInt32Size) {
-          return Constant(static_cast<int32_t>(tagged_index));
-        } else {
-          return Constant(static_cast<int64_t>(tagged_index));
+  int GetVReg(node_t node) const { return selector_->GetVirtualRegister(node); }
+
+  Constant ToConstant(node_t node) {
+    if constexpr (Adapter::IsTurboshaft) {
+      using Kind = turboshaft::ConstantOp::Kind;
+      if (const turboshaft::ConstantOp* constant =
+              this->turboshaft_graph()
+                  ->Get(node)
+                  .template TryCast<turboshaft::ConstantOp>()) {
+        switch (constant->kind) {
+          case Kind::kWord32:
+            return Constant(static_cast<int32_t>(constant->word32()));
+          case Kind::kWord64:
+            return Constant(static_cast<int64_t>(constant->word64()));
+          case Kind::kHeapObject:
+          case Kind::kCompressedHeapObject:
+            return Constant(constant->handle(),
+                            constant->kind == Kind::kCompressedHeapObject);
+          case Kind::kExternal:
+            return Constant(constant->external_reference());
+          case Kind::kNumber:
+            return Constant(constant->number());
+          case Kind::kFloat32:
+            return Constant(constant->float32());
+          case Kind::kFloat64:
+            return Constant(constant->float64());
+          case Kind::kTaggedIndex: {
+            // Unencoded index value.
+            intptr_t value = static_cast<intptr_t>(constant->tagged_index());
+            DCHECK(TaggedIndex::IsValid(value));
+            // Generate it as 32/64-bit constant in a tagged form.
+            Address tagged_index = TaggedIndex::FromIntptr(value).ptr();
+            if (kSystemPointerSize == kInt32Size) {
+              return Constant(static_cast<int32_t>(tagged_index));
+            } else {
+              return Constant(static_cast<int64_t>(tagged_index));
+            }
+          }
+          case Kind::kRelocatableWasmCall:
+          case Kind::kRelocatableWasmStubCall: {
+            uint64_t value = constant->integral();
+            auto mode = constant->kind == Kind::kRelocatableWasmCall
+                            ? RelocInfo::WASM_CALL
+                            : RelocInfo::WASM_STUB_CALL;
+            if (Is64()) {
+              return Constant(RelocatablePtrConstantInfo(
+                  base::checked_cast<int64_t>(value), mode));
+            } else {
+              return Constant(RelocatablePtrConstantInfo(
+                  base::checked_cast<int32_t>(value), mode));
+            }
+          }
         }
       }
-      case IrOpcode::kFloat32Constant:
-        return Constant(OpParameter<float>(node->op()));
-      case IrOpcode::kRelocatableInt32Constant:
-      case IrOpcode::kRelocatableInt64Constant:
-        return Constant(OpParameter<RelocatablePtrConstantInfo>(node->op()));
-      case IrOpcode::kFloat64Constant:
-      case IrOpcode::kNumberConstant:
-        return Constant(OpParameter<double>(node->op()));
-      case IrOpcode::kExternalConstant:
-        return Constant(OpParameter<ExternalReference>(node->op()));
-      case IrOpcode::kComment: {
-        // We cannot use {intptr_t} here, since the Constant constructor would
-        // be ambiguous on some architectures.
-        using ptrsize_int_t =
-            std::conditional<kSystemPointerSize == 8, int64_t, int32_t>::type;
-        return Constant(reinterpret_cast<ptrsize_int_t>(
-            OpParameter<const char*>(node->op())));
-      }
-      case IrOpcode::kHeapConstant:
-        return Constant(HeapConstantOf(node->op()));
-      case IrOpcode::kCompressedHeapConstant:
-        return Constant(HeapConstantOf(node->op()), true);
-      case IrOpcode::kDeadValue: {
-        switch (DeadValueRepresentationOf(node->op())) {
-          case MachineRepresentation::kBit:
-          case MachineRepresentation::kWord32:
-          case MachineRepresentation::kTagged:
-          case MachineRepresentation::kTaggedSigned:
-          case MachineRepresentation::kTaggedPointer:
-          case MachineRepresentation::kCompressed:
-          case MachineRepresentation::kCompressedPointer:
-            return Constant(static_cast<int32_t>(0));
-          case MachineRepresentation::kWord64:
-            return Constant(static_cast<int64_t>(0));
-          case MachineRepresentation::kFloat64:
-            return Constant(static_cast<double>(0));
-          case MachineRepresentation::kFloat32:
-            return Constant(static_cast<float>(0));
-          default:
-            UNREACHABLE();
+      UNREACHABLE();
+    } else {
+      switch (node->opcode()) {
+        case IrOpcode::kInt32Constant:
+          return Constant(OpParameter<int32_t>(node->op()));
+        case IrOpcode::kInt64Constant:
+          return Constant(OpParameter<int64_t>(node->op()));
+        case IrOpcode::kTaggedIndexConstant: {
+          // Unencoded index value.
+          intptr_t value =
+              static_cast<intptr_t>(OpParameter<int32_t>(node->op()));
+          DCHECK(TaggedIndex::IsValid(value));
+          // Generate it as 32/64-bit constant in a tagged form.
+          Address tagged_index = TaggedIndex::FromIntptr(value).ptr();
+          if (kSystemPointerSize == kInt32Size) {
+            return Constant(static_cast<int32_t>(tagged_index));
+          } else {
+            return Constant(static_cast<int64_t>(tagged_index));
+          }
+        }
+        case IrOpcode::kFloat32Constant:
+          return Constant(OpParameter<float>(node->op()));
+        case IrOpcode::kRelocatableInt32Constant:
+        case IrOpcode::kRelocatableInt64Constant:
+          return Constant(OpParameter<RelocatablePtrConstantInfo>(node->op()));
+        case IrOpcode::kFloat64Constant:
+        case IrOpcode::kNumberConstant:
+          return Constant(OpParameter<double>(node->op()));
+        case IrOpcode::kExternalConstant:
+          return Constant(OpParameter<ExternalReference>(node->op()));
+        case IrOpcode::kComment: {
+          // We cannot use {intptr_t} here, since the Constant constructor would
+          // be ambiguous on some architectures.
+          using ptrsize_int_t =
+              std::conditional<kSystemPointerSize == 8, int64_t, int32_t>::type;
+          return Constant(reinterpret_cast<ptrsize_int_t>(
+              OpParameter<const char*>(node->op())));
+        }
+        case IrOpcode::kHeapConstant:
+          return Constant(HeapConstantOf(node->op()));
+        case IrOpcode::kCompressedHeapConstant:
+          return Constant(HeapConstantOf(node->op()), true);
+        case IrOpcode::kDeadValue: {
+          switch (DeadValueRepresentationOf(node->op())) {
+            case MachineRepresentation::kBit:
+            case MachineRepresentation::kWord32:
+            case MachineRepresentation::kTagged:
+            case MachineRepresentation::kTaggedSigned:
+            case MachineRepresentation::kTaggedPointer:
+            case MachineRepresentation::kCompressed:
+            case MachineRepresentation::kCompressedPointer:
+              return Constant(static_cast<int32_t>(0));
+            case MachineRepresentation::kWord64:
+              return Constant(static_cast<int64_t>(0));
+            case MachineRepresentation::kFloat64:
+              return Constant(static_cast<double>(0));
+            case MachineRepresentation::kFloat32:
+              return Constant(static_cast<float>(0));
+            default:
+              UNREACHABLE();
+          }
+          break;
         }
-        break;
+        default:
+          break;
       }
-      default:
-        break;
     }
     UNREACHABLE();
   }
 
-  static Constant ToNegatedConstant(const Node* node) {
-    switch (node->opcode()) {
-      case IrOpcode::kInt32Constant:
-        return Constant(-OpParameter<int32_t>(node->op()));
-      case IrOpcode::kInt64Constant:
-        return Constant(-OpParameter<int64_t>(node->op()));
-      default:
-        break;
-    }
-    UNREACHABLE();
+  Constant ToNegatedConstant(node_t node) {
+    auto constant = this->constant_view(node);
+    if (constant.is_int32()) return Constant(-constant.int32_value());
+    DCHECK(constant.is_int64());
+    return Constant(-constant.int64_value());
   }
 
-  UnallocatedOperand Define(Node* node, UnallocatedOperand operand) {
-    DCHECK_NOT_NULL(node);
+  UnallocatedOperand Define(node_t node, UnallocatedOperand operand) {
+    DCHECK(this->valid(node));
     DCHECK_EQ(operand.virtual_register(), GetVReg(node));
     selector()->MarkAsDefined(node);
     return operand;
   }
 
-  UnallocatedOperand Use(Node* node, UnallocatedOperand operand) {
-    DCHECK_NOT_NULL(node);
+  UnallocatedOperand Use(node_t node, UnallocatedOperand operand) {
+    DCHECK(this->valid(node));
     DCHECK_EQ(operand.virtual_register(), GetVReg(node));
     selector()->MarkAsUsed(node);
     return operand;
@@ -456,7 +574,7 @@ class OperandGenerator {
                               location.AsRegister(), virtual_register);
   }
 
-  InstructionSelector* selector_;
+  InstructionSelectorT<Adapter>* selector_;
 };
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/backend/instruction-selector.cc b/deps/v8/src/compiler/backend/instruction-selector.cc
index 8118e32f973c39..ce06089ec0af2d 100644
--- a/deps/v8/src/compiler/backend/instruction-selector.cc
+++ b/deps/v8/src/compiler/backend/instruction-selector.cc
@@ -7,17 +7,21 @@
 #include <limits>
 
 #include "src/base/iterator.h"
-#include "src/codegen/assembler-inl.h"
-#include "src/codegen/interface-descriptors-inl.h"
+#include "src/codegen/machine-type.h"
 #include "src/codegen/tick-counter.h"
 #include "src/common/globals.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
+#include "src/compiler/backend/instruction.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/compiler-source-position-table.h"
+#include "src/compiler/graph.h"
 #include "src/compiler/js-heap-broker.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/schedule.h"
 #include "src/compiler/state-values-utils.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/representations.h"
+#include "src/numbers/conversions-inl.h"
 
 #if V8_ENABLE_WEBASSEMBLY
 #include "src/wasm/simd-shuffle.h"
@@ -27,25 +31,40 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-Smi NumberConstantToSmi(Node* node) {
+#define VISIT_UNSUPPORTED_OP(op)                          \
+  template <typename Adapter>                             \
+  void InstructionSelectorT<Adapter>::Visit##op(node_t) { \
+    UNIMPLEMENTED();                                      \
+  }
+
+namespace {
+const turboshaft::EffectDimensions::Bits kTurboshaftEffectLevelMask =
+    turboshaft::OpEffects().CanReadMemory().produces.bits();
+}
+
+Tagged<Smi> NumberConstantToSmi(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kNumberConstant);
   const double d = OpParameter<double>(node->op());
-  Smi smi = Smi::FromInt(static_cast<int32_t>(d));
+  Tagged<Smi> smi = Smi::FromInt(static_cast<int32_t>(d));
   CHECK_EQ(smi.value(), d);
   return smi;
 }
 
-InstructionSelector::InstructionSelector(
+template <typename Adapter>
+InstructionSelectorT<Adapter>::InstructionSelectorT(
     Zone* zone, size_t node_count, Linkage* linkage,
-    InstructionSequence* sequence, Schedule* schedule,
-    SourcePositionTable* source_positions, Frame* frame,
-    EnableSwitchJumpTable enable_switch_jump_table, TickCounter* tick_counter,
-    JSHeapBroker* broker, size_t* max_unoptimized_frame_height,
-    size_t* max_pushed_argument_count, SourcePositionMode source_position_mode,
-    Features features, EnableScheduling enable_scheduling,
-    EnableRootsRelativeAddressing enable_roots_relative_addressing,
-    EnableTraceTurboJson trace_turbo)
-    : zone_(zone),
+    InstructionSequence* sequence, schedule_t schedule,
+    source_position_table_t* source_positions, Frame* frame,
+    InstructionSelector::EnableSwitchJumpTable enable_switch_jump_table,
+    TickCounter* tick_counter, JSHeapBroker* broker,
+    size_t* max_unoptimized_frame_height, size_t* max_pushed_argument_count,
+    InstructionSelector::SourcePositionMode source_position_mode,
+    Features features, InstructionSelector::EnableScheduling enable_scheduling,
+    InstructionSelector::EnableRootsRelativeAddressing
+        enable_roots_relative_addressing,
+    InstructionSelector::EnableTraceTurboJson trace_turbo)
+    : Adapter(schedule),
+      zone_(zone),
       linkage_(linkage),
       sequence_(sequence),
       source_positions_(source_positions),
@@ -81,35 +100,41 @@ InstructionSelector::InstructionSelector(
       phi_states_(node_count, Upper32BitsState::kNotYetChecked, zone)
 #endif
 {
+  if constexpr (Adapter::IsTurboshaft) {
+    turboshaft_use_map_.emplace(*schedule_, zone);
+  }
+
   DCHECK_EQ(*max_unoptimized_frame_height, 0);  // Caller-initialized.
 
   instructions_.reserve(node_count);
   continuation_inputs_.reserve(5);
   continuation_outputs_.reserve(2);
 
-  if (trace_turbo_ == kEnableTraceTurboJson) {
+  if (trace_turbo_ == InstructionSelector::kEnableTraceTurboJson) {
     instr_origins_.assign(node_count, {-1, 0});
   }
 }
 
-base::Optional<BailoutReason> InstructionSelector::SelectInstructions() {
+template <typename Adapter>
+base::Optional<BailoutReason>
+InstructionSelectorT<Adapter>::SelectInstructions() {
   // Mark the inputs of all phis in loop headers as used.
-  BasicBlockVector* blocks = schedule()->rpo_order();
-  for (auto const block : *blocks) {
-    if (!block->IsLoopHeader()) continue;
-    DCHECK_LE(2u, block->PredecessorCount());
-    for (Node* const phi : *block) {
-      if (phi->opcode() != IrOpcode::kPhi) continue;
+  block_range_t blocks = this->rpo_order(schedule());
+  for (const block_t block : blocks) {
+    if (!this->IsLoopHeader(block)) continue;
+    DCHECK_LE(2u, this->PredecessorCount(block));
+    for (node_t node : this->nodes(block)) {
+      if (!this->IsPhi(node)) continue;
 
       // Mark all inputs as used.
-      for (Node* const input : phi->inputs()) {
+      for (node_t input : this->inputs(node)) {
         MarkAsUsed(input);
       }
     }
   }
 
   // Visit each basic block in post order.
-  for (auto i = blocks->rbegin(); i != blocks->rend(); ++i) {
+  for (auto i = blocks.rbegin(); i != blocks.rend(); ++i) {
     VisitBlock(*i);
     if (instruction_selection_failed())
       return BailoutReason::kCodeGenerationFailed;
@@ -117,19 +142,19 @@ base::Optional<BailoutReason> InstructionSelector::SelectInstructions() {
 
   // Schedule the selected instructions.
   if (UseInstructionScheduling()) {
-    scheduler_ = zone()->New<InstructionScheduler>(zone(), sequence());
+    scheduler_ = zone()->template New<InstructionScheduler>(zone(), sequence());
   }
 
-  for (auto const block : *blocks) {
+  for (const block_t block : blocks) {
     InstructionBlock* instruction_block =
-        sequence()->InstructionBlockAt(RpoNumber::FromInt(block->rpo_number()));
+        sequence()->InstructionBlockAt(this->rpo_number(block));
     for (size_t i = 0; i < instruction_block->phis().size(); i++) {
       UpdateRenamesInPhi(instruction_block->PhiAt(i));
     }
     size_t end = instruction_block->code_end();
     size_t start = instruction_block->code_start();
     DCHECK_LE(end, start);
-    StartBlock(RpoNumber::FromInt(block->rpo_number()));
+    StartBlock(this->rpo_number(block));
     if (end != start) {
       while (start-- > end + 1) {
         UpdateRenames(instructions_[start]);
@@ -138,7 +163,7 @@ base::Optional<BailoutReason> InstructionSelector::SelectInstructions() {
       UpdateRenames(instructions_[end]);
       AddTerminator(instructions_[end]);
     }
-    EndBlock(RpoNumber::FromInt(block->rpo_number()));
+    EndBlock(this->rpo_number(block));
   }
 #if DEBUG
   sequence()->ValidateSSA();
@@ -146,7 +171,8 @@ base::Optional<BailoutReason> InstructionSelector::SelectInstructions() {
   return base::nullopt;
 }
 
-void InstructionSelector::StartBlock(RpoNumber rpo) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::StartBlock(RpoNumber rpo) {
   if (UseInstructionScheduling()) {
     DCHECK_NOT_NULL(scheduler_);
     scheduler_->StartBlock(rpo);
@@ -155,7 +181,8 @@ void InstructionSelector::StartBlock(RpoNumber rpo) {
   }
 }
 
-void InstructionSelector::EndBlock(RpoNumber rpo) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EndBlock(RpoNumber rpo) {
   if (UseInstructionScheduling()) {
     DCHECK_NOT_NULL(scheduler_);
     scheduler_->EndBlock(rpo);
@@ -164,7 +191,8 @@ void InstructionSelector::EndBlock(RpoNumber rpo) {
   }
 }
 
-void InstructionSelector::AddTerminator(Instruction* instr) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddTerminator(Instruction* instr) {
   if (UseInstructionScheduling()) {
     DCHECK_NOT_NULL(scheduler_);
     scheduler_->AddTerminator(instr);
@@ -173,7 +201,8 @@ void InstructionSelector::AddTerminator(Instruction* instr) {
   }
 }
 
-void InstructionSelector::AddInstruction(Instruction* instr) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddInstruction(Instruction* instr) {
   if (UseInstructionScheduling()) {
     DCHECK_NOT_NULL(scheduler_);
     scheduler_->AddInstruction(instr);
@@ -182,27 +211,29 @@ void InstructionSelector::AddInstruction(Instruction* instr) {
   }
 }
 
-Instruction* InstructionSelector::Emit(InstructionCode opcode,
-                                       InstructionOperand output,
-                                       size_t temp_count,
-                                       InstructionOperand* temps) {
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(InstructionCode opcode,
+                                                 InstructionOperand output,
+                                                 size_t temp_count,
+                                                 InstructionOperand* temps) {
   size_t output_count = output.IsInvalid() ? 0 : 1;
   return Emit(opcode, output_count, &output, 0, nullptr, temp_count, temps);
 }
 
-Instruction* InstructionSelector::Emit(InstructionCode opcode,
-                                       InstructionOperand output,
-                                       InstructionOperand a, size_t temp_count,
-                                       InstructionOperand* temps) {
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(InstructionCode opcode,
+                                                 InstructionOperand output,
+                                                 InstructionOperand a,
+                                                 size_t temp_count,
+                                                 InstructionOperand* temps) {
   size_t output_count = output.IsInvalid() ? 0 : 1;
   return Emit(opcode, output_count, &output, 1, &a, temp_count, temps);
 }
 
-Instruction* InstructionSelector::Emit(InstructionCode opcode,
-                                       InstructionOperand output,
-                                       InstructionOperand a,
-                                       InstructionOperand b, size_t temp_count,
-                                       InstructionOperand* temps) {
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(
+    InstructionCode opcode, InstructionOperand output, InstructionOperand a,
+    InstructionOperand b, size_t temp_count, InstructionOperand* temps) {
   size_t output_count = output.IsInvalid() ? 0 : 1;
   InstructionOperand inputs[] = {a, b};
   size_t input_count = arraysize(inputs);
@@ -210,12 +241,11 @@ Instruction* InstructionSelector::Emit(InstructionCode opcode,
               temps);
 }
 
-Instruction* InstructionSelector::Emit(InstructionCode opcode,
-                                       InstructionOperand output,
-                                       InstructionOperand a,
-                                       InstructionOperand b,
-                                       InstructionOperand c, size_t temp_count,
-                                       InstructionOperand* temps) {
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(
+    InstructionCode opcode, InstructionOperand output, InstructionOperand a,
+    InstructionOperand b, InstructionOperand c, size_t temp_count,
+    InstructionOperand* temps) {
   size_t output_count = output.IsInvalid() ? 0 : 1;
   InstructionOperand inputs[] = {a, b, c};
   size_t input_count = arraysize(inputs);
@@ -223,7 +253,8 @@ Instruction* InstructionSelector::Emit(InstructionCode opcode,
               temps);
 }
 
-Instruction* InstructionSelector::Emit(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(
     InstructionCode opcode, InstructionOperand output, InstructionOperand a,
     InstructionOperand b, InstructionOperand c, InstructionOperand d,
     size_t temp_count, InstructionOperand* temps) {
@@ -234,7 +265,8 @@ Instruction* InstructionSelector::Emit(
               temps);
 }
 
-Instruction* InstructionSelector::Emit(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(
     InstructionCode opcode, InstructionOperand output, InstructionOperand a,
     InstructionOperand b, InstructionOperand c, InstructionOperand d,
     InstructionOperand e, size_t temp_count, InstructionOperand* temps) {
@@ -245,7 +277,8 @@ Instruction* InstructionSelector::Emit(
               temps);
 }
 
-Instruction* InstructionSelector::Emit(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(
     InstructionCode opcode, InstructionOperand output, InstructionOperand a,
     InstructionOperand b, InstructionOperand c, InstructionOperand d,
     InstructionOperand e, InstructionOperand f, size_t temp_count,
@@ -257,7 +290,21 @@ Instruction* InstructionSelector::Emit(
               temps);
 }
 
-Instruction* InstructionSelector::Emit(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(
+    InstructionCode opcode, InstructionOperand output, InstructionOperand a,
+    InstructionOperand b, InstructionOperand c, InstructionOperand d,
+    InstructionOperand e, InstructionOperand f, InstructionOperand g,
+    InstructionOperand h, size_t temp_count, InstructionOperand* temps) {
+  size_t output_count = output.IsInvalid() ? 0 : 1;
+  InstructionOperand inputs[] = {a, b, c, d, e, f, g, h};
+  size_t input_count = arraysize(inputs);
+  return Emit(opcode, output_count, &output, input_count, inputs, temp_count,
+              temps);
+}
+
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(
     InstructionCode opcode, size_t output_count, InstructionOperand* outputs,
     size_t input_count, InstructionOperand* inputs, size_t temp_count,
     InstructionOperand* temps) {
@@ -274,54 +321,81 @@ Instruction* InstructionSelector::Emit(
   return Emit(instr);
 }
 
-Instruction* InstructionSelector::Emit(Instruction* instr) {
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::Emit(Instruction* instr) {
   instructions_.push_back(instr);
   return instr;
 }
 
-bool InstructionSelector::CanCover(Node* user, Node* node) const {
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::CanCover(node_t user, node_t node) const {
   // 1. Both {user} and {node} must be in the same basic block.
-  if (schedule()->block(node) != current_block_) {
+  if (this->block(schedule(), node) != current_block_) {
     return false;
   }
-  // 2. Pure {node}s must be owned by the {user}.
-  if (node->op()->HasProperty(Operator::kPure)) {
-    return node->OwnedBy(user);
+
+  if constexpr (Adapter::IsTurboshaft) {
+    const turboshaft::Operation& op = this->Get(node);
+    // 2. If node does not produce anything, it can be covered.
+    if (op.Effects().produces.bits() == 0) {
+      return this->is_exclusive_user_of(user, node);
+    }
+    // If it does produce something outside the {kTurboshaftEffectLevelMask}, it
+    // can never be covered.
+    if ((op.Effects().produces.bits() & ~kTurboshaftEffectLevelMask) != 0) {
+      return false;
+    }
+  } else {
+    // 2. Pure {node}s must be owned by the {user}.
+    if (node->op()->HasProperty(Operator::kPure)) {
+      return node->OwnedBy(user);
+    }
   }
-  // 3. Impure {node}s must match the effect level of {user}.
+
+  // 3. Otherwise, the {node}'s effect level must match the {user}'s.
   if (GetEffectLevel(node) != current_effect_level_) {
     return false;
   }
+
   // 4. Only {node} must have value edges pointing to {user}.
-  for (Edge const edge : node->use_edges()) {
-    if (edge.from() != user && NodeProperties::IsValueEdge(edge)) {
-      return false;
-    }
-  }
-  return true;
+  return this->is_exclusive_user_of(user, node);
 }
 
-bool InstructionSelector::IsOnlyUserOfNodeInSameBlock(Node* user,
-                                                      Node* node) const {
-  BasicBlock* bb_user = schedule()->block(user);
-  BasicBlock* bb_node = schedule()->block(node);
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsOnlyUserOfNodeInSameBlock(
+    node_t user, node_t node) const {
+  block_t bb_user = this->block(schedule(), user);
+  block_t bb_node = this->block(schedule(), node);
   if (bb_user != bb_node) return false;
-  for (Edge const edge : node->use_edges()) {
-    Node* from = edge.from();
-    if ((from != user) && (schedule()->block(from) == bb_user)) {
-      return false;
+
+  if constexpr (Adapter::IsTurboshaft) {
+    const turboshaft::Operation& node_op = this->turboshaft_graph()->Get(node);
+    if (node_op.saturated_use_count.Get() == 1) return true;
+    for (turboshaft::OpIndex use : turboshaft_uses(node)) {
+      if (use == user) continue;
+      if (this->block(schedule(), use) == bb_user) return false;
+    }
+    return true;
+  } else {
+    for (Edge const edge : node->use_edges()) {
+      Node* from = edge.from();
+      if ((from != user) && (this->block(schedule(), from) == bb_user)) {
+        return false;
+      }
     }
   }
   return true;
 }
 
-void InstructionSelector::UpdateRenames(Instruction* instruction) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::UpdateRenames(Instruction* instruction) {
   for (size_t i = 0; i < instruction->InputCount(); i++) {
     TryRename(instruction->InputAt(i));
   }
 }
 
-void InstructionSelector::UpdateRenamesInPhi(PhiInstruction* phi) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::UpdateRenamesInPhi(PhiInstruction* phi) {
   for (size_t i = 0; i < phi->operands().size(); i++) {
     int vreg = phi->operands()[i];
     int renamed = GetRename(vreg);
@@ -331,7 +405,8 @@ void InstructionSelector::UpdateRenamesInPhi(PhiInstruction* phi) {
   }
 }
 
-int InstructionSelector::GetRename(int virtual_register) {
+template <typename Adapter>
+int InstructionSelectorT<Adapter>::GetRename(int virtual_register) {
   int rename = virtual_register;
   while (true) {
     if (static_cast<size_t>(rename) >= virtual_register_rename_.size()) break;
@@ -344,7 +419,8 @@ int InstructionSelector::GetRename(int virtual_register) {
   return rename;
 }
 
-void InstructionSelector::TryRename(InstructionOperand* op) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::TryRename(InstructionOperand* op) {
   if (!op->IsUnallocated()) return;
   UnallocatedOperand* unalloc = UnallocatedOperand::cast(op);
   int vreg = unalloc->virtual_register();
@@ -354,7 +430,8 @@ void InstructionSelector::TryRename(InstructionOperand* op) {
   }
 }
 
-void InstructionSelector::SetRename(const Node* node, const Node* rename) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::SetRename(node_t node, node_t rename) {
   int vreg = GetVirtualRegister(node);
   if (static_cast<size_t>(vreg) >= virtual_register_rename_.size()) {
     int invalid = InstructionOperand::kInvalidVirtualRegister;
@@ -363,9 +440,10 @@ void InstructionSelector::SetRename(const Node* node, const Node* rename) {
   virtual_register_rename_[vreg] = GetVirtualRegister(rename);
 }
 
-int InstructionSelector::GetVirtualRegister(const Node* node) {
-  DCHECK_NOT_NULL(node);
-  size_t const id = node->id();
+template <typename Adapter>
+int InstructionSelectorT<Adapter>::GetVirtualRegister(node_t node) {
+  DCHECK(this->valid(node));
+  size_t const id = this->id(node);
   DCHECK_LT(id, virtual_registers_.size());
   int virtual_register = virtual_registers_[id];
   if (virtual_register == InstructionOperand::kInvalidVirtualRegister) {
@@ -375,8 +453,9 @@ int InstructionSelector::GetVirtualRegister(const Node* node) {
   return virtual_register;
 }
 
-const std::map<NodeId, int> InstructionSelector::GetVirtualRegistersForTesting()
-    const {
+template <typename Adapter>
+const std::map<NodeId, int>
+InstructionSelectorT<Adapter>::GetVirtualRegistersForTesting() const {
   std::map<NodeId, int> virtual_registers;
   for (size_t n = 0; n < virtual_registers_.size(); ++n) {
     if (virtual_registers_[n] != InstructionOperand::kInvalidVirtualRegister) {
@@ -387,53 +466,63 @@ const std::map<NodeId, int> InstructionSelector::GetVirtualRegistersForTesting()
   return virtual_registers;
 }
 
-bool InstructionSelector::IsDefined(Node* node) const {
-  DCHECK_NOT_NULL(node);
-  return defined_.Contains(node->id());
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsDefined(node_t node) const {
+  DCHECK(this->valid(node));
+  return defined_.Contains(this->id(node));
 }
 
-void InstructionSelector::MarkAsDefined(Node* node) {
-  DCHECK_NOT_NULL(node);
-  defined_.Add(node->id());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::MarkAsDefined(node_t node) {
+  DCHECK(this->valid(node));
+  defined_.Add(this->id(node));
 }
 
-bool InstructionSelector::IsUsed(Node* node) const {
-  DCHECK_NOT_NULL(node);
-  // TODO(bmeurer): This is a terrible monster hack, but we have to make sure
-  // that the Retain is actually emitted, otherwise the GC will mess up.
-  if (node->opcode() == IrOpcode::kRetain) return true;
-  if (!node->op()->HasProperty(Operator::kEliminatable)) return true;
-  return used_.Contains(node->id());
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsUsed(node_t node) const {
+  DCHECK(this->valid(node));
+  if constexpr (Adapter::IsTurbofan) {
+    // TODO(bmeurer): This is a terrible monster hack, but we have to make sure
+    // that the Retain is actually emitted, otherwise the GC will mess up.
+    if (this->IsRetain(node)) return true;
+  }
+  if (this->IsRequiredWhenUnused(node)) return true;
+  return used_.Contains(this->id(node));
 }
 
-void InstructionSelector::MarkAsUsed(Node* node) {
-  DCHECK_NOT_NULL(node);
-  used_.Add(node->id());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::MarkAsUsed(node_t node) {
+  DCHECK(this->valid(node));
+  used_.Add(this->id(node));
 }
 
-int InstructionSelector::GetEffectLevel(Node* node) const {
-  DCHECK_NOT_NULL(node);
-  size_t const id = node->id();
+template <typename Adapter>
+int InstructionSelectorT<Adapter>::GetEffectLevel(node_t node) const {
+  DCHECK(this->valid(node));
+  size_t const id = this->id(node);
   DCHECK_LT(id, effect_level_.size());
   return effect_level_[id];
 }
 
-int InstructionSelector::GetEffectLevel(Node* node,
-                                        FlagsContinuation* cont) const {
-  return cont->IsBranch()
-             ? GetEffectLevel(
-                   cont->true_block()->PredecessorAt(0)->control_input())
-             : GetEffectLevel(node);
+template <typename Adapter>
+int InstructionSelectorT<Adapter>::GetEffectLevel(
+    node_t node, FlagsContinuation* cont) const {
+  return cont->IsBranch() ? GetEffectLevel(this->block_terminator(
+                                this->PredecessorAt(cont->true_block(), 0)))
+                          : GetEffectLevel(node);
 }
 
-void InstructionSelector::SetEffectLevel(Node* node, int effect_level) {
-  DCHECK_NOT_NULL(node);
-  size_t const id = node->id();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::SetEffectLevel(node_t node,
+                                                   int effect_level) {
+  DCHECK(this->valid(node));
+  size_t const id = this->id(node);
   DCHECK_LT(id, effect_level_.size());
   effect_level_[id] = effect_level;
 }
 
-bool InstructionSelector::CanAddressRelativeToRootsRegister(
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::CanAddressRelativeToRootsRegister(
     const ExternalReference& reference) const {
   // There are three things to consider here:
   // 1. CanUseRootsRegister: Is kRootRegister initialized?
@@ -445,7 +534,8 @@ bool InstructionSelector::CanAddressRelativeToRootsRegister(
   //    addresses guaranteed not to change between code generation and
   //    execution?
   const bool all_root_relative_offsets_are_constant =
-      (enable_roots_relative_addressing_ == kEnableRootsRelativeAddressing);
+      (enable_roots_relative_addressing_ ==
+       InstructionSelector::kEnableRootsRelativeAddressing);
   if (all_root_relative_offsets_are_constant) return true;
 
   // 3. IsAddressableThroughRootRegister: Is the target address guaranteed to
@@ -456,25 +546,95 @@ bool InstructionSelector::CanAddressRelativeToRootsRegister(
   return this_root_relative_offset_is_constant;
 }
 
-bool InstructionSelector::CanUseRootsRegister() const {
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::CanUseRootsRegister() const {
   return linkage()->GetIncomingDescriptor()->flags() &
          CallDescriptor::kCanUseRoots;
 }
 
-void InstructionSelector::MarkAsRepresentation(MachineRepresentation rep,
-                                               const InstructionOperand& op) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::MarkAsRepresentation(
+    MachineRepresentation rep, const InstructionOperand& op) {
   UnallocatedOperand unalloc = UnallocatedOperand::cast(op);
   sequence()->MarkAsRepresentation(rep, unalloc.virtual_register());
 }
 
-void InstructionSelector::MarkAsRepresentation(MachineRepresentation rep,
-                                               Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::MarkAsRepresentation(
+    MachineRepresentation rep, node_t node) {
   sequence()->MarkAsRepresentation(rep, GetVirtualRegister(node));
 }
 
 namespace {
 
-InstructionOperand OperandForDeopt(Isolate* isolate, OperandGenerator* g,
+InstructionOperand OperandForDeopt(Isolate* isolate,
+                                   OperandGeneratorT<TurboshaftAdapter>* g,
+                                   turboshaft::OpIndex input,
+                                   FrameStateInputKind kind,
+                                   MachineRepresentation rep) {
+  if (rep == MachineRepresentation::kNone) {
+    return g->TempImmediate(FrameStateDescriptor::kImpossibleValue);
+  }
+
+  const turboshaft::Operation& op = g->turboshaft_graph()->Get(input);
+  if (const turboshaft::ConstantOp* constant =
+          op.TryCast<turboshaft::ConstantOp>()) {
+    using Kind = turboshaft::ConstantOp::Kind;
+    switch (constant->kind) {
+      case Kind::kWord32:
+      case Kind::kWord64:
+      case Kind::kFloat32:
+      case Kind::kFloat64:
+        return g->UseImmediate(input);
+      case Kind::kNumber:
+        if (rep == MachineRepresentation::kWord32) {
+          const double d = constant->number();
+          Tagged<Smi> smi = Smi::FromInt(static_cast<int32_t>(d));
+          CHECK_EQ(smi.value(), d);
+          return g->UseImmediate(static_cast<int32_t>(smi.ptr()));
+        }
+        return g->UseImmediate(input);
+      case turboshaft::ConstantOp::Kind::kHeapObject:
+      case turboshaft::ConstantOp::Kind::kCompressedHeapObject: {
+        if (!CanBeTaggedOrCompressedPointer(rep)) {
+          // If we have inconsistent static and dynamic types, e.g. if we
+          // smi-check a string, we can get here with a heap object that
+          // says it is a smi. In that case, we return an invalid instruction
+          // operand, which will be interpreted as an optimized-out value.
+
+          // TODO(jarin) Ideally, we should turn the current instruction
+          // into an abort (we should never execute it).
+          return InstructionOperand();
+        }
+
+        Handle<HeapObject> object = constant->handle();
+        RootIndex root_index;
+        if (isolate->roots_table().IsRootHandle(object, &root_index) &&
+            root_index == RootIndex::kOptimizedOut) {
+          // For an optimized-out object we return an invalid instruction
+          // operand, so that we take the fast path for optimized-out values.
+          return InstructionOperand();
+        }
+
+        return g->UseImmediate(input);
+      }
+      default:
+        UNIMPLEMENTED();
+    }
+  } else {
+    switch (kind) {
+      case FrameStateInputKind::kStackSlot:
+        return g->UseUniqueSlot(input);
+      case FrameStateInputKind::kAny:
+        // Currently deopts "wrap" other operations, so the deopt's inputs
+        // are potentially needed until the end of the deoptimising code.
+        return g->UseAnyAtEnd(input);
+    }
+  }
+}
+
+InstructionOperand OperandForDeopt(Isolate* isolate,
+                                   OperandGeneratorT<TurbofanAdapter>* g,
                                    Node* input, FrameStateInputKind kind,
                                    MachineRepresentation rep) {
   if (rep == MachineRepresentation::kNone) {
@@ -489,7 +649,7 @@ InstructionOperand OperandForDeopt(Isolate* isolate, OperandGenerator* g,
       return g->UseImmediate(input);
     case IrOpcode::kNumberConstant:
       if (rep == MachineRepresentation::kWord32) {
-        Smi smi = NumberConstantToSmi(input);
+        Tagged<Smi> smi = NumberConstantToSmi(input);
         return g->UseImmediate(static_cast<int32_t>(smi.ptr()));
       } else {
         return g->UseImmediate(input);
@@ -538,9 +698,9 @@ InstructionOperand OperandForDeopt(Isolate* isolate, OperandGenerator* g,
 
 }  // namespace
 
-class StateObjectDeduplicator {
+class TurbofanStateObjectDeduplicator {
  public:
-  explicit StateObjectDeduplicator(Zone* zone) : objects_(zone) {}
+  explicit TurbofanStateObjectDeduplicator(Zone* zone) : objects_(zone) {}
   static const size_t kNotDuplicated = SIZE_MAX;
 
   size_t GetObjectId(Node* node) {
@@ -582,11 +742,42 @@ class StateObjectDeduplicator {
   ZoneVector<Node*> objects_;
 };
 
+class TurboshaftStateObjectDeduplicator {
+ public:
+  explicit TurboshaftStateObjectDeduplicator(Zone* zone) : object_ids_(zone) {}
+  static constexpr uint32_t kArgumentsElementsDummy =
+      std::numeric_limits<uint32_t>::max();
+  static constexpr size_t kNotDuplicated = std::numeric_limits<size_t>::max();
+
+  size_t GetObjectId(uint32_t object) {
+    for (size_t i = 0; i < object_ids_.size(); ++i) {
+      if (object_ids_[i] == object) return i;
+    }
+    return kNotDuplicated;
+  }
+
+  size_t InsertObject(uint32_t object) {
+    object_ids_.push_back(object);
+    return object_ids_.size() - 1;
+  }
+
+  void InsertDummyForArgumentsElements() {
+    object_ids_.push_back(kArgumentsElementsDummy);
+  }
+
+  size_t size() const { return object_ids_.size(); }
+
+ private:
+  ZoneVector<uint32_t> object_ids_;
+};
+
 // Returns the number of instruction operands added to inputs.
-size_t InstructionSelector::AddOperandToStateValueDescriptor(
+template <>
+size_t InstructionSelectorT<TurbofanAdapter>::AddOperandToStateValueDescriptor(
     StateValueList* values, InstructionOperandVector* inputs,
-    OperandGenerator* g, StateObjectDeduplicator* deduplicator, Node* input,
-    MachineType type, FrameStateInputKind kind, Zone* zone) {
+    OperandGeneratorT<TurbofanAdapter>* g,
+    StateObjectDeduplicator* deduplicator, Node* input, MachineType type,
+    FrameStateInputKind kind, Zone* zone) {
   DCHECK_NOT_NULL(input);
   switch (input->opcode()) {
     case IrOpcode::kArgumentsElementsState: {
@@ -644,7 +835,8 @@ size_t InstructionSelector::AddOperandToStateValueDescriptor(
   }
 }
 
-struct InstructionSelector::CachedStateValues : public ZoneObject {
+template <typename Adapter>
+struct InstructionSelectorT<Adapter>::CachedStateValues : public ZoneObject {
  public:
   CachedStateValues(Zone* zone, StateValueList* values, size_t values_start,
                     InstructionOperandVector* inputs, size_t inputs_start)
@@ -662,7 +854,8 @@ struct InstructionSelector::CachedStateValues : public ZoneObject {
   StateValueList::Slice values_;
 };
 
-class InstructionSelector::CachedStateValuesBuilder {
+template <typename Adapter>
+class InstructionSelectorT<Adapter>::CachedStateValuesBuilder {
  public:
   explicit CachedStateValuesBuilder(StateValueList* values,
                                     InstructionOperandVector* inputs,
@@ -679,10 +872,10 @@ class InstructionSelector::CachedStateValuesBuilder {
   // any of the ids in the deduplicator.
   bool CanCache() const { return deduplicator_->size() == deduplicator_start_; }
 
-  InstructionSelector::CachedStateValues* Build(Zone* zone) {
+  InstructionSelectorT<Adapter>::CachedStateValues* Build(Zone* zone) {
     DCHECK(CanCache());
     DCHECK(values_->nested_count() == nested_start_);
-    return zone->New<InstructionSelector::CachedStateValues>(
+    return zone->New<InstructionSelectorT<Adapter>::CachedStateValues>(
         zone, values_, values_start_, inputs_, inputs_start_);
   }
 
@@ -696,13 +889,15 @@ class InstructionSelector::CachedStateValuesBuilder {
   size_t deduplicator_start_;
 };
 
-size_t InstructionSelector::AddInputsToFrameStateDescriptor(
+template <>
+size_t InstructionSelectorT<TurbofanAdapter>::AddInputsToFrameStateDescriptor(
     StateValueList* values, InstructionOperandVector* inputs,
-    OperandGenerator* g, StateObjectDeduplicator* deduplicator, Node* node,
+    OperandGeneratorT<TurbofanAdapter>* g,
+    StateObjectDeduplicator* deduplicator, node_t node,
     FrameStateInputKind kind, Zone* zone) {
-  // StateValues are often shared across different nodes, and processing them is
-  // expensive, so cache the result of processing a StateValue so that we can
-  // quickly copy the result if we see it again.
+  // StateValues are often shared across different nodes, and processing them
+  // is expensive, so cache the result of processing a StateValue so that we
+  // can quickly copy the result if we see it again.
   FrameStateInput key(node, kind);
   auto cache_entry = state_values_cache_.find(key);
   if (cache_entry != state_values_cache_.end()) {
@@ -726,19 +921,182 @@ size_t InstructionSelector::AddInputsToFrameStateDescriptor(
       ++it;
     }
     if (cache_builder.CanCache()) {
-      // Use this->zone() to build the cache entry in the instruction selector's
-      // zone rather than the more long-lived instruction zone.
+      // Use this->zone() to build the cache entry in the instruction
+      // selector's zone rather than the more long-lived instruction zone.
       state_values_cache_.emplace(key, cache_builder.Build(this->zone()));
     }
     return entries;
   }
 }
 
+size_t AddOperandToStateValueDescriptor(
+    InstructionSelectorT<TurboshaftAdapter>* selector, StateValueList* values,
+    InstructionOperandVector* inputs, OperandGeneratorT<TurboshaftAdapter>* g,
+    TurboshaftStateObjectDeduplicator* deduplicator,
+    turboshaft::FrameStateData::Iterator* it, FrameStateInputKind kind,
+    Zone* zone) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  switch (it->current_instr()) {
+    case FrameStateData::Instr::kUnusedRegister:
+      it->ConsumeUnusedRegister();
+      values->PushOptimizedOut();
+      return 0;
+    case FrameStateData::Instr::kInput: {
+      MachineType type;
+      OpIndex input;
+      it->ConsumeInput(&type, &input);
+      const Operation& op = selector->Get(input);
+      if (op.outputs_rep()[0] == RegisterRepresentation::Word64() &&
+          type.representation() == MachineRepresentation::kWord32) {
+        // 64 to 32-bit conversion is implicit in turboshaft.
+        // TODO(nicohartmann@): Fix this once we have explicit truncations.
+        UNIMPLEMENTED();
+      }
+      InstructionOperand instr_op = OperandForDeopt(
+          selector->isolate(), g, input, kind, type.representation());
+      if (instr_op.kind() == InstructionOperand::INVALID) {
+        // Invalid operand means the value is impossible or optimized-out.
+        values->PushOptimizedOut();
+        return 0;
+      } else {
+        inputs->push_back(instr_op);
+        values->PushPlain(type);
+        return 1;
+      }
+    }
+    case FrameStateData::Instr::kDematerializedObject: {
+      uint32_t obj_id;
+      uint32_t field_count;
+      it->ConsumeDematerializedObject(&obj_id, &field_count);
+      size_t id = deduplicator->GetObjectId(obj_id);
+      if (id == TurboshaftStateObjectDeduplicator::kNotDuplicated) {
+        id = deduplicator->InsertObject(obj_id);
+        size_t entries = 0;
+        StateValueList* nested = values->PushRecursiveField(zone, id);
+        for (uint32_t i = 0; i < field_count; ++i) {
+          entries += AddOperandToStateValueDescriptor(
+              selector, nested, inputs, g, deduplicator, it, kind, zone);
+        }
+        return entries;
+      } else {
+        // Deoptimizer counts duplicate objects for the running id, so we have
+        // to push the input again.
+        deduplicator->InsertObject(obj_id);
+        values->PushDuplicate(id);
+        return 0;
+      }
+    }
+    case FrameStateData::Instr::kDematerializedObjectReference: {
+      uint32_t obj_id;
+      it->ConsumeDematerializedObjectReference(&obj_id);
+      size_t id = deduplicator->GetObjectId(obj_id);
+      DCHECK_NE(id, TurboshaftStateObjectDeduplicator::kNotDuplicated);
+      // Deoptimizer counts duplicate objects for the running id, so we have
+      // to push the input again.
+      deduplicator->InsertObject(obj_id);
+      values->PushDuplicate(id);
+      return 0;
+    }
+    case FrameStateData::Instr::kArgumentsLength:
+      it->ConsumeArgumentsLength();
+      values->PushArgumentsLength();
+      return 0;
+    case FrameStateData::Instr::kArgumentsElements: {
+      CreateArgumentsType type;
+      it->ConsumeArgumentsElements(&type);
+      values->PushArgumentsElements(type);
+      // The elements backing store of an arguments object participates in the
+      // duplicate object counting, but can itself never appear duplicated.
+      deduplicator->InsertDummyForArgumentsElements();
+      return 0;
+    }
+  }
+  UNREACHABLE();
+}
+
 // Returns the number of instruction operands added to inputs.
-size_t InstructionSelector::AddInputsToFrameStateDescriptor(
-    FrameStateDescriptor* descriptor, FrameState state, OperandGenerator* g,
+template <>
+size_t InstructionSelectorT<TurboshaftAdapter>::AddInputsToFrameStateDescriptor(
+    FrameStateDescriptor* descriptor, node_t state_node, OperandGenerator* g,
+    TurboshaftStateObjectDeduplicator* deduplicator,
+    InstructionOperandVector* inputs, FrameStateInputKind kind, Zone* zone) {
+  turboshaft::FrameStateOp& state =
+      schedule()->Get(state_node).template Cast<turboshaft::FrameStateOp>();
+  const FrameStateInfo& info = state.data->frame_state_info;
+  USE(info);
+  turboshaft::FrameStateData::Iterator it =
+      state.data->iterator(state.state_values());
+
+  size_t entries = 0;
+  size_t initial_size = inputs->size();
+  USE(initial_size);  // initial_size is only used for debug.
+  if (descriptor->outer_state()) {
+    entries += AddInputsToFrameStateDescriptor(
+        descriptor->outer_state(), state.parent_frame_state(), g, deduplicator,
+        inputs, kind, zone);
+  }
+
+  DCHECK_EQ(descriptor->parameters_count(), info.parameter_count());
+  DCHECK_EQ(descriptor->locals_count(), info.local_count());
+  DCHECK_EQ(descriptor->stack_count(), info.stack_count());
+
+  StateValueList* values_descriptor = descriptor->GetStateValueDescriptors();
+
+  DCHECK_EQ(values_descriptor->size(), 0u);
+  values_descriptor->ReserveSize(descriptor->GetSize());
+
+  // Function
+  if (descriptor->HasClosure()) {
+    entries += v8::internal::compiler::AddOperandToStateValueDescriptor(
+        this, values_descriptor, inputs, g, deduplicator, &it,
+        FrameStateInputKind::kStackSlot, zone);
+  } else {
+    // Advance the iterator either way.
+    MachineType unused_type;
+    turboshaft::OpIndex unused_input;
+    it.ConsumeInput(&unused_type, &unused_input);
+  }
+
+  // Parameters
+  for (size_t i = 0; i < descriptor->parameters_count(); ++i) {
+    entries += v8::internal::compiler::AddOperandToStateValueDescriptor(
+        this, values_descriptor, inputs, g, deduplicator, &it, kind, zone);
+  }
+
+  // Context
+  if (descriptor->HasContext()) {
+    entries += v8::internal::compiler::AddOperandToStateValueDescriptor(
+        this, values_descriptor, inputs, g, deduplicator, &it,
+        FrameStateInputKind::kStackSlot, zone);
+  } else {
+    // Advance the iterator either way.
+    MachineType unused_type;
+    turboshaft::OpIndex unused_input;
+    it.ConsumeInput(&unused_type, &unused_input);
+  }
+
+  // Locals
+  for (size_t i = 0; i < descriptor->locals_count(); ++i) {
+    entries += v8::internal::compiler::AddOperandToStateValueDescriptor(
+        this, values_descriptor, inputs, g, deduplicator, &it, kind, zone);
+  }
+
+  // Stack
+  for (size_t i = 0; i < descriptor->stack_count(); ++i) {
+    entries += v8::internal::compiler::AddOperandToStateValueDescriptor(
+        this, values_descriptor, inputs, g, deduplicator, &it, kind, zone);
+  }
+
+  DCHECK_EQ(initial_size + entries, inputs->size());
+  return entries;
+}
+
+template <>
+size_t InstructionSelectorT<TurbofanAdapter>::AddInputsToFrameStateDescriptor(
+    FrameStateDescriptor* descriptor, node_t state_node, OperandGenerator* g,
     StateObjectDeduplicator* deduplicator, InstructionOperandVector* inputs,
     FrameStateInputKind kind, Zone* zone) {
+  FrameState state{state_node};
   size_t entries = 0;
   size_t initial_size = inputs->size();
   USE(initial_size);  // initial_size is only used for debug.
@@ -765,10 +1123,12 @@ size_t InstructionSelector::AddInputsToFrameStateDescriptor(
   DCHECK_EQ(values_descriptor->size(), 0u);
   values_descriptor->ReserveSize(descriptor->GetSize());
 
-  DCHECK_NOT_NULL(function);
-  entries += AddOperandToStateValueDescriptor(
-      values_descriptor, inputs, g, deduplicator, function,
-      MachineType::AnyTagged(), FrameStateInputKind::kStackSlot, zone);
+  if (descriptor->HasClosure()) {
+    DCHECK_NOT_NULL(function);
+    entries += AddOperandToStateValueDescriptor(
+        values_descriptor, inputs, g, deduplicator, function,
+        MachineType::AnyTagged(), FrameStateInputKind::kStackSlot, zone);
+  }
 
   entries += AddInputsToFrameStateDescriptor(
       values_descriptor, inputs, g, deduplicator, parameters, kind, zone);
@@ -782,18 +1142,21 @@ size_t InstructionSelector::AddInputsToFrameStateDescriptor(
 
   entries += AddInputsToFrameStateDescriptor(values_descriptor, inputs, g,
                                              deduplicator, locals, kind, zone);
+
   entries += AddInputsToFrameStateDescriptor(values_descriptor, inputs, g,
                                              deduplicator, stack, kind, zone);
   DCHECK_EQ(initial_size + entries, inputs->size());
   return entries;
 }
 
-Instruction* InstructionSelector::EmitWithContinuation(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::EmitWithContinuation(
     InstructionCode opcode, InstructionOperand a, FlagsContinuation* cont) {
   return EmitWithContinuation(opcode, 0, nullptr, 1, &a, cont);
 }
 
-Instruction* InstructionSelector::EmitWithContinuation(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::EmitWithContinuation(
     InstructionCode opcode, InstructionOperand a, InstructionOperand b,
     FlagsContinuation* cont) {
   InstructionOperand inputs[] = {a, b};
@@ -801,7 +1164,8 @@ Instruction* InstructionSelector::EmitWithContinuation(
                               cont);
 }
 
-Instruction* InstructionSelector::EmitWithContinuation(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::EmitWithContinuation(
     InstructionCode opcode, InstructionOperand a, InstructionOperand b,
     InstructionOperand c, FlagsContinuation* cont) {
   InstructionOperand inputs[] = {a, b, c};
@@ -809,14 +1173,16 @@ Instruction* InstructionSelector::EmitWithContinuation(
                               cont);
 }
 
-Instruction* InstructionSelector::EmitWithContinuation(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::EmitWithContinuation(
     InstructionCode opcode, size_t output_count, InstructionOperand* outputs,
     size_t input_count, InstructionOperand* inputs, FlagsContinuation* cont) {
   return EmitWithContinuation(opcode, output_count, outputs, input_count,
                               inputs, 0, nullptr, cont);
 }
 
-Instruction* InstructionSelector::EmitWithContinuation(
+template <typename Adapter>
+Instruction* InstructionSelectorT<Adapter>::EmitWithContinuation(
     InstructionCode opcode, size_t output_count, InstructionOperand* outputs,
     size_t input_count, InstructionOperand* inputs, size_t temp_count,
     InstructionOperand* temps, FlagsContinuation* cont) {
@@ -848,7 +1214,7 @@ Instruction* InstructionSelector::EmitWithContinuation(
               DeoptFrameStateOffsetField::encode(static_cast<int>(input_count));
     AppendDeoptimizeArguments(&continuation_inputs_, cont->reason(),
                               cont->node_id(), cont->feedback(),
-                              FrameState{cont->frame_state()});
+                              cont->frame_state());
   } else if (cont->IsSet()) {
     continuation_outputs_.push_back(g.DefineAsRegister(cont->result()));
   } else if (cont->IsSelect()) {
@@ -878,13 +1244,14 @@ Instruction* InstructionSelector::EmitWithContinuation(
               emit_inputs, emit_temps_size, emit_temps);
 }
 
-void InstructionSelector::AppendDeoptimizeArguments(
-    InstructionOperandVector* args, DeoptimizeReason reason, NodeId node_id,
-    FeedbackSource const& feedback, FrameState frame_state) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AppendDeoptimizeArguments(
+    InstructionOperandVector* args, DeoptimizeReason reason, id_t node_id,
+    FeedbackSource const& feedback, node_t frame_state, DeoptimizeKind kind) {
   OperandGenerator g(this);
   FrameStateDescriptor* const descriptor = GetFrameStateDescriptor(frame_state);
   int const state_id = sequence()->AddDeoptimizationEntry(
-      descriptor, DeoptimizeKind::kEager, reason, node_id, feedback);
+      descriptor, kind, reason, node_id, feedback);
   args->push_back(g.TempImmediate(state_id));
   StateObjectDeduplicator deduplicator(instruction_zone());
   AddInputsToFrameStateDescriptor(descriptor, frame_state, &g, &deduplicator,
@@ -895,9 +1262,11 @@ void InstructionSelector::AppendDeoptimizeArguments(
 // An internal helper class for generating the operands to calls.
 // TODO(bmeurer): Get rid of the CallBuffer business and make
 // InstructionSelector::VisitCall platform independent instead.
-struct CallBuffer {
-  CallBuffer(Zone* zone, const CallDescriptor* call_descriptor,
-             FrameStateDescriptor* frame_state)
+template <typename Adapter>
+struct CallBufferT {
+  using PushParameter = PushParameterT<Adapter>;
+  CallBufferT(Zone* zone, const CallDescriptor* call_descriptor,
+              FrameStateDescriptor* frame_state)
       : descriptor(call_descriptor),
         frame_state_descriptor(frame_state),
         output_nodes(zone),
@@ -931,16 +1300,15 @@ struct CallBuffer {
 
 // TODO(bmeurer): Get rid of the CallBuffer business and make
 // InstructionSelector::VisitCall platform independent instead.
-void InstructionSelector::InitializeCallBuffer(Node* call, CallBuffer* buffer,
-                                               CallBufferFlags flags,
-                                               int stack_param_delta) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::InitializeCallBuffer(
+    node_t node, CallBuffer* buffer, CallBufferFlags flags,
+    int stack_param_delta) {
   OperandGenerator g(this);
   size_t ret_count = buffer->descriptor->ReturnCount();
   bool is_tail_call = (flags & kCallTail) != 0;
-  DCHECK_LE(call->op()->ValueOutputCount(), ret_count);
-  DCHECK_EQ(
-      call->op()->ValueInputCount(),
-      static_cast<int>(buffer->input_count() + buffer->frame_state_count()));
+  auto call = this->call_view(node);
+  DCHECK_LE(call.return_count(), ret_count);
 
   if (ret_count > 0) {
     // Collect the projections that represent multiple outputs from this call.
@@ -951,19 +1319,35 @@ void InstructionSelector::InitializeCallBuffer(Node* call, CallBuffer* buffer,
       buffer->output_nodes.resize(ret_count);
       for (size_t i = 0; i < ret_count; ++i) {
         LinkageLocation location = buffer->descriptor->GetReturnLocation(i);
-        buffer->output_nodes[i] = PushParameter(nullptr, location);
+        buffer->output_nodes[i] = PushParameter({}, location);
       }
-      for (Edge const edge : call->use_edges()) {
-        if (!NodeProperties::IsValueEdge(edge)) continue;
-        Node* node = edge.from();
-        DCHECK_EQ(IrOpcode::kProjection, node->opcode());
-        size_t const index = ProjectionIndexOf(node->op());
-
-        DCHECK_LT(index, buffer->output_nodes.size());
-        DCHECK(!buffer->output_nodes[index].node);
-        buffer->output_nodes[index].node = node;
+      if constexpr (Adapter::IsTurboshaft) {
+        for (turboshaft::OpIndex call_use : turboshaft_uses(call)) {
+          const turboshaft::Operation& use_op = this->Get(call_use);
+          if (use_op.Is<turboshaft::DidntThrowOp>()) {
+            for (turboshaft::OpIndex use : turboshaft_uses(call_use)) {
+              DCHECK(this->is_projection(use));
+              size_t index = this->projection_index_of(use);
+              DCHECK_LT(index, buffer->output_nodes.size());
+              DCHECK(!Adapter::valid(buffer->output_nodes[index].node));
+              buffer->output_nodes[index].node = use;
+            }
+          } else {
+            DCHECK(use_op.Is<turboshaft::CheckExceptionOp>());
+          }
+        }
+      } else {
+        for (Edge const edge : ((node_t)call)->use_edges()) {
+          if (!NodeProperties::IsValueEdge(edge)) continue;
+          Node* node = edge.from();
+          DCHECK_EQ(IrOpcode::kProjection, node->opcode());
+          size_t const index = ProjectionIndexOf(node->op());
+
+          DCHECK_LT(index, buffer->output_nodes.size());
+          DCHECK(!buffer->output_nodes[index].node);
+          buffer->output_nodes[index].node = node;
+        }
       }
-
       frame_->EnsureReturnSlots(
           static_cast<int>(buffer->descriptor->ReturnSlotCount()));
     }
@@ -975,72 +1359,80 @@ void InstructionSelector::InitializeCallBuffer(Node* call, CallBuffer* buffer,
             : buffer->frame_state_descriptor->state_combine()
                   .ConsumedOutputCount();
     for (size_t i = 0; i < buffer->output_nodes.size(); i++) {
-      bool output_is_live = buffer->output_nodes[i].node != nullptr ||
+      bool output_is_live = this->valid(buffer->output_nodes[i].node) ||
                             i < outputs_needed_by_framestate;
       if (output_is_live) {
         LinkageLocation location = buffer->output_nodes[i].location;
         MachineRepresentation rep = location.GetType().representation();
 
-        Node* output = buffer->output_nodes[i].node;
-        InstructionOperand op = output == nullptr
+        node_t output = buffer->output_nodes[i].node;
+        InstructionOperand op = !this->valid(output)
                                     ? g.TempLocation(location)
                                     : g.DefineAsLocation(output, location);
         MarkAsRepresentation(rep, op);
 
         if (!UnallocatedOperand::cast(op).HasFixedSlotPolicy()) {
           buffer->outputs.push_back(op);
-          buffer->output_nodes[i].node = nullptr;
+          buffer->output_nodes[i].node = {};
         }
       }
     }
   }
 
   // The first argument is always the callee code.
-  Node* callee = call->InputAt(0);
+  node_t callee = call.callee();
   bool call_code_immediate = (flags & kCallCodeImmediate) != 0;
   bool call_address_immediate = (flags & kCallAddressImmediate) != 0;
   bool call_use_fixed_target_reg = (flags & kCallFixedTargetRegister) != 0;
   switch (buffer->descriptor->kind()) {
     case CallDescriptor::kCallCodeObject:
       buffer->instruction_args.push_back(
-          (call_code_immediate && callee->opcode() == IrOpcode::kHeapConstant)
+          (call_code_immediate && this->IsHeapConstant(callee))
               ? g.UseImmediate(callee)
-              : call_use_fixed_target_reg
-                    ? g.UseFixed(callee, kJavaScriptCallCodeStartRegister)
-                    : g.UseRegister(callee));
+          : call_use_fixed_target_reg
+              ? g.UseFixed(callee, kJavaScriptCallCodeStartRegister)
+              : g.UseRegister(callee));
       break;
     case CallDescriptor::kCallAddress:
       buffer->instruction_args.push_back(
-          (call_address_immediate &&
-           callee->opcode() == IrOpcode::kExternalConstant)
+          (call_address_immediate && this->IsExternalConstant(callee))
               ? g.UseImmediate(callee)
-              : call_use_fixed_target_reg
-                    ? g.UseFixed(callee, kJavaScriptCallCodeStartRegister)
-                    : g.UseRegister(callee));
+          : call_use_fixed_target_reg
+              ? g.UseFixed(callee, kJavaScriptCallCodeStartRegister)
+              : g.UseRegister(callee));
       break;
 #if V8_ENABLE_WEBASSEMBLY
     case CallDescriptor::kCallWasmCapiFunction:
     case CallDescriptor::kCallWasmFunction:
     case CallDescriptor::kCallWasmImportWrapper:
       buffer->instruction_args.push_back(
-          (call_address_immediate &&
-           (callee->opcode() == IrOpcode::kRelocatableInt64Constant ||
-            callee->opcode() == IrOpcode::kRelocatableInt32Constant))
+          (call_address_immediate && this->IsRelocatableWasmConstant(callee))
               ? g.UseImmediate(callee)
-              : call_use_fixed_target_reg
-                    ? g.UseFixed(callee, kJavaScriptCallCodeStartRegister)
-                    : g.UseRegister(callee));
+          : call_use_fixed_target_reg
+              ? g.UseFixed(callee, kJavaScriptCallCodeStartRegister)
+              : g.UseRegister(callee));
       break;
 #endif  // V8_ENABLE_WEBASSEMBLY
-    case CallDescriptor::kCallBuiltinPointer:
+    case CallDescriptor::kCallBuiltinPointer: {
       // The common case for builtin pointers is to have the target in a
       // register. If we have a constant, we use a register anyway to simplify
       // related code.
-      buffer->instruction_args.push_back(
-          call_use_fixed_target_reg
-              ? g.UseFixed(callee, kJavaScriptCallCodeStartRegister)
-              : g.UseRegister(callee));
+      LinkageLocation location = buffer->descriptor->GetInputLocation(0);
+      bool location_is_fixed_register =
+          location.IsRegister() && !location.IsAnyRegister();
+      InstructionOperand op;
+      // If earlier phases specified a particular register, don't override
+      // their choice.
+      if (location_is_fixed_register) {
+        op = g.UseLocation(callee, location);
+      } else if (call_use_fixed_target_reg) {
+        op = g.UseFixed(callee, kJavaScriptCallCodeStartRegister);
+      } else {
+        op = g.UseRegister(callee);
+      }
+      buffer->instruction_args.push_back(op);
       break;
+    }
     case CallDescriptor::kCallJSFunction:
       buffer->instruction_args.push_back(
           g.UseLocation(callee, buffer->descriptor->GetInputLocation(0)));
@@ -1055,21 +1447,19 @@ void InstructionSelector::InitializeCallBuffer(Node* call, CallBuffer* buffer,
   size_t frame_state_entries = 0;
   USE(frame_state_entries);  // frame_state_entries is only used for debug.
   if (buffer->frame_state_descriptor != nullptr) {
-    FrameState frame_state{
-        call->InputAt(static_cast<int>(buffer->descriptor->InputCount()))};
+    node_t frame_state = call.frame_state();
 
     // If it was a syntactic tail call we need to drop the current frame and
     // all the frames on top of it that are either inlined extra arguments
     // or a tail caller frame.
     if (is_tail_call) {
-      frame_state = FrameState{NodeProperties::GetFrameStateInput(frame_state)};
+      frame_state = this->parent_frame_state(frame_state);
       buffer->frame_state_descriptor =
           buffer->frame_state_descriptor->outer_state();
       while (buffer->frame_state_descriptor != nullptr &&
              buffer->frame_state_descriptor->type() ==
                  FrameStateType::kInlinedExtraArguments) {
-        frame_state =
-            FrameState{NodeProperties::GetFrameStateInput(frame_state)};
+        frame_state = this->parent_frame_state(frame_state);
         buffer->frame_state_descriptor =
             buffer->frame_state_descriptor->outer_state();
       }
@@ -1077,7 +1467,7 @@ void InstructionSelector::InitializeCallBuffer(Node* call, CallBuffer* buffer,
 
     int const state_id = sequence()->AddDeoptimizationEntry(
         buffer->frame_state_descriptor, DeoptimizeKind::kLazy,
-        DeoptimizeReason::kUnknown, call->id(), FeedbackSource());
+        DeoptimizeReason::kUnknown, this->id(call), FeedbackSource());
     buffer->instruction_args.push_back(g.TempImmediate(state_id));
 
     StateObjectDeduplicator deduplicator(instruction_zone());
@@ -1097,12 +1487,12 @@ void InstructionSelector::InitializeCallBuffer(Node* call, CallBuffer* buffer,
   // arguments require an explicit push instruction before the call and do
   // not appear as arguments to the call. Everything else ends up
   // as an InstructionOperand argument to the call.
-  auto iter(call->inputs().begin());
+  auto arguments = call.arguments();
+  auto iter(arguments.begin());
+  // call->inputs().begin());
   size_t pushed_count = 0;
-  for (size_t index = 0; index < input_count; ++iter, ++index) {
-    DCHECK(iter != call->inputs().end());
-    DCHECK_NE(IrOpcode::kFrameState, (*iter)->op()->opcode());
-    if (index == 0) continue;  // The first argument (callee) is already done.
+  for (size_t index = 1; index < input_count; ++iter, ++index) {
+    DCHECK_NE(iter, arguments.end());
 
     LinkageLocation location = buffer->descriptor->GetInputLocation(index);
     if (is_tail_call) {
@@ -1148,18 +1538,61 @@ void InstructionSelector::InitializeCallBuffer(Node* call, CallBuffer* buffer,
   }
 }
 
-bool InstructionSelector::IsSourcePositionUsed(Node* node) {
-  return (source_position_mode_ == kAllSourcePositions ||
-          node->opcode() == IrOpcode::kCall ||
-          node->opcode() == IrOpcode::kTrapIf ||
-          node->opcode() == IrOpcode::kTrapUnless ||
-          node->opcode() == IrOpcode::kProtectedLoad ||
-          node->opcode() == IrOpcode::kProtectedStore ||
-          node->opcode() == IrOpcode::kLoadTrapOnNull ||
-          node->opcode() == IrOpcode::kStoreTrapOnNull);
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsSourcePositionUsed(node_t node) {
+  if (source_position_mode_ == InstructionSelector::kAllSourcePositions) {
+    return true;
+  }
+  if constexpr (Adapter::IsTurboshaft) {
+    using namespace turboshaft;  // NOLINT(build/namespaces)
+    const Operation& operation = this->Get(node);
+    if (operation.Is<TrapIfOp>()) return true;
+    if (const LoadOp* load = operation.TryCast<LoadOp>()) {
+      return load->kind.with_trap_handler;
+    }
+    if (const StoreOp* store = operation.TryCast<StoreOp>()) {
+      return store->kind.with_trap_handler;
+    }
+    return false;
+  } else {
+    switch (node->opcode()) {
+      case IrOpcode::kCall:
+      case IrOpcode::kTrapIf:
+      case IrOpcode::kTrapUnless:
+      case IrOpcode::kProtectedLoad:
+      case IrOpcode::kProtectedStore:
+      case IrOpcode::kLoadTrapOnNull:
+      case IrOpcode::kStoreTrapOnNull:
+        return true;
+      default:
+        return false;
+    }
+  }
+}
+
+namespace {
+bool increment_effect_level_for_node(TurbofanAdapter* adapter, Node* node) {
+  const IrOpcode::Value opcode = node->opcode();
+  return opcode == IrOpcode::kStore || opcode == IrOpcode::kUnalignedStore ||
+         opcode == IrOpcode::kCall || opcode == IrOpcode::kProtectedStore ||
+         opcode == IrOpcode::kStoreTrapOnNull ||
+#define ADD_EFFECT_FOR_ATOMIC_OP(Opcode) opcode == IrOpcode::k##Opcode ||
+         MACHINE_ATOMIC_OP_LIST(ADD_EFFECT_FOR_ATOMIC_OP)
+#undef ADD_EFFECT_FOR_ATOMIC_OP
+                 opcode == IrOpcode::kMemoryBarrier;
+}
+
+bool increment_effect_level_for_node(TurboshaftAdapter* adapter,
+                                     turboshaft::OpIndex node) {
+  // We need to increment the effect level if the operation consumes any of the
+  // dimensions of the {kTurboshaftEffectLevelMask}.
+  const turboshaft::Operation& op = adapter->Get(node);
+  return (op.Effects().consumes.bits() & kTurboshaftEffectLevelMask) != 0;
 }
+}  // namespace
 
-void InstructionSelector::VisitBlock(BasicBlock* block) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBlock(block_t block) {
   DCHECK(!current_block_);
   current_block_ = block;
   auto current_num_instructions = [&] {
@@ -1169,38 +1602,36 @@ void InstructionSelector::VisitBlock(BasicBlock* block) {
   int current_block_end = current_num_instructions();
 
   int effect_level = 0;
-  for (Node* const node : *block) {
+  for (node_t node : this->nodes(block)) {
     SetEffectLevel(node, effect_level);
     current_effect_level_ = effect_level;
-    if (node->opcode() == IrOpcode::kStore ||
-        node->opcode() == IrOpcode::kUnalignedStore ||
-        node->opcode() == IrOpcode::kCall ||
-        node->opcode() == IrOpcode::kProtectedStore ||
-        node->opcode() == IrOpcode::kStoreTrapOnNull ||
-#define ADD_EFFECT_FOR_ATOMIC_OP(Opcode) \
-  node->opcode() == IrOpcode::k##Opcode ||
-        MACHINE_ATOMIC_OP_LIST(ADD_EFFECT_FOR_ATOMIC_OP)
-#undef ADD_EFFECT_FOR_ATOMIC_OP
-                node->opcode() == IrOpcode::kMemoryBarrier) {
+    if (increment_effect_level_for_node(this, node)) {
       ++effect_level;
     }
   }
 
   // We visit the control first, then the nodes in the block, so the block's
   // control input should be on the same effect level as the last node.
-  if (block->control_input() != nullptr) {
-    SetEffectLevel(block->control_input(), effect_level);
+  if (node_t terminator = this->block_terminator(block);
+      this->valid(terminator)) {
+    SetEffectLevel(terminator, effect_level);
     current_effect_level_ = effect_level;
   }
 
-  auto FinishEmittedInstructions = [&](Node* node, int instruction_start) {
+  auto FinishEmittedInstructions = [&](node_t node, int instruction_start) {
     if (instruction_selection_failed()) return false;
     if (current_num_instructions() == instruction_start) return true;
     std::reverse(instructions_.begin() + instruction_start,
                  instructions_.end());
-    if (!node) return true;
+    if (!this->valid(node)) return true;
     if (!source_positions_) return true;
-    SourcePosition source_position = source_positions_->GetSourcePosition(node);
+
+    SourcePosition source_position;
+    if constexpr (Adapter::IsTurboshaft) {
+      source_position = (*source_positions_)[node];
+    } else {
+      source_position = source_positions_->GetSourcePosition(node);
+    }
     if (source_position.IsKnown() && IsSourcePositionUsed(node)) {
       sequence()->SetSourcePosition(instructions_.back(), source_position);
     }
@@ -1210,13 +1641,14 @@ void InstructionSelector::VisitBlock(BasicBlock* block) {
   // Generate code for the block control "top down", but schedule the code
   // "bottom up".
   VisitControl(block);
-  if (!FinishEmittedInstructions(block->control_input(), current_block_end)) {
+  if (!FinishEmittedInstructions(this->block_terminator(block),
+                                 current_block_end)) {
     return;
   }
 
   // Visit code in reverse control flow order, because architecture-specific
   // matching may cover more than one node at a time.
-  for (auto node : base::Reversed(*block)) {
+  for (node_t node : base::Reversed(this->nodes(block))) {
     int current_node_end = current_num_instructions();
     // Skip nodes that are unused or already defined.
     if (IsUsed(node) && !IsDefined(node)) {
@@ -1225,15 +1657,15 @@ void InstructionSelector::VisitBlock(BasicBlock* block) {
       VisitNode(node);
       if (!FinishEmittedInstructions(node, current_node_end)) return;
     }
-    if (trace_turbo_ == kEnableTraceTurboJson) {
-      instr_origins_[node->id()] = {current_num_instructions(),
-                                    current_node_end};
+    if (trace_turbo_ == InstructionSelector::kEnableTraceTurboJson) {
+      instr_origins_[this->id(node)] = {current_num_instructions(),
+                                        current_node_end};
     }
   }
 
   // We're done with the block.
   InstructionBlock* instruction_block =
-      sequence()->InstructionBlockAt(RpoNumber::FromInt(block->rpo_number()));
+      sequence()->InstructionBlockAt(this->rpo_number(block));
   if (current_num_instructions() == current_block_end) {
     // Avoid empty block: insert a {kArchNop} instruction.
     Emit(Instruction::New(sequence()->zone(), kArchNop));
@@ -1243,2078 +1675,3277 @@ void InstructionSelector::VisitBlock(BasicBlock* block) {
   current_block_ = nullptr;
 }
 
-void InstructionSelector::VisitControl(BasicBlock* block) {
-#ifdef DEBUG
-  // SSA deconstruction requires targets of branches not to have phis.
-  // Edge split form guarantees this property, but is more strict.
-  if (block->SuccessorCount() > 1) {
-    for (BasicBlock* const successor : block->successors()) {
-      for (Node* const node : *successor) {
-        if (IrOpcode::IsPhiOpcode(node->opcode())) {
-          std::ostringstream str;
-          str << "You might have specified merged variables for a label with "
-              << "only one predecessor." << std::endl
-              << "# Current Block: " << *successor << std::endl
-              << "#          Node: " << *node;
-          FATAL("%s", str.str().c_str());
-        }
-      }
-    }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::MarkPairProjectionsAsWord32(node_t node) {
+  node_t projection0 = FindProjection(node, 0);
+  if (Adapter::valid(projection0)) {
+    MarkAsWord32(projection0);
   }
-#endif
+  node_t projection1 = FindProjection(node, 1);
+  if (Adapter::valid(projection1)) {
+    MarkAsWord32(projection1);
+  }
+}
 
-  Node* input = block->control_input();
-  int instruction_end = static_cast<int>(instructions_.size());
-  switch (block->control()) {
-    case BasicBlock::kGoto:
-      VisitGoto(block->SuccessorAt(0));
-      break;
-    case BasicBlock::kCall: {
-      DCHECK_EQ(IrOpcode::kCall, input->opcode());
-      BasicBlock* success = block->SuccessorAt(0);
-      BasicBlock* exception = block->SuccessorAt(1);
-      VisitCall(input, exception);
-      VisitGoto(success);
-      break;
-    }
-    case BasicBlock::kTailCall: {
-      DCHECK_EQ(IrOpcode::kTailCall, input->opcode());
-      VisitTailCall(input);
-      break;
-    }
-    case BasicBlock::kBranch: {
-      DCHECK_EQ(IrOpcode::kBranch, input->opcode());
-      // TODO(nicohartmann@): Once all branches have explicitly specified
-      // semantics, we should allow only BranchSemantics::kMachine here.
-      DCHECK_NE(BranchSemantics::kJS,
-                BranchParametersOf(input->op()).semantics());
-      BasicBlock* tbranch = block->SuccessorAt(0);
-      BasicBlock* fbranch = block->SuccessorAt(1);
-      if (tbranch == fbranch) {
-        VisitGoto(tbranch);
-      } else {
-        VisitBranch(input, tbranch, fbranch);
-      }
-      break;
-    }
-    case BasicBlock::kSwitch: {
-      DCHECK_EQ(IrOpcode::kSwitch, input->opcode());
-      // Last successor must be {IfDefault}.
-      BasicBlock* default_branch = block->successors().back();
-      DCHECK_EQ(IrOpcode::kIfDefault, default_branch->front()->opcode());
-      // All other successors must be {IfValue}s.
-      int32_t min_value = std::numeric_limits<int32_t>::max();
-      int32_t max_value = std::numeric_limits<int32_t>::min();
-      size_t case_count = block->SuccessorCount() - 1;
-      ZoneVector<CaseInfo> cases(case_count, zone());
-      for (size_t i = 0; i < case_count; ++i) {
-        BasicBlock* branch = block->SuccessorAt(i);
-        const IfValueParameters& p = IfValueParametersOf(branch->front()->op());
-        cases[i] = CaseInfo{p.value(), p.comparison_order(), branch};
-        if (min_value > p.value()) min_value = p.value();
-        if (max_value < p.value()) max_value = p.value();
-      }
-      SwitchInfo sw(cases, min_value, max_value, default_branch);
-      VisitSwitch(input, sw);
-      break;
-    }
-    case BasicBlock::kReturn: {
-      DCHECK_EQ(IrOpcode::kReturn, input->opcode());
-      VisitReturn(input);
-      break;
-    }
-    case BasicBlock::kDeoptimize: {
-      DeoptimizeParameters p = DeoptimizeParametersOf(input->op());
-      FrameState value{input->InputAt(0)};
-      VisitDeoptimize(p.reason(), input->id(), p.feedback(), value);
-      break;
-    }
-    case BasicBlock::kThrow:
-      DCHECK_EQ(IrOpcode::kThrow, input->opcode());
-      VisitThrow(input);
-      break;
-    case BasicBlock::kNone: {
-      // Exit block doesn't have control.
-      DCHECK_NULL(input);
-      break;
-    }
-    default:
-      UNREACHABLE();
-  }
-  if (trace_turbo_ == kEnableTraceTurboJson && input) {
-    int instruction_start = static_cast<int>(instructions_.size());
-    instr_origins_[input->id()] = {instruction_start, instruction_end};
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(node_t node) {
+  FlagsContinuation cont =
+      FlagsContinuation::ForSet(kStackPointerGreaterThanCondition, node);
+  VisitStackPointerGreaterThan(node, &cont);
 }
 
-void InstructionSelector::MarkPairProjectionsAsWord32(Node* node) {
-  Node* projection0 = NodeProperties::FindProjection(node, 0);
-  if (projection0) {
-    MarkAsWord32(projection0);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadStackCheckOffset(node_t node) {
+  OperandGenerator g(this);
+  Emit(kArchStackCheckOffset, g.DefineAsRegister(node));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadFramePointer(node_t node) {
+  OperandGenerator g(this);
+  Emit(kArchFramePointer, g.DefineAsRegister(node));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadParentFramePointer(node_t node) {
+  OperandGenerator g(this);
+  Emit(kArchParentFramePointer, g.DefineAsRegister(node));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadRootRegister(node_t node) {
+  // Do nothing. Following loads/stores from this operator will use kMode_Root
+  // to load/store from an offset of the root register.
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Acos(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Acos);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Acosh(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Acosh);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Asin(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Asin);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Asinh(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Asinh);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Atan(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Atan);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Atanh(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Atanh);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Atan2(node_t node) {
+  VisitFloat64Ieee754Binop(node, kIeee754Float64Atan2);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Cbrt(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Cbrt);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Cos(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Cos);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Cosh(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Cosh);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Exp(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Exp);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Expm1(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Expm1);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Log(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Log);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Log1p(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Log1p);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Log2(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Log2);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Log10(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Log10);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Pow(node_t node) {
+  VisitFloat64Ieee754Binop(node, kIeee754Float64Pow);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sin(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Sin);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sinh(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Sinh);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Tan(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Tan);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Tanh(node_t node) {
+  VisitFloat64Ieee754Unop(node, kIeee754Float64Tanh);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitTableSwitch(
+    const SwitchInfo& sw, InstructionOperand const& index_operand) {
+  OperandGenerator g(this);
+  size_t input_count = 2 + sw.value_range();
+  DCHECK_LE(sw.value_range(), std::numeric_limits<size_t>::max() - 2);
+  auto* inputs =
+      zone()->template AllocateArray<InstructionOperand>(input_count);
+  inputs[0] = index_operand;
+  InstructionOperand default_operand = g.Label(sw.default_branch());
+  std::fill(&inputs[1], &inputs[input_count], default_operand);
+  for (const CaseInfo& c : sw.CasesUnsorted()) {
+    size_t value = c.value - sw.min_value();
+    DCHECK_LE(0u, value);
+    DCHECK_LT(value + 2, input_count);
+    inputs[value + 2] = g.Label(c.branch);
   }
-  Node* projection1 = NodeProperties::FindProjection(node, 1);
-  if (projection1) {
-    MarkAsWord32(projection1);
+  Emit(kArchTableSwitch, 0, nullptr, input_count, inputs, 0, nullptr);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitBinarySearchSwitch(
+    const SwitchInfo& sw, InstructionOperand const& value_operand) {
+  OperandGenerator g(this);
+  size_t input_count = 2 + sw.case_count() * 2;
+  DCHECK_LE(sw.case_count(), (std::numeric_limits<size_t>::max() - 2) / 2);
+  auto* inputs =
+      zone()->template AllocateArray<InstructionOperand>(input_count);
+  inputs[0] = value_operand;
+  inputs[1] = g.Label(sw.default_branch());
+  std::vector<CaseInfo> cases = sw.CasesSortedByValue();
+  for (size_t index = 0; index < cases.size(); ++index) {
+    const CaseInfo& c = cases[index];
+    inputs[index * 2 + 2 + 0] = g.TempImmediate(c.value);
+    inputs[index * 2 + 2 + 1] = g.Label(c.branch);
   }
+  Emit(kArchBinarySearchSwitch, 0, nullptr, input_count, inputs, 0, nullptr);
 }
 
-void InstructionSelector::VisitNode(Node* node) {
-  tick_counter_->TickAndMaybeEnterSafepoint();
-  DCHECK_NOT_NULL(schedule()->block(node));  // should only use scheduled nodes.
-  switch (node->opcode()) {
-    case IrOpcode::kTraceInstruction:
-#if V8_TARGET_ARCH_X64
-      return VisitTraceInstruction(node);
-#else
-      return;
-#endif
-    case IrOpcode::kStart:
-    case IrOpcode::kLoop:
-    case IrOpcode::kEnd:
-    case IrOpcode::kBranch:
-    case IrOpcode::kIfTrue:
-    case IrOpcode::kIfFalse:
-    case IrOpcode::kIfSuccess:
-    case IrOpcode::kSwitch:
-    case IrOpcode::kIfValue:
-    case IrOpcode::kIfDefault:
-    case IrOpcode::kEffectPhi:
-    case IrOpcode::kMerge:
-    case IrOpcode::kTerminate:
-    case IrOpcode::kBeginRegion:
-      // No code needed for these graph artifacts.
-      return;
-    case IrOpcode::kIfException:
-      return MarkAsTagged(node), VisitIfException(node);
-    case IrOpcode::kFinishRegion:
-      return MarkAsTagged(node), VisitFinishRegion(node);
-    case IrOpcode::kParameter: {
-      // Parameters should always be scheduled to the first block.
-      DCHECK_EQ(schedule()->block(node)->rpo_number(), 0);
-      MachineType type =
-          linkage()->GetParameterType(ParameterIndexOf(node->op()));
-      MarkAsRepresentation(type.representation(), node);
-      return VisitParameter(node);
-    }
-    case IrOpcode::kOsrValue:
-      return MarkAsTagged(node), VisitOsrValue(node);
-    case IrOpcode::kPhi: {
-      MachineRepresentation rep = PhiRepresentationOf(node->op());
-      if (rep == MachineRepresentation::kNone) return;
-      MarkAsRepresentation(rep, node);
-      return VisitPhi(node);
-    }
-    case IrOpcode::kProjection:
-      return VisitProjection(node);
-    case IrOpcode::kInt32Constant:
-    case IrOpcode::kInt64Constant:
-    case IrOpcode::kTaggedIndexConstant:
-    case IrOpcode::kExternalConstant:
-    case IrOpcode::kRelocatableInt32Constant:
-    case IrOpcode::kRelocatableInt64Constant:
-      return VisitConstant(node);
-    case IrOpcode::kFloat32Constant:
-      return MarkAsFloat32(node), VisitConstant(node);
-    case IrOpcode::kFloat64Constant:
-      return MarkAsFloat64(node), VisitConstant(node);
-    case IrOpcode::kHeapConstant:
-      return MarkAsTagged(node), VisitConstant(node);
-    case IrOpcode::kCompressedHeapConstant:
-      return MarkAsCompressed(node), VisitConstant(node);
-    case IrOpcode::kNumberConstant: {
-      double value = OpParameter<double>(node->op());
-      if (!IsSmiDouble(value)) MarkAsTagged(node);
-      return VisitConstant(node);
-    }
-    case IrOpcode::kCall:
-      return VisitCall(node);
-    case IrOpcode::kDeoptimizeIf:
-      return VisitDeoptimizeIf(node);
-    case IrOpcode::kDeoptimizeUnless:
-      return VisitDeoptimizeUnless(node);
-    case IrOpcode::kTrapIf:
-      return VisitTrapIf(node, TrapIdOf(node->op()));
-    case IrOpcode::kTrapUnless:
-      return VisitTrapUnless(node, TrapIdOf(node->op()));
-    case IrOpcode::kFrameState:
-    case IrOpcode::kStateValues:
-    case IrOpcode::kObjectState:
-      return;
-    case IrOpcode::kAbortCSADcheck:
-      VisitAbortCSADcheck(node);
-      return;
-    case IrOpcode::kDebugBreak:
-      VisitDebugBreak(node);
-      return;
-    case IrOpcode::kUnreachable:
-      VisitUnreachable(node);
-      return;
-    case IrOpcode::kStaticAssert:
-      VisitStaticAssert(node);
-      return;
-    case IrOpcode::kDeadValue:
-      VisitDeadValue(node);
-      return;
-    case IrOpcode::kComment:
-      VisitComment(node);
-      return;
-    case IrOpcode::kRetain:
-      VisitRetain(node);
-      return;
-    case IrOpcode::kLoad:
-    case IrOpcode::kLoadImmutable: {
-      LoadRepresentation type = LoadRepresentationOf(node->op());
-      MarkAsRepresentation(type.representation(), node);
-      return VisitLoad(node);
-    }
-    case IrOpcode::kLoadTransform: {
-      LoadTransformParameters params = LoadTransformParametersOf(node->op());
-      if (params.transformation == LoadTransformation::kS256Load32Splat ||
-          params.transformation == LoadTransformation::kS256Load64Splat) {
-        MarkAsRepresentation(MachineRepresentation::kSimd256, node);
-      } else {
-        MarkAsRepresentation(MachineRepresentation::kSimd128, node);
-      }
-      return VisitLoadTransform(node);
-    }
-    case IrOpcode::kLoadLane: {
-      MarkAsRepresentation(MachineRepresentation::kSimd128, node);
-      return VisitLoadLane(node);
-    }
-    case IrOpcode::kStore:
-      return VisitStore(node);
-    case IrOpcode::kProtectedStore:
-    case IrOpcode::kStoreTrapOnNull:
-      return VisitProtectedStore(node);
-    case IrOpcode::kStoreLane: {
-      MarkAsRepresentation(MachineRepresentation::kSimd128, node);
-      return VisitStoreLane(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastTaggedToWord(node_t node) {
+  EmitIdentity(node);
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitBitcastWordToTagged(
+    node_t node) {
+  OperandGenerator g(this);
+  Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(node->InputAt(0)));
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitBitcastWordToTagged(
+    node_t node) {
+  OperandGenerator g(this);
+  Emit(kArchNop, g.DefineSameAsFirst(node),
+       g.Use(this->Get(node).Cast<turboshaft::TaggedBitcastOp>().input()));
+}
+
+// 32 bit targets do not implement the following instructions.
+#if V8_TARGET_ARCH_32_BIT
+
+VISIT_UNSUPPORTED_OP(Word64And)
+VISIT_UNSUPPORTED_OP(Word64Or)
+VISIT_UNSUPPORTED_OP(Word64Xor)
+VISIT_UNSUPPORTED_OP(Word64Shl)
+VISIT_UNSUPPORTED_OP(Word64Shr)
+VISIT_UNSUPPORTED_OP(Word64Sar)
+VISIT_UNSUPPORTED_OP(Word64Rol)
+VISIT_UNSUPPORTED_OP(Word64Ror)
+VISIT_UNSUPPORTED_OP(Word64Clz)
+VISIT_UNSUPPORTED_OP(Word64Ctz)
+VISIT_UNSUPPORTED_OP(Word64ReverseBits)
+VISIT_UNSUPPORTED_OP(Word64Popcnt)
+VISIT_UNSUPPORTED_OP(Word64Equal)
+VISIT_UNSUPPORTED_OP(Int64Add)
+VISIT_UNSUPPORTED_OP(Int64Sub)
+VISIT_UNSUPPORTED_OP(Int64Mul)
+VISIT_UNSUPPORTED_OP(Int64MulHigh)
+VISIT_UNSUPPORTED_OP(Uint64MulHigh)
+VISIT_UNSUPPORTED_OP(Int64Div)
+VISIT_UNSUPPORTED_OP(Int64Mod)
+VISIT_UNSUPPORTED_OP(Uint64Div)
+VISIT_UNSUPPORTED_OP(Uint64Mod)
+VISIT_UNSUPPORTED_OP(Int64AddWithOverflow)
+VISIT_UNSUPPORTED_OP(Int64MulWithOverflow)
+VISIT_UNSUPPORTED_OP(Int64SubWithOverflow)
+VISIT_UNSUPPORTED_OP(Int64LessThan)
+VISIT_UNSUPPORTED_OP(Int64LessThanOrEqual)
+VISIT_UNSUPPORTED_OP(Uint64LessThan)
+VISIT_UNSUPPORTED_OP(Uint64LessThanOrEqual)
+VISIT_UNSUPPORTED_OP(BitcastWord32ToWord64)
+VISIT_UNSUPPORTED_OP(ChangeInt32ToInt64)
+VISIT_UNSUPPORTED_OP(ChangeInt64ToFloat64)
+VISIT_UNSUPPORTED_OP(ChangeUint32ToUint64)
+VISIT_UNSUPPORTED_OP(ChangeFloat64ToInt64)
+VISIT_UNSUPPORTED_OP(ChangeFloat64ToUint64)
+VISIT_UNSUPPORTED_OP(TruncateFloat64ToInt64)
+VISIT_UNSUPPORTED_OP(TruncateInt64ToInt32)
+VISIT_UNSUPPORTED_OP(TryTruncateFloat32ToInt64)
+VISIT_UNSUPPORTED_OP(TryTruncateFloat64ToInt64)
+VISIT_UNSUPPORTED_OP(TryTruncateFloat32ToUint64)
+VISIT_UNSUPPORTED_OP(TryTruncateFloat64ToUint64)
+VISIT_UNSUPPORTED_OP(TryTruncateFloat64ToInt32)
+VISIT_UNSUPPORTED_OP(TryTruncateFloat64ToUint32)
+VISIT_UNSUPPORTED_OP(RoundInt64ToFloat32)
+VISIT_UNSUPPORTED_OP(RoundInt64ToFloat64)
+VISIT_UNSUPPORTED_OP(RoundUint64ToFloat32)
+VISIT_UNSUPPORTED_OP(RoundUint64ToFloat64)
+VISIT_UNSUPPORTED_OP(BitcastFloat64ToInt64)
+VISIT_UNSUPPORTED_OP(BitcastInt64ToFloat64)
+VISIT_UNSUPPORTED_OP(SignExtendWord8ToInt64)
+VISIT_UNSUPPORTED_OP(SignExtendWord16ToInt64)
+VISIT_UNSUPPORTED_OP(SignExtendWord32ToInt64)
+#endif  // V8_TARGET_ARCH_32_BIT
+
+// 64 bit targets do not implement the following instructions.
+#if V8_TARGET_ARCH_64_BIT
+VISIT_UNSUPPORTED_OP(Int32PairAdd)
+VISIT_UNSUPPORTED_OP(Int32PairSub)
+VISIT_UNSUPPORTED_OP(Int32PairMul)
+VISIT_UNSUPPORTED_OP(Word32PairShl)
+VISIT_UNSUPPORTED_OP(Word32PairShr)
+VISIT_UNSUPPORTED_OP(Word32PairSar)
+VISIT_UNSUPPORTED_OP(BitcastWord32PairToFloat64)
+#endif  // V8_TARGET_ARCH_64_BIT
+
+#if !V8_TARGET_ARCH_IA32 && !V8_TARGET_ARCH_ARM && !V8_TARGET_ARCH_RISCV32
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairLoad(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairStore(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairAdd(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairSub(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairAnd(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairOr(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairXor(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairExchange(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairCompareExchange(
+    Node* node) {
+  UNIMPLEMENTED();
+}
+#endif  // !V8_TARGET_ARCH_IA32 && !V8_TARGET_ARCH_ARM
+        // && !V8_TARGET_ARCH_RISCV32
+
+#if !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_ARM64 && !V8_TARGET_ARCH_MIPS64 && \
+    !V8_TARGET_ARCH_S390 && !V8_TARGET_ARCH_PPC64 &&                          \
+    !V8_TARGET_ARCH_RISCV64 && !V8_TARGET_ARCH_LOONG64
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicLoad(Node* node) {
+  UNIMPLEMENTED();
+}
+
+VISIT_UNSUPPORTED_OP(Word64AtomicStore)
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicAdd(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicSub(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicAnd(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicOr(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicXor(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicExchange(Node* node) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicCompareExchange(
+    Node* node) {
+  UNIMPLEMENTED();
+}
+#endif  // !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_ARM64 && !V8_TARGET_ARCH_PPC64
+        // !V8_TARGET_ARCH_MIPS64 && !V8_TARGET_ARCH_S390 &&
+        // !V8_TARGET_ARCH_RISCV64 && !V8_TARGET_ARCH_LOONG64
+
+#if !V8_TARGET_ARCH_IA32 && !V8_TARGET_ARCH_ARM && !V8_TARGET_ARCH_RISCV32
+// This is only needed on 32-bit to split the 64-bit value into two operands.
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2SplatI32Pair(Node* node) {
+  UNIMPLEMENTED();
+}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ReplaceLaneI32Pair(Node* node) {
+  UNIMPLEMENTED();
+}
+#endif  // !V8_TARGET_ARCH_IA32 && !V8_TARGET_ARCH_ARM &&
+        // !V8_TARGET_ARCH_RISCV32
+
+#if !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_S390X && !V8_TARGET_ARCH_PPC64
+#if !V8_TARGET_ARCH_ARM64
+#if !V8_TARGET_ARCH_MIPS64 && !V8_TARGET_ARCH_LOONG64 && \
+    !V8_TARGET_ARCH_RISCV32 && !V8_TARGET_ARCH_RISCV64
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Splat(Node* node) {
+  UNIMPLEMENTED();
+}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ExtractLane(Node* node) {
+  UNIMPLEMENTED();
+}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ReplaceLane(Node* node) {
+  UNIMPLEMENTED();
+}
+#endif  // !V8_TARGET_ARCH_MIPS64 && !V8_TARGET_ARCH_LOONG64 &&
+        // !V8_TARGET_ARCH_RISCV64 && !V8_TARGET_ARCH_RISCV32
+#endif  // !V8_TARGET_ARCH_ARM64
+#endif  // !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_S390X && !V8_TARGET_ARCH_PPC64
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFinishRegion(Node* node) {
+  EmitIdentity(node);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitParameter(node_t node) {
+  OperandGenerator g(this);
+  int index = this->parameter_index_of(node);
+
+  if (linkage()->GetParameterLocation(index).IsNullRegister()) {
+    EmitMoveParamToFPR(node, index);
+  } else {
+    InstructionOperand op =
+        linkage()->ParameterHasSecondaryLocation(index)
+            ? g.DefineAsDualLocation(
+                  node, linkage()->GetParameterLocation(index),
+                  linkage()->GetParameterSecondaryLocation(index))
+            : g.DefineAsLocation(node, linkage()->GetParameterLocation(index));
+    Emit(kArchNop, op);
+  }
+}
+
+namespace {
+
+LinkageLocation ExceptionLocation() {
+  return LinkageLocation::ForRegister(kReturnRegister0.code(),
+                                      MachineType::TaggedPointer());
+}
+
+constexpr InstructionCode EncodeCallDescriptorFlags(
+    InstructionCode opcode, CallDescriptor::Flags flags) {
+  // Note: Not all bits of `flags` are preserved.
+  static_assert(CallDescriptor::kFlagsBitsEncodedInInstructionCode ==
+                MiscField::kSize);
+  DCHECK(Instruction::IsCallWithDescriptorFlags(opcode));
+  return opcode | MiscField::encode(flags & MiscField::kMax);
+}
+
+}  // namespace
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitIfException(node_t node) {
+  OperandGenerator g(this);
+  if constexpr (Adapter::IsTurbofan) {
+    DCHECK_EQ(IrOpcode::kCall, node->InputAt(1)->opcode());
+  }
+  Emit(kArchNop, g.DefineAsLocation(node, ExceptionLocation()));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitOsrValue(node_t node) {
+  OperandGenerator g(this);
+  int index = this->osr_value_index_of(node);
+  Emit(kArchNop,
+       g.DefineAsLocation(node, linkage()->GetOsrValueLocation(index)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitPhi(node_t node) {
+  const int input_count = this->value_input_count(node);
+  DCHECK_EQ(input_count, this->PredecessorCount(current_block_));
+  PhiInstruction* phi = instruction_zone()->template New<PhiInstruction>(
+      instruction_zone(), GetVirtualRegister(node),
+      static_cast<size_t>(input_count));
+  sequence()->InstructionBlockAt(this->rpo_number(current_block_))->AddPhi(phi);
+  for (int i = 0; i < input_count; ++i) {
+    node_t input = this->input_at(node, i);
+    MarkAsUsed(input);
+    phi->SetInput(static_cast<size_t>(i), GetVirtualRegister(input));
+  }
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitProjection(
+    turboshaft::OpIndex node) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  const ProjectionOp& projection = this->Get(node).Cast<ProjectionOp>();
+  const Operation& value_op = this->Get(projection.input());
+  if (value_op.Is<OverflowCheckedBinopOp>() || value_op.Is<TryChangeOp>()) {
+    if (projection.index == 0u) {
+      EmitIdentity(node);
+    } else {
+      DCHECK_EQ(1u, projection.index);
+      MarkAsUsed(projection.input());
     }
-    case IrOpcode::kWord32And:
-      return MarkAsWord32(node), VisitWord32And(node);
-    case IrOpcode::kWord32Or:
-      return MarkAsWord32(node), VisitWord32Or(node);
-    case IrOpcode::kWord32Xor:
-      return MarkAsWord32(node), VisitWord32Xor(node);
-    case IrOpcode::kWord32Shl:
-      return MarkAsWord32(node), VisitWord32Shl(node);
-    case IrOpcode::kWord32Shr:
-      return MarkAsWord32(node), VisitWord32Shr(node);
-    case IrOpcode::kWord32Sar:
-      return MarkAsWord32(node), VisitWord32Sar(node);
-    case IrOpcode::kWord32Rol:
-      return MarkAsWord32(node), VisitWord32Rol(node);
-    case IrOpcode::kWord32Ror:
-      return MarkAsWord32(node), VisitWord32Ror(node);
-    case IrOpcode::kWord32Equal:
-      return VisitWord32Equal(node);
-    case IrOpcode::kWord32Clz:
-      return MarkAsWord32(node), VisitWord32Clz(node);
-    case IrOpcode::kWord32Ctz:
-      return MarkAsWord32(node), VisitWord32Ctz(node);
-    case IrOpcode::kWord32ReverseBits:
-      return MarkAsWord32(node), VisitWord32ReverseBits(node);
-    case IrOpcode::kWord32ReverseBytes:
-      return MarkAsWord32(node), VisitWord32ReverseBytes(node);
-    case IrOpcode::kInt32AbsWithOverflow:
-      return MarkAsWord32(node), VisitInt32AbsWithOverflow(node);
-    case IrOpcode::kWord32Popcnt:
-      return MarkAsWord32(node), VisitWord32Popcnt(node);
-    case IrOpcode::kWord64Popcnt:
-      return MarkAsWord32(node), VisitWord64Popcnt(node);
-    case IrOpcode::kWord32Select:
-      return MarkAsWord32(node), VisitSelect(node);
-    case IrOpcode::kWord64And:
-      return MarkAsWord64(node), VisitWord64And(node);
-    case IrOpcode::kWord64Or:
-      return MarkAsWord64(node), VisitWord64Or(node);
-    case IrOpcode::kWord64Xor:
-      return MarkAsWord64(node), VisitWord64Xor(node);
-    case IrOpcode::kWord64Shl:
-      return MarkAsWord64(node), VisitWord64Shl(node);
-    case IrOpcode::kWord64Shr:
-      return MarkAsWord64(node), VisitWord64Shr(node);
-    case IrOpcode::kWord64Sar:
-      return MarkAsWord64(node), VisitWord64Sar(node);
-    case IrOpcode::kWord64Rol:
-      return MarkAsWord64(node), VisitWord64Rol(node);
-    case IrOpcode::kWord64Ror:
-      return MarkAsWord64(node), VisitWord64Ror(node);
-    case IrOpcode::kWord64Clz:
-      return MarkAsWord64(node), VisitWord64Clz(node);
-    case IrOpcode::kWord64Ctz:
-      return MarkAsWord64(node), VisitWord64Ctz(node);
-    case IrOpcode::kWord64ReverseBits:
-      return MarkAsWord64(node), VisitWord64ReverseBits(node);
-    case IrOpcode::kWord64ReverseBytes:
-      return MarkAsWord64(node), VisitWord64ReverseBytes(node);
-    case IrOpcode::kSimd128ReverseBytes:
-      return MarkAsSimd128(node), VisitSimd128ReverseBytes(node);
-    case IrOpcode::kInt64AbsWithOverflow:
-      return MarkAsWord64(node), VisitInt64AbsWithOverflow(node);
-    case IrOpcode::kWord64Equal:
-      return VisitWord64Equal(node);
-    case IrOpcode::kWord64Select:
-      return MarkAsWord64(node), VisitSelect(node);
-    case IrOpcode::kInt32Add:
-      return MarkAsWord32(node), VisitInt32Add(node);
+  } else if (value_op.Is<DidntThrowOp>()) {
+    // Nothing to do here?
+  } else if (value_op.Is<CallOp>()) {
+    // Call projections need to be behind the call's DidntThrow.
+    UNREACHABLE();
+  } else {
+    UNIMPLEMENTED();
+  }
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitProjection(Node* node) {
+  OperandGenerator g(this);
+  Node* value = node->InputAt(0);
+  switch (value->opcode()) {
     case IrOpcode::kInt32AddWithOverflow:
-      return MarkAsWord32(node), VisitInt32AddWithOverflow(node);
-    case IrOpcode::kInt32Sub:
-      return MarkAsWord32(node), VisitInt32Sub(node);
     case IrOpcode::kInt32SubWithOverflow:
-      return VisitInt32SubWithOverflow(node);
-    case IrOpcode::kInt32Mul:
-      return MarkAsWord32(node), VisitInt32Mul(node);
     case IrOpcode::kInt32MulWithOverflow:
-      return MarkAsWord32(node), VisitInt32MulWithOverflow(node);
-    case IrOpcode::kInt32MulHigh:
-      return VisitInt32MulHigh(node);
-    case IrOpcode::kInt64MulHigh:
-      return VisitInt64MulHigh(node);
-    case IrOpcode::kInt32Div:
-      return MarkAsWord32(node), VisitInt32Div(node);
-    case IrOpcode::kInt32Mod:
-      return MarkAsWord32(node), VisitInt32Mod(node);
-    case IrOpcode::kInt32LessThan:
-      return VisitInt32LessThan(node);
-    case IrOpcode::kInt32LessThanOrEqual:
-      return VisitInt32LessThanOrEqual(node);
-    case IrOpcode::kUint32Div:
-      return MarkAsWord32(node), VisitUint32Div(node);
-    case IrOpcode::kUint32LessThan:
-      return VisitUint32LessThan(node);
-    case IrOpcode::kUint32LessThanOrEqual:
-      return VisitUint32LessThanOrEqual(node);
-    case IrOpcode::kUint32Mod:
-      return MarkAsWord32(node), VisitUint32Mod(node);
-    case IrOpcode::kUint32MulHigh:
-      return VisitUint32MulHigh(node);
-    case IrOpcode::kUint64MulHigh:
-      return VisitUint64MulHigh(node);
-    case IrOpcode::kInt64Add:
-      return MarkAsWord64(node), VisitInt64Add(node);
     case IrOpcode::kInt64AddWithOverflow:
-      return MarkAsWord64(node), VisitInt64AddWithOverflow(node);
-    case IrOpcode::kInt64Sub:
-      return MarkAsWord64(node), VisitInt64Sub(node);
     case IrOpcode::kInt64SubWithOverflow:
-      return MarkAsWord64(node), VisitInt64SubWithOverflow(node);
-    case IrOpcode::kInt64Mul:
-      return MarkAsWord64(node), VisitInt64Mul(node);
     case IrOpcode::kInt64MulWithOverflow:
-      return MarkAsWord64(node), VisitInt64MulWithOverflow(node);
-    case IrOpcode::kInt64Div:
-      return MarkAsWord64(node), VisitInt64Div(node);
-    case IrOpcode::kInt64Mod:
-      return MarkAsWord64(node), VisitInt64Mod(node);
-    case IrOpcode::kInt64LessThan:
-      return VisitInt64LessThan(node);
-    case IrOpcode::kInt64LessThanOrEqual:
-      return VisitInt64LessThanOrEqual(node);
-    case IrOpcode::kUint64Div:
-      return MarkAsWord64(node), VisitUint64Div(node);
-    case IrOpcode::kUint64LessThan:
-      return VisitUint64LessThan(node);
-    case IrOpcode::kUint64LessThanOrEqual:
-      return VisitUint64LessThanOrEqual(node);
-    case IrOpcode::kUint64Mod:
-      return MarkAsWord64(node), VisitUint64Mod(node);
-    case IrOpcode::kBitcastTaggedToWord:
-    case IrOpcode::kBitcastTaggedToWordForTagAndSmiBits:
-      return MarkAsRepresentation(MachineType::PointerRepresentation(), node),
-             VisitBitcastTaggedToWord(node);
-    case IrOpcode::kBitcastWordToTagged:
-      return MarkAsTagged(node), VisitBitcastWordToTagged(node);
-    case IrOpcode::kBitcastWordToTaggedSigned:
-      return MarkAsRepresentation(MachineRepresentation::kTaggedSigned, node),
-             EmitIdentity(node);
-    case IrOpcode::kChangeFloat32ToFloat64:
-      return MarkAsFloat64(node), VisitChangeFloat32ToFloat64(node);
-    case IrOpcode::kChangeInt32ToFloat64:
-      return MarkAsFloat64(node), VisitChangeInt32ToFloat64(node);
-    case IrOpcode::kChangeInt64ToFloat64:
-      return MarkAsFloat64(node), VisitChangeInt64ToFloat64(node);
-    case IrOpcode::kChangeUint32ToFloat64:
-      return MarkAsFloat64(node), VisitChangeUint32ToFloat64(node);
-    case IrOpcode::kChangeFloat64ToInt32:
-      return MarkAsWord32(node), VisitChangeFloat64ToInt32(node);
-    case IrOpcode::kChangeFloat64ToInt64:
-      return MarkAsWord64(node), VisitChangeFloat64ToInt64(node);
-    case IrOpcode::kChangeFloat64ToUint32:
-      return MarkAsWord32(node), VisitChangeFloat64ToUint32(node);
-    case IrOpcode::kChangeFloat64ToUint64:
-      return MarkAsWord64(node), VisitChangeFloat64ToUint64(node);
-    case IrOpcode::kFloat64SilenceNaN:
-      MarkAsFloat64(node);
-      if (CanProduceSignalingNaN(node->InputAt(0))) {
-        return VisitFloat64SilenceNaN(node);
-      } else {
-        return EmitIdentity(node);
-      }
-    case IrOpcode::kTruncateFloat64ToInt64:
-      return MarkAsWord64(node), VisitTruncateFloat64ToInt64(node);
-    case IrOpcode::kTruncateFloat64ToUint32:
-      return MarkAsWord32(node), VisitTruncateFloat64ToUint32(node);
-    case IrOpcode::kTruncateFloat32ToInt32:
-      return MarkAsWord32(node), VisitTruncateFloat32ToInt32(node);
-    case IrOpcode::kTruncateFloat32ToUint32:
-      return MarkAsWord32(node), VisitTruncateFloat32ToUint32(node);
     case IrOpcode::kTryTruncateFloat32ToInt64:
-      return MarkAsWord64(node), VisitTryTruncateFloat32ToInt64(node);
     case IrOpcode::kTryTruncateFloat64ToInt64:
-      return MarkAsWord64(node), VisitTryTruncateFloat64ToInt64(node);
     case IrOpcode::kTryTruncateFloat32ToUint64:
-      return MarkAsWord64(node), VisitTryTruncateFloat32ToUint64(node);
     case IrOpcode::kTryTruncateFloat64ToUint64:
-      return MarkAsWord64(node), VisitTryTruncateFloat64ToUint64(node);
     case IrOpcode::kTryTruncateFloat64ToInt32:
-      return MarkAsWord32(node), VisitTryTruncateFloat64ToInt32(node);
     case IrOpcode::kTryTruncateFloat64ToUint32:
-      return MarkAsWord32(node), VisitTryTruncateFloat64ToUint32(node);
-    case IrOpcode::kBitcastWord32ToWord64:
-      return MarkAsWord64(node), VisitBitcastWord32ToWord64(node);
-    case IrOpcode::kChangeInt32ToInt64:
-      return MarkAsWord64(node), VisitChangeInt32ToInt64(node);
-    case IrOpcode::kChangeUint32ToUint64:
-      return MarkAsWord64(node), VisitChangeUint32ToUint64(node);
-    case IrOpcode::kTruncateFloat64ToFloat32:
-      return MarkAsFloat32(node), VisitTruncateFloat64ToFloat32(node);
-    case IrOpcode::kTruncateFloat64ToWord32:
-      return MarkAsWord32(node), VisitTruncateFloat64ToWord32(node);
-    case IrOpcode::kTruncateInt64ToInt32:
-      return MarkAsWord32(node), VisitTruncateInt64ToInt32(node);
-    case IrOpcode::kRoundFloat64ToInt32:
-      return MarkAsWord32(node), VisitRoundFloat64ToInt32(node);
-    case IrOpcode::kRoundInt64ToFloat32:
-      return MarkAsFloat32(node), VisitRoundInt64ToFloat32(node);
-    case IrOpcode::kRoundInt32ToFloat32:
-      return MarkAsFloat32(node), VisitRoundInt32ToFloat32(node);
-    case IrOpcode::kRoundInt64ToFloat64:
-      return MarkAsFloat64(node), VisitRoundInt64ToFloat64(node);
-    case IrOpcode::kBitcastFloat32ToInt32:
-      return MarkAsWord32(node), VisitBitcastFloat32ToInt32(node);
-    case IrOpcode::kRoundUint32ToFloat32:
-      return MarkAsFloat32(node), VisitRoundUint32ToFloat32(node);
-    case IrOpcode::kRoundUint64ToFloat32:
-      return MarkAsFloat64(node), VisitRoundUint64ToFloat32(node);
-    case IrOpcode::kRoundUint64ToFloat64:
-      return MarkAsFloat64(node), VisitRoundUint64ToFloat64(node);
-    case IrOpcode::kBitcastFloat64ToInt64:
-      return MarkAsWord64(node), VisitBitcastFloat64ToInt64(node);
-    case IrOpcode::kBitcastInt32ToFloat32:
-      return MarkAsFloat32(node), VisitBitcastInt32ToFloat32(node);
-    case IrOpcode::kBitcastInt64ToFloat64:
-      return MarkAsFloat64(node), VisitBitcastInt64ToFloat64(node);
-    case IrOpcode::kFloat32Add:
-      return MarkAsFloat32(node), VisitFloat32Add(node);
-    case IrOpcode::kFloat32Sub:
-      return MarkAsFloat32(node), VisitFloat32Sub(node);
-    case IrOpcode::kFloat32Neg:
-      return MarkAsFloat32(node), VisitFloat32Neg(node);
-    case IrOpcode::kFloat32Mul:
-      return MarkAsFloat32(node), VisitFloat32Mul(node);
-    case IrOpcode::kFloat32Div:
-      return MarkAsFloat32(node), VisitFloat32Div(node);
-    case IrOpcode::kFloat32Abs:
-      return MarkAsFloat32(node), VisitFloat32Abs(node);
-    case IrOpcode::kFloat32Sqrt:
-      return MarkAsFloat32(node), VisitFloat32Sqrt(node);
-    case IrOpcode::kFloat32Equal:
-      return VisitFloat32Equal(node);
-    case IrOpcode::kFloat32LessThan:
-      return VisitFloat32LessThan(node);
-    case IrOpcode::kFloat32LessThanOrEqual:
-      return VisitFloat32LessThanOrEqual(node);
-    case IrOpcode::kFloat32Max:
-      return MarkAsFloat32(node), VisitFloat32Max(node);
-    case IrOpcode::kFloat32Min:
-      return MarkAsFloat32(node), VisitFloat32Min(node);
-    case IrOpcode::kFloat32Select:
-      return MarkAsFloat32(node), VisitSelect(node);
-    case IrOpcode::kFloat64Add:
-      return MarkAsFloat64(node), VisitFloat64Add(node);
-    case IrOpcode::kFloat64Sub:
-      return MarkAsFloat64(node), VisitFloat64Sub(node);
-    case IrOpcode::kFloat64Neg:
-      return MarkAsFloat64(node), VisitFloat64Neg(node);
-    case IrOpcode::kFloat64Mul:
-      return MarkAsFloat64(node), VisitFloat64Mul(node);
-    case IrOpcode::kFloat64Div:
-      return MarkAsFloat64(node), VisitFloat64Div(node);
-    case IrOpcode::kFloat64Mod:
-      return MarkAsFloat64(node), VisitFloat64Mod(node);
-    case IrOpcode::kFloat64Min:
-      return MarkAsFloat64(node), VisitFloat64Min(node);
-    case IrOpcode::kFloat64Max:
-      return MarkAsFloat64(node), VisitFloat64Max(node);
-    case IrOpcode::kFloat64Abs:
-      return MarkAsFloat64(node), VisitFloat64Abs(node);
-    case IrOpcode::kFloat64Acos:
-      return MarkAsFloat64(node), VisitFloat64Acos(node);
-    case IrOpcode::kFloat64Acosh:
-      return MarkAsFloat64(node), VisitFloat64Acosh(node);
-    case IrOpcode::kFloat64Asin:
-      return MarkAsFloat64(node), VisitFloat64Asin(node);
-    case IrOpcode::kFloat64Asinh:
-      return MarkAsFloat64(node), VisitFloat64Asinh(node);
-    case IrOpcode::kFloat64Atan:
-      return MarkAsFloat64(node), VisitFloat64Atan(node);
-    case IrOpcode::kFloat64Atanh:
-      return MarkAsFloat64(node), VisitFloat64Atanh(node);
-    case IrOpcode::kFloat64Atan2:
-      return MarkAsFloat64(node), VisitFloat64Atan2(node);
-    case IrOpcode::kFloat64Cbrt:
-      return MarkAsFloat64(node), VisitFloat64Cbrt(node);
-    case IrOpcode::kFloat64Cos:
-      return MarkAsFloat64(node), VisitFloat64Cos(node);
-    case IrOpcode::kFloat64Cosh:
-      return MarkAsFloat64(node), VisitFloat64Cosh(node);
-    case IrOpcode::kFloat64Exp:
-      return MarkAsFloat64(node), VisitFloat64Exp(node);
-    case IrOpcode::kFloat64Expm1:
-      return MarkAsFloat64(node), VisitFloat64Expm1(node);
-    case IrOpcode::kFloat64Log:
-      return MarkAsFloat64(node), VisitFloat64Log(node);
-    case IrOpcode::kFloat64Log1p:
-      return MarkAsFloat64(node), VisitFloat64Log1p(node);
-    case IrOpcode::kFloat64Log10:
-      return MarkAsFloat64(node), VisitFloat64Log10(node);
-    case IrOpcode::kFloat64Log2:
-      return MarkAsFloat64(node), VisitFloat64Log2(node);
-    case IrOpcode::kFloat64Pow:
-      return MarkAsFloat64(node), VisitFloat64Pow(node);
-    case IrOpcode::kFloat64Sin:
-      return MarkAsFloat64(node), VisitFloat64Sin(node);
-    case IrOpcode::kFloat64Sinh:
-      return MarkAsFloat64(node), VisitFloat64Sinh(node);
-    case IrOpcode::kFloat64Sqrt:
-      return MarkAsFloat64(node), VisitFloat64Sqrt(node);
-    case IrOpcode::kFloat64Tan:
-      return MarkAsFloat64(node), VisitFloat64Tan(node);
-    case IrOpcode::kFloat64Tanh:
-      return MarkAsFloat64(node), VisitFloat64Tanh(node);
-    case IrOpcode::kFloat64Equal:
-      return VisitFloat64Equal(node);
-    case IrOpcode::kFloat64LessThan:
-      return VisitFloat64LessThan(node);
-    case IrOpcode::kFloat64LessThanOrEqual:
-      return VisitFloat64LessThanOrEqual(node);
-    case IrOpcode::kFloat64Select:
-      return MarkAsFloat64(node), VisitSelect(node);
-    case IrOpcode::kFloat32RoundDown:
-      return MarkAsFloat32(node), VisitFloat32RoundDown(node);
-    case IrOpcode::kFloat64RoundDown:
-      return MarkAsFloat64(node), VisitFloat64RoundDown(node);
-    case IrOpcode::kFloat32RoundUp:
-      return MarkAsFloat32(node), VisitFloat32RoundUp(node);
-    case IrOpcode::kFloat64RoundUp:
-      return MarkAsFloat64(node), VisitFloat64RoundUp(node);
-    case IrOpcode::kFloat32RoundTruncate:
-      return MarkAsFloat32(node), VisitFloat32RoundTruncate(node);
-    case IrOpcode::kFloat64RoundTruncate:
-      return MarkAsFloat64(node), VisitFloat64RoundTruncate(node);
-    case IrOpcode::kFloat64RoundTiesAway:
-      return MarkAsFloat64(node), VisitFloat64RoundTiesAway(node);
-    case IrOpcode::kFloat32RoundTiesEven:
-      return MarkAsFloat32(node), VisitFloat32RoundTiesEven(node);
-    case IrOpcode::kFloat64RoundTiesEven:
-      return MarkAsFloat64(node), VisitFloat64RoundTiesEven(node);
-    case IrOpcode::kFloat64ExtractLowWord32:
-      return MarkAsWord32(node), VisitFloat64ExtractLowWord32(node);
-    case IrOpcode::kFloat64ExtractHighWord32:
-      return MarkAsWord32(node), VisitFloat64ExtractHighWord32(node);
-    case IrOpcode::kFloat64InsertLowWord32:
-      return MarkAsFloat64(node), VisitFloat64InsertLowWord32(node);
-    case IrOpcode::kFloat64InsertHighWord32:
-      return MarkAsFloat64(node), VisitFloat64InsertHighWord32(node);
-    case IrOpcode::kStackSlot:
-      return VisitStackSlot(node);
-    case IrOpcode::kStackPointerGreaterThan:
-      return VisitStackPointerGreaterThan(node);
-    case IrOpcode::kLoadStackCheckOffset:
-      return VisitLoadStackCheckOffset(node);
-    case IrOpcode::kLoadFramePointer:
-      return VisitLoadFramePointer(node);
-    case IrOpcode::kLoadParentFramePointer:
-      return VisitLoadParentFramePointer(node);
-    case IrOpcode::kLoadRootRegister:
-      return VisitLoadRootRegister(node);
-    case IrOpcode::kUnalignedLoad: {
-      LoadRepresentation type = LoadRepresentationOf(node->op());
-      MarkAsRepresentation(type.representation(), node);
-      return VisitUnalignedLoad(node);
-    }
-    case IrOpcode::kUnalignedStore:
-      return VisitUnalignedStore(node);
     case IrOpcode::kInt32PairAdd:
-      MarkAsWord32(node);
-      MarkPairProjectionsAsWord32(node);
-      return VisitInt32PairAdd(node);
     case IrOpcode::kInt32PairSub:
-      MarkAsWord32(node);
-      MarkPairProjectionsAsWord32(node);
-      return VisitInt32PairSub(node);
     case IrOpcode::kInt32PairMul:
-      MarkAsWord32(node);
-      MarkPairProjectionsAsWord32(node);
-      return VisitInt32PairMul(node);
     case IrOpcode::kWord32PairShl:
-      MarkAsWord32(node);
-      MarkPairProjectionsAsWord32(node);
-      return VisitWord32PairShl(node);
     case IrOpcode::kWord32PairShr:
-      MarkAsWord32(node);
-      MarkPairProjectionsAsWord32(node);
-      return VisitWord32PairShr(node);
     case IrOpcode::kWord32PairSar:
-      MarkAsWord32(node);
-      MarkPairProjectionsAsWord32(node);
-      return VisitWord32PairSar(node);
-    case IrOpcode::kMemoryBarrier:
-      return VisitMemoryBarrier(node);
-    case IrOpcode::kWord32AtomicLoad: {
-      AtomicLoadParameters params = AtomicLoadParametersOf(node->op());
-      LoadRepresentation type = params.representation();
-      MarkAsRepresentation(type.representation(), node);
-      return VisitWord32AtomicLoad(node);
-    }
-    case IrOpcode::kWord64AtomicLoad: {
-      AtomicLoadParameters params = AtomicLoadParametersOf(node->op());
-      LoadRepresentation type = params.representation();
-      MarkAsRepresentation(type.representation(), node);
-      return VisitWord64AtomicLoad(node);
+    case IrOpcode::kInt32AbsWithOverflow:
+    case IrOpcode::kInt64AbsWithOverflow:
+      if (ProjectionIndexOf(node->op()) == 0u) {
+        EmitIdentity(node);
+      } else {
+        DCHECK_EQ(1u, ProjectionIndexOf(node->op()));
+        MarkAsUsed(value);
+      }
+      break;
+    case IrOpcode::kCall:
+    case IrOpcode::kWord32AtomicPairLoad:
+    case IrOpcode::kWord32AtomicPairExchange:
+    case IrOpcode::kWord32AtomicPairCompareExchange:
+    case IrOpcode::kWord32AtomicPairAdd:
+    case IrOpcode::kWord32AtomicPairSub:
+    case IrOpcode::kWord32AtomicPairAnd:
+    case IrOpcode::kWord32AtomicPairOr:
+    case IrOpcode::kWord32AtomicPairXor:
+      // Nothing to do for these opcodes.
+      break;
+    default:
+      UNREACHABLE();
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitConstant(node_t node) {
+  // We must emit a NOP here because every live range needs a defining
+  // instruction in the register allocator.
+  OperandGenerator g(this);
+  Emit(kArchNop, g.DefineAsConstant(node));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::UpdateMaxPushedArgumentCount(size_t count) {
+  *max_pushed_argument_count_ = std::max(count, *max_pushed_argument_count_);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitCall(node_t node, block_t handler) {
+  OperandGenerator g(this);
+  auto call = this->call_view(node);
+  const CallDescriptor* call_descriptor = call.call_descriptor();
+  SaveFPRegsMode mode = call_descriptor->NeedsCallerSavedFPRegisters()
+                            ? SaveFPRegsMode::kSave
+                            : SaveFPRegsMode::kIgnore;
+
+  if (call_descriptor->NeedsCallerSavedRegisters()) {
+    Emit(kArchSaveCallerRegisters | MiscField::encode(static_cast<int>(mode)),
+         g.NoOutput());
+  }
+
+  FrameStateDescriptor* frame_state_descriptor = nullptr;
+  if (call_descriptor->NeedsFrameState()) {
+    frame_state_descriptor = GetFrameStateDescriptor(call.frame_state());
+  }
+
+  CallBuffer buffer(zone(), call_descriptor, frame_state_descriptor);
+  CallDescriptor::Flags flags = call_descriptor->flags();
+
+  // Compute InstructionOperands for inputs and outputs.
+  // TODO(turbofan): on some architectures it's probably better to use
+  // the code object in a register if there are multiple uses of it.
+  // Improve constant pool and the heuristics in the register allocator
+  // for where to emit constants.
+  CallBufferFlags call_buffer_flags(kCallCodeImmediate | kCallAddressImmediate);
+  if (flags & CallDescriptor::kFixedTargetRegister) {
+    call_buffer_flags |= kCallFixedTargetRegister;
+  }
+  InitializeCallBuffer(node, &buffer, call_buffer_flags);
+
+  EmitPrepareArguments(&buffer.pushed_nodes, call_descriptor, node);
+  UpdateMaxPushedArgumentCount(buffer.pushed_nodes.size());
+
+  // Pass label of exception handler block.
+  if (handler) {
+    if constexpr (Adapter::IsTurbofan) {
+      DCHECK_EQ(IrOpcode::kIfException, handler->front()->opcode());
     }
-    case IrOpcode::kWord32AtomicStore:
-      return VisitWord32AtomicStore(node);
-    case IrOpcode::kWord64AtomicStore:
-      return VisitWord64AtomicStore(node);
-    case IrOpcode::kWord32AtomicPairStore:
-      return VisitWord32AtomicPairStore(node);
-    case IrOpcode::kWord32AtomicPairLoad: {
-      MarkAsWord32(node);
-      MarkPairProjectionsAsWord32(node);
-      return VisitWord32AtomicPairLoad(node);
+    flags |= CallDescriptor::kHasExceptionHandler;
+    buffer.instruction_args.push_back(g.Label(handler));
+  }
+
+  // Select the appropriate opcode based on the call type.
+  InstructionCode opcode;
+  switch (call_descriptor->kind()) {
+    case CallDescriptor::kCallAddress: {
+      int gp_param_count =
+          static_cast<int>(call_descriptor->GPParameterCount());
+      int fp_param_count =
+          static_cast<int>(call_descriptor->FPParameterCount());
+#if ABI_USES_FUNCTION_DESCRIPTORS
+      // Highest fp_param_count bit is used on AIX to indicate if a CFunction
+      // call has function descriptor or not.
+      static_assert(FPParamField::kSize == kHasFunctionDescriptorBitShift + 1);
+      if (!call_descriptor->NoFunctionDescriptor()) {
+        fp_param_count |= 1 << kHasFunctionDescriptorBitShift;
+      }
+#endif
+      opcode = kArchCallCFunction | ParamField::encode(gp_param_count) |
+               FPParamField::encode(fp_param_count);
+      break;
     }
-#define ATOMIC_CASE(name, rep)                         \
-  case IrOpcode::k##rep##Atomic##name: {               \
-    MachineType type = AtomicOpType(node->op());       \
-    MarkAsRepresentation(type.representation(), node); \
-    return Visit##rep##Atomic##name(node);             \
+    case CallDescriptor::kCallCodeObject:
+      opcode = EncodeCallDescriptorFlags(kArchCallCodeObject, flags);
+      break;
+    case CallDescriptor::kCallJSFunction:
+      opcode = EncodeCallDescriptorFlags(kArchCallJSFunction, flags);
+      break;
+#if V8_ENABLE_WEBASSEMBLY
+    case CallDescriptor::kCallWasmCapiFunction:
+    case CallDescriptor::kCallWasmFunction:
+    case CallDescriptor::kCallWasmImportWrapper:
+      opcode = EncodeCallDescriptorFlags(kArchCallWasmFunction, flags);
+      break;
+#endif  // V8_ENABLE_WEBASSEMBLY
+    case CallDescriptor::kCallBuiltinPointer:
+      opcode = EncodeCallDescriptorFlags(kArchCallBuiltinPointer, flags);
+      break;
   }
-      ATOMIC_CASE(Add, Word32)
-      ATOMIC_CASE(Add, Word64)
-      ATOMIC_CASE(Sub, Word32)
-      ATOMIC_CASE(Sub, Word64)
-      ATOMIC_CASE(And, Word32)
-      ATOMIC_CASE(And, Word64)
-      ATOMIC_CASE(Or, Word32)
-      ATOMIC_CASE(Or, Word64)
-      ATOMIC_CASE(Xor, Word32)
-      ATOMIC_CASE(Xor, Word64)
-      ATOMIC_CASE(Exchange, Word32)
-      ATOMIC_CASE(Exchange, Word64)
-      ATOMIC_CASE(CompareExchange, Word32)
-      ATOMIC_CASE(CompareExchange, Word64)
-#undef ATOMIC_CASE
-#define ATOMIC_CASE(name)                     \
-  case IrOpcode::kWord32AtomicPair##name: {   \
-    MarkAsWord32(node);                       \
-    MarkPairProjectionsAsWord32(node);        \
-    return VisitWord32AtomicPair##name(node); \
+
+  // Emit the call instruction.
+  size_t const output_count = buffer.outputs.size();
+  auto* outputs = output_count ? &buffer.outputs.front() : nullptr;
+  Instruction* call_instr =
+      Emit(opcode, output_count, outputs, buffer.instruction_args.size(),
+           &buffer.instruction_args.front());
+  if (instruction_selection_failed()) return;
+  call_instr->MarkAsCall();
+
+  EmitPrepareResults(&(buffer.output_nodes), call_descriptor, node);
+
+  if (call_descriptor->NeedsCallerSavedRegisters()) {
+    Emit(
+        kArchRestoreCallerRegisters | MiscField::encode(static_cast<int>(mode)),
+        g.NoOutput());
   }
-      ATOMIC_CASE(Add)
-      ATOMIC_CASE(Sub)
-      ATOMIC_CASE(And)
-      ATOMIC_CASE(Or)
-      ATOMIC_CASE(Xor)
-      ATOMIC_CASE(Exchange)
-      ATOMIC_CASE(CompareExchange)
-#undef ATOMIC_CASE
-    case IrOpcode::kProtectedLoad:
-    case IrOpcode::kLoadTrapOnNull: {
-      LoadRepresentation type = LoadRepresentationOf(node->op());
-      MarkAsRepresentation(type.representation(), node);
-      return VisitProtectedLoad(node);
-    }
-    case IrOpcode::kSignExtendWord8ToInt32:
-      return MarkAsWord32(node), VisitSignExtendWord8ToInt32(node);
-    case IrOpcode::kSignExtendWord16ToInt32:
-      return MarkAsWord32(node), VisitSignExtendWord16ToInt32(node);
-    case IrOpcode::kSignExtendWord8ToInt64:
-      return MarkAsWord64(node), VisitSignExtendWord8ToInt64(node);
-    case IrOpcode::kSignExtendWord16ToInt64:
-      return MarkAsWord64(node), VisitSignExtendWord16ToInt64(node);
-    case IrOpcode::kSignExtendWord32ToInt64:
-      return MarkAsWord64(node), VisitSignExtendWord32ToInt64(node);
-    case IrOpcode::kF64x2Splat:
-      return MarkAsSimd128(node), VisitF64x2Splat(node);
-    case IrOpcode::kF64x2ExtractLane:
-      return MarkAsFloat64(node), VisitF64x2ExtractLane(node);
-    case IrOpcode::kF64x2ReplaceLane:
-      return MarkAsSimd128(node), VisitF64x2ReplaceLane(node);
-    case IrOpcode::kF64x2Abs:
-      return MarkAsSimd128(node), VisitF64x2Abs(node);
-    case IrOpcode::kF64x2Neg:
-      return MarkAsSimd128(node), VisitF64x2Neg(node);
-    case IrOpcode::kF64x2Sqrt:
-      return MarkAsSimd128(node), VisitF64x2Sqrt(node);
-    case IrOpcode::kF64x2Add:
-      return MarkAsSimd128(node), VisitF64x2Add(node);
-    case IrOpcode::kF64x2Sub:
-      return MarkAsSimd128(node), VisitF64x2Sub(node);
-    case IrOpcode::kF64x2Mul:
-      return MarkAsSimd128(node), VisitF64x2Mul(node);
-    case IrOpcode::kF64x2Div:
-      return MarkAsSimd128(node), VisitF64x2Div(node);
-    case IrOpcode::kF64x2Min:
-      return MarkAsSimd128(node), VisitF64x2Min(node);
-    case IrOpcode::kF64x2Max:
-      return MarkAsSimd128(node), VisitF64x2Max(node);
-    case IrOpcode::kF64x2Eq:
-      return MarkAsSimd128(node), VisitF64x2Eq(node);
-    case IrOpcode::kF64x2Ne:
-      return MarkAsSimd128(node), VisitF64x2Ne(node);
-    case IrOpcode::kF64x2Lt:
-      return MarkAsSimd128(node), VisitF64x2Lt(node);
-    case IrOpcode::kF64x2Le:
-      return MarkAsSimd128(node), VisitF64x2Le(node);
-    case IrOpcode::kF64x2Qfma:
-      return MarkAsSimd128(node), VisitF64x2Qfma(node);
-    case IrOpcode::kF64x2Qfms:
-      return MarkAsSimd128(node), VisitF64x2Qfms(node);
-    case IrOpcode::kF64x2Pmin:
-      return MarkAsSimd128(node), VisitF64x2Pmin(node);
-    case IrOpcode::kF64x2Pmax:
-      return MarkAsSimd128(node), VisitF64x2Pmax(node);
-    case IrOpcode::kF64x2Ceil:
-      return MarkAsSimd128(node), VisitF64x2Ceil(node);
-    case IrOpcode::kF64x2Floor:
-      return MarkAsSimd128(node), VisitF64x2Floor(node);
-    case IrOpcode::kF64x2Trunc:
-      return MarkAsSimd128(node), VisitF64x2Trunc(node);
-    case IrOpcode::kF64x2NearestInt:
-      return MarkAsSimd128(node), VisitF64x2NearestInt(node);
-    case IrOpcode::kF64x2ConvertLowI32x4S:
-      return MarkAsSimd128(node), VisitF64x2ConvertLowI32x4S(node);
-    case IrOpcode::kF64x2ConvertLowI32x4U:
-      return MarkAsSimd128(node), VisitF64x2ConvertLowI32x4U(node);
-    case IrOpcode::kF64x2PromoteLowF32x4:
-      return MarkAsSimd128(node), VisitF64x2PromoteLowF32x4(node);
-    case IrOpcode::kF32x4Splat:
-      return MarkAsSimd128(node), VisitF32x4Splat(node);
-    case IrOpcode::kF32x4ExtractLane:
-      return MarkAsFloat32(node), VisitF32x4ExtractLane(node);
-    case IrOpcode::kF32x4ReplaceLane:
-      return MarkAsSimd128(node), VisitF32x4ReplaceLane(node);
-    case IrOpcode::kF32x4SConvertI32x4:
-      return MarkAsSimd128(node), VisitF32x4SConvertI32x4(node);
-    case IrOpcode::kF32x4UConvertI32x4:
-      return MarkAsSimd128(node), VisitF32x4UConvertI32x4(node);
-    case IrOpcode::kF32x4Abs:
-      return MarkAsSimd128(node), VisitF32x4Abs(node);
-    case IrOpcode::kF32x4Neg:
-      return MarkAsSimd128(node), VisitF32x4Neg(node);
-    case IrOpcode::kF32x4Sqrt:
-      return MarkAsSimd128(node), VisitF32x4Sqrt(node);
-    case IrOpcode::kF32x4Add:
-      return MarkAsSimd128(node), VisitF32x4Add(node);
-    case IrOpcode::kF32x4Sub:
-      return MarkAsSimd128(node), VisitF32x4Sub(node);
-    case IrOpcode::kF32x4Mul:
-      return MarkAsSimd128(node), VisitF32x4Mul(node);
-    case IrOpcode::kF32x4Div:
-      return MarkAsSimd128(node), VisitF32x4Div(node);
-    case IrOpcode::kF32x4Min:
-      return MarkAsSimd128(node), VisitF32x4Min(node);
-    case IrOpcode::kF32x4Max:
-      return MarkAsSimd128(node), VisitF32x4Max(node);
-    case IrOpcode::kF32x4Eq:
-      return MarkAsSimd128(node), VisitF32x4Eq(node);
-    case IrOpcode::kF32x4Ne:
-      return MarkAsSimd128(node), VisitF32x4Ne(node);
-    case IrOpcode::kF32x4Lt:
-      return MarkAsSimd128(node), VisitF32x4Lt(node);
-    case IrOpcode::kF32x4Le:
-      return MarkAsSimd128(node), VisitF32x4Le(node);
-    case IrOpcode::kF32x4Qfma:
-      return MarkAsSimd128(node), VisitF32x4Qfma(node);
-    case IrOpcode::kF32x4Qfms:
-      return MarkAsSimd128(node), VisitF32x4Qfms(node);
-    case IrOpcode::kF32x4Pmin:
-      return MarkAsSimd128(node), VisitF32x4Pmin(node);
-    case IrOpcode::kF32x4Pmax:
-      return MarkAsSimd128(node), VisitF32x4Pmax(node);
-    case IrOpcode::kF32x4Ceil:
-      return MarkAsSimd128(node), VisitF32x4Ceil(node);
-    case IrOpcode::kF32x4Floor:
-      return MarkAsSimd128(node), VisitF32x4Floor(node);
-    case IrOpcode::kF32x4Trunc:
-      return MarkAsSimd128(node), VisitF32x4Trunc(node);
-    case IrOpcode::kF32x4NearestInt:
-      return MarkAsSimd128(node), VisitF32x4NearestInt(node);
-    case IrOpcode::kF32x4DemoteF64x2Zero:
-      return MarkAsSimd128(node), VisitF32x4DemoteF64x2Zero(node);
-    case IrOpcode::kI64x2Splat:
-      return MarkAsSimd128(node), VisitI64x2Splat(node);
-    case IrOpcode::kI64x2SplatI32Pair:
-      return MarkAsSimd128(node), VisitI64x2SplatI32Pair(node);
-    case IrOpcode::kI64x2ExtractLane:
-      return MarkAsWord64(node), VisitI64x2ExtractLane(node);
-    case IrOpcode::kI64x2ReplaceLane:
-      return MarkAsSimd128(node), VisitI64x2ReplaceLane(node);
-    case IrOpcode::kI64x2ReplaceLaneI32Pair:
-      return MarkAsSimd128(node), VisitI64x2ReplaceLaneI32Pair(node);
-    case IrOpcode::kI64x2Abs:
-      return MarkAsSimd128(node), VisitI64x2Abs(node);
-    case IrOpcode::kI64x2Neg:
-      return MarkAsSimd128(node), VisitI64x2Neg(node);
-    case IrOpcode::kI64x2SConvertI32x4Low:
-      return MarkAsSimd128(node), VisitI64x2SConvertI32x4Low(node);
-    case IrOpcode::kI64x2SConvertI32x4High:
-      return MarkAsSimd128(node), VisitI64x2SConvertI32x4High(node);
-    case IrOpcode::kI64x2UConvertI32x4Low:
-      return MarkAsSimd128(node), VisitI64x2UConvertI32x4Low(node);
-    case IrOpcode::kI64x2UConvertI32x4High:
-      return MarkAsSimd128(node), VisitI64x2UConvertI32x4High(node);
-    case IrOpcode::kI64x2BitMask:
-      return MarkAsWord32(node), VisitI64x2BitMask(node);
-    case IrOpcode::kI64x2Shl:
-      return MarkAsSimd128(node), VisitI64x2Shl(node);
-    case IrOpcode::kI64x2ShrS:
-      return MarkAsSimd128(node), VisitI64x2ShrS(node);
-    case IrOpcode::kI64x2Add:
-      return MarkAsSimd128(node), VisitI64x2Add(node);
-    case IrOpcode::kI64x2Sub:
-      return MarkAsSimd128(node), VisitI64x2Sub(node);
-    case IrOpcode::kI64x2Mul:
-      return MarkAsSimd128(node), VisitI64x2Mul(node);
-    case IrOpcode::kI64x2Eq:
-      return MarkAsSimd128(node), VisitI64x2Eq(node);
-    case IrOpcode::kI64x2Ne:
-      return MarkAsSimd128(node), VisitI64x2Ne(node);
-    case IrOpcode::kI64x2GtS:
-      return MarkAsSimd128(node), VisitI64x2GtS(node);
-    case IrOpcode::kI64x2GeS:
-      return MarkAsSimd128(node), VisitI64x2GeS(node);
-    case IrOpcode::kI64x2ShrU:
-      return MarkAsSimd128(node), VisitI64x2ShrU(node);
-    case IrOpcode::kI64x2ExtMulLowI32x4S:
-      return MarkAsSimd128(node), VisitI64x2ExtMulLowI32x4S(node);
-    case IrOpcode::kI64x2ExtMulHighI32x4S:
-      return MarkAsSimd128(node), VisitI64x2ExtMulHighI32x4S(node);
-    case IrOpcode::kI64x2ExtMulLowI32x4U:
-      return MarkAsSimd128(node), VisitI64x2ExtMulLowI32x4U(node);
-    case IrOpcode::kI64x2ExtMulHighI32x4U:
-      return MarkAsSimd128(node), VisitI64x2ExtMulHighI32x4U(node);
-    case IrOpcode::kI32x4Splat:
-      return MarkAsSimd128(node), VisitI32x4Splat(node);
-    case IrOpcode::kI32x4ExtractLane:
-      return MarkAsWord32(node), VisitI32x4ExtractLane(node);
-    case IrOpcode::kI32x4ReplaceLane:
-      return MarkAsSimd128(node), VisitI32x4ReplaceLane(node);
-    case IrOpcode::kI32x4SConvertF32x4:
-      return MarkAsSimd128(node), VisitI32x4SConvertF32x4(node);
-    case IrOpcode::kI32x4SConvertI16x8Low:
-      return MarkAsSimd128(node), VisitI32x4SConvertI16x8Low(node);
-    case IrOpcode::kI32x4SConvertI16x8High:
-      return MarkAsSimd128(node), VisitI32x4SConvertI16x8High(node);
-    case IrOpcode::kI32x4Neg:
-      return MarkAsSimd128(node), VisitI32x4Neg(node);
-    case IrOpcode::kI32x4Shl:
-      return MarkAsSimd128(node), VisitI32x4Shl(node);
-    case IrOpcode::kI32x4ShrS:
-      return MarkAsSimd128(node), VisitI32x4ShrS(node);
-    case IrOpcode::kI32x4Add:
-      return MarkAsSimd128(node), VisitI32x4Add(node);
-    case IrOpcode::kI32x4Sub:
-      return MarkAsSimd128(node), VisitI32x4Sub(node);
-    case IrOpcode::kI32x4Mul:
-      return MarkAsSimd128(node), VisitI32x4Mul(node);
-    case IrOpcode::kI32x4MinS:
-      return MarkAsSimd128(node), VisitI32x4MinS(node);
-    case IrOpcode::kI32x4MaxS:
-      return MarkAsSimd128(node), VisitI32x4MaxS(node);
-    case IrOpcode::kI32x4Eq:
-      return MarkAsSimd128(node), VisitI32x4Eq(node);
-    case IrOpcode::kI32x4Ne:
-      return MarkAsSimd128(node), VisitI32x4Ne(node);
-    case IrOpcode::kI32x4GtS:
-      return MarkAsSimd128(node), VisitI32x4GtS(node);
-    case IrOpcode::kI32x4GeS:
-      return MarkAsSimd128(node), VisitI32x4GeS(node);
-    case IrOpcode::kI32x4UConvertF32x4:
-      return MarkAsSimd128(node), VisitI32x4UConvertF32x4(node);
-    case IrOpcode::kI32x4UConvertI16x8Low:
-      return MarkAsSimd128(node), VisitI32x4UConvertI16x8Low(node);
-    case IrOpcode::kI32x4UConvertI16x8High:
-      return MarkAsSimd128(node), VisitI32x4UConvertI16x8High(node);
-    case IrOpcode::kI32x4ShrU:
-      return MarkAsSimd128(node), VisitI32x4ShrU(node);
-    case IrOpcode::kI32x4MinU:
-      return MarkAsSimd128(node), VisitI32x4MinU(node);
-    case IrOpcode::kI32x4MaxU:
-      return MarkAsSimd128(node), VisitI32x4MaxU(node);
-    case IrOpcode::kI32x4GtU:
-      return MarkAsSimd128(node), VisitI32x4GtU(node);
-    case IrOpcode::kI32x4GeU:
-      return MarkAsSimd128(node), VisitI32x4GeU(node);
-    case IrOpcode::kI32x4Abs:
-      return MarkAsSimd128(node), VisitI32x4Abs(node);
-    case IrOpcode::kI32x4BitMask:
-      return MarkAsWord32(node), VisitI32x4BitMask(node);
-    case IrOpcode::kI32x4DotI16x8S:
-      return MarkAsSimd128(node), VisitI32x4DotI16x8S(node);
-    case IrOpcode::kI32x4ExtMulLowI16x8S:
-      return MarkAsSimd128(node), VisitI32x4ExtMulLowI16x8S(node);
-    case IrOpcode::kI32x4ExtMulHighI16x8S:
-      return MarkAsSimd128(node), VisitI32x4ExtMulHighI16x8S(node);
-    case IrOpcode::kI32x4ExtMulLowI16x8U:
-      return MarkAsSimd128(node), VisitI32x4ExtMulLowI16x8U(node);
-    case IrOpcode::kI32x4ExtMulHighI16x8U:
-      return MarkAsSimd128(node), VisitI32x4ExtMulHighI16x8U(node);
-    case IrOpcode::kI32x4ExtAddPairwiseI16x8S:
-      return MarkAsSimd128(node), VisitI32x4ExtAddPairwiseI16x8S(node);
-    case IrOpcode::kI32x4ExtAddPairwiseI16x8U:
-      return MarkAsSimd128(node), VisitI32x4ExtAddPairwiseI16x8U(node);
-    case IrOpcode::kI32x4TruncSatF64x2SZero:
-      return MarkAsSimd128(node), VisitI32x4TruncSatF64x2SZero(node);
-    case IrOpcode::kI32x4TruncSatF64x2UZero:
-      return MarkAsSimd128(node), VisitI32x4TruncSatF64x2UZero(node);
-    case IrOpcode::kI16x8Splat:
-      return MarkAsSimd128(node), VisitI16x8Splat(node);
-    case IrOpcode::kI16x8ExtractLaneU:
-      return MarkAsWord32(node), VisitI16x8ExtractLaneU(node);
-    case IrOpcode::kI16x8ExtractLaneS:
-      return MarkAsWord32(node), VisitI16x8ExtractLaneS(node);
-    case IrOpcode::kI16x8ReplaceLane:
-      return MarkAsSimd128(node), VisitI16x8ReplaceLane(node);
-    case IrOpcode::kI16x8SConvertI8x16Low:
-      return MarkAsSimd128(node), VisitI16x8SConvertI8x16Low(node);
-    case IrOpcode::kI16x8SConvertI8x16High:
-      return MarkAsSimd128(node), VisitI16x8SConvertI8x16High(node);
-    case IrOpcode::kI16x8Neg:
-      return MarkAsSimd128(node), VisitI16x8Neg(node);
-    case IrOpcode::kI16x8Shl:
-      return MarkAsSimd128(node), VisitI16x8Shl(node);
-    case IrOpcode::kI16x8ShrS:
-      return MarkAsSimd128(node), VisitI16x8ShrS(node);
-    case IrOpcode::kI16x8SConvertI32x4:
-      return MarkAsSimd128(node), VisitI16x8SConvertI32x4(node);
-    case IrOpcode::kI16x8Add:
-      return MarkAsSimd128(node), VisitI16x8Add(node);
-    case IrOpcode::kI16x8AddSatS:
-      return MarkAsSimd128(node), VisitI16x8AddSatS(node);
-    case IrOpcode::kI16x8Sub:
-      return MarkAsSimd128(node), VisitI16x8Sub(node);
-    case IrOpcode::kI16x8SubSatS:
-      return MarkAsSimd128(node), VisitI16x8SubSatS(node);
-    case IrOpcode::kI16x8Mul:
-      return MarkAsSimd128(node), VisitI16x8Mul(node);
-    case IrOpcode::kI16x8MinS:
-      return MarkAsSimd128(node), VisitI16x8MinS(node);
-    case IrOpcode::kI16x8MaxS:
-      return MarkAsSimd128(node), VisitI16x8MaxS(node);
-    case IrOpcode::kI16x8Eq:
-      return MarkAsSimd128(node), VisitI16x8Eq(node);
-    case IrOpcode::kI16x8Ne:
-      return MarkAsSimd128(node), VisitI16x8Ne(node);
-    case IrOpcode::kI16x8GtS:
-      return MarkAsSimd128(node), VisitI16x8GtS(node);
-    case IrOpcode::kI16x8GeS:
-      return MarkAsSimd128(node), VisitI16x8GeS(node);
-    case IrOpcode::kI16x8UConvertI8x16Low:
-      return MarkAsSimd128(node), VisitI16x8UConvertI8x16Low(node);
-    case IrOpcode::kI16x8UConvertI8x16High:
-      return MarkAsSimd128(node), VisitI16x8UConvertI8x16High(node);
-    case IrOpcode::kI16x8ShrU:
-      return MarkAsSimd128(node), VisitI16x8ShrU(node);
-    case IrOpcode::kI16x8UConvertI32x4:
-      return MarkAsSimd128(node), VisitI16x8UConvertI32x4(node);
-    case IrOpcode::kI16x8AddSatU:
-      return MarkAsSimd128(node), VisitI16x8AddSatU(node);
-    case IrOpcode::kI16x8SubSatU:
-      return MarkAsSimd128(node), VisitI16x8SubSatU(node);
-    case IrOpcode::kI16x8MinU:
-      return MarkAsSimd128(node), VisitI16x8MinU(node);
-    case IrOpcode::kI16x8MaxU:
-      return MarkAsSimd128(node), VisitI16x8MaxU(node);
-    case IrOpcode::kI16x8GtU:
-      return MarkAsSimd128(node), VisitI16x8GtU(node);
-    case IrOpcode::kI16x8GeU:
-      return MarkAsSimd128(node), VisitI16x8GeU(node);
-    case IrOpcode::kI16x8RoundingAverageU:
-      return MarkAsSimd128(node), VisitI16x8RoundingAverageU(node);
-    case IrOpcode::kI16x8Q15MulRSatS:
-      return MarkAsSimd128(node), VisitI16x8Q15MulRSatS(node);
-    case IrOpcode::kI16x8Abs:
-      return MarkAsSimd128(node), VisitI16x8Abs(node);
-    case IrOpcode::kI16x8BitMask:
-      return MarkAsWord32(node), VisitI16x8BitMask(node);
-    case IrOpcode::kI16x8ExtMulLowI8x16S:
-      return MarkAsSimd128(node), VisitI16x8ExtMulLowI8x16S(node);
-    case IrOpcode::kI16x8ExtMulHighI8x16S:
-      return MarkAsSimd128(node), VisitI16x8ExtMulHighI8x16S(node);
-    case IrOpcode::kI16x8ExtMulLowI8x16U:
-      return MarkAsSimd128(node), VisitI16x8ExtMulLowI8x16U(node);
-    case IrOpcode::kI16x8ExtMulHighI8x16U:
-      return MarkAsSimd128(node), VisitI16x8ExtMulHighI8x16U(node);
-    case IrOpcode::kI16x8ExtAddPairwiseI8x16S:
-      return MarkAsSimd128(node), VisitI16x8ExtAddPairwiseI8x16S(node);
-    case IrOpcode::kI16x8ExtAddPairwiseI8x16U:
-      return MarkAsSimd128(node), VisitI16x8ExtAddPairwiseI8x16U(node);
-    case IrOpcode::kI8x16Splat:
-      return MarkAsSimd128(node), VisitI8x16Splat(node);
-    case IrOpcode::kI8x16ExtractLaneU:
-      return MarkAsWord32(node), VisitI8x16ExtractLaneU(node);
-    case IrOpcode::kI8x16ExtractLaneS:
-      return MarkAsWord32(node), VisitI8x16ExtractLaneS(node);
-    case IrOpcode::kI8x16ReplaceLane:
-      return MarkAsSimd128(node), VisitI8x16ReplaceLane(node);
-    case IrOpcode::kI8x16Neg:
-      return MarkAsSimd128(node), VisitI8x16Neg(node);
-    case IrOpcode::kI8x16Shl:
-      return MarkAsSimd128(node), VisitI8x16Shl(node);
-    case IrOpcode::kI8x16ShrS:
-      return MarkAsSimd128(node), VisitI8x16ShrS(node);
-    case IrOpcode::kI8x16SConvertI16x8:
-      return MarkAsSimd128(node), VisitI8x16SConvertI16x8(node);
-    case IrOpcode::kI8x16Add:
-      return MarkAsSimd128(node), VisitI8x16Add(node);
-    case IrOpcode::kI8x16AddSatS:
-      return MarkAsSimd128(node), VisitI8x16AddSatS(node);
-    case IrOpcode::kI8x16Sub:
-      return MarkAsSimd128(node), VisitI8x16Sub(node);
-    case IrOpcode::kI8x16SubSatS:
-      return MarkAsSimd128(node), VisitI8x16SubSatS(node);
-    case IrOpcode::kI8x16MinS:
-      return MarkAsSimd128(node), VisitI8x16MinS(node);
-    case IrOpcode::kI8x16MaxS:
-      return MarkAsSimd128(node), VisitI8x16MaxS(node);
-    case IrOpcode::kI8x16Eq:
-      return MarkAsSimd128(node), VisitI8x16Eq(node);
-    case IrOpcode::kI8x16Ne:
-      return MarkAsSimd128(node), VisitI8x16Ne(node);
-    case IrOpcode::kI8x16GtS:
-      return MarkAsSimd128(node), VisitI8x16GtS(node);
-    case IrOpcode::kI8x16GeS:
-      return MarkAsSimd128(node), VisitI8x16GeS(node);
-    case IrOpcode::kI8x16ShrU:
-      return MarkAsSimd128(node), VisitI8x16ShrU(node);
-    case IrOpcode::kI8x16UConvertI16x8:
-      return MarkAsSimd128(node), VisitI8x16UConvertI16x8(node);
-    case IrOpcode::kI8x16AddSatU:
-      return MarkAsSimd128(node), VisitI8x16AddSatU(node);
-    case IrOpcode::kI8x16SubSatU:
-      return MarkAsSimd128(node), VisitI8x16SubSatU(node);
-    case IrOpcode::kI8x16MinU:
-      return MarkAsSimd128(node), VisitI8x16MinU(node);
-    case IrOpcode::kI8x16MaxU:
-      return MarkAsSimd128(node), VisitI8x16MaxU(node);
-    case IrOpcode::kI8x16GtU:
-      return MarkAsSimd128(node), VisitI8x16GtU(node);
-    case IrOpcode::kI8x16GeU:
-      return MarkAsSimd128(node), VisitI8x16GeU(node);
-    case IrOpcode::kI8x16RoundingAverageU:
-      return MarkAsSimd128(node), VisitI8x16RoundingAverageU(node);
-    case IrOpcode::kI8x16Popcnt:
-      return MarkAsSimd128(node), VisitI8x16Popcnt(node);
-    case IrOpcode::kI8x16Abs:
-      return MarkAsSimd128(node), VisitI8x16Abs(node);
-    case IrOpcode::kI8x16BitMask:
-      return MarkAsWord32(node), VisitI8x16BitMask(node);
-    case IrOpcode::kS128Const:
-      return MarkAsSimd128(node), VisitS128Const(node);
-    case IrOpcode::kS128Zero:
-      return MarkAsSimd128(node), VisitS128Zero(node);
-    case IrOpcode::kS128And:
-      return MarkAsSimd128(node), VisitS128And(node);
-    case IrOpcode::kS128Or:
-      return MarkAsSimd128(node), VisitS128Or(node);
-    case IrOpcode::kS128Xor:
-      return MarkAsSimd128(node), VisitS128Xor(node);
-    case IrOpcode::kS128Not:
-      return MarkAsSimd128(node), VisitS128Not(node);
-    case IrOpcode::kS128Select:
-      return MarkAsSimd128(node), VisitS128Select(node);
-    case IrOpcode::kS128AndNot:
-      return MarkAsSimd128(node), VisitS128AndNot(node);
-    case IrOpcode::kI8x16Swizzle:
-      return MarkAsSimd128(node), VisitI8x16Swizzle(node);
-    case IrOpcode::kI8x16Shuffle:
-      return MarkAsSimd128(node), VisitI8x16Shuffle(node);
-    case IrOpcode::kV128AnyTrue:
-      return MarkAsWord32(node), VisitV128AnyTrue(node);
-    case IrOpcode::kI64x2AllTrue:
-      return MarkAsWord32(node), VisitI64x2AllTrue(node);
-    case IrOpcode::kI32x4AllTrue:
-      return MarkAsWord32(node), VisitI32x4AllTrue(node);
-    case IrOpcode::kI16x8AllTrue:
-      return MarkAsWord32(node), VisitI16x8AllTrue(node);
-    case IrOpcode::kI8x16AllTrue:
-      return MarkAsWord32(node), VisitI8x16AllTrue(node);
-    case IrOpcode::kI8x16RelaxedLaneSelect:
-      return MarkAsSimd128(node), VisitI8x16RelaxedLaneSelect(node);
-    case IrOpcode::kI16x8RelaxedLaneSelect:
-      return MarkAsSimd128(node), VisitI16x8RelaxedLaneSelect(node);
-    case IrOpcode::kI32x4RelaxedLaneSelect:
-      return MarkAsSimd128(node), VisitI32x4RelaxedLaneSelect(node);
-    case IrOpcode::kI64x2RelaxedLaneSelect:
-      return MarkAsSimd128(node), VisitI64x2RelaxedLaneSelect(node);
-    case IrOpcode::kF32x4RelaxedMin:
-      return MarkAsSimd128(node), VisitF32x4RelaxedMin(node);
-    case IrOpcode::kF32x4RelaxedMax:
-      return MarkAsSimd128(node), VisitF32x4RelaxedMax(node);
-    case IrOpcode::kF64x2RelaxedMin:
-      return MarkAsSimd128(node), VisitF64x2RelaxedMin(node);
-    case IrOpcode::kF64x2RelaxedMax:
-      return MarkAsSimd128(node), VisitF64x2RelaxedMax(node);
-    case IrOpcode::kI32x4RelaxedTruncF64x2SZero:
-      return MarkAsSimd128(node), VisitI32x4RelaxedTruncF64x2SZero(node);
-    case IrOpcode::kI32x4RelaxedTruncF64x2UZero:
-      return MarkAsSimd128(node), VisitI32x4RelaxedTruncF64x2UZero(node);
-    case IrOpcode::kI32x4RelaxedTruncF32x4S:
-      return MarkAsSimd128(node), VisitI32x4RelaxedTruncF32x4S(node);
-    case IrOpcode::kI32x4RelaxedTruncF32x4U:
-      return MarkAsSimd128(node), VisitI32x4RelaxedTruncF32x4U(node);
-    case IrOpcode::kI16x8RelaxedQ15MulRS:
-      return MarkAsSimd128(node), VisitI16x8RelaxedQ15MulRS(node);
-    case IrOpcode::kI16x8DotI8x16I7x16S:
-      return MarkAsSimd128(node), VisitI16x8DotI8x16I7x16S(node);
-    case IrOpcode::kI32x4DotI8x16I7x16AddS:
-      return MarkAsSimd128(node), VisitI32x4DotI8x16I7x16AddS(node);
-
-      // SIMD256
-#if V8_TARGET_ARCH_X64
-    case IrOpcode::kF32x8Add:
-      return MarkAsSimd256(node), VisitF32x8Add(node);
-    case IrOpcode::kF32x8Sub:
-      return MarkAsSimd256(node), VisitF32x8Sub(node);
-#endif  //  V8_TARGET_ARCH_X64
-    default:
-      FATAL("Unexpected operator #%d:%s @ node #%d", node->opcode(),
-            node->op()->mnemonic(), node->id());
-  }
-}
-
-void InstructionSelector::VisitStackPointerGreaterThan(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kStackPointerGreaterThanCondition, node);
-  VisitStackPointerGreaterThan(node, &cont);
-}
-
-void InstructionSelector::VisitLoadStackCheckOffset(Node* node) {
-  OperandGenerator g(this);
-  Emit(kArchStackCheckOffset, g.DefineAsRegister(node));
-}
-
-void InstructionSelector::VisitLoadFramePointer(Node* node) {
-  OperandGenerator g(this);
-  Emit(kArchFramePointer, g.DefineAsRegister(node));
 }
 
-void InstructionSelector::VisitLoadParentFramePointer(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTailCall(node_t node) {
   OperandGenerator g(this);
-  Emit(kArchParentFramePointer, g.DefineAsRegister(node));
-}
-
-void InstructionSelector::VisitLoadRootRegister(Node* node) {
-  // Do nothing. Following loads/stores from this operator will use kMode_Root
-  // to load/store from an offset of the root register.
-}
-
-void InstructionSelector::VisitFloat64Acos(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Acos);
-}
-
-void InstructionSelector::VisitFloat64Acosh(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Acosh);
-}
-
-void InstructionSelector::VisitFloat64Asin(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Asin);
-}
-
-void InstructionSelector::VisitFloat64Asinh(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Asinh);
-}
-
-void InstructionSelector::VisitFloat64Atan(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Atan);
-}
-
-void InstructionSelector::VisitFloat64Atanh(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Atanh);
-}
-
-void InstructionSelector::VisitFloat64Atan2(Node* node) {
-  VisitFloat64Ieee754Binop(node, kIeee754Float64Atan2);
-}
-
-void InstructionSelector::VisitFloat64Cbrt(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Cbrt);
-}
-
-void InstructionSelector::VisitFloat64Cos(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Cos);
-}
-
-void InstructionSelector::VisitFloat64Cosh(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Cosh);
-}
-
-void InstructionSelector::VisitFloat64Exp(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Exp);
-}
-
-void InstructionSelector::VisitFloat64Expm1(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Expm1);
-}
 
-void InstructionSelector::VisitFloat64Log(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Log);
-}
+  auto call = this->call_view(node);
+  auto caller = linkage()->GetIncomingDescriptor();
+  auto callee = call.call_descriptor();
+  DCHECK(caller->CanTailCall(callee));
+  const int stack_param_delta = callee->GetStackParameterDelta(caller);
+  CallBuffer buffer(zone(), callee, nullptr);
 
-void InstructionSelector::VisitFloat64Log1p(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Log1p);
-}
+  // Compute InstructionOperands for inputs and outputs.
+  CallBufferFlags flags(kCallCodeImmediate | kCallTail);
+  if (IsTailCallAddressImmediate()) {
+    flags |= kCallAddressImmediate;
+  }
+  if (callee->flags() & CallDescriptor::kFixedTargetRegister) {
+    flags |= kCallFixedTargetRegister;
+  }
+  InitializeCallBuffer(node, &buffer, flags, stack_param_delta);
+  UpdateMaxPushedArgumentCount(stack_param_delta);
 
-void InstructionSelector::VisitFloat64Log2(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Log2);
-}
+  // Select the appropriate opcode based on the call type.
+  InstructionCode opcode;
+  InstructionOperandVector temps(zone());
+  switch (callee->kind()) {
+    case CallDescriptor::kCallCodeObject:
+      opcode = kArchTailCallCodeObject;
+      break;
+    case CallDescriptor::kCallAddress:
+      DCHECK(!caller->IsJSFunctionCall());
+      opcode = kArchTailCallAddress;
+      break;
+#if V8_ENABLE_WEBASSEMBLY
+    case CallDescriptor::kCallWasmFunction:
+      DCHECK(!caller->IsJSFunctionCall());
+      opcode = kArchTailCallWasm;
+      break;
+#endif  // V8_ENABLE_WEBASSEMBLY
+    default:
+      UNREACHABLE();
+  }
+  opcode = EncodeCallDescriptorFlags(opcode, callee->flags());
 
-void InstructionSelector::VisitFloat64Log10(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Log10);
-}
+  Emit(kArchPrepareTailCall, g.NoOutput());
 
-void InstructionSelector::VisitFloat64Pow(Node* node) {
-  VisitFloat64Ieee754Binop(node, kIeee754Float64Pow);
-}
+  // Add an immediate operand that represents the offset to the first slot
+  // that is unused with respect to the stack pointer that has been updated
+  // for the tail call instruction. Backends that pad arguments can write the
+  // padding value at this offset from the stack.
+  const int optional_padding_offset =
+      callee->GetOffsetToFirstUnusedStackSlot() - 1;
+  buffer.instruction_args.push_back(g.TempImmediate(optional_padding_offset));
 
-void InstructionSelector::VisitFloat64Sin(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Sin);
-}
+  const int first_unused_slot_offset =
+      kReturnAddressStackSlotCount + stack_param_delta;
+  buffer.instruction_args.push_back(g.TempImmediate(first_unused_slot_offset));
 
-void InstructionSelector::VisitFloat64Sinh(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Sinh);
+  // Emit the tailcall instruction.
+  Emit(opcode, 0, nullptr, buffer.instruction_args.size(),
+       &buffer.instruction_args.front(), temps.size(),
+       temps.empty() ? nullptr : &temps.front());
 }
 
-void InstructionSelector::VisitFloat64Tan(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Tan);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitGoto(block_t target) {
+  // jump to the next block.
+  OperandGenerator g(this);
+  Emit(kArchJmp, g.NoOutput(), g.Label(target));
 }
 
-void InstructionSelector::VisitFloat64Tanh(Node* node) {
-  VisitFloat64Ieee754Unop(node, kIeee754Float64Tanh);
-}
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitReturn(node_t node) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  const ReturnOp& ret = schedule()->Get(node).Cast<ReturnOp>();
 
-void InstructionSelector::EmitTableSwitch(
-    const SwitchInfo& sw, InstructionOperand const& index_operand) {
   OperandGenerator g(this);
-  size_t input_count = 2 + sw.value_range();
-  DCHECK_LE(sw.value_range(), std::numeric_limits<size_t>::max() - 2);
-  auto* inputs = zone()->NewArray<InstructionOperand>(input_count);
-  inputs[0] = index_operand;
-  InstructionOperand default_operand = g.Label(sw.default_branch());
-  std::fill(&inputs[1], &inputs[input_count], default_operand);
-  for (const CaseInfo& c : sw.CasesUnsorted()) {
-    size_t value = c.value - sw.min_value();
-    DCHECK_LE(0u, value);
-    DCHECK_LT(value + 2, input_count);
-    inputs[value + 2] = g.Label(c.branch);
-  }
-  Emit(kArchTableSwitch, 0, nullptr, input_count, inputs, 0, nullptr);
-}
+  const int input_count =
+      linkage()->GetIncomingDescriptor()->ReturnCount() == 0
+          ? 1
+          : (1 + static_cast<int>(ret.return_values().size()));
+  DCHECK_GE(input_count, 1);
 
-void InstructionSelector::EmitBinarySearchSwitch(
-    const SwitchInfo& sw, InstructionOperand const& value_operand) {
-  OperandGenerator g(this);
-  size_t input_count = 2 + sw.case_count() * 2;
-  DCHECK_LE(sw.case_count(), (std::numeric_limits<size_t>::max() - 2) / 2);
-  auto* inputs = zone()->NewArray<InstructionOperand>(input_count);
-  inputs[0] = value_operand;
-  inputs[1] = g.Label(sw.default_branch());
-  std::vector<CaseInfo> cases = sw.CasesSortedByValue();
-  for (size_t index = 0; index < cases.size(); ++index) {
-    const CaseInfo& c = cases[index];
-    inputs[index * 2 + 2 + 0] = g.TempImmediate(c.value);
-    inputs[index * 2 + 2 + 1] = g.Label(c.branch);
+  auto value_locations =
+      zone()->template AllocateArray<InstructionOperand>(input_count);
+  const Operation& pop_count = schedule()->Get(ret.pop_count());
+  if (pop_count.Is<Opmask::kWord32Constant>() ||
+      pop_count.Is<Opmask::kWord64Constant>()) {
+    value_locations[0] = g.UseImmediate(ret.pop_count());
+  } else {
+    value_locations[0] = g.UseRegister(ret.pop_count());
   }
-  Emit(kArchBinarySearchSwitch, 0, nullptr, input_count, inputs, 0, nullptr);
-}
-
-void InstructionSelector::VisitBitcastTaggedToWord(Node* node) {
-  EmitIdentity(node);
+  for (int i = 0; i < input_count - 1; ++i) {
+    value_locations[i + 1] =
+        g.UseLocation(ret.return_values()[i], linkage()->GetReturnLocation(i));
+  }
+  Emit(kArchRet, 0, nullptr, input_count, value_locations);
 }
 
-void InstructionSelector::VisitBitcastWordToTagged(Node* node) {
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitReturn(node_t ret) {
   OperandGenerator g(this);
-  Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(node->InputAt(0)));
-}
-
-// 32 bit targets do not implement the following instructions.
-#if V8_TARGET_ARCH_32_BIT
-
-void InstructionSelector::VisitWord64And(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Or(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Xor(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Shl(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Shr(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Sar(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Rol(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Ror(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Clz(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Ctz(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64ReverseBits(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitWord64Popcnt(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64Equal(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt64Add(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt64AddWithOverflow(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitInt64Sub(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt64SubWithOverflow(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitInt64Mul(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt64MulHigh(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitUint64MulHigh(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitInt64Div(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt64LessThan(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitUint64Div(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt64Mod(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitUint64LessThan(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitUint64Mod(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitBitcastWord32ToWord64(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitChangeInt64ToFloat64(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitChangeUint32ToUint64(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitChangeFloat64ToInt64(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitChangeFloat64ToUint64(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitTruncateFloat64ToInt64(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
-  UNIMPLEMENTED();
-}
-
-void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
-  UNIMPLEMENTED();
+  const int input_count = linkage()->GetIncomingDescriptor()->ReturnCount() == 0
+                              ? 1
+                              : ret->op()->ValueInputCount();
+  DCHECK_GE(input_count, 1);
+  auto value_locations =
+      zone()->template AllocateArray<InstructionOperand>(input_count);
+  Node* pop_count = ret->InputAt(0);
+  value_locations[0] = (pop_count->opcode() == IrOpcode::kInt32Constant ||
+                        pop_count->opcode() == IrOpcode::kInt64Constant)
+                           ? g.UseImmediate(pop_count)
+                           : g.UseRegister(pop_count);
+  for (int i = 1; i < input_count; ++i) {
+    value_locations[i] =
+        g.UseLocation(ret->InputAt(i), linkage()->GetReturnLocation(i - 1));
+  }
+  Emit(kArchRet, 0, nullptr, input_count, value_locations);
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
-  UNIMPLEMENTED();
-}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBranch(node_t branch_node,
+                                                block_t tbranch,
+                                                block_t fbranch) {
+  auto branch = this->branch_view(branch_node);
+  TryPrepareScheduleFirstProjection(branch.condition());
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
-  UNIMPLEMENTED();
+  FlagsContinuation cont =
+      FlagsContinuation::ForBranch(kNotEqual, tbranch, fbranch);
+  VisitWordCompareZero(branch, branch.condition(), &cont);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
-  UNIMPLEMENTED();
-}
+// When a DeoptimizeIf/DeoptimizeUnless/Branch depends on a BinopOverflow, the
+// InstructionSelector can sometimes generate a fuse instruction covering both
+// the BinopOverflow and the DeoptIf/Branch, and the final emitted code will
+// look like:
+//
+//     r = BinopOverflow
+//     jo branch_target/deopt_target
+//
+// When this fusing fails, the final code looks like:
+//
+//     r = BinopOverflow
+//     o = sete  // sets overflow bit
+//     cmp o, 0
+//     jnz branch_target/deopt_target
+//
+// To be able to fuse tue BinopOverflow and the DeoptIf/Branch, the 1st
+// projection (Projection[0], which contains the actual result) must already be
+// scheduled (and a few other conditions must be satisfied, see
+// InstructionSelectorXXX::VisitWordCompareZero).
+// TryPrepareScheduleFirstProjection is thus called from
+// VisitDeoptimizeIf/VisitDeoptimizeUnless/VisitBranch and detects if the 1st
+// projection could be scheduled now, and, if so, defines it.
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::TryPrepareScheduleFirstProjection(
+    node_t maybe_projection) {
+  // The DeoptimizeIf/DeoptimizeUnless/Branch condition is not a projection.
+  if (!this->is_projection(maybe_projection)) return;
+
+  if (this->projection_index_of(maybe_projection) != 1u) {
+    // The DeoptimizeIf/DeoptimizeUnless/Branch isn't on the Projection[1]
+    // (ie, not on the overflow bit of a BinopOverflow).
+    return;
+  }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
-  UNIMPLEMENTED();
-}
+  DCHECK_EQ(this->value_input_count(maybe_projection), 1);
+  node_t node = this->input_at(maybe_projection, 0);
+  if (this->block(schedule_, node) != current_block_) {
+    // The projection input is not in the current block, so it shouldn't be
+    // emitted now, so we don't need to eagerly schedule its Projection[0].
+    return;
+  }
 
-void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) {
-  UNIMPLEMENTED();
-}
+  if constexpr (Adapter::IsTurboshaft) {
+    using namespace turboshaft;  // NOLINT(build/namespaces)
+    auto* binop = this->Get(node).template TryCast<OverflowCheckedBinopOp>();
+    if (binop == nullptr) return;
+    DCHECK(binop->kind == OverflowCheckedBinopOp::Kind::kSignedAdd ||
+           binop->kind == OverflowCheckedBinopOp::Kind::kSignedSub ||
+           binop->kind == OverflowCheckedBinopOp::Kind::kSignedMul);
+  } else {
+    switch (node->opcode()) {
+      case IrOpcode::kInt32AddWithOverflow:
+      case IrOpcode::kInt32SubWithOverflow:
+      case IrOpcode::kInt32MulWithOverflow:
+      case IrOpcode::kInt64AddWithOverflow:
+      case IrOpcode::kInt64SubWithOverflow:
+      case IrOpcode::kInt64MulWithOverflow:
+        break;
+      default:
+        return;
+    }
+  }
 
-void InstructionSelector::VisitRoundInt64ToFloat32(Node* node) {
-  UNIMPLEMENTED();
-}
+  node_t result = FindProjection(node, 0);
+  if (!Adapter::valid(result) || IsDefined(result)) {
+    // No Projection(0), or it's already defined.
+    return;
+  }
 
-void InstructionSelector::VisitRoundInt64ToFloat64(Node* node) {
-  UNIMPLEMENTED();
-}
+  if (this->block(schedule_, result) != current_block_) {
+    // {result} wasn't planned to be scheduled in {current_block_}. To
+    // avoid adding checks to see if it can still be scheduled now, we
+    // just bail out.
+    return;
+  }
 
-void InstructionSelector::VisitRoundUint64ToFloat32(Node* node) {
-  UNIMPLEMENTED();
-}
+  // Checking if all uses of {result} that are in the current block have
+  // already been Defined.
+  // We also ignore Phi uses: if {result} is used in a Phi in the block in
+  // which it is defined, this means that this block is a loop header, and
+  // {result} back into it through the back edge. In this case, it's
+  // normal to schedule {result} before the Phi that uses it.
+  if constexpr (Adapter::IsTurboshaft) {
+    for (turboshaft::OpIndex use : turboshaft_uses(result)) {
+      if (!IsDefined(use) && this->block(schedule_, use) == current_block_ &&
+          !this->Get(use).template Is<turboshaft::PhiOp>()) {
+        return;
+      }
+    }
+  } else {
+    for (Node* use : result->uses()) {
+      if (!IsDefined(use) && this->block(schedule_, use) == current_block_ &&
+          use->opcode() != IrOpcode::kPhi) {
+        // {use} is in the current block but is not defined yet. It's
+        // possible that it's not actually used, but the IsUsed(x) predicate
+        // is not valid until we have visited `x`, so we overaproximate and
+        // assume that {use} is itself used.
+        return;
+      }
+    }
+  }
 
-void InstructionSelector::VisitRoundUint64ToFloat64(Node* node) {
-  UNIMPLEMENTED();
+  // Visiting the projection now. Note that this relies on the fact that
+  // VisitProjection doesn't Emit something: if it did, then we could be
+  // Emitting something after a Branch, which is invalid (Branch can only
+  // be at the end of a block, and the end of a block must always be a
+  // block terminator). (remember that we emit operation in reverse order,
+  // so because we are doing TryPrepareScheduleFirstProjection before
+  // actually emitting the Branch, it would be after in the final
+  // instruction sequence, not before)
+  VisitProjection(result);
 }
 
-void InstructionSelector::VisitBitcastFloat64ToInt64(Node* node) {
-  UNIMPLEMENTED();
-}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitDeoptimizeIf(node_t node) {
+  auto deopt = this->deoptimize_view(node);
+  DCHECK(deopt.is_deoptimize_if());
 
-void InstructionSelector::VisitBitcastInt64ToFloat64(Node* node) {
-  UNIMPLEMENTED();
-}
+  TryPrepareScheduleFirstProjection(deopt.condition());
 
-void InstructionSelector::VisitSignExtendWord8ToInt64(Node* node) {
-  UNIMPLEMENTED();
+  FlagsContinuation cont = FlagsContinuation::ForDeoptimize(
+      kNotEqual, deopt.reason(), this->id(node), deopt.feedback(),
+      deopt.frame_state());
+  VisitWordCompareZero(node, deopt.condition(), &cont);
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt64(Node* node) {
-  UNIMPLEMENTED();
-}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitDeoptimizeUnless(node_t node) {
+  auto deopt = this->deoptimize_view(node);
+  DCHECK(deopt.is_deoptimize_unless());
+  TryPrepareScheduleFirstProjection(deopt.condition());
 
-void InstructionSelector::VisitSignExtendWord32ToInt64(Node* node) {
-  UNIMPLEMENTED();
+  FlagsContinuation cont =
+      FlagsContinuation::ForDeoptimize(kEqual, deopt.reason(), this->id(node),
+                                       deopt.feedback(), deopt.frame_state());
+  VisitWordCompareZero(node, deopt.condition(), &cont);
 }
-#endif  // V8_TARGET_ARCH_32_BIT
-
-// 64 bit targets do not implement the following instructions.
-#if V8_TARGET_ARCH_64_BIT
-void InstructionSelector::VisitInt32PairAdd(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt32PairSub(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitInt32PairMul(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord32PairShl(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord32PairShr(Node* node) { UNIMPLEMENTED(); }
 
-void InstructionSelector::VisitWord32PairSar(Node* node) { UNIMPLEMENTED(); }
-#endif  // V8_TARGET_ARCH_64_BIT
-
-#if !V8_TARGET_ARCH_IA32 && !V8_TARGET_ARCH_ARM && !V8_TARGET_ARCH_RISCV32
-void InstructionSelector::VisitWord32AtomicPairLoad(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSelect(node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 3);
+  FlagsContinuation cont = FlagsContinuation::ForSelect(
+      kNotEqual, node, this->input_at(node, 1), this->input_at(node, 2));
+  VisitWordCompareZero(node, this->input_at(node, 0), &cont);
 }
 
-void InstructionSelector::VisitWord32AtomicPairStore(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTrapIf(node_t node, TrapId trap_id) {
+  // FrameStates are only used for wasm traps inlined in JS. In that case the
+  // trap node will be lowered (replaced) before instruction selection.
+  // Therefore any TrapIf node has only one input.
+  DCHECK_EQ(this->value_input_count(node), 1);
+  FlagsContinuation cont = FlagsContinuation::ForTrap(kNotEqual, trap_id);
+  VisitWordCompareZero(node, this->input_at(node, 0), &cont);
 }
 
-void InstructionSelector::VisitWord32AtomicPairAdd(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTrapUnless(node_t node,
+                                                    TrapId trap_id) {
+  // FrameStates are only used for wasm traps inlined in JS. In that case the
+  // trap node will be lowered (replaced) before instruction selection.
+  // Therefore any TrapUnless node has only one input.
+  DCHECK_EQ(this->value_input_count(node), 1);
+  FlagsContinuation cont = FlagsContinuation::ForTrap(kEqual, trap_id);
+  VisitWordCompareZero(node, this->input_at(node, 0), &cont);
 }
 
-void InstructionSelector::VisitWord32AtomicPairSub(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitIdentity(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    DCHECK_EQ(this->value_input_count(node), 1);
+  }
+  MarkAsUsed(this->input_at(node, 0));
+  MarkAsDefined(node);
+  SetRename(node, this->input_at(node, 0));
 }
 
-void InstructionSelector::VisitWord32AtomicPairAnd(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitDeoptimize(
+    DeoptimizeReason reason, id_t node_id, FeedbackSource const& feedback,
+    node_t frame_state) {
+  InstructionOperandVector args(instruction_zone());
+  AppendDeoptimizeArguments(&args, reason, node_id, feedback, frame_state);
+  Emit(kArchDeoptimize, 0, nullptr, args.size(), &args.front(), 0, nullptr);
 }
 
-void InstructionSelector::VisitWord32AtomicPairOr(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitThrow(Node* node) {
+  OperandGenerator g(this);
+  Emit(kArchThrowTerminator, g.NoOutput());
 }
 
-void InstructionSelector::VisitWord32AtomicPairXor(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitDebugBreak(node_t node) {
+  OperandGenerator g(this);
+  Emit(kArchDebugBreak, g.NoOutput());
 }
 
-void InstructionSelector::VisitWord32AtomicPairExchange(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnreachable(node_t node) {
+  OperandGenerator g(this);
+  Emit(kArchDebugBreak, g.NoOutput());
 }
 
-void InstructionSelector::VisitWord32AtomicPairCompareExchange(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStaticAssert(Node* node) {
+  Node* asserted = node->InputAt(0);
+  UnparkedScopeIfNeeded scope(broker_);
+  AllowHandleDereference allow_handle_dereference;
+  asserted->Print(4);
+  FATAL(
+      "Expected Turbofan static assert to hold, but got non-true input:\n  %s",
+      StaticAssertSourceOf(node->op()));
 }
-#endif  // !V8_TARGET_ARCH_IA32 && !V8_TARGET_ARCH_ARM
-        // && !V8_TARGET_ARCH_RISCV32
-
-#if !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_ARM64 && !V8_TARGET_ARCH_MIPS64 && \
-    !V8_TARGET_ARCH_S390 && !V8_TARGET_ARCH_PPC64 &&                          \
-    !V8_TARGET_ARCH_RISCV64 && !V8_TARGET_ARCH_LOONG64
-void InstructionSelector::VisitWord64AtomicLoad(Node* node) { UNIMPLEMENTED(); }
 
-void InstructionSelector::VisitWord64AtomicStore(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitDeadValue(Node* node) {
+  OperandGenerator g(this);
+  MarkAsRepresentation(DeadValueRepresentationOf(node->op()), node);
+  Emit(kArchDebugBreak, g.DefineAsConstant(node));
 }
 
-void InstructionSelector::VisitWord64AtomicAdd(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64AtomicSub(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64AtomicAnd(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64AtomicOr(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64AtomicXor(Node* node) { UNIMPLEMENTED(); }
-
-void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitComment(node_t node) {
+  OperandGenerator g(this);
+  InstructionOperand operand(g.UseImmediate(node));
+  Emit(kArchComment, 0, nullptr, 1, &operand);
 }
 
-void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
-  UNIMPLEMENTED();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRetain(node_t node) {
+  OperandGenerator g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
+  Emit(kArchNop, g.NoOutput(), g.UseAny(this->input_at(node, 0)));
 }
-#endif  // !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_ARM64 && !V8_TARGET_ARCH_PPC64
-        // !V8_TARGET_ARCH_MIPS64 && !V8_TARGET_ARCH_S390 &&
-        // !V8_TARGET_ARCH_RISCV64 && !V8_TARGET_ARCH_LOONG64
 
-#if !V8_TARGET_ARCH_IA32 && !V8_TARGET_ARCH_ARM
-// This is only needed on 32-bit to split the 64-bit value into two operands.
-void InstructionSelector::VisitI64x2SplatI32Pair(Node* node) {
-  UNIMPLEMENTED();
-}
-void InstructionSelector::VisitI64x2ReplaceLaneI32Pair(Node* node) {
-  UNIMPLEMENTED();
-}
-#endif  // !V8_TARGET_ARCH_IA32
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitControl(block_t block) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+#ifdef DEBUG
+  // SSA deconstruction requires targets of branches not to have phis.
+  // Edge split form guarantees this property, but is more strict.
+  if (auto successors =
+          SuccessorBlocks(block->LastOperation(*turboshaft_graph()));
+      successors.size() > 1) {
+    for (Block* successor : successors) {
+      if (successor->HasPhis(*turboshaft_graph())) {
+        std::ostringstream str;
+        str << "You might have specified merged variables for a label with "
+            << "only one predecessor." << std::endl
+            << "# Current Block: " << successor->index() << std::endl;
+        FATAL("%s", str.str().c_str());
+      }
+    }
+  }
+#endif  // DEBUG
+  const Operation& op = block->LastOperation(*schedule());
+  OpIndex node = schedule()->Index(op);
+  int instruction_end = static_cast<int>(instructions_.size());
+  switch (op.opcode) {
+    case Opcode::kGoto:
+      VisitGoto(op.Cast<GotoOp>().destination);
+      break;
+    case Opcode::kReturn:
+      VisitReturn(node);
+      break;
+    case Opcode::kTailCall:
+      VisitTailCall(node);
+      break;
+    case Opcode::kDeoptimize: {
+      const DeoptimizeOp& deoptimize = op.Cast<DeoptimizeOp>();
+      VisitDeoptimize(deoptimize.parameters->reason(), node.id(),
+                      deoptimize.parameters->feedback(),
+                      deoptimize.frame_state());
+      break;
+    }
+    case Opcode::kBranch: {
+      const BranchOp& branch = op.Cast<BranchOp>();
+      block_t tbranch = branch.if_true;
+      block_t fbranch = branch.if_false;
+      if (tbranch == fbranch) {
+        VisitGoto(tbranch);
+      } else {
+        VisitBranch(node, tbranch, fbranch);
+      }
+      break;
+    }
+    case Opcode::kSwitch: {
+      const SwitchOp& swtch = op.Cast<SwitchOp>();
+      int32_t min_value = std::numeric_limits<int32_t>::max();
+      int32_t max_value = std::numeric_limits<int32_t>::min();
 
-#if !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_S390X && !V8_TARGET_ARCH_PPC64
-#if !V8_TARGET_ARCH_ARM64
-#if !V8_TARGET_ARCH_MIPS64 && !V8_TARGET_ARCH_LOONG64 && \
-    !V8_TARGET_ARCH_RISCV32 && !V8_TARGET_ARCH_RISCV64
-void InstructionSelector::VisitI64x2Splat(Node* node) { UNIMPLEMENTED(); }
-void InstructionSelector::VisitI64x2ExtractLane(Node* node) { UNIMPLEMENTED(); }
-void InstructionSelector::VisitI64x2ReplaceLane(Node* node) { UNIMPLEMENTED(); }
-#endif  // !V8_TARGET_ARCH_MIPS64 && !V8_TARGET_ARCH_LOONG64 &&
-        // !V8_TARGET_ARCH_RISCV64 && !V8_TARGET_ARCH_RISCV32
-#endif  // !V8_TARGET_ARCH_ARM64
-#endif  // !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_S390X && !V8_TARGET_ARCH_PPC64
+      ZoneVector<CaseInfo> cases(swtch.cases.size(), zone());
+      for (size_t i = 0; i < swtch.cases.size(); ++i) {
+        const SwitchOp::Case& c = swtch.cases[i];
+        cases[i] = CaseInfo{c.value, 0, c.destination};
+        if (min_value > c.value) min_value = c.value;
+        if (max_value < c.value) max_value = c.value;
+      }
+      SwitchInfo sw(std::move(cases), min_value, max_value, swtch.default_case);
+      return VisitSwitch(node, sw);
+    }
+    case Opcode::kCheckException: {
+      const CheckExceptionOp& check = op.Cast<CheckExceptionOp>();
+      VisitCall(check.throwing_operation(), check.catch_block);
+      VisitGoto(check.didnt_throw_block);
+      return;
+    }
+    case Opcode::kUnreachable:
+      return VisitUnreachable(node);
+    default: {
+      const std::string op_string = op.ToString();
+      PrintF("\033[31mNo ISEL support for: %s\033[m\n", op_string.c_str());
+      FATAL("Unexpected operation #%d:%s", node.id(), op_string.c_str());
+    }
+  }
 
-void InstructionSelector::VisitFinishRegion(Node* node) { EmitIdentity(node); }
+  if (trace_turbo_ == InstructionSelector::kEnableTraceTurboJson) {
+    DCHECK(node.valid());
+    int instruction_start = static_cast<int>(instructions_.size());
+    instr_origins_[this->id(node)] = {instruction_start, instruction_end};
+  }
+}
 
-void InstructionSelector::VisitParameter(Node* node) {
-  OperandGenerator g(this);
-  int index = ParameterIndexOf(node->op());
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitControl(BasicBlock* block) {
+#ifdef DEBUG
+  // SSA deconstruction requires targets of branches not to have phis.
+  // Edge split form guarantees this property, but is more strict.
+  if (block->SuccessorCount() > 1) {
+    for (BasicBlock* const successor : block->successors()) {
+      for (Node* const node : *successor) {
+        if (IrOpcode::IsPhiOpcode(node->opcode())) {
+          std::ostringstream str;
+          str << "You might have specified merged variables for a label with "
+              << "only one predecessor." << std::endl
+              << "# Current Block: " << *successor << std::endl
+              << "#          Node: " << *node;
+          FATAL("%s", str.str().c_str());
+        }
+      }
+    }
+  }
+#endif
 
-  if (linkage()->GetParameterLocation(index).IsNullRegister()) {
-    EmitMoveParamToFPR(node, index);
-  } else {
-    InstructionOperand op =
-        linkage()->ParameterHasSecondaryLocation(index)
-            ? g.DefineAsDualLocation(
-                  node, linkage()->GetParameterLocation(index),
-                  linkage()->GetParameterSecondaryLocation(index))
-            : g.DefineAsLocation(node, linkage()->GetParameterLocation(index));
-    Emit(kArchNop, op);
+  Node* input = block->control_input();
+  int instruction_end = static_cast<int>(instructions_.size());
+  switch (block->control()) {
+    case BasicBlock::kGoto:
+      VisitGoto(block->SuccessorAt(0));
+      break;
+    case BasicBlock::kCall: {
+      DCHECK_EQ(IrOpcode::kCall, input->opcode());
+      BasicBlock* success = block->SuccessorAt(0);
+      BasicBlock* exception = block->SuccessorAt(1);
+      VisitCall(input, exception);
+      VisitGoto(success);
+      break;
+    }
+    case BasicBlock::kTailCall: {
+      DCHECK_EQ(IrOpcode::kTailCall, input->opcode());
+      VisitTailCall(input);
+      break;
+    }
+    case BasicBlock::kBranch: {
+      DCHECK_EQ(IrOpcode::kBranch, input->opcode());
+      // TODO(nicohartmann@): Once all branches have explicitly specified
+      // semantics, we should allow only BranchSemantics::kMachine here.
+      DCHECK_NE(BranchSemantics::kJS,
+                BranchParametersOf(input->op()).semantics());
+      BasicBlock* tbranch = block->SuccessorAt(0);
+      BasicBlock* fbranch = block->SuccessorAt(1);
+      if (tbranch == fbranch) {
+        VisitGoto(tbranch);
+      } else {
+        VisitBranch(input, tbranch, fbranch);
+      }
+      break;
+    }
+    case BasicBlock::kSwitch: {
+      DCHECK_EQ(IrOpcode::kSwitch, input->opcode());
+      // Last successor must be {IfDefault}.
+      BasicBlock* default_branch = block->successors().back();
+      DCHECK_EQ(IrOpcode::kIfDefault, default_branch->front()->opcode());
+      // All other successors must be {IfValue}s.
+      int32_t min_value = std::numeric_limits<int32_t>::max();
+      int32_t max_value = std::numeric_limits<int32_t>::min();
+      size_t case_count = block->SuccessorCount() - 1;
+      ZoneVector<CaseInfo> cases(case_count, zone());
+      for (size_t i = 0; i < case_count; ++i) {
+        BasicBlock* branch = block->SuccessorAt(i);
+        const IfValueParameters& p = IfValueParametersOf(branch->front()->op());
+        cases[i] = CaseInfo{p.value(), p.comparison_order(), branch};
+        if (min_value > p.value()) min_value = p.value();
+        if (max_value < p.value()) max_value = p.value();
+      }
+      SwitchInfo sw(cases, min_value, max_value, default_branch);
+      VisitSwitch(input, sw);
+      break;
+    }
+    case BasicBlock::kReturn: {
+      DCHECK_EQ(IrOpcode::kReturn, input->opcode());
+      VisitReturn(input);
+      break;
+    }
+    case BasicBlock::kDeoptimize: {
+      DeoptimizeParameters p = DeoptimizeParametersOf(input->op());
+      FrameState value{input->InputAt(0)};
+      VisitDeoptimize(p.reason(), input->id(), p.feedback(), value);
+      break;
+    }
+    case BasicBlock::kThrow:
+      DCHECK_EQ(IrOpcode::kThrow, input->opcode());
+      VisitThrow(input);
+      break;
+    case BasicBlock::kNone: {
+      // Exit block doesn't have control.
+      DCHECK_NULL(input);
+      break;
+    }
+    default:
+      UNREACHABLE();
   }
-}
-
-namespace {
-
-LinkageLocation ExceptionLocation() {
-  return LinkageLocation::ForRegister(kReturnRegister0.code(),
-                                      MachineType::TaggedPointer());
-}
-
-constexpr InstructionCode EncodeCallDescriptorFlags(
-    InstructionCode opcode, CallDescriptor::Flags flags) {
-  // Note: Not all bits of `flags` are preserved.
-  static_assert(CallDescriptor::kFlagsBitsEncodedInInstructionCode ==
-                MiscField::kSize);
-  DCHECK(Instruction::IsCallWithDescriptorFlags(opcode));
-  return opcode | MiscField::encode(flags & MiscField::kMax);
-}
-
-}  // namespace
-
-void InstructionSelector::VisitIfException(Node* node) {
-  OperandGenerator g(this);
-  DCHECK_EQ(IrOpcode::kCall, node->InputAt(1)->opcode());
-  Emit(kArchNop, g.DefineAsLocation(node, ExceptionLocation()));
-}
-
-void InstructionSelector::VisitOsrValue(Node* node) {
-  OperandGenerator g(this);
-  int index = OsrValueIndexOf(node->op());
-  Emit(kArchNop,
-       g.DefineAsLocation(node, linkage()->GetOsrValueLocation(index)));
-}
-
-void InstructionSelector::VisitPhi(Node* node) {
-  const int input_count = node->op()->ValueInputCount();
-  DCHECK_EQ(input_count, current_block_->PredecessorCount());
-  PhiInstruction* phi = instruction_zone()->New<PhiInstruction>(
-      instruction_zone(), GetVirtualRegister(node),
-      static_cast<size_t>(input_count));
-  sequence()
-      ->InstructionBlockAt(RpoNumber::FromInt(current_block_->rpo_number()))
-      ->AddPhi(phi);
-  for (int i = 0; i < input_count; ++i) {
-    Node* const input = node->InputAt(i);
-    MarkAsUsed(input);
-    phi->SetInput(static_cast<size_t>(i), GetVirtualRegister(input));
+  if (trace_turbo_ == InstructionSelector::kEnableTraceTurboJson && input) {
+    int instruction_start = static_cast<int>(instructions_.size());
+    instr_origins_[input->id()] = {instruction_start, instruction_end};
   }
 }
 
-void InstructionSelector::VisitProjection(Node* node) {
-  OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  switch (value->opcode()) {
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitNode(Node* node) {
+  tick_counter_->TickAndMaybeEnterSafepoint();
+  DCHECK_NOT_NULL(
+      this->block(schedule(), node));  // should only use scheduled nodes.
+  switch (node->opcode()) {
+    case IrOpcode::kTraceInstruction:
+#if V8_TARGET_ARCH_X64
+      return VisitTraceInstruction(node);
+#else
+      return;
+#endif
+    case IrOpcode::kStart:
+    case IrOpcode::kLoop:
+    case IrOpcode::kEnd:
+    case IrOpcode::kBranch:
+    case IrOpcode::kIfTrue:
+    case IrOpcode::kIfFalse:
+    case IrOpcode::kIfSuccess:
+    case IrOpcode::kSwitch:
+    case IrOpcode::kIfValue:
+    case IrOpcode::kIfDefault:
+    case IrOpcode::kEffectPhi:
+    case IrOpcode::kMerge:
+    case IrOpcode::kTerminate:
+    case IrOpcode::kBeginRegion:
+      // No code needed for these graph artifacts.
+      return;
+    case IrOpcode::kIfException:
+      return MarkAsTagged(node), VisitIfException(node);
+    case IrOpcode::kFinishRegion:
+      return MarkAsTagged(node), VisitFinishRegion(node);
+    case IrOpcode::kParameter: {
+      // Parameters should always be scheduled to the first block.
+      DCHECK_EQ(this->rpo_number(this->block(schedule(), node)).ToInt(), 0);
+      MachineType type =
+          linkage()->GetParameterType(ParameterIndexOf(node->op()));
+      MarkAsRepresentation(type.representation(), node);
+      return VisitParameter(node);
+    }
+    case IrOpcode::kOsrValue:
+      return MarkAsTagged(node), VisitOsrValue(node);
+    case IrOpcode::kPhi: {
+      MachineRepresentation rep = PhiRepresentationOf(node->op());
+      if (rep == MachineRepresentation::kNone) return;
+      MarkAsRepresentation(rep, node);
+      return VisitPhi(node);
+    }
+    case IrOpcode::kProjection:
+      return VisitProjection(node);
+    case IrOpcode::kInt32Constant:
+    case IrOpcode::kInt64Constant:
+    case IrOpcode::kTaggedIndexConstant:
+    case IrOpcode::kExternalConstant:
+    case IrOpcode::kRelocatableInt32Constant:
+    case IrOpcode::kRelocatableInt64Constant:
+      return VisitConstant(node);
+    case IrOpcode::kFloat32Constant:
+      return MarkAsFloat32(node), VisitConstant(node);
+    case IrOpcode::kFloat64Constant:
+      return MarkAsFloat64(node), VisitConstant(node);
+    case IrOpcode::kHeapConstant:
+      return MarkAsTagged(node), VisitConstant(node);
+    case IrOpcode::kCompressedHeapConstant:
+      return MarkAsCompressed(node), VisitConstant(node);
+    case IrOpcode::kNumberConstant: {
+      double value = OpParameter<double>(node->op());
+      if (!IsSmiDouble(value)) MarkAsTagged(node);
+      return VisitConstant(node);
+    }
+    case IrOpcode::kCall:
+      return VisitCall(node);
+    case IrOpcode::kDeoptimizeIf:
+      return VisitDeoptimizeIf(node);
+    case IrOpcode::kDeoptimizeUnless:
+      return VisitDeoptimizeUnless(node);
+    case IrOpcode::kTrapIf:
+      return VisitTrapIf(node, TrapIdOf(node->op()));
+    case IrOpcode::kTrapUnless:
+      return VisitTrapUnless(node, TrapIdOf(node->op()));
+    case IrOpcode::kFrameState:
+    case IrOpcode::kStateValues:
+    case IrOpcode::kObjectState:
+      return;
+    case IrOpcode::kAbortCSADcheck:
+      VisitAbortCSADcheck(node);
+      return;
+    case IrOpcode::kDebugBreak:
+      VisitDebugBreak(node);
+      return;
+    case IrOpcode::kUnreachable:
+      VisitUnreachable(node);
+      return;
+    case IrOpcode::kStaticAssert:
+      VisitStaticAssert(node);
+      return;
+    case IrOpcode::kDeadValue:
+      VisitDeadValue(node);
+      return;
+    case IrOpcode::kComment:
+      VisitComment(node);
+      return;
+    case IrOpcode::kRetain:
+      VisitRetain(node);
+      return;
+    case IrOpcode::kLoad:
+    case IrOpcode::kLoadImmutable: {
+      LoadRepresentation type = LoadRepresentationOf(node->op());
+      MarkAsRepresentation(type.representation(), node);
+      return VisitLoad(node);
+    }
+    case IrOpcode::kLoadTransform: {
+      LoadTransformParameters params = LoadTransformParametersOf(node->op());
+      if (params.transformation >= LoadTransformation::kFirst256Transform) {
+        MarkAsRepresentation(MachineRepresentation::kSimd256, node);
+      } else {
+        MarkAsRepresentation(MachineRepresentation::kSimd128, node);
+      }
+      return VisitLoadTransform(node);
+    }
+    case IrOpcode::kLoadLane: {
+      MarkAsRepresentation(MachineRepresentation::kSimd128, node);
+      return VisitLoadLane(node);
+    }
+    case IrOpcode::kStore:
+      return VisitStore(node);
+    case IrOpcode::kStorePair:
+      return VisitStorePair(node);
+    case IrOpcode::kProtectedStore:
+    case IrOpcode::kStoreTrapOnNull:
+      return VisitProtectedStore(node);
+    case IrOpcode::kStoreLane: {
+      MarkAsRepresentation(MachineRepresentation::kSimd128, node);
+      return VisitStoreLane(node);
+    }
+    case IrOpcode::kWord32And:
+      return MarkAsWord32(node), VisitWord32And(node);
+    case IrOpcode::kWord32Or:
+      return MarkAsWord32(node), VisitWord32Or(node);
+    case IrOpcode::kWord32Xor:
+      return MarkAsWord32(node), VisitWord32Xor(node);
+    case IrOpcode::kWord32Shl:
+      return MarkAsWord32(node), VisitWord32Shl(node);
+    case IrOpcode::kWord32Shr:
+      return MarkAsWord32(node), VisitWord32Shr(node);
+    case IrOpcode::kWord32Sar:
+      return MarkAsWord32(node), VisitWord32Sar(node);
+    case IrOpcode::kWord32Rol:
+      return MarkAsWord32(node), VisitWord32Rol(node);
+    case IrOpcode::kWord32Ror:
+      return MarkAsWord32(node), VisitWord32Ror(node);
+    case IrOpcode::kWord32Equal:
+      return VisitWord32Equal(node);
+    case IrOpcode::kWord32Clz:
+      return MarkAsWord32(node), VisitWord32Clz(node);
+    case IrOpcode::kWord32Ctz:
+      return MarkAsWord32(node), VisitWord32Ctz(node);
+    case IrOpcode::kWord32ReverseBits:
+      return MarkAsWord32(node), VisitWord32ReverseBits(node);
+    case IrOpcode::kWord32ReverseBytes:
+      return MarkAsWord32(node), VisitWord32ReverseBytes(node);
+    case IrOpcode::kInt32AbsWithOverflow:
+      return MarkAsWord32(node), VisitInt32AbsWithOverflow(node);
+    case IrOpcode::kWord32Popcnt:
+      return MarkAsWord32(node), VisitWord32Popcnt(node);
+    case IrOpcode::kWord64Popcnt:
+      return MarkAsWord64(node), VisitWord64Popcnt(node);
+    case IrOpcode::kWord32Select:
+      return MarkAsWord32(node), VisitSelect(node);
+    case IrOpcode::kWord64And:
+      return MarkAsWord64(node), VisitWord64And(node);
+    case IrOpcode::kWord64Or:
+      return MarkAsWord64(node), VisitWord64Or(node);
+    case IrOpcode::kWord64Xor:
+      return MarkAsWord64(node), VisitWord64Xor(node);
+    case IrOpcode::kWord64Shl:
+      return MarkAsWord64(node), VisitWord64Shl(node);
+    case IrOpcode::kWord64Shr:
+      return MarkAsWord64(node), VisitWord64Shr(node);
+    case IrOpcode::kWord64Sar:
+      return MarkAsWord64(node), VisitWord64Sar(node);
+    case IrOpcode::kWord64Rol:
+      return MarkAsWord64(node), VisitWord64Rol(node);
+    case IrOpcode::kWord64Ror:
+      return MarkAsWord64(node), VisitWord64Ror(node);
+    case IrOpcode::kWord64Clz:
+      return MarkAsWord64(node), VisitWord64Clz(node);
+    case IrOpcode::kWord64Ctz:
+      return MarkAsWord64(node), VisitWord64Ctz(node);
+    case IrOpcode::kWord64ReverseBits:
+      return MarkAsWord64(node), VisitWord64ReverseBits(node);
+    case IrOpcode::kWord64ReverseBytes:
+      return MarkAsWord64(node), VisitWord64ReverseBytes(node);
+    case IrOpcode::kSimd128ReverseBytes:
+      return MarkAsSimd128(node), VisitSimd128ReverseBytes(node);
+    case IrOpcode::kInt64AbsWithOverflow:
+      return MarkAsWord64(node), VisitInt64AbsWithOverflow(node);
+    case IrOpcode::kWord64Equal:
+      return VisitWord64Equal(node);
+    case IrOpcode::kWord64Select:
+      return MarkAsWord64(node), VisitSelect(node);
+    case IrOpcode::kInt32Add:
+      return MarkAsWord32(node), VisitInt32Add(node);
     case IrOpcode::kInt32AddWithOverflow:
+      return MarkAsWord32(node), VisitInt32AddWithOverflow(node);
+    case IrOpcode::kInt32Sub:
+      return MarkAsWord32(node), VisitInt32Sub(node);
     case IrOpcode::kInt32SubWithOverflow:
+      return VisitInt32SubWithOverflow(node);
+    case IrOpcode::kInt32Mul:
+      return MarkAsWord32(node), VisitInt32Mul(node);
     case IrOpcode::kInt32MulWithOverflow:
+      return MarkAsWord32(node), VisitInt32MulWithOverflow(node);
+    case IrOpcode::kInt32MulHigh:
+      return VisitInt32MulHigh(node);
+    case IrOpcode::kInt64MulHigh:
+      return VisitInt64MulHigh(node);
+    case IrOpcode::kInt32Div:
+      return MarkAsWord32(node), VisitInt32Div(node);
+    case IrOpcode::kInt32Mod:
+      return MarkAsWord32(node), VisitInt32Mod(node);
+    case IrOpcode::kInt32LessThan:
+      return VisitInt32LessThan(node);
+    case IrOpcode::kInt32LessThanOrEqual:
+      return VisitInt32LessThanOrEqual(node);
+    case IrOpcode::kUint32Div:
+      return MarkAsWord32(node), VisitUint32Div(node);
+    case IrOpcode::kUint32LessThan:
+      return VisitUint32LessThan(node);
+    case IrOpcode::kUint32LessThanOrEqual:
+      return VisitUint32LessThanOrEqual(node);
+    case IrOpcode::kUint32Mod:
+      return MarkAsWord32(node), VisitUint32Mod(node);
+    case IrOpcode::kUint32MulHigh:
+      return VisitUint32MulHigh(node);
+    case IrOpcode::kUint64MulHigh:
+      return VisitUint64MulHigh(node);
+    case IrOpcode::kInt64Add:
+      return MarkAsWord64(node), VisitInt64Add(node);
     case IrOpcode::kInt64AddWithOverflow:
+      return MarkAsWord64(node), VisitInt64AddWithOverflow(node);
+    case IrOpcode::kInt64Sub:
+      return MarkAsWord64(node), VisitInt64Sub(node);
     case IrOpcode::kInt64SubWithOverflow:
+      return MarkAsWord64(node), VisitInt64SubWithOverflow(node);
+    case IrOpcode::kInt64Mul:
+      return MarkAsWord64(node), VisitInt64Mul(node);
     case IrOpcode::kInt64MulWithOverflow:
+      return MarkAsWord64(node), VisitInt64MulWithOverflow(node);
+    case IrOpcode::kInt64Div:
+      return MarkAsWord64(node), VisitInt64Div(node);
+    case IrOpcode::kInt64Mod:
+      return MarkAsWord64(node), VisitInt64Mod(node);
+    case IrOpcode::kInt64LessThan:
+      return VisitInt64LessThan(node);
+    case IrOpcode::kInt64LessThanOrEqual:
+      return VisitInt64LessThanOrEqual(node);
+    case IrOpcode::kUint64Div:
+      return MarkAsWord64(node), VisitUint64Div(node);
+    case IrOpcode::kUint64LessThan:
+      return VisitUint64LessThan(node);
+    case IrOpcode::kUint64LessThanOrEqual:
+      return VisitUint64LessThanOrEqual(node);
+    case IrOpcode::kUint64Mod:
+      return MarkAsWord64(node), VisitUint64Mod(node);
+    case IrOpcode::kBitcastTaggedToWord:
+    case IrOpcode::kBitcastTaggedToWordForTagAndSmiBits:
+      return MarkAsRepresentation(MachineType::PointerRepresentation(), node),
+             VisitBitcastTaggedToWord(node);
+    case IrOpcode::kBitcastWordToTagged:
+      return MarkAsTagged(node), VisitBitcastWordToTagged(node);
+    case IrOpcode::kBitcastWordToTaggedSigned:
+      return MarkAsRepresentation(MachineRepresentation::kTaggedSigned, node),
+             EmitIdentity(node);
+    case IrOpcode::kChangeFloat32ToFloat64:
+      return MarkAsFloat64(node), VisitChangeFloat32ToFloat64(node);
+    case IrOpcode::kChangeInt32ToFloat64:
+      return MarkAsFloat64(node), VisitChangeInt32ToFloat64(node);
+    case IrOpcode::kChangeInt64ToFloat64:
+      return MarkAsFloat64(node), VisitChangeInt64ToFloat64(node);
+    case IrOpcode::kChangeUint32ToFloat64:
+      return MarkAsFloat64(node), VisitChangeUint32ToFloat64(node);
+    case IrOpcode::kChangeFloat64ToInt32:
+      return MarkAsWord32(node), VisitChangeFloat64ToInt32(node);
+    case IrOpcode::kChangeFloat64ToInt64:
+      return MarkAsWord64(node), VisitChangeFloat64ToInt64(node);
+    case IrOpcode::kChangeFloat64ToUint32:
+      return MarkAsWord32(node), VisitChangeFloat64ToUint32(node);
+    case IrOpcode::kChangeFloat64ToUint64:
+      return MarkAsWord64(node), VisitChangeFloat64ToUint64(node);
+    case IrOpcode::kFloat64SilenceNaN:
+      MarkAsFloat64(node);
+      if (CanProduceSignalingNaN(node->InputAt(0))) {
+        return VisitFloat64SilenceNaN(node);
+      } else {
+        return EmitIdentity(node);
+      }
+    case IrOpcode::kTruncateFloat64ToInt64:
+      return MarkAsWord64(node), VisitTruncateFloat64ToInt64(node);
+    case IrOpcode::kTruncateFloat64ToUint32:
+      return MarkAsWord32(node), VisitTruncateFloat64ToUint32(node);
+    case IrOpcode::kTruncateFloat32ToInt32:
+      return MarkAsWord32(node), VisitTruncateFloat32ToInt32(node);
+    case IrOpcode::kTruncateFloat32ToUint32:
+      return MarkAsWord32(node), VisitTruncateFloat32ToUint32(node);
     case IrOpcode::kTryTruncateFloat32ToInt64:
+      return MarkAsWord64(node), VisitTryTruncateFloat32ToInt64(node);
     case IrOpcode::kTryTruncateFloat64ToInt64:
+      return MarkAsWord64(node), VisitTryTruncateFloat64ToInt64(node);
     case IrOpcode::kTryTruncateFloat32ToUint64:
+      return MarkAsWord64(node), VisitTryTruncateFloat32ToUint64(node);
     case IrOpcode::kTryTruncateFloat64ToUint64:
+      return MarkAsWord64(node), VisitTryTruncateFloat64ToUint64(node);
     case IrOpcode::kTryTruncateFloat64ToInt32:
+      return MarkAsWord32(node), VisitTryTruncateFloat64ToInt32(node);
     case IrOpcode::kTryTruncateFloat64ToUint32:
+      return MarkAsWord32(node), VisitTryTruncateFloat64ToUint32(node);
+    case IrOpcode::kBitcastWord32ToWord64:
+      MarkAsWord64(node);
+      return VisitBitcastWord32ToWord64(node);
+    case IrOpcode::kChangeInt32ToInt64:
+      return MarkAsWord64(node), VisitChangeInt32ToInt64(node);
+    case IrOpcode::kChangeUint32ToUint64:
+      return MarkAsWord64(node), VisitChangeUint32ToUint64(node);
+    case IrOpcode::kTruncateFloat64ToFloat32:
+      return MarkAsFloat32(node), VisitTruncateFloat64ToFloat32(node);
+    case IrOpcode::kTruncateFloat64ToWord32:
+      return MarkAsWord32(node), VisitTruncateFloat64ToWord32(node);
+    case IrOpcode::kTruncateInt64ToInt32:
+      return MarkAsWord32(node), VisitTruncateInt64ToInt32(node);
+    case IrOpcode::kRoundFloat64ToInt32:
+      return MarkAsWord32(node), VisitRoundFloat64ToInt32(node);
+    case IrOpcode::kRoundInt64ToFloat32:
+      return MarkAsFloat32(node), VisitRoundInt64ToFloat32(node);
+    case IrOpcode::kRoundInt32ToFloat32:
+      return MarkAsFloat32(node), VisitRoundInt32ToFloat32(node);
+    case IrOpcode::kRoundInt64ToFloat64:
+      return MarkAsFloat64(node), VisitRoundInt64ToFloat64(node);
+    case IrOpcode::kBitcastFloat32ToInt32:
+      return MarkAsWord32(node), VisitBitcastFloat32ToInt32(node);
+    case IrOpcode::kRoundUint32ToFloat32:
+      return MarkAsFloat32(node), VisitRoundUint32ToFloat32(node);
+    case IrOpcode::kRoundUint64ToFloat32:
+      return MarkAsFloat32(node), VisitRoundUint64ToFloat32(node);
+    case IrOpcode::kRoundUint64ToFloat64:
+      return MarkAsFloat64(node), VisitRoundUint64ToFloat64(node);
+    case IrOpcode::kBitcastFloat64ToInt64:
+      return MarkAsWord64(node), VisitBitcastFloat64ToInt64(node);
+    case IrOpcode::kBitcastInt32ToFloat32:
+      return MarkAsFloat32(node), VisitBitcastInt32ToFloat32(node);
+    case IrOpcode::kBitcastInt64ToFloat64:
+      return MarkAsFloat64(node), VisitBitcastInt64ToFloat64(node);
+    case IrOpcode::kFloat32Add:
+      return MarkAsFloat32(node), VisitFloat32Add(node);
+    case IrOpcode::kFloat32Sub:
+      return MarkAsFloat32(node), VisitFloat32Sub(node);
+    case IrOpcode::kFloat32Neg:
+      return MarkAsFloat32(node), VisitFloat32Neg(node);
+    case IrOpcode::kFloat32Mul:
+      return MarkAsFloat32(node), VisitFloat32Mul(node);
+    case IrOpcode::kFloat32Div:
+      return MarkAsFloat32(node), VisitFloat32Div(node);
+    case IrOpcode::kFloat32Abs:
+      return MarkAsFloat32(node), VisitFloat32Abs(node);
+    case IrOpcode::kFloat32Sqrt:
+      return MarkAsFloat32(node), VisitFloat32Sqrt(node);
+    case IrOpcode::kFloat32Equal:
+      return VisitFloat32Equal(node);
+    case IrOpcode::kFloat32LessThan:
+      return VisitFloat32LessThan(node);
+    case IrOpcode::kFloat32LessThanOrEqual:
+      return VisitFloat32LessThanOrEqual(node);
+    case IrOpcode::kFloat32Max:
+      return MarkAsFloat32(node), VisitFloat32Max(node);
+    case IrOpcode::kFloat32Min:
+      return MarkAsFloat32(node), VisitFloat32Min(node);
+    case IrOpcode::kFloat32Select:
+      return MarkAsFloat32(node), VisitSelect(node);
+    case IrOpcode::kFloat64Add:
+      return MarkAsFloat64(node), VisitFloat64Add(node);
+    case IrOpcode::kFloat64Sub:
+      return MarkAsFloat64(node), VisitFloat64Sub(node);
+    case IrOpcode::kFloat64Neg:
+      return MarkAsFloat64(node), VisitFloat64Neg(node);
+    case IrOpcode::kFloat64Mul:
+      return MarkAsFloat64(node), VisitFloat64Mul(node);
+    case IrOpcode::kFloat64Div:
+      return MarkAsFloat64(node), VisitFloat64Div(node);
+    case IrOpcode::kFloat64Mod:
+      return MarkAsFloat64(node), VisitFloat64Mod(node);
+    case IrOpcode::kFloat64Min:
+      return MarkAsFloat64(node), VisitFloat64Min(node);
+    case IrOpcode::kFloat64Max:
+      return MarkAsFloat64(node), VisitFloat64Max(node);
+    case IrOpcode::kFloat64Abs:
+      return MarkAsFloat64(node), VisitFloat64Abs(node);
+    case IrOpcode::kFloat64Acos:
+      return MarkAsFloat64(node), VisitFloat64Acos(node);
+    case IrOpcode::kFloat64Acosh:
+      return MarkAsFloat64(node), VisitFloat64Acosh(node);
+    case IrOpcode::kFloat64Asin:
+      return MarkAsFloat64(node), VisitFloat64Asin(node);
+    case IrOpcode::kFloat64Asinh:
+      return MarkAsFloat64(node), VisitFloat64Asinh(node);
+    case IrOpcode::kFloat64Atan:
+      return MarkAsFloat64(node), VisitFloat64Atan(node);
+    case IrOpcode::kFloat64Atanh:
+      return MarkAsFloat64(node), VisitFloat64Atanh(node);
+    case IrOpcode::kFloat64Atan2:
+      return MarkAsFloat64(node), VisitFloat64Atan2(node);
+    case IrOpcode::kFloat64Cbrt:
+      return MarkAsFloat64(node), VisitFloat64Cbrt(node);
+    case IrOpcode::kFloat64Cos:
+      return MarkAsFloat64(node), VisitFloat64Cos(node);
+    case IrOpcode::kFloat64Cosh:
+      return MarkAsFloat64(node), VisitFloat64Cosh(node);
+    case IrOpcode::kFloat64Exp:
+      return MarkAsFloat64(node), VisitFloat64Exp(node);
+    case IrOpcode::kFloat64Expm1:
+      return MarkAsFloat64(node), VisitFloat64Expm1(node);
+    case IrOpcode::kFloat64Log:
+      return MarkAsFloat64(node), VisitFloat64Log(node);
+    case IrOpcode::kFloat64Log1p:
+      return MarkAsFloat64(node), VisitFloat64Log1p(node);
+    case IrOpcode::kFloat64Log10:
+      return MarkAsFloat64(node), VisitFloat64Log10(node);
+    case IrOpcode::kFloat64Log2:
+      return MarkAsFloat64(node), VisitFloat64Log2(node);
+    case IrOpcode::kFloat64Pow:
+      return MarkAsFloat64(node), VisitFloat64Pow(node);
+    case IrOpcode::kFloat64Sin:
+      return MarkAsFloat64(node), VisitFloat64Sin(node);
+    case IrOpcode::kFloat64Sinh:
+      return MarkAsFloat64(node), VisitFloat64Sinh(node);
+    case IrOpcode::kFloat64Sqrt:
+      return MarkAsFloat64(node), VisitFloat64Sqrt(node);
+    case IrOpcode::kFloat64Tan:
+      return MarkAsFloat64(node), VisitFloat64Tan(node);
+    case IrOpcode::kFloat64Tanh:
+      return MarkAsFloat64(node), VisitFloat64Tanh(node);
+    case IrOpcode::kFloat64Equal:
+      return VisitFloat64Equal(node);
+    case IrOpcode::kFloat64LessThan:
+      return VisitFloat64LessThan(node);
+    case IrOpcode::kFloat64LessThanOrEqual:
+      return VisitFloat64LessThanOrEqual(node);
+    case IrOpcode::kFloat64Select:
+      return MarkAsFloat64(node), VisitSelect(node);
+    case IrOpcode::kFloat32RoundDown:
+      return MarkAsFloat32(node), VisitFloat32RoundDown(node);
+    case IrOpcode::kFloat64RoundDown:
+      return MarkAsFloat64(node), VisitFloat64RoundDown(node);
+    case IrOpcode::kFloat32RoundUp:
+      return MarkAsFloat32(node), VisitFloat32RoundUp(node);
+    case IrOpcode::kFloat64RoundUp:
+      return MarkAsFloat64(node), VisitFloat64RoundUp(node);
+    case IrOpcode::kFloat32RoundTruncate:
+      return MarkAsFloat32(node), VisitFloat32RoundTruncate(node);
+    case IrOpcode::kFloat64RoundTruncate:
+      return MarkAsFloat64(node), VisitFloat64RoundTruncate(node);
+    case IrOpcode::kFloat64RoundTiesAway:
+      return MarkAsFloat64(node), VisitFloat64RoundTiesAway(node);
+    case IrOpcode::kFloat32RoundTiesEven:
+      return MarkAsFloat32(node), VisitFloat32RoundTiesEven(node);
+    case IrOpcode::kFloat64RoundTiesEven:
+      return MarkAsFloat64(node), VisitFloat64RoundTiesEven(node);
+    case IrOpcode::kFloat64ExtractLowWord32:
+      return MarkAsWord32(node), VisitFloat64ExtractLowWord32(node);
+    case IrOpcode::kFloat64ExtractHighWord32:
+      return MarkAsWord32(node), VisitFloat64ExtractHighWord32(node);
+    case IrOpcode::kFloat64InsertLowWord32:
+      return MarkAsFloat64(node), VisitFloat64InsertLowWord32(node);
+    case IrOpcode::kFloat64InsertHighWord32:
+      return MarkAsFloat64(node), VisitFloat64InsertHighWord32(node);
+    case IrOpcode::kStackSlot:
+      return VisitStackSlot(node);
+    case IrOpcode::kStackPointerGreaterThan:
+      return VisitStackPointerGreaterThan(node);
+    case IrOpcode::kLoadStackCheckOffset:
+      return VisitLoadStackCheckOffset(node);
+    case IrOpcode::kLoadFramePointer:
+      return VisitLoadFramePointer(node);
+    case IrOpcode::kLoadParentFramePointer:
+      return VisitLoadParentFramePointer(node);
+    case IrOpcode::kLoadRootRegister:
+      return VisitLoadRootRegister(node);
+    case IrOpcode::kUnalignedLoad: {
+      LoadRepresentation type = LoadRepresentationOf(node->op());
+      MarkAsRepresentation(type.representation(), node);
+      return VisitUnalignedLoad(node);
+    }
+    case IrOpcode::kUnalignedStore:
+      return VisitUnalignedStore(node);
     case IrOpcode::kInt32PairAdd:
+      MarkAsWord32(node);
+      MarkPairProjectionsAsWord32(node);
+      return VisitInt32PairAdd(node);
     case IrOpcode::kInt32PairSub:
+      MarkAsWord32(node);
+      MarkPairProjectionsAsWord32(node);
+      return VisitInt32PairSub(node);
     case IrOpcode::kInt32PairMul:
-    case IrOpcode::kWord32PairShl:
-    case IrOpcode::kWord32PairShr:
-    case IrOpcode::kWord32PairSar:
-    case IrOpcode::kInt32AbsWithOverflow:
-    case IrOpcode::kInt64AbsWithOverflow:
-      if (ProjectionIndexOf(node->op()) == 0u) {
-        EmitIdentity(node);
-      } else {
-        DCHECK_EQ(1u, ProjectionIndexOf(node->op()));
-        MarkAsUsed(value);
-      }
-      break;
-    default:
-      break;
-  }
-}
-
-void InstructionSelector::VisitConstant(Node* node) {
-  // We must emit a NOP here because every live range needs a defining
-  // instruction in the register allocator.
-  OperandGenerator g(this);
-  Emit(kArchNop, g.DefineAsConstant(node));
-}
-
-void InstructionSelector::UpdateMaxPushedArgumentCount(size_t count) {
-  *max_pushed_argument_count_ = std::max(count, *max_pushed_argument_count_);
-}
-
-void InstructionSelector::VisitCall(Node* node, BasicBlock* handler) {
-  OperandGenerator g(this);
-  auto call_descriptor = CallDescriptorOf(node->op());
-  SaveFPRegsMode mode = call_descriptor->NeedsCallerSavedFPRegisters()
-                            ? SaveFPRegsMode::kSave
-                            : SaveFPRegsMode::kIgnore;
-
-  if (call_descriptor->NeedsCallerSavedRegisters()) {
-    Emit(kArchSaveCallerRegisters | MiscField::encode(static_cast<int>(mode)),
-         g.NoOutput());
-  }
-
-  FrameStateDescriptor* frame_state_descriptor = nullptr;
-  if (call_descriptor->NeedsFrameState()) {
-    frame_state_descriptor = GetFrameStateDescriptor(FrameState{
-        node->InputAt(static_cast<int>(call_descriptor->InputCount()))});
-  }
-
-  CallBuffer buffer(zone(), call_descriptor, frame_state_descriptor);
-  CallDescriptor::Flags flags = call_descriptor->flags();
-
-  // Compute InstructionOperands for inputs and outputs.
-  // TODO(turbofan): on some architectures it's probably better to use
-  // the code object in a register if there are multiple uses of it.
-  // Improve constant pool and the heuristics in the register allocator
-  // for where to emit constants.
-  CallBufferFlags call_buffer_flags(kCallCodeImmediate | kCallAddressImmediate);
-  InitializeCallBuffer(node, &buffer, call_buffer_flags);
-
-  EmitPrepareArguments(&buffer.pushed_nodes, call_descriptor, node);
-  UpdateMaxPushedArgumentCount(buffer.pushed_nodes.size());
-
-  // Pass label of exception handler block.
-  if (handler) {
-    DCHECK_EQ(IrOpcode::kIfException, handler->front()->opcode());
-    flags |= CallDescriptor::kHasExceptionHandler;
-    buffer.instruction_args.push_back(g.Label(handler));
-  }
-
-  // Select the appropriate opcode based on the call type.
-  InstructionCode opcode;
-  switch (call_descriptor->kind()) {
-    case CallDescriptor::kCallAddress: {
-      int gp_param_count =
-          static_cast<int>(call_descriptor->GPParameterCount());
-      int fp_param_count =
-          static_cast<int>(call_descriptor->FPParameterCount());
-#if ABI_USES_FUNCTION_DESCRIPTORS
-      // Highest fp_param_count bit is used on AIX to indicate if a CFunction
-      // call has function descriptor or not.
-      static_assert(FPParamField::kSize == kHasFunctionDescriptorBitShift + 1);
-      if (!call_descriptor->NoFunctionDescriptor()) {
-        fp_param_count |= 1 << kHasFunctionDescriptorBitShift;
-      }
-#endif
-      opcode = kArchCallCFunction | ParamField::encode(gp_param_count) |
-               FPParamField::encode(fp_param_count);
-      break;
-    }
-    case CallDescriptor::kCallCodeObject:
-      opcode = EncodeCallDescriptorFlags(kArchCallCodeObject, flags);
-      break;
-    case CallDescriptor::kCallJSFunction:
-      opcode = EncodeCallDescriptorFlags(kArchCallJSFunction, flags);
-      break;
-#if V8_ENABLE_WEBASSEMBLY
-    case CallDescriptor::kCallWasmCapiFunction:
-    case CallDescriptor::kCallWasmFunction:
-    case CallDescriptor::kCallWasmImportWrapper:
-      opcode = EncodeCallDescriptorFlags(kArchCallWasmFunction, flags);
-      break;
-#endif  // V8_ENABLE_WEBASSEMBLY
-    case CallDescriptor::kCallBuiltinPointer:
-      opcode = EncodeCallDescriptorFlags(kArchCallBuiltinPointer, flags);
-      break;
-  }
-
-  // Emit the call instruction.
-  size_t const output_count = buffer.outputs.size();
-  auto* outputs = output_count ? &buffer.outputs.front() : nullptr;
-  Instruction* call_instr =
-      Emit(opcode, output_count, outputs, buffer.instruction_args.size(),
-           &buffer.instruction_args.front());
-  if (instruction_selection_failed()) return;
-  call_instr->MarkAsCall();
-
-  EmitPrepareResults(&(buffer.output_nodes), call_descriptor, node);
-
-  if (call_descriptor->NeedsCallerSavedRegisters()) {
-    Emit(
-        kArchRestoreCallerRegisters | MiscField::encode(static_cast<int>(mode)),
-        g.NoOutput());
-  }
-}
-
-void InstructionSelector::VisitTailCall(Node* node) {
-  OperandGenerator g(this);
-
-  auto caller = linkage()->GetIncomingDescriptor();
-  auto callee = CallDescriptorOf(node->op());
-  DCHECK(caller->CanTailCall(callee));
-  const int stack_param_delta = callee->GetStackParameterDelta(caller);
-  CallBuffer buffer(zone(), callee, nullptr);
-
-  // Compute InstructionOperands for inputs and outputs.
-  CallBufferFlags flags(kCallCodeImmediate | kCallTail);
-  if (IsTailCallAddressImmediate()) {
-    flags |= kCallAddressImmediate;
-  }
-  if (callee->flags() & CallDescriptor::kFixedTargetRegister) {
-    flags |= kCallFixedTargetRegister;
-  }
-  InitializeCallBuffer(node, &buffer, flags, stack_param_delta);
-  UpdateMaxPushedArgumentCount(stack_param_delta);
-
-  // Select the appropriate opcode based on the call type.
-  InstructionCode opcode;
-  InstructionOperandVector temps(zone());
-  switch (callee->kind()) {
-    case CallDescriptor::kCallCodeObject:
-      opcode = kArchTailCallCodeObject;
-      break;
-    case CallDescriptor::kCallAddress:
-      DCHECK(!caller->IsJSFunctionCall());
-      opcode = kArchTailCallAddress;
-      break;
-#if V8_ENABLE_WEBASSEMBLY
-    case CallDescriptor::kCallWasmFunction:
-      DCHECK(!caller->IsJSFunctionCall());
-      opcode = kArchTailCallWasm;
-      break;
-#endif  // V8_ENABLE_WEBASSEMBLY
-    default:
-      UNREACHABLE();
-  }
-  opcode = EncodeCallDescriptorFlags(opcode, callee->flags());
-
-  Emit(kArchPrepareTailCall, g.NoOutput());
-
-  // Add an immediate operand that represents the offset to the first slot that
-  // is unused with respect to the stack pointer that has been updated for the
-  // tail call instruction. Backends that pad arguments can write the padding
-  // value at this offset from the stack.
-  const int optional_padding_offset =
-      callee->GetOffsetToFirstUnusedStackSlot() - 1;
-  buffer.instruction_args.push_back(g.TempImmediate(optional_padding_offset));
-
-  const int first_unused_slot_offset =
-      kReturnAddressStackSlotCount + stack_param_delta;
-  buffer.instruction_args.push_back(g.TempImmediate(first_unused_slot_offset));
-
-  // Emit the tailcall instruction.
-  Emit(opcode, 0, nullptr, buffer.instruction_args.size(),
-       &buffer.instruction_args.front(), temps.size(),
-       temps.empty() ? nullptr : &temps.front());
-}
-
-void InstructionSelector::VisitGoto(BasicBlock* target) {
-  // jump to the next block.
-  OperandGenerator g(this);
-  Emit(kArchJmp, g.NoOutput(), g.Label(target));
-}
-
-void InstructionSelector::VisitReturn(Node* ret) {
-  OperandGenerator g(this);
-  const int input_count = linkage()->GetIncomingDescriptor()->ReturnCount() == 0
-                              ? 1
-                              : ret->op()->ValueInputCount();
-  DCHECK_GE(input_count, 1);
-  auto value_locations = zone()->NewArray<InstructionOperand>(input_count);
-  Node* pop_count = ret->InputAt(0);
-  value_locations[0] = (pop_count->opcode() == IrOpcode::kInt32Constant ||
-                        pop_count->opcode() == IrOpcode::kInt64Constant)
-                           ? g.UseImmediate(pop_count)
-                           : g.UseRegister(pop_count);
-  for (int i = 1; i < input_count; ++i) {
-    value_locations[i] =
-        g.UseLocation(ret->InputAt(i), linkage()->GetReturnLocation(i - 1));
-  }
-  Emit(kArchRet, 0, nullptr, input_count, value_locations);
-}
-
-void InstructionSelector::VisitBranch(Node* branch, BasicBlock* tbranch,
-                                      BasicBlock* fbranch) {
-  TryPrepareScheduleFirstProjection(branch->InputAt(0));
-
-  FlagsContinuation cont =
-      FlagsContinuation::ForBranch(kNotEqual, tbranch, fbranch);
-  VisitWordCompareZero(branch, branch->InputAt(0), &cont);
-}
-
-// When a DeoptimizeIf/DeoptimizeUnless/Branch depends on a BinopOverflow, the
-// InstructionSelector can sometimes generate a fuse instruction covering both
-// the BinopOverflow and the DeoptIf/Branch, and the final emitted code will
-// look like:
-//
-//     r = BinopOverflow
-//     jo branch_target/deopt_target
-//
-// When this fusing fails, the final code looks like:
-//
-//     r = BinopOverflow
-//     o = sete  // sets overflow bit
-//     cmp o, 0
-//     jnz branch_target/deopt_target
-//
-// To be able to fuse tue BinopOverflow and the DeoptIf/Branch, the 1st
-// projection (Projection[0], which contains the actual result) must already be
-// scheduled (and a few other conditions must be satisfied, see
-// InstructionSelectorXXX::VisitWordCompareZero).
-// TryPrepareScheduleFirstProjection is thus called from
-// VisitDeoptimizeIf/VisitDeoptimizeUnless/VisitBranch and detects if the 1st
-// projection could be scheduled now, and, if so, defines it.
-void InstructionSelector::TryPrepareScheduleFirstProjection(
-    Node* const maybe_projection) {
-  if (maybe_projection->opcode() != IrOpcode::kProjection) {
-    // The DeoptimizeIf/DeoptimizeUnless/Branch condition is not a projection.
-    return;
+      MarkAsWord32(node);
+      MarkPairProjectionsAsWord32(node);
+      return VisitInt32PairMul(node);
+    case IrOpcode::kWord32PairShl:
+      MarkAsWord32(node);
+      MarkPairProjectionsAsWord32(node);
+      return VisitWord32PairShl(node);
+    case IrOpcode::kWord32PairShr:
+      MarkAsWord32(node);
+      MarkPairProjectionsAsWord32(node);
+      return VisitWord32PairShr(node);
+    case IrOpcode::kWord32PairSar:
+      MarkAsWord32(node);
+      MarkPairProjectionsAsWord32(node);
+      return VisitWord32PairSar(node);
+    case IrOpcode::kMemoryBarrier:
+      return VisitMemoryBarrier(node);
+    case IrOpcode::kWord32AtomicLoad: {
+      AtomicLoadParameters params = AtomicLoadParametersOf(node->op());
+      LoadRepresentation type = params.representation();
+      MarkAsRepresentation(type.representation(), node);
+      return VisitWord32AtomicLoad(node);
+    }
+    case IrOpcode::kWord64AtomicLoad: {
+      AtomicLoadParameters params = AtomicLoadParametersOf(node->op());
+      LoadRepresentation type = params.representation();
+      MarkAsRepresentation(type.representation(), node);
+      return VisitWord64AtomicLoad(node);
+    }
+    case IrOpcode::kWord32AtomicStore:
+      return VisitWord32AtomicStore(node);
+    case IrOpcode::kWord64AtomicStore:
+      return VisitWord64AtomicStore(node);
+    case IrOpcode::kWord32AtomicPairStore:
+      return VisitWord32AtomicPairStore(node);
+    case IrOpcode::kWord32AtomicPairLoad: {
+      MarkAsWord32(node);
+      MarkPairProjectionsAsWord32(node);
+      return VisitWord32AtomicPairLoad(node);
+    }
+#define ATOMIC_CASE(name, rep)                         \
+  case IrOpcode::k##rep##Atomic##name: {               \
+    MachineType type = AtomicOpType(node->op());       \
+    MarkAsRepresentation(type.representation(), node); \
+    return Visit##rep##Atomic##name(node);             \
   }
-
-  if (ProjectionIndexOf(maybe_projection->op()) != 1u) {
-    // The DeoptimizeIf/DeoptimizeUnless/Branch isn't on the Projection[1] (ie,
-    // not on the overflow bit of a BinopOverflow).
-    return;
+      ATOMIC_CASE(Add, Word32)
+      ATOMIC_CASE(Add, Word64)
+      ATOMIC_CASE(Sub, Word32)
+      ATOMIC_CASE(Sub, Word64)
+      ATOMIC_CASE(And, Word32)
+      ATOMIC_CASE(And, Word64)
+      ATOMIC_CASE(Or, Word32)
+      ATOMIC_CASE(Or, Word64)
+      ATOMIC_CASE(Xor, Word32)
+      ATOMIC_CASE(Xor, Word64)
+      ATOMIC_CASE(Exchange, Word32)
+      ATOMIC_CASE(Exchange, Word64)
+      ATOMIC_CASE(CompareExchange, Word32)
+      ATOMIC_CASE(CompareExchange, Word64)
+#undef ATOMIC_CASE
+#define ATOMIC_CASE(name)                     \
+  case IrOpcode::kWord32AtomicPair##name: {   \
+    MarkAsWord32(node);                       \
+    MarkPairProjectionsAsWord32(node);        \
+    return VisitWord32AtomicPair##name(node); \
   }
+      ATOMIC_CASE(Add)
+      ATOMIC_CASE(Sub)
+      ATOMIC_CASE(And)
+      ATOMIC_CASE(Or)
+      ATOMIC_CASE(Xor)
+      ATOMIC_CASE(Exchange)
+      ATOMIC_CASE(CompareExchange)
+#undef ATOMIC_CASE
+    case IrOpcode::kProtectedLoad:
+    case IrOpcode::kLoadTrapOnNull: {
+      LoadRepresentation type = LoadRepresentationOf(node->op());
+      MarkAsRepresentation(type.representation(), node);
+      return VisitProtectedLoad(node);
+    }
+    case IrOpcode::kSignExtendWord8ToInt32:
+      return MarkAsWord32(node), VisitSignExtendWord8ToInt32(node);
+    case IrOpcode::kSignExtendWord16ToInt32:
+      return MarkAsWord32(node), VisitSignExtendWord16ToInt32(node);
+    case IrOpcode::kSignExtendWord8ToInt64:
+      return MarkAsWord64(node), VisitSignExtendWord8ToInt64(node);
+    case IrOpcode::kSignExtendWord16ToInt64:
+      return MarkAsWord64(node), VisitSignExtendWord16ToInt64(node);
+    case IrOpcode::kSignExtendWord32ToInt64:
+      return MarkAsWord64(node), VisitSignExtendWord32ToInt64(node);
+    case IrOpcode::kF64x2Splat:
+      return MarkAsSimd128(node), VisitF64x2Splat(node);
+    case IrOpcode::kF64x2ExtractLane:
+      return MarkAsFloat64(node), VisitF64x2ExtractLane(node);
+    case IrOpcode::kF64x2ReplaceLane:
+      return MarkAsSimd128(node), VisitF64x2ReplaceLane(node);
+    case IrOpcode::kF64x2Abs:
+      return MarkAsSimd128(node), VisitF64x2Abs(node);
+    case IrOpcode::kF64x2Neg:
+      return MarkAsSimd128(node), VisitF64x2Neg(node);
+    case IrOpcode::kF64x2Sqrt:
+      return MarkAsSimd128(node), VisitF64x2Sqrt(node);
+    case IrOpcode::kF64x2Add:
+      return MarkAsSimd128(node), VisitF64x2Add(node);
+    case IrOpcode::kF64x2Sub:
+      return MarkAsSimd128(node), VisitF64x2Sub(node);
+    case IrOpcode::kF64x2Mul:
+      return MarkAsSimd128(node), VisitF64x2Mul(node);
+    case IrOpcode::kF64x2Div:
+      return MarkAsSimd128(node), VisitF64x2Div(node);
+    case IrOpcode::kF64x2Min:
+      return MarkAsSimd128(node), VisitF64x2Min(node);
+    case IrOpcode::kF64x2Max:
+      return MarkAsSimd128(node), VisitF64x2Max(node);
+    case IrOpcode::kF64x2Eq:
+      return MarkAsSimd128(node), VisitF64x2Eq(node);
+    case IrOpcode::kF64x2Ne:
+      return MarkAsSimd128(node), VisitF64x2Ne(node);
+    case IrOpcode::kF64x2Lt:
+      return MarkAsSimd128(node), VisitF64x2Lt(node);
+    case IrOpcode::kF64x2Le:
+      return MarkAsSimd128(node), VisitF64x2Le(node);
+    case IrOpcode::kF64x2Qfma:
+      return MarkAsSimd128(node), VisitF64x2Qfma(node);
+    case IrOpcode::kF64x2Qfms:
+      return MarkAsSimd128(node), VisitF64x2Qfms(node);
+    case IrOpcode::kF64x2Pmin:
+      return MarkAsSimd128(node), VisitF64x2Pmin(node);
+    case IrOpcode::kF64x2Pmax:
+      return MarkAsSimd128(node), VisitF64x2Pmax(node);
+    case IrOpcode::kF64x2Ceil:
+      return MarkAsSimd128(node), VisitF64x2Ceil(node);
+    case IrOpcode::kF64x2Floor:
+      return MarkAsSimd128(node), VisitF64x2Floor(node);
+    case IrOpcode::kF64x2Trunc:
+      return MarkAsSimd128(node), VisitF64x2Trunc(node);
+    case IrOpcode::kF64x2NearestInt:
+      return MarkAsSimd128(node), VisitF64x2NearestInt(node);
+    case IrOpcode::kF64x2ConvertLowI32x4S:
+      return MarkAsSimd128(node), VisitF64x2ConvertLowI32x4S(node);
+    case IrOpcode::kF64x2ConvertLowI32x4U:
+      return MarkAsSimd128(node), VisitF64x2ConvertLowI32x4U(node);
+    case IrOpcode::kF64x2PromoteLowF32x4:
+      return MarkAsSimd128(node), VisitF64x2PromoteLowF32x4(node);
+    case IrOpcode::kF32x4Splat:
+      return MarkAsSimd128(node), VisitF32x4Splat(node);
+    case IrOpcode::kF32x4ExtractLane:
+      return MarkAsFloat32(node), VisitF32x4ExtractLane(node);
+    case IrOpcode::kF32x4ReplaceLane:
+      return MarkAsSimd128(node), VisitF32x4ReplaceLane(node);
+    case IrOpcode::kF32x4SConvertI32x4:
+      return MarkAsSimd128(node), VisitF32x4SConvertI32x4(node);
+    case IrOpcode::kF32x4UConvertI32x4:
+      return MarkAsSimd128(node), VisitF32x4UConvertI32x4(node);
+    case IrOpcode::kF32x4Abs:
+      return MarkAsSimd128(node), VisitF32x4Abs(node);
+    case IrOpcode::kF32x4Neg:
+      return MarkAsSimd128(node), VisitF32x4Neg(node);
+    case IrOpcode::kF32x4Sqrt:
+      return MarkAsSimd128(node), VisitF32x4Sqrt(node);
+    case IrOpcode::kF32x4Add:
+      return MarkAsSimd128(node), VisitF32x4Add(node);
+    case IrOpcode::kF32x4Sub:
+      return MarkAsSimd128(node), VisitF32x4Sub(node);
+    case IrOpcode::kF32x4Mul:
+      return MarkAsSimd128(node), VisitF32x4Mul(node);
+    case IrOpcode::kF32x4Div:
+      return MarkAsSimd128(node), VisitF32x4Div(node);
+    case IrOpcode::kF32x4Min:
+      return MarkAsSimd128(node), VisitF32x4Min(node);
+    case IrOpcode::kF32x4Max:
+      return MarkAsSimd128(node), VisitF32x4Max(node);
+    case IrOpcode::kF32x4Eq:
+      return MarkAsSimd128(node), VisitF32x4Eq(node);
+    case IrOpcode::kF32x4Ne:
+      return MarkAsSimd128(node), VisitF32x4Ne(node);
+    case IrOpcode::kF32x4Lt:
+      return MarkAsSimd128(node), VisitF32x4Lt(node);
+    case IrOpcode::kF32x4Le:
+      return MarkAsSimd128(node), VisitF32x4Le(node);
+    case IrOpcode::kF32x4Qfma:
+      return MarkAsSimd128(node), VisitF32x4Qfma(node);
+    case IrOpcode::kF32x4Qfms:
+      return MarkAsSimd128(node), VisitF32x4Qfms(node);
+    case IrOpcode::kF32x4Pmin:
+      return MarkAsSimd128(node), VisitF32x4Pmin(node);
+    case IrOpcode::kF32x4Pmax:
+      return MarkAsSimd128(node), VisitF32x4Pmax(node);
+    case IrOpcode::kF32x4Ceil:
+      return MarkAsSimd128(node), VisitF32x4Ceil(node);
+    case IrOpcode::kF32x4Floor:
+      return MarkAsSimd128(node), VisitF32x4Floor(node);
+    case IrOpcode::kF32x4Trunc:
+      return MarkAsSimd128(node), VisitF32x4Trunc(node);
+    case IrOpcode::kF32x4NearestInt:
+      return MarkAsSimd128(node), VisitF32x4NearestInt(node);
+    case IrOpcode::kF32x4DemoteF64x2Zero:
+      return MarkAsSimd128(node), VisitF32x4DemoteF64x2Zero(node);
+    case IrOpcode::kI64x2Splat:
+      return MarkAsSimd128(node), VisitI64x2Splat(node);
+    case IrOpcode::kI64x2SplatI32Pair:
+      return MarkAsSimd128(node), VisitI64x2SplatI32Pair(node);
+    case IrOpcode::kI64x2ExtractLane:
+      return MarkAsWord64(node), VisitI64x2ExtractLane(node);
+    case IrOpcode::kI64x2ReplaceLane:
+      return MarkAsSimd128(node), VisitI64x2ReplaceLane(node);
+    case IrOpcode::kI64x2ReplaceLaneI32Pair:
+      return MarkAsSimd128(node), VisitI64x2ReplaceLaneI32Pair(node);
+    case IrOpcode::kI64x2Abs:
+      return MarkAsSimd128(node), VisitI64x2Abs(node);
+    case IrOpcode::kI64x2Neg:
+      return MarkAsSimd128(node), VisitI64x2Neg(node);
+    case IrOpcode::kI64x2SConvertI32x4Low:
+      return MarkAsSimd128(node), VisitI64x2SConvertI32x4Low(node);
+    case IrOpcode::kI64x2SConvertI32x4High:
+      return MarkAsSimd128(node), VisitI64x2SConvertI32x4High(node);
+    case IrOpcode::kI64x2UConvertI32x4Low:
+      return MarkAsSimd128(node), VisitI64x2UConvertI32x4Low(node);
+    case IrOpcode::kI64x2UConvertI32x4High:
+      return MarkAsSimd128(node), VisitI64x2UConvertI32x4High(node);
+    case IrOpcode::kI64x2BitMask:
+      return MarkAsWord32(node), VisitI64x2BitMask(node);
+    case IrOpcode::kI64x2Shl:
+      return MarkAsSimd128(node), VisitI64x2Shl(node);
+    case IrOpcode::kI64x2ShrS:
+      return MarkAsSimd128(node), VisitI64x2ShrS(node);
+    case IrOpcode::kI64x2Add:
+      return MarkAsSimd128(node), VisitI64x2Add(node);
+    case IrOpcode::kI64x2Sub:
+      return MarkAsSimd128(node), VisitI64x2Sub(node);
+    case IrOpcode::kI64x2Mul:
+      return MarkAsSimd128(node), VisitI64x2Mul(node);
+    case IrOpcode::kI64x2Eq:
+      return MarkAsSimd128(node), VisitI64x2Eq(node);
+    case IrOpcode::kI64x2Ne:
+      return MarkAsSimd128(node), VisitI64x2Ne(node);
+    case IrOpcode::kI64x2GtS:
+      return MarkAsSimd128(node), VisitI64x2GtS(node);
+    case IrOpcode::kI64x2GeS:
+      return MarkAsSimd128(node), VisitI64x2GeS(node);
+    case IrOpcode::kI64x2ShrU:
+      return MarkAsSimd128(node), VisitI64x2ShrU(node);
+    case IrOpcode::kI64x2ExtMulLowI32x4S:
+      return MarkAsSimd128(node), VisitI64x2ExtMulLowI32x4S(node);
+    case IrOpcode::kI64x2ExtMulHighI32x4S:
+      return MarkAsSimd128(node), VisitI64x2ExtMulHighI32x4S(node);
+    case IrOpcode::kI64x2ExtMulLowI32x4U:
+      return MarkAsSimd128(node), VisitI64x2ExtMulLowI32x4U(node);
+    case IrOpcode::kI64x2ExtMulHighI32x4U:
+      return MarkAsSimd128(node), VisitI64x2ExtMulHighI32x4U(node);
+    case IrOpcode::kI32x4Splat:
+      return MarkAsSimd128(node), VisitI32x4Splat(node);
+    case IrOpcode::kI32x4ExtractLane:
+      return MarkAsWord32(node), VisitI32x4ExtractLane(node);
+    case IrOpcode::kI32x4ReplaceLane:
+      return MarkAsSimd128(node), VisitI32x4ReplaceLane(node);
+    case IrOpcode::kI32x4SConvertF32x4:
+      return MarkAsSimd128(node), VisitI32x4SConvertF32x4(node);
+    case IrOpcode::kI32x4SConvertI16x8Low:
+      return MarkAsSimd128(node), VisitI32x4SConvertI16x8Low(node);
+    case IrOpcode::kI32x4SConvertI16x8High:
+      return MarkAsSimd128(node), VisitI32x4SConvertI16x8High(node);
+    case IrOpcode::kI32x4Neg:
+      return MarkAsSimd128(node), VisitI32x4Neg(node);
+    case IrOpcode::kI32x4Shl:
+      return MarkAsSimd128(node), VisitI32x4Shl(node);
+    case IrOpcode::kI32x4ShrS:
+      return MarkAsSimd128(node), VisitI32x4ShrS(node);
+    case IrOpcode::kI32x4Add:
+      return MarkAsSimd128(node), VisitI32x4Add(node);
+    case IrOpcode::kI32x4Sub:
+      return MarkAsSimd128(node), VisitI32x4Sub(node);
+    case IrOpcode::kI32x4Mul:
+      return MarkAsSimd128(node), VisitI32x4Mul(node);
+    case IrOpcode::kI32x4MinS:
+      return MarkAsSimd128(node), VisitI32x4MinS(node);
+    case IrOpcode::kI32x4MaxS:
+      return MarkAsSimd128(node), VisitI32x4MaxS(node);
+    case IrOpcode::kI32x4Eq:
+      return MarkAsSimd128(node), VisitI32x4Eq(node);
+    case IrOpcode::kI32x4Ne:
+      return MarkAsSimd128(node), VisitI32x4Ne(node);
+    case IrOpcode::kI32x4GtS:
+      return MarkAsSimd128(node), VisitI32x4GtS(node);
+    case IrOpcode::kI32x4GeS:
+      return MarkAsSimd128(node), VisitI32x4GeS(node);
+    case IrOpcode::kI32x4UConvertF32x4:
+      return MarkAsSimd128(node), VisitI32x4UConvertF32x4(node);
+    case IrOpcode::kI32x4UConvertI16x8Low:
+      return MarkAsSimd128(node), VisitI32x4UConvertI16x8Low(node);
+    case IrOpcode::kI32x4UConvertI16x8High:
+      return MarkAsSimd128(node), VisitI32x4UConvertI16x8High(node);
+    case IrOpcode::kI32x4ShrU:
+      return MarkAsSimd128(node), VisitI32x4ShrU(node);
+    case IrOpcode::kI32x4MinU:
+      return MarkAsSimd128(node), VisitI32x4MinU(node);
+    case IrOpcode::kI32x4MaxU:
+      return MarkAsSimd128(node), VisitI32x4MaxU(node);
+    case IrOpcode::kI32x4GtU:
+      return MarkAsSimd128(node), VisitI32x4GtU(node);
+    case IrOpcode::kI32x4GeU:
+      return MarkAsSimd128(node), VisitI32x4GeU(node);
+    case IrOpcode::kI32x4Abs:
+      return MarkAsSimd128(node), VisitI32x4Abs(node);
+    case IrOpcode::kI32x4BitMask:
+      return MarkAsWord32(node), VisitI32x4BitMask(node);
+    case IrOpcode::kI32x4DotI16x8S:
+      return MarkAsSimd128(node), VisitI32x4DotI16x8S(node);
+    case IrOpcode::kI32x4ExtMulLowI16x8S:
+      return MarkAsSimd128(node), VisitI32x4ExtMulLowI16x8S(node);
+    case IrOpcode::kI32x4ExtMulHighI16x8S:
+      return MarkAsSimd128(node), VisitI32x4ExtMulHighI16x8S(node);
+    case IrOpcode::kI32x4ExtMulLowI16x8U:
+      return MarkAsSimd128(node), VisitI32x4ExtMulLowI16x8U(node);
+    case IrOpcode::kI32x4ExtMulHighI16x8U:
+      return MarkAsSimd128(node), VisitI32x4ExtMulHighI16x8U(node);
+    case IrOpcode::kI32x4ExtAddPairwiseI16x8S:
+      return MarkAsSimd128(node), VisitI32x4ExtAddPairwiseI16x8S(node);
+    case IrOpcode::kI32x4ExtAddPairwiseI16x8U:
+      return MarkAsSimd128(node), VisitI32x4ExtAddPairwiseI16x8U(node);
+    case IrOpcode::kI32x4TruncSatF64x2SZero:
+      return MarkAsSimd128(node), VisitI32x4TruncSatF64x2SZero(node);
+    case IrOpcode::kI32x4TruncSatF64x2UZero:
+      return MarkAsSimd128(node), VisitI32x4TruncSatF64x2UZero(node);
+    case IrOpcode::kI16x8Splat:
+      return MarkAsSimd128(node), VisitI16x8Splat(node);
+    case IrOpcode::kI16x8ExtractLaneU:
+      return MarkAsWord32(node), VisitI16x8ExtractLaneU(node);
+    case IrOpcode::kI16x8ExtractLaneS:
+      return MarkAsWord32(node), VisitI16x8ExtractLaneS(node);
+    case IrOpcode::kI16x8ReplaceLane:
+      return MarkAsSimd128(node), VisitI16x8ReplaceLane(node);
+    case IrOpcode::kI16x8SConvertI8x16Low:
+      return MarkAsSimd128(node), VisitI16x8SConvertI8x16Low(node);
+    case IrOpcode::kI16x8SConvertI8x16High:
+      return MarkAsSimd128(node), VisitI16x8SConvertI8x16High(node);
+    case IrOpcode::kI16x8Neg:
+      return MarkAsSimd128(node), VisitI16x8Neg(node);
+    case IrOpcode::kI16x8Shl:
+      return MarkAsSimd128(node), VisitI16x8Shl(node);
+    case IrOpcode::kI16x8ShrS:
+      return MarkAsSimd128(node), VisitI16x8ShrS(node);
+    case IrOpcode::kI16x8SConvertI32x4:
+      return MarkAsSimd128(node), VisitI16x8SConvertI32x4(node);
+    case IrOpcode::kI16x8Add:
+      return MarkAsSimd128(node), VisitI16x8Add(node);
+    case IrOpcode::kI16x8AddSatS:
+      return MarkAsSimd128(node), VisitI16x8AddSatS(node);
+    case IrOpcode::kI16x8Sub:
+      return MarkAsSimd128(node), VisitI16x8Sub(node);
+    case IrOpcode::kI16x8SubSatS:
+      return MarkAsSimd128(node), VisitI16x8SubSatS(node);
+    case IrOpcode::kI16x8Mul:
+      return MarkAsSimd128(node), VisitI16x8Mul(node);
+    case IrOpcode::kI16x8MinS:
+      return MarkAsSimd128(node), VisitI16x8MinS(node);
+    case IrOpcode::kI16x8MaxS:
+      return MarkAsSimd128(node), VisitI16x8MaxS(node);
+    case IrOpcode::kI16x8Eq:
+      return MarkAsSimd128(node), VisitI16x8Eq(node);
+    case IrOpcode::kI16x8Ne:
+      return MarkAsSimd128(node), VisitI16x8Ne(node);
+    case IrOpcode::kI16x8GtS:
+      return MarkAsSimd128(node), VisitI16x8GtS(node);
+    case IrOpcode::kI16x8GeS:
+      return MarkAsSimd128(node), VisitI16x8GeS(node);
+    case IrOpcode::kI16x8UConvertI8x16Low:
+      return MarkAsSimd128(node), VisitI16x8UConvertI8x16Low(node);
+    case IrOpcode::kI16x8UConvertI8x16High:
+      return MarkAsSimd128(node), VisitI16x8UConvertI8x16High(node);
+    case IrOpcode::kI16x8ShrU:
+      return MarkAsSimd128(node), VisitI16x8ShrU(node);
+    case IrOpcode::kI16x8UConvertI32x4:
+      return MarkAsSimd128(node), VisitI16x8UConvertI32x4(node);
+    case IrOpcode::kI16x8AddSatU:
+      return MarkAsSimd128(node), VisitI16x8AddSatU(node);
+    case IrOpcode::kI16x8SubSatU:
+      return MarkAsSimd128(node), VisitI16x8SubSatU(node);
+    case IrOpcode::kI16x8MinU:
+      return MarkAsSimd128(node), VisitI16x8MinU(node);
+    case IrOpcode::kI16x8MaxU:
+      return MarkAsSimd128(node), VisitI16x8MaxU(node);
+    case IrOpcode::kI16x8GtU:
+      return MarkAsSimd128(node), VisitI16x8GtU(node);
+    case IrOpcode::kI16x8GeU:
+      return MarkAsSimd128(node), VisitI16x8GeU(node);
+    case IrOpcode::kI16x8RoundingAverageU:
+      return MarkAsSimd128(node), VisitI16x8RoundingAverageU(node);
+    case IrOpcode::kI16x8Q15MulRSatS:
+      return MarkAsSimd128(node), VisitI16x8Q15MulRSatS(node);
+    case IrOpcode::kI16x8Abs:
+      return MarkAsSimd128(node), VisitI16x8Abs(node);
+    case IrOpcode::kI16x8BitMask:
+      return MarkAsWord32(node), VisitI16x8BitMask(node);
+    case IrOpcode::kI16x8ExtMulLowI8x16S:
+      return MarkAsSimd128(node), VisitI16x8ExtMulLowI8x16S(node);
+    case IrOpcode::kI16x8ExtMulHighI8x16S:
+      return MarkAsSimd128(node), VisitI16x8ExtMulHighI8x16S(node);
+    case IrOpcode::kI16x8ExtMulLowI8x16U:
+      return MarkAsSimd128(node), VisitI16x8ExtMulLowI8x16U(node);
+    case IrOpcode::kI16x8ExtMulHighI8x16U:
+      return MarkAsSimd128(node), VisitI16x8ExtMulHighI8x16U(node);
+    case IrOpcode::kI16x8ExtAddPairwiseI8x16S:
+      return MarkAsSimd128(node), VisitI16x8ExtAddPairwiseI8x16S(node);
+    case IrOpcode::kI16x8ExtAddPairwiseI8x16U:
+      return MarkAsSimd128(node), VisitI16x8ExtAddPairwiseI8x16U(node);
+    case IrOpcode::kI8x16Splat:
+      return MarkAsSimd128(node), VisitI8x16Splat(node);
+    case IrOpcode::kI8x16ExtractLaneU:
+      return MarkAsWord32(node), VisitI8x16ExtractLaneU(node);
+    case IrOpcode::kI8x16ExtractLaneS:
+      return MarkAsWord32(node), VisitI8x16ExtractLaneS(node);
+    case IrOpcode::kI8x16ReplaceLane:
+      return MarkAsSimd128(node), VisitI8x16ReplaceLane(node);
+    case IrOpcode::kI8x16Neg:
+      return MarkAsSimd128(node), VisitI8x16Neg(node);
+    case IrOpcode::kI8x16Shl:
+      return MarkAsSimd128(node), VisitI8x16Shl(node);
+    case IrOpcode::kI8x16ShrS:
+      return MarkAsSimd128(node), VisitI8x16ShrS(node);
+    case IrOpcode::kI8x16SConvertI16x8:
+      return MarkAsSimd128(node), VisitI8x16SConvertI16x8(node);
+    case IrOpcode::kI8x16Add:
+      return MarkAsSimd128(node), VisitI8x16Add(node);
+    case IrOpcode::kI8x16AddSatS:
+      return MarkAsSimd128(node), VisitI8x16AddSatS(node);
+    case IrOpcode::kI8x16Sub:
+      return MarkAsSimd128(node), VisitI8x16Sub(node);
+    case IrOpcode::kI8x16SubSatS:
+      return MarkAsSimd128(node), VisitI8x16SubSatS(node);
+    case IrOpcode::kI8x16MinS:
+      return MarkAsSimd128(node), VisitI8x16MinS(node);
+    case IrOpcode::kI8x16MaxS:
+      return MarkAsSimd128(node), VisitI8x16MaxS(node);
+    case IrOpcode::kI8x16Eq:
+      return MarkAsSimd128(node), VisitI8x16Eq(node);
+    case IrOpcode::kI8x16Ne:
+      return MarkAsSimd128(node), VisitI8x16Ne(node);
+    case IrOpcode::kI8x16GtS:
+      return MarkAsSimd128(node), VisitI8x16GtS(node);
+    case IrOpcode::kI8x16GeS:
+      return MarkAsSimd128(node), VisitI8x16GeS(node);
+    case IrOpcode::kI8x16ShrU:
+      return MarkAsSimd128(node), VisitI8x16ShrU(node);
+    case IrOpcode::kI8x16UConvertI16x8:
+      return MarkAsSimd128(node), VisitI8x16UConvertI16x8(node);
+    case IrOpcode::kI8x16AddSatU:
+      return MarkAsSimd128(node), VisitI8x16AddSatU(node);
+    case IrOpcode::kI8x16SubSatU:
+      return MarkAsSimd128(node), VisitI8x16SubSatU(node);
+    case IrOpcode::kI8x16MinU:
+      return MarkAsSimd128(node), VisitI8x16MinU(node);
+    case IrOpcode::kI8x16MaxU:
+      return MarkAsSimd128(node), VisitI8x16MaxU(node);
+    case IrOpcode::kI8x16GtU:
+      return MarkAsSimd128(node), VisitI8x16GtU(node);
+    case IrOpcode::kI8x16GeU:
+      return MarkAsSimd128(node), VisitI8x16GeU(node);
+    case IrOpcode::kI8x16RoundingAverageU:
+      return MarkAsSimd128(node), VisitI8x16RoundingAverageU(node);
+    case IrOpcode::kI8x16Popcnt:
+      return MarkAsSimd128(node), VisitI8x16Popcnt(node);
+    case IrOpcode::kI8x16Abs:
+      return MarkAsSimd128(node), VisitI8x16Abs(node);
+    case IrOpcode::kI8x16BitMask:
+      return MarkAsWord32(node), VisitI8x16BitMask(node);
+    case IrOpcode::kS128Const:
+      return MarkAsSimd128(node), VisitS128Const(node);
+    case IrOpcode::kS128Zero:
+      return MarkAsSimd128(node), VisitS128Zero(node);
+    case IrOpcode::kS128And:
+      return MarkAsSimd128(node), VisitS128And(node);
+    case IrOpcode::kS128Or:
+      return MarkAsSimd128(node), VisitS128Or(node);
+    case IrOpcode::kS128Xor:
+      return MarkAsSimd128(node), VisitS128Xor(node);
+    case IrOpcode::kS128Not:
+      return MarkAsSimd128(node), VisitS128Not(node);
+    case IrOpcode::kS128Select:
+      return MarkAsSimd128(node), VisitS128Select(node);
+    case IrOpcode::kS128AndNot:
+      return MarkAsSimd128(node), VisitS128AndNot(node);
+    case IrOpcode::kI8x16Swizzle:
+      return MarkAsSimd128(node), VisitI8x16Swizzle(node);
+    case IrOpcode::kI8x16Shuffle:
+      return MarkAsSimd128(node), VisitI8x16Shuffle(node);
+    case IrOpcode::kV128AnyTrue:
+      return MarkAsWord32(node), VisitV128AnyTrue(node);
+    case IrOpcode::kI64x2AllTrue:
+      return MarkAsWord32(node), VisitI64x2AllTrue(node);
+    case IrOpcode::kI32x4AllTrue:
+      return MarkAsWord32(node), VisitI32x4AllTrue(node);
+    case IrOpcode::kI16x8AllTrue:
+      return MarkAsWord32(node), VisitI16x8AllTrue(node);
+    case IrOpcode::kI8x16AllTrue:
+      return MarkAsWord32(node), VisitI8x16AllTrue(node);
+    case IrOpcode::kI8x16RelaxedLaneSelect:
+      return MarkAsSimd128(node), VisitI8x16RelaxedLaneSelect(node);
+    case IrOpcode::kI16x8RelaxedLaneSelect:
+      return MarkAsSimd128(node), VisitI16x8RelaxedLaneSelect(node);
+    case IrOpcode::kI32x4RelaxedLaneSelect:
+      return MarkAsSimd128(node), VisitI32x4RelaxedLaneSelect(node);
+    case IrOpcode::kI64x2RelaxedLaneSelect:
+      return MarkAsSimd128(node), VisitI64x2RelaxedLaneSelect(node);
+    case IrOpcode::kF32x4RelaxedMin:
+      return MarkAsSimd128(node), VisitF32x4RelaxedMin(node);
+    case IrOpcode::kF32x4RelaxedMax:
+      return MarkAsSimd128(node), VisitF32x4RelaxedMax(node);
+    case IrOpcode::kF64x2RelaxedMin:
+      return MarkAsSimd128(node), VisitF64x2RelaxedMin(node);
+    case IrOpcode::kF64x2RelaxedMax:
+      return MarkAsSimd128(node), VisitF64x2RelaxedMax(node);
+    case IrOpcode::kI32x4RelaxedTruncF64x2SZero:
+      return MarkAsSimd128(node), VisitI32x4RelaxedTruncF64x2SZero(node);
+    case IrOpcode::kI32x4RelaxedTruncF64x2UZero:
+      return MarkAsSimd128(node), VisitI32x4RelaxedTruncF64x2UZero(node);
+    case IrOpcode::kI32x4RelaxedTruncF32x4S:
+      return MarkAsSimd128(node), VisitI32x4RelaxedTruncF32x4S(node);
+    case IrOpcode::kI32x4RelaxedTruncF32x4U:
+      return MarkAsSimd128(node), VisitI32x4RelaxedTruncF32x4U(node);
+    case IrOpcode::kI16x8RelaxedQ15MulRS:
+      return MarkAsSimd128(node), VisitI16x8RelaxedQ15MulRS(node);
+    case IrOpcode::kI16x8DotI8x16I7x16S:
+      return MarkAsSimd128(node), VisitI16x8DotI8x16I7x16S(node);
+    case IrOpcode::kI32x4DotI8x16I7x16AddS:
+      return MarkAsSimd128(node), VisitI32x4DotI8x16I7x16AddS(node);
 
-  Node* const node = maybe_projection->InputAt(0);
-  if (schedule_->block(node) != current_block_) {
-    // The projection input is not in the current block, so it shouldn't be
-    // emitted now, so we don't need to eagerly schedule its Projection[0].
-    return;
+      // SIMD256
+#if V8_TARGET_ARCH_X64
+    case IrOpcode::kF64x4Min:
+      return MarkAsSimd256(node), VisitF64x4Min(node);
+    case IrOpcode::kF64x4Max:
+      return MarkAsSimd256(node), VisitF64x4Max(node);
+    case IrOpcode::kF64x4Add:
+      return MarkAsSimd256(node), VisitF64x4Add(node);
+    case IrOpcode::kF32x8Add:
+      return MarkAsSimd256(node), VisitF32x8Add(node);
+    case IrOpcode::kI64x4Add:
+      return MarkAsSimd256(node), VisitI64x4Add(node);
+    case IrOpcode::kI32x8Add:
+      return MarkAsSimd256(node), VisitI32x8Add(node);
+    case IrOpcode::kI16x16Add:
+      return MarkAsSimd256(node), VisitI16x16Add(node);
+    case IrOpcode::kI8x32Add:
+      return MarkAsSimd256(node), VisitI8x32Add(node);
+    case IrOpcode::kF64x4Sub:
+      return MarkAsSimd256(node), VisitF64x4Sub(node);
+    case IrOpcode::kF32x8Sub:
+      return MarkAsSimd256(node), VisitF32x8Sub(node);
+    case IrOpcode::kF32x8Min:
+      return MarkAsSimd256(node), VisitF32x8Min(node);
+    case IrOpcode::kF32x8Max:
+      return MarkAsSimd256(node), VisitF32x8Max(node);
+    case IrOpcode::kI64x4Ne:
+      return MarkAsSimd256(node), VisitI64x4Ne(node);
+    case IrOpcode::kI64x4GeS:
+      return MarkAsSimd256(node), VisitI64x4GeS(node);
+    case IrOpcode::kI32x8Ne:
+      return MarkAsSimd256(node), VisitI32x8Ne(node);
+    case IrOpcode::kI32x8GtU:
+      return MarkAsSimd256(node), VisitI32x8GtU(node);
+    case IrOpcode::kI32x8GeS:
+      return MarkAsSimd256(node), VisitI32x8GeS(node);
+    case IrOpcode::kI32x8GeU:
+      return MarkAsSimd256(node), VisitI32x8GeU(node);
+    case IrOpcode::kI16x16Ne:
+      return MarkAsSimd256(node), VisitI16x16Ne(node);
+    case IrOpcode::kI16x16GtU:
+      return MarkAsSimd256(node), VisitI16x16GtU(node);
+    case IrOpcode::kI16x16GeS:
+      return MarkAsSimd256(node), VisitI16x16GeS(node);
+    case IrOpcode::kI16x16GeU:
+      return MarkAsSimd256(node), VisitI16x16GeU(node);
+    case IrOpcode::kI8x32Ne:
+      return MarkAsSimd256(node), VisitI8x32Ne(node);
+    case IrOpcode::kI8x32GtU:
+      return MarkAsSimd256(node), VisitI8x32GtU(node);
+    case IrOpcode::kI8x32GeS:
+      return MarkAsSimd256(node), VisitI8x32GeS(node);
+    case IrOpcode::kI8x32GeU:
+      return MarkAsSimd256(node), VisitI8x32GeU(node);
+    case IrOpcode::kI64x4Sub:
+      return MarkAsSimd256(node), VisitI64x4Sub(node);
+    case IrOpcode::kI32x8Sub:
+      return MarkAsSimd256(node), VisitI32x8Sub(node);
+    case IrOpcode::kI16x16Sub:
+      return MarkAsSimd256(node), VisitI16x16Sub(node);
+    case IrOpcode::kI8x32Sub:
+      return MarkAsSimd256(node), VisitI8x32Sub(node);
+    case IrOpcode::kF64x4Mul:
+      return MarkAsSimd256(node), VisitF64x4Mul(node);
+    case IrOpcode::kF32x8Mul:
+      return MarkAsSimd256(node), VisitF32x8Mul(node);
+    case IrOpcode::kI64x4Mul:
+      return MarkAsSimd256(node), VisitI64x4Mul(node);
+    case IrOpcode::kI32x8Mul:
+      return MarkAsSimd256(node), VisitI32x8Mul(node);
+    case IrOpcode::kI16x16Mul:
+      return MarkAsSimd256(node), VisitI16x16Mul(node);
+    case IrOpcode::kF32x8Div:
+      return MarkAsSimd256(node), VisitF32x8Div(node);
+    case IrOpcode::kF64x4Div:
+      return MarkAsSimd256(node), VisitF64x4Div(node);
+    case IrOpcode::kI16x16AddSatS:
+      return MarkAsSimd256(node), VisitI16x16AddSatS(node);
+    case IrOpcode::kI8x32AddSatS:
+      return MarkAsSimd256(node), VisitI8x32AddSatS(node);
+    case IrOpcode::kI16x16AddSatU:
+      return MarkAsSimd256(node), VisitI16x16AddSatU(node);
+    case IrOpcode::kI8x32AddSatU:
+      return MarkAsSimd256(node), VisitI8x32AddSatU(node);
+    case IrOpcode::kI16x16SubSatS:
+      return MarkAsSimd256(node), VisitI16x16SubSatS(node);
+    case IrOpcode::kI8x32SubSatS:
+      return MarkAsSimd256(node), VisitI8x32SubSatS(node);
+    case IrOpcode::kI16x16SubSatU:
+      return MarkAsSimd256(node), VisitI16x16SubSatU(node);
+    case IrOpcode::kI8x32SubSatU:
+      return MarkAsSimd256(node), VisitI8x32SubSatU(node);
+    case IrOpcode::kI32x8UConvertF32x8:
+      return MarkAsSimd256(node), VisitI32x8UConvertF32x8(node);
+    case IrOpcode::kF64x4ConvertI32x4S:
+      return MarkAsSimd256(node), VisitF64x4ConvertI32x4S(node);
+    case IrOpcode::kF32x8SConvertI32x8:
+      return MarkAsSimd256(node), VisitF32x8SConvertI32x8(node);
+    case IrOpcode::kF32x8UConvertI32x8:
+      return MarkAsSimd256(node), VisitF32x8UConvertI32x8(node);
+    case IrOpcode::kF32x4DemoteF64x4:
+      return MarkAsSimd256(node), VisitF32x4DemoteF64x4(node);
+    case IrOpcode::kI64x4SConvertI32x4:
+      return MarkAsSimd256(node), VisitI64x4SConvertI32x4(node);
+    case IrOpcode::kI64x4UConvertI32x4:
+      return MarkAsSimd256(node), VisitI64x4UConvertI32x4(node);
+    case IrOpcode::kI32x8SConvertI16x8:
+      return MarkAsSimd256(node), VisitI32x8SConvertI16x8(node);
+    case IrOpcode::kI32x8UConvertI16x8:
+      return MarkAsSimd256(node), VisitI32x8UConvertI16x8(node);
+    case IrOpcode::kI16x16SConvertI8x16:
+      return MarkAsSimd256(node), VisitI16x16SConvertI8x16(node);
+    case IrOpcode::kI16x16UConvertI8x16:
+      return MarkAsSimd256(node), VisitI16x16UConvertI8x16(node);
+    case IrOpcode::kI16x16SConvertI32x8:
+      return MarkAsSimd256(node), VisitI16x16SConvertI32x8(node);
+    case IrOpcode::kI16x16UConvertI32x8:
+      return MarkAsSimd256(node), VisitI16x16UConvertI32x8(node);
+    case IrOpcode::kI8x32SConvertI16x16:
+      return MarkAsSimd256(node), VisitI8x32SConvertI16x16(node);
+    case IrOpcode::kI8x32UConvertI16x16:
+      return MarkAsSimd256(node), VisitI8x32UConvertI16x16(node);
+    case IrOpcode::kF32x8Abs:
+      return MarkAsSimd256(node), VisitF32x8Abs(node);
+    case IrOpcode::kF32x8Neg:
+      return MarkAsSimd256(node), VisitF32x8Neg(node);
+    case IrOpcode::kF32x8Sqrt:
+      return MarkAsSimd256(node), VisitF32x8Sqrt(node);
+    case IrOpcode::kF64x4Sqrt:
+      return MarkAsSimd256(node), VisitF64x4Sqrt(node);
+    case IrOpcode::kI32x8Abs:
+      return MarkAsSimd256(node), VisitI32x8Abs(node);
+    case IrOpcode::kI32x8Neg:
+      return MarkAsSimd256(node), VisitI32x8Neg(node);
+    case IrOpcode::kI16x16Abs:
+      return MarkAsSimd256(node), VisitI16x16Abs(node);
+    case IrOpcode::kI16x16Neg:
+      return MarkAsSimd256(node), VisitI16x16Neg(node);
+    case IrOpcode::kI8x32Abs:
+      return MarkAsSimd256(node), VisitI8x32Abs(node);
+    case IrOpcode::kI8x32Neg:
+      return MarkAsSimd256(node), VisitI8x32Neg(node);
+    case IrOpcode::kI64x4Shl:
+      return MarkAsSimd256(node), VisitI64x4Shl(node);
+    case IrOpcode::kI64x4ShrU:
+      return MarkAsSimd256(node), VisitI64x4ShrU(node);
+    case IrOpcode::kI32x8Shl:
+      return MarkAsSimd256(node), VisitI32x8Shl(node);
+    case IrOpcode::kI32x8ShrS:
+      return MarkAsSimd256(node), VisitI32x8ShrS(node);
+    case IrOpcode::kI32x8ShrU:
+      return MarkAsSimd256(node), VisitI32x8ShrU(node);
+    case IrOpcode::kI16x16Shl:
+      return MarkAsSimd256(node), VisitI16x16Shl(node);
+    case IrOpcode::kI16x16ShrS:
+      return MarkAsSimd256(node), VisitI16x16ShrS(node);
+    case IrOpcode::kI16x16ShrU:
+      return MarkAsSimd256(node), VisitI16x16ShrU(node);
+    case IrOpcode::kI32x8DotI16x16S:
+      return MarkAsSimd256(node), VisitI32x8DotI16x16S(node);
+    case IrOpcode::kI16x16RoundingAverageU:
+      return MarkAsSimd256(node), VisitI16x16RoundingAverageU(node);
+    case IrOpcode::kI8x32RoundingAverageU:
+      return MarkAsSimd256(node), VisitI8x32RoundingAverageU(node);
+    case IrOpcode::kS256Const:
+      return MarkAsSimd256(node), VisitS256Const(node);
+    case IrOpcode::kS256Zero:
+      return MarkAsSimd256(node), VisitS256Zero(node);
+    case IrOpcode::kS256And:
+      return MarkAsSimd256(node), VisitS256And(node);
+    case IrOpcode::kS256Or:
+      return MarkAsSimd256(node), VisitS256Or(node);
+    case IrOpcode::kS256Xor:
+      return MarkAsSimd256(node), VisitS256Xor(node);
+    case IrOpcode::kS256Not:
+      return MarkAsSimd256(node), VisitS256Not(node);
+    case IrOpcode::kS256Select:
+      return MarkAsSimd256(node), VisitS256Select(node);
+    case IrOpcode::kS256AndNot:
+      return MarkAsSimd256(node), VisitS256AndNot(node);
+    case IrOpcode::kF32x8Eq:
+      return MarkAsSimd256(node), VisitF32x8Eq(node);
+    case IrOpcode::kF64x4Eq:
+      return MarkAsSimd256(node), VisitF64x4Eq(node);
+    case IrOpcode::kI64x4Eq:
+      return MarkAsSimd256(node), VisitI64x4Eq(node);
+    case IrOpcode::kI32x8Eq:
+      return MarkAsSimd256(node), VisitI32x8Eq(node);
+    case IrOpcode::kI16x16Eq:
+      return MarkAsSimd256(node), VisitI16x16Eq(node);
+    case IrOpcode::kI8x32Eq:
+      return MarkAsSimd256(node), VisitI8x32Eq(node);
+    case IrOpcode::kF32x8Ne:
+      return MarkAsSimd256(node), VisitF32x8Ne(node);
+    case IrOpcode::kF64x4Ne:
+      return MarkAsSimd256(node), VisitF64x4Ne(node);
+    case IrOpcode::kI64x4GtS:
+      return MarkAsSimd256(node), VisitI64x4GtS(node);
+    case IrOpcode::kI32x8GtS:
+      return MarkAsSimd256(node), VisitI32x8GtS(node);
+    case IrOpcode::kI16x16GtS:
+      return MarkAsSimd256(node), VisitI16x16GtS(node);
+    case IrOpcode::kI8x32GtS:
+      return MarkAsSimd256(node), VisitI8x32GtS(node);
+    case IrOpcode::kF64x4Lt:
+      return MarkAsSimd256(node), VisitF64x4Lt(node);
+    case IrOpcode::kF32x8Lt:
+      return MarkAsSimd256(node), VisitF32x8Lt(node);
+    case IrOpcode::kF64x4Le:
+      return MarkAsSimd256(node), VisitF64x4Le(node);
+    case IrOpcode::kF32x8Le:
+      return MarkAsSimd256(node), VisitF32x8Le(node);
+    case IrOpcode::kI32x8MinS:
+      return MarkAsSimd256(node), VisitI32x8MinS(node);
+    case IrOpcode::kI16x16MinS:
+      return MarkAsSimd256(node), VisitI16x16MinS(node);
+    case IrOpcode::kI8x32MinS:
+      return MarkAsSimd256(node), VisitI8x32MinS(node);
+    case IrOpcode::kI32x8MinU:
+      return MarkAsSimd256(node), VisitI32x8MinU(node);
+    case IrOpcode::kI16x16MinU:
+      return MarkAsSimd256(node), VisitI16x16MinU(node);
+    case IrOpcode::kI8x32MinU:
+      return MarkAsSimd256(node), VisitI8x32MinU(node);
+    case IrOpcode::kI32x8MaxS:
+      return MarkAsSimd256(node), VisitI32x8MaxS(node);
+    case IrOpcode::kI16x16MaxS:
+      return MarkAsSimd256(node), VisitI16x16MaxS(node);
+    case IrOpcode::kI8x32MaxS:
+      return MarkAsSimd256(node), VisitI8x32MaxS(node);
+    case IrOpcode::kI32x8MaxU:
+      return MarkAsSimd256(node), VisitI32x8MaxU(node);
+    case IrOpcode::kI16x16MaxU:
+      return MarkAsSimd256(node), VisitI16x16MaxU(node);
+    case IrOpcode::kI8x32MaxU:
+      return MarkAsSimd256(node), VisitI8x32MaxU(node);
+    case IrOpcode::kI64x4Splat:
+      return MarkAsSimd256(node), VisitI64x4Splat(node);
+    case IrOpcode::kI32x8Splat:
+      return MarkAsSimd256(node), VisitI32x8Splat(node);
+    case IrOpcode::kI16x16Splat:
+      return MarkAsSimd256(node), VisitI16x16Splat(node);
+    case IrOpcode::kI8x32Splat:
+      return MarkAsSimd256(node), VisitI8x32Splat(node);
+    case IrOpcode::kI64x4ExtMulI32x4S:
+      return MarkAsSimd256(node), VisitI64x4ExtMulI32x4S(node);
+    case IrOpcode::kI64x4ExtMulI32x4U:
+      return MarkAsSimd256(node), VisitI64x4ExtMulI32x4U(node);
+    case IrOpcode::kI32x8ExtMulI16x8S:
+      return MarkAsSimd256(node), VisitI32x8ExtMulI16x8S(node);
+    case IrOpcode::kI32x8ExtMulI16x8U:
+      return MarkAsSimd256(node), VisitI32x8ExtMulI16x8U(node);
+    case IrOpcode::kI16x16ExtMulI8x16S:
+      return MarkAsSimd256(node), VisitI16x16ExtMulI8x16S(node);
+    case IrOpcode::kI16x16ExtMulI8x16U:
+      return MarkAsSimd256(node), VisitI16x16ExtMulI8x16U(node);
+    case IrOpcode::kI32x8ExtAddPairwiseI16x16S:
+      return MarkAsSimd256(node), VisitI32x8ExtAddPairwiseI16x16S(node);
+    case IrOpcode::kI32x8ExtAddPairwiseI16x16U:
+      return MarkAsSimd256(node), VisitI32x8ExtAddPairwiseI16x16U(node);
+    case IrOpcode::kI16x16ExtAddPairwiseI8x32S:
+      return MarkAsSimd256(node), VisitI16x16ExtAddPairwiseI8x32S(node);
+    case IrOpcode::kI16x16ExtAddPairwiseI8x32U:
+      return MarkAsSimd256(node), VisitI16x16ExtAddPairwiseI8x32U(node);
+    case IrOpcode::kF32x8Pmin:
+      return MarkAsSimd256(node), VisitF32x8Pmin(node);
+    case IrOpcode::kF32x8Pmax:
+      return MarkAsSimd256(node), VisitF32x8Pmax(node);
+    case IrOpcode::kF64x4Pmin:
+      return MarkAsSimd256(node), VisitF64x4Pmin(node);
+    case IrOpcode::kF64x4Pmax:
+      return MarkAsSimd256(node), VisitF64x4Pmax(node);
+    case IrOpcode::kI8x32Shuffle:
+      return MarkAsSimd256(node), VisitI8x32Shuffle(node);
+#endif  //  V8_TARGET_ARCH_X64
+    default:
+      FATAL("Unexpected operator #%d:%s @ node #%d", node->opcode(),
+            node->op()->mnemonic(), node->id());
   }
+}
 
-  switch (node->opcode()) {
-    case IrOpcode::kInt32AddWithOverflow:
-    case IrOpcode::kInt32SubWithOverflow:
-    case IrOpcode::kInt32MulWithOverflow:
-    case IrOpcode::kInt64AddWithOverflow:
-    case IrOpcode::kInt64SubWithOverflow:
-    case IrOpcode::kInt64MulWithOverflow: {
-      Node* result = NodeProperties::FindProjection(node, 0);
-      if (result == nullptr || IsDefined(result)) {
-        // No Projection(0), or it's already defined.
-        return;
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitNode(
+    turboshaft::OpIndex node) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  tick_counter_->TickAndMaybeEnterSafepoint();
+  const turboshaft::Operation& op = this->Get(node);
+  using Opcode = turboshaft::Opcode;
+  using Rep = turboshaft::RegisterRepresentation;
+  switch (op.opcode) {
+    case Opcode::kBranch:
+    case Opcode::kGoto:
+    case Opcode::kReturn:
+    case Opcode::kTailCall:
+    case Opcode::kUnreachable:
+    case Opcode::kDeoptimize:
+    case Opcode::kSwitch:
+    case Opcode::kCheckException:
+      // Those are already handled in VisitControl.
+      DCHECK(op.IsBlockTerminator());
+      break;
+    case Opcode::kParameter: {
+      // Parameters should always be scheduled to the first block.
+      DCHECK_EQ(this->rpo_number(this->block(schedule(), node)).ToInt(), 0);
+      MachineType type = linkage()->GetParameterType(
+          op.Cast<turboshaft::ParameterOp>().parameter_index);
+      MarkAsRepresentation(type.representation(), node);
+      return VisitParameter(node);
+    }
+    case Opcode::kChange: {
+      const turboshaft::ChangeOp& change = op.Cast<turboshaft::ChangeOp>();
+      MarkAsRepresentation(change.to.machine_representation(), node);
+      switch (change.kind) {
+        case ChangeOp::Kind::kFloatConversion:
+          if (change.from == Rep::Float64()) {
+            DCHECK_EQ(change.to, Rep::Float32());
+            return VisitTruncateFloat64ToFloat32(node);
+          } else {
+            DCHECK_EQ(change.from, Rep::Float32());
+            DCHECK_EQ(change.to, Rep::Float64());
+            return VisitChangeFloat32ToFloat64(node);
+          }
+        case ChangeOp::Kind::kSignedFloatTruncateOverflowToMin:
+        case ChangeOp::Kind::kUnsignedFloatTruncateOverflowToMin: {
+          using A = ChangeOp::Assumption;
+          bool is_signed =
+              change.kind == ChangeOp::Kind::kSignedFloatTruncateOverflowToMin;
+          switch (multi(change.from, change.to, is_signed, change.assumption)) {
+            case multi(Rep::Float32(), Rep::Word32(), true, A::kNoOverflow):
+            case multi(Rep::Float32(), Rep::Word32(), true, A::kNoAssumption):
+              return VisitTruncateFloat32ToInt32(node);
+            case multi(Rep::Float32(), Rep::Word32(), false, A::kNoOverflow):
+            case multi(Rep::Float32(), Rep::Word32(), false, A::kNoAssumption):
+              return VisitTruncateFloat32ToUint32(node);
+            case multi(Rep::Float64(), Rep::Word32(), true, A::kReversible):
+              return VisitChangeFloat64ToInt32(node);
+            case multi(Rep::Float64(), Rep::Word32(), false, A::kReversible):
+              return VisitChangeFloat64ToUint32(node);
+            case multi(Rep::Float64(), Rep::Word32(), true, A::kNoOverflow):
+              return VisitRoundFloat64ToInt32(node);
+            case multi(Rep::Float64(), Rep::Word64(), true, A::kReversible):
+              return VisitChangeFloat64ToInt64(node);
+            case multi(Rep::Float64(), Rep::Word64(), false, A::kReversible):
+              return VisitChangeFloat64ToUint64(node);
+            case multi(Rep::Float64(), Rep::Word64(), true, A::kNoOverflow):
+            case multi(Rep::Float64(), Rep::Word64(), true, A::kNoAssumption):
+              return VisitTruncateFloat64ToInt64(node);
+            default:
+              // Invalid combination.
+              UNREACHABLE();
+          }
+
+          UNREACHABLE();
+        }
+        case ChangeOp::Kind::kJSFloatTruncate:
+          DCHECK_EQ(change.from, Rep::Float64());
+          DCHECK_EQ(change.to, Rep::Word32());
+          return VisitTruncateFloat64ToWord32(node);
+        case ChangeOp::Kind::kSignedToFloat:
+          if (change.from == Rep::Word32()) {
+            if (change.to == Rep::Float32()) {
+              return VisitRoundInt32ToFloat32(node);
+            } else {
+              DCHECK_EQ(change.to, Rep::Float64());
+              DCHECK_EQ(change.assumption, ChangeOp::Assumption::kNoAssumption);
+              return VisitChangeInt32ToFloat64(node);
+            }
+          } else {
+            DCHECK_EQ(change.from, Rep::Word64());
+            if (change.to == Rep::Float32()) {
+              return VisitRoundInt64ToFloat32(node);
+            } else {
+              DCHECK_EQ(change.to, Rep::Float64());
+              if (change.assumption == ChangeOp::Assumption::kReversible) {
+                return VisitChangeInt64ToFloat64(node);
+              } else {
+                return VisitRoundInt64ToFloat64(node);
+              }
+            }
+          }
+          UNREACHABLE();
+        case ChangeOp::Kind::kUnsignedToFloat:
+          switch (multi(change.from, change.to)) {
+            case multi(Rep::Word32(), Rep::Float32()):
+              return VisitRoundUint32ToFloat32(node);
+            case multi(Rep::Word32(), Rep::Float64()):
+              return VisitChangeUint32ToFloat64(node);
+            case multi(Rep::Word64(), Rep::Float32()):
+              return VisitRoundUint64ToFloat32(node);
+            case multi(Rep::Word64(), Rep::Float64()):
+              return VisitRoundUint64ToFloat64(node);
+            default:
+              UNREACHABLE();
+          }
+        case ChangeOp::Kind::kExtractHighHalf:
+          DCHECK_EQ(change.from, Rep::Float64());
+          DCHECK_EQ(change.to, Rep::Word32());
+          return VisitFloat64ExtractHighWord32(node);
+        case ChangeOp::Kind::kExtractLowHalf:
+          DCHECK_EQ(change.from, Rep::Float64());
+          DCHECK_EQ(change.to, Rep::Word32());
+          return VisitFloat64ExtractLowWord32(node);
+        case ChangeOp::Kind::kZeroExtend:
+          DCHECK_EQ(change.from, Rep::Word32());
+          DCHECK_EQ(change.to, Rep::Word64());
+          return VisitChangeUint32ToUint64(node);
+        case ChangeOp::Kind::kSignExtend:
+          DCHECK_EQ(change.from, Rep::Word32());
+          DCHECK_EQ(change.to, Rep::Word64());
+          return VisitChangeInt32ToInt64(node);
+        case ChangeOp::Kind::kTruncate:
+          DCHECK_EQ(change.from, Rep::Word64());
+          DCHECK_EQ(change.to, Rep::Word32());
+          MarkAsWord32(node);
+          return VisitTruncateInt64ToInt32(node);
+        case ChangeOp::Kind::kBitcast:
+          switch (multi(change.from, change.to)) {
+            case multi(Rep::Word32(), Rep::Word64()):
+              return VisitBitcastWord32ToWord64(node);
+            case multi(Rep::Word32(), Rep::Float32()):
+              return VisitBitcastInt32ToFloat32(node);
+            case multi(Rep::Word64(), Rep::Float64()):
+              return VisitBitcastInt64ToFloat64(node);
+            case multi(Rep::Float32(), Rep::Word32()):
+              return VisitBitcastFloat32ToInt32(node);
+            case multi(Rep::Float64(), Rep::Word64()):
+              return VisitBitcastFloat64ToInt64(node);
+            default:
+              UNREACHABLE();
+          }
       }
-
-      if (schedule_->block(result) != current_block_) {
-        // {result} wasn't planned to be scheduled in {current_block_}. To avoid
-        // adding checks to see if it can still be scheduled now, we just bail
-        // out.
-        return;
+      UNREACHABLE();
+    }
+    case Opcode::kTryChange: {
+      const TryChangeOp& try_change = op.Cast<TryChangeOp>();
+      MarkAsRepresentation(try_change.to.machine_representation(), node);
+      DCHECK(try_change.kind ==
+                 TryChangeOp::Kind::kSignedFloatTruncateOverflowUndefined ||
+             try_change.kind ==
+                 TryChangeOp::Kind::kUnsignedFloatTruncateOverflowUndefined);
+      const bool is_signed =
+          try_change.kind ==
+          TryChangeOp::Kind::kSignedFloatTruncateOverflowUndefined;
+      switch (multi(try_change.from, try_change.to, is_signed)) {
+        case multi(Rep::Float64(), Rep::Word64(), true):
+          return VisitTryTruncateFloat64ToInt64(node);
+        case multi(Rep::Float64(), Rep::Word64(), false):
+          return VisitTryTruncateFloat64ToUint64(node);
+        case multi(Rep::Float64(), Rep::Word32(), true):
+          return VisitTryTruncateFloat64ToInt32(node);
+        case multi(Rep::Float64(), Rep::Word32(), false):
+          return VisitTryTruncateFloat64ToUint32(node);
+        case multi(Rep::Float32(), Rep::Word64(), true):
+          return VisitTryTruncateFloat32ToInt64(node);
+        case multi(Rep::Float32(), Rep::Word64(), false):
+          return VisitTryTruncateFloat32ToUint64(node);
+        default:
+          UNREACHABLE();
       }
-
-      // Checking if all uses of {result} that are in the current block have
-      // already been Defined.
-      // We also ignore Phi uses: if {result} is used in a Phi in the block in
-      // which it is defined, this means that this block is a loop header, and
-      // {result} back into it through the back edge. In this case, it's normal
-      // to schedule {result} before the Phi that uses it.
-      for (Node* use : result->uses()) {
-        if (IsUsed(use) && !IsDefined(use) &&
-            schedule_->block(use) == current_block_ &&
-            use->opcode() != IrOpcode::kPhi) {
-          return;
+      UNREACHABLE();
+    }
+    case Opcode::kConstant: {
+      const ConstantOp& constant = op.Cast<ConstantOp>();
+      switch (constant.kind) {
+        case ConstantOp::Kind::kWord32:
+        case ConstantOp::Kind::kWord64:
+        case ConstantOp::Kind::kTaggedIndex:
+        case ConstantOp::Kind::kExternal:
+          break;
+        case ConstantOp::Kind::kFloat32:
+          MarkAsFloat32(node);
+          break;
+        case ConstantOp::Kind::kFloat64:
+          MarkAsFloat64(node);
+          break;
+        case ConstantOp::Kind::kHeapObject:
+          MarkAsTagged(node);
+          break;
+        case ConstantOp::Kind::kCompressedHeapObject:
+          MarkAsCompressed(node);
+          break;
+        case ConstantOp::Kind::kNumber:
+          if (!IsSmiDouble(constant.number())) MarkAsTagged(node);
+          break;
+        case ConstantOp::Kind::kRelocatableWasmCall:
+        case ConstantOp::Kind::kRelocatableWasmStubCall:
+          UNIMPLEMENTED();
+      }
+      VisitConstant(node);
+      break;
+    }
+    case Opcode::kWordUnary: {
+      const WordUnaryOp& unop = op.Cast<WordUnaryOp>();
+      if (unop.rep == WordRepresentation::Word32()) {
+        MarkAsWord32(node);
+        switch (unop.kind) {
+          case WordUnaryOp::Kind::kReverseBytes:
+            return VisitWord32ReverseBytes(node);
+          case WordUnaryOp::Kind::kCountLeadingZeros:
+            return VisitWord32Clz(node);
+          case WordUnaryOp::Kind::kCountTrailingZeros:
+            return VisitWord32Ctz(node);
+          case WordUnaryOp::Kind::kPopCount:
+            return VisitWord32Popcnt(node);
+          case WordUnaryOp::Kind::kSignExtend8:
+            return VisitSignExtendWord8ToInt32(node);
+          case WordUnaryOp::Kind::kSignExtend16:
+            return VisitSignExtendWord16ToInt32(node);
+        }
+      } else {
+        DCHECK_EQ(unop.rep, WordRepresentation::Word64());
+        MarkAsWord64(node);
+        switch (unop.kind) {
+          case WordUnaryOp::Kind::kReverseBytes:
+            return VisitWord64ReverseBytes(node);
+          case WordUnaryOp::Kind::kCountLeadingZeros:
+            return VisitWord64Clz(node);
+          case WordUnaryOp::Kind::kCountTrailingZeros:
+            return VisitWord64Ctz(node);
+          case WordUnaryOp::Kind::kPopCount:
+            return VisitWord64Popcnt(node);
+          case WordUnaryOp::Kind::kSignExtend8:
+            return VisitSignExtendWord8ToInt64(node);
+          case WordUnaryOp::Kind::kSignExtend16:
+            return VisitSignExtendWord16ToInt64(node);
         }
       }
-
-      // Visiting the projection now. Note that this relies on the fact that
-      // VisitProjection doesn't Emit something: if it did, then we could be
-      // Emitting something after a Branch, which is invalid (Branch can only be
-      // at the end of a block, and the end of a block must always be a block
-      // terminator). (remember that we emit operation in reverse order, so
-      // because we are doing TryPrepareScheduleFirstProjection before actually
-      // emitting the Branch, it would be after in the final instruction
-      // sequence, not before)
-      VisitProjection(result);
+      UNREACHABLE();
+    }
+    case Opcode::kWordBinop: {
+      const WordBinopOp& binop = op.Cast<WordBinopOp>();
+      if (binop.rep == WordRepresentation::Word32()) {
+        MarkAsWord32(node);
+        switch (binop.kind) {
+          case WordBinopOp::Kind::kAdd:
+            return VisitInt32Add(node);
+          case WordBinopOp::Kind::kMul:
+            return VisitInt32Mul(node);
+          case WordBinopOp::Kind::kSignedMulOverflownBits:
+            return VisitInt32MulHigh(node);
+          case WordBinopOp::Kind::kUnsignedMulOverflownBits:
+            return VisitUint32MulHigh(node);
+          case WordBinopOp::Kind::kBitwiseAnd:
+            return VisitWord32And(node);
+          case WordBinopOp::Kind::kBitwiseOr:
+            return VisitWord32Or(node);
+          case WordBinopOp::Kind::kBitwiseXor:
+            return VisitWord32Xor(node);
+          case WordBinopOp::Kind::kSub:
+            return VisitInt32Sub(node);
+          case WordBinopOp::Kind::kSignedDiv:
+            return VisitInt32Div(node);
+          case WordBinopOp::Kind::kUnsignedDiv:
+            return VisitUint32Div(node);
+          case WordBinopOp::Kind::kSignedMod:
+            return VisitInt32Mod(node);
+          case WordBinopOp::Kind::kUnsignedMod:
+            return VisitUint32Mod(node);
+        }
+      } else {
+        DCHECK_EQ(binop.rep, WordRepresentation::Word64());
+        MarkAsWord64(node);
+        switch (binop.kind) {
+          case WordBinopOp::Kind::kAdd:
+            return VisitInt64Add(node);
+          case WordBinopOp::Kind::kMul:
+            return VisitInt64Mul(node);
+          case WordBinopOp::Kind::kSignedMulOverflownBits:
+            return VisitInt64MulHigh(node);
+          case WordBinopOp::Kind::kUnsignedMulOverflownBits:
+            return VisitUint64MulHigh(node);
+          case WordBinopOp::Kind::kBitwiseAnd:
+            return VisitWord64And(node);
+          case WordBinopOp::Kind::kBitwiseOr:
+            return VisitWord64Or(node);
+          case WordBinopOp::Kind::kBitwiseXor:
+            return VisitWord64Xor(node);
+          case WordBinopOp::Kind::kSub:
+            return VisitInt64Sub(node);
+          case WordBinopOp::Kind::kSignedDiv:
+            return VisitInt64Div(node);
+          case WordBinopOp::Kind::kUnsignedDiv:
+            return VisitUint64Div(node);
+          case WordBinopOp::Kind::kSignedMod:
+            return VisitInt64Mod(node);
+          case WordBinopOp::Kind::kUnsignedMod:
+            return VisitUint64Mod(node);
+        }
+      }
+      UNREACHABLE();
+    }
+    case Opcode::kFloatUnary: {
+      const auto& unop = op.Cast<FloatUnaryOp>();
+      if (unop.rep == Rep::Float32()) {
+        MarkAsFloat32(node);
+        switch (unop.kind) {
+          case FloatUnaryOp::Kind::kAbs:
+            return VisitFloat32Abs(node);
+          case FloatUnaryOp::Kind::kNegate:
+            return VisitFloat32Neg(node);
+          case FloatUnaryOp::Kind::kRoundDown:
+            return VisitFloat32RoundDown(node);
+          case FloatUnaryOp::Kind::kRoundUp:
+            return VisitFloat32RoundUp(node);
+          case FloatUnaryOp::Kind::kRoundToZero:
+            return VisitFloat32RoundTruncate(node);
+          case FloatUnaryOp::Kind::kRoundTiesEven:
+            return VisitFloat32RoundTiesEven(node);
+          case FloatUnaryOp::Kind::kSqrt:
+            return VisitFloat32Sqrt(node);
+          // Those operations are only supported on 64 bit.
+          case FloatUnaryOp::Kind::kSilenceNaN:
+          case FloatUnaryOp::Kind::kLog:
+          case FloatUnaryOp::Kind::kLog2:
+          case FloatUnaryOp::Kind::kLog10:
+          case FloatUnaryOp::Kind::kLog1p:
+          case FloatUnaryOp::Kind::kCbrt:
+          case FloatUnaryOp::Kind::kExp:
+          case FloatUnaryOp::Kind::kExpm1:
+          case FloatUnaryOp::Kind::kSin:
+          case FloatUnaryOp::Kind::kCos:
+          case FloatUnaryOp::Kind::kSinh:
+          case FloatUnaryOp::Kind::kCosh:
+          case FloatUnaryOp::Kind::kAcos:
+          case FloatUnaryOp::Kind::kAsin:
+          case FloatUnaryOp::Kind::kAsinh:
+          case FloatUnaryOp::Kind::kAcosh:
+          case FloatUnaryOp::Kind::kTan:
+          case FloatUnaryOp::Kind::kTanh:
+          case FloatUnaryOp::Kind::kAtan:
+          case FloatUnaryOp::Kind::kAtanh:
+            UNREACHABLE();
+        }
+      } else {
+        DCHECK_EQ(unop.rep, Rep::Float64());
+        MarkAsFloat64(node);
+        switch (unop.kind) {
+          case FloatUnaryOp::Kind::kAbs:
+            return VisitFloat64Abs(node);
+          case FloatUnaryOp::Kind::kNegate:
+            return VisitFloat64Neg(node);
+          case FloatUnaryOp::Kind::kSilenceNaN:
+            return VisitFloat64SilenceNaN(node);
+          case FloatUnaryOp::Kind::kRoundDown:
+            return VisitFloat64RoundDown(node);
+          case FloatUnaryOp::Kind::kRoundUp:
+            return VisitFloat64RoundUp(node);
+          case FloatUnaryOp::Kind::kRoundToZero:
+            return VisitFloat64RoundTruncate(node);
+          case FloatUnaryOp::Kind::kRoundTiesEven:
+            return VisitFloat64RoundTiesEven(node);
+          case FloatUnaryOp::Kind::kLog:
+            return VisitFloat64Log(node);
+          case FloatUnaryOp::Kind::kLog2:
+            return VisitFloat64Log2(node);
+          case FloatUnaryOp::Kind::kLog10:
+            return VisitFloat64Log10(node);
+          case FloatUnaryOp::Kind::kLog1p:
+            return VisitFloat64Log1p(node);
+          case FloatUnaryOp::Kind::kSqrt:
+            return VisitFloat64Sqrt(node);
+          case FloatUnaryOp::Kind::kCbrt:
+            return VisitFloat64Cbrt(node);
+          case FloatUnaryOp::Kind::kExp:
+            return VisitFloat64Exp(node);
+          case FloatUnaryOp::Kind::kExpm1:
+            return VisitFloat64Expm1(node);
+          case FloatUnaryOp::Kind::kSin:
+            return VisitFloat64Sin(node);
+          case FloatUnaryOp::Kind::kCos:
+            return VisitFloat64Cos(node);
+          case FloatUnaryOp::Kind::kSinh:
+            return VisitFloat64Sinh(node);
+          case FloatUnaryOp::Kind::kCosh:
+            return VisitFloat64Cosh(node);
+          case FloatUnaryOp::Kind::kAcos:
+            return VisitFloat64Acos(node);
+          case FloatUnaryOp::Kind::kAsin:
+            return VisitFloat64Asin(node);
+          case FloatUnaryOp::Kind::kAsinh:
+            return VisitFloat64Asinh(node);
+          case FloatUnaryOp::Kind::kAcosh:
+            return VisitFloat64Acosh(node);
+          case FloatUnaryOp::Kind::kTan:
+            return VisitFloat64Tan(node);
+          case FloatUnaryOp::Kind::kTanh:
+            return VisitFloat64Tanh(node);
+          case FloatUnaryOp::Kind::kAtan:
+            return VisitFloat64Atan(node);
+          case FloatUnaryOp::Kind::kAtanh:
+            return VisitFloat64Atanh(node);
+        }
+      }
+      UNREACHABLE();
+    }
+    case Opcode::kFloatBinop: {
+      const auto& binop = op.Cast<FloatBinopOp>();
+      if (binop.rep == Rep::Float32()) {
+        MarkAsFloat32(node);
+        switch (binop.kind) {
+          case FloatBinopOp::Kind::kAdd:
+            return VisitFloat32Add(node);
+          case FloatBinopOp::Kind::kSub:
+            return VisitFloat32Sub(node);
+          case FloatBinopOp::Kind::kMul:
+            return VisitFloat32Mul(node);
+          case FloatBinopOp::Kind::kDiv:
+            return VisitFloat32Div(node);
+          case FloatBinopOp::Kind::kMin:
+            return VisitFloat32Min(node);
+          case FloatBinopOp::Kind::kMax:
+            return VisitFloat32Max(node);
+          case FloatBinopOp::Kind::kMod:
+          case FloatBinopOp::Kind::kPower:
+          case FloatBinopOp::Kind::kAtan2:
+            UNREACHABLE();
+        }
+      } else {
+        DCHECK_EQ(binop.rep, Rep::Float64());
+        MarkAsFloat64(node);
+        switch (binop.kind) {
+          case FloatBinopOp::Kind::kAdd:
+            return VisitFloat64Add(node);
+          case FloatBinopOp::Kind::kSub:
+            return VisitFloat64Sub(node);
+          case FloatBinopOp::Kind::kMul:
+            return VisitFloat64Mul(node);
+          case FloatBinopOp::Kind::kDiv:
+            return VisitFloat64Div(node);
+          case FloatBinopOp::Kind::kMod:
+            return VisitFloat64Mod(node);
+          case FloatBinopOp::Kind::kMin:
+            return VisitFloat64Min(node);
+          case FloatBinopOp::Kind::kMax:
+            return VisitFloat64Max(node);
+          case FloatBinopOp::Kind::kPower:
+            return VisitFloat64Pow(node);
+          case FloatBinopOp::Kind::kAtan2:
+            return VisitFloat64Atan2(node);
+        }
+      }
+      UNREACHABLE();
+    }
+    case Opcode::kOverflowCheckedBinop: {
+      const auto& binop = op.Cast<OverflowCheckedBinopOp>();
+      if (binop.rep == WordRepresentation::Word32()) {
+        MarkAsWord32(node);
+        switch (binop.kind) {
+          case OverflowCheckedBinopOp::Kind::kSignedAdd:
+            return VisitInt32AddWithOverflow(node);
+          case OverflowCheckedBinopOp::Kind::kSignedMul:
+            return VisitInt32MulWithOverflow(node);
+          case OverflowCheckedBinopOp::Kind::kSignedSub:
+            return VisitInt32SubWithOverflow(node);
+        }
+      } else {
+        DCHECK_EQ(binop.rep, WordRepresentation::Word64());
+        MarkAsWord64(node);
+        switch (binop.kind) {
+          case OverflowCheckedBinopOp::Kind::kSignedAdd:
+            return VisitInt64AddWithOverflow(node);
+          case OverflowCheckedBinopOp::Kind::kSignedMul:
+            return VisitInt64MulWithOverflow(node);
+          case OverflowCheckedBinopOp::Kind::kSignedSub:
+            return VisitInt64SubWithOverflow(node);
+        }
+      }
+      UNREACHABLE();
+    }
+    case Opcode::kShift: {
+      const auto& shift = op.Cast<ShiftOp>();
+      if (shift.rep == RegisterRepresentation::Word32()) {
+        MarkAsWord32(node);
+        switch (shift.kind) {
+          case ShiftOp::Kind::kShiftRightArithmeticShiftOutZeros:
+          case ShiftOp::Kind::kShiftRightArithmetic:
+            return VisitWord32Sar(node);
+          case ShiftOp::Kind::kShiftRightLogical:
+            return VisitWord32Shr(node);
+          case ShiftOp::Kind::kShiftLeft:
+            return VisitWord32Shl(node);
+          case ShiftOp::Kind::kRotateRight:
+            return VisitWord32Ror(node);
+          case ShiftOp::Kind::kRotateLeft:
+            return VisitWord32Rol(node);
+        }
+      } else {
+        DCHECK_EQ(shift.rep, RegisterRepresentation::Word64());
+        MarkAsWord64(node);
+        switch (shift.kind) {
+          case ShiftOp::Kind::kShiftRightArithmeticShiftOutZeros:
+          case ShiftOp::Kind::kShiftRightArithmetic:
+            return VisitWord64Sar(node);
+          case ShiftOp::Kind::kShiftRightLogical:
+            return VisitWord64Shr(node);
+          case ShiftOp::Kind::kShiftLeft:
+            return VisitWord64Shl(node);
+          case ShiftOp::Kind::kRotateRight:
+            return VisitWord64Ror(node);
+          case ShiftOp::Kind::kRotateLeft:
+            return VisitWord64Rol(node);
+        }
+      }
+      UNREACHABLE();
+    }
+    case Opcode::kCall:
+      // Process the call at `DidntThrow`, when we know if exceptions are caught
+      // or not.
+      break;
+    case Opcode::kDidntThrow:
+      if (current_block_->begin() == node) {
+        DCHECK_EQ(current_block_->PredecessorCount(), 1);
+        DCHECK(current_block_->LastPredecessor()
+                   ->LastOperation(*this->turboshaft_graph())
+                   .Is<CheckExceptionOp>());
+        // In this case, the Call has been generated at the `CheckException`
+        // already.
+      } else {
+        VisitCall(op.Cast<DidntThrowOp>().throwing_operation());
+      }
+      EmitIdentity(node);
+      break;
+    case Opcode::kFrameConstant: {
+      const auto& constant = op.Cast<turboshaft::FrameConstantOp>();
+      using Kind = turboshaft::FrameConstantOp::Kind;
+      OperandGenerator g(this);
+      switch (constant.kind) {
+        case Kind::kStackCheckOffset:
+          Emit(kArchStackCheckOffset, g.DefineAsRegister(node));
+          break;
+        case Kind::kFramePointer:
+          Emit(kArchFramePointer, g.DefineAsRegister(node));
+          break;
+        case Kind::kParentFramePointer:
+          Emit(kArchParentFramePointer, g.DefineAsRegister(node));
+          break;
+      }
+      break;
+    }
+    case Opcode::kStackPointerGreaterThan:
+      return VisitStackPointerGreaterThan(node);
+    case Opcode::kEqual: {
+      const turboshaft::EqualOp& equal = op.Cast<turboshaft::EqualOp>();
+      switch (equal.rep.value()) {
+        case Rep::Word32():
+          return VisitWord32Equal(node);
+        case Rep::Word64():
+          return VisitWord64Equal(node);
+        case Rep::Float32():
+          return VisitFloat32Equal(node);
+        case Rep::Float64():
+          return VisitFloat64Equal(node);
+        case Rep::Tagged():
+          if constexpr (Is64() && !COMPRESS_POINTERS_BOOL) {
+            return VisitWord64Equal(node);
+          }
+          return VisitWord32Equal(node);
+        case Rep::Simd128():
+        case Rep::Compressed():
+          UNIMPLEMENTED();
+      }
+      UNREACHABLE();
+    }
+    case Opcode::kComparison: {
+      const ComparisonOp& comparison = op.Cast<ComparisonOp>();
+      using Kind = ComparisonOp::Kind;
+      switch (multi(comparison.kind, comparison.rep)) {
+        case multi(Kind::kSignedLessThan, Rep::Word32()):
+          return VisitInt32LessThan(node);
+        case multi(Kind::kSignedLessThan, Rep::Word64()):
+          return VisitInt64LessThan(node);
+        case multi(Kind::kSignedLessThan, Rep::Float32()):
+          return VisitFloat32LessThan(node);
+        case multi(Kind::kSignedLessThan, Rep::Float64()):
+          return VisitFloat64LessThan(node);
+        case multi(Kind::kSignedLessThanOrEqual, Rep::Word32()):
+          return VisitInt32LessThanOrEqual(node);
+        case multi(Kind::kSignedLessThanOrEqual, Rep::Word64()):
+          return VisitInt64LessThanOrEqual(node);
+        case multi(Kind::kSignedLessThanOrEqual, Rep::Float32()):
+          return VisitFloat32LessThanOrEqual(node);
+        case multi(Kind::kSignedLessThanOrEqual, Rep::Float64()):
+          return VisitFloat64LessThanOrEqual(node);
+        case multi(Kind::kUnsignedLessThan, Rep::Word32()):
+          return VisitUint32LessThan(node);
+        case multi(Kind::kUnsignedLessThan, Rep::Word64()):
+          return VisitUint64LessThan(node);
+        case multi(Kind::kUnsignedLessThanOrEqual, Rep::Word32()):
+          return VisitUint32LessThanOrEqual(node);
+        case multi(Kind::kUnsignedLessThanOrEqual, Rep::Word64()):
+          return VisitUint64LessThanOrEqual(node);
+        default:
+          UNREACHABLE();
+      }
+      UNREACHABLE();
+    }
+    case Opcode::kLoad: {
+      MachineRepresentation rep =
+          op.Cast<LoadOp>().loaded_rep.ToMachineType().representation();
+      MarkAsRepresentation(rep, node);
+      return VisitLoad(node);
+    }
+    case Opcode::kStore:
+      return VisitStore(node);
+    case Opcode::kTaggedBitcast: {
+      const TaggedBitcastOp& cast = op.Cast<TaggedBitcastOp>();
+      if (cast.from == RegisterRepresentation::Tagged() &&
+          cast.to == RegisterRepresentation::PointerSized()) {
+        MarkAsRepresentation(MachineType::PointerRepresentation(), node);
+        return VisitBitcastTaggedToWord(node);
+      } else if (cast.from.IsWord() &&
+                 cast.to == RegisterRepresentation::Tagged()) {
+        MarkAsTagged(node);
+        return VisitBitcastWordToTagged(node);
+      } else if (cast.from == RegisterRepresentation::Compressed() &&
+                 cast.to == RegisterRepresentation::Word32()) {
+        MarkAsRepresentation(MachineType::PointerRepresentation(), node);
+        return VisitBitcastTaggedToWord(node);
+      } else {
+        UNIMPLEMENTED();
+      }
+    }
+    case Opcode::kPhi:
+      MarkAsRepresentation(op.Cast<PhiOp>().rep, node);
+      return VisitPhi(node);
+    case Opcode::kProjection:
+      return VisitProjection(node);
+    case Opcode::kDeoptimizeIf:
+      if (Get(node).Cast<DeoptimizeIfOp>().negated) {
+        return VisitDeoptimizeUnless(node);
+      }
+      return VisitDeoptimizeIf(node);
+    case Opcode::kTrapIf: {
+      const TrapIfOp& trap_if = op.Cast<TrapIfOp>();
+      if (trap_if.negated) {
+        return VisitTrapUnless(node, trap_if.trap_id);
+      }
+      return VisitTrapIf(node, trap_if.trap_id);
+    }
+    case Opcode::kCatchBlockBegin:
+      MarkAsTagged(node);
+      return VisitIfException(node);
+    case Opcode::kRetain:
+      return VisitRetain(node);
+    case Opcode::kOsrValue:
+      MarkAsTagged(node);
+      return VisitOsrValue(node);
+    case Opcode::kStackSlot:
+      return VisitStackSlot(node);
+    case Opcode::kFrameState:
+      // FrameState is covered as part of calls.
+      UNREACHABLE();
+    case Opcode::kLoadRootRegister:
+      return VisitLoadRootRegister(node);
+    case Opcode::kAssumeMap:
+      // AssumeMap is used as a hint for optimization phases but does not
+      // produce any code.
       return;
+    case Opcode::kDebugBreak:
+      return VisitDebugBreak(node);
+    case Opcode::kSelect: {
+      const SelectOp& select = op.Cast<SelectOp>();
+      // If there is a Select, then it should only be one that is supported by
+      // the machine, and it should be meant to be implementation with cmove.
+      DCHECK_EQ(select.implem, SelectOp::Implementation::kCMove);
+      MarkAsRepresentation(select.rep, node);
+      return VisitSelect(node);
+    }
+    case Opcode::kWord32PairBinop: {
+      const Word32PairBinopOp& binop = op.Cast<Word32PairBinopOp>();
+      MarkAsWord32(node);
+      MarkPairProjectionsAsWord32(node);
+      switch (binop.kind) {
+        case Word32PairBinopOp::Kind::kAdd:
+          return VisitInt32PairAdd(node);
+        case Word32PairBinopOp::Kind::kSub:
+          return VisitInt32PairSub(node);
+        case Word32PairBinopOp::Kind::kMul:
+          return VisitInt32PairMul(node);
+        case Word32PairBinopOp::Kind::kShiftLeft:
+          return VisitWord32PairShl(node);
+        case Word32PairBinopOp::Kind::kShiftRightLogical:
+          return VisitWord32PairShr(node);
+        case Word32PairBinopOp::Kind::kShiftRightArithmetic:
+          return VisitWord32PairSar(node);
+      }
+      UNREACHABLE();
+    }
+    case Opcode::kBitcastWord32PairToFloat64:
+      return VisitBitcastWord32PairToFloat64(node);
+
+#define UNIMPLEMENTED_CASE(op) case Opcode::k##op:
+      TURBOSHAFT_WASM_OPERATION_LIST(UNIMPLEMENTED_CASE)
+      TURBOSHAFT_SIMD_OPERATION_LIST(UNIMPLEMENTED_CASE)
+#undef UNIMPLEMENTED_CASE
+    case Opcode::kAtomicWord32Pair:
+    case Opcode::kAtomicRMW: {
+      const std::string op_string = op.ToString();
+      PrintF("\033[31mNo ISEL support for: %s\033[m\n", op_string.c_str());
+      FATAL("Unexpected operation #%d:%s", node.id(), op_string.c_str());
     }
 
-    default:
-      return;
+#define UNREACHABLE_CASE(op) case Opcode::k##op:
+      TURBOSHAFT_SIMPLIFIED_OPERATION_LIST(UNREACHABLE_CASE)
+      TURBOSHAFT_OTHER_OPERATION_LIST(UNREACHABLE_CASE)
+      UNREACHABLE_CASE(PendingLoopPhi)
+      UNREACHABLE_CASE(Tuple)
+      UNREACHABLE();
+#undef UNREACHABLE_CASE
   }
 }
 
-void InstructionSelector::VisitDeoptimizeIf(Node* node) {
-  TryPrepareScheduleFirstProjection(node->InputAt(0));
-
-  DeoptimizeParameters p = DeoptimizeParametersOf(node->op());
-  FlagsContinuation cont = FlagsContinuation::ForDeoptimize(
-      kNotEqual, p.reason(), node->id(), p.feedback(),
-      FrameState{node->InputAt(1)});
-  VisitWordCompareZero(node, node->InputAt(0), &cont);
-}
-
-void InstructionSelector::VisitDeoptimizeUnless(Node* node) {
-  TryPrepareScheduleFirstProjection(node->InputAt(0));
-
-  DeoptimizeParameters p = DeoptimizeParametersOf(node->op());
-  FlagsContinuation cont = FlagsContinuation::ForDeoptimize(
-      kEqual, p.reason(), node->id(), p.feedback(),
-      FrameState{node->InputAt(1)});
-  VisitWordCompareZero(node, node->InputAt(0), &cont);
-}
-
-void InstructionSelector::VisitSelect(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSelect(kNotEqual, node,
-                                   node->InputAt(1), node->InputAt(2));
-  VisitWordCompareZero(node, node->InputAt(0), &cont);
-}
-
-void InstructionSelector::VisitTrapIf(Node* node, TrapId trap_id) {
-  FlagsContinuation cont = FlagsContinuation::ForTrap(kNotEqual, trap_id);
-  VisitWordCompareZero(node, node->InputAt(0), &cont);
-}
-
-void InstructionSelector::VisitTrapUnless(Node* node, TrapId trap_id) {
-  FlagsContinuation cont = FlagsContinuation::ForTrap(kEqual, trap_id);
-  VisitWordCompareZero(node, node->InputAt(0), &cont);
-}
-
-void InstructionSelector::EmitIdentity(Node* node) {
-  MarkAsUsed(node->InputAt(0));
-  MarkAsDefined(node);
-  SetRename(node, node->InputAt(0));
-}
-
-void InstructionSelector::VisitDeoptimize(DeoptimizeReason reason,
-                                          NodeId node_id,
-                                          FeedbackSource const& feedback,
-                                          FrameState frame_state) {
-  InstructionOperandVector args(instruction_zone());
-  AppendDeoptimizeArguments(&args, reason, node_id, feedback, frame_state);
-  Emit(kArchDeoptimize, 0, nullptr, args.size(), &args.front(), 0, nullptr);
-}
-
-void InstructionSelector::VisitThrow(Node* node) {
-  OperandGenerator g(this);
-  Emit(kArchThrowTerminator, g.NoOutput());
-}
-
-void InstructionSelector::VisitDebugBreak(Node* node) {
-  OperandGenerator g(this);
-  Emit(kArchDebugBreak, g.NoOutput());
-}
-
-void InstructionSelector::VisitUnreachable(Node* node) {
-  OperandGenerator g(this);
-  Emit(kArchDebugBreak, g.NoOutput());
-}
-
-void InstructionSelector::VisitStaticAssert(Node* node) {
-  Node* asserted = node->InputAt(0);
-  UnparkedScopeIfNeeded scope(broker_);
-  AllowHandleDereference allow_handle_dereference;
-  asserted->Print(4);
-  FATAL(
-      "Expected Turbofan static assert to hold, but got non-true input:\n  %s",
-      StaticAssertSourceOf(node->op()));
-}
-
-void InstructionSelector::VisitDeadValue(Node* node) {
-  OperandGenerator g(this);
-  MarkAsRepresentation(DeadValueRepresentationOf(node->op()), node);
-  Emit(kArchDebugBreak, g.DefineAsConstant(node));
-}
-
-void InstructionSelector::VisitComment(Node* node) {
-  OperandGenerator g(this);
-  InstructionOperand operand(g.UseImmediate(node));
-  Emit(kArchComment, 0, nullptr, 1, &operand);
-}
-
-void InstructionSelector::VisitRetain(Node* node) {
-  OperandGenerator g(this);
-  Emit(kArchNop, g.NoOutput(), g.UseAny(node->InputAt(0)));
-}
-
-bool InstructionSelector::CanProduceSignalingNaN(Node* node) {
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::CanProduceSignalingNaN(Node* node) {
   // TODO(jarin) Improve the heuristic here.
   if (node->opcode() == IrOpcode::kFloat64Add ||
       node->opcode() == IrOpcode::kFloat64Sub ||
@@ -3325,8 +4956,9 @@ bool InstructionSelector::CanProduceSignalingNaN(Node* node) {
 }
 
 #if V8_TARGET_ARCH_64_BIT
-bool InstructionSelector::ZeroExtendsWord32ToWord64(Node* node,
-                                                    int recursion_depth) {
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::ZeroExtendsWord32ToWord64(
+    node_t node, int recursion_depth) {
   // To compute whether a Node sets its upper 32 bits to zero, there are three
   // cases.
   // 1. Phi node, with a computed result already available in phi_states_:
@@ -3340,8 +4972,8 @@ bool InstructionSelector::ZeroExtendsWord32ToWord64(Node* node,
   // large functions.
   const int kMaxRecursionDepth = 100;
 
-  if (node->opcode() == IrOpcode::kPhi) {
-    Upper32BitsState current = phi_states_[node->id()];
+  if (this->IsPhi(node)) {
+    Upper32BitsState current = phi_states_[this->id(node)];
     if (current != Upper32BitsState::kNotYetChecked) {
       return current == Upper32BitsState::kUpperBitsGuaranteedZero;
     }
@@ -3355,13 +4987,13 @@ bool InstructionSelector::ZeroExtendsWord32ToWord64(Node* node,
     // Mark the current node so that we skip it if we recursively visit it
     // again. Or, said differently, we compute a largest fixed-point so we can
     // be optimistic when we hit cycles.
-    phi_states_[node->id()] = Upper32BitsState::kUpperBitsGuaranteedZero;
+    phi_states_[this->id(node)] = Upper32BitsState::kUpperBitsGuaranteedZero;
 
-    int input_count = node->op()->ValueInputCount();
+    int input_count = this->value_input_count(node);
     for (int i = 0; i < input_count; ++i) {
-      Node* input = NodeProperties::GetValueInput(node, i);
+      node_t input = this->input_at(node, i);
       if (!ZeroExtendsWord32ToWord64(input, recursion_depth + 1)) {
-        phi_states_[node->id()] = Upper32BitsState::kNoGuarantee;
+        phi_states_[this->id(node)] = Upper32BitsState::kNoGuarantee;
         return false;
       }
     }
@@ -3374,6 +5006,39 @@ bool InstructionSelector::ZeroExtendsWord32ToWord64(Node* node,
 
 namespace {
 
+FrameStateDescriptor* GetFrameStateDescriptorInternal(
+    Zone* zone, turboshaft::Graph* graph,
+    const turboshaft::FrameStateOp& state) {
+  const FrameStateInfo& state_info = state.data->frame_state_info;
+  int parameters = state_info.parameter_count();
+  int locals = state_info.local_count();
+  int stack = state_info.stack_count();
+
+  FrameStateDescriptor* outer_state = nullptr;
+  if (state.inlined) {
+    outer_state = GetFrameStateDescriptorInternal(
+        zone, graph,
+        graph->Get(state.parent_frame_state())
+            .template Cast<turboshaft::FrameStateOp>());
+  }
+
+#if V8_ENABLE_WEBASSEMBLY
+  if (state_info.type() == FrameStateType::kJSToWasmBuiltinContinuation) {
+    auto function_info = static_cast<const JSToWasmFrameStateFunctionInfo*>(
+        state_info.function_info());
+    return zone->New<JSToWasmFrameStateDescriptor>(
+        zone, state_info.type(), state_info.bailout_id(),
+        state_info.state_combine(), parameters, locals, stack,
+        state_info.shared_info(), outer_state, function_info->signature());
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
+
+  return zone->New<FrameStateDescriptor>(
+      zone, state_info.type(), state_info.bailout_id(),
+      state_info.state_combine(), parameters, locals, stack,
+      state_info.shared_info(), outer_state);
+}
+
 FrameStateDescriptor* GetFrameStateDescriptorInternal(Zone* zone,
                                                       FrameState state) {
   DCHECK_EQ(IrOpcode::kFrameState, state->opcode());
@@ -3408,37 +5073,36 @@ FrameStateDescriptor* GetFrameStateDescriptorInternal(Zone* zone,
 
 }  // namespace
 
-FrameStateDescriptor* InstructionSelector::GetFrameStateDescriptor(
-    FrameState state) {
-  auto* desc = GetFrameStateDescriptorInternal(instruction_zone(), state);
+template <>
+FrameStateDescriptor*
+InstructionSelectorT<TurboshaftAdapter>::GetFrameStateDescriptor(node_t node) {
+  const turboshaft::FrameStateOp& state =
+      this->turboshaft_graph()
+          ->Get(node)
+          .template Cast<turboshaft::FrameStateOp>();
+  auto* desc = GetFrameStateDescriptorInternal(instruction_zone(),
+                                               this->turboshaft_graph(), state);
   *max_unoptimized_frame_height_ =
       std::max(*max_unoptimized_frame_height_,
                desc->total_conservative_frame_size_in_bytes());
   return desc;
 }
 
-#if V8_ENABLE_WEBASSEMBLY
-void InstructionSelector::CanonicalizeShuffle(Node* node, uint8_t* shuffle,
-                                              bool* is_swizzle) {
-  // Get raw shuffle indices.
-  memcpy(shuffle, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
-  bool needs_swap;
-  bool inputs_equal = GetVirtualRegister(node->InputAt(0)) ==
-                      GetVirtualRegister(node->InputAt(1));
-  wasm::SimdShuffle::CanonicalizeShuffle(inputs_equal, shuffle, &needs_swap,
-                                         is_swizzle);
-  if (needs_swap) {
-    SwapShuffleInputs(node);
-  }
-  // Duplicate the first input; for some shuffles on some architectures, it's
-  // easiest to implement a swizzle as a shuffle so it might be used.
-  if (*is_swizzle) {
-    node->ReplaceInput(1, node->InputAt(0));
-  }
+template <>
+FrameStateDescriptor*
+InstructionSelectorT<TurbofanAdapter>::GetFrameStateDescriptor(node_t node) {
+  FrameState state{node};
+  auto* desc = GetFrameStateDescriptorInternal(instruction_zone(), state);
+  *max_unoptimized_frame_height_ =
+      std::max(*max_unoptimized_frame_height_,
+               desc->total_conservative_frame_size_in_bytes());
+  return desc;
 }
 
+#if V8_ENABLE_WEBASSEMBLY
 // static
-void InstructionSelector::SwapShuffleInputs(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::SwapShuffleInputs(Node* node) {
   Node* input0 = node->InputAt(0);
   Node* input1 = node->InputAt(1);
   node->ReplaceInput(0, input1);
@@ -3446,6 +5110,91 @@ void InstructionSelector::SwapShuffleInputs(Node* node) {
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
+template class InstructionSelectorT<TurbofanAdapter>;
+template class InstructionSelectorT<TurboshaftAdapter>;
+
+// static
+InstructionSelector InstructionSelector::ForTurbofan(
+    Zone* zone, size_t node_count, Linkage* linkage,
+    InstructionSequence* sequence, Schedule* schedule,
+    SourcePositionTable* source_positions, Frame* frame,
+    EnableSwitchJumpTable enable_switch_jump_table, TickCounter* tick_counter,
+    JSHeapBroker* broker, size_t* max_unoptimized_frame_height,
+    size_t* max_pushed_argument_count, SourcePositionMode source_position_mode,
+    Features features, EnableScheduling enable_scheduling,
+    EnableRootsRelativeAddressing enable_roots_relative_addressing,
+    EnableTraceTurboJson trace_turbo) {
+  return InstructionSelector(
+      new InstructionSelectorT<TurbofanAdapter>(
+          zone, node_count, linkage, sequence, schedule, source_positions,
+          frame, enable_switch_jump_table, tick_counter, broker,
+          max_unoptimized_frame_height, max_pushed_argument_count,
+          source_position_mode, features, enable_scheduling,
+          enable_roots_relative_addressing, trace_turbo),
+      nullptr);
+}
+
+InstructionSelector InstructionSelector::ForTurboshaft(
+    Zone* zone, size_t node_count, Linkage* linkage,
+    InstructionSequence* sequence, turboshaft::Graph* graph, Frame* frame,
+    EnableSwitchJumpTable enable_switch_jump_table, TickCounter* tick_counter,
+    JSHeapBroker* broker, size_t* max_unoptimized_frame_height,
+    size_t* max_pushed_argument_count, SourcePositionMode source_position_mode,
+    Features features, EnableScheduling enable_scheduling,
+    EnableRootsRelativeAddressing enable_roots_relative_addressing,
+    EnableTraceTurboJson trace_turbo) {
+  return InstructionSelector(
+      nullptr,
+      new InstructionSelectorT<TurboshaftAdapter>(
+          zone, node_count, linkage, sequence, graph,
+          &graph->source_positions(), frame, enable_switch_jump_table,
+          tick_counter, broker, max_unoptimized_frame_height,
+          max_pushed_argument_count, source_position_mode, features,
+          enable_scheduling, enable_roots_relative_addressing, trace_turbo));
+}
+
+InstructionSelector::InstructionSelector(
+    InstructionSelectorT<TurbofanAdapter>* turbofan_impl,
+    InstructionSelectorT<TurboshaftAdapter>* turboshaft_impl)
+    : turbofan_impl_(turbofan_impl), turboshaft_impl_(turboshaft_impl) {
+  DCHECK_NE(!turbofan_impl_, !turboshaft_impl_);
+}
+
+InstructionSelector::~InstructionSelector() {
+  DCHECK_NE(!turbofan_impl_, !turboshaft_impl_);
+  delete turbofan_impl_;
+  delete turboshaft_impl_;
+}
+
+#define DISPATCH_TO_IMPL(...)                    \
+  DCHECK_NE(!turbofan_impl_, !turboshaft_impl_); \
+  if (turbofan_impl_) {                          \
+    return turbofan_impl_->__VA_ARGS__;          \
+  } else {                                       \
+    return turboshaft_impl_->__VA_ARGS__;        \
+  }
+
+base::Optional<BailoutReason> InstructionSelector::SelectInstructions() {
+  DISPATCH_TO_IMPL(SelectInstructions())
+}
+
+bool InstructionSelector::IsSupported(CpuFeature feature) const {
+  DISPATCH_TO_IMPL(IsSupported(feature))
+}
+
+const ZoneVector<std::pair<int, int>>& InstructionSelector::instr_origins()
+    const {
+  DISPATCH_TO_IMPL(instr_origins())
+}
+
+const std::map<NodeId, int> InstructionSelector::GetVirtualRegistersForTesting()
+    const {
+  DISPATCH_TO_IMPL(GetVirtualRegistersForTesting());
+}
+
+#undef DISPATCH_TO_IMPL
+#undef VISIT_UNSUPPORTED_OP
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/instruction-selector.h b/deps/v8/src/compiler/backend/instruction-selector.h
index f6a333e864b322..3e94f1ad063fc2 100644
--- a/deps/v8/src/compiler/backend/instruction-selector.h
+++ b/deps/v8/src/compiler/backend/instruction-selector.h
@@ -8,13 +8,19 @@
 #include <map>
 
 #include "src/codegen/cpu-features.h"
+#include "src/codegen/machine-type.h"
 #include "src/compiler/backend/instruction-scheduler.h"
+#include "src/compiler/backend/instruction-selector-adapter.h"
 #include "src/compiler/backend/instruction.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/feedback-source.h"
 #include "src/compiler/linkage.h"
 #include "src/compiler/machine-operator.h"
+#include "src/compiler/node-matchers.h"
 #include "src/compiler/node.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/representations.h"
+#include "src/compiler/turboshaft/utils.h"
 #include "src/utils/bit-vector.h"
 #include "src/zone/zone-containers.h"
 
@@ -31,60 +37,157 @@ namespace compiler {
 
 // Forward declarations.
 class BasicBlock;
-struct CallBuffer;  // TODO(bmeurer): Remove this.
+template <typename Adapter>
+struct CallBufferT;  // TODO(bmeurer): Remove this.
+template <typename Adapter>
+class InstructionSelectorT;
 class Linkage;
-class OperandGenerator;
-class SwitchInfo;
-class StateObjectDeduplicator;
+template <typename Adapter>
+class OperandGeneratorT;
+template <typename Adapter>
+class SwitchInfoT;
+template <typename Adapter>
+struct CaseInfoT;
+class TurbofanStateObjectDeduplicator;
+class TurboshaftStateObjectDeduplicator;
+
+class V8_EXPORT_PRIVATE InstructionSelector final {
+ public:
+  enum SourcePositionMode { kCallSourcePositions, kAllSourcePositions };
+  enum EnableScheduling { kDisableScheduling, kEnableScheduling };
+  enum EnableRootsRelativeAddressing {
+    kDisableRootsRelativeAddressing,
+    kEnableRootsRelativeAddressing
+  };
+  enum EnableSwitchJumpTable {
+    kDisableSwitchJumpTable,
+    kEnableSwitchJumpTable
+  };
+  enum EnableTraceTurboJson { kDisableTraceTurboJson, kEnableTraceTurboJson };
+
+  class Features final {
+   public:
+    Features() : bits_(0) {}
+    explicit Features(unsigned bits) : bits_(bits) {}
+    explicit Features(CpuFeature f) : bits_(1u << f) {}
+    Features(CpuFeature f1, CpuFeature f2) : bits_((1u << f1) | (1u << f2)) {}
+
+    bool Contains(CpuFeature f) const { return (bits_ & (1u << f)); }
+
+   private:
+    unsigned bits_;
+  };
+
+  static InstructionSelector ForTurbofan(
+      Zone* zone, size_t node_count, Linkage* linkage,
+      InstructionSequence* sequence, Schedule* schedule,
+      SourcePositionTable* source_positions, Frame* frame,
+      EnableSwitchJumpTable enable_switch_jump_table, TickCounter* tick_counter,
+      JSHeapBroker* broker, size_t* max_unoptimized_frame_height,
+      size_t* max_pushed_argument_count,
+      SourcePositionMode source_position_mode = kCallSourcePositions,
+      Features features = SupportedFeatures(),
+      EnableScheduling enable_scheduling = v8_flags.turbo_instruction_scheduling
+                                               ? kEnableScheduling
+                                               : kDisableScheduling,
+      EnableRootsRelativeAddressing enable_roots_relative_addressing =
+          kDisableRootsRelativeAddressing,
+      EnableTraceTurboJson trace_turbo = kDisableTraceTurboJson);
+
+  static InstructionSelector ForTurboshaft(
+      Zone* zone, size_t node_count, Linkage* linkage,
+      InstructionSequence* sequence, turboshaft::Graph* schedule, Frame* frame,
+      EnableSwitchJumpTable enable_switch_jump_table, TickCounter* tick_counter,
+      JSHeapBroker* broker, size_t* max_unoptimized_frame_height,
+      size_t* max_pushed_argument_count,
+      SourcePositionMode source_position_mode = kCallSourcePositions,
+      Features features = SupportedFeatures(),
+      EnableScheduling enable_scheduling = v8_flags.turbo_instruction_scheduling
+                                               ? kEnableScheduling
+                                               : kDisableScheduling,
+      EnableRootsRelativeAddressing enable_roots_relative_addressing =
+          kDisableRootsRelativeAddressing,
+      EnableTraceTurboJson trace_turbo = kDisableTraceTurboJson);
+
+  ~InstructionSelector();
+
+  base::Optional<BailoutReason> SelectInstructions();
+
+  bool IsSupported(CpuFeature feature) const;
+
+  // Returns the features supported on the target platform.
+  static Features SupportedFeatures() {
+    return Features(CpuFeatures::SupportedFeatures());
+  }
+
+  const ZoneVector<std::pair<int, int>>& instr_origins() const;
+  const std::map<NodeId, int> GetVirtualRegistersForTesting() const;
+
+  static MachineOperatorBuilder::Flags SupportedMachineOperatorFlags();
+  static MachineOperatorBuilder::AlignmentRequirements AlignmentRequirements();
+
+ private:
+  InstructionSelector(InstructionSelectorT<TurbofanAdapter>* turbofan_impl,
+                      InstructionSelectorT<TurboshaftAdapter>* turboshaft_impl);
+  InstructionSelector(const InstructionSelector&) = delete;
+  InstructionSelector& operator=(const InstructionSelector&) = delete;
+
+  InstructionSelectorT<TurbofanAdapter>* turbofan_impl_;
+  InstructionSelectorT<TurboshaftAdapter>* turboshaft_impl_;
+};
 
 // The flags continuation is a way to combine a branch or a materialization
 // of a boolean value with an instruction that sets the flags register.
 // The whole instruction is treated as a unit by the register allocator, and
 // thus no spills or moves can be introduced between the flags-setting
 // instruction and the branch or set it should be combined with.
-class FlagsContinuation final {
+template <typename Adapter>
+class FlagsContinuationT final {
  public:
-  FlagsContinuation() : mode_(kFlags_none) {}
+  using block_t = typename Adapter::block_t;
+  using node_t = typename Adapter::node_t;
+  using id_t = typename Adapter::id_t;
+
+  FlagsContinuationT() : mode_(kFlags_none) {}
 
   // Creates a new flags continuation from the given condition and true/false
   // blocks.
-  static FlagsContinuation ForBranch(FlagsCondition condition,
-                                     BasicBlock* true_block,
-                                     BasicBlock* false_block) {
-    return FlagsContinuation(kFlags_branch, condition, true_block, false_block);
+  static FlagsContinuationT ForBranch(FlagsCondition condition,
+                                      block_t true_block, block_t false_block) {
+    return FlagsContinuationT(kFlags_branch, condition, true_block,
+                              false_block);
   }
 
   // Creates a new flags continuation for an eager deoptimization exit.
-  static FlagsContinuation ForDeoptimize(FlagsCondition condition,
-                                         DeoptimizeReason reason,
-                                         NodeId node_id,
-                                         FeedbackSource const& feedback,
-                                         FrameState frame_state) {
-    return FlagsContinuation(kFlags_deoptimize, condition, reason, node_id,
-                             feedback, frame_state);
-  }
-  static FlagsContinuation ForDeoptimizeForTesting(
-      FlagsCondition condition, DeoptimizeReason reason, NodeId node_id,
-      FeedbackSource const& feedback, Node* frame_state) {
+  static FlagsContinuationT ForDeoptimize(FlagsCondition condition,
+                                          DeoptimizeReason reason, id_t node_id,
+                                          FeedbackSource const& feedback,
+                                          node_t frame_state) {
+    return FlagsContinuationT(kFlags_deoptimize, condition, reason, node_id,
+                              feedback, frame_state);
+  }
+  static FlagsContinuationT ForDeoptimizeForTesting(
+      FlagsCondition condition, DeoptimizeReason reason, id_t node_id,
+      FeedbackSource const& feedback, node_t frame_state) {
     // test-instruction-scheduler.cc passes a dummy Node* as frame_state.
     // Contents don't matter as long as it's not nullptr.
-    return FlagsContinuation(kFlags_deoptimize, condition, reason, node_id,
-                             feedback, frame_state);
+    return FlagsContinuationT(kFlags_deoptimize, condition, reason, node_id,
+                              feedback, frame_state);
   }
 
   // Creates a new flags continuation for a boolean value.
-  static FlagsContinuation ForSet(FlagsCondition condition, Node* result) {
-    return FlagsContinuation(condition, result);
+  static FlagsContinuationT ForSet(FlagsCondition condition, node_t result) {
+    return FlagsContinuationT(condition, result);
   }
 
   // Creates a new flags continuation for a wasm trap.
-  static FlagsContinuation ForTrap(FlagsCondition condition, TrapId trap_id) {
-    return FlagsContinuation(condition, trap_id);
+  static FlagsContinuationT ForTrap(FlagsCondition condition, TrapId trap_id) {
+    return FlagsContinuationT(condition, trap_id);
   }
 
-  static FlagsContinuation ForSelect(FlagsCondition condition, Node* result,
-                                     Node* true_value, Node* false_value) {
-    return FlagsContinuation(condition, result, true_value, false_value);
+  static FlagsContinuationT ForSelect(FlagsCondition condition, node_t result,
+                                      node_t true_value, node_t false_value) {
+    return FlagsContinuationT(condition, result, true_value, false_value);
   }
 
   bool IsNone() const { return mode_ == kFlags_none; }
@@ -101,7 +204,7 @@ class FlagsContinuation final {
     DCHECK(IsDeoptimize());
     return reason_;
   }
-  NodeId node_id() const {
+  id_t node_id() const {
     DCHECK(IsDeoptimize());
     return node_id_;
   }
@@ -109,11 +212,11 @@ class FlagsContinuation final {
     DCHECK(IsDeoptimize());
     return feedback_;
   }
-  Node* frame_state() const {
+  node_t frame_state() const {
     DCHECK(IsDeoptimize());
     return frame_state_or_result_;
   }
-  Node* result() const {
+  node_t result() const {
     DCHECK(IsSet() || IsSelect());
     return frame_state_or_result_;
   }
@@ -121,19 +224,19 @@ class FlagsContinuation final {
     DCHECK(IsTrap());
     return trap_id_;
   }
-  BasicBlock* true_block() const {
+  block_t true_block() const {
     DCHECK(IsBranch());
     return true_block_;
   }
-  BasicBlock* false_block() const {
+  block_t false_block() const {
     DCHECK(IsBranch());
     return false_block_;
   }
-  Node* true_value() const {
+  node_t true_value() const {
     DCHECK(IsSelect());
     return true_value_;
   }
-  Node* false_value() const {
+  node_t false_value() const {
     DCHECK(IsSelect());
     return false_value_;
   }
@@ -186,8 +289,8 @@ class FlagsContinuation final {
   }
 
  private:
-  FlagsContinuation(FlagsMode mode, FlagsCondition condition,
-                    BasicBlock* true_block, BasicBlock* false_block)
+  FlagsContinuationT(FlagsMode mode, FlagsCondition condition,
+                     block_t true_block, block_t false_block)
       : mode_(mode),
         condition_(condition),
         true_block_(true_block),
@@ -197,9 +300,9 @@ class FlagsContinuation final {
     DCHECK_NOT_NULL(false_block);
   }
 
-  FlagsContinuation(FlagsMode mode, FlagsCondition condition,
-                    DeoptimizeReason reason, NodeId node_id,
-                    FeedbackSource const& feedback, Node* frame_state)
+  FlagsContinuationT(FlagsMode mode, FlagsCondition condition,
+                     DeoptimizeReason reason, id_t node_id,
+                     FeedbackSource const& feedback, node_t frame_state)
       : mode_(mode),
         condition_(condition),
         reason_(reason),
@@ -207,91 +310,99 @@ class FlagsContinuation final {
         feedback_(feedback),
         frame_state_or_result_(frame_state) {
     DCHECK(mode == kFlags_deoptimize);
-    DCHECK_NOT_NULL(frame_state);
+    DCHECK(Adapter::valid(frame_state));
   }
 
-  FlagsContinuation(FlagsCondition condition, Node* result)
+  FlagsContinuationT(FlagsCondition condition, node_t result)
       : mode_(kFlags_set),
         condition_(condition),
         frame_state_or_result_(result) {
-    DCHECK_NOT_NULL(result);
+    DCHECK(Adapter::valid(result));
   }
 
-  FlagsContinuation(FlagsCondition condition, TrapId trap_id)
+  FlagsContinuationT(FlagsCondition condition, TrapId trap_id)
       : mode_(kFlags_trap), condition_(condition), trap_id_(trap_id) {}
 
-  FlagsContinuation(FlagsCondition condition, Node* result, Node* true_value,
-                    Node* false_value)
+  FlagsContinuationT(FlagsCondition condition, node_t result, node_t true_value,
+                     node_t false_value)
       : mode_(kFlags_select),
         condition_(condition),
         frame_state_or_result_(result),
         true_value_(true_value),
         false_value_(false_value) {
-    DCHECK_NOT_NULL(result);
-    DCHECK_NOT_NULL(true_value);
-    DCHECK_NOT_NULL(false_value);
+    DCHECK(Adapter::valid(result));
+    DCHECK(Adapter::valid(true_value));
+    DCHECK(Adapter::valid(false_value));
   }
 
   FlagsMode const mode_;
   FlagsCondition condition_;
   DeoptimizeReason reason_;         // Only valid if mode_ == kFlags_deoptimize*
-  NodeId node_id_;                  // Only valid if mode_ == kFlags_deoptimize*
+  id_t node_id_;                    // Only valid if mode_ == kFlags_deoptimize*
   FeedbackSource feedback_;         // Only valid if mode_ == kFlags_deoptimize*
-  Node* frame_state_or_result_;     // Only valid if mode_ == kFlags_deoptimize*
+  node_t frame_state_or_result_;    // Only valid if mode_ == kFlags_deoptimize*
                                     // or mode_ == kFlags_set.
-  BasicBlock* true_block_;          // Only valid if mode_ == kFlags_branch*.
-  BasicBlock* false_block_;         // Only valid if mode_ == kFlags_branch*.
+  block_t true_block_;              // Only valid if mode_ == kFlags_branch*.
+  block_t false_block_;             // Only valid if mode_ == kFlags_branch*.
   TrapId trap_id_;                  // Only valid if mode_ == kFlags_trap.
-  Node* true_value_;                // Only valid if mode_ == kFlags_select.
-  Node* false_value_;               // Only valid if mode_ == kFlags_select.
+  node_t true_value_;               // Only valid if mode_ == kFlags_select.
+  node_t false_value_;              // Only valid if mode_ == kFlags_select.
 };
 
 // This struct connects nodes of parameters which are going to be pushed on the
 // call stack with their parameter index in the call descriptor of the callee.
-struct PushParameter {
-  PushParameter(Node* n = nullptr,
-                LinkageLocation l = LinkageLocation::ForAnyRegister())
+template <typename Adapter>
+struct PushParameterT {
+  using node_t = typename Adapter::node_t;
+  PushParameterT(node_t n = {},
+                 LinkageLocation l = LinkageLocation::ForAnyRegister())
       : node(n), location(l) {}
 
-  Node* node;
+  node_t node;
   LinkageLocation location;
 };
 
 enum class FrameStateInputKind { kAny, kStackSlot };
 
 // Instruction selection generates an InstructionSequence for a given Schedule.
-class V8_EXPORT_PRIVATE InstructionSelector final {
+template <typename Adapter>
+class InstructionSelectorT final : public Adapter {
  public:
-  // Forward declarations.
-  class Features;
-
-  enum SourcePositionMode { kCallSourcePositions, kAllSourcePositions };
-  enum EnableScheduling { kDisableScheduling, kEnableScheduling };
-  enum EnableRootsRelativeAddressing {
-    kDisableRootsRelativeAddressing,
-    kEnableRootsRelativeAddressing
-  };
-  enum EnableSwitchJumpTable {
-    kDisableSwitchJumpTable,
-    kEnableSwitchJumpTable
-  };
-  enum EnableTraceTurboJson { kDisableTraceTurboJson, kEnableTraceTurboJson };
-
-  InstructionSelector(
+  using OperandGenerator = OperandGeneratorT<Adapter>;
+  using PushParameter = PushParameterT<Adapter>;
+  using CallBuffer = CallBufferT<Adapter>;
+  using FlagsContinuation = FlagsContinuationT<Adapter>;
+  using SwitchInfo = SwitchInfoT<Adapter>;
+  using CaseInfo = CaseInfoT<Adapter>;
+
+  using schedule_t = typename Adapter::schedule_t;
+  using block_t = typename Adapter::block_t;
+  using block_range_t = typename Adapter::block_range_t;
+  using node_t = typename Adapter::node_t;
+  using id_t = typename Adapter::id_t;
+  using source_position_table_t = typename Adapter::source_position_table_t;
+
+  using Features = InstructionSelector::Features;
+
+  InstructionSelectorT(
       Zone* zone, size_t node_count, Linkage* linkage,
-      InstructionSequence* sequence, Schedule* schedule,
-      SourcePositionTable* source_positions, Frame* frame,
-      EnableSwitchJumpTable enable_switch_jump_table, TickCounter* tick_counter,
-      JSHeapBroker* broker, size_t* max_unoptimized_frame_height,
-      size_t* max_pushed_argument_count,
-      SourcePositionMode source_position_mode = kCallSourcePositions,
+      InstructionSequence* sequence, schedule_t schedule,
+      source_position_table_t* source_positions, Frame* frame,
+      InstructionSelector::EnableSwitchJumpTable enable_switch_jump_table,
+      TickCounter* tick_counter, JSHeapBroker* broker,
+      size_t* max_unoptimized_frame_height, size_t* max_pushed_argument_count,
+      InstructionSelector::SourcePositionMode source_position_mode =
+          InstructionSelector::kCallSourcePositions,
       Features features = SupportedFeatures(),
-      EnableScheduling enable_scheduling = v8_flags.turbo_instruction_scheduling
-                                               ? kEnableScheduling
-                                               : kDisableScheduling,
-      EnableRootsRelativeAddressing enable_roots_relative_addressing =
-          kDisableRootsRelativeAddressing,
-      EnableTraceTurboJson trace_turbo = kDisableTraceTurboJson);
+      InstructionSelector::EnableScheduling enable_scheduling =
+          v8_flags.turbo_instruction_scheduling
+              ? InstructionSelector::kEnableScheduling
+              : InstructionSelector::kDisableScheduling,
+      InstructionSelector::EnableRootsRelativeAddressing
+          enable_roots_relative_addressing =
+              InstructionSelector::kDisableRootsRelativeAddressing,
+      InstructionSelector::EnableTraceTurboJson trace_turbo =
+          InstructionSelector::kDisableTraceTurboJson);
 
   // Visit code for the entire graph with the included schedule.
   base::Optional<BailoutReason> SelectInstructions();
@@ -331,6 +442,12 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
                     InstructionOperand c, InstructionOperand d,
                     InstructionOperand e, InstructionOperand f,
                     size_t temp_count = 0, InstructionOperand* temps = nullptr);
+  Instruction* Emit(InstructionCode opcode, InstructionOperand output,
+                    InstructionOperand a, InstructionOperand b,
+                    InstructionOperand c, InstructionOperand d,
+                    InstructionOperand e, InstructionOperand f,
+                    InstructionOperand g, InstructionOperand h,
+                    size_t temp_count = 0, InstructionOperand* temps = nullptr);
   Instruction* Emit(InstructionCode opcode, size_t output_count,
                     InstructionOperand* outputs, size_t input_count,
                     InstructionOperand* inputs, size_t temp_count = 0,
@@ -361,25 +478,13 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
       size_t input_count, InstructionOperand* inputs, size_t temp_count,
       InstructionOperand* temps, FlagsContinuation* cont);
 
-  void EmitIdentity(Node* node);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, EmitIdentity)
+  void EmitIdentity(node_t node);
 
   // ===========================================================================
   // ============== Architecture-independent CPU feature methods. ==============
   // ===========================================================================
 
-  class Features final {
-   public:
-    Features() : bits_(0) {}
-    explicit Features(unsigned bits) : bits_(bits) {}
-    explicit Features(CpuFeature f) : bits_(1u << f) {}
-    Features(CpuFeature f1, CpuFeature f2) : bits_((1u << f1) | (1u << f2)) {}
-
-    bool Contains(CpuFeature f) const { return (bits_ & (1u << f)); }
-
-   private:
-    unsigned bits_;
-  };
-
   bool IsSupported(CpuFeature feature) const {
     return features_.Contains(feature);
   }
@@ -389,11 +494,6 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
     return Features(CpuFeatures::SupportedFeatures());
   }
 
-  // TODO(sigurds) This should take a CpuFeatures argument.
-  static MachineOperatorBuilder::Flags SupportedMachineOperatorFlags();
-
-  static MachineOperatorBuilder::AlignmentRequirements AlignmentRequirements();
-
   // ===========================================================================
   // ============ Architecture-independent graph covering methods. =============
   // ===========================================================================
@@ -406,7 +506,8 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   // For pure nodes, CanCover(a,b) is checked to avoid duplicated execution:
   // If this is not the case, code for b must still be generated for other
   // users, and fusing is unlikely to improve performance.
-  bool CanCover(Node* user, Node* node) const;
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(bool, CanCover)
+  bool CanCover(node_t user, node_t node) const;
 
   // Used in pattern matching during code generation.
   // This function checks that {node} and {user} are in the same basic block,
@@ -431,27 +532,32 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   // visiting Word32Compare, we would then have to select an instruction for
   // OtherOp *afterwards*, which means we would attempt to use the result of
   // the add before we have defined it.
-  bool IsOnlyUserOfNodeInSameBlock(Node* user, Node* node) const;
+  bool IsOnlyUserOfNodeInSameBlock(node_t user, node_t node) const;
 
   // Checks if {node} was already defined, and therefore code was already
   // generated for it.
-  bool IsDefined(Node* node) const;
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(bool, IsDefined)
+  bool IsDefined(node_t node) const;
 
   // Checks if {node} has any uses, and therefore code has to be generated for
   // it.
-  bool IsUsed(Node* node) const;
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(bool, IsUsed)
+  bool IsUsed(node_t node) const;
 
   // Checks if {node} is currently live.
-  bool IsLive(Node* node) const { return !IsDefined(node) && IsUsed(node); }
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(bool, IsLive)
+  bool IsLive(node_t node) const { return !IsDefined(node) && IsUsed(node); }
 
   // Gets the effect level of {node}.
-  int GetEffectLevel(Node* node) const;
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(int, GetEffectLevel)
+  int GetEffectLevel(node_t node) const;
 
   // Gets the effect level of {node}, appropriately adjusted based on
   // continuation flags if the node is a branch.
-  int GetEffectLevel(Node* node, FlagsContinuation* cont) const;
+  int GetEffectLevel(node_t node, FlagsContinuation* cont) const;
 
-  int GetVirtualRegister(const Node* node);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(int, GetVirtualRegister)
+  int GetVirtualRegister(node_t node);
   const std::map<NodeId, int> GetVirtualRegistersForTesting() const;
 
   // Check if we can generate loads and stores of ExternalConstants relative
@@ -468,17 +574,18 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   }
 
  private:
-  friend class OperandGenerator;
+  friend class OperandGeneratorT<Adapter>;
 
   bool UseInstructionScheduling() const {
-    return (enable_scheduling_ == kEnableScheduling) &&
+    return (enable_scheduling_ == InstructionSelector::kEnableScheduling) &&
            InstructionScheduler::SchedulerSupported();
   }
 
   void AppendDeoptimizeArguments(InstructionOperandVector* args,
-                                 DeoptimizeReason reason, NodeId node_id,
+                                 DeoptimizeReason reason, id_t node_id,
                                  FeedbackSource const& feedback,
-                                 FrameState frame_state);
+                                 node_t frame_state,
+                                 DeoptimizeKind kind = DeoptimizeKind::kEager);
 
   void EmitTableSwitch(const SwitchInfo& sw,
                        InstructionOperand const& index_operand);
@@ -487,45 +594,62 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
 
   void TryRename(InstructionOperand* op);
   int GetRename(int virtual_register);
-  void SetRename(const Node* node, const Node* rename);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, SetRename)
+  void SetRename(node_t node, node_t rename);
   void UpdateRenames(Instruction* instruction);
   void UpdateRenamesInPhi(PhiInstruction* phi);
 
   // Inform the instruction selection that {node} was just defined.
-  void MarkAsDefined(Node* node);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsDefined)
+  void MarkAsDefined(node_t node);
 
   // Inform the instruction selection that {node} has at least one use and we
   // will need to generate code for it.
-  void MarkAsUsed(Node* node);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsUsed)
+  void MarkAsUsed(node_t node);
 
   // Sets the effect level of {node}.
-  void SetEffectLevel(Node* node, int effect_level);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, SetEffectLevel)
+  void SetEffectLevel(node_t node, int effect_level);
 
   // Inform the register allocation of the representation of the value produced
   // by {node}.
-  void MarkAsRepresentation(MachineRepresentation rep, Node* node);
-  void MarkAsWord32(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsRepresentation)
+  void MarkAsRepresentation(MachineRepresentation rep, node_t node);
+  void MarkAsRepresentation(turboshaft::RegisterRepresentation rep,
+                            node_t node) {
+    MarkAsRepresentation(rep.machine_representation(), node);
+  }
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsWord32)
+  void MarkAsWord32(node_t node) {
     MarkAsRepresentation(MachineRepresentation::kWord32, node);
   }
-  void MarkAsWord64(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsWord64)
+  void MarkAsWord64(node_t node) {
     MarkAsRepresentation(MachineRepresentation::kWord64, node);
   }
-  void MarkAsFloat32(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsFloat32)
+  void MarkAsFloat32(node_t node) {
     MarkAsRepresentation(MachineRepresentation::kFloat32, node);
   }
-  void MarkAsFloat64(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsFloat64)
+  void MarkAsFloat64(node_t node) {
     MarkAsRepresentation(MachineRepresentation::kFloat64, node);
   }
-  void MarkAsSimd128(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsSimd128)
+  void MarkAsSimd128(node_t node) {
     MarkAsRepresentation(MachineRepresentation::kSimd128, node);
   }
-  void MarkAsSimd256(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsSimd256)
+  void MarkAsSimd256(node_t node) {
     MarkAsRepresentation(MachineRepresentation::kSimd256, node);
   }
-  void MarkAsTagged(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsTagged)
+  void MarkAsTagged(node_t node) {
     MarkAsRepresentation(MachineRepresentation::kTagged, node);
   }
-  void MarkAsCompressed(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, MarkAsCompressed)
+  void MarkAsCompressed(node_t node) {
     MarkAsRepresentation(MachineRepresentation::kCompressed, node);
   }
 
@@ -547,15 +671,19 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   // to the inputs and outputs of the call.
   // {call_code_immediate} to generate immediate operands to calls of code.
   // {call_address_immediate} to generate immediate operands to address calls.
-  void InitializeCallBuffer(Node* call, CallBuffer* buffer,
+  void InitializeCallBuffer(node_t call, CallBuffer* buffer,
                             CallBufferFlags flags, int stack_slot_delta = 0);
   bool IsTailCallAddressImmediate();
 
   void UpdateMaxPushedArgumentCount(size_t count);
 
-  FrameStateDescriptor* GetFrameStateDescriptor(FrameState node);
+  using StateObjectDeduplicator =
+      std::conditional_t<std::is_same_v<Adapter, TurboshaftAdapter>,
+                         TurboshaftStateObjectDeduplicator,
+                         TurbofanStateObjectDeduplicator>;
+  FrameStateDescriptor* GetFrameStateDescriptor(node_t node);
   size_t AddInputsToFrameStateDescriptor(FrameStateDescriptor* descriptor,
-                                         FrameState state, OperandGenerator* g,
+                                         node_t state, OperandGenerator* g,
                                          StateObjectDeduplicator* deduplicator,
                                          InstructionOperandVector* inputs,
                                          FrameStateInputKind kind, Zone* zone);
@@ -563,13 +691,13 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
                                          InstructionOperandVector* inputs,
                                          OperandGenerator* g,
                                          StateObjectDeduplicator* deduplicator,
-                                         Node* node, FrameStateInputKind kind,
+                                         node_t node, FrameStateInputKind kind,
                                          Zone* zone);
   size_t AddOperandToStateValueDescriptor(StateValueList* values,
                                           InstructionOperandVector* inputs,
                                           OperandGenerator* g,
                                           StateObjectDeduplicator* deduplicator,
-                                          Node* input, MachineType type,
+                                          node_t input, MachineType type,
                                           FrameStateInputKind kind, Zone* zone);
 
   // ===========================================================================
@@ -577,65 +705,287 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   // ===========================================================================
 
   // Visit nodes in the given block and generate code.
-  void VisitBlock(BasicBlock* block);
+  void VisitBlock(block_t block);
 
   // Visit the node for the control flow at the end of the block, generating
   // code if necessary.
-  void VisitControl(BasicBlock* block);
+  void VisitControl(block_t block);
 
   // Visit the node and generate code, if any.
-  void VisitNode(Node* node);
+  void VisitNode(node_t node);
 
   // Visit the node and generate code for IEEE 754 functions.
-  void VisitFloat64Ieee754Binop(Node*, InstructionCode code);
-  void VisitFloat64Ieee754Unop(Node*, InstructionCode code);
+  void VisitFloat64Ieee754Binop(node_t, InstructionCode code);
+  void VisitFloat64Ieee754Unop(node_t, InstructionCode code);
+
+  node_t FindProjection(node_t node, size_t projection_index);
+
+#define DECLARE_GENERATOR_T(x) void Visit##x(node_t node);
+  DECLARE_GENERATOR_T(Word32And)
+  DECLARE_GENERATOR_T(Word32Xor)
+  DECLARE_GENERATOR_T(Int32Add)
+  DECLARE_GENERATOR_T(Int32Sub)
+  DECLARE_GENERATOR_T(Int32Mul)
+  DECLARE_GENERATOR_T(Int32MulHigh)
+  DECLARE_GENERATOR_T(Int32Div)
+  DECLARE_GENERATOR_T(Int32Mod)
+  DECLARE_GENERATOR_T(Uint32Div)
+  DECLARE_GENERATOR_T(Uint32Mod)
+  DECLARE_GENERATOR_T(Uint32MulHigh)
+  DECLARE_GENERATOR_T(Word32Or)
+  DECLARE_GENERATOR_T(Word32Sar)
+  DECLARE_GENERATOR_T(Word32Shl)
+  DECLARE_GENERATOR_T(Word32Shr)
+  DECLARE_GENERATOR_T(Word32Rol)
+  DECLARE_GENERATOR_T(Word32Ror)
+  DECLARE_GENERATOR_T(Word64Shl)
+  DECLARE_GENERATOR_T(Word64Sar)
+  DECLARE_GENERATOR_T(Word64Shr)
+  DECLARE_GENERATOR_T(Word64Rol)
+  DECLARE_GENERATOR_T(Word64Ror)
+  DECLARE_GENERATOR_T(Int32AddWithOverflow)
+  DECLARE_GENERATOR_T(Int32MulWithOverflow)
+  DECLARE_GENERATOR_T(Int32SubWithOverflow)
+  DECLARE_GENERATOR_T(Int64AddWithOverflow)
+  DECLARE_GENERATOR_T(Int64SubWithOverflow)
+  DECLARE_GENERATOR_T(Int64MulWithOverflow)
+  DECLARE_GENERATOR_T(Int64Add)
+  DECLARE_GENERATOR_T(Word64And)
+  DECLARE_GENERATOR_T(Word64Or)
+  DECLARE_GENERATOR_T(Word64Xor)
+  DECLARE_GENERATOR_T(Int64Sub)
+  DECLARE_GENERATOR_T(Int64Mul)
+  DECLARE_GENERATOR_T(Int64MulHigh)
+  DECLARE_GENERATOR_T(Int64Div)
+  DECLARE_GENERATOR_T(Int64Mod)
+  DECLARE_GENERATOR_T(Uint64Div)
+  DECLARE_GENERATOR_T(Uint64Mod)
+  DECLARE_GENERATOR_T(Uint64MulHigh)
+  DECLARE_GENERATOR_T(Word32AtomicStore)
+  DECLARE_GENERATOR_T(Word64AtomicStore)
+  DECLARE_GENERATOR_T(Word32Equal)
+  DECLARE_GENERATOR_T(Word64Equal)
+  DECLARE_GENERATOR_T(Int32LessThan)
+  DECLARE_GENERATOR_T(Int32LessThanOrEqual)
+  DECLARE_GENERATOR_T(Int64LessThan)
+  DECLARE_GENERATOR_T(Int64LessThanOrEqual)
+  DECLARE_GENERATOR_T(Uint32LessThan)
+  DECLARE_GENERATOR_T(Uint32LessThanOrEqual)
+  DECLARE_GENERATOR_T(Uint64LessThan)
+  DECLARE_GENERATOR_T(Uint64LessThanOrEqual)
+  DECLARE_GENERATOR_T(Float64Sub)
+  DECLARE_GENERATOR_T(Float64Div)
+  DECLARE_GENERATOR_T(Float32Equal)
+  DECLARE_GENERATOR_T(Float32LessThan)
+  DECLARE_GENERATOR_T(Float32LessThanOrEqual)
+  DECLARE_GENERATOR_T(Float64Equal)
+  DECLARE_GENERATOR_T(Float64LessThan)
+  DECLARE_GENERATOR_T(Float64LessThanOrEqual)
+  DECLARE_GENERATOR_T(Load)
+  DECLARE_GENERATOR_T(StackPointerGreaterThan)
+  DECLARE_GENERATOR_T(Store)
+  DECLARE_GENERATOR_T(ProtectedStore)
+  DECLARE_GENERATOR_T(BitcastTaggedToWord)
+  DECLARE_GENERATOR_T(BitcastWordToTagged)
+  DECLARE_GENERATOR_T(ChangeInt32ToInt64)
+  DECLARE_GENERATOR_T(ChangeInt32ToFloat64)
+  DECLARE_GENERATOR_T(ChangeFloat32ToFloat64)
+  DECLARE_GENERATOR_T(RoundFloat64ToInt32)
+  DECLARE_GENERATOR_T(TruncateFloat64ToWord32)
+  DECLARE_GENERATOR_T(TruncateFloat64ToFloat32)
+  DECLARE_GENERATOR_T(TruncateFloat32ToInt32)
+  DECLARE_GENERATOR_T(TruncateFloat32ToUint32)
+  DECLARE_GENERATOR_T(ChangeFloat64ToInt32)
+  DECLARE_GENERATOR_T(ChangeFloat64ToUint32)
+  DECLARE_GENERATOR_T(ChangeFloat64ToInt64)
+  DECLARE_GENERATOR_T(ChangeFloat64ToUint64)
+  DECLARE_GENERATOR_T(TruncateFloat64ToInt64)
+  DECLARE_GENERATOR_T(RoundInt32ToFloat32)
+  DECLARE_GENERATOR_T(RoundInt64ToFloat32)
+  DECLARE_GENERATOR_T(RoundInt64ToFloat64)
+  DECLARE_GENERATOR_T(RoundUint32ToFloat32)
+  DECLARE_GENERATOR_T(RoundUint64ToFloat32)
+  DECLARE_GENERATOR_T(RoundUint64ToFloat64)
+  DECLARE_GENERATOR_T(ChangeInt64ToFloat64)
+  DECLARE_GENERATOR_T(ChangeUint32ToFloat64)
+  DECLARE_GENERATOR_T(ChangeUint32ToUint64)
+  DECLARE_GENERATOR_T(Float64ExtractLowWord32)
+  DECLARE_GENERATOR_T(Float64ExtractHighWord32)
+  DECLARE_GENERATOR_T(Float32Add)
+  DECLARE_GENERATOR_T(Float32Sub)
+  DECLARE_GENERATOR_T(Float32Mul)
+  DECLARE_GENERATOR_T(Float32Div)
+  DECLARE_GENERATOR_T(Float32Max)
+  DECLARE_GENERATOR_T(Float32Min)
+  DECLARE_GENERATOR_T(Float64Atan2)
+  DECLARE_GENERATOR_T(Float64Max)
+  DECLARE_GENERATOR_T(Float64Min)
+  DECLARE_GENERATOR_T(Float64Add)
+  DECLARE_GENERATOR_T(Float64Mul)
+  DECLARE_GENERATOR_T(Float64Mod)
+  DECLARE_GENERATOR_T(Float64Pow)
+  DECLARE_GENERATOR_T(BitcastWord32ToWord64)
+  DECLARE_GENERATOR_T(BitcastFloat32ToInt32)
+  DECLARE_GENERATOR_T(BitcastFloat64ToInt64)
+  DECLARE_GENERATOR_T(BitcastInt32ToFloat32)
+  DECLARE_GENERATOR_T(BitcastInt64ToFloat64)
+  DECLARE_GENERATOR_T(Float32Abs)
+  DECLARE_GENERATOR_T(Float32Neg)
+  DECLARE_GENERATOR_T(Float32RoundDown)
+  DECLARE_GENERATOR_T(Float32RoundTiesEven)
+  DECLARE_GENERATOR_T(Float32RoundTruncate)
+  DECLARE_GENERATOR_T(Float32RoundUp)
+  DECLARE_GENERATOR_T(Float32Sqrt)
+  DECLARE_GENERATOR_T(Float64Abs)
+  DECLARE_GENERATOR_T(Float64Acos)
+  DECLARE_GENERATOR_T(Float64Acosh)
+  DECLARE_GENERATOR_T(Float64Asin)
+  DECLARE_GENERATOR_T(Float64Asinh)
+  DECLARE_GENERATOR_T(Float64Atan)
+  DECLARE_GENERATOR_T(Float64Atanh)
+  DECLARE_GENERATOR_T(Float64Cbrt)
+  DECLARE_GENERATOR_T(Float64Cos)
+  DECLARE_GENERATOR_T(Float64Cosh)
+  DECLARE_GENERATOR_T(Float64Exp)
+  DECLARE_GENERATOR_T(Float64Expm1)
+  DECLARE_GENERATOR_T(Float64Log)
+  DECLARE_GENERATOR_T(Float64Log1p)
+  DECLARE_GENERATOR_T(Float64Log10)
+  DECLARE_GENERATOR_T(Float64Log2)
+  DECLARE_GENERATOR_T(Float64Neg)
+  DECLARE_GENERATOR_T(Float64RoundDown)
+  DECLARE_GENERATOR_T(Float64RoundTiesAway)
+  DECLARE_GENERATOR_T(Float64RoundTiesEven)
+  DECLARE_GENERATOR_T(Float64RoundTruncate)
+  DECLARE_GENERATOR_T(Float64RoundUp)
+  DECLARE_GENERATOR_T(Float64Sin)
+  DECLARE_GENERATOR_T(Float64Sinh)
+  DECLARE_GENERATOR_T(Float64Sqrt)
+  DECLARE_GENERATOR_T(Float64Tan)
+  DECLARE_GENERATOR_T(Float64Tanh)
+  DECLARE_GENERATOR_T(Float64SilenceNaN)
+  DECLARE_GENERATOR_T(Word32Clz)
+  DECLARE_GENERATOR_T(Word32Ctz)
+  DECLARE_GENERATOR_T(Word32ReverseBytes)
+  DECLARE_GENERATOR_T(Word32Popcnt)
+  DECLARE_GENERATOR_T(Word64Popcnt)
+  DECLARE_GENERATOR_T(Word64Clz)
+  DECLARE_GENERATOR_T(Word64Ctz)
+  DECLARE_GENERATOR_T(Word64ReverseBytes)
+  DECLARE_GENERATOR_T(SignExtendWord8ToInt32)
+  DECLARE_GENERATOR_T(SignExtendWord16ToInt32)
+  DECLARE_GENERATOR_T(SignExtendWord8ToInt64)
+  DECLARE_GENERATOR_T(SignExtendWord16ToInt64)
+  DECLARE_GENERATOR_T(TruncateInt64ToInt32)
+  DECLARE_GENERATOR_T(StackSlot)
+  DECLARE_GENERATOR_T(LoadRootRegister)
+  DECLARE_GENERATOR_T(DebugBreak)
+  DECLARE_GENERATOR_T(TryTruncateFloat32ToInt64)
+  DECLARE_GENERATOR_T(TryTruncateFloat64ToInt64)
+  DECLARE_GENERATOR_T(TryTruncateFloat32ToUint64)
+  DECLARE_GENERATOR_T(TryTruncateFloat64ToUint64)
+  DECLARE_GENERATOR_T(TryTruncateFloat64ToInt32)
+  DECLARE_GENERATOR_T(TryTruncateFloat64ToUint32)
+  DECLARE_GENERATOR_T(Int32PairAdd)
+  DECLARE_GENERATOR_T(Int32PairSub)
+  DECLARE_GENERATOR_T(Int32PairMul)
+  DECLARE_GENERATOR_T(Word32PairShl)
+  DECLARE_GENERATOR_T(Word32PairShr)
+  DECLARE_GENERATOR_T(Word32PairSar)
+  DECLARE_GENERATOR_T(Float64InsertLowWord32)
+  DECLARE_GENERATOR_T(Float64InsertHighWord32)
+  DECLARE_GENERATOR_T(Comment)
+  DECLARE_GENERATOR_T(Word32ReverseBits)
+  DECLARE_GENERATOR_T(Word64ReverseBits)
+  DECLARE_GENERATOR_T(AbortCSADcheck)
+  DECLARE_GENERATOR_T(StorePair)
+  DECLARE_GENERATOR_T(UnalignedLoad)
+  DECLARE_GENERATOR_T(UnalignedStore)
+  DECLARE_GENERATOR_T(Int32AbsWithOverflow)
+  DECLARE_GENERATOR_T(Int64AbsWithOverflow)
+  DECLARE_GENERATOR_T(TruncateFloat64ToUint32)
+  DECLARE_GENERATOR_T(SignExtendWord32ToInt64)
+  DECLARE_GENERATOR_T(TraceInstruction)
+  DECLARE_GENERATOR_T(MemoryBarrier)
+  DECLARE_GENERATOR_T(LoadStackCheckOffset)
+  DECLARE_GENERATOR_T(LoadFramePointer)
+  DECLARE_GENERATOR_T(LoadParentFramePointer)
+  DECLARE_GENERATOR_T(ProtectedLoad)
+#undef DECLARE_GENERATOR_T
 
 #define DECLARE_GENERATOR(x) void Visit##x(Node* node);
-  MACHINE_OP_LIST(DECLARE_GENERATOR)
+  DECLARE_GENERATOR(Word32AtomicLoad)
+  DECLARE_GENERATOR(Word32AtomicExchange)
+  DECLARE_GENERATOR(Word32AtomicCompareExchange)
+  DECLARE_GENERATOR(Word32AtomicAdd)
+  DECLARE_GENERATOR(Word32AtomicSub)
+  DECLARE_GENERATOR(Word32AtomicAnd)
+  DECLARE_GENERATOR(Word32AtomicOr)
+  DECLARE_GENERATOR(Word32AtomicXor)
+  DECLARE_GENERATOR(Word32AtomicPairLoad)
+  DECLARE_GENERATOR(Word32AtomicPairStore)
+  DECLARE_GENERATOR(Word32AtomicPairAdd)
+  DECLARE_GENERATOR(Word32AtomicPairSub)
+  DECLARE_GENERATOR(Word32AtomicPairAnd)
+  DECLARE_GENERATOR(Word32AtomicPairOr)
+  DECLARE_GENERATOR(Word32AtomicPairXor)
+  DECLARE_GENERATOR(Word32AtomicPairExchange)
+  DECLARE_GENERATOR(Word32AtomicPairCompareExchange)
+  DECLARE_GENERATOR(Word64AtomicLoad)
+  DECLARE_GENERATOR(Word64AtomicAdd)
+  DECLARE_GENERATOR(Word64AtomicSub)
+  DECLARE_GENERATOR(Word64AtomicAnd)
+  DECLARE_GENERATOR(Word64AtomicOr)
+  DECLARE_GENERATOR(Word64AtomicXor)
+  DECLARE_GENERATOR(Word64AtomicExchange)
+  DECLARE_GENERATOR(Word64AtomicCompareExchange)
+  DECLARE_GENERATOR(Simd128ReverseBytes)
   MACHINE_SIMD128_OP_LIST(DECLARE_GENERATOR)
   MACHINE_SIMD256_OP_LIST(DECLARE_GENERATOR)
 #undef DECLARE_GENERATOR
 
   // Visit the load node with a value and opcode to replace with.
-  void VisitLoad(Node* node, Node* value, InstructionCode opcode);
+  void VisitLoad(node_t node, node_t value, InstructionCode opcode);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void, VisitLoad)
   void VisitLoadTransform(Node* node, Node* value, InstructionCode opcode);
   void VisitFinishRegion(Node* node);
-  void VisitParameter(Node* node);
-  void VisitIfException(Node* node);
-  void VisitOsrValue(Node* node);
-  void VisitPhi(Node* node);
-  void VisitProjection(Node* node);
-  void VisitConstant(Node* node);
-  void VisitCall(Node* call, BasicBlock* handler = nullptr);
-  void VisitDeoptimizeIf(Node* node);
-  void VisitDeoptimizeUnless(Node* node);
+  void VisitParameter(node_t node);
+  void VisitIfException(node_t node);
+  void VisitOsrValue(node_t node);
+  void VisitPhi(node_t node);
+  void VisitProjection(node_t node);
+  void VisitConstant(node_t node);
+  void VisitCall(node_t call, block_t handler = {});
+  void VisitDeoptimizeIf(node_t node);
+  void VisitDeoptimizeUnless(node_t node);
   void VisitDynamicCheckMapsWithDeoptUnless(Node* node);
-  void VisitTrapIf(Node* node, TrapId trap_id);
-  void VisitTrapUnless(Node* node, TrapId trap_id);
-  void VisitTailCall(Node* call);
-  void VisitGoto(BasicBlock* target);
-  void VisitBranch(Node* input, BasicBlock* tbranch, BasicBlock* fbranch);
-  void VisitSwitch(Node* node, const SwitchInfo& sw);
-  void VisitDeoptimize(DeoptimizeReason reason, NodeId node_id,
-                       FeedbackSource const& feedback, FrameState frame_state);
-  void VisitSelect(Node* node);
-  void VisitReturn(Node* ret);
+  void VisitTrapIf(node_t node, TrapId trap_id);
+  void VisitTrapUnless(node_t node, TrapId trap_id);
+  void VisitTailCall(node_t call);
+  void VisitGoto(block_t target);
+  void VisitBranch(node_t input, block_t tbranch, block_t fbranch);
+  void VisitSwitch(node_t node, const SwitchInfo& sw);
+  void VisitDeoptimize(DeoptimizeReason reason, id_t node_id,
+                       FeedbackSource const& feedback, node_t frame_state);
+  void VisitSelect(node_t node);
+  void VisitReturn(node_t node);
   void VisitThrow(Node* node);
-  void VisitRetain(Node* node);
-  void VisitUnreachable(Node* node);
+  void VisitRetain(node_t node);
+  void VisitUnreachable(node_t node);
   void VisitStaticAssert(Node* node);
   void VisitDeadValue(Node* node);
+  void VisitBitcastWord32PairToFloat64(node_t node);
 
-  void TryPrepareScheduleFirstProjection(Node* maybe_projection);
+  void TryPrepareScheduleFirstProjection(node_t maybe_projection);
 
-  void VisitStackPointerGreaterThan(Node* node, FlagsContinuation* cont);
+  void VisitStackPointerGreaterThan(node_t node, FlagsContinuation* cont);
 
-  void VisitWordCompareZero(Node* user, Node* value, FlagsContinuation* cont);
+  void VisitWordCompareZero(node_t user, node_t value, FlagsContinuation* cont);
 
-  void EmitPrepareArguments(ZoneVector<compiler::PushParameter>* arguments,
-                            const CallDescriptor* call_descriptor, Node* node);
-  void EmitPrepareResults(ZoneVector<compiler::PushParameter>* results,
-                          const CallDescriptor* call_descriptor, Node* node);
+  void EmitPrepareArguments(ZoneVector<PushParameter>* arguments,
+                            const CallDescriptor* call_descriptor, node_t node);
+  void EmitPrepareResults(ZoneVector<PushParameter>* results,
+                          const CallDescriptor* call_descriptor, node_t node);
 
   // In LOONG64, calling convention uses free GP param register to pass
   // floating-point arguments when no FP param register is available. But
@@ -645,12 +995,12 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   // Moving floating-point param from GP param register to FPR to participate in
   // subsequent operations, whether CallCFunction or normal floating-point
   // operations.
-  void EmitMoveParamToFPR(Node* node, int index);
+  void EmitMoveParamToFPR(node_t node, int index);
 
   bool CanProduceSignalingNaN(Node* node);
 
   void AddOutputToSelectContinuation(OperandGenerator* g, int first_input_index,
-                                     Node* node);
+                                     node_t node);
 
   // ===========================================================================
   // ============= Vector instruction (SIMD) helper fns. =======================
@@ -659,7 +1009,34 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
 #if V8_ENABLE_WEBASSEMBLY
   // Canonicalize shuffles to make pattern matching simpler. Returns the shuffle
   // indices, and a boolean indicating if the shuffle is a swizzle (one input).
-  void CanonicalizeShuffle(Node* node, uint8_t* shuffle, bool* is_swizzle);
+  template <const int simd_size = kSimd128Size,
+            typename = std::enable_if_t<simd_size == kSimd128Size ||
+                                        simd_size == kSimd256Size>>
+  void CanonicalizeShuffle(Node* node, uint8_t* shuffle, bool* is_swizzle) {
+    // Get raw shuffle indices.
+    if constexpr (simd_size == kSimd128Size) {
+      memcpy(shuffle, S128ImmediateParameterOf(node->op()).data(),
+             kSimd128Size);
+    } else if constexpr (simd_size == kSimd256Size) {
+      memcpy(shuffle, S256ImmediateParameterOf(node->op()).data(),
+             kSimd256Size);
+    } else {
+      UNREACHABLE();
+    }
+    bool needs_swap;
+    bool inputs_equal = GetVirtualRegister(node->InputAt(0)) ==
+                        GetVirtualRegister(node->InputAt(1));
+    wasm::SimdShuffle::CanonicalizeShuffle<simd_size>(inputs_equal, shuffle,
+                                                      &needs_swap, is_swizzle);
+    if (needs_swap) {
+      SwapShuffleInputs(node);
+    }
+    // Duplicate the first input; for some shuffles on some architectures, it's
+    // easiest to implement a swizzle as a shuffle so it might be used.
+    if (*is_swizzle) {
+      node->ReplaceInput(1, node->InputAt(0));
+    }
+  }
 
   // Swaps the two first input operands of the node, to help match shuffles
   // to specific architectural instructions.
@@ -668,9 +1045,14 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
 
   // ===========================================================================
 
-  Schedule* schedule() const { return schedule_; }
+  schedule_t schedule() const { return schedule_; }
   Linkage* linkage() const { return linkage_; }
   InstructionSequence* sequence() const { return sequence_; }
+  base::Vector<const turboshaft::OpIndex> turboshaft_uses(
+      turboshaft::OpIndex node) const {
+    DCHECK(turboshaft_use_map_.has_value());
+    return turboshaft_use_map_->uses(node);
+  }
   Zone* instruction_zone() const { return sequence()->zone(); }
   Zone* zone() const { return zone_; }
 
@@ -679,14 +1061,18 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   }
   bool instruction_selection_failed() { return instruction_selection_failed_; }
 
-  void MarkPairProjectionsAsWord32(Node* node);
-  bool IsSourcePositionUsed(Node* node);
-  void VisitWord32AtomicBinaryOperation(Node* node, ArchOpcode int8_op,
+  void MarkPairProjectionsAsWord32(node_t node);
+  bool IsSourcePositionUsed(node_t node);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void,
+                                          VisitWord32AtomicBinaryOperation)
+  void VisitWord32AtomicBinaryOperation(node_t node, ArchOpcode int8_op,
                                         ArchOpcode uint8_op,
                                         ArchOpcode int16_op,
                                         ArchOpcode uint16_op,
                                         ArchOpcode word32_op);
-  void VisitWord64AtomicBinaryOperation(Node* node, ArchOpcode uint8_op,
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(void,
+                                          VisitWord64AtomicBinaryOperation)
+  void VisitWord64AtomicBinaryOperation(node_t node, ArchOpcode uint8_op,
                                         ArchOpcode uint16_op,
                                         ArchOpcode uint32_op,
                                         ArchOpcode uint64_op);
@@ -694,8 +1080,9 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
                                     ArchOpcode uint16_op, ArchOpcode uint32_op);
 
 #if V8_TARGET_ARCH_64_BIT
-  bool ZeroExtendsWord32ToWord64(Node* node, int recursion_depth = 0);
-  bool ZeroExtendsWord32ToWord64NoPhis(Node* node);
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(bool, ZeroExtendsWord32ToWord64)
+  bool ZeroExtendsWord32ToWord64(node_t node, int recursion_depth = 0);
+  bool ZeroExtendsWord32ToWord64NoPhis(node_t node);
 
   enum Upper32BitsState : uint8_t {
     kNotYetChecked,
@@ -705,10 +1092,10 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
 #endif  // V8_TARGET_ARCH_64_BIT
 
   struct FrameStateInput {
-    FrameStateInput(Node* node_, FrameStateInputKind kind_)
+    FrameStateInput(node_t node_, FrameStateInputKind kind_)
         : node(node_), kind(kind_) {}
 
-    Node* node;
+    node_t node;
     FrameStateInputKind kind;
 
     struct Hash {
@@ -734,11 +1121,11 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   Zone* const zone_;
   Linkage* const linkage_;
   InstructionSequence* const sequence_;
-  SourcePositionTable* const source_positions_;
-  SourcePositionMode const source_position_mode_;
+  source_position_table_t* const source_positions_;
+  InstructionSelector::SourcePositionMode const source_position_mode_;
   Features features_;
-  Schedule* const schedule_;
-  BasicBlock* current_block_;
+  schedule_t const schedule_;
+  block_t current_block_;
   ZoneVector<Instruction*> instructions_;
   InstructionOperandVector continuation_inputs_;
   InstructionOperandVector continuation_outputs_;
@@ -750,17 +1137,19 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   IntVector virtual_registers_;
   IntVector virtual_register_rename_;
   InstructionScheduler* scheduler_;
-  EnableScheduling enable_scheduling_;
-  EnableRootsRelativeAddressing enable_roots_relative_addressing_;
-  EnableSwitchJumpTable enable_switch_jump_table_;
-  ZoneUnorderedMap<FrameStateInput, CachedStateValues*, FrameStateInput::Hash,
-                   FrameStateInput::Equal>
+  InstructionSelector::EnableScheduling enable_scheduling_;
+  InstructionSelector::EnableRootsRelativeAddressing
+      enable_roots_relative_addressing_;
+  InstructionSelector::EnableSwitchJumpTable enable_switch_jump_table_;
+  ZoneUnorderedMap<FrameStateInput, CachedStateValues*,
+                   typename FrameStateInput::Hash,
+                   typename FrameStateInput::Equal>
       state_values_cache_;
 
   Frame* frame_;
   bool instruction_selection_failed_;
   ZoneVector<std::pair<int, int>> instr_origins_;
-  EnableTraceTurboJson trace_turbo_;
+  InstructionSelector::EnableTraceTurboJson trace_turbo_;
   TickCounter* const tick_counter_;
   // The broker is only used for unparking the LocalHeap for diagnostic printing
   // for failed StaticAsserts.
@@ -771,6 +1160,9 @@ class V8_EXPORT_PRIVATE InstructionSelector final {
   size_t* max_unoptimized_frame_height_;
   size_t* max_pushed_argument_count_;
 
+  // Turboshaft-adapter only.
+  base::Optional<turboshaft::UseMap> turboshaft_use_map_;
+
 #if V8_TARGET_ARCH_64_BIT
   // Holds lazily-computed results for whether phi nodes guarantee their upper
   // 32 bits to be zero. Indexed by node ID; nobody reads or writes the values
diff --git a/deps/v8/src/compiler/backend/instruction.cc b/deps/v8/src/compiler/backend/instruction.cc
index a1db78f2141ec7..d1041c41e21f41 100644
--- a/deps/v8/src/compiler/backend/instruction.cc
+++ b/deps/v8/src/compiler/backend/instruction.cc
@@ -7,15 +7,19 @@
 #include <cstddef>
 #include <iomanip>
 
+#include "src/base/iterator.h"
 #include "src/codegen/aligned-slot-allocator.h"
 #include "src/codegen/interface-descriptors.h"
 #include "src/codegen/machine-type.h"
 #include "src/codegen/register-configuration.h"
 #include "src/codegen/source-position.h"
 #include "src/compiler/common-operator.h"
+#include "src/compiler/frame-states.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/node.h"
 #include "src/compiler/schedule.h"
+#include "src/compiler/turboshaft/graph.h"
+#include "src/compiler/turboshaft/operations.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/execution/frames.h"
 #include "src/execution/isolate-utils-inl.h"
@@ -280,6 +284,9 @@ std::ostream& operator<<(std::ostream& os, const InstructionOperand& op) {
         case MachineRepresentation::kCompressed:
           os << "|c";
           break;
+        case MachineRepresentation::kIndirectPointer:
+          os << "|ip";
+          break;
         case MachineRepresentation::kSandboxedPointer:
           os << "|sb";
           break;
@@ -589,7 +596,7 @@ Handle<HeapObject> Constant::ToHeapObject() const {
 Handle<Code> Constant::ToCode() const {
   DCHECK_EQ(kHeapObject, type());
   Handle<Code> value(reinterpret_cast<Address*>(static_cast<intptr_t>(value_)));
-  DCHECK(value->IsCode(GetPtrComprCageBaseSlow(*value)));
+  DCHECK(IsCode(*value));
   return value;
 }
 
@@ -650,7 +657,8 @@ InstructionBlock::InstructionBlock(Zone* zone, RpoNumber rpo_number,
       loop_header_alignment_(false),
       needs_frame_(false),
       must_construct_frame_(false),
-      must_deconstruct_frame_(false) {}
+      must_deconstruct_frame_(false),
+      omitted_by_jump_threading_(false) {}
 
 size_t InstructionBlock::PredecessorIndexOf(RpoNumber rpo_number) const {
   size_t j = 0;
@@ -666,11 +674,25 @@ static RpoNumber GetRpo(const BasicBlock* block) {
   return RpoNumber::FromInt(block->rpo_number());
 }
 
+static RpoNumber GetRpo(const turboshaft::Block* block) {
+  if (block == nullptr) return RpoNumber::Invalid();
+  return RpoNumber::FromInt(block->index().id());
+}
+
 static RpoNumber GetLoopEndRpo(const BasicBlock* block) {
   if (!block->IsLoopHeader()) return RpoNumber::Invalid();
   return RpoNumber::FromInt(block->loop_end()->rpo_number());
 }
 
+static RpoNumber GetLoopEndRpo(const turboshaft::Block* block) {
+  if (!block->IsLoop()) return RpoNumber::Invalid();
+  // In Turbofan, the `block->loop_end()` refers to the first after (outside)
+  // the loop. In the relevant use cases, we retrieve the backedge block by
+  // subtracting one from the rpo_number, so for Turboshaft we "fake" this by
+  // adding 1 to the backedge block's rpo_number.
+  return RpoNumber::FromInt(GetRpo(block->LastPredecessor()).ToInt() + 1);
+}
+
 static InstructionBlock* InstructionBlockFor(Zone* zone,
                                              const BasicBlock* block) {
   bool is_handler =
@@ -694,6 +716,42 @@ static InstructionBlock* InstructionBlockFor(Zone* zone,
   return instr_block;
 }
 
+static InstructionBlock* InstructionBlockFor(Zone* zone,
+                                             const turboshaft::Graph& graph,
+                                             const turboshaft::Block* block) {
+  // TODO(nicohartmann@): Properly get the loop_header.
+  turboshaft::Block* loop_header = nullptr;  // block->loop_header()
+  bool is_handler =
+      block->FirstOperation(graph).Is<turboshaft::CatchBlockBeginOp>();
+  bool deferred = block->get_custom_data(
+      turboshaft::Block::CustomDataKind::kDeferredInSchedule);
+  InstructionBlock* instr_block = zone->New<InstructionBlock>(
+      zone, GetRpo(block), GetRpo(loop_header), GetLoopEndRpo(block),
+      GetRpo(block->GetDominator()), deferred, is_handler);
+  if (block->HasExactlyNPredecessors(1)) {
+    const turboshaft::Block* predecessor = block->LastPredecessor();
+    if (V8_UNLIKELY(
+            predecessor->LastOperation(graph).Is<turboshaft::SwitchOp>())) {
+      instr_block->set_switch_target(true);
+    }
+  }
+  // Map successors and predecessors.
+  base::SmallVector<turboshaft::Block*, 4> succs =
+      turboshaft::SuccessorBlocks(block->LastOperation(graph));
+  instr_block->successors().reserve(succs.size());
+  for (const turboshaft::Block* successor : succs) {
+    instr_block->successors().push_back(GetRpo(successor));
+  }
+  instr_block->predecessors().reserve(block->PredecessorCount());
+  for (const turboshaft::Block* predecessor = block->LastPredecessor();
+       predecessor; predecessor = predecessor->NeighboringPredecessor()) {
+    instr_block->predecessors().push_back(GetRpo(predecessor));
+  }
+  std::reverse(instr_block->predecessors().begin(),
+               instr_block->predecessors().end());
+  return instr_block;
+}
+
 std::ostream& operator<<(std::ostream& os,
                          const PrintableInstructionBlock& printable_block) {
   const InstructionBlock* block = printable_block.block_;
@@ -746,19 +804,34 @@ std::ostream& operator<<(std::ostream& os,
 
 InstructionBlocks* InstructionSequence::InstructionBlocksFor(
     Zone* zone, const Schedule* schedule) {
-  InstructionBlocks* blocks = zone->NewArray<InstructionBlocks>(1);
+  InstructionBlocks* blocks = zone->AllocateArray<InstructionBlocks>(1);
   new (blocks) InstructionBlocks(
       static_cast<int>(schedule->rpo_order()->size()), nullptr, zone);
   size_t rpo_number = 0;
   for (BasicBlockVector::const_iterator it = schedule->rpo_order()->begin();
        it != schedule->rpo_order()->end(); ++it, ++rpo_number) {
     DCHECK(!(*blocks)[rpo_number]);
-    DCHECK(GetRpo(*it).ToSize() == rpo_number);
+    DCHECK_EQ(GetRpo(*it).ToSize(), rpo_number);
     (*blocks)[rpo_number] = InstructionBlockFor(zone, *it);
   }
   return blocks;
 }
 
+InstructionBlocks* InstructionSequence::InstructionBlocksFor(
+    Zone* zone, const turboshaft::Graph& graph) {
+  InstructionBlocks* blocks = zone->AllocateArray<InstructionBlocks>(1);
+  new (blocks)
+      InstructionBlocks(static_cast<int>(graph.block_count()), nullptr, zone);
+  size_t rpo_number = 0;
+  for (const turboshaft::Block& block : graph.blocks()) {
+    DCHECK(!(*blocks)[rpo_number]);
+    DCHECK_EQ(RpoNumber::FromInt(block.index().id()).ToSize(), rpo_number);
+    (*blocks)[rpo_number] = InstructionBlockFor(zone, graph, &block);
+    ++rpo_number;
+  }
+  return blocks;
+}
+
 void InstructionSequence::ValidateEdgeSplitForm() const {
   // Validate blocks are in edge-split form: no block with multiple successors
   // has an edge to a block (== a successor) with more than one predecessors.
@@ -818,7 +891,7 @@ void InstructionSequence::ComputeAssemblyOrder() {
   int ao = 0;
   RpoNumber invalid = RpoNumber::Invalid();
 
-  ao_blocks_ = zone()->NewArray<InstructionBlocks>(1);
+  ao_blocks_ = zone()->AllocateArray<InstructionBlocks>(1);
   new (ao_blocks_) InstructionBlocks(zone());
   ao_blocks_->reserve(instruction_blocks_->size());
 
@@ -880,8 +953,8 @@ InstructionSequence::InstructionSequence(Isolate* isolate,
       instruction_blocks_(instruction_blocks),
       ao_blocks_(nullptr),
       source_positions_(zone()),
-      constants_(ConstantMap::key_compare(),
-                 ConstantMap::allocator_type(zone())),
+      // Avoid collisions for functions with 256 or less constant vregs.
+      constants_(zone(), 256),
       immediates_(zone()),
       rpo_immediates_(instruction_blocks->size(), zone()),
       instructions_(zone()),
@@ -936,11 +1009,6 @@ int InstructionSequence::AddInstruction(Instruction* instr) {
   return index;
 }
 
-InstructionBlock* InstructionSequence::GetInstructionBlock(
-    int instruction_index) const {
-  return instructions()[instruction_index]->block();
-}
-
 static MachineRepresentation FilterRepresentation(MachineRepresentation rep) {
   switch (rep) {
     case MachineRepresentation::kBit:
@@ -962,6 +1030,7 @@ static MachineRepresentation FilterRepresentation(MachineRepresentation rep) {
       return rep;
     case MachineRepresentation::kNone:
     case MachineRepresentation::kMapWord:
+    case MachineRepresentation::kIndirectPointer:
       break;
   }
 
@@ -1075,11 +1144,16 @@ size_t GetConservativeFrameSizeInBytes(FrameStateType type,
       // here.
       return UnoptimizedFrameInfo::GetStackSizeForAdditionalArguments(
           static_cast<int>(parameters_count));
-    case FrameStateType::kConstructStub: {
+#if V8_ENABLE_WEBASSEMBLY
+    case FrameStateType::kWasmInlinedIntoJS:
+#endif
+    case FrameStateType::kConstructCreateStub: {
       auto info = ConstructStubFrameInfo::Conservative(
           static_cast<int>(parameters_count));
       return info.frame_size_in_bytes();
     }
+    case FrameStateType::kConstructInvokeStub:
+      return FastConstructStubFrameInfo::Conservative().frame_size_in_bytes();
     case FrameStateType::kBuiltinContinuation:
 #if V8_ENABLE_WEBASSEMBLY
     case FrameStateType::kJSToWasmBuiltinContinuation:
@@ -1140,12 +1214,14 @@ size_t FrameStateDescriptor::GetHeight() const {
     case FrameStateType::kBuiltinContinuation:
 #if V8_ENABLE_WEBASSEMBLY
     case FrameStateType::kJSToWasmBuiltinContinuation:
+    case FrameStateType::kWasmInlinedIntoJS:
 #endif
       // Custom, non-JS calling convention (that does not have a notion of
       // a receiver or context).
       return parameters_count();
     case FrameStateType::kInlinedExtraArguments:
-    case FrameStateType::kConstructStub:
+    case FrameStateType::kConstructCreateStub:
+    case FrameStateType::kConstructInvokeStub:
     case FrameStateType::kJavaScriptBuiltinContinuation:
     case FrameStateType::kJavaScriptBuiltinContinuationWithCatch:
       // JS linkage. The parameters count
@@ -1159,8 +1235,8 @@ size_t FrameStateDescriptor::GetHeight() const {
 }
 
 size_t FrameStateDescriptor::GetSize() const {
-  return 1 + parameters_count() + locals_count() + stack_count() +
-         (HasContext() ? 1 : 0);
+  return (HasClosure() ? 1 : 0) + parameters_count() + locals_count() +
+         stack_count() + (HasContext() ? 1 : 0);
 }
 
 size_t FrameStateDescriptor::GetTotalSize() const {
@@ -1226,6 +1302,32 @@ std::ostream& operator<<(std::ostream& os, const InstructionSequence& code) {
   return os;
 }
 
+std::ostream& operator<<(std::ostream& os, StateValueKind kind) {
+  switch (kind) {
+    case StateValueKind::kArgumentsElements:
+      return os << "ArgumentsElements";
+    case StateValueKind::kArgumentsLength:
+      return os << "ArgumentsLength";
+    case StateValueKind::kPlain:
+      return os << "Plain";
+    case StateValueKind::kOptimizedOut:
+      return os << "OptimizedOut";
+    case StateValueKind::kNested:
+      return os << "Nested";
+    case StateValueKind::kDuplicate:
+      return os << "Duplicate";
+  }
+}
+
+void StateValueDescriptor::Print(std::ostream& os) const {
+  os << "kind=" << kind_ << ", type=" << type_;
+  if (kind_ == StateValueKind::kDuplicate || kind_ == StateValueKind::kNested) {
+    os << ", id=" << id_;
+  } else if (kind_ == StateValueKind::kArgumentsElements) {
+    os << ", args_type=" << args_type_;
+  }
+}
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/instruction.h b/deps/v8/src/compiler/backend/instruction.h
index cb889169c39f8d..80ead9333a9654 100644
--- a/deps/v8/src/compiler/backend/instruction.h
+++ b/deps/v8/src/compiler/backend/instruction.h
@@ -31,6 +31,10 @@ namespace compiler {
 class Schedule;
 class SourcePositionTable;
 
+namespace turboshaft {
+class Graph;
+}
+
 #if defined(V8_CC_MSVC) && defined(V8_TARGET_ARCH_IA32)
 // MSVC on x86 has issues with ALIGNAS(8) on InstructionOperand, but does
 // align the object to 8 bytes anyway (covered by a static assert below).
@@ -574,6 +578,7 @@ class LocationOperand : public InstructionOperand {
       case MachineRepresentation::kNone:
         return false;
       case MachineRepresentation::kMapWord:
+      case MachineRepresentation::kIndirectPointer:
         break;
     }
     UNREACHABLE();
@@ -1254,6 +1259,8 @@ enum class StateValueKind : uint8_t {
   kDuplicate
 };
 
+std::ostream& operator<<(std::ostream& os, StateValueKind kind);
+
 class StateValueDescriptor {
  public:
   StateValueDescriptor()
@@ -1310,6 +1317,8 @@ class StateValueDescriptor {
     return args_type_;
   }
 
+  void Print(std::ostream& os) const;
+
  private:
   StateValueDescriptor(StateValueKind kind, MachineType type)
       : kind_(kind), type_(type) {}
@@ -1449,13 +1458,20 @@ class FrameStateDescriptor : public ZoneObject {
   size_t stack_count() const { return stack_count_; }
   MaybeHandle<SharedFunctionInfo> shared_info() const { return shared_info_; }
   FrameStateDescriptor* outer_state() const { return outer_state_; }
+  bool HasClosure() const {
+    return type_ != FrameStateType::kConstructInvokeStub;
+  }
   bool HasContext() const {
     return FrameStateFunctionInfo::IsJSFunctionType(type_) ||
            type_ == FrameStateType::kBuiltinContinuation ||
 #if V8_ENABLE_WEBASSEMBLY
            type_ == FrameStateType::kJSToWasmBuiltinContinuation ||
+           // TODO(mliedtke): Should we skip the context for the FrameState of
+           // inlined wasm functions?
+           type_ == FrameStateType::kWasmInlinedIntoJS ||
 #endif  // V8_ENABLE_WEBASSEMBLY
-           type_ == FrameStateType::kConstructStub;
+           type_ == FrameStateType::kConstructCreateStub ||
+           type_ == FrameStateType::kConstructInvokeStub;
   }
 
   // The frame height on the stack, in number of slots, as serialized into a
@@ -1621,6 +1637,8 @@ class V8_EXPORT_PRIVATE InstructionBlock final
   inline bool IsLoopHeaderInAssemblyOrder() const {
     return loop_header_alignment_;
   }
+  bool omitted_by_jump_threading() const { return omitted_by_jump_threading_; }
+  void set_omitted_by_jump_threading() { omitted_by_jump_threading_ = true; }
 
   using Predecessors = ZoneVector<RpoNumber>;
   Predecessors& predecessors() { return predecessors_; }
@@ -1667,10 +1685,10 @@ class V8_EXPORT_PRIVATE InstructionBlock final
   const RpoNumber loop_header_;
   const RpoNumber loop_end_;
   RpoNumber dominator_;
-  int32_t code_start_;   // start index of arch-specific code.
-  int32_t code_end_ = -1;     // end index of arch-specific code.
-  const bool deferred_ : 1;   // Block contains deferred code.
-  bool handler_ : 1;          // Block is a handler entry point.
+  int32_t code_start_;       // start index of arch-specific code.
+  int32_t code_end_ = -1;    // end index of arch-specific code.
+  const bool deferred_ : 1;  // Block contains deferred code.
+  bool handler_ : 1;         // Block is a handler entry point.
   bool switch_target_ : 1;
   bool code_target_alignment_ : 1;  // insert code target alignment before this
                                     // block
@@ -1679,6 +1697,7 @@ class V8_EXPORT_PRIVATE InstructionBlock final
   bool needs_frame_ : 1;
   bool must_construct_frame_ : 1;
   bool must_deconstruct_frame_ : 1;
+  bool omitted_by_jump_threading_ : 1;  // Just for cleaner code comments.
 };
 
 class InstructionSequence;
@@ -1690,12 +1709,9 @@ struct PrintableInstructionBlock {
 
 std::ostream& operator<<(std::ostream&, const PrintableInstructionBlock&);
 
-using ConstantDeque = ZoneDeque<Constant>;
-using ConstantMap = std::map<int, Constant, std::less<int>,
-                             ZoneAllocator<std::pair<const int, Constant> > >;
-
-using InstructionDeque = ZoneDeque<Instruction*>;
-using ReferenceMapDeque = ZoneDeque<ReferenceMap*>;
+using ConstantMap = ZoneUnorderedMap</* virtual register */ int, Constant>;
+using Instructions = ZoneVector<Instruction*>;
+using ReferenceMaps = ZoneVector<ReferenceMap*>;
 using InstructionBlocks = ZoneVector<InstructionBlock*>;
 
 // Represents architecture-specific generated code before, during, and after
@@ -1705,6 +1721,8 @@ class V8_EXPORT_PRIVATE InstructionSequence final
  public:
   static InstructionBlocks* InstructionBlocksFor(Zone* zone,
                                                  const Schedule* schedule);
+  static InstructionBlocks* InstructionBlocksFor(
+      Zone* zone, const turboshaft::Graph& graph);
   InstructionSequence(Isolate* isolate, Zone* zone,
                       InstructionBlocks* instruction_blocks);
   InstructionSequence(const InstructionSequence&) = delete;
@@ -1736,7 +1754,9 @@ class V8_EXPORT_PRIVATE InstructionSequence final
     return instruction_blocks_->at(rpo_number.ToSize());
   }
 
-  InstructionBlock* GetInstructionBlock(int instruction_index) const;
+  InstructionBlock* GetInstructionBlock(int instruction_index) const {
+    return instructions()[instruction_index]->block();
+  }
 
   static MachineRepresentation DefaultRepresentation() {
     return MachineType::PointerRepresentation();
@@ -1768,10 +1788,10 @@ class V8_EXPORT_PRIVATE InstructionSequence final
 
   Instruction* GetBlockStart(RpoNumber rpo) const;
 
-  using const_iterator = InstructionDeque::const_iterator;
+  using const_iterator = Instructions::const_iterator;
   const_iterator begin() const { return instructions_.begin(); }
   const_iterator end() const { return instructions_.end(); }
-  const InstructionDeque& instructions() const { return instructions_; }
+  const Instructions& instructions() const { return instructions_; }
   int LastInstructionIndex() const {
     return static_cast<int>(instructions().size()) - 1;
   }
@@ -1783,7 +1803,7 @@ class V8_EXPORT_PRIVATE InstructionSequence final
   }
 
   Isolate* isolate() const { return isolate_; }
-  const ReferenceMapDeque* reference_maps() const { return &reference_maps_; }
+  const ReferenceMaps* reference_maps() const { return &reference_maps_; }
   Zone* zone() const { return zone_; }
 
   // Used by the instruction selector while adding instructions.
@@ -1791,13 +1811,12 @@ class V8_EXPORT_PRIVATE InstructionSequence final
   void StartBlock(RpoNumber rpo);
   void EndBlock(RpoNumber rpo);
 
-  int AddConstant(int virtual_register, Constant constant) {
+  void AddConstant(int virtual_register, Constant constant) {
     // TODO(titzer): allow RPO numbers as constants?
     DCHECK_NE(Constant::kRpoNumber, constant.type());
     DCHECK(virtual_register >= 0 && virtual_register < next_virtual_register_);
     DCHECK(constants_.find(virtual_register) == constants_.end());
-    constants_.insert(std::make_pair(virtual_register, constant));
-    return virtual_register;
+    constants_.emplace(virtual_register, constant);
   }
   Constant GetConstant(int virtual_register) const {
     auto it = constants_.find(virtual_register);
@@ -1924,9 +1943,9 @@ class V8_EXPORT_PRIVATE InstructionSequence final
   ConstantMap constants_;
   Immediates immediates_;
   RpoImmediates rpo_immediates_;
-  InstructionDeque instructions_;
+  Instructions instructions_;
   int next_virtual_register_;
-  ReferenceMapDeque reference_maps_;
+  ReferenceMaps reference_maps_;
   ZoneVector<MachineRepresentation> representations_;
   int representation_mask_;
   DeoptimizationVector deoptimization_entries_;
diff --git a/deps/v8/src/compiler/backend/jump-threading.cc b/deps/v8/src/compiler/backend/jump-threading.cc
index a4b955f3a6e1ff..9b3643a8938565 100644
--- a/deps/v8/src/compiler/backend/jump-threading.cc
+++ b/deps/v8/src/compiler/backend/jump-threading.cc
@@ -312,6 +312,7 @@ void JumpThreading::ApplyForwarding(Zone* local_zone,
           }
           // If this block was marked as a handler, it can be unmarked now.
           code->InstructionBlockAt(block_rpo)->UnmarkHandler();
+          code->InstructionBlockAt(block_rpo)->set_omitted_by_jump_threading();
         }
         fallthru = false;  // jumps don't fall through to the next block.
       }
diff --git a/deps/v8/src/compiler/backend/loong64/code-generator-loong64.cc b/deps/v8/src/compiler/backend/loong64/code-generator-loong64.cc
index 95cad37d7caa7e..b86aeab70b71b1 100644
--- a/deps/v8/src/compiler/backend/loong64/code-generator-loong64.cc
+++ b/deps/v8/src/compiler/backend/loong64/code-generator-loong64.cc
@@ -85,8 +85,19 @@ class Loong64OperandConverter final : public InstructionOperandConverter {
         return Operand::EmbeddedNumber(constant.ToFloat32());
       case Constant::kFloat64:
         return Operand::EmbeddedNumber(constant.ToFloat64().value());
+      case Constant::kCompressedHeapObject: {
+        RootIndex root_index;
+        if (gen_->isolate()->roots_table().IsRootHandle(constant.ToHeapObject(),
+                                                        &root_index)) {
+          CHECK(COMPRESS_POINTERS_BOOL);
+          CHECK(V8_STATIC_ROOTS_BOOL || !gen_->isolate()->bootstrapper());
+          Tagged_t ptr =
+              MacroAssemblerBase::ReadOnlyRootPtr(root_index, gen_->isolate());
+          return Operand(ptr);
+        }
+        return Operand(constant.ToHeapObject());
+      }
       case Constant::kExternalReference:
-      case Constant::kCompressedHeapObject:
       case Constant::kHeapObject:
         break;
       case Constant::kRpoNumber:
@@ -541,7 +552,7 @@ void CodeGenerator::BailoutIfDeoptimized() {
   int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
   __ LoadTaggedField(scratch,
                      MemOperand(kJavaScriptCallCodeStartRegister, offset));
-  __ Ld_hu(scratch, FieldMemOperand(scratch, Code::kKindSpecificFlagsOffset));
+  __ Ld_wu(scratch, FieldMemOperand(scratch, Code::kFlagsOffset));
   __ And(scratch, scratch, Operand(1 << Code::kMarkedForDeoptimizationBit));
   __ Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
           RelocInfo::CODE_TARGET, ne, scratch, Operand(zero_reg));
@@ -571,7 +582,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchCallBuiltinPointer: {
       DCHECK(!instr->InputAt(0)->IsImmediate());
       Register builtin_index = i.InputRegister(0);
-      __ CallBuiltinByIndex(builtin_index);
+      Register target =
+          instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister)
+              ? kJavaScriptCallCodeStartRegister
+              : builtin_index;
+      __ CallBuiltinByIndex(builtin_index, target);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -637,9 +652,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                            FieldMemOperand(func, JSFunction::kContextOffset));
         __ Assert(eq, AbortReason::kWrongFunctionContext, cp, Operand(scratch));
       }
-      static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-      __ LoadTaggedField(a2, FieldMemOperand(func, JSFunction::kCodeOffset));
-      __ CallCodeObject(a2);
+      __ CallJSFunction(func);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -857,6 +870,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier:
+      UNREACHABLE();
     case kArchStackSlot: {
       UseScratchRegisterScope temps(masm());
       Register scratch = temps.Acquire();
@@ -1560,6 +1575,15 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ StoreTaggedField(i.InputOrZeroRegister(index), mem);
       break;
     }
+    case kLoong64LoadDecodeSandboxedPointer:
+      __ LoadSandboxedPointerField(i.OutputRegister(), i.MemoryOperand());
+      break;
+    case kLoong64StoreEncodeSandboxedPointer: {
+      size_t index = 0;
+      MemOperand mem = i.MemoryOperand(&index);
+      __ StoreSandboxedPointerField(i.InputOrZeroRegister(index), mem);
+      break;
+    }
     case kLoong64AtomicLoadDecompressTaggedSigned:
       __ AtomicDecompressTaggedSigned(i.OutputRegister(), i.MemoryOperand());
       break;
@@ -1934,6 +1958,7 @@ void SignExtend(MacroAssembler* masm, Instruction* instr, Register* left,
     need_signed = IsAnyTagged(rep_right) || IsAnyCompressed(rep_right) ||
                   rep_right == MachineRepresentation::kWord64;
     if (need_signed && right->is_reg()) {
+      DCHECK(*temp1 != no_reg);
       masm->slli_w(*temp1, right->rm(), 0);
       *right = Operand(*temp1);
     }
@@ -2000,7 +2025,7 @@ void AssembleBranchToLabels(CodeGenerator* gen, MacroAssembler* masm,
     // Word32Compare has two temp registers.
     if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kLoong64Cmp32)) {
       Register temp0 = i.TempRegister(0);
-      Register temp1 = i.TempRegister(1);
+      Register temp1 = right.is_reg() ? i.TempRegister(1) : no_reg;
       SignExtend(masm, instr, &left, &right, &temp0, &temp1);
     }
     __ Branch(tlabel, cc, left, right);
@@ -2067,32 +2092,16 @@ void CodeGenerator::AssembleArchTrap(Instruction* instr,
 
    private:
     void GenerateCallToTrap(TrapId trap_id) {
-      if (trap_id == TrapId::kInvalid) {
-        // We cannot test calls to the runtime in cctest/test-run-wasm.
-        // Therefore we emit a call to C here instead of a call to the runtime.
-        // We use the context register as the scratch register, because we do
-        // not have a context here.
-        __ PrepareCallCFunction(0, 0, cp);
-        __ CallCFunction(
-            ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-        __ LeaveFrame(StackFrame::WASM);
-        auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-        int pop_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-        pop_count += (pop_count & 1);  // align
-        __ Drop(pop_count);
-        __ Ret();
-      } else {
-        gen_->AssembleSourcePosition(instr_);
-        // A direct call to a wasm runtime stub defined in this module.
-        // Just encode the stub index. This will be patched when the code
-        // is added to the native module and copied into wasm code space.
-        __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-        ReferenceMap* reference_map =
-            gen_->zone()->New<ReferenceMap>(gen_->zone());
-        gen_->RecordSafepoint(reference_map);
-        if (v8_flags.debug_code) {
-          __ stop();
-        }
+      gen_->AssembleSourcePosition(instr_);
+      // A direct call to a wasm runtime stub defined in this module.
+      // Just encode the stub index. This will be patched when the code
+      // is added to the native module and copied into wasm code space.
+      __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+      ReferenceMap* reference_map =
+          gen_->zone()->New<ReferenceMap>(gen_->zone());
+      gen_->RecordSafepoint(reference_map);
+      if (v8_flags.debug_code) {
+        __ stop();
       }
     }
     Instruction* instr_;
@@ -2148,108 +2157,14 @@ void CodeGenerator::AssembleArchBoolean(Instruction* instr,
   } else if (instr->arch_opcode() == kLoong64Cmp32 ||
              instr->arch_opcode() == kLoong64Cmp64) {
     Condition cc = FlagsConditionToConditionCmp(condition);
-    switch (cc) {
-      case eq:
-      case ne: {
-        Register left = i.InputRegister(0);
-        Operand right = i.InputOperand(1);
-        if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kLoong64Cmp32)) {
-          Register temp0 = i.TempRegister(0);
-          Register temp1 = i.TempRegister(1);
-          SignExtend(masm(), instr, &left, &right, &temp0, &temp1);
-        }
-        if (instr->InputAt(1)->IsImmediate()) {
-          if (is_int12(-right.immediate())) {
-            if (right.immediate() == 0) {
-              if (cc == eq) {
-                __ Sltu(result, left, 1);
-              } else {
-                __ Sltu(result, zero_reg, left);
-              }
-            } else {
-              __ Add_d(result, left, Operand(-right.immediate()));
-              if (cc == eq) {
-                __ Sltu(result, result, 1);
-              } else {
-                __ Sltu(result, zero_reg, result);
-              }
-            }
-          } else {
-            __ Xor(result, left, Operand(right));
-            if (cc == eq) {
-              __ Sltu(result, result, 1);
-            } else {
-              __ Sltu(result, zero_reg, result);
-            }
-          }
-        } else {
-          __ Xor(result, left, right);
-          if (cc == eq) {
-            __ Sltu(result, result, 1);
-          } else {
-            __ Sltu(result, zero_reg, result);
-          }
-        }
-      } break;
-      case lt:
-      case ge: {
-        Register left = i.InputRegister(0);
-        Operand right = i.InputOperand(1);
-        if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kLoong64Cmp32)) {
-          Register temp0 = i.TempRegister(0);
-          Register temp1 = i.TempRegister(1);
-          SignExtend(masm(), instr, &left, &right, &temp0, &temp1);
-        }
-        __ Slt(result, left, right);
-        if (cc == ge) {
-          __ xori(result, result, 1);
-        }
-      } break;
-      case gt:
-      case le: {
-        Register left = i.InputRegister(1);
-        Operand right = i.InputOperand(0);
-        if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kLoong64Cmp32)) {
-          Register temp0 = i.TempRegister(0);
-          Register temp1 = i.TempRegister(1);
-          SignExtend(masm(), instr, &left, &right, &temp0, &temp1);
-        }
-        __ Slt(result, left, right);
-        if (cc == le) {
-          __ xori(result, result, 1);
-        }
-      } break;
-      case lo:
-      case hs: {
-        Register left = i.InputRegister(0);
-        Operand right = i.InputOperand(1);
-        if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kLoong64Cmp32)) {
-          Register temp0 = i.TempRegister(0);
-          Register temp1 = i.TempRegister(1);
-          SignExtend(masm(), instr, &left, &right, &temp0, &temp1);
-        }
-        __ Sltu(result, left, right);
-        if (cc == hs) {
-          __ xori(result, result, 1);
-        }
-      } break;
-      case hi:
-      case ls: {
-        Register left = i.InputRegister(1);
-        Operand right = i.InputOperand(0);
-        if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kLoong64Cmp32)) {
-          Register temp0 = i.TempRegister(0);
-          Register temp1 = i.TempRegister(1);
-          SignExtend(masm(), instr, &left, &right, &temp0, &temp1);
-        }
-        __ Sltu(result, left, right);
-        if (cc == ls) {
-          __ xori(result, result, 1);
-        }
-      } break;
-      default:
-        UNREACHABLE();
+    Register left = i.InputRegister(0);
+    Operand right = i.InputOperand(1);
+    if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kLoong64Cmp32)) {
+      Register temp0 = i.TempRegister(0);
+      Register temp1 = right.is_reg() ? i.TempRegister(1) : no_reg;
+      SignExtend(masm(), instr, &left, &right, &temp0, &temp1);
     }
+    __ CompareWord(cc, result, left, right);
     return;
   } else if (instr->arch_opcode() == kLoong64Float64Cmp ||
              instr->arch_opcode() == kLoong64Float32Cmp) {
@@ -2290,7 +2205,13 @@ void CodeGenerator::AssembleArchBinarySearchSwitch(Instruction* instr) {
   for (size_t index = 2; index < instr->InputCount(); index += 2) {
     cases.push_back({i.InputInt32(index + 0), GetLabel(i.InputRpo(index + 1))});
   }
-  AssembleArchBinarySearchSwitchRange(input, i.InputRpo(1), cases.data(),
+
+  UseScratchRegisterScope temps(masm());
+  Register scratch = temps.Acquire();
+  // The input register may contains dirty data in upper 32 bits, explicitly
+  // sign-extend it here.
+  __ slli_w(scratch, input, 0);
+  AssembleArchBinarySearchSwitchRange(scratch, i.InputRpo(1), cases.data(),
                                       cases.data() + cases.size());
 }
 
@@ -2299,8 +2220,13 @@ void CodeGenerator::AssembleArchTableSwitch(Instruction* instr) {
   Register input = i.InputRegister(0);
   size_t const case_count = instr->InputCount() - 2;
 
-  __ Branch(GetLabel(i.InputRpo(1)), hs, input, Operand(case_count));
-  __ GenerateSwitchTable(input, case_count, [&i, this](size_t index) {
+  UseScratchRegisterScope temps(masm());
+  Register scratch = temps.Acquire();
+  // The input register may contains dirty data in upper 32 bits, explicitly
+  // sign-extend it here.
+  __ slli_w(scratch, input, 0);
+  __ Branch(GetLabel(i.InputRpo(1)), hs, scratch, Operand(case_count));
+  __ GenerateSwitchTable(scratch, case_count, [&i, this](size_t index) {
     return GetLabel(i.InputRpo(index + 2));
   });
 }
@@ -2574,11 +2500,12 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
   Loong64OperandConverter g(this, nullptr);
-  int new_slots = ElementSizeInPointers(rep);
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = ElementSizeInPointers(rep);
   if (dest->IsRegister()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ Pop(g.ToRegister(dest));
   } else if (dest->IsStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     UseScratchRegisterScope temps(masm());
     Register scratch = temps.Acquire();
     __ Pop(scratch);
@@ -2587,12 +2514,13 @@ void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ Add_d(sp, sp, Operand(new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ Add_d(sp, sp, Operand(dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
@@ -2735,6 +2663,24 @@ void CodeGenerator::SetPendingMove(MoveOperands* move) {
   }
 }
 
+namespace {
+
+bool Is32BitOperand(InstructionOperand* operand) {
+  DCHECK(operand->IsStackSlot() || operand->IsRegister());
+  MachineRepresentation mr = LocationOperand::cast(operand)->representation();
+  return mr == MachineRepresentation::kWord32 ||
+         mr == MachineRepresentation::kCompressed ||
+         mr == MachineRepresentation::kCompressedPointer;
+}
+
+// When we need only 32 bits, move only 32 bits, otherwise the destination
+// register' upper 32 bits may contain dirty data.
+bool Use32BitMove(InstructionOperand* source, InstructionOperand* destination) {
+  return Is32BitOperand(source) && Is32BitOperand(destination);
+}
+
+}  // namespace
+
 void CodeGenerator::AssembleMove(InstructionOperand* source,
                                  InstructionOperand* destination) {
   Loong64OperandConverter g(this, nullptr);
@@ -2752,7 +2698,11 @@ void CodeGenerator::AssembleMove(InstructionOperand* source,
     DCHECK(destination->IsRegister() || destination->IsStackSlot());
     MemOperand src = g.ToMemOperand(source);
     if (destination->IsRegister()) {
-      __ Ld_d(g.ToRegister(destination), src);
+      if (Use32BitMove(source, destination)) {
+        __ Ld_w(g.ToRegister(destination), src);
+      } else {
+        __ Ld_d(g.ToRegister(destination), src);
+      }
     } else {
       UseScratchRegisterScope temps(masm());
       Register scratch = temps.Acquire();
@@ -2801,7 +2751,7 @@ void CodeGenerator::AssembleMove(InstructionOperand* source,
           Handle<HeapObject> src_object = src.ToHeapObject();
           RootIndex index;
           if (IsMaterializableFromRoot(src_object, &index)) {
-            __ LoadRoot(dst, index);
+            __ LoadTaggedRoot(dst, index);
           } else {
             __ li(dst, src_object, RelocInfo::COMPRESSED_EMBEDDED_OBJECT);
           }
diff --git a/deps/v8/src/compiler/backend/loong64/instruction-codes-loong64.h b/deps/v8/src/compiler/backend/loong64/instruction-codes-loong64.h
index e17572ba76f341..0b812c9b16e252 100644
--- a/deps/v8/src/compiler/backend/loong64/instruction-codes-loong64.h
+++ b/deps/v8/src/compiler/backend/loong64/instruction-codes-loong64.h
@@ -133,6 +133,8 @@ namespace compiler {
   V(Loong64LoadDecompressTaggedSigned)       \
   V(Loong64LoadDecompressTagged)             \
   V(Loong64StoreCompressTagged)              \
+  V(Loong64LoadDecodeSandboxedPointer)       \
+  V(Loong64StoreEncodeSandboxedPointer)      \
   V(Loong64Fld_s)                            \
   V(Loong64Fst_s)                            \
   V(Loong64Fld_d)                            \
diff --git a/deps/v8/src/compiler/backend/loong64/instruction-selector-loong64.cc b/deps/v8/src/compiler/backend/loong64/instruction-selector-loong64.cc
index 69b10e29a988ef..252ba957a49c81 100644
--- a/deps/v8/src/compiler/backend/loong64/instruction-selector-loong64.cc
+++ b/deps/v8/src/compiler/backend/loong64/instruction-selector-loong64.cc
@@ -3,10 +3,13 @@
 // found in the LICENSE file.
 
 #include "src/base/bits.h"
+#include "src/base/logging.h"
+#include "src/codegen/assembler-inl.h"
 #include "src/codegen/machine-type.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
+#include "src/compiler/turboshaft/operations.h"
 
 namespace v8 {
 namespace internal {
@@ -18,10 +21,13 @@ namespace compiler {
 #define TRACE() PrintF("instr_sel: %s at line %d\n", __FUNCTION__, __LINE__)
 
 // Adds loong64-specific methods for generating InstructionOperands.
-class Loong64OperandGenerator final : public OperandGenerator {
+template <typename Adapter>
+class Loong64OperandGeneratorT final : public OperandGeneratorT<Adapter> {
  public:
-  explicit Loong64OperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit Loong64OperandGeneratorT(InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
 
   InstructionOperand UseOperand(Node* node, InstructionCode opcode) {
     if (CanBeImmediate(node, opcode)) {
@@ -42,7 +48,8 @@ class Loong64OperandGenerator final : public OperandGenerator {
   }
 
   MachineRepresentation GetRepresentation(Node* node) {
-    return sequence()->GetRepresentation(selector()->GetVirtualRegister(node));
+    return this->sequence()->GetRepresentation(
+        selector()->GetVirtualRegister(node));
   }
 
   bool IsIntegerConstant(Node* node) {
@@ -72,6 +79,25 @@ class Loong64OperandGenerator final : public OperandGenerator {
   }
 
   bool CanBeImmediate(Node* node, InstructionCode mode) {
+    if (node->opcode() == IrOpcode::kCompressedHeapConstant) {
+      if (!COMPRESS_POINTERS_BOOL) return false;
+      // For builtin code we need static roots
+      if (selector()->isolate()->bootstrapper() && !V8_STATIC_ROOTS_BOOL) {
+        return false;
+      }
+      const RootsTable& roots_table = selector()->isolate()->roots_table();
+      RootIndex root_index;
+      CompressedHeapObjectMatcher m(node);
+      if (m.HasResolvedValue() &&
+          roots_table.IsRootHandle(m.ResolvedValue(), &root_index)) {
+        if (!RootsTable::IsReadOnly(root_index)) return false;
+        return CanBeImmediate(MacroAssemblerBase::ReadOnlyRootPtr(
+                                  root_index, selector()->isolate()),
+                              mode);
+      }
+      return false;
+    }
+
     return IsIntegerConstant(node) &&
            CanBeImmediate(GetIntegerConstantValue(node), mode);
   }
@@ -125,24 +151,31 @@ class Loong64OperandGenerator final : public OperandGenerator {
   }
 };
 
-static void VisitRR(InstructionSelector* selector, ArchOpcode opcode,
-                    Node* node) {
-  Loong64OperandGenerator g(selector);
+static void VisitRR(InstructionSelectorT<TurbofanAdapter>* selector,
+                    ArchOpcode opcode, Node* node) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)));
 }
 
-static void VisitRRI(InstructionSelector* selector, ArchOpcode opcode,
+template <typename T>
+void VisitRR(InstructionSelectorT<TurboshaftAdapter>*, ArchOpcode, T) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+static void VisitRRI(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
                      Node* node) {
-  Loong64OperandGenerator g(selector);
+  Loong64OperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm));
 }
 
-static void VisitSimdShift(InstructionSelector* selector, ArchOpcode opcode,
-                           Node* node) {
-  Loong64OperandGenerator g(selector);
+template <typename Adapter>
+static void VisitSimdShift(InstructionSelectorT<Adapter>* selector,
+                           ArchOpcode opcode, Node* node) {
+  Loong64OperandGeneratorT<Adapter> g(selector);
   if (g.IsIntegerConstant(node->InputAt(1))) {
     selector->Emit(opcode, g.DefineAsRegister(node),
                    g.UseRegister(node->InputAt(0)),
@@ -154,48 +187,63 @@ static void VisitSimdShift(InstructionSelector* selector, ArchOpcode opcode,
   }
 }
 
-static void VisitRRIR(InstructionSelector* selector, ArchOpcode opcode,
-                      Node* node) {
-  Loong64OperandGenerator g(selector);
+template <typename Adapter>
+static void VisitRRIR(InstructionSelectorT<Adapter>* selector,
+                      ArchOpcode opcode, Node* node) {
+  Loong64OperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm),
                  g.UseRegister(node->InputAt(1)));
 }
 
-static void VisitRRR(InstructionSelector* selector, ArchOpcode opcode,
-                     Node* node) {
-  Loong64OperandGenerator g(selector);
+static void VisitRRR(InstructionSelectorT<TurbofanAdapter>* selector,
+                     ArchOpcode opcode, Node* node) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
 }
 
-static void VisitUniqueRRR(InstructionSelector* selector, ArchOpcode opcode,
-                           Node* node) {
-  Loong64OperandGenerator g(selector);
+template <typename T>
+void VisitRRR(InstructionSelectorT<TurboshaftAdapter>*, ArchOpcode, T) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+static void VisitUniqueRRR(InstructionSelectorT<Adapter>* selector,
+                           ArchOpcode opcode, Node* node) {
+  Loong64OperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseUniqueRegister(node->InputAt(0)),
                  g.UseUniqueRegister(node->InputAt(1)));
 }
 
-void VisitRRRR(InstructionSelector* selector, ArchOpcode opcode, Node* node) {
-  Loong64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitRRRR(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+               Node* node) {
+  Loong64OperandGeneratorT<Adapter> g(selector);
   selector->Emit(
       opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)),
       g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2)));
 }
 
-static void VisitRRO(InstructionSelector* selector, ArchOpcode opcode,
-                     Node* node) {
-  Loong64OperandGenerator g(selector);
-  selector->Emit(opcode, g.DefineAsRegister(node),
-                 g.UseRegister(node->InputAt(0)),
-                 g.UseOperand(node->InputAt(1), opcode));
+template <typename Adapter>
+static void VisitRRO(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+                     typename Adapter::node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(selector);
+    selector->Emit(opcode, g.DefineAsRegister(node),
+                   g.UseRegister(node->InputAt(0)),
+                   g.UseOperand(node->InputAt(1), opcode));
+  }
 }
 
+template <typename Adapter>
 struct ExtendingLoadMatcher {
-  ExtendingLoadMatcher(Node* node, InstructionSelector* selector)
+  ExtendingLoadMatcher(Node* node, InstructionSelectorT<Adapter>* selector)
       : matches_(false), selector_(selector), base_(nullptr), immediate_(0) {
     Initialize(node);
   }
@@ -217,7 +265,7 @@ struct ExtendingLoadMatcher {
 
  private:
   bool matches_;
-  InstructionSelector* selector_;
+  InstructionSelectorT<Adapter>* selector_;
   Node* base_;
   int64_t immediate_;
   ArchOpcode opcode_;
@@ -242,7 +290,7 @@ struct ExtendingLoadMatcher {
         return;
       }
 
-      Loong64OperandGenerator g(selector_);
+      Loong64OperandGeneratorT<Adapter> g(selector_);
       Node* load = m.left().node();
       Node* offset = load->InputAt(1);
       base_ = load->InputAt(0);
@@ -255,10 +303,11 @@ struct ExtendingLoadMatcher {
   }
 };
 
-bool TryEmitExtendingLoad(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+bool TryEmitExtendingLoad(InstructionSelectorT<Adapter>* selector, Node* node,
                           Node* output_node) {
-  ExtendingLoadMatcher m(node, selector);
-  Loong64OperandGenerator g(selector);
+  ExtendingLoadMatcher<Adapter> m(node, selector);
+  Loong64OperandGeneratorT<Adapter> g(selector);
   if (m.Matches()) {
     InstructionOperand inputs[2];
     inputs[0] = g.UseRegister(m.base());
@@ -274,10 +323,11 @@ bool TryEmitExtendingLoad(InstructionSelector* selector, Node* node,
   return false;
 }
 
-bool TryMatchImmediate(InstructionSelector* selector,
+template <typename Adapter>
+bool TryMatchImmediate(InstructionSelectorT<Adapter>* selector,
                        InstructionCode* opcode_return, Node* node,
                        size_t* input_count_return, InstructionOperand* inputs) {
-  Loong64OperandGenerator g(selector);
+  Loong64OperandGeneratorT<Adapter> g(selector);
   if (g.CanBeImmediate(node, *opcode_return)) {
     *opcode_return |= AddressingModeField::encode(kMode_MRI);
     inputs[0] = g.UseImmediate(node);
@@ -287,11 +337,12 @@ bool TryMatchImmediate(InstructionSelector* selector,
   return false;
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode, bool has_reverse_opcode,
                        InstructionCode reverse_opcode,
-                       FlagsContinuation* cont) {
-  Loong64OperandGenerator g(selector);
+                       FlagsContinuationT<Adapter>* cont) {
+  Loong64OperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   InstructionOperand inputs[2];
   size_t input_count = 0;
@@ -324,41 +375,56 @@ static void VisitBinop(InstructionSelector* selector, Node* node,
                                  inputs, cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode, bool has_reverse_opcode,
                        InstructionCode reverse_opcode) {
-  FlagsContinuation cont;
+  FlagsContinuationT<Adapter> cont;
   VisitBinop(selector, node, opcode, has_reverse_opcode, reverse_opcode, &cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
-                       InstructionCode opcode, FlagsContinuation* cont) {
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
+                       InstructionCode opcode,
+                       FlagsContinuationT<Adapter>* cont) {
   VisitBinop(selector, node, opcode, false, kArchNop, cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode) {
   VisitBinop(selector, node, opcode, false, kArchNop);
 }
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
-  int alignment = rep.alignment();
-  int slot = frame_->AllocateSpillSlot(rep.size(), alignment);
-  OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+    int alignment = rep.alignment();
+    int slot = frame_->AllocateSpillSlot(rep.size(), alignment);
+    OperandGenerator g(this);
 
-  Emit(kArchStackSlot, g.DefineAsRegister(node),
-       sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+    Emit(kArchStackSlot, g.DefineAsRegister(node),
+         sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+  }
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), a0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), a0));
+  }
 }
 
-void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
-              Node* output = nullptr) {
-  Loong64OperandGenerator g(selector);
+template <typename Adapter>
+void EmitLoad(InstructionSelectorT<Adapter>* selector, Node* node,
+              InstructionCode opcode, Node* output = nullptr) {
+  Loong64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -398,11 +464,18 @@ void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
   }
 }
 
-void InstructionSelector::VisitStoreLane(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitLoadLane(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
 
   InstructionCode opcode = kArchNop;
@@ -451,71 +524,87 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   EmitLoad(this, node, opcode);
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    LoadRepresentation load_rep = LoadRepresentationOf(node->op());
 
-  InstructionCode opcode = kArchNop;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kFloat32:
-      opcode = kLoong64Fld_s;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kLoong64Fld_d;
-      break;
-    case MachineRepresentation::kBit:  // Fall through.
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsUnsigned() ? kLoong64Ld_bu : kLoong64Ld_b;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsUnsigned() ? kLoong64Ld_hu : kLoong64Ld_h;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kLoong64Ld_w;
-      break;
+    InstructionCode opcode = kArchNop;
+    switch (load_rep.representation()) {
+      case MachineRepresentation::kFloat32:
+        opcode = kLoong64Fld_s;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kLoong64Fld_d;
+        break;
+      case MachineRepresentation::kBit:  // Fall through.
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsUnsigned() ? kLoong64Ld_bu : kLoong64Ld_b;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsUnsigned() ? kLoong64Ld_hu : kLoong64Ld_h;
+        break;
+      case MachineRepresentation::kWord32:
+        opcode = kLoong64Ld_w;
+        break;
 #ifdef V8_COMPRESS_POINTERS
-    case MachineRepresentation::kTaggedSigned:
-      opcode = kLoong64LoadDecompressTaggedSigned;
-      break;
-    case MachineRepresentation::kTaggedPointer:
-    case MachineRepresentation::kTagged:
-      opcode = kLoong64LoadDecompressTagged;
-      break;
+      case MachineRepresentation::kTaggedSigned:
+        opcode = kLoong64LoadDecompressTaggedSigned;
+        break;
+      case MachineRepresentation::kTaggedPointer:
+      case MachineRepresentation::kTagged:
+        opcode = kLoong64LoadDecompressTagged;
+        break;
 #else
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:         // Fall through.
-#endif
-    case MachineRepresentation::kWord64:
-      opcode = kLoong64Ld_d;
-      break;
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-#ifdef V8_COMPRESS_POINTERS
-      opcode = kLoong64Ld_wu;
-      break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:         // Fall through.
 #endif
-    case MachineRepresentation::kCompressed:         // Fall through.
+      case MachineRepresentation::kWord64:
+        opcode = kLoong64Ld_d;
+        break;
+      case MachineRepresentation::kCompressedPointer:  // Fall through.
+      case MachineRepresentation::kCompressed:
 #ifdef V8_COMPRESS_POINTERS
-      opcode = kLoong64Ld_wu;
-      break;
+        opcode = kLoong64Ld_wu;
+        break;
 #endif
-    case MachineRepresentation::kSandboxedPointer:   // Fall through.
-    case MachineRepresentation::kMapWord:            // Fall through.
-    case MachineRepresentation::kNone:               // Fall through.
-    case MachineRepresentation::kSimd128:            // Fall through.
-    case MachineRepresentation::kSimd256:
-      UNREACHABLE();
-  }
+      case MachineRepresentation::kSandboxedPointer:
+        opcode = kLoong64LoadDecodeSandboxedPointer;
+        break;
+      case MachineRepresentation::kMapWord:  // Fall through.
+      case MachineRepresentation::kIndirectPointer:  // Fall through.
+      case MachineRepresentation::kNone:     // Fall through.
+      case MachineRepresentation::kSimd128:  // Fall through.
+      case MachineRepresentation::kSimd256:
+        UNREACHABLE();
+    }
 
-  EmitLoad(this, node, opcode);
+    EmitLoad(this, node, opcode);
+  }
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitStore(Node* node) {
-  Loong64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitStore(turboshaft::OpIndex) {
+  UNREACHABLE();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitStore(Node* node) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -577,19 +666,22 @@ void InstructionSelector::VisitStore(Node* node) {
         break;
       case MachineRepresentation::kTaggedSigned:   // Fall through.
       case MachineRepresentation::kTaggedPointer:  // Fall through.
-      case MachineRepresentation::kTagged:         // Fall through.
+      case MachineRepresentation::kTagged:
         opcode = kLoong64StoreCompressTagged;
         break;
       case MachineRepresentation::kCompressedPointer:  // Fall through.
-      case MachineRepresentation::kCompressed:         // Fall through.
+      case MachineRepresentation::kCompressed:
 #ifdef V8_COMPRESS_POINTERS
         opcode = kLoong64StoreCompressTagged;
         break;
 #endif
-      case MachineRepresentation::kSandboxedPointer:   // Fall through.
-      case MachineRepresentation::kMapWord:            // Fall through.
-      case MachineRepresentation::kNone:               // Fall through.
-      case MachineRepresentation::kSimd128:            // Fall through.
+      case MachineRepresentation::kSandboxedPointer:
+        opcode = kLoong64StoreEncodeSandboxedPointer;
+        break;
+      case MachineRepresentation::kMapWord:  // Fall through.
+      case MachineRepresentation::kIndirectPointer:  // Fall through.
+      case MachineRepresentation::kNone:     // Fall through.
+      case MachineRepresentation::kSimd128:  // Fall through.
       case MachineRepresentation::kSimd256:
         UNREACHABLE();
     }
@@ -630,13 +722,21 @@ void InstructionSelector::VisitStore(Node* node) {
   }
 }
 
-void InstructionSelector::VisitProtectedStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitWord32And(Node* node) {
-  Loong64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32And(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32And(Node* node) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   if (m.left().IsWord32Shr() && CanCover(node, m.left().node()) &&
       m.right().HasResolvedValue()) {
@@ -684,8 +784,14 @@ void InstructionSelector::VisitWord32And(Node* node) {
   VisitBinop(this, node, kLoong64And32, true, kLoong64And32);
 }
 
-void InstructionSelector::VisitWord64And(Node* node) {
-  Loong64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord64And(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64And(Node* node) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(this);
   Int64BinopMatcher m(node);
   if (m.left().IsWord64Shr() && CanCover(node, m.left().node()) &&
       m.right().HasResolvedValue()) {
@@ -739,65 +845,91 @@ void InstructionSelector::VisitWord64And(Node* node) {
   VisitBinop(this, node, kLoong64And, true, kLoong64And);
 }
 
-void InstructionSelector::VisitWord32Or(Node* node) {
-  VisitBinop(this, node, kLoong64Or32, true, kLoong64Or32);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop(this, node, kLoong64Or32, true, kLoong64Or32);
+  }
 }
 
-void InstructionSelector::VisitWord64Or(Node* node) {
-  VisitBinop(this, node, kLoong64Or, true, kLoong64Or);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop(this, node, kLoong64Or, true, kLoong64Or);
+  }
 }
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  Int32BinopMatcher m(node);
-  if (m.left().IsWord32Or() && CanCover(node, m.left().node()) &&
-      m.right().Is(-1)) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (!mleft.right().HasResolvedValue()) {
-      Loong64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    if (m.left().IsWord32Or() && CanCover(node, m.left().node()) &&
+        m.right().Is(-1)) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (!mleft.right().HasResolvedValue()) {
+        Loong64OperandGeneratorT<Adapter> g(this);
+        Emit(kLoong64Nor32, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()),
+             g.UseRegister(mleft.right().node()));
+        return;
+      }
+    }
+    if (m.right().Is(-1)) {
+      // Use Nor for bit negation and eliminate constant loading for xori.
+      Loong64OperandGeneratorT<Adapter> g(this);
       Emit(kLoong64Nor32, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()),
-           g.UseRegister(mleft.right().node()));
+           g.UseRegister(m.left().node()), g.TempImmediate(0));
       return;
     }
+    VisitBinop(this, node, kLoong64Xor32, true, kLoong64Xor32);
   }
-  if (m.right().Is(-1)) {
-    // Use Nor for bit negation and eliminate constant loading for xori.
-    Loong64OperandGenerator g(this);
-    Emit(kLoong64Nor32, g.DefineAsRegister(node),
-         g.UseRegister(m.left().node()), g.TempImmediate(0));
-    return;
-  }
-  VisitBinop(this, node, kLoong64Xor32, true, kLoong64Xor32);
 }
 
-void InstructionSelector::VisitWord64Xor(Node* node) {
-  Int64BinopMatcher m(node);
-  if (m.left().IsWord64Or() && CanCover(node, m.left().node()) &&
-      m.right().Is(-1)) {
-    Int64BinopMatcher mleft(m.left().node());
-    if (!mleft.right().HasResolvedValue()) {
-      Loong64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int64BinopMatcher m(node);
+    if (m.left().IsWord64Or() && CanCover(node, m.left().node()) &&
+        m.right().Is(-1)) {
+      Int64BinopMatcher mleft(m.left().node());
+      if (!mleft.right().HasResolvedValue()) {
+        Loong64OperandGeneratorT<Adapter> g(this);
+        Emit(kLoong64Nor, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()),
+             g.UseRegister(mleft.right().node()));
+        return;
+      }
+    }
+    if (m.right().Is(-1)) {
+      // Use Nor for bit negation and eliminate constant loading for xori.
+      Loong64OperandGeneratorT<Adapter> g(this);
       Emit(kLoong64Nor, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()),
-           g.UseRegister(mleft.right().node()));
+           g.UseRegister(m.left().node()), g.TempImmediate(0));
       return;
     }
+    VisitBinop(this, node, kLoong64Xor, true, kLoong64Xor);
   }
-  if (m.right().Is(-1)) {
-    // Use Nor for bit negation and eliminate constant loading for xori.
-    Loong64OperandGenerator g(this);
-    Emit(kLoong64Nor, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-         g.TempImmediate(0));
-    return;
-  }
-  VisitBinop(this, node, kLoong64Xor, true, kLoong64Xor);
 }
 
-void InstructionSelector::VisitWord32Shl(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Shl(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Shl(Node* node) {
   Int32BinopMatcher m(node);
   if (m.left().IsWord32And() && CanCover(node, m.left().node()) &&
       m.right().IsInRange(1, 31)) {
-    Loong64OperandGenerator g(this);
+    Loong64OperandGeneratorT<TurbofanAdapter> g(this);
     Int32BinopMatcher mleft(m.left().node());
     // Match Word32Shl(Word32And(x, mask), imm) to Sll_w where the mask is
     // contiguous, and the shift immediate non-zero.
@@ -823,7 +955,13 @@ void InstructionSelector::VisitWord32Shl(Node* node) {
   VisitRRO(this, kLoong64Sll_w, node);
 }
 
-void InstructionSelector::VisitWord32Shr(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Shr(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Shr(Node* node) {
   Int32BinopMatcher m(node);
   if (m.left().IsWord32And() && m.right().HasResolvedValue()) {
     uint32_t lsb = m.right().ResolvedValue() & 0x1F;
@@ -836,7 +974,7 @@ void InstructionSelector::VisitWord32Shr(Node* node) {
       unsigned mask_width = base::bits::CountPopulation(mask);
       unsigned mask_msb = base::bits::CountLeadingZeros32(mask);
       if ((mask_msb + mask_width + lsb) == 32) {
-        Loong64OperandGenerator g(this);
+        Loong64OperandGeneratorT<TurbofanAdapter> g(this);
         DCHECK_EQ(lsb, base::bits::CountTrailingZeros32(mask));
         Emit(kLoong64Bstrpick_w, g.DefineAsRegister(node),
              g.UseRegister(mleft.left().node()), g.TempImmediate(lsb),
@@ -848,10 +986,17 @@ void InstructionSelector::VisitWord32Shr(Node* node) {
   VisitRRO(this, kLoong64Srl_w, node);
 }
 
-void InstructionSelector::VisitWord32Sar(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Sar(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Sar(Node* node) {
   Int32BinopMatcher m(node);
   if (CanCover(node, m.left().node())) {
-    Loong64OperandGenerator g(this);
+    Loong64OperandGeneratorT<TurbofanAdapter> g(this);
     if (m.left().IsWord32Shl()) {
       Int32BinopMatcher mleft(m.left().node());
       if (m.right().HasResolvedValue() && mleft.right().HasResolvedValue()) {
@@ -881,47 +1026,59 @@ void InstructionSelector::VisitWord32Sar(Node* node) {
   VisitRRO(this, kLoong64Sra_w, node);
 }
 
-void InstructionSelector::VisitWord64Shl(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if ((m.left().IsChangeInt32ToInt64() || m.left().IsChangeUint32ToUint64()) &&
-      m.right().IsInRange(32, 63) && CanCover(node, m.left().node())) {
-    // There's no need to sign/zero-extend to 64-bit if we shift out the upper
-    // 32 bits anyway.
-    Emit(kLoong64Sll_d, g.DefineAsRegister(node),
-         g.UseRegister(m.left().node()->InputAt(0)),
-         g.UseImmediate(m.right().node()));
-    return;
-  }
-  if (m.left().IsWord64And() && CanCover(node, m.left().node()) &&
-      m.right().IsInRange(1, 63)) {
-    // Match Word64Shl(Word64And(x, mask), imm) to Sll_d where the mask is
-    // contiguous, and the shift immediate non-zero.
-    Int64BinopMatcher mleft(m.left().node());
-    if (mleft.right().HasResolvedValue()) {
-      uint64_t mask = mleft.right().ResolvedValue();
-      uint32_t mask_width = base::bits::CountPopulation(mask);
-      uint32_t mask_msb = base::bits::CountLeadingZeros64(mask);
-      if ((mask_width != 0) && (mask_msb + mask_width == 64)) {
-        uint64_t shift = m.right().ResolvedValue();
-        DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask));
-        DCHECK_NE(0u, shift);
-
-        if ((shift + mask_width) >= 64) {
-          // If the mask is contiguous and reaches or extends beyond the top
-          // bit, only the shift is needed.
-          Emit(kLoong64Sll_d, g.DefineAsRegister(node),
-               g.UseRegister(mleft.left().node()),
-               g.UseImmediate(m.right().node()));
-          return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if ((m.left().IsChangeInt32ToInt64() ||
+         m.left().IsChangeUint32ToUint64()) &&
+        m.right().IsInRange(32, 63) && CanCover(node, m.left().node())) {
+      // There's no need to sign/zero-extend to 64-bit if we shift out the upper
+      // 32 bits anyway.
+      Emit(kLoong64Sll_d, g.DefineAsRegister(node),
+           g.UseRegister(m.left().node()->InputAt(0)),
+           g.UseImmediate(m.right().node()));
+      return;
+    }
+    if (m.left().IsWord64And() && CanCover(node, m.left().node()) &&
+        m.right().IsInRange(1, 63)) {
+      // Match Word64Shl(Word64And(x, mask), imm) to Sll_d where the mask is
+      // contiguous, and the shift immediate non-zero.
+      Int64BinopMatcher mleft(m.left().node());
+      if (mleft.right().HasResolvedValue()) {
+        uint64_t mask = mleft.right().ResolvedValue();
+        uint32_t mask_width = base::bits::CountPopulation(mask);
+        uint32_t mask_msb = base::bits::CountLeadingZeros64(mask);
+        if ((mask_width != 0) && (mask_msb + mask_width == 64)) {
+          uint64_t shift = m.right().ResolvedValue();
+          DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask));
+          DCHECK_NE(0u, shift);
+
+          if ((shift + mask_width) >= 64) {
+            // If the mask is contiguous and reaches or extends beyond the top
+            // bit, only the shift is needed.
+            Emit(kLoong64Sll_d, g.DefineAsRegister(node),
+                 g.UseRegister(mleft.left().node()),
+                 g.UseImmediate(m.right().node()));
+            return;
+          }
         }
       }
     }
+    VisitRRO(this, kLoong64Sll_d, node);
   }
-  VisitRRO(this, kLoong64Sll_d, node);
 }
 
-void InstructionSelector::VisitWord64Shr(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord64Shr(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64Shr(Node* node) {
   Int64BinopMatcher m(node);
   if (m.left().IsWord64And() && m.right().HasResolvedValue()) {
     uint32_t lsb = m.right().ResolvedValue() & 0x3F;
@@ -934,7 +1091,7 @@ void InstructionSelector::VisitWord64Shr(Node* node) {
       unsigned mask_width = base::bits::CountPopulation(mask);
       unsigned mask_msb = base::bits::CountLeadingZeros64(mask);
       if ((mask_msb + mask_width + lsb) == 64) {
-        Loong64OperandGenerator g(this);
+        Loong64OperandGeneratorT<TurbofanAdapter> g(this);
         DCHECK_EQ(lsb, base::bits::CountTrailingZeros64(mask));
         Emit(kLoong64Bstrpick_d, g.DefineAsRegister(node),
              g.UseRegister(mleft.left().node()), g.TempImmediate(lsb),
@@ -946,76 +1103,115 @@ void InstructionSelector::VisitWord64Shr(Node* node) {
   VisitRRO(this, kLoong64Srl_d, node);
 }
 
-void InstructionSelector::VisitWord64Sar(Node* node) {
-  if (TryEmitExtendingLoad(this, node, node)) return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Sar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (TryEmitExtendingLoad(this, node, node)) return;
 
-  Int64BinopMatcher m(node);
-  if (m.left().IsChangeInt32ToInt64() && m.right().HasResolvedValue() &&
-      is_uint5(m.right().ResolvedValue()) && CanCover(node, m.left().node())) {
-    if ((m.left().InputAt(0)->opcode() != IrOpcode::kLoad &&
-         m.left().InputAt(0)->opcode() != IrOpcode::kLoadImmutable) ||
-        !CanCover(m.left().node(), m.left().InputAt(0))) {
-      Loong64OperandGenerator g(this);
-      Emit(kLoong64Sra_w, g.DefineAsRegister(node),
-           g.UseRegister(m.left().node()->InputAt(0)),
-           g.UseImmediate(m.right().node()));
-      return;
+    Int64BinopMatcher m(node);
+    if (m.left().IsChangeInt32ToInt64() && m.right().HasResolvedValue() &&
+        is_uint5(m.right().ResolvedValue()) &&
+        CanCover(node, m.left().node())) {
+      if ((m.left().InputAt(0)->opcode() != IrOpcode::kLoad &&
+           m.left().InputAt(0)->opcode() != IrOpcode::kLoadImmutable) ||
+          !CanCover(m.left().node(), m.left().InputAt(0))) {
+        Loong64OperandGeneratorT<Adapter> g(this);
+        Emit(kLoong64Sra_w, g.DefineAsRegister(node),
+             g.UseRegister(m.left().node()->InputAt(0)),
+             g.UseImmediate(m.right().node()));
+        return;
+      }
     }
-  }
 
-  VisitRRO(this, kLoong64Sra_d, node);
+    VisitRRO(this, kLoong64Sra_d, node);
+  }
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
   VisitRRO(this, kLoong64Rotr_w, node);
 }
 
-void InstructionSelector::VisitWord64Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ror(node_t node) {
   VisitRRO(this, kLoong64Rotr_d, node);
 }
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64ByteSwap32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
+  VisitRR(this, kLoong64ByteSwap32, node);
 }
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64ByteSwap64, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  VisitRR(this, kLoong64ByteSwap64, node);
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitWord32Clz(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Clz(node_t node) {
   VisitRR(this, kLoong64Clz_w, node);
 }
 
-void InstructionSelector::VisitWord64Clz(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Clz(node_t node) {
   VisitRR(this, kLoong64Clz_d, node);
 }
 
-void InstructionSelector::VisitWord32Ctz(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ctz(node_t node) {
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ctz(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64Ctz(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Popcnt(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32Popcnt(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Popcnt(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64Popcnt(Node* node) { UNREACHABLE(); }
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Add(node_t node) {
+  UNIMPLEMENTED();
+}
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  Loong64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Add(Node* node) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
 
   // Select Alsl_w for (left + (left_of_right << imm)).
@@ -1052,54 +1248,76 @@ void InstructionSelector::VisitInt32Add(Node* node) {
   VisitBinop(this, node, kLoong64Add_w, true, kLoong64Add_w);
 }
 
-void InstructionSelector::VisitInt64Add(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
 
-  // Select Alsl_d for (left + (left_of_right << imm)).
-  if (m.right().opcode() == IrOpcode::kWord64Shl &&
-      CanCover(node, m.left().node()) && CanCover(node, m.right().node())) {
-    Int64BinopMatcher mright(m.right().node());
-    if (mright.right().HasResolvedValue() && !m.left().HasResolvedValue()) {
-      int32_t shift_value =
-          static_cast<int32_t>(mright.right().ResolvedValue());
-      if (shift_value > 0 && shift_value <= 31) {
-        Emit(kLoong64Alsl_d, g.DefineAsRegister(node),
-             g.UseRegister(mright.left().node()),
-             g.UseRegister(m.left().node()), g.TempImmediate(shift_value));
-        return;
+    // Select Alsl_d for (left + (left_of_right << imm)).
+    if (m.right().opcode() == IrOpcode::kWord64Shl &&
+        CanCover(node, m.left().node()) && CanCover(node, m.right().node())) {
+      Int64BinopMatcher mright(m.right().node());
+      if (mright.right().HasResolvedValue() && !m.left().HasResolvedValue()) {
+        int32_t shift_value =
+            static_cast<int32_t>(mright.right().ResolvedValue());
+        if (shift_value > 0 && shift_value <= 31) {
+          Emit(kLoong64Alsl_d, g.DefineAsRegister(node),
+               g.UseRegister(mright.left().node()),
+               g.UseRegister(m.left().node()), g.TempImmediate(shift_value));
+          return;
+        }
       }
     }
-  }
 
-  // Select Alsl_d for ((left_of_left << imm) + right).
-  if (m.left().opcode() == IrOpcode::kWord64Shl &&
-      CanCover(node, m.right().node()) && CanCover(node, m.left().node())) {
-    Int64BinopMatcher mleft(m.left().node());
-    if (mleft.right().HasResolvedValue() && !m.right().HasResolvedValue()) {
-      int32_t shift_value = static_cast<int32_t>(mleft.right().ResolvedValue());
-      if (shift_value > 0 && shift_value <= 31) {
-        Emit(kLoong64Alsl_d, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()),
-             g.UseRegister(m.right().node()), g.TempImmediate(shift_value));
-        return;
+    // Select Alsl_d for ((left_of_left << imm) + right).
+    if (m.left().opcode() == IrOpcode::kWord64Shl &&
+        CanCover(node, m.right().node()) && CanCover(node, m.left().node())) {
+      Int64BinopMatcher mleft(m.left().node());
+      if (mleft.right().HasResolvedValue() && !m.right().HasResolvedValue()) {
+        int32_t shift_value =
+            static_cast<int32_t>(mleft.right().ResolvedValue());
+        if (shift_value > 0 && shift_value <= 31) {
+          Emit(kLoong64Alsl_d, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()),
+               g.UseRegister(m.right().node()), g.TempImmediate(shift_value));
+          return;
+        }
       }
     }
+
+    VisitBinop(this, node, kLoong64Add_d, true, kLoong64Add_d);
   }
+}
 
-  VisitBinop(this, node, kLoong64Add_d, true, kLoong64Add_d);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop(this, node, kLoong64Sub_w);
+  }
 }
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  VisitBinop(this, node, kLoong64Sub_w);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop(this, node, kLoong64Sub_d);
+  }
 }
 
-void InstructionSelector::VisitInt64Sub(Node* node) {
-  VisitBinop(this, node, kLoong64Sub_d);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Mul(node_t node) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
-  Loong64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Mul(Node* node) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
     uint32_t value = static_cast<uint32_t>(m.right().ResolvedValue());
@@ -1144,24 +1362,34 @@ void InstructionSelector::VisitInt32Mul(Node* node) {
   VisitRRR(this, kLoong64Mul_w, node);
 }
 
-void InstructionSelector::VisitInt32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulHigh(node_t node) {
   VisitRRR(this, kLoong64Mulh_w, node);
 }
 
-void InstructionSelector::VisitInt64MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulHigh(node_t node) {
   VisitRRR(this, kLoong64Mulh_d, node);
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
   VisitRRR(this, kLoong64Mulh_wu, node);
 }
 
-void InstructionSelector::VisitUint64MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64MulHigh(node_t node) {
   VisitRRR(this, kLoong64Mulh_du, node);
 }
 
-void InstructionSelector::VisitInt64Mul(Node* node) {
-  Loong64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt64Mul(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt64Mul(Node* node) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(this);
   Int64BinopMatcher m(node);
   if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
     uint64_t value = static_cast<uint64_t>(m.right().ResolvedValue());
@@ -1192,315 +1420,414 @@ void InstructionSelector::VisitInt64Mul(Node* node) {
        g.UseRegister(m.right().node()));
 }
 
-void InstructionSelector::VisitInt32Div(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (CanCover(node, left) && CanCover(node, right)) {
-    if (left->opcode() == IrOpcode::kWord64Sar &&
-        right->opcode() == IrOpcode::kWord64Sar) {
-      Int64BinopMatcher rightInput(right), leftInput(left);
-      if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
-        // Combine both shifted operands with Div_d.
-        Emit(kLoong64Div_d, g.DefineSameAsFirst(node),
-             g.UseRegister(leftInput.left().node()),
-             g.UseRegister(rightInput.left().node()));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    if (CanCover(node, left) && CanCover(node, right)) {
+      if (left->opcode() == IrOpcode::kWord64Sar &&
+          right->opcode() == IrOpcode::kWord64Sar) {
+        Int64BinopMatcher rightInput(right), leftInput(left);
+        if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
+          // Combine both shifted operands with Div_d.
+          Emit(kLoong64Div_d, g.DefineSameAsFirst(node),
+               g.UseRegister(leftInput.left().node()),
+               g.UseRegister(rightInput.left().node()));
+          return;
+        }
       }
     }
+    Emit(kLoong64Div_w, g.DefineSameAsFirst(node),
+         g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
   }
-  Emit(kLoong64Div_w, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
 }
 
-void InstructionSelector::VisitUint32Div(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  Emit(kLoong64Div_wu, g.DefineSameAsFirst(node),
-       g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    Emit(kLoong64Div_wu, g.DefineSameAsFirst(node),
+         g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitInt32Mod(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (CanCover(node, left) && CanCover(node, right)) {
-    if (left->opcode() == IrOpcode::kWord64Sar &&
-        right->opcode() == IrOpcode::kWord64Sar) {
-      Int64BinopMatcher rightInput(right), leftInput(left);
-      if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
-        // Combine both shifted operands with Mod_d.
-        Emit(kLoong64Mod_d, g.DefineSameAsFirst(node),
-             g.UseRegister(leftInput.left().node()),
-             g.UseRegister(rightInput.left().node()));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    if (CanCover(node, left) && CanCover(node, right)) {
+      if (left->opcode() == IrOpcode::kWord64Sar &&
+          right->opcode() == IrOpcode::kWord64Sar) {
+        Int64BinopMatcher rightInput(right), leftInput(left);
+        if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
+          // Combine both shifted operands with Mod_d.
+          Emit(kLoong64Mod_d, g.DefineSameAsFirst(node),
+               g.UseRegister(leftInput.left().node()),
+               g.UseRegister(rightInput.left().node()));
+          return;
+        }
       }
     }
+    Emit(kLoong64Mod_w, g.DefineAsRegister(node),
+         g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
   }
-  Emit(kLoong64Mod_w, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
 }
 
-void InstructionSelector::VisitUint32Mod(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  Emit(kLoong64Mod_wu, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Mod(node_t node) {
+  VisitRRR(this, kLoong64Mod_wu, node);
 }
 
-void InstructionSelector::VisitInt64Div(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  Emit(kLoong64Div_d, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    Emit(kLoong64Div_d, g.DefineSameAsFirst(node),
+         g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitUint64Div(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  Emit(kLoong64Div_du, g.DefineSameAsFirst(node),
-       g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    Emit(kLoong64Div_du, g.DefineSameAsFirst(node),
+         g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
+  }
 }
-
-void InstructionSelector::VisitInt64Mod(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  Emit(kLoong64Mod_d, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Mod(node_t node) {
+  VisitRRR(this, kLoong64Mod_d, node);
 }
 
-void InstructionSelector::VisitUint64Mod(Node* node) {
-  Loong64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  Emit(kLoong64Mod_du, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Mod(node_t node) {
+  VisitRRR(this, kLoong64Mod_du, node);
 }
 
-void InstructionSelector::VisitChangeFloat32ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat32ToFloat64(node_t node) {
   VisitRR(this, kLoong64Float32ToFloat64, node);
 }
 
-void InstructionSelector::VisitRoundInt32ToFloat32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt32ToFloat32(node_t node) {
   VisitRR(this, kLoong64Int32ToFloat32, node);
 }
 
-void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint32ToFloat32(node_t node) {
   VisitRR(this, kLoong64Uint32ToFloat32, node);
 }
 
-void InstructionSelector::VisitChangeInt32ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToFloat64(node_t node) {
   VisitRR(this, kLoong64Int32ToFloat64, node);
 }
 
-void InstructionSelector::VisitChangeInt64ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt64ToFloat64(node_t node) {
   VisitRR(this, kLoong64Int64ToFloat64, node);
 }
 
-void InstructionSelector::VisitChangeUint32ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToFloat64(node_t node) {
   VisitRR(this, kLoong64Uint32ToFloat64, node);
 }
 
-void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) {
-  Loong64OperandGenerator g(this);
-  InstructionCode opcode = kLoong64Float32ToInt32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kLoong64Float32ToInt32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) {
-  Loong64OperandGenerator g(this);
-  InstructionCode opcode = kLoong64Float32ToUint32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kLoong64Float32ToUint32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) {
-  Loong64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  // TODO(LOONG_dev): LOONG64 Match ChangeFloat64ToInt32(Float64Round##OP) to
-  // corresponding instruction which does rounding and conversion to
-  // integer format.
-  if (CanCover(node, value)) {
-    if (value->opcode() == IrOpcode::kChangeFloat32ToFloat64) {
-      Node* next = value->InputAt(0);
-      if (!CanCover(value, next)) {
-        // Match float32 -> float64 -> int32 representation change path.
-        Emit(kLoong64Float32ToInt32, g.DefineAsRegister(node),
-             g.UseRegister(value->InputAt(0)));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    // TODO(LOONG_dev): LOONG64 Match ChangeFloat64ToInt32(Float64Round##OP) to
+    // corresponding instruction which does rounding and conversion to
+    // integer format.
+    if (CanCover(node, value)) {
+      if (value->opcode() == IrOpcode::kChangeFloat32ToFloat64) {
+        Node* next = value->InputAt(0);
+        if (!CanCover(value, next)) {
+          // Match float32 -> float64 -> int32 representation change path.
+          Emit(kLoong64Float32ToInt32, g.DefineAsRegister(node),
+               g.UseRegister(value->InputAt(0)));
+          return;
+        }
       }
     }
+    VisitRR(this, kLoong64Float64ToInt32, node);
   }
-  VisitRR(this, kLoong64Float64ToInt32, node);
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToInt64(node_t node) {
   VisitRR(this, kLoong64Float64ToInt64, node);
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint32(node_t node) {
   VisitRR(this, kLoong64Float64ToUint32, node);
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint64(node_t node) {
   VisitRR(this, kLoong64Float64ToUint64, node);
 }
 
-void InstructionSelector::VisitTruncateFloat64ToUint32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToUint32(node_t node) {
   VisitRR(this, kLoong64Float64ToUint32, node);
 }
 
-void InstructionSelector::VisitTruncateFloat64ToInt64(Node* node) {
-  Loong64OperandGenerator g(this);
-  InstructionCode opcode = kLoong64Float64ToInt64;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kLoong64Float64ToInt64;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
-  Loong64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    this->Emit(kLoong64Float32ToInt64, output_count, outputs, 1, inputs);
   }
-
-  this->Emit(kLoong64Float32ToInt64, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
-  Loong64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kLoong64Float64ToInt64, output_count, outputs, 1, inputs);
   }
-
-  Emit(kLoong64Float64ToInt64, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
-  Loong64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kLoong64Float32ToUint64, output_count, outputs, 1, inputs);
   }
-
-  Emit(kLoong64Float32ToUint64, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
-  Loong64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
 
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
-  }
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Emit(kLoong64Float64ToUint64, output_count, outputs, 1, inputs);
+    Emit(kLoong64Float64ToUint64, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
-  Loong64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand temps[] = {g.TempDoubleRegister()};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt32(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand temps[] = {g.TempDoubleRegister()};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kLoong64Float64ToInt32, output_count, outputs, 1, inputs, 1, temps);
   }
-
-  Emit(kLoong64Float64ToInt32, output_count, outputs, 1, inputs, 1, temps);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
-  Loong64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand temps[] = {g.TempDoubleRegister()};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint32(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand temps[] = {g.TempDoubleRegister()};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kLoong64Float64ToUint32, output_count, outputs, 1, inputs, 1, temps);
   }
-
-  Emit(kLoong64Float64ToUint32, output_count, outputs, 1, inputs, 1, temps);
 }
 
-void InstructionSelector::VisitBitcastWord32ToWord64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32ToWord64(node_t node) {
   DCHECK(SmiValuesAre31Bits());
   DCHECK(COMPRESS_POINTERS_BOOL);
   EmitIdentity(node);
 }
 
-void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
-  Node* value = node->InputAt(0);
-  if ((value->opcode() == IrOpcode::kLoad ||
-       value->opcode() == IrOpcode::kLoadImmutable) &&
-      CanCover(node, value)) {
-    // Generate sign-extending load.
-    LoadRepresentation load_rep = LoadRepresentationOf(value->op());
-    InstructionCode opcode = kArchNop;
-    switch (load_rep.representation()) {
-      case MachineRepresentation::kBit:  // Fall through.
-      case MachineRepresentation::kWord8:
-        opcode = load_rep.IsUnsigned() ? kLoong64Ld_bu : kLoong64Ld_b;
-        break;
-      case MachineRepresentation::kWord16:
-        opcode = load_rep.IsUnsigned() ? kLoong64Ld_hu : kLoong64Ld_h;
-        break;
-      case MachineRepresentation::kTaggedSigned:
-      case MachineRepresentation::kTagged:
-      case MachineRepresentation::kWord32:
-        opcode = kLoong64Ld_w;
-        break;
-      default:
-        UNREACHABLE();
-    }
-    EmitLoad(this, value, opcode, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    Loong64OperandGenerator g(this);
-    Emit(kLoong64Sll_w, g.DefineAsRegister(node), g.UseRegister(value),
-         g.TempImmediate(0));
-    return;
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    if ((value->opcode() == IrOpcode::kLoad ||
+         value->opcode() == IrOpcode::kLoadImmutable) &&
+        CanCover(node, value)) {
+      // Generate sign-extending load.
+      LoadRepresentation load_rep = LoadRepresentationOf(value->op());
+      InstructionCode opcode = kArchNop;
+      switch (load_rep.representation()) {
+        case MachineRepresentation::kBit:  // Fall through.
+        case MachineRepresentation::kWord8:
+          opcode = load_rep.IsUnsigned() ? kLoong64Ld_bu : kLoong64Ld_b;
+          break;
+        case MachineRepresentation::kWord16:
+          opcode = load_rep.IsUnsigned() ? kLoong64Ld_hu : kLoong64Ld_h;
+          break;
+        case MachineRepresentation::kWord32:
+          opcode = kLoong64Ld_w;
+          break;
+        default:
+          UNREACHABLE();
+      }
+      EmitLoad(this, value, opcode, node);
+      return;
+    } else if (value->opcode() == IrOpcode::kTruncateInt64ToInt32) {
+      EmitIdentity(node);
+      return;
+    }
+    Emit(kLoong64Sll_w, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.TempImmediate(0));
   }
 }
 
-bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
+template <>
+bool InstructionSelectorT<TurboshaftAdapter>::ZeroExtendsWord32ToWord64NoPhis(
+    node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+bool InstructionSelectorT<TurbofanAdapter>::ZeroExtendsWord32ToWord64NoPhis(
+    Node* node) {
   DCHECK_NE(node->opcode(), IrOpcode::kPhi);
   switch (node->opcode()) {
     // Comparisons only emit 0/1, so the upper 32 bits must be zero.
@@ -1546,261 +1873,335 @@ bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
   }
 }
 
-void InstructionSelector::VisitChangeUint32ToUint64(Node* node) {
-  Loong64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-
-  if (value->opcode() == IrOpcode::kLoad) {
-    LoadRepresentation load_rep = LoadRepresentationOf(value->op());
-    if (load_rep.IsUnsigned() &&
-        load_rep.representation() == MachineRepresentation::kWord32) {
-      EmitLoad(this, value, kLoong64Ld_wu, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToUint64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+
+    if (value->opcode() == IrOpcode::kLoad) {
+      LoadRepresentation load_rep = LoadRepresentationOf(value->op());
+      if (load_rep.IsUnsigned() &&
+          load_rep.representation() == MachineRepresentation::kWord32) {
+        EmitLoad(this, value, kLoong64Ld_wu, node);
+        return;
+      }
+    }
+    if (ZeroExtendsWord32ToWord64(value)) {
+      EmitIdentity(node);
       return;
     }
+    Emit(kLoong64Bstrpick_d, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.TempImmediate(0),
+         g.TempImmediate(32));
   }
-  if (ZeroExtendsWord32ToWord64(value)) {
-    EmitIdentity(node);
-    return;
-  }
-  Emit(kLoong64Bstrpick_d, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.TempImmediate(0),
-       g.TempImmediate(32));
 }
 
-void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) {
-  Loong64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  if (CanCover(node, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord64Sar: {
-        if (CanCover(value, value->InputAt(0)) &&
-            TryEmitExtendingLoad(this, value, node)) {
-          return;
-        } else {
-          Int64BinopMatcher m(value);
-          if (m.right().IsInRange(32, 63)) {
-            // After smi untagging no need for truncate. Combine sequence.
-            Emit(kLoong64Sra_d, g.DefineAsRegister(node),
-                 g.UseRegister(m.left().node()),
-                 g.UseImmediate(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateInt64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    if (CanCover(node, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord64Sar: {
+          if (CanCover(value, value->InputAt(0)) &&
+              TryEmitExtendingLoad(this, value, node)) {
             return;
+          } else {
+            Int64BinopMatcher m(value);
+            if (m.right().IsInRange(32, 63)) {
+              // After smi untagging no need for truncate. Combine sequence.
+              Emit(kLoong64Sra_d, g.DefineAsRegister(node),
+                   g.UseRegister(m.left().node()),
+                   g.UseImmediate(m.right().node()));
+              return;
+            }
           }
+          break;
         }
-        break;
+        default:
+          break;
       }
-      default:
-        break;
     }
+    Emit(kLoong64Sll_w, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.TempImmediate(0));
   }
-  Emit(kLoong64Sll_w, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
-       g.TempImmediate(0));
 }
 
-void InstructionSelector::VisitTruncateFloat64ToFloat32(Node* node) {
-  Loong64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  // Match TruncateFloat64ToFloat32(ChangeInt32ToFloat64) to corresponding
-  // instruction.
-  if (CanCover(node, value) &&
-      value->opcode() == IrOpcode::kChangeInt32ToFloat64) {
-    Emit(kLoong64Int32ToFloat32, g.DefineAsRegister(node),
-         g.UseRegister(value->InputAt(0)));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    // Match TruncateFloat64ToFloat32(ChangeInt32ToFloat64) to corresponding
+    // instruction.
+    if (CanCover(node, value) &&
+        value->opcode() == IrOpcode::kChangeInt32ToFloat64) {
+      Emit(kLoong64Int32ToFloat32, g.DefineAsRegister(node),
+           g.UseRegister(value->InputAt(0)));
+      return;
+    }
+    VisitRR(this, kLoong64Float64ToFloat32, node);
   }
-  VisitRR(this, kLoong64Float64ToFloat32, node);
 }
 
-void InstructionSelector::VisitTruncateFloat64ToWord32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToWord32(node_t node) {
   VisitRR(this, kArchTruncateDoubleToI, node);
 }
 
-void InstructionSelector::VisitRoundFloat64ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundFloat64ToInt32(node_t node) {
   VisitRR(this, kLoong64Float64ToInt32, node);
 }
 
-void InstructionSelector::VisitRoundInt64ToFloat32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt64ToFloat32(node_t node) {
   VisitRR(this, kLoong64Int64ToFloat32, node);
 }
 
-void InstructionSelector::VisitRoundInt64ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt64ToFloat64(node_t node) {
   VisitRR(this, kLoong64Int64ToFloat64, node);
 }
 
-void InstructionSelector::VisitRoundUint64ToFloat32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint64ToFloat32(node_t node) {
   VisitRR(this, kLoong64Uint64ToFloat32, node);
 }
 
-void InstructionSelector::VisitRoundUint64ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint64ToFloat64(node_t node) {
   VisitRR(this, kLoong64Uint64ToFloat64, node);
 }
 
-void InstructionSelector::VisitBitcastFloat32ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat32ToInt32(node_t node) {
   VisitRR(this, kLoong64Float64ExtractLowWord32, node);
 }
 
-void InstructionSelector::VisitBitcastFloat64ToInt64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat64ToInt64(node_t node) {
   VisitRR(this, kLoong64BitcastDL, node);
 }
 
-void InstructionSelector::VisitBitcastInt32ToFloat32(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Float64InsertLowWord32, g.DefineAsRegister(node),
-       ImmediateOperand(ImmediateOperand::INLINE_INT32, 0),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Emit(kLoong64Float64InsertLowWord32, g.DefineAsRegister(node),
+         ImmediateOperand(ImmediateOperand::INLINE_INT32, 0),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitBitcastInt64ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt64ToFloat64(node_t node) {
   VisitRR(this, kLoong64BitcastLD, node);
 }
 
-void InstructionSelector::VisitFloat32Add(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Add(node_t node) {
   VisitRRR(this, kLoong64Float32Add, node);
 }
 
-void InstructionSelector::VisitFloat64Add(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Add(node_t node) {
   VisitRRR(this, kLoong64Float64Add, node);
 }
 
-void InstructionSelector::VisitFloat32Sub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sub(node_t node) {
   VisitRRR(this, kLoong64Float32Sub, node);
 }
 
-void InstructionSelector::VisitFloat64Sub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sub(node_t node) {
   VisitRRR(this, kLoong64Float64Sub, node);
 }
 
-void InstructionSelector::VisitFloat32Mul(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Mul(node_t node) {
   VisitRRR(this, kLoong64Float32Mul, node);
 }
 
-void InstructionSelector::VisitFloat64Mul(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mul(node_t node) {
   VisitRRR(this, kLoong64Float64Mul, node);
 }
 
-void InstructionSelector::VisitFloat32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Div(node_t node) {
   VisitRRR(this, kLoong64Float32Div, node);
 }
 
-void InstructionSelector::VisitFloat64Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Div(node_t node) {
   VisitRRR(this, kLoong64Float64Div, node);
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Float64Mod, g.DefineAsFixed(node, f0),
-       g.UseFixed(node->InputAt(0), f0), g.UseFixed(node->InputAt(1), f1))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Emit(kLoong64Float64Mod, g.DefineAsFixed(node, f0),
+         g.UseFixed(node->InputAt(0), f0), g.UseFixed(node->InputAt(1), f1))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat32Max(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Float32Max, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Max(node_t node) {
+  VisitRRR(this, kLoong64Float32Max, node);
 }
 
-void InstructionSelector::VisitFloat64Max(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Float64Max, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Max(node_t node) {
+  VisitRRR(this, kLoong64Float64Max, node);
 }
 
-void InstructionSelector::VisitFloat32Min(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Float32Min, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Min(node_t node) {
+  VisitRRR(this, kLoong64Float32Min, node);
 }
 
-void InstructionSelector::VisitFloat64Min(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Float64Min, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Min(node_t node) {
+  VisitRRR(this, kLoong64Float64Min, node);
 }
 
-void InstructionSelector::VisitFloat32Abs(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Abs(node_t node) {
   VisitRR(this, kLoong64Float32Abs, node);
 }
 
-void InstructionSelector::VisitFloat64Abs(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Abs(node_t node) {
   VisitRR(this, kLoong64Float64Abs, node);
 }
 
-void InstructionSelector::VisitFloat32Sqrt(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sqrt(node_t node) {
   VisitRR(this, kLoong64Float32Sqrt, node);
 }
 
-void InstructionSelector::VisitFloat64Sqrt(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sqrt(node_t node) {
   VisitRR(this, kLoong64Float64Sqrt, node);
 }
 
-void InstructionSelector::VisitFloat32RoundDown(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundDown(node_t node) {
   VisitRR(this, kLoong64Float32RoundDown, node);
 }
 
-void InstructionSelector::VisitFloat64RoundDown(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundDown(node_t node) {
   VisitRR(this, kLoong64Float64RoundDown, node);
 }
 
-void InstructionSelector::VisitFloat32RoundUp(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundUp(node_t node) {
   VisitRR(this, kLoong64Float32RoundUp, node);
 }
 
-void InstructionSelector::VisitFloat64RoundUp(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundUp(node_t node) {
   VisitRR(this, kLoong64Float64RoundUp, node);
 }
 
-void InstructionSelector::VisitFloat32RoundTruncate(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTruncate(node_t node) {
   VisitRR(this, kLoong64Float32RoundTruncate, node);
 }
 
-void InstructionSelector::VisitFloat64RoundTruncate(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTruncate(node_t node) {
   VisitRR(this, kLoong64Float64RoundTruncate, node);
 }
 
-void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesAway(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitFloat32RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTiesEven(node_t node) {
   VisitRR(this, kLoong64Float32RoundTiesEven, node);
 }
 
-void InstructionSelector::VisitFloat64RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesEven(node_t node) {
   VisitRR(this, kLoong64Float64RoundTiesEven, node);
 }
 
-void InstructionSelector::VisitFloat32Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Neg(node_t node) {
   VisitRR(this, kLoong64Float32Neg, node);
 }
 
-void InstructionSelector::VisitFloat64Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Neg(node_t node) {
   VisitRR(this, kLoong64Float64Neg, node);
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  Loong64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Binop(
+    Node* node, InstructionCode opcode) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, f0), g.UseFixed(node->InputAt(0), f0),
        g.UseFixed(node->InputAt(1), f1))
       ->MarkAsCall();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  Loong64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Unop(
+    Node* node, InstructionCode opcode) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, f0), g.UseFixed(node->InputAt(0), f0))
       ->MarkAsCall();
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int32_t index) {
-  OperandGenerator g(this);
-  int count = linkage()->GetParameterLocation(index).GetLocation();
-  InstructionOperand out_op = g.TempRegister(-count);
-  Emit(kArchNop, out_op);
-  Emit(kLoong64BitcastLD, g.DefineAsRegister(node), out_op);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node,
+                                                       int32_t index) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    OperandGenerator g(this);
+    int count = linkage()->GetParameterLocation(index).GetLocation();
+    InstructionOperand out_op = g.TempRegister(-count);
+    Emit(kArchNop, out_op);
+    Emit(kLoong64BitcastLD, g.DefineAsRegister(node), out_op);
+  }
 }
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {
   OperandGenerator g(this);
   int count = location.GetLocation();
   InstructionOperand new_op = g.TempRegister(-count);
@@ -1808,58 +2209,66 @@ void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
   *op = new_op;
 }
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  Loong64OperandGenerator g(this);
-
-  // Prepare for C function call.
-  if (call_descriptor->IsCFunctionCall()) {
-    int gp_param_count = static_cast<int>(call_descriptor->GPParameterCount());
-    int fp_param_count = static_cast<int>(call_descriptor->FPParameterCount());
-    Emit(kArchPrepareCallCFunction | ParamField::encode(gp_param_count) |
-             FPParamField::encode(fp_param_count),
-         0, nullptr, 0, nullptr);
-
-    // Poke any stack arguments.
-    int slot = 0;
-    for (PushParameter input : (*arguments)) {
-      Emit(kLoong64Poke, g.NoOutput(), g.UseRegister(input.node),
-           g.TempImmediate(slot << kSystemPointerSizeLog2));
-      ++slot;
-    }
-  } else {
-    int push_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-    if (push_count > 0) {
-      // Calculate needed space
-      int stack_size = 0;
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+
+    // Prepare for C function call.
+    if (call_descriptor->IsCFunctionCall()) {
+      int gp_param_count =
+          static_cast<int>(call_descriptor->GPParameterCount());
+      int fp_param_count =
+          static_cast<int>(call_descriptor->FPParameterCount());
+      Emit(kArchPrepareCallCFunction | ParamField::encode(gp_param_count) |
+               FPParamField::encode(fp_param_count),
+           0, nullptr, 0, nullptr);
+
+      // Poke any stack arguments.
+      int slot = 0;
       for (PushParameter input : (*arguments)) {
-        if (input.node) {
-          stack_size += input.location.GetSizeInPointers();
+        Emit(kLoong64Poke, g.NoOutput(), g.UseRegister(input.node),
+             g.TempImmediate(slot << kSystemPointerSizeLog2));
+        ++slot;
+      }
+    } else {
+      int push_count = static_cast<int>(call_descriptor->ParameterSlotCount());
+      if (push_count > 0) {
+        // Calculate needed space
+        int stack_size = 0;
+        for (PushParameter input : (*arguments)) {
+          if (input.node) {
+            stack_size += input.location.GetSizeInPointers();
+          }
         }
+        Emit(kLoong64StackClaim, g.NoOutput(),
+             g.TempImmediate(stack_size << kSystemPointerSizeLog2));
       }
-      Emit(kLoong64StackClaim, g.NoOutput(),
-           g.TempImmediate(stack_size << kSystemPointerSizeLog2));
-    }
-    for (size_t n = 0; n < arguments->size(); ++n) {
-      PushParameter input = (*arguments)[n];
-      if (input.node) {
-        Emit(kLoong64Poke, g.NoOutput(), g.UseRegister(input.node),
-             g.TempImmediate(static_cast<int>(n << kSystemPointerSizeLog2)));
+      for (size_t n = 0; n < arguments->size(); ++n) {
+        PushParameter input = (*arguments)[n];
+        if (input.node) {
+          Emit(kLoong64Poke, g.NoOutput(), g.UseRegister(input.node),
+               g.TempImmediate(static_cast<int>(n << kSystemPointerSizeLog2)));
+        }
       }
     }
   }
 }
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  Loong64OperandGenerator g(this);
+    node_t node) {
+  Loong64OperandGeneratorT<Adapter> g(this);
 
   for (PushParameter output : *results) {
     if (!output.location.IsCallerFrameSlot()) continue;
     // Skip any alignment holes in nodes.
-    if (output.node != nullptr) {
+    if (this->valid(output.node)) {
       DCHECK(!call_descriptor->IsCFunctionCall());
       if (output.location.GetType() == MachineType::Float32()) {
         MarkAsFloat32(output.node);
@@ -1876,25 +2285,42 @@ void InstructionSelector::EmitPrepareResults(
   }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return false; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return false;
+}
 
-void InstructionSelector::VisitUnalignedLoad(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitUnalignedStore(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedStore(node_t node) {
+  UNREACHABLE();
+}
 
 namespace {
 
 // Shared routine for multiple compare operations.
-static void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                         InstructionOperand left, InstructionOperand right,
-                         FlagsContinuation* cont) {
+template <typename Adapter>
+static void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                         InstructionCode opcode, InstructionOperand left,
+                         InstructionOperand right,
+                         FlagsContinuationT<Adapter>* cont) {
 #ifdef V8_COMPRESS_POINTERS
   if (opcode == kLoong64Cmp32) {
-    Loong64OperandGenerator g(selector);
-    InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()};
+    Loong64OperandGeneratorT<Adapter> g(selector);
     InstructionOperand inputs[] = {left, right};
-    selector->EmitWithContinuation(opcode, 0, nullptr, arraysize(inputs),
-                                   inputs, arraysize(temps), temps, cont);
+    if (right.IsImmediate()) {
+      InstructionOperand temps[1] = {g.TempRegister()};
+      selector->EmitWithContinuation(opcode, 0, nullptr, arraysize(inputs),
+                                     inputs, arraysize(temps), temps, cont);
+    } else {
+      InstructionOperand temps[2] = {g.TempRegister(), g.TempRegister()};
+      selector->EmitWithContinuation(opcode, 0, nullptr, arraysize(inputs),
+                                     inputs, arraysize(temps), temps, cont);
+    }
     return;
   }
 #endif
@@ -1902,38 +2328,51 @@ static void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
 }
 
 // Shared routine for multiple float32 compare operations.
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Loong64OperandGenerator g(selector);
-  Float32BinopMatcher m(node);
-  InstructionOperand lhs, rhs;
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(selector);
+    Float32BinopMatcher m(node);
+    InstructionOperand lhs, rhs;
 
-  lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
-                          : g.UseRegister(m.left().node());
-  rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
-                           : g.UseRegister(m.right().node());
-  VisitCompare(selector, kLoong64Float32Cmp, lhs, rhs, cont);
+    lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
+                            : g.UseRegister(m.left().node());
+    rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
+                             : g.UseRegister(m.right().node());
+    VisitCompare(selector, kLoong64Float32Cmp, lhs, rhs, cont);
+  }
 }
 
 // Shared routine for multiple float64 compare operations.
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Loong64OperandGenerator g(selector);
-  Float64BinopMatcher m(node);
-  InstructionOperand lhs, rhs;
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(selector);
+    Float64BinopMatcher m(node);
+    InstructionOperand lhs, rhs;
 
-  lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
-                          : g.UseRegister(m.left().node());
-  rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
-                           : g.UseRegister(m.right().node());
-  VisitCompare(selector, kLoong64Float64Cmp, lhs, rhs, cont);
+    lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
+                            : g.UseRegister(m.left().node());
+    rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
+                             : g.UseRegister(m.right().node());
+    VisitCompare(selector, kLoong64Float64Cmp, lhs, rhs, cont);
+  }
 }
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont,
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector, Node* node,
+                      InstructionCode opcode, FlagsContinuationT<Adapter>* cont,
                       bool commutative) {
-  Loong64OperandGenerator g(selector);
+  Loong64OperandGeneratorT<Adapter> g(selector);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
 
@@ -1961,14 +2400,17 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
           break;
         case kSignedLessThan:
         case kSignedGreaterThanOrEqual:
+        case kSignedLessThanOrEqual:
+        case kSignedGreaterThan:
         case kUnsignedLessThan:
         case kUnsignedGreaterThanOrEqual:
+        case kUnsignedLessThanOrEqual:
+        case kUnsignedGreaterThan:
           VisitCompare(selector, opcode, g.UseUniqueRegister(left),
                        g.UseImmediate(right), cont);
           break;
         default:
-          VisitCompare(selector, opcode, g.UseUniqueRegister(left),
-                       g.UseUniqueRegister(right), cont);
+          UNREACHABLE();
       }
     }
   } else if (g.CanBeImmediate(left, opcode)) {
@@ -1990,14 +2432,17 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
           break;
         case kSignedLessThan:
         case kSignedGreaterThanOrEqual:
+        case kSignedLessThanOrEqual:
+        case kSignedGreaterThan:
         case kUnsignedLessThan:
         case kUnsignedGreaterThanOrEqual:
+        case kUnsignedLessThanOrEqual:
+        case kUnsignedGreaterThan:
           VisitCompare(selector, opcode, g.UseUniqueRegister(right),
                        g.UseImmediate(left), cont);
           break;
         default:
-          VisitCompare(selector, opcode, g.UseUniqueRegister(right),
-                       g.UseUniqueRegister(left), cont);
+          UNREACHABLE();
       }
     }
   } else {
@@ -2006,18 +2451,21 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitOptimizedWord32Compare(InstructionSelector* selector, Node* node,
-                                 InstructionCode opcode,
-                                 FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitOptimizedWord32Compare(InstructionSelectorT<Adapter>* selector,
+                                 Node* node, InstructionCode opcode,
+                                 FlagsContinuationT<Adapter>* cont) {
   // TODO(LOONG_dev): LOONG64 Add check for debug mode
   VisitWordCompare(selector, node, opcode, cont, false);
 }
 
 #ifdef USE_SIMULATOR
 // Shared routine for multiple word compare operations.
-void VisitFullWord32Compare(InstructionSelector* selector, Node* node,
-                            InstructionCode opcode, FlagsContinuation* cont) {
-  Loong64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitFullWord32Compare(InstructionSelectorT<Adapter>* selector, Node* node,
+                            InstructionCode opcode,
+                            FlagsContinuationT<Adapter>* cont) {
+  Loong64OperandGeneratorT<Adapter> g(selector);
   InstructionOperand leftOp = g.TempRegister();
   InstructionOperand rightOp = g.TempRegister();
 
@@ -2030,33 +2478,41 @@ void VisitFullWord32Compare(InstructionSelector* selector, Node* node,
 }
 #endif
 
-void VisitWord32Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
-  // LOONG64 doesn't support Word32 compare instructions. Instead it relies
-  // that the values in registers are correctly sign-extended and uses
-  // Word64 comparison instead.
+template <typename Adapter>
+void VisitWord32Compare(InstructionSelectorT<Adapter>* selector,
+                        typename Adapter::node_t node,
+                        FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // LOONG64 doesn't support Word32 compare instructions. Instead it relies
+    // that the values in registers are correctly sign-extended and uses
+    // Word64 comparison instead.
 #ifdef USE_SIMULATOR
-  // When call to a host function in simulator, if the function return a
-  // int32 value, the simulator do not sign-extended to int64 because in
-  // simulator we do not know the function whether return a int32 or int64.
-  // so we need do a full word32 compare in this case.
-  if (node->InputAt(0)->opcode() == IrOpcode::kCall ||
-      node->InputAt(1)->opcode() == IrOpcode::kCall) {
-    VisitFullWord32Compare(selector, node, kLoong64Cmp64, cont);
-    return;
-  }
+    // When call to a host function in simulator, if the function return a
+    // int32 value, the simulator do not sign-extended to int64 because in
+    // simulator we do not know the function whether return a int32 or int64.
+    // so we need do a full word32 compare in this case.
+    if (node->InputAt(0)->opcode() == IrOpcode::kCall ||
+        node->InputAt(1)->opcode() == IrOpcode::kCall) {
+      VisitFullWord32Compare(selector, node, kLoong64Cmp64, cont);
+      return;
+    }
 #endif
-  VisitOptimizedWord32Compare(selector, node, kLoong64Cmp32, cont);
+    VisitOptimizedWord32Compare(selector, node, kLoong64Cmp32, cont);
+  }
 }
 
-void VisitWord64Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWord64Compare(InstructionSelectorT<Adapter>* selector, Node* node,
+                        FlagsContinuationT<Adapter>* cont) {
   VisitWordCompare(selector, node, kLoong64Cmp64, cont, false);
 }
 
-void VisitAtomicLoad(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicLoad(InstructionSelectorT<Adapter>* selector, Node* node,
                      AtomicWidth width) {
-  Loong64OperandGenerator g(selector);
+  Loong64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -2120,9 +2576,15 @@ void VisitAtomicLoad(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitAtomicStore(InstructionSelector* selector, Node* node,
-                      AtomicWidth width) {
-  Loong64OperandGenerator g(selector);
+template <typename T>
+void VisitAtomicStore(InstructionSelectorT<TurboshaftAdapter>*, T,
+                      AtomicWidth) {
+  UNIMPLEMENTED();
+}
+
+void VisitAtomicStore(InstructionSelectorT<TurbofanAdapter>* selector,
+                      Node* node, AtomicWidth width) {
+  Loong64OperandGeneratorT<TurbofanAdapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2197,9 +2659,10 @@ void VisitAtomicStore(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitAtomicExchange(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicExchange(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode, AtomicWidth width) {
-  Loong64OperandGenerator g(selector);
+  Loong64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2221,9 +2684,11 @@ void VisitAtomicExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, input_count, inputs, 3, temp);
 }
 
-void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
-                                ArchOpcode opcode, AtomicWidth width) {
-  Loong64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitAtomicCompareExchange(InstructionSelectorT<Adapter>* selector,
+                                Node* node, ArchOpcode opcode,
+                                AtomicWidth width) {
+  Loong64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -2247,9 +2712,10 @@ void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, input_count, inputs, 3, temp);
 }
 
-void VisitAtomicBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                       ArchOpcode opcode, AtomicWidth width) {
-  Loong64OperandGenerator g(selector);
+  Loong64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2274,13 +2740,26 @@ void VisitAtomicBinop(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuationT<Adapter>* cont) {
+  StackCheckKind kind;
+  node_t value;
+  if constexpr (Adapter::IsTurboshaft) {
+    const auto& op =
+        this->turboshaft_graph()
+            ->Get(node)
+            .template Cast<turboshaft::StackPointerGreaterThanOp>();
+    kind = op.kind;
+    value = op.stack_limit();
+  } else {
+    kind = StackCheckKindOf(node->op());
+    value = node->InputAt(0);
+  }
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
-  Loong64OperandGenerator g(this);
+  Loong64OperandGeneratorT<Adapter> g(this);
 
   // No outputs.
   InstructionOperand* const outputs = nullptr;
@@ -2296,7 +2775,6 @@ void InstructionSelector::VisitStackPointerGreaterThan(
                                  ? OperandGenerator::kUniqueRegister
                                  : OperandGenerator::kRegister;
 
-  Node* const value = node->InputAt(0);
   InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
   static constexpr int input_count = arraysize(inputs);
 
@@ -2305,347 +2783,483 @@ void InstructionSelector::VisitStackPointerGreaterThan(
 }
 
 // Shared routine for word comparisons against zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  Loong64OperandGenerator g(this);
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
-    Int32BinopMatcher m(value);
-    if (!m.right().Is(0)) break;
-    user = value;
-    value = m.left().node();
-    cont->Negate();
-  }
-
-  if (CanCover(user, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kWord64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kInt64LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kInt64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kUint64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kUint64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kFloat32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kProjection:
-        // Check if this is the overflow output projection of an
-        // <Operation>WithOverflow node.
-        if (ProjectionIndexOf(value->op()) == 1u) {
-          // We cannot combine the <Operation>WithOverflow with this branch
-          // unless the 0th projection (the use of the actual value of the
-          // <Operation> is either nullptr, which means there's no use of the
-          // actual value, or was already defined, which means it is scheduled
-          // *AFTER* this branch).
-          Node* const node = value->InputAt(0);
-          Node* const result = NodeProperties::FindProjection(node, 0);
-          if (result == nullptr || IsDefined(result)) {
-            switch (node->opcode()) {
-              case IrOpcode::kInt32AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kLoong64Add_d, cont);
-              case IrOpcode::kInt32SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kLoong64Sub_d, cont);
-              case IrOpcode::kInt32MulWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kLoong64MulOvf_w, cont);
-              case IrOpcode::kInt64MulWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kLoong64MulOvf_d, cont);
-              case IrOpcode::kInt64AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kLoong64AddOvf_d, cont);
-              case IrOpcode::kInt64SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kLoong64SubOvf_d, cont);
-              default:
-                break;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
+      Int32BinopMatcher m(value);
+      if (!m.right().Is(0)) break;
+      user = value;
+      value = m.left().node();
+      cont->Negate();
+    }
+
+    if (CanCover(user, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kWord64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kInt64LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kInt64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kUint64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kUint64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kFloat32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kProjection:
+          // Check if this is the overflow output projection of an
+          // <Operation>WithOverflow node.
+          if (ProjectionIndexOf(value->op()) == 1u) {
+            // We cannot combine the <Operation>WithOverflow with this branch
+            // unless the 0th projection (the use of the actual value of the
+            // <Operation> is either nullptr, which means there's no use of the
+            // actual value, or was already defined, which means it is scheduled
+            // *AFTER* this branch).
+            Node* const node = value->InputAt(0);
+            Node* const result = NodeProperties::FindProjection(node, 0);
+            if (result == nullptr || IsDefined(result)) {
+              switch (node->opcode()) {
+                case IrOpcode::kInt32AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kLoong64Add_d, cont);
+                case IrOpcode::kInt32SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kLoong64Sub_d, cont);
+                case IrOpcode::kInt32MulWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kLoong64MulOvf_w, cont);
+                case IrOpcode::kInt64MulWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kLoong64MulOvf_d, cont);
+                case IrOpcode::kInt64AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kLoong64AddOvf_d, cont);
+                case IrOpcode::kInt64SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kLoong64SubOvf_d, cont);
+                default:
+                  break;
+              }
             }
           }
-        }
-        break;
-      case IrOpcode::kWord32And:
-      case IrOpcode::kWord64And:
-        return VisitWordCompare(this, value, kLoong64Tst, cont, true);
-      case IrOpcode::kStackPointerGreaterThan:
-        cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
-        return VisitStackPointerGreaterThan(value, cont);
-      default:
-        break;
+          break;
+        case IrOpcode::kWord32And:
+        case IrOpcode::kWord64And:
+          return VisitWordCompare(this, value, kLoong64Tst, cont, true);
+        case IrOpcode::kStackPointerGreaterThan:
+          cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
+          return VisitStackPointerGreaterThan(value, cont);
+        default:
+          break;
+      }
     }
+
+    // Continuation could not be combined with a compare, emit compare against
+    // 0.
+    VisitCompare(this, kLoong64Cmp32, g.UseRegister(value), g.TempImmediate(0),
+                 cont);
   }
+}
 
-  // Continuation could not be combined with a compare, emit compare against 0.
-  VisitCompare(this, kLoong64Cmp32, g.UseRegister(value), g.TempImmediate(0),
-               cont);
-}
-
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  Loong64OperandGenerator g(this);
-  InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
-
-  // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
-    static const size_t kMaxTableSwitchValueRange = 2 << 16;
-    size_t table_space_cost = 10 + 2 * sw.value_range();
-    size_t table_time_cost = 3;
-    size_t lookup_space_cost = 2 + 2 * sw.case_count();
-    size_t lookup_time_cost = sw.case_count();
-    if (sw.case_count() > 0 &&
-        table_space_cost + 3 * table_time_cost <=
-            lookup_space_cost + 3 * lookup_time_cost &&
-        sw.min_value() > std::numeric_limits<int32_t>::min() &&
-        sw.value_range() <= kMaxTableSwitchValueRange) {
-      InstructionOperand index_operand = value_operand;
-      if (sw.min_value()) {
-        index_operand = g.TempRegister();
-        Emit(kLoong64Sub_w, index_operand, value_operand,
-             g.TempImmediate(sw.min_value()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
+
+    // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
+    if (enable_switch_jump_table_ ==
+        InstructionSelector::kEnableSwitchJumpTable) {
+      static const size_t kMaxTableSwitchValueRange = 2 << 16;
+      size_t table_space_cost = 10 + 2 * sw.value_range();
+      size_t table_time_cost = 3;
+      size_t lookup_space_cost = 2 + 2 * sw.case_count();
+      size_t lookup_time_cost = sw.case_count();
+      if (sw.case_count() > 0 &&
+          table_space_cost + 3 * table_time_cost <=
+              lookup_space_cost + 3 * lookup_time_cost &&
+          sw.min_value() > std::numeric_limits<int32_t>::min() &&
+          sw.value_range() <= kMaxTableSwitchValueRange) {
+        InstructionOperand index_operand = value_operand;
+        if (sw.min_value()) {
+          index_operand = g.TempRegister();
+          Emit(kLoong64Sub_w, index_operand, value_operand,
+               g.TempImmediate(sw.min_value()));
+        }
+        // Generate a table lookup.
+        return EmitTableSwitch(sw, index_operand);
       }
-      // Generate a table lookup.
-      return EmitTableSwitch(sw, index_operand);
     }
-  }
 
-  // Generate a tree of conditional jumps.
-  return EmitBinarySearchSwitch(sw, value_operand);
+    // Generate a tree of conditional jumps.
+    return EmitBinarySearchSwitch(sw, value_operand);
+  }
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(0)) {
-    return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    Int32BinopMatcher m(node);
+    if (m.right().Is(0)) {
+      return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+    }
+    if (isolate() && (V8_STATIC_ROOTS_BOOL ||
+                      (COMPRESS_POINTERS_BOOL && !isolate()->bootstrapper()))) {
+      Loong64OperandGeneratorT<Adapter> g(this);
+      const RootsTable& roots_table = isolate()->roots_table();
+      RootIndex root_index;
+      Node* left = nullptr;
+      Handle<HeapObject> right;
+      // HeapConstants and CompressedHeapConstants can be treated the same when
+      // using them as an input to a 32-bit comparison. Check whether either is
+      // present.
+      {
+        CompressedHeapObjectBinopMatcher m(node);
+        if (m.right().HasResolvedValue()) {
+          left = m.left().node();
+          right = m.right().ResolvedValue();
+        } else {
+          HeapObjectBinopMatcher m2(node);
+          if (m2.right().HasResolvedValue()) {
+            left = m2.left().node();
+            right = m2.right().ResolvedValue();
+          }
+        }
+      }
+      if (!right.is_null() && roots_table.IsRootHandle(right, &root_index)) {
+        DCHECK_NE(left, nullptr);
+        if (RootsTable::IsReadOnly(root_index)) {
+          Tagged_t ptr =
+              MacroAssemblerBase::ReadOnlyRootPtr(root_index, isolate());
+          if (g.CanBeImmediate(ptr, kLoong64Cmp32)) {
+            return VisitCompare(this, kLoong64Cmp32, g.UseRegister(left),
+                                g.TempImmediate(ptr), &cont);
+          }
+        }
+      }
+    }
+    VisitWord32Compare(this, node, &cont);
   }
-
-  VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kLoong64Add_d, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kLoong64Add_d, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kLoong64Add_d, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kLoong64Add_d, &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kLoong64Sub_d, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kLoong64Sub_d, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kLoong64Sub_d, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kLoong64Sub_d, &cont);
 }
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kLoong64MulOvf_w, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kLoong64MulOvf_w, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kLoong64MulOvf_w, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kLoong64MulOvf_w, &cont);
 }
 
-void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kLoong64MulOvf_d, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kLoong64MulOvf_d, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kLoong64MulOvf_d, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kLoong64MulOvf_d, &cont);
 }
 
-void InstructionSelector::VisitInt64AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kLoong64AddOvf_d, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kLoong64AddOvf_d, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kLoong64AddOvf_d, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kLoong64AddOvf_d, &cont);
 }
 
-void InstructionSelector::VisitInt64SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kLoong64SubOvf_d, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kLoong64SubOvf_d, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kLoong64SubOvf_d, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kLoong64SubOvf_d, &cont);
 }
 
-void InstructionSelector::VisitWord64Equal(Node* const node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont =
+        FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont =
+        FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64ExtractLowWord32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64ExtractLowWord32(node_t node) {
   VisitRR(this, kLoong64Float64ExtractLowWord32, node);
 }
 
-void InstructionSelector::VisitFloat64ExtractHighWord32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64ExtractHighWord32(node_t node) {
   VisitRR(this, kLoong64Float64ExtractHighWord32, node);
 }
 
-void InstructionSelector::VisitFloat64SilenceNaN(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64SilenceNaN(node_t node) {
   VisitRR(this, kLoong64Float64SilenceNaN, node);
 }
 
-void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
-  Loong64OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Emit(kLoong64Float64InsertLowWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.UseRegister(right));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    Emit(kLoong64Float64InsertLowWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.UseRegister(right));
+  }
 }
 
-void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
-  Loong64OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Emit(kLoong64Float64InsertHighWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.UseRegister(right));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    Emit(kLoong64Float64InsertHighWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.UseRegister(right));
+  }
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
-  Loong64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
+  Loong64OperandGeneratorT<Adapter> g(this);
   Emit(kLoong64Dbar, g.NoOutput());
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
   VisitAtomicLoad(this, node, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
   VisitAtomicStore(this, node, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicLoad(Node* node) {
   VisitAtomicLoad(this, node, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord64AtomicStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicStore(node_t node) {
   VisitAtomicStore(this, node, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Int8()) {
@@ -2665,7 +3279,8 @@ void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicExchange(Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Uint8()) {
@@ -2682,7 +3297,9 @@ void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Int8()) {
@@ -2702,7 +3319,9 @@ void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
   VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicCompareExchange(
+    Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Uint8()) {
@@ -2718,33 +3337,40 @@ void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
   }
   VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord64);
 }
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
-    Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Int8()) {
-    opcode = int8_op;
-  } else if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Int16()) {
-    opcode = int16_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = word32_op;
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
-  }
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Int8()) {
+      opcode = int8_op;
+    } else if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Int16()) {
+      opcode = int16_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = word32_op;
+    } else {
+      UNREACHABLE();
+    }
 
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32);
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32);
+  }
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                            \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) { \
+    VisitWord32AtomicBinaryOperation(                                     \
+        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16,  \
+        kAtomic##op##Uint16, kAtomic##op##Word32);                        \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -2753,27 +3379,33 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitWord64AtomicBinaryOperation(
-    Node* node, ArchOpcode uint8_op, ArchOpcode uint16_op, ArchOpcode uint32_op,
-    ArchOpcode uint64_op) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Uint32()) {
-    opcode = uint32_op;
-  } else if (type == MachineType::Uint64()) {
-    opcode = uint64_op;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicBinaryOperation(
+    node_t node, ArchOpcode uint8_op, ArchOpcode uint16_op,
+    ArchOpcode uint32_op, ArchOpcode uint64_op) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Uint32()) {
+      opcode = uint32_op;
+    } else if (type == MachineType::Uint64()) {
+      opcode = uint64_op;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64);
   }
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64);
 }
 
 #define VISIT_ATOMIC_BINOP(op)                                                 \
-  void InstructionSelector::VisitWord64Atomic##op(Node* node) {                \
+  template <typename Adapter>                                                  \
+  void InstructionSelectorT<Adapter>::VisitWord64Atomic##op(Node* node) {      \
     VisitWord64AtomicBinaryOperation(node, kAtomic##op##Uint8,                 \
                                      kAtomic##op##Uint16, kAtomic##op##Word32, \
                                      kLoong64Word64Atomic##op##Uint64);        \
@@ -2785,11 +3417,13 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
@@ -2968,8 +3602,9 @@ void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
   V(S128Xor, kLoong64S128Xor)                             \
   V(S128AndNot, kLoong64S128AndNot)
 
-void InstructionSelector::VisitS128Const(Node* node) {
-  Loong64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  Loong64OperandGeneratorT<Adapter> g(this);
   static const int kUint32Immediates = kSimd128Size / sizeof(uint32_t);
   uint32_t val[kUint32Immediates];
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
@@ -2988,21 +3623,25 @@ void InstructionSelector::VisitS128Const(Node* node) {
   }
 }
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  Loong64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  Loong64OperandGeneratorT<Adapter> g(this);
   Emit(kLoong64S128Zero, g.DefineAsRegister(node));
 }
 
-#define SIMD_VISIT_SPLAT(Type)                               \
-  void InstructionSelector::Visit##Type##Splat(Node* node) { \
-    VisitRR(this, kLoong64##Type##Splat, node);              \
+#define SIMD_VISIT_SPLAT(Type)                                         \
+  template <typename Adapter>                                          \
+  void InstructionSelectorT<Adapter>::Visit##Type##Splat(Node* node) { \
+    VisitRR(this, kLoong64##Type##Splat, node);                        \
   }
 SIMD_TYPE_LIST(SIMD_VISIT_SPLAT)
 #undef SIMD_VISIT_SPLAT
 
-#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                              \
-  void InstructionSelector::Visit##Type##ExtractLane##Sign(Node* node) { \
-    VisitRRI(this, kLoong64##Type##ExtractLane##Sign, node);             \
+#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                           \
+  template <typename Adapter>                                         \
+  void InstructionSelectorT<Adapter>::Visit##Type##ExtractLane##Sign( \
+      Node* node) {                                                   \
+    VisitRRI(this, kLoong64##Type##ExtractLane##Sign, node);          \
   }
 SIMD_VISIT_EXTRACT_LANE(F64x2, )
 SIMD_VISIT_EXTRACT_LANE(F32x4, )
@@ -3014,51 +3653,60 @@ SIMD_VISIT_EXTRACT_LANE(I8x16, U)
 SIMD_VISIT_EXTRACT_LANE(I8x16, S)
 #undef SIMD_VISIT_EXTRACT_LANE
 
-#define SIMD_VISIT_REPLACE_LANE(Type)                              \
-  void InstructionSelector::Visit##Type##ReplaceLane(Node* node) { \
-    VisitRRIR(this, kLoong64##Type##ReplaceLane, node);            \
+#define SIMD_VISIT_REPLACE_LANE(Type)                                        \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##ReplaceLane(Node* node) { \
+    VisitRRIR(this, kLoong64##Type##ReplaceLane, node);                      \
   }
 SIMD_TYPE_LIST(SIMD_VISIT_REPLACE_LANE)
 #undef SIMD_VISIT_REPLACE_LANE
 
-#define SIMD_VISIT_UNOP(Name, instruction)            \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, instruction, node);                 \
+#define SIMD_VISIT_UNOP(Name, instruction)                      \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRR(this, instruction, node);                           \
   }
 SIMD_UNOP_LIST(SIMD_VISIT_UNOP)
 #undef SIMD_VISIT_UNOP
 
-#define SIMD_VISIT_SHIFT_OP(Name)                     \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitSimdShift(this, kLoong64##Name, node);       \
+#define SIMD_VISIT_SHIFT_OP(Name)                               \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitSimdShift(this, kLoong64##Name, node);                 \
   }
 SIMD_SHIFT_OP_LIST(SIMD_VISIT_SHIFT_OP)
 #undef SIMD_VISIT_SHIFT_OP
 
-#define SIMD_VISIT_BINOP(Name, instruction)           \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRR(this, instruction, node);                \
+#define SIMD_VISIT_BINOP(Name, instruction)                     \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRRR(this, instruction, node);                          \
   }
 SIMD_BINOP_LIST(SIMD_VISIT_BINOP)
 #undef SIMD_VISIT_BINOP
 
-void InstructionSelector::VisitS128Select(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
   VisitRRRR(this, kLoong64S128Select, node);
 }
 
-void InstructionSelector::VisitI8x16RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI16x8RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI32x4RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
-void InstructionSelector::VisitI64x2RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2RelaxedLaneSelect(Node* node) {
   VisitS128Select(node);
 }
 
@@ -3070,8 +3718,11 @@ void InstructionSelector::VisitI64x2RelaxedLaneSelect(Node* node) {
   V(I16x8DotI8x16I7x16S)      \
   V(I32x4DotI8x16I7x16AddS)
 
-#define SIMD_VISIT_UNIMP_OP(Name) \
-  void InstructionSelector::Visit##Name(Node* node) { UNIMPLEMENTED(); }
+#define SIMD_VISIT_UNIMP_OP(Name)                               \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    UNIMPLEMENTED();                                            \
+  }
 SIMD_UNIMP_OP_LIST(SIMD_VISIT_UNIMP_OP)
 
 #undef SIMD_VISIT_UNIMP_OP
@@ -3157,7 +3808,8 @@ bool TryMatchArchShuffle(const uint8_t* shuffle, const ShuffleEntry* table,
 
 }  // namespace
 
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
@@ -3171,7 +3823,7 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
   Node* input0 = node->InputAt(0);
   Node* input1 = node->InputAt(1);
   uint8_t offset;
-  Loong64OperandGenerator g(this);
+  Loong64OperandGeneratorT<Adapter> g(this);
   if (wasm::SimdShuffle::TryMatchConcat(shuffle, &offset)) {
     Emit(kLoong64S8x16Concat, g.DefineSameAsFirst(node), g.UseRegister(input1),
          g.UseRegister(input0), g.UseImmediate(offset));
@@ -3191,11 +3843,15 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
        g.UseImmediate(wasm::SimdShuffle::Pack4Lanes(shuffle + 12)));
 }
 #else
-void InstructionSelector::VisitI8x16Shuffle(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
+  UNREACHABLE();
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void InstructionSelector::VisitI8x16Swizzle(Node* node) {
-  Loong64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
+  Loong64OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   // We don't want input 0 or input 1 to be the same as output, since we will
   // modify output before do the calculation.
@@ -3204,55 +3860,64 @@ void InstructionSelector::VisitI8x16Swizzle(Node* node) {
        g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt32(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Ext_w_b, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt32(node_t node) {
+  VisitRR(this, kLoong64Ext_w_b, node);
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt32(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Ext_w_h, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt32(node_t node) {
+  VisitRR(this, kLoong64Ext_w_h, node);
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt64(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Ext_w_b, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt64(node_t node) {
+  VisitRR(this, kLoong64Ext_w_b, node);
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt64(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Ext_w_h, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt64(node_t node) {
+  VisitRR(this, kLoong64Ext_w_h, node);
 }
 
-void InstructionSelector::VisitSignExtendWord32ToInt64(Node* node) {
-  Loong64OperandGenerator g(this);
-  Emit(kLoong64Sll_w, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
-       g.TempImmediate(0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Loong64OperandGeneratorT<Adapter> g(this);
+    Emit(kLoong64Sll_w, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.TempImmediate(0));
+  }
 }
 
-void InstructionSelector::VisitF32x4Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmin(Node* node) {
   VisitUniqueRRR(this, kLoong64F32x4Pmin, node);
 }
 
-void InstructionSelector::VisitF32x4Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmax(Node* node) {
   VisitUniqueRRR(this, kLoong64F32x4Pmax, node);
 }
 
-void InstructionSelector::VisitF64x2Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmin(Node* node) {
   VisitUniqueRRR(this, kLoong64F64x2Pmin, node);
 }
 
-void InstructionSelector::VisitF64x2Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmax(Node* node) {
   VisitUniqueRRR(this, kLoong64F64x2Pmax, node);
 }
 
-#define VISIT_EXT_MUL(OPCODE1, OPCODE2)                                       \
-  void InstructionSelector::Visit##OPCODE1##ExtMulLow##OPCODE2(Node* node) {} \
-  void InstructionSelector::Visit##OPCODE1##ExtMulHigh##OPCODE2(Node* node) {}
+#define VISIT_EXT_MUL(OPCODE1, OPCODE2)                                    \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE1##ExtMulLow##OPCODE2(  \
+      Node* node) {}                                                       \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE1##ExtMulHigh##OPCODE2( \
+      Node* node) {}
 
 VISIT_EXT_MUL(I64x2, I32x4S)
 VISIT_EXT_MUL(I64x2, I32x4U)
@@ -3262,11 +3927,12 @@ VISIT_EXT_MUL(I16x8, I8x16S)
 VISIT_EXT_MUL(I16x8, I8x16U)
 #undef VISIT_EXT_MUL
 
-#define VISIT_EXTADD_PAIRWISE(OPCODE)                      \
-  void InstructionSelector::Visit##OPCODE(Node* node) {    \
-    Loong64OperandGenerator g(this);                       \
-    Emit(kLoong64ExtAddPairwise, g.DefineAsRegister(node), \
-         g.UseRegister(node->InputAt(0)));                 \
+#define VISIT_EXTADD_PAIRWISE(OPCODE)                             \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE(Node* node) { \
+    Loong64OperandGeneratorT<Adapter> g(this);                    \
+    Emit(kLoong64ExtAddPairwise, g.DefineAsRegister(node),        \
+         g.UseRegister(node->InputAt(0)));                        \
   }
 VISIT_EXTADD_PAIRWISE(I16x8ExtAddPairwiseI8x16S)
 VISIT_EXTADD_PAIRWISE(I16x8ExtAddPairwiseI8x16U)
@@ -3274,12 +3940,25 @@ VISIT_EXTADD_PAIRWISE(I32x4ExtAddPairwiseI16x8S)
 VISIT_EXTADD_PAIRWISE(I32x4ExtAddPairwiseI16x8U)
 #undef VISIT_EXTADD_PAIRWISE
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGenerator* g, int first_input_index, node_t node) {
   UNREACHABLE();
 }
 
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
+
+template <>
+TurboshaftAdapter::node_t
+InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    node_t node, size_t projection_index) {
+  UNIMPLEMENTED();
+}
+
 // static
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
@@ -3304,6 +3983,11 @@ InstructionSelector::AlignmentRequirements() {
       FullUnalignedAccessSupport();
 }
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 #undef SIMD_BINOP_LIST
 #undef SIMD_SHIFT_OP_LIST
 #undef SIMD_UNOP_LIST
diff --git a/deps/v8/src/compiler/backend/mips64/code-generator-mips64.cc b/deps/v8/src/compiler/backend/mips64/code-generator-mips64.cc
index 5b1ac3963a80e6..dd482cc6956e8f 100644
--- a/deps/v8/src/compiler/backend/mips64/code-generator-mips64.cc
+++ b/deps/v8/src/compiler/backend/mips64/code-generator-mips64.cc
@@ -553,8 +553,7 @@ void CodeGenerator::AssembleCodeStartRegisterCheck() {
 void CodeGenerator::BailoutIfDeoptimized() {
   int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
   __ Ld(kScratchReg, MemOperand(kJavaScriptCallCodeStartRegister, offset));
-  __ Lhu(kScratchReg,
-         FieldMemOperand(kScratchReg, Code::kKindSpecificFlagsOffset));
+  __ Lwu(kScratchReg, FieldMemOperand(kScratchReg, Code::kFlagsOffset));
   __ And(kScratchReg, kScratchReg,
          Operand(1 << Code::kMarkedForDeoptimizationBit));
   __ Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
@@ -585,7 +584,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchCallBuiltinPointer: {
       DCHECK(!instr->InputAt(0)->IsImmediate());
       Register builtin_index = i.InputRegister(0);
-      __ CallBuiltinByIndex(builtin_index);
+      Register target =
+          instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister)
+              ? kJavaScriptCallCodeStartRegister
+              : builtin_index;
+      __ CallBuiltinByIndex(builtin_index, target);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -651,9 +654,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ Assert(eq, AbortReason::kWrongFunctionContext, cp,
                   Operand(kScratchReg));
       }
-      static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-      __ Ld(a2, FieldMemOperand(func, JSFunction::kCodeOffset));
-      __ CallCodeObject(a2);
+      __ CallJSFunction(func);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -849,6 +850,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier:
+      UNREACHABLE();
     case kArchStackSlot: {
       FrameOffset offset =
           frame_access_state()->GetFrameOffset(i.InputInt32(0));
@@ -3933,32 +3936,16 @@ void CodeGenerator::AssembleArchTrap(Instruction* instr,
 
    private:
     void GenerateCallToTrap(TrapId trap_id) {
-      if (trap_id == TrapId::kInvalid) {
-        // We cannot test calls to the runtime in cctest/test-run-wasm.
-        // Therefore we emit a call to C here instead of a call to the runtime.
-        // We use the context register as the scratch register, because we do
-        // not have a context here.
-        __ PrepareCallCFunction(0, 0, cp);
-        __ CallCFunction(
-            ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-        __ LeaveFrame(StackFrame::WASM);
-        auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-        int pop_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-        pop_count += (pop_count & 1);  // align
-        __ Drop(pop_count);
-        __ Ret();
-      } else {
-        gen_->AssembleSourcePosition(instr_);
-        // A direct call to a wasm runtime stub defined in this module.
-        // Just encode the stub index. This will be patched when the code
-        // is added to the native module and copied into wasm code space.
-        __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-        ReferenceMap* reference_map =
-            gen_->zone()->New<ReferenceMap>(gen_->zone());
-        gen_->RecordSafepoint(reference_map);
-        if (v8_flags.debug_code) {
-          __ stop();
-        }
+      gen_->AssembleSourcePosition(instr_);
+      // A direct call to a wasm runtime stub defined in this module.
+      // Just encode the stub index. This will be patched when the code
+      // is added to the native module and copied into wasm code space.
+      __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+      ReferenceMap* reference_map =
+          gen_->zone()->New<ReferenceMap>(gen_->zone());
+      gen_->RecordSafepoint(reference_map);
+      if (v8_flags.debug_code) {
+        __ stop();
       }
     }
     Instruction* instr_;
@@ -4011,88 +3998,7 @@ void CodeGenerator::AssembleArchBoolean(Instruction* instr,
     __ Sgtu(result, kScratchReg, zero_reg);
   } else if (instr->arch_opcode() == kMips64Cmp) {
     Condition cc = FlagsConditionToConditionCmp(condition);
-    switch (cc) {
-      case eq:
-      case ne: {
-        Register left = i.InputRegister(0);
-        Operand right = i.InputOperand(1);
-        if (instr->InputAt(1)->IsImmediate()) {
-          if (is_int16(-right.immediate())) {
-            if (right.immediate() == 0) {
-              if (cc == eq) {
-                __ Sltu(result, left, 1);
-              } else {
-                __ Sltu(result, zero_reg, left);
-              }
-            } else {
-              __ Daddu(result, left, Operand(-right.immediate()));
-              if (cc == eq) {
-                __ Sltu(result, result, 1);
-              } else {
-                __ Sltu(result, zero_reg, result);
-              }
-            }
-          } else {
-            if (is_uint16(right.immediate())) {
-              __ Xor(result, left, right);
-            } else {
-              __ li(kScratchReg, right);
-              __ Xor(result, left, kScratchReg);
-            }
-            if (cc == eq) {
-              __ Sltu(result, result, 1);
-            } else {
-              __ Sltu(result, zero_reg, result);
-            }
-          }
-        } else {
-          __ Xor(result, left, right);
-          if (cc == eq) {
-            __ Sltu(result, result, 1);
-          } else {
-            __ Sltu(result, zero_reg, result);
-          }
-        }
-      } break;
-      case lt:
-      case ge: {
-        Register left = i.InputRegister(0);
-        Operand right = i.InputOperand(1);
-        __ Slt(result, left, right);
-        if (cc == ge) {
-          __ xori(result, result, 1);
-        }
-      } break;
-      case gt:
-      case le: {
-        Register left = i.InputRegister(1);
-        Operand right = i.InputOperand(0);
-        __ Slt(result, left, right);
-        if (cc == le) {
-          __ xori(result, result, 1);
-        }
-      } break;
-      case lo:
-      case hs: {
-        Register left = i.InputRegister(0);
-        Operand right = i.InputOperand(1);
-        __ Sltu(result, left, right);
-        if (cc == hs) {
-          __ xori(result, result, 1);
-        }
-      } break;
-      case hi:
-      case ls: {
-        Register left = i.InputRegister(1);
-        Operand right = i.InputOperand(0);
-        __ Sltu(result, left, right);
-        if (cc == ls) {
-          __ xori(result, result, 1);
-        }
-      } break;
-      default:
-        UNREACHABLE();
-    }
+    __ CompareWord(cc, result, i.InputRegister(0), i.InputOperand(1));
     return;
   } else if (instr->arch_opcode() == kMips64CmpD ||
              instr->arch_opcode() == kMips64CmpS) {
@@ -4147,7 +4053,13 @@ void CodeGenerator::AssembleArchBinarySearchSwitch(Instruction* instr) {
   for (size_t index = 2; index < instr->InputCount(); index += 2) {
     cases.push_back({i.InputInt32(index + 0), GetLabel(i.InputRpo(index + 1))});
   }
-  AssembleArchBinarySearchSwitchRange(input, i.InputRpo(1), cases.data(),
+
+  UseScratchRegisterScope temps(masm());
+  Register scratch = temps.Acquire();
+  // The input register may contains dirty data in upper 32 bits, explicitly
+  // sign-extend it here.
+  __ sll(scratch, input, 0);
+  AssembleArchBinarySearchSwitchRange(scratch, i.InputRpo(1), cases.data(),
                                       cases.data() + cases.size());
 }
 
@@ -4156,8 +4068,13 @@ void CodeGenerator::AssembleArchTableSwitch(Instruction* instr) {
   Register input = i.InputRegister(0);
   size_t const case_count = instr->InputCount() - 2;
 
-  __ Branch(GetLabel(i.InputRpo(1)), hs, input, Operand(case_count));
-  __ GenerateSwitchTable(input, case_count, [&i, this](size_t index) {
+  UseScratchRegisterScope temps(masm());
+  Register scratch = temps.Acquire();
+  // The input register may contains dirty data in upper 32 bits, explicitly
+  // sign-extend it here.
+  __ sll(scratch, input, 0);
+  __ Branch(GetLabel(i.InputRpo(1)), hs, scratch, Operand(case_count));
+  __ GenerateSwitchTable(scratch, case_count, [&i, this](size_t index) {
     return GetLabel(i.InputRpo(index + 2));
   });
 }
@@ -4428,11 +4345,12 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
   MipsOperandConverter g(this, nullptr);
-  int new_slots = ElementSizeInPointers(rep);
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = ElementSizeInPointers(rep);
   if (dest->IsRegister()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ Pop(g.ToRegister(dest));
   } else if (dest->IsStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     UseScratchRegisterScope temps(masm());
     Register scratch = temps.Acquire();
     __ Pop(scratch);
@@ -4441,12 +4359,13 @@ void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ Daddu(sp, sp, Operand(new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ Daddu(sp, sp, Operand(dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
@@ -4534,6 +4453,24 @@ void CodeGenerator::SetPendingMove(MoveOperands* move) {
   }
 }
 
+namespace {
+
+bool Is32BitOperand(InstructionOperand* operand) {
+  DCHECK(operand->IsStackSlot() || operand->IsRegister());
+  MachineRepresentation mr = LocationOperand::cast(operand)->representation();
+  return mr == MachineRepresentation::kWord32 ||
+         mr == MachineRepresentation::kCompressed ||
+         mr == MachineRepresentation::kCompressedPointer;
+}
+
+// When we need only 32 bits, move only 32 bits, otherwise the destination
+// register' upper 32 bits may contain dirty data.
+bool Use32BitMove(InstructionOperand* source, InstructionOperand* destination) {
+  return Is32BitOperand(source) && Is32BitOperand(destination);
+}
+
+}  // namespace
+
 void CodeGenerator::AssembleMove(InstructionOperand* source,
                                  InstructionOperand* destination) {
   MipsOperandConverter g(this, nullptr);
@@ -4551,7 +4488,11 @@ void CodeGenerator::AssembleMove(InstructionOperand* source,
     DCHECK(destination->IsRegister() || destination->IsStackSlot());
     MemOperand src = g.ToMemOperand(source);
     if (destination->IsRegister()) {
-      __ Ld(g.ToRegister(destination), src);
+      if (Use32BitMove(source, destination)) {
+        __ Lw(g.ToRegister(destination), src);
+      } else {
+        __ Ld(g.ToRegister(destination), src);
+      }
     } else {
       Register temp = kScratchReg;
       __ Ld(temp, src);
diff --git a/deps/v8/src/compiler/backend/mips64/instruction-selector-mips64.cc b/deps/v8/src/compiler/backend/mips64/instruction-selector-mips64.cc
index 70d19dc4c18224..ecc15861438e1f 100644
--- a/deps/v8/src/compiler/backend/mips64/instruction-selector-mips64.cc
+++ b/deps/v8/src/compiler/backend/mips64/instruction-selector-mips64.cc
@@ -3,10 +3,12 @@
 // found in the LICENSE file.
 
 #include "src/base/bits.h"
+#include "src/base/logging.h"
 #include "src/codegen/machine-type.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
+#include "src/compiler/turboshaft/operations.h"
 
 namespace v8 {
 namespace internal {
@@ -18,10 +20,14 @@ namespace compiler {
 #define TRACE() PrintF("instr_sel: %s at line %d\n", __FUNCTION__, __LINE__)
 
 // Adds Mips-specific methods for generating InstructionOperands.
-class Mips64OperandGenerator final : public OperandGenerator {
+template <typename Adapter>
+class Mips64OperandGeneratorT final : public OperandGeneratorT<Adapter> {
  public:
-  explicit Mips64OperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit Mips64OperandGeneratorT<Adapter>(
+      InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
 
   InstructionOperand UseOperand(Node* node, InstructionCode opcode) {
     if (CanBeImmediate(node, opcode)) {
@@ -118,24 +124,31 @@ class Mips64OperandGenerator final : public OperandGenerator {
   }
 };
 
-static void VisitRR(InstructionSelector* selector, ArchOpcode opcode,
-                    Node* node) {
-  Mips64OperandGenerator g(selector);
+static void VisitRR(InstructionSelectorT<TurbofanAdapter>* selector,
+                    ArchOpcode opcode, Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)));
 }
 
-static void VisitRRI(InstructionSelector* selector, ArchOpcode opcode,
+template <typename T>
+void VisitRR(InstructionSelectorT<TurboshaftAdapter>*, ArchOpcode, T) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+static void VisitRRI(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
                      Node* node) {
-  Mips64OperandGenerator g(selector);
+  Mips64OperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm));
 }
 
-static void VisitSimdShift(InstructionSelector* selector, ArchOpcode opcode,
-                           Node* node) {
-  Mips64OperandGenerator g(selector);
+template <typename Adapter>
+static void VisitSimdShift(InstructionSelectorT<Adapter>* selector,
+                           ArchOpcode opcode, Node* node) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   if (g.IsIntegerConstant(node->InputAt(1))) {
     selector->Emit(opcode, g.DefineAsRegister(node),
                    g.UseRegister(node->InputAt(0)),
@@ -147,48 +160,63 @@ static void VisitSimdShift(InstructionSelector* selector, ArchOpcode opcode,
   }
 }
 
-static void VisitRRIR(InstructionSelector* selector, ArchOpcode opcode,
-                      Node* node) {
-  Mips64OperandGenerator g(selector);
+template <typename Adapter>
+static void VisitRRIR(InstructionSelectorT<Adapter>* selector,
+                      ArchOpcode opcode, Node* node) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm),
                  g.UseRegister(node->InputAt(1)));
 }
 
-static void VisitRRR(InstructionSelector* selector, ArchOpcode opcode,
-                     Node* node) {
-  Mips64OperandGenerator g(selector);
+static void VisitRRR(InstructionSelectorT<TurbofanAdapter>* selector,
+                     ArchOpcode opcode, Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
 }
 
-static void VisitUniqueRRR(InstructionSelector* selector, ArchOpcode opcode,
-                           Node* node) {
-  Mips64OperandGenerator g(selector);
+template <typename T>
+void VisitRRR(InstructionSelectorT<TurboshaftAdapter>*, ArchOpcode, T) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+static void VisitUniqueRRR(InstructionSelectorT<Adapter>* selector,
+                           ArchOpcode opcode, Node* node) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseUniqueRegister(node->InputAt(0)),
                  g.UseUniqueRegister(node->InputAt(1)));
 }
 
-void VisitRRRR(InstructionSelector* selector, ArchOpcode opcode, Node* node) {
-  Mips64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitRRRR(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+               Node* node) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   selector->Emit(
       opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)),
       g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2)));
 }
 
-static void VisitRRO(InstructionSelector* selector, ArchOpcode opcode,
-                     Node* node) {
-  Mips64OperandGenerator g(selector);
-  selector->Emit(opcode, g.DefineAsRegister(node),
-                 g.UseRegister(node->InputAt(0)),
-                 g.UseOperand(node->InputAt(1), opcode));
+template <typename Adapter>
+static void VisitRRO(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+                     typename Adapter::node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(selector);
+    selector->Emit(opcode, g.DefineAsRegister(node),
+                   g.UseRegister(node->InputAt(0)),
+                   g.UseOperand(node->InputAt(1), opcode));
+  }
 }
 
+template <typename Adapter>
 struct ExtendingLoadMatcher {
-  ExtendingLoadMatcher(Node* node, InstructionSelector* selector)
+  ExtendingLoadMatcher(Node* node, InstructionSelectorT<Adapter>* selector)
       : matches_(false), selector_(selector), base_(nullptr), immediate_(0) {
     Initialize(node);
   }
@@ -210,7 +238,7 @@ struct ExtendingLoadMatcher {
 
  private:
   bool matches_;
-  InstructionSelector* selector_;
+  InstructionSelectorT<Adapter>* selector_;
   Node* base_;
   int64_t immediate_;
   ArchOpcode opcode_;
@@ -235,7 +263,7 @@ struct ExtendingLoadMatcher {
         return;
       }
 
-      Mips64OperandGenerator g(selector_);
+      Mips64OperandGeneratorT<Adapter> g(selector_);
       Node* load = m.left().node();
       Node* offset = load->InputAt(1);
       base_ = load->InputAt(0);
@@ -252,10 +280,11 @@ struct ExtendingLoadMatcher {
   }
 };
 
-bool TryEmitExtendingLoad(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+bool TryEmitExtendingLoad(InstructionSelectorT<Adapter>* selector, Node* node,
                           Node* output_node) {
-  ExtendingLoadMatcher m(node, selector);
-  Mips64OperandGenerator g(selector);
+  ExtendingLoadMatcher<Adapter> m(node, selector);
+  Mips64OperandGeneratorT<Adapter> g(selector);
   if (m.Matches()) {
     InstructionOperand inputs[2];
     inputs[0] = g.UseRegister(m.base());
@@ -271,10 +300,11 @@ bool TryEmitExtendingLoad(InstructionSelector* selector, Node* node,
   return false;
 }
 
-bool TryMatchImmediate(InstructionSelector* selector,
+template <typename Adapter>
+bool TryMatchImmediate(InstructionSelectorT<Adapter>* selector,
                        InstructionCode* opcode_return, Node* node,
                        size_t* input_count_return, InstructionOperand* inputs) {
-  Mips64OperandGenerator g(selector);
+  Mips64OperandGeneratorT<Adapter> g(selector);
   if (g.CanBeImmediate(node, *opcode_return)) {
     *opcode_return |= AddressingModeField::encode(kMode_MRI);
     inputs[0] = g.UseImmediate(node);
@@ -284,11 +314,12 @@ bool TryMatchImmediate(InstructionSelector* selector,
   return false;
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode, bool has_reverse_opcode,
                        InstructionCode reverse_opcode,
-                       FlagsContinuation* cont) {
-  Mips64OperandGenerator g(selector);
+                       FlagsContinuationT<Adapter>* cont) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   InstructionOperand inputs[2];
   size_t input_count = 0;
@@ -321,41 +352,56 @@ static void VisitBinop(InstructionSelector* selector, Node* node,
                                  inputs, cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode, bool has_reverse_opcode,
                        InstructionCode reverse_opcode) {
-  FlagsContinuation cont;
+  FlagsContinuationT<Adapter> cont;
   VisitBinop(selector, node, opcode, has_reverse_opcode, reverse_opcode, &cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
-                       InstructionCode opcode, FlagsContinuation* cont) {
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
+                       InstructionCode opcode,
+                       FlagsContinuationT<Adapter>* cont) {
   VisitBinop(selector, node, opcode, false, kArchNop, cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode) {
   VisitBinop(selector, node, opcode, false, kArchNop);
 }
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
-  int alignment = rep.alignment();
-  int slot = frame_->AllocateSpillSlot(rep.size(), alignment);
-  OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+    int alignment = rep.alignment();
+    int slot = frame_->AllocateSpillSlot(rep.size(), alignment);
+    OperandGenerator g(this);
 
-  Emit(kArchStackSlot, g.DefineAsRegister(node),
-       sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+    Emit(kArchStackSlot, g.DefineAsRegister(node),
+         sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+  }
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), a0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), a0));
+  }
 }
 
-void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
-              Node* output = nullptr) {
-  Mips64OperandGenerator g(selector);
+template <typename Adapter>
+void EmitLoad(InstructionSelectorT<Adapter>* selector, Node* node,
+              InstructionCode opcode, Node* output = nullptr) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -382,10 +428,11 @@ void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
 }
 
 namespace {
-InstructionOperand EmitAddBeforeS128LoadStore(InstructionSelector* selector,
-                                              Node* node,
-                                              InstructionCode* opcode) {
-  Mips64OperandGenerator g(selector);
+template <typename Adapter>
+InstructionOperand EmitAddBeforeS128LoadStore(
+    InstructionSelectorT<Adapter>* selector, Node* node,
+    InstructionCode* opcode) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   InstructionOperand addr_reg = g.TempRegister();
@@ -397,13 +444,14 @@ InstructionOperand EmitAddBeforeS128LoadStore(InstructionSelector* selector,
 
 }  // namespace
 
-void InstructionSelector::VisitStoreLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
   StoreLaneParameters params = StoreLaneParametersOf(node->op());
   LoadStoreLaneParams f(params.rep, params.laneidx);
   InstructionCode opcode = kMips64S128StoreLane;
   opcode |= MiscField::encode(f.sz);
 
-  Mips64OperandGenerator g(this);
+  Mips64OperandGeneratorT<Adapter> g(this);
   InstructionOperand addr = EmitAddBeforeS128LoadStore(this, node, &opcode);
   InstructionOperand inputs[4] = {
       g.UseRegister(node->InputAt(2)),
@@ -414,19 +462,21 @@ void InstructionSelector::VisitStoreLane(Node* node) {
   Emit(opcode, 0, nullptr, 4, inputs);
 }
 
-void InstructionSelector::VisitLoadLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
   LoadLaneParameters params = LoadLaneParametersOf(node->op());
   LoadStoreLaneParams f(params.rep.representation(), params.laneidx);
   InstructionCode opcode = kMips64S128LoadLane;
   opcode |= MiscField::encode(f.sz);
 
-  Mips64OperandGenerator g(this);
+  Mips64OperandGeneratorT<Adapter> g(this);
   InstructionOperand addr = EmitAddBeforeS128LoadStore(this, node, &opcode);
   Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(2)),
        g.UseImmediate(f.laneidx), addr, g.TempImmediate(0));
 }
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
 
   InstructionCode opcode = kArchNop;
@@ -478,55 +528,73 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   EmitLoad(this, node, opcode);
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    LoadRepresentation load_rep = LoadRepresentationOf(node->op());
 
-  InstructionCode opcode = kArchNop;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kFloat32:
-      opcode = kMips64Lwc1;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kMips64Ldc1;
-      break;
-    case MachineRepresentation::kBit:  // Fall through.
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsUnsigned() ? kMips64Lbu : kMips64Lb;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsUnsigned() ? kMips64Lhu : kMips64Lh;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kMips64Lw;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:         // Fall through.
-    case MachineRepresentation::kWord64:
-      opcode = kMips64Ld;
-      break;
-    case MachineRepresentation::kSimd128:
-      opcode = kMips64MsaLd;
-      break;
-    case MachineRepresentation::kSimd256:            // Fall through.
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kSandboxedPointer:   // Fall through.
-    case MachineRepresentation::kCompressed:         // Fall through.
-    case MachineRepresentation::kMapWord:            // Fall through.
-    case MachineRepresentation::kNone:
-      UNREACHABLE();
-  }
+    InstructionCode opcode = kArchNop;
+    switch (load_rep.representation()) {
+      case MachineRepresentation::kFloat32:
+        opcode = kMips64Lwc1;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kMips64Ldc1;
+        break;
+      case MachineRepresentation::kBit:  // Fall through.
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsUnsigned() ? kMips64Lbu : kMips64Lb;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsUnsigned() ? kMips64Lhu : kMips64Lh;
+        break;
+      case MachineRepresentation::kWord32:
+        opcode = kMips64Lw;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:         // Fall through.
+      case MachineRepresentation::kWord64:
+        opcode = kMips64Ld;
+        break;
+      case MachineRepresentation::kSimd128:
+        opcode = kMips64MsaLd;
+        break;
+      case MachineRepresentation::kSimd256:            // Fall through.
+      case MachineRepresentation::kCompressedPointer:  // Fall through.
+      case MachineRepresentation::kSandboxedPointer:   // Fall through.
+      case MachineRepresentation::kCompressed:         // Fall through.
+      case MachineRepresentation::kMapWord:            // Fall through.
+      case MachineRepresentation::kIndirectPointer:    // Fall through.
+      case MachineRepresentation::kNone:
+        UNREACHABLE();
+    }
 
-  EmitLoad(this, node, opcode);
+    EmitLoad(this, node, opcode);
+  }
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitStore(Node* node) {
-  Mips64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitStore(turboshaft::OpIndex) {
+  UNREACHABLE();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitStore(Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -588,6 +656,7 @@ void InstructionSelector::VisitStore(Node* node) {
       case MachineRepresentation::kCompressed:         // Fall through.
       case MachineRepresentation::kSandboxedPointer:   // Fall through.
       case MachineRepresentation::kMapWord:            // Fall through.
+      case MachineRepresentation::kIndirectPointer:    // Fall through.
       case MachineRepresentation::kNone:
         UNREACHABLE();
     }
@@ -614,13 +683,21 @@ void InstructionSelector::VisitStore(Node* node) {
   }
 }
 
-void InstructionSelector::VisitProtectedStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitWord32And(Node* node) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32And(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32And(Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   if (m.left().IsWord32Shr() && CanCover(node, m.left().node()) &&
       m.right().HasResolvedValue()) {
@@ -668,8 +745,14 @@ void InstructionSelector::VisitWord32And(Node* node) {
   VisitBinop(this, node, kMips64And32, true, kMips64And32);
 }
 
-void InstructionSelector::VisitWord64And(Node* node) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord64And(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64And(Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Int64BinopMatcher m(node);
   if (m.left().IsWord64Shr() && CanCover(node, m.left().node()) &&
       m.right().HasResolvedValue()) {
@@ -723,65 +806,91 @@ void InstructionSelector::VisitWord64And(Node* node) {
   VisitBinop(this, node, kMips64And, true, kMips64And);
 }
 
-void InstructionSelector::VisitWord32Or(Node* node) {
-  VisitBinop(this, node, kMips64Or32, true, kMips64Or32);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop(this, node, kMips64Or32, true, kMips64Or32);
+  }
 }
 
-void InstructionSelector::VisitWord64Or(Node* node) {
-  VisitBinop(this, node, kMips64Or, true, kMips64Or);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop(this, node, kMips64Or, true, kMips64Or);
+  }
 }
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  Int32BinopMatcher m(node);
-  if (m.left().IsWord32Or() && CanCover(node, m.left().node()) &&
-      m.right().Is(-1)) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (!mleft.right().HasResolvedValue()) {
-      Mips64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    if (m.left().IsWord32Or() && CanCover(node, m.left().node()) &&
+        m.right().Is(-1)) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (!mleft.right().HasResolvedValue()) {
+        Mips64OperandGeneratorT<Adapter> g(this);
+        Emit(kMips64Nor32, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()),
+             g.UseRegister(mleft.right().node()));
+        return;
+      }
+    }
+    if (m.right().Is(-1)) {
+      // Use Nor for bit negation and eliminate constant loading for xori.
+      Mips64OperandGeneratorT<Adapter> g(this);
       Emit(kMips64Nor32, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()),
-           g.UseRegister(mleft.right().node()));
+           g.UseRegister(m.left().node()), g.TempImmediate(0));
       return;
     }
+    VisitBinop(this, node, kMips64Xor32, true, kMips64Xor32);
   }
-  if (m.right().Is(-1)) {
-    // Use Nor for bit negation and eliminate constant loading for xori.
-    Mips64OperandGenerator g(this);
-    Emit(kMips64Nor32, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-         g.TempImmediate(0));
-    return;
-  }
-  VisitBinop(this, node, kMips64Xor32, true, kMips64Xor32);
 }
 
-void InstructionSelector::VisitWord64Xor(Node* node) {
-  Int64BinopMatcher m(node);
-  if (m.left().IsWord64Or() && CanCover(node, m.left().node()) &&
-      m.right().Is(-1)) {
-    Int64BinopMatcher mleft(m.left().node());
-    if (!mleft.right().HasResolvedValue()) {
-      Mips64OperandGenerator g(this);
-      Emit(kMips64Nor, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()),
-           g.UseRegister(mleft.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int64BinopMatcher m(node);
+    if (m.left().IsWord64Or() && CanCover(node, m.left().node()) &&
+        m.right().Is(-1)) {
+      Int64BinopMatcher mleft(m.left().node());
+      if (!mleft.right().HasResolvedValue()) {
+        Mips64OperandGeneratorT<Adapter> g(this);
+        Emit(kMips64Nor, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()),
+             g.UseRegister(mleft.right().node()));
+        return;
+      }
+    }
+    if (m.right().Is(-1)) {
+      // Use Nor for bit negation and eliminate constant loading for xori.
+      Mips64OperandGeneratorT<Adapter> g(this);
+      Emit(kMips64Nor, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
+           g.TempImmediate(0));
       return;
     }
+    VisitBinop(this, node, kMips64Xor, true, kMips64Xor);
   }
-  if (m.right().Is(-1)) {
-    // Use Nor for bit negation and eliminate constant loading for xori.
-    Mips64OperandGenerator g(this);
-    Emit(kMips64Nor, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-         g.TempImmediate(0));
-    return;
-  }
-  VisitBinop(this, node, kMips64Xor, true, kMips64Xor);
 }
 
-void InstructionSelector::VisitWord32Shl(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Shl(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Shl(Node* node) {
   Int32BinopMatcher m(node);
   if (m.left().IsWord32And() && CanCover(node, m.left().node()) &&
       m.right().IsInRange(1, 31)) {
-    Mips64OperandGenerator g(this);
+    Mips64OperandGeneratorT<TurbofanAdapter> g(this);
     Int32BinopMatcher mleft(m.left().node());
     // Match Word32Shl(Word32And(x, mask), imm) to Shl where the mask is
     // contiguous, and the shift immediate non-zero.
@@ -807,7 +916,13 @@ void InstructionSelector::VisitWord32Shl(Node* node) {
   VisitRRO(this, kMips64Shl, node);
 }
 
-void InstructionSelector::VisitWord32Shr(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Shr(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Shr(Node* node) {
   Int32BinopMatcher m(node);
   if (m.left().IsWord32And() && m.right().HasResolvedValue()) {
     uint32_t lsb = m.right().ResolvedValue() & 0x1F;
@@ -820,7 +935,7 @@ void InstructionSelector::VisitWord32Shr(Node* node) {
       unsigned mask_width = base::bits::CountPopulation(mask);
       unsigned mask_msb = base::bits::CountLeadingZeros32(mask);
       if ((mask_msb + mask_width + lsb) == 32) {
-        Mips64OperandGenerator g(this);
+        Mips64OperandGeneratorT<TurbofanAdapter> g(this);
         DCHECK_EQ(lsb, base::bits::CountTrailingZeros32(mask));
         Emit(kMips64Ext, g.DefineAsRegister(node),
              g.UseRegister(mleft.left().node()), g.TempImmediate(lsb),
@@ -832,12 +947,19 @@ void InstructionSelector::VisitWord32Shr(Node* node) {
   VisitRRO(this, kMips64Shr, node);
 }
 
-void InstructionSelector::VisitWord32Sar(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Sar(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Sar(Node* node) {
   Int32BinopMatcher m(node);
   if (m.left().IsWord32Shl() && CanCover(node, m.left().node())) {
     Int32BinopMatcher mleft(m.left().node());
     if (m.right().HasResolvedValue() && mleft.right().HasResolvedValue()) {
-      Mips64OperandGenerator g(this);
+      Mips64OperandGeneratorT<TurbofanAdapter> g(this);
       uint32_t sar = m.right().ResolvedValue();
       uint32_t shl = mleft.right().ResolvedValue();
       if ((sar == shl) && (sar == 16)) {
@@ -858,47 +980,59 @@ void InstructionSelector::VisitWord32Sar(Node* node) {
   VisitRRO(this, kMips64Sar, node);
 }
 
-void InstructionSelector::VisitWord64Shl(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if ((m.left().IsChangeInt32ToInt64() || m.left().IsChangeUint32ToUint64()) &&
-      m.right().IsInRange(32, 63) && CanCover(node, m.left().node())) {
-    // There's no need to sign/zero-extend to 64-bit if we shift out the upper
-    // 32 bits anyway.
-    Emit(kMips64Dshl, g.DefineAsRegister(node),
-         g.UseRegister(m.left().node()->InputAt(0)),
-         g.UseImmediate(m.right().node()));
-    return;
-  }
-  if (m.left().IsWord64And() && CanCover(node, m.left().node()) &&
-      m.right().IsInRange(1, 63)) {
-    // Match Word64Shl(Word64And(x, mask), imm) to Dshl where the mask is
-    // contiguous, and the shift immediate non-zero.
-    Int64BinopMatcher mleft(m.left().node());
-    if (mleft.right().HasResolvedValue()) {
-      uint64_t mask = mleft.right().ResolvedValue();
-      uint32_t mask_width = base::bits::CountPopulation(mask);
-      uint32_t mask_msb = base::bits::CountLeadingZeros64(mask);
-      if ((mask_width != 0) && (mask_msb + mask_width == 64)) {
-        uint64_t shift = m.right().ResolvedValue();
-        DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask));
-        DCHECK_NE(0u, shift);
-
-        if ((shift + mask_width) >= 64) {
-          // If the mask is contiguous and reaches or extends beyond the top
-          // bit, only the shift is needed.
-          Emit(kMips64Dshl, g.DefineAsRegister(node),
-               g.UseRegister(mleft.left().node()),
-               g.UseImmediate(m.right().node()));
-          return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if ((m.left().IsChangeInt32ToInt64() ||
+         m.left().IsChangeUint32ToUint64()) &&
+        m.right().IsInRange(32, 63) && CanCover(node, m.left().node())) {
+      // There's no need to sign/zero-extend to 64-bit if we shift out the upper
+      // 32 bits anyway.
+      Emit(kMips64Dshl, g.DefineAsRegister(node),
+           g.UseRegister(m.left().node()->InputAt(0)),
+           g.UseImmediate(m.right().node()));
+      return;
+    }
+    if (m.left().IsWord64And() && CanCover(node, m.left().node()) &&
+        m.right().IsInRange(1, 63)) {
+      // Match Word64Shl(Word64And(x, mask), imm) to Dshl where the mask is
+      // contiguous, and the shift immediate non-zero.
+      Int64BinopMatcher mleft(m.left().node());
+      if (mleft.right().HasResolvedValue()) {
+        uint64_t mask = mleft.right().ResolvedValue();
+        uint32_t mask_width = base::bits::CountPopulation(mask);
+        uint32_t mask_msb = base::bits::CountLeadingZeros64(mask);
+        if ((mask_width != 0) && (mask_msb + mask_width == 64)) {
+          uint64_t shift = m.right().ResolvedValue();
+          DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask));
+          DCHECK_NE(0u, shift);
+
+          if ((shift + mask_width) >= 64) {
+            // If the mask is contiguous and reaches or extends beyond the top
+            // bit, only the shift is needed.
+            Emit(kMips64Dshl, g.DefineAsRegister(node),
+                 g.UseRegister(mleft.left().node()),
+                 g.UseImmediate(m.right().node()));
+            return;
+          }
         }
       }
     }
+    VisitRRO(this, kMips64Dshl, node);
   }
-  VisitRRO(this, kMips64Dshl, node);
 }
 
-void InstructionSelector::VisitWord64Shr(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord64Shr(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64Shr(Node* node) {
   Int64BinopMatcher m(node);
   if (m.left().IsWord64And() && m.right().HasResolvedValue()) {
     uint32_t lsb = m.right().ResolvedValue() & 0x3F;
@@ -911,7 +1045,7 @@ void InstructionSelector::VisitWord64Shr(Node* node) {
       unsigned mask_width = base::bits::CountPopulation(mask);
       unsigned mask_msb = base::bits::CountLeadingZeros64(mask);
       if ((mask_msb + mask_width + lsb) == 64) {
-        Mips64OperandGenerator g(this);
+        Mips64OperandGeneratorT<TurbofanAdapter> g(this);
         DCHECK_EQ(lsb, base::bits::CountTrailingZeros64(mask));
         Emit(kMips64Dext, g.DefineAsRegister(node),
              g.UseRegister(mleft.left().node()), g.TempImmediate(lsb),
@@ -923,75 +1057,99 @@ void InstructionSelector::VisitWord64Shr(Node* node) {
   VisitRRO(this, kMips64Dshr, node);
 }
 
-void InstructionSelector::VisitWord64Sar(Node* node) {
-  if (TryEmitExtendingLoad(this, node, node)) return;
-  VisitRRO(this, kMips64Dsar, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Sar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (TryEmitExtendingLoad(this, node, node)) return;
+    VisitRRO(this, kMips64Dsar, node);
+  }
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
   VisitRRO(this, kMips64Ror, node);
 }
 
-void InstructionSelector::VisitWord32Clz(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Clz(node_t node) {
   VisitRR(this, kMips64Clz, node);
 }
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64ByteSwap64, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  VisitRR(this, kMips64ByteSwap64, node);
 }
 
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64ByteSwap32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
+  VisitRR(this, kMips64ByteSwap32, node);
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitWord32Ctz(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Ctz, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ctz(node_t node) {
+  VisitRR(this, kMips64Ctz, node);
 }
 
-void InstructionSelector::VisitWord64Ctz(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Dctz, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ctz(node_t node) {
+  VisitRR(this, kMips64Dctz, node);
 }
 
-void InstructionSelector::VisitWord32Popcnt(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Popcnt, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Popcnt(node_t node) {
+  VisitRR(this, kMips64Popcnt, node);
 }
 
-void InstructionSelector::VisitWord64Popcnt(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Dpopcnt, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Popcnt(node_t node) {
+  VisitRR(this, kMips64Dpopcnt, node);
 }
 
-void InstructionSelector::VisitWord64Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ror(node_t node) {
   VisitRRO(this, kMips64Dror, node);
 }
 
-void InstructionSelector::VisitWord64Clz(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Clz(node_t node) {
   VisitRR(this, kMips64Dclz, node);
 }
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Add(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Add(Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
 
   if (kArchVariant == kMips64r6) {
@@ -1033,59 +1191,80 @@ void InstructionSelector::VisitInt32Add(Node* node) {
   VisitBinop(this, node, kMips64Add, true, kMips64Add);
 }
 
-void InstructionSelector::VisitInt64Add(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
 
-  if (kArchVariant == kMips64r6) {
-    // Select Dlsa for (left + (left_of_right << imm)).
-    if (m.right().opcode() == IrOpcode::kWord64Shl &&
-        CanCover(node, m.left().node()) && CanCover(node, m.right().node())) {
-      Int64BinopMatcher mright(m.right().node());
-      if (mright.right().HasResolvedValue() && !m.left().HasResolvedValue()) {
-        int32_t shift_value =
-            static_cast<int32_t>(mright.right().ResolvedValue());
-        if (shift_value > 0 && shift_value <= 31) {
-          Emit(kMips64Dlsa, g.DefineAsRegister(node),
-               g.UseRegister(m.left().node()),
-               g.UseRegister(mright.left().node()),
-               g.TempImmediate(shift_value));
-          return;
+    if (kArchVariant == kMips64r6) {
+      // Select Dlsa for (left + (left_of_right << imm)).
+      if (m.right().opcode() == IrOpcode::kWord64Shl &&
+          CanCover(node, m.left().node()) && CanCover(node, m.right().node())) {
+        Int64BinopMatcher mright(m.right().node());
+        if (mright.right().HasResolvedValue() && !m.left().HasResolvedValue()) {
+          int32_t shift_value =
+              static_cast<int32_t>(mright.right().ResolvedValue());
+          if (shift_value > 0 && shift_value <= 31) {
+            Emit(kMips64Dlsa, g.DefineAsRegister(node),
+                 g.UseRegister(m.left().node()),
+                 g.UseRegister(mright.left().node()),
+                 g.TempImmediate(shift_value));
+            return;
+          }
         }
       }
-    }
 
-    // Select Dlsa for ((left_of_left << imm) + right).
-    if (m.left().opcode() == IrOpcode::kWord64Shl &&
-        CanCover(node, m.right().node()) && CanCover(node, m.left().node())) {
-      Int64BinopMatcher mleft(m.left().node());
-      if (mleft.right().HasResolvedValue() && !m.right().HasResolvedValue()) {
-        int32_t shift_value =
-            static_cast<int32_t>(mleft.right().ResolvedValue());
-        if (shift_value > 0 && shift_value <= 31) {
-          Emit(kMips64Dlsa, g.DefineAsRegister(node),
-               g.UseRegister(m.right().node()),
-               g.UseRegister(mleft.left().node()),
-               g.TempImmediate(shift_value));
-          return;
+      // Select Dlsa for ((left_of_left << imm) + right).
+      if (m.left().opcode() == IrOpcode::kWord64Shl &&
+          CanCover(node, m.right().node()) && CanCover(node, m.left().node())) {
+        Int64BinopMatcher mleft(m.left().node());
+        if (mleft.right().HasResolvedValue() && !m.right().HasResolvedValue()) {
+          int32_t shift_value =
+              static_cast<int32_t>(mleft.right().ResolvedValue());
+          if (shift_value > 0 && shift_value <= 31) {
+            Emit(kMips64Dlsa, g.DefineAsRegister(node),
+                 g.UseRegister(m.right().node()),
+                 g.UseRegister(mleft.left().node()),
+                 g.TempImmediate(shift_value));
+            return;
+          }
         }
       }
     }
+
+    VisitBinop(this, node, kMips64Dadd, true, kMips64Dadd);
   }
+}
 
-  VisitBinop(this, node, kMips64Dadd, true, kMips64Dadd);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop(this, node, kMips64Sub);
+  }
 }
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  VisitBinop(this, node, kMips64Sub);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop(this, node, kMips64Dsub);
+  }
 }
 
-void InstructionSelector::VisitInt64Sub(Node* node) {
-  VisitBinop(this, node, kMips64Dsub);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Mul(node_t node) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Mul(Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
     uint32_t value = static_cast<uint32_t>(m.right().ResolvedValue());
@@ -1130,24 +1309,34 @@ void InstructionSelector::VisitInt32Mul(Node* node) {
   VisitRRR(this, kMips64Mul, node);
 }
 
-void InstructionSelector::VisitInt32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulHigh(node_t node) {
   VisitRRR(this, kMips64MulHigh, node);
 }
 
-void InstructionSelector::VisitInt64MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulHigh(node_t node) {
   VisitRRR(this, kMips64DMulHigh, node);
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
   VisitRRR(this, kMips64MulHighU, node);
 }
 
-void InstructionSelector::VisitUint64MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64MulHigh(node_t node) {
   VisitRRR(this, kMips64DMulHighU, node);
 }
 
-void InstructionSelector::VisitInt64Mul(Node* node) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt64Mul(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt64Mul(Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Int64BinopMatcher m(node);
   if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
     uint64_t value = static_cast<uint64_t>(m.right().ResolvedValue());
@@ -1178,138 +1367,181 @@ void InstructionSelector::VisitInt64Mul(Node* node) {
        g.UseRegister(m.right().node()));
 }
 
-void InstructionSelector::VisitInt32Div(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (CanCover(node, left) && CanCover(node, right)) {
-    if (left->opcode() == IrOpcode::kWord64Sar &&
-        right->opcode() == IrOpcode::kWord64Sar) {
-      Int64BinopMatcher rightInput(right), leftInput(left);
-      if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
-        // Combine both shifted operands with Ddiv.
-        Emit(kMips64Ddiv, g.DefineSameAsFirst(node),
-             g.UseRegister(leftInput.left().node()),
-             g.UseRegister(rightInput.left().node()));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    if (CanCover(node, left) && CanCover(node, right)) {
+      if (left->opcode() == IrOpcode::kWord64Sar &&
+          right->opcode() == IrOpcode::kWord64Sar) {
+        Int64BinopMatcher rightInput(right), leftInput(left);
+        if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
+          // Combine both shifted operands with Ddiv.
+          Emit(kMips64Ddiv, g.DefineSameAsFirst(node),
+               g.UseRegister(leftInput.left().node()),
+               g.UseRegister(rightInput.left().node()));
+          return;
+        }
       }
     }
+    Emit(kMips64Div, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
+         g.UseRegister(m.right().node()));
   }
-  Emit(kMips64Div, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
 }
 
-void InstructionSelector::VisitUint32Div(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  Emit(kMips64DivU, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    Emit(kMips64DivU, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
+         g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitInt32Mod(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (CanCover(node, left) && CanCover(node, right)) {
-    if (left->opcode() == IrOpcode::kWord64Sar &&
-        right->opcode() == IrOpcode::kWord64Sar) {
-      Int64BinopMatcher rightInput(right), leftInput(left);
-      if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
-        // Combine both shifted operands with Dmod.
-        Emit(kMips64Dmod, g.DefineSameAsFirst(node),
-             g.UseRegister(leftInput.left().node()),
-             g.UseRegister(rightInput.left().node()));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    if (CanCover(node, left) && CanCover(node, right)) {
+      if (left->opcode() == IrOpcode::kWord64Sar &&
+          right->opcode() == IrOpcode::kWord64Sar) {
+        Int64BinopMatcher rightInput(right), leftInput(left);
+        if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
+          // Combine both shifted operands with Dmod.
+          Emit(kMips64Dmod, g.DefineSameAsFirst(node),
+               g.UseRegister(leftInput.left().node()),
+               g.UseRegister(rightInput.left().node()));
+          return;
+        }
       }
     }
+    Emit(kMips64Mod, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
+         g.UseRegister(m.right().node()));
   }
-  Emit(kMips64Mod, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
 }
 
-void InstructionSelector::VisitUint32Mod(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  Emit(kMips64ModU, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Mod(node_t node) {
+  VisitRRR(this, kMips64ModU, node);
 }
 
-void InstructionSelector::VisitInt64Div(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  Emit(kMips64Ddiv, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    Emit(kMips64Ddiv, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
+         g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitUint64Div(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  Emit(kMips64DdivU, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    Emit(kMips64DdivU, g.DefineSameAsFirst(node),
+         g.UseRegister(m.left().node()), g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitInt64Mod(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  Emit(kMips64Dmod, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Mod(node_t node) {
+  VisitRRR(this, kMips64Dmod, node);
 }
 
-void InstructionSelector::VisitUint64Mod(Node* node) {
-  Mips64OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  Emit(kMips64DmodU, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-       g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Mod(node_t node) {
+  VisitRRR(this, kMips64DmodU, node);
 }
 
-void InstructionSelector::VisitChangeFloat32ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat32ToFloat64(node_t node) {
   VisitRR(this, kMips64CvtDS, node);
 }
 
-void InstructionSelector::VisitRoundInt32ToFloat32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt32ToFloat32(node_t node) {
   VisitRR(this, kMips64CvtSW, node);
 }
 
-void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint32ToFloat32(node_t node) {
   VisitRR(this, kMips64CvtSUw, node);
 }
 
-void InstructionSelector::VisitChangeInt32ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToFloat64(node_t node) {
   VisitRR(this, kMips64CvtDW, node);
 }
 
-void InstructionSelector::VisitChangeInt64ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt64ToFloat64(node_t node) {
   VisitRR(this, kMips64CvtDL, node);
 }
 
-void InstructionSelector::VisitChangeUint32ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToFloat64(node_t node) {
   VisitRR(this, kMips64CvtDUw, node);
 }
 
-void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) {
-  Mips64OperandGenerator g(this);
-  InstructionCode opcode = kMips64TruncWS;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kMips64TruncWS;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) {
-  Mips64OperandGenerator g(this);
-  InstructionCode opcode = kMips64TruncUwS;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kMips64TruncUwS;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitChangeFloat64ToInt32(
+    node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitChangeFloat64ToInt32(
+    Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Node* value = node->InputAt(0);
   // Match ChangeFloat64ToInt32(Float64Round##OP) to corresponding instruction
   // which does rounding and conversion to integer format.
@@ -1371,160 +1603,222 @@ void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) {
   VisitRR(this, kMips64TruncWD, node);
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToInt64(node_t node) {
   VisitRR(this, kMips64TruncLD, node);
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint32(node_t node) {
   VisitRR(this, kMips64TruncUwD, node);
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint64(node_t node) {
   VisitRR(this, kMips64TruncUlD, node);
 }
 
-void InstructionSelector::VisitTruncateFloat64ToUint32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToUint32(node_t node) {
   VisitRR(this, kMips64TruncUwD, node);
 }
 
-void InstructionSelector::VisitTruncateFloat64ToInt64(Node* node) {
-  Mips64OperandGenerator g(this);
-  InstructionCode opcode = kMips64TruncLD;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kMips64TruncLD;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
-  Mips64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    this->Emit(kMips64TruncLS, output_count, outputs, 1, inputs);
   }
-
-  this->Emit(kMips64TruncLS, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
-  Mips64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kMips64TruncLD, output_count, outputs, 1, inputs);
   }
-
-  Emit(kMips64TruncLD, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
-  Mips64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kMips64TruncUlS, output_count, outputs, 1, inputs);
   }
-
-  Emit(kMips64TruncUlS, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
-  Mips64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
 
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kMips64TruncUlD, output_count, outputs, 1, inputs);
   }
-
-  Emit(kMips64TruncUlD, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
-  Mips64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand temps[] = {g.TempDoubleRegister()};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt32(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand temps[] = {g.TempDoubleRegister()};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kMips64TruncWD, output_count, outputs, 1, inputs, 1, temps);
   }
-
-  Emit(kMips64TruncWD, output_count, outputs, 1, inputs, 1, temps);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
-  Mips64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand temps[] = {g.TempDoubleRegister()};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint32(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand temps[] = {g.TempDoubleRegister()};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    Emit(kMips64TruncUwD, output_count, outputs, 1, inputs, 1, temps);
   }
-
-  Emit(kMips64TruncUwD, output_count, outputs, 1, inputs, 1, temps);
 }
 
-void InstructionSelector::VisitBitcastWord32ToWord64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32ToWord64(node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
-  Node* value = node->InputAt(0);
-  if ((value->opcode() == IrOpcode::kLoad ||
-       value->opcode() == IrOpcode::kLoadImmutable) &&
-      CanCover(node, value)) {
-    // Generate sign-extending load.
-    LoadRepresentation load_rep = LoadRepresentationOf(value->op());
-    InstructionCode opcode = kArchNop;
-    switch (load_rep.representation()) {
-      case MachineRepresentation::kBit:  // Fall through.
-      case MachineRepresentation::kWord8:
-        opcode = load_rep.IsUnsigned() ? kMips64Lbu : kMips64Lb;
-        break;
-      case MachineRepresentation::kWord16:
-        opcode = load_rep.IsUnsigned() ? kMips64Lhu : kMips64Lh;
-        break;
-      case MachineRepresentation::kWord32:
-        opcode = kMips64Lw;
-        break;
-      default:
-        UNREACHABLE();
-    }
-    EmitLoad(this, value, opcode, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    Mips64OperandGenerator g(this);
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    if ((value->opcode() == IrOpcode::kLoad ||
+         value->opcode() == IrOpcode::kLoadImmutable) &&
+        CanCover(node, value)) {
+      // Generate sign-extending load.
+      LoadRepresentation load_rep = LoadRepresentationOf(value->op());
+      InstructionCode opcode = kArchNop;
+      switch (load_rep.representation()) {
+        case MachineRepresentation::kBit:  // Fall through.
+        case MachineRepresentation::kWord8:
+          opcode = load_rep.IsUnsigned() ? kMips64Lbu : kMips64Lb;
+          break;
+        case MachineRepresentation::kWord16:
+          opcode = load_rep.IsUnsigned() ? kMips64Lhu : kMips64Lh;
+          break;
+        case MachineRepresentation::kWord32:
+          opcode = kMips64Lw;
+          break;
+        default:
+          UNREACHABLE();
+      }
+      EmitLoad(this, value, opcode, node);
+      return;
+    } else if (value->opcode() == IrOpcode::kTruncateInt64ToInt32) {
+      EmitIdentity(node);
+      return;
+    }
     Emit(kMips64Shl, g.DefineAsRegister(node), g.UseRegister(value),
          g.TempImmediate(0));
   }
 }
 
-bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
+template <>
+bool InstructionSelectorT<TurboshaftAdapter>::ZeroExtendsWord32ToWord64NoPhis(
+    node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+bool InstructionSelectorT<TurbofanAdapter>::ZeroExtendsWord32ToWord64NoPhis(
+    Node* node) {
   DCHECK_NE(node->opcode(), IrOpcode::kPhi);
   switch (node->opcode()) {
     // Comparisons only emit 0/1, so the upper 32 bits must be zero.
@@ -1569,339 +1863,428 @@ bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
   }
 }
 
-void InstructionSelector::VisitChangeUint32ToUint64(Node* node) {
-  Mips64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  IrOpcode::Value opcode = value->opcode();
-
-  if (opcode == IrOpcode::kLoad || opcode == IrOpcode::kUnalignedLoad) {
-    LoadRepresentation load_rep = LoadRepresentationOf(value->op());
-    ArchOpcode arch_opcode =
-        opcode == IrOpcode::kUnalignedLoad ? kMips64Ulwu : kMips64Lwu;
-    if (load_rep.IsUnsigned() &&
-        load_rep.representation() == MachineRepresentation::kWord32) {
-      EmitLoad(this, value, arch_opcode, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToUint64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    IrOpcode::Value opcode = value->opcode();
+
+    if (opcode == IrOpcode::kLoad || opcode == IrOpcode::kUnalignedLoad) {
+      LoadRepresentation load_rep = LoadRepresentationOf(value->op());
+      ArchOpcode arch_opcode =
+          opcode == IrOpcode::kUnalignedLoad ? kMips64Ulwu : kMips64Lwu;
+      if (load_rep.IsUnsigned() &&
+          load_rep.representation() == MachineRepresentation::kWord32) {
+        EmitLoad(this, value, arch_opcode, node);
+        return;
+      }
+    }
+
+    if (ZeroExtendsWord32ToWord64(value)) {
+      EmitIdentity(node);
       return;
     }
-  }
 
-  if (ZeroExtendsWord32ToWord64(value)) {
-    EmitIdentity(node);
-    return;
+    Emit(kMips64Dext, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
+         g.TempImmediate(0), g.TempImmediate(32));
   }
-
-  Emit(kMips64Dext, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
-       g.TempImmediate(0), g.TempImmediate(32));
 }
 
-void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) {
-  Mips64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  if (CanCover(node, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord64Sar: {
-        if (CanCover(value, value->InputAt(0)) &&
-            TryEmitExtendingLoad(this, value, node)) {
-          return;
-        } else {
-          Int64BinopMatcher m(value);
-          if (m.right().IsInRange(32, 63)) {
-            // After smi untagging no need for truncate. Combine sequence.
-            Emit(kMips64Dsar, g.DefineAsRegister(node),
-                 g.UseRegister(m.left().node()),
-                 g.UseImmediate(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateInt64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    if (CanCover(node, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord64Sar: {
+          if (CanCover(value, value->InputAt(0)) &&
+              TryEmitExtendingLoad(this, value, node)) {
             return;
+          } else {
+            Int64BinopMatcher m(value);
+            if (m.right().IsInRange(32, 63)) {
+              // After smi untagging no need for truncate. Combine sequence.
+              Emit(kMips64Dsar, g.DefineAsRegister(node),
+                   g.UseRegister(m.left().node()),
+                   g.UseImmediate(m.right().node()));
+              return;
+            }
           }
+          break;
         }
-        break;
+        default:
+          break;
       }
-      default:
-        break;
     }
+    Emit(kMips64Shl, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
+         g.TempImmediate(0));
   }
-  Emit(kMips64Shl, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
-       g.TempImmediate(0));
 }
 
-void InstructionSelector::VisitTruncateFloat64ToFloat32(Node* node) {
-  Mips64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  // Match TruncateFloat64ToFloat32(ChangeInt32ToFloat64) to corresponding
-  // instruction.
-  if (CanCover(node, value) &&
-      value->opcode() == IrOpcode::kChangeInt32ToFloat64) {
-    Emit(kMips64CvtSW, g.DefineAsRegister(node),
-         g.UseRegister(value->InputAt(0)));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    // Match TruncateFloat64ToFloat32(ChangeInt32ToFloat64) to corresponding
+    // instruction.
+    if (CanCover(node, value) &&
+        value->opcode() == IrOpcode::kChangeInt32ToFloat64) {
+      Emit(kMips64CvtSW, g.DefineAsRegister(node),
+           g.UseRegister(value->InputAt(0)));
+      return;
+    }
+    VisitRR(this, kMips64CvtSD, node);
   }
-  VisitRR(this, kMips64CvtSD, node);
 }
 
-void InstructionSelector::VisitTruncateFloat64ToWord32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToWord32(node_t node) {
   VisitRR(this, kArchTruncateDoubleToI, node);
 }
 
-void InstructionSelector::VisitRoundFloat64ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundFloat64ToInt32(node_t node) {
   VisitRR(this, kMips64TruncWD, node);
 }
 
-void InstructionSelector::VisitRoundInt64ToFloat32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt64ToFloat32(node_t node) {
   VisitRR(this, kMips64CvtSL, node);
 }
 
-void InstructionSelector::VisitRoundInt64ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt64ToFloat64(node_t node) {
   VisitRR(this, kMips64CvtDL, node);
 }
 
-void InstructionSelector::VisitRoundUint64ToFloat32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint64ToFloat32(node_t node) {
   VisitRR(this, kMips64CvtSUl, node);
 }
 
-void InstructionSelector::VisitRoundUint64ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint64ToFloat64(node_t node) {
   VisitRR(this, kMips64CvtDUl, node);
 }
 
-void InstructionSelector::VisitBitcastFloat32ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat32ToInt32(node_t node) {
   VisitRR(this, kMips64Float64ExtractLowWord32, node);
 }
 
-void InstructionSelector::VisitBitcastFloat64ToInt64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat64ToInt64(node_t node) {
   VisitRR(this, kMips64BitcastDL, node);
 }
 
-void InstructionSelector::VisitBitcastInt32ToFloat32(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Float64InsertLowWord32, g.DefineAsRegister(node),
-       ImmediateOperand(ImmediateOperand::INLINE_INT32, 0),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Emit(kMips64Float64InsertLowWord32, g.DefineAsRegister(node),
+         ImmediateOperand(ImmediateOperand::INLINE_INT32, 0),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitBitcastInt64ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt64ToFloat64(node_t node) {
   VisitRR(this, kMips64BitcastLD, node);
 }
 
-void InstructionSelector::VisitFloat32Add(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Add(node_t node) {
   // Optimization with Madd.S(z, x, y) is intentionally removed.
   // See explanation for madd_s in assembler-mips64.cc.
   VisitRRR(this, kMips64AddS, node);
 }
 
-void InstructionSelector::VisitFloat64Add(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Add(node_t node) {
   // Optimization with Madd.D(z, x, y) is intentionally removed.
   // See explanation for madd_d in assembler-mips64.cc.
   VisitRRR(this, kMips64AddD, node);
 }
 
-void InstructionSelector::VisitFloat32Sub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sub(node_t node) {
   // Optimization with Msub.S(z, x, y) is intentionally removed.
   // See explanation for madd_s in assembler-mips64.cc.
   VisitRRR(this, kMips64SubS, node);
 }
 
-void InstructionSelector::VisitFloat64Sub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sub(node_t node) {
   // Optimization with Msub.D(z, x, y) is intentionally removed.
   // See explanation for madd_d in assembler-mips64.cc.
   VisitRRR(this, kMips64SubD, node);
 }
 
-void InstructionSelector::VisitFloat32Mul(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Mul(node_t node) {
   VisitRRR(this, kMips64MulS, node);
 }
 
-void InstructionSelector::VisitFloat64Mul(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mul(node_t node) {
   VisitRRR(this, kMips64MulD, node);
 }
 
-void InstructionSelector::VisitFloat32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Div(node_t node) {
   VisitRRR(this, kMips64DivS, node);
 }
 
-void InstructionSelector::VisitFloat64Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Div(node_t node) {
   VisitRRR(this, kMips64DivD, node);
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64ModD, g.DefineAsFixed(node, f0),
-       g.UseFixed(node->InputAt(0), f12), g.UseFixed(node->InputAt(1), f14))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Emit(kMips64ModD, g.DefineAsFixed(node, f0),
+         g.UseFixed(node->InputAt(0), f12), g.UseFixed(node->InputAt(1), f14))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat32Max(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Float32Max, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Max(node_t node) {
+  VisitRRR(this, kMips64Float32Max, node);
 }
 
-void InstructionSelector::VisitFloat64Max(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Float64Max, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Max(node_t node) {
+  VisitRRR(this, kMips64Float64Max, node);
 }
 
-void InstructionSelector::VisitFloat32Min(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Float32Min, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Min(node_t node) {
+  VisitRRR(this, kMips64Float32Min, node);
 }
 
-void InstructionSelector::VisitFloat64Min(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Float64Min, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Min(node_t node) {
+  VisitRRR(this, kMips64Float64Min, node);
 }
 
-void InstructionSelector::VisitFloat32Abs(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Abs(node_t node) {
   VisitRR(this, kMips64AbsS, node);
 }
 
-void InstructionSelector::VisitFloat64Abs(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Abs(node_t node) {
   VisitRR(this, kMips64AbsD, node);
 }
 
-void InstructionSelector::VisitFloat32Sqrt(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sqrt(node_t node) {
   VisitRR(this, kMips64SqrtS, node);
 }
 
-void InstructionSelector::VisitFloat64Sqrt(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sqrt(node_t node) {
   VisitRR(this, kMips64SqrtD, node);
 }
 
-void InstructionSelector::VisitFloat32RoundDown(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundDown(node_t node) {
   VisitRR(this, kMips64Float32RoundDown, node);
 }
 
-void InstructionSelector::VisitFloat64RoundDown(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundDown(node_t node) {
   VisitRR(this, kMips64Float64RoundDown, node);
 }
 
-void InstructionSelector::VisitFloat32RoundUp(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundUp(node_t node) {
   VisitRR(this, kMips64Float32RoundUp, node);
 }
 
-void InstructionSelector::VisitFloat64RoundUp(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundUp(node_t node) {
   VisitRR(this, kMips64Float64RoundUp, node);
 }
 
-void InstructionSelector::VisitFloat32RoundTruncate(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTruncate(node_t node) {
   VisitRR(this, kMips64Float32RoundTruncate, node);
 }
 
-void InstructionSelector::VisitFloat64RoundTruncate(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTruncate(node_t node) {
   VisitRR(this, kMips64Float64RoundTruncate, node);
 }
 
-void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesAway(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitFloat32RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTiesEven(node_t node) {
   VisitRR(this, kMips64Float32RoundTiesEven, node);
 }
 
-void InstructionSelector::VisitFloat64RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesEven(node_t node) {
   VisitRR(this, kMips64Float64RoundTiesEven, node);
 }
 
-void InstructionSelector::VisitFloat32Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Neg(node_t node) {
   VisitRR(this, kMips64NegS, node);
 }
 
-void InstructionSelector::VisitFloat64Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Neg(node_t node) {
   VisitRR(this, kMips64NegD, node);
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Binop(
+    Node* node, InstructionCode opcode) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, f0), g.UseFixed(node->InputAt(0), f2),
        g.UseFixed(node->InputAt(1), f4))
       ->MarkAsCall();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitFloat64Ieee754Unop(
+    Node* node, InstructionCode opcode) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, f0), g.UseFixed(node->InputAt(0), f12))
       ->MarkAsCall();
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int index) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node, int index) {
+}
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {}
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  Mips64OperandGenerator g(this);
-
-  // Prepare for C function call.
-  if (call_descriptor->IsCFunctionCall()) {
-    Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
-                                         call_descriptor->ParameterCount())),
-         0, nullptr, 0, nullptr);
-
-    // Poke any stack arguments.
-    int slot = kCArgSlotCount;
-    for (PushParameter input : (*arguments)) {
-      Emit(kMips64StoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
-           g.TempImmediate(slot << kSystemPointerSizeLog2));
-      ++slot;
-    }
-  } else {
-    int push_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-    if (push_count > 0) {
-      // Calculate needed space
-      int stack_size = 0;
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+
+    // Prepare for C function call.
+    if (call_descriptor->IsCFunctionCall()) {
+      Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
+                                           call_descriptor->ParameterCount())),
+           0, nullptr, 0, nullptr);
+
+      // Poke any stack arguments.
+      int slot = kCArgSlotCount;
       for (PushParameter input : (*arguments)) {
-        if (input.node) {
-          stack_size += input.location.GetSizeInPointers();
+        Emit(kMips64StoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
+             g.TempImmediate(slot << kSystemPointerSizeLog2));
+        ++slot;
+      }
+    } else {
+      int push_count = static_cast<int>(call_descriptor->ParameterSlotCount());
+      if (push_count > 0) {
+        // Calculate needed space
+        int stack_size = 0;
+        for (PushParameter input : (*arguments)) {
+          if (input.node) {
+            stack_size += input.location.GetSizeInPointers();
+          }
         }
+        Emit(kMips64StackClaim, g.NoOutput(),
+             g.TempImmediate(stack_size << kSystemPointerSizeLog2));
       }
-      Emit(kMips64StackClaim, g.NoOutput(),
-           g.TempImmediate(stack_size << kSystemPointerSizeLog2));
-    }
-    for (size_t n = 0; n < arguments->size(); ++n) {
-      PushParameter input = (*arguments)[n];
-      if (input.node) {
-        Emit(kMips64StoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
-             g.TempImmediate(static_cast<int>(n << kSystemPointerSizeLog2)));
+      for (size_t n = 0; n < arguments->size(); ++n) {
+        PushParameter input = (*arguments)[n];
+        if (input.node) {
+          Emit(kMips64StoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
+               g.TempImmediate(static_cast<int>(n << kSystemPointerSizeLog2)));
+        }
       }
     }
   }
 }
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  Mips64OperandGenerator g(this);
-
-  for (PushParameter output : *results) {
-    if (!output.location.IsCallerFrameSlot()) continue;
-    // Skip any alignment holes in nodes.
-    if (output.node != nullptr) {
-      DCHECK(!call_descriptor->IsCFunctionCall());
-      if (output.location.GetType() == MachineType::Float32()) {
-        MarkAsFloat32(output.node);
-      } else if (output.location.GetType() == MachineType::Float64()) {
-        MarkAsFloat64(output.node);
-      } else if (output.location.GetType() == MachineType::Simd128()) {
-        MarkAsSimd128(output.node);
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+
+    for (PushParameter output : *results) {
+      if (!output.location.IsCallerFrameSlot()) continue;
+      // Skip any alignment holes in nodes.
+      if (this->valid(output.node)) {
+        DCHECK(!call_descriptor->IsCFunctionCall());
+        if (output.location.GetType() == MachineType::Float32()) {
+          MarkAsFloat32(output.node);
+        } else if (output.location.GetType() == MachineType::Float64()) {
+          MarkAsFloat64(output.node);
+        } else if (output.location.GetType() == MachineType::Simd128()) {
+          MarkAsSimd128(output.node);
+        }
+        int offset = call_descriptor->GetOffsetToReturns();
+        int reverse_slot = -output.location.GetLocation() - offset;
+        Emit(kMips64Peek, g.DefineAsRegister(output.node),
+             g.UseImmediate(reverse_slot));
       }
-      int offset = call_descriptor->GetOffsetToReturns();
-      int reverse_slot = -output.location.GetLocation() - offset;
-      Emit(kMips64Peek, g.DefineAsRegister(output.node),
-           g.UseImmediate(reverse_slot));
     }
   }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return false; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return false;
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitUnalignedLoad(node_t node) {
+  UNIMPLEMENTED();
+}
 
-void InstructionSelector::VisitUnalignedLoad(Node* node) {
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitUnalignedLoad(Node* node) {
   LoadRepresentation load_rep = LoadRepresentationOf(node->op());
-  Mips64OperandGenerator g(this);
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -1937,6 +2320,7 @@ void InstructionSelector::VisitUnalignedLoad(Node* node) {
     case MachineRepresentation::kCompressed:         // Fall through.
     case MachineRepresentation::kSandboxedPointer:   // Fall through.
     case MachineRepresentation::kMapWord:            // Fall through.
+    case MachineRepresentation::kIndirectPointer:    // Fall through.
     case MachineRepresentation::kNone:
       UNREACHABLE();
   }
@@ -1954,8 +2338,14 @@ void InstructionSelector::VisitUnalignedLoad(Node* node) {
   }
 }
 
-void InstructionSelector::VisitUnalignedStore(Node* node) {
-  Mips64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitUnalignedStore(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitUnalignedStore(Node* node) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -1993,6 +2383,7 @@ void InstructionSelector::VisitUnalignedStore(Node* node) {
     case MachineRepresentation::kCompressed:         // Fall through.
     case MachineRepresentation::kSandboxedPointer:   // Fall through.
     case MachineRepresentation::kMapWord:            // Fall through.
+    case MachineRepresentation::kIndirectPointer:    // Fall through.
     case MachineRepresentation::kNone:
       UNREACHABLE();
   }
@@ -2014,45 +2405,60 @@ void InstructionSelector::VisitUnalignedStore(Node* node) {
 namespace {
 
 // Shared routine for multiple compare operations.
-static void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                         InstructionOperand left, InstructionOperand right,
-                         FlagsContinuation* cont) {
+template <typename Adapter>
+static void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                         InstructionCode opcode, InstructionOperand left,
+                         InstructionOperand right,
+                         FlagsContinuationT<Adapter>* cont) {
   selector->EmitWithContinuation(opcode, left, right, cont);
 }
 
 // Shared routine for multiple float32 compare operations.
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Mips64OperandGenerator g(selector);
-  Float32BinopMatcher m(node);
-  InstructionOperand lhs, rhs;
-
-  lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
-                          : g.UseRegister(m.left().node());
-  rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
-                           : g.UseRegister(m.right().node());
-  VisitCompare(selector, kMips64CmpS, lhs, rhs, cont);
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(selector);
+    Float32BinopMatcher m(node);
+    InstructionOperand lhs, rhs;
+
+    lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
+                            : g.UseRegister(m.left().node());
+    rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
+                             : g.UseRegister(m.right().node());
+    VisitCompare(selector, kMips64CmpS, lhs, rhs, cont);
+  }
 }
 
 // Shared routine for multiple float64 compare operations.
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Mips64OperandGenerator g(selector);
-  Float64BinopMatcher m(node);
-  InstructionOperand lhs, rhs;
-
-  lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
-                          : g.UseRegister(m.left().node());
-  rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
-                           : g.UseRegister(m.right().node());
-  VisitCompare(selector, kMips64CmpD, lhs, rhs, cont);
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(selector);
+    Float64BinopMatcher m(node);
+    InstructionOperand lhs, rhs;
+
+    lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
+                            : g.UseRegister(m.left().node());
+    rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
+                             : g.UseRegister(m.right().node());
+    VisitCompare(selector, kMips64CmpD, lhs, rhs, cont);
+  }
 }
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont,
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector, Node* node,
+                      InstructionCode opcode, FlagsContinuationT<Adapter>* cont,
                       bool commutative) {
-  Mips64OperandGenerator g(selector);
+  Mips64OperandGeneratorT<Adapter> g(selector);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
 
@@ -2139,9 +2545,11 @@ bool IsNodeUnsigned(Node* n) {
 }
 
 // Shared routine for multiple word compare operations.
-void VisitFullWord32Compare(InstructionSelector* selector, Node* node,
-                            InstructionCode opcode, FlagsContinuation* cont) {
-  Mips64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitFullWord32Compare(InstructionSelectorT<Adapter>* selector, Node* node,
+                            InstructionCode opcode,
+                            FlagsContinuationT<Adapter>* cont) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   InstructionOperand leftOp = g.TempRegister();
   InstructionOperand rightOp = g.TempRegister();
 
@@ -2153,11 +2561,12 @@ void VisitFullWord32Compare(InstructionSelector* selector, Node* node,
   VisitCompare(selector, opcode, leftOp, rightOp, cont);
 }
 
-void VisitOptimizedWord32Compare(InstructionSelector* selector, Node* node,
-                                 InstructionCode opcode,
-                                 FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitOptimizedWord32Compare(InstructionSelectorT<Adapter>* selector,
+                                 Node* node, InstructionCode opcode,
+                                 FlagsContinuationT<Adapter>* cont) {
   if (v8_flags.debug_code) {
-    Mips64OperandGenerator g(selector);
+    Mips64OperandGeneratorT<Adapter> g(selector);
     InstructionOperand leftOp = g.TempRegister();
     InstructionOperand rightOp = g.TempRegister();
     InstructionOperand optimizedResult = g.TempRegister();
@@ -2185,52 +2594,61 @@ void VisitOptimizedWord32Compare(InstructionSelector* selector, Node* node,
   VisitWordCompare(selector, node, opcode, cont, false);
 }
 
-void VisitWord32Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
-  // MIPS64 doesn't support Word32 compare instructions. Instead it relies
-  // that the values in registers are correctly sign-extended and uses
-  // Word64 comparison instead. This behavior is correct in most cases,
-  // but doesn't work when comparing signed with unsigned operands.
-  // We could simulate full Word32 compare in all cases but this would
-  // create an unnecessary overhead since unsigned integers are rarely
-  // used in JavaScript.
-  // The solution proposed here tries to match a comparison of signed
-  // with unsigned operand, and perform full Word32Compare only
-  // in those cases. Unfortunately, the solution is not complete because
-  // it might skip cases where Word32 full compare is needed, so
-  // basically it is a hack.
-  // When call to a host function in simulator, if the function return a
-  // int32 value, the simulator do not sign-extended to int64 because in
-  // simulator we do not know the function whether return a int32 or int64.
-  // so we need do a full word32 compare in this case.
+template <typename Adapter>
+void VisitWord32Compare(InstructionSelectorT<Adapter>* selector,
+                        typename Adapter::node_t node,
+                        FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // MIPS64 doesn't support Word32 compare instructions. Instead it relies
+    // that the values in registers are correctly sign-extended and uses
+    // Word64 comparison instead. This behavior is correct in most cases,
+    // but doesn't work when comparing signed with unsigned operands.
+    // We could simulate full Word32 compare in all cases but this would
+    // create an unnecessary overhead since unsigned integers are rarely
+    // used in JavaScript.
+    // The solution proposed here tries to match a comparison of signed
+    // with unsigned operand, and perform full Word32Compare only
+    // in those cases. Unfortunately, the solution is not complete because
+    // it might skip cases where Word32 full compare is needed, so
+    // basically it is a hack.
+    // When call to a host function in simulator, if the function return a
+    // int32 value, the simulator do not sign-extended to int64 because in
+    // simulator we do not know the function whether return a int32 or int64.
+    // so we need do a full word32 compare in this case.
 #ifndef USE_SIMULATOR
-  if (IsNodeUnsigned(node->InputAt(0)) != IsNodeUnsigned(node->InputAt(1))) {
+    if (IsNodeUnsigned(node->InputAt(0)) != IsNodeUnsigned(node->InputAt(1))) {
 #else
-  if (IsNodeUnsigned(node->InputAt(0)) != IsNodeUnsigned(node->InputAt(1)) ||
-      node->InputAt(0)->opcode() == IrOpcode::kCall ||
-      node->InputAt(1)->opcode() == IrOpcode::kCall ) {
+    if (IsNodeUnsigned(node->InputAt(0)) != IsNodeUnsigned(node->InputAt(1)) ||
+        node->InputAt(0)->opcode() == IrOpcode::kCall ||
+        node->InputAt(1)->opcode() == IrOpcode::kCall ) {
 #endif
-    VisitFullWord32Compare(selector, node, kMips64Cmp, cont);
-  } else {
-    VisitOptimizedWord32Compare(selector, node, kMips64Cmp, cont);
+      VisitFullWord32Compare(selector, node, kMips64Cmp, cont);
+    } else {
+      VisitOptimizedWord32Compare(selector, node, kMips64Cmp, cont);
+    }
   }
 }
 
-void VisitWord64Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWord64Compare(InstructionSelectorT<Adapter>* selector, Node* node,
+                        FlagsContinuationT<Adapter>* cont) {
   VisitWordCompare(selector, node, kMips64Cmp, cont, false);
 }
 
-void EmitWordCompareZero(InstructionSelector* selector, Node* value,
-                         FlagsContinuation* cont) {
-  Mips64OperandGenerator g(selector);
+template <typename Adapter>
+void EmitWordCompareZero(InstructionSelectorT<Adapter>* selector, Node* value,
+                         FlagsContinuationT<Adapter>* cont) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   selector->EmitWithContinuation(kMips64Cmp, g.UseRegister(value),
                                  g.TempImmediate(0), cont);
 }
 
-void VisitAtomicLoad(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicLoad(InstructionSelectorT<Adapter>* selector, Node* node,
                      AtomicWidth width) {
-  Mips64OperandGenerator g(selector);
+  Mips64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -2279,9 +2697,15 @@ void VisitAtomicLoad(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitAtomicStore(InstructionSelector* selector, Node* node,
-                      AtomicWidth width) {
-  Mips64OperandGenerator g(selector);
+template <typename T>
+void VisitAtomicStore(InstructionSelectorT<TurboshaftAdapter>*, T,
+                      AtomicWidth) {
+  UNIMPLEMENTED();
+}
+
+void VisitAtomicStore(InstructionSelectorT<TurbofanAdapter>* selector,
+                      Node* node, AtomicWidth width) {
+  Mips64OperandGeneratorT<TurbofanAdapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2359,9 +2783,10 @@ void VisitAtomicStore(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitAtomicExchange(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicExchange(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode, AtomicWidth width) {
-  Mips64OperandGenerator g(selector);
+  Mips64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2383,9 +2808,11 @@ void VisitAtomicExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, input_count, inputs, 3, temp);
 }
 
-void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
-                                ArchOpcode opcode, AtomicWidth width) {
-  Mips64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitAtomicCompareExchange(InstructionSelectorT<Adapter>* selector,
+                                Node* node, ArchOpcode opcode,
+                                AtomicWidth width) {
+  Mips64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -2409,9 +2836,10 @@ void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, input_count, inputs, 3, temp);
 }
 
-void VisitAtomicBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                       ArchOpcode opcode, AtomicWidth width) {
-  Mips64OperandGenerator g(selector);
+  Mips64OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2436,13 +2864,26 @@ void VisitAtomicBinop(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuationT<Adapter>* cont) {
+  StackCheckKind kind;
+  node_t value;
+  if constexpr (Adapter::IsTurboshaft) {
+    const auto& op =
+        this->turboshaft_graph()
+            ->Get(node)
+            .template Cast<turboshaft::StackPointerGreaterThanOp>();
+    kind = op.kind;
+    value = op.stack_limit();
+  } else {
+    kind = StackCheckKindOf(node->op());
+    value = node->InputAt(0);
+  }
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
-  Mips64OperandGenerator g(this);
+  Mips64OperandGeneratorT<Adapter> g(this);
 
   // No outputs.
   InstructionOperand* const outputs = nullptr;
@@ -2458,7 +2899,6 @@ void InstructionSelector::VisitStackPointerGreaterThan(
                                  ? OperandGenerator::kUniqueRegister
                                  : OperandGenerator::kRegister;
 
-  Node* const value = node->InputAt(0);
   InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
   static constexpr int input_count = arraysize(inputs);
 
@@ -2467,360 +2907,466 @@ void InstructionSelector::VisitStackPointerGreaterThan(
 }
 
 // Shared routine for word comparisons against zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (CanCover(user, value)) {
-    if (value->opcode() == IrOpcode::kWord32Equal) {
-      Int32BinopMatcher m(value);
-      if (!m.right().Is(0)) break;
-      user = value;
-      value = m.left().node();
-    } else if (value->opcode() == IrOpcode::kWord64Equal) {
-      Int64BinopMatcher m(value);
-      if (!m.right().Is(0)) break;
-      user = value;
-      value = m.left().node();
-    } else {
-      break;
-    }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (CanCover(user, value)) {
+      if (value->opcode() == IrOpcode::kWord32Equal) {
+        Int32BinopMatcher m(value);
+        if (!m.right().Is(0)) break;
+        user = value;
+        value = m.left().node();
+      } else if (value->opcode() == IrOpcode::kWord64Equal) {
+        Int64BinopMatcher m(value);
+        if (!m.right().Is(0)) break;
+        user = value;
+        value = m.left().node();
+      } else {
+        break;
+      }
 
-    cont->Negate();
-  }
+      cont->Negate();
+    }
 
-  if (CanCover(user, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kWord64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kInt64LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kInt64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kUint64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kUint64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kFloat32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kProjection:
-        // Check if this is the overflow output projection of an
-        // <Operation>WithOverflow node.
-        if (ProjectionIndexOf(value->op()) == 1u) {
-          // We cannot combine the <Operation>WithOverflow with this branch
-          // unless the 0th projection (the use of the actual value of the
-          // <Operation> is either nullptr, which means there's no use of the
-          // actual value, or was already defined, which means it is scheduled
-          // *AFTER* this branch).
-          Node* const node = value->InputAt(0);
-          Node* const result = NodeProperties::FindProjection(node, 0);
-          if (result == nullptr || IsDefined(result)) {
-            switch (node->opcode()) {
-              case IrOpcode::kInt32AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kMips64Dadd, cont);
-              case IrOpcode::kInt32SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kMips64Dsub, cont);
-              case IrOpcode::kInt32MulWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kMips64MulOvf, cont);
-              case IrOpcode::kInt64MulWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kMips64DMulOvf, cont);
-              case IrOpcode::kInt64AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kMips64DaddOvf, cont);
-              case IrOpcode::kInt64SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kMips64DsubOvf, cont);
-              default:
-                break;
+    if (CanCover(user, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kWord64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kInt64LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kInt64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kUint64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kUint64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kFloat32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kProjection:
+          // Check if this is the overflow output projection of an
+          // <Operation>WithOverflow node.
+          if (ProjectionIndexOf(value->op()) == 1u) {
+            // We cannot combine the <Operation>WithOverflow with this branch
+            // unless the 0th projection (the use of the actual value of the
+            // <Operation> is either nullptr, which means there's no use of the
+            // actual value, or was already defined, which means it is scheduled
+            // *AFTER* this branch).
+            Node* const node = value->InputAt(0);
+            Node* const result = NodeProperties::FindProjection(node, 0);
+            if (result == nullptr || IsDefined(result)) {
+              switch (node->opcode()) {
+                case IrOpcode::kInt32AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kMips64Dadd, cont);
+                case IrOpcode::kInt32SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kMips64Dsub, cont);
+                case IrOpcode::kInt32MulWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kMips64MulOvf, cont);
+                case IrOpcode::kInt64MulWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kMips64DMulOvf, cont);
+                case IrOpcode::kInt64AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kMips64DaddOvf, cont);
+                case IrOpcode::kInt64SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop(this, node, kMips64DsubOvf, cont);
+                default:
+                  break;
+              }
             }
           }
-        }
-        break;
-      case IrOpcode::kWord32And:
-      case IrOpcode::kWord64And:
-        return VisitWordCompare(this, value, kMips64Tst, cont, true);
-      case IrOpcode::kStackPointerGreaterThan:
-        cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
-        return VisitStackPointerGreaterThan(value, cont);
-      default:
-        break;
+          break;
+        case IrOpcode::kWord32And:
+        case IrOpcode::kWord64And:
+          return VisitWordCompare(this, value, kMips64Tst, cont, true);
+        case IrOpcode::kStackPointerGreaterThan:
+          cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
+          return VisitStackPointerGreaterThan(value, cont);
+        default:
+          break;
+      }
     }
+
+    // Continuation could not be combined with a compare, emit compare against
+    // 0.
+    EmitWordCompareZero(this, value, cont);
   }
+}
 
-  // Continuation could not be combined with a compare, emit compare against 0.
-  EmitWordCompareZero(this, value, cont);
-}
-
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  Mips64OperandGenerator g(this);
-  InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
-
-  // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
-    static const size_t kMaxTableSwitchValueRange = 2 << 16;
-    size_t table_space_cost = 10 + 2 * sw.value_range();
-    size_t table_time_cost = 3;
-    size_t lookup_space_cost = 2 + 2 * sw.case_count();
-    size_t lookup_time_cost = sw.case_count();
-    if (sw.case_count() > 0 &&
-        table_space_cost + 3 * table_time_cost <=
-            lookup_space_cost + 3 * lookup_time_cost &&
-        sw.min_value() > std::numeric_limits<int32_t>::min() &&
-        sw.value_range() <= kMaxTableSwitchValueRange) {
-      InstructionOperand index_operand = value_operand;
-      if (sw.min_value()) {
-        index_operand = g.TempRegister();
-        Emit(kMips64Sub, index_operand, value_operand,
-             g.TempImmediate(sw.min_value()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
+
+    // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
+    if (enable_switch_jump_table_ ==
+        InstructionSelector::kEnableSwitchJumpTable) {
+      static const size_t kMaxTableSwitchValueRange = 2 << 16;
+      size_t table_space_cost = 10 + 2 * sw.value_range();
+      size_t table_time_cost = 3;
+      size_t lookup_space_cost = 2 + 2 * sw.case_count();
+      size_t lookup_time_cost = sw.case_count();
+      if (sw.case_count() > 0 &&
+          table_space_cost + 3 * table_time_cost <=
+              lookup_space_cost + 3 * lookup_time_cost &&
+          sw.min_value() > std::numeric_limits<int32_t>::min() &&
+          sw.value_range() <= kMaxTableSwitchValueRange) {
+        InstructionOperand index_operand = value_operand;
+        if (sw.min_value()) {
+          index_operand = g.TempRegister();
+          Emit(kMips64Sub, index_operand, value_operand,
+               g.TempImmediate(sw.min_value()));
+        }
+        // Generate a table lookup.
+        return EmitTableSwitch(sw, index_operand);
       }
-      // Generate a table lookup.
-      return EmitTableSwitch(sw, index_operand);
     }
-  }
 
-  // Generate a tree of conditional jumps.
-  return EmitBinarySearchSwitch(sw, value_operand);
+    // Generate a tree of conditional jumps.
+    return EmitBinarySearchSwitch(sw, value_operand);
+  }
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(0)) {
-    return VisitWordCompareZero(m.node(), m.left().node(), &cont);
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    Int32BinopMatcher m(node);
+    if (m.right().Is(0)) {
+      return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+    }
 
-  VisitWord32Compare(this, node, &cont);
+    VisitWord32Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kMips64Dadd, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kMips64Dadd, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kMips64Dadd, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kMips64Dadd, &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kMips64Dsub, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kMips64Dsub, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kMips64Dsub, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kMips64Dsub, &cont);
 }
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kMips64MulOvf, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kMips64MulOvf, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kMips64MulOvf, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kMips64MulOvf, &cont);
 }
 
-void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kMips64DMulOvf, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kMips64DMulOvf, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kMips64DMulOvf, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kMips64DMulOvf, &cont);
 }
 
-void InstructionSelector::VisitInt64AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kMips64DaddOvf, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kMips64DaddOvf, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kMips64DaddOvf, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kMips64DaddOvf, &cont);
 }
 
-void InstructionSelector::VisitInt64SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kMips64DsubOvf, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop(this, node, kMips64DsubOvf, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop(this, node, kMips64DsubOvf, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kMips64DsubOvf, &cont);
 }
 
-void InstructionSelector::VisitWord64Equal(Node* const node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int64BinopMatcher m(node);
-  if (m.right().Is(0)) {
-    return VisitWordCompareZero(m.node(), m.left().node(), &cont);
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    Int64BinopMatcher m(node);
+    if (m.right().Is(0)) {
+      return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+    }
 
-  VisitWord64Compare(this, node, &cont);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont =
+        FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont =
+        FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64ExtractLowWord32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64ExtractLowWord32(node_t node) {
   VisitRR(this, kMips64Float64ExtractLowWord32, node);
 }
 
-void InstructionSelector::VisitFloat64ExtractHighWord32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64ExtractHighWord32(node_t node) {
   VisitRR(this, kMips64Float64ExtractHighWord32, node);
 }
 
-void InstructionSelector::VisitFloat64SilenceNaN(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64SilenceNaN(node_t node) {
   VisitRR(this, kMips64Float64SilenceNaN, node);
 }
 
-void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
-  Mips64OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Emit(kMips64Float64InsertLowWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.UseRegister(right));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    Emit(kMips64Float64InsertLowWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.UseRegister(right));
+  }
 }
 
-void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
-  Mips64OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Emit(kMips64Float64InsertHighWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.UseRegister(right));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    Emit(kMips64Float64InsertHighWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.UseRegister(right));
+  }
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Sync, g.NoOutput());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Emit(kMips64Sync, g.NoOutput());
+  }
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
   VisitAtomicLoad(this, node, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
   VisitAtomicStore(this, node, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicLoad(Node* node) {
   VisitAtomicLoad(this, node, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord64AtomicStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicStore(node_t node) {
   VisitAtomicStore(this, node, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Int8()) {
@@ -2840,7 +3386,8 @@ void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicExchange(Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Uint8()) {
@@ -2857,7 +3404,9 @@ void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Int8()) {
@@ -2877,7 +3426,9 @@ void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
   VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicCompareExchange(
+    Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Uint8()) {
@@ -2893,33 +3444,40 @@ void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
   }
   VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord64);
 }
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
-    Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Int8()) {
-    opcode = int8_op;
-  } else if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Int16()) {
-    opcode = int16_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = word32_op;
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
-  }
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Int8()) {
+      opcode = int8_op;
+    } else if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Int16()) {
+      opcode = int16_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = word32_op;
+    } else {
+      UNREACHABLE();
+    }
 
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32);
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32);
+  }
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                            \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) { \
+    VisitWord32AtomicBinaryOperation(                                     \
+        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16,  \
+        kAtomic##op##Uint16, kAtomic##op##Word32);                        \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -2928,27 +3486,33 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitWord64AtomicBinaryOperation(
-    Node* node, ArchOpcode uint8_op, ArchOpcode uint16_op, ArchOpcode uint32_op,
-    ArchOpcode uint64_op) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Uint32()) {
-    opcode = uint32_op;
-  } else if (type == MachineType::Uint64()) {
-    opcode = uint64_op;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicBinaryOperation(
+    node_t node, ArchOpcode uint8_op, ArchOpcode uint16_op,
+    ArchOpcode uint32_op, ArchOpcode uint64_op) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Uint32()) {
+      opcode = uint32_op;
+    } else if (type == MachineType::Uint64()) {
+      opcode = uint64_op;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64);
   }
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64);
 }
 
 #define VISIT_ATOMIC_BINOP(op)                                                 \
-  void InstructionSelector::VisitWord64Atomic##op(Node* node) {                \
+  template <typename Adapter>                                                  \
+  void InstructionSelectorT<Adapter>::VisitWord64Atomic##op(Node* node) {      \
     VisitWord64AtomicBinaryOperation(node, kAtomic##op##Uint8,                 \
                                      kAtomic##op##Uint16, kAtomic##op##Word32, \
                                      kMips64Word64Atomic##op##Uint64);         \
@@ -2960,11 +3524,13 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
@@ -3134,8 +3700,9 @@ void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
   V(S128Xor, kMips64S128Xor)                             \
   V(S128AndNot, kMips64S128AndNot)
 
-void InstructionSelector::VisitS128Const(Node* node) {
-  Mips64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  Mips64OperandGeneratorT<Adapter> g(this);
   static const int kUint32Immediates = kSimd128Size / sizeof(uint32_t);
   uint32_t val[kUint32Immediates];
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
@@ -3154,21 +3721,25 @@ void InstructionSelector::VisitS128Const(Node* node) {
   }
 }
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  Mips64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  Mips64OperandGeneratorT<Adapter> g(this);
   Emit(kMips64S128Zero, g.DefineAsRegister(node));
 }
 
-#define SIMD_VISIT_SPLAT(Type)                               \
-  void InstructionSelector::Visit##Type##Splat(Node* node) { \
-    VisitRR(this, kMips64##Type##Splat, node);               \
+#define SIMD_VISIT_SPLAT(Type)                                         \
+  template <typename Adapter>                                          \
+  void InstructionSelectorT<Adapter>::Visit##Type##Splat(Node* node) { \
+    VisitRR(this, kMips64##Type##Splat, node);                         \
   }
 SIMD_TYPE_LIST(SIMD_VISIT_SPLAT)
 #undef SIMD_VISIT_SPLAT
 
-#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                              \
-  void InstructionSelector::Visit##Type##ExtractLane##Sign(Node* node) { \
-    VisitRRI(this, kMips64##Type##ExtractLane##Sign, node);              \
+#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                           \
+  template <typename Adapter>                                         \
+  void InstructionSelectorT<Adapter>::Visit##Type##ExtractLane##Sign( \
+      Node* node) {                                                   \
+    VisitRRI(this, kMips64##Type##ExtractLane##Sign, node);           \
   }
 SIMD_VISIT_EXTRACT_LANE(F64x2, )
 SIMD_VISIT_EXTRACT_LANE(F32x4, )
@@ -3180,30 +3751,34 @@ SIMD_VISIT_EXTRACT_LANE(I8x16, U)
 SIMD_VISIT_EXTRACT_LANE(I8x16, S)
 #undef SIMD_VISIT_EXTRACT_LANE
 
-#define SIMD_VISIT_REPLACE_LANE(Type)                              \
-  void InstructionSelector::Visit##Type##ReplaceLane(Node* node) { \
-    VisitRRIR(this, kMips64##Type##ReplaceLane, node);             \
+#define SIMD_VISIT_REPLACE_LANE(Type)                                        \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##ReplaceLane(Node* node) { \
+    VisitRRIR(this, kMips64##Type##ReplaceLane, node);                       \
   }
 SIMD_TYPE_LIST(SIMD_VISIT_REPLACE_LANE)
 #undef SIMD_VISIT_REPLACE_LANE
 
-#define SIMD_VISIT_UNOP(Name, instruction)            \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, instruction, node);                 \
+#define SIMD_VISIT_UNOP(Name, instruction)                      \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRR(this, instruction, node);                           \
   }
 SIMD_UNOP_LIST(SIMD_VISIT_UNOP)
 #undef SIMD_VISIT_UNOP
 
-#define SIMD_VISIT_SHIFT_OP(Name)                     \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitSimdShift(this, kMips64##Name, node);        \
+#define SIMD_VISIT_SHIFT_OP(Name)                               \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitSimdShift(this, kMips64##Name, node);                  \
   }
 SIMD_SHIFT_OP_LIST(SIMD_VISIT_SHIFT_OP)
 #undef SIMD_VISIT_SHIFT_OP
 
-#define SIMD_VISIT_BINOP(Name, instruction)           \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRR(this, instruction, node);                \
+#define SIMD_VISIT_BINOP(Name, instruction)                     \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRRR(this, instruction, node);                          \
   }
 SIMD_BINOP_LIST(SIMD_VISIT_BINOP)
 #undef SIMD_VISIT_BINOP
@@ -3223,12 +3798,16 @@ SIMD_BINOP_LIST(SIMD_VISIT_BINOP)
   V(I32x4RelaxedLaneSelect)      \
   V(I64x2RelaxedLaneSelect)
 
-#define SIMD_VISIT_RELAXED_OP(Name) \
-  void InstructionSelector::Visit##Name(Node* node) { UNREACHABLE(); }
+#define SIMD_VISIT_RELAXED_OP(Name)                             \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    UNREACHABLE();                                              \
+  }
 SIMD_RELAXED_OP_LIST(SIMD_VISIT_RELAXED_OP)
 #undef SIMD_VISIT_SHIFT_OP
 
-void InstructionSelector::VisitS128Select(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
   VisitRRRR(this, kMips64S128Select, node);
 }
 
@@ -3240,8 +3819,11 @@ void InstructionSelector::VisitS128Select(Node* node) {
   V(I16x8DotI8x16I7x16S)      \
   V(I32x4DotI8x16I7x16AddS)
 
-#define SIMD_VISIT_UNIMP_OP(Name) \
-  void InstructionSelector::Visit##Name(Node* node) { UNIMPLEMENTED(); }
+#define SIMD_VISIT_UNIMP_OP(Name)                               \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    UNIMPLEMENTED();                                            \
+  }
 SIMD_UNIMP_OP_LIST(SIMD_VISIT_UNIMP_OP)
 
 #undef SIMD_VISIT_UNIMP_OP
@@ -3327,7 +3909,8 @@ bool TryMatchArchShuffle(const uint8_t* shuffle, const ShuffleEntry* table,
 
 }  // namespace
 
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
@@ -3341,7 +3924,7 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
   Node* input0 = node->InputAt(0);
   Node* input1 = node->InputAt(1);
   uint8_t offset;
-  Mips64OperandGenerator g(this);
+  Mips64OperandGeneratorT<Adapter> g(this);
   if (wasm::SimdShuffle::TryMatchConcat(shuffle, &offset)) {
     Emit(kMips64S8x16Concat, g.DefineSameAsFirst(node), g.UseRegister(input1),
          g.UseRegister(input0), g.UseImmediate(offset));
@@ -3361,11 +3944,15 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
        g.UseImmediate(wasm::SimdShuffle::Pack4Lanes(shuffle + 12)));
 }
 #else
-void InstructionSelector::VisitI8x16Shuffle(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
+  UNREACHABLE();
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void InstructionSelector::VisitI8x16Swizzle(Node* node) {
-  Mips64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
+  Mips64OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   // We don't want input 0 or input 1 to be the same as output, since we will
   // modify output before do the calculation.
@@ -3374,56 +3961,69 @@ void InstructionSelector::VisitI8x16Swizzle(Node* node) {
        g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt32(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Seb, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt32(node_t node) {
+  VisitRR(this, kMips64Seb, node);
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt32(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Seh, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt32(node_t node) {
+  VisitRR(this, kMips64Seh, node);
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt64(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Seb, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt64(node_t node) {
+  VisitRR(this, kMips64Seb, node);
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt64(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Seh, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt64(node_t node) {
+  VisitRR(this, kMips64Seh, node);
 }
 
-void InstructionSelector::VisitSignExtendWord32ToInt64(Node* node) {
-  Mips64OperandGenerator g(this);
-  Emit(kMips64Shl, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
-       g.TempImmediate(0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Mips64OperandGeneratorT<Adapter> g(this);
+    Emit(kMips64Shl, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
+         g.TempImmediate(0));
+  }
 }
 
-void InstructionSelector::VisitF32x4Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmin(Node* node) {
   VisitUniqueRRR(this, kMips64F32x4Pmin, node);
 }
 
-void InstructionSelector::VisitF32x4Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmax(Node* node) {
   VisitUniqueRRR(this, kMips64F32x4Pmax, node);
 }
 
-void InstructionSelector::VisitF64x2Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmin(Node* node) {
   VisitUniqueRRR(this, kMips64F64x2Pmin, node);
 }
 
-void InstructionSelector::VisitF64x2Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmax(Node* node) {
   VisitUniqueRRR(this, kMips64F64x2Pmax, node);
 }
 
 #define VISIT_EXT_MUL(OPCODE1, OPCODE2, TYPE)                                  \
-  void InstructionSelector::Visit##OPCODE1##ExtMulLow##OPCODE2(Node* node) {   \
-    Mips64OperandGenerator g(this);                                            \
+  template <typename Adapter>                                                  \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE1##ExtMulLow##OPCODE2(      \
+      Node* node) {                                                            \
+    Mips64OperandGeneratorT<Adapter> g(this);                                  \
     Emit(kMips64ExtMulLow | MiscField::encode(TYPE), g.DefineAsRegister(node), \
          g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));    \
   }                                                                            \
-  void InstructionSelector::Visit##OPCODE1##ExtMulHigh##OPCODE2(Node* node) {  \
-    Mips64OperandGenerator g(this);                                            \
+  template <typename Adapter>                                                  \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE1##ExtMulHigh##OPCODE2(     \
+      Node* node) {                                                            \
+    Mips64OperandGeneratorT<Adapter> g(this);                                  \
     Emit(kMips64ExtMulHigh | MiscField::encode(TYPE),                          \
          g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),            \
          g.UseRegister(node->InputAt(1)));                                     \
@@ -3438,8 +4038,9 @@ VISIT_EXT_MUL(I16x8, I8x16U, MSAU8)
 #undef VISIT_EXT_MUL
 
 #define VISIT_EXTADD_PAIRWISE(OPCODE, TYPE)                          \
-  void InstructionSelector::Visit##OPCODE(Node* node) {              \
-    Mips64OperandGenerator g(this);                                  \
+  template <typename Adapter>                                        \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE(Node* node) {    \
+    Mips64OperandGeneratorT<Adapter> g(this);                        \
     Emit(kMips64ExtAddPairwise | MiscField::encode(TYPE),            \
          g.DefineAsRegister(node), g.UseRegister(node->InputAt(0))); \
   }
@@ -3449,12 +4050,25 @@ VISIT_EXTADD_PAIRWISE(I32x4ExtAddPairwiseI16x8S, MSAS16)
 VISIT_EXTADD_PAIRWISE(I32x4ExtAddPairwiseI16x8U, MSAU16)
 #undef VISIT_EXTADD_PAIRWISE
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGenerator* g, int first_input_index, node_t node) {
   UNREACHABLE();
 }
 
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
+
+template <>
+TurboshaftAdapter::node_t
+InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    node_t node, size_t projection_index) {
+  UNIMPLEMENTED();
+}
+
 // static
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
@@ -3489,6 +4103,11 @@ InstructionSelector::AlignmentRequirements() {
   }
 }
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 #undef SIMD_BINOP_LIST
 #undef SIMD_SHIFT_OP_LIST
 #undef SIMD_RELAXED_OP_LIST
diff --git a/deps/v8/src/compiler/backend/move-optimizer.cc b/deps/v8/src/compiler/backend/move-optimizer.cc
index e901c228197a0c..a60c78522a351e 100644
--- a/deps/v8/src/compiler/backend/move-optimizer.cc
+++ b/deps/v8/src/compiler/backend/move-optimizer.cc
@@ -15,19 +15,18 @@ namespace {
 struct MoveKey {
   InstructionOperand source;
   InstructionOperand destination;
-};
-
-struct MoveKeyCompare {
-  bool operator()(const MoveKey& a, const MoveKey& b) const {
-    if (a.source.EqualsCanonicalized(b.source)) {
-      return a.destination.CompareCanonicalized(b.destination);
+  bool operator<(const MoveKey& other) const {
+    if (this->source != other.source) {
+      return this->source.Compare(other.source);
     }
-    return a.source.CompareCanonicalized(b.source);
+    return this->destination.Compare(other.destination);
+  }
+  bool operator==(const MoveKey& other) const {
+    return std::tie(this->source, this->destination) ==
+           std::tie(other.source, other.destination);
   }
 };
 
-using MoveMap = ZoneMap<MoveKey, unsigned, MoveKeyCompare>;
-
 class OperandSet {
  public:
   explicit OperandSet(ZoneVector<InstructionOperand>* buffer)
@@ -241,14 +240,19 @@ void MoveOptimizer::MigrateMoves(Instruction* to, Instruction* from) {
     src_cant_be.InsertOp(move->destination());
   }
 
-  ZoneSet<MoveKey, MoveKeyCompare> move_candidates(local_zone());
+  // This set is usually small, e.g., for JetStream2 it has 16 elements or less
+  // in 99.99% of the cases, hence use inline storage and fast linear search.
+  // It is encoded as a `SmallMap` to `Dummy` values, since we don't have an
+  // equivalent `SmallSet` type.
+  struct Dummy {};
+  SmallZoneMap<MoveKey, Dummy, 16> move_candidates(local_zone());
   // We start with all the moves that don't have conflicting source or
   // destination operands are eligible for being moved down.
   for (MoveOperands* move : *from_moves) {
     if (move->IsRedundant()) continue;
     if (!dst_cant_be.ContainsOpOrAlias(move->destination())) {
       MoveKey key = {move->source(), move->destination()};
-      move_candidates.insert(key);
+      move_candidates.emplace(key, Dummy{});
     }
   }
   if (move_candidates.empty()) return;
@@ -258,13 +262,13 @@ void MoveOptimizer::MigrateMoves(Instruction* to, Instruction* from) {
   do {
     changed = false;
     for (auto iter = move_candidates.begin(); iter != move_candidates.end();) {
-      auto current = iter;
-      ++iter;
-      InstructionOperand src = current->source;
-      if (src_cant_be.ContainsOpOrAlias(src)) {
-        src_cant_be.InsertOp(current->destination);
-        move_candidates.erase(current);
+      auto [move, _] = *iter;
+      if (src_cant_be.ContainsOpOrAlias(move.source)) {
+        src_cant_be.InsertOp(move.destination);
+        iter = move_candidates.erase(iter);
         changed = true;
+      } else {
+        ++iter;
       }
     }
   } while (changed);
@@ -392,8 +396,11 @@ void MoveOptimizer::OptimizeMerge(InstructionBlock* block) {
       if (!op->IsConstant() && !op->IsImmediate()) return;
     }
   }
-  // TODO(dcarney): pass a ZoneStats down for this?
-  MoveMap move_map(local_zone());
+
+  // This map is usually small, e.g., for JetStream2 in 99.5% of the cases it
+  // has 16 elements or less. Hence use a `SmallMap` with inline storage and
+  // fast linear search in the common case.
+  SmallZoneMap<MoveKey, /* count */ size_t, 16> move_map(local_zone());
   size_t correct_counts = 0;
   // Accumulate set of shared moves.
   for (RpoNumber& pred_index : block->predecessors()) {
@@ -408,10 +415,10 @@ void MoveOptimizer::OptimizeMerge(InstructionBlock* block) {
       InstructionOperand src = move->source();
       InstructionOperand dst = move->destination();
       MoveKey key = {src, dst};
-      auto res = move_map.insert(std::make_pair(key, 1));
-      if (!res.second) {
-        res.first->second++;
-        if (res.first->second == block->PredecessorCount()) {
+      auto [it, inserted] = move_map.emplace(key, 1);
+      if (!inserted) {
+        it->second++;
+        if (it->second == block->PredecessorCount()) {
           correct_counts++;
         }
       }
@@ -426,17 +433,17 @@ void MoveOptimizer::OptimizeMerge(InstructionBlock* block) {
     // Moves that are unique to each predecessor won't be pushed to the common
     // successor.
     OperandSet conflicting_srcs(&operand_buffer1);
-    for (auto iter = move_map.begin(), end = move_map.end(); iter != end;) {
-      auto current = iter;
-      ++iter;
-      if (current->second != block->PredecessorCount()) {
-        InstructionOperand dest = current->first.destination;
+    for (auto iter = move_map.begin(); iter != move_map.end();) {
+      auto [move, count] = *iter;
+      if (count != block->PredecessorCount()) {
         // Not all the moves in all the gaps are the same. Maybe some are. If
         // there are such moves, we could move them, but the destination of the
         // moves staying behind can't appear as a source of a common move,
         // because the move staying behind will clobber this destination.
-        conflicting_srcs.InsertOp(dest);
-        move_map.erase(current);
+        conflicting_srcs.InsertOp(move.destination);
+        iter = move_map.erase(iter);
+      } else {
+        ++iter;
       }
     }
 
@@ -445,14 +452,16 @@ void MoveOptimizer::OptimizeMerge(InstructionBlock* block) {
       // If a common move can't be pushed to the common successor, then its
       // destination also can't appear as source to any move being pushed.
       changed = false;
-      for (auto iter = move_map.begin(), end = move_map.end(); iter != end;) {
-        auto current = iter;
-        ++iter;
-        DCHECK_EQ(block->PredecessorCount(), current->second);
-        if (conflicting_srcs.ContainsOpOrAlias(current->first.source)) {
-          conflicting_srcs.InsertOp(current->first.destination);
-          move_map.erase(current);
+      for (auto iter = move_map.begin(); iter != move_map.end();) {
+        auto [move, count] = *iter;
+        DCHECK_EQ(block->PredecessorCount(), count);
+        USE(count);
+        if (conflicting_srcs.ContainsOpOrAlias(move.source)) {
+          conflicting_srcs.InsertOp(move.destination);
+          iter = move_map.erase(iter);
           changed = true;
+        } else {
+          ++iter;
         }
       }
     } while (changed);
diff --git a/deps/v8/src/compiler/backend/move-optimizer.h b/deps/v8/src/compiler/backend/move-optimizer.h
index a63bd52d737360..a261ead0fd1316 100644
--- a/deps/v8/src/compiler/backend/move-optimizer.h
+++ b/deps/v8/src/compiler/backend/move-optimizer.h
@@ -5,7 +5,6 @@
 #ifndef V8_COMPILER_BACKEND_MOVE_OPTIMIZER_H_
 #define V8_COMPILER_BACKEND_MOVE_OPTIMIZER_H_
 
-#include "src/common/globals.h"
 #include "src/compiler/backend/instruction.h"
 #include "src/zone/zone-containers.h"
 
@@ -23,7 +22,6 @@ class V8_EXPORT_PRIVATE MoveOptimizer final {
 
  private:
   using MoveOpVector = ZoneVector<MoveOperands*>;
-  using Instructions = ZoneVector<Instruction*>;
 
   InstructionSequence* code() const { return code_; }
   Zone* local_zone() const { return local_zone_; }
diff --git a/deps/v8/src/compiler/backend/ppc/code-generator-ppc.cc b/deps/v8/src/compiler/backend/ppc/code-generator-ppc.cc
index a3492faf0fea80..e4dcafd7c1281b 100644
--- a/deps/v8/src/compiler/backend/ppc/code-generator-ppc.cc
+++ b/deps/v8/src/compiler/backend/ppc/code-generator-ppc.cc
@@ -800,7 +800,7 @@ void CodeGenerator::BailoutIfDeoptimized() {
   int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
   __ LoadTaggedField(r11, MemOperand(kJavaScriptCallCodeStartRegister, offset),
                      r0);
-  __ LoadU16(r11, FieldMemOperand(r11, Code::kKindSpecificFlagsOffset), r0);
+  __ LoadU32(r11, FieldMemOperand(r11, Code::kFlagsOffset), r0);
   __ TestBit(r11, Code::kMarkedForDeoptimizationBit);
   __ Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
           RelocInfo::CODE_TARGET, ne, cr0);
@@ -833,7 +833,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchCallBuiltinPointer: {
       DCHECK(!instr->InputAt(0)->IsImmediate());
       Register builtin_index = i.InputRegister(0);
-      __ CallBuiltinByIndex(builtin_index);
+      Register target =
+          instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister)
+              ? kJavaScriptCallCodeStartRegister
+              : builtin_index;
+      __ CallBuiltinByIndex(builtin_index, target);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -918,10 +922,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ CmpS64(cp, kScratchReg);
         __ Assert(eq, AbortReason::kWrongFunctionContext);
       }
-      static_assert(kJavaScriptCallCodeStartRegister == r5, "ABI mismatch");
-      __ LoadTaggedField(r5, FieldMemOperand(func, JSFunction::kCodeOffset),
-                         r0);
-      __ CallCodeObject(r5);
+      __ CallJSFunction(func, kScratchReg);
       RecordCallPosition(instr);
       DCHECK_EQ(LeaveRC, i.OutputRCBit());
       frame_access_state()->ClearSPDelta();
@@ -1167,6 +1168,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier:
+      UNREACHABLE();
     case kArchStackSlot: {
       FrameOffset offset =
           frame_access_state()->GetFrameOffset(i.InputInt32(0));
@@ -2237,6 +2240,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
   V(I32x4Eq)               \
   V(I32x4GtS)              \
   V(I32x4GtU)              \
+  V(I32x4DotI16x8S)        \
   V(I16x8Add)              \
   V(I16x8Sub)              \
   V(I16x8Mul)              \
@@ -2254,6 +2258,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
   V(I16x8SConvertI32x4)    \
   V(I16x8UConvertI32x4)    \
   V(I16x8RoundingAverageU) \
+  V(I16x8Q15MulRSatS)      \
   V(I8x16Add)              \
   V(I8x16Sub)              \
   V(I8x16MinS)             \
@@ -2305,7 +2310,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
   V(I32x4ExtMulHighI16x8S)              \
   V(I32x4ExtMulLowI16x8U)               \
   V(I32x4ExtMulHighI16x8U)              \
-  V(I32x4DotI16x8S)                     \
   V(I16x8Ne)                            \
   V(I16x8GeS)                           \
   V(I16x8GeU)                           \
@@ -2313,7 +2317,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
   V(I16x8ExtMulHighI8x16S)              \
   V(I16x8ExtMulLowI8x16U)               \
   V(I16x8ExtMulHighI8x16U)              \
-  V(I16x8Q15MulRSatS)                   \
   V(I16x8DotI8x16S)                     \
   V(I8x16Ne)                            \
   V(I8x16GeS)                           \
@@ -2880,31 +2883,16 @@ void CodeGenerator::AssembleArchTrap(Instruction* instr,
 
    private:
     void GenerateCallToTrap(TrapId trap_id) {
-      if (trap_id == TrapId::kInvalid) {
-        // We cannot test calls to the runtime in cctest/test-run-wasm.
-        // Therefore we emit a call to C here instead of a call to the runtime.
-        // We use the context register as the scratch register, because we do
-        // not have a context here.
-        __ PrepareCallCFunction(0, 0, cp);
-        __ CallCFunction(
-            ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-        __ LeaveFrame(StackFrame::WASM);
-        auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-        int pop_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-        __ Drop(pop_count);
-        __ Ret();
-      } else {
-        gen_->AssembleSourcePosition(instr_);
-        // A direct call to a wasm runtime stub defined in this module.
-        // Just encode the stub index. This will be patched when the code
-        // is added to the native module and copied into wasm code space.
-        __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-        ReferenceMap* reference_map =
-            gen_->zone()->New<ReferenceMap>(gen_->zone());
-        gen_->RecordSafepoint(reference_map);
-        if (v8_flags.debug_code) {
-          __ stop();
-        }
+      gen_->AssembleSourcePosition(instr_);
+      // A direct call to a wasm runtime stub defined in this module.
+      // Just encode the stub index. This will be patched when the code
+      // is added to the native module and copied into wasm code space.
+      __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+      ReferenceMap* reference_map =
+          gen_->zone()->New<ReferenceMap>(gen_->zone());
+      gen_->RecordSafepoint(reference_map);
+      if (v8_flags.debug_code) {
+        __ stop();
       }
     }
 
@@ -3004,7 +2992,7 @@ void CodeGenerator::AssembleArchTableSwitch(Instruction* instr) {
   PPCOperandConverter i(this, instr);
   Register input = i.InputRegister(0);
   int32_t const case_count = static_cast<int32_t>(instr->InputCount() - 2);
-  Label** cases = zone()->NewArray<Label*>(case_count);
+  Label** cases = zone()->AllocateArray<Label*>(case_count);
   for (int32_t index = 0; index < case_count; ++index) {
     cases[index] = GetLabel(i.InputRpo(index + 2));
   }
@@ -3318,10 +3306,10 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 }
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
-  int new_slots = ElementSizeInPointers(rep);
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = ElementSizeInPointers(rep);
   PPCOperandConverter g(this, nullptr);
   if (dest->IsFloatStackSlot() || dest->IsDoubleStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     UseScratchRegisterScope temps(masm());
     Register scratch = temps.Acquire();
     __ Pop(scratch);
@@ -3330,12 +3318,13 @@ void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ addi(sp, sp, Operand(new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ addi(sp, sp, Operand(dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
diff --git a/deps/v8/src/compiler/backend/ppc/instruction-selector-ppc.cc b/deps/v8/src/compiler/backend/ppc/instruction-selector-ppc.cc
index 87be6d6c5293ee..09bc3166b1e442 100644
--- a/deps/v8/src/compiler/backend/ppc/instruction-selector-ppc.cc
+++ b/deps/v8/src/compiler/backend/ppc/instruction-selector-ppc.cc
@@ -24,10 +24,14 @@ enum ImmediateMode {
 };
 
 // Adds PPC-specific methods for generating operands.
-class PPCOperandGenerator final : public OperandGenerator {
+template <typename Adapter>
+class PPCOperandGeneratorT final : public OperandGeneratorT<Adapter> {
  public:
-  explicit PPCOperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit PPCOperandGeneratorT<Adapter>(
+      InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
 
   InstructionOperand UseOperand(Node* node, ImmediateMode mode) {
     if (CanBeImmediate(node, mode)) {
@@ -72,33 +76,37 @@ class PPCOperandGenerator final : public OperandGenerator {
 
 namespace {
 
-void VisitRR(InstructionSelector* selector, InstructionCode opcode,
+template <typename Adapter>
+void VisitRR(InstructionSelectorT<Adapter>* selector, InstructionCode opcode,
              Node* node) {
-  PPCOperandGenerator g(selector);
+  PPCOperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)));
 }
 
-void VisitRRR(InstructionSelector* selector, InstructionCode opcode,
+template <typename Adapter>
+void VisitRRR(InstructionSelectorT<Adapter>* selector, InstructionCode opcode,
               Node* node) {
-  PPCOperandGenerator g(selector);
+  PPCOperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
 }
 
-void VisitRRO(InstructionSelector* selector, InstructionCode opcode, Node* node,
-              ImmediateMode operand_mode) {
-  PPCOperandGenerator g(selector);
+template <typename Adapter>
+void VisitRRO(InstructionSelectorT<Adapter>* selector, InstructionCode opcode,
+              Node* node, ImmediateMode operand_mode) {
+  PPCOperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseOperand(node->InputAt(1), operand_mode));
 }
 
 #if V8_TARGET_ARCH_PPC64
-void VisitTryTruncateDouble(InstructionSelector* selector,
+template <typename Adapter>
+void VisitTryTruncateDouble(InstructionSelectorT<Adapter>* selector,
                             InstructionCode opcode, Node* node) {
-  PPCOperandGenerator g(selector);
+  PPCOperandGeneratorT<Adapter> g(selector);
   InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
@@ -114,11 +122,11 @@ void VisitTryTruncateDouble(InstructionSelector* selector,
 #endif
 
 // Shared routine for multiple binary operations.
-template <typename Matcher>
-void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter, typename Matcher>
+void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                 InstructionCode opcode, ImmediateMode operand_mode,
-                FlagsContinuation* cont) {
-  PPCOperandGenerator g(selector);
+                FlagsContinuationT<Adapter>* cont) {
+  PPCOperandGeneratorT<Adapter> g(selector);
   Matcher m(node);
   InstructionOperand inputs[4];
   size_t input_count = 0;
@@ -147,61 +155,76 @@ void VisitBinop(InstructionSelector* selector, Node* node,
 }
 
 // Shared routine for multiple binary operations.
-template <typename Matcher>
-void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter, typename Matcher>
+void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                 InstructionCode opcode, ImmediateMode operand_mode) {
-  FlagsContinuation cont;
-  VisitBinop<Matcher>(selector, node, opcode, operand_mode, &cont);
+  FlagsContinuationT<Adapter> cont;
+  VisitBinop<Adapter, Matcher>(selector, node, opcode, operand_mode, &cont);
 }
 
 }  // namespace
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
-  int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
-  OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+    int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
+    OperandGenerator g(this);
 
-  Emit(kArchStackSlot, g.DefineAsRegister(node),
-       sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+    Emit(kArchStackSlot, g.DefineAsRegister(node),
+         sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+  }
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), r4));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), r4));
+  }
 }
 
-static void VisitLoadCommon(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+static void VisitLoadCommon(InstructionSelectorT<Adapter>* selector, Node* node,
                             LoadRepresentation load_rep) {
-  PPCOperandGenerator g(selector);
-  Node* base = node->InputAt(0);
-  Node* offset = node->InputAt(1);
-  InstructionCode opcode = kArchNop;
-  ImmediateMode mode;
-  if (CpuFeatures::IsSupported(PPC_10_PLUS)) {
-    mode = kInt34Imm;
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    mode = kInt16Imm;
-  }
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kFloat32:
-      opcode = kPPC_LoadFloat32;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kPPC_LoadDouble;
-      break;
-    case MachineRepresentation::kBit:  // Fall through.
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsSigned() ? kPPC_LoadWordS8 : kPPC_LoadWordU8;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsSigned() ? kPPC_LoadWordS16 : kPPC_LoadWordU16;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kPPC_LoadWordU32;
-      break;
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kCompressed:
-    case MachineRepresentation::kSandboxedPointer:  // Fall through.
+    PPCOperandGeneratorT<Adapter> g(selector);
+    Node* base = node->InputAt(0);
+    Node* offset = node->InputAt(1);
+    InstructionCode opcode = kArchNop;
+    ImmediateMode mode;
+    if (CpuFeatures::IsSupported(PPC_10_PLUS)) {
+      mode = kInt34Imm;
+    } else {
+      mode = kInt16Imm;
+    }
+    switch (load_rep.representation()) {
+      case MachineRepresentation::kFloat32:
+        opcode = kPPC_LoadFloat32;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kPPC_LoadDouble;
+        break;
+      case MachineRepresentation::kBit:  // Fall through.
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsSigned() ? kPPC_LoadWordS8 : kPPC_LoadWordU8;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsSigned() ? kPPC_LoadWordS16 : kPPC_LoadWordU16;
+        break;
+      case MachineRepresentation::kWord32:
+        opcode = kPPC_LoadWordU32;
+        break;
+      case MachineRepresentation::kCompressedPointer:  // Fall through.
+      case MachineRepresentation::kCompressed:
+      case MachineRepresentation::kIndirectPointer:  // Fall through.
+      case MachineRepresentation::kSandboxedPointer:  // Fall through.
 #ifdef V8_COMPRESS_POINTERS
       opcode = kPPC_LoadWordS32;
       if (mode != kInt34Imm) mode = kInt16Imm_4ByteAligned;
@@ -237,7 +260,7 @@ static void VisitLoadCommon(InstructionSelector* selector, Node* node,
     case MachineRepresentation::kMapWord:  // Fall through.
     case MachineRepresentation::kNone:
       UNREACHABLE();
-  }
+    }
 
   bool is_atomic = (node->opcode() == IrOpcode::kWord32AtomicLoad ||
                     node->opcode() == IrOpcode::kWord64AtomicLoad);
@@ -259,22 +282,31 @@ static void VisitLoadCommon(InstructionSelector* selector, Node* node,
                    g.DefineAsRegister(node), g.UseRegister(base),
                    g.UseRegister(offset), g.UseImmediate(is_atomic));
   }
+  }
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  typename Adapter::LoadView load = this->load_view(node);
+  LoadRepresentation load_rep = load.loaded_rep();
   VisitLoadCommon(this, node, load_rep);
+  }
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-void VisitStoreCommon(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitStoreCommon(InstructionSelectorT<Adapter>* selector, Node* node,
                       StoreRepresentation store_rep,
                       base::Optional<AtomicMemoryOrder> atomic_order) {
-  PPCOperandGenerator g(selector);
+  PPCOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* offset = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -358,6 +390,7 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
         break;
       case MachineRepresentation::kCompressedPointer:  // Fall through.
       case MachineRepresentation::kCompressed:
+      case MachineRepresentation::kIndirectPointer:  // Fall through.
       case MachineRepresentation::kSandboxedPointer:  // Fall through.
 #ifdef V8_COMPRESS_POINTERS
         opcode = kPPC_StoreCompressTagged;
@@ -411,27 +444,44 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
   }
 }
 
-void InstructionSelector::VisitStore(Node* node) {
-  VisitStoreCommon(this, node, StoreRepresentationOf(node->op()),
-                   base::nullopt);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitStoreCommon(this, node, StoreRepresentationOf(node->op()),
+                     base::nullopt);
+  }
 }
 
-void InstructionSelector::VisitProtectedStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
 // Architecture supports unaligned access, therefore VisitLoad is used instead
-void InstructionSelector::VisitUnalignedLoad(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  UNREACHABLE();
+}
 
 // Architecture supports unaligned access, therefore VisitStore is used instead
-void InstructionSelector::VisitUnalignedStore(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedStore(node_t node) {
+  UNREACHABLE();
+}
 
-template <typename Matcher>
-static void VisitLogical(InstructionSelector* selector, Node* node, Matcher* m,
-                         ArchOpcode opcode, bool left_can_cover,
+template <typename Adapter, typename Matcher>
+static void VisitLogical(InstructionSelectorT<Adapter>* selector, Node* node,
+                         Matcher* m, ArchOpcode opcode, bool left_can_cover,
                          bool right_can_cover, ImmediateMode imm_mode) {
-  PPCOperandGenerator g(selector);
+  PPCOperandGeneratorT<Adapter> g(selector);
 
   // Map instruction to equivalent operation with inverted right input.
   ArchOpcode inv_opcode = opcode;
@@ -470,7 +520,7 @@ static void VisitLogical(InstructionSelector* selector, Node* node, Matcher* m,
     }
   }
 
-  VisitBinop<Matcher>(selector, node, opcode, imm_mode);
+  VisitBinop<Adapter, Matcher>(selector, node, opcode, imm_mode);
 }
 
 static inline bool IsContiguousMask32(uint32_t value, int* mb, int* me) {
@@ -498,134 +548,174 @@ static inline bool IsContiguousMask64(uint64_t value, int* mb, int* me) {
 #endif
 
 // TODO(mbrandy): Absorb rotate-right into rlwinm?
-void InstructionSelector::VisitWord32And(Node* node) {
-  PPCOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  int mb = 0;
-  int me = 0;
-  if (m.right().HasResolvedValue() &&
-      IsContiguousMask32(m.right().ResolvedValue(), &mb, &me)) {
-    int sh = 0;
-    Node* left = m.left().node();
-    if ((m.left().IsWord32Shr() || m.left().IsWord32Shl()) &&
-        CanCover(node, left)) {
-      // Try to absorb left/right shift into rlwinm
-      Int32BinopMatcher mleft(m.left().node());
-      if (mleft.right().IsInRange(0, 31)) {
-        left = mleft.left().node();
-        sh = mleft.right().ResolvedValue();
-        if (m.left().IsWord32Shr()) {
-          // Adjust the mask such that it doesn't include any rotated bits.
-          if (mb > 31 - sh) mb = 31 - sh;
-          sh = (32 - sh) & 0x1F;
-        } else {
-          // Adjust the mask such that it doesn't include any rotated bits.
-          if (me < sh) me = sh;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32And(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    int mb = 0;
+    int me = 0;
+    if (m.right().HasResolvedValue() &&
+        IsContiguousMask32(m.right().ResolvedValue(), &mb, &me)) {
+      int sh = 0;
+      Node* left = m.left().node();
+      if ((m.left().IsWord32Shr() || m.left().IsWord32Shl()) &&
+          CanCover(node, left)) {
+        // Try to absorb left/right shift into rlwinm
+        Int32BinopMatcher mleft(m.left().node());
+        if (mleft.right().IsInRange(0, 31)) {
+          left = mleft.left().node();
+          sh = mleft.right().ResolvedValue();
+          if (m.left().IsWord32Shr()) {
+            // Adjust the mask such that it doesn't include any rotated bits.
+            if (mb > 31 - sh) mb = 31 - sh;
+            sh = (32 - sh) & 0x1F;
+          } else {
+            // Adjust the mask such that it doesn't include any rotated bits.
+            if (me < sh) me = sh;
+          }
         }
       }
+      if (mb >= me) {
+        Emit(kPPC_RotLeftAndMask32, g.DefineAsRegister(node),
+             g.UseRegister(left), g.TempImmediate(sh), g.TempImmediate(mb),
+             g.TempImmediate(me));
+        return;
+      }
     }
-    if (mb >= me) {
-      Emit(kPPC_RotLeftAndMask32, g.DefineAsRegister(node), g.UseRegister(left),
-           g.TempImmediate(sh), g.TempImmediate(mb), g.TempImmediate(me));
-      return;
-    }
+    VisitLogical<Adapter, Int32BinopMatcher>(
+        this, node, &m, kPPC_And, CanCover(node, m.left().node()),
+        CanCover(node, m.right().node()), kInt16Imm_Unsigned);
   }
-  VisitLogical<Int32BinopMatcher>(
-      this, node, &m, kPPC_And, CanCover(node, m.left().node()),
-      CanCover(node, m.right().node()), kInt16Imm_Unsigned);
 }
 
 #if V8_TARGET_ARCH_PPC64
 // TODO(mbrandy): Absorb rotate-right into rldic?
-void InstructionSelector::VisitWord64And(Node* node) {
-  PPCOperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  int mb = 0;
-  int me = 0;
-  if (m.right().HasResolvedValue() &&
-      IsContiguousMask64(m.right().ResolvedValue(), &mb, &me)) {
-    int sh = 0;
-    Node* left = m.left().node();
-    if ((m.left().IsWord64Shr() || m.left().IsWord64Shl()) &&
-        CanCover(node, left)) {
-      // Try to absorb left/right shift into rldic
-      Int64BinopMatcher mleft(m.left().node());
-      if (mleft.right().IsInRange(0, 63)) {
-        left = mleft.left().node();
-        sh = mleft.right().ResolvedValue();
-        if (m.left().IsWord64Shr()) {
-          // Adjust the mask such that it doesn't include any rotated bits.
-          if (mb > 63 - sh) mb = 63 - sh;
-          sh = (64 - sh) & 0x3F;
-        } else {
-          // Adjust the mask such that it doesn't include any rotated bits.
-          if (me < sh) me = sh;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64And(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    int mb = 0;
+    int me = 0;
+    if (m.right().HasResolvedValue() &&
+        IsContiguousMask64(m.right().ResolvedValue(), &mb, &me)) {
+      int sh = 0;
+      Node* left = m.left().node();
+      if ((m.left().IsWord64Shr() || m.left().IsWord64Shl()) &&
+          CanCover(node, left)) {
+        // Try to absorb left/right shift into rldic
+        Int64BinopMatcher mleft(m.left().node());
+        if (mleft.right().IsInRange(0, 63)) {
+          left = mleft.left().node();
+          sh = mleft.right().ResolvedValue();
+          if (m.left().IsWord64Shr()) {
+            // Adjust the mask such that it doesn't include any rotated bits.
+            if (mb > 63 - sh) mb = 63 - sh;
+            sh = (64 - sh) & 0x3F;
+          } else {
+            // Adjust the mask such that it doesn't include any rotated bits.
+            if (me < sh) me = sh;
+          }
         }
       }
-    }
-    if (mb >= me) {
-      bool match = false;
-      ArchOpcode opcode;
-      int mask;
-      if (me == 0) {
-        match = true;
-        opcode = kPPC_RotLeftAndClearLeft64;
-        mask = mb;
-      } else if (mb == 63) {
-        match = true;
-        opcode = kPPC_RotLeftAndClearRight64;
-        mask = me;
-      } else if (sh && me <= sh && m.left().IsWord64Shl()) {
-        match = true;
-        opcode = kPPC_RotLeftAndClear64;
-        mask = mb;
-      }
-      if (match) {
-        Emit(opcode, g.DefineAsRegister(node), g.UseRegister(left),
-             g.TempImmediate(sh), g.TempImmediate(mask));
-        return;
+      if (mb >= me) {
+        bool match = false;
+        ArchOpcode opcode;
+        int mask;
+        if (me == 0) {
+          match = true;
+          opcode = kPPC_RotLeftAndClearLeft64;
+          mask = mb;
+        } else if (mb == 63) {
+          match = true;
+          opcode = kPPC_RotLeftAndClearRight64;
+          mask = me;
+        } else if (sh && me <= sh && m.left().IsWord64Shl()) {
+          match = true;
+          opcode = kPPC_RotLeftAndClear64;
+          mask = mb;
+        }
+        if (match) {
+          Emit(opcode, g.DefineAsRegister(node), g.UseRegister(left),
+               g.TempImmediate(sh), g.TempImmediate(mask));
+          return;
+        }
       }
     }
+    VisitLogical<Adapter, Int64BinopMatcher>(
+        this, node, &m, kPPC_And, CanCover(node, m.left().node()),
+        CanCover(node, m.right().node()), kInt16Imm_Unsigned);
   }
-  VisitLogical<Int64BinopMatcher>(
-      this, node, &m, kPPC_And, CanCover(node, m.left().node()),
-      CanCover(node, m.right().node()), kInt16Imm_Unsigned);
 }
 #endif
 
-void InstructionSelector::VisitWord32Or(Node* node) {
-  Int32BinopMatcher m(node);
-  VisitLogical<Int32BinopMatcher>(
-      this, node, &m, kPPC_Or, CanCover(node, m.left().node()),
-      CanCover(node, m.right().node()), kInt16Imm_Unsigned);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    VisitLogical<Adapter, Int32BinopMatcher>(
+        this, node, &m, kPPC_Or, CanCover(node, m.left().node()),
+        CanCover(node, m.right().node()), kInt16Imm_Unsigned);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Or(Node* node) {
-  Int64BinopMatcher m(node);
-  VisitLogical<Int64BinopMatcher>(
-      this, node, &m, kPPC_Or, CanCover(node, m.left().node()),
-      CanCover(node, m.right().node()), kInt16Imm_Unsigned);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int64BinopMatcher m(node);
+    VisitLogical<Adapter, Int64BinopMatcher>(
+        this, node, &m, kPPC_Or, CanCover(node, m.left().node()),
+        CanCover(node, m.right().node()), kInt16Imm_Unsigned);
+  }
 }
 #endif
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  PPCOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(-1)) {
-    Emit(kPPC_Not, g.DefineAsRegister(node), g.UseRegister(m.left().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitBinop<Int32BinopMatcher>(this, node, kPPC_Xor, kInt16Imm_Unsigned);
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.right().Is(-1)) {
+      Emit(kPPC_Not, g.DefineAsRegister(node), g.UseRegister(m.left().node()));
+    } else {
+      VisitBinop<Adapter, Int32BinopMatcher>(this, node, kPPC_Xor,
+                                             kInt16Imm_Unsigned);
+    }
   }
 }
 
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuation* cont) {
+  StackCheckKind kind;
+  node_t value;
+  if constexpr (Adapter::IsTurboshaft) {
+    const auto& op =
+        this->turboshaft_graph()
+            ->Get(node)
+            .template Cast<turboshaft::StackPointerGreaterThanOp>();
+    kind = op.kind;
+    value = op.stack_limit();
+  } else {
+    kind = StackCheckKindOf(node->op());
+    value = node->InputAt(0);
+  }
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
-  PPCOperandGenerator g(this);
+  PPCOperandGeneratorT<Adapter> g(this);
 
   // No outputs.
   InstructionOperand* const outputs = nullptr;
@@ -640,7 +730,6 @@ void InstructionSelector::VisitStackPointerGreaterThan(
                                  ? OperandGenerator::kUniqueRegister
                                  : OperandGenerator::kRegister;
 
-  Node* const value = node->InputAt(0);
   InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
   static constexpr int input_count = arraysize(inputs);
 
@@ -649,177 +738,210 @@ void InstructionSelector::VisitStackPointerGreaterThan(
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Xor(Node* node) {
-  PPCOperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if (m.right().Is(-1)) {
-    Emit(kPPC_Not, g.DefineAsRegister(node), g.UseRegister(m.left().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitBinop<Int64BinopMatcher>(this, node, kPPC_Xor, kInt16Imm_Unsigned);
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if (m.right().Is(-1)) {
+      Emit(kPPC_Not, g.DefineAsRegister(node), g.UseRegister(m.left().node()));
+    } else {
+      VisitBinop<Adapter, Int64BinopMatcher>(this, node, kPPC_Xor,
+                                             kInt16Imm_Unsigned);
+    }
   }
 }
 #endif
 
-void InstructionSelector::VisitWord32Shl(Node* node) {
-  PPCOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.left().IsWord32And() && m.right().IsInRange(0, 31)) {
-    // Try to absorb logical-and into rlwinm
-    Int32BinopMatcher mleft(m.left().node());
-    int sh = m.right().ResolvedValue();
-    int mb;
-    int me;
-    if (mleft.right().HasResolvedValue() &&
-        IsContiguousMask32(mleft.right().ResolvedValue() << sh, &mb, &me)) {
-      // Adjust the mask such that it doesn't include any rotated bits.
-      if (me < sh) me = sh;
-      if (mb >= me) {
-        Emit(kPPC_RotLeftAndMask32, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
-             g.TempImmediate(mb), g.TempImmediate(me));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.left().IsWord32And() && m.right().IsInRange(0, 31)) {
+      // Try to absorb logical-and into rlwinm
+      Int32BinopMatcher mleft(m.left().node());
+      int sh = m.right().ResolvedValue();
+      int mb;
+      int me;
+      if (mleft.right().HasResolvedValue() &&
+          IsContiguousMask32(mleft.right().ResolvedValue() << sh, &mb, &me)) {
+        // Adjust the mask such that it doesn't include any rotated bits.
+        if (me < sh) me = sh;
+        if (mb >= me) {
+          Emit(kPPC_RotLeftAndMask32, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
+               g.TempImmediate(mb), g.TempImmediate(me));
+          return;
+        }
       }
     }
+    VisitRRO(this, kPPC_ShiftLeft32, node, kShift32Imm);
   }
-  VisitRRO(this, kPPC_ShiftLeft32, node, kShift32Imm);
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Shl(Node* node) {
-  PPCOperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  // TODO(mbrandy): eliminate left sign extension if right >= 32
-  if (m.left().IsWord64And() && m.right().IsInRange(0, 63)) {
-    // Try to absorb logical-and into rldic
-    Int64BinopMatcher mleft(m.left().node());
-    int sh = m.right().ResolvedValue();
-    int mb;
-    int me;
-    if (mleft.right().HasResolvedValue() &&
-        IsContiguousMask64(mleft.right().ResolvedValue() << sh, &mb, &me)) {
-      // Adjust the mask such that it doesn't include any rotated bits.
-      if (me < sh) me = sh;
-      if (mb >= me) {
-        bool match = false;
-        ArchOpcode opcode;
-        int mask;
-        if (me == 0) {
-          match = true;
-          opcode = kPPC_RotLeftAndClearLeft64;
-          mask = mb;
-        } else if (mb == 63) {
-          match = true;
-          opcode = kPPC_RotLeftAndClearRight64;
-          mask = me;
-        } else if (sh && me <= sh) {
-          match = true;
-          opcode = kPPC_RotLeftAndClear64;
-          mask = mb;
-        }
-        if (match) {
-          Emit(opcode, g.DefineAsRegister(node),
-               g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
-               g.TempImmediate(mask));
-          return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    // TODO(mbrandy): eliminate left sign extension if right >= 32
+    if (m.left().IsWord64And() && m.right().IsInRange(0, 63)) {
+      // Try to absorb logical-and into rldic
+      Int64BinopMatcher mleft(m.left().node());
+      int sh = m.right().ResolvedValue();
+      int mb;
+      int me;
+      if (mleft.right().HasResolvedValue() &&
+          IsContiguousMask64(mleft.right().ResolvedValue() << sh, &mb, &me)) {
+        // Adjust the mask such that it doesn't include any rotated bits.
+        if (me < sh) me = sh;
+        if (mb >= me) {
+          bool match = false;
+          ArchOpcode opcode;
+          int mask;
+          if (me == 0) {
+            match = true;
+            opcode = kPPC_RotLeftAndClearLeft64;
+            mask = mb;
+          } else if (mb == 63) {
+            match = true;
+            opcode = kPPC_RotLeftAndClearRight64;
+            mask = me;
+          } else if (sh && me <= sh) {
+            match = true;
+            opcode = kPPC_RotLeftAndClear64;
+            mask = mb;
+          }
+          if (match) {
+            Emit(opcode, g.DefineAsRegister(node),
+                 g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
+                 g.TempImmediate(mask));
+            return;
+          }
         }
       }
     }
+    VisitRRO(this, kPPC_ShiftLeft64, node, kShift64Imm);
   }
-  VisitRRO(this, kPPC_ShiftLeft64, node, kShift64Imm);
 }
 #endif
 
-void InstructionSelector::VisitWord32Shr(Node* node) {
-  PPCOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.left().IsWord32And() && m.right().IsInRange(0, 31)) {
-    // Try to absorb logical-and into rlwinm
-    Int32BinopMatcher mleft(m.left().node());
-    int sh = m.right().ResolvedValue();
-    int mb;
-    int me;
-    if (mleft.right().HasResolvedValue() &&
-        IsContiguousMask32((uint32_t)(mleft.right().ResolvedValue()) >> sh, &mb,
-                           &me)) {
-      // Adjust the mask such that it doesn't include any rotated bits.
-      if (mb > 31 - sh) mb = 31 - sh;
-      sh = (32 - sh) & 0x1F;
-      if (mb >= me) {
-        Emit(kPPC_RotLeftAndMask32, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
-             g.TempImmediate(mb), g.TempImmediate(me));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.left().IsWord32And() && m.right().IsInRange(0, 31)) {
+      // Try to absorb logical-and into rlwinm
+      Int32BinopMatcher mleft(m.left().node());
+      int sh = m.right().ResolvedValue();
+      int mb;
+      int me;
+      if (mleft.right().HasResolvedValue() &&
+          IsContiguousMask32((uint32_t)(mleft.right().ResolvedValue()) >> sh,
+                             &mb, &me)) {
+        // Adjust the mask such that it doesn't include any rotated bits.
+        if (mb > 31 - sh) mb = 31 - sh;
+        sh = (32 - sh) & 0x1F;
+        if (mb >= me) {
+          Emit(kPPC_RotLeftAndMask32, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
+               g.TempImmediate(mb), g.TempImmediate(me));
+          return;
+        }
       }
     }
+    VisitRRO(this, kPPC_ShiftRight32, node, kShift32Imm);
   }
-  VisitRRO(this, kPPC_ShiftRight32, node, kShift32Imm);
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Shr(Node* node) {
-  PPCOperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if (m.left().IsWord64And() && m.right().IsInRange(0, 63)) {
-    // Try to absorb logical-and into rldic
-    Int64BinopMatcher mleft(m.left().node());
-    int sh = m.right().ResolvedValue();
-    int mb;
-    int me;
-    if (mleft.right().HasResolvedValue() &&
-        IsContiguousMask64((uint64_t)(mleft.right().ResolvedValue()) >> sh, &mb,
-                           &me)) {
-      // Adjust the mask such that it doesn't include any rotated bits.
-      if (mb > 63 - sh) mb = 63 - sh;
-      sh = (64 - sh) & 0x3F;
-      if (mb >= me) {
-        bool match = false;
-        ArchOpcode opcode;
-        int mask;
-        if (me == 0) {
-          match = true;
-          opcode = kPPC_RotLeftAndClearLeft64;
-          mask = mb;
-        } else if (mb == 63) {
-          match = true;
-          opcode = kPPC_RotLeftAndClearRight64;
-          mask = me;
-        }
-        if (match) {
-          Emit(opcode, g.DefineAsRegister(node),
-               g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
-               g.TempImmediate(mask));
-          return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if (m.left().IsWord64And() && m.right().IsInRange(0, 63)) {
+      // Try to absorb logical-and into rldic
+      Int64BinopMatcher mleft(m.left().node());
+      int sh = m.right().ResolvedValue();
+      int mb;
+      int me;
+      if (mleft.right().HasResolvedValue() &&
+          IsContiguousMask64((uint64_t)(mleft.right().ResolvedValue()) >> sh,
+                             &mb, &me)) {
+        // Adjust the mask such that it doesn't include any rotated bits.
+        if (mb > 63 - sh) mb = 63 - sh;
+        sh = (64 - sh) & 0x3F;
+        if (mb >= me) {
+          bool match = false;
+          ArchOpcode opcode;
+          int mask;
+          if (me == 0) {
+            match = true;
+            opcode = kPPC_RotLeftAndClearLeft64;
+            mask = mb;
+          } else if (mb == 63) {
+            match = true;
+            opcode = kPPC_RotLeftAndClearRight64;
+            mask = me;
+          }
+          if (match) {
+            Emit(opcode, g.DefineAsRegister(node),
+                 g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
+                 g.TempImmediate(mask));
+            return;
+          }
         }
       }
     }
+    VisitRRO(this, kPPC_ShiftRight64, node, kShift64Imm);
   }
-  VisitRRO(this, kPPC_ShiftRight64, node, kShift64Imm);
 }
 #endif
 
-void InstructionSelector::VisitWord32Sar(Node* node) {
-  PPCOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  // Replace with sign extension for (x << K) >> K where K is 16 or 24.
-  if (CanCover(node, m.left().node()) && m.left().IsWord32Shl()) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (mleft.right().Is(16) && m.right().Is(16)) {
-      Emit(kPPC_ExtendSignWord16, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()));
-      return;
-    } else if (mleft.right().Is(24) && m.right().Is(24)) {
-      Emit(kPPC_ExtendSignWord8, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Sar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    // Replace with sign extension for (x << K) >> K where K is 16 or 24.
+    if (CanCover(node, m.left().node()) && m.left().IsWord32Shl()) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (mleft.right().Is(16) && m.right().Is(16)) {
+        Emit(kPPC_ExtendSignWord16, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()));
+        return;
+      } else if (mleft.right().Is(24) && m.right().Is(24)) {
+        Emit(kPPC_ExtendSignWord8, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()));
+        return;
+      }
     }
+    VisitRRO(this, kPPC_ShiftRightAlg32, node, kShift32Imm);
   }
-  VisitRRO(this, kPPC_ShiftRightAlg32, node, kShift32Imm);
 }
 
 #if !V8_TARGET_ARCH_PPC64
-void VisitPairBinop(InstructionSelector* selector, InstructionCode opcode,
-                    InstructionCode opcode2, Node* node) {
-  PPCOperandGenerator g(selector);
+template <typename Adapter>
+void VisitPairBinop(InstructionSelectorT<Adapter>* selector,
+                    InstructionCode opcode, InstructionCode opcode2,
+                    Node* node) {
+  PPCOperandGeneratorT<Adapter> g(selector);
 
   Node* projection1 = NodeProperties::FindProjection(node, 1);
   if (projection1) {
@@ -843,43 +965,59 @@ void VisitPairBinop(InstructionSelector* selector, InstructionCode opcode,
   }
 }
 
-void InstructionSelector::VisitInt32PairAdd(Node* node) {
-  VisitPairBinop(this, kPPC_AddPair, kPPC_Add32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32PairAdd(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitPairBinop(this, kPPC_AddPair, kPPC_Add32, node);
+  }
 }
 
-void InstructionSelector::VisitInt32PairSub(Node* node) {
-  VisitPairBinop(this, kPPC_SubPair, kPPC_Sub, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32PairSub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitPairBinop(this, kPPC_SubPair, kPPC_Sub, node);
+  }
 }
 
-void InstructionSelector::VisitInt32PairMul(Node* node) {
-  PPCOperandGenerator g(this);
-  Node* projection1 = NodeProperties::FindProjection(node, 1);
-  if (projection1) {
-    InstructionOperand inputs[] = {g.UseUniqueRegister(node->InputAt(0)),
-                                   g.UseUniqueRegister(node->InputAt(1)),
-                                   g.UseUniqueRegister(node->InputAt(2)),
-                                   g.UseUniqueRegister(node->InputAt(3))};
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32PairMul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Node* projection1 = NodeProperties::FindProjection(node, 1);
+    if (projection1) {
+      InstructionOperand inputs[] = {g.UseUniqueRegister(node->InputAt(0)),
+                                     g.UseUniqueRegister(node->InputAt(1)),
+                                     g.UseUniqueRegister(node->InputAt(2)),
+                                     g.UseUniqueRegister(node->InputAt(3))};
 
-    InstructionOperand outputs[] = {
-        g.DefineAsRegister(node),
-        g.DefineAsRegister(NodeProperties::FindProjection(node, 1))};
+      InstructionOperand outputs[] = {
+          g.DefineAsRegister(node),
+          g.DefineAsRegister(NodeProperties::FindProjection(node, 1))};
 
-    InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()};
+      InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()};
 
-    Emit(kPPC_MulPair, 2, outputs, 4, inputs, 2, temps);
-  } else {
-    // The high word of the result is not used, so we emit the standard 32 bit
-    // instruction.
-    Emit(kPPC_Mul32, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)),
-         g.UseRegister(node->InputAt(2)));
+      Emit(kPPC_MulPair, 2, outputs, 4, inputs, 2, temps);
+    } else {
+      // The high word of the result is not used, so we emit the standard 32 bit
+      // instruction.
+      Emit(kPPC_Mul32, g.DefineSameAsFirst(node),
+           g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(2)));
+    }
   }
 }
 
 namespace {
 // Shared routine for multiple shift operations.
-void VisitPairShift(InstructionSelector* selector, InstructionCode opcode,
-                    Node* node) {
-  PPCOperandGenerator g(selector);
+template <typename Adapter>
+void VisitPairShift(InstructionSelectorT<Adapter>* selector,
+                    InstructionCode opcode, Node* node) {
+  PPCOperandGeneratorT<Adapter> g(selector);
   // We use g.UseUniqueRegister here to guarantee that there is
   // no register aliasing of input registers with output registers.
   Int32Matcher m(node->InputAt(2));
@@ -912,794 +1050,1390 @@ void VisitPairShift(InstructionSelector* selector, InstructionCode opcode,
 }
 }  // namespace
 
-void InstructionSelector::VisitWord32PairShl(Node* node) {
-  VisitPairShift(this, kPPC_ShiftLeftPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairShl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitPairShift(this, kPPC_ShiftLeftPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32PairShr(Node* node) {
-  VisitPairShift(this, kPPC_ShiftRightPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairShr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitPairShift(this, kPPC_ShiftRightPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32PairSar(Node* node) {
-  VisitPairShift(this, kPPC_ShiftRightAlgPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairSar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitPairShift(this, kPPC_ShiftRightAlgPair, node);
+  }
 }
 #endif
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Sar(Node* node) {
-  PPCOperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if (CanCover(m.node(), m.left().node()) && m.left().IsLoad() &&
-      m.right().Is(32)) {
-    // Just load and sign-extend the interesting 4 bytes instead. This happens,
-    // for example, when we're loading and untagging SMIs.
-    BaseWithIndexAndDisplacement64Matcher mleft(m.left().node(),
-                                                AddressOption::kAllowAll);
-    if (mleft.matches() && mleft.index() == nullptr) {
-      int64_t offset = 0;
-      Node* displacement = mleft.displacement();
-      if (displacement != nullptr) {
-        Int64Matcher mdisplacement(displacement);
-        DCHECK(mdisplacement.HasResolvedValue());
-        offset = mdisplacement.ResolvedValue();
-      }
-      offset = SmiWordOffset(offset);
-      if (g.CanBeImmediate(offset, kInt16Imm_4ByteAligned)) {
-        Emit(kPPC_LoadWordS32 | AddressingModeField::encode(kMode_MRI),
-             g.DefineAsRegister(node), g.UseRegister(mleft.base()),
-             g.TempImmediate(offset), g.UseImmediate(0));
-        return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Sar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if (CanCover(m.node(), m.left().node()) && m.left().IsLoad() &&
+        m.right().Is(32)) {
+      // Just load and sign-extend the interesting 4 bytes instead. This
+      // happens, for example, when we're loading and untagging SMIs.
+      BaseWithIndexAndDisplacement64Matcher mleft(m.left().node(),
+                                                  AddressOption::kAllowAll);
+      if (mleft.matches() && mleft.index() == nullptr) {
+        int64_t offset = 0;
+        Node* displacement = mleft.displacement();
+        if (displacement != nullptr) {
+          Int64Matcher mdisplacement(displacement);
+          DCHECK(mdisplacement.HasResolvedValue());
+          offset = mdisplacement.ResolvedValue();
+        }
+        offset = SmiWordOffset(offset);
+        if (g.CanBeImmediate(offset, kInt16Imm_4ByteAligned)) {
+          Emit(kPPC_LoadWordS32 | AddressingModeField::encode(kMode_MRI),
+               g.DefineAsRegister(node), g.UseRegister(mleft.base()),
+               g.TempImmediate(offset), g.UseImmediate(0));
+          return;
+        }
       }
     }
+    VisitRRO(this, kPPC_ShiftRightAlg64, node, kShift64Imm);
   }
-  VisitRRO(this, kPPC_ShiftRightAlg64, node, kShift64Imm);
 }
 #endif
 
-void InstructionSelector::VisitWord32Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    UNREACHABLE();
+  }
+}
 
-void InstructionSelector::VisitWord64Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Rol(node_t node) {
+  UNREACHABLE();
+}
 
 // TODO(mbrandy): Absorb logical-and into rlwinm?
-void InstructionSelector::VisitWord32Ror(Node* node) {
-  VisitRRO(this, kPPC_RotRight32, node, kShift32Imm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRO(this, kPPC_RotRight32, node, kShift32Imm);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
 // TODO(mbrandy): Absorb logical-and into rldic?
-void InstructionSelector::VisitWord64Ror(Node* node) {
-  VisitRRO(this, kPPC_RotRight64, node, kShift64Imm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ror(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRO(this, kPPC_RotRight64, node, kShift64Imm);
+  }
 }
 #endif
 
-void InstructionSelector::VisitWord32Clz(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_Cntlz32, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Clz(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_Cntlz32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Clz(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_Cntlz64, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Clz(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_Cntlz64, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 #endif
 
-void InstructionSelector::VisitWord32Popcnt(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_Popcnt32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Popcnt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_Popcnt32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Popcnt(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_Popcnt64, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Popcnt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_Popcnt64, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 #endif
 
-void InstructionSelector::VisitWord32Ctz(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ctz(node_t node) {
+  UNREACHABLE();
+}
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Ctz(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ctz(node_t node) {
+  UNREACHABLE();
+}
 #endif
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 #endif
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) {
-  PPCOperandGenerator g(this);
-  InstructionOperand temp[] = {g.TempRegister()};
-  NodeMatcher input(node->InputAt(0));
-  if (CanCover(node, input.node()) && input.IsLoad()) {
-    LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
-    if (load_rep.representation() == MachineRepresentation::kWord64) {
-      Node* base = input.node()->InputAt(0);
-      Node* offset = input.node()->InputAt(1);
-      bool is_atomic = (node->opcode() == IrOpcode::kWord32AtomicLoad ||
-                        node->opcode() == IrOpcode::kWord64AtomicLoad);
-      Emit(kPPC_LoadByteRev64 | AddressingModeField::encode(kMode_MRR),
-           g.DefineAsRegister(node), g.UseRegister(base), g.UseRegister(offset),
-           g.UseImmediate(is_atomic));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    InstructionOperand temp[] = {g.TempRegister()};
+    NodeMatcher input(node->InputAt(0));
+    if (CanCover(node, input.node()) && input.IsLoad()) {
+      LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
+      if (load_rep.representation() == MachineRepresentation::kWord64) {
+        Node* base = input.node()->InputAt(0);
+        Node* offset = input.node()->InputAt(1);
+        bool is_atomic = (node->opcode() == IrOpcode::kWord32AtomicLoad ||
+                          node->opcode() == IrOpcode::kWord64AtomicLoad);
+        Emit(kPPC_LoadByteRev64 | AddressingModeField::encode(kMode_MRR),
+             g.DefineAsRegister(node), g.UseRegister(base),
+             g.UseRegister(offset), g.UseImmediate(is_atomic));
+        return;
+      }
     }
+    Emit(kPPC_ByteRev64, g.DefineAsRegister(node),
+         g.UseUniqueRegister(node->InputAt(0)), 1, temp);
   }
-  Emit(kPPC_ByteRev64, g.DefineAsRegister(node),
-       g.UseUniqueRegister(node->InputAt(0)), 1, temp);
-}
-
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
-  PPCOperandGenerator g(this);
-  NodeMatcher input(node->InputAt(0));
-  if (CanCover(node, input.node()) && input.IsLoad()) {
-    LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
-    if (load_rep.representation() == MachineRepresentation::kWord32) {
-      Node* base = input.node()->InputAt(0);
-      Node* offset = input.node()->InputAt(1);
-      bool is_atomic = (node->opcode() == IrOpcode::kWord32AtomicLoad ||
-                        node->opcode() == IrOpcode::kWord64AtomicLoad);
-      Emit(kPPC_LoadByteRev32 | AddressingModeField::encode(kMode_MRR),
-           g.DefineAsRegister(node), g.UseRegister(base), g.UseRegister(offset),
-           g.UseImmediate(is_atomic));
-      return;
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    NodeMatcher input(node->InputAt(0));
+    if (CanCover(node, input.node()) && input.IsLoad()) {
+      LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
+      if (load_rep.representation() == MachineRepresentation::kWord32) {
+        Node* base = input.node()->InputAt(0);
+        Node* offset = input.node()->InputAt(1);
+        bool is_atomic = (node->opcode() == IrOpcode::kWord32AtomicLoad ||
+                          node->opcode() == IrOpcode::kWord64AtomicLoad);
+        Emit(kPPC_LoadByteRev32 | AddressingModeField::encode(kMode_MRR),
+             g.DefineAsRegister(node), g.UseRegister(base),
+             g.UseRegister(offset), g.UseImmediate(is_atomic));
+        return;
+      }
     }
+    Emit(kPPC_ByteRev32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
   }
-  Emit(kPPC_ByteRev32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(kPPC_LoadReverseSimd128RR, g.DefineAsRegister(node),
        g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  VisitBinop<Int32BinopMatcher>(this, node, kPPC_Add32, kInt16Imm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kPPC_Add32, kInt16Imm);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitInt64Add(Node* node) {
-  VisitBinop<Int64BinopMatcher>(this, node, kPPC_Add64, kInt16Imm);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kPPC_Add64, kInt16Imm);
+  }
 }
 #endif
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  PPCOperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (m.left().Is(0)) {
-    Emit(kPPC_Neg, g.DefineAsRegister(node), g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitBinop<Int32BinopMatcher>(this, node, kPPC_Sub, kInt16Imm_Negate);
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (m.left().Is(0)) {
+      Emit(kPPC_Neg, g.DefineAsRegister(node), g.UseRegister(m.right().node()));
+    } else {
+      VisitBinop<Adapter, Int32BinopMatcher>(this, node, kPPC_Sub,
+                                             kInt16Imm_Negate);
+    }
   }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitInt64Sub(Node* node) {
-  PPCOperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if (m.left().Is(0)) {
-    Emit(kPPC_Neg, g.DefineAsRegister(node), g.UseRegister(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitBinop<Int64BinopMatcher>(this, node, kPPC_Sub, kInt16Imm_Negate);
+    PPCOperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if (m.left().Is(0)) {
+      Emit(kPPC_Neg, g.DefineAsRegister(node), g.UseRegister(m.right().node()));
+    } else {
+      VisitBinop<Adapter, Int64BinopMatcher>(this, node, kPPC_Sub,
+                                             kInt16Imm_Negate);
+    }
   }
 }
 #endif
 
 namespace {
 
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  InstructionOperand left, InstructionOperand right,
-                  FlagsContinuation* cont);
-void EmitInt32MulWithOverflow(InstructionSelector* selector, Node* node,
-                              FlagsContinuation* cont) {
-  PPCOperandGenerator g(selector);
-  Int32BinopMatcher m(node);
-  InstructionOperand result_operand = g.DefineAsRegister(node);
-  InstructionOperand high32_operand = g.TempRegister();
-  InstructionOperand temp_operand = g.TempRegister();
-  {
-    InstructionOperand outputs[] = {result_operand, high32_operand};
-    InstructionOperand inputs[] = {g.UseRegister(m.left().node()),
-                                   g.UseRegister(m.right().node())};
-    selector->Emit(kPPC_Mul32WithHigh32, 2, outputs, 2, inputs);
-  }
-  {
-    InstructionOperand shift_31 = g.UseImmediate(31);
-    InstructionOperand outputs[] = {temp_operand};
-    InstructionOperand inputs[] = {result_operand, shift_31};
-    selector->Emit(kPPC_ShiftRightAlg32, 1, outputs, 2, inputs);
-  }
-
-  VisitCompare(selector, kPPC_Cmp32, high32_operand, temp_operand, cont);
-}
-
-void EmitInt64MulWithOverflow(InstructionSelector* selector, Node* node,
-                              FlagsContinuation* cont) {
-  PPCOperandGenerator g(selector);
-  Int64BinopMatcher m(node);
-  InstructionOperand result = g.DefineAsRegister(node);
-  InstructionOperand left = g.UseRegister(m.left().node());
-  InstructionOperand high = g.TempRegister();
-  InstructionOperand result_sign = g.TempRegister();
-  InstructionOperand right = g.UseRegister(m.right().node());
-  selector->Emit(kPPC_Mul64, result, left, right);
-  selector->Emit(kPPC_MulHighS64, high, left, right);
-  selector->Emit(kPPC_ShiftRightAlg64, result_sign, result,
-                 g.TempImmediate(63));
-  // Test whether {high} is a sign-extension of {result}.
-  selector->EmitWithContinuation(kPPC_Cmp64, high, result_sign, cont);
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, InstructionOperand left,
+                  InstructionOperand right, FlagsContinuationT<Adapter>* cont);
+template <typename Adapter>
+void EmitInt32MulWithOverflow(InstructionSelectorT<Adapter>* selector,
+                              Node* node, FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(selector);
+    Int32BinopMatcher m(node);
+    InstructionOperand result_operand = g.DefineAsRegister(node);
+    InstructionOperand high32_operand = g.TempRegister();
+    InstructionOperand temp_operand = g.TempRegister();
+    {
+      InstructionOperand outputs[] = {result_operand, high32_operand};
+      InstructionOperand inputs[] = {g.UseRegister(m.left().node()),
+                                     g.UseRegister(m.right().node())};
+      selector->Emit(kPPC_Mul32WithHigh32, 2, outputs, 2, inputs);
+    }
+    {
+      InstructionOperand shift_31 = g.UseImmediate(31);
+      InstructionOperand outputs[] = {temp_operand};
+      InstructionOperand inputs[] = {result_operand, shift_31};
+      selector->Emit(kPPC_ShiftRightAlg32, 1, outputs, 2, inputs);
+    }
+
+    VisitCompare(selector, kPPC_Cmp32, high32_operand, temp_operand, cont);
+  }
+}
+
+template <typename Adapter>
+void EmitInt64MulWithOverflow(InstructionSelectorT<Adapter>* selector,
+                              Node* node, FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(selector);
+    Int64BinopMatcher m(node);
+    InstructionOperand result = g.DefineAsRegister(node);
+    InstructionOperand left = g.UseRegister(m.left().node());
+    InstructionOperand high = g.TempRegister();
+    InstructionOperand result_sign = g.TempRegister();
+    InstructionOperand right = g.UseRegister(m.right().node());
+    selector->Emit(kPPC_Mul64, result, left, right);
+    selector->Emit(kPPC_MulHighS64, high, left, right);
+    selector->Emit(kPPC_ShiftRightAlg64, result_sign, result,
+                   g.TempImmediate(63));
+    // Test whether {high} is a sign-extension of {result}.
+    selector->EmitWithContinuation(kPPC_Cmp64, high, result_sign, cont);
+  }
 }
 
 }  // namespace
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
-  VisitRRR(this, kPPC_Mul32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_Mul32, node);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitInt64Mul(Node* node) {
-  VisitRRR(this, kPPC_Mul64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_Mul64, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitInt32MulHigh(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_MulHigh32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_MulHigh32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  }
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_MulHighU32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_MulHighU32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  }
 }
 
-void InstructionSelector::VisitInt64MulHigh(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_MulHighS64, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_MulHighS64, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  }
 }
 
-void InstructionSelector::VisitUint64MulHigh(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_MulHighU64, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_MulHighU64, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  }
 }
 
-void InstructionSelector::VisitInt32Div(Node* node) {
-  VisitRRR(this, kPPC_Div32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_Div32, node);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitInt64Div(Node* node) {
-  VisitRRR(this, kPPC_Div64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_Div64, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitUint32Div(Node* node) {
-  VisitRRR(this, kPPC_DivU32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_DivU32, node);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitUint64Div(Node* node) {
-  VisitRRR(this, kPPC_DivU64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_DivU64, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitInt32Mod(Node* node) {
-  VisitRRR(this, kPPC_Mod32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_Mod32, node);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitInt64Mod(Node* node) {
-  VisitRRR(this, kPPC_Mod64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_Mod64, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitUint32Mod(Node* node) {
-  VisitRRR(this, kPPC_ModU32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_ModU32, node);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitUint64Mod(Node* node) {
-  VisitRRR(this, kPPC_ModU64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_ModU64, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitChangeFloat32ToFloat64(Node* node) {
-  VisitRR(this, kPPC_Float32ToDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat32ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Float32ToDouble, node);
+  }
 }
 
-void InstructionSelector::VisitRoundInt32ToFloat32(Node* node) {
-  VisitRR(this, kPPC_Int32ToFloat32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Int32ToFloat32, node);
+  }
 }
 
-void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) {
-  VisitRR(this, kPPC_Uint32ToFloat32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Uint32ToFloat32, node);
+  }
 }
 
-void InstructionSelector::VisitChangeInt32ToFloat64(Node* node) {
-  VisitRR(this, kPPC_Int32ToDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Int32ToDouble, node);
+  }
 }
 
-void InstructionSelector::VisitChangeUint32ToFloat64(Node* node) {
-  VisitRR(this, kPPC_Uint32ToDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Uint32ToDouble, node);
+  }
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) {
-  VisitRR(this, kPPC_DoubleToInt32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_DoubleToInt32, node);
+  }
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint32(Node* node) {
-  VisitRR(this, kPPC_DoubleToUint32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_DoubleToUint32, node);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat64ToUint32(Node* node) {
-  VisitRR(this, kPPC_DoubleToUint32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_DoubleToUint32, node);
+  }
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt32(Node* node) {
-  // TODO(mbrandy): inspect input to see if nop is appropriate.
-  VisitRR(this, kPPC_ExtendSignWord8, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): inspect input to see if nop is appropriate.
+    VisitRR(this, kPPC_ExtendSignWord8, node);
+  }
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt32(Node* node) {
-  // TODO(mbrandy): inspect input to see if nop is appropriate.
-  VisitRR(this, kPPC_ExtendSignWord16, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): inspect input to see if nop is appropriate.
+    VisitRR(this, kPPC_ExtendSignWord16, node);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
-  VisitTryTruncateDouble(this, kPPC_DoubleToInt64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitTryTruncateDouble(this, kPPC_DoubleToInt64, node);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
-  VisitTryTruncateDouble(this, kPPC_DoubleToInt64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitTryTruncateDouble(this, kPPC_DoubleToInt64, node);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat64ToInt64(Node* node) {
-  VisitRR(this, kPPC_DoubleToInt64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_DoubleToInt64, node);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
-  VisitTryTruncateDouble(this, kPPC_DoubleToUint64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitTryTruncateDouble(this, kPPC_DoubleToUint64, node);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
-  VisitTryTruncateDouble(this, kPPC_DoubleToUint64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitTryTruncateDouble(this, kPPC_DoubleToUint64, node);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt32(
+    node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint32(
+    node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitBitcastWord32ToWord64(Node* node) {
-  DCHECK(SmiValuesAre31Bits());
-  DCHECK(COMPRESS_POINTERS_BOOL);
-  EmitIdentity(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32ToWord64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    DCHECK(SmiValuesAre31Bits());
+    DCHECK(COMPRESS_POINTERS_BOOL);
+    EmitIdentity(node);
+  }
 }
 
-void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
-  // TODO(mbrandy): inspect input to see if nop is appropriate.
-  VisitRR(this, kPPC_ExtendSignWord32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): inspect input to see if nop is appropriate.
+    VisitRR(this, kPPC_ExtendSignWord32, node);
+  }
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt64(Node* node) {
-  // TODO(mbrandy): inspect input to see if nop is appropriate.
-  VisitRR(this, kPPC_ExtendSignWord8, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): inspect input to see if nop is appropriate.
+    VisitRR(this, kPPC_ExtendSignWord8, node);
+  }
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt64(Node* node) {
-  // TODO(mbrandy): inspect input to see if nop is appropriate.
-  VisitRR(this, kPPC_ExtendSignWord16, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): inspect input to see if nop is appropriate.
+    VisitRR(this, kPPC_ExtendSignWord16, node);
+  }
 }
 
-void InstructionSelector::VisitSignExtendWord32ToInt64(Node* node) {
-  // TODO(mbrandy): inspect input to see if nop is appropriate.
-  VisitRR(this, kPPC_ExtendSignWord32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): inspect input to see if nop is appropriate.
+    VisitRR(this, kPPC_ExtendSignWord32, node);
+  }
 }
 
-bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::ZeroExtendsWord32ToWord64NoPhis(
+    node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitChangeUint32ToUint64(Node* node) {
-  // TODO(mbrandy): inspect input to see if nop is appropriate.
-  VisitRR(this, kPPC_Uint32ToUint64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToUint64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): inspect input to see if nop is appropriate.
+    VisitRR(this, kPPC_Uint32ToUint64, node);
+  }
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint64(Node* node) {
-  VisitRR(this, kPPC_DoubleToUint64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_DoubleToUint64, node);
+  }
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt64(Node* node) {
-  VisitRR(this, kPPC_DoubleToInt64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_DoubleToInt64, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitTruncateFloat64ToFloat32(Node* node) {
-  VisitRR(this, kPPC_DoubleToFloat32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_DoubleToFloat32, node);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat64ToWord32(Node* node) {
-  VisitRR(this, kArchTruncateDoubleToI, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kArchTruncateDoubleToI, node);
+  }
 }
 
-void InstructionSelector::VisitRoundFloat64ToInt32(Node* node) {
-  VisitRR(this, kPPC_DoubleToInt32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundFloat64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_DoubleToInt32, node);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+
+    InstructionCode opcode = kPPC_Float32ToInt32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
 
-  InstructionCode opcode = kPPC_Float32ToInt32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+
+    InstructionCode opcode = kPPC_Float32ToUint32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
 
-  InstructionCode opcode = kPPC_Float32ToUint32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) {
-  // TODO(mbrandy): inspect input to see if nop is appropriate.
-  VisitRR(this, kPPC_Int64ToInt32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateInt64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): inspect input to see if nop is appropriate.
+    VisitRR(this, kPPC_Int64ToInt32, node);
+  }
 }
 
-void InstructionSelector::VisitRoundInt64ToFloat32(Node* node) {
-  VisitRR(this, kPPC_Int64ToFloat32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt64ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Int64ToFloat32, node);
+  }
 }
 
-void InstructionSelector::VisitRoundInt64ToFloat64(Node* node) {
-  VisitRR(this, kPPC_Int64ToDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt64ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Int64ToDouble, node);
+  }
 }
 
-void InstructionSelector::VisitChangeInt64ToFloat64(Node* node) {
-  VisitRR(this, kPPC_Int64ToDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt64ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Int64ToDouble, node);
+  }
 }
 
-void InstructionSelector::VisitRoundUint64ToFloat32(Node* node) {
-  VisitRR(this, kPPC_Uint64ToFloat32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint64ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Uint64ToFloat32, node);
+  }
 }
 
-void InstructionSelector::VisitRoundUint64ToFloat64(Node* node) {
-  VisitRR(this, kPPC_Uint64ToDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint64ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Uint64ToDouble, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitBitcastFloat32ToInt32(Node* node) {
-  VisitRR(this, kPPC_BitcastFloat32ToInt32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_BitcastFloat32ToInt32, node);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitBitcastFloat64ToInt64(Node* node) {
-  VisitRR(this, kPPC_BitcastDoubleToInt64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_BitcastDoubleToInt64, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitBitcastInt32ToFloat32(Node* node) {
-  VisitRR(this, kPPC_BitcastInt32ToFloat32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_BitcastInt32ToFloat32, node);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitBitcastInt64ToFloat64(Node* node) {
-  VisitRR(this, kPPC_BitcastInt64ToDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt64ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_BitcastInt64ToDouble, node);
+  }
 }
 #endif
 
-void InstructionSelector::VisitFloat32Add(Node* node) {
-  VisitRRR(this, kPPC_AddDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_AddDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Add(Node* node) {
-  // TODO(mbrandy): detect multiply-add
-  VisitRRR(this, kPPC_AddDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): detect multiply-add
+    VisitRRR(this, kPPC_AddDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Sub(Node* node) {
-  VisitRRR(this, kPPC_SubDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_SubDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Sub(Node* node) {
-  // TODO(mbrandy): detect multiply-subtract
-  VisitRRR(this, kPPC_SubDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): detect multiply-subtract
+    VisitRRR(this, kPPC_SubDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Mul(Node* node) {
-  VisitRRR(this, kPPC_MulDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_MulDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Mul(Node* node) {
-  // TODO(mbrandy): detect negate
-  VisitRRR(this, kPPC_MulDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // TODO(mbrandy): detect negate
+    VisitRRR(this, kPPC_MulDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Div(Node* node) {
-  VisitRRR(this, kPPC_DivDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_DivDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Div(Node* node) {
-  VisitRRR(this, kPPC_DivDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_DivDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  PPCOperandGenerator g(this);
-  Emit(kPPC_ModDouble, g.DefineAsFixed(node, d1),
-       g.UseFixed(node->InputAt(0), d1), g.UseFixed(node->InputAt(1), d2))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(kPPC_ModDouble, g.DefineAsFixed(node, d1),
+         g.UseFixed(node->InputAt(0), d1), g.UseFixed(node->InputAt(1), d2))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat32Max(Node* node) {
-  VisitRRR(this, kPPC_MaxDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Max(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_MaxDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Max(Node* node) {
-  VisitRRR(this, kPPC_MaxDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Max(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_MaxDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64SilenceNaN(Node* node) {
-  VisitRR(this, kPPC_Float64SilenceNaN, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64SilenceNaN(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_Float64SilenceNaN, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Min(Node* node) {
-  VisitRRR(this, kPPC_MinDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Min(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_MinDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Min(Node* node) {
-  VisitRRR(this, kPPC_MinDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Min(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kPPC_MinDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Abs(Node* node) {
-  VisitRR(this, kPPC_AbsDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Abs(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_AbsDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Abs(Node* node) {
-  VisitRR(this, kPPC_AbsDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Abs(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_AbsDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Sqrt(Node* node) {
-  VisitRR(this, kPPC_SqrtDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sqrt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_SqrtDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  PPCOperandGenerator g(this);
-  Emit(opcode, g.DefineAsFixed(node, d1), g.UseFixed(node->InputAt(0), d1))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(opcode, g.DefineAsFixed(node, d1), g.UseFixed(node->InputAt(0), d1))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  PPCOperandGenerator g(this);
-  Emit(opcode, g.DefineAsFixed(node, d1), g.UseFixed(node->InputAt(0), d1),
-       g.UseFixed(node->InputAt(1), d2))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
+    Emit(opcode, g.DefineAsFixed(node, d1), g.UseFixed(node->InputAt(0), d1),
+         g.UseFixed(node->InputAt(1), d2))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat64Sqrt(Node* node) {
-  VisitRR(this, kPPC_SqrtDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sqrt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_SqrtDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32RoundDown(Node* node) {
-  VisitRR(this, kPPC_FloorDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundDown(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_FloorDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundDown(Node* node) {
-  VisitRR(this, kPPC_FloorDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundDown(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_FloorDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32RoundUp(Node* node) {
-  VisitRR(this, kPPC_CeilDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundUp(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_CeilDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundUp(Node* node) {
-  VisitRR(this, kPPC_CeilDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundUp(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_CeilDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32RoundTruncate(Node* node) {
-  VisitRR(this, kPPC_TruncateDouble | MiscField::encode(1), node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTruncate(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_TruncateDouble | MiscField::encode(1), node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundTruncate(Node* node) {
-  VisitRR(this, kPPC_TruncateDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTruncate(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_TruncateDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) {
-  VisitRR(this, kPPC_RoundDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesAway(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_RoundDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Neg(Node* node) {
-  VisitRR(this, kPPC_NegDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Neg(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_NegDouble, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Neg(Node* node) {
-  VisitRR(this, kPPC_NegDouble, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Neg(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kPPC_NegDouble, node);
+  }
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop<Int32BinopMatcher>(this, node, kPPC_AddWithOverflow32,
-                                         kInt16Imm, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(
+          this, node, kPPC_AddWithOverflow32, kInt16Imm, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kPPC_AddWithOverflow32,
+                                           kInt16Imm, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop<Int32BinopMatcher>(this, node, kPPC_AddWithOverflow32, kInt16Imm,
-                                &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop<Int32BinopMatcher>(this, node, kPPC_SubWithOverflow32,
-                                         kInt16Imm_Negate, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(
+          this, node, kPPC_SubWithOverflow32, kInt16Imm_Negate, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kPPC_SubWithOverflow32,
+                                           kInt16Imm_Negate, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop<Int32BinopMatcher>(this, node, kPPC_SubWithOverflow32,
-                                kInt16Imm_Negate, &cont);
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitInt64AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop<Int64BinopMatcher>(this, node, kPPC_Add64, kInt16Imm,
-                                         &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int64BinopMatcher>(this, node, kPPC_Add64,
+                                                    kInt16Imm, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kPPC_Add64, kInt16Imm,
+                                           &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop<Int64BinopMatcher>(this, node, kPPC_Add64, kInt16Imm, &cont);
 }
 
-void InstructionSelector::VisitInt64SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop<Int64BinopMatcher>(this, node, kPPC_Sub, kInt16Imm_Negate,
-                                         &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int64BinopMatcher>(this, node, kPPC_Sub,
+                                                    kInt16Imm_Negate, &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kPPC_Sub,
+                                           kInt16Imm_Negate, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop<Int64BinopMatcher>(this, node, kPPC_Sub, kInt16Imm_Negate, &cont);
 }
 
-void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
-    return EmitInt64MulWithOverflow(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
+      return EmitInt64MulWithOverflow(this, node, &cont);
+    }
+    FlagsContinuation cont;
+    EmitInt64MulWithOverflow(this, node, &cont);
   }
-  FlagsContinuation cont;
-  EmitInt64MulWithOverflow(this, node, &cont);
 }
 #endif
 
-static bool CompareLogical(FlagsContinuation* cont) {
-  switch (cont->condition()) {
-    case kUnsignedLessThan:
-    case kUnsignedGreaterThanOrEqual:
-    case kUnsignedLessThanOrEqual:
-    case kUnsignedGreaterThan:
-      return true;
-    default:
-      return false;
+template <typename Adapter>
+static bool CompareLogical(FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    switch (cont->condition()) {
+      case kUnsignedLessThan:
+      case kUnsignedGreaterThanOrEqual:
+      case kUnsignedLessThanOrEqual:
+      case kUnsignedGreaterThan:
+        return true;
+      default:
+        return false;
+    }
+    UNREACHABLE();
   }
-  UNREACHABLE();
 }
 
 namespace {
 
 // Shared routine for multiple compare operations.
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  InstructionOperand left, InstructionOperand right,
-                  FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, InstructionOperand left,
+                  InstructionOperand right, FlagsContinuationT<Adapter>* cont) {
   selector->EmitWithContinuation(opcode, left, right, cont);
 }
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont,
-                      bool commutative, ImmediateMode immediate_mode) {
-  PPCOperandGenerator g(selector);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-
-  // Match immediates on left or right side of comparison.
-  if (g.CanBeImmediate(right, immediate_mode)) {
-    VisitCompare(selector, opcode, g.UseRegister(left), g.UseImmediate(right),
-                 cont);
-  } else if (g.CanBeImmediate(left, immediate_mode)) {
-    if (!commutative) cont->Commute();
-    VisitCompare(selector, opcode, g.UseRegister(right), g.UseImmediate(left),
-                 cont);
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node, InstructionCode opcode,
+                      FlagsContinuationT<Adapter>* cont, bool commutative,
+                      ImmediateMode immediate_mode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    VisitCompare(selector, opcode, g.UseRegister(left), g.UseRegister(right),
-                 cont);
+    PPCOperandGeneratorT<Adapter> g(selector);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+
+    // Match immediates on left or right side of comparison.
+    if (g.CanBeImmediate(right, immediate_mode)) {
+      VisitCompare(selector, opcode, g.UseRegister(left), g.UseImmediate(right),
+                   cont);
+    } else if (g.CanBeImmediate(left, immediate_mode)) {
+      if (!commutative) cont->Commute();
+      VisitCompare(selector, opcode, g.UseRegister(right), g.UseImmediate(left),
+                   cont);
+    } else {
+      VisitCompare(selector, opcode, g.UseRegister(left), g.UseRegister(right),
+                   cont);
+    }
   }
 }
 
-void VisitWord32Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
-  ImmediateMode mode = (CompareLogical(cont) ? kInt16Imm_Unsigned : kInt16Imm);
-  VisitWordCompare(selector, node, kPPC_Cmp32, cont, false, mode);
+template <typename Adapter>
+void VisitWord32Compare(InstructionSelectorT<Adapter>* selector,
+                        typename Adapter::node_t node,
+                        FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ImmediateMode mode =
+        (CompareLogical(cont) ? kInt16Imm_Unsigned : kInt16Imm);
+    VisitWordCompare(selector, node, kPPC_Cmp32, cont, false, mode);
+  }
 }
 
 #if V8_TARGET_ARCH_PPC64
-void VisitWord64Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWord64Compare(InstructionSelectorT<Adapter>* selector, Node* node,
+                        FlagsContinuationT<Adapter>* cont) {
   ImmediateMode mode = (CompareLogical(cont) ? kInt16Imm_Unsigned : kInt16Imm);
   VisitWordCompare(selector, node, kPPC_Cmp64, cont, false, mode);
 }
 #endif
 
 // Shared routine for multiple float32 compare operations.
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  PPCOperandGenerator g(selector);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  VisitCompare(selector, kPPC_CmpDouble, g.UseRegister(left),
-               g.UseRegister(right), cont);
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(selector);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    VisitCompare(selector, kPPC_CmpDouble, g.UseRegister(left),
+                 g.UseRegister(right), cont);
+  }
 }
 
 // Shared routine for multiple float64 compare operations.
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  PPCOperandGenerator g(selector);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  VisitCompare(selector, kPPC_CmpDouble, g.UseRegister(left),
-               g.UseRegister(right), cont);
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(selector);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    VisitCompare(selector, kPPC_CmpDouble, g.UseRegister(left),
+                 g.UseRegister(right), cont);
+  }
 }
 
 }  // namespace
 
 // Shared routine for word comparisons against zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
-    Int32BinopMatcher m(value);
-    if (!m.right().Is(0)) break;
-
-    user = value;
-    value = m.left().node();
-    cont->Negate();
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuation* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
+      Int32BinopMatcher m(value);
+      if (!m.right().Is(0)) break;
+
+      user = value;
+      value = m.left().node();
+      cont->Negate();
+    }
 
-  if (CanCover(user, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
+    if (CanCover(user, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
 #if V8_TARGET_ARCH_PPC64
       case IrOpcode::kWord64Equal:
         cont->OverwriteAndNegateIfEqual(kEqual);
@@ -1750,11 +2484,11 @@ void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
             switch (node->opcode()) {
               case IrOpcode::kInt32AddWithOverflow:
                 cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop<Int32BinopMatcher>(
+                return VisitBinop<Adapter, Int32BinopMatcher>(
                     this, node, kPPC_AddWithOverflow32, kInt16Imm, cont);
               case IrOpcode::kInt32SubWithOverflow:
                 cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop<Int32BinopMatcher>(
+                return VisitBinop<Adapter, Int32BinopMatcher>(
                     this, node, kPPC_SubWithOverflow32, kInt16Imm_Negate, cont);
               case IrOpcode::kInt32MulWithOverflow:
                 cont->OverwriteAndNegateIfEqual(kNotEqual);
@@ -1762,12 +2496,12 @@ void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
 #if V8_TARGET_ARCH_PPC64
               case IrOpcode::kInt64AddWithOverflow:
                 cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop<Int64BinopMatcher>(this, node, kPPC_Add64,
-                                                     kInt16Imm, cont);
+                return VisitBinop<Adapter, Int64BinopMatcher>(
+                    this, node, kPPC_Add64, kInt16Imm, cont);
               case IrOpcode::kInt64SubWithOverflow:
                 cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop<Int64BinopMatcher>(this, node, kPPC_Sub,
-                                                     kInt16Imm_Negate, cont);
+                return VisitBinop<Adapter, Int64BinopMatcher>(
+                    this, node, kPPC_Sub, kInt16Imm_Negate, cont);
               case IrOpcode::kInt64MulWithOverflow:
                 cont->OverwriteAndNegateIfEqual(kNotEqual);
                 return EmitInt64MulWithOverflow(this, node, cont);
@@ -1813,152 +2547,212 @@ void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
         return VisitStackPointerGreaterThan(value, cont);
       default:
         break;
+      }
     }
-  }
 
   // Branch could not be combined with a compare, emit compare against 0.
-  PPCOperandGenerator g(this);
+  PPCOperandGeneratorT<Adapter> g(this);
   VisitCompare(this, kPPC_Cmp32, g.UseRegister(value), g.TempImmediate(0),
                cont);
+  }
 }
 
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  PPCOperandGeneratorT<Adapter> g(this);
   InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
 
   // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
-    static const size_t kMaxTableSwitchValueRange = 2 << 16;
-    size_t table_space_cost = 4 + sw.value_range();
-    size_t table_time_cost = 3;
-    size_t lookup_space_cost = 3 + 2 * sw.case_count();
-    size_t lookup_time_cost = sw.case_count();
-    if (sw.case_count() > 0 &&
-        table_space_cost + 3 * table_time_cost <=
-            lookup_space_cost + 3 * lookup_time_cost &&
-        sw.min_value() > std::numeric_limits<int32_t>::min() &&
-        sw.value_range() <= kMaxTableSwitchValueRange) {
+  if (enable_switch_jump_table_ ==
+      InstructionSelector::kEnableSwitchJumpTable) {
+  static const size_t kMaxTableSwitchValueRange = 2 << 16;
+  size_t table_space_cost = 4 + sw.value_range();
+  size_t table_time_cost = 3;
+  size_t lookup_space_cost = 3 + 2 * sw.case_count();
+  size_t lookup_time_cost = sw.case_count();
+  if (sw.case_count() > 0 &&
+      table_space_cost + 3 * table_time_cost <=
+          lookup_space_cost + 3 * lookup_time_cost &&
+      sw.min_value() > std::numeric_limits<int32_t>::min() &&
+      sw.value_range() <= kMaxTableSwitchValueRange) {
       InstructionOperand index_operand = value_operand;
       if (sw.min_value()) {
-        index_operand = g.TempRegister();
-        Emit(kPPC_Sub, index_operand, value_operand,
-             g.TempImmediate(sw.min_value()));
+      index_operand = g.TempRegister();
+      Emit(kPPC_Sub, index_operand, value_operand,
+           g.TempImmediate(sw.min_value()));
       }
       // Generate a table lookup.
       return EmitTableSwitch(sw, index_operand);
-    }
+  }
   }
 
   // Generate a tree of conditional jumps.
   return EmitBinarySearchSwitch(sw, value_operand);
+  }
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t const node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitWord32Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
 #if V8_TARGET_ARCH_PPC64
-void InstructionSelector::VisitWord64Equal(Node* const node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Equal(node_t const node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 #endif
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
     FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
     return EmitInt32MulWithOverflow(this, node, &cont);
   }
   FlagsContinuation cont;
   EmitInt32MulWithOverflow(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int index) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node, int index) {
+}
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {}
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  PPCOperandGenerator g(this);
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  PPCOperandGeneratorT<Adapter> g(this);
 
   // Prepare for C function call.
   if (call_descriptor->IsCFunctionCall()) {
@@ -1986,24 +2780,42 @@ void InstructionSelector::EmitPrepareArguments(
       Emit(kPPC_Push, g.NoOutput(), decrement, g.UseRegister(input.node));
     }
   }
+  }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return false; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return false;
+}
 
-void InstructionSelector::VisitFloat64ExtractLowWord32(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64ExtractLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(kPPC_DoubleExtractLowWord32, g.DefineAsRegister(node),
        g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitFloat64ExtractHighWord32(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64ExtractHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(kPPC_DoubleExtractHighWord32, g.DefineAsRegister(node),
        g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  PPCOperandGeneratorT<Adapter> g(this);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
   if (left->opcode() == IrOpcode::kFloat64InsertHighWord32 &&
@@ -2015,10 +2827,15 @@ void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
   }
   Emit(kPPC_DoubleInsertLowWord32, g.DefineSameAsFirst(node),
        g.UseRegister(left), g.UseRegister(right));
+  }
 }
 
-void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  PPCOperandGeneratorT<Adapter> g(this);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
   if (left->opcode() == IrOpcode::kFloat64InsertLowWord32 &&
@@ -2030,40 +2847,59 @@ void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
   }
   Emit(kPPC_DoubleInsertHighWord32, g.DefineSameAsFirst(node),
        g.UseRegister(left), g.UseRegister(right));
+  }
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(kPPC_Sync, g.NoOutput());
+  }
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
   AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
   LoadRepresentation load_rep = atomic_load_params.representation();
   VisitLoadCommon(this, node, load_rep);
 }
 
-void InstructionSelector::VisitWord64AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicLoad(Node* node) {
   AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
   LoadRepresentation load_rep = atomic_load_params.representation();
   VisitLoadCommon(this, node, load_rep);
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
-  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
-  VisitStoreCommon(this, node, store_params.store_representation(),
-                   store_params.order());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
+    VisitStoreCommon(this, node, store_params.store_representation(),
+                     store_params.order());
+  }
 }
 
-void InstructionSelector::VisitWord64AtomicStore(Node* node) {
-  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
-  VisitStoreCommon(this, node, store_params.store_representation(),
-                   store_params.order());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
+    VisitStoreCommon(this, node, store_params.store_representation(),
+                     store_params.order());
+  }
 }
 
-void VisitAtomicExchange(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicExchange(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode) {
-  PPCOperandGenerator g(selector);
+  PPCOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2080,7 +2916,8 @@ void VisitAtomicExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Int8()) {
@@ -2099,7 +2936,8 @@ void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode);
 }
 
-void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicExchange(Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Uint8()) {
@@ -2116,9 +2954,10 @@ void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode);
 }
 
-void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
-                                ArchOpcode opcode) {
-  PPCOperandGenerator g(selector);
+template <typename Adapter>
+void VisitAtomicCompareExchange(InstructionSelectorT<Adapter>* selector,
+                                Node* node, ArchOpcode opcode) {
+  PPCOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -2141,7 +2980,9 @@ void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, output_count, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
   MachineType type = AtomicOpType(node->op());
   ArchOpcode opcode;
   if (type == MachineType::Int8()) {
@@ -2160,7 +3001,9 @@ void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
   VisitAtomicCompareExchange(this, node, opcode);
 }
 
-void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicCompareExchange(
+    Node* node) {
   MachineType type = AtomicOpType(node->op());
   ArchOpcode opcode;
   if (type == MachineType::Uint8()) {
@@ -2177,12 +3020,14 @@ void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
   VisitAtomicCompareExchange(this, node, opcode);
 }
 
-void VisitAtomicBinaryOperation(InstructionSelector* selector, Node* node,
-                                ArchOpcode int8_op, ArchOpcode uint8_op,
-                                ArchOpcode int16_op, ArchOpcode uint16_op,
-                                ArchOpcode int32_op, ArchOpcode uint32_op,
-                                ArchOpcode int64_op, ArchOpcode uint64_op) {
-  PPCOperandGenerator g(selector);
+template <typename Adapter>
+void VisitAtomicBinaryOperation(InstructionSelectorT<Adapter>* selector,
+                                Node* node, ArchOpcode int8_op,
+                                ArchOpcode uint8_op, ArchOpcode int16_op,
+                                ArchOpcode uint16_op, ArchOpcode int32_op,
+                                ArchOpcode uint32_op, ArchOpcode int64_op,
+                                ArchOpcode uint64_op) {
+  PPCOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2226,34 +3071,38 @@ void VisitAtomicBinaryOperation(InstructionSelector* selector, Node* node,
   selector->Emit(code, output_count, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
-    Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
   // Unused
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitWord64AtomicBinaryOperation(
-    Node* node, ArchOpcode uint8_op, ArchOpcode uint16_op, ArchOpcode uint32_op,
-    ArchOpcode uint64_op) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicBinaryOperation(
+    node_t node, ArchOpcode uint8_op, ArchOpcode uint16_op,
+    ArchOpcode uint32_op, ArchOpcode uint64_op) {
   // Unused
   UNREACHABLE();
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                     \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {    \
-    VisitAtomicBinaryOperation(                                    \
-        this, node, kPPC_Atomic##op##Int8, kPPC_Atomic##op##Uint8, \
-        kPPC_Atomic##op##Int16, kPPC_Atomic##op##Uint16,           \
-        kPPC_Atomic##op##Int32, kPPC_Atomic##op##Uint32,           \
-        kPPC_Atomic##op##Int64, kPPC_Atomic##op##Uint64);          \
-  }                                                                \
-  void InstructionSelector::VisitWord64Atomic##op(Node* node) {    \
-    VisitAtomicBinaryOperation(                                    \
-        this, node, kPPC_Atomic##op##Int8, kPPC_Atomic##op##Uint8, \
-        kPPC_Atomic##op##Int16, kPPC_Atomic##op##Uint16,           \
-        kPPC_Atomic##op##Int32, kPPC_Atomic##op##Uint32,           \
-        kPPC_Atomic##op##Int64, kPPC_Atomic##op##Uint64);          \
+#define VISIT_ATOMIC_BINOP(op)                                            \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) { \
+    VisitAtomicBinaryOperation(                                           \
+        this, node, kPPC_Atomic##op##Int8, kPPC_Atomic##op##Uint8,        \
+        kPPC_Atomic##op##Int16, kPPC_Atomic##op##Uint16,                  \
+        kPPC_Atomic##op##Int32, kPPC_Atomic##op##Uint32,                  \
+        kPPC_Atomic##op##Int64, kPPC_Atomic##op##Uint64);                 \
+  }                                                                       \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord64Atomic##op(Node* node) { \
+    VisitAtomicBinaryOperation(                                           \
+        this, node, kPPC_Atomic##op##Int8, kPPC_Atomic##op##Uint8,        \
+        kPPC_Atomic##op##Int16, kPPC_Atomic##op##Uint16,                  \
+        kPPC_Atomic##op##Int32, kPPC_Atomic##op##Uint32,                  \
+        kPPC_Atomic##op##Int64, kPPC_Atomic##op##Uint64);                 \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -2262,11 +3111,13 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
@@ -2459,12 +3310,14 @@ void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
   V(S128Not)                   \
   V(V128AnyTrue)
 
-#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                              \
-  void InstructionSelector::Visit##Type##ExtractLane##Sign(Node* node) { \
-    PPCOperandGenerator g(this);                                         \
-    int32_t lane = OpParameter<int32_t>(node->op());                     \
-    Emit(kPPC_##Type##ExtractLane##Sign, g.DefineAsRegister(node),       \
-         g.UseRegister(node->InputAt(0)), g.UseImmediate(lane));         \
+#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                           \
+  template <typename Adapter>                                         \
+  void InstructionSelectorT<Adapter>::Visit##Type##ExtractLane##Sign( \
+      Node* node) {                                                   \
+    PPCOperandGeneratorT<Adapter> g(this);                            \
+    int32_t lane = OpParameter<int32_t>(node->op());                  \
+    Emit(kPPC_##Type##ExtractLane##Sign, g.DefineAsRegister(node),    \
+         g.UseRegister(node->InputAt(0)), g.UseImmediate(lane));      \
   }
 SIMD_VISIT_EXTRACT_LANE(F64x2, )
 SIMD_VISIT_EXTRACT_LANE(F32x4, )
@@ -2476,20 +3329,22 @@ SIMD_VISIT_EXTRACT_LANE(I8x16, U)
 SIMD_VISIT_EXTRACT_LANE(I8x16, S)
 #undef SIMD_VISIT_EXTRACT_LANE
 
-#define SIMD_VISIT_REPLACE_LANE(Type)                              \
-  void InstructionSelector::Visit##Type##ReplaceLane(Node* node) { \
-    PPCOperandGenerator g(this);                                   \
-    int32_t lane = OpParameter<int32_t>(node->op());               \
-    Emit(kPPC_##Type##ReplaceLane, g.DefineSameAsFirst(node),      \
-         g.UseRegister(node->InputAt(0)), g.UseImmediate(lane),    \
-         g.UseRegister(node->InputAt(1)));                         \
+#define SIMD_VISIT_REPLACE_LANE(Type)                                        \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##ReplaceLane(Node* node) { \
+    PPCOperandGeneratorT<Adapter> g(this);                                   \
+    int32_t lane = OpParameter<int32_t>(node->op());                         \
+    Emit(kPPC_##Type##ReplaceLane, g.DefineSameAsFirst(node),                \
+         g.UseRegister(node->InputAt(0)), g.UseImmediate(lane),              \
+         g.UseRegister(node->InputAt(1)));                                   \
   }
 SIMD_TYPES(SIMD_VISIT_REPLACE_LANE)
 #undef SIMD_VISIT_REPLACE_LANE
 
 #define SIMD_VISIT_BINOP(Opcode)                                           \
-  void InstructionSelector::Visit##Opcode(Node* node) {                    \
-    PPCOperandGenerator g(this);                                           \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {          \
+    PPCOperandGeneratorT<Adapter> g(this);                                 \
     InstructionOperand temps[] = {g.TempRegister()};                       \
     Emit(kPPC_##Opcode, g.DefineAsRegister(node),                          \
          g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)), \
@@ -2499,19 +3354,21 @@ SIMD_BINOP_LIST(SIMD_VISIT_BINOP)
 #undef SIMD_VISIT_BINOP
 #undef SIMD_BINOP_LIST
 
-#define SIMD_VISIT_UNOP(Opcode)                         \
-  void InstructionSelector::Visit##Opcode(Node* node) { \
-    PPCOperandGenerator g(this);                        \
-    Emit(kPPC_##Opcode, g.DefineAsRegister(node),       \
-         g.UseRegister(node->InputAt(0)));              \
+#define SIMD_VISIT_UNOP(Opcode)                                   \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) { \
+    PPCOperandGeneratorT<Adapter> g(this);                        \
+    Emit(kPPC_##Opcode, g.DefineAsRegister(node),                 \
+         g.UseRegister(node->InputAt(0)));                        \
   }
 SIMD_UNOP_LIST(SIMD_VISIT_UNOP)
 #undef SIMD_VISIT_UNOP
 #undef SIMD_UNOP_LIST
 
 #define SIMD_VISIT_QFMOP(Opcode)                                           \
-  void InstructionSelector::Visit##Opcode(Node* node) {                    \
-    PPCOperandGenerator g(this);                                           \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {          \
+    PPCOperandGeneratorT<Adapter> g(this);                                 \
     Emit(kPPC_##Opcode, g.DefineSameAsFirst(node),                         \
          g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)), \
          g.UseRegister(node->InputAt(2)));                                 \
@@ -2537,19 +3394,23 @@ SIMD_VISIT_QFMOP(F32x4Qfms)
   V(I32x4RelaxedLaneSelect, S128Select)                   \
   V(I64x2RelaxedLaneSelect, S128Select)
 
-#define SIMD_VISIT_RELAXED_OP(name, op) \
-  void InstructionSelector::Visit##name(Node* node) { Visit##op(node); }
+#define SIMD_VISIT_RELAXED_OP(name, op)                         \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##name(Node* node) { \
+    Visit##op(node);                                            \
+  }
 SIMD_RELAXED_OP_LIST(SIMD_VISIT_RELAXED_OP)
 #undef SIMD_VISIT_RELAXED_OP
 #undef SIMD_RELAXED_OP_LIST
 #undef SIMD_TYPES
 
 #if V8_ENABLE_WEBASSEMBLY
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
-  PPCOperandGenerator g(this);
+  PPCOperandGeneratorT<Adapter> g(this);
   Node* input0 = node->InputAt(0);
   Node* input1 = node->InputAt(1);
   // Remap the shuffle indices to match IBM lane numbering.
@@ -2570,16 +3431,21 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
        g.UseImmediate(wasm::SimdShuffle::Pack4Lanes(shuffle_remapped + 12)));
 }
 #else
-void InstructionSelector::VisitI8x16Shuffle(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
+  UNREACHABLE();
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(kPPC_S128Zero, g.DefineAsRegister(node));
 }
 
-void InstructionSelector::VisitS128Select(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(kPPC_S128Select, g.DefineAsRegister(node),
        g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
        g.UseRegister(node->InputAt(2)));
@@ -2597,8 +3463,9 @@ static int32_t Pack4Lanes(const uint8_t* shuffle) {
   return result;
 }
 
-void InstructionSelector::VisitS128Const(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  PPCOperandGeneratorT<Adapter> g(this);
   uint32_t val[kSimd128Size / sizeof(uint32_t)];
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
   // If all bytes are zeros, avoid emitting code for generic constants.
@@ -2621,27 +3488,33 @@ void InstructionSelector::VisitS128Const(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI16x8DotI8x16I7x16S(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8DotI8x16I7x16S(Node* node) {
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(kPPC_I16x8DotI8x16S, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)),
        g.UseUniqueRegister(node->InputAt(1)));
 }
 
-void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI8x16I7x16AddS(Node* node) {
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(kPPC_I32x4DotI8x16AddS, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)),
        g.UseUniqueRegister(node->InputAt(1)),
        g.UseUniqueRegister(node->InputAt(2)));
 }
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  PPCOperandGenerator g(this);
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    PPCOperandGeneratorT<Adapter> g(this);
 
-  for (PushParameter output : *results) {
+    for (PushParameter output : *results) {
     if (!output.location.IsCallerFrameSlot()) continue;
     // Skip any alignment holes in nodes.
     if (output.node != nullptr) {
@@ -2658,10 +3531,12 @@ void InstructionSelector::EmitPrepareResults(
       Emit(kPPC_Peek, g.DefineAsRegister(output.node),
            g.UseImmediate(reverse_slot));
     }
+    }
   }
 }
 
-void InstructionSelector::VisitLoadLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
   LoadLaneParameters params = LoadLaneParametersOf(node->op());
   InstructionCode opcode = kArchNop;
   if (params.rep == MachineType::Int8()) {
@@ -2676,16 +3551,17 @@ void InstructionSelector::VisitLoadLane(Node* node) {
     UNREACHABLE();
   }
 
-  PPCOperandGenerator g(this);
+  PPCOperandGeneratorT<Adapter> g(this);
   Emit(opcode | AddressingModeField::encode(kMode_MRR),
        g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(2)),
        g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
        g.UseImmediate(params.laneidx));
 }
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
-  PPCOperandGenerator g(this);
+  PPCOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -2734,8 +3610,9 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
        g.DefineAsRegister(node), g.UseRegister(base), g.UseRegister(index));
 }
 
-void InstructionSelector::VisitStoreLane(Node* node) {
-  PPCOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
+  PPCOperandGeneratorT<Adapter> g(this);
 
   StoreLaneParameters params = StoreLaneParametersOf(node->op());
   InstructionCode opcode = kArchNop;
@@ -2760,25 +3637,45 @@ void InstructionSelector::VisitStoreLane(Node* node) {
   Emit(opcode | AddressingModeField::encode(kMode_MRR), 0, nullptr, 4, inputs);
 }
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGenerator* g, int first_input_index, node_t node) {
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTiesEven(node_t node) {
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesEven(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitFloat32RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2NearestInt(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitFloat64RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4NearestInt(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitF64x2NearestInt(Node* node) { UNREACHABLE(); }
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
 
-void InstructionSelector::VisitF32x4NearestInt(Node* node) { UNREACHABLE(); }
+template <>
+TurboshaftAdapter::node_t
+InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    node_t node, size_t projection_index) {
+  UNIMPLEMENTED();
+}
 
-// static
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
   return MachineOperatorBuilder::kFloat32RoundDown |
@@ -2793,13 +3690,17 @@ InstructionSelector::SupportedMachineOperatorFlags() {
   // We omit kWord32ShiftIsSafe as s[rl]w use 0x3F as a mask rather than 0x1F.
 }
 
-// static
 MachineOperatorBuilder::AlignmentRequirements
 InstructionSelector::AlignmentRequirements() {
   return MachineOperatorBuilder::AlignmentRequirements::
       FullUnalignedAccessSupport();
 }
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/register-allocation.h b/deps/v8/src/compiler/backend/register-allocation.h
index 6893aa42776977..63dff425a19ce5 100644
--- a/deps/v8/src/compiler/backend/register-allocation.h
+++ b/deps/v8/src/compiler/backend/register-allocation.h
@@ -75,6 +75,7 @@ inline int ByteWidthForStackSlot(MachineRepresentation rep) {
       return kSimd256Size;
     case MachineRepresentation::kNone:
     case MachineRepresentation::kMapWord:
+    case MachineRepresentation::kIndirectPointer:
       break;
   }
   UNREACHABLE();
diff --git a/deps/v8/src/compiler/backend/register-allocator-verifier.cc b/deps/v8/src/compiler/backend/register-allocator-verifier.cc
index 9073b18b8d5807..104476c8cbdf1e 100644
--- a/deps/v8/src/compiler/backend/register-allocator-verifier.cc
+++ b/deps/v8/src/compiler/backend/register-allocator-verifier.cc
@@ -78,7 +78,7 @@ RegisterAllocatorVerifier::RegisterAllocatorVerifier(
     VerifyEmptyGaps(instr);
     const size_t operand_count = OperandCount(instr);
     OperandConstraint* op_constraints =
-        zone->NewArray<OperandConstraint>(operand_count);
+        zone->AllocateArray<OperandConstraint>(operand_count);
     size_t count = 0;
     for (size_t i = 0; i < instr->InputCount(); ++i, ++count) {
       BuildConstraint(instr->InputAt(i), &op_constraints[count]);
diff --git a/deps/v8/src/compiler/backend/register-allocator.cc b/deps/v8/src/compiler/backend/register-allocator.cc
index f643cec7656a71..9315b53eabf44d 100644
--- a/deps/v8/src/compiler/backend/register-allocator.cc
+++ b/deps/v8/src/compiler/backend/register-allocator.cc
@@ -19,13 +19,11 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-#define TRACE_COND(cond, ...)      \
-  do {                             \
-    if (cond) PrintF(__VA_ARGS__); \
+#define TRACE(...)                                       \
+  do {                                                   \
+    if (v8_flags.trace_turbo_alloc) PrintF(__VA_ARGS__); \
   } while (false)
 
-#define TRACE(...) TRACE_COND(data()->is_trace_alloc(), __VA_ARGS__)
-
 namespace {
 
 static constexpr int kFloat32Bit =
@@ -52,96 +50,6 @@ Instruction* GetLastInstruction(InstructionSequence* code,
 
 }  // namespace
 
-void LiveRangeBoundArray::Initialize(Zone* zone, TopLevelLiveRange* range) {
-  size_t max_child_count = range->GetMaxChildCount();
-
-  start_ = zone->NewArray<LiveRangeBound>(max_child_count);
-  length_ = 0;
-  LiveRangeBound* curr = start_;
-  // The primary loop in ResolveControlFlow is not responsible for inserting
-  // connecting moves for spilled ranges.
-  for (LiveRange* i = range; i != nullptr; i = i->next(), ++curr, ++length_) {
-    new (curr) LiveRangeBound(i, i->spilled());
-  }
-}
-
-LiveRangeBound* LiveRangeBoundArray::Find(
-    const LifetimePosition position) const {
-  size_t left_index = 0;
-  size_t right_index = length_;
-  while (true) {
-    size_t current_index = left_index + (right_index - left_index) / 2;
-    DCHECK(right_index > current_index);
-    LiveRangeBound* bound = &start_[current_index];
-    if (bound->start_ <= position) {
-      if (position < bound->end_) return bound;
-      DCHECK(left_index < current_index);
-      left_index = current_index;
-    } else {
-      right_index = current_index;
-    }
-  }
-}
-
-LiveRangeBound* LiveRangeBoundArray::FindPred(const InstructionBlock* pred) {
-  LifetimePosition pred_end = LifetimePosition::InstructionFromInstructionIndex(
-      pred->last_instruction_index());
-  return Find(pred_end);
-}
-
-LiveRangeBound* LiveRangeBoundArray::FindSucc(const InstructionBlock* succ) {
-  LifetimePosition succ_start = LifetimePosition::GapFromInstructionIndex(
-      succ->first_instruction_index());
-  return Find(succ_start);
-}
-
-bool LiveRangeBoundArray::FindConnectableSubranges(
-    const InstructionBlock* block, const InstructionBlock* pred,
-    FindResult* result) const {
-  LifetimePosition pred_end = LifetimePosition::InstructionFromInstructionIndex(
-      pred->last_instruction_index());
-  LiveRangeBound* bound = Find(pred_end);
-  result->pred_cover_ = bound->range_;
-  LifetimePosition cur_start = LifetimePosition::GapFromInstructionIndex(
-      block->first_instruction_index());
-
-  if (bound->CanCover(cur_start)) {
-    // Both blocks are covered by the same range, so there is nothing to
-    // connect.
-    return false;
-  }
-  bound = Find(cur_start);
-  if (bound->skip_) {
-    return false;
-  }
-  result->cur_cover_ = bound->range_;
-  DCHECK(result->pred_cover_ != nullptr && result->cur_cover_ != nullptr);
-  return (result->cur_cover_ != result->pred_cover_);
-}
-
-LiveRangeFinder::LiveRangeFinder(const TopTierRegisterAllocationData* data,
-                                 Zone* zone)
-    : data_(data),
-      bounds_length_(static_cast<int>(data_->live_ranges().size())),
-      bounds_(zone->NewArray<LiveRangeBoundArray>(bounds_length_)),
-      zone_(zone) {
-  for (int i = 0; i < bounds_length_; ++i) {
-    new (&bounds_[i]) LiveRangeBoundArray();
-  }
-}
-
-LiveRangeBoundArray* LiveRangeFinder::ArrayFor(int operand_index) {
-  DCHECK(operand_index < bounds_length_);
-  TopLevelLiveRange* range = data_->live_ranges()[operand_index];
-  DCHECK(range != nullptr && !range->IsEmpty());
-  DCHECK_EQ(range->vreg(), operand_index);
-  LiveRangeBoundArray* array = &bounds_[operand_index];
-  if (array->ShouldInitialize()) {
-    array->Initialize(zone_, range);
-  }
-  return array;
-}
-
 using DelayedInsertionMapKey = std::pair<ParallelMove*, InstructionOperand>;
 
 struct DelayedInsertionMapCompare {
@@ -159,7 +67,7 @@ using DelayedInsertionMap = ZoneMap<DelayedInsertionMapKey, InstructionOperand,
 
 UsePosition::UsePosition(LifetimePosition pos, InstructionOperand* operand,
                          void* hint, UsePositionHintType hint_type)
-    : operand_(operand), hint_(hint), next_(nullptr), pos_(pos), flags_(0) {
+    : operand_(operand), hint_(hint), pos_(pos), flags_(0) {
   DCHECK_IMPLIES(hint == nullptr, hint_type == UsePositionHintType::kNone);
   bool register_beneficial = true;
   UsePositionType type = UsePositionType::kRegisterOrSlot;
@@ -263,74 +171,57 @@ void UsePosition::set_type(UsePositionType type, bool register_beneficial) {
            AssignedRegisterField::encode(kUnassignedRegister);
 }
 
-UseInterval* UseInterval::SplitAt(LifetimePosition pos, Zone* zone) {
-  DCHECK(Contains(pos) && pos != start());
-  UseInterval* after = zone->New<UseInterval>(pos, end_);
-  after->next_ = next_;
-  next_ = nullptr;
-  end_ = pos;
-  return after;
-}
-
 void LifetimePosition::Print() const { StdoutStream{} << *this << std::endl; }
 
-std::ostream& operator<<(std::ostream& os, const LifetimePosition pos) {
-  os << '@' << pos.ToInstructionIndex();
-  if (pos.IsGapPosition()) {
-    os << 'g';
-  } else {
-    os << 'i';
-  }
-  if (pos.IsStart()) {
-    os << 's';
-  } else {
-    os << 'e';
-  }
-  return os;
-}
-
 LiveRange::LiveRange(int relative_id, MachineRepresentation rep,
                      TopLevelLiveRange* top_level)
     : relative_id_(relative_id),
       bits_(0),
-      last_interval_(nullptr),
-      first_interval_(nullptr),
-      first_pos_(nullptr),
+      intervals_(),
+      positions_span_(),
       top_level_(top_level),
       next_(nullptr),
-      current_interval_(nullptr),
-      last_processed_use_(nullptr),
-      current_hint_position_(nullptr) {
+      current_interval_(intervals_.begin()) {
   DCHECK(AllocatedOperand::IsSupportedRepresentation(rep));
   bits_ = AssignedRegisterField::encode(kUnassignedRegister) |
           RepresentationField::encode(rep) |
           ControlFlowRegisterHint::encode(kUnassignedRegister);
 }
 
+#ifdef DEBUG
 void LiveRange::VerifyPositions() const {
-  // Walk the positions, verifying that each is in an interval.
-  UseInterval* interval = first_interval_;
-  for (UsePosition* pos = first_pos_; pos != nullptr; pos = pos->next()) {
-    CHECK(Start() <= pos->pos());
-    CHECK(pos->pos() <= End());
-    CHECK_NOT_NULL(interval);
+  SLOW_DCHECK(std::is_sorted(positions().begin(), positions().end(),
+                             UsePosition::Ordering()));
+
+  // Verify that each `UsePosition` is covered by a `UseInterval`.
+  UseIntervalVector::const_iterator interval = intervals().begin();
+  for (UsePosition* pos : positions()) {
+    DCHECK_LE(Start(), pos->pos());
+    DCHECK_LE(pos->pos(), End());
+    DCHECK_NE(interval, intervals().end());
+    // NOTE: Even though `UseInterval`s are conceptually half-open (e.g., when
+    // splitting), we still regard the `UsePosition` that coincides with
+    // the end of an interval as covered by that interval.
     while (!interval->Contains(pos->pos()) && interval->end() != pos->pos()) {
-      interval = interval->next();
-      CHECK_NOT_NULL(interval);
+      ++interval;
+      DCHECK_NE(interval, intervals().end());
     }
   }
 }
 
 void LiveRange::VerifyIntervals() const {
-  DCHECK(first_interval()->start() == Start());
-  LifetimePosition last_end = first_interval()->end();
-  for (UseInterval* interval = first_interval()->next(); interval != nullptr;
-       interval = interval->next()) {
-    DCHECK(last_end <= interval->start());
+  DCHECK(!intervals().empty());
+  DCHECK_EQ(intervals().front().start(), Start());
+  // The `UseInterval`s must be sorted and disjoint.
+  LifetimePosition last_end = intervals().front().end();
+  for (UseIntervalVector::const_iterator interval = intervals().begin() + 1;
+       interval != intervals().end(); ++interval) {
+    DCHECK_LE(last_end, interval->start());
     last_end = interval->end();
   }
-  DCHECK(last_end == End());
+  DCHECK_EQ(last_end, End());
 }
+#endif
 
 void LiveRange::set_assigned_register(int reg) {
   DCHECK(!HasRegisterAssigned() && !spilled());
@@ -342,23 +233,26 @@ void LiveRange::UnsetAssignedRegister() {
   bits_ = AssignedRegisterField::update(bits_, kUnassignedRegister);
 }
 
-void LiveRange::AttachToNext() {
+void LiveRange::AttachToNext(Zone* zone) {
   DCHECK_NOT_NULL(next_);
-  DCHECK_NE(TopLevel()->last_child_covers_, next_);
-  last_interval_->set_next(next_->first_interval());
-  next_->first_interval_ = nullptr;
-  last_interval_ = next_->last_interval_;
-  next_->last_interval_ = nullptr;
-  if (first_pos() == nullptr) {
-    first_pos_ = next_->first_pos();
-  } else {
-    UsePosition* ptr = first_pos_;
-    while (ptr->next() != nullptr) {
-      ptr = ptr->next();
-    }
-    ptr->set_next(next_->first_pos());
-  }
-  next_->first_pos_ = nullptr;
+
+  // Update cache for `TopLevelLiveRange::GetChildCovers()`.
+  auto& children = TopLevel()->children_;
+  children.erase(std::lower_bound(children.begin(), children.end(), next_,
+                                  LiveRangeOrdering()));
+
+  // Merge use intervals.
+  intervals_.Append(zone, next_->intervals_);
+  // `start_` doesn't change.
+  end_ = next_->end_;
+
+  // Merge use positions.
+  CHECK_EQ(positions_span_.end(), next_->positions_span_.begin());
+  positions_span_ =
+      base::VectorOf(positions_span_.begin(),
+                     positions_span_.size() + next_->positions_span_.size());
+
+  // Join linked lists of live ranges.
   LiveRange* old_next = next_;
   next_ = next_->next_;
   old_next->next_ = nullptr;
@@ -387,62 +281,53 @@ RegisterKind LiveRange::kind() const {
   }
 }
 
-UsePosition* LiveRange::FirstHintPosition(int* register_index) {
-  if (!first_pos_) return nullptr;
-  if (current_hint_position_) {
-    if (current_hint_position_->pos() < first_pos_->pos()) {
-      current_hint_position_ = first_pos_;
-    }
-    if (current_hint_position_->pos() > End()) {
-      current_hint_position_ = nullptr;
-    }
+bool LiveRange::RegisterFromFirstHint(int* register_index) {
+  DCHECK_LE(current_hint_position_index_, positions_span_.size());
+  if (current_hint_position_index_ == positions_span_.size()) {
+    return false;
   }
+  DCHECK_GE(positions_span_[current_hint_position_index_]->pos(),
+            positions_span_.first()->pos());
+  DCHECK_LE(positions_span_[current_hint_position_index_]->pos(), End());
+
   bool needs_revisit = false;
-  UsePosition* pos = current_hint_position_;
-  for (; pos != nullptr; pos = pos->next()) {
-    if (pos->HintRegister(register_index)) {
+  UsePosition** pos_it = positions_span_.begin() + current_hint_position_index_;
+  for (; pos_it != positions_span_.end(); ++pos_it) {
+    if ((*pos_it)->HintRegister(register_index)) {
       break;
     }
     // Phi and use position hints can be assigned during allocation which
     // would invalidate the cached hint position. Make sure we revisit them.
     needs_revisit = needs_revisit ||
-                    pos->hint_type() == UsePositionHintType::kPhi ||
-                    pos->hint_type() == UsePositionHintType::kUsePos;
+                    (*pos_it)->hint_type() == UsePositionHintType::kPhi ||
+                    (*pos_it)->hint_type() == UsePositionHintType::kUsePos;
   }
   if (!needs_revisit) {
-    current_hint_position_ = pos;
+    current_hint_position_index_ =
+        std::distance(positions_span_.begin(), pos_it);
   }
 #ifdef DEBUG
-  UsePosition* pos_check = first_pos_;
-  for (; pos_check != nullptr; pos_check = pos_check->next()) {
-    if (pos_check->HasHint()) {
-      break;
-    }
-  }
-  CHECK_EQ(pos, pos_check);
+  UsePosition** pos_check_it =
+      std::find_if(positions_span_.begin(), positions_span_.end(),
+                   [](UsePosition* pos) { return pos->HasHint(); });
+  CHECK_EQ(pos_it, pos_check_it);
 #endif
-  return pos;
+  return pos_it != positions_span_.end();
 }
 
-UsePosition* LiveRange::NextUsePosition(LifetimePosition start) const {
-  UsePosition* use_pos = last_processed_use_;
-  if (use_pos == nullptr || use_pos->pos() > start) {
-    use_pos = first_pos();
-  }
-  while (use_pos != nullptr && use_pos->pos() < start) {
-    use_pos = use_pos->next();
-  }
-  last_processed_use_ = use_pos;
-  return use_pos;
+UsePosition* const* LiveRange::NextUsePosition(LifetimePosition start) const {
+  return std::lower_bound(positions_span_.cbegin(), positions_span_.cend(),
+                          start, [](UsePosition* use, LifetimePosition start) {
+                            return use->pos() < start;
+                          });
 }
 
 UsePosition* LiveRange::NextUsePositionRegisterIsBeneficial(
     LifetimePosition start) const {
-  UsePosition* pos = NextUsePosition(start);
-  while (pos != nullptr && !pos->RegisterIsBeneficial()) {
-    pos = pos->next();
-  }
-  return pos;
+  UsePosition* const* use_pos_it = std::find_if(
+      NextUsePosition(start), positions_span_.cend(),
+      [](const UsePosition* pos) { return pos->RegisterIsBeneficial(); });
+  return use_pos_it == positions_span_.cend() ? nullptr : *use_pos_it;
 }
 
 LifetimePosition LiveRange::NextLifetimePositionRegisterIsBeneficial(
@@ -452,33 +337,24 @@ LifetimePosition LiveRange::NextLifetimePositionRegisterIsBeneficial(
   return next_use->pos();
 }
 
-UsePosition* LiveRange::PreviousUsePositionRegisterIsBeneficial(
-    LifetimePosition start) const {
-  UsePosition* pos = first_pos();
-  UsePosition* prev = nullptr;
-  while (pos != nullptr && pos->pos() < start) {
-    if (pos->RegisterIsBeneficial()) prev = pos;
-    pos = pos->next();
-  }
-  return prev;
-}
-
 UsePosition* LiveRange::NextUsePositionSpillDetrimental(
     LifetimePosition start) const {
-  UsePosition* pos = NextUsePosition(start);
-  while (pos != nullptr && pos->type() != UsePositionType::kRequiresRegister &&
-         !pos->SpillDetrimental()) {
-    pos = pos->next();
-  }
-  return pos;
+  UsePosition* const* use_pos_it =
+      std::find_if(NextUsePosition(start), positions_span_.cend(),
+                   [](const UsePosition* pos) {
+                     return pos->type() == UsePositionType::kRequiresRegister ||
+                            pos->SpillDetrimental();
+                   });
+  return use_pos_it == positions_span_.cend() ? nullptr : *use_pos_it;
 }
 
 UsePosition* LiveRange::NextRegisterPosition(LifetimePosition start) const {
-  UsePosition* pos = NextUsePosition(start);
-  while (pos != nullptr && pos->type() != UsePositionType::kRequiresRegister) {
-    pos = pos->next();
-  }
-  return pos;
+  UsePosition* const* use_pos_it =
+      std::find_if(NextUsePosition(start), positions_span_.cend(),
+                   [](const UsePosition* pos) {
+                     return pos->type() == UsePositionType::kRequiresRegister;
+                   });
+  return use_pos_it == positions_span_.cend() ? nullptr : *use_pos_it;
 }
 
 bool LiveRange::CanBeSpilled(LifetimePosition pos) const {
@@ -508,143 +384,118 @@ InstructionOperand LiveRange::GetAssignedOperand() const {
   return TopLevel()->GetSpillRangeOperand();
 }
 
-UseInterval* LiveRange::FirstSearchIntervalForPosition(
-    LifetimePosition position) const {
-  if (current_interval_ == nullptr) return first_interval_;
+UseIntervalVector::iterator LiveRange::FirstSearchIntervalForPosition(
+    LifetimePosition position) {
+  DCHECK_NE(current_interval_, intervals_.end());
   if (current_interval_->start() > position) {
-    current_interval_ = nullptr;
-    return first_interval_;
+    current_interval_ = std::lower_bound(
+        intervals_.begin(), intervals_.end(), position,
+        [](const UseInterval& interval, LifetimePosition position) {
+          return interval.end() < position;
+        });
   }
   return current_interval_;
 }
 
 void LiveRange::AdvanceLastProcessedMarker(
-    UseInterval* to_start_of, LifetimePosition but_not_past) const {
-  if (to_start_of == nullptr) return;
+    UseIntervalVector::iterator to_start_of, LifetimePosition but_not_past) {
+  DCHECK_LE(intervals_.begin(), to_start_of);
+  DCHECK_LT(to_start_of, intervals_.end());
+  DCHECK_NE(current_interval_, intervals_.end());
   if (to_start_of->start() > but_not_past) return;
-  LifetimePosition start = current_interval_ == nullptr
-                               ? LifetimePosition::Invalid()
-                               : current_interval_->start();
-  if (to_start_of->start() > start) {
+  if (to_start_of->start() > current_interval_->start()) {
     current_interval_ = to_start_of;
   }
 }
 
 LiveRange* LiveRange::SplitAt(LifetimePosition position, Zone* zone) {
-  int new_id = TopLevel()->GetNextChildId();
-  LiveRange* child = zone->New<LiveRange>(new_id, representation(), TopLevel());
-  child->set_bundle(bundle_);
-  // If we split, we do so because we're about to switch registers or move
-  // to/from a slot, so there's no value in connecting hints.
-  DetachAt(position, child, zone, DoNotConnectHints);
-
-  child->top_level_ = TopLevel();
-  child->next_ = next_;
-  next_ = child;
-  return child;
-}
-
-UsePosition* LiveRange::DetachAt(LifetimePosition position, LiveRange* result,
-                                 Zone* zone,
-                                 HintConnectionOption connect_hints) {
   DCHECK(Start() < position);
   DCHECK(End() > position);
-  DCHECK(result->IsEmpty());
-  // Find the last interval that ends before the position. If the
-  // position is contained in one of the intervals in the chain, we
-  // split that interval and use the first part.
-  UseInterval* current = FirstSearchIntervalForPosition(position);
-
-  // If the split position coincides with the beginning of a use interval
-  // we need to split use positons in a special way.
-  bool split_at_start = false;
 
-  if (current->start() == position) {
-    // When splitting at start we need to locate the previous use interval.
-    current = first_interval_;
-  }
-
-  UseInterval* after = nullptr;
-  while (current != nullptr) {
-    if (current->Contains(position)) {
-      after = current->SplitAt(position, zone);
-      break;
-    }
-    UseInterval* next = current->next();
-    if (next->start() >= position) {
-      split_at_start = (next->start() == position);
-      after = next;
-      current->set_next(nullptr);
-      break;
-    }
-    current = next;
-  }
-  DCHECK_NOT_NULL(after);
+  int new_id = TopLevel()->GetNextChildId();
+  LiveRange* result =
+      zone->New<LiveRange>(new_id, representation(), TopLevel());
 
   // Partition original use intervals to the two live ranges.
-  UseInterval* before = current;
-  result->last_interval_ =
-      (last_interval_ == before)
-          ? after            // Only interval in the range after split.
-          : last_interval_;  // Last interval of the original range.
-  result->first_interval_ = after;
-  last_interval_ = before;
-
-  // Find the last use position before the split and the first use
-  // position after it.
-  UsePosition* use_after = first_pos();
-  UsePosition* use_before = nullptr;
+
+  // Find the first interval that ends after the position. (This either needs
+  // to be split or completely belongs to the split-off LiveRange.)
+  UseIntervalVector::iterator split_interval = std::upper_bound(
+      intervals_.begin(), intervals_.end(), position,
+      [](LifetimePosition position, const UseInterval& interval) {
+        return position < interval.end();
+      });
+  DCHECK_NE(split_interval, intervals_.end());
+
+  bool split_at_start = false;
+  if (split_interval->start() == position) {
+    split_at_start = true;
+  } else if (split_interval->Contains(position)) {
+    UseInterval new_interval = split_interval->SplitAt(position);
+    split_interval = intervals_.insert(zone, split_interval + 1, new_interval);
+  }
+  result->intervals_ = intervals_.SplitAt(split_interval);
+  DCHECK(!intervals_.empty());
+  DCHECK(!result->intervals_.empty());
+
+  result->start_ = result->intervals_.front().start();
+  result->end_ = end_;
+  end_ = intervals_.back().end();
+
+  // Partition use positions.
+  UsePosition** split_position_it;
   if (split_at_start) {
-    // The split position coincides with the beginning of a use interval (the
-    // end of a lifetime hole). Use at this position should be attributed to
-    // the split child because split child owns use interval covering it.
-    while (use_after != nullptr && use_after->pos() < position) {
-      use_before = use_after;
-      use_after = use_after->next();
-    }
+    // The split position coincides with the beginning of a use interval
+    // (the end of a lifetime hole). Use at this position should be attributed
+    // to the split child because split child owns use interval covering it.
+    split_position_it = std::lower_bound(
+        positions_span_.begin(), positions_span_.end(), position,
+        [](const UsePosition* use_pos, LifetimePosition pos) {
+          return use_pos->pos() < pos;
+        });
   } else {
-    while (use_after != nullptr && use_after->pos() <= position) {
-      use_before = use_after;
-      use_after = use_after->next();
-    }
+    split_position_it = std::lower_bound(
+        positions_span_.begin(), positions_span_.end(), position,
+        [](const UsePosition* use_pos, LifetimePosition pos) {
+          return use_pos->pos() <= pos;
+        });
   }
 
-  // Partition original use positions to the two live ranges.
-  if (use_before != nullptr) {
-    use_before->set_next(nullptr);
-  } else {
-    first_pos_ = nullptr;
+  size_t result_size = std::distance(split_position_it, positions_span_.end());
+  result->positions_span_ = base::VectorOf(split_position_it, result_size);
+  positions_span_.Truncate(positions_span_.size() - result_size);
+
+  // Update or discard cached iteration state to make sure it does not point
+  // to use positions and intervals that no longer belong to this live range.
+  if (current_hint_position_index_ >= positions_span_.size()) {
+    result->current_hint_position_index_ =
+        current_hint_position_index_ - positions_span_.size();
+    current_hint_position_index_ = 0;
   }
-  result->first_pos_ = use_after;
-  result->current_hint_position_ = current_hint_position_;
 
-  // Discard cached iteration state. It might be pointing
-  // to the use that no longer belongs to this live range.
-  last_processed_use_ = nullptr;
-  current_interval_ = nullptr;
+  current_interval_ = intervals_.begin();
+  result->current_interval_ = result->intervals_.begin();
 
-  if (connect_hints == ConnectHints && use_before != nullptr &&
-      use_after != nullptr) {
-    use_after->SetHint(use_before);
-    result->current_hint_position_ = use_after;
-  }
 #ifdef DEBUG
   VerifyChildStructure();
   result->VerifyChildStructure();
 #endif
-  return use_before;
-}
 
-void LiveRange::UpdateParentForAllChildren(TopLevelLiveRange* new_top_level) {
-  LiveRange* child = this;
-  for (; child != nullptr; child = child->next()) {
-    child->top_level_ = new_top_level;
-  }
+  result->top_level_ = TopLevel();
+  result->next_ = next_;
+  next_ = result;
+
+  // Update cache for `TopLevelLiveRange::GetChildCovers()`.
+  auto& children = TopLevel()->children_;
+  children.insert(std::upper_bound(children.begin(), children.end(), result,
+                                   LiveRangeOrdering()),
+                  1, result);
+  return result;
 }
 
 void LiveRange::ConvertUsesToOperand(const InstructionOperand& op,
                                      const InstructionOperand& spill_op) {
-  for (UsePosition* pos = first_pos(); pos != nullptr; pos = pos->next()) {
+  for (UsePosition* pos : positions_span_) {
     DCHECK(Start() <= pos->pos() && pos->pos() <= End());
     if (!pos->HasOperand()) continue;
     switch (pos->type()) {
@@ -683,12 +534,14 @@ bool LiveRange::ShouldBeAllocatedBefore(const LiveRange* other) const {
       return false;
     }
     // Both have the same hint or no hint at all. Use first use position.
-    UsePosition* pos = first_pos();
-    UsePosition* other_pos = other->first_pos();
     // To make the order total, handle the case where both positions are null.
-    if (pos == other_pos) return TopLevel()->vreg() < other->TopLevel()->vreg();
-    if (pos == nullptr) return false;
-    if (other_pos == nullptr) return true;
+    if (positions_span_.empty() && other->positions_span_.empty()) {
+      return TopLevel()->vreg() < other->TopLevel()->vreg();
+    }
+    if (positions_span_.empty()) return false;
+    if (other->positions_span_.empty()) return true;
+    UsePosition* pos = positions_span_.first();
+    UsePosition* other_pos = other->positions_span_.first();
     // To make the order total, handle the case where both positions are equal.
     if (pos->pos() == other_pos->pos())
       return TopLevel()->vreg() < other->TopLevel()->vreg();
@@ -698,7 +551,7 @@ bool LiveRange::ShouldBeAllocatedBefore(const LiveRange* other) const {
 }
 
 void LiveRange::SetUseHints(int register_index) {
-  for (UsePosition* pos = first_pos(); pos != nullptr; pos = pos->next()) {
+  for (UsePosition* pos : positions_span_) {
     if (!pos->HasOperand()) continue;
     switch (pos->type()) {
       case UsePositionType::kRequiresSlot:
@@ -717,55 +570,69 @@ bool LiveRange::CanCover(LifetimePosition position) const {
   return Start() <= position && position < End();
 }
 
-bool LiveRange::Covers(LifetimePosition position) const {
+bool LiveRange::Covers(LifetimePosition position) {
   if (!CanCover(position)) return false;
-  UseInterval* start_search = FirstSearchIntervalForPosition(position);
-  for (UseInterval* interval = start_search; interval != nullptr;
-       interval = interval->next()) {
-    DCHECK(interval->next() == nullptr ||
-           interval->next()->start() >= interval->start());
-    AdvanceLastProcessedMarker(interval, position);
-    if (interval->Contains(position)) return true;
-    if (interval->start() > position) return false;
+  bool covers = false;
+  UseIntervalVector::iterator interval =
+      FirstSearchIntervalForPosition(position);
+  while (interval != intervals().end() && interval->start() <= position) {
+    // The list of `UseInterval`s shall be sorted.
+    DCHECK(interval + 1 == intervals().end() ||
+           interval[1].start() >= interval->start());
+    if (interval->Contains(position)) {
+      covers = true;
+      break;
+    }
+    ++interval;
   }
-  return false;
+  AdvanceLastProcessedMarker(interval, position);
+  return covers;
 }
 
-LifetimePosition LiveRange::NextEndAfter(LifetimePosition position) const {
-  UseInterval* start_search = FirstSearchIntervalForPosition(position);
-  while (start_search->end() < position) {
-    start_search = start_search->next();
-  }
-  return start_search->end();
+LifetimePosition LiveRange::NextEndAfter(LifetimePosition position) {
+  // NOTE: A binary search was measured to be slower, e.g., on the binary from
+  // https://crbug.com/v8/9529.
+  UseIntervalVector::iterator interval = std::find_if(
+      FirstSearchIntervalForPosition(position), intervals_.end(),
+      [=](const UseInterval& interval) { return interval.end() >= position; });
+  DCHECK_NE(interval, intervals().end());
+  return interval->end();
 }
 
 LifetimePosition LiveRange::NextStartAfter(LifetimePosition position) {
-  UseInterval* start_search = FirstSearchIntervalForPosition(position);
-  while (start_search->start() < position) {
-    start_search = start_search->next();
-  }
-  next_start_ = start_search->start();
+  // NOTE: A binary search was measured to be slower, e.g., on the binary from
+  // https://crbug.com/v8/9529.
+  UseIntervalVector::iterator interval =
+      std::find_if(FirstSearchIntervalForPosition(position), intervals_.end(),
+                   [=](const UseInterval& interval) {
+                     return interval.start() >= position;
+                   });
+  DCHECK_NE(interval, intervals().end());
+  next_start_ = interval->start();
   return next_start_;
 }
 
-LifetimePosition LiveRange::FirstIntersection(LiveRange* other) const {
-  UseInterval* b = other->first_interval();
-  if (b == nullptr) return LifetimePosition::Invalid();
+LifetimePosition LiveRange::FirstIntersection(LiveRange* other) {
+  if (IsEmpty() || other->IsEmpty() || other->Start() > End() ||
+      Start() > other->End())
+    return LifetimePosition::Invalid();
+
+  LifetimePosition min_end = std::min(End(), other->End());
+  UseIntervalVector::iterator b = other->intervals_.begin();
   LifetimePosition advance_last_processed_up_to = b->start();
-  UseInterval* a = FirstSearchIntervalForPosition(b->start());
-  while (a != nullptr && b != nullptr) {
-    if (a->start() > other->End()) break;
-    if (b->start() > End()) break;
-    LifetimePosition cur_intersection = a->Intersect(b);
+  UseIntervalVector::iterator a = FirstSearchIntervalForPosition(b->start());
+  while (a != intervals().end() && b != other->intervals().end()) {
+    if (a->start() > min_end || b->start() > min_end) break;
+    LifetimePosition cur_intersection = a->Intersect(*b);
     if (cur_intersection.IsValid()) {
       return cur_intersection;
     }
     if (a->start() < b->start()) {
-      a = a->next();
-      if (a == nullptr || a->start() > other->End()) break;
+      ++a;
+      if (a == intervals().end() || a->start() > other->End()) break;
       AdvanceLastProcessedMarker(a, advance_last_processed_up_to);
     } else {
-      b = b->next();
+      ++b;
     }
   }
   return LifetimePosition::Invalid();
@@ -788,14 +655,16 @@ void LiveRange::Print(bool with_children) const {
 }
 
 bool LiveRange::RegisterFromBundle(int* hint) const {
-  if (bundle_ == nullptr || bundle_->reg() == kUnassignedRegister) return false;
-  *hint = bundle_->reg();
+  LiveRangeBundle* bundle = TopLevel()->get_bundle();
+  if (bundle == nullptr || bundle->reg() == kUnassignedRegister) return false;
+  *hint = bundle->reg();
   return true;
 }
 
 void LiveRange::UpdateBundleRegister(int reg) const {
-  if (bundle_ == nullptr || bundle_->reg() != kUnassignedRegister) return;
-  bundle_->set_reg(reg);
+  LiveRangeBundle* bundle = TopLevel()->get_bundle();
+  if (bundle == nullptr || bundle->reg() != kUnassignedRegister) return;
+  bundle->set_reg(reg);
 }
 
 struct TopLevelLiveRange::SpillMoveInsertionList : ZoneObject {
@@ -807,17 +676,17 @@ struct TopLevelLiveRange::SpillMoveInsertionList : ZoneObject {
   SpillMoveInsertionList* next;
 };
 
-TopLevelLiveRange::TopLevelLiveRange(int vreg, MachineRepresentation rep)
+TopLevelLiveRange::TopLevelLiveRange(int vreg, MachineRepresentation rep,
+                                     Zone* zone)
     : LiveRange(0, rep, this),
       vreg_(vreg),
       last_child_id_(0),
       spill_operand_(nullptr),
       spill_move_insertion_locations_(nullptr),
+      children_({this}, zone),
       spilled_in_deferred_blocks_(false),
       has_preassigned_slot_(false),
-      spill_start_index_(kMaxInt),
-      last_pos_(nullptr),
-      last_child_covers_(this) {
+      spill_start_index_(kMaxInt) {
   bits_ |= SpillTypeField::encode(SpillType::kNoSpillType);
 }
 
@@ -909,36 +778,27 @@ AllocatedOperand TopLevelLiveRange::GetSpillRangeOperand() const {
   return AllocatedOperand(LocationOperand::STACK_SLOT, representation(), index);
 }
 
-void TopLevelLiveRange::VerifyChildrenInOrder() const {
-  LifetimePosition last_end = End();
-  for (const LiveRange* child = this->next(); child != nullptr;
-       child = child->next()) {
-    DCHECK(last_end <= child->Start());
-    last_end = child->End();
-  }
-}
-
 LiveRange* TopLevelLiveRange::GetChildCovers(LifetimePosition pos) {
-  LiveRange* child = last_child_covers_;
-  DCHECK_NE(child, nullptr);
-  if (pos < child->Start()) {
-    // Cached value has advanced too far; start from the top.
-    child = this;
-  }
-  LiveRange* previous_child = nullptr;
-  while (child != nullptr && child->End() <= pos) {
-    previous_child = child;
+#ifdef DEBUG
+  // Make sure the cache contains the correct, actual children.
+  LiveRange* child = this;
+  for (LiveRange* cached_child : children_) {
+    DCHECK_EQ(cached_child, child);
     child = child->next();
   }
+  DCHECK_NULL(child);
+#endif
 
-  // If we've walked past the end, cache the last child instead. This allows
-  // future calls that are also past the end to be fast, since they will know
-  // that there is no need to reset the search to the beginning.
-  last_child_covers_ = child == nullptr ? previous_child : child;
-
-  return !child || !child->Covers(pos) ? nullptr : child;
+  auto child_it =
+      std::lower_bound(children_.begin(), children_.end(), pos,
+                       [](const LiveRange* range, LifetimePosition pos) {
+                         return range->End() <= pos;
+                       });
+  return child_it == children_.end() || !(*child_it)->Covers(pos) ? nullptr
+                                                                  : *child_it;
 }
 
+#ifdef DEBUG
 void TopLevelLiveRange::Verify() const {
   VerifyChildrenInOrder();
   for (const LiveRange* child = this; child != nullptr; child = child->next()) {
@@ -946,105 +806,99 @@ void TopLevelLiveRange::Verify() const {
   }
 }
 
-void TopLevelLiveRange::ShortenTo(LifetimePosition start, bool trace_alloc) {
-  TRACE_COND(trace_alloc, "Shorten live range %d to [%d\n", vreg(),
-             start.value());
-  DCHECK_NOT_NULL(first_interval_);
-  DCHECK(first_interval_->start() <= start);
-  DCHECK(start < first_interval_->end());
-  first_interval_->set_start(start);
+void TopLevelLiveRange::VerifyChildrenInOrder() const {
+  LifetimePosition last_end = End();
+  for (const LiveRange* child = this->next(); child != nullptr;
+       child = child->next()) {
+    DCHECK(last_end <= child->Start());
+    last_end = child->End();
+  }
+}
+#endif
+
+void TopLevelLiveRange::ShortenTo(LifetimePosition start) {
+  TRACE("Shorten live range %d to [%d\n", vreg(), start.value());
+  DCHECK(!IsEmpty());
+  DCHECK_LE(intervals_.front().start(), start);
+  intervals_.front().set_start(start);
+  start_ = start;
 }
 
 void TopLevelLiveRange::EnsureInterval(LifetimePosition start,
-                                       LifetimePosition end, Zone* zone,
-                                       bool trace_alloc) {
-  TRACE_COND(trace_alloc, "Ensure live range %d in interval [%d %d[\n", vreg(),
-             start.value(), end.value());
+                                       LifetimePosition end, Zone* zone) {
+  TRACE("Ensure live range %d in interval [%d %d[\n", vreg(), start.value(),
+        end.value());
+  DCHECK(!IsEmpty());
+
+  // Drop front intervals until intervals_.front().start() > end.
   LifetimePosition new_end = end;
-  while (first_interval_ != nullptr && first_interval_->start() <= end) {
-    if (first_interval_->end() > end) {
-      new_end = first_interval_->end();
+  while (!intervals_.empty() && intervals_.front().start() <= end) {
+    if (intervals_.front().end() > end) {
+      new_end = intervals_.front().end();
     }
-    first_interval_ = first_interval_->next();
+    intervals_.pop_front();
   }
-
-  UseInterval* new_interval = zone->New<UseInterval>(start, new_end);
-  new_interval->set_next(first_interval_);
-  first_interval_ = new_interval;
-  if (new_interval->next() == nullptr) {
-    last_interval_ = new_interval;
+  intervals_.push_front(zone, UseInterval(start, new_end));
+  current_interval_ = intervals_.begin();
+  if (end_ < new_end) {
+    end_ = new_end;
+  }
+  if (start_ > start) {
+    start_ = start;
   }
 }
 
 void TopLevelLiveRange::AddUseInterval(LifetimePosition start,
-                                       LifetimePosition end, Zone* zone,
-                                       bool trace_alloc) {
-  TRACE_COND(trace_alloc, "Add to live range %d interval [%d %d[\n", vreg(),
-             start.value(), end.value());
-  if (first_interval_ == nullptr) {
-    UseInterval* interval = zone->New<UseInterval>(start, end);
-    first_interval_ = interval;
-    last_interval_ = interval;
+                                       LifetimePosition end, Zone* zone) {
+  TRACE("Add to live range %d interval [%d %d[\n", vreg(), start.value(),
+        end.value());
+  if (intervals_.empty()) {
+    intervals_.push_front(zone, UseInterval(start, end));
+    start_ = start;
+    end_ = end;
   } else {
-    if (end == first_interval_->start()) {
-      first_interval_->set_start(start);
-    } else if (end < first_interval_->start()) {
-      UseInterval* interval = zone->New<UseInterval>(start, end);
-      interval->set_next(first_interval_);
-      first_interval_ = interval;
+    UseInterval& first_interval = intervals_.front();
+    if (end == first_interval.start()) {
+      // Coalesce directly adjacent intervals.
+      first_interval.set_start(start);
+      start_ = start;
+    } else if (end < first_interval.start()) {
+      intervals_.push_front(zone, UseInterval(start, end));
+      start_ = start;
     } else {
       // Order of instruction's processing (see ProcessInstructions) guarantees
       // that each new use interval either precedes, intersects with or touches
       // the last added interval.
-      DCHECK(start <= first_interval_->end());
-      first_interval_->set_start(std::min(start, first_interval_->start()));
-      first_interval_->set_end(std::max(end, first_interval_->end()));
+      DCHECK(intervals_.size() == 1 || end <= intervals_.begin()[1].start());
+      first_interval.set_start(std::min(start, first_interval.start()));
+      first_interval.set_end(std::max(end, first_interval.end()));
+      if (start_ > start) {
+        start_ = start;
+      }
+      if (end_ < end) {
+        end_ = end;
+      }
     }
   }
+  current_interval_ = intervals_.begin();
 }
 
-void TopLevelLiveRange::AddUsePosition(UsePosition* use_pos, bool trace_alloc) {
-  LifetimePosition pos = use_pos->pos();
-  TRACE_COND(trace_alloc, "Add to live range %d use position %d\n", vreg(),
-             pos.value());
-  UsePosition* prev_hint = nullptr;
-  UsePosition* prev = nullptr;
-  UsePosition* current = first_pos_;
-  while (current != nullptr && current->pos() < pos) {
-    prev_hint = current->HasHint() ? current : prev_hint;
-    prev = current;
-    current = current->next();
-  }
-
-  if (prev == nullptr) {
-    use_pos->set_next(first_pos_);
-    first_pos_ = use_pos;
-  } else {
-    use_pos->set_next(prev->next());
-    prev->set_next(use_pos);
-  }
+void TopLevelLiveRange::AddUsePosition(UsePosition* use_pos, Zone* zone) {
+  TRACE("Add to live range %d use position %d\n", vreg(),
+        use_pos->pos().value());
+  // Since we `ProcessInstructions` in reverse, the `use_pos` is almost always
+  // inserted at the front of `positions_`, hence (i) use linear instead of
+  // binary search and (ii) grow towards the `kFront` exclusively on `insert`.
+  UsePositionVector::iterator insert_it = std::find_if(
+      positions_.begin(), positions_.end(), [=](const UsePosition* pos) {
+        return UsePosition::Ordering()(use_pos, pos);
+      });
+  positions_.insert<kFront>(zone, insert_it, use_pos);
 
-  if (prev_hint == nullptr && use_pos->HasHint()) {
-    current_hint_position_ = use_pos;
-  }
-}
-
-static bool AreUseIntervalsIntersecting(UseInterval* interval1,
-                                        UseInterval* interval2) {
-  while (interval1 != nullptr && interval2 != nullptr) {
-    if (interval1->start() < interval2->start()) {
-      if (interval1->end() > interval2->start()) {
-        return true;
-      }
-      interval1 = interval1->next();
-    } else {
-      if (interval2->end() > interval1->start()) {
-        return true;
-      }
-      interval2 = interval2->next();
-    }
-  }
-  return false;
+  positions_span_ = base::VectorOf(positions_);
+  // We must not have child `LiveRange`s yet (e.g. from splitting), otherwise we
+  // would have to adjust their `positions_span_` as well.
+  DCHECK_NULL(next_);
 }
 
 std::ostream& operator<<(std::ostream& os,
@@ -1056,20 +910,16 @@ std::ostream& operator<<(std::ostream& os,
   if (range->TopLevel()->is_non_loop_phi()) os << "nlphi ";
 
   os << "{" << std::endl;
-  UseInterval* interval = range->first_interval();
-  UsePosition* use_pos = range->first_pos();
-  while (use_pos != nullptr) {
+  for (UsePosition* use_pos : range->positions()) {
     if (use_pos->HasOperand()) {
       os << *use_pos->operand() << use_pos->pos() << " ";
     }
-    use_pos = use_pos->next();
   }
   os << std::endl;
 
-  while (interval != nullptr) {
-    os << '[' << interval->start() << ", " << interval->end() << ')'
-       << std::endl;
-    interval = interval->next();
+  for (const UseInterval& interval : range->intervals()) {
+    interval.PrettyPrint(os);
+    os << std::endl;
   }
   os << "}";
   return os;
@@ -1123,10 +973,9 @@ void LinearScanAllocator::PrintRangeRow(std::ostream& os,
 
   for (const LiveRange* range = toplevel; range != nullptr;
        range = range->next()) {
-    for (UseInterval* interval = range->first_interval(); interval != nullptr;
-         interval = interval->next()) {
-      LifetimePosition start = interval->start();
-      LifetimePosition end = interval->end();
+    for (const UseInterval& interval : range->intervals()) {
+      LifetimePosition start = interval.start();
+      LifetimePosition end = interval.end();
       CHECK_GE(start.value(), position);
       for (; start.value() > position; position++) {
         os << ' ';
@@ -1171,101 +1020,120 @@ void LinearScanAllocator::PrintRangeOverview() {
 }
 
 SpillRange::SpillRange(TopLevelLiveRange* parent, Zone* zone)
-    : live_ranges_(zone),
+    : ranges_(zone),
+      intervals_(zone),
       assigned_slot_(kUnassignedSlot),
       byte_width_(ByteWidthForStackSlot(parent->representation())) {
+  DCHECK(!parent->IsEmpty());
+
   // Spill ranges are created for top level. This is so that, when merging
   // decisions are made, we consider the full extent of the virtual register,
   // and avoid clobbering it.
-  UseInterval* result = nullptr;
-  UseInterval* node = nullptr;
-  // Copy the intervals for all ranges.
-  for (LiveRange* range = parent; range != nullptr; range = range->next()) {
-    UseInterval* src = range->first_interval();
-    while (src != nullptr) {
-      UseInterval* new_node = zone->New<UseInterval>(src->start(), src->end());
-      if (result == nullptr) {
-        result = new_node;
+  LifetimePosition last_end = LifetimePosition::MaxPosition();
+  for (const LiveRange* range = parent; range != nullptr;
+       range = range->next()) {
+    // Deep copy the `UseInterval`s, since the `LiveRange`s are subsequently
+    // modified, so just storing those has correctness issues.
+    for (UseInterval interval : range->intervals()) {
+      DCHECK_NE(LifetimePosition::MaxPosition(), interval.start());
+      bool can_coalesce = last_end == interval.start();
+      if (can_coalesce) {
+        intervals_.back().set_end(interval.end());
       } else {
-        node->set_next(new_node);
+        intervals_.push_back(interval);
       }
-      node = new_node;
-      src = src->next();
+      last_end = interval.end();
     }
   }
-  use_interval_ = result;
-  live_ranges().push_back(parent);
-  end_position_ = node->end();
+  ranges_.push_back(parent);
   parent->SetSpillRange(this);
 }
 
-bool SpillRange::IsIntersectingWith(SpillRange* other) const {
-  if (this->use_interval_ == nullptr || other->use_interval_ == nullptr ||
-      this->End() <= other->use_interval_->start() ||
-      other->End() <= this->use_interval_->start()) {
-    return false;
+// Checks if the `UseInterval`s in `a` intersect with those in `b`.
+// Returns the two intervals that intersected, or `std::nullopt` if none did.
+static base::Optional<std::pair<UseInterval, UseInterval>>
+AreUseIntervalsIntersectingVector(base::Vector<const UseInterval> a,
+                                  base::Vector<const UseInterval> b) {
+  SLOW_DCHECK(std::is_sorted(a.begin(), a.end()) &&
+              std::is_sorted(b.begin(), b.end()));
+  if (a.empty() || b.empty() || a.last().end() <= b.first().start() ||
+      b.last().end() <= a.first().start()) {
+    return {};
+  }
+
+  // `a` shall have less intervals then `b`.
+  if (a.size() > b.size()) {
+    std::swap(a, b);
+  }
+
+  auto a_it = a.begin();
+  // Advance `b` already to the interval that ends at or after `a_start`.
+  LifetimePosition a_start = a.first().start();
+  auto b_it = std::lower_bound(
+      b.begin(), b.end(), a_start,
+      [](const UseInterval& interval, LifetimePosition position) {
+        return interval.end() < position;
+      });
+  while (a_it != a.end() && b_it != b.end()) {
+    if (a_it->end() <= b_it->start()) {
+      ++a_it;
+    } else if (b_it->end() <= a_it->start()) {
+      ++b_it;
+    } else {
+      return std::make_pair(*a_it, *b_it);
+    }
   }
-  return AreUseIntervalsIntersecting(use_interval_, other->use_interval_);
+  return {};
+}
+
+// Used by `LiveRangeBundle`s and `SpillRange`s, hence allow passing different
+// containers of `UseInterval`s, as long as they can be converted to a
+// `base::Vector` (which is essentially just a memory span).
+template <typename ContainerA, typename ContainerB>
+base::Optional<std::pair<UseInterval, UseInterval>> AreUseIntervalsIntersecting(
+    const ContainerA& a, const ContainerB& b) {
+  return AreUseIntervalsIntersectingVector(base::VectorOf(a),
+                                           base::VectorOf(b));
 }
 
 bool SpillRange::TryMerge(SpillRange* other) {
   if (HasSlot() || other->HasSlot()) return false;
-  if (byte_width() != other->byte_width() || IsIntersectingWith(other))
-    return false;
-
-  LifetimePosition max = LifetimePosition::MaxPosition();
-  if (End() < other->End() && other->End() != max) {
-    end_position_ = other->End();
-  }
-  other->end_position_ = max;
-
-  MergeDisjointIntervals(other->use_interval_);
-  other->use_interval_ = nullptr;
-
-  for (TopLevelLiveRange* range : other->live_ranges()) {
+  if (byte_width() != other->byte_width()) return false;
+  if (AreUseIntervalsIntersecting(intervals_, other->intervals_)) return false;
+
+  // Merge vectors of `UseInterval`s.
+  intervals_.reserve(intervals_.size() + other->intervals_.size());
+  for (UseInterval interval : other->intervals_) {
+    UseInterval* insert_it =
+        std::lower_bound(intervals_.begin(), intervals_.end(), interval);
+    // Since the intervals didn't intersect, they should also be unique.
+    DCHECK_IMPLIES(insert_it != intervals_.end(), *insert_it != interval);
+    intervals_.insert(insert_it, 1, interval);
+  }
+  other->intervals_.clear();
+
+  // Merge vectors of `TopLevelLiveRange`s.
+  for (TopLevelLiveRange* range : other->ranges_) {
     DCHECK(range->GetSpillRange() == other);
     range->SetSpillRange(this);
   }
-
-  live_ranges().insert(live_ranges().end(), other->live_ranges().begin(),
-                       other->live_ranges().end());
-  other->live_ranges().clear();
+  ranges_.insert(ranges_.end(), other->ranges_.begin(), other->ranges_.end());
+  other->ranges_.clear();
 
   return true;
 }
 
-void SpillRange::MergeDisjointIntervals(UseInterval* other) {
-  UseInterval* tail = nullptr;
-  UseInterval* current = use_interval_;
-  while (other != nullptr) {
-    // Make sure the 'current' list starts first
-    if (current == nullptr || current->start() > other->start()) {
-      std::swap(current, other);
-    }
-    // Check disjointness
-    DCHECK(other == nullptr || current->end() <= other->start());
-    // Append the 'current' node to the result accumulator and move forward
-    if (tail == nullptr) {
-      use_interval_ = current;
-    } else {
-      tail->set_next(current);
-    }
-    tail = current;
-    current = current->next();
-  }
-  // Other list is empty => we are done
-}
-
 void SpillRange::Print() const {
   StdoutStream os;
   os << "{" << std::endl;
-  for (TopLevelLiveRange* range : live_ranges()) {
+  for (const TopLevelLiveRange* range : ranges_) {
     os << range->vreg() << " ";
   }
   os << std::endl;
 
-  for (UseInterval* i = interval(); i != nullptr; i = i->next()) {
-    os << '[' << i->start() << ", " << i->end() << ')' << std::endl;
+  for (const UseInterval& interval : intervals_) {
+    interval.PrettyPrint(os);
+    os << std::endl;
   }
   os << "}" << std::endl;
 }
@@ -1293,8 +1161,8 @@ void TopTierRegisterAllocationData::PhiMapValue::CommitAssignment(
 
 TopTierRegisterAllocationData::TopTierRegisterAllocationData(
     const RegisterConfiguration* config, Zone* zone, Frame* frame,
-    InstructionSequence* code, RegisterAllocationFlags flags,
-    TickCounter* tick_counter, const char* debug_name)
+    InstructionSequence* code, TickCounter* tick_counter,
+    const char* debug_name)
     : RegisterAllocationData(Type::kTopTier),
       allocation_zone_(zone),
       frame_(frame),
@@ -1304,8 +1172,7 @@ TopTierRegisterAllocationData::TopTierRegisterAllocationData(
       phi_map_(allocation_zone()),
       live_in_sets_(code->InstructionBlockCount(), nullptr, allocation_zone()),
       live_out_sets_(code->InstructionBlockCount(), nullptr, allocation_zone()),
-      live_ranges_(code->VirtualRegisterCount() * 2, nullptr,
-                   allocation_zone()),
+      live_ranges_(code->VirtualRegisterCount(), nullptr, allocation_zone()),
       fixed_live_ranges_(kNumberOfFixedRangesPerRegister *
                              this->config()->num_general_registers(),
                          nullptr, allocation_zone()),
@@ -1314,7 +1181,6 @@ TopTierRegisterAllocationData::TopTierRegisterAllocationData(
                                     this->config()->num_double_registers(),
                                 nullptr, allocation_zone()),
       fixed_simd128_live_ranges_(allocation_zone()),
-      spill_ranges_(code->VirtualRegisterCount(), nullptr, allocation_zone()),
       delayed_references_(allocation_zone()),
       assigned_registers_(nullptr),
       assigned_double_registers_(nullptr),
@@ -1322,7 +1188,6 @@ TopTierRegisterAllocationData::TopTierRegisterAllocationData(
       preassigned_slot_ranges_(zone),
       spill_state_(code->InstructionBlockCount(), ZoneVector<LiveRange*>(zone),
                    zone),
-      flags_(flags),
       tick_counter_(tick_counter),
       slot_for_const_range_(zone) {
   if (kFPAliasing == AliasingKind::kCombine) {
@@ -1340,6 +1205,12 @@ TopTierRegisterAllocationData::TopTierRegisterAllocationData(
         nullptr);
   }
 
+  // Eagerly initialize live ranges to avoid repeated null checks.
+  DCHECK_EQ(code->VirtualRegisterCount(), live_ranges_.size());
+  for (int i = 0; i < code->VirtualRegisterCount(); ++i) {
+    live_ranges_[i] = NewLiveRange(i, RepresentationFor(i));
+  }
+
   assigned_registers_ = code_zone()->New<BitVector>(
       this->config()->num_general_registers(), code_zone());
   assigned_double_registers_ = code_zone()->New<BitVector>(
@@ -1373,23 +1244,17 @@ MachineRepresentation TopTierRegisterAllocationData::RepresentationFor(
   return code()->GetRepresentation(virtual_register);
 }
 
-TopLevelLiveRange* TopTierRegisterAllocationData::GetOrCreateLiveRangeFor(
-    int index) {
-  if (index >= static_cast<int>(live_ranges().size())) {
-    live_ranges().resize(index + 1, nullptr);
-  }
+TopLevelLiveRange* TopTierRegisterAllocationData::GetLiveRangeFor(int index) {
   TopLevelLiveRange* result = live_ranges()[index];
-  if (result == nullptr) {
-    result = NewLiveRange(index, RepresentationFor(index));
-    live_ranges()[index] = result;
-  }
+  DCHECK_NOT_NULL(result);
   DCHECK_EQ(live_ranges()[index]->vreg(), index);
   return result;
 }
 
 TopLevelLiveRange* TopTierRegisterAllocationData::NewLiveRange(
     int index, MachineRepresentation rep) {
-  return allocation_zone()->New<TopLevelLiveRange>(index, rep);
+  return allocation_zone()->New<TopLevelLiveRange>(index, rep,
+                                                   allocation_zone());
 }
 
 TopTierRegisterAllocationData::PhiMapValue*
@@ -1423,10 +1288,10 @@ bool TopTierRegisterAllocationData::ExistsUseWithoutDefinition() {
     found = true;
     PrintF("Register allocator error: live v%d reached first block.\n",
            operand_index);
-    LiveRange* range = GetOrCreateLiveRangeFor(operand_index);
+    LiveRange* range = GetLiveRangeFor(operand_index);
     PrintF("  (first use is at position %d in instruction %d)\n",
-           range->first_pos()->pos().value(),
-           range->first_pos()->pos().ToInstructionIndex());
+           range->positions().first()->pos().value(),
+           range->positions().first()->pos().ToInstructionIndex());
     if (debug_name() == nullptr) {
       PrintF("\n");
     } else {
@@ -1449,16 +1314,16 @@ bool TopTierRegisterAllocationData::RangesDefinedInDeferredStayInDeferred() {
   for (const TopLevelLiveRange* range : live_ranges()) {
     CHECK_EQ(live_ranges_size,
              live_ranges().size());  // TODO(neis): crbug.com/831822
-    if (range == nullptr || range->IsEmpty() ||
+    DCHECK_NOT_NULL(range);
+    if (range->IsEmpty() ||
         !code()
              ->GetInstructionBlock(range->Start().ToInstructionIndex())
              ->IsDeferred()) {
       continue;
     }
-    for (const UseInterval* i = range->first_interval(); i != nullptr;
-         i = i->next()) {
-      int first = i->FirstGapIndex();
-      int last = i->LastGapIndex();
+    for (const UseInterval& interval : range->intervals()) {
+      int first = interval.FirstGapIndex();
+      int last = interval.LastGapIndex();
       for (int instr = first; instr <= last;) {
         const InstructionBlock* block = code()->GetInstructionBlock(instr);
         if (!block->IsDeferred()) return false;
@@ -1485,7 +1350,6 @@ SpillRange* TopTierRegisterAllocationData::AssignSpillRangeToLiveRange(
     range->set_spill_type(SpillType::kSpillRange);
   }
 
-  spill_ranges()[range->vreg()] = spill_range;
   return spill_range;
 }
 
@@ -1675,7 +1539,7 @@ void ConstraintBuilder::MeetRegisterConstraintsForLastInstructionInBlock(
     DCHECK(!output_operand->IsConstant());
     UnallocatedOperand* output = UnallocatedOperand::cast(output_operand);
     int output_vreg = output->virtual_register();
-    TopLevelLiveRange* range = data()->GetOrCreateLiveRangeFor(output_vreg);
+    TopLevelLiveRange* range = data()->GetLiveRangeFor(output_vreg);
     bool assigned = false;
     if (output->HasFixedPolicy()) {
       AllocateFixed(output, -1, false, false);
@@ -1724,14 +1588,14 @@ void ConstraintBuilder::MeetConstraintsAfter(int instr_index) {
     InstructionOperand* output = first->OutputAt(i);
     if (output->IsConstant()) {
       int output_vreg = ConstantOperand::cast(output)->virtual_register();
-      TopLevelLiveRange* range = data()->GetOrCreateLiveRangeFor(output_vreg);
+      TopLevelLiveRange* range = data()->GetLiveRangeFor(output_vreg);
       range->SetSpillStartIndex(instr_index + 1);
       range->SetSpillOperand(output);
       continue;
     }
     UnallocatedOperand* first_output = UnallocatedOperand::cast(output);
     TopLevelLiveRange* range =
-        data()->GetOrCreateLiveRangeFor(first_output->virtual_register());
+        data()->GetLiveRangeFor(first_output->virtual_register());
     bool assigned = false;
     if (first_output->HasFixedPolicy()) {
       int output_vreg = first_output->virtual_register();
@@ -1778,7 +1642,7 @@ void ConstraintBuilder::MeetConstraintsBefore(int instr_index) {
     UnallocatedOperand* cur_input = UnallocatedOperand::cast(input);
     if (cur_input->HasSlotPolicy()) {
       TopLevelLiveRange* range =
-          data()->GetOrCreateLiveRangeFor(cur_input->virtual_register());
+          data()->GetLiveRangeFor(cur_input->virtual_register());
       if (range->HasSpillOperand() && range->GetSpillOperand()->IsConstant()) {
         bool already_spilled = false;
         if (spilled_consts == nullptr) {
@@ -1875,7 +1739,7 @@ void ConstraintBuilder::ResolvePhis(const InstructionBlock* block) {
                   ->InstructionAt(cur_block->last_instruction_index())
                   ->HasReferenceMap());
     }
-    TopLevelLiveRange* live_range = data()->GetOrCreateLiveRangeFor(phi_vreg);
+    TopLevelLiveRange* live_range = data()->GetLiveRangeFor(phi_vreg);
     int gap_index = block->first_instruction_index();
     live_range->RecordSpillLocation(allocation_zone(), gap_index, &output);
     live_range->SetSpillStartIndex(gap_index);
@@ -1932,9 +1796,8 @@ void LiveRangeBuilder::AddInitialIntervals(const InstructionBlock* block,
                              block->last_instruction_index())
                              .NextStart();
   for (int operand_index : *live_out) {
-    TopLevelLiveRange* range = data()->GetOrCreateLiveRangeFor(operand_index);
-    range->AddUseInterval(start, end, allocation_zone(),
-                          data()->is_trace_alloc());
+    TopLevelLiveRange* range = data()->GetLiveRangeFor(operand_index);
+    range->AddUseInterval(start, end, allocation_zone());
   }
 }
 
@@ -2051,10 +1914,10 @@ TopLevelLiveRange* LiveRangeBuilder::FixedSIMD128LiveRangeFor(
 TopLevelLiveRange* LiveRangeBuilder::LiveRangeFor(InstructionOperand* operand,
                                                   SpillMode spill_mode) {
   if (operand->IsUnallocated()) {
-    return data()->GetOrCreateLiveRangeFor(
+    return data()->GetLiveRangeFor(
         UnallocatedOperand::cast(operand)->virtual_register());
   } else if (operand->IsConstant()) {
-    return data()->GetOrCreateLiveRangeFor(
+    return data()->GetLiveRangeFor(
         ConstantOperand::cast(operand)->virtual_register());
   } else if (operand->IsRegister()) {
     return FixedLiveRangeFor(
@@ -2088,18 +1951,17 @@ UsePosition* LiveRangeBuilder::Define(LifetimePosition position,
 
   if (range->IsEmpty() || range->Start() > position) {
     // Can happen if there is a definition without use.
-    range->AddUseInterval(position, position.NextStart(), allocation_zone(),
-                          data()->is_trace_alloc());
+    range->AddUseInterval(position, position.NextStart(), allocation_zone());
     range->AddUsePosition(NewUsePosition(position.NextStart()),
-                          data()->is_trace_alloc());
+                          allocation_zone());
   } else {
-    range->ShortenTo(position, data()->is_trace_alloc());
+    range->ShortenTo(position);
   }
   if (!operand->IsUnallocated()) return nullptr;
   UnallocatedOperand* unalloc_operand = UnallocatedOperand::cast(operand);
   UsePosition* use_pos =
       NewUsePosition(position, unalloc_operand, hint, hint_type);
-  range->AddUsePosition(use_pos, data()->is_trace_alloc());
+  range->AddUsePosition(use_pos, allocation_zone());
   return use_pos;
 }
 
@@ -2114,10 +1976,9 @@ UsePosition* LiveRangeBuilder::Use(LifetimePosition block_start,
   if (operand->IsUnallocated()) {
     UnallocatedOperand* unalloc_operand = UnallocatedOperand::cast(operand);
     use_pos = NewUsePosition(position, unalloc_operand, hint, hint_type);
-    range->AddUsePosition(use_pos, data()->is_trace_alloc());
+    range->AddUsePosition(use_pos, allocation_zone());
   }
-  range->AddUseInterval(block_start, position, allocation_zone(),
-                        data()->is_trace_alloc());
+  range->AddUseInterval(block_start, position, allocation_zone());
   return use_pos;
 }
 
@@ -2181,7 +2042,7 @@ void LiveRangeBuilder::ProcessInstructions(const InstructionBlock* block,
         int code = config()->GetAllocatableGeneralCode(i);
         TopLevelLiveRange* range = FixedLiveRangeFor(code, spill_mode);
         range->AddUseInterval(curr_position, curr_position.End(),
-                              allocation_zone(), data()->is_trace_alloc());
+                              allocation_zone());
       }
     }
 
@@ -2193,7 +2054,7 @@ void LiveRangeBuilder::ProcessInstructions(const InstructionBlock* block,
         TopLevelLiveRange* range = FixedFPLiveRangeFor(
             code, MachineRepresentation::kFloat64, spill_mode);
         range->AddUseInterval(curr_position, curr_position.End(),
-                              allocation_zone(), data()->is_trace_alloc());
+                              allocation_zone());
       }
       // Clobber fixed float registers on archs with non-simple aliasing.
       if (kFPAliasing == AliasingKind::kCombine) {
@@ -2206,7 +2067,7 @@ void LiveRangeBuilder::ProcessInstructions(const InstructionBlock* block,
             TopLevelLiveRange* range = FixedFPLiveRangeFor(
                 code, MachineRepresentation::kFloat32, spill_mode);
             range->AddUseInterval(curr_position, curr_position.End(),
-                                  allocation_zone(), data()->is_trace_alloc());
+                                  allocation_zone());
           }
         }
         if (fixed_simd128_live_ranges) {
@@ -2216,7 +2077,7 @@ void LiveRangeBuilder::ProcessInstructions(const InstructionBlock* block,
             TopLevelLiveRange* range = FixedFPLiveRangeFor(
                 code, MachineRepresentation::kSimd128, spill_mode);
             range->AddUseInterval(curr_position, curr_position.End(),
-                                  allocation_zone(), data()->is_trace_alloc());
+                                  allocation_zone());
           }
         }
       } else if (kFPAliasing == AliasingKind::kIndependent) {
@@ -2227,7 +2088,7 @@ void LiveRangeBuilder::ProcessInstructions(const InstructionBlock* block,
             TopLevelLiveRange* range =
                 FixedSIMD128LiveRangeFor(code, spill_mode);
             range->AddUseInterval(curr_position, curr_position.End(),
-                                  allocation_zone(), data()->is_trace_alloc());
+                                  allocation_zone());
           }
         }
       }
@@ -2251,7 +2112,7 @@ void LiveRangeBuilder::ProcessInstructions(const InstructionBlock* block,
         int vreg = unalloc->virtual_register();
         live->Add(vreg);
         if (unalloc->HasSlotPolicy()) {
-          data()->GetOrCreateLiveRangeFor(vreg)->register_slot_use(
+          data()->GetLiveRangeFor(vreg)->register_slot_use(
               block->IsDeferred()
                   ? TopLevelLiveRange::SlotUseKind::kDeferredSlotUse
                   : TopLevelLiveRange::SlotUseKind::kGeneralSlotUse);
@@ -2300,8 +2161,7 @@ void LiveRangeBuilder::ProcessInstructions(const InstructionBlock* block,
         int phi_vreg = -1;
         if (to.IsUnallocated()) {
           int to_vreg = UnallocatedOperand::cast(to).virtual_register();
-          TopLevelLiveRange* to_range =
-              data()->GetOrCreateLiveRangeFor(to_vreg);
+          TopLevelLiveRange* to_range = data()->GetLiveRangeFor(to_vreg);
           if (to_range->is_phi()) {
             phi_vreg = to_vreg;
             if (to_range->is_non_loop_phi()) {
@@ -2488,9 +2348,8 @@ void LiveRangeBuilder::ProcessLoopHeader(const InstructionBlock* block,
                              code()->LastLoopInstructionIndex(block))
                              .NextFullStart();
   for (int operand_index : *live) {
-    TopLevelLiveRange* range = data()->GetOrCreateLiveRangeFor(operand_index);
-    range->EnsureInterval(start, end, allocation_zone(),
-                          data()->is_trace_alloc());
+    TopLevelLiveRange* range = data()->GetLiveRangeFor(operand_index);
+    range->EnsureInterval(start, end, allocation_zone());
   }
   // Insert all values into the live in sets of all blocks in the loop.
   for (int i = block->rpo_number().ToInt() + 1; i < block->loop_end().ToInt();
@@ -2526,7 +2385,7 @@ void LiveRangeBuilder::BuildLiveRanges() {
     data_->tick_counter()->TickAndMaybeEnterSafepoint();
     CHECK_EQ(live_ranges_size,
              data()->live_ranges().size());  // TODO(neis): crbug.com/831822
-    if (range == nullptr) continue;
+    DCHECK_NOT_NULL(range);
     // Give slots to all ranges with a non fixed slot use.
     if (range->has_slot_use() && range->HasNoSpillType()) {
       SpillMode spill_mode =
@@ -2541,8 +2400,7 @@ void LiveRangeBuilder::BuildLiveRanges() {
     // Without this hack, all uses with "any" policy would get the constant
     // operand assigned.
     if (range->HasSpillOperand() && range->GetSpillOperand()->IsConstant()) {
-      for (UsePosition* pos = range->first_pos(); pos != nullptr;
-           pos = pos->next()) {
+      for (UsePosition* pos : range->positions()) {
         if (pos->type() == UsePositionType::kRequiresSlot ||
             pos->type() == UsePositionType::kRegisterOrSlotOrConstant) {
           continue;
@@ -2587,37 +2445,42 @@ void LiveRangeBuilder::ResolvePhiHint(InstructionOperand* operand,
   it->second->ResolveHint(use_pos);
 }
 
+#ifdef DEBUG
 void LiveRangeBuilder::Verify() const {
   for (auto& hint : phi_hints_) {
-    CHECK(hint.second->IsResolved());
+    DCHECK(hint.second->IsResolved());
   }
-  for (const TopLevelLiveRange* current : data()->live_ranges()) {
-    if (current != nullptr && !current->IsEmpty()) {
+  for (TopLevelLiveRange* current : data()->live_ranges()) {
+    DCHECK_NOT_NULL(current);
+    if (!current->IsEmpty()) {
       // New LiveRanges should not be split.
-      CHECK_NULL(current->next());
+      DCHECK_NULL(current->next());
       // General integrity check.
       current->Verify();
-      const UseInterval* first = current->first_interval();
-      if (first->next() == nullptr) continue;
+      if (current->intervals().size() < 2) continue;
 
       // Consecutive intervals should not end and start in the same block,
       // otherwise the intervals should have been joined, because the
       // variable is live throughout that block.
-      CHECK(NextIntervalStartsInDifferentBlocks(first));
+      UseIntervalVector::const_iterator interval = current->intervals().begin();
+      UseIntervalVector::const_iterator next_interval = interval + 1;
+      DCHECK(NextIntervalStartsInDifferentBlocks(*interval, *next_interval));
 
-      for (const UseInterval* i = first->next(); i != nullptr; i = i->next()) {
+      for (++interval; interval != current->intervals().end(); ++interval) {
         // Except for the first interval, the other intevals must start at
         // a block boundary, otherwise data wouldn't flow to them.
         // You might trigger this CHECK if your SSA is not valid. For instance,
         // if the inputs of a Phi node are in the wrong order.
-        CHECK(IntervalStartsAtBlockBoundary(i));
+        DCHECK(IntervalStartsAtBlockBoundary(*interval));
         // The last instruction of the predecessors of the block the interval
         // starts must be covered by the range.
-        CHECK(IntervalPredecessorsCoveredByRange(i, current));
-        if (i->next() != nullptr) {
+        DCHECK(IntervalPredecessorsCoveredByRange(*interval, current));
+        next_interval = interval + 1;
+        if (next_interval != current->intervals().end()) {
           // Check the consecutive intervals property, except for the last
           // interval, where it doesn't apply.
-          CHECK(NextIntervalStartsInDifferentBlocks(i));
+          DCHECK(
+              NextIntervalStartsInDifferentBlocks(*interval, *next_interval));
         }
       }
     }
@@ -2625,8 +2488,8 @@ void LiveRangeBuilder::Verify() const {
 }
 
 bool LiveRangeBuilder::IntervalStartsAtBlockBoundary(
-    const UseInterval* interval) const {
-  LifetimePosition start = interval->start();
+    UseInterval interval) const {
+  LifetimePosition start = interval.start();
   if (!start.IsFullStart()) return false;
   int instruction_index = start.ToInstructionIndex();
   const InstructionBlock* block =
@@ -2635,8 +2498,8 @@ bool LiveRangeBuilder::IntervalStartsAtBlockBoundary(
 }
 
 bool LiveRangeBuilder::IntervalPredecessorsCoveredByRange(
-    const UseInterval* interval, const TopLevelLiveRange* range) const {
-  LifetimePosition start = interval->start();
+    UseInterval interval, TopLevelLiveRange* range) const {
+  LifetimePosition start = interval.start();
   int instruction_index = start.ToInstructionIndex();
   const InstructionBlock* block =
       data()->code()->GetInstructionBlock(instruction_index);
@@ -2652,10 +2515,9 @@ bool LiveRangeBuilder::IntervalPredecessorsCoveredByRange(
 }
 
 bool LiveRangeBuilder::NextIntervalStartsInDifferentBlocks(
-    const UseInterval* interval) const {
-  DCHECK_NOT_NULL(interval->next());
-  LifetimePosition end = interval->end();
-  LifetimePosition next_start = interval->next()->start();
+    UseInterval interval, UseInterval next) const {
+  LifetimePosition end = interval.end();
+  LifetimePosition next_start = next.start();
   // Since end is not covered, but the previous position is, move back a
   // position
   end = end.IsStart() ? end.PrevStart().End() : end.Start();
@@ -2666,6 +2528,7 @@ bool LiveRangeBuilder::NextIntervalStartsInDifferentBlocks(
       data()->code()->GetInstructionBlock(next_start.ToInstructionIndex());
   return block->rpo_number() < next_block->rpo_number();
 }
+#endif
 
 void BundleBuilder::BuildBundles() {
   TRACE("Build bundles\n");
@@ -2676,8 +2539,8 @@ void BundleBuilder::BuildBundles() {
         code()->InstructionBlockAt(RpoNumber::FromInt(block_id));
     TRACE("Block B%d\n", block_id);
     for (auto phi : block->phis()) {
-      LiveRange* out_range =
-          data()->GetOrCreateLiveRangeFor(phi->virtual_register());
+      TopLevelLiveRange* out_range =
+          data()->GetLiveRangeFor(phi->virtual_register());
       LiveRangeBundle* out = out_range->get_bundle();
       if (out == nullptr) {
         out = data()->allocation_zone()->New<LiveRangeBundle>(
@@ -2688,14 +2551,14 @@ void BundleBuilder::BuildBundles() {
             out_range->TopLevel()->vreg(), out_range->relative_id());
       bool phi_interferes_with_backedge_input = false;
       for (auto input : phi->operands()) {
-        LiveRange* input_range = data()->GetOrCreateLiveRangeFor(input);
+        TopLevelLiveRange* input_range = data()->GetLiveRangeFor(input);
         TRACE("Input value v%d with range %d:%d\n", input,
               input_range->TopLevel()->vreg(), input_range->relative_id());
         LiveRangeBundle* input_bundle = input_range->get_bundle();
         if (input_bundle != nullptr) {
           TRACE("Merge\n");
-          LiveRangeBundle* merged = LiveRangeBundle::TryMerge(
-              out, input_bundle, data()->is_trace_alloc());
+          LiveRangeBundle* merged =
+              LiveRangeBundle::TryMerge(out, input_bundle);
           if (merged != nullptr) {
             DCHECK_EQ(out_range->get_bundle(), merged);
             DCHECK_EQ(input_range->get_bundle(), merged);
@@ -2730,52 +2593,68 @@ void BundleBuilder::BuildBundles() {
   }
 }
 
-bool LiveRangeBundle::TryAddRange(LiveRange* range) {
+bool LiveRangeBundle::TryAddRange(TopLevelLiveRange* range) {
   DCHECK_NULL(range->get_bundle());
   // We may only add a new live range if its use intervals do not
   // overlap with existing intervals in the bundle.
-  if (UsesOverlap(range->first_interval())) return false;
-  ranges_.insert(range);
-  range->set_bundle(this);
-  InsertUses(range->first_interval());
+  if (AreUseIntervalsIntersecting(this->intervals_, range->intervals()))
+    return false;
+  AddRange(range);
   return true;
 }
 
+void LiveRangeBundle::AddRange(TopLevelLiveRange* range) {
+  TopLevelLiveRange** insert_it = std::lower_bound(
+      ranges_.begin(), ranges_.end(), range, LiveRangeOrdering());
+  DCHECK_IMPLIES(insert_it != ranges_.end(), *insert_it != range);
+  // TODO(dlehmann): We might save some memory by using
+  // `DoubleEndedSplitVector::insert<kFront>()` here: Since we add ranges
+  // mostly backwards, ranges with an earlier `Start()` are inserted mostly
+  // at the front.
+  ranges_.insert(insert_it, 1, range);
+  range->set_bundle(this);
+
+  // We also tried `std::merge`ing the sorted vectors of `intervals_` directly,
+  // but it turns out the (always happening) copies are more expensive
+  // than the (apparently seldom) copies due to insertion in the middle.
+  for (UseInterval interval : range->intervals()) {
+    UseInterval* insert_it =
+        std::lower_bound(intervals_.begin(), intervals_.end(), interval);
+    DCHECK_IMPLIES(insert_it != intervals_.end(), *insert_it != interval);
+    intervals_.insert(insert_it, 1, interval);
+  }
+}
+
 LiveRangeBundle* LiveRangeBundle::TryMerge(LiveRangeBundle* lhs,
-                                           LiveRangeBundle* rhs,
-                                           bool trace_alloc) {
+                                           LiveRangeBundle* rhs) {
   if (rhs == lhs) return lhs;
 
-  auto iter1 = lhs->uses_.begin();
-  auto iter2 = rhs->uses_.begin();
-
-  while (iter1 != lhs->uses_.end() && iter2 != rhs->uses_.end()) {
-    if (iter1->start >= iter2->end) {
-      ++iter2;
-    } else if (iter2->start >= iter1->end) {
-      ++iter1;
-    } else {
-      TRACE_COND(trace_alloc, "No merge %d:%d %d:%d\n", iter1->start,
-                 iter1->end, iter2->start, iter2->end);
-      return nullptr;
-    }
+  if (auto found =
+          AreUseIntervalsIntersecting(lhs->intervals_, rhs->intervals_)) {
+    auto [interval1, interval2] = *found;
+    TRACE("No merge %d:%d %d:%d\n", interval1.start().value(),
+          interval1.end().value(), interval2.start().value(),
+          interval2.end().value());
+    return nullptr;
   }
   // Uses are disjoint, merging is possible.
-  if (lhs->uses_.size() < rhs->uses_.size()) {
-    // Merge the smallest bundle into the biggest.
+
+  // Merge the smaller bundle into the bigger.
+  if (lhs->intervals_.size() < rhs->intervals_.size()) {
     std::swap(lhs, rhs);
   }
-  for (auto it = rhs->ranges_.begin(); it != rhs->ranges_.end(); ++it) {
-    (*it)->set_bundle(lhs);
-    lhs->InsertUses((*it)->first_interval());
+  for (TopLevelLiveRange* range : rhs->ranges_) {
+    lhs->AddRange(range);
   }
-  lhs->ranges_.insert(rhs->ranges_.begin(), rhs->ranges_.end());
+
   rhs->ranges_.clear();
+  rhs->intervals_.clear();
+
   return lhs;
 }
 
 void LiveRangeBundle::MergeSpillRangesAndClear() {
-  DCHECK_IMPLIES(ranges_.empty(), uses_.empty());
+  DCHECK_IMPLIES(ranges_.empty(), intervals_.empty());
   SpillRange* target = nullptr;
   for (auto range : ranges_) {
     if (range->TopLevel()->HasSpillRange()) {
@@ -2791,7 +2670,7 @@ void LiveRangeBundle::MergeSpillRangesAndClear() {
   // we hit the same bundle from a different LiveRange in AssignSpillSlots.
   // LiveRangeBundles are not used after this.
   ranges_.clear();
-  uses_.clear();
+  intervals_.clear();
 }
 
 RegisterAllocator::RegisterAllocator(TopTierRegisterAllocationData* data,
@@ -2961,7 +2840,7 @@ LifetimePosition RegisterAllocator::FindOptimalSpillingPos(
     LiveRange* live_at_header = range->TopLevel()->GetChildCovers(loop_start);
 
     if (live_at_header != nullptr && !live_at_header->spilled()) {
-      for (LiveRange* check_use = live_at_header;
+      for (const LiveRange* check_use = live_at_header;
            check_use != nullptr && check_use->Start() < pos;
            check_use = check_use->next()) {
         // If we find a use for which spilling is detrimental, don't spill
@@ -2995,7 +2874,7 @@ void RegisterAllocator::Spill(LiveRange* range, SpillMode spill_mode) {
 
   TRACE("Starting spill type is %d\n", static_cast<int>(first->spill_type()));
   if (first->HasNoSpillType()) {
-    TRACE("New spill range needed");
+    TRACE("New spill range needed\n");
     data()->AssignSpillRangeToLiveRange(first, spill_mode);
   }
   // Upgrade the spillmode, in case this was only spilled in deferred code so
@@ -3056,7 +2935,7 @@ void LinearScanAllocator::MaybeSpillPreviousRanges(LiveRange* begin_range,
   }
 }
 
-void LinearScanAllocator::MaybeUndoPreviousSplit(LiveRange* range) {
+void LinearScanAllocator::MaybeUndoPreviousSplit(LiveRange* range, Zone* zone) {
   if (range->next() != nullptr && range->next()->ShouldRecombine()) {
     LiveRange* to_remove = range->next();
     TRACE("Recombining %d:%d with %d\n", range->TopLevel()->vreg(),
@@ -3068,22 +2947,22 @@ void LinearScanAllocator::MaybeUndoPreviousSplit(LiveRange* range) {
     DCHECK_EQ(removed_cnt, 1);
     USE(removed_cnt);
 
-    range->AttachToNext();
+    range->AttachToNext(zone);
   } else if (range->next() != nullptr) {
     TRACE("No recombine for %d:%d to %d\n", range->TopLevel()->vreg(),
           range->relative_id(), range->next()->relative_id());
   }
 }
 
-void LinearScanAllocator::SpillNotLiveRanges(RangeWithRegisterSet* to_be_live,
+void LinearScanAllocator::SpillNotLiveRanges(RangeRegisterSmallMap& to_be_live,
                                              LifetimePosition position,
                                              SpillMode spill_mode) {
   for (auto it = active_live_ranges().begin();
        it != active_live_ranges().end();) {
     LiveRange* active_range = *it;
     TopLevelLiveRange* toplevel = (*it)->TopLevel();
-    auto found = to_be_live->find({toplevel, kUnassignedRegister});
-    if (found == to_be_live->end()) {
+    auto found = to_be_live.find(toplevel);
+    if (found == to_be_live.end()) {
       // Is not contained in {to_be_live}, spill it.
       // Fixed registers are exempt from this. They might have been
       // added from inactive at the block boundary but we know that
@@ -3098,7 +2977,7 @@ void LinearScanAllocator::SpillNotLiveRanges(RangeWithRegisterSet* to_be_live,
         // When spilling a previously spilled/reloaded range, we add back the
         // tail that we might have split off when we reloaded/spilled it
         // previously. Otherwise we might keep generating small split-offs.
-        MaybeUndoPreviousSplit(active_range);
+        MaybeUndoPreviousSplit(active_range, allocation_zone());
         TRACE("Putting back %d:%d\n", toplevel->vreg(),
               active_range->relative_id());
         LiveRange* split = SplitRangeAt(active_range, position);
@@ -3138,8 +3017,8 @@ void LinearScanAllocator::SpillNotLiveRanges(RangeWithRegisterSet* to_be_live,
       }
     } else {
       // This range is contained in {to_be_live}, so we can keep it.
-      int expected_register = (*found).expected_register;
-      to_be_live->erase(found);
+      int expected_register = found->second;
+      to_be_live.erase(found);
       if (expected_register == active_range->assigned_register()) {
         // Was life and in correct register, simply pass through.
         TRACE("Keeping %d:%d in %s\n", toplevel->vreg(),
@@ -3175,7 +3054,8 @@ LiveRange* LinearScanAllocator::AssignRegisterOnReload(LiveRange* range,
         cur_reg != reg) {
       continue;
     }
-    for (const LiveRange* cur_inactive : inactive_live_ranges(cur_reg)) {
+    SlowDCheckInactiveLiveRangesIsSorted(cur_reg);
+    for (LiveRange* cur_inactive : inactive_live_ranges(cur_reg)) {
       if (kFPAliasing == AliasingKind::kCombine && check_fp_aliasing() &&
           !data()->config()->AreAliases(cur_inactive->representation(), cur_reg,
                                         range->representation(), reg)) {
@@ -3202,14 +3082,12 @@ LiveRange* LinearScanAllocator::AssignRegisterOnReload(LiveRange* range,
 }
 
 void LinearScanAllocator::ReloadLiveRanges(
-    RangeWithRegisterSet const& to_be_live, LifetimePosition position) {
+    RangeRegisterSmallMap const& to_be_live, LifetimePosition position) {
   // Assumption: All ranges in {to_be_live} are currently spilled and there are
   // no conflicting registers in the active ranges.
   // The former is ensured by SpillNotLiveRanges, the latter is by construction
   // of the to_be_live set.
-  for (RangeWithRegister range_with_register : to_be_live) {
-    TopLevelLiveRange* range = range_with_register.range;
-    int reg = range_with_register.expected_register;
+  for (auto [range, reg] : to_be_live) {
     LiveRange* to_resurrect = range->GetChildCovers(position);
     if (to_resurrect == nullptr) {
       // While the range was life until the end of the predecessor block, it is
@@ -3223,7 +3101,7 @@ void LinearScanAllocator::ReloadLiveRanges(
       // in the middle of blocks.
       // If there is a gap between this range and the next, we can just keep
       // it as a register change won't hurt.
-      MaybeUndoPreviousSplit(to_resurrect);
+      MaybeUndoPreviousSplit(to_resurrect, allocation_zone());
       if (to_resurrect->Start() == position) {
         // This range already starts at this block. It might have been spilled,
         // so we have to unspill it. Otherwise, it is already in the unhandled
@@ -3274,66 +3152,98 @@ void LinearScanAllocator::ReloadLiveRanges(
 
 RpoNumber LinearScanAllocator::ChooseOneOfTwoPredecessorStates(
     InstructionBlock* current_block, LifetimePosition boundary) {
-  using SmallRangeVector =
-      base::SmallVector<TopLevelLiveRange*,
-                        RegisterConfiguration::kMaxRegisters>;
   // Pick the state that would generate the least spill/reloads.
-  // Compute vectors of ranges with imminent use for both sides.
-  // As GetChildCovers is cached, it is cheaper to repeatedly
-  // call is rather than compute a shared set first.
+  // Compute vectors of ranges with use counts for both sides.
+  // We count uses only for live ranges that are unique to either the left or
+  // the right predecessor since many live ranges are shared between both.
+  // Shared ranges don't influence the decision anyway and this is faster.
   auto& left = data()->GetSpillState(current_block->predecessors()[0]);
   auto& right = data()->GetSpillState(current_block->predecessors()[1]);
-  SmallRangeVector left_used;
-  for (const auto item : left) {
-    LiveRange* at_next_block = item->TopLevel()->GetChildCovers(boundary);
-    if (at_next_block != nullptr &&
-        at_next_block->NextUsePositionRegisterIsBeneficial(boundary) !=
-            nullptr) {
-      left_used.emplace_back(item->TopLevel());
+
+  // Build a set of the `TopLevelLiveRange`s in the left predecessor.
+  // Usually this set is very small, e.g., for JetStream2 at most 3 ranges in
+  // ~72% of the cases and at most 8 ranges in ~93% of the cases. In those cases
+  // `SmallMap` is backed by inline storage and uses fast linear search.
+  // In some pathological cases the set grows large (e.g. the Wasm binary of
+  // v8:9529) and then `SmallMap` gives us O(log n) worst case lookup when
+  // intersecting with the right predecessor below. The set is encoded as a
+  // `SmallMap` to `Dummy` values, since we don't have an equivalent `SmallSet`.
+  struct Dummy {};
+  SmallZoneMap<TopLevelLiveRange*, Dummy, 16> left_set(allocation_zone());
+  for (LiveRange* range : left) {
+    TopLevelLiveRange* parent = range->TopLevel();
+    auto [_, inserted] = left_set.emplace(parent, Dummy{});
+    // The `LiveRange`s in `left` come from the spill state, which is just the
+    // list of active `LiveRange`s at the end of the block (see
+    // `RememberSpillState`). Since at most one `LiveRange` out of a
+    // `TopLevelLiveRange` can be active at the same time, there should never be
+    // the same `TopLevelLiveRange` twice in `left_set`, hence this check.
+    DCHECK(inserted);
+    USE(inserted);
+  }
+
+  // Now build a list of ranges unique to either the left or right predecessor.
+  struct RangeUseCount {
+    // The set above contains `TopLevelLiveRange`s, but ultimately we want to
+    // count uses of the child `LiveRange` covering `boundary`.
+    // The lookup in `GetChildCovers` is O(log n), so do it only once when
+    // inserting into this list.
+    LiveRange* range;
+    // +1 if used in the left predecessor, -1 if used in the right predecessor.
+    int use_count_delta;
+  };
+  SmallZoneVector<RangeUseCount, 16> unique_range_use_counts(allocation_zone());
+  for (LiveRange* range : right) {
+    TopLevelLiveRange* parent = range->TopLevel();
+    auto left_it = left_set.find(parent);
+    bool range_is_shared_left_and_right = left_it != left_set.end();
+    if (range_is_shared_left_and_right) {
+      left_set.erase(left_it);
+    } else {
+      // This range is unique to the right predecessor, so insert into the list.
+      LiveRange* child = parent->GetChildCovers(boundary);
+      if (child != nullptr) {
+        unique_range_use_counts.push_back({child, -1});
+      }
     }
   }
-  SmallRangeVector right_used;
-  for (const auto item : right) {
-    LiveRange* at_next_block = item->TopLevel()->GetChildCovers(boundary);
-    if (at_next_block != nullptr &&
-        at_next_block->NextUsePositionRegisterIsBeneficial(boundary) !=
-            nullptr) {
-      right_used.emplace_back(item->TopLevel());
+  // So far `unique_range_use_counts` contains only the ranges unique in the
+  // right predecessor. Now also add the ranges from the left predecessor.
+  for (auto [parent, _] : left_set) {
+    LiveRange* child = parent->GetChildCovers(boundary);
+    if (child != nullptr) {
+      unique_range_use_counts.push_back({child, +1});
     }
   }
-  if (left_used.empty() && right_used.empty()) {
-    // There are no beneficial register uses. Look at any use at
-    // all. We do not account for all uses, like flowing into a phi.
+
+  // Finally, count the uses for each range.
+  int use_count_difference = 0;
+  for (auto [range, use_count] : unique_range_use_counts) {
+    if (range->NextUsePositionRegisterIsBeneficial(boundary) != nullptr) {
+      use_count_difference += use_count;
+    }
+  }
+  if (use_count_difference == 0) {
+    // There is a tie in beneficial register uses. Now, look at any use at all.
+    // We do not account for all uses, like flowing into a phi.
     // So we just look at ranges still being live.
     TRACE("Looking at only uses\n");
-    for (const auto item : left) {
-      LiveRange* at_next_block = item->TopLevel()->GetChildCovers(boundary);
-      if (at_next_block != nullptr &&
-          at_next_block->NextUsePosition(boundary) != nullptr) {
-        left_used.emplace_back(item->TopLevel());
-      }
-    }
-    for (const auto item : right) {
-      LiveRange* at_next_block = item->TopLevel()->GetChildCovers(boundary);
-      if (at_next_block != nullptr &&
-          at_next_block->NextUsePosition(boundary) != nullptr) {
-        right_used.emplace_back(item->TopLevel());
+    for (auto [range, use_count] : unique_range_use_counts) {
+      if (range->NextUsePosition(boundary) != range->positions().end()) {
+        use_count_difference += use_count;
       }
     }
   }
-  // Now left_used and right_used contains those ranges that matter.
-  // Count which side matches this most.
-  TRACE("Vote went %zu vs %zu\n", left_used.size(), right_used.size());
-  return left_used.size() > right_used.size()
-             ? current_block->predecessors()[0]
-             : current_block->predecessors()[1];
+  TRACE("Left predecessor has %d more uses than right\n", use_count_difference);
+  return use_count_difference > 0 ? current_block->predecessors()[0]
+                                  : current_block->predecessors()[1];
 }
 
-bool LinearScanAllocator::CheckConflict(MachineRepresentation rep, int reg,
-                                        RangeWithRegisterSet* to_be_live) {
-  for (RangeWithRegister range_with_reg : *to_be_live) {
-    if (data()->config()->AreAliases(range_with_reg.range->representation(),
-                                     range_with_reg.expected_register, rep,
+bool LinearScanAllocator::CheckConflict(
+    MachineRepresentation rep, int reg,
+    const RangeRegisterSmallMap& to_be_live) {
+  for (auto [range, expected_reg] : to_be_live) {
+    if (data()->config()->AreAliases(range->representation(), expected_reg, rep,
                                      reg)) {
       return true;
     }
@@ -3342,19 +3252,23 @@ bool LinearScanAllocator::CheckConflict(MachineRepresentation rep, int reg,
 }
 
 void LinearScanAllocator::ComputeStateFromManyPredecessors(
-    InstructionBlock* current_block, RangeWithRegisterSet* to_be_live) {
+    InstructionBlock* current_block, RangeRegisterSmallMap& to_be_live) {
   struct Vote {
     size_t count;
     int used_registers[RegisterConfiguration::kMaxRegisters];
-  };
-  struct TopLevelLiveRangeComparator {
-    bool operator()(const TopLevelLiveRange* lhs,
-                    const TopLevelLiveRange* rhs) const {
-      return lhs->vreg() < rhs->vreg();
+    explicit Vote(int reg) : count(1), used_registers{0} {
+      used_registers[reg] = 1;
     }
   };
-  ZoneMap<TopLevelLiveRange*, Vote, TopLevelLiveRangeComparator> counts(
-      data()->allocation_zone());
+  // Typically this map is very small, e.g., on JetStream2 it has at most 3
+  // elements ~80% of the time and at most 8 elements ~94% of the time.
+  // Thus use a `SmallZoneMap` to avoid allocations and because linear search
+  // in an array is faster than map lookup for such small sizes.
+  // We don't want too many inline elements though since `Vote` is pretty large.
+  using RangeVoteMap = SmallZoneMap<TopLevelLiveRange*, Vote, 16>;
+  static_assert(sizeof(RangeVoteMap) < 4096, "too large stack allocation");
+  RangeVoteMap counts(data()->allocation_zone());
+
   int deferred_blocks = 0;
   for (RpoNumber pred : current_block->predecessors()) {
     if (!ConsiderBlockForControlFlow(current_block, pred)) {
@@ -3368,14 +3282,11 @@ void LinearScanAllocator::ComputeStateFromManyPredecessors(
       // stored might have lost its register. Ignore those.
       if (!range->HasRegisterAssigned()) continue;
       TopLevelLiveRange* toplevel = range->TopLevel();
-      auto previous = counts.find(toplevel);
-      if (previous == counts.end()) {
-        auto result = counts.emplace(std::make_pair(toplevel, Vote{1, {0}}));
-        CHECK(result.second);
-        result.first->second.used_registers[range->assigned_register()]++;
-      } else {
-        previous->second.count++;
-        previous->second.used_registers[range->assigned_register()]++;
+      auto [it, inserted] =
+          counts.try_emplace(toplevel, range->assigned_register());
+      if (!inserted) {
+        it->second.count++;
+        it->second.used_registers[range->assigned_register()]++;
       }
     }
   }
@@ -3384,9 +3295,10 @@ void LinearScanAllocator::ComputeStateFromManyPredecessors(
   const size_t majority =
       (current_block->PredecessorCount() + 2 - deferred_blocks) / 2;
   bool taken_registers[RegisterConfiguration::kMaxRegisters] = {false};
-  auto assign_to_live = [this, counts, majority](
+  DCHECK(to_be_live.empty());
+  auto assign_to_live = [this, majority, &counts](
                             std::function<bool(TopLevelLiveRange*)> filter,
-                            RangeWithRegisterSet* to_be_live,
+                            RangeRegisterSmallMap& to_be_live,
                             bool* taken_registers) {
     bool check_aliasing =
         kFPAliasing == AliasingKind::kCombine && check_fp_aliasing();
@@ -3419,10 +3331,11 @@ void LinearScanAllocator::ComputeStateFromManyPredecessors(
         } else if (!check_aliasing) {
           taken_registers[reg] = true;
         }
-        to_be_live->emplace(val.first, reg);
-        TRACE("Reset %d as live due vote %zu in %s\n",
-              val.first->TopLevel()->vreg(), val.second.count,
-              RegisterName(reg));
+        TRACE("Reset %d as live due vote %zu in %s\n", val.first->vreg(),
+              val.second.count, RegisterName(reg));
+        auto [_, inserted] = to_be_live.emplace(val.first, reg);
+        DCHECK(inserted);
+        USE(inserted);
       }
     }
   };
@@ -3512,6 +3425,7 @@ void LinearScanAllocator::UpdateDeferredFixedRanges(SpillMode spill_mode,
             reg != range->assigned_register()) {
           continue;
         }
+        SlowDCheckInactiveLiveRangesIsSorted(reg);
         for (auto inactive : inactive_live_ranges(reg)) {
           if (inactive->NextStart() > max) break;
           split_conflicting(range, inactive, [this](LiveRange* updated) {
@@ -3610,7 +3524,7 @@ void LinearScanAllocator::AllocateRegisters() {
   SplitAndSpillRangesDefinedByMemoryOperand();
   data()->ResetSpillState();
 
-  if (data()->is_trace_alloc()) {
+  if (v8_flags.trace_turbo_alloc) {
     PrintRangeOverview();
   }
 
@@ -3754,7 +3668,7 @@ void LinearScanAllocator::AllocateRegisters() {
         // allocation if they were not live at the predecessors.
         ForwardStateTo(next_block_boundary);
 
-        RangeWithRegisterSet to_be_live(data()->allocation_zone());
+        RangeRegisterSmallMap to_be_live(allocation_zone());
 
         // If we end up deciding to use the state of the immediate
         // predecessor, it is better not to perform a change. It would lead to
@@ -3766,7 +3680,7 @@ void LinearScanAllocator::AllocateRegisters() {
 
         auto pick_state_from = [this, current_block](
                                    RpoNumber pred,
-                                   RangeWithRegisterSet* to_be_live) -> bool {
+                                   RangeRegisterSmallMap& to_be_live) -> bool {
           TRACE("Using information from B%d\n", pred.ToInt());
           // If this is a fall-through that is not across a deferred
           // boundary, there is nothing to do.
@@ -3778,13 +3692,17 @@ void LinearScanAllocator::AllocateRegisters() {
             LifetimePosition pred_end =
                 LifetimePosition::GapFromInstructionIndex(
                     this->code()->InstructionBlockAt(pred)->code_end());
+            DCHECK(to_be_live.empty());
             for (const auto range : spill_state) {
               // Filter out ranges that were split or had their register
               // stolen by backwards working spill heuristics. These have
               // been spilled after the fact, so ignore them.
               if (range->End() < pred_end || !range->HasRegisterAssigned())
                 continue;
-              to_be_live->emplace(range);
+              auto [_, inserted] = to_be_live.emplace(
+                  range->TopLevel(), range->assigned_register());
+              DCHECK(inserted);
+              USE(inserted);
             }
           }
           return is_noop;
@@ -3802,7 +3720,7 @@ void LinearScanAllocator::AllocateRegisters() {
           TRACE("Single predecessor for B%d\n",
                 current_block->rpo_number().ToInt());
           no_change_required =
-              pick_state_from(current_block->predecessors()[0], &to_be_live);
+              pick_state_from(current_block->predecessors()[0], to_be_live);
         } else if (current_block->PredecessorCount() == 2) {
           TRACE("Two predecessors for B%d\n",
                 current_block->rpo_number().ToInt());
@@ -3820,15 +3738,15 @@ void LinearScanAllocator::AllocateRegisters() {
             chosen_predecessor = ChooseOneOfTwoPredecessorStates(
                 current_block, next_block_boundary);
           }
-          no_change_required = pick_state_from(chosen_predecessor, &to_be_live);
+          no_change_required = pick_state_from(chosen_predecessor, to_be_live);
 
         } else {
           // Merge at the end of, e.g., a switch.
-          ComputeStateFromManyPredecessors(current_block, &to_be_live);
+          ComputeStateFromManyPredecessors(current_block, to_be_live);
         }
 
         if (!no_change_required) {
-          SpillNotLiveRanges(&to_be_live, next_block_boundary, spill_mode);
+          SpillNotLiveRanges(to_be_live, next_block_boundary, spill_mode);
           ReloadLiveRanges(to_be_live, next_block_boundary);
         }
       }
@@ -3862,7 +3780,7 @@ void LinearScanAllocator::AllocateRegisters() {
     ProcessCurrentRange(current, spill_mode);
   }
 
-  if (data()->is_trace_alloc()) {
+  if (v8_flags.trace_turbo_alloc) {
     PrintRangeOverview();
   }
 }
@@ -3892,7 +3810,13 @@ void LinearScanAllocator::AddToInactive(LiveRange* range) {
   next_inactive_ranges_change_ = std::min(
       next_inactive_ranges_change_, range->NextStartAfter(range->Start()));
   DCHECK(range->HasRegisterAssigned());
-  inactive_live_ranges(range->assigned_register()).insert(range);
+  // Keep `inactive_live_ranges` sorted.
+  inactive_live_ranges(range->assigned_register())
+      .insert(std::upper_bound(
+                  inactive_live_ranges(range->assigned_register()).begin(),
+                  inactive_live_ranges(range->assigned_register()).end(), range,
+                  InactiveLiveRangeOrdering()),
+              1, range);
 }
 
 void LinearScanAllocator::AddToUnhandled(LiveRange* range) {
@@ -3921,7 +3845,13 @@ ZoneVector<LiveRange*>::iterator LinearScanAllocator::ActiveToInactive(
   next_inactive_ranges_change_ =
       std::min(next_inactive_ranges_change_, next_active);
   DCHECK(range->HasRegisterAssigned());
-  inactive_live_ranges(range->assigned_register()).insert(range);
+  // Keep `inactive_live_ranges` sorted.
+  inactive_live_ranges(range->assigned_register())
+      .insert(std::upper_bound(
+                  inactive_live_ranges(range->assigned_register()).begin(),
+                  inactive_live_ranges(range->assigned_register()).end(), range,
+                  InactiveLiveRangeOrdering()),
+              1, range);
   return active_live_ranges().erase(it);
 }
 
@@ -3931,6 +3861,8 @@ LinearScanAllocator::InactiveToHandled(InactiveLiveRangeQueue::iterator it) {
   TRACE("Moving live range %d:%d from inactive to handled\n",
         range->TopLevel()->vreg(), range->relative_id());
   int reg = range->assigned_register();
+  // This must keep the order of `inactive_live_ranges` intact since one of its
+  // callers `SplitAndSpillIntersecting` relies on it being sorted.
   return inactive_live_ranges(reg).erase(it);
 }
 
@@ -3944,7 +3876,12 @@ LinearScanAllocator::InactiveToActive(InactiveLiveRangeQueue::iterator it,
   next_active_ranges_change_ =
       std::min(next_active_ranges_change_, range->NextEndAfter(position));
   int reg = range->assigned_register();
-  return inactive_live_ranges(reg).erase(it);
+  // Remove the element without copying O(n) subsequent elements.
+  // The order of `inactive_live_ranges` is established afterwards by sorting in
+  // `ForwardStateTo`, which is the only caller.
+  std::swap(*it, inactive_live_ranges(reg).back());
+  inactive_live_ranges(reg).pop_back();
+  return it;
 }
 
 void LinearScanAllocator::ForwardStateTo(LifetimePosition position) {
@@ -3968,7 +3905,6 @@ void LinearScanAllocator::ForwardStateTo(LifetimePosition position) {
   if (position >= next_inactive_ranges_change_) {
     next_inactive_ranges_change_ = LifetimePosition::MaxPosition();
     for (int reg = 0; reg < num_registers(); ++reg) {
-      ZoneVector<LiveRange*> reorder(data()->allocation_zone());
       for (auto it = inactive_live_ranges(reg).begin();
            it != inactive_live_ranges(reg).end();) {
         LiveRange* cur_inactive = *it;
@@ -3977,18 +3913,22 @@ void LinearScanAllocator::ForwardStateTo(LifetimePosition position) {
         } else if (cur_inactive->Covers(position)) {
           it = InactiveToActive(it, position);
         } else {
-          next_inactive_ranges_change_ =
-              std::min(next_inactive_ranges_change_,
-                       cur_inactive->NextStartAfter(position));
-          it = inactive_live_ranges(reg).erase(it);
-          reorder.push_back(cur_inactive);
+          next_inactive_ranges_change_ = std::min(
+              next_inactive_ranges_change_,
+              // This modifies `cur_inactive.next_start_` and thus
+              // invalidates the ordering of `inactive_live_ranges(reg)`.
+              cur_inactive->NextStartAfter(position));
+          ++it;
         }
       }
-      for (LiveRange* range : reorder) {
-        inactive_live_ranges(reg).insert(range);
-      }
+      std::sort(inactive_live_ranges(reg).begin(),
+                inactive_live_ranges(reg).end(), InactiveLiveRangeOrdering());
     }
   }
+
+  for (int reg = 0; reg < num_registers(); ++reg) {
+    SlowDCheckInactiveLiveRangesIsSorted(reg);
+  }
 }
 
 int LinearScanAllocator::LastDeferredInstructionIndex(InstructionBlock* start) {
@@ -4075,9 +4015,10 @@ void LinearScanAllocator::FindFreeRegistersForRange(
   }
 
   for (int cur_reg = 0; cur_reg < num_regs; ++cur_reg) {
+    SlowDCheckInactiveLiveRangesIsSorted(cur_reg);
     for (LiveRange* cur_inactive : inactive_live_ranges(cur_reg)) {
       DCHECK_GT(cur_inactive->End(), range->Start());
-      CHECK_EQ(cur_inactive->assigned_register(), cur_reg);
+      DCHECK_EQ(cur_inactive->assigned_register(), cur_reg);
       // No need to carry out intersections, when this register won't be
       // interesting to this range anyway.
       // TODO(mtrofin): extend to aliased ranges, too.
@@ -4131,10 +4072,10 @@ void LinearScanAllocator::ProcessCurrentRange(LiveRange* current,
 }
 
 bool LinearScanAllocator::TryAllocatePreferredReg(
-    LiveRange* current, const base::Vector<LifetimePosition>& free_until_pos) {
+    LiveRange* current, base::Vector<const LifetimePosition> free_until_pos) {
   int hint_register;
   if (current->RegisterFromControlFlow(&hint_register) ||
-      current->FirstHintPosition(&hint_register) != nullptr ||
+      current->RegisterFromFirstHint(&hint_register) ||
       current->RegisterFromBundle(&hint_register)) {
     TRACE(
         "Found reg hint %s (free until [%d) for live range %d:%d (end %d[).\n",
@@ -4156,7 +4097,7 @@ bool LinearScanAllocator::TryAllocatePreferredReg(
 
 int LinearScanAllocator::PickRegisterThatIsAvailableLongest(
     LiveRange* current, int hint_reg,
-    const base::Vector<LifetimePosition>& free_until_pos) {
+    base::Vector<const LifetimePosition> free_until_pos) {
   int num_regs = 0;  // used only for the call to GetFPRegisterSet.
   int num_codes = num_allocatable_registers();
   const int* codes = allocatable_register_codes();
@@ -4202,11 +4143,11 @@ int LinearScanAllocator::PickRegisterThatIsAvailableLongest(
 }
 
 bool LinearScanAllocator::TryAllocateFreeReg(
-    LiveRange* current, const base::Vector<LifetimePosition>& free_until_pos) {
+    LiveRange* current, base::Vector<const LifetimePosition> free_until_pos) {
   // Compute register hint, if such exists.
   int hint_reg = kUnassignedRegister;
   current->RegisterFromControlFlow(&hint_reg) ||
-      current->FirstHintPosition(&hint_reg) != nullptr ||
+      current->RegisterFromFirstHint(&hint_reg) ||
       current->RegisterFromBundle(&hint_reg);
 
   int reg =
@@ -4304,6 +4245,7 @@ void LinearScanAllocator::AllocateBlockedReg(LiveRange* current,
   }
 
   for (int cur_reg = 0; cur_reg < num_registers(); ++cur_reg) {
+    SlowDCheckInactiveLiveRangesIsSorted(cur_reg);
     for (LiveRange* range : inactive_live_ranges(cur_reg)) {
       DCHECK(range->End() > current->Start());
       DCHECK_EQ(range->assigned_register(), cur_reg);
@@ -4462,6 +4404,7 @@ void LinearScanAllocator::SplitAndSpillIntersecting(LiveRange* current,
     if (kFPAliasing != AliasingKind::kCombine || !check_fp_aliasing()) {
       if (cur_reg != reg) continue;
     }
+    SlowDCheckInactiveLiveRangesIsSorted(cur_reg);
     for (auto it = inactive_live_ranges(cur_reg).begin();
          it != inactive_live_ranges(cur_reg).end();) {
       LiveRange* range = *it;
@@ -4508,18 +4451,16 @@ bool LinearScanAllocator::TryReuseSpillForPhi(TopLevelLiveRange* range) {
   size_t spilled_count = 0;
   for (size_t i = 0; i < phi->operands().size(); i++) {
     int op = phi->operands()[i];
-    LiveRange* op_range = data()->GetOrCreateLiveRangeFor(op);
-    if (!op_range->TopLevel()->HasSpillRange()) continue;
+    TopLevelLiveRange* op_range = data()->GetLiveRangeFor(op);
+    if (!op_range->HasSpillRange() || op_range->get_bundle() != out_bundle)
+      continue;
     const InstructionBlock* pred =
         code()->InstructionBlockAt(block->predecessors()[i]);
     LifetimePosition pred_end =
         LifetimePosition::InstructionFromInstructionIndex(
             pred->last_instruction_index());
-    while (op_range != nullptr && !op_range->CanCover(pred_end)) {
-      op_range = op_range->next();
-    }
-    if (op_range != nullptr && op_range->spilled() &&
-        op_range->get_bundle() == out_bundle) {
+    LiveRange* op_range_child = op_range->GetChildCovers(pred_end);
+    if (op_range_child != nullptr && op_range_child->spilled()) {
       spilled_count++;
     }
   }
@@ -4621,7 +4562,8 @@ void OperandAssigner::DecideSpillingMode() {
   for (auto range : data()->live_ranges()) {
     data()->tick_counter()->TickAndMaybeEnterSafepoint();
     int max_blocks = data()->code()->InstructionBlockCount();
-    if (range != nullptr && range->IsSpilledOnlyInDeferredBlocks(data())) {
+    DCHECK_NOT_NULL(range);
+    if (range->IsSpilledOnlyInDeferredBlocks(data())) {
       // If the range is spilled only in deferred blocks and starts in
       // a non-deferred block, we transition its representation here so
       // that the LiveRangeConnector processes them correctly. If,
@@ -4644,30 +4586,68 @@ void OperandAssigner::DecideSpillingMode() {
 }
 
 void OperandAssigner::AssignSpillSlots() {
-  for (auto range : data()->live_ranges()) {
+  ZoneVector<SpillRange*> spill_ranges(data()->allocation_zone());
+  for (const TopLevelLiveRange* range : data()->live_ranges()) {
+    DCHECK_NOT_NULL(range);
+    if (range->HasSpillRange()) {
+      DCHECK_NOT_NULL(range->GetSpillRange());
+      spill_ranges.push_back(range->GetSpillRange());
+    }
+  }
+  // At this point, the `SpillRange`s for all `TopLevelLiveRange`s should be
+  // unique, since none have been merged yet.
+  DCHECK_EQ(spill_ranges.size(),
+            std::set(spill_ranges.begin(), spill_ranges.end()).size());
+
+  // Merge all `SpillRange`s that belong to the same `LiveRangeBundle`.
+  for (const TopLevelLiveRange* range : data()->live_ranges()) {
     data()->tick_counter()->TickAndMaybeEnterSafepoint();
-    if (range != nullptr && range->get_bundle() != nullptr) {
+    DCHECK_NOT_NULL(range);
+    if (range->get_bundle() != nullptr) {
       range->get_bundle()->MergeSpillRangesAndClear();
     }
   }
-  ZoneVector<SpillRange*>& spill_ranges = data()->spill_ranges();
-  // Merge disjoint spill ranges
-  for (size_t i = 0; i < spill_ranges.size(); ++i) {
+
+  // Now merge *all* disjoint, non-empty `SpillRange`s.
+  // Formerly, this merging was O(n^2) in the number of `SpillRange`s, which
+  // then dominated compile time (>40%) for some pathological cases,
+  // e.g., https://crbug.com/v8/14133.
+  // Now, we allow only `kMaxRetries` unsuccessful merges with directly
+  // following `SpillRange`s. After each `kMaxRetries`, we exponentially
+  // increase the stride, which limits the inner loop to O(log n) and thus
+  // the overall merging to O(n * log n).
+
+  // The merging above may have left some `SpillRange`s empty, remove them.
+  SpillRange** end_nonempty =
+      std::remove_if(spill_ranges.begin(), spill_ranges.end(),
+                     [](const SpillRange* range) { return range->IsEmpty(); });
+  for (SpillRange** range_it = spill_ranges.begin(); range_it < end_nonempty;
+       ++range_it) {
     data()->tick_counter()->TickAndMaybeEnterSafepoint();
-    SpillRange* range = spill_ranges[i];
-    if (range == nullptr) continue;
-    if (range->IsEmpty()) continue;
-    for (size_t j = i + 1; j < spill_ranges.size(); ++j) {
-      SpillRange* other = spill_ranges[j];
-      if (other != nullptr && !other->IsEmpty()) {
-        range->TryMerge(other);
+    SpillRange* range = *range_it;
+    DCHECK(!range->IsEmpty());
+    constexpr size_t kMaxRetries = 1000;
+    size_t retries = kMaxRetries;
+    size_t stride = 1;
+    for (SpillRange** other_it = range_it + 1; other_it < end_nonempty;
+         other_it += stride) {
+      SpillRange* other = *other_it;
+      DCHECK(!other->IsEmpty());
+      if (range->TryMerge(other)) {
+        DCHECK(other->IsEmpty());
+        std::iter_swap(other_it, --end_nonempty);
+      } else if (--retries == 0) {
+        retries = kMaxRetries;
+        stride *= 2;
       }
     }
   }
+  spill_ranges.erase(end_nonempty, spill_ranges.end());
+
   // Allocate slots for the merged spill ranges.
   for (SpillRange* range : spill_ranges) {
     data()->tick_counter()->TickAndMaybeEnterSafepoint();
-    if (range == nullptr || range->IsEmpty()) continue;
+    DCHECK(!range->IsEmpty());
     if (!range->HasSlot()) {
       // Allocate a new operand referring to the spill slot, aligned to the
       // operand size.
@@ -4684,7 +4664,8 @@ void OperandAssigner::CommitAssignment() {
     data()->tick_counter()->TickAndMaybeEnterSafepoint();
     CHECK_EQ(live_ranges_size,
              data()->live_ranges().size());  // TODO(neis): crbug.com/831822
-    if (top_range == nullptr || top_range->IsEmpty()) continue;
+    DCHECK_NOT_NULL(top_range);
+    if (top_range->IsEmpty()) continue;
     InstructionOperand spill_operand;
     if (top_range->HasSpillOperand()) {
       auto it = data()->slot_for_const_range().find(top_range);
@@ -4753,37 +4734,29 @@ void ReferenceMapPopulator::PopulateReferenceMaps() {
   // Iterate over all safe point positions and record a pointer
   // for all spilled live ranges at this point.
   int last_range_start = 0;
-  const ReferenceMapDeque* reference_maps = data()->code()->reference_maps();
-  ReferenceMapDeque::const_iterator first_it = reference_maps->begin();
+  const ReferenceMaps* reference_maps = data()->code()->reference_maps();
+  ReferenceMaps::const_iterator first_it = reference_maps->begin();
   const size_t live_ranges_size = data()->live_ranges().size();
-  // We break the invariant that live ranges are indexed by their vregs here.
-  // This is ok because we don't use that invariant here, and this is the last
-  // phase.
-  std::sort(data()->live_ranges().begin(), data()->live_ranges().end(),
-            [](TopLevelLiveRange* a, TopLevelLiveRange* b) {
-              if (!a || a->IsEmpty()) return false;
-              if (!b || b->IsEmpty()) return true;
-              return a->Start() < b->Start();
-            });
+  // Select subset of `TopLevelLiveRange`s to process, sort them by their start.
+  ZoneVector<TopLevelLiveRange*> candidate_ranges(data()->allocation_zone());
+  candidate_ranges.reserve(data()->live_ranges().size());
   for (TopLevelLiveRange* range : data()->live_ranges()) {
     CHECK_EQ(live_ranges_size,
              data()->live_ranges().size());  // TODO(neis): crbug.com/831822
-    if (range == nullptr) continue;
+    DCHECK_NOT_NULL(range);
     // Skip non-reference values.
     if (!data()->code()->IsReference(range->vreg())) continue;
     // Skip empty live ranges.
     if (range->IsEmpty()) continue;
     if (range->has_preassigned_slot()) continue;
-
+    candidate_ranges.push_back(range);
+  }
+  std::sort(candidate_ranges.begin(), candidate_ranges.end(),
+            LiveRangeOrdering());
+  for (TopLevelLiveRange* range : candidate_ranges) {
     // Find the extent of the range and its children.
     int start = range->Start().ToInstructionIndex();
-    int end = 0;
-    for (LiveRange* cur = range; cur != nullptr; cur = cur->next()) {
-      LifetimePosition this_end = cur->End();
-      if (this_end.ToInstructionIndex() > end)
-        end = this_end.ToInstructionIndex();
-      DCHECK(cur->Start().ToInstructionIndex() >= start);
-    }
+    int end = range->Children().back()->End().ToInstructionIndex();
 
     // Ranges should be sorted, so that the first reference map in the current
     // live range has to be after {first_it}.
@@ -4812,7 +4785,7 @@ void ReferenceMapPopulator::PopulateReferenceMaps() {
           AllocatedOperand::cast(spill_operand).representation()));
     }
 
-    LiveRange* cur = range;
+    LiveRange* cur = nullptr;
     // Step through the safe points to see whether they are in the range.
     for (auto it = first_it; it != reference_maps->end(); ++it) {
       ReferenceMap* map = *it;
@@ -4832,18 +4805,22 @@ void ReferenceMapPopulator::PopulateReferenceMaps() {
       // This may happen if cur has more than one interval, and the current
       // safe_point_pos is in between intervals.
       // For that reason, cur may be at most the last child.
-      DCHECK_NOT_NULL(cur);
-      DCHECK(safe_point_pos >= cur->Start() || range == cur);
+      // Use binary search for the first iteration, then linear search after.
       bool found = false;
-      while (!found) {
-        if (cur->Covers(safe_point_pos)) {
-          found = true;
-        } else {
-          LiveRange* next = cur->next();
-          if (next == nullptr || next->Start() > safe_point_pos) {
-            break;
+      if (cur == nullptr) {
+        cur = range->GetChildCovers(safe_point_pos);
+        found = cur != nullptr;
+      } else {
+        while (!found) {
+          if (cur->Covers(safe_point_pos)) {
+            found = true;
+          } else {
+            LiveRange* next = cur->next();
+            if (next == nullptr || next->Start() > safe_point_pos) {
+              break;
+            }
+            cur = next;
           }
-          cur = next;
         }
       }
 
@@ -4890,27 +4867,40 @@ bool LiveRangeConnector::CanEagerlyResolveControlFlow(
 }
 
 void LiveRangeConnector::ResolveControlFlow(Zone* local_zone) {
-  // Lazily linearize live ranges in memory for fast lookup.
-  LiveRangeFinder finder(data(), local_zone);
   ZoneVector<SparseBitVector*>& live_in_sets = data()->live_in_sets();
   for (const InstructionBlock* block : code()->instruction_blocks()) {
     if (CanEagerlyResolveControlFlow(block)) continue;
     SparseBitVector* live = live_in_sets[block->rpo_number().ToInt()];
-    auto it = live->begin();
-    auto end = live->end();
-    while (it != end) {
+    for (int vreg : *live) {
       data()->tick_counter()->TickAndMaybeEnterSafepoint();
-      int vreg = *it;
-      LiveRangeBoundArray* array = finder.ArrayFor(vreg);
+      TopLevelLiveRange* live_range = data()->live_ranges()[vreg];
+      LifetimePosition cur_start = LifetimePosition::GapFromInstructionIndex(
+          block->first_instruction_index());
+      LiveRange* cur_range = live_range->GetChildCovers(cur_start);
+      DCHECK_NOT_NULL(cur_range);
+      if (cur_range->spilled()) continue;
+
       for (const RpoNumber& pred : block->predecessors()) {
-        FindResult result;
+        // Find ranges that may need to be connected.
         const InstructionBlock* pred_block = code()->InstructionBlockAt(pred);
-        if (!array->FindConnectableSubranges(block, pred_block, &result)) {
-          continue;
-        }
-        InstructionOperand pred_op = result.pred_cover_->GetAssignedOperand();
-        InstructionOperand cur_op = result.cur_cover_->GetAssignedOperand();
+        LifetimePosition pred_end =
+            LifetimePosition::InstructionFromInstructionIndex(
+                pred_block->last_instruction_index());
+        // We don't need to perform the O(log n) search if we already know it
+        // will be the same range.
+        if (cur_range->CanCover(pred_end)) continue;
+        LiveRange* pred_range = live_range->GetChildCovers(pred_end);
+        // This search should always succeed because the `vreg` associated to
+        // this `live_range` must be live out in all predecessor blocks.
+        DCHECK_NOT_NULL(pred_range);
+        // Since the `cur_range` did not cover `pred_end` earlier, the found
+        // `pred_range` must be different.
+        DCHECK_NE(cur_range, pred_range);
+
+        InstructionOperand pred_op = pred_range->GetAssignedOperand();
+        InstructionOperand cur_op = cur_range->GetAssignedOperand();
         if (pred_op.Equals(cur_op)) continue;
+
         if (!pred_op.IsAnyRegister() && cur_op.IsAnyRegister()) {
           // We're doing a reload.
           // We don't need to, if:
@@ -4921,35 +4911,35 @@ void LiveRangeConnector::ResolveControlFlow(Zone* local_zone) {
               LifetimePosition::GapFromInstructionIndex(block->code_start());
           LifetimePosition block_end =
               LifetimePosition::GapFromInstructionIndex(block->code_end());
-          const LiveRange* current = result.cur_cover_;
           // Note that this is not the successor if we have control flow!
           // However, in the following condition, we only refer to it if it
           // begins in the current block, in which case we can safely declare it
           // to be the successor.
-          const LiveRange* successor = current->next();
-          if (current->End() < block_end &&
+          const LiveRange* successor = cur_range->next();
+          if (cur_range->End() < block_end &&
               (successor == nullptr || successor->spilled())) {
             // verify point 1: no register use. We can go to the end of the
             // range, since it's all within the block.
 
             bool uses_reg = false;
-            for (const UsePosition* use = current->NextUsePosition(block_start);
-                 use != nullptr; use = use->next()) {
-              if (use->operand()->IsAnyRegister()) {
+            for (UsePosition* const* use_pos_it =
+                     cur_range->NextUsePosition(block_start);
+                 use_pos_it != cur_range->positions().end(); ++use_pos_it) {
+              if ((*use_pos_it)->operand()->IsAnyRegister()) {
                 uses_reg = true;
                 break;
               }
             }
             if (!uses_reg) continue;
           }
-          if (current->TopLevel()->IsSpilledOnlyInDeferredBlocks(data()) &&
+          if (cur_range->TopLevel()->IsSpilledOnlyInDeferredBlocks(data()) &&
               pred_block->IsDeferred()) {
             // The spill location should be defined in pred_block, so add
             // pred_block to the list of blocks requiring a spill operand.
             TRACE("Adding B%d to list of spill blocks for %d\n",
                   pred_block->rpo_number().ToInt(),
-                  current->TopLevel()->vreg());
-            current->TopLevel()
+                  cur_range->TopLevel()->vreg());
+            cur_range->TopLevel()
                 ->GetListOfBlocksRequiringSpillOperands(data())
                 ->Add(pred_block->rpo_number().ToInt());
           }
@@ -4957,13 +4947,11 @@ void LiveRangeConnector::ResolveControlFlow(Zone* local_zone) {
         int move_loc = ResolveControlFlow(block, cur_op, pred_block, pred_op);
         USE(move_loc);
         DCHECK_IMPLIES(
-            result.cur_cover_->TopLevel()->IsSpilledOnlyInDeferredBlocks(
-                data()) &&
+            cur_range->TopLevel()->IsSpilledOnlyInDeferredBlocks(data()) &&
                 !(pred_op.IsAnyRegister() && cur_op.IsAnyRegister()) &&
                 move_loc != -1,
             code()->GetInstructionBlock(move_loc)->IsDeferred());
       }
-      ++it;
     }
   }
 
@@ -4972,14 +4960,14 @@ void LiveRangeConnector::ResolveControlFlow(Zone* local_zone) {
   // for deferred blocks. This is a convenient time to commit spills for general
   // spill ranges also, because they need to use the LiveRangeFinder.
   const size_t live_ranges_size = data()->live_ranges().size();
-  SpillPlacer spill_placer(&finder, data(), local_zone);
+  SpillPlacer spill_placer(data(), local_zone);
   for (TopLevelLiveRange* top : data()->live_ranges()) {
     CHECK_EQ(live_ranges_size,
              data()->live_ranges().size());  // TODO(neis): crbug.com/831822
-    if (top == nullptr || top->IsEmpty()) continue;
+    DCHECK_NOT_NULL(top);
+    if (top->IsEmpty()) continue;
     if (top->IsSpilledOnlyInDeferredBlocks(data())) {
-      CommitSpillsInDeferredBlocks(top, finder.ArrayFor(top->vreg()),
-                                   local_zone);
+      CommitSpillsInDeferredBlocks(top, local_zone);
     } else if (top->HasGeneralSpillRange()) {
       spill_placer.Add(top);
     }
@@ -5026,7 +5014,7 @@ void LiveRangeConnector::ConnectRanges(Zone* local_zone) {
   for (TopLevelLiveRange* top_range : data()->live_ranges()) {
     CHECK_EQ(live_ranges_size,
              data()->live_ranges().size());  // TODO(neis): crbug.com/831822
-    if (top_range == nullptr) continue;
+    DCHECK_NOT_NULL(top_range);
     bool connect_spilled = top_range->IsSpilledOnlyInDeferredBlocks(data());
     LiveRange* first_range = top_range;
     for (LiveRange *second_range = first_range->next(); second_range != nullptr;
@@ -5114,8 +5102,8 @@ void LiveRangeConnector::ConnectRanges(Zone* local_zone) {
   }
 }
 
-void LiveRangeConnector::CommitSpillsInDeferredBlocks(
-    TopLevelLiveRange* range, LiveRangeBoundArray* array, Zone* temp_zone) {
+void LiveRangeConnector::CommitSpillsInDeferredBlocks(TopLevelLiveRange* range,
+                                                      Zone* temp_zone) {
   DCHECK(range->IsSpilledOnlyInDeferredBlocks(data()));
   DCHECK(!range->spilled());
 
@@ -5128,8 +5116,7 @@ void LiveRangeConnector::CommitSpillsInDeferredBlocks(
   // make sure we insert the spill.
   for (const LiveRange* child = range; child != nullptr;
        child = child->next()) {
-    for (const UsePosition* pos = child->first_pos(); pos != nullptr;
-         pos = pos->next()) {
+    for (const UsePosition* pos : child->positions()) {
       if (pos->type() != UsePositionType::kRequiresSlot && !child->spilled())
         continue;
       range->AddBlockRequiringSpillOperand(
@@ -5167,9 +5154,10 @@ void LiveRangeConnector::CommitSpillsInDeferredBlocks(
             LifetimePosition::InstructionFromInstructionIndex(
                 pred_block->last_instruction_index());
 
-        LiveRangeBound* bound = array->Find(pred_end);
+        LiveRange* child_range = range->GetChildCovers(pred_end);
+        DCHECK_NOT_NULL(child_range);
 
-        InstructionOperand pred_op = bound->range_->GetAssignedOperand();
+        InstructionOperand pred_op = child_range->GetAssignedOperand();
 
         RpoNumber spill_block_number = spill_block->rpo_number();
         if (done_moves.find(std::make_pair(
@@ -5188,7 +5176,6 @@ void LiveRangeConnector::CommitSpillsInDeferredBlocks(
 }
 
 #undef TRACE
-#undef TRACE_COND
 
 }  // namespace compiler
 }  // namespace internal
diff --git a/deps/v8/src/compiler/backend/register-allocator.h b/deps/v8/src/compiler/backend/register-allocator.h
index e7a228e6f91362..660c592e7db8dd 100644
--- a/deps/v8/src/compiler/backend/register-allocator.h
+++ b/deps/v8/src/compiler/backend/register-allocator.h
@@ -148,6 +148,7 @@ class LifetimePosition final {
     return this->value_ >= that.value_;
   }
 
+  // APIs to aid debugging. For general-stream APIs, use operator<<.
   void Print() const;
 
   static inline LifetimePosition Invalid() { return LifetimePosition(); }
@@ -174,11 +175,20 @@ class LifetimePosition final {
   int value_;
 };
 
-std::ostream& operator<<(std::ostream& os, const LifetimePosition pos);
-
-enum class RegisterAllocationFlag : unsigned { kTraceAllocation = 1 << 0 };
-
-using RegisterAllocationFlags = base::Flags<RegisterAllocationFlag>;
+inline std::ostream& operator<<(std::ostream& os, const LifetimePosition pos) {
+  os << '@' << pos.ToInstructionIndex();
+  if (pos.IsGapPosition()) {
+    os << 'g';
+  } else {
+    os << 'i';
+  }
+  if (pos.IsStart()) {
+    os << 's';
+  } else {
+    os << 'e';
+  }
+  return os;
+}
 
 class SpillRange;
 class LiveRange;
@@ -211,10 +221,6 @@ class TopTierRegisterAllocationData final : public RegisterAllocationData {
   // regular code (kSpillAtDefinition).
   enum SpillMode { kSpillAtDefinition, kSpillDeferred };
 
-  bool is_trace_alloc() {
-    return flags_ & RegisterAllocationFlag::kTraceAllocation;
-  }
-
   static constexpr int kNumberOfFixedRangesPerRegister = 2;
 
   class PhiMapValue : public ZoneObject {
@@ -254,7 +260,6 @@ class TopTierRegisterAllocationData final : public RegisterAllocationData {
   TopTierRegisterAllocationData(const RegisterConfiguration* config,
                                 Zone* allocation_zone, Frame* frame,
                                 InstructionSequence* code,
-                                RegisterAllocationFlags flags,
                                 TickCounter* tick_counter,
                                 const char* debug_name = nullptr);
 
@@ -288,7 +293,6 @@ class TopTierRegisterAllocationData final : public RegisterAllocationData {
   }
   ZoneVector<SparseBitVector*>& live_in_sets() { return live_in_sets_; }
   ZoneVector<SparseBitVector*>& live_out_sets() { return live_out_sets_; }
-  ZoneVector<SpillRange*>& spill_ranges() { return spill_ranges_; }
   DelayedReferences& delayed_references() { return delayed_references_; }
   InstructionSequence* code() const { return code_; }
   // This zone is for data structures only needed during register allocation
@@ -303,7 +307,7 @@ class TopTierRegisterAllocationData final : public RegisterAllocationData {
 
   MachineRepresentation RepresentationFor(int virtual_register);
 
-  TopLevelLiveRange* GetOrCreateLiveRangeFor(int index);
+  TopLevelLiveRange* GetLiveRangeFor(int index);
   // Creates a new live range.
   TopLevelLiveRange* NewLiveRange(int index, MachineRepresentation rep);
 
@@ -369,7 +373,6 @@ class TopTierRegisterAllocationData final : public RegisterAllocationData {
   ZoneVector<TopLevelLiveRange*> fixed_float_live_ranges_;
   ZoneVector<TopLevelLiveRange*> fixed_double_live_ranges_;
   ZoneVector<TopLevelLiveRange*> fixed_simd128_live_ranges_;
-  ZoneVector<SpillRange*> spill_ranges_;
   DelayedReferences delayed_references_;
   BitVector* assigned_registers_;
   BitVector* assigned_double_registers_;
@@ -380,37 +383,45 @@ class TopTierRegisterAllocationData final : public RegisterAllocationData {
   int virtual_register_count_;
   RangesWithPreassignedSlots preassigned_slot_ranges_;
   ZoneVector<ZoneVector<LiveRange*>> spill_state_;
-  RegisterAllocationFlags flags_;
   TickCounter* const tick_counter_;
   ZoneMap<TopLevelLiveRange*, AllocatedOperand*> slot_for_const_range_;
 };
 
 // Representation of the non-empty interval [start,end[.
-class UseInterval final : public ZoneObject {
+// This is a value class given that it only contains two (32-bit) positions.
+class UseInterval final {
  public:
   UseInterval(LifetimePosition start, LifetimePosition end)
-      : start_(start), end_(end), next_(nullptr) {
-    DCHECK(start < end);
+      : start_(start), end_(end) {
+    DCHECK_LT(start, end);
   }
-  UseInterval(const UseInterval&) = delete;
-  UseInterval& operator=(const UseInterval&) = delete;
 
   LifetimePosition start() const { return start_; }
-  void set_start(LifetimePosition start) { start_ = start; }
+  void set_start(LifetimePosition start) {
+    DCHECK_LT(start, end_);
+    start_ = start;
+  }
   LifetimePosition end() const { return end_; }
-  void set_end(LifetimePosition end) { end_ = end; }
-  UseInterval* next() const { return next_; }
-  void set_next(UseInterval* next) { next_ = next; }
+  void set_end(LifetimePosition end) {
+    DCHECK_LT(start_, end);
+    end_ = end;
+  }
 
   // Split this interval at the given position without effecting the
   // live range that owns it. The interval must contain the position.
-  UseInterval* SplitAt(LifetimePosition pos, Zone* zone);
+  UseInterval SplitAt(LifetimePosition pos) {
+    DCHECK(Contains(pos) && pos != start());
+    UseInterval after(pos, end_);
+    end_ = pos;
+    return after;
+  }
 
   // If this interval intersects with other return smallest position
   // that belongs to both of them.
-  LifetimePosition Intersect(const UseInterval* other) const {
-    if (other->start() < start_) return other->Intersect(this);
-    if (other->start() < end_) return other->start();
+  LifetimePosition Intersect(const UseInterval& other) const {
+    LifetimePosition intersection_start = std::max(start_, other.start_);
+    LifetimePosition intersection_end = std::min(end_, other.end_);
+    if (intersection_start < intersection_end) return intersection_start;
     return LifetimePosition::Invalid();
   }
 
@@ -436,10 +447,22 @@ class UseInterval final : public ZoneObject {
     return ret;
   }
 
+  bool operator==(const UseInterval& other) const {
+    return std::tie(start_, end_) == std::tie(other.start_, other.end_);
+  }
+  bool operator!=(const UseInterval& other) const { return !(*this == other); }
+
+  bool operator<(const UseInterval& other) const {
+    return start_ < other.start_;
+  }
+
+  void PrettyPrint(std::ostream& os) const {
+    os << '[' << start() << ", " << end() << ')';
+  }
+
  private:
   LifetimePosition start_;
   LifetimePosition end_;
-  UseInterval* next_;
 };
 
 enum class UsePositionType : uint8_t {
@@ -481,9 +504,6 @@ class V8_EXPORT_PRIVATE UsePosition final
 
   LifetimePosition pos() const { return pos_; }
 
-  UsePosition* next() const { return next_; }
-  void set_next(UsePosition* next) { next_ = next; }
-
   // For hinting only.
   void set_assigned_register(int register_code) {
     flags_ = AssignedRegisterField::update(flags_, register_code);
@@ -504,6 +524,12 @@ class V8_EXPORT_PRIVATE UsePosition final
   }
   static UsePositionHintType HintTypeForOperand(const InstructionOperand& op);
 
+  struct Ordering {
+    bool operator()(const UsePosition* left, const UsePosition* right) const {
+      return left->pos() < right->pos();
+    }
+  };
+
  private:
   using TypeField = base::BitField<UsePositionType, 0, 2>;
   using HintTypeField = base::BitField<UsePositionHintType, 2, 3>;
@@ -513,7 +539,6 @@ class V8_EXPORT_PRIVATE UsePosition final
 
   InstructionOperand* const operand_;
   void* hint_;
-  UsePosition* next_;
   LifetimePosition const pos_;
   uint32_t flags_;
 };
@@ -523,6 +548,253 @@ class TopTierRegisterAllocationData;
 class TopLevelLiveRange;
 class LiveRangeBundle;
 
+enum GrowthDirection { kFront, kFrontOrBack };
+
+// A data structure that:
+// - Allocates its elements in the Zone.
+// - Has O(1) random access.
+// - Inserts at the front are O(1) (asymptotically).
+// - Can be split efficiently into two halves, and merged again efficiently
+//   if those were not modified in the meantime.
+// - Has empty storage at the front and back, such that split halves both
+//   can perform inserts without reallocating.
+template <typename T>
+class DoubleEndedSplitVector {
+ public:
+  using value_type = T;
+  using iterator = T*;
+  using const_iterator = const T*;
+
+  // This allows us to skip calling destructors and use simple copies,
+  // which is sufficient for the exclusive use here in the register allocator.
+  ASSERT_TRIVIALLY_COPYABLE(T);
+  static_assert(std::is_trivially_destructible<T>::value);
+
+  size_t size() const { return data_end_ - data_begin_; }
+  bool empty() const { return size() == 0; }
+  size_t capacity() const { return storage_end_ - storage_begin_; }
+
+  T* data() const { return data_begin_; }
+
+  void clear() { data_begin_ = data_end_; }
+
+  T& operator[](size_t position) {
+    DCHECK_LT(position, size());
+    return data_begin_[position];
+  }
+  const T& operator[](size_t position) const {
+    DCHECK_LT(position, size());
+    return data_begin_[position];
+  }
+
+  iterator begin() { return data_begin_; }
+  const_iterator begin() const { return data_begin_; }
+  iterator end() { return data_end_; }
+  const_iterator end() const { return data_end_; }
+
+  T& front() {
+    DCHECK(!empty());
+    return *begin();
+  }
+  const T& front() const {
+    DCHECK(!empty());
+    return *begin();
+  }
+  T& back() {
+    DCHECK(!empty());
+    return *std::prev(end());
+  }
+  const T& back() const {
+    DCHECK(!empty());
+    return *std::prev(end());
+  }
+
+  void push_front(Zone* zone, const T& value) {
+    EnsureOneMoreCapacityAt<kFront>(zone);
+    --data_begin_;
+    *data_begin_ = value;
+  }
+  void pop_front() {
+    DCHECK(!empty());
+    ++data_begin_;
+  }
+
+  // This can be configured to arrange the data in the middle of the backing
+  // store (`kFrontOrBack`, default), or at the end of the backing store, if
+  // subsequent inserts are mostly at the front (`kFront`).
+  template <GrowthDirection direction = kFrontOrBack>
+  iterator insert(Zone* zone, const_iterator position, const T& value) {
+    DCHECK_LE(begin(), position);
+    DCHECK_LE(position, end());
+    size_t old_size = size();
+
+    size_t insert_index = position - data_begin_;
+    EnsureOneMoreCapacityAt<direction>(zone);
+
+    // Make space for the insertion.
+    // Copy towards the end with more remaining space, such that over time
+    // the data is roughly centered, which is beneficial in case of splitting.
+    if (direction == kFront || space_at_front() >= space_at_back()) {
+      // Copy to the left.
+      DCHECK_GT(space_at_front(), 0);
+      T* copy_src_begin = data_begin_;
+      T* copy_src_end = data_begin_ + insert_index;
+      --data_begin_;
+      std::copy(copy_src_begin, copy_src_end, data_begin_);
+    } else {
+      // Copy to the right.
+      DCHECK_GT(space_at_back(), 0);
+      T* copy_src_begin = data_begin_ + insert_index;
+      T* copy_src_end = data_end_;
+      ++data_end_;
+      std::copy_backward(copy_src_begin, copy_src_end, data_end_);
+    }
+
+    T* insert_position = data_begin_ + insert_index;
+    *insert_position = value;
+
+#ifdef DEBUG
+    Verify();
+#endif
+    DCHECK_LE(begin(), insert_position);
+    DCHECK_LT(insert_position, end());
+    DCHECK_EQ(size(), old_size + 1);
+    USE(old_size);
+
+    return insert_position;
+  }
+
+  // Returns a split-off vector from `split_begin` to `end()`.
+  // Afterwards, `this` ends just before `split_begin`.
+  // This does not allocate; it instead splits the backing store in two halves.
+  DoubleEndedSplitVector<T> SplitAt(const_iterator split_begin_const) {
+    iterator split_begin = const_cast<iterator>(split_begin_const);
+
+    DCHECK_LE(data_begin_, split_begin);
+    DCHECK_LE(split_begin, data_end_);
+    size_t old_size = size();
+
+    // NOTE: The splitted allocation might no longer fulfill alignment
+    // requirements by the Zone allocator, so do not delete it!
+    DoubleEndedSplitVector split_off;
+    split_off.storage_begin_ = split_begin;
+    split_off.data_begin_ = split_begin;
+    split_off.data_end_ = data_end_;
+    split_off.storage_end_ = storage_end_;
+    data_end_ = split_begin;
+    storage_end_ = split_begin;
+
+#ifdef DEBUG
+    Verify();
+    split_off.Verify();
+#endif
+    DCHECK_EQ(size() + split_off.size(), old_size);
+    USE(old_size);
+
+    return split_off;
+  }
+
+  // Appends the elements from `other` after the end of `this`.
+  // In particular if `other` is directly adjacent to `this`, it does not
+  // allocate or copy.
+  void Append(Zone* zone, DoubleEndedSplitVector<T> other) {
+    if (data_end_ == other.data_begin_) {
+      // The `other`s elements are directly adjacent to ours, so just extend
+      // our storage to encompass them.
+      // This could happen if `other` comes from an earlier `this->SplitAt()`.
+      // For the usage here in the register allocator, this is always the case.
+      DCHECK_EQ(other.storage_begin_, other.data_begin_);
+      DCHECK_EQ(data_end_, storage_end_);
+      data_end_ = other.data_end_;
+      storage_end_ = other.storage_end_;
+      return;
+    }
+
+    // General case: Copy into newly allocated vector.
+    // TODO(dlehmann): One could check if `this` or `other` has enough capacity
+    // such that one can avoid the allocation, but currently we never reach
+    // this path anyway.
+    DoubleEndedSplitVector<T> result;
+    size_t merged_size = this->size() + other.size();
+    result.GrowAt<kFront>(zone, merged_size);
+
+    result.data_begin_ -= merged_size;
+    std::copy(this->begin(), this->end(), result.data_begin_);
+    std::copy(other.begin(), other.end(), result.data_begin_ + this->size());
+    DCHECK_EQ(result.data_begin_ + merged_size, result.data_end_);
+
+    *this = std::move(result);
+
+#ifdef DEBUG
+    Verify();
+#endif
+    DCHECK_EQ(size(), merged_size);
+  }
+
+ private:
+  static constexpr size_t kMinCapacity = 2;
+
+  size_t space_at_front() const { return data_begin_ - storage_begin_; }
+  size_t space_at_back() const { return storage_end_ - data_end_; }
+
+  template <GrowthDirection direction>
+  V8_INLINE void EnsureOneMoreCapacityAt(Zone* zone) {
+    if constexpr (direction == kFront) {
+      if (V8_LIKELY(space_at_front() > 0)) return;
+      GrowAt<kFront>(zone, capacity() * 2);
+      DCHECK_GT(space_at_front(), 0);
+    } else {
+      if (V8_LIKELY(space_at_front() > 0 || space_at_back() > 0)) return;
+      GrowAt<kFrontOrBack>(zone, capacity() * 2);
+      DCHECK(space_at_front() > 0 || space_at_back() > 0);
+    }
+  }
+
+  template <GrowthDirection direction>
+  V8_NOINLINE V8_PRESERVE_MOST void GrowAt(Zone* zone,
+                                           size_t new_minimum_capacity) {
+    DoubleEndedSplitVector<T> old = std::move(*this);
+
+    size_t new_capacity = std::max(kMinCapacity, new_minimum_capacity);
+    storage_begin_ = zone->AllocateArray<T>(new_capacity);
+    storage_end_ = storage_begin_ + new_capacity;
+
+    size_t remaining_capacity = new_capacity - old.size();
+    size_t remaining_capacity_front =
+        direction == kFront ? remaining_capacity : remaining_capacity / 2;
+
+    data_begin_ = storage_begin_ + remaining_capacity_front;
+    data_end_ = data_begin_ + old.size();
+    std::copy(old.begin(), old.end(), data_begin_);
+
+#ifdef DEBUG
+    Verify();
+#endif
+    DCHECK_EQ(size(), old.size());
+  }
+
+#ifdef DEBUG
+  void Verify() const {
+    DCHECK_LE(storage_begin_, data_begin_);
+    DCHECK_LE(data_begin_, data_end_);
+    DCHECK_LE(data_end_, storage_end_);
+  }
+#endif
+
+  // Do not store a pointer to the `Zone` to save memory when there are very
+  // many `LiveRange`s (which each contain this vector twice).
+  // It makes the API a bit cumbersome, because the Zone has to be explicitly
+  // passed around, but is worth the 1-3% of max zone memory reduction.
+
+  T* storage_begin_ = nullptr;
+  T* data_begin_ = nullptr;
+  T* data_end_ = nullptr;
+  T* storage_end_ = nullptr;
+};
+
+using UseIntervalVector = DoubleEndedSplitVector<UseInterval>;
+using UsePositionVector = DoubleEndedSplitVector<UsePosition*>;
+
 // Representation of SSA values' live ranges as a collection of (continuous)
 // intervals over the instruction ordering.
 class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
@@ -530,8 +802,9 @@ class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
   LiveRange(const LiveRange&) = delete;
   LiveRange& operator=(const LiveRange&) = delete;
 
-  UseInterval* first_interval() const { return first_interval_; }
-  UsePosition* first_pos() const { return first_pos_; }
+  const UseIntervalVector& intervals() const { return intervals_; }
+  base::Vector<UsePosition*> positions() const { return positions_span_; }
+
   TopLevelLiveRange* TopLevel() { return top_level_; }
   const TopLevelLiveRange* TopLevel() const { return top_level_; }
 
@@ -541,7 +814,7 @@ class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
 
   int relative_id() const { return relative_id_; }
 
-  bool IsEmpty() const { return first_interval() == nullptr; }
+  bool IsEmpty() const { return intervals_.empty(); }
 
   InstructionOperand GetAssignedOperand() const;
 
@@ -574,7 +847,7 @@ class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
     return false;
   }
   bool spilled() const { return SpilledField::decode(bits_); }
-  void AttachToNext();
+  void AttachToNext(Zone* zone);
   void Unspill();
   void Spill();
 
@@ -582,15 +855,12 @@ class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
 
   // Returns use position in this live range that follows both start
   // and last processed use position.
-  UsePosition* NextUsePosition(LifetimePosition start) const;
+  UsePosition* const* NextUsePosition(LifetimePosition start) const;
 
   // Returns use position for which register is required in this live
   // range and which follows both start and last processed use position
   UsePosition* NextRegisterPosition(LifetimePosition start) const;
 
-  // Returns the first use position requiring stack slot, or nullptr.
-  UsePosition* NextSlotPosition(LifetimePosition start) const;
-
   // Returns use position for which register is beneficial in this live
   // range and which follows both start and last processed use position
   UsePosition* NextUsePositionRegisterIsBeneficial(
@@ -601,11 +871,6 @@ class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
   LifetimePosition NextLifetimePositionRegisterIsBeneficial(
       const LifetimePosition& start) const;
 
-  // Returns use position for which register is beneficial in this live
-  // range and which precedes start.
-  UsePosition* PreviousUsePositionRegisterIsBeneficial(
-      LifetimePosition start) const;
-
   // Returns use position for which spilling is detrimental in this live
   // range and which follows both start and last processed use position
   UsePosition* NextUsePositionSpillDetrimental(LifetimePosition start) const;
@@ -613,70 +878,58 @@ class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
   // Can this live range be spilled at this position.
   bool CanBeSpilled(LifetimePosition pos) const;
 
-  // Splitting primitive used by splitting members.
-  // Performs the split, but does not link the resulting ranges.
-  // The given position must follow the start of the range.
+  // Splits this live range and links the resulting ranges together.
+  // Returns the child, which starts at position.
   // All uses following the given position will be moved from this
   // live range to the result live range.
   // The current range will terminate at position, while result will start from
   // position.
-  enum HintConnectionOption : bool {
-    DoNotConnectHints = false,
-    ConnectHints = true
-  };
-  UsePosition* DetachAt(LifetimePosition position, LiveRange* result,
-                        Zone* zone, HintConnectionOption connect_hints);
-
-  // Detaches at position, and then links the resulting ranges. Returns the
-  // child, which starts at position.
   LiveRange* SplitAt(LifetimePosition position, Zone* zone);
 
-  // Returns nullptr when no register is hinted, otherwise sets register_index.
+  // Returns false when no register is hinted, otherwise sets register_index.
   // Uses {current_hint_position_} as a cache, and tries to update it.
-  UsePosition* FirstHintPosition(int* register_index);
-  UsePosition* FirstHintPosition() {
-    int register_index;
-    return FirstHintPosition(&register_index);
-  }
+  bool RegisterFromFirstHint(int* register_index);
 
   UsePosition* current_hint_position() const {
-    return current_hint_position_;
+    return positions_span_[current_hint_position_index_];
   }
 
   LifetimePosition Start() const {
     DCHECK(!IsEmpty());
-    return first_interval()->start();
+    DCHECK_EQ(start_, intervals_.front().start());
+    return start_;
   }
 
   LifetimePosition End() const {
     DCHECK(!IsEmpty());
-    return last_interval_->end();
+    DCHECK_EQ(end_, intervals_.back().end());
+    return end_;
   }
 
   bool ShouldBeAllocatedBefore(const LiveRange* other) const;
   bool CanCover(LifetimePosition position) const;
-  bool Covers(LifetimePosition position) const;
+  bool Covers(LifetimePosition position);
   LifetimePosition NextStartAfter(LifetimePosition position);
-  LifetimePosition NextEndAfter(LifetimePosition position) const;
-  LifetimePosition FirstIntersection(LiveRange* other) const;
+  LifetimePosition NextEndAfter(LifetimePosition position);
+  LifetimePosition FirstIntersection(LiveRange* other);
   LifetimePosition NextStart() const { return next_start_; }
 
+#ifdef DEBUG
   void VerifyChildStructure() const {
     VerifyIntervals();
     VerifyPositions();
   }
+#endif
 
   void ConvertUsesToOperand(const InstructionOperand& op,
                             const InstructionOperand& spill_op);
   void SetUseHints(int register_index);
   void UnsetUseHints() { SetUseHints(kUnassignedRegister); }
-  void ResetCurrentHintPosition() { current_hint_position_ = first_pos_; }
+  void ResetCurrentHintPosition() { current_hint_position_index_ = 0; }
 
   void Print(const RegisterConfiguration* config, bool with_children) const;
   void Print(bool with_children) const;
 
-  void set_bundle(LiveRangeBundle* bundle) { bundle_ = bundle; }
-  LiveRangeBundle* get_bundle() const { return bundle_; }
   bool RegisterFromBundle(int* hint) const;
   void UpdateBundleRegister(int reg) const;
 
@@ -687,16 +940,17 @@ class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
   explicit LiveRange(int relative_id, MachineRepresentation rep,
                      TopLevelLiveRange* top_level);
 
-  void UpdateParentForAllChildren(TopLevelLiveRange* new_top_level);
-
   void set_spilled(bool value) { bits_ = SpilledField::update(bits_, value); }
 
-  UseInterval* FirstSearchIntervalForPosition(LifetimePosition position) const;
-  void AdvanceLastProcessedMarker(UseInterval* to_start_of,
-                                  LifetimePosition but_not_past) const;
+  UseIntervalVector::iterator FirstSearchIntervalForPosition(
+      LifetimePosition position);
+  void AdvanceLastProcessedMarker(UseIntervalVector::iterator to_start_of,
+                                  LifetimePosition but_not_past);
 
+#ifdef DEBUG
   void VerifyPositions() const;
   void VerifyIntervals() const;
+#endif
 
   using SpilledField = base::BitField<bool, 0, 1>;
   // Bits (1,7[ are used by TopLevelLiveRange.
@@ -709,20 +963,31 @@ class V8_EXPORT_PRIVATE LiveRange : public NON_EXPORTED_BASE(ZoneObject) {
   // Unique among children of the same virtual register.
   int relative_id_;
   uint32_t bits_;
-  UseInterval* last_interval_;
-  UseInterval* first_interval_;
-  UsePosition* first_pos_;
+
+  UseIntervalVector intervals_;
+  // This is a view into the `positions_` owned by the `TopLevelLiveRange`.
+  // This allows cheap splitting and merging of `LiveRange`s.
+  base::Vector<UsePosition*> positions_span_;
+
   TopLevelLiveRange* top_level_;
+  // TODO(dlehmann): Remove linked list fully and instead use only the
+  // `TopLevelLiveRange::children_` vector. This requires API changes to
+  // `SplitAt` and `AttachToNext`, as they need access to a vector iterator.
   LiveRange* next_;
-  // This is used as a cache, it doesn't affect correctness.
-  mutable UseInterval* current_interval_;
-  // This is used as a cache, it doesn't affect correctness.
-  mutable UsePosition* last_processed_use_;
-  // This is used as a cache in BuildLiveRanges and during register allocation.
-  UsePosition* current_hint_position_;
-  LiveRangeBundle* bundle_ = nullptr;
+
+  // This is used as a cache in `FirstSearchIntervalForPosition`.
+  UseIntervalVector::iterator current_interval_;
+  // This is used as a cache in `BuildLiveRanges` and during register
+  // allocation.
+  size_t current_hint_position_index_ = 0;
+
   // Next interval start, relative to the current linear scan position.
   LifetimePosition next_start_;
+
+  // Just a cache for `Start()` and `End()` that improves locality
+  // (i.e., one less pointer indirection).
+  LifetimePosition start_;
+  LifetimePosition end_;
 };
 
 struct LiveRangeOrdering {
@@ -735,69 +1000,31 @@ struct LiveRangeOrdering {
 // same spill slot or reuse the same register for connected live ranges.
 class LiveRangeBundle : public ZoneObject {
  public:
-  void MergeSpillRangesAndClear();
-
-  int id() { return id_; }
+  explicit LiveRangeBundle(Zone* zone, int id)
+      : ranges_(zone), intervals_(zone), id_(id) {}
 
-  int reg() { return reg_; }
+  int id() const { return id_; }
 
+  int reg() const { return reg_; }
   void set_reg(int reg) {
     DCHECK_EQ(reg_, kUnassignedRegister);
     reg_ = reg;
   }
 
- private:
-  friend class BundleBuilder;
-  friend Zone;
-
-  // Representation of the non-empty interval [start,end[.
-  class Range {
-   public:
-    Range(int s, int e) : start(s), end(e) {}
-    Range(LifetimePosition s, LifetimePosition e)
-        : start(s.value()), end(e.value()) {}
-    int start;
-    int end;
-  };
-
-  struct RangeOrdering {
-    bool operator()(const Range left, const Range right) const {
-      return left.start < right.start;
-    }
-  };
-  bool UsesOverlap(UseInterval* interval) {
-    auto use = uses_.begin();
-    while (interval != nullptr && use != uses_.end()) {
-      if (use->end <= interval->start().value()) {
-        ++use;
-      } else if (interval->end().value() <= use->start) {
-        interval = interval->next();
-      } else {
-        return true;
-      }
-    }
-    return false;
-  }
-  void InsertUses(UseInterval* interval) {
-    while (interval != nullptr) {
-      auto done = uses_.insert({interval->start(), interval->end()});
-      USE(done);
-      DCHECK_EQ(done.second, 1);
-      interval = interval->next();
-    }
-  }
-  explicit LiveRangeBundle(Zone* zone, int id)
-      : ranges_(zone), uses_(zone), id_(id) {}
-
-  bool TryAddRange(LiveRange* range);
-
+  void MergeSpillRangesAndClear();
+  bool TryAddRange(TopLevelLiveRange* range);
   // If merging is possible, merge either {lhs} into {rhs} or {rhs} into
   // {lhs}, clear the source and return the result. Otherwise return nullptr.
-  static LiveRangeBundle* TryMerge(LiveRangeBundle* lhs, LiveRangeBundle* rhs,
-                                   bool trace_alloc);
+  static LiveRangeBundle* TryMerge(LiveRangeBundle* lhs, LiveRangeBundle* rhs);
+
+ private:
+  void AddRange(TopLevelLiveRange* range);
+
+  // A flat set, sorted by `LiveRangeOrdering`.
+  ZoneVector<TopLevelLiveRange*> ranges_;
+  // A flat set, sorted by their `start()` position.
+  ZoneVector<UseInterval> intervals_;
 
-  ZoneSet<LiveRange*, LiveRangeOrdering> ranges_;
-  ZoneSet<Range, RangeOrdering> uses_;
   int id_;
   int reg_ = kUnassignedRegister;
 };
@@ -808,7 +1035,7 @@ class LiveRangeBundle : public ZoneObject {
 // TopLevelLiveRange.
 class V8_EXPORT_PRIVATE TopLevelLiveRange final : public LiveRange {
  public:
-  explicit TopLevelLiveRange(int vreg, MachineRepresentation rep);
+  explicit TopLevelLiveRange(int vreg, MachineRepresentation rep, Zone* zone);
   TopLevelLiveRange(const TopLevelLiveRange&) = delete;
   TopLevelLiveRange& operator=(const TopLevelLiveRange&) = delete;
 
@@ -852,14 +1079,12 @@ class V8_EXPORT_PRIVATE TopLevelLiveRange final : public LiveRange {
   SlotUseKind slot_use_kind() const { return HasSlotUseField::decode(bits_); }
 
   // Add a new interval or a new use position to this live range.
-  void EnsureInterval(LifetimePosition start, LifetimePosition end, Zone* zone,
-                      bool trace_alloc);
-  void AddUseInterval(LifetimePosition start, LifetimePosition end, Zone* zone,
-                      bool trace_alloc);
-  void AddUsePosition(UsePosition* pos, bool trace_alloc);
+  void EnsureInterval(LifetimePosition start, LifetimePosition end, Zone* zone);
+  void AddUseInterval(LifetimePosition start, LifetimePosition end, Zone* zone);
+  void AddUsePosition(UsePosition* pos, Zone* zone);
 
   // Shorten the most recently added interval by setting a new start.
-  void ShortenTo(LifetimePosition start, bool trace_alloc);
+  void ShortenTo(LifetimePosition start);
 
   // Spill range management.
   void SetSpillRange(SpillRange* spill_range);
@@ -965,18 +1190,18 @@ class V8_EXPORT_PRIVATE TopLevelLiveRange final : public LiveRange {
   void UpdateSpillRangePostMerge(TopLevelLiveRange* merged);
   int vreg() const { return vreg_; }
 
+#ifdef DEBUG
   void Verify() const;
   void VerifyChildrenInOrder() const;
+#endif
 
-  // Returns the LiveRange covering the given position, or nullptr if no such
-  // range exists. Uses a linear search through child ranges. The range at the
-  // previously requested position is cached, so this function will be very fast
-  // if you call it with a non-decreasing sequence of positions.
+  // Returns the child `LiveRange` covering the given position, or `nullptr`
+  // if no such range exists. Uses a binary search.
   LiveRange* GetChildCovers(LifetimePosition pos);
 
-  int GetNextChildId() { return ++last_child_id_; }
+  const ZoneVector<LiveRange*>& Children() const { return children_; }
 
-  int GetMaxChildCount() const { return last_child_id_ + 1; }
+  int GetNextChildId() { return ++last_child_id_; }
 
   bool IsSpilledOnlyInDeferredBlocks(
       const TopTierRegisterAllocationData* data) const {
@@ -1026,6 +1251,9 @@ class V8_EXPORT_PRIVATE TopLevelLiveRange final : public LiveRange {
     return list_of_blocks_requiring_spill_operands_;
   }
 
+  LiveRangeBundle* get_bundle() const { return bundle_; }
+  void set_bundle(LiveRangeBundle* bundle) { bundle_ = bundle; }
+
  private:
   friend class LiveRange;
 
@@ -1058,14 +1286,20 @@ class V8_EXPORT_PRIVATE TopLevelLiveRange final : public LiveRange {
     SparseBitVector* list_of_blocks_requiring_spill_operands_;
   };
 
+  LiveRangeBundle* bundle_ = nullptr;
+
+  UsePositionVector positions_;
+
+  // This is a cache for the binary search in `GetChildCovers`.
+  // The `LiveRange`s are sorted by their `Start()` position.
+  ZoneVector<LiveRange*> children_;
+
   // TODO(mtrofin): generalize spilling after definition, currently specialized
   // just for spill in a single deferred block.
   bool spilled_in_deferred_blocks_;
   bool has_preassigned_slot_;
 
   int spill_start_index_;
-  UsePosition* last_pos_;
-  LiveRange* last_child_covers_;
 };
 
 struct PrintableLiveRange {
@@ -1079,16 +1313,20 @@ std::ostream& operator<<(std::ostream& os,
 // Represent the spill operand of a LiveRange and its use intervals. After
 // register allocation, disjoint spill ranges are merged and they get assigned
 // the same spill slot by OperandAssigner::AssignSpillSlots().
+// TODO(dlehmann): `SpillRange`s seem awefully similar to `LiveRangeBundle`s,
+// especially since both store `ranges_` and `intervals_` and check for
+// intersection in exactly the same way. I wonder if we can merge those two
+// concepts and save a bunch of memory by not storing ranges and intervals
+// twice.
 class SpillRange final : public ZoneObject {
  public:
   static const int kUnassignedSlot = -1;
+
   SpillRange(TopLevelLiveRange* range, Zone* zone);
   SpillRange(const SpillRange&) = delete;
   SpillRange& operator=(const SpillRange&) = delete;
 
-  UseInterval* interval() const { return use_interval_; }
-
-  bool IsEmpty() const { return live_ranges_.empty(); }
+  bool IsEmpty() const { return ranges_.empty(); }
   bool TryMerge(SpillRange* other);
   bool HasSlot() const { return assigned_slot_ != kUnassignedSlot; }
 
@@ -1096,95 +1334,25 @@ class SpillRange final : public ZoneObject {
     DCHECK_EQ(kUnassignedSlot, assigned_slot_);
     assigned_slot_ = index;
   }
-  int assigned_slot() {
+  int assigned_slot() const {
     DCHECK_NE(kUnassignedSlot, assigned_slot_);
     return assigned_slot_;
   }
-  const ZoneVector<TopLevelLiveRange*>& live_ranges() const {
-    return live_ranges_;
-  }
-  ZoneVector<TopLevelLiveRange*>& live_ranges() { return live_ranges_; }
+
   // Spill slots can be 4, 8, or 16 bytes wide.
   int byte_width() const { return byte_width_; }
+
   void Print() const;
 
  private:
-  LifetimePosition End() const { return end_position_; }
-  bool IsIntersectingWith(SpillRange* other) const;
-  // Merge intervals, making sure the use intervals are sorted
-  void MergeDisjointIntervals(UseInterval* other);
+  ZoneVector<TopLevelLiveRange*> ranges_;
+  // A flat set, sorted by their `start()` position.
+  ZoneVector<UseInterval> intervals_;
 
-  ZoneVector<TopLevelLiveRange*> live_ranges_;
-  UseInterval* use_interval_;
-  LifetimePosition end_position_;
   int assigned_slot_;
   int byte_width_;
 };
 
-// A live range with the start and end position, and helper methods for the
-// ResolveControlFlow phase.
-class LiveRangeBound {
- public:
-  explicit LiveRangeBound(LiveRange* range, bool skip)
-      : range_(range), start_(range->Start()), end_(range->End()), skip_(skip) {
-    DCHECK(!range->IsEmpty());
-  }
-  LiveRangeBound(const LiveRangeBound&) = delete;
-  LiveRangeBound& operator=(const LiveRangeBound&) = delete;
-
-  bool CanCover(LifetimePosition position) {
-    return start_ <= position && position < end_;
-  }
-
-  LiveRange* const range_;
-  const LifetimePosition start_;
-  const LifetimePosition end_;
-  const bool skip_;
-};
-
-struct FindResult {
-  LiveRange* cur_cover_;
-  LiveRange* pred_cover_;
-};
-
-// An array of LiveRangeBounds belonging to the same TopLevelLiveRange. Sorted
-// by their start position for quick binary search.
-class LiveRangeBoundArray {
- public:
-  LiveRangeBoundArray() : length_(0), start_(nullptr) {}
-  LiveRangeBoundArray(const LiveRangeBoundArray&) = delete;
-  LiveRangeBoundArray& operator=(const LiveRangeBoundArray&) = delete;
-
-  bool ShouldInitialize() { return start_ == nullptr; }
-  void Initialize(Zone* zone, TopLevelLiveRange* range);
-  LiveRangeBound* Find(const LifetimePosition position) const;
-  LiveRangeBound* FindPred(const InstructionBlock* pred);
-  LiveRangeBound* FindSucc(const InstructionBlock* succ);
-  bool FindConnectableSubranges(const InstructionBlock* block,
-                                const InstructionBlock* pred,
-                                FindResult* result) const;
-
- private:
-  size_t length_;
-  LiveRangeBound* start_;
-};
-
-class LiveRangeFinder {
- public:
-  explicit LiveRangeFinder(const TopTierRegisterAllocationData* data,
-                           Zone* zone);
-  LiveRangeFinder(const LiveRangeFinder&) = delete;
-  LiveRangeFinder& operator=(const LiveRangeFinder&) = delete;
-
-  LiveRangeBoundArray* ArrayFor(int operand_index);
-
- private:
-  const TopTierRegisterAllocationData* const data_;
-  const int bounds_length_;
-  LiveRangeBoundArray* const bounds_;
-  Zone* const zone_;
-};
-
 class ConstraintBuilder final : public ZoneObject {
  public:
   explicit ConstraintBuilder(TopTierRegisterAllocationData* data);
@@ -1241,12 +1409,15 @@ class LiveRangeBuilder final : public ZoneObject {
     return data()->live_in_sets();
   }
 
+#ifdef DEBUG
   // Verification.
   void Verify() const;
-  bool IntervalStartsAtBlockBoundary(const UseInterval* interval) const;
-  bool IntervalPredecessorsCoveredByRange(const UseInterval* interval,
-                                          const TopLevelLiveRange* range) const;
-  bool NextIntervalStartsInDifferentBlocks(const UseInterval* interval) const;
+  bool IntervalStartsAtBlockBoundary(UseInterval interval) const;
+  bool IntervalPredecessorsCoveredByRange(UseInterval interval,
+                                          TopLevelLiveRange* range) const;
+  bool NextIntervalStartsInDifferentBlocks(UseInterval interval,
+                                           UseInterval next) const;
+#endif
 
   // Liveness analysis support.
   void AddInitialIntervals(const InstructionBlock* block,
@@ -1385,6 +1556,13 @@ class RegisterAllocator : public ZoneObject {
   bool no_combining_;
 };
 
+// A map from `TopLevelLiveRange`s to their expected physical register.
+// Typically this is very small, e.g., on JetStream2 it has 3 elements or less
+// >50% of the times it is queried, 8 elements or less >90% of the times,
+// and never more than 15 elements. Hence this is backed by a `SmallZoneMap`.
+using RangeRegisterSmallMap =
+    SmallZoneMap<TopLevelLiveRange*, /* expected_register */ int, 16>;
+
 class LinearScanAllocator final : public RegisterAllocator {
  public:
   LinearScanAllocator(TopTierRegisterAllocationData* data, RegisterKind kind,
@@ -1396,40 +1574,14 @@ class LinearScanAllocator final : public RegisterAllocator {
   void AllocateRegisters();
 
  private:
-  struct RangeWithRegister {
-    TopLevelLiveRange* range;
-    int expected_register;
-    struct Hash {
-      size_t operator()(const RangeWithRegister item) const {
-        return item.range->vreg();
-      }
-    };
-    struct Equals {
-      bool operator()(const RangeWithRegister one,
-                      const RangeWithRegister two) const {
-        return one.range == two.range;
-      }
-    };
-
-    explicit RangeWithRegister(LiveRange* a_range)
-        : range(a_range->TopLevel()),
-          expected_register(a_range->assigned_register()) {}
-    RangeWithRegister(TopLevelLiveRange* toplevel, int reg)
-        : range(toplevel), expected_register(reg) {}
-  };
-
-  using RangeWithRegisterSet =
-      ZoneUnorderedSet<RangeWithRegister, RangeWithRegister::Hash,
-                       RangeWithRegister::Equals>;
-
   void MaybeSpillPreviousRanges(LiveRange* begin_range,
                                 LifetimePosition begin_pos,
                                 LiveRange* end_range);
-  void MaybeUndoPreviousSplit(LiveRange* range);
-  void SpillNotLiveRanges(RangeWithRegisterSet* to_be_live,
+  void MaybeUndoPreviousSplit(LiveRange* range, Zone* zone);
+  void SpillNotLiveRanges(RangeRegisterSmallMap& to_be_live,
                           LifetimePosition position, SpillMode spill_mode);
   LiveRange* AssignRegisterOnReload(LiveRange* range, int reg);
-  void ReloadLiveRanges(RangeWithRegisterSet const& to_be_live,
+  void ReloadLiveRanges(RangeRegisterSmallMap const& to_be_live,
                         LifetimePosition position);
 
   void UpdateDeferredFixedRanges(SpillMode spill_mode, InstructionBlock* block);
@@ -1449,10 +1601,15 @@ class LinearScanAllocator final : public RegisterAllocator {
     }
   };
 
+  // NOTE: We also tried a sorted ZoneVector instead of a `ZoneMultiset`
+  // (like for `InactiveLiveRangeQueue`), but it does not improve performance
+  // or max memory usage.
+  // TODO(dlehmann): Try `std::priority_queue`/`std::make_heap` instead.
   using UnhandledLiveRangeQueue =
       ZoneMultiset<LiveRange*, UnhandledLiveRangeOrdering>;
-  using InactiveLiveRangeQueue =
-      ZoneMultiset<LiveRange*, InactiveLiveRangeOrdering>;
+  // Sorted by `InactiveLiveRangeOrdering`.
+  // TODO(dlehmann): Try `std::priority_queue`/`std::make_heap` instead.
+  using InactiveLiveRangeQueue = ZoneVector<LiveRange*>;
   UnhandledLiveRangeQueue& unhandled_live_ranges() {
     return unhandled_live_ranges_;
   }
@@ -1460,6 +1617,17 @@ class LinearScanAllocator final : public RegisterAllocator {
   InactiveLiveRangeQueue& inactive_live_ranges(int reg) {
     return inactive_live_ranges_[reg];
   }
+  // At several places in the register allocator we rely on inactive live ranges
+  // being sorted. Previously, this was always true by using a std::multiset.
+  // But to improve performance and in particular reduce memory usage, we
+  // switched to a sorted vector.
+  // Insert this to ensure we don't violate the sorted assumption, and to
+  // document where we actually rely on inactive live ranges being sorted.
+  void SlowDCheckInactiveLiveRangesIsSorted(int reg) {
+    SLOW_DCHECK(std::is_sorted(inactive_live_ranges(reg).begin(),
+                               inactive_live_ranges(reg).end(),
+                               InactiveLiveRangeOrdering()));
+  }
 
   void SetLiveRangeAssignedRegister(LiveRange* range, int reg);
 
@@ -1487,9 +1655,9 @@ class LinearScanAllocator final : public RegisterAllocator {
   RpoNumber ChooseOneOfTwoPredecessorStates(InstructionBlock* current_block,
                                             LifetimePosition boundary);
   bool CheckConflict(MachineRepresentation rep, int reg,
-                     RangeWithRegisterSet* to_be_live);
+                     const RangeRegisterSmallMap& to_be_live);
   void ComputeStateFromManyPredecessors(InstructionBlock* current_block,
-                                        RangeWithRegisterSet* to_be_live);
+                                        RangeRegisterSmallMap& to_be_live);
 
   // Helper methods for allocating registers.
 
@@ -1500,11 +1668,11 @@ class LinearScanAllocator final : public RegisterAllocator {
   bool TryReuseSpillForPhi(TopLevelLiveRange* range);
   int PickRegisterThatIsAvailableLongest(
       LiveRange* current, int hint_reg,
-      const base::Vector<LifetimePosition>& free_until_pos);
+      base::Vector<const LifetimePosition> free_until_pos);
   bool TryAllocateFreeReg(LiveRange* range,
-                          const base::Vector<LifetimePosition>& free_until_pos);
+                          base::Vector<const LifetimePosition> free_until_pos);
   bool TryAllocatePreferredReg(
-      LiveRange* range, const base::Vector<LifetimePosition>& free_until_pos);
+      LiveRange* range, base::Vector<const LifetimePosition> free_until_pos);
   void GetFPRegisterSet(MachineRepresentation rep, int* num_regs,
                         int* num_codes, const int** codes) const;
   void GetSIMD128RegisterSet(int* num_regs, int* num_codes,
@@ -1614,15 +1782,12 @@ class LiveRangeConnector final : public ZoneObject {
   Zone* code_zone() const { return code()->zone(); }
 
   bool CanEagerlyResolveControlFlow(const InstructionBlock* block) const;
-
   int ResolveControlFlow(const InstructionBlock* block,
                          const InstructionOperand& cur_op,
                          const InstructionBlock* pred,
                          const InstructionOperand& pred_op);
 
-  void CommitSpillsInDeferredBlocks(TopLevelLiveRange* range,
-                                    LiveRangeBoundArray* array,
-                                    Zone* temp_zone);
+  void CommitSpillsInDeferredBlocks(TopLevelLiveRange* range, Zone* temp_zone);
 
   TopTierRegisterAllocationData* const data_;
 };
diff --git a/deps/v8/src/compiler/backend/riscv/code-generator-riscv.cc b/deps/v8/src/compiler/backend/riscv/code-generator-riscv.cc
index 351ac433022a33..fd782062d29609 100644
--- a/deps/v8/src/compiler/backend/riscv/code-generator-riscv.cc
+++ b/deps/v8/src/compiler/backend/riscv/code-generator-riscv.cc
@@ -95,8 +95,19 @@ class RiscvOperandConverter final : public InstructionOperandConverter {
         return Operand::EmbeddedNumber(constant.ToFloat32());
       case Constant::kFloat64:
         return Operand::EmbeddedNumber(constant.ToFloat64().value());
+      case Constant::kCompressedHeapObject: {
+        RootIndex root_index;
+        if (gen_->isolate()->roots_table().IsRootHandle(constant.ToHeapObject(),
+                                                        &root_index)) {
+          CHECK(COMPRESS_POINTERS_BOOL);
+          CHECK(V8_STATIC_ROOTS_BOOL || !gen_->isolate()->bootstrapper());
+          Tagged_t ptr =
+              MacroAssemblerBase::ReadOnlyRootPtr(root_index, gen_->isolate());
+          return Operand(ptr);
+        }
+        return Operand(constant.ToHeapObject());
+      }
       case Constant::kExternalReference:
-      case Constant::kCompressedHeapObject:
       case Constant::kHeapObject:
         // TODO(plind): Maybe we should handle ExtRef & HeapObj here?
         //    maybe not done on arm due to const pool ??
@@ -310,11 +321,11 @@ FPUCondition FlagsConditionToConditionCmpFPU(bool* predicate,
     __ sync();                                           \
   } while (0)
 
-#define ASSEMBLE_ATOMIC_STORE_INTEGER(asm_instr)               \
-  do {                                                         \
-    __ sync();                                                 \
-    __ asm_instr(i.InputOrZeroRegister(2), i.MemoryOperand()); \
-    __ sync();                                                 \
+#define ASSEMBLE_ATOMIC_STORE_INTEGER(asm_instr)                \
+  do {                                                          \
+    __ sync();                                                  \
+    __ asm_instr(i.InputOrZeroRegister(0), i.MemoryOperand(1)); \
+    __ sync();                                                  \
   } while (0)
 
 #define ASSEMBLE_ATOMIC_BINOP(load_linked, store_conditional, bin_instr)       \
@@ -532,11 +543,6 @@ FPUCondition FlagsConditionToConditionCmpFPU(bool* predicate,
     __ VU.set(kScratchReg, E32, m1);                      \
     __ OP(i.OutputSimd128Register(), i.InputRegister(0)); \
     break;                                                \
-  }                                                       \
-  case kRiscvI64x2##instr: {                              \
-    __ VU.set(kScratchReg, E64, m1);                      \
-    __ OP(i.OutputSimd128Register(), i.InputRegister(0)); \
-    break;                                                \
   }
 
 #define ASSEMBLE_RVV_UNOP_INTEGER_VV(instr, OP)                  \
@@ -629,8 +635,7 @@ void CodeGenerator::BailoutIfDeoptimized() {
   int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
   __ LoadTaggedField(kScratchReg,
                      MemOperand(kJavaScriptCallCodeStartRegister, offset));
-  __ Lw(kScratchReg,
-        FieldMemOperand(kScratchReg, Code::kKindSpecificFlagsOffset));
+  __ Lw(kScratchReg, FieldMemOperand(kScratchReg, Code::kFlagsOffset));
   __ And(kScratchReg, kScratchReg,
          Operand(1 << Code::kMarkedForDeoptimizationBit));
   __ Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
@@ -661,7 +666,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchCallBuiltinPointer: {
       DCHECK(!instr->InputAt(0)->IsImmediate());
       Register builtin_index = i.InputRegister(0);
-      __ CallBuiltinByIndex(builtin_index);
+      Register target =
+          instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister)
+              ? kJavaScriptCallCodeStartRegister
+              : builtin_index;
+      __ CallBuiltinByIndex(builtin_index, target);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -726,9 +735,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ Assert(eq, AbortReason::kWrongFunctionContext, cp,
                   Operand(kScratchReg));
       }
-      static_assert(kJavaScriptCallCodeStartRegister == a2, "ABI mismatch");
-      __ LoadTaggedField(a2, FieldMemOperand(func, JSFunction::kCodeOffset));
-      __ CallCodeObject(a2);
+      __ CallJSFunction(func);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -872,7 +879,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ TruncateDoubleToI(isolate(), zone(), i.OutputRegister(),
                            i.InputDoubleRegister(0), DetermineStubCallMode());
       break;
-    case kArchStoreWithWriteBarrier: {
+    case kArchStoreWithWriteBarrier:  // Fall through.
+    case kArchAtomicStoreWithWriteBarrier: {
       RecordWriteMode mode = RecordWriteModeField::decode(instr->opcode());
       Register object = i.InputRegister(0);
       Register index = i.InputRegister(1);
@@ -883,7 +891,14 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                                    scratch0, scratch1, mode,
                                                    DetermineStubCallMode());
       __ AddWord(kScratchReg, object, index);
-      __ StoreTaggedField(value, MemOperand(kScratchReg));
+      if (arch_opcode == kArchStoreWithWriteBarrier) {
+        __ StoreTaggedField(value, MemOperand(kScratchReg));
+      } else {
+        DCHECK_EQ(kArchAtomicStoreWithWriteBarrier, arch_opcode);
+        __ sync();
+        __ StoreTaggedField(value, MemOperand(kScratchReg));
+        __ sync();
+      }
       if (mode > RecordWriteMode::kValueIsPointer) {
         __ JumpIfSmi(value, ool->exit());
       }
@@ -893,6 +908,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier:
+      UNREACHABLE();
     case kArchStackSlot: {
       FrameOffset offset =
           frame_access_state()->GetFrameOffset(i.InputInt32(0));
@@ -1233,15 +1250,23 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvRor64:
       __ Dror(i.OutputRegister(), i.InputRegister(0), i.InputOperand(1));
       break;
-#endif
-    case kRiscvRor32:
-      __ Ror(i.OutputRegister(), i.InputRegister(0), i.InputOperand(1));
+    case kRiscvTst64:
+      __ And(kScratchReg, i.InputRegister(0), i.InputOperand(1));
+      // Pseudo-instruction used for cmp/branch. No opcode emitted here.
       break;
-    case kRiscvTst:
+#endif
+    case kRiscvTst32:
       __ And(kScratchReg, i.InputRegister(0), i.InputOperand(1));
+      __ Sll32(kScratchReg, kScratchReg, 0x0);
       // Pseudo-instruction used for cmp/branch. No opcode emitted here.
       break;
+    case kRiscvRor32:
+      __ Ror(i.OutputRegister(), i.InputRegister(0), i.InputOperand(1));
+      break;
     case kRiscvCmp:
+#ifdef V8_TARGET_ARCH_RISCV64
+    case kRiscvCmp32:
+#endif
       // Pseudo-instruction used for cmp/branch. No opcode emitted here.
       break;
     case kRiscvCmpZero:
@@ -1514,12 +1539,56 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvFloat64SilenceNaN:
       __ FPUCanonicalizeNaN(i.OutputDoubleRegister(), i.InputDoubleRegister(0));
       break;
-    case kRiscvCvtSD:
-      __ fcvt_s_d(i.OutputSingleRegister(), i.InputDoubleRegister(0));
+    case kRiscvCvtSD: {
+      Label done;
+      __ feq_d(kScratchReg, i.InputDoubleRegister(0), i.InputDoubleRegister(0));
+#if V8_TARGET_ARCH_RISCV64
+      __ fmv_x_d(kScratchReg2, i.InputDoubleRegister(0));
+#elif V8_TARGET_ARCH_RISCV32
+      __ StoreDouble(i.InputDoubleRegister(0),
+                     MemOperand(sp, -kDoubleSize));  // store whole 64 bit
+#endif
+      __ fcvt_s_d(i.OutputDoubleRegister(), i.InputDoubleRegister(0));
+      __ Branch(&done, ne, kScratchReg, Operand(zero_reg));
+#if V8_TARGET_ARCH_RISCV64
+      __ And(kScratchReg2, kScratchReg2, Operand(0x8000000000000000));
+      __ srai(kScratchReg2, kScratchReg2, 32);
+      __ fmv_d_x(kScratchDoubleReg, kScratchReg2);
+#elif V8_TARGET_ARCH_RISCV32
+      __ Lw(kScratchReg2,
+            MemOperand(sp,
+                       -kDoubleSize /
+                           2));  // only load the high half to get the sign bit
+      __ fmv_w_x(kScratchDoubleReg, kScratchReg2);
+#endif
+      __ fsgnj_s(i.OutputDoubleRegister(), i.OutputDoubleRegister(),
+                 kScratchDoubleReg);
+      __ bind(&done);
       break;
-    case kRiscvCvtDS:
+    }
+    case kRiscvCvtDS: {
+      Label done;
+      __ feq_s(kScratchReg, i.InputDoubleRegister(0), i.InputDoubleRegister(0));
+#if V8_TARGET_ARCH_RISCV64
+      __ fmv_x_d(kScratchReg2, i.InputDoubleRegister(0));
+#elif V8_TARGET_ARCH_RISCV32
+      __ StoreFloat(i.InputDoubleRegister(0), MemOperand(sp, -kFloatSize));
+#endif
       __ fcvt_d_s(i.OutputDoubleRegister(), i.InputSingleRegister(0));
+      __ Branch(&done, ne, kScratchReg, Operand(zero_reg));
+#if V8_TARGET_ARCH_RISCV64
+      __ And(kScratchReg2, kScratchReg2, Operand(0x80000000));
+      __ slli(kScratchReg2, kScratchReg2, 32);
+      __ fmv_d_x(kScratchDoubleReg, kScratchReg2);
+#elif V8_TARGET_ARCH_RISCV32
+      __ Lw(kScratchReg2, MemOperand(sp, -kFloatSize));
+      __ fcvt_d_w(kScratchDoubleReg, kScratchReg2);
+#endif
+      __ fsgnj_d(i.OutputDoubleRegister(), i.OutputDoubleRegister(),
+                 kScratchDoubleReg);
+      __ bind(&done);
       break;
+    }
     case kRiscvCvtDW: {
       __ fcvt_d_w(i.OutputDoubleRegister(), i.InputRegister(0));
       break;
@@ -1915,6 +1984,12 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       ASSEMBLE_ATOMIC_LOAD_INTEGER(Lhu);
       break;
     case kAtomicLoadWord32:
+#if V8_TARGET_ARCH_RISCV64
+      if (AtomicWidthField::decode(opcode) == AtomicWidth::kWord64) {
+        ASSEMBLE_ATOMIC_LOAD_INTEGER(Lwu);
+        break;
+      }
+#endif  // V8_TARGET_ARCH_RISCV64
       ASSEMBLE_ATOMIC_LOAD_INTEGER(Lw);
       break;
 #if V8_TARGET_ARCH_RISCV64
@@ -2178,8 +2253,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       break;
 #if V8_TARGET_ARCH_RISCV64
     case kRiscvStoreCompressTagged: {
-      MemOperand operand = i.MemoryOperand(1);
-      __ StoreTaggedField(i.InputOrZeroRegister(0), operand);
+      MemOperand mem = i.MemoryOperand(1);
+      __ StoreTaggedField(i.InputOrZeroRegister(0), mem);
       break;
     }
     case kRiscvLoadDecompressTaggedSigned: {
@@ -2196,6 +2271,26 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ DecompressTagged(result, operand);
       break;
     }
+    case kRiscvLoadDecodeSandboxedPointer:
+      __ LoadSandboxedPointerField(i.OutputRegister(), i.MemoryOperand());
+      break;
+    case kRiscvStoreEncodeSandboxedPointer: {
+      MemOperand mem = i.MemoryOperand(1);
+      __ StoreSandboxedPointerField(i.InputOrZeroRegister(0), mem);
+      break;
+    }
+    case kRiscvAtomicLoadDecompressTaggedSigned:
+      __ AtomicDecompressTaggedSigned(i.OutputRegister(), i.MemoryOperand());
+      break;
+    case kRiscvAtomicLoadDecompressTagged:
+      __ AtomicDecompressTagged(i.OutputRegister(), i.MemoryOperand());
+      break;
+    case kRiscvAtomicStoreCompressTagged: {
+      size_t index = 0;
+      MemOperand mem = i.MemoryOperand(&index);
+      __ AtomicStoreTaggedField(i.InputOrZeroRegister(index), mem);
+      break;
+    }
 #endif
     case kRiscvRvvSt: {
       (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
@@ -2233,8 +2328,13 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvS128Load64Zero: {
       Simd128Register dst = i.OutputSimd128Register();
       __ VU.set(kScratchReg, E64, m1);
+#if V8_TARGET_ARCH_RISCV64
       __ LoadWord(kScratchReg, i.MemoryOperand());
       __ vmv_sx(dst, kScratchReg);
+#elif V8_TARGET_ARCH_RISCV32
+      __ LoadDouble(kScratchDoubleReg, i.MemoryOperand());
+      __ vfmv_sf(dst, kScratchDoubleReg);
+#endif
       break;
     }
     case kRiscvS128LoadLane: {
@@ -2253,16 +2353,26 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     }
     case kRiscvS128Load64ExtendS: {
       __ VU.set(kScratchReg, E64, m1);
+#if V8_TARGET_ARCH_RISCV64
       __ LoadWord(kScratchReg, i.MemoryOperand());
       __ vmv_vx(kSimd128ScratchReg, kScratchReg);
+#elif V8_TARGET_ARCH_RISCV32
+      __ LoadDouble(kScratchDoubleReg, i.MemoryOperand());
+      __ vfmv_vf(kSimd128ScratchReg, kScratchDoubleReg);
+#endif
       __ VU.set(kScratchReg, i.InputInt8(2), m1);
       __ vsext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
       break;
     }
     case kRiscvS128Load64ExtendU: {
       __ VU.set(kScratchReg, E64, m1);
+#if V8_TARGET_ARCH_RISCV64
       __ LoadWord(kScratchReg, i.MemoryOperand());
       __ vmv_vx(kSimd128ScratchReg, kScratchReg);
+#elif V8_TARGET_ARCH_RISCV32
+      __ LoadDouble(kScratchDoubleReg, i.MemoryOperand());
+      __ vfmv_vf(kSimd128ScratchReg, kScratchDoubleReg);
+#endif
       __ VU.set(kScratchReg, i.InputInt8(2), m1);
       __ vzext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
       break;
@@ -2272,20 +2382,28 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       switch (i.InputInt8(2)) {
         case E8:
           __ Lb(kScratchReg, i.MemoryOperand());
+          __ vmv_vx(i.OutputSimd128Register(), kScratchReg);
           break;
         case E16:
           __ Lh(kScratchReg, i.MemoryOperand());
+          __ vmv_vx(i.OutputSimd128Register(), kScratchReg);
           break;
         case E32:
           __ Lw(kScratchReg, i.MemoryOperand());
+          __ vmv_vx(i.OutputSimd128Register(), kScratchReg);
           break;
         case E64:
+#if V8_TARGET_ARCH_RISCV64
           __ LoadWord(kScratchReg, i.MemoryOperand());
+          __ vmv_vx(i.OutputSimd128Register(), kScratchReg);
+#elif V8_TARGET_ARCH_RISCV32
+          __ LoadDouble(kScratchDoubleReg, i.MemoryOperand());
+          __ vfmv_vf(i.OutputSimd128Register(), kScratchDoubleReg);
+#endif
           break;
         default:
           UNREACHABLE();
       }
-      __ vmv_vx(i.OutputSimd128Register(), kScratchReg);
       break;
     }
     case kRiscvS128AllOnes: {
@@ -2305,36 +2423,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                 kSimd128ScratchReg2);
       break;
     }
-    case kRiscvS128And: {
-      (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
-      __ vand_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvS128Or: {
-      (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
-      __ vor_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvS128Xor: {
-      (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
-      __ vxor_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvS128Not: {
+    case kRiscvVnot: {
       (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
       __ vnot_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
-    case kRiscvS128AndNot: {
-      (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
-      __ vnot_vv(kSimd128ScratchReg, i.InputSimd128Register(1));
-      __ vand_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 kSimd128ScratchReg);
-      break;
-    }
     case kRiscvS128Const: {
       Simd128Register dst = i.OutputSimd128Register();
       uint8_t imm[16];
@@ -2345,28 +2438,28 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ WasmRvvS128const(dst, imm);
       break;
     }
-    case kRiscvI64x2Mul: {
-      (__ VU).set(kScratchReg, VSew::E64, Vlmul::m1);
-      __ vmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI64x2Add: {
-      (__ VU).set(kScratchReg, VSew::E64, Vlmul::m1);
-      __ vadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 i.InputSimd128Register(1));
-      break;
-    }
     case kRiscvVrgather: {
       Simd128Register index = i.InputSimd128Register(0);
       if (!(instr->InputAt(1)->IsImmediate())) {
         index = i.InputSimd128Register(1);
       } else {
+#if V8_TARGET_ARCH_RISCV64
         __ VU.set(kScratchReg, E64, m1);
         __ li(kScratchReg, i.InputInt64(1));
         __ vmv_vi(kSimd128ScratchReg3, -1);
         __ vmv_sx(kSimd128ScratchReg3, kScratchReg);
         index = kSimd128ScratchReg3;
+#elif V8_TARGET_ARCH_RISCV32
+        int64_t intput_int64 = i.InputInt64(1);
+        int32_t input_int32[2];
+        memcpy(input_int32, &intput_int64, sizeof(intput_int64));
+        __ VU.set(kScratchReg, E32, m1);
+        __ li(kScratchReg, input_int32[1]);
+        __ vmv_vx(kSimd128ScratchReg3, kScratchReg);
+        __ li(kScratchReg, input_int32[0]);
+        __ vmv_sx(kSimd128ScratchReg3, kScratchReg);
+        index = kSimd128ScratchReg3;
+#endif
       }
       __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
       if (i.OutputSimd128Register() == i.InputSimd128Register(0)) {
@@ -2390,106 +2483,13 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       }
       break;
     }
-    case kRiscvI8x16RoundingAverageU: {
-      __ VU.set(kScratchReg2, E8, m1);
-      __ vwaddu_vv(kSimd128ScratchReg, i.InputSimd128Register(0),
-                   i.InputSimd128Register(1));
-      __ li(kScratchReg, 1);
-      __ vwaddu_wx(kSimd128ScratchReg3, kSimd128ScratchReg, kScratchReg);
-      __ li(kScratchReg, 2);
-      __ VU.set(kScratchReg2, E16, m2);
-      __ vdivu_vx(kSimd128ScratchReg3, kSimd128ScratchReg3, kScratchReg);
-      __ VU.set(kScratchReg2, E8, m1);
-      __ vnclipu_vi(i.OutputSimd128Register(), kSimd128ScratchReg3, 0);
-      break;
-    }
-    case kRiscvI16x8RoundingAverageU: {
-      __ VU.set(kScratchReg2, E16, m1);
-      __ vwaddu_vv(kSimd128ScratchReg, i.InputSimd128Register(0),
-                   i.InputSimd128Register(1));
-      __ li(kScratchReg, 1);
-      __ vwaddu_wx(kSimd128ScratchReg3, kSimd128ScratchReg, kScratchReg);
-      __ li(kScratchReg, 2);
-      __ VU.set(kScratchReg2, E32, m2);
-      __ vdivu_vx(kSimd128ScratchReg3, kSimd128ScratchReg3, kScratchReg);
-      __ VU.set(kScratchReg2, E16, m1);
-      __ vnclipu_vi(i.OutputSimd128Register(), kSimd128ScratchReg3, 0);
-      break;
-    }
-    case kRiscvI16x8Mul: {
-      (__ VU).set(kScratchReg, VSew::E16, Vlmul::m1);
-      __ vmv_vx(kSimd128ScratchReg, zero_reg);
-      __ vmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI16x8Q15MulRSatS: {
-      __ VU.set(kScratchReg, E16, m1);
-      __ vsmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI16x8AddSatS: {
-      (__ VU).set(kScratchReg, VSew::E16, Vlmul::m1);
-      __ vsadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI16x8AddSatU: {
-      (__ VU).set(kScratchReg, VSew::E16, Vlmul::m1);
-      __ vsaddu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI8x16AddSatS: {
-      (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
-      __ vsadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI8x16AddSatU: {
-      (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
-      __ vsaddu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI64x2Sub: {
-      (__ VU).set(kScratchReg, VSew::E64, Vlmul::m1);
-      __ vsub_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI16x8SubSatS: {
-      (__ VU).set(kScratchReg, VSew::E16, Vlmul::m1);
-      __ vssub_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI16x8SubSatU: {
-      (__ VU).set(kScratchReg, VSew::E16, Vlmul::m1);
-      __ vssubu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI8x16SubSatS: {
-      (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
-      __ vssub_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvI8x16SubSatU: {
-      (__ VU).set(kScratchReg, VSew::E8, Vlmul::m1);
-      __ vssubu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1));
-      break;
-    }
     case kRiscvI8x16ExtractLaneU: {
       __ VU.set(kScratchReg, E8, m1);
       __ vslidedown_vi(kSimd128ScratchReg, i.InputSimd128Register(0),
                        i.InputInt8(1));
       __ vmv_xs(i.OutputRegister(), kSimd128ScratchReg);
-      __ slli(i.OutputRegister(), i.OutputRegister(), 64 - 8);
-      __ srli(i.OutputRegister(), i.OutputRegister(), 64 - 8);
+      __ slli(i.OutputRegister(), i.OutputRegister(), sizeof(void*) * 8 - 8);
+      __ srli(i.OutputRegister(), i.OutputRegister(), sizeof(void*) * 8 - 8);
       break;
     }
     case kRiscvI8x16ExtractLaneS: {
@@ -2504,8 +2504,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ vslidedown_vi(kSimd128ScratchReg, i.InputSimd128Register(0),
                        i.InputInt8(1));
       __ vmv_xs(i.OutputRegister(), kSimd128ScratchReg);
-      __ slli(i.OutputRegister(), i.OutputRegister(), 64 - 16);
-      __ srli(i.OutputRegister(), i.OutputRegister(), 64 - 16);
+      __ slli(i.OutputRegister(), i.OutputRegister(), sizeof(void*) * 8 - 16);
+      __ srli(i.OutputRegister(), i.OutputRegister(), sizeof(void*) * 8 - 16);
       break;
     }
     case kRiscvI16x8ExtractLaneS: {
@@ -2539,12 +2539,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       }
       break;
     }
-    case kRiscvI32x4Mul: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 i.InputSimd128Register(1));
-      break;
-    }
     case kRiscvI32x4TruncSatF64x2SZero: {
       __ VU.set(kScratchReg, E64, m1);
       __ vmv_vx(kSimd128ScratchReg, zero_reg);
@@ -2570,7 +2564,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI32x4ShrU: {
       __ VU.set(kScratchReg, E32, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 32 - 1);
         __ vsrl_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2582,7 +2575,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI64x2ShrU: {
       __ VU.set(kScratchReg, E64, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 64 - 1);
         __ vsrl_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2600,7 +2592,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI8x16ShrS: {
       __ VU.set(kScratchReg, E8, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 8 - 1);
         __ vsra_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2612,7 +2603,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI16x8ShrS: {
       __ VU.set(kScratchReg, E16, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 16 - 1);
         __ vsra_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2624,7 +2614,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI32x4ShrS: {
       __ VU.set(kScratchReg, E32, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 32 - 1);
         __ vsra_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2636,7 +2625,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI64x2ShrS: {
       __ VU.set(kScratchReg, E64, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 64 - 1);
         __ vsra_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2656,161 +2644,36 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                             i.InputInt8(1), E32, m1);
       break;
     }
-    case kRiscvI32x4Abs: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmv_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
-      __ vmv_vx(kSimd128RegZero, zero_reg);
-      __ vmslt_vv(v0, i.InputSimd128Register(0), kSimd128RegZero);
-      __ vneg_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 MaskType::Mask);
-      break;
-    }
-    case kRiscvI16x8Abs: {
-      __ VU.set(kScratchReg, E16, m1);
-      __ vmv_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
-      __ vmv_vx(kSimd128RegZero, zero_reg);
-      __ vmslt_vv(v0, i.InputSimd128Register(0), kSimd128RegZero);
-      __ vneg_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 MaskType::Mask);
-      break;
-    }
-    case kRiscvI8x16Abs: {
-      __ VU.set(kScratchReg, E8, m1);
-      __ vmv_vx(kSimd128RegZero, zero_reg);
-      __ vmv_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
-      __ vmslt_vv(v0, i.InputSimd128Register(0), kSimd128RegZero);
-      __ vneg_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 MaskType::Mask);
-      break;
-    }
-    case kRiscvI64x2Abs: {
-      __ VU.set(kScratchReg, E64, m1);
+    case kRiscvVAbs: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
       __ vmv_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
-      __ vmv_vx(kSimd128RegZero, zero_reg);
-      __ vmslt_vv(v0, i.InputSimd128Register(0), kSimd128RegZero);
+      __ vmslt_vx(v0, i.InputSimd128Register(0), zero_reg);
       __ vneg_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
                  MaskType::Mask);
       break;
     }
+#if V8_TARGET_ARCH_RISCV64
     case kRiscvI64x2ExtractLane: {
       __ WasmRvvExtractLane(i.OutputRegister(), i.InputSimd128Register(0),
                             i.InputInt8(1), E64, m1);
       break;
     }
-    case kRiscvI8x16Eq: {
-      __ WasmRvvEq(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1), E8, m1);
-      break;
-    }
-    case kRiscvI16x8Eq: {
-      __ WasmRvvEq(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1), E16, m1);
-      break;
-    }
-    case kRiscvI32x4Eq: {
-      __ WasmRvvEq(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1), E32, m1);
-      break;
-    }
-    case kRiscvI64x2Eq: {
-      __ WasmRvvEq(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1), E64, m1);
-      break;
-    }
-    case kRiscvI8x16Ne: {
-      __ WasmRvvNe(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1), E8, m1);
-      break;
-    }
-    case kRiscvI16x8Ne: {
-      __ WasmRvvNe(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1), E16, m1);
-      break;
-    }
-    case kRiscvI32x4Ne: {
-      __ WasmRvvNe(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1), E32, m1);
-      break;
-    }
-    case kRiscvI64x2Ne: {
-      __ WasmRvvNe(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1), E64, m1);
-      break;
-    }
-    case kRiscvI8x16GeS: {
-      __ WasmRvvGeS(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E8, m1);
-      break;
-    }
-    case kRiscvI16x8GeS: {
-      __ WasmRvvGeS(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E16, m1);
-      break;
-    }
-    case kRiscvI32x4GeS: {
-      __ WasmRvvGeS(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E32, m1);
-      break;
-    }
-    case kRiscvI64x2GeS: {
-      __ WasmRvvGeS(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E64, m1);
-      break;
-    }
-    case kRiscvI8x16GeU: {
-      __ WasmRvvGeU(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E8, m1);
-      break;
-    }
-    case kRiscvI16x8GeU: {
-      __ WasmRvvGeU(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E16, m1);
-      break;
-    }
-    case kRiscvI32x4GeU: {
-      __ WasmRvvGeU(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E32, m1);
-      break;
-    }
-    case kRiscvI8x16GtS: {
-      __ WasmRvvGtS(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E8, m1);
-      break;
-    }
-    case kRiscvI16x8GtS: {
-      __ WasmRvvGtS(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E16, m1);
-      break;
-    }
-    case kRiscvI32x4GtS: {
-      __ WasmRvvGtS(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E32, m1);
-      break;
-    }
-    case kRiscvI64x2GtS: {
-      __ WasmRvvGtS(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E64, m1);
-      break;
-    }
-    case kRiscvI8x16GtU: {
-      __ WasmRvvGtU(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E8, m1);
-      break;
-    }
-    case kRiscvI16x8GtU: {
-      __ WasmRvvGtU(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E16, m1);
-      break;
-    }
-    case kRiscvI32x4GtU: {
-      __ WasmRvvGtU(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), E32, m1);
+#elif V8_TARGET_ARCH_RISCV32
+    case kRiscvI64x2ExtractLane: {
+      uint8_t imm_lane_idx = i.InputInt8(1);
+      __ VU.set(kScratchReg, E32, m1);
+      __ vslidedown_vi(kSimd128ScratchReg, i.InputSimd128Register(0),
+                       (imm_lane_idx << 0x1) + 1);
+      __ vmv_xs(i.OutputRegister(1), kSimd128ScratchReg);
+      __ vslidedown_vi(kSimd128ScratchReg, i.InputSimd128Register(0),
+                       (imm_lane_idx << 0x1));
+      __ vmv_xs(i.OutputRegister(0), kSimd128ScratchReg);
       break;
     }
+#endif
     case kRiscvI8x16Shl: {
       __ VU.set(kScratchReg, E8, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 8 - 1);
         __ vsll_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2822,7 +2685,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI16x8Shl: {
       __ VU.set(kScratchReg, E16, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 16 - 1);
         __ vsll_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2834,7 +2696,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI32x4Shl: {
       __ VU.set(kScratchReg, E32, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 32 - 1);
         __ vsll_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2846,7 +2707,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kRiscvI64x2Shl: {
       __ VU.set(kScratchReg, E64, m1);
       if (instr->InputAt(1)->IsRegister()) {
-        __ andi(i.InputRegister(1), i.InputRegister(1), 64 - 1);
         __ vsll_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputRegister(1));
       } else {
@@ -2880,6 +2740,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ vmerge_vx(dst, i.InputRegister(2), src);
       break;
     }
+#if V8_TARGET_ARCH_RISCV64
     case kRiscvI64x2ReplaceLane: {
       Simd128Register src = i.InputSimd128Register(0);
       Simd128Register dst = i.OutputSimd128Register();
@@ -2889,56 +2750,30 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ vmerge_vx(dst, i.InputRegister(2), src);
       break;
     }
-    case kRiscvI32x4ReplaceLane: {
+#elif V8_TARGET_ARCH_RISCV32
+    case kRiscvI64x2ReplaceLaneI32Pair: {
       Simd128Register src = i.InputSimd128Register(0);
       Simd128Register dst = i.OutputSimd128Register();
+      Register int64_low = i.InputRegister(2);
+      Register int64_high = i.InputRegister(3);
       __ VU.set(kScratchReg, E32, m1);
+      __ vmv_vx(kSimd128ScratchReg, int64_high);
+      __ vmv_sx(kSimd128ScratchReg, int64_low);
+      __ VU.set(kScratchReg, E64, m1);
       __ li(kScratchReg, 0x1 << i.InputInt8(1));
       __ vmv_sx(v0, kScratchReg);
-      __ vmerge_vx(dst, i.InputRegister(2), src);
+      __ vfmv_fs(kScratchDoubleReg, kSimd128ScratchReg);
+      __ vfmerge_vf(dst, kScratchDoubleReg, src);
       break;
     }
-    case kRiscvI8x16BitMask: {
-      Register dst = i.OutputRegister();
+#endif
+    case kRiscvI32x4ReplaceLane: {
       Simd128Register src = i.InputSimd128Register(0);
-      __ VU.set(kScratchReg, E8, m1);
-      __ vmv_vx(kSimd128RegZero, zero_reg);
-      __ vmv_vx(kSimd128ScratchReg, zero_reg);
-      __ vmslt_vv(kSimd128ScratchReg, src, kSimd128RegZero);
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmv_xs(dst, kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvI16x8BitMask: {
-      Register dst = i.OutputRegister();
-      Simd128Register src = i.InputSimd128Register(0);
-      __ VU.set(kScratchReg, E16, m1);
-      __ vmv_vx(kSimd128RegZero, zero_reg);
-      __ vmv_vx(kSimd128ScratchReg, zero_reg);
-      __ vmslt_vv(kSimd128ScratchReg, src, kSimd128RegZero);
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmv_xs(dst, kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvI32x4BitMask: {
-      Register dst = i.OutputRegister();
-      Simd128Register src = i.InputSimd128Register(0);
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmv_vx(kSimd128RegZero, zero_reg);
-      __ vmv_vx(kSimd128ScratchReg, zero_reg);
-      __ vmslt_vv(kSimd128ScratchReg, src, kSimd128RegZero);
-      __ vmv_xs(dst, kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvI64x2BitMask: {
-      Register dst = i.OutputRegister();
-      Simd128Register src = i.InputSimd128Register(0);
-      __ VU.set(kScratchReg, E64, m1);
-      __ vmv_vx(kSimd128RegZero, zero_reg);
-      __ vmv_vx(kSimd128ScratchReg, zero_reg);
-      __ vmslt_vv(kSimd128ScratchReg, src, kSimd128RegZero);
+      Simd128Register dst = i.OutputSimd128Register();
       __ VU.set(kScratchReg, E32, m1);
-      __ vmv_xs(dst, kSimd128ScratchReg);
+      __ li(kScratchReg, 0x1 << i.InputInt8(1));
+      __ vmv_sx(v0, kScratchReg);
+      __ vmerge_vx(dst, i.InputRegister(2), src);
       break;
     }
     case kRiscvV128AnyTrue: {
@@ -2954,60 +2789,17 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(&t);
       break;
     }
-    case kRiscvI64x2AllTrue: {
-      __ VU.set(kScratchReg, E64, m1);
-      Register dst = i.OutputRegister();
-      Label all_true;
-      __ li(kScratchReg, -1);
-      __ vmv_sx(kSimd128ScratchReg, kScratchReg);
-      __ vredminu_vs(kSimd128ScratchReg, i.InputSimd128Register(0),
-                     kSimd128ScratchReg);
-      __ vmv_xs(dst, kSimd128ScratchReg);
-      __ beqz(dst, &all_true);
-      __ li(dst, 1);
-      __ bind(&all_true);
-      break;
-    }
-    case kRiscvI32x4AllTrue: {
-      __ VU.set(kScratchReg, E32, m1);
-      Register dst = i.OutputRegister();
-      Label all_true;
-      __ li(kScratchReg, -1);
-      __ vmv_sx(kSimd128ScratchReg, kScratchReg);
-      __ vredminu_vs(kSimd128ScratchReg, i.InputSimd128Register(0),
-                     kSimd128ScratchReg);
-      __ vmv_xs(dst, kSimd128ScratchReg);
-      __ beqz(dst, &all_true);
-      __ li(dst, 1);
-      __ bind(&all_true);
-      break;
-    }
-    case kRiscvI16x8AllTrue: {
-      __ VU.set(kScratchReg, E16, m1);
+    case kRiscvVAllTrue: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
       Register dst = i.OutputRegister();
-      Label all_true;
-      __ li(kScratchReg, -1);
-      __ vmv_sx(kSimd128ScratchReg, kScratchReg);
+      Label notalltrue;
+      __ vmv_vi(kSimd128ScratchReg, -1);
       __ vredminu_vs(kSimd128ScratchReg, i.InputSimd128Register(0),
                      kSimd128ScratchReg);
       __ vmv_xs(dst, kSimd128ScratchReg);
-      __ beqz(dst, &all_true);
+      __ beqz(dst, &notalltrue);
       __ li(dst, 1);
-      __ bind(&all_true);
-      break;
-    }
-    case kRiscvI8x16AllTrue: {
-      __ VU.set(kScratchReg, E8, m1);
-      Register dst = i.OutputRegister();
-      Label all_true;
-      __ li(kScratchReg, -1);
-      __ vmv_sx(kSimd128ScratchReg, kScratchReg);
-      __ vredminu_vs(kSimd128ScratchReg, i.InputSimd128Register(0),
-                     kSimd128ScratchReg);
-      __ vmv_xs(dst, kSimd128ScratchReg);
-      __ beqz(dst, &all_true);
-      __ li(dst, 1);
-      __ bind(&all_true);
+      __ bind(&notalltrue);
       break;
     }
     case kRiscvI8x16Shuffle: {
@@ -3015,6 +2807,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                 src0 = i.InputSimd128Register(0),
                 src1 = i.InputSimd128Register(1);
 
+#if V8_TARGET_ARCH_RISCV64
       int64_t imm1 = make_uint64(i.InputInt32(3), i.InputInt32(2));
       int64_t imm2 = make_uint64(i.InputInt32(5), i.InputInt32(4));
       __ VU.set(kScratchReg, VSew::E64, Vlmul::m1);
@@ -3023,6 +2816,18 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ vslideup_vi(kSimd128ScratchReg, kSimd128ScratchReg2, 1);
       __ li(kScratchReg, imm1);
       __ vmv_sx(kSimd128ScratchReg, kScratchReg);
+#elif V8_TARGET_ARCH_RISCV32
+      __ VU.set(kScratchReg, VSew::E32, Vlmul::m1);
+      __ li(kScratchReg, i.InputInt32(5));
+      __ vmv_vx(kSimd128ScratchReg2, kScratchReg);
+      __ li(kScratchReg, i.InputInt32(4));
+      __ vmv_sx(kSimd128ScratchReg2, kScratchReg);
+      __ li(kScratchReg, i.InputInt32(3));
+      __ vmv_vx(kSimd128ScratchReg, kScratchReg);
+      __ li(kScratchReg, i.InputInt32(2));
+      __ vmv_sx(kSimd128ScratchReg, kScratchReg);
+      __ vslideup_vi(kSimd128ScratchReg, kSimd128ScratchReg2, 2);
+#endif
 
       __ VU.set(kScratchReg, E8, m1);
       if (dst == src0) {
@@ -3072,36 +2877,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ vfsqrt_v(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
-#if V8_TARGET_ARCH_RISCV64
-    case kRiscvF64x2Splat: {
-      (__ VU).set(kScratchReg, E64, m1);
-      __ fmv_x_d(kScratchReg, i.InputDoubleRegister(0));
-      __ vmv_vx(i.OutputSimd128Register(), kScratchReg);
-      break;
-    }
-#endif
     case kRiscvF64x2Abs: {
       __ VU.set(kScratchReg, VSew::E64, Vlmul::m1);
       __ vfabs_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
-    case kRiscvF64x2Neg: {
-      __ VU.set(kScratchReg, VSew::E64, Vlmul::m1);
-      __ vfneg_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
-      break;
-    }
-    case kRiscvF64x2Add: {
-      __ VU.set(kScratchReg, E64, m1);
-      __ vfadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvF64x2Sub: {
-      __ VU.set(kScratchReg, E64, m1);
-      __ vfsub_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
     case kRiscvF64x2Ceil: {
       __ Ceil_d(i.OutputSimd128Register(), i.InputSimd128Register(0),
                 kScratchReg, kSimd128ScratchReg);
@@ -3112,43 +2892,12 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                  kScratchReg, kSimd128ScratchReg);
       break;
     }
-    case kRiscvF64x2Ne: {
-      __ VU.set(kScratchReg, E64, m1);
-      __ vmfne_vv(v0, i.InputSimd128Register(1), i.InputSimd128Register(0));
-      __ vmv_vx(i.OutputSimd128Register(), zero_reg);
-      __ vmerge_vi(i.OutputSimd128Register(), -1, i.OutputSimd128Register());
-      break;
-    }
-    case kRiscvF64x2Eq: {
-      __ VU.set(kScratchReg, E64, m1);
-      __ vmfeq_vv(v0, i.InputSimd128Register(1), i.InputSimd128Register(0));
-      __ vmv_vx(i.OutputSimd128Register(), zero_reg);
-      __ vmerge_vi(i.OutputSimd128Register(), -1, i.OutputSimd128Register());
-      break;
-    }
-#if V8_TARGET_ARCH_RISCV64
     case kRiscvF64x2ReplaceLane: {
       __ VU.set(kScratchReg, E64, m1);
       __ li(kScratchReg, 0x1 << i.InputInt8(1));
       __ vmv_sx(v0, kScratchReg);
-      __ fmv_x_d(kScratchReg, i.InputSingleRegister(2));
-      __ vmerge_vx(i.OutputSimd128Register(), kScratchReg,
-                   i.InputSimd128Register(0));
-      break;
-    }
-#endif
-    case kRiscvF64x2Lt: {
-      __ VU.set(kScratchReg, E64, m1);
-      __ vmflt_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(1));
-      __ vmv_vx(i.OutputSimd128Register(), zero_reg);
-      __ vmerge_vi(i.OutputSimd128Register(), -1, i.OutputSimd128Register());
-      break;
-    }
-    case kRiscvF64x2Le: {
-      __ VU.set(kScratchReg, E64, m1);
-      __ vmfle_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(1));
-      __ vmv_vx(i.OutputSimd128Register(), zero_reg);
-      __ vmerge_vi(i.OutputSimd128Register(), -1, i.OutputSimd128Register());
+      __ vfmerge_vf(i.OutputSimd128Register(), i.InputSingleRegister(2),
+                    i.InputSimd128Register(0));
       break;
     }
     case kRiscvF64x2Pmax: {
@@ -3165,49 +2914,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                    i.InputSimd128Register(0));
       break;
     }
-#if V8_TARGET_ARCH_RISCV64
-    case kRiscvF64x2Min: {
-      __ VU.set(kScratchReg, E64, m1);
-      const int64_t kNaN = 0x7ff8000000000000L;
-      __ vmfeq_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(0));
-      __ vmfeq_vv(kSimd128ScratchReg, i.InputSimd128Register(1),
-                  i.InputSimd128Register(1));
-      __ vand_vv(v0, v0, kSimd128ScratchReg);
-      __ li(kScratchReg, kNaN);
-      __ vmv_vx(kSimd128ScratchReg, kScratchReg);
-      __ vfmin_vv(kSimd128ScratchReg, i.InputSimd128Register(1),
-                  i.InputSimd128Register(0), Mask);
-      __ vmv_vv(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvF64x2Max: {
-      __ VU.set(kScratchReg, E64, m1);
-      const int64_t kNaN = 0x7ff8000000000000L;
-      __ vmfeq_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(0));
-      __ vmfeq_vv(kSimd128ScratchReg, i.InputSimd128Register(1),
-                  i.InputSimd128Register(1));
-      __ vand_vv(v0, v0, kSimd128ScratchReg);
-      __ li(kScratchReg, kNaN);
-      __ vmv_vx(kSimd128ScratchReg, kScratchReg);
-      __ vfmax_vv(kSimd128ScratchReg, i.InputSimd128Register(1),
-                  i.InputSimd128Register(0), Mask);
-      __ vmv_vv(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
-#endif
-    case kRiscvF64x2Div: {
-      __ VU.set(kScratchReg, E64, m1);
-      __ vfdiv_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvF64x2Mul: {
-      __ VU.set(kScratchReg, E64, m1);
-      __ VU.set(FPURoundingMode::RTZ);
-      __ vfmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
     case kRiscvF64x2ExtractLane: {
       __ VU.set(kScratchReg, E64, m1);
       if (is_uint5(i.InputInt8(1))) {
@@ -3294,34 +3000,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                    i.OutputSimd128Register());
       break;
     }
-    case kRiscvF32x4Neg: {
-      __ VU.set(kScratchReg, VSew::E32, Vlmul::m1);
-      __ vfneg_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
-      break;
-    }
     case kRiscvF32x4Abs: {
       __ VU.set(kScratchReg, VSew::E32, Vlmul::m1);
       __ vfabs_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
-    case kRiscvF32x4Splat: {
-      (__ VU).set(kScratchReg, E32, m1);
-      __ fmv_x_w(kScratchReg, i.InputSingleRegister(0));
-      __ vmv_vx(i.OutputSimd128Register(), kScratchReg);
-      break;
-    }
-    case kRiscvF32x4Add: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vfadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvF32x4Sub: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vfsub_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
     case kRiscvF32x4Ceil: {
       __ Ceil_f(i.OutputSimd128Register(), i.InputSimd128Register(0),
                 kScratchReg, kSimd128ScratchReg);
@@ -3344,34 +3027,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ vfcvt_f_x_v(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
-    case kRiscvF32x4Div: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ VU.set(FPURoundingMode::RTZ);
-      __ vfdiv_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
-      break;
-    }
-    case kRiscvF32x4Mul: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ VU.set(FPURoundingMode::RTZ);
-      __ vfmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(1),
-                  i.InputSimd128Register(0));
-      break;
-    }
-    case kRiscvF32x4Eq: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmfeq_vv(v0, i.InputSimd128Register(1), i.InputSimd128Register(0));
-      __ vmv_vx(i.OutputSimd128Register(), zero_reg);
-      __ vmerge_vi(i.OutputSimd128Register(), -1, i.OutputSimd128Register());
-      break;
-    }
-    case kRiscvF32x4Ne: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmfne_vv(v0, i.InputSimd128Register(1), i.InputSimd128Register(0));
-      __ vmv_vx(i.OutputSimd128Register(), zero_reg);
-      __ vmerge_vi(i.OutputSimd128Register(), -1, i.OutputSimd128Register());
-      break;
-    }
     case kRiscvF32x4ReplaceLane: {
       __ VU.set(kScratchReg, E32, m1);
       __ li(kScratchReg, 0x1 << i.InputInt8(1));
@@ -3381,20 +3036,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                    i.InputSimd128Register(0));
       break;
     }
-    case kRiscvF32x4Lt: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmflt_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(1));
-      __ vmv_vx(i.OutputSimd128Register(), zero_reg);
-      __ vmerge_vi(i.OutputSimd128Register(), -1, i.OutputSimd128Register());
-      break;
-    }
-    case kRiscvF32x4Le: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmfle_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(1));
-      __ vmv_vx(i.OutputSimd128Register(), zero_reg);
-      __ vmerge_vi(i.OutputSimd128Register(), -1, i.OutputSimd128Register());
-      break;
-    }
     case kRiscvF32x4Pmax: {
       __ VU.set(kScratchReg, E32, m1);
       __ vmflt_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(1));
@@ -3414,34 +3055,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ vfsqrt_v(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
-    case kRiscvF32x4Max: {
-      __ VU.set(kScratchReg, E32, m1);
-      const int32_t kNaN = 0x7FC00000;
-      __ vmfeq_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(0));
-      __ vmfeq_vv(kSimd128ScratchReg, i.InputSimd128Register(1),
-                  i.InputSimd128Register(1));
-      __ vand_vv(v0, v0, kSimd128ScratchReg);
-      __ li(kScratchReg, kNaN);
-      __ vmv_vx(kSimd128ScratchReg, kScratchReg);
-      __ vfmax_vv(kSimd128ScratchReg, i.InputSimd128Register(1),
-                  i.InputSimd128Register(0), Mask);
-      __ vmv_vv(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvF32x4Min: {
-      __ VU.set(kScratchReg, E32, m1);
-      const int32_t kNaN = 0x7FC00000;
-      __ vmfeq_vv(v0, i.InputSimd128Register(0), i.InputSimd128Register(0));
-      __ vmfeq_vv(kSimd128ScratchReg, i.InputSimd128Register(1),
-                  i.InputSimd128Register(1));
-      __ vand_vv(v0, v0, kSimd128ScratchReg);
-      __ li(kScratchReg, kNaN);
-      __ vmv_vx(kSimd128ScratchReg, kScratchReg);
-      __ vfmin_vv(kSimd128ScratchReg, i.InputSimd128Register(1),
-                  i.InputSimd128Register(0), Mask);
-      __ vmv_vv(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
     case kRiscvF32x4Qfma: {
       __ VU.set(kScratchReg, E32, m1);
       __ vfmadd_vv(i.InputSimd128Register(0), i.InputSimd128Register(1),
@@ -3483,19 +3096,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ vzext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
       break;
     }
-    case kRiscvI32x4SConvertI16x8Low: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmv_vv(kSimd128ScratchReg, i.InputSimd128Register(0));
-      __ vsext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvI32x4SConvertI16x8High: {
-      __ VU.set(kScratchReg, E16, m1);
-      __ vslidedown_vi(kSimd128ScratchReg, i.InputSimd128Register(0), 4);
-      __ VU.set(kScratchReg, E32, m1);
-      __ vsext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
     case kRiscvI32x4SConvertF32x4: {
       __ VU.set(kScratchReg, E32, m1);
       __ VU.set(FPURoundingMode::RTZ);
@@ -3526,103 +3126,85 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       }
       break;
     }
-    case kRiscvI32x4UConvertI16x8Low: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmv_vv(kSimd128ScratchReg, i.InputSimd128Register(0));
-      __ vzext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvI32x4UConvertI16x8High: {
-      __ VU.set(kScratchReg, E16, m1);
-      __ vslidedown_vi(kSimd128ScratchReg, i.InputSimd128Register(0), 4);
+#if V8_TARGET_ARCH_RISCV32
+    case kRiscvI64x2SplatI32Pair: {
       __ VU.set(kScratchReg, E32, m1);
-      __ vzext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvI16x8SConvertI8x16Low: {
-      __ VU.set(kScratchReg, E16, m1);
-      __ vmv_vv(kSimd128ScratchReg, i.InputSimd128Register(0));
-      __ vsext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
+      __ vmv_vi(v0, 0b0101);
+      __ vmv_vx(kSimd128ScratchReg, i.InputRegister(1));
+      __ vmerge_vx(i.OutputSimd128Register(), i.InputRegister(0),
+                   kSimd128ScratchReg);
       break;
     }
-    case kRiscvI16x8SConvertI8x16High: {
-      __ VU.set(kScratchReg, E8, m1);
-      __ vslidedown_vi(kSimd128ScratchReg, i.InputSimd128Register(0), 8);
-      __ VU.set(kScratchReg, E16, m1);
-      __ vsext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvI16x8UConvertI8x16Low: {
-      __ VU.set(kScratchReg, E16, m1);
-      __ vmv_vv(kSimd128ScratchReg, i.InputSimd128Register(0));
-      __ vzext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
-      break;
-    }
-    case kRiscvI16x8UConvertI8x16High: {
-      __ VU.set(kScratchReg, E8, m1);
-      __ vslidedown_vi(kSimd128ScratchReg, i.InputSimd128Register(0), 8);
-      __ VU.set(kScratchReg, E16, m1);
-      __ vzext_vf2(i.OutputSimd128Register(), kSimd128ScratchReg);
+#endif
+    case kRiscvVwaddVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vwadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
       break;
     }
-    case kRiscvI8x16SConvertI16x8: {
-      __ VU.set(kScratchReg, E16, m1);
-      __ vmv_vv(v26, i.InputSimd128Register(0));
-      __ vmv_vv(v27, i.InputSimd128Register(1));
-      __ VU.set(kScratchReg, E8, m1);
-      __ VU.set(FPURoundingMode::RNE);
-      __ vnclip_vi(i.OutputSimd128Register(), v26, 0);
+    case kRiscvVwadduVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vwaddu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputSimd128Register(1));
       break;
     }
-    case kRiscvI8x16UConvertI16x8: {
-      __ VU.set(kScratchReg, E16, m1);
-      __ vmv_vv(v26, i.InputSimd128Register(0));
-      __ vmv_vv(v27, i.InputSimd128Register(1));
-      __ VU.set(kScratchReg, E16, m2);
-      __ vmax_vx(v26, v26, zero_reg);
-      __ VU.set(kScratchReg, E8, m1);
-      __ VU.set(FPURoundingMode::RNE);
-      __ vnclipu_vi(i.OutputSimd128Register(), v26, 0);
+    case kRiscvVwadduWx: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      if (instr->InputAt(1)->IsRegister()) {
+        __ vwaddu_wx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                     i.InputRegister(1));
+      } else {
+        __ li(kScratchReg, i.InputInt64(1));
+        __ vwaddu_wx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                     kScratchReg);
+      }
       break;
     }
-    case kRiscvI16x8SConvertI32x4: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmv_vv(v26, i.InputSimd128Register(0));
-      __ vmv_vv(v27, i.InputSimd128Register(1));
-      __ VU.set(kScratchReg, E16, m1);
-      __ VU.set(FPURoundingMode::RNE);
-      __ vnclip_vi(i.OutputSimd128Register(), v26, 0);
+    case kRiscvVdivu: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      if (instr->InputAt(1)->IsSimd128Register()) {
+        __ vdivu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    i.InputSimd128Register(1));
+      } else if ((instr->InputAt(1)->IsRegister())) {
+        __ vdivu_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    i.InputRegister(1));
+      } else {
+        __ li(kScratchReg, i.InputInt64(1));
+        __ vdivu_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    kScratchReg);
+      }
       break;
     }
-    case kRiscvI16x8UConvertI32x4: {
-      __ VU.set(kScratchReg, E32, m1);
-      __ vmv_vv(v26, i.InputSimd128Register(0));
-      __ vmv_vv(v27, i.InputSimd128Register(1));
-      __ VU.set(kScratchReg, E32, m2);
-      __ vmax_vx(v26, v26, zero_reg);
-      __ VU.set(kScratchReg, E16, m1);
-      __ VU.set(FPURoundingMode::RNE);
-      __ vnclipu_vi(i.OutputSimd128Register(), v26, 0);
-      break;
-    }
-      ASSEMBLE_RVV_UNOP_INTEGER_VV(Neg, vneg_vv)
-      ASSEMBLE_RVV_BINOP_INTEGER(MaxU, vmaxu_vv)
-      ASSEMBLE_RVV_BINOP_INTEGER(MaxS, vmax_vv)
-      ASSEMBLE_RVV_BINOP_INTEGER(MinU, vminu_vv)
-      ASSEMBLE_RVV_BINOP_INTEGER(MinS, vmin_vv)
-      ASSEMBLE_RVV_UNOP_INTEGER_VR(Splat, vmv_vx)
-      ASSEMBLE_RVV_BINOP_INTEGER(Add, vadd_vv)
-      ASSEMBLE_RVV_BINOP_INTEGER(Sub, vsub_vv)
-    case kRiscvVwadd: {
+    case kRiscvVnclipu: {
       __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
-      __ vwadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                  i.InputSimd128Register(1));
+      __ VU.set(FPURoundingMode(i.InputInt8(4)));
+      if (instr->InputAt(1)->IsSimd128Register()) {
+        __ vnclipu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                      i.InputSimd128Register(1));
+      } else if (instr->InputAt(1)->IsRegister()) {
+        __ vnclipu_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                      i.InputRegister(1));
+      } else {
+        DCHECK(instr->InputAt(1)->IsImmediate());
+        __ vnclipu_vi(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                      i.InputInt8(1));
+      }
       break;
     }
-    case kRiscvVwaddu: {
+    case kRiscvVnclip: {
       __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
-      __ vwaddu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                   i.InputSimd128Register(1));
+      __ VU.set(FPURoundingMode(i.InputInt8(4)));
+      if (instr->InputAt(1)->IsSimd128Register()) {
+        __ vnclip_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                     i.InputSimd128Register(1));
+      } else if (instr->InputAt(1)->IsRegister()) {
+        __ vnclip_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                     i.InputRegister(1));
+      } else {
+        DCHECK(instr->InputAt(1)->IsImmediate());
+        __ vnclip_vi(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                     i.InputInt8(1));
+      }
       break;
     }
     case kRiscvVwmul: {
@@ -3638,7 +3220,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       break;
     }
     case kRiscvVmvSx: {
-      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
       if (instr->InputAt(0)->IsRegister()) {
         __ vmv_sx(i.OutputSimd128Register(), i.InputRegister(0));
       } else {
@@ -3648,6 +3230,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       }
       break;
     }
+    case kRiscvVmvXs: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
+      __ vmv_xs(i.OutputRegister(), i.InputSimd128Register(0));
+      break;
+    }
     case kRiscvVcompress: {
       __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
       if (instr->InputAt(1)->IsSimd128Register()) {
@@ -3662,12 +3249,313 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       }
       break;
     }
+    case kRiscvVsll: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      if (instr->InputAt(1)->IsRegister()) {
+        __ vsll_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputRegister(1));
+      } else if (instr->InputAt(1)->IsSimd128Register()) {
+        __ vsll_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputSimd128Register(1));
+      } else {
+        DCHECK(instr->InputAt(1)->IsImmediate());
+        if (is_int5(i.InputInt64(1))) {
+          __ vsll_vi(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                     i.InputInt8(1));
+        } else {
+          __ li(kScratchReg, i.InputInt64(1));
+          __ vsll_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                     kScratchReg);
+        }
+      }
+      break;
+    }
+    case kRiscvVmslt: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      if (i.InputInt8(4)) {
+        DCHECK(i.OutputSimd128Register() != i.InputSimd128Register(0));
+        __ vmv_vx(i.OutputSimd128Register(), zero_reg);
+      }
+      if (instr->InputAt(1)->IsRegister()) {
+        __ vmslt_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    i.InputRegister(1));
+      } else if (instr->InputAt(1)->IsSimd128Register()) {
+        __ vmslt_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    i.InputSimd128Register(1));
+      } else {
+        DCHECK(instr->InputAt(1)->IsImmediate());
+        if (is_int5(i.InputInt64(1))) {
+          __ vmslt_vi(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                      i.InputInt8(1));
+        } else {
+          __ li(kScratchReg, i.InputInt64(1));
+          __ vmslt_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                      kScratchReg);
+        }
+      }
+      break;
+    }
     case kRiscvVaddVv: {
       __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
       __ vadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
                  i.InputSimd128Register(1));
       break;
     }
+    case kRiscvVsubVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vsub_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                 i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVmv: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
+      if (instr->InputAt(0)->IsSimd128Register()) {
+        __ vmv_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
+      } else if (instr->InputAt(0)->IsRegister()) {
+        __ vmv_vx(i.OutputSimd128Register(), i.InputRegister(0));
+      } else {
+        if (i.ToConstant(instr->InputAt(0)).FitsInInt32() &&
+            is_int8(i.InputInt32(0))) {
+          __ vmv_vi(i.OutputSimd128Register(), i.InputInt8(0));
+        } else {
+          __ li(kScratchReg, i.InputInt64(0));
+          __ vmv_vx(i.OutputSimd128Register(), kScratchReg);
+        }
+      }
+      break;
+    }
+    case kRiscvVfmvVf: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
+      __ vfmv_vf(i.OutputSimd128Register(), i.InputDoubleRegister(0));
+      break;
+    }
+    case kRiscvVnegVv: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
+      __ vneg_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
+      break;
+    }
+    case kRiscvVfnegVv: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
+      __ vfneg_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
+      break;
+    }
+    case kRiscvVmaxuVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vmaxu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVmax: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      if (instr->InputAt(1)->IsSimd128Register()) {
+        __ vmax_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputSimd128Register(1));
+      } else if (instr->InputAt(1)->IsRegister()) {
+        __ vmax_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputRegister(1));
+
+      } else {
+        DCHECK(instr->InputAt(1)->IsImmediate());
+        __ li(kScratchReg, i.InputInt64(1));
+        __ vmax_vx(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   kScratchReg);
+      }
+      break;
+    }
+    case kRiscvVminuVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vminu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVminsVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vmin_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                 i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVmulVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                 i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVgtsVv: {
+      __ WasmRvvGtS(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    i.InputSimd128Register(1), VSew(i.InputInt8(2)),
+                    Vlmul(i.InputInt8(3)));
+      break;
+    }
+    case kRiscvVgesVv: {
+      __ WasmRvvGeS(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    i.InputSimd128Register(1), VSew(i.InputInt8(2)),
+                    Vlmul(i.InputInt8(3)));
+      break;
+    }
+    case kRiscvVgeuVv: {
+      __ WasmRvvGeU(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    i.InputSimd128Register(1), VSew(i.InputInt8(2)),
+                    Vlmul(i.InputInt8(3)));
+      break;
+    }
+    case kRiscvVgtuVv: {
+      __ WasmRvvGtU(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                    i.InputSimd128Register(1), VSew(i.InputInt8(2)),
+                    Vlmul(i.InputInt8(3)));
+      break;
+    }
+    case kRiscvVeqVv: {
+      __ WasmRvvEq(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputSimd128Register(1), VSew(i.InputInt8(2)),
+                   Vlmul(i.InputInt8(3)));
+      break;
+    }
+    case kRiscvVneVv: {
+      __ WasmRvvNe(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputSimd128Register(1), VSew(i.InputInt8(2)),
+                   Vlmul(i.InputInt8(3)));
+      break;
+    }
+    case kRiscvVaddSatSVv: {
+      (__ VU).set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vsadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVaddSatUVv: {
+      (__ VU).set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vsaddu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVsubSatSVv: {
+      (__ VU).set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vssub_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVsubSatUVv: {
+      (__ VU).set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vssubu_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVfaddVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vfadd_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVfsubVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vfsub_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVfmulVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vfmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVfdivVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vfdiv_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVmfeqVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vmfeq_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVmfneVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vmfne_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVmfltVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vmflt_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVmfleVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vmfle_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVfminVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vfmin_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1), MaskType(i.InputInt8(4)));
+      break;
+    }
+    case kRiscvVfmaxVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vfmax_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1), MaskType(i.InputInt8(4)));
+      break;
+    }
+    case kRiscvVandVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vand_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                 i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVorVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vor_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVxorVv: {
+      (__ VU).set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vxor_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                 i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVnotVv: {
+      (__ VU).set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
+      __ vnot_vv(i.OutputSimd128Register(), i.InputSimd128Register(0));
+      break;
+    }
+    case kRiscvVmergeVx: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      if (instr->InputAt(0)->IsRegister()) {
+        __ vmerge_vx(i.OutputSimd128Register(), i.InputRegister(0),
+                     i.InputSimd128Register(1));
+      } else {
+        DCHECK(is_int5(i.InputInt32(0)));
+        __ vmerge_vi(i.OutputSimd128Register(), i.InputInt8(0),
+                     i.InputSimd128Register(1));
+      }
+      break;
+    }
+    case kRiscvVsmulVv: {
+      __ VU.set(kScratchReg, i.InputInt8(2), i.InputInt8(3));
+      __ vsmul_vv(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                  i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVredminuVs: {
+      __ vredminu_vs(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                     i.InputSimd128Register(1));
+      break;
+    }
+    case kRiscvVzextVf2: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
+      __ vzext_vf2(i.OutputSimd128Register(), i.InputSimd128Register(0));
+      break;
+    }
+    case kRiscvVsextVf2: {
+      __ VU.set(kScratchReg, i.InputInt8(1), i.InputInt8(2));
+      __ vsext_vf2(i.OutputSimd128Register(), i.InputSimd128Register(0));
+      break;
+    }
     default:
 #ifdef DEBUG
       switch (arch_opcode) {
@@ -3717,8 +3605,12 @@ void AssembleBranchToLabels(CodeGenerator* gen, MacroAssembler* masm,
   // instructions that do the actual comparison. Essential that the input
   // registers to compare pseudo-op are not modified before this branch op, as
   // they are tested here.
-
-  if (instr->arch_opcode() == kRiscvTst) {
+#if V8_TARGET_ARCH_RISCV64
+  if (instr->arch_opcode() == kRiscvTst64 ||
+      instr->arch_opcode() == kRiscvTst32) {
+#elif V8_TARGET_ARCH_RISCV32
+  if (instr->arch_opcode() == kRiscvTst32) {
+#endif
     Condition cc = FlagsConditionToConditionTst(condition);
     __ Branch(tlabel, cc, kScratchReg, Operand(zero_reg));
 #if V8_TARGET_ARCH_RISCV64
@@ -3763,9 +3655,29 @@ void AssembleBranchToLabels(CodeGenerator* gen, MacroAssembler* masm,
       default:
         UNSUPPORTED_COND(instr->arch_opcode(), condition);
     }
+#if V8_TARGET_ARCH_RISCV64
+  } else if (instr->arch_opcode() == kRiscvCmp ||
+             instr->arch_opcode() == kRiscvCmp32) {
+#elif V8_TARGET_ARCH_RISCV32
   } else if (instr->arch_opcode() == kRiscvCmp) {
+#endif
     Condition cc = FlagsConditionToConditionCmp(condition);
-    __ Branch(tlabel, cc, i.InputRegister(0), i.InputOperand(1));
+    Register left = i.InputRegister(0);
+    Operand right = i.InputOperand(1);
+    // Word32Compare has two temp registers.
+#if V8_TARGET_ARCH_RISCV64
+    if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kRiscvCmp32)) {
+      Register temp0 = i.TempRegister(0);
+      Register temp1 = right.is_reg() ? i.TempRegister(1) : no_reg;
+      __ slliw(temp0, left, 0);
+      left = temp0;
+      if (temp1 != no_reg) {
+        __ slliw(temp1, right.rm(), 0);
+        right = Operand(temp1);
+      }
+    }
+#endif
+    __ Branch(tlabel, cc, left, right);
   } else if (instr->arch_opcode() == kRiscvCmpZero) {
     Condition cc = FlagsConditionToConditionCmp(condition);
     if (i.InputOrZeroRegister(0) == zero_reg && IsInludeEqual(cc)) {
@@ -3829,7 +3741,7 @@ void CodeGenerator::AssembleArchTrap(Instruction* instr,
    public:
     OutOfLineTrap(CodeGenerator* gen, Instruction* instr)
         : OutOfLineCode(gen), instr_(instr), gen_(gen) {}
-    void Generate() final {
+    void Generate() override {
       RiscvOperandConverter i(gen_, instr_);
       TrapId trap_id =
           static_cast<TrapId>(i.InputInt32(instr_->InputCount() - 1));
@@ -3838,32 +3750,16 @@ void CodeGenerator::AssembleArchTrap(Instruction* instr,
 
    private:
     void GenerateCallToTrap(TrapId trap_id) {
-      if (trap_id == TrapId::kInvalid) {
-        // We cannot test calls to the runtime in cctest/test-run-wasm.
-        // Therefore we emit a call to C here instead of a call to the runtime.
-        // We use the context register as the scratch register, because we do
-        // not have a context here.
-        __ PrepareCallCFunction(0, 0, cp);
-        __ CallCFunction(
-            ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-        __ LeaveFrame(StackFrame::WASM);
-        auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-        int pop_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-        pop_count += (pop_count & 1);  // align
-        __ Drop(pop_count);
-        __ Ret();
-      } else {
-        gen_->AssembleSourcePosition(instr_);
-        // A direct call to a wasm runtime stub defined in this module.
-        // Just encode the stub index. This will be patched when the code
-        // is added to the native module and copied into wasm code space.
-        __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-        ReferenceMap* reference_map =
-            gen_->zone()->New<ReferenceMap>(gen_->zone());
-        gen_->RecordSafepoint(reference_map);
-        if (v8_flags.debug_code) {
-          __ stop();
-        }
+      gen_->AssembleSourcePosition(instr_);
+      // A direct call to a wasm runtime stub defined in this module.
+      // Just encode the stub index. This will be patched when the code
+      // is added to the native module and copied into wasm code space.
+      __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+      ReferenceMap* reference_map =
+          gen_->zone()->New<ReferenceMap>(gen_->zone());
+      gen_->RecordSafepoint(reference_map);
+      if (v8_flags.debug_code) {
+        __ stop();
       }
     }
     Instruction* instr_;
@@ -3887,7 +3783,12 @@ void CodeGenerator::AssembleArchBoolean(Instruction* instr,
   // implemented differently than on the other arch's. The compare operations
   // emit riscv64 pseudo-instructions, which are checked and handled here.
 
-  if (instr->arch_opcode() == kRiscvTst) {
+#if V8_TARGET_ARCH_RISCV64
+  if (instr->arch_opcode() == kRiscvTst64 ||
+      instr->arch_opcode() == kRiscvTst32) {
+#elif V8_TARGET_ARCH_RISCV32
+  if (instr->arch_opcode() == kRiscvTst32) {
+#endif
     Condition cc = FlagsConditionToConditionTst(condition);
     if (cc == eq) {
       __ Sltu(result, kScratchReg, 1);
@@ -3923,13 +3824,30 @@ void CodeGenerator::AssembleArchBoolean(Instruction* instr,
 #endif
     // Overflow occurs if overflow register is not zero
     __ Sgtu(result, kScratchReg, zero_reg);
+#if V8_TARGET_ARCH_RISCV64
+  } else if (instr->arch_opcode() == kRiscvCmp ||
+             instr->arch_opcode() == kRiscvCmp32) {
+#elif V8_TARGET_ARCH_RISCV32
   } else if (instr->arch_opcode() == kRiscvCmp) {
+#endif
     Condition cc = FlagsConditionToConditionCmp(condition);
+    Register left = i.InputRegister(0);
+    Operand right = i.InputOperand(1);
+#if V8_TARGET_ARCH_RISCV64
+    if (COMPRESS_POINTERS_BOOL && (instr->arch_opcode() == kRiscvCmp32)) {
+      Register temp0 = i.TempRegister(0);
+      Register temp1 = right.is_reg() ? i.TempRegister(1) : no_reg;
+      __ slliw(temp0, left, 0);
+      left = temp0;
+      if (temp1 != no_reg) {
+        __ slliw(temp1, right.rm(), 0);
+        right = Operand(temp1);
+      }
+    }
+#endif
     switch (cc) {
       case eq:
       case ne: {
-        Register left = i.InputOrZeroRegister(0);
-        Operand right = i.InputOperand(1);
         if (instr->InputAt(1)->IsImmediate()) {
           if (is_int12(-right.immediate())) {
             if (right.immediate() == 0) {
@@ -4511,7 +4429,7 @@ void CodeGenerator::AssembleMove(InstructionOperand* source,
           Handle<HeapObject> src_object = src.ToHeapObject();
           RootIndex index;
           if (IsMaterializableFromRoot(src_object, &index)) {
-            __ LoadRoot(dst, index);
+            __ LoadTaggedRoot(dst, index);
           } else {
             __ li(dst, src_object, RelocInfo::COMPRESSED_EMBEDDED_OBJECT);
           }
@@ -4785,12 +4703,13 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 }
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
-  int new_slots = ElementSizeInPointers(rep);
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = ElementSizeInPointers(rep);
   RiscvOperandConverter g(this, nullptr);
   if (dest->IsRegister()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ Pop(g.ToRegister(dest));
   } else if (dest->IsStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     UseScratchRegisterScope temps(masm());
     Register scratch = temps.Acquire();
     __ Pop(scratch);
@@ -4799,12 +4718,13 @@ void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ AddWord(sp, sp, Operand(new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ AddWord(sp, sp, Operand(dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
diff --git a/deps/v8/src/compiler/backend/riscv/instruction-codes-riscv.h b/deps/v8/src/compiler/backend/riscv/instruction-codes-riscv.h
index dd854aa22daa4c..cd383d286db0de 100644
--- a/deps/v8/src/compiler/backend/riscv/instruction-codes-riscv.h
+++ b/deps/v8/src/compiler/backend/riscv/instruction-codes-riscv.h
@@ -12,60 +12,67 @@ namespace compiler {
 // RISC-V-specific opcodes that specify which assembly sequence to emit.
 // Most opcodes specify a single instruction.
 #if V8_TARGET_ARCH_RISCV64
-#define TARGET_ARCH_OPCODE_LIST_SPECAIL(V) \
-  V(RiscvAdd64)                            \
-  V(RiscvAddOvf64)                         \
-  V(RiscvSub64)                            \
-  V(RiscvSubOvf64)                         \
-  V(RiscvMulHigh64)                        \
-  V(RiscvMulHighU64)                       \
-  V(RiscvMul64)                            \
-  V(RiscvMulOvf64)                         \
-  V(RiscvDiv64)                            \
-  V(RiscvDivU64)                           \
-  V(RiscvMod64)                            \
-  V(RiscvModU64)                           \
-  V(RiscvZeroExtendWord)                   \
-  V(RiscvSignExtendWord)                   \
-  V(RiscvClz64)                            \
-  V(RiscvCtz64)                            \
-  V(RiscvPopcnt64)                         \
-  V(RiscvShl64)                            \
-  V(RiscvShr64)                            \
-  V(RiscvSar64)                            \
-  V(RiscvRor64)                            \
-  V(RiscvFloat64RoundDown)                 \
-  V(RiscvFloat64RoundTruncate)             \
-  V(RiscvFloat64RoundUp)                   \
-  V(RiscvFloat64RoundTiesEven)             \
-  V(RiscvTruncLS)                          \
-  V(RiscvTruncLD)                          \
-  V(RiscvTruncUlS)                         \
-  V(RiscvTruncUlD)                         \
-  V(RiscvCvtSL)                            \
-  V(RiscvCvtSUl)                           \
-  V(RiscvCvtDL)                            \
-  V(RiscvCvtDUl)                           \
-  V(RiscvLd)                               \
-  V(RiscvSd)                               \
-  V(RiscvUsd)                              \
-  V(RiscvLwu)                              \
-  V(RiscvUlwu)                             \
-  V(RiscvBitcastDL)                        \
-  V(RiscvBitcastLD)                        \
-  V(RiscvByteSwap64)                       \
-  V(RiscvWord64AtomicLoadUint64)           \
-  V(RiscvWord64AtomicStoreWord64)          \
-  V(RiscvWord64AtomicAddUint64)            \
-  V(RiscvWord64AtomicSubUint64)            \
-  V(RiscvWord64AtomicAndUint64)            \
-  V(RiscvWord64AtomicOrUint64)             \
-  V(RiscvWord64AtomicXorUint64)            \
-  V(RiscvWord64AtomicExchangeUint64)       \
-  V(RiscvStoreCompressTagged)              \
-  V(RiscvLoadDecompressTaggedSigned)       \
-  V(RiscvLoadDecompressTagged)             \
-  V(RiscvWord64AtomicCompareExchangeUint64)
+#define TARGET_ARCH_OPCODE_LIST_SPECAIL(V)  \
+  V(RiscvAdd64)                             \
+  V(RiscvAddOvf64)                          \
+  V(RiscvSub64)                             \
+  V(RiscvSubOvf64)                          \
+  V(RiscvMulHigh64)                         \
+  V(RiscvMulHighU64)                        \
+  V(RiscvMul64)                             \
+  V(RiscvMulOvf64)                          \
+  V(RiscvDiv64)                             \
+  V(RiscvDivU64)                            \
+  V(RiscvMod64)                             \
+  V(RiscvModU64)                            \
+  V(RiscvZeroExtendWord)                    \
+  V(RiscvSignExtendWord)                    \
+  V(RiscvClz64)                             \
+  V(RiscvCtz64)                             \
+  V(RiscvPopcnt64)                          \
+  V(RiscvShl64)                             \
+  V(RiscvShr64)                             \
+  V(RiscvSar64)                             \
+  V(RiscvRor64)                             \
+  V(RiscvFloat64RoundDown)                  \
+  V(RiscvFloat64RoundTruncate)              \
+  V(RiscvFloat64RoundUp)                    \
+  V(RiscvFloat64RoundTiesEven)              \
+  V(RiscvTruncLS)                           \
+  V(RiscvTruncLD)                           \
+  V(RiscvTruncUlS)                          \
+  V(RiscvTruncUlD)                          \
+  V(RiscvCvtSL)                             \
+  V(RiscvCvtSUl)                            \
+  V(RiscvCvtDL)                             \
+  V(RiscvCvtDUl)                            \
+  V(RiscvLd)                                \
+  V(RiscvSd)                                \
+  V(RiscvUsd)                               \
+  V(RiscvLwu)                               \
+  V(RiscvUlwu)                              \
+  V(RiscvBitcastDL)                         \
+  V(RiscvBitcastLD)                         \
+  V(RiscvByteSwap64)                        \
+  V(RiscvWord64AtomicLoadUint64)            \
+  V(RiscvWord64AtomicStoreWord64)           \
+  V(RiscvWord64AtomicAddUint64)             \
+  V(RiscvWord64AtomicSubUint64)             \
+  V(RiscvWord64AtomicAndUint64)             \
+  V(RiscvWord64AtomicOrUint64)              \
+  V(RiscvWord64AtomicXorUint64)             \
+  V(RiscvWord64AtomicExchangeUint64)        \
+  V(RiscvStoreCompressTagged)               \
+  V(RiscvLoadDecompressTaggedSigned)        \
+  V(RiscvLoadDecompressTagged)              \
+  V(RiscvLoadDecodeSandboxedPointer)        \
+  V(RiscvStoreEncodeSandboxedPointer)       \
+  V(RiscvAtomicLoadDecompressTaggedSigned)  \
+  V(RiscvAtomicLoadDecompressTagged)        \
+  V(RiscvAtomicStoreCompressTagged)         \
+  V(RiscvWord64AtomicCompareExchangeUint64) \
+  V(RiscvCmp32)                             \
+  V(RiscvTst64)
 #elif V8_TARGET_ARCH_RISCV32
 #define TARGET_ARCH_OPCODE_LIST_SPECAIL(V) \
   V(RiscvAddOvf)                           \
@@ -117,7 +124,7 @@ namespace compiler {
   V(RiscvPopcnt32)                        \
   V(RiscvRor32)                           \
   V(RiscvMov)                             \
-  V(RiscvTst)                             \
+  V(RiscvTst32)                           \
   V(RiscvCmp)                             \
   V(RiscvCmpZero)                         \
   V(RiscvCmpS)                            \
@@ -207,14 +214,9 @@ namespace compiler {
   V(RiscvS128Const)                       \
   V(RiscvS128Zero)                        \
   V(RiscvS128AllOnes)                     \
-  V(RiscvI32x4Splat)                      \
   V(RiscvI32x4ExtractLane)                \
   V(RiscvI32x4ReplaceLane)                \
-  V(RiscvI32x4Add)                        \
-  V(RiscvI32x4Sub)                        \
   V(RiscvF64x2Abs)                        \
-  V(RiscvF64x2Neg)                        \
-  V(RiscvF32x4Splat)                      \
   V(RiscvF32x4ExtractLane)                \
   V(RiscvF32x4ReplaceLane)                \
   V(RiscvF32x4SConvertI32x4)              \
@@ -223,35 +225,13 @@ namespace compiler {
   V(RiscvI64x2SConvertI32x4High)          \
   V(RiscvI64x2UConvertI32x4Low)           \
   V(RiscvI64x2UConvertI32x4High)          \
-  V(RiscvI32x4Mul)                        \
-  V(RiscvI32x4MaxS)                       \
-  V(RiscvI32x4MinS)                       \
-  V(RiscvI32x4Eq)                         \
-  V(RiscvI32x4Ne)                         \
   V(RiscvI32x4Shl)                        \
   V(RiscvI32x4ShrS)                       \
   V(RiscvI32x4ShrU)                       \
-  V(RiscvI32x4MaxU)                       \
-  V(RiscvI32x4MinU)                       \
-  V(RiscvI64x2GtS)                        \
-  V(RiscvI64x2GeS)                        \
-  V(RiscvI64x2Eq)                         \
-  V(RiscvI64x2Ne)                         \
   V(RiscvF64x2Sqrt)                       \
-  V(RiscvF64x2Add)                        \
-  V(RiscvF64x2Sub)                        \
-  V(RiscvF64x2Mul)                        \
-  V(RiscvF64x2Div)                        \
-  V(RiscvF64x2Min)                        \
-  V(RiscvF64x2Max)                        \
   V(RiscvF64x2ConvertLowI32x4S)           \
   V(RiscvF64x2ConvertLowI32x4U)           \
   V(RiscvF64x2PromoteLowF32x4)            \
-  V(RiscvF64x2Eq)                         \
-  V(RiscvF64x2Ne)                         \
-  V(RiscvF64x2Lt)                         \
-  V(RiscvF64x2Le)                         \
-  V(RiscvF64x2Splat)                      \
   V(RiscvF64x2ExtractLane)                \
   V(RiscvF64x2ReplaceLane)                \
   V(RiscvF64x2Pmin)                       \
@@ -260,35 +240,19 @@ namespace compiler {
   V(RiscvF64x2Floor)                      \
   V(RiscvF64x2Trunc)                      \
   V(RiscvF64x2NearestInt)                 \
-  V(RiscvI64x2Splat)                      \
+  V(RiscvI64x2SplatI32Pair)               \
   V(RiscvI64x2ExtractLane)                \
   V(RiscvI64x2ReplaceLane)                \
-  V(RiscvI64x2Add)                        \
-  V(RiscvI64x2Sub)                        \
-  V(RiscvI64x2Mul)                        \
-  V(RiscvI64x2Abs)                        \
-  V(RiscvI64x2Neg)                        \
+  V(RiscvI64x2ReplaceLaneI32Pair)         \
   V(RiscvI64x2Shl)                        \
   V(RiscvI64x2ShrS)                       \
   V(RiscvI64x2ShrU)                       \
-  V(RiscvI64x2BitMask)                    \
   V(RiscvF32x4Abs)                        \
-  V(RiscvF32x4Neg)                        \
   V(RiscvF32x4Sqrt)                       \
   V(RiscvF32x4Qfma)                       \
   V(RiscvF32x4Qfms)                       \
   V(RiscvF64x2Qfma)                       \
   V(RiscvF64x2Qfms)                       \
-  V(RiscvF32x4Add)                        \
-  V(RiscvF32x4Sub)                        \
-  V(RiscvF32x4Mul)                        \
-  V(RiscvF32x4Div)                        \
-  V(RiscvF32x4Max)                        \
-  V(RiscvF32x4Min)                        \
-  V(RiscvF32x4Eq)                         \
-  V(RiscvF32x4Ne)                         \
-  V(RiscvF32x4Lt)                         \
-  V(RiscvF32x4Le)                         \
   V(RiscvF32x4Pmin)                       \
   V(RiscvF32x4Pmax)                       \
   V(RiscvF32x4DemoteF64x2Zero)            \
@@ -298,111 +262,28 @@ namespace compiler {
   V(RiscvF32x4NearestInt)                 \
   V(RiscvI32x4SConvertF32x4)              \
   V(RiscvI32x4UConvertF32x4)              \
-  V(RiscvI32x4Neg)                        \
-  V(RiscvI32x4GtS)                        \
-  V(RiscvI32x4GeS)                        \
-  V(RiscvI32x4GtU)                        \
-  V(RiscvI32x4GeU)                        \
-  V(RiscvI32x4Abs)                        \
-  V(RiscvI32x4BitMask)                    \
   V(RiscvI32x4TruncSatF64x2SZero)         \
   V(RiscvI32x4TruncSatF64x2UZero)         \
-  V(RiscvI16x8Splat)                      \
   V(RiscvI16x8ExtractLaneU)               \
   V(RiscvI16x8ExtractLaneS)               \
   V(RiscvI16x8ReplaceLane)                \
-  V(RiscvI16x8Neg)                        \
   V(RiscvI16x8Shl)                        \
   V(RiscvI16x8ShrS)                       \
   V(RiscvI16x8ShrU)                       \
-  V(RiscvI16x8Add)                        \
-  V(RiscvI16x8AddSatS)                    \
-  V(RiscvI16x8Sub)                        \
-  V(RiscvI16x8SubSatS)                    \
-  V(RiscvI16x8Mul)                        \
-  V(RiscvI16x8MaxS)                       \
-  V(RiscvI16x8MinS)                       \
-  V(RiscvI16x8Eq)                         \
-  V(RiscvI16x8Ne)                         \
-  V(RiscvI16x8GtS)                        \
-  V(RiscvI16x8GeS)                        \
-  V(RiscvI16x8AddSatU)                    \
-  V(RiscvI16x8SubSatU)                    \
-  V(RiscvI16x8MaxU)                       \
-  V(RiscvI16x8MinU)                       \
-  V(RiscvI16x8GtU)                        \
-  V(RiscvI16x8GeU)                        \
-  V(RiscvI16x8RoundingAverageU)           \
-  V(RiscvI16x8Q15MulRSatS)                \
-  V(RiscvI16x8Abs)                        \
-  V(RiscvI16x8BitMask)                    \
-  V(RiscvI8x16Splat)                      \
   V(RiscvI8x16ExtractLaneU)               \
   V(RiscvI8x16ExtractLaneS)               \
   V(RiscvI8x16ReplaceLane)                \
-  V(RiscvI8x16Neg)                        \
   V(RiscvI8x16Shl)                        \
   V(RiscvI8x16ShrS)                       \
-  V(RiscvI8x16Add)                        \
-  V(RiscvI8x16AddSatS)                    \
-  V(RiscvI8x16Sub)                        \
-  V(RiscvI8x16SubSatS)                    \
-  V(RiscvI8x16MaxS)                       \
-  V(RiscvI8x16MinS)                       \
-  V(RiscvI8x16Eq)                         \
-  V(RiscvI8x16Ne)                         \
-  V(RiscvI8x16GtS)                        \
-  V(RiscvI8x16GeS)                        \
   V(RiscvI8x16ShrU)                       \
-  V(RiscvI8x16AddSatU)                    \
-  V(RiscvI8x16SubSatU)                    \
-  V(RiscvI8x16MaxU)                       \
-  V(RiscvI8x16MinU)                       \
-  V(RiscvI8x16GtU)                        \
-  V(RiscvI8x16GeU)                        \
   V(RiscvI8x16RoundingAverageU)           \
-  V(RiscvI8x16Abs)                        \
-  V(RiscvI8x16BitMask)                    \
   V(RiscvI8x16Popcnt)                     \
-  V(RiscvS128And)                         \
-  V(RiscvS128Or)                          \
-  V(RiscvS128Xor)                         \
-  V(RiscvS128Not)                         \
+  V(RiscvVnot)                            \
   V(RiscvS128Select)                      \
-  V(RiscvS128AndNot)                      \
   V(RiscvS128Load64Zero)                  \
   V(RiscvS128Load32Zero)                  \
-  V(RiscvI32x4AllTrue)                    \
-  V(RiscvI16x8AllTrue)                    \
   V(RiscvV128AnyTrue)                     \
-  V(RiscvI8x16AllTrue)                    \
-  V(RiscvI64x2AllTrue)                    \
-  V(RiscvS32x4InterleaveRight)            \
-  V(RiscvS32x4InterleaveLeft)             \
-  V(RiscvS32x4PackEven)                   \
-  V(RiscvS32x4PackOdd)                    \
-  V(RiscvS32x4InterleaveEven)             \
-  V(RiscvS32x4InterleaveOdd)              \
-  V(RiscvS32x4Shuffle)                    \
-  V(RiscvS16x8InterleaveRight)            \
-  V(RiscvS16x8InterleaveLeft)             \
-  V(RiscvS16x8PackEven)                   \
-  V(RiscvS16x8PackOdd)                    \
-  V(RiscvS16x8InterleaveEven)             \
-  V(RiscvS16x8InterleaveOdd)              \
-  V(RiscvS16x4Reverse)                    \
-  V(RiscvS16x2Reverse)                    \
-  V(RiscvS8x16InterleaveRight)            \
-  V(RiscvS8x16InterleaveLeft)             \
-  V(RiscvS8x16PackEven)                   \
-  V(RiscvS8x16PackOdd)                    \
-  V(RiscvS8x16InterleaveEven)             \
-  V(RiscvS8x16InterleaveOdd)              \
   V(RiscvI8x16Shuffle)                    \
-  V(RiscvS8x16Concat)                     \
-  V(RiscvS8x8Reverse)                     \
-  V(RiscvS8x4Reverse)                     \
-  V(RiscvS8x2Reverse)                     \
   V(RiscvS128LoadSplat)                   \
   V(RiscvS128Load64ExtendS)               \
   V(RiscvS128Load64ExtendU)               \
@@ -410,27 +291,63 @@ namespace compiler {
   V(RiscvS128StoreLane)                   \
   V(RiscvRvvLd)                           \
   V(RiscvRvvSt)                           \
-  V(RiscvI32x4SConvertI16x8Low)           \
-  V(RiscvI32x4SConvertI16x8High)          \
-  V(RiscvI32x4UConvertI16x8Low)           \
-  V(RiscvI32x4UConvertI16x8High)          \
-  V(RiscvI16x8SConvertI8x16Low)           \
-  V(RiscvI16x8SConvertI8x16High)          \
-  V(RiscvI16x8SConvertI32x4)              \
-  V(RiscvI16x8UConvertI32x4)              \
-  V(RiscvI16x8UConvertI8x16Low)           \
-  V(RiscvI16x8UConvertI8x16High)          \
-  V(RiscvI8x16SConvertI16x8)              \
-  V(RiscvI8x16UConvertI16x8)              \
+  V(RiscvVmv)                             \
+  V(RiscvVandVv)                          \
+  V(RiscvVnotVv)                          \
+  V(RiscvVorVv)                           \
+  V(RiscvVxorVv)                          \
   V(RiscvVwmul)                           \
   V(RiscvVwmulu)                          \
   V(RiscvVmvSx)                           \
+  V(RiscvVmvXs)                           \
   V(RiscvVcompress)                       \
   V(RiscvVaddVv)                          \
-  V(RiscvVwadd)                           \
-  V(RiscvVwaddu)                          \
+  V(RiscvVsubVv)                          \
+  V(RiscvVwaddVv)                         \
+  V(RiscvVwadduVv)                        \
+  V(RiscvVwadduWx)                        \
   V(RiscvVrgather)                        \
-  V(RiscvVslidedown)
+  V(RiscvVslidedown)                      \
+  V(RiscvVAbs)                            \
+  V(RiscvVsll)                            \
+  V(RiscvVfmvVf)                          \
+  V(RiscvVnegVv)                          \
+  V(RiscvVfnegVv)                         \
+  V(RiscvVmaxuVv)                         \
+  V(RiscvVmax)                            \
+  V(RiscvVminuVv)                         \
+  V(RiscvVminsVv)                         \
+  V(RiscvVmulVv)                          \
+  V(RiscvVdivu)                           \
+  V(RiscvVmslt)                           \
+  V(RiscvVgtsVv)                          \
+  V(RiscvVgesVv)                          \
+  V(RiscvVgeuVv)                          \
+  V(RiscvVgtuVv)                          \
+  V(RiscvVeqVv)                           \
+  V(RiscvVneVv)                           \
+  V(RiscvVaddSatSVv)                      \
+  V(RiscvVaddSatUVv)                      \
+  V(RiscvVsubSatSVv)                      \
+  V(RiscvVsubSatUVv)                      \
+  V(RiscvVmfeqVv)                         \
+  V(RiscvVmfneVv)                         \
+  V(RiscvVmfleVv)                         \
+  V(RiscvVmfltVv)                         \
+  V(RiscvVfaddVv)                         \
+  V(RiscvVfsubVv)                         \
+  V(RiscvVfmulVv)                         \
+  V(RiscvVfdivVv)                         \
+  V(RiscvVfminVv)                         \
+  V(RiscvVfmaxVv)                         \
+  V(RiscvVmergeVx)                        \
+  V(RiscvVsmulVv)                         \
+  V(RiscvVnclipu)                         \
+  V(RiscvVnclip)                          \
+  V(RiscvVredminuVs)                      \
+  V(RiscvVAllTrue)                        \
+  V(RiscvVzextVf2)                        \
+  V(RiscvVsextVf2)
 
 #define TARGET_ARCH_OPCODE_LIST(V)  \
   TARGET_ARCH_OPCODE_LIST_COMMON(V) \
diff --git a/deps/v8/src/compiler/backend/riscv/instruction-scheduler-riscv.cc b/deps/v8/src/compiler/backend/riscv/instruction-scheduler-riscv.cc
index 51663e2b6eefa2..f809e0412708be 100644
--- a/deps/v8/src/compiler/backend/riscv/instruction-scheduler-riscv.cc
+++ b/deps/v8/src/compiler/backend/riscv/instruction-scheduler-riscv.cc
@@ -53,6 +53,9 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kRiscvTruncLS:
     case kRiscvTruncUlD:
     case kRiscvTruncUlS:
+    case kRiscvLoadDecodeSandboxedPointer:
+    case kRiscvStoreEncodeSandboxedPointer:
+    case kRiscvCmp32:
 #elif V8_TARGET_ARCH_RISCV32
     case kRiscvAdd32:
     case kRiscvAddPair:
@@ -98,18 +101,7 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kRiscvDivS:
     case kRiscvDivU32:
     case kRiscvF64x2Abs:
-    case kRiscvF64x2Neg:
     case kRiscvF64x2Sqrt:
-    case kRiscvF64x2Add:
-    case kRiscvF64x2Sub:
-    case kRiscvF64x2Mul:
-    case kRiscvF64x2Div:
-    case kRiscvF64x2Min:
-    case kRiscvF64x2Max:
-    case kRiscvF64x2Eq:
-    case kRiscvF64x2Ne:
-    case kRiscvF64x2Lt:
-    case kRiscvF64x2Le:
     case kRiscvF64x2Pmin:
     case kRiscvF64x2Pmax:
     case kRiscvF64x2ConvertLowI32x4S:
@@ -119,32 +111,15 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kRiscvF64x2Floor:
     case kRiscvF64x2Trunc:
     case kRiscvF64x2NearestInt:
-    case kRiscvI64x2Splat:
+    case kRiscvI64x2SplatI32Pair:
     case kRiscvI64x2ExtractLane:
     case kRiscvI64x2ReplaceLane:
-    case kRiscvI64x2Add:
-    case kRiscvI64x2Sub:
-    case kRiscvI64x2Mul:
-    case kRiscvI64x2Neg:
-    case kRiscvI64x2Abs:
+    case kRiscvI64x2ReplaceLaneI32Pair:
     case kRiscvI64x2Shl:
     case kRiscvI64x2ShrS:
     case kRiscvI64x2ShrU:
-    case kRiscvI64x2BitMask:
-    case kRiscvI64x2GtS:
-    case kRiscvI64x2GeS:
     case kRiscvF32x4Abs:
-    case kRiscvF32x4Add:
-    case kRiscvF32x4Eq:
     case kRiscvF32x4ExtractLane:
-    case kRiscvF32x4Lt:
-    case kRiscvF32x4Le:
-    case kRiscvF32x4Max:
-    case kRiscvF32x4Min:
-    case kRiscvF32x4Mul:
-    case kRiscvF32x4Div:
-    case kRiscvF32x4Ne:
-    case kRiscvF32x4Neg:
     case kRiscvF32x4Sqrt:
     case kRiscvF64x2Qfma:
     case kRiscvF64x2Qfms:
@@ -152,8 +127,6 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kRiscvF32x4Qfms:
     case kRiscvF32x4ReplaceLane:
     case kRiscvF32x4SConvertI32x4:
-    case kRiscvF32x4Splat:
-    case kRiscvF32x4Sub:
     case kRiscvF32x4UConvertI32x4:
     case kRiscvF32x4Pmin:
     case kRiscvF32x4Pmax:
@@ -162,9 +135,6 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kRiscvF32x4Floor:
     case kRiscvF32x4Trunc:
     case kRiscvF32x4NearestInt:
-    case kRiscvI64x2Eq:
-    case kRiscvI64x2Ne:
-    case kRiscvF64x2Splat:
     case kRiscvF64x2ExtractLane:
     case kRiscvF64x2ReplaceLane:
     case kRiscvFloat32Max:
@@ -186,100 +156,28 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kRiscvI64x2SConvertI32x4High:
     case kRiscvI64x2UConvertI32x4Low:
     case kRiscvI64x2UConvertI32x4High:
-    case kRiscvI16x8Add:
-    case kRiscvI16x8AddSatS:
-    case kRiscvI16x8AddSatU:
-    case kRiscvI16x8Eq:
     case kRiscvI16x8ExtractLaneU:
     case kRiscvI16x8ExtractLaneS:
-    case kRiscvI16x8GeS:
-    case kRiscvI16x8GeU:
-    case kRiscvI16x8GtS:
-    case kRiscvI16x8GtU:
-    case kRiscvI16x8MaxS:
-    case kRiscvI16x8MaxU:
-    case kRiscvI16x8MinS:
-    case kRiscvI16x8MinU:
-    case kRiscvI16x8Mul:
-    case kRiscvI16x8Ne:
-    case kRiscvI16x8Neg:
     case kRiscvI16x8ReplaceLane:
-    case kRiscvI8x16SConvertI16x8:
-    case kRiscvI16x8SConvertI32x4:
-    case kRiscvI16x8SConvertI8x16High:
-    case kRiscvI16x8SConvertI8x16Low:
     case kRiscvI16x8Shl:
     case kRiscvI16x8ShrS:
     case kRiscvI16x8ShrU:
     case kRiscvI32x4TruncSatF64x2SZero:
     case kRiscvI32x4TruncSatF64x2UZero:
-    case kRiscvI16x8Splat:
-    case kRiscvI16x8Sub:
-    case kRiscvI16x8SubSatS:
-    case kRiscvI16x8SubSatU:
-    case kRiscvI8x16UConvertI16x8:
-    case kRiscvI16x8UConvertI32x4:
-    case kRiscvI16x8UConvertI8x16High:
-    case kRiscvI16x8UConvertI8x16Low:
-    case kRiscvI16x8RoundingAverageU:
-    case kRiscvI16x8Q15MulRSatS:
-    case kRiscvI16x8Abs:
-    case kRiscvI16x8BitMask:
-    case kRiscvI32x4Add:
-    case kRiscvI32x4Eq:
     case kRiscvI32x4ExtractLane:
-    case kRiscvI32x4GeS:
-    case kRiscvI32x4GeU:
-    case kRiscvI32x4GtS:
-    case kRiscvI32x4GtU:
-    case kRiscvI32x4MaxS:
-    case kRiscvI32x4MaxU:
-    case kRiscvI32x4MinS:
-    case kRiscvI32x4MinU:
-    case kRiscvI32x4Mul:
-    case kRiscvI32x4Ne:
-    case kRiscvI32x4Neg:
     case kRiscvI32x4ReplaceLane:
     case kRiscvI32x4SConvertF32x4:
-    case kRiscvI32x4SConvertI16x8High:
-    case kRiscvI32x4SConvertI16x8Low:
     case kRiscvI32x4Shl:
     case kRiscvI32x4ShrS:
     case kRiscvI32x4ShrU:
-    case kRiscvI32x4Splat:
-    case kRiscvI32x4Sub:
     case kRiscvI32x4UConvertF32x4:
-    case kRiscvI32x4UConvertI16x8High:
-    case kRiscvI32x4UConvertI16x8Low:
-    case kRiscvI32x4Abs:
-    case kRiscvI32x4BitMask:
-    case kRiscvI8x16Add:
-    case kRiscvI8x16AddSatS:
-    case kRiscvI8x16AddSatU:
-    case kRiscvI8x16Eq:
     case kRiscvI8x16ExtractLaneU:
     case kRiscvI8x16ExtractLaneS:
-    case kRiscvI8x16GeS:
-    case kRiscvI8x16GeU:
-    case kRiscvI8x16GtS:
-    case kRiscvI8x16GtU:
-    case kRiscvI8x16MaxS:
-    case kRiscvI8x16MaxU:
-    case kRiscvI8x16MinS:
-    case kRiscvI8x16MinU:
-    case kRiscvI8x16Ne:
-    case kRiscvI8x16Neg:
     case kRiscvI8x16ReplaceLane:
     case kRiscvI8x16Shl:
     case kRiscvI8x16ShrS:
     case kRiscvI8x16ShrU:
-    case kRiscvI8x16Splat:
-    case kRiscvI8x16Sub:
-    case kRiscvI8x16SubSatS:
-    case kRiscvI8x16SubSatU:
     case kRiscvI8x16RoundingAverageU:
-    case kRiscvI8x16Abs:
-    case kRiscvI8x16BitMask:
     case kRiscvI8x16Popcnt:
     case kRiscvMaxD:
     case kRiscvMaxS:
@@ -303,57 +201,72 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kRiscvRor32:
     case kRiscvRoundWD:
     case kRiscvRoundWS:
-    case kRiscvS128And:
-    case kRiscvS128Or:
-    case kRiscvS128Not:
+    case kRiscvVnot:
     case kRiscvS128Select:
-    case kRiscvS128AndNot:
-    case kRiscvS128Xor:
     case kRiscvS128Const:
     case kRiscvS128Zero:
     case kRiscvS128Load32Zero:
     case kRiscvS128Load64Zero:
     case kRiscvS128AllOnes:
-    case kRiscvS16x8InterleaveEven:
-    case kRiscvS16x8InterleaveOdd:
-    case kRiscvS16x8InterleaveLeft:
-    case kRiscvS16x8InterleaveRight:
-    case kRiscvS16x8PackEven:
-    case kRiscvS16x8PackOdd:
-    case kRiscvS16x2Reverse:
-    case kRiscvS16x4Reverse:
-    case kRiscvI8x16AllTrue:
-    case kRiscvI32x4AllTrue:
-    case kRiscvI16x8AllTrue:
     case kRiscvV128AnyTrue:
-    case kRiscvI64x2AllTrue:
-    case kRiscvS32x4InterleaveEven:
-    case kRiscvS32x4InterleaveOdd:
-    case kRiscvS32x4InterleaveLeft:
-    case kRiscvS32x4InterleaveRight:
-    case kRiscvS32x4PackEven:
-    case kRiscvS32x4PackOdd:
-    case kRiscvS32x4Shuffle:
-    case kRiscvS8x16Concat:
-    case kRiscvS8x16InterleaveEven:
-    case kRiscvS8x16InterleaveOdd:
-    case kRiscvS8x16InterleaveLeft:
-    case kRiscvS8x16InterleaveRight:
-    case kRiscvS8x16PackEven:
-    case kRiscvS8x16PackOdd:
-    case kRiscvS8x2Reverse:
-    case kRiscvS8x4Reverse:
-    case kRiscvS8x8Reverse:
     case kRiscvI8x16Shuffle:
     case kRiscvVwmul:
     case kRiscvVwmulu:
+    case kRiscvVmv:
+    case kRiscvVandVv:
+    case kRiscvVorVv:
+    case kRiscvVnotVv:
+    case kRiscvVxorVv:
     case kRiscvVmvSx:
+    case kRiscvVmvXs:
+    case kRiscvVfmvVf:
     case kRiscvVcompress:
     case kRiscvVaddVv:
-    case kRiscvVwadd:
-    case kRiscvVwaddu:
+    case kRiscvVwaddVv:
+    case kRiscvVwadduVv:
+    case kRiscvVwadduWx:
+    case kRiscvVsubVv:
+    case kRiscvVnegVv:
+    case kRiscvVfnegVv:
+    case kRiscvVmaxuVv:
+    case kRiscvVmax:
+    case kRiscvVminsVv:
+    case kRiscvVminuVv:
+    case kRiscvVmulVv:
+    case kRiscvVdivu:
+    case kRiscvVsmulVv:
+    case kRiscvVmslt:
+    case kRiscvVgtsVv:
+    case kRiscvVgesVv:
+    case kRiscvVgeuVv:
+    case kRiscvVgtuVv:
+    case kRiscvVeqVv:
+    case kRiscvVneVv:
+    case kRiscvVAbs:
+    case kRiscvVaddSatUVv:
+    case kRiscvVaddSatSVv:
+    case kRiscvVsubSatUVv:
+    case kRiscvVsubSatSVv:
     case kRiscvVrgather:
     case kRiscvVslidedown:
+    case kRiscvVredminuVs:
+    case kRiscvVAllTrue:
+    case kRiscvVnclipu:
+    case kRiscvVnclip:
+    case kRiscvVsll:
+    case kRiscvVfaddVv:
+    case kRiscvVfsubVv:
+    case kRiscvVfmulVv:
+    case kRiscvVfdivVv:
+    case kRiscvVfminVv:
+    case kRiscvVfmaxVv:
+    case kRiscvVmfeqVv:
+    case kRiscvVmfneVv:
+    case kRiscvVmfltVv:
+    case kRiscvVmfleVv:
+    case kRiscvVmergeVx:
+    case kRiscvVzextVf2:
+    case kRiscvVsextVf2:
     case kRiscvSar32:
     case kRiscvSignExtendByte:
     case kRiscvSignExtendShort:
@@ -367,17 +280,21 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kRiscvTruncUwS:
     case kRiscvTruncWD:
     case kRiscvTruncWS:
-    case kRiscvTst:
+    case kRiscvTst32:
     case kRiscvXor:
     case kRiscvXor32:
       return kNoOpcodeFlags;
 #if V8_TARGET_ARCH_RISCV64
+    case kRiscvTst64:
     case kRiscvLd:
     case kRiscvLwu:
     case kRiscvUlwu:
     case kRiscvWord64AtomicLoadUint64:
     case kRiscvLoadDecompressTaggedSigned:
     case kRiscvLoadDecompressTagged:
+    case kRiscvAtomicLoadDecompressTaggedSigned:
+    case kRiscvAtomicLoadDecompressTagged:
+    case kRiscvAtomicStoreCompressTagged:
 #elif V8_TARGET_ARCH_RISCV32
     case kRiscvWord32AtomicPairLoad:
 #endif
@@ -1339,11 +1256,12 @@ int InstructionScheduler::GetInstructionLatency(const Instruction* instr) {
     case kRiscvShr64:
     case kRiscvSar64:
     case kRiscvRor64:
+    case kRiscvTst64:
 #endif
+    case kRiscvTst32:
+      return AndLatency(instr->InputAt(0)->IsRegister());
     case kRiscvRor32:
       return 1;
-    case kRiscvTst:
-      return AndLatency(instr->InputAt(1)->IsRegister());
     case kRiscvMov:
       return 1;
     case kRiscvCmpS:
diff --git a/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv.h b/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv.h
index 28cedf9c44b3d8..bc574a9483a5ae 100644
--- a/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv.h
+++ b/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv.h
@@ -8,6 +8,7 @@
 #include "src/compiler/backend/instruction-selector-impl.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
+#include "src/compiler/turboshaft/operations.h"
 
 namespace v8 {
 namespace internal {
@@ -19,10 +20,14 @@ namespace compiler {
 #define TRACE() PrintF("instr_sel: %s at line %d\n", __FUNCTION__, __LINE__)
 
 // Adds RISC-V-specific methods for generating InstructionOperands.
-class RiscvOperandGenerator final : public OperandGenerator {
+template <typename Adapter>
+class RiscvOperandGeneratorT final : public OperandGeneratorT<Adapter> {
  public:
-  explicit RiscvOperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit RiscvOperandGeneratorT<Adapter>(
+      InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
 
   InstructionOperand UseOperand(Node* node, InstructionCode opcode) {
     if (CanBeImmediate(node, opcode)) {
@@ -60,6 +65,24 @@ class RiscvOperandGenerator final : public OperandGenerator {
   }
 
   bool CanBeImmediate(Node* node, InstructionCode mode) {
+    if (node->opcode() == IrOpcode::kCompressedHeapConstant) {
+      if (!COMPRESS_POINTERS_BOOL) return false;
+      // For builtin code we need static roots
+      if (selector()->isolate()->bootstrapper() && !V8_STATIC_ROOTS_BOOL) {
+        return false;
+      }
+      const RootsTable& roots_table = selector()->isolate()->roots_table();
+      RootIndex root_index;
+      CompressedHeapObjectMatcher m(node);
+      if (m.HasResolvedValue() &&
+          roots_table.IsRootHandle(m.ResolvedValue(), &root_index)) {
+        if (!RootsTable::IsReadOnly(root_index)) return false;
+        return CanBeImmediate(MacroAssemblerBase::ReadOnlyRootPtr(
+                                  root_index, selector()->isolate()),
+                              mode);
+      }
+      return false;
+    }
     return IsIntegerConstant(node) &&
            CanBeImmediate(GetIntegerConstantValue(node), mode);
   }
@@ -73,34 +96,43 @@ class RiscvOperandGenerator final : public OperandGenerator {
   }
 };
 
-void InstructionSelector::VisitProtectedStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
-static void VisitRR(InstructionSelector* selector, ArchOpcode opcode,
-                    Node* node) {
-  RiscvOperandGenerator g(selector);
+template <typename T>
+void VisitRR(InstructionSelectorT<TurboshaftAdapter>*, InstructionCode, T) {
+  UNIMPLEMENTED();
+}
+
+void VisitRR(InstructionSelectorT<TurbofanAdapter>* selector,
+             InstructionCode opcode, Node* node) {
+  RiscvOperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)));
 }
 
-static void VisitRRI(InstructionSelector* selector, ArchOpcode opcode,
+template <typename Adapter>
+static void VisitRRI(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
                      Node* node) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm));
 }
 
-static void VisitSimdShift(InstructionSelector* selector, ArchOpcode opcode,
-                           Node* node) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+static void VisitSimdShift(InstructionSelectorT<Adapter>* selector,
+                           ArchOpcode opcode, Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   if (g.IsIntegerConstant(node->InputAt(1))) {
     selector->Emit(opcode, g.DefineAsRegister(node),
                    g.UseRegister(node->InputAt(0)),
@@ -112,50 +144,61 @@ static void VisitSimdShift(InstructionSelector* selector, ArchOpcode opcode,
   }
 }
 
-static void VisitRRIR(InstructionSelector* selector, ArchOpcode opcode,
-                      Node* node) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+static void VisitRRIR(InstructionSelectorT<Adapter>* selector,
+                      ArchOpcode opcode, Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   int32_t imm = OpParameter<int32_t>(node->op());
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)), g.UseImmediate(imm),
                  g.UseRegister(node->InputAt(1)));
 }
 
-static void VisitRRR(InstructionSelector* selector, ArchOpcode opcode,
-                     Node* node) {
-  RiscvOperandGenerator g(selector);
+template <typename T>
+void VisitRRR(InstructionSelectorT<TurboshaftAdapter>*, InstructionCode, T) {
+  UNIMPLEMENTED();
+}
+
+void VisitRRR(InstructionSelectorT<TurbofanAdapter>* selector,
+              InstructionCode opcode, Node* node) {
+  RiscvOperandGeneratorT<TurbofanAdapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseRegister(node->InputAt(1)));
 }
 
-static void VisitUniqueRRR(InstructionSelector* selector, ArchOpcode opcode,
-                           Node* node) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+static void VisitUniqueRRR(InstructionSelectorT<Adapter>* selector,
+                           ArchOpcode opcode, Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseUniqueRegister(node->InputAt(0)),
                  g.UseUniqueRegister(node->InputAt(1)));
 }
 
-void VisitRRRR(InstructionSelector* selector, ArchOpcode opcode, Node* node) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void VisitRRRR(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
+               Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   selector->Emit(
       opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)),
       g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2)));
 }
 
-static void VisitRRO(InstructionSelector* selector, ArchOpcode opcode,
+template <typename Adapter>
+static void VisitRRO(InstructionSelectorT<Adapter>* selector, ArchOpcode opcode,
                      Node* node) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   selector->Emit(opcode, g.DefineAsRegister(node),
                  g.UseRegister(node->InputAt(0)),
                  g.UseOperand(node->InputAt(1), opcode));
 }
 
-bool TryMatchImmediate(InstructionSelector* selector,
+template <typename Adapter>
+bool TryMatchImmediate(InstructionSelectorT<Adapter>* selector,
                        InstructionCode* opcode_return, Node* node,
                        size_t* input_count_return, InstructionOperand* inputs) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   if (g.CanBeImmediate(node, *opcode_return)) {
     *opcode_return |= AddressingModeField::encode(kMode_MRI);
     inputs[0] = g.UseImmediate(node);
@@ -165,11 +208,13 @@ bool TryMatchImmediate(InstructionSelector* selector,
   return false;
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+// Shared routine for multiple binary operations.
+template <typename Adapter, typename Matcher>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode, bool has_reverse_opcode,
                        InstructionCode reverse_opcode,
-                       FlagsContinuation* cont) {
-  RiscvOperandGenerator g(selector);
+                       FlagsContinuationT<Adapter>* cont) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   InstructionOperand inputs[2];
   size_t input_count = 0;
@@ -209,43 +254,60 @@ static void VisitBinop(InstructionSelector* selector, Node* node,
                                  inputs, cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter, typename Matcher>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode, bool has_reverse_opcode,
                        InstructionCode reverse_opcode) {
-  FlagsContinuation cont;
-  VisitBinop(selector, node, opcode, has_reverse_opcode, reverse_opcode, &cont);
+  FlagsContinuationT<Adapter> cont;
+  VisitBinop<Adapter, Matcher>(selector, node, opcode, has_reverse_opcode,
+                               reverse_opcode, &cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
-                       InstructionCode opcode, FlagsContinuation* cont) {
-  VisitBinop(selector, node, opcode, false, kArchNop, cont);
+template <typename Adapter, typename Matcher>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
+                       InstructionCode opcode,
+                       FlagsContinuationT<Adapter>* cont) {
+  VisitBinop<Adapter, Matcher>(selector, node, opcode, false, kArchNop, cont);
 }
 
-static void VisitBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter, typename Matcher>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                        InstructionCode opcode) {
-  VisitBinop(selector, node, opcode, false, kArchNop);
+  VisitBinop<Adapter, Matcher>(selector, node, opcode, false, kArchNop);
 }
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
-  int alignment = rep.alignment();
-  int slot = frame_->AllocateSpillSlot(rep.size(), alignment);
-  OperandGenerator g(this);
-
-  Emit(kArchStackSlot, g.DefineAsRegister(node),
-       sequence()->AddImmediate(Constant(slot)),
-       sequence()->AddImmediate(Constant(alignment)), 0, nullptr);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+    int alignment = rep.alignment();
+    int slot = frame_->AllocateSpillSlot(rep.size(), alignment);
+    OperandGenerator g(this);
+
+    Emit(kArchStackSlot, g.DefineAsRegister(node),
+         sequence()->AddImmediate(Constant(slot)),
+         sequence()->AddImmediate(Constant(alignment)), 0, nullptr);
+  }
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), a0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), a0));
+  }
 }
 
-void EmitS128Load(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void EmitS128Load(InstructionSelectorT<Adapter>* selector, Node* node,
                   InstructionCode opcode, VSew sew, Vlmul lmul);
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
 
   switch (params.transformation) {
@@ -291,52 +353,84 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
 }
 
 // Shared routine for multiple compare operations.
-static void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                         InstructionOperand left, InstructionOperand right,
-                         FlagsContinuation* cont) {
+template <typename Adapter>
+static void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                         InstructionCode opcode, InstructionOperand left,
+                         InstructionOperand right,
+                         FlagsContinuationT<Adapter>* cont) {
+#ifdef V8_COMPRESS_POINTERS
+  if (opcode == kRiscvCmp32) {
+    RiscvOperandGeneratorT<Adapter> g(selector);
+    InstructionOperand inputs[] = {left, right};
+    if (right.IsImmediate()) {
+      InstructionOperand temps[1] = {g.TempRegister()};
+      selector->EmitWithContinuation(opcode, 0, nullptr, arraysize(inputs),
+                                     inputs, arraysize(temps), temps, cont);
+    } else {
+      InstructionOperand temps[2] = {g.TempRegister(), g.TempRegister()};
+      selector->EmitWithContinuation(opcode, 0, nullptr, arraysize(inputs),
+                                     inputs, arraysize(temps), temps, cont);
+    }
+    return;
+  }
+#endif
   selector->EmitWithContinuation(opcode, left, right, cont);
 }
 
 // Shared routine for multiple compare operations.
-static void VisitWordCompareZero(InstructionSelector* selector,
+template <typename Adapter>
+static void VisitWordCompareZero(InstructionSelectorT<Adapter>* selector,
                                  InstructionOperand value,
-                                 FlagsContinuation* cont) {
+                                 FlagsContinuationT<Adapter>* cont) {
   selector->EmitWithContinuation(kRiscvCmpZero, value, cont);
 }
 
 // Shared routine for multiple float32 compare operations.
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  RiscvOperandGenerator g(selector);
-  Float32BinopMatcher m(node);
-  InstructionOperand lhs, rhs;
-
-  lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
-                          : g.UseRegister(m.left().node());
-  rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
-                           : g.UseRegister(m.right().node());
-  VisitCompare(selector, kRiscvCmpS, lhs, rhs, cont);
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(selector);
+    Float32BinopMatcher m(node);
+    InstructionOperand lhs, rhs;
+
+    lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
+                            : g.UseRegister(m.left().node());
+    rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
+                             : g.UseRegister(m.right().node());
+    VisitCompare(selector, kRiscvCmpS, lhs, rhs, cont);
+  }
 }
 
 // Shared routine for multiple float64 compare operations.
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  RiscvOperandGenerator g(selector);
-  Float64BinopMatcher m(node);
-  InstructionOperand lhs, rhs;
-
-  lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
-                          : g.UseRegister(m.left().node());
-  rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
-                           : g.UseRegister(m.right().node());
-  VisitCompare(selector, kRiscvCmpD, lhs, rhs, cont);
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(selector);
+    Float64BinopMatcher m(node);
+    InstructionOperand lhs, rhs;
+
+    lhs = m.left().IsZero() ? g.UseImmediate(m.left().node())
+                            : g.UseRegister(m.left().node());
+    rhs = m.right().IsZero() ? g.UseImmediate(m.right().node())
+                             : g.UseRegister(m.right().node());
+    VisitCompare(selector, kRiscvCmpD, lhs, rhs, cont);
+  }
 }
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont,
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector, Node* node,
+                      InstructionCode opcode, FlagsContinuationT<Adapter>* cont,
                       bool commutative) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
   // If one of the two inputs is an immediate, make sure it's on the right.
@@ -346,9 +440,18 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
   }
   // Match immediates on right side of comparison.
   if (g.CanBeImmediate(right, opcode)) {
-    if (opcode == kRiscvTst) {
-      VisitCompare(selector, opcode, g.UseRegister(left), g.UseImmediate(right),
-                   cont);
+#if V8_TARGET_ARCH_RISCV64
+    if (opcode == kRiscvTst64 || opcode == kRiscvTst32) {
+#elif V8_TARGET_ARCH_RISCV32
+    if (opcode == kRiscvTst32) {
+#endif
+      if (left->opcode() == IrOpcode::kTruncateInt64ToInt32) {
+        VisitCompare(selector, opcode, g.UseRegister(left->InputAt(0)),
+                     g.UseImmediate(right), cont);
+      } else {
+        VisitCompare(selector, opcode, g.UseRegister(left),
+                     g.UseImmediate(right), cont);
+      }
     } else {
       switch (cont->condition()) {
         case kEqual:
@@ -398,47 +501,56 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
   }
 }
 
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  RiscvOperandGenerator g(this);
-  InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
-
-  // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
-    static const size_t kMaxTableSwitchValueRange = 2 << 16;
-    size_t table_space_cost = 10 + 2 * sw.value_range();
-    size_t table_time_cost = 3;
-    size_t lookup_space_cost = 2 + 2 * sw.case_count();
-    size_t lookup_time_cost = sw.case_count();
-    if (sw.case_count() > 0 &&
-        table_space_cost + 3 * table_time_cost <=
-            lookup_space_cost + 3 * lookup_time_cost &&
-        sw.min_value() > std::numeric_limits<int32_t>::min() &&
-        sw.value_range() <= kMaxTableSwitchValueRange) {
-      InstructionOperand index_operand = value_operand;
-      if (sw.min_value()) {
-        index_operand = g.TempRegister();
-        Emit(kRiscvSub32, index_operand, value_operand,
-             g.TempImmediate(sw.min_value()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
+
+    // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
+    if (enable_switch_jump_table_ ==
+        InstructionSelector::kEnableSwitchJumpTable) {
+      static const size_t kMaxTableSwitchValueRange = 2 << 16;
+      size_t table_space_cost = 10 + 2 * sw.value_range();
+      size_t table_time_cost = 3;
+      size_t lookup_space_cost = 2 + 2 * sw.case_count();
+      size_t lookup_time_cost = sw.case_count();
+      if (sw.case_count() > 0 &&
+          table_space_cost + 3 * table_time_cost <=
+              lookup_space_cost + 3 * lookup_time_cost &&
+          sw.min_value() > std::numeric_limits<int32_t>::min() &&
+          sw.value_range() <= kMaxTableSwitchValueRange) {
+        InstructionOperand index_operand = value_operand;
+        if (sw.min_value()) {
+          index_operand = g.TempRegister();
+          Emit(kRiscvSub32, index_operand, value_operand,
+               g.TempImmediate(sw.min_value()));
+        }
+        // Generate a table lookup.
+        return EmitTableSwitch(sw, index_operand);
       }
-      // Generate a table lookup.
-      return EmitTableSwitch(sw, index_operand);
     }
-  }
 
-  // Generate a tree of conditional jumps.
-  return EmitBinarySearchSwitch(sw, value_operand);
+    // Generate a tree of conditional jumps.
+    return EmitBinarySearchSwitch(sw, value_operand);
+  }
 }
 
-void EmitWordCompareZero(InstructionSelector* selector, Node* value,
-                         FlagsContinuation* cont) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void EmitWordCompareZero(InstructionSelectorT<Adapter>* selector, Node* value,
+                         FlagsContinuationT<Adapter>* cont) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   selector->EmitWithContinuation(kRiscvCmpZero,
                                  g.UseRegisterOrImmediateZero(value), cont);
 }
 
-void VisitAtomicExchange(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicExchange(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode, AtomicWidth width) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -460,9 +572,11 @@ void VisitAtomicExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, input_count, inputs, 3, temp);
 }
 
-void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
-                                ArchOpcode opcode, AtomicWidth width) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void VisitAtomicCompareExchange(InstructionSelectorT<Adapter>* selector,
+                                Node* node, ArchOpcode opcode,
+                                AtomicWidth width) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -486,268 +600,428 @@ void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, input_count, inputs, 3, temp);
 }
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
+  FlagsContinuationT<Adapter> cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
+  FlagsContinuationT<Adapter> cont =
+      FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
+  FlagsContinuationT<Adapter> cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
+  FlagsContinuationT<Adapter> cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
+  FlagsContinuationT<Adapter> cont =
+      FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
+  FlagsContinuationT<Adapter> cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64ExtractLowWord32(Node* node) {
-  VisitRR(this, kRiscvFloat64ExtractLowWord32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64ExtractLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvFloat64ExtractLowWord32, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64ExtractHighWord32(Node* node) {
-  VisitRR(this, kRiscvFloat64ExtractHighWord32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64ExtractHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvFloat64ExtractHighWord32, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64SilenceNaN(Node* node) {
-  VisitRR(this, kRiscvFloat64SilenceNaN, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64SilenceNaN(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvFloat64SilenceNaN, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Emit(kRiscvFloat64InsertLowWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.UseRegister(right));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertLowWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    Emit(kRiscvFloat64InsertLowWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.UseRegister(right));
+  }
 }
 
-void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Emit(kRiscvFloat64InsertHighWord32, g.DefineSameAsFirst(node),
-       g.UseRegister(left), g.UseRegister(right));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertHighWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    Emit(kRiscvFloat64InsertHighWord32, g.DefineSameAsFirst(node),
+         g.UseRegister(left), g.UseRegister(right));
+  }
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvSync, g.NoOutput());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvSync, g.NoOutput());
+  }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return false; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return false;
+}
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  RiscvOperandGenerator g(this);
+    node_t node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
 
-  int reverse_slot = 1;
   for (PushParameter output : *results) {
     if (!output.location.IsCallerFrameSlot()) continue;
     // Skip any alignment holes in nodes.
-    if (output.node != nullptr) {
+    if (this->valid(output.node)) {
       DCHECK(!call_descriptor->IsCFunctionCall());
       if (output.location.GetType() == MachineType::Float32()) {
         MarkAsFloat32(output.node);
       } else if (output.location.GetType() == MachineType::Float64()) {
         MarkAsFloat64(output.node);
+      } else if (output.location.GetType() == MachineType::Simd128()) {
+        MarkAsSimd128(output.node);
       }
+      int offset = call_descriptor->GetOffsetToReturns();
+      int reverse_slot = -output.location.GetLocation() - offset;
       Emit(kRiscvPeek, g.DefineAsRegister(output.node),
            g.UseImmediate(reverse_slot));
     }
-    reverse_slot += output.location.GetSizeInPointers();
   }
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int index) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node, int index) {
+}
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {}
 
-void InstructionSelector::VisitFloat32Abs(Node* node) {
-  VisitRR(this, kRiscvAbsS, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Abs(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvAbsS, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Abs(Node* node) {
-  VisitRR(this, kRiscvAbsD, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Abs(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvAbsD, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Sqrt(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sqrt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvSqrtS, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Sqrt(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sqrt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvSqrtD, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32RoundDown(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundDown(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat32RoundDown, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Add(Node* node) {
-  VisitRRR(this, kRiscvAddS, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvAddS, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Add(Node* node) {
-  VisitRRR(this, kRiscvAddD, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvAddD, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Sub(Node* node) {
-  VisitRRR(this, kRiscvSubS, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvSubS, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Sub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sub(node_t node) {
   VisitRRR(this, kRiscvSubD, node);
 }
 
-void InstructionSelector::VisitFloat32Mul(Node* node) {
-  VisitRRR(this, kRiscvMulS, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvMulS, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Mul(Node* node) {
-  VisitRRR(this, kRiscvMulD, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvMulD, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Div(Node* node) {
-  VisitRRR(this, kRiscvDivS, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvDivS, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Div(node_t node) {
   VisitRRR(this, kRiscvDivD, node);
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvModD, g.DefineAsFixed(node, fa0),
-       g.UseFixed(node->InputAt(0), fa0), g.UseFixed(node->InputAt(1), fa1))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvModD, g.DefineAsFixed(node, fa0),
+         g.UseFixed(node->InputAt(0), fa0), g.UseFixed(node->InputAt(1), fa1))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat32Max(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvFloat32Max, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Max(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvFloat32Max, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  }
 }
 
-void InstructionSelector::VisitFloat64Max(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvFloat64Max, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Max(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvFloat64Max, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  }
 }
 
-void InstructionSelector::VisitFloat32Min(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvFloat32Min, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Min(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvFloat32Min, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  }
 }
 
-void InstructionSelector::VisitFloat64Min(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvFloat64Min, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Min(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvFloat64Min, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat64ToWord32(Node* node) {
-  VisitRR(this, kArchTruncateDoubleToI, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToWord32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kArchTruncateDoubleToI, node);
+  }
 }
 
-void InstructionSelector::VisitRoundFloat64ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundFloat64ToInt32(node_t node) {
   VisitRR(this, kRiscvTruncWD, node);
 }
 
-void InstructionSelector::VisitTruncateFloat64ToFloat32(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  // Match TruncateFloat64ToFloat32(ChangeInt32ToFloat64) to corresponding
-  // instruction.
-  if (CanCover(node, value) &&
-      value->opcode() == IrOpcode::kChangeInt32ToFloat64) {
-    Emit(kRiscvCvtSW, g.DefineAsRegister(node),
-         g.UseRegister(value->InputAt(0)));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    // Match TruncateFloat64ToFloat32(ChangeInt32ToFloat64) to corresponding
+    // instruction.
+    if (CanCover(node, value) &&
+        value->opcode() == IrOpcode::kChangeInt32ToFloat64) {
+      Emit(kRiscvCvtSW, g.DefineAsRegister(node),
+           g.UseRegister(value->InputAt(0)));
+      return;
+    }
+    VisitRR(this, kRiscvCvtSD, node);
   }
-  VisitRR(this, kRiscvCvtSD, node);
 }
 
-void InstructionSelector::VisitWord32Shl(Node* node) {
-  Int32BinopMatcher m(node);
-  if (m.left().IsWord32And() && CanCover(node, m.left().node()) &&
-      m.right().IsInRange(1, 31)) {
-    RiscvOperandGenerator g(this);
-    Int32BinopMatcher mleft(m.left().node());
-    // Match Word32Shl(Word32And(x, mask), imm) to Shl where the mask is
-    // contiguous, and the shift immediate non-zero.
-    if (mleft.right().HasResolvedValue()) {
-      uint32_t mask = mleft.right().ResolvedValue();
-      uint32_t mask_width = base::bits::CountPopulation(mask);
-      uint32_t mask_msb = base::bits::CountLeadingZeros32(mask);
-      if ((mask_width != 0) && (mask_msb + mask_width == 32)) {
-        uint32_t shift = m.right().ResolvedValue();
-        DCHECK_EQ(0u, base::bits::CountTrailingZeros32(mask));
-        DCHECK_NE(0u, shift);
-        if ((shift + mask_width) >= 32) {
-          // If the mask is contiguous and reaches or extends beyond the top
-          // bit, only the shift is needed.
-          Emit(kRiscvShl32, g.DefineAsRegister(node),
-               g.UseRegister(mleft.left().node()),
-               g.UseImmediate(m.right().node()));
-          return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    if (m.left().IsWord32And() && CanCover(node, m.left().node()) &&
+        m.right().IsInRange(1, 31)) {
+      RiscvOperandGeneratorT<Adapter> g(this);
+      Int32BinopMatcher mleft(m.left().node());
+      // Match Word32Shl(Word32And(x, mask), imm) to Shl where the mask is
+      // contiguous, and the shift immediate non-zero.
+      if (mleft.right().HasResolvedValue()) {
+        uint32_t mask = mleft.right().ResolvedValue();
+        uint32_t mask_width = base::bits::CountPopulation(mask);
+        uint32_t mask_msb = base::bits::CountLeadingZeros32(mask);
+        if ((mask_width != 0) && (mask_msb + mask_width == 32)) {
+          uint32_t shift = m.right().ResolvedValue();
+          DCHECK_EQ(0u, base::bits::CountTrailingZeros32(mask));
+          DCHECK_NE(0u, shift);
+          if ((shift + mask_width) >= 32) {
+            // If the mask is contiguous and reaches or extends beyond the top
+            // bit, only the shift is needed.
+            Emit(kRiscvShl32, g.DefineAsRegister(node),
+                 g.UseRegister(mleft.left().node()),
+                 g.UseImmediate(m.right().node()));
+            return;
+          }
         }
       }
     }
+    VisitRRO(this, kRiscvShl32, node);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRO(this, kRiscvShr32, node);
   }
-  VisitRRO(this, kRiscvShl32, node);
 }
 
-void InstructionSelector::VisitWord32Shr(Node* node) {
-  VisitRRO(this, kRiscvShr32, node);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Sar(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitWord32Sar(Node* node) {
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Sar(Node* node) {
   Int32BinopMatcher m(node);
-  if (m.left().IsWord32Shl() && CanCover(node, m.left().node())) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (m.right().HasResolvedValue() && mleft.right().HasResolvedValue()) {
-      RiscvOperandGenerator g(this);
-      uint32_t sar = m.right().ResolvedValue();
-      uint32_t shl = mleft.right().ResolvedValue();
-      if ((sar == shl) && (sar == 16)) {
-        Emit(kRiscvSignExtendShort, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()));
-        return;
-      } else if ((sar == shl) && (sar == 24)) {
-        Emit(kRiscvSignExtendByte, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()));
-        return;
-      } else if ((sar == shl) && (sar == 32)) {
-        Emit(kRiscvShl32, g.DefineAsRegister(node),
-             g.UseRegister(mleft.left().node()), g.TempImmediate(0));
-        return;
+  if (CanCover(node, m.left().node())) {
+    RiscvOperandGeneratorT<TurbofanAdapter> g(this);
+    if (m.left().IsWord32Shl()) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (m.right().HasResolvedValue() && mleft.right().HasResolvedValue()) {
+        uint32_t sar = m.right().ResolvedValue();
+        uint32_t shl = mleft.right().ResolvedValue();
+        if ((sar == shl) && (sar == 16)) {
+          Emit(kRiscvSignExtendShort, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()));
+          return;
+        } else if ((sar == shl) && (sar == 24)) {
+          Emit(kRiscvSignExtendByte, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()));
+          return;
+        } else if ((sar == shl) && (sar == 32)) {
+          Emit(kRiscvShl32, g.DefineAsRegister(node),
+               g.UseRegister(mleft.left().node()), g.TempImmediate(0));
+          return;
+        }
       }
     }
   }
   VisitRRO(this, kRiscvSar32, node);
 }
 
-void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand src1 = g.TempSimd128Register();
   InstructionOperand src2 = g.TempSimd128Register();
   InstructionOperand src = g.UseUniqueRegister(node->InputAt(0));
@@ -755,12 +1029,13 @@ void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
        g.UseImmediate(int8_t(E16)), g.UseImmediate(int8_t(m1)));
   Emit(kRiscvVrgather, src2, src, g.UseImmediate64(0x0007000500030001),
        g.UseImmediate(int8_t(E16)), g.UseImmediate(int8_t(m1)));
-  Emit(kRiscvVwadd, g.DefineAsRegister(node), src1, src2,
+  Emit(kRiscvVwaddVv, g.DefineAsRegister(node), src1, src2,
        g.UseImmediate(int8_t(E16)), g.UseImmediate(int8_t(mf2)));
 }
 
-void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand src1 = g.TempSimd128Register();
   InstructionOperand src2 = g.TempSimd128Register();
   InstructionOperand src = g.UseUniqueRegister(node->InputAt(0));
@@ -768,12 +1043,13 @@ void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
        g.UseImmediate(int8_t(E16)), g.UseImmediate(int8_t(m1)));
   Emit(kRiscvVrgather, src2, src, g.UseImmediate64(0x0007000500030001),
        g.UseImmediate(int8_t(E16)), g.UseImmediate(int8_t(m1)));
-  Emit(kRiscvVwaddu, g.DefineAsRegister(node), src1, src2,
+  Emit(kRiscvVwadduVv, g.DefineAsRegister(node), src1, src2,
        g.UseImmediate(int8_t(E16)), g.UseImmediate(int8_t(mf2)));
 }
 
-void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand src1 = g.TempSimd128Register();
   InstructionOperand src2 = g.TempSimd128Register();
   InstructionOperand src = g.UseUniqueRegister(node->InputAt(0));
@@ -781,12 +1057,13 @@ void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
        g.UseImmediate(int8_t(E8)), g.UseImmediate(int8_t(m1)));
   Emit(kRiscvVrgather, src2, src, g.UseImmediate64(0x0F0D0B0907050301),
        g.UseImmediate(int8_t(E8)), g.UseImmediate(int8_t(m1)));
-  Emit(kRiscvVwadd, g.DefineAsRegister(node), src1, src2,
+  Emit(kRiscvVwaddVv, g.DefineAsRegister(node), src1, src2,
        g.UseImmediate(int8_t(E8)), g.UseImmediate(int8_t(mf2)));
 }
 
-void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand src1 = g.TempSimd128Register();
   InstructionOperand src2 = g.TempSimd128Register();
   InstructionOperand src = g.UseUniqueRegister(node->InputAt(0));
@@ -794,10 +1071,16 @@ void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
        g.UseImmediate(int8_t(E8)), g.UseImmediate(int8_t(m1)));
   Emit(kRiscvVrgather, src2, src, g.UseImmediate64(0x0F0D0B0907050301),
        g.UseImmediate(int8_t(E8)), g.UseImmediate(int8_t(m1)));
-  Emit(kRiscvVwaddu, g.DefineAsRegister(node), src1, src2,
+  Emit(kRiscvVwadduVv, g.DefineAsRegister(node), src1, src2,
        g.UseImmediate(int8_t(E8)), g.UseImmediate(int8_t(mf2)));
 }
 
+#define SIMD_INT_TYPE_LIST(V) \
+  V(I64x2, E64, m1)           \
+  V(I32x4, E32, m1)           \
+  V(I16x8, E16, m1)           \
+  V(I8x16, E8, m1)
+
 #define SIMD_TYPE_LIST(V) \
   V(F32x4)                \
   V(I64x2)                \
@@ -805,9 +1088,30 @@ void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
   V(I16x8)                \
   V(I8x16)
 
+#define SIMD_UNOP_LIST2(V)                 \
+  V(F32x4Splat, kRiscvVfmvVf, E32, m1)     \
+  V(I8x16Neg, kRiscvVnegVv, E8, m1)        \
+  V(I16x8Neg, kRiscvVnegVv, E16, m1)       \
+  V(I32x4Neg, kRiscvVnegVv, E32, m1)       \
+  V(I64x2Neg, kRiscvVnegVv, E64, m1)       \
+  V(I8x16Splat, kRiscvVmv, E8, m1)         \
+  V(I16x8Splat, kRiscvVmv, E16, m1)        \
+  V(I32x4Splat, kRiscvVmv, E32, m1)        \
+  V(I64x2Splat, kRiscvVmv, E64, m1)        \
+  V(F32x4Neg, kRiscvVfnegVv, E32, m1)      \
+  V(F64x2Neg, kRiscvVfnegVv, E64, m1)      \
+  V(F64x2Splat, kRiscvVfmvVf, E64, m1)     \
+  V(I32x4AllTrue, kRiscvVAllTrue, E32, m1) \
+  V(I16x8AllTrue, kRiscvVAllTrue, E16, m1) \
+  V(I8x16AllTrue, kRiscvVAllTrue, E8, m1)  \
+  V(I64x2AllTrue, kRiscvVAllTrue, E64, m1) \
+  V(I64x2Abs, kRiscvVAbs, E64, m1)         \
+  V(I32x4Abs, kRiscvVAbs, E32, m1)         \
+  V(I16x8Abs, kRiscvVAbs, E16, m1)         \
+  V(I8x16Abs, kRiscvVAbs, E8, m1)
+
 #define SIMD_UNOP_LIST(V)                                       \
   V(F64x2Abs, kRiscvF64x2Abs)                                   \
-  V(F64x2Neg, kRiscvF64x2Neg)                                   \
   V(F64x2Sqrt, kRiscvF64x2Sqrt)                                 \
   V(F64x2ConvertLowI32x4S, kRiscvF64x2ConvertLowI32x4S)         \
   V(F64x2ConvertLowI32x4U, kRiscvF64x2ConvertLowI32x4U)         \
@@ -816,13 +1120,9 @@ void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
   V(F64x2Floor, kRiscvF64x2Floor)                               \
   V(F64x2Trunc, kRiscvF64x2Trunc)                               \
   V(F64x2NearestInt, kRiscvF64x2NearestInt)                     \
-  V(I64x2Neg, kRiscvI64x2Neg)                                   \
-  V(I64x2Abs, kRiscvI64x2Abs)                                   \
-  V(I64x2BitMask, kRiscvI64x2BitMask)                           \
   V(F32x4SConvertI32x4, kRiscvF32x4SConvertI32x4)               \
   V(F32x4UConvertI32x4, kRiscvF32x4UConvertI32x4)               \
   V(F32x4Abs, kRiscvF32x4Abs)                                   \
-  V(F32x4Neg, kRiscvF32x4Neg)                                   \
   V(F32x4Sqrt, kRiscvF32x4Sqrt)                                 \
   V(F32x4DemoteF64x2Zero, kRiscvF32x4DemoteF64x2Zero)           \
   V(F32x4Ceil, kRiscvF32x4Ceil)                                 \
@@ -839,32 +1139,11 @@ void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
   V(I64x2UConvertI32x4High, kRiscvI64x2UConvertI32x4High)       \
   V(I32x4SConvertF32x4, kRiscvI32x4SConvertF32x4)               \
   V(I32x4UConvertF32x4, kRiscvI32x4UConvertF32x4)               \
-  V(I32x4Neg, kRiscvI32x4Neg)                                   \
-  V(I32x4SConvertI16x8Low, kRiscvI32x4SConvertI16x8Low)         \
-  V(I32x4SConvertI16x8High, kRiscvI32x4SConvertI16x8High)       \
-  V(I32x4UConvertI16x8Low, kRiscvI32x4UConvertI16x8Low)         \
-  V(I32x4UConvertI16x8High, kRiscvI32x4UConvertI16x8High)       \
-  V(I32x4Abs, kRiscvI32x4Abs)                                   \
-  V(I32x4BitMask, kRiscvI32x4BitMask)                           \
   V(I32x4TruncSatF64x2SZero, kRiscvI32x4TruncSatF64x2SZero)     \
   V(I32x4TruncSatF64x2UZero, kRiscvI32x4TruncSatF64x2UZero)     \
-  V(I16x8Neg, kRiscvI16x8Neg)                                   \
-  V(I16x8SConvertI8x16Low, kRiscvI16x8SConvertI8x16Low)         \
-  V(I16x8SConvertI8x16High, kRiscvI16x8SConvertI8x16High)       \
-  V(I16x8UConvertI8x16Low, kRiscvI16x8UConvertI8x16Low)         \
-  V(I16x8UConvertI8x16High, kRiscvI16x8UConvertI8x16High)       \
-  V(I16x8Abs, kRiscvI16x8Abs)                                   \
-  V(I16x8BitMask, kRiscvI16x8BitMask)                           \
-  V(I8x16Neg, kRiscvI8x16Neg)                                   \
-  V(I8x16Abs, kRiscvI8x16Abs)                                   \
-  V(I8x16BitMask, kRiscvI8x16BitMask)                           \
   V(I8x16Popcnt, kRiscvI8x16Popcnt)                             \
-  V(S128Not, kRiscvS128Not)                                     \
-  V(V128AnyTrue, kRiscvV128AnyTrue)                             \
-  V(I32x4AllTrue, kRiscvI32x4AllTrue)                           \
-  V(I16x8AllTrue, kRiscvI16x8AllTrue)                           \
-  V(I8x16AllTrue, kRiscvI8x16AllTrue)                           \
-  V(I64x2AllTrue, kRiscvI64x2AllTrue)
+  V(S128Not, kRiscvVnot)                                        \
+  V(V128AnyTrue, kRiscvV128AnyTrue)
 
 #define SIMD_SHIFT_OP_LIST(V) \
   V(I64x2Shl)                 \
@@ -880,99 +1159,88 @@ void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
   V(I8x16ShrS)                \
   V(I8x16ShrU)
 
-#define SIMD_BINOP_LIST(V)                              \
-  V(F64x2Add, kRiscvF64x2Add)                           \
-  V(F64x2Sub, kRiscvF64x2Sub)                           \
-  V(F64x2Mul, kRiscvF64x2Mul)                           \
-  V(F64x2Div, kRiscvF64x2Div)                           \
-  V(F64x2Min, kRiscvF64x2Min)                           \
-  V(F64x2Max, kRiscvF64x2Max)                           \
-  V(F64x2Eq, kRiscvF64x2Eq)                             \
-  V(F64x2Ne, kRiscvF64x2Ne)                             \
-  V(F64x2Lt, kRiscvF64x2Lt)                             \
-  V(F64x2Le, kRiscvF64x2Le)                             \
-  V(I64x2Eq, kRiscvI64x2Eq)                             \
-  V(I64x2Ne, kRiscvI64x2Ne)                             \
-  V(I64x2GtS, kRiscvI64x2GtS)                           \
-  V(I64x2GeS, kRiscvI64x2GeS)                           \
-  V(I64x2Add, kRiscvI64x2Add)                           \
-  V(I64x2Sub, kRiscvI64x2Sub)                           \
-  V(I64x2Mul, kRiscvI64x2Mul)                           \
-  V(F32x4Add, kRiscvF32x4Add)                           \
-  V(F32x4Sub, kRiscvF32x4Sub)                           \
-  V(F32x4Mul, kRiscvF32x4Mul)                           \
-  V(F32x4Div, kRiscvF32x4Div)                           \
-  V(F32x4Max, kRiscvF32x4Max)                           \
-  V(F32x4Min, kRiscvF32x4Min)                           \
-  V(F32x4Eq, kRiscvF32x4Eq)                             \
-  V(F32x4Ne, kRiscvF32x4Ne)                             \
-  V(F32x4Lt, kRiscvF32x4Lt)                             \
-  V(F32x4Le, kRiscvF32x4Le)                             \
-  V(F32x4RelaxedMin, kRiscvF32x4Min)                    \
-  V(F32x4RelaxedMax, kRiscvF32x4Max)                    \
-  V(F64x2RelaxedMin, kRiscvF64x2Min)                    \
-  V(F64x2RelaxedMax, kRiscvF64x2Max)                    \
-  V(I32x4Add, kRiscvI32x4Add)                           \
-  V(I32x4Sub, kRiscvI32x4Sub)                           \
-  V(I32x4Mul, kRiscvI32x4Mul)                           \
-  V(I32x4MaxS, kRiscvI32x4MaxS)                         \
-  V(I32x4MinS, kRiscvI32x4MinS)                         \
-  V(I32x4MaxU, kRiscvI32x4MaxU)                         \
-  V(I32x4MinU, kRiscvI32x4MinU)                         \
-  V(I32x4Eq, kRiscvI32x4Eq)                             \
-  V(I32x4Ne, kRiscvI32x4Ne)                             \
-  V(I32x4GtS, kRiscvI32x4GtS)                           \
-  V(I32x4GeS, kRiscvI32x4GeS)                           \
-  V(I32x4GtU, kRiscvI32x4GtU)                           \
-  V(I32x4GeU, kRiscvI32x4GeU)                           \
-  V(I16x8Add, kRiscvI16x8Add)                           \
-  V(I16x8AddSatS, kRiscvI16x8AddSatS)                   \
-  V(I16x8AddSatU, kRiscvI16x8AddSatU)                   \
-  V(I16x8Sub, kRiscvI16x8Sub)                           \
-  V(I16x8SubSatS, kRiscvI16x8SubSatS)                   \
-  V(I16x8SubSatU, kRiscvI16x8SubSatU)                   \
-  V(I16x8Mul, kRiscvI16x8Mul)                           \
-  V(I16x8MaxS, kRiscvI16x8MaxS)                         \
-  V(I16x8MinS, kRiscvI16x8MinS)                         \
-  V(I16x8MaxU, kRiscvI16x8MaxU)                         \
-  V(I16x8MinU, kRiscvI16x8MinU)                         \
-  V(I16x8Eq, kRiscvI16x8Eq)                             \
-  V(I16x8Ne, kRiscvI16x8Ne)                             \
-  V(I16x8GtS, kRiscvI16x8GtS)                           \
-  V(I16x8GeS, kRiscvI16x8GeS)                           \
-  V(I16x8GtU, kRiscvI16x8GtU)                           \
-  V(I16x8GeU, kRiscvI16x8GeU)                           \
-  V(I16x8RoundingAverageU, kRiscvI16x8RoundingAverageU) \
-  V(I16x8Q15MulRSatS, kRiscvI16x8Q15MulRSatS)           \
-  V(I16x8RelaxedQ15MulRS, kRiscvI16x8Q15MulRSatS)       \
-  V(I16x8SConvertI32x4, kRiscvI16x8SConvertI32x4)       \
-  V(I16x8UConvertI32x4, kRiscvI16x8UConvertI32x4)       \
-  V(I8x16Add, kRiscvI8x16Add)                           \
-  V(I8x16AddSatS, kRiscvI8x16AddSatS)                   \
-  V(I8x16AddSatU, kRiscvI8x16AddSatU)                   \
-  V(I8x16Sub, kRiscvI8x16Sub)                           \
-  V(I8x16SubSatS, kRiscvI8x16SubSatS)                   \
-  V(I8x16SubSatU, kRiscvI8x16SubSatU)                   \
-  V(I8x16MaxS, kRiscvI8x16MaxS)                         \
-  V(I8x16MinS, kRiscvI8x16MinS)                         \
-  V(I8x16MaxU, kRiscvI8x16MaxU)                         \
-  V(I8x16MinU, kRiscvI8x16MinU)                         \
-  V(I8x16Eq, kRiscvI8x16Eq)                             \
-  V(I8x16Ne, kRiscvI8x16Ne)                             \
-  V(I8x16GtS, kRiscvI8x16GtS)                           \
-  V(I8x16GeS, kRiscvI8x16GeS)                           \
-  V(I8x16GtU, kRiscvI8x16GtU)                           \
-  V(I8x16GeU, kRiscvI8x16GeU)                           \
-  V(I8x16RoundingAverageU, kRiscvI8x16RoundingAverageU) \
-  V(I8x16SConvertI16x8, kRiscvI8x16SConvertI16x8)       \
-  V(I8x16UConvertI16x8, kRiscvI8x16UConvertI16x8)       \
-  V(S128And, kRiscvS128And)                             \
-  V(S128Or, kRiscvS128Or)                               \
-  V(S128Xor, kRiscvS128Xor)                             \
-  V(S128AndNot, kRiscvS128AndNot)
-
-void InstructionSelector::VisitS128Const(Node* node) {
-  RiscvOperandGenerator g(this);
+#define SIMD_BINOP_LIST(V)                    \
+  V(I64x2Add, kRiscvVaddVv, E64, m1)          \
+  V(I32x4Add, kRiscvVaddVv, E32, m1)          \
+  V(I16x8Add, kRiscvVaddVv, E16, m1)          \
+  V(I8x16Add, kRiscvVaddVv, E8, m1)           \
+  V(I64x2Sub, kRiscvVsubVv, E64, m1)          \
+  V(I32x4Sub, kRiscvVsubVv, E32, m1)          \
+  V(I16x8Sub, kRiscvVsubVv, E16, m1)          \
+  V(I8x16Sub, kRiscvVsubVv, E8, m1)           \
+  V(I32x4MaxU, kRiscvVmaxuVv, E32, m1)        \
+  V(I16x8MaxU, kRiscvVmaxuVv, E16, m1)        \
+  V(I8x16MaxU, kRiscvVmaxuVv, E8, m1)         \
+  V(I32x4MaxS, kRiscvVmax, E32, m1)           \
+  V(I16x8MaxS, kRiscvVmax, E16, m1)           \
+  V(I8x16MaxS, kRiscvVmax, E8, m1)            \
+  V(I32x4MinS, kRiscvVminsVv, E32, m1)        \
+  V(I16x8MinS, kRiscvVminsVv, E16, m1)        \
+  V(I8x16MinS, kRiscvVminsVv, E8, m1)         \
+  V(I32x4MinU, kRiscvVminuVv, E32, m1)        \
+  V(I16x8MinU, kRiscvVminuVv, E16, m1)        \
+  V(I8x16MinU, kRiscvVminuVv, E8, m1)         \
+  V(I64x2Mul, kRiscvVmulVv, E64, m1)          \
+  V(I32x4Mul, kRiscvVmulVv, E32, m1)          \
+  V(I16x8Mul, kRiscvVmulVv, E16, m1)          \
+  V(I64x2GtS, kRiscvVgtsVv, E64, m1)          \
+  V(I32x4GtS, kRiscvVgtsVv, E32, m1)          \
+  V(I16x8GtS, kRiscvVgtsVv, E16, m1)          \
+  V(I8x16GtS, kRiscvVgtsVv, E8, m1)           \
+  V(I64x2GeS, kRiscvVgesVv, E64, m1)          \
+  V(I32x4GeS, kRiscvVgesVv, E32, m1)          \
+  V(I16x8GeS, kRiscvVgesVv, E16, m1)          \
+  V(I8x16GeS, kRiscvVgesVv, E8, m1)           \
+  V(I32x4GeU, kRiscvVgeuVv, E32, m1)          \
+  V(I16x8GeU, kRiscvVgeuVv, E16, m1)          \
+  V(I8x16GeU, kRiscvVgeuVv, E8, m1)           \
+  V(I32x4GtU, kRiscvVgtuVv, E32, m1)          \
+  V(I16x8GtU, kRiscvVgtuVv, E16, m1)          \
+  V(I8x16GtU, kRiscvVgtuVv, E8, m1)           \
+  V(I64x2Eq, kRiscvVeqVv, E64, m1)            \
+  V(I32x4Eq, kRiscvVeqVv, E32, m1)            \
+  V(I16x8Eq, kRiscvVeqVv, E16, m1)            \
+  V(I8x16Eq, kRiscvVeqVv, E8, m1)             \
+  V(I64x2Ne, kRiscvVneVv, E64, m1)            \
+  V(I32x4Ne, kRiscvVneVv, E32, m1)            \
+  V(I16x8Ne, kRiscvVneVv, E16, m1)            \
+  V(I8x16Ne, kRiscvVneVv, E8, m1)             \
+  V(I16x8AddSatS, kRiscvVaddSatSVv, E16, m1)  \
+  V(I8x16AddSatS, kRiscvVaddSatSVv, E8, m1)   \
+  V(I16x8AddSatU, kRiscvVaddSatUVv, E16, m1)  \
+  V(I8x16AddSatU, kRiscvVaddSatUVv, E8, m1)   \
+  V(I16x8SubSatS, kRiscvVsubSatSVv, E16, m1)  \
+  V(I8x16SubSatS, kRiscvVsubSatSVv, E8, m1)   \
+  V(I16x8SubSatU, kRiscvVsubSatUVv, E16, m1)  \
+  V(I8x16SubSatU, kRiscvVsubSatUVv, E8, m1)   \
+  V(F64x2Add, kRiscvVfaddVv, E64, m1)         \
+  V(F32x4Add, kRiscvVfaddVv, E32, m1)         \
+  V(F64x2Sub, kRiscvVfsubVv, E64, m1)         \
+  V(F32x4Sub, kRiscvVfsubVv, E32, m1)         \
+  V(F64x2Mul, kRiscvVfmulVv, E64, m1)         \
+  V(F32x4Mul, kRiscvVfmulVv, E32, m1)         \
+  V(F64x2Div, kRiscvVfdivVv, E64, m1)         \
+  V(F32x4Div, kRiscvVfdivVv, E32, m1)         \
+  V(S128And, kRiscvVandVv, E8, m1)            \
+  V(S128Or, kRiscvVorVv, E8, m1)              \
+  V(S128Xor, kRiscvVxorVv, E8, m1)            \
+  V(I16x8Q15MulRSatS, kRiscvVsmulVv, E16, m1) \
+  V(I16x8RelaxedQ15MulRS, kRiscvVsmulVv, E16, m1)
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128AndNot(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVnotVv, temp1, g.UseRegister(node->InputAt(1)),
+             g.UseImmediate(E8), g.UseImmediate(m1));
+  this->Emit(kRiscvVandVv, g.DefineAsRegister(node),
+             g.UseRegister(node->InputAt(0)), temp1, g.UseImmediate(E8),
+             g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   static const int kUint32Immediates = kSimd128Size / sizeof(uint32_t);
   uint32_t val[kUint32Immediates];
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
@@ -991,22 +1259,17 @@ void InstructionSelector::VisitS128Const(Node* node) {
   }
 }
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Emit(kRiscvS128Zero, g.DefineAsRegister(node));
 }
 
-#define SIMD_VISIT_SPLAT(Type)                               \
-  void InstructionSelector::Visit##Type##Splat(Node* node) { \
-    VisitRR(this, kRiscv##Type##Splat, node);                \
-  }
-SIMD_TYPE_LIST(SIMD_VISIT_SPLAT)
-SIMD_VISIT_SPLAT(F64x2)
-#undef SIMD_VISIT_SPLAT
-
-#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                              \
-  void InstructionSelector::Visit##Type##ExtractLane##Sign(Node* node) { \
-    VisitRRI(this, kRiscv##Type##ExtractLane##Sign, node);               \
+#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                           \
+  template <typename Adapter>                                         \
+  void InstructionSelectorT<Adapter>::Visit##Type##ExtractLane##Sign( \
+      Node* node) {                                                   \
+    VisitRRI(this, kRiscv##Type##ExtractLane##Sign, node);            \
   }
 SIMD_VISIT_EXTRACT_LANE(F64x2, )
 SIMD_VISIT_EXTRACT_LANE(F32x4, )
@@ -1018,42 +1281,64 @@ SIMD_VISIT_EXTRACT_LANE(I8x16, U)
 SIMD_VISIT_EXTRACT_LANE(I8x16, S)
 #undef SIMD_VISIT_EXTRACT_LANE
 
-#define SIMD_VISIT_REPLACE_LANE(Type)                              \
-  void InstructionSelector::Visit##Type##ReplaceLane(Node* node) { \
-    VisitRRIR(this, kRiscv##Type##ReplaceLane, node);              \
+#define SIMD_VISIT_REPLACE_LANE(Type)                                        \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##ReplaceLane(Node* node) { \
+    VisitRRIR(this, kRiscv##Type##ReplaceLane, node);                        \
   }
 SIMD_TYPE_LIST(SIMD_VISIT_REPLACE_LANE)
 SIMD_VISIT_REPLACE_LANE(F64x2)
 #undef SIMD_VISIT_REPLACE_LANE
 
-#define SIMD_VISIT_UNOP(Name, instruction)            \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, instruction, node);                 \
+#define SIMD_VISIT_UNOP(Name, instruction)                      \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRR(this, instruction, node);                           \
   }
 SIMD_UNOP_LIST(SIMD_VISIT_UNOP)
 #undef SIMD_VISIT_UNOP
 
-#define SIMD_VISIT_SHIFT_OP(Name)                     \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitSimdShift(this, kRiscv##Name, node);         \
+#define SIMD_VISIT_SHIFT_OP(Name)                               \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitSimdShift(this, kRiscv##Name, node);                   \
   }
 SIMD_SHIFT_OP_LIST(SIMD_VISIT_SHIFT_OP)
 #undef SIMD_VISIT_SHIFT_OP
 
-#define SIMD_VISIT_BINOP(Name, instruction)           \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRR(this, instruction, node);                \
+
+#define SIMD_VISIT_BINOP_RVV(Name, instruction, VSEW, LMUL)           \
+  template <typename Adapter>                                         \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {       \
+    RiscvOperandGeneratorT<Adapter> g(this);                          \
+    this->Emit(instruction, g.DefineAsRegister(node),                 \
+               g.UseRegister(node->InputAt(0)),                       \
+               g.UseRegister(node->InputAt(1)), g.UseImmediate(VSEW), \
+               g.UseImmediate(LMUL));                                 \
   }
-SIMD_BINOP_LIST(SIMD_VISIT_BINOP)
-#undef SIMD_VISIT_BINOP
+SIMD_BINOP_LIST(SIMD_VISIT_BINOP_RVV)
+#undef SIMD_VISIT_BINOP_RVV
+
+#define SIMD_VISIT_UNOP2(Name, instruction, VSEW, LMUL)               \
+  template <typename Adapter>                                         \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {       \
+    RiscvOperandGeneratorT<Adapter> g(this);                          \
+    this->Emit(instruction, g.DefineAsRegister(node),                 \
+               g.UseRegister(node->InputAt(0)), g.UseImmediate(VSEW), \
+               g.UseImmediate(LMUL));                                 \
+  }
+SIMD_UNOP_LIST2(SIMD_VISIT_UNOP2)
+#undef SIMD_VISIT_UNOP2
 
-void InstructionSelector::VisitS128Select(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
   VisitRRRR(this, kRiscvS128Select, node);
 }
 
-#define SIMD_VISIT_SELECT_LANE(Name)                  \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRRR(this, kRiscvS128Select, node);          \
+#define SIMD_VISIT_SELECT_LANE(Name)                            \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRRRR(this, kRiscvS128Select, node);                    \
   }
 SIMD_VISIT_SELECT_LANE(I8x16RelaxedLaneSelect)
 SIMD_VISIT_SELECT_LANE(I16x8RelaxedLaneSelect)
@@ -1061,9 +1346,10 @@ SIMD_VISIT_SELECT_LANE(I32x4RelaxedLaneSelect)
 SIMD_VISIT_SELECT_LANE(I64x2RelaxedLaneSelect)
 #undef SIMD_VISIT_SELECT_LANE
 
-#define VISIT_SIMD_QFMOP(Name, instruction)           \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRRRR(this, instruction, node);               \
+#define VISIT_SIMD_QFMOP(Name, instruction)                     \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRRRR(this, instruction, node);                         \
   }
 VISIT_SIMD_QFMOP(F64x2Qfma, kRiscvF64x2Qfma)
 VISIT_SIMD_QFMOP(F64x2Qfms, kRiscvF64x2Qfms)
@@ -1071,10 +1357,326 @@ VISIT_SIMD_QFMOP(F32x4Qfma, kRiscvF32x4Qfma)
 VISIT_SIMD_QFMOP(F32x4Qfms, kRiscvF32x4Qfms)
 #undef VISIT_SIMD_QFMOP
 
-void InstructionSelector::VisitI32x4DotI16x8S(Node* node) {
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Min(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  InstructionOperand mask_reg = g.TempFpRegister(v0);
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+
+  this->Emit(kRiscvVmfeqVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmfeqVv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVandVv, mask_reg, temp2, temp1, g.UseImmediate(E32),
+             g.UseImmediate(m1));
+
+  InstructionOperand NaN = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand result = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, NaN, g.UseImmediate(0x7FC00000), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVfminVv, result, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E32),
+             g.UseImmediate(m1), g.UseImmediate(MaskType::Mask));
+  this->Emit(kRiscvVmv, g.DefineAsRegister(node), result, g.UseImmediate(E32),
+             g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Max(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  InstructionOperand mask_reg = g.TempFpRegister(v0);
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+
+  this->Emit(kRiscvVmfeqVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmfeqVv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVandVv, mask_reg, temp2, temp1, g.UseImmediate(E32),
+             g.UseImmediate(m1));
+
+  InstructionOperand NaN = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand result = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, NaN, g.UseImmediate(0x7FC00000), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVfmaxVv, result, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E32),
+             g.UseImmediate(m1), g.UseImmediate(MaskType::Mask));
+  this->Emit(kRiscvVmv, g.DefineAsRegister(node), result, g.UseImmediate(E32),
+             g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4RelaxedMin(Node* node) {
+  VisitF32x4Min(node);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2RelaxedMin(Node* node) {
+  VisitF64x2Min(node);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2RelaxedMax(Node* node) {
+  VisitF64x2Max(node);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4RelaxedMax(Node* node) {
+  VisitF32x4Max(node);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Eq(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfeqVv, temp1, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp2, g.UseImmediate(0), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmergeVx, g.DefineAsRegister(node), g.UseImmediate(-1),
+             temp2, g.UseImmediate(E64), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Ne(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfneVv, temp1, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp2, g.UseImmediate(0), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmergeVx, g.DefineAsRegister(node), g.UseImmediate(-1),
+             temp2, g.UseImmediate(E64), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Lt(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfltVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp2, g.UseImmediate(0), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmergeVx, g.DefineAsRegister(node), g.UseImmediate(-1),
+             temp2, g.UseImmediate(E64), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Le(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfleVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp2, g.UseImmediate(0), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmergeVx, g.DefineAsRegister(node), g.UseImmediate(-1),
+             temp2, g.UseImmediate(E64), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Eq(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfeqVv, temp1, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp2, g.UseImmediate(0), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmergeVx, g.DefineAsRegister(node), g.UseImmediate(-1),
+             temp2, g.UseImmediate(E32), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Ne(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfneVv, temp1, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp2, g.UseImmediate(0), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmergeVx, g.DefineAsRegister(node), g.UseImmediate(-1),
+             temp2, g.UseImmediate(E32), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Lt(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfltVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp2, g.UseImmediate(0), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmergeVx, g.DefineAsRegister(node), g.UseImmediate(-1),
+             temp2, g.UseImmediate(E32), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Le(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfleVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp2, g.UseImmediate(0), g.UseImmediate(E32),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmergeVx, g.DefineAsRegister(node), g.UseImmediate(-1),
+             temp2, g.UseImmediate(E32), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4SConvertI16x8Low(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(E32), g.UseImmediate(m1));
+  this->Emit(kRiscvVsextVf2, g.DefineAsRegister(node), temp,
+             g.UseImmediate(E32), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4UConvertI16x8Low(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(E32), g.UseImmediate(m1));
+  this->Emit(kRiscvVzextVf2, g.DefineAsRegister(node), temp,
+             g.UseImmediate(E32), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8SConvertI8x16High(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  Emit(kRiscvVslidedown, temp1, g.UseRegister(node->InputAt(0)),
+       g.UseImmediate(8), g.UseImmediate(E8), g.UseImmediate(m1));
+  Emit(kRiscvVsextVf2, g.DefineAsRegister(node), temp1, g.UseImmediate(E16),
+       g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8SConvertI32x4(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(v26);
+  InstructionOperand temp2 = g.TempFpRegister(v27);
+  this->Emit(kRiscvVmv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(E32), g.UseImmediate(m1));
+  this->Emit(kRiscvVmv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseImmediate(E32), g.UseImmediate(m1));
+  this->Emit(kRiscvVnclip, g.DefineAsRegister(node), temp, g.UseImmediate(0),
+             g.UseImmediate(E16), g.UseImmediate(m1),
+             g.UseImmediate(FPURoundingMode::RNE));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8UConvertI32x4(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(v26);
+  InstructionOperand temp2 = g.TempFpRegister(v27);
+  InstructionOperand temp3 = g.TempFpRegister(v26);
+  this->Emit(kRiscvVmv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(E32), g.UseImmediate(m1));
+  this->Emit(kRiscvVmv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseImmediate(E32), g.UseImmediate(m1));
+  this->Emit(kRiscvVmax, temp3, temp, g.UseImmediate(0), g.UseImmediate(E32),
+             g.UseImmediate(m2));
+  this->Emit(kRiscvVnclipu, g.DefineAsRegister(node), temp3, g.UseImmediate(0),
+             g.UseImmediate(E16), g.UseImmediate(m1),
+             g.UseImmediate(FPURoundingMode::RNE));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16RoundingAverageU(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVwadduVv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E8),
+             g.UseImmediate(m1));
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg3);
+  this->Emit(kRiscvVwadduWx, temp2, temp, g.UseImmediate(1), g.UseImmediate(E8),
+             g.UseImmediate(m1));
+  InstructionOperand temp3 = g.TempFpRegister(kSimd128ScratchReg3);
+  this->Emit(kRiscvVdivu, temp3, temp2, g.UseImmediate(2), g.UseImmediate(E16),
+             g.UseImmediate(m2));
+  this->Emit(kRiscvVnclipu, g.DefineAsRegister(node), temp3, g.UseImmediate(0),
+             g.UseImmediate(E8), g.UseImmediate(m1),
+             g.UseImmediate(FPURoundingMode::RNE));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16SConvertI16x8(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(v26);
+  InstructionOperand temp2 = g.TempFpRegister(v27);
+  this->Emit(kRiscvVmv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(E16), g.UseImmediate(m1));
+  this->Emit(kRiscvVmv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseImmediate(E16), g.UseImmediate(m1));
+  this->Emit(kRiscvVnclip, g.DefineAsRegister(node), temp, g.UseImmediate(0),
+             g.UseImmediate(E8), g.UseImmediate(m1),
+             g.UseImmediate(FPURoundingMode::RNE));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16UConvertI16x8(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(v26);
+  InstructionOperand temp2 = g.TempFpRegister(v27);
+  InstructionOperand temp3 = g.TempFpRegister(v26);
+  this->Emit(kRiscvVmv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(E16), g.UseImmediate(m1));
+  this->Emit(kRiscvVmv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseImmediate(E16), g.UseImmediate(m1));
+  this->Emit(kRiscvVmax, temp3, temp, g.UseImmediate(0), g.UseImmediate(E16),
+             g.UseImmediate(m2));
+  this->Emit(kRiscvVnclipu, g.DefineAsRegister(node), temp3, g.UseImmediate(0),
+             g.UseImmediate(E8), g.UseImmediate(m1),
+             g.UseImmediate(FPURoundingMode::RNE));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8RoundingAverageU(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(v16);
+  InstructionOperand temp2 = g.TempFpRegister(v16);
+  InstructionOperand temp3 = g.TempFpRegister(v16);
+  this->Emit(kRiscvVwadduVv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E16),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVwadduWx, temp2, temp, g.UseImmediate(1),
+             g.UseImmediate(E16), g.UseImmediate(m1));
+  this->Emit(kRiscvVdivu, temp3, temp2, g.UseImmediate(2), g.UseImmediate(E32),
+             g.UseImmediate(m2));
+  this->Emit(kRiscvVnclipu, g.DefineAsRegister(node), temp3, g.UseImmediate(0),
+             g.UseImmediate(E16), g.UseImmediate(m1),
+             g.UseImmediate(FPURoundingMode::RNE));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI16x8S(Node* node) {
   constexpr int32_t FIRST_INDEX = 0b01010101;
   constexpr int32_t SECOND_INDEX = 0b10101010;
-  RiscvOperandGenerator g(this);
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand temp = g.TempFpRegister(v16);
   InstructionOperand temp1 = g.TempFpRegister(v14);
   InstructionOperand temp2 = g.TempFpRegister(v30);
@@ -1090,10 +1692,11 @@ void InstructionSelector::VisitI32x4DotI16x8S(Node* node) {
              g.UseImmediate(m1));
 }
 
-void InstructionSelector::VisitI16x8DotI8x16I7x16S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8DotI8x16I7x16S(Node* node) {
   constexpr int32_t FIRST_INDEX = 0b0101010101010101;
   constexpr int32_t SECOND_INDEX = 0b1010101010101010;
-  RiscvOperandGenerator g(this);
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand temp = g.TempFpRegister(v16);
   InstructionOperand temp1 = g.TempFpRegister(v14);
   InstructionOperand temp2 = g.TempFpRegister(v30);
@@ -1109,12 +1712,13 @@ void InstructionSelector::VisitI16x8DotI8x16I7x16S(Node* node) {
              g.UseImmediate(m1));
 }
 
-void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI8x16I7x16AddS(Node* node) {
   constexpr int32_t FIRST_INDEX = 0b0001000100010001;
   constexpr int32_t SECOND_INDEX = 0b0010001000100010;
   constexpr int32_t THIRD_INDEX = 0b0100010001000100;
   constexpr int32_t FOURTH_INDEX = 0b1000100010001000;
-  RiscvOperandGenerator g(this);
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand intermediate = g.TempFpRegister(v12);
   this->Emit(kRiscvVwmul, intermediate, g.UseRegister(node->InputAt(0)),
              g.UseRegister(node->InputAt(1)), g.UseImmediate(E8),
@@ -1140,9 +1744,9 @@ void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
 
   InstructionOperand temp2 = g.TempFpRegister(v18);
   InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
-  this->Emit(kRiscvVwadd, temp2, compressedPart1, compressedPart2,
+  this->Emit(kRiscvVwaddVv, temp2, compressedPart1, compressedPart2,
              g.UseImmediate(E16), g.UseImmediate(m1));
-  this->Emit(kRiscvVwadd, temp, compressedPart3, compressedPart4,
+  this->Emit(kRiscvVwaddVv, temp, compressedPart3, compressedPart4,
              g.UseImmediate(E16), g.UseImmediate(m1));
 
   InstructionOperand mul_result = g.TempFpRegister(v16);
@@ -1153,13 +1757,14 @@ void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
              g.UseImmediate(E32), g.UseImmediate(m1));
 }
 
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
   Node* input0 = node->InputAt(0);
   Node* input1 = node->InputAt(1);
-  RiscvOperandGenerator g(this);
+  RiscvOperandGeneratorT<Adapter> g(this);
   // uint8_t shuffle32x4[4];
   // ArchOpcode opcode;
   // if (TryMatchArchShuffle(shuffle, arch_shuffles, arraysize(arch_shuffles),
@@ -1187,8 +1792,9 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
        g.UseImmediate(wasm::SimdShuffle::Pack4Lanes(shuffle + 12)));
 }
 
-void InstructionSelector::VisitI8x16Swizzle(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   // We don't want input 0 or input 1 to be the same as output, since we will
   // modify output before do the calculation.
@@ -1198,62 +1804,174 @@ void InstructionSelector::VisitI8x16Swizzle(Node* node) {
        g.UseImmediate(m1), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt32(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvSignExtendByte, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
-}
-
-void InstructionSelector::VisitSignExtendWord16ToInt32(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvSignExtendShort, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
-}
-
-#define VISIT_EXT_MUL(OPCODE1, OPCODE2, TYPE)                            \
-  void InstructionSelector::Visit##OPCODE1##ExtMulLow##OPCODE2##S(       \
-      Node* node) {                                                      \
-    RiscvOperandGenerator g(this);                                       \
-    Emit(kRiscvVwmul, g.DefineAsRegister(node),                          \
-         g.UseUniqueRegister(node->InputAt(0)),                          \
-         g.UseUniqueRegister(node->InputAt(1)), g.UseImmediate(E##TYPE), \
-         g.UseImmediate(mf2));                                           \
-  }                                                                      \
-  void InstructionSelector::Visit##OPCODE1##ExtMulHigh##OPCODE2##S(      \
-      Node* node) {                                                      \
-    RiscvOperandGenerator g(this);                                       \
-    InstructionOperand t1 = g.TempFpRegister(v16);                       \
-    Emit(kRiscvVslidedown, t1, g.UseUniqueRegister(node->InputAt(0)),    \
-         g.UseImmediate(kRvvVLEN / TYPE / 2), g.UseImmediate(E##TYPE),   \
-         g.UseImmediate(m1));                                            \
-    InstructionOperand t2 = g.TempFpRegister(v17);                       \
-    Emit(kRiscvVslidedown, t2, g.UseUniqueRegister(node->InputAt(1)),    \
-         g.UseImmediate(kRvvVLEN / TYPE / 2), g.UseImmediate(E##TYPE),   \
-         g.UseImmediate(m1));                                            \
-    Emit(kRiscvVwmul, g.DefineAsRegister(node), t1, t2,                  \
-         g.UseImmediate(E##TYPE), g.UseImmediate(mf2));                  \
-  }                                                                      \
-  void InstructionSelector::Visit##OPCODE1##ExtMulLow##OPCODE2##U(       \
-      Node* node) {                                                      \
-    RiscvOperandGenerator g(this);                                       \
-    Emit(kRiscvVwmulu, g.DefineAsRegister(node),                         \
-         g.UseUniqueRegister(node->InputAt(0)),                          \
-         g.UseUniqueRegister(node->InputAt(1)), g.UseImmediate(E##TYPE), \
-         g.UseImmediate(mf2));                                           \
-  }                                                                      \
-  void InstructionSelector::Visit##OPCODE1##ExtMulHigh##OPCODE2##U(      \
-      Node* node) {                                                      \
-    RiscvOperandGenerator g(this);                                       \
-    InstructionOperand t1 = g.TempFpRegister(v16);                       \
-    Emit(kRiscvVslidedown, t1, g.UseUniqueRegister(node->InputAt(0)),    \
-         g.UseImmediate(kRvvVLEN / TYPE / 2), g.UseImmediate(E##TYPE),   \
-         g.UseImmediate(m1));                                            \
-    InstructionOperand t2 = g.TempFpRegister(v17);                       \
-    Emit(kRiscvVslidedown, t2, g.UseUniqueRegister(node->InputAt(1)),    \
-         g.UseImmediate(kRvvVLEN / TYPE / 2), g.UseImmediate(E##TYPE),   \
-         g.UseImmediate(m1));                                            \
-    Emit(kRiscvVwmulu, g.DefineAsRegister(node), t1, t2,                 \
-         g.UseImmediate(E##TYPE), g.UseImmediate(mf2));                  \
+#define VISIT_BIMASK(TYPE, VSEW, LMUL)                                      \
+  template <typename Adapter>                                               \
+  void InstructionSelectorT<Adapter>::Visit##TYPE##BitMask(Node* node) {    \
+    RiscvOperandGeneratorT<Adapter> g(this);                                \
+    InstructionOperand temp = g.TempFpRegister(v16);                        \
+    this->Emit(kRiscvVmslt, temp, g.UseRegister(node->InputAt(0)),          \
+               g.UseImmediate(0), g.UseImmediate(VSEW), g.UseImmediate(m1), \
+               g.UseImmediate(true));                                       \
+    this->Emit(kRiscvVmvXs, g.DefineAsRegister(node), temp,                 \
+               g.UseImmediate(E32), g.UseImmediate(m1));                    \
+  }
+
+SIMD_INT_TYPE_LIST(VISIT_BIMASK)
+#undef VISIT_BIMASK
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4SConvertI16x8High(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVslidedown, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(4), g.UseImmediate(E16), g.UseImmediate(m1));
+  this->Emit(kRiscvVsextVf2, g.DefineAsRegister(node), temp,
+             g.UseImmediate(E32), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4UConvertI16x8High(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVslidedown, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(4), g.UseImmediate(E16), g.UseImmediate(m1));
+  this->Emit(kRiscvVzextVf2, g.DefineAsRegister(node), temp,
+             g.UseImmediate(E32), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8SConvertI8x16Low(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp, g.UseRegister(node->InputAt(0)),
+             g.UseImmediate(E16), g.UseImmediate(m1));
+  this->Emit(kRiscvVsextVf2, g.DefineAsRegister(node), temp,
+             g.UseImmediate(E16), g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8UConvertI8x16High(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
+  Emit(kRiscvVslidedown, temp, g.UseRegister(node->InputAt(0)),
+       g.UseImmediate(8), g.UseImmediate(E8), g.UseImmediate(m1));
+  Emit(kRiscvVzextVf2, g.DefineAsRegister(node), temp, g.UseImmediate(E16),
+       g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8UConvertI8x16Low(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp = g.TempFpRegister(kSimd128ScratchReg);
+  Emit(kRiscvVmv, temp, g.UseRegister(node->InputAt(0)), g.UseImmediate(E16),
+       g.UseImmediate(m1));
+  Emit(kRiscvVzextVf2, g.DefineAsRegister(node), temp, g.UseImmediate(E16),
+       g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvSignExtendByte, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvSignExtendShort, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Clz(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvClz32, node);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ctz(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvCtz32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
+}
+
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
+
+template <>
+TurboshaftAdapter::node_t
+InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    node_t node, size_t projection_index) {
+  UNIMPLEMENTED();
+}
+
+#define VISIT_EXT_MUL(OPCODE1, OPCODE2, TYPE)                                 \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE1##ExtMulLow##OPCODE2##S(  \
+      Node* node) {                                                           \
+    RiscvOperandGeneratorT<Adapter> g(this);                                  \
+    Emit(kRiscvVwmul, g.DefineAsRegister(node),                               \
+         g.UseUniqueRegister(node->InputAt(0)),                               \
+         g.UseUniqueRegister(node->InputAt(1)), g.UseImmediate(E##TYPE),      \
+         g.UseImmediate(mf2));                                                \
+  }                                                                           \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE1##ExtMulHigh##OPCODE2##S( \
+      Node* node) {                                                           \
+    RiscvOperandGeneratorT<Adapter> g(this);                                  \
+    InstructionOperand t1 = g.TempFpRegister(v16);                            \
+    Emit(kRiscvVslidedown, t1, g.UseUniqueRegister(node->InputAt(0)),         \
+         g.UseImmediate(kRvvVLEN / TYPE / 2), g.UseImmediate(E##TYPE),        \
+         g.UseImmediate(m1));                                                 \
+    InstructionOperand t2 = g.TempFpRegister(v17);                            \
+    Emit(kRiscvVslidedown, t2, g.UseUniqueRegister(node->InputAt(1)),         \
+         g.UseImmediate(kRvvVLEN / TYPE / 2), g.UseImmediate(E##TYPE),        \
+         g.UseImmediate(m1));                                                 \
+    Emit(kRiscvVwmul, g.DefineAsRegister(node), t1, t2,                       \
+         g.UseImmediate(E##TYPE), g.UseImmediate(mf2));                       \
+  }                                                                           \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE1##ExtMulLow##OPCODE2##U(  \
+      Node* node) {                                                           \
+    RiscvOperandGeneratorT<Adapter> g(this);                                  \
+    Emit(kRiscvVwmulu, g.DefineAsRegister(node),                              \
+         g.UseUniqueRegister(node->InputAt(0)),                               \
+         g.UseUniqueRegister(node->InputAt(1)), g.UseImmediate(E##TYPE),      \
+         g.UseImmediate(mf2));                                                \
+  }                                                                           \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::Visit##OPCODE1##ExtMulHigh##OPCODE2##U( \
+      Node* node) {                                                           \
+    RiscvOperandGeneratorT<Adapter> g(this);                                  \
+    InstructionOperand t1 = g.TempFpRegister(v16);                            \
+    Emit(kRiscvVslidedown, t1, g.UseUniqueRegister(node->InputAt(0)),         \
+         g.UseImmediate(kRvvVLEN / TYPE / 2), g.UseImmediate(E##TYPE),        \
+         g.UseImmediate(m1));                                                 \
+    InstructionOperand t2 = g.TempFpRegister(v17);                            \
+    Emit(kRiscvVslidedown, t2, g.UseUniqueRegister(node->InputAt(1)),         \
+         g.UseImmediate(kRvvVLEN / TYPE / 2), g.UseImmediate(E##TYPE),        \
+         g.UseImmediate(m1));                                                 \
+    Emit(kRiscvVwmulu, g.DefineAsRegister(node), t1, t2,                      \
+         g.UseImmediate(E##TYPE), g.UseImmediate(mf2));                       \
   }
 
 VISIT_EXT_MUL(I64x2, I32x4, 32)
@@ -1261,19 +1979,23 @@ VISIT_EXT_MUL(I32x4, I16x8, 16)
 VISIT_EXT_MUL(I16x8, I8x16, 8)
 #undef VISIT_EXT_MUL
 
-void InstructionSelector::VisitF32x4Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmin(Node* node) {
   VisitUniqueRRR(this, kRiscvF32x4Pmin, node);
 }
 
-void InstructionSelector::VisitF32x4Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmax(Node* node) {
   VisitUniqueRRR(this, kRiscvF32x4Pmax, node);
 }
 
-void InstructionSelector::VisitF64x2Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmin(Node* node) {
   VisitUniqueRRR(this, kRiscvF64x2Pmin, node);
 }
 
-void InstructionSelector::VisitF64x2Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmax(Node* node) {
   VisitUniqueRRR(this, kRiscvF64x2Pmax, node);
 }
 
@@ -1289,9 +2011,9 @@ InstructionSelector::AlignmentRequirements() {
 #endif
 }
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGenerator* g, int first_input_index, node_t node) {
   UNREACHABLE();
 }
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv32.cc b/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv32.cc
index 5e494aa3aba021..259b5d45a93b86 100644
--- a/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv32.cc
+++ b/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv32.cc
@@ -3,6 +3,8 @@
 // found in the LICENSE file.
 
 #include "src/base/bits.h"
+#include "src/codegen/assembler-inl.h"
+#include "src/codegen/machine-type.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
 #include "src/compiler/backend/riscv/instruction-selector-riscv.h"
 #include "src/compiler/node-matchers.h"
@@ -12,17 +14,20 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-bool RiscvOperandGenerator::IsIntegerConstant(Node* node) {
+template <typename Adapter>
+bool RiscvOperandGeneratorT<Adapter>::IsIntegerConstant(Node* node) {
   return (node->opcode() == IrOpcode::kInt32Constant);
 }
 
-int64_t RiscvOperandGenerator::GetIntegerConstantValue(Node* node) {
+template <typename Adapter>
+int64_t RiscvOperandGeneratorT<Adapter>::GetIntegerConstantValue(Node* node) {
   DCHECK_EQ(IrOpcode::kInt32Constant, node->opcode());
   return OpParameter<int32_t>(node->op());
 }
 
-bool RiscvOperandGenerator::CanBeImmediate(int64_t value,
-                                           InstructionCode opcode) {
+template <typename Adapter>
+bool RiscvOperandGeneratorT<Adapter>::CanBeImmediate(int64_t value,
+                                                     InstructionCode opcode) {
   switch (ArchOpcodeField::decode(opcode)) {
     case kRiscvShl32:
     case kRiscvSar32:
@@ -33,7 +38,7 @@ bool RiscvOperandGenerator::CanBeImmediate(int64_t value,
     case kRiscvAnd:
     case kRiscvOr32:
     case kRiscvOr:
-    case kRiscvTst:
+    case kRiscvTst32:
     case kRiscvXor:
       return is_int12(value);
     case kRiscvLb:
@@ -54,9 +59,10 @@ bool RiscvOperandGenerator::CanBeImmediate(int64_t value,
   }
 }
 
-void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
-              Node* output = nullptr) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void EmitLoad(InstructionSelectorT<Adapter>* selector, Node* node,
+              InstructionCode opcode, Node* output = nullptr) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -100,9 +106,10 @@ void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
   }
 }
 
-void EmitS128Load(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void EmitS128Load(InstructionSelectorT<Adapter>* selector, Node* node,
                   InstructionCode opcode, VSew sew, Vlmul lmul) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -122,13 +129,14 @@ void EmitS128Load(InstructionSelector* selector, Node* node,
   }
 }
 
-void InstructionSelector::VisitStoreLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
   StoreLaneParameters params = StoreLaneParametersOf(node->op());
   LoadStoreLaneParams f(params.rep, params.laneidx);
   InstructionCode opcode = kRiscvS128StoreLane;
   opcode |= MiscField::encode(f.sz);
 
-  RiscvOperandGenerator g(this);
+  RiscvOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   InstructionOperand addr_reg = g.TempRegister();
@@ -143,13 +151,14 @@ void InstructionSelector::VisitStoreLane(Node* node) {
   Emit(opcode, 0, nullptr, 4, inputs);
 }
 
-void InstructionSelector::VisitLoadLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
   LoadLaneParameters params = LoadLaneParametersOf(node->op());
   LoadStoreLaneParams f(params.rep.representation(), params.laneidx);
   InstructionCode opcode = kRiscvS128LoadLane;
   opcode |= MiscField::encode(f.sz);
 
-  RiscvOperandGenerator g(this);
+  RiscvOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   InstructionOperand addr_reg = g.TempRegister();
@@ -159,48 +168,65 @@ void InstructionSelector::VisitLoadLane(Node* node) {
        g.UseImmediate(params.laneidx), addr_reg, g.TempImmediate(0));
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
-
-  InstructionCode opcode = kArchNop;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kFloat32:
-      opcode = kRiscvLoadFloat;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kRiscvLoadDouble;
-      break;
-    case MachineRepresentation::kBit:  // Fall through.
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsUnsigned() ? kRiscvLhu : kRiscvLh;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:         // Fall through.
-    case MachineRepresentation::kWord32:
-      opcode = kRiscvLw;
-      break;
-    case MachineRepresentation::kSimd128:
-      opcode = kRiscvRvvLd;
-      break;
-    case MachineRepresentation::kCompressedPointer:
-    case MachineRepresentation::kCompressed:
-    case MachineRepresentation::kSandboxedPointer:
-    case MachineRepresentation::kMapWord:  // Fall through.
-    case MachineRepresentation::kWord64:
-    case MachineRepresentation::kNone:
-    case MachineRepresentation::kSimd256:  // Fall through.
-      UNREACHABLE();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+
+    InstructionCode opcode = kArchNop;
+    switch (load_rep.representation()) {
+      case MachineRepresentation::kFloat32:
+        opcode = kRiscvLoadFloat;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kRiscvLoadDouble;
+        break;
+      case MachineRepresentation::kBit:  // Fall through.
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsUnsigned() ? kRiscvLhu : kRiscvLh;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:         // Fall through.
+      case MachineRepresentation::kWord32:
+        opcode = kRiscvLw;
+        break;
+      case MachineRepresentation::kSimd128:
+        opcode = kRiscvRvvLd;
+        break;
+      case MachineRepresentation::kCompressedPointer:
+      case MachineRepresentation::kCompressed:
+      case MachineRepresentation::kSandboxedPointer:
+      case MachineRepresentation::kMapWord:  // Fall through.
+      case MachineRepresentation::kWord64:
+      case MachineRepresentation::kNone:
+      case MachineRepresentation::kSimd256:  // Fall through.
+      case MachineRepresentation::kIndirectPointer:
+        UNREACHABLE();
+    }
+
+    EmitLoad(this, node, opcode);
   }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
 
-  EmitLoad(this, node, opcode);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitStore(turboshaft::OpIndex) {
+  UNREACHABLE();
 }
 
-void InstructionSelector::VisitStore(Node* node) {
-  RiscvOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitStore(Node* node) {
+  RiscvOperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -258,6 +284,7 @@ void InstructionSelector::VisitStore(Node* node) {
       case MachineRepresentation::kNone:
       case MachineRepresentation::kWord64:
       case MachineRepresentation::kSimd256:  // Fall through.
+      case MachineRepresentation::kIndirectPointer:
         UNREACHABLE();
     }
 
@@ -282,82 +309,140 @@ void InstructionSelector::VisitStore(Node* node) {
   }
 }
 
-void InstructionSelector::VisitWord32And(Node* node) {
-  VisitBinop(this, node, kRiscvAnd, true, kRiscvAnd);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32And(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitWord32Or(Node* node) {
-  VisitBinop(this, node, kRiscvOr, true, kRiscvOr);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32And(Node* node) {
+  VisitBinop<TurbofanAdapter, Int32BinopMatcher>(this, node, kRiscvAnd, true,
+                                                 kRiscvAnd);
 }
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  Int32BinopMatcher m(node);
-  if (m.left().IsWord32Or() && CanCover(node, m.left().node()) &&
-      m.right().Is(-1)) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (!mleft.right().HasResolvedValue()) {
-      RiscvOperandGenerator g(this);
-      Emit(kRiscvNor, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()),
-           g.UseRegister(mleft.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvOr, true,
+                                           kRiscvOr);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    if (m.left().IsWord32Or() && CanCover(node, m.left().node()) &&
+        m.right().Is(-1)) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (!mleft.right().HasResolvedValue()) {
+        RiscvOperandGeneratorT<Adapter> g(this);
+        Emit(kRiscvNor, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()),
+             g.UseRegister(mleft.right().node()));
+        return;
+      }
+    }
+    if (m.right().Is(-1)) {
+      // Use Nor for bit negation and eliminate constant loading for xori.
+      RiscvOperandGeneratorT<Adapter> g(this);
+      Emit(kRiscvNor, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
+           g.TempImmediate(0));
       return;
     }
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvXor, true,
+                                           kRiscvXor);
   }
-  if (m.right().Is(-1)) {
-    // Use Nor for bit negation and eliminate constant loading for xori.
-    RiscvOperandGenerator g(this);
-    Emit(kRiscvNor, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-         g.TempImmediate(0));
-    return;
-  }
-  VisitBinop(this, node, kRiscvXor, true, kRiscvXor);
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) { UNREACHABLE(); }
-
-void InstructionSelector::VisitWord32Ror(Node* node) {
-  VisitRRO(this, kRiscvRor32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    UNREACHABLE();
+  }
 }
 
-void InstructionSelector::VisitWord32Clz(Node* node) {
-  VisitRR(this, kRiscvClz32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRO(this, kRiscvRor32, node);
+  }
 }
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvByteSwap32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvByteSwap32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitWord32Ctz(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvCtz32, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Popcnt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvPopcnt32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitWord32Popcnt(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvPopcnt32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Add(node_t node) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  VisitBinop(this, node, kRiscvAdd32, true, kRiscvAdd32);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Add(Node* node) {
+  VisitBinop<TurbofanAdapter, Int32BinopMatcher>(this, node, kRiscvAdd32, true,
+                                         kRiscvAdd32);
 }
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  VisitBinop(this, node, kRiscvSub32);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvSub32);
+  }
 }
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
-  RiscvOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Mul(node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Mul(Node* node) {
+  RiscvOperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
     uint32_t value = static_cast<uint32_t>(m.right().ResolvedValue());
@@ -381,315 +466,467 @@ void InstructionSelector::VisitInt32Mul(Node* node) {
   VisitRRR(this, kRiscvMul32, node);
 }
 
-void InstructionSelector::VisitInt32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRRR(this, kRiscvMulHigh32, node);
+  }
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRRR(this, kRiscvMulHighU32, node);
+  }
 }
 
-void InstructionSelector::VisitInt32Div(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int32BinopMatcher m(node);
   Emit(kRiscvDiv32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitUint32Div(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int32BinopMatcher m(node);
   Emit(kRiscvDivU32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitInt32Mod(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int32BinopMatcher m(node);
   Emit(kRiscvMod32, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitUint32Mod(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int32BinopMatcher m(node);
   Emit(kRiscvModU32, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitChangeFloat32ToFloat64(Node* node) {
-  VisitRR(this, kRiscvCvtDS, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat32ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtDS, node);
+  }
 }
 
-void InstructionSelector::VisitRoundInt32ToFloat32(Node* node) {
-  VisitRR(this, kRiscvCvtSW, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtSW, node);
+  }
 }
 
-void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) {
-  VisitRR(this, kRiscvCvtSUw, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtSUw, node);
+  }
 }
 
-void InstructionSelector::VisitChangeInt32ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToFloat64(node_t node) {
   VisitRR(this, kRiscvCvtDW, node);
 }
 
-void InstructionSelector::VisitChangeUint32ToFloat64(Node* node) {
-  VisitRR(this, kRiscvCvtDUw, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtDUw, node);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) {
-  RiscvOperandGenerator g(this);
-  InstructionCode opcode = kRiscvTruncWS;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kRiscvTruncWS;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) {
-  RiscvOperandGenerator g(this);
-  InstructionCode opcode = kRiscvTruncUwS;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kRiscvTruncUwS;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  if (CanCover(node, value)) {
-    if (value->opcode() == IrOpcode::kChangeFloat32ToFloat64) {
-      // Match float32 -> float64 -> int32 representation change path.
-      Emit(kRiscvTruncWS, g.DefineAsRegister(node),
-           g.UseRegister(value->InputAt(0)));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    if (CanCover(node, value)) {
+      if (value->opcode() == IrOpcode::kChangeFloat32ToFloat64) {
+        // Match float32 -> float64 -> int32 representation change path.
+        Emit(kRiscvTruncWS, g.DefineAsRegister(node),
+             g.UseRegister(value->InputAt(0)));
+        return;
+      }
     }
+    VisitRR(this, kRiscvTruncWD, node);
   }
-  VisitRR(this, kRiscvTruncWD, node);
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint32(Node* node) {
-  VisitRR(this, kRiscvTruncUwD, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvTruncUwD, node);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat64ToUint32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToUint32(node_t node) {
   VisitRR(this, kRiscvTruncUwD, node);
 }
 
-void InstructionSelector::VisitBitcastFloat32ToInt32(Node* node) {
-  VisitRR(this, kRiscvBitcastFloat32ToInt32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvBitcastFloat32ToInt32, node);
+  }
 }
 
-void InstructionSelector::VisitBitcastInt32ToFloat32(Node* node) {
-  VisitRR(this, kRiscvBitcastInt32ToFloat32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvBitcastInt32ToFloat32, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundDown(Node* node) { UNIMPLEMENTED(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundDown(node_t node) {
+  UNIMPLEMENTED();
+}
 
-void InstructionSelector::VisitFloat32RoundUp(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundUp(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat32RoundUp, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundUp(Node* node) { UNIMPLEMENTED(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundUp(node_t node) {
+  UNIMPLEMENTED();
+}
 
-void InstructionSelector::VisitFloat32RoundTruncate(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTruncate(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat32RoundTruncate, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundTruncate(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTruncate(node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesAway(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitFloat32RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTiesEven(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat32RoundTiesEven, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesEven(node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitFloat32Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Neg(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvNegS, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Neg(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvNegD, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  RiscvOperandGenerator g(this);
-  Emit(opcode, g.DefineAsFixed(node, fa0), g.UseFixed(node->InputAt(0), fa0),
-       g.UseFixed(node->InputAt(1), fa1))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(opcode, g.DefineAsFixed(node, fa0), g.UseFixed(node->InputAt(0), fa0),
+         g.UseFixed(node->InputAt(1), fa1))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, fa0), g.UseFixed(node->InputAt(0), fa1))
       ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  RiscvOperandGenerator g(this);
-
-  // Prepare for C function call.
-  if (call_descriptor->IsCFunctionCall()) {
-    Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
-                                         call_descriptor->ParameterCount())),
-         0, nullptr, 0, nullptr);
-
-    // Poke any stack arguments.
-    int slot = kCArgSlotCount;
-    for (PushParameter input : (*arguments)) {
-      Emit(kRiscvStoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
-           g.TempImmediate(slot << kSystemPointerSizeLog2));
-      ++slot;
-    }
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    int push_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-    if (push_count > 0) {
-      Emit(kRiscvStackClaim, g.NoOutput(),
-           g.TempImmediate(arguments->size() << kSystemPointerSizeLog2));
-    }
-    for (size_t n = 0; n < arguments->size(); ++n) {
-      PushParameter input = (*arguments)[n];
-      if (input.node) {
+    RiscvOperandGeneratorT<Adapter> g(this);
+
+    // Prepare for C function call.
+    if (call_descriptor->IsCFunctionCall()) {
+      Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
+                                           call_descriptor->ParameterCount())),
+           0, nullptr, 0, nullptr);
+
+      // Poke any stack arguments.
+      int slot = kCArgSlotCount;
+      for (PushParameter input : (*arguments)) {
         Emit(kRiscvStoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
-             g.TempImmediate(static_cast<int>(n << kSystemPointerSizeLog2)));
+             g.TempImmediate(slot << kSystemPointerSizeLog2));
+        ++slot;
+      }
+    } else {
+      int push_count = static_cast<int>(call_descriptor->ParameterSlotCount());
+      if (push_count > 0) {
+        Emit(kRiscvStackClaim, g.NoOutput(),
+             g.TempImmediate(arguments->size() << kSystemPointerSizeLog2));
+      }
+      for (size_t n = 0; n < arguments->size(); ++n) {
+        PushParameter input = (*arguments)[n];
+        if (input.node) {
+          Emit(kRiscvStoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
+               g.TempImmediate(static_cast<int>(n << kSystemPointerSizeLog2)));
+        }
       }
     }
   }
 }
 
-void InstructionSelector::VisitUnalignedLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
-  RiscvOperandGenerator g(this);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* base = node->InputAt(0);
+    Node* index = node->InputAt(1);
 
-  ArchOpcode opcode;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kFloat32:
-      opcode = kRiscvULoadFloat;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kRiscvULoadDouble;
-      break;
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsUnsigned() ? kRiscvUlhu : kRiscvUlh;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:         // Fall through.
-    case MachineRepresentation::kWord32:
-      opcode = kRiscvUlw;
-      break;
-    case MachineRepresentation::kSimd128:
-      opcode = kRiscvRvvLd;
-      break;
-    case MachineRepresentation::kSimd256:            // Fall through.
-    case MachineRepresentation::kBit:                // Fall through.
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kCompressed:         // Fall through.
-    case MachineRepresentation::kSandboxedPointer:   // Fall through.
-    case MachineRepresentation::kMapWord:            // Fall through.
-    case MachineRepresentation::kWord64:
-    case MachineRepresentation::kNone:
-      UNREACHABLE();
-  }
+    ArchOpcode opcode;
+    switch (load_rep.representation()) {
+      case MachineRepresentation::kFloat32:
+        opcode = kRiscvULoadFloat;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kRiscvULoadDouble;
+        break;
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsUnsigned() ? kRiscvUlhu : kRiscvUlh;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:         // Fall through.
+      case MachineRepresentation::kWord32:
+        opcode = kRiscvUlw;
+        break;
+      case MachineRepresentation::kSimd128:
+        opcode = kRiscvRvvLd;
+        break;
+      case MachineRepresentation::kSimd256:            // Fall through.
+      case MachineRepresentation::kBit:                // Fall through.
+      case MachineRepresentation::kCompressedPointer:  // Fall through.
+      case MachineRepresentation::kCompressed:         // Fall through.
+      case MachineRepresentation::kSandboxedPointer:   // Fall through.
+      case MachineRepresentation::kMapWord:            // Fall through.
+      case MachineRepresentation::kWord64:
+      case MachineRepresentation::kNone:
+      case MachineRepresentation::kIndirectPointer:
+        UNREACHABLE();
+    }
 
-  if (g.CanBeImmediate(index, opcode)) {
-    Emit(opcode | AddressingModeField::encode(kMode_MRI),
-         g.DefineAsRegister(node), g.UseRegister(base), g.UseImmediate(index));
-  } else {
-    InstructionOperand addr_reg = g.TempRegister();
-    Emit(kRiscvAdd32 | AddressingModeField::encode(kMode_None), addr_reg,
-         g.UseRegister(index), g.UseRegister(base));
-    // Emit desired load opcode, using temp addr_reg.
-    Emit(opcode | AddressingModeField::encode(kMode_MRI),
-         g.DefineAsRegister(node), addr_reg, g.TempImmediate(0));
+    if (g.CanBeImmediate(index, opcode)) {
+      Emit(opcode | AddressingModeField::encode(kMode_MRI),
+           g.DefineAsRegister(node), g.UseRegister(base),
+           g.UseImmediate(index));
+    } else {
+      InstructionOperand addr_reg = g.TempRegister();
+      Emit(kRiscvAdd32 | AddressingModeField::encode(kMode_None), addr_reg,
+           g.UseRegister(index), g.UseRegister(base));
+      // Emit desired load opcode, using temp addr_reg.
+      Emit(opcode | AddressingModeField::encode(kMode_MRI),
+           g.DefineAsRegister(node), addr_reg, g.TempImmediate(0));
+    }
   }
 }
 
-void InstructionSelector::VisitUnalignedStore(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
-  Node* value = node->InputAt(2);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* base = node->InputAt(0);
+    Node* index = node->InputAt(1);
+    Node* value = node->InputAt(2);
 
-  UnalignedStoreRepresentation rep = UnalignedStoreRepresentationOf(node->op());
-  ArchOpcode opcode;
-  switch (rep) {
-    case MachineRepresentation::kFloat32:
-      opcode = kRiscvUStoreFloat;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kRiscvUStoreDouble;
-      break;
-    case MachineRepresentation::kWord8:
-      opcode = kRiscvSb;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = kRiscvUsh;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:         // Fall through.
-    case MachineRepresentation::kWord32:
-      opcode = kRiscvUsw;
-      break;
-    case MachineRepresentation::kSimd128:
-      opcode = kRiscvRvvSt;
-      break;
-    case MachineRepresentation::kSimd256:            // Fall through.
-    case MachineRepresentation::kBit:                // Fall through.
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kCompressed:         // Fall through.
-    case MachineRepresentation::kSandboxedPointer:
-    case MachineRepresentation::kMapWord:  // Fall through.
-    case MachineRepresentation::kNone:
-    case MachineRepresentation::kWord64:
-      UNREACHABLE();
-  }
+    UnalignedStoreRepresentation rep =
+        UnalignedStoreRepresentationOf(node->op());
+    ArchOpcode opcode;
+    switch (rep) {
+      case MachineRepresentation::kFloat32:
+        opcode = kRiscvUStoreFloat;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kRiscvUStoreDouble;
+        break;
+      case MachineRepresentation::kWord8:
+        opcode = kRiscvSb;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = kRiscvUsh;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:         // Fall through.
+      case MachineRepresentation::kWord32:
+        opcode = kRiscvUsw;
+        break;
+      case MachineRepresentation::kSimd128:
+        opcode = kRiscvRvvSt;
+        break;
+      case MachineRepresentation::kSimd256:            // Fall through.
+      case MachineRepresentation::kBit:                // Fall through.
+      case MachineRepresentation::kCompressedPointer:  // Fall through.
+      case MachineRepresentation::kCompressed:         // Fall through.
+      case MachineRepresentation::kSandboxedPointer:
+      case MachineRepresentation::kMapWord:  // Fall through.
+      case MachineRepresentation::kNone:
+      case MachineRepresentation::kWord64:
+      case MachineRepresentation::kIndirectPointer:
+        UNREACHABLE();
+    }
 
-  if (g.CanBeImmediate(index, opcode)) {
-    Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(),
-         g.UseRegister(base), g.UseImmediate(index),
-         g.UseRegisterOrImmediateZero(value));
-  } else {
-    InstructionOperand addr_reg = g.TempRegister();
-    Emit(kRiscvAdd32 | AddressingModeField::encode(kMode_None), addr_reg,
-         g.UseRegister(index), g.UseRegister(base));
-    // Emit desired store opcode, using temp addr_reg.
-    Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(),
-         addr_reg, g.TempImmediate(0), g.UseRegisterOrImmediateZero(value));
+    if (g.CanBeImmediate(index, opcode)) {
+      Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(),
+           g.UseRegister(base), g.UseImmediate(index),
+           g.UseRegisterOrImmediateZero(value));
+    } else {
+      InstructionOperand addr_reg = g.TempRegister();
+      Emit(kRiscvAdd32 | AddressingModeField::encode(kMode_None), addr_reg,
+           g.UseRegister(index), g.UseRegister(base));
+      // Emit desired store opcode, using temp addr_reg.
+      Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(),
+           addr_reg, g.TempImmediate(0), g.UseRegisterOrImmediateZero(value));
+    }
   }
 }
 
 namespace {
 
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      FlagsContinuation* cont) {
-  VisitWordCompare(selector, node, kRiscvCmp, cont, false);
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node,
+                      FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWordCompare(selector, node, kRiscvCmp, cont, false);
+  }
 }
 
-void VisitAtomicLoad(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicLoad(InstructionSelectorT<Adapter>* selector, Node* node,
                      ArchOpcode opcode, AtomicWidth width) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   if (g.CanBeImmediate(index, opcode)) {
@@ -708,9 +945,10 @@ void VisitAtomicLoad(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitAtomicStore(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicStore(InstructionSelectorT<Adapter>* selector, Node* node,
                       ArchOpcode opcode, AtomicWidth width) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -718,8 +956,8 @@ void VisitAtomicStore(InstructionSelector* selector, Node* node,
   if (g.CanBeImmediate(index, opcode)) {
     selector->Emit(opcode | AddressingModeField::encode(kMode_MRI) |
                        AtomicWidthField::encode(width),
-                   g.NoOutput(), g.UseRegister(base), g.UseImmediate(index),
-                   g.UseRegisterOrImmediateZero(value));
+                   g.NoOutput(), g.UseRegisterOrImmediateZero(value),
+                   g.UseRegister(base), g.UseImmediate(index));
   } else {
     InstructionOperand addr_reg = g.TempRegister();
     selector->Emit(kRiscvAdd32 | AddressingModeField::encode(kMode_None),
@@ -727,14 +965,15 @@ void VisitAtomicStore(InstructionSelector* selector, Node* node,
     // Emit desired store opcode, using temp addr_reg.
     selector->Emit(opcode | AddressingModeField::encode(kMode_MRI) |
                        AtomicWidthField::encode(width),
-                   g.NoOutput(), addr_reg, g.TempImmediate(0),
-                   g.UseRegisterOrImmediateZero(value));
+                   g.NoOutput(), g.UseRegisterOrImmediateZero(value), addr_reg,
+                   g.TempImmediate(0));
   }
 }
 
-void VisitAtomicBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                       ArchOpcode opcode) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -758,13 +997,26 @@ void VisitAtomicBinop(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuationT<Adapter>* cont) {
+  StackCheckKind kind;
+  node_t value;
+  if constexpr (Adapter::IsTurboshaft) {
+    const auto& op =
+        this->turboshaft_graph()
+            ->Get(node)
+            .template Cast<turboshaft::StackPointerGreaterThanOp>();
+    kind = op.kind;
+    value = op.stack_limit();
+  } else {
+    kind = StackCheckKindOf(node->op());
+    value = node->InputAt(0);
+  }
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
-  RiscvOperandGenerator g(this);
+  RiscvOperandGeneratorT<Adapter> g(this);
 
   // No outputs.
   InstructionOperand* const outputs = nullptr;
@@ -779,7 +1031,6 @@ void InstructionSelector::VisitStackPointerGreaterThan(
                                  ? OperandGenerator::kUniqueRegister
                                  : OperandGenerator::kRegister;
 
-  Node* const value = node->InputAt(0);
   InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
   static constexpr int input_count = arraysize(inputs);
 
@@ -788,281 +1039,349 @@ void InstructionSelector::VisitStackPointerGreaterThan(
 }
 
 // Shared routine for word comparisons against zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (CanCover(user, value)) {
-    if (value->opcode() == IrOpcode::kWord32Equal) {
-      Int32BinopMatcher m(value);
-      if (!m.right().Is(0)) break;
-      user = value;
-      value = m.left().node();
-    } else if (value->opcode() == IrOpcode::kWord64Equal) {
-      Int64BinopMatcher m(value);
-      if (!m.right().Is(0)) break;
-      user = value;
-      value = m.left().node();
-    } else {
-      break;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (CanCover(user, value)) {
+      if (value->opcode() == IrOpcode::kWord32Equal) {
+        Int32BinopMatcher m(value);
+        if (!m.right().Is(0)) break;
+        user = value;
+        value = m.left().node();
+      } else if (value->opcode() == IrOpcode::kWord64Equal) {
+        Int64BinopMatcher m(value);
+        if (!m.right().Is(0)) break;
+        user = value;
+        value = m.left().node();
+      } else {
+        break;
+      }
+
+      cont->Negate();
     }
 
-    cont->Negate();
-  }
-
-  if (CanCover(user, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWordCompare(this, value, cont);
-      case IrOpcode::kFloat32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kProjection:
-        // Check if this is the overflow output projection of an
-        // <Operation>WithOverflow node.
-        if (ProjectionIndexOf(value->op()) == 1u) {
-          // We cannot combine the <Operation>WithOverflow with this branch
-          // unless the 0th projection (the use of the actual value of the
-          // <Operation> is either nullptr, which means there's no use of the
-          // actual value, or was already defined, which means it is scheduled
-          // *AFTER* this branch).
-          Node* const node = value->InputAt(0);
-          Node* const result = NodeProperties::FindProjection(node, 0);
-          if (result == nullptr || IsDefined(result)) {
-            switch (node->opcode()) {
-              case IrOpcode::kInt32AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kRiscvAddOvf, cont);
-              case IrOpcode::kInt32SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kRiscvSubOvf, cont);
-              case IrOpcode::kInt32MulWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kRiscvMulOvf32, cont);
-              case IrOpcode::kInt64AddWithOverflow:
-              case IrOpcode::kInt64SubWithOverflow:
-                TRACE_UNIMPL();
-                break;
-              default:
-                break;
+    if (CanCover(user, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWordCompare(this, value, cont);
+        case IrOpcode::kFloat32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kProjection:
+          // Check if this is the overflow output projection of an
+          // <Operation>WithOverflow node.
+          if (ProjectionIndexOf(value->op()) == 1u) {
+            // We cannot combine the <Operation>WithOverflow with this branch
+            // unless the 0th projection (the use of the actual value of the
+            // <Operation> is either nullptr, which means there's no use of the
+            // actual value, or was already defined, which means it is scheduled
+            // *AFTER* this branch).
+            Node* const node = value->InputAt(0);
+            Node* const result = NodeProperties::FindProjection(node, 0);
+            if (result == nullptr || IsDefined(result)) {
+              switch (node->opcode()) {
+                case IrOpcode::kInt32AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kRiscvAddOvf, cont);
+                case IrOpcode::kInt32SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kRiscvSubOvf, cont);
+                case IrOpcode::kInt32MulWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kRiscvMulOvf32, cont);
+                case IrOpcode::kInt64AddWithOverflow:
+                case IrOpcode::kInt64SubWithOverflow:
+                  TRACE_UNIMPL();
+                  break;
+                default:
+                  break;
+              }
             }
           }
-        }
-        break;
-      case IrOpcode::kWord32And:
-        return VisitWordCompare(this, value, kRiscvTst, cont, true);
-      case IrOpcode::kStackPointerGreaterThan:
-        cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
-        return VisitStackPointerGreaterThan(value, cont);
-      default:
-        break;
+          break;
+        case IrOpcode::kWord32And:
+          return VisitWordCompare(this, value, kRiscvTst32, cont, true);
+        case IrOpcode::kStackPointerGreaterThan:
+          cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
+          return VisitStackPointerGreaterThan(value, cont);
+        default:
+          break;
+      }
     }
-  }
 
-  // Continuation could not be combined with a compare, emit compare against 0.
-  EmitWordCompareZero(this, value, cont);
+    // Continuation could not be combined with a compare, emit compare against
+    // 0.
+    EmitWordCompareZero(this, value, cont);
+  }
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(0)) {
-    return VisitWordCompareZero(m.node(), m.left().node(), &cont);
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    Int32BinopMatcher m(node);
+    if (m.right().Is(0)) {
+      return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+    }
 
-  VisitWordCompare(this, node, &cont);
+    VisitWordCompare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWordCompare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kRiscvAddOvf, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvAddOvf,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvAddOvf, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvAddOvf, &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kRiscvSubOvf, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvSubOvf,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvSubOvf, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvSubOvf, &cont);
 }
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kRiscvMulOvf32, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvMulOvf32,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvMulOvf32, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvMulOvf32, &cont);
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
-  AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
-  LoadRepresentation load_rep = atomic_load_params.representation();
-  ArchOpcode opcode;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsSigned() ? kAtomicLoadInt8 : kAtomicLoadUint8;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsSigned() ? kAtomicLoadInt16 : kAtomicLoadUint16;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:
-    case MachineRepresentation::kWord32:
-      opcode = kAtomicLoadWord32;
-      break;
-    default:
-      UNREACHABLE();
-  }
-  VisitAtomicLoad(this, node, opcode, AtomicWidth::kWord32);
-}
-
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
-  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
-  MachineRepresentation rep = store_params.representation();
-  ArchOpcode opcode;
-  switch (rep) {
-    case MachineRepresentation::kWord8:
-      opcode = kAtomicStoreWord8;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = kAtomicStoreWord16;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:
-    case MachineRepresentation::kWord32:
-      opcode = kAtomicStoreWord32;
-      break;
-    default:
-      UNREACHABLE();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    AtomicLoadParameters atomic_load_params =
+        AtomicLoadParametersOf(node->op());
+    LoadRepresentation load_rep = atomic_load_params.representation();
+    ArchOpcode opcode;
+    switch (load_rep.representation()) {
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsSigned() ? kAtomicLoadInt8 : kAtomicLoadUint8;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsSigned() ? kAtomicLoadInt16 : kAtomicLoadUint16;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:
+      case MachineRepresentation::kWord32:
+        opcode = kAtomicLoadWord32;
+        break;
+      default:
+        UNREACHABLE();
+    }
+    VisitAtomicLoad(this, node, opcode, AtomicWidth::kWord32);
   }
-
-  VisitAtomicStore(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Int8()) {
-    opcode = kAtomicExchangeInt8;
-  } else if (type == MachineType::Uint8()) {
-    opcode = kAtomicExchangeUint8;
-  } else if (type == MachineType::Int16()) {
-    opcode = kAtomicExchangeInt16;
-  } else if (type == MachineType::Uint16()) {
-    opcode = kAtomicExchangeUint16;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = kAtomicExchangeWord32;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
-  }
+    AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
+    MachineRepresentation rep = store_params.representation();
+    ArchOpcode opcode;
+    switch (rep) {
+      case MachineRepresentation::kWord8:
+        opcode = kAtomicStoreWord8;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = kAtomicStoreWord16;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:
+      case MachineRepresentation::kWord32:
+        opcode = kAtomicStoreWord32;
+        break;
+      default:
+        UNREACHABLE();
+    }
 
-  VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32);
+    VisitAtomicStore(this, node, opcode, AtomicWidth::kWord32);
+  }
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Int8()) {
-    opcode = kAtomicCompareExchangeInt8;
-  } else if (type == MachineType::Uint8()) {
-    opcode = kAtomicCompareExchangeUint8;
-  } else if (type == MachineType::Int16()) {
-    opcode = kAtomicCompareExchangeInt16;
-  } else if (type == MachineType::Uint16()) {
-    opcode = kAtomicCompareExchangeUint16;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = kAtomicCompareExchangeWord32;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Int8()) {
+      opcode = kAtomicExchangeInt8;
+    } else if (type == MachineType::Uint8()) {
+      opcode = kAtomicExchangeUint8;
+    } else if (type == MachineType::Int16()) {
+      opcode = kAtomicExchangeInt16;
+    } else if (type == MachineType::Uint16()) {
+      opcode = kAtomicExchangeUint16;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = kAtomicExchangeWord32;
+    } else {
+      UNREACHABLE();
+    }
+
+    VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32);
   }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Int8()) {
+      opcode = kAtomicCompareExchangeInt8;
+    } else if (type == MachineType::Uint8()) {
+      opcode = kAtomicCompareExchangeUint8;
+    } else if (type == MachineType::Int16()) {
+      opcode = kAtomicCompareExchangeInt16;
+    } else if (type == MachineType::Uint16()) {
+      opcode = kAtomicCompareExchangeUint16;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = kAtomicCompareExchangeWord32;
+    } else {
+      UNREACHABLE();
+    }
 
-  VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord32);
+    VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord32);
+  }
 }
 
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
-    Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Int8()) {
-    opcode = int8_op;
-  } else if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Int16()) {
-    opcode = int16_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = word32_op;
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
-  }
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Int8()) {
+      opcode = int8_op;
+    } else if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Int16()) {
+      opcode = int16_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = word32_op;
+    } else {
+      UNREACHABLE();
+    }
 
-  VisitAtomicBinop(this, node, opcode);
+    VisitAtomicBinop(this, node, opcode);
+  }
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                             \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) {  \
+    if constexpr (Adapter::IsTurboshaft) {                                 \
+      UNIMPLEMENTED();                                                     \
+    } else {                                                               \
+      VisitWord32AtomicBinaryOperation(                                    \
+          node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
+          kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+    }                                                                      \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -1071,22 +1390,30 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-template <unsigned N>
-static void VisitInt32PairBinop(InstructionSelector* selector,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32PairToFloat64(
+    node_t node) {
+  UNIMPLEMENTED();
+}
+
+template <unsigned N, typename Adapter>
+static void VisitInt32PairBinop(InstructionSelectorT<Adapter>* selector,
                                 InstructionCode pair_opcode,
                                 InstructionCode single_opcode, Node* node) {
   static_assert(N == 3 || N == 4,
                 "Pair operations can only have 3 or 4 inputs");
 
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
 
   Node* projection1 = NodeProperties::FindProjection(node, 1);
 
@@ -1124,22 +1451,57 @@ static void VisitInt32PairBinop(InstructionSelector* selector,
   }
 }
 
-void InstructionSelector::VisitInt32PairAdd(Node* node) {
-  VisitInt32PairBinop<4>(this, kRiscvAddPair, kRiscvAdd32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32PairAdd(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitInt32PairBinop<4>(this, kRiscvAddPair, kRiscvAdd32, node);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32PairSub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitInt32PairBinop<4>(this, kRiscvSubPair, kRiscvSub32, node);
+  }
 }
 
-void InstructionSelector::VisitInt32PairSub(Node* node) {
-  VisitInt32PairBinop<4>(this, kRiscvSubPair, kRiscvSub32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32PairMul(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitInt32PairBinop<4>(this, kRiscvMulPair, kRiscvMul32, node);
+  }
 }
 
-void InstructionSelector::VisitInt32PairMul(Node* node) {
-  VisitInt32PairBinop<4>(this, kRiscvMulPair, kRiscvMul32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2SplatI32Pair(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand low = g.UseRegister(node->InputAt(0));
+  InstructionOperand high = g.UseRegister(node->InputAt(1));
+  Emit(kRiscvI64x2SplatI32Pair, g.DefineAsRegister(node), low, high);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ReplaceLaneI32Pair(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand operand = g.UseRegister(node->InputAt(0));
+  InstructionOperand lane = g.UseImmediate(OpParameter<int32_t>(node->op()));
+  InstructionOperand low = g.UseRegister(node->InputAt(1));
+  InstructionOperand high = g.UseRegister(node->InputAt(2));
+  Emit(kRiscvI64x2ReplaceLaneI32Pair, g.DefineSameAsFirst(node), operand, lane,
+       low, high);
 }
 
 // Shared routine for multiple shift operations.
-static void VisitWord32PairShift(InstructionSelector* selector,
+template <typename Adapter>
+static void VisitWord32PairShift(InstructionSelectorT<Adapter>* selector,
                                  InstructionCode opcode, Node* node) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Int32Matcher m(node->InputAt(2));
   InstructionOperand shift_operand;
   if (m.HasResolvedValue()) {
@@ -1171,20 +1533,36 @@ static void VisitWord32PairShift(InstructionSelector* selector,
   selector->Emit(opcode, output_count, outputs, 3, inputs, temp_count, temps);
 }
 
-void InstructionSelector::VisitWord32PairShl(Node* node) {
-  VisitWord32PairShift(this, kRiscvShlPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairShl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kRiscvShlPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32PairShr(Node* node) {
-  VisitWord32PairShift(this, kRiscvShrPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairShr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kRiscvShrPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32PairSar(Node* node) {
-  VisitWord32PairShift(this, kRiscvSarPair, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32PairSar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32PairShift(this, kRiscvSarPair, node);
+  }
 }
 
-void InstructionSelector::VisitWord32AtomicPairLoad(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairLoad(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   ArchOpcode opcode = kRiscvWord32AtomicPairLoad;
@@ -1213,8 +1591,9 @@ void InstructionSelector::VisitWord32AtomicPairLoad(Node* node) {
        temps);
 }
 
-void InstructionSelector::VisitWord32AtomicPairStore(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairStore(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value_low = node->InputAt(2);
@@ -1229,9 +1608,10 @@ void InstructionSelector::VisitWord32AtomicPairStore(Node* node) {
        nullptr, arraysize(inputs), inputs, arraysize(temps), temps);
 }
 
-static void VisitPairAtomicBinop(InstructionSelector* selector, Node* node,
-                                 ArchOpcode opcode) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+static void VisitPairAtomicBinop(InstructionSelectorT<Adapter>* selector,
+                                 Node* node, ArchOpcode opcode) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -1263,31 +1643,40 @@ static void VisitPairAtomicBinop(InstructionSelector* selector, Node* node,
                  temp_count, temps);
 }
 
-void InstructionSelector::VisitWord32AtomicPairAdd(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairAdd(Node* node) {
   VisitPairAtomicBinop(this, node, kRiscvWord32AtomicPairAdd);
 }
 
-void InstructionSelector::VisitWord32AtomicPairSub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairSub(Node* node) {
   VisitPairAtomicBinop(this, node, kRiscvWord32AtomicPairSub);
 }
 
-void InstructionSelector::VisitWord32AtomicPairAnd(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairAnd(Node* node) {
   VisitPairAtomicBinop(this, node, kRiscvWord32AtomicPairAnd);
 }
 
-void InstructionSelector::VisitWord32AtomicPairOr(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairOr(Node* node) {
   VisitPairAtomicBinop(this, node, kRiscvWord32AtomicPairOr);
 }
 
-void InstructionSelector::VisitWord32AtomicPairXor(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairXor(Node* node) {
   VisitPairAtomicBinop(this, node, kRiscvWord32AtomicPairXor);
 }
 
-void InstructionSelector::VisitWord32AtomicPairExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairExchange(Node* node) {
   VisitPairAtomicBinop(this, node, kRiscvWord32AtomicPairExchange);
 }
-void InstructionSelector::VisitWord32AtomicPairCompareExchange(Node* node) {
-  RiscvOperandGenerator g(this);
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicPairCompareExchange(
+    Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand inputs[] = {
       g.UseRegister(node->InputAt(0)),  g.UseRegister(node->InputAt(1)),
       g.UseFixed(node->InputAt(2), a1), g.UseFixed(node->InputAt(3), a2),
@@ -1315,6 +1704,66 @@ void InstructionSelector::VisitWord32AtomicPairCompareExchange(Node* node) {
   Emit(code, output_count, outputs, arraysize(inputs), inputs, temp_count,
        temps);
 }
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Min(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  InstructionOperand mask_reg = g.TempFpRegister(v0);
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  const int32_t kNaN = 0x7ff80000L, kNaNShift = 32;
+  this->Emit(kRiscvVmfeqVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmfeqVv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVandVv, mask_reg, temp2, temp1, g.UseImmediate(E64),
+             g.UseImmediate(m1));
+
+  InstructionOperand temp3 = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand temp4 = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand temp5 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp3, g.UseImmediate(kNaN), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVsll, temp4, temp3, g.UseImmediate(kNaNShift),
+             g.UseImmediate(E64), g.UseImmediate(m1));
+  this->Emit(kRiscvVfminVv, temp5, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1), g.UseImmediate(Mask));
+  this->Emit(kRiscvVmv, g.DefineAsRegister(node), temp5, g.UseImmediate(E64),
+             g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Max(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  InstructionOperand mask_reg = g.TempFpRegister(v0);
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  const int32_t kNaN = 0x7ff80000L, kNaNShift = 32;
+  this->Emit(kRiscvVmfeqVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmfeqVv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVandVv, mask_reg, temp2, temp1, g.UseImmediate(E64),
+             g.UseImmediate(m1));
+
+  InstructionOperand temp3 = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand temp4 = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand temp5 = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, temp3, g.UseImmediate(kNaN), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVsll, temp4, temp3, g.UseImmediate(kNaNShift),
+             g.UseImmediate(E64), g.UseImmediate(m1));
+  this->Emit(kRiscvVfmaxVv, temp5, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1), g.UseImmediate(Mask));
+  this->Emit(kRiscvVmv, g.DefineAsRegister(node), temp5, g.UseImmediate(E64),
+             g.UseImmediate(m1));
+}
 // static
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
@@ -1332,6 +1781,10 @@ InstructionSelector::SupportedMachineOperatorFlags() {
 #undef TRACE_UNIMPL
 #undef TRACE
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv64.cc b/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv64.cc
index 130831675fd0a9..81ec489d3e7b1b 100644
--- a/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv64.cc
+++ b/deps/v8/src/compiler/backend/riscv/instruction-selector-riscv64.cc
@@ -3,6 +3,9 @@
 // found in the LICENSE file.
 
 #include "src/base/bits.h"
+#include "src/base/logging.h"
+#include "src/codegen/assembler-inl.h"
+#include "src/codegen/machine-type.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
 #include "src/compiler/backend/riscv/instruction-selector-riscv.h"
 #include "src/compiler/node-matchers.h"
@@ -12,7 +15,8 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-bool RiscvOperandGenerator::IsIntegerConstant(Node* node) {
+template <typename Adapter>
+bool RiscvOperandGeneratorT<Adapter>::IsIntegerConstant(Node* node) {
   if (node->opcode() == IrOpcode::kNumberConstant) {
     const double value = OpParameter<double>(node->op());
     return base::bit_cast<int64_t>(value) == 0;
@@ -21,7 +25,8 @@ bool RiscvOperandGenerator::IsIntegerConstant(Node* node) {
          (node->opcode() == IrOpcode::kInt64Constant);
 }
 
-int64_t RiscvOperandGenerator::GetIntegerConstantValue(Node* node) {
+template <typename Adapter>
+int64_t RiscvOperandGeneratorT<Adapter>::GetIntegerConstantValue(Node* node) {
   if (node->opcode() == IrOpcode::kInt32Constant) {
     return OpParameter<int32_t>(node->op());
   } else if (node->opcode() == IrOpcode::kInt64Constant) {
@@ -33,8 +38,9 @@ int64_t RiscvOperandGenerator::GetIntegerConstantValue(Node* node) {
   return base::bit_cast<int64_t>(value);
 }
 
-bool RiscvOperandGenerator::CanBeImmediate(int64_t value,
-                                           InstructionCode opcode) {
+template <typename Adapter>
+bool RiscvOperandGeneratorT<Adapter>::CanBeImmediate(int64_t value,
+                                                     InstructionCode opcode) {
   switch (ArchOpcodeField::decode(opcode)) {
     case kRiscvShl32:
     case kRiscvSar32:
@@ -50,7 +56,8 @@ bool RiscvOperandGenerator::CanBeImmediate(int64_t value,
     case kRiscvAdd64:
     case kRiscvOr32:
     case kRiscvOr:
-    case kRiscvTst:
+    case kRiscvTst64:
+    case kRiscvTst32:
     case kRiscvXor:
       return is_int12(value);
     case kRiscvLb:
@@ -73,8 +80,9 @@ bool RiscvOperandGenerator::CanBeImmediate(int64_t value,
   }
 }
 
+template <typename Adapter>
 struct ExtendingLoadMatcher {
-  ExtendingLoadMatcher(Node* node, InstructionSelector* selector)
+  ExtendingLoadMatcher(Node* node, InstructionSelectorT<Adapter>* selector)
       : matches_(false), selector_(selector), base_(nullptr), immediate_(0) {
     Initialize(node);
   }
@@ -96,7 +104,7 @@ struct ExtendingLoadMatcher {
 
  private:
   bool matches_;
-  InstructionSelector* selector_;
+  InstructionSelectorT<Adapter>* selector_;
   Node* base_;
   int64_t immediate_;
   ArchOpcode opcode_;
@@ -121,7 +129,7 @@ struct ExtendingLoadMatcher {
         return;
       }
 
-      RiscvOperandGenerator g(selector_);
+      RiscvOperandGeneratorT<Adapter> g(selector_);
       Node* load = m.left().node();
       Node* offset = load->InputAt(1);
       base_ = load->InputAt(0);
@@ -138,10 +146,11 @@ struct ExtendingLoadMatcher {
   }
 };
 
-bool TryEmitExtendingLoad(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+bool TryEmitExtendingLoad(InstructionSelectorT<Adapter>* selector, Node* node,
                           Node* output_node) {
-  ExtendingLoadMatcher m(node, selector);
-  RiscvOperandGenerator g(selector);
+  ExtendingLoadMatcher<Adapter> m(node, selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   if (m.Matches()) {
     InstructionOperand inputs[2];
     inputs[0] = g.UseRegister(m.base());
@@ -157,9 +166,10 @@ bool TryEmitExtendingLoad(InstructionSelector* selector, Node* node,
   return false;
 }
 
-void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
-              Node* output = nullptr) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void EmitLoad(InstructionSelectorT<Adapter>* selector, Node* node,
+              InstructionCode opcode, Node* output = nullptr) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -203,9 +213,10 @@ void EmitLoad(InstructionSelector* selector, Node* node, InstructionCode opcode,
   }
 }
 
-void EmitS128Load(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void EmitS128Load(InstructionSelectorT<Adapter>* selector, Node* node,
                   InstructionCode opcode, VSew sew, Vlmul lmul) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -225,104 +236,133 @@ void EmitS128Load(InstructionSelector* selector, Node* node,
   }
 }
 
-void InstructionSelector::VisitStoreLane(Node* node) {
-  StoreLaneParameters params = StoreLaneParametersOf(node->op());
-  LoadStoreLaneParams f(params.rep, params.laneidx);
-  InstructionCode opcode = kRiscvS128StoreLane;
-  opcode |= MiscField::encode(f.sz);
-
-  RiscvOperandGenerator g(this);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
-  InstructionOperand addr_reg = g.TempRegister();
-  Emit(kRiscvAdd64, addr_reg, g.UseRegister(base), g.UseRegister(index));
-  InstructionOperand inputs[4] = {
-      g.UseRegister(node->InputAt(2)),
-      g.UseImmediate(f.laneidx),
-      addr_reg,
-      g.TempImmediate(0),
-  };
-  opcode |= AddressingModeField::encode(kMode_MRI);
-  Emit(opcode, 0, nullptr, 4, inputs);
-}
-void InstructionSelector::VisitLoadLane(Node* node) {
-  LoadLaneParameters params = LoadLaneParametersOf(node->op());
-  LoadStoreLaneParams f(params.rep.representation(), params.laneidx);
-  InstructionCode opcode = kRiscvS128LoadLane;
-  opcode |= MiscField::encode(f.sz);
-
-  RiscvOperandGenerator g(this);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
-  InstructionOperand addr_reg = g.TempRegister();
-  Emit(kRiscvAdd64, addr_reg, g.UseRegister(base), g.UseRegister(index));
-  opcode |= AddressingModeField::encode(kMode_MRI);
-  Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(2)),
-       g.UseImmediate(params.laneidx), addr_reg, g.TempImmediate(0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StoreLaneParameters params = StoreLaneParametersOf(node->op());
+    LoadStoreLaneParams f(params.rep, params.laneidx);
+    InstructionCode opcode = kRiscvS128StoreLane;
+    opcode |= MiscField::encode(f.sz);
+
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* base = node->InputAt(0);
+    Node* index = node->InputAt(1);
+    InstructionOperand addr_reg = g.TempRegister();
+    Emit(kRiscvAdd64, addr_reg, g.UseRegister(base), g.UseRegister(index));
+    InstructionOperand inputs[4] = {
+        g.UseRegister(node->InputAt(2)),
+        g.UseImmediate(f.laneidx),
+        addr_reg,
+        g.TempImmediate(0),
+    };
+    opcode |= AddressingModeField::encode(kMode_MRI);
+    Emit(opcode, 0, nullptr, 4, inputs);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    LoadLaneParameters params = LoadLaneParametersOf(node->op());
+    LoadStoreLaneParams f(params.rep.representation(), params.laneidx);
+    InstructionCode opcode = kRiscvS128LoadLane;
+    opcode |= MiscField::encode(f.sz);
+
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* base = node->InputAt(0);
+    Node* index = node->InputAt(1);
+    InstructionOperand addr_reg = g.TempRegister();
+    Emit(kRiscvAdd64, addr_reg, g.UseRegister(base), g.UseRegister(index));
+    opcode |= AddressingModeField::encode(kMode_MRI);
+    Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(2)),
+         g.UseImmediate(params.laneidx), addr_reg, g.TempImmediate(0));
+  }
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    LoadRepresentation load_rep = LoadRepresentationOf(node->op());
 
-  InstructionCode opcode = kArchNop;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kFloat32:
-      opcode = kRiscvLoadFloat;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kRiscvLoadDouble;
-      break;
-    case MachineRepresentation::kBit:  // Fall through.
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsUnsigned() ? kRiscvLhu : kRiscvLh;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kRiscvLw;
-      break;
+    InstructionCode opcode = kArchNop;
+    switch (load_rep.representation()) {
+      case MachineRepresentation::kFloat32:
+        opcode = kRiscvLoadFloat;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kRiscvLoadDouble;
+        break;
+      case MachineRepresentation::kBit:  // Fall through.
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsUnsigned() ? kRiscvLhu : kRiscvLh;
+        break;
+      case MachineRepresentation::kWord32:
+        opcode = load_rep.IsUnsigned() ? kRiscvLwu : kRiscvLw;
+        break;
 #ifdef V8_COMPRESS_POINTERS
-    case MachineRepresentation::kTaggedSigned:
-      opcode = kRiscvLoadDecompressTaggedSigned;
-      break;
-    case MachineRepresentation::kTaggedPointer:
-      opcode = kRiscvLoadDecompressTagged;
-      break;
-    case MachineRepresentation::kTagged:
-      opcode = kRiscvLoadDecompressTagged;
-      break;
+      case MachineRepresentation::kTaggedSigned:
+        opcode = kRiscvLoadDecompressTaggedSigned;
+        break;
+      case MachineRepresentation::kTaggedPointer:
+        opcode = kRiscvLoadDecompressTagged;
+        break;
+      case MachineRepresentation::kTagged:
+        opcode = kRiscvLoadDecompressTagged;
+        break;
 #else
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:         // Fall through.
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:         // Fall through.
 #endif
-    case MachineRepresentation::kWord64:
-      opcode = kRiscvLd;
-      break;
-    case MachineRepresentation::kSimd128:
-      opcode = kRiscvRvvLd;
-      break;
-    case MachineRepresentation::kCompressedPointer:
-    case MachineRepresentation::kCompressed:
+      case MachineRepresentation::kWord64:
+        opcode = kRiscvLd;
+        break;
+      case MachineRepresentation::kSimd128:
+        opcode = kRiscvRvvLd;
+        break;
+      case MachineRepresentation::kCompressedPointer:
+      case MachineRepresentation::kCompressed:
 #ifdef V8_COMPRESS_POINTERS
-      opcode = kRiscvLw;
-      break;
+        opcode = kRiscvLw;
+        break;
 #else
-                                                 // Fall through.
 #endif
-    case MachineRepresentation::kSimd256:           // Fall through.
-    case MachineRepresentation::kSandboxedPointer:  // Fall through.
-    case MachineRepresentation::kMapWord:           // Fall through.
-    case MachineRepresentation::kNone:
-      UNREACHABLE();
+      case MachineRepresentation::kSandboxedPointer:
+        opcode = kRiscvLoadDecodeSandboxedPointer;
+        break;
+      case MachineRepresentation::kSimd256:  // Fall through.
+      case MachineRepresentation::kMapWord:  // Fall through.
+      case MachineRepresentation::kIndirectPointer:  // Fall through.
+      case MachineRepresentation::kNone:
+        UNREACHABLE();
+    }
+
+    EmitLoad(this, node, opcode);
   }
+}
 
-  EmitLoad(this, node, opcode);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
+
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitStore(turboshaft::OpIndex) {
+  UNREACHABLE();
 }
 
-void InstructionSelector::VisitStore(Node* node) {
-  RiscvOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitStore(Node* node) {
+  RiscvOperandGeneratorT<TurbofanAdapter> g(this);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -387,9 +427,12 @@ void InstructionSelector::VisitStore(Node* node) {
 #else
         UNREACHABLE();
 #endif
-      case MachineRepresentation::kSimd256:           // Fall through.
-      case MachineRepresentation::kSandboxedPointer:  // Fall through.
-      case MachineRepresentation::kMapWord:           // Fall through.
+      case MachineRepresentation::kSandboxedPointer:
+        opcode = kRiscvStoreEncodeSandboxedPointer;
+        break;
+      case MachineRepresentation::kSimd256:  // Fall through.
+      case MachineRepresentation::kMapWord:  // Fall through.
+      case MachineRepresentation::kIndirectPointer:  // Fall through.
       case MachineRepresentation::kNone:
         UNREACHABLE();
     }
@@ -415,230 +458,377 @@ void InstructionSelector::VisitStore(Node* node) {
   }
 }
 
-void InstructionSelector::VisitWord32And(Node* node) {
-  VisitBinop(this, node, kRiscvAnd32, true, kRiscvAnd32);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32And(
+    turboshaft::OpIndex) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitWord64And(Node* node) {
-  RiscvOperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if (m.left().IsWord64Shr() && CanCover(node, m.left().node()) &&
-      m.right().HasResolvedValue()) {
-    uint64_t mask = m.right().ResolvedValue();
-    uint32_t mask_width = base::bits::CountPopulation(mask);
-    uint32_t mask_msb = base::bits::CountLeadingZeros64(mask);
-    if ((mask_width != 0) && (mask_msb + mask_width == 64)) {
-      // The mask must be contiguous, and occupy the least-significant bits.
-      DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask));
-
-      // Select Dext for And(Shr(x, imm), mask) where the mask is in the least
-      // significant bits.
-      Int64BinopMatcher mleft(m.left().node());
-      if (mleft.right().HasResolvedValue()) {
-        // Any shift value can match; int64 shifts use `value % 64`.
-        uint32_t lsb =
-            static_cast<uint32_t>(mleft.right().ResolvedValue() & 0x3F);
-
-        // Dext cannot extract bits past the register size, however since
-        // shifting the original value would have introduced some zeros we can
-        // still use Dext with a smaller mask and the remaining bits will be
-        // zeros.
-        if (lsb + mask_width > 64) mask_width = 64 - lsb;
-
-        if (lsb == 0 && mask_width == 64) {
-          Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(mleft.left().node()));
-          return;
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32And(Node* node) {
+  VisitBinop<TurbofanAdapter, Int32BinopMatcher>(this, node, kRiscvAnd32, true,
+                                                 kRiscvAnd32);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64And(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if (m.left().IsWord64Shr() && CanCover(node, m.left().node()) &&
+        m.right().HasResolvedValue()) {
+      uint64_t mask = m.right().ResolvedValue();
+      uint32_t mask_width = base::bits::CountPopulation(mask);
+      uint32_t mask_msb = base::bits::CountLeadingZeros64(mask);
+      if ((mask_width != 0) && (mask_msb + mask_width == 64)) {
+        // The mask must be contiguous, and occupy the least-significant bits.
+        DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask));
+
+        // Select Dext for And(Shr(x, imm), mask) where the mask is in the least
+        // significant bits.
+        Int64BinopMatcher mleft(m.left().node());
+        if (mleft.right().HasResolvedValue()) {
+          // Any shift value can match; int64 shifts use `value % 64`.
+          uint32_t lsb =
+              static_cast<uint32_t>(mleft.right().ResolvedValue() & 0x3F);
+
+          // Dext cannot extract bits past the register size, however since
+          // shifting the original value would have introduced some zeros we can
+          // still use Dext with a smaller mask and the remaining bits will be
+          // zeros.
+          if (lsb + mask_width > 64) mask_width = 64 - lsb;
+
+          if (lsb == 0 && mask_width == 64) {
+            Emit(kArchNop, g.DefineSameAsFirst(node),
+                 g.Use(mleft.left().node()));
+            return;
+          }
         }
+        // Other cases fall through to the normal And operation.
       }
-      // Other cases fall through to the normal And operation.
     }
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvAnd, true,
+                                           kRiscvAnd);
   }
-  VisitBinop(this, node, kRiscvAnd, true, kRiscvAnd);
 }
 
-void InstructionSelector::VisitWord32Or(Node* node) {
-  VisitBinop(this, node, kRiscvOr32, true, kRiscvOr32);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvOr32, true,
+                                           kRiscvOr32);
+  }
 }
 
-void InstructionSelector::VisitWord64Or(Node* node) {
-  VisitBinop(this, node, kRiscvOr, true, kRiscvOr);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Or(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvOr, true,
+                                           kRiscvOr);
+  }
 }
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  Int32BinopMatcher m(node);
-  if (m.left().IsWord32Or() && CanCover(node, m.left().node()) &&
-      m.right().Is(-1)) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (!mleft.right().HasResolvedValue()) {
-      RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int32BinopMatcher m(node);
+    if (m.left().IsWord32Or() && CanCover(node, m.left().node()) &&
+        m.right().Is(-1)) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (!mleft.right().HasResolvedValue()) {
+        RiscvOperandGeneratorT<Adapter> g(this);
+        Emit(kRiscvNor32, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()),
+             g.UseRegister(mleft.right().node()));
+        return;
+      }
+    }
+    if (m.right().Is(-1)) {
+      // Use Nor for bit negation and eliminate constant loading for xori.
+      RiscvOperandGeneratorT<Adapter> g(this);
       Emit(kRiscvNor32, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()),
-           g.UseRegister(mleft.right().node()));
+           g.UseRegister(m.left().node()), g.TempImmediate(0));
       return;
     }
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvXor32, true,
+                                           kRiscvXor32);
   }
-  if (m.right().Is(-1)) {
-    // Use Nor for bit negation and eliminate constant loading for xori.
-    RiscvOperandGenerator g(this);
-    Emit(kRiscvNor32, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-         g.TempImmediate(0));
-    return;
-  }
-  VisitBinop(this, node, kRiscvXor32, true, kRiscvXor32);
 }
 
-void InstructionSelector::VisitWord64Xor(Node* node) {
-  Int64BinopMatcher m(node);
-  if (m.left().IsWord64Or() && CanCover(node, m.left().node()) &&
-      m.right().Is(-1)) {
-    Int64BinopMatcher mleft(m.left().node());
-    if (!mleft.right().HasResolvedValue()) {
-      RiscvOperandGenerator g(this);
-      Emit(kRiscvNor, g.DefineAsRegister(node),
-           g.UseRegister(mleft.left().node()),
-           g.UseRegister(mleft.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Xor(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Int64BinopMatcher m(node);
+    if (m.left().IsWord64Or() && CanCover(node, m.left().node()) &&
+        m.right().Is(-1)) {
+      Int64BinopMatcher mleft(m.left().node());
+      if (!mleft.right().HasResolvedValue()) {
+        RiscvOperandGeneratorT<Adapter> g(this);
+        Emit(kRiscvNor, g.DefineAsRegister(node),
+             g.UseRegister(mleft.left().node()),
+             g.UseRegister(mleft.right().node()));
+        return;
+      }
+    }
+    if (m.right().Is(-1)) {
+      // Use Nor for bit negation and eliminate constant loading for xori.
+      RiscvOperandGeneratorT<Adapter> g(this);
+      Emit(kRiscvNor, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
+           g.TempImmediate(0));
       return;
     }
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvXor, true,
+                                           kRiscvXor);
   }
-  if (m.right().Is(-1)) {
-    // Use Nor for bit negation and eliminate constant loading for xori.
-    RiscvOperandGenerator g(this);
-    Emit(kRiscvNor, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
-         g.TempImmediate(0));
-    return;
-  }
-  VisitBinop(this, node, kRiscvXor, true, kRiscvXor);
 }
 
-void InstructionSelector::VisitWord64Shl(Node* node) {
-  RiscvOperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if ((m.left().IsChangeInt32ToInt64() || m.left().IsChangeUint32ToUint64()) &&
-      m.right().IsInRange(32, 63) && CanCover(node, m.left().node())) {
-    // There's no need to sign/zero-extend to 64-bit if we shift out the upper
-    // 32 bits anyway.
-    Emit(kRiscvShl64, g.DefineSameAsFirst(node),
-         g.UseRegister(m.left().node()->InputAt(0)),
-         g.UseImmediate(m.right().node()));
-    return;
-  }
-  if (m.left().IsWord64And() && CanCover(node, m.left().node()) &&
-      m.right().IsInRange(1, 63)) {
-    // Match Word64Shl(Word64And(x, mask), imm) to Dshl where the mask is
-    // contiguous, and the shift immediate non-zero.
-    Int64BinopMatcher mleft(m.left().node());
-    if (mleft.right().HasResolvedValue()) {
-      uint64_t mask = mleft.right().ResolvedValue();
-      uint32_t mask_width = base::bits::CountPopulation(mask);
-      uint32_t mask_msb = base::bits::CountLeadingZeros64(mask);
-      if ((mask_width != 0) && (mask_msb + mask_width == 64)) {
-        uint64_t shift = m.right().ResolvedValue();
-        DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask));
-        DCHECK_NE(0u, shift);
-
-        if ((shift + mask_width) >= 64) {
-          // If the mask is contiguous and reaches or extends beyond the top
-          // bit, only the shift is needed.
-          Emit(kRiscvShl64, g.DefineAsRegister(node),
-               g.UseRegister(mleft.left().node()),
-               g.UseImmediate(m.right().node()));
-          return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if ((m.left().IsChangeInt32ToInt64() ||
+         m.left().IsChangeUint32ToUint64()) &&
+        m.right().IsInRange(32, 63) && CanCover(node, m.left().node())) {
+      // There's no need to sign/zero-extend to 64-bit if we shift out the upper
+      // 32 bits anyway.
+      Emit(kRiscvShl64, g.DefineSameAsFirst(node),
+           g.UseRegister(m.left().node()->InputAt(0)),
+           g.UseImmediate(m.right().node()));
+      return;
+    }
+    if (m.left().IsWord64And() && CanCover(node, m.left().node()) &&
+        m.right().IsInRange(1, 63)) {
+      // Match Word64Shl(Word64And(x, mask), imm) to Dshl where the mask is
+      // contiguous, and the shift immediate non-zero.
+      Int64BinopMatcher mleft(m.left().node());
+      if (mleft.right().HasResolvedValue()) {
+        uint64_t mask = mleft.right().ResolvedValue();
+        uint32_t mask_width = base::bits::CountPopulation(mask);
+        uint32_t mask_msb = base::bits::CountLeadingZeros64(mask);
+        if ((mask_width != 0) && (mask_msb + mask_width == 64)) {
+          uint64_t shift = m.right().ResolvedValue();
+          DCHECK_EQ(0u, base::bits::CountTrailingZeros64(mask));
+          DCHECK_NE(0u, shift);
+
+          if ((shift + mask_width) >= 64) {
+            // If the mask is contiguous and reaches or extends beyond the top
+            // bit, only the shift is needed.
+            Emit(kRiscvShl64, g.DefineAsRegister(node),
+                 g.UseRegister(mleft.left().node()),
+                 g.UseImmediate(m.right().node()));
+            return;
+          }
         }
       }
     }
+    VisitRRO(this, kRiscvShl64, node);
   }
-  VisitRRO(this, kRiscvShl64, node);
 }
 
-void InstructionSelector::VisitWord64Shr(Node* node) {
-  VisitRRO(this, kRiscvShr64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRO(this, kRiscvShr64, node);
+  }
 }
 
-void InstructionSelector::VisitWord64Sar(Node* node) {
-  if (TryEmitExtendingLoad(this, node, node)) return;
-  VisitRRO(this, kRiscvSar64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Sar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (TryEmitExtendingLoad(this, node, node)) return;
+    Int64BinopMatcher m(node);
+    if (m.left().IsChangeInt32ToInt64() && m.right().HasResolvedValue() &&
+        is_uint5(m.right().ResolvedValue()) &&
+        CanCover(node, m.left().node())) {
+      if ((m.left().InputAt(0)->opcode() != IrOpcode::kLoad &&
+           m.left().InputAt(0)->opcode() != IrOpcode::kLoadImmutable) ||
+          !CanCover(m.left().node(), m.left().InputAt(0))) {
+        RiscvOperandGeneratorT<Adapter> g(this);
+        Emit(kRiscvSar32, g.DefineAsRegister(node),
+             g.UseRegister(m.left().node()->InputAt(0)),
+             g.UseImmediate(m.right().node()));
+        return;
+      }
+    }
+    VisitRRO(this, kRiscvSar64, node);
+  }
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) { UNREACHABLE(); }
-
-void InstructionSelector::VisitWord64Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    UNREACHABLE();
+  }
+}
 
-void InstructionSelector::VisitWord32Ror(Node* node) {
-  VisitRRO(this, kRiscvRor32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Rol(node_t node) {
+  UNREACHABLE();
 }
 
-void InstructionSelector::VisitWord32Clz(Node* node) {
-  VisitRR(this, kRiscvClz32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRO(this, kRiscvRor32, node);
+  }
 }
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvByteSwap64, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvByteSwap64, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvByteSwap32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvByteSwap32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitWord32Ctz(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvCtz32, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ctz(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvCtz64, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Popcnt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvPopcnt32, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitWord64Ctz(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvCtz64, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Popcnt(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvPopcnt64, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitWord32Popcnt(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvPopcnt32, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ror(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRO(this, kRiscvRor64, node);
+  }
 }
 
-void InstructionSelector::VisitWord64Popcnt(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvPopcnt64, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Clz(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvClz64, node);
+  }
 }
 
-void InstructionSelector::VisitWord64Ror(Node* node) {
-  VisitRRO(this, kRiscvRor64, node);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Add(node_t node) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitWord64Clz(Node* node) {
-  VisitRR(this, kRiscvClz64, node);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Add(Node* node) {
+  VisitBinop<TurbofanAdapter, Int32BinopMatcher>(this, node, kRiscvAdd32, true,
+                                         kRiscvAdd32);
 }
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  VisitBinop(this, node, kRiscvAdd32, true, kRiscvAdd32);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Add(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvAdd64, true,
+                                           kRiscvAdd64);
+  }
 }
 
-void InstructionSelector::VisitInt64Add(Node* node) {
-  VisitBinop(this, node, kRiscvAdd64, true, kRiscvAdd64);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvSub32);
+  }
 }
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  VisitBinop(this, node, kRiscvSub32);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Sub(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvSub64);
+  }
 }
 
-void InstructionSelector::VisitInt64Sub(Node* node) {
-  VisitBinop(this, node, kRiscvSub64);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Mul(node_t node) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
-  RiscvOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Mul(Node* node) {
+  RiscvOperandGeneratorT<TurbofanAdapter> g(this);
   Int32BinopMatcher m(node);
   if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
     uint32_t value = static_cast<uint32_t>(m.right().ResolvedValue());
@@ -676,24 +866,50 @@ void InstructionSelector::VisitInt32Mul(Node* node) {
   VisitRRR(this, kRiscvMul32, node);
 }
 
-void InstructionSelector::VisitInt32MulHigh(Node* node) {
-  VisitRRR(this, kRiscvMulHigh32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvMulHigh32, node);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    return VisitRRR(this, kRiscvMulHigh64, node);
+  }
 }
 
-void InstructionSelector::VisitInt64MulHigh(Node* node) {
-  VisitRRR(this, kRiscvMulHigh64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvMulHighU32, node);
+  }
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
-  VisitRRR(this, kRiscvMulHighU32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64MulHigh(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRRR(this, kRiscvMulHighU64, node);
+  }
 }
 
-void InstructionSelector::VisitUint64MulHigh(Node* node) {
-  VisitRRR(this, kRiscvMulHighU64, node);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt64Mul(node_t node) {
+  UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitInt64Mul(Node* node) {
-  RiscvOperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt64Mul(Node* node) {
+  RiscvOperandGeneratorT<TurbofanAdapter> g(this);
   Int64BinopMatcher m(node);
   // TODO(dusmil): Add optimization for shifts larger than 32.
   if (m.right().HasResolvedValue() && m.right().ResolvedValue() > 0) {
@@ -718,8 +934,12 @@ void InstructionSelector::VisitInt64Mul(Node* node) {
        g.UseRegister(m.right().node()));
 }
 
-void InstructionSelector::VisitInt32Div(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int32BinopMatcher m(node);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
@@ -738,17 +958,27 @@ void InstructionSelector::VisitInt32Div(Node* node) {
   }
   Emit(kRiscvDiv32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitUint32Div(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int32BinopMatcher m(node);
   Emit(kRiscvDivU32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitInt32Mod(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int32BinopMatcher m(node);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
@@ -767,167 +997,246 @@ void InstructionSelector::VisitInt32Mod(Node* node) {
   }
   Emit(kRiscvMod32, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitUint32Mod(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int32BinopMatcher m(node);
   Emit(kRiscvModU32, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitInt64Div(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int64BinopMatcher m(node);
   Emit(kRiscvDiv64, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitUint64Div(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Div(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int64BinopMatcher m(node);
   Emit(kRiscvDivU64, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitInt64Mod(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int64BinopMatcher m(node);
   Emit(kRiscvMod64, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitUint64Mod(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Int64BinopMatcher m(node);
   Emit(kRiscvModU64, g.DefineAsRegister(node), g.UseRegister(m.left().node()),
        g.UseRegister(m.right().node()));
+  }
 }
 
-void InstructionSelector::VisitChangeFloat32ToFloat64(Node* node) {
-  VisitRR(this, kRiscvCvtDS, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat32ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtDS, node);
+  }
 }
 
-void InstructionSelector::VisitRoundInt32ToFloat32(Node* node) {
-  VisitRR(this, kRiscvCvtSW, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtSW, node);
+  }
 }
 
-void InstructionSelector::VisitRoundUint32ToFloat32(Node* node) {
-  VisitRR(this, kRiscvCvtSUw, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtSUw, node);
+  }
 }
 
-void InstructionSelector::VisitChangeInt32ToFloat64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToFloat64(node_t node) {
   VisitRR(this, kRiscvCvtDW, node);
 }
 
-void InstructionSelector::VisitChangeInt64ToFloat64(Node* node) {
-  VisitRR(this, kRiscvCvtDL, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt64ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtDL, node);
+  }
 }
 
-void InstructionSelector::VisitChangeUint32ToFloat64(Node* node) {
-  VisitRR(this, kRiscvCvtDUw, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtDUw, node);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) {
-  RiscvOperandGenerator g(this);
-  InstructionCode opcode = kRiscvTruncWS;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kRiscvTruncWS;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) {
-  RiscvOperandGenerator g(this);
-  InstructionCode opcode = kRiscvTruncUwS;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kRiscvTruncUwS;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt32(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  // Match ChangeFloat64ToInt32(Float64Round##OP) to corresponding instruction
-  // which does rounding and conversion to integer format.
-  if (CanCover(node, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kFloat64RoundDown:
-        Emit(kRiscvFloorWD, g.DefineAsRegister(node),
-             g.UseRegister(value->InputAt(0)));
-        return;
-      case IrOpcode::kFloat64RoundUp:
-        Emit(kRiscvCeilWD, g.DefineAsRegister(node),
-             g.UseRegister(value->InputAt(0)));
-        return;
-      case IrOpcode::kFloat64RoundTiesEven:
-        Emit(kRiscvRoundWD, g.DefineAsRegister(node),
-             g.UseRegister(value->InputAt(0)));
-        return;
-      case IrOpcode::kFloat64RoundTruncate:
-        Emit(kRiscvTruncWD, g.DefineAsRegister(node),
-             g.UseRegister(value->InputAt(0)));
-        return;
-      default:
-        break;
-    }
-    if (value->opcode() == IrOpcode::kChangeFloat32ToFloat64) {
-      Node* next = value->InputAt(0);
-      if (CanCover(value, next)) {
-        // Match ChangeFloat64ToInt32(ChangeFloat32ToFloat64(Float64Round##OP))
-        switch (next->opcode()) {
-          case IrOpcode::kFloat32RoundDown:
-            Emit(kRiscvFloorWS, g.DefineAsRegister(node),
-                 g.UseRegister(next->InputAt(0)));
-            return;
-          case IrOpcode::kFloat32RoundUp:
-            Emit(kRiscvCeilWS, g.DefineAsRegister(node),
-                 g.UseRegister(next->InputAt(0)));
-            return;
-          case IrOpcode::kFloat32RoundTiesEven:
-            Emit(kRiscvRoundWS, g.DefineAsRegister(node),
-                 g.UseRegister(next->InputAt(0)));
-            return;
-          case IrOpcode::kFloat32RoundTruncate:
-            Emit(kRiscvTruncWS, g.DefineAsRegister(node),
-                 g.UseRegister(next->InputAt(0)));
-            return;
-          default:
-            Emit(kRiscvTruncWS, g.DefineAsRegister(node),
-                 g.UseRegister(value->InputAt(0)));
-            return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    // Match ChangeFloat64ToInt32(Float64Round##OP) to corresponding instruction
+    // which does rounding and conversion to integer format.
+    if (CanCover(node, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kFloat64RoundDown:
+          Emit(kRiscvFloorWD, g.DefineAsRegister(node),
+               g.UseRegister(value->InputAt(0)));
+          return;
+        case IrOpcode::kFloat64RoundUp:
+          Emit(kRiscvCeilWD, g.DefineAsRegister(node),
+               g.UseRegister(value->InputAt(0)));
+          return;
+        case IrOpcode::kFloat64RoundTiesEven:
+          Emit(kRiscvRoundWD, g.DefineAsRegister(node),
+               g.UseRegister(value->InputAt(0)));
+          return;
+        case IrOpcode::kFloat64RoundTruncate:
+          Emit(kRiscvTruncWD, g.DefineAsRegister(node),
+               g.UseRegister(value->InputAt(0)));
+          return;
+        default:
+          break;
+      }
+      if (value->opcode() == IrOpcode::kChangeFloat32ToFloat64) {
+        Node* next = value->InputAt(0);
+        if (CanCover(value, next)) {
+          // Match
+          // ChangeFloat64ToInt32(ChangeFloat32ToFloat64(Float64Round##OP))
+          switch (next->opcode()) {
+            case IrOpcode::kFloat32RoundDown:
+              Emit(kRiscvFloorWS, g.DefineAsRegister(node),
+                   g.UseRegister(next->InputAt(0)));
+              return;
+            case IrOpcode::kFloat32RoundUp:
+              Emit(kRiscvCeilWS, g.DefineAsRegister(node),
+                   g.UseRegister(next->InputAt(0)));
+              return;
+            case IrOpcode::kFloat32RoundTiesEven:
+              Emit(kRiscvRoundWS, g.DefineAsRegister(node),
+                   g.UseRegister(next->InputAt(0)));
+              return;
+            case IrOpcode::kFloat32RoundTruncate:
+              Emit(kRiscvTruncWS, g.DefineAsRegister(node),
+                   g.UseRegister(next->InputAt(0)));
+              return;
+            default:
+              Emit(kRiscvTruncWS, g.DefineAsRegister(node),
+                   g.UseRegister(value->InputAt(0)));
+              return;
+          }
+        } else {
+          // Match float32 -> float64 -> int32 representation change path.
+          Emit(kRiscvTruncWS, g.DefineAsRegister(node),
+               g.UseRegister(value->InputAt(0)));
+          return;
         }
-      } else {
-        // Match float32 -> float64 -> int32 representation change path.
-        Emit(kRiscvTruncWS, g.DefineAsRegister(node),
-             g.UseRegister(value->InputAt(0)));
-        return;
       }
     }
+    VisitRR(this, kRiscvTruncWD, node);
   }
-  VisitRR(this, kRiscvTruncWD, node);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
-  RiscvOperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
-  InstructionOperand outputs[2];
-  size_t output_count = 0;
-  outputs[output_count++] = g.DefineAsRegister(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt32(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+    InstructionOperand outputs[2];
+    size_t output_count = 0;
+    outputs[output_count++] = g.DefineAsRegister(node);
+
+    Node* success_output = NodeProperties::FindProjection(node, 1);
+    if (success_output) {
+      outputs[output_count++] = g.DefineAsRegister(success_output);
+    }
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
-    outputs[output_count++] = g.DefineAsRegister(success_output);
+    this->Emit(kRiscvTruncWD, output_count, outputs, 1, inputs);
   }
-
-  this->Emit(kRiscvTruncWD, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint32(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
@@ -939,36 +1248,63 @@ void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
   }
 
   Emit(kRiscvTruncUwD, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitChangeFloat64ToInt64(Node* node) {
-  VisitRR(this, kRiscvTruncLD, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvTruncLD, node);
+  }
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint32(Node* node) {
-  VisitRR(this, kRiscvTruncUwD, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvTruncUwD, node);
+  }
 }
 
-void InstructionSelector::VisitChangeFloat64ToUint64(Node* node) {
-  VisitRR(this, kRiscvTruncUlD, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeFloat64ToUint64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvTruncUlD, node);
+  }
 }
 
-void InstructionSelector::VisitTruncateFloat64ToUint32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToUint32(node_t node) {
   VisitRR(this, kRiscvTruncUwD, node);
 }
 
-void InstructionSelector::VisitTruncateFloat64ToInt64(Node* node) {
-  RiscvOperandGenerator g(this);
-  InstructionCode opcode = kRiscvTruncLD;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    InstructionCode opcode = kRiscvTruncLD;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
@@ -980,10 +1316,16 @@ void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
   }
 
   this->Emit(kRiscvTruncLS, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
@@ -995,10 +1337,16 @@ void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
   }
 
   Emit(kRiscvTruncLD, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
@@ -1010,10 +1358,16 @@ void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
   }
 
   Emit(kRiscvTruncUlS, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
 
   InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
   InstructionOperand outputs[2];
@@ -1026,398 +1380,504 @@ void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
   }
 
   Emit(kRiscvTruncUlD, output_count, outputs, 1, inputs);
+  }
 }
 
-void InstructionSelector::VisitBitcastWord32ToWord64(Node* node) {
-  DCHECK(SmiValuesAre31Bits());
-  DCHECK(COMPRESS_POINTERS_BOOL);
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvZeroExtendWord, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32ToWord64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    DCHECK(SmiValuesAre31Bits());
+    DCHECK(COMPRESS_POINTERS_BOOL);
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvZeroExtendWord, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void EmitSignExtendWord(InstructionSelector* selector, Node* node) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void EmitSignExtendWord(InstructionSelectorT<Adapter>* selector, Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* value = node->InputAt(0);
-  IrOpcode::Value lastOpCode = value->opcode();
-  if (lastOpCode == IrOpcode::kInt32Add || lastOpCode == IrOpcode::kInt32Sub ||
-      lastOpCode == IrOpcode::kWord32And || lastOpCode == IrOpcode::kWord32Or ||
-      lastOpCode == IrOpcode::kWord32Xor ||
-      lastOpCode == IrOpcode::kWord32Shl ||
-      lastOpCode == IrOpcode::kWord32Shr ||
-      lastOpCode == IrOpcode::kWord32Sar ||
-      lastOpCode == IrOpcode::kUint32Mod) {
-    selector->Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(value));
-    return;
-  }
-  if (lastOpCode == IrOpcode::kInt32Mul) {
-    Node* left = value->InputAt(0);
-    Node* right = value->InputAt(1);
-    if (selector->CanCover(value, left) && selector->CanCover(value, right)) {
-      if (left->opcode() == IrOpcode::kWord64Sar &&
-          right->opcode() == IrOpcode::kWord64Sar) {
-        Int64BinopMatcher leftInput(left), rightInput(right);
-        if (leftInput.right().Is(32) && rightInput.right().Is(32)) {
-          selector->Emit(kRiscvSignExtendWord, g.DefineAsRegister(node),
-                         g.UseRegister(value));
-          return;
-        }
-      }
-    }
-    selector->Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(value));
-    return;
-  }
-  if (lastOpCode == IrOpcode::kInt32Mod) {
-    Node* left = value->InputAt(0);
-    Node* right = value->InputAt(1);
-    if (selector->CanCover(value, left) && selector->CanCover(value, right)) {
-      if (left->opcode() == IrOpcode::kWord64Sar &&
-          right->opcode() == IrOpcode::kWord64Sar) {
-        Int64BinopMatcher rightInput(right), leftInput(left);
-        if (rightInput.right().Is(32) && leftInput.right().Is(32)) {
-          // Combine both shifted operands with Dmod.
-          selector->Emit(kRiscvSignExtendWord, g.DefineAsRegister(node),
-                         g.UseRegister(value));
-          return;
-        }
-      }
-    }
-    selector->Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(value));
-    return;
-  }
   selector->Emit(kRiscvSignExtendWord, g.DefineAsRegister(node),
                  g.UseRegister(value));
 }
 
-void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
-  Node* value = node->InputAt(0);
-  if ((value->opcode() == IrOpcode::kLoad ||
-       value->opcode() == IrOpcode::kLoadImmutable) &&
-      CanCover(node, value)) {
-    // Generate sign-extending load.
-    LoadRepresentation load_rep = LoadRepresentationOf(value->op());
-    InstructionCode opcode = kArchNop;
-    switch (load_rep.representation()) {
-      case MachineRepresentation::kBit:  // Fall through.
-      case MachineRepresentation::kWord8:
-        opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
-        break;
-      case MachineRepresentation::kWord16:
-        opcode = load_rep.IsUnsigned() ? kRiscvLhu : kRiscvLh;
-        break;
-      case MachineRepresentation::kWord32:
-        opcode = kRiscvLw;
-        break;
-      default:
-        UNREACHABLE();
-    }
-    EmitLoad(this, value, opcode, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    EmitSignExtendWord(this, node);
-  }
-}
-
-bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
-  DCHECK_NE(node->opcode(), IrOpcode::kPhi);
-  if (node->opcode() == IrOpcode::kLoad ||
-      node->opcode() == IrOpcode::kLoadImmutable) {
-    LoadRepresentation load_rep = LoadRepresentationOf(node->op());
-    if (load_rep.IsUnsigned()) {
+    Node* value = node->InputAt(0);
+    if ((value->opcode() == IrOpcode::kLoad ||
+         value->opcode() == IrOpcode::kLoadImmutable) &&
+        CanCover(node, value)) {
+      // Generate sign-extending load.
+      LoadRepresentation load_rep = LoadRepresentationOf(value->op());
+      InstructionCode opcode = kArchNop;
       switch (load_rep.representation()) {
+        case MachineRepresentation::kBit:  // Fall through.
         case MachineRepresentation::kWord8:
+          opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
+          break;
         case MachineRepresentation::kWord16:
-          return true;
+          opcode = load_rep.IsUnsigned() ? kRiscvLhu : kRiscvLh;
+          break;
+        case MachineRepresentation::kWord32:
+        case MachineRepresentation::kWord64:
+          // Since BitcastElider may remove nodes of
+          // IrOpcode::kTruncateInt64ToInt32 and directly use the inputs, values
+          // with kWord64 can also reach this line.
+          // For RV64, the lw loads a 32 bit value from memory and sign-extend
+          // it to 64 bits before storing it in rd register
+        case MachineRepresentation::kTaggedSigned:
+        case MachineRepresentation::kTagged:
+          opcode = kRiscvLw;
+          break;
         default:
-          return false;
+          UNREACHABLE();
       }
+      EmitLoad(this, value, opcode, node);
+    } else {
+      EmitSignExtendWord(this, node);
+      return;
     }
   }
+}
 
-  // All other 32-bit operations sign-extend to the upper 32 bits
-  return false;
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::ZeroExtendsWord32ToWord64NoPhis(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    DCHECK_NE(node->opcode(), IrOpcode::kPhi);
+    if (node->opcode() == IrOpcode::kLoad ||
+        node->opcode() == IrOpcode::kLoadImmutable) {
+      LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+      if (load_rep.IsUnsigned()) {
+        switch (load_rep.representation()) {
+          case MachineRepresentation::kWord8:
+          case MachineRepresentation::kWord16:
+            return true;
+          default:
+            return false;
+        }
+      }
+    }
+
+    // All other 32-bit operations sign-extend to the upper 32 bits
+    return false;
+  }
 }
 
-void InstructionSelector::VisitChangeUint32ToUint64(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  if (ZeroExtendsWord32ToWord64(value)) {
-    Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(value));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToUint64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    if (ZeroExtendsWord32ToWord64(value)) {
+      Emit(kArchNop, g.DefineSameAsFirst(node), g.Use(value));
+      return;
+    }
+    Emit(kRiscvZeroExtendWord, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
   }
-  Emit(kRiscvZeroExtendWord, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  if (CanCover(node, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord64Sar: {
-        if (CanCover(value, value->InputAt(0)) &&
-            TryEmitExtendingLoad(this, value, node)) {
-          return;
-        } else {
-          Int64BinopMatcher m(value);
-          if (m.right().IsInRange(32, 63)) {
-            // After smi untagging no need for truncate. Combine sequence.
-            Emit(kRiscvSar64, g.DefineSameAsFirst(node),
-                 g.UseRegister(m.left().node()),
-                 g.UseImmediate(m.right().node()));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateInt64ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* value = node->InputAt(0);
+    if (CanCover(node, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord64Sar: {
+          if (CanCover(value, value->InputAt(0)) &&
+              TryEmitExtendingLoad(this, value, node)) {
             return;
+          } else {
+            Int64BinopMatcher m(value);
+            if (m.right().IsInRange(32, 63)) {
+              // After smi untagging no need for truncate. Combine sequence.
+              Emit(kRiscvSar64, g.DefineSameAsFirst(node),
+                   g.UseRegister(m.left().node()),
+                   g.UseImmediate(m.right().node()));
+              return;
+            }
           }
+          break;
         }
-        break;
+        default:
+          break;
       }
-      default:
-        break;
     }
+    // Semantics of this machine IR is not clear. For example, x86 zero-extend
+    // the truncated value; arm treats it as nop thus the upper 32-bit as
+    // undefined; Riscv emits ext instruction which zero-extend the 32-bit
+    // value; for riscv, we do sign-extension of the truncated value
+    Emit(kRiscvSignExtendWord, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)), g.TempImmediate(0));
   }
-
-  // Semantics of this machine IR is not clear. For example, x86 zero-extend the
-  // truncated value; arm treats it as nop thus the upper 32-bit as undefined;
-  // Riscv emits ext instruction which zero-extend the 32-bit value; for riscv,
-  // we do sign-extension of the truncated value
-  EmitSignExtendWord(this, node);
 }
 
-void InstructionSelector::VisitRoundInt64ToFloat32(Node* node) {
-  VisitRR(this, kRiscvCvtSL, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt64ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtSL, node);
+  }
 }
 
-void InstructionSelector::VisitRoundInt64ToFloat64(Node* node) {
-  VisitRR(this, kRiscvCvtDL, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundInt64ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtDL, node);
+  }
 }
 
-void InstructionSelector::VisitRoundUint64ToFloat32(Node* node) {
-  VisitRR(this, kRiscvCvtSUl, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint64ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtSUl, node);
+  }
 }
 
-void InstructionSelector::VisitRoundUint64ToFloat64(Node* node) {
-  VisitRR(this, kRiscvCvtDUl, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitRoundUint64ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvCvtDUl, node);
+  }
 }
 
-void InstructionSelector::VisitBitcastFloat32ToInt32(Node* node) {
-  VisitRR(this, kRiscvBitcastFloat32ToInt32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvBitcastFloat32ToInt32, node);
+  }
 }
 
-void InstructionSelector::VisitBitcastFloat64ToInt64(Node* node) {
-  VisitRR(this, kRiscvBitcastDL, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastFloat64ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvBitcastDL, node);
+  }
 }
 
-void InstructionSelector::VisitBitcastInt32ToFloat32(Node* node) {
-  VisitRR(this, kRiscvBitcastInt32ToFloat32, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt32ToFloat32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvBitcastInt32ToFloat32, node);
+  }
 }
 
-void InstructionSelector::VisitBitcastInt64ToFloat64(Node* node) {
-  VisitRR(this, kRiscvBitcastLD, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastInt64ToFloat64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvBitcastLD, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundDown(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundDown(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat64RoundDown, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32RoundUp(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundUp(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat32RoundUp, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundUp(Node* node) {
-  VisitRR(this, kRiscvFloat64RoundUp, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundUp(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitRR(this, kRiscvFloat64RoundUp, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32RoundTruncate(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTruncate(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat32RoundTruncate, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundTruncate(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTruncate(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat64RoundTruncate, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesAway(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitFloat32RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32RoundTiesEven(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat32RoundTiesEven, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64RoundTiesEven(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesEven(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvFloat64RoundTiesEven, node);
+  }
 }
 
-void InstructionSelector::VisitFloat32Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Neg(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvNegS, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Neg(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
   VisitRR(this, kRiscvNegD, node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  RiscvOperandGenerator g(this);
-  Emit(opcode, g.DefineAsFixed(node, fa0), g.UseFixed(node->InputAt(0), fa0),
-       g.UseFixed(node->InputAt(1), fa1))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(opcode, g.DefineAsFixed(node, fa0), g.UseFixed(node->InputAt(0), fa0),
+         g.UseFixed(node->InputAt(1), fa1))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  RiscvOperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+  RiscvOperandGeneratorT<Adapter> g(this);
   Emit(opcode, g.DefineAsFixed(node, fa0), g.UseFixed(node->InputAt(0), fa1))
       ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  RiscvOperandGenerator g(this);
-
-  // Prepare for C function call.
-  if (call_descriptor->IsCFunctionCall()) {
-    Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
-                                         call_descriptor->ParameterCount())),
-         0, nullptr, 0, nullptr);
-
-    // Poke any stack arguments.
-    int slot = kCArgSlotCount;
-    for (PushParameter input : (*arguments)) {
-      Emit(kRiscvStoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
-           g.TempImmediate(slot << kSystemPointerSizeLog2));
-      ++slot;
-    }
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    int push_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-    if (push_count > 0) {
-      // Calculate needed space
-      int stack_size = 0;
+    RiscvOperandGeneratorT<Adapter> g(this);
+
+    // Prepare for C function call.
+    if (call_descriptor->IsCFunctionCall()) {
+      Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
+                                           call_descriptor->ParameterCount())),
+           0, nullptr, 0, nullptr);
+
+      // Poke any stack arguments.
+      int slot = kCArgSlotCount;
       for (PushParameter input : (*arguments)) {
-        if (input.node) {
-          stack_size += input.location.GetSizeInPointers();
+        Emit(kRiscvStoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
+             g.TempImmediate(slot << kSystemPointerSizeLog2));
+        ++slot;
+      }
+    } else {
+      int push_count = static_cast<int>(call_descriptor->ParameterSlotCount());
+      if (push_count > 0) {
+        // Calculate needed space
+        int stack_size = 0;
+        for (PushParameter input : (*arguments)) {
+          if (input.node) {
+            stack_size += input.location.GetSizeInPointers();
+          }
         }
+        Emit(kRiscvStackClaim, g.NoOutput(),
+             g.TempImmediate(stack_size << kSystemPointerSizeLog2));
       }
-      Emit(kRiscvStackClaim, g.NoOutput(),
-           g.TempImmediate(stack_size << kSystemPointerSizeLog2));
-    }
-    for (size_t n = 0; n < arguments->size(); ++n) {
-      PushParameter input = (*arguments)[n];
-      if (input.node) {
-        Emit(kRiscvStoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
-             g.TempImmediate(static_cast<int>(n << kSystemPointerSizeLog2)));
+      for (size_t n = 0; n < arguments->size(); ++n) {
+        PushParameter input = (*arguments)[n];
+        if (input.node) {
+          Emit(kRiscvStoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
+               g.TempImmediate(static_cast<int>(n << kSystemPointerSizeLog2)));
+        }
       }
     }
   }
 }
 
-void InstructionSelector::VisitUnalignedLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
-  RiscvOperandGenerator g(this);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* base = node->InputAt(0);
+    Node* index = node->InputAt(1);
 
-  ArchOpcode opcode;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kFloat32:
-      opcode = kRiscvULoadFloat;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kRiscvULoadDouble;
-      break;
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsUnsigned() ? kRiscvUlhu : kRiscvUlh;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kRiscvUlw;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:         // Fall through.
-    case MachineRepresentation::kWord64:
-      opcode = kRiscvUld;
-      break;
-    case MachineRepresentation::kSimd128:
-      opcode = kRiscvRvvLd;
-      break;
-    case MachineRepresentation::kSimd256:            // Fall through.
-    case MachineRepresentation::kBit:                // Fall through.
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kCompressed:         // Fall through.
-    case MachineRepresentation::kSandboxedPointer:   // Fall through.
-    case MachineRepresentation::kMapWord:            // Fall through.
-    case MachineRepresentation::kNone:
-      UNREACHABLE();
-  }
+    ArchOpcode opcode;
+    switch (load_rep.representation()) {
+      case MachineRepresentation::kFloat32:
+        opcode = kRiscvULoadFloat;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kRiscvULoadDouble;
+        break;
+      case MachineRepresentation::kWord8:
+        opcode = load_rep.IsUnsigned() ? kRiscvLbu : kRiscvLb;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = load_rep.IsUnsigned() ? kRiscvUlhu : kRiscvUlh;
+        break;
+      case MachineRepresentation::kWord32:
+        opcode = kRiscvUlw;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:         // Fall through.
+      case MachineRepresentation::kWord64:
+        opcode = kRiscvUld;
+        break;
+      case MachineRepresentation::kSimd128:
+        opcode = kRiscvRvvLd;
+        break;
+      case MachineRepresentation::kSimd256:            // Fall through.
+      case MachineRepresentation::kBit:                // Fall through.
+      case MachineRepresentation::kCompressedPointer:  // Fall through.
+      case MachineRepresentation::kCompressed:         // Fall through.
+      case MachineRepresentation::kSandboxedPointer:   // Fall through.
+      case MachineRepresentation::kMapWord:            // Fall through.
+      case MachineRepresentation::kIndirectPointer:    // Fall through.
+      case MachineRepresentation::kNone:
+        UNREACHABLE();
+    }
 
-  if (g.CanBeImmediate(index, opcode)) {
-    Emit(opcode | AddressingModeField::encode(kMode_MRI),
-         g.DefineAsRegister(node), g.UseRegister(base), g.UseImmediate(index));
-  } else {
-    InstructionOperand addr_reg = g.TempRegister();
-    Emit(kRiscvAdd64 | AddressingModeField::encode(kMode_None), addr_reg,
-         g.UseRegister(index), g.UseRegister(base));
-    // Emit desired load opcode, using temp addr_reg.
-    Emit(opcode | AddressingModeField::encode(kMode_MRI),
-         g.DefineAsRegister(node), addr_reg, g.TempImmediate(0));
+    if (g.CanBeImmediate(index, opcode)) {
+      Emit(opcode | AddressingModeField::encode(kMode_MRI),
+           g.DefineAsRegister(node), g.UseRegister(base),
+           g.UseImmediate(index));
+    } else {
+      InstructionOperand addr_reg = g.TempRegister();
+      Emit(kRiscvAdd64 | AddressingModeField::encode(kMode_None), addr_reg,
+           g.UseRegister(index), g.UseRegister(base));
+      // Emit desired load opcode, using temp addr_reg.
+      Emit(opcode | AddressingModeField::encode(kMode_MRI),
+           g.DefineAsRegister(node), addr_reg, g.TempImmediate(0));
+    }
   }
 }
 
-void InstructionSelector::VisitUnalignedStore(Node* node) {
-  RiscvOperandGenerator g(this);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
-  Node* value = node->InputAt(2);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Node* base = node->InputAt(0);
+    Node* index = node->InputAt(1);
+    Node* value = node->InputAt(2);
 
-  UnalignedStoreRepresentation rep = UnalignedStoreRepresentationOf(node->op());
-  ArchOpcode opcode;
-  switch (rep) {
-    case MachineRepresentation::kFloat32:
-      opcode = kRiscvUStoreFloat;
-      break;
-    case MachineRepresentation::kFloat64:
-      opcode = kRiscvUStoreDouble;
-      break;
-    case MachineRepresentation::kWord8:
-      opcode = kRiscvSb;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = kRiscvUsh;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kRiscvUsw;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:         // Fall through.
-    case MachineRepresentation::kWord64:
-      opcode = kRiscvUsd;
-      break;
-    case MachineRepresentation::kSimd128:
-      opcode = kRiscvRvvSt;
-      break;
-    case MachineRepresentation::kSimd256:            // Fall through.
-    case MachineRepresentation::kBit:                // Fall through.
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kCompressed:         // Fall through.
-    case MachineRepresentation::kSandboxedPointer:   // Fall through.
-    case MachineRepresentation::kMapWord:            // Fall through.
-    case MachineRepresentation::kNone:
-      UNREACHABLE();
-  }
+    UnalignedStoreRepresentation rep =
+        UnalignedStoreRepresentationOf(node->op());
+    ArchOpcode opcode;
+    switch (rep) {
+      case MachineRepresentation::kFloat32:
+        opcode = kRiscvUStoreFloat;
+        break;
+      case MachineRepresentation::kFloat64:
+        opcode = kRiscvUStoreDouble;
+        break;
+      case MachineRepresentation::kWord8:
+        opcode = kRiscvSb;
+        break;
+      case MachineRepresentation::kWord16:
+        opcode = kRiscvUsh;
+        break;
+      case MachineRepresentation::kWord32:
+        opcode = kRiscvUsw;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:         // Fall through.
+      case MachineRepresentation::kWord64:
+        opcode = kRiscvUsd;
+        break;
+      case MachineRepresentation::kSimd128:
+        opcode = kRiscvRvvSt;
+        break;
+      case MachineRepresentation::kSimd256:            // Fall through.
+      case MachineRepresentation::kBit:                // Fall through.
+      case MachineRepresentation::kCompressedPointer:  // Fall through.
+      case MachineRepresentation::kCompressed:         // Fall through.
+      case MachineRepresentation::kSandboxedPointer:   // Fall through.
+      case MachineRepresentation::kMapWord:            // Fall through.
+      case MachineRepresentation::kIndirectPointer:    // Fall through.
+      case MachineRepresentation::kNone:
+        UNREACHABLE();
+    }
 
-  if (g.CanBeImmediate(index, opcode)) {
-    Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(),
-         g.UseRegister(base), g.UseImmediate(index),
-         g.UseRegisterOrImmediateZero(value));
-  } else {
-    InstructionOperand addr_reg = g.TempRegister();
-    Emit(kRiscvAdd64 | AddressingModeField::encode(kMode_None), addr_reg,
-         g.UseRegister(index), g.UseRegister(base));
-    // Emit desired store opcode, using temp addr_reg.
-    Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(),
-         addr_reg, g.TempImmediate(0), g.UseRegisterOrImmediateZero(value));
+    if (g.CanBeImmediate(index, opcode)) {
+      Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(),
+           g.UseRegister(base), g.UseImmediate(index),
+           g.UseRegisterOrImmediateZero(value));
+    } else {
+      InstructionOperand addr_reg = g.TempRegister();
+      Emit(kRiscvAdd64 | AddressingModeField::encode(kMode_None), addr_reg,
+           g.UseRegister(index), g.UseRegister(base));
+      // Emit desired store opcode, using temp addr_reg.
+      Emit(opcode | AddressingModeField::encode(kMode_MRI), g.NoOutput(),
+           addr_reg, g.TempImmediate(0), g.UseRegisterOrImmediateZero(value));
+    }
   }
 }
 
@@ -1444,9 +1904,11 @@ bool IsNodeUnsigned(Node* n) {
 #endif
 
 // Shared routine for multiple word compare operations.
-void VisitFullWord32Compare(InstructionSelector* selector, Node* node,
-                            InstructionCode opcode, FlagsContinuation* cont) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void VisitFullWord32Compare(InstructionSelectorT<Adapter>* selector, Node* node,
+                            InstructionCode opcode,
+                            FlagsContinuationT<Adapter>* cont) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   InstructionOperand leftOp = g.TempRegister();
   InstructionOperand rightOp = g.TempRegister();
 
@@ -1459,11 +1921,12 @@ void VisitFullWord32Compare(InstructionSelector* selector, Node* node,
 }
 
 #ifndef V8_COMPRESS_POINTERS
-void VisitOptimizedWord32Compare(InstructionSelector* selector, Node* node,
-                                 InstructionCode opcode,
-                                 FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitOptimizedWord32Compare(InstructionSelectorT<Adapter>* selector,
+                                 Node* node, InstructionCode opcode,
+                                 FlagsContinuationT<Adapter>* cont) {
   if (v8_flags.debug_code) {
-    RiscvOperandGenerator g(selector);
+    RiscvOperandGeneratorT<Adapter> g(selector);
     InstructionOperand leftOp = g.TempRegister();
     InstructionOperand rightOp = g.TempRegister();
     InstructionOperand optimizedResult = g.TempRegister();
@@ -1490,53 +1953,101 @@ void VisitOptimizedWord32Compare(InstructionSelector* selector, Node* node,
   VisitWordCompare(selector, node, opcode, cont, false);
 }
 #endif
-void VisitWord32Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
-  // RISC-V doesn't support Word32 compare instructions. Instead it relies
-  // that the values in registers are correctly sign-extended and uses
-  // Word64 comparison instead. This behavior is correct in most cases,
-  // but doesn't work when comparing signed with unsigned operands.
-  // We could simulate full Word32 compare in all cases but this would
-  // create an unnecessary overhead since unsigned integers are rarely
-  // used in JavaScript.
-  // The solution proposed here tries to match a comparison of signed
-  // with unsigned operand, and perform full Word32Compare only
-  // in those cases. Unfortunately, the solution is not complete because
-  // it might skip cases where Word32 full compare is needed, so
-  // basically it is a hack.
-  // When call to a host function in simulator, if the function return a
-  // int32 value, the simulator do not sign-extended to int64 because in
-  // simulator we do not know the function whether return a int32 or int64.
-  // so we need do a full word32 compare in this case.
+template <typename Adapter>
+void VisitWord32Compare(InstructionSelectorT<Adapter>* selector,
+                        typename Adapter::node_t node,
+                        FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // RISC-V doesn't support Word32 compare instructions. Instead it relies
+    // that the values in registers are correctly sign-extended and uses
+    // Word64 comparison instead. This behavior is correct in most cases,
+    // but doesn't work when comparing signed with unsigned operands.
+    // We could simulate full Word32 compare in all cases but this would
+    // create an unnecessary overhead since unsigned integers are rarely
+    // used in JavaScript.
+    // The solution proposed here tries to match a comparison of signed
+    // with unsigned operand, and perform full Word32Compare only
+    // in those cases. Unfortunately, the solution is not complete because
+    // it might skip cases where Word32 full compare is needed, so
+    // basically it is a hack.
+    // When call to a host function in simulator, if the function return a
+    // int32 value, the simulator do not sign-extended to int64 because in
+    // simulator we do not know the function whether return a int32 or int64.
+    // so we need do a full word32 compare in this case.
 #ifndef V8_COMPRESS_POINTERS
 #ifndef USE_SIMULATOR
-  if (IsNodeUnsigned(node->InputAt(0)) != IsNodeUnsigned(node->InputAt(1))) {
+    if (IsNodeUnsigned(node->InputAt(0)) != IsNodeUnsigned(node->InputAt(1))) {
 #else
-  if (IsNodeUnsigned(node->InputAt(0)) != IsNodeUnsigned(node->InputAt(1)) ||
-      node->InputAt(0)->opcode() == IrOpcode::kCall ||
-      node->InputAt(1)->opcode() == IrOpcode::kCall) {
+    if (IsNodeUnsigned(node->InputAt(0)) != IsNodeUnsigned(node->InputAt(1)) ||
+        node->InputAt(0)->opcode() == IrOpcode::kCall ||
+        node->InputAt(1)->opcode() == IrOpcode::kCall) {
 #endif
-    VisitFullWord32Compare(selector, node, kRiscvCmp, cont);
-  } else {
-    VisitOptimizedWord32Compare(selector, node, kRiscvCmp, cont);
-  }
+      VisitFullWord32Compare(selector, node, kRiscvCmp, cont);
+    } else {
+      VisitOptimizedWord32Compare(selector, node, kRiscvCmp, cont);
+    }
 #else
-  VisitFullWord32Compare(selector, node, kRiscvCmp, cont);
+    VisitFullWord32Compare(selector, node, kRiscvCmp, cont);
 #endif
+  }
 }
 
-void VisitWord64Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWord64Compare(InstructionSelectorT<Adapter>* selector, Node* node,
+                        FlagsContinuationT<Adapter>* cont) {
   VisitWordCompare(selector, node, kRiscvCmp, cont, false);
 }
 
-void VisitAtomicLoad(InstructionSelector* selector, Node* node,
-                     ArchOpcode opcode, AtomicWidth width) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void VisitAtomicLoad(InstructionSelectorT<Adapter>* selector, Node* node,
+                     AtomicWidth width) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
-  if (g.CanBeImmediate(index, opcode)) {
-    selector->Emit(opcode | AddressingModeField::encode(kMode_MRI) |
+
+  // The memory order is ignored.
+  AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
+  LoadRepresentation load_rep = atomic_load_params.representation();
+  InstructionCode code;
+  switch (load_rep.representation()) {
+    case MachineRepresentation::kWord8:
+      DCHECK_IMPLIES(load_rep.IsSigned(), width == AtomicWidth::kWord32);
+      code = load_rep.IsSigned() ? kAtomicLoadInt8 : kAtomicLoadUint8;
+      break;
+    case MachineRepresentation::kWord16:
+      DCHECK_IMPLIES(load_rep.IsSigned(), width == AtomicWidth::kWord32);
+      code = load_rep.IsSigned() ? kAtomicLoadInt16 : kAtomicLoadUint16;
+      break;
+    case MachineRepresentation::kWord32:
+      code = kAtomicLoadWord32;
+      break;
+    case MachineRepresentation::kWord64:
+      code = kRiscvWord64AtomicLoadUint64;
+      break;
+#ifdef V8_COMPRESS_POINTERS
+    case MachineRepresentation::kTaggedSigned:
+      code = kRiscvAtomicLoadDecompressTaggedSigned;
+      break;
+    case MachineRepresentation::kTaggedPointer:
+    case MachineRepresentation::kTagged:
+      code = kRiscvAtomicLoadDecompressTagged;
+      break;
+#else
+    case MachineRepresentation::kTaggedSigned:   // Fall through.
+    case MachineRepresentation::kTaggedPointer:  // Fall through.
+    case MachineRepresentation::kTagged:
+      DCHECK_EQ(kTaggedSize, 8);
+      code = kRiscvWord64AtomicLoadUint64;
+      break;
+#endif
+    default:
+      UNREACHABLE();
+  }
+
+  if (g.CanBeImmediate(index, code)) {
+    selector->Emit(code | AddressingModeField::encode(kMode_MRI) |
                        AtomicWidthField::encode(width),
                    g.DefineAsRegister(node), g.UseRegister(base),
                    g.UseImmediate(index));
@@ -1545,39 +2056,97 @@ void VisitAtomicLoad(InstructionSelector* selector, Node* node,
     selector->Emit(kRiscvAdd64 | AddressingModeField::encode(kMode_None),
                    addr_reg, g.UseRegister(index), g.UseRegister(base));
     // Emit desired load opcode, using temp addr_reg.
-    selector->Emit(opcode | AddressingModeField::encode(kMode_MRI) |
+    selector->Emit(code | AddressingModeField::encode(kMode_MRI) |
                        AtomicWidthField::encode(width),
                    g.DefineAsRegister(node), addr_reg, g.TempImmediate(0));
   }
 }
 
-void VisitAtomicStore(InstructionSelector* selector, Node* node,
-                      ArchOpcode opcode, AtomicWidth width) {
-  RiscvOperandGenerator g(selector);
+template <typename Adapter>
+void VisitAtomicStore(InstructionSelectorT<Adapter>* selector, Node* node,
+                      AtomicWidth width) {
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
 
-  if (g.CanBeImmediate(index, opcode)) {
-    selector->Emit(opcode | AddressingModeField::encode(kMode_MRI) |
-                       AtomicWidthField::encode(width),
-                   g.NoOutput(), g.UseRegister(base), g.UseImmediate(index),
-                   g.UseRegisterOrImmediateZero(value));
+  // The memory order is ignored.
+  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
+  WriteBarrierKind write_barrier_kind = store_params.write_barrier_kind();
+  MachineRepresentation rep = store_params.representation();
+
+  if (v8_flags.enable_unconditional_write_barriers &&
+      CanBeTaggedOrCompressedPointer(rep)) {
+    write_barrier_kind = kFullWriteBarrier;
+  }
+
+  InstructionCode code;
+
+  if (write_barrier_kind != kNoWriteBarrier &&
+      !v8_flags.disable_write_barriers) {
+    DCHECK(CanBeTaggedPointer(rep));
+    DCHECK_EQ(AtomicWidthSize(width), kTaggedSize);
+
+    InstructionOperand inputs[3];
+    size_t input_count = 0;
+    inputs[input_count++] = g.UseUniqueRegister(base);
+    inputs[input_count++] = g.UseUniqueRegister(index);
+    inputs[input_count++] = g.UseUniqueRegister(value);
+    RecordWriteMode record_write_mode =
+        WriteBarrierKindToRecordWriteMode(write_barrier_kind);
+    InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()};
+    size_t const temp_count = arraysize(temps);
+    code = kArchAtomicStoreWithWriteBarrier;
+    code |= RecordWriteModeField::encode(record_write_mode);
+    selector->Emit(code, 0, nullptr, input_count, inputs, temp_count, temps);
   } else {
-    InstructionOperand addr_reg = g.TempRegister();
-    selector->Emit(kRiscvAdd64 | AddressingModeField::encode(kMode_None),
-                   addr_reg, g.UseRegister(index), g.UseRegister(base));
-    // Emit desired store opcode, using temp addr_reg.
-    selector->Emit(opcode | AddressingModeField::encode(kMode_MRI) |
-                       AtomicWidthField::encode(width),
-                   g.NoOutput(), addr_reg, g.TempImmediate(0),
-                   g.UseRegisterOrImmediateZero(value));
+    switch (rep) {
+      case MachineRepresentation::kWord8:
+        code = kAtomicStoreWord8;
+        break;
+      case MachineRepresentation::kWord16:
+        code = kAtomicStoreWord16;
+        break;
+      case MachineRepresentation::kWord32:
+        code = kAtomicStoreWord32;
+        break;
+      case MachineRepresentation::kWord64:
+        DCHECK_EQ(width, AtomicWidth::kWord64);
+        code = kRiscvWord64AtomicStoreWord64;
+        break;
+      case MachineRepresentation::kTaggedSigned:   // Fall through.
+      case MachineRepresentation::kTaggedPointer:  // Fall through.
+      case MachineRepresentation::kTagged:
+        DCHECK_EQ(AtomicWidthSize(width), kTaggedSize);
+        code = kRiscvStoreCompressTagged;
+        break;
+      default:
+        UNREACHABLE();
+    }
+    code |= AtomicWidthField::encode(width);
+
+    if (g.CanBeImmediate(index, code)) {
+      selector->Emit(code | AddressingModeField::encode(kMode_MRI) |
+                         AtomicWidthField::encode(width),
+                     g.NoOutput(), g.UseRegisterOrImmediateZero(value),
+                     g.UseRegister(base), g.UseImmediate(index));
+    } else {
+      InstructionOperand addr_reg = g.TempRegister();
+      selector->Emit(kRiscvAdd64 | AddressingModeField::encode(kMode_None),
+                     addr_reg, g.UseRegister(index), g.UseRegister(base));
+      // Emit desired store opcode, using temp addr_reg.
+      selector->Emit(code | AddressingModeField::encode(kMode_MRI) |
+                         AtomicWidthField::encode(width),
+                     g.NoOutput(), g.UseRegisterOrImmediateZero(value),
+                     addr_reg, g.TempImmediate(0));
+    }
   }
 }
 
-void VisitAtomicBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                       ArchOpcode opcode, AtomicWidth width) {
-  RiscvOperandGenerator g(selector);
+  RiscvOperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -1602,13 +2171,26 @@ void VisitAtomicBinop(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuationT<Adapter>* cont) {
+  StackCheckKind kind;
+  node_t value;
+  if constexpr (Adapter::IsTurboshaft) {
+    const auto& op =
+        this->turboshaft_graph()
+            ->Get(node)
+            .template Cast<turboshaft::StackPointerGreaterThanOp>();
+    kind = op.kind;
+    value = op.stack_limit();
+  } else {
+    kind = StackCheckKindOf(node->op());
+    value = node->InputAt(0);
+  }
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
-  RiscvOperandGenerator g(this);
+  RiscvOperandGeneratorT<Adapter> g(this);
 
   // No outputs.
   InstructionOperand* const outputs = nullptr;
@@ -1623,7 +2205,6 @@ void InstructionSelector::VisitStackPointerGreaterThan(
                                  ? OperandGenerator::kUniqueRegister
                                  : OperandGenerator::kRegister;
 
-  Node* const value = node->InputAt(0);
   InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
   static constexpr int input_count = arraysize(inputs);
 
@@ -1644,474 +2225,537 @@ bool CanCoverTrap(Node* user, Node* value) {
   return true;
 }
 // Shared routine for word comparisons against zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (CanCover(user, value)) {
-    if (value->opcode() == IrOpcode::kWord32Equal) {
-      Int32BinopMatcher m(value);
-      if (!m.right().Is(0)) break;
-      user = value;
-      value = m.left().node();
-    } else if (value->opcode() == IrOpcode::kWord64Equal) {
-      Int64BinopMatcher m(value);
-      if (!m.right().Is(0)) break;
-      user = value;
-      value = m.left().node();
-    } else {
-      break;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (CanCover(user, value)) {
+      if (value->opcode() == IrOpcode::kWord32Equal) {
+        Int32BinopMatcher m(value);
+        if (!m.right().Is(0)) break;
+        user = value;
+        value = m.left().node();
+      } else if (value->opcode() == IrOpcode::kWord64Equal) {
+        Int64BinopMatcher m(value);
+        if (!m.right().Is(0)) break;
+        user = value;
+        value = m.left().node();
+      } else {
+        break;
+      }
+      cont->Negate();
     }
 
-    cont->Negate();
-  }
-
-  if (CanCoverTrap(user, value) && CanCover(user, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kWord64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kInt64LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kInt64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kUint64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kUint64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord64Compare(this, value, cont);
-      case IrOpcode::kFloat32Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitFloat32Compare(this, value, cont);
-      case IrOpcode::kFloat64Equal:
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kFloat64LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitFloat64Compare(this, value, cont);
-      case IrOpcode::kProjection:
-        // Check if this is the overflow output projection of an
-        // <Operation>WithOverflow node.
-        if (ProjectionIndexOf(value->op()) == 1u) {
-          // We cannot combine the <Operation>WithOverflow with this branch
-          // unless the 0th projection (the use of the actual value of the
-          // <Operation> is either nullptr, which means there's no use of the
-          // actual value, or was already defined, which means it is scheduled
-          // *AFTER* this branch).
-          Node* const node = value->InputAt(0);
-          Node* const result = NodeProperties::FindProjection(node, 0);
-          if (result == nullptr || IsDefined(result)) {
-            switch (node->opcode()) {
-              case IrOpcode::kInt32AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kRiscvAdd64, cont);
-              case IrOpcode::kInt32SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kRiscvSub64, cont);
-              case IrOpcode::kInt32MulWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kRiscvMulOvf32, cont);
-              case IrOpcode::kInt64AddWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kRiscvAddOvf64, cont);
-              case IrOpcode::kInt64SubWithOverflow:
-                cont->OverwriteAndNegateIfEqual(kOverflow);
-                return VisitBinop(this, node, kRiscvSubOvf64, cont);
-              default:
-                break;
+    if (CanCoverTrap(user, value) && CanCover(user, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kWord64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kInt64LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kInt64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kUint64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kUint64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord64Compare(this, value, cont);
+        case IrOpcode::kFloat32Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitFloat32Compare(this, value, cont);
+        case IrOpcode::kFloat64Equal:
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kFloat64LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitFloat64Compare(this, value, cont);
+        case IrOpcode::kProjection:
+          // Check if this is the overflow output projection of an
+          // <Operation>WithOverflow node.
+          if (ProjectionIndexOf(value->op()) == 1u) {
+            // We cannot combine the <Operation>WithOverflow with this branch
+            // unless the 0th projection (the use of the actual value of the
+            // <Operation> is either nullptr, which means there's no use of the
+            // actual value, or was already defined, which means it is scheduled
+            // *AFTER* this branch).
+            Node* const node = value->InputAt(0);
+            Node* const result = NodeProperties::FindProjection(node, 0);
+            if (result == nullptr || IsDefined(result)) {
+              switch (node->opcode()) {
+                case IrOpcode::kInt32AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kRiscvAdd64, cont);
+                case IrOpcode::kInt32SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kRiscvSub64, cont);
+                case IrOpcode::kInt32MulWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kRiscvMulOvf32, cont);
+                case IrOpcode::kInt64AddWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kRiscvAddOvf64, cont);
+                case IrOpcode::kInt64SubWithOverflow:
+                  cont->OverwriteAndNegateIfEqual(kOverflow);
+                  return VisitBinop<Adapter, Int32BinopMatcher>(
+                      this, node, kRiscvSubOvf64, cont);
+                default:
+                  break;
+              }
             }
           }
-        }
-        break;
-      case IrOpcode::kWord32And:
-      case IrOpcode::kWord64And:
-        return VisitWordCompare(this, value, kRiscvTst, cont, true);
-      case IrOpcode::kStackPointerGreaterThan:
-        cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
-        return VisitStackPointerGreaterThan(value, cont);
-      default:
-        break;
+          break;
+        case IrOpcode::kWord32And:
+#if V8_COMPRESS_POINTERS
+          return VisitWordCompare(this, value, kRiscvTst32, cont, true);
+#endif
+        case IrOpcode::kWord64And:
+          return VisitWordCompare(this, value, kRiscvTst64, cont, true);
+        case IrOpcode::kStackPointerGreaterThan:
+          cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
+          return VisitStackPointerGreaterThan(value, cont);
+        default:
+          break;
+      }
     }
-  }
 
-  // Continuation could not be combined with a compare, emit compare against 0.
-  EmitWordCompareZero(this, value, cont);
+    // Continuation could not be combined with a compare, emit compare against
+    // 0.
+    EmitWordCompareZero(this, value, cont);
+  }
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int32BinopMatcher m(node);
-  if (m.right().Is(0)) {
-    return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    Node* const user = node;
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    Int32BinopMatcher m(user);
+    if (m.right().Is(0)) {
+      return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+    }
+    if (isolate() && (V8_STATIC_ROOTS_BOOL ||
+                      (COMPRESS_POINTERS_BOOL && !isolate()->bootstrapper()))) {
+      RiscvOperandGeneratorT<Adapter> g(this);
+      const RootsTable& roots_table = isolate()->roots_table();
+      RootIndex root_index;
+      Node* left = nullptr;
+      Handle<HeapObject> right;
+      // HeapConstants and CompressedHeapConstants can be treated the same when
+      // using them as an input to a 32-bit comparison. Check whether either is
+      // present.
+      {
+        CompressedHeapObjectBinopMatcher m(node);
+        if (m.right().HasResolvedValue()) {
+          left = m.left().node();
+          right = m.right().ResolvedValue();
+        } else {
+          HeapObjectBinopMatcher m2(node);
+          if (m2.right().HasResolvedValue()) {
+            left = m2.left().node();
+            right = m2.right().ResolvedValue();
+          }
+        }
+      }
+      if (!right.is_null() && roots_table.IsRootHandle(right, &root_index)) {
+        DCHECK_NE(left, nullptr);
+        if (RootsTable::IsReadOnly(root_index)) {
+          Tagged_t ptr =
+              MacroAssemblerBase::ReadOnlyRootPtr(root_index, isolate());
+          if (g.CanBeImmediate(ptr, kRiscvCmp32)) {
+            return VisitCompare(this, kRiscvCmp32, g.UseRegister(left),
+                                g.TempImmediate(int32_t(ptr)), &cont);
+          }
+        }
+      }
+    }
+    VisitWord32Compare(this, node, &cont);
   }
-
-  VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kRiscvAdd64, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvAdd64,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvAdd64, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvAdd64, &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kRiscvSub64, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvSub64,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvSub64, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvSub64, &cont);
 }
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kRiscvMulOvf32, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvMulOvf32,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int32BinopMatcher>(this, node, kRiscvMulOvf32, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvMulOvf32, &cont);
 }
 
-void InstructionSelector::VisitInt64AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kRiscvAddOvf64, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AddWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvAddOvf64,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvAddOvf64, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvAddOvf64, &cont);
 }
 
-void InstructionSelector::VisitInt64SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    return VisitBinop(this, node, kRiscvSubOvf64, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64SubWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
+      return VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvSubOvf64,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvSubOvf64, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvSubOvf64, &cont);
 }
 
-void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    // RISCV64 doesn't set the overflow flag for multiplication, so we need to
-    // test on kNotEqual. Here is the code sequence used:
-    //   mulh rdh, left, right
-    //   mul rdl, left, right
-    //   srai temp, rdl, 63
-    //   xor overflow, rdl, temp
-    FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
-    return VisitBinop(this, node, kRiscvMulOvf64, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      // RISCV64 doesn't set the overflow flag for multiplication, so we need to
+      // test on kNotEqual. Here is the code sequence used:
+      //   mulh rdh, left, right
+      //   mul rdl, left, right
+      //   srai temp, rdl, 63
+      //   xor overflow, rdl, temp
+      FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
+      return VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvMulOvf64,
+                                                    &cont);
+    }
+    FlagsContinuation cont;
+    VisitBinop<Adapter, Int64BinopMatcher>(this, node, kRiscvMulOvf64, &cont);
   }
-  FlagsContinuation cont;
-  VisitBinop(this, node, kRiscvMulOvf64, &cont);
 }
 
-void InstructionSelector::VisitWord64Equal(Node* const node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int64BinopMatcher m(node);
-  if (m.right().Is(0)) {
-    return VisitWordCompareZero(m.node(), m.left().node(), &cont);
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Equal(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+    Int64BinopMatcher m(node);
+    if (m.right().Is(0)) {
+      return VisitWordCompareZero(m.node(), m.left().node(), &cont);
+    }
 
-  VisitWord64Compare(this, node, &cont);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont =
+        FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThan(Node* node) {
-  FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) {
-  FlagsContinuation cont =
-      FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
-  VisitWord64Compare(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    FlagsContinuation cont =
+        FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
+    VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
-  AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
-  LoadRepresentation load_rep = atomic_load_params.representation();
-  ArchOpcode opcode;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kWord8:
-      opcode = load_rep.IsSigned() ? kAtomicLoadInt8 : kAtomicLoadUint8;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = load_rep.IsSigned() ? kAtomicLoadInt16 : kAtomicLoadUint16;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kAtomicLoadWord32;
-      break;
-    default:
-      UNREACHABLE();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitAtomicLoad(this, node, AtomicWidth::kWord32);
   }
-  VisitAtomicLoad(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
-  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
-  MachineRepresentation rep = store_params.representation();
-  ArchOpcode opcode;
-  switch (rep) {
-    case MachineRepresentation::kWord8:
-      opcode = kAtomicStoreWord8;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = kAtomicStoreWord16;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kAtomicStoreWord32;
-      break;
-    default:
-      UNREACHABLE();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitAtomicStore(this, node, AtomicWidth::kWord32);
   }
-
-  VisitAtomicStore(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicLoad(Node* node) {
-  AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
-  LoadRepresentation load_rep = atomic_load_params.representation();
-  ArchOpcode opcode;
-  switch (load_rep.representation()) {
-    case MachineRepresentation::kWord8:
-      opcode = kAtomicLoadUint8;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = kAtomicLoadUint16;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kAtomicLoadWord32;
-      break;
-    case MachineRepresentation::kWord64:
-      opcode = kRiscvWord64AtomicLoadUint64;
-      break;
-#ifdef V8_COMPRESS_POINTERS
-    case MachineRepresentation::kTaggedSigned:
-      opcode = kRiscv64LdDecompressTaggedSigned;
-      break;
-    case MachineRepresentation::kTaggedPointer:
-      opcode = kRiscv64LdDecompressTagged;
-      break;
-    case MachineRepresentation::kTagged:
-      opcode = kRiscv64LdDecompressTagged;
-      break;
-#else
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:
-      if (kTaggedSize == 8) {
-        opcode = kRiscvWord64AtomicLoadUint64;
-      } else {
-        opcode = kAtomicLoadWord32;
-      }
-      break;
-#endif
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kCompressed:
-      DCHECK(COMPRESS_POINTERS_BOOL);
-      opcode = kAtomicLoadWord32;
-      break;
-    default:
-      UNREACHABLE();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicLoad(Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitAtomicLoad(this, node, AtomicWidth::kWord64);
   }
-  VisitAtomicLoad(this, node, opcode, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord64AtomicStore(Node* node) {
-  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
-  MachineRepresentation rep = store_params.representation();
-  ArchOpcode opcode;
-  switch (rep) {
-    case MachineRepresentation::kWord8:
-      opcode = kAtomicStoreWord8;
-      break;
-    case MachineRepresentation::kWord16:
-      opcode = kAtomicStoreWord16;
-      break;
-    case MachineRepresentation::kWord32:
-      opcode = kAtomicStoreWord32;
-      break;
-    case MachineRepresentation::kWord64:
-      opcode = kRiscvWord64AtomicStoreWord64;
-      break;
-    case MachineRepresentation::kTaggedSigned:   // Fall through.
-    case MachineRepresentation::kTaggedPointer:  // Fall through.
-    case MachineRepresentation::kTagged:
-      opcode = kRiscvWord64AtomicStoreWord64;
-      break;
-    case MachineRepresentation::kCompressedPointer:  // Fall through.
-    case MachineRepresentation::kCompressed:
-      CHECK(COMPRESS_POINTERS_BOOL);
-      opcode = kAtomicStoreWord32;
-      break;
-    default:
-      UNREACHABLE();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitAtomicStore(this, node, AtomicWidth::kWord64);
   }
-
-  VisitAtomicStore(this, node, opcode, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Int8()) {
-    opcode = kAtomicExchangeInt8;
-  } else if (type == MachineType::Uint8()) {
-    opcode = kAtomicExchangeUint8;
-  } else if (type == MachineType::Int16()) {
-    opcode = kAtomicExchangeInt16;
-  } else if (type == MachineType::Uint16()) {
-    opcode = kAtomicExchangeUint16;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = kAtomicExchangeWord32;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
-  }
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Int8()) {
+      opcode = kAtomicExchangeInt8;
+    } else if (type == MachineType::Uint8()) {
+      opcode = kAtomicExchangeUint8;
+    } else if (type == MachineType::Int16()) {
+      opcode = kAtomicExchangeInt16;
+    } else if (type == MachineType::Uint16()) {
+      opcode = kAtomicExchangeUint16;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = kAtomicExchangeWord32;
+    } else {
+      UNREACHABLE();
+    }
 
-  VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32);
+    VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32);
+  }
 }
 
-void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Uint8()) {
-    opcode = kAtomicExchangeUint8;
-  } else if (type == MachineType::Uint16()) {
-    opcode = kAtomicExchangeUint16;
-  } else if (type == MachineType::Uint32()) {
-    opcode = kAtomicExchangeWord32;
-  } else if (type == MachineType::Uint64()) {
-    opcode = kRiscvWord64AtomicExchangeUint64;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicExchange(Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Uint8()) {
+      opcode = kAtomicExchangeUint8;
+    } else if (type == MachineType::Uint16()) {
+      opcode = kAtomicExchangeUint16;
+    } else if (type == MachineType::Uint32()) {
+      opcode = kAtomicExchangeWord32;
+    } else if (type == MachineType::Uint64()) {
+      opcode = kRiscvWord64AtomicExchangeUint64;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord64);
   }
-  VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord64);
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Int8()) {
-    opcode = kAtomicCompareExchangeInt8;
-  } else if (type == MachineType::Uint8()) {
-    opcode = kAtomicCompareExchangeUint8;
-  } else if (type == MachineType::Int16()) {
-    opcode = kAtomicCompareExchangeInt16;
-  } else if (type == MachineType::Uint16()) {
-    opcode = kAtomicCompareExchangeUint16;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = kAtomicCompareExchangeWord32;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
-  }
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Int8()) {
+      opcode = kAtomicCompareExchangeInt8;
+    } else if (type == MachineType::Uint8()) {
+      opcode = kAtomicCompareExchangeUint8;
+    } else if (type == MachineType::Int16()) {
+      opcode = kAtomicCompareExchangeInt16;
+    } else if (type == MachineType::Uint16()) {
+      opcode = kAtomicCompareExchangeUint16;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = kAtomicCompareExchangeWord32;
+    } else {
+      UNREACHABLE();
+    }
 
-  VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord32);
+    VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord32);
+  }
 }
 
-void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Uint8()) {
-    opcode = kAtomicCompareExchangeUint8;
-  } else if (type == MachineType::Uint16()) {
-    opcode = kAtomicCompareExchangeUint16;
-  } else if (type == MachineType::Uint32()) {
-    opcode = kAtomicCompareExchangeWord32;
-  } else if (type == MachineType::Uint64()) {
-    opcode = kRiscvWord64AtomicCompareExchangeUint64;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicCompareExchange(
+    Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Uint8()) {
+      opcode = kAtomicCompareExchangeUint8;
+    } else if (type == MachineType::Uint16()) {
+      opcode = kAtomicCompareExchangeUint16;
+    } else if (type == MachineType::Uint32()) {
+      opcode = kAtomicCompareExchangeWord32;
+    } else if (type == MachineType::Uint64()) {
+      opcode = kRiscvWord64AtomicCompareExchangeUint64;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord64);
   }
-  VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord64);
 }
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
-    Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Int8()) {
-    opcode = int8_op;
-  } else if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Int16()) {
-    opcode = int16_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = word32_op;
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
-  }
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Int8()) {
+      opcode = int8_op;
+    } else if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Int16()) {
+      opcode = int16_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = word32_op;
+    } else {
+      UNREACHABLE();
+    }
 
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32);
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32);
+  }
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                             \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) {  \
+    if constexpr (Adapter::IsTurboshaft) {                                 \
+      UNIMPLEMENTED();                                                     \
+                                                                           \
+    } else {                                                               \
+      VisitWord32AtomicBinaryOperation(                                    \
+          node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
+          kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+    }                                                                      \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -2120,30 +2764,40 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitWord64AtomicBinaryOperation(
-    Node* node, ArchOpcode uint8_op, ArchOpcode uint16_op, ArchOpcode uint32_op,
-    ArchOpcode uint64_op) {
-  ArchOpcode opcode;
-  MachineType type = AtomicOpType(node->op());
-  if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Uint32()) {
-    opcode = uint32_op;
-  } else if (type == MachineType::Uint64()) {
-    opcode = uint64_op;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicBinaryOperation(
+    node_t node, ArchOpcode uint8_op, ArchOpcode uint16_op,
+    ArchOpcode uint32_op, ArchOpcode uint64_op) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    ArchOpcode opcode;
+    MachineType type = AtomicOpType(node->op());
+    if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Uint32()) {
+      opcode = uint32_op;
+    } else if (type == MachineType::Uint64()) {
+      opcode = uint64_op;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64);
   }
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64);
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                                 \
-  void InstructionSelector::VisitWord64Atomic##op(Node* node) {                \
-    VisitWord64AtomicBinaryOperation(node, kAtomic##op##Uint8,                 \
-                                     kAtomic##op##Uint16, kAtomic##op##Word32, \
-                                     kRiscvWord64Atomic##op##Uint64);          \
+#define VISIT_ATOMIC_BINOP(op)                                                \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::VisitWord64Atomic##op(Node* node) {     \
+    if constexpr (Adapter::IsTurboshaft) {                                    \
+      UNIMPLEMENTED();                                                        \
+    } else {                                                                  \
+      VisitWord64AtomicBinaryOperation(                                       \
+          node, kAtomic##op##Uint8, kAtomic##op##Uint16, kAtomic##op##Word32, \
+          kRiscvWord64Atomic##op##Uint64);                                    \
+    }                                                                         \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -2152,30 +2806,98 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitSignExtendWord8ToInt64(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvSignExtendByte, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord8ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvSignExtendByte, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitSignExtendWord16ToInt64(Node* node) {
-  RiscvOperandGenerator g(this);
-  Emit(kRiscvSignExtendShort, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord16ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    RiscvOperandGeneratorT<Adapter> g(this);
+    Emit(kRiscvSignExtendShort, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::VisitSignExtendWord32ToInt64(Node* node) {
-  EmitSignExtendWord(this, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSignExtendWord32ToInt64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    EmitSignExtendWord(this, node);
+  }
 }
 
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Min(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand mask_reg = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfeqVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmfeqVv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVandVv, mask_reg, temp2, temp1, g.UseImmediate(E64),
+             g.UseImmediate(m1));
+
+  InstructionOperand NaN = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand result = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, NaN, g.UseImmediate64(0x7ff8000000000000L),
+             g.UseImmediate(E64), g.UseImmediate(m1));
+  this->Emit(kRiscvVfminVv, result, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1), g.UseImmediate(MaskType::Mask));
+  this->Emit(kRiscvVmv, g.DefineAsRegister(node), result, g.UseImmediate(E64),
+             g.UseImmediate(m1));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Max(Node* node) {
+  RiscvOperandGeneratorT<Adapter> g(this);
+  InstructionOperand temp1 = g.TempFpRegister(v0);
+  InstructionOperand temp2 = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand mask_reg = g.TempFpRegister(v0);
+  this->Emit(kRiscvVmfeqVv, temp1, g.UseRegister(node->InputAt(0)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVmfeqVv, temp2, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(1)), g.UseImmediate(E64),
+             g.UseImmediate(m1));
+  this->Emit(kRiscvVandVv, mask_reg, temp2, temp1, g.UseImmediate(E64),
+             g.UseImmediate(m1));
+
+  InstructionOperand NaN = g.TempFpRegister(kSimd128ScratchReg);
+  InstructionOperand result = g.TempFpRegister(kSimd128ScratchReg);
+  this->Emit(kRiscvVmv, NaN, g.UseImmediate64(0x7ff8000000000000L),
+             g.UseImmediate(E64), g.UseImmediate(m1));
+  this->Emit(kRiscvVfmaxVv, result, g.UseRegister(node->InputAt(1)),
+             g.UseRegister(node->InputAt(0)), g.UseImmediate(E64),
+             g.UseImmediate(m1), g.UseImmediate(MaskType::Mask));
+  this->Emit(kRiscvVmv, g.DefineAsRegister(node), result, g.UseImmediate(E64),
+             g.UseImmediate(m1));
+}
 // static
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
@@ -2199,6 +2921,11 @@ InstructionSelector::SupportedMachineOperatorFlags() {
 #undef TRACE_UNIMPL
 #undef TRACE
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/s390/code-generator-s390.cc b/deps/v8/src/compiler/backend/s390/code-generator-s390.cc
index d2cb552b9c0915..b717774fde46f4 100644
--- a/deps/v8/src/compiler/backend/s390/code-generator-s390.cc
+++ b/deps/v8/src/compiler/backend/s390/code-generator-s390.cc
@@ -1138,7 +1138,7 @@ void CodeGenerator::BailoutIfDeoptimized() {
   int offset = InstructionStream::kCodeOffset - InstructionStream::kHeaderSize;
   __ LoadTaggedField(ip, MemOperand(kJavaScriptCallCodeStartRegister, offset),
                      r0);
-  __ LoadU16(ip, FieldMemOperand(ip, Code::kKindSpecificFlagsOffset));
+  __ LoadU32(ip, FieldMemOperand(ip, Code::kFlagsOffset));
   __ TestBit(ip, Code::kMarkedForDeoptimizationBit);
   __ Jump(BUILTIN_CODE(isolate(), CompileLazyDeoptimizedCode),
           RelocInfo::CODE_TARGET, ne);
@@ -1175,7 +1175,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchCallBuiltinPointer: {
       DCHECK(!instr->InputAt(0)->IsImmediate());
       Register builtin_index = i.InputRegister(0);
-      __ CallBuiltinByIndex(builtin_index);
+      Register target =
+          instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister)
+              ? kJavaScriptCallCodeStartRegister
+              : builtin_index;
+      __ CallBuiltinByIndex(builtin_index, target);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -1247,9 +1251,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ CmpS64(cp, kScratchReg);
         __ Assert(eq, AbortReason::kWrongFunctionContext);
       }
-      static_assert(kJavaScriptCallCodeStartRegister == r4, "ABI mismatch");
-      __ LoadTaggedField(r4, FieldMemOperand(func, JSFunction::kCodeOffset));
-      __ CallCodeObject(r4);
+      __ CallJSFunction(func);
       RecordCallPosition(instr);
       frame_access_state()->ClearSPDelta();
       break;
@@ -1450,6 +1452,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier:
+      UNREACHABLE();
     case kArchStackSlot: {
       FrameOffset offset =
           frame_access_state()->GetFrameOffset(i.InputInt32(0));
@@ -2978,8 +2982,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     }
     case kS390_I8x16Swizzle: {
       __ I8x16Swizzle(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                      i.InputSimd128Register(1), r0, r1, kScratchDoubleReg,
-                      i.ToSimd128Register(instr->TempAt(0)));
+                      i.InputSimd128Register(1), r0, r1, kScratchDoubleReg);
       break;
     }
     case kS390_I64x2BitMask: {
@@ -3250,31 +3253,16 @@ void CodeGenerator::AssembleArchTrap(Instruction* instr,
 
    private:
     void GenerateCallToTrap(TrapId trap_id) {
-      if (trap_id == TrapId::kInvalid) {
-        // We cannot test calls to the runtime in cctest/test-run-wasm.
-        // Therefore we emit a call to C here instead of a call to the runtime.
-        // We use the context register as the scratch register, because we do
-        // not have a context here.
-        __ PrepareCallCFunction(0, 0, cp);
-        __ CallCFunction(
-            ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-        __ LeaveFrame(StackFrame::WASM);
-        auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-        int pop_count = static_cast<int>(call_descriptor->ParameterSlotCount());
-        __ Drop(pop_count);
-        __ Ret();
-      } else {
-        gen_->AssembleSourcePosition(instr_);
-        // A direct call to a wasm runtime stub defined in this module.
-        // Just encode the stub index. This will be patched when the code
-        // is added to the native module and copied into wasm code space.
-        __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-        ReferenceMap* reference_map =
-            gen_->zone()->New<ReferenceMap>(gen_->zone());
-        gen_->RecordSafepoint(reference_map);
-        if (v8_flags.debug_code) {
-          __ stop();
-        }
+      gen_->AssembleSourcePosition(instr_);
+      // A direct call to a wasm runtime stub defined in this module.
+      // Just encode the stub index. This will be patched when the code
+      // is added to the native module and copied into wasm code space.
+      __ Call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+      ReferenceMap* reference_map =
+          gen_->zone()->New<ReferenceMap>(gen_->zone());
+      gen_->RecordSafepoint(reference_map);
+      if (v8_flags.debug_code) {
+        __ stop();
       }
     }
 
@@ -3348,7 +3336,7 @@ void CodeGenerator::AssembleArchTableSwitch(Instruction* instr) {
   S390OperandConverter i(this, instr);
   Register input = i.InputRegister(0);
   int32_t const case_count = static_cast<int32_t>(instr->InputCount() - 2);
-  Label** cases = zone()->NewArray<Label*>(case_count);
+  Label** cases = zone()->AllocateArray<Label*>(case_count);
   for (int32_t index = 0; index < case_count; ++index) {
     cases[index] = GetLabel(i.InputRpo(index + 2));
   }
@@ -3635,22 +3623,23 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 }
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
-  int new_slots = ElementSizeInPointers(rep);
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = ElementSizeInPointers(rep);
   S390OperandConverter g(this, nullptr);
   if (dest->IsFloatStackSlot() || dest->IsDoubleStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ Pop(r1);
     __ StoreU64(r1, g.ToMemOperand(dest));
   } else {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ lay(sp, MemOperand(sp, new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ lay(sp, MemOperand(sp, dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
diff --git a/deps/v8/src/compiler/backend/s390/instruction-selector-s390.cc b/deps/v8/src/compiler/backend/s390/instruction-selector-s390.cc
index 52d844c82e341f..92a693a65515b7 100644
--- a/deps/v8/src/compiler/backend/s390/instruction-selector-s390.cc
+++ b/deps/v8/src/compiler/backend/s390/instruction-selector-s390.cc
@@ -2,9 +2,12 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include "src/base/logging.h"
+#include "src/compiler/backend/instruction-selector-adapter.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
+#include "src/compiler/turboshaft/operations.h"
 #include "src/execution/frame-constants.h"
 
 namespace v8 {
@@ -79,10 +82,13 @@ OperandModes immediateModeMask =
   (OperandMode::kArithmeticCommonMode | OperandMode::kInt32Imm)
 
 // Adds S390-specific methods for generating operands.
-class S390OperandGenerator final : public OperandGenerator {
+template <typename Adapter>
+class S390OperandGeneratorT final : public OperandGeneratorT<Adapter> {
  public:
-  explicit S390OperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit S390OperandGeneratorT(InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
 
   InstructionOperand UseOperand(Node* node, OperandModes mode) {
     if (CanBeImmediate(node, mode)) {
@@ -95,7 +101,7 @@ class S390OperandGenerator final : public OperandGenerator {
     if (NodeProperties::IsConstant(node))
       return UseRegister(node);
     else
-      return Use(node);
+      return this->Use(node);
   }
 
   int64_t GetImmediate(Node* node) {
@@ -244,7 +250,8 @@ class S390OperandGenerator final : public OperandGenerator {
   }
 
   MachineRepresentation GetRepresentation(Node* node) {
-    return sequence()->GetRepresentation(selector()->GetVirtualRegister(node));
+    return this->sequence()->GetRepresentation(
+        selector()->GetVirtualRegister(node));
   }
 
   bool Is64BitOperand(Node* node) {
@@ -297,6 +304,7 @@ ArchOpcode SelectLoadOpcode(LoadRepresentation load_rep) {
       break;
     case MachineRepresentation::kCompressedPointer:  // Fall through.
     case MachineRepresentation::kCompressed:
+    case MachineRepresentation::kIndirectPointer:  // Fall through.
     case MachineRepresentation::kSandboxedPointer:  // Fall through.
 #ifdef V8_COMPRESS_POINTERS
       opcode = kS390_LoadWordS32;
@@ -438,9 +446,10 @@ void VisitShift() { }
 #endif
 
 #if V8_TARGET_ARCH_S390X
-void VisitTryTruncateDouble(InstructionSelector* selector, ArchOpcode opcode,
-                            Node* node) {
-  S390OperandGenerator g(selector);
+template <typename Adapter>
+void VisitTryTruncateDouble(InstructionSelectorT<Adapter>* selector,
+                            ArchOpcode opcode, Node* node) {
+  S390OperandGeneratorT<Adapter> g(selector);
   InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
@@ -455,13 +464,13 @@ void VisitTryTruncateDouble(InstructionSelector* selector, ArchOpcode opcode,
 }
 #endif
 
-template <class CanCombineWithLoad>
-void GenerateRightOperands(InstructionSelector* selector, Node* node,
+template <typename Adapter, class CanCombineWithLoad>
+void GenerateRightOperands(InstructionSelectorT<Adapter>* selector, Node* node,
                            Node* right, InstructionCode* opcode,
                            OperandModes* operand_mode,
                            InstructionOperand* inputs, size_t* input_count,
                            CanCombineWithLoad canCombineWithLoad) {
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
 
   if ((*operand_mode & OperandMode::kAllowImmediate) &&
       g.CanBeImmediate(right, *operand_mode)) {
@@ -500,13 +509,13 @@ void GenerateRightOperands(InstructionSelector* selector, Node* node,
   }
 }
 
-template <class CanCombineWithLoad>
-void GenerateBinOpOperands(InstructionSelector* selector, Node* node,
+template <typename Adapter, class CanCombineWithLoad>
+void GenerateBinOpOperands(InstructionSelectorT<Adapter>* selector, Node* node,
                            Node* left, Node* right, InstructionCode* opcode,
                            OperandModes* operand_mode,
                            InstructionOperand* inputs, size_t* input_count,
                            CanCombineWithLoad canCombineWithLoad) {
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   // left is always register
   InstructionOperand const left_input = g.UseRegister(left);
   inputs[(*input_count)++] = left_input;
@@ -521,16 +530,17 @@ void GenerateBinOpOperands(InstructionSelector* selector, Node* node,
   }
 }
 
-template <class CanCombineWithLoad>
-void VisitUnaryOp(InstructionSelector* selector, Node* node,
+template <typename Adapter, class CanCombineWithLoad>
+void VisitUnaryOp(InstructionSelectorT<Adapter>* selector, Node* node,
                   InstructionCode opcode, OperandModes operand_mode,
-                  FlagsContinuation* cont,
+                  FlagsContinuationT<Adapter>* cont,
                   CanCombineWithLoad canCombineWithLoad);
 
-template <class CanCombineWithLoad>
-void VisitBinOp(InstructionSelector* selector, Node* node,
+template <typename Adapter, class CanCombineWithLoad>
+void VisitBinOp(InstructionSelectorT<Adapter>* selector, Node* node,
                 InstructionCode opcode, OperandModes operand_mode,
-                FlagsContinuation* cont, CanCombineWithLoad canCombineWithLoad);
+                FlagsContinuationT<Adapter>* cont,
+                CanCombineWithLoad canCombineWithLoad);
 
 // Generate The following variations:
 //   VisitWord32UnaryOp, VisitWord32BinOp,
@@ -563,16 +573,19 @@ void VisitBinOp(InstructionSelector* selector, Node* node,
 #endif
 
 #define DECLARE_VISIT_HELPER_FUNCTIONS(type1, type2, canCombineWithLoad)  \
+  template <typename Adapter>                                             \
   static inline void Visit##type1##type2##Op(                             \
-      InstructionSelector* selector, Node* node, InstructionCode opcode,  \
-      OperandModes operand_mode, FlagsContinuation* cont) {               \
+      InstructionSelectorT<Adapter>* selector, Node* node,                \
+      InstructionCode opcode, OperandModes operand_mode,                  \
+      FlagsContinuationT<Adapter>* cont) {                                \
     Visit##type2##Op(selector, node, opcode, operand_mode, cont,          \
                      canCombineWithLoad);                                 \
   }                                                                       \
+  template <typename Adapter>                                             \
   static inline void Visit##type1##type2##Op(                             \
-      InstructionSelector* selector, Node* node, InstructionCode opcode,  \
-      OperandModes operand_mode) {                                        \
-    FlagsContinuation cont;                                               \
+      InstructionSelectorT<Adapter>* selector, Node* node,                \
+      InstructionCode opcode, OperandModes operand_mode) {                \
+    FlagsContinuationT<Adapter> cont;                                     \
     Visit##type1##type2##Op(selector, node, opcode, operand_mode, &cont); \
   }
 VISIT_OP_LIST(DECLARE_VISIT_HELPER_FUNCTIONS)
@@ -580,12 +593,12 @@ VISIT_OP_LIST(DECLARE_VISIT_HELPER_FUNCTIONS)
 #undef VISIT_OP_LIST_32
 #undef VISIT_OP_LIST
 
-template <class CanCombineWithLoad>
-void VisitUnaryOp(InstructionSelector* selector, Node* node,
+template <typename Adapter, class CanCombineWithLoad>
+void VisitUnaryOp(InstructionSelectorT<Adapter>* selector, Node* node,
                   InstructionCode opcode, OperandModes operand_mode,
-                  FlagsContinuation* cont,
+                  FlagsContinuationT<Adapter>* cont,
                   CanCombineWithLoad canCombineWithLoad) {
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   InstructionOperand inputs[8];
   size_t input_count = 0;
   InstructionOperand outputs[2];
@@ -628,12 +641,12 @@ void VisitUnaryOp(InstructionSelector* selector, Node* node,
                                  inputs, cont);
 }
 
-template <class CanCombineWithLoad>
-void VisitBinOp(InstructionSelector* selector, Node* node,
+template <typename Adapter, class CanCombineWithLoad>
+void VisitBinOp(InstructionSelectorT<Adapter>* selector, Node* node,
                 InstructionCode opcode, OperandModes operand_mode,
-                FlagsContinuation* cont,
+                FlagsContinuationT<Adapter>* cont,
                 CanCombineWithLoad canCombineWithLoad) {
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   Node* left = m.left().node();
   Node* right = m.right().node();
@@ -687,47 +700,67 @@ void VisitBinOp(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
-  int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
-  OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+    int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
+    OperandGenerator g(this);
 
-  Emit(kArchStackSlot, g.DefineAsRegister(node),
-       sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+    Emit(kArchStackSlot, g.DefineAsRegister(node),
+         sequence()->AddImmediate(Constant(slot)), 0, nullptr);
+  }
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  S390OperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), r3));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), r3));
+  }
 }
 
-void InstructionSelector::VisitLoad(Node* node, Node* value,
-                                    InstructionCode opcode) {
-  S390OperandGenerator g(this);
-  InstructionOperand outputs[] = {g.DefineAsRegister(node)};
-  InstructionOperand inputs[3];
-  size_t input_count = 0;
-  AddressingMode mode =
-      g.GetEffectiveAddressMemoryOperand(value, inputs, &input_count);
-  opcode |= AddressingModeField::encode(mode);
-  Emit(opcode, 1, outputs, input_count, inputs);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node, node_t value,
+                                              InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    InstructionOperand outputs[] = {g.DefineAsRegister(node)};
+    InstructionOperand inputs[3];
+    size_t input_count = 0;
+    AddressingMode mode =
+        g.GetEffectiveAddressMemoryOperand(value, inputs, &input_count);
+    opcode |= AddressingModeField::encode(mode);
+    Emit(opcode, 1, outputs, input_count, inputs);
+  }
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  typename Adapter::LoadView load = this->load_view(node);
+  LoadRepresentation load_rep = load.loaded_rep();
   InstructionCode opcode = SelectLoadOpcode(load_rep);
   VisitLoad(node, node, opcode);
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
+template <typename Adapter>
 static void VisitGeneralStore(
-    InstructionSelector* selector, Node* node, MachineRepresentation rep,
+    InstructionSelectorT<Adapter>* selector, Node* node,
+    MachineRepresentation rep,
     WriteBarrierKind write_barrier_kind = kNoWriteBarrier) {
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* offset = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -782,6 +815,7 @@ static void VisitGeneralStore(
         break;
       case MachineRepresentation::kCompressedPointer:  // Fall through.
       case MachineRepresentation::kCompressed:
+      case MachineRepresentation::kIndirectPointer:  // Fall through.
       case MachineRepresentation::kSandboxedPointer:  // Fall through.
 #ifdef V8_COMPRESS_POINTERS
         opcode = kS390_StoreCompressTagged;
@@ -826,37 +860,67 @@ static void VisitGeneralStore(
   }
 }
 
-void InstructionSelector::VisitStore(Node* node) {
-  StoreRepresentation store_rep = StoreRepresentationOf(node->op());
-  WriteBarrierKind write_barrier_kind = store_rep.write_barrier_kind();
-  MachineRepresentation rep = store_rep.representation();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
 
-  if (v8_flags.enable_unconditional_write_barriers &&
-      CanBeTaggedOrCompressedPointer(rep)) {
-    write_barrier_kind = kFullWriteBarrier;
-  }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    StoreRepresentation store_rep = StoreRepresentationOf(node->op());
+    WriteBarrierKind write_barrier_kind = store_rep.write_barrier_kind();
+    MachineRepresentation rep = store_rep.representation();
+
+    if (v8_flags.enable_unconditional_write_barriers &&
+        CanBeTaggedOrCompressedPointer(rep)) {
+      write_barrier_kind = kFullWriteBarrier;
+    }
 
-  VisitGeneralStore(this, node, rep, write_barrier_kind);
+    VisitGeneralStore(this, node, rep, write_barrier_kind);
+  }
 }
 
-void InstructionSelector::VisitProtectedStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
   // TODO(eholk)
   UNIMPLEMENTED();
 }
 
 // Architecture supports unaligned access, therefore VisitLoad is used instead
-void InstructionSelector::VisitUnalignedLoad(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  UNREACHABLE();
+}
 
 // Architecture supports unaligned access, therefore VisitStore is used instead
-void InstructionSelector::VisitUnalignedStore(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedStore(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuation* cont) {
+  StackCheckKind kind;
+  node_t value;
+  if constexpr (Adapter::IsTurboshaft) {
+    const auto& op =
+        this->turboshaft_graph()
+            ->Get(node)
+            .template Cast<turboshaft::StackPointerGreaterThanOp>();
+    kind = op.kind;
+    value = op.stack_limit();
+  } else {
+    kind = StackCheckKindOf(node->op());
+    value = node->InputAt(0);
+  }
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
-  S390OperandGenerator g(this);
+  S390OperandGeneratorT<Adapter> g(this);
 
   // No outputs.
   InstructionOperand* const outputs = nullptr;
@@ -871,7 +935,6 @@ void InstructionSelector::VisitStackPointerGreaterThan(
                                  ? OperandGenerator::kUniqueRegister
                                  : OperandGenerator::kRegister;
 
-  Node* const value = node->InputAt(0);
   InstructionOperand inputs[] = {g.UseRegisterWithMode(value, register_mode)};
   static constexpr int input_count = arraysize(inputs);
 
@@ -906,71 +969,35 @@ static inline bool IsContiguousMask64(uint64_t value, int* mb, int* me) {
 #endif
 
 #if V8_TARGET_ARCH_S390X
-void InstructionSelector::VisitWord64And(Node* node) {
-  S390OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  int mb = 0;
-  int me = 0;
-  if (m.right().HasResolvedValue() &&
-      IsContiguousMask64(m.right().ResolvedValue(), &mb, &me)) {
-    int sh = 0;
-    Node* left = m.left().node();
-    if ((m.left().IsWord64Shr() || m.left().IsWord64Shl()) &&
-        CanCover(node, left)) {
-      Int64BinopMatcher mleft(m.left().node());
-      if (mleft.right().IsInRange(0, 63)) {
-        left = mleft.left().node();
-        sh = mleft.right().ResolvedValue();
-        if (m.left().IsWord64Shr()) {
-          // Adjust the mask such that it doesn't include any rotated bits.
-          if (mb > 63 - sh) mb = 63 - sh;
-          sh = (64 - sh) & 0x3F;
-        } else {
-          // Adjust the mask such that it doesn't include any rotated bits.
-          if (me < sh) me = sh;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64And(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    int mb = 0;
+    int me = 0;
+    if (m.right().HasResolvedValue() &&
+        IsContiguousMask64(m.right().ResolvedValue(), &mb, &me)) {
+      int sh = 0;
+      Node* left = m.left().node();
+      if ((m.left().IsWord64Shr() || m.left().IsWord64Shl()) &&
+          CanCover(node, left)) {
+        Int64BinopMatcher mleft(m.left().node());
+        if (mleft.right().IsInRange(0, 63)) {
+          left = mleft.left().node();
+          sh = mleft.right().ResolvedValue();
+          if (m.left().IsWord64Shr()) {
+            // Adjust the mask such that it doesn't include any rotated bits.
+            if (mb > 63 - sh) mb = 63 - sh;
+            sh = (64 - sh) & 0x3F;
+          } else {
+            // Adjust the mask such that it doesn't include any rotated bits.
+            if (me < sh) me = sh;
+          }
         }
       }
-    }
-    if (mb >= me) {
-      bool match = false;
-      ArchOpcode opcode;
-      int mask;
-      if (me == 0) {
-        match = true;
-        opcode = kS390_RotLeftAndClearLeft64;
-        mask = mb;
-      } else if (mb == 63) {
-        match = true;
-        opcode = kS390_RotLeftAndClearRight64;
-        mask = me;
-      } else if (sh && me <= sh && m.left().IsWord64Shl()) {
-        match = true;
-        opcode = kS390_RotLeftAndClear64;
-        mask = mb;
-      }
-      if (match && CpuFeatures::IsSupported(GENERAL_INSTR_EXT)) {
-        Emit(opcode, g.DefineAsRegister(node), g.UseRegister(left),
-             g.TempImmediate(sh), g.TempImmediate(mask));
-        return;
-      }
-    }
-  }
-  VisitWord64BinOp(this, node, kS390_And64, And64OperandMode);
-}
-
-void InstructionSelector::VisitWord64Shl(Node* node) {
-  S390OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  // TODO(mbrandy): eliminate left sign extension if right >= 32
-  if (m.left().IsWord64And() && m.right().IsInRange(0, 63)) {
-    Int64BinopMatcher mleft(m.left().node());
-    int sh = m.right().ResolvedValue();
-    int mb;
-    int me;
-    if (mleft.right().HasResolvedValue() &&
-        IsContiguousMask64(mleft.right().ResolvedValue() << sh, &mb, &me)) {
-      // Adjust the mask such that it doesn't include any rotated bits.
-      if (me < sh) me = sh;
       if (mb >= me) {
         bool match = false;
         ArchOpcode opcode;
@@ -983,66 +1010,118 @@ void InstructionSelector::VisitWord64Shl(Node* node) {
           match = true;
           opcode = kS390_RotLeftAndClearRight64;
           mask = me;
-        } else if (sh && me <= sh) {
+        } else if (sh && me <= sh && m.left().IsWord64Shl()) {
           match = true;
           opcode = kS390_RotLeftAndClear64;
           mask = mb;
         }
         if (match && CpuFeatures::IsSupported(GENERAL_INSTR_EXT)) {
-          Emit(opcode, g.DefineAsRegister(node),
-               g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
-               g.TempImmediate(mask));
+          Emit(opcode, g.DefineAsRegister(node), g.UseRegister(left),
+               g.TempImmediate(sh), g.TempImmediate(mask));
           return;
         }
       }
     }
+    VisitWord64BinOp(this, node, kS390_And64, And64OperandMode);
   }
-  VisitWord64BinOp(this, node, kS390_ShiftLeft64, Shift64OperandMode);
 }
 
-void InstructionSelector::VisitWord64Shr(Node* node) {
-  S390OperandGenerator g(this);
-  Int64BinopMatcher m(node);
-  if (m.left().IsWord64And() && m.right().IsInRange(0, 63)) {
-    Int64BinopMatcher mleft(m.left().node());
-    int sh = m.right().ResolvedValue();
-    int mb;
-    int me;
-    if (mleft.right().HasResolvedValue() &&
-        IsContiguousMask64((uint64_t)(mleft.right().ResolvedValue()) >> sh, &mb,
-                           &me)) {
-      // Adjust the mask such that it doesn't include any rotated bits.
-      if (mb > 63 - sh) mb = 63 - sh;
-      sh = (64 - sh) & 0x3F;
-      if (mb >= me) {
-        bool match = false;
-        ArchOpcode opcode;
-        int mask;
-        if (me == 0) {
-          match = true;
-          opcode = kS390_RotLeftAndClearLeft64;
-          mask = mb;
-        } else if (mb == 63) {
-          match = true;
-          opcode = kS390_RotLeftAndClearRight64;
-          mask = me;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    // TODO(mbrandy): eliminate left sign extension if right >= 32
+    if (m.left().IsWord64And() && m.right().IsInRange(0, 63)) {
+      Int64BinopMatcher mleft(m.left().node());
+      int sh = m.right().ResolvedValue();
+      int mb;
+      int me;
+      if (mleft.right().HasResolvedValue() &&
+          IsContiguousMask64(mleft.right().ResolvedValue() << sh, &mb, &me)) {
+        // Adjust the mask such that it doesn't include any rotated bits.
+        if (me < sh) me = sh;
+        if (mb >= me) {
+          bool match = false;
+          ArchOpcode opcode;
+          int mask;
+          if (me == 0) {
+            match = true;
+            opcode = kS390_RotLeftAndClearLeft64;
+            mask = mb;
+          } else if (mb == 63) {
+            match = true;
+            opcode = kS390_RotLeftAndClearRight64;
+            mask = me;
+          } else if (sh && me <= sh) {
+            match = true;
+            opcode = kS390_RotLeftAndClear64;
+            mask = mb;
+          }
+          if (match && CpuFeatures::IsSupported(GENERAL_INSTR_EXT)) {
+            Emit(opcode, g.DefineAsRegister(node),
+                 g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
+                 g.TempImmediate(mask));
+            return;
+          }
         }
-        if (match) {
-          Emit(opcode, g.DefineAsRegister(node),
-               g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
-               g.TempImmediate(mask));
-          return;
+      }
+    }
+    VisitWord64BinOp(this, node, kS390_ShiftLeft64, Shift64OperandMode);
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shr(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    Int64BinopMatcher m(node);
+    if (m.left().IsWord64And() && m.right().IsInRange(0, 63)) {
+      Int64BinopMatcher mleft(m.left().node());
+      int sh = m.right().ResolvedValue();
+      int mb;
+      int me;
+      if (mleft.right().HasResolvedValue() &&
+          IsContiguousMask64((uint64_t)(mleft.right().ResolvedValue()) >> sh,
+                             &mb, &me)) {
+        // Adjust the mask such that it doesn't include any rotated bits.
+        if (mb > 63 - sh) mb = 63 - sh;
+        sh = (64 - sh) & 0x3F;
+        if (mb >= me) {
+          bool match = false;
+          ArchOpcode opcode;
+          int mask;
+          if (me == 0) {
+            match = true;
+            opcode = kS390_RotLeftAndClearLeft64;
+            mask = mb;
+          } else if (mb == 63) {
+            match = true;
+            opcode = kS390_RotLeftAndClearRight64;
+            mask = me;
+          }
+          if (match) {
+            Emit(opcode, g.DefineAsRegister(node),
+                 g.UseRegister(mleft.left().node()), g.TempImmediate(sh),
+                 g.TempImmediate(mask));
+            return;
+          }
         }
       }
     }
+    VisitWord64BinOp(this, node, kS390_ShiftRight64, Shift64OperandMode);
   }
-  VisitWord64BinOp(this, node, kS390_ShiftRight64, Shift64OperandMode);
 }
 #endif
 
+template <typename Adapter>
 static inline bool TryMatchSignExtInt16OrInt8FromWord32Sar(
-    InstructionSelector* selector, Node* node) {
-  S390OperandGenerator g(selector);
+    InstructionSelectorT<Adapter>* selector, Node* node) {
+  S390OperandGeneratorT<Adapter> g(selector);
   Int32BinopMatcher m(node);
   if (selector->CanCover(node, m.left().node()) && m.left().IsWord32Shl()) {
     Int32BinopMatcher mleft(m.left().node());
@@ -1067,70 +1146,109 @@ static inline bool TryMatchSignExtInt16OrInt8FromWord32Sar(
   return false;
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64Rol(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Rol(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord32Ctz(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ctz(node_t node) {
+  UNREACHABLE();
+}
 
 #if V8_TARGET_ARCH_S390X
-void InstructionSelector::VisitWord64Ctz(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ctz(node_t node) {
+  UNREACHABLE();
+}
 #endif
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
 #if V8_TARGET_ARCH_S390X
-void InstructionSelector::VisitWord64ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 #endif
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
-  VisitWord32UnaryOp(this, node, kS390_Abs32, OperandMode::kNone);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord32UnaryOp(this, node, kS390_Abs32, OperandMode::kNone);
+  }
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
-  VisitWord64UnaryOp(this, node, kS390_Abs64, OperandMode::kNone);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWord64UnaryOp(this, node, kS390_Abs64, OperandMode::kNone);
+  }
 }
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) {
-  S390OperandGenerator g(this);
-  NodeMatcher input(node->InputAt(0));
-  if (CanCover(node, input.node()) && input.IsLoad()) {
-    LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
-    if (load_rep.representation() == MachineRepresentation::kWord64) {
-      Node* base = input.node()->InputAt(0);
-      Node* offset = input.node()->InputAt(1);
-      Emit(kS390_LoadReverse64 | AddressingModeField::encode(kMode_MRR),
-           // TODO(miladfarca): one of the base and offset can be imm.
-           g.DefineAsRegister(node), g.UseRegister(base),
-           g.UseRegister(offset));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    NodeMatcher input(node->InputAt(0));
+    if (CanCover(node, input.node()) && input.IsLoad()) {
+      LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
+      if (load_rep.representation() == MachineRepresentation::kWord64) {
+        Node* base = input.node()->InputAt(0);
+        Node* offset = input.node()->InputAt(1);
+        Emit(kS390_LoadReverse64 | AddressingModeField::encode(kMode_MRR),
+             // TODO(miladfarca): one of the base and offset can be imm.
+             g.DefineAsRegister(node), g.UseRegister(base),
+             g.UseRegister(offset));
+        return;
+      }
     }
+    Emit(kS390_LoadReverse64RR, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
   }
-  Emit(kS390_LoadReverse64RR, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
-  S390OperandGenerator g(this);
-  NodeMatcher input(node->InputAt(0));
-  if (CanCover(node, input.node()) && input.IsLoad()) {
-    LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
-    if (load_rep.representation() == MachineRepresentation::kWord32) {
-      Node* base = input.node()->InputAt(0);
-      Node* offset = input.node()->InputAt(1);
-      Emit(kS390_LoadReverse32 | AddressingModeField::encode(kMode_MRR),
-           // TODO(john.yan): one of the base and offset can be imm.
-           g.DefineAsRegister(node), g.UseRegister(base),
-           g.UseRegister(offset));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    NodeMatcher input(node->InputAt(0));
+    if (CanCover(node, input.node()) && input.IsLoad()) {
+      LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
+      if (load_rep.representation() == MachineRepresentation::kWord32) {
+        Node* base = input.node()->InputAt(0);
+        Node* offset = input.node()->InputAt(1);
+        Emit(kS390_LoadReverse32 | AddressingModeField::encode(kMode_MRR),
+             // TODO(john.yan): one of the base and offset can be imm.
+             g.DefineAsRegister(node), g.UseRegister(base),
+             g.UseRegister(offset));
+        return;
+      }
     }
+    Emit(kS390_LoadReverse32RR, g.DefineAsRegister(node),
+         g.UseRegister(node->InputAt(0)));
   }
-  Emit(kS390_LoadReverse32RR, g.DefineAsRegister(node),
-       g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
+  S390OperandGeneratorT<Adapter> g(this);
   NodeMatcher input(node->InputAt(0));
   if (CanCover(node, input.node()) && input.IsLoad()) {
     LoadRepresentation load_rep = LoadRepresentationOf(input.node()->op());
@@ -1148,10 +1266,10 @@ void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
        g.UseRegister(node->InputAt(0)));
 }
 
-template <class Matcher, ArchOpcode neg_opcode>
-static inline bool TryMatchNegFromSub(InstructionSelector* selector,
+template <typename Adapter, class Matcher, ArchOpcode neg_opcode>
+static inline bool TryMatchNegFromSub(InstructionSelectorT<Adapter>* selector,
                                       Node* node) {
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   Matcher m(node);
   static_assert(neg_opcode == kS390_Neg32 || neg_opcode == kS390_Neg64,
                 "Provided opcode is not a Neg opcode.");
@@ -1174,9 +1292,9 @@ static inline bool TryMatchNegFromSub(InstructionSelector* selector,
   return false;
 }
 
-template <class Matcher, ArchOpcode shift_op>
-bool TryMatchShiftFromMul(InstructionSelector* selector, Node* node) {
-  S390OperandGenerator g(selector);
+template <typename Adapter, class Matcher, ArchOpcode shift_op>
+bool TryMatchShiftFromMul(InstructionSelectorT<Adapter>* selector, Node* node) {
+  S390OperandGeneratorT<Adapter> g(selector);
   Matcher m(node);
   Node* left = m.left().node();
   Node* right = m.right().node();
@@ -1201,74 +1319,95 @@ bool TryMatchShiftFromMul(InstructionSelector* selector, Node* node) {
   return false;
 }
 
-template <ArchOpcode opcode>
-static inline bool TryMatchInt32OpWithOverflow(InstructionSelector* selector,
-                                               Node* node, OperandModes mode) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    VisitWord32BinOp(selector, node, opcode, mode, &cont);
-    return true;
+template <typename Adapter, ArchOpcode opcode>
+static inline bool TryMatchInt32OpWithOverflow(
+    InstructionSelectorT<Adapter>* selector, Node* node, OperandModes mode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuationT<Adapter> cont =
+          FlagsContinuationT<Adapter>::ForSet(kOverflow, ovf);
+      VisitWord32BinOp(selector, node, opcode, mode, &cont);
+      return true;
+    }
+    return false;
   }
-  return false;
 }
 
-static inline bool TryMatchInt32AddWithOverflow(InstructionSelector* selector,
-                                                Node* node) {
-  return TryMatchInt32OpWithOverflow<kS390_Add32>(selector, node,
-                                                  AddOperandMode);
+template <typename Adapter>
+static inline bool TryMatchInt32AddWithOverflow(
+    InstructionSelectorT<Adapter>* selector, Node* node) {
+  return TryMatchInt32OpWithOverflow<Adapter, kS390_Add32>(selector, node,
+                                                           AddOperandMode);
 }
 
-static inline bool TryMatchInt32SubWithOverflow(InstructionSelector* selector,
-                                                Node* node) {
-  return TryMatchInt32OpWithOverflow<kS390_Sub32>(selector, node,
-                                                  SubOperandMode);
+template <typename Adapter>
+static inline bool TryMatchInt32SubWithOverflow(
+    InstructionSelectorT<Adapter>* selector, Node* node) {
+  return TryMatchInt32OpWithOverflow<Adapter, kS390_Sub32>(selector, node,
+                                                           SubOperandMode);
 }
 
-static inline bool TryMatchInt32MulWithOverflow(InstructionSelector* selector,
-                                                Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    if (CpuFeatures::IsSupported(MISC_INSTR_EXT2)) {
-      TryMatchInt32OpWithOverflow<kS390_Mul32>(
-          selector, node, OperandMode::kAllowRRR | OperandMode::kAllowRM);
-    } else {
-      FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, ovf);
-      VisitWord32BinOp(selector, node, kS390_Mul32WithOverflow,
-                       OperandMode::kInt32Imm | OperandMode::kAllowDistinctOps,
-                       &cont);
+template <typename Adapter>
+static inline bool TryMatchInt32MulWithOverflow(
+    InstructionSelectorT<Adapter>* selector, Node* node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      if (CpuFeatures::IsSupported(MISC_INSTR_EXT2)) {
+        TryMatchInt32OpWithOverflow<Adapter, kS390_Mul32>(
+            selector, node, OperandMode::kAllowRRR | OperandMode::kAllowRM);
+      } else {
+        FlagsContinuationT<Adapter> cont =
+            FlagsContinuationT<Adapter>::ForSet(kNotEqual, ovf);
+        VisitWord32BinOp(
+            selector, node, kS390_Mul32WithOverflow,
+            OperandMode::kInt32Imm | OperandMode::kAllowDistinctOps, &cont);
+      }
+      return true;
     }
-    return true;
+    return TryMatchShiftFromMul<Adapter, Int32BinopMatcher, kS390_ShiftLeft32>(
+        selector, node);
   }
-  return TryMatchShiftFromMul<Int32BinopMatcher, kS390_ShiftLeft32>(selector,
-                                                                    node);
 }
 
 #if V8_TARGET_ARCH_S390X
-template <ArchOpcode opcode>
-static inline bool TryMatchInt64OpWithOverflow(InstructionSelector* selector,
-                                               Node* node, OperandModes mode) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
-    VisitWord64BinOp(selector, node, opcode, mode, &cont);
-    return true;
+template <typename Adapter, ArchOpcode opcode>
+static inline bool TryMatchInt64OpWithOverflow(
+    InstructionSelectorT<Adapter>* selector, Node* node, OperandModes mode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuationT<Adapter> cont =
+          FlagsContinuationT<Adapter>::ForSet(kOverflow, ovf);
+      VisitWord64BinOp(selector, node, opcode, mode, &cont);
+      return true;
+    }
+    return false;
   }
-  return false;
 }
 
-static inline bool TryMatchInt64AddWithOverflow(InstructionSelector* selector,
-                                                Node* node) {
-  return TryMatchInt64OpWithOverflow<kS390_Add64>(selector, node,
-                                                  AddOperandMode);
+template <typename Adapter>
+static inline bool TryMatchInt64AddWithOverflow(
+    InstructionSelectorT<Adapter>* selector, Node* node) {
+  return TryMatchInt64OpWithOverflow<Adapter, kS390_Add64>(selector, node,
+                                                           AddOperandMode);
 }
 
-static inline bool TryMatchInt64SubWithOverflow(InstructionSelector* selector,
-                                                Node* node) {
-  return TryMatchInt64OpWithOverflow<kS390_Sub64>(selector, node,
-                                                  SubOperandMode);
+template <typename Adapter>
+static inline bool TryMatchInt64SubWithOverflow(
+    InstructionSelectorT<Adapter>* selector, Node* node) {
+  return TryMatchInt64OpWithOverflow<Adapter, kS390_Sub64>(selector, node,
+                                                           SubOperandMode);
 }
 
-void EmitInt64MulWithOverflow(InstructionSelector* selector, Node* node,
-                              FlagsContinuation* cont) {
-  S390OperandGenerator g(selector);
+template <typename Adapter>
+void EmitInt64MulWithOverflow(InstructionSelectorT<Adapter>* selector,
+                              Node* node, FlagsContinuationT<Adapter>* cont) {
+  S390OperandGeneratorT<Adapter> g(selector);
   Int64BinopMatcher m(node);
   InstructionOperand inputs[2];
   size_t input_count = 0;
@@ -1284,9 +1423,10 @@ void EmitInt64MulWithOverflow(InstructionSelector* selector, Node* node,
 
 #endif
 
+template <typename Adapter>
 static inline bool TryMatchDoubleConstructFromInsert(
-    InstructionSelector* selector, Node* node) {
-  S390OperandGenerator g(selector);
+    InstructionSelectorT<Adapter>* selector, Node* node) {
+  S390OperandGeneratorT<Adapter> g(selector);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
   Node* lo32 = nullptr;
@@ -1316,311 +1456,359 @@ static inline bool TryMatchDoubleConstructFromInsert(
 }
 
 #define null ([]() { return false; })
-// TODO(john.yan): place kAllowRM where available
-#define FLOAT_UNARY_OP_LIST_32(V)                                              \
-  V(Float32, ChangeFloat32ToFloat64, kS390_Float32ToDouble,                    \
-    OperandMode::kAllowRM, null)                                               \
-  V(Float32, BitcastFloat32ToInt32, kS390_BitcastFloat32ToInt32,               \
-    OperandMode::kAllowRM, null)                                               \
-  V(Float64, TruncateFloat64ToFloat32, kS390_DoubleToFloat32,                  \
-    OperandMode::kNone, null)                                                  \
-  V(Float64, TruncateFloat64ToWord32, kArchTruncateDoubleToI,                  \
-    OperandMode::kNone, null)                                                  \
-  V(Float64, RoundFloat64ToInt32, kS390_DoubleToInt32, OperandMode::kNone,     \
-    null)                                                                      \
+
+#define FLOAT_UNARY_OP_LIST(V)                                                 \
   V(Float64, TruncateFloat64ToUint32, kS390_DoubleToUint32,                    \
     OperandMode::kNone, null)                                                  \
-  V(Float64, ChangeFloat64ToInt32, kS390_DoubleToInt32, OperandMode::kNone,    \
-    null)                                                                      \
-  V(Float64, ChangeFloat64ToUint32, kS390_DoubleToUint32, OperandMode::kNone,  \
-    null)                                                                      \
   V(Float64, Float64SilenceNaN, kS390_Float64SilenceNaN, OperandMode::kNone,   \
     null)                                                                      \
-  V(Float32, Float32Abs, kS390_AbsFloat, OperandMode::kNone, null)             \
-  V(Float64, Float64Abs, kS390_AbsDouble, OperandMode::kNone, null)            \
-  V(Float32, Float32Sqrt, kS390_SqrtFloat, OperandMode::kNone, null)           \
   V(Float64, Float64Sqrt, kS390_SqrtDouble, OperandMode::kNone, null)          \
-  V(Float32, Float32RoundDown, kS390_FloorFloat, OperandMode::kNone, null)     \
-  V(Float64, Float64RoundDown, kS390_FloorDouble, OperandMode::kNone, null)    \
-  V(Float32, Float32RoundUp, kS390_CeilFloat, OperandMode::kNone, null)        \
   V(Float64, Float64RoundUp, kS390_CeilDouble, OperandMode::kNone, null)       \
-  V(Float32, Float32RoundTruncate, kS390_TruncateFloat, OperandMode::kNone,    \
-    null)                                                                      \
   V(Float64, Float64RoundTruncate, kS390_TruncateDouble, OperandMode::kNone,   \
     null)                                                                      \
+  V(Float64, Float64RoundTiesEven, kS390_DoubleNearestInt, OperandMode::kNone, \
+    null)                                                                      \
   V(Float64, Float64RoundTiesAway, kS390_RoundDouble, OperandMode::kNone,      \
     null)                                                                      \
-  V(Float32, Float32RoundTiesEven, kS390_FloatNearestInt, OperandMode::kNone,  \
+  V(Float64, Float64RoundDown, kS390_FloorDouble, OperandMode::kNone, null)    \
+  V(Float64, Float64Neg, kS390_NegDouble, OperandMode::kNone, null)            \
+  V(Float64, Float64Abs, kS390_AbsDouble, OperandMode::kNone, null)            \
+  V(Float32, Float32Sqrt, kS390_SqrtFloat, OperandMode::kNone, null)           \
+  V(Float32, Float32RoundUp, kS390_CeilFloat, OperandMode::kNone, null)        \
+  V(Float32, Float32RoundTruncate, kS390_TruncateFloat, OperandMode::kNone,    \
     null)                                                                      \
-  V(Float64, Float64RoundTiesEven, kS390_DoubleNearestInt, OperandMode::kNone, \
+  V(Float32, Float32RoundTiesEven, kS390_FloatNearestInt, OperandMode::kNone,  \
     null)                                                                      \
+  V(Float32, Float32RoundDown, kS390_FloorFloat, OperandMode::kNone, null)     \
   V(Float32, Float32Neg, kS390_NegFloat, OperandMode::kNone, null)             \
-  V(Float64, Float64Neg, kS390_NegDouble, OperandMode::kNone, null)            \
+  V(Float32, Float32Abs, kS390_AbsFloat, OperandMode::kNone, null)             \
+  V(Float64, BitcastFloat64ToInt64, kS390_BitcastDoubleToInt64,                \
+    OperandMode::kNone, null)                                                  \
+  V(Float32, BitcastFloat32ToInt32, kS390_BitcastFloat32ToInt32,               \
+    OperandMode::kAllowRM, null)                                               \
+  V(Word32, Float64ExtractHighWord32, kS390_DoubleExtractHighWord32,           \
+    OperandMode::kNone, null)                                                  \
   /* TODO(john.yan): can use kAllowRM */                                       \
   V(Word32, Float64ExtractLowWord32, kS390_DoubleExtractLowWord32,             \
     OperandMode::kNone, null)                                                  \
-  V(Word32, Float64ExtractHighWord32, kS390_DoubleExtractHighWord32,           \
-    OperandMode::kNone, null)
+  V(Float64, ChangeFloat64ToUint64, kS390_DoubleToUint64, OperandMode::kNone,  \
+    null)                                                                      \
+  V(Float64, ChangeFloat64ToInt64, kS390_DoubleToInt64, OperandMode::kNone,    \
+    null)                                                                      \
+  V(Float64, ChangeFloat64ToUint32, kS390_DoubleToUint32, OperandMode::kNone,  \
+    null)                                                                      \
+  V(Float64, ChangeFloat64ToInt32, kS390_DoubleToInt32, OperandMode::kNone,    \
+    null)                                                                      \
+  V(Float64, TruncateFloat64ToInt64, kS390_DoubleToInt64, OperandMode::kNone,  \
+    null)                                                                      \
+  V(Float64, TruncateFloat64ToFloat32, kS390_DoubleToFloat32,                  \
+    OperandMode::kNone, null)                                                  \
+  V(Float64, TruncateFloat64ToWord32, kArchTruncateDoubleToI,                  \
+    OperandMode::kNone, null)                                                  \
+  V(Float32, ChangeFloat32ToFloat64, kS390_Float32ToDouble,                    \
+    OperandMode::kAllowRM, null)                                               \
+  V(Float64, RoundFloat64ToInt32, kS390_DoubleToInt32, OperandMode::kNone, null)
 
 #define FLOAT_BIN_OP_LIST(V)                                           \
-  V(Float32, Float32Add, kS390_AddFloat, OperandMode::kAllowRM, null)  \
-  V(Float64, Float64Add, kS390_AddDouble, OperandMode::kAllowRM, null) \
-  V(Float32, Float32Sub, kS390_SubFloat, OperandMode::kAllowRM, null)  \
-  V(Float64, Float64Sub, kS390_SubDouble, OperandMode::kAllowRM, null) \
-  V(Float32, Float32Mul, kS390_MulFloat, OperandMode::kAllowRM, null)  \
   V(Float64, Float64Mul, kS390_MulDouble, OperandMode::kAllowRM, null) \
-  V(Float32, Float32Div, kS390_DivFloat, OperandMode::kAllowRM, null)  \
-  V(Float64, Float64Div, kS390_DivDouble, OperandMode::kAllowRM, null) \
-  V(Float32, Float32Max, kS390_MaxFloat, OperandMode::kNone, null)     \
+  V(Float64, Float64Add, kS390_AddDouble, OperandMode::kAllowRM, null) \
+  V(Float64, Float64Min, kS390_MinDouble, OperandMode::kNone, null)    \
   V(Float64, Float64Max, kS390_MaxDouble, OperandMode::kNone, null)    \
   V(Float32, Float32Min, kS390_MinFloat, OperandMode::kNone, null)     \
-  V(Float64, Float64Min, kS390_MinDouble, OperandMode::kNone, null)
+  V(Float32, Float32Max, kS390_MaxFloat, OperandMode::kNone, null)     \
+  V(Float32, Float32Div, kS390_DivFloat, OperandMode::kAllowRM, null)  \
+  V(Float32, Float32Mul, kS390_MulFloat, OperandMode::kAllowRM, null)  \
+  V(Float32, Float32Sub, kS390_SubFloat, OperandMode::kAllowRM, null)  \
+  V(Float32, Float32Add, kS390_AddFloat, OperandMode::kAllowRM, null)  \
+  V(Float64, Float64Sub, kS390_SubDouble, OperandMode::kAllowRM, null) \
+  V(Float64, Float64Div, kS390_DivDouble, OperandMode::kAllowRM, null)
 
-#define WORD32_UNARY_OP_LIST_32(V)                                           \
-  V(Word32, Word32Clz, kS390_Cntlz32, OperandMode::kNone, null)              \
+#define WORD32_UNARY_OP_LIST(V)                                              \
+  V(Word32, SignExtendWord32ToInt64, kS390_SignExtendWord32ToInt64,          \
+    OperandMode::kNone, null)                                                \
+  V(Word32, SignExtendWord16ToInt64, kS390_SignExtendWord16ToInt64,          \
+    OperandMode::kNone, null)                                                \
+  V(Word32, SignExtendWord8ToInt64, kS390_SignExtendWord8ToInt64,            \
+    OperandMode::kNone, null)                                                \
+  V(Word32, SignExtendWord16ToInt32, kS390_SignExtendWord16ToInt32,          \
+    OperandMode::kNone, null)                                                \
+  V(Word32, SignExtendWord8ToInt32, kS390_SignExtendWord8ToInt32,            \
+    OperandMode::kNone, null)                                                \
   V(Word32, Word32Popcnt, kS390_Popcnt32, OperandMode::kNone, null)          \
-  V(Word32, RoundInt32ToFloat32, kS390_Int32ToFloat32, OperandMode::kNone,   \
+  V(Word32, Word32Clz, kS390_Cntlz32, OperandMode::kNone, null)              \
+  V(Word32, BitcastInt32ToFloat32, kS390_BitcastInt32ToFloat32,              \
+    OperandMode::kNone, null)                                                \
+  V(Word32, ChangeUint32ToFloat64, kS390_Uint32ToDouble, OperandMode::kNone, \
     null)                                                                    \
   V(Word32, RoundUint32ToFloat32, kS390_Uint32ToFloat32, OperandMode::kNone, \
     null)                                                                    \
-  V(Word32, ChangeInt32ToFloat64, kS390_Int32ToDouble, OperandMode::kNone,   \
+  V(Word32, RoundInt32ToFloat32, kS390_Int32ToFloat32, OperandMode::kNone,   \
     null)                                                                    \
-  V(Word32, ChangeUint32ToFloat64, kS390_Uint32ToDouble, OperandMode::kNone, \
+  V(Word32, ChangeInt32ToFloat64, kS390_Int32ToDouble, OperandMode::kNone,   \
     null)                                                                    \
-  V(Word32, SignExtendWord8ToInt32, kS390_SignExtendWord8ToInt32,            \
+  V(Word32, ChangeInt32ToInt64, kS390_SignExtendWord32ToInt64,               \
     OperandMode::kNone, null)                                                \
-  V(Word32, SignExtendWord16ToInt32, kS390_SignExtendWord16ToInt32,          \
-    OperandMode::kNone, null)                                                \
-  V(Word32, BitcastInt32ToFloat32, kS390_BitcastInt32ToFloat32,              \
-    OperandMode::kNone, null)
-
-#ifdef V8_TARGET_ARCH_S390X
-#define FLOAT_UNARY_OP_LIST(V)                                                \
-  FLOAT_UNARY_OP_LIST_32(V)                                                   \
-  V(Float64, ChangeFloat64ToUint64, kS390_DoubleToUint64, OperandMode::kNone, \
-    null)                                                                     \
-  V(Float64, ChangeFloat64ToInt64, kS390_DoubleToInt64, OperandMode::kNone,   \
-    null)                                                                     \
-  V(Float64, TruncateFloat64ToInt64, kS390_DoubleToInt64, OperandMode::kNone, \
-    null)                                                                     \
-  V(Float64, BitcastFloat64ToInt64, kS390_BitcastDoubleToInt64,               \
-    OperandMode::kNone, null)
-
-#define WORD32_UNARY_OP_LIST(V)                                             \
-  WORD32_UNARY_OP_LIST_32(V)                                                \
-  V(Word32, ChangeInt32ToInt64, kS390_SignExtendWord32ToInt64,              \
-    OperandMode::kNone, null)                                               \
-  V(Word32, SignExtendWord8ToInt64, kS390_SignExtendWord8ToInt64,           \
-    OperandMode::kNone, null)                                               \
-  V(Word32, SignExtendWord16ToInt64, kS390_SignExtendWord16ToInt64,         \
-    OperandMode::kNone, null)                                               \
-  V(Word32, SignExtendWord32ToInt64, kS390_SignExtendWord32ToInt64,         \
-    OperandMode::kNone, null)                                               \
-  V(Word32, ChangeUint32ToUint64, kS390_Uint32ToUint64, OperandMode::kNone, \
-    [&]() -> bool {                                                         \
-      if (ProduceWord32Result(node->InputAt(0))) {                          \
-        EmitIdentity(node);                                                 \
-        return true;                                                        \
-      }                                                                     \
-      return false;                                                         \
+  V(Word32, ChangeUint32ToUint64, kS390_Uint32ToUint64, OperandMode::kNone,  \
+    [&]() -> bool {                                                          \
+      if (ProduceWord32Result(node->InputAt(0))) {                           \
+        EmitIdentity(node);                                                  \
+        return true;                                                         \
+      }                                                                      \
+      return false;                                                          \
     })
 
-#else
-#define FLOAT_UNARY_OP_LIST(V) FLOAT_UNARY_OP_LIST_32(V)
-#define WORD32_UNARY_OP_LIST(V) WORD32_UNARY_OP_LIST_32(V)
-#endif
-
-#define WORD32_BIN_OP_LIST(V)                                                  \
-  V(Word32, Int32Add, kS390_Add32, AddOperandMode, null)                       \
-  V(Word32, Int32Sub, kS390_Sub32, SubOperandMode, ([&]() {                    \
-      return TryMatchNegFromSub<Int32BinopMatcher, kS390_Neg32>(this, node);   \
-    }))                                                                        \
-  V(Word32, Int32Mul, kS390_Mul32, MulOperandMode, ([&]() {                    \
-      return TryMatchShiftFromMul<Int32BinopMatcher, kS390_ShiftLeft32>(this,  \
-                                                                        node); \
-    }))                                                                        \
-  V(Word32, Int32AddWithOverflow, kS390_Add32, AddOperandMode,                 \
-    ([&]() { return TryMatchInt32AddWithOverflow(this, node); }))              \
-  V(Word32, Int32SubWithOverflow, kS390_Sub32, SubOperandMode,                 \
-    ([&]() { return TryMatchInt32SubWithOverflow(this, node); }))              \
-  V(Word32, Int32MulWithOverflow, kS390_Mul32, MulOperandMode,                 \
-    ([&]() { return TryMatchInt32MulWithOverflow(this, node); }))              \
-  V(Word32, Int32MulHigh, kS390_MulHigh32,                                     \
-    OperandMode::kInt32Imm | OperandMode::kAllowDistinctOps, null)             \
-  V(Word32, Uint32MulHigh, kS390_MulHighU32,                                   \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word32, Int32Div, kS390_Div32,                                             \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word32, Uint32Div, kS390_DivU32,                                           \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word32, Int32Mod, kS390_Mod32,                                             \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word32, Uint32Mod, kS390_ModU32,                                           \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word32, Word32Ror, kS390_RotRight32,                                       \
-    OperandMode::kAllowRI | OperandMode::kAllowRRR | OperandMode::kAllowRRI |  \
-        OperandMode::kShift32Imm,                                              \
-    null)                                                                      \
-  V(Word32, Word32And, kS390_And32, And32OperandMode, null)                    \
-  V(Word32, Word32Or, kS390_Or32, Or32OperandMode, null)                       \
-  V(Word32, Word32Xor, kS390_Xor32, Xor32OperandMode, null)                    \
-  V(Word32, Word32Shl, kS390_ShiftLeft32, Shift32OperandMode, null)            \
-  V(Word32, Word32Shr, kS390_ShiftRight32, Shift32OperandMode, null)           \
-  V(Word32, Word32Sar, kS390_ShiftRightArith32, Shift32OperandMode,            \
-    [&]() { return TryMatchSignExtInt16OrInt8FromWord32Sar(this, node); })     \
-  V(Word32, Float64InsertLowWord32, kS390_DoubleInsertLowWord32,               \
-    OperandMode::kAllowRRR,                                                    \
-    [&]() -> bool { return TryMatchDoubleConstructFromInsert(this, node); })   \
-  V(Word32, Float64InsertHighWord32, kS390_DoubleInsertHighWord32,             \
-    OperandMode::kAllowRRR,                                                    \
-    [&]() -> bool { return TryMatchDoubleConstructFromInsert(this, node); })
+#define WORD32_BIN_OP_LIST(V)                                                 \
+  V(Word32, Float64InsertHighWord32, kS390_DoubleInsertHighWord32,            \
+    OperandMode::kAllowRRR,                                                   \
+    [&]() -> bool { return TryMatchDoubleConstructFromInsert(this, node); })  \
+  V(Word32, Float64InsertLowWord32, kS390_DoubleInsertLowWord32,              \
+    OperandMode::kAllowRRR,                                                   \
+    [&]() -> bool { return TryMatchDoubleConstructFromInsert(this, node); })  \
+  V(Word32, Int32SubWithOverflow, kS390_Sub32, SubOperandMode,                \
+    ([&]() { return TryMatchInt32SubWithOverflow(this, node); }))             \
+  V(Word32, Uint32MulHigh, kS390_MulHighU32,                                  \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                    \
+  V(Word32, Uint32Mod, kS390_ModU32,                                          \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                    \
+  V(Word32, Uint32Div, kS390_DivU32,                                          \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                    \
+  V(Word32, Int32Mod, kS390_Mod32,                                            \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                    \
+  V(Word32, Int32Div, kS390_Div32,                                            \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                    \
+  V(Word32, Int32Mul, kS390_Mul32, MulOperandMode, ([&]() {                   \
+      return TryMatchShiftFromMul<Adapter, Int32BinopMatcher,                 \
+                                  kS390_ShiftLeft32>(this, node);             \
+    }))                                                                       \
+  V(Word32, Int32MulHigh, kS390_MulHigh32,                                    \
+    OperandMode::kInt32Imm | OperandMode::kAllowDistinctOps, null)            \
+  V(Word32, Int32Sub, kS390_Sub32, SubOperandMode, ([&]() {                   \
+      return TryMatchNegFromSub<Adapter, Int32BinopMatcher, kS390_Neg32>(     \
+          this, node);                                                        \
+    }))                                                                       \
+  V(Word32, Int32Add, kS390_Add32, AddOperandMode, null)                      \
+  V(Word32, Word32Xor, kS390_Xor32, Xor32OperandMode, null)                   \
+  V(Word32, Word32Ror, kS390_RotRight32,                                      \
+    OperandMode::kAllowRI | OperandMode::kAllowRRR | OperandMode::kAllowRRI | \
+        OperandMode::kShift32Imm,                                             \
+    null)                                                                     \
+  V(Word32, Word32Shr, kS390_ShiftRight32, Shift32OperandMode, null)          \
+  V(Word32, Word32Shl, kS390_ShiftLeft32, Shift32OperandMode, null)           \
+  V(Word32, Int32AddWithOverflow, kS390_Add32, AddOperandMode,                \
+    ([&]() { return TryMatchInt32AddWithOverflow(this, node); }))             \
+  V(Word32, Int32MulWithOverflow, kS390_Mul32, MulOperandMode,                \
+    ([&]() { return TryMatchInt32MulWithOverflow(this, node); }))             \
+  V(Word32, Word32And, kS390_And32, And32OperandMode, null)                   \
+  V(Word32, Word32Or, kS390_Or32, Or32OperandMode, null)                      \
+  V(Word32, Word32Sar, kS390_ShiftRightArith32, Shift32OperandMode,           \
+    [&]() { return TryMatchSignExtInt16OrInt8FromWord32Sar(this, node); })
 
 #define WORD64_UNARY_OP_LIST(V)                                              \
-  V(Word64, Word64Popcnt, kS390_Popcnt64, OperandMode::kNone, null)          \
-  V(Word64, Word64Clz, kS390_Cntlz64, OperandMode::kNone, null)              \
   V(Word64, TruncateInt64ToInt32, kS390_Int64ToInt32, OperandMode::kNone,    \
     null)                                                                    \
-  V(Word64, RoundInt64ToFloat32, kS390_Int64ToFloat32, OperandMode::kNone,   \
-    null)                                                                    \
-  V(Word64, RoundInt64ToFloat64, kS390_Int64ToDouble, OperandMode::kNone,    \
-    null)                                                                    \
+  V(Word64, Word64Clz, kS390_Cntlz64, OperandMode::kNone, null)              \
+  V(Word64, Word64Popcnt, kS390_Popcnt64, OperandMode::kNone, null)          \
+  V(Word64, Int64SubWithOverflow, kS390_Sub64, SubOperandMode,               \
+    ([&]() { return TryMatchInt64SubWithOverflow(this, node); }))            \
+  V(Word64, BitcastInt64ToFloat64, kS390_BitcastInt64ToDouble,               \
+    OperandMode::kNone, null)                                                \
   V(Word64, ChangeInt64ToFloat64, kS390_Int64ToDouble, OperandMode::kNone,   \
     null)                                                                    \
+  V(Word64, RoundUint64ToFloat64, kS390_Uint64ToDouble, OperandMode::kNone,  \
+    null)                                                                    \
   V(Word64, RoundUint64ToFloat32, kS390_Uint64ToFloat32, OperandMode::kNone, \
     null)                                                                    \
-  V(Word64, RoundUint64ToFloat64, kS390_Uint64ToDouble, OperandMode::kNone,  \
+  V(Word64, RoundInt64ToFloat32, kS390_Int64ToFloat32, OperandMode::kNone,   \
     null)                                                                    \
-  V(Word64, BitcastInt64ToFloat64, kS390_BitcastInt64ToDouble,               \
-    OperandMode::kNone, null)
-
-#define WORD64_BIN_OP_LIST(V)                                                  \
-  V(Word64, Int64Add, kS390_Add64, AddOperandMode, null)                       \
-  V(Word64, Int64MulHigh, kS390_MulHighS64, OperandMode::kAllowRRR, null)      \
-  V(Word64, Uint64MulHigh, kS390_MulHighU64, OperandMode::kAllowRRR, null)     \
-  V(Word64, Int64Sub, kS390_Sub64, SubOperandMode, ([&]() {                    \
-      return TryMatchNegFromSub<Int64BinopMatcher, kS390_Neg64>(this, node);   \
-    }))                                                                        \
-  V(Word64, Int64AddWithOverflow, kS390_Add64, AddOperandMode,                 \
-    ([&]() { return TryMatchInt64AddWithOverflow(this, node); }))              \
-  V(Word64, Int64SubWithOverflow, kS390_Sub64, SubOperandMode,                 \
-    ([&]() { return TryMatchInt64SubWithOverflow(this, node); }))              \
-  V(Word64, Int64Mul, kS390_Mul64, MulOperandMode, ([&]() {                    \
-      return TryMatchShiftFromMul<Int64BinopMatcher, kS390_ShiftLeft64>(this,  \
-                                                                        node); \
-    }))                                                                        \
-  V(Word64, Int64Div, kS390_Div64,                                             \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word64, Uint64Div, kS390_DivU64,                                           \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word64, Int64Mod, kS390_Mod64,                                             \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word64, Uint64Mod, kS390_ModU64,                                           \
-    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                     \
-  V(Word64, Word64Sar, kS390_ShiftRightArith64, Shift64OperandMode, null)      \
-  V(Word64, Word64Ror, kS390_RotRight64, Shift64OperandMode, null)             \
-  V(Word64, Word64Or, kS390_Or64, Or64OperandMode, null)                       \
-  V(Word64, Word64Xor, kS390_Xor64, Xor64OperandMode, null)
-
-#define DECLARE_UNARY_OP(type, name, op, mode, try_extra) \
-  void InstructionSelector::Visit##name(Node* node) {     \
-    if (std::function<bool()>(try_extra)()) return;       \
-    Visit##type##UnaryOp(this, node, op, mode);           \
-  }
-
-#define DECLARE_BIN_OP(type, name, op, mode, try_extra) \
-  void InstructionSelector::Visit##name(Node* node) {   \
-    if (std::function<bool()>(try_extra)()) return;     \
-    Visit##type##BinOp(this, node, op, mode);           \
+  V(Word64, RoundInt64ToFloat64, kS390_Int64ToDouble, OperandMode::kNone, null)
+
+#define WORD64_BIN_OP_LIST(V)                                              \
+  V(Word64, Int64AddWithOverflow, kS390_Add64, AddOperandMode,             \
+    ([&]() { return TryMatchInt64AddWithOverflow(this, node); }))          \
+  V(Word64, Uint64MulHigh, kS390_MulHighU64, OperandMode::kAllowRRR, null) \
+  V(Word64, Uint64Mod, kS390_ModU64,                                       \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                 \
+  V(Word64, Uint64Div, kS390_DivU64,                                       \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                 \
+  V(Word64, Int64Mod, kS390_Mod64,                                         \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                 \
+  V(Word64, Int64Div, kS390_Div64,                                         \
+    OperandMode::kAllowRRM | OperandMode::kAllowRRR, null)                 \
+  V(Word64, Int64MulHigh, kS390_MulHighS64, OperandMode::kAllowRRR, null)  \
+  V(Word64, Int64Mul, kS390_Mul64, MulOperandMode, ([&]() {                \
+      return TryMatchShiftFromMul<Adapter, Int64BinopMatcher,              \
+                                  kS390_ShiftLeft64>(this, node);          \
+    }))                                                                    \
+  V(Word64, Int64Sub, kS390_Sub64, SubOperandMode, ([&]() {                \
+      return TryMatchNegFromSub<Adapter, Int64BinopMatcher, kS390_Neg64>(  \
+          this, node);                                                     \
+    }))                                                                    \
+  V(Word64, Word64Xor, kS390_Xor64, Xor64OperandMode, null)                \
+  V(Word64, Word64Or, kS390_Or64, Or64OperandMode, null)                   \
+  V(Word64, Word64Ror, kS390_RotRight64, Shift64OperandMode, null)         \
+  V(Word64, Int64Add, kS390_Add64, AddOperandMode, null)                   \
+  V(Word64, Word64Sar, kS390_ShiftRightArith64, Shift64OperandMode, null)
+
+#define DECLARE_UNARY_OP(type, name, op, mode, try_extra)        \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##name(node_t node) { \
+    if constexpr (Adapter::IsTurboshaft) {                       \
+      UNIMPLEMENTED();                                           \
+    } else {                                                     \
+      if (std::function<bool()>(try_extra)()) return;            \
+      Visit##type##UnaryOp(this, node, op, mode);                \
+    }                                                            \
+  }
+
+#define DECLARE_BIN_OP(type, name, op, mode, try_extra)          \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##name(node_t node) { \
+    if constexpr (Adapter::IsTurboshaft) {                       \
+      UNIMPLEMENTED();                                           \
+    } else {                                                     \
+      if (std::function<bool()>(try_extra)()) return;            \
+      Visit##type##BinOp(this, node, op, mode);                  \
+    }                                                            \
   }
 
-WORD32_BIN_OP_LIST(DECLARE_BIN_OP)
-WORD32_UNARY_OP_LIST(DECLARE_UNARY_OP)
 FLOAT_UNARY_OP_LIST(DECLARE_UNARY_OP)
 FLOAT_BIN_OP_LIST(DECLARE_BIN_OP)
-
-#if V8_TARGET_ARCH_S390X
+WORD32_UNARY_OP_LIST(DECLARE_UNARY_OP)
+WORD32_BIN_OP_LIST(DECLARE_BIN_OP)
 WORD64_UNARY_OP_LIST(DECLARE_UNARY_OP)
 WORD64_BIN_OP_LIST(DECLARE_BIN_OP)
-#endif
 
-#undef DECLARE_BIN_OP
-#undef DECLARE_UNARY_OP
-#undef WORD64_BIN_OP_LIST
-#undef WORD64_UNARY_OP_LIST
-#undef WORD32_BIN_OP_LIST
-#undef WORD32_UNARY_OP_LIST
 #undef FLOAT_UNARY_OP_LIST
-#undef WORD32_UNARY_OP_LIST_32
 #undef FLOAT_BIN_OP_LIST
-#undef FLOAT_BIN_OP_LIST_32
+#undef WORD32_UNARY_OP_LIST
+#undef WORD32_BIN_OP_LIST
+#undef WORD64_UNARY_OP_LIST
+#undef WORD64_BIN_OP_LIST
+#undef DECLARE_UNARY_OP
+#undef DECLARE_BIN_OP
 #undef null
 
 #if V8_TARGET_ARCH_S390X
-void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
-  VisitTryTruncateDouble(this, kS390_Float32ToInt64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitTryTruncateDouble(this, kS390_Float32ToInt64, node);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
-  VisitTryTruncateDouble(this, kS390_DoubleToInt64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitTryTruncateDouble(this, kS390_DoubleToInt64, node);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
-  VisitTryTruncateDouble(this, kS390_Float32ToUint64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitTryTruncateDouble(this, kS390_Float32ToUint64, node);
+  }
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
-  VisitTryTruncateDouble(this, kS390_DoubleToUint64, node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint64(
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitTryTruncateDouble(this, kS390_DoubleToUint64, node);
+  }
 }
 
 #endif
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt32(
+    node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint32(
+    node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::VisitBitcastWord32ToWord64(Node* node) {
-  DCHECK(SmiValuesAre31Bits());
-  DCHECK(COMPRESS_POINTERS_BOOL);
-  EmitIdentity(node);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32ToWord64(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    DCHECK(SmiValuesAre31Bits());
+    DCHECK(COMPRESS_POINTERS_BOOL);
+    EmitIdentity(node);
+  }
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  S390OperandGenerator g(this);
-  Emit(kS390_ModDouble, g.DefineAsFixed(node, d1),
-       g.UseFixed(node->InputAt(0), d1), g.UseFixed(node->InputAt(1), d2))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    Emit(kS390_ModDouble, g.DefineAsFixed(node, d1),
+         g.UseFixed(node->InputAt(0), d1), g.UseFixed(node->InputAt(1), d2))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  S390OperandGenerator g(this);
-  Emit(opcode, g.DefineAsFixed(node, d1), g.UseFixed(node->InputAt(0), d1))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    Emit(opcode, g.DefineAsFixed(node, d1), g.UseFixed(node->InputAt(0), d1))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  S390OperandGenerator g(this);
-  Emit(opcode, g.DefineAsFixed(node, d1), g.UseFixed(node->InputAt(0), d1),
-       g.UseFixed(node->InputAt(1), d2))
-      ->MarkAsCall();
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+    Emit(opcode, g.DefineAsFixed(node, d1), g.UseFixed(node->InputAt(0), d1),
+         g.UseFixed(node->InputAt(1), d2))
+        ->MarkAsCall();
+  }
 }
 
-void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
-    FlagsContinuation cont = FlagsContinuation::ForSet(
-        CpuFeatures::IsSupported(MISC_INSTR_EXT2) ? kOverflow : kNotEqual, ovf);
-    return EmitInt64MulWithOverflow(this, node, &cont);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulWithOverflow(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(
+          CpuFeatures::IsSupported(MISC_INSTR_EXT2) ? kOverflow : kNotEqual,
+          ovf);
+      return EmitInt64MulWithOverflow(this, node, &cont);
+    }
+    FlagsContinuation cont;
+    EmitInt64MulWithOverflow(this, node, &cont);
   }
-  FlagsContinuation cont;
-  EmitInt64MulWithOverflow(this, node, &cont);
 }
 
-static bool CompareLogical(FlagsContinuation* cont) {
+template <typename Adapter>
+static bool CompareLogical(FlagsContinuationT<Adapter>* cont) {
   switch (cont->condition()) {
     case kUnsignedLessThan:
     case kUnsignedGreaterThanOrEqual:
@@ -1636,81 +1824,97 @@ static bool CompareLogical(FlagsContinuation* cont) {
 namespace {
 
 // Shared routine for multiple compare operations.
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  InstructionOperand left, InstructionOperand right,
-                  FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, InstructionOperand left,
+                  InstructionOperand right, FlagsContinuationT<Adapter>* cont) {
   selector->EmitWithContinuation(opcode, left, right, cont);
 }
 
-void VisitLoadAndTest(InstructionSelector* selector, InstructionCode opcode,
-                      Node* node, Node* value, FlagsContinuation* cont,
+template <typename Adapter>
+void VisitLoadAndTest(InstructionSelectorT<Adapter>* selector,
+                      InstructionCode opcode, Node* node, Node* value,
+                      FlagsContinuationT<Adapter>* cont,
                       bool discard_output = false);
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont,
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node, InstructionCode opcode,
+                      FlagsContinuationT<Adapter>* cont,
                       OperandModes immediate_mode) {
-  S390OperandGenerator g(selector);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(selector);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
 
-  DCHECK(IrOpcode::IsComparisonOpcode(node->opcode()) ||
-         node->opcode() == IrOpcode::kInt32Sub ||
-         node->opcode() == IrOpcode::kInt64Sub);
+    DCHECK(IrOpcode::IsComparisonOpcode(node->opcode()) ||
+           node->opcode() == IrOpcode::kInt32Sub ||
+           node->opcode() == IrOpcode::kInt64Sub);
 
-  InstructionOperand inputs[8];
-  InstructionOperand outputs[1];
-  size_t input_count = 0;
-  size_t output_count = 0;
+    InstructionOperand inputs[8];
+    InstructionOperand outputs[1];
+    size_t input_count = 0;
+    size_t output_count = 0;
+
+    // If one of the two inputs is an immediate, make sure it's on the right, or
+    // if one of the two inputs is a memory operand, make sure it's on the left.
+    int effect_level = selector->GetEffectLevel(node, cont);
+
+    if ((!g.CanBeImmediate(right, immediate_mode) &&
+         g.CanBeImmediate(left, immediate_mode)) ||
+        (!g.CanBeMemoryOperand(opcode, node, right, effect_level) &&
+         g.CanBeMemoryOperand(opcode, node, left, effect_level))) {
+      if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute();
+      std::swap(left, right);
+    }
 
-  // If one of the two inputs is an immediate, make sure it's on the right, or
-  // if one of the two inputs is a memory operand, make sure it's on the left.
-  int effect_level = selector->GetEffectLevel(node, cont);
+    // check if compare with 0
+    if (g.CanBeImmediate(right, immediate_mode) && g.GetImmediate(right) == 0) {
+      DCHECK(opcode == kS390_Cmp32 || opcode == kS390_Cmp64);
+      ArchOpcode load_and_test = (opcode == kS390_Cmp32)
+                                     ? kS390_LoadAndTestWord32
+                                     : kS390_LoadAndTestWord64;
+      return VisitLoadAndTest(selector, load_and_test, node, left, cont, true);
+    }
 
-  if ((!g.CanBeImmediate(right, immediate_mode) &&
-       g.CanBeImmediate(left, immediate_mode)) ||
-      (!g.CanBeMemoryOperand(opcode, node, right, effect_level) &&
-       g.CanBeMemoryOperand(opcode, node, left, effect_level))) {
-    if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute();
-    std::swap(left, right);
-  }
+    inputs[input_count++] = g.UseRegister(left);
+    if (g.CanBeMemoryOperand(opcode, node, right, effect_level)) {
+      // generate memory operand
+      AddressingMode addressing_mode = g.GetEffectiveAddressMemoryOperand(
+          right, inputs, &input_count, OpcodeImmMode(opcode));
+      opcode |= AddressingModeField::encode(addressing_mode);
+    } else if (g.CanBeImmediate(right, immediate_mode)) {
+      inputs[input_count++] = g.UseImmediate(right);
+    } else {
+      inputs[input_count++] = g.UseAnyExceptImmediate(right);
+    }
 
-  // check if compare with 0
-  if (g.CanBeImmediate(right, immediate_mode) && g.GetImmediate(right) == 0) {
-    DCHECK(opcode == kS390_Cmp32 || opcode == kS390_Cmp64);
-    ArchOpcode load_and_test = (opcode == kS390_Cmp32)
-                                   ? kS390_LoadAndTestWord32
-                                   : kS390_LoadAndTestWord64;
-    return VisitLoadAndTest(selector, load_and_test, node, left, cont, true);
+    DCHECK(input_count <= 8 && output_count <= 1);
+    selector->EmitWithContinuation(opcode, output_count, outputs, input_count,
+                                   inputs, cont);
   }
+}
 
-  inputs[input_count++] = g.UseRegister(left);
-  if (g.CanBeMemoryOperand(opcode, node, right, effect_level)) {
-    // generate memory operand
-    AddressingMode addressing_mode = g.GetEffectiveAddressMemoryOperand(
-        right, inputs, &input_count, OpcodeImmMode(opcode));
-    opcode |= AddressingModeField::encode(addressing_mode);
-  } else if (g.CanBeImmediate(right, immediate_mode)) {
-    inputs[input_count++] = g.UseImmediate(right);
+template <typename Adapter>
+void VisitWord32Compare(InstructionSelectorT<Adapter>* selector,
+                        typename Adapter::node_t node,
+                        FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    inputs[input_count++] = g.UseAnyExceptImmediate(right);
+    OperandModes mode = (CompareLogical(cont) ? OperandMode::kUint32Imm
+                                              : OperandMode::kInt32Imm);
+    VisitWordCompare(selector, node, kS390_Cmp32, cont, mode);
   }
-
-  DCHECK(input_count <= 8 && output_count <= 1);
-  selector->EmitWithContinuation(opcode, output_count, outputs, input_count,
-                                 inputs, cont);
-}
-
-void VisitWord32Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
-  OperandModes mode =
-      (CompareLogical(cont) ? OperandMode::kUint32Imm : OperandMode::kInt32Imm);
-  VisitWordCompare(selector, node, kS390_Cmp32, cont, mode);
 }
 
 #if V8_TARGET_ARCH_S390X
-void VisitWord64Compare(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWord64Compare(InstructionSelectorT<Adapter>* selector, Node* node,
+                        FlagsContinuationT<Adapter>* cont) {
   OperandModes mode =
       (CompareLogical(cont) ? OperandMode::kUint32Imm : OperandMode::kInt32Imm);
   VisitWordCompare(selector, node, kS390_Cmp64, cont, mode);
@@ -1718,24 +1922,37 @@ void VisitWord64Compare(InstructionSelector* selector, Node* node,
 #endif
 
 // Shared routine for multiple float32 compare operations.
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  VisitWordCompare(selector, node, kS390_CmpFloat, cont, OperandMode::kNone);
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWordCompare(selector, node, kS390_CmpFloat, cont, OperandMode::kNone);
+  }
 }
 
 // Shared routine for multiple float64 compare operations.
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  VisitWordCompare(selector, node, kS390_CmpDouble, cont, OperandMode::kNone);
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    VisitWordCompare(selector, node, kS390_CmpDouble, cont, OperandMode::kNone);
+  }
 }
 
-void VisitTestUnderMask(InstructionSelector* selector, Node* node,
-                        FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitTestUnderMask(InstructionSelectorT<Adapter>* selector, Node* node,
+                        FlagsContinuationT<Adapter>* cont) {
   DCHECK(node->opcode() == IrOpcode::kWord32And ||
          node->opcode() == IrOpcode::kWord64And);
   ArchOpcode opcode =
       (node->opcode() == IrOpcode::kWord32And) ? kS390_Tst32 : kS390_Tst64;
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   Node* left = node->InputAt(0);
   Node* right = node->InputAt(1);
   if (!g.CanBeImmediate(right, OperandMode::kUint32Imm) &&
@@ -1746,9 +1963,10 @@ void VisitTestUnderMask(InstructionSelector* selector, Node* node,
                g.UseOperand(right, OperandMode::kUint32Imm), cont);
 }
 
-void VisitLoadAndTest(InstructionSelector* selector, InstructionCode opcode,
-                      Node* node, Node* value, FlagsContinuation* cont,
-                      bool discard_output) {
+template <typename Adapter>
+void VisitLoadAndTest(InstructionSelectorT<Adapter>* selector,
+                      InstructionCode opcode, Node* node, Node* value,
+                      FlagsContinuationT<Adapter>* cont, bool discard_output) {
   static_assert(kS390_LoadAndTestFloat64 - kS390_LoadAndTestWord32 == 3,
                 "LoadAndTest Opcode shouldn't contain other opcodes.");
 
@@ -1756,7 +1974,7 @@ void VisitLoadAndTest(InstructionSelector* selector, InstructionCode opcode,
   DCHECK(opcode >= kS390_LoadAndTestWord32 ||
          opcode <= kS390_LoadAndTestWord64);
 
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   InstructionOperand inputs[8];
   InstructionOperand outputs[2];
   size_t input_count = 0;
@@ -1787,53 +2005,57 @@ void VisitLoadAndTest(InstructionSelector* selector, InstructionCode opcode,
 }  // namespace
 
 // Shared routine for word comparisons against zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
-  // Try to combine with comparisons against 0 by simply inverting the branch.
-  while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
-    Int32BinopMatcher m(value);
-    if (!m.right().Is(0)) break;
-
-    user = value;
-    value = m.left().node();
-    cont->Negate();
-  }
-
-  FlagsCondition fc = cont->condition();
-  if (CanCover(user, value)) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord32Equal: {
-        cont->OverwriteAndNegateIfEqual(kEqual);
-        Int32BinopMatcher m(value);
-        if (m.right().Is(0)) {
-          // Try to combine the branch with a comparison.
-          Node* const user = m.node();
-          Node* const value = m.left().node();
-          if (CanCover(user, value)) {
-            switch (value->opcode()) {
-              case IrOpcode::kInt32Sub:
-                return VisitWord32Compare(this, value, cont);
-              case IrOpcode::kWord32And:
-                return VisitTestUnderMask(this, value, cont);
-              default:
-                break;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuation* cont) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    // Try to combine with comparisons against 0 by simply inverting the branch.
+    while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
+      Int32BinopMatcher m(value);
+      if (!m.right().Is(0)) break;
+
+      user = value;
+      value = m.left().node();
+      cont->Negate();
+    }
+
+    FlagsCondition fc = cont->condition();
+    if (CanCover(user, value)) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord32Equal: {
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          Int32BinopMatcher m(value);
+          if (m.right().Is(0)) {
+            // Try to combine the branch with a comparison.
+            Node* const user = m.node();
+            Node* const value = m.left().node();
+            if (CanCover(user, value)) {
+              switch (value->opcode()) {
+                case IrOpcode::kInt32Sub:
+                  return VisitWord32Compare(this, value, cont);
+                case IrOpcode::kWord32And:
+                  return VisitTestUnderMask(this, value, cont);
+                default:
+                  break;
+              }
             }
           }
+          return VisitWord32Compare(this, value, cont);
         }
-        return VisitWord32Compare(this, value, cont);
-      }
-      case IrOpcode::kInt32LessThan:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kInt32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThan:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
-        return VisitWord32Compare(this, value, cont);
-      case IrOpcode::kUint32LessThanOrEqual:
-        cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
-        return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThan:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kInt32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThan:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+          return VisitWord32Compare(this, value, cont);
+        case IrOpcode::kUint32LessThanOrEqual:
+          cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+          return VisitWord32Compare(this, value, cont);
 #if V8_TARGET_ARCH_S390X
       case IrOpcode::kWord64Equal: {
         cont->OverwriteAndNegateIfEqual(kEqual);
@@ -2018,34 +2240,41 @@ void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
         return VisitStackPointerGreaterThan(value, cont);
       default:
         break;
+      }
     }
-  }
 
   // Branch could not be combined with a compare, emit LoadAndTest
   VisitLoadAndTest(this, kS390_LoadAndTestWord32, user, value, cont, true);
+  }
 }
 
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  S390OperandGeneratorT<Adapter> g(this);
   InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
 
   // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
-    static const size_t kMaxTableSwitchValueRange = 2 << 16;
-    size_t table_space_cost = 4 + sw.value_range();
-    size_t table_time_cost = 3;
-    size_t lookup_space_cost = 3 + 2 * sw.case_count();
-    size_t lookup_time_cost = sw.case_count();
-    if (sw.case_count() > 0 &&
-        table_space_cost + 3 * table_time_cost <=
-            lookup_space_cost + 3 * lookup_time_cost &&
-        sw.min_value() > std::numeric_limits<int32_t>::min() &&
-        sw.value_range() <= kMaxTableSwitchValueRange) {
+  if (enable_switch_jump_table_ ==
+      InstructionSelector::kEnableSwitchJumpTable) {
+  static const size_t kMaxTableSwitchValueRange = 2 << 16;
+  size_t table_space_cost = 4 + sw.value_range();
+  size_t table_time_cost = 3;
+  size_t lookup_space_cost = 3 + 2 * sw.case_count();
+  size_t lookup_time_cost = sw.case_count();
+  if (sw.case_count() > 0 &&
+      table_space_cost + 3 * table_time_cost <=
+          lookup_space_cost + 3 * lookup_time_cost &&
+      sw.min_value() > std::numeric_limits<int32_t>::min() &&
+      sw.value_range() <= kMaxTableSwitchValueRange) {
       InstructionOperand index_operand = value_operand;
       if (sw.min_value()) {
-        index_operand = g.TempRegister();
-        Emit(kS390_Lay | AddressingModeField::encode(kMode_MRI), index_operand,
-             value_operand, g.TempImmediate(-sw.min_value()));
+      index_operand = g.TempRegister();
+      Emit(kS390_Lay | AddressingModeField::encode(kMode_MRI), index_operand,
+           value_operand, g.TempImmediate(-sw.min_value()));
       }
 #if V8_TARGET_ARCH_S390X
       InstructionOperand index_operand_zero_ext = g.TempRegister();
@@ -2054,174 +2283,240 @@ void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
 #endif
       // Generate a table lookup.
       return EmitTableSwitch(sw, index_operand);
-    }
+  }
   }
 
   // Generate a tree of conditional jumps.
   return EmitBinarySearchSwitch(sw, value_operand);
+  }
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Equal(node_t const node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   Int32BinopMatcher m(node);
   if (m.right().Is(0)) {
-    return VisitLoadAndTest(this, kS390_LoadAndTestWord32, m.node(),
-                            m.left().node(), &cont, true);
+      return VisitLoadAndTest(this, kS390_LoadAndTestWord32, m.node(),
+                              m.left().node(), &cont, true);
   }
   VisitWord32Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWord32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWord32Compare(this, node, &cont);
 }
 
 #if V8_TARGET_ARCH_S390X
-void InstructionSelector::VisitWord64Equal(Node* const node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Equal(node_t const node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   Int64BinopMatcher m(node);
   if (m.right().Is(0)) {
-    return VisitLoadAndTest(this, kS390_LoadAndTestWord64, m.node(),
-                            m.left().node(), &cont, true);
+      return VisitLoadAndTest(this, kS390_LoadAndTestWord64, m.node(),
+                              m.left().node(), &cont, true);
   }
   VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThan(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 
-void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThanOrEqual(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWord64Compare(this, node, &cont);
+  }
 }
 #endif
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::ZeroExtendsWord32ToWord64NoPhis(
+    node_t node) {
   UNIMPLEMENTED();
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int index) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node, int index) {
+}
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {}
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  S390OperandGenerator g(this);
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  S390OperandGeneratorT<Adapter> g(this);
 
   // Prepare for C function call.
   if (call_descriptor->IsCFunctionCall()) {
-    Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
-                                         call_descriptor->ParameterCount())),
-         0, nullptr, 0, nullptr);
+      Emit(kArchPrepareCallCFunction | MiscField::encode(static_cast<int>(
+                                           call_descriptor->ParameterCount())),
+           0, nullptr, 0, nullptr);
 
-    // Poke any stack arguments.
-    int slot = kStackFrameExtraParamSlot;
-    for (PushParameter input : (*arguments)) {
+      // Poke any stack arguments.
+      int slot = kStackFrameExtraParamSlot;
+      for (PushParameter input : (*arguments)) {
       if (input.node == nullptr) continue;
       Emit(kS390_StoreToStackSlot, g.NoOutput(), g.UseRegister(input.node),
            g.TempImmediate(slot));
       ++slot;
-    }
+      }
   } else {
-    // Push any stack arguments.
-    int stack_decrement = 0;
-    for (PushParameter input : base::Reversed(*arguments)) {
+      // Push any stack arguments.
+      int stack_decrement = 0;
+      for (PushParameter input : base::Reversed(*arguments)) {
       stack_decrement += kSystemPointerSize;
       // Skip any alignment holes in pushed nodes.
       if (input.node == nullptr) continue;
       InstructionOperand decrement = g.UseImmediate(stack_decrement);
       stack_decrement = 0;
       Emit(kS390_Push, g.NoOutput(), decrement, g.UseRegister(input.node));
-    }
+      }
+  }
   }
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
+  S390OperandGeneratorT<Adapter> g(this);
   Emit(kArchNop, g.NoOutput());
+  }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return false; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return false;
+}
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
   AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
   LoadRepresentation load_rep = atomic_load_params.representation();
   VisitLoad(node, node, SelectLoadOpcode(load_rep));
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+  UNIMPLEMENTED();
+  } else {
   AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
   VisitGeneralStore(this, node, store_params.representation());
+  }
 }
 
-void VisitAtomicExchange(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicExchange(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode, AtomicWidth width) {
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2239,7 +2534,8 @@ void VisitAtomicExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, 1, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Int8()) {
@@ -2258,7 +2554,8 @@ void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicExchange(Node* node) {
   ArchOpcode opcode;
   MachineType type = AtomicOpType(node->op());
   if (type == MachineType::Uint8()) {
@@ -2275,9 +2572,11 @@ void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord64);
 }
 
-void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
-                                ArchOpcode opcode, AtomicWidth width) {
-  S390OperandGenerator g(selector);
+template <typename Adapter>
+void VisitAtomicCompareExchange(InstructionSelectorT<Adapter>* selector,
+                                Node* node, ArchOpcode opcode,
+                                AtomicWidth width) {
+  S390OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -2307,7 +2606,9 @@ void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
   selector->Emit(code, output_count, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
   MachineType type = AtomicOpType(node->op());
   ArchOpcode opcode;
   if (type == MachineType::Int8()) {
@@ -2326,7 +2627,9 @@ void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
   VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord32);
 }
 
-void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicCompareExchange(
+    Node* node) {
   MachineType type = AtomicOpType(node->op());
   ArchOpcode opcode;
   if (type == MachineType::Uint8()) {
@@ -2343,9 +2646,10 @@ void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
   VisitAtomicCompareExchange(this, node, opcode, AtomicWidth::kWord64);
 }
 
-void VisitAtomicBinop(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicBinop(InstructionSelectorT<Adapter>* selector, Node* node,
                       ArchOpcode opcode, AtomicWidth width) {
-  S390OperandGenerator g(selector);
+  S390OperandGeneratorT<Adapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2379,33 +2683,38 @@ void VisitAtomicBinop(InstructionSelector* selector, Node* node,
                  temps);
 }
 
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
-    Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicBinaryOperation(
+    node_t node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
-  MachineType type = AtomicOpType(node->op());
-  ArchOpcode opcode;
-
-  if (type == MachineType::Int8()) {
-    opcode = int8_op;
-  } else if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Int16()) {
-    opcode = int16_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
-    opcode = word32_op;
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    MachineType type = AtomicOpType(node->op());
+    ArchOpcode opcode;
+    if (type == MachineType::Int8()) {
+      opcode = int8_op;
+    } else if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Int16()) {
+      opcode = int16_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Int32() || type == MachineType::Uint32()) {
+      opcode = word32_op;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32);
   }
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32);
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                            \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) { \
+    VisitWord32AtomicBinaryOperation(                                     \
+        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16,  \
+        kAtomic##op##Uint16, kAtomic##op##Word32);                        \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -2414,28 +2723,34 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitWord64AtomicBinaryOperation(
-    Node* node, ArchOpcode uint8_op, ArchOpcode uint16_op, ArchOpcode word32_op,
-    ArchOpcode word64_op) {
-  MachineType type = AtomicOpType(node->op());
-  ArchOpcode opcode;
-
-  if (type == MachineType::Uint8()) {
-    opcode = uint8_op;
-  } else if (type == MachineType::Uint16()) {
-    opcode = uint16_op;
-  } else if (type == MachineType::Uint32()) {
-    opcode = word32_op;
-  } else if (type == MachineType::Uint64()) {
-    opcode = word64_op;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicBinaryOperation(
+    node_t node, ArchOpcode uint8_op, ArchOpcode uint16_op,
+    ArchOpcode word32_op, ArchOpcode word64_op) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
   } else {
-    UNREACHABLE();
+    MachineType type = AtomicOpType(node->op());
+    ArchOpcode opcode;
+
+    if (type == MachineType::Uint8()) {
+      opcode = uint8_op;
+    } else if (type == MachineType::Uint16()) {
+      opcode = uint16_op;
+    } else if (type == MachineType::Uint32()) {
+      opcode = word32_op;
+    } else if (type == MachineType::Uint64()) {
+      opcode = word64_op;
+    } else {
+      UNREACHABLE();
+    }
+    VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64);
   }
-  VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord64);
 }
 
 #define VISIT_ATOMIC64_BINOP(op)                                               \
-  void InstructionSelector::VisitWord64Atomic##op(Node* node) {                \
+  template <typename Adapter>                                                  \
+  void InstructionSelectorT<Adapter>::VisitWord64Atomic##op(Node* node) {      \
     VisitWord64AtomicBinaryOperation(node, kAtomic##op##Uint8,                 \
                                      kAtomic##op##Uint16, kAtomic##op##Word32, \
                                      kS390_Word64Atomic##op##Uint64);          \
@@ -2447,15 +2762,21 @@ VISIT_ATOMIC64_BINOP(Or)
 VISIT_ATOMIC64_BINOP(Xor)
 #undef VISIT_ATOMIC64_BINOP
 
-void InstructionSelector::VisitWord64AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicLoad(Node* node) {
   AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
   LoadRepresentation load_rep = atomic_load_params.representation();
   VisitLoad(node, node, SelectLoadOpcode(load_rep));
 }
 
-void InstructionSelector::VisitWord64AtomicStore(Node* node) {
-  AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
-  VisitGeneralStore(this, node, store_params.representation());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicStore(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    AtomicStoreParameters store_params = AtomicStoreParametersOf(node->op());
+    VisitGeneralStore(this, node, store_params.representation());
+  }
 }
 
 #define SIMD_TYPES(V) \
@@ -2652,12 +2973,14 @@ void InstructionSelector::VisitWord64AtomicStore(Node* node) {
   V(I16x8ExtAddPairwiseI8x16S)            \
   V(I16x8ExtAddPairwiseI8x16U)
 
-#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                              \
-  void InstructionSelector::Visit##Type##ExtractLane##Sign(Node* node) { \
-    S390OperandGenerator g(this);                                        \
-    int32_t lane = OpParameter<int32_t>(node->op());                     \
-    Emit(kS390_##Type##ExtractLane##Sign, g.DefineAsRegister(node),      \
-         g.UseRegister(node->InputAt(0)), g.UseImmediate(lane));         \
+#define SIMD_VISIT_EXTRACT_LANE(Type, Sign)                           \
+  template <typename Adapter>                                         \
+  void InstructionSelectorT<Adapter>::Visit##Type##ExtractLane##Sign( \
+      Node* node) {                                                   \
+    S390OperandGeneratorT<Adapter> g(this);                           \
+    int32_t lane = OpParameter<int32_t>(node->op());                  \
+    Emit(kS390_##Type##ExtractLane##Sign, g.DefineAsRegister(node),   \
+         g.UseRegister(node->InputAt(0)), g.UseImmediate(lane));      \
   }
 SIMD_VISIT_EXTRACT_LANE(F64x2, )
 SIMD_VISIT_EXTRACT_LANE(F32x4, )
@@ -2669,20 +2992,22 @@ SIMD_VISIT_EXTRACT_LANE(I8x16, U)
 SIMD_VISIT_EXTRACT_LANE(I8x16, S)
 #undef SIMD_VISIT_EXTRACT_LANE
 
-#define SIMD_VISIT_REPLACE_LANE(Type)                              \
-  void InstructionSelector::Visit##Type##ReplaceLane(Node* node) { \
-    S390OperandGenerator g(this);                                  \
-    int32_t lane = OpParameter<int32_t>(node->op());               \
-    Emit(kS390_##Type##ReplaceLane, g.DefineAsRegister(node),      \
-         g.UseRegister(node->InputAt(0)), g.UseImmediate(lane),    \
-         g.UseRegister(node->InputAt(1)));                         \
+#define SIMD_VISIT_REPLACE_LANE(Type)                                        \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##ReplaceLane(Node* node) { \
+    S390OperandGeneratorT<Adapter> g(this);                                  \
+    int32_t lane = OpParameter<int32_t>(node->op());                         \
+    Emit(kS390_##Type##ReplaceLane, g.DefineAsRegister(node),                \
+         g.UseRegister(node->InputAt(0)), g.UseImmediate(lane),              \
+         g.UseRegister(node->InputAt(1)));                                   \
   }
 SIMD_TYPES(SIMD_VISIT_REPLACE_LANE)
 #undef SIMD_VISIT_REPLACE_LANE
 
 #define SIMD_VISIT_BINOP(Opcode)                                            \
-  void InstructionSelector::Visit##Opcode(Node* node) {                     \
-    S390OperandGenerator g(this);                                           \
+  template <typename Adapter>                                               \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {           \
+    S390OperandGeneratorT<Adapter> g(this);                                 \
     Emit(kS390_##Opcode, g.DefineAsRegister(node),                          \
          g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1))); \
   }
@@ -2691,8 +3016,9 @@ SIMD_BINOP_LIST(SIMD_VISIT_BINOP)
 #undef SIMD_BINOP_LIST
 
 #define SIMD_VISIT_BINOP_UNIQUE_REGISTER(Opcode)                          \
-  void InstructionSelector::Visit##Opcode(Node* node) {                   \
-    S390OperandGenerator g(this);                                         \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {         \
+    S390OperandGeneratorT<Adapter> g(this);                               \
     InstructionOperand temps[] = {g.TempSimd128Register(),                \
                                   g.TempSimd128Register()};               \
     Emit(kS390_##Opcode, g.DefineAsRegister(node),                        \
@@ -2703,19 +3029,21 @@ SIMD_BINOP_UNIQUE_REGISTER_LIST(SIMD_VISIT_BINOP_UNIQUE_REGISTER)
 #undef SIMD_VISIT_BINOP_UNIQUE_REGISTER
 #undef SIMD_BINOP_UNIQUE_REGISTER_LIST
 
-#define SIMD_VISIT_UNOP(Opcode)                         \
-  void InstructionSelector::Visit##Opcode(Node* node) { \
-    S390OperandGenerator g(this);                       \
-    Emit(kS390_##Opcode, g.DefineAsRegister(node),      \
-         g.UseRegister(node->InputAt(0)));              \
+#define SIMD_VISIT_UNOP(Opcode)                                   \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) { \
+    S390OperandGeneratorT<Adapter> g(this);                       \
+    Emit(kS390_##Opcode, g.DefineAsRegister(node),                \
+         g.UseRegister(node->InputAt(0)));                        \
   }
 SIMD_UNOP_LIST(SIMD_VISIT_UNOP)
 #undef SIMD_VISIT_UNOP
 #undef SIMD_UNOP_LIST
 
 #define SIMD_VISIT_UNOP_UNIQUE_REGISTER(Opcode)                           \
-  void InstructionSelector::Visit##Opcode(Node* node) {                   \
-    S390OperandGenerator g(this);                                         \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {         \
+    S390OperandGeneratorT<Adapter> g(this);                               \
     InstructionOperand temps[] = {g.TempSimd128Register()};               \
     Emit(kS390_##Opcode, g.DefineAsRegister(node),                        \
          g.UseUniqueRegister(node->InputAt(0)), arraysize(temps), temps); \
@@ -2725,8 +3053,9 @@ SIMD_UNOP_UNIQUE_REGISTER_LIST(SIMD_VISIT_UNOP_UNIQUE_REGISTER)
 #undef SIMD_UNOP_UNIQUE_REGISTER_LIST
 
 #define SIMD_VISIT_QFMOP(Opcode)                                           \
-  void InstructionSelector::Visit##Opcode(Node* node) {                    \
-    S390OperandGenerator g(this);                                          \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {          \
+    S390OperandGeneratorT<Adapter> g(this);                                \
     Emit(kS390_##Opcode, g.DefineSameAsFirst(node),                        \
          g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)), \
          g.UseRegister(node->InputAt(2)));                                 \
@@ -2752,19 +3081,23 @@ SIMD_VISIT_QFMOP(F32x4Qfms)
   V(I32x4RelaxedLaneSelect, S128Select)                   \
   V(I64x2RelaxedLaneSelect, S128Select)
 
-#define SIMD_VISIT_RELAXED_OP(name, op) \
-  void InstructionSelector::Visit##name(Node* node) { Visit##op(node); }
+#define SIMD_VISIT_RELAXED_OP(name, op)                         \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##name(Node* node) { \
+    Visit##op(node);                                            \
+  }
 SIMD_RELAXED_OP_LIST(SIMD_VISIT_RELAXED_OP)
 #undef SIMD_VISIT_RELAXED_OP
 #undef SIMD_RELAXED_OP_LIST
 #undef SIMD_TYPES
 
 #if V8_ENABLE_WEBASSEMBLY
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
-  S390OperandGenerator g(this);
+  S390OperandGeneratorT<Adapter> g(this);
   Node* input0 = node->InputAt(0);
   Node* input1 = node->InputAt(1);
   // Remap the shuffle indices to match IBM lane numbering.
@@ -2785,20 +3118,26 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
        g.UseImmediate(wasm::SimdShuffle::Pack4Lanes(shuffle_remapped + 12)));
 }
 
-void InstructionSelector::VisitI8x16Swizzle(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
+  S390OperandGeneratorT<Adapter> g(this);
   bool relaxed = OpParameter<bool>(node->op());
   // TODO(miladfarca): Optimize Swizzle if relaxed.
   USE(relaxed);
 
-  InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kS390_I8x16Swizzle, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)),
-       g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
+       g.UseUniqueRegister(node->InputAt(1)));
 }
 #else
-void InstructionSelector::VisitI8x16Shuffle(Node* node) { UNREACHABLE(); }
-void InstructionSelector::VisitI8x16Swizzle(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
+  UNREACHABLE();
+}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
+  UNREACHABLE();
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 // This is a replica of SimdShuffle::Pack4Lanes. However, above function will
@@ -2813,8 +3152,9 @@ static int32_t Pack4Lanes(const uint8_t* shuffle) {
   return result;
 }
 
-void InstructionSelector::VisitS128Const(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  S390OperandGeneratorT<Adapter> g(this);
   uint32_t val[kSimd128Size / sizeof(uint32_t)];
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
   // If all bytes are zeros, avoid emitting code for generic constants.
@@ -2837,27 +3177,33 @@ void InstructionSelector::VisitS128Const(Node* node) {
   }
 }
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  S390OperandGeneratorT<Adapter> g(this);
   Emit(kS390_S128Zero, g.DefineAsRegister(node));
 }
 
-void InstructionSelector::VisitS128Select(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
+  S390OperandGeneratorT<Adapter> g(this);
   Emit(kS390_S128Select, g.DefineAsRegister(node),
        g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
        g.UseRegister(node->InputAt(2)));
 }
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  S390OperandGenerator g(this);
+    node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
 
-  for (PushParameter output : *results) {
-    if (!output.location.IsCallerFrameSlot()) continue;
-    // Skip any alignment holes in nodes.
-    if (output.node != nullptr) {
+    for (PushParameter output : *results) {
+      if (!output.location.IsCallerFrameSlot()) continue;
+      // Skip any alignment holes in nodes.
+      if (output.node != nullptr) {
       DCHECK(!call_descriptor->IsCFunctionCall());
       if (output.location.GetType() == MachineType::Float32()) {
         MarkAsFloat32(output.node);
@@ -2870,11 +3216,13 @@ void InstructionSelector::EmitPrepareResults(
       int reverse_slot = -output.location.GetLocation() - offset;
       Emit(kS390_Peek, g.DefineAsRegister(output.node),
            g.UseImmediate(reverse_slot));
+      }
     }
   }
 }
 
-void InstructionSelector::VisitLoadLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
   LoadLaneParameters params = LoadLaneParametersOf(node->op());
   InstructionCode opcode;
   if (params.rep == MachineType::Int8()) {
@@ -2889,7 +3237,7 @@ void InstructionSelector::VisitLoadLane(Node* node) {
     UNREACHABLE();
   }
 
-  S390OperandGenerator g(this);
+  S390OperandGeneratorT<Adapter> g(this);
   InstructionOperand outputs[] = {g.DefineSameAsFirst(node)};
   InstructionOperand inputs[5];
   size_t input_count = 0;
@@ -2903,7 +3251,8 @@ void InstructionSelector::VisitLoadLane(Node* node) {
   Emit(opcode, 1, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
   ArchOpcode opcode;
   switch (params.transformation) {
@@ -2949,7 +3298,8 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   VisitLoad(node, node, opcode);
 }
 
-void InstructionSelector::VisitStoreLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
   StoreLaneParameters params = StoreLaneParametersOf(node->op());
   InstructionCode opcode;
   if (params.rep == MachineRepresentation::kWord8) {
@@ -2964,7 +3314,7 @@ void InstructionSelector::VisitStoreLane(Node* node) {
     UNREACHABLE();
   }
 
-  S390OperandGenerator g(this);
+  S390OperandGeneratorT<Adapter> g(this);
   InstructionOperand inputs[5];
   size_t input_count = 0;
 
@@ -2977,15 +3327,17 @@ void InstructionSelector::VisitStoreLane(Node* node) {
   Emit(opcode, 0, nullptr, input_count, inputs);
 }
 
-void InstructionSelector::VisitI16x8DotI8x16I7x16S(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8DotI8x16I7x16S(Node* node) {
+  S390OperandGeneratorT<Adapter> g(this);
   Emit(kS390_I16x8DotI8x16S, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)),
        g.UseUniqueRegister(node->InputAt(1)));
 }
 
-void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI8x16I7x16AddS(Node* node) {
+  S390OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kS390_I32x4DotI8x16AddS, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)),
@@ -2993,37 +3345,59 @@ void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
        g.UseUniqueRegister(node->InputAt(2)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitTruncateFloat32ToInt32(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToInt32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
+
+    InstructionCode opcode = kS390_Float32ToInt32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
 
-  InstructionCode opcode = kS390_Float32ToInt32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
   }
-
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitTruncateFloat32ToUint32(Node* node) {
-  S390OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat32ToUint32(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    S390OperandGeneratorT<Adapter> g(this);
 
-  InstructionCode opcode = kS390_Float32ToUint32;
-  TruncateKind kind = OpParameter<TruncateKind>(node->op());
-  if (kind == TruncateKind::kSetOverflowToMin) {
-    opcode |= MiscField::encode(true);
-  }
+    InstructionCode opcode = kS390_Float32ToUint32;
+    TruncateKind kind = OpParameter<TruncateKind>(node->op());
+    if (kind == TruncateKind::kSetOverflowToMin) {
+      opcode |= MiscField::encode(true);
+    }
 
-  Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+    Emit(opcode, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+  }
 }
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGenerator* g, int first_input_index, node_t node) {
   UNREACHABLE();
 }
 
-// static
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
+
+template <>
+TurboshaftAdapter::node_t
+InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    node_t node, size_t projection_index) {
+  UNIMPLEMENTED();
+}
+
 MachineOperatorBuilder::Flags
 InstructionSelector::SupportedMachineOperatorFlags() {
   return MachineOperatorBuilder::kFloat32RoundDown |
@@ -3041,13 +3415,17 @@ InstructionSelector::SupportedMachineOperatorFlags() {
          MachineOperatorBuilder::kWord64Popcnt;
 }
 
-// static
 MachineOperatorBuilder::AlignmentRequirements
 InstructionSelector::AlignmentRequirements() {
   return MachineOperatorBuilder::AlignmentRequirements::
       FullUnalignedAccessSupport();
 }
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/backend/spill-placer.cc b/deps/v8/src/compiler/backend/spill-placer.cc
index 5cf4861577d0d7..9cfedea5e4fc17 100644
--- a/deps/v8/src/compiler/backend/spill-placer.cc
+++ b/deps/v8/src/compiler/backend/spill-placer.cc
@@ -11,9 +11,8 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-SpillPlacer::SpillPlacer(LiveRangeFinder* finder,
-                         TopTierRegisterAllocationData* data, Zone* zone)
-    : finder_(finder), data_(data), zone_(zone) {}
+SpillPlacer::SpillPlacer(TopTierRegisterAllocationData* data, Zone* zone)
+    : data_(data), zone_(zone) {}
 
 SpillPlacer::~SpillPlacer() {
   if (assigned_indices_ > 0) {
@@ -56,10 +55,9 @@ void SpillPlacer::Add(TopLevelLiveRange* range) {
        child = child->next()) {
     if (child->spilled()) {
       // Add every block that contains part of this live range.
-      for (UseInterval* interval = child->first_interval(); interval != nullptr;
-           interval = interval->next()) {
+      for (const UseInterval& interval : child->intervals()) {
         RpoNumber start_block =
-            code->GetInstructionBlock(interval->start().ToInstructionIndex())
+            code->GetInstructionBlock(interval.start().ToInstructionIndex())
                 ->rpo_number();
         if (start_block == top_start_block_number) {
           // Can't do late spilling if the first spill is within the
@@ -69,7 +67,7 @@ void SpillPlacer::Add(TopLevelLiveRange* range) {
           DCHECK(!IsLatestVreg(range->vreg()));
           return;
         }
-        LifetimePosition end = interval->end();
+        LifetimePosition end = interval.end();
         int end_instruction = end.ToInstructionIndex();
         // The end position is exclusive, so an end position exactly on a block
         // boundary indicates that the range applies only to the prior block.
@@ -86,8 +84,7 @@ void SpillPlacer::Add(TopLevelLiveRange* range) {
       }
     } else {
       // Add every block that contains a use which requires the on-stack value.
-      for (const UsePosition* pos = child->first_pos(); pos != nullptr;
-           pos = pos->next()) {
+      for (const UsePosition* pos : child->positions()) {
         if (pos->type() != UsePositionType::kRequiresSlot) continue;
         InstructionBlock* block =
             code->GetInstructionBlock(pos->pos().ToInstructionIndex());
@@ -211,12 +208,12 @@ int SpillPlacer::GetOrCreateIndexForLatestVreg(int vreg) {
       DCHECK_EQ(entries_, nullptr);
       // We lazily allocate these arrays because many functions don't have any
       // values that use SpillPlacer.
-      entries_ =
-          zone_->NewArray<Entry>(data()->code()->instruction_blocks().size());
+      entries_ = zone_->AllocateArray<Entry>(
+          data()->code()->instruction_blocks().size());
       for (size_t i = 0; i < data()->code()->instruction_blocks().size(); ++i) {
         new (&entries_[i]) Entry();
       }
-      vreg_numbers_ = zone_->NewArray<int>(kValueIndicesPerEntry);
+      vreg_numbers_ = zone_->AllocateArray<int>(kValueIndicesPerEntry);
     }
 
     if (assigned_indices_ == kValueIndicesPerEntry) {
@@ -464,19 +461,19 @@ void SpillPlacer::SecondBackwardPass() {
 
 void SpillPlacer::CommitSpill(int vreg, InstructionBlock* predecessor,
                               InstructionBlock* successor) {
-  TopLevelLiveRange* top = data()->live_ranges()[vreg];
-  LiveRangeBoundArray* array = finder_->ArrayFor(vreg);
+  TopLevelLiveRange* live_range = data()->live_ranges()[vreg];
   LifetimePosition pred_end = LifetimePosition::InstructionFromInstructionIndex(
       predecessor->last_instruction_index());
-  LiveRangeBound* bound = array->Find(pred_end);
-  InstructionOperand pred_op = bound->range_->GetAssignedOperand();
+  LiveRange* child_range = live_range->GetChildCovers(pred_end);
+  DCHECK_NOT_NULL(child_range);
+  InstructionOperand pred_op = child_range->GetAssignedOperand();
   DCHECK(pred_op.IsAnyRegister());
   DCHECK_EQ(successor->PredecessorCount(), 1);
   data()->AddGapMove(successor->first_instruction_index(),
                      Instruction::GapPosition::START, pred_op,
-                     top->GetSpillRangeOperand());
+                     live_range->GetSpillRangeOperand());
   successor->mark_needs_frame();
-  top->SetLateSpillingSelected(true);
+  live_range->SetLateSpillingSelected(true);
 }
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/backend/spill-placer.h b/deps/v8/src/compiler/backend/spill-placer.h
index 94a5358384e142..4ed4d7a12573b7 100644
--- a/deps/v8/src/compiler/backend/spill-placer.h
+++ b/deps/v8/src/compiler/backend/spill-placer.h
@@ -75,8 +75,7 @@ class TopTierRegisterAllocationData;
 // easily process a batch of values at the same time as an optimization.
 class SpillPlacer {
  public:
-  SpillPlacer(LiveRangeFinder* finder, TopTierRegisterAllocationData* data,
-              Zone* zone);
+  SpillPlacer(TopTierRegisterAllocationData* data, Zone* zone);
 
   ~SpillPlacer();
 
@@ -143,7 +142,6 @@ class SpillPlacer {
   static constexpr int kValueIndicesPerEntry = 64;
 
   // Objects provided to the constructor, which all outlive this SpillPlacer.
-  LiveRangeFinder* finder_;
   TopTierRegisterAllocationData* data_;
   Zone* zone_;
 
diff --git a/deps/v8/src/compiler/backend/x64/code-generator-x64.cc b/deps/v8/src/compiler/backend/x64/code-generator-x64.cc
index b37032a74163d0..cabbe42432c40d 100644
--- a/deps/v8/src/compiler/backend/x64/code-generator-x64.cc
+++ b/deps/v8/src/compiler/backend/x64/code-generator-x64.cc
@@ -4,8 +4,10 @@
 
 #include <limits>
 
+#include "src/base/logging.h"
 #include "src/base/optional.h"
 #include "src/base/overflowing-math.h"
+#include "src/builtins/builtins.h"
 #include "src/codegen/assembler.h"
 #include "src/codegen/cpu-features.h"
 #include "src/codegen/external-reference.h"
@@ -303,12 +305,17 @@ class OutOfLineRecordWrite final : public OutOfLineCode {
   }
 
   void Generate() final {
-    if (COMPRESS_POINTERS_BOOL) {
+    // When storing an indirect pointer, the value will always be a
+    // full/decompressed pointer.
+    if (COMPRESS_POINTERS_BOOL &&
+        mode_ != RecordWriteMode::kValueIsIndirectPointer) {
       __ DecompressTagged(value_, value_);
     }
+
     __ CheckPageFlag(value_, scratch0_,
                      MemoryChunk::kPointersToHereAreInterestingMask, zero,
                      exit());
+
     __ leaq(scratch1_, operand_);
 
     SaveFPRegsMode const save_fp_mode = frame()->DidAllocateDoubleRegisters()
@@ -317,6 +324,10 @@ class OutOfLineRecordWrite final : public OutOfLineCode {
 
     if (mode_ == RecordWriteMode::kValueIsEphemeronKey) {
       __ CallEphemeronKeyBarrier(object_, scratch1_, save_fp_mode);
+    } else if (mode_ == RecordWriteMode::kValueIsIndirectPointer) {
+      __ CallRecordWriteStubSaveRegisters(object_, scratch1_, save_fp_mode,
+                                          StubCallMode::kCallBuiltinPointer,
+                                          PointerType::kIndirect);
 #if V8_ENABLE_WEBASSEMBLY
     } else if (stub_mode_ == StubCallMode::kCallWasmRuntimeStub) {
       // A direct call to a wasm runtime stub defined in this module.
@@ -368,6 +379,9 @@ int EmitStore(MacroAssembler* masm, Operand operand, Register value,
       case MachineRepresentation::kSandboxedPointer:
         masm->StoreSandboxedPointerField(operand, value);
         break;
+      case MachineRepresentation::kIndirectPointer:
+        masm->StoreIndirectPointerField(operand, value);
+        break;
       default:
         UNREACHABLE();
     }
@@ -457,29 +471,14 @@ class WasmOutOfLineTrap : public OutOfLineCode {
 
  private:
   void GenerateCallToTrap(TrapId trap_id) {
-    if (!gen_->wasm_runtime_exception_support()) {
-      // We cannot test calls to the runtime in cctest/test-run-wasm.
-      // Therefore we emit a call to C here instead of a call to the runtime.
-      __ PrepareCallCFunction(0);
-      __ CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(),
-                       0);
-      __ LeaveFrame(StackFrame::WASM);
-      auto call_descriptor = gen_->linkage()->GetIncomingDescriptor();
-      size_t pop_size =
-          call_descriptor->ParameterSlotCount() * kSystemPointerSize;
-      // Use rcx as a scratch register, we return anyways immediately.
-      __ Ret(static_cast<int>(pop_size), rcx);
-    } else {
-      gen_->AssembleSourcePosition(instr_);
-      // A direct call to a wasm runtime stub defined in this module.
-      // Just encode the stub index. This will be patched when the code
-      // is added to the native module and copied into wasm code space.
-      __ near_call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
-      ReferenceMap* reference_map =
-          gen_->zone()->New<ReferenceMap>(gen_->zone());
-      gen_->RecordSafepoint(reference_map);
-      __ AssertUnreachable(AbortReason::kUnexpectedReturnFromWasmTrap);
-    }
+    gen_->AssembleSourcePosition(instr_);
+    // A direct call to a wasm runtime stub defined in this module.
+    // Just encode the stub index. This will be patched when the code
+    // is added to the native module and copied into wasm code space.
+    __ near_call(static_cast<Address>(trap_id), RelocInfo::WASM_STUB_CALL);
+    ReferenceMap* reference_map = gen_->zone()->New<ReferenceMap>(gen_->zone());
+    gen_->RecordSafepoint(reference_map);
+    __ AssertUnreachable(AbortReason::kUnexpectedReturnFromWasmTrap);
   }
 
   Instruction* instr_;
@@ -503,8 +502,7 @@ class WasmProtectedInstructionTrap final : public WasmOutOfLineTrap {
 };
 
 void EmitOOLTrapIfNeeded(Zone* zone, CodeGenerator* codegen,
-                         InstructionCode opcode, Instruction* instr,
-                         int pc) {
+                         InstructionCode opcode, Instruction* instr, int pc) {
   const MemoryAccessMode access_mode = instr->memory_access_mode();
   if (access_mode == kMemoryAccessProtectedMemOutOfBounds) {
     zone->New<WasmProtectedInstructionTrap>(codegen, pc, instr,
@@ -636,6 +634,14 @@ Register GetTSANValueRegister(MacroAssembler* masm, Register value,
     masm->movq(value_reg, value);
     masm->EncodeSandboxedPointer(value_reg);
     return value_reg;
+  } else if (rep == MachineRepresentation::kIndirectPointer) {
+    // Indirect pointer fields contain an index to a pointer table entry, which
+    // is obtained from the referenced object.
+    static_assert(kAllIndirectPointerObjectsAreCode);
+    Register value_reg = i.TempRegister(1);
+    masm->movl(value_reg,
+               FieldOperand(value, Code::kCodePointerTableEntryOffset));
+    return value_reg;
   }
   return value;
 }
@@ -654,6 +660,12 @@ Register GetTSANValueRegister<std::memory_order_relaxed>(
   if (rep == MachineRepresentation::kSandboxedPointer) {
     // SandboxedPointers need to be encoded.
     masm->EncodeSandboxedPointer(value_reg);
+  } else if (rep == MachineRepresentation::kIndirectPointer) {
+    // Indirect pointer fields contain an index to a pointer table entry, which
+    // is obtained from the referenced object.
+    static_assert(kAllIndirectPointerObjectsAreCode);
+    masm->movl(value_reg,
+               FieldOperand(value_reg, Code::kCodePointerTableEntryOffset));
   }
   return value_reg;
 }
@@ -682,8 +694,8 @@ void EmitTSANAwareStore(Zone* zone, CodeGenerator* codegen,
   } else {
     int store_instr_offset = EmitStore<order>(masm, operand, value, rep);
     if (instr->HasMemoryAccessMode()) {
-      EmitOOLTrapIfNeeded(zone, codegen, instr->opcode(),
-                          instr, store_instr_offset);
+      EmitOOLTrapIfNeeded(zone, codegen, instr->opcode(), instr,
+                          store_instr_offset);
     }
   }
 }
@@ -1006,9 +1018,9 @@ void EmitTSANRelaxedLoadOOLIfNeeded(Zone* zone, CodeGenerator* codegen,
     }                                                                    \
   } while (false)
 
-#define ASSEMBLE_SIMD256_BINOP(opcode)                                 \
+#define ASSEMBLE_SIMD256_BINOP(opcode, cpu_feature)                    \
   do {                                                                 \
-    CpuFeatureScope avx_scope(masm(), AVX);                            \
+    CpuFeatureScope avx_scope(masm(), cpu_feature);                    \
     __ v##opcode(i.OutputSimd256Register(), i.InputSimd256Register(0), \
                  i.InputSimd256Register(1));                           \
   } while (false)
@@ -1034,7 +1046,7 @@ void EmitTSANRelaxedLoadOOLIfNeeded(Zone* zone, CodeGenerator* codegen,
 #define ASSEMBLE_SIMD_PUNPCK_SHUFFLE(opcode)                    \
   do {                                                          \
     XMMRegister dst = i.OutputSimd128Register();                \
-    byte input_index = instr->InputCount() == 2 ? 1 : 0;        \
+    uint8_t input_index = instr->InputCount() == 2 ? 1 : 0;     \
     if (CpuFeatures::IsSupported(AVX)) {                        \
       CpuFeatureScope avx_scope(masm(), AVX);                   \
       DCHECK(instr->InputAt(input_index)->IsSimd128Register()); \
@@ -1084,10 +1096,10 @@ void EmitTSANRelaxedLoadOOLIfNeeded(Zone* zone, CodeGenerator* codegen,
       if (CpuFeatures::IsSupported(AVX)) {                               \
         CpuFeatureScope avx_scope(masm(), AVX);                          \
         __ v##opcode(dst, i.InputSimd128Register(0),                     \
-                     byte{i.InputInt##width(1)});                        \
+                     uint8_t{i.InputInt##width(1)});                     \
       } else {                                                           \
         DCHECK_EQ(dst, i.InputSimd128Register(0));                       \
-        __ opcode(dst, byte{i.InputInt##width(1)});                      \
+        __ opcode(dst, uint8_t{i.InputInt##width(1)});                   \
       }                                                                  \
     } else {                                                             \
       constexpr int mask = (1 << width) - 1;                             \
@@ -1104,6 +1116,22 @@ void EmitTSANRelaxedLoadOOLIfNeeded(Zone* zone, CodeGenerator* codegen,
     }                                                                    \
   } while (false)
 
+#define ASSEMBLE_SIMD256_SHIFT(opcode, width)                \
+  do {                                                       \
+    CpuFeatureScope avx_scope(masm(), AVX2);                 \
+    YMMRegister src = i.InputSimd256Register(0);             \
+    YMMRegister dst = i.OutputSimd256Register();             \
+    if (HasImmediateInput(instr, 1)) {                       \
+      __ v##opcode(dst, src, uint8_t{i.InputInt##width(1)}); \
+    } else {                                                 \
+      constexpr int mask = (1 << width) - 1;                 \
+      __ movq(kScratchRegister, i.InputRegister(1));         \
+      __ andq(kScratchRegister, Immediate(mask));            \
+      __ Movq(kScratchDoubleReg, kScratchRegister);          \
+      __ v##opcode(dst, src, kScratchDoubleReg);             \
+    }                                                        \
+  } while (false)
+
 #define ASSEMBLE_PINSR(ASM_INSTR)                                        \
   do {                                                                   \
     XMMRegister dst = i.OutputSimd128Register();                         \
@@ -1190,6 +1218,16 @@ void SetupSimdImmediateInRegister(MacroAssembler* assembler, uint32_t* imms,
                   make_uint64(imms[1], imms[0]));
 }
 
+void SetupSimd256ImmediateInRegister(MacroAssembler* assembler, uint32_t* imms,
+                                     YMMRegister reg, XMMRegister scratch) {
+  assembler->Move(reg, make_uint64(imms[3], imms[2]),
+                  make_uint64(imms[1], imms[0]));
+  assembler->Move(scratch, make_uint64(imms[7], imms[6]),
+                  make_uint64(imms[5], imms[4]));
+  CpuFeatureScope avx_scope(assembler, AVX2);
+  assembler->vinserti128(reg, reg, scratch, uint8_t{1});
+}
+
 }  // namespace
 
 void CodeGenerator::AssembleTailCallBeforeGap(Instruction* instr,
@@ -1291,7 +1329,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         DCHECK_IMPLIES(
             instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister),
             reg == kJavaScriptCallCodeStartRegister);
-        __ LoadCodeEntry(reg, reg);
+        __ LoadCodeInstructionStart(reg, reg);
         __ call(reg);
       }
       RecordCallPosition(instr);
@@ -1351,7 +1389,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         DCHECK_IMPLIES(
             instr->HasCallDescriptorFlag(CallDescriptor::kFixedTargetRegister),
             reg == kJavaScriptCallCodeStartRegister);
-        __ LoadCodeEntry(reg, reg);
+        __ LoadCodeInstructionStart(reg, reg);
         __ jmp(reg);
       }
       unwinding_info_writer_.MarkBlockWillExit();
@@ -1379,8 +1417,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ Assert(equal, AbortReason::kWrongFunctionContext);
       }
       static_assert(kJavaScriptCallCodeStartRegister == rcx, "ABI mismatch");
-      __ LoadTaggedField(rcx, FieldOperand(func, JSFunction::kCodeOffset));
-      __ CallCodeObject(rcx);
+      __ CallJSFunction(func);
       frame_access_state()->ClearSPDelta();
       RecordCallPosition(instr);
       break;
@@ -1562,6 +1599,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kArchAtomicStoreWithWriteBarrier: {
       // {EmitTSANAwareStore} calls EmitOOLTrapIfNeeded. No need to do it here.
       RecordWriteMode mode = RecordWriteModeField::decode(instr->opcode());
+      // Indirect pointer writes must use a different opcode.
+      DCHECK_NE(mode, RecordWriteMode::kValueIsIndirectPointer);
       Register object = i.InputRegister(0);
       size_t index = 0;
       Operand operand = i.MemoryOperand(&index);
@@ -1598,6 +1637,28 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ bind(ool->exit());
       break;
     }
+    case kArchStoreIndirectWithWriteBarrier: {
+      RecordWriteMode mode = RecordWriteModeField::decode(instr->opcode());
+      DCHECK_EQ(mode, RecordWriteMode::kValueIsIndirectPointer);
+      Register object = i.InputRegister(0);
+      size_t index = 0;
+      Operand operand = i.MemoryOperand(&index);
+      Register value = i.InputRegister(index);
+      Register scratch0 = i.TempRegister(0);
+      Register scratch1 = i.TempRegister(1);
+
+      auto ool = zone()->New<OutOfLineRecordWrite>(this, object, operand, value,
+                                                   scratch0, scratch1, mode,
+                                                   DetermineStubCallMode());
+      EmitTSANAwareStore<std::memory_order_relaxed>(
+          zone(), this, masm(), operand, value, i, DetermineStubCallMode(),
+          MachineRepresentation::kIndirectPointer, instr);
+      __ CheckPageFlag(object, scratch0,
+                       MemoryChunk::kPointersFromHereAreInterestingMask,
+                       not_zero, ool->entry());
+      __ bind(ool->exit());
+      break;
+    }
     case kX64MFence:
       __ mfence();
       break;
@@ -2477,11 +2538,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
             XMMRegister src = i.InputSimd128Register(0);
             if (dst == src) {
               __ Pcmpeqd(kScratchDoubleReg, kScratchDoubleReg);
-              __ Psrld(kScratchDoubleReg, byte{1});
+              __ Psrld(kScratchDoubleReg, uint8_t{1});
               __ Andps(dst, kScratchDoubleReg);
             } else {
               __ Pcmpeqd(dst, dst);
-              __ Psrld(dst, byte{1});
+              __ Psrld(dst, uint8_t{1});
               __ Andps(dst, src);
             }
             break;
@@ -2495,7 +2556,32 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
-
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Abs
+            YMMRegister dst = i.OutputSimd256Register();
+            YMMRegister src = i.InputSimd256Register(0);
+            CpuFeatureScope avx_scope(masm(), AVX2);
+            if (dst == src) {
+              __ vpcmpeqd(kScratchSimd256Reg, kScratchSimd256Reg,
+                          kScratchSimd256Reg);
+              __ vpsrld(kScratchSimd256Reg, kScratchSimd256Reg, uint8_t{1});
+              __ vpand(dst, dst, kScratchSimd256Reg);
+            } else {
+              __ vpcmpeqd(dst, dst, dst);
+              __ vpsrld(dst, dst, uint8_t{1});
+              __ vpand(dst, dst, src);
+            }
+            break;
+          }
+          case kL64: {
+            // F64x4Abs
+            UNIMPLEMENTED();
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -2517,11 +2603,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
             XMMRegister src = i.InputSimd128Register(0);
             if (dst == src) {
               __ Pcmpeqd(kScratchDoubleReg, kScratchDoubleReg);
-              __ Pslld(kScratchDoubleReg, byte{31});
+              __ Pslld(kScratchDoubleReg, uint8_t{31});
               __ Xorps(dst, kScratchDoubleReg);
             } else {
               __ Pcmpeqd(dst, dst);
-              __ Pslld(dst, byte{31});
+              __ Pslld(dst, uint8_t{31});
               __ Xorps(dst, src);
             }
             break;
@@ -2535,6 +2621,32 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Neg
+            YMMRegister dst = i.OutputSimd256Register();
+            YMMRegister src = i.InputSimd256Register(0);
+            CpuFeatureScope avx_scope(masm(), AVX2);
+            if (dst == src) {
+              __ vpcmpeqd(kScratchSimd256Reg, kScratchSimd256Reg,
+                          kScratchSimd256Reg);
+              __ vpslld(kScratchSimd256Reg, kScratchSimd256Reg, uint8_t{31});
+              __ vpxor(dst, dst, kScratchSimd256Reg);
+            } else {
+              __ vpcmpeqd(dst, dst, dst);
+              __ vpslld(dst, dst, uint8_t{31});
+              __ vxorps(dst, dst, src);
+            }
+            break;
+          }
+          case kL64: {
+            // F64x4Neg
+            UNIMPLEMENTED();
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -2691,6 +2803,17 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       }
       break;
     }
+    case kX64MovqStoreIndirectPointer: {
+      CHECK(!instr->HasOutput());
+      size_t index = 0;
+      Operand operand = i.MemoryOperand(&index);
+      CHECK(!HasImmediateInput(instr, index));
+      Register value(i.InputRegister(index));
+      EmitTSANAwareStore<std::memory_order_relaxed>(
+          zone(), this, masm(), operand, value, i, DetermineStubCallMode(),
+          MachineRepresentation::kIndirectPointer, instr);
+      break;
+    }
     case kX64MovqDecodeSandboxedPointer: {
       CHECK(instr->HasOutput());
       Operand address(i.MemoryOperand());
@@ -2984,6 +3107,21 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
             UNREACHABLE();
         }
 
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Splat
+            __ F32x8Splat(i.OutputSimd256Register(), i.InputSimd128Register(0));
+            break;
+          }
+          case kL64: {
+            // F64X4Splat
+            __ F64x4Splat(i.OutputSimd256Register(), i.InputSimd128Register(0));
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3024,7 +3162,7 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
             // F32x4ReplaceLane
             // The insertps instruction uses imm8[5:4] to indicate the lane
             // that needs to be replaced.
-            byte select = i.InputInt8(1) << 4 & 0x30;
+            uint8_t select = i.InputInt8(1) << 4 & 0x30;
             if (instr->InputAt(2)->IsFPRegister()) {
               __ Insertps(i.OutputSimd128Register(), i.InputDoubleRegister(2),
                           select);
@@ -3053,15 +3191,35 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       LaneSize lane_size = LaneSizeField::decode(opcode);
       VectorLength vec_len = VectorLengthField::decode(opcode);
       if (vec_len == kV128) {
+        XMMRegister dst = i.OutputSimd128Register();
+        XMMRegister src = i.InputSimd128Register(0);
         switch (lane_size) {
           case kL32: {
             // F32x4Sqrt
-            __ Sqrtps(i.OutputSimd128Register(), i.InputSimd128Register(0));
+            __ Sqrtps(dst, src);
             break;
           }
           case kL64: {
             // F64x2Sqrt
-            __ Sqrtpd(i.OutputSimd128Register(), i.InputSimd128Register(0));
+            __ Sqrtpd(dst, src);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else if (vec_len == kV256) {
+        YMMRegister dst = i.OutputSimd256Register();
+        YMMRegister src = i.InputSimd256Register(0);
+        CpuFeatureScope avx_scope(masm(), AVX);
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Sqrt
+            __ vsqrtps(dst, src);
+            break;
+          }
+          case kL64: {
+            // F64x4Sqrt
+            __ vsqrtpd(dst, src);
             break;
           }
           default:
@@ -3094,7 +3252,12 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         switch (lane_size) {
           case kL32: {
             // F32x8Add
-            ASSEMBLE_SIMD256_BINOP(addps);
+            ASSEMBLE_SIMD256_BINOP(addps, AVX);
+            break;
+          }
+          case kL64: {
+            // F64x4Add
+            ASSEMBLE_SIMD256_BINOP(addpd, AVX);
             break;
           }
           default:
@@ -3127,7 +3290,12 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         switch (lane_size) {
           case kL32: {
             // F32x8Sub
-            ASSEMBLE_SIMD256_BINOP(subps);
+            ASSEMBLE_SIMD256_BINOP(subps, AVX);
+            break;
+          }
+          case kL64: {
+            // F64x4Sub
+            ASSEMBLE_SIMD256_BINOP(subpd, AVX);
             break;
           }
           default:
@@ -3156,6 +3324,22 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL64: {
+            // F64x4Mul
+            ASSEMBLE_SIMD256_BINOP(mulpd, AVX);
+            break;
+          }
+          case kL32: {
+            // F32x8Mul
+            ASSEMBLE_SIMD256_BINOP(mulps, AVX);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+
       } else {
         UNREACHABLE();
       }
@@ -3179,6 +3363,21 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Div
+            ASSEMBLE_SIMD256_BINOP(divps, AVX);
+            break;
+          }
+          case kL64: {
+            // F64x4Div
+            ASSEMBLE_SIMD256_BINOP(divpd, AVX);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3206,6 +3405,24 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Min
+            __ F32x8Min(i.OutputSimd256Register(), i.InputSimd256Register(0),
+                        i.InputSimd256Register(1), kScratchSimd256Reg);
+            break;
+          }
+          case kL64: {
+            // F64x4Min
+            DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+            __ F64x4Min(i.OutputSimd256Register(), i.InputSimd256Register(0),
+                        i.InputSimd256Register(1), kScratchSimd256Reg);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3233,6 +3450,24 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Max
+            __ F32x8Max(i.OutputSimd256Register(), i.InputSimd256Register(0),
+                        i.InputSimd256Register(1), kScratchSimd256Reg);
+            break;
+          }
+          case kL64: {
+            // F64x4Max
+            DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+            __ F64x4Max(i.OutputSimd256Register(), i.InputSimd256Register(0),
+                        i.InputSimd256Register(1), kScratchSimd256Reg);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3256,6 +3491,21 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Eq
+            ASSEMBLE_SIMD256_BINOP(cmpeqps, AVX);
+            break;
+          }
+          case kL64: {
+            // F64x4Eq
+            ASSEMBLE_SIMD256_BINOP(cmpeqpd, AVX);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3279,6 +3529,21 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Ne
+            ASSEMBLE_SIMD256_BINOP(cmpneqps, AVX);
+            break;
+          }
+          case kL64: {
+            // F64x4Ne
+            ASSEMBLE_SIMD256_BINOP(cmpneqpd, AVX);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3302,6 +3567,21 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Lt
+            ASSEMBLE_SIMD256_BINOP(cmpltps, AVX);
+            break;
+          }
+          case kL64: {
+            // F64x8Lt
+            ASSEMBLE_SIMD256_BINOP(cmpltpd, AVX);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3325,6 +3605,21 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL32: {
+            // F32x8Le
+            ASSEMBLE_SIMD256_BINOP(cmpleps, AVX);
+            break;
+          }
+          case kL64: {
+            // F64x4Le
+            ASSEMBLE_SIMD256_BINOP(cmplepd, AVX);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3346,6 +3641,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ Cvtdq2pd(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
+    case kX64F64x4ConvertI32x4S: {
+      CpuFeatureScope avx_scope(masm(), AVX);
+      __ vcvtdq2pd(i.OutputSimd256Register(), i.InputSimd128Register(0));
+      break;
+    }
     case kX64F64x2ConvertLowI32x4U: {
       __ F64x2ConvertLowI32x4U(i.OutputSimd128Register(),
                                i.InputSimd128Register(0), kScratchRegister);
@@ -3364,6 +3664,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ Cvtpd2ps(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
+    case kX64F32x4DemoteF64x4: {
+      CpuFeatureScope avx_scope(masm(), AVX);
+      __ vcvtpd2ps(i.OutputSimd128Register(), i.InputSimd256Register(0));
+      break;
+    }
     case kX64I32x4TruncSatF64x2SZero: {
       __ I32x4TruncSatF64x2SZero(i.OutputSimd128Register(),
                                  i.InputSimd128Register(0), kScratchDoubleReg,
@@ -3380,20 +3685,44 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ Cvtdq2ps(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
     }
+    case kX64F32x8SConvertI32x8: {
+      CpuFeatureScope avx_scope(masm(), AVX);
+      __ vcvtdq2ps(i.OutputSimd256Register(), i.InputSimd256Register(0));
+      break;
+    }
     case kX64F32x4UConvertI32x4: {
       DCHECK_EQ(i.OutputSimd128Register(), i.InputSimd128Register(0));
       DCHECK_NE(i.OutputSimd128Register(), kScratchDoubleReg);
       XMMRegister dst = i.OutputSimd128Register();
-      __ Pxor(kScratchDoubleReg, kScratchDoubleReg);  // zeros
+      __ Pxor(kScratchDoubleReg, kScratchDoubleReg);      // zeros
       __ Pblendw(kScratchDoubleReg, dst, uint8_t{0x55});  // get lo 16 bits
       __ Psubd(dst, kScratchDoubleReg);                   // get hi 16 bits
       __ Cvtdq2ps(kScratchDoubleReg, kScratchDoubleReg);  // convert lo exactly
-      __ Psrld(dst, byte{1});            // divide by 2 to get in unsigned range
+      __ Psrld(dst, uint8_t{1});         // divide by 2 to get in unsigned range
       __ Cvtdq2ps(dst, dst);             // convert hi exactly
       __ Addps(dst, dst);                // double hi, exactly
       __ Addps(dst, kScratchDoubleReg);  // add hi and lo, may round.
       break;
     }
+    case kX64F32x8UConvertI32x8: {
+      DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+      DCHECK_NE(i.OutputSimd256Register(), kScratchSimd256Reg);
+      CpuFeatureScope avx_scope(masm(), AVX);
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      YMMRegister dst = i.OutputSimd256Register();
+      __ vpxor(kScratchSimd256Reg, kScratchSimd256Reg,
+               kScratchSimd256Reg);  // zeros
+      __ vpblendw(kScratchSimd256Reg, kScratchSimd256Reg, dst,
+                  uint8_t{0x55});               // get lo 16 bits
+      __ vpsubd(dst, dst, kScratchSimd256Reg);  // get hi 16 bits
+      __ vcvtdq2ps(kScratchSimd256Reg,
+                   kScratchSimd256Reg);  // convert lo exactly
+      __ vpsrld(dst, dst, uint8_t{1});   // divide by 2 to get in unsigned range
+      __ vcvtdq2ps(dst, dst);            // convert hi
+      __ vaddps(dst, dst, dst);          // double hi
+      __ vaddps(dst, dst, kScratchSimd256Reg);
+      break;
+    }
     case kX64F32x4Qfma: {
       __ F32x4Qfma(i.OutputSimd128Register(), i.InputSimd128Register(0),
                    i.InputSimd128Register(1), i.InputSimd128Register(2),
@@ -3414,6 +3743,30 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       ASSEMBLE_SIMD_BINOP(maxps);
       break;
     }
+    case kX64F32x8Pmin: {
+      YMMRegister dst = i.OutputSimd256Register();
+      CpuFeatureScope avx_scope(masm(), AVX);
+      __ vminps(dst, i.InputSimd256Register(0), i.InputSimd256Register(1));
+      break;
+    }
+    case kX64F32x8Pmax: {
+      YMMRegister dst = i.OutputSimd256Register();
+      CpuFeatureScope avx_scope(masm(), AVX);
+      __ vmaxps(dst, i.InputSimd256Register(0), i.InputSimd256Register(1));
+      break;
+    }
+    case kX64F64x4Pmin: {
+      YMMRegister dst = i.OutputSimd256Register();
+      CpuFeatureScope avx_scope(masm(), AVX);
+      __ vminpd(dst, i.InputSimd256Register(0), i.InputSimd256Register(1));
+      break;
+    }
+    case kX64F64x4Pmax: {
+      YMMRegister dst = i.OutputSimd256Register();
+      CpuFeatureScope avx_scope(masm(), AVX);
+      __ vmaxpd(dst, i.InputSimd256Register(0), i.InputSimd256Register(1));
+      break;
+    }
     case kX64F32x4Round: {
       RoundingMode const mode =
           static_cast<RoundingMode>(MiscField::decode(instr->opcode()));
@@ -3487,6 +3840,51 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
             UNREACHABLE();
         }
 
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32Splat
+            YMMRegister dst = i.OutputSimd256Register();
+            if (HasRegisterInput(instr, 0)) {
+              __ I8x32Splat(dst, i.InputRegister(0));
+            } else {
+              __ I8x32Splat(dst, i.InputOperand(0));
+            }
+            break;
+          }
+          case kL16: {
+            // I16x16Splat
+            YMMRegister dst = i.OutputSimd256Register();
+            if (HasRegisterInput(instr, 0)) {
+              __ I16x16Splat(dst, i.InputRegister(0));
+            } else {
+              __ I16x16Splat(dst, i.InputOperand(0));
+            }
+            break;
+          }
+          case kL32: {
+            // I32x8Splat
+            YMMRegister dst = i.OutputSimd256Register();
+            if (HasRegisterInput(instr, 0)) {
+              __ I32x8Splat(dst, i.InputRegister(0));
+            } else {
+              __ I32x8Splat(dst, i.InputOperand(0));
+            }
+            break;
+          }
+          case kL64: {
+            // I64X4Splat
+            YMMRegister dst = i.OutputSimd256Register();
+            if (HasRegisterInput(instr, 0)) {
+              __ I64x4Splat(dst, i.InputRegister(0));
+            } else {
+              __ I64x4Splat(dst, i.InputOperand(0));
+            }
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3522,46 +3920,74 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       LaneSize lane_size = LaneSizeField::decode(opcode);
       VectorLength vec_len = VectorLengthField::decode(opcode);
       if (vec_len == kV128) {
+        XMMRegister dst = i.OutputSimd128Register();
+        XMMRegister src = i.InputSimd128Register(0);
         switch (lane_size) {
           case kL8: {
             // I8x16Abs
-            __ Pabsb(i.OutputSimd128Register(), i.InputSimd128Register(0));
+            __ Pabsb(dst, src);
             break;
           }
           case kL16: {
             // I16x8Abs
-            __ Pabsw(i.OutputSimd128Register(), i.InputSimd128Register(0));
+            __ Pabsw(dst, src);
             break;
           }
           case kL32: {
             // I32x4Abs
-            __ Pabsd(i.OutputSimd128Register(), i.InputSimd128Register(0));
+            __ Pabsd(dst, src);
             break;
           }
           case kL64: {
             // I64x2Abs
-            __ I64x2Abs(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                        kScratchDoubleReg);
+            __ I64x2Abs(dst, src, kScratchDoubleReg);
             break;
           }
           default:
             UNREACHABLE();
         }
-
-      } else {
-        UNREACHABLE();
-      }
-      break;
-    }
-    case kX64INeg: {
+      } else if (vec_len == kV256) {
+        YMMRegister dst = i.OutputSimd256Register();
+        YMMRegister src = i.InputSimd256Register(0);
+        CpuFeatureScope avx_scope(masm(), AVX2);
+        switch (lane_size) {
+          case kL8: {
+            // I8x32Abs
+            __ vpabsb(dst, src);
+            break;
+          }
+          case kL16: {
+            // I16x16Abs
+            __ vpabsw(dst, src);
+            break;
+          }
+          case kL32: {
+            // I32x8Abs
+            __ vpabsd(dst, src);
+            break;
+          }
+          case kL64: {
+            // I64x4Abs
+            UNIMPLEMENTED();
+          }
+          default:
+            UNREACHABLE();
+        }
+
+      } else {
+        UNREACHABLE();
+      }
+      break;
+    }
+    case kX64INeg: {
       LaneSize lane_size = LaneSizeField::decode(opcode);
       VectorLength vec_len = VectorLengthField::decode(opcode);
       if (vec_len == kV128) {
+        XMMRegister dst = i.OutputSimd128Register();
+        XMMRegister src = i.InputSimd128Register(0);
         switch (lane_size) {
           case kL8: {
             // I8x16Neg
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(0);
             if (dst == src) {
               __ Pcmpeqd(kScratchDoubleReg, kScratchDoubleReg);
               __ Psignb(dst, kScratchDoubleReg);
@@ -3573,8 +3999,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           }
           case kL16: {
             // I16x8Neg
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(0);
             if (dst == src) {
               __ Pcmpeqd(kScratchDoubleReg, kScratchDoubleReg);
               __ Psignw(dst, kScratchDoubleReg);
@@ -3586,8 +4010,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           }
           case kL32: {
             // I32x4Neg
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(0);
             if (dst == src) {
               __ Pcmpeqd(kScratchDoubleReg, kScratchDoubleReg);
               __ Psignd(dst, kScratchDoubleReg);
@@ -3599,13 +4021,60 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           }
           case kL64: {
             // I64x2Neg
-            __ I64x2Neg(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                        kScratchDoubleReg);
+            __ I64x2Neg(dst, src, kScratchDoubleReg);
             break;
           }
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        YMMRegister dst = i.OutputSimd256Register();
+        YMMRegister src = i.InputSimd256Register(0);
+        CpuFeatureScope avx_scope(masm(), AVX2);
+        switch (lane_size) {
+          case kL8: {
+            // I8x32Neg
+            if (dst == src) {
+              __ vpcmpeqd(kScratchSimd256Reg, kScratchSimd256Reg,
+                          kScratchSimd256Reg);
+              __ vpsignb(dst, dst, kScratchSimd256Reg);
+            } else {
+              __ vpxor(dst, dst, dst);
+              __ vpsubb(dst, dst, src);
+            }
+            break;
+          }
+          case kL16: {
+            // I16x8Neg
+            if (dst == src) {
+              __ vpcmpeqd(kScratchSimd256Reg, kScratchSimd256Reg,
+                          kScratchSimd256Reg);
+              __ vpsignw(dst, dst, kScratchSimd256Reg);
+            } else {
+              __ vpxor(dst, dst, dst);
+              __ vpsubw(dst, dst, src);
+            }
+            break;
+          }
+          case kL32: {
+            // I32x4Neg
+            if (dst == src) {
+              __ vpcmpeqd(kScratchSimd256Reg, kScratchSimd256Reg,
+                          kScratchSimd256Reg);
+              __ vpsignd(dst, dst, kScratchSimd256Reg);
+            } else {
+              __ vpxor(dst, dst, dst);
+              __ vpsubd(dst, dst, src);
+            }
+            break;
+          }
+          case kL64: {
+            // I64x2Neg
+            UNIMPLEMENTED();
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3687,6 +4156,33 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32Shl
+            UNIMPLEMENTED();
+          }
+          case kL16: {
+            // I16x16Shl
+            // Take shift value modulo 2^4.
+            ASSEMBLE_SIMD256_SHIFT(psllw, 4);
+            break;
+          }
+          case kL32: {
+            // I32x8Shl
+            // Take shift value modulo 2^5.
+            ASSEMBLE_SIMD256_SHIFT(pslld, 5);
+            break;
+          }
+          case kL64: {
+            // I64x4Shl
+            // Take shift value modulo 2^6.
+            ASSEMBLE_SIMD256_SHIFT(psllq, 6);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3738,6 +4234,31 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32ShrS
+            UNIMPLEMENTED();
+          }
+          case kL16: {
+            // I16x8ShrS
+            // Take shift value modulo 2^4.
+            ASSEMBLE_SIMD256_SHIFT(psraw, 4);
+            break;
+          }
+          case kL32: {
+            // I32x4ShrS
+            // Take shift value modulo 2^5.
+            ASSEMBLE_SIMD256_SHIFT(psrad, 5);
+            break;
+          }
+          case kL64: {
+            // I64x2ShrS
+            UNIMPLEMENTED();
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3771,6 +4292,31 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL64: {
+            // I64x4Add
+            ASSEMBLE_SIMD256_BINOP(paddq, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8Add
+            ASSEMBLE_SIMD256_BINOP(paddd, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16Add
+            ASSEMBLE_SIMD256_BINOP(paddw, AVX2);
+            break;
+          }
+          case kL8: {
+            // I8x32Add
+            ASSEMBLE_SIMD256_BINOP(paddb, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3804,6 +4350,31 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL64: {
+            // I64x4Sub
+            ASSEMBLE_SIMD256_BINOP(psubq, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8Sub
+            ASSEMBLE_SIMD256_BINOP(psubd, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16Sub
+            ASSEMBLE_SIMD256_BINOP(psubw, AVX2);
+            break;
+          }
+          case kL8: {
+            // I8x32Sub
+            ASSEMBLE_SIMD256_BINOP(psubb, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3834,6 +4405,28 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL16: {
+            // I16x16Mul
+            ASSEMBLE_SIMD256_BINOP(pmullw, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8Mul
+            ASSEMBLE_SIMD256_BINOP(pmulld, AVX2);
+            break;
+          }
+          case kL64: {
+            // I64x4Mul
+            __ I64x4Mul(i.OutputSimd256Register(), i.InputSimd256Register(0),
+                        i.InputSimd256Register(1), i.TempSimd256Register(0),
+                        kScratchSimd256Reg);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3868,6 +4461,31 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32Eq
+            ASSEMBLE_SIMD256_BINOP(pcmpeqb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16Eq
+            ASSEMBLE_SIMD256_BINOP(pcmpeqw, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8Eq
+            ASSEMBLE_SIMD256_BINOP(pcmpeqd, AVX2);
+            break;
+          }
+          case kL64: {
+            // I64x4Eq
+            ASSEMBLE_SIMD256_BINOP(pcmpeqq, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3911,6 +4529,46 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+        YMMRegister dst = i.OutputSimd256Register();
+        CpuFeatureScope avx2_scope(masm(), AVX2);
+        switch (lane_size) {
+          case kL8: {
+            // I8x32Ne
+            __ vpcmpeqb(dst, dst, i.InputSimd256Register(1));
+            __ vpcmpeqb(kScratchSimd256Reg, kScratchSimd256Reg,
+                        kScratchSimd256Reg);
+            __ vpxor(dst, dst, kScratchSimd256Reg);
+            break;
+          }
+          case kL16: {
+            // I16x16Ne
+            __ vpcmpeqw(dst, dst, i.InputSimd256Register(1));
+            __ vpcmpeqw(kScratchSimd256Reg, kScratchSimd256Reg,
+                        kScratchSimd256Reg);
+            __ vpxor(dst, dst, kScratchSimd256Reg);
+            break;
+          }
+          case kL32: {
+            // I32x8Ne
+            __ vpcmpeqd(dst, dst, i.InputSimd256Register(1));
+            __ vpcmpeqd(kScratchSimd256Reg, kScratchSimd256Reg,
+                        kScratchSimd256Reg);
+            __ vpxor(dst, dst, kScratchSimd256Reg);
+            break;
+          }
+          case kL64: {
+            // I64x4Ne
+            __ vpcmpeqq(dst, dst, i.InputSimd256Register(1));
+            __ vpcmpeqq(kScratchSimd256Reg, kScratchSimd256Reg,
+                        kScratchSimd256Reg);
+            __ vpxor(dst, dst, kScratchSimd256Reg);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3945,6 +4603,31 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32GtS
+            ASSEMBLE_SIMD256_BINOP(pcmpgtb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16GtS
+            ASSEMBLE_SIMD256_BINOP(pcmpgtw, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8GtS
+            ASSEMBLE_SIMD256_BINOP(pcmpgtd, AVX2);
+            break;
+          }
+          case kL64: {
+            // I64x4GtS
+            ASSEMBLE_SIMD256_BINOP(pcmpgtq, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -3988,6 +4671,44 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        YMMRegister dst = i.OutputSimd256Register();
+        YMMRegister src = i.InputSimd256Register(1);
+        CpuFeatureScope avx2_scope(masm(), AVX2);
+        switch (lane_size) {
+          case kL8: {
+            // I8x32GeS
+            DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+            __ vpminsb(dst, dst, src);
+            __ vpcmpeqb(dst, dst, src);
+            break;
+          }
+          case kL16: {
+            // I16x16GeS
+            DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+            __ vpminsw(dst, dst, src);
+            __ vpcmpeqw(dst, dst, src);
+            break;
+          }
+          case kL32: {
+            // I32x8GeS
+            DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+            __ vpminsd(dst, dst, src);
+            __ vpcmpeqd(dst, dst, src);
+            break;
+          }
+          case kL64: {
+            // I64x4GeS
+            __ vpcmpgtq(dst, i.InputSimd256Register(1),
+                        i.InputSimd256Register(0));
+            __ vpcmpeqq(kScratchSimd256Reg, kScratchSimd256Reg,
+                        kScratchSimd256Reg);
+            __ vpxor(dst, dst, kScratchSimd256Reg);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -4033,6 +4754,33 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32ShrU
+            UNIMPLEMENTED();
+          }
+          case kL16: {
+            // I16x8ShrU
+            // Take shift value modulo 2^4.
+            ASSEMBLE_SIMD256_SHIFT(psrlw, 4);
+            break;
+          }
+          case kL32: {
+            // I32x4ShrU
+            // Take shift value modulo 2^5.
+            ASSEMBLE_SIMD256_SHIFT(psrld, 5);
+            break;
+          }
+          case kL64: {
+            // I64x2ShrU
+            // Take shift value modulo 2^6.
+            ASSEMBLE_SIMD256_SHIFT(psrlq, 6);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -4073,6 +4821,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                 i.InputSimd128Register(0));
       break;
     }
+    case kX64I64x4SConvertI32x4: {
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      __ vpmovsxdq(i.OutputSimd256Register(), i.InputSimd128Register(0));
+      break;
+    }
     case kX64I64x2UConvertI32x4Low: {
       __ Pmovzxdq(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
@@ -4082,6 +4835,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                 i.InputSimd128Register(0), kScratchDoubleReg);
       break;
     }
+    case kX64I64x4UConvertI32x4: {
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      __ vpmovzxdq(i.OutputSimd256Register(), i.InputSimd128Register(0));
+      break;
+    }
     case kX64I32x4SConvertF32x4: {
       __ I32x4SConvertF32x4(i.OutputSimd128Register(),
                             i.InputSimd128Register(0), kScratchDoubleReg,
@@ -4097,6 +4855,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                 i.InputSimd128Register(0));
       break;
     }
+    case kX64I32x8SConvertI16x8: {
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      __ vpmovsxwd(i.OutputSimd256Register(), i.InputSimd128Register(0));
+      break;
+    }
     case kX64IMinS: {
       LaneSize lane_size = LaneSizeField::decode(opcode);
       VectorLength vec_len = VectorLengthField::decode(opcode);
@@ -4120,6 +4883,26 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32MinS
+            ASSEMBLE_SIMD256_BINOP(pminsb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16MinS
+            ASSEMBLE_SIMD256_BINOP(pminsw, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8MinS
+            ASSEMBLE_SIMD256_BINOP(pminsd, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -4148,6 +4931,26 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32MaxS
+            ASSEMBLE_SIMD256_BINOP(pmaxsb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16MaxS
+            ASSEMBLE_SIMD256_BINOP(pmaxsw, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8MaxS
+            ASSEMBLE_SIMD256_BINOP(pmaxsd, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -4181,6 +4984,36 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       __ Paddd(dst, tmp);
       break;
     }
+    case kX64I32x8UConvertF32x8: {
+      DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+      CpuFeatureScope avx_scope(masm(), AVX);
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      YMMRegister dst = i.OutputSimd256Register();
+      YMMRegister tmp1 = i.TempSimd256Register(0);
+      YMMRegister tmp2 = i.TempSimd256Register(1);
+      // NAN->0, negative->0
+      __ vpxor(tmp2, tmp2, tmp2);
+      __ vmaxps(dst, dst, tmp2);
+      // scratch: float representation of max_signed
+      __ vpcmpeqd(tmp2, tmp2, tmp2);
+      __ vpsrld(tmp2, tmp2, uint8_t{1});  // 0x7fffffff
+      __ vcvtdq2ps(tmp2, tmp2);           // 0x4f000000
+      // tmp1: convert (src-max_signed).
+      // Positive overflow lanes -> 0x7FFFFFFF
+      // Negative lanes -> 0
+      __ vmovaps(tmp1, dst);
+      __ vsubps(tmp1, tmp1, tmp2);
+      __ vcmpleps(tmp2, tmp2, tmp1);
+      __ vcvttps2dq(tmp1, tmp1);
+      __ vpxor(tmp1, tmp1, tmp2);
+      __ vpxor(tmp2, tmp2, tmp2);
+      __ vpmaxsd(tmp1, tmp1, tmp2);
+      // convert. Overflow lanes above max_signed will be 0x80000000
+      __ vcvttps2dq(dst, dst);
+      // Add (src-max_signed) for overflow lanes.
+      __ vpaddd(dst, dst, tmp1);
+      break;
+    }
     case kX64I32x4UConvertI16x8Low: {
       __ Pmovzxwd(i.OutputSimd128Register(), i.InputSimd128Register(0));
       break;
@@ -4190,6 +5023,11 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                 i.InputSimd128Register(0), kScratchDoubleReg);
       break;
     }
+    case kX64I32x8UConvertI16x8: {
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      __ vpmovzxwd(i.OutputSimd256Register(), i.InputSimd128Register(0));
+      break;
+    }
     case kX64IMinU: {
       LaneSize lane_size = LaneSizeField::decode(opcode);
       VectorLength vec_len = VectorLengthField::decode(opcode);
@@ -4213,6 +5051,26 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32MinU
+            ASSEMBLE_SIMD256_BINOP(pminub, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16MinU
+            ASSEMBLE_SIMD256_BINOP(pminuw, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8MinU
+            ASSEMBLE_SIMD256_BINOP(pminud, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -4241,6 +5099,26 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32MaxU
+            ASSEMBLE_SIMD256_BINOP(pmaxub, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16MaxU
+            ASSEMBLE_SIMD256_BINOP(pmaxuw, AVX2);
+            break;
+          }
+          case kL32: {
+            // I32x8MaxU
+            ASSEMBLE_SIMD256_BINOP(pmaxud, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -4250,10 +5128,10 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       LaneSize lane_size = LaneSizeField::decode(opcode);
       VectorLength vec_len = VectorLengthField::decode(opcode);
       if (vec_len == kV128) {
+        XMMRegister dst = i.OutputSimd128Register();
+        XMMRegister src = i.InputSimd128Register(1);
         switch (lane_size) {
           case kL8: {
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(1);
             __ Pmaxub(dst, src);
             __ Pcmpeqb(dst, src);
             __ Pcmpeqb(kScratchDoubleReg, kScratchDoubleReg);
@@ -4262,8 +5140,6 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           }
           case kL16: {
             // I16x8GtU
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(1);
             __ Pmaxuw(dst, src);
             __ Pcmpeqw(dst, src);
             __ Pcmpeqw(kScratchDoubleReg, kScratchDoubleReg);
@@ -4272,15 +5148,48 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           }
           case kL32: {
             // I32x4GtU
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(1);
             __ Pmaxud(dst, src);
             __ Pcmpeqd(dst, src);
             __ Pcmpeqd(kScratchDoubleReg, kScratchDoubleReg);
             __ Pxor(dst, kScratchDoubleReg);
             break;
           }
-
+          default:
+            UNREACHABLE();
+        }
+      } else if (vec_len == kV256) {
+        DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+        YMMRegister dst = i.OutputSimd256Register();
+        YMMRegister src = i.InputSimd256Register(1);
+        CpuFeatureScope avx2_scope(masm(), AVX2);
+        switch (lane_size) {
+          case kL8: {
+            // I8x32GtU
+            __ vpmaxub(dst, dst, src);
+            __ vpcmpeqb(dst, dst, src);
+            __ vpcmpeqb(kScratchSimd256Reg, kScratchSimd256Reg,
+                        kScratchSimd256Reg);
+            __ vpxor(dst, dst, kScratchSimd256Reg);
+            break;
+          }
+          case kL16: {
+            // I16x16GtU
+            __ vpmaxuw(dst, dst, src);
+            __ vpcmpeqw(dst, dst, src);
+            __ vpcmpeqw(kScratchSimd256Reg, kScratchSimd256Reg,
+                        kScratchSimd256Reg);
+            __ vpxor(dst, dst, kScratchSimd256Reg);
+            break;
+          }
+          case kL32: {
+            // I32x8GtU
+            __ vpmaxud(dst, dst, src);
+            __ vpcmpeqd(dst, dst, src);
+            __ vpcmpeqd(kScratchSimd256Reg, kScratchSimd256Reg,
+                        kScratchSimd256Reg);
+            __ vpxor(dst, dst, kScratchSimd256Reg);
+            break;
+          }
           default:
             UNREACHABLE();
         }
@@ -4293,27 +5202,23 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       LaneSize lane_size = LaneSizeField::decode(opcode);
       VectorLength vec_len = VectorLengthField::decode(opcode);
       if (vec_len == kV128) {
+        XMMRegister dst = i.OutputSimd128Register();
+        XMMRegister src = i.InputSimd128Register(1);
         switch (lane_size) {
           case kL8: {
             // I8x16GeU
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(1);
             __ Pminub(dst, src);
             __ Pcmpeqb(dst, src);
             break;
           }
           case kL16: {
             // I16x8GeU
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(1);
             __ Pminuw(dst, src);
             __ Pcmpeqw(dst, src);
             break;
           }
           case kL32: {
             // I32x4GeU
-            XMMRegister dst = i.OutputSimd128Register();
-            XMMRegister src = i.InputSimd128Register(1);
             __ Pminud(dst, src);
             __ Pcmpeqd(dst, src);
             break;
@@ -4321,6 +5226,33 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
           default:
             UNREACHABLE();
         }
+      } else if (vec_len == kV256) {
+        DCHECK_EQ(i.OutputSimd256Register(), i.InputSimd256Register(0));
+        YMMRegister dst = i.OutputSimd256Register();
+        YMMRegister src = i.InputSimd256Register(1);
+        CpuFeatureScope avx2_scope(masm(), AVX2);
+        switch (lane_size) {
+          case kL8: {
+            // I8x32GeU
+            __ vpminub(dst, dst, src);
+            __ vpcmpeqb(dst, dst, src);
+            break;
+          }
+          case kL16: {
+            // I16x16GeU
+            __ vpminuw(dst, dst, src);
+            __ vpcmpeqw(dst, dst, src);
+            break;
+          }
+          case kL32: {
+            // I32x8GeU
+            __ vpminud(dst, dst, src);
+            __ vpcmpeqd(dst, dst, src);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
       } else {
         UNREACHABLE();
       }
@@ -4343,12 +5275,24 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                    i.InputSimd128Register(0), kScratchRegister);
       break;
     }
+    case kX64I32x8ExtAddPairwiseI16x16S: {
+      __ I32x8ExtAddPairwiseI16x16S(i.OutputSimd256Register(),
+                                    i.InputSimd256Register(0),
+                                    kScratchSimd256Reg);
+      break;
+    }
     case kX64I32x4ExtAddPairwiseI16x8U: {
       __ I32x4ExtAddPairwiseI16x8U(i.OutputSimd128Register(),
                                    i.InputSimd128Register(0),
                                    kScratchDoubleReg);
       break;
     }
+    case kX64I32x8ExtAddPairwiseI16x16U: {
+      __ I32x8ExtAddPairwiseI16x16U(i.OutputSimd256Register(),
+                                    i.InputSimd256Register(0),
+                                    kScratchSimd256Reg);
+      break;
+    }
     case kX64I32X4ShiftZeroExtendI8x16: {
       XMMRegister dst = i.OutputSimd128Register();
       XMMRegister src = i.InputSimd128Register(0);
@@ -4372,14 +5316,32 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       SetupSimdImmediateInRegister(masm(), imm, dst);
       break;
     }
-    case kX64S128Zero: {
-      XMMRegister dst = i.OutputSimd128Register();
-      __ Pxor(dst, dst);
+    case kX64SZero: {
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {  // S128Zero
+        XMMRegister dst = i.OutputSimd128Register();
+        __ Pxor(dst, dst);
+      } else if (vec_len == kV256) {  // S256Zero
+        YMMRegister dst = i.OutputSimd256Register();
+        CpuFeatureScope avx2_scope(masm(), AVX2);
+        __ vpxor(dst, dst, dst);
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64S128AllOnes: {
-      XMMRegister dst = i.OutputSimd128Register();
-      __ Pcmpeqd(dst, dst);
+    case kX64SAllOnes: {
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {  // S128AllOnes
+        XMMRegister dst = i.OutputSimd128Register();
+        __ Pcmpeqd(dst, dst);
+      } else if (vec_len == kV256) {  // S256AllOnes
+        YMMRegister dst = i.OutputSimd256Register();
+        CpuFeatureScope avx2_scope(masm(), AVX2);
+        __ vpcmpeqd(dst, dst, dst);
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
     // case kX64I16x8ExtractLaneS: {
@@ -4420,16 +5382,89 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                 i.InputSimd128Register(0));
       break;
     }
+    case kX64I16x16SConvertI8x16: {
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      __ vpmovsxbw(i.OutputSimd256Register(), i.InputSimd128Register(0));
+      break;
+    }
     case kX64I16x8SConvertI32x4: {
       ASSEMBLE_SIMD_BINOP(packssdw);
       break;
     }
-    case kX64I16x8AddSatS: {
-      ASSEMBLE_SIMD_BINOP(paddsw);
+    case kX64IAddSatS: {
+      LaneSize lane_size = LaneSizeField::decode(opcode);
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x16AddSatS
+            ASSEMBLE_SIMD_BINOP(paddsb);
+            break;
+          }
+          case kL16: {
+            // I16x8AddSatS
+            ASSEMBLE_SIMD_BINOP(paddsw);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32AddSatS
+            ASSEMBLE_SIMD256_BINOP(paddsb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16AddSatS
+            ASSEMBLE_SIMD256_BINOP(paddsw, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64I16x8SubSatS: {
-      ASSEMBLE_SIMD_BINOP(psubsw);
+    case kX64ISubSatS: {
+      LaneSize lane_size = LaneSizeField::decode(opcode);
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x16SubSatS
+            ASSEMBLE_SIMD_BINOP(psubsb);
+            break;
+          }
+          case kL16: {
+            // I16x8SubSatS
+            ASSEMBLE_SIMD_BINOP(psubsw);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32SubSatS
+            ASSEMBLE_SIMD256_BINOP(psubsb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16SubSatS
+            ASSEMBLE_SIMD256_BINOP(psubsw, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
     case kX64I16x8UConvertI8x16Low: {
@@ -4441,20 +5476,127 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                 i.InputSimd128Register(0), kScratchDoubleReg);
       break;
     }
+    case kX64I16x16UConvertI8x16: {
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      __ vpmovzxbw(i.OutputSimd256Register(), i.InputSimd128Register(0));
+      break;
+    }
     case kX64I16x8UConvertI32x4: {
       ASSEMBLE_SIMD_BINOP(packusdw);
       break;
     }
-    case kX64I16x8AddSatU: {
-      ASSEMBLE_SIMD_BINOP(paddusw);
+    case kX64IAddSatU: {
+      LaneSize lane_size = LaneSizeField::decode(opcode);
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x16AddSatU
+            ASSEMBLE_SIMD_BINOP(paddusb);
+            break;
+          }
+          case kL16: {
+            // I16x8AddSatU
+            ASSEMBLE_SIMD_BINOP(paddusw);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32AddSatU
+            ASSEMBLE_SIMD256_BINOP(paddusb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16AddSatU
+            ASSEMBLE_SIMD256_BINOP(paddusw, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64I16x8SubSatU: {
-      ASSEMBLE_SIMD_BINOP(psubusw);
+    case kX64ISubSatU: {
+      LaneSize lane_size = LaneSizeField::decode(opcode);
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x16SubSatU
+            ASSEMBLE_SIMD_BINOP(psubusb);
+            break;
+          }
+          case kL16: {
+            // I16x8SubSatU
+            ASSEMBLE_SIMD_BINOP(psubusw);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32SubSatU
+            ASSEMBLE_SIMD256_BINOP(psubusb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16SubSatU
+            ASSEMBLE_SIMD256_BINOP(psubusw, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64I16x8RoundingAverageU: {
-      ASSEMBLE_SIMD_BINOP(pavgw);
+    case kX64IRoundingAverageU: {
+      LaneSize lane_size = LaneSizeField::decode(opcode);
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x16RoundingAverageU
+            ASSEMBLE_SIMD_BINOP(pavgb);
+            break;
+          }
+          case kL16: {
+            // I16x8RoundingAverageU
+            ASSEMBLE_SIMD_BINOP(pavgw);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else if (vec_len == kV256) {
+        switch (lane_size) {
+          case kL8: {
+            // I8x32RoundingAverageU
+            ASSEMBLE_SIMD256_BINOP(pavgb, AVX2);
+            break;
+          }
+          case kL16: {
+            // I16x16RoundingAverageU
+            ASSEMBLE_SIMD256_BINOP(pavgw, AVX2);
+            break;
+          }
+          default:
+            UNREACHABLE();
+        }
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
     case kX64I16x8ExtMulLowI8x16S: {
@@ -4485,11 +5627,23 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                                    kScratchRegister);
       break;
     }
+    case kX64I16x16ExtAddPairwiseI8x32S: {
+      __ I16x16ExtAddPairwiseI8x32S(i.OutputSimd256Register(),
+                                    i.InputSimd256Register(0),
+                                    kScratchSimd256Reg);
+      break;
+    }
     case kX64I16x8ExtAddPairwiseI8x16U: {
       __ I16x8ExtAddPairwiseI8x16U(i.OutputSimd128Register(),
                                    i.InputSimd128Register(0), kScratchRegister);
       break;
     }
+    case kX64I16x16ExtAddPairwiseI8x32U: {
+      __ I16x16ExtAddPairwiseI8x32U(i.OutputSimd256Register(),
+                                    i.InputSimd256Register(0),
+                                    kScratchSimd256Reg);
+      break;
+    }
     case kX64I16x8Q15MulRSatS: {
       __ I16x8Q15MulRSatS(i.OutputSimd128Register(), i.InputSimd128Register(0),
                           i.InputSimd128Register(1), kScratchDoubleReg);
@@ -4552,30 +5706,10 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       ASSEMBLE_SIMD_BINOP(packsswb);
       break;
     }
-    case kX64I8x16AddSatS: {
-      ASSEMBLE_SIMD_BINOP(paddsb);
-      break;
-    }
-    case kX64I8x16SubSatS: {
-      ASSEMBLE_SIMD_BINOP(psubsb);
-      break;
-    }
     case kX64I8x16UConvertI16x8: {
       ASSEMBLE_SIMD_BINOP(packuswb);
       break;
     }
-    case kX64I8x16AddSatU: {
-      ASSEMBLE_SIMD_BINOP(paddusb);
-      break;
-    }
-    case kX64I8x16SubSatU: {
-      ASSEMBLE_SIMD_BINOP(psubusb);
-      break;
-    }
-    case kX64I8x16RoundingAverageU: {
-      ASSEMBLE_SIMD_BINOP(pavgb);
-      break;
-    }
     case kX64I32x4ExtMulLowI16x8S: {
       __ I32x4ExtMul(i.OutputSimd128Register(), i.InputSimd128Register(0),
                      i.InputSimd128Register(1), kScratchDoubleReg,
@@ -4604,35 +5738,80 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                      /*is_signed=*/false);
       break;
     }
-    case kX64S128And: {
-      ASSEMBLE_SIMD_BINOP(pand);
+    case kX64SAnd: {
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {  // S128And
+        ASSEMBLE_SIMD_BINOP(pand);
+      } else if (vec_len == kV256) {  // S256And
+        ASSEMBLE_SIMD256_BINOP(pand, AVX2);
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64S128Or: {
-      ASSEMBLE_SIMD_BINOP(por);
+    case kX64SOr: {
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {  // S128Or
+        ASSEMBLE_SIMD_BINOP(por);
+      } else if (vec_len == kV256) {  // S256Or
+        ASSEMBLE_SIMD256_BINOP(por, AVX2);
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64S128Xor: {
-      ASSEMBLE_SIMD_BINOP(pxor);
+    case kX64SXor: {
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {  // S128Xor
+        ASSEMBLE_SIMD_BINOP(pxor);
+      } else if (vec_len == kV256) {  // S256Xor
+        ASSEMBLE_SIMD256_BINOP(pxor, AVX2);
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64S128Not: {
-      __ S128Not(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                 kScratchDoubleReg);
+    case kX64SNot: {
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {  // S128Not
+        __ S128Not(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                   kScratchDoubleReg);
+      } else if (vec_len == kV256) {  // S256Not
+        __ S256Not(i.OutputSimd256Register(), i.InputSimd256Register(0),
+                   kScratchSimd256Reg);
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64S128Select: {
-      __ S128Select(i.OutputSimd128Register(), i.InputSimd128Register(0),
-                    i.InputSimd128Register(1), i.InputSimd128Register(2),
-                    kScratchDoubleReg);
+    case kX64SSelect: {
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {  // S128Select
+        __ S128Select(i.OutputSimd128Register(), i.InputSimd128Register(0),
+                      i.InputSimd128Register(1), i.InputSimd128Register(2),
+                      kScratchDoubleReg);
+      } else if (vec_len == kV256) {  // S256Select
+        __ S256Select(i.OutputSimd256Register(), i.InputSimd256Register(0),
+                      i.InputSimd256Register(1), i.InputSimd256Register(2),
+                      kScratchSimd256Reg);
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
-    case kX64S128AndNot: {
-      XMMRegister dst = i.OutputSimd128Register();
-      DCHECK_EQ(dst, i.InputSimd128Register(0));
-      // The inputs have been inverted by instruction selector, so we can call
-      // andnps here without any modifications.
-      __ Andnps(dst, i.InputSimd128Register(1));
+    case kX64SAndNot: {
+      VectorLength vec_len = VectorLengthField::decode(opcode);
+      if (vec_len == kV128) {  // S128AndNot
+        // The inputs have been inverted by instruction selector, so we can call
+        // andnps here without any modifications.
+        ASSEMBLE_SIMD_BINOP(andnps);
+      } else if (vec_len == kV256) {  // S256AndNot
+        // The inputs have been inverted by instruction selector, so we can call
+        // andnps here without any modifications.
+        ASSEMBLE_SIMD256_BINOP(andnps, AVX);
+      } else {
+        UNREACHABLE();
+      }
       break;
     }
     case kX64I8x16Swizzle: {
@@ -4641,6 +5820,18 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
                       kScratchRegister, MiscField::decode(instr->opcode()));
       break;
     }
+    case kX64Vpshufd: {
+      if (instr->InputCount() == 2 && instr->InputAt(1)->IsImmediate()) {
+        YMMRegister dst = i.OutputSimd256Register();
+        YMMRegister src = i.InputSimd256Register(0);
+        uint8_t imm = i.InputUint8(1);
+        CpuFeatureScope avx2_scope(masm(), AVX2);
+        __ vpshufd(dst, src, imm);
+      } else {
+        UNIMPLEMENTED();
+      }
+      break;
+    }
     case kX64I8x16Shuffle: {
       XMMRegister dst = i.OutputSimd128Register();
       XMMRegister tmp_simd = i.TempSimd128Register(0);
@@ -4889,10 +6080,10 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       DCHECK_EQ(dst, i.InputSimd128Register(0));
       if (instr->InputCount() == 2) {
         ASSEMBLE_SIMD_INSTR(Movdqu, kScratchDoubleReg, 1);
-        __ Psrld(kScratchDoubleReg, byte{16});
+        __ Psrld(kScratchDoubleReg, uint8_t{16});
         src2 = kScratchDoubleReg;
       }
-      __ Psrld(dst, byte{16});
+      __ Psrld(dst, uint8_t{16});
       __ Packusdw(dst, src2);
       break;
     }
@@ -4915,10 +6106,10 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       DCHECK_EQ(dst, i.InputSimd128Register(0));
       if (instr->InputCount() == 2) {
         ASSEMBLE_SIMD_INSTR(Movdqu, kScratchDoubleReg, 1);
-        __ Psrlw(kScratchDoubleReg, byte{8});
+        __ Psrlw(kScratchDoubleReg, uint8_t{8});
         src2 = kScratchDoubleReg;
       }
-      __ Psrlw(dst, byte{8});
+      __ Psrlw(dst, uint8_t{8});
       __ Packuswb(dst, src2);
       break;
     }
@@ -4928,42 +6119,42 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       DCHECK_EQ(dst, i.InputSimd128Register(0));
       if (instr->InputCount() == 2) {
         ASSEMBLE_SIMD_INSTR(Movdqu, kScratchDoubleReg, 1);
-        __ Psllw(kScratchDoubleReg, byte{8});
-        __ Psrlw(kScratchDoubleReg, byte{8});
+        __ Psllw(kScratchDoubleReg, uint8_t{8});
+        __ Psrlw(kScratchDoubleReg, uint8_t{8});
         src2 = kScratchDoubleReg;
       }
-      __ Psllw(dst, byte{8});
-      __ Psrlw(dst, byte{8});
+      __ Psllw(dst, uint8_t{8});
+      __ Psrlw(dst, uint8_t{8});
       __ Packuswb(dst, src2);
       break;
     }
     case kX64S8x16TransposeLow: {
       XMMRegister dst = i.OutputSimd128Register();
       DCHECK_EQ(dst, i.InputSimd128Register(0));
-      __ Psllw(dst, byte{8});
+      __ Psllw(dst, uint8_t{8});
       if (instr->InputCount() == 1) {
         __ Movdqa(kScratchDoubleReg, dst);
       } else {
         DCHECK_EQ(2, instr->InputCount());
         ASSEMBLE_SIMD_INSTR(Movdqu, kScratchDoubleReg, 1);
-        __ Psllw(kScratchDoubleReg, byte{8});
+        __ Psllw(kScratchDoubleReg, uint8_t{8});
       }
-      __ Psrlw(dst, byte{8});
+      __ Psrlw(dst, uint8_t{8});
       __ Por(dst, kScratchDoubleReg);
       break;
     }
     case kX64S8x16TransposeHigh: {
       XMMRegister dst = i.OutputSimd128Register();
       DCHECK_EQ(dst, i.InputSimd128Register(0));
-      __ Psrlw(dst, byte{8});
+      __ Psrlw(dst, uint8_t{8});
       if (instr->InputCount() == 1) {
         __ Movdqa(kScratchDoubleReg, dst);
       } else {
         DCHECK_EQ(2, instr->InputCount());
         ASSEMBLE_SIMD_INSTR(Movdqu, kScratchDoubleReg, 1);
-        __ Psrlw(kScratchDoubleReg, byte{8});
+        __ Psrlw(kScratchDoubleReg, uint8_t{8});
       }
-      __ Psllw(kScratchDoubleReg, byte{8});
+      __ Psllw(kScratchDoubleReg, uint8_t{8});
       __ Por(dst, kScratchDoubleReg);
       break;
     }
@@ -4980,8 +6171,8 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
         __ Pshufhw(dst, dst, shuffle_mask);
       }
       __ Movdqa(kScratchDoubleReg, dst);
-      __ Psrlw(kScratchDoubleReg, byte{8});
-      __ Psllw(dst, byte{8});
+      __ Psrlw(kScratchDoubleReg, uint8_t{8});
+      __ Psllw(dst, uint8_t{8});
       __ Por(dst, kScratchDoubleReg);
       break;
     }
@@ -5253,6 +6444,22 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
     case kAtomicLoadWord32:
       UNREACHABLE();  // Won't be generated by instruction selector.
 
+    case kX64I32x8DotI16x16S: {
+      ASSEMBLE_SIMD256_BINOP(pmaddwd, AVX2);
+      break;
+    }
+    case kX64S256Load8Splat: {
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      __ vpbroadcastb(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
+    }
+    case kX64S256Load16Splat: {
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      CpuFeatureScope avx2_scope(masm(), AVX2);
+      __ vpbroadcastw(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
+    }
     case kX64S256Load32Splat: {
       EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
       CpuFeatureScope avx_scope(masm(), AVX);
@@ -5260,7 +6467,10 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       break;
     }
     case kX64S256Load64Splat: {
-      UNIMPLEMENTED();
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      CpuFeatureScope avx_scope(masm(), AVX);
+      __ vbroadcastsd(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
     }
     case kX64Movdqu256: {
       EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
@@ -5274,6 +6484,117 @@ CodeGenerator::CodeGenResult CodeGenerator::AssembleArchInstruction(
       }
       break;
     }
+    case kX64I16x16SConvertI32x8: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      YMMRegister dst = i.OutputSimd256Register();
+      __ vpackssdw(dst, i.InputSimd256Register(0), i.InputSimd256Register(1));
+      __ vpermq(dst, dst, 0xD8);  // 0b11011000
+      break;
+    }
+    case kX64I16x16UConvertI32x8: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      YMMRegister dst = i.OutputSimd256Register();
+      __ vpackusdw(dst, i.InputSimd256Register(0), i.InputSimd256Register(1));
+      __ vpermq(dst, dst, 0xD8);  // 0b11011000
+      break;
+    }
+    case kX64I8x32SConvertI16x16: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      YMMRegister dst = i.OutputSimd256Register();
+      __ vpacksswb(dst, i.InputSimd256Register(0), i.InputSimd256Register(1));
+      __ vpermq(dst, dst, 0xD8);  // 0b11011000
+      break;
+    }
+    case kX64I8x32UConvertI16x16: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      YMMRegister dst = i.OutputSimd256Register();
+      __ vpackuswb(dst, i.InputSimd256Register(0), i.InputSimd256Register(1));
+      __ vpermq(dst, dst, 0xD8);  // 0b11011000
+      break;
+    }
+    case kX64I64x4ExtMulI32x4S: {
+      __ I64x4ExtMul(i.OutputSimd256Register(), i.InputSimd128Register(0),
+                     i.InputSimd128Register(1), kScratchSimd256Reg,
+                     /*is_signed=*/true);
+      break;
+    }
+    case kX64I64x4ExtMulI32x4U: {
+      __ I64x4ExtMul(i.OutputSimd256Register(), i.InputSimd128Register(0),
+                     i.InputSimd128Register(1), kScratchSimd256Reg,
+                     /*is_signed=*/false);
+      break;
+    }
+    case kX64I32x8ExtMulI16x8S: {
+      __ I32x8ExtMul(i.OutputSimd256Register(), i.InputSimd128Register(0),
+                     i.InputSimd128Register(1), kScratchSimd256Reg,
+                     /*is_signed=*/true);
+      break;
+    }
+    case kX64I32x8ExtMulI16x8U: {
+      __ I32x8ExtMul(i.OutputSimd256Register(), i.InputSimd128Register(0),
+                     i.InputSimd128Register(1), kScratchSimd256Reg,
+                     /*is_signed=*/false);
+      break;
+    }
+    case kX64I16x16ExtMulI8x16S: {
+      __ I16x16ExtMul(i.OutputSimd256Register(), i.InputSimd128Register(0),
+                      i.InputSimd128Register(1), kScratchSimd256Reg,
+                      /*is_signed=*/true);
+      break;
+    }
+    case kX64I16x16ExtMulI8x16U: {
+      __ I16x16ExtMul(i.OutputSimd256Register(), i.InputSimd128Register(0),
+                      i.InputSimd128Register(1), kScratchSimd256Reg,
+                      /*is_signed=*/false);
+      break;
+    }
+    case kX64S256Load8x16S: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ vpmovsxbw(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
+    }
+    case kX64S256Load8x16U: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ vpmovzxbw(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
+    }
+    case kX64S256Load16x8S: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ vpmovsxwd(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
+    }
+    case kX64S256Load16x8U: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ vpmovzxwd(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
+    }
+    case kX64S256Load32x4S: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ vpmovsxdq(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
+    }
+    case kX64S256Load32x4U: {
+      CpuFeatureScope avx_scope(masm(), AVX2);
+      EmitOOLTrapIfNeeded(zone(), this, opcode, instr, __ pc_offset());
+      __ vpmovzxdq(i.OutputSimd256Register(), i.MemoryOperand());
+      break;
+    }
+    case kX64S256Const: {
+      // Emit code for generic constants as all zeros, or ones cases will be
+      // handled separately by the selector.
+      YMMRegister dst = i.OutputSimd256Register();
+      uint32_t imm[8] = {};
+      for (int j = 0; j < 8; j++) {
+        imm[j] = i.InputUint32(j);
+      }
+      SetupSimd256ImmediateInRegister(masm(), imm, dst, kScratchDoubleReg);
+      break;
+    }
   }
   return kSuccess;
 }  // NOLadability/fn_size)
@@ -5489,7 +6810,7 @@ void CodeGenerator::AssembleArchTableSwitch(Instruction* instr) {
   X64OperandConverter i(this, instr);
   Register input = i.InputRegister(0);
   int32_t const case_count = static_cast<int32_t>(instr->InputCount() - 2);
-  Label** cases = zone()->NewArray<Label*>(case_count);
+  Label** cases = zone()->AllocateArray<Label*>(case_count);
   for (int32_t index = 0; index < case_count; ++index) {
     cases[index] = GetLabel(i.InputRpo(index + 2));
   }
@@ -5497,7 +6818,22 @@ void CodeGenerator::AssembleArchTableSwitch(Instruction* instr) {
   __ cmpl(input, Immediate(case_count));
   __ j(above_equal, GetLabel(i.InputRpo(1)));
   __ leaq(kScratchRegister, Operand(table));
-  __ jmp(Operand(kScratchRegister, input, times_8, 0));
+
+  if (V8_UNLIKELY(Builtins::IsBuiltinId(masm_.builtin()))) {
+    // For builtins, the value in the table is 'target_address - table_address'
+    // (4 bytes) Load the value in the table with index.
+    // value = [table +index*4]
+    __ movsxlq(input, Operand(kScratchRegister, input, times_4, 0));
+    // Calculate the absolute address of target:
+    // target = table + (target - table)
+    __ addq(input, kScratchRegister);
+    // Jump to the target.
+    __ jmp(input);
+  } else {
+    // For non builtins, the value in the table is 'target_address' (8 bytes)
+    // jmp [table + index*8]
+    __ jmp(Operand(kScratchRegister, input, times_8, 0));
+  }
 }
 
 void CodeGenerator::AssembleArchSelect(Instruction* instr,
@@ -5748,8 +7084,13 @@ void CodeGenerator::AssembleReturn(InstructionOperand* additional_pop_count) {
         g.ToConstant(additional_pop_count).ToInt32() == 0) {
       // Canonicalize JSFunction return sites for now.
       if (return_label_.is_bound()) {
-        __ jmp(&return_label_);
-        return;
+        // Emit a far jump here can't save code size but may bring some
+        // regression, so we just forward when it is a near jump.
+        const bool is_near_jump = is_int8(return_label_.pos() - __ pc_offset());
+        if (drop_jsargs || is_near_jump) {
+          __ jmp(&return_label_);
+          return;
+        }
       } else {
         __ bind(&return_label_);
       }
@@ -5859,23 +7200,25 @@ AllocatedOperand CodeGenerator::Push(InstructionOperand* source) {
 
 void CodeGenerator::Pop(InstructionOperand* dest, MachineRepresentation rep) {
   X64OperandConverter g(this, nullptr);
-  int new_slots = ElementSizeInPointers(rep);
-  frame_access_state()->IncreaseSPDelta(-new_slots);
+  int dropped_slots = ElementSizeInPointers(rep);
   if (dest->IsRegister()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ popq(g.ToRegister(dest));
   } else if (dest->IsStackSlot() || dest->IsFloatStackSlot() ||
              dest->IsDoubleStackSlot()) {
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
     __ popq(g.ToOperand(dest));
   } else {
     int last_frame_slot_id =
         frame_access_state_->frame()->GetTotalFrameSlotCount() - 1;
     int sp_delta = frame_access_state_->sp_delta();
-    int slot_id = last_frame_slot_id + sp_delta + new_slots;
+    int slot_id = last_frame_slot_id + sp_delta;
     AllocatedOperand stack_slot(LocationOperand::STACK_SLOT, rep, slot_id);
     AssembleMove(&stack_slot, dest);
-    __ addq(rsp, Immediate(new_slots * kSystemPointerSize));
+    frame_access_state()->IncreaseSPDelta(-dropped_slots);
+    __ addq(rsp, Immediate(dropped_slots * kSystemPointerSize));
   }
-  temp_slots_ -= new_slots;
+  temp_slots_ -= dropped_slots;
 }
 
 void CodeGenerator::PopTempStackSlots() {
@@ -6320,6 +7663,23 @@ void CodeGenerator::AssembleSwap(InstructionOperand* source,
 }
 
 void CodeGenerator::AssembleJumpTable(Label** targets, size_t target_count) {
+#ifdef V8_ENABLE_BUILTIN_JUMP_TABLE_SWITCH
+  // For builtins, the value in table is `target_address - table_address`.
+  // The reason is that the builtins code position may be changed so the table
+  // value should be position independent.
+  if (V8_UNLIKELY(Builtins::IsBuiltinId(masm_.builtin()))) {
+    int table_pos = __ pc_offset();
+
+    for (size_t index = 0; index < target_count; ++index) {
+      __ WriteBuiltinJumpTableEntry(targets[index], table_pos);
+    }
+    return;
+  }
+
+#endif  // V8_ENABLE_BUILTIN_JUMP_TABLE_SWITCH
+
+  // For non-builtins, the value in table is just the target absolute address,
+  // it's position dependent.
   for (size_t index = 0; index < target_count; ++index) {
     __ dq(targets[index]);
   }
diff --git a/deps/v8/src/compiler/backend/x64/instruction-codes-x64.h b/deps/v8/src/compiler/backend/x64/instruction-codes-x64.h
index d1b7eb639e82b9..bc6dbd460bb36b 100644
--- a/deps/v8/src/compiler/backend/x64/instruction-codes-x64.h
+++ b/deps/v8/src/compiler/backend/x64/instruction-codes-x64.h
@@ -61,8 +61,16 @@ namespace compiler {
   V(X64MovqDecompressTaggedSigned)                         \
   V(X64MovqDecompressTagged)                               \
   V(X64MovqCompressTagged)                                 \
+  V(X64S256Load8Splat)                                     \
+  V(X64S256Load16Splat)                                    \
   V(X64S256Load32Splat)                                    \
-  V(X64S256Load64Splat)
+  V(X64S256Load64Splat)                                    \
+  V(X64S256Load8x16S)                                      \
+  V(X64S256Load8x16U)                                      \
+  V(X64S256Load16x8S)                                      \
+  V(X64S256Load16x8U)                                      \
+  V(X64S256Load32x4S)                                      \
+  V(X64S256Load32x4U)
 
 #define TARGET_ARCH_OPCODE_LIST(V)                   \
   TARGET_ARCH_OPCODE_WITH_MEMORY_ACCESS_MODE_LIST(V) \
@@ -175,6 +183,7 @@ namespace compiler {
   V(X64Float64Neg)                                   \
   V(X64Float32Abs)                                   \
   V(X64Float32Neg)                                   \
+  V(X64MovqStoreIndirectPointer)                     \
   V(X64MovqEncodeSandboxedPointer)                   \
   V(X64MovqDecodeSandboxedPointer)                   \
   V(X64BitcastFI)                                    \
@@ -214,15 +223,19 @@ namespace compiler {
   V(X64Maxpd)                                        \
   V(X64F64x2Round)                                   \
   V(X64F64x2ConvertLowI32x4S)                        \
+  V(X64F64x4ConvertI32x4S)                           \
   V(X64F64x2ConvertLowI32x4U)                        \
   V(X64F32x4SConvertI32x4)                           \
+  V(X64F32x8SConvertI32x8)                           \
   V(X64F32x4UConvertI32x4)                           \
+  V(X64F32x8UConvertI32x8)                           \
   V(X64F32x4Qfma)                                    \
   V(X64F32x4Qfms)                                    \
   V(X64Minps)                                        \
   V(X64Maxps)                                        \
   V(X64F32x4Round)                                   \
   V(X64F32x4DemoteF64x2Zero)                         \
+  V(X64F32x4DemoteF64x4)                             \
   V(X64ISplat)                                       \
   V(X64IExtractLane)                                 \
   V(X64IAbs)                                         \
@@ -244,70 +257,83 @@ namespace compiler {
   V(X64I64x2ExtMulHighI32x4U)                        \
   V(X64I64x2SConvertI32x4Low)                        \
   V(X64I64x2SConvertI32x4High)                       \
+  V(X64I64x4SConvertI32x4)                           \
   V(X64I64x2UConvertI32x4Low)                        \
   V(X64I64x2UConvertI32x4High)                       \
+  V(X64I64x4UConvertI32x4)                           \
   V(X64I32x4SConvertF32x4)                           \
   V(X64I32x4SConvertI16x8Low)                        \
   V(X64I32x4SConvertI16x8High)                       \
+  V(X64I32x8SConvertI16x8)                           \
   V(X64IMinS)                                        \
   V(X64IMaxS)                                        \
   V(X64I32x4UConvertF32x4)                           \
+  V(X64I32x8UConvertF32x8)                           \
   V(X64I32x4UConvertI16x8Low)                        \
   V(X64I32x4UConvertI16x8High)                       \
+  V(X64I32x8UConvertI16x8)                           \
   V(X64IMinU)                                        \
   V(X64IMaxU)                                        \
   V(X64IGtU)                                         \
   V(X64IGeU)                                         \
   V(X64I32x4DotI16x8S)                               \
+  V(X64I32x8DotI16x16S)                              \
   V(X64I32x4DotI8x16I7x16AddS)                       \
   V(X64I32x4ExtMulLowI16x8S)                         \
   V(X64I32x4ExtMulHighI16x8S)                        \
   V(X64I32x4ExtMulLowI16x8U)                         \
   V(X64I32x4ExtMulHighI16x8U)                        \
   V(X64I32x4ExtAddPairwiseI16x8S)                    \
+  V(X64I32x8ExtAddPairwiseI16x16S)                   \
   V(X64I32x4ExtAddPairwiseI16x8U)                    \
+  V(X64I32x8ExtAddPairwiseI16x16U)                   \
   V(X64I32x4TruncSatF64x2SZero)                      \
   V(X64I32x4TruncSatF64x2UZero)                      \
   V(X64I32X4ShiftZeroExtendI8x16)                    \
   V(X64IExtractLaneS)                                \
   V(X64I16x8SConvertI8x16Low)                        \
   V(X64I16x8SConvertI8x16High)                       \
+  V(X64I16x16SConvertI8x16)                          \
   V(X64I16x8SConvertI32x4)                           \
-  V(X64I16x8AddSatS)                                 \
-  V(X64I16x8SubSatS)                                 \
+  V(X64I16x16SConvertI32x8)                          \
+  V(X64IAddSatS)                                     \
+  V(X64ISubSatS)                                     \
   V(X64I16x8UConvertI8x16Low)                        \
   V(X64I16x8UConvertI8x16High)                       \
+  V(X64I16x16UConvertI8x16)                          \
   V(X64I16x8UConvertI32x4)                           \
-  V(X64I16x8AddSatU)                                 \
-  V(X64I16x8SubSatU)                                 \
-  V(X64I16x8RoundingAverageU)                        \
+  V(X64I16x16UConvertI32x8)                          \
+  V(X64IAddSatU)                                     \
+  V(X64ISubSatU)                                     \
+  V(X64IRoundingAverageU)                            \
   V(X64I16x8ExtMulLowI8x16S)                         \
   V(X64I16x8ExtMulHighI8x16S)                        \
   V(X64I16x8ExtMulLowI8x16U)                         \
   V(X64I16x8ExtMulHighI8x16U)                        \
   V(X64I16x8ExtAddPairwiseI8x16S)                    \
+  V(X64I16x16ExtAddPairwiseI8x32S)                   \
   V(X64I16x8ExtAddPairwiseI8x16U)                    \
+  V(X64I16x16ExtAddPairwiseI8x32U)                   \
   V(X64I16x8Q15MulRSatS)                             \
   V(X64I16x8RelaxedQ15MulRS)                         \
   V(X64I16x8DotI8x16I7x16S)                          \
   V(X64I8x16SConvertI16x8)                           \
-  V(X64I8x16AddSatS)                                 \
-  V(X64I8x16SubSatS)                                 \
+  V(X64I8x32SConvertI16x16)                          \
   V(X64I8x16UConvertI16x8)                           \
-  V(X64I8x16AddSatU)                                 \
-  V(X64I8x16SubSatU)                                 \
-  V(X64I8x16RoundingAverageU)                        \
+  V(X64I8x32UConvertI16x16)                          \
   V(X64S128Const)                                    \
-  V(X64S128Zero)                                     \
-  V(X64S128AllOnes)                                  \
-  V(X64S128Not)                                      \
-  V(X64S128And)                                      \
-  V(X64S128Or)                                       \
-  V(X64S128Xor)                                      \
-  V(X64S128Select)                                   \
-  V(X64S128AndNot)                                   \
+  V(X64S256Const)                                    \
+  V(X64SZero)                                        \
+  V(X64SAllOnes)                                     \
+  V(X64SNot)                                         \
+  V(X64SAnd)                                         \
+  V(X64SOr)                                          \
+  V(X64SXor)                                         \
+  V(X64SSelect)                                      \
+  V(X64SAndNot)                                      \
   V(X64I8x16Swizzle)                                 \
   V(X64I8x16Shuffle)                                 \
+  V(X64Vpshufd)                                      \
   V(X64I8x16Popcnt)                                  \
   V(X64Shufps)                                       \
   V(X64S32x4Rotate)                                  \
@@ -341,7 +367,17 @@ namespace compiler {
   V(X64Blendvpd)                                     \
   V(X64Blendvps)                                     \
   V(X64Pblendvb)                                     \
-  V(X64TraceInstruction)
+  V(X64I64x4ExtMulI32x4S)                            \
+  V(X64I64x4ExtMulI32x4U)                            \
+  V(X64I32x8ExtMulI16x8S)                            \
+  V(X64I32x8ExtMulI16x8U)                            \
+  V(X64I16x16ExtMulI8x16S)                           \
+  V(X64I16x16ExtMulI8x16U)                           \
+  V(X64TraceInstruction)                             \
+  V(X64F32x8Pmin)                                    \
+  V(X64F32x8Pmax)                                    \
+  V(X64F64x4Pmin)                                    \
+  V(X64F64x4Pmax)
 // Addressing modes represent the "shape" of inputs to an instruction.
 // Many instructions support multiple addressing modes. Addressing modes
 // are encoded into the InstructionCode of the instruction and tell the
diff --git a/deps/v8/src/compiler/backend/x64/instruction-scheduler-x64.cc b/deps/v8/src/compiler/backend/x64/instruction-scheduler-x64.cc
index 38a9a5f872c8dd..fde5b7262f9d2b 100644
--- a/deps/v8/src/compiler/backend/x64/instruction-scheduler-x64.cc
+++ b/deps/v8/src/compiler/backend/x64/instruction-scheduler-x64.cc
@@ -154,18 +154,26 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kX64F64x2Qfms:
     case kX64Minpd:
     case kX64Maxpd:
+    case kX64F32x8Pmin:
+    case kX64F32x8Pmax:
+    case kX64F64x4Pmin:
+    case kX64F64x4Pmax:
     case kX64F64x2Round:
     case kX64F64x2ConvertLowI32x4S:
+    case kX64F64x4ConvertI32x4S:
     case kX64F64x2ConvertLowI32x4U:
     case kX64F64x2PromoteLowF32x4:
     case kX64F32x4SConvertI32x4:
+    case kX64F32x8SConvertI32x8:
     case kX64F32x4UConvertI32x4:
+    case kX64F32x8UConvertI32x8:
     case kX64F32x4Qfma:
     case kX64F32x4Qfms:
     case kX64Minps:
     case kX64Maxps:
     case kX64F32x4Round:
     case kX64F32x4DemoteF64x2Zero:
+    case kX64F32x4DemoteF64x4:
     case kX64ISplat:
     case kX64IExtractLane:
     case kX64IAbs:
@@ -183,74 +191,93 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kX64IShrU:
     case kX64I64x2ExtMulLowI32x4S:
     case kX64I64x2ExtMulHighI32x4S:
+    case kX64I64x4ExtMulI32x4S:
     case kX64I64x2ExtMulLowI32x4U:
     case kX64I64x2ExtMulHighI32x4U:
+    case kX64I64x4ExtMulI32x4U:
     case kX64I64x2SConvertI32x4Low:
     case kX64I64x2SConvertI32x4High:
+    case kX64I64x4SConvertI32x4:
     case kX64I64x2UConvertI32x4Low:
     case kX64I64x2UConvertI32x4High:
+    case kX64I64x4UConvertI32x4:
     case kX64I32x4SConvertF32x4:
     case kX64I32x4SConvertI16x8Low:
     case kX64I32x4SConvertI16x8High:
+    case kX64I32x8SConvertI16x8:
     case kX64IMinS:
     case kX64IMaxS:
     case kX64I32x4UConvertF32x4:
+    case kX64I32x8UConvertF32x8:
     case kX64I32x4UConvertI16x8Low:
     case kX64I32x4UConvertI16x8High:
+    case kX64I32x8UConvertI16x8:
     case kX64IMinU:
     case kX64IMaxU:
     case kX64IGtU:
     case kX64IGeU:
     case kX64I32x4DotI16x8S:
+    case kX64I32x8DotI16x16S:
     case kX64I32x4DotI8x16I7x16AddS:
     case kX64I32x4ExtMulLowI16x8S:
     case kX64I32x4ExtMulHighI16x8S:
+    case kX64I32x8ExtMulI16x8S:
     case kX64I32x4ExtMulLowI16x8U:
     case kX64I32x4ExtMulHighI16x8U:
+    case kX64I32x8ExtMulI16x8U:
     case kX64I32x4ExtAddPairwiseI16x8S:
+    case kX64I32x8ExtAddPairwiseI16x16S:
     case kX64I32x4ExtAddPairwiseI16x8U:
+    case kX64I32x8ExtAddPairwiseI16x16U:
     case kX64I32x4TruncSatF64x2SZero:
     case kX64I32x4TruncSatF64x2UZero:
     case kX64I32X4ShiftZeroExtendI8x16:
     case kX64IExtractLaneS:
     case kX64I16x8SConvertI8x16Low:
     case kX64I16x8SConvertI8x16High:
+    case kX64I16x16SConvertI8x16:
     case kX64I16x8SConvertI32x4:
-    case kX64I16x8AddSatS:
-    case kX64I16x8SubSatS:
+    case kX64I16x16SConvertI32x8:
+    case kX64IAddSatS:
+    case kX64ISubSatS:
     case kX64I16x8UConvertI8x16Low:
     case kX64I16x8UConvertI8x16High:
+    case kX64I16x16UConvertI8x16:
     case kX64I16x8UConvertI32x4:
-    case kX64I16x8AddSatU:
-    case kX64I16x8SubSatU:
-    case kX64I16x8RoundingAverageU:
+    case kX64I16x16UConvertI32x8:
+    case kX64IAddSatU:
+    case kX64ISubSatU:
+    case kX64IRoundingAverageU:
     case kX64I16x8ExtMulLowI8x16S:
     case kX64I16x8ExtMulHighI8x16S:
+    case kX64I16x16ExtMulI8x16S:
     case kX64I16x8ExtMulLowI8x16U:
     case kX64I16x8ExtMulHighI8x16U:
+    case kX64I16x16ExtMulI8x16U:
     case kX64I16x8ExtAddPairwiseI8x16S:
+    case kX64I16x16ExtAddPairwiseI8x32S:
     case kX64I16x8ExtAddPairwiseI8x16U:
+    case kX64I16x16ExtAddPairwiseI8x32U:
     case kX64I16x8Q15MulRSatS:
     case kX64I16x8RelaxedQ15MulRS:
     case kX64I16x8DotI8x16I7x16S:
     case kX64I8x16SConvertI16x8:
-    case kX64I8x16AddSatS:
-    case kX64I8x16SubSatS:
+    case kX64I8x32SConvertI16x16:
     case kX64I8x16UConvertI16x8:
-    case kX64I8x16AddSatU:
-    case kX64I8x16SubSatU:
-    case kX64I8x16RoundingAverageU:
-    case kX64S128And:
-    case kX64S128Or:
-    case kX64S128Xor:
-    case kX64S128Not:
-    case kX64S128Select:
+    case kX64I8x32UConvertI16x16:
+    case kX64SAnd:
+    case kX64SOr:
+    case kX64SXor:
+    case kX64SNot:
+    case kX64SSelect:
     case kX64S128Const:
-    case kX64S128Zero:
-    case kX64S128AllOnes:
-    case kX64S128AndNot:
+    case kX64S256Const:
+    case kX64SZero:
+    case kX64SAllOnes:
+    case kX64SAndNot:
     case kX64IAllTrue:
     case kX64I8x16Swizzle:
+    case kX64Vpshufd:
     case kX64I8x16Shuffle:
     case kX64I8x16Popcnt:
     case kX64Shufps:
@@ -329,6 +356,7 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kX64MovqDecompressTaggedSigned:
     case kX64MovqDecompressTagged:
     case kX64MovqCompressTagged:
+    case kX64MovqStoreIndirectPointer:
     case kX64MovqDecodeSandboxedPointer:
     case kX64MovqEncodeSandboxedPointer:
     case kX64Movq:
@@ -337,7 +365,9 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kX64Movdqu:
     case kX64Movdqu256:
     case kX64S128Load8Splat:
+    case kX64S256Load8Splat:
     case kX64S128Load16Splat:
+    case kX64S256Load16Splat:
     case kX64S128Load32Splat:
     case kX64S256Load32Splat:
     case kX64S128Load64Splat:
@@ -348,6 +378,12 @@ int InstructionScheduler::GetTargetInstructionFlags(
     case kX64S128Load16x4U:
     case kX64S128Load32x2S:
     case kX64S128Load32x2U:
+    case kX64S256Load8x16S:
+    case kX64S256Load8x16U:
+    case kX64S256Load16x8S:
+    case kX64S256Load16x8U:
+    case kX64S256Load32x4S:
+    case kX64S256Load32x4U:
       return instr->HasOutput() ? kIsLoadOperation : kHasSideEffect;
 
     case kX64Peek:
diff --git a/deps/v8/src/compiler/backend/x64/instruction-selector-x64.cc b/deps/v8/src/compiler/backend/x64/instruction-selector-x64.cc
index 9b987bc82b722a..c0d0d6ac720ec8 100644
--- a/deps/v8/src/compiler/backend/x64/instruction-selector-x64.cc
+++ b/deps/v8/src/compiler/backend/x64/instruction-selector-x64.cc
@@ -3,19 +3,29 @@
 // found in the LICENSE file.
 
 #include <algorithm>
+#include <cstdint>
+#include <limits>
 
 #include "src/base/iterator.h"
 #include "src/base/logging.h"
+#include "src/base/optional.h"
 #include "src/base/overflowing-math.h"
 #include "src/codegen/cpu-features.h"
 #include "src/codegen/machine-type.h"
+#include "src/common/assert-scope.h"
 #include "src/compiler/backend/instruction-codes.h"
+#include "src/compiler/backend/instruction-selector-adapter.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
+#include "src/compiler/backend/instruction-selector.h"
 #include "src/compiler/backend/instruction.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/opcodes.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/representations.h"
+#include "src/handles/handles-inl.h"
+#include "src/objects/slots-inl.h"
 #include "src/roots/roots-inl.h"
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -45,73 +55,421 @@ bool IsCompressed(Node* const node) {
   return false;
 }
 
+template <typename Adapter>
+bool IsCompressed(InstructionSelectorT<Adapter>* selector,
+                  turboshaft::OpIndex node) {
+  if (!node.valid()) return false;
+  if (selector->is_load(node)) {
+    auto load = selector->load_view(node);
+    return load.loaded_rep().IsCompressed();
+  } else if (selector->IsPhi(node)) {
+    MachineRepresentation phi_rep = selector->phi_representation_of(node);
+    return phi_rep == MachineRepresentation::kCompressed ||
+           phi_rep == MachineRepresentation::kCompressedPointer;
+  }
+  return false;
+}
+
 }  // namespace
 
-// Adds X64-specific methods for generating operands.
-class X64OperandGenerator final : public OperandGenerator {
- public:
-  explicit X64OperandGenerator(InstructionSelector* selector)
-      : OperandGenerator(selector) {}
+template <typename Adapter>
+struct ScaledIndexMatch {
+  using node_t = typename Adapter::node_t;
 
-  bool CanBeImmediate(Node* node) {
-    switch (node->opcode()) {
-      case IrOpcode::kCompressedHeapConstant: {
-        if (!COMPRESS_POINTERS_BOOL) return false;
-        // For builtin code we need static roots
-        if (selector()->isolate()->bootstrapper() && !V8_STATIC_ROOTS_BOOL) {
-          return false;
-        }
-        const RootsTable& roots_table = selector()->isolate()->roots_table();
-        RootIndex root_index;
-        CompressedHeapObjectMatcher m(node);
-        if (m.HasResolvedValue() &&
-            roots_table.IsRootHandle(m.ResolvedValue(), &root_index)) {
-          return RootsTable::IsReadOnly(root_index);
+  node_t base;
+  node_t index;
+  int scale;
+};
+
+template <typename ScaleMatcher>
+base::Optional<ScaledIndexMatch<TurbofanAdapter>> TryMatchScaledIndex(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
+    bool allow_power_of_two_plus_one) {
+  ScaleMatcher m(node, allow_power_of_two_plus_one);
+  if (!m.matches()) return base::nullopt;
+  ScaledIndexMatch<TurbofanAdapter> match;
+  match.index = node->InputAt(0);
+  match.base = m.power_of_two_plus_one() ? match.index : nullptr;
+  match.scale = m.scale();
+  return match;
+}
+
+base::Optional<ScaledIndexMatch<TurbofanAdapter>> TryMatchScaledIndex32(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
+    bool allow_power_of_two_plus_one) {
+  return TryMatchScaledIndex<Int32ScaleMatcher>(selector, node,
+                                                allow_power_of_two_plus_one);
+}
+
+base::Optional<ScaledIndexMatch<TurbofanAdapter>> TryMatchScaledIndex64(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
+    bool allow_power_of_two_plus_one) {
+  return TryMatchScaledIndex<Int64ScaleMatcher>(selector, node,
+                                                allow_power_of_two_plus_one);
+}
+
+bool MatchScaledIndex(InstructionSelectorT<TurboshaftAdapter>* selector,
+                      turboshaft::OpIndex node, turboshaft::OpIndex* index,
+                      int* scale, bool* power_of_two_plus_one) {
+  DCHECK_NOT_NULL(index);
+  DCHECK_NOT_NULL(scale);
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+
+  auto MatchScaleConstant = [=](const Operation& op, int& scale,
+                                bool* plus_one) {
+    const ConstantOp* constant = op.TryCast<ConstantOp>();
+    if (constant == nullptr) return false;
+    if (constant->kind != ConstantOp::Kind::kWord32 &&
+        constant->kind != ConstantOp::Kind::kWord64) {
+      return false;
+    }
+    uint64_t value = constant->integral();
+    if (plus_one) *plus_one = false;
+    if (value == 1) return (scale = 0), true;
+    if (value == 2) return (scale = 1), true;
+    if (value == 4) return (scale = 2), true;
+    if (value == 8) return (scale = 3), true;
+    if (plus_one == nullptr) return false;
+    *plus_one = true;
+    if (value == 3) return (scale = 1), true;
+    if (value == 5) return (scale = 2), true;
+    if (value == 9) return (scale = 3), true;
+    return false;
+  };
+
+  const Operation& op = selector->Get(node);
+  if (const WordBinopOp* binop = op.TryCast<WordBinopOp>()) {
+    if (binop->kind != WordBinopOp::Kind::kMul) return false;
+    if (MatchScaleConstant(selector->Get(binop->right()), *scale,
+                           power_of_two_plus_one)) {
+      *index = binop->left();
+      return true;
+    }
+    if (MatchScaleConstant(selector->Get(binop->left()), *scale,
+                           power_of_two_plus_one)) {
+      *index = binop->right();
+      return true;
+    }
+    return false;
+  } else if (const ShiftOp* shift = op.TryCast<ShiftOp>()) {
+    if (shift->kind != ShiftOp::Kind::kShiftLeft) return false;
+    int64_t scale_value;
+    if (selector->MatchSignedIntegralConstant(shift->right(), &scale_value)) {
+      if (scale_value < 0 || scale_value > 3) return false;
+      *index = shift->left();
+      *scale = static_cast<int>(scale_value);
+      if (power_of_two_plus_one) *power_of_two_plus_one = false;
+      return true;
+    }
+  }
+  return false;
+}
+
+base::Optional<ScaledIndexMatch<TurboshaftAdapter>> TryMatchScaledIndex(
+    InstructionSelectorT<TurboshaftAdapter>* selector, turboshaft::OpIndex node,
+    bool allow_power_of_two_plus_one) {
+  ScaledIndexMatch<TurboshaftAdapter> match;
+  bool plus_one = false;
+  if (MatchScaledIndex(selector, node, &match.index, &match.scale,
+                       allow_power_of_two_plus_one ? &plus_one : nullptr)) {
+    match.base = plus_one ? match.index : turboshaft::OpIndex{};
+    return match;
+  }
+  return base::nullopt;
+}
+
+base::Optional<ScaledIndexMatch<TurboshaftAdapter>> TryMatchScaledIndex32(
+    InstructionSelectorT<TurboshaftAdapter>* selector, turboshaft::OpIndex node,
+    bool allow_power_of_two_plus_one) {
+  return TryMatchScaledIndex(selector, node, allow_power_of_two_plus_one);
+}
+
+base::Optional<ScaledIndexMatch<TurboshaftAdapter>> TryMatchScaledIndex64(
+    InstructionSelectorT<TurboshaftAdapter>* selector, turboshaft::OpIndex node,
+    bool allow_power_of_two_plus_one) {
+  return TryMatchScaledIndex(selector, node, allow_power_of_two_plus_one);
+}
+
+template <typename Adapter>
+struct BaseWithScaledIndexAndDisplacementMatch {
+  using node_t = typename Adapter::node_t;
+
+  node_t base;
+  node_t index;
+  int scale = 0;
+  int64_t displacement = 0;
+  DisplacementMode displacement_mode = kPositiveDisplacement;
+};
+
+template <typename BaseWithIndexAndDisplacementMatcher>
+base::Optional<BaseWithScaledIndexAndDisplacementMatch<TurbofanAdapter>>
+TryMatchBaseWithScaledIndexAndDisplacement(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node) {
+  BaseWithScaledIndexAndDisplacementMatch<TurbofanAdapter> result;
+  BaseWithIndexAndDisplacementMatcher m(node);
+  if (m.matches()) {
+    result.base = m.base();
+    result.index = m.index();
+    result.scale = m.scale();
+    if (m.displacement() == nullptr) {
+      result.displacement = 0;
+    } else {
+      if (m.displacement()->opcode() == IrOpcode::kInt64Constant) {
+        result.displacement = OpParameter<int64_t>(m.displacement()->op());
+      } else {
+        DCHECK_EQ(m.displacement()->opcode(), IrOpcode::kInt32Constant);
+        result.displacement = OpParameter<int32_t>(m.displacement()->op());
+      }
+    }
+    result.displacement_mode = m.displacement_mode();
+    return result;
+  }
+  return base::nullopt;
+}
+
+base::Optional<BaseWithScaledIndexAndDisplacementMatch<TurbofanAdapter>>
+TryMatchBaseWithScaledIndexAndDisplacement64(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node) {
+  return TryMatchBaseWithScaledIndexAndDisplacement<
+      BaseWithIndexAndDisplacement64Matcher>(selector, node);
+}
+
+base::Optional<BaseWithScaledIndexAndDisplacementMatch<TurbofanAdapter>>
+TryMatchBaseWithScaledIndexAndDisplacement32(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node) {
+  return TryMatchBaseWithScaledIndexAndDisplacement<
+      BaseWithIndexAndDisplacement32Matcher>(selector, node);
+}
+
+base::Optional<BaseWithScaledIndexAndDisplacementMatch<TurboshaftAdapter>>
+TryMatchBaseWithScaledIndexAndDisplacement64(
+    InstructionSelectorT<TurboshaftAdapter>* selector,
+    turboshaft::OpIndex node) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+
+  // The BaseWithIndexAndDisplacementMatcher canonicalizes the order of
+  // displacements and scale factors that are used as inputs, so instead of
+  // enumerating all possible patterns by brute force, checking for node
+  // clusters using the following templates in the following order suffices
+  // to find all of the interesting cases (S = index * scale, B = base
+  // input, D = displacement input):
+  //
+  // (S + (B + D))
+  // (S + (B + B))
+  // (S + D)
+  // (S + B)
+  // ((S + D) + B)
+  // ((S + B) + D)
+  // ((B + D) + B)
+  // ((B + B) + D)
+  // (B + D)
+  // (B + B)
+  BaseWithScaledIndexAndDisplacementMatch<TurboshaftAdapter> result;
+  result.displacement_mode = kPositiveDisplacement;
+
+  const Operation& op = selector->Get(node);
+  if (const LoadOp* load = op.TryCast<LoadOp>()) {
+    result.base = load->base();
+    result.index = load->index();
+    result.scale = load->element_size_log2;
+    result.displacement = load->offset;
+    if (load->kind.tagged_base) result.displacement -= kHeapObjectTag;
+    return result;
+  } else if (const StoreOp* store = op.TryCast<StoreOp>()) {
+    BaseWithScaledIndexAndDisplacementMatch<TurboshaftAdapter> result;
+    result.base = store->base();
+    result.index = store->index();
+    result.scale = store->element_size_log2;
+    result.displacement = store->offset;
+    if (store->kind.tagged_base) result.displacement -= kHeapObjectTag;
+    return result;
+  } else if (!op.Is<WordBinopOp>()) {
+    return base::nullopt;
+  }
+
+  auto OwnedByAddressingOperand = [](OpIndex) {
+    // TODO(nicohartmann@): Consider providing this. For now we just allow
+    // everything to be covered regardless of other uses.
+    return true;
+  };
+
+  const WordBinopOp& binop = op.Cast<WordBinopOp>();
+  OpIndex left = binop.left();
+  OpIndex right = binop.right();
+
+  // Check (S + ...)
+  if (MatchScaledIndex(selector, left, &result.index, &result.scale, nullptr) &&
+      OwnedByAddressingOperand(left)) {
+    result.displacement_mode = kPositiveDisplacement;
+
+    // Check (S + (... binop ...))
+    if (const WordBinopOp* right_binop =
+            selector->Get(right).TryCast<WordBinopOp>()) {
+      // Check (S + (B - D))
+      if (right_binop->kind == WordBinopOp::Kind::kSub &&
+          OwnedByAddressingOperand(right)) {
+        if (!selector->MatchSignedIntegralConstant(right_binop->right(),
+                                                   &result.displacement)) {
+          return base::nullopt;
         }
-        return false;
+        result.base = right_binop->left();
+        result.displacement_mode = kNegativeDisplacement;
+        return result;
       }
-      case IrOpcode::kInt32Constant:
-      case IrOpcode::kRelocatableInt32Constant: {
-        const int32_t value = OpParameter<int32_t>(node->op());
-        // int32_t min will overflow if displacement mode is
-        // kNegativeDisplacement.
-        return value != std::numeric_limits<int32_t>::min();
+      // Check (S + (... + ...))
+      if (right_binop->kind == WordBinopOp::Kind::kAdd &&
+          OwnedByAddressingOperand(right)) {
+        if (selector->MatchSignedIntegralConstant(right_binop->right(),
+                                                  &result.displacement)) {
+          // (S + (B + D))
+          result.base = right_binop->left();
+        } else if (selector->MatchSignedIntegralConstant(
+                       right_binop->left(), &result.displacement)) {
+          // (S + (D + B))
+          result.base = right_binop->right();
+        } else {
+          // Treat it as (S + B)
+          result.base = right;
+          result.displacement = 0;
+        }
+        return result;
       }
-      case IrOpcode::kInt64Constant: {
-        const int64_t value = OpParameter<int64_t>(node->op());
-        return std::numeric_limits<int32_t>::min() < value &&
-               value <= std::numeric_limits<int32_t>::max();
+    }
+
+    // Check (S + D)
+    if (selector->MatchSignedIntegralConstant(right, &result.displacement)) {
+      result.base = OpIndex{};
+      return result;
+    }
+
+    // Treat it as (S + B)
+    result.base = right;
+    result.displacement = 0;
+    return result;
+  }
+
+  // Check ((... + ...) + ...)
+  if (const WordBinopOp* left_add = selector->Get(left).TryCast<WordBinopOp>();
+      left_add && left_add->kind == WordBinopOp::Kind::kAdd &&
+      OwnedByAddressingOperand(left)) {
+    // Check ((S + ...) + ...)
+    if (MatchScaledIndex(selector, left_add->left(), &result.index,
+                         &result.scale, nullptr)) {
+      result.displacement_mode = kPositiveDisplacement;
+      // Check ((S + D) + B)
+      if (selector->MatchSignedIntegralConstant(left_add->right(),
+                                                &result.displacement)) {
+        result.base = right;
+        return result;
       }
-      case IrOpcode::kNumberConstant: {
-        const double value = OpParameter<double>(node->op());
-        return base::bit_cast<int64_t>(value) == 0;
+      // Check ((S + B) + D)
+      if (selector->MatchSignedIntegralConstant(right, &result.displacement)) {
+        result.base = left_add->right();
+        return result;
       }
-      default:
+      // Treat it as (B + B) and use index as right B.
+      result.base = left;
+      result.index = right;
+      result.scale = 0;
+      DCHECK_EQ(result.displacement, 0);
+      return result;
+    }
+  }
+
+  DCHECK_EQ(result.index, OpIndex{});
+  DCHECK_EQ(result.scale, 0);
+  result.displacement_mode = kPositiveDisplacement;
+
+  // Check (B + D)
+  if (selector->MatchSignedIntegralConstant(right, &result.displacement)) {
+    result.base = left;
+    return result;
+  }
+
+  // Treat as (B + B) and use index as left B.
+  result.index = left;
+  result.base = right;
+  return result;
+}
+
+base::Optional<BaseWithScaledIndexAndDisplacementMatch<TurboshaftAdapter>>
+TryMatchBaseWithScaledIndexAndDisplacement32(
+    InstructionSelectorT<TurboshaftAdapter>* selector,
+    turboshaft::OpIndex node) {
+  return TryMatchBaseWithScaledIndexAndDisplacement64(selector, node);
+}
+
+// Adds X64-specific methods for generating operands.
+template <typename Adapter>
+class X64OperandGeneratorT final : public OperandGeneratorT<Adapter> {
+ public:
+  OPERAND_GENERATOR_T_BOILERPLATE(Adapter)
+
+  explicit X64OperandGeneratorT(InstructionSelectorT<Adapter>* selector)
+      : super(selector) {}
+
+  template <typename T>
+  bool CanBeImmediate(T*) {
+    UNREACHABLE(/*REMOVE*/);
+  }
+
+  bool CanBeImmediate(node_t node) {
+    if (!this->is_constant(node)) return false;
+    auto constant = this->constant_view(node);
+    if (constant.is_compressed_heap_object()) {
+      if (!COMPRESS_POINTERS_BOOL) return false;
+      // For builtin code we need static roots
+      if (selector()->isolate()->bootstrapper() && !V8_STATIC_ROOTS_BOOL) {
         return false;
+      }
+      const RootsTable& roots_table = selector()->isolate()->roots_table();
+      RootIndex root_index;
+      Handle<HeapObject> value = constant.heap_object_value();
+      if (roots_table.IsRootHandle(value, &root_index)) {
+        return RootsTable::IsReadOnly(root_index);
+      }
+      return false;
+    }
+    if (constant.is_int32() || constant.is_relocatable_int32()) {
+      const int32_t value = constant.int32_value();
+      // int32_t min will overflow if displacement mode is
+      // kNegativeDisplacement.
+      return value != std::numeric_limits<int32_t>::min();
+    }
+    if (constant.is_int64()) {
+      const int64_t value = constant.int64_value();
+      return std::numeric_limits<int32_t>::min() < value &&
+             value <= std::numeric_limits<int32_t>::max();
     }
+    if (constant.is_number()) {
+      const double value = constant.number_value();
+      return base::bit_cast<int64_t>(value) == 0;
+    }
+    return false;
   }
 
-  int32_t GetImmediateIntegerValue(Node* node) {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(int32_t, GetImmediateIntegerValue)
+  int32_t GetImmediateIntegerValue(node_t node) {
     DCHECK(CanBeImmediate(node));
-    if (node->opcode() == IrOpcode::kInt32Constant) {
-      return OpParameter<int32_t>(node->op());
+    auto constant = this->constant_view(node);
+    if (constant.is_int32()) return constant.int32_value();
+    if (constant.is_int64()) {
+      return static_cast<int32_t>(constant.int64_value());
     }
-    DCHECK_EQ(IrOpcode::kInt64Constant, node->opcode());
-    return static_cast<int32_t>(OpParameter<int64_t>(node->op()));
+    DCHECK(constant.is_number());
+    return static_cast<int32_t>(constant.number_value());
   }
 
-  bool CanBeMemoryOperand(InstructionCode opcode, Node* node, Node* input,
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(bool, CanBeMemoryOperand)
+  bool CanBeMemoryOperand(InstructionCode opcode, node_t node, node_t input,
                           int effect_level) {
-    if ((input->opcode() != IrOpcode::kLoad &&
-         input->opcode() != IrOpcode::kLoadImmutable) ||
-        !selector()->CanCover(node, input)) {
-      return false;
-    }
+    if (!this->IsLoadOrLoadImmutable(input)) return false;
+    if (!selector()->CanCover(node, input)) return false;
     if (effect_level != selector()->GetEffectLevel(input)) {
       return false;
     }
     MachineRepresentation rep =
-        LoadRepresentationOf(input->op()).representation();
+        this->load_view(input).loaded_rep().representation();
     switch (opcode) {
       case kX64And:
       case kX64Or:
@@ -159,54 +517,75 @@ class X64OperandGenerator final : public OperandGenerator {
     return false;
   }
 
+  bool ValueFitsIntoImmediate(int64_t value) const {
+    return std::numeric_limits<int32_t>::min() < value &&
+           value <= std::numeric_limits<int32_t>::max();
+  }
+
+  bool IsZeroIntConstant(node_t node) const {
+    if constexpr (Adapter::IsTurboshaft) {
+      if (turboshaft::ConstantOp* op =
+              this->turboshaft_graph()
+                  ->Get(node)
+                  .template TryCast<turboshaft::ConstantOp>()) {
+        switch (op->kind) {
+          case turboshaft::ConstantOp::Kind::kWord32:
+            return op->word32() == 0;
+          case turboshaft::ConstantOp::Kind::kWord64:
+            return op->word64() == 0;
+          default:
+            break;
+        }
+      }
+      return false;
+    } else {
+      if (node->opcode() == IrOpcode::kInt32Constant) {
+        return OpParameter<int32_t>(node->op()) == 0;
+      } else if (node->opcode() == IrOpcode::kInt64Constant) {
+        return OpParameter<int64_t>(node->op()) == 0;
+      }
+      return false;
+    }
+  }
+
   AddressingMode GenerateMemoryOperandInputs(
-      Node* index, int scale_exponent, Node* base, Node* displacement,
+      node_t index, int scale_exponent, node_t base, int64_t displacement,
       DisplacementMode displacement_mode, InstructionOperand inputs[],
       size_t* input_count,
       RegisterUseKind reg_kind = RegisterUseKind::kUseRegister) {
     AddressingMode mode = kMode_MRI;
+    node_t base_before_folding = base;
     bool fold_base_into_displacement = false;
     int64_t fold_value = 0;
-    if (base != nullptr && (index != nullptr || displacement != nullptr)) {
-      if (index != nullptr && displacement != nullptr &&
-          (base->opcode() == IrOpcode::kInt32Constant ||
-           base->opcode() == IrOpcode::kInt64Constant) &&
-          CanBeImmediate(base) &&
-          (displacement->opcode() == IrOpcode::kInt32Constant ||
-           displacement->opcode() == IrOpcode::kInt64Constant) &&
-          CanBeImmediate(displacement)) {
+    if (this->valid(base) && (this->valid(index) || displacement != 0)) {
+      if (CanBeImmediate(base) && this->valid(index) &&
+          ValueFitsIntoImmediate(displacement)) {
         fold_value = GetImmediateIntegerValue(base);
-        int64_t displacement_val = GetImmediateIntegerValue(displacement);
         if (displacement_mode == kNegativeDisplacement) {
-          fold_value -= displacement_val;
+          fold_value -= displacement;
         } else {
-          fold_value += displacement_val;
+          fold_value += displacement;
         }
-        if (fold_value == 0) {
-          base = nullptr;
-          displacement = nullptr;
-        } else if (std::numeric_limits<int32_t>::min() < fold_value &&
-                   fold_value <= std::numeric_limits<int32_t>::max()) {
-          base = nullptr;
+        if (V8_UNLIKELY(fold_value == 0)) {
+          base = node_t{};
+          displacement = 0;
+        } else if (ValueFitsIntoImmediate(fold_value)) {
+          base = node_t{};
           fold_base_into_displacement = true;
         }
-      } else if (base->opcode() == IrOpcode::kInt32Constant &&
-                 OpParameter<int32_t>(base->op()) == 0) {
-        base = nullptr;
-      } else if (base->opcode() == IrOpcode::kInt64Constant &&
-                 OpParameter<int64_t>(base->op()) == 0) {
-        base = nullptr;
+      } else if (IsZeroIntConstant(base)) {
+        base = node_t{};
       }
     }
-    if (base != nullptr) {
+    if (this->valid(base)) {
       inputs[(*input_count)++] = UseRegister(base, reg_kind);
-      if (index != nullptr) {
+      if (this->valid(index)) {
         DCHECK(scale_exponent >= 0 && scale_exponent <= 3);
         inputs[(*input_count)++] = UseRegister(index, reg_kind);
-        if (displacement != nullptr) {
-          inputs[(*input_count)++] = displacement_mode == kNegativeDisplacement
-                                         ? UseNegatedImmediate(displacement)
-                                         : UseImmediate(displacement);
+        if (displacement != 0) {
+          inputs[(*input_count)++] = UseImmediate64(
+              displacement_mode == kNegativeDisplacement ? -displacement
+                                                         : displacement);
           static const AddressingMode kMRnI_modes[] = {kMode_MR1I, kMode_MR2I,
                                                        kMode_MR4I, kMode_MR8I};
           mode = kMRnI_modes[scale_exponent];
@@ -216,35 +595,41 @@ class X64OperandGenerator final : public OperandGenerator {
           mode = kMRn_modes[scale_exponent];
         }
       } else {
-        if (displacement == nullptr) {
+        if (displacement == 0) {
           mode = kMode_MR;
         } else {
-          inputs[(*input_count)++] = displacement_mode == kNegativeDisplacement
-                                         ? UseNegatedImmediate(displacement)
-                                         : UseImmediate(displacement);
+          inputs[(*input_count)++] = UseImmediate64(
+              displacement_mode == kNegativeDisplacement ? -displacement
+                                                         : displacement);
           mode = kMode_MRI;
         }
       }
     } else {
       DCHECK(scale_exponent >= 0 && scale_exponent <= 3);
       if (fold_base_into_displacement) {
-        DCHECK(base == nullptr);
-        DCHECK(index != nullptr);
-        DCHECK(displacement != nullptr);
+        DCHECK(!this->valid(base));
+        DCHECK(this->valid(index));
         inputs[(*input_count)++] = UseRegister(index, reg_kind);
         inputs[(*input_count)++] = UseImmediate(static_cast<int>(fold_value));
         static const AddressingMode kMnI_modes[] = {kMode_MRI, kMode_M2I,
                                                     kMode_M4I, kMode_M8I};
         mode = kMnI_modes[scale_exponent];
-      } else if (displacement != nullptr) {
-        if (index == nullptr) {
-          inputs[(*input_count)++] = UseRegister(displacement, reg_kind);
-          mode = kMode_MR;
+      } else if (displacement != 0) {
+        if (!this->valid(index)) {
+          // This seems to only occur in (0 + k) cases, but we don't have an
+          // addressing mode for a simple constant, so we use the base in a
+          // register for kMode_MRI.
+          CHECK(IsZeroIntConstant(base_before_folding));
+          inputs[(*input_count)++] = UseRegister(base_before_folding, reg_kind);
+          inputs[(*input_count)++] = UseImmediate64(
+              displacement_mode == kNegativeDisplacement ? -displacement
+                                                         : displacement);
+          mode = kMode_MRI;
         } else {
           inputs[(*input_count)++] = UseRegister(index, reg_kind);
-          inputs[(*input_count)++] = displacement_mode == kNegativeDisplacement
-                                         ? UseNegatedImmediate(displacement)
-                                         : UseImmediate(displacement);
+          inputs[(*input_count)++] = UseImmediate64(
+              displacement_mode == kNegativeDisplacement ? -displacement
+                                                         : displacement);
           static const AddressingMode kMnI_modes[] = {kMode_MRI, kMode_M2I,
                                                       kMode_M4I, kMode_M8I};
           mode = kMnI_modes[scale_exponent];
@@ -263,68 +648,39 @@ class X64OperandGenerator final : public OperandGenerator {
     return mode;
   }
 
-  AddressingMode GetEffectiveAddressMemoryOperand(
-      Node* operand, InstructionOperand inputs[], size_t* input_count,
+  AddressingMode GenerateMemoryOperandInputs(
+      Node* index, int scale_exponent, Node* base, Node* displacement,
+      DisplacementMode displacement_mode, InstructionOperand inputs[],
+      size_t* input_count,
       RegisterUseKind reg_kind = RegisterUseKind::kUseRegister) {
-    {
-      LoadMatcher<ExternalReferenceMatcher> m(operand);
-      if (m.index().HasResolvedValue() && m.object().HasResolvedValue() &&
-          selector()->CanAddressRelativeToRootsRegister(
-              m.object().ResolvedValue())) {
-        ptrdiff_t const delta =
-            m.index().ResolvedValue() +
-            MacroAssemblerBase::RootRegisterOffsetForExternalReference(
-                selector()->isolate(), m.object().ResolvedValue());
-        if (is_int32(delta)) {
-          inputs[(*input_count)++] = TempImmediate(static_cast<int32_t>(delta));
-          return kMode_Root;
-        }
-      }
-    }
-    BaseWithIndexAndDisplacement64Matcher m(operand, AddressOption::kAllowAll);
-    DCHECK(m.matches());
-    // Decompress pointer by complex addressing mode.
-    if (IsCompressed(m.base())) {
-      DCHECK(m.index() == nullptr);
-      DCHECK(m.displacement() == nullptr || CanBeImmediate(m.displacement()));
-      AddressingMode mode = kMode_MCR;
-      inputs[(*input_count)++] = UseRegister(m.base(), reg_kind);
-      if (m.displacement() != nullptr) {
-        inputs[(*input_count)++] =
-            m.displacement_mode() == kNegativeDisplacement
-                ? UseNegatedImmediate(m.displacement())
-                : UseImmediate(m.displacement());
-        mode = kMode_MCRI;
-      }
-      return mode;
-    }
-    if (m.base() != nullptr &&
-        m.base()->opcode() == IrOpcode::kLoadRootRegister) {
-      DCHECK_EQ(m.index(), nullptr);
-      DCHECK_EQ(m.scale(), 0);
-      inputs[(*input_count)++] = UseImmediate(m.displacement());
-      return kMode_Root;
-    } else if (m.displacement() == nullptr ||
-               CanBeImmediate(m.displacement())) {
-      return GenerateMemoryOperandInputs(
-          m.index(), m.scale(), m.base(), m.displacement(),
-          m.displacement_mode(), inputs, input_count, reg_kind);
-    } else if (m.base() == nullptr &&
-               m.displacement_mode() == kPositiveDisplacement) {
-      // The displacement cannot be an immediate, but we can use the
-      // displacement as base instead and still benefit from addressing
-      // modes for the scale.
-      return GenerateMemoryOperandInputs(m.index(), m.scale(), m.displacement(),
-                                         nullptr, m.displacement_mode(), inputs,
-                                         input_count, reg_kind);
+    if constexpr (Adapter::IsTurboshaft) {
+      // Turboshaft is not using this overload.
+      UNREACHABLE();
     } else {
-      inputs[(*input_count)++] = UseRegister(operand->InputAt(0), reg_kind);
-      inputs[(*input_count)++] = UseRegister(operand->InputAt(1), reg_kind);
-      return kMode_MR1;
+      int64_t displacement_value;
+      if (displacement == nullptr) {
+        displacement_value = 0;
+      } else if (displacement->opcode() == IrOpcode::kInt32Constant) {
+        displacement_value = OpParameter<int32_t>(displacement->op());
+      } else if (displacement->opcode() == IrOpcode::kInt64Constant) {
+        displacement_value = OpParameter<int64_t>(displacement->op());
+      } else {
+        UNREACHABLE();
+      }
+      return GenerateMemoryOperandInputs(index, scale_exponent, base,
+                                         displacement_value, displacement_mode,
+                                         inputs, input_count, reg_kind);
     }
   }
 
-  InstructionOperand GetEffectiveIndexOperand(Node* index,
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(AddressingMode,
+                                          GetEffectiveAddressMemoryOperand)
+
+  AddressingMode GetEffectiveAddressMemoryOperand(
+      node_t operand, InstructionOperand inputs[], size_t* input_count,
+      RegisterUseKind reg_kind = RegisterUseKind::kUseRegister);
+
+  InstructionOperand GetEffectiveIndexOperand(node_t index,
                                               AddressingMode* mode) {
     if (CanBeImmediate(index)) {
       *mode = kMode_MRI;
@@ -335,11 +691,130 @@ class X64OperandGenerator final : public OperandGenerator {
     }
   }
 
-  bool CanBeBetterLeftOperand(Node* node) const {
+  DECLARE_UNREACHABLE_TURBOSHAFT_FALLBACK(bool, CanBeBetterLeftOperand)
+  bool CanBeBetterLeftOperand(node_t node) const {
     return !selector()->IsLive(node);
   }
 };
 
+template <>
+AddressingMode
+X64OperandGeneratorT<TurboshaftAdapter>::GetEffectiveAddressMemoryOperand(
+    turboshaft::OpIndex operand, InstructionOperand inputs[],
+    size_t* input_count, RegisterUseKind reg_kind) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+
+  const Operation& op = Get(operand);
+  if (const LoadOp* load = op.TryCast<LoadOp>()) {
+    if (ExternalReference reference;
+        MatchExternalConstant(load->base(), &reference) &&
+        !load->index().valid()) {
+      if (selector()->CanAddressRelativeToRootsRegister(reference)) {
+        const ptrdiff_t delta =
+            load->offset +
+            MacroAssemblerBase::RootRegisterOffsetForExternalReference(
+                selector()->isolate(), reference);
+        if (is_int32(delta)) {
+          inputs[(*input_count)++] = TempImmediate(static_cast<int32_t>(delta));
+          return kMode_Root;
+        }
+      }
+    }
+  }
+
+  auto m = TryMatchBaseWithScaledIndexAndDisplacement64(selector(), operand);
+  DCHECK(m.has_value());
+  if (IsCompressed(selector(), m->base)) {
+    UNIMPLEMENTED();
+  }
+  if (TurboshaftAdapter::valid(m->base) &&
+      this->Get(m->base).Is<turboshaft::LoadRootRegisterOp>()) {
+    DCHECK(!this->valid(m->index));
+    DCHECK_EQ(m->scale, 0);
+    DCHECK(ValueFitsIntoImmediate(m->displacement));
+    inputs[(*input_count)++] = UseImmediate(static_cast<int>(m->displacement));
+    return kMode_Root;
+  } else if (ValueFitsIntoImmediate(m->displacement)) {
+    return GenerateMemoryOperandInputs(m->index, m->scale, m->base,
+                                       m->displacement, m->displacement_mode,
+                                       inputs, input_count, reg_kind);
+  } else if (!TurboshaftAdapter::valid(m->base) &&
+             m->displacement_mode == kPositiveDisplacement) {
+    // The displacement cannot be an immediate, but we can use the
+    // displacement as base instead and still benefit from addressing
+    // modes for the scale.
+    UNIMPLEMENTED();
+  } else {
+    const turboshaft::Operation& op = this->turboshaft_graph()->Get(operand);
+    DCHECK_GE(op.input_count, 2);
+
+    inputs[(*input_count)++] = UseRegister(op.input(0), reg_kind);
+    inputs[(*input_count)++] = UseRegister(op.input(1), reg_kind);
+    return kMode_MR1;
+  }
+}
+
+template <>
+AddressingMode
+X64OperandGeneratorT<TurbofanAdapter>::GetEffectiveAddressMemoryOperand(
+    node_t operand, InstructionOperand inputs[], size_t* input_count,
+    RegisterUseKind reg_kind) {
+  {
+    LoadMatcher<ExternalReferenceMatcher> m(operand);
+    if (m.index().HasResolvedValue() && m.object().HasResolvedValue() &&
+        selector()->CanAddressRelativeToRootsRegister(
+            m.object().ResolvedValue())) {
+      ptrdiff_t const delta =
+          m.index().ResolvedValue() +
+          MacroAssemblerBase::RootRegisterOffsetForExternalReference(
+              selector()->isolate(), m.object().ResolvedValue());
+      if (is_int32(delta)) {
+        inputs[(*input_count)++] = TempImmediate(static_cast<int32_t>(delta));
+        return kMode_Root;
+      }
+    }
+  }
+  BaseWithIndexAndDisplacement64Matcher m(operand, AddressOption::kAllowAll);
+  DCHECK(m.matches());
+  // Decompress pointer by complex addressing mode.
+  if (IsCompressed(m.base())) {
+    DCHECK(m.index() == nullptr);
+    DCHECK(m.displacement() == nullptr || CanBeImmediate(m.displacement()));
+    AddressingMode mode = kMode_MCR;
+    inputs[(*input_count)++] = UseRegister(m.base(), reg_kind);
+    if (m.displacement() != nullptr) {
+      inputs[(*input_count)++] = m.displacement_mode() == kNegativeDisplacement
+                                     ? UseNegatedImmediate(m.displacement())
+                                     : UseImmediate(m.displacement());
+      mode = kMode_MCRI;
+    }
+    return mode;
+  }
+  if (m.base() != nullptr &&
+      m.base()->opcode() == IrOpcode::kLoadRootRegister) {
+    DCHECK_EQ(m.index(), nullptr);
+    DCHECK_EQ(m.scale(), 0);
+    inputs[(*input_count)++] = UseImmediate(m.displacement());
+    return kMode_Root;
+  } else if (m.displacement() == nullptr || CanBeImmediate(m.displacement())) {
+    return GenerateMemoryOperandInputs(m.index(), m.scale(), m.base(),
+                                       m.displacement(), m.displacement_mode(),
+                                       inputs, input_count, reg_kind);
+  } else if (m.base() == nullptr &&
+             m.displacement_mode() == kPositiveDisplacement) {
+    // The displacement cannot be an immediate, but we can use the
+    // displacement as base instead and still benefit from addressing
+    // modes for the scale.
+    return GenerateMemoryOperandInputs(m.index(), m.scale(), m.displacement(),
+                                       nullptr, m.displacement_mode(), inputs,
+                                       input_count, reg_kind);
+  } else {
+    inputs[(*input_count)++] = UseRegister(operand->InputAt(0), reg_kind);
+    inputs[(*input_count)++] = UseRegister(operand->InputAt(1), reg_kind);
+    return kMode_MR1;
+  }
+}
+
 namespace {
 
 ArchOpcode GetLoadOpcode(LoadRepresentation load_rep) {
@@ -396,6 +871,7 @@ ArchOpcode GetLoadOpcode(LoadRepresentation load_rep) {
       break;
     case MachineRepresentation::kNone:     // Fall through.
     case MachineRepresentation::kMapWord:  // Fall through.
+    case MachineRepresentation::kIndirectPointer:  // Fall through.
       UNREACHABLE();
   }
   return opcode;
@@ -427,6 +903,8 @@ ArchOpcode GetStoreOpcode(StoreRepresentation store_rep) {
       return kX64MovqCompressTagged;
     case MachineRepresentation::kWord64:
       return kX64Movq;
+    case MachineRepresentation::kIndirectPointer:
+      return kX64MovqStoreIndirectPointer;
     case MachineRepresentation::kSandboxedPointer:
       return kX64MovqEncodeSandboxedPointer;
     case MachineRepresentation::kSimd128:
@@ -466,14 +944,21 @@ ArchOpcode GetSeqCstStoreOpcode(StoreRepresentation store_rep) {
 
 }  // namespace
 
-void InstructionSelector::VisitTraceInstruction(Node* node) {
-  X64OperandGenerator g(this);
-  uint32_t markid = OpParameter<uint32_t>(node->op());
-  Emit(kX64TraceInstruction, g.Use(node), g.UseImmediate(markid));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTraceInstruction(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    // Currently not used by Turboshaft.
+    UNIMPLEMENTED();
+  } else {
+    X64OperandGeneratorT<Adapter> g(this);
+    uint32_t markid = OpParameter<uint32_t>(node->op());
+    Emit(kX64TraceInstruction, g.Use(node), g.UseImmediate(markid));
+  }
 }
 
-void InstructionSelector::VisitStackSlot(Node* node) {
-  StackSlotRepresentation rep = StackSlotRepresentationOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackSlot(node_t node) {
+  StackSlotRepresentation rep = this->stack_slot_representation_of(node);
   int slot = frame_->AllocateSpillSlot(rep.size(), rep.alignment());
   OperandGenerator g(this);
 
@@ -481,12 +966,16 @@ void InstructionSelector::VisitStackSlot(Node* node) {
        sequence()->AddImmediate(Constant(slot)), 0, nullptr);
 }
 
-void InstructionSelector::VisitAbortCSADcheck(Node* node) {
-  X64OperandGenerator g(this);
-  Emit(kArchAbortCSADcheck, g.NoOutput(), g.UseFixed(node->InputAt(0), rdx));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitAbortCSADcheck(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
+  Emit(kArchAbortCSADcheck, g.NoOutput(),
+       g.UseFixed(this->input_at(node, 0), rdx));
 }
 
-void InstructionSelector::VisitLoadLane(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadLane(Node* node) {
   LoadLaneParameters params = LoadLaneParametersOf(node->op());
   InstructionCode opcode = kArchNop;
   if (params.rep == MachineType::Int8()) {
@@ -501,7 +990,7 @@ void InstructionSelector::VisitLoadLane(Node* node) {
     UNREACHABLE();
   }
 
-  X64OperandGenerator g(this);
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand outputs[] = {g.DefineAsRegister(node)};
   // Input 0 is value node, 1 is lane idx, and GetEffectiveAddressMemoryOperand
   // uses up to 3 inputs. This ordering is consistent with other operations that
@@ -526,7 +1015,8 @@ void InstructionSelector::VisitLoadLane(Node* node) {
   Emit(opcode, 1, outputs, input_count, inputs);
 }
 
-void InstructionSelector::VisitLoadTransform(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoadTransform(Node* node) {
   LoadTransformParameters params = LoadTransformParametersOf(node->op());
   ArchOpcode opcode;
   switch (params.transformation) {
@@ -567,12 +1057,36 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
       opcode = kX64Movsd;
       break;
     // Simd256
+    case LoadTransformation::kS256Load8Splat:
+      opcode = kX64S256Load8Splat;
+      break;
+    case LoadTransformation::kS256Load16Splat:
+      opcode = kX64S256Load16Splat;
+      break;
     case LoadTransformation::kS256Load32Splat:
       opcode = kX64S256Load32Splat;
       break;
     case LoadTransformation::kS256Load64Splat:
       opcode = kX64S256Load64Splat;
       break;
+    case LoadTransformation::kS256Load8x16S:
+      opcode = kX64S256Load8x16S;
+      break;
+    case LoadTransformation::kS256Load8x16U:
+      opcode = kX64S256Load8x16U;
+      break;
+    case LoadTransformation::kS256Load16x8S:
+      opcode = kX64S256Load16x8S;
+      break;
+    case LoadTransformation::kS256Load16x8U:
+      opcode = kX64S256Load16x8U;
+      break;
+    case LoadTransformation::kS256Load32x4S:
+      opcode = kX64S256Load32x4S;
+      break;
+    case LoadTransformation::kS256Load32x4U:
+      opcode = kX64S256Load32x4U;
+      break;
     default:
       UNREACHABLE();
   }
@@ -585,9 +1099,10 @@ void InstructionSelector::VisitLoadTransform(Node* node) {
   VisitLoad(node, node, code);
 }
 
-void InstructionSelector::VisitLoad(Node* node, Node* value,
-                                    InstructionCode opcode) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node, node_t value,
+                                              InstructionCode opcode) {
+  X64OperandGeneratorT<Adapter> g(this);
 #ifdef V8_IS_TSAN
   // On TSAN builds we require one scratch register. Because of this we also
   // have to modify the inputs to take into account possible aliasing and use
@@ -606,58 +1121,78 @@ void InstructionSelector::VisitLoad(Node* node, Node* value,
   AddressingMode mode =
       g.GetEffectiveAddressMemoryOperand(value, inputs, &input_count, reg_kind);
   InstructionCode code = opcode | AddressingModeField::encode(mode);
-  if (node->opcode() == IrOpcode::kProtectedLoad ||
-      ((node->opcode() == IrOpcode::kWord32AtomicLoad ||
-        node->opcode() == IrOpcode::kWord64AtomicLoad) &&
-       (AtomicLoadParametersOf(node->op()).kind() ==
-        MemoryAccessKind::kProtected))) {
-    code |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
-  } else if (node->opcode() == IrOpcode::kLoadTrapOnNull) {
-    code |= AccessModeField::encode(kMemoryAccessProtectedNullDereference);
+  if constexpr (Adapter::IsTurboshaft) {
+    // TODO(nicohartmann@): Implement for Turboshaft.
+  } else {
+    if (node->opcode() == IrOpcode::kProtectedLoad ||
+        ((node->opcode() == IrOpcode::kWord32AtomicLoad ||
+          node->opcode() == IrOpcode::kWord64AtomicLoad) &&
+         (AtomicLoadParametersOf(node->op()).kind() ==
+          MemoryAccessKind::kProtected))) {
+      code |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
+    } else if (node->opcode() == IrOpcode::kLoadTrapOnNull) {
+      code |= AccessModeField::encode(kMemoryAccessProtectedNullDereference);
+    }
   }
   Emit(code, 1, outputs, input_count, inputs, temp_count, temps);
 }
 
-void InstructionSelector::VisitLoad(Node* node) {
-  LoadRepresentation load_rep = LoadRepresentationOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitLoad(node_t node) {
+  LoadRepresentation load_rep = this->load_view(node).loaded_rep();
   DCHECK(!load_rep.IsMapWord());
   VisitLoad(node, node, GetLoadOpcode(load_rep));
 }
 
-void InstructionSelector::VisitProtectedLoad(Node* node) { VisitLoad(node); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedLoad(node_t node) {
+  VisitLoad(node);
+}
 
 namespace {
 
 // Shared routine for Word32/Word64 Atomic Exchange
-void VisitAtomicExchange(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitAtomicExchange(InstructionSelectorT<Adapter>* selector, Node* node,
                          ArchOpcode opcode, AtomicWidth width,
                          MemoryAccessKind access_kind) {
-  X64OperandGenerator g(selector);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
-  Node* value = node->InputAt(2);
-  AddressingMode addressing_mode;
-  InstructionOperand inputs[] = {
-      g.UseUniqueRegister(value), g.UseUniqueRegister(base),
-      g.GetEffectiveIndexOperand(index, &addressing_mode)};
-  InstructionOperand outputs[] = {g.DefineSameAsFirst(node)};
-  InstructionCode code = opcode | AddressingModeField::encode(addressing_mode) |
-                         AtomicWidthField::encode(width);
-  if (access_kind == MemoryAccessKind::kProtected) {
-    code |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
+  if constexpr (Adapter::IsTurboshaft) {
+    UNIMPLEMENTED();
+  } else {
+    X64OperandGeneratorT<Adapter> g(selector);
+    Node* base = node->InputAt(0);
+    Node* index = node->InputAt(1);
+    Node* value = node->InputAt(2);
+    AddressingMode addressing_mode;
+    InstructionOperand inputs[] = {
+        g.UseUniqueRegister(value), g.UseUniqueRegister(base),
+        g.GetEffectiveIndexOperand(index, &addressing_mode)};
+    InstructionOperand outputs[] = {g.DefineSameAsFirst(node)};
+    InstructionCode code = opcode |
+                           AddressingModeField::encode(addressing_mode) |
+                           AtomicWidthField::encode(width);
+    if (access_kind == MemoryAccessKind::kProtected) {
+      code |= AccessModeField::encode(kMemoryAccessProtectedMemOutOfBounds);
+    }
+    selector->Emit(code, arraysize(outputs), outputs, arraysize(inputs),
+                   inputs);
   }
-  selector->Emit(code, arraysize(outputs), outputs, arraysize(inputs), inputs);
 }
 
-void VisitStoreCommon(InstructionSelector* selector, Node* node,
-                      StoreRepresentation store_rep,
-                      base::Optional<AtomicMemoryOrder> atomic_order,
-                      MemoryAccessKind acs_kind = MemoryAccessKind::kNormal) {
-  X64OperandGenerator g(selector);
-  Node* base = node->InputAt(0);
-  Node* index = node->InputAt(1);
-  Node* value = node->InputAt(2);
+template <typename Adapter>
+void VisitStoreCommon(InstructionSelectorT<Adapter>* selector,
+                      const typename Adapter::StoreView& store) {
+  using node_t = typename Adapter::node_t;
+  X64OperandGeneratorT<Adapter> g(selector);
+  node_t base = store.base();
+  node_t index = store.index();
+  node_t value = store.value();
+  int32_t displacement = store.displacement();
+  uint8_t element_size_log2 = store.element_size_log2();
+  base::Optional<AtomicMemoryOrder> atomic_order = store.memory_order();
+  MemoryAccessKind acs_kind = store.access_kind();
 
+  StoreRepresentation store_rep = store.stored_rep();
   DCHECK_NE(store_rep.representation(), MachineRepresentation::kMapWord);
   WriteBarrierKind write_barrier_kind = store_rep.write_barrier_kind();
   const bool is_seqcst =
@@ -670,29 +1205,39 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
 
   const auto access_mode =
       acs_kind == MemoryAccessKind::kProtected
-          ? (node->opcode() == IrOpcode::kStoreTrapOnNull
+          ? (store.is_store_trap_on_null()
                  ? kMemoryAccessProtectedNullDereference
                  : MemoryAccessMode::kMemoryAccessProtectedMemOutOfBounds)
           : MemoryAccessMode::kMemoryAccessDirect;
 
   if (write_barrier_kind != kNoWriteBarrier &&
       !v8_flags.disable_write_barriers) {
-    DCHECK(CanBeTaggedOrCompressedPointer(store_rep.representation()));
+    DCHECK(
+        CanBeTaggedOrCompressedOrIndirectPointer(store_rep.representation()));
     AddressingMode addressing_mode;
-    InstructionOperand inputs[] = {
-        g.UseUniqueRegister(base),
-        g.GetEffectiveIndexOperand(index, &addressing_mode),
-        g.UseUniqueRegister(value)};
+    InstructionOperand inputs[4];
+    size_t input_count = 0;
+    addressing_mode = g.GenerateMemoryOperandInputs(
+        index, element_size_log2, base, displacement,
+        DisplacementMode::kPositiveDisplacement, inputs, &input_count,
+        X64OperandGeneratorT<Adapter>::RegisterUseKind::kUseUniqueRegister);
+    DCHECK_LT(input_count, 4);
+    inputs[input_count++] = g.UseUniqueRegister(value);
     RecordWriteMode record_write_mode =
         WriteBarrierKindToRecordWriteMode(write_barrier_kind);
     InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()};
-    InstructionCode code = is_seqcst ? kArchAtomicStoreWithWriteBarrier
-                                     : kArchStoreWithWriteBarrier;
+    InstructionCode code;
+    if (store_rep.representation() == MachineRepresentation::kIndirectPointer) {
+      code = kArchStoreIndirectWithWriteBarrier;
+    } else {
+      code = is_seqcst ? kArchAtomicStoreWithWriteBarrier
+                       : kArchStoreWithWriteBarrier;
+    }
     code |= AddressingModeField::encode(addressing_mode);
     code |= RecordWriteModeField::encode(record_write_mode);
     code |= AccessModeField::encode(access_mode);
-    selector->Emit(code, 0, nullptr, arraysize(inputs), inputs,
-                   arraysize(temps), temps);
+    selector->Emit(code, 0, nullptr, input_count, inputs, arraysize(temps),
+                   temps);
   } else {
 #ifdef V8_IS_TSAN
     // On TSAN builds we require two scratch registers. Because of this we also
@@ -700,11 +1245,12 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
     // UseUniqueRegister which is not required for non-TSAN builds.
     InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()};
     size_t temp_count = arraysize(temps);
-    auto reg_kind = OperandGenerator::RegisterUseKind::kUseUniqueRegister;
+    auto reg_kind =
+        OperandGeneratorT<Adapter>::RegisterUseKind::kUseUniqueRegister;
 #else
     InstructionOperand* temps = nullptr;
     size_t temp_count = 0;
-    auto reg_kind = OperandGenerator::RegisterUseKind::kUseRegister;
+    auto reg_kind = OperandGeneratorT<Adapter>::RegisterUseKind::kUseRegister;
 #endif  // V8_IS_TSAN
 
     // Release and non-atomic stores emit MOV and sequentially consistent stores
@@ -717,6 +1263,9 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
     size_t input_count = 0;
 
     if (is_seqcst) {
+      if (displacement != 0 && element_size_log2 != 1) {
+        UNIMPLEMENTED();
+      }
       // SeqCst stores emit XCHG instead of MOV, so encode the inputs as we
       // would for XCHG. XCHG can't encode the value as an immediate and has
       // fewer addressing modes available.
@@ -726,14 +1275,15 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
           g.GetEffectiveIndexOperand(index, &addressing_mode);
       opcode = GetSeqCstStoreOpcode(store_rep);
     } else {
-      if ((ElementSizeLog2Of(store_rep.representation()) <
-           kSystemPointerSizeLog2) &&
-          value->opcode() == IrOpcode::kTruncateInt64ToInt32) {
-        value = value->InputAt(0);
+      if (ElementSizeLog2Of(store_rep.representation()) <
+          kSystemPointerSizeLog2) {
+        if (selector->is_truncate_word64_to_word32(value)) {
+          value = selector->input_at(value, 0);
+        }
       }
 
       addressing_mode = g.GetEffectiveAddressMemoryOperand(
-          node, inputs, &input_count, reg_kind);
+          store, inputs, &input_count, reg_kind);
       InstructionOperand value_operand = g.CanBeImmediate(value)
                                              ? g.UseImmediate(value)
                                              : g.UseRegister(value, reg_kind);
@@ -751,24 +1301,36 @@ void VisitStoreCommon(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitStore(Node* node) {
-  return VisitStoreCommon(this, node, StoreRepresentationOf(node->op()),
-                          base::nullopt);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStorePair(node_t node) {
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStore(node_t node) {
+  return VisitStoreCommon(this, this->store_view(node));
 }
 
-void InstructionSelector::VisitProtectedStore(Node* node) {
-  return VisitStoreCommon(this, node, StoreRepresentationOf(node->op()),
-                          base::nullopt, MemoryAccessKind::kProtected);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitProtectedStore(node_t node) {
+  return VisitStoreCommon(this, this->store_view(node));
 }
 
 // Architecture supports unaligned access, therefore VisitLoad is used instead
-void InstructionSelector::VisitUnalignedLoad(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedLoad(node_t node) {
+  UNREACHABLE();
+}
 
 // Architecture supports unaligned access, therefore VisitStore is used instead
-void InstructionSelector::VisitUnalignedStore(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUnalignedStore(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitStoreLane(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStoreLane(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
 
   StoreLaneParameters params = StoreLaneParametersOf(node->op());
   InstructionCode opcode = kArchNop;
@@ -802,12 +1364,19 @@ void InstructionSelector::VisitStoreLane(Node* node) {
 }
 
 // Shared routine for multiple binary operations.
-static void VisitBinop(InstructionSelector* selector, Node* node,
-                       InstructionCode opcode, FlagsContinuation* cont) {
-  X64OperandGenerator g(selector);
-  Int32BinopMatcher m(node);
-  Node* left = m.left().node();
-  Node* right = m.right().node();
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector,
+                       typename Adapter::node_t node, InstructionCode opcode,
+                       FlagsContinuationT<Adapter>* cont) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  DCHECK_EQ(selector->value_input_count(node), 2);
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
+  if (selector->IsCommutative(node)) {
+    if (selector->is_constant(left) && !selector->is_constant(right)) {
+      std::swap(left, right);
+    }
+  }
   InstructionOperand inputs[8];
   size_t input_count = 0;
   InstructionOperand outputs[1];
@@ -830,8 +1399,7 @@ static void VisitBinop(InstructionSelector* selector, Node* node,
     inputs[input_count++] = g.UseImmediate(right);
   } else {
     int effect_level = selector->GetEffectLevel(node, cont);
-    if (node->op()->HasProperty(Operator::kCommutative) &&
-        g.CanBeBetterLeftOperand(right) &&
+    if (selector->IsCommutative(node) && g.CanBeBetterLeftOperand(right) &&
         (!g.CanBeBetterLeftOperand(left) ||
          !g.CanBeMemoryOperand(opcode, node, right, effect_level))) {
       std::swap(left, right);
@@ -864,83 +1432,180 @@ static void VisitBinop(InstructionSelector* selector, Node* node,
 }
 
 // Shared routine for multiple binary operations.
-static void VisitBinop(InstructionSelector* selector, Node* node,
-                       InstructionCode opcode) {
-  FlagsContinuation cont;
+base::Optional<int32_t> GetWord32Constant(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
+    bool allow_implicit_int64_truncation =
+        TurbofanAdapter::AllowsImplicitWord64ToWord32Truncation) {
+  DCHECK(!allow_implicit_int64_truncation);
+  if (node->opcode() != IrOpcode::kInt32Constant) return base::nullopt;
+  return OpParameter<int32_t>(node->op());
+}
+
+base::Optional<int32_t> GetWord32Constant(
+    InstructionSelectorT<TurboshaftAdapter>* selector, turboshaft::OpIndex node,
+    bool allow_implicit_int64_truncation =
+        TurboshaftAdapter::AllowsImplicitWord64ToWord32Truncation) {
+  if (auto* constant = selector->Get(node).TryCast<turboshaft::ConstantOp>()) {
+    if (constant->kind == turboshaft::ConstantOp::Kind::kWord32) {
+      return constant->word32();
+    }
+    if (allow_implicit_int64_truncation &&
+        constant->kind == turboshaft::ConstantOp::Kind::kWord64) {
+      return static_cast<int32_t>(constant->word64());
+    }
+  }
+  return base::nullopt;
+}
+
+void VisitBinop(InstructionSelectorT<TurboshaftAdapter>* selector, Node* node,
+                InstructionCode code) {
+  // TODO(nicohartmann@): Remove once everything is ported.
+  UNREACHABLE();
+}
+
+template <typename Adapter>
+static void VisitBinop(InstructionSelectorT<Adapter>* selector,
+                       typename Adapter::node_t node, InstructionCode opcode) {
+  FlagsContinuationT<Adapter> cont;
   VisitBinop(selector, node, opcode, &cont);
 }
 
-void InstructionSelector::VisitWord32And(Node* node) {
-  X64OperandGenerator g(this);
-  Uint32BinopMatcher m(node);
-  if (m.right().Is(0xFF)) {
-    Emit(kX64Movzxbl, g.DefineAsRegister(node), g.Use(m.left().node()));
-  } else if (m.right().Is(0xFFFF)) {
-    Emit(kX64Movzxwl, g.DefineAsRegister(node), g.Use(m.left().node()));
-  } else {
-    VisitBinop(this, node, kX64And32);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32And(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  auto binop = this->word_binop_view(node);
+  if (auto c = GetWord32Constant(this, binop.right())) {
+    if (*c == 0xFF) {
+      if (this->is_load(binop.left())) {
+        LoadRepresentation load_rep =
+            this->load_view(binop.left()).loaded_rep();
+        if (load_rep.representation() == MachineRepresentation::kWord8 &&
+            load_rep.IsUnsigned()) {
+          EmitIdentity(node);
+          return;
+        }
+      }
+      Emit(kX64Movzxbl, g.DefineAsRegister(node), g.Use(binop.left()));
+      return;
+    } else if (*c == 0xFFFF) {
+      if (this->is_load(binop.left())) {
+        LoadRepresentation load_rep =
+            this->load_view(binop.left()).loaded_rep();
+        if ((load_rep.representation() == MachineRepresentation::kWord16 ||
+             load_rep.representation() == MachineRepresentation::kWord8) &&
+            load_rep.IsUnsigned()) {
+          EmitIdentity(node);
+          return;
+        }
+      }
+      Emit(kX64Movzxwl, g.DefineAsRegister(node), g.Use(binop.left()));
+      return;
+    }
   }
+  VisitBinop(this, node, kX64And32);
 }
 
-void InstructionSelector::VisitWord64And(Node* node) {
-  X64OperandGenerator g(this);
+base::Optional<uint64_t> TryGetRightWordConstant(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node) {
   Uint64BinopMatcher m(node);
-  if (m.right().Is(0xFF)) {
-    Emit(kX64Movzxbq, g.DefineAsRegister(node), g.Use(m.left().node()));
-  } else if (m.right().Is(0xFFFF)) {
-    Emit(kX64Movzxwq, g.DefineAsRegister(node), g.Use(m.left().node()));
-  } else if (m.right().Is(0xFFFFFFFF)) {
-    Emit(kX64Movl, g.DefineAsRegister(node), g.Use(m.left().node()));
-  } else if (m.right().IsInRange(std::numeric_limits<uint32_t>::min(),
-                                 std::numeric_limits<uint32_t>::max())) {
-    Emit(kX64And32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()),
-         g.UseImmediate(static_cast<int32_t>(m.right().ResolvedValue())));
-  } else {
-    VisitBinop(this, node, kX64And);
+  if (!m.right().HasResolvedValue()) return base::nullopt;
+  return static_cast<uint64_t>(m.right().ResolvedValue());
+}
+
+base::Optional<uint64_t> TryGetRightWordConstant(
+    InstructionSelectorT<TurboshaftAdapter>* selector,
+    turboshaft::OpIndex node) {
+  if (const turboshaft::WordBinopOp* binop =
+          selector->Get(node).TryCast<turboshaft::WordBinopOp>()) {
+    uint64_t value;
+    if (selector->MatchUnsignedIntegralConstant(binop->right(), &value)) {
+      return value;
+    }
   }
+  return base::nullopt;
 }
 
-void InstructionSelector::VisitWord32Or(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64And(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  if (base::Optional<uint64_t> constant = TryGetRightWordConstant(this, node)) {
+    auto left = this->input_at(node, 0);
+    if (*constant == 0xFF) {
+      Emit(kX64Movzxbq, g.DefineAsRegister(node), g.Use(left));
+      return;
+    } else if (*constant == 0xFFFF) {
+      Emit(kX64Movzxwq, g.DefineAsRegister(node), g.Use(left));
+      return;
+    } else if (*constant == 0xFFFFFFFF) {
+      Emit(kX64Movl, g.DefineAsRegister(node), g.Use(left));
+      return;
+    } else if (std::numeric_limits<uint32_t>::min() <= *constant &&
+               *constant <= std::numeric_limits<uint32_t>::max()) {
+      Emit(kX64And32, g.DefineSameAsFirst(node), g.UseRegister(left),
+           g.UseImmediate(static_cast<int32_t>(*constant)));
+      return;
+    }
+  }
+  VisitBinop(this, node, kX64And);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Or(node_t node) {
   VisitBinop(this, node, kX64Or32);
 }
 
-void InstructionSelector::VisitWord64Or(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Or(node_t node) {
   VisitBinop(this, node, kX64Or);
 }
 
-void InstructionSelector::VisitWord32Xor(Node* node) {
-  X64OperandGenerator g(this);
-  Uint32BinopMatcher m(node);
-  if (m.right().Is(-1)) {
-    Emit(kX64Not32, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()));
-  } else {
-    VisitBinop(this, node, kX64Xor32);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Xor(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  if (base::Optional<uint64_t> constant = TryGetRightWordConstant(this, node)) {
+    if (*constant == static_cast<uint64_t>(-1)) {
+      Emit(kX64Not32, g.DefineSameAsFirst(node),
+           g.UseRegister(this->input_at(node, 0)));
+      return;
+    }
   }
+  VisitBinop(this, node, kX64Xor32);
 }
 
-void InstructionSelector::VisitWord64Xor(Node* node) {
-  X64OperandGenerator g(this);
-  Uint64BinopMatcher m(node);
-  if (m.right().Is(-1)) {
-    Emit(kX64Not, g.DefineSameAsFirst(node), g.UseRegister(m.left().node()));
-  } else {
-    VisitBinop(this, node, kX64Xor);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Xor(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  if (base::Optional<uint64_t> constant = TryGetRightWordConstant(this, node)) {
+    if (*constant == static_cast<uint64_t>(-1)) {
+      Emit(kX64Not, g.DefineSameAsFirst(node),
+           g.UseRegister(this->input_at(node, 0)));
+      return;
+    }
   }
+  VisitBinop(this, node, kX64Xor);
 }
 
-void InstructionSelector::VisitStackPointerGreaterThan(
-    Node* node, FlagsContinuation* cont) {
-  StackCheckKind kind = StackCheckKindOf(node->op());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitStackPointerGreaterThan(
+    node_t node, FlagsContinuation* cont) {
+  StackCheckKind kind;
+  if constexpr (Adapter::IsTurboshaft) {
+    kind = this->turboshaft_graph()
+               ->Get(node)
+               .template Cast<turboshaft::StackPointerGreaterThanOp>()
+               .kind;
+  } else {
+    kind = StackCheckKindOf(node->op());
+  }
   InstructionCode opcode =
       kArchStackPointerGreaterThan | MiscField::encode(static_cast<int>(kind));
 
   int effect_level = GetEffectLevel(node, cont);
 
-  X64OperandGenerator g(this);
-  Node* const value = node->InputAt(0);
+  X64OperandGeneratorT<Adapter> g(this);
+  node_t value = this->input_at(node, 0);
   if (g.CanBeMemoryOperand(kX64Cmp, node, value, effect_level)) {
-    DCHECK(IrOpcode::kLoad == value->opcode() ||
-           IrOpcode::kLoadImmutable == value->opcode());
+    DCHECK(this->IsLoadOrLoadImmutable(value));
 
     // GetEffectiveAddressMemoryOperand can create at most 3 inputs.
     static constexpr int kMaxInputCount = 3;
@@ -960,8 +1625,9 @@ void InstructionSelector::VisitStackPointerGreaterThan(
 
 namespace {
 
-void TryMergeTruncateInt64ToInt32IntoLoad(InstructionSelector* selector,
-                                          Node* node, Node* load) {
+template <typename Adapter>
+void TryMergeTruncateInt64ToInt32IntoLoad(
+    InstructionSelectorT<Adapter>* selector, Node* node, Node* load) {
   LoadRepresentation load_rep = LoadRepresentationOf(load->op());
   MachineRepresentation rep = load_rep.representation();
   InstructionCode opcode;
@@ -983,18 +1649,19 @@ void TryMergeTruncateInt64ToInt32IntoLoad(InstructionSelector* selector,
     default:
       UNREACHABLE();
   }
-  X64OperandGenerator g(selector);
+  X64OperandGeneratorT<Adapter> g(selector);
 #ifdef V8_IS_TSAN
   // On TSAN builds we require one scratch register. Because of this we also
   // have to modify the inputs to take into account possible aliasing and use
   // UseUniqueRegister which is not required for non-TSAN builds.
   InstructionOperand temps[] = {g.TempRegister()};
   size_t temp_count = arraysize(temps);
-  auto reg_kind = OperandGenerator::RegisterUseKind::kUseUniqueRegister;
+  auto reg_kind =
+      OperandGeneratorT<Adapter>::RegisterUseKind::kUseUniqueRegister;
 #else
   InstructionOperand* temps = nullptr;
   size_t temp_count = 0;
-  auto reg_kind = OperandGenerator::RegisterUseKind::kUseRegister;
+  auto reg_kind = OperandGeneratorT<Adapter>::RegisterUseKind::kUseRegister;
 #endif  // V8_IS_TSAN
   InstructionOperand outputs[] = {g.DefineAsRegister(node)};
   size_t input_count = 0;
@@ -1008,15 +1675,16 @@ void TryMergeTruncateInt64ToInt32IntoLoad(InstructionSelector* selector,
 
 // Shared routine for multiple 32-bit shift operations.
 // TODO(bmeurer): Merge this with VisitWord64Shift using template magic?
-void VisitWord32Shift(InstructionSelector* selector, Node* node,
-                      ArchOpcode opcode) {
-  X64OperandGenerator g(selector);
-  Int32BinopMatcher m(node);
-  Node* left = m.left().node();
-  Node* right = m.right().node();
+template <typename Adapter>
+void VisitWord32Shift(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node, ArchOpcode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  DCHECK_EQ(selector->value_input_count(node), 2);
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
 
-  if (left->opcode() == IrOpcode::kTruncateInt64ToInt32) {
-    left = left->InputAt(0);
+  if (selector->is_truncate_word64_to_word32(left)) {
+    left = selector->input_at(left, 0);
   }
 
   if (g.CanBeImmediate(right)) {
@@ -1030,27 +1698,38 @@ void VisitWord32Shift(InstructionSelector* selector, Node* node,
 
 // Shared routine for multiple 64-bit shift operations.
 // TODO(bmeurer): Merge this with VisitWord32Shift using template magic?
-void VisitWord64Shift(InstructionSelector* selector, Node* node,
-                      ArchOpcode opcode) {
-  X64OperandGenerator g(selector);
-  Int64BinopMatcher m(node);
-  Node* left = m.left().node();
-  Node* right = m.right().node();
+template <typename Adapter>
+void VisitWord64Shift(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node, ArchOpcode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  DCHECK_EQ(selector->value_input_count(node), 2);
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
 
   if (g.CanBeImmediate(right)) {
-    if (opcode == kX64Shr && m.left().IsChangeUint32ToUint64() &&
-        m.right().HasResolvedValue() && m.right().ResolvedValue() < 32 &&
-        m.right().ResolvedValue() >= 0) {
-      opcode = kX64Shr32;
-      left = left->InputAt(0);
+    if constexpr (Adapter::IsTurboshaft) {
+      // TODO(nicohartmann@): Implement this for Turboshaft.
+    } else {
+      Int64BinopMatcher m(node);
+      if (opcode == kX64Shr && m.left().IsChangeUint32ToUint64() &&
+          m.right().HasResolvedValue() && m.right().ResolvedValue() < 32 &&
+          m.right().ResolvedValue() >= 0) {
+        opcode = kX64Shr32;
+        left = left->InputAt(0);
+      }
     }
     selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left),
                    g.UseImmediate(right));
   } else {
-    if (m.right().IsWord64And()) {
-      Int64BinopMatcher mright(right);
-      if (mright.right().Is(0x3F)) {
-        right = mright.left().node();
+    if constexpr (Adapter::IsTurboshaft) {
+      // TODO(nicohartmann@): Implement this for Turboshaft.
+    } else {
+      Int64BinopMatcher m(node);
+      if (m.right().IsWord64And()) {
+        Int64BinopMatcher mright(right);
+        if (mright.right().Is(0x3F)) {
+          right = mright.left().node();
+        }
       }
     }
     selector->Emit(opcode, g.DefineSameAsFirst(node), g.UseRegister(left),
@@ -1059,17 +1738,19 @@ void VisitWord64Shift(InstructionSelector* selector, Node* node,
 }
 
 // Shared routine for multiple shift operations with continuation.
-template <typename BinopMatcher, int Bits>
-bool TryVisitWordShift(InstructionSelector* selector, Node* node,
-                       ArchOpcode opcode, FlagsContinuation* cont) {
-  X64OperandGenerator g(selector);
-  BinopMatcher m(node);
-  Node* left = m.left().node();
-  Node* right = m.right().node();
+template <typename Adapter>
+bool TryVisitWordShift(InstructionSelectorT<Adapter>* selector,
+                       typename Adapter::node_t node, int bits,
+                       ArchOpcode opcode, FlagsContinuationT<Adapter>* cont) {
+  DCHECK(bits == 32 || bits == 64);
+  X64OperandGeneratorT<Adapter> g(selector);
+  DCHECK_EQ(selector->value_input_count(node), 2);
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
 
   // If the shift count is 0, the flags are not affected.
   if (!g.CanBeImmediate(right) ||
-      (g.GetImmediateIntegerValue(right) & (Bits - 1)) == 0) {
+      (g.GetImmediateIntegerValue(right) & (bits - 1)) == 0) {
     return false;
   }
   InstructionOperand output = g.DefineSameAsFirst(node);
@@ -1080,10 +1761,12 @@ bool TryVisitWordShift(InstructionSelector* selector, Node* node,
   return true;
 }
 
-void EmitLea(InstructionSelector* selector, InstructionCode opcode,
-             Node* result, Node* index, int scale, Node* base,
-             Node* displacement, DisplacementMode displacement_mode) {
-  X64OperandGenerator g(selector);
+template <typename Adapter>
+void EmitLea(InstructionSelectorT<Adapter>* selector, InstructionCode opcode,
+             typename Adapter::node_t result, typename Adapter::node_t index,
+             int scale, typename Adapter::node_t base, int64_t displacement,
+             DisplacementMode displacement_mode) {
+  X64OperandGeneratorT<Adapter> g(selector);
 
   InstructionOperand inputs[4];
   size_t input_count = 0;
@@ -1104,44 +1787,63 @@ void EmitLea(InstructionSelector* selector, InstructionCode opcode,
 
 }  // namespace
 
-void InstructionSelector::VisitWord32Shl(Node* node) {
-  Int32ScaleMatcher m(node, true);
-  if (m.matches()) {
-    Node* index = node->InputAt(0);
-    Node* base = m.power_of_two_plus_one() ? index : nullptr;
-    EmitLea(this, kX64Lea32, node, index, m.scale(), base, nullptr,
-            kPositiveDisplacement);
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shl(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    bool plus_one;
+    turboshaft::OpIndex index;
+    int scale;
+    if (MatchScaledIndex(this, node, &index, &scale, &plus_one)) {
+      node_t base = plus_one ? index : node_t{};
+      EmitLea(this, kX64Lea32, node, index, scale, base, 0,
+              kPositiveDisplacement);
+      return;
+    }
+  } else {
+    Int32ScaleMatcher m(node, true);
+    if (m.matches()) {
+      Node* index = node->InputAt(0);
+      Node* base = m.power_of_two_plus_one() ? index : nullptr;
+      EmitLea(this, kX64Lea32, node, index, m.scale(), base, 0,
+              kPositiveDisplacement);
+      return;
+    }
   }
   VisitWord32Shift(this, node, kX64Shl32);
 }
 
-void InstructionSelector::VisitWord64Shl(Node* node) {
-  X64OperandGenerator g(this);
-  Int64ScaleMatcher m(node, true);
-  if (m.matches()) {
-    Node* index = node->InputAt(0);
-    Node* base = m.power_of_two_plus_one() ? index : nullptr;
-    EmitLea(this, kX64Lea, node, index, m.scale(), base, nullptr,
-            kPositiveDisplacement);
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shl(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  if constexpr (Adapter::IsTurboshaft) {
+    // TODO(nicohartmann@): Support the same cases as Turbofan.
   } else {
-    Int64BinopMatcher bm(node);
-    if ((bm.left().IsChangeInt32ToInt64() ||
-         bm.left().IsChangeUint32ToUint64()) &&
-        bm.right().IsInRange(32, 63)) {
-      // There's no need to sign/zero-extend to 64-bit if we shift out the upper
-      // 32 bits anyway.
-      Emit(kX64Shl, g.DefineSameAsFirst(node),
-           g.UseRegister(bm.left().node()->InputAt(0)),
-           g.UseImmediate(bm.right().node()));
+    Int64ScaleMatcher m(node, true);
+    if (m.matches()) {
+      Node* index = node->InputAt(0);
+      Node* base = m.power_of_two_plus_one() ? index : nullptr;
+      EmitLea(this, kX64Lea, node, index, m.scale(), base, 0,
+              kPositiveDisplacement);
       return;
+    } else {
+      Int64BinopMatcher bm(node);
+      if ((bm.left().IsChangeInt32ToInt64() ||
+           bm.left().IsChangeUint32ToUint64()) &&
+          bm.right().IsInRange(32, 63)) {
+        // There's no need to sign/zero-extend to 64-bit if we shift out the
+        // upper 32 bits anyway.
+        Emit(kX64Shl, g.DefineSameAsFirst(node),
+             g.UseRegister(bm.left().node()->InputAt(0)),
+             g.UseImmediate(bm.right().node()));
+        return;
+      }
     }
   }
   VisitWord64Shift(this, node, kX64Shl);
 }
 
-void InstructionSelector::VisitWord32Shr(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Shr(node_t node) {
   VisitWord32Shift(this, node, kX64Shr32);
 }
 
@@ -1185,11 +1887,20 @@ inline AddressingMode AddDisplacementToAddressingMode(AddressingMode mode) {
   UNREACHABLE();
 }
 
-bool TryMatchLoadWord64AndShiftRight(InstructionSelector* selector, Node* node,
-                                     InstructionCode opcode) {
+template <typename T>
+bool TryMatchLoadWord64AndShiftRight(
+    InstructionSelectorT<TurboshaftAdapter>* selector, T node,
+    InstructionCode opcode) {
+  // TODO(nicohartmann@): Implement for Turboshaft.
+  return false;
+}
+
+bool TryMatchLoadWord64AndShiftRight(
+    InstructionSelectorT<TurbofanAdapter>* selector, Node* node,
+    InstructionCode opcode) {
   DCHECK(IrOpcode::kWord64Sar == node->opcode() ||
          IrOpcode::kWord64Shr == node->opcode());
-  X64OperandGenerator g(selector);
+  X64OperandGeneratorT<TurbofanAdapter> g(selector);
   Int64BinopMatcher m(node);
   if (selector->CanCover(m.node(), m.left().node()) && m.left().IsLoad() &&
       m.right().Is(32)) {
@@ -1207,11 +1918,13 @@ bool TryMatchLoadWord64AndShiftRight(InstructionSelector* selector, Node* node,
       // use UseUniqueRegister which is not required for non-TSAN builds.
       InstructionOperand temps[] = {g.TempRegister()};
       size_t temp_count = arraysize(temps);
-      auto reg_kind = OperandGenerator::RegisterUseKind::kUseUniqueRegister;
+      auto reg_kind = OperandGeneratorT<
+          TurbofanAdapter>::RegisterUseKind::kUseUniqueRegister;
 #else
       InstructionOperand* temps = nullptr;
       size_t temp_count = 0;
-      auto reg_kind = OperandGenerator::RegisterUseKind::kUseRegister;
+      auto reg_kind =
+          OperandGeneratorT<TurbofanAdapter>::RegisterUseKind::kUseRegister;
 #endif  // V8_IS_TSAN
       size_t input_count = 0;
       InstructionOperand inputs[3];
@@ -1244,111 +1957,141 @@ bool TryMatchLoadWord64AndShiftRight(InstructionSelector* selector, Node* node,
 
 }  // namespace
 
-void InstructionSelector::VisitWord64Shr(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Shr(node_t node) {
   if (TryMatchLoadWord64AndShiftRight(this, node, kX64Movl)) return;
   VisitWord64Shift(this, node, kX64Shr);
 }
 
-void InstructionSelector::VisitWord32Sar(Node* node) {
-  X64OperandGenerator g(this);
-  Int32BinopMatcher m(node);
-  if (CanCover(m.node(), m.left().node()) && m.left().IsWord32Shl()) {
-    Int32BinopMatcher mleft(m.left().node());
-    if (mleft.right().Is(16) && m.right().Is(16)) {
-      Emit(kX64Movsxwl, g.DefineAsRegister(node), g.Use(mleft.left().node()));
-      return;
-    } else if (mleft.right().Is(24) && m.right().Is(24)) {
-      Emit(kX64Movsxbl, g.DefineAsRegister(node), g.Use(mleft.left().node()));
-      return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Sar(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    // TODO(nicohartmann@): Add this optimization for Turboshaft.
+  } else {
+    X64OperandGeneratorT<Adapter> g(this);
+    Int32BinopMatcher m(node);
+    if (CanCover(m.node(), m.left().node()) && m.left().IsWord32Shl()) {
+      Int32BinopMatcher mleft(m.left().node());
+      if (mleft.right().Is(16) && m.right().Is(16)) {
+        Emit(kX64Movsxwl, g.DefineAsRegister(node), g.Use(mleft.left().node()));
+        return;
+      } else if (mleft.right().Is(24) && m.right().Is(24)) {
+        Emit(kX64Movsxbl, g.DefineAsRegister(node), g.Use(mleft.left().node()));
+        return;
+      }
     }
   }
   VisitWord32Shift(this, node, kX64Sar32);
 }
 
-void InstructionSelector::VisitWord64Sar(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Sar(node_t node) {
   if (TryMatchLoadWord64AndShiftRight(this, node, kX64Movsxlq)) return;
   VisitWord64Shift(this, node, kX64Sar);
 }
 
-void InstructionSelector::VisitWord32Rol(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Rol(node_t node) {
   VisitWord32Shift(this, node, kX64Rol32);
 }
 
-void InstructionSelector::VisitWord64Rol(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Rol(node_t node) {
   VisitWord64Shift(this, node, kX64Rol);
 }
 
-void InstructionSelector::VisitWord32Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32Ror(node_t node) {
   VisitWord32Shift(this, node, kX64Ror32);
 }
 
-void InstructionSelector::VisitWord64Ror(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64Ror(node_t node) {
   VisitWord64Shift(this, node, kX64Ror);
 }
 
-void InstructionSelector::VisitWord32ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64ReverseBits(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBits(node_t node) {
+  UNREACHABLE();
+}
 
-void InstructionSelector::VisitWord64ReverseBytes(Node* node) {
-  X64OperandGenerator g(this);
-  Emit(kX64Bswap, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64ReverseBytes(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
+  Emit(kX64Bswap, g.DefineSameAsFirst(node),
+       g.UseRegister(this->input_at(node, 0)));
 }
 
-void InstructionSelector::VisitWord32ReverseBytes(Node* node) {
-  X64OperandGenerator g(this);
-  Emit(kX64Bswap32, g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32ReverseBytes(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
+  Emit(kX64Bswap32, g.DefineSameAsFirst(node),
+       g.UseRegister(this->input_at(node, 0)));
 }
 
-void InstructionSelector::VisitSimd128ReverseBytes(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSimd128ReverseBytes(Node* node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt32Add(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Add(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
 
   // No need to truncate the values before Int32Add.
-  DCHECK_EQ(node->InputCount(), 2);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  if (left->opcode() == IrOpcode::kTruncateInt64ToInt32) {
-    node->ReplaceInput(0, left->InputAt(0));
-  }
-  if (right->opcode() == IrOpcode::kTruncateInt64ToInt32) {
-    node->ReplaceInput(1, right->InputAt(0));
+  if constexpr (Adapter::IsTurbofan) {
+    DCHECK_EQ(node->InputCount(), 2);
+    Node* left = node->InputAt(0);
+    Node* right = node->InputAt(1);
+    // TODO(nicohartmann): Also optimize this on turboshaft.
+    if (left->opcode() == IrOpcode::kTruncateInt64ToInt32) {
+      node->ReplaceInput(0, left->InputAt(0));
+    }
+    if (right->opcode() == IrOpcode::kTruncateInt64ToInt32) {
+      node->ReplaceInput(1, right->InputAt(0));
+    }
   }
 
   // Try to match the Add to a leal pattern
-  BaseWithIndexAndDisplacement32Matcher m(node);
-  if (m.matches() &&
-      (m.displacement() == nullptr || g.CanBeImmediate(m.displacement()))) {
-    EmitLea(this, kX64Lea32, node, m.index(), m.scale(), m.base(),
-            m.displacement(), m.displacement_mode());
-    return;
+  if (auto m = TryMatchBaseWithScaledIndexAndDisplacement32(this, node)) {
+    if (m->displacement == 0 || g.ValueFitsIntoImmediate(m->displacement)) {
+      EmitLea(this, kX64Lea32, node, m->index, m->scale, m->base,
+              m->displacement, m->displacement_mode);
+      return;
+    }
   }
 
   // No leal pattern match, use addl
   VisitBinop(this, node, kX64Add32);
 }
 
-void InstructionSelector::VisitInt64Add(Node* node) {
-  X64OperandGenerator g(this);
-
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Add(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
   // Try to match the Add to a leaq pattern
-  BaseWithIndexAndDisplacement64Matcher m(node);
-  if (m.matches() &&
-      (m.displacement() == nullptr || g.CanBeImmediate(m.displacement()))) {
-    EmitLea(this, kX64Lea, node, m.index(), m.scale(), m.base(),
-            m.displacement(), m.displacement_mode());
-    return;
+  if (auto match = TryMatchBaseWithScaledIndexAndDisplacement64(this, node)) {
+    if (g.ValueFitsIntoImmediate(match->displacement)) {
+      EmitLea(this, kX64Lea, node, match->index, match->scale, match->base,
+              match->displacement, match->displacement_mode);
+      return;
+    }
   }
 
   // No leal pattern match, use addq
   VisitBinop(this, node, kX64Add);
 }
 
-void InstructionSelector::VisitInt64AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AddWithOverflow(node_t node) {
+  node_t ovf = FindProjection(node, 1);
+  if (Adapter::valid(ovf)) {
     FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
     return VisitBinop(this, node, kX64Add, &cont);
   }
@@ -1356,8 +2099,46 @@ void InstructionSelector::VisitInt64AddWithOverflow(Node* node) {
   VisitBinop(this, node, kX64Add, &cont);
 }
 
-void InstructionSelector::VisitInt32Sub(Node* node) {
-  X64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt32Sub(node_t node) {
+  // TODO(mliedtke): Handle truncate consistently with Turbofan.
+  X64OperandGeneratorT<TurboshaftAdapter> g(this);
+  auto binop = this->word_binop_view(node);
+  auto left = binop.left();
+  auto right = binop.right();
+  if (g.CanBeImmediate(right)) {
+    int32_t imm = g.GetImmediateIntegerValue(right);
+    if (imm == 0) {
+      if (this->Get(left).outputs_rep()[0] ==
+          turboshaft::RegisterRepresentation::Word32()) {
+        // {EmitIdentity} reuses the virtual register of the first input
+        // for the output. This is exactly what we want here.
+        EmitIdentity(node);
+      } else {
+        // Emit "movl" for subtraction of 0.
+        Emit(kX64Movl, g.DefineAsRegister(node), g.UseRegister(left));
+      }
+    } else {
+      // Omit truncation and turn subtractions of constant values into immediate
+      // "leal" instructions by negating the value.
+      Emit(kX64Lea32 | AddressingModeField::encode(kMode_MRI),
+           g.DefineAsRegister(node), g.UseRegister(left),
+           g.TempImmediate(base::NegateWithWraparound(imm)));
+    }
+    return;
+  }
+
+  if (MatchIntegralZero(left)) {
+    Emit(kX64Neg32, g.DefineSameAsFirst(node), g.UseRegister(right));
+    return;
+  }
+
+  VisitBinop(this, node, kX64Sub32);
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt32Sub(Node* node) {
+  X64OperandGeneratorT<TurbofanAdapter> g(this);
   DCHECK_EQ(node->InputCount(), 2);
   Node* input1 = node->InputAt(0);
   Node* input2 = node->InputAt(1);
@@ -1398,8 +2179,34 @@ void InstructionSelector::VisitInt32Sub(Node* node) {
   }
 }
 
-void InstructionSelector::VisitInt64Sub(Node* node) {
-  X64OperandGenerator g(this);
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitInt64Sub(node_t node) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  X64OperandGeneratorT<TurboshaftAdapter> g(this);
+  const WordBinopOp& binop = this->Get(node).Cast<WordBinopOp>();
+  DCHECK_EQ(binop.kind, WordBinopOp::Kind::kSub);
+
+  if (MatchIntegralZero(binop.left())) {
+    Emit(kX64Neg, g.DefineSameAsFirst(node), g.UseRegister(binop.right()));
+    return;
+  }
+  if (auto constant = TryGetRightWordConstant(this, node)) {
+    int64_t immediate_value = -*constant;
+    if (g.ValueFitsIntoImmediate(immediate_value)) {
+      // Turn subtractions of constant values into immediate "leaq" instructions
+      // by negating the value.
+      Emit(kX64Lea | AddressingModeField::encode(kMode_MRI),
+           g.DefineAsRegister(node), g.UseRegister(binop.left()),
+           g.TempImmediate(static_cast<int32_t>(immediate_value)));
+      return;
+    }
+  }
+  VisitBinop(this, node, kX64Sub);
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitInt64Sub(Node* node) {
+  X64OperandGeneratorT<TurbofanAdapter> g(this);
   Int64BinopMatcher m(node);
   if (m.left().Is(0)) {
     Emit(kX64Neg, g.DefineSameAsFirst(node), g.UseRegister(m.right().node()));
@@ -1416,8 +2223,10 @@ void InstructionSelector::VisitInt64Sub(Node* node) {
   }
 }
 
-void InstructionSelector::VisitInt64SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64SubWithOverflow(node_t node) {
+  node_t ovf = FindProjection(node, 1);
+  if (Adapter::valid(ovf)) {
     FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
     return VisitBinop(this, node, kX64Sub, &cont);
   }
@@ -1427,11 +2236,13 @@ void InstructionSelector::VisitInt64SubWithOverflow(Node* node) {
 
 namespace {
 
-void VisitMul(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
-  X64OperandGenerator g(selector);
-  Int32BinopMatcher m(node);
-  Node* left = m.left().node();
-  Node* right = m.right().node();
+template <typename Adapter>
+void VisitMul(InstructionSelectorT<Adapter>* selector,
+              typename Adapter::node_t node, ArchOpcode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  auto binop = selector->word_binop_view(node);
+  auto left = binop.left();
+  auto right = binop.right();
   if (g.CanBeImmediate(right)) {
     selector->Emit(opcode, g.DefineAsRegister(node), g.Use(left),
                    g.UseImmediate(right));
@@ -1444,11 +2255,13 @@ void VisitMul(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
   }
 }
 
-void VisitMulHigh(InstructionSelector* selector, Node* node,
-                  ArchOpcode opcode) {
-  X64OperandGenerator g(selector);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
+template <typename Adapter>
+void VisitMulHigh(InstructionSelectorT<Adapter>* selector,
+                  typename Adapter::node_t node, ArchOpcode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  auto binop = selector->word_binop_view(node);
+  auto left = binop.left();
+  auto right = binop.right();
   if (selector->IsLive(left) && !selector->IsLive(right)) {
     std::swap(left, right);
   }
@@ -1459,39 +2272,44 @@ void VisitMulHigh(InstructionSelector* selector, Node* node,
                  g.UseUniqueRegister(right), arraysize(temps), temps);
 }
 
-void VisitDiv(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
-  X64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitDiv(InstructionSelectorT<Adapter>* selector,
+              typename Adapter::node_t node, ArchOpcode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  auto binop = selector->word_binop_view(node);
   InstructionOperand temps[] = {g.TempRegister(rdx)};
-  selector->Emit(
-      opcode, g.DefineAsFixed(node, rax), g.UseFixed(node->InputAt(0), rax),
-      g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
+  selector->Emit(opcode, g.DefineAsFixed(node, rax),
+                 g.UseFixed(binop.left(), rax),
+                 g.UseUniqueRegister(binop.right()), arraysize(temps), temps);
 }
 
-void VisitMod(InstructionSelector* selector, Node* node, ArchOpcode opcode) {
-  X64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitMod(InstructionSelectorT<Adapter>* selector,
+              typename Adapter::node_t node, ArchOpcode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  auto binop = selector->word_binop_view(node);
   InstructionOperand temps[] = {g.TempRegister(rax)};
-  selector->Emit(
-      opcode, g.DefineAsFixed(node, rdx), g.UseFixed(node->InputAt(0), rax),
-      g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
+  selector->Emit(opcode, g.DefineAsFixed(node, rdx),
+                 g.UseFixed(binop.left(), rax),
+                 g.UseUniqueRegister(binop.right()), arraysize(temps), temps);
 }
 
 }  // namespace
 
-void InstructionSelector::VisitInt32Mul(Node* node) {
-  Int32ScaleMatcher m(node, true);
-  if (m.matches()) {
-    Node* index = node->InputAt(0);
-    Node* base = m.power_of_two_plus_one() ? index : nullptr;
-    EmitLea(this, kX64Lea32, node, index, m.scale(), base, nullptr,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mul(node_t node) {
+  if (auto m = TryMatchScaledIndex32(this, node, true)) {
+    EmitLea(this, kX64Lea32, node, m->index, m->scale, m->base, 0,
             kPositiveDisplacement);
     return;
   }
   VisitMul(this, node, kX64Imul32);
 }
 
-void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
-  // TODO(mvstanton): Use Int32ScaleMatcher somehow.
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulWithOverflow(node_t node) {
+  node_t ovf = FindProjection(node, 1);
+  if (Adapter::valid(ovf)) {
     FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
     return VisitBinop(this, node, kX64Imul32, &cont);
   }
@@ -1499,20 +2317,20 @@ void InstructionSelector::VisitInt32MulWithOverflow(Node* node) {
   VisitBinop(this, node, kX64Imul32, &cont);
 }
 
-void InstructionSelector::VisitInt64Mul(Node* node) {
-  Int64ScaleMatcher m(node, true);
-  if (m.matches()) {
-    Node* index = node->InputAt(0);
-    Node* base = m.power_of_two_plus_one() ? index : nullptr;
-    EmitLea(this, kX64Lea, node, index, m.scale(), base, nullptr,
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Mul(node_t node) {
+  if (auto m = TryMatchScaledIndex64(this, node, true)) {
+    EmitLea(this, kX64Lea, node, m->index, m->scale, m->base, 0,
             kPositiveDisplacement);
     return;
   }
   VisitMul(this, node, kX64Imul);
 }
 
-void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulWithOverflow(node_t node) {
+  node_t ovf = FindProjection(node, 1);
+  if (Adapter::valid(ovf)) {
     FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
     return VisitBinop(this, node, kX64Imul, &cont);
   }
@@ -1520,51 +2338,63 @@ void InstructionSelector::VisitInt64MulWithOverflow(Node* node) {
   VisitBinop(this, node, kX64Imul, &cont);
 }
 
-void InstructionSelector::VisitInt32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32MulHigh(node_t node) {
   VisitMulHigh(this, node, kX64ImulHigh32);
 }
 
-void InstructionSelector::VisitInt64MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64MulHigh(node_t node) {
   VisitMulHigh(this, node, kX64ImulHigh64);
 }
 
-void InstructionSelector::VisitInt32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Div(node_t node) {
   VisitDiv(this, node, kX64Idiv32);
 }
 
-void InstructionSelector::VisitInt64Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Div(node_t node) {
   VisitDiv(this, node, kX64Idiv);
 }
 
-void InstructionSelector::VisitUint32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Div(node_t node) {
   VisitDiv(this, node, kX64Udiv32);
 }
 
-void InstructionSelector::VisitUint64Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Div(node_t node) {
   VisitDiv(this, node, kX64Udiv);
 }
 
-void InstructionSelector::VisitInt32Mod(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32Mod(node_t node) {
   VisitMod(this, node, kX64Idiv32);
 }
 
-void InstructionSelector::VisitInt64Mod(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64Mod(node_t node) {
   VisitMod(this, node, kX64Idiv);
 }
 
-void InstructionSelector::VisitUint32Mod(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32Mod(node_t node) {
   VisitMod(this, node, kX64Udiv32);
 }
 
-void InstructionSelector::VisitUint64Mod(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64Mod(node_t node) {
   VisitMod(this, node, kX64Udiv);
 }
 
-void InstructionSelector::VisitUint32MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32MulHigh(node_t node) {
   VisitMulHigh(this, node, kX64UmulHigh32);
 }
 
-void InstructionSelector::VisitUint64MulHigh(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64MulHigh(node_t node) {
   VisitMulHigh(this, node, kX64UmulHigh64);
 }
 
@@ -1579,17 +2409,20 @@ void InstructionSelector::VisitUint64MulHigh(Node* node) {
 //      Set Projection(1) := 1;   -- the value was in range
 //    Else:
 //      Set Projection(1) := 0;   -- the value was out of range
-void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
-  X64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToInt64(
+    node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  X64OperandGeneratorT<Adapter> g(this);
+  InstructionOperand inputs[] = {g.UseRegister(this->input_at(node, 0))};
   InstructionOperand outputs[2];
   InstructionOperand temps[1];
   size_t output_count = 0;
   size_t temp_count = 0;
   outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
+  node_t success_output = FindProjection(node, 1);
+  if (Adapter::valid(success_output)) {
     outputs[output_count++] = g.DefineAsRegister(success_output);
     temps[temp_count++] = g.TempSimd128Register();
   }
@@ -1605,62 +2438,74 @@ void InstructionSelector::VisitTryTruncateFloat32ToInt64(Node* node) {
 // additional subtraction, conversion and (in case the value was originally
 // negative, but still within range) we restore it and set Projection(1) := 1.
 // In all other cases we set Projection(1) := 0, denoting value out of range.
-void InstructionSelector::VisitTryTruncateFloat64ToUint32(Node* node) {
-  X64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint32(
+    node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  X64OperandGeneratorT<Adapter> g(this);
+  InstructionOperand inputs[] = {g.UseRegister(this->input_at(node, 0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
   outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
+  node_t success_output = FindProjection(node, 1);
+  if (Adapter::valid(success_output)) {
     outputs[output_count++] = g.DefineAsRegister(success_output);
   }
 
   Emit(kSSEFloat64ToUint32, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat32ToUint64(Node* node) {
-  X64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat32ToUint64(
+    node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  X64OperandGeneratorT<Adapter> g(this);
+  InstructionOperand inputs[] = {g.UseRegister(this->input_at(node, 0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
   outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
+  node_t success_output = FindProjection(node, 1);
+  if (Adapter::valid(success_output)) {
     outputs[output_count++] = g.DefineAsRegister(success_output);
   }
 
   Emit(kSSEFloat32ToUint64, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToUint64(Node* node) {
-  X64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToUint64(
+    node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  X64OperandGeneratorT<Adapter> g(this);
+  InstructionOperand inputs[] = {g.UseRegister(this->input_at(node, 0))};
   InstructionOperand outputs[2];
   size_t output_count = 0;
   outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
+  node_t success_output = FindProjection(node, 1);
+  if (Adapter::valid(success_output)) {
     outputs[output_count++] = g.DefineAsRegister(success_output);
   }
 
   Emit(kSSEFloat64ToUint64, output_count, outputs, 1, inputs);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
-  X64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt64(
+    node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  X64OperandGeneratorT<Adapter> g(this);
+  InstructionOperand inputs[] = {g.UseRegister(this->input_at(node, 0))};
   InstructionOperand outputs[2];
   InstructionOperand temps[1];
   size_t output_count = 0;
   size_t temp_count = 0;
   outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
+  node_t success_output = FindProjection(node, 1);
+  if (Adapter::valid(success_output)) {
     outputs[output_count++] = g.DefineAsRegister(success_output);
     temps[temp_count++] = g.TempSimd128Register();
   }
@@ -1668,17 +2513,20 @@ void InstructionSelector::VisitTryTruncateFloat64ToInt64(Node* node) {
   Emit(kSSEFloat64ToInt64, output_count, outputs, 1, inputs, temp_count, temps);
 }
 
-void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
-  X64OperandGenerator g(this);
-  InstructionOperand inputs[] = {g.UseRegister(node->InputAt(0))};
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTryTruncateFloat64ToInt32(
+    node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  X64OperandGeneratorT<Adapter> g(this);
+  InstructionOperand inputs[] = {g.UseRegister(this->input_at(node, 0))};
   InstructionOperand outputs[2];
   InstructionOperand temps[1];
   size_t output_count = 0;
   size_t temp_count = 0;
   outputs[output_count++] = g.DefineAsRegister(node);
 
-  Node* success_output = NodeProperties::FindProjection(node, 1);
-  if (success_output) {
+  node_t success_output = FindProjection(node, 1);
+  if (Adapter::valid(success_output)) {
     outputs[output_count++] = g.DefineAsRegister(success_output);
     temps[temp_count++] = g.TempSimd128Register();
   }
@@ -1686,21 +2534,21 @@ void InstructionSelector::VisitTryTruncateFloat64ToInt32(Node* node) {
   Emit(kSSEFloat64ToInt32, output_count, outputs, 1, inputs, temp_count, temps);
 }
 
-void InstructionSelector::VisitBitcastWord32ToWord64(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitBitcastWord32ToWord64(node_t node) {
   DCHECK(SmiValuesAre31Bits());
   DCHECK(COMPRESS_POINTERS_BOOL);
   EmitIdentity(node);
 }
 
-void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
-  DCHECK_EQ(node->InputCount(), 1);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeInt32ToInt64(node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
 
-  X64OperandGenerator g(this);
-  Node* const value = node->InputAt(0);
-  if ((value->opcode() == IrOpcode::kLoad ||
-       value->opcode() == IrOpcode::kLoadImmutable) &&
-      CanCover(node, value)) {
-    LoadRepresentation load_rep = LoadRepresentationOf(value->op());
+  X64OperandGeneratorT<Adapter> g(this);
+  auto value = this->input_at(node, 0);
+  if (this->IsLoadOrLoadImmutable(value) && CanCover(node, value)) {
+    LoadRepresentation load_rep = this->load_view(value).loaded_rep();
     MachineRepresentation rep = load_rep.representation();
     InstructionCode opcode;
     switch (rep) {
@@ -1713,7 +2561,7 @@ void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
         break;
       case MachineRepresentation::kWord32:
       case MachineRepresentation::kWord64:
-        // While BitcastElider may remove nodes of
+        // Since BitcastElider may remove nodes of
         // IrOpcode::kTruncateInt64ToInt32 and directly use the inputs, values
         // with kWord64 can also reach this line.
       case MachineRepresentation::kTaggedSigned:
@@ -1729,16 +2577,106 @@ void InstructionSelector::VisitChangeInt32ToInt64(Node* node) {
     size_t input_count = 0;
     InstructionOperand inputs[3];
     AddressingMode mode = g.GetEffectiveAddressMemoryOperand(
-        node->InputAt(0), inputs, &input_count);
+        this->input_at(node, 0), inputs, &input_count);
     opcode |= AddressingModeField::encode(mode);
     Emit(opcode, 1, outputs, input_count, inputs);
   } else {
-    Emit(kX64Movsxlq, g.DefineAsRegister(node), g.Use(node->InputAt(0)));
+    Emit(kX64Movsxlq, g.DefineAsRegister(node), g.Use(this->input_at(node, 0)));
+  }
+}
+
+template <>
+bool InstructionSelectorT<TurboshaftAdapter>::ZeroExtendsWord32ToWord64NoPhis(
+    turboshaft::OpIndex node) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  const auto& op = this->Get(node);
+  switch (op.opcode) {
+    case turboshaft::Opcode::kWordBinop: {
+      const auto& binop = op.Cast<WordBinopOp>();
+      if (binop.rep != WordRepresentation::Word32()) return false;
+      DCHECK(binop.kind == WordBinopOp::Kind::kBitwiseAnd ||
+             binop.kind == WordBinopOp::Kind::kBitwiseOr ||
+             binop.kind == WordBinopOp::Kind::kBitwiseXor ||
+             binop.kind == WordBinopOp::Kind::kAdd ||
+             binop.kind == WordBinopOp::Kind::kSub ||
+             binop.kind == WordBinopOp::Kind::kMul ||
+             binop.kind == WordBinopOp::Kind::kSignedDiv ||
+             binop.kind == WordBinopOp::Kind::kUnsignedDiv ||
+             binop.kind == WordBinopOp::Kind::kSignedMod ||
+             binop.kind == WordBinopOp::Kind::kUnsignedMod ||
+             binop.kind == WordBinopOp::Kind::kSignedMulOverflownBits ||
+             binop.kind == WordBinopOp::Kind::kUnsignedMulOverflownBits);
+      return true;
+    }
+    case Opcode::kShift: {
+      const auto& shift = op.Cast<ShiftOp>();
+      if (shift.rep != WordRepresentation::Word32()) return false;
+      DCHECK(shift.kind == ShiftOp::Kind::kShiftLeft ||
+             shift.kind == ShiftOp::Kind::kShiftRightLogical ||
+             shift.kind == ShiftOp::Kind::kShiftRightArithmetic ||
+             shift.kind == ShiftOp::Kind::kShiftRightArithmeticShiftOutZeros ||
+             shift.kind == ShiftOp::Kind::kRotateLeft ||
+             shift.kind == ShiftOp::Kind::kRotateRight);
+      return true;
+    }
+    case Opcode::kEqual: {
+      const auto& equal = op.Cast<EqualOp>();
+      return equal.rep == RegisterRepresentation::Word32();
+    }
+    case Opcode::kComparison: {
+      const auto& comparison = op.Cast<ComparisonOp>();
+      DCHECK(comparison.kind == ComparisonOp::Kind::kSignedLessThan ||
+             comparison.kind == ComparisonOp::Kind::kSignedLessThanOrEqual ||
+             comparison.kind == ComparisonOp::Kind::kUnsignedLessThan ||
+             comparison.kind == ComparisonOp::Kind::kUnsignedLessThanOrEqual);
+      return comparison.rep == RegisterRepresentation::Word32();
+    }
+    case Opcode::kProjection: {
+      const auto& projection = op.Cast<ProjectionOp>();
+      if (const auto* binop =
+              this->Get(projection.input()).TryCast<OverflowCheckedBinopOp>()) {
+        DCHECK(binop->kind == OverflowCheckedBinopOp::Kind::kSignedAdd ||
+               binop->kind == OverflowCheckedBinopOp::Kind::kSignedSub ||
+               binop->kind == OverflowCheckedBinopOp::Kind::kSignedMul);
+        return binop->rep == RegisterRepresentation::Word32();
+      }
+      return false;
+    }
+    case Opcode::kLoad: {
+      const auto& load = op.Cast<LoadOp>();
+      // The movzxbl/movsxbl/movzxwl/movsxwl/movl operations implicitly
+      // zero-extend to 64-bit on x64, so the zero-extension is a no-op.
+      switch (load.loaded_rep.ToMachineType().representation()) {
+        case MachineRepresentation::kWord8:
+        case MachineRepresentation::kWord16:
+        case MachineRepresentation::kWord32:
+          return true;
+        default:
+          break;
+      }
+      return false;
+    }
+    case Opcode::kConstant: {
+      X64OperandGeneratorT<TurboshaftAdapter> g(this);
+      // Constants are loaded with movl or movq, or xorl for zero; see
+      // CodeGenerator::AssembleMove. So any non-negative constant that fits
+      // in a 32-bit signed integer is zero-extended to 64 bits.
+      if (g.CanBeImmediate(node)) {
+        return g.GetImmediateIntegerValue(node) >= 0;
+      }
+      return false;
+    }
+    case Opcode::kChange:
+      return this->is_truncate_word64_to_word32(node);
+    default:
+      return false;
   }
 }
 
-bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
-  X64OperandGenerator g(this);
+template <>
+bool InstructionSelectorT<TurbofanAdapter>::ZeroExtendsWord32ToWord64NoPhis(
+    Node* node) {
+  X64OperandGeneratorT<TurbofanAdapter> g(this);
   DCHECK_NE(node->opcode(), IrOpcode::kPhi);
   switch (node->opcode()) {
     case IrOpcode::kWord32And:
@@ -1808,9 +2746,11 @@ bool InstructionSelector::ZeroExtendsWord32ToWord64NoPhis(Node* node) {
   }
 }
 
-void InstructionSelector::VisitChangeUint32ToUint64(Node* node) {
-  X64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitChangeUint32ToUint64(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
+  node_t value = this->input_at(node, 0);
   if (ZeroExtendsWord32ToWord64(value)) {
     // These 32-bit operations implicitly zero-extend to 64-bit on x64, so the
     // zero-extension is a no-op.
@@ -1821,31 +2761,44 @@ void InstructionSelector::VisitChangeUint32ToUint64(Node* node) {
 
 namespace {
 
-void VisitRO(InstructionSelector* selector, Node* node,
-             InstructionCode opcode) {
-  X64OperandGenerator g(selector);
-  selector->Emit(opcode, g.DefineAsRegister(node), g.Use(node->InputAt(0)));
+template <typename Adapter>
+void VisitRO(InstructionSelectorT<Adapter>* selector,
+             typename Adapter::node_t node, InstructionCode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  DCHECK_EQ(selector->value_input_count(node), 1);
+  selector->Emit(opcode, g.DefineAsRegister(node),
+                 g.Use(selector->input_at(node, 0)));
 }
 
-void VisitRR(InstructionSelector* selector, Node* node,
-             InstructionCode opcode) {
-  X64OperandGenerator g(selector);
-  selector->Emit(opcode, g.DefineAsRegister(node),
-                 g.UseRegister(node->InputAt(0)));
+void VisitRR(InstructionSelectorT<TurboshaftAdapter>*, Node*, InstructionCode) {
+  UNREACHABLE();
 }
 
-void VisitRRO(InstructionSelector* selector, Node* node,
-              InstructionCode opcode) {
-  X64OperandGenerator g(selector);
-  selector->Emit(opcode, g.DefineSameAsFirst(node),
-                 g.UseRegister(node->InputAt(0)), g.Use(node->InputAt(1)));
+template <typename Adapter>
+void VisitRR(InstructionSelectorT<Adapter>* selector,
+             typename Adapter::node_t node, InstructionCode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  selector->Emit(opcode, g.DefineAsRegister(node),
+                 g.UseRegister(selector->input_at(node, 0)));
 }
 
-void VisitFloatBinop(InstructionSelector* selector, Node* node,
-                     InstructionCode avx_opcode, InstructionCode sse_opcode) {
-  X64OperandGenerator g(selector);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
+template <typename Adapter>
+void VisitRRO(InstructionSelectorT<Adapter>* selector,
+              typename Adapter::node_t node, InstructionCode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  selector->Emit(opcode, g.DefineSameAsFirst(node),
+                 g.UseRegister(selector->input_at(node, 0)),
+                 g.Use(selector->input_at(node, 1)));
+}
+
+template <typename Adapter>
+void VisitFloatBinop(InstructionSelectorT<Adapter>* selector,
+                     typename Adapter::node_t node, InstructionCode avx_opcode,
+                     InstructionCode sse_opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  DCHECK_EQ(selector->value_input_count(node), 2);
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
   InstructionOperand inputs[8];
   size_t input_count = 0;
   InstructionOperand outputs[1];
@@ -1864,7 +2817,7 @@ void VisitFloatBinop(InstructionSelector* selector, Node* node,
     inputs[input_count++] = input;
   } else {
     int effect_level = selector->GetEffectLevel(node);
-    if (node->op()->HasProperty(Operator::kCommutative) &&
+    if (selector->IsCommutative(node) &&
         (g.CanBeBetterLeftOperand(right) ||
          g.CanBeMemoryOperand(avx_opcode, node, left, effect_level)) &&
         (!g.CanBeBetterLeftOperand(left) ||
@@ -1899,9 +2852,16 @@ void VisitFloatBinop(InstructionSelector* selector, Node* node,
   }
 }
 
-void VisitFloatUnop(InstructionSelector* selector, Node* node, Node* input,
-                    InstructionCode opcode) {
-  X64OperandGenerator g(selector);
+void VisitFloatUnop(InstructionSelectorT<TurboshaftAdapter>*, Node*, Node*,
+                    InstructionCode) {
+  UNIMPLEMENTED();
+}
+
+template <typename Adapter>
+void VisitFloatUnop(InstructionSelectorT<Adapter>* selector,
+                    typename Adapter::node_t node,
+                    typename Adapter::node_t input, InstructionCode opcode) {
+  X64OperandGeneratorT<Adapter> g(selector);
   if (selector->IsSupported(AVX)) {
     selector->Emit(opcode, g.DefineAsRegister(node), g.UseRegister(input));
   } else {
@@ -1911,48 +2871,48 @@ void VisitFloatUnop(InstructionSelector* selector, Node* node, Node* input,
 
 }  // namespace
 
-#define RO_OP_LIST(V)                                                    \
-  V(Word64Clz, kX64Lzcnt)                                                \
-  V(Word32Clz, kX64Lzcnt32)                                              \
-  V(Word64Ctz, kX64Tzcnt)                                                \
-  V(Word32Ctz, kX64Tzcnt32)                                              \
-  V(Word64Popcnt, kX64Popcnt)                                            \
-  V(Word32Popcnt, kX64Popcnt32)                                          \
-  V(Float64Sqrt, kSSEFloat64Sqrt)                                        \
-  V(Float32Sqrt, kSSEFloat32Sqrt)                                        \
-  V(ChangeFloat64ToInt32, kSSEFloat64ToInt32)                            \
-  V(ChangeFloat64ToInt64, kSSEFloat64ToInt64)                            \
-  V(ChangeFloat64ToUint32, kSSEFloat64ToUint32 | MiscField::encode(1))   \
-  V(TruncateFloat64ToInt64, kSSEFloat64ToInt64)                          \
-  V(TruncateFloat64ToUint32, kSSEFloat64ToUint32 | MiscField::encode(0)) \
-  V(ChangeFloat64ToUint64, kSSEFloat64ToUint64)                          \
-  V(TruncateFloat64ToFloat32, kSSEFloat64ToFloat32)                      \
-  V(ChangeFloat32ToFloat64, kSSEFloat32ToFloat64)                        \
-  V(TruncateFloat32ToInt32, kSSEFloat32ToInt32)                          \
-  V(TruncateFloat32ToUint32, kSSEFloat32ToUint32)                        \
-  V(ChangeInt32ToFloat64, kSSEInt32ToFloat64)                            \
-  V(ChangeInt64ToFloat64, kSSEInt64ToFloat64)                            \
-  V(ChangeUint32ToFloat64, kSSEUint32ToFloat64)                          \
-  V(RoundFloat64ToInt32, kSSEFloat64ToInt32)                             \
-  V(RoundInt32ToFloat32, kSSEInt32ToFloat32)                             \
-  V(RoundInt64ToFloat32, kSSEInt64ToFloat32)                             \
-  V(RoundUint64ToFloat32, kSSEUint64ToFloat32)                           \
-  V(RoundInt64ToFloat64, kSSEInt64ToFloat64)                             \
-  V(RoundUint64ToFloat64, kSSEUint64ToFloat64)                           \
-  V(RoundUint32ToFloat32, kSSEUint32ToFloat32)                           \
-  V(BitcastFloat32ToInt32, kX64BitcastFI)                                \
-  V(BitcastFloat64ToInt64, kX64BitcastDL)                                \
-  V(BitcastInt32ToFloat32, kX64BitcastIF)                                \
-  V(BitcastInt64ToFloat64, kX64BitcastLD)                                \
-  V(Float64ExtractLowWord32, kSSEFloat64ExtractLowWord32)                \
-  V(Float64ExtractHighWord32, kSSEFloat64ExtractHighWord32)              \
-  V(SignExtendWord8ToInt32, kX64Movsxbl)                                 \
-  V(SignExtendWord16ToInt32, kX64Movsxwl)                                \
-  V(SignExtendWord8ToInt64, kX64Movsxbq)                                 \
-  V(SignExtendWord16ToInt64, kX64Movsxwq)                                \
-  V(SignExtendWord32ToInt64, kX64Movsxlq)
-
-#define RR_OP_LIST(V)                                                         \
+#define RO_OP_T_LIST(V)                                                \
+  V(Word64Clz, kX64Lzcnt)                                              \
+  V(Word32Clz, kX64Lzcnt32)                                            \
+  V(Word64Ctz, kX64Tzcnt)                                              \
+  V(Word32Ctz, kX64Tzcnt32)                                            \
+  V(Word64Popcnt, kX64Popcnt)                                          \
+  V(Word32Popcnt, kX64Popcnt32)                                        \
+  V(Float64Sqrt, kSSEFloat64Sqrt)                                      \
+  V(Float32Sqrt, kSSEFloat32Sqrt)                                      \
+  V(RoundFloat64ToInt32, kSSEFloat64ToInt32)                           \
+  V(ChangeInt32ToFloat64, kSSEInt32ToFloat64)                          \
+  V(TruncateFloat64ToFloat32, kSSEFloat64ToFloat32)                    \
+  V(ChangeFloat32ToFloat64, kSSEFloat32ToFloat64)                      \
+  V(ChangeFloat64ToInt32, kSSEFloat64ToInt32)                          \
+  V(ChangeFloat64ToUint32, kSSEFloat64ToUint32 | MiscField::encode(1)) \
+  V(ChangeFloat64ToInt64, kSSEFloat64ToInt64)                          \
+  V(ChangeFloat64ToUint64, kSSEFloat64ToUint64)                        \
+  V(RoundInt32ToFloat32, kSSEInt32ToFloat32)                           \
+  V(RoundInt64ToFloat32, kSSEInt64ToFloat32)                           \
+  V(RoundUint64ToFloat32, kSSEUint64ToFloat32)                         \
+  V(RoundInt64ToFloat64, kSSEInt64ToFloat64)                           \
+  V(RoundUint64ToFloat64, kSSEUint64ToFloat64)                         \
+  V(RoundUint32ToFloat32, kSSEUint32ToFloat32)                         \
+  V(ChangeInt64ToFloat64, kSSEInt64ToFloat64)                          \
+  V(ChangeUint32ToFloat64, kSSEUint32ToFloat64)                        \
+  V(Float64ExtractLowWord32, kSSEFloat64ExtractLowWord32)              \
+  V(Float64ExtractHighWord32, kSSEFloat64ExtractHighWord32)            \
+  V(BitcastFloat32ToInt32, kX64BitcastFI)                              \
+  V(BitcastFloat64ToInt64, kX64BitcastDL)                              \
+  V(BitcastInt32ToFloat32, kX64BitcastIF)                              \
+  V(BitcastInt64ToFloat64, kX64BitcastLD)                              \
+  V(SignExtendWord8ToInt32, kX64Movsxbl)                               \
+  V(SignExtendWord16ToInt32, kX64Movsxwl)                              \
+  V(SignExtendWord8ToInt64, kX64Movsxbq)                               \
+  V(SignExtendWord16ToInt64, kX64Movsxwq)                              \
+  V(TruncateFloat64ToInt64, kSSEFloat64ToInt64)                        \
+  V(TruncateFloat32ToInt32, kSSEFloat32ToInt32)                        \
+  V(TruncateFloat32ToUint32, kSSEFloat32ToUint32)
+
+#define RR_OP_T_LIST(V)                                                       \
+  V(TruncateFloat64ToUint32, kSSEFloat64ToUint32 | MiscField::encode(0))      \
+  V(SignExtendWord32ToInt64, kX64Movsxlq)                                     \
   V(Float32RoundDown, kSSEFloat32Round | MiscField::encode(kRoundDown))       \
   V(Float64RoundDown, kSSEFloat64Round | MiscField::encode(kRoundDown))       \
   V(Float32RoundUp, kSSEFloat32Round | MiscField::encode(kRoundUp))           \
@@ -1961,178 +2921,229 @@ void VisitFloatUnop(InstructionSelector* selector, Node* node, Node* input,
   V(Float64RoundTruncate, kSSEFloat64Round | MiscField::encode(kRoundToZero)) \
   V(Float32RoundTiesEven,                                                     \
     kSSEFloat32Round | MiscField::encode(kRoundToNearest))                    \
-  V(Float64RoundTiesEven,                                                     \
-    kSSEFloat64Round | MiscField::encode(kRoundToNearest))                    \
-  V(F32x4Ceil, kX64F32x4Round | MiscField::encode(kRoundUp))                  \
-  V(F32x4Floor, kX64F32x4Round | MiscField::encode(kRoundDown))               \
-  V(F32x4Trunc, kX64F32x4Round | MiscField::encode(kRoundToZero))             \
-  V(F32x4NearestInt, kX64F32x4Round | MiscField::encode(kRoundToNearest))     \
-  V(F64x2Ceil, kX64F64x2Round | MiscField::encode(kRoundUp))                  \
-  V(F64x2Floor, kX64F64x2Round | MiscField::encode(kRoundDown))               \
-  V(F64x2Trunc, kX64F64x2Round | MiscField::encode(kRoundToZero))             \
+  V(Float64RoundTiesEven, kSSEFloat64Round | MiscField::encode(kRoundToNearest))
+
+#define RR_OP_LIST(V)                                                     \
+  V(F32x4Ceil, kX64F32x4Round | MiscField::encode(kRoundUp))              \
+  V(F32x4Floor, kX64F32x4Round | MiscField::encode(kRoundDown))           \
+  V(F32x4Trunc, kX64F32x4Round | MiscField::encode(kRoundToZero))         \
+  V(F32x4NearestInt, kX64F32x4Round | MiscField::encode(kRoundToNearest)) \
+  V(F64x2Ceil, kX64F64x2Round | MiscField::encode(kRoundUp))              \
+  V(F64x2Floor, kX64F64x2Round | MiscField::encode(kRoundDown))           \
+  V(F64x2Trunc, kX64F64x2Round | MiscField::encode(kRoundToZero))         \
   V(F64x2NearestInt, kX64F64x2Round | MiscField::encode(kRoundToNearest))
 
-#define RO_VISITOR(Name, opcode)                      \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRO(this, node, opcode);                      \
+#define RO_VISITOR(Name, opcode)                                 \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRO(this, node, opcode);                                 \
   }
-RO_OP_LIST(RO_VISITOR)
-#undef RO_VISITOR
-#undef RO_OP_LIST
+RO_OP_T_LIST(RO_VISITOR)
+#undef RO_VIISTOR
+#undef RO_OP_T_LIST
 
-#define RR_VISITOR(Name, opcode)                      \
-  void InstructionSelector::Visit##Name(Node* node) { \
-    VisitRR(this, node, opcode);                      \
+#define RR_VISITOR(Name, opcode)                                \
+  template <typename Adapter>                                   \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) { \
+    VisitRR(this, node, opcode);                                \
   }
 RR_OP_LIST(RR_VISITOR)
 #undef RR_VISITOR
 #undef RR_OP_LIST
 
-void InstructionSelector::VisitTruncateFloat64ToWord32(Node* node) {
+#define RR_VISITOR(Name, opcode)                                 \
+  template <typename Adapter>                                    \
+  void InstructionSelectorT<Adapter>::Visit##Name(node_t node) { \
+    VisitRR(this, node, opcode);                                 \
+  }
+RR_OP_T_LIST(RR_VISITOR)
+#undef RR_VISITOR
+#undef RR_OP_T_LIST
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateFloat64ToWord32(node_t node) {
   VisitRR(this, node, kArchTruncateDoubleToI);
 }
 
-void InstructionSelector::VisitTruncateInt64ToInt32(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitTruncateInt64ToInt32(node_t node) {
   // We rely on the fact that TruncateInt64ToInt32 zero extends the
   // value (see ZeroExtendsWord32ToWord64). So all code paths here
   // have to satisfy that condition.
-  X64OperandGenerator g(this);
-  Node* value = node->InputAt(0);
-  bool can_cover = false;
-  if (value->opcode() == IrOpcode::kBitcastTaggedToWordForTagAndSmiBits) {
-    can_cover = CanCover(node, value) && CanCover(value, value->InputAt(0));
-    value = value->InputAt(0);
-  } else {
-    can_cover = CanCover(node, value);
-  }
-  if (can_cover) {
-    switch (value->opcode()) {
-      case IrOpcode::kWord64Sar:
-      case IrOpcode::kWord64Shr: {
-        Int64BinopMatcher m(value);
-        if (m.right().Is(32)) {
-          if (CanCover(value, value->InputAt(0)) &&
-              TryMatchLoadWord64AndShiftRight(this, value, kX64Movl)) {
-            return EmitIdentity(node);
+  X64OperandGeneratorT<Adapter> g(this);
+
+  node_t value = this->input_at(node, 0);
+  // TODO(nicohartmann): Port this to Turboshaft.
+  if constexpr (Adapter::IsTurbofan) {
+    bool can_cover = false;
+    if (value->opcode() == IrOpcode::kBitcastTaggedToWordForTagAndSmiBits) {
+      can_cover = CanCover(node, value) && CanCover(value, value->InputAt(0));
+      value = value->InputAt(0);
+    } else {
+      can_cover = CanCover(node, value);
+    }
+    if (can_cover) {
+      switch (value->opcode()) {
+        case IrOpcode::kWord64Sar:
+        case IrOpcode::kWord64Shr: {
+          Int64BinopMatcher m(value);
+          if (m.right().Is(32)) {
+            if (CanCover(value, value->InputAt(0)) &&
+                TryMatchLoadWord64AndShiftRight(this, value, kX64Movl)) {
+              return EmitIdentity(node);
+            }
+            Emit(kX64Shr, g.DefineSameAsFirst(node),
+                 g.UseRegister(m.left().node()), g.TempImmediate(32));
+            return;
           }
-          Emit(kX64Shr, g.DefineSameAsFirst(node),
-               g.UseRegister(m.left().node()), g.TempImmediate(32));
+          break;
+        }
+        case IrOpcode::kLoad:
+        case IrOpcode::kLoadImmutable: {
+          TryMergeTruncateInt64ToInt32IntoLoad(this, node, value);
           return;
         }
-        break;
-      }
-      case IrOpcode::kLoad:
-      case IrOpcode::kLoadImmutable: {
-        TryMergeTruncateInt64ToInt32IntoLoad(this, node, value);
-        return;
+        default:
+          break;
       }
-      default:
-        break;
     }
   }
   Emit(kX64Movl, g.DefineAsRegister(node), g.Use(value));
 }
 
-void InstructionSelector::VisitFloat32Add(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Add(node_t node) {
   VisitFloatBinop(this, node, kAVXFloat32Add, kSSEFloat32Add);
 }
 
-void InstructionSelector::VisitFloat32Sub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Sub(node_t node) {
   VisitFloatBinop(this, node, kAVXFloat32Sub, kSSEFloat32Sub);
 }
 
-void InstructionSelector::VisitFloat32Mul(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Mul(node_t node) {
   VisitFloatBinop(this, node, kAVXFloat32Mul, kSSEFloat32Mul);
 }
 
-void InstructionSelector::VisitFloat32Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Div(node_t node) {
   VisitFloatBinop(this, node, kAVXFloat32Div, kSSEFloat32Div);
 }
 
-void InstructionSelector::VisitFloat32Abs(Node* node) {
-  VisitFloatUnop(this, node, node->InputAt(0), kX64Float32Abs);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Abs(node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  VisitFloatUnop(this, node, this->input_at(node, 0), kX64Float32Abs);
 }
 
-void InstructionSelector::VisitFloat32Max(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Max(node_t node) {
   VisitRRO(this, node, kSSEFloat32Max);
 }
 
-void InstructionSelector::VisitFloat32Min(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Min(node_t node) {
   VisitRRO(this, node, kSSEFloat32Min);
 }
 
-void InstructionSelector::VisitFloat64Add(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Add(node_t node) {
   VisitFloatBinop(this, node, kAVXFloat64Add, kSSEFloat64Add);
 }
 
-void InstructionSelector::VisitFloat64Sub(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Sub(node_t node) {
   VisitFloatBinop(this, node, kAVXFloat64Sub, kSSEFloat64Sub);
 }
 
-void InstructionSelector::VisitFloat64Mul(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mul(node_t node) {
   VisitFloatBinop(this, node, kAVXFloat64Mul, kSSEFloat64Mul);
 }
 
-void InstructionSelector::VisitFloat64Div(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Div(node_t node) {
   VisitFloatBinop(this, node, kAVXFloat64Div, kSSEFloat64Div);
 }
 
-void InstructionSelector::VisitFloat64Mod(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Mod(node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 2);
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempRegister(rax)};
   Emit(kSSEFloat64Mod, g.DefineSameAsFirst(node),
-       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)), 1,
-       temps);
+       g.UseRegister(this->input_at(node, 0)),
+       g.UseRegister(this->input_at(node, 1)), 1, temps);
 }
 
-void InstructionSelector::VisitFloat64Max(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Max(node_t node) {
   VisitRRO(this, node, kSSEFloat64Max);
 }
 
-void InstructionSelector::VisitFloat64Min(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Min(node_t node) {
   VisitRRO(this, node, kSSEFloat64Min);
 }
 
-void InstructionSelector::VisitFloat64Abs(Node* node) {
-  VisitFloatUnop(this, node, node->InputAt(0), kX64Float64Abs);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Abs(node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  VisitFloatUnop(this, node, this->input_at(node, 0), kX64Float64Abs);
 }
 
-void InstructionSelector::VisitFloat64RoundTiesAway(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64RoundTiesAway(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitFloat32Neg(Node* node) {
-  VisitFloatUnop(this, node, node->InputAt(0), kX64Float32Neg);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Neg(node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  VisitFloatUnop(this, node, this->input_at(node, 0), kX64Float32Neg);
 }
 
-void InstructionSelector::VisitFloat64Neg(Node* node) {
-  VisitFloatUnop(this, node, node->InputAt(0), kX64Float64Neg);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Neg(node_t node) {
+  DCHECK_EQ(this->value_input_count(node), 1);
+  VisitFloatUnop(this, node, this->input_at(node, 0), kX64Float64Neg);
 }
 
-void InstructionSelector::VisitFloat64Ieee754Binop(Node* node,
-                                                   InstructionCode opcode) {
-  X64OperandGenerator g(this);
-  Emit(opcode, g.DefineAsFixed(node, xmm0), g.UseFixed(node->InputAt(0), xmm0),
-       g.UseFixed(node->InputAt(1), xmm1))
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Binop(
+    node_t node, InstructionCode opcode) {
+  DCHECK_EQ(this->value_input_count(node), 2);
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(opcode, g.DefineAsFixed(node, xmm0),
+       g.UseFixed(this->input_at(node, 0), xmm0),
+       g.UseFixed(this->input_at(node, 1), xmm1))
       ->MarkAsCall();
 }
 
-void InstructionSelector::VisitFloat64Ieee754Unop(Node* node,
-                                                  InstructionCode opcode) {
-  X64OperandGenerator g(this);
-  Emit(opcode, g.DefineAsFixed(node, xmm0), g.UseFixed(node->InputAt(0), xmm0))
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Ieee754Unop(
+    node_t node, InstructionCode opcode) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
+  Emit(opcode, g.DefineAsFixed(node, xmm0),
+       g.UseFixed(this->input_at(node, 0), xmm0))
       ->MarkAsCall();
 }
 
-void InstructionSelector::EmitMoveParamToFPR(Node* node, int index) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveParamToFPR(node_t node, int index) {
+}
 
-void InstructionSelector::EmitMoveFPRToParam(InstructionOperand* op,
-                                             LinkageLocation location) {}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitMoveFPRToParam(
+    InstructionOperand* op, LinkageLocation location) {}
 
-void InstructionSelector::EmitPrepareArguments(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareArguments(
     ZoneVector<PushParameter>* arguments, const CallDescriptor* call_descriptor,
-    Node* node) {
-  X64OperandGenerator g(this);
+    node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
 
   // Prepare for C function call.
   if (call_descriptor->IsCFunctionCall()) {
@@ -2143,7 +3154,7 @@ void InstructionSelector::EmitPrepareArguments(
     // Poke any stack arguments.
     for (size_t n = 0; n < arguments->size(); ++n) {
       PushParameter input = (*arguments)[n];
-      if (input.node) {
+      if (this->valid(input.node)) {
         int slot = static_cast<int>(n);
         InstructionOperand value = g.CanBeImmediate(input.node)
                                        ? g.UseImmediate(input.node)
@@ -2159,7 +3170,7 @@ void InstructionSelector::EmitPrepareArguments(
       stack_decrement += kSystemPointerSize;
       // Skip holes in the param array. These represent both extra slots for
       // multi-slot values and padding slots for alignment.
-      if (input.node == nullptr) continue;
+      if (!this->valid(input.node)) continue;
       InstructionOperand decrement = g.UseImmediate(stack_decrement);
       stack_decrement = 0;
       if (g.CanBeImmediate(input.node)) {
@@ -2186,14 +3197,15 @@ void InstructionSelector::EmitPrepareArguments(
   }
 }
 
-void InstructionSelector::EmitPrepareResults(
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::EmitPrepareResults(
     ZoneVector<PushParameter>* results, const CallDescriptor* call_descriptor,
-    Node* node) {
-  X64OperandGenerator g(this);
+    node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
   for (PushParameter output : *results) {
     if (!output.location.IsCallerFrameSlot()) continue;
     // Skip any alignment holes in nodes.
-    if (output.node != nullptr) {
+    if (this->valid(output.node)) {
       DCHECK(!call_descriptor->IsCFunctionCall());
       if (output.location.GetType() == MachineType::Float32()) {
         MarkAsFloat32(output.node);
@@ -2211,17 +3223,43 @@ void InstructionSelector::EmitPrepareResults(
   }
 }
 
-bool InstructionSelector::IsTailCallAddressImmediate() { return true; }
+template <typename Adapter>
+bool InstructionSelectorT<Adapter>::IsTailCallAddressImmediate() {
+  return true;
+}
+
+template <>
+Node* InstructionSelectorT<TurbofanAdapter>::FindProjection(
+    Node* node, size_t projection_index) {
+  return NodeProperties::FindProjection(node, projection_index);
+}
+
+template <>
+turboshaft::OpIndex InstructionSelectorT<TurboshaftAdapter>::FindProjection(
+    turboshaft::OpIndex node, size_t projection_index) {
+  // TODO(nicohartmann@): We need to make sure to emit canoncial projections
+  // right after all operations with multiple outputs for this to work
+  // correctly.
+  for (turboshaft::OpIndex use : turboshaft_uses(node)) {
+    if (const turboshaft::ProjectionOp* projection =
+            this->Get(use).TryCast<turboshaft::ProjectionOp>()) {
+      DCHECK_EQ(projection->input(), node);
+      if (projection->index == projection_index) return use;
+    }
+  }
+  return turboshaft::OpIndex::Invalid();
+}
 
 namespace {
 
-void VisitCompareWithMemoryOperand(InstructionSelector* selector,
-                                   InstructionCode opcode, Node* left,
+template <typename Adapter>
+void VisitCompareWithMemoryOperand(InstructionSelectorT<Adapter>* selector,
+                                   InstructionCode opcode,
+                                   typename Adapter::node_t left,
                                    InstructionOperand right,
-                                   FlagsContinuation* cont) {
-  DCHECK(IrOpcode::kLoad == left->opcode() ||
-         IrOpcode::kLoadImmutable == left->opcode());
-  X64OperandGenerator g(selector);
+                                   FlagsContinuationT<Adapter>* cont) {
+  DCHECK(selector->IsLoadOrLoadImmutable(left));
+  X64OperandGeneratorT<Adapter> g(selector);
   size_t input_count = 0;
   InstructionOperand inputs[6];
   AddressingMode addressing_mode =
@@ -2243,11 +3281,12 @@ void VisitCompareWithMemoryOperand(InstructionSelector* selector,
 }
 
 // Shared routine for multiple compare operations.
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  InstructionOperand left, InstructionOperand right,
-                  FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, InstructionOperand left,
+                  InstructionOperand right, FlagsContinuationT<Adapter>* cont) {
   if (cont->IsSelect()) {
-    X64OperandGenerator g(selector);
+    X64OperandGeneratorT<Adapter> g(selector);
     InstructionOperand inputs[4] = {left, right};
     if (cont->condition() == kUnorderedEqual) {
       cont->Negate();
@@ -2264,25 +3303,26 @@ void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
 }
 
 // Shared routine for multiple compare operations.
-void VisitCompare(InstructionSelector* selector, InstructionCode opcode,
-                  Node* left, Node* right, FlagsContinuation* cont,
-                  bool commutative) {
-  X64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitCompare(InstructionSelectorT<Adapter>* selector,
+                  InstructionCode opcode, typename Adapter::node_t left,
+                  typename Adapter::node_t right,
+                  FlagsContinuationT<Adapter>* cont, bool commutative) {
+  X64OperandGeneratorT<Adapter> g(selector);
   if (commutative && g.CanBeBetterLeftOperand(right)) {
     std::swap(left, right);
   }
   VisitCompare(selector, opcode, g.UseRegister(left), g.Use(right), cont);
 }
 
-MachineType MachineTypeForNarrow(Node* node, Node* hint_node) {
-  if (hint_node->opcode() == IrOpcode::kLoad ||
-      hint_node->opcode() == IrOpcode::kLoadImmutable) {
-    MachineType hint = LoadRepresentationOf(hint_node->op());
-    if (node->opcode() == IrOpcode::kInt32Constant ||
-        node->opcode() == IrOpcode::kInt64Constant) {
-      int64_t constant = node->opcode() == IrOpcode::kInt32Constant
-                             ? OpParameter<int32_t>(node->op())
-                             : OpParameter<int64_t>(node->op());
+template <typename Adapter>
+MachineType MachineTypeForNarrow(InstructionSelectorT<Adapter>* selector,
+                                 typename Adapter::node_t node,
+                                 typename Adapter::node_t hint_node) {
+  if (selector->IsLoadOrLoadImmutable(hint_node)) {
+    MachineType hint = selector->load_view(hint_node).loaded_rep();
+    if (selector->is_integer_constant(node)) {
+      int64_t constant = selector->integer_constant(node);
       if (hint == MachineType::Int8()) {
         if (constant >= std::numeric_limits<int8_t>::min() &&
             constant <= std::numeric_limits<int8_t>::max()) {
@@ -2315,40 +3355,54 @@ MachineType MachineTypeForNarrow(Node* node, Node* hint_node) {
       }
     }
   }
-  return node->opcode() == IrOpcode::kLoad ||
-                 node->opcode() == IrOpcode::kLoadImmutable
-             ? LoadRepresentationOf(node->op())
-             : MachineType::None();
+  if (selector->IsLoadOrLoadImmutable(node)) {
+    return selector->load_view(node).loaded_rep();
+  }
+  return MachineType::None();
 }
 
-bool IsIntConstant(Node* node) {
+bool IsIntConstant(InstructionSelectorT<TurbofanAdapter>*, Node* node) {
   return node->opcode() == IrOpcode::kInt32Constant ||
          node->opcode() == IrOpcode::kInt64Constant;
 }
-
-bool IsWordAnd(Node* node) {
+bool IsIntConstant(InstructionSelectorT<TurboshaftAdapter>* selector,
+                   turboshaft::OpIndex node) {
+  if (auto constant = selector->Get(node).TryCast<turboshaft::ConstantOp>()) {
+    return constant->kind == turboshaft::ConstantOp::Kind::kWord32 ||
+           constant->kind == turboshaft::ConstantOp::Kind::kWord64;
+  }
+  return false;
+}
+bool IsWordAnd(InstructionSelectorT<TurbofanAdapter>*, Node* node) {
   return node->opcode() == IrOpcode::kWord32And ||
          node->opcode() == IrOpcode::kWord64And;
 }
+bool IsWordAnd(InstructionSelectorT<TurboshaftAdapter>* selector,
+               turboshaft::OpIndex node) {
+  if (auto binop = selector->Get(node).TryCast<turboshaft::WordBinopOp>()) {
+    return binop->kind == turboshaft::WordBinopOp::Kind::kBitwiseAnd;
+  }
+  return false;
+}
 
 // The result of WordAnd with a positive interger constant in X64 is known to
 // be sign(zero)-extended. Comparing this result with another positive interger
 // constant can have narrowed operand.
-MachineType MachineTypeForNarrowWordAnd(Node* and_node, Node* constant_node) {
-  Node* and_left = and_node->InputAt(0);
-  Node* and_right = and_node->InputAt(1);
-  Node* and_constant_node = IsIntConstant(and_right)
-                                ? and_right
-                                : IsIntConstant(and_left) ? and_left : nullptr;
-
-  if (and_constant_node != nullptr) {
-    int64_t and_constant =
-        and_constant_node->opcode() == IrOpcode::kInt32Constant
-            ? OpParameter<int32_t>(and_constant_node->op())
-            : OpParameter<int64_t>(and_constant_node->op());
-    int64_t cmp_constant = constant_node->opcode() == IrOpcode::kInt32Constant
-                               ? OpParameter<int32_t>(constant_node->op())
-                               : OpParameter<int64_t>(constant_node->op());
+template <typename Adapter>
+MachineType MachineTypeForNarrowWordAnd(
+    InstructionSelectorT<Adapter>* selector, typename Adapter::node_t and_node,
+    typename Adapter::node_t constant_node) {
+  DCHECK_EQ(selector->value_input_count(and_node), 2);
+  auto and_left = selector->input_at(and_node, 0);
+  auto and_right = selector->input_at(and_node, 1);
+  auto and_constant_node = IsIntConstant(selector, and_right) ? and_right
+                           : IsIntConstant(selector, and_left)
+                               ? and_left
+                               : typename Adapter::node_t{};
+
+  if (Adapter::valid(and_constant_node)) {
+    int64_t and_constant = selector->integer_constant(and_constant_node);
+    int64_t cmp_constant = selector->integer_constant(constant_node);
     if (and_constant >= 0 && cmp_constant >= 0) {
       int64_t constant =
           and_constant > cmp_constant ? and_constant : cmp_constant;
@@ -2373,22 +3427,26 @@ MachineType MachineTypeForNarrowWordAnd(Node* and_node, Node* constant_node) {
 
 // Tries to match the size of the given opcode to that of the operands, if
 // possible.
-InstructionCode TryNarrowOpcodeSize(InstructionCode opcode, Node* left,
-                                    Node* right, FlagsContinuation* cont) {
+template <typename Adapter>
+InstructionCode TryNarrowOpcodeSize(InstructionSelectorT<Adapter>* selector,
+                                    InstructionCode opcode,
+                                    typename Adapter::node_t left,
+                                    typename Adapter::node_t right,
+                                    FlagsContinuationT<Adapter>* cont) {
   MachineType left_type = MachineType::None();
   MachineType right_type = MachineType::None();
-  if (IsWordAnd(left) && IsIntConstant(right)) {
-    left_type = MachineTypeForNarrowWordAnd(left, right);
+  if (IsWordAnd(selector, left) && IsIntConstant(selector, right)) {
+    left_type = MachineTypeForNarrowWordAnd(selector, left, right);
     right_type = left_type;
-  } else if (IsWordAnd(right) && IsIntConstant(left)) {
-    right_type = MachineTypeForNarrowWordAnd(right, left);
+  } else if (IsWordAnd(selector, right) && IsIntConstant(selector, left)) {
+    right_type = MachineTypeForNarrowWordAnd(selector, right, left);
     left_type = right_type;
   } else {
     // TODO(epertoso): we can probably get some size information out phi nodes.
     // If the load representations don't match, both operands will be
     // zero/sign-extended to 32bit.
-    left_type = MachineTypeForNarrow(left, right);
-    right_type = MachineTypeForNarrow(right, left);
+    left_type = MachineTypeForNarrow(selector, left, right);
+    right_type = MachineTypeForNarrow(selector, right, left);
   }
   if (left_type == right_type) {
     switch (left_type.representation()) {
@@ -2451,7 +3509,10 @@ If Int32LessThanOrEqual select cmp16, the above Word32And can be removed:
 37:  Int32LessThanOrEqual(36, 18)
 38:  Branch[None]
 */
-void RemoveUnnecessaryWordAnd(InstructionCode opcode, Node** and_node) {
+template <typename Adapter>
+typename Adapter::node_t RemoveUnnecessaryWordAnd(
+    InstructionSelectorT<Adapter>* selector, InstructionCode opcode,
+    typename Adapter::node_t and_node) {
   int64_t mask = 0;
 
   if (opcode == kX64Cmp32 || opcode == kX64Test32) {
@@ -2461,57 +3522,51 @@ void RemoveUnnecessaryWordAnd(InstructionCode opcode, Node** and_node) {
   } else if (opcode == kX64Cmp8 || opcode == kX64Test8) {
     mask = std::numeric_limits<uint8_t>::max();
   } else {
-    return;
+    return and_node;
   }
 
-  Node* and_left = (*and_node)->InputAt(0);
-  Node* and_right = (*and_node)->InputAt(1);
-  Node* and_constant_node = nullptr;
-  Node* and_other_node = nullptr;
-  if (IsIntConstant(and_left)) {
+  DCHECK_EQ(selector->value_input_count(and_node), 2);
+  auto and_left = selector->input_at(and_node, 0);
+  auto and_right = selector->input_at(and_node, 1);
+  auto and_constant_node = typename Adapter::node_t{};
+  auto and_other_node = typename Adapter::node_t{};
+  if (IsIntConstant(selector, and_left)) {
     and_constant_node = and_left;
     and_other_node = and_right;
-  } else if (IsIntConstant(and_right)) {
+  } else if (IsIntConstant(selector, and_right)) {
     and_constant_node = and_right;
     and_other_node = and_left;
   }
 
-  if (and_constant_node) {
-    int64_t and_constant;
-    if (and_constant_node->opcode() == IrOpcode::kInt32Constant) {
-      and_constant = OpParameter<int32_t>(and_constant_node->op());
-    } else if (and_constant_node->opcode() == IrOpcode::kInt64Constant) {
-      and_constant = OpParameter<int64_t>(and_constant_node->op());
-    } else {
-      UNREACHABLE();
-    }
-
-    if (and_constant == mask) {
-      *and_node = and_other_node;
-    }
+  if (Adapter::valid(and_constant_node)) {
+    int64_t and_constant = selector->integer_constant(and_constant_node);
+    if (and_constant == mask) return and_other_node;
   }
+  return and_node;
 }
 
 // Shared routine for multiple word compare operations.
-void VisitWordCompare(InstructionSelector* selector, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont) {
-  X64OperandGenerator g(selector);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
+template <typename Adapter>
+void VisitWordCompare(InstructionSelectorT<Adapter>* selector,
+                      typename Adapter::node_t node, InstructionCode opcode,
+                      FlagsContinuationT<Adapter>* cont) {
+  X64OperandGeneratorT<Adapter> g(selector);
+  DCHECK_EQ(selector->value_input_count(node), 2);
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
 
   // The 32-bit comparisons automatically truncate Word64
   // values to Word32 range, no need to do that explicitly.
   if (opcode == kX64Cmp32 || opcode == kX64Test32) {
-    if (left->opcode() == IrOpcode::kTruncateInt64ToInt32) {
-      left = left->InputAt(0);
+    if (selector->is_truncate_word64_to_word32(left)) {
+      left = selector->input_at(left, 0);
     }
-
-    if (right->opcode() == IrOpcode::kTruncateInt64ToInt32) {
-      right = right->InputAt(0);
+    if (selector->is_truncate_word64_to_word32(right)) {
+      right = selector->input_at(right, 0);
     }
   }
 
-  opcode = TryNarrowOpcodeSize(opcode, left, right, cont);
+  opcode = TryNarrowOpcodeSize(selector, opcode, left, right, cont);
 
   // If one of the two inputs is an immediate, make sure it's on the right, or
   // if one of the two inputs is a memory operand, make sure it's on the left.
@@ -2520,12 +3575,12 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
   if ((!g.CanBeImmediate(right) && g.CanBeImmediate(left)) ||
       (g.CanBeMemoryOperand(opcode, node, right, effect_level) &&
        !g.CanBeMemoryOperand(opcode, node, left, effect_level))) {
-    if (!node->op()->HasProperty(Operator::kCommutative)) cont->Commute();
+    if (!selector->IsCommutative(node)) cont->Commute();
     std::swap(left, right);
   }
 
-  if (IsWordAnd(left)) {
-    RemoveUnnecessaryWordAnd(opcode, &left);
+  if (IsWordAnd(selector, left)) {
+    left = RemoveUnnecessaryWordAnd(selector, opcode, left);
   }
 
   // Match immediates on right side of comparison.
@@ -2545,81 +3600,198 @@ void VisitWordCompare(InstructionSelector* selector, Node* node,
   }
 
   return VisitCompare(selector, opcode, left, right, cont,
-                      node->op()->HasProperty(Operator::kCommutative));
+                      selector->IsCommutative(node));
 }
 
-void VisitWord64EqualImpl(InstructionSelector* selector, Node* node,
-                          FlagsContinuation* cont) {
+template <typename Adapter>
+void VisitWord64EqualImpl(InstructionSelectorT<Adapter>* selector,
+                          typename Adapter::node_t node,
+                          FlagsContinuationT<Adapter>* cont) {
   if (selector->CanUseRootsRegister()) {
-    X64OperandGenerator g(selector);
+    X64OperandGeneratorT<Adapter> g(selector);
     const RootsTable& roots_table = selector->isolate()->roots_table();
     RootIndex root_index;
-    HeapObjectBinopMatcher m(node);
-    if (m.right().HasResolvedValue() &&
-        roots_table.IsRootHandle(m.right().ResolvedValue(), &root_index)) {
-      InstructionCode opcode =
-          kX64Cmp | AddressingModeField::encode(kMode_Root);
-      return VisitCompare(
-          selector, opcode,
-          g.TempImmediate(
-              MacroAssemblerBase::RootRegisterOffsetForRootIndex(root_index)),
-          g.UseRegister(m.left().node()), cont);
+    if constexpr (Adapter::IsTurboshaft) {
+      using namespace turboshaft;  // NOLINT(build/namespaces)
+      const EqualOp& equal = selector->Get(node).template Cast<EqualOp>();
+      Handle<HeapObject> object;
+      if (equal.rep == RegisterRepresentation::Tagged() &&
+          selector->MatchTaggedConstant(equal.right(), &object)) {
+        if (roots_table.IsRootHandle(object, &root_index)) {
+          InstructionCode opcode =
+              kX64Cmp | AddressingModeField::encode(kMode_Root);
+          return VisitCompare(
+              selector, opcode,
+              g.TempImmediate(
+                  MacroAssemblerBase::RootRegisterOffsetForRootIndex(
+                      root_index)),
+              g.UseRegister(equal.left()), cont);
+        }
+      }
+    } else {
+      HeapObjectBinopMatcher m(node);
+      if (m.right().HasResolvedValue() &&
+          roots_table.IsRootHandle(m.right().ResolvedValue(), &root_index)) {
+        InstructionCode opcode =
+            kX64Cmp | AddressingModeField::encode(kMode_Root);
+        return VisitCompare(
+            selector, opcode,
+            g.TempImmediate(
+                MacroAssemblerBase::RootRegisterOffsetForRootIndex(root_index)),
+            g.UseRegister(m.left().node()), cont);
+      }
     }
   }
   VisitWordCompare(selector, node, kX64Cmp, cont);
 }
 
-void VisitWord32EqualImpl(InstructionSelector* selector, Node* node,
-                          FlagsContinuation* cont) {
+bool MatchHeapObjectEqual(InstructionSelectorT<TurbofanAdapter>* selector,
+                          Node* node, Node** left, Handle<HeapObject>* right) {
+  DCHECK_EQ(node->opcode(), IrOpcode::kWord32Equal);
+  CompressedHeapObjectBinopMatcher m(node);
+  if (m.right().HasResolvedValue()) {
+    *left = m.left().node();
+    *right = m.right().ResolvedValue();
+    return true;
+  }
+  HeapObjectBinopMatcher m2(node);
+  if (m2.right().HasResolvedValue()) {
+    *left = m2.left().node();
+    *right = m2.right().ResolvedValue();
+    return true;
+  }
+  return false;
+}
+
+bool MatchHeapObjectEqual(InstructionSelectorT<TurboshaftAdapter>* selector,
+                          turboshaft::OpIndex node, turboshaft::OpIndex* left,
+                          Handle<HeapObject>* right) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  const EqualOp& equal = selector->Get(node).Cast<EqualOp>();
+  if (selector->MatchTaggedConstant(equal.right(), right)) {
+    *left = equal.left();
+    return true;
+  }
+  return false;
+}
+
+template <typename Adapter>
+void VisitWord32EqualImpl(InstructionSelectorT<Adapter>* selector,
+                          typename Adapter::node_t node,
+                          FlagsContinuationT<Adapter>* cont) {
   if (COMPRESS_POINTERS_BOOL && selector->isolate()) {
-    X64OperandGenerator g(selector);
+    X64OperandGeneratorT<Adapter> g(selector);
     const RootsTable& roots_table = selector->isolate()->roots_table();
     RootIndex root_index;
-    Node* left = nullptr;
+    typename Adapter::node_t left;
     Handle<HeapObject> right;
     // HeapConstants and CompressedHeapConstants can be treated the same when
     // using them as an input to a 32-bit comparison. Check whether either is
     // present.
-    {
-      CompressedHeapObjectBinopMatcher m(node);
-      if (m.right().HasResolvedValue()) {
-        left = m.left().node();
-        right = m.right().ResolvedValue();
-      } else {
-        HeapObjectBinopMatcher m2(node);
-        if (m2.right().HasResolvedValue()) {
-          left = m2.left().node();
-          right = m2.right().ResolvedValue();
+    if (MatchHeapObjectEqual(selector, node, &left, &right)) {
+      if (roots_table.IsRootHandle(right, &root_index)) {
+        DCHECK(Adapter::valid(left));
+        if (RootsTable::IsReadOnly(root_index) &&
+            (V8_STATIC_ROOTS_BOOL || !selector->isolate()->bootstrapper())) {
+          return VisitCompare(
+              selector, kX64Cmp32, g.UseRegister(left),
+              g.TempImmediate(MacroAssemblerBase::ReadOnlyRootPtr(
+                  root_index, selector->isolate())),
+              cont);
+        }
+        if (selector->CanUseRootsRegister()) {
+          InstructionCode opcode =
+              kX64Cmp32 | AddressingModeField::encode(kMode_Root);
+          return VisitCompare(
+              selector, opcode,
+              g.TempImmediate(
+                  MacroAssemblerBase::RootRegisterOffsetForRootIndex(
+                      root_index)),
+              g.UseRegister(left), cont);
         }
       }
     }
-    if (!right.is_null() && roots_table.IsRootHandle(right, &root_index)) {
-      DCHECK_NE(left, nullptr);
-      if (RootsTable::IsReadOnly(root_index) &&
-          (V8_STATIC_ROOTS_BOOL || !selector->isolate()->bootstrapper())) {
-        return VisitCompare(selector, kX64Cmp32, g.UseRegister(left),
-                            g.TempImmediate(MacroAssemblerBase::ReadOnlyRootPtr(
-                                root_index, selector->isolate())),
-                            cont);
+  }
+  VisitWordCompare(selector, node, kX64Cmp32, cont);
+}
+
+void VisitCompareZero(InstructionSelectorT<TurboshaftAdapter>* selector,
+                      turboshaft::OpIndex user, turboshaft::OpIndex node,
+                      InstructionCode opcode,
+                      FlagsContinuationT<TurboshaftAdapter>* cont) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  X64OperandGeneratorT<TurboshaftAdapter> g(selector);
+  const Operation& op = selector->turboshaft_graph()->Get(node);
+  if (cont->IsBranch() &&
+      (cont->condition() == kNotEqual || cont->condition() == kEqual)) {
+    if (const WordBinopOp* binop = op.TryCast<WordBinopOp>()) {
+      if (selector->IsOnlyUserOfNodeInSameBlock(user, node)) {
+        const bool is64 = binop->rep == WordRepresentation::Word64();
+        switch (binop->kind) {
+          case WordBinopOp::Kind::kAdd:
+            return VisitBinop(selector, node, is64 ? kX64Add : kX64Add32, cont);
+          case WordBinopOp::Kind::kSub:
+            return VisitBinop(selector, node, is64 ? kX64Sub : kX64Sub32, cont);
+          case WordBinopOp::Kind::kBitwiseAnd:
+            return VisitBinop(selector, node, is64 ? kX64And : kX64And32, cont);
+          case WordBinopOp::Kind::kBitwiseOr:
+            return VisitBinop(selector, node, is64 ? kX64Or : kX64Or32, cont);
+          default:
+            break;
+        }
       }
-      if (selector->CanUseRootsRegister()) {
-        InstructionCode opcode =
-            kX64Cmp32 | AddressingModeField::encode(kMode_Root);
-        return VisitCompare(
-            selector, opcode,
-            g.TempImmediate(
-                MacroAssemblerBase::RootRegisterOffsetForRootIndex(root_index)),
-            g.UseRegister(left), cont);
+    } else if (const ShiftOp* shift = op.TryCast<ShiftOp>()) {
+      if (selector->IsOnlyUserOfNodeInSameBlock(user, node)) {
+        const bool is64 = shift->rep == WordRepresentation::Word64();
+        switch (shift->kind) {
+          case ShiftOp::Kind::kShiftLeft:
+            if (TryVisitWordShift(selector, node, is64 ? 64 : 32,
+                                  is64 ? kX64Shl : kX64Shl32, cont)) {
+              return;
+            }
+            break;
+          case ShiftOp::Kind::kShiftRightLogical:
+            if (TryVisitWordShift(selector, node, is64 ? 64 : 32,
+                                  is64 ? kX64Shr : kX64Shr32, cont)) {
+              return;
+            }
+            break;
+          default:
+            break;
+        }
       }
     }
   }
-  VisitWordCompare(selector, node, kX64Cmp32, cont);
+
+  int effect_level = selector->GetEffectLevel(node, cont);
+  if (const auto load = op.TryCast<turboshaft::LoadOp>()) {
+    if (load->loaded_rep == turboshaft::MemoryRepresentation::Int8()) {
+      if (opcode == kX64Cmp32) {
+        opcode = kX64Cmp8;
+      } else if (opcode == kX64Test32) {
+        opcode = kX64Test8;
+      }
+    } else if (load->loaded_rep == turboshaft::MemoryRepresentation::Int16()) {
+      if (opcode == kX64Cmp32) {
+        opcode = kX64Cmp16;
+      } else if (opcode == kX64Test32) {
+        opcode = kX64Test16;
+      }
+    }
+  }
+  if (g.CanBeMemoryOperand(opcode, user, node, effect_level)) {
+    VisitCompareWithMemoryOperand(selector, opcode, node, g.TempImmediate(0),
+                                  cont);
+  } else {
+    VisitCompare(selector, opcode, g.Use(node), g.TempImmediate(0), cont);
+  }
 }
 
 // Shared routine for comparison with zero.
-void VisitCompareZero(InstructionSelector* selector, Node* user, Node* node,
-                      InstructionCode opcode, FlagsContinuation* cont) {
-  X64OperandGenerator g(selector);
+void VisitCompareZero(InstructionSelectorT<TurbofanAdapter>* selector,
+                      Node* user, Node* node, InstructionCode opcode,
+                      FlagsContinuationT<TurbofanAdapter>* cont) {
+  X64OperandGeneratorT<TurbofanAdapter> g(selector);
   if (cont->IsBranch() &&
       (cont->condition() == kNotEqual || cont->condition() == kEqual)) {
     switch (node->opcode()) {
@@ -2642,19 +3814,17 @@ void VisitCompareZero(InstructionSelector* selector, Node* user, Node* node,
 #undef FLAGS_SET_BINOP_LIST
 #undef FLAGS_SET_BINOP
 
-#define TRY_VISIT_WORD32_SHIFT TryVisitWordShift<Int32BinopMatcher, 32>
-#define TRY_VISIT_WORD64_SHIFT TryVisitWordShift<Int64BinopMatcher, 64>
 // Skip Word64Sar/Word32Sar since no instruction reduction in most cases.
-#define FLAGS_SET_SHIFT_LIST(V)                    \
-  V(kWord32Shl, TRY_VISIT_WORD32_SHIFT, kX64Shl32) \
-  V(kWord32Shr, TRY_VISIT_WORD32_SHIFT, kX64Shr32) \
-  V(kWord64Shl, TRY_VISIT_WORD64_SHIFT, kX64Shl)   \
-  V(kWord64Shr, TRY_VISIT_WORD64_SHIFT, kX64Shr)
-#define FLAGS_SET_SHIFT(opcode, TryVisit, archOpcode)         \
-  case IrOpcode::opcode:                                      \
-    if (selector->IsOnlyUserOfNodeInSameBlock(user, node)) {  \
-      if (TryVisit(selector, node, archOpcode, cont)) return; \
-    }                                                         \
+#define FLAGS_SET_SHIFT_LIST(V) \
+  V(kWord32Shl, 32, kX64Shl32)  \
+  V(kWord32Shr, 32, kX64Shr32)  \
+  V(kWord64Shl, 64, kX64Shl)    \
+  V(kWord64Shr, 64, kX64Shr)
+#define FLAGS_SET_SHIFT(opcode, bits, archOpcode)                            \
+  case IrOpcode::opcode:                                                     \
+    if (selector->IsOnlyUserOfNodeInSameBlock(user, node)) {                 \
+      if (TryVisitWordShift(selector, node, bits, archOpcode, cont)) return; \
+    }                                                                        \
     break;
       FLAGS_SET_SHIFT_LIST(FLAGS_SET_SHIFT)
 #undef TRY_VISIT_WORD32_SHIFT
@@ -2696,30 +3866,34 @@ void VisitCompareZero(InstructionSelector* selector, Node* user, Node* node,
 }
 
 // Shared routine for multiple float32 compare operations (inputs commuted).
-void VisitFloat32Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Node* const left = node->InputAt(0);
-  Node* const right = node->InputAt(1);
+template <typename Adapter>
+void VisitFloat32Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
   InstructionCode const opcode =
       selector->IsSupported(AVX) ? kAVXFloat32Cmp : kSSEFloat32Cmp;
   VisitCompare(selector, opcode, right, left, cont, false);
 }
 
 // Shared routine for multiple float64 compare operations (inputs commuted).
-void VisitFloat64Compare(InstructionSelector* selector, Node* node,
-                         FlagsContinuation* cont) {
-  Node* const left = node->InputAt(0);
-  Node* const right = node->InputAt(1);
+template <typename Adapter>
+void VisitFloat64Compare(InstructionSelectorT<Adapter>* selector,
+                         typename Adapter::node_t node,
+                         FlagsContinuationT<Adapter>* cont) {
+  auto left = selector->input_at(node, 0);
+  auto right = selector->input_at(node, 1);
   InstructionCode const opcode =
       selector->IsSupported(AVX) ? kAVXFloat64Cmp : kSSEFloat64Cmp;
   VisitCompare(selector, opcode, right, left, cont, false);
 }
 
 // Shared routine for Word32/Word64 Atomic Binops
-void VisitAtomicBinop(InstructionSelector* selector, Node* node,
-                      ArchOpcode opcode, AtomicWidth width,
+void VisitAtomicBinop(InstructionSelectorT<TurbofanAdapter>* selector,
+                      Node* node, ArchOpcode opcode, AtomicWidth width,
                       MemoryAccessKind access_kind) {
-  X64OperandGenerator g(selector);
+  X64OperandGeneratorT<TurbofanAdapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -2739,10 +3913,11 @@ void VisitAtomicBinop(InstructionSelector* selector, Node* node,
 }
 
 // Shared routine for Word32/Word64 Atomic CmpExchg
-void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
-                                ArchOpcode opcode, AtomicWidth width,
+void VisitAtomicCompareExchange(InstructionSelectorT<TurbofanAdapter>* selector,
+                                Node* node, ArchOpcode opcode,
+                                AtomicWidth width,
                                 MemoryAccessKind access_kind) {
-  X64OperandGenerator g(selector);
+  X64OperandGeneratorT<TurbofanAdapter> g(selector);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* old_value = node->InputAt(2);
@@ -2764,8 +3939,181 @@ void VisitAtomicCompareExchange(InstructionSelector* selector, Node* node,
 }  // namespace
 
 // Shared routine for word comparison against zero.
-void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
-                                               FlagsContinuation* cont) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWordCompareZero(
+    node_t user, node_t value, FlagsContinuation* cont) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  const EqualOp* equal = this->TryCast<EqualOp>(value);
+  while (equal != nullptr && CanCover(user, value)) {
+    const ConstantOp* right_constant =
+        this->TryCast<ConstantOp>(equal->right());
+    if (right_constant == nullptr) break;
+    if (right_constant->kind != ConstantOp::Kind::kWord32) break;
+    if (right_constant->word32() != 0) break;
+
+    user = value;
+    value = equal->left();
+    cont->Negate();
+    equal = this->TryCast<EqualOp>(value);
+  }
+
+  if (CanCover(user, value)) {
+    const Operation& value_op = this->Get(value);
+    if (const EqualOp* equal = value_op.TryCast<EqualOp>()) {
+      switch (equal->rep.value()) {
+        case RegisterRepresentation::Word32():
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          return VisitWord32EqualImpl(this, value, cont);
+        case RegisterRepresentation::Word64(): {
+          cont->OverwriteAndNegateIfEqual(kEqual);
+          if (this->MatchIntegralZero(equal->right())) {
+            // Try to combine the branch with a comparison.
+            if (CanCover(value, equal->left())) {
+              const Operation& left_op = this->Get(equal->left());
+              if (left_op.Is<Opmask::kWord64Sub>()) {
+                return VisitWordCompare(this, equal->left(), kX64Cmp, cont);
+              } else if (left_op.Is<Opmask::kWord64BitwiseAnd>()) {
+                return VisitWordCompare(this, equal->left(), kX64Test, cont);
+              }
+            }
+            return VisitCompareZero(this, value, equal->left(), kX64Cmp, cont);
+          }
+          return VisitWord64EqualImpl(this, value, cont);
+        }
+        case RegisterRepresentation::Float32():
+          cont->OverwriteAndNegateIfEqual(kUnorderedEqual);
+          return VisitFloat32Compare(this, value, cont);
+
+        case RegisterRepresentation::Float64():
+          cont->OverwriteAndNegateIfEqual(kUnorderedEqual);
+          return VisitFloat64Compare(this, value, cont);
+        default:
+          break;
+      }
+    } else if (const ComparisonOp* comparison =
+                   value_op.TryCast<ComparisonOp>()) {
+      switch (comparison->rep.value()) {
+        case RegisterRepresentation::Word32(): {
+          switch (comparison->kind) {
+            case ComparisonOp::Kind::kSignedLessThan:
+              cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+              return VisitWordCompare(this, value, kX64Cmp32, cont);
+            case ComparisonOp::Kind::kSignedLessThanOrEqual:
+              cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+              return VisitWordCompare(this, value, kX64Cmp32, cont);
+            case ComparisonOp::Kind::kUnsignedLessThan:
+              cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+              return VisitWordCompare(this, value, kX64Cmp32, cont);
+            case ComparisonOp::Kind::kUnsignedLessThanOrEqual:
+              cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+              return VisitWordCompare(this, value, kX64Cmp32, cont);
+          }
+        }
+        case RegisterRepresentation::Word64(): {
+          switch (comparison->kind) {
+            case ComparisonOp::Kind::kSignedLessThan:
+              cont->OverwriteAndNegateIfEqual(kSignedLessThan);
+              return VisitWordCompare(this, value, kX64Cmp, cont);
+            case ComparisonOp::Kind::kSignedLessThanOrEqual:
+              cont->OverwriteAndNegateIfEqual(kSignedLessThanOrEqual);
+              return VisitWordCompare(this, value, kX64Cmp, cont);
+            case ComparisonOp::Kind::kUnsignedLessThan:
+              cont->OverwriteAndNegateIfEqual(kUnsignedLessThan);
+              return VisitWordCompare(this, value, kX64Cmp, cont);
+            case ComparisonOp::Kind::kUnsignedLessThanOrEqual:
+              cont->OverwriteAndNegateIfEqual(kUnsignedLessThanOrEqual);
+              return VisitWordCompare(this, value, kX64Cmp, cont);
+          }
+        }
+        case RegisterRepresentation::Float32():
+          if (comparison->kind == ComparisonOp::Kind::kSignedLessThan) {
+            cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan);
+            return VisitFloat32Compare(this, value, cont);
+          } else {
+            DCHECK_EQ(comparison->kind,
+                      ComparisonOp::Kind::kSignedLessThanOrEqual);
+            cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual);
+            return VisitFloat32Compare(this, value, cont);
+          }
+        case RegisterRepresentation::Float64():
+          if (comparison->kind == ComparisonOp::Kind::kSignedLessThan) {
+            if (MatchZero(comparison->left())) {
+              const Operation& right = this->Get(comparison->right());
+              if (right.Is<Opmask::kFloat64Abs>()) {
+                // This matches the pattern
+                //
+                //   Float64LessThan(#0.0, Float64Abs(x))
+                //
+                // which TurboFan generates for NumberToBoolean in the general
+                // case, and which evaluates to false if x is 0, -0 or NaN. We
+                // can compile this to a simple (v)ucomisd using not_equal flags
+                // condition, which avoids the costly Float64Abs.
+                cont->OverwriteAndNegateIfEqual(kNotEqual);
+                InstructionCode const opcode =
+                    IsSupported(AVX) ? kAVXFloat64Cmp : kSSEFloat64Cmp;
+                return VisitCompare(this, opcode, comparison->left(),
+                                    right.Cast<FloatUnaryOp>().input(), cont,
+                                    false);
+              }
+            }
+            cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThan);
+            return VisitFloat64Compare(this, value, cont);
+          } else {
+            DCHECK_EQ(comparison->kind,
+                      ComparisonOp::Kind::kSignedLessThanOrEqual);
+            cont->OverwriteAndNegateIfEqual(kUnsignedGreaterThanOrEqual);
+            return VisitFloat64Compare(this, value, cont);
+          }
+        default:
+          break;
+      }
+    } else if (value_op.Is<Opmask::kWord32Sub>()) {
+      return VisitWordCompare(this, value, kX64Cmp32, cont);
+    } else if (value_op.Is<Opmask::kWord32BitwiseAnd>()) {
+      return VisitWordCompare(this, value, kX64Test32, cont);
+    } else if (const ProjectionOp* projection =
+                   value_op.TryCast<ProjectionOp>()) {
+      // Check if this is the overflow output projection of an
+      // OverflowCheckedBinop operation.
+      if (projection->index == 1u) {
+        // We cannot combine the OverflowCheckedBinop operation with this branch
+        // unless the 0th projection (the use of the actual value of the
+        // operation is either {OpIndex::Invalid()}, which means there's no use
+        // of the actual value, or was already defined, which means it is
+        // scheduled *AFTER* this branch).
+        OpIndex node = projection->input();
+        OpIndex result = FindProjection(node, 0);
+        if (!result.valid() || IsDefined(result)) {
+          if (const OverflowCheckedBinopOp* binop =
+                  this->TryCast<OverflowCheckedBinopOp>(node)) {
+            const bool is64 = binop->rep == WordRepresentation::Word64();
+            cont->OverwriteAndNegateIfEqual(kOverflow);
+            switch (binop->kind) {
+              case OverflowCheckedBinopOp::Kind::kSignedAdd:
+                return VisitBinop(this, node, is64 ? kX64Add : kX64Add32, cont);
+              case OverflowCheckedBinopOp::Kind::kSignedSub:
+                return VisitBinop(this, node, is64 ? kX64Sub : kX64Sub32, cont);
+              case OverflowCheckedBinopOp::Kind::kSignedMul:
+                return VisitBinop(this, node, is64 ? kX64Imul : kX64Imul32,
+                                  cont);
+            }
+            UNREACHABLE();
+          }
+        }
+      }
+    } else if (value_op.Is<StackPointerGreaterThanOp>()) {
+      cont->OverwriteAndNegateIfEqual(kStackPointerGreaterThanCondition);
+      return VisitStackPointerGreaterThan(value, cont);
+    }
+  }
+
+  // Branch could not be combined with a compare, emit compare against 0.
+  VisitCompareZero(this, user, value, kX64Cmp32, cont);
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWordCompareZero(
+    Node* user, Node* value, FlagsContinuation* cont) {
   // Try to combine with comparisons against 0 by simply inverting the branch.
   while (value->opcode() == IrOpcode::kWord32Equal && CanCover(user, value)) {
     Int32BinopMatcher m(value);
@@ -2914,12 +4262,16 @@ void InstructionSelector::VisitWordCompareZero(Node* user, Node* value,
   VisitCompareZero(this, user, value, kX64Cmp32, cont);
 }
 
-void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
-  X64OperandGenerator g(this);
-  InstructionOperand value_operand = g.UseRegister(node->InputAt(0));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitSwitch(node_t node,
+                                                const SwitchInfo& sw) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
+  InstructionOperand value_operand = g.UseRegister(this->input_at(node, 0));
 
   // Emit either ArchTableSwitch or ArchBinarySearchSwitch.
-  if (enable_switch_jump_table_ == kEnableSwitchJumpTable) {
+  if (enable_switch_jump_table_ ==
+      InstructionSelector::kEnableSwitchJumpTable) {
     static const size_t kMaxTableSwitchValueRange = 2 << 16;
     size_t table_space_cost = 4 + sw.value_range();
     size_t table_time_cost = 3;
@@ -2938,7 +4290,7 @@ void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
              value_operand, g.TempImmediate(-sw.min_value()));
       } else {
         // Zero extend, because we use it as 64-bit index into the jump table.
-        if (ZeroExtendsWord32ToWord64(node->InputAt(0))) {
+        if (ZeroExtendsWord32ToWord64(this->input_at(node, 0))) {
           // Input value has already been zero-extended.
           index_operand = value_operand;
         } else {
@@ -2954,39 +4306,77 @@ void InstructionSelector::VisitSwitch(Node* node, const SwitchInfo& sw) {
   return EmitBinarySearchSwitch(sw, value_operand);
 }
 
-void InstructionSelector::VisitWord32Equal(Node* const node) {
-  Node* user = node;
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32Equal(node_t node) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+  const EqualOp& equal = this->Get(node).Cast<EqualOp>();
+  DCHECK(equal.rep == RegisterRepresentation::Word32() ||
+         equal.rep == RegisterRepresentation::Tagged());
+  if (MatchIntegralZero(equal.right())) {
+    return VisitWordCompareZero(node, equal.left(), &cont);
+  }
+  VisitWord32EqualImpl(this, node, &cont);
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
-  Int32BinopMatcher m(user);
+  Int32BinopMatcher m(node);
   if (m.right().Is(0)) {
     return VisitWordCompareZero(m.node(), m.left().node(), &cont);
   }
   VisitWord32EqualImpl(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWordCompare(this, node, kX64Cmp32, &cont);
 }
 
-void InstructionSelector::VisitInt32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWordCompare(this, node, kX64Cmp32, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWordCompare(this, node, kX64Cmp32, &cont);
 }
 
-void InstructionSelector::VisitUint32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWordCompare(this, node, kX64Cmp32, &cont);
 }
 
-void InstructionSelector::VisitWord64Equal(Node* node) {
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord64Equal(node_t node) {
+  using namespace turboshaft;  // NOLINT(build/namespaces)
+  FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
+  const EqualOp& equal = this->Get(node).Cast<EqualOp>();
+  DCHECK(equal.rep == RegisterRepresentation::Word64() ||
+         equal.rep == RegisterRepresentation::Tagged());
+  if (MatchIntegralZero(equal.right())) {
+    if (CanCover(node, equal.left())) {
+      const Operation& left_op = this->Get(equal.left());
+      if (left_op.Is<Opmask::kWord64Sub>()) {
+        return VisitWordCompare(this, equal.left(), kX64Cmp, &cont);
+      } else if (left_op.Is<Opmask::kWord64BitwiseAnd>()) {
+        return VisitWordCompare(this, equal.left(), kX64Test, &cont);
+      }
+    }
+  }
+  VisitWord64EqualImpl(this, node, &cont);
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kEqual, node);
   Int64BinopMatcher m(node);
   if (m.right().Is(0)) {
@@ -3007,8 +4397,10 @@ void InstructionSelector::VisitWord64Equal(Node* node) {
   VisitWord64EqualImpl(this, node, &cont);
 }
 
-void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AddWithOverflow(node_t node) {
+  node_t ovf = FindProjection(node, 1);
+  if (Adapter::valid(ovf)) {
     FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
     return VisitBinop(this, node, kX64Add32, &cont);
   }
@@ -3016,8 +4408,10 @@ void InstructionSelector::VisitInt32AddWithOverflow(Node* node) {
   VisitBinop(this, node, kX64Add32, &cont);
 }
 
-void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
-  if (Node* ovf = NodeProperties::FindProjection(node, 1)) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32SubWithOverflow(node_t node) {
+  node_t ovf = FindProjection(node, 1);
+  if (Adapter::valid(ovf)) {
     FlagsContinuation cont = FlagsContinuation::ForSet(kOverflow, ovf);
     return VisitBinop(this, node, kX64Sub32, &cont);
   }
@@ -3025,119 +4419,164 @@ void InstructionSelector::VisitInt32SubWithOverflow(Node* node) {
   VisitBinop(this, node, kX64Sub32, &cont);
 }
 
-void InstructionSelector::VisitInt64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kSignedLessThan, node);
   VisitWordCompare(this, node, kX64Cmp, &cont);
 }
 
-void InstructionSelector::VisitInt64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kSignedLessThanOrEqual, node);
   VisitWordCompare(this, node, kX64Cmp, &cont);
 }
 
-void InstructionSelector::VisitUint64LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThan(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnsignedLessThan, node);
   VisitWordCompare(this, node, kX64Cmp, &cont);
 }
 
-void InstructionSelector::VisitUint64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitUint64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedLessThanOrEqual, node);
   VisitWordCompare(this, node, kX64Cmp, &cont);
 }
 
-void InstructionSelector::VisitFloat32Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnorderedEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThan(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThan(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedGreaterThan, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat32LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat32LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedGreaterThanOrEqual, node);
   VisitFloat32Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64Equal(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64Equal(node_t node) {
   FlagsContinuation cont = FlagsContinuation::ForSet(kUnorderedEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThan(Node* node) {
-  Float64BinopMatcher m(node);
-  if (m.left().Is(0.0) && m.right().IsFloat64Abs()) {
-    // This matches the pattern
-    //
-    //   Float64LessThan(#0.0, Float64Abs(x))
-    //
-    // which TurboFan generates for NumberToBoolean in the general case,
-    // and which evaluates to false if x is 0, -0 or NaN. We can compile
-    // this to a simple (v)ucomisd using not_equal flags condition, which
-    // avoids the costly Float64Abs.
-    FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, node);
-    InstructionCode const opcode =
-        IsSupported(AVX) ? kAVXFloat64Cmp : kSSEFloat64Cmp;
-    return VisitCompare(this, opcode, m.left().node(), m.right().InputAt(0),
-                        &cont, false);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThan(node_t node) {
+  // Check for the pattern
+  //
+  //   Float64LessThan(#0.0, Float64Abs(x))
+  //
+  // which TurboFan generates for NumberToBoolean in the general case,
+  // and which evaluates to false if x is 0, -0 or NaN. We can compile
+  // this to a simple (v)ucomisd using not_equal flags condition, which
+  // avoids the costly Float64Abs.
+  if constexpr (Adapter::IsTurboshaft) {
+    using namespace turboshaft;  // NOLINT(build/namespaces)
+    const ComparisonOp& cmp = this->Get(node).template Cast<ComparisonOp>();
+    DCHECK_EQ(cmp.rep, RegisterRepresentation::Float64());
+    DCHECK_EQ(cmp.kind, ComparisonOp::Kind::kSignedLessThan);
+    if (this->MatchZero(cmp.left())) {
+      if (const FloatUnaryOp* right_op =
+              this->Get(cmp.right()).template TryCast<Opmask::kFloat64Abs>()) {
+        FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, node);
+        InstructionCode const opcode =
+            IsSupported(AVX) ? kAVXFloat64Cmp : kSSEFloat64Cmp;
+        return VisitCompare(this, opcode, cmp.left(), right_op->input(), &cont,
+                            false);
+      }
+    }
+  } else {
+    Float64BinopMatcher m(node);
+    if (m.left().Is(0.0) && m.right().IsFloat64Abs()) {
+      FlagsContinuation cont = FlagsContinuation::ForSet(kNotEqual, node);
+      InstructionCode const opcode =
+          IsSupported(AVX) ? kAVXFloat64Cmp : kSSEFloat64Cmp;
+      return VisitCompare(this, opcode, m.left().node(), m.right().InputAt(0),
+                          &cont, false);
+    }
   }
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedGreaterThan, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64LessThanOrEqual(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64LessThanOrEqual(node_t node) {
   FlagsContinuation cont =
       FlagsContinuation::ForSet(kUnsignedGreaterThanOrEqual, node);
   VisitFloat64Compare(this, node, &cont);
 }
 
-void InstructionSelector::VisitFloat64InsertLowWord32(Node* node) {
-  X64OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
-  Float64Matcher mleft(left);
-  if (mleft.HasResolvedValue() &&
-      (base::bit_cast<uint64_t>(mleft.ResolvedValue()) >> 32) == 0u) {
-    Emit(kSSEFloat64LoadLowWord32, g.DefineAsRegister(node), g.Use(right));
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertLowWord32(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 2);
+  node_t left = this->input_at(node, 0);
+  node_t right = this->input_at(node, 1);
+  if constexpr (Adapter::IsTurboshaft) {
+    // TODO(nicohartmann@): Might want to provide this optimization for
+    // turboshaft.
+  } else {
+    Float64Matcher mleft(left);
+    if (mleft.HasResolvedValue() &&
+        (base::bit_cast<uint64_t>(mleft.ResolvedValue()) >> 32) == 0u) {
+      Emit(kSSEFloat64LoadLowWord32, g.DefineAsRegister(node), g.Use(right));
+      return;
+    }
   }
   Emit(kSSEFloat64InsertLowWord32, g.DefineSameAsFirst(node),
        g.UseRegister(left), g.Use(right));
 }
 
-void InstructionSelector::VisitFloat64InsertHighWord32(Node* node) {
-  X64OperandGenerator g(this);
-  Node* left = node->InputAt(0);
-  Node* right = node->InputAt(1);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64InsertHighWord32(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 2);
+  node_t left = this->input_at(node, 0);
+  node_t right = this->input_at(node, 1);
   Emit(kSSEFloat64InsertHighWord32, g.DefineSameAsFirst(node),
        g.UseRegister(left), g.Use(right));
 }
 
-void InstructionSelector::VisitFloat64SilenceNaN(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitFloat64SilenceNaN(node_t node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK_EQ(this->value_input_count(node), 1);
   Emit(kSSEFloat64SilenceNaN, g.DefineSameAsFirst(node),
-       g.UseRegister(node->InputAt(0)));
+       g.UseRegister(this->input_at(node, 0)));
 }
 
-void InstructionSelector::VisitMemoryBarrier(Node* node) {
-  // x64 is no weaker than release-acquire and only needs to emit an instruction
-  // for SeqCst memory barriers.
-  AtomicMemoryOrder order = OpParameter<AtomicMemoryOrder>(node->op());
-  if (order == AtomicMemoryOrder::kSeqCst) {
-    X64OperandGenerator g(this);
-    Emit(kX64MFence, g.NoOutput());
-    return;
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitMemoryBarrier(node_t node) {
+  if constexpr (Adapter::IsTurboshaft) {
+    // Currently not used by Turboshaft.
+    UNIMPLEMENTED();
+  } else {
+    // x64 is no weaker than release-acquire and only needs to emit an
+    // instruction for SeqCst memory barriers.
+    AtomicMemoryOrder order = OpParameter<AtomicMemoryOrder>(node->op());
+    if (order == AtomicMemoryOrder::kSeqCst) {
+      X64OperandGeneratorT<Adapter> g(this);
+      Emit(kX64MFence, g.NoOutput());
+      return;
+    }
+    DCHECK_EQ(AtomicMemoryOrder::kAcqRel, order);
   }
-  DCHECK_EQ(AtomicMemoryOrder::kAcqRel, order);
 }
 
-void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicLoad(Node* node) {
   AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
   LoadRepresentation load_rep = atomic_load_params.representation();
   DCHECK(IsIntegral(load_rep.representation()) ||
@@ -3152,7 +4591,8 @@ void InstructionSelector::VisitWord32AtomicLoad(Node* node) {
   VisitLoad(node, node, GetLoadOpcode(load_rep));
 }
 
-void InstructionSelector::VisitWord64AtomicLoad(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicLoad(Node* node) {
   AtomicLoadParameters atomic_load_params = AtomicLoadParametersOf(node->op());
   DCHECK(!atomic_load_params.representation().IsMapWord());
   // The memory order is ignored as both acquire and sequentially consistent
@@ -3161,24 +4601,28 @@ void InstructionSelector::VisitWord64AtomicLoad(Node* node) {
   VisitLoad(node, node, GetLoadOpcode(atomic_load_params.representation()));
 }
 
-void InstructionSelector::VisitWord32AtomicStore(Node* node) {
-  AtomicStoreParameters params = AtomicStoreParametersOf(node->op());
-  DCHECK_NE(params.representation(), MachineRepresentation::kWord64);
-  DCHECK_IMPLIES(CanBeTaggedOrCompressedPointer(params.representation()),
-                 kTaggedSize == 4);
-  VisitStoreCommon(this, node, params.store_representation(), params.order(),
-                   params.kind());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicStore(node_t node) {
+  auto store = this->store_view(node);
+  DCHECK_NE(store.stored_rep().representation(),
+            MachineRepresentation::kWord64);
+  DCHECK_IMPLIES(
+      CanBeTaggedOrCompressedPointer(store.stored_rep().representation()),
+      kTaggedSize == 4);
+  VisitStoreCommon(this, store);
 }
 
-void InstructionSelector::VisitWord64AtomicStore(Node* node) {
-  AtomicStoreParameters params = AtomicStoreParametersOf(node->op());
-  DCHECK_IMPLIES(CanBeTaggedOrCompressedPointer(params.representation()),
-                 kTaggedSize == 8);
-  VisitStoreCommon(this, node, params.store_representation(), params.order(),
-                   params.kind());
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicStore(node_t node) {
+  auto store = this->store_view(node);
+  DCHECK_IMPLIES(
+      CanBeTaggedOrCompressedPointer(store.stored_rep().representation()),
+      kTaggedSize == 8);
+  VisitStoreCommon(this, store);
 }
 
-void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord32AtomicExchange(Node* node) {
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
   ArchOpcode opcode;
   if (params.type() == MachineType::Int8()) {
@@ -3198,7 +4642,8 @@ void InstructionSelector::VisitWord32AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord32, params.kind());
 }
 
-void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitWord64AtomicExchange(Node* node) {
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
   ArchOpcode opcode;
   if (params.type() == MachineType::Uint8()) {
@@ -3215,7 +4660,9 @@ void InstructionSelector::VisitWord64AtomicExchange(Node* node) {
   VisitAtomicExchange(this, node, opcode, AtomicWidth::kWord64, params.kind());
 }
 
-void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32AtomicCompareExchange(
+    Node* node) {
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
   ArchOpcode opcode;
   if (params.type() == MachineType::Int8()) {
@@ -3236,7 +4683,9 @@ void InstructionSelector::VisitWord32AtomicCompareExchange(Node* node) {
                              params.kind());
 }
 
-void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64AtomicCompareExchange(
+    Node* node) {
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
   ArchOpcode opcode;
   if (params.type() == MachineType::Uint8()) {
@@ -3254,7 +4703,15 @@ void InstructionSelector::VisitWord64AtomicCompareExchange(Node* node) {
                              params.kind());
 }
 
-void InstructionSelector::VisitWord32AtomicBinaryOperation(
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord32AtomicBinaryOperation(
+    turboshaft::OpIndex node, ArchOpcode int8_op, ArchOpcode uint8_op,
+    ArchOpcode int16_op, ArchOpcode uint16_op, ArchOpcode word32_op) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord32AtomicBinaryOperation(
     Node* node, ArchOpcode int8_op, ArchOpcode uint8_op, ArchOpcode int16_op,
     ArchOpcode uint16_op, ArchOpcode word32_op) {
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
@@ -3276,11 +4733,12 @@ void InstructionSelector::VisitWord32AtomicBinaryOperation(
   VisitAtomicBinop(this, node, opcode, AtomicWidth::kWord32, params.kind());
 }
 
-#define VISIT_ATOMIC_BINOP(op)                                           \
-  void InstructionSelector::VisitWord32Atomic##op(Node* node) {          \
-    VisitWord32AtomicBinaryOperation(                                    \
-        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16, \
-        kAtomic##op##Uint16, kAtomic##op##Word32);                       \
+#define VISIT_ATOMIC_BINOP(op)                                            \
+  template <typename Adapter>                                             \
+  void InstructionSelectorT<Adapter>::VisitWord32Atomic##op(Node* node) { \
+    VisitWord32AtomicBinaryOperation(                                     \
+        node, kAtomic##op##Int8, kAtomic##op##Uint8, kAtomic##op##Int16,  \
+        kAtomic##op##Uint16, kAtomic##op##Word32);                        \
   }
 VISIT_ATOMIC_BINOP(Add)
 VISIT_ATOMIC_BINOP(Sub)
@@ -3289,7 +4747,15 @@ VISIT_ATOMIC_BINOP(Or)
 VISIT_ATOMIC_BINOP(Xor)
 #undef VISIT_ATOMIC_BINOP
 
-void InstructionSelector::VisitWord64AtomicBinaryOperation(
+template <>
+void InstructionSelectorT<TurboshaftAdapter>::VisitWord64AtomicBinaryOperation(
+    node_t node, ArchOpcode uint8_op, ArchOpcode uint16_op,
+    ArchOpcode uint32_op, ArchOpcode word64_op) {
+  UNIMPLEMENTED();
+}
+
+template <>
+void InstructionSelectorT<TurbofanAdapter>::VisitWord64AtomicBinaryOperation(
     Node* node, ArchOpcode uint8_op, ArchOpcode uint16_op, ArchOpcode uint32_op,
     ArchOpcode word64_op) {
   AtomicOpParameters params = AtomicOpParametersOf(node->op());
@@ -3309,7 +4775,8 @@ void InstructionSelector::VisitWord64AtomicBinaryOperation(
 }
 
 #define VISIT_ATOMIC_BINOP(op)                                                 \
-  void InstructionSelector::VisitWord64Atomic##op(Node* node) {                \
+  template <typename Adapter>                                                  \
+  void InstructionSelectorT<Adapter>::VisitWord64Atomic##op(Node* node) {      \
     VisitWord64AtomicBinaryOperation(node, kAtomic##op##Uint8,                 \
                                      kAtomic##op##Uint16, kAtomic##op##Word32, \
                                      kX64Word64Atomic##op##Uint64);            \
@@ -3327,17 +4794,13 @@ VISIT_ATOMIC_BINOP(Xor)
   V(I64x2ExtMulLowI32x4U)          \
   V(I64x2ExtMulHighI32x4U)         \
   V(I32x4DotI16x8S)                \
+  V(I32x8DotI16x16S)               \
   V(I32x4ExtMulLowI16x8S)          \
   V(I32x4ExtMulHighI16x8S)         \
   V(I32x4ExtMulLowI16x8U)          \
   V(I32x4ExtMulHighI16x8U)         \
   V(I16x8SConvertI32x4)            \
   V(I16x8UConvertI32x4)            \
-  V(I16x8AddSatS)                  \
-  V(I16x8SubSatS)                  \
-  V(I16x8AddSatU)                  \
-  V(I16x8SubSatU)                  \
-  V(I16x8RoundingAverageU)         \
   V(I16x8ExtMulLowI8x16S)          \
   V(I16x8ExtMulHighI8x16S)         \
   V(I16x8ExtMulLowI8x16U)          \
@@ -3346,100 +4809,197 @@ VISIT_ATOMIC_BINOP(Xor)
   V(I16x8RelaxedQ15MulRS)          \
   V(I8x16SConvertI16x8)            \
   V(I8x16UConvertI16x8)            \
-  V(I8x16AddSatS)                  \
-  V(I8x16SubSatS)                  \
-  V(I8x16AddSatU)                  \
-  V(I8x16SubSatU)                  \
-  V(I8x16RoundingAverageU)         \
-  V(S128And)                       \
-  V(S128Or)                        \
-  V(S128Xor)
-
-#define SIMD_BINOP_SSE_AVX_LANE_SIZE_VECTOR_LENGTH_LIST(V) \
-  V(F64x2Add, FAdd, kL64, kV128)                           \
-  V(F32x4Add, FAdd, kL32, kV128)                           \
-  V(F32x8Add, FAdd, kL32, kV256)                           \
-  V(I64x2Add, IAdd, kL64, kV128)                           \
-  V(I32x4Add, IAdd, kL32, kV128)                           \
-  V(I16x8Add, IAdd, kL16, kV128)                           \
-  V(I8x16Add, IAdd, kL8, kV128)                            \
-  V(F64x2Sub, FSub, kL64, kV128)                           \
-  V(F32x4Sub, FSub, kL32, kV128)                           \
-  V(F32x8Sub, FSub, kL32, kV256)                           \
-  V(I64x2Sub, ISub, kL64, kV128)                           \
-  V(I32x4Sub, ISub, kL32, kV128)                           \
-  V(I16x8Sub, ISub, kL16, kV128)                           \
-  V(I8x16Sub, ISub, kL8, kV128)                            \
-  V(F64x2Mul, FMul, kL64, kV128)                           \
-  V(F32x4Mul, FMul, kL32, kV128)                           \
-  V(I32x4Mul, IMul, kL32, kV128)                           \
-  V(I16x8Mul, IMul, kL16, kV128)                           \
-  V(F64x2Div, FDiv, kL64, kV128)                           \
-  V(F32x4Div, FDiv, kL32, kV128)                           \
-  V(F64x2Eq, FEq, kL64, kV128)                             \
-  V(F32x4Eq, FEq, kL32, kV128)                             \
-  V(I64x2Eq, IEq, kL64, kV128)                             \
-  V(I32x4Eq, IEq, kL32, kV128)                             \
-  V(I16x8Eq, IEq, kL16, kV128)                             \
-  V(I8x16Eq, IEq, kL8, kV128)                              \
-  V(F64x2Ne, FNe, kL64, kV128)                             \
-  V(F32x4Ne, FNe, kL32, kV128)                             \
-  V(I32x4GtS, IGtS, kL32, kV128)                           \
-  V(I16x8GtS, IGtS, kL16, kV128)                           \
-  V(I8x16GtS, IGtS, kL8, kV128)                            \
-  V(F64x2Lt, FLt, kL64, kV128)                             \
-  V(F32x4Lt, FLt, kL32, kV128)                             \
-  V(F64x2Le, FLe, kL64, kV128)                             \
-  V(F32x4Le, FLe, kL32, kV128)                             \
-  V(I32x4MinS, IMinS, kL32, kV128)                         \
-  V(I16x8MinS, IMinS, kL16, kV128)                         \
-  V(I8x16MinS, IMinS, kL8, kV128)                          \
-  V(I32x4MinU, IMinU, kL32, kV128)                         \
-  V(I16x8MinU, IMinU, kL16, kV128)                         \
-  V(I8x16MinU, IMinU, kL8, kV128)                          \
-  V(I32x4MaxS, IMaxS, kL32, kV128)                         \
-  V(I16x8MaxS, IMaxS, kL16, kV128)                         \
-  V(I8x16MaxS, IMaxS, kL8, kV128)                          \
-  V(I32x4MaxU, IMaxU, kL32, kV128)                         \
-  V(I16x8MaxU, IMaxU, kL16, kV128)                         \
-  V(I8x16MaxU, IMaxU, kL8, kV128)
+  V(I16x16SConvertI32x8)           \
+  V(I16x16UConvertI32x8)           \
+  V(I8x32SConvertI16x16)           \
+  V(I8x32UConvertI16x16)           \
+  V(I64x4ExtMulI32x4S)             \
+  V(I64x4ExtMulI32x4U)             \
+  V(I32x8ExtMulI16x8S)             \
+  V(I32x8ExtMulI16x8U)             \
+  V(I16x16ExtMulI8x16S)            \
+  V(I16x16ExtMulI8x16U)
+
+#define SIMD_BINOP_SSE_AVX_LANE_SIZE_VECTOR_LENGTH_LIST(V)  \
+  V(F64x2Add, FAdd, kL64, kV128)                            \
+  V(F64x4Add, FAdd, kL64, kV256)                            \
+  V(F32x4Add, FAdd, kL32, kV128)                            \
+  V(F32x8Add, FAdd, kL32, kV256)                            \
+  V(I64x2Add, IAdd, kL64, kV128)                            \
+  V(I64x4Add, IAdd, kL64, kV256)                            \
+  V(I32x8Add, IAdd, kL32, kV256)                            \
+  V(I16x16Add, IAdd, kL16, kV256)                           \
+  V(I8x32Add, IAdd, kL8, kV256)                             \
+  V(I32x4Add, IAdd, kL32, kV128)                            \
+  V(I16x8Add, IAdd, kL16, kV128)                            \
+  V(I8x16Add, IAdd, kL8, kV128)                             \
+  V(F64x4Sub, FSub, kL64, kV256)                            \
+  V(F64x2Sub, FSub, kL64, kV128)                            \
+  V(F32x4Sub, FSub, kL32, kV128)                            \
+  V(F32x8Sub, FSub, kL32, kV256)                            \
+  V(I64x2Sub, ISub, kL64, kV128)                            \
+  V(I64x4Sub, ISub, kL64, kV256)                            \
+  V(I32x8Sub, ISub, kL32, kV256)                            \
+  V(I16x16Sub, ISub, kL16, kV256)                           \
+  V(I8x32Sub, ISub, kL8, kV256)                             \
+  V(I32x4Sub, ISub, kL32, kV128)                            \
+  V(I16x8Sub, ISub, kL16, kV128)                            \
+  V(I8x16Sub, ISub, kL8, kV128)                             \
+  V(F64x2Mul, FMul, kL64, kV128)                            \
+  V(F32x4Mul, FMul, kL32, kV128)                            \
+  V(F64x4Mul, FMul, kL64, kV256)                            \
+  V(F32x8Mul, FMul, kL32, kV256)                            \
+  V(I32x8Mul, IMul, kL32, kV256)                            \
+  V(I16x16Mul, IMul, kL16, kV256)                           \
+  V(I32x4Mul, IMul, kL32, kV128)                            \
+  V(I16x8Mul, IMul, kL16, kV128)                            \
+  V(F64x2Div, FDiv, kL64, kV128)                            \
+  V(F32x4Div, FDiv, kL32, kV128)                            \
+  V(F64x4Div, FDiv, kL64, kV256)                            \
+  V(F32x8Div, FDiv, kL32, kV256)                            \
+  V(I16x8AddSatS, IAddSatS, kL16, kV128)                    \
+  V(I16x16AddSatS, IAddSatS, kL16, kV256)                   \
+  V(I8x16AddSatS, IAddSatS, kL8, kV128)                     \
+  V(I8x32AddSatS, IAddSatS, kL8, kV256)                     \
+  V(I16x8SubSatS, ISubSatS, kL16, kV128)                    \
+  V(I16x16SubSatS, ISubSatS, kL16, kV256)                   \
+  V(I8x16SubSatS, ISubSatS, kL8, kV128)                     \
+  V(I8x32SubSatS, ISubSatS, kL8, kV256)                     \
+  V(I16x8AddSatU, IAddSatU, kL16, kV128)                    \
+  V(I16x16AddSatU, IAddSatU, kL16, kV256)                   \
+  V(I8x16AddSatU, IAddSatU, kL8, kV128)                     \
+  V(I8x32AddSatU, IAddSatU, kL8, kV256)                     \
+  V(I16x8SubSatU, ISubSatU, kL16, kV128)                    \
+  V(I16x16SubSatU, ISubSatU, kL16, kV256)                   \
+  V(I8x16SubSatU, ISubSatU, kL8, kV128)                     \
+  V(I8x32SubSatU, ISubSatU, kL8, kV256)                     \
+  V(F64x2Eq, FEq, kL64, kV128)                              \
+  V(F32x4Eq, FEq, kL32, kV128)                              \
+  V(F32x8Eq, FEq, kL32, kV256)                              \
+  V(F64x4Eq, FEq, kL64, kV256)                              \
+  V(I8x32Eq, IEq, kL8, kV256)                               \
+  V(I16x16Eq, IEq, kL16, kV256)                             \
+  V(I32x8Eq, IEq, kL32, kV256)                              \
+  V(I64x4Eq, IEq, kL64, kV256)                              \
+  V(I64x2Eq, IEq, kL64, kV128)                              \
+  V(I32x4Eq, IEq, kL32, kV128)                              \
+  V(I16x8Eq, IEq, kL16, kV128)                              \
+  V(I8x16Eq, IEq, kL8, kV128)                               \
+  V(F64x2Ne, FNe, kL64, kV128)                              \
+  V(F32x4Ne, FNe, kL32, kV128)                              \
+  V(F32x8Ne, FNe, kL32, kV256)                              \
+  V(F64x4Ne, FNe, kL64, kV256)                              \
+  V(I32x4GtS, IGtS, kL32, kV128)                            \
+  V(I16x8GtS, IGtS, kL16, kV128)                            \
+  V(I8x16GtS, IGtS, kL8, kV128)                             \
+  V(I8x32GtS, IGtS, kL8, kV256)                             \
+  V(I16x16GtS, IGtS, kL16, kV256)                           \
+  V(I32x8GtS, IGtS, kL32, kV256)                            \
+  V(I64x4GtS, IGtS, kL64, kV256)                            \
+  V(F64x2Lt, FLt, kL64, kV128)                              \
+  V(F32x4Lt, FLt, kL32, kV128)                              \
+  V(F64x4Lt, FLt, kL64, kV256)                              \
+  V(F32x8Lt, FLt, kL32, kV256)                              \
+  V(F64x2Le, FLe, kL64, kV128)                              \
+  V(F32x4Le, FLe, kL32, kV128)                              \
+  V(F64x4Le, FLe, kL64, kV256)                              \
+  V(F32x8Le, FLe, kL32, kV256)                              \
+  V(I32x4MinS, IMinS, kL32, kV128)                          \
+  V(I16x8MinS, IMinS, kL16, kV128)                          \
+  V(I8x16MinS, IMinS, kL8, kV128)                           \
+  V(I32x4MinU, IMinU, kL32, kV128)                          \
+  V(I16x8MinU, IMinU, kL16, kV128)                          \
+  V(I8x16MinU, IMinU, kL8, kV128)                           \
+  V(I32x4MaxS, IMaxS, kL32, kV128)                          \
+  V(I16x8MaxS, IMaxS, kL16, kV128)                          \
+  V(I8x16MaxS, IMaxS, kL8, kV128)                           \
+  V(I32x4MaxU, IMaxU, kL32, kV128)                          \
+  V(I16x8MaxU, IMaxU, kL16, kV128)                          \
+  V(I8x16MaxU, IMaxU, kL8, kV128)                           \
+  V(I32x8MinS, IMinS, kL32, kV256)                          \
+  V(I16x16MinS, IMinS, kL16, kV256)                         \
+  V(I8x32MinS, IMinS, kL8, kV256)                           \
+  V(I32x8MinU, IMinU, kL32, kV256)                          \
+  V(I16x16MinU, IMinU, kL16, kV256)                         \
+  V(I8x32MinU, IMinU, kL8, kV256)                           \
+  V(I32x8MaxS, IMaxS, kL32, kV256)                          \
+  V(I16x16MaxS, IMaxS, kL16, kV256)                         \
+  V(I8x32MaxS, IMaxS, kL8, kV256)                           \
+  V(I32x8MaxU, IMaxU, kL32, kV256)                          \
+  V(I16x16MaxU, IMaxU, kL16, kV256)                         \
+  V(I8x32MaxU, IMaxU, kL8, kV256)                           \
+  V(I16x8RoundingAverageU, IRoundingAverageU, kL16, kV128)  \
+  V(I16x16RoundingAverageU, IRoundingAverageU, kL16, kV256) \
+  V(I8x16RoundingAverageU, IRoundingAverageU, kL8, kV128)   \
+  V(I8x32RoundingAverageU, IRoundingAverageU, kL8, kV256)   \
+  V(S128And, SAnd, kL8, kV128)                              \
+  V(S256And, SAnd, kL8, kV256)                              \
+  V(S128Or, SOr, kL8, kV128)                                \
+  V(S256Or, SOr, kL8, kV256)                                \
+  V(S128Xor, SXor, kL8, kV128)                              \
+  V(S256Xor, SXor, kL8, kV256)
 
 #define SIMD_BINOP_LANE_SIZE_VECTOR_LENGTH_LIST(V) \
   V(F64x2Min, FMin, kL64, kV128)                   \
   V(F32x4Min, FMin, kL32, kV128)                   \
+  V(F64x4Min, FMin, kL64, kV256)                   \
+  V(F32x8Min, FMin, kL32, kV256)                   \
   V(F64x2Max, FMax, kL64, kV128)                   \
   V(F32x4Max, FMax, kL32, kV128)                   \
+  V(F64x4Max, FMax, kL64, kV256)                   \
+  V(F32x8Max, FMax, kL32, kV256)                   \
   V(I64x2Ne, INe, kL64, kV128)                     \
   V(I32x4Ne, INe, kL32, kV128)                     \
   V(I16x8Ne, INe, kL16, kV128)                     \
   V(I8x16Ne, INe, kL8, kV128)                      \
+  V(I64x4Ne, INe, kL64, kV256)                     \
+  V(I32x8Ne, INe, kL32, kV256)                     \
+  V(I16x16Ne, INe, kL16, kV256)                    \
+  V(I8x32Ne, INe, kL8, kV256)                      \
   V(I32x4GtU, IGtU, kL32, kV128)                   \
   V(I16x8GtU, IGtU, kL16, kV128)                   \
   V(I8x16GtU, IGtU, kL8, kV128)                    \
+  V(I32x8GtU, IGtU, kL32, kV256)                   \
+  V(I16x16GtU, IGtU, kL16, kV256)                  \
+  V(I8x32GtU, IGtU, kL8, kV256)                    \
   V(I32x4GeS, IGeS, kL32, kV128)                   \
   V(I16x8GeS, IGeS, kL16, kV128)                   \
   V(I8x16GeS, IGeS, kL8, kV128)                    \
+  V(I32x8GeS, IGeS, kL32, kV256)                   \
+  V(I16x16GeS, IGeS, kL16, kV256)                  \
+  V(I8x32GeS, IGeS, kL8, kV256)                    \
   V(I32x4GeU, IGeU, kL32, kV128)                   \
   V(I16x8GeU, IGeU, kL16, kV128)                   \
-  V(I8x16GeU, IGeU, kL8, kV128)
+  V(I8x16GeU, IGeU, kL8, kV128)                    \
+  V(I32x8GeU, IGeU, kL32, kV256)                   \
+  V(I16x16GeU, IGeU, kL16, kV256)                  \
+  V(I8x32GeU, IGeU, kL8, kV256)
 
 #define SIMD_UNOP_LIST(V)   \
   V(F64x2ConvertLowI32x4S)  \
+  V(F64x4ConvertI32x4S)     \
   V(F32x4SConvertI32x4)     \
+  V(F32x8SConvertI32x8)     \
   V(F32x4DemoteF64x2Zero)   \
+  V(F32x4DemoteF64x4)       \
   V(I64x2SConvertI32x4Low)  \
   V(I64x2SConvertI32x4High) \
+  V(I64x4SConvertI32x4)     \
   V(I64x2UConvertI32x4Low)  \
   V(I64x2UConvertI32x4High) \
+  V(I64x4UConvertI32x4)     \
   V(I32x4SConvertI16x8Low)  \
   V(I32x4SConvertI16x8High) \
+  V(I32x8SConvertI16x8)     \
   V(I32x4UConvertI16x8Low)  \
   V(I32x4UConvertI16x8High) \
+  V(I32x8UConvertI16x8)     \
   V(I16x8SConvertI8x16Low)  \
   V(I16x8SConvertI8x16High) \
+  V(I16x16SConvertI8x16)    \
   V(I16x8UConvertI8x16Low)  \
   V(I16x8UConvertI8x16High) \
-  V(S128Not)
+  V(I16x16UConvertI8x16)
 
 #define SIMD_UNOP_LANE_SIZE_VECTOR_LENGTH_LIST(V) \
   V(F32x4Abs, FAbs, kL32, kV128)                  \
@@ -3459,7 +5019,19 @@ VISIT_ATOMIC_BINOP(Xor)
   V(I64x2AllTrue, IAllTrue, kL64, kV128)          \
   V(I32x4AllTrue, IAllTrue, kL32, kV128)          \
   V(I16x8AllTrue, IAllTrue, kL16, kV128)          \
-  V(I8x16AllTrue, IAllTrue, kL8, kV128)
+  V(I8x16AllTrue, IAllTrue, kL8, kV128)           \
+  V(S128Not, SNot, kL8, kV128)                    \
+  V(F32x8Abs, FAbs, kL32, kV256)                  \
+  V(I32x8Abs, IAbs, kL32, kV256)                  \
+  V(I16x16Abs, IAbs, kL16, kV256)                 \
+  V(I8x32Abs, IAbs, kL8, kV256)                   \
+  V(F32x8Neg, FNeg, kL32, kV256)                  \
+  V(I32x8Neg, INeg, kL32, kV256)                  \
+  V(I16x16Neg, INeg, kL16, kV256)                 \
+  V(I8x32Neg, INeg, kL8, kV256)                   \
+  V(F64x4Sqrt, FSqrt, kL64, kV256)                \
+  V(F32x8Sqrt, FSqrt, kL32, kV256)                \
+  V(S256Not, SNot, kL8, kV256)
 
 #define SIMD_SHIFT_LANE_SIZE_VECTOR_LENGTH_OPCODES(V) \
   V(I64x2Shl, IShl, kL64, kV128)                      \
@@ -3469,15 +5041,24 @@ VISIT_ATOMIC_BINOP(Xor)
   V(I16x8ShrS, IShrS, kL16, kV128)                    \
   V(I64x2ShrU, IShrU, kL64, kV128)                    \
   V(I32x4ShrU, IShrU, kL32, kV128)                    \
-  V(I16x8ShrU, IShrU, kL16, kV128)
+  V(I16x8ShrU, IShrU, kL16, kV128)                    \
+  V(I64x4Shl, IShl, kL64, kV256)                      \
+  V(I32x8Shl, IShl, kL32, kV256)                      \
+  V(I16x16Shl, IShl, kL16, kV256)                     \
+  V(I32x8ShrS, IShrS, kL32, kV256)                    \
+  V(I16x16ShrS, IShrS, kL16, kV256)                   \
+  V(I64x4ShrU, IShrU, kL64, kV256)                    \
+  V(I32x8ShrU, IShrU, kL32, kV256)                    \
+  V(I16x16ShrU, IShrU, kL16, kV256)
 
 #define SIMD_NARROW_SHIFT_LANE_SIZE_VECTOR_LENGTH_OPCODES(V) \
   V(I8x16Shl, IShl, kL8, kV128)                              \
   V(I8x16ShrS, IShrS, kL8, kV128)                            \
   V(I8x16ShrU, IShrU, kL8, kV128)
 
-void InstructionSelector::VisitS128Const(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Const(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   static const int kUint32Immediates = kSimd128Size / sizeof(uint32_t);
   uint32_t val[kUint32Immediates];
   memcpy(val, S128ImmediateParameterOf(node->op()).data(), kSimd128Size);
@@ -3487,34 +5068,70 @@ void InstructionSelector::VisitS128Const(Node* node) {
                   val[2] == UINT32_MAX && val[3] == UINT32_MAX;
   InstructionOperand dst = g.DefineAsRegister(node);
   if (all_zeros) {
-    Emit(kX64S128Zero, dst);
+    Emit(kX64SZero | VectorLengthField::encode(kV128), dst);
   } else if (all_ones) {
-    Emit(kX64S128AllOnes, dst);
+    Emit(kX64SAllOnes | VectorLengthField::encode(kV128), dst);
   } else {
     Emit(kX64S128Const, dst, g.UseImmediate(val[0]), g.UseImmediate(val[1]),
          g.UseImmediate(val[2]), g.UseImmediate(val[3]));
   }
 }
 
-void InstructionSelector::VisitS128Zero(Node* node) {
-  X64OperandGenerator g(this);
-  Emit(kX64S128Zero, g.DefineAsRegister(node));
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS256Const(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  static const int kUint32Immediates = kSimd256Size / sizeof(uint32_t);
+  uint32_t val[kUint32Immediates];
+  memcpy(val, S256ImmediateParameterOf(node->op()).data(), kSimd256Size);
+  // If all bytes are zeros or ones, avoid emitting code for generic constants
+  bool all_zeros = std::all_of(std::begin(val), std::end(val),
+                               [](uint32_t v) { return v == 0; });
+  bool all_ones = std::all_of(std::begin(val), std::end(val),
+                              [](uint32_t v) { return v == UINT32_MAX; });
+  InstructionOperand dst = g.DefineAsRegister(node);
+  if (all_zeros) {
+    Emit(kX64SZero | VectorLengthField::encode(kV256), dst);
+  } else if (all_ones) {
+    Emit(kX64SAllOnes | VectorLengthField::encode(kV256), dst);
+  } else {
+    Emit(kX64S256Const, dst, g.UseImmediate(val[0]), g.UseImmediate(val[1]),
+         g.UseImmediate(val[2]), g.UseImmediate(val[3]), g.UseImmediate(val[4]),
+         g.UseImmediate(val[5]), g.UseImmediate(val[6]),
+         g.UseImmediate(val[7]));
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Zero(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64SZero | VectorLengthField::encode(kV128), g.DefineAsRegister(node));
 }
 
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS256Zero(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64SZero | VectorLengthField::encode(kV256), g.DefineAsRegister(node));
+}
 // Name, LaneSize, VectorLength
 #define SIMD_INT_TYPES_FOR_SPLAT(V) \
   V(I64x2, kL64, kV128)             \
   V(I32x4, kL32, kV128)             \
   V(I16x8, kL16, kV128)             \
-  V(I8x16, kL8, kV128)
+  V(I8x16, kL8, kV128)              \
+  V(I64x4, kL64, kV256)             \
+  V(I32x8, kL32, kV256)             \
+  V(I16x16, kL16, kV256)            \
+  V(I8x32, kL8, kV256)
 
 // Splat with an optimization for const 0.
 #define VISIT_INT_SIMD_SPLAT(Type, LaneSize, VectorLength)                   \
-  void InstructionSelector::Visit##Type##Splat(Node* node) {                 \
-    X64OperandGenerator g(this);                                             \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Type##Splat(Node* node) {       \
+    X64OperandGeneratorT<Adapter> g(this);                                   \
     Node* input = node->InputAt(0);                                          \
     if (g.CanBeImmediate(input) && g.GetImmediateIntegerValue(input) == 0) { \
-      Emit(kX64S128Zero, g.DefineAsRegister(node));                          \
+      Emit(kX64SZero | VectorLengthField::encode(VectorLength),              \
+           g.DefineAsRegister(node));                                        \
     } else {                                                                 \
       Emit(kX64ISplat | LaneSizeField::encode(LaneSize) |                    \
                VectorLengthField::encode(VectorLength),                      \
@@ -3525,23 +5142,43 @@ SIMD_INT_TYPES_FOR_SPLAT(VISIT_INT_SIMD_SPLAT)
 #undef VISIT_INT_SIMD_SPLAT
 #undef SIMD_INT_TYPES_FOR_SPLAT
 
-void InstructionSelector::VisitF64x2Splat(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Splat(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   Emit(kX64FSplat | LaneSizeField::encode(kL64) |
            VectorLengthField::encode(kV128),
        g.DefineAsRegister(node), g.Use(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitF32x4Splat(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Splat(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   Emit(kX64FSplat | LaneSizeField::encode(kL32) |
            VectorLengthField::encode(kV128),
        g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
 }
 
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x4Splat(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64FSplat | LaneSizeField::encode(kL64) |
+           VectorLengthField::encode(kV256),
+       g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x8Splat(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64FSplat | LaneSizeField::encode(kL32) |
+           VectorLengthField::encode(kV256),
+       g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));
+}
+
 #define SIMD_VISIT_EXTRACT_LANE(IF, Type, Sign, LaneSize, VectorLength)  \
-  void InstructionSelector::Visit##Type##ExtractLane##Sign(Node* node) { \
-    X64OperandGenerator g(this);                                         \
+  template <typename Adapter>                                            \
+  void InstructionSelectorT<Adapter>::Visit##Type##ExtractLane##Sign(    \
+      Node* node) {                                                      \
+    X64OperandGeneratorT<Adapter> g(this);                               \
     int32_t lane = OpParameter<int32_t>(node->op());                     \
     Emit(kX64##IF##ExtractLane##Sign | LaneSizeField::encode(LaneSize) | \
              VectorLengthField::encode(VectorLength),                    \
@@ -3556,22 +5193,25 @@ SIMD_VISIT_EXTRACT_LANE(I, I16x8, S, kL16, kV128)
 SIMD_VISIT_EXTRACT_LANE(I, I8x16, S, kL8, kV128)
 #undef SIMD_VISIT_EXTRACT_LANE
 
-void InstructionSelector::VisitI16x8ExtractLaneU(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtractLaneU(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   int32_t lane = OpParameter<int32_t>(node->op());
   Emit(kX64Pextrw, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
        g.UseImmediate(lane));
 }
 
-void InstructionSelector::VisitI8x16ExtractLaneU(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16ExtractLaneU(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   int32_t lane = OpParameter<int32_t>(node->op());
   Emit(kX64Pextrb, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
        g.UseImmediate(lane));
 }
 
-void InstructionSelector::VisitF32x4ReplaceLane(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4ReplaceLane(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   int32_t lane = OpParameter<int32_t>(node->op());
   Emit(kX64FReplaceLane | LaneSizeField::encode(kL32) |
            VectorLengthField::encode(kV128),
@@ -3579,8 +5219,9 @@ void InstructionSelector::VisitF32x4ReplaceLane(Node* node) {
        g.UseImmediate(lane), g.Use(node->InputAt(1)));
 }
 
-void InstructionSelector::VisitF64x2ReplaceLane(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2ReplaceLane(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   int32_t lane = OpParameter<int32_t>(node->op());
   // When no-AVX, define dst == src to save a move.
   InstructionOperand dst =
@@ -3591,12 +5232,13 @@ void InstructionSelector::VisitF64x2ReplaceLane(Node* node) {
        g.UseRegister(node->InputAt(1)));
 }
 
-#define VISIT_SIMD_REPLACE_LANE(TYPE, OPCODE)                               \
-  void InstructionSelector::Visit##TYPE##ReplaceLane(Node* node) {          \
-    X64OperandGenerator g(this);                                            \
-    int32_t lane = OpParameter<int32_t>(node->op());                        \
-    Emit(OPCODE, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)), \
-         g.UseImmediate(lane), g.Use(node->InputAt(1)));                    \
+#define VISIT_SIMD_REPLACE_LANE(TYPE, OPCODE)                                \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##TYPE##ReplaceLane(Node* node) { \
+    X64OperandGeneratorT<Adapter> g(this);                                   \
+    int32_t lane = OpParameter<int32_t>(node->op());                         \
+    Emit(OPCODE, g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),  \
+         g.UseImmediate(lane), g.Use(node->InputAt(1)));                     \
   }
 
 #define SIMD_TYPES_FOR_REPLACE_LANE(V) \
@@ -3611,8 +5253,9 @@ SIMD_TYPES_FOR_REPLACE_LANE(VISIT_SIMD_REPLACE_LANE)
 
 #define VISIT_SIMD_SHIFT_LANE_SIZE_VECTOR_LENGTH_OPCODES(                  \
     Name, Opcode, LaneSize, VectorLength)                                  \
-  void InstructionSelector::Visit##Name(Node* node) {                      \
-    X64OperandGenerator g(this);                                           \
+  template <typename Adapter>                                              \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {            \
+    X64OperandGeneratorT<Adapter> g(this);                                 \
     InstructionOperand dst = IsSupported(AVX) ? g.DefineAsRegister(node)   \
                                               : g.DefineSameAsFirst(node); \
     if (g.CanBeImmediate(node->InputAt(1))) {                              \
@@ -3635,8 +5278,9 @@ SIMD_SHIFT_LANE_SIZE_VECTOR_LENGTH_OPCODES(
 
 #define VISIT_SIMD_NARROW_SHIFT_LANE_SIZE_VECTOR_LENGTH_OPCODES(            \
     Name, Opcode, LaneSize, VectorLength)                                   \
-  void InstructionSelector::Visit##Name(Node* node) {                       \
-    X64OperandGenerator g(this);                                            \
+  template <typename Adapter>                                               \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {             \
+    X64OperandGeneratorT<Adapter> g(this);                                  \
     InstructionOperand output =                                             \
         IsSupported(AVX) ? g.UseRegister(node) : g.DefineSameAsFirst(node); \
     if (g.CanBeImmediate(node->InputAt(1))) {                               \
@@ -3657,11 +5301,12 @@ SIMD_NARROW_SHIFT_LANE_SIZE_VECTOR_LENGTH_OPCODES(
 #undef VISIT_SIMD_NARROW_SHIFT_LANE_SIZE_VECTOR_LENGTH_OPCODES
 #undef SIMD_NARROW_SHIFT_LANE_SIZE_VECTOR_LENGTH_OPCODES
 
-#define VISIT_SIMD_UNOP(Opcode)                         \
-  void InstructionSelector::Visit##Opcode(Node* node) { \
-    X64OperandGenerator g(this);                        \
-    Emit(kX64##Opcode, g.DefineAsRegister(node),        \
-         g.UseRegister(node->InputAt(0)));              \
+#define VISIT_SIMD_UNOP(Opcode)                                   \
+  template <typename Adapter>                                     \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) { \
+    X64OperandGeneratorT<Adapter> g(this);                        \
+    Emit(kX64##Opcode, g.DefineAsRegister(node),                  \
+         g.UseRegister(node->InputAt(0)));                        \
   }
 SIMD_UNOP_LIST(VISIT_SIMD_UNOP)
 #undef VISIT_SIMD_UNOP
@@ -3669,8 +5314,9 @@ SIMD_UNOP_LIST(VISIT_SIMD_UNOP)
 
 #define VISIT_SIMD_UNOP_LANE_SIZE_VECTOR_LENGTH(Name, Opcode, LaneSize, \
                                                 VectorLength)           \
-  void InstructionSelector::Visit##Name(Node* node) {                   \
-    X64OperandGenerator g(this);                                        \
+  template <typename Adapter>                                           \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {         \
+    X64OperandGeneratorT<Adapter> g(this);                              \
     Emit(kX64##Opcode | LaneSizeField::encode(LaneSize) |               \
              VectorLengthField::encode(VectorLength),                   \
          g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)));    \
@@ -3683,8 +5329,9 @@ SIMD_UNOP_LANE_SIZE_VECTOR_LENGTH_LIST(VISIT_SIMD_UNOP_LANE_SIZE_VECTOR_LENGTH)
 
 #define VISIT_SIMD_BINOP_LANE_SIZE_VECTOR_LENGTH(Name, Opcode, LaneSize, \
                                                  VectorLength)           \
-  void InstructionSelector::Visit##Name(Node* node) {                    \
-    X64OperandGenerator g(this);                                         \
+  template <typename Adapter>                                            \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {          \
+    X64OperandGeneratorT<Adapter> g(this);                               \
     Emit(kX64##Opcode | LaneSizeField::encode(LaneSize) |                \
              VectorLengthField::encode(VectorLength),                    \
          g.DefineSameAsFirst(node), g.UseRegister(node->InputAt(0)),     \
@@ -3698,8 +5345,9 @@ SIMD_BINOP_LANE_SIZE_VECTOR_LENGTH_LIST(
 #undef SIMD_BINOP_LANE_SIZE_VECTOR_LENGTH_LIST
 
 #define VISIT_SIMD_BINOP(Opcode)                                              \
-  void InstructionSelector::Visit##Opcode(Node* node) {                       \
-    X64OperandGenerator g(this);                                              \
+  template <typename Adapter>                                                 \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {             \
+    X64OperandGeneratorT<Adapter> g(this);                                    \
     if (IsSupported(AVX)) {                                                   \
       Emit(kX64##Opcode, g.DefineAsRegister(node),                            \
            g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1))); \
@@ -3715,8 +5363,9 @@ SIMD_BINOP_SSE_AVX_LIST(VISIT_SIMD_BINOP)
 
 #define VISIT_SIMD_BINOP_LANE_SIZE_VECTOR_LENGTH(Name, Opcode, LaneSize, \
                                                  VectorLength)           \
-  void InstructionSelector::Visit##Name(Node* node) {                    \
-    X64OperandGenerator g(this);                                         \
+  template <typename Adapter>                                            \
+  void InstructionSelectorT<Adapter>::Visit##Name(Node* node) {          \
+    X64OperandGeneratorT<Adapter> g(this);                               \
     if (IsSupported(AVX)) {                                              \
       Emit(kX64##Opcode | LaneSizeField::encode(LaneSize) |              \
                VectorLengthField::encode(VectorLength),                  \
@@ -3735,48 +5384,109 @@ SIMD_BINOP_SSE_AVX_LANE_SIZE_VECTOR_LENGTH_LIST(
 #undef VISIT_SIMD_BINOP_LANE_SIZE_VECTOR_LENGTH
 #undef SIMD_BINOP_SSE_AVX_LANE_SIZE_VECTOR_LENGTH_LIST
 
-void InstructionSelector::VisitV128AnyTrue(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitV128AnyTrue(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   Emit(kX64V128AnyTrue, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitS128Select(Node* node) {
-  X64OperandGenerator g(this);
+namespace {
+
+static bool IsV128ZeroConst(Node* node) {
+  if (node->opcode() == IrOpcode::kS128Zero) {
+    return true;
+  }
+  // If the node is a V128 const, check all the elements
+  auto m = V128ConstMatcher(node);
+  if (m.HasResolvedValue()) {
+    auto imms = m.ResolvedValue().immediate();
+    return std::all_of(imms.begin(), imms.end(), [](auto i) { return i == 0; });
+  }
+  return false;
+}
+
+}  // namespace
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128Select(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
-  Emit(kX64S128Select, dst, g.UseRegister(node->InputAt(0)),
-       g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2)));
+  if (IsV128ZeroConst(node->InputAt(2))) {
+    // select(cond, input1, 0) -> and(cond, input1)
+    Emit(kX64SAnd | VectorLengthField::encode(kV128), dst,
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
+  } else if (IsV128ZeroConst(node->InputAt(1))) {
+    // select(cond, 0, input2) -> and(not(cond), input2)
+    Emit(kX64SAndNot | VectorLengthField::encode(kV128), dst,
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(2)));
+  } else {
+    Emit(kX64SSelect | VectorLengthField::encode(kV128), dst,
+         g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
+         g.UseRegister(node->InputAt(2)));
+  }
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS256Select(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64SSelect | VectorLengthField::encode(kV256), g.DefineAsRegister(node),
+       g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)),
+       g.UseRegister(node->InputAt(2)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS128AndNot(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  // andnps a b does ~a & b, but we want a & !b, so flip the input.
+  Emit(kX64SAndNot | VectorLengthField::encode(kV128),
+       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node),
+       g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitS128AndNot(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitS256AndNot(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   // andnps a b does ~a & b, but we want a & !b, so flip the input.
-  Emit(kX64S128AndNot, g.DefineSameAsFirst(node),
+  Emit(kX64SAndNot | VectorLengthField::encode(kV256),
+       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node),
        g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitF64x2Abs(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Abs(Node* node) {
   VisitFloatUnop(this, node, node->InputAt(0),
                  kX64FAbs | LaneSizeField::encode(kL64) |
                      VectorLengthField::encode(kV128));
 }
 
-void InstructionSelector::VisitF64x2Neg(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Neg(Node* node) {
   VisitFloatUnop(this, node, node->InputAt(0),
                  kX64FNeg | LaneSizeField::encode(kL64) |
                      VectorLengthField::encode(kV128));
 }
 
-void InstructionSelector::VisitF32x4UConvertI32x4(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4UConvertI32x4(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   Emit(kX64F32x4UConvertI32x4, g.DefineSameAsFirst(node),
        g.UseRegister(node->InputAt(0)));
 }
 
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x8UConvertI32x8(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64F32x8UConvertI32x8, g.DefineSameAsFirst(node),
+       g.UseRegister(node->InputAt(0)));
+}
+
 #define VISIT_SIMD_QFMOP(Opcode)                                             \
-  void InstructionSelector::Visit##Opcode(Node* node) {                      \
-    X64OperandGenerator g(this);                                             \
+  template <typename Adapter>                                                \
+  void InstructionSelectorT<Adapter>::Visit##Opcode(Node* node) {            \
+    X64OperandGeneratorT<Adapter> g(this);                                   \
     Emit(kX64##Opcode, g.UseRegister(node), g.UseRegister(node->InputAt(0)), \
          g.UseRegister(node->InputAt(1)), g.UseRegister(node->InputAt(2)));  \
   }
@@ -3786,8 +5496,9 @@ VISIT_SIMD_QFMOP(F32x4Qfma)
 VISIT_SIMD_QFMOP(F32x4Qfms)
 #undef VISIT_SIMD_QFMOP
 
-void InstructionSelector::VisitI64x2Neg(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Neg(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   // If AVX unsupported, make sure dst != src to avoid a move.
   InstructionOperand operand0 = IsSupported(AVX)
                                     ? g.UseRegister(node->InputAt(0))
@@ -3797,8 +5508,9 @@ void InstructionSelector::VisitI64x2Neg(Node* node) {
       g.DefineAsRegister(node), operand0);
 }
 
-void InstructionSelector::VisitI64x2ShrS(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2ShrS(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
 
@@ -3816,8 +5528,9 @@ void InstructionSelector::VisitI64x2ShrS(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI64x2Mul(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Mul(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(
       kX64IMul | LaneSizeField::encode(kL64) | VectorLengthField::encode(kV128),
@@ -3825,26 +5538,49 @@ void InstructionSelector::VisitI64x2Mul(Node* node) {
       g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitI32x4SConvertF32x4(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x4Mul(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  InstructionOperand temps[] = {g.TempSimd256Register()};
+  Emit(
+      kX64IMul | LaneSizeField::encode(kL64) | VectorLengthField::encode(kV256),
+      g.DefineAsRegister(node), g.UseUniqueRegister(node->InputAt(0)),
+      g.UseUniqueRegister(node->InputAt(1)), arraysize(temps), temps);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4SConvertF32x4(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   Emit(kX64I32x4SConvertF32x4,
        IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node),
        g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI32x4UConvertF32x4(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4UConvertF32x4(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register(),
                                 g.TempSimd128Register()};
   Emit(kX64I32x4UConvertF32x4, g.DefineSameAsFirst(node),
        g.UseRegister(node->InputAt(0)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitInt32AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x8UConvertF32x8(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  InstructionOperand temps[] = {g.TempSimd256Register(),
+                                g.TempSimd256Register()};
+  Emit(kX64I32x8UConvertF32x8, g.DefineSameAsFirst(node),
+       g.UseRegister(node->InputAt(0)), arraysize(temps), temps);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt32AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
-void InstructionSelector::VisitInt64AbsWithOverflow(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitInt64AbsWithOverflow(node_t node) {
   UNREACHABLE();
 }
 
@@ -3987,19 +5723,6 @@ bool TryMatchShufps(const uint8_t* shuffle32x4) {
          shuffle32x4[3] > 3;
 }
 
-static bool IsV128ZeroConst(Node* node) {
-  if (node->opcode() == IrOpcode::kS128Zero) {
-    return true;
-  }
-  // If the node is a V128 const, check all the elements
-  auto m = V128ConstMatcher(node);
-  if (m.HasResolvedValue()) {
-    auto imms = m.ResolvedValue().immediate();
-    return std::all_of(imms.begin(), imms.end(), [](auto i) { return i == 0; });
-  }
-  return false;
-}
-
 static bool TryMatchOneInputIsZeros(Node* node, uint8_t* shuffle,
                                     bool* needs_swap) {
   *needs_swap = false;
@@ -4017,7 +5740,8 @@ static bool TryMatchOneInputIsZeros(Node* node, uint8_t* shuffle,
 
 }  // namespace
 
-void InstructionSelector::VisitI8x16Shuffle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
   uint8_t shuffle[kSimd128Size];
   bool is_swizzle;
   CanonicalizeShuffle(node, shuffle, &is_swizzle);
@@ -4029,7 +5753,7 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
   static const int kMaxTemps = 2;
   InstructionOperand temps[kMaxTemps];
 
-  X64OperandGenerator g(this);
+  X64OperandGeneratorT<Adapter> g(this);
   // Swizzles don't generally need DefineSameAsFirst to avoid a move.
   bool no_same_as_first = is_swizzle;
   // We generally need UseRegister for input0, Use for input1.
@@ -4208,12 +5932,63 @@ void InstructionSelector::VisitI8x16Shuffle(Node* node) {
   }
   Emit(opcode, 1, &dst, input_count, inputs, temp_count, temps);
 }
+
+// The I32x8Swizzle is concated from 2 I32x4Swizzle, the first 4 lanes and the
+// last 4 lanes should be swizzled independently with the same order.
+bool TryMatchVpshufd(const uint8_t* shuffle32x8, uint8_t& control) {
+  control = 0;
+  for (int i = 0; i < 4; ++i) {
+    uint8_t mask;
+    if (shuffle32x8[i] < 4 && shuffle32x8[i + 4] - shuffle32x8[i] == 4) {
+      mask = shuffle32x8[i];
+      control |= mask << (2 * i);
+      continue;
+    }
+    return false;
+  }
+  return true;
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x32Shuffle(Node* node) {
+  uint8_t shuffle[kSimd256Size];
+  bool is_swizzle;
+  CanonicalizeShuffle<kSimd256Size>(node, shuffle, &is_swizzle);
+
+  X64OperandGeneratorT<Adapter> g(this);
+
+  if (uint8_t shuffle32x8[8];
+      wasm::SimdShuffle::TryMatch32x8Shuffle(shuffle, shuffle32x8)) {
+    if (is_swizzle) {
+      Node* input0 = node->InputAt(0);
+      InstructionOperand dst = g.DefineAsRegister(node);
+      InstructionOperand src = g.UseUniqueRegister(input0);
+      uint8_t control;
+      if (TryMatchVpshufd(shuffle32x8, control)) {
+        InstructionOperand imm = g.UseImmediate(control);
+        InstructionOperand inputs[] = {src, imm};
+        Emit(kX64Vpshufd, 1, &dst, 2, inputs);
+        return;
+      }
+    }
+  }
+
+  UNIMPLEMENTED();
+}
 #else
-void InstructionSelector::VisitI8x16Shuffle(Node* node) { UNREACHABLE(); }
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Shuffle(Node* node) {
+  UNREACHABLE();
+}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x32Shuffle(Node* node) {
+  UNREACHABLE();
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 #if V8_ENABLE_WEBASSEMBLY
-void InstructionSelector::VisitI8x16Swizzle(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
   InstructionCode op = kX64I8x16Swizzle;
 
   bool relaxed = OpParameter<bool>(node->op());
@@ -4230,16 +6005,17 @@ void InstructionSelector::VisitI8x16Swizzle(Node* node) {
     }
   }
 
-  X64OperandGenerator g(this);
+  X64OperandGeneratorT<Adapter> g(this);
   Emit(op,
        IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node),
        g.UseRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
 }
 
 namespace {
-void VisitRelaxedLaneSelect(InstructionSelector* selector, Node* node,
+template <typename Adapter>
+void VisitRelaxedLaneSelect(InstructionSelectorT<Adapter>* selector, Node* node,
                             InstructionCode code = kX64Pblendvb) {
-  X64OperandGenerator g(selector);
+  X64OperandGeneratorT<Adapter> g(selector);
   // pblendvb/blendvps/blendvpd copies src2 when mask is set, opposite from Wasm
   // semantics. Node's inputs are: mask, lhs, rhs (determined in
   // wasm-compiler.cc).
@@ -4257,40 +6033,52 @@ void VisitRelaxedLaneSelect(InstructionSelector* selector, Node* node,
 }
 }  // namespace
 
-void InstructionSelector::VisitI8x16RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16RelaxedLaneSelect(Node* node) {
   VisitRelaxedLaneSelect(this, node);
 }
-void InstructionSelector::VisitI16x8RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8RelaxedLaneSelect(Node* node) {
   VisitRelaxedLaneSelect(this, node);
 }
-void InstructionSelector::VisitI32x4RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedLaneSelect(Node* node) {
   VisitRelaxedLaneSelect(this, node, kX64Blendvps);
 }
 
-void InstructionSelector::VisitI64x2RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2RelaxedLaneSelect(Node* node) {
   VisitRelaxedLaneSelect(this, node, kX64Blendvpd);
 }
 #else
-void InstructionSelector::VisitI8x16Swizzle(Node* node) { UNREACHABLE(); }
-void InstructionSelector::VisitI8x16RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Swizzle(Node* node) {
   UNREACHABLE();
 }
-void InstructionSelector::VisitI16x8RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16RelaxedLaneSelect(Node* node) {
   UNREACHABLE();
 }
-void InstructionSelector::VisitI32x4RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8RelaxedLaneSelect(Node* node) {
   UNREACHABLE();
 }
-void InstructionSelector::VisitI64x2RelaxedLaneSelect(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedLaneSelect(Node* node) {
+  UNREACHABLE();
+}
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2RelaxedLaneSelect(Node* node) {
   UNREACHABLE();
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 namespace {
 // Used for pmin/pmax and relaxed min/max.
-void VisitMinOrMax(InstructionSelector* selector, Node* node, ArchOpcode opcode,
-                   bool flip_inputs) {
-  X64OperandGenerator g(selector);
+template <typename Adapter>
+void VisitMinOrMax(InstructionSelectorT<Adapter>* selector, Node* node,
+                   ArchOpcode opcode, bool flip_inputs) {
+  X64OperandGeneratorT<Adapter> g(selector);
   InstructionOperand dst = selector->IsSupported(AVX)
                                ? g.DefineAsRegister(node)
                                : g.DefineSameAsFirst(node);
@@ -4306,85 +6094,152 @@ void VisitMinOrMax(InstructionSelector* selector, Node* node, ArchOpcode opcode,
 }
 }  // namespace
 
-void InstructionSelector::VisitF32x4Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmin(Node* node) {
   VisitMinOrMax(this, node, kX64Minps, true);
 }
 
-void InstructionSelector::VisitF32x4Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4Pmax(Node* node) {
   VisitMinOrMax(this, node, kX64Maxps, true);
 }
 
-void InstructionSelector::VisitF64x2Pmin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmin(Node* node) {
   VisitMinOrMax(this, node, kX64Minpd, true);
 }
 
-void InstructionSelector::VisitF64x2Pmax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2Pmax(Node* node) {
   VisitMinOrMax(this, node, kX64Maxpd, true);
 }
 
-void InstructionSelector::VisitF32x4RelaxedMin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x8Pmin(Node* node) {
+  VisitMinOrMax(this, node, kX64F32x8Pmin, true);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x8Pmax(Node* node) {
+  VisitMinOrMax(this, node, kX64F32x8Pmax, true);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x4Pmin(Node* node) {
+  VisitMinOrMax(this, node, kX64F64x4Pmin, true);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x4Pmax(Node* node) {
+  VisitMinOrMax(this, node, kX64F64x4Pmax, true);
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4RelaxedMin(Node* node) {
   VisitMinOrMax(this, node, kX64Minps, false);
 }
 
-void InstructionSelector::VisitF32x4RelaxedMax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF32x4RelaxedMax(Node* node) {
   VisitMinOrMax(this, node, kX64Maxps, false);
 }
 
-void InstructionSelector::VisitF64x2RelaxedMin(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2RelaxedMin(Node* node) {
   VisitMinOrMax(this, node, kX64Minpd, false);
 }
 
-void InstructionSelector::VisitF64x2RelaxedMax(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2RelaxedMax(Node* node) {
   VisitMinOrMax(this, node, kX64Maxpd, false);
 }
 
-void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtAddPairwiseI16x8S(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst = CpuFeatures::IsSupported(AVX)
                                ? g.DefineAsRegister(node)
                                : g.DefineSameAsFirst(node);
   Emit(kX64I32x4ExtAddPairwiseI16x8S, dst, g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x8ExtAddPairwiseI16x16S(
+    Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64I32x8ExtAddPairwiseI16x16S, g.DefineAsRegister(node),
+       g.UseRegister(node->InputAt(0)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4ExtAddPairwiseI16x8U(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst = CpuFeatures::IsSupported(AVX)
                                ? g.DefineAsRegister(node)
                                : g.DefineSameAsFirst(node);
   Emit(kX64I32x4ExtAddPairwiseI16x8U, dst, g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x8ExtAddPairwiseI16x16U(
+    Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64I32x8ExtAddPairwiseI16x16U, g.DefineAsRegister(node),
+       g.UseRegister(node->InputAt(0)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtAddPairwiseI8x16S(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   // Codegen depends on dst != src.
   Emit(kX64I16x8ExtAddPairwiseI8x16S, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x16ExtAddPairwiseI8x32S(
+    Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64I16x16ExtAddPairwiseI8x32S, g.DefineAsRegister(node),
+       g.UseUniqueRegister(node->InputAt(0)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8ExtAddPairwiseI8x16U(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst = CpuFeatures::IsSupported(AVX)
                                ? g.DefineAsRegister(node)
                                : g.DefineSameAsFirst(node);
   Emit(kX64I16x8ExtAddPairwiseI8x16U, dst, g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI8x16Popcnt(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x16ExtAddPairwiseI8x32U(
+    Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  Emit(kX64I16x16ExtAddPairwiseI8x32U, g.DefineAsRegister(node),
+       g.UseUniqueRegister(node->InputAt(0)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI8x16Popcnt(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kX64I8x16Popcnt, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)), arraysize(temps), temps);
 }
 
-void InstructionSelector::VisitF64x2ConvertLowI32x4U(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2ConvertLowI32x4U(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst =
       IsSupported(AVX) ? g.DefineAsRegister(node) : g.DefineSameAsFirst(node);
   Emit(kX64F64x2ConvertLowI32x4U, dst, g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI32x4TruncSatF64x2SZero(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4TruncSatF64x2SZero(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   if (CpuFeatures::IsSupported(AVX)) {
     // Requires dst != src.
     Emit(kX64I32x4TruncSatF64x2SZero, g.DefineAsRegister(node),
@@ -4395,32 +6250,40 @@ void InstructionSelector::VisitI32x4TruncSatF64x2SZero(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI32x4TruncSatF64x2UZero(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4TruncSatF64x2UZero(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand dst = CpuFeatures::IsSupported(AVX)
                                ? g.DefineAsRegister(node)
                                : g.DefineSameAsFirst(node);
   Emit(kX64I32x4TruncSatF64x2UZero, dst, g.UseRegister(node->InputAt(0)));
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF64x2SZero(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF64x2SZero(
+    Node* node) {
   VisitFloatUnop(this, node, node->InputAt(0), kX64Cvttpd2dq);
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF64x2UZero(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF64x2UZero(
+    Node* node) {
   VisitFloatUnop(this, node, node->InputAt(0), kX64I32x4TruncF64x2UZero);
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF32x4S(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF32x4S(Node* node) {
   VisitFloatUnop(this, node, node->InputAt(0), kX64Cvttps2dq);
 }
 
-void InstructionSelector::VisitI32x4RelaxedTruncF32x4U(Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4RelaxedTruncF32x4U(Node* node) {
   VisitFloatUnop(this, node, node->InputAt(0), kX64I32x4TruncF32x4U);
 }
 
-void InstructionSelector::VisitI64x2GtS(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2GtS(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   if (CpuFeatures::IsSupported(AVX)) {
     Emit(kX64IGtS | LaneSizeField::encode(kL64) |
              VectorLengthField::encode(kV128),
@@ -4439,8 +6302,9 @@ void InstructionSelector::VisitI64x2GtS(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI64x2GeS(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2GeS(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   if (CpuFeatures::IsSupported(AVX)) {
     Emit(kX64IGeS | LaneSizeField::encode(kL64) |
              VectorLengthField::encode(kV128),
@@ -4459,8 +6323,19 @@ void InstructionSelector::VisitI64x2GeS(Node* node) {
   }
 }
 
-void InstructionSelector::VisitI64x2Abs(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x4GeS(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
+  DCHECK(CpuFeatures::IsSupported(AVX2));
+  Emit(
+      kX64IGeS | LaneSizeField::encode(kL64) | VectorLengthField::encode(kV256),
+      g.DefineAsRegister(node), g.UseRegister(node->InputAt(0)),
+      g.UseRegister(node->InputAt(1)));
+}
+
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI64x2Abs(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   if (CpuFeatures::IsSupported(AVX)) {
     Emit(kX64IAbs | LaneSizeField::encode(kL64) |
              VectorLengthField::encode(kV128),
@@ -4472,8 +6347,9 @@ void InstructionSelector::VisitI64x2Abs(Node* node) {
   }
 }
 
-void InstructionSelector::VisitF64x2PromoteLowF32x4(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitF64x2PromoteLowF32x4(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionCode code = kX64F64x2PromoteLowF32x4;
   Node* input = node->InputAt(0);
   LoadTransformMatcher m(input);
@@ -4492,14 +6368,16 @@ void InstructionSelector::VisitF64x2PromoteLowF32x4(Node* node) {
   VisitRR(this, node, code);
 }
 
-void InstructionSelector::VisitI16x8DotI8x16I7x16S(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI16x8DotI8x16I7x16S(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   Emit(kX64I16x8DotI8x16I7x16S, g.DefineAsRegister(node),
        g.UseUniqueRegister(node->InputAt(0)), g.UseRegister(node->InputAt(1)));
 }
 
-void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
-  X64OperandGenerator g(this);
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::VisitI32x4DotI8x16I7x16AddS(Node* node) {
+  X64OperandGeneratorT<Adapter> g(this);
   InstructionOperand temps[] = {g.TempSimd128Register()};
   Emit(kX64I32x4DotI8x16I7x16AddS, g.DefineSameAsInput(node, 2),
        g.UseUniqueRegister(node->InputAt(0)),
@@ -4507,9 +6385,9 @@ void InstructionSelector::VisitI32x4DotI8x16I7x16AddS(Node* node) {
        g.UseUniqueRegister(node->InputAt(2)), arraysize(temps), temps);
 }
 
-void InstructionSelector::AddOutputToSelectContinuation(OperandGenerator* g,
-                                                        int first_input_index,
-                                                        Node* node) {
+template <typename Adapter>
+void InstructionSelectorT<Adapter>::AddOutputToSelectContinuation(
+    OperandGenerator* g, int first_input_index, node_t node) {
   continuation_outputs_.push_back(
       g->DefineSameAsInput(node, first_input_index));
 }
@@ -4547,6 +6425,11 @@ InstructionSelector::AlignmentRequirements() {
       FullUnalignedAccessSupport();
 }
 
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurbofanAdapter>;
+template class EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
+    InstructionSelectorT<TurboshaftAdapter>;
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/basic-block-instrumentor.cc b/deps/v8/src/compiler/basic-block-instrumentor.cc
index 448bed84c96e88..b6f3195fd23436 100644
--- a/deps/v8/src/compiler/basic-block-instrumentor.cc
+++ b/deps/v8/src/compiler/basic-block-instrumentor.cc
@@ -156,6 +156,62 @@ BasicBlockProfilerData* BasicBlockInstrumentor::Instrument(
   return data;
 }
 
+namespace {
+
+void StoreBuiltinCallForNode(Node* n, Builtin builtin, int block_id,
+                             BuiltinsCallGraph* bcc_profiler) {
+  if (n == nullptr) return;
+  IrOpcode::Value op = n->opcode();
+  if (op == IrOpcode::kCall || op == IrOpcode::kTailCall) {
+    const CallDescriptor* des = CallDescriptorOf(n->op());
+    if (des->kind() == CallDescriptor::kCallCodeObject) {
+      Node* callee = n->InputAt(0);
+      Operator* op = const_cast<Operator*>(callee->op());
+      if (op->opcode() == IrOpcode::kHeapConstant) {
+        Handle<HeapObject> para = OpParameter<Handle<HeapObject>>(op);
+        if (IsCode(*para)) {
+          Handle<Code> code = Handle<Code>::cast(para);
+          if (code->is_builtin()) {
+            bcc_profiler->AddBuiltinCall(builtin, code->builtin_id(), block_id);
+            return;
+          }
+        }
+      }
+    }
+  }
+  return;
+}
+
+}  // namespace
+
+void BasicBlockCallGraphProfiler::StoreCallGraph(OptimizedCompilationInfo* info,
+                                                 Schedule* schedule) {
+  CHECK(Builtins::IsBuiltinId(info->builtin()));
+  BasicBlockVector* blocks = schedule->rpo_order();
+  size_t block_number = 0;
+  size_t n_blocks = schedule->RpoBlockCount();
+  for (BasicBlockVector::iterator it = blocks->begin(); block_number < n_blocks;
+       ++it, ++block_number) {
+    BasicBlock* block = (*it);
+    if (block == schedule->end()) continue;
+    // Iteration is already in reverse post-order.
+    DCHECK_EQ(block->rpo_number(), block_number);
+    int block_id = block->id().ToInt();
+
+    BuiltinsCallGraph* profiler = BuiltinsCallGraph::Get();
+
+    for (Node* node : *block) {
+      StoreBuiltinCallForNode(node, info->builtin(), block_id, profiler);
+    }
+
+    BasicBlock::Control control = block->control();
+    if (control != BasicBlock::kNone) {
+      Node* cnt_node = block->control_input();
+      StoreBuiltinCallForNode(cnt_node, info->builtin(), block_id, profiler);
+    }
+  }
+}
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/basic-block-instrumentor.h b/deps/v8/src/compiler/basic-block-instrumentor.h
index e63a2cac5d9059..372dfb4256d1f9 100644
--- a/deps/v8/src/compiler/basic-block-instrumentor.h
+++ b/deps/v8/src/compiler/basic-block-instrumentor.h
@@ -25,6 +25,18 @@ class BasicBlockInstrumentor : public AllStatic {
                                             Isolate* isolate);
 };
 
+// A profiler which works when reorder_builtins flag was set as true, it will
+// store the call graph between builtins, the call graph will be used to reorder
+// builtins.
+class BasicBlockCallGraphProfiler : public AllStatic {
+ public:
+  // The method will iterate all the basic blocks and visit all the nodes inside
+  // the block, if there is a Call/TailCall node to another builtin, it will
+  // save a record line (like builtin A calls builtin B at block N).
+  static void StoreCallGraph(OptimizedCompilationInfo* info,
+                             Schedule* schedule);
+};
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/branch-elimination.cc b/deps/v8/src/compiler/branch-elimination.cc
index 7a8d91cf89a870..ecebf41d81a4ad 100644
--- a/deps/v8/src/compiler/branch-elimination.cc
+++ b/deps/v8/src/compiler/branch-elimination.cc
@@ -117,8 +117,7 @@ void BranchElimination::SimplifyBranchCondition(Node* branch) {
     bool condition_value = branch_condition.is_true;
 
     if (semantics == BranchSemantics::kJS) {
-      phi_inputs.emplace_back(condition_value ? jsgraph()->TrueConstant()
-                                              : jsgraph()->FalseConstant());
+      phi_inputs.emplace_back(jsgraph()->BooleanConstant(condition_value));
     } else {
       DCHECK_EQ(semantics, BranchSemantics::kMachine);
       phi_inputs.emplace_back(
@@ -181,7 +180,7 @@ bool BranchElimination::TryEliminateBranchWithPhiCondition(Node* branch,
   Node* predecessor0 = merge_inputs[0];
   Node* predecessor1 = merge_inputs[1];
   DCHECK_EQ(branch->op()->ControlOutputCount(), 2);
-  Node** projections = zone()->NewArray<Node*>(2);
+  Node** projections = zone()->AllocateArray<Node*>(2);
   NodeProperties::CollectControlProjections(branch, projections, 2);
   Node* branch_true = projections[0];
   Node* branch_false = projections[1];
@@ -279,8 +278,7 @@ Reduction BranchElimination::ReduceTrapConditional(Node* node) {
       // graph()->end().
       ReplaceWithValue(node, dead(), dead(), dead());
       Node* control = graph()->NewNode(common()->Throw(), node, node);
-      NodeProperties::MergeControlToEnd(graph(), common(), control);
-      Revisit(graph()->end());
+      MergeControlToEnd(graph(), common(), control);
       return Changed(node);
     } else {
       // This will not trap, remove it by relaxing effect/control.
@@ -322,9 +320,7 @@ Reduction BranchElimination::ReduceDeoptimizeConditional(Node* node) {
     } else {
       control = graph()->NewNode(common()->Deoptimize(p.reason(), p.feedback()),
                                  frame_state, effect, control);
-      // TODO(bmeurer): This should be on the AdvancedReducer somehow.
-      NodeProperties::MergeControlToEnd(graph(), common(), control);
-      Revisit(graph()->end());
+      MergeControlToEnd(graph(), common(), control);
     }
     return Replace(dead());
   }
diff --git a/deps/v8/src/compiler/bytecode-analysis.cc b/deps/v8/src/compiler/bytecode-analysis.cc
index f84692bf188a31..9848186238805e 100644
--- a/deps/v8/src/compiler/bytecode-analysis.cc
+++ b/deps/v8/src/compiler/bytecode-analysis.cc
@@ -106,48 +106,38 @@ template <Bytecode bytecode, OperandType operand_type, size_t i>
 void UpdateInLivenessForOutOperand(
     BytecodeLivenessState* in_liveness,
     const interpreter::BytecodeArrayIterator& iterator) {
-  switch (operand_type) {
-    case OperandType::kRegOut: {
-      Register r = iterator.GetRegisterOperand(i);
-      if (!r.is_parameter()) {
-        in_liveness->MarkRegisterDead(r.index());
-      }
-      break;
+  if constexpr (operand_type == OperandType::kRegOut) {
+    Register r = iterator.GetRegisterOperand(i);
+    if (!r.is_parameter()) {
+      in_liveness->MarkRegisterDead(r.index());
     }
-    case OperandType::kRegOutList: {
-      Register r = iterator.GetRegisterOperand(i);
-      uint32_t reg_count = iterator.GetRegisterCountOperand(i + 1);
-      if (!r.is_parameter()) {
-        for (uint32_t j = 0; j < reg_count; ++j) {
-          DCHECK(!Register(r.index() + j).is_parameter());
-          in_liveness->MarkRegisterDead(r.index() + j);
-        }
+  } else if constexpr (operand_type == OperandType::kRegOutList) {
+    Register r = iterator.GetRegisterOperand(i);
+    uint32_t reg_count = iterator.GetRegisterCountOperand(i + 1);
+    if (!r.is_parameter()) {
+      for (uint32_t j = 0; j < reg_count; ++j) {
+        DCHECK(!Register(r.index() + j).is_parameter());
+        in_liveness->MarkRegisterDead(r.index() + j);
       }
-      break;
     }
-    case OperandType::kRegOutPair: {
-      Register r = iterator.GetRegisterOperand(i);
-      if (!r.is_parameter()) {
-        DCHECK(!Register(r.index() + 1).is_parameter());
-        in_liveness->MarkRegisterDead(r.index());
-        in_liveness->MarkRegisterDead(r.index() + 1);
-      }
-      break;
+  } else if constexpr (operand_type == OperandType::kRegOutPair) {
+    Register r = iterator.GetRegisterOperand(i);
+    if (!r.is_parameter()) {
+      DCHECK(!Register(r.index() + 1).is_parameter());
+      in_liveness->MarkRegisterDead(r.index());
+      in_liveness->MarkRegisterDead(r.index() + 1);
     }
-    case OperandType::kRegOutTriple: {
-      Register r = iterator.GetRegisterOperand(i);
-      if (!r.is_parameter()) {
-        DCHECK(!Register(r.index() + 1).is_parameter());
-        DCHECK(!Register(r.index() + 2).is_parameter());
-        in_liveness->MarkRegisterDead(r.index());
-        in_liveness->MarkRegisterDead(r.index() + 1);
-        in_liveness->MarkRegisterDead(r.index() + 2);
-      }
-      break;
+  } else if constexpr (operand_type == OperandType::kRegOutTriple) {
+    Register r = iterator.GetRegisterOperand(i);
+    if (!r.is_parameter()) {
+      DCHECK(!Register(r.index() + 1).is_parameter());
+      DCHECK(!Register(r.index() + 2).is_parameter());
+      in_liveness->MarkRegisterDead(r.index());
+      in_liveness->MarkRegisterDead(r.index() + 1);
+      in_liveness->MarkRegisterDead(r.index() + 2);
     }
-    default:
-      DCHECK(!Bytecodes::IsRegisterOutputOperandType(operand_type));
-      break;
+  } else {
+    DCHECK(!Bytecodes::IsRegisterOutputOperandType(operand_type));
   }
 }
 
@@ -155,37 +145,29 @@ template <Bytecode bytecode, OperandType operand_type, size_t i>
 void UpdateInLivenessForInOperand(
     BytecodeLivenessState* in_liveness,
     const interpreter::BytecodeArrayIterator& iterator) {
-  switch (operand_type) {
-    case OperandType::kReg: {
-      Register r = iterator.GetRegisterOperand(i);
-      if (!r.is_parameter()) {
-        in_liveness->MarkRegisterLive(r.index());
-      }
-      break;
+  if constexpr (operand_type == OperandType::kReg) {
+    Register r = iterator.GetRegisterOperand(i);
+    if (!r.is_parameter()) {
+      in_liveness->MarkRegisterLive(r.index());
     }
-    case OperandType::kRegPair: {
-      Register r = iterator.GetRegisterOperand(i);
-      if (!r.is_parameter()) {
-        DCHECK(!Register(r.index() + 1).is_parameter());
-        in_liveness->MarkRegisterLive(r.index());
-        in_liveness->MarkRegisterLive(r.index() + 1);
-      }
-      break;
+  } else if constexpr (operand_type == OperandType::kRegPair) {
+    Register r = iterator.GetRegisterOperand(i);
+    if (!r.is_parameter()) {
+      DCHECK(!Register(r.index() + 1).is_parameter());
+      in_liveness->MarkRegisterLive(r.index());
+      in_liveness->MarkRegisterLive(r.index() + 1);
     }
-    case OperandType::kRegList: {
-      Register r = iterator.GetRegisterOperand(i);
-      uint32_t reg_count = iterator.GetRegisterCountOperand(i + 1);
-      if (!r.is_parameter()) {
-        for (uint32_t j = 0; j < reg_count; ++j) {
-          DCHECK(!interpreter::Register(r.index() + j).is_parameter());
-          in_liveness->MarkRegisterLive(r.index() + j);
-        }
+  } else if constexpr (operand_type == OperandType::kRegList) {
+    Register r = iterator.GetRegisterOperand(i);
+    uint32_t reg_count = iterator.GetRegisterCountOperand(i + 1);
+    if (!r.is_parameter()) {
+      for (uint32_t j = 0; j < reg_count; ++j) {
+        DCHECK(!interpreter::Register(r.index() + j).is_parameter());
+        in_liveness->MarkRegisterLive(r.index() + j);
       }
-      break;
     }
-    default:
-      DCHECK(!Bytecodes::IsRegisterInputOperandType(operand_type));
-      break;
+  } else {
+    DCHECK(!Bytecodes::IsRegisterInputOperandType(operand_type));
   }
 }
 
@@ -195,21 +177,21 @@ void UpdateInLiveness(BytecodeLivenessState* in_liveness,
                       const interpreter::BytecodeArrayIterator& iterator,
                       std::index_sequence<operand_index...>) {
   // Special case Suspend and Resume to just pass through liveness.
-  if (bytecode == Bytecode::kSuspendGenerator) {
+  if constexpr (bytecode == Bytecode::kSuspendGenerator) {
     // The generator object has to be live.
     in_liveness->MarkRegisterLive(iterator.GetRegisterOperand(0).index());
     // Suspend additionally reads and returns the accumulator
     DCHECK(Bytecodes::ReadsAccumulator(bytecode));
     in_liveness->MarkAccumulatorLive();
     return;
-  }
-  if (bytecode == Bytecode::kResumeGenerator) {
+  } else if constexpr (bytecode == Bytecode::kResumeGenerator) {
     // The generator object has to be live.
     in_liveness->MarkRegisterLive(iterator.GetRegisterOperand(0).index());
     return;
   }
 
-  if (BytecodeOperands::WritesAccumulator(implicit_register_use)) {
+  // Otherwise, walk all accumulator and register writes and reads.
+  if constexpr (BytecodeOperands::WritesAccumulator(implicit_register_use)) {
     in_liveness->MarkAccumulatorDead();
   }
   DCHECK_IMPLIES(BytecodeOperands::ClobbersAccumulator(implicit_register_use),
@@ -218,11 +200,12 @@ void UpdateInLiveness(BytecodeLivenessState* in_liveness,
        in_liveness, iterator),
    ...);
 
-  if (Bytecodes::WritesImplicitRegister(bytecode)) {
+  if constexpr (BytecodeOperands::WritesImplicitRegister(
+                    implicit_register_use)) {
     in_liveness->MarkRegisterDead(Register::FromShortStar(bytecode).index());
   }
 
-  if (BytecodeOperands::ReadsAccumulator(implicit_register_use)) {
+  if constexpr (BytecodeOperands::ReadsAccumulator(implicit_register_use)) {
     in_liveness->MarkAccumulatorLive();
   }
   (UpdateInLivenessForInOperand<bytecode, operand_types, operand_index>(
@@ -707,11 +690,15 @@ void BytecodeAnalysis::PushLoop(int loop_header, int loop_end) {
 
   end_to_header_.insert({loop_end, loop_header});
   auto it = header_to_info_.insert(
-      {loop_header, LoopInfo(parent_offset, bytecode_array_->parameter_count(),
+      {loop_header, LoopInfo(parent_offset, loop_header, loop_end,
+                             bytecode_array_->parameter_count(),
                              bytecode_array_->register_count(), zone_)});
   // Get the loop info pointer from the output of insert.
   LoopInfo* loop_info = &it.first->second;
 
+  if (loop_stack_.top().loop_info) {
+    loop_stack_.top().loop_info->mark_not_innermost();
+  }
   loop_stack_.push({loop_header, loop_info});
 }
 
@@ -752,6 +739,13 @@ int BytecodeAnalysis::GetLoopOffsetFor(int offset) const {
   return header_to_info_.upper_bound(offset)->second.parent_offset();
 }
 
+int BytecodeAnalysis::GetLoopEndOffsetForInnermost(int header_offset) const {
+  DCHECK(GetLoopInfoFor(header_offset).innermost());
+  auto loop_end_to_header = end_to_header_.upper_bound(header_offset + 1);
+  DCHECK_EQ(loop_end_to_header->second, header_offset);
+  return loop_end_to_header->first;
+}
+
 const LoopInfo& BytecodeAnalysis::GetLoopInfoFor(int header_offset) const {
   DCHECK(IsLoopHeader(header_offset));
 
diff --git a/deps/v8/src/compiler/bytecode-analysis.h b/deps/v8/src/compiler/bytecode-analysis.h
index ab7b66e03fc402..cc9496d4a972ed 100644
--- a/deps/v8/src/compiler/bytecode-analysis.h
+++ b/deps/v8/src/compiler/bytecode-analysis.h
@@ -66,15 +66,25 @@ class V8_EXPORT_PRIVATE ResumeJumpTarget {
 
 struct V8_EXPORT_PRIVATE LoopInfo {
  public:
-  LoopInfo(int parent_offset, int parameter_count, int register_count,
-           Zone* zone)
+  LoopInfo(int parent_offset, int loop_start, int loop_end, int parameter_count,
+           int register_count, Zone* zone)
       : parent_offset_(parent_offset),
+        loop_start_(loop_start),
+        loop_end_(loop_end),
         assignments_(parameter_count, register_count, zone),
         resume_jump_targets_(zone) {}
 
   int parent_offset() const { return parent_offset_; }
+  int loop_start() const { return loop_start_; }
+  int loop_end() const { return loop_end_; }
   bool resumable() const { return resumable_; }
   void mark_resumable() { resumable_ = true; }
+  bool innermost() const { return innermost_; }
+  void mark_not_innermost() { innermost_ = false; }
+
+  bool Contains(int offset) const {
+    return offset >= loop_start_ && offset < loop_end_;
+  }
 
   const ZoneVector<ResumeJumpTarget>& resume_jump_targets() const {
     return resume_jump_targets_;
@@ -89,7 +99,10 @@ struct V8_EXPORT_PRIVATE LoopInfo {
  private:
   // The offset to the parent loop, or -1 if there is no parent.
   int parent_offset_;
+  int loop_start_;
+  int loop_end_;
   bool resumable_ = false;
+  bool innermost_ = true;
   BytecodeLoopAssignments assignments_;
   ZoneVector<ResumeJumpTarget> resume_jump_targets_;
 };
@@ -110,6 +123,8 @@ class V8_EXPORT_PRIVATE BytecodeAnalysis : public ZoneObject {
   // Get the loop header offset of the containing loop for arbitrary
   // {offset}, or -1 if the {offset} is not inside any loop.
   int GetLoopOffsetFor(int offset) const;
+  // Get the loop end offset given the header offset of an innermost loop
+  int GetLoopEndOffsetForInnermost(int header_offset) const;
   // Get the loop info of the loop header at {header_offset}.
   const LoopInfo& GetLoopInfoFor(int header_offset) const;
   // Try to get the loop info of the loop header at {header_offset}, returning
diff --git a/deps/v8/src/compiler/bytecode-graph-builder.cc b/deps/v8/src/compiler/bytecode-graph-builder.cc
index d032d0a7d16a7b..8b41d727373718 100644
--- a/deps/v8/src/compiler/bytecode-graph-builder.cc
+++ b/deps/v8/src/compiler/bytecode-graph-builder.cc
@@ -34,17 +34,14 @@ namespace compiler {
 
 class BytecodeGraphBuilder {
  public:
-  BytecodeGraphBuilder(JSHeapBroker* broker, Zone* local_zone,
-                       NativeContextRef const& native_context,
-                       SharedFunctionInfoRef const& shared_info,
-                       FeedbackCellRef const& feedback_cell,
-                       BytecodeOffset osr_offset, JSGraph* jsgraph,
-                       CallFrequency const& invocation_frequency,
-                       SourcePositionTable* source_positions,
-                       NodeOriginTable* node_origins, int inlining_id,
-                       CodeKind code_kind, BytecodeGraphBuilderFlags flags,
-                       TickCounter* tick_counter,
-                       ObserveNodeInfo const& observe_node_info);
+  BytecodeGraphBuilder(
+      JSHeapBroker* broker, Zone* local_zone, NativeContextRef native_context,
+      SharedFunctionInfoRef shared_info, FeedbackCellRef feedback_cell,
+      BytecodeOffset osr_offset, JSGraph* jsgraph,
+      CallFrequency const& invocation_frequency,
+      SourcePositionTable* source_positions, NodeOriginTable* node_origins,
+      int inlining_id, CodeKind code_kind, BytecodeGraphBuilderFlags flags,
+      TickCounter* tick_counter, ObserveNodeInfo const& observe_node_info);
 
   BytecodeGraphBuilder(const BytecodeGraphBuilder&) = delete;
   BytecodeGraphBuilder& operator=(const BytecodeGraphBuilder&) = delete;
@@ -400,7 +397,7 @@ class BytecodeGraphBuilder {
   }
   Zone* local_zone() const { return local_zone_; }
   BytecodeArrayRef bytecode_array() const { return bytecode_array_; }
-  FeedbackVectorRef const& feedback_vector() const { return feedback_vector_; }
+  FeedbackVectorRef feedback_vector() const { return feedback_vector_; }
   const JSTypeHintLowering& type_hint_lowering() const {
     return type_hint_lowering_;
   }
@@ -1040,11 +1037,10 @@ public GraphDecorator {
 };
 
 BytecodeGraphBuilder::BytecodeGraphBuilder(
-    JSHeapBroker* broker, Zone* local_zone,
-    NativeContextRef const& native_context,
-    SharedFunctionInfoRef const& shared_info,
-    FeedbackCellRef const& feedback_cell, BytecodeOffset osr_offset,
-    JSGraph* jsgraph, CallFrequency const& invocation_frequency,
+    JSHeapBroker* broker, Zone* local_zone, NativeContextRef native_context,
+    SharedFunctionInfoRef shared_info, FeedbackCellRef feedback_cell,
+    BytecodeOffset osr_offset, JSGraph* jsgraph,
+    CallFrequency const& invocation_frequency,
     SourcePositionTable* source_positions, NodeOriginTable* node_origins,
     int inlining_id, CodeKind code_kind, BytecodeGraphBuilderFlags flags,
     TickCounter* tick_counter, ObserveNodeInfo const& observe_node_info)
@@ -2385,7 +2381,7 @@ Node* const* BytecodeGraphBuilder::GetCallArgumentsFromRegisters(
     Node* callee, Node* receiver, interpreter::Register first_arg,
     int arg_count) {
   const int arity = JSCallNode::ArityForArgc(arg_count);
-  Node** all = local_zone()->NewArray<Node*>(static_cast<size_t>(arity));
+  Node** all = local_zone()->AllocateArray<Node*>(static_cast<size_t>(arity));
   int cursor = 0;
 
   static_assert(JSCallNode::TargetIndex() == 0);
@@ -2621,7 +2617,7 @@ Node* BytecodeGraphBuilder::ProcessCallRuntimeArguments(
   int arg_count = static_cast<int>(reg_count);
   // arity is args.
   int arity = arg_count;
-  Node** all = local_zone()->NewArray<Node*>(static_cast<size_t>(arity));
+  Node** all = local_zone()->AllocateArray<Node*>(static_cast<size_t>(arity));
   int first_arg_index = receiver.index();
   for (int i = 0; i < static_cast<int>(reg_count); ++i) {
     all[i] = environment()->LookupRegister(
@@ -2678,7 +2674,7 @@ Node* const* BytecodeGraphBuilder::GetConstructArgumentsFromRegister(
     Node* target, Node* new_target, interpreter::Register first_arg,
     int arg_count) {
   const int arity = JSConstructNode::ArityForArgc(arg_count);
-  Node** all = local_zone()->NewArray<Node*>(static_cast<size_t>(arity));
+  Node** all = local_zone()->AllocateArray<Node*>(static_cast<size_t>(arity));
   int cursor = 0;
 
   static_assert(JSConstructNode::TargetIndex() == 0);
@@ -3412,7 +3408,9 @@ void BytecodeGraphBuilder::BuildCastOperator(const Operator* js_op) {
 }
 
 void BytecodeGraphBuilder::VisitToName() {
-  BuildCastOperator(javascript()->ToName());
+  Node* value =
+      NewNode(javascript()->ToName(), environment()->LookupAccumulator());
+  environment()->BindAccumulator(value, Environment::kAttachFrameState);
 }
 
 void BytecodeGraphBuilder::VisitToObject() {
@@ -3425,6 +3423,12 @@ void BytecodeGraphBuilder::VisitToString() {
   environment()->BindAccumulator(value, Environment::kAttachFrameState);
 }
 
+void BytecodeGraphBuilder::VisitToBoolean() {
+  Node* value =
+      NewNode(simplified()->ToBoolean(), environment()->LookupAccumulator());
+  environment()->BindAccumulator(value, Environment::kAttachFrameState);
+}
+
 void BytecodeGraphBuilder::VisitToNumber() {
   PrepareEagerCheckpoint();
   Node* object = environment()->LookupAccumulator();
@@ -3734,7 +3738,7 @@ void BytecodeGraphBuilder::VisitSuspendGenerator() {
   // register list.
   int value_input_count = 3 + parameter_count_without_receiver + register_count;
 
-  Node** value_inputs = local_zone()->NewArray<Node*>(value_input_count);
+  Node** value_inputs = local_zone()->AllocateArray<Node*>(value_input_count);
   value_inputs[0] = generator;
   value_inputs[1] = suspend_id;
   value_inputs[2] = offset;
@@ -4248,7 +4252,7 @@ void BytecodeGraphBuilder::ApplyEarlyReduction(
 Node** BytecodeGraphBuilder::EnsureInputBufferSize(int size) {
   if (size > input_buffer_size_) {
     size = size + kInputBufferSizeIncrement + input_buffer_size_;
-    input_buffer_ = local_zone()->NewArray<Node*>(size);
+    input_buffer_ = local_zone()->AllocateArray<Node*>(size);
     input_buffer_size_ = size;
   }
   return input_buffer_;
@@ -4460,16 +4464,13 @@ void BytecodeGraphBuilder::UpdateSourceAndBytecodePosition(int offset) {
   }
 }
 
-void BuildGraphFromBytecode(JSHeapBroker* broker, Zone* local_zone,
-                            SharedFunctionInfoRef const& shared_info,
-                            FeedbackCellRef const& feedback_cell,
-                            BytecodeOffset osr_offset, JSGraph* jsgraph,
-                            CallFrequency const& invocation_frequency,
-                            SourcePositionTable* source_positions,
-                            NodeOriginTable* node_origins, int inlining_id,
-                            CodeKind code_kind, BytecodeGraphBuilderFlags flags,
-                            TickCounter* tick_counter,
-                            ObserveNodeInfo const& observe_node_info) {
+void BuildGraphFromBytecode(
+    JSHeapBroker* broker, Zone* local_zone, SharedFunctionInfoRef shared_info,
+    FeedbackCellRef feedback_cell, BytecodeOffset osr_offset, JSGraph* jsgraph,
+    CallFrequency const& invocation_frequency,
+    SourcePositionTable* source_positions, NodeOriginTable* node_origins,
+    int inlining_id, CodeKind code_kind, BytecodeGraphBuilderFlags flags,
+    TickCounter* tick_counter, ObserveNodeInfo const& observe_node_info) {
   BytecodeGraphBuilder builder(
       broker, local_zone, broker->target_native_context(), shared_info,
       feedback_cell, osr_offset, jsgraph, invocation_frequency,
diff --git a/deps/v8/src/compiler/bytecode-graph-builder.h b/deps/v8/src/compiler/bytecode-graph-builder.h
index e3e06a882ba293..1b7ed4bf8896d9 100644
--- a/deps/v8/src/compiler/bytecode-graph-builder.h
+++ b/deps/v8/src/compiler/bytecode-graph-builder.h
@@ -40,16 +40,13 @@ using BytecodeGraphBuilderFlags = base::Flags<BytecodeGraphBuilderFlag>;
 
 // Note: {invocation_frequency} is taken by reference to work around a GCC bug
 // on AIX (v8:8193).
-void BuildGraphFromBytecode(JSHeapBroker* broker, Zone* local_zone,
-                            SharedFunctionInfoRef const& shared_info,
-                            FeedbackCellRef const& feedback_cell,
-                            BytecodeOffset osr_offset, JSGraph* jsgraph,
-                            CallFrequency const& invocation_frequency,
-                            SourcePositionTable* source_positions,
-                            NodeOriginTable* node_origins, int inlining_id,
-                            CodeKind code_kind, BytecodeGraphBuilderFlags flags,
-                            TickCounter* tick_counter,
-                            ObserveNodeInfo const& observe_node_info = {});
+void BuildGraphFromBytecode(
+    JSHeapBroker* broker, Zone* local_zone, SharedFunctionInfoRef shared_info,
+    FeedbackCellRef feedback_cell, BytecodeOffset osr_offset, JSGraph* jsgraph,
+    CallFrequency const& invocation_frequency,
+    SourcePositionTable* source_positions, NodeOriginTable* node_origins,
+    int inlining_id, CodeKind code_kind, BytecodeGraphBuilderFlags flags,
+    TickCounter* tick_counter, ObserveNodeInfo const& observe_node_info = {});
 
 }  // namespace compiler
 }  // namespace internal
diff --git a/deps/v8/src/compiler/bytecode-liveness-map.h b/deps/v8/src/compiler/bytecode-liveness-map.h
index fcc391a8f10b1a..9074ae7fb7a0bc 100644
--- a/deps/v8/src/compiler/bytecode-liveness-map.h
+++ b/deps/v8/src/compiler/bytecode-liveness-map.h
@@ -122,7 +122,7 @@ struct BytecodeLiveness {
 class V8_EXPORT_PRIVATE BytecodeLivenessMap {
  public:
   BytecodeLivenessMap(int bytecode_size, Zone* zone)
-      : liveness_(zone->NewArray<BytecodeLiveness>(bytecode_size))
+      : liveness_(zone->AllocateArray<BytecodeLiveness>(bytecode_size))
 #ifdef DEBUG
         ,
         size_(bytecode_size)
diff --git a/deps/v8/src/compiler/code-assembler.cc b/deps/v8/src/compiler/code-assembler.cc
index 88e87308d5fae0..ead1ec634df73a 100644
--- a/deps/v8/src/compiler/code-assembler.cc
+++ b/deps/v8/src/compiler/code-assembler.cc
@@ -238,10 +238,18 @@ TNode<Int32T> CodeAssembler::Int32Constant(int32_t value) {
   return UncheckedCast<Int32T>(jsgraph()->Int32Constant(value));
 }
 
+TNode<Int64T> CodeAssembler::UniqueInt64Constant(int64_t value) {
+  return UncheckedCast<Int64T>(jsgraph()->UniqueInt64Constant(value));
+}
+
 TNode<Int64T> CodeAssembler::Int64Constant(int64_t value) {
   return UncheckedCast<Int64T>(jsgraph()->Int64Constant(value));
 }
 
+TNode<IntPtrT> CodeAssembler::UniqueIntPtrConstant(intptr_t value) {
+  return UncheckedCast<IntPtrT>(jsgraph()->UniqueIntPtrConstant(value));
+}
+
 TNode<IntPtrT> CodeAssembler::IntPtrConstant(intptr_t value) {
   return UncheckedCast<IntPtrT>(jsgraph()->IntPtrConstant(value));
 }
@@ -265,7 +273,7 @@ TNode<Number> CodeAssembler::NumberConstant(double value) {
   }
 }
 
-TNode<Smi> CodeAssembler::SmiConstant(Smi value) {
+TNode<Smi> CodeAssembler::SmiConstant(Tagged<Smi> value) {
   return UncheckedCast<Smi>(BitcastWordToTaggedSigned(
       IntPtrConstant(static_cast<intptr_t>(value.ptr()))));
 }
@@ -285,9 +293,9 @@ TNode<String> CodeAssembler::StringConstant(const char* str) {
   return UncheckedCast<String>(HeapConstant(internalized_string));
 }
 
-TNode<Oddball> CodeAssembler::BooleanConstant(bool value) {
-  Handle<Object> object = isolate()->factory()->ToBoolean(value);
-  return UncheckedCast<Oddball>(
+TNode<Boolean> CodeAssembler::BooleanConstant(bool value) {
+  Handle<Boolean> object = isolate()->factory()->ToBoolean(value);
+  return UncheckedCast<Boolean>(
       jsgraph()->HeapConstant(Handle<HeapObject>::cast(object)));
 }
 
@@ -339,7 +347,7 @@ bool CodeAssembler::TryToInt64Constant(TNode<IntegralT> node,
   return m.HasResolvedValue();
 }
 
-bool CodeAssembler::TryToSmiConstant(TNode<Smi> tnode, Smi* out_value) {
+bool CodeAssembler::TryToSmiConstant(TNode<Smi> tnode, Tagged<Smi>* out_value) {
   Node* node = tnode;
   if (node->opcode() == IrOpcode::kBitcastWordToTaggedSigned) {
     node = node->InputAt(0);
@@ -347,7 +355,8 @@ bool CodeAssembler::TryToSmiConstant(TNode<Smi> tnode, Smi* out_value) {
   return TryToSmiConstant(ReinterpretCast<IntPtrT>(tnode), out_value);
 }
 
-bool CodeAssembler::TryToSmiConstant(TNode<IntegralT> node, Smi* out_value) {
+bool CodeAssembler::TryToSmiConstant(TNode<IntegralT> node,
+                                     Tagged<Smi>* out_value) {
   IntPtrMatcher m(node);
   if (m.HasResolvedValue()) {
     intptr_t value = m.ResolvedValue();
@@ -485,6 +494,12 @@ void CodeAssembler::PopAndReturn(Node* pop, Node* value) {
   return raw_assembler()->PopAndReturn(pop, value);
 }
 
+void CodeAssembler::PopAndReturn(Node* pop, Node* value1, Node* value2,
+                                 Node* value3, Node* value4) {
+  DCHECK_EQ(4, raw_assembler()->call_descriptor()->ReturnCount());
+  return raw_assembler()->PopAndReturn(pop, value1, value2, value3, value4);
+}
+
 void CodeAssembler::ReturnIf(TNode<BoolT> condition, TNode<Object> value) {
   Label if_return(this), if_continue(this);
   Branch(condition, &if_return, &if_continue);
@@ -547,6 +562,16 @@ TNode<RawPtrT> CodeAssembler::LoadParentFramePointer() {
   return UncheckedCast<RawPtrT>(raw_assembler()->LoadParentFramePointer());
 }
 
+TNode<RawPtrT> CodeAssembler::LoadPointerFromRootRegister(
+    TNode<IntPtrT> offset) {
+  return UncheckedCast<RawPtrT>(
+      Load(MachineType::IntPtr(), raw_assembler()->LoadRootRegister(), offset));
+}
+
+TNode<RawPtrT> CodeAssembler::StackSlotPtr(int size, int alignment) {
+  return UncheckedCast<RawPtrT>(raw_assembler()->StackSlot(size, alignment));
+}
+
 #define DEFINE_CODE_ASSEMBLER_BINARY_OP(name, ResType, Arg1Type, Arg2Type)   \
   TNode<ResType> CodeAssembler::name(TNode<Arg1Type> a, TNode<Arg2Type> b) { \
     return UncheckedCast<ResType>(raw_assembler()->name(a, b));              \
@@ -718,7 +743,7 @@ TNode<AnyTaggedT> CodeAssembler::LoadRootMapWord(RootIndex root_index) {
 TNode<Object> CodeAssembler::LoadRoot(RootIndex root_index) {
   if (RootsTable::IsImmortalImmovable(root_index)) {
     Handle<Object> root = isolate()->root_handle(root_index);
-    if (root->IsSmi()) {
+    if (IsSmi(*root)) {
       return SmiConstant(Smi::cast(*root));
     } else {
       return HeapConstant(Handle<HeapObject>::cast(root));
@@ -776,6 +801,21 @@ void CodeAssembler::OptimizedStoreField(MachineRepresentation rep,
                                        WriteBarrierKind::kFullWriteBarrier);
 }
 
+void CodeAssembler::OptimizedStoreIndirectPointerField(TNode<HeapObject> object,
+                                                       int offset,
+                                                       Node* value) {
+  raw_assembler()->OptimizedStoreField(
+      MachineRepresentation::kIndirectPointer, object, offset, value,
+      WriteBarrierKind::kIndirectPointerWriteBarrier);
+}
+
+void CodeAssembler::OptimizedStoreIndirectPointerFieldNoWriteBarrier(
+    TNode<HeapObject> object, int offset, Node* value) {
+  raw_assembler()->OptimizedStoreField(MachineRepresentation::kIndirectPointer,
+                                       object, offset, value,
+                                       WriteBarrierKind::kNoWriteBarrier);
+}
+
 void CodeAssembler::OptimizedStoreFieldAssertNoWriteBarrier(
     MachineRepresentation rep, TNode<HeapObject> object, int offset,
     Node* value) {
@@ -946,11 +986,10 @@ Node* CodeAssembler::Projection(int index, Node* value) {
   return raw_assembler()->Projection(index, value);
 }
 
-TNode<HeapObject> CodeAssembler::OptimizedAllocate(
-    TNode<IntPtrT> size, AllocationType allocation,
-    AllowLargeObjects allow_large_objects) {
-  return UncheckedCast<HeapObject>(raw_assembler()->OptimizedAllocate(
-      size, allocation, allow_large_objects));
+TNode<HeapObject> CodeAssembler::OptimizedAllocate(TNode<IntPtrT> size,
+                                                   AllocationType allocation) {
+  return UncheckedCast<HeapObject>(
+      raw_assembler()->OptimizedAllocate(size, allocation));
 }
 
 void CodeAssembler::HandleException(Node* node) {
@@ -994,14 +1033,17 @@ class NodeArray {
   Node* arr_[kMaxSize];
   Node** ptr_ = arr_;
 };
+
 }  // namespace
 
 Node* CodeAssembler::CallRuntimeImpl(
     Runtime::FunctionId function, TNode<Object> context,
     std::initializer_list<TNode<Object>> args) {
   int result_size = Runtime::FunctionForId(function)->result_size;
-  TNode<Code> centry =
-      HeapConstant(CodeFactory::RuntimeCEntry(isolate(), result_size));
+  bool switch_to_the_central_stack =
+      Runtime::SwitchToTheCentralStackForTarget(function);
+  TNode<Code> centry = HeapConstant(CodeFactory::RuntimeCEntry(
+      isolate(), result_size, switch_to_the_central_stack));
   constexpr size_t kMaxNumArgs = 6;
   DCHECK_GE(kMaxNumArgs, args.size());
   int argc = static_cast<int>(args.size());
@@ -1033,8 +1075,10 @@ void CodeAssembler::TailCallRuntimeImpl(
     Runtime::FunctionId function, TNode<Int32T> arity, TNode<Object> context,
     std::initializer_list<TNode<Object>> args) {
   int result_size = Runtime::FunctionForId(function)->result_size;
-  TNode<Code> centry =
-      HeapConstant(CodeFactory::RuntimeCEntry(isolate(), result_size));
+  bool switch_to_the_central_stack =
+      Runtime::SwitchToTheCentralStackForTarget(function);
+  TNode<Code> centry = HeapConstant(CodeFactory::RuntimeCEntry(
+      isolate(), result_size, switch_to_the_central_stack));
   constexpr size_t kMaxNumArgs = 6;
   DCHECK_GE(kMaxNumArgs, args.size());
   int argc = static_cast<int>(args.size());
@@ -1315,7 +1359,8 @@ void CodeAssembler::Branch(TNode<BoolT> condition,
 void CodeAssembler::Switch(Node* index, Label* default_label,
                            const int32_t* case_values, Label** case_labels,
                            size_t case_count) {
-  RawMachineLabel** labels = zone()->NewArray<RawMachineLabel*>(case_count);
+  RawMachineLabel** labels =
+      zone()->AllocateArray<RawMachineLabel*>(case_count);
   for (size_t i = 0; i < case_count; ++i) {
     labels[i] = case_labels[i]->label_;
     case_labels[i]->MergeVariables();
diff --git a/deps/v8/src/compiler/code-assembler.h b/deps/v8/src/compiler/code-assembler.h
index 11b0901f025935..75a9f322405109 100644
--- a/deps/v8/src/compiler/code-assembler.h
+++ b/deps/v8/src/compiler/code-assembler.h
@@ -19,6 +19,7 @@
 #include "src/builtins/builtins.h"
 #include "src/codegen/atomic-memory-order.h"
 #include "src/codegen/callable.h"
+#include "src/codegen/handler-table.h"
 #include "src/codegen/machine-type.h"
 #include "src/codegen/source-position.h"
 #include "src/codegen/tnode.h"
@@ -144,6 +145,11 @@ struct ObjectTypeOf {};
   struct ObjectTypeOf<Name<Args...>> {                   \
     static const ObjectType value = ObjectType::k##Name; \
   };
+#define OBJECT_TYPE_ODDBALL_CASE(Name)                    \
+  template <>                                             \
+  struct ObjectTypeOf<Name> {                             \
+    static const ObjectType value = ObjectType::kOddball; \
+  };
 OBJECT_TYPE_CASE(Object)
 OBJECT_TYPE_CASE(Smi)
 OBJECT_TYPE_CASE(TaggedIndex)
@@ -153,6 +159,10 @@ OBJECT_TYPE_LIST(OBJECT_TYPE_CASE)
 HEAP_OBJECT_ORDINARY_TYPE_LIST(OBJECT_TYPE_CASE)
 STRUCT_LIST(OBJECT_TYPE_STRUCT_CASE)
 HEAP_OBJECT_TEMPLATE_TYPE_LIST(OBJECT_TYPE_TEMPLATE_CASE)
+OBJECT_TYPE_ODDBALL_CASE(Null)
+OBJECT_TYPE_ODDBALL_CASE(Undefined)
+OBJECT_TYPE_ODDBALL_CASE(True)
+OBJECT_TYPE_ODDBALL_CASE(False)
 #undef OBJECT_TYPE_CASE
 #undef OBJECT_TYPE_STRUCT_CASE
 #undef OBJECT_TYPE_TEMPLATE_CASE
@@ -337,6 +347,7 @@ TNode<Float64T> Float64Add(TNode<Float64T> a, TNode<Float64T> b);
   V(ChangeUint32ToUint64, Uint64T, Word32T)                    \
   V(BitcastInt32ToFloat32, Float32T, Word32T)                  \
   V(BitcastFloat32ToInt32, Uint32T, Float32T)                  \
+  V(BitcastFloat64ToInt64, IntPtrT, Float64T)                  \
   V(RoundFloat64ToInt32, Int32T, Float64T)                     \
   V(RoundInt32ToFloat32, Float32T, Int32T)                     \
   V(Float64SilenceNaN, Float64T, Float64T)                     \
@@ -512,11 +523,16 @@ class V8_EXPORT_PRIVATE CodeAssembler {
   // Constants.
   TNode<Int32T> UniqueInt32Constant(int32_t value);
   TNode<Int32T> Int32Constant(int32_t value);
+  TNode<Int64T> UniqueInt64Constant(int64_t value);
   TNode<Int64T> Int64Constant(int64_t value);
   TNode<Uint64T> Uint64Constant(uint64_t value) {
     return Unsigned(Int64Constant(base::bit_cast<int64_t>(value)));
   }
   TNode<IntPtrT> IntPtrConstant(intptr_t value);
+  TNode<IntPtrT> UniqueIntPtrConstant(intptr_t value);
+  TNode<Uint32T> UniqueUint32Constant(int32_t value) {
+    return Unsigned(UniqueInt32Constant(base::bit_cast<int32_t>(value)));
+  }
   TNode<Uint32T> Uint32Constant(uint32_t value) {
     return Unsigned(Int32Constant(base::bit_cast<int32_t>(value)));
   }
@@ -529,7 +545,7 @@ class V8_EXPORT_PRIVATE CodeAssembler {
         IntPtrConstant(base::bit_cast<intptr_t>(value)));
   }
   TNode<Number> NumberConstant(double value);
-  TNode<Smi> SmiConstant(Smi value);
+  TNode<Smi> SmiConstant(Tagged<Smi> value);
   TNode<Smi> SmiConstant(int value);
   template <typename E,
             typename = typename std::enable_if<std::is_enum<E>::value>::type>
@@ -543,7 +559,7 @@ class V8_EXPORT_PRIVATE CodeAssembler {
     return UncheckedCast<Type>(UntypedHeapConstant(object));
   }
   TNode<String> StringConstant(const char* str);
-  TNode<Oddball> BooleanConstant(bool value);
+  TNode<Boolean> BooleanConstant(bool value);
   TNode<ExternalReference> ExternalConstant(ExternalReference address);
   TNode<Float32T> Float32Constant(double value);
   TNode<Float64T> Float64Constant(double value);
@@ -566,8 +582,8 @@ class V8_EXPORT_PRIVATE CodeAssembler {
   bool TryToInt64Constant(TNode<IntegralT> node, int64_t* out_value);
   bool TryToIntPtrConstant(TNode<IntegralT> node, intptr_t* out_value);
   bool TryToIntPtrConstant(TNode<Smi> tnode, intptr_t* out_value);
-  bool TryToSmiConstant(TNode<IntegralT> node, Smi* out_value);
-  bool TryToSmiConstant(TNode<Smi> node, Smi* out_value);
+  bool TryToSmiConstant(TNode<IntegralT> node, Tagged<Smi>* out_value);
+  bool TryToSmiConstant(TNode<Smi> node, Tagged<Smi>* out_value);
 
   bool IsUndefinedConstant(TNode<Object> node);
   bool IsNullConstant(TNode<Object> node);
@@ -600,7 +616,7 @@ class V8_EXPORT_PRIVATE CodeAssembler {
       message << " at " << loc.FileName() << ":" << loc.Line();
     }
     size_t buf_size = message.str().size() + 1;
-    char* message_dup = zone()->NewArray<char>(buf_size);
+    char* message_dup = zone()->AllocateArray<char>(buf_size);
     snprintf(message_dup, buf_size, "%s", message.str().c_str());
 
     return Cast(UntypedParameter(value), message_dup);
@@ -625,6 +641,8 @@ class V8_EXPORT_PRIVATE CodeAssembler {
   void Return(TNode<WordT> value1, TNode<WordT> value2);
   void Return(TNode<WordT> value1, TNode<Object> value2);
   void PopAndReturn(Node* pop, Node* value);
+  void PopAndReturn(Node* pop, Node* value1, Node* value2, Node* value3,
+                    Node* value4);
 
   void ReturnIf(TNode<BoolT> condition, TNode<Object> value);
 
@@ -722,6 +740,9 @@ class V8_EXPORT_PRIVATE CodeAssembler {
   // Access to the frame pointer
   TNode<RawPtrT> LoadFramePointer();
   TNode<RawPtrT> LoadParentFramePointer();
+  TNode<RawPtrT> StackSlotPtr(int size, int alignment);
+
+  TNode<RawPtrT> LoadPointerFromRootRegister(TNode<IntPtrT> offset);
 
   // Load raw memory location.
   Node* Load(MachineType type, Node* base);
@@ -795,13 +816,16 @@ class V8_EXPORT_PRIVATE CodeAssembler {
 
   // Optimized memory operations that map to Turbofan simplified nodes.
   TNode<HeapObject> OptimizedAllocate(TNode<IntPtrT> size,
-                                      AllocationType allocation,
-                                      AllowLargeObjects allow_large_objects);
+                                      AllocationType allocation);
   void StoreToObject(MachineRepresentation rep, TNode<Object> object,
                      TNode<IntPtrT> offset, Node* value,
                      StoreToObjectWriteBarrier write_barrier);
   void OptimizedStoreField(MachineRepresentation rep, TNode<HeapObject> object,
                            int offset, Node* value);
+  void OptimizedStoreIndirectPointerField(TNode<HeapObject> object, int offset,
+                                          Node* value);
+  void OptimizedStoreIndirectPointerFieldNoWriteBarrier(
+      TNode<HeapObject> object, int offset, Node* value);
   void OptimizedStoreFieldAssertNoWriteBarrier(MachineRepresentation rep,
                                                TNode<HeapObject> object,
                                                int offset, Node* value);
@@ -1191,6 +1215,14 @@ class V8_EXPORT_PRIVATE CodeAssembler {
                                       target, context, args...));
   }
 
+  template <class... TArgs>
+  void CallStubVoid(Callable const& callable, TNode<Object> context,
+                    TArgs... args) {
+    TNode<Code> target = HeapConstant(callable.code());
+    CallStubR(StubCallMode::kCallCodeObject, callable.descriptor(), target,
+              context, args...);
+  }
+
   template <class T = Object, class... TArgs>
   TNode<T> CallBuiltinPointer(const CallInterfaceDescriptor& descriptor,
                               TNode<BuiltinPtr> target, TNode<Object> context,
diff --git a/deps/v8/src/compiler/common-node-cache.h b/deps/v8/src/compiler/common-node-cache.h
index 7f87d1ba1f9010..638c48991b31ed 100644
--- a/deps/v8/src/compiler/common-node-cache.h
+++ b/deps/v8/src/compiler/common-node-cache.h
@@ -9,14 +9,6 @@
 
 namespace v8 {
 namespace internal {
-
-// Forward declarations.
-class ExternalReference;
-class HeapObject;
-template <typename>
-class Handle;
-
-
 namespace compiler {
 
 // Bundles various caches for common nodes.
diff --git a/deps/v8/src/compiler/common-operator-reducer.cc b/deps/v8/src/compiler/common-operator-reducer.cc
index b7d6721f0f4c18..6ec2f437d30298 100644
--- a/deps/v8/src/compiler/common-operator-reducer.cc
+++ b/deps/v8/src/compiler/common-operator-reducer.cc
@@ -172,9 +172,7 @@ Reduction CommonOperatorReducer::ReduceDeoptimizeConditional(Node* node) {
   } else {
     control = graph()->NewNode(common()->Deoptimize(p.reason(), p.feedback()),
                                frame_state, effect, control);
-    // TODO(bmeurer): This should be on the AdvancedReducer somehow.
-    NodeProperties::MergeControlToEnd(graph(), common(), control);
-    Revisit(graph()->end());
+    MergeControlToEnd(graph(), common(), control);
   }
   return Replace(dead());
 }
@@ -287,6 +285,35 @@ Reduction CommonOperatorReducer::ReducePhi(Node* node) {
             return Change(node, machine()->Float64Abs(), vtrue);
           }
         }
+      } else if (cond->opcode() == IrOpcode::kInt32LessThan) {
+        Int32BinopMatcher mcond(cond);
+        if (mcond.left().Is(0) && mcond.right().Equals(vtrue) &&
+            (vfalse->opcode() == IrOpcode::kInt32Sub)) {
+          Int32BinopMatcher mvfalse(vfalse);
+          if (mvfalse.left().Is(0) && mvfalse.right().Equals(vtrue)) {
+            // We might now be able to further reduce the {merge} node.
+            Revisit(merge);
+
+            if (machine()->Word32Select().IsSupported()) {
+              // Select positive value with conditional move if is supported.
+              Node* abs = graph()->NewNode(machine()->Word32Select().op(), cond,
+                                           vtrue, vfalse);
+              return Replace(abs);
+            } else {
+              // Generate absolute integer value.
+              //
+              //    let sign = input >> 31 in
+              //    (input ^ sign) - sign
+              Node* sign = graph()->NewNode(
+                  machine()->Word32Sar(), vtrue,
+                  graph()->NewNode(common()->Int32Constant(31)));
+              Node* abs = graph()->NewNode(
+                  machine()->Int32Sub(),
+                  graph()->NewNode(machine()->Word32Xor(), vtrue, sign), sign);
+              return Replace(abs);
+            }
+          }
+        }
       }
     }
   }
@@ -365,7 +392,7 @@ Reduction CommonOperatorReducer::ReduceReturn(Node* node) {
         // the reducer logic will visit {end} again.
         Node* ret = graph()->NewNode(node->op(), pop_count, value_inputs[i],
                                      effect, control_inputs[i]);
-        NodeProperties::MergeControlToEnd(graph(), common(), ret);
+        MergeControlToEnd(graph(), common(), ret);
       }
       // Mark the Merge {control} and Return {node} as {dead}.
       Replace(control, dead());
@@ -381,7 +408,7 @@ Reduction CommonOperatorReducer::ReduceReturn(Node* node) {
         // the reducer logic will visit {end} again.
         Node* ret = graph()->NewNode(node->op(), pop_count, value_inputs[i],
                                      effect_inputs[i], control_inputs[i]);
-        NodeProperties::MergeControlToEnd(graph(), common(), ret);
+        MergeControlToEnd(graph(), common(), ret);
       }
       // Mark the Merge {control} and Return {node} as {dead}.
       Replace(control, dead());
@@ -448,7 +475,7 @@ Reduction CommonOperatorReducer::ReduceSwitch(Node* node) {
     bool matched = false;
 
     size_t const projection_count = node->op()->ControlOutputCount();
-    Node** projections = zone_->NewArray<Node*>(projection_count);
+    Node** projections = zone_->AllocateArray<Node*>(projection_count);
     NodeProperties::CollectControlProjections(node, projections,
                                               projection_count);
     for (size_t i = 0; i < projection_count - 1; i++) {
@@ -497,8 +524,7 @@ Reduction CommonOperatorReducer::ReduceTrapConditional(Node* trap) {
     // graph()->end().
     ReplaceWithValue(trap, dead(), dead(), dead());
     Node* control = graph()->NewNode(common()->Throw(), trap, trap);
-    NodeProperties::MergeControlToEnd(graph(), common(), control);
-    Revisit(graph()->end());
+    MergeControlToEnd(graph(), common(), control);
     return Changed(trap);
   } else {
     // This will not trap, remove it by relaxing effect/control.
diff --git a/deps/v8/src/compiler/common-operator.cc b/deps/v8/src/compiler/common-operator.cc
index a763595f7eab8f..2207d56cf2dc8c 100644
--- a/deps/v8/src/compiler/common-operator.cc
+++ b/deps/v8/src/compiler/common-operator.cc
@@ -48,8 +48,6 @@ std::ostream& operator<<(std::ostream& os, TrapId trap_id) {
     return os << #Name;
     FOREACH_WASM_TRAPREASON(TRAP_CASE)
 #undef TRAP_CASE
-    case TrapId::kInvalid:
-      return os << "Invalid";
   }
   UNREACHABLE();
 }
@@ -452,8 +450,8 @@ V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream& out,
   } else {
     out << "nullptr";
   }
-  out << ", ";
   if (const auto& t = p.override_output_type()) {
+    out << ", ";
     t->PrintTo(out);
   } else {
     out << ", nullopt";
@@ -814,33 +812,46 @@ struct CommonOperatorGlobalCache final {
   CACHED_DEOPTIMIZE_UNLESS_LIST(CACHED_DEOPTIMIZE_UNLESS)
 #undef CACHED_DEOPTIMIZE_UNLESS
 
-  template <TrapId trap_id>
+  template <TrapId trap_id, bool has_frame_state>
   struct TrapIfOperator final : public Operator1<TrapId> {
     TrapIfOperator()
         : Operator1<TrapId>(                             // --
               IrOpcode::kTrapIf,                         // opcode
               Operator::kFoldable | Operator::kNoThrow,  // properties
               "TrapIf",                                  // name
-              1, 1, 1, 0, 1, 1,                          // counts
+              1 + has_frame_state, 1, 1, 0, 1, 1,        // counts
               trap_id) {}                                // parameter
   };
 #define CACHED_TRAP_IF(Trap) \
-  TrapIfOperator<TrapId::k##Trap> kTrapIf##Trap##Operator;
+  TrapIfOperator<TrapId::k##Trap, true> kTrapIf##Trap##OperatorWithFrameState;
   CACHED_TRAP_IF_LIST(CACHED_TRAP_IF)
 #undef CACHED_TRAP_IF
 
-  template <TrapId trap_id>
+#define CACHED_TRAP_IF(Trap)             \
+  TrapIfOperator<TrapId::k##Trap, false> \
+      kTrapIf##Trap##OperatorWithoutFrameState;
+  CACHED_TRAP_IF_LIST(CACHED_TRAP_IF)
+#undef CACHED_TRAP_IF
+
+  template <TrapId trap_id, bool has_frame_state>
   struct TrapUnlessOperator final : public Operator1<TrapId> {
     TrapUnlessOperator()
         : Operator1<TrapId>(                             // --
               IrOpcode::kTrapUnless,                     // opcode
               Operator::kFoldable | Operator::kNoThrow,  // properties
               "TrapUnless",                              // name
-              1, 1, 1, 0, 1, 1,                          // counts
+              1 + has_frame_state, 1, 1, 0, 1, 1,        // counts
               trap_id) {}                                // parameter
   };
-#define CACHED_TRAP_UNLESS(Trap) \
-  TrapUnlessOperator<TrapId::k##Trap> kTrapUnless##Trap##Operator;
+#define CACHED_TRAP_UNLESS(Trap)            \
+  TrapUnlessOperator<TrapId::k##Trap, true> \
+      kTrapUnless##Trap##OperatorWithFrameState;
+  CACHED_TRAP_UNLESS_LIST(CACHED_TRAP_UNLESS)
+#undef CACHED_TRAP_UNLESS
+
+#define CACHED_TRAP_UNLESS(Trap)             \
+  TrapUnlessOperator<TrapId::k##Trap, false> \
+      kTrapUnless##Trap##OperatorWithoutFrameState;
   CACHED_TRAP_UNLESS_LIST(CACHED_TRAP_UNLESS)
 #undef CACHED_TRAP_UNLESS
 
@@ -1050,11 +1061,15 @@ const Operator* CommonOperatorBuilder::DeoptimizeUnless(
       parameter);                                       // parameter
 }
 
-const Operator* CommonOperatorBuilder::TrapIf(TrapId trap_id) {
+const Operator* CommonOperatorBuilder::TrapIf(TrapId trap_id,
+                                              bool has_frame_state) {
   switch (trap_id) {
-#define CACHED_TRAP_IF(Trap) \
-  case TrapId::k##Trap:      \
-    return &cache_.kTrapIf##Trap##Operator;
+#define CACHED_TRAP_IF(Trap)                                        \
+  case TrapId::k##Trap:                                             \
+    return has_frame_state                                          \
+               ? static_cast<const Operator*>(                      \
+                     &cache_.kTrapIf##Trap##OperatorWithFrameState) \
+               : &cache_.kTrapIf##Trap##OperatorWithoutFrameState;
     CACHED_TRAP_IF_LIST(CACHED_TRAP_IF)
 #undef CACHED_TRAP_IF
     default:
@@ -1065,15 +1080,19 @@ const Operator* CommonOperatorBuilder::TrapIf(TrapId trap_id) {
       IrOpcode::kTrapIf,                         // opcode
       Operator::kFoldable | Operator::kNoThrow,  // properties
       "TrapIf",                                  // name
-      1, 1, 1, 0, 1, 1,                          // counts
+      1 + has_frame_state, 1, 1, 0, 1, 1,        // counts
       trap_id);                                  // parameter
 }
 
-const Operator* CommonOperatorBuilder::TrapUnless(TrapId trap_id) {
+const Operator* CommonOperatorBuilder::TrapUnless(TrapId trap_id,
+                                                  bool has_frame_state) {
   switch (trap_id) {
-#define CACHED_TRAP_UNLESS(Trap) \
-  case TrapId::k##Trap:          \
-    return &cache_.kTrapUnless##Trap##Operator;
+#define CACHED_TRAP_UNLESS(Trap)                                        \
+  case TrapId::k##Trap:                                                 \
+    return has_frame_state                                              \
+               ? static_cast<const Operator*>(                          \
+                     &cache_.kTrapUnless##Trap##OperatorWithFrameState) \
+               : &cache_.kTrapUnless##Trap##OperatorWithoutFrameState;
     CACHED_TRAP_UNLESS_LIST(CACHED_TRAP_UNLESS)
 #undef CACHED_TRAP_UNLESS
     default:
@@ -1084,7 +1103,7 @@ const Operator* CommonOperatorBuilder::TrapUnless(TrapId trap_id) {
       IrOpcode::kTrapUnless,                     // opcode
       Operator::kFoldable | Operator::kNoThrow,  // properties
       "TrapUnless",                              // name
-      1, 1, 1, 0, 1, 1,                          // counts
+      1 + has_frame_state, 1, 1, 0, 1, 1,        // counts
       trap_id);                                  // parameter
 }
 
@@ -1364,13 +1383,6 @@ const Operator* CommonOperatorBuilder::TypeGuard(Type type) {
       type);                                  // parameter
 }
 
-const Operator* CommonOperatorBuilder::FoldConstant() {
-  return zone()->New<Operator>(                  // --
-      IrOpcode::kFoldConstant, Operator::kPure,  // opcode
-      "FoldConstant",                            // name
-      2, 0, 0, 1, 0, 0);                         // counts
-}
-
 const Operator* CommonOperatorBuilder::EnterMachineGraph(UseInfo use_info) {
   return zone()->New<Operator1<UseInfo>>(IrOpcode::kEnterMachineGraph,
                                          Operator::kPure, "EnterMachineGraph",
diff --git a/deps/v8/src/compiler/common-operator.h b/deps/v8/src/compiler/common-operator.h
index c90e334fd34a07..d7cda403c7e111 100644
--- a/deps/v8/src/compiler/common-operator.h
+++ b/deps/v8/src/compiler/common-operator.h
@@ -58,7 +58,6 @@ enum class TrapId : uint32_t {
 #define DEF_ENUM(Name, ...) k##Name,
   FOREACH_WASM_TRAPREASON(DEF_ENUM)
 #undef DEF_ENUM
-      kInvalid
 };
 
 inline size_t hash_value(TrapId id) { return static_cast<uint32_t>(id); }
@@ -551,8 +550,8 @@ class V8_EXPORT_PRIVATE CommonOperatorBuilder final
                                FeedbackSource const& feedback);
   const Operator* DeoptimizeUnless(DeoptimizeReason reason,
                                    FeedbackSource const& feedback);
-  const Operator* TrapIf(TrapId trap_id);
-  const Operator* TrapUnless(TrapId trap_id);
+  const Operator* TrapIf(TrapId trap_id, bool has_frame_state);
+  const Operator* TrapUnless(TrapId trap_id, bool has_frame_state);
   const Operator* Return(int value_input_count = 1);
   const Operator* Terminate();
 
@@ -607,7 +606,6 @@ class V8_EXPORT_PRIVATE CommonOperatorBuilder final
   const Operator* Projection(size_t index);
   const Operator* Retain();
   const Operator* TypeGuard(Type type);
-  const Operator* FoldConstant();
   const Operator* EnterMachineGraph(UseInfo use_info);
   const Operator* ExitMachineGraph(MachineRepresentation output_representation,
                                    Type output_type);
@@ -686,7 +684,8 @@ class FrameState : public CommonNodeWrapperBase {
   Node* parameters() const {
     Node* n = node()->InputAt(kFrameStateParametersInput);
     DCHECK(n->opcode() == IrOpcode::kStateValues ||
-           n->opcode() == IrOpcode::kTypedStateValues);
+           n->opcode() == IrOpcode::kTypedStateValues ||
+           n->opcode() == IrOpcode::kDeadValue);
     return n;
   }
   Node* locals() const {
diff --git a/deps/v8/src/compiler/compilation-dependencies.cc b/deps/v8/src/compiler/compilation-dependencies.cc
index d2f34fdc7c05c7..4832cceb6125c4 100644
--- a/deps/v8/src/compiler/compilation-dependencies.cc
+++ b/deps/v8/src/compiler/compilation-dependencies.cc
@@ -4,7 +4,9 @@
 
 #include "src/compiler/compilation-dependencies.h"
 
+#include "src/base/hashmap.h"
 #include "src/base/optional.h"
+#include "src/common/assert-scope.h"
 #include "src/execution/protectors.h"
 #include "src/handles/handles-inl.h"
 #include "src/objects/allocation-site-inl.h"
@@ -27,6 +29,7 @@ namespace compiler {
   V(GlobalProperty)                     \
   V(InitialMap)                         \
   V(InitialMapInstanceSizePrediction)   \
+  V(NoSlackTrackingChange)              \
   V(OwnConstantDataProperty)            \
   V(OwnConstantDictionaryProperty)      \
   V(OwnConstantElement)                 \
@@ -112,17 +115,18 @@ namespace {
 // them from here.
 class PendingDependencies final {
  public:
-  explicit PendingDependencies(Zone* zone) : deps_(zone) {}
+  explicit PendingDependencies(Zone* zone)
+      : deps_(8, {}, ZoneAllocationPolicy(zone)) {}
 
   void Register(Handle<HeapObject> object,
                 DependentCode::DependencyGroup group) {
     // InstructionStream, which are per-local Isolate, cannot depend on objects
-    // in the shared heap. Shared heap dependencies are designed to never
-    // invalidate assumptions. E.g., maps for shared structs do not have
-    // transitions or change the shape of their fields. See
+    // in the shared or RO heaps. Shared and RO heap dependencies are designed
+    // to never invalidate assumptions. E.g., maps for shared structs do not
+    // have transitions or change the shape of their fields. See
     // DependentCode::DeoptimizeDependencyGroups for corresponding DCHECK.
-    if (object->InWritableSharedSpace()) return;
-    deps_[object] |= group;
+    if (object->InWritableSharedSpace() || object->InReadOnlySpace()) return;
+    deps_.LookupOrInsert(object, HandleValueHash(object))->value |= group;
   }
 
   void InstallAll(Isolate* isolate, Handle<Code> code) {
@@ -134,55 +138,58 @@ class PendingDependencies final {
     // With deduplication done we no longer rely on the object address for
     // hashing.
     AllowGarbageCollection yes_gc;
-    for (const auto& o_and_g : deps_) {
-      DependentCode::InstallDependency(isolate, code, o_and_g.first,
-                                       o_and_g.second);
+    for (auto* entry = deps_.Start(); entry != nullptr;
+         entry = deps_.Next(entry)) {
+      DependentCode::InstallDependency(isolate, code, entry->key, entry->value);
     }
+    deps_.Invalidate();
   }
 
   void InstallAllPredictable(Isolate* isolate, Handle<Code> code) {
     CHECK(v8_flags.predictable);
     // First, guarantee predictable iteration order.
-    using HandleAndGroup =
-        std::pair<Handle<HeapObject>, DependentCode::DependencyGroups>;
-    std::vector<HandleAndGroup> entries(deps_.begin(), deps_.end());
+    using DepsMap = decltype(deps_);
+    std::vector<const DepsMap::Entry*> entries;
+    entries.reserve(deps_.occupancy());
+    for (auto* entry = deps_.Start(); entry != nullptr;
+         entry = deps_.Next(entry)) {
+      entries.push_back(entry);
+    }
 
     std::sort(entries.begin(), entries.end(),
-              [](const HandleAndGroup& lhs, const HandleAndGroup& rhs) {
-                return lhs.first->ptr() < rhs.first->ptr();
+              [](const DepsMap::Entry* lhs, const DepsMap::Entry* rhs) {
+                return lhs->key->ptr() < rhs->key->ptr();
               });
 
     // With deduplication done we no longer rely on the object address for
     // hashing.
     AllowGarbageCollection yes_gc;
-    for (const auto& o_and_g : entries) {
-      DependentCode::InstallDependency(isolate, code, o_and_g.first,
-                                       o_and_g.second);
+    for (const auto* entry : entries) {
+      DependentCode::InstallDependency(isolate, code, entry->key, entry->value);
     }
+    deps_.Invalidate();
   }
 
  private:
-  struct HandleHash {
-    size_t operator()(const Handle<HeapObject>& x) const {
-      return static_cast<size_t>(x->ptr());
-    }
-  };
-  struct HandleEqual {
-    bool operator()(const Handle<HeapObject>& lhs,
-                    const Handle<HeapObject>& rhs) const {
-      return lhs.is_identical_to(rhs);
+  uint32_t HandleValueHash(Handle<HeapObject> handle) {
+    return static_cast<uint32_t>(base::hash_value(handle->ptr()));
+  }
+  struct HandleValueEqual {
+    bool operator()(uint32_t hash1, uint32_t hash2, Handle<HeapObject> lhs,
+                    Handle<HeapObject> rhs) const {
+      return hash1 == hash2 && lhs.is_identical_to(rhs);
     }
   };
-  ZoneUnorderedMap<Handle<HeapObject>, DependentCode::DependencyGroups,
-                   HandleHash, HandleEqual>
+
+  base::TemplateHashMapImpl<Handle<HeapObject>, DependentCode::DependencyGroups,
+                            HandleValueEqual, ZoneAllocationPolicy>
       deps_;
-  const DisallowGarbageCollection no_gc_;
 };
 
 class InitialMapDependency final : public CompilationDependency {
  public:
-  InitialMapDependency(JSHeapBroker* broker, const JSFunctionRef& function,
-                       const MapRef& initial_map)
+  InitialMapDependency(JSHeapBroker* broker, JSFunctionRef function,
+                       MapRef initial_map)
       : CompilationDependency(kInitialMap),
         function_(function),
         initial_map_(initial_map) {}
@@ -217,9 +224,8 @@ class InitialMapDependency final : public CompilationDependency {
 
 class PrototypePropertyDependency final : public CompilationDependency {
  public:
-  PrototypePropertyDependency(JSHeapBroker* broker,
-                              const JSFunctionRef& function,
-                              const ObjectRef& prototype)
+  PrototypePropertyDependency(JSHeapBroker* broker, JSFunctionRef function,
+                              ObjectRef prototype)
       : CompilationDependency(kPrototypeProperty),
         function_(function),
         prototype_(prototype) {
@@ -268,7 +274,7 @@ class PrototypePropertyDependency final : public CompilationDependency {
 
 class StableMapDependency final : public CompilationDependency {
  public:
-  explicit StableMapDependency(const MapRef& map)
+  explicit StableMapDependency(MapRef map)
       : CompilationDependency(kStableMap), map_(map) {}
 
   bool IsValid(JSHeapBroker* broker) const override {
@@ -323,13 +329,13 @@ class ConstantInDictionaryPrototypeChainDependency final
     Handle<Map> map = receiver_map_.object();
 
     while (map->prototype() != *holder) {
-      map = handle(map->prototype().map(), isolate);
-      DCHECK(map->IsJSObjectMap());  // Due to IsValid holding.
+      map = handle(map->prototype()->map(), isolate);
+      DCHECK(IsJSObjectMap(*map));  // Due to IsValid holding.
       deps->Register(map, DependentCode::kPrototypeCheckGroup);
     }
 
-    DCHECK(map->prototype().map().IsJSObjectMap());  // Due to IsValid holding.
-    deps->Register(handle(map->prototype().map(), isolate),
+    DCHECK(IsJSObjectMap(map->prototype()->map()));  // Due to IsValid holding.
+    deps->Register(handle(map->prototype()->map(), isolate),
                    DependentCode::kPrototypeCheckGroup);
   }
 
@@ -344,23 +350,23 @@ class ConstantInDictionaryPrototypeChainDependency final
     Isolate* isolate = broker->isolate();
 
     Handle<Object> holder;
-    HeapObject prototype = receiver_map_.object()->prototype();
+    Tagged<HeapObject> prototype = receiver_map_.object()->prototype();
 
     enum class ValidationResult { kFoundCorrect, kFoundIncorrect, kNotFound };
     auto try_load = [&](auto dictionary) -> ValidationResult {
       InternalIndex entry =
-          dictionary.FindEntry(isolate, property_name_.object());
+          dictionary->FindEntry(isolate, property_name_.object());
       if (entry.is_not_found()) {
         return ValidationResult::kNotFound;
       }
 
-      PropertyDetails details = dictionary.DetailsAt(entry);
+      PropertyDetails details = dictionary->DetailsAt(entry);
       if (details.constness() != PropertyConstness::kConst) {
         return ValidationResult::kFoundIncorrect;
       }
 
-      Object dictionary_value = dictionary.ValueAt(entry);
-      Object value;
+      Tagged<Object> dictionary_value = dictionary->ValueAt(entry);
+      Tagged<Object> value;
       // We must be able to detect the case that the property |property_name_|
       // of |holder_| was originally a plain function |constant_| (when creating
       // this dependency) and has since become an accessor whose getter is
@@ -371,13 +377,13 @@ class ConstantInDictionaryPrototypeChainDependency final
         return ValidationResult::kFoundIncorrect;
       }
       if (kind_ == PropertyKind::kAccessor) {
-        if (!dictionary_value.IsAccessorPair()) {
+        if (!IsAccessorPair(dictionary_value)) {
           return ValidationResult::kFoundIncorrect;
         }
         // Only supporting loading at the moment, so we only ever want the
         // getter.
         value = AccessorPair::cast(dictionary_value)
-                    .get(AccessorComponent::ACCESSOR_GETTER);
+                    ->get(AccessorComponent::ACCESSOR_GETTER);
       } else {
         value = dictionary_value;
       }
@@ -385,20 +391,20 @@ class ConstantInDictionaryPrototypeChainDependency final
                                           : ValidationResult::kFoundIncorrect;
     };
 
-    while (prototype.IsJSObject()) {
+    while (IsJSObject(prototype)) {
       // We only care about JSObjects because that's the only type of holder
       // (and types of prototypes on the chain to the holder) that
       // AccessInfoFactory::ComputePropertyAccessInfo allows.
-      JSObject object = JSObject::cast(prototype);
+      Tagged<JSObject> object = JSObject::cast(prototype);
 
       // We only support dictionary mode prototypes on the chain for this kind
       // of dependency.
-      CHECK(!object.HasFastProperties());
+      CHECK(!object->HasFastProperties());
 
       ValidationResult result =
           V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL
-              ? try_load(object.property_dictionary_swiss())
-              : try_load(object.property_dictionary());
+              ? try_load(object->property_dictionary_swiss())
+              : try_load(object->property_dictionary());
 
       if (result == ValidationResult::kFoundCorrect) {
         return handle(object, isolate);
@@ -407,7 +413,7 @@ class ConstantInDictionaryPrototypeChainDependency final
       }
 
       // In case of kNotFound, continue walking up the chain.
-      prototype = object.map().prototype();
+      prototype = object->map()->prototype();
     }
 
     return MaybeHandle<JSObject>();
@@ -435,11 +441,9 @@ class ConstantInDictionaryPrototypeChainDependency final
 
 class OwnConstantDataPropertyDependency final : public CompilationDependency {
  public:
-  OwnConstantDataPropertyDependency(JSHeapBroker* broker,
-                                    const JSObjectRef& holder,
-                                    const MapRef& map,
-                                    Representation representation,
-                                    FieldIndex index, const ObjectRef& value)
+  OwnConstantDataPropertyDependency(JSHeapBroker* broker, JSObjectRef holder,
+                                    MapRef map, Representation representation,
+                                    FieldIndex index, ObjectRef value)
       : CompilationDependency(kOwnConstantDataProperty),
         broker_(broker),
         holder_(holder),
@@ -455,13 +459,13 @@ class OwnConstantDataPropertyDependency final : public CompilationDependency {
       return false;
     }
     DisallowGarbageCollection no_heap_allocation;
-    Object current_value = holder_.object()->RawFastPropertyAt(index_);
-    Object used_value = *value_.object();
+    Tagged<Object> current_value = holder_.object()->RawFastPropertyAt(index_);
+    Tagged<Object> used_value = *value_.object();
     if (representation_.IsDouble()) {
       // Compare doubles by bit pattern.
-      if (!current_value.IsHeapNumber() || !used_value.IsHeapNumber() ||
-          HeapNumber::cast(current_value).value_as_bits(kRelaxedLoad) !=
-              HeapNumber::cast(used_value).value_as_bits(kRelaxedLoad)) {
+      if (!IsHeapNumber(current_value) || !IsHeapNumber(used_value) ||
+          HeapNumber::cast(current_value)->value_as_bits(kRelaxedLoad) !=
+              HeapNumber::cast(used_value)->value_as_bits(kRelaxedLoad)) {
         TRACE_BROKER_MISSING(broker_,
                              "Constant Double property value changed in "
                                  << holder_.object() << " at FieldIndex "
@@ -507,9 +511,8 @@ class OwnConstantDictionaryPropertyDependency final
     : public CompilationDependency {
  public:
   OwnConstantDictionaryPropertyDependency(JSHeapBroker* broker,
-                                          const JSObjectRef& holder,
-                                          InternalIndex index,
-                                          const ObjectRef& value)
+                                          JSObjectRef holder,
+                                          InternalIndex index, ObjectRef value)
       : CompilationDependency(kOwnConstantDictionaryProperty),
         holder_(holder),
         map_(holder.map(broker)),
@@ -527,7 +530,7 @@ class OwnConstantDictionaryPropertyDependency final
       return false;
     }
 
-    base::Optional<Object> maybe_value = JSObject::DictionaryPropertyAt(
+    base::Optional<Tagged<Object>> maybe_value = JSObject::DictionaryPropertyAt(
         holder_.object(), index_, broker->isolate()->heap());
 
     if (!maybe_value) {
@@ -573,7 +576,7 @@ class OwnConstantDictionaryPropertyDependency final
 
 class ConsistentJSFunctionViewDependency final : public CompilationDependency {
  public:
-  explicit ConsistentJSFunctionViewDependency(const JSFunctionRef& function)
+  explicit ConsistentJSFunctionViewDependency(JSFunctionRef function)
       : CompilationDependency(kConsistentJSFunctionView), function_(function) {}
 
   bool IsValid(JSHeapBroker* broker) const override {
@@ -600,7 +603,7 @@ class ConsistentJSFunctionViewDependency final : public CompilationDependency {
 
 class TransitionDependency final : public CompilationDependency {
  public:
-  explicit TransitionDependency(const MapRef& map)
+  explicit TransitionDependency(MapRef map)
       : CompilationDependency(kTransition), map_(map) {
     DCHECK(map_.CanBeDeprecated());
   }
@@ -630,8 +633,7 @@ class TransitionDependency final : public CompilationDependency {
 
 class PretenureModeDependency final : public CompilationDependency {
  public:
-  PretenureModeDependency(const AllocationSiteRef& site,
-                          AllocationType allocation)
+  PretenureModeDependency(AllocationSiteRef site, AllocationType allocation)
       : CompilationDependency(kPretenureMode),
         site_(site),
         allocation_(allocation) {}
@@ -662,10 +664,12 @@ class PretenureModeDependency final : public CompilationDependency {
 
 class FieldRepresentationDependency final : public CompilationDependency {
  public:
-  FieldRepresentationDependency(const MapRef& map, InternalIndex descriptor,
+  FieldRepresentationDependency(MapRef map, MapRef owner,
+                                InternalIndex descriptor,
                                 Representation representation)
       : CompilationDependency(kFieldRepresentation),
         map_(map),
+        owner_(owner),
         descriptor_(descriptor),
         representation_(representation) {}
 
@@ -674,18 +678,17 @@ class FieldRepresentationDependency final : public CompilationDependency {
     if (map_.object()->is_deprecated()) return false;
     return representation_.Equals(map_.object()
                                       ->instance_descriptors(broker->isolate())
-                                      .GetDetails(descriptor_)
+                                      ->GetDetails(descriptor_)
                                       .representation());
   }
 
   void Install(JSHeapBroker* broker, PendingDependencies* deps) const override {
     SLOW_DCHECK(IsValid(broker));
     Isolate* isolate = broker->isolate();
-    Handle<Map> owner(map_.object()->FindFieldOwner(isolate, descriptor_),
-                      isolate);
+    Handle<Map> owner = owner_.object();
     CHECK(!owner->is_deprecated());
     CHECK(representation_.Equals(owner->instance_descriptors(isolate)
-                                     .GetDetails(descriptor_)
+                                     ->GetDetails(descriptor_)
                                      .representation()));
     deps->Register(owner, DependentCode::kFieldRepresentationGroup);
   }
@@ -709,16 +712,18 @@ class FieldRepresentationDependency final : public CompilationDependency {
   }
 
   const MapRef map_;
+  const MapRef owner_;
   const InternalIndex descriptor_;
   const Representation representation_;
 };
 
 class FieldTypeDependency final : public CompilationDependency {
  public:
-  FieldTypeDependency(const MapRef& map, InternalIndex descriptor,
-                      const ObjectRef& type)
+  FieldTypeDependency(MapRef map, MapRef owner, InternalIndex descriptor,
+                      ObjectRef type)
       : CompilationDependency(kFieldType),
         map_(map),
+        owner_(owner),
         descriptor_(descriptor),
         type_(type) {}
 
@@ -727,17 +732,16 @@ class FieldTypeDependency final : public CompilationDependency {
     if (map_.object()->is_deprecated()) return false;
     return *type_.object() == map_.object()
                                   ->instance_descriptors(broker->isolate())
-                                  .GetFieldType(descriptor_);
+                                  ->GetFieldType(descriptor_);
   }
 
   void Install(JSHeapBroker* broker, PendingDependencies* deps) const override {
     SLOW_DCHECK(IsValid(broker));
     Isolate* isolate = broker->isolate();
-    Handle<Map> owner(map_.object()->FindFieldOwner(isolate, descriptor_),
-                      isolate);
+    Handle<Map> owner = owner_.object();
     CHECK(!owner->is_deprecated());
     CHECK_EQ(*type_.object(),
-             owner->instance_descriptors(isolate).GetFieldType(descriptor_));
+             owner->instance_descriptors(isolate)->GetFieldType(descriptor_));
     deps->Register(owner, DependentCode::kFieldTypeGroup);
   }
 
@@ -754,15 +758,17 @@ class FieldTypeDependency final : public CompilationDependency {
   }
 
   const MapRef map_;
+  const MapRef owner_;
   const InternalIndex descriptor_;
   const ObjectRef type_;
 };
 
 class FieldConstnessDependency final : public CompilationDependency {
  public:
-  FieldConstnessDependency(const MapRef& map, InternalIndex descriptor)
+  FieldConstnessDependency(MapRef map, MapRef owner, InternalIndex descriptor)
       : CompilationDependency(kFieldConstness),
         map_(map),
+        owner_(owner),
         descriptor_(descriptor) {}
 
   bool IsValid(JSHeapBroker* broker) const override {
@@ -771,18 +777,17 @@ class FieldConstnessDependency final : public CompilationDependency {
     return PropertyConstness::kConst ==
            map_.object()
                ->instance_descriptors(broker->isolate())
-               .GetDetails(descriptor_)
+               ->GetDetails(descriptor_)
                .constness();
   }
 
   void Install(JSHeapBroker* broker, PendingDependencies* deps) const override {
     SLOW_DCHECK(IsValid(broker));
     Isolate* isolate = broker->isolate();
-    Handle<Map> owner(map_.object()->FindFieldOwner(isolate, descriptor_),
-                      isolate);
+    Handle<Map> owner = owner_.object();
     CHECK(!owner->is_deprecated());
     CHECK_EQ(PropertyConstness::kConst, owner->instance_descriptors(isolate)
-                                            .GetDetails(descriptor_)
+                                            ->GetDetails(descriptor_)
                                             .constness());
     deps->Register(owner, DependentCode::kFieldConstGroup);
   }
@@ -799,12 +804,13 @@ class FieldConstnessDependency final : public CompilationDependency {
   }
 
   const MapRef map_;
+  const MapRef owner_;
   const InternalIndex descriptor_;
 };
 
 class GlobalPropertyDependency final : public CompilationDependency {
  public:
-  GlobalPropertyDependency(const PropertyCellRef& cell, PropertyCellType type,
+  GlobalPropertyDependency(PropertyCellRef cell, PropertyCellType type,
                            bool read_only)
       : CompilationDependency(kGlobalProperty),
         cell_(cell),
@@ -818,7 +824,8 @@ class GlobalPropertyDependency final : public CompilationDependency {
     Handle<PropertyCell> cell = cell_.object();
     // The dependency is never valid if the cell is 'invalidated'. This is
     // marked by setting the value to the hole.
-    if (cell->value() == *(broker->isolate()->factory()->the_hole_value())) {
+    if (cell->value() ==
+        *(broker->isolate()->factory()->property_cell_hole_value())) {
       return false;
     }
     return type_ == cell->property_details().cell_type() &&
@@ -848,7 +855,7 @@ class GlobalPropertyDependency final : public CompilationDependency {
 
 class ProtectorDependency final : public CompilationDependency {
  public:
-  explicit ProtectorDependency(const PropertyCellRef& cell)
+  explicit ProtectorDependency(PropertyCellRef cell)
       : CompilationDependency(kProtector), cell_(cell) {}
 
   bool IsValid(JSHeapBroker* broker) const override {
@@ -877,8 +884,8 @@ class ProtectorDependency final : public CompilationDependency {
 // Check that an object slot will not change during compilation.
 class ObjectSlotValueDependency final : public CompilationDependency {
  public:
-  explicit ObjectSlotValueDependency(const HeapObjectRef& object, int offset,
-                                     const ObjectRef& value)
+  explicit ObjectSlotValueDependency(HeapObjectRef object, int offset,
+                                     ObjectRef value)
       : CompilationDependency(kObjectSlotValue),
         object_(object.object()),
         offset_(offset),
@@ -886,7 +893,7 @@ class ObjectSlotValueDependency final : public CompilationDependency {
 
   bool IsValid(JSHeapBroker* broker) const override {
     PtrComprCageBase cage_base = GetPtrComprCageBase(*object_);
-    Object current_value =
+    Tagged<Object> current_value =
         offset_ == HeapObject::kMapOffset
             ? object_->map()
             : TaggedField<Object>::Relaxed_Load(cage_base, *object_, offset_);
@@ -913,7 +920,7 @@ class ObjectSlotValueDependency final : public CompilationDependency {
 
 class ElementsKindDependency final : public CompilationDependency {
  public:
-  ElementsKindDependency(const AllocationSiteRef& site, ElementsKind kind)
+  ElementsKindDependency(AllocationSiteRef site, ElementsKind kind)
       : CompilationDependency(kElementsKind), site_(site), kind_(kind) {
     DCHECK(AllocationSite::ShouldTrack(kind_));
   }
@@ -922,7 +929,7 @@ class ElementsKindDependency final : public CompilationDependency {
     Handle<AllocationSite> site = site_.object();
     ElementsKind kind =
         site->PointsToLiteral()
-            ? site->boilerplate(kAcquireLoad).map().elements_kind()
+            ? site->boilerplate(kAcquireLoad)->map()->elements_kind()
             : site->GetElementsKind();
     return kind_ == kind;
   }
@@ -951,8 +958,8 @@ class ElementsKindDependency final : public CompilationDependency {
 // GetOwnConstantElementFromHeap.
 class OwnConstantElementDependency final : public CompilationDependency {
  public:
-  OwnConstantElementDependency(const JSObjectRef& holder, uint32_t index,
-                               const ObjectRef& element)
+  OwnConstantElementDependency(JSObjectRef holder, uint32_t index,
+                               ObjectRef element)
       : CompilationDependency(kOwnConstantElement),
         holder_(holder),
         index_(index),
@@ -960,10 +967,10 @@ class OwnConstantElementDependency final : public CompilationDependency {
 
   bool IsValid(JSHeapBroker* broker) const override {
     DisallowGarbageCollection no_gc;
-    JSObject holder = *holder_.object();
-    base::Optional<Object> maybe_element =
-        holder_.GetOwnConstantElementFromHeap(broker, holder.elements(),
-                                              holder.GetElementsKind(), index_);
+    Tagged<JSObject> holder = *holder_.object();
+    base::Optional<Tagged<Object>> maybe_element =
+        holder_.GetOwnConstantElementFromHeap(
+            broker, holder->elements(), holder->GetElementsKind(), index_);
     if (!maybe_element.has_value()) return false;
 
     return maybe_element.value() == *element_.object();
@@ -989,10 +996,45 @@ class OwnConstantElementDependency final : public CompilationDependency {
   const ObjectRef element_;
 };
 
+class NoSlackTrackingChangeDependency final : public CompilationDependency {
+ public:
+  explicit NoSlackTrackingChangeDependency(MapRef map)
+      : CompilationDependency(kNoSlackTrackingChange), map_(map) {}
+
+  bool IsValid(JSHeapBroker* broker) const override {
+    if (map_.construction_counter() != 0 &&
+        map_.object()->construction_counter() == 0) {
+      // Slack tracking finished during compilation.
+      return false;
+    }
+    return map_.UnusedPropertyFields() ==
+               map_.object()->UnusedPropertyFields() &&
+           map_.GetInObjectProperties() ==
+               map_.object()->GetInObjectProperties();
+  }
+
+  void PrepareInstall(JSHeapBroker*) const override {}
+  void Install(JSHeapBroker*, PendingDependencies*) const override {}
+
+ private:
+  size_t Hash() const override {
+    ObjectRef::Hash h;
+    return base::hash_combine(h(map_));
+  }
+
+  bool Equals(const CompilationDependency* that) const override {
+    const NoSlackTrackingChangeDependency* const zat =
+        that->AsNoSlackTrackingChange();
+    return map_.equals(zat->map_);
+  }
+
+  const MapRef map_;
+};
+
 class InitialMapInstanceSizePredictionDependency final
     : public CompilationDependency {
  public:
-  InitialMapInstanceSizePredictionDependency(const JSFunctionRef& function,
+  InitialMapInstanceSizePredictionDependency(JSFunctionRef function,
                                              int instance_size)
       : CompilationDependency(kInitialMapInstanceSizePrediction),
         function_(function),
@@ -1014,8 +1056,9 @@ class InitialMapInstanceSizePredictionDependency final
 
   void Install(JSHeapBroker* broker, PendingDependencies* deps) const override {
     SLOW_DCHECK(IsValid(broker));
-    DCHECK(
-        !function_.object()->initial_map().IsInobjectSlackTrackingInProgress());
+    DCHECK(!function_.object()
+                ->initial_map()
+                ->IsInobjectSlackTrackingInProgress());
   }
 
  private:
@@ -1042,36 +1085,35 @@ void CompilationDependencies::RecordDependency(
   if (dependency != nullptr) dependencies_.insert(dependency);
 }
 
-MapRef CompilationDependencies::DependOnInitialMap(
-    const JSFunctionRef& function) {
+MapRef CompilationDependencies::DependOnInitialMap(JSFunctionRef function) {
   MapRef map = function.initial_map(broker_);
   RecordDependency(zone_->New<InitialMapDependency>(broker_, function, map));
   return map;
 }
 
-ObjectRef CompilationDependencies::DependOnPrototypeProperty(
-    const JSFunctionRef& function) {
-  ObjectRef prototype = function.instance_prototype(broker_);
+HeapObjectRef CompilationDependencies::DependOnPrototypeProperty(
+    JSFunctionRef function) {
+  HeapObjectRef prototype = function.instance_prototype(broker_);
   RecordDependency(
       zone_->New<PrototypePropertyDependency>(broker_, function, prototype));
   return prototype;
 }
 
-void CompilationDependencies::DependOnStableMap(const MapRef& map) {
+void CompilationDependencies::DependOnStableMap(MapRef map) {
   if (map.CanTransition()) {
     RecordDependency(zone_->New<StableMapDependency>(map));
   }
 }
 
 void CompilationDependencies::DependOnConstantInDictionaryPrototypeChain(
-    const MapRef& receiver_map, const NameRef& property_name,
-    const ObjectRef& constant, PropertyKind kind) {
+    MapRef receiver_map, NameRef property_name, ObjectRef constant,
+    PropertyKind kind) {
   RecordDependency(zone_->New<ConstantInDictionaryPrototypeChainDependency>(
       receiver_map, property_name, constant, kind));
 }
 
 AllocationType CompilationDependencies::DependOnPretenureMode(
-    const AllocationSiteRef& site) {
+    AllocationSiteRef site) {
   if (!v8_flags.allocation_site_pretenuring) return AllocationType::kYoung;
   AllocationType allocation = site.GetAllocationType();
   RecordDependency(zone_->New<PretenureModeDependency>(site, allocation));
@@ -1079,7 +1121,7 @@ AllocationType CompilationDependencies::DependOnPretenureMode(
 }
 
 PropertyConstness CompilationDependencies::DependOnFieldConstness(
-    const MapRef& map, InternalIndex descriptor) {
+    MapRef map, MapRef owner, InternalIndex descriptor) {
   PropertyConstness constness =
       map.GetPropertyDetails(broker_, descriptor).constness();
   if (constness == PropertyConstness::kMutable) return constness;
@@ -1096,18 +1138,18 @@ PropertyConstness CompilationDependencies::DependOnFieldConstness(
   }
 
   DCHECK_EQ(constness, PropertyConstness::kConst);
-  RecordDependency(zone_->New<FieldConstnessDependency>(map, descriptor));
+  RecordDependency(
+      zone_->New<FieldConstnessDependency>(map, owner, descriptor));
   return PropertyConstness::kConst;
 }
 
-void CompilationDependencies::DependOnGlobalProperty(
-    const PropertyCellRef& cell) {
+void CompilationDependencies::DependOnGlobalProperty(PropertyCellRef cell) {
   PropertyCellType type = cell.property_details().cell_type();
   bool read_only = cell.property_details().IsReadOnly();
   RecordDependency(zone_->New<GlobalPropertyDependency>(cell, type, read_only));
 }
 
-bool CompilationDependencies::DependOnProtector(const PropertyCellRef& cell) {
+bool CompilationDependencies::DependOnProtector(PropertyCellRef cell) {
   cell.CacheAsProtector(broker_);
   if (cell.value(broker_).AsSmi() != Protectors::kProtectorValid) return false;
   RecordDependency(zone_->New<ProtectorDependency>(cell));
@@ -1119,6 +1161,17 @@ bool CompilationDependencies::DependOnMegaDOMProtector() {
       MakeRef(broker_, broker_->isolate()->factory()->mega_dom_protector()));
 }
 
+bool CompilationDependencies::DependOnNoProfilingProtector() {
+  // A shortcut in case profiling was already enabled but the interrupt
+  // request to invalidate NoProfilingProtector wasn't processed yet.
+#ifdef V8_RUNTIME_CALL_STATS
+  if (TracingFlags::is_runtime_stats_enabled()) return false;
+#endif
+  if (broker_->isolate()->is_profiling()) return false;
+  return DependOnProtector(MakeRef(
+      broker_, broker_->isolate()->factory()->no_profiling_protector()));
+}
+
 bool CompilationDependencies::DependOnArrayBufferDetachingProtector() {
   return DependOnProtector(MakeRef(
       broker_,
@@ -1155,8 +1208,7 @@ bool CompilationDependencies::DependOnPromiseThenProtector() {
       broker_, broker_->isolate()->factory()->promise_then_protector()));
 }
 
-void CompilationDependencies::DependOnElementsKind(
-    const AllocationSiteRef& site) {
+void CompilationDependencies::DependOnElementsKind(AllocationSiteRef site) {
   ElementsKind kind =
       site.PointsToLiteral()
           ? site.boilerplate(broker_).value().map(broker_).elements_kind()
@@ -1166,27 +1218,29 @@ void CompilationDependencies::DependOnElementsKind(
   }
 }
 
-void CompilationDependencies::DependOnObjectSlotValue(
-    const HeapObjectRef& object, int offset, const ObjectRef& value) {
+void CompilationDependencies::DependOnObjectSlotValue(HeapObjectRef object,
+                                                      int offset,
+                                                      ObjectRef value) {
   RecordDependency(
       zone_->New<ObjectSlotValueDependency>(object, offset, value));
 }
 
-void CompilationDependencies::DependOnOwnConstantElement(
-    const JSObjectRef& holder, uint32_t index, const ObjectRef& element) {
+void CompilationDependencies::DependOnOwnConstantElement(JSObjectRef holder,
+                                                         uint32_t index,
+                                                         ObjectRef element) {
   RecordDependency(
       zone_->New<OwnConstantElementDependency>(holder, index, element));
 }
 
 void CompilationDependencies::DependOnOwnConstantDataProperty(
-    const JSObjectRef& holder, const MapRef& map, Representation representation,
-    FieldIndex index, const ObjectRef& value) {
+    JSObjectRef holder, MapRef map, Representation representation,
+    FieldIndex index, ObjectRef value) {
   RecordDependency(zone_->New<OwnConstantDataPropertyDependency>(
       broker_, holder, map, representation, index, value));
 }
 
 void CompilationDependencies::DependOnOwnConstantDictionaryProperty(
-    const JSObjectRef& holder, InternalIndex index, const ObjectRef& value) {
+    JSObjectRef holder, InternalIndex index, ObjectRef value) {
   RecordDependency(zone_->New<OwnConstantDictionaryPropertyDependency>(
       broker_, holder, index, value));
 }
@@ -1237,7 +1291,7 @@ bool CompilationDependencies::Commit(Handle<Code> code) {
   //    compilation saw a self-consistent state of the jsfunction.
   if (v8_flags.stress_gc_during_compilation) {
     broker_->isolate()->heap()->PreciseCollectAllGarbage(
-        Heap::kForcedGC, GarbageCollectionReason::kTesting, kNoGCCallbackFlags);
+        GCFlag::kForced, GarbageCollectionReason::kTesting, kNoGCCallbackFlags);
   }
 #ifdef DEBUG
   for (auto dep : dependencies_) {
@@ -1331,8 +1385,7 @@ void CompilationDependencies::DependOnStablePrototypeChain(
   }
 }
 
-void CompilationDependencies::DependOnElementsKinds(
-    const AllocationSiteRef& site) {
+void CompilationDependencies::DependOnElementsKinds(AllocationSiteRef site) {
   AllocationSiteRef current = site;
   while (true) {
     DependOnElementsKind(current);
@@ -1343,10 +1396,16 @@ void CompilationDependencies::DependOnElementsKinds(
 }
 
 void CompilationDependencies::DependOnConsistentJSFunctionView(
-    const JSFunctionRef& function) {
+    JSFunctionRef function) {
   RecordDependency(zone_->New<ConsistentJSFunctionViewDependency>(function));
 }
 
+void CompilationDependencies::DependOnNoSlackTrackingChange(MapRef map) {
+  if (map.construction_counter() == 0) return;
+  RecordDependency(zone_->New<NoSlackTrackingChangeDependency>(map));
+  return;
+}
+
 SlackTrackingPrediction::SlackTrackingPrediction(MapRef initial_map,
                                                  int instance_size)
     : instance_size_(instance_size),
@@ -1356,7 +1415,7 @@ SlackTrackingPrediction::SlackTrackingPrediction(MapRef initial_map,
 
 SlackTrackingPrediction
 CompilationDependencies::DependOnInitialMapInstanceSizePrediction(
-    const JSFunctionRef& function) {
+    JSFunctionRef function) {
   MapRef initial_map = DependOnInitialMap(function);
   int instance_size = function.InitialMapInstanceSizeWithMinSlack(broker_);
   // Currently, we always install the prediction dependency. If this turns out
@@ -1370,7 +1429,7 @@ CompilationDependencies::DependOnInitialMapInstanceSizePrediction(
 
 CompilationDependency const*
 CompilationDependencies::TransitionDependencyOffTheRecord(
-    const MapRef& target_map) const {
+    MapRef target_map) const {
   if (target_map.CanBeDeprecated()) {
     return zone_->New<TransitionDependency>(target_map);
   } else {
@@ -1381,16 +1440,16 @@ CompilationDependencies::TransitionDependencyOffTheRecord(
 
 CompilationDependency const*
 CompilationDependencies::FieldRepresentationDependencyOffTheRecord(
-    const MapRef& map, InternalIndex descriptor,
+    MapRef map, MapRef owner, InternalIndex descriptor,
     Representation representation) const {
-  return zone_->New<FieldRepresentationDependency>(map, descriptor,
+  return zone_->New<FieldRepresentationDependency>(map, owner, descriptor,
                                                    representation);
 }
 
 CompilationDependency const*
 CompilationDependencies::FieldTypeDependencyOffTheRecord(
-    const MapRef& map, InternalIndex descriptor, const ObjectRef& type) const {
-  return zone_->New<FieldTypeDependency>(map, descriptor, type);
+    MapRef map, MapRef owner, InternalIndex descriptor, ObjectRef type) const {
+  return zone_->New<FieldTypeDependency>(map, owner, descriptor, type);
 }
 
 #ifdef DEBUG
diff --git a/deps/v8/src/compiler/compilation-dependencies.h b/deps/v8/src/compiler/compilation-dependencies.h
index 45b320ce603006..305193836289f3 100644
--- a/deps/v8/src/compiler/compilation-dependencies.h
+++ b/deps/v8/src/compiler/compilation-dependencies.h
@@ -35,14 +35,20 @@ class V8_EXPORT_PRIVATE CompilationDependencies : public ZoneObject {
 
   // Return the initial map of {function} and record the assumption that it
   // stays the initial map.
-  MapRef DependOnInitialMap(const JSFunctionRef& function);
+  MapRef DependOnInitialMap(JSFunctionRef function);
 
   // Return the "prototype" property of the given function and record the
   // assumption that it doesn't change.
-  ObjectRef DependOnPrototypeProperty(const JSFunctionRef& function);
+  HeapObjectRef DependOnPrototypeProperty(JSFunctionRef function);
 
   // Record the assumption that {map} stays stable.
-  void DependOnStableMap(const MapRef& map);
+  void DependOnStableMap(MapRef map);
+
+  // Record the assumption that slack tracking for {map} doesn't change during
+  // compilation. This gives no guarantees about slack tracking changes after
+  // the compilation is finished (ie, it Validates the dependency, but doesn't
+  // Install anything).
+  void DependOnNoSlackTrackingChange(MapRef map);
 
   // Depend on the fact that accessing property |property_name| from
   // |receiver_map| yields the constant value |constant|, which is held by
@@ -53,14 +59,14 @@ class V8_EXPORT_PRIVATE CompilationDependencies : public ZoneObject {
   // If PropertyKind is kData, |constant| is the value of the property in
   // question. In case of PropertyKind::kAccessor, |constant| is the accessor
   // function (i.e., getter or setter) itself, not the overall AccessorPair.
-  void DependOnConstantInDictionaryPrototypeChain(const MapRef& receiver_map,
-                                                  const NameRef& property_name,
-                                                  const ObjectRef& constant,
+  void DependOnConstantInDictionaryPrototypeChain(MapRef receiver_map,
+                                                  NameRef property_name,
+                                                  ObjectRef constant,
                                                   PropertyKind kind);
 
   // Return the pretenure mode of {site} and record the assumption that it does
   // not change.
-  AllocationType DependOnPretenureMode(const AllocationSiteRef& site);
+  AllocationType DependOnPretenureMode(AllocationSiteRef site);
 
   // Return a field's constness and, if kConst, record the assumption that it
   // remains kConst. The field is identified by the arguments.
@@ -69,16 +75,16 @@ class V8_EXPORT_PRIVATE CompilationDependencies : public ZoneObject {
   // kConst if the map is stable (and register stability dependency in that
   // case).  This is to ensure that fast elements kind transitions cannot be
   // used to mutate fields without deoptimization of the dependent code.
-  PropertyConstness DependOnFieldConstness(const MapRef& map,
+  PropertyConstness DependOnFieldConstness(MapRef map, MapRef owner,
                                            InternalIndex descriptor);
 
   // Record the assumption that neither {cell}'s {CellType} changes, nor the
   // {IsReadOnly()} flag of {cell}'s {PropertyDetails}.
-  void DependOnGlobalProperty(const PropertyCellRef& cell);
+  void DependOnGlobalProperty(PropertyCellRef cell);
 
   // Return the validity of the given protector and, if true, record the
   // assumption that the protector remains valid.
-  bool DependOnProtector(const PropertyCellRef& cell);
+  bool DependOnProtector(PropertyCellRef cell);
 
   // Convenience wrappers around {DependOnProtector}.
   bool DependOnArrayBufferDetachingProtector();
@@ -89,30 +95,29 @@ class V8_EXPORT_PRIVATE CompilationDependencies : public ZoneObject {
   bool DependOnPromiseSpeciesProtector();
   bool DependOnPromiseThenProtector();
   bool DependOnMegaDOMProtector();
+  bool DependOnNoProfilingProtector();
 
   // Record the assumption that {site}'s {ElementsKind} doesn't change.
-  void DependOnElementsKind(const AllocationSiteRef& site);
+  void DependOnElementsKind(AllocationSiteRef site);
 
   // Check that an object slot will not change during compilation.
-  void DependOnObjectSlotValue(const HeapObjectRef& object, int offset,
-                               const ObjectRef& value);
+  void DependOnObjectSlotValue(HeapObjectRef object, int offset,
+                               ObjectRef value);
 
-  void DependOnOwnConstantElement(const JSObjectRef& holder, uint32_t index,
-                                  const ObjectRef& element);
+  void DependOnOwnConstantElement(JSObjectRef holder, uint32_t index,
+                                  ObjectRef element);
 
   // Record the assumption that the {value} read from {holder} at {index} on the
   // background thread is the correct value for a given property.
-  void DependOnOwnConstantDataProperty(const JSObjectRef& holder,
-                                       const MapRef& map,
+  void DependOnOwnConstantDataProperty(JSObjectRef holder, MapRef map,
                                        Representation representation,
-                                       FieldIndex index,
-                                       const ObjectRef& value);
+                                       FieldIndex index, ObjectRef value);
 
   // Record the assumption that the {value} read from {holder} at {index} on the
   // background thread is the correct value for a given dictionary property.
-  void DependOnOwnConstantDictionaryProperty(const JSObjectRef& holder,
+  void DependOnOwnConstantDictionaryProperty(JSObjectRef holder,
                                              InternalIndex index,
-                                             const ObjectRef& value);
+                                             ObjectRef value);
 
   // For each given map, depend on the stability of (the maps of) all prototypes
   // up to (and including) the {last_prototype}.
@@ -127,9 +132,9 @@ class V8_EXPORT_PRIVATE CompilationDependencies : public ZoneObject {
       OptionalJSObjectRef last_prototype = OptionalJSObjectRef());
 
   // Like DependOnElementsKind but also applies to all nested allocation sites.
-  void DependOnElementsKinds(const AllocationSiteRef& site);
+  void DependOnElementsKinds(AllocationSiteRef site);
 
-  void DependOnConsistentJSFunctionView(const JSFunctionRef& function);
+  void DependOnConsistentJSFunctionView(JSFunctionRef function);
 
   // Predict the final instance size for {function}'s initial map and record
   // the assumption that this prediction is correct. In addition, register
@@ -137,7 +142,7 @@ class V8_EXPORT_PRIVATE CompilationDependencies : public ZoneObject {
   // predicted minimum slack instance size count (wrapped together with
   // the corresponding in-object property count for convenience).
   SlackTrackingPrediction DependOnInitialMapInstanceSizePrediction(
-      const JSFunctionRef& function);
+      JSFunctionRef function);
 
   // Records {dependency} if not null.
   void RecordDependency(CompilationDependency const* dependency);
@@ -149,19 +154,19 @@ class V8_EXPORT_PRIVATE CompilationDependencies : public ZoneObject {
   // Gather the assumption that {target_map} can be transitioned to, i.e., that
   // it does not become deprecated.
   CompilationDependency const* TransitionDependencyOffTheRecord(
-      const MapRef& target_map) const;
+      MapRef target_map) const;
 
   // Gather the assumption that the field representation of a field does not
   // change. The field is identified by the arguments.
   CompilationDependency const* FieldRepresentationDependencyOffTheRecord(
-      const MapRef& map, InternalIndex descriptor,
+      MapRef map, MapRef owner, InternalIndex descriptor,
       Representation representation) const;
 
   // Gather the assumption that the field type of a field does not change. The
   // field is identified by the arguments.
   CompilationDependency const* FieldTypeDependencyOffTheRecord(
-      const MapRef& map, InternalIndex descriptor,
-      const ObjectRef& /* Contains a FieldType underneath. */ type) const;
+      MapRef map, MapRef owner, InternalIndex descriptor,
+      ObjectRef /* Contains a FieldType underneath. */ type) const;
 
 #ifdef DEBUG
   static bool IsFieldRepresentationDependencyOnMap(
diff --git a/deps/v8/src/compiler/compiler-source-position-table.h b/deps/v8/src/compiler/compiler-source-position-table.h
index 3b7978eafb10cf..a019458cb8e9d2 100644
--- a/deps/v8/src/compiler/compiler-source-position-table.h
+++ b/deps/v8/src/compiler/compiler-source-position-table.h
@@ -58,6 +58,7 @@ class V8_EXPORT_PRIVATE SourcePositionTable final
   SourcePosition GetCurrentPosition() const { return current_position_; }
 
   void Disable() { enabled_ = false; }
+  void Enable() { enabled_ = true; }
 
   bool IsEnabled() const { return enabled_; }
 
diff --git a/deps/v8/src/compiler/constant-folding-reducer.cc b/deps/v8/src/compiler/constant-folding-reducer.cc
index 14279b0b13ae74..8c19adae236a88 100644
--- a/deps/v8/src/compiler/constant-folding-reducer.cc
+++ b/deps/v8/src/compiler/constant-folding-reducer.cc
@@ -26,8 +26,10 @@ Node* TryGetConstant(JSGraph* jsgraph, Node* node, JSHeapBroker* broker) {
     result = jsgraph->MinusZeroConstant();
   } else if (type.Is(Type::NaN())) {
     result = jsgraph->NaNConstant();
-  } else if (type.Is(Type::Hole())) {
+  } else if (type.Is(Type::TheHole())) {
     result = jsgraph->TheHoleConstant();
+  } else if (type.Is(Type::PropertyCellHole())) {
+    result = jsgraph->PropertyCellHoleConstant();
   } else if (type.IsHeapConstant()) {
     result = jsgraph->Constant(type.AsHeapConstant()->Ref(), broker);
   } else if (type.Is(Type::PlainNumber()) && type.Min() == type.Max()) {
@@ -41,20 +43,6 @@ Node* TryGetConstant(JSGraph* jsgraph, Node* node, JSHeapBroker* broker) {
   return result;
 }
 
-bool IsAlreadyBeingFolded(Node* node) {
-  DCHECK(v8_flags.assert_types);
-  if (node->opcode() == IrOpcode::kFoldConstant) return true;
-  for (Edge edge : node->use_edges()) {
-    if (NodeProperties::IsValueEdge(edge) &&
-        edge.from()->opcode() == IrOpcode::kFoldConstant) {
-      // Note: {node} may have gained new value uses since the time it was
-      // "constant-folded", and theses uses should ideally be rewritten as well.
-      // For simplicity, we ignore them here.
-      return true;
-    }
-  }
-  return false;
-}
 }  // namespace
 
 ConstantFoldingReducer::ConstantFoldingReducer(Editor* editor, JSGraph* jsgraph,
@@ -71,22 +59,9 @@ Reduction ConstantFoldingReducer::Reduce(Node* node) {
     Node* constant = TryGetConstant(jsgraph(), node, broker());
     if (constant != nullptr) {
       DCHECK(NodeProperties::IsTyped(constant));
-      if (!v8_flags.assert_types) {
-        DCHECK_EQ(node->op()->ControlOutputCount(), 0);
-        ReplaceWithValue(node, constant);
-        return Replace(constant);
-      } else if (!IsAlreadyBeingFolded(node)) {
-        // Delay the constant folding (by inserting a FoldConstant operation
-        // instead) in order to keep type assertions meaningful.
-        Node* fold_constant = jsgraph()->graph()->NewNode(
-            jsgraph()->common()->FoldConstant(), node, constant);
-        DCHECK(NodeProperties::IsTyped(fold_constant));
-        ReplaceWithValue(node, fold_constant, node, node);
-        fold_constant->ReplaceInput(0, node);
-        DCHECK(IsAlreadyBeingFolded(node));
-        DCHECK(IsAlreadyBeingFolded(fold_constant));
-        return Changed(node);
-      }
+      DCHECK_EQ(node->op()->ControlOutputCount(), 0);
+      ReplaceWithValue(node, constant);
+      return Replace(constant);
     }
   }
   return NoChange();
diff --git a/deps/v8/src/compiler/control-equivalence.cc b/deps/v8/src/compiler/control-equivalence.cc
index f1708139626769..6ab93fd675339b 100644
--- a/deps/v8/src/compiler/control-equivalence.cc
+++ b/deps/v8/src/compiler/control-equivalence.cc
@@ -157,8 +157,8 @@ void ControlEquivalence::RunUndirectedDFS(Node* exit) {
     // Pop node from stack when done with all inputs and uses.
     DCHECK(entry.input == node->input_edges().end());
     DCHECK(entry.use == node->use_edges().end());
-    DFSPop(stack, node);
     VisitPost(node, entry.parent_node, entry.direction);
+    DFSPop(stack, node);
   }
 }
 
diff --git a/deps/v8/src/compiler/dead-code-elimination.cc b/deps/v8/src/compiler/dead-code-elimination.cc
index 170b3d89d63c47..e9bb74a9302571 100644
--- a/deps/v8/src/compiler/dead-code-elimination.cc
+++ b/deps/v8/src/compiler/dead-code-elimination.cc
@@ -247,11 +247,10 @@ Reduction DeadCodeElimination::ReduceEffectPhi(Node* node) {
       // phi nodes.
       Node* control = NodeProperties::GetControlInput(merge, i);
       Node* throw_node = graph_->NewNode(common_->Throw(), effect, control);
-      NodeProperties::MergeControlToEnd(graph_, common_, throw_node);
+      MergeControlToEnd(graph_, common_, throw_node);
       NodeProperties::ReplaceEffectInput(node, dead_, i);
       NodeProperties::ReplaceControlInput(merge, dead_, i);
       Revisit(merge);
-      Revisit(graph_->end());
       reduction = Changed(node);
     }
   }
@@ -356,7 +355,7 @@ Reduction DeadCodeElimination::ReduceBranchOrSwitch(Node* node) {
     // control chain, they might still appear in reachable code. Remove them by
     // always choosing the first projection.
     size_t const projection_cnt = node->op()->ControlOutputCount();
-    Node** projections = zone_->NewArray<Node*>(projection_cnt);
+    Node** projections = zone_->AllocateArray<Node*>(projection_cnt);
     NodeProperties::CollectControlProjections(node, projections,
                                               projection_cnt);
     Replace(projections[0], NodeProperties::GetControlInput(node));
diff --git a/deps/v8/src/compiler/decompression-optimizer.cc b/deps/v8/src/compiler/decompression-optimizer.cc
index 18e682a4fd5e53..084a08307e765e 100644
--- a/deps/v8/src/compiler/decompression-optimizer.cc
+++ b/deps/v8/src/compiler/decompression-optimizer.cc
@@ -5,6 +5,7 @@
 #include "src/compiler/decompression-optimizer.h"
 
 #include "src/compiler/graph.h"
+#include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
 
 namespace v8 {
@@ -42,8 +43,21 @@ bool IsTaggedPhi(Node* const node) {
   return false;
 }
 
+bool IsWord64BitwiseOp(Node* const node) {
+  return node->opcode() == IrOpcode::kWord64And ||
+         node->opcode() == IrOpcode::kWord64Or;
+}
+
 bool CanBeCompressed(Node* const node) {
-  return IsHeapConstant(node) || IsTaggedMachineLoad(node) || IsTaggedPhi(node);
+  return IsHeapConstant(node) || IsTaggedMachineLoad(node) ||
+         IsTaggedPhi(node) || IsWord64BitwiseOp(node);
+}
+
+void Replace(Node* const node, Node* const replacement) {
+  for (Edge edge : node->use_edges()) {
+    edge.UpdateTo(replacement);
+  }
+  node->Kill();
 }
 
 }  // anonymous namespace
@@ -73,6 +87,7 @@ void DecompressionOptimizer::MarkNodeInputs(Node* node) {
     // UNOPS.
     case IrOpcode::kBitcastTaggedToWord:
     case IrOpcode::kBitcastTaggedToWordForTagAndSmiBits:
+    case IrOpcode::kBitcastWordToTagged:
       // Replicate the bitcast's state for its input.
       DCHECK_EQ(node->op()->ValueInputCount(), 1);
       MaybeMarkAndQueueForRevisit(node->InputAt(0),
@@ -88,9 +103,10 @@ void DecompressionOptimizer::MarkNodeInputs(Node* node) {
     case IrOpcode::kInt32LessThanOrEqual:
     case IrOpcode::kUint32LessThan:
     case IrOpcode::kUint32LessThanOrEqual:
-    case IrOpcode::kWord32And:
     case IrOpcode::kWord32Equal:
-    case IrOpcode::kWord32Shl:
+#define Word32Op(Name) case IrOpcode::k##Name:
+      MACHINE_BINOP_32_LIST(Word32Op)
+#undef Word32Op
       DCHECK_EQ(node->op()->ValueInputCount(), 2);
       MaybeMarkAndQueueForRevisit(node->InputAt(0),
                                   State::kOnly32BitsObserved);  // value_0
@@ -120,10 +136,13 @@ void DecompressionOptimizer::MarkNodeInputs(Node* node) {
       break;
     // SPECIAL CASES - Store.
     case IrOpcode::kStore:
+    case IrOpcode::kStorePair:
     case IrOpcode::kProtectedStore:
     case IrOpcode::kStoreTrapOnNull:
     case IrOpcode::kUnalignedStore: {
-      DCHECK_EQ(node->op()->ValueInputCount(), 3);
+      DCHECK(node->op()->ValueInputCount() == 3 ||
+             (node->opcode() == IrOpcode::kStorePair &&
+              node->op()->ValueInputCount() == 4));
       MaybeMarkAndQueueForRevisit(node->InputAt(0),
                                   State::kEverythingObserved);  // base pointer
       MaybeMarkAndQueueForRevisit(node->InputAt(1),
@@ -131,28 +150,52 @@ void DecompressionOptimizer::MarkNodeInputs(Node* node) {
       // TODO(v8:7703): When the implementation is done, check if this ternary
       // operator is too restrictive, since we only mark Tagged stores as 32
       // bits.
-      MachineRepresentation representation =
-          node->opcode() == IrOpcode::kUnalignedStore
-              ? UnalignedStoreRepresentationOf(node->op())
-              : StoreRepresentationOf(node->op()).representation();
-      MaybeMarkAndQueueForRevisit(node->InputAt(2),
-                                  IsAnyTagged(representation)
-                                      ? State::kOnly32BitsObserved
-                                      : State::kEverythingObserved);  // value
+      MachineRepresentation representation;
+      if (node->opcode() == IrOpcode::kUnalignedStore) {
+        representation = UnalignedStoreRepresentationOf(node->op());
+      } else if (node->opcode() == IrOpcode::kStorePair) {
+        representation =
+            StorePairRepresentationOf(node->op()).first.representation();
+      } else {
+        representation = StoreRepresentationOf(node->op()).representation();
+      }
+      State observed = ElementSizeLog2Of(representation) <= 2
+                           ? State::kOnly32BitsObserved
+                           : State::kEverythingObserved;
+      // Special case, if we're storing this value as an indirect pointer, then
+      // we need access to all pointer bits since we'll also perform a load (of
+      // the 'self' indirect pointer) from the value being stored.
+      if (representation == MachineRepresentation::kIndirectPointer) {
+        observed = State::kEverythingObserved;
+      }
+      MaybeMarkAndQueueForRevisit(node->InputAt(2), observed);  // value
+      if (node->opcode() == IrOpcode::kStorePair) {
+        MaybeMarkAndQueueForRevisit(node->InputAt(3), observed);  // value 2
+      }
     } break;
     // SPECIAL CASES - Variable inputs.
     // The deopt code knows how to handle Compressed inputs, both
     // MachineRepresentation kCompressed values and CompressedHeapConstants.
     case IrOpcode::kFrameState:  // Fall through.
-    // TODO(v8:7703): kStateValues doesn't appear in any test linked to Loads or
-    // HeapConstants. Do we care about this case?
-    case IrOpcode::kStateValues:  // Fall through.
-    case IrOpcode::kTypedStateValues:
+    case IrOpcode::kStateValues:
       for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
+        // TODO(chromium:1470602): We assume that kStateValues has only tagged
+        // inputs so it is safe to mark them as kOnly32BitsObserved.
+        DCHECK(!IsWord64BitwiseOp(node->InputAt(i)));
         MaybeMarkAndQueueForRevisit(node->InputAt(i),
                                     State::kOnly32BitsObserved);
       }
       break;
+    case IrOpcode::kTypedStateValues: {
+      const ZoneVector<MachineType>* machine_types = MachineTypesOf(node->op());
+      for (int i = 0; i < node->op()->ValueInputCount(); ++i) {
+        State observed = IsAnyTagged(machine_types->at(i).representation())
+                             ? State::kOnly32BitsObserved
+                             : State::kEverythingObserved;
+        MaybeMarkAndQueueForRevisit(node->InputAt(i), observed);
+      }
+      break;
+    }
     case IrOpcode::kPhi: {
       // Replicate the phi's state for its inputs.
       State curr_state = states_.Get(node);
@@ -281,6 +324,50 @@ void DecompressionOptimizer::ChangeLoad(Node* const node) {
   }
 }
 
+void DecompressionOptimizer::ChangeWord64BitwiseOp(Node* const node,
+                                                   const Operator* new_op) {
+  Int64Matcher mleft(node->InputAt(0));
+  Int64Matcher mright(node->InputAt(1));
+
+  // Replace inputs.
+  if (mleft.IsChangeInt32ToInt64() || mleft.IsChangeUint32ToUint64()) {
+    node->ReplaceInput(0, mleft.node()->InputAt(0));
+  } else if (mleft.IsInt64Constant()) {
+    node->ReplaceInput(0, graph()->NewNode(common()->Int32Constant(
+                              static_cast<int32_t>(mleft.ResolvedValue()))));
+  } else {
+    node->ReplaceInput(
+        0, graph()->NewNode(machine()->TruncateInt64ToInt32(), mleft.node()));
+  }
+  if (mright.IsChangeInt32ToInt64() || mright.IsChangeUint32ToUint64()) {
+    node->ReplaceInput(1, mright.node()->InputAt(0));
+  } else if (mright.IsInt64Constant()) {
+    node->ReplaceInput(1, graph()->NewNode(common()->Int32Constant(
+                              static_cast<int32_t>(mright.ResolvedValue()))));
+  } else {
+    node->ReplaceInput(
+        1, graph()->NewNode(machine()->TruncateInt64ToInt32(), mright.node()));
+  }
+
+  // Replace uses.
+  Node* replacement = nullptr;
+  for (Edge edge : node->use_edges()) {
+    Node* user = edge.from();
+    if (user->opcode() == IrOpcode::kTruncateInt64ToInt32) {
+      Replace(user, node);
+    } else {
+      if (replacement == nullptr) {
+        replacement =
+            graph()->NewNode(machine()->BitcastWord32ToWord64(), node);
+      }
+      edge.UpdateTo(replacement);
+    }
+  }
+
+  // Change operator.
+  NodeProperties::ChangeOp(node, new_op);
+}
+
 void DecompressionOptimizer::ChangeNodes() {
   for (Node* const node : compressed_candidate_nodes_) {
     // compressed_candidate_nodes_ contains all the nodes that once had the
@@ -297,6 +384,12 @@ void DecompressionOptimizer::ChangeNodes() {
       case IrOpcode::kPhi:
         ChangePhi(node);
         break;
+      case IrOpcode::kWord64And:
+        ChangeWord64BitwiseOp(node, machine()->Word32And());
+        break;
+      case IrOpcode::kWord64Or:
+        ChangeWord64BitwiseOp(node, machine()->Word32Or());
+        break;
       default:
         ChangeLoad(node);
         break;
diff --git a/deps/v8/src/compiler/decompression-optimizer.h b/deps/v8/src/compiler/decompression-optimizer.h
index 0ebeedae723517..213e30a9cdca91 100644
--- a/deps/v8/src/compiler/decompression-optimizer.h
+++ b/deps/v8/src/compiler/decompression-optimizer.h
@@ -69,6 +69,9 @@ class V8_EXPORT_PRIVATE DecompressionOptimizer final {
   // Change node's load into a compressed one.
   void ChangeLoad(Node* const node);
 
+  // Change node's 64-bit bitwise operator into a compressed one.
+  void ChangeWord64BitwiseOp(Node* const node, const Operator* new_op);
+
   // Go through the already marked nodes and changed the operation for the nodes
   // that can use compressed outputs.
   void ChangeNodes();
diff --git a/deps/v8/src/compiler/effect-control-linearizer.cc b/deps/v8/src/compiler/effect-control-linearizer.cc
index 0b50f3e14f3412..67572a86125766 100644
--- a/deps/v8/src/compiler/effect-control-linearizer.cc
+++ b/deps/v8/src/compiler/effect-control-linearizer.cc
@@ -258,8 +258,7 @@ class EffectControlLinearizer {
   void LowerTransitionAndStoreNumberElement(Node* node);
   void LowerTransitionAndStoreNonNumberElement(Node* node);
   void LowerRuntimeAbort(Node* node);
-  Node* LowerAssertType(Node* node);
-  Node* LowerFoldConstant(Node* node);
+  void LowerAssertType(Node* node);
   Node* LowerConvertReceiver(Node* node);
   Node* LowerDateNow(Node* node);
   Node* LowerDoubleArrayMinMax(Node* node);
@@ -270,6 +269,11 @@ class EffectControlLinearizer {
   Maybe<Node*> LowerFloat64RoundTiesEven(Node* node);
   Maybe<Node*> LowerFloat64RoundTruncate(Node* node);
 
+  // Lowering of Wasm-specific operators.
+#if V8_ENABLE_WEBASSEMBLY
+  void LowerWasmTrap(Node* node, Node* frame_state);
+#endif
+
   Node* AllocateHeapNumberWithValue(Node* node);
   Node* BuildCheckedFloat64ToInt32(CheckForMinusZeroMode mode,
                                    const FeedbackSource& feedback, Node* value,
@@ -312,9 +316,13 @@ class EffectControlLinearizer {
   Node* ChangeTaggedInt32ToSmi(Node* value);
   Node* ChangeInt32ToIntPtr(Node* value);
   Node* ChangeInt32ToTagged(Node* value);
+  Node* ChangeInt64ToBigInt(Node* value);
   Node* ChangeInt64ToSmi(Node* value);
+  Node* ChangeInt64ToTagged(Node* value);
   Node* ChangeIntPtrToInt32(Node* value);
   Node* ChangeIntPtrToSmi(Node* value);
+  Node* ChangeUint64ToBigInt(Node* value);
+  Node* ChangeUint64ToTagged(Node* value);
   Node* ChangeUint32ToUintPtr(Node* value);
   Node* ChangeUint32ToSmi(Node* value);
   Node* ChangeUint32ToTagged(Node* value);
@@ -325,11 +333,6 @@ class EffectControlLinearizer {
   Node* JSAnyIsNotPrimitiveHeapObject(Node* value, Node* map = nullptr);
   Node* LoadFromSeqString(Node* receiver, Node* position, Node* is_one_byte);
   Node* TruncateWordToInt32(Node* value);
-  Node* MakeWeakForComparison(Node* heap_object);
-  Node* BuildIsWeakReferenceTo(Node* maybe_object, Node* value);
-  Node* BuildIsClearedWeakReference(Node* maybe_object);
-  Node* BuildIsStrongReference(Node* value);
-  Node* BuildStrongReferenceFromWeakReference(Node* value);
   Node* SmiMaxValueConstant();
   Node* SmiShiftBitsConstant();
 
@@ -602,7 +605,7 @@ void TryCloneBranch(Node* node, BasicBlock* block, Zone* temp_zone,
   BranchHint const hint = BranchHintOf(branch->op());
   int const input_count = merge->op()->ControlInputCount();
   DCHECK_LE(1, input_count);
-  Node** const inputs = graph->zone()->NewArray<Node*>(2 * input_count);
+  Node** const inputs = graph->zone()->AllocateArray<Node*>(2 * input_count);
   Node** const merge_true_inputs = &inputs[0];
   Node** const merge_false_inputs = &inputs[input_count];
   for (int index = 0; index < input_count; ++index) {
@@ -948,8 +951,16 @@ void EffectControlLinearizer::ProcessNode(Node* node, Node** frame_state) {
   // point. We zap the frame state to ensure this invariant is maintained.
   if (region_observability_ == RegionObservability::kObservable &&
       !node->op()->HasProperty(Operator::kNoWrite)) {
-    *frame_state = nullptr;
-    frame_state_zapper_ = node;
+    if (V8_UNLIKELY(node->opcode() == IrOpcode::kCheckMaps ||
+                    node->opcode() == IrOpcode::kTransitionElementsKind)) {
+      // These side effects are not JS-observable so we can keep the
+      // FrameState, when we don't lower those nodes here, but in the Turboshaft
+      // pipeline.
+      DCHECK(v8_flags.turboshaft);
+    } else {
+      *frame_state = nullptr;
+      frame_state_zapper_ = node;
+    }
   }
 
   // Remove the end markers of 'atomic' allocation region because the
@@ -1082,6 +1093,7 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerChangeTaggedToFloat64(node);
       break;
     case IrOpcode::kChangeTaggedToTaggedSigned:
+      if (v8_flags.turboshaft) return false;
       result = LowerChangeTaggedToTaggedSigned(node);
       break;
     case IrOpcode::kTruncateTaggedToBit:
@@ -1097,12 +1109,21 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerTruncateTaggedToFloat64(node);
       break;
     case IrOpcode::kCheckClosure:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerCheckClosure(node, frame_state);
       break;
     case IrOpcode::kCheckMaps:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       LowerCheckMaps(node, frame_state);
       break;
     case IrOpcode::kCompareMaps:
+      if (v8_flags.turboshaft) return false;
       result = LowerCompareMaps(node);
       break;
     case IrOpcode::kCheckNumber:
@@ -1162,6 +1183,10 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerCheckInternalizedString(node, frame_state);
       break;
     case IrOpcode::kCheckIf:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       LowerCheckIf(node, frame_state);
       break;
     case IrOpcode::kCheckedInt32Add:
@@ -1270,6 +1295,15 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerCheckedInt64ToTaggedSigned(node, frame_state);
       break;
     case IrOpcode::kCheckedUint32Bounds:
+      if (v8_flags.turboshaft) {
+        // We do have a {frame_state} iff we do actually need it for a deopt
+        // (`kAbortOnOutOfBounds` is not set).
+        DCHECK_IMPLIES(!(CheckBoundsParametersOf(node->op()).flags() &
+                         CheckBoundsFlag::kAbortOnOutOfBounds),
+                       frame_state != nullptr);
+        if (frame_state) gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerCheckedUint32Bounds(node, frame_state);
       break;
     case IrOpcode::kCheckedUint32ToInt32:
@@ -1287,6 +1321,15 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerCheckedUint32ToTaggedSigned(node, frame_state);
       break;
     case IrOpcode::kCheckedUint64Bounds:
+      if (v8_flags.turboshaft) {
+        // We do have a {frame_state} iff we do actually need it for a deopt
+        // (`kAbortOnOutOfBounds` is not set).
+        DCHECK_IMPLIES(!(CheckBoundsParametersOf(node->op()).flags() &
+                         CheckBoundsFlag::kAbortOnOutOfBounds),
+                       frame_state != nullptr);
+        if (frame_state) gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerCheckedUint64Bounds(node, frame_state);
       break;
     case IrOpcode::kCheckedUint64ToInt32:
@@ -1357,9 +1400,17 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerCheckedTaggedToFloat64(node, frame_state);
       break;
     case IrOpcode::kCheckedTaggedToTaggedSigned:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerCheckedTaggedToTaggedSigned(node, frame_state);
       break;
     case IrOpcode::kCheckedTaggedToTaggedPointer:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerCheckedTaggedToTaggedPointer(node, frame_state);
       break;
     case IrOpcode::kCheckBigInt:
@@ -1402,9 +1453,14 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerTruncateTaggedToWord32(node);
       break;
     case IrOpcode::kCheckedTruncateTaggedToWord32:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerCheckedTruncateTaggedToWord32(node, frame_state);
       break;
     case IrOpcode::kNumberToString:
+      if (v8_flags.turboshaft) return false;
       result = LowerNumberToString(node);
       break;
     case IrOpcode::kObjectIsArrayBufferView:
@@ -1428,12 +1484,15 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerObjectIsDetectableCallable(node);
       break;
     case IrOpcode::kObjectIsMinusZero:
+      if (v8_flags.turboshaft) return false;
       result = LowerObjectIsMinusZero(node);
       break;
     case IrOpcode::kNumberIsMinusZero:
+      if (v8_flags.turboshaft) return false;
       result = LowerNumberIsMinusZero(node);
       break;
     case IrOpcode::kObjectIsNaN:
+      if (v8_flags.turboshaft) return false;
       result = LowerObjectIsNaN(node);
       break;
     case IrOpcode::kNumberIsNaN:
@@ -1469,15 +1528,19 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerObjectIsUndetectable(node);
       break;
     case IrOpcode::kArgumentsLength:
+      if (v8_flags.turboshaft) return false;
       result = LowerArgumentsLength(node);
       break;
     case IrOpcode::kRestLength:
+      if (v8_flags.turboshaft) return false;
       result = LowerRestLength(node);
       break;
     case IrOpcode::kToBoolean:
+      if (v8_flags.turboshaft) return false;
       result = LowerToBoolean(node);
       break;
     case IrOpcode::kTypeOf:
+      if (v8_flags.turboshaft) return false;
       result = LowerTypeOf(node);
       break;
     case IrOpcode::kNewDoubleElements:
@@ -1489,6 +1552,7 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerNewSmiOrObjectElements(node);
       break;
     case IrOpcode::kNewArgumentsElements:
+      if (v8_flags.turboshaft) return false;
       result = LowerNewArgumentsElements(node);
       break;
     case IrOpcode::kNewConsString:
@@ -1496,18 +1560,23 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerNewConsString(node);
       break;
     case IrOpcode::kSameValue:
+      if (v8_flags.turboshaft) return false;
       result = LowerSameValue(node);
       break;
     case IrOpcode::kSameValueNumbersOnly:
+      if (v8_flags.turboshaft) return false;
       result = LowerSameValueNumbersOnly(node);
       break;
     case IrOpcode::kNumberSameValue:
+      if (v8_flags.turboshaft) return false;
       result = LowerNumberSameValue(node);
       break;
     case IrOpcode::kDeadValue:
+      if (v8_flags.turboshaft) return false;
       result = LowerDeadValue(node);
       break;
     case IrOpcode::kStringConcat:
+      if (v8_flags.turboshaft) return false;
       result = LowerStringConcat(node);
       break;
     case IrOpcode::kStringFromSingleCharCode:
@@ -1531,6 +1600,7 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerStringLength(node);
       break;
     case IrOpcode::kStringToNumber:
+      if (v8_flags.turboshaft) return false;
       result = LowerStringToNumber(node);
       break;
     case IrOpcode::kStringCharCodeAt:
@@ -1655,36 +1725,56 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerBigIntNegate(node);
       break;
     case IrOpcode::kNumberIsFloat64Hole:
+      if (v8_flags.turboshaft) return false;
       result = LowerNumberIsFloat64Hole(node);
       break;
     case IrOpcode::kNumberIsFinite:
+      if (v8_flags.turboshaft) return false;
       result = LowerNumberIsFinite(node);
       break;
     case IrOpcode::kObjectIsFiniteNumber:
+      if (v8_flags.turboshaft) return false;
       result = LowerObjectIsFiniteNumber(node);
       break;
     case IrOpcode::kNumberIsInteger:
+      if (v8_flags.turboshaft) return false;
       result = LowerNumberIsInteger(node);
       break;
     case IrOpcode::kObjectIsInteger:
+      if (v8_flags.turboshaft) return false;
       result = LowerObjectIsInteger(node);
       break;
     case IrOpcode::kNumberIsSafeInteger:
+      if (v8_flags.turboshaft) return false;
       result = LowerNumberIsSafeInteger(node);
       break;
     case IrOpcode::kObjectIsSafeInteger:
+      if (v8_flags.turboshaft) return false;
       result = LowerObjectIsSafeInteger(node);
       break;
     case IrOpcode::kCheckFloat64Hole:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerCheckFloat64Hole(node, frame_state);
       break;
     case IrOpcode::kCheckNotTaggedHole:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerCheckNotTaggedHole(node, frame_state);
       break;
     case IrOpcode::kConvertTaggedHoleToUndefined:
+      if (v8_flags.turboshaft) return false;
       result = LowerConvertTaggedHoleToUndefined(node);
       break;
     case IrOpcode::kCheckEqualsInternalizedString:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       LowerCheckEqualsInternalizedString(node, frame_state);
       break;
     case IrOpcode::kAllocate:
@@ -1692,33 +1782,52 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerAllocate(node);
       break;
     case IrOpcode::kCheckEqualsSymbol:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       LowerCheckEqualsSymbol(node, frame_state);
       break;
     case IrOpcode::kPlainPrimitiveToNumber:
+      if (v8_flags.turboshaft) return false;
       result = LowerPlainPrimitiveToNumber(node);
       break;
     case IrOpcode::kPlainPrimitiveToWord32:
+      if (v8_flags.turboshaft) return false;
       result = LowerPlainPrimitiveToWord32(node);
       break;
     case IrOpcode::kPlainPrimitiveToFloat64:
+      if (v8_flags.turboshaft) return false;
       result = LowerPlainPrimitiveToFloat64(node);
       break;
     case IrOpcode::kEnsureWritableFastElements:
+      if (v8_flags.turboshaft) return false;
       result = LowerEnsureWritableFastElements(node);
       break;
     case IrOpcode::kMaybeGrowFastElements:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerMaybeGrowFastElements(node, frame_state);
       break;
     case IrOpcode::kTransitionElementsKind:
+      if (v8_flags.turboshaft) return false;
       LowerTransitionElementsKind(node);
       break;
     case IrOpcode::kLoadMessage:
+      if (v8_flags.turboshaft) return false;
       result = LowerLoadMessage(node);
       break;
     case IrOpcode::kStoreMessage:
+      if (v8_flags.turboshaft) return false;
       LowerStoreMessage(node);
       break;
     case IrOpcode::kFastApiCall:
+      if (v8_flags.turboshaft) {
+        gasm()->Checkpoint(FrameState{frame_state});
+        return false;
+      }
       result = LowerFastApiCall(node);
       break;
     case IrOpcode::kLoadFieldByIndex:
@@ -1726,81 +1835,107 @@ bool EffectControlLinearizer::TryWireInStateEffect(Node* node,
       result = LowerLoadFieldByIndex(node);
       break;
     case IrOpcode::kLoadTypedElement:
+      if (v8_flags.turboshaft) return false;
       result = LowerLoadTypedElement(node);
       break;
     case IrOpcode::kLoadDataViewElement:
+      if (v8_flags.turboshaft) return false;
       result = LowerLoadDataViewElement(node);
       break;
     case IrOpcode::kLoadStackArgument:
+      if (v8_flags.turboshaft) return false;
       result = LowerLoadStackArgument(node);
       break;
     case IrOpcode::kStoreTypedElement:
+      if (v8_flags.turboshaft) return false;
       LowerStoreTypedElement(node);
       break;
     case IrOpcode::kStoreDataViewElement:
+      if (v8_flags.turboshaft) return false;
       LowerStoreDataViewElement(node);
       break;
     case IrOpcode::kStoreSignedSmallElement:
+      if (v8_flags.turboshaft) return false;
       LowerStoreSignedSmallElement(node);
       break;
     case IrOpcode::kFindOrderedHashMapEntry:
+      if (v8_flags.turboshaft) return false;
       result = LowerFindOrderedHashMapEntry(node);
       break;
     case IrOpcode::kFindOrderedHashMapEntryForInt32Key:
+      if (v8_flags.turboshaft) return false;
       result = LowerFindOrderedHashMapEntryForInt32Key(node);
       break;
     case IrOpcode::kFindOrderedHashSetEntry:
+      if (v8_flags.turboshaft) return false;
       result = LowerFindOrderedHashSetEntry(node);
       break;
     case IrOpcode::kTransitionAndStoreNumberElement:
+      if (v8_flags.turboshaft) return false;
       LowerTransitionAndStoreNumberElement(node);
       break;
     case IrOpcode::kTransitionAndStoreNonNumberElement:
+      if (v8_flags.turboshaft) return false;
       LowerTransitionAndStoreNonNumberElement(node);
       break;
     case IrOpcode::kTransitionAndStoreElement:
+      if (v8_flags.turboshaft) return false;
       LowerTransitionAndStoreElement(node);
       break;
     case IrOpcode::kRuntimeAbort:
+      if (v8_flags.turboshaft) return false;
       LowerRuntimeAbort(node);
       break;
     case IrOpcode::kAssertType:
-      result = LowerAssertType(node);
+      if (v8_flags.turboshaft) return false;
+      LowerAssertType(node);
       break;
     case IrOpcode::kConvertReceiver:
+      if (v8_flags.turboshaft) return false;
       result = LowerConvertReceiver(node);
       break;
     case IrOpcode::kFloat64RoundUp:
+      if (v8_flags.turboshaft) return false;
       if (!LowerFloat64RoundUp(node).To(&result)) {
         return false;
       }
       break;
     case IrOpcode::kFloat64RoundDown:
+      if (v8_flags.turboshaft) return false;
       if (!LowerFloat64RoundDown(node).To(&result)) {
         return false;
       }
       break;
     case IrOpcode::kFloat64RoundTruncate:
+      if (v8_flags.turboshaft) return false;
       if (!LowerFloat64RoundTruncate(node).To(&result)) {
         return false;
       }
       break;
     case IrOpcode::kFloat64RoundTiesEven:
+      if (v8_flags.turboshaft) return false;
       if (!LowerFloat64RoundTiesEven(node).To(&result)) {
         return false;
       }
       break;
     case IrOpcode::kDateNow:
+      if (v8_flags.turboshaft) return false;
       result = LowerDateNow(node);
       break;
-    case IrOpcode::kFoldConstant:
-      result = LowerFoldConstant(node);
-      break;
     case IrOpcode::kDoubleArrayMax:
     case IrOpcode::kDoubleArrayMin:
       if (v8_flags.turboshaft) return false;
       result = LowerDoubleArrayMinMax(node);
       break;
+#if V8_ENABLE_WEBASSEMBLY
+    case IrOpcode::kTrapIf:
+    case IrOpcode::kTrapUnless:
+      LowerWasmTrap(node, frame_state);
+      return false;
+    case IrOpcode::kLoadTrapOnNull:
+    case IrOpcode::kStoreTrapOnNull:
+      FATAL("Inlined wasm code may not use trap handler instructions");
+#endif
     default:
       return false;
   }
@@ -1937,26 +2072,7 @@ Node* EffectControlLinearizer::LowerChangeInt64ToTagged(Node* node) {
   DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
 
-  auto if_not_in_smi_range = __ MakeDeferredLabel();
-  auto done = __ MakeLabel(MachineRepresentation::kTagged);
-
-  Node* value32 = __ TruncateInt64ToInt32(value);
-  __ GotoIfNot(__ Word64Equal(__ ChangeInt32ToInt64(value32), value),
-               &if_not_in_smi_range);
-
-  if (SmiValuesAre32Bits()) {
-    Node* value_smi = ChangeInt64ToSmi(value);
-    __ Goto(&done, value_smi);
-  } else {
-    SmiTagOrOverflow(value32, &if_not_in_smi_range, &done);
-  }
-
-  __ Bind(&if_not_in_smi_range);
-  Node* number = AllocateHeapNumberWithValue(__ ChangeInt64ToFloat64(value));
-  __ Goto(&done, number);
-
-  __ Bind(&done);
-  return done.PhiAt(0);
+  return ChangeInt64ToTagged(value);
 }
 
 Node* EffectControlLinearizer::LowerChangeUint32ToTagged(Node* node) {
@@ -1986,21 +2102,7 @@ Node* EffectControlLinearizer::LowerChangeUint64ToTagged(Node* node) {
   DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
 
-  auto if_not_in_smi_range = __ MakeDeferredLabel();
-  auto done = __ MakeLabel(MachineRepresentation::kTagged);
-
-  Node* check =
-      __ Uint64LessThanOrEqual(value, __ Int64Constant(Smi::kMaxValue));
-  __ GotoIfNot(check, &if_not_in_smi_range);
-  __ Goto(&done, ChangeInt64ToSmi(value));
-
-  __ Bind(&if_not_in_smi_range);
-  Node* number = AllocateHeapNumberWithValue(__ ChangeInt64ToFloat64(value));
-
-  __ Goto(&done, number);
-  __ Bind(&done);
-
-  return done.PhiAt(0);
+  return ChangeUint64ToTagged(value);
 }
 
 Node* EffectControlLinearizer::LowerChangeTaggedSignedToInt32(Node* node) {
@@ -2183,6 +2285,7 @@ Node* EffectControlLinearizer::LowerChangeTaggedToFloat64(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerChangeTaggedToTaggedSigned(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
 
   auto if_not_smi = __ MakeDeferredLabel();
@@ -2229,6 +2332,7 @@ Node* EffectControlLinearizer::LowerTruncateTaggedToFloat64(Node* node) {
 
 Node* EffectControlLinearizer::LowerCheckClosure(Node* node,
                                                  Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Handle<FeedbackCell> feedback_cell = FeedbackCellOf(node->op());
   Node* value = node->InputAt(0);
 
@@ -2276,10 +2380,11 @@ void EffectControlLinearizer::MigrateInstanceOrDeopt(
 }
 
 void EffectControlLinearizer::LowerCheckMaps(Node* node, Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   CheckMapsParameters const& p = CheckMapsParametersOf(node->op());
   Node* value = node->InputAt(0);
 
-  ZoneHandleSet<Map> const& maps = p.maps();
+  ZoneRefSet<Map> const& maps = p.maps();
   size_t const map_count = maps.size();
 
   if (p.flags() & CheckMapsFlag::kTryMigrateInstance) {
@@ -2291,7 +2396,7 @@ void EffectControlLinearizer::LowerCheckMaps(Node* node, Node* frame_state) {
 
     // Perform the map checks.
     for (size_t i = 0; i < map_count; ++i) {
-      Node* map = __ HeapConstant(maps[i]);
+      Node* map = __ HeapConstant(maps[i].object());
       Node* check = __ TaggedEqual(value_map, map);
       if (i == map_count - 1) {
         __ BranchWithCriticalSafetyCheck(check, &done, &migrate);
@@ -2312,7 +2417,7 @@ void EffectControlLinearizer::LowerCheckMaps(Node* node, Node* frame_state) {
 
     // Perform the map checks again.
     for (size_t i = 0; i < map_count; ++i) {
-      Node* map = __ HeapConstant(maps[i]);
+      Node* map = __ HeapConstant(maps[i].object());
       Node* check = __ TaggedEqual(value_map, map);
       if (i == map_count - 1) {
         __ DeoptimizeIfNot(DeoptimizeReason::kWrongMap, p.feedback(), check,
@@ -2333,7 +2438,7 @@ void EffectControlLinearizer::LowerCheckMaps(Node* node, Node* frame_state) {
     Node* value_map = __ LoadField(AccessBuilder::ForMap(), value);
 
     for (size_t i = 0; i < map_count; ++i) {
-      Node* map = __ HeapConstant(maps[i]);
+      Node* map = __ HeapConstant(maps[i].object());
       Node* check = __ TaggedEqual(value_map, map);
 
       if (i == map_count - 1) {
@@ -2383,7 +2488,8 @@ Node* EffectControlLinearizer::CallBuiltinForBigIntBinop(Node* left,
 }
 
 Node* EffectControlLinearizer::LowerCompareMaps(Node* node) {
-  ZoneHandleSet<Map> const& maps = CompareMapsParametersOf(node->op());
+  DCHECK(!v8_flags.turboshaft);
+  ZoneRefSet<Map> const& maps = CompareMapsParametersOf(node->op());
   size_t const map_count = maps.size();
   Node* value = node->InputAt(0);
 
@@ -2393,7 +2499,7 @@ Node* EffectControlLinearizer::LowerCompareMaps(Node* node) {
   Node* value_map = __ LoadField(AccessBuilder::ForMap(), value);
 
   for (size_t i = 0; i < map_count; ++i) {
-    Node* map = __ HeapConstant(maps[i]);
+    Node* map = __ HeapConstant(maps[i].object());
     Node* check = __ TaggedEqual(value_map, map);
 
     auto next_map = __ MakeLabel();
@@ -2529,6 +2635,7 @@ Node* EffectControlLinearizer::LowerCheckInternalizedString(Node* node,
 }
 
 void EffectControlLinearizer::LowerCheckIf(Node* node, Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
   const CheckIfParameters& p = CheckIfParametersOf(node->op());
   __ DeoptimizeIfNot(p.reason(), p.feedback(), value, frame_state);
@@ -2608,10 +2715,13 @@ Node* EffectControlLinearizer::SizeForString(Node* length, Node* is_two_byte) {
 // {length}.
 Node* EffectControlLinearizer::AllocateSeqString(Node* length, bool one_byte) {
   Node* size = SizeForString(length, __ Int32Constant(!one_byte));
+
   Node* seq_string = __ Allocate(AllocationType::kYoung, size);
-  __ StoreField(AccessBuilder::ForMap(), seq_string,
-                __ HeapConstant(one_byte ? factory()->one_byte_string_map()
-                                         : factory()->string_map()));
+
+  __ StoreField(
+      AccessBuilder::ForMap(), seq_string,
+      __ HeapConstant(one_byte ? factory()->seq_one_byte_string_map()
+                               : factory()->seq_two_byte_string_map()));
   __ StoreField(AccessBuilder::ForNameRawHashField(), seq_string,
                 __ Int32Constant(Name::kEmptyHashField));
   __ StoreField(AccessBuilder::ForStringLength(), seq_string, length);
@@ -2633,7 +2743,9 @@ Node* EffectControlLinearizer::AllocateSeqString(Node* length,
                                                  Node* is_one_byte) {
   Node* is_two_byte = __ Word32Xor(is_one_byte, __ Int32Constant(1));
   Node* size = SizeForString(length, is_two_byte);
+
   Node* seq_string = __ Allocate(AllocationType::kYoung, size);
+
   __ StoreField(AccessBuilder::ForNameRawHashField(), seq_string,
                 __ Int32Constant(Name::kEmptyHashField));
   __ StoreField(AccessBuilder::ForStringLength(), seq_string, length);
@@ -2649,11 +2761,11 @@ Node* EffectControlLinearizer::AllocateSeqString(Node* length,
       is_one_byte,
       [&]() {
         __ StoreField(AccessBuilder::ForMap(), seq_string,
-                      __ HeapConstant(factory()->one_byte_string_map()));
+                      __ HeapConstant(factory()->seq_one_byte_string_map()));
       },
       [&]() {
         __ StoreField(AccessBuilder::ForMap(), seq_string,
-                      __ HeapConstant(factory()->string_map()));
+                      __ HeapConstant(factory()->seq_two_byte_string_map()));
       });
   return seq_string;
 }
@@ -2672,9 +2784,9 @@ Node* EffectControlLinearizer::AllocateTwoByteSlicedString() {
   Node* sliced_string = __ Allocate(
       AllocationType::kYoung,
       __ IntPtrConstant(
-          jsgraph()->factory()->sliced_string_map()->instance_size()));
+          jsgraph()->factory()->sliced_two_byte_string_map()->instance_size()));
   __ StoreField(AccessBuilder::ForMap(), sliced_string,
-                __ HeapConstant(factory()->sliced_string_map()));
+                __ HeapConstant(factory()->sliced_two_byte_string_map()));
   return sliced_string;
 }
 
@@ -2910,7 +3022,7 @@ void EffectControlLinearizer::EndStringBuilderConcatForLoopPhi(
     // If we reach this point:
     //   - {user_block} cannot be before {block}, otherwise it couldn't use
     //     {node} which is defined in {block} (that was true at the beginning of
-    //     the loop already).
+    //     the loop already). (unless used as the backedge of a loop phi)
     //   - {user_block} cannot be inside the loop (we've checked that).
     // So {user_block} has to be after the loop. Then, since {user_block} is
     // after {block} and uses {node}:
@@ -2920,9 +3032,11 @@ void EffectControlLinearizer::EndStringBuilderConcatForLoopPhi(
     //     right above, so we're not in this case.
     //   - it is dominated by {block}. This is the only case that remains; we
     //     DCHECK it just to be safe.
-    DCHECK_EQ(BasicBlock::GetCommonDominator(block, user_block), block);
-    // {user_block} is dominated by {block}, which mean that we can safely
-    // update the edge.
+    DCHECK((BasicBlock::GetCommonDominator(block, user_block) == block) ||
+           (user_block->IsLoopHeader() &&
+            edge.from()->opcode() == IrOpcode::kPhi));
+    // {user_block} is dominated by {block}, or it's a loop header using {node}
+    // as the backedge, which mean that we can safely update the edge.
     DCHECK(!NodeProperties::IsControlEdge(edge) &&
            !NodeProperties::IsEffectEdge(edge));
     edge.UpdateTo(backing_store);
@@ -3035,6 +3149,7 @@ Node* EffectControlLinearizer::EndStringBuilderConcat(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerStringConcat(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   if (string_builder_optimizer_->IsFirstConcatInStringBuilder(node)) {
     // This is the 1st node of a string builder. We thus need to create and
     // initialize the string builder's backing store and SlicedString.
@@ -3130,7 +3245,7 @@ Node* EffectControlLinearizer::LowerStringConcat(Node* node) {
             ? __ Int32Constant(0)
             : ConstStringIsOneByte(node->InputAt(2));
     auto has_correct_representation =
-        __ MakeLabel(MachineType::PointerRepresentation());
+        __ MakeLabel(MachineRepresentation::kTaggedPointer);
     if (one_or_two_byte != OneOrTwoByteAnalysis::State::kOneByte &&
         one_or_two_byte != OneOrTwoByteAnalysis::State::kTwoByte) {
       Node* need_to_move_backing_store_to_2_bytes =
@@ -3146,10 +3261,10 @@ Node* EffectControlLinearizer::LowerStringConcat(Node* node) {
       {
         Node* new_backing_store = ConvertOneByteStringToTwoByte(
             init_backing_store, max_length, current_length);
+        __ StoreField(AccessBuilder::ForMap(), sliced_string,
+                      __ HeapConstant(factory()->sliced_two_byte_string_map()));
         __ StoreField(AccessBuilder::ForSlicedStringParent(), sliced_string,
                       new_backing_store);
-        __ StoreField(AccessBuilder::ForMap(), sliced_string,
-                      __ HeapConstant(factory()->sliced_string_map()));
         __ Goto(&has_correct_representation, new_backing_store);
       }
     } else {
@@ -3175,7 +3290,7 @@ Node* EffectControlLinearizer::LowerStringConcat(Node* node) {
         __ Int32Add(current_length, __ Int32Constant(literal_length));
     auto needs_realloc = __ MakeLabel();
     auto add_to_backing_store =
-        __ MakeLabel(MachineType::PointerRepresentation());
+        __ MakeLabel(MachineRepresentation::kTaggedPointer);
     Node* realloc_cond = __ Int32LessThan(max_length, new_length);
 
     __ GotoIf(realloc_cond, &needs_realloc);
@@ -3634,6 +3749,7 @@ Node* EffectControlLinearizer::LowerCheckedInt64ToTaggedSigned(
 
 Node* EffectControlLinearizer::LowerCheckedUint32Bounds(Node* node,
                                                         Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Node* index = node->InputAt(0);
   Node* limit = node->InputAt(1);
   const CheckBoundsParameters& params = CheckBoundsParametersOf(node->op());
@@ -3682,6 +3798,7 @@ Node* EffectControlLinearizer::LowerCheckedUint32ToTaggedSigned(
 
 Node* EffectControlLinearizer::LowerCheckedUint64Bounds(Node* node,
                                                         Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Node* const index = node->InputAt(0);
   Node* const limit = node->InputAt(1);
   const CheckBoundsParameters& params = CheckBoundsParametersOf(node->op());
@@ -4057,6 +4174,7 @@ Node* EffectControlLinearizer::LowerCheckedTaggedToFloat64(Node* node,
 
 Node* EffectControlLinearizer::LowerCheckedTaggedToTaggedSigned(
     Node* node, Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
   const CheckParameters& params = CheckParametersOf(node->op());
 
@@ -4069,6 +4187,7 @@ Node* EffectControlLinearizer::LowerCheckedTaggedToTaggedSigned(
 
 Node* EffectControlLinearizer::LowerCheckedTaggedToTaggedPointer(
     Node* node, Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
   const CheckParameters& params = CheckParametersOf(node->op());
 
@@ -4260,45 +4379,18 @@ Node* EffectControlLinearizer::LowerChangeInt64ToBigInt(Node* node) {
   DCHECK(!v8_flags.turboshaft);
   DCHECK(machine()->Is64());
 
-  auto done = __ MakeLabel(MachineRepresentation::kTagged);
   Node* value = node->InputAt(0);
 
-  // BigInts with value 0 must be of size 0 (canonical form).
-  __ GotoIf(__ Word64Equal(value, __ IntPtrConstant(0)), &done,
-            BuildAllocateBigInt(nullptr, nullptr));
-
-  // Shift sign bit into BigInt's sign bit position.
-  Node* sign =
-      __ Word64Shr(value, __ IntPtrConstant(63 - BigInt::SignBits::kShift));
-  Node* bitfield =
-      __ Word32Or(__ Int32Constant(BigInt::LengthBits::encode(1)), sign);
-
-  // We use (value XOR (value >> 63)) - (value >> 63) to compute the
-  // absolute value, in a branchless fashion.
-  Node* sign_mask = __ Word64Sar(value, __ Int64Constant(63));
-  Node* absolute_value = __ Int64Sub(__ Word64Xor(value, sign_mask), sign_mask);
-  __ Goto(&done, BuildAllocateBigInt(bitfield, absolute_value));
-
-  __ Bind(&done);
-  return done.PhiAt(0);
+  return ChangeInt64ToBigInt(value);
 }
 
 Node* EffectControlLinearizer::LowerChangeUint64ToBigInt(Node* node) {
   DCHECK(!v8_flags.turboshaft);
   DCHECK(machine()->Is64());
 
-  auto done = __ MakeLabel(MachineRepresentation::kTagged);
   Node* value = node->InputAt(0);
 
-  // BigInts with value 0 must be of size 0 (canonical form).
-  __ GotoIf(__ Word64Equal(value, __ IntPtrConstant(0)), &done,
-            BuildAllocateBigInt(nullptr, nullptr));
-
-  const auto bitfield = BigInt::LengthBits::encode(1);
-  __ Goto(&done, BuildAllocateBigInt(__ Int32Constant(bitfield), value));
-
-  __ Bind(&done);
-  return done.PhiAt(0);
+  return ChangeUint64ToBigInt(value);
 }
 
 Node* EffectControlLinearizer::LowerTruncateBigIntToWord64(Node* node) {
@@ -4356,6 +4448,7 @@ Node* EffectControlLinearizer::LowerTruncateTaggedToWord32(Node* node) {
 
 Node* EffectControlLinearizer::LowerCheckedTruncateTaggedToWord32(
     Node* node, Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   const CheckTaggedInputParameters& params =
       CheckTaggedInputParametersOf(node->op());
   Node* value = node->InputAt(0);
@@ -4389,6 +4482,7 @@ Node* EffectControlLinearizer::LowerAllocate(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerNumberToString(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* argument = node->InputAt(0);
 
   Callable const callable =
@@ -4398,8 +4492,7 @@ Node* EffectControlLinearizer::LowerNumberToString(Node* node) {
   auto call_descriptor = Linkage::GetStubCallDescriptor(
       graph()->zone(), callable.descriptor(),
       callable.descriptor().GetStackParameterCount(), flags, properties);
-  return __ Call(call_descriptor, __ HeapConstant(callable.code()), argument,
-                 __ NoContextConstant());
+  return __ Call(call_descriptor, __ HeapConstant(callable.code()), argument);
 }
 
 Node* EffectControlLinearizer::LowerObjectIsArrayBufferView(Node* node) {
@@ -4530,6 +4623,7 @@ Node* EffectControlLinearizer::LowerObjectIsDetectableCallable(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerNumberIsFloat64Hole(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
   Node* check = __ Word32Equal(__ Float64ExtractHighWord32(value),
                                __ Int32Constant(kHoleNanUpper32));
@@ -4537,6 +4631,7 @@ Node* EffectControlLinearizer::LowerNumberIsFloat64Hole(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerNumberIsFinite(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* number = node->InputAt(0);
   Node* diff = __ Float64Sub(number, number);
   Node* check = __ Float64Equal(diff, diff);
@@ -4544,6 +4639,7 @@ Node* EffectControlLinearizer::LowerNumberIsFinite(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerObjectIsFiniteNumber(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* object = node->InputAt(0);
   Node* zero = __ Int32Constant(0);
   Node* one = __ Int32Constant(1);
@@ -4569,6 +4665,7 @@ Node* EffectControlLinearizer::LowerObjectIsFiniteNumber(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerNumberIsInteger(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* number = node->InputAt(0);
   Node* trunc = BuildFloat64RoundTruncate(number);
   Node* diff = __ Float64Sub(number, trunc);
@@ -4577,6 +4674,7 @@ Node* EffectControlLinearizer::LowerNumberIsInteger(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerObjectIsInteger(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* object = node->InputAt(0);
   Node* zero = __ Int32Constant(0);
   Node* one = __ Int32Constant(1);
@@ -4603,6 +4701,7 @@ Node* EffectControlLinearizer::LowerObjectIsInteger(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerNumberIsSafeInteger(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* number = node->InputAt(0);
   Node* zero = __ Int32Constant(0);
   auto done = __ MakeLabel(MachineRepresentation::kBit);
@@ -4620,6 +4719,7 @@ Node* EffectControlLinearizer::LowerNumberIsSafeInteger(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerObjectIsSafeInteger(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* object = node->InputAt(0);
   Node* zero = __ Int32Constant(0);
   Node* one = __ Int32Constant(1);
@@ -4648,20 +4748,8 @@ Node* EffectControlLinearizer::LowerObjectIsSafeInteger(Node* node) {
   return done.PhiAt(0);
 }
 
-namespace {
-
-// There is no (currently) available constexpr version of base::bit_cast, so
-// we have to make do with constructing the -0.0 bits manually (by setting the
-// sign bit to 1 and everything else to 0).
-// TODO(leszeks): Revisit when upgrading to C++20.
-constexpr int32_t kMinusZeroLoBits = static_cast<int32_t>(0);
-constexpr int32_t kMinusZeroHiBits = static_cast<int32_t>(1) << 31;
-constexpr int64_t kMinusZeroBits =
-    (static_cast<uint64_t>(kMinusZeroHiBits) << 32) | kMinusZeroLoBits;
-
-}  // namespace
-
 Node* EffectControlLinearizer::LowerObjectIsMinusZero(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
   Node* zero = __ Int32Constant(0);
 
@@ -4694,6 +4782,7 @@ Node* EffectControlLinearizer::LowerObjectIsMinusZero(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerNumberIsMinusZero(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
 
   if (machine()->Is64()) {
@@ -4715,6 +4804,7 @@ Node* EffectControlLinearizer::LowerNumberIsMinusZero(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerObjectIsNaN(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
   Node* zero = __ Int32Constant(0);
 
@@ -4891,6 +4981,7 @@ Node* EffectControlLinearizer::LowerObjectIsUndetectable(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerTypeOf(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* obj = node->InputAt(0);
   Callable const callable = Builtins::CallableFor(isolate(), Builtin::kTypeof);
   Operator::Properties const properties = Operator::kEliminatable;
@@ -4898,11 +4989,11 @@ Node* EffectControlLinearizer::LowerTypeOf(Node* node) {
   auto call_descriptor = Linkage::GetStubCallDescriptor(
       graph()->zone(), callable.descriptor(),
       callable.descriptor().GetStackParameterCount(), flags, properties);
-  return __ Call(call_descriptor, __ HeapConstant(callable.code()), obj,
-                 __ NoContextConstant());
+  return __ Call(call_descriptor, __ HeapConstant(callable.code()), obj);
 }
 
 Node* EffectControlLinearizer::LowerToBoolean(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* obj = node->InputAt(0);
   Callable const callable =
       Builtins::CallableFor(isolate(), Builtin::kToBoolean);
@@ -4915,6 +5006,7 @@ Node* EffectControlLinearizer::LowerToBoolean(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerArgumentsLength(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* arguments_length = ChangeIntPtrToSmi(
       __ Load(MachineType::Pointer(), __ LoadFramePointer(),
               __ IntPtrConstant(StandardFrameConstants::kArgCOffset)));
@@ -4924,6 +5016,7 @@ Node* EffectControlLinearizer::LowerArgumentsLength(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerRestLength(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   int formal_parameter_count = FormalParameterCountOf(node->op());
   DCHECK_LE(0, formal_parameter_count);
 
@@ -4981,8 +5074,8 @@ Node* EffectControlLinearizer::LowerNewDoubleElements(Node* node) {
     __ GotoIfNot(check, &done, result);
 
     ElementAccess const access = {kTaggedBase, FixedDoubleArray::kHeaderSize,
-                                  Type::NumberOrHole(), MachineType::Float64(),
-                                  kNoWriteBarrier};
+                                  Type::NumberOrTheHole(),
+                                  MachineType::Float64(), kNoWriteBarrier};
     __ StoreElement(access, result, index, the_hole);
 
     // Advance the {index}.
@@ -5041,6 +5134,7 @@ Node* EffectControlLinearizer::LowerNewSmiOrObjectElements(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerNewArgumentsElements(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   const NewArgumentsElementsParameters& parameters =
       NewArgumentsElementsParametersOf(node->op());
   CreateArgumentsType type = parameters.arguments_type();
@@ -5103,7 +5197,7 @@ Node* EffectControlLinearizer::LowerNewConsString(Node* node) {
   __ Bind(&if_onebyte);
   __ Goto(&done, __ HeapConstant(factory()->cons_one_byte_string_map()));
   __ Bind(&if_twobyte);
-  __ Goto(&done, __ HeapConstant(factory()->cons_string_map()));
+  __ Goto(&done, __ HeapConstant(factory()->cons_two_byte_string_map()));
   __ Bind(&done);
   Node* result_map = done.PhiAt(0);
 
@@ -5120,6 +5214,7 @@ Node* EffectControlLinearizer::LowerNewConsString(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerSameValue(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
@@ -5134,6 +5229,7 @@ Node* EffectControlLinearizer::LowerSameValue(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerSameValueNumbersOnly(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
@@ -5148,6 +5244,7 @@ Node* EffectControlLinearizer::LowerSameValueNumbersOnly(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerNumberSameValue(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* lhs = node->InputAt(0);
   Node* rhs = node->InputAt(1);
 
@@ -5173,6 +5270,7 @@ Node* EffectControlLinearizer::LowerNumberSameValue(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerDeadValue(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* input = NodeProperties::GetValueInput(node, 0);
   if (input->opcode() != IrOpcode::kUnreachable) {
     // There is no fundamental reason not to connect to end here, except it
@@ -5186,6 +5284,7 @@ Node* EffectControlLinearizer::LowerDeadValue(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerStringToNumber(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* string = node->InputAt(0);
 
   Callable const callable =
@@ -5195,8 +5294,7 @@ Node* EffectControlLinearizer::LowerStringToNumber(Node* node) {
   auto call_descriptor = Linkage::GetStubCallDescriptor(
       graph()->zone(), callable.descriptor(),
       callable.descriptor().GetStackParameterCount(), flags, properties);
-  return __ Call(call_descriptor, __ HeapConstant(callable.code()), string,
-                 __ NoContextConstant());
+  return __ Call(call_descriptor, __ HeapConstant(callable.code()), string);
 }
 
 Node* EffectControlLinearizer::StringCharCodeAt(Node* receiver,
@@ -5446,7 +5544,7 @@ Node* EffectControlLinearizer::LowerStringFromSingleCharCode(Node* node) {
              SeqTwoByteString::SizeFor(1) - kObjectAlignment - kHeapObjectTag,
              __ SmiConstant(0));
     __ StoreField(AccessBuilder::ForMap(), vfalse1,
-                  __ HeapConstant(factory()->string_map()));
+                  __ HeapConstant(factory()->seq_two_byte_string_map()));
     __ StoreField(AccessBuilder::ForNameRawHashField(), vfalse1,
                   __ Int32Constant(Name::kEmptyHashField));
     __ StoreField(AccessBuilder::ForStringLength(), vfalse1,
@@ -5550,7 +5648,7 @@ Node* EffectControlLinearizer::LowerStringFromSingleCodePoint(Node* node) {
                SeqTwoByteString::SizeFor(1) - kObjectAlignment - kHeapObjectTag,
                __ SmiConstant(0));
       __ StoreField(AccessBuilder::ForMap(), vfalse1,
-                    __ HeapConstant(factory()->string_map()));
+                    __ HeapConstant(factory()->seq_two_byte_string_map()));
       __ StoreField(AccessBuilder::ForNameRawHashField(), vfalse1,
                     __ IntPtrConstant(Name::kEmptyHashField));
       __ StoreField(AccessBuilder::ForStringLength(), vfalse1,
@@ -5595,7 +5693,7 @@ Node* EffectControlLinearizer::LowerStringFromSingleCodePoint(Node* node) {
              SeqTwoByteString::SizeFor(2) - kObjectAlignment - kHeapObjectTag,
              __ SmiConstant(0));
     __ StoreField(AccessBuilder::ForMap(), vfalse0,
-                  __ HeapConstant(factory()->string_map()));
+                  __ HeapConstant(factory()->seq_two_byte_string_map()));
     __ StoreField(AccessBuilder::ForNameRawHashField(), vfalse0,
                   __ Int32Constant(Name::kEmptyHashField));
     __ StoreField(AccessBuilder::ForStringLength(), vfalse0,
@@ -5662,6 +5760,7 @@ Node* EffectControlLinearizer::LowerStringEqual(Node* node) {
   auto if_length_equal = __ MakeLabel();
   auto done = __ MakeLabel(MachineRepresentation::kTagged);
 
+  __ GotoIf(__ TaggedEqual(lhs, rhs), &done, __ TrueConstant());
   __ GotoIf(__ Word32Equal(lhs_length, rhs_length), &if_length_equal);
   __ Goto(&done, __ FalseConstant());
 
@@ -5946,6 +6045,7 @@ Node* EffectControlLinearizer::LowerBigIntNegate(Node* node) {
 
 Node* EffectControlLinearizer::LowerCheckFloat64Hole(Node* node,
                                                      Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   // If we reach this point w/o eliminating the {node} that's marked
   // with allow-return-hole, we cannot do anything, so just deoptimize
   // in case of the hole NaN.
@@ -5976,6 +6076,7 @@ Node* EffectControlLinearizer::LowerCheckFloat64Hole(Node* node,
 
 Node* EffectControlLinearizer::LowerCheckNotTaggedHole(Node* node,
                                                        Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
   Node* check = __ TaggedEqual(value, __ TheHoleConstant());
   __ DeoptimizeIf(DeoptimizeReason::kHole, FeedbackSource(), check,
@@ -5984,6 +6085,7 @@ Node* EffectControlLinearizer::LowerCheckNotTaggedHole(Node* node,
 }
 
 Node* EffectControlLinearizer::LowerConvertTaggedHoleToUndefined(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
 
   auto if_is_hole = __ MakeDeferredLabel();
@@ -6002,6 +6104,7 @@ Node* EffectControlLinearizer::LowerConvertTaggedHoleToUndefined(Node* node) {
 
 void EffectControlLinearizer::LowerCheckEqualsInternalizedString(
     Node* node, Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Node* exp = node->InputAt(0);
   Node* val = node->InputAt(1);
 
@@ -6023,9 +6126,11 @@ void EffectControlLinearizer::LowerCheckEqualsInternalizedString(
         __ LoadField(AccessBuilder::ForMapInstanceType(), val_map);
 
     // ThinString.
-    __ Branch(
-        __ Word32Equal(val_instance_type, __ Int32Constant(THIN_STRING_TYPE)),
-        &if_thinstring, &if_notthinstring);
+    __ Branch(__ Word32Equal(
+                  __ Word32And(val_instance_type,
+                               __ Int32Constant(kStringRepresentationMask)),
+                  __ Int32Constant(kThinStringTag)),
+              &if_thinstring, &if_notthinstring);
 
     __ Bind(&if_notthinstring);
     {
@@ -6076,6 +6181,7 @@ void EffectControlLinearizer::LowerCheckEqualsInternalizedString(
 
 void EffectControlLinearizer::LowerCheckEqualsSymbol(Node* node,
                                                      Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   Node* exp = node->InputAt(0);
   Node* val = node->InputAt(1);
   Node* check = __ TaggedEqual(exp, val);
@@ -6129,6 +6235,31 @@ Node* EffectControlLinearizer::ChangeInt32ToSmi(Node* value) {
   return ChangeIntPtrToSmi(ChangeInt32ToIntPtr(value));
 }
 
+Node* EffectControlLinearizer::ChangeInt64ToBigInt(Node* value) {
+  DCHECK(machine()->Is64());
+
+  auto done = __ MakeLabel(MachineRepresentation::kTagged);
+
+  // BigInts with value 0 must be of size 0 (canonical form).
+  __ GotoIf(__ Word64Equal(value, __ IntPtrConstant(0)), &done,
+            BuildAllocateBigInt(nullptr, nullptr));
+
+  // Shift sign bit into BigInt's sign bit position.
+  Node* sign =
+      __ Word64Shr(value, __ IntPtrConstant(63 - BigInt::SignBits::kShift));
+  Node* bitfield =
+      __ Word32Or(__ Int32Constant(BigInt::LengthBits::encode(1)), sign);
+
+  // We use (value XOR (value >> 63)) - (value >> 63) to compute the
+  // absolute value, in a branchless fashion.
+  Node* sign_mask = __ Word64Sar(value, __ Int64Constant(63));
+  Node* absolute_value = __ Int64Sub(__ Word64Xor(value, sign_mask), sign_mask);
+  __ Goto(&done, BuildAllocateBigInt(bitfield, absolute_value));
+
+  __ Bind(&done);
+  return done.PhiAt(0);
+}
+
 Node* EffectControlLinearizer::ChangeInt64ToSmi(Node* value) {
   DCHECK(machine()->Is64());
   return ChangeIntPtrToSmi(value);
@@ -6141,6 +6272,63 @@ Node* EffectControlLinearizer::ChangeUint32ToUintPtr(Node* value) {
   return value;
 }
 
+Node* EffectControlLinearizer::ChangeInt64ToTagged(Node* value) {
+  auto if_not_in_smi_range = __ MakeDeferredLabel();
+  auto done = __ MakeLabel(MachineRepresentation::kTagged);
+
+  Node* value32 = __ TruncateInt64ToInt32(value);
+  __ GotoIfNot(__ Word64Equal(__ ChangeInt32ToInt64(value32), value),
+               &if_not_in_smi_range);
+
+  if (SmiValuesAre32Bits()) {
+    Node* value_smi = ChangeInt64ToSmi(value);
+    __ Goto(&done, value_smi);
+  } else {
+    SmiTagOrOverflow(value32, &if_not_in_smi_range, &done);
+  }
+
+  __ Bind(&if_not_in_smi_range);
+  Node* number = AllocateHeapNumberWithValue(__ ChangeInt64ToFloat64(value));
+  __ Goto(&done, number);
+
+  __ Bind(&done);
+  return done.PhiAt(0);
+}
+
+Node* EffectControlLinearizer::ChangeUint64ToBigInt(Node* value) {
+  DCHECK(machine()->Is64());
+
+  auto done = __ MakeLabel(MachineRepresentation::kTagged);
+
+  // BigInts with value 0 must be of size 0 (canonical form).
+  __ GotoIf(__ Word64Equal(value, __ IntPtrConstant(0)), &done,
+            BuildAllocateBigInt(nullptr, nullptr));
+
+  const auto bitfield = BigInt::LengthBits::encode(1);
+  __ Goto(&done, BuildAllocateBigInt(__ Int32Constant(bitfield), value));
+
+  __ Bind(&done);
+  return done.PhiAt(0);
+}
+
+Node* EffectControlLinearizer::ChangeUint64ToTagged(Node* value) {
+  auto if_not_in_smi_range = __ MakeDeferredLabel();
+  auto done = __ MakeLabel(MachineRepresentation::kTagged);
+
+  Node* check =
+      __ Uint64LessThanOrEqual(value, __ Int64Constant(Smi::kMaxValue));
+  __ GotoIfNot(check, &if_not_in_smi_range);
+  __ Goto(&done, ChangeInt64ToSmi(value));
+
+  __ Bind(&if_not_in_smi_range);
+  Node* number = AllocateHeapNumberWithValue(__ ChangeInt64ToFloat64(value));
+
+  __ Goto(&done, number);
+  __ Bind(&done);
+
+  return done.PhiAt(0);
+}
+
 Node* EffectControlLinearizer::ChangeUint32ToSmi(Node* value) {
   // Do shift on 32bit values if Smis are stored in the lower word.
   if (machine()->Is64() && SmiValuesAre31Bits()) {
@@ -6218,11 +6406,13 @@ Node* EffectControlLinearizer::SmiShiftBitsConstant() {
 }
 
 Node* EffectControlLinearizer::LowerPlainPrimitiveToNumber(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
   return __ PlainPrimitiveToNumber(TNode<Object>::UncheckedCast(value));
 }
 
 Node* EffectControlLinearizer::LowerPlainPrimitiveToWord32(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
 
   auto if_not_smi = __ MakeDeferredLabel();
@@ -6250,6 +6440,7 @@ Node* EffectControlLinearizer::LowerPlainPrimitiveToWord32(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerPlainPrimitiveToFloat64(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* value = node->InputAt(0);
 
   auto if_not_smi = __ MakeDeferredLabel();
@@ -6280,6 +6471,7 @@ Node* EffectControlLinearizer::LowerPlainPrimitiveToFloat64(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerEnsureWritableFastElements(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* object = node->InputAt(0);
   Node* elements = node->InputAt(1);
 
@@ -6304,8 +6496,8 @@ Node* EffectControlLinearizer::LowerEnsureWritableFastElements(Node* node) {
   auto call_descriptor = Linkage::GetStubCallDescriptor(
       graph()->zone(), callable.descriptor(),
       callable.descriptor().GetStackParameterCount(), flags, properties);
-  Node* result = __ Call(call_descriptor, __ HeapConstant(callable.code()),
-                         object, __ NoContextConstant());
+  Node* result =
+      __ Call(call_descriptor, __ HeapConstant(callable.code()), object);
   __ Goto(&done, result);
 
   __ Bind(&done);
@@ -6314,6 +6506,7 @@ Node* EffectControlLinearizer::LowerEnsureWritableFastElements(Node* node) {
 
 Node* EffectControlLinearizer::LowerMaybeGrowFastElements(Node* node,
                                                           Node* frame_state) {
+  DCHECK(!v8_flags.turboshaft);
   GrowFastElementsParameters params = GrowFastElementsParametersOf(node->op());
   Node* object = node->InputAt(0);
   Node* elements = node->InputAt(1);
@@ -6343,7 +6536,7 @@ Node* EffectControlLinearizer::LowerMaybeGrowFastElements(Node* node,
       callable.descriptor().GetStackParameterCount(), call_flags, properties);
   Node* new_elements =
       __ Call(call_descriptor, __ HeapConstant(callable.code()), object,
-              ChangeInt32ToSmi(index), __ NoContextConstant());
+              ChangeInt32ToSmi(index));
 
   // Ensure that we were able to grow the {elements}.
   __ DeoptimizeIf(DeoptimizeReason::kCouldNotGrowElements, params.feedback(),
@@ -6355,14 +6548,15 @@ Node* EffectControlLinearizer::LowerMaybeGrowFastElements(Node* node,
 }
 
 void EffectControlLinearizer::LowerTransitionElementsKind(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   ElementsTransition const transition = ElementsTransitionOf(node->op());
   Node* object = node->InputAt(0);
 
   auto if_map_same = __ MakeDeferredLabel();
   auto done = __ MakeLabel();
 
-  Node* source_map = __ HeapConstant(transition.source());
-  Node* target_map = __ HeapConstant(transition.target());
+  Node* source_map = __ HeapConstant(transition.source().object());
+  Node* target_map = __ HeapConstant(transition.target().object());
 
   // Load the current map of {object}.
   Node* object_map = __ LoadField(AccessBuilder::ForMap(), object);
@@ -6396,6 +6590,7 @@ void EffectControlLinearizer::LowerTransitionElementsKind(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerLoadMessage(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* offset = node->InputAt(0);
   Node* object_pattern =
       __ LoadField(AccessBuilder::ForExternalIntPtr(), offset);
@@ -6403,6 +6598,7 @@ Node* EffectControlLinearizer::LowerLoadMessage(Node* node) {
 }
 
 void EffectControlLinearizer::LowerStoreMessage(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* offset = node->InputAt(0);
   Node* object = node->InputAt(1);
   Node* object_pattern = __ BitcastTaggedToWord(object);
@@ -6542,7 +6738,7 @@ Node* EffectControlLinearizer::ClampFastCallArgument(
   auto done = __ MakeLabel(MachineRepresentation::kWord64);
 
   Node* check_is_zero = __ Float64Equal(rounded, __ Float64Constant(0));
-  __ Branch(check_is_zero, &check_for_nan, &check_done);
+  __ Branch(check_is_zero, &if_zero_or_nan, &check_for_nan);
 
   // Check if {rounded} is NaN.
   __ Bind(&check_for_nan);
@@ -6606,20 +6802,20 @@ Node* EffectControlLinearizer::AdaptFastCallArgument(
         switch (arg_type.GetType()) {
           case CTypeInfo::Type::kInt32:
             truncation = __ TryTruncateFloat64ToInt32(node);
-            __ GotoIfNot(__ Projection(1, truncation), if_error);
-            return __ Projection(0, truncation);
+            __ GotoIfNot(__ Projection(1, truncation, __ start()), if_error);
+            return __ Projection(0, truncation, __ start());
           case CTypeInfo::Type::kUint32:
             truncation = __ TryTruncateFloat64ToUint32(node);
-            __ GotoIfNot(__ Projection(1, truncation), if_error);
-            return __ Projection(0, truncation);
+            __ GotoIfNot(__ Projection(1, truncation, __ start()), if_error);
+            return __ Projection(0, truncation, __ start());
           case CTypeInfo::Type::kInt64:
             truncation = __ TryTruncateFloat64ToInt64(node);
-            __ GotoIfNot(__ Projection(1, truncation), if_error);
-            return __ Projection(0, truncation);
+            __ GotoIfNot(__ Projection(1, truncation, __ start()), if_error);
+            return __ Projection(0, truncation, __ start());
           case CTypeInfo::Type::kUint64:
             truncation = __ TryTruncateFloat64ToUint64(node);
-            __ GotoIfNot(__ Projection(1, truncation), if_error);
-            return __ Projection(0, truncation);
+            __ GotoIfNot(__ Projection(1, truncation, __ start()), if_error);
+            return __ Projection(0, truncation, __ start());
           default: {
             __ Goto(if_error);
             return node;
@@ -6840,7 +7036,7 @@ Node* EffectControlLinearizer::GenerateSlowApiCall(Node* node) {
   const CFunctionInfo* c_signature = params.c_functions()[0].signature;
   const int c_arg_count = c_signature->ArgumentCount();
 
-  Node** const slow_inputs = graph()->zone()->NewArray<Node*>(
+  Node** const slow_inputs = graph()->zone()->AllocateArray<Node*>(
       n.SlowCallArgumentCount() + FastApiCallNode::kEffectAndControlInputCount);
 
   int fast_call_params = c_arg_count;
@@ -6860,6 +7056,7 @@ Node* EffectControlLinearizer::GenerateSlowApiCall(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerFastApiCall(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   FastApiCallNode n(node);
   FastApiCallParameters const& params = n.Parameters();
 
@@ -6901,6 +7098,7 @@ Node* EffectControlLinearizer::LowerFastApiCall(Node* node) {
       },
       // Convert return value from C function to JS value
       [this](const CFunctionInfo* c_signature, Node* c_call_result) -> Node* {
+        // TODO(mslekova, aapoalas): Implement these conversions in SL.
         switch (c_signature->ReturnInfo().GetType()) {
           case CTypeInfo::Type::kVoid:
             return __ UndefinedConstant();
@@ -6912,9 +7110,28 @@ Node* EffectControlLinearizer::LowerFastApiCall(Node* node) {
             return ChangeInt32ToTagged(c_call_result);
           case CTypeInfo::Type::kUint32:
             return ChangeUint32ToTagged(c_call_result);
-          case CTypeInfo::Type::kInt64:
-          case CTypeInfo::Type::kUint64:
-            UNREACHABLE();
+          case CTypeInfo::Type::kInt64: {
+            CFunctionInfo::Int64Representation repr =
+                c_signature->GetInt64Representation();
+            if (repr == CFunctionInfo::Int64Representation::kBigInt) {
+              return ChangeInt64ToBigInt(c_call_result);
+            } else if (repr == CFunctionInfo::Int64Representation::kNumber) {
+              return ChangeInt64ToTagged(c_call_result);
+            } else {
+              UNREACHABLE();
+            }
+          }
+          case CTypeInfo::Type::kUint64: {
+            CFunctionInfo::Int64Representation repr =
+                c_signature->GetInt64Representation();
+            if (repr == CFunctionInfo::Int64Representation::kBigInt) {
+              return ChangeUint64ToBigInt(c_call_result);
+            } else if (repr == CFunctionInfo::Int64Representation::kNumber) {
+              return ChangeUint64ToTagged(c_call_result);
+            } else {
+              UNREACHABLE();
+            }
+          }
           case CTypeInfo::Type::kFloat32:
             return ChangeFloat64ToTagged(
                 __ ChangeFloat32ToFloat64(c_call_result),
@@ -7113,6 +7330,7 @@ Node* EffectControlLinearizer::BuildReverseBytes(ExternalArrayType type,
 }
 
 Node* EffectControlLinearizer::LowerLoadDataViewElement(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   ExternalArrayType element_type = ExternalArrayTypeOf(node->op());
   Node* object = node->InputAt(0);
   Node* storage = node->InputAt(1);
@@ -7155,6 +7373,7 @@ Node* EffectControlLinearizer::LowerLoadDataViewElement(Node* node) {
 }
 
 void EffectControlLinearizer::LowerStoreDataViewElement(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   ExternalArrayType element_type = ExternalArrayTypeOf(node->op());
   Node* object = node->InputAt(0);
   Node* storage = node->InputAt(1);
@@ -7217,6 +7436,7 @@ Node* EffectControlLinearizer::BuildTypedArrayDataPointer(Node* base,
 }
 
 Node* EffectControlLinearizer::LowerLoadTypedElement(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   ExternalArrayType array_type = ExternalArrayTypeOf(node->op());
   Node* buffer = node->InputAt(0);
   Node* base = node->InputAt(1);
@@ -7235,6 +7455,7 @@ Node* EffectControlLinearizer::LowerLoadTypedElement(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerLoadStackArgument(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* base = node->InputAt(0);
   Node* index = node->InputAt(1);
 
@@ -7245,6 +7466,7 @@ Node* EffectControlLinearizer::LowerLoadStackArgument(Node* node) {
 }
 
 void EffectControlLinearizer::LowerStoreTypedElement(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   ExternalArrayType array_type = ExternalArrayTypeOf(node->op());
   Node* buffer = node->InputAt(0);
   Node* base = node->InputAt(1);
@@ -7269,9 +7491,9 @@ void EffectControlLinearizer::TransitionElementsTo(Node* node, Node* array,
   DCHECK(IsMoreGeneralElementsKindTransition(from, to));
   DCHECK(to == HOLEY_ELEMENTS || to == HOLEY_DOUBLE_ELEMENTS);
 
-  Handle<Map> target(to == HOLEY_ELEMENTS ? FastMapParameterOf(node->op())
-                                          : DoubleMapParameterOf(node->op()));
-  Node* target_map = __ HeapConstant(target);
+  MapRef target(to == HOLEY_ELEMENTS ? FastMapParameterOf(node->op())
+                                     : DoubleMapParameterOf(node->op()));
+  Node* target_map = __ HeapConstant(target.object());
 
   if (IsSimpleMapChangeTransition(from, to)) {
     __ StoreField(AccessBuilder::ForMap(), array, target_map);
@@ -7295,6 +7517,7 @@ Node* EffectControlLinearizer::IsElementsKindGreaterThan(
 }
 
 void EffectControlLinearizer::LowerTransitionAndStoreElement(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* array = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -7436,6 +7659,7 @@ void EffectControlLinearizer::LowerTransitionAndStoreElement(Node* node) {
 }
 
 void EffectControlLinearizer::LowerTransitionAndStoreNumberElement(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* array = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);  // This is a Float64, not tagged.
@@ -7496,6 +7720,7 @@ void EffectControlLinearizer::LowerTransitionAndStoreNumberElement(Node* node) {
 
 void EffectControlLinearizer::LowerTransitionAndStoreNonNumberElement(
     Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* array = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);
@@ -7563,6 +7788,7 @@ void EffectControlLinearizer::LowerTransitionAndStoreNonNumberElement(
 }
 
 void EffectControlLinearizer::LowerStoreSignedSmallElement(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* array = node->InputAt(0);
   Node* index = node->InputAt(1);
   Node* value = node->InputAt(2);  // int32
@@ -7621,6 +7847,7 @@ void EffectControlLinearizer::LowerStoreSignedSmallElement(Node* node) {
 }
 
 void EffectControlLinearizer::LowerRuntimeAbort(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   AbortReason reason = AbortReasonOf(node->op());
   Operator::Properties properties = Operator::kNoDeopt | Operator::kNoThrow;
   Runtime::FunctionId id = Runtime::kAbort;
@@ -7645,7 +7872,8 @@ Node* EffectControlLinearizer::CallBuiltin(Builtin builtin,
                  __ NoContextConstant());
 }
 
-Node* EffectControlLinearizer::LowerAssertType(Node* node) {
+void EffectControlLinearizer::LowerAssertType(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   DCHECK_EQ(node->opcode(), IrOpcode::kAssertType);
   Type type = OpParameter<Type>(node->op());
   CHECK(type.CanBeAsserted());
@@ -7661,16 +7889,6 @@ Node* EffectControlLinearizer::LowerAssertType(Node* node) {
   }
   CallBuiltin(Builtin::kCheckTurbofanType, node->op()->properties(), input,
               allocated_type, __ SmiConstant(node->id()));
-  return input;
-}
-
-Node* EffectControlLinearizer::LowerFoldConstant(Node* node) {
-  DCHECK_EQ(node->opcode(), IrOpcode::kFoldConstant);
-  Node* original = node->InputAt(0);
-  Node* constant = node->InputAt(1);
-  CallBuiltin(Builtin::kCheckSameObject, node->op()->properties(), original,
-              constant);
-  return constant;
 }
 
 Node* EffectControlLinearizer::LowerDoubleArrayMinMax(Node* node) {
@@ -7717,6 +7935,7 @@ Node* EffectControlLinearizer::LowerDoubleArrayMinMax(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerConvertReceiver(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   ConvertReceiverMode const mode = ConvertReceiverModeOf(node->op());
   Node* value = node->InputAt(0);
   Node* global_proxy = node->InputAt(1);
@@ -7792,6 +8011,7 @@ Node* EffectControlLinearizer::LowerConvertReceiver(Node* node) {
 }
 
 Maybe<Node*> EffectControlLinearizer::LowerFloat64RoundUp(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   // Nothing to be done if a fast hardware instruction is available.
   if (machine()->Float64RoundUp().IsSupported()) {
     return Nothing<Node*>();
@@ -7968,6 +8188,7 @@ Node* EffectControlLinearizer::BuildFloat64RoundDown(Node* value) {
 }
 
 Maybe<Node*> EffectControlLinearizer::LowerFloat64RoundDown(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   // Nothing to be done if a fast hardware instruction is available.
   if (machine()->Float64RoundDown().IsSupported()) {
     return Nothing<Node*>();
@@ -7978,6 +8199,7 @@ Maybe<Node*> EffectControlLinearizer::LowerFloat64RoundDown(Node* node) {
 }
 
 Maybe<Node*> EffectControlLinearizer::LowerFloat64RoundTiesEven(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   // Nothing to be done if a fast hardware instruction is available.
   if (machine()->Float64RoundTiesEven().IsSupported()) {
     return Nothing<Node*>();
@@ -8113,6 +8335,7 @@ Node* EffectControlLinearizer::BuildFloat64RoundTruncate(Node* input) {
 }
 
 Maybe<Node*> EffectControlLinearizer::LowerFloat64RoundTruncate(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   // Nothing to be done if a fast hardware instruction is available.
   if (machine()->Float64RoundTruncate().IsSupported()) {
     return Nothing<Node*>();
@@ -8123,6 +8346,7 @@ Maybe<Node*> EffectControlLinearizer::LowerFloat64RoundTruncate(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerFindOrderedHashMapEntry(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* table = NodeProperties::GetValueInput(node, 0);
   Node* key = NodeProperties::GetValueInput(node, 1);
 
@@ -8140,6 +8364,7 @@ Node* EffectControlLinearizer::LowerFindOrderedHashMapEntry(Node* node) {
 }
 
 Node* EffectControlLinearizer::LowerFindOrderedHashSetEntry(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* table = NodeProperties::GetValueInput(node, 0);
   Node* key = NodeProperties::GetValueInput(node, 1);
 
@@ -8171,6 +8396,7 @@ Node* EffectControlLinearizer::ComputeUnseededHash(Node* value) {
 
 Node* EffectControlLinearizer::LowerFindOrderedHashMapEntryForInt32Key(
     Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Node* table = NodeProperties::GetValueInput(node, 0);
   Node* key = NodeProperties::GetValueInput(node, 1);
 
@@ -8243,6 +8469,7 @@ Node* EffectControlLinearizer::LowerFindOrderedHashMapEntryForInt32Key(
 }
 
 Node* EffectControlLinearizer::LowerDateNow(Node* node) {
+  DCHECK(!v8_flags.turboshaft);
   Operator::Properties properties = Operator::kNoDeopt | Operator::kNoThrow;
   Runtime::FunctionId id = Runtime::kDateCurrentTime;
   auto call_descriptor = Linkage::GetRuntimeCallDescriptor(
@@ -8259,49 +8486,6 @@ Node* EffectControlLinearizer::TruncateWordToInt32(Node* value) {
   return value;
 }
 
-Node* EffectControlLinearizer::BuildIsStrongReference(Node* value) {
-  return __ Word32Equal(
-      __ Word32And(
-          TruncateWordToInt32(__ BitcastTaggedToWordForTagAndSmiBits(value)),
-          __ Int32Constant(kHeapObjectTagMask)),
-      __ Int32Constant(kHeapObjectTag));
-}
-
-Node* EffectControlLinearizer::MakeWeakForComparison(Node* heap_object) {
-  // TODO(gsathya): Specialize this for pointer compression.
-  return __ BitcastWordToTagged(
-      __ WordOr(__ BitcastTaggedToWord(heap_object),
-                __ IntPtrConstant(kWeakHeapObjectTag)));
-}
-
-Node* EffectControlLinearizer::BuildStrongReferenceFromWeakReference(
-    Node* maybe_object) {
-  return __ BitcastWordToTagged(
-      __ WordAnd(__ BitcastMaybeObjectToWord(maybe_object),
-                 __ IntPtrConstant(~kWeakHeapObjectMask)));
-}
-
-Node* EffectControlLinearizer::BuildIsWeakReferenceTo(Node* maybe_object,
-                                                      Node* value) {
-  if (COMPRESS_POINTERS_BOOL) {
-    return __ Word32Equal(
-        __ Word32And(
-            TruncateWordToInt32(__ BitcastMaybeObjectToWord(maybe_object)),
-            __ Uint32Constant(~static_cast<uint32_t>(kWeakHeapObjectMask))),
-        TruncateWordToInt32(__ BitcastTaggedToWord(value)));
-  } else {
-    return __ WordEqual(__ WordAnd(__ BitcastMaybeObjectToWord(maybe_object),
-                                   __ IntPtrConstant(~kWeakHeapObjectMask)),
-                        __ BitcastTaggedToWord(value));
-  }
-}
-
-Node* EffectControlLinearizer::BuildIsClearedWeakReference(Node* maybe_object) {
-  return __ Word32Equal(
-      TruncateWordToInt32(__ BitcastMaybeObjectToWord(maybe_object)),
-      __ Int32Constant(kClearedWeakHeapObjectLower32));
-}
-
 // Pass {bitfield} = {digit} = nullptr to construct the canoncial 0n BigInt.
 Node* EffectControlLinearizer::BuildAllocateBigInt(Node* bitfield,
                                                    Node* digit) {
@@ -8382,6 +8566,19 @@ Node* EffectControlLinearizer::BuildAllocateJSExternalObject(Node* pointer) {
   return done.PhiAt(0);
 }
 
+#if V8_ENABLE_WEBASSEMBLY
+void EffectControlLinearizer::LowerWasmTrap(Node* node, Node* frame_state) {
+  // Store frame_state from CheckPoint.
+  node->InsertInput(graph()->zone(), 1, frame_state);
+  bool has_frame_state = true;
+  const Operator* op =
+      node->opcode() == IrOpcode::kTrapIf
+          ? common()->TrapIf(TrapIdOf(node->op()), has_frame_state)
+          : common()->TrapUnless(TrapIdOf(node->op()), has_frame_state);
+  NodeProperties::ChangeOp(node, op);
+}
+#endif
+
 #undef __
 
 void LinearizeEffectControl(JSGraph* graph, Schedule* schedule, Zone* temp_zone,
diff --git a/deps/v8/src/compiler/escape-analysis.cc b/deps/v8/src/compiler/escape-analysis.cc
index ab22f6d7484be3..4ffa0ef4da7b66 100644
--- a/deps/v8/src/compiler/escape-analysis.cc
+++ b/deps/v8/src/compiler/escape-analysis.cc
@@ -298,10 +298,11 @@ class EscapeAnalysisTracker : public ZoneObject {
 
  private:
   friend class EscapeAnalysisResult;
-  static const size_t kMaxTrackedObjects = 100;
+  static constexpr int kTrackingBudget = 600;
 
   VirtualObject* NewVirtualObject(int size) {
-    if (next_object_id_ >= kMaxTrackedObjects) return nullptr;
+    if (number_of_tracked_bytes_ + size >= kTrackingBudget) return nullptr;
+    number_of_tracked_bytes_ += size;
     return zone_->New<VirtualObject>(&variable_states_, next_object_id_++,
                                      size);
   }
@@ -311,6 +312,7 @@ class EscapeAnalysisTracker : public ZoneObject {
   ZoneUnorderedMap<Node*, bool> framestate_might_lazy_deopt_;
   VariableTracker variable_states_;
   VirtualObject::Id next_object_id_ = 0;
+  int number_of_tracked_bytes_ = 0;
   JSGraph* const jsgraph_;
   Zone* const zone_;
 };
@@ -568,13 +570,13 @@ Maybe<int> OffsetOfElementsAccess(const Operator* op, Node* index_node) {
 }
 
 Node* LowerCompareMapsWithoutLoad(Node* checked_map,
-                                  ZoneHandleSet<Map> const& checked_against,
+                                  ZoneRefSet<Map> const& checked_against,
                                   JSGraph* jsgraph) {
   Node* true_node = jsgraph->TrueConstant();
   Node* false_node = jsgraph->FalseConstant();
   Node* replacement = false_node;
-  for (Handle<Map> map : checked_against) {
-    Node* map_node = jsgraph->HeapConstant(map);
+  for (MapRef map : checked_against) {
+    Node* map_node = jsgraph->HeapConstant(map.object());
     // We cannot create a HeapConstant type here as we are off-thread.
     NodeProperties::SetType(map_node, Type::Internal());
     Node* comparison = jsgraph->graph()->NewNode(
@@ -779,7 +781,7 @@ void ReduceNode(const Operator* op, EscapeAnalysisTracker::Scope* current,
           Type const map_type = NodeProperties::GetType(map);
           if (map_type.IsHeapConstant() &&
               params.maps().contains(
-                  map_type.AsHeapConstant()->Ref().AsMap().object())) {
+                  map_type.AsHeapConstant()->Ref().AsMap())) {
             current->MarkForDeletion();
             break;
           }
diff --git a/deps/v8/src/compiler/fast-api-calls.cc b/deps/v8/src/compiler/fast-api-calls.cc
index a2d05eedc3971e..c9f30ff560a43d 100644
--- a/deps/v8/src/compiler/fast-api-calls.cc
+++ b/deps/v8/src/compiler/fast-api-calls.cc
@@ -40,8 +40,7 @@ ElementsKind GetTypedArrayElementsKind(CTypeInfo::Type type) {
 }
 
 OverloadsResolutionResult ResolveOverloads(
-    Zone* zone, const FastApiCallFunctionVector& candidates,
-    unsigned int arg_count) {
+    const FastApiCallFunctionVector& candidates, unsigned int arg_count) {
   DCHECK_GT(arg_count, 0);
 
   static constexpr int kReceiver = 1;
@@ -249,8 +248,7 @@ Node* FastApiCallBuilder::Build(const FastApiCallFunctionVector& c_functions,
     generate_fast_call = true;
   } else {
     DCHECK_EQ(c_functions.size(), 2);
-    overloads_resolution_result =
-        ResolveOverloads(graph()->zone(), c_functions, c_arg_count);
+    overloads_resolution_result = ResolveOverloads(c_functions, c_arg_count);
     if (overloads_resolution_result.is_valid()) {
       generate_fast_call = true;
     }
@@ -269,7 +267,7 @@ Node* FastApiCallBuilder::Build(const FastApiCallFunctionVector& c_functions,
   int extra_input_count = FastApiCallNode::kEffectAndControlInputCount +
                           (c_signature->HasOptions() ? 1 : 0);
 
-  Node** const inputs = graph()->zone()->NewArray<Node*>(
+  Node** const inputs = graph()->zone()->AllocateArray<Node*>(
       kFastTargetAddressInputCount + c_arg_count + extra_input_count);
 
   ExternalReference::Type ref_type = ExternalReference::FAST_C_CALL;
diff --git a/deps/v8/src/compiler/fast-api-calls.h b/deps/v8/src/compiler/fast-api-calls.h
index eeaee7cbdc4a55..b97b37e5746433 100644
--- a/deps/v8/src/compiler/fast-api-calls.h
+++ b/deps/v8/src/compiler/fast-api-calls.h
@@ -41,8 +41,7 @@ struct OverloadsResolutionResult {
 ElementsKind GetTypedArrayElementsKind(CTypeInfo::Type type);
 
 OverloadsResolutionResult ResolveOverloads(
-    Zone* zone, const FastApiCallFunctionVector& candidates,
-    unsigned int arg_count);
+    const FastApiCallFunctionVector& candidates, unsigned int arg_count);
 
 bool CanOptimizeFastSignature(const CFunctionInfo* c_signature);
 
diff --git a/deps/v8/src/compiler/frame-states.cc b/deps/v8/src/compiler/frame-states.cc
index 97bc7abfa585a9..9135be6c168120 100644
--- a/deps/v8/src/compiler/frame-states.cc
+++ b/deps/v8/src/compiler/frame-states.cc
@@ -24,32 +24,27 @@ size_t hash_value(OutputFrameStateCombine const& sc) {
   return base::hash_value(sc.parameter_);
 }
 
-
 std::ostream& operator<<(std::ostream& os, OutputFrameStateCombine const& sc) {
   if (sc.parameter_ == OutputFrameStateCombine::kInvalidIndex)
     return os << "Ignore";
   return os << "PokeAt(" << sc.parameter_ << ")";
 }
 
-
 bool operator==(FrameStateInfo const& lhs, FrameStateInfo const& rhs) {
   return lhs.type() == rhs.type() && lhs.bailout_id() == rhs.bailout_id() &&
          lhs.state_combine() == rhs.state_combine() &&
          lhs.function_info() == rhs.function_info();
 }
 
-
 bool operator!=(FrameStateInfo const& lhs, FrameStateInfo const& rhs) {
   return !(lhs == rhs);
 }
 
-
 size_t hash_value(FrameStateInfo const& info) {
   return base::hash_combine(static_cast<int>(info.type()), info.bailout_id(),
                             info.state_combine());
 }
 
-
 std::ostream& operator<<(std::ostream& os, FrameStateType type) {
   switch (type) {
     case FrameStateType::kUnoptimizedFunction:
@@ -58,13 +53,19 @@ std::ostream& operator<<(std::ostream& os, FrameStateType type) {
     case FrameStateType::kInlinedExtraArguments:
       os << "INLINED_EXTRA_ARGUMENTS";
       break;
-    case FrameStateType::kConstructStub:
-      os << "CONSTRUCT_STUB";
+    case FrameStateType::kConstructCreateStub:
+      os << "CONSTRUCT_CREATE_STUB";
+      break;
+    case FrameStateType::kConstructInvokeStub:
+      os << "CONSTRUCT_INVOKE_STUB";
       break;
     case FrameStateType::kBuiltinContinuation:
       os << "BUILTIN_CONTINUATION_FRAME";
       break;
 #if V8_ENABLE_WEBASSEMBLY
+    case FrameStateType::kWasmInlinedIntoJS:
+      os << "WASM_INLINED_INTO_JS_FRAME";
+      break;
     case FrameStateType::kJSToWasmBuiltinContinuation:
       os << "JS_TO_WASM_BUILTIN_CONTINUATION_FRAME";
       break;
@@ -79,7 +80,6 @@ std::ostream& operator<<(std::ostream& os, FrameStateType type) {
   return os;
 }
 
-
 std::ostream& operator<<(std::ostream& os, FrameStateInfo const& info) {
   os << info.type() << ", " << info.bailout_id() << ", "
      << info.state_combine();
@@ -208,10 +208,9 @@ FrameState CreateJSWasmCallBuiltinContinuationFrameState(
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 FrameState CreateJavaScriptBuiltinContinuationFrameState(
-    JSGraph* jsgraph, const SharedFunctionInfoRef& shared, Builtin name,
-    Node* target, Node* context, Node* const* stack_parameters,
-    int stack_parameter_count, Node* outer_frame_state,
-    ContinuationFrameStateMode mode) {
+    JSGraph* jsgraph, SharedFunctionInfoRef shared, Builtin name, Node* target,
+    Node* context, Node* const* stack_parameters, int stack_parameter_count,
+    Node* outer_frame_state, ContinuationFrameStateMode mode) {
   // Depending on {mode}, final parameters are added by the deoptimizer
   // and aren't explicitly passed in the frame state.
   DCHECK_EQ(Builtins::GetStackParameterCount(name),
@@ -247,8 +246,8 @@ FrameState CreateJavaScriptBuiltinContinuationFrameState(
 }
 
 FrameState CreateGenericLazyDeoptContinuationFrameState(
-    JSGraph* graph, const SharedFunctionInfoRef& shared, Node* target,
-    Node* context, Node* receiver, Node* outer_frame_state) {
+    JSGraph* graph, SharedFunctionInfoRef shared, Node* target, Node* context,
+    Node* receiver, Node* outer_frame_state) {
   Node* stack_parameters[]{receiver};
   const int stack_parameter_count = arraysize(stack_parameters);
   return CreateJavaScriptBuiltinContinuationFrameState(
@@ -257,6 +256,16 @@ FrameState CreateGenericLazyDeoptContinuationFrameState(
       ContinuationFrameStateMode::LAZY);
 }
 
+Node* CreateInlinedApiFunctionFrameState(JSGraph* graph,
+                                         SharedFunctionInfoRef shared,
+                                         Node* target, Node* context,
+                                         Node* receiver,
+                                         Node* outer_frame_state) {
+  if (!v8_flags.experimental_stack_trace_frames) return outer_frame_state;
+  return CreateGenericLazyDeoptContinuationFrameState(
+      graph, shared, target, context, receiver, outer_frame_state);
+}
+
 FrameState CloneFrameState(JSGraph* jsgraph, FrameState frame_state,
                            OutputFrameStateCombine changed_state_combine) {
   Graph* graph = jsgraph->graph();
diff --git a/deps/v8/src/compiler/frame-states.h b/deps/v8/src/compiler/frame-states.h
index f43af70034d281..b9e0922b3b7fed 100644
--- a/deps/v8/src/compiler/frame-states.h
+++ b/deps/v8/src/compiler/frame-states.h
@@ -64,16 +64,20 @@ class OutputFrameStateCombine {
   size_t const parameter_;
 };
 
-
 // The type of stack frame that a FrameState node represents.
 enum class FrameStateType {
-  kUnoptimizedFunction,            // Represents an UnoptimizedFrame.
-  kInlinedExtraArguments,          // Represents inlined extra arguments.
-  kConstructStub,                  // Represents a ConstructStubFrame.
-  kBuiltinContinuation,            // Represents a continuation to a stub.
-#if V8_ENABLE_WEBASSEMBLY          // ↓ WebAssembly only
+  kUnoptimizedFunction,    // Represents an UnoptimizedFrame.
+  kInlinedExtraArguments,  // Represents inlined extra arguments.
+  kConstructCreateStub,    // Represents a frame created before creating a new
+                           // object in the construct stub.
+  kConstructInvokeStub,    // Represents a frame created before invoking the
+                           // constructor in the construct stub.
+  kBuiltinContinuation,    // Represents a continuation to a stub.
+#if V8_ENABLE_WEBASSEMBLY  // ↓ WebAssembly only
   kJSToWasmBuiltinContinuation,    // Represents a lazy deopt continuation for a
                                    // JS to Wasm call.
+  kWasmInlinedIntoJS,              // Represents a Wasm function inlined into a
+                                   // JS function.
 #endif                             // ↑ WebAssembly only
   kJavaScriptBuiltinContinuation,  // Represents a continuation to a JavaScipt
                                    // builtin.
@@ -98,6 +102,8 @@ class FrameStateFunctionInfo {
   FrameStateType type() const { return type_; }
 
   static bool IsJSFunctionType(FrameStateType type) {
+    // This must be in sync with TRANSLATION_JS_FRAME_OPCODE_LIST in
+    // translation-opcode.h or bad things happen.
     return type == FrameStateType::kUnoptimizedFunction ||
            type == FrameStateType::kJavaScriptBuiltinContinuation ||
            type == FrameStateType::kJavaScriptBuiltinContinuationWithCatch;
@@ -189,14 +195,22 @@ FrameState CreateJSWasmCallBuiltinContinuationFrameState(
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 FrameState CreateJavaScriptBuiltinContinuationFrameState(
-    JSGraph* graph, const SharedFunctionInfoRef& shared, Builtin name,
-    Node* target, Node* context, Node* const* stack_parameters,
-    int stack_parameter_count, Node* outer_frame_state,
-    ContinuationFrameStateMode mode);
+    JSGraph* graph, SharedFunctionInfoRef shared, Builtin name, Node* target,
+    Node* context, Node* const* stack_parameters, int stack_parameter_count,
+    Node* outer_frame_state, ContinuationFrameStateMode mode);
 
 FrameState CreateGenericLazyDeoptContinuationFrameState(
-    JSGraph* graph, const SharedFunctionInfoRef& shared, Node* target,
-    Node* context, Node* receiver, Node* outer_frame_state);
+    JSGraph* graph, SharedFunctionInfoRef shared, Node* target, Node* context,
+    Node* receiver, Node* outer_frame_state);
+
+// Creates GenericLazyDeoptContinuationFrameState if
+// --experimental-stack-trace-frames is enabled, returns outer_frame_state
+// otherwise.
+Node* CreateInlinedApiFunctionFrameState(JSGraph* graph,
+                                         SharedFunctionInfoRef shared,
+                                         Node* target, Node* context,
+                                         Node* receiver,
+                                         Node* outer_frame_state);
 
 // Creates a FrameState otherwise identical to `frame_state` except the
 // OutputFrameStateCombine is changed.
diff --git a/deps/v8/src/compiler/frame.cc b/deps/v8/src/compiler/frame.cc
index 08c90bffab904a..f549d3ac510452 100644
--- a/deps/v8/src/compiler/frame.cc
+++ b/deps/v8/src/compiler/frame.cc
@@ -46,7 +46,7 @@ void FrameAccessState::MarkHasFrame(bool state) {
 }
 
 void FrameAccessState::SetFrameAccessToDefault() {
-  if (has_frame() && !v8_flags.turbo_sp_frame_access) {
+  if (has_frame()) {
     SetFrameAccessToFP();
   } else {
     SetFrameAccessToSP();
diff --git a/deps/v8/src/compiler/globals.h b/deps/v8/src/compiler/globals.h
index 5d715761b167ea..a6d7d66bc6fe52 100644
--- a/deps/v8/src/compiler/globals.h
+++ b/deps/v8/src/compiler/globals.h
@@ -32,6 +32,8 @@ enum class StackCheckKind : uint8_t {
   kWasm,
 };
 
+enum class CanThrow : uint8_t { kNo, kYes };
+
 inline std::ostream& operator<<(std::ostream& os, StackCheckKind kind) {
   switch (kind) {
     case StackCheckKind::kJSFunctionEntry:
@@ -103,21 +105,20 @@ const int kMaxFastLiteralProperties = JSObject::kMaxInObjectProperties;
 
 enum BaseTaggedness : uint8_t { kUntaggedBase, kTaggedBase };
 
+enum class MemoryAccessKind : uint8_t {
+  kNormal,
+  kUnaligned,
+  kProtected,
+};
+
+size_t hash_value(MemoryAccessKind);
+
+V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, MemoryAccessKind);
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
 
-// Support for floating point parameters in calls to C.
-// It's currently enabled only for the platforms listed below. We don't plan
-// to add support for IA32, because it has a totally different approach
-// (using FP stack). As support is added to more platforms, please make sure
-// to list them here in order to enable tests of this functionality.
-// Make sure to sync the following with src/d8/d8-test.cc.
-#if defined(V8_TARGET_ARCH_X64) || defined(V8_TARGET_ARCH_ARM64) || \
-    defined(V8_TARGET_ARCH_MIPS64) || defined(V8_TARGET_ARCH_LOONG64)
-#define V8_ENABLE_FP_PARAMS_IN_C_LINKAGE
-#endif
-
 // The biggest double value that fits within the int64_t/uint64_t value range.
 // This is different from safe integer range in that there are gaps of integers
 // in-between that cannot be represented as a double.
@@ -126,4 +127,13 @@ constexpr double kMinDoubleRepresentableInt64 =
     std::numeric_limits<int64_t>::min();
 constexpr double kMaxDoubleRepresentableUint64 = 18446744073709549568.0;
 
+// There is no (currently) available constexpr version of base::bit_cast, so
+// we have to make do with constructing the -0.0 bits manually (by setting the
+// sign bit to 1 and everything else to 0).
+// TODO(leszeks): Revisit when upgrading to C++20.
+constexpr int32_t kMinusZeroLoBits = static_cast<int32_t>(0);
+constexpr int32_t kMinusZeroHiBits = static_cast<int32_t>(1) << 31;
+constexpr int64_t kMinusZeroBits =
+    (static_cast<uint64_t>(kMinusZeroHiBits) << 32) | kMinusZeroLoBits;
+
 #endif  // V8_COMPILER_GLOBALS_H_
diff --git a/deps/v8/src/compiler/graph-assembler.cc b/deps/v8/src/compiler/graph-assembler.cc
index f673feca22bc43..8c2e1b5f099c1b 100644
--- a/deps/v8/src/compiler/graph-assembler.cc
+++ b/deps/v8/src/compiler/graph-assembler.cc
@@ -15,6 +15,7 @@
 #include "src/compiler/linkage.h"
 #include "src/compiler/type-cache.h"
 // For TNode types.
+#include "src/deoptimizer/deoptimize-reason.h"
 #include "src/objects/elements-kind.h"
 #include "src/objects/heap-number.h"
 #include "src/objects/instance-type.h"
@@ -104,7 +105,7 @@ TNode<HeapObject> JSGraphAssembler::HeapConstant(Handle<HeapObject> object) {
       AddClonedNode(jsgraph()->HeapConstant(object)));
 }
 
-TNode<Object> JSGraphAssembler::Constant(const ObjectRef& ref) {
+TNode<Object> JSGraphAssembler::Constant(ObjectRef ref) {
   return TNode<Object>::UncheckedCast(
       AddClonedNode(jsgraph()->Constant(ref, broker())));
 }
@@ -172,6 +173,15 @@ PURE_ASSEMBLER_MACH_BINOP_LIST(PURE_BINOP_DEF, PURE_BINOP_DEF_TNODE)
 #undef PURE_BINOP_DEF
 #undef PURE_BINOP_DEF_TNODE
 
+TNode<BoolT> GraphAssembler::UintPtrLessThan(TNode<UintPtrT> left,
+                                             TNode<UintPtrT> right) {
+  return kSystemPointerSize == 8
+             ? Uint64LessThan(TNode<Uint64T>::UncheckedCast(left),
+                              TNode<Uint64T>::UncheckedCast(right))
+             : Uint32LessThan(TNode<Uint32T>::UncheckedCast(left),
+                              TNode<Uint32T>::UncheckedCast(right));
+}
+
 TNode<BoolT> GraphAssembler::UintPtrLessThanOrEqual(TNode<UintPtrT> left,
                                                     TNode<UintPtrT> right) {
   return kSystemPointerSize == 8
@@ -260,9 +270,9 @@ Node* GraphAssembler::TruncateFloat64ToInt64(Node* value, TruncateKind kind) {
       graph()->NewNode(machine()->TruncateFloat64ToInt64(kind), value));
 }
 
-Node* GraphAssembler::Projection(int index, Node* value) {
-  return AddNode(
-      graph()->NewNode(common()->Projection(index), value, control()));
+Node* GraphAssembler::Projection(int index, Node* value, Node* ctrl) {
+  return AddNode(graph()->NewNode(common()->Projection(index), value,
+                                  ctrl ? ctrl : control()));
 }
 
 Node* JSGraphAssembler::Allocate(AllocationType allocation, Node* size) {
@@ -339,9 +349,9 @@ void JSGraphAssembler::TransitionAndStoreElement(MapRef double_map,
                                                  TNode<HeapObject> object,
                                                  TNode<Number> index,
                                                  TNode<Object> value) {
-  AddNode(graph()->NewNode(simplified()->TransitionAndStoreElement(
-                               double_map.object(), fast_map.object()),
-                           object, index, value, effect(), control()));
+  AddNode(graph()->NewNode(
+      simplified()->TransitionAndStoreElement(double_map, fast_map), object,
+      index, value, effect(), control()));
 }
 
 TNode<Number> JSGraphAssembler::StringLength(TNode<String> string) {
@@ -433,9 +443,10 @@ TNode<Boolean> JSGraphAssembler::ObjectIsUndetectable(TNode<Object> value) {
       graph()->NewNode(simplified()->ObjectIsUndetectable(), value));
 }
 
-Node* JSGraphAssembler::CheckIf(Node* cond, DeoptimizeReason reason) {
-  return AddNode(graph()->NewNode(simplified()->CheckIf(reason), cond, effect(),
-                                  control()));
+Node* JSGraphAssembler::CheckIf(Node* cond, DeoptimizeReason reason,
+                                const FeedbackSource& feedback) {
+  return AddNode(graph()->NewNode(simplified()->CheckIf(reason, feedback), cond,
+                                  effect(), control()));
 }
 
 TNode<Boolean> JSGraphAssembler::NumberIsFloat64Hole(TNode<Number> value) {
@@ -481,6 +492,11 @@ Node* JSGraphAssembler::StringCharCodeAt(TNode<String> string,
                                   position, effect(), control()));
 }
 
+TNode<String> JSGraphAssembler::StringFromSingleCharCode(TNode<Number> code) {
+  return AddNode<String>(
+      graph()->NewNode(simplified()->StringFromSingleCharCode(), code));
+}
+
 class ArrayBufferViewAccessBuilder {
  public:
   explicit ArrayBufferViewAccessBuilder(JSGraphAssembler* assembler,
@@ -767,6 +783,64 @@ class ArrayBufferViewAccessBuilder {
         .Value();
   }
 
+  TNode<Word32T> BuildDetachedCheck(TNode<JSArrayBufferView> view) {
+    auto& a = *assembler_;
+
+    // Load the underlying buffer and its bitfield.
+    TNode<HeapObject> buffer = a.LoadField<HeapObject>(
+        AccessBuilder::ForJSArrayBufferViewBuffer(), view);
+    TNode<Word32T> buffer_bit_field =
+        MachineLoadField<Word32T>(AccessBuilder::ForJSArrayBufferBitField(),
+                                  buffer, UseInfo::TruncatingWord32());
+    // Mask the detached bit.
+    TNode<Word32T> detached_bit =
+        a.Word32And(buffer_bit_field,
+                    a.Uint32Constant(JSArrayBuffer::WasDetachedBit::kMask));
+
+    // If we statically know we cannot have rab/gsab backed, we are done here.
+    if (!maybe_rab_gsab()) {
+      return detached_bit;
+    }
+
+    // Otherwise, we need to generate the checks for the view's bitfield.
+    TNode<Word32T> bitfield = a.EnterMachineGraph<Word32T>(
+        a.LoadField<Word32T>(AccessBuilder::ForJSArrayBufferViewBitField(),
+                             view),
+        UseInfo::TruncatingWord32());
+    TNode<Word32T> length_tracking_bit = a.Word32And(
+        bitfield, a.Uint32Constant(JSArrayBufferView::kIsLengthTracking));
+    TNode<Word32T> backed_by_rab_bit = a.Word32And(
+        bitfield, a.Uint32Constant(JSArrayBufferView::kIsBackedByRab));
+
+    auto RabFixed = [&]() {
+      TNode<UintPtrT> unchecked_byte_length = MachineLoadField<UintPtrT>(
+          AccessBuilder::ForJSArrayBufferViewByteLength(), view,
+          UseInfo::Word());
+      TNode<UintPtrT> byte_offset = MachineLoadField<UintPtrT>(
+          AccessBuilder::ForJSArrayBufferViewByteOffset(), view,
+          UseInfo::Word());
+
+      TNode<UintPtrT> underlying_byte_length = MachineLoadField<UintPtrT>(
+          AccessBuilder::ForJSArrayBufferByteLength(), buffer, UseInfo::Word());
+
+      return a.Word32Or(
+          detached_bit,
+          a.UintPtrLessThan(underlying_byte_length,
+                            a.UintPtrAdd(byte_offset, unchecked_byte_length)));
+    };
+
+    // Dispatch depending on rab/gsab and length tracking.
+    return a.MachineSelectIf<Word32T>(length_tracking_bit)
+        .Then([&]() { return detached_bit; })
+        .Else([&]() {
+          return a.MachineSelectIf<Word32T>(backed_by_rab_bit)
+              .Then(RabFixed)
+              .Else([&]() { return detached_bit; })
+              .Value();
+        })
+        .Value();
+  }
+
  private:
   template <typename T>
   TNode<T> MachineLoadField(FieldAccess const& access, TNode<HeapObject> object,
@@ -795,12 +869,26 @@ TNode<Number> JSGraphAssembler::TypedArrayLength(
     TNode<JSTypedArray> typed_array,
     std::set<ElementsKind> elements_kinds_candidates, TNode<Context> context) {
   ArrayBufferViewAccessBuilder builder(this, JS_TYPED_ARRAY_TYPE,
-                                       elements_kinds_candidates);
+                                       std::move(elements_kinds_candidates));
   return ExitMachineGraph<Number>(builder.BuildLength(typed_array, context),
                                   MachineType::PointerRepresentation(),
                                   TypeCache::Get()->kJSTypedArrayLengthType);
 }
 
+void JSGraphAssembler::CheckIfTypedArrayWasDetached(
+    TNode<JSTypedArray> typed_array,
+    std::set<ElementsKind> elements_kinds_candidates,
+    const FeedbackSource& feedback) {
+  ArrayBufferViewAccessBuilder builder(this, JS_TYPED_ARRAY_TYPE,
+                                       std::move(elements_kinds_candidates));
+
+  TNode<Word32T> detached_check = builder.BuildDetachedCheck(typed_array);
+  TNode<Boolean> is_not_detached =
+      ExitMachineGraph<Boolean>(Word32Equal(detached_check, Uint32Constant(0)),
+                                MachineRepresentation::kBit, Type::Boolean());
+  CheckIf(is_not_detached, DeoptimizeReason::kArrayBufferWasDetached, feedback);
+}
+
 TNode<Uint32T> JSGraphAssembler::LookupByteShiftForElementsKind(
     TNode<Uint32T> elements_kind) {
   TNode<UintPtrT> index = ChangeUint32ToUintPtr(Int32Sub(
diff --git a/deps/v8/src/compiler/graph-assembler.h b/deps/v8/src/compiler/graph-assembler.h
index e474b0f6d1d905..b8ebd6140c4f3e 100644
--- a/deps/v8/src/compiler/graph-assembler.h
+++ b/deps/v8/src/compiler/graph-assembler.h
@@ -15,6 +15,7 @@
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node.h"
 #include "src/compiler/simplified-operator.h"
+#include "src/objects/hole.h"
 #include "src/objects/oddball.h"
 
 namespace v8 {
@@ -22,12 +23,6 @@ namespace internal {
 
 class JSGraph;
 class Graph;
-class Oddball;
-
-// TODO(jgruber): Currently this is too permissive, but at least it lets us
-// document which functions expect JS booleans. If a real Boolean type becomes
-// possible in the future, use that instead.
-using Boolean = Oddball;
 
 namespace compiler {
 
@@ -90,12 +85,12 @@ class Reducer;
   V(IntSub)                                         \
   T(Uint32LessThan, BoolT, Uint32T, Uint32T)        \
   T(Uint32LessThanOrEqual, BoolT, Uint32T, Uint32T) \
-  V(Uint64LessThan)                                 \
+  T(Uint64LessThan, BoolT, Uint64T, Uint64T)        \
   T(Uint64LessThanOrEqual, BoolT, Uint64T, Uint64T) \
   V(UintLessThan)                                   \
   T(Word32And, Word32T, Word32T, Word32T)           \
   T(Word32Equal, BoolT, Word32T, Word32T)           \
-  V(Word32Or)                                       \
+  T(Word32Or, Word32T, Word32T, Word32T)            \
   V(Word32Sar)                                      \
   V(Word32SarShiftOutZeros)                         \
   V(Word32Shl)                                      \
@@ -134,30 +129,28 @@ class Reducer;
   V(Uint64Div)                               \
   V(Uint64Mod)
 
-#define JSGRAPH_SINGLETON_CONSTANT_LIST(V)                   \
-  V(AllocateInOldGenerationStub, InstructionStream)          \
-  V(AllocateInYoungGenerationStub, InstructionStream)        \
-  V(AllocateRegularInOldGenerationStub, InstructionStream)   \
-  V(AllocateRegularInYoungGenerationStub, InstructionStream) \
-  V(BigIntMap, Map)                                          \
-  V(BooleanMap, Map)                                         \
-  V(EmptyString, String)                                     \
-  V(ExternalObjectMap, Map)                                  \
-  V(False, Boolean)                                          \
-  V(FixedArrayMap, Map)                                      \
-  V(FixedDoubleArrayMap, Map)                                \
-  V(WeakFixedArrayMap, Map)                                  \
-  V(HeapNumberMap, Map)                                      \
-  V(MinusOne, Number)                                        \
-  V(NaN, Number)                                             \
-  V(NoContext, Object)                                       \
-  V(Null, Oddball)                                           \
-  V(One, Number)                                             \
-  V(TheHole, Oddball)                                        \
-  V(ToNumberBuiltin, InstructionStream)                      \
-  V(PlainPrimitiveToNumberBuiltin, InstructionStream)        \
-  V(True, Boolean)                                           \
-  V(Undefined, Oddball)                                      \
+#define JSGRAPH_SINGLETON_CONSTANT_LIST(V)            \
+  V(AllocateInOldGenerationStub, InstructionStream)   \
+  V(AllocateInYoungGenerationStub, InstructionStream) \
+  V(BigIntMap, Map)                                   \
+  V(BooleanMap, Map)                                  \
+  V(EmptyString, String)                              \
+  V(ExternalObjectMap, Map)                           \
+  V(False, Boolean)                                   \
+  V(FixedArrayMap, Map)                               \
+  V(FixedDoubleArrayMap, Map)                         \
+  V(WeakFixedArrayMap, Map)                           \
+  V(HeapNumberMap, Map)                               \
+  V(MinusOne, Number)                                 \
+  V(NaN, Number)                                      \
+  V(NoContext, Object)                                \
+  V(Null, Null)                                       \
+  V(One, Number)                                      \
+  V(TheHole, Hole)                                    \
+  V(ToNumberBuiltin, InstructionStream)               \
+  V(PlainPrimitiveToNumberBuiltin, InstructionStream) \
+  V(True, Boolean)                                    \
+  V(Undefined, Undefined)                             \
   V(Zero, Number)
 
 class GraphAssembler;
@@ -336,9 +329,10 @@ class V8_EXPORT_PRIVATE GraphAssembler {
   Node* Uint64Constant(uint64_t value);
   Node* UniqueIntPtrConstant(intptr_t value);
   Node* Float64Constant(double value);
-  Node* Projection(int index, Node* value);
   Node* ExternalConstant(ExternalReference ref);
 
+  Node* Projection(int index, Node* value, Node* ctrl = nullptr);
+
   Node* Parameter(int index);
 
   Node* LoadFramePointer();
@@ -356,6 +350,7 @@ class V8_EXPORT_PRIVATE GraphAssembler {
   CHECKED_ASSEMBLER_MACH_BINOP_LIST(BINOP_DECL)
 #undef BINOP_DECL
 #undef BINOP_DECL_TNODE
+  TNode<BoolT> UintPtrLessThan(TNode<UintPtrT> left, TNode<UintPtrT> right);
   TNode<BoolT> UintPtrLessThanOrEqual(TNode<UintPtrT> left,
                                       TNode<UintPtrT> right);
   TNode<UintPtrT> UintPtrAdd(TNode<UintPtrT> left, TNode<UintPtrT> right);
@@ -541,6 +536,8 @@ class V8_EXPORT_PRIVATE GraphAssembler {
   Control control() const { return Control(control_); }
   Effect effect() const { return Effect(effect_); }
 
+  Node* start() const { return graph()->start(); }
+
  protected:
   constexpr bool Is64() const { return kSystemPointerSize == 8; }
 
@@ -958,7 +955,7 @@ class V8_EXPORT_PRIVATE JSGraphAssembler : public GraphAssembler {
 
   Node* SmiConstant(int32_t value);
   TNode<HeapObject> HeapConstant(Handle<HeapObject> object);
-  TNode<Object> Constant(const ObjectRef& ref);
+  TNode<Object> Constant(ObjectRef ref);
   TNode<Number> NumberConstant(double value);
   Node* CEntryStubConstant(int result_size);
 
@@ -1017,7 +1014,8 @@ class V8_EXPORT_PRIVATE JSGraphAssembler : public GraphAssembler {
   TNode<Boolean> ObjectIsCallable(TNode<Object> value);
   TNode<Boolean> ObjectIsSmi(TNode<Object> value);
   TNode<Boolean> ObjectIsUndetectable(TNode<Object> value);
-  Node* CheckIf(Node* cond, DeoptimizeReason reason);
+  Node* CheckIf(Node* cond, DeoptimizeReason reason,
+                const FeedbackSource& feedback = {});
   TNode<Boolean> NumberIsFloat64Hole(TNode<Number> value);
   TNode<Boolean> ToBoolean(TNode<Object> value);
   TNode<Object> ConvertTaggedHoleToUndefined(TNode<Object> value);
@@ -1028,6 +1026,7 @@ class V8_EXPORT_PRIVATE JSGraphAssembler : public GraphAssembler {
                                               TNode<Number> new_length,
                                               TNode<Number> old_length);
   Node* StringCharCodeAt(TNode<String> string, TNode<Number> position);
+  TNode<String> StringFromSingleCharCode(TNode<Number> code);
   TNode<Object> DoubleArrayMax(TNode<JSArray> array);
   TNode<Object> DoubleArrayMin(TNode<JSArray> array);
   // Computes the byte length for a given {array_buffer_view}. If the set of
@@ -1046,6 +1045,12 @@ class V8_EXPORT_PRIVATE JSGraphAssembler : public GraphAssembler {
   TNode<Number> TypedArrayLength(
       TNode<JSTypedArray> typed_array,
       std::set<ElementsKind> elements_kinds_candidates, TNode<Context> context);
+  // Performs the full detached check. This includes fixed-length RABs whos
+  // underlying buffer has been shrunk OOB.
+  void CheckIfTypedArrayWasDetached(
+      TNode<JSTypedArray> typed_array,
+      std::set<ElementsKind> elements_kinds_candidates,
+      const FeedbackSource& feedback);
   TNode<Uint32T> LookupByteShiftForElementsKind(TNode<Uint32T> elements_kind);
   TNode<Uint32T> LookupByteSizeForElementsKind(TNode<Uint32T> elements_kind);
 
diff --git a/deps/v8/src/compiler/graph-reducer.h b/deps/v8/src/compiler/graph-reducer.h
index 0877945bb539e5..ae8def719f3c66 100644
--- a/deps/v8/src/compiler/graph-reducer.h
+++ b/deps/v8/src/compiler/graph-reducer.h
@@ -6,7 +6,9 @@
 #define V8_COMPILER_GRAPH_REDUCER_H_
 
 #include "src/base/compiler-specific.h"
+#include "src/compiler/graph.h"
 #include "src/compiler/node-marker.h"
+#include "src/compiler/node-properties.h"
 #include "src/zone/zone-containers.h"
 
 namespace v8 {
@@ -133,6 +135,12 @@ class AdvancedReducer : public Reducer {
     ReplaceWithValue(node, node, node, nullptr);
   }
 
+  void MergeControlToEnd(Graph* graph, CommonOperatorBuilder* common,
+                         Node* node) {
+    NodeProperties::MergeControlToEnd(graph, common, node);
+    Revisit(graph->end());
+  }
+
  private:
   Editor* const editor_;
 };
diff --git a/deps/v8/src/compiler/graph-visualizer.cc b/deps/v8/src/compiler/graph-visualizer.cc
index 88dfbcab1fe57f..9ec14df9b6138d 100644
--- a/deps/v8/src/compiler/graph-visualizer.cc
+++ b/deps/v8/src/compiler/graph-visualizer.cc
@@ -27,6 +27,12 @@
 #include "src/objects/shared-function-info.h"
 #include "src/utils/ostreams.h"
 
+#if V8_ENABLE_WEBASSEMBLY
+#include "src/wasm/function-body-decoder.h"
+#include "src/wasm/names-provider.h"
+#include "src/wasm/string-builder.h"
+#endif
+
 namespace v8 {
 namespace internal {
 namespace compiler {
@@ -62,30 +68,6 @@ std::ostream& operator<<(std::ostream& out, const NodeOriginAsJSON& asJSON) {
   return out;
 }
 
-class JSONEscaped {
- public:
-  explicit JSONEscaped(const std::ostringstream& os) : str_(os.str()) {}
-
-  friend std::ostream& operator<<(std::ostream& os, const JSONEscaped& e) {
-    for (char c : e.str_) PipeCharacter(os, c);
-    return os;
-  }
-
- private:
-  static std::ostream& PipeCharacter(std::ostream& os, char c) {
-    if (c == '"') return os << "\\\"";
-    if (c == '\\') return os << "\\\\";
-    if (c == '\b') return os << "\\b";
-    if (c == '\f') return os << "\\f";
-    if (c == '\n') return os << "\\n";
-    if (c == '\r') return os << "\\r";
-    if (c == '\t') return os << "\\t";
-    return os << c;
-  }
-
-  const std::string str_;
-};
-
 void JsonPrintBytecodeSource(std::ostream& os, int source_id,
                              std::unique_ptr<char[]> function_name,
                              Handle<BytecodeArray> bytecode_array) {
@@ -109,24 +91,60 @@ void JsonPrintFunctionSource(std::ostream& os, int source_id,
 
   int start = 0;
   int end = 0;
-  if (!script.is_null() && !script->IsUndefined(isolate) && !shared.is_null()) {
-    Object source_name = script->name();
+  if (!script.is_null() && !IsUndefined(*script, isolate) &&
+      !shared.is_null()) {
+    Tagged<Object> source_name = script->name();
     os << ", \"sourceName\": \"";
-    if (source_name.IsString()) {
+    if (IsString(source_name)) {
       std::ostringstream escaped_name;
-      escaped_name << String::cast(source_name).ToCString().get();
+      escaped_name << String::cast(source_name)->ToCString().get();
       os << JSONEscaped(escaped_name);
     }
     os << "\"";
     {
-      DisallowGarbageCollection no_gc;
       start = shared->StartPosition();
       end = shared->EndPosition();
       os << ", \"sourceText\": \"";
-      int len = shared->EndPosition() - start;
-      SubStringRange source(String::cast(script->source()), no_gc, start, len);
-      for (auto c : source) {
-        os << AsEscapedUC16ForJSON(c);
+      if (!IsUndefined(script->source())) {
+        DisallowGarbageCollection no_gc;
+        int len = shared->EndPosition() - start;
+        SubStringRange source(String::cast(script->source()), no_gc, start,
+                              len);
+        for (auto c : source) {
+          os << AsEscapedUC16ForJSON(c);
+        }
+#if V8_ENABLE_WEBASSEMBLY
+      } else if (shared->HasWasmExportedFunctionData()) {
+        Tagged<WasmExportedFunctionData> function_data =
+            shared->wasm_exported_function_data();
+        Handle<WasmInstanceObject> instance(function_data->instance(), isolate);
+        const wasm::WasmModule* module = instance->module();
+        wasm::NativeModule* native_module =
+            instance->module_object()->native_module();
+
+        // Add a comment with the wasm debug name as the sourceName above will
+        // be something like "wasm://wasm/5b5cdc9e:js-to-wasm:n:i".
+        std::ostringstream str;
+        wasm::StringBuilder sb;
+        sb << "// debug name: ";
+        native_module->GetNamesProvider()->PrintFunctionName(
+            sb, function_data->function_index(),
+            wasm::NamesProvider::kDevTools);
+        sb << '\n';
+        str.write(sb.start(), sb.length());
+
+        wasm::WireBytesRef wire_bytes_ref =
+            module->functions[function_data->function_index()].code;
+        base::Vector<const uint8_t> bytes(native_module->wire_bytes().SubVector(
+            wire_bytes_ref.offset(), wire_bytes_ref.end_offset()));
+        wasm::FunctionBody func_body{function_data->sig(),
+                                     wire_bytes_ref.offset(), bytes.begin(),
+                                     bytes.end()};
+        AccountingAllocator allocator;
+        wasm::PrintRawWasmCode(&allocator, func_body, module,
+                               wasm::kPrintLocals, str);
+        os << JSONEscaped(str);
+#endif  // V8_ENABLE_WEBASSEMBLY
       }
       os << "\"";
     }
@@ -180,8 +198,13 @@ void JsonPrintAllBytecodeSources(std::ostream& os,
   SourceIdAssigner id_assigner(info->inlined_functions().size());
 
   for (unsigned id = 0; id < inlined.size(); id++) {
-    os << ", ";
     Handle<SharedFunctionInfo> shared_info = inlined[id].shared_info;
+#if V8_ENABLE_WEBASSEMBLY
+    if (shared_info->HasWasmFunctionData()) {
+      continue;
+    }
+#endif  // V8_ENABLE_WEBASSEMBLY
+    os << ", ";
     const int source_id = id_assigner.GetIdFor(shared_info);
     JsonPrintBytecodeSource(os, source_id, shared_info->DebugNameCStr(),
                             inlined[id].bytecode_array);
@@ -226,6 +249,60 @@ void JsonPrintAllSourceWithPositions(std::ostream& os,
   os << "}";
 }
 
+#if V8_ENABLE_WEBASSEMBLY
+void JsonPrintAllSourceWithPositionsWasm(
+    std::ostream& os, const wasm::WasmModule* module,
+    const wasm::WireBytesStorage* wire_bytes,
+    base::Vector<WasmInliningPosition> positions) {
+  // Filter out duplicate sources. (A single wasm function might be inlined more
+  // than once.)
+  std::vector<int /*function id*/> sources;
+  std::unordered_map<int /*function id*/, size_t /*source index*/> source_map;
+  for (WasmInliningPosition pos : positions) {
+    auto [_, inserted] =
+        source_map.emplace(pos.inlinee_func_index, sources.size());
+    if (inserted) {
+      // The function wasn't inlined yet. Add a new entry to the sources.
+      // The hashmap stores the index to the entry in the source map.
+      sources.push_back(pos.inlinee_func_index);
+    }
+    // Don't do anything if it was already inserted.
+  }
+
+  // Print inlining sources.
+  os << "\"sources\": {";
+  for (size_t i = 0; i < sources.size(); ++i) {
+    if (i != 0) os << ", ";
+    int function_id = sources[i];
+    const wasm::WasmFunction& fct = module->functions[function_id];
+    os << '"' << i << "\": {\"sourceId\": " << i << ", \"functionName\": \""
+       << fct.func_index << "\", \"sourceName\": \"\", \"sourceText\": \"";
+    wasm::WireBytesRef wire_bytes_ref = fct.code;
+    base::Vector<const uint8_t> bytes = wire_bytes->GetCode(wire_bytes_ref);
+    wasm::FunctionBody func_body{fct.sig, wire_bytes_ref.offset(),
+                                 bytes.begin(), bytes.end()};
+    AccountingAllocator allocator;
+    std::ostringstream wasm_str;
+    wasm::PrintRawWasmCode(&allocator, func_body, module, wasm::kPrintLocals,
+                           wasm_str);
+    os << JSONEscaped(wasm_str) << "\"}";
+  }
+  os << "},\n";
+  // Print inlining mappings.
+  // This maps the inlining position to the deduplicated source in the sources
+  // object generated above.
+  os << "\"inlinings\": {";
+  for (size_t i = 0; i < positions.size(); ++i) {
+    if (i != 0) os << ", ";
+    size_t source_id = source_map.find(positions[i].inlinee_func_index)->second;
+    SourcePosition inlining_pos = positions[i].caller_pos;
+    os << '"' << i << "\": {\"inliningId\": " << i
+       << ", \"sourceId\": " << source_id
+       << ", \"inliningPosition\": " << AsJSON(inlining_pos) << "}";
+  }
+}
+#endif
+
 std::unique_ptr<char[]> GetVisualizerLogFileName(OptimizedCompilationInfo* info,
                                                  const char* optional_base_dir,
                                                  const char* phase,
@@ -252,12 +329,13 @@ std::unique_ptr<char[]> GetVisualizerLogFileName(OptimizedCompilationInfo* info,
   base::EmbeddedVector<char, 256> source_file(0);
   bool source_available = false;
   if (v8_flags.trace_file_names && info->has_shared_info() &&
-      info->shared_info()->script().IsScript()) {
-    Object source_name = Script::cast(info->shared_info()->script()).name();
-    if (source_name.IsString()) {
-      String str = String::cast(source_name);
-      if (str.length() > 0) {
-        SNPrintF(source_file, "%s", str.ToCString().get());
+      IsScript(info->shared_info()->script())) {
+    Tagged<Object> source_name =
+        Script::cast(info->shared_info()->script())->name();
+    if (IsString(source_name)) {
+      Tagged<String> str = String::cast(source_name);
+      if (str->length() > 0) {
+        SNPrintF(source_file, "%s", str->ToCString().get());
         std::replace(source_file.begin(),
                      source_file.begin() + source_file.length(), '/', '_');
         source_available = true;
@@ -805,24 +883,21 @@ void GraphC1Visualizer::PrintLiveRange(const LiveRange* range, const char* type,
     os_ << " " << parent->vreg() << ":" << parent->relative_id();
 
     // TODO(herhut) Find something useful to print for the hint field
-    if (range->get_bundle() != nullptr) {
-      os_ << " B" << range->get_bundle()->id();
+    if (parent->get_bundle() != nullptr) {
+      os_ << " B" << parent->get_bundle()->id();
     } else {
       os_ << " unknown";
     }
 
-    for (const UseInterval* interval = range->first_interval();
-         interval != nullptr; interval = interval->next()) {
-      os_ << " [" << interval->start().value() << ", "
-          << interval->end().value() << "[";
+    for (const UseInterval& interval : range->intervals()) {
+      os_ << " [" << interval.start().value() << ", " << interval.end().value()
+          << "[";
     }
 
-    UsePosition* current_pos = range->first_pos();
-    while (current_pos != nullptr) {
-      if (current_pos->RegisterIsBeneficial() || v8_flags.trace_all_uses) {
-        os_ << " " << current_pos->pos().value() << " M";
+    for (const UsePosition* pos : range->positions()) {
+      if (pos->RegisterIsBeneficial() || v8_flags.trace_all_uses) {
+        os_ << " " << pos->pos().value() << " M";
       }
-      current_pos = current_pos->next();
     }
 
     os_ << " \"\"\n";
@@ -881,7 +956,7 @@ std::ostream& operator<<(std::ostream& os, const AsRPO& ar) {
   // the node itself, if there are no cycles. Any cycles are broken
   // arbitrarily.
 
-  ZoneVector<byte> state(ar.graph.NodeCount(), kUnvisited, &local_zone);
+  ZoneVector<uint8_t> state(ar.graph.NodeCount(), kUnvisited, &local_zone);
   ZoneStack<Node*> stack(&local_zone);
 
   stack.push(ar.graph.end());
@@ -1023,27 +1098,25 @@ std::ostream& operator<<(std::ostream& os,
 
   os << ",\"intervals\":[";
   bool first = true;
-  for (const UseInterval* interval = range.first_interval();
-       interval != nullptr; interval = interval->next()) {
+  for (const UseInterval& interval : range.intervals()) {
     if (first) {
       first = false;
     } else {
       os << ",";
     }
-    os << "[" << interval->start().value() << "," << interval->end().value()
+    os << "[" << interval.start().value() << "," << interval.end().value()
        << "]";
   }
 
   os << "],\"uses\":[";
   first = true;
-  for (UsePosition* current_pos = range.first_pos(); current_pos != nullptr;
-       current_pos = current_pos->next()) {
+  for (const UsePosition* pos : range.positions()) {
     if (first) {
       first = false;
     } else {
       os << ",";
     }
-    os << current_pos->pos().value();
+    os << pos->pos().value();
   }
 
   os << "]}";
@@ -1068,12 +1141,11 @@ std::ostream& operator<<(
       os << LiveRangeAsJSON{*child, top_level_live_range_json.code_};
       // Record the minimum and maximum positions observed within this
       // TopLevelLiveRange
-      for (const UseInterval* interval = child->first_interval();
-           interval != nullptr; interval = interval->next()) {
-        if (interval->start().value() < instruction_range[0])
-          instruction_range[0] = interval->start().value();
-        if (interval->end().value() > instruction_range[1])
-          instruction_range[1] = interval->end().value();
+      for (const UseInterval& interval : child->intervals()) {
+        if (interval.start().value() < instruction_range[0])
+          instruction_range[0] = interval.start().value();
+        if (interval.end().value() > instruction_range[1])
+          instruction_range[1] = interval.end().value();
       }
     }
   }
diff --git a/deps/v8/src/compiler/graph-visualizer.h b/deps/v8/src/compiler/graph-visualizer.h
index e50a32db84174c..0b3cb604a22708 100644
--- a/deps/v8/src/compiler/graph-visualizer.h
+++ b/deps/v8/src/compiler/graph-visualizer.h
@@ -23,6 +23,13 @@ namespace internal {
 class OptimizedCompilationInfo;
 class SharedFunctionInfo;
 class SourcePosition;
+struct WasmInliningPosition;
+
+namespace wasm {
+struct WasmModule;
+class WireBytesStorage;
+}  // namespace wasm
+
 namespace compiler {
 
 class Graph;
@@ -40,6 +47,37 @@ class Schedule;
 class SourcePositionTable;
 class Type;
 
+class JSONEscaped {
+ public:
+  template <typename T>
+  explicit JSONEscaped(const T& value) {
+    std::ostringstream s;
+    s << value;
+    str_ = s.str();
+  }
+  explicit JSONEscaped(std::string str) : str_(std::move(str)) {}
+  explicit JSONEscaped(const std::ostringstream& os) : str_(os.str()) {}
+
+  friend std::ostream& operator<<(std::ostream& os, const JSONEscaped& e) {
+    for (char c : e.str_) PipeCharacter(os, c);
+    return os;
+  }
+
+ private:
+  static std::ostream& PipeCharacter(std::ostream& os, char c) {
+    if (c == '"') return os << "\\\"";
+    if (c == '\\') return os << "\\\\";
+    if (c == '\b') return os << "\\b";
+    if (c == '\f') return os << "\\f";
+    if (c == '\n') return os << "\\n";
+    if (c == '\r') return os << "\\r";
+    if (c == '\t') return os << "\\t";
+    return os << c;
+  }
+
+  std::string str_;
+};
+
 struct TurboJsonFile : public std::ofstream {
   TurboJsonFile(OptimizedCompilationInfo* info, std::ios_base::openmode mode);
   ~TurboJsonFile() override;
@@ -98,6 +136,13 @@ void JsonPrintAllSourceWithPositions(std::ostream& os,
                                      OptimizedCompilationInfo* info,
                                      Isolate* isolate);
 
+#if V8_ENABLE_WEBASSEMBLY
+void JsonPrintAllSourceWithPositionsWasm(
+    std::ostream& os, const wasm::WasmModule* module,
+    const wasm::WireBytesStorage* wire_bytes,
+    base::Vector<WasmInliningPosition> positions);
+#endif
+
 void JsonPrintFunctionSource(std::ostream& os, int source_id,
                              std::unique_ptr<char[]> function_name,
                              Handle<Script> script, Isolate* isolate,
diff --git a/deps/v8/src/compiler/heap-refs.cc b/deps/v8/src/compiler/heap-refs.cc
index 058fa5fd4db19b..4a0c6078061079 100644
--- a/deps/v8/src/compiler/heap-refs.cc
+++ b/deps/v8/src/compiler/heap-refs.cc
@@ -13,7 +13,7 @@
 #include "src/api/api-inl.h"
 #include "src/base/optional.h"
 #include "src/compiler/compilation-dependencies.h"
-#include "src/compiler/js-heap-broker.h"
+#include "src/compiler/js-heap-broker-inl.h"
 #include "src/execution/protectors-inl.h"
 #include "src/objects/allocation-site-inl.h"
 #include "src/objects/descriptor-array.h"
@@ -89,22 +89,24 @@ class ObjectData : public ZoneObject {
 
     // It is safe to access read only heap objects and builtins from a
     // background thread. When we read fields of these objects, we may create
-    // ObjectData on the background thread even without a canonical handle
-    // scope. This is safe too since we don't create handles but just get
-    // handles from read only root table or builtins table which is what
-    // canonical scope uses as well. For all other objects we should have
-    // created ObjectData in canonical handle scope on the main thread.
+    // ObjectData on the background thread.
+    // This is safe too since we don't create handles but just get handles from
+    // read only root table or builtins table.
+    // All other objects need to be canonicalized in a persistent handle scope.
+    // See CanonicalPersistentHandle().
     Isolate* isolate = broker->isolate();
-    CHECK_IMPLIES(broker->mode() == JSHeapBroker::kDisabled ||
-                      broker->mode() == JSHeapBroker::kSerializing,
-                  isolate->handle_scope_data()->canonical_scope != nullptr);
-    CHECK_IMPLIES(broker->mode() == JSHeapBroker::kSerialized,
-                  kind == kUnserializedReadOnlyHeapObject || kind == kSmi ||
-                      kind == kNeverSerializedHeapObject ||
-                      kind == kBackgroundSerializedHeapObject);
-    CHECK_IMPLIES(kind == kUnserializedReadOnlyHeapObject,
-                  object->IsHeapObject() &&
-                      ReadOnlyHeap::Contains(HeapObject::cast(*object)));
+    USE(isolate);
+    DCHECK_IMPLIES(broker->mode() == JSHeapBroker::kDisabled ||
+                       broker->mode() == JSHeapBroker::kSerializing,
+                   PersistentHandlesScope::IsActive(isolate) &&
+                       broker->IsCanonicalHandle(object));
+    DCHECK_IMPLIES(broker->mode() == JSHeapBroker::kSerialized,
+                   kind == kUnserializedReadOnlyHeapObject || kind == kSmi ||
+                       kind == kNeverSerializedHeapObject ||
+                       kind == kBackgroundSerializedHeapObject);
+    DCHECK_IMPLIES(kind == kUnserializedReadOnlyHeapObject,
+                   i::IsHeapObject(*object) &&
+                       ReadOnlyHeap::Contains(HeapObject::cast(*object)));
   }
 
 #define DECLARE_IS(Name) bool Is##Name() const;
@@ -123,7 +125,7 @@ class ObjectData : public ZoneObject {
            kind_ == kNeverSerializedHeapObject ||
            kind_ == kUnserializedReadOnlyHeapObject;
   }
-  bool IsNull() const { return object_->IsNull(); }
+  bool IsNull() const { return i::IsNull(*object_); }
 
 #ifdef DEBUG
   JSHeapBroker* broker() const { return broker_; }
@@ -179,11 +181,11 @@ class PropertyCellData : public HeapObjectData {
 namespace {
 
 ZoneVector<Address> GetCFunctions(FixedArray function_overloads, Zone* zone) {
-  const int len = function_overloads.length() /
+  const int len = function_overloads->length() /
                   FunctionTemplateInfo::kFunctionOverloadEntrySize;
   ZoneVector<Address> c_functions = ZoneVector<Address>(len, zone);
   for (int i = 0; i < len; i++) {
-    c_functions[i] = v8::ToCData<Address>(function_overloads.get(
+    c_functions[i] = v8::ToCData<Address>(function_overloads->get(
         FunctionTemplateInfo::kFunctionOverloadEntrySize * i));
   }
   return c_functions;
@@ -191,12 +193,12 @@ ZoneVector<Address> GetCFunctions(FixedArray function_overloads, Zone* zone) {
 
 ZoneVector<const CFunctionInfo*> GetCSignatures(FixedArray function_overloads,
                                                 Zone* zone) {
-  const int len = function_overloads.length() /
+  const int len = function_overloads->length() /
                   FunctionTemplateInfo::kFunctionOverloadEntrySize;
   ZoneVector<const CFunctionInfo*> c_signatures =
       ZoneVector<const CFunctionInfo*>(len, zone);
   for (int i = 0; i < len; i++) {
-    c_signatures[i] = v8::ToCData<const CFunctionInfo*>(function_overloads.get(
+    c_signatures[i] = v8::ToCData<const CFunctionInfo*>(function_overloads->get(
         FunctionTemplateInfo::kFunctionOverloadEntrySize * i + 1));
   }
   return c_signatures;
@@ -282,7 +284,7 @@ OptionalObjectRef GetOwnFastDataPropertyFromHeap(JSHeapBroker* broker,
                                                  JSObjectRef holder,
                                                  Representation representation,
                                                  FieldIndex field_index) {
-  base::Optional<Object> constant;
+  base::Optional<Tagged<Object>> constant;
   {
     DisallowGarbageCollection no_gc;
     PtrComprCageBase cage_base = broker->cage_base();
@@ -307,13 +309,13 @@ OptionalObjectRef GetOwnFastDataPropertyFromHeap(JSHeapBroker* broker,
         return {};
       }
     } else {
-      Object raw_properties_or_hash =
+      Tagged<Object> raw_properties_or_hash =
           holder.object()->raw_properties_or_hash(cage_base, kRelaxedLoad);
       // Ensure that the object is safe to inspect.
       if (broker->ObjectMayBeUninitialized(raw_properties_or_hash)) {
         return {};
       }
-      if (!raw_properties_or_hash.IsPropertyArray(cage_base)) {
+      if (!IsPropertyArray(raw_properties_or_hash, cage_base)) {
         TRACE_BROKER_MISSING(
             broker,
             "Expected PropertyArray for backing store in " << holder << ".");
@@ -321,25 +323,35 @@ OptionalObjectRef GetOwnFastDataPropertyFromHeap(JSHeapBroker* broker,
       }
       PropertyArray properties = PropertyArray::cast(raw_properties_or_hash);
       const int array_index = field_index.outobject_array_index();
-      if (array_index < properties.length(kAcquireLoad)) {
-        constant = properties.get(array_index);
+      if (array_index < properties->length(kAcquireLoad)) {
+        constant = properties->get(array_index);
       } else {
         TRACE_BROKER_MISSING(
             broker, "Backing store for " << holder << " not long enough.");
         return {};
       }
     }
+    // We might read the uninitialized sentinel, if we race with the main
+    // thread adding a new property to the object (having set the map, but not
+    // yet initialised the property value). Since this is a tight race, it won't
+    // happen very often, so we can just abort the load.
+    // TODO(leszeks): We could instead sleep/yield and spin the load, since the
+    // timing on this is tight enough that we wouldn't delay the compiler thread
+    // by much.
+    if (IsUninitialized(constant.value())) {
+      TRACE_BROKER_MISSING(broker, "Read uninitialized property.");
+      return {};
+    }
 
     // {constant} needs to pass the gc predicate before we can introspect on it.
     if (broker->ObjectMayBeUninitialized(constant.value())) return {};
 
     // Ensure that {constant} matches the {representation} we expect for the
     // field.
-    if (!constant->FitsRepresentation(representation, false)) {
-      const char* repString =
-          constant->IsSmi()
-              ? "Smi"
-              : constant->IsHeapNumber() ? "HeapNumber" : "HeapObject";
+    if (!Object::FitsRepresentation(*constant, representation, false)) {
+      const char* repString = IsSmi(*constant)          ? "Smi"
+                              : IsHeapNumber(*constant) ? "HeapNumber"
+                                                        : "HeapObject";
       TRACE_BROKER_MISSING(broker, "Mismatched representation for "
                                        << holder << ". Expected "
                                        << representation << ", but object is a "
@@ -365,8 +377,9 @@ OptionalObjectRef GetOwnDictionaryPropertyFromHeap(JSHeapBroker* broker,
     DisallowGarbageCollection no_gc;
     // DictionaryPropertyAt will check that we are within the bounds of the
     // object.
-    base::Optional<Object> maybe_constant = JSObject::DictionaryPropertyAt(
-        receiver, dict_index, broker->isolate()->heap());
+    base::Optional<Tagged<Object>> maybe_constant =
+        JSObject::DictionaryPropertyAt(receiver, dict_index,
+                                       broker->isolate()->heap());
     DCHECK_IMPLIES(broker->IsMainThread(), maybe_constant);
     if (!maybe_constant) return {};
     constant = broker->CanonicalPersistentHandle(maybe_constant.value());
@@ -424,7 +437,7 @@ class JSFunctionData : public JSObjectData {
     DCHECK(serialized_);
     return context_;
   }
-  MapData* initial_map() const {
+  ObjectData* initial_map() const {
     DCHECK(serialized_);
     return initial_map_;
   }
@@ -482,7 +495,8 @@ class JSFunctionData : public JSObjectData {
   bool PrototypeRequiresRuntimeLookup_ = false;
 
   ObjectData* context_ = nullptr;
-  MapData* initial_map_ = nullptr;  // Derives from prototype_or_initial_map_.
+  ObjectData* initial_map_ =
+      nullptr;  // Derives from prototype_or_initial_map_.
   ObjectData* instance_prototype_ =
       nullptr;  // Derives from prototype_or_initial_map_.
   ObjectData* shared_ = nullptr;
@@ -560,11 +574,11 @@ int InstanceSizeWithMinSlack(JSHeapBroker* broker, MapRef map) {
     DisallowGarbageCollection no_gc;
 
     // Has to be an initial map.
-    DCHECK(map.object()->GetBackPointer().IsUndefined(broker->isolate()));
+    DCHECK(IsUndefined(map.object()->GetBackPointer(), broker->isolate()));
 
     static constexpr bool kConcurrentAccess = true;
     TransitionsAccessor(broker->isolate(), *map.object(), kConcurrentAccess)
-        .TraverseTransitionTree([&](Map m) {
+        .TraverseTransitionTree([&](Tagged<Map> m) {
           maps.push_back(broker->CanonicalPersistentHandle(m));
         });
   }
@@ -610,7 +624,10 @@ void JSFunctionData::Cache(JSHeapBroker* broker) {
 
     has_initial_map_ = prototype_or_initial_map_->IsMap();
     if (has_initial_map_) {
-      initial_map_ = prototype_or_initial_map_->AsMap();
+      // MapData is not used for initial_map_ because some
+      // AlwaysSharedSpaceJSObject subclass constructors (e.g. SharedArray) have
+      // initial maps in RO space, which can be accessed directly.
+      initial_map_ = prototype_or_initial_map_;
 
       MapRef initial_map_ref = TryMakeRef<Map>(broker, initial_map_).value();
       if (initial_map_ref.IsInobjectSlackTrackingInProgress()) {
@@ -630,8 +647,8 @@ void JSFunctionData::Cache(JSHeapBroker* broker) {
               broker, Handle<Map>::cast(initial_map_->object())->prototype())
               .data();
     } else if (prototype_or_initial_map_->IsHeapObject() &&
-               !Handle<HeapObject>::cast(prototype_or_initial_map_->object())
-                    ->IsTheHole()) {
+               !IsTheHole(*Handle<HeapObject>::cast(
+                   prototype_or_initial_map_->object()))) {
       has_instance_prototype_ = true;
       instance_prototype_ = prototype_or_initial_map_;
     }
@@ -654,7 +671,11 @@ bool JSFunctionData::IsConsistentWithHeapState(JSHeapBroker* broker) const {
 
   Handle<JSFunction> f = Handle<JSFunction>::cast(object());
 
-  CHECK_EQ(*context_->object(), f->context());
+  if (*context_->object() != f->context()) {
+    TRACE_BROKER_MISSING(broker, "JSFunction::context");
+    return false;
+  }
+
   CHECK_EQ(*shared_->object(), f->shared());
 
   if (f->has_prototype_slot()) {
@@ -739,22 +760,23 @@ base::Optional<bool> HeapObjectData::TryGetBooleanValue(
     JSHeapBroker* broker) const {
   // Keep in sync with Object::BooleanValue.
   auto result = TryGetBooleanValueImpl(broker);
-  DCHECK_IMPLIES(broker->IsMainThread() && result.has_value(),
-                 result.value() == object()->BooleanValue(broker->isolate()));
+  DCHECK_IMPLIES(
+      broker->IsMainThread() && result.has_value(),
+      result.value() == Object::BooleanValue(*object(), broker->isolate()));
   return result;
 }
 
 base::Optional<bool> HeapObjectData::TryGetBooleanValueImpl(
     JSHeapBroker* broker) const {
   DisallowGarbageCollection no_gc;
-  Object o = *object();
+  Tagged<Object> o = *object();
   Isolate* isolate = broker->isolate();
   const InstanceType t = GetMapInstanceType();
-  if (o.IsTrue(isolate)) {
+  if (IsTrue(o, isolate)) {
     return true;
-  } else if (o.IsFalse(isolate)) {
+  } else if (IsFalse(o, isolate)) {
     return false;
-  } else if (o.IsNullOrUndefined(isolate)) {
+  } else if (IsNullOrUndefined(o, isolate)) {
     return false;
   } else if (MapRef{map()}.is_undetectable()) {
     return false;  // Undetectable object is false.
@@ -787,7 +809,7 @@ bool IsReadOnlyLengthDescriptor(Isolate* isolate, Handle<Map> jsarray_map) {
       JSArray::kLengthOffset == JSObject::kHeaderSize,
       "The length should be the first property on the descriptor array");
   InternalIndex offset(0);
-  return descriptors.GetDetails(offset).IsReadOnly();
+  return descriptors->GetDetails(offset).IsReadOnly();
 }
 
 // Important: this predicate does not check Protectors::IsNoElementsIntact. The
@@ -797,7 +819,7 @@ bool IsReadOnlyLengthDescriptor(Isolate* isolate, Handle<Map> jsarray_map) {
 bool SupportsFastArrayIteration(JSHeapBroker* broker, Handle<Map> map) {
   return map->instance_type() == JS_ARRAY_TYPE &&
          IsFastElementsKind(map->elements_kind()) &&
-         map->prototype().IsJSArray() &&
+         IsJSArray(map->prototype()) &&
          broker->IsArrayOrObjectPrototype(broker->CanonicalPersistentHandle(
              JSArray::cast(map->prototype())));
 }
@@ -839,7 +861,7 @@ MapData::MapData(JSHeapBroker* broker, ObjectData** storage, Handle<Map> object,
   unused_property_fields_ = object->UnusedPropertyFields();
   is_abandoned_prototype_map_ = object->is_abandoned_prototype_map();
   in_object_properties_ =
-      object->IsJSObjectMap() ? object->GetInObjectProperties() : 0;
+      IsJSObjectMap(*object) ? object->GetInObjectProperties() : 0;
 }
 
 class FixedArrayBaseData : public HeapObjectData {
@@ -894,7 +916,7 @@ class JSGlobalProxyData : public JSObjectData {
 #define DEFINE_IS(Name)                                                 \
   bool ObjectData::Is##Name() const {                                   \
     if (should_access_heap()) {                                         \
-      return object()->Is##Name();                                      \
+      return i::Is##Name(*object());                                    \
     }                                                                   \
     if (is_smi()) return false;                                         \
     InstanceType instance_type =                                        \
@@ -913,16 +935,16 @@ HEAP_BROKER_OBJECT_LIST(DEFINE_IS)
 HEAP_BROKER_BACKGROUND_SERIALIZED_OBJECT_LIST(DEFINE_AS)
 #undef DEFINE_AS
 
-bool ObjectRef::equals(const ObjectRef& other) const {
-  return data_ == other.data_;
-}
+bool ObjectRef::equals(ObjectRef other) const { return data_ == other.data_; }
 
 ContextRef ContextRef::previous(JSHeapBroker* broker, size_t* depth) const {
   DCHECK_NOT_NULL(depth);
 
+  if (*depth == 0) return *this;
+
   Context current = *object();
-  while (*depth != 0 && current.unchecked_previous().IsContext()) {
-    current = Context::cast(current.unchecked_previous());
+  while (*depth != 0 && i::IsContext(current->unchecked_previous())) {
+    current = Context::cast(current->unchecked_previous());
     (*depth)--;
   }
   // The `previous` field is immutable after initialization and the
@@ -937,7 +959,8 @@ OptionalObjectRef ContextRef::get(JSHeapBroker* broker, int index) const {
   return TryMakeRef(broker, object()->get(index));
 }
 
-void JSHeapBroker::InitializeAndStartSerializing() {
+void JSHeapBroker::InitializeAndStartSerializing(
+    Handle<NativeContext> target_native_context) {
   TraceScope tracer(this, "JSHeapBroker::InitializeAndStartSerializing");
 
   CHECK_EQ(mode_, kDisabled);
@@ -951,7 +974,7 @@ void JSHeapBroker::InitializeAndStartSerializing() {
 
   CollectArrayAndObjectPrototypes();
 
-  SetTargetNativeContextRef(target_native_context().object());
+  SetTargetNativeContextRef(target_native_context);
 }
 
 namespace {
@@ -978,7 +1001,7 @@ ObjectData* JSHeapBroker::TryGetOrCreateData(Handle<Object> object,
     if (*storage == nullptr) {
       entry->value = zone()->New<ObjectData>(
           this, storage, object,
-          object->IsSmi() ? kSmi : kUnserializedHeapObject);
+          IsSmi(*object) ? kSmi : kUnserializedHeapObject);
     }
     return *storage;
   }
@@ -987,12 +1010,12 @@ ObjectData* JSHeapBroker::TryGetOrCreateData(Handle<Object> object,
         mode() == JSHeapBroker::kSerialized);
 
   ObjectData* object_data;
-  if (object->IsSmi()) {
+  if (IsSmi(*object)) {
     entry = refs_->LookupOrInsert(object.address());
     return zone()->New<ObjectData>(this, &entry->value, object, kSmi);
   }
 
-  DCHECK(!object->IsSmi());
+  DCHECK(!IsSmi(*object));
 
   const bool crash_on_error = (flags & kCrashOnError) != 0;
 
@@ -1010,7 +1033,7 @@ ObjectData* JSHeapBroker::TryGetOrCreateData(Handle<Object> object,
   }
 
 #define CREATE_DATA(Name)                                             \
-  if (object->Is##Name()) {                                           \
+  if (i::Is##Name(*object)) {                                         \
     entry = refs_->LookupOrInsert(object.address());                  \
     object_data = zone()->New<ref_traits<Name>::data_type>(           \
         this, &entry->value, Handle<Name>::cast(object),              \
@@ -1042,7 +1065,7 @@ bool ObjectRef::IsSmi() const { return data()->is_smi(); }
 int ObjectRef::AsSmi() const {
   DCHECK(IsSmi());
   // Handle-dereference is always allowed for Handle<Smi>.
-  return Handle<Smi>::cast(object())->value();
+  return Smi::cast(*object()).value();
 }
 
 #define DEF_TESTER(Type, ...)                              \
@@ -1097,13 +1120,26 @@ OptionalMapRef MapRef::AsElementsKind(JSHeapBroker* broker,
   return MakeRefAssumeMemoryFence(broker, maybe_result.value());
 }
 
-bool MapRef::HasOnlyStablePrototypesWithFastElements(
+bool MapRef::PrototypesElementsDoNotHaveAccessorsOrThrow(
     JSHeapBroker* broker, ZoneVector<MapRef>* prototype_maps) {
   DCHECK_NOT_NULL(prototype_maps);
   MapRef prototype_map = prototype(broker).map(broker);
   while (prototype_map.oddball_type(broker) != OddballType::kNull) {
+    // For the purposes of depending on prototypes' elements behavior when
+    // doing keyed property sets, non-extensible and sealed fast elements are
+    // okay because they behave like fast elements for stores into holes on
+    // the receiver. In such cases, the value is stored on the receiver's
+    // elements and does not trigger any setters and does not throw.
+    //
+    // Note that frozen elements are _not_ okay because of the "override
+    // mistake":
+    //
+    //   Object.prototype[1] = "x";
+    //   Object.freeze(Object.prototype);
+    //   ([])[1] = "y"; <-- throws in strict mode, nop in sloppy mode
     if (!prototype_map.IsJSObjectMap() || !prototype_map.is_stable() ||
-        !IsFastElementsKind(prototype_map.elements_kind())) {
+        !IsFastOrNonextensibleOrSealedElementsKind(
+            prototype_map.elements_kind())) {
       return false;
     }
     prototype_maps->push_back(prototype_map);
@@ -1123,7 +1159,7 @@ bool MapRef::supports_fast_array_resize(JSHeapBroker* broker) const {
 namespace {
 
 void RecordConsistentJSFunctionViewDependencyIfNeeded(
-    const JSHeapBroker* broker, const JSFunctionRef& ref, JSFunctionData* data,
+    const JSHeapBroker* broker, JSFunctionRef ref, JSFunctionData* data,
     JSFunctionData::UsedField used_field) {
   if (!data->has_any_used_field()) {
     // Deduplicate dependencies.
@@ -1163,15 +1199,15 @@ OddballType MapRef::oddball_type(JSHeapBroker* broker) const {
   if (equals(broker->boolean_map())) {
     return OddballType::kBoolean;
   }
-  if (equals(broker->the_hole_map())) {
-    return OddballType::kHole;
-  }
   if (equals(broker->uninitialized_map())) {
     return OddballType::kUninitialized;
   }
   DCHECK(equals(broker->termination_exception_map()) ||
          equals(broker->arguments_marker_map()) ||
          equals(broker->optimized_out_map()) ||
+         equals(broker->exception_map()) ||
+         equals(broker->self_reference_marker_map()) ||
+         equals(broker->basic_block_counters_marker_map()) ||
          equals(broker->stale_register_map()));
   return OddballType::kOther;
 }
@@ -1203,7 +1239,7 @@ OptionalObjectRef JSObjectRef::RawInobjectPropertyAt(JSHeapBroker* broker,
       return {};
     }
 
-    base::Optional<Object> maybe_value =
+    base::Optional<Tagged<Object>> maybe_value =
         object()->RawInobjectPropertyAt(cage_base, current_map, index);
     if (!maybe_value.has_value()) {
       TRACE_BROKER_MISSING(broker,
@@ -1215,7 +1251,7 @@ OptionalObjectRef JSObjectRef::RawInobjectPropertyAt(JSHeapBroker* broker,
   return TryMakeRef(broker, value);
 }
 
-bool JSObjectRef::IsElementsTenured(const FixedArrayBaseRef& elements) {
+bool JSObjectRef::IsElementsTenured(FixedArrayBaseRef elements) {
   return !ObjectInYoungGeneration(*elements.object());
 }
 
@@ -1259,12 +1295,12 @@ MapRef MapRef::FindFieldOwner(JSHeapBroker* broker,
   // the descriptor array. It would be useful for same map as well as any
   // other map sharing that descriptor array.
   return MakeRefAssumeMemoryFence(
-      broker, object()->FindFieldOwner(broker->isolate(), descriptor_index));
+      broker, object()->FindFieldOwner(broker->cage_base(), descriptor_index));
 }
 
 OptionalObjectRef StringRef::GetCharAsStringOrUndefined(JSHeapBroker* broker,
                                                         uint32_t index) const {
-  String maybe_char;
+  Tagged<String> maybe_char;
   auto result = ConcurrentLookupIterator::TryGetOwnChar(
       &maybe_char, broker->isolate(), broker->local_isolate(), *object(),
       index);
@@ -1280,13 +1316,17 @@ OptionalObjectRef StringRef::GetCharAsStringOrUndefined(JSHeapBroker* broker,
 }
 
 bool StringRef::SupportedStringKind() const {
-  return IsInternalizedString() || object()->IsThinString();
+  return IsInternalizedString() || IsThinString(*object());
 }
 
 bool StringRef::IsContentAccessible() const {
   return data_->kind() != kNeverSerializedHeapObject || SupportedStringKind();
 }
 
+bool StringRef::IsOneByteRepresentation() const {
+  return object()->IsOneByteRepresentation();
+}
+
 // TODO(leszeks): The broker is only needed here for tracing, maybe we could get
 // it from a thread local instead.
 base::Optional<Handle<String>> StringRef::ObjectIfContentAccessible(
@@ -1347,7 +1387,7 @@ base::Optional<double> StringRef::ToInt(JSHeapBroker* broker, int radix) {
 }
 
 int ArrayBoilerplateDescriptionRef::constants_elements_length() const {
-  return object()->constant_elements().length();
+  return object()->constant_elements()->length();
 }
 
 OptionalObjectRef FixedArrayRef::TryGet(JSHeapBroker* broker, int i) const {
@@ -1379,11 +1419,11 @@ Handle<ByteArray> BytecodeArrayRef::SourcePositionTable(
 
 Address BytecodeArrayRef::handler_table_address() const {
   return reinterpret_cast<Address>(
-      object()->handler_table().GetDataStartAddress());
+      object()->handler_table()->GetDataStartAddress());
 }
 
 int BytecodeArrayRef::handler_table_size() const {
-  return object()->handler_table().length();
+  return object()->handler_table()->length();
 }
 
 #define IF_ACCESS_FROM_HEAP_C(name)  \
@@ -1489,6 +1529,8 @@ HEAP_ACCESSOR_B(Map, bit_field3, NumberOfOwnDescriptors,
                 Map::Bits3::NumberOfOwnDescriptorsBits)
 HEAP_ACCESSOR_B(Map, bit_field3, is_migration_target,
                 Map::Bits3::IsMigrationTargetBit)
+BIMODAL_ACCESSOR_B(Map, bit_field3, construction_counter,
+                   Map::Bits3::ConstructionCounterBits)
 HEAP_ACCESSOR_B(Map, bit_field, has_prototype_slot,
                 Map::Bits1::HasPrototypeSlotBit)
 HEAP_ACCESSOR_B(Map, bit_field, is_access_check_needed,
@@ -1524,14 +1566,14 @@ int RegExpBoilerplateDescriptionRef::flags() const { return object()->flags(); }
 
 OptionalCallHandlerInfoRef FunctionTemplateInfoRef::call_code(
     JSHeapBroker* broker) const {
-  HeapObject call_code = object()->call_code(kAcquireLoad);
-  if (call_code.IsUndefined()) return base::nullopt;
+  Tagged<HeapObject> call_code = object()->call_code(kAcquireLoad);
+  if (i::IsUndefined(call_code)) return base::nullopt;
   return TryMakeRef(broker, CallHandlerInfo::cast(call_code));
 }
 
 bool FunctionTemplateInfoRef::is_signature_undefined(
     JSHeapBroker* broker) const {
-  return object()->signature().IsUndefined(broker->isolate());
+  return i::IsUndefined(object()->signature(), broker->isolate());
 }
 
 HEAP_ACCESSOR_C(FunctionTemplateInfo, bool, accept_any_receiver)
@@ -1551,8 +1593,8 @@ HolderLookupResult FunctionTemplateInfoRef::LookupHolderOfExpectedType(
   Handle<FunctionTemplateInfo> expected_receiver_type;
   {
     DisallowGarbageCollection no_gc;
-    HeapObject signature = object()->signature();
-    if (signature.IsUndefined()) {
+    Tagged<HeapObject> signature = object()->signature();
+    if (i::IsUndefined(signature)) {
       return HolderLookupResult(CallOptimization::kHolderIsReceiver);
     }
     expected_receiver_type = broker->CanonicalPersistentHandle(
@@ -1604,6 +1646,17 @@ BytecodeArrayRef SharedFunctionInfoRef::GetBytecodeArray(
 BROKER_SFI_FIELDS(DEF_SFI_ACCESSOR)
 #undef DEF_SFI_ACCESSOR
 
+bool SharedFunctionInfoRef::HasBreakInfo(JSHeapBroker* broker) const {
+  if (broker->IsMainThread()) {
+    return object()->HasBreakInfo(broker->isolate());
+  } else {
+    LocalIsolate* local_isolate = broker->local_isolate();
+    SharedMutexGuardIfOffThread<LocalIsolate, base::kShared> mutex_guard(
+        local_isolate->shared_function_info_access(), local_isolate);
+    return object()->HasBreakInfo(local_isolate->GetMainThreadIsolateUnsafe());
+  }
+}
+
 SharedFunctionInfo::Inlineability SharedFunctionInfoRef::GetInlineability(
     JSHeapBroker* broker) const {
   return broker->IsMainThread()
@@ -1624,7 +1677,8 @@ OptionalObjectRef MapRef::GetStrongValue(JSHeapBroker* broker,
 
 DescriptorArrayRef MapRef::instance_descriptors(JSHeapBroker* broker) const {
   return MakeRefAssumeMemoryFence(
-      broker, object()->instance_descriptors(broker->isolate(), kAcquireLoad));
+      broker,
+      object()->instance_descriptors(broker->cage_base(), kAcquireLoad));
 }
 
 HeapObjectRef MapRef::prototype(JSHeapBroker* broker) const {
@@ -1635,7 +1689,7 @@ HeapObjectRef MapRef::prototype(JSHeapBroker* broker) const {
 MapRef MapRef::FindRootMap(JSHeapBroker* broker) const {
   // TODO(solanes, v8:7790): Consider caching the result of the root map.
   return MakeRefAssumeMemoryFence(broker,
-                                  object()->FindRootMap(broker->isolate()));
+                                  object()->FindRootMap(broker->cage_base()));
 }
 
 ObjectRef MapRef::GetConstructor(JSHeapBroker* broker) const {
@@ -1677,7 +1731,7 @@ void* JSTypedArrayRef::data_ptr() const {
 }
 
 bool MapRef::IsInobjectSlackTrackingInProgress() const {
-  return object()->IsInobjectSlackTrackingInProgress();
+  return construction_counter() != Map::kNoSlackTracking;
 }
 
 int MapRef::constructor_function_index() const {
@@ -1703,10 +1757,12 @@ int MapRef::GetInObjectProperties() const {
 }
 
 bool StringRef::IsExternalString() const {
-  return object()->IsExternalString();
+  return i::IsExternalString(*object());
 }
 
-Address CallHandlerInfoRef::callback() const { return object()->callback(); }
+Address CallHandlerInfoRef::callback(JSHeapBroker* broker) const {
+  return object()->callback(broker->isolate());
+}
 
 ZoneVector<Address> FunctionTemplateInfoRef::c_functions(
     JSHeapBroker* broker) const {
@@ -1720,7 +1776,7 @@ ZoneVector<const CFunctionInfo*> FunctionTemplateInfoRef::c_signatures(
                         broker->zone());
 }
 
-bool StringRef::IsSeqString() const { return object()->IsSeqString(); }
+bool StringRef::IsSeqString() const { return i::IsSeqString(*object()); }
 
 ScopeInfoRef ContextRef::scope_info(JSHeapBroker* broker) const {
   // The scope_info is immutable after initialization.
@@ -1765,7 +1821,7 @@ BROKER_NATIVE_CONTEXT_FIELDS(DEF_NATIVE_CONTEXT_ACCESSOR)
 #undef DEF_NATIVE_CONTEXT_ACCESSOR
 
 OptionalJSFunctionRef NativeContextRef::GetConstructorFunction(
-    JSHeapBroker* broker, const MapRef& map) const {
+    JSHeapBroker* broker, MapRef map) const {
   CHECK(map.IsPrimitiveMap());
   switch (map.constructor_function_index()) {
     case Map::kNoConstructorFunctionIndex:
@@ -1785,22 +1841,37 @@ OptionalJSFunctionRef NativeContextRef::GetConstructorFunction(
   }
 }
 
-bool ObjectRef::IsNull() const { return object()->IsNull(); }
+bool ObjectRef::IsNull() const { return i::IsNull(*object()); }
 
-bool ObjectRef::IsNullOrUndefined(JSHeapBroker* broker) const {
-  if (IsSmi()) return false;
-  OddballType type = AsHeapObject().map(broker).oddball_type(broker);
-  return type == OddballType::kNull || type == OddballType::kUndefined;
+bool ObjectRef::IsUndefined() const { return i::IsUndefined(*object()); }
+
+bool ObjectRef::IsTheHole() const {
+  if (i::IsTheHole(*object())) return true;
+  DCHECK(!i::IsHole(*object()));
+  return false;
 }
 
-bool ObjectRef::IsTheHole(JSHeapBroker* broker) const {
-  return IsHeapObject() &&
-         AsHeapObject().map(broker).oddball_type(broker) == OddballType::kHole;
+bool ObjectRef::IsPropertyCellHole() const {
+  if (i::IsPropertyCellHole(*object())) return true;
+  DCHECK(!i::IsHole(*object()));
+  return false;
 }
 
+HoleType ObjectRef::HoleType() const {
+  if (i::IsTheHole(*object())) {
+    return HoleType::kGeneric;
+  } else if (i::IsPropertyCellHole(*object())) {
+    return HoleType::kPropertyCell;
+  } else {
+    return HoleType::kNone;
+  }
+}
+
+bool ObjectRef::IsNullOrUndefined() const { return IsNull() || IsUndefined(); }
+
 base::Optional<bool> ObjectRef::TryGetBooleanValue(JSHeapBroker* broker) const {
   if (data_->should_access_heap()) {
-    return object()->BooleanValue(broker->isolate());
+    return Object::BooleanValue(*object(), broker->isolate());
   }
   if (IsSmi()) return AsSmi() != 0;
   return data()->AsHeapObject()->TryGetBooleanValue(broker);
@@ -1831,9 +1902,9 @@ bool ObjectRef::should_access_heap() const {
 }
 
 OptionalObjectRef JSObjectRef::GetOwnConstantElement(
-    JSHeapBroker* broker, const FixedArrayBaseRef& elements_ref, uint32_t index,
+    JSHeapBroker* broker, FixedArrayBaseRef elements_ref, uint32_t index,
     CompilationDependencies* dependencies) const {
-  base::Optional<Object> maybe_element = GetOwnConstantElementFromHeap(
+  base::Optional<Tagged<Object>> maybe_element = GetOwnConstantElementFromHeap(
       broker, *elements_ref.object(), map(broker).elements_kind(), index);
   if (!maybe_element.has_value()) return {};
 
@@ -1844,9 +1915,9 @@ OptionalObjectRef JSObjectRef::GetOwnConstantElement(
   return result;
 }
 
-base::Optional<Object> JSObjectRef::GetOwnConstantElementFromHeap(
-    JSHeapBroker* broker, FixedArrayBase elements, ElementsKind elements_kind,
-    uint32_t index) const {
+base::Optional<Tagged<Object>> JSObjectRef::GetOwnConstantElementFromHeap(
+    JSHeapBroker* broker, Tagged<FixedArrayBase> elements,
+    ElementsKind elements_kind, uint32_t index) const {
   DCHECK_LE(index, JSObject::kMaxElementIndex);
 
   Handle<JSObject> holder = object();
@@ -1861,23 +1932,23 @@ base::Optional<Object> JSObjectRef::GetOwnConstantElementFromHeap(
   //   created);
   // - The release-load of that map ensures we read the newest value
   //   of `length` below.
-  if (holder->IsJSArray()) {
-    Object array_length_obj =
-        JSArray::cast(*holder).length(broker->isolate(), kRelaxedLoad);
-    if (!array_length_obj.IsSmi()) {
+  if (i::IsJSArray(*holder)) {
+    Tagged<Object> array_length_obj =
+        JSArray::cast(*holder)->length(broker->isolate(), kRelaxedLoad);
+    if (!i::IsSmi(array_length_obj)) {
       // Can't safely read into HeapNumber objects without atomic semantics
       // (relaxed would be sufficient due to the guarantees above).
       return {};
     }
     uint32_t array_length;
-    if (!array_length_obj.ToArrayLength(&array_length)) {
+    if (!Object::ToArrayLength(array_length_obj, &array_length)) {
       return {};
     }
     // See also ElementsAccessorBase::GetMaxIndex.
     if (index >= array_length) return {};
   }
 
-  Object maybe_element;
+  Tagged<Object> maybe_element;
   auto result = ConcurrentLookupIterator::TryGetOwnConstantElement(
       &maybe_element, broker->isolate(), broker->local_isolate(), *holder,
       elements, elements_kind, index);
@@ -1960,9 +2031,10 @@ OptionalObjectRef JSArrayRef::GetOwnCowElement(JSHeapBroker* broker,
   // Likewise we only deal with smi lengths.
   if (!length_ref->IsSmi()) return {};
 
-  base::Optional<Object> result = ConcurrentLookupIterator::TryGetOwnCowElement(
-      broker->isolate(), *elements_ref.AsFixedArray().object(), elements_kind,
-      length_ref->AsSmi(), index);
+  base::Optional<Tagged<Object>> result =
+      ConcurrentLookupIterator::TryGetOwnCowElement(
+          broker->isolate(), *elements_ref.AsFixedArray().object(),
+          elements_kind, length_ref->AsSmi(), index);
   if (!result.has_value()) return {};
 
   return TryMakeRef(broker, result.value());
@@ -1986,7 +2058,7 @@ OptionalMapRef HeapObjectRef::map_direct_read(JSHeapBroker* broker) const {
 namespace {
 
 OddballType GetOddballType(Isolate* isolate, Map map) {
-  if (map.instance_type() != ODDBALL_TYPE) {
+  if (map->instance_type() != ODDBALL_TYPE) {
     return OddballType::kNone;
   }
   ReadOnlyRoots roots(isolate);
@@ -1999,9 +2071,6 @@ OddballType GetOddballType(Isolate* isolate, Map map) {
   if (map == roots.boolean_map()) {
     return OddballType::kBoolean;
   }
-  if (map == roots.the_hole_map()) {
-    return OddballType::kHole;
-  }
   if (map == roots.uninitialized_map()) {
     return OddballType::kUninitialized;
   }
@@ -2017,16 +2086,16 @@ HeapObjectType HeapObjectRef::GetHeapObjectType(JSHeapBroker* broker) const {
   if (data_->should_access_heap()) {
     Map map = Handle<HeapObject>::cast(object())->map(broker->cage_base());
     HeapObjectType::Flags flags(0);
-    if (map.is_undetectable()) flags |= HeapObjectType::kUndetectable;
-    if (map.is_callable()) flags |= HeapObjectType::kCallable;
-    return HeapObjectType(map.instance_type(), flags,
-                          GetOddballType(broker->isolate(), map));
+    if (map->is_undetectable()) flags |= HeapObjectType::kUndetectable;
+    if (map->is_callable()) flags |= HeapObjectType::kCallable;
+    return HeapObjectType(map->instance_type(), flags,
+                          GetOddballType(broker->isolate(), map), HoleType());
   }
   HeapObjectType::Flags flags(0);
   if (map(broker).is_undetectable()) flags |= HeapObjectType::kUndetectable;
   if (map(broker).is_callable()) flags |= HeapObjectType::kCallable;
   return HeapObjectType(map(broker).instance_type(), flags,
-                        map(broker).oddball_type(broker));
+                        map(broker).oddball_type(broker), HoleType());
 }
 
 OptionalJSObjectRef AllocationSiteRef::boilerplate(JSHeapBroker* broker) const {
@@ -2059,7 +2128,7 @@ NameRef DescriptorArrayRef::GetPropertyKey(
 
 OptionalObjectRef DescriptorArrayRef::GetStrongValue(
     JSHeapBroker* broker, InternalIndex descriptor_index) const {
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
   if (!object()
            ->GetValue(descriptor_index)
            .GetHeapObjectIfStrong(&heap_object)) {
@@ -2177,7 +2246,7 @@ JSFUNCTION_BIMODAL_ACCESSOR_WITH_DEP_RELEVANT_C(
 
 JSFUNCTION_BIMODAL_ACCESSOR_WITH_DEP(Map, initial_map,
                                      JSFunctionData::kInitialMap)
-JSFUNCTION_BIMODAL_ACCESSOR_WITH_DEP(Object, instance_prototype,
+JSFUNCTION_BIMODAL_ACCESSOR_WITH_DEP(HeapObject, instance_prototype,
                                      JSFunctionData::kInstancePrototype)
 JSFUNCTION_BIMODAL_ACCESSOR_WITH_DEP(FeedbackCell, raw_feedback_cell,
                                      JSFunctionData::kFeedbackCell)
@@ -2205,11 +2274,11 @@ OptionalFunctionTemplateInfoRef SharedFunctionInfoRef::function_template_info(
 }
 
 int SharedFunctionInfoRef::context_header_size() const {
-  return object()->scope_info().ContextHeaderLength();
+  return object()->scope_info()->ContextHeaderLength();
 }
 
 int SharedFunctionInfoRef::context_parameters_start() const {
-  return object()->scope_info().ParametersStartIndex();
+  return object()->scope_info()->ParametersStartIndex();
 }
 
 ScopeInfoRef SharedFunctionInfoRef::scope_info(JSHeapBroker* broker) const {
@@ -2223,7 +2292,7 @@ OptionalMapRef JSObjectRef::GetObjectCreateMap(JSHeapBroker* broker) const {
 
   Handle<Object> maybe_proto_info = broker->CanonicalPersistentHandle(
       map_handle->prototype_info(kAcquireLoad));
-  if (!maybe_proto_info->IsPrototypeInfo()) return {};
+  if (!IsPrototypeInfo(*maybe_proto_info)) return {};
 
   MaybeObject maybe_object_create_map =
       Handle<PrototypeInfo>::cast(maybe_proto_info)
@@ -2231,7 +2300,7 @@ OptionalMapRef JSObjectRef::GetObjectCreateMap(JSHeapBroker* broker) const {
   if (!maybe_object_create_map->IsWeak()) return {};
 
   return MapRef(broker->GetOrCreateData(
-      maybe_object_create_map->GetHeapObjectAssumeWeak(), kAssumeMemoryFence));
+      maybe_object_create_map.GetHeapObjectAssumeWeak(), kAssumeMemoryFence));
 }
 
 bool PropertyCellRef::Cache(JSHeapBroker* broker) const {
@@ -2247,9 +2316,9 @@ bool NativeContextRef::GlobalIsDetached(JSHeapBroker* broker) const {
   return !proxy_proto.equals(global_object(broker));
 }
 
-OptionalPropertyCellRef JSGlobalObjectRef::GetPropertyCell(
-    JSHeapBroker* broker, NameRef const& name) const {
-  base::Optional<PropertyCell> maybe_cell =
+OptionalPropertyCellRef JSGlobalObjectRef::GetPropertyCell(JSHeapBroker* broker,
+                                                           NameRef name) const {
+  base::Optional<Tagged<PropertyCell>> maybe_cell =
       ConcurrentLookupIterator::TryGetPropertyCell(
           broker->isolate(), broker->local_isolate_or_isolate(),
           broker->target_native_context().global_object(broker).object(),
@@ -2258,7 +2327,7 @@ OptionalPropertyCellRef JSGlobalObjectRef::GetPropertyCell(
   return TryMakeRef(broker, *maybe_cell);
 }
 
-std::ostream& operator<<(std::ostream& os, const ObjectRef& ref) {
+std::ostream& operator<<(std::ostream& os, ObjectRef ref) {
   if (!v8_flags.concurrent_recompilation) {
     // We cannot be in a background thread so it's safe to read the heap.
     AllowHandleDereference allow_handle_dereference;
@@ -2272,8 +2341,8 @@ std::ostream& operator<<(std::ostream& os, const ObjectRef& ref) {
 
 unsigned CodeRef::GetInlinedBytecodeSize() const {
   Code code = *object();
-  const unsigned value = code.inlined_bytecode_size();
-  if (value != 0 && code.marked_for_deoptimization()) {
+  const unsigned value = code->inlined_bytecode_size();
+  if (value != 0 && code->marked_for_deoptimization()) {
     // Don't report inlined bytecode size if the code object was already
     // deoptimized.
     return 0;
diff --git a/deps/v8/src/compiler/heap-refs.h b/deps/v8/src/compiler/heap-refs.h
index 6695e684b71789..248efcfeec1bd9 100644
--- a/deps/v8/src/compiler/heap-refs.h
+++ b/deps/v8/src/compiler/heap-refs.h
@@ -13,6 +13,7 @@
 #include "src/objects/feedback-vector.h"
 #include "src/objects/instance-type.h"
 #include "src/utils/boxed-float.h"
+#include "src/zone/zone-compact-set.h"
 
 namespace v8 {
 
@@ -35,6 +36,10 @@ class ScriptContextTable;
 template <typename>
 class Signature;
 
+namespace interpreter {
+class Register;
+}  // namespace interpreter
+
 namespace wasm {
 class ValueType;
 struct WasmModule;
@@ -67,11 +72,16 @@ enum class OddballType : uint8_t {
   kBoolean,  // True or False.
   kUndefined,
   kNull,
-  kHole,
   kUninitialized,
   kOther  // Oddball, but none of the above.
 };
 
+enum class HoleType : uint8_t {
+  kNone,  // Not a Hole.
+  kGeneric,
+  kPropertyCell,
+};
+
 enum class RefSerializationKind {
   // Skips serialization.
   kNeverSerialized,
@@ -140,9 +150,18 @@ enum class RefSerializationKind {
 
 #define FORWARD_DECL(Name) class Name##Ref;
 HEAP_BROKER_OBJECT_LIST(FORWARD_DECL)
+FORWARD_DECL(Object)
 #undef FORWARD_DECL
 
-class ObjectRef;
+template <class T>
+struct is_ref : public std::false_type {};
+
+#define DEFINE_IS_REF(Name) \
+  template <>               \
+  struct is_ref<Name##Ref> : public std::true_type {};
+HEAP_BROKER_OBJECT_LIST(DEFINE_IS_REF)
+DEFINE_IS_REF(Object)
+#undef DEFINE_IS_REF
 
 template <class T>
 struct ref_traits;
@@ -189,12 +208,24 @@ struct ref_traits<Object> {
 template <>
 struct ref_traits<Oddball> : public ref_traits<HeapObject> {};
 template <>
+struct ref_traits<Null> : public ref_traits<HeapObject> {};
+template <>
+struct ref_traits<Undefined> : public ref_traits<HeapObject> {};
+template <>
+struct ref_traits<True> : public ref_traits<HeapObject> {};
+template <>
+struct ref_traits<False> : public ref_traits<HeapObject> {};
+template <>
+struct ref_traits<Hole> : public ref_traits<HeapObject> {};
+template <>
 struct ref_traits<EnumCache> : public ref_traits<HeapObject> {};
 template <>
 struct ref_traits<PropertyArray> : public ref_traits<HeapObject> {};
 template <>
 struct ref_traits<ByteArray> : public ref_traits<HeapObject> {};
 template <>
+struct ref_traits<ExternalPointerArray> : public ref_traits<HeapObject> {};
+template <>
 struct ref_traits<ClosureFeedbackCellArray> : public ref_traits<HeapObject> {};
 template <>
 struct ref_traits<NumberDictionary> : public ref_traits<HeapObject> {};
@@ -276,6 +307,12 @@ class OptionalRef {
     return ArrowOperatorHelper(value());
   }
 
+  bool equals(OptionalRef other) const { return data_ == other.data_; }
+
+  size_t hash_value() const {
+    return has_value() ? value().hash_value() : base::hash_value(0);
+  }
+
  private:
   explicit OptionalRef(ObjectData* data) : data_(data) {
     CHECK_NOT_NULL(data_);
@@ -286,6 +323,16 @@ class OptionalRef {
   friend class OptionalRef;
 };
 
+template <typename T>
+inline bool operator==(OptionalRef<T> lhs, OptionalRef<T> rhs) {
+  return lhs.equals(rhs);
+}
+
+template <typename T>
+inline size_t hash_value(OptionalRef<T> ref) {
+  return ref.hash_value();
+}
+
 // Define aliases for OptionalFooRef = OptionalRef<FooRef>.
 #define V(Name) using Optional##Name##Ref = OptionalRef<Name##Ref>;
 V(Object)
@@ -300,7 +347,9 @@ class V8_EXPORT_PRIVATE ObjectRef {
 
   Handle<Object> object() const;
 
-  bool equals(const ObjectRef& other) const;
+  bool equals(ObjectRef other) const;
+
+  size_t hash_value() const { return base::hash_combine(object().address()); }
 
   bool IsSmi() const;
   int AsSmi() const;
@@ -314,8 +363,11 @@ class V8_EXPORT_PRIVATE ObjectRef {
 #undef HEAP_AS_METHOD_DECL
 
   bool IsNull() const;
-  bool IsNullOrUndefined(JSHeapBroker* broker) const;
-  bool IsTheHole(JSHeapBroker* broker) const;
+  bool IsUndefined() const;
+  enum HoleType HoleType() const;
+  bool IsTheHole() const;
+  bool IsPropertyCellHole() const;
+  bool IsNullOrUndefined() const;
 
   base::Optional<bool> TryGetBooleanValue(JSHeapBroker* broker) const;
   Maybe<double> OddballToNumber(JSHeapBroker* broker) const;
@@ -323,9 +375,7 @@ class V8_EXPORT_PRIVATE ObjectRef {
   bool should_access_heap() const;
 
   struct Hash {
-    size_t operator()(const ObjectRef& ref) const {
-      return base::hash_combine(ref.object().address());
-    }
+    size_t operator()(ObjectRef ref) const { return ref.hash_value(); }
   };
 
  protected:
@@ -345,22 +395,24 @@ class V8_EXPORT_PRIVATE ObjectRef {
   template <typename TRef>
   friend class OptionalRef;
 
-  friend std::ostream& operator<<(std::ostream& os, const ObjectRef& ref);
-  friend bool operator<(const ObjectRef& lhs, const ObjectRef& rhs);
+  friend std::ostream& operator<<(std::ostream& os, ObjectRef ref);
+  friend bool operator<(ObjectRef lhs, ObjectRef rhs);
+  template <typename T, typename Enable>
+  friend struct ::v8::internal::ZoneCompactSetTraits;
 };
 
-inline bool operator==(const ObjectRef& lhs, const ObjectRef& rhs) {
-  return lhs.equals(rhs);
-}
+inline bool operator==(ObjectRef lhs, ObjectRef rhs) { return lhs.equals(rhs); }
 
-inline bool operator!=(const ObjectRef& lhs, const ObjectRef& rhs) {
+inline bool operator!=(ObjectRef lhs, ObjectRef rhs) {
   return !lhs.equals(rhs);
 }
 
-inline bool operator<(const ObjectRef& lhs, const ObjectRef& rhs) {
+inline bool operator<(ObjectRef lhs, ObjectRef rhs) {
   return lhs.data_ < rhs.data_;
 }
 
+inline size_t hash_value(ObjectRef ref) { return ref.hash_value(); }
+
 template <class T>
 using ZoneRefUnorderedSet = ZoneUnorderedSet<T, ObjectRef::Hash>;
 
@@ -381,17 +433,20 @@ class HeapObjectType {
   using Flags = base::Flags<Flag>;
 
   HeapObjectType(InstanceType instance_type, Flags flags,
-                 OddballType oddball_type)
+                 OddballType oddball_type, HoleType hole_type)
       : instance_type_(instance_type),
         oddball_type_(oddball_type),
+        hole_type_(hole_type),
         flags_(flags) {
     DCHECK_EQ(instance_type == ODDBALL_TYPE,
               oddball_type != OddballType::kNone);
   }
 
   OddballType oddball_type() const { return oddball_type_; }
+  HoleType hole_type() const { return hole_type_; }
   // For compatibility with MapRef.
   OddballType oddball_type(JSHeapBroker* broker) const { return oddball_type_; }
+  HoleType hole_type(JSHeapBroker* broker) const { return hole_type_; }
   InstanceType instance_type() const { return instance_type_; }
   Flags flags() const { return flags_; }
 
@@ -401,6 +456,7 @@ class HeapObjectType {
  private:
   InstanceType const instance_type_;
   OddballType const oddball_type_;
+  HoleType const hole_type_;
   Flags const flags_;
 };
 
@@ -475,14 +531,14 @@ class JSObjectRef : public JSReceiverRef {
   // {dependencies} is non-null, a dependency will be taken to protect
   // against inconsistency due to weak memory concurrency.
   OptionalObjectRef GetOwnConstantElement(
-      JSHeapBroker* broker, const FixedArrayBaseRef& elements_ref,
-      uint32_t index, CompilationDependencies* dependencies) const;
+      JSHeapBroker* broker, FixedArrayBaseRef elements_ref, uint32_t index,
+      CompilationDependencies* dependencies) const;
   // The direct-read implementation of the above, extracted into a helper since
   // it's also called from compilation-dependency validation. This helper is
   // guaranteed to not create new Ref instances.
-  base::Optional<Object> GetOwnConstantElementFromHeap(
-      JSHeapBroker* broker, FixedArrayBase elements, ElementsKind elements_kind,
-      uint32_t index) const;
+  base::Optional<Tagged<Object>> GetOwnConstantElementFromHeap(
+      JSHeapBroker* broker, Tagged<FixedArrayBase> elements,
+      ElementsKind elements_kind, uint32_t index) const;
 
   // Return the value of the property identified by the field {index}
   // if {index} is known to be an own data property of the object.
@@ -504,7 +560,7 @@ class JSObjectRef : public JSReceiverRef {
   // background-serialized) elements.
   OptionalFixedArrayBaseRef elements(JSHeapBroker* broker,
                                      RelaxedLoadTag) const;
-  bool IsElementsTenured(const FixedArrayBaseRef& elements);
+  bool IsElementsTenured(FixedArrayBaseRef elements);
 
   OptionalMapRef GetObjectCreateMap(JSHeapBroker* broker) const;
 };
@@ -548,7 +604,7 @@ class V8_EXPORT_PRIVATE JSFunctionRef : public JSObjectRef {
   bool has_initial_map(JSHeapBroker* broker) const;
   bool PrototypeRequiresRuntimeLookup(JSHeapBroker* broker) const;
   bool has_instance_prototype(JSHeapBroker* broker) const;
-  ObjectRef instance_prototype(JSHeapBroker* broker) const;
+  HeapObjectRef instance_prototype(JSHeapBroker* broker) const;
   MapRef initial_map(JSHeapBroker* broker) const;
   int InitialMapInstanceSizeWithMinSlack(JSHeapBroker* broker) const;
   FeedbackCellRef raw_feedback_cell(JSHeapBroker* broker) const;
@@ -656,7 +712,7 @@ class NativeContextRef : public ContextRef {
   MapRef GetFunctionMapFromIndex(JSHeapBroker* broker, int index) const;
   MapRef GetInitialJSArrayMap(JSHeapBroker* broker, ElementsKind kind) const;
   OptionalJSFunctionRef GetConstructorFunction(JSHeapBroker* broker,
-                                               const MapRef& map) const;
+                                               MapRef map) const;
   bool GlobalIsDetached(JSHeapBroker* broker) const;
 };
 
@@ -713,7 +769,7 @@ class CallHandlerInfoRef : public HeapObjectRef {
 
   Handle<CallHandlerInfo> object() const;
 
-  Address callback() const;
+  Address callback(JSHeapBroker* broker) const;
   ObjectRef data(JSHeapBroker* broker) const;
 };
 
@@ -779,6 +835,7 @@ class V8_EXPORT_PRIVATE MapRef : public HeapObjectRef {
   bool is_undetectable() const;
   bool is_callable() const;
   bool has_indexed_interceptor() const;
+  int construction_counter() const;
   bool is_migration_target() const;
   bool supports_fast_array_iteration(JSHeapBroker* broker) const;
   bool supports_fast_array_resize(JSHeapBroker* broker) const;
@@ -800,7 +857,7 @@ class V8_EXPORT_PRIVATE MapRef : public HeapObjectRef {
 
   HeapObjectRef prototype(JSHeapBroker* broker) const;
 
-  bool HasOnlyStablePrototypesWithFastElements(
+  bool PrototypesElementsDoNotHaveAccessorsOrThrow(
       JSHeapBroker* broker, ZoneVector<MapRef>* prototype_maps);
 
   // Concerning the underlying instance_descriptors:
@@ -971,7 +1028,6 @@ class ScopeInfoRef : public HeapObjectRef {
   V(FunctionKind, kind)                                         \
   V(LanguageMode, language_mode)                                \
   V(bool, native)                                               \
-  V(bool, HasBreakInfo)                                         \
   V(bool, HasBuiltinId)                                         \
   V(bool, construct_as_builtin)                                 \
   V(bool, HasBytecodeArray)                                     \
@@ -993,6 +1049,7 @@ class V8_EXPORT_PRIVATE SharedFunctionInfoRef : public HeapObjectRef {
   int context_header_size() const;
   int context_parameters_start() const;
   BytecodeArrayRef GetBytecodeArray(JSHeapBroker* broker) const;
+  bool HasBreakInfo(JSHeapBroker* broker) const;
   SharedFunctionInfo::Inlineability GetInlineability(
       JSHeapBroker* broker) const;
   OptionalFunctionTemplateInfoRef function_template_info(
@@ -1033,6 +1090,7 @@ class StringRef : public NameRef {
   bool IsExternalString() const;
 
   bool IsContentAccessible() const;
+  bool IsOneByteRepresentation() const;
 
  private:
   // With concurrent inlining on, we currently support reading directly
@@ -1090,11 +1148,11 @@ class JSGlobalObjectRef : public JSObjectRef {
 
   Handle<JSGlobalObject> object() const;
 
-  bool IsDetachedFrom(JSGlobalProxyRef const& proxy) const;
+  bool IsDetachedFrom(JSGlobalProxyRef proxy) const;
 
   // Can be called even when there is no property cell for the given name.
   OptionalPropertyCellRef GetPropertyCell(JSHeapBroker* broker,
-                                          NameRef const& name) const;
+                                          NameRef name) const;
 };
 
 class JSGlobalProxyRef : public JSObjectRef {
@@ -1137,6 +1195,27 @@ HEAP_BROKER_OBJECT_LIST(V)
 #undef V
 
 }  // namespace compiler
+
+template <typename T>
+struct ZoneCompactSetTraits<T, std::enable_if_t<compiler::is_ref<T>::value>> {
+  using handle_type = T;
+  using data_type = compiler::ObjectData;
+
+  static data_type* HandleToPointer(handle_type handle) {
+    return handle.data();
+  }
+  static handle_type PointerToHandle(data_type* ptr) {
+    return handle_type(ptr);
+  }
+};
+
+namespace compiler {
+
+template <typename T>
+using ZoneRefSet = ZoneCompactSet<typename ref_traits<T>::ref_type>;
+
+}  // namespace compiler
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/compiler/int64-lowering.cc b/deps/v8/src/compiler/int64-lowering.cc
index 3c86b353477a79..9eb1d46dc74269 100644
--- a/deps/v8/src/compiler/int64-lowering.cc
+++ b/deps/v8/src/compiler/int64-lowering.cc
@@ -43,7 +43,7 @@ Int64Lowering::Int64Lowering(Graph* graph, MachineOperatorBuilder* machine,
       placeholder_(graph->NewNode(common->Dead())) {
   DCHECK_NOT_NULL(graph);
   DCHECK_NOT_NULL(graph->end());
-  replacements_ = zone->NewArray<Replacement>(graph->NodeCount());
+  replacements_ = zone->AllocateArray<Replacement>(graph->NodeCount());
   memset(replacements_, 0, sizeof(Replacement) * graph->NodeCount());
 }
 
@@ -1109,8 +1109,8 @@ void Int64Lowering::PreparePhiReplacement(Node* phi) {
     // input nodes do not exist yet, so we use a placeholder node to pass the
     // graph verifier.
     int value_count = phi->op()->ValueInputCount();
-    Node** inputs_low = zone()->NewArray<Node*>(value_count + 1);
-    Node** inputs_high = zone()->NewArray<Node*>(value_count + 1);
+    Node** inputs_low = zone()->AllocateArray<Node*>(value_count + 1);
+    Node** inputs_high = zone()->AllocateArray<Node*>(value_count + 1);
     for (int i = 0; i < value_count; i++) {
       inputs_low[i] = placeholder_;
       inputs_high[i] = placeholder_;
diff --git a/deps/v8/src/compiler/int64-lowering.h b/deps/v8/src/compiler/int64-lowering.h
index e170a3fb16046e..2bac664744cb36 100644
--- a/deps/v8/src/compiler/int64-lowering.h
+++ b/deps/v8/src/compiler/int64-lowering.h
@@ -42,10 +42,10 @@ class V8_EXPORT_PRIVATE Int64Lowering {
 
   void LowerGraph();
 
+ private:
   static int GetParameterCountAfterLowering(
       Signature<MachineRepresentation>* signature);
 
- private:
   enum class State : uint8_t { kUnvisited, kOnStack, kVisited };
 
   struct Replacement {
diff --git a/deps/v8/src/compiler/js-call-reducer.cc b/deps/v8/src/compiler/js-call-reducer.cc
index db77216b7494ec..caec49b87c5282 100644
--- a/deps/v8/src/compiler/js-call-reducer.cc
+++ b/deps/v8/src/compiler/js-call-reducer.cc
@@ -37,6 +37,7 @@
 #include "src/objects/js-function.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/ordered-hash-table.h"
+#include "src/utils/utils.h"
 
 #ifdef V8_INTL_SUPPORT
 #include "src/objects/intl-objects.h"
@@ -79,7 +80,11 @@ class JSCallReducerAssembler : public JSGraphAssembler {
   TNode<String> ReduceStringPrototypeSubstring();
   TNode<Boolean> ReduceStringPrototypeStartsWith();
   TNode<Boolean> ReduceStringPrototypeStartsWith(
-      const StringRef& search_element_string);
+      StringRef search_element_string);
+  TNode<Boolean> ReduceStringPrototypeEndsWith();
+  TNode<Boolean> ReduceStringPrototypeEndsWith(StringRef search_element_string);
+  TNode<String> ReduceStringPrototypeCharAt();
+  TNode<String> ReduceStringPrototypeCharAt(StringRef s, uint32_t index);
   TNode<String> ReduceStringPrototypeSlice();
   TNode<Object> ReduceJSCallMathMinMaxWithArrayLike(Builtin builtin);
 
@@ -101,7 +106,8 @@ class JSCallReducerAssembler : public JSGraphAssembler {
   TNode<Smi> CheckSmi(TNode<Object> value);
   TNode<Number> CheckNumber(TNode<Object> value);
   TNode<String> CheckString(TNode<Object> value);
-  TNode<Number> CheckBounds(TNode<Number> value, TNode<Number> limit);
+  TNode<Number> CheckBounds(TNode<Number> value, TNode<Number> limit,
+                            CheckBoundsFlags flags = {});
 
   // Common operators.
   TNode<Smi> TypeGuardUnsignedSmall(TNode<Object> value);
@@ -128,7 +134,7 @@ class JSCallReducerAssembler : public JSGraphAssembler {
                                     FrameState frame_state);
 
   TNode<JSArray> AllocateEmptyJSArray(ElementsKind kind,
-                                      const NativeContextRef& native_context);
+                                      NativeContextRef native_context);
 
   TNode<Number> NumberInc(TNode<Number> value) {
     return NumberAdd(value, OneConstant());
@@ -348,10 +354,8 @@ class JSCallReducerAssembler : public JSGraphAssembler {
                           FrameState frame_state) {
     IfNot(ObjectIsCallable(maybe_callable))
         .Then(_ {
-          JSCallRuntime2(Runtime::kThrowTypeError,
-                         NumberConstant(static_cast<double>(
-                             MessageTemplate::kCalledNonCallable)),
-                         maybe_callable, ContextInput(), frame_state);
+          JSCallRuntime1(Runtime::kThrowCalledNonCallable, maybe_callable,
+                         ContextInput(), frame_state);
           Unreachable();  // The runtime call throws unconditionally.
         })
         .ExpectTrue();
@@ -418,33 +422,36 @@ class IteratingArrayBuiltinReducerAssembler : public JSCallReducerAssembler {
     DCHECK(v8_flags.turbo_inline_array_builtins);
   }
 
-  TNode<Object> ReduceArrayPrototypeForEach(
-      MapInference* inference, const bool has_stability_dependency,
-      ElementsKind kind, const SharedFunctionInfoRef& shared);
+  TNode<Object> ReduceArrayPrototypeForEach(MapInference* inference,
+                                            const bool has_stability_dependency,
+                                            ElementsKind kind,
+                                            SharedFunctionInfoRef shared);
   TNode<Object> ReduceArrayPrototypeReduce(MapInference* inference,
                                            const bool has_stability_dependency,
                                            ElementsKind kind,
                                            ArrayReduceDirection direction,
-                                           const SharedFunctionInfoRef& shared);
-  TNode<JSArray> ReduceArrayPrototypeMap(
-      MapInference* inference, const bool has_stability_dependency,
-      ElementsKind kind, const SharedFunctionInfoRef& shared,
-      const NativeContextRef& native_context);
-  TNode<JSArray> ReduceArrayPrototypeFilter(
-      MapInference* inference, const bool has_stability_dependency,
-      ElementsKind kind, const SharedFunctionInfoRef& shared,
-      const NativeContextRef& native_context);
+                                           SharedFunctionInfoRef shared);
+  TNode<JSArray> ReduceArrayPrototypeMap(MapInference* inference,
+                                         const bool has_stability_dependency,
+                                         ElementsKind kind,
+                                         SharedFunctionInfoRef shared,
+                                         NativeContextRef native_context);
+  TNode<JSArray> ReduceArrayPrototypeFilter(MapInference* inference,
+                                            const bool has_stability_dependency,
+                                            ElementsKind kind,
+                                            SharedFunctionInfoRef shared,
+                                            NativeContextRef native_context);
   TNode<Object> ReduceArrayPrototypeFind(MapInference* inference,
                                          const bool has_stability_dependency,
                                          ElementsKind kind,
-                                         const SharedFunctionInfoRef& shared,
-                                         const NativeContextRef& native_context,
+                                         SharedFunctionInfoRef shared,
+                                         NativeContextRef native_context,
                                          ArrayFindVariant variant);
   TNode<Boolean> ReduceArrayPrototypeEverySome(
       MapInference* inference, const bool has_stability_dependency,
-      ElementsKind kind, const SharedFunctionInfoRef& shared,
-      const NativeContextRef& native_context, ArrayEverySomeVariant variant);
-  TNode<Object> ReduceArrayPrototypeAt(ZoneVector<const MapRef*> kinds,
+      ElementsKind kind, SharedFunctionInfoRef shared,
+      NativeContextRef native_context, ArrayEverySomeVariant variant);
+  TNode<Object> ReduceArrayPrototypeAt(ZoneVector<MapRef> kinds,
                                        bool needs_fallback_builtin_call);
   TNode<Object> ReduceArrayPrototypeIndexOfIncludes(
       ElementsKind kind, ArrayIndexOfIncludesVariant variant);
@@ -542,8 +549,7 @@ class PromiseBuiltinReducerAssembler : public JSCallReducerAssembler {
     DCHECK_EQ(IrOpcode::kJSConstruct, node->opcode());
   }
 
-  TNode<Object> ReducePromiseConstructor(
-      const NativeContextRef& native_context);
+  TNode<Object> ReducePromiseConstructor(NativeContextRef native_context);
 
   int ConstructArity() const {
     return JSConstructNode{node_ptr()}.ArgumentCount();
@@ -563,7 +569,7 @@ class PromiseBuiltinReducerAssembler : public JSCallReducerAssembler {
         graph()->NewNode(javascript()->CreatePromise(), context, effect()));
   }
 
-  TNode<Context> CreateFunctionContext(const NativeContextRef& native_context,
+  TNode<Context> CreateFunctionContext(NativeContextRef native_context,
                                        TNode<Context> outer_context,
                                        int slot_count) {
     return AddNode<Context>(graph()->NewNode(
@@ -683,12 +689,16 @@ class FastApiCallReducerAssembler : public JSCallReducerAssembler {
     // holder, receiver, ... JS arguments, context, new frame state]
     CallHandlerInfoRef call_handler_info =
         *function_template_info_.call_code(broker());
-    Callable call_api_callback = CodeFactory::CallApiCallback(isolate());
+    bool no_profiling =
+        broker()->dependencies()->DependOnNoProfilingProtector();
+    Callable call_api_callback = Builtins::CallableFor(
+        isolate(), no_profiling ? Builtin::kCallApiCallbackOptimizedNoProfiling
+                                : Builtin::kCallApiCallbackOptimized);
     CallInterfaceDescriptor cid = call_api_callback.descriptor();
     CallDescriptor* call_descriptor =
         Linkage::GetStubCallDescriptor(graph()->zone(), cid, arity_ + kReceiver,
                                        CallDescriptor::kNeedsFrameState);
-    ApiFunction api_function(call_handler_info.callback());
+    ApiFunction api_function(call_handler_info.callback(broker()));
     ExternalReference function_reference = ExternalReference::Create(
         isolate(), &api_function, ExternalReference::DIRECT_API_CALL,
         function_template_info_.c_functions(broker()).data(),
@@ -696,10 +706,9 @@ class FastApiCallReducerAssembler : public JSCallReducerAssembler {
         static_cast<unsigned>(
             function_template_info_.c_functions(broker()).size()));
 
-    Node* continuation_frame_state =
-        CreateGenericLazyDeoptContinuationFrameState(
-            jsgraph(), shared_, target_, ContextInput(), receiver_,
-            FrameStateInput());
+    Node* continuation_frame_state = CreateInlinedApiFunctionFrameState(
+        jsgraph(), shared_, target_, ContextInput(), receiver_,
+        FrameStateInput());
 
     inputs[cursor++] = HeapConstant(call_api_callback.code());
     inputs[cursor++] = ExternalConstant(function_reference);
@@ -771,9 +780,11 @@ TNode<String> JSCallReducerAssembler::CheckString(TNode<Object> value) {
 }
 
 TNode<Number> JSCallReducerAssembler::CheckBounds(TNode<Number> value,
-                                                  TNode<Number> limit) {
-  return AddNode<Number>(graph()->NewNode(simplified()->CheckBounds(feedback()),
-                                          value, limit, effect(), control()));
+                                                  TNode<Number> limit,
+                                                  CheckBoundsFlags flags) {
+  return AddNode<Number>(
+      graph()->NewNode(simplified()->CheckBounds(feedback(), flags), value,
+                       limit, effect(), control()));
 }
 
 TNode<Smi> JSCallReducerAssembler::TypeGuardUnsignedSmall(TNode<Object> value) {
@@ -857,7 +868,7 @@ TNode<JSArray> JSCallReducerAssembler::CreateArrayNoThrow(
 }
 
 TNode<JSArray> JSCallReducerAssembler::AllocateEmptyJSArray(
-    ElementsKind kind, const NativeContextRef& native_context) {
+    ElementsKind kind, NativeContextRef native_context) {
   // TODO(jgruber): Port AllocationBuilder to JSGraphAssembler.
   MapRef map = native_context.GetInitialJSArrayMap(broker(), kind);
 
@@ -928,7 +939,7 @@ TNode<String> JSCallReducerAssembler::ReduceStringPrototypeSubstring() {
 }
 
 TNode<Boolean> JSCallReducerAssembler::ReduceStringPrototypeStartsWith(
-    const StringRef& search_element_string) {
+    StringRef search_element_string) {
   DCHECK(search_element_string.IsContentAccessible());
   TNode<Object> receiver = ReceiverInput();
   TNode<Object> start = ArgumentOrZero(1);
@@ -1020,6 +1031,147 @@ TNode<Boolean> JSCallReducerAssembler::ReduceStringPrototypeStartsWith() {
   return out.PhiAt<Boolean>(0);
 }
 
+TNode<Boolean> JSCallReducerAssembler::ReduceStringPrototypeEndsWith(
+    StringRef search_element_string) {
+  DCHECK(search_element_string.IsContentAccessible());
+  TNode<Object> receiver = ReceiverInput();
+  TNode<Object> end_position = ArgumentOrUndefined(1);
+  TNode<Number> zero = ZeroConstant();
+
+  TNode<String> receiver_string = CheckString(receiver);
+  TNode<Number> length = StringLength(receiver_string);
+  int search_string_length = search_element_string.length();
+  DCHECK_LE(search_string_length, JSCallReducer::kMaxInlineMatchSequence);
+
+  TNode<Number> clamped_end =
+      SelectIf<Number>(IsUndefined(end_position))
+          .Then(_ { return length; })
+          .Else(_ {
+            return NumberMin(NumberMax(CheckSmi(end_position), zero), length);
+          })
+          .ExpectTrue()
+          .Value();
+
+  TNode<Number> start =
+      NumberSubtract(clamped_end, NumberConstant(search_string_length));
+
+  auto out = MakeLabel(MachineRepresentation::kTagged);
+
+  TNode<Boolean> search_string_too_long = NumberLessThan(start, zero);
+  GotoIf(search_string_too_long, &out, BranchHint::kFalse, FalseConstant());
+
+  for (int i = 0; i < search_string_length; i++) {
+    TNode<Number> k = NumberConstant(i);
+    TNode<Number> receiver_string_position = TNode<Number>::UncheckedCast(
+        TypeGuard(Type::UnsignedSmall(), NumberAdd(k, start)));
+    Node* receiver_string_char =
+        StringCharCodeAt(receiver_string, receiver_string_position);
+    Node* search_string_char =
+        jsgraph()->Constant(search_element_string.GetChar(broker(), i).value());
+    auto is_equal = graph()->NewNode(simplified()->NumberEqual(),
+                                     receiver_string_char, search_string_char);
+    GotoIfNot(is_equal, &out, FalseConstant());
+  }
+
+  Goto(&out, TrueConstant());
+
+  Bind(&out);
+  return out.PhiAt<Boolean>(0);
+}
+
+TNode<Boolean> JSCallReducerAssembler::ReduceStringPrototypeEndsWith() {
+  TNode<Object> receiver = ReceiverInput();
+  TNode<Object> search_string = ArgumentOrUndefined(0);
+  TNode<Object> end_position = ArgumentOrUndefined(1);
+  TNode<Number> zero = ZeroConstant();
+
+  TNode<String> receiver_string = CheckString(receiver);
+  TNode<Number> length = StringLength(receiver_string);
+  TNode<String> search_element_string = CheckString(search_string);
+  TNode<Number> search_string_length = StringLength(search_element_string);
+
+  TNode<Number> clamped_end =
+      SelectIf<Number>(IsUndefined(end_position))
+          .Then(_ { return length; })
+          .Else(_ {
+            return NumberMin(NumberMax(CheckSmi(end_position), zero), length);
+          })
+          .ExpectTrue()
+          .Value();
+
+  TNode<Number> start = NumberSubtract(clamped_end, search_string_length);
+
+  auto out = MakeLabel(MachineRepresentation::kTagged);
+
+  TNode<Boolean> search_string_too_long = NumberLessThan(start, zero);
+  GotoIf(search_string_too_long, &out, BranchHint::kFalse, FalseConstant());
+
+  ForZeroUntil(search_string_length).Do([&](TNode<Number> k) {
+    TNode<Number> receiver_string_position = TNode<Number>::UncheckedCast(
+        TypeGuard(Type::UnsignedSmall(), NumberAdd(k, start)));
+    Node* receiver_string_char =
+        StringCharCodeAt(receiver_string, receiver_string_position);
+    if (!v8_flags.turbo_loop_variable) {
+      // Without loop variable analysis, Turbofan's typer is unable to derive a
+      // sufficiently precise type here. This is not a soundness problem, but
+      // triggers graph verification errors. So we only insert the TypeGuard if
+      // necessary.
+      k = TypeGuard(Type::Unsigned32(), k);
+    }
+    Node* search_string_char = StringCharCodeAt(search_element_string, k);
+    auto is_equal = graph()->NewNode(simplified()->NumberEqual(),
+                                     receiver_string_char, search_string_char);
+    GotoIfNot(is_equal, &out, FalseConstant());
+  });
+
+  Goto(&out, TrueConstant());
+
+  Bind(&out);
+  return out.PhiAt<Boolean>(0);
+}
+
+TNode<String> JSCallReducerAssembler::ReduceStringPrototypeCharAt(
+    StringRef s, uint32_t index) {
+  DCHECK(s.IsContentAccessible());
+  if (s.IsOneByteRepresentation()) {
+    OptionalObjectRef elem = s.GetCharAsStringOrUndefined(broker(), index);
+    TNode<String> elem_string =
+        elem.has_value() ? TNode<String>::UncheckedCast(
+                               jsgraph()->Constant(elem.value(), broker()))
+                         : EmptyStringConstant();
+    return elem_string;
+  } else {
+    const uint32_t length = static_cast<uint32_t>(s.length());
+    if (index >= length) return EmptyStringConstant();
+    Handle<SeqTwoByteString> flat = broker()->CanonicalPersistentHandle(
+        broker()
+            ->local_isolate_or_isolate()
+            ->factory()
+            ->NewRawTwoByteString(1, AllocationType::kOld)
+            .ToHandleChecked());
+    flat->SeqTwoByteStringSet(0, s.GetChar(broker(), index).value());
+    TNode<String> two_byte_elem =
+        TNode<String>::UncheckedCast(jsgraph()->HeapConstant(flat));
+    return two_byte_elem;
+  }
+}
+
+TNode<String> JSCallReducerAssembler::ReduceStringPrototypeCharAt() {
+  TNode<Object> receiver = ReceiverInput();
+  TNode<Object> index = ArgumentOrZero(0);
+
+  TNode<String> receiver_string = CheckString(receiver);
+  TNode<Number> index_smi = CheckSmi(index);
+  TNode<Number> length = StringLength(receiver_string);
+
+  TNode<Number> bounded_index = CheckBounds(index_smi, length);
+
+  Node* result = StringCharCodeAt(receiver_string, bounded_index);
+  TNode<String> result_string =
+      StringFromSingleCharCode(TNode<Number>::UncheckedCast(result));
+  return result_string;
+}
+
 TNode<String> JSCallReducerAssembler::ReduceStringPrototypeSlice() {
   TNode<Object> receiver = ReceiverInput();
   TNode<Object> start = Argument(0);
@@ -1121,7 +1273,7 @@ TNode<Object> JSCallReducerAssembler::ReduceJSCallMathMinMaxWithArrayLike(
 }
 
 TNode<Object> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeAt(
-    ZoneVector<const MapRef*> maps, bool needs_fallback_builtin_call) {
+    ZoneVector<MapRef> maps, bool needs_fallback_builtin_call) {
   TNode<JSArray> receiver = ReceiverInputAs<JSArray>();
   TNode<Object> index = ArgumentOrZero(0);
 
@@ -1133,14 +1285,14 @@ TNode<Object> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeAt(
 
   auto out = MakeLabel(MachineRepresentation::kTagged);
 
-  for (const MapRef* map : maps) {
-    DCHECK(map->supports_fast_array_iteration(broker()));
+  for (MapRef map : maps) {
+    DCHECK(map.supports_fast_array_iteration(broker()));
     auto correct_map_label = MakeLabel(), wrong_map_label = MakeLabel();
-    TNode<Boolean> is_map_equal = ReferenceEqual(receiver_map, Constant(*map));
+    TNode<Boolean> is_map_equal = ReferenceEqual(receiver_map, Constant(map));
     Branch(is_map_equal, &correct_map_label, &wrong_map_label);
     Bind(&correct_map_label);
 
-    TNode<Number> length = LoadJSArrayLength(receiver, map->elements_kind());
+    TNode<Number> length = LoadJSArrayLength(receiver, map.elements_kind());
 
     // If index is less than 0, then subtract from length.
     TNode<Boolean> cond = NumberLessThan(index_num, ZeroConstant());
@@ -1156,19 +1308,23 @@ TNode<Object> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeAt(
            UndefinedConstant());
     GotoIfNot(NumberLessThan(real_index_num, length), &out,
               UndefinedConstant());
+    if (v8_flags.turbo_typer_hardening) {
+      real_index_num = CheckBounds(real_index_num, length,
+                                   CheckBoundsFlag::kAbortOnOutOfBounds);
+    }
 
     // Retrieving element at index.
     TNode<Object> element = LoadElement<Object>(
-        AccessBuilder::ForFixedArrayElement(map->elements_kind()), elements,
+        AccessBuilder::ForFixedArrayElement(map.elements_kind()), elements,
         real_index_num);
-    if (IsHoleyElementsKind(map->elements_kind())) {
+    if (IsHoleyElementsKind(map.elements_kind())) {
       // This case is needed in particular for HOLEY_DOUBLE_ELEMENTS: raw
       // doubles are stored in the FixedDoubleArray, and need to be converted to
       // HeapNumber or to Smi so that this function can return an Object. The
       // automatic converstion performed by
       // RepresentationChanger::GetTaggedRepresentationFor does not handle
       // holes, so we convert manually a potential hole here.
-      element = TryConvertHoleToUndefined(element, map->elements_kind());
+      element = TryConvertHoleToUndefined(element, map.elements_kind());
     }
     Goto(&out, element);
 
@@ -1203,7 +1359,7 @@ TNode<Object> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeAt(
 TNode<Number> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypePush(
     MapInference* inference) {
   int const num_push_arguments = ArgumentCount();
-  ZoneVector<MapRef> const& receiver_maps = inference->GetMaps();
+  ZoneRefSet<Map> const& receiver_maps = inference->GetMaps();
 
   base::SmallVector<MachineRepresentation, 4> argument_reps;
   base::SmallVector<Node*, 4> argument_nodes;
@@ -1221,7 +1377,7 @@ TNode<Number> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypePush(
   auto object_label = MakeLabel(argument_reps);
 
   for (size_t i = 0; i < receiver_maps.size(); i++) {
-    const MapRef& map = receiver_maps[i];
+    MapRef map = receiver_maps[i];
     ElementsKind kind = map.elements_kind();
 
     if (i < receiver_maps.size() - 1) {
@@ -1364,7 +1520,7 @@ FrameState ForEachLoopEagerFrameState(const ForEachFrameStateParams& params,
 TNode<Object>
 IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeForEach(
     MapInference* inference, const bool has_stability_dependency,
-    ElementsKind kind, const SharedFunctionInfoRef& shared) {
+    ElementsKind kind, SharedFunctionInfoRef shared) {
   FrameState outer_frame_state = FrameStateInput();
   TNode<Context> context = ContextInput();
   TNode<Object> target = TargetInput();
@@ -1479,7 +1635,7 @@ FrameState ReduceLoopEagerFrameState(const ReduceFrameStateParams& params,
 TNode<Object> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeReduce(
     MapInference* inference, const bool has_stability_dependency,
     ElementsKind kind, ArrayReduceDirection direction,
-    const SharedFunctionInfoRef& shared) {
+    SharedFunctionInfoRef shared) {
   FrameState outer_frame_state = FrameStateInput();
   TNode<Context> context = ContextInput();
   TNode<Object> target = TargetInput();
@@ -1633,8 +1789,8 @@ FrameState MapLoopEagerFrameState(const MapFrameStateParams& params,
 
 TNode<JSArray> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeMap(
     MapInference* inference, const bool has_stability_dependency,
-    ElementsKind kind, const SharedFunctionInfoRef& shared,
-    const NativeContextRef& native_context) {
+    ElementsKind kind, SharedFunctionInfoRef shared,
+    NativeContextRef native_context) {
   FrameState outer_frame_state = FrameStateInput();
   TNode<Context> context = ContextInput();
   TNode<Object> target = TargetInput();
@@ -1775,8 +1931,8 @@ FrameState FilterLoopEagerFrameState(const FilterFrameStateParams& params,
 TNode<JSArray>
 IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeFilter(
     MapInference* inference, const bool has_stability_dependency,
-    ElementsKind kind, const SharedFunctionInfoRef& shared,
-    const NativeContextRef& native_context) {
+    ElementsKind kind, SharedFunctionInfoRef shared,
+    NativeContextRef native_context) {
   FrameState outer_frame_state = FrameStateInput();
   TNode<Context> context = ContextInput();
   TNode<Object> target = TargetInput();
@@ -1911,8 +2067,8 @@ FrameState FindLoopAfterCallbackLazyFrameState(
 
 TNode<Object> IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeFind(
     MapInference* inference, const bool has_stability_dependency,
-    ElementsKind kind, const SharedFunctionInfoRef& shared,
-    const NativeContextRef& native_context, ArrayFindVariant variant) {
+    ElementsKind kind, SharedFunctionInfoRef shared,
+    NativeContextRef native_context, ArrayFindVariant variant) {
   FrameState outer_frame_state = FrameStateInput();
   TNode<Context> context = ContextInput();
   TNode<Object> target = TargetInput();
@@ -2013,8 +2169,8 @@ FrameState EverySomeLoopEagerFrameState(const EverySomeFrameStateParams& params,
 TNode<Boolean>
 IteratingArrayBuiltinReducerAssembler::ReduceArrayPrototypeEverySome(
     MapInference* inference, const bool has_stability_dependency,
-    ElementsKind kind, const SharedFunctionInfoRef& shared,
-    const NativeContextRef& native_context, ArrayEverySomeVariant variant) {
+    ElementsKind kind, SharedFunctionInfoRef shared,
+    NativeContextRef native_context, ArrayEverySomeVariant variant) {
   FrameState outer_frame_state = FrameStateInput();
   TNode<Context> context = ContextInput();
   TNode<Object> target = TargetInput();
@@ -2160,28 +2316,22 @@ struct PromiseCtorFrameStateParams {
 
 // Remnant of old-style JSCallReducer code. Could be ported to graph assembler,
 // but probably not worth the effort.
-FrameState CreateArtificialFrameState(
-    Node* node, Node* outer_frame_state, int parameter_count,
-    BytecodeOffset bailout_id, FrameStateType frame_state_type,
-    const SharedFunctionInfoRef& shared, Node* context,
-    CommonOperatorBuilder* common, Graph* graph) {
+FrameState CreateConstructInvokeStubFrameState(
+    Node* node, Node* outer_frame_state, SharedFunctionInfoRef shared,
+    Node* context, CommonOperatorBuilder* common, Graph* graph) {
   const FrameStateFunctionInfo* state_info =
-      common->CreateFrameStateFunctionInfo(
-          frame_state_type, parameter_count + 1, 0, shared.object());
+      common->CreateFrameStateFunctionInfo(FrameStateType::kConstructInvokeStub,
+                                           1, 0, shared.object());
 
   const Operator* op = common->FrameState(
-      bailout_id, OutputFrameStateCombine::Ignore(), state_info);
+      BytecodeOffset::None(), OutputFrameStateCombine::Ignore(), state_info);
   const Operator* op0 = common->StateValues(0, SparseInputMask::Dense());
   Node* node0 = graph->NewNode(op0);
 
   static constexpr int kTargetInputIndex = 0;
   static constexpr int kReceiverInputIndex = 1;
-  const int parameter_count_with_receiver = parameter_count + 1;
   std::vector<Node*> params;
-  params.reserve(parameter_count_with_receiver);
-  for (int i = 0; i < parameter_count_with_receiver; i++) {
-    params.push_back(node->InputAt(kReceiverInputIndex + i));
-  }
+  params.push_back(node->InputAt(kReceiverInputIndex));
   const Operator* op_param = common->StateValues(
       static_cast<int>(params.size()), SparseInputMask::Dense());
   Node* params_node = graph->NewNode(op_param, static_cast<int>(params.size()),
@@ -2197,10 +2347,9 @@ FrameState PromiseConstructorFrameState(
     Graph* graph) {
   DCHECK_EQ(1,
             params.shared.internal_formal_parameter_count_without_receiver());
-  return CreateArtificialFrameState(
-      params.node_ptr, params.outer_frame_state, 1,
-      BytecodeOffset::ConstructStubInvoke(), FrameStateType::kConstructStub,
-      params.shared, params.context, common, graph);
+  return CreateConstructInvokeStubFrameState(
+      params.node_ptr, params.outer_frame_state, params.shared, params.context,
+      common, graph);
 }
 
 FrameState PromiseConstructorLazyFrameState(
@@ -2241,7 +2390,7 @@ FrameState PromiseConstructorLazyWithCatchFrameState(
 }  // namespace
 
 TNode<Object> PromiseBuiltinReducerAssembler::ReducePromiseConstructor(
-    const NativeContextRef& native_context) {
+    NativeContextRef native_context) {
   DCHECK_GE(ConstructArity(), 1);
 
   JSConstructNode n(node_ptr());
@@ -2734,14 +2883,14 @@ Reduction JSCallReducer::ReduceFunctionPrototypeBind(Node* node) {
   // definitely a constructor or not a constructor.
   MapInference inference(broker(), receiver, effect);
   if (!inference.HaveMaps()) return NoChange();
-  ZoneVector<MapRef> const& receiver_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& receiver_maps = inference.GetMaps();
 
   MapRef first_receiver_map = receiver_maps[0];
   bool const is_constructor = first_receiver_map.is_constructor();
 
   HeapObjectRef prototype = first_receiver_map.prototype(broker());
 
-  for (const MapRef& receiver_map : receiver_maps) {
+  for (MapRef receiver_map : receiver_maps) {
     HeapObjectRef map_prototype = receiver_map.prototype(broker());
 
     // Check for consistency among the {receiver_maps}.
@@ -2823,7 +2972,7 @@ Reduction JSCallReducer::ReduceFunctionPrototypeBind(Node* node) {
   int const arity_with_bound_this = std::max(arity, kBoundThis);
   int const input_count =
       arity_with_bound_this + kReceiverContextEffectAndControl;
-  Node** inputs = graph()->zone()->NewArray<Node*>(input_count);
+  Node** inputs = graph()->zone()->AllocateArray<Node*>(input_count);
   int cursor = 0;
   inputs[cursor++] = receiver;
   inputs[cursor++] = n.ArgumentOrUndefined(0, jsgraph());  // bound_this.
@@ -2922,7 +3071,7 @@ Reduction JSCallReducer::ReduceObjectGetPrototype(Node* node, Node* object) {
   // Try to determine the {object} map.
   MapInference inference(broker(), object, effect);
   if (!inference.HaveMaps()) return NoChange();
-  ZoneVector<MapRef> const& object_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& object_maps = inference.GetMaps();
 
   MapRef candidate_map = object_maps[0];
   HeapObjectRef candidate_prototype = candidate_map.prototype(broker());
@@ -3103,9 +3252,9 @@ Reduction JSCallReducer::ReduceReflectConstruct(Node* node) {
   CallParameters const& p = n.Parameters();
   int arity = p.arity_without_implicit_args();
   // Massage value inputs appropriately.
-  Node* arg_target = n.ArgumentOrUndefined(0, jsgraph());
-  Node* arg_argument_list = n.ArgumentOrUndefined(1, jsgraph());
-  Node* arg_new_target = n.ArgumentOr(2, arg_target);
+  TNode<Object> arg_target = n.ArgumentOrUndefined(0, jsgraph());
+  TNode<Object> arg_argument_list = n.ArgumentOrUndefined(1, jsgraph());
+  TNode<Object> arg_new_target = n.ArgumentOr(2, arg_target);
 
   static_assert(n.ReceiverIndex() > n.TargetIndex());
   node->RemoveInput(n.ReceiverIndex());
@@ -3228,7 +3377,7 @@ Reduction JSCallReducer::ReduceReflectGet(Node* node) {
 
   // Connect the throwing path to end.
   if_false = graph()->NewNode(common()->Throw(), efalse, if_false);
-  NodeProperties::MergeControlToEnd(graph(), common(), if_false);
+  MergeControlToEnd(graph(), common(), if_false);
 
   // Continue on the regular path.
   ReplaceWithValue(node, vtrue, etrue, if_true);
@@ -3294,7 +3443,7 @@ Reduction JSCallReducer::ReduceReflectHas(Node* node) {
 
   // Connect the throwing path to end.
   if_false = graph()->NewNode(common()->Throw(), efalse, if_false);
-  NodeProperties::MergeControlToEnd(graph(), common(), if_false);
+  MergeControlToEnd(graph(), common(), if_false);
 
   // Continue on the regular path.
   ReplaceWithValue(node, vtrue, etrue, if_true);
@@ -3304,11 +3453,11 @@ Reduction JSCallReducer::ReduceReflectHas(Node* node) {
 namespace {
 
 bool CanInlineArrayIteratingBuiltin(JSHeapBroker* broker,
-                                    ZoneVector<MapRef> const& receiver_maps,
+                                    ZoneRefSet<Map> const& receiver_maps,
                                     ElementsKind* kind_return) {
   DCHECK_NE(0, receiver_maps.size());
   *kind_return = receiver_maps[0].elements_kind();
-  for (const MapRef& map : receiver_maps) {
+  for (MapRef map : receiver_maps) {
     if (!map.supports_fast_array_iteration(broker) ||
         !UnionElementsKindUptoSize(kind_return, map.elements_kind())) {
       return false;
@@ -3318,11 +3467,11 @@ bool CanInlineArrayIteratingBuiltin(JSHeapBroker* broker,
 }
 
 bool CanInlineArrayResizingBuiltin(JSHeapBroker* broker,
-                                   ZoneVector<MapRef> const& receiver_maps,
+                                   ZoneRefSet<Map> const& receiver_maps,
                                    std::vector<ElementsKind>* kinds,
                                    bool builtin_is_push = false) {
   DCHECK_NE(0, receiver_maps.size());
-  for (const MapRef& map : receiver_maps) {
+  for (MapRef map : receiver_maps) {
     if (!map.supports_fast_array_resize(broker)) return false;
     // TODO(turbofan): We should also handle fast holey double elements once
     // we got the hole NaN mess sorted out in TurboFan/V8.
@@ -3362,7 +3511,7 @@ class IteratingArrayBuiltinHelper {
 
     // Try to determine the {receiver} map.
     if (!inference_.HaveMaps()) return;
-    ZoneVector<MapRef> const& receiver_maps = inference_.GetMaps();
+    ZoneRefSet<Map> const& receiver_maps = inference_.GetMaps();
 
     if (!CanInlineArrayIteratingBuiltin(broker, receiver_maps,
                                         &elements_kind_)) {
@@ -3397,8 +3546,8 @@ class IteratingArrayBuiltinHelper {
 
 }  // namespace
 
-Reduction JSCallReducer::ReduceArrayForEach(
-    Node* node, const SharedFunctionInfoRef& shared) {
+Reduction JSCallReducer::ReduceArrayForEach(Node* node,
+                                            SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3409,8 +3558,8 @@ Reduction JSCallReducer::ReduceArrayForEach(
   return ReplaceWithSubgraph(&a, subgraph);
 }
 
-Reduction JSCallReducer::ReduceArrayReduce(
-    Node* node, const SharedFunctionInfoRef& shared) {
+Reduction JSCallReducer::ReduceArrayReduce(Node* node,
+                                           SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3422,8 +3571,8 @@ Reduction JSCallReducer::ReduceArrayReduce(
   return ReplaceWithSubgraph(&a, subgraph);
 }
 
-Reduction JSCallReducer::ReduceArrayReduceRight(
-    Node* node, const SharedFunctionInfoRef& shared) {
+Reduction JSCallReducer::ReduceArrayReduceRight(Node* node,
+                                                SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3436,7 +3585,7 @@ Reduction JSCallReducer::ReduceArrayReduceRight(
 }
 
 Reduction JSCallReducer::ReduceArrayMap(Node* node,
-                                        const SharedFunctionInfoRef& shared) {
+                                        SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3454,8 +3603,8 @@ Reduction JSCallReducer::ReduceArrayMap(Node* node,
   return ReplaceWithSubgraph(&a, subgraph);
 }
 
-Reduction JSCallReducer::ReduceArrayFilter(
-    Node* node, const SharedFunctionInfoRef& shared) {
+Reduction JSCallReducer::ReduceArrayFilter(Node* node,
+                                           SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3474,7 +3623,7 @@ Reduction JSCallReducer::ReduceArrayFilter(
 }
 
 Reduction JSCallReducer::ReduceArrayFind(Node* node,
-                                         const SharedFunctionInfoRef& shared) {
+                                         SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3487,8 +3636,8 @@ Reduction JSCallReducer::ReduceArrayFind(Node* node,
   return ReplaceWithSubgraph(&a, subgraph);
 }
 
-Reduction JSCallReducer::ReduceArrayFindIndex(
-    Node* node, const SharedFunctionInfoRef& shared) {
+Reduction JSCallReducer::ReduceArrayFindIndex(Node* node,
+                                              SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3502,7 +3651,7 @@ Reduction JSCallReducer::ReduceArrayFindIndex(
 }
 
 Reduction JSCallReducer::ReduceArrayEvery(Node* node,
-                                          const SharedFunctionInfoRef& shared) {
+                                          SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3544,7 +3693,7 @@ Reduction JSCallReducer::ReduceArrayIndexOf(Node* node) {
 }
 
 Reduction JSCallReducer::ReduceArraySome(Node* node,
-                                         const SharedFunctionInfoRef& shared) {
+                                         SharedFunctionInfoRef shared) {
   IteratingArrayBuiltinHelper h(node, broker(), jsgraph(), dependencies());
   if (!h.can_reduce()) return h.inference()->NoChange();
 
@@ -3583,8 +3732,8 @@ bool CanInlineJSToWasmCall(const wasm::FunctionSig* wasm_signature) {
 
 }  // namespace
 
-Reduction JSCallReducer::ReduceCallWasmFunction(
-    Node* node, const SharedFunctionInfoRef& shared) {
+Reduction JSCallReducer::ReduceCallWasmFunction(Node* node,
+                                                SharedFunctionInfoRef shared) {
   DCHECK(flags() & kInlineJSToWasmCalls);
 
   JSCallNode n(node);
@@ -3612,13 +3761,17 @@ Reduction JSCallReducer::ReduceCallWasmFunction(
   if (shared.object()->HasWasmExportedFunctionData()) {
     native_module = shared.object()
                         ->wasm_exported_function_data()
-                        .instance()
-                        .module_object()
-                        .native_module();
-  }
-  const Operator* op = javascript()->CallWasm(wasm_module, wasm_signature,
-                                              shared.wasm_function_index(),
-                                              native_module, p.feedback());
+                        ->instance()
+                        ->module_object()
+                        ->native_module();
+  }
+  // TODO(mliedtke): We should be able to remove module, signature, native
+  // module and function index from the SharedFunctionInfoRef. However, for some
+  // reason I may dereference the SharedFunctionInfoRef here but not in
+  // JSInliningHeuristic later on.
+  const Operator* op = javascript()->CallWasm(
+      wasm_module, wasm_signature, shared.wasm_function_index(), shared,
+      native_module, p.feedback());
 
   // Remove additional inputs
   size_t actual_arity = n.ArgumentCount();
@@ -3663,7 +3816,7 @@ Reduction JSCallReducer::ReduceCallWasmFunction(
 
 FastApiCallFunctionVector CanOptimizeFastCall(
     JSHeapBroker* broker, Zone* zone,
-    const FunctionTemplateInfoRef& function_template_info, size_t argc) {
+    FunctionTemplateInfoRef function_template_info, size_t argc) {
   FastApiCallFunctionVector result(zone);
   if (!v8_flags.turbo_fast_api_calls) return result;
 
@@ -3704,8 +3857,8 @@ FastApiCallFunctionVector CanOptimizeFastCall(
   return result;
 }
 
-Reduction JSCallReducer::ReduceCallApiFunction(
-    Node* node, const SharedFunctionInfoRef& shared) {
+Reduction JSCallReducer::ReduceCallApiFunction(Node* node,
+                                               SharedFunctionInfoRef shared) {
   JSCallNode n(node);
   CallParameters const& p = n.Parameters();
   int const argc = p.arity_without_implicit_args();
@@ -3755,7 +3908,7 @@ Reduction JSCallReducer::ReduceCallApiFunction(
     // Try to infer the {receiver} maps from the graph.
     MapInference inference(broker(), receiver, effect);
     if (inference.HaveMaps()) {
-      ZoneVector<MapRef> const& receiver_maps = inference.GetMaps();
+      ZoneRefSet<Map> const& receiver_maps = inference.GetMaps();
       MapRef first_receiver_map = receiver_maps[0];
 
       // See if we can constant-fold the compatible receiver checks.
@@ -3833,6 +3986,7 @@ Reduction JSCallReducer::ReduceCallApiFunction(
       // faster than the generic call sequence.
       Builtin builtin_name;
       if (function_template_info.accept_any_receiver()) {
+        DCHECK(!function_template_info.is_signature_undefined(broker()));
         builtin_name = Builtin::kCallFunctionTemplate_CheckCompatibleReceiver;
       } else if (function_template_info.is_signature_undefined(broker())) {
         builtin_name = Builtin::kCallFunctionTemplate_CheckAccess;
@@ -3858,7 +4012,7 @@ Reduction JSCallReducer::ReduceCallApiFunction(
       node->ReplaceInput(1,
                          jsgraph()->Constant(function_template_info, broker()));
       node->InsertInput(graph()->zone(), 2,
-                        jsgraph()->Constant(JSParameterCount(argc)));
+                        jsgraph()->Int32Constant(JSParameterCount(argc)));
       node->ReplaceInput(3, receiver);       // Update receiver input.
       node->ReplaceInput(6 + argc, effect);  // Update effect input.
       NodeProperties::ChangeOp(node, common()->Call(call_descriptor));
@@ -3881,7 +4035,9 @@ Reduction JSCallReducer::ReduceCallApiFunction(
       broker(), graph()->zone(), function_template_info, argc);
   DCHECK_LE(c_candidate_functions.size(), 2);
 
-  if (!c_candidate_functions.empty()) {
+  // TODO(v8:13600): Support exception handling for FastApiCall nodes.
+  if (!c_candidate_functions.empty() &&
+      !NodeProperties::IsExceptionalCall(node)) {
     FastApiCallReducerAssembler a(this, node, function_template_info,
                                   c_candidate_functions, receiver, holder,
                                   shared, target, argc, effect);
@@ -3895,16 +4051,19 @@ Reduction JSCallReducer::ReduceCallApiFunction(
 
   CallHandlerInfoRef call_handler_info =
       *function_template_info.call_code(broker());
-  Callable call_api_callback = CodeFactory::CallApiCallback(isolate());
+  bool no_profiling = broker()->dependencies()->DependOnNoProfilingProtector();
+  Callable call_api_callback = Builtins::CallableFor(
+      isolate(), no_profiling ? Builtin::kCallApiCallbackOptimizedNoProfiling
+                              : Builtin::kCallApiCallbackOptimized);
   CallInterfaceDescriptor cid = call_api_callback.descriptor();
   auto call_descriptor =
       Linkage::GetStubCallDescriptor(graph()->zone(), cid, argc + 1 /*
      implicit receiver */, CallDescriptor::kNeedsFrameState);
-  ApiFunction api_function(call_handler_info.callback());
+  ApiFunction api_function(call_handler_info.callback(broker()));
   ExternalReference function_reference = ExternalReference::Create(
       &api_function, ExternalReference::DIRECT_API_CALL);
 
-  Node* continuation_frame_state = CreateGenericLazyDeoptContinuationFrameState(
+  Node* continuation_frame_state = CreateInlinedApiFunctionFrameState(
       jsgraph(), shared, target, context, receiver, frame_state);
 
   node->RemoveInput(n.FeedbackVectorIndex());
@@ -4003,7 +4162,7 @@ void JSCallReducer::CheckIfConstructor(Node* construct) {
   // simply connect the successful completion to the graph end.
   Node* throw_node =
       graph()->NewNode(common()->Throw(), check_throw, check_fail);
-  NodeProperties::MergeControlToEnd(graph(), common(), throw_node);
+  MergeControlToEnd(graph(), common(), throw_node);
 }
 
 namespace {
@@ -4323,8 +4482,7 @@ Reduction JSCallReducer::ReduceCallOrConstructWithArrayLikeOrSpread(
   // Speculate on that array's map is still equal to the dynamic map of
   // arguments_list; generate a map check.
   effect = graph()->NewNode(
-      simplified()->CheckMaps(CheckMapsFlag::kNone,
-                              ZoneHandleSet<Map>(array_map.object()),
+      simplified()->CheckMaps(CheckMapsFlag::kNone, ZoneRefSet<Map>(array_map),
                               feedback_source),
       arguments_list, effect, control);
 
@@ -4409,7 +4567,7 @@ Reduction JSCallReducer::ReduceJSCall(Node* node) {
       JSBoundFunctionRef function = target_ref.AsJSBoundFunction();
       ObjectRef bound_this = function.bound_this(broker());
       ConvertReceiverMode const convert_mode =
-          bound_this.IsNullOrUndefined(broker())
+          bound_this.IsNullOrUndefined()
               ? ConvertReceiverMode::kNullOrUndefined
               : ConvertReceiverMode::kNotNullOrUndefined;
 
@@ -4575,7 +4733,7 @@ Reduction JSCallReducer::ReduceJSCall(Node* node) {
 }
 
 Reduction JSCallReducer::ReduceJSCall(Node* node,
-                                      const SharedFunctionInfoRef& shared) {
+                                      SharedFunctionInfoRef shared) {
   JSCallNode n(node);
   Node* target = n.target();
 
@@ -4583,7 +4741,7 @@ Reduction JSCallReducer::ReduceJSCall(Node* node,
   // If this state changes during background compilation, the compilation
   // job will be aborted from the main thread (see
   // Debug::PrepareFunctionForDebugExecution()).
-  if (shared.HasBreakInfo()) return NoChange();
+  if (shared.HasBreakInfo(broker())) return NoChange();
 
   // Class constructors are callable, but [[Call]] will raise an exception.
   // See ES6 section 9.2.1 [[Call]] ( thisArgument, argumentsList ).
@@ -4863,6 +5021,8 @@ Reduction JSCallReducer::ReduceJSCall(Node* node,
       return ReduceStringPrototypeSubstr(node);
     case Builtin::kStringPrototypeStartsWith:
       return ReduceStringPrototypeStartsWith(node);
+    case Builtin::kStringPrototypeEndsWith:
+      return ReduceStringPrototypeEndsWith(node);
 #ifdef V8_INTL_SUPPORT
     case Builtin::kStringPrototypeToLowerCaseIntl:
       return ReduceStringPrototypeToLowerCaseIntl(node);
@@ -5160,7 +5320,7 @@ Reduction JSCallReducer::ReduceJSConstruct(Node* node) {
       // job will be aborted from the main thread (see
       // Debug::PrepareFunctionForDebugExecution()).
       SharedFunctionInfoRef sfi = function.shared(broker());
-      if (sfi.HasBreakInfo()) return NoChange();
+      if (sfi.HasBreakInfo(broker())) return NoChange();
 
       // Don't inline cross native context.
       if (!function.native_context(broker()).equals(native_context())) {
@@ -5546,9 +5706,7 @@ Reduction JSCallReducer::ReduceForInsufficientFeedback(
   Node* deoptimize =
       graph()->NewNode(common()->Deoptimize(reason, FeedbackSource()),
                        frame_state, effect, control);
-  // TODO(bmeurer): This should be on the AdvancedReducer somehow.
-  NodeProperties::MergeControlToEnd(graph(), common(), deoptimize);
-  Revisit(graph()->end());
+  MergeControlToEnd(graph(), common(), deoptimize);
   node->TrimInputCount(0);
   NodeProperties::ChangeOp(node, common()->Dead());
   return Changed(node);
@@ -5622,11 +5780,11 @@ Reduction JSCallReducer::ReduceArrayPrototypeAt(Node* node) {
 
   // Collecting maps, and checking if a fallback builtin call will be required
   // (it is required if at least one map doesn't support fast array iteration).
-  ZoneVector<const MapRef*> maps(broker()->zone());
+  ZoneVector<MapRef> maps(broker()->zone());
   bool needs_fallback_builtin_call = false;
-  for (const MapRef& map : inference.GetMaps()) {
+  for (MapRef map : inference.GetMaps()) {
     if (map.supports_fast_array_iteration(broker())) {
-      maps.push_back(&map);
+      maps.push_back(map);
     } else {
       needs_fallback_builtin_call = true;
     }
@@ -5666,7 +5824,7 @@ Reduction JSCallReducer::ReduceArrayPrototypePush(Node* node) {
 
   MapInference inference(broker(), receiver, effect);
   if (!inference.HaveMaps()) return NoChange();
-  ZoneVector<MapRef> const& receiver_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& receiver_maps = inference.GetMaps();
 
   std::vector<ElementsKind> kinds;
   if (!CanInlineArrayResizingBuiltin(broker(), receiver_maps, &kinds, true)) {
@@ -5700,7 +5858,7 @@ Reduction JSCallReducer::ReduceArrayPrototypePop(Node* node) {
 
   MapInference inference(broker(), receiver, effect);
   if (!inference.HaveMaps()) return NoChange();
-  ZoneVector<MapRef> const& receiver_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& receiver_maps = inference.GetMaps();
 
   std::vector<ElementsKind> kinds;
   if (!CanInlineArrayResizingBuiltin(broker(), receiver_maps, &kinds)) {
@@ -5771,12 +5929,12 @@ Reduction JSCallReducer::ReduceArrayPrototypePop(Node* node) {
       Node* new_length = graph()->NewNode(simplified()->NumberSubtract(),
                                           length, jsgraph()->OneConstant());
 
-      // This extra check exists solely to break an exploitation technique
-      // that abuses typer mismatches.
-      new_length = efalse = graph()->NewNode(
-          simplified()->CheckBounds(p.feedback(),
-                                    CheckBoundsFlag::kAbortOnOutOfBounds),
-          new_length, length, efalse, if_false);
+      if (v8_flags.turbo_typer_hardening) {
+        new_length = efalse = graph()->NewNode(
+            simplified()->CheckBounds(p.feedback(),
+                                      CheckBoundsFlag::kAbortOnOutOfBounds),
+            new_length, length, efalse, if_false);
+      }
 
       // Store the new {length} to the {receiver}.
       efalse = graph()->NewNode(
@@ -5847,7 +6005,7 @@ Reduction JSCallReducer::ReduceArrayPrototypeShift(Node* node) {
 
   MapInference inference(broker(), receiver, effect);
   if (!inference.HaveMaps()) return NoChange();
-  ZoneVector<MapRef> const& receiver_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& receiver_maps = inference.GetMaps();
 
   std::vector<ElementsKind> kinds;
   if (!CanInlineArrayResizingBuiltin(broker(), receiver_maps, &kinds)) {
@@ -5932,7 +6090,7 @@ Reduction JSCallReducer::ReduceArrayPrototypeShift(Node* node) {
         Node* eloop =
             graph()->NewNode(common()->EffectPhi(2), etrue1, etrue1, loop);
         Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop);
-        NodeProperties::MergeControlToEnd(graph(), common(), terminate);
+        MergeControlToEnd(graph(), common(), terminate);
 
         Node* index = graph()->NewNode(
             common()->Phi(MachineRepresentation::kTagged, 2),
@@ -5985,12 +6143,12 @@ Reduction JSCallReducer::ReduceArrayPrototypeShift(Node* node) {
         Node* new_length = graph()->NewNode(simplified()->NumberSubtract(),
                                             length, jsgraph()->OneConstant());
 
-        // This extra check exists solely to break an exploitation technique
-        // that abuses typer mismatches.
-        new_length = etrue1 = graph()->NewNode(
-            simplified()->CheckBounds(p.feedback(),
-                                      CheckBoundsFlag::kAbortOnOutOfBounds),
-            new_length, length, etrue1, if_true1);
+        if (v8_flags.turbo_typer_hardening) {
+          new_length = etrue1 = graph()->NewNode(
+              simplified()->CheckBounds(p.feedback(),
+                                        CheckBoundsFlag::kAbortOnOutOfBounds),
+              new_length, length, etrue1, if_true1);
+        }
 
         // Store the new {length} to the {receiver}.
         etrue1 = graph()->NewNode(
@@ -6102,13 +6260,13 @@ Reduction JSCallReducer::ReduceArrayPrototypeSlice(Node* node) {
 
   MapInference inference(broker(), receiver, effect);
   if (!inference.HaveMaps()) return NoChange();
-  ZoneVector<MapRef> const& receiver_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& receiver_maps = inference.GetMaps();
 
   // Check that the maps are of JSArray (and more).
   // TODO(turbofan): Consider adding special case for the common pattern
   // `slice.call(arguments)`, for example jQuery makes heavy use of that.
   bool can_be_holey = false;
-  for (const MapRef& receiver_map : receiver_maps) {
+  for (MapRef receiver_map : receiver_maps) {
     if (!receiver_map.supports_fast_array_iteration(broker())) {
       return inference.NoChange();
     }
@@ -6203,27 +6361,31 @@ Reduction JSCallReducer::ReduceArrayIterator(Node* node,
       if (p.speculation_mode() == SpeculationMode::kDisallowSpeculation) {
         return NoChange();
       }
-      Node* buffer = effect = graph()->NewNode(
-          simplified()->LoadField(AccessBuilder::ForJSArrayBufferViewBuffer()),
-          receiver, effect, control);
-      Node* buffer_bit_field = effect = graph()->NewNode(
-          simplified()->LoadField(AccessBuilder::ForJSArrayBufferBitField()),
-          buffer, effect, control);
-      Node* check = graph()->NewNode(
-          simplified()->NumberEqual(),
-          graph()->NewNode(
-              simplified()->NumberBitwiseAnd(), buffer_bit_field,
-              jsgraph()->Constant(JSArrayBuffer::WasDetachedBit::kMask)),
-          jsgraph()->ZeroConstant());
-      effect = graph()->NewNode(
-          simplified()->CheckIf(DeoptimizeReason::kArrayBufferWasDetached,
-                                p.feedback()),
-          check, effect, control);
+
+      std::set<ElementsKind> elements_kinds;
+      for (MapRef map : inference.GetMaps()) {
+        elements_kinds.insert(map.elements_kind());
+      }
+
+      // The following detach check is built with the given {elements_kinds} in
+      // mind, so we have to install dependency on those.
+      inference.RelyOnMapsPreferStability(
+          dependencies(), jsgraph(), &effect, control,
+          CallParametersOf(node->op()).feedback());
+
+      JSCallReducerAssembler a(this, node);
+      a.CheckIfTypedArrayWasDetached(
+          TNode<JSTypedArray>::UncheckedCast(receiver),
+          std::move(elements_kinds), p.feedback());
+      std::tie(effect, control) = ReleaseEffectAndControlFromAssembler(&a);
     }
   }
 
+  // JSCreateArrayIterator doesn't have control output, so we bypass the old
+  // JSCall node on the control chain.
+  ReplaceWithValue(node, node, node, control);
+
   // Morph the {node} into a JSCreateArrayIterator with the given {kind}.
-  RelaxControls(node);
   node->ReplaceInput(0, receiver);
   node->ReplaceInput(1, context);
   node->ReplaceInput(2, effect);
@@ -6256,7 +6418,7 @@ Reduction JSCallReducer::ReduceArrayIteratorPrototypeNext(Node* node) {
 
   MapInference inference(broker(), iterated_object, iterator_effect);
   if (!inference.HaveMaps()) return NoChange();
-  ZoneVector<MapRef> const& iterated_object_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& iterated_object_maps = inference.GetMaps();
 
   // Check that various {iterated_object_maps} have compatible elements kinds.
   ElementsKind elements_kind = iterated_object_maps[0].elements_kind();
@@ -6266,7 +6428,7 @@ Reduction JSCallReducer::ReduceArrayIteratorPrototypeNext(Node* node) {
         elements_kind == BIGINT64_ELEMENTS) {
       return inference.NoChange();
     }
-    for (const MapRef& iterated_object_map : iterated_object_maps) {
+    for (MapRef iterated_object_map : iterated_object_maps) {
       if (iterated_object_map.elements_kind() != elements_kind) {
         return inference.NoChange();
       }
@@ -6356,10 +6518,12 @@ Reduction JSCallReducer::ReduceArrayIteratorPrototypeNext(Node* node) {
   {
     // This extra check exists to refine the type of {index} but also to break
     // an exploitation technique that abuses typer mismatches.
-    index = etrue = graph()->NewNode(
-        simplified()->CheckBounds(p.feedback(),
-                                  CheckBoundsFlag::kAbortOnOutOfBounds),
-        index, length, etrue, if_true);
+    if (v8_flags.turbo_typer_hardening) {
+      index = etrue = graph()->NewNode(
+          simplified()->CheckBounds(p.feedback(),
+                                    CheckBoundsFlag::kAbortOnOutOfBounds),
+          index, length, etrue, if_true);
+    }
 
     done_true = jsgraph()->FalseConstant();
     if (iteration_kind == IterationKind::kKeys) {
@@ -6556,6 +6720,46 @@ Reduction JSCallReducer::ReduceStringPrototypeStartsWith(Node* node) {
   return ReplaceWithSubgraph(&a, subgraph);
 }
 
+// ES section 21.1.3.7
+// String.prototype.endsWith(searchString [, endPosition])
+Reduction JSCallReducer::ReduceStringPrototypeEndsWith(Node* node) {
+  JSCallNode n(node);
+  CallParameters const& p = n.Parameters();
+  if (p.speculation_mode() == SpeculationMode::kDisallowSpeculation) {
+    return NoChange();
+  }
+
+  TNode<Object> search_element = n.ArgumentOrUndefined(0, jsgraph());
+
+  // Here are three conditions:
+  // First, If search_element is definitely not a string, we make no change.
+  // Second, If search_element is definitely a string and its length is less
+  // or equal than max inline matching sequence threshold, we could inline
+  // the entire matching sequence.
+  // Third, we try to inline, and have a runtime deopt if search_element is
+  // not a string.
+  HeapObjectMatcher search_element_matcher(search_element);
+  if (search_element_matcher.HasResolvedValue()) {
+    ObjectRef target_ref = search_element_matcher.Ref(broker());
+    if (!target_ref.IsString()) return NoChange();
+    StringRef search_element_string = target_ref.AsString();
+    if (!search_element_string.IsContentAccessible()) return NoChange();
+    int length = search_element_string.length();
+    // If search_element's length is less or equal than
+    // kMaxInlineMatchSequence, we inline the entire
+    // matching sequence.
+    if (length <= kMaxInlineMatchSequence) {
+      JSCallReducerAssembler a(this, node);
+      Node* subgraph = a.ReduceStringPrototypeEndsWith(search_element_string);
+      return ReplaceWithSubgraph(&a, subgraph);
+    }
+  }
+
+  JSCallReducerAssembler a(this, node);
+  Node* subgraph = a.ReduceStringPrototypeEndsWith();
+  return ReplaceWithSubgraph(&a, subgraph);
+}
+
 // ES section 21.1.3.1 String.prototype.charAt ( pos )
 Reduction JSCallReducer::ReduceStringPrototypeCharAt(Node* node) {
   JSCallNode n(node);
@@ -6566,28 +6770,32 @@ Reduction JSCallReducer::ReduceStringPrototypeCharAt(Node* node) {
 
   Node* receiver = n.receiver();
   Node* index = n.ArgumentOr(0, jsgraph()->ZeroConstant());
-  Effect effect = n.effect();
-  Control control = n.control();
-
-  // Ensure that the {receiver} is actually a String.
-  receiver = effect = graph()->NewNode(simplified()->CheckString(p.feedback()),
-                                       receiver, effect, control);
-
-  // Determine the {receiver} length.
-  Node* receiver_length =
-      graph()->NewNode(simplified()->StringLength(), receiver);
 
-  // Check that the {index} is within range.
-  index = effect = graph()->NewNode(simplified()->CheckBounds(p.feedback()),
-                                    index, receiver_length, effect, control);
-
-  // Return the character from the {receiver} as single character string.
-  Node* value = effect = graph()->NewNode(simplified()->StringCharCodeAt(),
-                                          receiver, index, effect, control);
-  value = graph()->NewNode(simplified()->StringFromSingleCharCode(), value);
+  // Attempt to constant fold the operation when we know
+  // that receiver is a string and index is a number.
+  HeapObjectMatcher receiver_matcher(receiver);
+  NumberMatcher index_matcher(index);
+  if (receiver_matcher.HasResolvedValue()) {
+    HeapObjectRef receiver_ref = receiver_matcher.Ref(broker());
+    if (!receiver_ref.IsString()) return NoChange();
+    StringRef receiver_string = receiver_ref.AsString();
+    bool is_content_accessible = receiver_string.IsContentAccessible();
+    bool is_integer_in_max_range =
+        index_matcher.IsInteger() &&
+        index_matcher.IsInRange(
+            0.0, static_cast<double>(JSObject::kMaxElementIndex));
+    if (is_content_accessible && is_integer_in_max_range) {
+      const uint32_t index =
+          static_cast<uint32_t>(index_matcher.ResolvedValue());
+      JSCallReducerAssembler a(this, node);
+      Node* subgraph = a.ReduceStringPrototypeCharAt(receiver_string, index);
+      return ReplaceWithSubgraph(&a, subgraph);
+    }
+  }
 
-  ReplaceWithValue(node, value, effect, control);
-  return Replace(value);
+  JSCallReducerAssembler a(this, node);
+  Node* subgraph = a.ReduceStringPrototypeCharAt();
+  return ReplaceWithSubgraph(&a, subgraph);
 }
 
 #ifdef V8_INTL_SUPPORT
@@ -6891,11 +7099,11 @@ Reduction JSCallReducer::ReducePromiseConstructor(Node* node) {
 
 bool JSCallReducer::DoPromiseChecks(MapInference* inference) {
   if (!inference->HaveMaps()) return false;
-  ZoneVector<MapRef> const& receiver_maps = inference->GetMaps();
+  ZoneRefSet<Map> const& receiver_maps = inference->GetMaps();
 
   // Check whether all {receiver_maps} are JSPromise maps and
   // have the initial Promise.prototype as their [[Prototype]].
-  for (const MapRef& receiver_map : receiver_maps) {
+  for (MapRef receiver_map : receiver_maps) {
     if (!receiver_map.IsJSPromiseMap()) return false;
     HeapObjectRef prototype = receiver_map.prototype(broker());
     if (!prototype.equals(native_context().promise_prototype(broker()))) {
@@ -6974,7 +7182,7 @@ Reduction JSCallReducer::ReducePromisePrototypeFinally(Node* node) {
 
   MapInference inference(broker(), receiver, effect);
   if (!DoPromiseChecks(&inference)) return inference.NoChange();
-  ZoneVector<MapRef> const& receiver_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& receiver_maps = inference.GetMaps();
 
   if (!dependencies()->DependOnPromiseHookProtector()) {
     return inference.NoChange();
@@ -7051,12 +7259,8 @@ Reduction JSCallReducer::ReducePromisePrototypeFinally(Node* node) {
   // {receiver_maps}, so insert a MapGuard as a hint for the lowering
   // of the call to "then" below.
   {
-    ZoneHandleSet<Map> maps;
-    for (const MapRef& map : receiver_maps) {
-      maps.insert(map.object(), graph()->zone());
-    }
-    effect = graph()->NewNode(simplified()->MapGuard(maps), receiver, effect,
-                              control);
+    effect = graph()->NewNode(simplified()->MapGuard(receiver_maps), receiver,
+                              effect, control);
   }
 
   // Massage the {node} to call "then" instead by first removing all inputs
@@ -7137,9 +7341,9 @@ Reduction JSCallReducer::ReducePromisePrototypeThen(Node* node) {
   // information for further optimizations.
   MapRef promise_map =
       native_context().promise_function(broker()).initial_map(broker());
-  effect = graph()->NewNode(
-      simplified()->MapGuard(ZoneHandleSet<Map>(promise_map.object())), promise,
-      effect, control);
+  effect =
+      graph()->NewNode(simplified()->MapGuard(ZoneRefSet<Map>(promise_map)),
+                       promise, effect, control);
 
   ReplaceWithValue(node, promise, effect, control);
   return Replace(promise);
@@ -7175,10 +7379,8 @@ Reduction JSCallReducer::ReducePromiseResolveTrampoline(Node* node) {
 
 // ES #sec-typedarray-constructors
 Reduction JSCallReducer::ReduceTypedArrayConstructor(
-    Node* node, const SharedFunctionInfoRef& shared) {
+    Node* node, SharedFunctionInfoRef shared) {
   JSConstructNode n(node);
-  ConstructParameters const& p = n.Parameters();
-  int arity = p.arity_without_implicit_args();
   Node* target = n.target();
   Node* arg0 = n.ArgumentOrUndefined(0, jsgraph());
   Node* arg1 = n.ArgumentOrUndefined(1, jsgraph());
@@ -7191,23 +7393,19 @@ Reduction JSCallReducer::ReduceTypedArrayConstructor(
 
   // Insert a construct stub frame into the chain of frame states. This will
   // reconstruct the proper frame when deoptimizing within the constructor.
-  frame_state = CreateArtificialFrameState(
-      node, frame_state, arity, BytecodeOffset::ConstructStubInvoke(),
-      FrameStateType::kConstructStub, shared, context, common(), graph());
+  frame_state = CreateConstructInvokeStubFrameState(node, frame_state, shared,
+                                                    context, common(), graph());
 
   // This continuation just returns the newly created JSTypedArray. We
   // pass the_hole as the receiver, just like the builtin construct stub
   // does in this case.
-  Node* const parameters[] = {jsgraph()->TheHoleConstant()};
-  int const num_parameters = static_cast<int>(arraysize(parameters));
-  frame_state = CreateJavaScriptBuiltinContinuationFrameState(
-      jsgraph(), shared, Builtin::kGenericLazyDeoptContinuation, target,
-      context, parameters, num_parameters, frame_state,
-      ContinuationFrameStateMode::LAZY);
+  Node* const receiver = jsgraph()->TheHoleConstant();
+  Node* continuation_frame_state = CreateGenericLazyDeoptContinuationFrameState(
+      jsgraph(), shared, target, context, receiver, frame_state);
 
-  Node* result =
-      graph()->NewNode(javascript()->CreateTypedArray(), target, new_target,
-                       arg0, arg1, arg2, context, frame_state, effect, control);
+  Node* result = graph()->NewNode(javascript()->CreateTypedArray(), target,
+                                  new_target, arg0, arg1, arg2, context,
+                                  continuation_frame_state, effect, control);
   return Replace(result);
 }
 
@@ -7306,7 +7504,7 @@ Reduction JSCallReducer::ReduceArrayBufferViewByteLengthAccessor(
   std::set<ElementsKind> elements_kinds;
   bool maybe_rab_gsab = false;
   if (instance_type == JS_TYPED_ARRAY_TYPE) {
-    for (const auto& map : inference.GetMaps()) {
+    for (MapRef map : inference.GetMaps()) {
       ElementsKind kind = map.elements_kind();
       elements_kinds.insert(kind);
       if (IsRabGsabTypedArrayElementsKind(kind)) maybe_rab_gsab = true;
@@ -7363,7 +7561,7 @@ Reduction JSCallReducer::ReduceTypedArrayPrototypeLength(Node* node) {
 
   std::set<ElementsKind> elements_kinds;
   bool maybe_rab_gsab = false;
-  for (const auto& map : inference.GetMaps()) {
+  for (MapRef map : inference.GetMaps()) {
     ElementsKind kind = map.elements_kind();
     elements_kinds.insert(kind);
     if (IsRabGsabTypedArrayElementsKind(kind)) maybe_rab_gsab = true;
@@ -7629,7 +7827,7 @@ Reduction JSCallReducer::ReduceCollectionIteratorPrototypeNext(
   {
     MapInference inference(broker(), receiver, effect);
     if (!inference.HaveMaps()) return NoChange();
-    ZoneVector<MapRef> const& receiver_maps = inference.GetMaps();
+    ZoneRefSet<Map> const& receiver_maps = inference.GetMaps();
     receiver_instance_type = receiver_maps[0].instance_type();
     for (size_t i = 1; i < receiver_maps.size(); ++i) {
       if (receiver_maps[i].instance_type() != receiver_instance_type) {
@@ -7654,7 +7852,7 @@ Reduction JSCallReducer::ReduceCollectionIteratorPrototypeNext(
     Node* eloop = effect =
         graph()->NewNode(common()->EffectPhi(2), effect, effect, loop);
     Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop);
-    NodeProperties::MergeControlToEnd(graph(), common(), terminate);
+    MergeControlToEnd(graph(), common(), terminate);
 
     // Check if reached the final table of the {receiver}.
     Node* table = effect = graph()->NewNode(
@@ -7750,7 +7948,7 @@ Reduction JSCallReducer::ReduceCollectionIteratorPrototypeNext(
     Node* eloop =
         graph()->NewNode(common()->EffectPhi(2), effect, effect, loop);
     Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop);
-    NodeProperties::MergeControlToEnd(graph(), common(), terminate);
+    MergeControlToEnd(graph(), common(), terminate);
     Node* iloop = graph()->NewNode(
         common()->Phi(MachineRepresentation::kTagged, 2), index, index, loop);
 
@@ -7917,7 +8115,7 @@ Reduction JSCallReducer::ReduceArrayBufferViewAccessor(
 
   DCHECK_IMPLIES((builtin == Builtin::kTypedArrayPrototypeLength ||
                   builtin == Builtin::kTypedArrayPrototypeByteLength),
-                 base::none_of(inference.GetMaps(), [](const auto& map) {
+                 base::none_of(inference.GetMaps(), [](MapRef map) {
                    return IsRabGsabTypedArrayElementsKind(map.elements_kind());
                  }));
 
@@ -8277,12 +8475,12 @@ Reduction JSCallReducer::ReduceRegExpPrototypeTest(Node* node) {
 
   MapInference inference(broker(), regexp, effect);
   if (!inference.Is(regexp_initial_map)) return inference.NoChange();
-  ZoneVector<MapRef> const& regexp_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& regexp_maps = inference.GetMaps();
 
   ZoneVector<PropertyAccessInfo> access_infos(graph()->zone());
   AccessInfoFactory access_info_factory(broker(), graph()->zone());
 
-  for (const MapRef& map : regexp_maps) {
+  for (MapRef map : regexp_maps) {
     access_infos.push_back(broker()->GetPropertyAccessInfo(
         map, broker()->exec_string(), AccessMode::kLoad));
   }
@@ -8356,13 +8554,8 @@ Reduction JSCallReducer::ReduceNumberConstructor(Node* node) {
   // Create the artificial frame state in the middle of the Number constructor.
   SharedFunctionInfoRef shared_info =
       native_context().number_function(broker()).shared(broker());
-  Node* stack_parameters[] = {receiver};
-  int stack_parameter_count = arraysize(stack_parameters);
-  Node* continuation_frame_state =
-      CreateJavaScriptBuiltinContinuationFrameState(
-          jsgraph(), shared_info, Builtin::kGenericLazyDeoptContinuation,
-          target, context, stack_parameters, stack_parameter_count, frame_state,
-          ContinuationFrameStateMode::LAZY);
+  Node* continuation_frame_state = CreateGenericLazyDeoptContinuationFrameState(
+      jsgraph(), shared_info, target, context, receiver, frame_state);
 
   // Convert the {value} to a Number.
   NodeProperties::ReplaceValueInputs(node, value);
@@ -8389,13 +8582,8 @@ Reduction JSCallReducer::ReduceBigIntConstructor(Node* node) {
   // Create the artificial frame state in the middle of the BigInt constructor.
   SharedFunctionInfoRef shared_info =
       native_context().bigint_function(broker()).shared(broker());
-  Node* stack_parameters[] = {receiver};
-  int stack_parameter_count = arraysize(stack_parameters);
-  Node* continuation_frame_state =
-      CreateJavaScriptBuiltinContinuationFrameState(
-          jsgraph(), shared_info, Builtin::kGenericLazyDeoptContinuation,
-          target, context, stack_parameters, stack_parameter_count, frame_state,
-          ContinuationFrameStateMode::LAZY);
+  Node* continuation_frame_state = CreateGenericLazyDeoptContinuationFrameState(
+      jsgraph(), shared_info, target, context, receiver, frame_state);
 
   // Convert the {value} to a BigInt.
   NodeProperties::ReplaceValueInputs(node, value);
diff --git a/deps/v8/src/compiler/js-call-reducer.h b/deps/v8/src/compiler/js-call-reducer.h
index 58af159fd14827..30c6536fd889b9 100644
--- a/deps/v8/src/compiler/js-call-reducer.h
+++ b/deps/v8/src/compiler/js-call-reducer.h
@@ -81,10 +81,8 @@ class V8_EXPORT_PRIVATE JSCallReducer final : public AdvancedReducer {
 
  private:
   Reduction ReduceBooleanConstructor(Node* node);
-  Reduction ReduceCallApiFunction(Node* node,
-                                  const SharedFunctionInfoRef& shared);
-  Reduction ReduceCallWasmFunction(Node* node,
-                                   const SharedFunctionInfoRef& shared);
+  Reduction ReduceCallApiFunction(Node* node, SharedFunctionInfoRef shared);
+  Reduction ReduceCallWasmFunction(Node* node, SharedFunctionInfoRef shared);
   Reduction ReduceFunctionPrototypeApply(Node* node);
   Reduction ReduceFunctionPrototypeBind(Node* node);
   Reduction ReduceFunctionPrototypeCall(Node* node);
@@ -104,25 +102,23 @@ class V8_EXPORT_PRIVATE JSCallReducer final : public AdvancedReducer {
   Reduction ReduceReflectHas(Node* node);
 
   Reduction ReduceArrayConstructor(Node* node);
-  Reduction ReduceArrayEvery(Node* node, const SharedFunctionInfoRef& shared);
-  Reduction ReduceArrayFilter(Node* node, const SharedFunctionInfoRef& shared);
-  Reduction ReduceArrayFindIndex(Node* node,
-                                 const SharedFunctionInfoRef& shared);
-  Reduction ReduceArrayFind(Node* node, const SharedFunctionInfoRef& shared);
-  Reduction ReduceArrayForEach(Node* node, const SharedFunctionInfoRef& shared);
+  Reduction ReduceArrayEvery(Node* node, SharedFunctionInfoRef shared);
+  Reduction ReduceArrayFilter(Node* node, SharedFunctionInfoRef shared);
+  Reduction ReduceArrayFindIndex(Node* node, SharedFunctionInfoRef shared);
+  Reduction ReduceArrayFind(Node* node, SharedFunctionInfoRef shared);
+  Reduction ReduceArrayForEach(Node* node, SharedFunctionInfoRef shared);
   Reduction ReduceArrayIncludes(Node* node);
   Reduction ReduceArrayIndexOf(Node* node);
   Reduction ReduceArrayIsArray(Node* node);
-  Reduction ReduceArrayMap(Node* node, const SharedFunctionInfoRef& shared);
+  Reduction ReduceArrayMap(Node* node, SharedFunctionInfoRef shared);
   Reduction ReduceArrayPrototypeAt(Node* node);
   Reduction ReduceArrayPrototypePop(Node* node);
   Reduction ReduceArrayPrototypePush(Node* node);
   Reduction ReduceArrayPrototypeShift(Node* node);
   Reduction ReduceArrayPrototypeSlice(Node* node);
-  Reduction ReduceArrayReduce(Node* node, const SharedFunctionInfoRef& shared);
-  Reduction ReduceArrayReduceRight(Node* node,
-                                   const SharedFunctionInfoRef& shared);
-  Reduction ReduceArraySome(Node* node, const SharedFunctionInfoRef& shared);
+  Reduction ReduceArrayReduce(Node* node, SharedFunctionInfoRef shared);
+  Reduction ReduceArrayReduceRight(Node* node, SharedFunctionInfoRef shared);
+  Reduction ReduceArraySome(Node* node, SharedFunctionInfoRef shared);
 
   enum class ArrayIteratorKind { kArrayLike, kTypedArray };
   Reduction ReduceArrayIterator(Node* node, ArrayIteratorKind array_kind,
@@ -144,7 +140,7 @@ class V8_EXPORT_PRIVATE JSCallReducer final : public AdvancedReducer {
   Reduction ReduceJSConstructWithArrayLike(Node* node);
   Reduction ReduceJSConstructWithSpread(Node* node);
   Reduction ReduceJSCall(Node* node);
-  Reduction ReduceJSCall(Node* node, const SharedFunctionInfoRef& shared);
+  Reduction ReduceJSCall(Node* node, SharedFunctionInfoRef shared);
   Reduction ReduceJSCallWithArrayLike(Node* node);
   Reduction ReduceJSCallWithSpread(Node* node);
   Reduction ReduceRegExpPrototypeTest(Node* node);
@@ -160,6 +156,7 @@ class V8_EXPORT_PRIVATE JSCallReducer final : public AdvancedReducer {
       const Operator* string_access_operator, Node* node);
   Reduction ReduceStringPrototypeCharAt(Node* node);
   Reduction ReduceStringPrototypeStartsWith(Node* node);
+  Reduction ReduceStringPrototypeEndsWith(Node* node);
 
 #ifdef V8_INTL_SUPPORT
   Reduction ReduceStringPrototypeToLowerCaseIntl(Node* node);
@@ -183,7 +180,7 @@ class V8_EXPORT_PRIVATE JSCallReducer final : public AdvancedReducer {
   Reduction ReducePromiseResolveTrampoline(Node* node);
 
   Reduction ReduceTypedArrayConstructor(Node* node,
-                                        const SharedFunctionInfoRef& shared);
+                                        SharedFunctionInfoRef shared);
   Reduction ReduceTypedArrayPrototypeToStringTag(Node* node);
   Reduction ReduceArrayBufferViewByteLengthAccessor(Node* node,
                                                     InstanceType instance_type);
diff --git a/deps/v8/src/compiler/js-context-specialization.cc b/deps/v8/src/compiler/js-context-specialization.cc
index 4cae6927fb71f5..f31001d484c0c0 100644
--- a/deps/v8/src/compiler/js-context-specialization.cc
+++ b/deps/v8/src/compiler/js-context-specialization.cc
@@ -177,19 +177,14 @@ Reduction JSContextSpecialization::ReduceJSLoadContext(Node* node) {
                                  depth);
   }
 
-  if (!maybe_value->IsSmi()) {
-    // Even though the context slot is immutable, the context might have escaped
-    // before the function to which it belongs has initialized the slot.
-    // We must be conservative and check if the value in the slot is currently
-    // the hole or undefined. Only if it is neither of these, can we be sure
-    // that it won't change anymore.
-    OddballType oddball_type =
-        maybe_value->AsHeapObject().map(broker()).oddball_type(broker());
-    if (oddball_type == OddballType::kUndefined ||
-        oddball_type == OddballType::kHole) {
-      return SimplifyJSLoadContext(
-          node, jsgraph()->Constant(concrete, broker()), depth);
-    }
+  // Even though the context slot is immutable, the context might have escaped
+  // before the function to which it belongs has initialized the slot.
+  // We must be conservative and check if the value in the slot is currently
+  // the hole or undefined. Only if it is neither of these, can we be sure
+  // that it won't change anymore.
+  if (maybe_value->IsUndefined() || maybe_value->IsTheHole()) {
+    return SimplifyJSLoadContext(node, jsgraph()->Constant(concrete, broker()),
+                                 depth);
   }
 
   // Success. The context load can be replaced with the constant.
@@ -286,7 +281,7 @@ Reduction JSContextSpecialization::ReduceJSGetImportMeta(Node* node) {
       module->AsSourceTextModule().import_meta(broker());
   if (!import_meta.has_value()) return NoChange();
   if (!import_meta->IsJSObject()) {
-    DCHECK(import_meta->IsTheHole(broker()));
+    DCHECK(import_meta->IsTheHole());
     // The import.meta object has not yet been created. Let JSGenericLowering
     // replace the operator with a runtime call.
     return NoChange();
diff --git a/deps/v8/src/compiler/js-create-lowering.cc b/deps/v8/src/compiler/js-create-lowering.cc
index 8bb11635fd77ab..a0b0538d8ce877 100644
--- a/deps/v8/src/compiler/js-create-lowering.cc
+++ b/deps/v8/src/compiler/js-create-lowering.cc
@@ -9,6 +9,7 @@
 #include "src/compiler/common-operator.h"
 #include "src/compiler/compilation-dependencies.h"
 #include "src/compiler/js-graph.h"
+#include "src/compiler/js-heap-broker-inl.h"
 #include "src/compiler/js-operator.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
@@ -814,7 +815,7 @@ Reduction JSCreateLowering::ReduceJSCreateAsyncFunctionObject(Node* node) {
 namespace {
 
 MapRef MapForCollectionIterationKind(JSHeapBroker* broker,
-                                     const NativeContextRef& native_context,
+                                     NativeContextRef native_context,
                                      CollectionKind collection_kind,
                                      IterationKind iteration_kind) {
   switch (collection_kind) {
@@ -1490,7 +1491,7 @@ Node* JSCreateLowering::TryAllocateRestArguments(Node* effect, Node* control,
 // given {context}. Serves as backing store for JSCreateArguments nodes.
 Node* JSCreateLowering::TryAllocateAliasedArguments(
     Node* effect, Node* control, FrameState frame_state, Node* context,
-    const SharedFunctionInfoRef& shared, bool* has_aliased_arguments) {
+    SharedFunctionInfoRef shared, bool* has_aliased_arguments) {
   FrameStateInfo state_info = frame_state.frame_state_info();
   int argument_count = state_info.parameter_count() - 1;  // Minus receiver.
   if (argument_count == 0) return jsgraph()->EmptyFixedArrayConstant();
@@ -1561,7 +1562,7 @@ Node* JSCreateLowering::TryAllocateAliasedArguments(
 // Serves as backing store for JSCreateArguments nodes.
 Node* JSCreateLowering::TryAllocateAliasedArguments(
     Node* effect, Node* control, Node* context, Node* arguments_length,
-    const SharedFunctionInfoRef& shared, bool* has_aliased_arguments) {
+    SharedFunctionInfoRef shared, bool* has_aliased_arguments) {
   // If there is no aliasing, the arguments object elements are not
   // special in any way, we can just return an unmapped backing store.
   int parameter_count =
@@ -1728,11 +1729,11 @@ base::Optional<Node*> JSCreateLowering::TryAllocateFastLiteral(
     NameRef property_name = boilerplate_map.GetPropertyKey(broker(), i);
     FieldIndex index =
         FieldIndex::ForDetails(*boilerplate_map.object(), property_details);
-    ConstFieldInfo const_field_info(boilerplate_map.object());
+    ConstFieldInfo const_field_info(boilerplate_map);
     FieldAccess access = {kTaggedBase,
                           index.offset(),
                           property_name.object(),
-                          MaybeHandle<Map>(),
+                          OptionalMapRef(),
                           Type::Any(),
                           MachineType::AnyTagged(),
                           kFullWriteBarrier,
diff --git a/deps/v8/src/compiler/js-create-lowering.h b/deps/v8/src/compiler/js-create-lowering.h
index db7a5281fe9962..60f58f82fc4188 100644
--- a/deps/v8/src/compiler/js-create-lowering.h
+++ b/deps/v8/src/compiler/js-create-lowering.h
@@ -90,11 +90,11 @@ class V8_EXPORT_PRIVATE JSCreateLowering final
                                  FrameState frame_state, int start_index);
   Node* TryAllocateAliasedArguments(Node* effect, Node* control,
                                     FrameState frame_state, Node* context,
-                                    const SharedFunctionInfoRef& shared,
+                                    SharedFunctionInfoRef shared,
                                     bool* has_aliased_arguments);
   Node* TryAllocateAliasedArguments(Node* effect, Node* control, Node* context,
                                     Node* arguments_length,
-                                    const SharedFunctionInfoRef& shared,
+                                    SharedFunctionInfoRef shared,
                                     bool* has_aliased_arguments);
   base::Optional<Node*> TryAllocateFastLiteral(Node* effect, Node* control,
                                                JSObjectRef boilerplate,
diff --git a/deps/v8/src/compiler/js-generic-lowering.cc b/deps/v8/src/compiler/js-generic-lowering.cc
index 794884520c4397..dd94393d8eb1dd 100644
--- a/deps/v8/src/compiler/js-generic-lowering.cc
+++ b/deps/v8/src/compiler/js-generic-lowering.cc
@@ -1140,16 +1140,28 @@ StackCheckKind StackCheckKindOfJSStackCheck(const Operator* op) {
 void JSGenericLowering::LowerJSStackCheck(Node* node) {
   Node* effect = NodeProperties::GetEffectInput(node);
   Node* control = NodeProperties::GetControlInput(node);
-
-  Node* limit = effect =
-      graph()->NewNode(machine()->Load(MachineType::Pointer()),
-                       jsgraph()->ExternalConstant(
-                           ExternalReference::address_of_jslimit(isolate())),
-                       jsgraph()->IntPtrConstant(0), effect, control);
-
   StackCheckKind stack_check_kind = StackCheckKindOfJSStackCheck(node->op());
-  Node* check = effect = graph()->NewNode(
-      machine()->StackPointerGreaterThan(stack_check_kind), limit, effect);
+
+  Node* check;
+  if (stack_check_kind == StackCheckKind::kJSIterationBody) {
+    check = effect = graph()->NewNode(
+        machine()->Load(MachineType::Uint8()),
+        jsgraph()->ExternalConstant(
+            ExternalReference::address_of_no_heap_write_interrupt_request(
+                isolate())),
+        jsgraph()->IntPtrConstant(0), effect, control);
+    check = graph()->NewNode(machine()->Word32Equal(), check,
+                             jsgraph()->Int32Constant(0));
+  } else {
+    Node* limit = effect =
+        graph()->NewNode(machine()->Load(MachineType::Pointer()),
+                         jsgraph()->ExternalConstant(
+                             ExternalReference::address_of_jslimit(isolate())),
+                         jsgraph()->IntPtrConstant(0), effect, control);
+
+    check = effect = graph()->NewNode(
+        machine()->StackPointerGreaterThan(stack_check_kind), limit, effect);
+  }
   Node* branch =
       graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
 
@@ -1193,6 +1205,8 @@ void JSGenericLowering::LowerJSStackCheck(Node* node) {
     node->InsertInput(zone(), 0,
                       graph()->NewNode(machine()->LoadStackCheckOffset()));
     ReplaceWithRuntimeCall(node, Runtime::kStackGuardWithGap);
+  } else if (stack_check_kind == StackCheckKind::kJSIterationBody) {
+    ReplaceWithRuntimeCall(node, Runtime::kHandleNoHeapWritesInterrupts);
   } else {
     ReplaceWithRuntimeCall(node, Runtime::kStackGuard);
   }
diff --git a/deps/v8/src/compiler/js-graph.cc b/deps/v8/src/compiler/js-graph.cc
index 33ab2f4ddf2b5e..d108b5dd594340 100644
--- a/deps/v8/src/compiler/js-graph.cc
+++ b/deps/v8/src/compiler/js-graph.cc
@@ -13,8 +13,10 @@ namespace compiler {
 
 #define GET_CACHED_FIELD(ptr, expr) (*(ptr)) ? *(ptr) : (*(ptr) = (expr))
 
-#define DEFINE_GETTER(name, expr) \
-  Node* JSGraph::name() { return GET_CACHED_FIELD(&name##_, expr); }
+#define DEFINE_GETTER(name, Type, expr)                                  \
+  TNode<Type> JSGraph::name() {                                          \
+    return TNode<Type>::UncheckedCast(GET_CACHED_FIELD(&name##_, expr)); \
+  }
 
 Node* JSGraph::CEntryStubConstant(int result_size, ArgvMode argv_mode,
                                   bool builtin_exit_frame) {
@@ -44,28 +46,35 @@ Node* JSGraph::CEntryStubConstant(int result_size, ArgvMode argv_mode,
                                           builtin_exit_frame));
 }
 
-Node* JSGraph::Constant(const ObjectRef& ref, JSHeapBroker* broker) {
+Node* JSGraph::Constant(ObjectRef ref, JSHeapBroker* broker) {
   if (ref.IsSmi()) return Constant(ref.AsSmi());
   if (ref.IsHeapNumber()) {
     return Constant(ref.AsHeapNumber().value());
   }
+
+  switch (ref.AsHeapObject().GetHeapObjectType(broker).hole_type()) {
+    case HoleType::kNone:
+      break;
+    case HoleType::kGeneric:
+      return TheHoleConstant();
+    case HoleType::kPropertyCell:
+      return PropertyCellHoleConstant();
+  }
+
   OddballType oddball_type =
       ref.AsHeapObject().GetHeapObjectType(broker).oddball_type();
   ReadOnlyRoots roots(isolate());
   if (oddball_type == OddballType::kUndefined) {
-    DCHECK(ref.object()->IsUndefined(roots));
+    DCHECK(IsUndefined(*ref.object(), roots));
     return UndefinedConstant();
   } else if (oddball_type == OddballType::kNull) {
-    DCHECK(ref.object()->IsNull(roots));
+    DCHECK(IsNull(*ref.object(), roots));
     return NullConstant();
-  } else if (oddball_type == OddballType::kHole) {
-    DCHECK(ref.object()->IsTheHole(roots));
-    return TheHoleConstant();
   } else if (oddball_type == OddballType::kBoolean) {
-    if (ref.object()->IsTrue(roots)) {
+    if (IsTrue(*ref.object(), roots)) {
       return TrueConstant();
     } else {
-      DCHECK(ref.object()->IsFalse(roots));
+      DCHECK(IsFalse(*ref.object(), roots));
       return FalseConstant();
     }
   } else {
@@ -99,7 +108,7 @@ Node* JSGraph::HeapConstant(Handle<HeapObject> value) {
 
 void JSGraph::GetCachedNodes(NodeVector* nodes) {
   cache_.GetCachedNodes(nodes);
-#define DO_CACHED_FIELD(name) \
+#define DO_CACHED_FIELD(name, ...) \
   if (name##_) nodes->push_back(name##_);
 
   CACHED_GLOBAL_LIST(DO_CACHED_FIELD)
@@ -107,87 +116,88 @@ void JSGraph::GetCachedNodes(NodeVector* nodes) {
 #undef DO_CACHED_FIELD
 }
 
-DEFINE_GETTER(AllocateInYoungGenerationStubConstant,
+DEFINE_GETTER(AllocateInYoungGenerationStubConstant, Code,
               HeapConstant(BUILTIN_CODE(isolate(), AllocateInYoungGeneration)))
 
-DEFINE_GETTER(AllocateRegularInYoungGenerationStubConstant,
-              HeapConstant(BUILTIN_CODE(isolate(),
-                                        AllocateRegularInYoungGeneration)))
-
-DEFINE_GETTER(AllocateInOldGenerationStubConstant,
+DEFINE_GETTER(AllocateInOldGenerationStubConstant, Code,
               HeapConstant(BUILTIN_CODE(isolate(), AllocateInOldGeneration)))
 
-DEFINE_GETTER(AllocateRegularInOldGenerationStubConstant,
-              HeapConstant(BUILTIN_CODE(isolate(),
-                                        AllocateRegularInOldGeneration)))
-
-DEFINE_GETTER(ArrayConstructorStubConstant,
+DEFINE_GETTER(ArrayConstructorStubConstant, Code,
               HeapConstant(BUILTIN_CODE(isolate(), ArrayConstructorImpl)))
 
-DEFINE_GETTER(BigIntMapConstant, HeapConstant(factory()->bigint_map()))
+DEFINE_GETTER(BigIntMapConstant, Map, HeapConstant(factory()->bigint_map()))
 
-DEFINE_GETTER(BooleanMapConstant, HeapConstant(factory()->boolean_map()))
+DEFINE_GETTER(BooleanMapConstant, Map, HeapConstant(factory()->boolean_map()))
 
-DEFINE_GETTER(ToNumberBuiltinConstant,
+DEFINE_GETTER(ToNumberBuiltinConstant, Code,
               HeapConstant(BUILTIN_CODE(isolate(), ToNumber)))
 
-DEFINE_GETTER(PlainPrimitiveToNumberBuiltinConstant,
+DEFINE_GETTER(PlainPrimitiveToNumberBuiltinConstant, Code,
               HeapConstant(BUILTIN_CODE(isolate(), PlainPrimitiveToNumber)))
 
-DEFINE_GETTER(EmptyFixedArrayConstant,
+DEFINE_GETTER(EmptyFixedArrayConstant, FixedArray,
               HeapConstant(factory()->empty_fixed_array()))
 
-DEFINE_GETTER(EmptyStringConstant, HeapConstant(factory()->empty_string()))
+DEFINE_GETTER(EmptyStringConstant, String,
+              HeapConstant(factory()->empty_string()))
 
-DEFINE_GETTER(FixedArrayMapConstant, HeapConstant(factory()->fixed_array_map()))
+DEFINE_GETTER(FixedArrayMapConstant, Map,
+              HeapConstant(factory()->fixed_array_map()))
 
-DEFINE_GETTER(PropertyArrayMapConstant,
+DEFINE_GETTER(PropertyArrayMapConstant, Map,
               HeapConstant(factory()->property_array_map()))
 
-DEFINE_GETTER(FixedDoubleArrayMapConstant,
+DEFINE_GETTER(FixedDoubleArrayMapConstant, Map,
               HeapConstant(factory()->fixed_double_array_map()))
 
-DEFINE_GETTER(WeakFixedArrayMapConstant,
+DEFINE_GETTER(WeakFixedArrayMapConstant, Map,
               HeapConstant(factory()->weak_fixed_array_map()))
 
-DEFINE_GETTER(HeapNumberMapConstant, HeapConstant(factory()->heap_number_map()))
+DEFINE_GETTER(HeapNumberMapConstant, Map,
+              HeapConstant(factory()->heap_number_map()))
+
+DEFINE_GETTER(OptimizedOutConstant, Oddball,
+              HeapConstant(factory()->optimized_out()))
 
-DEFINE_GETTER(OptimizedOutConstant, HeapConstant(factory()->optimized_out()))
+DEFINE_GETTER(StaleRegisterConstant, Oddball,
+              HeapConstant(factory()->stale_register()))
 
-DEFINE_GETTER(StaleRegisterConstant, HeapConstant(factory()->stale_register()))
+DEFINE_GETTER(UndefinedConstant, Undefined,
+              HeapConstant(factory()->undefined_value()))
 
-DEFINE_GETTER(UndefinedConstant, HeapConstant(factory()->undefined_value()))
+DEFINE_GETTER(TheHoleConstant, Hole, HeapConstant(factory()->the_hole_value()))
 
-DEFINE_GETTER(TheHoleConstant, HeapConstant(factory()->the_hole_value()))
+DEFINE_GETTER(PropertyCellHoleConstant, Hole,
+              HeapConstant(factory()->property_cell_hole_value()))
 
-DEFINE_GETTER(TrueConstant, HeapConstant(factory()->true_value()))
+DEFINE_GETTER(TrueConstant, True, HeapConstant(factory()->true_value()))
 
-DEFINE_GETTER(FalseConstant, HeapConstant(factory()->false_value()))
+DEFINE_GETTER(FalseConstant, False, HeapConstant(factory()->false_value()))
 
-DEFINE_GETTER(NullConstant, HeapConstant(factory()->null_value()))
+DEFINE_GETTER(NullConstant, Null, HeapConstant(factory()->null_value()))
 
-DEFINE_GETTER(ZeroConstant, NumberConstant(0.0))
+DEFINE_GETTER(ZeroConstant, Number, NumberConstant(0.0))
 
-DEFINE_GETTER(MinusZeroConstant, NumberConstant(-0.0))
+DEFINE_GETTER(MinusZeroConstant, Number, NumberConstant(-0.0))
 
-DEFINE_GETTER(OneConstant, NumberConstant(1.0))
+DEFINE_GETTER(OneConstant, Number, NumberConstant(1.0))
 
-DEFINE_GETTER(MinusOneConstant, NumberConstant(-1.0))
+DEFINE_GETTER(MinusOneConstant, Number, NumberConstant(-1.0))
 
-DEFINE_GETTER(NaNConstant,
+DEFINE_GETTER(NaNConstant, Number,
               NumberConstant(std::numeric_limits<double>::quiet_NaN()))
 
-DEFINE_GETTER(EmptyStateValues,
+DEFINE_GETTER(EmptyStateValues, UntaggedT,
               graph()->NewNode(common()->StateValues(0,
                                                      SparseInputMask::Dense())))
 
 DEFINE_GETTER(
-    SingleDeadTypedStateValues,
+    SingleDeadTypedStateValues, UntaggedT,
     graph()->NewNode(common()->TypedStateValues(
         graph()->zone()->New<ZoneVector<MachineType>>(0, graph()->zone()),
         SparseInputMask(SparseInputMask::kEndMarker << 1))))
 
-DEFINE_GETTER(ExternalObjectMapConstant,
+DEFINE_GETTER(ExternalObjectMapConstant, Map,
               HeapConstant(factory()->external_map()))
 
 #undef DEFINE_GETTER
diff --git a/deps/v8/src/compiler/js-graph.h b/deps/v8/src/compiler/js-graph.h
index 471ad294cee5b7..70fad3210e906c 100644
--- a/deps/v8/src/compiler/js-graph.h
+++ b/deps/v8/src/compiler/js-graph.h
@@ -11,6 +11,7 @@
 #include "src/compiler/js-operator.h"
 #include "src/compiler/machine-graph.h"
 #include "src/execution/isolate.h"
+#include "src/objects/oddball.h"
 
 namespace v8 {
 namespace internal {
@@ -30,8 +31,7 @@ class V8_EXPORT_PRIVATE JSGraph : public MachineGraph {
       : MachineGraph(graph, common, machine),
         isolate_(isolate),
         javascript_(javascript),
-        simplified_(simplified) {
-  }
+        simplified_(simplified) {}
 
   JSGraph(const JSGraph&) = delete;
   JSGraph& operator=(const JSGraph&) = delete;
@@ -42,10 +42,10 @@ class V8_EXPORT_PRIVATE JSGraph : public MachineGraph {
                            bool builtin_exit_frame = false);
 
   // Used for padding frames. (alias: the hole)
-  Node* PaddingConstant() { return TheHoleConstant(); }
+  TNode<Hole> PaddingConstant() { return TheHoleConstant(); }
 
   // Used for stubs and runtime functions with no context. (alias: SMI zero)
-  Node* NoContextConstant() { return ZeroConstant(); }
+  TNode<Number> NoContextConstant() { return ZeroConstant(); }
 
   // Creates a HeapConstant node, possibly canonicalized.
   Node* HeapConstant(Handle<HeapObject> value);
@@ -53,14 +53,15 @@ class V8_EXPORT_PRIVATE JSGraph : public MachineGraph {
   // Creates a Constant node of the appropriate type for the given object.
   // Inspect the (serialized) object and determine whether one of the
   // canonicalized globals or a number constant should be returned.
-  Node* Constant(const ObjectRef& value, JSHeapBroker* broker);
+  Node* Constant(ObjectRef value, JSHeapBroker* broker);
 
   // Creates a NumberConstant node, usually canonicalized.
   Node* Constant(double value);
 
   // Creates a HeapConstant node for either true or false.
-  Node* BooleanConstant(bool is_true) {
-    return is_true ? TrueConstant() : FalseConstant();
+  TNode<Boolean> BooleanConstant(bool is_true) {
+    return is_true ? TNode<Boolean>(TrueConstant())
+                   : TNode<Boolean>(FalseConstant());
   }
 
   Node* SmiConstant(int32_t immediate) {
@@ -77,41 +78,40 @@ class V8_EXPORT_PRIVATE JSGraph : public MachineGraph {
   void GetCachedNodes(NodeVector* nodes);
 
 // Cached global nodes.
-#define CACHED_GLOBAL_LIST(V)                     \
-  V(AllocateInYoungGenerationStubConstant)        \
-  V(AllocateRegularInYoungGenerationStubConstant) \
-  V(AllocateInOldGenerationStubConstant)          \
-  V(AllocateRegularInOldGenerationStubConstant)   \
-  V(ArrayConstructorStubConstant)                 \
-  V(BigIntMapConstant)                            \
-  V(BooleanMapConstant)                           \
-  V(ToNumberBuiltinConstant)                      \
-  V(PlainPrimitiveToNumberBuiltinConstant)        \
-  V(EmptyFixedArrayConstant)                      \
-  V(EmptyStringConstant)                          \
-  V(FixedArrayMapConstant)                        \
-  V(PropertyArrayMapConstant)                     \
-  V(FixedDoubleArrayMapConstant)                  \
-  V(WeakFixedArrayMapConstant)                    \
-  V(HeapNumberMapConstant)                        \
-  V(OptimizedOutConstant)                         \
-  V(StaleRegisterConstant)                        \
-  V(UndefinedConstant)                            \
-  V(TheHoleConstant)                              \
-  V(TrueConstant)                                 \
-  V(FalseConstant)                                \
-  V(NullConstant)                                 \
-  V(ZeroConstant)                                 \
-  V(MinusZeroConstant)                            \
-  V(OneConstant)                                  \
-  V(MinusOneConstant)                             \
-  V(NaNConstant)                                  \
-  V(EmptyStateValues)                             \
-  V(SingleDeadTypedStateValues)                   \
-  V(ExternalObjectMapConstant)
+#define CACHED_GLOBAL_LIST(V)                    \
+  V(AllocateInYoungGenerationStubConstant, Code) \
+  V(AllocateInOldGenerationStubConstant, Code)   \
+  V(ArrayConstructorStubConstant, Code)          \
+  V(BigIntMapConstant, Map)                      \
+  V(BooleanMapConstant, Map)                     \
+  V(ToNumberBuiltinConstant, Code)               \
+  V(PlainPrimitiveToNumberBuiltinConstant, Code) \
+  V(EmptyFixedArrayConstant, FixedArray)         \
+  V(EmptyStringConstant, String)                 \
+  V(FixedArrayMapConstant, Map)                  \
+  V(PropertyArrayMapConstant, Map)               \
+  V(FixedDoubleArrayMapConstant, Map)            \
+  V(WeakFixedArrayMapConstant, Map)              \
+  V(HeapNumberMapConstant, Map)                  \
+  V(OptimizedOutConstant, Oddball)               \
+  V(StaleRegisterConstant, Oddball)              \
+  V(UndefinedConstant, Undefined)                \
+  V(TheHoleConstant, Hole)                       \
+  V(PropertyCellHoleConstant, Hole)              \
+  V(TrueConstant, True)                          \
+  V(FalseConstant, False)                        \
+  V(NullConstant, Null)                          \
+  V(ZeroConstant, Number)                        \
+  V(MinusZeroConstant, Number)                   \
+  V(OneConstant, Number)                         \
+  V(MinusOneConstant, Number)                    \
+  V(NaNConstant, Number)                         \
+  V(EmptyStateValues, UntaggedT)                 \
+  V(SingleDeadTypedStateValues, UntaggedT)       \
+  V(ExternalObjectMapConstant, Map)
 
 // Cached global node accessor methods.
-#define DECLARE_GETTER(name) Node* name();
+#define DECLARE_GETTER(name, Type) TNode<Type> name();
   CACHED_GLOBAL_LIST(DECLARE_GETTER)
 #undef DECLARE_GETTER
 
@@ -127,7 +127,7 @@ class V8_EXPORT_PRIVATE JSGraph : public MachineGraph {
   V(CEntryStub1WithBuiltinExitFrameConstant)
 
 // Canonicalized global node fields.
-#define DECLARE_FIELD(name) Node* name##_ = nullptr;
+#define DECLARE_FIELD(name, ...) Node* name##_ = nullptr;
   CACHED_GLOBAL_LIST(DECLARE_FIELD)
   CACHED_CENTRY_LIST(DECLARE_FIELD)
 #undef DECLARE_FIELD
diff --git a/deps/v8/src/compiler/js-heap-broker-inl.h b/deps/v8/src/compiler/js-heap-broker-inl.h
new file mode 100644
index 00000000000000..f0e392e3df6cb1
--- /dev/null
+++ b/deps/v8/src/compiler/js-heap-broker-inl.h
@@ -0,0 +1,38 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_JS_HEAP_BROKER_INL_H_
+#define V8_COMPILER_JS_HEAP_BROKER_INL_H_
+
+#include "src/compiler/js-heap-broker.h"
+#include "src/heap/parked-scope-inl.h"
+
+namespace v8::internal::compiler {
+
+V8_INLINE JSHeapBroker::RecursiveSharedMutexGuardIfNeeded::
+    RecursiveSharedMutexGuardIfNeeded(LocalIsolate* local_isolate,
+                                      base::SharedMutex* mutex,
+                                      int* mutex_depth_address)
+    : mutex_depth_address_(mutex_depth_address),
+      initial_mutex_depth_(*mutex_depth_address_),
+      shared_mutex_guard_(local_isolate, mutex, initial_mutex_depth_ == 0) {
+  (*mutex_depth_address_)++;
+}
+
+V8_INLINE JSHeapBroker::MapUpdaterGuardIfNeeded::MapUpdaterGuardIfNeeded(
+    JSHeapBroker* broker)
+    : RecursiveSharedMutexGuardIfNeeded(broker->local_isolate_or_isolate(),
+                                        broker->isolate()->map_updater_access(),
+                                        &broker->map_updater_mutex_depth_) {}
+
+V8_INLINE JSHeapBroker::BoilerplateMigrationGuardIfNeeded::
+    BoilerplateMigrationGuardIfNeeded(JSHeapBroker* broker)
+    : RecursiveSharedMutexGuardIfNeeded(
+          broker->local_isolate_or_isolate(),
+          broker->isolate()->boilerplate_migration_access(),
+          &broker->boilerplate_migration_mutex_depth_) {}
+
+}  // namespace v8::internal::compiler
+
+#endif  // V8_COMPILER_JS_HEAP_BROKER_INL_H_
diff --git a/deps/v8/src/compiler/js-heap-broker.cc b/deps/v8/src/compiler/js-heap-broker.cc
index 18f1d5a1c18877..5106bb0b51f014 100644
--- a/deps/v8/src/compiler/js-heap-broker.cc
+++ b/deps/v8/src/compiler/js-heap-broker.cc
@@ -9,6 +9,7 @@
 #endif
 
 #include "src/codegen/optimized-compilation-info.h"
+#include "src/compiler/js-heap-broker-inl.h"
 #include "src/handles/handles-inl.h"
 #include "src/heap/heap-inl.h"
 #include "src/objects/allocation-site-inl.h"
@@ -54,27 +55,6 @@ JSHeapBroker::JSHeapBroker(Isolate* isolate, Zone* broker_zone,
 
 JSHeapBroker::~JSHeapBroker() { DCHECK_NULL(local_isolate_); }
 
-void JSHeapBroker::SetPersistentAndCopyCanonicalHandlesForTesting(
-    std::unique_ptr<PersistentHandles> persistent_handles,
-    std::unique_ptr<CanonicalHandlesMap> canonical_handles) {
-  set_persistent_handles(std::move(persistent_handles));
-  CopyCanonicalHandlesForTesting(std::move(canonical_handles));
-}
-
-void JSHeapBroker::CopyCanonicalHandlesForTesting(
-    std::unique_ptr<CanonicalHandlesMap> canonical_handles) {
-  DCHECK_NULL(canonical_handles_);
-  canonical_handles_ = std::make_unique<CanonicalHandlesMap>(
-      isolate_->heap(), ZoneAllocationPolicy(zone()));
-
-  CanonicalHandlesMap::IteratableScope it_scope(canonical_handles.get());
-  for (auto it = it_scope.begin(); it != it_scope.end(); ++it) {
-    Address* entry = *it.entry();
-    Object key = it.key();
-    canonical_handles_->Insert(key, entry);
-  }
-}
-
 std::string JSHeapBroker::Trace() const {
   std::ostringstream oss;
   oss << "[" << this << "] ";
@@ -102,7 +82,6 @@ JSHeapBroker* JSHeapBroker::Current() {
 
 void JSHeapBroker::AttachLocalIsolate(OptimizedCompilationInfo* info,
                                       LocalIsolate* local_isolate) {
-  set_canonical_handles(info->DetachCanonicalHandles());
   DCHECK_NULL(local_isolate_);
   local_isolate_ = local_isolate;
   DCHECK_NOT_NULL(local_isolate_);
@@ -116,7 +95,6 @@ void JSHeapBroker::DetachLocalIsolate(OptimizedCompilationInfo* info) {
   std::unique_ptr<PersistentHandles> ph =
       local_isolate_->heap()->DetachPersistentHandles();
   local_isolate_ = nullptr;
-  info->set_canonical_handles(DetachCanonicalHandles());
   info->set_persistent_handles(std::move(ph));
 }
 
@@ -134,9 +112,7 @@ void JSHeapBroker::Retire() {
 
 void JSHeapBroker::SetTargetNativeContextRef(
     Handle<NativeContext> native_context) {
-  DCHECK((mode() == kDisabled && !target_native_context_.has_value()) ||
-         (mode() == kSerializing &&
-          target_native_context_->object().is_identical_to(native_context)));
+  DCHECK(!target_native_context_.has_value());
   target_native_context_ = MakeRef(this, *native_context);
 }
 
@@ -145,15 +121,18 @@ void JSHeapBroker::CollectArrayAndObjectPrototypes() {
   CHECK_EQ(mode(), kSerializing);
   CHECK(array_and_object_prototypes_.empty());
 
-  Object maybe_context = isolate()->heap()->native_contexts_list();
-  while (!maybe_context.IsUndefined(isolate())) {
-    Context context = Context::cast(maybe_context);
-    Object array_prot = context.get(Context::INITIAL_ARRAY_PROTOTYPE_INDEX);
-    Object object_prot = context.get(Context::INITIAL_OBJECT_PROTOTYPE_INDEX);
-    array_and_object_prototypes_.emplace(JSObject::cast(array_prot), isolate());
-    array_and_object_prototypes_.emplace(JSObject::cast(object_prot),
-                                         isolate());
-    maybe_context = context.next_context_link();
+  Tagged<Object> maybe_context = isolate()->heap()->native_contexts_list();
+  while (!IsUndefined(maybe_context, isolate())) {
+    Tagged<Context> context = Context::cast(maybe_context);
+    Tagged<Object> array_prot =
+        context->get(Context::INITIAL_ARRAY_PROTOTYPE_INDEX);
+    Tagged<Object> object_prot =
+        context->get(Context::INITIAL_OBJECT_PROTOTYPE_INDEX);
+    array_and_object_prototypes_.emplace(
+        CanonicalPersistentHandle(JSObject::cast(array_prot)));
+    array_and_object_prototypes_.emplace(
+        CanonicalPersistentHandle(JSObject::cast(object_prot)));
+    maybe_context = context->next_context_link();
   }
 
   CHECK(!array_and_object_prototypes_.empty());
@@ -173,7 +152,7 @@ StringRef JSHeapBroker::GetTypedArrayStringTag(ElementsKind kind) {
   }
 }
 
-bool JSHeapBroker::IsArrayOrObjectPrototype(const JSObjectRef& object) const {
+bool JSHeapBroker::IsArrayOrObjectPrototype(JSObjectRef object) const {
   return IsArrayOrObjectPrototype(object.object());
 }
 
@@ -189,7 +168,7 @@ bool JSHeapBroker::IsArrayOrObjectPrototype(Handle<JSObject> object) const {
          array_and_object_prototypes_.end();
 }
 
-ObjectData* JSHeapBroker::TryGetOrCreateData(Object object,
+ObjectData* JSHeapBroker::TryGetOrCreateData(Tagged<Object> object,
                                              GetOrCreateDataFlags flags) {
   return TryGetOrCreateData(CanonicalPersistentHandle(object), flags);
 }
@@ -201,7 +180,7 @@ ObjectData* JSHeapBroker::GetOrCreateData(Handle<Object> object,
   return return_value;
 }
 
-ObjectData* JSHeapBroker::GetOrCreateData(Object object,
+ObjectData* JSHeapBroker::GetOrCreateData(Tagged<Object> object,
                                           GetOrCreateDataFlags flags) {
   return GetOrCreateData(CanonicalPersistentHandle(object), flags);
 }
@@ -218,12 +197,12 @@ bool JSHeapBroker::ObjectMayBeUninitialized(Handle<Object> object) const {
   return ObjectMayBeUninitialized(*object);
 }
 
-bool JSHeapBroker::ObjectMayBeUninitialized(Object object) const {
-  if (!object.IsHeapObject()) return false;
+bool JSHeapBroker::ObjectMayBeUninitialized(Tagged<Object> object) const {
+  if (!IsHeapObject(object)) return false;
   return ObjectMayBeUninitialized(HeapObject::cast(object));
 }
 
-bool JSHeapBroker::ObjectMayBeUninitialized(HeapObject object) const {
+bool JSHeapBroker::ObjectMayBeUninitialized(Tagged<HeapObject> object) const {
   return !IsMainThread() && isolate()->heap()->IsPendingAllocation(object);
 }
 
@@ -442,7 +421,7 @@ MegaDOMPropertyAccessFeedback::MegaDOMPropertyAccessFeedback(
   DCHECK(IsLoadICKind(slot_kind));
 }
 
-NamedAccessFeedback::NamedAccessFeedback(NameRef const& name,
+NamedAccessFeedback::NamedAccessFeedback(NameRef name,
                                          ZoneVector<MapRef> const& maps,
                                          FeedbackSlotKind slot_kind)
     : ProcessedFeedback(kNamedAccess, slot_kind), name_(name), maps_(maps) {
@@ -580,12 +559,12 @@ ProcessedFeedback const& JSHeapBroker::ReadFeedbackForGlobalAccess(
   }
 
   Handle<Object> feedback_value =
-      CanonicalPersistentHandle(nexus.GetFeedback()->GetHeapObjectOrSmi());
+      CanonicalPersistentHandle(nexus.GetFeedback().GetHeapObjectOrSmi());
 
-  if (feedback_value->IsSmi()) {
+  if (IsSmi(*feedback_value)) {
     // The wanted name belongs to a script-scope variable and the feedback
     // tells us where to find its value.
-    int const number = feedback_value->Number();
+    int const number = Object::Number(*feedback_value);
     int const script_context_index =
         FeedbackNexus::ContextIndexBits::decode(number);
     int const context_slot_index = FeedbackNexus::SlotIndexBits::decode(number);
@@ -596,14 +575,14 @@ ProcessedFeedback const& JSHeapBroker::ReadFeedbackForGlobalAccess(
                   ->get_context(script_context_index, kAcquireLoad));
 
     OptionalObjectRef contents = context.get(broker, context_slot_index);
-    if (contents.has_value()) CHECK(!contents->IsTheHole(broker));
+    if (contents.has_value()) CHECK(!contents->IsTheHole());
 
     return *zone()->New<GlobalAccessFeedback>(
         context, context_slot_index,
         FeedbackNexus::ImmutabilityBit::decode(number), nexus.kind());
   }
 
-  CHECK(feedback_value->IsPropertyCell());
+  CHECK(IsPropertyCell(*feedback_value));
   // The wanted name belongs (or did belong) to a property on the global
   // object and the feedback is the cell holding its value.
   return *zone()->New<GlobalAccessFeedback>(
@@ -660,8 +639,8 @@ ProcessedFeedback const& JSHeapBroker::ReadFeedbackForArrayOrObjectLiteral(
   FeedbackNexus nexus(source.vector, source.slot, feedback_nexus_config());
   if (nexus.IsUninitialized()) return NewInsufficientFeedback(nexus.kind());
 
-  HeapObject object;
-  if (!nexus.GetFeedback()->GetHeapObject(&object)) {
+  Tagged<HeapObject> object;
+  if (!nexus.GetFeedback().GetHeapObject(&object)) {
     return NewInsufficientFeedback(nexus.kind());
   }
 
@@ -675,8 +654,8 @@ ProcessedFeedback const& JSHeapBroker::ReadFeedbackForRegExpLiteral(
   FeedbackNexus nexus(source.vector, source.slot, feedback_nexus_config());
   if (nexus.IsUninitialized()) return NewInsufficientFeedback(nexus.kind());
 
-  HeapObject object;
-  if (!nexus.GetFeedback()->GetHeapObject(&object)) {
+  Tagged<HeapObject> object;
+  if (!nexus.GetFeedback().GetHeapObject(&object)) {
     return NewInsufficientFeedback(nexus.kind());
   }
 
@@ -690,8 +669,8 @@ ProcessedFeedback const& JSHeapBroker::ReadFeedbackForTemplateObject(
   FeedbackNexus nexus(source.vector, source.slot, feedback_nexus_config());
   if (nexus.IsUninitialized()) return NewInsufficientFeedback(nexus.kind());
 
-  HeapObject object;
-  if (!nexus.GetFeedback()->GetHeapObject(&object)) {
+  Tagged<HeapObject> object;
+  if (!nexus.GetFeedback().GetHeapObject(&object)) {
     return NewInsufficientFeedback(nexus.kind());
   }
 
@@ -707,8 +686,8 @@ ProcessedFeedback const& JSHeapBroker::ReadFeedbackForCall(
   OptionalHeapObjectRef target_ref;
   {
     MaybeObject maybe_target = nexus.GetFeedback();
-    HeapObject target_object;
-    if (maybe_target->GetHeapObject(&target_object)) {
+    Tagged<HeapObject> target_object;
+    if (maybe_target.GetHeapObject(&target_object)) {
       target_ref = TryMakeRef(this, target_object);
     }
   }
@@ -844,8 +823,8 @@ ElementAccessFeedback const& JSHeapBroker::ProcessFeedbackMapsForElementAccess(
   ZoneRefMap<MapRef, TransitionGroup> transition_groups(zone());
 
   // Separate the actual receiver maps and the possible transition sources.
-  for (const MapRef& map : maps) {
-    Map transition_target;
+  for (MapRef map : maps) {
+    Tagged<Map> transition_target;
 
     // Don't generate elements kind transitions from stable maps.
     if (!map.is_stable()) {
@@ -899,7 +878,7 @@ void ElementAccessFeedback::AddGroup(TransitionGroup&& group) {
 }
 
 OptionalNameRef JSHeapBroker::GetNameFeedback(FeedbackNexus const& nexus) {
-  Name raw_name = nexus.GetName();
+  Tagged<Name> raw_name = nexus.GetName();
   if (raw_name.is_null()) return base::nullopt;
   return MakeRefAssumeMemoryFence(this, raw_name);
 }
diff --git a/deps/v8/src/compiler/js-heap-broker.h b/deps/v8/src/compiler/js-heap-broker.h
index b7c0cce8e155c8..0a09e9378ee923 100644
--- a/deps/v8/src/compiler/js-heap-broker.h
+++ b/deps/v8/src/compiler/js-heap-broker.h
@@ -9,6 +9,7 @@
 #include "src/base/macros.h"
 #include "src/base/optional.h"
 #include "src/base/platform/mutex.h"
+#include "src/codegen/optimized-compilation-info.h"
 #include "src/common/globals.h"
 #include "src/compiler/access-info.h"
 #include "src/compiler/feedback-source.h"
@@ -23,6 +24,7 @@
 #include "src/objects/code-kind.h"
 #include "src/objects/feedback-vector.h"
 #include "src/objects/objects.h"
+#include "src/objects/tagged.h"
 #include "src/roots/roots.h"
 #include "src/utils/address-map.h"
 #include "src/utils/identity-map.h"
@@ -40,7 +42,7 @@ namespace compiler {
 
 class ObjectRef;
 
-std::ostream& operator<<(std::ostream& os, const ObjectRef& ref);
+std::ostream& operator<<(std::ostream& os, ObjectRef ref);
 
 #define TRACE_BROKER(broker, x)                                          \
   do {                                                                   \
@@ -115,7 +117,7 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
   }
   void SetTargetNativeContextRef(Handle<NativeContext> native_context);
 
-  void InitializeAndStartSerializing();
+  void InitializeAndStartSerializing(Handle<NativeContext> native_context);
 
   Isolate* isolate() const { return isolate_; }
 
@@ -165,6 +167,13 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
                                    LocalIsolate* local_isolate);
   void DetachLocalIsolateForMaglev(maglev::MaglevCompilationInfo* info);
 
+  // Attaches the canonical handles map from the compilation info to the broker.
+  // Ownership of the map remains in the compilation info.
+  template <typename CompilationInfoT>
+  void AttachCompilationInfo(CompilationInfoT* info) {
+    set_canonical_handles(info->canonical_handles());
+  }
+
   bool StackHasOverflowed() const;
 
 #ifdef DEBUG
@@ -172,23 +181,24 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
 #endif  // DEBUG
 
   // Returns the handle from root index table for read only heap objects.
-  Handle<Object> GetRootHandle(Object object);
+  Handle<Object> GetRootHandle(Tagged<Object> object);
 
   // Never returns nullptr.
   ObjectData* GetOrCreateData(Handle<Object> object,
                               GetOrCreateDataFlags flags = {});
-  ObjectData* GetOrCreateData(Object object, GetOrCreateDataFlags flags = {});
+  ObjectData* GetOrCreateData(Tagged<Object> object,
+                              GetOrCreateDataFlags flags = {});
 
   // Gets data only if we have it. However, thin wrappers will be created for
   // smis, read-only objects and never-serialized objects.
   ObjectData* TryGetOrCreateData(Handle<Object> object,
                                  GetOrCreateDataFlags flags = {});
-  ObjectData* TryGetOrCreateData(Object object,
+  ObjectData* TryGetOrCreateData(Tagged<Object> object,
                                  GetOrCreateDataFlags flags = {});
 
   // Check if {object} is any native context's %ArrayPrototype% or
   // %ObjectPrototype%.
-  bool IsArrayOrObjectPrototype(const JSObjectRef& object) const;
+  bool IsArrayOrObjectPrototype(JSObjectRef object) const;
   bool IsArrayOrObjectPrototype(Handle<JSObject> object) const;
 
   bool HasFeedback(FeedbackSource const& source) const;
@@ -253,7 +263,7 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
                                       : isolate()->AsLocalIsolate();
   }
 
-  base::Optional<RootIndex> FindRootIndex(const HeapObjectRef& object) {
+  base::Optional<RootIndex> FindRootIndex(HeapObjectRef object) {
     // No root constant is a JSReceiver.
     if (object.IsJSReceiver()) return {};
     Address address = object.object()->ptr();
@@ -266,34 +276,35 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
 
   // Return the corresponding canonical persistent handle for {object}. Create
   // one if it does not exist.
-  // If we have the canonical map, we can create the canonical & persistent
-  // handle through it. This commonly happens during the Execute phase.
+  // If a local isolate is attached, we can create the persistent handle through
+  // it. This commonly happens during the Execute phase.
   // If we don't, that means we are calling this method from serialization. If
-  // that happens, we should be inside a canonical and a persistent handle
-  // scope. Then, we would just use the regular handle creation.
+  // that happens, we should be inside a persistent handle scope. Then, we would
+  // just use the regular handle creation.
   template <typename T>
-  Handle<T> CanonicalPersistentHandle(T object) {
-    if (canonical_handles_) {
-      Address address = object.ptr();
-      if (Internals::HasHeapObjectTag(address)) {
-        RootIndex root_index;
-        if (root_index_map_.Lookup(address, &root_index)) {
-          return Handle<T>(isolate_->root_handle(root_index).location());
-        }
+  Handle<T> CanonicalPersistentHandle(Tagged<T> object) {
+    DCHECK_NOT_NULL(canonical_handles_);
+    Address address = object.ptr();
+    if (Internals::HasHeapObjectTag(address)) {
+      RootIndex root_index;
+      if (root_index_map_.Lookup(address, &root_index)) {
+        return Handle<T>(isolate_->root_handle(root_index).location());
       }
+    }
 
-      Object obj(address);
-      auto find_result = canonical_handles_->FindOrInsert(obj);
-      if (!find_result.already_exists) {
-        // Allocate new PersistentHandle if one wasn't created before.
-        DCHECK_NOT_NULL(local_isolate());
-        *find_result.entry =
-            local_isolate()->heap()->NewPersistentHandle(obj).location();
-      }
-      return Handle<T>(*find_result.entry);
+    Tagged<Object> obj(address);
+    auto find_result = canonical_handles_->FindOrInsert(obj);
+    if (find_result.already_exists) return Handle<T>(*find_result.entry);
+
+    // Allocate new PersistentHandle if one wasn't created before.
+    if (local_isolate()) {
+      *find_result.entry =
+          local_isolate()->heap()->NewPersistentHandle(obj).location();
     } else {
-      return Handle<T>(object, isolate());
+      DCHECK(PersistentHandlesScope::IsActive(isolate()));
+      *find_result.entry = Handle<T>(object, isolate()).location();
     }
+    return Handle<T>(*find_result.entry);
   }
 
   template <typename T>
@@ -302,19 +313,26 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
     return CanonicalPersistentHandle<T>(*object);
   }
 
-  // Find the corresponding handle in the CanonicalHandlesMap. The entry must be
-  // found.
+  // Checks if a canonical persistent handle for {object} exists.
   template <typename T>
-  Handle<T> FindCanonicalPersistentHandleForTesting(Object object) {
-    Address** entry = canonical_handles_->Find(object);
-    return Handle<T>(*entry);
+  bool IsCanonicalHandle(Handle<T> handle) {
+    DCHECK_NOT_NULL(canonical_handles_);
+    Address* location = handle.location();
+    Address address = *location;
+    if (Internals::HasHeapObjectTag(address)) {
+      RootIndex root_index;
+      if (root_index_map_.Lookup(address, &root_index)) {
+        return true;
+      }
+      // Builtins use pseudo handles that are canonical and persistent by
+      // design.
+      if (isolate()->IsBuiltinTableHandleLocation(location)) {
+        return true;
+      }
+    }
+    return canonical_handles_->Find(Object(address)) != nullptr;
   }
 
-  // Set the persistent handles and copy the canonical handles over to the
-  // JSHeapBroker.
-  void SetPersistentAndCopyCanonicalHandlesForTesting(
-      std::unique_ptr<PersistentHandles> persistent_handles,
-      std::unique_ptr<CanonicalHandlesMap> canonical_handles);
   std::string Trace() const;
   void IncrementTracingIndentation();
   void DecrementTracingIndentation();
@@ -323,14 +341,9 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
   // occurrence. This is done to have a recursive shared lock on {mutex}.
   class V8_NODISCARD RecursiveSharedMutexGuardIfNeeded {
    protected:
-    RecursiveSharedMutexGuardIfNeeded(LocalIsolate* local_isolate,
-                                      base::SharedMutex* mutex,
-                                      int* mutex_depth_address)
-        : mutex_depth_address_(mutex_depth_address),
-          initial_mutex_depth_(*mutex_depth_address_),
-          shared_mutex_guard_(local_isolate, mutex, initial_mutex_depth_ == 0) {
-      (*mutex_depth_address_)++;
-    }
+    V8_INLINE RecursiveSharedMutexGuardIfNeeded(LocalIsolate* local_isolate,
+                                                base::SharedMutex* mutex,
+                                                int* mutex_depth_address);
 
     ~RecursiveSharedMutexGuardIfNeeded() {
       DCHECK_GE((*mutex_depth_address_), 1);
@@ -347,29 +360,21 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
   class MapUpdaterGuardIfNeeded final
       : public RecursiveSharedMutexGuardIfNeeded {
    public:
-    explicit MapUpdaterGuardIfNeeded(JSHeapBroker* broker)
-        : RecursiveSharedMutexGuardIfNeeded(
-              broker->local_isolate_or_isolate(),
-              broker->isolate()->map_updater_access(),
-              &broker->map_updater_mutex_depth_) {}
+    V8_INLINE explicit MapUpdaterGuardIfNeeded(JSHeapBroker* broker);
   };
 
   class BoilerplateMigrationGuardIfNeeded final
       : public RecursiveSharedMutexGuardIfNeeded {
    public:
-    explicit BoilerplateMigrationGuardIfNeeded(JSHeapBroker* broker)
-        : RecursiveSharedMutexGuardIfNeeded(
-              broker->local_isolate_or_isolate(),
-              broker->isolate()->boilerplate_migration_access(),
-              &broker->boilerplate_migration_mutex_depth_) {}
+    V8_INLINE explicit BoilerplateMigrationGuardIfNeeded(JSHeapBroker* broker);
   };
 
   // If this returns false, the object is guaranteed to be fully initialized and
   // thus safe to read from a memory safety perspective. The converse does not
   // necessarily hold.
   bool ObjectMayBeUninitialized(Handle<Object> object) const;
-  bool ObjectMayBeUninitialized(Object object) const;
-  bool ObjectMayBeUninitialized(HeapObject object) const;
+  bool ObjectMayBeUninitialized(Tagged<Object> object) const;
+  bool ObjectMayBeUninitialized(Tagged<HeapObject> object) const;
 
   void set_dependencies(CompilationDependencies* dependencies) {
     DCHECK_NOT_NULL(dependencies);
@@ -386,6 +391,7 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
 #undef V
 
  private:
+  friend class JSHeapBrokerScopeForTesting;
   friend class HeapObjectRef;
   friend class ObjectRef;
   friend class ObjectData;
@@ -430,22 +436,10 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
     return std::move(ph_);
   }
 
-  void set_canonical_handles(
-      std::unique_ptr<CanonicalHandlesMap> canonical_handles) {
-    DCHECK_NULL(canonical_handles_);
-    canonical_handles_ = std::move(canonical_handles);
-    DCHECK_NOT_NULL(canonical_handles_);
-  }
-
-  std::unique_ptr<CanonicalHandlesMap> DetachCanonicalHandles() {
-    DCHECK_NOT_NULL(canonical_handles_);
-    return std::move(canonical_handles_);
+  void set_canonical_handles(CanonicalHandlesMap* canonical_handles) {
+    canonical_handles_ = canonical_handles;
   }
 
-  // Copy the canonical handles over to the JSHeapBroker.
-  void CopyCanonicalHandlesForTesting(
-      std::unique_ptr<CanonicalHandlesMap> canonical_handles);
-
 #define V(Type, name, Name) void Init##Name();
   READ_ONLY_ROOT_LIST(V)
 #undef V
@@ -466,7 +460,8 @@ class V8_EXPORT_PRIVATE JSHeapBroker {
   CodeKind const code_kind_;
   std::unique_ptr<PersistentHandles> ph_;
   LocalIsolate* local_isolate_ = nullptr;
-  std::unique_ptr<CanonicalHandlesMap> canonical_handles_;
+  // The CanonicalHandlesMap is owned by the compilation info.
+  CanonicalHandlesMap* canonical_handles_;
   unsigned trace_indentation_ = 0;
   ZoneUnorderedMap<FeedbackSource, ProcessedFeedback const*,
                    FeedbackSource::Hash, FeedbackSource::Equal>
@@ -561,6 +556,26 @@ class V8_NODISCARD UnparkedScopeIfNeeded {
   base::Optional<UnparkedScope> unparked_scope;
 };
 
+class V8_NODISCARD JSHeapBrokerScopeForTesting {
+ public:
+  JSHeapBrokerScopeForTesting(JSHeapBroker* broker, Isolate* isolate,
+                              Zone* zone)
+      : JSHeapBrokerScopeForTesting(
+            broker, std::make_unique<CanonicalHandlesMap>(
+                        isolate->heap(), ZoneAllocationPolicy(zone))) {}
+  JSHeapBrokerScopeForTesting(
+      JSHeapBroker* broker,
+      std::unique_ptr<CanonicalHandlesMap> canonical_handles)
+      : canonical_handles_(std::move(canonical_handles)), broker_(broker) {
+    broker_->set_canonical_handles(canonical_handles_.get());
+  }
+  ~JSHeapBrokerScopeForTesting() { broker_->set_canonical_handles(nullptr); }
+
+ private:
+  std::unique_ptr<CanonicalHandlesMap> canonical_handles_;
+  JSHeapBroker* const broker_;
+};
+
 template <class T,
           typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
 OptionalRef<typename ref_traits<T>::ref_type> TryMakeRef(JSHeapBroker* broker,
@@ -580,7 +595,7 @@ OptionalRef<typename ref_traits<T>::ref_type> TryMakeRef(JSHeapBroker* broker,
 template <class T,
           typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
 OptionalRef<typename ref_traits<T>::ref_type> TryMakeRef(
-    JSHeapBroker* broker, T object, GetOrCreateDataFlags flags = {}) {
+    JSHeapBroker* broker, Tagged<T> object, GetOrCreateDataFlags flags = {}) {
   ObjectData* data = broker->TryGetOrCreateData(object, flags);
   if (data == nullptr) {
     TRACE_BROKER_MISSING(broker, "ObjectData for " << Brief(object));
@@ -588,6 +603,14 @@ OptionalRef<typename ref_traits<T>::ref_type> TryMakeRef(
   return TryMakeRef<T>(broker, data);
 }
 
+template <class T,
+          typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
+OptionalRef<typename ref_traits<T>::ref_type> TryMakeRef(
+    JSHeapBroker* broker, T object, GetOrCreateDataFlags flags = {}) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return TryMakeRef<T>(broker, Tagged<T>(object), flags);
+}
+
 template <class T,
           typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
 OptionalRef<typename ref_traits<T>::ref_type> TryMakeRef(
@@ -602,10 +625,18 @@ OptionalRef<typename ref_traits<T>::ref_type> TryMakeRef(
 
 template <class T,
           typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
-typename ref_traits<T>::ref_type MakeRef(JSHeapBroker* broker, T object) {
+typename ref_traits<T>::ref_type MakeRef(JSHeapBroker* broker,
+                                         Tagged<T> object) {
   return TryMakeRef(broker, object, kCrashOnError).value();
 }
 
+template <class T,
+          typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
+typename ref_traits<T>::ref_type MakeRef(JSHeapBroker* broker, T object) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return TryMakeRef(broker, Tagged<T>(object), kCrashOnError).value();
+}
+
 template <class T,
           typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
 typename ref_traits<T>::ref_type MakeRef(JSHeapBroker* broker,
@@ -613,10 +644,18 @@ typename ref_traits<T>::ref_type MakeRef(JSHeapBroker* broker,
   return TryMakeRef(broker, object, kCrashOnError).value();
 }
 
+template <class T,
+          typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
+typename ref_traits<T>::ref_type MakeRefAssumeMemoryFence(JSHeapBroker* broker,
+                                                          Tagged<T> object) {
+  return TryMakeRef(broker, object, kAssumeMemoryFence | kCrashOnError).value();
+}
+
 template <class T,
           typename = std::enable_if_t<std::is_convertible<T*, Object*>::value>>
 typename ref_traits<T>::ref_type MakeRefAssumeMemoryFence(JSHeapBroker* broker,
                                                           T object) {
+  static_assert(kTaggedCanConvertToRawObjects);
   return TryMakeRef(broker, object, kAssumeMemoryFence | kCrashOnError).value();
 }
 
diff --git a/deps/v8/src/compiler/js-inlining-heuristic.cc b/deps/v8/src/compiler/js-inlining-heuristic.cc
index 26721226945278..142e9d0efb109b 100644
--- a/deps/v8/src/compiler/js-inlining-heuristic.cc
+++ b/deps/v8/src/compiler/js-inlining-heuristic.cc
@@ -26,7 +26,7 @@ bool IsSmall(int const size) {
 }
 
 bool CanConsiderForInlining(JSHeapBroker* broker,
-                            FeedbackCellRef const& feedback_cell) {
+                            FeedbackCellRef feedback_cell) {
   OptionalFeedbackVectorRef feedback_vector =
       feedback_cell.feedback_vector(broker);
   if (!feedback_vector.has_value()) {
@@ -72,8 +72,7 @@ bool CanConsiderForInlining(JSHeapBroker* broker,
   return true;
 }
 
-bool CanConsiderForInlining(JSHeapBroker* broker,
-                            JSFunctionRef const& function) {
+bool CanConsiderForInlining(JSHeapBroker* broker, JSFunctionRef function) {
   FeedbackCellRef feedback_cell = function.raw_feedback_cell(broker);
   bool const result = CanConsiderForInlining(broker, feedback_cell);
   if (result) {
@@ -152,7 +151,7 @@ JSInliningHeuristic::Candidate JSInliningHeuristic::CollectFunctions(
 
 Reduction JSInliningHeuristic::Reduce(Node* node) {
 #if V8_ENABLE_WEBASSEMBLY
-  if (mode() == kWasmOnly) {
+  if (mode() == kWasmWrappersOnly || mode() == kWasmFullInlining) {
     if (node->opcode() == IrOpcode::kJSWasmCall) {
       return inliner_.ReduceJSWasmCall(node);
     }
@@ -413,7 +412,8 @@ FrameState JSInliningHeuristic::DuplicateFrameStateAndRename(
 
 bool JSInliningHeuristic::TryReuseDispatch(Node* node, Node* callee,
                                            Node** if_successes, Node** calls,
-                                           Node** inputs, int input_count) {
+                                           Node** inputs, int input_count,
+                                           int* num_calls) {
   // We will try to reuse the control flow branch created for computing
   // the {callee} target of the call. We only reuse the branch if there
   // is no side-effect between the call and the branch, and if the callee is
@@ -504,7 +504,6 @@ bool JSInliningHeuristic::TryReuseDispatch(Node* node, Node* callee,
   // Bailout if the call is not polymorphic anymore (other reducers might
   // have replaced the callee phi with a constant).
   if (callee->opcode() != IrOpcode::kPhi) return false;
-  int const num_calls = callee->op()->ValueInputCount();
 
   // If there is a control node between the callee computation
   // and the call, bail out.
@@ -601,9 +600,11 @@ bool JSInliningHeuristic::TryReuseDispatch(Node* node, Node* callee,
     if (!found) return false;
   }
 
+  *num_calls = callee->op()->ValueInputCount();
+
   // Clone the call and the framestate, including the uniquely reachable
   // state values, making sure that we replace the phi with the constant.
-  for (int i = 0; i < num_calls; ++i) {
+  for (int i = 0; i < *num_calls; ++i) {
     // Clone the calls for each branch.
     // We need to specialize the calls to the correct target, effect, and
     // control. We also need to duplicate the checkpoint and the lazy
@@ -617,7 +618,7 @@ bool JSInliningHeuristic::TryReuseDispatch(Node* node, Node* callee,
       // Duplicate the checkpoint.
       FrameState new_checkpoint_state = DuplicateFrameStateAndRename(
           FrameState{checkpoint_state}, callee, target,
-          (i == num_calls - 1) ? kChangeInPlace : kCloneState);
+          (i == *num_calls - 1) ? kChangeInPlace : kCloneState);
       effect_phi_effect = graph()->NewNode(
           checkpoint->op(), new_checkpoint_state, effect_phi_effect, control);
     }
@@ -625,7 +626,7 @@ bool JSInliningHeuristic::TryReuseDispatch(Node* node, Node* callee,
     // Duplicate the call.
     FrameState new_lazy_frame_state = DuplicateFrameStateAndRename(
         frame_state, callee, target,
-        (i == num_calls - 1) ? kChangeInPlace : kCloneState);
+        (i == *num_calls - 1) ? kChangeInPlace : kCloneState);
     inputs[0] = target;
     inputs[input_count - 3] = new_lazy_frame_state;
     inputs[input_count - 2] = effect_phi_effect;
@@ -636,8 +637,8 @@ bool JSInliningHeuristic::TryReuseDispatch(Node* node, Node* callee,
 
   // Mark the control inputs dead, so that we can kill the merge.
   node->ReplaceInput(input_count - 1, jsgraph()->Dead());
-  callee->ReplaceInput(num_calls, jsgraph()->Dead());
-  effect_phi->ReplaceInput(num_calls, jsgraph()->Dead());
+  callee->ReplaceInput(*num_calls, jsgraph()->Dead());
+  effect_phi->ReplaceInput(*num_calls, jsgraph()->Dead());
   if (checkpoint) {
     checkpoint->ReplaceInput(2, jsgraph()->Dead());
   }
@@ -646,30 +647,28 @@ bool JSInliningHeuristic::TryReuseDispatch(Node* node, Node* callee,
   return true;
 }
 
-void JSInliningHeuristic::CreateOrReuseDispatch(Node* node, Node* callee,
-                                                Candidate const& candidate,
-                                                Node** if_successes,
-                                                Node** calls, Node** inputs,
-                                                int input_count) {
+void JSInliningHeuristic::CreateOrReuseDispatch(
+    Node* node, Node* callee, Candidate const& candidate, Node** if_successes,
+    Node** calls, Node** inputs, int input_count, int* num_calls) {
   SourcePositionTable::Scope position(
       source_positions_, source_positions_->GetSourcePosition(node));
-  if (TryReuseDispatch(node, callee, if_successes, calls, inputs,
-                       input_count)) {
+  if (TryReuseDispatch(node, callee, if_successes, calls, inputs, input_count,
+                       num_calls)) {
     return;
   }
 
   static_assert(JSCallOrConstructNode::kHaveIdenticalLayouts);
 
   Node* fallthrough_control = NodeProperties::GetControlInput(node);
-  int const num_calls = candidate.num_functions;
+  *num_calls = candidate.num_functions;
 
   // Create the appropriate control flow to dispatch to the cloned calls.
-  for (int i = 0; i < num_calls; ++i) {
+  for (int i = 0; i < *num_calls; ++i) {
     // TODO(2206): Make comparison be based on underlying SharedFunctionInfo
     // instead of the target JSFunction reference directly.
     Node* target =
         jsgraph()->Constant(candidate.functions[i].value(), broker());
-    if (i != (num_calls - 1)) {
+    if (i != (*num_calls - 1)) {
       Node* check =
           graph()->NewNode(simplified()->ReferenceEqual(), callee, target);
       Node* branch =
@@ -702,7 +701,7 @@ void JSInliningHeuristic::CreateOrReuseDispatch(Node* node, Node* callee,
 
 Reduction JSInliningHeuristic::InlineCandidate(Candidate const& candidate,
                                                bool small_function) {
-  int const num_calls = candidate.num_functions;
+  int num_calls = candidate.num_functions;
   Node* const node = candidate.node;
 #if V8_ENABLE_WEBASSEMBLY
   DCHECK_NE(node->opcode(), IrOpcode::kJSWasmCall);
@@ -724,14 +723,14 @@ Reduction JSInliningHeuristic::InlineCandidate(Candidate const& candidate,
 
   // Setup the inputs for the cloned call nodes.
   int const input_count = node->InputCount();
-  Node** inputs = graph()->zone()->NewArray<Node*>(input_count);
+  Node** inputs = graph()->zone()->AllocateArray<Node*>(input_count);
   for (int i = 0; i < input_count; ++i) {
     inputs[i] = node->InputAt(i);
   }
 
   // Create the appropriate control flow to dispatch to the cloned calls.
   CreateOrReuseDispatch(node, callee, candidate, if_successes, calls, inputs,
-                        input_count);
+                        input_count, &num_calls);
 
   // Check if we have an exception projection for the call {node}.
   Node* if_exception = nullptr;
diff --git a/deps/v8/src/compiler/js-inlining-heuristic.h b/deps/v8/src/compiler/js-inlining-heuristic.h
index 02bcde64b165dc..7d60c4bc21fad7 100644
--- a/deps/v8/src/compiler/js-inlining-heuristic.h
+++ b/deps/v8/src/compiler/js-inlining-heuristic.h
@@ -13,7 +13,12 @@ namespace compiler {
 
 class JSInliningHeuristic final : public AdvancedReducer {
  public:
-  enum Mode { kJSOnly, kWasmOnly };
+  enum Mode {
+    kJSOnly,            // Inline JS calls only.
+    kWasmWrappersOnly,  // Inline wasm wrappers only.
+    kWasmFullInlining,  // Inline wasm wrappers and (if supported) whole wasm
+                        // functions.
+  };
 
   JSInliningHeuristic(Editor* editor, Zone* local_zone,
                       OptimizedCompilationInfo* info, JSGraph* jsgraph,
@@ -23,7 +28,7 @@ class JSInliningHeuristic final : public AdvancedReducer {
                       const wasm::WasmModule* wasm_module = nullptr)
       : AdvancedReducer(editor),
         inliner_(editor, local_zone, info, jsgraph, broker, source_positions,
-                 node_origins, wasm_module),
+                 node_origins, wasm_module, mode == kWasmFullInlining),
         candidates_(local_zone),
         seen_(local_zone),
         source_positions_(source_positions),
@@ -34,7 +39,8 @@ class JSInliningHeuristic final : public AdvancedReducer {
             v8_flags.max_inlined_bytecode_size_cumulative),
         max_inlined_bytecode_size_absolute_(
             v8_flags.max_inlined_bytecode_size_absolute) {
-    DCHECK_EQ(mode == kWasmOnly, wasm_module != nullptr);
+    DCHECK_EQ(mode == kWasmWrappersOnly || mode == kWasmFullInlining,
+              wasm_module != nullptr);
   }
 
   const char* reducer_name() const override { return "JSInliningHeuristic"; }
@@ -86,9 +92,11 @@ class JSInliningHeuristic final : public AdvancedReducer {
   Reduction InlineCandidate(Candidate const& candidate, bool small_function);
   void CreateOrReuseDispatch(Node* node, Node* callee,
                              Candidate const& candidate, Node** if_successes,
-                             Node** calls, Node** inputs, int input_count);
+                             Node** calls, Node** inputs, int input_count,
+                             int* num_calls);
   bool TryReuseDispatch(Node* node, Node* callee, Node** if_successes,
-                        Node** calls, Node** inputs, int input_count);
+                        Node** calls, Node** inputs, int input_count,
+                        int* num_calls);
   enum StateCloneMode { kCloneState, kChangeInPlace };
   FrameState DuplicateFrameStateAndRename(FrameState frame_state, Node* from,
                                           Node* to, StateCloneMode mode);
diff --git a/deps/v8/src/compiler/js-inlining.cc b/deps/v8/src/compiler/js-inlining.cc
index f0377c030d39c9..fe5de4937cb19a 100644
--- a/deps/v8/src/compiler/js-inlining.cc
+++ b/deps/v8/src/compiler/js-inlining.cc
@@ -22,6 +22,8 @@
 
 #if V8_ENABLE_WEBASSEMBLY
 #include "src/compiler/wasm-compiler.h"
+#include "src/wasm/names-provider.h"
+#include "src/wasm/string-builder.h"
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 namespace v8 {
@@ -54,9 +56,7 @@ class JSCallAccessor {
     return call_->InputAt(JSCallOrConstructNode::TargetIndex());
   }
 
-  Node* receiver() const {
-    return JSCallNode{call_}.receiver();
-  }
+  Node* receiver() const { return JSCallNode{call_}.receiver(); }
 
   Node* new_target() const { return JSConstructNode{call_}.new_target(); }
 
@@ -210,8 +210,7 @@ Reduction JSInliner::InlineCall(Node* call, Node* new_target, Node* context,
       case IrOpcode::kDeoptimize:
       case IrOpcode::kTerminate:
       case IrOpcode::kThrow:
-        NodeProperties::MergeControlToEnd(graph(), common(), input);
-        Revisit(graph()->end());
+        MergeControlToEnd(graph(), common(), input);
         break;
       default:
         UNREACHABLE();
@@ -245,8 +244,8 @@ Reduction JSInliner::InlineCall(Node* call, Node* new_target, Node* context,
 
 FrameState JSInliner::CreateArtificialFrameState(
     Node* node, FrameState outer_frame_state, int parameter_count,
-    BytecodeOffset bailout_id, FrameStateType frame_state_type,
-    SharedFunctionInfoRef shared, Node* context) {
+    FrameStateType frame_state_type, SharedFunctionInfoRef shared,
+    Node* context, Node* callee) {
   const int parameter_count_with_receiver =
       parameter_count + JSCallOrConstructNode::kReceiverOrNewTargetInputCount;
   const FrameStateFunctionInfo* state_info =
@@ -254,24 +253,46 @@ FrameState JSInliner::CreateArtificialFrameState(
           frame_state_type, parameter_count_with_receiver, 0, shared.object());
 
   const Operator* op = common()->FrameState(
-      bailout_id, OutputFrameStateCombine::Ignore(), state_info);
+      BytecodeOffset::None(), OutputFrameStateCombine::Ignore(), state_info);
   const Operator* op0 = common()->StateValues(0, SparseInputMask::Dense());
   Node* node0 = graph()->NewNode(op0);
 
-  NodeVector params(local_zone_);
-  params.push_back(
-      node->InputAt(JSCallOrConstructNode::ReceiverOrNewTargetIndex()));
-  for (int i = 0; i < parameter_count; i++) {
-    params.push_back(node->InputAt(JSCallOrConstructNode::ArgumentIndex(i)));
+  Node* params_node = nullptr;
+#if V8_ENABLE_WEBASSEMBLY
+  const bool skip_params =
+      frame_state_type == FrameStateType::kWasmInlinedIntoJS;
+#else
+  const bool skip_params = false;
+#endif
+  if (skip_params) {
+    // For wasm inlined into JS the frame state doesn't need to be used for
+    // deopts. Also, due to different calling conventions, there isn't a
+    // receiver at input 1. We still need to store an undefined node here as the
+    // code requires this state values to have at least 1 entry.
+    // TODO(mliedtke): Can we clean up the FrameState handling, so that wasm
+    // inline FrameStates are closer to JS FrameStates without affecting
+    // performance?
+    const Operator* op_param =
+        common()->StateValues(1, SparseInputMask::Dense());
+    params_node = graph()->NewNode(op_param, jsgraph()->UndefinedConstant());
+  } else {
+    NodeVector params(local_zone_);
+    params.push_back(
+        node->InputAt(JSCallOrConstructNode::ReceiverOrNewTargetIndex()));
+    for (int i = 0; i < parameter_count; i++) {
+      params.push_back(node->InputAt(JSCallOrConstructNode::ArgumentIndex(i)));
+    }
+    const Operator* op_param = common()->StateValues(
+        static_cast<int>(params.size()), SparseInputMask::Dense());
+    params_node = graph()->NewNode(op_param, static_cast<int>(params.size()),
+                                   &params.front());
   }
-  const Operator* op_param = common()->StateValues(
-      static_cast<int>(params.size()), SparseInputMask::Dense());
-  Node* params_node = graph()->NewNode(
-      op_param, static_cast<int>(params.size()), &params.front());
   if (context == nullptr) context = jsgraph()->UndefinedConstant();
-  return FrameState{graph()->NewNode(
-      op, params_node, node0, node0, context,
-      node->InputAt(JSCallOrConstructNode::TargetIndex()), outer_frame_state)};
+  if (callee == nullptr) {
+    callee = node->InputAt(JSCallOrConstructNode::TargetIndex());
+  }
+  return FrameState{graph()->NewNode(op, params_node, node0, node0, context,
+                                     callee, outer_frame_state)};
 }
 
 namespace {
@@ -385,31 +406,72 @@ FeedbackCellRef JSInliner::DetermineCallContext(Node* node,
 }
 
 #if V8_ENABLE_WEBASSEMBLY
+static std::string WasmFunctionNameForTrace(wasm::NativeModule* native_module,
+                                            int fct_index) {
+  wasm::StringBuilder builder;
+  native_module->GetNamesProvider()->PrintFunctionName(builder, fct_index);
+  if (builder.length() == 0) return "<no name>";
+  return {builder.start(), builder.length()};
+}
+
+JSInliner::WasmInlineResult JSInliner::TryWasmInlining(
+    const JSWasmCallNode& call_node) {
+  const JSWasmCallParameters& wasm_call_params = call_node.Parameters();
+  wasm::NativeModule* native_module = wasm_call_params.native_module();
+  const int fct_index = wasm_call_params.function_index();
+  TRACE("Considering wasm function ["
+        << fct_index << "] "
+        << WasmFunctionNameForTrace(native_module, fct_index) << " of module "
+        << wasm_call_params.module() << " for inlining");
+
+  if (native_module->module() != wasm_module_) {
+    // Inlining of multiple wasm modules into the same JS function is not
+    // supported.
+    TRACE("- not inlining: another wasm module is already used for inlining");
+    return {};
+  }
+  if (NodeProperties::IsExceptionalCall(call_node)) {
+    // TODO(14034): It would be useful to also support inlining of wasm
+    // functions if they are surrounded by a try block which requires further
+    // work, so that the wasm trap gets forwarded to the corresponding catch
+    // block.
+    TRACE("- not inlining: wasm inlining into try catch is not supported");
+    return {};
+  }
+
+  const wasm::FunctionSig* sig = wasm_call_params.signature();
+  Graph::SubgraphScope graph_scope(graph());
+  WasmGraphBuilder builder(nullptr, zone(), jsgraph(), sig, source_positions_,
+                           WasmGraphBuilder::kNoSpecialParameterMode, isolate(),
+                           native_module->enabled_features());
+  SourcePosition call_pos = source_positions_->GetSourcePosition(call_node);
+  // Calculate hypothetical inlining id, so if we can't inline, we do not add
+  // the wasm function to the list of inlined functions.
+  int inlining_id = static_cast<int>(info_->inlined_functions().size());
+  bool can_inline_body =
+      builder.TryWasmInlining(fct_index, native_module, inlining_id);
+  if (can_inline_body) {
+    int actual_id =
+        info_->AddInlinedFunction(wasm_call_params.shared_fct_info().object(),
+                                  Handle<BytecodeArray>(), call_pos);
+    CHECK_EQ(inlining_id, actual_id);
+  }
+  return {can_inline_body, graph()->start(), graph()->end()};
+}
+
 Reduction JSInliner::ReduceJSWasmCall(Node* node) {
-  JSWasmCallNode n(node);
-  const JSWasmCallParameters& wasm_call_params = n.Parameters();
+  JSWasmCallNode call_node(node);
+  const JSWasmCallParameters& wasm_call_params = call_node.Parameters();
   int fct_index = wasm_call_params.function_index();
   wasm::NativeModule* native_module = wasm_call_params.native_module();
   const wasm::FunctionSig* sig = wasm_call_params.signature();
 
-  // Try "full" inlining of very simple WasmGC functions.
-  bool can_inline_body = false;
-  Node* inlinee_body_start = nullptr;
-  Node* inlinee_body_end = nullptr;
-  // TODO(7748): It would be useful to also support inlining of wasm functions
-  // if they are surrounded by a try block which requires further work, so that
-  // the wasm trap gets forwarded to the corresponding catch block.
-  if (native_module->enabled_features().has_gc() &&
-      v8_flags.experimental_wasm_js_inlining && fct_index != -1 &&
-      native_module && native_module->module() == wasm_module_ &&
-      !NodeProperties::IsExceptionalCall(node)) {
-    Graph::SubgraphScope graph_scope(graph());
-    WasmGraphBuilder builder(nullptr, zone(), jsgraph(), sig, source_positions_,
-                             WasmGraphBuilder::kNoSpecialParameterMode,
-                             isolate(), native_module->enabled_features());
-    can_inline_body = builder.TryWasmInlining(fct_index, native_module);
-    inlinee_body_start = graph()->start();
-    inlinee_body_end = graph()->end();
+  // Try "full" inlining of very simple wasm functions (mainly getters / setters
+  // for wasm gc objects).
+  WasmInlineResult inline_result;
+  if (inline_wasm_fct_if_supported_ && fct_index != -1 && native_module &&
+      native_module->enabled_features().has_gc()) {
+    inline_result = TryWasmInlining(call_node);
   }
 
   // Create the subgraph for the wrapper inlinee.
@@ -424,8 +486,8 @@ Reduction JSInliner::ReduceJSWasmCall(Node* node) {
     // call; this will ensure that lazy deoptimizations at this point will
     // still return the result of the Wasm function call.
     Node* continuation_frame_state =
-        CreateJSWasmCallBuiltinContinuationFrameState(jsgraph(), n.context(),
-                                                      n.frame_state(), sig);
+        CreateJSWasmCallBuiltinContinuationFrameState(
+            jsgraph(), call_node.context(), call_node.frame_state(), sig);
 
     // All the nodes inserted by the inlined subgraph will have
     // id >= subgraph_min_node_id. We use this later to avoid wire nodes that
@@ -433,7 +495,7 @@ Reduction JSInliner::ReduceJSWasmCall(Node* node) {
     // surrounding exception handler, if present.
     subgraph_min_node_id = graph()->NodeCount();
 
-    bool set_in_wasm_flag = !can_inline_body;
+    bool set_in_wasm_flag = !inline_result.can_inline_body;
     BuildInlinedJSToWasmWrapper(
         graph()->zone(), jsgraph(), sig, wasm_call_params.module(), isolate(),
         source_positions_, wasm::WasmFeatures::FromFlags(),
@@ -474,7 +536,7 @@ Reduction JSInliner::ReduceJSWasmCall(Node* node) {
   // given JavaScript function (due to the WasmGCLowering being dependent on
   // module-specific type indices).
   Node* wasm_fct_call = nullptr;
-  if (can_inline_body) {
+  if (inline_result.can_inline_body) {
     AllNodes inlined_nodes(local_zone_, wrapper_end_node, graph());
     for (Node* subnode : inlined_nodes.reachable) {
       // Ignore nodes that are not part of the inlinee.
@@ -499,20 +561,38 @@ Reduction JSInliner::ReduceJSWasmCall(Node* node) {
       InlineJSWasmCall(node, new_target, context, frame_state, start,
                        wrapper_end_node, exception_target, uncaught_subcalls);
   // Inline the wrapped wasm body if supported.
-  if (can_inline_body) {
-    InlineWasmFunction(wasm_fct_call, inlinee_body_start, inlinee_body_end);
+  if (inline_result.can_inline_body) {
+    InlineWasmFunction(wasm_fct_call, inline_result.body_start,
+                       inline_result.body_end, call_node.frame_state(),
+                       wasm_call_params.shared_fct_info(),
+                       call_node.ArgumentCount(), context);
   }
   return r;
 }
 
 void JSInliner::InlineWasmFunction(Node* call, Node* inlinee_start,
-                                   Node* inlinee_end) {
-  // TODO(7748): This is very similar to what is done for wasm inlining inside
+                                   Node* inlinee_end, Node* frame_state,
+                                   SharedFunctionInfoRef shared_fct_info,
+                                   int argument_count, Node* context) {
+  // TODO(14034): This is very similar to what is done for wasm inlining inside
   // another wasm function. Can we reuse some of its code?
   // 1) Rewire function entry.
   Node* control = NodeProperties::GetControlInput(call);
   Node* effect = NodeProperties::GetEffectInput(call);
 
+  // Add checkpoint with artificial Framestate for inlined wasm function.
+  // Treat the call as having no arguments. The arguments are not needed for
+  // stack trace creation and it costs runtime to save them at the checkpoint.
+  argument_count = 0;
+  // We do not have a proper callee JSFunction object.
+  Node* callee = jsgraph()->UndefinedConstant();
+  Node* frame_state_inside = CreateArtificialFrameState(
+      call, FrameState{frame_state}, argument_count,
+      FrameStateType::kWasmInlinedIntoJS, shared_fct_info, context, callee);
+  Node* check_point = graph()->NewNode(common()->Checkpoint(),
+                                       frame_state_inside, effect, control);
+  effect = check_point;
+
   for (Edge edge : inlinee_start->use_edges()) {
     Node* use = edge.from();
     if (use == nullptr) continue;
@@ -748,10 +828,17 @@ Reduction JSInliner::ReduceJSCall(Node* node) {
     if (NeedsImplicitReceiver(*shared_info)) {
       Effect effect = n.effect();
       Control control = n.control();
-      Node* frame_state_inside = CreateArtificialFrameState(
-          node, frame_state, n.ArgumentCount(),
-          BytecodeOffset::ConstructStubCreate(), FrameStateType::kConstructStub,
-          *shared_info, caller_context);
+      Node* frame_state_inside;
+      HeapObjectMatcher m(new_target);
+      if (m.HasResolvedValue() && m.Ref(broker()).IsJSFunction()) {
+        // If {new_target} is a JSFunction, then we cannot deopt in the
+        // NewObject call. Therefore we do not need the artificial frame state.
+        frame_state_inside = frame_state;
+      } else {
+        frame_state_inside = CreateArtificialFrameState(
+            node, frame_state, n.ArgumentCount(),
+            FrameStateType::kConstructCreateStub, *shared_info, caller_context);
+      }
       Node* create =
           graph()->NewNode(javascript()->Create(), call.target(), new_target,
                            caller_context, frame_state_inside, effect, control);
@@ -792,8 +879,7 @@ Reduction JSInliner::ReduceJSCall(Node* node) {
       branch_is_receiver_false =
           graph()->NewNode(common()->Throw(), branch_is_receiver_false,
                            branch_is_receiver_false);
-      NodeProperties::MergeControlToEnd(graph(), common(),
-                                        branch_is_receiver_false);
+      MergeControlToEnd(graph(), common(), branch_is_receiver_false);
 
       ReplaceWithValue(node_success, node_success, node_success,
                        branch_is_receiver_true);
@@ -804,8 +890,7 @@ Reduction JSInliner::ReduceJSCall(Node* node) {
     // Insert a construct stub frame into the chain of frame states. This will
     // reconstruct the proper frame when deoptimizing within the constructor.
     frame_state = CreateArtificialFrameState(
-        node, frame_state, n.ArgumentCount(),
-        BytecodeOffset::ConstructStubInvoke(), FrameStateType::kConstructStub,
+        node, frame_state, 0, FrameStateType::kConstructInvokeStub,
         *shared_info, caller_context);
   }
 
@@ -835,7 +920,7 @@ Reduction JSInliner::ReduceJSCall(Node* node) {
   DCHECK_EQ(parameter_count, start.FormalParameterCountWithoutReceiver());
   if (call.argument_count() != parameter_count) {
     frame_state = CreateArtificialFrameState(
-        node, frame_state, call.argument_count(), BytecodeOffset::None(),
+        node, frame_state, call.argument_count(),
         FrameStateType::kInlinedExtraArguments, *shared_info);
   }
 
diff --git a/deps/v8/src/compiler/js-inlining.h b/deps/v8/src/compiler/js-inlining.h
index a860f15f43e937..fbfc9f852fe82f 100644
--- a/deps/v8/src/compiler/js-inlining.h
+++ b/deps/v8/src/compiler/js-inlining.h
@@ -27,7 +27,8 @@ class JSInliner final : public AdvancedReducer {
   JSInliner(Editor* editor, Zone* local_zone, OptimizedCompilationInfo* info,
             JSGraph* jsgraph, JSHeapBroker* broker,
             SourcePositionTable* source_positions,
-            NodeOriginTable* node_origins, const wasm::WasmModule* wasm_module)
+            NodeOriginTable* node_origins, const wasm::WasmModule* wasm_module,
+            bool inline_wasm_fct_if_supported)
       : AdvancedReducer(editor),
         local_zone_(local_zone),
         info_(info),
@@ -35,9 +36,12 @@ class JSInliner final : public AdvancedReducer {
         broker_(broker),
         source_positions_(source_positions),
         node_origins_(node_origins),
-        wasm_module_(wasm_module) {
+        wasm_module_(wasm_module),
+        inline_wasm_fct_if_supported_(inline_wasm_fct_if_supported) {
     // In case WebAssembly is disabled.
     USE(wasm_module_);
+    USE(inline_wasm_fct_if_supported_);
+    DCHECK_IMPLIES(inline_wasm_fct_if_supported_, wasm_module_ != nullptr);
   }
 
   const char* reducer_name() const override { return "JSInliner"; }
@@ -50,7 +54,10 @@ class JSInliner final : public AdvancedReducer {
 
 #if V8_ENABLE_WEBASSEMBLY
   Reduction ReduceJSWasmCall(Node* node);
-  void InlineWasmFunction(Node* call, Node* inlinee_start, Node* inlinee_end);
+  void InlineWasmFunction(Node* call, Node* inlinee_start, Node* inlinee_end,
+                          Node* frame_state,
+                          SharedFunctionInfoRef shared_fct_info,
+                          int argument_count, Node* context);
 #endif  // V8_ENABLE_WEBASSEMBLY
 
  private:
@@ -72,13 +79,20 @@ class JSInliner final : public AdvancedReducer {
   NodeOriginTable* const node_origins_;
   const wasm::WasmModule* wasm_module_;
 
+  // Inline not only the wasm wrapper but also the wasm function itself if
+  // inlining into JavaScript is supported and the function is small enough.
+  bool inline_wasm_fct_if_supported_;
+
   OptionalSharedFunctionInfoRef DetermineCallTarget(Node* node);
   FeedbackCellRef DetermineCallContext(Node* node, Node** context_out);
 
+  // TODO(victorgomes): This function is used to create 3 *quite* different
+  // artificial frame states, we should perhaps split it into three different
+  // functions.
   FrameState CreateArtificialFrameState(
       Node* node, FrameState outer_frame_state, int parameter_count,
-      BytecodeOffset bailout_id, FrameStateType frame_state_type,
-      SharedFunctionInfoRef shared, Node* context = nullptr);
+      FrameStateType frame_state_type, SharedFunctionInfoRef shared,
+      Node* context = nullptr, Node* callee = nullptr);
 
   Reduction InlineCall(Node* call, Node* new_target, Node* context,
                        Node* frame_state, StartNode start, Node* end,
@@ -86,6 +100,12 @@ class JSInliner final : public AdvancedReducer {
                        const NodeVector& uncaught_subcalls, int argument_count);
 
 #if V8_ENABLE_WEBASSEMBLY
+  struct WasmInlineResult {
+    bool can_inline_body = false;
+    Node* body_start = nullptr;
+    Node* body_end = nullptr;
+  };
+  WasmInlineResult TryWasmInlining(const JSWasmCallNode& call_node);
   Reduction InlineJSWasmCall(Node* call, Node* new_target, Node* context,
                              Node* frame_state, StartNode start, Node* end,
                              Node* exception_target,
diff --git a/deps/v8/src/compiler/js-intrinsic-lowering.cc b/deps/v8/src/compiler/js-intrinsic-lowering.cc
index 2fd69d12076e3e..729cc80c5dbfb1 100644
--- a/deps/v8/src/compiler/js-intrinsic-lowering.cc
+++ b/deps/v8/src/compiler/js-intrinsic-lowering.cc
@@ -124,12 +124,10 @@ Reduction JSIntrinsicLowering::ReduceDeoptimizeNow(Node* node) {
   Node* const effect = NodeProperties::GetEffectInput(node);
   Node* const control = NodeProperties::GetControlInput(node);
 
-  // TODO(bmeurer): Move MergeControlToEnd() to the AdvancedReducer.
   Node* deoptimize = graph()->NewNode(
       common()->Deoptimize(DeoptimizeReason::kDeoptimizeNow, FeedbackSource()),
       frame_state, effect, control);
-  NodeProperties::MergeControlToEnd(graph(), common(), deoptimize);
-  Revisit(graph()->end());
+  MergeControlToEnd(graph(), common(), deoptimize);
 
   node->TrimInputCount(0);
   NodeProperties::ChangeOp(node, common()->Dead());
@@ -295,7 +293,11 @@ Reduction JSIntrinsicLowering::ReduceTurbofanStaticAssert(Node* node) {
 }
 
 Reduction JSIntrinsicLowering::ReduceVerifyType(Node* node) {
-  return Change(node, simplified()->VerifyType());
+  Node* value = NodeProperties::GetValueInput(node, 0);
+  Node* effect = NodeProperties::GetEffectInput(node);
+  effect = graph()->NewNode(simplified()->VerifyType(), value, effect);
+  ReplaceWithValue(node, value, effect);
+  return Changed(effect);
 }
 
 Reduction JSIntrinsicLowering::ReduceCheckTurboshaftTypeOf(Node* node) {
diff --git a/deps/v8/src/compiler/js-native-context-specialization.cc b/deps/v8/src/compiler/js-native-context-specialization.cc
index b6336828e56490..8f37860aefe48f 100644
--- a/deps/v8/src/compiler/js-native-context-specialization.cc
+++ b/deps/v8/src/compiler/js-native-context-specialization.cc
@@ -824,8 +824,8 @@ Reduction JSNativeContextSpecialization::ReduceJSInstanceOf(Node* node) {
 
 JSNativeContextSpecialization::InferHasInPrototypeChainResult
 JSNativeContextSpecialization::InferHasInPrototypeChain(
-    Node* receiver, Effect effect, HeapObjectRef const& prototype) {
-  ZoneRefUnorderedSet<MapRef> receiver_maps(zone());
+    Node* receiver, Effect effect, HeapObjectRef prototype) {
+  ZoneRefSet<Map> receiver_maps;
   NodeProperties::InferMapsResult result = NodeProperties::InferMapsUnsafe(
       broker(), receiver, effect, &receiver_maps);
   if (result == NodeProperties::kNoMaps) return kMayBeInPrototypeChain;
@@ -956,7 +956,8 @@ Reduction JSNativeContextSpecialization::ReduceJSOrdinaryHasInstance(
       return NoChange();
     }
 
-    ObjectRef prototype = dependencies()->DependOnPrototypeProperty(function);
+    HeapObjectRef prototype =
+        dependencies()->DependOnPrototypeProperty(function);
     Node* prototype_constant = jsgraph()->Constant(prototype, broker());
 
     // Lower the {node} to JSHasInPrototypeChain.
@@ -1016,13 +1017,13 @@ Reduction JSNativeContextSpecialization::ReduceJSResolvePromise(Node* node) {
   // Check if we know something about the {resolution}.
   MapInference inference(broker(), resolution, effect);
   if (!inference.HaveMaps()) return NoChange();
-  ZoneVector<MapRef> const& resolution_maps = inference.GetMaps();
+  ZoneRefSet<Map> const& resolution_maps = inference.GetMaps();
 
   // Compute property access info for "then" on {resolution}.
   ZoneVector<PropertyAccessInfo> access_infos(graph()->zone());
   AccessInfoFactory access_info_factory(broker(), graph()->zone());
 
-  for (const MapRef& map : resolution_maps) {
+  for (MapRef map : resolution_maps) {
     access_infos.push_back(broker()->GetPropertyAccessInfo(
         map, broker()->then_string(), AccessMode::kLoad));
   }
@@ -1056,8 +1057,7 @@ Reduction JSNativeContextSpecialization::ReduceJSResolvePromise(Node* node) {
 namespace {
 
 FieldAccess ForPropertyCellValue(MachineRepresentation representation,
-                                 Type type, MaybeHandle<Map> map,
-                                 NameRef const& name) {
+                                 Type type, OptionalMapRef map, NameRef name) {
   WriteBarrierKind kind = kFullWriteBarrier;
   if (representation == MachineRepresentation::kTaggedSigned) {
     kind = kNoWriteBarrier;
@@ -1081,17 +1081,15 @@ FieldAccess ForPropertyCellValue(MachineRepresentation representation,
 // code which hasn't been modified to support super property access.
 Reduction JSNativeContextSpecialization::ReduceGlobalAccess(
     Node* node, Node* lookup_start_object, Node* receiver, Node* value,
-    NameRef const& name, AccessMode access_mode, Node* key,
-    PropertyCellRef const& property_cell, Node* effect) {
+    NameRef name, AccessMode access_mode, Node* key,
+    PropertyCellRef property_cell, Node* effect) {
   if (!property_cell.Cache(broker())) {
     TRACE_BROKER_MISSING(broker(), "usable data for " << property_cell);
     return NoChange();
   }
 
   ObjectRef property_cell_value = property_cell.value(broker());
-  if (property_cell_value.IsHeapObject() &&
-      property_cell_value.AsHeapObject().map(broker()).oddball_type(broker()) ==
-          OddballType::kHole) {
+  if (property_cell_value.IsPropertyCellHole()) {
     // The property cell is no longer valid.
     return NoChange();
   }
@@ -1146,10 +1144,8 @@ Reduction JSNativeContextSpecialization::ReduceGlobalAccess(
     effect = graph()->NewNode(
         simplified()->CheckMaps(
             CheckMapsFlag::kNone,
-            ZoneHandleSet<Map>(native_context()
-                                   .global_proxy_object(broker())
-                                   .map(broker())
-                                   .object())),
+            ZoneRefSet<Map>(
+                native_context().global_proxy_object(broker()).map(broker()))),
         lookup_start_object, effect, control);
   }
 
@@ -1176,13 +1172,12 @@ Reduction JSNativeContextSpecialization::ReduceGlobalAccess(
                     ? jsgraph()->TrueConstant()
                     : jsgraph()->Constant(property_cell_value, broker());
         DCHECK(!property_cell_value.IsHeapObject() ||
-               property_cell_value.AsHeapObject().map(broker()).oddball_type(
-                   broker()) != OddballType::kHole);
+               !property_cell_value.IsPropertyCellHole());
       } else {
         DCHECK_NE(AccessMode::kHas, access_mode);
 
         // Load from constant type cell can benefit from type feedback.
-        MaybeHandle<Map> map;
+        OptionalMapRef map;
         Type property_cell_value_type = Type::NonInternal();
         MachineRepresentation representation = MachineRepresentation::kTagged;
         if (property_details.cell_type() == PropertyCellType::kConstantType) {
@@ -1205,7 +1200,7 @@ Reduction JSNativeContextSpecialization::ReduceGlobalAccess(
             // mutated without the cell state being updated.
             if (property_cell_value_map.is_stable()) {
               dependencies()->DependOnStableMap(property_cell_value_map);
-              map = property_cell_value_map.object();
+              map = property_cell_value_map;
             }
           }
         }
@@ -1248,9 +1243,8 @@ Reduction JSNativeContextSpecialization::ReduceGlobalAccess(
                                             value, effect, control);
           // Check {value} map against the {property_cell_value} map.
           effect = graph()->NewNode(
-              simplified()->CheckMaps(
-                  CheckMapsFlag::kNone,
-                  ZoneHandleSet<Map>(property_cell_value_map.object())),
+              simplified()->CheckMaps(CheckMapsFlag::kNone,
+                                      ZoneRefSet<Map>(property_cell_value_map)),
               value, effect, control);
           property_cell_value_type = Type::OtherInternal();
           representation = MachineRepresentation::kTaggedPointer;
@@ -1263,7 +1257,7 @@ Reduction JSNativeContextSpecialization::ReduceGlobalAccess(
         }
         effect = graph()->NewNode(simplified()->StoreField(ForPropertyCellValue(
                                       representation, property_cell_value_type,
-                                      MaybeHandle<Map>(), name)),
+                                      OptionalMapRef(), name)),
                                   jsgraph()->Constant(property_cell, broker()),
                                   value, effect, control);
         break;
@@ -1272,12 +1266,12 @@ Reduction JSNativeContextSpecialization::ReduceGlobalAccess(
         // Record a code dependency on the cell, and just deoptimize if the
         // property ever becomes read-only.
         dependencies()->DependOnGlobalProperty(property_cell);
-        effect = graph()->NewNode(
-            simplified()->StoreField(ForPropertyCellValue(
-                MachineRepresentation::kTagged, Type::NonInternal(),
-                MaybeHandle<Map>(), name)),
-            jsgraph()->Constant(property_cell, broker()), value, effect,
-            control);
+        effect =
+            graph()->NewNode(simplified()->StoreField(ForPropertyCellValue(
+                                 MachineRepresentation::kTagged,
+                                 Type::NonInternal(), OptionalMapRef(), name)),
+                             jsgraph()->Constant(property_cell, broker()),
+                             value, effect, control);
         break;
       }
       case PropertyCellType::kUndefined:
@@ -1427,7 +1421,7 @@ Reduction JSNativeContextSpecialization::ReduceMegaDOMPropertyAccess(
 
     Node* inputs[8] = {jsgraph()->HeapConstant(callable.code()),
                        jsgraph()->Constant(function_template_info, broker()),
-                       jsgraph()->Constant(stack_arg_count),
+                       jsgraph()->Int32Constant(stack_arg_count),
                        lookup_start_object,
                        jsgraph()->Constant(native_context(), broker()),
                        frame_state,
@@ -1491,7 +1485,7 @@ Reduction JSNativeContextSpecialization::ReduceNamedAccess(
   // Either infer maps from the graph or use the feedback.
   ZoneVector<MapRef> inferred_maps(zone());
   if (!InferMaps(lookup_start_object, effect, &inferred_maps)) {
-    for (const MapRef& map : feedback.maps()) {
+    for (MapRef map : feedback.maps()) {
       inferred_maps.push_back(map);
     }
   }
@@ -1521,7 +1515,7 @@ Reduction JSNativeContextSpecialization::ReduceNamedAccess(
   ZoneVector<PropertyAccessInfo> access_infos(zone());
   {
     ZoneVector<PropertyAccessInfo> access_infos_for_feedback(zone());
-    for (const MapRef& map : inferred_maps) {
+    for (MapRef map : inferred_maps) {
       if (map.is_deprecated()) continue;
 
       // TODO(v8:12547): Support writing to objects in shared space, which need
@@ -1687,10 +1681,8 @@ Reduction JSNativeContextSpecialization::ReduceNamedAccess(
           insert_map_guard = false;
         } else {
           // Explicitly branch on the {lookup_start_object_maps}.
-          ZoneHandleSet<Map> maps;
-          for (MapRef map : lookup_start_object_maps) {
-            maps.insert(map.object(), graph()->zone());
-          }
+          ZoneRefSet<Map> maps(lookup_start_object_maps.begin(),
+                               lookup_start_object_maps.end(), graph()->zone());
           Node* check = this_effect =
               graph()->NewNode(simplified()->CompareMaps(maps),
                                lookup_start_object, this_effect, this_control);
@@ -1719,10 +1711,8 @@ Reduction JSNativeContextSpecialization::ReduceNamedAccess(
 
         // Introduce a MapGuard to learn from this on the effect chain.
         if (insert_map_guard) {
-          ZoneHandleSet<Map> maps;
-          for (MapRef map : lookup_start_object_maps) {
-            maps.insert(map.object(), graph()->zone());
-          }
+          ZoneRefSet<Map> maps(lookup_start_object_maps.begin(),
+                               lookup_start_object_maps.end(), graph()->zone());
           this_effect =
               graph()->NewNode(simplified()->MapGuard(maps),
                                lookup_start_object, this_effect, this_control);
@@ -1824,7 +1814,8 @@ Reduction JSNativeContextSpecialization::ReduceJSLoadNamed(Node* node) {
           function.PrototypeRequiresRuntimeLookup(broker())) {
         return NoChange();
       }
-      ObjectRef prototype = dependencies()->DependOnPrototypeProperty(function);
+      HeapObjectRef prototype =
+          dependencies()->DependOnPrototypeProperty(function);
       Node* value = jsgraph()->Constant(prototype, broker());
       ReplaceWithValue(node, value);
       return Replace(value);
@@ -1880,14 +1871,15 @@ Reduction JSNativeContextSpecialization::ReduceJSGetIterator(Node* node) {
     // it's uses are rewired.
 
     Node* dead_node = jsgraph()->Dead();
-    if_exception_merge = graph()->NewNode(common()->Merge(4), dead_node,
-                                          dead_node, dead_node, dead_node);
+    if_exception_merge =
+        graph()->NewNode(common()->Merge(5), dead_node, dead_node, dead_node,
+                         dead_node, dead_node);
     if_exception_effect_phi =
-        graph()->NewNode(common()->EffectPhi(4), dead_node, dead_node,
-                         dead_node, dead_node, if_exception_merge);
+        graph()->NewNode(common()->EffectPhi(5), dead_node, dead_node,
+                         dead_node, dead_node, dead_node, if_exception_merge);
     if_exception_phi = graph()->NewNode(
-        common()->Phi(MachineRepresentation::kTagged, 4), dead_node, dead_node,
-        dead_node, dead_node, if_exception_merge);
+        common()->Phi(MachineRepresentation::kTagged, 5), dead_node, dead_node,
+        dead_node, dead_node, dead_node, if_exception_merge);
     // Rewire the original exception node uses.
     ReplaceWithValue(iterator_exception_node, if_exception_phi,
                      if_exception_effect_phi, if_exception_merge);
@@ -1931,6 +1923,38 @@ Reduction JSNativeContextSpecialization::ReduceJSGetIterator(Node* node) {
     control = graph()->NewNode(common()->IfSuccess(), control);
   }
 
+  Node* check = graph()->NewNode(simplified()->ReferenceEqual(), load_property,
+                                 jsgraph()->UndefinedConstant());
+  Node* branch =
+      graph()->NewNode(common()->Branch(BranchHint::kFalse), check, control);
+
+  {
+    Node* if_not_iterator = graph()->NewNode(common()->IfTrue(), branch);
+    Node* effect_not_iterator = effect;
+    Node* control_not_iterator = if_not_iterator;
+    Node* call_runtime = effect_not_iterator = control_not_iterator =
+        graph()->NewNode(
+            javascript()->CallRuntime(Runtime::kThrowIteratorError, 1),
+            receiver, context, frame_state, effect_not_iterator,
+            control_not_iterator);
+    // Merge the exception path for CallRuntime.
+    if (has_exception_node) {
+      Node* if_exception = graph()->NewNode(
+          common()->IfException(), effect_not_iterator, control_not_iterator);
+      if_exception_merge->ReplaceInput(exception_node_index, if_exception);
+      if_exception_phi->ReplaceInput(exception_node_index, if_exception);
+      if_exception_effect_phi->ReplaceInput(exception_node_index, if_exception);
+      exception_node_index++;
+      control_not_iterator =
+          graph()->NewNode(common()->IfSuccess(), control_not_iterator);
+    }
+    Node* throw_node =
+        graph()->NewNode(common()->Throw(), call_runtime, control_not_iterator);
+    MergeControlToEnd(graph(), common(), throw_node);
+  }
+
+  control = graph()->NewNode(common()->IfFalse(), branch);
+
   // Eager deopt of call iterator property
   Node* parameters[] = {receiver, load_property, call_slot, call_feedback};
   Node* eager_deopt_frame_state = CreateStubBuiltinContinuationFrameState(
@@ -1995,7 +2019,7 @@ Reduction JSNativeContextSpecialization::ReduceJSGetIterator(Node* node) {
     }
     Node* throw_node =
         graph()->NewNode(common()->Throw(), call_runtime, control_not_receiver);
-    NodeProperties::MergeControlToEnd(graph(), common(), throw_node);
+    MergeControlToEnd(graph(), common(), throw_node);
   }
   Node* if_receiver = graph()->NewNode(common()->IfTrue(), branch_node);
   ReplaceWithValue(node, call_property, effect, if_receiver);
@@ -2086,7 +2110,7 @@ void JSNativeContextSpecialization::RemoveImpossibleMaps(
   if (root_map.has_value() && !root_map->is_abandoned_prototype_map()) {
     maps->erase(
         std::remove_if(maps->begin(), maps->end(),
-                       [root_map, this](const MapRef& map) {
+                       [root_map, this](MapRef map) {
                          return map.is_abandoned_prototype_map() ||
                                 !map.FindRootMap(broker()).equals(*root_map);
                        }),
@@ -2187,10 +2211,11 @@ Reduction JSNativeContextSpecialization::ReduceElementAccess(
         // If the {receiver_map} has a prototype and its elements backing
         // store is either holey, or we have a potentially growing store,
         // then we need to check that all prototypes have stable maps with
-        // fast elements (and we need to guard against changes to that below).
+        // no element accessors and no throwing behavior for elements (and we
+        // need to guard against changes to that below).
         if ((IsHoleyOrDictionaryElementsKind(receiver_map.elements_kind()) ||
              IsGrowStoreMode(feedback.keyed_mode().store_mode())) &&
-            !receiver_map.HasOnlyStablePrototypesWithFastElements(
+            !receiver_map.PrototypesElementsDoNotHaveAccessorsOrThrow(
                 broker(), &prototype_maps)) {
           return NoChange();
         }
@@ -2204,7 +2229,7 @@ Reduction JSNativeContextSpecialization::ReduceElementAccess(
         }
       }
     }
-    for (MapRef const& prototype_map : prototype_maps) {
+    for (MapRef prototype_map : prototype_maps) {
       dependencies()->DependOnStableMap(prototype_map);
     }
   } else if (access_mode == AccessMode::kHas) {
@@ -2233,7 +2258,7 @@ Reduction JSNativeContextSpecialization::ReduceElementAccess(
                                           transition_target.elements_kind())
                   ? ElementsTransition::kFastTransition
                   : ElementsTransition::kSlowTransition,
-              transition_source.object(), transition_target.object())),
+              transition_source, transition_target)),
           receiver, effect, control);
     }
 
@@ -2285,7 +2310,7 @@ Reduction JSNativeContextSpecialization::ReduceElementAccess(
                                             transition_target.elements_kind())
                     ? ElementsTransition::kFastTransition
                     : ElementsTransition::kSlowTransition,
-                transition_source.object(), transition_target.object())),
+                transition_source, transition_target)),
             receiver, this_effect, this_control);
       }
 
@@ -2300,10 +2325,8 @@ Reduction JSNativeContextSpecialization::ReduceElementAccess(
         fallthrough_control = nullptr;
       } else {
         // Explicitly branch on the {receiver_maps}.
-        ZoneHandleSet<Map> maps;
-        for (MapRef map : receiver_maps) {
-          maps.insert(map.object(), graph()->zone());
-        }
+        ZoneRefSet<Map> maps(receiver_maps.begin(), receiver_maps.end(),
+                             graph()->zone());
         Node* check = this_effect =
             graph()->NewNode(simplified()->CompareMaps(maps), receiver,
                              this_effect, fallthrough_control);
@@ -2364,10 +2387,7 @@ Reduction JSNativeContextSpecialization::ReduceElementLoadFromHeapConstant(
 
   HeapObjectMatcher mreceiver(receiver);
   HeapObjectRef receiver_ref = mreceiver.Ref(broker());
-  if (receiver_ref.map(broker()).oddball_type(broker()) == OddballType::kHole ||
-      receiver_ref.map(broker()).oddball_type(broker()) == OddballType::kNull ||
-      receiver_ref.map(broker()).oddball_type(broker()) ==
-          OddballType::kUndefined ||
+  if (receiver_ref.IsNull() || receiver_ref.IsUndefined() ||
       // The 'in' operator throws a TypeError on primitive values.
       (receiver_ref.IsString() && access_mode == AccessMode::kHas)) {
     return NoChange();
@@ -2494,9 +2514,7 @@ Reduction JSNativeContextSpecialization::ReduceEagerDeoptimize(
   Node* deoptimize =
       graph()->NewNode(common()->Deoptimize(reason, FeedbackSource()),
                        frame_state, effect, control);
-  // TODO(bmeurer): This should be on the AdvancedReducer somehow.
-  NodeProperties::MergeControlToEnd(graph(), common(), deoptimize);
-  Revisit(graph()->end());
+  MergeControlToEnd(graph(), common(), deoptimize);
   node->TrimInputCount(0);
   NodeProperties::ChangeOp(node, common()->Dead());
   return Changed(node);
@@ -2737,7 +2755,7 @@ void JSNativeContextSpecialization::InlinePropertySetterCall(
 Node* JSNativeContextSpecialization::InlineApiCall(
     Node* receiver, Node* api_holder, Node* frame_state, Node* value,
     Node** effect, Node** control,
-    FunctionTemplateInfoRef const& function_template_info) {
+    FunctionTemplateInfoRef function_template_info) {
   if (!function_template_info.call_code(broker()).has_value()) {
     TRACE_BROKER_MISSING(broker(), "call code for function template info "
                                        << function_template_info);
@@ -2748,8 +2766,11 @@ Node* JSNativeContextSpecialization::InlineApiCall(
 
   // Only setters have a value.
   int const argc = value == nullptr ? 0 : 1;
-  // The stub always expects the receiver as the first param on the stack.
-  Callable call_api_callback = CodeFactory::CallApiCallback(isolate());
+  // The builtin always expects the receiver as the first param on the stack.
+  bool no_profiling = broker()->dependencies()->DependOnNoProfilingProtector();
+  Callable call_api_callback = Builtins::CallableFor(
+      isolate(), no_profiling ? Builtin::kCallApiCallbackOptimizedNoProfiling
+                              : Builtin::kCallApiCallbackOptimized);
   CallInterfaceDescriptor call_interface_descriptor =
       call_api_callback.descriptor();
   auto call_descriptor = Linkage::GetStubCallDescriptor(
@@ -2759,7 +2780,7 @@ Node* JSNativeContextSpecialization::InlineApiCall(
       CallDescriptor::kNeedsFrameState);
 
   Node* data = jsgraph()->Constant(call_handler_info.data(broker()), broker());
-  ApiFunction function(call_handler_info.callback());
+  ApiFunction function(call_handler_info.callback(broker()));
   Node* function_reference =
       graph()->NewNode(common()->ExternalConstant(ExternalReference::Create(
           &function, ExternalReference::DIRECT_API_CALL)));
@@ -2787,8 +2808,8 @@ Node* JSNativeContextSpecialization::InlineApiCall(
 base::Optional<JSNativeContextSpecialization::ValueEffectControl>
 JSNativeContextSpecialization::BuildPropertyLoad(
     Node* lookup_start_object, Node* receiver, Node* context, Node* frame_state,
-    Node* effect, Node* control, NameRef const& name,
-    ZoneVector<Node*>* if_exceptions, PropertyAccessInfo const& access_info) {
+    Node* effect, Node* control, NameRef name, ZoneVector<Node*>* if_exceptions,
+    PropertyAccessInfo const& access_info) {
   // Determine actual holder and perform prototype chain checks.
   OptionalJSObjectRef holder = access_info.holder();
   if (holder.has_value() && !access_info.HasDictionaryHolder()) {
@@ -2853,15 +2874,14 @@ JSNativeContextSpecialization::BuildPropertyTest(
         holder.value());
   }
 
-  Node* value = access_info.IsNotFound() ? jsgraph()->FalseConstant()
-                                         : jsgraph()->TrueConstant();
-  return ValueEffectControl(value, effect, control);
+  return ValueEffectControl(
+      jsgraph()->BooleanConstant(!access_info.IsNotFound()), effect, control);
 }
 
 base::Optional<JSNativeContextSpecialization::ValueEffectControl>
 JSNativeContextSpecialization::BuildPropertyAccess(
     Node* lookup_start_object, Node* receiver, Node* value, Node* context,
-    Node* frame_state, Node* effect, Node* control, NameRef const& name,
+    Node* frame_state, Node* effect, Node* control, NameRef name,
     ZoneVector<Node*>* if_exceptions, PropertyAccessInfo const& access_info,
     AccessMode access_mode) {
   switch (access_mode) {
@@ -2886,7 +2906,7 @@ JSNativeContextSpecialization::BuildPropertyAccess(
 JSNativeContextSpecialization::ValueEffectControl
 JSNativeContextSpecialization::BuildPropertyStore(
     Node* receiver, Node* value, Node* context, Node* frame_state, Node* effect,
-    Node* control, NameRef const& name, ZoneVector<Node*>* if_exceptions,
+    Node* control, NameRef name, ZoneVector<Node*>* if_exceptions,
     PropertyAccessInfo const& access_info, AccessMode access_mode) {
   // Determine actual holder and perform prototype chain checks.
   PropertyAccessBuilder access_builder(jsgraph(), broker());
@@ -2934,7 +2954,7 @@ JSNativeContextSpecialization::BuildPropertyStore(
         kTaggedBase,
         field_index.offset(),
         name.object(),
-        MaybeHandle<Map>(),
+        OptionalMapRef(),
         field_type,
         MachineType::TypeForRepresentation(field_representation),
         kFullWriteBarrier,
@@ -2967,7 +2987,7 @@ JSNativeContextSpecialization::BuildPropertyStore(
               kTaggedBase,
               field_index.offset(),
               name.object(),
-              MaybeHandle<Map>(),
+              OptionalMapRef(),
               Type::OtherInternal(),
               MachineType::TaggedPointer(),
               kPointerWriteBarrier,
@@ -2996,11 +3016,10 @@ JSNativeContextSpecialization::BuildPropertyStore(
           OptionalMapRef field_map = access_info.field_map();
           if (field_map.has_value()) {
             // Emit a map check for the value.
-            effect =
-                graph()->NewNode(simplified()->CheckMaps(
-                                     CheckMapsFlag::kNone,
-                                     ZoneHandleSet<Map>(field_map->object())),
-                                 value, effect, control);
+            effect = graph()->NewNode(
+                simplified()->CheckMaps(CheckMapsFlag::kNone,
+                                        ZoneRefSet<Map>(*field_map)),
+                value, effect, control);
           } else {
             // Ensure that {value} is a HeapObject.
             value = effect = graph()->NewNode(simplified()->CheckHeapObject(),
@@ -3016,6 +3035,7 @@ JSNativeContextSpecialization::BuildPropertyStore(
       case MachineRepresentation::kBit:
       case MachineRepresentation::kCompressedPointer:
       case MachineRepresentation::kCompressed:
+      case MachineRepresentation::kIndirectPointer:
       case MachineRepresentation::kSandboxedPointer:
       case MachineRepresentation::kWord8:
       case MachineRepresentation::kWord16:
@@ -3034,6 +3054,16 @@ JSNativeContextSpecialization::BuildPropertyStore(
       // with this transitioning store.
       MapRef transition_map_ref = transition_map.value();
       MapRef original_map = transition_map_ref.GetBackPointer(broker()).AsMap();
+      if (!field_index.is_inobject()) {
+        // If slack tracking ends after this compilation started but before it's
+        // finished, then we could {original_map} could be out-of-sync with
+        // {transition_map_ref}. In particular, its UnusedPropertyFields could
+        // be non-zero, which would lead us to not extend the property backing
+        // store, while the underlying Map has actually zero
+        // UnusedPropertyFields. Thus, we install a dependency on {orininal_map}
+        // now, so that if such a situation happens, we'll throw away the code.
+        dependencies()->DependOnNoSlackTrackingChange(original_map);
+      }
       if (original_map.UnusedPropertyFields() == 0) {
         DCHECK(!field_index.is_inobject());
 
@@ -3159,11 +3189,10 @@ JSNativeContextSpecialization::BuildElementAccess(
   if (IsAnyStore(keyed_mode.access_mode()) &&
       IsSmiOrObjectElementsKind(elements_kind) &&
       !IsCOWHandlingStoreMode(keyed_mode.store_mode())) {
-    effect =
-        graph()->NewNode(simplified()->CheckMaps(
-                             CheckMapsFlag::kNone,
-                             ZoneHandleSet<Map>(factory()->fixed_array_map())),
-                         elements, effect, control);
+    effect = graph()->NewNode(
+        simplified()->CheckMaps(CheckMapsFlag::kNone,
+                                ZoneRefSet<Map>(broker()->fixed_array_map())),
+        elements, effect, control);
   }
 
   // Check if the {receiver} is a JSArray.
@@ -3221,7 +3250,7 @@ JSNativeContextSpecialization::BuildElementAccess(
     // of holey backing stores.
     if (IsHoleyElementsKind(elements_kind)) {
       element_access.type =
-          Type::Union(element_type, Type::Hole(), graph()->zone());
+          Type::Union(element_type, Type::TheHole(), graph()->zone());
     }
     if (elements_kind == HOLEY_ELEMENTS ||
         elements_kind == HOLEY_SMI_ELEMENTS) {
@@ -3243,11 +3272,14 @@ JSNativeContextSpecialization::BuildElementAccess(
         // Do a real bounds check against {length}. This is in order to
         // protect against a potential typer bug leading to the elimination of
         // the NumberLessThan above.
-        index = etrue = graph()->NewNode(
-            simplified()->CheckBounds(
-                FeedbackSource(), CheckBoundsFlag::kConvertStringAndMinusZero |
-                                      CheckBoundsFlag::kAbortOnOutOfBounds),
-            index, length, etrue, if_true);
+        if (v8_flags.turbo_typer_hardening) {
+          index = etrue =
+              graph()->NewNode(simplified()->CheckBounds(
+                                   FeedbackSource(),
+                                   CheckBoundsFlag::kConvertStringAndMinusZero |
+                                       CheckBoundsFlag::kAbortOnOutOfBounds),
+                               index, length, etrue, if_true);
+        }
 
         // Perform the actual load
         vtrue = etrue =
@@ -3334,7 +3366,7 @@ JSNativeContextSpecialization::BuildElementAccess(
       Node* vfalse = jsgraph()->FalseConstant();
 
       element_access.type =
-          Type::Union(element_type, Type::Hole(), graph()->zone());
+          Type::Union(element_type, Type::TheHole(), graph()->zone());
 
       if (elements_kind == HOLEY_ELEMENTS ||
           elements_kind == HOLEY_SMI_ELEMENTS) {
@@ -3423,15 +3455,21 @@ JSNativeContextSpecialization::BuildElementAccess(
       // the (potential) backing store growth would normalize and thus
       // the elements kind of the {receiver} would change to slow mode.
       //
-      // For PACKED_*_ELEMENTS the {index} must be within the range
+      // For JSArray PACKED_*_ELEMENTS the {index} must be within the range
       // [0,length+1[ to be valid. In case {index} equals {length},
       // the {receiver} will be extended, but kept packed.
+      //
+      // Non-JSArray PACKED_*_ELEMENTS always grow by adding holes because they
+      // lack the magical length property, which requires a map transition.
+      // So we can assume that this did not happen if we did not see this map.
       Node* limit =
           IsHoleyElementsKind(elements_kind)
               ? graph()->NewNode(simplified()->NumberAdd(), elements_length,
                                  jsgraph()->Constant(JSObject::kMaxGap))
-              : graph()->NewNode(simplified()->NumberAdd(), length,
-                                 jsgraph()->OneConstant());
+          : receiver_is_jsarray
+              ? graph()->NewNode(simplified()->NumberAdd(), length,
+                                 jsgraph()->OneConstant())
+              : elements_length;
       index = effect = graph()->NewNode(
           simplified()->CheckBounds(
               FeedbackSource(), CheckBoundsFlag::kConvertStringAndMinusZero),
@@ -3662,12 +3700,14 @@ JSNativeContextSpecialization::
           // Do a real bounds check against {length}. This is in order to
           // protect against a potential typer bug leading to the elimination
           // of the NumberLessThan above.
-          index = etrue =
-              graph()->NewNode(simplified()->CheckBounds(
-                                   FeedbackSource(),
-                                   CheckBoundsFlag::kConvertStringAndMinusZero |
-                                       CheckBoundsFlag::kAbortOnOutOfBounds),
-                               index, length, etrue, if_true);
+          if (v8_flags.turbo_typer_hardening) {
+            index = etrue = graph()->NewNode(
+                simplified()->CheckBounds(
+                    FeedbackSource(),
+                    CheckBoundsFlag::kConvertStringAndMinusZero |
+                        CheckBoundsFlag::kAbortOnOutOfBounds),
+                index, length, etrue, if_true);
+          }
 
           // Perform the actual load
           vtrue = etrue = graph()->NewNode(
@@ -3742,12 +3782,14 @@ JSNativeContextSpecialization::
           // Do a real bounds check against {length}. This is in order to
           // protect against a potential typer bug leading to the elimination
           // of the NumberLessThan above.
-          index = etrue =
-              graph()->NewNode(simplified()->CheckBounds(
-                                   FeedbackSource(),
-                                   CheckBoundsFlag::kConvertStringAndMinusZero |
-                                       CheckBoundsFlag::kAbortOnOutOfBounds),
-                               index, length, etrue, if_true);
+          if (v8_flags.turbo_typer_hardening) {
+            index = etrue = graph()->NewNode(
+                simplified()->CheckBounds(
+                    FeedbackSource(),
+                    CheckBoundsFlag::kConvertStringAndMinusZero |
+                        CheckBoundsFlag::kAbortOnOutOfBounds),
+                index, length, etrue, if_true);
+          }
 
           // Perform the actual store.
           etrue = graph()->NewNode(
@@ -3822,11 +3864,14 @@ Node* JSNativeContextSpecialization::BuildIndexedStringLoad(
     // Do a real bounds check against {length}. This is in order to protect
     // against a potential typer bug leading to the elimination of the
     // NumberLessThan above.
-    Node* etrue = index = graph()->NewNode(
-        simplified()->CheckBounds(FeedbackSource(),
-                                  CheckBoundsFlag::kConvertStringAndMinusZero |
-                                      CheckBoundsFlag::kAbortOnOutOfBounds),
-        index, length, *effect, if_true);
+    Node* etrue = *effect;
+    if (v8_flags.turbo_typer_hardening) {
+      etrue = index = graph()->NewNode(
+          simplified()->CheckBounds(
+              FeedbackSource(), CheckBoundsFlag::kConvertStringAndMinusZero |
+                                    CheckBoundsFlag::kAbortOnOutOfBounds),
+          index, length, etrue, if_true);
+    }
     Node* vtrue = etrue = graph()->NewNode(simplified()->StringCharCodeAt(),
                                            receiver, index, etrue, if_true);
     vtrue = graph()->NewNode(simplified()->StringFromSingleCharCode(), vtrue);
@@ -3855,7 +3900,7 @@ Node* JSNativeContextSpecialization::BuildIndexedStringLoad(
 }
 
 Node* JSNativeContextSpecialization::BuildExtendPropertiesBackingStore(
-    const MapRef& map, Node* properties, Node* effect, Node* control) {
+    MapRef map, Node* properties, Node* effect, Node* control) {
   // TODO(bmeurer/jkummerow): Property deletions can undo map transitions
   // while keeping the backing store around, meaning that even though the
   // map might believe that objects have no unused property fields, there
@@ -3865,8 +3910,7 @@ Node* JSNativeContextSpecialization::BuildExtendPropertiesBackingStore(
   // difficult for escape analysis to get rid of the backing stores used
   // for intermediate states of chains of property additions. That makes
   // it unclear what the best approach is here.
-  DCHECK_EQ(0, map.UnusedPropertyFields());
-  // Compute the length of the old {properties} and the new properties.
+  DCHECK_EQ(map.UnusedPropertyFields(), 0);
   int length = map.NextFreePropertyIndex() - map.GetInObjectProperties();
   int new_length = length + JSObject::kFieldsAdded;
   // Collect the field values from the {properties}.
@@ -3922,7 +3966,7 @@ Node* JSNativeContextSpecialization::BuildExtendPropertiesBackingStore(
   return a.Finish();
 }
 
-Node* JSNativeContextSpecialization::BuildCheckEqualsName(NameRef const& name,
+Node* JSNativeContextSpecialization::BuildCheckEqualsName(NameRef name,
                                                           Node* value,
                                                           Node* effect,
                                                           Node* control) {
@@ -3953,21 +3997,21 @@ bool JSNativeContextSpecialization::CanTreatHoleAsUndefined(
 
 bool JSNativeContextSpecialization::InferMaps(Node* object, Effect effect,
                                               ZoneVector<MapRef>* maps) const {
-  ZoneRefUnorderedSet<MapRef> map_set(broker()->zone());
+  ZoneRefSet<Map> map_set;
   NodeProperties::InferMapsResult result =
       NodeProperties::InferMapsUnsafe(broker(), object, effect, &map_set);
   if (result == NodeProperties::kReliableMaps) {
-    for (const MapRef& map : map_set) {
+    for (MapRef map : map_set) {
       maps->push_back(map);
     }
     return true;
   } else if (result == NodeProperties::kUnreliableMaps) {
     // For untrusted maps, we can still use the information
     // if the maps are stable.
-    for (const MapRef& map : map_set) {
+    for (MapRef map : map_set) {
       if (!map.is_stable()) return false;
     }
-    for (const MapRef& map : map_set) {
+    for (MapRef map : map_set) {
       maps->push_back(map);
     }
     return true;
diff --git a/deps/v8/src/compiler/js-native-context-specialization.h b/deps/v8/src/compiler/js-native-context-specialization.h
index 0d8b9904b1f55e..ec855d0cac8075 100644
--- a/deps/v8/src/compiler/js-native-context-specialization.h
+++ b/deps/v8/src/compiler/js-native-context-specialization.h
@@ -111,9 +111,9 @@ class V8_EXPORT_PRIVATE JSNativeContextSpecialization final
       Node* node, Node* value, MegaDOMPropertyAccessFeedback const& feedback,
       FeedbackSource const& source);
   Reduction ReduceGlobalAccess(Node* node, Node* lookup_start_object,
-                               Node* receiver, Node* value, NameRef const& name,
+                               Node* receiver, Node* value, NameRef name,
                                AccessMode access_mode, Node* key,
-                               PropertyCellRef const& property_cell,
+                               PropertyCellRef property_cell,
                                Node* effect = nullptr);
   Reduction ReduceElementLoadFromHeapConstant(Node* node, Node* key,
                                               AccessMode access_mode,
@@ -150,18 +150,18 @@ class V8_EXPORT_PRIVATE JSNativeContextSpecialization final
   // property access couldn't be built.
   base::Optional<ValueEffectControl> BuildPropertyAccess(
       Node* lookup_start_object, Node* receiver, Node* value, Node* context,
-      Node* frame_state, Node* effect, Node* control, NameRef const& name,
+      Node* frame_state, Node* effect, Node* control, NameRef name,
       ZoneVector<Node*>* if_exceptions, PropertyAccessInfo const& access_info,
       AccessMode access_mode);
   base::Optional<ValueEffectControl> BuildPropertyLoad(
       Node* lookup_start_object, Node* receiver, Node* context,
-      Node* frame_state, Node* effect, Node* control, NameRef const& name,
+      Node* frame_state, Node* effect, Node* control, NameRef name,
       ZoneVector<Node*>* if_exceptions, PropertyAccessInfo const& access_info);
 
   ValueEffectControl BuildPropertyStore(Node* receiver, Node* value,
                                         Node* context, Node* frame_state,
                                         Node* effect, Node* control,
-                                        NameRef const& name,
+                                        NameRef name,
                                         ZoneVector<Node*>* if_exceptions,
                                         PropertyAccessInfo const& access_info,
                                         AccessMode access_mode);
@@ -184,7 +184,7 @@ class V8_EXPORT_PRIVATE JSNativeContextSpecialization final
                                 PropertyAccessInfo const& access_info);
   Node* InlineApiCall(Node* receiver, Node* api_holder, Node* frame_state,
                       Node* value, Node** effect, Node** control,
-                      FunctionTemplateInfoRef const& function_template_info);
+                      FunctionTemplateInfoRef function_template_info);
 
   // Construct the appropriate subgraph for element access.
   ValueEffectControl BuildElementAccess(Node* receiver, Node* index,
@@ -203,12 +203,12 @@ class V8_EXPORT_PRIVATE JSNativeContextSpecialization final
                                KeyedAccessLoadMode load_mode);
 
   // Construct appropriate subgraph to extend properties backing store.
-  Node* BuildExtendPropertiesBackingStore(const MapRef& map, Node* properties,
+  Node* BuildExtendPropertiesBackingStore(MapRef map, Node* properties,
                                           Node* effect, Node* control);
 
   // Construct appropriate subgraph to check that the {value} matches
   // the previously recorded {name} feedback.
-  Node* BuildCheckEqualsName(NameRef const& name, Node* value, Node* effect,
+  Node* BuildCheckEqualsName(NameRef name, Node* value, Node* effect,
                              Node* control);
 
   // Concatenates {left} and {right}.
@@ -249,7 +249,7 @@ class V8_EXPORT_PRIVATE JSNativeContextSpecialization final
     kMayBeInPrototypeChain
   };
   InferHasInPrototypeChainResult InferHasInPrototypeChain(
-      Node* receiver, Effect effect, HeapObjectRef const& prototype);
+      Node* receiver, Effect effect, HeapObjectRef prototype);
 
   Node* BuildLoadPrototypeFromObject(Node* object, Node* effect, Node* control);
 
diff --git a/deps/v8/src/compiler/js-operator.cc b/deps/v8/src/compiler/js-operator.cc
index 34f6e9d7b08e71..a9a850a21b60c1 100644
--- a/deps/v8/src/compiler/js-operator.cc
+++ b/deps/v8/src/compiler/js-operator.cc
@@ -10,6 +10,7 @@
 #include "src/compiler/js-graph.h"
 #include "src/compiler/js-heap-broker.h"
 #include "src/compiler/node-matchers.h"
+#include "src/compiler/operator-properties.h"
 #include "src/compiler/operator.h"
 #include "src/handles/handles-inl.h"
 #include "src/objects/objects-inl.h"
@@ -942,9 +943,11 @@ const Operator* JSOperatorBuilder::CallRuntime(
 #if V8_ENABLE_WEBASSEMBLY
 const Operator* JSOperatorBuilder::CallWasm(
     const wasm::WasmModule* wasm_module,
-    const wasm::FunctionSig* wasm_signature, int function_index,
-    wasm::NativeModule* native_module, FeedbackSource const& feedback) {
-  JSWasmCallParameters parameters(wasm_module, wasm_signature, function_index,
+    const wasm::FunctionSig* wasm_signature, int wasm_function_index,
+    SharedFunctionInfoRef shared_fct_info, wasm::NativeModule* native_module,
+    FeedbackSource const& feedback) {
+  JSWasmCallParameters parameters(wasm_module, wasm_signature,
+                                  wasm_function_index, shared_fct_info,
                                   native_module, feedback);
   return zone()->New<Operator1<JSWasmCallParameters>>(
       IrOpcode::kJSWasmCall, Operator::kNoProperties,  // opcode
@@ -1002,7 +1005,7 @@ const Operator* JSOperatorBuilder::ConstructWithSpread(
       parameters);                                                // parameter
 }
 
-const Operator* JSOperatorBuilder::LoadNamed(const NameRef& name,
+const Operator* JSOperatorBuilder::LoadNamed(NameRef name,
                                              const FeedbackSource& feedback) {
   static constexpr int kObject = 1;
   static constexpr int kFeedbackVector = 1;
@@ -1016,7 +1019,7 @@ const Operator* JSOperatorBuilder::LoadNamed(const NameRef& name,
 }
 
 const Operator* JSOperatorBuilder::LoadNamedFromSuper(
-    const NameRef& name, const FeedbackSource& feedback) {
+    NameRef name, const FeedbackSource& feedback) {
   static constexpr int kReceiver = 1;
   static constexpr int kHomeObject = 1;
   static constexpr int kFeedbackVector = 1;
@@ -1109,8 +1112,7 @@ int RestoreRegisterIndexOf(const Operator* op) {
 }
 
 const Operator* JSOperatorBuilder::SetNamedProperty(
-    LanguageMode language_mode, const NameRef& name,
-    FeedbackSource const& feedback) {
+    LanguageMode language_mode, NameRef name, FeedbackSource const& feedback) {
   static constexpr int kObject = 1;
   static constexpr int kValue = 1;
   static constexpr int kFeedbackVector = 1;
@@ -1144,7 +1146,7 @@ const Operator* JSOperatorBuilder::DefineKeyedOwnProperty(
 }
 
 const Operator* JSOperatorBuilder::DefineNamedOwnProperty(
-    const NameRef& name, FeedbackSource const& feedback) {
+    NameRef name, FeedbackSource const& feedback) {
   static constexpr int kObject = 1;
   static constexpr int kValue = 1;
   static constexpr int kFeedbackVector = 1;
@@ -1171,7 +1173,7 @@ const Operator* JSOperatorBuilder::CreateGeneratorObject() {
       2, 1, 1, 1, 1, 0);                                            // counts
 }
 
-const Operator* JSOperatorBuilder::LoadGlobal(const NameRef& name,
+const Operator* JSOperatorBuilder::LoadGlobal(NameRef name,
                                               const FeedbackSource& feedback,
                                               TypeofMode typeof_mode) {
   static constexpr int kFeedbackVector = 1;
@@ -1185,7 +1187,7 @@ const Operator* JSOperatorBuilder::LoadGlobal(const NameRef& name,
 }
 
 const Operator* JSOperatorBuilder::StoreGlobal(LanguageMode language_mode,
-                                               const NameRef& name,
+                                               NameRef name,
                                                const FeedbackSource& feedback) {
   static constexpr int kValue = 1;
   static constexpr int kFeedbackVector = 1;
@@ -1304,7 +1306,7 @@ const Operator* JSOperatorBuilder::CreateCollectionIterator(
 }
 
 const Operator* JSOperatorBuilder::CreateBoundFunction(size_t arity,
-                                                       const MapRef& map) {
+                                                       MapRef map) {
   // bound_target_function, bound_this, arg1, ..., argN
   int const value_input_count = static_cast<int>(arity) + 2;
   CreateBoundFunctionParameters parameters(arity, map);
@@ -1316,7 +1318,7 @@ const Operator* JSOperatorBuilder::CreateBoundFunction(size_t arity,
 }
 
 const Operator* JSOperatorBuilder::CreateClosure(
-    const SharedFunctionInfoRef& shared_info, const CodeRef& code,
+    SharedFunctionInfoRef shared_info, CodeRef code,
     AllocationType allocation) {
   static constexpr int kFeedbackCell = 1;
   static constexpr int kArity = kFeedbackCell;
@@ -1329,8 +1331,8 @@ const Operator* JSOperatorBuilder::CreateClosure(
 }
 
 const Operator* JSOperatorBuilder::CreateLiteralArray(
-    const ArrayBoilerplateDescriptionRef& description,
-    FeedbackSource const& feedback, int literal_flags, int number_of_elements) {
+    ArrayBoilerplateDescriptionRef description, FeedbackSource const& feedback,
+    int literal_flags, int number_of_elements) {
   CreateLiteralParameters parameters(description, feedback, number_of_elements,
                                      literal_flags);
   return zone()->New<Operator1<CreateLiteralParameters>>(  // --
@@ -1363,7 +1365,7 @@ const Operator* JSOperatorBuilder::CreateArrayFromIterable() {
 }
 
 const Operator* JSOperatorBuilder::CreateLiteralObject(
-    const ObjectBoilerplateDescriptionRef& constant_properties,
+    ObjectBoilerplateDescriptionRef constant_properties,
     FeedbackSource const& feedback, int literal_flags,
     int number_of_properties) {
   CreateLiteralParameters parameters(constant_properties, feedback,
@@ -1377,8 +1379,8 @@ const Operator* JSOperatorBuilder::CreateLiteralObject(
 }
 
 const Operator* JSOperatorBuilder::GetTemplateObject(
-    const TemplateObjectDescriptionRef& description,
-    const SharedFunctionInfoRef& shared, FeedbackSource const& feedback) {
+    TemplateObjectDescriptionRef description, SharedFunctionInfoRef shared,
+    FeedbackSource const& feedback) {
   GetTemplateObjectParameters parameters(description, shared, feedback);
   return zone()->New<Operator1<GetTemplateObjectParameters>>(  // --
       IrOpcode::kJSGetTemplateObject,                          // opcode
@@ -1400,9 +1402,20 @@ const Operator* JSOperatorBuilder::CloneObject(FeedbackSource const& feedback,
 }
 
 const Operator* JSOperatorBuilder::StackCheck(StackCheckKind kind) {
+  Operator::Properties properties;
+  switch (kind) {
+    case StackCheckKind::kJSFunctionEntry:
+    case StackCheckKind::kCodeStubAssembler:
+    case StackCheckKind::kWasm:
+      properties = Operator::kNoProperties;
+      break;
+    case StackCheckKind::kJSIterationBody:
+      properties = Operator::kNoWrite;
+      break;
+  }
   return zone()->New<Operator1<StackCheckKind>>(  // --
       IrOpcode::kJSStackCheck,                    // opcode
-      Operator::kNoWrite,                         // properties
+      properties,                                 // properties
       "JSStackCheck",                             // name
       0, 1, 1, 0, 1, 2,                           // counts
       kind);                                      // parameter
@@ -1417,7 +1430,7 @@ const Operator* JSOperatorBuilder::CreateEmptyLiteralObject() {
 }
 
 const Operator* JSOperatorBuilder::CreateLiteralRegExp(
-    const StringRef& constant_pattern, FeedbackSource const& feedback,
+    StringRef constant_pattern, FeedbackSource const& feedback,
     int literal_flags) {
   CreateLiteralParameters parameters(constant_pattern, feedback, -1,
                                      literal_flags);
@@ -1430,7 +1443,7 @@ const Operator* JSOperatorBuilder::CreateLiteralRegExp(
 }
 
 const Operator* JSOperatorBuilder::CreateFunctionContext(
-    const ScopeInfoRef& scope_info, int slot_count, ScopeType scope_type) {
+    ScopeInfoRef scope_info, int slot_count, ScopeType scope_type) {
   CreateFunctionContextParameters parameters(scope_info, slot_count,
                                              scope_type);
   return zone()->New<Operator1<CreateFunctionContextParameters>>(   // --
@@ -1440,8 +1453,7 @@ const Operator* JSOperatorBuilder::CreateFunctionContext(
       parameters);                                                  // parameter
 }
 
-const Operator* JSOperatorBuilder::CreateCatchContext(
-    const ScopeInfoRef& scope_info) {
+const Operator* JSOperatorBuilder::CreateCatchContext(ScopeInfoRef scope_info) {
   return zone()->New<Operator1<ScopeInfoRef>>(
       IrOpcode::kJSCreateCatchContext, Operator::kNoProperties,  // opcode
       "JSCreateCatchContext",                                    // name
@@ -1449,8 +1461,7 @@ const Operator* JSOperatorBuilder::CreateCatchContext(
       ScopeInfoRef{scope_info});                                 // parameter
 }
 
-const Operator* JSOperatorBuilder::CreateWithContext(
-    const ScopeInfoRef& scope_info) {
+const Operator* JSOperatorBuilder::CreateWithContext(ScopeInfoRef scope_info) {
   return zone()->New<Operator1<ScopeInfoRef>>(
       IrOpcode::kJSCreateWithContext, Operator::kNoProperties,  // opcode
       "JSCreateWithContext",                                    // name
@@ -1458,8 +1469,7 @@ const Operator* JSOperatorBuilder::CreateWithContext(
       ScopeInfoRef{scope_info});                                // parameter
 }
 
-const Operator* JSOperatorBuilder::CreateBlockContext(
-    const ScopeInfoRef& scope_info) {
+const Operator* JSOperatorBuilder::CreateBlockContext(ScopeInfoRef scope_info) {
   return zone()->New<Operator1<ScopeInfoRef>>(                   // --
       IrOpcode::kJSCreateBlockContext, Operator::kNoProperties,  // opcode
       "JSCreateBlockContext",                                    // name
@@ -1474,19 +1484,17 @@ ScopeInfoRef ScopeInfoOf(const Operator* op) {
   return OpParameter<ScopeInfoRef>(op);
 }
 
-bool operator==(ScopeInfoRef const& lhs, ScopeInfoRef const& rhs) {
+bool operator==(ScopeInfoRef lhs, ScopeInfoRef rhs) {
   return lhs.object().location() == rhs.object().location();
 }
 
-bool operator!=(ScopeInfoRef const& lhs, ScopeInfoRef const& rhs) {
-  return !(lhs == rhs);
-}
+bool operator!=(ScopeInfoRef lhs, ScopeInfoRef rhs) { return !(lhs == rhs); }
 
-size_t hash_value(ScopeInfoRef const& ref) {
+size_t hash_value(ScopeInfoRef ref) {
   return reinterpret_cast<size_t>(ref.object().location());
 }
 
-std::ostream& operator<<(std::ostream& os, ScopeInfoRef const& ref) {
+std::ostream& operator<<(std::ostream& os, ScopeInfoRef ref) {
   return os << Brief(*ref.object());
 }
 
diff --git a/deps/v8/src/compiler/js-operator.h b/deps/v8/src/compiler/js-operator.h
index 53610ed52b80d2..4d675559a95961 100644
--- a/deps/v8/src/compiler/js-operator.h
+++ b/deps/v8/src/compiler/js-operator.h
@@ -15,6 +15,7 @@
 #include "src/compiler/opcodes.h"
 #include "src/compiler/operator-properties.h"
 #include "src/objects/feedback-cell.h"
+#include "src/objects/oddball.h"
 #include "src/runtime/runtime.h"
 
 namespace v8 {
@@ -362,8 +363,8 @@ V8_EXPORT_PRIVATE ContextAccess const& ContextAccessOf(Operator const*);
 // is used as a parameter by the JSCreateFunctionContext operator.
 class CreateFunctionContextParameters final {
  public:
-  CreateFunctionContextParameters(const ScopeInfoRef& scope_info,
-                                  int slot_count, ScopeType scope_type)
+  CreateFunctionContextParameters(ScopeInfoRef scope_info, int slot_count,
+                                  ScopeType scope_type)
       : scope_info_(scope_info),
         slot_count_(slot_count),
         scope_type_(scope_type) {}
@@ -394,8 +395,7 @@ CreateFunctionContextParameters const& CreateFunctionContextParametersOf(
 // Defines parameters for JSDefineNamedOwnProperty operator.
 class DefineNamedOwnPropertyParameters final {
  public:
-  DefineNamedOwnPropertyParameters(const NameRef& name,
-                                   FeedbackSource const& feedback)
+  DefineNamedOwnPropertyParameters(NameRef name, FeedbackSource const& feedback)
       : name_(name), feedback_(feedback) {}
 
   NameRef name() const { return name_; }
@@ -444,7 +444,7 @@ const FeedbackParameter& FeedbackParameterOf(const Operator* op);
 // used as a parameter by the JSLoadNamed and JSSetNamedProperty operators.
 class NamedAccess final {
  public:
-  NamedAccess(LanguageMode language_mode, const NameRef& name,
+  NamedAccess(LanguageMode language_mode, NameRef name,
               FeedbackSource const& feedback)
       : name_(name), feedback_(feedback), language_mode_(language_mode) {}
 
@@ -472,7 +472,7 @@ const NamedAccess& NamedAccessOf(const Operator* op);
 // used as a parameter by JSLoadGlobal operator.
 class LoadGlobalParameters final {
  public:
-  LoadGlobalParameters(const NameRef& name, const FeedbackSource& feedback,
+  LoadGlobalParameters(NameRef name, const FeedbackSource& feedback,
                        TypeofMode typeof_mode)
       : name_(name), feedback_(feedback), typeof_mode_(typeof_mode) {}
 
@@ -504,7 +504,7 @@ const LoadGlobalParameters& LoadGlobalParametersOf(const Operator* op);
 class StoreGlobalParameters final {
  public:
   StoreGlobalParameters(LanguageMode language_mode,
-                        const FeedbackSource& feedback, const NameRef& name)
+                        const FeedbackSource& feedback, NameRef name)
       : language_mode_(language_mode), name_(name), feedback_(feedback) {}
 
   LanguageMode language_mode() const { return language_mode_; }
@@ -643,7 +643,7 @@ const CreateCollectionIteratorParameters& CreateCollectionIteratorParametersOf(
 // This is used as parameter by JSCreateBoundFunction operators.
 class CreateBoundFunctionParameters final {
  public:
-  CreateBoundFunctionParameters(size_t arity, const MapRef& map)
+  CreateBoundFunctionParameters(size_t arity, MapRef map)
       : arity_(arity), map_(map) {}
 
   size_t arity() const { return arity_; }
@@ -671,8 +671,8 @@ const CreateBoundFunctionParameters& CreateBoundFunctionParametersOf(
 // used as a parameter by JSCreateClosure operators.
 class CreateClosureParameters final {
  public:
-  CreateClosureParameters(const SharedFunctionInfoRef& shared_info,
-                          const CodeRef& code, AllocationType allocation)
+  CreateClosureParameters(SharedFunctionInfoRef shared_info, CodeRef code,
+                          AllocationType allocation)
       : shared_info_(shared_info), code_(code), allocation_(allocation) {}
 
   SharedFunctionInfoRef shared_info() const { return shared_info_; }
@@ -699,8 +699,8 @@ const CreateClosureParameters& CreateClosureParametersOf(const Operator* op);
 
 class GetTemplateObjectParameters final {
  public:
-  GetTemplateObjectParameters(const TemplateObjectDescriptionRef& description,
-                              const SharedFunctionInfoRef& shared,
+  GetTemplateObjectParameters(TemplateObjectDescriptionRef description,
+                              SharedFunctionInfoRef shared,
                               FeedbackSource const& feedback)
       : description_(description), shared_(shared), feedback_(feedback) {}
 
@@ -732,7 +732,7 @@ const GetTemplateObjectParameters& GetTemplateObjectParametersOf(
 // JSCreateLiteralRegExp operators.
 class CreateLiteralParameters final {
  public:
-  CreateLiteralParameters(const HeapObjectRef& constant,
+  CreateLiteralParameters(HeapObjectRef constant,
                           FeedbackSource const& feedback, int length, int flags)
       : constant_(constant),
         feedback_(feedback),
@@ -843,11 +843,13 @@ class JSWasmCallParameters {
   explicit JSWasmCallParameters(const wasm::WasmModule* module,
                                 const wasm::FunctionSig* signature,
                                 int function_index,
+                                SharedFunctionInfoRef shared_fct_info,
                                 wasm::NativeModule* native_module,
                                 FeedbackSource const& feedback)
       : module_(module),
         signature_(signature),
         function_index_(function_index),
+        shared_fct_info_(shared_fct_info),
         native_module_(native_module),
         feedback_(feedback) {
     DCHECK_NOT_NULL(module);
@@ -857,6 +859,7 @@ class JSWasmCallParameters {
   const wasm::WasmModule* module() const { return module_; }
   const wasm::FunctionSig* signature() const { return signature_; }
   int function_index() const { return function_index_; }
+  SharedFunctionInfoRef shared_fct_info() const { return shared_fct_info_; }
   wasm::NativeModule* native_module() const { return native_module_; }
   FeedbackSource const& feedback() const { return feedback_; }
   int input_count() const;
@@ -866,6 +869,7 @@ class JSWasmCallParameters {
   const wasm::WasmModule* const module_;
   const wasm::FunctionSig* const signature_;
   int function_index_;
+  SharedFunctionInfoRef shared_fct_info_;
   wasm::NativeModule* native_module_;
   const FeedbackSource feedback_;
 };
@@ -885,12 +889,12 @@ int RestoreRegisterIndexOf(const Operator* op) V8_WARN_UNUSED_RESULT;
 
 ScopeInfoRef ScopeInfoOf(const Operator* op) V8_WARN_UNUSED_RESULT;
 
-bool operator==(ScopeInfoRef const&, ScopeInfoRef const&);
-bool operator!=(ScopeInfoRef const&, ScopeInfoRef const&);
+bool operator==(ScopeInfoRef, ScopeInfoRef);
+bool operator!=(ScopeInfoRef, ScopeInfoRef);
 
-size_t hash_value(ScopeInfoRef const&);
+size_t hash_value(ScopeInfoRef);
 
-V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, ScopeInfoRef const&);
+V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, ScopeInfoRef);
 
 // Interface for building JavaScript-level operators, e.g. directly from the
 // AST. Most operators have no parameters, thus can be globally shared for all
@@ -943,9 +947,9 @@ class V8_EXPORT_PRIVATE JSOperatorBuilder final
   const Operator* CreateArrayIterator(IterationKind);
   const Operator* CreateAsyncFunctionObject(int register_count);
   const Operator* CreateCollectionIterator(CollectionKind, IterationKind);
-  const Operator* CreateBoundFunction(size_t arity, const MapRef& map);
+  const Operator* CreateBoundFunction(size_t arity, MapRef map);
   const Operator* CreateClosure(
-      const SharedFunctionInfoRef& shared_info, const CodeRef& code,
+      SharedFunctionInfoRef shared_info, CodeRef code,
       AllocationType allocation = AllocationType::kYoung);
   const Operator* CreateIterResultObject();
   const Operator* CreateStringIterator();
@@ -953,26 +957,25 @@ class V8_EXPORT_PRIVATE JSOperatorBuilder final
   const Operator* CreateObject();
   const Operator* CreatePromise();
   const Operator* CreateTypedArray();
-  const Operator* CreateLiteralArray(
-      const ArrayBoilerplateDescriptionRef& constant,
-      FeedbackSource const& feedback, int literal_flags,
-      int number_of_elements);
+  const Operator* CreateLiteralArray(ArrayBoilerplateDescriptionRef constant,
+                                     FeedbackSource const& feedback,
+                                     int literal_flags, int number_of_elements);
   const Operator* CreateEmptyLiteralArray(FeedbackSource const& feedback);
   const Operator* CreateArrayFromIterable();
   const Operator* CreateEmptyLiteralObject();
-  const Operator* CreateLiteralObject(
-      const ObjectBoilerplateDescriptionRef& constant,
-      FeedbackSource const& feedback, int literal_flags,
-      int number_of_properties);
+  const Operator* CreateLiteralObject(ObjectBoilerplateDescriptionRef constant,
+                                      FeedbackSource const& feedback,
+                                      int literal_flags,
+                                      int number_of_properties);
   const Operator* CloneObject(FeedbackSource const& feedback,
                               int literal_flags);
-  const Operator* CreateLiteralRegExp(const StringRef& constant_pattern,
+  const Operator* CreateLiteralRegExp(StringRef constant_pattern,
                                       FeedbackSource const& feedback,
                                       int literal_flags);
 
-  const Operator* GetTemplateObject(
-      const TemplateObjectDescriptionRef& description,
-      const SharedFunctionInfoRef& shared, FeedbackSource const& feedback);
+  const Operator* GetTemplateObject(TemplateObjectDescriptionRef description,
+                                    SharedFunctionInfoRef shared,
+                                    FeedbackSource const& feedback);
 
   const Operator* CallForwardVarargs(size_t arity, uint32_t start_index);
   const Operator* Call(
@@ -1003,7 +1006,8 @@ class V8_EXPORT_PRIVATE JSOperatorBuilder final
 #if V8_ENABLE_WEBASSEMBLY
   const Operator* CallWasm(const wasm::WasmModule* wasm_module,
                            const wasm::FunctionSig* wasm_signature,
-                           int function_index,
+                           int wasm_function_index,
+                           SharedFunctionInfoRef shared_fct_info,
                            wasm::NativeModule* native_module,
                            FeedbackSource const& feedback);
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -1019,20 +1023,18 @@ class V8_EXPORT_PRIVATE JSOperatorBuilder final
       FeedbackSource const& feedback = FeedbackSource());
 
   const Operator* LoadProperty(FeedbackSource const& feedback);
-  const Operator* LoadNamed(const NameRef& name,
-                            FeedbackSource const& feedback);
-  const Operator* LoadNamedFromSuper(const NameRef& name,
+  const Operator* LoadNamed(NameRef name, FeedbackSource const& feedback);
+  const Operator* LoadNamedFromSuper(NameRef name,
                                      FeedbackSource const& feedback);
 
   const Operator* SetKeyedProperty(LanguageMode language_mode,
                                    FeedbackSource const& feedback);
   const Operator* DefineKeyedOwnProperty(LanguageMode language_mode,
                                          FeedbackSource const& feedback);
-  const Operator* SetNamedProperty(LanguageMode language_mode,
-                                   const NameRef& name,
+  const Operator* SetNamedProperty(LanguageMode language_mode, NameRef name,
                                    FeedbackSource const& feedback);
 
-  const Operator* DefineNamedOwnProperty(const NameRef& name,
+  const Operator* DefineNamedOwnProperty(NameRef name,
                                          FeedbackSource const& feedback);
   const Operator* DefineKeyedOwnPropertyInLiteral(
       const FeedbackSource& feedback);
@@ -1048,10 +1050,9 @@ class V8_EXPORT_PRIVATE JSOperatorBuilder final
 
   const Operator* CreateGeneratorObject();
 
-  const Operator* LoadGlobal(const NameRef& name,
-                             const FeedbackSource& feedback,
+  const Operator* LoadGlobal(NameRef name, const FeedbackSource& feedback,
                              TypeofMode typeof_mode = TypeofMode::kNotInside);
-  const Operator* StoreGlobal(LanguageMode language_mode, const NameRef& name,
+  const Operator* StoreGlobal(LanguageMode language_mode, NameRef name,
                               const FeedbackSource& feedback);
 
   const Operator* HasContextExtension(size_t depth);
@@ -1098,11 +1099,11 @@ class V8_EXPORT_PRIVATE JSOperatorBuilder final
   const Operator* RejectPromise();
   const Operator* ResolvePromise();
 
-  const Operator* CreateFunctionContext(const ScopeInfoRef& scope_info,
-                                        int slot_count, ScopeType scope_type);
-  const Operator* CreateCatchContext(const ScopeInfoRef& scope_info);
-  const Operator* CreateWithContext(const ScopeInfoRef& scope_info);
-  const Operator* CreateBlockContext(const ScopeInfoRef& scpope_info);
+  const Operator* CreateFunctionContext(ScopeInfoRef scope_info, int slot_count,
+                                        ScopeType scope_type);
+  const Operator* CreateCatchContext(ScopeInfoRef scope_info);
+  const Operator* CreateWithContext(ScopeInfoRef scope_info);
+  const Operator* CreateBlockContext(ScopeInfoRef scpope_info);
 
   const Operator* ObjectIsArray();
   const Operator* ParseInt();
@@ -1407,9 +1408,8 @@ class JSCallOrConstructNode : public JSNodeWrapperBase {
     DCHECK_GT(ArgumentCount(), 0);
     return Argument(ArgumentCount() - 1);
   }
-  TNode<Object> ArgumentOr(int i, Node* default_value) const {
-    return i < ArgumentCount() ? Argument(i)
-                               : TNode<Object>::UncheckedCast(default_value);
+  TNode<Object> ArgumentOr(int i, TNode<Object> default_value) const {
+    return i < ArgumentCount() ? Argument(i) : default_value;
   }
   TNode<Object> ArgumentOrUndefined(int i, JSGraph* jsgraph) const {
     return ArgumentOr(i, js_node_wrapper_utils::UndefinedConstant(jsgraph));
diff --git a/deps/v8/src/compiler/js-type-hint-lowering.h b/deps/v8/src/compiler/js-type-hint-lowering.h
index 99ad84f33649a7..a158fe20e4d9fd 100644
--- a/deps/v8/src/compiler/js-type-hint-lowering.h
+++ b/deps/v8/src/compiler/js-type-hint-lowering.h
@@ -172,7 +172,7 @@ class JSTypeHintLowering {
   JSGraph* jsgraph() const { return jsgraph_; }
   Isolate* isolate() const;
   Flags flags() const { return flags_; }
-  FeedbackVectorRef const& feedback_vector() const { return feedback_vector_; }
+  FeedbackVectorRef feedback_vector() const { return feedback_vector_; }
 
   JSHeapBroker* const broker_;
   JSGraph* const jsgraph_;
diff --git a/deps/v8/src/compiler/js-typed-lowering.cc b/deps/v8/src/compiler/js-typed-lowering.cc
index a26ee1a5178426..af7858445f7a9a 100644
--- a/deps/v8/src/compiler/js-typed-lowering.cc
+++ b/deps/v8/src/compiler/js-typed-lowering.cc
@@ -479,7 +479,8 @@ JSTypedLowering::JSTypedLowering(Editor* editor, JSGraph* jsgraph,
       empty_string_type_(
           Type::Constant(broker, broker->empty_string(), graph()->zone())),
       pointer_comparable_type_(
-          Type::Union(Type::Oddball(),
+          Type::Union(Type::Union(Type::BooleanOrNullOrUndefined(),
+                                  Type::Hole(), graph()->zone()),
                       Type::Union(Type::SymbolOrReceiver(), empty_string_type_,
                                   graph()->zone()),
                       graph()->zone())),
@@ -660,9 +661,7 @@ Reduction JSTypedLowering::ReduceJSAdd(Node* node) {
         // throw, making it impossible to return a successful completion in this
         // case. We simply connect the successful completion to the graph end.
         if_false = graph()->NewNode(common()->Throw(), efalse, if_false);
-        // TODO(bmeurer): This should be on the AdvancedReducer somehow.
-        NodeProperties::MergeControlToEnd(graph(), common(), if_false);
-        Revisit(graph()->end());
+        MergeControlToEnd(graph(), common(), if_false);
       }
       control = graph()->NewNode(common()->IfTrue(), branch);
       length = effect =
@@ -1280,7 +1279,7 @@ Reduction JSTypedLowering::ReduceJSHasInPrototypeChain(Node* node) {
   Node* eloop = effect =
       graph()->NewNode(common()->EffectPhi(2), effect, effect, loop);
   Node* terminate = graph()->NewNode(common()->Terminate(), eloop, loop);
-  NodeProperties::MergeControlToEnd(graph(), common(), terminate);
+  MergeControlToEnd(graph(), common(), terminate);
   Node* vloop = value = graph()->NewNode(
       common()->Phi(MachineRepresentation::kTagged, 2), value, value, loop);
   NodeProperties::SetType(vloop, Type::NonInternal());
@@ -1782,7 +1781,7 @@ Reduction JSTypedLowering::ReduceJSCall(Node* node) {
     // If this state changes during background compilation, the compilation
     // job will be aborted from the main thread (see
     // Debug::PrepareFunctionForDebugExecution()).
-    if (shared->HasBreakInfo()) return NoChange();
+    if (shared->HasBreakInfo(broker())) return NoChange();
 
     // Class constructors are callable, but [[Call]] will raise an exception.
     // See ES6 section 9.2.1 [[Call]] ( thisArgument, argumentsList ).
@@ -2031,7 +2030,7 @@ Reduction JSTypedLowering::ReduceJSForInPrepare(Node* node) {
       // Check that the {enumerator} is a Map.
       effect = graph()->NewNode(
           simplified()->CheckMaps(CheckMapsFlag::kNone,
-                                  ZoneHandleSet<Map>(factory()->meta_map())),
+                                  ZoneRefSet<Map>(broker()->meta_map())),
           enumerator, effect, control);
 
       // Load the enum cache from the {enumerator} map.
@@ -2058,7 +2057,7 @@ Reduction JSTypedLowering::ReduceJSForInPrepare(Node* node) {
     case ForInMode::kGeneric: {
       // Check if the {enumerator} is a Map or a FixedArray.
       Node* check = effect = graph()->NewNode(
-          simplified()->CompareMaps(ZoneHandleSet<Map>(factory()->meta_map())),
+          simplified()->CompareMaps(ZoneRefSet<Map>(broker()->meta_map())),
           enumerator, effect, control);
       Node* branch =
           graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control);
diff --git a/deps/v8/src/compiler/linear-scheduler.cc b/deps/v8/src/compiler/linear-scheduler.cc
index a8df8ac1e3107b..e376983a201f50 100644
--- a/deps/v8/src/compiler/linear-scheduler.cc
+++ b/deps/v8/src/compiler/linear-scheduler.cc
@@ -32,6 +32,9 @@ void LinearScheduler::ComputeControlLevel() {
     for (Edge const edge : node->use_edges()) {
       if (!NodeProperties::IsControlEdge(edge)) continue;
       Node* use = edge.from();
+      if (use->opcode() == IrOpcode::kLoopExit &&
+          node->opcode() == IrOpcode::kLoop)
+        continue;
       if (control_level_.find(use) == control_level_.end() &&
           use->opcode() != IrOpcode::kEnd) {
         SetControlLevel(use, level + 1);
diff --git a/deps/v8/src/compiler/linkage.cc b/deps/v8/src/compiler/linkage.cc
index 5f02ab86b07cf9..b3fdf3f1cb0b6e 100644
--- a/deps/v8/src/compiler/linkage.cc
+++ b/deps/v8/src/compiler/linkage.cc
@@ -72,7 +72,8 @@ std::ostream& operator<<(std::ostream& os, const CallDescriptor& d) {
 MachineSignature* CallDescriptor::GetMachineSignature(Zone* zone) const {
   size_t param_count = ParameterCount();
   size_t return_count = ReturnCount();
-  MachineType* types = zone->NewArray<MachineType>(param_count + return_count);
+  MachineType* types =
+      zone->AllocateArray<MachineType>(param_count + return_count);
   int current = 0;
   for (size_t i = 0; i < return_count; ++i) {
     types[current++] = GetReturnType(i);
@@ -249,10 +250,10 @@ CallDescriptor* Linkage::ComputeIncoming(Zone* zone,
   if (!info->closure().is_null()) {
     // If we are compiling a JS function, use a JS call descriptor,
     // plus the receiver.
-    SharedFunctionInfo shared = info->closure()->shared();
+    Tagged<SharedFunctionInfo> shared = info->closure()->shared();
     return GetJSCallDescriptor(
         zone, info->is_osr(),
-        shared.internal_formal_parameter_count_with_receiver(),
+        shared->internal_formal_parameter_count_with_receiver(),
         CallDescriptor::kCanUseRoots);
   }
   return nullptr;  // TODO(titzer): ?
@@ -381,7 +382,8 @@ CallDescriptor* Linkage::GetCEntryStubCallDescriptor(
 
 CallDescriptor* Linkage::GetJSCallDescriptor(Zone* zone, bool is_osr,
                                              int js_parameter_count,
-                                             CallDescriptor::Flags flags) {
+                                             CallDescriptor::Flags flags,
+                                             Operator::Properties properties) {
   const size_t return_count = 1;
   const size_t context_count = 1;
   const size_t new_target_count = 1;
@@ -416,20 +418,23 @@ CallDescriptor* Linkage::GetJSCallDescriptor(Zone* zone, bool is_osr,
   MachineType target_type = MachineType::AnyTagged();
   // When entering into an OSR function from unoptimized code the JSFunction
   // is not in a register, but it is on the stack in the marker spill slot.
-  LinkageLocation target_loc =
-      is_osr ? LinkageLocation::ForSavedCallerFunction()
-             : regloc(kJSFunctionRegister, MachineType::AnyTagged());
-  return zone->New<CallDescriptor>(     // --
-      CallDescriptor::kCallJSFunction,  // kind
-      target_type,                      // target MachineType
-      target_loc,                       // target location
-      locations.Build(),                // location_sig
-      js_parameter_count,               // stack_parameter_count
-      Operator::kNoProperties,          // properties
-      kNoCalleeSaved,                   // callee-saved
-      kNoCalleeSavedFp,                 // callee-saved fp
-      flags,                            // flags
-      "js-call");                       // debug name
+  // For kind == JSDescKind::kBuiltin, we should still use the regular
+  // kJSFunctionRegister, so that frame attribution for stack traces works.
+  LinkageLocation target_loc = is_osr
+                                   ? LinkageLocation::ForSavedCallerFunction()
+                                   : regloc(kJSFunctionRegister, target_type);
+  CallDescriptor::Kind descriptor_kind = CallDescriptor::kCallJSFunction;
+  return zone->New<CallDescriptor>(  // --
+      descriptor_kind,               // kind
+      target_type,                   // target MachineType
+      target_loc,                    // target location
+      locations.Build(),             // location_sig
+      js_parameter_count,            // stack_parameter_count
+      properties,                    // properties
+      kNoCalleeSaved,                // callee-saved
+      kNoCalleeSavedFp,              // callee-saved fp
+      flags,                         // flags
+      "js-call");                    // debug name
 }
 
 // TODO(turbofan): cache call descriptors for code stub calls.
@@ -451,41 +456,33 @@ CallDescriptor* Linkage::GetStubCallDescriptor(
 
   DCHECK_GE(stack_parameter_count, descriptor.GetStackParameterCount());
 
-  size_t return_count = descriptor.GetReturnCount();
+  int return_count = descriptor.GetReturnCount();
   LocationSignature::Builder locations(zone, return_count, parameter_count);
 
   // Add returns.
-  static constexpr Register return_registers[] = {
-      kReturnRegister0, kReturnRegister1, kReturnRegister2};
-  size_t num_returns = 0;
-  size_t num_fp_returns = 0;
-  for (size_t i = 0; i < locations.return_count_; i++) {
+  for (int i = 0; i < return_count; i++) {
     MachineType type = descriptor.GetReturnType(static_cast<int>(i));
     if (IsFloatingPoint(type.representation())) {
-      DCHECK_LT(num_fp_returns, 1);  // Only 1 FP return is supported.
-      locations.AddReturn(regloc(kFPReturnRegister0, type));
-      num_fp_returns++;
+      DoubleRegister reg = descriptor.GetDoubleRegisterReturn(i);
+      locations.AddReturn(regloc(reg, type));
     } else {
-      DCHECK_LT(num_returns, arraysize(return_registers));
-      locations.AddReturn(regloc(return_registers[num_returns], type));
-      num_returns++;
+      Register reg = descriptor.GetRegisterReturn(i);
+      locations.AddReturn(regloc(reg, type));
     }
   }
-  USE(num_fp_returns);
 
   // Add parameters in registers and on the stack.
   for (int i = 0; i < js_parameter_count; i++) {
     if (i < register_parameter_count) {
       // The first parameters go in registers.
-      // TODO(bbudge) Add floating point registers to the InterfaceDescriptor
-      // and use them for FP types. Currently, this works because on most
-      // platforms, all FP registers are available for use. On ia32, xmm0 is
-      // not allocatable and so we must work around that with platform-specific
-      // descriptors, adjusting the GP register set to avoid eax, which has
-      // register code 0.
-      Register reg = descriptor.GetRegisterParameter(i);
       MachineType type = descriptor.GetParameterType(i);
-      locations.AddParam(regloc(reg, type));
+      if (IsFloatingPoint(type.representation())) {
+        DoubleRegister reg = descriptor.GetDoubleRegisterParameter(i);
+        locations.AddParam(regloc(reg, type));
+      } else {
+        Register reg = descriptor.GetRegisterParameter(i);
+        locations.AddParam(regloc(reg, type));
+      }
     } else {
       // The rest of the parameters go on the stack.
       int stack_slot = i - register_parameter_count - stack_parameter_count;
diff --git a/deps/v8/src/compiler/linkage.h b/deps/v8/src/compiler/linkage.h
index 860a3f144da063..672c4a68fa1540 100644
--- a/deps/v8/src/compiler/linkage.h
+++ b/deps/v8/src/compiler/linkage.h
@@ -8,6 +8,7 @@
 #include "src/base/compiler-specific.h"
 #include "src/base/flags.h"
 #include "src/codegen/interface-descriptors.h"
+#include "src/codegen/linkage-location.h"
 #include "src/codegen/machine-type.h"
 #include "src/codegen/register.h"
 #include "src/codegen/reglist.h"
@@ -19,13 +20,6 @@
 #include "src/runtime/runtime.h"
 #include "src/zone/zone.h"
 
-#if !defined(__clang__) && defined(_M_ARM64)
-// _M_ARM64 is an MSVC-specific macro that clang-cl emulates.
-#define NO_INLINE_FOR_ARM64_MSVC __declspec(noinline)
-#else
-#define NO_INLINE_FOR_ARM64_MSVC
-#endif
-
 namespace v8 {
 class CFunctionInfo;
 
@@ -41,159 +35,6 @@ constexpr DoubleRegList kNoCalleeSavedFp;
 
 class OsrHelper;
 
-// Describes the location for a parameter or a return value to a call.
-class LinkageLocation {
- public:
-  bool operator==(const LinkageLocation& other) const {
-    return bit_field_ == other.bit_field_ &&
-           machine_type_ == other.machine_type_;
-  }
-
-  bool operator!=(const LinkageLocation& other) const {
-    return !(*this == other);
-  }
-
-  static bool IsSameLocation(const LinkageLocation& a,
-                             const LinkageLocation& b) {
-    // Different MachineTypes may end up at the same physical location. With the
-    // sub-type check we make sure that types like {AnyTagged} and
-    // {TaggedPointer} which would end up with the same physical location are
-    // considered equal here.
-    return (a.bit_field_ == b.bit_field_) &&
-           (IsSubtype(a.machine_type_.representation(),
-                      b.machine_type_.representation()) ||
-            IsSubtype(b.machine_type_.representation(),
-                      a.machine_type_.representation()));
-  }
-
-  static LinkageLocation ForNullRegister(
-      int32_t reg, MachineType type = MachineType::None()) {
-    return LinkageLocation(REGISTER, reg, type);
-  }
-
-  static LinkageLocation ForAnyRegister(
-      MachineType type = MachineType::None()) {
-    return LinkageLocation(REGISTER, ANY_REGISTER, type);
-  }
-
-  static LinkageLocation ForRegister(int32_t reg,
-                                     MachineType type = MachineType::None()) {
-    DCHECK_LE(0, reg);
-    return LinkageLocation(REGISTER, reg, type);
-  }
-
-  static LinkageLocation ForCallerFrameSlot(int32_t slot, MachineType type) {
-    DCHECK_GT(0, slot);
-    return LinkageLocation(STACK_SLOT, slot, type);
-  }
-
-  static LinkageLocation ForCalleeFrameSlot(int32_t slot, MachineType type) {
-    // TODO(titzer): bailout instead of crashing here.
-    DCHECK(slot >= 0 && slot < LinkageLocation::MAX_STACK_SLOT);
-    return LinkageLocation(STACK_SLOT, slot, type);
-  }
-
-  static LinkageLocation ForSavedCallerReturnAddress() {
-    return ForCalleeFrameSlot((StandardFrameConstants::kCallerPCOffset -
-                               StandardFrameConstants::kCallerPCOffset) /
-                                  kSystemPointerSize,
-                              MachineType::Pointer());
-  }
-
-  static LinkageLocation ForSavedCallerFramePtr() {
-    return ForCalleeFrameSlot((StandardFrameConstants::kCallerPCOffset -
-                               StandardFrameConstants::kCallerFPOffset) /
-                                  kSystemPointerSize,
-                              MachineType::Pointer());
-  }
-
-  static LinkageLocation ForSavedCallerConstantPool() {
-    DCHECK(V8_EMBEDDED_CONSTANT_POOL_BOOL);
-    return ForCalleeFrameSlot((StandardFrameConstants::kCallerPCOffset -
-                               StandardFrameConstants::kConstantPoolOffset) /
-                                  kSystemPointerSize,
-                              MachineType::AnyTagged());
-  }
-
-  static LinkageLocation ForSavedCallerFunction() {
-    return ForCalleeFrameSlot((StandardFrameConstants::kCallerPCOffset -
-                               StandardFrameConstants::kFunctionOffset) /
-                                  kSystemPointerSize,
-                              MachineType::AnyTagged());
-  }
-
-  static LinkageLocation ConvertToTailCallerLocation(
-      LinkageLocation caller_location, int stack_param_delta) {
-    if (!caller_location.IsRegister()) {
-      return LinkageLocation(STACK_SLOT,
-                             caller_location.GetLocation() + stack_param_delta,
-                             caller_location.GetType());
-    }
-    return caller_location;
-  }
-
-  MachineType GetType() const { return machine_type_; }
-
-  int GetSizeInPointers() const {
-    return ElementSizeInPointers(GetType().representation());
-  }
-
-  int32_t GetLocation() const {
-    // We can't use LocationField::decode here because it doesn't work for
-    // negative values!
-    return static_cast<int32_t>(bit_field_ & LocationField::kMask) >>
-           LocationField::kShift;
-  }
-
-  bool IsNullRegister() const {
-    return IsRegister() && GetLocation() < ANY_REGISTER;
-  }
-  NO_INLINE_FOR_ARM64_MSVC bool IsRegister() const {
-    return TypeField::decode(bit_field_) == REGISTER;
-  }
-  bool IsAnyRegister() const {
-    return IsRegister() && GetLocation() == ANY_REGISTER;
-  }
-  bool IsCallerFrameSlot() const { return !IsRegister() && GetLocation() < 0; }
-  bool IsCalleeFrameSlot() const { return !IsRegister() && GetLocation() >= 0; }
-
-  int32_t AsRegister() const {
-    DCHECK(IsRegister());
-    return GetLocation();
-  }
-  int32_t AsCallerFrameSlot() const {
-    DCHECK(IsCallerFrameSlot());
-    return GetLocation();
-  }
-  int32_t AsCalleeFrameSlot() const {
-    DCHECK(IsCalleeFrameSlot());
-    return GetLocation();
-  }
-
- private:
-  enum LocationType { REGISTER, STACK_SLOT };
-
-  using TypeField = base::BitField<LocationType, 0, 1>;
-  using LocationField = TypeField::Next<int32_t, 31>;
-
-  static constexpr int32_t ANY_REGISTER = -1;
-  static constexpr int32_t MAX_STACK_SLOT = 32767;
-
-  LinkageLocation(LocationType type, int32_t location,
-                  MachineType machine_type) {
-    bit_field_ = TypeField::encode(type) |
-                 // {location} can be -1 (ANY_REGISTER).
-                 ((static_cast<uint32_t>(location) << LocationField::kShift) &
-                  LocationField::kMask);
-    machine_type_ = machine_type;
-  }
-
-  int32_t bit_field_;
-  MachineType machine_type_;
-};
-
-using LocationSignature = Signature<LinkageLocation>;
-
 // Describes a call to various parts of the compiler. Every call has the notion
 // of a "target", which is the first input to the call.
 class V8_EXPORT_PRIVATE CallDescriptor final
@@ -506,9 +347,12 @@ class V8_EXPORT_PRIVATE Linkage : public NON_EXPORTED_BASE(ZoneObject) {
   // The call descriptor for this compilation unit describes the locations
   // of incoming parameters and the outgoing return value(s).
   CallDescriptor* GetIncomingDescriptor() const { return incoming_; }
-  static CallDescriptor* GetJSCallDescriptor(Zone* zone, bool is_osr,
-                                             int parameter_count,
-                                             CallDescriptor::Flags flags);
+  // Calls to JSFunctions should never overwrite the {properties}, but calls to
+  // known builtins might.
+  static CallDescriptor* GetJSCallDescriptor(
+      Zone* zone, bool is_osr, int parameter_count, CallDescriptor::Flags flags,
+      Operator::Properties properties =
+          Operator::kNoProperties /* use with care! */);
 
   static CallDescriptor* GetRuntimeCallDescriptor(
       Zone* zone, Runtime::FunctionId function, int js_parameter_count,
diff --git a/deps/v8/src/compiler/load-elimination.cc b/deps/v8/src/compiler/load-elimination.cc
index 1ad6e194aaccef..9ff41a513043eb 100644
--- a/deps/v8/src/compiler/load-elimination.cc
+++ b/deps/v8/src/compiler/load-elimination.cc
@@ -7,6 +7,7 @@
 #include "src/compiler/access-builder.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/js-graph.h"
+#include "src/compiler/js-heap-broker.h"
 #include "src/compiler/node-properties.h"
 #include "src/heap/factory.h"
 #include "src/objects/objects-inl.h"
@@ -270,7 +271,7 @@ bool MayAlias(MaybeHandle<Name> x, MaybeHandle<Name> y) {
 
 class LoadElimination::AliasStateInfo {
  public:
-  AliasStateInfo(const AbstractState* state, Node* object, Handle<Map> map)
+  AliasStateInfo(const AbstractState* state, Node* object, MapRef map)
       : state_(state), object_(object), map_(map) {}
   AliasStateInfo(const AbstractState* state, Node* object)
       : state_(state), object_(object) {}
@@ -280,7 +281,7 @@ class LoadElimination::AliasStateInfo {
  private:
   const AbstractState* state_;
   Node* object_;
-  MaybeHandle<Map> map_;
+  OptionalMapRef map_;
 };
 
 LoadElimination::AbstractField const* LoadElimination::AbstractField::KillConst(
@@ -336,15 +337,15 @@ void LoadElimination::AbstractField::Print() const {
 LoadElimination::AbstractMaps::AbstractMaps(Zone* zone)
     : info_for_node_(zone) {}
 
-LoadElimination::AbstractMaps::AbstractMaps(Node* object,
-                                            ZoneHandleSet<Map> maps, Zone* zone)
+LoadElimination::AbstractMaps::AbstractMaps(Node* object, ZoneRefSet<Map> maps,
+                                            Zone* zone)
     : info_for_node_(zone) {
   object = ResolveRenames(object);
   info_for_node_.insert(std::make_pair(object, maps));
 }
 
-bool LoadElimination::AbstractMaps::Lookup(
-    Node* object, ZoneHandleSet<Map>* object_maps) const {
+bool LoadElimination::AbstractMaps::Lookup(Node* object,
+                                           ZoneRefSet<Map>* object_maps) const {
   auto it = info_for_node_.find(ResolveRenames(object));
   if (it == info_for_node_.end()) return false;
   *object_maps = it->second;
@@ -372,7 +373,7 @@ LoadElimination::AbstractMaps const* LoadElimination::AbstractMaps::Merge(
   AbstractMaps* copy = zone->New<AbstractMaps>(zone);
   for (auto this_it : this->info_for_node_) {
     Node* this_object = this_it.first;
-    ZoneHandleSet<Map> this_maps = this_it.second;
+    ZoneRefSet<Map> this_maps = this_it.second;
     auto that_it = that->info_for_node_.find(this_object);
     if (that_it != that->info_for_node_.end() && that_it->second == this_maps) {
       copy->info_for_node_.insert(this_it);
@@ -382,7 +383,7 @@ LoadElimination::AbstractMaps const* LoadElimination::AbstractMaps::Merge(
 }
 
 LoadElimination::AbstractMaps const* LoadElimination::AbstractMaps::Extend(
-    Node* object, ZoneHandleSet<Map> maps, Zone* zone) const {
+    Node* object, ZoneRefSet<Map> maps, Zone* zone) const {
   AbstractMaps* that = zone->New<AbstractMaps>(*this);
   if (that->info_for_node_.size() >= kMaxTrackedObjects) {
     // We are tracking too many objects, which leads to bad performance.
@@ -400,9 +401,9 @@ void LoadElimination::AbstractMaps::Print() const {
   for (auto pair : info_for_node_) {
     os << "    #" << pair.first->id() << ":" << pair.first->op()->mnemonic()
        << std::endl;
-    ZoneHandleSet<Map> const& maps = pair.second;
+    ZoneRefSet<Map> const& maps = pair.second;
     for (size_t i = 0; i < maps.size(); ++i) {
-      os << "     - " << Brief(*maps[i]) << std::endl;
+      os << "     - " << Brief(*maps[i].object()) << std::endl;
     }
   }
 }
@@ -451,7 +452,7 @@ void LoadElimination::AbstractState::FieldsMerge(
     AbstractField const*& this_field = (*this_fields)[i];
     if (this_field) {
       if (that_fields[i]) {
-        this_field = this_field->Merge(that_fields[i], zone);
+        this_field = this_field->Merge(that_fields[i], zone, &fields_count_);
       } else {
         this_field = nullptr;
       }
@@ -469,8 +470,10 @@ void LoadElimination::AbstractState::Merge(AbstractState const* that,
   }
 
   // Merge the information we have about the fields.
-  FieldsMerge(&this->fields_, that->fields_, zone);
+  fields_count_ = 0;
   FieldsMerge(&this->const_fields_, that->const_fields_, zone);
+  const_fields_count_ = fields_count_;
+  FieldsMerge(&this->fields_, that->fields_, zone);
 
   // Merge the information we have about the maps.
   if (this->maps_) {
@@ -479,12 +482,12 @@ void LoadElimination::AbstractState::Merge(AbstractState const* that,
 }
 
 bool LoadElimination::AbstractState::LookupMaps(
-    Node* object, ZoneHandleSet<Map>* object_map) const {
+    Node* object, ZoneRefSet<Map>* object_map) const {
   return this->maps_ && this->maps_->Lookup(object, object_map);
 }
 
 LoadElimination::AbstractState const* LoadElimination::AbstractState::SetMaps(
-    Node* object, ZoneHandleSet<Map> maps, Zone* zone) const {
+    Node* object, ZoneRefSet<Map> maps, Zone* zone) const {
   AbstractState* that = zone->New<AbstractState>(*this);
   if (that->maps_) {
     that->maps_ = that->maps_->Extend(object, maps, zone);
@@ -556,14 +559,19 @@ LoadElimination::AbstractState const* LoadElimination::AbstractState::AddField(
     Node* object, IndexRange index_range, LoadElimination::FieldInfo info,
     Zone* zone) const {
   AbstractState* that = zone->New<AbstractState>(*this);
-  AbstractFields& fields =
-      info.const_field_info.IsConst() ? that->const_fields_ : that->fields_;
+  bool is_const = info.const_field_info.IsConst();
+  AbstractFields& fields = is_const ? that->const_fields_ : that->fields_;
   for (int index : index_range) {
+    int count_before = fields[index] ? fields[index]->count() : 0;
     if (fields[index]) {
-      fields[index] = fields[index]->Extend(object, info, zone);
+      fields[index] =
+          fields[index]->Extend(object, info, zone, that->fields_count_);
     } else {
       fields[index] = zone->New<AbstractField>(object, info, zone);
     }
+    int added = fields[index]->count() - count_before;
+    if (is_const) that->const_fields_count_ += added;
+    that->fields_count_ += added;
   }
   return that;
 }
@@ -580,6 +588,10 @@ LoadElimination::AbstractState::KillConstField(Node* object,
       if (this->const_fields_[index] != this_field) {
         if (!that) that = zone->New<AbstractState>(*this);
         that->const_fields_[index] = this_field;
+        int removed = this->const_fields_[index]->count() -
+                      that->const_fields_[index]->count();
+        that->const_fields_count_ -= removed;
+        that->fields_count_ -= removed;
       }
     }
   }
@@ -603,6 +615,9 @@ LoadElimination::AbstractState const* LoadElimination::AbstractState::KillField(
       if (this->fields_[index] != this_field) {
         if (!that) that = zone->New<AbstractState>(*this);
         that->fields_[index] = this_field;
+        int removed =
+            this->fields_[index]->count() - that->fields_[index]->count();
+        that->fields_count_ -= removed;
       }
     }
   }
@@ -614,7 +629,9 @@ LoadElimination::AbstractState::KillFields(Node* object, MaybeHandle<Name> name,
                                            Zone* zone) const {
   AliasStateInfo alias_info(this, object);
   for (size_t i = 0;; ++i) {
-    if (i == fields_.size()) return this;
+    if (i == fields_.size()) {
+      return this;
+    }
     if (AbstractField const* this_field = this->fields_[i]) {
       AbstractField const* that_field =
           this_field->Kill(alias_info, name, zone);
@@ -624,6 +641,8 @@ LoadElimination::AbstractState::KillFields(Node* object, MaybeHandle<Name> name,
         while (++i < fields_.size()) {
           if (this->fields_[i] != nullptr) {
             that->fields_[i] = this->fields_[i]->Kill(alias_info, name, zone);
+            int removed = this->fields_[i]->count() - that->fields_[i]->count();
+            that->fields_count_ -= removed;
           }
         }
         return that;
@@ -639,6 +658,8 @@ LoadElimination::AbstractState const* LoadElimination::AbstractState::KillAll(
     if (const_fields_[i]) {
       AbstractState* that = zone->New<AbstractState>();
       that->const_fields_ = const_fields_;
+      that->const_fields_count_ = const_fields_count_;
+      that->fields_count_ = const_fields_count_;
       return that;
     }
   }
@@ -690,11 +711,11 @@ bool LoadElimination::AliasStateInfo::MayAlias(Node* other) const {
     return false;
   }
   // Decide aliasing based on maps (if available).
-  Handle<Map> map;
-  if (map_.ToHandle(&map)) {
-    ZoneHandleSet<Map> other_maps;
+  if (map_.has_value()) {
+    MapRef map = *map_;
+    ZoneRefSet<Map> other_maps;
     if (state_->LookupMaps(other, &other_maps) && other_maps.size() == 1) {
-      if (map.address() != other_maps.at(0).address()) {
+      if (map != other_maps.at(0)) {
         return false;
       }
     }
@@ -740,12 +761,12 @@ void LoadElimination::AbstractStateForEffectNodes::Set(
 }
 
 Reduction LoadElimination::ReduceMapGuard(Node* node) {
-  ZoneHandleSet<Map> const& maps = MapGuardMapsOf(node->op());
+  ZoneRefSet<Map> const& maps = MapGuardMapsOf(node->op());
   Node* const object = NodeProperties::GetValueInput(node, 0);
   Node* const effect = NodeProperties::GetEffectInput(node);
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
-  ZoneHandleSet<Map> object_maps;
+  ZoneRefSet<Map> object_maps;
   if (state->LookupMaps(object, &object_maps)) {
     if (maps.contains(object_maps)) return Replace(effect);
     // TODO(turbofan): Compute the intersection.
@@ -755,12 +776,12 @@ Reduction LoadElimination::ReduceMapGuard(Node* node) {
 }
 
 Reduction LoadElimination::ReduceCheckMaps(Node* node) {
-  ZoneHandleSet<Map> const& maps = CheckMapsParametersOf(node->op()).maps();
+  ZoneRefSet<Map> const& maps = CheckMapsParametersOf(node->op()).maps();
   Node* const object = NodeProperties::GetValueInput(node, 0);
   Node* const effect = NodeProperties::GetEffectInput(node);
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
-  ZoneHandleSet<Map> object_maps;
+  ZoneRefSet<Map> object_maps;
   if (state->LookupMaps(object, &object_maps)) {
     if (maps.contains(object_maps)) return Replace(effect);
     // TODO(turbofan): Compute the intersection.
@@ -770,12 +791,12 @@ Reduction LoadElimination::ReduceCheckMaps(Node* node) {
 }
 
 Reduction LoadElimination::ReduceCompareMaps(Node* node) {
-  ZoneHandleSet<Map> const& maps = CompareMapsParametersOf(node->op());
+  ZoneRefSet<Map> const& maps = CompareMapsParametersOf(node->op());
   Node* const object = NodeProperties::GetValueInput(node, 0);
   Node* const effect = NodeProperties::GetEffectInput(node);
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
-  ZoneHandleSet<Map> object_maps;
+  ZoneRefSet<Map> object_maps;
   if (state->LookupMaps(object, &object_maps)) {
     if (maps.contains(object_maps)) {
       Node* value = jsgraph()->TrueConstant();
@@ -794,8 +815,8 @@ Reduction LoadElimination::ReduceEnsureWritableFastElements(Node* node) {
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
   // Check if the {elements} already have the fixed array map.
-  ZoneHandleSet<Map> elements_maps;
-  ZoneHandleSet<Map> fixed_array_maps(factory()->fixed_array_map());
+  ZoneRefSet<Map> elements_maps;
+  ZoneRefSet<Map> fixed_array_maps(broker()->fixed_array_map());
   if (state->LookupMaps(elements, &elements_maps) &&
       fixed_array_maps.contains(elements_maps)) {
     ReplaceWithValue(node, elements, effect);
@@ -823,12 +844,12 @@ Reduction LoadElimination::ReduceMaybeGrowFastElements(Node* node) {
   if (params.mode() == GrowFastElementsMode::kDoubleElements) {
     // We know that the resulting elements have the fixed double array map.
     state = state->SetMaps(
-        node, ZoneHandleSet<Map>(factory()->fixed_double_array_map()), zone());
+        node, ZoneRefSet<Map>(broker()->fixed_double_array_map()), zone());
   } else {
     // We know that the resulting elements have the fixed array map or the COW
     // version thereof (if we didn't grow and it was already COW before).
-    ZoneHandleSet<Map> fixed_array_maps(factory()->fixed_array_map());
-    fixed_array_maps.insert(factory()->fixed_cow_array_map(), zone());
+    ZoneRefSet<Map> fixed_array_maps(
+        {broker()->fixed_array_map(), broker()->fixed_cow_array_map()}, zone());
     state = state->SetMaps(node, fixed_array_maps, zone());
   }
   // Kill the previous elements on {object}.
@@ -845,8 +866,8 @@ Reduction LoadElimination::ReduceMaybeGrowFastElements(Node* node) {
 Reduction LoadElimination::ReduceTransitionElementsKind(Node* node) {
   ElementsTransition transition = ElementsTransitionOf(node->op());
   Node* const object = NodeProperties::GetValueInput(node, 0);
-  Handle<Map> source_map(transition.source());
-  Handle<Map> target_map(transition.target());
+  MapRef source_map(transition.source());
+  MapRef target_map(transition.target());
   Node* const effect = NodeProperties::GetEffectInput(node);
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
@@ -861,14 +882,14 @@ Reduction LoadElimination::ReduceTransitionElementsKind(Node* node) {
           MaybeHandle<Name>(), zone());
       break;
   }
-  ZoneHandleSet<Map> object_maps;
+  ZoneRefSet<Map> object_maps;
   if (state->LookupMaps(object, &object_maps)) {
-    if (ZoneHandleSet<Map>(target_map).contains(object_maps)) {
+    if (ZoneRefSet<Map>(target_map).contains(object_maps)) {
       // The {object} already has the {target_map}, so this TransitionElements
       // {node} is fully redundant (independent of what {source_map} is).
       return Replace(effect);
     }
-    if (object_maps.contains(ZoneHandleSet<Map>(source_map))) {
+    if (object_maps.contains(ZoneRefSet<Map>(source_map))) {
       object_maps.remove(source_map, zone());
       object_maps.insert(target_map, zone());
       AliasStateInfo alias_info(state, object, source_map);
@@ -884,8 +905,8 @@ Reduction LoadElimination::ReduceTransitionElementsKind(Node* node) {
 
 Reduction LoadElimination::ReduceTransitionAndStoreElement(Node* node) {
   Node* const object = NodeProperties::GetValueInput(node, 0);
-  Handle<Map> double_map(DoubleMapParameterOf(node->op()));
-  Handle<Map> fast_map(FastMapParameterOf(node->op()));
+  MapRef double_map(DoubleMapParameterOf(node->op()));
+  MapRef fast_map(FastMapParameterOf(node->op()));
   Node* const effect = NodeProperties::GetEffectInput(node);
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
@@ -893,7 +914,7 @@ Reduction LoadElimination::ReduceTransitionAndStoreElement(Node* node) {
   // We need to add the double and fast maps to the set of possible maps for
   // this object, because we don't know which of those we'll transition to.
   // Additionally, we should kill all alias information.
-  ZoneHandleSet<Map> object_maps;
+  ZoneRefSet<Map> object_maps;
   if (state->LookupMaps(object, &object_maps)) {
     object_maps.insert(double_map, zone());
     object_maps.insert(fast_map, zone());
@@ -917,9 +938,9 @@ Reduction LoadElimination::ReduceLoadField(Node* node,
   if (access.offset == HeapObject::kMapOffset &&
       access.base_is_tagged == kTaggedBase) {
     DCHECK(IsAnyTagged(access.machine_type.representation()));
-    ZoneHandleSet<Map> object_maps;
+    ZoneRefSet<Map> object_maps;
     if (state->LookupMaps(object, &object_maps) && object_maps.size() == 1) {
-      Node* value = jsgraph()->HeapConstant(object_maps[0]);
+      Node* value = jsgraph()->HeapConstant(object_maps[0].object());
       NodeProperties::SetType(value, Type::OtherInternal());
       ReplaceWithValue(node, value, effect);
       return Replace(value);
@@ -964,9 +985,8 @@ Reduction LoadElimination::ReduceLoadField(Node* node,
       state = state->AddField(object, field_index, info, zone());
     }
   }
-  Handle<Map> field_map;
-  if (access.map.ToHandle(&field_map)) {
-    state = state->SetMaps(node, ZoneHandleSet<Map>(field_map), zone());
+  if (access.map.has_value()) {
+    state = state->SetMaps(node, ZoneRefSet<Map>(*access.map), zone());
   }
   return UpdateState(node, state);
 }
@@ -986,8 +1006,8 @@ Reduction LoadElimination::ReduceStoreField(Node* node,
     Type const new_value_type = NodeProperties::GetType(new_value);
     if (new_value_type.IsHeapConstant()) {
       // Record the new {object} map information.
-      ZoneHandleSet<Map> object_maps(
-          new_value_type.AsHeapConstant()->Ref().AsMap().object());
+      ZoneRefSet<Map> object_maps(
+          new_value_type.AsHeapConstant()->Ref().AsMap());
       state = state->SetMaps(object, object_maps, zone());
     }
   } else {
@@ -1074,6 +1094,7 @@ Reduction LoadElimination::ReduceLoadElement(Node* node) {
     case MachineRepresentation::kFloat32:
     case MachineRepresentation::kCompressedPointer:
     case MachineRepresentation::kCompressed:
+    case MachineRepresentation::kIndirectPointer:
     case MachineRepresentation::kSandboxedPointer:
       // TODO(turbofan): Add support for doing the truncations.
       break;
@@ -1133,6 +1154,7 @@ Reduction LoadElimination::ReduceStoreElement(Node* node) {
     case MachineRepresentation::kCompressedPointer:
     case MachineRepresentation::kCompressed:
     case MachineRepresentation::kSandboxedPointer:
+    case MachineRepresentation::kIndirectPointer:
       // TODO(turbofan): Add support for doing the truncations.
       break;
     case MachineRepresentation::kFloat64:
@@ -1165,12 +1187,12 @@ LoadElimination::AbstractState const* LoadElimination::UpdateStateForPhi(
   // Check if all the inputs have the same maps.
   AbstractState const* input_state =
       node_states_.Get(NodeProperties::GetEffectInput(effect_phi, 0));
-  ZoneHandleSet<Map> object_maps;
+  ZoneRefSet<Map> object_maps;
   if (!input_state->LookupMaps(phi->InputAt(0), &object_maps)) return state;
   for (int i = 1; i < predecessor_count; i++) {
     input_state =
         node_states_.Get(NodeProperties::GetEffectInput(effect_phi, i));
-    ZoneHandleSet<Map> input_maps;
+    ZoneRefSet<Map> input_maps;
     if (!input_state->LookupMaps(phi->InputAt(i), &input_maps)) return state;
     if (input_maps != object_maps) return state;
   }
@@ -1319,10 +1341,9 @@ LoadElimination::AbstractState const* LoadElimination::ComputeLoopState(
           case IrOpcode::kTransitionElementsKind: {
             ElementsTransition transition = ElementsTransitionOf(current->op());
             Node* const object = NodeProperties::GetValueInput(current, 0);
-            ZoneHandleSet<Map> object_maps;
+            ZoneRefSet<Map> object_maps;
             if (!state->LookupMaps(object, &object_maps) ||
-                !ZoneHandleSet<Map>(transition.target())
-                     .contains(object_maps)) {
+                !ZoneRefSet<Map>(transition.target()).contains(object_maps)) {
               element_transitions_.push_back({transition, object});
             }
             break;
@@ -1440,11 +1461,17 @@ LoadElimination::IndexRange LoadElimination::FieldIndexOf(
     case MachineRepresentation::kMapWord:
     case MachineRepresentation::kCompressedPointer:
     case MachineRepresentation::kCompressed:
+    case MachineRepresentation::kIndirectPointer:
     case MachineRepresentation::kSandboxedPointer:
       break;
   }
   int representation_size = ElementSizeInBytes(rep);
   // We currently only track fields that are at least tagged pointer sized.
+  // We assume that indirect pointers are tagged pointer sized if we see them
+  // here since they should only ever be used in pointer compression
+  // configurations.
+  DCHECK(rep != MachineRepresentation::kIndirectPointer ||
+         representation_size == kTaggedSize);
   if (representation_size < kTaggedSize) return IndexRange::Invalid();
   DCHECK_EQ(0, representation_size % kTaggedSize);
 
diff --git a/deps/v8/src/compiler/load-elimination.h b/deps/v8/src/compiler/load-elimination.h
index a1ca9235ffb033..6e9e02a551d136 100644
--- a/deps/v8/src/compiler/load-elimination.h
+++ b/deps/v8/src/compiler/load-elimination.h
@@ -11,7 +11,6 @@
 #include "src/compiler/graph-reducer.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/handles/maybe-handles.h"
-#include "src/zone/zone-handle-set.h"
 
 namespace v8 {
 namespace internal {
@@ -30,8 +29,12 @@ class JSGraph;
 class V8_EXPORT_PRIVATE LoadElimination final
     : public NON_EXPORTED_BASE(AdvancedReducer) {
  public:
-  LoadElimination(Editor* editor, JSGraph* jsgraph, Zone* zone)
-      : AdvancedReducer(editor), node_states_(zone), jsgraph_(jsgraph) {}
+  LoadElimination(Editor* editor, JSHeapBroker* broker, JSGraph* jsgraph,
+                  Zone* zone)
+      : AdvancedReducer(editor),
+        broker_(broker),
+        node_states_(zone),
+        jsgraph_(jsgraph) {}
   ~LoadElimination() final = default;
   LoadElimination(const LoadElimination&) = delete;
   LoadElimination& operator=(const LoadElimination&) = delete;
@@ -134,10 +137,12 @@ class V8_EXPORT_PRIVATE LoadElimination final
       info_for_node_.insert(std::make_pair(object, info));
     }
 
-    AbstractField const* Extend(Node* object, FieldInfo info,
-                                Zone* zone) const {
+    AbstractField const* Extend(Node* object, FieldInfo info, Zone* zone,
+                                int current_field_count) const {
       AbstractField* that = zone->New<AbstractField>(*this);
-      if (that->info_for_node_.size() >= kMaxTrackedObjects) {
+      if ((current_field_count >= kMaxTrackedFields &&
+           that->info_for_node_.size() > 0) ||
+          that->info_for_node_.size() >= kMaxTrackedObjects) {
         // We are tracking too many objects, which leads to bad performance.
         // Delete one to avoid the map from becoming bigger.
         that->info_for_node_.erase(that->info_for_node_.begin());
@@ -152,7 +157,8 @@ class V8_EXPORT_PRIVATE LoadElimination final
     bool Equals(AbstractField const* that) const {
       return this == that || this->info_for_node_ == that->info_for_node_;
     }
-    AbstractField const* Merge(AbstractField const* that, Zone* zone) const {
+    AbstractField const* Merge(AbstractField const* that, Zone* zone,
+                               int* count) const {
       if (this->Equals(that)) return this;
       AbstractField* copy = zone->New<AbstractField>(zone);
       for (auto this_it : this->info_for_node_) {
@@ -163,6 +169,7 @@ class V8_EXPORT_PRIVATE LoadElimination final
         if (that_it != that->info_for_node_.end() &&
             that_it->second == this_second) {
           copy->info_for_node_.insert(this_it);
+          (*count)++;
         }
       }
       return copy;
@@ -170,23 +177,26 @@ class V8_EXPORT_PRIVATE LoadElimination final
 
     void Print() const;
 
+    int count() const { return static_cast<int>(info_for_node_.size()); }
+
    private:
     ZoneMap<Node*, FieldInfo> info_for_node_;
   };
 
-  static size_t const kMaxTrackedFields = 32;
+  static size_t const kMaxTrackedFieldsPerObject = 32;
   static size_t const kMaxTrackedObjects = 100;
+  static int const kMaxTrackedFields = 300;
 
   // Abstract state to approximate the current map of an object along the
   // effect paths through the graph.
   class AbstractMaps final : public ZoneObject {
    public:
     explicit AbstractMaps(Zone* zone);
-    AbstractMaps(Node* object, ZoneHandleSet<Map> maps, Zone* zone);
+    AbstractMaps(Node* object, ZoneRefSet<Map> maps, Zone* zone);
 
-    AbstractMaps const* Extend(Node* object, ZoneHandleSet<Map> maps,
+    AbstractMaps const* Extend(Node* object, ZoneRefSet<Map> maps,
                                Zone* zone) const;
-    bool Lookup(Node* object, ZoneHandleSet<Map>* object_maps) const;
+    bool Lookup(Node* object, ZoneRefSet<Map>* object_maps) const;
     AbstractMaps const* Kill(const AliasStateInfo& alias_info,
                              Zone* zone) const;
     bool Equals(AbstractMaps const* that) const {
@@ -197,7 +207,7 @@ class V8_EXPORT_PRIVATE LoadElimination final
     void Print() const;
 
    private:
-    ZoneMap<Node*, ZoneHandleSet<Map>> info_for_node_;
+    ZoneMap<Node*, ZoneRefSet<Map>> info_for_node_;
   };
 
   class IndexRange {
@@ -205,7 +215,7 @@ class V8_EXPORT_PRIVATE LoadElimination final
     IndexRange(int begin, int size) : begin_(begin), end_(begin + size) {
       DCHECK_LE(0, begin);
       DCHECK_LE(1, size);
-      if (end_ > static_cast<int>(kMaxTrackedFields)) {
+      if (end_ > static_cast<int>(kMaxTrackedFieldsPerObject)) {
         *this = IndexRange::Invalid();
       }
     }
@@ -238,12 +248,12 @@ class V8_EXPORT_PRIVATE LoadElimination final
     bool Equals(AbstractState const* that) const;
     void Merge(AbstractState const* that, Zone* zone);
 
-    AbstractState const* SetMaps(Node* object, ZoneHandleSet<Map> maps,
+    AbstractState const* SetMaps(Node* object, ZoneRefSet<Map> maps,
                                  Zone* zone) const;
     AbstractState const* KillMaps(Node* object, Zone* zone) const;
     AbstractState const* KillMaps(const AliasStateInfo& alias_info,
                                   Zone* zone) const;
-    bool LookupMaps(Node* object, ZoneHandleSet<Map>* object_maps) const;
+    bool LookupMaps(Node* object, ZoneRefSet<Map>* object_maps) const;
 
     AbstractState const* AddField(Node* object, IndexRange index,
                                   FieldInfo info, Zone* zone) const;
@@ -275,7 +285,8 @@ class V8_EXPORT_PRIVATE LoadElimination final
    private:
     static AbstractState const empty_state_;
 
-    using AbstractFields = std::array<AbstractField const*, kMaxTrackedFields>;
+    using AbstractFields =
+        std::array<AbstractField const*, kMaxTrackedFieldsPerObject>;
 
     bool FieldsEquals(AbstractFields const& this_fields,
                       AbstractFields const& that_fields) const;
@@ -286,6 +297,11 @@ class V8_EXPORT_PRIVATE LoadElimination final
     AbstractFields fields_{};
     AbstractFields const_fields_{};
     AbstractMaps const* maps_ = nullptr;
+    int const_fields_count_ = 0;
+    // Note that fields_count_ includes both const_fields and non-const fields.
+    // To get the number of non-const fields, use `fields_count_ -
+    // const_fields_count_`.
+    int fields_count_ = 0;
   };
 
   class AbstractStateForEffectNodes final : public ZoneObject {
@@ -338,8 +354,10 @@ class V8_EXPORT_PRIVATE LoadElimination final
   Factory* factory() const;
   Graph* graph() const;
   JSGraph* jsgraph() const { return jsgraph_; }
+  JSHeapBroker* broker() const { return broker_; }
   Zone* zone() const { return node_states_.zone(); }
 
+  JSHeapBroker* broker_;
   AbstractStateForEffectNodes node_states_;
   JSGraph* const jsgraph_;
 };
diff --git a/deps/v8/src/compiler/loop-analysis.cc b/deps/v8/src/compiler/loop-analysis.cc
index 0c4ed5a8c348ee..b0f7b5fd993f55 100644
--- a/deps/v8/src/compiler/loop-analysis.cc
+++ b/deps/v8/src/compiler/loop-analysis.cc
@@ -298,7 +298,7 @@ class LoopFinderImpl {
   void ResizeBackwardMarks() {
     int new_width = width_ + 1;
     int max = num_nodes();
-    uint32_t* new_backward = zone_->NewArray<uint32_t>(new_width * max);
+    uint32_t* new_backward = zone_->AllocateArray<uint32_t>(new_width * max);
     memset(new_backward, 0, new_width * max * sizeof(uint32_t));
     if (width_ > 0) {  // copy old matrix data.
       for (int i = 0; i < max; i++) {
@@ -313,7 +313,7 @@ class LoopFinderImpl {
 
   void ResizeForwardMarks() {
     int max = num_nodes();
-    forward_ = zone_->NewArray<uint32_t>(width_ * max);
+    forward_ = zone_->AllocateArray<uint32_t>(width_ * max);
     memset(forward_, 0, width_ * max * sizeof(uint32_t));
   }
 
@@ -650,8 +650,6 @@ ZoneUnorderedSet<Node*>* LoopFinder::FindSmallInnermostLoopFromHeader(
       case IrOpcode::kWasmStructGet: {
         // When a chained load occurs in the loop, assume that peeling might
         // help.
-        // Extending this idea to array.get/array.len has been found to hurt
-        // more than it helps (tested on Sheets, Feb 2023).
         Node* object = node->InputAt(0);
         if (object->opcode() == IrOpcode::kWasmStructGet &&
             visited->find(object) != visited->end()) {
@@ -660,7 +658,13 @@ ZoneUnorderedSet<Node*>* LoopFinder::FindSmallInnermostLoopFromHeader(
         ENQUEUE_USES(use, true);
         break;
       }
+      case IrOpcode::kWasmArrayGet:
+        // Rationale for array.get: loops that contain an array.get also
+        // contain a bounds check, which needs to load the array's length,
+        // which benefits from load elimination after peeling.
       case IrOpcode::kStringPrepareForGetCodeunit:
+        // Rationale for PrepareForGetCodeunit: this internal operation is
+        // specifically designed for being hoisted out of loops.
         has_instruction_worth_peeling = true;
         V8_FALLTHROUGH;
       default:
@@ -696,8 +700,8 @@ ZoneUnorderedSet<Node*>* LoopFinder::FindSmallInnermostLoopFromHeader(
   }
 
   // Only peel functions containing instructions for which loop peeling is known
-  // to be useful. TODO(7748): Add more instructions to get more benefits out of
-  // loop peeling.
+  // to be useful. TODO(14034): Add more instructions to get more benefits out
+  // of loop peeling.
   if (purpose == Purpose::kLoopPeeling && !has_instruction_worth_peeling) {
     return nullptr;
   }
diff --git a/deps/v8/src/compiler/loop-unrolling.cc b/deps/v8/src/compiler/loop-unrolling.cc
index 6cac55ec4274fb..bc82b73eef71b5 100644
--- a/deps/v8/src/compiler/loop-unrolling.cc
+++ b/deps/v8/src/compiler/loop-unrolling.cc
@@ -82,7 +82,7 @@ void UnrollLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, uint32_t depth,
         /*** Step 2: Create merges for loop exits. ***/
         if (node->InputAt(1) == loop_node) {
           // Create a merge node from all iteration exits.
-          Node** merge_inputs = tmp_zone->NewArray<Node*>(iteration_count);
+          Node** merge_inputs = tmp_zone->AllocateArray<Node*>(iteration_count);
           merge_inputs[0] = node;
           for (uint32_t i = 1; i < iteration_count; i++) {
             merge_inputs[i] = COPY(node, i - 1);
@@ -105,7 +105,7 @@ void UnrollLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, uint32_t depth,
                     LoopExitValueRepresentationOf(use->op()), iteration_count);
               }
               Node** phi_inputs =
-                  tmp_zone->NewArray<Node*>(iteration_count + 1);
+                  tmp_zone->AllocateArray<Node*>(iteration_count + 1);
               phi_inputs[0] = use;
               for (uint32_t i = 1; i < iteration_count; i++) {
                 phi_inputs[i] = COPY(use, i - 1);
diff --git a/deps/v8/src/compiler/loop-variable-optimizer.cc b/deps/v8/src/compiler/loop-variable-optimizer.cc
index 8d1caa22feb394..095df61954c8bb 100644
--- a/deps/v8/src/compiler/loop-variable-optimizer.cc
+++ b/deps/v8/src/compiler/loop-variable-optimizer.cc
@@ -241,6 +241,9 @@ InductionVariable* LoopVariableOptimizer::TryGetInductionVariable(Node* phi) {
     return nullptr;
   }
 
+  // We allow a few additional conversions on the lhs of the arithmetic
+  // operation. This needs to be kept in sync with the corresponding code in
+  // {Typer::Visitor::InductionVariablePhiTypeIsPrefixedPoint}.
   // TODO(jarin) Support both sides.
   Node* input = arith->InputAt(0);
   if (input->opcode() == IrOpcode::kSpeculativeToNumber ||
diff --git a/deps/v8/src/compiler/machine-graph-verifier.cc b/deps/v8/src/compiler/machine-graph-verifier.cc
index 411f878a05dbf7..e253692073c7d9 100644
--- a/deps/v8/src/compiler/machine-graph-verifier.cc
+++ b/deps/v8/src/compiler/machine-graph-verifier.cc
@@ -101,6 +101,8 @@ class MachineRepresentationInferrer {
             break;
           case IrOpcode::kLoadFramePointer:
           case IrOpcode::kLoadParentFramePointer:
+          case IrOpcode::kStackSlot:
+          case IrOpcode::kLoadRootRegister:
             representation_vector_[node->id()] =
                 MachineType::PointerRepresentation();
             break;
@@ -245,6 +247,7 @@ class MachineRepresentationInferrer {
             break;
           case IrOpcode::kChangeInt32ToInt64:
           case IrOpcode::kChangeUint32ToUint64:
+          case IrOpcode::kBitcastWord32ToWord64:
           case IrOpcode::kInt64Constant:
           case IrOpcode::kRelocatableInt64Constant:
           case IrOpcode::kBitcastFloat64ToInt64:
@@ -558,6 +561,7 @@ class MachineRepresentationChecker {
               case MachineRepresentation::kTagged:
               case MachineRepresentation::kTaggedPointer:
               case MachineRepresentation::kTaggedSigned:
+              case MachineRepresentation::kIndirectPointer:
                 if (COMPRESS_POINTERS_BOOL &&
                     ((node->opcode() == IrOpcode::kStore &&
                       IsAnyTagged(StoreRepresentationOf(node->op())
@@ -982,6 +986,7 @@ class MachineRepresentationChecker {
         // happens in dead code.
         return IsAnyTagged(actual);
       case MachineRepresentation::kCompressedPointer:
+      case MachineRepresentation::kIndirectPointer:
       case MachineRepresentation::kSandboxedPointer:
       case MachineRepresentation::kFloat32:
       case MachineRepresentation::kFloat64:
diff --git a/deps/v8/src/compiler/machine-graph.cc b/deps/v8/src/compiler/machine-graph.cc
index da5cb687418e40..be3c08a787133c 100644
--- a/deps/v8/src/compiler/machine-graph.cc
+++ b/deps/v8/src/compiler/machine-graph.cc
@@ -14,6 +14,10 @@ Node* MachineGraph::UniqueInt32Constant(int32_t value) {
   return graph()->NewNode(common()->Int32Constant(value));
 }
 
+Node* MachineGraph::UniqueInt64Constant(int64_t value) {
+  return graph()->NewNode(common()->Int64Constant(value));
+}
+
 Node* MachineGraph::Int32Constant(int32_t value) {
   Node** loc = cache_.FindInt32Constant(value);
   if (*loc == nullptr) {
@@ -25,7 +29,7 @@ Node* MachineGraph::Int32Constant(int32_t value) {
 Node* MachineGraph::Int64Constant(int64_t value) {
   Node** loc = cache_.FindInt64Constant(value);
   if (*loc == nullptr) {
-    *loc = graph()->NewNode(common()->Int64Constant(value));
+    *loc = UniqueInt64Constant(value);
   }
   return *loc;
 }
@@ -40,6 +44,11 @@ Node* MachineGraph::UintPtrConstant(uintptr_t value) {
                            : Uint64Constant(static_cast<uint64_t>(value));
 }
 
+Node* MachineGraph::UniqueIntPtrConstant(intptr_t value) {
+  return machine()->Is32() ? UniqueInt32Constant(static_cast<int32_t>(value))
+                           : UniqueInt64Constant(static_cast<int64_t>(value));
+}
+
 Node* MachineGraph::TaggedIndexConstant(intptr_t value) {
   int32_t value32 = static_cast<int32_t>(value);
   Node** loc = cache_.FindTaggedIndexConstant(value32);
diff --git a/deps/v8/src/compiler/machine-graph.h b/deps/v8/src/compiler/machine-graph.h
index 05cbbad53e2a18..8c930303f7002c 100644
--- a/deps/v8/src/compiler/machine-graph.h
+++ b/deps/v8/src/compiler/machine-graph.h
@@ -36,6 +36,8 @@ class V8_EXPORT_PRIVATE MachineGraph : public NON_EXPORTED_BASE(ZoneObject) {
   // Creates a new (unique) Int32Constant node.
   Node* UniqueInt32Constant(int32_t value);
 
+  Node* UniqueInt64Constant(int64_t value);
+
   // Creates a Int32Constant node, usually canonicalized.
   Node* Int32Constant(int32_t value);
   Node* Uint32Constant(uint32_t value) {
@@ -54,6 +56,7 @@ class V8_EXPORT_PRIVATE MachineGraph : public NON_EXPORTED_BASE(ZoneObject) {
   // constants is probably not serializable.
   Node* IntPtrConstant(intptr_t value);
   Node* UintPtrConstant(uintptr_t value);
+  Node* UniqueIntPtrConstant(intptr_t value);
 
   Node* TaggedIndexConstant(intptr_t value);
 
diff --git a/deps/v8/src/compiler/machine-operator-reducer.cc b/deps/v8/src/compiler/machine-operator-reducer.cc
index c538695770053d..e5290f40fb6ae9 100644
--- a/deps/v8/src/compiler/machine-operator-reducer.cc
+++ b/deps/v8/src/compiler/machine-operator-reducer.cc
@@ -2887,14 +2887,19 @@ Reduction MachineOperatorReducer::SimplifyBranch(Node* node) {
         case IrOpcode::kBranch:
           SwapBranches(node);
           break;
-        case IrOpcode::kTrapIf:
-          NodeProperties::ChangeOp(node,
-                                   common()->TrapUnless(TrapIdOf(node->op())));
+        case IrOpcode::kTrapIf: {
+          const bool has_frame_state = node->op()->ValueInputCount() > 1;
+          NodeProperties::ChangeOp(
+              node,
+              common()->TrapUnless(TrapIdOf(node->op()), has_frame_state));
           break;
-        case IrOpcode::kTrapUnless:
-          NodeProperties::ChangeOp(node,
-                                   common()->TrapIf(TrapIdOf(node->op())));
+        }
+        case IrOpcode::kTrapUnless: {
+          const bool has_frame_state = node->op()->ValueInputCount() > 1;
+          NodeProperties::ChangeOp(
+              node, common()->TrapIf(TrapIdOf(node->op()), has_frame_state));
           break;
+        }
         case IrOpcode::kDeoptimizeIf: {
           DeoptimizeParameters p = DeoptimizeParametersOf(node->op());
           NodeProperties::ChangeOp(
diff --git a/deps/v8/src/compiler/machine-operator.cc b/deps/v8/src/compiler/machine-operator.cc
index a5a27418f8b415..22417ce348475f 100644
--- a/deps/v8/src/compiler/machine-operator.cc
+++ b/deps/v8/src/compiler/machine-operator.cc
@@ -127,10 +127,26 @@ std::ostream& operator<<(std::ostream& os, LoadTransformation rep) {
     case LoadTransformation::kS128Load64Zero:
       return os << "kS128Load64Zero";
     // Simd256
+    case LoadTransformation::kS256Load8Splat:
+      return os << "kS256Load8Splat";
+    case LoadTransformation::kS256Load16Splat:
+      return os << "kS256Load16Splat";
     case LoadTransformation::kS256Load32Splat:
       return os << "kS256Load32Splat";
     case LoadTransformation::kS256Load64Splat:
       return os << "kS256Load64Splat";
+    case LoadTransformation::kS256Load8x16S:
+      return os << "kS256Load8x16S";
+    case LoadTransformation::kS256Load8x16U:
+      return os << "kS256Load8x16U";
+    case LoadTransformation::kS256Load16x8S:
+      return os << "kS256Load16x8S";
+    case LoadTransformation::kS256Load16x8U:
+      return os << "kS256Load16x8U";
+    case LoadTransformation::kS256Load32x4S:
+      return os << "kS256Load32x4S";
+    case LoadTransformation::kS256Load32x4U:
+      return os << "kS256Load32x4U";
   }
   UNREACHABLE();
 }
@@ -202,6 +218,11 @@ StoreRepresentation const& StoreRepresentationOf(Operator const* op) {
   return OpParameter<StoreRepresentation>(op);
 }
 
+StorePairRepresentation const& StorePairRepresentationOf(Operator const* op) {
+  DCHECK(IrOpcode::kStorePair == op->opcode());
+  return OpParameter<StorePairRepresentation>(op);
+}
+
 AtomicStoreParameters const& AtomicStoreParametersOf(Operator const* op) {
   DCHECK(IrOpcode::kWord32AtomicStore == op->opcode() ||
          IrOpcode::kWord64AtomicStore == op->opcode());
@@ -454,8 +475,8 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(F64x2Sub, Operator::kNoProperties, 2, 0, 1)                            \
   V(F64x2Mul, Operator::kCommutative, 2, 0, 1)                             \
   V(F64x2Div, Operator::kNoProperties, 2, 0, 1)                            \
-  V(F64x2Min, Operator::kCommutative, 2, 0, 1)                             \
-  V(F64x2Max, Operator::kCommutative, 2, 0, 1)                             \
+  V(F64x2Min, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)    \
+  V(F64x2Max, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)    \
   V(F64x2Eq, Operator::kCommutative, 2, 0, 1)                              \
   V(F64x2Ne, Operator::kCommutative, 2, 0, 1)                              \
   V(F64x2Lt, Operator::kNoProperties, 2, 0, 1)                             \
@@ -481,8 +502,8 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(F32x4Sub, Operator::kNoProperties, 2, 0, 1)                            \
   V(F32x4Mul, Operator::kCommutative, 2, 0, 1)                             \
   V(F32x4Div, Operator::kNoProperties, 2, 0, 1)                            \
-  V(F32x4Min, Operator::kCommutative, 2, 0, 1)                             \
-  V(F32x4Max, Operator::kCommutative, 2, 0, 1)                             \
+  V(F32x4Min, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)    \
+  V(F32x4Max, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)    \
   V(F32x4Eq, Operator::kCommutative, 2, 0, 1)                              \
   V(F32x4Ne, Operator::kCommutative, 2, 0, 1)                              \
   V(F32x4Lt, Operator::kNoProperties, 2, 0, 1)                             \
@@ -496,6 +517,7 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(F32x4Trunc, Operator::kNoProperties, 1, 0, 1)                          \
   V(F32x4NearestInt, Operator::kNoProperties, 1, 0, 1)                     \
   V(F32x4DemoteF64x2Zero, Operator::kNoProperties, 1, 0, 1)                \
+  V(I64x4Splat, Operator::kNoProperties, 1, 0, 1)                          \
   V(I64x2Splat, Operator::kNoProperties, 1, 0, 1)                          \
   V(I64x2SplatI32Pair, Operator::kNoProperties, 2, 0, 1)                   \
   V(I64x2Abs, Operator::kNoProperties, 1, 0, 1)                            \
@@ -519,6 +541,7 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(I64x2ExtMulHighI32x4S, Operator::kCommutative, 2, 0, 1)                \
   V(I64x2ExtMulLowI32x4U, Operator::kCommutative, 2, 0, 1)                 \
   V(I64x2ExtMulHighI32x4U, Operator::kCommutative, 2, 0, 1)                \
+  V(I32x8Splat, Operator::kNoProperties, 1, 0, 1)                          \
   V(I32x4Splat, Operator::kNoProperties, 1, 0, 1)                          \
   V(I32x4SConvertF32x4, Operator::kNoProperties, 1, 0, 1)                  \
   V(I32x4SConvertI16x8Low, Operator::kNoProperties, 1, 0, 1)               \
@@ -554,6 +577,7 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(I32x4ExtAddPairwiseI16x8U, Operator::kNoProperties, 1, 0, 1)           \
   V(I32x4TruncSatF64x2SZero, Operator::kNoProperties, 1, 0, 1)             \
   V(I32x4TruncSatF64x2UZero, Operator::kNoProperties, 1, 0, 1)             \
+  V(I16x16Splat, Operator::kNoProperties, 1, 0, 1)                         \
   V(I16x8Splat, Operator::kNoProperties, 1, 0, 1)                          \
   V(I16x8SConvertI8x16Low, Operator::kNoProperties, 1, 0, 1)               \
   V(I16x8SConvertI8x16High, Operator::kNoProperties, 1, 0, 1)              \
@@ -592,7 +616,10 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(I16x8ExtMulHighI8x16U, Operator::kCommutative, 2, 0, 1)                \
   V(I16x8ExtAddPairwiseI8x16S, Operator::kNoProperties, 1, 0, 1)           \
   V(I16x8ExtAddPairwiseI8x16U, Operator::kNoProperties, 1, 0, 1)           \
+  V(I8x32Splat, Operator::kNoProperties, 1, 0, 1)                          \
   V(I8x16Splat, Operator::kNoProperties, 1, 0, 1)                          \
+  V(F64x4Splat, Operator::kNoProperties, 1, 0, 1)                          \
+  V(F32x8Splat, Operator::kNoProperties, 1, 0, 1)                          \
   V(I8x16Neg, Operator::kNoProperties, 1, 0, 1)                            \
   V(I8x16Shl, Operator::kNoProperties, 2, 0, 1)                            \
   V(I8x16ShrS, Operator::kNoProperties, 2, 0, 1)                           \
@@ -646,17 +673,136 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(I16x8RelaxedQ15MulRS, Operator::kCommutative, 2, 0, 1)                 \
   V(I16x8DotI8x16I7x16S, Operator::kCommutative, 2, 0, 1)                  \
   V(I32x4DotI8x16I7x16AddS, Operator::kNoProperties, 3, 0, 1)              \
+  V(F64x4Min, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)    \
+  V(F64x4Max, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)    \
+  V(F64x4Add, Operator::kCommutative, 2, 0, 1)                             \
+  V(F64x4Sqrt, Operator::kNoProperties, 1, 0, 1)                           \
+  V(F32x8Abs, Operator::kNoProperties, 1, 0, 1)                            \
+  V(F32x8Neg, Operator::kNoProperties, 1, 0, 1)                            \
+  V(F32x8Sqrt, Operator::kNoProperties, 1, 0, 1)                           \
   V(F32x8Add, Operator::kCommutative, 2, 0, 1)                             \
+  V(I64x4Add, Operator::kCommutative, 2, 0, 1)                             \
+  V(I32x8Add, Operator::kCommutative, 2, 0, 1)                             \
+  V(I16x16Add, Operator::kCommutative, 2, 0, 1)                            \
+  V(I8x32Add, Operator::kCommutative, 2, 0, 1)                             \
+  V(F64x4Sub, Operator::kNoProperties, 2, 0, 1)                            \
   V(F32x8Sub, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I64x4Sub, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I32x8Sub, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I16x16Sub, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I8x32Sub, Operator::kNoProperties, 2, 0, 1)                            \
+  V(F64x4Mul, Operator::kCommutative, 2, 0, 1)                             \
   V(F32x8Mul, Operator::kCommutative, 2, 0, 1)                             \
+  V(I64x4Mul, Operator::kCommutative, 2, 0, 1)                             \
+  V(I32x8Mul, Operator::kCommutative, 2, 0, 1)                             \
+  V(I16x16Mul, Operator::kCommutative, 2, 0, 1)                            \
+  V(F64x4Div, Operator::kNoProperties, 2, 0, 1)                            \
   V(F32x8Div, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I16x16AddSatS, Operator::kCommutative, 2, 0, 1)                        \
+  V(I8x32AddSatS, Operator::kCommutative, 2, 0, 1)                         \
+  V(I16x16AddSatU, Operator::kCommutative, 2, 0, 1)                        \
+  V(I8x32AddSatU, Operator::kCommutative, 2, 0, 1)                         \
+  V(I16x16SubSatS, Operator::kNoProperties, 2, 0, 1)                       \
+  V(I8x32SubSatS, Operator::kNoProperties, 2, 0, 1)                        \
+  V(I16x16SubSatU, Operator::kNoProperties, 2, 0, 1)                       \
+  V(I8x32SubSatU, Operator::kNoProperties, 2, 0, 1)                        \
+  V(F32x8Min, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)    \
+  V(F32x8Max, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)    \
   V(F32x8Pmin, Operator::kNoProperties, 2, 0, 1)                           \
   V(F32x8Pmax, Operator::kNoProperties, 2, 0, 1)                           \
   V(F32x8Eq, Operator::kCommutative, 2, 0, 1)                              \
+  V(F64x4Eq, Operator::kCommutative, 2, 0, 1)                              \
+  V(I64x4Eq, Operator::kCommutative, 2, 0, 1)                              \
+  V(I32x8Eq, Operator::kCommutative, 2, 0, 1)                              \
+  V(I16x16Eq, Operator::kCommutative, 2, 0, 1)                             \
+  V(I8x32Eq, Operator::kCommutative, 2, 0, 1)                              \
   V(F32x8Ne, Operator::kCommutative, 2, 0, 1)                              \
+  V(F64x4Ne, Operator::kCommutative, 2, 0, 1)                              \
+  V(I64x4GtS, Operator::kCommutative, 2, 0, 1)                             \
+  V(I32x8GtS, Operator::kCommutative, 2, 0, 1)                             \
+  V(I16x16GtS, Operator::kCommutative, 2, 0, 1)                            \
+  V(I8x32GtS, Operator::kCommutative, 2, 0, 1)                             \
+  V(F64x4Lt, Operator::kNoProperties, 2, 0, 1)                             \
   V(F32x8Lt, Operator::kNoProperties, 2, 0, 1)                             \
+  V(F64x4Le, Operator::kNoProperties, 2, 0, 1)                             \
   V(F32x8Le, Operator::kNoProperties, 2, 0, 1)                             \
-  V(S256Select, Operator::kNoProperties, 3, 0, 1)
+  V(I32x8MinS, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I16x16MinS, Operator::kNoProperties, 2, 0, 1)                          \
+  V(I8x32MinS, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I32x8MinU, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I16x16MinU, Operator::kNoProperties, 2, 0, 1)                          \
+  V(I8x32MinU, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I32x8MaxS, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I16x16MaxS, Operator::kNoProperties, 2, 0, 1)                          \
+  V(I8x32MaxS, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I32x8MaxU, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I16x16MaxU, Operator::kNoProperties, 2, 0, 1)                          \
+  V(I8x32MaxU, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I64x4Ne, Operator::kCommutative, 2, 0, 1)                              \
+  V(I64x4GeS, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I32x8Ne, Operator::kCommutative, 2, 0, 1)                              \
+  V(I32x8GtU, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I32x8GeS, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I32x8GeU, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I16x16Ne, Operator::kCommutative, 2, 0, 1)                             \
+  V(I16x16GtU, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I16x16GeS, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I16x16GeU, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I8x32Ne, Operator::kCommutative, 2, 0, 1)                              \
+  V(I8x32GtU, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I8x32GeS, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I8x32GeU, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I32x8UConvertF32x8, Operator::kNoProperties, 1, 0, 1)                  \
+  V(F64x4ConvertI32x4S, Operator::kNoProperties, 1, 0, 1)                  \
+  V(F32x8SConvertI32x8, Operator::kNoProperties, 1, 0, 1)                  \
+  V(F32x8UConvertI32x8, Operator::kNoProperties, 1, 0, 1)                  \
+  V(F32x4DemoteF64x4, Operator::kNoProperties, 1, 0, 1)                    \
+  V(I64x4SConvertI32x4, Operator::kNoProperties, 1, 0, 1)                  \
+  V(I64x4UConvertI32x4, Operator::kNoProperties, 1, 0, 1)                  \
+  V(I32x8SConvertI16x8, Operator::kNoProperties, 1, 0, 1)                  \
+  V(I32x8UConvertI16x8, Operator::kNoProperties, 1, 0, 1)                  \
+  V(I16x16SConvertI8x16, Operator::kNoProperties, 1, 0, 1)                 \
+  V(I16x16UConvertI8x16, Operator::kNoProperties, 1, 0, 1)                 \
+  V(I16x16SConvertI32x8, Operator::kNoProperties, 2, 0, 1)                 \
+  V(I16x16UConvertI32x8, Operator::kNoProperties, 2, 0, 1)                 \
+  V(I8x32SConvertI16x16, Operator::kNoProperties, 2, 0, 1)                 \
+  V(I8x32UConvertI16x16, Operator::kNoProperties, 2, 0, 1)                 \
+  V(I32x8Neg, Operator::kNoProperties, 1, 0, 1)                            \
+  V(I32x8Abs, Operator::kNoProperties, 1, 0, 1)                            \
+  V(I16x16Neg, Operator::kNoProperties, 1, 0, 1)                           \
+  V(I16x16Abs, Operator::kNoProperties, 1, 0, 1)                           \
+  V(I8x32Neg, Operator::kNoProperties, 1, 0, 1)                            \
+  V(I8x32Abs, Operator::kNoProperties, 1, 0, 1)                            \
+  V(I64x4Shl, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I64x4ShrU, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I32x8Shl, Operator::kNoProperties, 2, 0, 1)                            \
+  V(I32x8ShrS, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I32x8ShrU, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I16x16Shl, Operator::kNoProperties, 2, 0, 1)                           \
+  V(I16x16ShrS, Operator::kNoProperties, 2, 0, 1)                          \
+  V(I16x16ShrU, Operator::kNoProperties, 2, 0, 1)                          \
+  V(I32x8DotI16x16S, Operator::kCommutative, 2, 0, 1)                      \
+  V(I16x16RoundingAverageU, Operator::kCommutative, 2, 0, 1)               \
+  V(I8x32RoundingAverageU, Operator::kCommutative, 2, 0, 1)                \
+  V(I64x4ExtMulI32x4S, Operator::kCommutative, 2, 0, 1)                    \
+  V(I64x4ExtMulI32x4U, Operator::kCommutative, 2, 0, 1)                    \
+  V(I32x8ExtMulI16x8S, Operator::kCommutative, 2, 0, 1)                    \
+  V(I32x8ExtMulI16x8U, Operator::kCommutative, 2, 0, 1)                    \
+  V(I16x16ExtMulI8x16S, Operator::kCommutative, 2, 0, 1)                   \
+  V(I16x16ExtMulI8x16U, Operator::kCommutative, 2, 0, 1)                   \
+  V(I32x8ExtAddPairwiseI16x16S, Operator::kNoProperties, 1, 0, 1)          \
+  V(I32x8ExtAddPairwiseI16x16U, Operator::kNoProperties, 1, 0, 1)          \
+  V(I16x16ExtAddPairwiseI8x32S, Operator::kNoProperties, 1, 0, 1)          \
+  V(I16x16ExtAddPairwiseI8x32U, Operator::kNoProperties, 1, 0, 1)          \
+  V(F64x4Pmin, Operator::kNoProperties, 2, 0, 1)                           \
+  V(F64x4Pmax, Operator::kNoProperties, 2, 0, 1)                           \
+  V(S256Zero, Operator::kNoProperties, 0, 0, 1)                            \
+  V(S256And, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)     \
+  V(S256Or, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)      \
+  V(S256Xor, Operator::kAssociative | Operator::kCommutative, 2, 0, 1)     \
+  V(S256Not, Operator::kNoProperties, 1, 0, 1)                             \
+  V(S256Select, Operator::kNoProperties, 3, 0, 1)                          \
+  V(S256AndNot, Operator::kNoProperties, 2, 0, 1)
 
 // The format is:
 // V(Name, properties, value_input_count, control_input_count, output_count)
@@ -733,9 +879,82 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(kTagged)                           \
   V(kCompressedPointer)                \
   V(kSandboxedPointer)                 \
+  V(kIndirectPointer)                  \
   V(kCompressed)                       \
   V(kSimd256)
 
+#ifdef V8_TARGET_ARCH_64_BIT
+
+#ifdef V8_COMPRESS_POINTERS
+
+#define STORE_PAIR_MACHINE_REPRESENTATION_LIST(V) \
+  V(kWord32, kWord32)                             \
+  V(kWord32, kTagged)                             \
+  V(kWord32, kTaggedSigned)                       \
+  V(kWord32, kTaggedPointer)                      \
+  V(kWord32, kCompressed)                         \
+  V(kWord32, kCompressedPointer)                  \
+  V(kTagged, kWord32)                             \
+  V(kTagged, kTagged)                             \
+  V(kTagged, kTaggedSigned)                       \
+  V(kTagged, kTaggedPointer)                      \
+  V(kTagged, kCompressed)                         \
+  V(kTagged, kCompressedPointer)                  \
+  V(kTaggedSigned, kWord32)                       \
+  V(kTaggedSigned, kTagged)                       \
+  V(kTaggedSigned, kTaggedSigned)                 \
+  V(kTaggedSigned, kTaggedPointer)                \
+  V(kTaggedSigned, kCompressed)                   \
+  V(kTaggedSigned, kCompressedPointer)            \
+  V(kTaggedPointer, kWord32)                      \
+  V(kTaggedPointer, kTagged)                      \
+  V(kTaggedPointer, kTaggedSigned)                \
+  V(kTaggedPointer, kTaggedPointer)               \
+  V(kTaggedPointer, kCompressed)                  \
+  V(kTaggedPointer, kCompressedPointer)           \
+  V(kCompressed, kWord32)                         \
+  V(kCompressed, kTagged)                         \
+  V(kCompressed, kTaggedSigned)                   \
+  V(kCompressed, kTaggedPointer)                  \
+  V(kCompressed, kCompressed)                     \
+  V(kCompressed, kCompressedPointer)              \
+  V(kCompressedPointer, kWord32)                  \
+  V(kCompressedPointer, kTagged)                  \
+  V(kCompressedPointer, kTaggedSigned)            \
+  V(kCompressedPointer, kTaggedPointer)           \
+  V(kCompressedPointer, kCompressed)              \
+  V(kCompressedPointer, kCompressedPointer)       \
+  V(kWord64, kWord64)
+
+#else
+
+#define STORE_PAIR_MACHINE_REPRESENTATION_LIST(V) \
+  V(kWord32, kWord32)                             \
+  V(kWord64, kWord64)                             \
+  V(kWord64, kTagged)                             \
+  V(kWord64, kTaggedSigned)                       \
+  V(kWord64, kTaggedPointer)                      \
+  V(kTagged, kWord64)                             \
+  V(kTagged, kTagged)                             \
+  V(kTagged, kTaggedSigned)                       \
+  V(kTagged, kTaggedPointer)                      \
+  V(kTaggedSigned, kWord64)                       \
+  V(kTaggedSigned, kTagged)                       \
+  V(kTaggedSigned, kTaggedSigned)                 \
+  V(kTaggedSigned, kTaggedPointer)                \
+  V(kTaggedPointer, kWord64)                      \
+  V(kTaggedPointer, kTagged)                      \
+  V(kTaggedPointer, kTaggedSigned)                \
+  V(kTaggedPointer, kTaggedPointer)
+
+#endif  // V8_COMPRESS_POINTERS
+
+#else
+
+#define STORE_PAIR_MACHINE_REPRESENTATION_LIST(V)
+
+#endif  // V8_TARGET_ARCH_64_BIT
+
 #define LOAD_TRANSFORM_LIST(V) \
   V(S128Load8Splat)            \
   V(S128Load16Splat)           \
@@ -749,8 +968,16 @@ std::ostream& operator<<(std::ostream& os, TruncateKind kind) {
   V(S128Load32x2U)             \
   V(S128Load32Zero)            \
   V(S128Load64Zero)            \
+  V(S256Load8Splat)            \
+  V(S256Load16Splat)           \
   V(S256Load32Splat)           \
-  V(S256Load64Splat)
+  V(S256Load64Splat)           \
+  V(S256Load8x16S)             \
+  V(S256Load8x16U)             \
+  V(S256Load16x8S)             \
+  V(S256Load16x8U)             \
+  V(S256Load32x4S)             \
+  V(S256Load32x4U)
 
 #if TAGGED_SIZE_8_BYTES
 
@@ -1084,6 +1311,11 @@ struct MachineOperatorGlobalCache {
     Store##Type##PointerWriteBarrier##Operator()                           \
         : Store##Type##Operator(kPointerWriteBarrier) {}                   \
   };                                                                       \
+  struct Store##Type##IndirectPointerWriteBarrier##Operator final          \
+      : public Store##Type##Operator {                                     \
+    Store##Type##IndirectPointerWriteBarrier##Operator()                   \
+        : Store##Type##Operator(kIndirectPointerWriteBarrier) {}           \
+  };                                                                       \
   struct Store##Type##EphemeronKeyWriteBarrier##Operator final             \
       : public Store##Type##Operator {                                     \
     Store##Type##EphemeronKeyWriteBarrier##Operator()                      \
@@ -1139,6 +1371,8 @@ struct MachineOperatorGlobalCache {
   Store##Type##MapWriteBarrier##Operator kStore##Type##MapWriteBarrier;    \
   Store##Type##PointerWriteBarrier##Operator                               \
       kStore##Type##PointerWriteBarrier;                                   \
+  Store##Type##IndirectPointerWriteBarrier##Operator                       \
+      kStore##Type##IndirectPointerWriteBarrier;                           \
   Store##Type##EphemeronKeyWriteBarrier##Operator                          \
       kStore##Type##EphemeronKeyWriteBarrier;                              \
   Store##Type##FullWriteBarrier##Operator kStore##Type##FullWriteBarrier;  \
@@ -1151,6 +1385,41 @@ struct MachineOperatorGlobalCache {
   MACHINE_REPRESENTATION_LIST(STORE)
 #undef STORE
 
+  friend std::ostream& operator<<(std::ostream& out,
+                                  const StorePairRepresentation rep) {
+    out << rep.first << "," << rep.second;
+    return out;
+  }
+
+#define STORE_PAIR(Type1, Type2)                                           \
+  struct StorePair##Type1##Type2##Operator                                 \
+      : public Operator1<StorePairRepresentation> {                        \
+    explicit StorePair##Type1##Type2##Operator(                            \
+        WriteBarrierKind write_barrier_kind1,                              \
+        WriteBarrierKind write_barrier_kind2)                              \
+        : Operator1<StorePairRepresentation>(                              \
+              IrOpcode::kStorePair,                                        \
+              Operator::kNoDeopt | Operator::kNoRead | Operator::kNoThrow, \
+              "StorePair", 4, 1, 1, 0, 1, 0,                               \
+              {                                                            \
+                  StoreRepresentation(MachineRepresentation::Type1,        \
+                                      write_barrier_kind1),                \
+                  StoreRepresentation(MachineRepresentation::Type2,        \
+                                      write_barrier_kind2),                \
+              }) {}                                                        \
+  };                                                                       \
+  struct StorePair##Type1##Type2##NoWriteBarrier##Operator final           \
+      : public StorePair##Type1##Type2##Operator {                         \
+    StorePair##Type1##Type2##NoWriteBarrier##Operator()                    \
+        : StorePair##Type1##Type2                                          \
+          ##Operator(kNoWriteBarrier, kNoWriteBarrier) {}                  \
+  };                                                                       \
+  StorePair##Type1##Type2##NoWriteBarrier##Operator                        \
+      kStorePair##Type1##Type2##NoWriteBarrier;
+
+  STORE_PAIR_MACHINE_REPRESENTATION_LIST(STORE_PAIR)
+#undef STORE_PAIR
+
 #define ATOMIC_LOAD_WITH_KIND(Type, Kind)                           \
   struct Word32SeqCstLoad##Type##Kind##Operator                     \
       : public Operator1<AtomicLoadParameters> {                    \
@@ -1420,7 +1689,6 @@ struct MachineOperatorGlobalCache {
   StackPointerGreaterThan##Kind##Operator kStackPointerGreaterThan##Kind;
 
   STACK_POINTER_GREATER_THAN(JSFunctionEntry)
-  STACK_POINTER_GREATER_THAN(JSIterationBody)
   STACK_POINTER_GREATER_THAN(CodeStubAssembler)
   STACK_POINTER_GREATER_THAN(Wasm)
 #undef STACK_POINTER_GREATER_THAN
@@ -1724,22 +1992,24 @@ const Operator* MachineOperatorBuilder::StackSlot(MachineRepresentation rep,
 const Operator* MachineOperatorBuilder::Store(StoreRepresentation store_rep) {
   DCHECK_NE(store_rep.representation(), MachineRepresentation::kMapWord);
   switch (store_rep.representation()) {
-#define STORE(kRep)                                              \
-  case MachineRepresentation::kRep:                              \
-    switch (store_rep.write_barrier_kind()) {                    \
-      case kNoWriteBarrier:                                      \
-        return &cache_.k##Store##kRep##NoWriteBarrier;           \
-      case kAssertNoWriteBarrier:                                \
-        return &cache_.k##Store##kRep##AssertNoWriteBarrier;     \
-      case kMapWriteBarrier:                                     \
-        return &cache_.k##Store##kRep##MapWriteBarrier;          \
-      case kPointerWriteBarrier:                                 \
-        return &cache_.k##Store##kRep##PointerWriteBarrier;      \
-      case kEphemeronKeyWriteBarrier:                            \
-        return &cache_.k##Store##kRep##EphemeronKeyWriteBarrier; \
-      case kFullWriteBarrier:                                    \
-        return &cache_.k##Store##kRep##FullWriteBarrier;         \
-    }                                                            \
+#define STORE(kRep)                                                 \
+  case MachineRepresentation::kRep:                                 \
+    switch (store_rep.write_barrier_kind()) {                       \
+      case kNoWriteBarrier:                                         \
+        return &cache_.k##Store##kRep##NoWriteBarrier;              \
+      case kAssertNoWriteBarrier:                                   \
+        return &cache_.k##Store##kRep##AssertNoWriteBarrier;        \
+      case kMapWriteBarrier:                                        \
+        return &cache_.k##Store##kRep##MapWriteBarrier;             \
+      case kPointerWriteBarrier:                                    \
+        return &cache_.k##Store##kRep##PointerWriteBarrier;         \
+      case kIndirectPointerWriteBarrier:                            \
+        return &cache_.k##Store##kRep##IndirectPointerWriteBarrier; \
+      case kEphemeronKeyWriteBarrier:                               \
+        return &cache_.k##Store##kRep##EphemeronKeyWriteBarrier;    \
+      case kFullWriteBarrier:                                       \
+        return &cache_.k##Store##kRep##FullWriteBarrier;            \
+    }                                                               \
     break;
     MACHINE_REPRESENTATION_LIST(STORE)
 #undef STORE
@@ -1750,6 +2020,26 @@ const Operator* MachineOperatorBuilder::Store(StoreRepresentation store_rep) {
   UNREACHABLE();
 }
 
+base::Optional<const Operator*> MachineOperatorBuilder::TryStorePair(
+    StoreRepresentation store_rep1, StoreRepresentation store_rep2) {
+  DCHECK_NE(store_rep1.representation(), MachineRepresentation::kMapWord);
+
+#define STORE(kRep1, kRep2)                                          \
+  static_assert(ElementSizeLog2Of(MachineRepresentation::kRep1) ==   \
+                ElementSizeLog2Of(MachineRepresentation::kRep2));    \
+  if (MachineRepresentation::kRep1 == store_rep1.representation() && \
+      MachineRepresentation::kRep2 == store_rep2.representation()) { \
+    if (store_rep1.write_barrier_kind() != kNoWriteBarrier ||        \
+        store_rep2.write_barrier_kind() != kNoWriteBarrier) {        \
+      return {};                                                     \
+    }                                                                \
+    return &cache_.k##StorePair##kRep1##kRep2##NoWriteBarrier;       \
+  }
+  STORE_PAIR_MACHINE_REPRESENTATION_LIST(STORE);
+#undef STORE
+  return {};
+}
+
 const Operator* MachineOperatorBuilder::ProtectedStore(
     MachineRepresentation rep) {
   switch (rep) {
@@ -1791,12 +2081,12 @@ const Operator* MachineOperatorBuilder::StackPointerGreaterThan(
   switch (kind) {
     case StackCheckKind::kJSFunctionEntry:
       return &cache_.kStackPointerGreaterThanJSFunctionEntry;
-    case StackCheckKind::kJSIterationBody:
-      return &cache_.kStackPointerGreaterThanJSIterationBody;
     case StackCheckKind::kCodeStubAssembler:
       return &cache_.kStackPointerGreaterThanCodeStubAssembler;
     case StackCheckKind::kWasm:
       return &cache_.kStackPointerGreaterThanWasm;
+    case StackCheckKind::kJSIterationBody:
+      UNREACHABLE();
   }
   UNREACHABLE();
 }
@@ -2258,45 +2548,35 @@ const Operator* MachineOperatorBuilder::I64x2ReplaceLaneI32Pair(
                                         0, 1, 0, 0, lane_index);
 }
 
-bool operator==(S128ImmediateParameter const& lhs,
-                S128ImmediateParameter const& rhs) {
-  return (lhs.immediate() == rhs.immediate());
-}
-
-bool operator!=(S128ImmediateParameter const& lhs,
-                S128ImmediateParameter const& rhs) {
-  return !(lhs == rhs);
-}
-
-size_t hash_value(S128ImmediateParameter const& p) {
-  return base::hash_range(p.immediate().begin(), p.immediate().end());
-}
-
-std::ostream& operator<<(std::ostream& os, S128ImmediateParameter const& p) {
-  for (int i = 0; i < 16; i++) {
-    const char* separator = (i < 15) ? "," : "";
-    os << static_cast<uint32_t>(p[i]) << separator;
-  }
-  return os;
-}
-
 S128ImmediateParameter const& S128ImmediateParameterOf(Operator const* op) {
   DCHECK(IrOpcode::kI8x16Shuffle == op->opcode() ||
          IrOpcode::kS128Const == op->opcode());
   return OpParameter<S128ImmediateParameter>(op);
 }
 
+S256ImmediateParameter const& S256ImmediateParameterOf(Operator const* op) {
+  DCHECK(IrOpcode::kI8x32Shuffle == op->opcode() ||
+         IrOpcode::kS256Const == op->opcode());
+  return OpParameter<S256ImmediateParameter>(op);
+}
+
 const Operator* MachineOperatorBuilder::S128Const(const uint8_t value[16]) {
   return zone_->New<Operator1<S128ImmediateParameter>>(
       IrOpcode::kS128Const, Operator::kPure, "Immediate", 0, 0, 0, 1, 0, 0,
       S128ImmediateParameter(value));
 }
 
+const Operator* MachineOperatorBuilder::S256Const(const uint8_t value[32]) {
+  return zone_->New<Operator1<S256ImmediateParameter>>(
+      IrOpcode::kS256Const, Operator::kPure, "Immediate256", 0, 0, 0, 1, 0, 0,
+      S256ImmediateParameter(value));
+}
+
 const Operator* MachineOperatorBuilder::I8x16Shuffle(
     const uint8_t shuffle[16]) {
   return zone_->New<Operator1<S128ImmediateParameter>>(
-      IrOpcode::kI8x16Shuffle, Operator::kPure, "Shuffle", 2, 0, 0, 1, 0, 0,
-      S128ImmediateParameter(shuffle));
+      IrOpcode::kI8x16Shuffle, Operator::kPure, "I8x16Shuffle", 2, 0, 0, 1, 0,
+      0, S128ImmediateParameter(shuffle));
 }
 
 const Operator* MachineOperatorBuilder::I8x16Swizzle(bool relaxed) {
@@ -2307,6 +2587,13 @@ const Operator* MachineOperatorBuilder::I8x16Swizzle(bool relaxed) {
   }
 }
 
+const Operator* MachineOperatorBuilder::I8x32Shuffle(
+    const uint8_t shuffle[32]) {
+  return zone_->New<Operator1<S256ImmediateParameter>>(
+      IrOpcode::kI8x32Shuffle, Operator::kPure, "I8x32Shuffle", 2, 0, 0, 1, 0,
+      0, S256ImmediateParameter(shuffle));
+}
+
 StackCheckKind StackCheckKindOf(Operator const* op) {
   DCHECK_EQ(IrOpcode::kStackPointerGreaterThan, op->opcode());
   return OpParameter<StackCheckKind>(op);
diff --git a/deps/v8/src/compiler/machine-operator.h b/deps/v8/src/compiler/machine-operator.h
index 0853d9d77ff21f..7dac702932901c 100644
--- a/deps/v8/src/compiler/machine-operator.h
+++ b/deps/v8/src/compiler/machine-operator.h
@@ -44,16 +44,6 @@ class OptionalOperator final {
   const Operator* const op_;
 };
 
-enum class MemoryAccessKind {
-  kNormal,
-  kUnaligned,
-  kProtected,
-};
-
-size_t hash_value(MemoryAccessKind);
-
-V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, MemoryAccessKind);
-
 // A Load needs a MachineType.
 using LoadRepresentation = MachineType;
 
@@ -114,20 +104,36 @@ V8_EXPORT_PRIVATE AtomicOpParameters AtomicOpParametersOf(Operator const*)
     V8_WARN_UNUSED_RESULT;
 
 enum class LoadTransformation {
+  // 128-bit LoadSplats must be first.
   kS128Load8Splat,
   kS128Load16Splat,
   kS128Load32Splat,
   kS128Load64Splat,
+  kFirst128Splat = kS128Load8Splat,
+  kLast128Splat = kS128Load64Splat,
+  // 128-bit LoadExtend.
   kS128Load8x8S,
   kS128Load8x8U,
   kS128Load16x4S,
   kS128Load16x4U,
   kS128Load32x2S,
   kS128Load32x2U,
+  kFirst128Extend = kS128Load8x8S,
+  kLast128Extend = kS128Load32x2U,
   kS128Load32Zero,
   kS128Load64Zero,
+  // 256-bit transformations must be last.
+  kS256Load8Splat,
+  kS256Load16Splat,
   kS256Load32Splat,
   kS256Load64Splat,
+  kS256Load8x16S,
+  kS256Load8x16U,
+  kS256Load16x8S,
+  kS256Load16x8U,
+  kS256Load32x4S,
+  kS256Load32x4U,
+  kFirst256Transform = kS256Load8Splat
 };
 
 size_t hash_value(LoadTransformation);
@@ -180,6 +186,14 @@ class StoreRepresentation final {
   WriteBarrierKind write_barrier_kind_;
 };
 
+struct StorePairRepresentation final
+    : public std::pair<StoreRepresentation, StoreRepresentation> {
+  StorePairRepresentation(StoreRepresentation first, StoreRepresentation second)
+      : std::pair<StoreRepresentation, StoreRepresentation>(first, second) {}
+  friend std::ostream& operator<<(std::ostream& out,
+                                  const StorePairRepresentation rep);
+};
+
 V8_EXPORT_PRIVATE bool operator==(StoreRepresentation, StoreRepresentation);
 bool operator!=(StoreRepresentation, StoreRepresentation);
 
@@ -190,6 +204,9 @@ V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, StoreRepresentation);
 V8_EXPORT_PRIVATE StoreRepresentation const& StoreRepresentationOf(
     Operator const*) V8_WARN_UNUSED_RESULT;
 
+V8_EXPORT_PRIVATE StorePairRepresentation const& StorePairRepresentationOf(
+    Operator const*) V8_WARN_UNUSED_RESULT;
+
 // A Word(32|64)AtomicStore needs both a StoreRepresentation and a memory order.
 class AtomicStoreParameters final {
  public:
@@ -274,33 +291,60 @@ V8_EXPORT_PRIVATE StackSlotRepresentation const& StackSlotRepresentationOf(
 
 MachineType AtomicOpType(Operator const* op) V8_WARN_UNUSED_RESULT;
 
-class S128ImmediateParameter {
+template <const int simd_size = kSimd128Size,
+          typename = std::enable_if_t<simd_size == kSimd128Size ||
+                                      simd_size == kSimd256Size>>
+class SimdImmediateParameter {
  public:
-  explicit S128ImmediateParameter(const uint8_t immediate[16]) {
-    std::copy(immediate, immediate + 16, immediate_.begin());
+  explicit SimdImmediateParameter(const uint8_t immediate[simd_size]) {
+    std::copy(immediate, immediate + simd_size, immediate_.begin());
   }
-  S128ImmediateParameter() = default;
-  const std::array<uint8_t, 16>& immediate() const { return immediate_; }
+  SimdImmediateParameter() = default;
+  const std::array<uint8_t, simd_size>& immediate() const { return immediate_; }
   const uint8_t* data() const { return immediate_.data(); }
   uint8_t operator[](int x) const { return immediate_[x]; }
 
  private:
-  std::array<uint8_t, 16> immediate_;
+  std::array<uint8_t, simd_size> immediate_;
 };
 
-V8_EXPORT_PRIVATE bool operator==(S128ImmediateParameter const& lhs,
-                                  S128ImmediateParameter const& rhs);
-bool operator!=(S128ImmediateParameter const& lhs,
-                S128ImmediateParameter const& rhs);
-
-size_t hash_value(S128ImmediateParameter const& p);
-
-V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&,
-                                           S128ImmediateParameter const&);
+using S128ImmediateParameter = SimdImmediateParameter<kSimd128Size>;
+using S256ImmediateParameter = SimdImmediateParameter<kSimd256Size>;
+
+template <const int simd_size>
+V8_EXPORT_PRIVATE inline bool operator==(
+    SimdImmediateParameter<simd_size> const& lhs,
+    SimdImmediateParameter<simd_size> const& rhs) {
+  return (lhs.immediate() == rhs.immediate());
+}
+
+template <const int simd_size>
+bool operator!=(SimdImmediateParameter<simd_size> const& lhs,
+                SimdImmediateParameter<simd_size> const& rhs) {
+  return !(lhs == rhs);
+}
+
+template <const int simd_size>
+size_t hash_value(SimdImmediateParameter<simd_size> const& p) {
+  return base::hash_range(p.immediate().begin(), p.immediate().end());
+}
+
+template <const int simd_size>
+V8_EXPORT_PRIVATE inline std::ostream& operator<<(
+    std::ostream& os, SimdImmediateParameter<simd_size> const& p) {
+  for (int i = 0; i < simd_size; i++) {
+    const char* separator = (i < simd_size - 1) ? "," : "";
+    os << static_cast<uint32_t>(p[i]) << separator;
+  }
+  return os;
+}
 
 V8_EXPORT_PRIVATE S128ImmediateParameter const& S128ImmediateParameterOf(
     Operator const* op) V8_WARN_UNUSED_RESULT;
 
+V8_EXPORT_PRIVATE S256ImmediateParameter const& S256ImmediateParameterOf(
+    Operator const* op) V8_WARN_UNUSED_RESULT;
+
 StackCheckKind StackCheckKindOf(Operator const* op) V8_WARN_UNUSED_RESULT;
 
 // ShiftKind::kShiftOutZeros means that it is guaranteed that the bits shifted
@@ -360,6 +404,7 @@ class V8_EXPORT_PRIVATE MachineOperatorBuilder final
     kSatConversionIsSafe = 1u << 26,
     kWord32Select = 1u << 27,
     kWord64Select = 1u << 28,
+    kLoadStorePairs = 1u << 29,
     kAllOptionalOps =
         kFloat32RoundDown | kFloat64RoundDown | kFloat32RoundUp |
         kFloat64RoundUp | kFloat32RoundTruncate | kFloat64RoundTruncate |
@@ -368,7 +413,8 @@ class V8_EXPORT_PRIVATE MachineOperatorBuilder final
         kWord64Popcnt | kWord32ReverseBits | kWord64ReverseBits |
         kInt32AbsWithOverflow | kInt64AbsWithOverflow | kWord32Rol |
         kWord64Rol | kWord64RolLowerable | kSatConversionIsSafe |
-        kFloat32Select | kFloat64Select | kWord32Select | kWord64Select
+        kFloat32Select | kFloat64Select | kWord32Select | kWord64Select |
+        kLoadStorePairs
   };
   using Flags = base::Flags<Flag, unsigned>;
 
@@ -477,6 +523,13 @@ class V8_EXPORT_PRIVATE MachineOperatorBuilder final
   // generate the correct value if a saturating conversion is requested.
   bool SatConversionIsSafe() const { return flags_ & kSatConversionIsSafe; }
 
+  // Return true if the target suppoerts performing a pair of loads/stores in
+  // a single operation.
+  bool SupportsLoadStorePairs() const {
+    return !v8_flags.enable_unconditional_write_barriers &&
+           (flags_ & kLoadStorePairs);
+  }
+
   const Operator* Word64And();
   const Operator* Word64Or();
   const Operator* Word64Xor();
@@ -939,6 +992,8 @@ class V8_EXPORT_PRIVATE MachineOperatorBuilder final
   const Operator* S128AndNot();
 
   const Operator* I8x16Swizzle(bool relaxed = false);
+  // Helper for turboshaft/recreate-schedule.cc.
+  const Operator* I8x16RelaxedSwizzle() { return I8x16Swizzle(true); }
   const Operator* I8x16Shuffle(const uint8_t shuffle[16]);
 
   const Operator* V128AnyTrue();
@@ -967,20 +1022,146 @@ class V8_EXPORT_PRIVATE MachineOperatorBuilder final
   const Operator* TraceInstruction(uint32_t markid);
 
   // SIMD256
+  const Operator* F64x4Min();
+  const Operator* F64x4Max();
+  const Operator* F64x4Add();
+  const Operator* F64x4Sqrt();
+  const Operator* F32x8Abs();
+  const Operator* F32x8Neg();
+  const Operator* F32x8Sqrt();
   const Operator* F32x8Add();
+  const Operator* I64x4Add();
+  const Operator* I32x8Add();
+  const Operator* I16x16Add();
+  const Operator* I8x32Add();
+  const Operator* F64x4Sub();
   const Operator* F32x8Sub();
+  const Operator* I64x4Sub();
+  const Operator* I32x8Sub();
+  const Operator* I16x16Sub();
+  const Operator* I8x32Sub();
+  const Operator* F64x4Mul();
   const Operator* F32x8Mul();
+  const Operator* I64x4Mul();
+  const Operator* I32x8Mul();
+  const Operator* I16x16Mul();
+  const Operator* F64x4Div();
   const Operator* F32x8Div();
+  const Operator* I16x16AddSatS();
+  const Operator* I8x32AddSatS();
+  const Operator* I16x16AddSatU();
+  const Operator* I8x32AddSatU();
+  const Operator* I16x16SubSatS();
+  const Operator* I8x32SubSatS();
+  const Operator* I16x16SubSatU();
+  const Operator* I8x32SubSatU();
   const Operator* F32x8Min();
   const Operator* F32x8Max();
   const Operator* F32x8Pmin();
   const Operator* F32x8Pmax();
   const Operator* F32x8Eq();
+  const Operator* F64x4Eq();
+  const Operator* I64x4Eq();
+  const Operator* I32x8Eq();
+  const Operator* I16x16Eq();
+  const Operator* I8x32Eq();
   const Operator* F32x8Ne();
+  const Operator* F64x4Ne();
+  const Operator* I64x4GtS();
+  const Operator* I32x8GtS();
+  const Operator* I16x16GtS();
+  const Operator* I8x32GtS();
+  const Operator* F64x4Lt();
   const Operator* F32x8Lt();
+  const Operator* F64x4Le();
   const Operator* F32x8Le();
-  const Operator* S256Select();
+  const Operator* I32x8MinS();
+  const Operator* I16x16MinS();
+  const Operator* I8x32MinS();
+  const Operator* I32x8MinU();
+  const Operator* I16x16MinU();
+  const Operator* I8x32MinU();
+  const Operator* I32x8MaxS();
+  const Operator* I16x16MaxS();
+  const Operator* I8x32MaxS();
+  const Operator* I32x8MaxU();
+  const Operator* I16x16MaxU();
+  const Operator* I8x32MaxU();
+  const Operator* I64x4Ne();
+  const Operator* I64x4GeS();
+  const Operator* I32x8Ne();
+  const Operator* I32x8GtU();
+  const Operator* I32x8GeS();
+  const Operator* I32x8GeU();
+  const Operator* I16x16Ne();
+  const Operator* I16x16GtU();
+  const Operator* I16x16GeS();
+  const Operator* I16x16GeU();
+  const Operator* I8x32Ne();
+  const Operator* I8x32GtU();
+  const Operator* I8x32GeS();
+  const Operator* I8x32GeU();
+  const Operator* I32x8UConvertF32x8();
+  const Operator* F64x4ConvertI32x4S();
+  const Operator* F32x8SConvertI32x8();
+  const Operator* F32x8UConvertI32x8();
+  const Operator* F32x4DemoteF64x4();
+  const Operator* I64x4SConvertI32x4();
+  const Operator* I64x4UConvertI32x4();
+  const Operator* I32x8SConvertI16x8();
+  const Operator* I32x8UConvertI16x8();
+  const Operator* I16x16SConvertI8x16();
+  const Operator* I16x16UConvertI8x16();
+  const Operator* I16x16SConvertI32x8();
+  const Operator* I16x16UConvertI32x8();
+  const Operator* I8x32SConvertI16x16();
+  const Operator* I8x32UConvertI16x16();
+  const Operator* I32x8Neg();
+  const Operator* I32x8Abs();
+  const Operator* I16x16Neg();
+  const Operator* I16x16Abs();
+  const Operator* I8x32Neg();
+  const Operator* I8x32Abs();
+  const Operator* I64x4Shl();
+  const Operator* I64x4ShrU();
+  const Operator* I32x8Shl();
+  const Operator* I32x8ShrS();
+  const Operator* I32x8ShrU();
+  const Operator* I16x16Shl();
+  const Operator* I16x16ShrS();
+  const Operator* I16x16ShrU();
+  const Operator* I32x8DotI16x16S();
+  const Operator* I16x16RoundingAverageU();
+  const Operator* I8x32RoundingAverageU();
+  const Operator* I64x4ExtMulI32x4S();
+  const Operator* I64x4ExtMulI32x4U();
+  const Operator* I32x8ExtMulI16x8S();
+  const Operator* I32x8ExtMulI16x8U();
+  const Operator* I16x16ExtMulI8x16S();
+  const Operator* I16x16ExtMulI8x16U();
+  const Operator* I32x8ExtAddPairwiseI16x16S();
+  const Operator* I32x8ExtAddPairwiseI16x16U();
+  const Operator* I16x16ExtAddPairwiseI8x32S();
+  const Operator* I16x16ExtAddPairwiseI8x32U();
   const Operator* ExtractF128(int32_t lane_index);
+  const Operator* I64x4Splat();
+  const Operator* I32x8Splat();
+  const Operator* I16x16Splat();
+  const Operator* I8x32Splat();
+  const Operator* F64x4Pmin();
+  const Operator* F64x4Pmax();
+  const Operator* F64x4Splat();
+  const Operator* F32x8Splat();
+  const Operator* I8x32Shuffle(const uint8_t shuffle[32]);
+
+  const Operator* S256Const(const uint8_t value[32]);
+  const Operator* S256Zero();
+  const Operator* S256And();
+  const Operator* S256Or();
+  const Operator* S256Xor();
+  const Operator* S256Not();
+  const Operator* S256Select();
+  const Operator* S256AndNot();
 
   // load [base + index]
   const Operator* Load(LoadRepresentation rep);
@@ -997,6 +1178,8 @@ class V8_EXPORT_PRIVATE MachineOperatorBuilder final
 
   // store [base + index], value
   const Operator* Store(StoreRepresentation rep);
+  base::Optional<const Operator*> TryStorePair(StoreRepresentation rep1,
+                                               StoreRepresentation rep2);
   const Operator* ProtectedStore(MachineRepresentation rep);
   const Operator* StoreTrapOnNull(StoreRepresentation rep);
 
diff --git a/deps/v8/src/compiler/map-inference.cc b/deps/v8/src/compiler/map-inference.cc
index 3cf62faabde8b4..7993098e8e1072 100644
--- a/deps/v8/src/compiler/map-inference.cc
+++ b/deps/v8/src/compiler/map-inference.cc
@@ -15,15 +15,13 @@ namespace internal {
 namespace compiler {
 
 MapInference::MapInference(JSHeapBroker* broker, Node* object, Effect effect)
-    : broker_(broker), object_(object), maps_(broker->zone()) {
-  ZoneRefUnorderedSet<MapRef> maps(broker->zone());
+    : broker_(broker), object_(object) {
   auto result =
-      NodeProperties::InferMapsUnsafe(broker_, object_, effect, &maps);
-  maps_.insert(maps_.end(), maps.begin(), maps.end());
+      NodeProperties::InferMapsUnsafe(broker_, object_, effect, &maps_);
   maps_state_ = (result == NodeProperties::kUnreliableMaps)
                     ? kUnreliableDontNeedGuard
                     : kReliableOrGuarded;
-  DCHECK_EQ(maps_.empty(), result == NodeProperties::kNoMaps);
+  DCHECK_EQ(maps_.is_empty(), result == NodeProperties::kNoMaps);
 }
 
 MapInference::~MapInference() { CHECK(Safe()); }
@@ -39,7 +37,7 @@ void MapInference::SetNeedGuardIfUnreliable() {
 
 void MapInference::SetGuarded() { maps_state_ = kReliableOrGuarded; }
 
-bool MapInference::HaveMaps() const { return !maps_.empty(); }
+bool MapInference::HaveMaps() const { return !maps_.is_empty(); }
 
 bool MapInference::AllOfInstanceTypesAreJSReceiver() const {
   return AllOfInstanceTypesUnsafe(
@@ -67,9 +65,7 @@ bool MapInference::AllOfInstanceTypesUnsafe(
     std::function<bool(InstanceType)> f) const {
   CHECK(HaveMaps());
 
-  auto instance_type = [f](const MapRef& map) {
-    return f(map.instance_type());
-  };
+  auto instance_type = [f](MapRef map) { return f(map.instance_type()); };
   return std::all_of(maps_.begin(), maps_.end(), instance_type);
 }
 
@@ -77,23 +73,20 @@ bool MapInference::AnyOfInstanceTypesUnsafe(
     std::function<bool(InstanceType)> f) const {
   CHECK(HaveMaps());
 
-  auto instance_type = [f](const MapRef& map) {
-    return f(map.instance_type());
-  };
+  auto instance_type = [f](MapRef map) { return f(map.instance_type()); };
 
   return std::any_of(maps_.begin(), maps_.end(), instance_type);
 }
 
-ZoneVector<MapRef> const& MapInference::GetMaps() {
+ZoneRefSet<Map> const& MapInference::GetMaps() {
   SetNeedGuardIfUnreliable();
   return maps_;
 }
 
-bool MapInference::Is(const MapRef& expected_map) {
+bool MapInference::Is(MapRef expected_map) {
   if (!HaveMaps()) return false;
-  const ZoneVector<MapRef>& maps = GetMaps();
-  if (maps.size() != 1) return false;
-  return maps[0].equals(expected_map);
+  if (maps_.size() != 1) return false;
+  return maps_.at(0).equals(expected_map);
 }
 
 void MapInference::InsertMapChecks(JSGraph* jsgraph, Effect* effect,
@@ -101,12 +94,8 @@ void MapInference::InsertMapChecks(JSGraph* jsgraph, Effect* effect,
                                    const FeedbackSource& feedback) {
   CHECK(HaveMaps());
   CHECK(feedback.IsValid());
-  ZoneHandleSet<Map> maps;
-  for (const MapRef& map : maps_) {
-    maps.insert(map.object(), jsgraph->graph()->zone());
-  }
   *effect = jsgraph->graph()->NewNode(
-      jsgraph->simplified()->CheckMaps(CheckMapsFlag::kNone, maps, feedback),
+      jsgraph->simplified()->CheckMaps(CheckMapsFlag::kNone, maps_, feedback),
       object_, *effect, control);
   SetGuarded();
 }
@@ -133,10 +122,10 @@ bool MapInference::RelyOnMapsHelper(CompilationDependencies* dependencies,
                                     const FeedbackSource& feedback) {
   if (Safe()) return true;
 
-  auto is_stable = [](const MapRef& map) { return map.is_stable(); };
+  auto is_stable = [](MapRef map) { return map.is_stable(); };
   if (dependencies != nullptr &&
-      std::all_of(maps_.cbegin(), maps_.cend(), is_stable)) {
-    for (const MapRef& map : maps_) {
+      std::all_of(maps_.begin(), maps_.end(), is_stable)) {
+    for (MapRef map : maps_) {
       dependencies->DependOnStableMap(map);
     }
     SetGuarded();
diff --git a/deps/v8/src/compiler/map-inference.h b/deps/v8/src/compiler/map-inference.h
index 6d84035d4be6b6..a3bbba9aca3aee 100644
--- a/deps/v8/src/compiler/map-inference.h
+++ b/deps/v8/src/compiler/map-inference.h
@@ -50,10 +50,10 @@ class MapInference {
 
   // These queries require a guard. (Even instance types are generally not
   // reliable because of how the representation of a string can change.)
-  V8_WARN_UNUSED_RESULT ZoneVector<MapRef> const& GetMaps();
+  V8_WARN_UNUSED_RESULT ZoneRefSet<Map> const& GetMaps();
   V8_WARN_UNUSED_RESULT bool AllOfInstanceTypes(
       std::function<bool(InstanceType)> f);
-  V8_WARN_UNUSED_RESULT bool Is(const MapRef& expected_map);
+  V8_WARN_UNUSED_RESULT bool Is(MapRef expected_map);
 
   // These methods provide a guard.
   //
@@ -81,7 +81,7 @@ class MapInference {
   JSHeapBroker* const broker_;
   Node* const object_;
 
-  ZoneVector<MapRef> maps_;
+  ZoneRefSet<Map> maps_;
   enum {
     kReliableOrGuarded,
     kUnreliableDontNeedGuard,
diff --git a/deps/v8/src/compiler/memory-lowering.cc b/deps/v8/src/compiler/memory-lowering.cc
index 3593c6e9616f13..8394c172c04273 100644
--- a/deps/v8/src/compiler/memory-lowering.cc
+++ b/deps/v8/src/compiler/memory-lowering.cc
@@ -158,9 +158,9 @@ Node* MemoryLowering::AlignToAllocationAlignment(Node* value) {
   return already_aligned.PhiAt(0);
 }
 
-Reduction MemoryLowering::ReduceAllocateRaw(
-    Node* node, AllocationType allocation_type,
-    AllowLargeObjects allow_large_objects, AllocationState const** state_ptr) {
+Reduction MemoryLowering::ReduceAllocateRaw(Node* node,
+                                            AllocationType allocation_type,
+                                            AllocationState const** state_ptr) {
   DCHECK_EQ(IrOpcode::kAllocateRaw, node->opcode());
   DCHECK_IMPLIES(allocation_folding_ == AllocationFolding::kDoAllocationFolding,
                  state_ptr != nullptr);
@@ -182,17 +182,9 @@ Reduction MemoryLowering::ReduceAllocateRaw(
   Node* allocate_builtin;
   if (isolate_ != nullptr) {
     if (allocation_type == AllocationType::kYoung) {
-      if (allow_large_objects == AllowLargeObjects::kTrue) {
-        allocate_builtin = __ AllocateInYoungGenerationStubConstant();
-      } else {
-        allocate_builtin = __ AllocateRegularInYoungGenerationStubConstant();
-      }
+      allocate_builtin = __ AllocateInYoungGenerationStubConstant();
     } else {
-      if (allow_large_objects == AllowLargeObjects::kTrue) {
-        allocate_builtin = __ AllocateInOldGenerationStubConstant();
-      } else {
-        allocate_builtin = __ AllocateRegularInOldGenerationStubConstant();
-      }
+      allocate_builtin = __ AllocateInOldGenerationStubConstant();
     }
   } else {
     // This lowering is used by Wasm, where we compile isolate-independent
@@ -201,17 +193,9 @@ Reduction MemoryLowering::ReduceAllocateRaw(
 #if V8_ENABLE_WEBASSEMBLY
     Builtin builtin;
     if (allocation_type == AllocationType::kYoung) {
-      if (allow_large_objects == AllowLargeObjects::kTrue) {
-        builtin = Builtin::kAllocateInYoungGeneration;
-      } else {
-        builtin = Builtin::kAllocateRegularInYoungGeneration;
-      }
+      builtin = Builtin::kAllocateInYoungGeneration;
     } else {
-      if (allow_large_objects == AllowLargeObjects::kTrue) {
-        builtin = Builtin::kAllocateInOldGeneration;
-      } else {
-        builtin = Builtin::kAllocateRegularInOldGeneration;
-      }
+      builtin = Builtin::kAllocateInOldGeneration;
     }
     static_assert(std::is_same<Smi, BuiltinPtr>(), "BuiltinPtr must be Smi");
     allocate_builtin =
@@ -372,11 +356,9 @@ Reduction MemoryLowering::ReduceAllocateRaw(
     // Check if we can do bump pointer allocation here.
     Node* check = __ UintLessThan(new_top, limit);
     __ GotoIfNot(check, &call_runtime);
-    if (allow_large_objects == AllowLargeObjects::kTrue) {
-      __ GotoIfNot(
-          __ UintLessThan(size, __ IntPtrConstant(kMaxRegularHeapObjectSize)),
-          &call_runtime);
-    }
+    __ GotoIfNot(
+        __ UintLessThan(size, __ IntPtrConstant(kMaxRegularHeapObjectSize)),
+        &call_runtime);
     __ Store(StoreRepresentation(MachineType::PointerRepresentation(),
                                  kNoWriteBarrier),
              top_address, __ IntPtrConstant(0), new_top);
@@ -483,7 +465,7 @@ Reduction MemoryLowering::ReduceLoadExternalPointerField(Node* node) {
           : __ ExternalConstant(
                 ExternalReference::external_pointer_table_address(isolate()));
   Node* table = __ Load(MachineType::Pointer(), table_address,
-                        Internals::kExternalPointerTableBufferOffset);
+                        Internals::kExternalPointerTableBasePointerOffset);
   Node* pointer =
       __ Load(MachineType::Pointer(), table, __ ChangeUint32ToUint64(offset));
   pointer = __ WordAnd(pointer, __ IntPtrConstant(~tag));
@@ -690,8 +672,7 @@ bool ValueNeedsWriteBarrier(Node* value, Isolate* isolate) {
 Reduction MemoryLowering::ReduceAllocateRaw(Node* node) {
   DCHECK_EQ(IrOpcode::kAllocateRaw, node->opcode());
   const AllocateParameters& allocation = AllocateParametersOf(node->op());
-  return ReduceAllocateRaw(node, allocation.allocation_type(),
-                           allocation.allow_large_objects(), nullptr);
+  return ReduceAllocateRaw(node, allocation.allocation_type(), nullptr);
 }
 
 WriteBarrierKind MemoryLowering::ComputeWriteBarrierKind(
diff --git a/deps/v8/src/compiler/memory-lowering.h b/deps/v8/src/compiler/memory-lowering.h
index 536e910faea5f1..6b2aa5b30dfa27 100644
--- a/deps/v8/src/compiler/memory-lowering.h
+++ b/deps/v8/src/compiler/memory-lowering.h
@@ -89,7 +89,6 @@ class MemoryLowering final : public Reducer {
   // Specific reducers for each optype to enable keeping track of
   // AllocationState by the MemoryOptimizer.
   Reduction ReduceAllocateRaw(Node* node, AllocationType allocation_type,
-                              AllowLargeObjects allow_large_objects,
                               AllocationState const** state);
   Reduction ReduceLoadFromObject(Node* node);
   Reduction ReduceLoadElement(Node* node);
diff --git a/deps/v8/src/compiler/memory-optimizer.cc b/deps/v8/src/compiler/memory-optimizer.cc
index 507a871ac40b83..842ac014f90a3f 100644
--- a/deps/v8/src/compiler/memory-optimizer.cc
+++ b/deps/v8/src/compiler/memory-optimizer.cc
@@ -190,6 +190,7 @@ MemoryOptimizer::MemoryOptimizer(
     : graph_assembler_(broker, jsgraph, zone, BranchSemantics::kMachine),
       memory_lowering_(jsgraph, zone, &graph_assembler_, allocation_folding,
                        WriteBarrierAssertFailed, function_debug_name),
+      wasm_address_reassociation_(jsgraph, zone),
       jsgraph_(jsgraph),
       empty_state_(AllocationState::Empty(zone)),
       pending_(zone),
@@ -198,17 +199,21 @@ MemoryOptimizer::MemoryOptimizer(
       tick_counter_(tick_counter) {}
 
 void MemoryOptimizer::Optimize() {
-  EnqueueUses(graph()->start(), empty_state());
+  EnqueueUses(graph()->start(), empty_state(), graph()->start()->id());
   while (!tokens_.empty()) {
     Token const token = tokens_.front();
     tokens_.pop();
-    VisitNode(token.node, token.state);
+    VisitNode(token.node, token.state, token.effect_chain);
+  }
+  if (v8_flags.turbo_wasm_address_reassociation) {
+    wasm_address_reassociation()->Optimize();
   }
   DCHECK(pending_.empty());
   DCHECK(tokens_.empty());
 }
 
-void MemoryOptimizer::VisitNode(Node* node, AllocationState const* state) {
+void MemoryOptimizer::VisitNode(Node* node, AllocationState const* state,
+                                NodeId effect_chain) {
   tick_counter_->TickAndMaybeEnterSafepoint();
   DCHECK(!node->IsDead());
   DCHECK_LT(0, node->op()->EffectInputCount());
@@ -218,29 +223,36 @@ void MemoryOptimizer::VisitNode(Node* node, AllocationState const* state) {
       // linearization.
       UNREACHABLE();
     case IrOpcode::kAllocateRaw:
-      return VisitAllocateRaw(node, state);
+      return VisitAllocateRaw(node, state, effect_chain);
     case IrOpcode::kCall:
-      return VisitCall(node, state);
+      return VisitCall(node, state, effect_chain);
     case IrOpcode::kLoadFromObject:
     case IrOpcode::kLoadImmutableFromObject:
-      return VisitLoadFromObject(node, state);
+      return VisitLoadFromObject(node, state, effect_chain);
     case IrOpcode::kLoadElement:
-      return VisitLoadElement(node, state);
+      return VisitLoadElement(node, state, effect_chain);
     case IrOpcode::kLoadField:
-      return VisitLoadField(node, state);
+      return VisitLoadField(node, state, effect_chain);
+    case IrOpcode::kProtectedLoad:
+      return VisitProtectedLoad(node, state, effect_chain);
+    case IrOpcode::kProtectedStore:
+      return VisitProtectedStore(node, state, effect_chain);
     case IrOpcode::kStoreToObject:
     case IrOpcode::kInitializeImmutableInObject:
-      return VisitStoreToObject(node, state);
+      return VisitStoreToObject(node, state, effect_chain);
     case IrOpcode::kStoreElement:
-      return VisitStoreElement(node, state);
+      return VisitStoreElement(node, state, effect_chain);
     case IrOpcode::kStoreField:
-      return VisitStoreField(node, state);
+      return VisitStoreField(node, state, effect_chain);
     case IrOpcode::kStore:
-      return VisitStore(node, state);
+      return VisitStore(node, state, effect_chain);
+    case IrOpcode::kStorePair:
+      // Store pairing should happen after this pass.
+      UNREACHABLE();
     default:
       if (!CanAllocate(node)) {
         // These operations cannot trigger GC.
-        return VisitOtherEffect(node, state);
+        return VisitOtherEffect(node, state, effect_chain);
       }
   }
   DCHECK_EQ(0, node->op()->EffectOutputCount());
@@ -269,8 +281,8 @@ void MemoryOptimizer::ReplaceUsesAndKillNode(Node* node, Node* replacement) {
   node->Kill();
 }
 
-void MemoryOptimizer::VisitAllocateRaw(Node* node,
-                                       AllocationState const* state) {
+void MemoryOptimizer::VisitAllocateRaw(Node* node, AllocationState const* state,
+                                       NodeId effect_chain) {
   DCHECK_EQ(IrOpcode::kAllocateRaw, node->opcode());
   const AllocateParameters& allocation = AllocateParametersOf(node->op());
   AllocationType allocation_type = allocation.allocation_type();
@@ -302,48 +314,51 @@ void MemoryOptimizer::VisitAllocateRaw(Node* node,
     }
   }
 
-  Reduction reduction = memory_lowering()->ReduceAllocateRaw(
-      node, allocation_type, allocation.allow_large_objects(), &state);
+  Reduction reduction =
+      memory_lowering()->ReduceAllocateRaw(node, allocation_type, &state);
   CHECK(reduction.Changed() && reduction.replacement() != node);
 
   ReplaceUsesAndKillNode(node, reduction.replacement());
 
-  EnqueueUses(state->effect(), state);
+  EnqueueUses(state->effect(), state, effect_chain);
 }
 
 void MemoryOptimizer::VisitLoadFromObject(Node* node,
-                                          AllocationState const* state) {
+                                          AllocationState const* state,
+                                          NodeId effect_chain) {
   DCHECK(node->opcode() == IrOpcode::kLoadFromObject ||
          node->opcode() == IrOpcode::kLoadImmutableFromObject);
   Reduction reduction = memory_lowering()->ReduceLoadFromObject(node);
-  EnqueueUses(node, state);
+  EnqueueUses(node, state, effect_chain);
   if (V8_MAP_PACKING_BOOL && reduction.replacement() != node) {
     ReplaceUsesAndKillNode(node, reduction.replacement());
   }
 }
 
 void MemoryOptimizer::VisitStoreToObject(Node* node,
-                                         AllocationState const* state) {
+                                         AllocationState const* state,
+                                         NodeId effect_chain) {
   DCHECK(node->opcode() == IrOpcode::kStoreToObject ||
          node->opcode() == IrOpcode::kInitializeImmutableInObject);
   memory_lowering()->ReduceStoreToObject(node, state);
-  EnqueueUses(node, state);
+  EnqueueUses(node, state, effect_chain);
 }
 
-void MemoryOptimizer::VisitLoadElement(Node* node,
-                                       AllocationState const* state) {
+void MemoryOptimizer::VisitLoadElement(Node* node, AllocationState const* state,
+                                       NodeId effect_chain) {
   DCHECK_EQ(IrOpcode::kLoadElement, node->opcode());
   memory_lowering()->ReduceLoadElement(node);
-  EnqueueUses(node, state);
+  EnqueueUses(node, state, effect_chain);
 }
 
-void MemoryOptimizer::VisitLoadField(Node* node, AllocationState const* state) {
+void MemoryOptimizer::VisitLoadField(Node* node, AllocationState const* state,
+                                     NodeId effect_chain) {
   DCHECK_EQ(IrOpcode::kLoadField, node->opcode());
   Reduction reduction = memory_lowering()->ReduceLoadField(node);
   DCHECK(reduction.Changed());
   // In case of replacement, the replacement graph should not require futher
   // lowering, so we can proceed iterating the graph from the node uses.
-  EnqueueUses(node, state);
+  EnqueueUses(node, state, effect_chain);
 
   // Node can be replaced under two cases:
   //   1. V8_ENABLE_SANDBOX is true and loading an external pointer value.
@@ -356,37 +371,64 @@ void MemoryOptimizer::VisitLoadField(Node* node, AllocationState const* state) {
   }
 }
 
+void MemoryOptimizer::VisitProtectedLoad(Node* node,
+                                         AllocationState const* state,
+                                         NodeId effect_chain) {
+  DCHECK_EQ(IrOpcode::kProtectedLoad, node->opcode());
+  if (v8_flags.turbo_wasm_address_reassociation) {
+    wasm_address_reassociation()->VisitProtectedMemOp(node, effect_chain);
+    EnqueueUses(node, state, effect_chain);
+  } else {
+    VisitOtherEffect(node, state, effect_chain);
+  }
+}
+
+void MemoryOptimizer::VisitProtectedStore(Node* node,
+                                          AllocationState const* state,
+                                          NodeId effect_chain) {
+  DCHECK_EQ(IrOpcode::kProtectedStore, node->opcode());
+  if (v8_flags.turbo_wasm_address_reassociation) {
+    wasm_address_reassociation()->VisitProtectedMemOp(node, effect_chain);
+    EnqueueUses(node, state, effect_chain);
+  } else {
+    VisitOtherEffect(node, state, effect_chain);
+  }
+}
+
 void MemoryOptimizer::VisitStoreElement(Node* node,
-                                        AllocationState const* state) {
+                                        AllocationState const* state,
+                                        NodeId effect_chain) {
   DCHECK_EQ(IrOpcode::kStoreElement, node->opcode());
   memory_lowering()->ReduceStoreElement(node, state);
-  EnqueueUses(node, state);
+  EnqueueUses(node, state, effect_chain);
 }
 
-void MemoryOptimizer::VisitStoreField(Node* node,
-                                      AllocationState const* state) {
+void MemoryOptimizer::VisitStoreField(Node* node, AllocationState const* state,
+                                      NodeId effect_chain) {
   DCHECK_EQ(IrOpcode::kStoreField, node->opcode());
   memory_lowering()->ReduceStoreField(node, state);
-  EnqueueUses(node, state);
+  EnqueueUses(node, state, effect_chain);
 }
-void MemoryOptimizer::VisitStore(Node* node, AllocationState const* state) {
+void MemoryOptimizer::VisitStore(Node* node, AllocationState const* state,
+                                 NodeId effect_chain) {
   DCHECK_EQ(IrOpcode::kStore, node->opcode());
   memory_lowering()->ReduceStore(node, state);
-  EnqueueUses(node, state);
+  EnqueueUses(node, state, effect_chain);
 }
 
-void MemoryOptimizer::VisitCall(Node* node, AllocationState const* state) {
+void MemoryOptimizer::VisitCall(Node* node, AllocationState const* state,
+                                NodeId effect_chain) {
   DCHECK_EQ(IrOpcode::kCall, node->opcode());
   // If the call can allocate, we start with a fresh state.
   if (!(CallDescriptorOf(node->op())->flags() & CallDescriptor::kNoAllocate)) {
     state = empty_state();
   }
-  EnqueueUses(node, state);
+  EnqueueUses(node, state, effect_chain);
 }
 
-void MemoryOptimizer::VisitOtherEffect(Node* node,
-                                       AllocationState const* state) {
-  EnqueueUses(node, state);
+void MemoryOptimizer::VisitOtherEffect(Node* node, AllocationState const* state,
+                                       NodeId effect_chain) {
+  EnqueueUses(node, state, effect_chain);
 }
 
 MemoryOptimizer::AllocationState const* MemoryOptimizer::MergeStates(
@@ -418,6 +460,7 @@ MemoryOptimizer::AllocationState const* MemoryOptimizer::MergeStates(
 void MemoryOptimizer::EnqueueMerge(Node* node, int index,
                                    AllocationState const* state) {
   DCHECK_EQ(IrOpcode::kEffectPhi, node->opcode());
+  NodeId effect_chain = node->id();
   int const input_count = node->InputCount() - 1;
   DCHECK_LT(0, input_count);
   Node* const control = node->InputAt(input_count);
@@ -426,11 +469,11 @@ void MemoryOptimizer::EnqueueMerge(Node* node, int index,
       if (CanLoopAllocate(node, zone())) {
         // If the loop can allocate,  we start with an empty state at the
         // beginning.
-        EnqueueUses(node, empty_state());
+        EnqueueUses(node, empty_state(), effect_chain);
       } else {
         // If the loop cannot allocate, we can just propagate the state from
         // before the loop.
-        EnqueueUses(node, state);
+        EnqueueUses(node, state, effect_chain);
       }
     } else {
       // Do not revisit backedges.
@@ -452,29 +495,31 @@ void MemoryOptimizer::EnqueueMerge(Node* node, int index,
       // input constraints, drop the pending merge and enqueue uses of the
       // EffectPhi {node}.
       state = MergeStates(it->second);
-      EnqueueUses(node, state);
+      EnqueueUses(node, state, effect_chain);
       pending_.erase(it);
     }
   }
 }
 
-void MemoryOptimizer::EnqueueUses(Node* node, AllocationState const* state) {
+void MemoryOptimizer::EnqueueUses(Node* node, AllocationState const* state,
+                                  NodeId effect_chain) {
   for (Edge const edge : node->use_edges()) {
     if (NodeProperties::IsEffectEdge(edge)) {
-      EnqueueUse(edge.from(), edge.index(), state);
+      EnqueueUse(edge.from(), edge.index(), state, effect_chain);
     }
   }
 }
 
 void MemoryOptimizer::EnqueueUse(Node* node, int index,
-                                 AllocationState const* state) {
+                                 AllocationState const* state,
+                                 NodeId effect_chain) {
   if (node->opcode() == IrOpcode::kEffectPhi) {
     // An EffectPhi represents a merge of different effect chains, which
     // needs special handling depending on whether the merge is part of a
     // loop or just a normal control join.
     EnqueueMerge(node, index, state);
   } else {
-    Token token = {node, state};
+    Token token = {node, state, effect_chain};
     tokens_.push(token);
   }
 }
diff --git a/deps/v8/src/compiler/memory-optimizer.h b/deps/v8/src/compiler/memory-optimizer.h
index 55c1f8fd7dd254..4cc00b8ab708ec 100644
--- a/deps/v8/src/compiler/memory-optimizer.h
+++ b/deps/v8/src/compiler/memory-optimizer.h
@@ -9,6 +9,25 @@
 #include "src/compiler/memory-lowering.h"
 #include "src/zone/zone-containers.h"
 
+#ifdef V8_ENABLE_WEBASSEMBLY
+#include "src/compiler/wasm-address-reassociation.h"
+#else
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+class V8_EXPORT_PRIVATE WasmAddressReassociation final {
+ public:
+  WasmAddressReassociation(JSGraph* jsgraph, Zone* zone) {}
+  void Optimize() {}
+  void VisitProtectedMemOp(Node* node, uint32_t effect_chain) {}
+};
+
+}  // namespace compiler
+}  // namespace internal
+}  // namespace v8
+#endif
+
 namespace v8 {
 namespace internal {
 
@@ -47,25 +66,30 @@ class MemoryOptimizer final {
   struct Token {
     Node* node;
     AllocationState const* state;
+    // The most recent EffectPhi in the chain, which is used as a heuristic by
+    // address reassociation.
+    NodeId effect_chain;
   };
 
-  void VisitNode(Node*, AllocationState const*);
-  void VisitAllocateRaw(Node*, AllocationState const*);
-  void VisitCall(Node*, AllocationState const*);
-  void VisitLoadFromObject(Node*, AllocationState const*);
-  void VisitLoadElement(Node*, AllocationState const*);
-  void VisitLoadField(Node*, AllocationState const*);
-  void VisitStoreToObject(Node*, AllocationState const*);
-  void VisitStoreElement(Node*, AllocationState const*);
-  void VisitStoreField(Node*, AllocationState const*);
-  void VisitStore(Node*, AllocationState const*);
-  void VisitOtherEffect(Node*, AllocationState const*);
+  void VisitNode(Node*, AllocationState const*, NodeId);
+  void VisitAllocateRaw(Node*, AllocationState const*, NodeId);
+  void VisitCall(Node*, AllocationState const*, NodeId);
+  void VisitLoadFromObject(Node*, AllocationState const*, NodeId);
+  void VisitLoadElement(Node*, AllocationState const*, NodeId);
+  void VisitLoadField(Node*, AllocationState const*, NodeId);
+  void VisitProtectedLoad(Node*, AllocationState const*, NodeId);
+  void VisitProtectedStore(Node*, AllocationState const*, NodeId);
+  void VisitStoreToObject(Node*, AllocationState const*, NodeId);
+  void VisitStoreElement(Node*, AllocationState const*, NodeId);
+  void VisitStoreField(Node*, AllocationState const*, NodeId);
+  void VisitStore(Node*, AllocationState const*, NodeId);
+  void VisitOtherEffect(Node*, AllocationState const*, NodeId);
 
   AllocationState const* MergeStates(AllocationStates const& states);
 
   void EnqueueMerge(Node*, int, AllocationState const*);
-  void EnqueueUses(Node*, AllocationState const*);
-  void EnqueueUse(Node*, int, AllocationState const*);
+  void EnqueueUses(Node*, AllocationState const*, NodeId);
+  void EnqueueUse(Node*, int, AllocationState const*, NodeId);
 
   void ReplaceUsesAndKillNode(Node* node, Node* replacement);
 
@@ -76,12 +100,16 @@ class MemoryOptimizer final {
 
   AllocationState const* empty_state() const { return empty_state_; }
   MemoryLowering* memory_lowering() { return &memory_lowering_; }
+  WasmAddressReassociation* wasm_address_reassociation() {
+    return &wasm_address_reassociation_;
+  }
   Graph* graph() const;
   JSGraph* jsgraph() const { return jsgraph_; }
   Zone* zone() const { return zone_; }
 
   JSGraphAssembler graph_assembler_;
   MemoryLowering memory_lowering_;
+  WasmAddressReassociation wasm_address_reassociation_;
   JSGraph* jsgraph_;
   AllocationState const* const empty_state_;
   ZoneMap<NodeId, AllocationStates> pending_;
diff --git a/deps/v8/src/compiler/node-matchers.h b/deps/v8/src/compiler/node-matchers.h
index 53625012753b3a..6857a771c60134 100644
--- a/deps/v8/src/compiler/node-matchers.h
+++ b/deps/v8/src/compiler/node-matchers.h
@@ -53,17 +53,8 @@ struct NodeMatcher {
 };
 
 inline Node* SkipValueIdentities(Node* node) {
-#ifdef DEBUG
-  bool seen_fold_constant = false;
-#endif
-  do {
-#ifdef DEBUG
-    if (node->opcode() == IrOpcode::kFoldConstant) {
-      DCHECK(!seen_fold_constant);
-      seen_fold_constant = true;
-    }
-#endif
-  } while (NodeProperties::IsValueIdentity(node, &node));
+  while (NodeProperties::IsValueIdentity(node, &node)) {
+  }
   DCHECK_NOT_NULL(node);
   return node;
 }
@@ -73,9 +64,7 @@ inline Node* SkipValueIdentities(Node* node) {
 // Note that value identities on the input node are skipped when matching. The
 // resolved value may not be a parameter of the input node. The node() method
 // returns the unmodified input node. This is by design, as reducers may wish to
-// match value constants but delay reducing the node until a later phase. For
-// example, binary operator reducers may opt to keep FoldConstant operands while
-// applying a reduction that match on the constant value of the FoldConstant.
+// match value constants but delay reducing the node until a later phase.
 template <typename T, IrOpcode::Value kOpcode>
 struct ValueMatcher : public NodeMatcher {
   using ValueType = T;
@@ -710,23 +699,16 @@ struct BaseWithIndexAndDisplacementMatcher {
         }
       }
     }
-    int64_t value = 0;
     if (displacement != nullptr) {
-      switch (displacement->opcode()) {
-        case IrOpcode::kInt32Constant: {
-          value = OpParameter<int32_t>(displacement->op());
-          break;
+      if (displacement->opcode() == IrOpcode::kInt32Constant) {
+        if (OpParameter<int32_t>(displacement->op()) == 0) {
+          displacement = nullptr;
         }
-        case IrOpcode::kInt64Constant: {
-          value = OpParameter<int64_t>(displacement->op());
-          break;
+      } else {
+        DCHECK_EQ(displacement->opcode(), IrOpcode::kInt64Constant);
+        if (OpParameter<int64_t>(displacement->op()) == 0) {
+          displacement = nullptr;
         }
-        default:
-          UNREACHABLE();
-          break;
-      }
-      if (value == 0) {
-        displacement = nullptr;
       }
     }
     if (power_of_two_plus_one) {
diff --git a/deps/v8/src/compiler/node-properties.cc b/deps/v8/src/compiler/node-properties.cc
index 6c72633e6d39a4..0814955872255d 100644
--- a/deps/v8/src/compiler/node-properties.cc
+++ b/deps/v8/src/compiler/node-properties.cc
@@ -204,6 +204,10 @@ void NodeProperties::ChangeOp(Node* node, const Operator* new_op) {
   Verifier::VerifyNode(node);
 }
 
+// static
+void NodeProperties::ChangeOpUnchecked(Node* node, const Operator* new_op) {
+  node->set_op(new_op);
+}
 
 // static
 Node* NodeProperties::FindFrameStateBefore(Node* node,
@@ -391,32 +395,10 @@ OptionalMapRef NodeProperties::GetJSCreateMap(JSHeapBroker* broker,
   return base::nullopt;
 }
 
-namespace {
-
-// TODO(jgruber): Remove the intermediate ZoneHandleSet and then this function.
-ZoneRefUnorderedSet<MapRef> ToRefSet(JSHeapBroker* broker,
-                                     const ZoneHandleSet<Map>& handles) {
-  ZoneRefUnorderedSet<MapRef> refs =
-      ZoneRefUnorderedSet<MapRef>(broker->zone());
-  for (Handle<Map> handle : handles) {
-    refs.insert(MakeRefAssumeMemoryFence(broker, *handle));
-  }
-  return refs;
-}
-
-ZoneRefUnorderedSet<MapRef> RefSetOf(JSHeapBroker* broker, const MapRef& ref) {
-  ZoneRefUnorderedSet<MapRef> refs =
-      ZoneRefUnorderedSet<MapRef>(broker->zone());
-  refs.insert(ref);
-  return refs;
-}
-
-}  // namespace
-
 // static
 NodeProperties::InferMapsResult NodeProperties::InferMapsUnsafe(
     JSHeapBroker* broker, Node* receiver, Effect effect,
-    ZoneRefUnorderedSet<MapRef>* maps_out) {
+    ZoneRefSet<Map>* maps_out) {
   HeapObjectMatcher m(receiver);
   if (m.HasResolvedValue()) {
     HeapObjectRef ref = m.Ref(broker);
@@ -432,7 +414,7 @@ NodeProperties::InferMapsResult NodeProperties::InferMapsUnsafe(
       if (ref.map(broker).is_stable()) {
         // The {receiver_map} is only reliable when we install a stability
         // code dependency.
-        *maps_out = RefSetOf(broker, ref.map(broker));
+        *maps_out = ZoneRefSet<Map>{ref.map(broker)};
         return kUnreliableMaps;
       }
     }
@@ -443,7 +425,7 @@ NodeProperties::InferMapsResult NodeProperties::InferMapsUnsafe(
       case IrOpcode::kMapGuard: {
         Node* const object = GetValueInput(effect, 0);
         if (IsSame(receiver, object)) {
-          *maps_out = ToRefSet(broker, MapGuardMapsOf(effect->op()));
+          *maps_out = MapGuardMapsOf(effect->op());
           return result;
         }
         break;
@@ -451,8 +433,7 @@ NodeProperties::InferMapsResult NodeProperties::InferMapsUnsafe(
       case IrOpcode::kCheckMaps: {
         Node* const object = GetValueInput(effect, 0);
         if (IsSame(receiver, object)) {
-          *maps_out =
-              ToRefSet(broker, CheckMapsParametersOf(effect->op()).maps());
+          *maps_out = CheckMapsParametersOf(effect->op()).maps();
           return result;
         }
         break;
@@ -461,7 +442,7 @@ NodeProperties::InferMapsResult NodeProperties::InferMapsUnsafe(
         if (IsSame(receiver, effect)) {
           OptionalMapRef initial_map = GetJSCreateMap(broker, receiver);
           if (initial_map.has_value()) {
-            *maps_out = RefSetOf(broker, initial_map.value());
+            *maps_out = ZoneRefSet<Map>{initial_map.value()};
             return result;
           }
           // We reached the allocation of the {receiver}.
@@ -472,9 +453,9 @@ NodeProperties::InferMapsResult NodeProperties::InferMapsUnsafe(
       }
       case IrOpcode::kJSCreatePromise: {
         if (IsSame(receiver, effect)) {
-          *maps_out = RefSetOf(broker, broker->target_native_context()
-                                           .promise_function(broker)
-                                           .initial_map(broker));
+          *maps_out = ZoneRefSet<Map>{broker->target_native_context()
+                                          .promise_function(broker)
+                                          .initial_map(broker)};
           return result;
         }
         break;
@@ -489,7 +470,7 @@ NodeProperties::InferMapsResult NodeProperties::InferMapsUnsafe(
             Node* const value = GetValueInput(effect, 1);
             HeapObjectMatcher m2(value);
             if (m2.HasResolvedValue()) {
-              *maps_out = RefSetOf(broker, m2.Ref(broker).AsMap());
+              *maps_out = ZoneRefSet<Map>{m2.Ref(broker).AsMap()};
               return result;
             }
           }
diff --git a/deps/v8/src/compiler/node-properties.h b/deps/v8/src/compiler/node-properties.h
index 40a81d427823e7..ac45f8ee9764e6 100644
--- a/deps/v8/src/compiler/node-properties.h
+++ b/deps/v8/src/compiler/node-properties.h
@@ -137,9 +137,6 @@ class V8_EXPORT_PRIVATE NodeProperties {
       case IrOpcode::kTypeGuard:
         *out_value = GetValueInput(node, 0);
         return true;
-      case IrOpcode::kFoldConstant:
-        *out_value = GetValueInput(node, 1);
-        return true;
       default:
         return false;
     }
@@ -178,6 +175,8 @@ class V8_EXPORT_PRIVATE NodeProperties {
   // Safe wrapper to mutate the operator of a node. Checks that the node is
   // currently in a state that satisfies constraints of the new operator.
   static void ChangeOp(Node* node, const Operator* new_op);
+  // Like `ChangeOp`, but without checking constraints.
+  static void ChangeOpUnchecked(Node* node, const Operator* new_op);
 
   // ---------------------------------------------------------------------------
   // Miscellaneous utilities.
@@ -223,7 +222,7 @@ class V8_EXPORT_PRIVATE NodeProperties {
   // DO NOT USE InferMapsUnsafe IN NEW CODE. Use MapInference instead.
   static InferMapsResult InferMapsUnsafe(JSHeapBroker* broker, Node* receiver,
                                          Effect effect,
-                                         ZoneRefUnorderedSet<MapRef>* maps_out);
+                                         ZoneRefSet<Map>* maps_out);
 
   // Return the initial map of the new-target if the allocation can be inlined.
   static OptionalMapRef GetJSCreateMap(JSHeapBroker* broker, Node* receiver);
diff --git a/deps/v8/src/compiler/node.h b/deps/v8/src/compiler/node.h
index b7776e78e77065..4b225c1a25b084 100644
--- a/deps/v8/src/compiler/node.h
+++ b/deps/v8/src/compiler/node.h
@@ -106,6 +106,7 @@ class V8_EXPORT_PRIVATE Node final {
 
   class Inputs;
   inline Inputs inputs() const;
+  inline base::Vector<Node*> inputs_vector() const;
 
   class UseEdges final {
    public:
@@ -484,6 +485,16 @@ Node::Inputs Node::inputs() const {
   }
 }
 
+base::Vector<Node*> Node::inputs_vector() const {
+  int inline_count = InlineCountField::decode(bit_field_);
+  if (inline_count != kOutlineMarker) {
+    return base::VectorOf<Node*>(inline_inputs(), inline_count);
+  } else {
+    return base::VectorOf<Node*>(outline_inputs()->inputs(),
+                                 outline_inputs()->count_);
+  }
+}
+
 // A forward iterator to visit the edges for the input dependencies of a node.
 class Node::InputEdges::iterator final {
  public:
diff --git a/deps/v8/src/compiler/opcodes.h b/deps/v8/src/compiler/opcodes.h
index 3f48f1bf073847..217638ef34534b 100644
--- a/deps/v8/src/compiler/opcodes.h
+++ b/deps/v8/src/compiler/opcodes.h
@@ -79,7 +79,6 @@
   V(Projection)             \
   V(Retain)                 \
   V(MapGuard)               \
-  V(FoldConstant)           \
   V(TypeGuard)              \
   V(EnterMachineGraph)      \
   V(ExitMachineGraph)
@@ -557,7 +556,9 @@
   V(Null)                          \
   V(RttCanon)                      \
   V(WasmTypeCast)                  \
+  V(WasmTypeCastAbstract)          \
   V(WasmTypeCheck)                 \
+  V(WasmTypeCheckAbstract)         \
   V(WasmExternInternalize)         \
   V(WasmExternExternalize)         \
   V(WasmStructGet)                 \
@@ -758,6 +759,7 @@
   V(Load)                                \
   V(LoadImmutable)                       \
   V(Store)                               \
+  V(StorePair)                           \
   V(StackSlot)                           \
   V(Word32Popcnt)                        \
   V(Word64Popcnt)                        \
@@ -1081,18 +1083,145 @@
 
 // SIMD256 for AVX
 #define MACHINE_SIMD256_OP_LIST(V) \
+  V(F64x4Min)                      \
+  V(F64x4Max)                      \
+  V(F64x4Add)                      \
+  V(F64x4Sqrt)                     \
   V(F32x8Add)                      \
+  V(I64x4Add)                      \
+  V(I32x8Add)                      \
+  V(I16x16Add)                     \
+  V(I8x32Add)                      \
+  V(F64x4Sub)                      \
   V(F32x8Sub)                      \
+  V(I64x4Sub)                      \
+  V(I32x8Sub)                      \
+  V(I16x16Sub)                     \
+  V(I8x32Sub)                      \
+  V(F64x4Mul)                      \
   V(F32x8Mul)                      \
+  V(I64x4Mul)                      \
+  V(I32x8Mul)                      \
+  V(I16x16Mul)                     \
+  V(F64x4Div)                      \
   V(F32x8Div)                      \
+  V(I16x16AddSatS)                 \
+  V(I8x32AddSatS)                  \
+  V(I16x16AddSatU)                 \
+  V(I8x32AddSatU)                  \
+  V(I16x16SubSatS)                 \
+  V(I8x32SubSatS)                  \
+  V(I16x16SubSatU)                 \
+  V(I8x32SubSatU)                  \
   V(F32x8Pmin)                     \
   V(F32x8Pmax)                     \
   V(F32x8Eq)                       \
+  V(F64x4Eq)                       \
+  V(I64x4Eq)                       \
+  V(I32x8Eq)                       \
+  V(I16x16Eq)                      \
+  V(I8x32Eq)                       \
   V(F32x8Ne)                       \
+  V(F64x4Ne)                       \
+  V(I64x4GtS)                      \
+  V(I32x8GtS)                      \
+  V(I16x16GtS)                     \
+  V(I8x32GtS)                      \
+  V(F64x4Lt)                       \
   V(F32x8Lt)                       \
+  V(F64x4Le)                       \
   V(F32x8Le)                       \
+  V(I32x8MinS)                     \
+  V(I16x16MinS)                    \
+  V(I8x32MinS)                     \
+  V(I32x8MinU)                     \
+  V(I16x16MinU)                    \
+  V(I8x32MinU)                     \
+  V(I32x8MaxS)                     \
+  V(I16x16MaxS)                    \
+  V(I8x32MaxS)                     \
+  V(I32x8MaxU)                     \
+  V(I16x16MaxU)                    \
+  V(I8x32MaxU)                     \
+  V(F32x8Min)                      \
+  V(F32x8Max)                      \
+  V(I64x4Ne)                       \
+  V(I64x4GeS)                      \
+  V(I32x8Ne)                       \
+  V(I32x8GtU)                      \
+  V(I32x8GeS)                      \
+  V(I32x8GeU)                      \
+  V(I16x16Ne)                      \
+  V(I16x16GtU)                     \
+  V(I16x16GeS)                     \
+  V(I16x16GeU)                     \
+  V(I8x32Ne)                       \
+  V(I8x32GtU)                      \
+  V(I8x32GeS)                      \
+  V(I8x32GeU)                      \
+  V(I32x8UConvertF32x8)            \
+  V(F64x4ConvertI32x4S)            \
+  V(F32x8SConvertI32x8)            \
+  V(F32x8UConvertI32x8)            \
+  V(F32x4DemoteF64x4)              \
+  V(I64x4SConvertI32x4)            \
+  V(I64x4UConvertI32x4)            \
+  V(I32x8SConvertI16x8)            \
+  V(I32x8UConvertI16x8)            \
+  V(I16x16SConvertI8x16)           \
+  V(I16x16UConvertI8x16)           \
+  V(I16x16SConvertI32x8)           \
+  V(I16x16UConvertI32x8)           \
+  V(I8x32SConvertI16x16)           \
+  V(I8x32UConvertI16x16)           \
+  V(F32x8Abs)                      \
+  V(F32x8Neg)                      \
+  V(F32x8Sqrt)                     \
+  V(I32x8Abs)                      \
+  V(I32x8Neg)                      \
+  V(I16x16Abs)                     \
+  V(I16x16Neg)                     \
+  V(I8x32Abs)                      \
+  V(I8x32Neg)                      \
+  V(I64x4Shl)                      \
+  V(I64x4ShrU)                     \
+  V(I32x8Shl)                      \
+  V(I32x8ShrS)                     \
+  V(I32x8ShrU)                     \
+  V(I16x16Shl)                     \
+  V(I16x16ShrS)                    \
+  V(I16x16ShrU)                    \
+  V(I32x8DotI16x16S)               \
+  V(I16x16RoundingAverageU)        \
+  V(I8x32RoundingAverageU)         \
+  V(I64x4ExtMulI32x4S)             \
+  V(I64x4ExtMulI32x4U)             \
+  V(I32x8ExtMulI16x8S)             \
+  V(I32x8ExtMulI16x8U)             \
+  V(I16x16ExtMulI8x16S)            \
+  V(I16x16ExtMulI8x16U)            \
+  V(I32x8ExtAddPairwiseI16x16S)    \
+  V(I32x8ExtAddPairwiseI16x16U)    \
+  V(I16x16ExtAddPairwiseI8x32S)    \
+  V(I16x16ExtAddPairwiseI8x32U)    \
+  V(ExtractF128)                   \
+  V(S256Const)                     \
+  V(S256Zero)                      \
+  V(S256Not)                       \
+  V(S256And)                       \
+  V(S256Or)                        \
+  V(S256Xor)                       \
   V(S256Select)                    \
-  V(ExtractF128)
+  V(S256AndNot)                    \
+  V(I64x4Splat)                    \
+  V(I32x8Splat)                    \
+  V(I16x16Splat)                   \
+  V(I8x32Splat)                    \
+  V(F64x4Pmin)                     \
+  V(F64x4Pmax)                     \
+  V(F64x4Splat)                    \
+  V(F32x8Splat)                    \
+  V(I8x32Shuffle)
 
 #define VALUE_OP_LIST(V)     \
   COMMON_OP_LIST(V)          \
diff --git a/deps/v8/src/compiler/operation-typer.cc b/deps/v8/src/compiler/operation-typer.cc
index bd57b79ed4906d..abf1388e175251 100644
--- a/deps/v8/src/compiler/operation-typer.cc
+++ b/deps/v8/src/compiler/operation-typer.cc
@@ -27,14 +27,15 @@ OperationTyper::OperationTyper(JSHeapBroker* broker, Zone* zone)
   singleton_zero_string_ = Type::Constant(broker, broker->zero_string(), zone);
   singleton_false_ = Type::Constant(broker, broker->false_value(), zone);
   singleton_true_ = Type::Constant(broker, broker->true_value(), zone);
-  singleton_the_hole_ = Type::Hole();
   signed32ish_ = Type::Union(Type::Signed32(), truncating_to_zero, zone);
   unsigned32ish_ = Type::Union(Type::Unsigned32(), truncating_to_zero, zone);
 
+  // TODO(chromium:1445008): when splitting the hole into different holes,
+  // figure which ones of them are falsish.
   falsish_ = Type::Union(
       Type::Undetectable(),
       Type::Union(Type::Union(singleton_false_, cache_->kZeroish, zone),
-                  Type::Union(singleton_empty_string_, Type::Hole(), zone),
+                  Type::Union(singleton_empty_string_, Type::TheHole(), zone),
                   zone),
       zone);
   truish_ = Type::Union(
@@ -1322,7 +1323,7 @@ Type OperationTyper::CheckBounds(Type index, Type length) {
 }
 
 Type OperationTyper::CheckFloat64Hole(Type type) {
-  if (type.Maybe(Type::Hole())) {
+  if (type.Maybe(Type::TheHole())) {
     // Turn "the hole" into undefined.
     type = Type::Intersect(type, Type::Number(), zone());
     type = Type::Union(type, Type::Undefined(), zone());
@@ -1339,7 +1340,7 @@ Type OperationTyper::TypeTypeGuard(const Operator* sigma_op, Type input) {
 }
 
 Type OperationTyper::ConvertTaggedHoleToUndefined(Type input) {
-  if (input.Maybe(Type::Hole())) {
+  if (input.Maybe(Type::TheHole())) {
     // Turn "the hole" into undefined.
     Type type = Type::Intersect(input, Type::NonInternal(), zone());
     return Type::Union(type, Type::Undefined(), zone());
diff --git a/deps/v8/src/compiler/operation-typer.h b/deps/v8/src/compiler/operation-typer.h
index f657a451874240..f25d480397648d 100644
--- a/deps/v8/src/compiler/operation-typer.h
+++ b/deps/v8/src/compiler/operation-typer.h
@@ -20,6 +20,7 @@
   V(Uint64Div)                                \
   V(Uint32LessThan)                           \
   V(Uint32LessThanOrEqual)                    \
+  V(Uint64LessThan)                           \
   V(Uint64LessThanOrEqual)                    \
   V(Word32And)                                \
   V(Word32Equal)                              \
@@ -103,7 +104,6 @@ class V8_EXPORT_PRIVATE OperationTyper {
 
   Type singleton_false() const { return singleton_false_; }
   Type singleton_true() const { return singleton_true_; }
-  Type singleton_the_hole() const { return singleton_the_hole_; }
 
  private:
   using ComparisonOutcome = base::Flags<ComparisonOutcomeFlags>;
@@ -131,7 +131,6 @@ class V8_EXPORT_PRIVATE OperationTyper {
   Type singleton_zero_string_;
   Type singleton_false_;
   Type singleton_true_;
-  Type singleton_the_hole_;
   Type signed32ish_;
   Type unsigned32ish_;
   Type singleton_empty_string_;
diff --git a/deps/v8/src/compiler/pair-load-store-reducer.cc b/deps/v8/src/compiler/pair-load-store-reducer.cc
new file mode 100644
index 00000000000000..c2fe49d1c92c68
--- /dev/null
+++ b/deps/v8/src/compiler/pair-load-store-reducer.cc
@@ -0,0 +1,92 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/pair-load-store-reducer.h"
+
+#include "src/compiler/machine-graph.h"
+
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+namespace {
+
+base::Optional<std::tuple<int, const Operator*>> CanBePaired(
+    Node* node1, Node* node2, MachineOperatorBuilder* machine,
+    Isolate* isolate) {
+  DCHECK(node1->opcode() == IrOpcode::kStore &&
+         node1->opcode() == IrOpcode::kStore);
+
+  Node* base1 = node1->InputAt(0);
+  Node* base2 = node2->InputAt(0);
+  if (base1 != base2) return {};
+
+  auto rep1 = StoreRepresentationOf(node1->op());
+  auto rep2 = StoreRepresentationOf(node2->op());
+  auto combo = machine->TryStorePair(rep1, rep2);
+  if (!combo) return {};
+
+  Node* index1 = node1->InputAt(1);
+  Node* index2 = node2->InputAt(1);
+
+  int idx1, idx2;
+  if (index1->opcode() == IrOpcode::kInt64Constant) {
+    idx1 = static_cast<int>(OpParameter<int64_t>(index1->op()));
+  } else {
+    return {};
+  }
+  if (index2->opcode() == IrOpcode::kInt64Constant) {
+    idx2 = static_cast<int>(OpParameter<int64_t>(index2->op()));
+  } else {
+    return {};
+  }
+
+  int bytesize = 1 << ElementSizeLog2Of(rep1.representation());
+  int diff = idx2 - idx1;
+  if (diff != bytesize && diff != -bytesize) {
+    return {};
+  }
+
+  return {{diff, *combo}};
+}
+
+}  // namespace
+
+PairLoadStoreReducer::PairLoadStoreReducer(Editor* editor,
+                                           MachineGraph* mcgraph,
+                                           Isolate* isolate)
+    : AdvancedReducer(editor), mcgraph_(mcgraph), isolate_(isolate) {}
+
+Reduction PairLoadStoreReducer::Reduce(Node* cur) {
+  if (cur->opcode() != IrOpcode::kStore) {
+    return Reduction();
+  }
+
+  Node* prev = NodeProperties::GetEffectInput(cur);
+  if (prev->opcode() != IrOpcode::kStore) {
+    return Reduction();
+  }
+
+  if (!prev->OwnedBy(cur)) {
+    return Reduction();
+  }
+
+  auto pairing = CanBePaired(prev, cur, mcgraph_->machine(), isolate_);
+  if (!pairing) return Reduction();
+
+  if (std::get<int>(*pairing) > 0) {
+    prev->InsertInput(mcgraph_->zone(), 3, cur->InputAt(2));
+  } else {
+    NodeProperties::ReplaceValueInput(prev, cur->InputAt(1), 1);
+    prev->InsertInput(mcgraph_->zone(), 2, cur->InputAt(2));
+  }
+  NodeProperties::ChangeOp(prev, std::get<const Operator*>(*pairing));
+  Replace(cur, prev);
+  cur->Kill();
+  return Reduction(prev);
+}
+
+}  // namespace compiler
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/compiler/pair-load-store-reducer.h b/deps/v8/src/compiler/pair-load-store-reducer.h
new file mode 100644
index 00000000000000..5b9c5e9270ff16
--- /dev/null
+++ b/deps/v8/src/compiler/pair-load-store-reducer.h
@@ -0,0 +1,46 @@
+#ifndef V8_COMPILER_PAIR_LOAD_STORE_REDUCER_H_
+#define V8_COMPILER_PAIR_LOAD_STORE_REDUCER_H_
+
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/base/compiler-specific.h"
+#include "src/common/globals.h"
+#include "src/compiler/graph-reducer.h"
+#include "src/compiler/machine-operator.h"
+
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+// Forward declarations.
+class CommonOperatorBuilder;
+class MachineGraph;
+class Word32Adapter;
+class Word64Adapter;
+
+// Reduces (currently only) store pairs which can be combined on supported
+// platforms (currently arm64). Stores are trivially pairable if they are next
+// to each other, write to consecutive indices and do not have a write barrier.
+// TODO(olivf, v8:13877) Add support for loads, more word sizes, and arm.
+class V8_EXPORT_PRIVATE PairLoadStoreReducer final
+    : public NON_EXPORTED_BASE(AdvancedReducer) {
+ public:
+  PairLoadStoreReducer(Editor* editor, MachineGraph* mcgraph,
+                       Isolate* isolate_);
+
+  const char* reducer_name() const override { return "PairLoadStoreReducer"; }
+
+  Reduction Reduce(Node* node) override;
+
+ private:
+  MachineGraph* mcgraph_;
+  Isolate* isolate_;
+};
+
+}  // namespace compiler
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_COMPILER_PAIR_LOAD_STORE_REDUCER_H_
diff --git a/deps/v8/src/compiler/persistent-map.h b/deps/v8/src/compiler/persistent-map.h
index eeb3f316e91ca0..05f920400a2692 100644
--- a/deps/v8/src/compiler/persistent-map.h
+++ b/deps/v8/src/compiler/persistent-map.h
@@ -209,12 +209,13 @@ struct PersistentMap<Key, Value, Hasher>::FocusedTree {
   const FocusedTree*& path(int i) {
     DCHECK(i < length);
     return reinterpret_cast<const FocusedTree**>(
-        reinterpret_cast<byte*>(this) + offsetof(FocusedTree, path_array))[i];
+        reinterpret_cast<uint8_t*>(this) +
+        offsetof(FocusedTree, path_array))[i];
   }
   const FocusedTree* path(int i) const {
     DCHECK(i < length);
     return reinterpret_cast<const FocusedTree* const*>(
-        reinterpret_cast<const byte*>(this) +
+        reinterpret_cast<const uint8_t*>(this) +
         offsetof(FocusedTree, path_array))[i];
   }
 };
diff --git a/deps/v8/src/compiler/pipeline-statistics.cc b/deps/v8/src/compiler/pipeline-statistics.cc
index a7ddb8381bad4d..31633217c5a18c 100644
--- a/deps/v8/src/compiler/pipeline-statistics.cc
+++ b/deps/v8/src/compiler/pipeline-statistics.cc
@@ -7,6 +7,7 @@
 #include <memory>
 
 #include "src/codegen/optimized-compilation-info.h"
+#include "src/compiler/turboshaft/phase.h"
 #include "src/compiler/zone-stats.h"
 #include "src/objects/shared-function-info.h"
 
@@ -14,23 +15,25 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-constexpr char PipelineStatistics::kTraceCategory[];
-
-void PipelineStatistics::CommonStats::Begin(
-    PipelineStatistics* pipeline_stats) {
+void PipelineStatisticsBase::CommonStats::Begin(
+    PipelineStatisticsBase* pipeline_stats) {
   DCHECK(!scope_);
   scope_.reset(new ZoneStats::StatsScope(pipeline_stats->zone_stats_));
-  timer_.Start();
   outer_zone_initial_size_ = pipeline_stats->OuterZoneSize();
   allocated_bytes_at_start_ =
       outer_zone_initial_size_ -
       pipeline_stats->total_stats_.outer_zone_initial_size_ +
       pipeline_stats->zone_stats_->GetCurrentAllocatedBytes();
+  // TODO(pthier): Move turboshaft specifics out of common class.
+  if (turboshaft::PipelineData::HasScope()) {
+    graph_size_at_start_ =
+        turboshaft::PipelineData::Get().graph().number_of_operations();
+  }
+  timer_.Start();
 }
 
-
-void PipelineStatistics::CommonStats::End(
-    PipelineStatistics* pipeline_stats,
+void PipelineStatisticsBase::CommonStats::End(
+    PipelineStatisticsBase* pipeline_stats,
     CompilationStatistics::BasicStats* diff) {
   DCHECK(scope_);
   diff->function_name_ = pipeline_stats->function_name_;
@@ -42,68 +45,99 @@ void PipelineStatistics::CommonStats::End(
       diff->max_allocated_bytes_ + allocated_bytes_at_start_;
   diff->total_allocated_bytes_ =
       outer_zone_diff + scope_->GetTotalAllocatedBytes();
+  diff->input_graph_size_ = graph_size_at_start_;
+  if (turboshaft::PipelineData::HasScope()) {
+    diff->output_graph_size_ =
+        turboshaft::PipelineData::Get().graph().number_of_operations();
+  }
   scope_.reset();
   timer_.Stop();
 }
 
-PipelineStatistics::PipelineStatistics(
-    OptimizedCompilationInfo* info,
+PipelineStatisticsBase::PipelineStatisticsBase(
+    Zone* outer_zone, ZoneStats* zone_stats,
     std::shared_ptr<CompilationStatistics> compilation_stats,
-    ZoneStats* zone_stats)
-    : outer_zone_(info->zone()),
+    CodeKind code_kind)
+    : outer_zone_(outer_zone),
       zone_stats_(zone_stats),
       compilation_stats_(compilation_stats),
-      code_kind_(info->code_kind()),
+      code_kind_(code_kind),
       phase_kind_name_(nullptr),
       phase_name_(nullptr) {
-  if (info->has_shared_info()) {
-    function_name_.assign(info->shared_info()->DebugNameCStr().get());
-  }
   total_stats_.Begin(this);
 }
 
-PipelineStatistics::~PipelineStatistics() {
-  if (InPhaseKind()) EndPhaseKind();
+PipelineStatisticsBase::~PipelineStatisticsBase() {
   CompilationStatistics::BasicStats diff;
+  if (InPhaseKind()) EndPhaseKind(&diff);
   total_stats_.End(this, &diff);
   compilation_stats_->RecordTotalStats(diff);
 }
 
-
-void PipelineStatistics::BeginPhaseKind(const char* phase_kind_name) {
+void PipelineStatisticsBase::BeginPhaseKind(const char* phase_kind_name) {
   DCHECK(!InPhase());
-  if (InPhaseKind()) EndPhaseKind();
-  TRACE_EVENT_BEGIN1(kTraceCategory, phase_kind_name, "kind",
-                     CodeKindToString(code_kind_));
+  CompilationStatistics::BasicStats diff;
+  if (InPhaseKind()) EndPhaseKind(&diff);
   phase_kind_name_ = phase_kind_name;
   phase_kind_stats_.Begin(this);
 }
 
-void PipelineStatistics::EndPhaseKind() {
+void PipelineStatisticsBase::EndPhaseKind(
+    CompilationStatistics::BasicStats* diff) {
   DCHECK(!InPhase());
-  CompilationStatistics::BasicStats diff;
-  phase_kind_stats_.End(this, &diff);
-  compilation_stats_->RecordPhaseKindStats(phase_kind_name_, diff);
-  TRACE_EVENT_END2(kTraceCategory, phase_kind_name_, "kind",
-                   CodeKindToString(code_kind_), "stats",
-                   TRACE_STR_COPY(diff.AsJSON().c_str()));
+  phase_kind_stats_.End(this, diff);
+  compilation_stats_->RecordPhaseKindStats(phase_kind_name_, *diff);
 }
 
-void PipelineStatistics::BeginPhase(const char* phase_name) {
-  TRACE_EVENT_BEGIN1(kTraceCategory, phase_name, "kind",
-                     CodeKindToString(code_kind_));
+void PipelineStatisticsBase::BeginPhase(const char* phase_name) {
   DCHECK(InPhaseKind());
   phase_name_ = phase_name;
   phase_stats_.Begin(this);
 }
 
-void PipelineStatistics::EndPhase() {
+void PipelineStatisticsBase::EndPhase(CompilationStatistics::BasicStats* diff) {
   DCHECK(InPhaseKind());
+  phase_stats_.End(this, diff);
+  compilation_stats_->RecordPhaseStats(phase_kind_name_, phase_name_, *diff);
+}
+
+constexpr char TurbofanPipelineStatistics::kTraceCategory[];
+
+TurbofanPipelineStatistics::TurbofanPipelineStatistics(
+    OptimizedCompilationInfo* info,
+    std::shared_ptr<CompilationStatistics> compilation_stats,
+    ZoneStats* zone_stats)
+    : Base(info->zone(), zone_stats, compilation_stats, info->code_kind()) {
+  if (info->has_shared_info()) {
+    set_function_name(info->shared_info()->DebugNameCStr().get());
+  }
+}
+
+void TurbofanPipelineStatistics::BeginPhaseKind(const char* name) {
+  Base::BeginPhaseKind(name);
+  TRACE_EVENT_BEGIN1(kTraceCategory, name, "kind",
+                     CodeKindToString(code_kind()));
+}
+
+void TurbofanPipelineStatistics::EndPhaseKind() {
+  CompilationStatistics::BasicStats diff;
+  Base::EndPhaseKind(&diff);
+  TRACE_EVENT_END2(kTraceCategory, phase_kind_name(), "kind",
+                   CodeKindToString(code_kind()), "stats",
+                   TRACE_STR_COPY(diff.AsJSON().c_str()));
+}
+
+void TurbofanPipelineStatistics::BeginPhase(const char* name) {
+  Base::BeginPhase(name);
+  TRACE_EVENT_BEGIN1(kTraceCategory, phase_name(), "kind",
+                     CodeKindToString(code_kind()));
+}
+
+void TurbofanPipelineStatistics::EndPhase() {
   CompilationStatistics::BasicStats diff;
-  phase_stats_.End(this, &diff);
-  compilation_stats_->RecordPhaseStats(phase_kind_name_, phase_name_, diff);
-  TRACE_EVENT_END2(kTraceCategory, phase_name_, "kind",
-                   CodeKindToString(code_kind_), "stats",
+  Base::EndPhase(&diff);
+  TRACE_EVENT_END2(kTraceCategory, phase_name(), "kind",
+                   CodeKindToString(code_kind()), "stats",
                    TRACE_STR_COPY(diff.AsJSON().c_str()));
 }
 
diff --git a/deps/v8/src/compiler/pipeline-statistics.h b/deps/v8/src/compiler/pipeline-statistics.h
index 4c76d134a7dbe8..bae7e48845dba4 100644
--- a/deps/v8/src/compiler/pipeline-statistics.h
+++ b/deps/v8/src/compiler/pipeline-statistics.h
@@ -8,6 +8,7 @@
 #include <memory>
 #include <string>
 
+#include "src/base/export-template.h"
 #include "src/base/platform/elapsed-timer.h"
 #include "src/compiler/zone-stats.h"
 #include "src/diagnostics/compilation-statistics.h"
@@ -20,25 +21,19 @@ namespace compiler {
 
 class PhaseScope;
 
-class PipelineStatistics : public Malloced {
- public:
-  PipelineStatistics(OptimizedCompilationInfo* info,
-                     std::shared_ptr<CompilationStatistics> turbo_stats,
-                     ZoneStats* zone_stats);
-  ~PipelineStatistics();
-  PipelineStatistics(const PipelineStatistics&) = delete;
-  PipelineStatistics& operator=(const PipelineStatistics&) = delete;
+class PipelineStatisticsBase {
+ protected:
+  using Base = PipelineStatisticsBase;
 
-  void BeginPhaseKind(const char* phase_kind_name);
-  void EndPhaseKind();
+  PipelineStatisticsBase(
+      Zone* outer_zone, ZoneStats* zone_stats,
+      std::shared_ptr<CompilationStatistics> compilation_stats,
+      CodeKind code_kind);
+  ~PipelineStatisticsBase();
 
-  // We log detailed phase information about the pipeline
-  // in both the v8.turbofan and the v8.wasm.turbofan categories.
-  static constexpr char kTraceCategory[] =
-      TRACE_DISABLED_BY_DEFAULT("v8.turbofan") ","  // --
-      TRACE_DISABLED_BY_DEFAULT("v8.wasm.turbofan");
+  void BeginPhaseKind(const char* phase_kind_name);
+  void EndPhaseKind(CompilationStatistics::BasicStats* diff);
 
- private:
   size_t OuterZoneSize() {
     return static_cast<size_t>(outer_zone_->allocation_size());
   }
@@ -49,14 +44,15 @@ class PipelineStatistics : public Malloced {
     CommonStats(const CommonStats&) = delete;
     CommonStats& operator=(const CommonStats&) = delete;
 
-    void Begin(PipelineStatistics* pipeline_stats);
-    void End(PipelineStatistics* pipeline_stats,
+    void Begin(PipelineStatisticsBase* pipeline_stats);
+    void End(PipelineStatisticsBase* pipeline_stats,
              CompilationStatistics::BasicStats* diff);
 
     std::unique_ptr<ZoneStats::StatsScope> scope_;
     base::ElapsedTimer timer_;
     size_t outer_zone_initial_size_;
     size_t allocated_bytes_at_start_;
+    size_t graph_size_at_start_ = 0;
   };
 
   bool InPhaseKind() { return !!phase_kind_stats_.scope_; }
@@ -64,8 +60,17 @@ class PipelineStatistics : public Malloced {
   friend class PhaseScope;
   bool InPhase() { return !!phase_stats_.scope_; }
   void BeginPhase(const char* name);
-  void EndPhase();
+  void EndPhase(CompilationStatistics::BasicStats* diff);
+
+  CodeKind code_kind() const { return code_kind_; }
+  const char* phase_kind_name() const { return phase_kind_name_; }
+  const char* phase_name() const { return phase_name_; }
+
+  void set_function_name(std::string function_name) {
+    function_name_.assign(function_name);
+  }
 
+ private:
   Zone* outer_zone_;
   ZoneStats* zone_stats_;
   std::shared_ptr<CompilationStatistics> compilation_stats_;
@@ -84,9 +89,31 @@ class PipelineStatistics : public Malloced {
   CommonStats phase_stats_;
 };
 
+class TurbofanPipelineStatistics : public PipelineStatisticsBase,
+                                   public Malloced {
+ public:
+  TurbofanPipelineStatistics(OptimizedCompilationInfo* info,
+                             std::shared_ptr<CompilationStatistics> turbo_stats,
+                             ZoneStats* zone_stats);
+  TurbofanPipelineStatistics(const TurbofanPipelineStatistics&) = delete;
+  TurbofanPipelineStatistics& operator=(const TurbofanPipelineStatistics&) =
+      delete;
+
+  // We log detailed phase information about the pipeline
+  // in both the v8.turbofan and the v8.wasm.turbofan categories.
+  static constexpr char kTraceCategory[] =
+      TRACE_DISABLED_BY_DEFAULT("v8.turbofan") ","  // --
+      TRACE_DISABLED_BY_DEFAULT("v8.wasm.turbofan");
+
+  void BeginPhaseKind(const char* name);
+  void EndPhaseKind();
+  void BeginPhase(const char* name);
+  void EndPhase();
+};
+
 class V8_NODISCARD PhaseScope {
  public:
-  PhaseScope(PipelineStatistics* pipeline_stats, const char* name)
+  PhaseScope(TurbofanPipelineStatistics* pipeline_stats, const char* name)
       : pipeline_stats_(pipeline_stats) {
     if (pipeline_stats_ != nullptr) pipeline_stats_->BeginPhase(name);
   }
@@ -97,7 +124,7 @@ class V8_NODISCARD PhaseScope {
   PhaseScope& operator=(const PhaseScope&) = delete;
 
  private:
-  PipelineStatistics* const pipeline_stats_;
+  TurbofanPipelineStatistics* const pipeline_stats_;
 };
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/pipeline.cc b/deps/v8/src/compiler/pipeline.cc
index 58d4b9ae95e2f4..de7f731649f941 100644
--- a/deps/v8/src/compiler/pipeline.cc
+++ b/deps/v8/src/compiler/pipeline.cc
@@ -70,6 +70,7 @@
 #include "src/compiler/node-observer.h"
 #include "src/compiler/node-origin-table.h"
 #include "src/compiler/osr.h"
+#include "src/compiler/pair-load-store-reducer.h"
 #include "src/compiler/phase.h"
 #include "src/compiler/pipeline-statistics.h"
 #include "src/compiler/redundancy-elimination.h"
@@ -80,25 +81,20 @@
 #include "src/compiler/simplified-operator-reducer.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/compiler/store-store-elimination.h"
-#include "src/compiler/turboshaft/assembler.h"
 #include "src/compiler/turboshaft/build-graph-phase.h"
 #include "src/compiler/turboshaft/dead-code-elimination-phase.h"
+#include "src/compiler/turboshaft/debug-feature-lowering-phase.h"
 #include "src/compiler/turboshaft/decompression-optimization-phase.h"
-#include "src/compiler/turboshaft/graph-visualizer.h"
-#include "src/compiler/turboshaft/graph.h"
-#include "src/compiler/turboshaft/index.h"
-#include "src/compiler/turboshaft/late-optimization-phase.h"
+#include "src/compiler/turboshaft/instruction-selection-phase.h"
 #include "src/compiler/turboshaft/machine-lowering-phase.h"
-#include "src/compiler/turboshaft/optimization-phase.h"
 #include "src/compiler/turboshaft/optimize-phase.h"
 #include "src/compiler/turboshaft/phase.h"
 #include "src/compiler/turboshaft/recreate-schedule-phase.h"
 #include "src/compiler/turboshaft/simplify-tf-loops.h"
-#include "src/compiler/turboshaft/tag-untag-lowering-phase.h"
+#include "src/compiler/turboshaft/store-store-elimination-phase.h"
 #include "src/compiler/turboshaft/tracing.h"
 #include "src/compiler/turboshaft/type-assertions-phase.h"
 #include "src/compiler/turboshaft/typed-optimizations-phase.h"
-#include "src/compiler/turboshaft/types.h"
 #include "src/compiler/type-narrowing-reducer.h"
 #include "src/compiler/typed-optimization.h"
 #include "src/compiler/typer.h"
@@ -107,30 +103,35 @@
 #include "src/compiler/zone-stats.h"
 #include "src/diagnostics/code-tracer.h"
 #include "src/diagnostics/disassembler.h"
-#include "src/execution/isolate-inl.h"
 #include "src/flags/flags.h"
+#include "src/handles/handles-inl.h"
 #include "src/heap/local-heap.h"
 #include "src/logging/code-events.h"
 #include "src/logging/counters.h"
 #include "src/logging/runtime-call-stats-scope.h"
 #include "src/logging/runtime-call-stats.h"
 #include "src/objects/shared-function-info.h"
+#include "src/objects/string-inl.h"
 #include "src/tracing/trace-event.h"
 #include "src/utils/ostreams.h"
 #include "src/utils/utils.h"
 
 #if V8_ENABLE_WEBASSEMBLY
 #include "src/compiler/int64-lowering.h"
+#include "src/compiler/turboshaft/int64-lowering-phase.h"
+#include "src/compiler/turboshaft/wasm-optimize-phase.h"
 #include "src/compiler/wasm-compiler.h"
 #include "src/compiler/wasm-escape-analysis.h"
 #include "src/compiler/wasm-gc-lowering.h"
 #include "src/compiler/wasm-gc-operator-reducer.h"
 #include "src/compiler/wasm-inlining.h"
+#include "src/compiler/wasm-js-lowering.h"
 #include "src/compiler/wasm-load-elimination.h"
 #include "src/compiler/wasm-loop-peeling.h"
 #include "src/compiler/wasm-typer.h"
 #include "src/wasm/function-body-decoder.h"
 #include "src/wasm/function-compiler.h"
+#include "src/wasm/turboshaft-graph-interface.h"
 #include "src/wasm/wasm-engine.h"
 #endif  // V8_ENABLE_WEBASSEMBLY
 
@@ -156,15 +157,15 @@ static constexpr char kRegisterAllocatorVerifierZoneName[] =
 
 namespace {
 
-Maybe<OuterContext> GetModuleContext(Handle<JSFunction> closure) {
-  Context current = closure->context();
+Maybe<OuterContext> GetModuleContext(OptimizedCompilationInfo* info) {
+  Tagged<Context> current = info->closure()->context();
   size_t distance = 0;
-  while (!current.IsNativeContext()) {
-    if (current.IsModuleContext()) {
-      return Just(
-          OuterContext(handle(current, current.GetIsolate()), distance));
+  while (!IsNativeContext(*current)) {
+    if (current->IsModuleContext()) {
+      return Just(OuterContext(
+          info->CanonicalHandle(current, current->GetIsolate()), distance));
     }
-    current = current.previous();
+    current = current->previous();
     distance++;
   }
   return Nothing<OuterContext>();
@@ -177,7 +178,7 @@ class PipelineData {
   // For main entry point.
   PipelineData(ZoneStats* zone_stats, Isolate* isolate,
                OptimizedCompilationInfo* info,
-               PipelineStatistics* pipeline_statistics)
+               TurbofanPipelineStatistics* pipeline_statistics)
       : isolate_(isolate),
         allocator_(isolate->allocator()),
         info_(info),
@@ -197,7 +198,9 @@ class PipelineData {
         register_allocation_zone_scope_(zone_stats_,
                                         kRegisterAllocationZoneName),
         register_allocation_zone_(register_allocation_zone_scope_.zone()),
-        assembler_options_(AssemblerOptions::Default(isolate)) {
+        assembler_options_(AssemblerOptions::Default(isolate)),
+        inline_wasm_into_js_(
+            isolate_->IsWasmInliningIntoJSEnabled(isolate_->native_context())) {
     PhaseScope scope(pipeline_statistics, "V8.TFInitPipelineData");
     graph_ = graph_zone_->New<Graph>(graph_zone_);
     source_positions_ = graph_zone_->New<SourcePositionTable>(graph_);
@@ -225,18 +228,16 @@ class PipelineData {
   // For WebAssembly compile entry point.
   PipelineData(ZoneStats* zone_stats, wasm::WasmEngine* wasm_engine,
                OptimizedCompilationInfo* info, MachineGraph* mcgraph,
-               PipelineStatistics* pipeline_statistics,
+               TurbofanPipelineStatistics* pipeline_statistics,
                SourcePositionTable* source_positions,
                NodeOriginTable* node_origins,
-               const AssemblerOptions& assembler_options,
-               wasm::AssemblerBufferCache* buffer_cache)
+               const AssemblerOptions& assembler_options)
       : isolate_(nullptr),
         wasm_engine_(wasm_engine),
-        assembler_buffer_cache_(buffer_cache),
         allocator_(wasm_engine->allocator()),
         info_(info),
         debug_name_(info_->GetDebugName()),
-        may_have_unverifiable_graph_(false),
+        may_have_unverifiable_graph_(v8_flags.turboshaft_wasm),
         zone_stats_(zone_stats),
         pipeline_statistics_(pipeline_statistics),
         graph_zone_scope_(zone_stats_, kGraphZoneName, kCompressGraphZone),
@@ -353,7 +354,9 @@ class PipelineData {
   OptimizedCompilationInfo* info() const { return info_; }
   ZoneStats* zone_stats() const { return zone_stats_; }
   CompilationDependencies* dependencies() const { return dependencies_; }
-  PipelineStatistics* pipeline_statistics() { return pipeline_statistics_; }
+  TurbofanPipelineStatistics* pipeline_statistics() {
+    return pipeline_statistics_;
+  }
   OsrHelper* osr_helper() { return &(*osr_helper_); }
 
   bool verify_graph() const { return verify_graph_; }
@@ -373,14 +376,20 @@ class PipelineData {
   Zone* graph_zone() const { return graph_zone_; }
   Graph* graph() const { return graph_; }
   void set_graph(Graph* graph) { graph_ = graph; }
-  turboshaft::PipelineData* InitializeTurboshaftPipeline() {
-    DCHECK_EQ(turboshaft_data_, base::nullopt);
-    turboshaft_data_.emplace(info_, schedule_, graph_zone_, broker_, isolate_,
-                             source_positions_, node_origins_);
-    return &turboshaft_data_.value();
-  }
-  turboshaft::PipelineData* turboshaft_data() {
-    return turboshaft_data_.has_value() ? &turboshaft_data_.value() : nullptr;
+  turboshaft::PipelineData CreateTurboshaftPipeline() {
+    return turboshaft::PipelineData{info_,
+                                    schedule_,
+                                    graph_zone_,
+                                    broker_,
+                                    isolate_,
+                                    source_positions_,
+                                    node_origins_,
+                                    sequence_,
+                                    frame_,
+                                    assembler_options_,
+                                    &max_unoptimized_frame_height_,
+                                    &max_pushed_argument_count_,
+                                    instruction_zone_};
   }
   SourcePositionTable* source_positions() const { return source_positions_; }
   NodeOriginTable* node_origins() const { return node_origins_; }
@@ -450,10 +459,10 @@ class PipelineData {
   void ChooseSpecializationContext() {
     if (info()->function_context_specializing()) {
       DCHECK(info()->has_context());
-      specialization_context_ =
-          Just(OuterContext(handle(info()->context(), isolate()), 0));
+      specialization_context_ = Just(OuterContext(
+          info()->CanonicalHandle(info()->context(), isolate()), 0));
     } else {
-      specialization_context_ = GetModuleContext(info()->closure());
+      specialization_context_ = GetModuleContext(info());
     }
   }
 
@@ -511,7 +520,7 @@ class PipelineData {
     jsgraph_ = nullptr;
     mcgraph_ = nullptr;
     schedule_ = nullptr;
-    if (turboshaft_data_) turboshaft_data_->DeleteGraphZone();
+    DCHECK(!turboshaft::PipelineData::HasScope());
     graph_zone_scope_.Destroy();
   }
 
@@ -565,12 +574,11 @@ class PipelineData {
   }
 
   void InitializeTopTierRegisterAllocationData(
-      const RegisterConfiguration* config, CallDescriptor* call_descriptor,
-      RegisterAllocationFlags flags) {
+      const RegisterConfiguration* config, CallDescriptor* call_descriptor) {
     DCHECK_NULL(register_allocation_data_);
     register_allocation_data_ =
         register_allocation_zone()->New<TopTierRegisterAllocationData>(
-            config, register_allocation_zone(), frame(), sequence(), flags,
+            config, register_allocation_zone(), frame(), sequence(),
             &info()->tick_counter(), debug_name());
   }
 
@@ -595,15 +603,11 @@ class PipelineData {
 
   void InitializeCodeGenerator(Linkage* linkage) {
     DCHECK_NULL(code_generator_);
-    wasm::AssemblerBufferCache* buffer_cache = nullptr;
-#if V8_ENABLE_WEBASSEMBLY
-    buffer_cache = assembler_buffer_cache_;
-#endif  // V8_ENABLE_WEBASSEMBLY
     code_generator_ = new CodeGenerator(
         codegen_zone(), frame(), linkage, sequence(), info(), isolate(),
         osr_helper_, start_source_position_, jump_optimization_info_,
-        assembler_options(), buffer_cache, info_->builtin(),
-        max_unoptimized_frame_height(), max_pushed_argument_count(),
+        assembler_options(), info_->builtin(), max_unoptimized_frame_height(),
+        max_pushed_argument_count(),
         v8_flags.trace_turbo_stack_accesses ? debug_name_.get() : nullptr);
   }
 
@@ -651,11 +655,12 @@ class PipelineData {
   }
 #endif
 
+  bool inline_wasm_into_js() const { return inline_wasm_into_js_; }
+
  private:
   Isolate* const isolate_;
 #if V8_ENABLE_WEBASSEMBLY
   wasm::WasmEngine* const wasm_engine_ = nullptr;
-  wasm::AssemblerBufferCache* assembler_buffer_cache_ = nullptr;
   // The wasm module to be used for inlining wasm functions into JS.
   // The first module wins and inlining of different modules into the same
   // JS function is not supported. This is necessary because the wasm
@@ -667,7 +672,7 @@ class PipelineData {
   std::unique_ptr<char[]> debug_name_;
   bool may_have_unverifiable_graph_ = true;
   ZoneStats* const zone_stats_;
-  PipelineStatistics* pipeline_statistics_ = nullptr;
+  TurbofanPipelineStatistics* pipeline_statistics_ = nullptr;
   bool verify_graph_ = false;
   int start_source_position_ = kNoSourcePosition;
   base::Optional<OsrHelper> osr_helper_;
@@ -732,8 +737,7 @@ class PipelineData {
   const ProfileDataFromFile* profile_data_ = nullptr;
 
   bool has_js_wasm_calls_ = false;
-
-  base::Optional<turboshaft::PipelineData> turboshaft_data_ = base::nullopt;
+  bool inline_wasm_into_js_ = false;
 };
 
 class PipelineImpl final {
@@ -755,15 +759,24 @@ class PipelineImpl final {
 
   // Substep B.1. Produce a scheduled graph.
   void ComputeScheduledGraph();
-  void InitializeTurboshaftPipeline();
+  turboshaft::PipelineData CreateTurboshaftPipeline();
 
 #if V8_ENABLE_WASM_SIMD256_REVEC
   void Revectorize();
 #endif  // V8_ENABLE_WASM_SIMD256_REVEC
 
-  // Substep B.2. Select instructions from a scheduled graph.
+  // Substep B.2.turbofan Select instructions from a scheduled graph.
   bool SelectInstructions(Linkage* linkage);
 
+  // Substep B.2.turboshaft Select instructions from a turboshaft graph.
+  bool SelectInstructionsTurboshaft(
+      Linkage* linkage,
+      base::Optional<turboshaft::PipelineData::Scope>& turboshaft_scope);
+
+  // Substep B.3. Run register allocation on the instruction sequence.
+  bool AllocateRegisters(CallDescriptor* call_descriptor,
+                         bool has_dummy_end_block);
+
   // Step C. Run the code assembly pass.
   void AssembleCode(Linkage* linkage);
 
@@ -902,16 +915,16 @@ class V8_NODISCARD LocalIsolateScope {
 
 void PrintFunctionSource(OptimizedCompilationInfo* info, Isolate* isolate,
                          int source_id, Handle<SharedFunctionInfo> shared) {
-  if (!shared->script().IsUndefined(isolate)) {
+  if (!IsUndefined(shared->script(), isolate)) {
     Handle<Script> script(Script::cast(shared->script()), isolate);
 
-    if (!script->source().IsUndefined(isolate)) {
+    if (!IsUndefined(script->source(), isolate)) {
       CodeTracer::StreamScope tracing_scope(isolate->GetCodeTracer());
       Object source_name = script->name();
       auto& os = tracing_scope.stream();
       os << "--- FUNCTION SOURCE (";
-      if (source_name.IsString()) {
-        os << String::cast(source_name).ToCString().get() << ":";
+      if (IsString(source_name)) {
+        os << String::cast(source_name)->ToCString().get() << ":";
       }
       os << shared->DebugNameCStr().get() << ") id{";
       os << info->optimization_id() << "," << source_id << "} start{";
@@ -986,11 +999,11 @@ void PrintCode(Isolate* isolate, Handle<Code> code,
     const bool print_source = info->IsOptimizing();
     if (print_source) {
       Handle<SharedFunctionInfo> shared = info->shared_info();
-      if (shared->script().IsScript() &&
-          !Script::cast(shared->script()).source().IsUndefined(isolate)) {
+      if (IsScript(shared->script()) &&
+          !IsUndefined(Script::cast(shared->script())->source(), isolate)) {
         os << "--- Raw source ---\n";
         StringCharacterStream stream(
-            String::cast(Script::cast(shared->script()).source()),
+            String::cast(Script::cast(shared->script())->source()),
             shared->StartPosition());
         // fun->end_position() points to the last character in the stream. We
         // need to compensate by adding one to calculate the length.
@@ -1051,7 +1064,8 @@ void TraceScheduleAndVerify(OptimizedCompilationInfo* info, PipelineData* data,
   RCS_SCOPE(data->runtime_call_stats(),
             RuntimeCallCounterId::kOptimizeTraceScheduleAndVerify,
             RuntimeCallStats::kThreadSpecific);
-  TRACE_EVENT0(PipelineStatistics::kTraceCategory, "V8.TraceScheduleAndVerify");
+  TRACE_EVENT0(TurbofanPipelineStatistics::kTraceCategory,
+               "V8.TraceScheduleAndVerify");
 
   TraceSchedule(info, data, schedule, phase_name);
 
@@ -1076,18 +1090,17 @@ void AddReducer(PipelineData* data, GraphReducer* graph_reducer,
   graph_reducer->AddReducer(reducer);
 }
 
-PipelineStatistics* CreatePipelineStatistics(Handle<Script> script,
-                                             OptimizedCompilationInfo* info,
-                                             Isolate* isolate,
-                                             ZoneStats* zone_stats) {
-  PipelineStatistics* pipeline_statistics = nullptr;
+TurbofanPipelineStatistics* CreatePipelineStatistics(
+    Handle<Script> script, OptimizedCompilationInfo* info, Isolate* isolate,
+    ZoneStats* zone_stats) {
+  TurbofanPipelineStatistics* pipeline_statistics = nullptr;
 
   bool tracing_enabled;
   TRACE_EVENT_CATEGORY_GROUP_ENABLED(TRACE_DISABLED_BY_DEFAULT("v8.turbofan"),
                                      &tracing_enabled);
   if (tracing_enabled || v8_flags.turbo_stats || v8_flags.turbo_stats_nvp) {
-    pipeline_statistics =
-        new PipelineStatistics(info, isolate->GetTurboStatistics(), zone_stats);
+    pipeline_statistics = new TurbofanPipelineStatistics(
+        info, isolate->GetTurboStatistics(), zone_stats);
     pipeline_statistics->BeginPhaseKind("V8.TFInitializing");
   }
 
@@ -1103,16 +1116,16 @@ PipelineStatistics* CreatePipelineStatistics(Handle<Script> script,
 }
 
 #if V8_ENABLE_WEBASSEMBLY
-PipelineStatistics* CreatePipelineStatistics(
+TurbofanPipelineStatistics* CreatePipelineStatistics(
     wasm::FunctionBody function_body, const wasm::WasmModule* wasm_module,
     OptimizedCompilationInfo* info, ZoneStats* zone_stats) {
-  PipelineStatistics* pipeline_statistics = nullptr;
+  TurbofanPipelineStatistics* pipeline_statistics = nullptr;
 
   bool tracing_enabled;
   TRACE_EVENT_CATEGORY_GROUP_ENABLED(
       TRACE_DISABLED_BY_DEFAULT("v8.wasm.turbofan"), &tracing_enabled);
   if (tracing_enabled || v8_flags.turbo_stats_wasm) {
-    pipeline_statistics = new PipelineStatistics(
+    pipeline_statistics = new TurbofanPipelineStatistics(
         info, wasm::GetWasmEngine()->GetOrCreateTurboStatistics(), zone_stats);
     pipeline_statistics->BeginPhaseKind("V8.WasmInitializing");
   }
@@ -1163,16 +1176,11 @@ class PipelineCompilationJob final : public TurbofanCompilationJob {
                         LocalIsolate* local_isolate) final;
   Status FinalizeJobImpl(Isolate* isolate) final;
 
-  // Registers weak object to optimized code dependencies.
-  void RegisterWeakObjectsInOptimizedCode(Isolate* isolate,
-                                          Handle<NativeContext> context,
-                                          Handle<Code> code);
-
  private:
   Zone zone_;
   ZoneStats zone_stats_;
   OptimizedCompilationInfo compilation_info_;
-  std::unique_ptr<PipelineStatistics> pipeline_statistics_;
+  std::unique_ptr<TurbofanPipelineStatistics> pipeline_statistics_;
   PipelineData data_;
   PipelineImpl pipeline_;
   Linkage* linkage_;
@@ -1251,7 +1259,7 @@ PipelineCompilationJob::Status PipelineCompilationJob::PrepareJobImpl(
   // generated code on the native context keyed on SharedFunctionInfo.
   // TODO(mythria): Check if it is better to key the OSR cache on JSFunction and
   // allow context specialization for OSR code.
-  if (compilation_info()->closure()->raw_feedback_cell().map() ==
+  if (compilation_info()->closure()->raw_feedback_cell()->map() ==
           ReadOnlyRoots(isolate).one_closure_cell_map() &&
       !compilation_info()->is_osr()) {
     compilation_info()->set_function_context_specializing();
@@ -1317,6 +1325,10 @@ PipelineCompilationJob::Status PipelineCompilationJob::FinalizeJobImpl(
     }
     return FAILED;
   }
+  Handle<NativeContext> context(compilation_info()->native_context(), isolate);
+  if (context->IsDetached()) {
+    return AbortOptimization(BailoutReason::kDetachedNativeContext);
+  }
   if (!pipeline_.CheckNoDeprecatedMaps(code)) {
     return RetryOptimization(BailoutReason::kConcurrentMapDeprecation);
   }
@@ -1325,35 +1337,10 @@ PipelineCompilationJob::Status PipelineCompilationJob::FinalizeJobImpl(
   }
 
   compilation_info()->SetCode(code);
-  Handle<NativeContext> context(compilation_info()->native_context(), isolate);
   RegisterWeakObjectsInOptimizedCode(isolate, context, code);
   return SUCCEEDED;
 }
 
-void PipelineCompilationJob::RegisterWeakObjectsInOptimizedCode(
-    Isolate* isolate, Handle<NativeContext> context, Handle<Code> code) {
-  std::vector<Handle<Map>> maps;
-  DCHECK(code->is_optimized_code());
-  {
-    DisallowGarbageCollection no_gc;
-    PtrComprCageBase cage_base(isolate);
-    int const mode_mask = RelocInfo::EmbeddedObjectModeMask();
-    for (RelocIterator it(*code, mode_mask); !it.done(); it.next()) {
-      DCHECK(RelocInfo::IsEmbeddedObjectMode(it.rinfo()->rmode()));
-      HeapObject target_object = it.rinfo()->target_object(cage_base);
-      if (code->IsWeakObjectInOptimizedCode(target_object)) {
-        if (target_object.IsMap(cage_base)) {
-          maps.push_back(handle(Map::cast(target_object), isolate));
-        }
-      }
-    }
-  }
-  for (Handle<Map> map : maps) {
-    isolate->heap()->AddRetainedMap(context, map);
-  }
-  code->set_can_have_weak_objects(true);
-}
-
 template <typename Phase, typename... Args>
 auto PipelineImpl::Run(Args&&... args) {
 #ifdef V8_RUNTIME_CALL_STATS
@@ -1366,25 +1353,29 @@ auto PipelineImpl::Run(Args&&... args) {
   if constexpr (Phase::kKind == PhaseKind::kTurbofan) {
     return phase.Run(this->data_, scope.zone(), std::forward<Args>(args)...);
   } else if constexpr (Phase::kKind == PhaseKind::kTurboshaft) {
-    turboshaft::PipelineData* data = this->data_->turboshaft_data();
     using result_t =
-        decltype(phase.Run(data, scope.zone(), std::forward<Args>(args)...));
+        decltype(phase.Run(scope.zone(), std::forward<Args>(args)...));
     CodeTracer* code_tracer = nullptr;
-    if (data->info()->trace_turbo_graph()) {
+    USE(code_tracer);
+    if (turboshaft::PipelineData::Get().info()->trace_turbo_graph()) {
       // NOTE: We must not call `GetCodeTracer` if tracing is not enabled,
       // because it may not yet be initialized then and doing so from the
       // background thread is not threadsafe.
       code_tracer = this->data_->GetCodeTracer();
     }
     if constexpr (std::is_same_v<result_t, void>) {
-      phase.Run(data, scope.zone(), std::forward<Args>(args)...);
-      turboshaft::PrintTurboshaftGraph(data, scope.zone(), code_tracer,
-                                       Phase::phase_name());
+      phase.Run(scope.zone(), std::forward<Args>(args)...);
+      if constexpr (turboshaft::produces_printable_graph<Phase>::value) {
+        turboshaft::PrintTurboshaftGraph(scope.zone(), code_tracer,
+                                         Phase::phase_name());
+      }
       return;
     } else {
-      auto result = phase.Run(data, scope.zone(), std::forward<Args>(args)...);
-      turboshaft::PrintTurboshaftGraph(data, scope.zone(), code_tracer,
-                                       Phase::phase_name());
+      auto result = phase.Run(scope.zone(), std::forward<Args>(args)...);
+      if constexpr (turboshaft::produces_printable_graph<Phase>::value) {
+        turboshaft::PrintTurboshaftGraph(scope.zone(), code_tracer,
+                                         Phase::phase_name());
+      }
       return result;
     }
   }
@@ -1485,6 +1476,17 @@ struct InliningPhase {
       DCHECK(call_reducer.wasm_module_for_inlining() != nullptr);
       data->set_wasm_module_for_inlining(
           call_reducer.wasm_module_for_inlining());
+      // Enable source positions if not enabled yet. While JS only uses the
+      // source position table for tracing, profiling, ..., wasm needs it at
+      // compile time for keeping track of source locations for wasm traps.
+      // Note: By not setting data->info()->set_source_positions(), even with
+      // wasm inlining, source positions shouldn't be kept alive after
+      // compilation is finished (if not for tracing, ...)
+      if (data->inline_wasm_into_js() &&
+          !data->source_positions()->IsEnabled()) {
+        data->source_positions()->Enable();
+        data->source_positions()->AddDecorator();
+      }
     }
 #endif
   }
@@ -1498,7 +1500,6 @@ struct JSWasmInliningPhase {
     DCHECK(data->wasm_module_for_inlining() != nullptr);
 
     OptimizedCompilationInfo* info = data->info();
-    info->set_wasm_runtime_exception_support();
     GraphReducer graph_reducer(temp_zone, data->graph(), &info->tick_counter(),
                                data->broker(), data->jsgraph()->Dead());
     DeadCodeElimination dead_code_elimination(&graph_reducer, data->graph(),
@@ -1506,18 +1507,34 @@ struct JSWasmInliningPhase {
     CommonOperatorReducer common_reducer(
         &graph_reducer, data->graph(), data->broker(), data->common(),
         data->machine(), temp_zone, BranchSemantics::kMachine);
-    JSInliningHeuristic inlining(
-        &graph_reducer, temp_zone, data->info(), data->jsgraph(),
-        data->broker(), data->source_positions(), data->node_origins(),
-        JSInliningHeuristic::kWasmOnly, data->wasm_module_for_inlining());
+    JSInliningHeuristic::Mode mode =
+        data->inline_wasm_into_js() ? JSInliningHeuristic::kWasmFullInlining
+                                    : JSInliningHeuristic::kWasmWrappersOnly;
+    JSInliningHeuristic inlining(&graph_reducer, temp_zone, data->info(),
+                                 data->jsgraph(), data->broker(),
+                                 data->source_positions(), data->node_origins(),
+                                 mode, data->wasm_module_for_inlining());
+    AddReducer(data, &graph_reducer, &dead_code_elimination);
+    AddReducer(data, &graph_reducer, &common_reducer);
+    AddReducer(data, &graph_reducer, &inlining);
+    graph_reducer.ReduceGraph();
+  }
+};
+
+struct JSWasmLoweringPhase {
+  DECL_PIPELINE_PHASE_CONSTANTS(JSWasmLowering)
+  void Run(PipelineData* data, Zone* temp_zone) {
+    DCHECK(data->has_js_wasm_calls());
+    DCHECK_NE(data->wasm_module_for_inlining(), nullptr);
+
+    OptimizedCompilationInfo* info = data->info();
+    GraphReducer graph_reducer(temp_zone, data->graph(), &info->tick_counter(),
+                               data->broker(), data->jsgraph()->Dead());
     // The Wasm trap handler is not supported in JavaScript.
     const bool disable_trap_handler = true;
     WasmGCLowering lowering(&graph_reducer, data->jsgraph(),
                             data->wasm_module_for_inlining(),
                             disable_trap_handler, data->source_positions());
-    AddReducer(data, &graph_reducer, &dead_code_elimination);
-    AddReducer(data, &graph_reducer, &common_reducer);
-    AddReducer(data, &graph_reducer, &inlining);
     AddReducer(data, &graph_reducer, &lowering);
     graph_reducer.ReduceGraph();
   }
@@ -1592,7 +1609,8 @@ struct HeapBrokerInitializationPhase {
   DECL_MAIN_THREAD_PIPELINE_PHASE_CONSTANTS(HeapBrokerInitialization)
 
   void Run(PipelineData* data, Zone* temp_zone) {
-    data->broker()->InitializeAndStartSerializing();
+    data->broker()->AttachCompilationInfo(data->info());
+    data->broker()->InitializeAndStartSerializing(data->native_context());
   }
 };
 
@@ -1668,13 +1686,11 @@ struct TypeAssertionsPhase {
   DECL_PIPELINE_PHASE_CONSTANTS(TypeAssertions)
 
   void Run(PipelineData* data, Zone* temp_zone) {
-    GraphReducer graph_reducer(
-        temp_zone, data->graph(), &data->info()->tick_counter(), data->broker(),
-        data->jsgraph()->Dead(), data->observe_node_manager());
-    AddTypeAssertionsReducer type_assertions(&graph_reducer, data->jsgraph(),
-                                             temp_zone);
-    AddReducer(data, &graph_reducer, &type_assertions);
-    graph_reducer.ReduceGraph();
+    Schedule* schedule = Scheduler::ComputeSchedule(
+        temp_zone, data->graph(), Scheduler::kTempSchedule,
+        &data->info()->tick_counter(), data->profile_data());
+
+    AddTypeAssertions(data->jsgraph(), schedule, temp_zone);
   }
 };
 
@@ -1724,8 +1740,10 @@ struct WasmInliningPhase {
 
   void Run(PipelineData* data, Zone* temp_zone, wasm::CompilationEnv* env,
            WasmCompilationData& compilation_data,
-           ZoneVector<WasmInliningPosition>* inlining_positions) {
-    if (!WasmInliner::graph_size_allows_inlining(data->graph()->NodeCount())) {
+           ZoneVector<WasmInliningPosition>* inlining_positions,
+           wasm::WasmFeatures* detected) {
+    if (!WasmInliner::graph_size_allows_inlining(
+            data->graph()->NodeCount(), v8_flags.wasm_inlining_budget)) {
       return;
     }
     GraphReducer graph_reducer(
@@ -1735,7 +1753,7 @@ struct WasmInliningPhase {
                              temp_zone);
     std::unique_ptr<char[]> debug_name = data->info()->GetDebugName();
     WasmInliner inliner(&graph_reducer, env, compilation_data, data->mcgraph(),
-                        debug_name.get(), inlining_positions);
+                        debug_name.get(), inlining_positions, detected);
     AddReducer(data, &graph_reducer, &dead);
     AddReducer(data, &graph_reducer, &inliner);
     graph_reducer.ReduceGraph();
@@ -1976,8 +1994,8 @@ struct LoadEliminationPhase {
                                               data->common(), temp_zone);
     RedundancyElimination redundancy_elimination(&graph_reducer,
                                                  data->jsgraph(), temp_zone);
-    LoadElimination load_elimination(&graph_reducer, data->jsgraph(),
-                                     temp_zone);
+    LoadElimination load_elimination(&graph_reducer, data->broker(),
+                                     data->jsgraph(), temp_zone);
     CheckpointElimination checkpoint_elimination(&graph_reducer);
     ValueNumberingReducer value_numbering(temp_zone, data->graph()->zone());
     CommonOperatorReducer common_reducer(
@@ -2085,9 +2103,14 @@ struct MachineOperatorOptimizationPhase {
     ValueNumberingReducer value_numbering(temp_zone, data->graph()->zone());
     MachineOperatorReducer machine_reducer(&graph_reducer, data->jsgraph(),
                                            signalling_nan_propagation);
+    PairLoadStoreReducer pair_load_store_reducer(
+        &graph_reducer, data->jsgraph(), data->isolate());
 
     AddReducer(data, &graph_reducer, &machine_reducer);
     AddReducer(data, &graph_reducer, &value_numbering);
+    if (data->machine()->SupportsLoadStorePairs()) {
+      AddReducer(data, &graph_reducer, &pair_load_store_reducer);
+    }
     graph_reducer.ReduceGraph();
   }
 };
@@ -2131,10 +2154,11 @@ struct WasmTypingPhase {
   DECL_PIPELINE_PHASE_CONSTANTS(WasmTyping)
 
   void Run(PipelineData* data, Zone* temp_zone, uint32_t function_index) {
+    MachineGraph* mcgraph = data->mcgraph() ? data->mcgraph() : data->jsgraph();
     GraphReducer graph_reducer(
         temp_zone, data->graph(), &data->info()->tick_counter(), data->broker(),
         data->jsgraph()->Dead(), data->observe_node_manager());
-    WasmTyper typer(&graph_reducer, data->mcgraph(), function_index);
+    WasmTyper typer(&graph_reducer, mcgraph, function_index);
     AddReducer(data, &graph_reducer, &typer);
     graph_reducer.ReduceGraph();
   }
@@ -2143,19 +2167,20 @@ struct WasmTypingPhase {
 struct WasmGCOptimizationPhase {
   DECL_PIPELINE_PHASE_CONSTANTS(WasmGCOptimization)
 
-  void Run(PipelineData* data, Zone* temp_zone,
-           const wasm::WasmModule* module) {
+  void Run(PipelineData* data, Zone* temp_zone, const wasm::WasmModule* module,
+           MachineGraph* mcgraph) {
     GraphReducer graph_reducer(
         temp_zone, data->graph(), &data->info()->tick_counter(), data->broker(),
         data->jsgraph()->Dead(), data->observe_node_manager());
     WasmLoadElimination load_elimination(&graph_reducer, data->jsgraph(),
                                          temp_zone);
-    WasmGCOperatorReducer wasm_gc(&graph_reducer, temp_zone, data->mcgraph(),
-                                  module);
-    // Note: if we want to add DeadCodeElimination here, we'll have to update
-    // the existing reducers to handle kDead and kDeadValue nodes everywhere.
+    WasmGCOperatorReducer wasm_gc(&graph_reducer, temp_zone, mcgraph, module,
+                                  data->source_positions());
+    DeadCodeElimination dead_code_elimination(&graph_reducer, data->graph(),
+                                              data->common(), temp_zone);
     AddReducer(data, &graph_reducer, &load_elimination);
     AddReducer(data, &graph_reducer, &wasm_gc);
+    AddReducer(data, &graph_reducer, &dead_code_elimination);
     graph_reducer.ReduceGraph();
   }
 };
@@ -2197,12 +2222,12 @@ struct WasmOptimizationPhase {
   void Run(PipelineData* data, Zone* temp_zone,
            MachineOperatorReducer::SignallingNanPropagation
                signalling_nan_propagation,
-           wasm::WasmFeatures features) {
+           const wasm::WasmFeatures* features) {
     // Run optimizations in two rounds: First one around load elimination and
     // then one around branch elimination. This is because those two
     // optimizations sometimes display quadratic complexity when run together.
     // We only need load elimination for managed objects.
-    if (features.has_gc()) {
+    if (features->has_gc()) {
       GraphReducer graph_reducer(temp_zone, data->graph(),
                                  &data->info()->tick_counter(), data->broker(),
                                  data->jsgraph()->Dead(),
@@ -2250,6 +2275,20 @@ struct WasmOptimizationPhase {
     }
   }
 };
+
+struct WasmJSLoweringPhase {
+  DECL_PIPELINE_PHASE_CONSTANTS(WasmJSLowering)
+
+  void Run(PipelineData* data, Zone* temp_zone) {
+    GraphReducer graph_reducer(
+        temp_zone, data->graph(), &data->info()->tick_counter(), data->broker(),
+        data->jsgraph()->Dead(), data->observe_node_manager());
+    WasmJSLowering lowering(&graph_reducer, data->jsgraph(),
+                            data->source_positions());
+    AddReducer(data, &graph_reducer, &lowering);
+    graph_reducer.ReduceGraph();
+  }
+};
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 struct CsaEarlyOptimizationPhase {
@@ -2326,11 +2365,16 @@ struct CsaOptimizationPhase {
         &graph_reducer, data->graph(), data->broker(), data->common(),
         data->machine(), temp_zone, BranchSemantics::kMachine);
     ValueNumberingReducer value_numbering(temp_zone, data->graph()->zone());
+    PairLoadStoreReducer pair_load_store_reducer(
+        &graph_reducer, data->jsgraph(), data->isolate());
     AddReducer(data, &graph_reducer, &branch_condition_elimination);
     AddReducer(data, &graph_reducer, &dead_code_elimination);
     AddReducer(data, &graph_reducer, &machine_reducer);
     AddReducer(data, &graph_reducer, &common_reducer);
     AddReducer(data, &graph_reducer, &value_numbering);
+    if (data->machine()->SupportsLoadStorePairs()) {
+      AddReducer(data, &graph_reducer, &pair_load_store_reducer);
+    }
     graph_reducer.ReduceGraph();
   }
 };
@@ -2359,44 +2403,12 @@ struct RevectorizePhase {
 };
 #endif  // V8_ENABLE_WASM_SIMD256_REVEC
 
-struct InstructionRangesAsJSON {
-  const InstructionSequence* sequence;
-  const ZoneVector<std::pair<int, int>>* instr_origins;
-};
-
-std::ostream& operator<<(std::ostream& out, const InstructionRangesAsJSON& s) {
-  const int max = static_cast<int>(s.sequence->LastInstructionIndex());
-
-  out << ", \"nodeIdToInstructionRange\": {";
-  bool need_comma = false;
-  for (size_t i = 0; i < s.instr_origins->size(); ++i) {
-    std::pair<int, int> offset = (*s.instr_origins)[i];
-    if (offset.first == -1) continue;
-    const int first = max - offset.first + 1;
-    const int second = max - offset.second + 1;
-    if (need_comma) out << ", ";
-    out << "\"" << i << "\": [" << first << ", " << second << "]";
-    need_comma = true;
-  }
-  out << "}";
-  out << ", \"blockIdToInstructionRange\": {";
-  need_comma = false;
-  for (auto block : s.sequence->instruction_blocks()) {
-    if (need_comma) out << ", ";
-    out << "\"" << block->rpo_number() << "\": [" << block->code_start() << ", "
-        << block->code_end() << "]";
-    need_comma = true;
-  }
-  out << "}";
-  return out;
-}
-
 struct InstructionSelectionPhase {
   DECL_PIPELINE_PHASE_CONSTANTS(SelectInstructions)
 
   base::Optional<BailoutReason> Run(PipelineData* data, Zone* temp_zone,
                                     Linkage* linkage) {
-    InstructionSelector selector(
+    InstructionSelector selector = InstructionSelector::ForTurbofan(
         temp_zone, data->graph()->NodeCount(), linkage, data->sequence(),
         data->schedule(), data->source_positions(), data->frame(),
         data->info()->switch_jump_table()
@@ -2609,8 +2621,8 @@ struct OptimizeMovesPhase {
 struct FrameElisionPhase {
   DECL_PIPELINE_PHASE_CONSTANTS(FrameElision)
 
-  void Run(PipelineData* data, Zone* temp_zone) {
-    FrameElider(data->sequence()).Run();
+  void Run(PipelineData* data, Zone* temp_zone, bool has_dummy_end_block) {
+    FrameElider(data->sequence(), has_dummy_end_block).Run();
   }
 };
 
@@ -2772,9 +2784,9 @@ CompilationJob::Status WasmHeapStubCompilationJob::PrepareJobImpl(
 
 CompilationJob::Status WasmHeapStubCompilationJob::ExecuteJobImpl(
     RuntimeCallStats* stats, LocalIsolate* local_isolate) {
-  std::unique_ptr<PipelineStatistics> pipeline_statistics;
+  std::unique_ptr<TurbofanPipelineStatistics> pipeline_statistics;
   if (v8_flags.turbo_stats || v8_flags.turbo_stats_nvp) {
-    pipeline_statistics.reset(new PipelineStatistics(
+    pipeline_statistics.reset(new TurbofanPipelineStatistics(
         &info_, wasm::GetWasmEngine()->GetOrCreateTurboStatistics(),
         &zone_stats_));
     pipeline_statistics->BeginPhaseKind("V8.WasmStubCodegen");
@@ -2856,7 +2868,7 @@ void PipelineImpl::InitializeHeapBroker() {
     TurboCfgFile tcf(isolate());
     tcf << AsC1VCompilation(info());
   }
-  if (data->info()->bytecode_array()->SourcePositionTable().DataSize() == 0) {
+  if (data->info()->bytecode_array()->SourcePositionTable()->DataSize() == 0) {
     data->source_positions()->Disable();
   }
   data->source_positions()->AddDecorator();
@@ -2864,7 +2876,6 @@ void PipelineImpl::InitializeHeapBroker() {
     data->node_origins()->AddDecorator();
   }
 
-  data->broker()->SetTargetNativeContextRef(data->native_context());
   Run<HeapBrokerInitializationPhase>();
   data->broker()->StopSerializing();
   data->EndPhaseKind();
@@ -2955,6 +2966,17 @@ bool PipelineImpl::OptimizeGraph(Linkage* linkage) {
     DCHECK(data->info()->inline_js_wasm_calls());
     Run<JSWasmInliningPhase>();
     RunPrintAndVerify(JSWasmInliningPhase::phase_name(), true);
+    if (data->inline_wasm_into_js()) {
+      Run<WasmTypingPhase>(-1);
+      RunPrintAndVerify(WasmTypingPhase::phase_name(), true);
+      if (v8_flags.wasm_opt) {
+        Run<WasmGCOptimizationPhase>(data->wasm_module_for_inlining(),
+                                     data->jsgraph());
+        RunPrintAndVerify(WasmGCOptimizationPhase::phase_name(), true);
+      }
+      Run<JSWasmLoweringPhase>();
+      RunPrintAndVerify(JSWasmLoweringPhase::phase_name(), true);
+    }
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
@@ -2982,24 +3004,24 @@ bool PipelineImpl::OptimizeGraph(Linkage* linkage) {
   Run<EarlyOptimizationPhase>();
   RunPrintAndVerify(EarlyOptimizationPhase::phase_name(), true);
 
-  Run<EffectControlLinearizationPhase>();
-  RunPrintAndVerify(EffectControlLinearizationPhase::phase_name(), true);
+  if (!v8_flags.turboshaft) {
+    Run<EffectControlLinearizationPhase>();
+    RunPrintAndVerify(EffectControlLinearizationPhase::phase_name(), true);
 
-  if (v8_flags.turbo_store_elimination) {
-    Run<StoreStoreEliminationPhase>();
-    RunPrintAndVerify(StoreStoreEliminationPhase::phase_name(), true);
-  }
+    if (v8_flags.turbo_store_elimination) {
+      Run<StoreStoreEliminationPhase>();
+      RunPrintAndVerify(StoreStoreEliminationPhase::phase_name(), true);
+    }
 
-  // Optimize control flow.
-  if (v8_flags.turbo_cf_optimization) {
-    Run<ControlFlowOptimizationPhase>();
-    RunPrintAndVerify(ControlFlowOptimizationPhase::phase_name(), true);
-  }
+    // Optimize control flow.
+    if (v8_flags.turbo_cf_optimization) {
+      Run<ControlFlowOptimizationPhase>();
+      RunPrintAndVerify(ControlFlowOptimizationPhase::phase_name(), true);
+    }
 
-  Run<LateOptimizationPhase>();
-  RunPrintAndVerify(LateOptimizationPhase::phase_name(), true);
+    Run<LateOptimizationPhase>();
+    RunPrintAndVerify(LateOptimizationPhase::phase_name(), true);
 
-  if (!v8_flags.turboshaft) {
     // Optimize memory access and allocation operations.
     Run<MemoryOptimizationPhase>();
     RunPrintAndVerify(MemoryOptimizationPhase::phase_name(), true);
@@ -3013,10 +3035,17 @@ bool PipelineImpl::OptimizeGraph(Linkage* linkage) {
 
     Run<DecompressionOptimizationPhase>();
     RunPrintAndVerify(DecompressionOptimizationPhase::phase_name(), true);
-  }
 
-  Run<BranchConditionDuplicationPhase>();
-  RunPrintAndVerify(BranchConditionDuplicationPhase::phase_name(), true);
+#if V8_ENABLE_WEBASSEMBLY
+    if (data->has_js_wasm_calls() && data->inline_wasm_into_js()) {
+      Run<WasmJSLoweringPhase>();
+      RunPrintAndVerify(WasmJSLoweringPhase::phase_name(), true);
+    }
+#endif  // V8_ENABLE_WEBASSEMBLY
+
+    Run<BranchConditionDuplicationPhase>();
+    RunPrintAndVerify(BranchConditionDuplicationPhase::phase_name(), true);
+  }
 
   data->source_positions()->RemoveDecorator();
   if (data->info()->trace_turbo_json()) {
@@ -3029,7 +3058,8 @@ bool PipelineImpl::OptimizeGraph(Linkage* linkage) {
     UnparkedScopeIfNeeded scope(data->broker(),
                                 v8_flags.turboshaft_trace_reduction);
 
-    data->InitializeTurboshaftPipeline();
+    base::Optional<turboshaft::PipelineData::Scope> turboshaft_pipeline(
+        data->CreateTurboshaftPipeline());
     turboshaft::Tracing::Scope tracing_scope(data->info());
 
     if (base::Optional<BailoutReason> bailout =
@@ -3041,13 +3071,15 @@ bool PipelineImpl::OptimizeGraph(Linkage* linkage) {
 
     Run<turboshaft::MachineLoweringPhase>();
 
-    Run<turboshaft::LateOptimizationPhase>();
+    if (v8_flags.turbo_store_elimination) {
+      Run<turboshaft::StoreStoreEliminationPhase>();
+    }
 
     Run<turboshaft::OptimizePhase>();
 
-    Run<turboshaft::DecompressionOptimizationPhase>();
-
-    Run<turboshaft::TypedOptimizationsPhase>();
+    if (v8_flags.turboshaft_typed_optimizations) {
+      Run<turboshaft::TypedOptimizationsPhase>();
+    }
 
     if (v8_flags.turboshaft_assert_types) {
       Run<turboshaft::TypeAssertionsPhase>();
@@ -3055,8 +3087,21 @@ bool PipelineImpl::OptimizeGraph(Linkage* linkage) {
 
     Run<turboshaft::DeadCodeEliminationPhase>();
 
-    Run<turboshaft::TagUntagLoweringPhase>();
+    if (V8_UNLIKELY(v8_flags.turboshaft_enable_debug_features)) {
+      // This phase has to run very late to allow all previous phases to use
+      // debug features.
+      Run<turboshaft::DebugFeatureLoweringPhase>();
+    }
+
+    Run<turboshaft::DecompressionOptimizationPhase>();
 
+    if (v8_flags.turboshaft_instruction_selection) {
+      // Run Turboshaft instruction selection.
+      return SelectInstructionsTurboshaft(linkage, turboshaft_pipeline);
+    }
+
+    // Otherwise, translate back to Turbofan and run instruction selection on
+    // the sea of nodes graph.
     auto [new_graph, new_schedule] =
         Run<turboshaft::RecreateSchedulePhase>(linkage);
     data->set_graph(new_graph);
@@ -3083,9 +3128,9 @@ int HashGraphForPGO(Graph* graph) {
 
   constexpr NodeId kUnassigned = static_cast<NodeId>(-1);
 
-  constexpr byte kUnvisited = 0;
-  constexpr byte kOnStack = 1;
-  constexpr byte kVisited = 2;
+  constexpr uint8_t kUnvisited = 0;
+  constexpr uint8_t kOnStack = 1;
+  constexpr uint8_t kVisited = 2;
 
   // Do a depth-first post-order traversal of the graph. For every node, hash:
   //
@@ -3097,7 +3142,7 @@ int HashGraphForPGO(Graph* graph) {
   // What's a traversal number? We can't use node IDs because they're not stable
   // build-to-build, so we assign a new number for each node as it is visited.
 
-  ZoneVector<byte> state(graph->NodeCount(), kUnvisited, &local_zone);
+  ZoneVector<uint8_t> state(graph->NodeCount(), kUnvisited, &local_zone);
   ZoneVector<NodeId> traversal_numbers(graph->NodeCount(), kUnassigned,
                                        &local_zone);
   ZoneStack<Node*> stack(&local_zone);
@@ -3149,9 +3194,9 @@ MaybeHandle<Code> Pipeline::GenerateCodeForCodeStub(
   ZoneStats zone_stats(isolate->allocator());
   NodeOriginTable node_origins(graph);
   JumpOptimizationInfo jump_opt;
-  bool should_optimize_jumps = isolate->serializer_enabled() &&
-                               v8_flags.turbo_rewrite_far_jumps &&
-                               !v8_flags.turbo_profiling;
+  bool should_optimize_jumps =
+      isolate->serializer_enabled() && v8_flags.turbo_rewrite_far_jumps &&
+      !v8_flags.turbo_profiling && !v8_flags.dump_builtins_hashes_to_file;
   PipelineData data(&zone_stats, &info, isolate, isolate->allocator(), graph,
                     jsgraph, nullptr, source_positions, &node_origins,
                     should_optimize_jumps ? &jump_opt : nullptr, options,
@@ -3159,9 +3204,9 @@ MaybeHandle<Code> Pipeline::GenerateCodeForCodeStub(
   PipelineJobScope scope(&data, isolate->counters()->runtime_call_stats());
   RCS_SCOPE(isolate, RuntimeCallCounterId::kOptimizeCode);
   data.set_verify_graph(v8_flags.verify_csa);
-  std::unique_ptr<PipelineStatistics> pipeline_statistics;
+  std::unique_ptr<TurbofanPipelineStatistics> pipeline_statistics;
   if (v8_flags.turbo_stats || v8_flags.turbo_stats_nvp) {
-    pipeline_statistics.reset(new PipelineStatistics(
+    pipeline_statistics.reset(new TurbofanPipelineStatistics(
         &info, isolate->GetTurboStatistics(), &zone_stats));
     pipeline_statistics->BeginPhaseKind("V8.TFStubCodegen");
   }
@@ -3185,11 +3230,21 @@ MaybeHandle<Code> Pipeline::GenerateCodeForCodeStub(
   }
 
   int initial_graph_hash = 0;
-  if (v8_flags.turbo_profiling || profile_data != nullptr) {
+  if (v8_flags.turbo_profiling || v8_flags.dump_builtins_hashes_to_file ||
+      profile_data != nullptr) {
     initial_graph_hash = HashGraphForPGO(data.graph());
+    if (v8_flags.dump_builtins_hashes_to_file) {
+      std::ofstream out(v8_flags.dump_builtins_hashes_to_file,
+                        std::ios_base::app);
+      out << "Builtin: " << Builtins::name(builtin) << ", hash: 0x" << std::hex
+          << initial_graph_hash << std::endl;
+    }
   }
 
   if (profile_data != nullptr && profile_data->hash() != initial_graph_hash) {
+    if (v8_flags.reorder_builtins) {
+      BuiltinsCallGraph::Get()->set_all_hash_matched(false);
+    }
     if (v8_flags.abort_on_bad_builtin_profile_data ||
         v8_flags.warn_about_builtin_profile_data) {
       base::EmbeddedVector<char, 256> msg;
@@ -3213,6 +3268,12 @@ MaybeHandle<Code> Pipeline::GenerateCodeForCodeStub(
         PrintF("%s\n", msg.begin());
       }
     }
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+    if (v8_flags.turbo_log_builtins_count_input) {
+      PrintF("The hash came from execution count file for %s was not match!\n",
+             debug_name);
+    }
+#endif
     profile_data = nullptr;
     data.set_profile_data(profile_data);
   }
@@ -3296,13 +3357,11 @@ wasm::WasmCompilationResult Pipeline::GenerateCodeForWasmNativeStub(
   wasm::WasmEngine* wasm_engine = wasm::GetWasmEngine();
   ZoneStats zone_stats(wasm_engine->allocator());
   NodeOriginTable* node_positions = graph->zone()->New<NodeOriginTable>(graph);
-  // TODO(12809): Use the assembler buffer cache to also protect wasm stubs.
-  constexpr wasm::AssemblerBufferCache* kNoBufferCache = nullptr;
   PipelineData data(&zone_stats, wasm_engine, &info, mcgraph, nullptr,
-                    source_positions, node_positions, options, kNoBufferCache);
-  std::unique_ptr<PipelineStatistics> pipeline_statistics;
+                    source_positions, node_positions, options);
+  std::unique_ptr<TurbofanPipelineStatistics> pipeline_statistics;
   if (v8_flags.turbo_stats || v8_flags.turbo_stats_nvp) {
-    pipeline_statistics.reset(new PipelineStatistics(
+    pipeline_statistics.reset(new TurbofanPipelineStatistics(
         &info, wasm_engine->GetOrCreateTurboStatistics(), &zone_stats));
     pipeline_statistics->BeginPhaseKind("V8.WasmStubCodegen");
   }
@@ -3410,12 +3469,12 @@ void LowerInt64(const wasm::FunctionSig* sig, MachineGraph* mcgraph,
   pipeline.RunPrintAndVerify("V8.Int64Lowering", true);
 }
 
-base::OwnedVector<byte> SerializeInliningPositions(
+base::OwnedVector<uint8_t> SerializeInliningPositions(
     const ZoneVector<WasmInliningPosition>& positions) {
   const size_t entry_size =
       sizeof positions[0].inlinee_func_index + sizeof positions[0].caller_pos;
-  auto result = base::OwnedVector<byte>::New(positions.size() * entry_size);
-  byte* iter = result.begin();
+  auto result = base::OwnedVector<uint8_t>::New(positions.size() * entry_size);
+  uint8_t* iter = result.begin();
   for (const auto& [func_index, caller_pos] : positions) {
     size_t index_size = sizeof func_index;
     std::memcpy(iter, &func_index, index_size);
@@ -3435,22 +3494,23 @@ void Pipeline::GenerateCodeForWasmFunction(
     OptimizedCompilationInfo* info, wasm::CompilationEnv* env,
     WasmCompilationData& compilation_data, MachineGraph* mcgraph,
     CallDescriptor* call_descriptor,
-    ZoneVector<WasmInliningPosition>* inlining_positions) {
+    ZoneVector<WasmInliningPosition>* inlining_positions,
+    wasm::WasmFeatures* detected) {
   auto* wasm_engine = wasm::GetWasmEngine();
   const wasm::WasmModule* module = env->module;
-  wasm::WasmFeatures features = env->enabled_features;
+  wasm::WasmFeatures enabled = env->enabled_features;
   base::TimeTicks start_time;
   if (V8_UNLIKELY(v8_flags.trace_wasm_compilation_times)) {
     start_time = base::TimeTicks::Now();
   }
   ZoneStats zone_stats(wasm_engine->allocator());
-  std::unique_ptr<PipelineStatistics> pipeline_statistics(
+  std::unique_ptr<TurbofanPipelineStatistics> pipeline_statistics(
       CreatePipelineStatistics(compilation_data.func_body, module, info,
                                &zone_stats));
-  PipelineData data(
-      &zone_stats, wasm_engine, info, mcgraph, pipeline_statistics.get(),
-      compilation_data.source_positions, compilation_data.node_origins,
-      WasmAssemblerOptions(), compilation_data.buffer_cache);
+  PipelineData data(&zone_stats, wasm_engine, info, mcgraph,
+                    pipeline_statistics.get(),
+                    compilation_data.source_positions,
+                    compilation_data.node_origins, WasmAssemblerOptions());
 
   PipelineImpl pipeline(&data);
 
@@ -3472,8 +3532,9 @@ void Pipeline::GenerateCodeForWasmFunction(
 #endif  // V8_ENABLE_WASM_SIMD256_REVEC
 
   data.BeginPhaseKind("V8.WasmOptimization");
-  if (features.has_inlining()) {
-    pipeline.Run<WasmInliningPhase>(env, compilation_data, inlining_positions);
+  if (enabled.has_inlining()) {
+    pipeline.Run<WasmInliningPhase>(env, compilation_data, inlining_positions,
+                                    detected);
     pipeline.RunPrintAndVerify(WasmInliningPhase::phase_name(), true);
   }
   if (v8_flags.wasm_loop_peeling) {
@@ -3489,18 +3550,25 @@ void Pipeline::GenerateCodeForWasmFunction(
       is_asm_js ? MachineOperatorReducer::kPropagateSignallingNan
                 : MachineOperatorReducer::kSilenceSignallingNan;
 
-  if (features.has_gc() || features.has_stringref()) {
+#define DETECTED_IMPLIES_ENABLED(feature, ...) \
+  DCHECK_IMPLIES(detected->has_##feature(), enabled.has_##feature());
+  FOREACH_WASM_FEATURE_FLAG(DETECTED_IMPLIES_ENABLED)
+#undef DETECTED_IMPLIES_ENABLED
+
+  if (detected->has_gc() || detected->has_stringref() ||
+      detected->has_imported_strings()) {
     pipeline.Run<WasmTypingPhase>(compilation_data.func_index);
     pipeline.RunPrintAndVerify(WasmTypingPhase::phase_name(), true);
     if (v8_flags.wasm_opt) {
-      pipeline.Run<WasmGCOptimizationPhase>(module);
+      pipeline.Run<WasmGCOptimizationPhase>(module, data.mcgraph());
       pipeline.RunPrintAndVerify(WasmGCOptimizationPhase::phase_name(), true);
     }
   }
 
   // These proposals use gc nodes.
-  if (features.has_gc() || features.has_typed_funcref() ||
-      features.has_stringref()) {
+  if (detected->has_gc() || detected->has_typed_funcref() ||
+      detected->has_stringref() || detected->has_reftypes() ||
+      detected->has_imported_strings()) {
     pipeline.Run<WasmGCLoweringPhase>(module);
     pipeline.RunPrintAndVerify(WasmGCLoweringPhase::phase_name(), true);
   }
@@ -3513,7 +3581,7 @@ void Pipeline::GenerateCodeForWasmFunction(
              pipeline);
 
   if (v8_flags.wasm_opt || is_asm_js) {
-    pipeline.Run<WasmOptimizationPhase>(signalling_nan_propagation, features);
+    pipeline.Run<WasmOptimizationPhase>(signalling_nan_propagation, detected);
     pipeline.RunPrintAndVerify(WasmOptimizationPhase::phase_name(), true);
   } else {
     pipeline.Run<WasmBaseOptimizationPhase>();
@@ -3523,18 +3591,16 @@ void Pipeline::GenerateCodeForWasmFunction(
   pipeline.Run<MemoryOptimizationPhase>();
   pipeline.RunPrintAndVerify(MemoryOptimizationPhase::phase_name(), true);
 
-  if (features.has_gc() && v8_flags.wasm_opt) {
+  if (detected->has_gc() && v8_flags.wasm_opt) {
     // Run value numbering and machine operator reducer to optimize load/store
     // address computation (in particular, reuse the address computation
     // whenever possible).
     pipeline.Run<MachineOperatorOptimizationPhase>(signalling_nan_propagation);
     pipeline.RunPrintAndVerify(MachineOperatorOptimizationPhase::phase_name(),
                                true);
-    if (!v8_flags.turboshaft_wasm) {
-      pipeline.Run<DecompressionOptimizationPhase>();
-      pipeline.RunPrintAndVerify(DecompressionOptimizationPhase::phase_name(),
-                                 true);
-    }
+    pipeline.Run<DecompressionOptimizationPhase>();
+    pipeline.RunPrintAndVerify(DecompressionOptimizationPhase::phase_name(),
+                               true);
   }
 
   if (v8_flags.wasm_opt) {
@@ -3543,11 +3609,6 @@ void Pipeline::GenerateCodeForWasmFunction(
                                true);
   }
 
-  if (v8_flags.turboshaft_wasm) {
-    pipeline.Run<SimplifyLoopsPhase>();
-    pipeline.RunPrintAndVerify(SimplifyLoopsPhase::phase_name(), true);
-  }
-
   if (v8_flags.turbo_splitting && !is_asm_js) {
     data.info()->set_splitting();
   }
@@ -3561,20 +3622,144 @@ void Pipeline::GenerateCodeForWasmFunction(
 
   Linkage linkage(call_descriptor);
 
-  if (v8_flags.turboshaft_wasm) {
-    pipeline.InitializeTurboshaftPipeline();
+  if (!pipeline.SelectInstructions(&linkage)) return;
+  pipeline.AssembleCode(&linkage);
 
-    if (base::Optional<BailoutReason> bailout =
-            pipeline.Run<turboshaft::BuildGraphPhase>(&linkage)) {
-      pipeline.info()->AbortOptimization(*bailout);
-      data.EndPhaseKind();
-      info->SetWasmCompilationResult({});
-      return;
+  auto result = std::make_unique<wasm::WasmCompilationResult>();
+  CodeGenerator* code_generator = pipeline.code_generator();
+  code_generator->masm()->GetCode(
+      nullptr, &result->code_desc, code_generator->safepoint_table_builder(),
+      static_cast<int>(code_generator->handler_table_offset()));
+
+  result->instr_buffer = code_generator->masm()->ReleaseBuffer();
+  result->frame_slot_count = code_generator->frame()->GetTotalFrameSlotCount();
+  result->tagged_parameter_slots = call_descriptor->GetTaggedParameterSlots();
+  result->source_positions = code_generator->GetSourcePositionTable();
+  result->inlining_positions = SerializeInliningPositions(*inlining_positions);
+  result->protected_instructions_data =
+      code_generator->GetProtectedInstructionsData();
+  result->result_tier = wasm::ExecutionTier::kTurbofan;
+
+  if (data.info()->trace_turbo_json()) {
+    TurboJsonFile json_of(data.info(), std::ios_base::app);
+    json_of << "{\"name\":\"disassembly\",\"type\":\"disassembly\""
+            << BlockStartsAsJSON{&code_generator->block_starts()}
+            << "\"data\":\"";
+#ifdef ENABLE_DISASSEMBLER
+    std::stringstream disassembler_stream;
+    Disassembler::Decode(
+        nullptr, disassembler_stream, result->code_desc.buffer,
+        result->code_desc.buffer + result->code_desc.safepoint_table_offset,
+        CodeReference(&result->code_desc));
+    for (auto const c : disassembler_stream.str()) {
+      json_of << AsEscapedUC16ForJSON(c);
+    }
+#endif  // ENABLE_DISASSEMBLER
+    json_of << "\"}\n],\n";
+    JsonPrintAllSourceWithPositionsWasm(json_of, module,
+                                        compilation_data.wire_bytes_storage,
+                                        base::VectorOf(*inlining_positions));
+    json_of << "}";
+    json_of << "\n}";
+  }
+
+  if (data.info()->trace_turbo_json() || data.info()->trace_turbo_graph()) {
+    CodeTracer::StreamScope tracing_scope(data.GetCodeTracer());
+    tracing_scope.stream()
+        << "---------------------------------------------------\n"
+        << "Finished compiling method " << data.info()->GetDebugName().get()
+        << " using TurboFan" << std::endl;
+  }
+
+  if (V8_UNLIKELY(v8_flags.trace_wasm_compilation_times)) {
+    base::TimeDelta time = base::TimeTicks::Now() - start_time;
+    int codesize = result->code_desc.body_size();
+    StdoutStream{} << "Compiled function "
+                   << reinterpret_cast<const void*>(module) << "#"
+                   << compilation_data.func_index << " using TurboFan, took "
+                   << time.InMilliseconds() << " ms and "
+                   << zone_stats.GetMaxAllocatedBytes() << " / "
+                   << zone_stats.GetTotalAllocatedBytes()
+                   << " max/total bytes; bodysize "
+                   << compilation_data.body_size() << " codesize " << codesize
+                   << " name " << data.info()->GetDebugName().get()
+                   << std::endl;
+  }
+
+  DCHECK(result->succeeded());
+  info->SetWasmCompilationResult(std::move(result));
+}
+
+// static
+bool Pipeline::GenerateWasmCodeFromTurboshaftGraph(
+    OptimizedCompilationInfo* info, wasm::CompilationEnv* env,
+    WasmCompilationData& compilation_data, MachineGraph* mcgraph,
+    const wasm::FunctionBody& body, wasm::WasmFeatures* detected,
+    CallDescriptor* call_descriptor) {
+  auto* wasm_engine = wasm::GetWasmEngine();
+  const wasm::WasmModule* module = env->module;
+  base::TimeTicks start_time;
+  if (V8_UNLIKELY(v8_flags.trace_wasm_compilation_times)) {
+    start_time = base::TimeTicks::Now();
+  }
+  ZoneStats zone_stats(wasm_engine->allocator());
+  std::unique_ptr<TurbofanPipelineStatistics> pipeline_statistics(
+      CreatePipelineStatistics(compilation_data.func_body, module, info,
+                               &zone_stats));
+  PipelineData data(&zone_stats, wasm_engine, info, mcgraph,
+                    pipeline_statistics.get(),
+                    compilation_data.source_positions,
+                    compilation_data.node_origins, WasmAssemblerOptions());
+
+  PipelineImpl pipeline(&data);
+
+  if (data.info()->trace_turbo_json() || data.info()->trace_turbo_graph()) {
+    CodeTracer::StreamScope tracing_scope(data.GetCodeTracer());
+    tracing_scope.stream()
+        << "---------------------------------------------------\n"
+        << "Begin compiling method " << data.info()->GetDebugName().get()
+        << " using TurboFan" << std::endl;
+  }
+
+  if (mcgraph->machine()->Is32()) {
+    call_descriptor =
+        GetI32WasmCallDescriptor(mcgraph->zone(), call_descriptor);
+  }
+  Linkage linkage(call_descriptor);
+
+  {
+    turboshaft::PipelineData::Scope turboshaft_pipeline(
+        pipeline.CreateTurboshaftPipeline());
+    turboshaft::PipelineData::Get().set_wasm_sig(
+        compilation_data.func_body.sig);
+
+    turboshaft::PipelineData::Get().set_wasm_module(env->module);
+    DCHECK_NOT_NULL(turboshaft::PipelineData::Get().wasm_module());
+
+    AccountingAllocator allocator;
+    if (!wasm::BuildTSGraph(&allocator, env->enabled_features, env->module,
+                            detected, body, turboshaft_pipeline.Value().graph(),
+                            data.node_origins())) {
+      return false;
     }
+    CodeTracer* code_tracer = nullptr;
+    if (turboshaft::PipelineData::Get().info()->trace_turbo_graph()) {
+      // NOTE: We must not call `GetCodeTracer` if tracing is not enabled,
+      // because it may not yet be initialized then and doing so from the
+      // background thread is not threadsafe.
+      code_tracer = data.GetCodeTracer();
+    }
+    Zone printing_zone(&allocator, ZONE_NAME);
+    turboshaft::PrintTurboshaftGraph(&printing_zone, code_tracer,
+                                     "Graph generation");
 
-    pipeline.Run<turboshaft::OptimizePhase>();
+    // This is more than an optimization currently: We need it to sort blocks to
+    // work around a bug in RecreateSchedulePhase.
+    pipeline.Run<turboshaft::WasmOptimizePhase>();
 
-    pipeline.Run<turboshaft::DecompressionOptimizationPhase>();
+    if (mcgraph->machine()->Is32()) {
+      pipeline.Run<turboshaft::Int64LoweringPhase>();
+    }
 
     auto [new_graph, new_schedule] =
         pipeline.Run<turboshaft::RecreateSchedulePhase>(&linkage);
@@ -3584,7 +3769,7 @@ void Pipeline::GenerateCodeForWasmFunction(
                   turboshaft::RecreateSchedulePhase::phase_name());
   }
 
-  if (!pipeline.SelectInstructions(&linkage)) return;
+  CHECK(pipeline.SelectInstructions(&linkage));
   pipeline.AssembleCode(&linkage);
 
   auto result = std::make_unique<wasm::WasmCompilationResult>();
@@ -3597,7 +3782,6 @@ void Pipeline::GenerateCodeForWasmFunction(
   result->frame_slot_count = code_generator->frame()->GetTotalFrameSlotCount();
   result->tagged_parameter_slots = call_descriptor->GetTaggedParameterSlots();
   result->source_positions = code_generator->GetSourcePositionTable();
-  result->inlining_positions = SerializeInliningPositions(*inlining_positions);
   result->protected_instructions_data =
       code_generator->GetProtectedInstructionsData();
   result->result_tier = wasm::ExecutionTier::kTurbofan;
@@ -3618,6 +3802,8 @@ void Pipeline::GenerateCodeForWasmFunction(
     }
 #endif  // ENABLE_DISASSEMBLER
     json_of << "\"}\n]";
+    // TODO(mliedtke): Add sources of inlined wasm functions once inlining is
+    // supported.
     json_of << "\n}";
   }
 
@@ -3646,15 +3832,15 @@ void Pipeline::GenerateCodeForWasmFunction(
 
   DCHECK(result->succeeded());
   info->SetWasmCompilationResult(std::move(result));
+  return true;
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 // static
 MaybeHandle<Code> Pipeline::GenerateCodeForTesting(
-    OptimizedCompilationInfo* info, Isolate* isolate,
-    std::unique_ptr<JSHeapBroker>* out_broker) {
+    OptimizedCompilationInfo* info, Isolate* isolate) {
   ZoneStats zone_stats(isolate->allocator());
-  std::unique_ptr<PipelineStatistics> pipeline_statistics(
+  std::unique_ptr<TurbofanPipelineStatistics> pipeline_statistics(
       CreatePipelineStatistics(Handle<Script>::null(), info, isolate,
                                &zone_stats));
 
@@ -3666,8 +3852,7 @@ MaybeHandle<Code> Pipeline::GenerateCodeForTesting(
 
   {
     CompilationHandleScope compilation_scope(isolate, info);
-    CanonicalHandleScopeForTurbofan canonical(isolate, info);
-    info->ReopenHandlesInNewHandleScope(isolate);
+    info->ReopenAndCanonicalizeHandlesInNewScope(isolate);
     pipeline.InitializeHeapBroker();
   }
 
@@ -3681,19 +3866,9 @@ MaybeHandle<Code> Pipeline::GenerateCodeForTesting(
     pipeline.AssembleCode(&linkage);
   }
 
-  const bool will_retire_broker = out_broker == nullptr;
-  if (!will_retire_broker) {
-    // If the broker is going to be kept alive, pass the persistent and the
-    // canonical handles containers back to the JSHeapBroker since it will
-    // outlive the OptimizedCompilationInfo.
-    data.broker()->SetPersistentAndCopyCanonicalHandlesForTesting(
-        info->DetachPersistentHandles(), info->DetachCanonicalHandles());
-  }
-
   Handle<Code> code;
-  if (pipeline.FinalizeCode(will_retire_broker).ToHandle(&code) &&
+  if (pipeline.FinalizeCode().ToHandle(&code) &&
       pipeline.CommitDependencies(code)) {
-    if (!will_retire_broker) *out_broker = data.ReleaseBroker();
     return code;
   }
   return {};
@@ -3711,9 +3886,9 @@ MaybeHandle<Code> Pipeline::GenerateCodeForTesting(
                     nullptr, schedule, nullptr, node_positions, nullptr,
                     options, nullptr);
   PipelineJobScope scope(&data, isolate->counters()->runtime_call_stats());
-  std::unique_ptr<PipelineStatistics> pipeline_statistics;
+  std::unique_ptr<TurbofanPipelineStatistics> pipeline_statistics;
   if (v8_flags.turbo_stats || v8_flags.turbo_stats_nvp) {
-    pipeline_statistics.reset(new PipelineStatistics(
+    pipeline_statistics.reset(new TurbofanPipelineStatistics(
         info, isolate->GetTurboStatistics(), &zone_stats));
     pipeline_statistics->BeginPhaseKind("V8.TFTestCodegen");
   }
@@ -3784,8 +3959,8 @@ void PipelineImpl::ComputeScheduledGraph() {
   TraceScheduleAndVerify(data->info(), data, data->schedule(), "schedule");
 }
 
-void PipelineImpl::InitializeTurboshaftPipeline() {
-  this->data_->InitializeTurboshaftPipeline();
+turboshaft::PipelineData PipelineImpl::CreateTurboshaftPipeline() {
+  return data_->CreateTurboshaftPipeline();
 }
 
 #if V8_ENABLE_WASM_SIMD256_REVEC
@@ -3800,6 +3975,11 @@ bool PipelineImpl::SelectInstructions(Linkage* linkage) {
   DCHECK_NOT_NULL(data->graph());
   DCHECK_NOT_NULL(data->schedule());
 
+  if (v8_flags.reorder_builtins && Builtins::IsBuiltinId(info()->builtin())) {
+    UnparkedScopeIfNeeded unparked_scope(data->broker());
+    BasicBlockCallGraphProfiler::StoreCallGraph(info(), data->schedule());
+  }
+
   if (v8_flags.turbo_profiling) {
     UnparkedScopeIfNeeded unparked_scope(data->broker());
     data->info()->set_profiler_data(BasicBlockInstrumentor::Instrument(
@@ -3885,6 +4065,69 @@ bool PipelineImpl::SelectInstructions(Linkage* linkage) {
 
   data->DeleteGraphZone();
 
+  return AllocateRegisters(call_descriptor, true);
+}
+
+bool PipelineImpl::SelectInstructionsTurboshaft(
+    Linkage* linkage,
+    base::Optional<turboshaft::PipelineData::Scope>& turboshaft_scope) {
+  auto call_descriptor = linkage->GetIncomingDescriptor();
+  PipelineData* turbofan_data = this->data_;
+
+  // Depending on which code path led us to this function, the frame may or
+  // may not have been initialized. If it hasn't yet, initialize it now.
+  if (!turbofan_data->frame()) {
+    turbofan_data->InitializeFrameData(call_descriptor);
+  }
+
+  // Select and schedule instructions covering the scheduled graph.
+  CodeTracer* code_tracer = nullptr;
+  if (turbofan_data->info()->trace_turbo_graph()) {
+    // NOTE: We must not call `GetCodeTracer` if tracing is not enabled,
+    // because it may not yet be initialized then and doing so from the
+    // background thread is not threadsafe.
+    code_tracer = turbofan_data->GetCodeTracer();
+  }
+  if (base::Optional<BailoutReason> bailout =
+          Run<turboshaft::InstructionSelectionPhase>(call_descriptor, linkage,
+                                                     code_tracer)) {
+    info()->AbortOptimization(*bailout);
+    turbofan_data->EndPhaseKind();
+    return false;
+  }
+
+  // TODO(nicohartmann@): We might need to provide this.
+  // if (info()->trace_turbo_json()) {
+  //   UnparkedScopeIfNeeded scope(turbofan_data->broker());
+  //   AllowHandleDereference allow_deref;
+  //   TurboCfgFile tcf(isolate());
+  //   tcf << AsC1V("CodeGen", turbofan_data->schedule(),
+  //                turbofan_data->source_positions(),
+  //                turbofan_data->sequence());
+
+  //   std::ostringstream source_position_output;
+  //   // Output source position information before the graph is deleted.
+  //   if (data_->source_positions() != nullptr) {
+  //     data_->source_positions()->PrintJson(source_position_output);
+  //   } else {
+  //     source_position_output << "{}";
+  //   }
+  //   source_position_output << ",\n\"nodeOrigins\" : ";
+  //   data_->node_origins()->PrintJson(source_position_output);
+  //   data_->set_source_position_output(source_position_output.str());
+  // }
+
+  turboshaft_scope.reset();
+  turbofan_data->DeleteGraphZone();
+
+  return AllocateRegisters(call_descriptor, false);
+}
+
+bool PipelineImpl::AllocateRegisters(CallDescriptor* call_descriptor,
+                                     bool has_dummy_end_block) {
+  PipelineData* data = this->data_;
+  DCHECK_NOT_NULL(data->sequence());
+
   data->BeginPhaseKind("V8.TFRegisterAllocation");
 
   bool run_verifier = v8_flags.turbo_verify_allocation;
@@ -3894,7 +4137,7 @@ bool PipelineImpl::SelectInstructions(Linkage* linkage) {
   // This limit is chosen somewhat arbitrarily, by looking at a few bigger
   // WebAssembly programs, and chosing the limit such that functions that take
   // >100ms in register allocation are switched to mid-tier.
-  static int kTopTierVirtualRegistersLimit = 8192;
+  static int kTopTierVirtualRegistersLimit = 16384;
 
   const RegisterConfiguration* config = RegisterConfiguration::Default();
   std::unique_ptr<const RegisterConfiguration> restricted_config;
@@ -3925,7 +4168,7 @@ bool PipelineImpl::SelectInstructions(Linkage* linkage) {
   // Verify the instruction sequence has the same hash in two stages.
   VerifyGeneratedCodeIsIdempotent();
 
-  Run<FrameElisionPhase>();
+  Run<FrameElisionPhase>(has_dummy_end_block);
 
   // TODO(mtrofin): move this off to the register allocator.
   bool generate_frame_at_start =
@@ -3957,9 +4200,9 @@ void PipelineImpl::VerifyGeneratedCodeIsIdempotent() {
     hash_code = base::hash_combine(hash_code, code->GetRepresentation(i));
   }
   if (jump_opt->is_collecting()) {
-    jump_opt->set_hash_code(hash_code);
+    jump_opt->hash_code = hash_code;
   } else {
-    CHECK_EQ(hash_code, jump_opt->hash_code());
+    CHECK_EQ(hash_code, jump_opt->hash_code);
   }
 }
 
@@ -4058,7 +4301,11 @@ MaybeHandle<Code> PipelineImpl::FinalizeCode(bool retire_broker) {
 #endif  // ENABLE_DISASSEMBLER
     json_of << "\"}\n],\n";
     json_of << "\"nodePositions\":";
-    json_of << data->source_position_output() << ",\n";
+    // TODO(nicohartmann@): We should try to always provide source positions.
+    json_of << (data->source_position_output().empty()
+                    ? "{}"
+                    : data->source_position_output())
+            << ",\n";
     JsonPrintAllSourceWithPositions(json_of, data->info(), isolate());
     if (info()->has_bytecode_array()) {
       json_of << ",\n";
@@ -4114,7 +4361,7 @@ bool PipelineImpl::CheckNoDeprecatedMaps(Handle<Code> code) {
   for (RelocIterator it(*code, mode_mask); !it.done(); it.next()) {
     DCHECK(RelocInfo::IsEmbeddedObjectMode(it.rinfo()->rmode()));
     HeapObject obj = it.rinfo()->target_object(data_->isolate());
-    if (obj.IsMap() && Map::cast(obj).is_deprecated()) {
+    if (IsMap(obj) && Map::cast(obj)->is_deprecated()) {
       return false;
     }
   }
@@ -4173,11 +4420,7 @@ void PipelineImpl::AllocateRegistersForTopTier(
   data_->sequence()->ValidateDeferredBlockExitPaths();
 #endif
 
-  RegisterAllocationFlags flags;
-  if (data->info()->trace_turbo_allocation()) {
-    flags |= RegisterAllocationFlag::kTraceAllocation;
-  }
-  data->InitializeTopTierRegisterAllocationData(config, call_descriptor, flags);
+  data->InitializeTopTierRegisterAllocationData(config, call_descriptor);
 
   Run<MeetRegisterConstraintsPhase>();
   Run<ResolvePhisPhase>();
@@ -4299,6 +4542,33 @@ ObserveNodeManager* PipelineImpl::observe_node_manager() const {
   return data_->observe_node_manager();
 }
 
+std::ostream& operator<<(std::ostream& out, const InstructionRangesAsJSON& s) {
+  const int max = static_cast<int>(s.sequence->LastInstructionIndex());
+
+  out << ", \"nodeIdToInstructionRange\": {";
+  bool need_comma = false;
+  for (size_t i = 0; i < s.instr_origins->size(); ++i) {
+    std::pair<int, int> offset = (*s.instr_origins)[i];
+    if (offset.first == -1) continue;
+    const int first = max - offset.first + 1;
+    const int second = max - offset.second + 1;
+    if (need_comma) out << ", ";
+    out << "\"" << i << "\": [" << first << ", " << second << "]";
+    need_comma = true;
+  }
+  out << "}";
+  out << ", \"blockIdToInstructionRange\": {";
+  need_comma = false;
+  for (auto block : s.sequence->instruction_blocks()) {
+    if (need_comma) out << ", ";
+    out << "\"" << block->rpo_number() << "\": [" << block->code_start() << ", "
+        << block->code_end() << "]";
+    need_comma = true;
+  }
+  out << "}";
+  return out;
+}
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/pipeline.h b/deps/v8/src/compiler/pipeline.h
index 28c2046deb19b9..4a2717543a919d 100644
--- a/deps/v8/src/compiler/pipeline.h
+++ b/deps/v8/src/compiler/pipeline.h
@@ -11,6 +11,7 @@
 // Do not include anything from src/compiler here!
 #include "src/common/globals.h"
 #include "src/objects/code.h"
+#include "src/zone/zone-containers.h"
 
 namespace v8 {
 namespace internal {
@@ -24,7 +25,9 @@ struct WasmInliningPosition;
 
 namespace wasm {
 struct CompilationEnv;
+struct FunctionBody;
 struct WasmCompilationResult;
+class WasmFeatures;
 }  // namespace wasm
 
 namespace compiler {
@@ -39,6 +42,13 @@ class Schedule;
 class SourcePositionTable;
 struct WasmCompilationData;
 
+struct InstructionRangesAsJSON {
+  const InstructionSequence* sequence;
+  const ZoneVector<std::pair<int, int>>* instr_origins;
+};
+
+std::ostream& operator<<(std::ostream& out, const InstructionRangesAsJSON& s);
+
 class Pipeline : public AllStatic {
  public:
   // Returns a new compilation job for the given JavaScript function.
@@ -48,11 +58,14 @@ class Pipeline : public AllStatic {
                     BytecodeOffset osr_offset = BytecodeOffset::None());
 
   // Run the pipeline for the WebAssembly compilation info.
+  // Note: We pass a pointer to {detected} as it might get mutated while
+  // inlining.
   static void GenerateCodeForWasmFunction(
       OptimizedCompilationInfo* info, wasm::CompilationEnv* env,
       WasmCompilationData& compilation_data, MachineGraph* mcgraph,
       CallDescriptor* call_descriptor,
-      ZoneVector<WasmInliningPosition>* inlining_positions);
+      ZoneVector<WasmInliningPosition>* inlining_positions,
+      wasm::WasmFeatures* detected);
 
   // Run the pipeline on a machine graph and generate code.
   static wasm::WasmCompilationResult GenerateCodeForWasmNativeStub(
@@ -60,6 +73,12 @@ class Pipeline : public AllStatic {
       const char* debug_name, const AssemblerOptions& assembler_options,
       SourcePositionTable* source_positions = nullptr);
 
+  static bool GenerateWasmCodeFromTurboshaftGraph(
+      OptimizedCompilationInfo* info, wasm::CompilationEnv* env,
+      WasmCompilationData& compilation_data, MachineGraph* mcgraph,
+      const wasm::FunctionBody& body, wasm::WasmFeatures* detected,
+      CallDescriptor* call_descriptor);
+
   // Returns a new compilation job for a wasm heap stub.
   static std::unique_ptr<TurbofanCompilationJob> NewWasmHeapStubCompilationJob(
       Isolate* isolate, CallDescriptor* call_descriptor,
@@ -77,12 +96,9 @@ class Pipeline : public AllStatic {
   // The following methods are for testing purposes only. Avoid production use.
   // ---------------------------------------------------------------------------
 
-  // Run the pipeline on JavaScript bytecode and generate code.  If requested,
-  // hands out the heap broker on success, transferring its ownership to the
-  // caller.
+  // Run the pipeline on JavaScript bytecode and generate code.
   V8_EXPORT_PRIVATE static MaybeHandle<Code> GenerateCodeForTesting(
-      OptimizedCompilationInfo* info, Isolate* isolate,
-      std::unique_ptr<JSHeapBroker>* out_broker = nullptr);
+      OptimizedCompilationInfo* info, Isolate* isolate);
 
   // Run the pipeline on a machine graph and generate code. If {schedule} is
   // {nullptr}, then compute a new schedule for code generation.
diff --git a/deps/v8/src/compiler/processed-feedback.h b/deps/v8/src/compiler/processed-feedback.h
index af628897c6885f..2f30a93a4f2176 100644
--- a/deps/v8/src/compiler/processed-feedback.h
+++ b/deps/v8/src/compiler/processed-feedback.h
@@ -160,10 +160,10 @@ class ElementAccessFeedback : public ProcessedFeedback {
 
 class NamedAccessFeedback : public ProcessedFeedback {
  public:
-  NamedAccessFeedback(NameRef const& name, ZoneVector<MapRef> const& maps,
+  NamedAccessFeedback(NameRef name, ZoneVector<MapRef> const& maps,
                       FeedbackSlotKind slot_kind);
 
-  NameRef const& name() const { return name_; }
+  NameRef name() const { return name_; }
   ZoneVector<MapRef> const& maps() const { return maps_; }
 
  private:
@@ -176,7 +176,7 @@ class MegaDOMPropertyAccessFeedback : public ProcessedFeedback {
   MegaDOMPropertyAccessFeedback(FunctionTemplateInfoRef info_ref,
                                 FeedbackSlotKind slot_kind);
 
-  FunctionTemplateInfoRef const& info() const { return info_; }
+  FunctionTemplateInfoRef info() const { return info_; }
 
  private:
   FunctionTemplateInfoRef const info_;
diff --git a/deps/v8/src/compiler/property-access-builder.cc b/deps/v8/src/compiler/property-access-builder.cc
index 050a1926f72ec6..185b338628e28d 100644
--- a/deps/v8/src/compiler/property-access-builder.cc
+++ b/deps/v8/src/compiler/property-access-builder.cc
@@ -95,10 +95,10 @@ void PropertyAccessBuilder::BuildCheckMaps(Node* object, Effect* effect,
       }
     }
   }
-  ZoneHandleSet<Map> map_set;
+  ZoneRefSet<Map> map_set;
   CheckMapsFlags flags = CheckMapsFlag::kNone;
   for (MapRef map : maps) {
-    map_set.insert(map.object(), graph()->zone());
+    map_set.insert(map, graph()->zone());
     if (map.is_migration_target()) {
       flags |= CheckMapsFlag::kTryMigrateInstance;
     }
@@ -160,17 +160,17 @@ base::Optional<Node*> PropertyAccessBuilder::FoldLoadDictPrototypeConstant(
     Handle<Map> map_handle = map.object();
     // Non-JSReceivers that passed AccessInfoFactory::ComputePropertyAccessInfo
     // must have different lookup start map.
-    if (!map_handle->IsJSReceiverMap()) {
+    if (!IsJSReceiverMap(*map_handle)) {
       // Perform the implicit ToObject for primitives here.
       // Implemented according to ES6 section 7.3.2 GetV (V, P).
-      JSFunction constructor =
+      Tagged<JSFunction> constructor =
           Map::GetConstructorFunction(
               *map_handle, *broker()->target_native_context().object())
               .value();
       // {constructor.initial_map()} is loaded/stored with acquire-release
       // semantics for constructors.
-      map = MakeRefAssumeMemoryFence(broker(), constructor.initial_map());
-      DCHECK(map.object()->IsJSObjectMap());
+      map = MakeRefAssumeMemoryFence(broker(), constructor->initial_map());
+      DCHECK(IsJSObjectMap(*map.object()));
     }
     dependencies()->DependOnConstantInDictionaryPrototypeChain(
         map, access_info.name(), value.value(), PropertyKind::kData);
@@ -180,7 +180,7 @@ base::Optional<Node*> PropertyAccessBuilder::FoldLoadDictPrototypeConstant(
 }
 
 Node* PropertyAccessBuilder::TryFoldLoadConstantDataField(
-    NameRef const& name, PropertyAccessInfo const& access_info,
+    NameRef name, PropertyAccessInfo const& access_info,
     Node* lookup_start_object) {
   if (!access_info.IsFastDataConstant()) return nullptr;
 
@@ -214,8 +214,7 @@ Node* PropertyAccessBuilder::TryFoldLoadConstantDataField(
   return value.has_value() ? jsgraph()->Constant(*value, broker()) : nullptr;
 }
 
-Node* PropertyAccessBuilder::BuildLoadDataField(NameRef const& name,
-                                                Node* holder,
+Node* PropertyAccessBuilder::BuildLoadDataField(NameRef name, Node* holder,
                                                 FieldAccess& field_access,
                                                 bool is_inobject, Node** effect,
                                                 Node** control) {
@@ -232,7 +231,7 @@ Node* PropertyAccessBuilder::BuildLoadDataField(NameRef const& name,
       FieldAccess const storage_access = {kTaggedBase,
                                           field_access.offset,
                                           name.object(),
-                                          MaybeHandle<Map>(),
+                                          OptionalMapRef(),
                                           Type::Any(),
                                           MachineType::AnyTagged(),
                                           kPointerWriteBarrier,
@@ -260,7 +259,7 @@ Node* PropertyAccessBuilder::BuildLoadDataField(NameRef const& name,
       FieldAccess const storage_access = {kTaggedBase,
                                           field_access.offset,
                                           name.object(),
-                                          MaybeHandle<Map>(),
+                                          OptionalMapRef(),
                                           Type::OtherInternal(),
                                           MachineType::TaggedPointer(),
                                           kPointerWriteBarrier,
@@ -278,7 +277,7 @@ Node* PropertyAccessBuilder::BuildLoadDataField(NameRef const& name,
 }
 
 Node* PropertyAccessBuilder::BuildLoadDataField(
-    NameRef const& name, PropertyAccessInfo const& access_info,
+    NameRef name, PropertyAccessInfo const& access_info,
     Node* lookup_start_object, Node** effect, Node** control) {
   DCHECK(access_info.IsDataField() || access_info.IsFastDataConstant());
 
@@ -295,7 +294,7 @@ Node* PropertyAccessBuilder::BuildLoadDataField(
       kTaggedBase,
       access_info.field_index().offset(),
       name.object(),
-      MaybeHandle<Map>(),
+      OptionalMapRef(),
       access_info.field_type(),
       MachineType::TypeForRepresentation(field_representation),
       kFullWriteBarrier,
@@ -309,7 +308,7 @@ Node* PropertyAccessBuilder::BuildLoadDataField(
     if (field_map.has_value()) {
       if (field_map->is_stable()) {
         dependencies()->DependOnStableMap(field_map.value());
-        field_access.map = field_map->object();
+        field_access.map = field_map;
       }
     }
   }
diff --git a/deps/v8/src/compiler/property-access-builder.h b/deps/v8/src/compiler/property-access-builder.h
index 6ce25f175207ec..d6dc95f20ed097 100644
--- a/deps/v8/src/compiler/property-access-builder.h
+++ b/deps/v8/src/compiler/property-access-builder.h
@@ -46,8 +46,7 @@ class PropertyAccessBuilder {
 
   // Builds the actual load for data-field and data-constant-field
   // properties (without heap-object or map checks).
-  Node* BuildLoadDataField(NameRef const& name,
-                           PropertyAccessInfo const& access_info,
+  Node* BuildLoadDataField(NameRef name, PropertyAccessInfo const& access_info,
                            Node* lookup_start_object, Node** effect,
                            Node** control);
 
@@ -71,7 +70,7 @@ class PropertyAccessBuilder {
   CommonOperatorBuilder* common() const;
   SimplifiedOperatorBuilder* simplified() const;
 
-  Node* TryFoldLoadConstantDataField(NameRef const& name,
+  Node* TryFoldLoadConstantDataField(NameRef name,
                                      PropertyAccessInfo const& access_info,
                                      Node* lookup_start_object);
   // Returns a node with the holder for the property access described by
@@ -79,7 +78,7 @@ class PropertyAccessBuilder {
   Node* ResolveHolder(PropertyAccessInfo const& access_info,
                       Node* lookup_start_object);
 
-  Node* BuildLoadDataField(NameRef const& name, Node* holder,
+  Node* BuildLoadDataField(NameRef name, Node* holder,
                            FieldAccess& field_access, bool is_inobject,
                            Node** effect, Node** control);
 
diff --git a/deps/v8/src/compiler/raw-machine-assembler.cc b/deps/v8/src/compiler/raw-machine-assembler.cc
index 7302e6f2fac56d..a760519fc46573 100644
--- a/deps/v8/src/compiler/raw-machine-assembler.cc
+++ b/deps/v8/src/compiler/raw-machine-assembler.cc
@@ -77,12 +77,9 @@ Node* RawMachineAssembler::RelocatableIntPtrConstant(intptr_t value,
              : RelocatableInt32Constant(static_cast<int>(value), rmode);
 }
 
-Node* RawMachineAssembler::OptimizedAllocate(
-    Node* size, AllocationType allocation,
-    AllowLargeObjects allow_large_objects) {
-  return AddNode(
-      simplified()->AllocateRaw(Type::Any(), allocation, allow_large_objects),
-      size);
+Node* RawMachineAssembler::OptimizedAllocate(Node* size,
+                                             AllocationType allocation) {
+  return AddNode(simplified()->AllocateRaw(Type::Any(), allocation), size);
 }
 
 Schedule* RawMachineAssembler::ExportForTest() {
@@ -570,7 +567,7 @@ void RawMachineAssembler::Switch(Node* index, RawMachineLabel* default_label,
   DCHECK_NE(schedule()->end(), current_block_);
   size_t succ_count = case_count + 1;
   Node* switch_node = MakeNode(common()->Switch(succ_count), 1, &index);
-  BasicBlock** succ_blocks = zone()->NewArray<BasicBlock*>(succ_count);
+  BasicBlock** succ_blocks = zone()->AllocateArray<BasicBlock*>(succ_count);
   for (size_t i = 0; i < case_count; ++i) {
     int32_t case_value = case_values[i];
     BasicBlock* case_block = schedule()->NewBasicBlock();
@@ -687,7 +684,7 @@ void RawMachineAssembler::Unreachable() {
 
 void RawMachineAssembler::Comment(const std::string& msg) {
   size_t length = msg.length() + 1;
-  char* zone_buffer = zone()->NewArray<char>(length);
+  char* zone_buffer = zone()->AllocateArray<char>(length);
   MemCopy(zone_buffer, msg.c_str(), length);
   AddNode(machine()->Comment(zone_buffer));
 }
@@ -838,7 +835,7 @@ BasicBlock* RawMachineAssembler::CurrentBlock() {
 
 Node* RawMachineAssembler::Phi(MachineRepresentation rep, int input_count,
                                Node* const* inputs) {
-  Node** buffer = zone()->NewArray<Node*>(input_count + 1);
+  Node** buffer = zone()->AllocateArray<Node*>(input_count + 1);
   std::copy(inputs, inputs + input_count, buffer);
   buffer[input_count] = graph()->start();
   return AddNode(common()->Phi(rep, input_count), input_count + 1, buffer);
diff --git a/deps/v8/src/compiler/raw-machine-assembler.h b/deps/v8/src/compiler/raw-machine-assembler.h
index c62ff7c19358c3..445f5986a52555 100644
--- a/deps/v8/src/compiler/raw-machine-assembler.h
+++ b/deps/v8/src/compiler/raw-machine-assembler.h
@@ -21,6 +21,7 @@
 #include "src/compiler/write-barrier-kind.h"
 #include "src/execution/isolate.h"
 #include "src/heap/factory.h"
+#include "src/objects/string.h"
 
 namespace v8 {
 namespace internal {
@@ -98,6 +99,9 @@ class V8_EXPORT_PRIVATE RawMachineAssembler {
   Node* StackSlot(MachineRepresentation rep, int alignment = 0) {
     return AddNode(machine()->StackSlot(rep, alignment));
   }
+  Node* StackSlot(int size, int alignment) {
+    return AddNode(machine()->StackSlot(size, alignment));
+  }
   Node* Int64Constant(int64_t value) {
     return AddNode(common()->Int64Constant(value));
   }
@@ -189,11 +193,11 @@ class V8_EXPORT_PRIVATE RawMachineAssembler {
   void OptimizedStoreField(MachineRepresentation rep, Node* object, int offset,
                            Node* value, WriteBarrierKind write_barrier) {
     DCHECK(!IsMapOffsetConstantMinusTag(offset));
-    AddNode(simplified()->StoreField(FieldAccess(
-                BaseTaggedness::kTaggedBase, offset, MaybeHandle<Name>(),
-                MaybeHandle<Map>(), Type::Any(),
-                MachineType::TypeForRepresentation(rep), write_barrier,
-                "OptimizedStoreField")),
+    AddNode(simplified()->StoreField(
+                FieldAccess(BaseTaggedness::kTaggedBase, offset,
+                            MaybeHandle<Name>(), OptionalMapRef(), Type::Any(),
+                            MachineType::TypeForRepresentation(rep),
+                            write_barrier, "OptimizedStoreField")),
             object, value);
   }
   void OptimizedStoreMap(Node* object, Node* value,
@@ -203,8 +207,7 @@ class V8_EXPORT_PRIVATE RawMachineAssembler {
   }
   Node* Retain(Node* value) { return AddNode(common()->Retain(), value); }
 
-  Node* OptimizedAllocate(Node* size, AllocationType allocation,
-                          AllowLargeObjects allow_large_objects);
+  Node* OptimizedAllocate(Node* size, AllocationType allocation);
 
   // Unaligned memory operations
   Node* UnalignedLoad(MachineType type, Node* base) {
@@ -950,6 +953,7 @@ class V8_EXPORT_PRIVATE RawMachineAssembler {
   // Parameters.
   Node* TargetParameter();
   Node* Parameter(size_t index);
+  Node* LoadRootRegister() { return AddNode(machine()->LoadRootRegister()); }
 
   // Pointer utilities.
   Node* LoadFromPointer(void* address, MachineType type, int32_t offset = 0) {
diff --git a/deps/v8/src/compiler/representation-change.cc b/deps/v8/src/compiler/representation-change.cc
index affa92024b5cce..a4a274dfc57e6b 100644
--- a/deps/v8/src/compiler/representation-change.cc
+++ b/deps/v8/src/compiler/representation-change.cc
@@ -253,6 +253,7 @@ Node* RepresentationChanger::GetRepresentationFor(
     case MachineRepresentation::kCompressed:
     case MachineRepresentation::kCompressedPointer:
     case MachineRepresentation::kSandboxedPointer:
+    case MachineRepresentation::kIndirectPointer:
     case MachineRepresentation::kMapWord:
       UNREACHABLE();
   }
@@ -786,7 +787,7 @@ Node* RepresentationChanger::GetFloat64RepresentationFor(
       op = simplified()->ChangeTaggedToFloat64();
     } else if ((output_type.Is(Type::NumberOrOddball()) &&
                 use_info.truncation().TruncatesOddballAndBigIntToNumber()) ||
-               output_type.Is(Type::NumberOrHole())) {
+               output_type.Is(Type::NumberOrTheHole())) {
       // JavaScript 'null' is an Oddball that results in +0 when truncated to
       // Number. In a context like -0 == null, which must evaluate to false,
       // this truncation must not happen. For this reason we restrict this
@@ -947,7 +948,7 @@ Node* RepresentationChanger::GetWord32RepresentationFor(
     } else if (output_type.Is(Type::Unsigned32())) {
       op = simplified()->ChangeTaggedToUint32();
     } else if (use_info.truncation().IsUsedAsWord32()) {
-      if (output_type.Is(Type::NumberOrOddball())) {
+      if (output_type.Is(Type::NumberOrOddballOrTheHole())) {
         op = simplified()->TruncateTaggedToWord32();
       } else if (use_info.type_check() == TypeCheckKind::kNumber) {
         op = simplified()->CheckedTruncateTaggedToWord32(
diff --git a/deps/v8/src/compiler/revectorizer.cc b/deps/v8/src/compiler/revectorizer.cc
index 0a1c4dd4ffa230..203b9d87379619 100644
--- a/deps/v8/src/compiler/revectorizer.cc
+++ b/deps/v8/src/compiler/revectorizer.cc
@@ -8,7 +8,11 @@
 #include "src/base/logging.h"
 #include "src/compiler/all-nodes.h"
 #include "src/compiler/machine-operator.h"
+#include "src/compiler/node-observer.h"
+#include "src/compiler/opcodes.h"
 #include "src/compiler/verifier.h"
+#include "src/execution/isolate-inl.h"
+#include "src/wasm/simd-shuffle.h"
 
 namespace v8 {
 namespace internal {
@@ -24,6 +28,128 @@ namespace compiler {
 
 namespace {
 
+#define SIMPLE_SIMD_OP(V)                   \
+  V(F64x2Add, F64x4Add)                     \
+  V(F32x4Add, F32x8Add)                     \
+  V(I64x2Add, I64x4Add)                     \
+  V(I32x4Add, I32x8Add)                     \
+  V(I16x8Add, I16x16Add)                    \
+  V(I8x16Add, I8x32Add)                     \
+  V(F64x2Sub, F64x4Sub)                     \
+  V(F32x4Sub, F32x8Sub)                     \
+  V(I64x2Sub, I64x4Sub)                     \
+  V(I32x4Sub, I32x8Sub)                     \
+  V(I16x8Sub, I16x16Sub)                    \
+  V(I8x16Sub, I8x32Sub)                     \
+  V(F64x2Mul, F64x4Mul)                     \
+  V(F32x4Mul, F32x8Mul)                     \
+  V(I64x2Mul, I64x4Mul)                     \
+  V(I32x4Mul, I32x8Mul)                     \
+  V(I16x8Mul, I16x16Mul)                    \
+  V(F64x2Div, F64x4Div)                     \
+  V(F32x4Div, F32x8Div)                     \
+  V(I16x8AddSatS, I16x16AddSatS)            \
+  V(I16x8SubSatS, I16x16SubSatS)            \
+  V(I16x8AddSatU, I16x16AddSatU)            \
+  V(I16x8SubSatU, I16x16SubSatU)            \
+  V(I8x16AddSatS, I8x32AddSatS)             \
+  V(I8x16SubSatS, I8x32SubSatS)             \
+  V(I8x16AddSatU, I8x32AddSatU)             \
+  V(I8x16SubSatU, I8x32SubSatU)             \
+  V(F64x2Eq, F64x4Eq)                       \
+  V(F32x4Eq, F32x8Eq)                       \
+  V(I64x2Eq, I64x4Eq)                       \
+  V(I32x4Eq, I32x8Eq)                       \
+  V(I16x8Eq, I16x16Eq)                      \
+  V(I8x16Eq, I8x32Eq)                       \
+  V(F64x2Ne, F64x4Ne)                       \
+  V(F32x4Ne, F32x8Ne)                       \
+  V(I64x2GtS, I64x4GtS)                     \
+  V(I32x4GtS, I32x8GtS)                     \
+  V(I16x8GtS, I16x16GtS)                    \
+  V(I8x16GtS, I8x32GtS)                     \
+  V(F64x2Lt, F64x4Lt)                       \
+  V(F32x4Lt, F32x8Lt)                       \
+  V(F64x2Le, F64x4Le)                       \
+  V(F32x4Le, F32x8Le)                       \
+  V(I32x4MinS, I32x8MinS)                   \
+  V(I16x8MinS, I16x16MinS)                  \
+  V(I8x16MinS, I8x32MinS)                   \
+  V(I32x4MinU, I32x8MinU)                   \
+  V(I16x8MinU, I16x16MinU)                  \
+  V(I8x16MinU, I8x32MinU)                   \
+  V(I32x4MaxS, I32x8MaxS)                   \
+  V(I16x8MaxS, I16x16MaxS)                  \
+  V(I8x16MaxS, I8x32MaxS)                   \
+  V(I32x4MaxU, I32x8MaxU)                   \
+  V(I16x8MaxU, I16x16MaxU)                  \
+  V(I8x16MaxU, I8x32MaxU)                   \
+  V(F32x4Abs, F32x8Abs)                     \
+  V(I32x4Abs, I32x8Abs)                     \
+  V(I16x8Abs, I16x16Abs)                    \
+  V(I8x16Abs, I8x32Abs)                     \
+  V(F32x4Neg, F32x8Neg)                     \
+  V(I32x4Neg, I32x8Neg)                     \
+  V(I16x8Neg, I16x16Neg)                    \
+  V(I8x16Neg, I8x32Neg)                     \
+  V(F64x2Sqrt, F64x4Sqrt)                   \
+  V(F32x4Sqrt, F32x8Sqrt)                   \
+  V(F64x2Min, F64x4Min)                     \
+  V(F32x4Min, F32x8Min)                     \
+  V(F64x2Max, F64x4Max)                     \
+  V(F32x4Max, F32x8Max)                     \
+  V(I64x2Ne, I64x4Ne)                       \
+  V(I32x4Ne, I32x8Ne)                       \
+  V(I16x8Ne, I16x16Ne)                      \
+  V(I8x16Ne, I8x32Ne)                       \
+  V(I32x4GtU, I32x8GtU)                     \
+  V(I16x8GtU, I16x16GtU)                    \
+  V(I8x16GtU, I8x32GtU)                     \
+  V(I64x2GeS, I64x4GeS)                     \
+  V(I32x4GeS, I32x8GeS)                     \
+  V(I16x8GeS, I16x16GeS)                    \
+  V(I8x16GeS, I8x32GeS)                     \
+  V(I32x4GeU, I32x8GeU)                     \
+  V(I16x8GeU, I16x16GeU)                    \
+  V(I8x16GeU, I8x32GeU)                     \
+  V(F32x4Pmin, F32x8Pmin)                   \
+  V(F32x4Pmax, F32x8Pmax)                   \
+  V(F64x2Pmin, F64x4Pmin)                   \
+  V(F64x2Pmax, F64x4Pmax)                   \
+  V(F32x4SConvertI32x4, F32x8SConvertI32x8) \
+  V(F32x4UConvertI32x4, F32x8UConvertI32x8) \
+  V(I32x4UConvertF32x4, I32x8UConvertF32x8) \
+  V(S128And, S256And)                       \
+  V(S128Or, S256Or)                         \
+  V(S128Xor, S256Xor)                       \
+  V(S128Not, S256Not)                       \
+  V(S128Select, S256Select)                 \
+  V(S128AndNot, S256AndNot)
+
+#define SIMD_SHIFT_OP(V)   \
+  V(I64x2Shl, I64x4Shl)    \
+  V(I32x4Shl, I32x8Shl)    \
+  V(I16x8Shl, I16x16Shl)   \
+  V(I32x4ShrS, I32x8ShrS)  \
+  V(I16x8ShrS, I16x16ShrS) \
+  V(I64x2ShrU, I64x4ShrU)  \
+  V(I32x4ShrU, I32x8ShrU)  \
+  V(I16x8ShrU, I16x16ShrU)
+
+#define SIMD_SIGN_EXTENSION_CONVERT_OP(V)                               \
+  V(I64x2SConvertI32x4Low, I64x2SConvertI32x4High, I64x4SConvertI32x4)  \
+  V(I64x2UConvertI32x4Low, I64x2UConvertI32x4High, I64x4UConvertI32x4)  \
+  V(I32x4SConvertI16x8Low, I32x4SConvertI16x8High, I32x8SConvertI16x8)  \
+  V(I32x4UConvertI16x8Low, I32x4UConvertI16x8High, I32x8UConvertI16x8)  \
+  V(I16x8SConvertI8x16Low, I16x8SConvertI8x16High, I16x16SConvertI8x16) \
+  V(I16x8UConvertI8x16Low, I16x8UConvertI8x16High, I16x16UConvertI8x16)
+
+#define SIMD_SPLAT_OP(V)     \
+  V(I8x16Splat, I8x32Splat)  \
+  V(I16x8Splat, I16x16Splat) \
+  V(I32x4Splat, I32x8Splat)  \
+  V(I64x2Splat, I64x4Splat)
+
 // Currently, only Load/ProtectedLoad/LoadTransfrom are supported.
 // TODO(jiepan): add support for UnalignedLoad, LoadLane, LoadTrapOnNull
 bool IsSupportedLoad(const Node* node) {
@@ -53,8 +179,7 @@ int64_t GetConstantValue(const Node* node) {
 }
 
 int64_t GetMemoryOffsetValue(const Node* node) {
-  DCHECK(node->opcode() == IrOpcode::kProtectedLoad ||
-         node->opcode() == IrOpcode::kStore ||
+  DCHECK(IsSupportedLoad(node) || node->opcode() == IrOpcode::kStore ||
          node->opcode() == IrOpcode::kProtectedStore);
 
   Node* offset = node->InputAt(0);
@@ -93,8 +218,17 @@ bool IsContinuousAccess(const ZoneVector<Node*>& node_group) {
   for (size_t i = 1; i < node_group.size(); ++i) {
     int64_t current_offset = GetMemoryOffsetValue(node_group[i]);
     int64_t diff = current_offset - previous_offset;
-    if (diff != kSimd128Size) {
-      TRACE("Non-continuous store!");
+    if (diff == 8 && node_group[0]->opcode() == IrOpcode::kLoadTransform) {
+      LoadTransformParameters params =
+          LoadTransformParametersOf(node_group[0]->op());
+      if (params.transformation < LoadTransformation::kFirst128Extend ||
+          params.transformation > LoadTransformation::kLast128Extend) {
+        TRACE("Non-continuous access!\n");
+        return false;
+      }
+      TRACE("Continuous access with load extend offset!\n");
+    } else if (diff != kSimd128Size) {
+      TRACE("Non-continuous access!\n");
       return false;
     }
     previous_offset = current_offset;
@@ -139,6 +273,17 @@ bool IsSplat(const T& node_group) {
 
 // Returns true if all of the nodes in node_group have the same type.
 bool AllSameOperator(const ZoneVector<Node*>& node_group) {
+  // Two S128Const operators are equal only if they have same immediates,
+  // the revec algorithm can pack S128Const nodes with different immediates,
+  // so if all the nodes have S128Const opcode, ignore the immediates comparison
+  // and just return true.
+  bool all_consts = std::all_of(
+      node_group.cbegin(), node_group.cend(),
+      [](Node* node) { return node->opcode() == IrOpcode::kS128Const; });
+  if (all_consts) {
+    return true;
+  }
+
   auto op = node_group[0]->op();
   for (ZoneVector<Node*>::size_type i = 1; i < node_group.size(); i++) {
     if (node_group[i]->op() != op) {
@@ -148,6 +293,51 @@ bool AllSameOperator(const ZoneVector<Node*>& node_group) {
   return true;
 }
 
+bool ShiftBySameScalar(const ZoneVector<Node*>& node_group) {
+  auto node0 = node_group[0];
+  for (ZoneVector<Node*>::size_type i = 1; i < node_group.size(); i++) {
+    DCHECK_EQ(node_group[i]->op(), node0->op());
+    DCHECK_EQ(node0->InputCount(), 2);
+    if (node_group[i]->InputAt(1) != node0->InputAt(1)) {
+      return false;
+    }
+  }
+  return true;
+}
+
+bool IsSignExtensionOperation(IrOpcode::Value op) {
+#define CASE(op_low, op_high, not_used) \
+  case IrOpcode::k##op_low:             \
+  case IrOpcode::k##op_high:
+  switch (op) {
+    SIMD_SIGN_EXTENSION_CONVERT_OP(CASE)
+    return true;
+    default:
+      return false;
+  }
+#undef CASE
+  UNREACHABLE();
+}
+
+bool MaybePackSignExtensionOp(const ZoneVector<Node*>& node_group) {
+#define CHECK_SIGN_EXTENSION_CASE(op_low, op_high, not_used)      \
+  case IrOpcode::k##op_low: {                                     \
+    if (node_group[1]->opcode() == IrOpcode::k##op_high &&        \
+        node_group[0]->InputAt(0) == node_group[1]->InputAt(0)) { \
+      return true;                                                \
+    }                                                             \
+    return false;                                                 \
+  }
+  switch (node_group[0]->opcode()) {
+    SIMD_SIGN_EXTENSION_CONVERT_OP(CHECK_SIGN_EXTENSION_CASE)
+    default: {
+      return false;
+    }
+  }
+#undef CHECK_SIGN_EXTENSION_CASE
+  UNREACHABLE();
+}
+
 class EffectChainIterator {
  public:
   explicit EffectChainIterator(Node* node) : node_(node) {}
@@ -220,17 +410,19 @@ void PackNode::Print() const {
 
 bool SLPTree::CanBePacked(const ZoneVector<Node*>& node_group) {
   DCHECK_EQ(node_group.size(), 2);
-  if (!SameBasicBlock(node_group[0], node_group[1])) {
-    TRACE("%s(#%d, #%d) not in same BB!\n", node_group[0]->op()->mnemonic(),
-          node_group[0]->id(), node_group[1]->id());
-    return false;
-  }
-  if (!AllSameOperator(node_group)) {
-    TRACE("%s(#%d, #%d) have different operator!\n",
-          node_group[0]->op()->mnemonic(), node_group[0]->id(),
-          node_group[1]->id());
+  // Only Support simd128 operators or common operators with simd128
+  // MachineRepresentation. The MachineRepresentation of root had been checked,
+  // and the leaf node will be checked later. here we omit the check of
+  // MachineRepresentation, only check the opcode itself.
+  IrOpcode::Value op = node_group[0]->opcode();
+  if (!NodeProperties::IsSimd128Operation(node_group[0]) &&
+      (op != IrOpcode::kStore) && (op != IrOpcode::kProtectedStore) &&
+      (op != IrOpcode::kLoad) && (op != IrOpcode::kProtectedLoad) &&
+      (op != IrOpcode::kPhi) && (op != IrOpcode::kLoopExitValue) &&
+      (op != IrOpcode::kExtractF128)) {
     return false;
   }
+
   // TODO(jiepan): add support for Constant
   if (AllConstant(node_group)) {
     TRACE("%s(#%d, #%d) are constantant, not supported yet!\n",
@@ -238,20 +430,24 @@ bool SLPTree::CanBePacked(const ZoneVector<Node*>& node_group) {
           node_group[1]->id());
     return false;
   }
-
-  // Only Support simd128 operators or common operators with simd128
-  // MachineRepresentation. The MachineRepresentation of root had been checked,
-  // and the leaf node will be checked later. here we omit the check of
-  // MachineRepresentation, only check the opcode itself.
-  IrOpcode::Value op = node_group[0]->opcode();
-  if (NodeProperties::IsSimd128Operation(node_group[0]) ||
-      (op == IrOpcode::kStore) || (op == IrOpcode::kProtectedStore) ||
-      (op == IrOpcode::kLoad) || (op == IrOpcode::kProtectedLoad) ||
-      (op == IrOpcode::kPhi) || (op == IrOpcode::kLoopExitValue) ||
-      (op == IrOpcode::kExtractF128)) {
-    return true;
+  if (IsSignExtensionOperation(op)) {
+    if (MaybePackSignExtensionOp(node_group)) {
+      return true;
+    } else {
+      TRACE("%s(#%d, #%d) are not (low, high) sign extension pair\n",
+            node_group[0]->op()->mnemonic(), node_group[0]->id(),
+            node_group[1]->id());
+      return false;
+    }
   }
-  return false;
+  if (!AllSameOperator(node_group)) {
+    TRACE(
+        "%s(#%d, #%d) have different op, and are not sign extension operator\n",
+        node_group[0]->op()->mnemonic(), node_group[0]->id(),
+        node_group[1]->id());
+    return false;
+  }
+  return true;
 }
 
 PackNode* SLPTree::NewPackNode(const ZoneVector<Node*>& node_group) {
@@ -451,7 +647,8 @@ PackNode* SLPTree::BuildTreeRec(const ZoneVector<Node*>& node_group,
     return nullptr;
   }
 
-  DCHECK(AllConstant(node_group) || AllSameOperator(node_group));
+  DCHECK(AllConstant(node_group) || AllSameOperator(node_group) ||
+         MaybePackSignExtensionOp(node_group));
 
   // Check if this is a duplicate of another entry.
   for (Node* node : node_group) {
@@ -470,6 +667,16 @@ PackNode* SLPTree::BuildTreeRec(const ZoneVector<Node*>& node_group,
     }
   }
 
+  if (node0->opcode() == IrOpcode::kS128Zero) {
+    PackNode* p = NewPackNode(node_group);
+    PopStack();
+    return p;
+  }
+  if (node0->opcode() == IrOpcode::kS128Const) {
+    PackNode* p = NewPackNode(node_group);
+    PopStack();
+    return p;
+  }
   if (node0->opcode() == IrOpcode::kExtractF128) {
     Node* source = node0->InputAt(0);
     TRACE("Extract leaf node from #%d,%s!\n", source->id(),
@@ -489,19 +696,28 @@ PackNode* SLPTree::BuildTreeRec(const ZoneVector<Node*>& node_group,
     return nullptr;
   }
 
-  if (node0->opcode() == IrOpcode::kProtectedLoad ||
-      node0->opcode() == IrOpcode::kLoadTransform) {
+  if (IsSupportedLoad(node0)) {
     TRACE("Load leaf node\n");
     if (!AllSameAddress(node_group)) {
       TRACE("Failed due to different load addr!\n");
+      PopStack();
       return nullptr;
     }
-    if (node0->opcode() == IrOpcode::kProtectedLoad) {
-      MachineRepresentation rep =
-          LoadRepresentationOf(node0->op()).representation();
-      if (rep != MachineRepresentation::kSimd128) {
+
+    if (!IsSplat(node_group)) {
+      if (node0->opcode() == IrOpcode::kProtectedLoad &&
+          LoadRepresentationOf(node0->op()).representation() !=
+              MachineRepresentation::kSimd128) {
+        PopStack();
+        return nullptr;
+      }
+
+      if (!IsSideEffectFreeLoad(node_group)) {
+        TRACE("Failed due to dependency check\n");
+        PopStack();
         return nullptr;
       }
+
       // Sort loads by offset
       ZoneVector<Node*> sorted_node_group(node_group.size(), zone_);
       std::partial_sort_copy(node_group.begin(), node_group.end(),
@@ -509,35 +725,34 @@ PackNode* SLPTree::BuildTreeRec(const ZoneVector<Node*>& node_group,
                              MemoryOffsetComparer());
       if (!IsContinuousAccess(sorted_node_group)) {
         TRACE("Failed due to non-continuous load!\n");
+        PopStack();
         return nullptr;
       }
-    }
-
-    if (node0->opcode() == IrOpcode::kLoadTransform) {
-      if (!IsSplat(node_group)) {
-        TRACE("LoadTransform Failed due to IsSplat!\n");
-        return nullptr;
-      }
+    } else if (node0->opcode() == IrOpcode::kLoadTransform) {
       LoadTransformParameters params = LoadTransformParametersOf(node0->op());
-      // TODO(jiepan): Support more LoadTransformation types
-      if (params.transformation != LoadTransformation::kS128Load32Splat &&
-          params.transformation != LoadTransformation::kS128Load64Splat) {
+      if (params.transformation > LoadTransformation::kLast128Splat) {
         TRACE("LoadTransform failed due to unsupported type #%d!\n",
               node0->id());
+        PopStack();
         return nullptr;
       }
-    }
-
-    if (!IsSideEffectFreeLoad(node_group)) {
-      TRACE("Failed due to dependency check\n");
+      DCHECK_GE(params.transformation, LoadTransformation::kFirst128Splat);
+    } else {
+      TRACE("Failed due to unsupported splat!\n");
+      PopStack();
       return nullptr;
     }
+
     PackNode* p = NewPackNode(node_group);
     PopStack();
     return p;
   }
 
   int value_in_count = node0->op()->ValueInputCount();
+
+#define CASE(op128, op256) case IrOpcode::k##op128:
+#define SIGN_EXTENSION_CASE(op_low, not_used1, not_used2) \
+  case IrOpcode::k##op_low:
   switch (node0->opcode()) {
     case IrOpcode::kPhi: {
       TRACE("Added a vector of PHI nodes.\n");
@@ -560,14 +775,60 @@ PackNode* SLPTree::BuildTreeRec(const ZoneVector<Node*>& node_group,
       PopStack();
       return pnode;
     }
-    case IrOpcode::kF32x4Add:
-    case IrOpcode::kF32x4Mul: {
-      TRACE("Added a vector of un/bin/ter op.\n");
-      PackNode* pnode =
-          NewPackNodeAndRecurs(node_group, 0, value_in_count, recursion_depth);
+    case IrOpcode::kI8x16Shuffle: {
+      // Try match 32x8Splat or 64x4Splat.
+      if (IsSplat(node_group)) {
+        const uint8_t* shuffle = S128ImmediateParameterOf(node0->op()).data();
+        int index;
+        if ((wasm::SimdShuffle::TryMatchSplat<4>(shuffle, &index) &&
+             node0->InputAt(index >> 2)->opcode() ==
+                 IrOpcode::kProtectedLoad) ||
+            (wasm::SimdShuffle::TryMatchSplat<2>(shuffle, &index) &&
+             node0->InputAt(index >> 1)->opcode() ==
+                 IrOpcode::kProtectedLoad)) {
+          PopStack();
+          return NewPackNode(node_group);
+        }
+      }
+      TRACE("Failed due to Unsupported I8x16Shuffle.\n");
+      return nullptr;
+    }
+      // clang-format off
+    SIMPLE_SIMD_OP(CASE) {
+      TRACE("Added a vector of %s.\n", node0->op()->mnemonic());
+      PackNode* pnode = NewPackNodeAndRecurs(node_group, 0, value_in_count,
+                                              recursion_depth);
+      PopStack();
+      return pnode;
+    }
+    SIMD_SHIFT_OP(CASE) {
+      if (ShiftBySameScalar(node_group)) {
+        TRACE("Added a vector of %s.\n", node0->op()->mnemonic());
+        PackNode* pnode =
+            NewPackNodeAndRecurs(node_group, 0, 1, recursion_depth);
+        PopStack();
+        return pnode;
+      }
+      TRACE("Failed due to shift with different scalar!\n");
+      return nullptr;
+    }
+    SIMD_SIGN_EXTENSION_CONVERT_OP(SIGN_EXTENSION_CASE) {
+      TRACE("add a vector of sign extension op and stop building tree\n");
+      PackNode* pnode = NewPackNode(node_group);
+      PopStack();
+      return pnode;
+    }
+    SIMD_SPLAT_OP(CASE) {
+      TRACE("Added a vector of %s.\n", node0->op()->mnemonic());
+      if (node0->InputAt(0) != node1->InputAt(0)) {
+        TRACE("Failed due to different splat input");
+        return nullptr;
+      }
+      PackNode* pnode = NewPackNode(node_group);
       PopStack();
       return pnode;
     }
+    // clang-format on
 
     // TODO(jiepan): UnalignedStore, StoreTrapOnNull.
     case IrOpcode::kStore:
@@ -585,6 +846,8 @@ PackNode* SLPTree::BuildTreeRec(const ZoneVector<Node*>& node_group,
       TRACE("Default branch #%d:%s\n", node0->id(), node0->op()->mnemonic());
       break;
   }
+#undef CASE
+#undef SIGN_EXTENSION_CASE
   return nullptr;
 }
 
@@ -618,6 +881,19 @@ void SLPTree::ForEach(FunctionType callback) {
 }
 
 //////////////////////////////////////////////////////
+
+Revectorizer::Revectorizer(Zone* zone, Graph* graph, MachineGraph* mcgraph)
+    : zone_(zone),
+      graph_(graph),
+      mcgraph_(mcgraph),
+      group_of_stores_(zone),
+      support_simd256_(false) {
+  DetectCPUFeatures();
+  slp_tree_ = zone_->New<SLPTree>(zone, graph);
+  Isolate* isolate = Isolate::TryGetCurrent();
+  node_observer_for_test_ = isolate ? isolate->node_observer() : nullptr;
+}
+
 bool Revectorizer::DecideVectorize() {
   TRACE("Enter %s\n", __func__);
 
@@ -698,6 +974,7 @@ Node* Revectorizer::VectorizeTree(PackNode* pnode) {
   TRACE("Enter %s with PackNode\n", __func__);
 
   Node* node0 = pnode->Nodes()[0];
+  Node* node1 = pnode->Nodes()[1];
   if (pnode->RevectorizedNode()) {
     TRACE("Diamond merged for #%d:%s\n", node0->id(), node0->op()->mnemonic());
     return pnode->RevectorizedNode();
@@ -709,6 +986,7 @@ Node* Revectorizer::VectorizeTree(PackNode* pnode) {
 
   IrOpcode::Value op = node0->opcode();
   const Operator* new_op = nullptr;
+  Node* source = nullptr;
   Node* dead = mcgraph()->Dead();
   base::SmallVector<Node*, 2> inputs(input_count);
   for (int i = 0; i < input_count; i++) inputs[i] = dead;
@@ -730,12 +1008,98 @@ Node* Revectorizer::VectorizeTree(PackNode* pnode) {
       inputs[input_count - 1] = NodeProperties::GetControlInput(node0);
       break;
     }
-    case IrOpcode::kF32x4Add:
-      new_op = mcgraph_->machine()->F32x8Add();
+
+#define SIMPLE_CASE(from, to)           \
+  case IrOpcode::k##from:               \
+    new_op = mcgraph_->machine()->to(); \
+    break;
+      SIMPLE_SIMD_OP(SIMPLE_CASE)
+#undef SIMPLE_CASE
+#undef SIMPLE_SIMD_OP
+
+#define SHIFT_CASE(from, to)                   \
+  case IrOpcode::k##from: {                    \
+    DCHECK(ShiftBySameScalar(pnode->Nodes())); \
+    new_op = mcgraph_->machine()->to();        \
+    inputs[1] = node0->InputAt(1);             \
+    break;                                     \
+  }
+      SIMD_SHIFT_OP(SHIFT_CASE)
+#undef SHIFT_CASE
+#undef SIMD_SHIFT_OP
+
+#define SIGN_EXTENSION_CONVERT_CASE(from, not_used, to)          \
+  case IrOpcode::k##from: {                                      \
+    DCHECK_EQ(node0->InputAt(0), pnode->Nodes()[1]->InputAt(0)); \
+    new_op = mcgraph_->machine()->to();                          \
+    inputs[0] = node0->InputAt(0);                               \
+    break;                                                       \
+  }
+      SIMD_SIGN_EXTENSION_CONVERT_OP(SIGN_EXTENSION_CONVERT_CASE)
+#undef SIGN_EXTENSION_CONVERT_CASE
+#undef SIMD_SIGN_EXTENSION_CONVERT_OP
+
+#define SPLAT_CASE(from, to)            \
+  case IrOpcode::k##from:               \
+    new_op = mcgraph_->machine()->to(); \
+    inputs[0] = node0->InputAt(0);      \
+    break;
+      SIMD_SPLAT_OP(SPLAT_CASE)
+#undef SPLAT_CASE
+#undef SIMD_SPLAT_OP
+
+    case IrOpcode::kI8x16Shuffle: {
+      DCHECK(IsSplat(pnode->Nodes()));
+      const uint8_t* shuffle = S128ImmediateParameterOf(node0->op()).data();
+      int index, offset;
+
+      // Match Splat and Revectorize to LoadSplat as AVX-256 does not support
+      // shuffling across 128-bit lane.
+      if (wasm::SimdShuffle::TryMatchSplat<4>(shuffle, &index)) {
+        new_op = mcgraph_->machine()->LoadTransform(
+            MemoryAccessKind::kProtected, LoadTransformation::kS256Load32Splat);
+        offset = index * 4;
+      } else if (wasm::SimdShuffle::TryMatchSplat<2>(shuffle, &index)) {
+        new_op = mcgraph_->machine()->LoadTransform(
+            MemoryAccessKind::kProtected, LoadTransformation::kS256Load64Splat);
+        offset = index * 8;
+      } else {
+        UNREACHABLE();
+      }
+
+      source = node0->InputAt(offset >> 4);
+      DCHECK_EQ(source->opcode(), IrOpcode::kProtectedLoad);
+      inputs.resize_no_init(4);
+      // Update LoadSplat offset.
+      if (index) {
+        inputs[0] = graph()->NewNode(mcgraph_->machine()->Int64Add(),
+                                     source->InputAt(0),
+                                     mcgraph_->Int64Constant(offset));
+      } else {
+        inputs[0] = source->InputAt(0);
+      }
+      // Keep source index, effect and control inputs.
+      inputs[1] = source->InputAt(1);
+      inputs[2] = source->InputAt(2);
+      inputs[3] = source->InputAt(3);
+      input_count = 4;
       break;
-    case IrOpcode::kF32x4Mul:
-      new_op = mcgraph_->machine()->F32x8Mul();
+    }
+    case IrOpcode::kS128Zero: {
+      new_op = mcgraph_->machine()->S256Zero();
       break;
+    }
+    case IrOpcode::kS128Const: {
+      uint8_t value[32];
+      const uint8_t* value0 = S128ImmediateParameterOf(node0->op()).data();
+      const uint8_t* value1 = S128ImmediateParameterOf(node1->op()).data();
+      for (int i = 0; i < kSimd128Size; ++i) {
+        value[i] = value0[i];
+        value[i + 16] = value1[i];
+      }
+      new_op = mcgraph_->machine()->S256Const(value);
+      break;
+    }
     case IrOpcode::kProtectedLoad: {
       DCHECK_EQ(LoadRepresentationOf(node0->op()).representation(),
                 MachineRepresentation::kSimd128);
@@ -770,18 +1134,48 @@ Node* Revectorizer::VectorizeTree(PackNode* pnode) {
     }
     case IrOpcode::kLoadTransform: {
       LoadTransformParameters params = LoadTransformParametersOf(node0->op());
-      if (params.transformation == LoadTransformation::kS128Load32Splat) {
-        new_op = mcgraph_->machine()->LoadTransform(
-            params.kind, LoadTransformation::kS256Load32Splat);
-        SetMemoryOpInputs(inputs, pnode, 2);
-      } else if (params.transformation ==
-                 LoadTransformation::kS128Load64Splat) {
-        new_op = mcgraph_->machine()->LoadTransform(
-            params.kind, LoadTransformation::kS256Load64Splat);
-        SetMemoryOpInputs(inputs, pnode, 2);
-      } else {
-        TRACE("Unsupported #%d:%s!\n", node0->id(), node0->op()->mnemonic());
+      LoadTransformation new_transformation;
+
+      // clang-format off
+      switch (params.transformation) {
+        case LoadTransformation::kS128Load8Splat:
+          new_transformation = LoadTransformation::kS256Load8Splat;
+          break;
+        case LoadTransformation::kS128Load16Splat:
+          new_transformation = LoadTransformation::kS256Load16Splat;
+          break;
+        case LoadTransformation::kS128Load32Splat:
+          new_transformation = LoadTransformation::kS256Load32Splat;
+          break;
+        case LoadTransformation::kS128Load64Splat:
+          new_transformation = LoadTransformation::kS256Load64Splat;
+          break;
+        case LoadTransformation::kS128Load8x8S:
+          new_transformation = LoadTransformation::kS256Load8x16S;
+          break;
+        case LoadTransformation::kS128Load8x8U:
+          new_transformation = LoadTransformation::kS256Load8x16U;
+          break;
+        case LoadTransformation::kS128Load16x4S:
+          new_transformation = LoadTransformation::kS256Load16x8S;
+          break;
+        case LoadTransformation::kS128Load16x4U:
+          new_transformation = LoadTransformation::kS256Load16x8U;
+          break;
+        case LoadTransformation::kS128Load32x2S:
+          new_transformation = LoadTransformation::kS256Load32x4S;
+          break;
+        case LoadTransformation::kS128Load32x2U:
+          new_transformation = LoadTransformation::kS256Load32x4U;
+          break;
+        default:
+          UNREACHABLE();
       }
+      // clang-format on
+
+      new_op =
+          mcgraph_->machine()->LoadTransform(params.kind, new_transformation);
+      SetMemoryOpInputs(inputs, pnode, 2);
       break;
     }
     case IrOpcode::kExtractF128: {
@@ -803,7 +1197,6 @@ Node* Revectorizer::VectorizeTree(PackNode* pnode) {
         new_node->ReplaceInput(i, VectorizeTree(pnode->GetOperand(i)));
       }
     }
-
     // Extract Uses
     const ZoneVector<Node*>& nodes = pnode->Nodes();
     for (size_t i = 0; i < nodes.size(); i++) {
@@ -822,7 +1215,8 @@ Node* Revectorizer::VectorizeTree(PackNode* pnode) {
               TRACE("Create ExtractF128(%lu) node from #%d\n", i,
                     new_node->id());
               input_128 = graph()->NewNode(
-                  mcgraph()->machine()->ExtractF128(int32_t(i)), new_node);
+                  mcgraph()->machine()->ExtractF128(static_cast<int32_t>(i)),
+                  new_node);
             }
             edge.UpdateTo(input_128);
           } else if (NodeProperties::IsEffectEdge(edge)) {
@@ -836,6 +1230,23 @@ Node* Revectorizer::VectorizeTree(PackNode* pnode) {
       }
       if (nodes[i]->uses().empty()) nodes[i]->Kill();
     }
+
+    // Update effect use of NewNode from the dependent source.
+    if (op == IrOpcode::kI8x16Shuffle) {
+      DCHECK(IsSplat(nodes) && source);
+      NodeProperties::ReplaceEffectInput(source, new_node, 0);
+      TRACE("Replace Effect Edge from %d:%s, to %d:%s\n", source->id(),
+            source->op()->mnemonic(), new_node->id(),
+            new_node->op()->mnemonic());
+      // Remove unused value use, so that we can safely elimite the node later.
+      NodeProperties::ReplaceValueInput(node0, dead, 0);
+      NodeProperties::ReplaceValueInput(node0, dead, 1);
+      TRACE("Remove Value Input of %d:%s\n", node0->id(),
+            node0->op()->mnemonic());
+
+      // We will try cleanup source nodes later
+      sources_.insert(source);
+    }
   }
 
   return pnode->RevectorizedNode();
@@ -843,7 +1254,7 @@ Node* Revectorizer::VectorizeTree(PackNode* pnode) {
 
 void Revectorizer::DetectCPUFeatures() {
   base::CPU cpu;
-  if (cpu.has_avx2()) {
+  if (v8_flags.enable_avx && v8_flags.enable_avx2 && cpu.has_avx2()) {
     support_simd256_ = true;
   }
 }
@@ -868,6 +1279,39 @@ bool Revectorizer::TryRevectorize(const char* function) {
   return success;
 }
 
+void Revectorizer::UpdateSources() {
+  for (auto* src : sources_) {
+    std::vector<Node*> effect_uses;
+    bool hasExternalValueUse = false;
+    for (auto edge : src->use_edges()) {
+      Node* use = edge.from();
+      if (!GetPackNode(use)) {
+        if (NodeProperties::IsValueEdge(edge)) {
+          TRACE("Source node has external value dependence %d:%s\n",
+                edge.from()->id(), edge.from()->op()->mnemonic());
+          hasExternalValueUse = true;
+          break;
+        } else if (NodeProperties::IsEffectEdge(edge)) {
+          effect_uses.push_back(use);
+        }
+      }
+    }
+
+    if (!hasExternalValueUse) {
+      // Remove unused source and linearize effect chain.
+      Node* effect = NodeProperties::GetEffectInput(src);
+      for (auto use : effect_uses) {
+        TRACE("Replace Effect Edge for source node from %d:%s, to %d:%s\n",
+              use->id(), use->op()->mnemonic(), effect->id(),
+              effect->op()->mnemonic());
+        NodeProperties::ReplaceEffectInput(use, effect, 0);
+      }
+    }
+  }
+
+  sources_.clear();
+}
+
 void Revectorizer::CollectSeeds() {
   for (auto it = graph_->GetSimdStoreNodes().begin();
        it != graph_->GetSimdStoreNodes().end(); ++it) {
@@ -906,7 +1350,10 @@ bool Revectorizer::ReduceStoreChains(
                                     chain_iter->second.end(), zone_);
       for (auto it = store_chain.begin(); it < store_chain.end(); it = it + 2) {
         ZoneVector<Node*> stores_unit(it, it + 2, zone_);
-        if (ReduceStoreChain(stores_unit)) {
+        if ((NodeProperties::GetEffectInput(stores_unit[0]) == stores_unit[1] ||
+             NodeProperties::GetEffectInput(stores_unit[1]) ==
+                 stores_unit[0]) &&
+            ReduceStoreChain(stores_unit)) {
           changed = true;
         }
       }
@@ -933,7 +1380,17 @@ bool Revectorizer::ReduceStoreChain(const ZoneVector<Node*>& Stores) {
 
   if (DecideVectorize()) {
     VectorizeTree(root);
+    UpdateSources();
     slp_tree_->Print("After vectorize tree");
+
+    if (node_observer_for_test_) {
+      slp_tree_->ForEach([&](const PackNode* pnode) {
+        Node* node = pnode->RevectorizedNode();
+        if (node) {
+          node_observer_for_test_->OnNodeCreated(node);
+        }
+      });
+    }
   }
 
   TRACE("\n");
diff --git a/deps/v8/src/compiler/revectorizer.h b/deps/v8/src/compiler/revectorizer.h
index f5e62b0bedbfd3..b74a6c60b3621e 100644
--- a/deps/v8/src/compiler/revectorizer.h
+++ b/deps/v8/src/compiler/revectorizer.h
@@ -48,7 +48,7 @@ class PackNode final : public NON_EXPORTED_BASE(ZoneObject) {
   bool IsSame(const ZoneVector<Node*>& node_group) const {
     return nodes_ == node_group;
   }
-  Node* RevectorizedNode() { return revectorized_node_; }
+  Node* RevectorizedNode() const { return revectorized_node_; }
   void SetRevectorizedNode(Node* node) { revectorized_node_ = node; }
   // returns the index operand of this PackNode.
   PackNode* GetOperand(size_t index) {
@@ -161,16 +161,7 @@ class SLPTree : public NON_EXPORTED_BASE(ZoneObject) {
 class V8_EXPORT_PRIVATE Revectorizer final
     : public NON_EXPORTED_BASE(ZoneObject) {
  public:
-  Revectorizer(Zone* zone, Graph* graph, MachineGraph* mcgraph)
-      : zone_(zone),
-        graph_(graph),
-        mcgraph_(mcgraph),
-        group_of_stores_(zone),
-        support_simd256_(false) {
-    DetectCPUFeatures();
-    slp_tree_ = zone_->New<SLPTree>(zone, graph);
-  }
-
+  Revectorizer(Zone* zone, Graph* graph, MachineGraph* mcgraph);
   void DetectCPUFeatures();
   bool TryRevectorize(const char* name);
 
@@ -195,14 +186,18 @@ class V8_EXPORT_PRIVATE Revectorizer final
   void SetMemoryOpInputs(base::SmallVector<Node*, 2>& inputs, PackNode* pnode,
                          int index);
   Node* VectorizeTree(PackNode* pnode);
+  void UpdateSources();
 
   Zone* const zone_;
   Graph* const graph_;
   MachineGraph* const mcgraph_;
   ZoneMap<Node*, ZoneMap<Node*, StoreNodeSet>*> group_of_stores_;
+  std::unordered_set<Node*> sources_;
   SLPTree* slp_tree_;
 
   bool support_simd256_;
+
+  compiler::NodeObserver* node_observer_for_test_;
 };
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/schedule.cc b/deps/v8/src/compiler/schedule.cc
index d38f68543d6c21..103aba1e80d5f9 100644
--- a/deps/v8/src/compiler/schedule.cc
+++ b/deps/v8/src/compiler/schedule.cc
@@ -29,6 +29,9 @@ BasicBlock::BasicBlock(Zone* zone, Id id)
       predecessors_(zone),
 #if DEBUG
       debug_info_(AssemblerDebugInfo(nullptr, nullptr, -1)),
+#endif
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+      pgo_execution_count_(0),
 #endif
       id_(id) {
 }
@@ -461,6 +464,9 @@ std::ostream& operator<<(std::ostream& os, const Schedule& s) {
        ((s.RpoBlockCount() == 0) ? *s.all_blocks() : *s.rpo_order())) {
     if (block == nullptr) continue;
     os << "--- BLOCK B" << block->rpo_number() << " id" << block->id();
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+    os << " PGO Execution Count:" << block->pgo_execution_count();
+#endif
     if (block->deferred()) os << " (deferred)";
     if (block->PredecessorCount() != 0) os << " <- ";
     bool comma = false;
diff --git a/deps/v8/src/compiler/schedule.h b/deps/v8/src/compiler/schedule.h
index 900516c05de32b..2ccccc18a0ea90 100644
--- a/deps/v8/src/compiler/schedule.h
+++ b/deps/v8/src/compiler/schedule.h
@@ -158,6 +158,11 @@ class V8_EXPORT_PRIVATE BasicBlock final
 
   NodeVector* nodes() { return &nodes_; }
 
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+  uint64_t pgo_execution_count() { return pgo_execution_count_; }
+  void set_pgo_execution_count(uint64_t count) { pgo_execution_count_ = count; }
+#endif
+
   // Loop membership helpers.
   inline bool IsLoopHeader() const { return loop_end_ != nullptr; }
   bool LoopContains(BasicBlock* block) const;
@@ -187,6 +192,9 @@ class V8_EXPORT_PRIVATE BasicBlock final
   BasicBlockVector predecessors_;
 #if DEBUG
   AssemblerDebugInfo debug_info_;
+#endif
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+  uint64_t pgo_execution_count_;
 #endif
   Id id_;
 };
diff --git a/deps/v8/src/compiler/scheduler.cc b/deps/v8/src/compiler/scheduler.cc
index a7d6e56ac6c629..4aeb2059b0f02f 100644
--- a/deps/v8/src/compiler/scheduler.cc
+++ b/deps/v8/src/compiler/scheduler.cc
@@ -420,7 +420,7 @@ class CFGBuilder : public ZoneObject {
 
   void BuildBlocksForSuccessors(Node* node) {
     size_t const successor_cnt = node->op()->ControlOutputCount();
-    Node** successors = zone_->NewArray<Node*>(successor_cnt);
+    Node** successors = zone_->AllocateArray<Node*>(successor_cnt);
     NodeProperties::CollectControlProjections(node, successors, successor_cnt);
     for (size_t index = 0; index < successor_cnt; ++index) {
       BuildBlockForNode(successors[index]);
@@ -513,7 +513,7 @@ class CFGBuilder : public ZoneObject {
   void ConnectSwitch(Node* sw) {
     size_t const successor_count = sw->op()->ControlOutputCount();
     BasicBlock** successor_blocks =
-        zone_->NewArray<BasicBlock*>(successor_count);
+        zone_->AllocateArray<BasicBlock*>(successor_count);
     CollectSuccessorBlocks(sw, successor_blocks, successor_count);
 
     if (sw == component_entry_) {
@@ -1878,6 +1878,15 @@ void Scheduler::SealFinalSchedule() {
       }
     }
   }
+#ifdef LOG_BUILTIN_BLOCK_COUNT
+  if (const ProfileDataFromFile* profile_data = this->profile_data()) {
+    for (BasicBlock* block : *schedule_->all_blocks()) {
+      uint64_t executed_count =
+          profile_data->GetExecutedCount(block->id().ToSize());
+      block->set_pgo_execution_count(executed_count);
+    }
+  }
+#endif
 }
 
 
diff --git a/deps/v8/src/compiler/simplified-lowering-verifier.cc b/deps/v8/src/compiler/simplified-lowering-verifier.cc
index b1eaaed57cd9a8..7a17f760d215fb 100644
--- a/deps/v8/src/compiler/simplified-lowering-verifier.cc
+++ b/deps/v8/src/compiler/simplified-lowering-verifier.cc
@@ -13,17 +13,6 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-Truncation LeastGeneralTruncation(const Truncation& t1, const Truncation& t2) {
-  if (t1.IsLessGeneralThan(t2)) return t1;
-  CHECK(t2.IsLessGeneralThan(t1));
-  return t2;
-}
-
-Truncation LeastGeneralTruncation(const Truncation& t1, const Truncation& t2,
-                                  const Truncation& t3) {
-  return LeastGeneralTruncation(LeastGeneralTruncation(t1, t2), t3);
-}
-
 bool IsNonTruncatingMachineTypeFor(const MachineType& mt, const Type& type,
                                    Zone* graph_zone) {
   if (type.IsNone()) return true;
@@ -140,6 +129,22 @@ Truncation SimplifiedLoweringVerifier::GeneralizeTruncation(
   }
 }
 
+Truncation SimplifiedLoweringVerifier::JoinTruncation(const Truncation& t1,
+                                                      const Truncation& t2) {
+  Truncation::TruncationKind kind;
+  if (Truncation::LessGeneral(t1.kind(), t2.kind())) {
+    kind = t1.kind();
+  } else {
+    CHECK(Truncation::LessGeneral(t2.kind(), t1.kind()));
+    kind = t2.kind();
+  }
+  IdentifyZeros identify_zeros = Truncation::LessGeneralIdentifyZeros(
+                                     t1.identify_zeros(), t2.identify_zeros())
+                                     ? t1.identify_zeros()
+                                     : t2.identify_zeros();
+  return Truncation(kind, identify_zeros);
+}
+
 void SimplifiedLoweringVerifier::VisitNode(Node* node,
                                            OperationTyper& op_typer) {
   switch (node->opcode()) {
@@ -232,9 +237,9 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
       } else {
         ReportInvalidTypeCombination(node, {left_type, right_type});
       }
-      Truncation output_trunc = LeastGeneralTruncation(InputTruncation(node, 0),
-                                                       InputTruncation(node, 1),
-                                                       Truncation::Word32());
+      Truncation output_trunc =
+          JoinTruncation(InputTruncation(node, 0), InputTruncation(node, 1),
+                         Truncation::Word32());
       CHECK(IsModuloTruncation(output_trunc));
       CheckAndSet(node, output_type, output_trunc);
       break;
@@ -256,9 +261,9 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
       } else {
         ReportInvalidTypeCombination(node, {left_type, right_type});
       }
-      Truncation output_trunc = LeastGeneralTruncation(InputTruncation(node, 0),
-                                                       InputTruncation(node, 1),
-                                                       Truncation::Word32());
+      Truncation output_trunc =
+          JoinTruncation(InputTruncation(node, 0), InputTruncation(node, 1),
+                         Truncation::Word32());
       CHECK(IsModuloTruncation(output_trunc));
       CheckAndSet(node, output_type, output_trunc);
       break;
@@ -275,8 +280,8 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
       break;
     }
     case IrOpcode::kChangeFloat64ToInt64: {
-      Truncation output_trunc = LeastGeneralTruncation(InputTruncation(node, 0),
-                                                       Truncation::Word64());
+      Truncation output_trunc =
+          JoinTruncation(InputTruncation(node, 0), Truncation::Word64());
       CheckAndSet(node, InputType(node, 0), output_trunc);
       break;
     }
@@ -305,9 +310,9 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
         // Invalid type combination.
         ReportInvalidTypeCombination(node, {left_type, right_type});
       }
-      Truncation output_trunc = LeastGeneralTruncation(InputTruncation(node, 0),
-                                                       InputTruncation(node, 1),
-                                                       Truncation::Word64());
+      Truncation output_trunc =
+          JoinTruncation(InputTruncation(node, 0), InputTruncation(node, 1),
+                         Truncation::Word64());
       CHECK(IsModuloTruncation(output_trunc));
       CheckAndSet(node, output_type, output_trunc);
       break;
@@ -337,9 +342,9 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
         // Invalid type combination.
         ReportInvalidTypeCombination(node, {left_type, right_type});
       }
-      Truncation output_trunc = LeastGeneralTruncation(InputTruncation(node, 0),
-                                                       InputTruncation(node, 1),
-                                                       Truncation::Word64());
+      Truncation output_trunc =
+          JoinTruncation(InputTruncation(node, 0), InputTruncation(node, 1),
+                         Truncation::Word64());
       CHECK(IsModuloTruncation(output_trunc));
       CheckAndSet(node, output_type, output_trunc);
       break;
@@ -365,8 +370,8 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
     case IrOpcode::kChangeTaggedSignedToInt64: {
       Type input_type = InputType(node, 0);
       CHECK(input_type.Is(Type::Number()));
-      Truncation output_trunc = LeastGeneralTruncation(InputTruncation(node, 0),
-                                                       Truncation::Word64());
+      Truncation output_trunc =
+          JoinTruncation(InputTruncation(node, 0), Truncation::Word64());
       CheckAndSet(node, input_type, output_trunc);
       break;
     }
@@ -408,7 +413,6 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
           default:
             UNREACHABLE();
         }
-        CheckType(node, output_type);
       }
 
       if (p.override_output_type()) {
@@ -493,7 +497,6 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
       CASE(Projection)
       CASE(Retain)
       CASE(MapGuard)
-      CASE(FoldConstant)
       CASE(Unreachable)
       CASE(Dead)
       CASE(Plug)
@@ -610,6 +613,7 @@ void SimplifiedLoweringVerifier::VisitNode(Node* node,
       CASE(Load)
       CASE(LoadImmutable)
       CASE(Store)
+      CASE(StorePair)
       CASE(StackSlot)
       CASE(Word32Popcnt)
       CASE(Word64Popcnt)
diff --git a/deps/v8/src/compiler/simplified-lowering-verifier.h b/deps/v8/src/compiler/simplified-lowering-verifier.h
index 37a013fa3506a5..f88a65da61c3e0 100644
--- a/deps/v8/src/compiler/simplified-lowering-verifier.h
+++ b/deps/v8/src/compiler/simplified-lowering-verifier.h
@@ -121,6 +121,11 @@ class SimplifiedLoweringVerifier final {
   // pairs.
   Truncation GeneralizeTruncation(const Truncation& truncation,
                                   const Type& type) const;
+  Truncation JoinTruncation(const Truncation& t1, const Truncation& t2);
+  Truncation JoinTruncation(const Truncation& t1, const Truncation& t2,
+                            const Truncation& t3) {
+    return JoinTruncation(JoinTruncation(t1, t2), t3);
+  }
 
   Zone* graph_zone() const { return graph_->zone(); }
 
diff --git a/deps/v8/src/compiler/simplified-lowering.cc b/deps/v8/src/compiler/simplified-lowering.cc
index 190e8bfa00aff7..6df14a52556bac 100644
--- a/deps/v8/src/compiler/simplified-lowering.cc
+++ b/deps/v8/src/compiler/simplified-lowering.cc
@@ -145,6 +145,7 @@ UseInfo TruncatingUseInfoFromRepresentation(MachineRepresentation rep) {
       return UseInfo::TaggedSigned();
     case MachineRepresentation::kTaggedPointer:
     case MachineRepresentation::kTagged:
+    case MachineRepresentation::kIndirectPointer:
     case MachineRepresentation::kMapWord:
       return UseInfo::AnyTagged();
     case MachineRepresentation::kFloat64:
@@ -1890,7 +1891,12 @@ class RepresentationSelector {
             // The bounds check is redundant if we already know that
             // the index is within the bounds of [0.0, length[.
             // TODO(neis): Move this into TypedOptimization?
-            new_flags |= CheckBoundsFlag::kAbortOnOutOfBounds;
+            if (v8_flags.turbo_typer_hardening) {
+              new_flags |= CheckBoundsFlag::kAbortOnOutOfBounds;
+            } else {
+              DeferReplacement(node, NodeProperties::GetValueInput(node, 0));
+              return;
+            }
           }
           ChangeOp(node,
                    simplified()->CheckedUint32Bounds(feedback, new_flags));
@@ -1932,12 +1938,14 @@ class RepresentationSelector {
   }
 
   UseInfo UseInfoForFastApiCallArgument(CTypeInfo type,
+                                        CFunctionInfo::Int64Representation repr,
                                         FeedbackSource const& feedback) {
     switch (type.GetSequenceType()) {
       case CTypeInfo::SequenceType::kScalar: {
         uint8_t flags = uint8_t(type.GetFlags());
         if (flags & uint8_t(CTypeInfo::Flags::kEnforceRangeBit) ||
             flags & uint8_t(CTypeInfo::Flags::kClampBit)) {
+          DCHECK(repr != CFunctionInfo::Int64Representation::kBigInt);
           return UseInfo::CheckedNumberAsFloat64(kIdentifyZeros, feedback);
         }
         switch (type.GetType()) {
@@ -1954,6 +1962,13 @@ class RepresentationSelector {
           // path.
           case CTypeInfo::Type::kInt64:
           case CTypeInfo::Type::kUint64:
+            if (repr == CFunctionInfo::Int64Representation::kBigInt) {
+              return UseInfo::CheckedBigIntTruncatingWord64(feedback);
+            } else if (repr == CFunctionInfo::Int64Representation::kNumber) {
+              return UseInfo::CheckedSigned64AsWord64(kIdentifyZeros, feedback);
+            } else {
+              UNREACHABLE();
+            }
           case CTypeInfo::Type::kAny:
             return UseInfo::CheckedSigned64AsWord64(kIdentifyZeros, feedback);
           case CTypeInfo::Type::kFloat32:
@@ -2003,7 +2018,8 @@ class RepresentationSelector {
     // Propagate representation information from TypeInfo.
     for (int i = 0; i < c_arg_count; i++) {
       arg_use_info[i] = UseInfoForFastApiCallArgument(
-          c_signature->ArgumentInfo(i), op_params.feedback());
+          c_signature->ArgumentInfo(i), c_signature->GetInt64Representation(),
+          op_params.feedback());
       ProcessInput<T>(node, i, arg_use_info[i]);
     }
 
@@ -2027,7 +2043,7 @@ class RepresentationSelector {
       case wasm::kI32:
         return MachineType::Int32();
       case wasm::kI64:
-        return MachineType::SignedBigInt64();
+        return MachineType::Int64();
       case wasm::kF32:
         return MachineType::Float32();
       case wasm::kF64:
@@ -3431,8 +3447,10 @@ class RepresentationSelector {
                 }
                 return;
               } else if (input_type.Is(Type::SignedBigInt64())) {
-                VisitBinop<T>(node, UseInfo::Word64(), UseInfo::Any(),
-                              MachineRepresentation::kWord64);
+                VisitBinop<T>(
+                    node,
+                    UseInfo::CheckedBigIntTruncatingWord64(FeedbackSource{}),
+                    UseInfo::Any(), MachineRepresentation::kWord64);
                 if (lower<T>()) {
                   if (!lossless || shift_amount > 63) {
                     ReplaceWithPureNode(
@@ -3453,8 +3471,10 @@ class RepresentationSelector {
                 }
                 return;
               } else if (input_type.Is(Type::UnsignedBigInt64())) {
-                VisitBinop<T>(node, UseInfo::Word64(), UseInfo::Any(),
-                              MachineRepresentation::kWord64);
+                VisitBinop<T>(
+                    node,
+                    UseInfo::CheckedBigIntTruncatingWord64(FeedbackSource{}),
+                    UseInfo::Any(), MachineRepresentation::kWord64);
                 if (lower<T>()) {
                   if (!lossless || shift_amount > 63) {
                     DeferReplacement(node, jsgraph_->Int64Constant(0));
@@ -3523,9 +3543,12 @@ class RepresentationSelector {
         }
       }
       case IrOpcode::kSpeculativeBigIntNegate: {
-        if (truncation.IsUnused()) {
-          VisitUnused<T>(node);
-        } else if (truncation.IsUsedAsWord64()) {
+        // NOTE: If truncation is Unused, we still need to preserve at least the
+        // BigInt type check (see http://crbug.com/1431713 for some details).
+        // We can use the standard lowering to word64 operations and have
+        // following phases remove the unused truncation and subtraction
+        // operations.
+        if (truncation.IsUsedAsWord64()) {
           VisitUnop<T>(node,
                        UseInfo::CheckedBigIntTruncatingWord64(FeedbackSource{}),
                        MachineRepresentation::kWord64);
@@ -3815,14 +3838,14 @@ class RepresentationSelector {
         } else if (value_type.Is(Type::Number())) {
           ProcessInput<T>(node, 2, UseInfo::TruncatingFloat64());  // value
           if (lower<T>()) {
-            Handle<Map> double_map = DoubleMapParameterOf(node->op());
+            MapRef double_map = DoubleMapParameterOf(node->op());
             ChangeOp(node,
                      simplified()->TransitionAndStoreNumberElement(double_map));
           }
         } else if (value_type.Is(Type::NonNumber())) {
           ProcessInput<T>(node, 2, UseInfo::AnyTagged());  // value
           if (lower<T>()) {
-            Handle<Map> fast_map = FastMapParameterOf(node->op());
+            MapRef fast_map = FastMapParameterOf(node->op());
             ChangeOp(node, simplified()->TransitionAndStoreNonNumberElement(
                                fast_map, value_type));
           }
@@ -3903,7 +3926,8 @@ class RepresentationSelector {
         if (InputIs(node, Type::Boolean())) {
           VisitUnop<T>(node, UseInfo::Bool(), MachineRepresentation::kWord32);
           if (lower<T>()) {
-            DeferReplacement(node, node->InputAt(0));
+            DeferReplacement(node, InsertSemanticsHintForVerifier(
+                                       node->op(), node->InputAt(0)));
           }
         } else if (InputIs(node, Type::String())) {
           VisitUnop<T>(node, UseInfo::AnyTagged(),
@@ -3916,7 +3940,8 @@ class RepresentationSelector {
             VisitUnop<T>(node, UseInfo::TruncatingWord32(),
                          MachineRepresentation::kWord32);
             if (lower<T>()) {
-              DeferReplacement(node, node->InputAt(0));
+              DeferReplacement(node, InsertSemanticsHintForVerifier(
+                                         node->op(), node->InputAt(0)));
             }
           } else {
             VisitUnop<T>(node, UseInfo::AnyTagged(),
@@ -3930,7 +3955,8 @@ class RepresentationSelector {
             VisitUnop<T>(node, UseInfo::TruncatingFloat64(),
                          MachineRepresentation::kFloat64);
             if (lower<T>()) {
-              DeferReplacement(node, node->InputAt(0));
+              DeferReplacement(node, InsertSemanticsHintForVerifier(
+                                         node->op(), node->InputAt(0)));
             }
           } else {
             VisitUnop<T>(node, UseInfo::AnyTagged(),
@@ -4251,13 +4277,13 @@ class RepresentationSelector {
         return;
       }
       case IrOpcode::kConvertTaggedHoleToUndefined: {
-        if (InputIs(node, Type::NumberOrOddball()) &&
+        if (InputIs(node, Type::NumberOrTheHole()) &&
             truncation.IsUsedAsWord32()) {
           // Propagate the Word32 truncation.
           VisitUnop<T>(node, UseInfo::TruncatingWord32(),
                        MachineRepresentation::kWord32);
           if (lower<T>()) DeferReplacement(node, node->InputAt(0));
-        } else if (InputIs(node, Type::NumberOrOddball()) &&
+        } else if (InputIs(node, Type::NumberOrTheHole()) &&
                    truncation.TruncatesOddballAndBigIntToNumber()) {
           // Propagate the Float64 truncation.
           VisitUnop<T>(node, UseInfo::TruncatingFloat64(),
@@ -4352,10 +4378,6 @@ class RepresentationSelector {
         return;
       }
 
-      case IrOpcode::kFoldConstant:
-        VisitInputs<T>(node);
-        return SetOutput<T>(node, MachineRepresentation::kTaggedPointer);
-
       case IrOpcode::kFinishRegion:
         VisitInputs<T>(node);
         // Assume the output is tagged pointer.
@@ -4465,7 +4487,7 @@ class RepresentationSelector {
 #endif
               FATAL("%%VerifyType: unsupported type");
             }
-            DeferReplacement(node, node->InputAt(0));
+            DisconnectFromEffectAndControl(node);
           }
         }
         return;
@@ -4509,6 +4531,7 @@ class RepresentationSelector {
       case IrOpcode::kInt32Sub:
       case IrOpcode::kUint32LessThan:
       case IrOpcode::kUint32LessThanOrEqual:
+      case IrOpcode::kUint64LessThan:
       case IrOpcode::kUint64LessThanOrEqual:
       case IrOpcode::kUint32Div:
       case IrOpcode::kWord32And:
@@ -4551,7 +4574,13 @@ class RepresentationSelector {
 
   void DisconnectFromEffectAndControl(Node* node) {
     if (node->op()->EffectInputCount() == 1) {
-      Node* control = NodeProperties::GetControlInput(node);
+      Node* control;
+      if (node->op()->ControlInputCount() == 1) {
+        control = NodeProperties::GetControlInput(node);
+      } else {
+        DCHECK_EQ(node->op()->ControlInputCount(), 0);
+        control = nullptr;
+      }
       Node* effect = NodeProperties::GetEffectInput(node);
       ReplaceEffectControlUses(node, effect, control);
     } else {
@@ -4576,7 +4605,7 @@ class RepresentationSelector {
   }
 
   Node* InsertTypeOverrideForVerifier(const Type& type, Node* node) {
-    if (verification_enabled()) {
+    if (V8_UNLIKELY(verification_enabled())) {
       DCHECK(!type.IsInvalid());
       node = graph()->NewNode(common()->SLVerifierHint(nullptr, type), node);
       verifier_->RecordHint(node);
@@ -4584,6 +4613,14 @@ class RepresentationSelector {
     return node;
   }
 
+  Node* InsertSemanticsHintForVerifier(const Operator* semantics, Node* node) {
+    if (V8_UNLIKELY(verification_enabled())) {
+      node = graph()->NewNode(common()->SLVerifierHint(semantics, {}), node);
+      verifier_->RecordHint(node);
+    }
+    return node;
+  }
+
  private:
   void ChangeOp(Node* node, const Operator* new_op) {
     compiler::NodeProperties::ChangeOp(node, new_op);
diff --git a/deps/v8/src/compiler/simplified-operator-reducer.cc b/deps/v8/src/compiler/simplified-operator-reducer.cc
index b48fea68fdfadb..6f11bccb2784ff 100644
--- a/deps/v8/src/compiler/simplified-operator-reducer.cc
+++ b/deps/v8/src/compiler/simplified-operator-reducer.cc
@@ -257,6 +257,7 @@ Reduction SimplifiedOperatorReducer::Reduce(Node* node) {
                 node->ReplaceInput(0, n.left().node());
                 node->ReplaceInput(1, jsgraph()->Int32Constant(val));
                 RelaxEffectsAndControls(checked_int32_add);
+                checked_int32_add->Kill();
                 return Changed(node);
               }
             }
diff --git a/deps/v8/src/compiler/simplified-operator.cc b/deps/v8/src/compiler/simplified-operator.cc
index 996f47bcb2ca93..7a9cac7a7a1972 100644
--- a/deps/v8/src/compiler/simplified-operator.cc
+++ b/deps/v8/src/compiler/simplified-operator.cc
@@ -41,7 +41,7 @@ std::ostream& operator<<(std::ostream& os,
                          ConstFieldInfo const& const_field_info) {
   if (const_field_info.IsConst()) {
     return os << "const (field owner: "
-              << Brief(*const_field_info.owner_map.ToHandleChecked()) << ")";
+              << Brief(*const_field_info.owner_map->object()) << ")";
   } else {
     return os << "mutable";
   }
@@ -49,11 +49,11 @@ std::ostream& operator<<(std::ostream& os,
 }
 
 bool operator==(ConstFieldInfo const& lhs, ConstFieldInfo const& rhs) {
-  return lhs.owner_map.address() == rhs.owner_map.address();
+  return lhs.owner_map == rhs.owner_map;
 }
 
 size_t hash_value(ConstFieldInfo const& const_field_info) {
-  return static_cast<size_t>(const_field_info.owner_map.address());
+  return hash_value(const_field_info.owner_map);
 }
 
 bool operator==(FieldAccess const& lhs, FieldAccess const& rhs) {
@@ -61,8 +61,7 @@ bool operator==(FieldAccess const& lhs, FieldAccess const& rhs) {
   // really only relevant for eliminating loads and they don't care about the
   // write barrier mode.
   return lhs.base_is_tagged == rhs.base_is_tagged && lhs.offset == rhs.offset &&
-         lhs.map.address() == rhs.map.address() &&
-         lhs.machine_type == rhs.machine_type &&
+         lhs.map == rhs.map && lhs.machine_type == rhs.machine_type &&
          lhs.const_field_info == rhs.const_field_info &&
          lhs.is_store_in_literal == rhs.is_store_in_literal;
 }
@@ -88,9 +87,8 @@ std::ostream& operator<<(std::ostream& os, FieldAccess const& access) {
     name->NamePrint(os);
     os << ", ";
   }
-  Handle<Map> map;
-  if (access.map.ToHandle(&map)) {
-    os << Brief(*map) << ", ";
+  if (access.map.has_value()) {
+    os << Brief(*access.map->object()) << ", ";
   }
 #endif
   os << access.type << ", " << access.machine_type << ", "
@@ -300,14 +298,14 @@ CheckMapsParameters const& CheckMapsParametersOf(Operator const* op) {
   return OpParameter<CheckMapsParameters>(op);
 }
 
-ZoneHandleSet<Map> const& CompareMapsParametersOf(Operator const* op) {
+ZoneRefSet<Map> const& CompareMapsParametersOf(Operator const* op) {
   DCHECK_EQ(IrOpcode::kCompareMaps, op->opcode());
-  return OpParameter<ZoneHandleSet<Map>>(op);
+  return OpParameter<ZoneRefSet<Map>>(op);
 }
 
-ZoneHandleSet<Map> const& MapGuardMapsOf(Operator const* op) {
+ZoneRefSet<Map> const& MapGuardMapsOf(Operator const* op) {
   DCHECK_EQ(IrOpcode::kMapGuard, op->opcode());
-  return OpParameter<ZoneHandleSet<Map>>(op);
+  return OpParameter<ZoneRefSet<Map>>(op);
 }
 
 size_t hash_value(CheckTaggedInputMode mode) {
@@ -358,25 +356,25 @@ const GrowFastElementsParameters& GrowFastElementsParametersOf(
 }
 
 bool operator==(ElementsTransition const& lhs, ElementsTransition const& rhs) {
-  return lhs.mode() == rhs.mode() &&
-         lhs.source().address() == rhs.source().address() &&
-         lhs.target().address() == rhs.target().address();
+  return lhs.mode() == rhs.mode() && lhs.source() == rhs.source() &&
+         lhs.target() == rhs.target();
 }
 
 size_t hash_value(ElementsTransition transition) {
   return base::hash_combine(static_cast<uint8_t>(transition.mode()),
-                            transition.source().address(),
-                            transition.target().address());
+                            transition.source(), transition.target());
 }
 
 std::ostream& operator<<(std::ostream& os, ElementsTransition transition) {
   switch (transition.mode()) {
     case ElementsTransition::kFastTransition:
-      return os << "fast-transition from " << Brief(*transition.source())
-                << " to " << Brief(*transition.target());
+      return os << "fast-transition from "
+                << Brief(*transition.source().object()) << " to "
+                << Brief(*transition.target().object());
     case ElementsTransition::kSlowTransition:
-      return os << "slow-transition from " << Brief(*transition.source())
-                << " to " << Brief(*transition.target());
+      return os << "slow-transition from "
+                << Brief(*transition.source().object()) << " to "
+                << Brief(*transition.target().object());
   }
   UNREACHABLE();
 }
@@ -391,36 +389,34 @@ namespace {
 // Parameters for the TransitionAndStoreElement opcode.
 class TransitionAndStoreElementParameters final {
  public:
-  TransitionAndStoreElementParameters(Handle<Map> double_map,
-                                      Handle<Map> fast_map);
+  TransitionAndStoreElementParameters(MapRef double_map, MapRef fast_map);
 
-  Handle<Map> double_map() const { return double_map_; }
-  Handle<Map> fast_map() const { return fast_map_; }
+  MapRef double_map() const { return double_map_; }
+  MapRef fast_map() const { return fast_map_; }
 
  private:
-  Handle<Map> const double_map_;
-  Handle<Map> const fast_map_;
+  MapRef const double_map_;
+  MapRef const fast_map_;
 };
 
 TransitionAndStoreElementParameters::TransitionAndStoreElementParameters(
-    Handle<Map> double_map, Handle<Map> fast_map)
+    MapRef double_map, MapRef fast_map)
     : double_map_(double_map), fast_map_(fast_map) {}
 
 bool operator==(TransitionAndStoreElementParameters const& lhs,
                 TransitionAndStoreElementParameters const& rhs) {
-  return lhs.fast_map().address() == rhs.fast_map().address() &&
-         lhs.double_map().address() == rhs.double_map().address();
+  return lhs.fast_map() == rhs.fast_map() &&
+         lhs.double_map() == rhs.double_map();
 }
 
 size_t hash_value(TransitionAndStoreElementParameters parameters) {
-  return base::hash_combine(parameters.fast_map().address(),
-                            parameters.double_map().address());
+  return base::hash_combine(parameters.fast_map(), parameters.double_map());
 }
 
 std::ostream& operator<<(std::ostream& os,
                          TransitionAndStoreElementParameters parameters) {
-  return os << "fast-map" << Brief(*parameters.fast_map()) << " double-map"
-            << Brief(*parameters.double_map());
+  return os << "fast-map" << Brief(*parameters.fast_map().object())
+            << " double-map" << Brief(*parameters.double_map().object());
 }
 
 }  // namespace
@@ -430,37 +426,36 @@ namespace {
 // Parameters for the TransitionAndStoreNonNumberElement opcode.
 class TransitionAndStoreNonNumberElementParameters final {
  public:
-  TransitionAndStoreNonNumberElementParameters(Handle<Map> fast_map,
+  TransitionAndStoreNonNumberElementParameters(MapRef fast_map,
                                                Type value_type);
 
-  Handle<Map> fast_map() const { return fast_map_; }
+  MapRef fast_map() const { return fast_map_; }
   Type value_type() const { return value_type_; }
 
  private:
-  Handle<Map> const fast_map_;
+  MapRef const fast_map_;
   Type value_type_;
 };
 
 TransitionAndStoreNonNumberElementParameters::
-    TransitionAndStoreNonNumberElementParameters(Handle<Map> fast_map,
+    TransitionAndStoreNonNumberElementParameters(MapRef fast_map,
                                                  Type value_type)
     : fast_map_(fast_map), value_type_(value_type) {}
 
 bool operator==(TransitionAndStoreNonNumberElementParameters const& lhs,
                 TransitionAndStoreNonNumberElementParameters const& rhs) {
-  return lhs.fast_map().address() == rhs.fast_map().address() &&
+  return lhs.fast_map() == rhs.fast_map() &&
          lhs.value_type() == rhs.value_type();
 }
 
 size_t hash_value(TransitionAndStoreNonNumberElementParameters parameters) {
-  return base::hash_combine(parameters.fast_map().address(),
-                            parameters.value_type());
+  return base::hash_combine(parameters.fast_map(), parameters.value_type());
 }
 
 std::ostream& operator<<(
     std::ostream& os, TransitionAndStoreNonNumberElementParameters parameters) {
   return os << parameters.value_type() << ", fast-map"
-            << Brief(*parameters.fast_map());
+            << Brief(*parameters.fast_map().object());
 }
 
 }  // namespace
@@ -470,35 +465,35 @@ namespace {
 // Parameters for the TransitionAndStoreNumberElement opcode.
 class TransitionAndStoreNumberElementParameters final {
  public:
-  explicit TransitionAndStoreNumberElementParameters(Handle<Map> double_map);
+  explicit TransitionAndStoreNumberElementParameters(MapRef double_map);
 
-  Handle<Map> double_map() const { return double_map_; }
+  MapRef double_map() const { return double_map_; }
 
  private:
-  Handle<Map> const double_map_;
+  MapRef const double_map_;
 };
 
 TransitionAndStoreNumberElementParameters::
-    TransitionAndStoreNumberElementParameters(Handle<Map> double_map)
+    TransitionAndStoreNumberElementParameters(MapRef double_map)
     : double_map_(double_map) {}
 
 bool operator==(TransitionAndStoreNumberElementParameters const& lhs,
                 TransitionAndStoreNumberElementParameters const& rhs) {
-  return lhs.double_map().address() == rhs.double_map().address();
+  return lhs.double_map() == rhs.double_map();
 }
 
 size_t hash_value(TransitionAndStoreNumberElementParameters parameters) {
-  return base::hash_combine(parameters.double_map().address());
+  return base::hash_combine(parameters.double_map());
 }
 
 std::ostream& operator<<(std::ostream& os,
                          TransitionAndStoreNumberElementParameters parameters) {
-  return os << "double-map" << Brief(*parameters.double_map());
+  return os << "double-map" << Brief(*parameters.double_map().object());
 }
 
 }  // namespace
 
-Handle<Map> DoubleMapParameterOf(const Operator* op) {
+MapRef DoubleMapParameterOf(const Operator* op) {
   if (op->opcode() == IrOpcode::kTransitionAndStoreElement) {
     return OpParameter<TransitionAndStoreElementParameters>(op).double_map();
   } else if (op->opcode() == IrOpcode::kTransitionAndStoreNumberElement) {
@@ -514,7 +509,7 @@ Type ValueTypeParameterOf(const Operator* op) {
       .value_type();
 }
 
-Handle<Map> FastMapParameterOf(const Operator* op) {
+MapRef FastMapParameterOf(const Operator* op) {
   if (op->opcode() == IrOpcode::kTransitionAndStoreElement) {
     return OpParameter<TransitionAndStoreElementParameters>(op).fast_map();
   } else if (op->opcode() == IrOpcode::kTransitionAndStoreNonNumberElement) {
@@ -1275,7 +1270,8 @@ struct SimplifiedOperatorGlobalCache final {
 
   struct StringAsWtf16Operator final : public Operator {
     StringAsWtf16Operator()
-        : Operator(IrOpcode::kStringAsWtf16, Operator::kEliminatable,
+        : Operator(IrOpcode::kStringAsWtf16,
+                   Operator::kEliminatable | Operator::kIdempotent,
                    "StringAsWtf16", 1, 1, 1, 1, 1, 1) {}
   };
   StringAsWtf16Operator kStringAsWtf16;
@@ -1466,14 +1462,14 @@ const Operator* SimplifiedOperatorBuilder::SpeculativeBigIntAsUintN(
 const Operator* SimplifiedOperatorBuilder::AssertType(Type type) {
   DCHECK(type.CanBeAsserted());
   return zone()->New<Operator1<Type>>(IrOpcode::kAssertType,
-                                      Operator::kNoThrow | Operator::kNoDeopt,
-                                      "AssertType", 1, 0, 0, 1, 0, 0, type);
+                                      Operator::kEliminatable, "AssertType", 1,
+                                      1, 0, 0, 1, 0, type);
 }
 
 const Operator* SimplifiedOperatorBuilder::VerifyType() {
   return zone()->New<Operator>(IrOpcode::kVerifyType,
                                Operator::kNoThrow | Operator::kNoDeopt,
-                               "VerifyType", 1, 0, 0, 1, 0, 0);
+                               "VerifyType", 1, 1, 0, 0, 1, 0);
 }
 
 const Operator* SimplifiedOperatorBuilder::CheckTurboshaftTypeOf() {
@@ -1490,6 +1486,14 @@ const Operator* SimplifiedOperatorBuilder::WasmTypeCheck(
       "WasmTypeCheck", 2, 1, 1, 1, 1, 1, config);
 }
 
+const Operator* SimplifiedOperatorBuilder::WasmTypeCheckAbstract(
+    WasmTypeCheckConfig config) {
+  return zone_->New<Operator1<WasmTypeCheckConfig>>(
+      IrOpcode::kWasmTypeCheckAbstract,
+      Operator::kEliminatable | Operator::kIdempotent, "WasmTypeCheckAbstract",
+      1, 1, 1, 1, 1, 1, config);
+}
+
 const Operator* SimplifiedOperatorBuilder::WasmTypeCast(
     WasmTypeCheckConfig config) {
   return zone_->New<Operator1<WasmTypeCheckConfig>>(
@@ -1498,6 +1502,14 @@ const Operator* SimplifiedOperatorBuilder::WasmTypeCast(
       "WasmTypeCast", 2, 1, 1, 1, 1, 1, config);
 }
 
+const Operator* SimplifiedOperatorBuilder::WasmTypeCastAbstract(
+    WasmTypeCheckConfig config) {
+  return zone_->New<Operator1<WasmTypeCheckConfig>>(
+      IrOpcode::kWasmTypeCastAbstract,
+      Operator::kNoWrite | Operator::kNoThrow | Operator::kIdempotent,
+      "WasmTypeCastAbstract", 1, 1, 1, 1, 1, 1, config);
+}
+
 const Operator* SimplifiedOperatorBuilder::RttCanon(int index) {
   return zone()->New<Operator1<int>>(IrOpcode::kRttCanon, Operator::kPure,
                                      "RttCanon", 1, 0, 0, 1, 0, 0, index);
@@ -1751,7 +1763,7 @@ const Operator* SimplifiedOperatorBuilder::CheckedTruncateTaggedToWord32(
 }
 
 const Operator* SimplifiedOperatorBuilder::CheckMaps(
-    CheckMapsFlags flags, ZoneHandleSet<Map> maps,
+    CheckMapsFlags flags, ZoneRefSet<Map> maps,
     const FeedbackSource& feedback) {
   CheckMapsParameters const parameters(flags, maps, feedback);
   Operator::Properties operator_props = Operator::kNoThrow;
@@ -1766,24 +1778,23 @@ const Operator* SimplifiedOperatorBuilder::CheckMaps(
       parameters);                                     // parameter
 }
 
-const Operator* SimplifiedOperatorBuilder::MapGuard(ZoneHandleSet<Map> maps) {
+const Operator* SimplifiedOperatorBuilder::MapGuard(ZoneRefSet<Map> maps) {
   DCHECK_LT(0, maps.size());
-  return zone()->New<Operator1<ZoneHandleSet<Map>>>(  // --
-      IrOpcode::kMapGuard, Operator::kEliminatable,   // opcode
-      "MapGuard",                                     // name
-      1, 1, 1, 0, 1, 0,                               // counts
-      maps);                                          // parameter
+  return zone()->New<Operator1<ZoneRefSet<Map>>>(    // --
+      IrOpcode::kMapGuard, Operator::kEliminatable,  // opcode
+      "MapGuard",                                    // name
+      1, 1, 1, 0, 1, 0,                              // counts
+      maps);                                         // parameter
 }
 
-const Operator* SimplifiedOperatorBuilder::CompareMaps(
-    ZoneHandleSet<Map> maps) {
+const Operator* SimplifiedOperatorBuilder::CompareMaps(ZoneRefSet<Map> maps) {
   DCHECK_LT(0, maps.size());
-  return zone()->New<Operator1<ZoneHandleSet<Map>>>(  // --
-      IrOpcode::kCompareMaps,                         // opcode
-      Operator::kNoThrow | Operator::kNoWrite,        // flags
-      "CompareMaps",                                  // name
-      1, 1, 1, 1, 1, 0,                               // counts
-      maps);                                          // parameter
+  return zone()->New<Operator1<ZoneRefSet<Map>>>(  // --
+      IrOpcode::kCompareMaps,                      // opcode
+      Operator::kNoThrow | Operator::kNoWrite,     // flags
+      "CompareMaps",                               // name
+      1, 1, 1, 1, 1, 0,                            // counts
+      maps);                                       // parameter
 }
 
 const Operator* SimplifiedOperatorBuilder::ConvertReceiver(
@@ -2104,11 +2115,10 @@ const Operator* SimplifiedOperatorBuilder::Allocate(Type type,
 }
 
 const Operator* SimplifiedOperatorBuilder::AllocateRaw(
-    Type type, AllocationType allocation,
-    AllowLargeObjects allow_large_objects) {
+    Type type, AllocationType allocation) {
   return zone()->New<Operator1<AllocateParameters>>(
       IrOpcode::kAllocateRaw, Operator::kEliminatable, "AllocateRaw", 1, 1, 1,
-      1, 1, 1, AllocateParameters(type, allocation, allow_large_objects));
+      1, 1, 1, AllocateParameters(type, allocation));
 }
 
 #define SPECULATIVE_NUMBER_BINOP(Name)                                        \
@@ -2203,7 +2213,7 @@ const Operator* SimplifiedOperatorBuilder::LoadStackArgument() {
 }
 
 const Operator* SimplifiedOperatorBuilder::TransitionAndStoreElement(
-    Handle<Map> double_map, Handle<Map> fast_map) {
+    MapRef double_map, MapRef fast_map) {
   TransitionAndStoreElementParameters parameters(double_map, fast_map);
   return zone()->New<Operator1<TransitionAndStoreElementParameters>>(
       IrOpcode::kTransitionAndStoreElement,
@@ -2218,7 +2228,7 @@ const Operator* SimplifiedOperatorBuilder::StoreSignedSmallElement() {
 }
 
 const Operator* SimplifiedOperatorBuilder::TransitionAndStoreNumberElement(
-    Handle<Map> double_map) {
+    MapRef double_map) {
   TransitionAndStoreNumberElementParameters parameters(double_map);
   return zone()->New<Operator1<TransitionAndStoreNumberElementParameters>>(
       IrOpcode::kTransitionAndStoreNumberElement,
@@ -2227,7 +2237,7 @@ const Operator* SimplifiedOperatorBuilder::TransitionAndStoreNumberElement(
 }
 
 const Operator* SimplifiedOperatorBuilder::TransitionAndStoreNonNumberElement(
-    Handle<Map> fast_map, Type value_type) {
+    MapRef fast_map, Type value_type) {
   TransitionAndStoreNonNumberElementParameters parameters(fast_map, value_type);
   return zone()->New<Operator1<TransitionAndStoreNonNumberElementParameters>>(
       IrOpcode::kTransitionAndStoreNonNumberElement,
diff --git a/deps/v8/src/compiler/simplified-operator.h b/deps/v8/src/compiler/simplified-operator.h
index a43651623de963..117eb046161cf8 100644
--- a/deps/v8/src/compiler/simplified-operator.h
+++ b/deps/v8/src/compiler/simplified-operator.h
@@ -8,6 +8,7 @@
 #include <iosfwd>
 
 #include "src/base/compiler-specific.h"
+#include "src/base/container-utils.h"
 #include "src/codegen/machine-type.h"
 #include "src/codegen/tnode.h"
 #include "src/common/globals.h"
@@ -22,7 +23,6 @@
 #include "src/handles/handles.h"
 #include "src/handles/maybe-handles.h"
 #include "src/objects/objects.h"
-#include "src/zone/zone-handle-set.h"
 
 #ifdef V8_ENABLE_WEBASSEMBLY
 #include "src/compiler/wasm-compiler-definitions.h"
@@ -52,12 +52,12 @@ std::ostream& operator<<(std::ostream&, BaseTaggedness);
 struct ConstFieldInfo {
   // the map that introduced the const field, if any. An access is considered
   // mutable iff the handle is null.
-  MaybeHandle<Map> owner_map;
+  OptionalMapRef owner_map;
 
-  ConstFieldInfo() : owner_map(MaybeHandle<Map>()) {}
-  explicit ConstFieldInfo(Handle<Map> owner_map) : owner_map(owner_map) {}
+  ConstFieldInfo() : owner_map(OptionalMapRef()) {}
+  explicit ConstFieldInfo(MapRef owner_map) : owner_map(owner_map) {}
 
-  bool IsConst() const { return !owner_map.is_null(); }
+  bool IsConst() const { return owner_map.has_value(); }
 
   // No const field owner, i.e., a mutable field
   static ConstFieldInfo None() { return ConstFieldInfo(); }
@@ -105,7 +105,7 @@ struct FieldAccess {
   BaseTaggedness base_is_tagged;  // specifies if the base pointer is tagged.
   int offset;                     // offset of the field, without tag.
   MaybeHandle<Name> name;         // debugging only.
-  MaybeHandle<Map> map;           // map of the field value (if known).
+  OptionalMapRef map;             // map of the field value (if known).
   Type type;                      // type of the field.
   MachineType machine_type;       // machine type of the field.
   WriteBarrierKind write_barrier_kind;  // write barrier hint.
@@ -137,7 +137,7 @@ struct FieldAccess {
         maybe_initializing_or_transitioning_store(false) {}
 
   FieldAccess(BaseTaggedness base_is_tagged, int offset, MaybeHandle<Name> name,
-              MaybeHandle<Map> map, Type type, MachineType machine_type,
+              OptionalMapRef map, Type type, MachineType machine_type,
               WriteBarrierKind write_barrier_kind,
               const char* creator_mnemonic = nullptr,
               ConstFieldInfo const_field_info = ConstFieldInfo::None(),
@@ -445,17 +445,17 @@ std::ostream& operator<<(std::ostream&, CheckMapsFlags);
 // then speculation on that CallIC slot will be disabled.
 class CheckMapsParameters final {
  public:
-  CheckMapsParameters(CheckMapsFlags flags, ZoneHandleSet<Map> const& maps,
+  CheckMapsParameters(CheckMapsFlags flags, ZoneRefSet<Map> const& maps,
                       const FeedbackSource& feedback)
       : flags_(flags), maps_(maps), feedback_(feedback) {}
 
   CheckMapsFlags flags() const { return flags_; }
-  ZoneHandleSet<Map> const& maps() const { return maps_; }
+  ZoneRefSet<Map> const& maps() const { return maps_; }
   FeedbackSource const& feedback() const { return feedback_; }
 
  private:
   CheckMapsFlags const flags_;
-  ZoneHandleSet<Map> const maps_;
+  ZoneRefSet<Map> const maps_;
   FeedbackSource const feedback_;
 };
 
@@ -468,10 +468,10 @@ std::ostream& operator<<(std::ostream&, CheckMapsParameters const&);
 CheckMapsParameters const& CheckMapsParametersOf(Operator const*)
     V8_WARN_UNUSED_RESULT;
 
-ZoneHandleSet<Map> const& MapGuardMapsOf(Operator const*) V8_WARN_UNUSED_RESULT;
+ZoneRefSet<Map> const& MapGuardMapsOf(Operator const*) V8_WARN_UNUSED_RESULT;
 
 // Parameters for CompareMaps operator.
-ZoneHandleSet<Map> const& CompareMapsParametersOf(Operator const*)
+ZoneRefSet<Map> const& CompareMapsParametersOf(Operator const*)
     V8_WARN_UNUSED_RESULT;
 
 // A descriptor for growing elements backing stores.
@@ -518,17 +518,17 @@ class ElementsTransition final {
     kSlowTransition   // full transition, round-trip to the runtime.
   };
 
-  ElementsTransition(Mode mode, Handle<Map> source, Handle<Map> target)
+  ElementsTransition(Mode mode, MapRef source, MapRef target)
       : mode_(mode), source_(source), target_(target) {}
 
   Mode mode() const { return mode_; }
-  Handle<Map> source() const { return source_; }
-  Handle<Map> target() const { return target_; }
+  MapRef source() const { return source_; }
+  MapRef target() const { return target_; }
 
  private:
   Mode const mode_;
-  Handle<Map> const source_;
-  Handle<Map> const target_;
+  MapRef const source_;
+  MapRef const target_;
 };
 
 bool operator==(ElementsTransition const&, ElementsTransition const&);
@@ -543,8 +543,8 @@ ElementsTransition const& ElementsTransitionOf(const Operator* op)
 // Parameters for TransitionAndStoreElement, or
 // TransitionAndStoreNonNumberElement, or
 // TransitionAndStoreNumberElement.
-Handle<Map> DoubleMapParameterOf(const Operator* op) V8_WARN_UNUSED_RESULT;
-Handle<Map> FastMapParameterOf(const Operator* op) V8_WARN_UNUSED_RESULT;
+MapRef DoubleMapParameterOf(const Operator* op) V8_WARN_UNUSED_RESULT;
+MapRef FastMapParameterOf(const Operator* op) V8_WARN_UNUSED_RESULT;
 
 // Parameters for TransitionAndStoreNonNumberElement.
 Type ValueTypeParameterOf(const Operator* op) V8_WARN_UNUSED_RESULT;
@@ -645,21 +645,15 @@ int FormalParameterCountOf(const Operator* op) V8_WARN_UNUSED_RESULT;
 
 class AllocateParameters {
  public:
-  AllocateParameters(
-      Type type, AllocationType allocation_type,
-      AllowLargeObjects allow_large_objects = AllowLargeObjects::kFalse)
-      : type_(type),
-        allocation_type_(allocation_type),
-        allow_large_objects_(allow_large_objects) {}
+  AllocateParameters(Type type, AllocationType allocation_type)
+      : type_(type), allocation_type_(allocation_type) {}
 
   Type type() const { return type_; }
   AllocationType allocation_type() const { return allocation_type_; }
-  AllowLargeObjects allow_large_objects() const { return allow_large_objects_; }
 
  private:
   Type type_;
   AllocationType allocation_type_;
-  AllowLargeObjects allow_large_objects_;
 };
 
 bool IsCheckedWithFeedback(const Operator* op);
@@ -729,6 +723,17 @@ class FastApiCallParameters {
   const FastApiCallFunctionVector& c_functions() const { return c_functions_; }
   FeedbackSource const& feedback() const { return feedback_; }
   CallDescriptor* descriptor() const { return descriptor_; }
+  const CFunctionInfo* signature() const {
+    DCHECK(!c_functions_.empty());
+    return c_functions_[0].signature;
+  }
+  unsigned int argument_count() const {
+    const unsigned int count = signature()->ArgumentCount();
+    DCHECK(base::all_of(c_functions_, [count](const auto& f) {
+      return f.signature->ArgumentCount() == count;
+    }));
+    return count;
+  }
 
  private:
   // A single FastApiCall node can represent multiple overloaded functions.
@@ -969,8 +974,8 @@ class V8_EXPORT_PRIVATE SimplifiedOperatorBuilder final
   const Operator* TruncateTaggedToBit();
   const Operator* TruncateTaggedPointerToBit();
 
-  const Operator* CompareMaps(ZoneHandleSet<Map>);
-  const Operator* MapGuard(ZoneHandleSet<Map> maps);
+  const Operator* CompareMaps(ZoneRefSet<Map>);
+  const Operator* MapGuard(ZoneRefSet<Map> maps);
 
   const Operator* CheckBounds(const FeedbackSource& feedback,
                               CheckBoundsFlags flags = {});
@@ -987,7 +992,7 @@ class V8_EXPORT_PRIVATE SimplifiedOperatorBuilder final
   const Operator* CheckIf(DeoptimizeReason deoptimize_reason,
                           const FeedbackSource& feedback = FeedbackSource());
   const Operator* CheckInternalizedString();
-  const Operator* CheckMaps(CheckMapsFlags, ZoneHandleSet<Map>,
+  const Operator* CheckMaps(CheckMapsFlags, ZoneRefSet<Map>,
                             const FeedbackSource& = FeedbackSource());
   const Operator* CheckNotTaggedHole();
   const Operator* CheckNumber(const FeedbackSource& feedback);
@@ -1091,8 +1096,7 @@ class V8_EXPORT_PRIVATE SimplifiedOperatorBuilder final
   const Operator* Allocate(Type type,
                            AllocationType allocation = AllocationType::kYoung);
   const Operator* AllocateRaw(
-      Type type, AllocationType allocation = AllocationType::kYoung,
-      AllowLargeObjects allow_large_objects = AllowLargeObjects::kFalse);
+      Type type, AllocationType allocation = AllocationType::kYoung);
 
   const Operator* LoadMessage();
   const Operator* StoreMessage();
@@ -1112,16 +1116,15 @@ class V8_EXPORT_PRIVATE SimplifiedOperatorBuilder final
   const Operator* StoreElement(ElementAccess const&);
 
   // store-element [base + index], value, only with fast arrays.
-  const Operator* TransitionAndStoreElement(Handle<Map> double_map,
-                                            Handle<Map> fast_map);
+  const Operator* TransitionAndStoreElement(MapRef double_map, MapRef fast_map);
   // store-element [base + index], smi value, only with fast arrays.
   const Operator* StoreSignedSmallElement();
 
   // store-element [base + index], double value, only with fast arrays.
-  const Operator* TransitionAndStoreNumberElement(Handle<Map> double_map);
+  const Operator* TransitionAndStoreNumberElement(MapRef double_map);
 
   // store-element [base + index], object value, only with fast arrays.
-  const Operator* TransitionAndStoreNonNumberElement(Handle<Map> fast_map,
+  const Operator* TransitionAndStoreNonNumberElement(MapRef fast_map,
                                                      Type value_type);
 
   // load-from-object [base + offset]
@@ -1172,10 +1175,11 @@ class V8_EXPORT_PRIVATE SimplifiedOperatorBuilder final
   const Operator* Null(wasm::ValueType type);
   const Operator* RttCanon(int index);
   const Operator* WasmTypeCheck(WasmTypeCheckConfig config);
+  const Operator* WasmTypeCheckAbstract(WasmTypeCheckConfig config);
   const Operator* WasmTypeCast(WasmTypeCheckConfig config);
+  const Operator* WasmTypeCastAbstract(WasmTypeCheckConfig config);
   const Operator* WasmExternInternalize();
   const Operator* WasmExternExternalize();
-  // TODO(manoskouk): Use {CheckForNull} over bool.
   const Operator* WasmStructGet(const wasm::StructType* type, int field_index,
                                 bool is_signed, CheckForNull null_check);
   const Operator* WasmStructSet(const wasm::StructType* type, int field_index,
diff --git a/deps/v8/src/compiler/turboshaft/assembler.h b/deps/v8/src/compiler/turboshaft/assembler.h
index 1859a24651b715..af04ace287f148 100644
--- a/deps/v8/src/compiler/turboshaft/assembler.h
+++ b/deps/v8/src/compiler/turboshaft/assembler.h
@@ -15,14 +15,17 @@
 #include "src/base/macros.h"
 #include "src/base/small-vector.h"
 #include "src/base/template-utils.h"
+#include "src/base/vector.h"
 #include "src/codegen/callable.h"
 #include "src/codegen/code-factory.h"
 #include "src/codegen/reloc-info.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/common-operator.h"
+#include "src/compiler/globals.h"
+#include "src/compiler/simplified-operator.h"
 #include "src/compiler/turboshaft/builtin-call-descriptors.h"
 #include "src/compiler/turboshaft/graph.h"
-#include "src/compiler/turboshaft/operation-matching.h"
+#include "src/compiler/turboshaft/operation-matcher.h"
 #include "src/compiler/turboshaft/operations.h"
 #include "src/compiler/turboshaft/optimization-phase.h"
 #include "src/compiler/turboshaft/reducer-traits.h"
@@ -30,9 +33,16 @@
 #include "src/compiler/turboshaft/runtime-call-descriptors.h"
 #include "src/compiler/turboshaft/sidetable.h"
 #include "src/compiler/turboshaft/snapshot-table.h"
+#include "src/compiler/turboshaft/utils.h"
 #include "src/logging/runtime-call-stats.h"
 #include "src/objects/heap-number.h"
 #include "src/objects/oddball.h"
+#include "src/objects/tagged.h"
+#include "src/objects/turbofan-types.h"
+
+#ifdef V8_ENABLE_WEBASSEMBLY
+#include "src/wasm/wasm-objects.h"
+#endif
 
 namespace v8::internal {
 enum class Builtin : int32_t;
@@ -40,9 +50,51 @@ enum class Builtin : int32_t;
 
 namespace v8::internal::compiler::turboshaft {
 
-// Currently we don't have an actual Boolean type. We define an alias to allow
-// `V<Boolean>` to be used.
-using Boolean = Oddball;
+// GotoIf(cond, dst) and GotoIfNot(cond, dst) are not guaranteed to actually
+// generate a Branch with `dst` as one of the destination, because some reducer
+// in the stack could realize that `cond` is statically known and optimize away
+// the Branch. Thus, GotoIf and GotoIfNot return a {ConditionalGotoStatus},
+// which represents whether a GotoIf/GotoIfNot was emitted as a Branch or a Goto
+// (and if a Goto, then to what: `dst` or the fallthrough block).
+enum ConditionalGotoStatus {
+  kGotoDestination = 1,  // The conditional Goto became an unconditional Goto to
+                         // the destination.
+  kGotoEliminated = 2,   // The conditional GotoIf/GotoIfNot would never be
+                         // executed and only the fallthrough path remains.
+  kBranch = 3            // The conditional Goto became a branch.
+
+  // Some examples of this:
+  //   GotoIf(true, dst)     ===> kGotoDestination
+  //   GotoIf(false, dst)    ===> kGotoEliminated
+  //   GotoIf(var, dst)      ===> kBranch
+  //   GotoIfNot(true, dst)  ===> kGotoEliminated
+  //   GotoIfNot(false, dst) ===> kGotoDestination
+  //   GotoIfNot(var, dst)   ===> kBranch
+};
+static_assert((ConditionalGotoStatus::kGotoDestination |
+               ConditionalGotoStatus::kGotoEliminated) ==
+              ConditionalGotoStatus::kBranch);
+
+class ConditionWithHint final {
+ public:
+  ConditionWithHint(
+      V<Word32> condition,
+      BranchHint hint = BranchHint::kNone)  // NOLINT(runtime/explicit)
+      : condition_(condition), hint_(hint) {}
+
+  template <typename T, typename = std::enable_if_t<std::is_same_v<T, OpIndex>>>
+  ConditionWithHint(
+      T condition,
+      BranchHint hint = BranchHint::kNone)  // NOLINT(runtime/explicit)
+      : ConditionWithHint(V<Word32>{condition}, hint) {}
+
+  V<Word32> condition() const { return condition_; }
+  BranchHint hint() const { return hint_; }
+
+ private:
+  V<Word32> condition_;
+  BranchHint hint_;
+};
 
 namespace detail {
 template <typename T, typename = void>
@@ -97,22 +149,35 @@ class LabelBase {
 
   template <typename A>
   void Goto(A& assembler, const values_t& values) {
-    RecordValues(assembler, data_, values);
+    if (assembler.generating_unreachable_operations()) return;
+    Block* current_block = assembler.current_block();
+    DCHECK_NOT_NULL(current_block);
     assembler.Goto(data_.block);
+    RecordValues(current_block, data_, values);
   }
 
   template <typename A>
   void GotoIf(A& assembler, OpIndex condition, BranchHint hint,
               const values_t& values) {
-    RecordValues(assembler, data_, values);
-    assembler.GotoIf(condition, data_.block, hint);
+    if (assembler.generating_unreachable_operations()) return;
+    Block* current_block = assembler.current_block();
+    DCHECK_NOT_NULL(current_block);
+    if (assembler.GotoIf(condition, data_.block, hint) &
+        ConditionalGotoStatus::kGotoDestination) {
+      RecordValues(current_block, data_, values);
+    }
   }
 
   template <typename A>
   void GotoIfNot(A& assembler, OpIndex condition, BranchHint hint,
                  const values_t& values) {
-    RecordValues(assembler, data_, values);
-    assembler.GotoIfNot(condition, data_.block, hint);
+    if (assembler.generating_unreachable_operations()) return;
+    Block* current_block = assembler.current_block();
+    DCHECK_NOT_NULL(current_block);
+    if (assembler.GotoIfNot(condition, data_.block, hint) &
+        ConditionalGotoStatus::kGotoDestination) {
+      RecordValues(current_block, data_, values);
+    }
   }
 
   template <typename A>
@@ -138,10 +203,8 @@ class LabelBase {
     DCHECK_NOT_NULL(data_.block);
   }
 
-  template <typename A>
-  static void RecordValues(A& assembler, BlockData& data,
+  static void RecordValues(Block* source, BlockData& data,
                            const values_t& values) {
-    Block* source = assembler.current_block();
     DCHECK_NOT_NULL(source);
     if (data.block->IsBound()) {
       // Cannot `Goto` to a bound block. If you are trying to construct a
@@ -158,9 +221,13 @@ class LabelBase {
 #ifdef DEBUG
     std::initializer_list<size_t> sizes{
         std::get<indices>(data.recorded_values).size()...};
+    // There a -1 on the PredecessorCounts below, because we've emitted the
+    // Goto/Branch before calling RecordValues (which we do because the
+    // condition of the Goto might have been constant-folded, resulting in the
+    // destination not actually being reachable).
     DCHECK(base::all_equal(
-        sizes, static_cast<size_t>(data.block->PredecessorCount())));
-    DCHECK_EQ(data.block->PredecessorCount(), data.predecessors.size());
+        sizes, static_cast<size_t>(data.block->PredecessorCount() - 1)));
+    DCHECK_EQ(data.block->PredecessorCount() - 1, data.predecessors.size());
 #endif
     (std::get<indices>(data.recorded_values)
          .push_back(std::get<indices>(values)),
@@ -223,12 +290,15 @@ class LoopLabel : public LabelBase<true, Ts...> {
 
   template <typename A>
   void Goto(A& assembler, const values_t& values) {
+    if (assembler.generating_unreachable_operations()) return;
     if (!loop_header_data_.block->IsBound()) {
       // If the loop header is not bound yet, we have the forward edge to the
       // loop.
       DCHECK_EQ(0, loop_header_data_.block->PredecessorCount());
-      super::RecordValues(assembler, loop_header_data_, values);
+      Block* current_block = assembler.current_block();
+      DCHECK_NOT_NULL(current_block);
       assembler.Goto(loop_header_data_.block);
+      super::RecordValues(current_block, loop_header_data_, values);
     } else {
       // We have a jump back to the loop header and wire it to the single
       // backedge block.
@@ -239,12 +309,17 @@ class LoopLabel : public LabelBase<true, Ts...> {
   template <typename A>
   void GotoIf(A& assembler, OpIndex condition, BranchHint hint,
               const values_t& values) {
+    if (assembler.generating_unreachable_operations()) return;
     if (!loop_header_data_.block->IsBound()) {
       // If the loop header is not bound yet, we have the forward edge to the
       // loop.
       DCHECK_EQ(0, loop_header_data_.block->PredecessorCount());
-      super::RecordValues(assembler, loop_header_data_, values);
-      assembler.GotoIf(condition, loop_header_data_.block, hint);
+      Block* current_block = assembler.current_block();
+      DCHECK_NOT_NULL(current_block);
+      if (assembler.GotoIf(condition, loop_header_data_.block, hint) &
+          ConditionalGotoStatus::kGotoDestination) {
+        super::RecordValues(current_block, loop_header_data_, values);
+      }
     } else {
       // We have a jump back to the loop header and wire it to the single
       // backedge block.
@@ -255,12 +330,17 @@ class LoopLabel : public LabelBase<true, Ts...> {
   template <typename A>
   void GotoIfNot(A& assembler, OpIndex condition, BranchHint hint,
                  const values_t& values) {
+    if (assembler.generating_unreachable_operations()) return;
     if (!loop_header_data_.block->IsBound()) {
       // If the loop header is not bound yet, we have the forward edge to the
       // loop.
       DCHECK_EQ(0, loop_header_data_.block->PredecessorCount());
-      super::RecordValues(assembler, loop_header_data_, values);
-      assembler.GotoIfNot(condition, loop_header_data_.block, hint);
+      Block* current_block = assembler.current_block();
+      DCHECK_NOT_NULL(current_block);
+      if (assembler.GotoIf(condition, loop_header_data_.block, hint) &
+          ConditionalGotoStatus::kGotoDestination) {
+        super::RecordValues(current_block, loop_header_data_, values);
+      }
     } else {
       // We have a jump back to the loop header and wire it to the single
       // backedge block.
@@ -281,8 +361,10 @@ class LoopLabel : public LabelBase<true, Ts...> {
       return std::tuple_cat(std::tuple{false}, values_t{});
     }
     DCHECK_EQ(loop_header_data_.block, assembler.current_block());
-    return std::tuple_cat(std::tuple{true},
-                          MaterializeLoopPhis(assembler, loop_header_data_));
+    values_t pending_loop_phis =
+        MaterializeLoopPhis(assembler, loop_header_data_);
+    pending_loop_phis_ = pending_loop_phis;
+    return std::tuple_cat(std::tuple{true}, pending_loop_phis);
   }
 
   template <typename A>
@@ -300,8 +382,9 @@ class LoopLabel : public LabelBase<true, Ts...> {
       auto values = base::tuple_drop<1>(bind_result);
       assembler.Goto(loop_header_data_.block);
       // Finalize Phis in the loop header.
-      FixLoopPhis(assembler, loop_header_data_, values);
+      FixLoopPhis(assembler, values);
     }
+    assembler.FinalizeLoop(loop_header_data_.block);
   }
 
  private:
@@ -321,66 +404,77 @@ class LoopLabel : public LabelBase<true, Ts...> {
     if constexpr (super::size == 0) return typename super::values_t{};
 
     DCHECK_EQ(predecessor_count, 1);
-    auto phis = typename super::values_t{
-        assembler.PendingLoopPhi(std::get<indices>(data.recorded_values)[0],
-                                 PendingLoopPhiOp::PhiIndex{indices})...};
+    auto phis = typename super::values_t{assembler.PendingLoopPhi(
+        std::get<indices>(data.recorded_values)[0])...};
     return phis;
   }
 
   template <typename A>
-  static void FixLoopPhis(A& assembler, BlockData& data,
-                          const typename super::values_t& values) {
-    DCHECK(data.block->IsBound());
-    DCHECK(data.block->IsLoop());
-    DCHECK_LE(1, data.predecessors.size());
-    DCHECK_LE(data.predecessors.size(), 2);
-    auto op_range = assembler.output_graph().operations(*data.block);
-    FixLoopPhi<0>(assembler, data, values, op_range.begin(), op_range.end());
+  void FixLoopPhis(A& assembler, const typename super::values_t& values) {
+    DCHECK(loop_header_data_.block->IsBound());
+    DCHECK(loop_header_data_.block->IsLoop());
+    DCHECK_LE(1, loop_header_data_.predecessors.size());
+    DCHECK_LE(loop_header_data_.predecessors.size(), 2);
+    FixLoopPhi<0>(assembler, values);
   }
 
   template <size_t I, typename A>
-  static void FixLoopPhi(A& assembler, BlockData& data,
-                         const typename super::values_t& values,
-                         Graph::MutableOperationIterator next,
-                         Graph::MutableOperationIterator end) {
-    if constexpr (I == std::tuple_size_v<typename super::values_t>) {
-#ifdef DEBUG
-      for (; next != end; ++next) {
-        DCHECK(!(*next).Is<PendingLoopPhiOp>());
-      }
-#endif  // DEBUG
-    } else {
-      // Find the next PendingLoopPhi.
-      for (; next != end; ++next) {
-        if (auto* pending_phi = (*next).TryCast<PendingLoopPhiOp>()) {
-          OpIndex phi_index = assembler.output_graph().Index(*pending_phi);
-          DCHECK_EQ(pending_phi->first(), std::get<I>(data.recorded_values)[0]);
-          DCHECK_EQ(I, pending_phi->data.phi_index.index);
-          assembler.output_graph().template Replace<PhiOp>(
-              phi_index,
-              base::VectorOf<OpIndex>(
-                  {pending_phi->first(), std::get<I>(values)}),
-              pending_phi->rep);
-          break;
-        }
-      }
-      // Check that we found a PendingLoopPhi. Otherwise something is wrong.
-      // Did you `Goto` to a loop header more than twice?
-      DCHECK_NE(next, end);
-      FixLoopPhi<I + 1>(assembler, data, values, ++next, end);
+  void FixLoopPhi(A& assembler, const typename super::values_t& values) {
+    if constexpr (I < std::tuple_size_v<typename super::values_t>) {
+      OpIndex phi_index = std::get<I>(*pending_loop_phis_);
+      PendingLoopPhiOp& pending_loop_phi =
+          assembler.output_graph()
+              .Get(phi_index)
+              .template Cast<PendingLoopPhiOp>();
+      DCHECK_EQ(pending_loop_phi.first(),
+                std::get<I>(loop_header_data_.recorded_values)[0]);
+      assembler.output_graph().template Replace<PhiOp>(
+          phi_index,
+          base::VectorOf<OpIndex>(
+              {pending_loop_phi.first(), std::get<I>(values)}),
+          pending_loop_phi.rep);
+      FixLoopPhi<I + 1>(assembler, values);
     }
   }
 
   BlockData loop_header_data_;
+  base::Optional<values_t> pending_loop_phis_;
 };
 
 Handle<Code> BuiltinCodeHandle(Builtin builtin, Isolate* isolate);
 
+template <typename Assembler>
+class AssemblerOpInterface;
+
+template <typename T>
+class Uninitialized {
+  static_assert(std::is_base_of_v<HeapObject, T>);
+
+ public:
+  explicit Uninitialized(V<T> object) : object_(object) {}
+
+ private:
+  template <typename Assembler>
+  friend class AssemblerOpInterface;
+
+  V<T> object() const {
+    DCHECK(object_.has_value());
+    return *object_;
+  }
+
+  V<T> ReleaseObject() {
+    DCHECK(object_.has_value());
+    auto temp = *object_;
+    object_.reset();
+    return temp;
+  }
+
+  base::Optional<V<T>> object_;
+};
+
 // Forward declarations
 template <class Assembler>
 class GraphVisitor;
-using Variable =
-    SnapshotTable<OpIndex, base::Optional<RegisterRepresentation>>::Key;
 
 template <class Assembler, template <class> class... Reducers>
 class ReducerStack {};
@@ -414,11 +508,42 @@ struct reducer_stack_type<reducer_list<Reducers...>> {
 template <typename Next>
 class ReducerBase;
 
-#define TURBOSHAFT_REDUCER_BOILERPLATE()                               \
-  Assembler<typename Next::ReducerList>& Asm() {                       \
-    return *static_cast<Assembler<typename Next::ReducerList>*>(this); \
+#define TURBOSHAFT_REDUCER_BOILERPLATE()                \
+  using ReducerList = typename Next::ReducerList;       \
+  Assembler<ReducerList>& Asm() {                       \
+    return *static_cast<Assembler<ReducerList>*>(this); \
+  }                                                     \
+  template <class T>                                    \
+  using ScopedVar = turboshaft::ScopedVariable<T, Assembler<ReducerList>>;
+
+template <class T, class Assembler>
+class ScopedVariable : Variable {
+ public:
+  explicit ScopedVariable(Assembler& assembler)
+      : Variable(assembler.NewVariable(
+            static_cast<const RegisterRepresentation&>(V<T>::rep))),
+        assembler_(assembler) {}
+  ScopedVariable(Assembler& assembler, V<T> initial_value)
+      : ScopedVariable(assembler) {
+    assembler.SetVariable(*this, initial_value);
+  }
+
+  void operator=(V<T> new_value) { assembler_.SetVariable(*this, new_value); }
+  V<T> operator*() const { return assembler_.GetVariable(*this); }
+  ScopedVariable(const ScopedVariable&) = delete;
+  ScopedVariable(ScopedVariable&&) = delete;
+  ScopedVariable& operator=(const ScopedVariable) = delete;
+  ScopedVariable& operator=(ScopedVariable&&) = delete;
+  ~ScopedVariable() {
+    // Explicitly mark the variable as invalid to avoid the creation of
+    // unnecessary loop phis.
+    assembler_.SetVariable(*this, OpIndex::Invalid());
   }
 
+ private:
+  Assembler& assembler_;
+};
+
 // LABEL_BLOCK is used in Reducers to have a single call forwarding to the next
 // reducer without change. A typical use would be:
 //
@@ -441,7 +566,9 @@ class ReducerBaseForwarder : public Next {
  public:
 #define EMIT_OP(Name)                                                    \
   OpIndex ReduceInputGraph##Name(OpIndex ig_index, const Name##Op& op) { \
-    return this->Asm().AssembleOutputGraph##Name(op);                    \
+    return MayThrow(Opcode::k##Name)                                     \
+               ? OpIndex::Invalid()                                      \
+               : this->Asm().AssembleOutputGraph##Name(op);              \
   }                                                                      \
   template <class... Args>                                               \
   OpIndex Reduce##Name(Args... args) {                                   \
@@ -452,7 +579,7 @@ class ReducerBaseForwarder : public Next {
 };
 
 // ReducerBase provides default implementations of Branch-related Operations
-// (Goto, Branch, Switch, CallAndCatchException), and takes care of updating
+// (Goto, Branch, Switch, CheckException), and takes care of updating
 // Block predecessors (and calls the Assembler to maintain split-edge form).
 // ReducerBase is always added by Assembler at the bottom of the reducer stack.
 template <class Next>
@@ -461,10 +588,6 @@ class ReducerBase : public ReducerBaseForwarder<Next> {
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
   using Base = ReducerBaseForwarder<Next>;
-  using ArgT = std::tuple<>;
-
-  template <class... Args>
-  explicit ReducerBase(const std::tuple<Args...>&) {}
 
   void Bind(Block* block) {}
 
@@ -478,14 +601,28 @@ class ReducerBase : public ReducerBaseForwarder<Next> {
     Asm().output_graph().RemoveLast();
   }
 
-  // Get, GetPredecessorValue, Set and NewFreshVariable should be overwritten by
-  // the VariableReducer. If the reducer stack has no VariableReducer, then
-  // those methods should not be called.
-  OpIndex Get(Variable) { UNREACHABLE(); }
-  OpIndex GetPredecessorValue(Variable, int) { UNREACHABLE(); }
-  void Set(Variable, OpIndex) { UNREACHABLE(); }
-  Variable NewFreshVariable(base::Optional<RegisterRepresentation>) {
-    UNREACHABLE();
+  void FixLoopPhi(const PhiOp& input_phi, OpIndex output_index,
+                  Block* output_graph_loop) {
+    if (!Asm()
+             .output_graph()
+             .Get(output_index)
+             .template Is<PendingLoopPhiOp>()) {
+      return;
+    }
+#ifdef DEBUG
+    DCHECK(output_graph_loop->Contains(output_index));
+    auto& pending_phi = Asm()
+                            .output_graph()
+                            .Get(output_index)
+                            .template Cast<PendingLoopPhiOp>();
+    DCHECK_EQ(pending_phi.rep, input_phi.rep);
+    DCHECK_EQ(pending_phi.first(), Asm().MapToNewGraph(input_phi.input(0)));
+#endif
+    Asm().output_graph().template Replace<PhiOp>(
+        output_index,
+        base::VectorOf({Asm().MapToNewGraph(input_phi.input(0)),
+                        Asm().MapToNewGraph(input_phi.input(1))}),
+        input_phi.rep);
   }
 
   OpIndex ReducePhi(base::Vector<const OpIndex> inputs,
@@ -529,20 +666,30 @@ class ReducerBase : public ReducerBaseForwarder<Next> {
     return new_opindex;
   }
 
-  OpIndex ReduceCallAndCatchException(OpIndex callee, OpIndex frame_state,
-                                      base::Vector<const OpIndex> arguments,
-                                      Block* if_success, Block* if_exception,
-                                      const TSCallDescriptor* descriptor) {
-    // {if_success} and {if_exception} should never be the same.  If we ever
-    // decide to lift this condition, then AddPredecessor and SplitEdge should
-    // be updated accordingly.
-    DCHECK_NE(if_success, if_exception);
-    Block* saved_current_block = Asm().current_block();
-    OpIndex new_opindex = Base::ReduceCallAndCatchException(
-        callee, frame_state, arguments, if_success, if_exception, descriptor);
-    Asm().AddPredecessor(saved_current_block, if_success, true);
-    Asm().AddPredecessor(saved_current_block, if_exception, true);
-    return new_opindex;
+  OpIndex ReduceCatchBlockBegin() {
+    Block* current_block = Asm().current_block();
+    if (current_block->IsBranchTarget()) {
+      DCHECK_EQ(current_block->PredecessorCount(), 1);
+      DCHECK_EQ(current_block->LastPredecessor()
+                    ->LastOperation(Asm().output_graph())
+                    .template Cast<CheckExceptionOp>()
+                    .catch_block,
+                current_block);
+      return Base::ReduceCatchBlockBegin();
+    }
+    // We are trying to emit a CatchBlockBegin into a block that used to be the
+    // catch_block successor but got edge-splitted into a merge. Therefore, we
+    // need to emit a phi now and can rely on the predecessors all having a
+    // ReduceCatchBlockBegin and nothing else.
+    DCHECK(current_block->IsMerge());
+    base::SmallVector<OpIndex, 8> phi_inputs;
+    for (Block* predecessor : current_block->Predecessors()) {
+      OpIndex catch_begin = predecessor->begin();
+      DCHECK(Asm().Get(catch_begin).template Is<CatchBlockBeginOp>());
+      phi_inputs.push_back(catch_begin);
+    }
+    return Asm().Phi(base::VectorOf(phi_inputs),
+                     RegisterRepresentation::Tagged());
   }
 
   OpIndex ReduceSwitch(OpIndex input, base::Vector<const SwitchOp::Case> cases,
@@ -567,6 +714,47 @@ class ReducerBase : public ReducerBaseForwarder<Next> {
     Asm().AddPredecessor(saved_current_block, default_case, true);
     return new_opindex;
   }
+
+  OpIndex ReduceCall(OpIndex callee, OpIndex frame_state,
+                     base::Vector<const OpIndex> arguments,
+                     const TSCallDescriptor* descriptor, OpEffects effects) {
+    OpIndex raw_call =
+        Base::ReduceCall(callee, frame_state, arguments, descriptor, effects);
+    bool has_catch_block = false;
+    if (descriptor->can_throw == CanThrow::kYes) {
+      has_catch_block = CatchIfInCatchScope(raw_call);
+    }
+    return ReduceDidntThrow(raw_call, has_catch_block, &descriptor->out_reps);
+  }
+
+ private:
+  // These reduce functions are private, as they should only be emitted
+  // automatically by `CatchIfInCatchScope` and `DoNotCatch` defined below and
+  // never explicitly.
+  using Base::ReduceDidntThrow;
+  OpIndex ReduceCheckException(OpIndex throwing_operation, Block* successor,
+                               Block* catch_block) {
+    // {successor} and {catch_block} should never be the same.  AddPredecessor
+    // and SplitEdge rely on this.
+    DCHECK_NE(successor, catch_block);
+    Block* saved_current_block = Asm().current_block();
+    OpIndex new_opindex =
+        Base::ReduceCheckException(throwing_operation, successor, catch_block);
+    Asm().AddPredecessor(saved_current_block, successor, true);
+    Asm().AddPredecessor(saved_current_block, catch_block, true);
+    return new_opindex;
+  }
+
+  bool CatchIfInCatchScope(OpIndex throwing_operation) {
+    if (Asm().current_catch_block()) {
+      Block* successor = Asm().NewBlock();
+      ReduceCheckException(throwing_operation, successor,
+                           Asm().current_catch_block());
+      Asm().BindReachable(successor);
+      return true;
+    }
+    return false;
+  }
 };
 
 template <class Assembler>
@@ -616,6 +804,7 @@ class AssemblerOpInterface {
   DECL_MULTI_REP_BINOP(WordMul, WordBinop, WordRepresentation, Mul)
   DECL_SINGLE_REP_BINOP_V(Word32Mul, WordBinop, Mul, Word32)
   DECL_SINGLE_REP_BINOP_V(Word64Mul, WordBinop, Mul, Word64)
+  DECL_SINGLE_REP_BINOP_V(WordPtrMul, WordBinop, Mul, WordPtr)
 
   DECL_MULTI_REP_BINOP(WordBitwiseAnd, WordBinop, WordRepresentation,
                        BitwiseAnd)
@@ -721,38 +910,47 @@ class AssemblerOpInterface {
     return stack().ReduceShift(left, right, kind, rep);
   }
 
+#define DECL_SINGLE_REP_SHIFT_V(name, kind, tag)                     \
+  V<tag> name(ConstOrV<tag> left, ConstOrV<Word32> right) {          \
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {  \
+      return OpIndex::Invalid();                                     \
+    }                                                                \
+    return stack().ReduceShift(resolve(left), resolve(right),        \
+                               ShiftOp::Kind::k##kind, V<tag>::rep); \
+  }
+
   DECL_MULTI_REP_BINOP(ShiftRightArithmeticShiftOutZeros, Shift,
                        WordRepresentation, ShiftRightArithmeticShiftOutZeros)
-  DECL_SINGLE_REP_BINOP_V(Word32ShiftRightArithmeticShiftOutZeros, Shift,
+  DECL_SINGLE_REP_SHIFT_V(Word32ShiftRightArithmeticShiftOutZeros,
                           ShiftRightArithmeticShiftOutZeros, Word32)
-  DECL_SINGLE_REP_BINOP_V(Word64ShiftRightArithmeticShiftOutZeros, Shift,
+  DECL_SINGLE_REP_SHIFT_V(Word64ShiftRightArithmeticShiftOutZeros,
                           ShiftRightArithmeticShiftOutZeros, Word64)
-  DECL_SINGLE_REP_BINOP_V(WordPtrShiftRightArithmeticShiftOutZeros, Shift,
+  DECL_SINGLE_REP_SHIFT_V(WordPtrShiftRightArithmeticShiftOutZeros,
                           ShiftRightArithmeticShiftOutZeros, WordPtr)
   DECL_MULTI_REP_BINOP(ShiftRightArithmetic, Shift, WordRepresentation,
                        ShiftRightArithmetic)
-  DECL_SINGLE_REP_BINOP_V(Word32ShiftRightArithmetic, Shift,
-                          ShiftRightArithmetic, Word32)
-  DECL_SINGLE_REP_BINOP_V(Word64ShiftRightArithmetic, Shift,
-                          ShiftRightArithmetic, Word64)
-  DECL_SINGLE_REP_BINOP_V(WordPtrShiftRightArithmetic, Shift,
-                          ShiftRightArithmetic, WordPtr)
-  DECL_MULTI_REP_BINOP(ShiftRightLogical, Shift, WordRepresentation,
-                       ShiftRightLogical)
-  DECL_SINGLE_REP_BINOP_V(Word32ShiftRightLogical, Shift, ShiftRightLogical,
+  DECL_SINGLE_REP_SHIFT_V(Word32ShiftRightArithmetic, ShiftRightArithmetic,
                           Word32)
-  DECL_SINGLE_REP_BINOP_V(Word64ShiftRightLogical, Shift, ShiftRightLogical,
+  DECL_SINGLE_REP_SHIFT_V(Word64ShiftRightArithmetic, ShiftRightArithmetic,
                           Word64)
+  DECL_SINGLE_REP_SHIFT_V(WordPtrShiftRightArithmetic, ShiftRightArithmetic,
+                          WordPtr)
+  DECL_MULTI_REP_BINOP(ShiftRightLogical, Shift, WordRepresentation,
+                       ShiftRightLogical)
+  DECL_SINGLE_REP_SHIFT_V(Word32ShiftRightLogical, ShiftRightLogical, Word32)
+  DECL_SINGLE_REP_SHIFT_V(Word64ShiftRightLogical, ShiftRightLogical, Word64)
+  DECL_SINGLE_REP_BINOP_V(WordPtrShiftRightLogical, Shift, ShiftRightLogical,
+                          WordPtr)
   DECL_MULTI_REP_BINOP(ShiftLeft, Shift, WordRepresentation, ShiftLeft)
-  DECL_SINGLE_REP_BINOP_V(Word32ShiftLeft, Shift, ShiftLeft, Word32)
-  DECL_SINGLE_REP_BINOP_V(Word64ShiftLeft, Shift, ShiftLeft, Word64)
-  DECL_SINGLE_REP_BINOP_V(WordPtrShiftLeft, Shift, ShiftLeft, WordPtr)
+  DECL_SINGLE_REP_SHIFT_V(Word32ShiftLeft, ShiftLeft, Word32)
+  DECL_SINGLE_REP_SHIFT_V(Word64ShiftLeft, ShiftLeft, Word64)
+  DECL_SINGLE_REP_SHIFT_V(WordPtrShiftLeft, ShiftLeft, WordPtr)
   DECL_MULTI_REP_BINOP(RotateRight, Shift, WordRepresentation, RotateRight)
-  DECL_SINGLE_REP_BINOP_V(Word32RotateRight, Shift, RotateRight, Word32)
-  DECL_SINGLE_REP_BINOP_V(Word64RotateRight, Shift, RotateRight, Word64)
+  DECL_SINGLE_REP_SHIFT_V(Word32RotateRight, RotateRight, Word32)
+  DECL_SINGLE_REP_SHIFT_V(Word64RotateRight, RotateRight, Word64)
   DECL_MULTI_REP_BINOP(RotateLeft, Shift, WordRepresentation, RotateLeft)
-  DECL_SINGLE_REP_BINOP_V(Word32RotateLeft, Shift, RotateLeft, Word32)
-  DECL_SINGLE_REP_BINOP_V(Word64RotateLeft, Shift, RotateLeft, Word64)
+  DECL_SINGLE_REP_SHIFT_V(Word32RotateLeft, RotateLeft, Word32)
+  DECL_SINGLE_REP_SHIFT_V(Word64RotateLeft, RotateLeft, Word64)
 
   OpIndex ShiftRightLogical(OpIndex left, uint32_t right,
                             WordRepresentation rep) {
@@ -969,12 +1167,13 @@ class AssemblerOpInterface {
 #undef DECL_SINGLE_REP_UNARY_V
 #undef DECL_MULTI_REP_UNARY
 
-  OpIndex Float64InsertWord32(OpIndex float64, OpIndex word32,
-                              Float64InsertWord32Op::Kind kind) {
+  V<Float64> BitcastWord32PairToFloat64(ConstOrV<Word32> high_word32,
+                                        ConstOrV<Word32> low_word32) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceFloat64InsertWord32(float64, word32, kind);
+    return stack().ReduceBitcastWord32PairToFloat64(resolve(high_word32),
+                                                    resolve(low_word32));
   }
 
   OpIndex TaggedBitcast(OpIndex input, RegisterRepresentation from,
@@ -984,95 +1183,172 @@ class AssemblerOpInterface {
     }
     return stack().ReduceTaggedBitcast(input, from, to);
   }
-  OpIndex BitcastTaggedToWord(OpIndex tagged) {
+  V<WordPtr> BitcastTaggedToWord(V<Object> tagged) {
     return TaggedBitcast(tagged, RegisterRepresentation::Tagged(),
                          RegisterRepresentation::PointerSized());
   }
-  OpIndex BitcastWordToTagged(OpIndex word) {
+  V<Object> BitcastWordPtrToTagged(V<WordPtr> word) {
     return TaggedBitcast(word, RegisterRepresentation::PointerSized(),
                          RegisterRepresentation::Tagged());
   }
+  V<Object> BitcastWord32ToTagged(V<Word32> word) {
+    return TaggedBitcast(word, RegisterRepresentation::Word32(),
+                         RegisterRepresentation::Tagged());
+  }
 
-  OpIndex ObjectIs(OpIndex input, ObjectIsOp::Kind kind,
-                   ObjectIsOp::InputAssumptions input_assumptions) {
+  V<Word32> ObjectIs(V<Object> input, ObjectIsOp::Kind kind,
+                     ObjectIsOp::InputAssumptions input_assumptions) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return stack().ReduceObjectIs(input, kind, input_assumptions);
   }
-  OpIndex FloatIs(OpIndex input, FloatIsOp::Kind kind,
-                  FloatRepresentation input_rep) {
+  V<Word32> ObjectIsSmi(V<Object> object) {
+    return ObjectIs(object, ObjectIsOp::Kind::kSmi,
+                    ObjectIsOp::InputAssumptions::kNone);
+  }
+
+  V<Word32> FloatIs(OpIndex input, NumericKind kind,
+                    FloatRepresentation input_rep) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return stack().ReduceFloatIs(input, kind, input_rep);
   }
-  V<Word32> ObjectIsSmi(V<Tagged> object) {
-    return ObjectIs(object, ObjectIsOp::Kind::kSmi,
-                    ObjectIsOp::InputAssumptions::kNone);
+  V<Word32> Float64IsNaN(V<Float64> input) {
+    return FloatIs(input, NumericKind::kNaN, FloatRepresentation::Float64());
+  }
+
+  OpIndex ObjectIsNumericValue(OpIndex input, NumericKind kind,
+                               FloatRepresentation input_rep) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceObjectIsNumericValue(input, kind, input_rep);
+  }
+
+  V<Object> Convert(V<Object> input, ConvertOp::Kind from, ConvertOp::Kind to) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceConvert(input, from, to);
+  }
+  V<Number> ConvertPlainPrimitiveToNumber(V<PlainPrimitive> input) {
+    return V<Number>::Cast(Convert(input, ConvertOp::Kind::kPlainPrimitive,
+                                   ConvertOp::Kind::kNumber));
+  }
+  V<Boolean> ConvertToBoolean(V<Object> input) {
+    return V<Boolean>::Cast(
+        Convert(input, ConvertOp::Kind::kObject, ConvertOp::Kind::kBoolean));
+  }
+  V<String> ConvertNumberToString(V<Number> input) {
+    return V<String>::Cast(
+        Convert(input, ConvertOp::Kind::kNumber, ConvertOp::Kind::kString));
+  }
+  V<Number> ConvertStringToNumber(V<String> input) {
+    return V<Number>::Cast(
+        Convert(input, ConvertOp::Kind::kString, ConvertOp::Kind::kNumber));
   }
 
-  OpIndex ConvertToObject(
-      OpIndex input, ConvertToObjectOp::Kind kind,
+  V<Object> ConvertUntaggedToJSPrimitive(
+      OpIndex input, ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind kind,
       RegisterRepresentation input_rep,
-      ConvertToObjectOp::InputInterpretation input_interpretation,
+      ConvertUntaggedToJSPrimitiveOp::InputInterpretation input_interpretation,
       CheckForMinusZeroMode minus_zero_mode) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceConvertToObject(input, kind, input_rep,
-                                         input_interpretation, minus_zero_mode);
+    return stack().ReduceConvertUntaggedToJSPrimitive(
+        input, kind, input_rep, input_interpretation, minus_zero_mode);
   }
-  V<Tagged> ConvertFloat64ToNumber(V<Float64> input,
+#define CONVERT_PRIMITIVE_TO_OBJECT(name, kind, input_rep,               \
+                                    input_interpretation)                \
+  V<kind> name(V<input_rep> input) {                                     \
+    return V<kind>::Cast(ConvertUntaggedToJSPrimitive(                   \
+        input, ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::k##kind, \
+        RegisterRepresentation::input_rep(),                             \
+        ConvertUntaggedToJSPrimitiveOp::InputInterpretation::            \
+            k##input_interpretation,                                     \
+        CheckForMinusZeroMode::kDontCheckForMinusZero));                 \
+  }
+  CONVERT_PRIMITIVE_TO_OBJECT(ConvertInt32ToNumber, Number, Word32, Signed)
+  CONVERT_PRIMITIVE_TO_OBJECT(ConvertUint32ToNumber, Number, Word32, Unsigned)
+  CONVERT_PRIMITIVE_TO_OBJECT(ConvertWord32ToBoolean, Boolean, Word32, Signed)
+#undef CONVERT_PRIMITIVE_TO_OBJECT
+  V<Number> ConvertFloat64ToNumber(V<Float64> input,
                                    CheckForMinusZeroMode minus_zero_mode) {
-    return ConvertToObject(input, ConvertToObjectOp::Kind::kNumber,
-                           RegisterRepresentation::Float64(),
-                           ConvertToObjectOp::InputInterpretation::kSigned,
-                           minus_zero_mode);
+    return V<Number>::Cast(ConvertUntaggedToJSPrimitive(
+        input, ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kNumber,
+        RegisterRepresentation::Float64(),
+        ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned,
+        minus_zero_mode));
   }
 
-  OpIndex ConvertToObjectOrDeopt(
-      OpIndex input, OpIndex frame_state, ConvertToObjectOrDeoptOp::Kind kind,
+  OpIndex ConvertUntaggedToJSPrimitiveOrDeopt(
+      OpIndex input, OpIndex frame_state,
+      ConvertUntaggedToJSPrimitiveOrDeoptOp::JSPrimitiveKind kind,
       RegisterRepresentation input_rep,
-      ConvertToObjectOrDeoptOp::InputInterpretation input_interpretation,
+      ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation
+          input_interpretation,
       const FeedbackSource& feedback) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceConvertToObjectOrDeopt(
+    return stack().ReduceConvertUntaggedToJSPrimitiveOrDeopt(
         input, frame_state, kind, input_rep, input_interpretation, feedback);
   }
 
-  OpIndex ConvertObjectToPrimitive(
-      V<Object> object, ConvertObjectToPrimitiveOp::Kind kind,
-      ConvertObjectToPrimitiveOp::InputAssumptions input_assumptions) {
+  OpIndex ConvertJSPrimitiveToUntagged(
+      V<Object> object, ConvertJSPrimitiveToUntaggedOp::UntaggedKind kind,
+      ConvertJSPrimitiveToUntaggedOp::InputAssumptions input_assumptions) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceConvertObjectToPrimitive(object, kind,
-                                                  input_assumptions);
+    return stack().ReduceConvertJSPrimitiveToUntagged(object, kind,
+                                                      input_assumptions);
   }
 
-  OpIndex ConvertObjectToPrimitiveOrDeopt(
+  OpIndex ConvertJSPrimitiveToUntaggedOrDeopt(
       V<Object> object, OpIndex frame_state,
-      ConvertObjectToPrimitiveOrDeoptOp::ObjectKind from_kind,
-      ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind to_kind,
+      ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind from_kind,
+      ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind to_kind,
       CheckForMinusZeroMode minus_zero_mode, const FeedbackSource& feedback) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceConvertObjectToPrimitiveOrDeopt(
+    return stack().ReduceConvertJSPrimitiveToUntaggedOrDeopt(
         object, frame_state, from_kind, to_kind, minus_zero_mode, feedback);
   }
 
-  OpIndex TruncateObjectToPrimitive(
-      V<Object> object, TruncateObjectToPrimitiveOp::Kind kind,
-      TruncateObjectToPrimitiveOp::InputAssumptions input_assumptions) {
+  OpIndex TruncateJSPrimitiveToUntagged(
+      V<Object> object, TruncateJSPrimitiveToUntaggedOp::UntaggedKind kind,
+      TruncateJSPrimitiveToUntaggedOp::InputAssumptions input_assumptions) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceTruncateJSPrimitiveToUntagged(object, kind,
+                                                       input_assumptions);
+  }
+
+  OpIndex TruncateJSPrimitiveToUntaggedOrDeopt(
+      V<Object> object, OpIndex frame_state,
+      TruncateJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind kind,
+      TruncateJSPrimitiveToUntaggedOrDeoptOp::InputRequirement
+          input_requirement,
+      const FeedbackSource& feedback) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceTruncateJSPrimitiveToUntaggedOrDeopt(
+        object, frame_state, kind, input_requirement, feedback);
+  }
+
+  V<Object> ConvertJSPrimitiveToObject(V<Object> value, V<Object> global_proxy,
+                                       ConvertReceiverMode mode) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceTruncateObjectToPrimitive(object, kind,
-                                                   input_assumptions);
+    return stack().ReduceConvertJSPrimitiveToObject(value, global_proxy, mode);
   }
 
   V<Word32> Word32Constant(uint32_t value) {
@@ -1101,20 +1377,23 @@ class AssemblerOpInterface {
         return Word64Constant(value);
     }
   }
-  OpIndex IntPtrConstant(intptr_t value) {
+  V<WordPtr> IntPtrConstant(intptr_t value) {
     return UintPtrConstant(static_cast<uintptr_t>(value));
   }
-  OpIndex UintPtrConstant(uintptr_t value) {
+  V<WordPtr> UintPtrConstant(uintptr_t value) {
     return WordConstant(static_cast<uint64_t>(value),
                         WordRepresentation::PointerSized());
   }
-  OpIndex Float32Constant(float value) {
+  V<Object> SmiConstant(i::Tagged<Smi> value) {
+    return V<Smi>::Cast(UintPtrConstant(value.ptr()));
+  }
+  V<Float32> Float32Constant(float value) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return stack().ReduceConstant(ConstantOp::Kind::kFloat32, value);
   }
-  OpIndex Float64Constant(double value) {
+  V<Float64> Float64Constant(double value) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
@@ -1141,13 +1420,16 @@ class AssemblerOpInterface {
     return stack().ReduceConstant(ConstantOp::Kind::kTaggedIndex,
                                   uint64_t{static_cast<uint32_t>(value)});
   }
-  OpIndex HeapConstant(Handle<HeapObject> value) {
+  template <typename T,
+            typename = std::enable_if_t<std::is_base_of_v<HeapObject, T>>>
+  V<T> HeapConstant(Handle<T> value) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceConstant(ConstantOp::Kind::kHeapObject, value);
+    return stack().ReduceConstant(ConstantOp::Kind::kHeapObject,
+                                  ConstantOp::Storage{value});
   }
-  OpIndex BuiltinCode(Builtin builtin, Isolate* isolate) {
+  V<Code> BuiltinCode(Builtin builtin, Isolate* isolate) {
     return HeapConstant(BuiltinCodeHandle(builtin, isolate));
   }
   OpIndex CompressedHeapConstant(Handle<HeapObject> value) {
@@ -1162,7 +1444,7 @@ class AssemblerOpInterface {
     }
     return stack().ReduceConstant(ConstantOp::Kind::kExternal, value);
   }
-  OpIndex RelocatableConstant(int64_t value, RelocInfo::Mode mode) {
+  V<WordPtr> RelocatableConstant(int64_t value, RelocInfo::Mode mode) {
     DCHECK_EQ(mode, any_of(RelocInfo::WASM_CALL, RelocInfo::WASM_STUB_CALL));
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
@@ -1174,7 +1456,7 @@ class AssemblerOpInterface {
         static_cast<uint64_t>(value));
   }
   V<Context> NoContextConstant() {
-    return V<Context>::Cast(SmiTag(Context::kNoContext));
+    return V<Context>::Cast(TagSmi(Context::kNoContext));
   }
   // TODO(nicohartmann@): Might want to get rid of the isolate when supporting
   // Wasm.
@@ -1196,15 +1478,6 @@ class AssemblerOpInterface {
     return HeapConstant(cached_centry_stub_constants_[index].ToHandleChecked());
   }
 
-#define DECL_CHANGE(name, kind, assumption, from, to)                  \
-  OpIndex name(OpIndex input) {                                        \
-    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {    \
-      return OpIndex::Invalid();                                       \
-    }                                                                  \
-    return stack().ReduceChange(                                       \
-        input, ChangeOp::Kind::kind, ChangeOp::Assumption::assumption, \
-        RegisterRepresentation::from(), RegisterRepresentation::to()); \
-  }
 #define DECL_CHANGE_V(name, kind, assumption, from, to)               \
   V<to> name(ConstOrV<from> input) {                                  \
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {   \
@@ -1214,8 +1487,8 @@ class AssemblerOpInterface {
                                 ChangeOp::Assumption::assumption,     \
                                 V<from>::rep, V<to>::rep);            \
   }
-#define DECL_TRY_CHANGE(name, kind, from, to)                       \
-  OpIndex name(OpIndex input) {                                     \
+#define DECL_TRY_CHANGE_V(name, kind, from, to)                     \
+  V<to> name(V<from> input) {                                       \
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) { \
       return OpIndex::Invalid();                                    \
     }                                                               \
@@ -1262,6 +1535,21 @@ class AssemblerOpInterface {
                 Float32, Float64)
   DECL_CHANGE_V(JSTruncateFloat64ToWord32, kJSFloatTruncate, kNoAssumption,
                 Float64, Word32)
+  DECL_CHANGE_V(TruncateWord64ToWord32, kTruncate, kNoAssumption, Word64,
+                Word32)
+  OpIndex ZeroExtendWord32ToRep(V<Word32> value, WordRepresentation rep) {
+    if (rep == WordRepresentation::Word32()) return value;
+    DCHECK_EQ(rep, WordRepresentation::Word64());
+    return ChangeUint32ToUint64(value);
+  }
+  V<Word32> TruncateWordPtrToWord32(ConstOrV<WordPtr> input) {
+    if constexpr (Is64()) {
+      return TruncateWord64ToWord32(input);
+    } else {
+      DCHECK_EQ(WordPtr::bits, Word32::bits);
+      return V<Word32>::Cast(resolve(input));
+    }
+  }
   V<WordPtr> ChangeInt32ToIntPtr(V<Word32> input) {
     if constexpr (Is64()) {
       return ChangeInt32ToInt64(input);
@@ -1279,33 +1567,66 @@ class AssemblerOpInterface {
     }
   }
 
-#define DECL_SIGNED_FLOAT_TRUNCATE(FloatBits, ResultBits)                     \
-  DECL_CHANGE(TruncateFloat##FloatBits##ToInt##ResultBits##OverflowUndefined, \
-              kSignedFloatTruncateOverflowToMin, kNoOverflow,                 \
-              Float##FloatBits, Word##ResultBits)                             \
-  DECL_CHANGE(TruncateFloat##FloatBits##ToInt##ResultBits##OverflowToMin,     \
-              kSignedFloatTruncateOverflowToMin, kNoAssumption,               \
-              Float##FloatBits, Word##ResultBits)                             \
-  DECL_TRY_CHANGE(TryTruncateFloat##FloatBits##ToInt##ResultBits,             \
-                  kSignedFloatTruncateOverflowUndefined, Float##FloatBits,    \
-                  Word##ResultBits)
+  V<Word64> ChangeIntPtrToInt64(V<WordPtr> input) {
+    if constexpr (Is64()) {
+      DCHECK_EQ(WordPtr::bits, Word64::bits);
+      return V<Word64>::Cast(input);
+    } else {
+      return ChangeInt32ToInt64(input);
+    }
+  }
+
+  V<Word64> ChangeUintPtrToUint64(V<WordPtr> input) {
+    if constexpr (Is64()) {
+      DCHECK_EQ(WordPtr::bits, Word64::bits);
+      return V<Word64>::Cast(input);
+    } else {
+      return ChangeUint32ToUint64(input);
+    }
+  }
+
+  V<Word32> IsSmi(V<Tagged> object) {
+    if constexpr (COMPRESS_POINTERS_BOOL) {
+      return Word32Equal(Word32BitwiseAnd(V<Word32>::Cast(object), kSmiTagMask),
+                         kSmiTag);
+    } else {
+      return WordPtrEqual(
+          WordPtrBitwiseAnd(V<WordPtr>::Cast(object), kSmiTagMask), kSmiTag);
+    }
+  }
+
+#define DECL_SIGNED_FLOAT_TRUNCATE(FloatBits, ResultBits)                    \
+  DECL_CHANGE_V(                                                             \
+      TruncateFloat##FloatBits##ToInt##ResultBits##OverflowUndefined,        \
+      kSignedFloatTruncateOverflowToMin, kNoOverflow, Float##FloatBits,      \
+      Word##ResultBits)                                                      \
+  DECL_TRY_CHANGE_V(TryTruncateFloat##FloatBits##ToInt##ResultBits,          \
+                    kSignedFloatTruncateOverflowUndefined, Float##FloatBits, \
+                    Word##ResultBits)
 
   DECL_SIGNED_FLOAT_TRUNCATE(64, 64)
   DECL_SIGNED_FLOAT_TRUNCATE(64, 32)
   DECL_SIGNED_FLOAT_TRUNCATE(32, 64)
   DECL_SIGNED_FLOAT_TRUNCATE(32, 32)
 #undef DECL_SIGNED_FLOAT_TRUNCATE
+  DECL_CHANGE_V(TruncateFloat64ToInt64OverflowToMin,
+                kSignedFloatTruncateOverflowToMin, kNoAssumption, Float64,
+                Word64)
+  DECL_CHANGE_V(TruncateFloat32ToInt32OverflowToMin,
+                kSignedFloatTruncateOverflowToMin, kNoAssumption, Float32,
+                Word32)
 
 #define DECL_UNSIGNED_FLOAT_TRUNCATE(FloatBits, ResultBits)                    \
-  DECL_CHANGE(TruncateFloat##FloatBits##ToUint##ResultBits##OverflowUndefined, \
-              kUnsignedFloatTruncateOverflowToMin, kNoOverflow,                \
-              Float##FloatBits, Word##ResultBits)                              \
-  DECL_CHANGE(TruncateFloat##FloatBits##ToUint##ResultBits##OverflowToMin,     \
-              kUnsignedFloatTruncateOverflowToMin, kNoAssumption,              \
-              Float##FloatBits, Word##ResultBits)                              \
-  DECL_TRY_CHANGE(TryTruncateFloat##FloatBits##ToUint##ResultBits,             \
-                  kUnsignedFloatTruncateOverflowUndefined, Float##FloatBits,   \
-                  Word##ResultBits)
+  DECL_CHANGE_V(                                                               \
+      TruncateFloat##FloatBits##ToUint##ResultBits##OverflowUndefined,         \
+      kUnsignedFloatTruncateOverflowToMin, kNoOverflow, Float##FloatBits,      \
+      Word##ResultBits)                                                        \
+  DECL_CHANGE_V(TruncateFloat##FloatBits##ToUint##ResultBits##OverflowToMin,   \
+                kUnsignedFloatTruncateOverflowToMin, kNoAssumption,            \
+                Float##FloatBits, Word##ResultBits)                            \
+  DECL_TRY_CHANGE_V(TryTruncateFloat##FloatBits##ToUint##ResultBits,           \
+                    kUnsignedFloatTruncateOverflowUndefined, Float##FloatBits, \
+                    Word##ResultBits)
 
   DECL_UNSIGNED_FLOAT_TRUNCATE(64, 64)
   DECL_UNSIGNED_FLOAT_TRUNCATE(64, 32)
@@ -1325,9 +1646,8 @@ class AssemblerOpInterface {
                 Float64, Word32)
   DECL_CHANGE_V(Float64ExtractHighWord32, kExtractHighHalf, kNoAssumption,
                 Float64, Word32)
-#undef DECL_CHANGE
 #undef DECL_CHANGE_V
-#undef DECL_TRY_CHANGE
+#undef DECL_TRY_CHANGE_V
 
   OpIndex ChangeOrDeopt(OpIndex input, OpIndex frame_state,
                         ChangeOrDeoptOp::Kind kind,
@@ -1355,36 +1675,86 @@ class AssemblerOpInterface {
                          minus_zero_mode, feedback);
   }
 
-  OpIndex Tag(OpIndex input, TagKind kind) {
+  V<Smi> TagSmi(ConstOrV<Word32> input) {
+    constexpr int kSmiShiftBits = kSmiShiftSize + kSmiTagSize;
+    // Do shift on 32bit values if Smis are stored in the lower word.
+    if constexpr (Is64() && SmiValuesAre31Bits()) {
+      V<Word32> shifted = Word32ShiftLeft(resolve(input), kSmiShiftBits);
+      // In pointer compression, we smi-corrupt. Then, the upper bits are not
+      // important.
+      return V<Smi>::Cast(
+          COMPRESS_POINTERS_BOOL
+              ? BitcastWord32ToTagged(shifted)
+              : BitcastWordPtrToTagged(ChangeInt32ToIntPtr(shifted)));
+    } else {
+      return V<Smi>::Cast(BitcastWordPtrToTagged(WordPtrShiftLeft(
+          ChangeInt32ToIntPtr(resolve(input)), kSmiShiftBits)));
+    }
+  }
+
+  V<Word32> UntagSmi(V<Tagged> input) {
+    constexpr int kSmiShiftBits = kSmiShiftSize + kSmiTagSize;
+    if constexpr (Is64() && SmiValuesAre31Bits()) {
+      return Word32ShiftRightArithmeticShiftOutZeros(
+          TruncateWordPtrToWord32(BitcastTaggedToWord(input)), kSmiShiftBits);
+    }
+    return TruncateWordPtrToWord32(WordPtrShiftRightArithmeticShiftOutZeros(
+        BitcastTaggedToWord(input), kSmiShiftBits));
+  }
+
+  OpIndex AtomicRMW(V<WordPtr> base, V<WordPtr> index, OpIndex value,
+                    AtomicRMWOp::BinOp bin_op,
+                    RegisterRepresentation result_rep,
+                    MemoryRepresentation input_rep,
+                    MemoryAccessKind memory_access_kind) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceTag(input, kind);
-  }
-  V<Smi> SmiTag(ConstOrV<Word32> input) {
-    return Tag(resolve(input), TagKind::kSmiTag);
+    return stack().ReduceAtomicRMW(base, index, value, OpIndex::Invalid(),
+                                   bin_op, result_rep, input_rep,
+                                   memory_access_kind);
   }
 
-  OpIndex Untag(OpIndex input, TagKind kind, RegisterRepresentation rep) {
+  OpIndex AtomicCompareExchange(V<WordPtr> base, V<WordPtr> index,
+                                OpIndex expected, OpIndex new_value,
+                                RegisterRepresentation result_rep,
+                                MemoryRepresentation input_rep,
+                                MemoryAccessKind memory_access_kind) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceUntag(input, kind, rep);
+    return stack().ReduceAtomicRMW(base, index, new_value, expected,
+                                   AtomicRMWOp::BinOp::kCompareExchange,
+                                   result_rep, input_rep, memory_access_kind);
   }
-  V<Word32> SmiUntag(V<Tagged> input) {
-    return Untag(input, TagKind::kSmiTag, RegisterRepresentation::Word32());
+
+  OpIndex AtomicWord32Pair(V<WordPtr> base, V<WordPtr> index,
+                           V<Word32> value_low, V<Word32> value_high,
+                           V<Word32> expected_low, V<Word32> expected_high,
+                           AtomicWord32PairOp::OpKind op_kind, int32_t offset) {
+    return stack().ReduceAtomicWord32Pair(base, index, value_low, value_high,
+                                          expected_low, expected_high, op_kind,
+                                          offset);
   }
 
   OpIndex Load(OpIndex base, OpIndex index, LoadOp::Kind kind,
-               MemoryRepresentation loaded_rep, int32_t offset = 0,
+               MemoryRepresentation loaded_rep,
+               RegisterRepresentation result_rep, int32_t offset = 0,
                uint8_t element_size_log2 = 0) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceLoad(base, index, kind, loaded_rep,
-                              loaded_rep.ToRegisterRepresentation(), offset,
+    return stack().ReduceLoad(base, index, kind, loaded_rep, result_rep, offset,
                               element_size_log2);
   }
+
+  OpIndex Load(OpIndex base, OpIndex index, LoadOp::Kind kind,
+               MemoryRepresentation loaded_rep, int32_t offset = 0,
+               uint8_t element_size_log2 = 0) {
+    return Load(base, index, kind, loaded_rep,
+                loaded_rep.ToRegisterRepresentation(), offset,
+                element_size_log2);
+  }
   OpIndex Load(OpIndex base, LoadOp::Kind kind, MemoryRepresentation loaded_rep,
                int32_t offset = 0) {
     return Load(base, OpIndex::Invalid(), kind, loaded_rep, offset);
@@ -1404,19 +1774,32 @@ class AssemblerOpInterface {
 
   void Store(OpIndex base, OpIndex index, OpIndex value, StoreOp::Kind kind,
              MemoryRepresentation stored_rep, WriteBarrierKind write_barrier,
-             int32_t offset = 0, uint8_t element_size_log2 = 0) {
+             int32_t offset = 0, uint8_t element_size_log2 = 0,
+             bool maybe_initializing_or_transitioning = false) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return;
     }
     stack().ReduceStore(base, index, value, kind, stored_rep, write_barrier,
-                        offset, element_size_log2);
+                        offset, element_size_log2,
+                        maybe_initializing_or_transitioning);
   }
   void Store(OpIndex base, OpIndex value, StoreOp::Kind kind,
              MemoryRepresentation stored_rep, WriteBarrierKind write_barrier,
-             int32_t offset = 0) {
+             int32_t offset = 0,
+             bool maybe_initializing_or_transitioning = false) {
     Store(base, OpIndex::Invalid(), value, kind, stored_rep, write_barrier,
-          offset);
+          offset, 0, maybe_initializing_or_transitioning);
+  }
+
+  template <typename T>
+  void Initialize(Uninitialized<T>& object, OpIndex value,
+                  MemoryRepresentation stored_rep,
+                  WriteBarrierKind write_barrier, int32_t offset = 0) {
+    return Store(object.object(), value,
+                 StoreOp::Kind::Aligned(BaseTaggedness::kTaggedBase),
+                 stored_rep, write_barrier, offset, true);
   }
+
   void StoreOffHeap(OpIndex address, OpIndex value, MemoryRepresentation rep,
                     int32_t offset = 0) {
     Store(address, value, StoreOp::Kind::RawAligned(), rep,
@@ -1428,8 +1811,14 @@ class AssemblerOpInterface {
           WriteBarrierKind::kNoWriteBarrier, offset, rep.SizeInBytesLog2());
   }
 
-  template <typename Rep = Any>
-  V<Rep> LoadField(V<Tagged> object, const FieldAccess& access) {
+  template <typename Rep = Any, typename Base>
+  V<Rep> LoadField(V<Base> object, const FieldAccess& access) {
+    if constexpr (std::is_base_of_v<Object, Base>) {
+      DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kTaggedBase);
+    } else {
+      static_assert(std::is_same_v<Base, WordPtr>);
+      DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kUntaggedBase);
+    }
     MachineType machine_type = access.machine_type;
     if (machine_type.IsMapWord()) {
       machine_type = MachineType::TaggedPointer();
@@ -1463,11 +1852,36 @@ class AssemblerOpInterface {
     return value;
   }
 
+  // Helpers to read the most common fields.
+  // TODO(nicohartmann@): Strengthen this to `V<HeapObject>`.
   V<Map> LoadMapField(V<Object> object) {
     return LoadField<Map>(object, AccessBuilder::ForMap());
   }
+  V<Word32> LoadInstanceTypeField(V<Map> map) {
+    return LoadField<Word32>(map, AccessBuilder::ForMapInstanceType());
+  }
+
+  template <typename Base>
+  void StoreField(V<Base> object, const FieldAccess& access, V<Any> value) {
+    StoreFieldImpl(object, access, value,
+                   access.maybe_initializing_or_transitioning_store);
+  }
+
+  template <typename T>
+  void InitializeField(Uninitialized<T>& object, const FieldAccess& access,
+                       V<Any> value) {
+    StoreFieldImpl(object.object(), access, value, true);
+  }
 
-  void StoreField(V<Tagged> object, const FieldAccess& access, V<Any> value) {
+  template <typename Base>
+  void StoreFieldImpl(V<Base> object, const FieldAccess& access, V<Any> value,
+                      bool maybe_initializing_or_transitioning) {
+    if constexpr (std::is_base_of_v<Object, Base>) {
+      DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kTaggedBase);
+    } else {
+      static_assert(std::is_same_v<Base, WordPtr>);
+      DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kUntaggedBase);
+    }
     // External pointer must never be stored by optimized code.
     DCHECK(!access.type.Is(compiler::Type::ExternalPointer()) ||
            !V8_ENABLE_SANDBOX_BOOL);
@@ -1491,37 +1905,48 @@ class AssemblerOpInterface {
     }
     MemoryRepresentation rep =
         MemoryRepresentation::FromMachineType(machine_type);
-    Store(object, value, kind, rep, access.write_barrier_kind, access.offset);
+    Store(object, value, kind, rep, access.write_barrier_kind, access.offset,
+          maybe_initializing_or_transitioning);
   }
 
-  template <typename Rep = Any>
-  V<Rep> LoadElement(V<Tagged> object, const ElementAccess& access,
-                     V<WordPtr> index) {
-    DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kTaggedBase);
-    LoadOp::Kind kind = LoadOp::Kind::Aligned(access.base_is_tagged);
-    MemoryRepresentation rep =
-        MemoryRepresentation::FromMachineType(access.machine_type);
-    return Load(object, index, kind, rep, access.header_size,
-                rep.SizeInBytesLog2());
+  template <typename T = Any, typename Base>
+  V<T> LoadArrayBufferElement(V<Base> object, const ElementAccess& access,
+                              V<WordPtr> index) {
+    return LoadElement<T>(object, access, index, true);
+  }
+  template <typename T = Any, typename Base>
+  V<T> LoadNonArrayBufferElement(V<Base> object, const ElementAccess& access,
+                                 V<WordPtr> index) {
+    return LoadElement<T>(object, access, index, false);
   }
 
-  void StoreElement(V<Tagged> object, const ElementAccess& access,
-                    V<WordPtr> index, V<Any> value) {
-    DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kTaggedBase);
-    LoadOp::Kind kind = LoadOp::Kind::Aligned(access.base_is_tagged);
-    MemoryRepresentation rep =
-        MemoryRepresentation::FromMachineType(access.machine_type);
-    Store(object, index, value, kind, rep, access.write_barrier_kind,
-          access.header_size, rep.SizeInBytesLog2());
+  template <typename Base>
+  void StoreArrayBufferElement(V<Base> object, const ElementAccess& access,
+                               V<WordPtr> index, V<Any> value) {
+    return StoreElement(object, access, index, value, true);
+  }
+  template <typename Base>
+  void StoreNonArrayBufferElement(V<Base> object, const ElementAccess& access,
+                                  V<WordPtr> index, V<Any> value) {
+    return StoreElement(object, access, index, value, false);
   }
 
-  V<Tagged> Allocate(
-      V<WordPtr> size, AllocationType type,
-      AllowLargeObjects allow_large_objects = AllowLargeObjects::kFalse) {
+  template <typename T = HeapObject>
+  Uninitialized<T> Allocate(ConstOrV<WordPtr> size, AllocationType type) {
+    static_assert(std::is_base_of_v<HeapObject, T>);
+    DCHECK(!in_object_initialization_);
+    in_object_initialization_ = true;
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
-      return OpIndex::Invalid();
+      return Uninitialized<T>(OpIndex::Invalid());
     }
-    return stack().ReduceAllocate(size, type, allow_large_objects);
+    return Uninitialized<T>{stack().ReduceAllocate(resolve(size), type)};
+  }
+
+  template <typename T>
+  V<T> FinishInitialization(Uninitialized<T>&& uninitialized) {
+    DCHECK(in_object_initialization_);
+    in_object_initialization_ = false;
+    return uninitialized.ReleaseObject();
   }
 
   OpIndex DecodeExternalPointer(OpIndex handle, ExternalPointerTag tag) {
@@ -1566,13 +1991,20 @@ class AssemblerOpInterface {
         FrameConstantOp::Kind::kParentFramePointer);
   }
 
-  OpIndex StackSlot(int size, int alignment) {
+  V<WordPtr> StackSlot(int size, int alignment) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return stack().ReduceStackSlot(size, alignment);
   }
 
+  OpIndex LoadRootRegister() {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceLoadRootRegister();
+  }
+
   void Goto(Block* destination) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return;
@@ -1586,6 +2018,9 @@ class AssemblerOpInterface {
     }
     stack().ReduceBranch(condition, if_true, if_false, hint);
   }
+  void Branch(ConditionWithHint condition, Block* if_true, Block* if_false) {
+    return Branch(condition.condition(), if_true, if_false, condition.hint());
+  }
   OpIndex Select(OpIndex cond, OpIndex vtrue, OpIndex vfalse,
                  RegisterRepresentation rep, BranchHint hint,
                  SelectOp::Implementation implem) {
@@ -1594,6 +2029,13 @@ class AssemblerOpInterface {
     }
     return stack().ReduceSelect(cond, vtrue, vfalse, rep, hint, implem);
   }
+  template <typename T, typename U>
+  V<std::common_type_t<T, U>> Conditional(V<Word32> cond, V<T> vtrue,
+                                          V<U> vfalse,
+                                          BranchHint hint = BranchHint::kNone) {
+    return Select(cond, vtrue, vfalse, V<std::common_type_t<T, U>>::rep, hint,
+                  SelectOp::Implementation::kBranch);
+  }
   void Switch(OpIndex input, base::Vector<const SwitchOp::Case> cases,
               Block* default_case,
               BranchHint default_hint = BranchHint::kNone) {
@@ -1622,7 +2064,7 @@ class AssemblerOpInterface {
     }
     return stack().ReduceOsrValue(index);
   }
-  void Return(OpIndex pop_count, base::Vector<OpIndex> return_values) {
+  void Return(OpIndex pop_count, base::Vector<const OpIndex> return_values) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return;
     }
@@ -1634,19 +2076,22 @@ class AssemblerOpInterface {
 
   OpIndex Call(OpIndex callee, OpIndex frame_state,
                base::Vector<const OpIndex> arguments,
-               const TSCallDescriptor* descriptor) {
+               const TSCallDescriptor* descriptor,
+               OpEffects effects = OpEffects().CanCallAnything()) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceCall(callee, frame_state, arguments, descriptor);
+    return stack().ReduceCall(callee, frame_state, arguments, descriptor,
+                              effects);
   }
   OpIndex Call(OpIndex callee, std::initializer_list<OpIndex> arguments,
-               const TSCallDescriptor* descriptor) {
+               const TSCallDescriptor* descriptor,
+               OpEffects effects = OpEffects().CanCallAnything()) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return Call(callee, OpIndex::Invalid(), base::VectorOf(arguments),
-                descriptor);
+                descriptor, effects);
   }
 
   template <typename Descriptor>
@@ -1654,49 +2099,62 @@ class AssemblerOpInterface {
                    typename Descriptor::result_t>
   CallBuiltin(Isolate* isolate, OpIndex frame_state, OpIndex context,
               const typename Descriptor::arguments_t& args) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
     DCHECK(frame_state.valid());
     DCHECK(context.valid());
     return CallBuiltinImpl<typename Descriptor::result_t>(
         isolate, Descriptor::Function,
         Descriptor::Create(isolate, stack().output_graph().graph_zone()),
-        frame_state, context, args);
+        Descriptor::Effects, frame_state, context, args);
   }
   template <typename Descriptor>
   std::enable_if_t<!Descriptor::NeedsFrameState && Descriptor::NeedsContext,
                    typename Descriptor::result_t>
   CallBuiltin(Isolate* isolate, OpIndex context,
               const typename Descriptor::arguments_t& args) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
     DCHECK(context.valid());
     return CallBuiltinImpl<typename Descriptor::result_t>(
         isolate, Descriptor::Function,
-        Descriptor::Create(isolate, stack().output_graph().graph_zone()), {},
-        context, args);
+        Descriptor::Create(isolate, stack().output_graph().graph_zone()),
+        Descriptor::Effects, {}, context, args);
   }
   template <typename Descriptor>
   std::enable_if_t<Descriptor::NeedsFrameState && !Descriptor::NeedsContext,
                    typename Descriptor::result_t>
   CallBuiltin(Isolate* isolate, OpIndex frame_state,
               const typename Descriptor::arguments_t& args) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
     DCHECK(frame_state.valid());
     return CallBuiltinImpl<typename Descriptor::result_t>(
         isolate, Descriptor::Function,
         Descriptor::Create(isolate, stack().output_graph().graph_zone()),
-        frame_state, {}, args);
+        Descriptor::Effects, frame_state, {}, args);
   }
   template <typename Descriptor>
   std::enable_if_t<!Descriptor::NeedsFrameState && !Descriptor::NeedsContext,
                    typename Descriptor::result_t>
   CallBuiltin(Isolate* isolate, const typename Descriptor::arguments_t& args) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
     return CallBuiltinImpl<typename Descriptor::result_t>(
         isolate, Descriptor::Function,
-        Descriptor::Create(isolate, stack().output_graph().graph_zone()), {},
-        {}, args);
+        Descriptor::Create(isolate, stack().output_graph().graph_zone()),
+        Descriptor::Effects, {}, {}, args);
   }
 
   template <typename Ret, typename Args>
   Ret CallBuiltinImpl(Isolate* isolate, Builtin function,
-                      const TSCallDescriptor* desc, OpIndex frame_state,
-                      V<Context> context, const Args& args) {
+                      const TSCallDescriptor* desc, OpEffects effects,
+                      OpIndex frame_state, V<Context> context,
+                      const Args& args) {
     Callable callable = Builtins::CallableFor(isolate, function);
     // Convert arguments from `args` tuple into a `SmallVector<OpIndex>`.
     auto inputs = std::apply(
@@ -1709,13 +2167,106 @@ class AssemblerOpInterface {
 
     if constexpr (std::is_same_v<Ret, void>) {
       Call(HeapConstant(callable.code()), frame_state, base::VectorOf(inputs),
-           desc);
+           desc, effects);
     } else {
       return Call(HeapConstant(callable.code()), frame_state,
-                  base::VectorOf(inputs), desc);
-    }
+                  base::VectorOf(inputs), desc, effects);
+    }
+  }
+
+  void CallBuiltin_CheckTurbofanType(Isolate* isolate, V<Context> context,
+                                     V<Object> object,
+                                     V<TurbofanType> allocated_type,
+                                     V<Smi> node_id) {
+    CallBuiltin<typename BuiltinCallDescriptor::CheckTurbofanType>(
+        isolate, context, {object, allocated_type, node_id});
+  }
+  V<Object> CallBuiltin_CopyFastSmiOrObjectElements(Isolate* isolate,
+                                                    V<Object> object) {
+    return CallBuiltin<
+        typename BuiltinCallDescriptor::CopyFastSmiOrObjectElements>(isolate,
+                                                                     {object});
+  }
+  void CallBuiltin_DebugPrintFloat64(Isolate* isolate, V<Context> context,
+                                     V<Float64> value) {
+    CallBuiltin<typename BuiltinCallDescriptor::DebugPrintFloat64>(
+        isolate, context, {value});
+  }
+  void CallBuiltin_DebugPrintWordPtr(Isolate* isolate, V<Context> context,
+                                     V<WordPtr> value) {
+    CallBuiltin<typename BuiltinCallDescriptor::DebugPrintWordPtr>(
+        isolate, context, {value});
+  }
+  V<Smi> CallBuiltin_FindOrderedHashMapEntry(Isolate* isolate,
+                                             V<Context> context,
+                                             V<Object> table, V<Smi> key) {
+    return CallBuiltin<typename BuiltinCallDescriptor::FindOrderedHashMapEntry>(
+        isolate, context, {table, key});
+  }
+  V<Smi> CallBuiltin_FindOrderedHashSetEntry(Isolate* isolate,
+                                             V<Context> context, V<Object> set,
+                                             V<Smi> key) {
+    return CallBuiltin<typename BuiltinCallDescriptor::FindOrderedHashSetEntry>(
+        isolate, context, {set, key});
+  }
+  V<Object> CallBuiltin_GrowFastDoubleElements(Isolate* isolate,
+                                               V<Object> object, V<Smi> size) {
+    return CallBuiltin<typename BuiltinCallDescriptor::GrowFastDoubleElements>(
+        isolate, {object, size});
+  }
+  V<Object> CallBuiltin_GrowFastSmiOrObjectElements(Isolate* isolate,
+                                                    V<Object> object,
+                                                    V<Smi> size) {
+    return CallBuiltin<
+        typename BuiltinCallDescriptor::GrowFastSmiOrObjectElements>(
+        isolate, {object, size});
+  }
+  V<FixedArray> CallBuiltin_NewSloppyArgumentsElements(
+      Isolate* isolate, V<WordPtr> frame, V<WordPtr> formal_parameter_count,
+      V<Smi> arguments_count) {
+    return CallBuiltin<
+        typename BuiltinCallDescriptor::NewSloppyArgumentsElements>(
+        isolate, {frame, formal_parameter_count, arguments_count});
+  }
+  V<FixedArray> CallBuiltin_NewStrictArgumentsElements(
+      Isolate* isolate, V<WordPtr> frame, V<WordPtr> formal_parameter_count,
+      V<Smi> arguments_count) {
+    return CallBuiltin<
+        typename BuiltinCallDescriptor::NewStrictArgumentsElements>(
+        isolate, {frame, formal_parameter_count, arguments_count});
+  }
+  V<FixedArray> CallBuiltin_NewRestArgumentsElements(
+      Isolate* isolate, V<WordPtr> frame, V<WordPtr> formal_parameter_count,
+      V<Smi> arguments_count) {
+    return CallBuiltin<
+        typename BuiltinCallDescriptor::NewRestArgumentsElements>(
+        isolate, {frame, formal_parameter_count, arguments_count});
+  }
+  V<String> CallBuiltin_NumberToString(Isolate* isolate, V<Number> input) {
+    return CallBuiltin<typename BuiltinCallDescriptor::NumberToString>(isolate,
+                                                                       {input});
+  }
+  V<Number> CallBuiltin_PlainPrimitiveToNumber(Isolate* isolate,
+                                               V<PlainPrimitive> input) {
+    return CallBuiltin<typename BuiltinCallDescriptor::PlainPrimitiveToNumber>(
+        isolate, {input});
+  }
+  V<Boolean> CallBuiltin_SameValue(Isolate* isolate, V<Object> left,
+                                   V<Object> right) {
+    return CallBuiltin<typename BuiltinCallDescriptor::SameValue>(
+        isolate, {left, right});
+  }
+  V<Boolean> CallBuiltin_SameValueNumbersOnly(Isolate* isolate, V<Object> left,
+                                              V<Object> right) {
+    return CallBuiltin<typename BuiltinCallDescriptor::SameValueNumbersOnly>(
+        isolate, {left, right});
+  }
+  V<String> CallBuiltin_StringAdd_CheckNone(Isolate* isolate,
+                                            V<Context> context, V<String> left,
+                                            V<String> right) {
+    return CallBuiltin<typename BuiltinCallDescriptor::StringAdd_CheckNone>(
+        isolate, context, {left, right});
   }
-
   V<Boolean> CallBuiltin_StringEqual(Isolate* isolate, V<String> left,
                                      V<String> right, V<WordPtr> length) {
     return CallBuiltin<typename BuiltinCallDescriptor::StringEqual>(
@@ -1750,16 +2301,36 @@ class AssemblerOpInterface {
         isolate, context, {string});
   }
 #endif  // V8_INTL_SUPPORT
+  V<Number> CallBuiltin_StringToNumber(Isolate* isolate, V<String> input) {
+    return CallBuiltin<typename BuiltinCallDescriptor::StringToNumber>(isolate,
+                                                                       {input});
+  }
   V<String> CallBuiltin_StringSubstring(Isolate* isolate, V<String> string,
                                         V<WordPtr> start, V<WordPtr> end) {
     return CallBuiltin<typename BuiltinCallDescriptor::StringSubstring>(
         isolate, {string, start, end});
   }
+  V<Boolean> CallBuiltin_ToBoolean(Isolate* isolate, V<Object> object) {
+    return CallBuiltin<typename BuiltinCallDescriptor::ToBoolean>(isolate,
+                                                                  {object});
+  }
+  V<Object> CallBuiltin_ToObject(Isolate* isolate, V<Context> context,
+                                 V<Object> object) {
+    return CallBuiltin<typename BuiltinCallDescriptor::ToObject>(
+        isolate, context, {object});
+  }
+  V<String> CallBuiltin_Typeof(Isolate* isolate, V<Object> object) {
+    return CallBuiltin<typename BuiltinCallDescriptor::Typeof>(isolate,
+                                                               {object});
+  }
 
   template <typename Descriptor>
   std::enable_if_t<Descriptor::NeedsFrameState, typename Descriptor::result_t>
   CallRuntime(Isolate* isolate, OpIndex frame_state, OpIndex context,
               const typename Descriptor::arguments_t& args) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
     DCHECK(frame_state.valid());
     DCHECK(context.valid());
     return CallRuntimeImpl<typename Descriptor::result_t>(
@@ -1771,6 +2342,9 @@ class AssemblerOpInterface {
   std::enable_if_t<!Descriptor::NeedsFrameState, typename Descriptor::result_t>
   CallRuntime(Isolate* isolate, OpIndex context,
               const typename Descriptor::arguments_t& args) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
     DCHECK(context.valid());
     return CallRuntimeImpl<typename Descriptor::result_t>(
         isolate, Descriptor::Function,
@@ -1807,6 +2381,14 @@ class AssemblerOpInterface {
     }
   }
 
+  void CallRuntime_Abort(Isolate* isolate, V<Context> context, V<Smi> reason) {
+    CallRuntime<typename RuntimeCallDescriptor::Abort>(isolate, context,
+                                                       {reason});
+  }
+  V<Number> CallRuntime_DateCurrentTime(Isolate* isolate, V<Context> context) {
+    return CallRuntime<typename RuntimeCallDescriptor::DateCurrentTime>(
+        isolate, context, {});
+  }
   V<Tagged> CallRuntime_StringCharCodeAt(Isolate* isolate, V<Context> context,
                                          V<String> string, V<Number> index) {
     return CallRuntime<typename RuntimeCallDescriptor::StringCharCodeAt>(
@@ -1826,17 +2408,19 @@ class AssemblerOpInterface {
     return CallRuntime<typename RuntimeCallDescriptor::TerminateExecution>(
         isolate, frame_state, context, {});
   }
-
-  OpIndex CallAndCatchException(OpIndex callee, OpIndex frame_state,
-                                base::Vector<const OpIndex> arguments,
-                                Block* if_success, Block* if_exception,
-                                const TSCallDescriptor* descriptor) {
-    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
-      return OpIndex::Invalid();
-    }
-    return stack().ReduceCallAndCatchException(
-        callee, frame_state, arguments, if_success, if_exception, descriptor);
+  V<Object> CallRuntime_TransitionElementsKind(Isolate* isolate,
+                                               V<Context> context,
+                                               V<HeapObject> object,
+                                               V<Map> target_map) {
+    return CallRuntime<typename RuntimeCallDescriptor::TransitionElementsKind>(
+        isolate, context, {object, target_map});
   }
+  V<Object> CallRuntime_TryMigrateInstance(Isolate* isolate, V<Context> context,
+                                           V<HeapObject> heap_object) {
+    return CallRuntime<typename RuntimeCallDescriptor::TryMigrateInstance>(
+        isolate, context, {heap_object});
+  }
+
   void TailCall(OpIndex callee, base::Vector<const OpIndex> arguments,
                 const TSCallDescriptor* descriptor) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
@@ -1858,6 +2442,10 @@ class AssemblerOpInterface {
       return;
     }
     stack().ReduceDeoptimizeIf(condition, frame_state, false, parameters);
+    if (stack().current_block() == nullptr) {
+      // The DeoptimizeIf was transformed into an inconditional deopt
+      stack().SetGeneratingUnreachableOperations();
+    }
   }
   void DeoptimizeIfNot(OpIndex condition, OpIndex frame_state,
                        const DeoptimizeParameters* parameters) {
@@ -1865,6 +2453,10 @@ class AssemblerOpInterface {
       return;
     }
     stack().ReduceDeoptimizeIf(condition, frame_state, true, parameters);
+    if (stack().current_block() == nullptr) {
+      // The DeoptimizeIfNot was transformed into an inconditional deopt
+      stack().SetGeneratingUnreachableOperations();
+    }
   }
   void DeoptimizeIf(OpIndex condition, OpIndex frame_state,
                     DeoptimizeReason reason, const FeedbackSource& feedback) {
@@ -1893,21 +2485,40 @@ class AssemblerOpInterface {
     }
     stack().ReduceDeoptimize(frame_state, parameters);
   }
+  void Deoptimize(OpIndex frame_state, DeoptimizeReason reason,
+                  const FeedbackSource& feedback) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    Zone* zone = stack().output_graph().graph_zone();
+    const DeoptimizeParameters* params =
+        zone->New<DeoptimizeParameters>(reason, feedback);
+    Deoptimize(frame_state, params);
+  }
 
-  void TrapIf(OpIndex condition, TrapId trap_id) {
+  void TrapIf(V<Word32> condition, OpIndex frame_state, TrapId trap_id) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return;
     }
-    stack().ReduceTrapIf(condition, false, trap_id);
+    stack().ReduceTrapIf(condition, frame_state, false, trap_id);
+    if (stack().current_block() == nullptr) {
+      // The TrapIf was transformed into an inconditional trap
+      stack().SetGeneratingUnreachableOperations();
+    }
   }
-  void TrapIfNot(OpIndex condition, TrapId trap_id) {
+  void TrapIfNot(V<Word32> condition, OpIndex frame_state, TrapId trap_id) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return;
     }
-    stack().ReduceTrapIf(condition, true, trap_id);
+    stack().ReduceTrapIf(condition, frame_state, true, trap_id);
+    if (stack().current_block() == nullptr) {
+      // The TrapIfNot was transformed into an inconditional trap
+      stack().SetGeneratingUnreachableOperations();
+    }
   }
 
   void StaticAssert(OpIndex condition, const char* source) {
+    CHECK(v8_flags.turboshaft_enable_debug_features);
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return;
     }
@@ -1933,26 +2544,15 @@ class AssemblerOpInterface {
     for (std::size_t i = 0; i < inputs.size(); ++i) temp[i] = inputs[i];
     return Phi(base::VectorOf(temp), V<T>::rep);
   }
-  OpIndex PendingLoopPhi(OpIndex first, RegisterRepresentation rep,
-                         PendingLoopPhiOp::Data data) {
+  OpIndex PendingLoopPhi(OpIndex first, RegisterRepresentation rep) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReducePendingLoopPhi(first, rep, data);
-  }
-  OpIndex PendingLoopPhi(OpIndex first, RegisterRepresentation rep,
-                         OpIndex old_backedge_index) {
-    return PendingLoopPhi(first, rep,
-                          PendingLoopPhiOp::Data{old_backedge_index});
-  }
-  OpIndex PendingLoopPhi(OpIndex first, RegisterRepresentation rep,
-                         Node* old_backedge_index) {
-    return PendingLoopPhi(first, rep,
-                          PendingLoopPhiOp::Data{old_backedge_index});
+    return stack().ReducePendingLoopPhi(first, rep);
   }
   template <typename T>
-  V<T> PendingLoopPhi(V<T> first, PendingLoopPhiOp::PhiIndex phi_index) {
-    return PendingLoopPhi(first, V<T>::rep, PendingLoopPhiOp::Data{phi_index});
+  V<T> PendingLoopPhi(V<T> first) {
+    return PendingLoopPhi(first, V<T>::rep);
   }
 
   OpIndex Tuple(base::Vector<OpIndex> indices) {
@@ -1980,6 +2580,7 @@ class AssemblerOpInterface {
   }
   OpIndex CheckTurboshaftTypeOf(OpIndex input, RegisterRepresentation rep,
                                 Type expected_type, bool successful) {
+    CHECK(v8_flags.turboshaft_enable_debug_features);
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
@@ -1987,36 +2588,44 @@ class AssemblerOpInterface {
                                                successful);
   }
 
-  OpIndex LoadException() {
+  OpIndex CatchBlockBegin() {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceLoadException();
+    return stack().ReduceCatchBlockBegin();
   }
 
   // Return `true` if the control flow after the conditional jump is reachable.
-  bool GotoIf(OpIndex condition, Block* if_true,
-              BranchHint hint = BranchHint::kNone) {
+  ConditionalGotoStatus GotoIf(OpIndex condition, Block* if_true,
+                               BranchHint hint = BranchHint::kNone) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
-      return false;
+      // What we return here should not matter.
+      return ConditionalGotoStatus::kBranch;
     }
     Block* if_false = stack().NewBlock();
-    stack().Branch(condition, if_true, if_false, hint);
-    return stack().Bind(if_false);
+    return BranchAndBind(condition, if_true, if_false, hint, if_false);
+  }
+  ConditionalGotoStatus GotoIf(ConditionWithHint condition, Block* if_true) {
+    return GotoIf(condition.condition(), if_true, condition.hint());
   }
   // Return `true` if the control flow after the conditional jump is reachable.
-  bool GotoIfNot(OpIndex condition, Block* if_false,
-                 BranchHint hint = BranchHint::kNone) {
+  ConditionalGotoStatus GotoIfNot(OpIndex condition, Block* if_false,
+                                  BranchHint hint = BranchHint::kNone) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
-      return false;
+      // What we return here should not matter.
+      return ConditionalGotoStatus::kBranch;
     }
     Block* if_true = stack().NewBlock();
-    stack().Branch(condition, if_true, if_false, hint);
-    return stack().Bind(if_true);
+    return BranchAndBind(condition, if_true, if_false, hint, if_true);
+  }
+
+  ConditionalGotoStatus GotoIfNot(ConditionWithHint condition,
+                                  Block* if_false) {
+    return GotoIfNot(condition.condition(), if_false, condition.hint());
   }
 
   OpIndex CallBuiltin(Builtin builtin, OpIndex frame_state,
-                      const base::Vector<OpIndex>& arguments,
+                      base::Vector<OpIndex> arguments, CanThrow can_throw,
                       Isolate* isolate) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
@@ -2031,7 +2640,7 @@ class AssemblerOpInterface {
     DCHECK_EQ(call_descriptor->NeedsFrameState(), frame_state.valid());
 
     const TSCallDescriptor* ts_call_descriptor =
-        TSCallDescriptor::Create(call_descriptor, graph_zone);
+        TSCallDescriptor::Create(call_descriptor, can_throw, graph_zone);
 
     OpIndex callee = stack().HeapConstant(callable.code());
 
@@ -2082,6 +2691,20 @@ class AssemblerOpInterface {
     stack().ReduceDebugBreak();
   }
 
+  void DebugPrint(OpIndex input, RegisterRepresentation rep) {
+    CHECK(v8_flags.turboshaft_enable_debug_features);
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceDebugPrint(input, rep);
+  }
+  void DebugPrint(V<WordPtr> input) {
+    return DebugPrint(input, RegisterRepresentation::PointerSized());
+  }
+  void DebugPrint(V<Float64> input) {
+    return DebugPrint(input, RegisterRepresentation::Float64());
+  }
+
   V<Tagged> BigIntBinop(V<Tagged> left, V<Tagged> right, OpIndex frame_state,
                         BigIntBinopOp::Kind kind) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
@@ -2139,6 +2762,13 @@ class AssemblerOpInterface {
     return BigIntUnary(input, BigIntUnaryOp::Kind::kNegate);
   }
 
+  OpIndex Word32PairBinop(V<Word32> left_low, V<Word32> left_high,
+                          V<Word32> right_low, V<Word32> right_high,
+                          Word32PairBinopOp::Kind kind) {
+    return stack().ReduceWord32PairBinop(left_low, left_high, right_low,
+                                         right_high, kind);
+  }
+
   V<Word32> StringAt(V<String> string, V<WordPtr> position,
                      StringAtOp::Kind kind) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
@@ -2168,40 +2798,46 @@ class AssemblerOpInterface {
   }
 #endif  // V8_INTL_SUPPORT
 
-  V<Word32> StringLength(V<Tagged> string) {
+  V<Word32> StringLength(V<String> string) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return stack().ReduceStringLength(string);
   }
 
-  V<Tagged> StringIndexOf(V<Tagged> string, V<Tagged> search,
-                          V<Tagged> position) {
+  V<Smi> StringIndexOf(V<String> string, V<String> search, V<Smi> position) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return stack().ReduceStringIndexOf(string, search, position);
   }
 
-  V<Tagged> StringFromCodePointAt(V<Tagged> string, V<WordPtr> index) {
+  V<String> StringFromCodePointAt(V<String> string, V<WordPtr> index) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return stack().ReduceStringFromCodePointAt(string, index);
   }
 
-  V<Tagged> StringSubstring(V<Tagged> string, V<Word32> start, V<Word32> end) {
+  V<String> StringSubstring(V<String> string, V<Word32> start, V<Word32> end) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
     return stack().ReduceStringSubstring(string, start, end);
   }
 
-  V<Boolean> StringEqual(V<String> left, V<String> right) {
+  V<String> StringConcat(V<String> left, V<String> right) {
     if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
       return OpIndex::Invalid();
     }
-    return stack().ReduceStringEqual(left, right);
+    return stack().ReduceStringConcat(left, right);
+  }
+
+  V<Boolean> StringEqual(V<String> left, V<String> right) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceStringEqual(left, right);
   }
 
   V<Boolean> StringComparison(V<String> left, V<String> right,
@@ -2219,6 +2855,436 @@ class AssemblerOpInterface {
                             StringComparisonOp::Kind::kLessThanOrEqual);
   }
 
+  V<Smi> ArgumentsLength() {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceArgumentsLength(ArgumentsLengthOp::Kind::kArguments,
+                                         0);
+  }
+  V<Smi> RestLength(int formal_parameter_count) {
+    DCHECK_LE(0, formal_parameter_count);
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceArgumentsLength(ArgumentsLengthOp::Kind::kRest,
+                                         formal_parameter_count);
+  }
+
+  V<FixedArray> NewArgumentsElements(V<Smi> arguments_count,
+                                     CreateArgumentsType type,
+                                     int formal_parameter_count) {
+    DCHECK_LE(0, formal_parameter_count);
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceNewArgumentsElements(arguments_count, type,
+                                              formal_parameter_count);
+  }
+
+  OpIndex LoadTypedElement(OpIndex buffer, V<Object> base, V<WordPtr> external,
+                           V<WordPtr> index, ExternalArrayType array_type) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceLoadTypedElement(buffer, base, external, index,
+                                          array_type);
+  }
+
+  OpIndex LoadDataViewElement(V<Object> object, V<Object> storage,
+                              V<WordPtr> index, V<Word32> is_little_endian,
+                              ExternalArrayType element_type) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceLoadDataViewElement(object, storage, index,
+                                             is_little_endian, element_type);
+  }
+
+  V<Object> LoadStackArgument(V<Object> base, V<WordPtr> index) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceLoadStackArgument(base, index);
+  }
+
+  void StoreTypedElement(OpIndex buffer, V<Object> base, V<WordPtr> external,
+                         V<WordPtr> index, OpIndex value,
+                         ExternalArrayType array_type) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceStoreTypedElement(buffer, base, external, index, value,
+                                    array_type);
+  }
+
+  void StoreDataViewElement(V<Object> object, V<Object> storage,
+                            V<WordPtr> index, OpIndex value,
+                            V<Word32> is_little_endian,
+                            ExternalArrayType element_type) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceStoreDataViewElement(object, storage, index, value,
+                                       is_little_endian, element_type);
+  }
+
+  void TransitionAndStoreArrayElement(
+      V<Object> array, V<WordPtr> index, OpIndex value,
+      TransitionAndStoreArrayElementOp::Kind kind, MaybeHandle<Map> fast_map,
+      MaybeHandle<Map> double_map) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceTransitionAndStoreArrayElement(array, index, value, kind,
+                                                 fast_map, double_map);
+  }
+
+  void StoreSignedSmallElement(V<Object> array, V<WordPtr> index,
+                               V<Word32> value) {
+    TransitionAndStoreArrayElement(
+        array, index, value,
+        TransitionAndStoreArrayElementOp::Kind::kSignedSmallElement, {}, {});
+  }
+
+  V<Word32> CompareMaps(V<HeapObject> heap_object,
+                        const ZoneRefSet<Map>& maps) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceCompareMaps(heap_object, maps);
+  }
+
+  void CheckMaps(V<HeapObject> heap_object, OpIndex frame_state,
+                 const ZoneRefSet<Map>& maps, CheckMapsFlags flags,
+                 const FeedbackSource& feedback) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceCheckMaps(heap_object, frame_state, maps, flags, feedback);
+  }
+
+  void AssumeMap(V<HeapObject> heap_object, const ZoneRefSet<Map>& maps) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceAssumeMap(heap_object, maps);
+  }
+
+  V<Object> CheckedClosure(V<Object> input, OpIndex frame_state,
+                           Handle<FeedbackCell> feedback_cell) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceCheckedClosure(input, frame_state, feedback_cell);
+  }
+
+  void CheckEqualsInternalizedString(V<Object> expected, V<Object> value,
+                                     OpIndex frame_state) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceCheckEqualsInternalizedString(expected, value, frame_state);
+  }
+
+  V<Object> LoadMessage(V<WordPtr> offset) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceLoadMessage(offset);
+  }
+
+  void StoreMessage(V<WordPtr> offset, V<Object> object) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceStoreMessage(offset, object);
+  }
+
+  V<Boolean> SameValue(V<Object> left, V<Object> right,
+                       SameValueOp::Mode mode) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSameValue(left, right, mode);
+  }
+
+  V<Word32> Float64SameValue(OpIndex left, OpIndex right) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceFloat64SameValue(left, right);
+  }
+
+  OpIndex FastApiCall(OpIndex data_argument,
+                      base::Vector<const OpIndex> arguments,
+                      const FastApiCallParameters* parameters) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceFastApiCall(data_argument, arguments, parameters);
+  }
+
+  void RuntimeAbort(AbortReason reason) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceRuntimeAbort(reason);
+  }
+
+  V<Object> EnsureWritableFastElements(V<Object> object, V<Object> elements) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceEnsureWritableFastElements(object, elements);
+  }
+
+  V<Object> MaybeGrowFastElements(V<Object> object, V<Object> elements,
+                                  V<Word32> index, V<Word32> elements_length,
+                                  OpIndex frame_state,
+                                  GrowFastElementsMode mode,
+                                  const FeedbackSource& feedback) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceMaybeGrowFastElements(
+        object, elements, index, elements_length, frame_state, mode, feedback);
+  }
+
+  void TransitionElementsKind(V<HeapObject> object,
+                              const ElementsTransition& transition) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceTransitionElementsKind(object, transition);
+  }
+
+  OpIndex FindOrderedHashEntry(V<Object> data_structure, OpIndex key,
+                               FindOrderedHashEntryOp::Kind kind) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceFindOrderedHashEntry(data_structure, key, kind);
+  }
+  V<Smi> FindOrderedHashMapEntry(V<Object> table, V<Smi> key) {
+    return FindOrderedHashEntry(
+        table, key, FindOrderedHashEntryOp::Kind::kFindOrderedHashMapEntry);
+  }
+  V<Smi> FindOrderedHashSetEntry(V<Object> table, V<Smi> key) {
+    return FindOrderedHashEntry(
+        table, key, FindOrderedHashEntryOp::Kind::kFindOrderedHashSetEntry);
+  }
+  V<WordPtr> FindOrderedHashMapEntryForInt32Key(V<Object> table,
+                                                V<Word32> key) {
+    return FindOrderedHashEntry(
+        table, key,
+        FindOrderedHashEntryOp::Kind::kFindOrderedHashMapEntryForInt32Key);
+  }
+
+#ifdef V8_ENABLE_WEBASSEMBLY
+  OpIndex GlobalGet(V<WasmInstanceObject> instance,
+                    const wasm::WasmGlobal* global) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceGlobalGet(instance, global);
+  }
+
+  OpIndex GlobalSet(V<WasmInstanceObject> instance, OpIndex value,
+                    const wasm::WasmGlobal* global) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceGlobalSet(instance, value, global);
+  }
+
+  V<HeapObject> Null(wasm::ValueType type) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceNull(type);
+  }
+
+  V<Word32> IsNull(V<Tagged> input, wasm::ValueType type) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceIsNull(input, type);
+  }
+
+  V<Tagged> AssertNotNull(V<Tagged> object, wasm::ValueType type,
+                          TrapId trap_id) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceAssertNotNull(object, type, trap_id);
+  }
+
+  V<Map> RttCanon(V<WasmInstanceObject> instance, uint32_t type_index) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceRttCanon(instance, type_index);
+  }
+
+  V<Word32> WasmTypeCheck(V<Tagged> object, V<Map> rtt,
+                          WasmTypeCheckConfig config) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceWasmTypeCheck(object, rtt, config);
+  }
+
+  V<Tagged> WasmTypeCast(V<Tagged> object, V<Map> rtt,
+                         WasmTypeCheckConfig config) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceWasmTypeCast(object, rtt, config);
+  }
+
+  OpIndex StructGet(V<HeapObject> object, const wasm::StructType* type,
+                    int field_index, bool is_signed, CheckForNull null_check) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceStructGet(object, type, field_index, is_signed,
+                                   null_check);
+  }
+
+  void StructSet(V<HeapObject> object, OpIndex value,
+                 const wasm::StructType* type, int field_index,
+                 CheckForNull null_check) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceStructSet(object, value, type, field_index, null_check);
+  }
+
+  OpIndex ArrayGet(V<HeapObject> array, V<Word32> index,
+                   wasm::ValueType element_type, bool is_signed) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceArrayGet(array, index, element_type, is_signed);
+  }
+
+  void ArraySet(V<HeapObject> array, V<Word32> index, OpIndex value,
+                wasm::ValueType element_type) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return;
+    }
+    stack().ReduceArraySet(array, index, value, element_type);
+  }
+
+  V<Word32> ArrayLength(V<HeapObject> array, CheckForNull null_check) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceArrayLength(array, null_check);
+  }
+
+  V<Simd128> Simd128Constant(const uint8_t value[kSimd128Size]) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128Constant(value);
+  }
+
+  V<Simd128> Simd128Binop(V<Simd128> left, V<Simd128> right,
+                          Simd128BinopOp::Kind kind) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128Binop(left, right, kind);
+  }
+
+  V<Simd128> Simd128Unary(V<Simd128> input, Simd128UnaryOp::Kind kind) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128Unary(input, kind);
+  }
+
+  V<Simd128> Simd128Shift(V<Simd128> input, V<Word32> shift,
+                          Simd128ShiftOp::Kind kind) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128Shift(input, shift, kind);
+  }
+
+  V<Word32> Simd128Test(V<Simd128> input, Simd128TestOp::Kind kind) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128Test(input, kind);
+  }
+
+  V<Simd128> Simd128Splat(OpIndex input, Simd128SplatOp::Kind kind) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128Splat(input, kind);
+  }
+
+  V<Simd128> Simd128Ternary(OpIndex first, OpIndex second, OpIndex third,
+                            Simd128TernaryOp::Kind kind) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128Ternary(first, second, third, kind);
+  }
+
+  OpIndex Simd128ExtractLane(V<Simd128> input, Simd128ExtractLaneOp::Kind kind,
+                             uint8_t lane) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128ExtractLane(input, kind, lane);
+  }
+
+  V<Simd128> Simd128ReplaceLane(V<Simd128> into, OpIndex new_lane,
+                                Simd128ReplaceLaneOp::Kind kind, uint8_t lane) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128ReplaceLane(into, new_lane, kind, lane);
+  }
+
+  OpIndex Simd128LaneMemory(V<WordPtr> base, V<WordPtr> index, V<WordPtr> value,
+                            Simd128LaneMemoryOp::Mode mode,
+                            Simd128LaneMemoryOp::Kind kind,
+                            Simd128LaneMemoryOp::LaneKind lane_kind,
+                            uint8_t lane, int offset) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128LaneMemory(base, index, value, mode, kind,
+                                           lane_kind, lane, offset);
+  }
+
+  OpIndex Simd128LoadTransform(
+      V<WordPtr> base, V<WordPtr> index,
+      Simd128LoadTransformOp::LoadKind load_kind,
+      Simd128LoadTransformOp::TransformKind transform_kind, int offset) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128LoadTransform(base, index, load_kind,
+                                              transform_kind, offset);
+  }
+
+  V<Simd128> Simd128Shuffle(V<Simd128> left, V<Simd128> right,
+                            const uint8_t shuffle[kSimd128Size]) {
+    if (V8_UNLIKELY(stack().generating_unreachable_operations())) {
+      return OpIndex::Invalid();
+    }
+    return stack().ReduceSimd128Shuffle(left, right, shuffle);
+  }
+
+#endif  // V8_ENABLE_WEBASSEMBLY
+
   template <typename Rep>
   V<Rep> resolve(const V<Rep>& v) {
     return v;
@@ -2267,36 +3333,37 @@ class AssemblerOpInterface {
   }
 
   template <typename L>
-  void ControlFlowHelper_GotoIf(V<Word32> condition, L& label,
-                                const typename L::const_or_values_t& values,
-                                BranchHint hint) {
+  void ControlFlowHelper_GotoIf(ConditionWithHint condition, L& label,
+                                const typename L::const_or_values_t& values) {
     auto resolved_values = detail::ResolveAll(stack(), values);
-    label.GotoIf(stack(), condition, hint, resolved_values);
+    label.GotoIf(stack(), condition.condition(), condition.hint(),
+                 resolved_values);
   }
 
   template <typename L>
-  void ControlFlowHelper_GotoIfNot(V<Word32> condition, L& label,
-                                   const typename L::const_or_values_t& values,
-                                   BranchHint hint) {
+  void ControlFlowHelper_GotoIfNot(
+      ConditionWithHint condition, L& label,
+      const typename L::const_or_values_t& values) {
     auto resolved_values = detail::ResolveAll(stack(), values);
-    label.GotoIfNot(stack(), condition, hint, resolved_values);
+    label.GotoIfNot(stack(), condition.condition(), condition.hint(),
+                    resolved_values);
   }
 
-  bool ControlFlowHelper_If(V<Word32> condition, bool negate, BranchHint hint) {
+  bool ControlFlowHelper_If(ConditionWithHint condition, bool negate) {
     Block* then_block = stack().NewBlock();
     Block* else_block = stack().NewBlock();
     Block* end_block = stack().NewBlock();
     if (negate) {
-      this->Branch(condition, else_block, then_block, hint);
+      this->Branch(condition, else_block, then_block);
     } else {
-      this->Branch(condition, then_block, else_block, hint);
+      this->Branch(condition, then_block, else_block);
     }
     if_scope_stack_.emplace_back(else_block, end_block);
     return stack().Bind(then_block);
   }
 
   template <typename F>
-  bool ControlFlowHelper_ElseIf(F&& condition_builder, BranchHint hint) {
+  bool ControlFlowHelper_ElseIf(F&& condition_builder) {
     DCHECK_LT(0, if_scope_stack_.size());
     auto& info = if_scope_stack_.back();
     Block* else_block = info.else_block;
@@ -2304,7 +3371,8 @@ class AssemblerOpInterface {
     if (!stack().Bind(else_block)) return false;
     Block* then_block = stack().NewBlock();
     info.else_block = stack().NewBlock();
-    stack().Branch(condition_builder(), then_block, info.else_block, hint);
+    stack().Branch(ConditionWithHint{condition_builder()}, then_block,
+                   info.else_block);
     return stack().Bind(then_block);
   }
 
@@ -2344,6 +3412,66 @@ class AssemblerOpInterface {
   }
 
  private:
+  // LoadArrayBufferElement and LoadNonArrayBufferElement should be called
+  // instead of LoadElement.
+  template <typename T = Any, typename Base>
+  V<T> LoadElement(V<Base> object, const ElementAccess& access,
+                   V<WordPtr> index, bool is_array_buffer) {
+    if constexpr (std::is_base_of_v<Object, Base>) {
+      DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kTaggedBase);
+    } else {
+      static_assert(std::is_same_v<Base, WordPtr>);
+      DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kUntaggedBase);
+    }
+    LoadOp::Kind kind = LoadOp::Kind::Aligned(access.base_is_tagged);
+    if (is_array_buffer) kind = kind.NotAlwaysCanonicallyAccessed();
+    MemoryRepresentation rep =
+        MemoryRepresentation::FromMachineType(access.machine_type);
+    return Load(object, index, kind, rep, access.header_size,
+                rep.SizeInBytesLog2());
+  }
+
+  // StoreArrayBufferElement and StoreNonArrayBufferElement should be called
+  // instead of StoreElement.
+  template <typename Base>
+  void StoreElement(V<Base> object, const ElementAccess& access,
+                    V<WordPtr> index, V<Any> value, bool is_array_buffer) {
+    if constexpr (std::is_base_of_v<Object, Base>) {
+      DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kTaggedBase);
+    } else {
+      static_assert(std::is_same_v<Base, WordPtr>);
+      DCHECK_EQ(access.base_is_tagged, BaseTaggedness::kUntaggedBase);
+    }
+    LoadOp::Kind kind = LoadOp::Kind::Aligned(access.base_is_tagged);
+    if (is_array_buffer) kind = kind.NotAlwaysCanonicallyAccessed();
+    MemoryRepresentation rep =
+        MemoryRepresentation::FromMachineType(access.machine_type);
+    Store(object, index, value, kind, rep, access.write_barrier_kind,
+          access.header_size, rep.SizeInBytesLog2());
+  }
+
+  // BranchAndBind should be called from GotoIf/GotoIfNot. It will insert a
+  // Branch, bind {to_bind} (which should correspond to the implicit new block
+  // following the GotoIf/GotoIfNot) and return a ConditionalGotoStatus
+  // representing whether the destinations of the Branch are reachable or not.
+  ConditionalGotoStatus BranchAndBind(OpIndex condition, Block* if_true,
+                                      Block* if_false, BranchHint hint,
+                                      Block* to_bind) {
+    DCHECK_EQ(to_bind, any_of(if_true, if_false));
+    Block* other = to_bind == if_true ? if_false : if_true;
+    Block* to_bind_last_pred = to_bind->LastPredecessor();
+    Block* other_last_pred = other->LastPredecessor();
+    stack().Branch(condition, if_true, if_false, hint);
+    bool to_bind_reachable = to_bind_last_pred != to_bind->LastPredecessor();
+    bool other_reachable = other_last_pred != other->LastPredecessor();
+    ConditionalGotoStatus status = static_cast<ConditionalGotoStatus>(
+        static_cast<int>(other_reachable) | ((to_bind_reachable) << 1));
+    bool bind_status = stack().Bind(to_bind);
+    DCHECK_EQ(bind_status, to_bind_reachable);
+    USE(bind_status);
+    return status;
+  }
+
   Assembler& stack() { return *static_cast<Assembler*>(this); }
   struct IfScopeInfo {
     Block* else_block;
@@ -2355,31 +3483,30 @@ class AssemblerOpInterface {
   base::SmallVector<IfScopeInfo, 16> if_scope_stack_;
   // [0] contains the stub with exit frame.
   MaybeHandle<Code> cached_centry_stub_constants_[4];
+  bool in_object_initialization_ = false;
 };
 
 template <class Reducers>
 class Assembler : public GraphVisitor<Assembler<Reducers>>,
                   public reducer_stack_type<Reducers>::type,
-                  public OperationMatching<Assembler<Reducers>>,
+                  public OperationMatcher,
                   public AssemblerOpInterface<Assembler<Reducers>> {
   using Stack = typename reducer_stack_type<Reducers>::type;
 
  public:
-  template <class... ReducerArgs>
+  class CatchScope;
+
   explicit Assembler(Graph& input_graph, Graph& output_graph, Zone* phase_zone,
-                     compiler::NodeOriginTable* origins,
-                     const typename Stack::ArgT& reducer_args)
+                     compiler::NodeOriginTable* origins)
       : GraphVisitor<Assembler>(input_graph, output_graph, phase_zone, origins),
-        Stack(reducer_args) {
+        Stack(),
+        OperationMatcher(output_graph) {
     SupportedOperations::Initialize();
   }
 
   Block* NewLoopHeader() { return this->output_graph().NewLoopHeader(); }
   Block* NewBlock() { return this->output_graph().NewBlock(); }
 
-  using OperationMatching<Assembler<Reducers>>::Get;
-  using Stack::Get;
-
   V8_INLINE bool Bind(Block* block) {
     if (!this->output_graph().Add(block)) {
       generating_unreachable_operations_ = true;
@@ -2400,11 +3527,26 @@ class Assembler : public GraphVisitor<Assembler<Reducers>>,
     USE(bound);
   }
 
+  // Every loop should be finalized once, after it is certain that no backedge
+  // can be added anymore.
+  void FinalizeLoop(Block* loop_header) {
+    DCHECK(loop_header->IsLoop());
+    if (loop_header->HasExactlyNPredecessors(1)) {
+      this->output_graph().TurnLoopIntoMerge(loop_header);
+    }
+  }
+
   void SetCurrentOrigin(OpIndex operation_origin) {
     current_operation_origin_ = operation_origin;
   }
 
+  void SetGeneratingUnreachableOperations() {
+    DCHECK_NULL(current_block_);
+    generating_unreachable_operations_ = true;
+  }
+
   Block* current_block() const { return current_block_; }
+  Block* current_catch_block() const { return current_catch_block_; }
   bool generating_unreachable_operations() const {
     DCHECK_IMPLIES(generating_unreachable_operations_,
                    current_block_ == nullptr);
@@ -2440,7 +3582,7 @@ class Assembler : public GraphVisitor<Assembler<Reducers>>,
     op_to_block_[result] = current_block_;
     DCHECK(ValidInputs(result));
 #endif  // DEBUG
-    if (op.Properties().is_block_terminator) FinalizeBlock();
+    if (op.IsBlockTerminator()) FinalizeBlock();
     return result;
   }
 
@@ -2516,7 +3658,7 @@ class Assembler : public GraphVisitor<Assembler<Reducers>>,
     // block is not reachable.
     intermediate_block->AddPredecessor(source);
 
-    // Updating {source}'s last Branch/Switch/CallAndCatchException. Note that
+    // Updating {source}'s last Branch/Switch/CheckException. Note that
     // this must be done before Binding {intermediate_block}, otherwise,
     // Reducer::Bind methods will see an invalid block being bound (because its
     // predecessor would be a branch, but none of its targets would be the block
@@ -2537,18 +3679,23 @@ class Assembler : public GraphVisitor<Assembler<Reducers>>,
         }
         break;
       }
-      case Opcode::kCallAndCatchException: {
-        CallAndCatchExceptionOp& catch_exception =
-            op.Cast<CallAndCatchExceptionOp>();
-        if (catch_exception.if_success == destination) {
-          catch_exception.if_success = intermediate_block;
-          // We enforce that CallAndCatchException's if_success and if_exception
+      case Opcode::kCheckException: {
+        CheckExceptionOp& catch_exception_op = op.Cast<CheckExceptionOp>();
+        if (catch_exception_op.didnt_throw_block == destination) {
+          catch_exception_op.didnt_throw_block = intermediate_block;
+          // We assume that CheckException's successor and catch_block
           // can never be the same (there is a DCHECK in
-          // Assembler::CallAndCatchException enforcing that).
-          DCHECK_NE(catch_exception.if_exception, destination);
+          // CheckExceptionOp::Validate enforcing that).
+          DCHECK_NE(catch_exception_op.catch_block, destination);
         } else {
-          DCHECK_EQ(catch_exception.if_exception, destination);
-          catch_exception.if_exception = intermediate_block;
+          DCHECK_EQ(catch_exception_op.catch_block, destination);
+          catch_exception_op.catch_block = intermediate_block;
+          // A catch block always has to start with a `CatchBlockBeginOp`.
+          BindReachable(intermediate_block);
+          intermediate_block->SetOrigin(source->OriginForBlockEnd());
+          this->CatchBlockBegin();
+          this->Goto(destination);
+          return;
         }
         break;
       }
@@ -2588,6 +3735,7 @@ class Assembler : public GraphVisitor<Assembler<Reducers>>,
   }
 
   Block* current_block_ = nullptr;
+  Block* current_catch_block_ = nullptr;
   bool generating_unreachable_operations_ = false;
   // TODO(dmercadier,tebbi): remove {current_operation_origin_} and pass instead
   // additional parameters to ReduceXXX methods.
@@ -2626,6 +3774,38 @@ class Assembler : public GraphVisitor<Assembler<Reducers>>,
 #endif  // DEBUG
 };
 
+template <class Reducers>
+class Assembler<Reducers>::CatchScope {
+ public:
+  CatchScope(Assembler& assembler, Block* catch_block)
+      : assembler_(assembler),
+        previous_catch_block_(assembler.current_catch_block_) {
+    assembler_.current_catch_block_ = catch_block;
+#ifdef DEBUG
+    this->catch_block = catch_block;
+#endif
+  }
+
+  ~CatchScope() {
+    DCHECK_EQ(assembler_.current_catch_block_, catch_block);
+    assembler_.current_catch_block_ = previous_catch_block_;
+  }
+
+  CatchScope& operator=(const CatchScope&) = delete;
+  CatchScope(const CatchScope&) = delete;
+  CatchScope& operator=(CatchScope&&) = delete;
+  CatchScope(CatchScope&&) = delete;
+
+ private:
+  Assembler& assembler_;
+  Block* previous_catch_block_;
+#ifdef DEBUG
+  Block* catch_block = nullptr;
+#endif
+
+  friend class Assembler;
+};
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_ASSEMBLER_H_
diff --git a/deps/v8/src/compiler/turboshaft/assert-types-reducer.h b/deps/v8/src/compiler/turboshaft/assert-types-reducer.h
index fcbe01daa33269..5f38e451238af1 100644
--- a/deps/v8/src/compiler/turboshaft/assert-types-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/assert-types-reducer.h
@@ -14,6 +14,7 @@
 #include "src/compiler/frame.h"
 #include "src/compiler/turboshaft/assembler.h"
 #include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/phase.h"
 #include "src/compiler/turboshaft/representations.h"
 #include "src/compiler/turboshaft/sidetable.h"
 #include "src/compiler/turboshaft/type-inference-reducer.h"
@@ -23,29 +24,23 @@
 
 namespace v8::internal::compiler::turboshaft {
 
-struct AssertTypesReducerArgs {
-  Isolate* isolate;
-};
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
 
 template <class Next>
 class AssertTypesReducer
     : public UniformReducerAdapter<AssertTypesReducer, Next> {
-  // TODO(nicohartmann@): Reenable this in a way that compiles with msvc light.
-  // static_assert(next_contains_reducer<Next, TypeInferenceReducer>::value);
+#if defined(__clang__)
+  static_assert(next_contains_reducer<Next, TypeInferenceReducer>::value);
+#endif
 
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
   using Adapter = UniformReducerAdapter<AssertTypesReducer, Next>;
-  using ArgT =
-      base::append_tuple_type<typename Next::ArgT, AssertTypesReducerArgs>;
-
-  template <typename... Args>
-  explicit AssertTypesReducer(const std::tuple<Args...>& args)
-      : Adapter(args),
-        isolate_(std::get<AssertTypesReducerArgs>(args).isolate) {}
 
-  uint32_t NoContextConstant() { return IntToSmi(Context::kNoContext); }
+  i::Tagged<Smi> NoContextConstant() {
+    return Smi::FromInt(Context::kNoContext);
+  }
 
   template <typename Op, typename Continuation>
   OpIndex ReduceInputGraphOperation(OpIndex ig_index, const Op& operation) {
@@ -54,12 +49,12 @@ class AssertTypesReducer
     if (!CanBeTyped(operation)) return og_index;
     // Unfortunately, we cannot insert assertions after block terminators, so we
     // skip them here.
-    if (operation.Properties().is_block_terminator) return og_index;
+    if (operation.IsBlockTerminator()) return og_index;
 
     auto reps = operation.outputs_rep();
     DCHECK_GT(reps.size(), 0);
     if (reps.size() == 1) {
-      Type type = Asm().GetInputGraphType(ig_index);
+      Type type = __ GetInputGraphType(ig_index);
       InsertTypeAssert(reps[0], og_index, type);
     }
     return og_index;
@@ -69,7 +64,7 @@ class AssertTypesReducer
                         const Type& type) {
     DCHECK(!type.IsInvalid());
     if (type.IsNone()) {
-      Asm().Unreachable();
+      __ Unreachable();
       return;
     }
 
@@ -82,22 +77,21 @@ class AssertTypesReducer
         [this](Builtin builtin, OpIndex original_value,
                base::SmallVector<OpIndex, 6> actual_value_indices,
                const Type& type) {
-          uint32_t op_id = static_cast<uint32_t>(IntToSmi(original_value.id()));
+          i::Tagged<Smi> op_id = Smi::FromInt(original_value.id());
           // Add expected type and operation id.
           Handle<TurboshaftType> expected_type = type.AllocateOnHeap(factory());
-          actual_value_indices.push_back(Asm().HeapConstant(expected_type));
-          actual_value_indices.push_back(Asm().Word32Constant(op_id));
-          actual_value_indices.push_back(
-              Asm().Word32Constant(NoContextConstant()));
-          Asm().CallBuiltin(
+          actual_value_indices.push_back(__ HeapConstant(expected_type));
+          actual_value_indices.push_back(__ SmiConstant(op_id));
+          actual_value_indices.push_back(__ SmiConstant(NoContextConstant()));
+          __ CallBuiltin(
               builtin, OpIndex::Invalid(),
               {actual_value_indices.data(), actual_value_indices.size()},
-              isolate_);
+              CanThrow::kNo, isolate_);
 #ifdef DEBUG
           // Used for debugging
           if (v8_flags.turboshaft_trace_typing) {
             PrintF("Inserted assert for %3d:%-40s (%s)\n", original_value.id(),
-                   Asm().output_graph().Get(original_value).ToString().c_str(),
+                   __ output_graph().Get(original_value).ToString().c_str(),
                    type.ToString().c_str());
           }
 #endif
@@ -113,9 +107,9 @@ class AssertTypesReducer
       }
       case RegisterRepresentation::Word64(): {
         DCHECK(type.IsWord64());
-        OpIndex value_high = Asm().Word64ShiftRightLogical(
-            value, Asm().Word64Constant(static_cast<uint64_t>(32)));
-        OpIndex value_low = value;  // Use implicit truncation to word32.
+        OpIndex value_high =
+            __ TruncateWord64ToWord32(__ Word64ShiftRightLogical(value, 32));
+        OpIndex value_low = __ TruncateWord64ToWord32(value);
         base::SmallVector<OpIndex, 6> actual_value_indices = {value_high,
                                                               value_low};
         GenerateBuiltinCall(Builtin::kCheckTurboshaftWord64Type, value,
@@ -138,6 +132,7 @@ class AssertTypesReducer
       }
       case RegisterRepresentation::Tagged():
       case RegisterRepresentation::Compressed():
+      case RegisterRepresentation::Simd128():
         // TODO(nicohartmann@): Handle remaining cases.
         break;
     }
@@ -145,9 +140,11 @@ class AssertTypesReducer
 
  private:
   Factory* factory() { return isolate_->factory(); }
-  Isolate* isolate_;
+  Isolate* isolate_ = PipelineData::Get().isolate();
 };
 
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_ASSERT_TYPES_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/branch-elimination-reducer.h b/deps/v8/src/compiler/turboshaft/branch-elimination-reducer.h
index 25f65ca0914f63..b74dba15c1ee1a 100644
--- a/deps/v8/src/compiler/turboshaft/branch-elimination-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/branch-elimination-reducer.h
@@ -16,6 +16,8 @@
 
 namespace v8::internal::compiler::turboshaft {
 
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
 template <class Next>
 class BranchEliminationReducer : public Next {
   // # General overview
@@ -113,6 +115,23 @@ class BranchEliminationReducer : public Next {
   //               \  /
   //              merge2
   //
+  //   2bis- In the 2nd optimization, if `cond` is a Phi of 2 values that come
+  //   from B1 and B2, then the same optimization can be applied for a similar
+  //   result. For instance:
+  //
+  //     if (cond) {                                if (cond) {
+  //       x = 1                                        x = 1;
+  //     } else {                becomes                B1
+  //       x = 0                 ======>            } else {
+  //     }                                              x = 0;
+  //     if (x) B1 else B2                              B2;
+  //                                                }
+  //
+  //   If `x` is more complex than a simple boolean, then the 2nd branch will
+  //   remain, except that it will be on `x`'s value directly rather than on a
+  //   Phi (so, it avoids creating a Phi, and it will probably be better for
+  //   branch prediction).
+  //
   //
   //   3- Optimizing {Return} nodes through merges. It checks that
   //    the return value is actually a {Phi} and the Return is dominated
@@ -170,13 +189,6 @@ class BranchEliminationReducer : public Next {
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
-  template <class... Args>
-  explicit BranchEliminationReducer(const std::tuple<Args...>& args)
-      : Next(args),
-        dominator_path_(Asm().phase_zone()),
-        known_conditions_(Asm().phase_zone(),
-                          Asm().input_graph().DominatorTreeDepth() * 2) {}
-
   void Bind(Block* new_block) {
     Next::Bind(new_block);
 
@@ -213,8 +225,8 @@ class BranchEliminationReducer : public Next {
     }
   }
 
-  OpIndex ReduceBranch(OpIndex cond, Block* if_true, Block* if_false,
-                       BranchHint hint) {
+  OpIndex REDUCE(Branch)(OpIndex cond, Block* if_true, Block* if_false,
+                         BranchHint hint) {
     LABEL_BLOCK(no_change) {
       return Next::ReduceBranch(cond, if_true, if_false, hint);
     }
@@ -252,9 +264,9 @@ class BranchEliminationReducer : public Next {
     goto no_change;
   }
 
-  OpIndex ReduceSelect(OpIndex cond, OpIndex vtrue, OpIndex vfalse,
-                       RegisterRepresentation rep, BranchHint hint,
-                       SelectOp::Implementation implem) {
+  OpIndex REDUCE(Select)(OpIndex cond, OpIndex vtrue, OpIndex vfalse,
+                         RegisterRepresentation rep, BranchHint hint,
+                         SelectOp::Implementation implem) {
     LABEL_BLOCK(no_change) {
       return Next::ReduceSelect(cond, vtrue, vfalse, rep, hint, implem);
     }
@@ -270,29 +282,27 @@ class BranchEliminationReducer : public Next {
     goto no_change;
   }
 
-  OpIndex ReduceGoto(Block* destination) {
+  OpIndex REDUCE(Goto)(Block* destination) {
     LABEL_BLOCK(no_change) { return Next::ReduceGoto(destination); }
     if (ShouldSkipOptimizationStep()) goto no_change;
 
-    if (const Block* destination_origin = destination->OriginForBlockStart()) {
-      if (!destination_origin->IsMerge()) goto no_change;
-      if (destination_origin->HasExactlyNPredecessors(1)) {
-        // There is no point in trying the 2nd optimization: this would remove
-        // neither Phi nor Branch.
-        // TODO(dmercadier, tebbi): this block has a single predecessor and a
-        // single successor, so we might want to inline it.
-        goto no_change;
-      }
-      const Operation& last_op =
-          destination_origin->LastOperation(Asm().input_graph());
-      if (const BranchOp* branch = last_op.template TryCast<BranchOp>()) {
-        OpIndex condition =
-            Asm().template MapToNewGraph<true>(branch->condition());
-        if (!condition.valid()) {
-          // The condition of the subsequent block's Branch hasn't been visited
-          // before, so we definitely don't know its value.
-          goto no_change;
-        }
+    const Block* destination_origin = destination->OriginForBlockStart();
+    if (!destination_origin || !destination_origin->IsMerge()) goto no_change;
+
+    if (destination_origin->HasExactlyNPredecessors(1)) {
+      // There is no point in trying the 2nd optimization: this would remove
+      // neither Phi nor Branch.
+      // TODO(dmercadier, tebbi): this block has a single predecessor and a
+      // single successor, so we might want to inline it.
+      goto no_change;
+    }
+
+    const Operation& last_op =
+        destination_origin->LastOperation(Asm().input_graph());
+    if (const BranchOp* branch = last_op.template TryCast<BranchOp>()) {
+      OpIndex condition =
+          Asm().template MapToNewGraph<true>(branch->condition());
+      if (condition.valid()) {
         base::Optional<bool> condition_value = known_conditions_.Get(condition);
         if (!condition_value.has_value()) {
           // We've already visited the subsequent block's Branch condition, but
@@ -306,25 +316,40 @@ class BranchEliminationReducer : public Next {
         // its current Branch.
         Asm().CloneAndInlineBlock(destination_origin);
         return OpIndex::Invalid();
-      } else if (const ReturnOp* return_op =
-                     last_op.template TryCast<ReturnOp>()) {
-        // The destination block in the old graph ends with a Return
-        // and the old destination is a merge block, so we can directly
-        // inline the destination block in place of the Goto.
-        // TODO(nicohartmann@): Temporarily disable this "optimization" because
-        // it prevents dead code elimination in some cases. Reevaluate this and
-        // reenable if phases have been reordered properly.
-        // Asm().CloneAndInlineBlock(old_dst);
-        // return OpIndex::Invalid();
+      } else {
+        // Optimization 2bis:
+        // {condition} hasn't been visited yet, and thus it doesn't have a
+        // mapping to the new graph. However, if it's the result of a Phi whose
+        // input is coming from the current block, then it still makes sense to
+        // inline {destination_origin}: the condition will then be known.
+        if (destination_origin->Contains(branch->condition())) {
+          const PhiOp* cond = Asm()
+                                  .input_graph()
+                                  .Get(branch->condition())
+                                  .template TryCast<PhiOp>();
+          if (!cond) goto no_change;
+          Asm().CloneAndInlineBlock(destination_origin);
+          return OpIndex::Invalid();
+        }
       }
+    } else if (const ReturnOp* return_op =
+                   last_op.template TryCast<ReturnOp>()) {
+      // The destination block in the old graph ends with a Return
+      // and the old destination is a merge block, so we can directly
+      // inline the destination block in place of the Goto.
+      // TODO(nicohartmann@): Temporarily disable this "optimization" because
+      // it prevents dead code elimination in some cases. Reevaluate this and
+      // reenable if phases have been reordered properly.
+      // Asm().CloneAndInlineBlock(old_dst);
+      // return OpIndex::Invalid();
     }
 
     goto no_change;
   }
 
-  OpIndex ReduceDeoptimizeIf(OpIndex condition, OpIndex frame_state,
-                             bool negated,
-                             const DeoptimizeParameters* parameters) {
+  OpIndex REDUCE(DeoptimizeIf)(OpIndex condition, OpIndex frame_state,
+                               bool negated,
+                               const DeoptimizeParameters* parameters) {
     LABEL_BLOCK(no_change) {
       return Next::ReduceDeoptimizeIf(condition, frame_state, negated,
                                       parameters);
@@ -332,7 +357,10 @@ class BranchEliminationReducer : public Next {
     if (ShouldSkipOptimizationStep()) goto no_change;
 
     base::Optional<bool> condition_value = known_conditions_.Get(condition);
-    if (!condition_value.has_value()) goto no_change;
+    if (!condition_value.has_value()) {
+      known_conditions_.InsertNewKey(condition, negated);
+      goto no_change;
+    }
 
     if ((*condition_value && !negated) || (!*condition_value && negated)) {
       // The condition is true, so we always deoptimize.
@@ -343,22 +371,30 @@ class BranchEliminationReducer : public Next {
     }
   }
 
-  OpIndex ReduceTrapIf(OpIndex condition, bool negated, const TrapId trap_id) {
+  OpIndex REDUCE(TrapIf)(OpIndex condition, OpIndex frame_state, bool negated,
+                         const TrapId trap_id) {
     LABEL_BLOCK(no_change) {
-      return Next::ReduceTrapIf(condition, negated, trap_id);
+      return Next::ReduceTrapIf(condition, frame_state, negated, trap_id);
     }
     if (ShouldSkipOptimizationStep()) goto no_change;
 
     base::Optional<bool> condition_value = known_conditions_.Get(condition);
-    if (!condition_value.has_value()) goto no_change;
+    if (!condition_value.has_value()) {
+      known_conditions_.InsertNewKey(condition, negated);
+      goto no_change;
+    }
 
-    if ((*condition_value && !negated) || (!*condition_value && negated)) {
-      // The condition is true, so we always trap.
-      return Next::ReduceUnreachable();
+    if (Asm().template Is<ConstantOp>(condition)) {
+      goto no_change;
+    }
+
+    OpIndex static_condition = Asm().Word32Constant(*condition_value);
+    if (negated) {
+      Asm().TrapIfNot(static_condition, frame_state, trap_id);
     } else {
-      // The condition is false, so we never trap.
-      return OpIndex::Invalid();
+      Asm().TrapIf(static_condition, frame_state, trap_id);
     }
+    return OpIndex::Invalid();
   }
 
  private:
@@ -467,10 +503,13 @@ class BranchEliminationReducer : public Next {
   // TODO(dmercadier): use the SnapshotTable to replace {dominator_path_} and
   // {known_conditions_}, and to reuse the existing merging/replay logic of the
   // SnapshotTable.
-  ZoneVector<Block*> dominator_path_;
-  LayeredHashMap<OpIndex, bool> known_conditions_;
+  ZoneVector<Block*> dominator_path_{Asm().phase_zone()};
+  LayeredHashMap<OpIndex, bool> known_conditions_{
+      Asm().phase_zone(), Asm().input_graph().DominatorTreeDepth() * 2};
 };
 
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_BRANCH_ELIMINATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/build-graph-phase.cc b/deps/v8/src/compiler/turboshaft/build-graph-phase.cc
index 70fc39a4481c95..ab8133ddf2a077 100644
--- a/deps/v8/src/compiler/turboshaft/build-graph-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/build-graph-phase.cc
@@ -6,23 +6,19 @@
 
 #include "src/compiler/js-heap-broker.h"
 #include "src/compiler/turboshaft/graph-builder.h"
+#include "src/compiler/turboshaft/phase.h"
 
 namespace v8::internal::compiler::turboshaft {
 
-base::Optional<BailoutReason> BuildGraphPhase::Run(PipelineData* data,
-                                                   Zone* temp_zone,
+base::Optional<BailoutReason> BuildGraphPhase::Run(Zone* temp_zone,
                                                    Linkage* linkage) {
-  Schedule* schedule = data->schedule();
-  data->reset_schedule();
+  Schedule* schedule = PipelineData::Get().schedule();
+  PipelineData::Get().reset_schedule();
   DCHECK_NOT_NULL(schedule);
-  data->CreateTurboshaftGraph();
 
-  UnparkedScopeIfNeeded scope(data->broker());
+  UnparkedScopeIfNeeded scope(PipelineData::Get().broker());
 
-  if (auto bailout = turboshaft::BuildGraph(
-          data->broker(), schedule, data->isolate(), data->graph_zone(),
-          temp_zone, &data->graph(), linkage, data->source_positions(),
-          data->node_origins())) {
+  if (auto bailout = turboshaft::BuildGraph(schedule, temp_zone, linkage)) {
     return bailout;
   }
   return {};
diff --git a/deps/v8/src/compiler/turboshaft/build-graph-phase.h b/deps/v8/src/compiler/turboshaft/build-graph-phase.h
index 3c49de7aa928f6..46539694a82025 100644
--- a/deps/v8/src/compiler/turboshaft/build-graph-phase.h
+++ b/deps/v8/src/compiler/turboshaft/build-graph-phase.h
@@ -14,8 +14,7 @@ namespace v8::internal::compiler::turboshaft {
 struct BuildGraphPhase {
   DECL_TURBOSHAFT_PHASE_CONSTANTS(BuildGraph)
 
-  base::Optional<BailoutReason> Run(PipelineData* data, Zone* temp_zone,
-                                    Linkage* linkage);
+  base::Optional<BailoutReason> Run(Zone* temp_zone, Linkage* linkage);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/builtin-call-descriptors.h b/deps/v8/src/compiler/turboshaft/builtin-call-descriptors.h
index 92969514e1cac9..bdc7f507a432cc 100644
--- a/deps/v8/src/compiler/turboshaft/builtin-call-descriptors.h
+++ b/deps/v8/src/compiler/turboshaft/builtin-call-descriptors.h
@@ -5,11 +5,13 @@
 #ifndef V8_COMPILER_TURBOSHAFT_BUILTIN_CALL_DESCRIPTORS_H_
 #define V8_COMPILER_TURBOSHAFT_BUILTIN_CALL_DESCRIPTORS_H_
 
+#include "src/builtins/builtins.h"
 #include "src/codegen/callable.h"
 #include "src/codegen/interface-descriptors.h"
 #include "src/compiler/frame.h"
 #include "src/compiler/turboshaft/operations.h"
 #include "src/compiler/turboshaft/representations.h"
+#include "src/compiler/write-barrier-kind.h"
 
 namespace v8::internal::compiler::turboshaft {
 
@@ -28,7 +30,9 @@ struct BuiltinCallDescriptor {
 #ifdef DEBUG
       Derived::Verify(descriptor);
 #endif  // DEBUG
-      return TSCallDescriptor::Create(descriptor, zone);
+      bool can_throw = !(Derived::Properties & Operator::kNoThrow);
+      return TSCallDescriptor::Create(
+          descriptor, can_throw ? CanThrow::kYes : CanThrow::kNo, zone);
     }
 
 #ifdef DEBUG
@@ -45,8 +49,8 @@ struct BuiltinCallDescriptor {
       }
       DCHECK_EQ(desc->NeedsFrameState(), Derived::NeedsFrameState);
       DCHECK_EQ(desc->properties(), Derived::Properties);
-      DCHECK_EQ(desc->ParameterCount(),
-                std::tuple_size_v<arguments_t> + Derived::NeedsContext);
+      DCHECK_EQ(desc->ParameterCount(), std::tuple_size_v<arguments_t> +
+                                            (Derived::NeedsContext ? 1 : 0));
       DCHECK(VerifyArguments<arguments_t>(desc));
     }
 
@@ -68,9 +72,163 @@ struct BuiltinCallDescriptor {
 #endif  // DEBUG
   };
 
-  using Boolean = Oddball;
+  static constexpr OpEffects base_effects = OpEffects().CanDependOnChecks();
 
  public:
+  struct CheckTurbofanType : public Descriptor<CheckTurbofanType> {
+    static constexpr auto Function = Builtin::kCheckTurbofanType;
+    using arguments_t = std::tuple<V<Object>, V<TurbofanType>, V<Smi>>;
+    using result_t = V<Object>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = true;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoThrow | Operator::kNoDeopt;
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().RequiredWhenUnused();
+  };
+
+  struct CopyFastSmiOrObjectElements
+      : public Descriptor<CopyFastSmiOrObjectElements> {
+    static constexpr auto Function = Builtin::kCopyFastSmiOrObjectElements;
+    using arguments_t = std::tuple<V<Object>>;
+    using result_t = V<Object>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects =
+        base_effects.CanWriteMemory().CanReadMemory().CanAllocate();
+  };
+
+  template <Builtin B, typename Input>
+  struct DebugPrint : public Descriptor<DebugPrint<B, Input>> {
+    static constexpr auto Function = B;
+    using arguments_t = std::tuple<V<Input>>;
+    using result_t = V<Object>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = true;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoThrow | Operator::kNoDeopt;
+    static constexpr OpEffects Effects = base_effects.RequiredWhenUnused();
+  };
+  using DebugPrintFloat64 = DebugPrint<Builtin::kDebugPrintFloat64, Float64>;
+  using DebugPrintWordPtr = DebugPrint<Builtin::kDebugPrintWordPtr, WordPtr>;
+
+  template <Builtin B>
+  struct FindOrderedHashEntry : public Descriptor<FindOrderedHashEntry<B>> {
+    static constexpr auto Function = B;
+    using arguments_t = std::tuple<V<Object>, V<Smi>>;
+    using result_t = V<Smi>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = true;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects = base_effects.CanReadMemory();
+  };
+  using FindOrderedHashMapEntry =
+      FindOrderedHashEntry<Builtin::kFindOrderedHashMapEntry>;
+  using FindOrderedHashSetEntry =
+      FindOrderedHashEntry<Builtin::kFindOrderedHashSetEntry>;
+
+  template <Builtin B>
+  struct GrowFastElements : public Descriptor<GrowFastElements<B>> {
+    static constexpr auto Function = B;
+    using arguments_t = std::tuple<V<Object>, V<Smi>>;
+    using result_t = V<Object>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects =
+        base_effects.CanWriteMemory().CanReadMemory().CanAllocate();
+  };
+  using GrowFastDoubleElements =
+      GrowFastElements<Builtin::kGrowFastDoubleElements>;
+  using GrowFastSmiOrObjectElements =
+      GrowFastElements<Builtin::kGrowFastSmiOrObjectElements>;
+
+  template <Builtin B>
+  struct NewArgumentsElements : public Descriptor<NewArgumentsElements<B>> {
+    static constexpr auto Function = B;
+    // TODO(nicohartmann@): First argument should be replaced by a proper
+    // RawPtr.
+    using arguments_t = std::tuple<V<WordPtr>, V<WordPtr>, V<Smi>>;
+    using result_t = V<FixedArray>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects = base_effects.CanAllocate();
+  };
+  using NewSloppyArgumentsElements =
+      NewArgumentsElements<Builtin::kNewSloppyArgumentsElements>;
+  using NewStrictArgumentsElements =
+      NewArgumentsElements<Builtin::kNewStrictArgumentsElements>;
+  using NewRestArgumentsElements =
+      NewArgumentsElements<Builtin::kNewRestArgumentsElements>;
+
+  struct NumberToString : public Descriptor<NumberToString> {
+    static constexpr auto Function = Builtin::kNumberToString;
+    using arguments_t = std::tuple<V<Number>>;
+    using result_t = V<String>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
+  };
+
+  struct PlainPrimitiveToNumber : public Descriptor<PlainPrimitiveToNumber> {
+    static constexpr auto Function = Builtin::kPlainPrimitiveToNumber;
+    using arguments_t = std::tuple<V<PlainPrimitive>>;
+    using result_t = V<Number>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
+  };
+
+  struct SameValue : public Descriptor<SameValue> {
+    static constexpr auto Function = Builtin::kSameValue;
+    using arguments_t = std::tuple<V<Object>, V<Object>>;
+    using result_t = V<Boolean>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects = base_effects.CanReadMemory();
+  };
+
+  struct SameValueNumbersOnly : public Descriptor<SameValueNumbersOnly> {
+    static constexpr auto Function = Builtin::kSameValueNumbersOnly;
+    using arguments_t = std::tuple<V<Object>, V<Object>>;
+    using result_t = V<Boolean>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects = base_effects.CanReadMemory();
+  };
+
+  struct StringAdd_CheckNone : public Descriptor<StringAdd_CheckNone> {
+    static constexpr auto Function = Builtin::kStringAdd_CheckNone;
+    using arguments_t = std::tuple<V<String>, V<String>>;
+    using result_t = V<String>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = true;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    // This will only write in a fresh object, so the writes are not visible
+    // from Turboshaft, and CanAllocate is enough.
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
+  };
+
   struct StringEqual : public Descriptor<StringEqual> {
     static constexpr auto Function = Builtin::kStringEqual;
     using arguments_t = std::tuple<V<String>, V<String>, V<WordPtr>>;
@@ -79,6 +237,10 @@ struct BuiltinCallDescriptor {
     static constexpr bool NeedsFrameState = false;
     static constexpr bool NeedsContext = false;
     static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    // If the strings aren't flat, StringEqual could flatten them, which will
+    // allocate new strings.
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
   };
 
   struct StringFromCodePointAt : public Descriptor<StringFromCodePointAt> {
@@ -89,6 +251,8 @@ struct BuiltinCallDescriptor {
     static constexpr bool NeedsFrameState = false;
     static constexpr bool NeedsContext = false;
     static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
   };
 
   struct StringIndexOf : public Descriptor<StringIndexOf> {
@@ -99,6 +263,10 @@ struct BuiltinCallDescriptor {
     static constexpr bool NeedsFrameState = false;
     static constexpr bool NeedsContext = false;
     static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    // StringIndexOf does a ToString on the receiver, which can allocate a new
+    // string.
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
   };
 
   template <Builtin B>
@@ -110,6 +278,7 @@ struct BuiltinCallDescriptor {
     static constexpr bool NeedsFrameState = false;
     static constexpr bool NeedsContext = false;
     static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects = base_effects.CanReadMemory();
   };
   using StringLessThan = StringComparison<Builtin::kStringLessThan>;
   using StringLessThanOrEqual =
@@ -123,6 +292,8 @@ struct BuiltinCallDescriptor {
     static constexpr bool NeedsFrameState = false;
     static constexpr bool NeedsContext = false;
     static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
   };
 
 #ifdef V8_INTL_SUPPORT
@@ -135,8 +306,103 @@ struct BuiltinCallDescriptor {
     static constexpr bool NeedsContext = true;
     static constexpr Operator::Properties Properties =
         Operator::kNoDeopt | Operator::kNoThrow;
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
   };
 #endif  // V8_INTL_SUPPORT
+
+  struct StringToNumber : public Descriptor<StringToNumber> {
+    static constexpr auto Function = Builtin::kStringToNumber;
+    using arguments_t = std::tuple<V<String>>;
+    using result_t = V<Number>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
+  };
+
+  struct ToBoolean : public Descriptor<ToBoolean> {
+    static constexpr auto Function = Builtin::kToBoolean;
+    using arguments_t = std::tuple<V<Object>>;
+    using result_t = V<Boolean>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects = base_effects.CanReadMemory();
+  };
+
+  struct ToObject : public Descriptor<ToObject> {
+    static constexpr auto Function = Builtin::kToObject;
+    using arguments_t = std::tuple<V<Object>>;
+    using result_t = V<Object>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = true;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects =
+        base_effects.CanReadMemory().CanAllocate();
+  };
+
+  struct Typeof : public Descriptor<Typeof> {
+    static constexpr auto Function = Builtin::kTypeof;
+    using arguments_t = std::tuple<V<Object>>;
+    using result_t = V<String>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties = Operator::kEliminatable;
+    static constexpr OpEffects Effects = base_effects.CanReadMemory();
+  };
+
+  struct CheckTurboshaftWord32Type
+      : public Descriptor<CheckTurboshaftWord32Type> {
+    static constexpr auto Function = Builtin::kCheckTurboshaftWord32Type;
+    using arguments_t = std::tuple<V<Word32>, V<TurboshaftWord32Type>, V<Smi>>;
+    using result_t = V<Oddball>;
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoDeopt | Operator::kNoThrow;
+  };
+
+  struct CheckTurboshaftWord64Type
+      : public Descriptor<CheckTurboshaftWord64Type> {
+    static constexpr auto Function = Builtin::kCheckTurboshaftWord64Type;
+    using arguments_t =
+        std::tuple<V<Word32>, V<Word32>, V<TurboshaftWord64Type>, V<Smi>>;
+    using result_t = V<Oddball>;
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoDeopt | Operator::kNoThrow;
+  };
+
+  struct CheckTurboshaftFloat32Type
+      : public Descriptor<CheckTurboshaftFloat32Type> {
+    static constexpr auto Function = Builtin::kCheckTurboshaftFloat32Type;
+    using arguments_t =
+        std::tuple<V<Float32>, V<TurboshaftFloat64Type>, V<Smi>>;
+    using result_t = V<Oddball>;
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoDeopt | Operator::kNoThrow;
+  };
+
+  struct CheckTurboshaftFloat64Type
+      : public Descriptor<CheckTurboshaftFloat64Type> {
+    static constexpr auto Function = Builtin::kCheckTurboshaftFloat64Type;
+    using arguments_t =
+        std::tuple<V<Float64>, V<TurboshaftFloat64Type>, V<Smi>>;
+    using result_t = V<Oddball>;
+    static constexpr bool NeedsFrameState = false;
+    static constexpr bool NeedsContext = false;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoDeopt | Operator::kNoThrow;
+  };
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/dead-code-elimination-phase.cc b/deps/v8/src/compiler/turboshaft/dead-code-elimination-phase.cc
index b9de41214d3fef..b5093825acff8f 100644
--- a/deps/v8/src/compiler/turboshaft/dead-code-elimination-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/dead-code-elimination-phase.cc
@@ -7,13 +7,21 @@
 #include "src/compiler/js-heap-broker.h"
 #include "src/compiler/turboshaft/dead-code-elimination-reducer.h"
 
+#if V8_ENABLE_WEBASSEMBLY
+#include "src/compiler/turboshaft/wasm-js-lowering-reducer.h"
+#endif
+
 namespace v8::internal::compiler::turboshaft {
 
-void DeadCodeEliminationPhase::Run(PipelineData* data, Zone* temp_zone) {
-  UnparkedScopeIfNeeded scope(data->broker(), DEBUG_BOOL);
+void DeadCodeEliminationPhase::Run(Zone* temp_zone) {
+  UnparkedScopeIfNeeded scope(PipelineData::Get().broker(), DEBUG_BOOL);
 
-  turboshaft::OptimizationPhase<turboshaft::DeadCodeEliminationReducer>::Run(
-      data->isolate(), &data->graph(), temp_zone, data->node_origins());
+  turboshaft::OptimizationPhase<turboshaft::DeadCodeEliminationReducer
+#if V8_ENABLE_WEBASSEMBLY
+                                ,
+                                turboshaft::WasmJSLoweringReducer
+#endif
+                                >::Run(temp_zone);
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/dead-code-elimination-phase.h b/deps/v8/src/compiler/turboshaft/dead-code-elimination-phase.h
index edd95c4b99f308..b09a48d3879132 100644
--- a/deps/v8/src/compiler/turboshaft/dead-code-elimination-phase.h
+++ b/deps/v8/src/compiler/turboshaft/dead-code-elimination-phase.h
@@ -12,7 +12,7 @@ namespace v8::internal::compiler::turboshaft {
 struct DeadCodeEliminationPhase {
   DECL_TURBOSHAFT_PHASE_CONSTANTS(DeadCodeElimination)
 
-  void Run(PipelineData* data, Zone* temp_zone);
+  void Run(Zone* temp_zone);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/dead-code-elimination-reducer.h b/deps/v8/src/compiler/turboshaft/dead-code-elimination-reducer.h
index eee11e4e41eeb1..a401c54e807ae9 100644
--- a/deps/v8/src/compiler/turboshaft/dead-code-elimination-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/dead-code-elimination-reducer.h
@@ -17,6 +17,8 @@
 
 namespace v8::internal::compiler::turboshaft {
 
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
 // General overview
 //
 // DeadCodeAnalysis iterates the graph backwards to propagate liveness
@@ -25,7 +27,7 @@ namespace v8::internal::compiler::turboshaft {
 //
 // OperationState reflects the liveness of operations. An operation is live if
 //
-//   1) The operation has the `is_required_when_unused` property
+//   1) The operation has the `IsRequiredWhenUnused()` property.
 //   2) Any of its outputs is live (is used in a live operation).
 //
 // If the operation is not live, it is dead and can be eliminated.
@@ -271,7 +273,7 @@ class DeadCodeAnalysis {
             rewritable_branch_targets_.erase(it);
           }
         }
-      } else if (op.saturated_use_count == 0) {
+      } else if (op.saturated_use_count.IsZero()) {
         // Operation is already recognized as dead by a previous analysis.
         DCHECK_EQ(op_state, OperationState::kDead);
       } else if (op.Is<GotoOp>()) {
@@ -279,7 +281,7 @@ class DeadCodeAnalysis {
         // state, so we skip them here.
         liveness_[index] = OperationState::kLive;
         continue;
-      } else if (op.Properties().is_required_when_unused) {
+      } else if (op.IsRequiredWhenUnused()) {
         op_state = OperationState::kLive;
       } else if (op.Is<PhiOp>()) {
         has_live_phis = has_live_phis || (op_state == OperationState::kLive);
@@ -417,12 +419,6 @@ class DeadCodeEliminationReducer
 
   using Adapter = UniformReducerAdapter<DeadCodeEliminationReducer, Next>;
 
-  template <class... Args>
-  explicit DeadCodeEliminationReducer(const std::tuple<Args...>& args)
-      : Adapter(args),
-        branch_rewrite_targets_(Asm().phase_zone()),
-        analyzer_(Asm().modifiable_input_graph(), Asm().phase_zone()) {}
-
   void Analyze() {
     // TODO(nicohartmann@): We might want to make this a flag.
     constexpr bool trace_analysis = false;
@@ -431,7 +427,7 @@ class DeadCodeEliminationReducer
     Next::Analyze();
   }
 
-  OpIndex ReduceInputGraphBranch(OpIndex ig_index, const BranchOp& branch) {
+  OpIndex REDUCE_INPUT_GRAPH(Branch)(OpIndex ig_index, const BranchOp& branch) {
     auto it = branch_rewrite_targets_.find(ig_index.id());
     if (it != branch_rewrite_targets_.end()) {
       BlockIndex goto_target = it->second;
@@ -449,17 +445,15 @@ class DeadCodeEliminationReducer
     return Continuation{this}.ReduceInputGraph(ig_index, op);
   }
 
-  template <Opcode opcode, typename Continuation, typename... Args>
-  OpIndex ReduceOperation(const Args&... args) {
-    return Continuation{this}.Reduce(args...);
-  }
-
  private:
   base::Optional<FixedSidetable<OperationState::Liveness>> liveness_;
-  ZoneMap<uint32_t, BlockIndex> branch_rewrite_targets_;
-  DeadCodeAnalysis analyzer_;
+  ZoneMap<uint32_t, BlockIndex> branch_rewrite_targets_{Asm().phase_zone()};
+  DeadCodeAnalysis analyzer_{Asm().modifiable_input_graph(),
+                             Asm().phase_zone()};
 };
 
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_DEAD_CODE_ELIMINATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/debug-feature-lowering-phase.cc b/deps/v8/src/compiler/turboshaft/debug-feature-lowering-phase.cc
new file mode 100644
index 00000000000000..5220ae5e3d7dfb
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/debug-feature-lowering-phase.cc
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/debug-feature-lowering-phase.h"
+
+#include "src/compiler/turboshaft/debug-feature-lowering-reducer.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+void DebugFeatureLoweringPhase::Run(Zone* temp_zone) {
+  turboshaft::OptimizationPhase<turboshaft::DebugFeatureLoweringReducer>::Run(
+      temp_zone);
+}
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/tag-untag-lowering-phase.h b/deps/v8/src/compiler/turboshaft/debug-feature-lowering-phase.h
similarity index 50%
rename from deps/v8/src/compiler/turboshaft/tag-untag-lowering-phase.h
rename to deps/v8/src/compiler/turboshaft/debug-feature-lowering-phase.h
index c132cda4ac8f24..b20255b8b2bdbc 100644
--- a/deps/v8/src/compiler/turboshaft/tag-untag-lowering-phase.h
+++ b/deps/v8/src/compiler/turboshaft/debug-feature-lowering-phase.h
@@ -2,19 +2,19 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#ifndef V8_COMPILER_TURBOSHAFT_TAG_UNTAG_LOWERING_PHASE_H_
-#define V8_COMPILER_TURBOSHAFT_TAG_UNTAG_LOWERING_PHASE_H_
+#ifndef V8_COMPILER_TURBOSHAFT_DEBUG_FEATURE_LOWERING_PHASE_H_
+#define V8_COMPILER_TURBOSHAFT_DEBUG_FEATURE_LOWERING_PHASE_H_
 
 #include "src/compiler/turboshaft/phase.h"
 
 namespace v8::internal::compiler::turboshaft {
 
-struct TagUntagLoweringPhase {
-  DECL_TURBOSHAFT_PHASE_CONSTANTS(TagUntagLowering)
+struct DebugFeatureLoweringPhase {
+  DECL_TURBOSHAFT_PHASE_CONSTANTS(DebugFeatureLowering)
 
-  void Run(PipelineData* data, Zone* temp_zone);
+  void Run(Zone* temp_zone);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
 
-#endif  // V8_COMPILER_TURBOSHAFT_TAG_UNTAG_LOWERING_PHASE_H_
+#endif  // V8_COMPILER_TURBOSHAFT_DEBUG_FEATURE_LOWERING_PHASE_H_
diff --git a/deps/v8/src/compiler/turboshaft/debug-feature-lowering-reducer.h b/deps/v8/src/compiler/turboshaft/debug-feature-lowering-reducer.h
new file mode 100644
index 00000000000000..dbc21c68099b6f
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/debug-feature-lowering-reducer.h
@@ -0,0 +1,72 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_DEBUG_FEATURE_LOWERING_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_DEBUG_FEATURE_LOWERING_REDUCER_H_
+
+#include "src/compiler/js-heap-broker.h"
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/index.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/representations.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+template <typename Next>
+class DebugFeatureLoweringReducer : public Next {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  OpIndex REDUCE(DebugPrint)(OpIndex input, RegisterRepresentation rep) {
+    switch (rep.value()) {
+      case RegisterRepresentation::PointerSized():
+        __ CallBuiltin_DebugPrintWordPtr(isolate_, __ NoContextConstant(),
+                                         input);
+        break;
+      case RegisterRepresentation::Float64():
+        __ CallBuiltin_DebugPrintFloat64(isolate_, __ NoContextConstant(),
+                                         input);
+        break;
+      default:
+        // TODO(nicohartmann@): Support other representations.
+        UNIMPLEMENTED();
+    }
+    return {};
+  }
+
+  OpIndex REDUCE(StaticAssert)(OpIndex condition, const char* source) {
+    // Static asserts should be (statically asserted and) removed by turboshaft.
+    UnparkedScopeIfNeeded scope(broker_);
+    AllowHandleDereference allow_handle_dereference;
+    std::cout << __ output_graph().Get(condition);
+    FATAL(
+        "Expected Turbofan static assert to hold, but got non-true input:\n  "
+        "%s",
+        source);
+  }
+
+  OpIndex REDUCE(CheckTurboshaftTypeOf)(OpIndex input,
+                                        RegisterRepresentation rep, Type type,
+                                        bool successful) {
+    if (successful) return input;
+
+    UnparkedScopeIfNeeded scope(broker_);
+    AllowHandleDereference allow_handle_dereference;
+    FATAL("Checking type %s of operation %d:%s failed!",
+          type.ToString().c_str(), input.id(),
+          __ output_graph().Get(input).ToString().c_str());
+  }
+
+ private:
+  Isolate* isolate_ = PipelineData::Get().isolate();
+  JSHeapBroker* broker_ = PipelineData::Get().broker();
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_DEBUG_FEATURE_LOWERING_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/decompression-optimization-phase.cc b/deps/v8/src/compiler/turboshaft/decompression-optimization-phase.cc
index ae5c5aa2e8b150..794c353af75a2e 100644
--- a/deps/v8/src/compiler/turboshaft/decompression-optimization-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/decompression-optimization-phase.cc
@@ -8,9 +8,10 @@
 
 namespace v8::internal::compiler::turboshaft {
 
-void DecompressionOptimizationPhase::Run(PipelineData* data, Zone* temp_zone) {
+void DecompressionOptimizationPhase::Run(Zone* temp_zone) {
   if (!COMPRESS_POINTERS_BOOL) return;
-  turboshaft::RunDecompressionOptimization(data->graph(), temp_zone);
+  turboshaft::RunDecompressionOptimization(PipelineData::Get().graph(),
+                                           temp_zone);
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/decompression-optimization-phase.h b/deps/v8/src/compiler/turboshaft/decompression-optimization-phase.h
index 217be316aaa7c2..a282ce5d1728b9 100644
--- a/deps/v8/src/compiler/turboshaft/decompression-optimization-phase.h
+++ b/deps/v8/src/compiler/turboshaft/decompression-optimization-phase.h
@@ -10,9 +10,9 @@
 namespace v8::internal::compiler::turboshaft {
 
 struct DecompressionOptimizationPhase {
-  DECL_TURBOSHAFT_PHASE_CONSTANTS(DecompressionOptimization)
+  DECL_TURBOSHAFT_PHASE_CONSTANTS(DecompressionOpt)
 
-  void Run(PipelineData* data, Zone* temp_zone);
+  void Run(Zone* temp_zone);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/decompression-optimization.cc b/deps/v8/src/compiler/turboshaft/decompression-optimization.cc
index 24dec586f4dd6b..28791a580d17b2 100644
--- a/deps/v8/src/compiler/turboshaft/decompression-optimization.cc
+++ b/deps/v8/src/compiler/turboshaft/decompression-optimization.cc
@@ -20,15 +20,17 @@ namespace {
 // re-visit the loop if a loop phi backedge changes something. As a performance
 // optimization, we keep track of operations (`candidates`) that need to be
 // updated potentially, so that we don't have to walk the whole graph again.
-struct DecompressionAnalyzer : AnalyzerBase {
-  using Base = AnalyzerBase;
+struct DecompressionAnalyzer {
+  const Graph& graph;
+  Zone* phase_zone;
   // We use `uint8_t` instead of `bool` here to avoid the bitvector optimization
   // of std::vector.
   FixedSidetable<uint8_t> needs_decompression;
   ZoneVector<OpIndex> candidates;
 
   DecompressionAnalyzer(const Graph& graph, Zone* phase_zone)
-      : AnalyzerBase(graph, phase_zone),
+      : graph(graph),
+        phase_zone(phase_zone),
         needs_decompression(graph.op_id_count(), phase_zone),
         candidates(phase_zone) {
     candidates.reserve(graph.op_id_count() / 8);
diff --git a/deps/v8/src/compiler/turboshaft/define-assembler-macros.inc b/deps/v8/src/compiler/turboshaft/define-assembler-macros.inc
index dcdfdf57cdd578..89f49032580387 100644
--- a/deps/v8/src/compiler/turboshaft/define-assembler-macros.inc
+++ b/deps/v8/src/compiler/turboshaft/define-assembler-macros.inc
@@ -15,10 +15,14 @@
 
 #define V8_COMPILER_TURBOSHAFT_ASSEMBLER_MACROS_DEFINED 1
 
-#define BIND(label, ...)                                         \
-  auto [CONCAT(is_bound_, __LINE__), ##__VA_ARGS__] =            \
-    Asm().ControlFlowHelper_Bind(label);                         \
-    (detail::SuppressUnusedWarning(CONCAT(is_bound_, __LINE__)))
+#define LIKELY(...) ConditionWithHint(__VA_ARGS__, BranchHint::kTrue)
+#define UNLIKELY(...) ConditionWithHint(__VA_ARGS__, BranchHint::kFalse)
+
+#define BIND(label, ...)                                                  \
+  auto [CONCAT(is_bound_, __LINE__), ##__VA_ARGS__] =                     \
+    Asm().ControlFlowHelper_Bind(label);                                  \
+    (::v8::internal::compiler::turboshaft::detail::SuppressUnusedWarning( \
+        CONCAT(is_bound_, __LINE__)))
 #define LOOP(loop_label, ...) \
   for(auto [CONCAT(run_loop_, __LINE__), ##__VA_ARGS__] =                      \
     Asm().ControlFlowHelper_BindLoop(loop_label); CONCAT(run_loop_, __LINE__); \
@@ -27,43 +31,43 @@
 #define GOTO(label, ...)                             \
   Asm().ControlFlowHelper_Goto(label, {__VA_ARGS__})
 #define GOTO_IF(cond, label, ...)                            \
-  Asm().ControlFlowHelper_GotoIf(cond, label, {__VA_ARGS__}, \
-                                 BranchHint::kNone)
-#define GOTO_IF_LIKELY(cond, label, ...)                     \
-  Asm().ControlFlowHelper_GotoIf(cond, label, {__VA_ARGS__}, \
-                                 BranchHint::kTrue)
-#define GOTO_IF_UNLIKELY(cond, label, ...)                   \
-  Asm().ControlFlowHelper_GotoIf(cond, label, {__VA_ARGS__}, \
-                                 BranchHint::kFalse)
+  Asm().ControlFlowHelper_GotoIf(cond, label, {__VA_ARGS__})
 #define GOTO_IF_NOT(cond, label, ...)                           \
-  Asm().ControlFlowHelper_GotoIfNot(cond, label, {__VA_ARGS__}, \
-                                    BranchHint::kNone)
-#define GOTO_IF_NOT_LIKELY(cond, label, ...)                    \
-  Asm().ControlFlowHelper_GotoIfNot(cond, label, {__VA_ARGS__}, \
-                                    BranchHint::kFalse)
-#define GOTO_IF_NOT_UNLIKELY(cond, label, ...)                  \
-  Asm().ControlFlowHelper_GotoIfNot(cond, label, {__VA_ARGS__}, \
-                                    BranchHint::kTrue)
+  Asm().ControlFlowHelper_GotoIfNot(cond, label, {__VA_ARGS__})
 
-#define IF_WITH_HINT(cond, if_not, hint)                                   \
-  for (bool bound = Asm().ControlFlowHelper_If(cond, if_not, hint); bound; \
+#define IF(...)                                                            \
+  for (bool bound = Asm().ControlFlowHelper_If(__VA_ARGS__, false); bound; \
+       (bound = false), Asm().ControlFlowHelper_GotoEnd())
+#define IF_NOT(...)                                                       \
+  for (bool bound = Asm().ControlFlowHelper_If(__VA_ARGS__, true); bound; \
        (bound = false), Asm().ControlFlowHelper_GotoEnd())
-#define IF(cond) IF_WITH_HINT(cond, false, BranchHint::kNone)
-#define IF_LIKELY(cond) IF_WITH_HINT(cond, false, BranchHint::kTrue)
-#define IF_UNLIKELY(cond) IF_WITH_HINT(cond, false, BranchHint::kFalse)
-#define IF_NOT(cond) IF_WITH_HINT(cond, true, BranchHint::kNone)
-#define IF_NOT_LIKELY(cond) IF_WITH_HINT(cond, true, BranchHint::kFalse)
-#define IF_NOT_UNLIKELY(cond) IF_WITH_HINT(cond, true, BranchHint::kTrue)
-#define ELSE_IF_WITH_HINT(cond, hint)                             \
-  for (bool bound = Asm().ControlFlowHelper_ElseIf(               \
-          [&]() { return cond; }, hint);                          \
-       bound; (bound = false), Asm().ControlFlowHelper_GotoEnd())
-#define ELSE_IF(cond) ELSE_IF_WITH_HINT(cond, BranchHint::kNone)
-#define ELSE_IF_LIKELY(cond) ELSE_IF_WITH_HINT(cond, BranchHint::kTrue)
-#define ELSE_IF_UNLIKELY(cond) ELSE_IF_WITH_HINT(cond, BranchHint::kFalse)
+#define ELSE_IF(...)                                               \
+   for (bool bound = Asm().ControlFlowHelper_ElseIf(               \
+                                   [&]() { return __VA_ARGS__; }); \
+        bound; (bound = false), Asm().ControlFlowHelper_GotoEnd())
 #define ELSE                                               \
   for (bool bound = Asm().ControlFlowHelper_Else(); bound; \
        (bound = false), Asm().ControlFlowHelper_GotoEnd())
 #define END_IF Asm().ControlFlowHelper_EndIf();
 
+#ifdef DEBUG
+// In debug builds, `Reduce(operation)` makes sure that `operation##Op` exists by using this name in an expression. This will detect typos in the name which would otherwise stay unnoticed potentially.
+#define REDUCE(operation) \
+  CONCAT(CHECK_Reduce, operation)                                             \
+      = (::v8::internal::compiler::turboshaft::detail::SuppressUnusedWarning( \
+            std::is_same_v<operation##Op, operation##Op>),                    \
+         OpIndex{});                                                          \
+  decltype(CONCAT(CHECK_Reduce, operation)) Reduce##operation
+#define REDUCE_INPUT_GRAPH(operation)                                         \
+  CONCAT(CHECK_ReduceInputGraph, operation)                                   \
+      = (::v8::internal::compiler::turboshaft::detail::SuppressUnusedWarning( \
+            std::is_same_v<operation##Op, operation##Op>),                    \
+            OpIndex{});                                                       \
+  decltype(CONCAT(CHECK_ReduceInputGraph, operation))                         \
+          ReduceInputGraph##operation
+#else
+#define REDUCE(operation) Reduce##operation
+#define REDUCE_INPUT_GRAPH(operation) ReduceInputGraph##operation
+#endif  // DEBUG
+
 #define __ Asm().
diff --git a/deps/v8/src/compiler/turboshaft/deopt-data.h b/deps/v8/src/compiler/turboshaft/deopt-data.h
index 2b8d6666825f44..bef69a7e03967b 100644
--- a/deps/v8/src/compiler/turboshaft/deopt-data.h
+++ b/deps/v8/src/compiler/turboshaft/deopt-data.h
@@ -86,7 +86,12 @@ struct FrameStateData {
     base::Vector<const uint32_t> int_operands;
     base::Vector<const OpIndex> inputs;
 
-    bool has_more() const { return !instructions.empty(); }
+    bool has_more() const {
+      DCHECK_IMPLIES(instructions.empty(), machine_types.empty());
+      DCHECK_IMPLIES(instructions.empty(), int_operands.empty());
+      DCHECK_IMPLIES(instructions.empty(), inputs.empty());
+      return !instructions.empty();
+    }
 
     Instr current_instr() { return instructions[0]; }
 
diff --git a/deps/v8/src/compiler/turboshaft/doubly-threaded-list.h b/deps/v8/src/compiler/turboshaft/doubly-threaded-list.h
new file mode 100644
index 00000000000000..8e4b8afcac198c
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/doubly-threaded-list.h
@@ -0,0 +1,114 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_DOUBLY_THREADED_LIST_H_
+#define V8_COMPILER_TURBOSHAFT_DOUBLY_THREADED_LIST_H_
+
+#include "src/base/logging.h"
+
+// DoublyThreadedList is an intrusive doubly-linked list that threads through
+// its nodes, somewhat like ThreadedList (src/base/threaded-list.h).
+//
+// Of interest is the fact that instead of having regular next/prev pointers,
+// nodes have a regular "next" pointer, but their "prev" pointer contains the
+// address of the "next" of the previous element. This way, removing an element
+// doesn't require special treatment for the head of the list, and does not
+// even require to know the head of the list.
+
+template <typename T>
+struct DoublyThreadedListTraits {
+  static T** prev(T t) { return t->prev(); }
+  static T* next(T t) { return t->next(); }
+  static bool non_empty(T t) { return t != nullptr; }
+};
+
+template <class T, class DTLTraits = DoublyThreadedListTraits<T>>
+class DoublyThreadedList {
+ public:
+  // Defining move constructor so that when resizing container, the prev pointer
+  // of the next(head_) doesn't point to the old head_ but rather to the new
+  // one.
+  DoublyThreadedList(DoublyThreadedList&& other) V8_NOEXCEPT {
+    head_ = other.head_;
+    if (DTLTraits::non_empty(head_)) {
+      *DTLTraits::prev(head_) = &head_;
+    }
+    other.head_ = {};
+  }
+  DoublyThreadedList() = default;
+
+  // Add `x` at the begining of the list. `x` will not be visible to any
+  // existing iterator. Does not invalidate any existing iterator.
+  void Add(T x) {
+    DCHECK(empty(*DTLTraits::next(x)));
+    DCHECK_EQ(*DTLTraits::prev(x), nullptr);
+    *DTLTraits::next(x) = head_;
+    *DTLTraits::prev(x) = &head_;
+    if (DTLTraits::non_empty(head_)) {
+      *DTLTraits::prev(head_) = DTLTraits::next(x);
+    }
+    head_ = x;
+  }
+
+  // Removes `x` from the list. Iterators that are currently on `x` are
+  // invalidated. To remove while iterating, use RemoveAt.
+  static void Remove(T x) {
+    if (*DTLTraits::prev(x) == nullptr) {
+      DCHECK(empty(*DTLTraits::next(x)));
+      // {x} already removed from the list.
+      return;
+    }
+    T** prev = DTLTraits::prev(x);
+    T* next = DTLTraits::next(x);
+    **prev = *next;
+    if (DTLTraits::non_empty(*next)) *DTLTraits::prev(*next) = *prev;
+    *DTLTraits::prev(x) = nullptr;
+    *DTLTraits::next(x) = {};
+  }
+
+  bool empty() const { return !DTLTraits::non_empty(head_); }
+
+  // Since C++17, it is possible to have a sentinel end-iterator that is not an
+  // iterator itself.
+  class end_iterator {};
+
+  class iterator {
+   public:
+    explicit iterator(T head) : curr_(head) {}
+
+    T operator*() { return curr_; }
+
+    iterator& operator++() {
+      DCHECK(DTLTraits::non_empty(curr_));
+      curr_ = *DTLTraits::next(curr_);
+      return *this;
+    }
+
+    bool operator!=(end_iterator) { return DTLTraits::non_empty(curr_); }
+
+   private:
+    friend DoublyThreadedList;
+    T curr_;
+  };
+
+  iterator begin() const { return iterator{head_}; }
+  end_iterator end() const { return end_iterator{}; }
+
+  // Removes the element at `it`, and make `it` point to the next element.
+  // Iterators on the same element as `it` are invalidated. Other iterators are
+  // not affected.
+  iterator RemoveAt(iterator& it) {
+    DCHECK(DTLTraits::non_empty(it.curr_));
+    T curr = *it;
+    T next = *DTLTraits::next(curr);
+    Remove(curr);
+    return iterator{next};
+  }
+
+ private:
+  static bool empty(T x) { return !DTLTraits::non_empty(x); }
+  T head_{};
+};
+
+#endif  // V8_COMPILER_TURBOSHAFT_DOUBLY_THREADED_LIST_H_
diff --git a/deps/v8/src/compiler/turboshaft/explicit-truncation-reducer.h b/deps/v8/src/compiler/turboshaft/explicit-truncation-reducer.h
new file mode 100644
index 00000000000000..89e3628a986443
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/explicit-truncation-reducer.h
@@ -0,0 +1,93 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_EXPLICIT_TRUNCATION_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_EXPLICIT_TRUNCATION_REDUCER_H_
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/reduce-args-helper.h"
+#include "src/compiler/turboshaft/uniform-reducer-adapter.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+// This reducer adds explicit int64 -> int32 truncation operations. This is
+// needed as Turbofan does not have an explicit truncation operation.
+// TODO(12783): Once the Turboshaft graph is not created from Turbofan, this
+// reducer can be removed.
+template <class Next>
+class ExplicitTruncationReducer
+    : public UniformReducerAdapter<ExplicitTruncationReducer, Next> {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  template <Opcode opcode, typename Continuation, typename... Ts>
+  OpIndex ReduceOperation(Ts... args) {
+    // Construct a temporary operation. The operation is needed for generic
+    // access to the inputs and the inputs representation.
+    using Op = typename opcode_to_operation_map<opcode>::Op;
+    size_t size =
+        Operation::StorageSlotCount(opcode, (0 + ... + input_count(args)));
+    storage_.resize_no_init(size);
+    Op* operation = new (storage_.data()) Op(args...);
+
+    base::Vector<const MaybeRegisterRepresentation> reps =
+        operation->inputs_rep(inputs_rep_storage_);
+    base::Vector<OpIndex> inputs = operation->inputs();
+    bool has_truncation = false;
+    for (size_t i = 0; i < reps.size(); ++i) {
+      if (reps[i] == MaybeRegisterRepresentation::Word32()) {
+        base::Vector<const RegisterRepresentation> actual_inputs_rep =
+            Asm().input_graph().Get(inputs[i]).outputs_rep();
+        // We ignore any input operation that produces more than one value.
+        // These cannot be consumed directly and therefore require a projection.
+        // Assumption: A projection never performs an implicit truncation from
+        // word64 to word32.
+        if (actual_inputs_rep.size() == 1 &&
+            actual_inputs_rep[0] == RegisterRepresentation::Word64()) {
+          has_truncation = true;
+          inputs[i] = Next::ReduceChange(inputs[i], ChangeOp::Kind::kTruncate,
+                                         ChangeOp::Assumption::kNoAssumption,
+                                         RegisterRepresentation::Word64(),
+                                         RegisterRepresentation::Word32());
+        }
+      }
+    }
+
+    if (!has_truncation) {
+      // Just call the regular Reduce without any remapped values.
+      return Continuation{this}.Reduce(args...);
+    }
+
+    return CallWithReduceArgs([this](auto... args) {
+      return Continuation{this}.Reduce(args...);
+    })(*operation);
+  }
+
+ private:
+  // Computes the number of inputs of an operation, ignoring non-OpIndex inputs
+  // (which are always inlined in the operation) and `base::Vector<OpIndex>`
+  // inputs.
+  template <typename T>
+  constexpr size_t input_count(T) {
+    return 0;
+  }
+  constexpr size_t input_count() { return 0; }
+  constexpr size_t input_count(OpIndex) { return 1; }
+  constexpr size_t input_count(base::Vector<const OpIndex> inputs) {
+    return inputs.size();
+  }
+
+  ZoneVector<MaybeRegisterRepresentation> inputs_rep_storage_{
+      Asm().phase_zone()};
+  base::SmallVector<OperationStorageSlot, 32> storage_;
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_EXPLICIT_TRUNCATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/fast-api-call-reducer.h b/deps/v8/src/compiler/turboshaft/fast-api-call-reducer.h
new file mode 100644
index 00000000000000..5ab3736e1a640f
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/fast-api-call-reducer.h
@@ -0,0 +1,650 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_FAST_API_CALL_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_FAST_API_CALL_REDUCER_H_
+
+#include "include/v8-fast-api-calls.h"
+#include "src/compiler/fast-api-calls.h"
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/index.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/optimization-phase.h"
+#include "src/compiler/turboshaft/phase.h"
+#include "src/compiler/turboshaft/representations.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+template <typename Next>
+class FastApiCallReducer : public Next {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  OpIndex REDUCE(FastApiCall)(OpIndex data_argument,
+                              base::Vector<const OpIndex> arguments,
+                              const FastApiCallParameters* parameters) {
+    const auto& c_functions = parameters->c_functions;
+    const auto& c_signature = parameters->c_signature();
+    const int c_arg_count = c_signature->ArgumentCount();
+    DCHECK_EQ(c_arg_count, arguments.size());
+    const auto& resolution_result = parameters->resolution_result;
+
+    Label<> handle_error(this);
+
+    OpIndex callee;
+    base::SmallVector<OpIndex, 16> args;
+    for (int i = 0; i < c_arg_count; ++i) {
+      // Check if this is the argument on which we need to perform overload
+      // resolution.
+      if (i == resolution_result.distinguishable_arg_index) {
+        DCHECK_GT(c_functions.size(), 1);
+        // This only happens when the FastApiCall node represents multiple
+        // overloaded functions and {i} is the index of the distinguishable
+        // argument.
+        OpIndex arg_i;
+        std::tie(callee, arg_i) = AdaptOverloadedFastCallArgument(
+            arguments[i], c_functions, resolution_result, handle_error);
+        args.push_back(arg_i);
+      } else {
+        CTypeInfo type = c_signature->ArgumentInfo(i);
+        args.push_back(AdaptFastCallArgument(arguments[i], type, handle_error));
+      }
+    }
+
+    if (c_functions.size() == 1) {
+      DCHECK(!callee.valid());
+      callee = __ ExternalConstant(ExternalReference::Create(
+          c_functions[0].address, ExternalReference::FAST_C_CALL));
+    }
+
+    MachineSignature::Builder builder(
+        __ graph_zone(), 1, c_arg_count + (c_signature->HasOptions() ? 1 : 0));
+    builder.AddReturn(MachineType::TypeForCType(c_signature->ReturnInfo()));
+    for (int i = 0; i < c_arg_count; ++i) {
+      CTypeInfo type = c_signature->ArgumentInfo(i);
+      MachineType machine_type =
+          type.GetSequenceType() == CTypeInfo::SequenceType::kScalar
+              ? MachineType::TypeForCType(type)
+              : MachineType::AnyTagged();
+      builder.AddParam(machine_type);
+    }
+
+    OpIndex stack_slot;
+    if (c_signature->HasOptions()) {
+      const int kAlign = alignof(v8::FastApiCallbackOptions);
+      const int kSize = sizeof(v8::FastApiCallbackOptions);
+      // If this check fails, you've probably added new fields to
+      // v8::FastApiCallbackOptions, which means you'll need to write code
+      // that initializes and reads from them too.
+      static_assert(kSize == sizeof(uintptr_t) * 3);
+      stack_slot = __ StackSlot(kSize, kAlign);
+
+      // fallback = 0
+      __ StoreOffHeap(stack_slot, __ Word32Constant(0),
+                      MemoryRepresentation::Int32(),
+                      offsetof(v8::FastApiCallbackOptions, fallback));
+      // Allocate a new data slot in the stack and initialize it with the
+      // {data_argument}.
+      OpIndex data_stack_slot =
+          __ StackSlot(sizeof(uintptr_t), alignof(uintptr_t));
+      __ StoreOffHeap(data_stack_slot, __ BitcastTaggedToWord(data_argument),
+                      MemoryRepresentation::PointerSized());
+      // data = data_stack_slot
+      __ StoreOffHeap(stack_slot, data_stack_slot,
+                      MemoryRepresentation::PointerSized(),
+                      offsetof(v8::FastApiCallbackOptions, data));
+      // wasm_memory = 0
+      __ StoreOffHeap(stack_slot, __ IntPtrConstant(0),
+                      MemoryRepresentation::PointerSized(),
+                      offsetof(v8::FastApiCallbackOptions, wasm_memory));
+
+      args.push_back(stack_slot);
+      builder.AddParam(MachineType::Pointer());
+    }
+
+    // Build the actual call.
+    const TSCallDescriptor* call_descriptor = TSCallDescriptor::Create(
+        Linkage::GetSimplifiedCDescriptor(__ graph_zone(), builder.Build()),
+        CanThrow::kNo, __ graph_zone());
+    OpIndex c_call_result =
+        WrapFastCall(call_descriptor, callee, base::VectorOf(args));
+    V<Object> fast_call_result = ConvertReturnValue(c_signature, c_call_result);
+
+    Label<Word32, Object> done(this);
+    if (c_signature->HasOptions()) {
+      DCHECK(stack_slot.valid());
+      V<Word32> error = __ LoadOffHeap(
+          stack_slot, offsetof(v8::FastApiCallbackOptions, fallback),
+          MemoryRepresentation::Int32());
+      GOTO_IF(error, handle_error);
+    }
+    GOTO(done, FastApiCallOp::kSuccessValue, fast_call_result);
+
+    if (BIND(handle_error)) {
+      // We pass Smi(0) as the value here, although this should never be visible
+      // when calling code reacts to `kFailureValue` properly.
+      GOTO(done, FastApiCallOp::kFailureValue, __ TagSmi(0));
+    }
+
+    BIND(done, state, value);
+    return __ Tuple(state, value);
+  }
+
+ private:
+  std::pair<OpIndex, OpIndex> AdaptOverloadedFastCallArgument(
+      OpIndex argument, const FastApiCallFunctionVector& c_functions,
+      const fast_api_call::OverloadsResolutionResult& resolution_result,
+      Label<>& handle_error) {
+    Label<WordPtr, WordPtr> done(this);
+
+    for (size_t func_index = 0; func_index < c_functions.size(); ++func_index) {
+      const CFunctionInfo* c_signature = c_functions[func_index].signature;
+      CTypeInfo arg_type = c_signature->ArgumentInfo(
+          resolution_result.distinguishable_arg_index);
+
+      Label<> next(this);
+
+      // Check that the value is a HeapObject.
+      GOTO_IF(__ ObjectIsSmi(argument), handle_error);
+
+      switch (arg_type.GetSequenceType()) {
+        case CTypeInfo::SequenceType::kIsSequence: {
+          CHECK_EQ(arg_type.GetType(), CTypeInfo::Type::kVoid);
+
+          // Check that the value is a JSArray.
+          V<Map> map = __ LoadMapField(argument);
+          V<Word32> instance_type = __ LoadInstanceTypeField(map);
+          GOTO_IF_NOT(__ Word32Equal(instance_type, JS_ARRAY_TYPE), next);
+
+          OpIndex stack_slot =
+              __ StackSlot(sizeof(uintptr_t), alignof(uintptr_t));
+          __ StoreOffHeap(stack_slot, __ BitcastTaggedToWord(argument),
+                          MemoryRepresentation::PointerSized());
+          OpIndex target_address = __ ExternalConstant(
+              ExternalReference::Create(c_functions[func_index].address,
+                                        ExternalReference::FAST_C_CALL));
+          GOTO(done, target_address, stack_slot);
+          break;
+        }
+        case CTypeInfo::SequenceType::kIsTypedArray: {
+          // Check that the value is a TypedArray with a type that matches the
+          // type declared in the c-function.
+          OpIndex stack_slot = AdaptFastCallTypedArrayArgument(
+              argument,
+              fast_api_call::GetTypedArrayElementsKind(
+                  resolution_result.element_type),
+              next);
+          OpIndex target_address = __ ExternalConstant(
+              ExternalReference::Create(c_functions[func_index].address,
+                                        ExternalReference::FAST_C_CALL));
+          GOTO(done, target_address, stack_slot);
+          break;
+        }
+
+        default: {
+          UNREACHABLE();
+        }
+      }
+
+      BIND(next);
+    }
+    GOTO(handle_error);
+
+    BIND(done, callee, arg);
+    return {callee, arg};
+  }
+
+  OpIndex AdaptFastCallArgument(OpIndex argument, CTypeInfo arg_type,
+                                Label<>& handle_error) {
+    switch (arg_type.GetSequenceType()) {
+      case CTypeInfo::SequenceType::kScalar: {
+        auto CheckSuccess = [&](OpIndex result, Label<>& otherwise) {
+          V<Word32> result_state = __ template Projection<Word32>(result, 1);
+          GOTO_IF_NOT(__ Word32Equal(result_state, TryChangeOp::kSuccessValue),
+                      otherwise);
+        };
+        uint8_t flags = static_cast<uint8_t>(arg_type.GetFlags());
+        if (flags & static_cast<uint8_t>(CTypeInfo::Flags::kEnforceRangeBit)) {
+          switch (arg_type.GetType()) {
+            case CTypeInfo::Type::kInt32: {
+              OpIndex result = __ TryTruncateFloat64ToInt32(argument);
+              CheckSuccess(result, handle_error);
+              return __ template Projection<Word32>(result, 0);
+            }
+            case CTypeInfo::Type::kUint32: {
+              OpIndex result = __ TryTruncateFloat64ToUint32(argument);
+              CheckSuccess(result, handle_error);
+              return __ template Projection<Word32>(result, 0);
+            }
+            case CTypeInfo::Type::kInt64: {
+              OpIndex result = __ TryTruncateFloat64ToInt64(argument);
+              CheckSuccess(result, handle_error);
+              return __ template Projection<Word64>(result, 0);
+            }
+            case CTypeInfo::Type::kUint64: {
+              OpIndex result = __ TryTruncateFloat64ToUint64(argument);
+              CheckSuccess(result, handle_error);
+              return __ template Projection<Word64>(result, 0);
+            }
+            default: {
+              GOTO(handle_error);
+              return argument;
+            }
+          }
+        } else if (flags & static_cast<uint8_t>(CTypeInfo::Flags::kClampBit)) {
+          return ClampFastCallArgument(argument, arg_type.GetType());
+        } else {
+          switch (arg_type.GetType()) {
+            case CTypeInfo::Type::kV8Value: {
+              OpIndex stack_slot =
+                  __ StackSlot(sizeof(uintptr_t), alignof(uintptr_t));
+              __ StoreOffHeap(stack_slot, __ BitcastTaggedToWord(argument),
+                              MemoryRepresentation::PointerSized());
+              return stack_slot;
+            }
+            case CTypeInfo::Type::kFloat32: {
+              return __ ChangeFloat64ToFloat32(argument);
+            }
+            case CTypeInfo::Type::kPointer: {
+              // Check that the value is a HeapObject.
+              GOTO_IF(__ ObjectIsSmi(argument), handle_error);
+              Label<WordPtr> done(this);
+
+              // Check if the value is null.
+              GOTO_IF(UNLIKELY(__ TaggedEqual(
+                          argument, __ HeapConstant(factory_->null_value()))),
+                      done, 0);
+
+              // Check that the value is a JSExternalObject.
+              GOTO_IF_NOT(
+                  __ TaggedEqual(__ LoadMapField(argument),
+                                 __ HeapConstant(factory_->external_map())),
+                  handle_error);
+
+              GOTO(done, __ template LoadField<WordPtr>(
+                             V<HeapObject>::Cast(argument),
+                             AccessBuilder::ForJSExternalObjectValue()));
+
+              BIND(done, result);
+              return result;
+            }
+            case CTypeInfo::Type::kSeqOneByteString: {
+              // Check that the value is a HeapObject.
+              GOTO_IF(__ ObjectIsSmi(argument), handle_error);
+
+              V<Map> map = __ LoadMapField(argument);
+              V<Word32> instance_type = __ LoadInstanceTypeField(map);
+
+              V<Word32> encoding = __ Word32BitwiseAnd(
+                  instance_type, kStringRepresentationAndEncodingMask);
+              GOTO_IF_NOT(__ Word32Equal(encoding, kSeqOneByteStringTag),
+                          handle_error);
+
+              V<WordPtr> length_in_bytes = __ template LoadField<WordPtr>(
+                  V<HeapObject>::Cast(argument),
+                  AccessBuilder::ForStringLength());
+              OpIndex data_ptr = __ WordPtrAdd(
+                  __ BitcastTaggedToWord(argument),
+                  (SeqOneByteString::kHeaderSize - kHeapObjectTag));
+
+              constexpr int kAlign = alignof(FastOneByteString);
+              constexpr int kSize = sizeof(FastOneByteString);
+              static_assert(kSize == sizeof(uintptr_t) + sizeof(size_t),
+                            "The size of "
+                            "FastOneByteString isn't equal to the sum of its "
+                            "expected members.");
+              OpIndex stack_slot = __ StackSlot(kSize, kAlign);
+              __ StoreOffHeap(stack_slot, data_ptr,
+                              MemoryRepresentation::PointerSized());
+              __ StoreOffHeap(stack_slot, length_in_bytes,
+                              MemoryRepresentation::Uint32(), sizeof(size_t));
+              static_assert(sizeof(uintptr_t) == sizeof(size_t),
+                            "The string length can't "
+                            "fit the PointerRepresentation used to store it.");
+              return stack_slot;
+            }
+            default: {
+              return argument;
+            }
+          }
+        }
+      }
+      case CTypeInfo::SequenceType::kIsSequence: {
+        CHECK_EQ(arg_type.GetType(), CTypeInfo::Type::kVoid);
+
+        // Check that the value is a HeapObject.
+        GOTO_IF(__ ObjectIsSmi(argument), handle_error);
+
+        // Check that the value is a JSArray.
+        V<Map> map = __ LoadMapField(argument);
+        V<Word32> instance_type = __ LoadInstanceTypeField(map);
+        GOTO_IF_NOT(__ Word32Equal(instance_type, JS_ARRAY_TYPE), handle_error);
+
+        OpIndex stack_slot =
+            __ StackSlot(sizeof(uintptr_t), alignof(uintptr_t));
+        __ StoreOffHeap(stack_slot, __ BitcastTaggedToWord(argument),
+                        MemoryRepresentation::PointerSized());
+
+        return stack_slot;
+      }
+      case CTypeInfo::SequenceType::kIsTypedArray: {
+        // Check that the value is a HeapObject.
+        GOTO_IF(__ ObjectIsSmi(argument), handle_error);
+
+        return AdaptFastCallTypedArrayArgument(
+            argument,
+            fast_api_call::GetTypedArrayElementsKind(arg_type.GetType()),
+            handle_error);
+      }
+      default: {
+        UNREACHABLE();
+      }
+    }
+  }
+
+  OpIndex ClampFastCallArgument(V<Float64> argument,
+                                CTypeInfo::Type scalar_type) {
+    double min, max;
+    switch (scalar_type) {
+      case CTypeInfo::Type::kInt32:
+        min = std::numeric_limits<int32_t>::min();
+        max = std::numeric_limits<int32_t>::max();
+        break;
+      case CTypeInfo::Type::kUint32:
+        min = 0;
+        max = std::numeric_limits<uint32_t>::max();
+        break;
+      case CTypeInfo::Type::kInt64:
+        min = kMinSafeInteger;
+        max = kMaxSafeInteger;
+        break;
+      case CTypeInfo::Type::kUint64:
+        min = 0;
+        max = kMaxSafeInteger;
+        break;
+      default:
+        UNREACHABLE();
+    }
+
+    V<Float64> clamped =
+        __ Conditional(__ Float64LessThan(min, argument),
+                       __ Conditional(__ Float64LessThan(argument, max),
+                                      argument, __ Float64Constant(max)),
+                       __ Float64Constant(min));
+
+    Label<Float64> done(this);
+    V<Float64> rounded = __ Float64RoundTiesEven(clamped);
+    GOTO_IF(__ Float64IsNaN(rounded), done, 0.0);
+    GOTO(done, rounded);
+
+    BIND(done, rounded_result);
+    switch (scalar_type) {
+      case CTypeInfo::Type::kInt32:
+        return __ ReversibleFloat64ToInt32(rounded_result);
+      case CTypeInfo::Type::kUint32:
+        return __ ReversibleFloat64ToUint32(rounded_result);
+      case CTypeInfo::Type::kInt64:
+        return __ ReversibleFloat64ToInt64(rounded_result);
+      case CTypeInfo::Type::kUint64:
+        return __ ReversibleFloat64ToUint64(rounded_result);
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  OpIndex AdaptFastCallTypedArrayArgument(V<HeapObject> argument,
+                                          ElementsKind expected_elements_kind,
+                                          Label<>& bailout) {
+    V<Map> map = __ LoadMapField(argument);
+    V<Word32> instance_type = __ LoadInstanceTypeField(map);
+    GOTO_IF_NOT(LIKELY(__ Word32Equal(instance_type, JS_TYPED_ARRAY_TYPE)),
+                bailout);
+
+    V<Word32> bitfield2 =
+        __ template LoadField<Word32>(map, AccessBuilder::ForMapBitField2());
+    V<Word32> kind = __ Word32ShiftRightLogical(
+        __ Word32BitwiseAnd(bitfield2, Map::Bits2::ElementsKindBits::kMask),
+        Map::Bits2::ElementsKindBits::kShift);
+    GOTO_IF_NOT(LIKELY(__ Word32Equal(kind, expected_elements_kind)), bailout);
+
+    V<HeapObject> buffer = __ template LoadField<HeapObject>(
+        argument, AccessBuilder::ForJSArrayBufferViewBuffer());
+    V<Word32> buffer_bitfield = __ template LoadField<Word32>(
+        buffer, AccessBuilder::ForJSArrayBufferBitField());
+
+    // Go to the slow path if the {buffer} was detached.
+    GOTO_IF(UNLIKELY(__ Word32BitwiseAnd(buffer_bitfield,
+                                         JSArrayBuffer::WasDetachedBit::kMask)),
+            bailout);
+
+    // Go to the slow path if the {buffer} is shared.
+    GOTO_IF(UNLIKELY(__ Word32BitwiseAnd(buffer_bitfield,
+                                         JSArrayBuffer::IsSharedBit::kMask)),
+            bailout);
+
+    // Unpack the store and length, and store them to a struct
+    // FastApiTypedArray.
+    OpIndex external_pointer =
+        __ LoadField(argument, AccessBuilder::ForJSTypedArrayExternalPointer());
+
+    // Load the base pointer for the buffer. This will always be Smi
+    // zero unless we allow on-heap TypedArrays, which is only the case
+    // for Chrome. Node and Electron both set this limit to 0. Setting
+    // the base to Smi zero here allows the BuildTypedArrayDataPointer
+    // to optimize away the tricky part of the access later.
+    V<WordPtr> data_ptr;
+    if constexpr (JSTypedArray::kMaxSizeInHeap == 0) {
+      data_ptr = external_pointer;
+    } else {
+      V<Object> base_pointer = __ template LoadField<Object>(
+          argument, AccessBuilder::ForJSTypedArrayBasePointer());
+      V<WordPtr> base = __ BitcastTaggedToWord(base_pointer);
+      if (COMPRESS_POINTERS_BOOL) {
+        // Zero-extend Tagged_t to UintPtr according to current compression
+        // scheme so that the addition with |external_pointer| (which already
+        // contains compensated offset value) will decompress the tagged value.
+        // See JSTypedArray::ExternalPointerCompensationForOnHeapArray() for
+        // details.
+        base = __ ChangeUint32ToUintPtr(__ TruncateWordPtrToWord32(base));
+      }
+      data_ptr = __ WordPtrAdd(base, external_pointer);
+    }
+
+    V<WordPtr> length_in_bytes = __ template LoadField<WordPtr>(
+        argument, AccessBuilder::ForJSTypedArrayLength());
+
+    // We hard-code int32_t here, because all specializations of
+    // FastApiTypedArray have the same size.
+    constexpr int kAlign = alignof(FastApiTypedArray<int32_t>);
+    constexpr int kSize = sizeof(FastApiTypedArray<int32_t>);
+    static_assert(kAlign == alignof(FastApiTypedArray<double>),
+                  "Alignment mismatch between different specializations of "
+                  "FastApiTypedArray");
+    static_assert(kSize == sizeof(FastApiTypedArray<double>),
+                  "Size mismatch between different specializations of "
+                  "FastApiTypedArray");
+    static_assert(
+        kSize == sizeof(uintptr_t) + sizeof(size_t),
+        "The size of "
+        "FastApiTypedArray isn't equal to the sum of its expected members.");
+    OpIndex stack_slot = __ StackSlot(kSize, kAlign);
+    __ StoreOffHeap(stack_slot, length_in_bytes,
+                    MemoryRepresentation::PointerSized());
+    __ StoreOffHeap(stack_slot, data_ptr, MemoryRepresentation::PointerSized(),
+                    sizeof(size_t));
+    static_assert(sizeof(uintptr_t) == sizeof(size_t),
+                  "The buffer length can't "
+                  "fit the PointerRepresentation used to store it.");
+    return stack_slot;
+  }
+
+  V<Object> ConvertReturnValue(const CFunctionInfo* c_signature,
+                               OpIndex result) {
+    switch (c_signature->ReturnInfo().GetType()) {
+      case CTypeInfo::Type::kVoid:
+        return __ HeapConstant(factory_->undefined_value());
+      case CTypeInfo::Type::kBool:
+        static_assert(sizeof(bool) == 1, "unsupported bool size");
+        return __ ConvertWord32ToBoolean(
+            __ Word32BitwiseAnd(result, __ Word32Constant(0xFF)));
+      case CTypeInfo::Type::kInt32:
+        return __ ConvertInt32ToNumber(result);
+      case CTypeInfo::Type::kUint32:
+        return __ ConvertUint32ToNumber(result);
+      case CTypeInfo::Type::kInt64: {
+        CFunctionInfo::Int64Representation repr =
+            c_signature->GetInt64Representation();
+        if (repr == CFunctionInfo::Int64Representation::kBigInt) {
+          return __ ConvertUntaggedToJSPrimitive(
+              result, ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kBigInt,
+              RegisterRepresentation::Word64(),
+              ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned,
+              CheckForMinusZeroMode::kDontCheckForMinusZero);
+        } else if (repr == CFunctionInfo::Int64Representation::kNumber) {
+          return __ ConvertUntaggedToJSPrimitive(
+              result, ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kNumber,
+              RegisterRepresentation::Word64(),
+              ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned,
+              CheckForMinusZeroMode::kDontCheckForMinusZero);
+        } else {
+          UNREACHABLE();
+        }
+      }
+      case CTypeInfo::Type::kUint64: {
+        CFunctionInfo::Int64Representation repr =
+            c_signature->GetInt64Representation();
+        if (repr == CFunctionInfo::Int64Representation::kBigInt) {
+          return __ ConvertUntaggedToJSPrimitive(
+              result, ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kBigInt,
+              RegisterRepresentation::Word64(),
+              ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kUnsigned,
+              CheckForMinusZeroMode::kDontCheckForMinusZero);
+        } else if (repr == CFunctionInfo::Int64Representation::kNumber) {
+          return __ ConvertUntaggedToJSPrimitive(
+              result, ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kNumber,
+              RegisterRepresentation::Word64(),
+              ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kUnsigned,
+              CheckForMinusZeroMode::kDontCheckForMinusZero);
+        } else {
+          UNREACHABLE();
+        }
+      }
+      case CTypeInfo::Type::kFloat32:
+        return __ ConvertFloat64ToNumber(
+            __ ChangeFloat32ToFloat64(result),
+            CheckForMinusZeroMode::kCheckForMinusZero);
+      case CTypeInfo::Type::kFloat64:
+        return __ ConvertFloat64ToNumber(
+            result, CheckForMinusZeroMode::kCheckForMinusZero);
+      case CTypeInfo::Type::kPointer:
+        return BuildAllocateJSExternalObject(result);
+      case CTypeInfo::Type::kSeqOneByteString:
+      case CTypeInfo::Type::kV8Value:
+      case CTypeInfo::Type::kApiObject:
+      case CTypeInfo::Type::kUint8:
+        UNREACHABLE();
+      case CTypeInfo::Type::kAny:
+        return __ ConvertFloat64ToNumber(
+            __ ChangeInt64ToFloat64(result),
+            CheckForMinusZeroMode::kCheckForMinusZero);
+    }
+  }
+
+  V<HeapObject> BuildAllocateJSExternalObject(V<WordPtr> pointer) {
+    Label<HeapObject> done(this);
+
+    // Check if the pointer is a null pointer.
+    GOTO_IF(__ WordPtrEqual(pointer, 0), done,
+            __ HeapConstant(factory_->null_value()));
+
+    Uninitialized<HeapObject> external =
+        __ Allocate(JSExternalObject::kHeaderSize, AllocationType::kYoung);
+    __ InitializeField(external, AccessBuilder::ForMap(),
+                       __ HeapConstant(factory_->external_map()));
+    V<FixedArray> empty_fixed_array =
+        __ HeapConstant(factory_->empty_fixed_array());
+    __ InitializeField(external, AccessBuilder::ForJSObjectPropertiesOrHash(),
+                       empty_fixed_array);
+    __ InitializeField(external, AccessBuilder::ForJSObjectElements(),
+                       empty_fixed_array);
+
+#ifdef V8_ENABLE_SANDBOX
+    OpIndex isolate_ptr =
+        __ ExternalConstant(ExternalReference::isolate_address(isolate_));
+    MachineSignature::Builder builder(__ graph_zone(), 1, 2);
+    builder.AddReturn(MachineType::Uint32());
+    builder.AddParam(MachineType::Pointer());
+    builder.AddParam(MachineType::Pointer());
+    OpIndex allocate_and_initialize_external_pointer_table_entry =
+        __ ExternalConstant(
+            ExternalReference::
+                allocate_and_initialize_external_pointer_table_entry());
+    auto call_descriptor =
+        Linkage::GetSimplifiedCDescriptor(__ graph_zone(), builder.Build());
+    OpIndex handle =
+        __ Call(allocate_and_initialize_external_pointer_table_entry,
+                {isolate_ptr, pointer},
+                TSCallDescriptor::Create(call_descriptor, CanThrow::kNo,
+                                         __ graph_zone()));
+    __ InitializeField(
+        external, AccessBuilder::ForJSExternalObjectPointerHandle(), handle);
+#else
+    __ InitializeField(external, AccessBuilder::ForJSExternalObjectValue(),
+                       pointer);
+#endif  // V8_ENABLE_SANDBOX
+    GOTO(done, __ FinishInitialization(std::move(external)));
+
+    BIND(done, result);
+    return result;
+  }
+
+  OpIndex WrapFastCall(const TSCallDescriptor* descriptor, OpIndex callee,
+                       base::Vector<const OpIndex> arguments) {
+    // CPU profiler support.
+    OpIndex target_address = __ ExternalConstant(
+        ExternalReference::fast_api_call_target_address(isolate_));
+    __ StoreOffHeap(target_address, __ BitcastTaggedToWord(callee),
+                    MemoryRepresentation::PointerSized());
+
+    // Disable JS execution.
+    OpIndex js_execution_assert = __ ExternalConstant(
+        ExternalReference::javascript_execution_assert(isolate_));
+    static_assert(sizeof(bool) == 1, "Wrong assumption about boolean size.");
+    if (v8_flags.debug_code) {
+      V<Word32> old_value =
+          __ LoadOffHeap(js_execution_assert, MemoryRepresentation::Int8());
+      IF_NOT(LIKELY(__ Word32Equal(old_value, 1))) {
+        // We expect that JS execution is enabled, otherwise assert.
+        __ Unreachable();
+      }
+      END_IF
+    }
+    __ StoreOffHeap(js_execution_assert, __ Word32Constant(0),
+                    MemoryRepresentation::Int8());
+
+    // Create the fast call.
+    OpIndex result = __ Call(callee, OpIndex::Invalid(), arguments, descriptor);
+
+    // Reenable JS exeuction.
+    __ StoreOffHeap(js_execution_assert, __ Word32Constant(1),
+                    MemoryRepresentation::Int8());
+
+    // Reset the CPU profiler target address.
+    __ StoreOffHeap(target_address, __ IntPtrConstant(0),
+                    MemoryRepresentation::PointerSized());
+
+    return result;
+  }
+
+  Isolate* isolate_ = PipelineData::Get().isolate();
+  Factory* factory_ = isolate_->factory();
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_FAST_API_CALL_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/fast-hash.h b/deps/v8/src/compiler/turboshaft/fast-hash.h
index 9b50e5e8e3e0ce..4414dd87214a38 100644
--- a/deps/v8/src/compiler/turboshaft/fast-hash.h
+++ b/deps/v8/src/compiler/turboshaft/fast-hash.h
@@ -35,6 +35,13 @@ struct fast_hash {
   }
 };
 
+template <typename T1, typename T2>
+struct fast_hash<std::pair<T1, T2>> {
+  size_t operator()(const std::pair<T1, T2>& v) const {
+    return fast_hash_combine(v.first, v.second);
+  }
+};
+
 template <class... Ts>
 struct fast_hash<std::tuple<Ts...>> {
   size_t operator()(const std::tuple<Ts...>& v) const {
diff --git a/deps/v8/src/compiler/turboshaft/graph-builder.cc b/deps/v8/src/compiler/turboshaft/graph-builder.cc
index b33997e3b4e4b0..3297c024c82bc1 100644
--- a/deps/v8/src/compiler/turboshaft/graph-builder.cc
+++ b/deps/v8/src/compiler/turboshaft/graph-builder.cc
@@ -18,6 +18,7 @@
 #include "src/codegen/machine-type.h"
 #include "src/compiler/common-operator.h"
 #include "src/compiler/compiler-source-position-table.h"
+#include "src/compiler/fast-api-calls.h"
 #include "src/compiler/js-heap-broker.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node-aux-data.h"
@@ -31,9 +32,13 @@
 #include "src/compiler/state-values-utils.h"
 #include "src/compiler/turboshaft/assembler.h"
 #include "src/compiler/turboshaft/deopt-data.h"
+#include "src/compiler/turboshaft/explicit-truncation-reducer.h"
 #include "src/compiler/turboshaft/graph.h"
 #include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/phase.h"
 #include "src/compiler/turboshaft/representations.h"
+#include "src/heap/factory-inl.h"
+#include "src/objects/map.h"
 #include "src/zone/zone-containers.h"
 
 namespace v8::internal::compiler::turboshaft {
@@ -43,24 +48,30 @@ namespace v8::internal::compiler::turboshaft {
 namespace {
 
 struct GraphBuilder {
-  Isolate* isolate;
-  JSHeapBroker* broker;
-  Zone* graph_zone;
   Zone* phase_zone;
   Schedule& schedule;
-  Assembler<reducer_list<>> assembler;
   Linkage* linkage;
-  SourcePositionTable* source_positions;
-  NodeOriginTable* origins;
+
+  Isolate* isolate = PipelineData::Get().isolate();
+  JSHeapBroker* broker = PipelineData::Get().broker();
+  Zone* graph_zone = PipelineData::Get().graph_zone();
+  using AssemblerT = Assembler<reducer_list<ExplicitTruncationReducer>>;
+  AssemblerT assembler{PipelineData::Get().graph(), PipelineData::Get().graph(),
+                       phase_zone, nullptr};
+  SourcePositionTable* source_positions =
+      PipelineData::Get().source_positions();
+  NodeOriginTable* origins = PipelineData::Get().node_origins();
 
   struct BlockData {
     Block* block;
+    OpIndex final_frame_state;
   };
   NodeAuxData<OpIndex> op_mapping{phase_zone};
   ZoneVector<BlockData> block_mapping{schedule.RpoBlockCount(), phase_zone};
+  bool inside_region = false;
 
   base::Optional<BailoutReason> Run();
-  Assembler<reducer_list<>>& Asm() { return assembler; }
+  AssemblerT& Asm() { return assembler; }
 
  private:
   OpIndex Map(Node* old_node) {
@@ -74,15 +85,18 @@ struct GraphBuilder {
     return result;
   }
 
-  void FixLoopPhis(Block* loop, Block* backedge) {
-    DCHECK(loop->IsLoop());
-    for (Operation& op : __ output_graph().operations(*loop)) {
-      if (!op.Is<PendingLoopPhiOp>()) continue;
-      auto& pending_phi = op.Cast<PendingLoopPhiOp>();
+  void FixLoopPhis(BasicBlock* loop) {
+    DCHECK(loop->IsLoopHeader());
+    for (Node* node : *loop->nodes()) {
+      if (node->opcode() != IrOpcode::kPhi) {
+        continue;
+      }
+      OpIndex phi_index = Map(node);
+      PendingLoopPhiOp& pending_phi =
+          __ output_graph().Get(phi_index).Cast<PendingLoopPhiOp>();
       __ output_graph().Replace<PhiOp>(
-          __ output_graph().Index(pending_phi),
-          base::VectorOf(
-              {pending_phi.first(), Map(pending_phi.data.old_backedge_node)}),
+          phi_index,
+          base::VectorOf({pending_phi.first(), Map(node->InputAt(1))}),
           pending_phi.rep);
     }
   }
@@ -129,12 +143,12 @@ struct GraphBuilder {
     if (frame_state.outer_frame_state()->opcode() != IrOpcode::kStart) {
       builder->AddParentFrameState(Map(frame_state.outer_frame_state()));
     }
+    ProcessDeoptInput(builder, frame_state.function(),
+                      MachineType::AnyTagged());
     ProcessStateValues(builder, frame_state.parameters());
+    ProcessDeoptInput(builder, frame_state.context(), MachineType::AnyTagged());
     ProcessStateValues(builder, frame_state.locals());
     ProcessStateValues(builder, frame_state.stack());
-    ProcessDeoptInput(builder, frame_state.context(), MachineType::AnyTagged());
-    ProcessDeoptInput(builder, frame_state.function(),
-                      MachineType::AnyTagged());
   }
 
   Block::Kind BlockKind(BasicBlock* block) {
@@ -205,6 +219,17 @@ base::Optional<BailoutReason> GraphBuilder::Run() {
               });
 
     OpIndex dominating_frame_state = OpIndex::Invalid();
+    if (predecessors.size() > 0) {
+      dominating_frame_state =
+          block_mapping[predecessors[0]->rpo_number()].final_frame_state;
+      for (size_t i = 1; i < predecessors.size(); ++i) {
+        if (block_mapping[predecessors[i]->rpo_number()].final_frame_state !=
+            dominating_frame_state) {
+          dominating_frame_state = OpIndex::Invalid();
+          break;
+        }
+      }
+    }
     base::Optional<BailoutReason> bailout = base::nullopt;
     for (Node* node : *block->nodes()) {
       if (V8_UNLIKELY(node->InputCount() >=
@@ -215,8 +240,13 @@ base::Optional<BailoutReason> GraphBuilder::Run() {
       OpIndex i = Process(node, block, predecessor_permutation,
                           dominating_frame_state, &bailout);
       if (V8_UNLIKELY(bailout)) return bailout;
+      if (!__ current_block()) break;
       op_mapping.Set(node, i);
     }
+    // We have terminated this block with `Unreachable`, so we stop generation
+    // here and continue with the next block.
+    if (!__ current_block()) continue;
+
     if (Node* node = block->control_input()) {
       if (V8_UNLIKELY(node->InputCount() >=
                       int{std::numeric_limits<
@@ -235,7 +265,7 @@ base::Optional<BailoutReason> GraphBuilder::Run() {
         __ Goto(destination);
         if (destination->IsBound()) {
           DCHECK(destination->IsLoop());
-          FixLoopPhis(destination, target_block);
+          FixLoopPhis(block->SuccessorAt(0));
         }
         break;
       }
@@ -251,6 +281,9 @@ base::Optional<BailoutReason> GraphBuilder::Run() {
         UNREACHABLE();
     }
     DCHECK_NULL(__ current_block());
+
+    block_mapping[block->rpo_number()].final_frame_state =
+        dominating_frame_state;
   }
 
   if (source_positions->IsEnabled()) {
@@ -328,36 +361,10 @@ OpIndex GraphBuilder::Process(
     }
 
     case IrOpcode::kIfException: {
-      return __ LoadException();
+      return __ CatchBlockBegin();
     }
 
     case IrOpcode::kIfSuccess: {
-      // We emit all of the value projections of the call now, emit a Tuple with
-      // all of those projections, and remap the old call to this new Tuple
-      // instead of the CallAndCatchExceptionOp.
-      Node* call = node->InputAt(0);
-      DCHECK_EQ(call->opcode(), IrOpcode::kCall);
-      OpIndex call_idx = Map(call);
-      CallAndCatchExceptionOp& op =
-          __ output_graph().Get(call_idx).Cast<CallAndCatchExceptionOp>();
-
-      size_t return_count = op.outputs_rep().size();
-      DCHECK_EQ(return_count, op.descriptor->descriptor->ReturnCount());
-      if (return_count <= 1) {
-        // Calls with one output (or zero) do not require Projections.
-        return OpIndex::Invalid();
-      }
-      base::Vector<OpIndex> projections =
-          graph_zone->NewVector<OpIndex>(return_count);
-      for (size_t i = 0; i < return_count; i++) {
-        projections[i] = __ Projection(call_idx, i, op.outputs_rep()[i]);
-      }
-      OpIndex tuple_idx = __ Tuple(projections);
-
-      // Re-mapping {call} to {tuple_idx} so that subsequent projections are not
-      // emitted.
-      op_mapping.Set(call, tuple_idx);
-
       return OpIndex::Invalid();
     }
 
@@ -381,10 +388,17 @@ OpIndex GraphBuilder::Process(
               PhiRepresentationOf(op));
       if (__ current_block()->IsLoop()) {
         DCHECK_EQ(input_count, 2);
-        return __ PendingLoopPhi(Map(node->InputAt(0)), rep, node->InputAt(1));
+        return __ PendingLoopPhi(Map(node->InputAt(0)), rep);
       } else {
         base::SmallVector<OpIndex, 16> inputs;
         for (int i = 0; i < input_count; ++i) {
+          // If this predecessor end with an unreachable (and doesn't jump to
+          // this merge block), we skip its Phi input.
+          Block* pred = Map(block->PredecessorAt(predecessor_permutation[i]));
+          if (!pred->IsBound() ||
+              pred->LastOperation(__ output_graph()).Is<UnreachableOp>()) {
+            continue;
+          }
           inputs.push_back(Map(node->InputAt(predecessor_permutation[i])));
         }
         return __ Phi(base::VectorOf(inputs), rep);
@@ -622,8 +636,7 @@ OpIndex GraphBuilder::Process(
 #undef UNARY_CASE
 #undef TUPLE_UNARY_CASE
     case IrOpcode::kTruncateInt64ToInt32:
-      // 64- to 32-bit truncation is implicit in Turboshaft.
-      return Map(node->InputAt(0));
+      return __ TruncateWord64ToWord32(Map(node->InputAt(0)));
     case IrOpcode::kTruncateFloat32ToInt32:
       switch (OpParameter<TruncateKind>(node->op())) {
         case TruncateKind::kArchitectureDefault:
@@ -648,15 +661,30 @@ OpIndex GraphBuilder::Process(
         case TruncateKind::kSetOverflowToMin:
           return __ TruncateFloat64ToInt64OverflowToMin(Map(node->InputAt(0)));
       }
-    case IrOpcode::kFloat64InsertLowWord32:
-      return __ Float64InsertWord32(Map(node->InputAt(0)),
-                                    Map(node->InputAt(1)),
-                                    Float64InsertWord32Op::Kind::kLowHalf);
-    case IrOpcode::kFloat64InsertHighWord32:
-      return __ Float64InsertWord32(Map(node->InputAt(0)),
-                                    Map(node->InputAt(1)),
-                                    Float64InsertWord32Op::Kind::kHighHalf);
-
+    case IrOpcode::kFloat64InsertLowWord32: {
+      OpIndex high;
+      OpIndex low = Map(node->InputAt(1));
+      if (node->InputAt(0)->opcode() == IrOpcode::kFloat64InsertHighWord32) {
+        // We can turn this into a single operation.
+        high = Map(node->InputAt(0)->InputAt(1));
+      } else {
+        // We need to extract the high word to combine it.
+        high = __ Float64ExtractHighWord32(Map(node->InputAt(0)));
+      }
+      return __ BitcastWord32PairToFloat64(high, low);
+    }
+    case IrOpcode::kFloat64InsertHighWord32: {
+      OpIndex high = Map(node->InputAt(1));
+      OpIndex low;
+      if (node->InputAt(0)->opcode() == IrOpcode::kFloat64InsertLowWord32) {
+        // We can turn this into a single operation.
+        low = Map(node->InputAt(0)->InputAt(1));
+      } else {
+        // We need to extract the low word to combine it.
+        low = __ Float64ExtractLowWord32(Map(node->InputAt(0)));
+      }
+      return __ BitcastWord32PairToFloat64(high, low);
+    }
     case IrOpcode::kBitcastTaggedToWord:
       return __ TaggedBitcast(Map(node->InputAt(0)),
                               RegisterRepresentation::Tagged(),
@@ -665,9 +693,43 @@ OpIndex GraphBuilder::Process(
       return __ TaggedBitcast(Map(node->InputAt(0)),
                               RegisterRepresentation::PointerSized(),
                               RegisterRepresentation::Tagged());
+    case IrOpcode::kNumberIsFinite:
+      return __ FloatIs(Map(node->InputAt(0)), NumericKind::kFinite,
+                        FloatRepresentation::Float64());
+    case IrOpcode::kNumberIsInteger:
+      return __ FloatIs(Map(node->InputAt(0)), NumericKind::kInteger,
+                        FloatRepresentation::Float64());
+    case IrOpcode::kNumberIsSafeInteger:
+      return __ FloatIs(Map(node->InputAt(0)), NumericKind::kSafeInteger,
+                        FloatRepresentation::Float64());
+    case IrOpcode::kNumberIsFloat64Hole:
+      return __ FloatIs(Map(node->InputAt(0)), NumericKind::kFloat64Hole,
+                        FloatRepresentation::Float64());
+    case IrOpcode::kNumberIsMinusZero:
+      return __ FloatIs(Map(node->InputAt(0)), NumericKind::kMinusZero,
+                        FloatRepresentation::Float64());
     case IrOpcode::kNumberIsNaN:
-      return __ FloatIs(Map(node->InputAt(0)), FloatIsOp::Kind::kNaN,
+      return __ FloatIs(Map(node->InputAt(0)), NumericKind::kNaN,
                         FloatRepresentation::Float64());
+    case IrOpcode::kObjectIsMinusZero:
+      return __ ObjectIsNumericValue(Map(node->InputAt(0)),
+                                     NumericKind::kMinusZero,
+                                     FloatRepresentation::Float64());
+    case IrOpcode::kObjectIsNaN:
+      return __ ObjectIsNumericValue(Map(node->InputAt(0)), NumericKind::kNaN,
+                                     FloatRepresentation::Float64());
+    case IrOpcode::kObjectIsFiniteNumber:
+      return __ ObjectIsNumericValue(Map(node->InputAt(0)),
+                                     NumericKind::kFinite,
+                                     FloatRepresentation::Float64());
+    case IrOpcode::kObjectIsInteger:
+      return __ ObjectIsNumericValue(Map(node->InputAt(0)),
+                                     NumericKind::kInteger,
+                                     FloatRepresentation::Float64());
+    case IrOpcode::kObjectIsSafeInteger:
+      return __ ObjectIsNumericValue(Map(node->InputAt(0)),
+                                     NumericKind::kSafeInteger,
+                                     FloatRepresentation::Float64());
 
 #define OBJECT_IS_CASE(kind)                                             \
   case IrOpcode::kObjectIs##kind: {                                      \
@@ -717,65 +779,137 @@ OpIndex GraphBuilder::Process(
                            NotABigInt64, CheckParametersOf(op).feedback())
 #undef CHECK_OBJECT_IS_CASE
 
-#define CONVERT_TO_OBJECT_CASE(name, kind, input_type, input_interpretation) \
-  case IrOpcode::k##name:                                                    \
-    return __ ConvertToObject(                                               \
-        Map(node->InputAt(0)), ConvertToObjectOp::Kind::k##kind,             \
-        V<input_type>::rep,                                                  \
-        ConvertToObjectOp::InputInterpretation::k##input_interpretation,     \
+    case IrOpcode::kPlainPrimitiveToNumber:
+      return __ ConvertPlainPrimitiveToNumber(Map(node->InputAt(0)));
+    case IrOpcode::kPlainPrimitiveToWord32:
+      return __ ConvertJSPrimitiveToUntagged(
+          Map(node->InputAt(0)),
+          ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kInt32,
+          ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kPlainPrimitive);
+    case IrOpcode::kPlainPrimitiveToFloat64:
+      return __ ConvertJSPrimitiveToUntagged(
+          Map(node->InputAt(0)),
+          ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kFloat64,
+          ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kPlainPrimitive);
+
+    case IrOpcode::kConvertTaggedHoleToUndefined: {
+      V<Object> input = Map(node->InputAt(0));
+      V<Word32> is_the_hole = __ TaggedEqual(
+          input, __ HeapConstant(isolate->factory()->the_hole_value()));
+      return __ Conditional(
+          is_the_hole, __ HeapConstant(isolate->factory()->undefined_value()),
+          input, BranchHint::kFalse);
+    }
+
+    case IrOpcode::kConvertReceiver:
+      return __ ConvertJSPrimitiveToObject(Map(node->InputAt(0)),
+                                           Map(node->InputAt(1)),
+                                           ConvertReceiverModeOf(node->op()));
+
+    case IrOpcode::kToBoolean:
+      return __ ConvertToBoolean(Map(node->InputAt(0)));
+    case IrOpcode::kNumberToString:
+      return __ ConvertNumberToString(Map(node->InputAt(0)));
+    case IrOpcode::kStringToNumber:
+      return __ ConvertStringToNumber(Map(node->InputAt(0)));
+    case IrOpcode::kChangeTaggedToTaggedSigned:
+      return __ Convert(Map(node->InputAt(0)),
+                        ConvertOp::Kind::kNumberOrOddball,
+                        ConvertOp::Kind::kSmi);
+
+    case IrOpcode::kCheckedTaggedToTaggedSigned: {
+      DCHECK(dominating_frame_state.valid());
+      V<Object> input = Map(node->InputAt(0));
+      __ DeoptimizeIfNot(__ ObjectIsSmi(input), dominating_frame_state,
+                         DeoptimizeReason::kNotASmi,
+                         CheckParametersOf(node->op()).feedback());
+      return input;
+    }
+
+    case IrOpcode::kCheckedTaggedToTaggedPointer: {
+      DCHECK(dominating_frame_state.valid());
+      V<Object> input = Map(node->InputAt(0));
+      __ DeoptimizeIf(__ ObjectIsSmi(input), dominating_frame_state,
+                      DeoptimizeReason::kSmi,
+                      CheckParametersOf(node->op()).feedback());
+      return input;
+    }
+
+#define CONVERT_PRIMITIVE_TO_OBJECT_CASE(name, kind, input_type,  \
+                                         input_interpretation)    \
+  case IrOpcode::k##name:                                         \
+    return __ ConvertUntaggedToJSPrimitive(                       \
+        Map(node->InputAt(0)),                                    \
+        ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::k##kind, \
+        V<input_type>::rep,                                       \
+        ConvertUntaggedToJSPrimitiveOp::InputInterpretation::     \
+            k##input_interpretation,                              \
         CheckForMinusZeroMode::kDontCheckForMinusZero);
-      CONVERT_TO_OBJECT_CASE(ChangeInt32ToTagged, Number, Word32, Signed)
-      CONVERT_TO_OBJECT_CASE(ChangeUint32ToTagged, Number, Word32, Unsigned)
-      CONVERT_TO_OBJECT_CASE(ChangeInt64ToTagged, Number, Word64, Signed)
-      CONVERT_TO_OBJECT_CASE(ChangeUint64ToTagged, Number, Word64, Unsigned)
-      CONVERT_TO_OBJECT_CASE(ChangeFloat64ToTaggedPointer, HeapNumber, Float64,
-                             Signed)
-      CONVERT_TO_OBJECT_CASE(ChangeInt64ToBigInt, BigInt, Word64, Signed)
-      CONVERT_TO_OBJECT_CASE(ChangeUint64ToBigInt, BigInt, Word64, Unsigned)
-      CONVERT_TO_OBJECT_CASE(ChangeInt31ToTaggedSigned, Smi, Word32, Signed)
-      CONVERT_TO_OBJECT_CASE(ChangeBitToTagged, Boolean, Word32, Signed)
-      CONVERT_TO_OBJECT_CASE(StringFromSingleCharCode, String, Word32, CharCode)
-      CONVERT_TO_OBJECT_CASE(StringFromSingleCodePoint, String, Word32,
-                             CodePoint)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeInt32ToTagged, Number, Word32,
+                                       Signed)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeUint32ToTagged, Number, Word32,
+                                       Unsigned)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeInt64ToTagged, Number, Word64,
+                                       Signed)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeUint64ToTagged, Number, Word64,
+                                       Unsigned)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeFloat64ToTaggedPointer, HeapNumber,
+                                       Float64, Signed)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeInt64ToBigInt, BigInt, Word64,
+                                       Signed)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeUint64ToBigInt, BigInt, Word64,
+                                       Unsigned)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeInt31ToTaggedSigned, Smi, Word32,
+                                       Signed)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(ChangeBitToTagged, Boolean, Word32,
+                                       Signed)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(StringFromSingleCharCode, String, Word32,
+                                       CharCode)
+      CONVERT_PRIMITIVE_TO_OBJECT_CASE(StringFromSingleCodePoint, String,
+                                       Word32, CodePoint)
 
     case IrOpcode::kChangeFloat64ToTagged:
-      return __ ConvertToObject(Map(node->InputAt(0)),
-                                ConvertToObjectOp::Kind::kNumber,
-                                RegisterRepresentation::Float64(),
-                                ConvertToObjectOp::InputInterpretation::kSigned,
-                                CheckMinusZeroModeOf(node->op()));
-#undef CONVERT_TO_OBJECT_CASE
-
-#define CONVERT_TO_OBJECT_OR_DEOPT_CASE(name, kind, input_type,      \
-                                        input_interpretation)        \
-  case IrOpcode::k##name: {                                          \
-    DCHECK(dominating_frame_state.valid());                          \
-    const CheckParameters& params = CheckParametersOf(node->op());   \
-    return __ ConvertToObjectOrDeopt(                                \
-        Map(node->InputAt(0)), dominating_frame_state,               \
-        ConvertToObjectOrDeoptOp::Kind::k##kind, V<input_type>::rep, \
-        ConvertToObjectOrDeoptOp::InputInterpretation::              \
-            k##input_interpretation,                                 \
-        params.feedback());                                          \
+      return __ ConvertUntaggedToJSPrimitive(
+          Map(node->InputAt(0)),
+          ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kNumber,
+          RegisterRepresentation::Float64(),
+          ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned,
+          CheckMinusZeroModeOf(node->op()));
+#undef CONVERT_PRIMITIVE_TO_OBJECT_CASE
+
+#define CONVERT_PRIMITIVE_TO_OBJECT_OR_DEOPT_CASE(name, kind, input_type, \
+                                                  input_interpretation)   \
+  case IrOpcode::k##name: {                                               \
+    DCHECK(dominating_frame_state.valid());                               \
+    const CheckParameters& params = CheckParametersOf(node->op());        \
+    return __ ConvertUntaggedToJSPrimitiveOrDeopt(                        \
+        Map(node->InputAt(0)), dominating_frame_state,                    \
+        ConvertUntaggedToJSPrimitiveOrDeoptOp::JSPrimitiveKind::k##kind,  \
+        V<input_type>::rep,                                               \
+        ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation::      \
+            k##input_interpretation,                                      \
+        params.feedback());                                               \
   }
-      CONVERT_TO_OBJECT_OR_DEOPT_CASE(CheckedInt32ToTaggedSigned, Smi, Word32,
-                                      Signed)
-      CONVERT_TO_OBJECT_OR_DEOPT_CASE(CheckedUint32ToTaggedSigned, Smi, Word32,
-                                      Unsigned)
-      CONVERT_TO_OBJECT_OR_DEOPT_CASE(CheckedInt64ToTaggedSigned, Smi, Word64,
-                                      Signed)
-      CONVERT_TO_OBJECT_OR_DEOPT_CASE(CheckedUint64ToTaggedSigned, Smi, Word64,
-                                      Unsigned)
-#undef CONVERT_TO_OBJECT_OR_DEOPT_CASE
-
-#define CONVERT_OBJECT_TO_PRIMITIVE_CASE(name, kind, input_assumptions)   \
-  case IrOpcode::k##name:                                                 \
-    return __ ConvertObjectToPrimitive(                                   \
-        Map(node->InputAt(0)), ConvertObjectToPrimitiveOp::Kind::k##kind, \
-        ConvertObjectToPrimitiveOp::InputAssumptions::k##input_assumptions);
+      CONVERT_PRIMITIVE_TO_OBJECT_OR_DEOPT_CASE(CheckedInt32ToTaggedSigned, Smi,
+                                                Word32, Signed)
+      CONVERT_PRIMITIVE_TO_OBJECT_OR_DEOPT_CASE(CheckedUint32ToTaggedSigned,
+                                                Smi, Word32, Unsigned)
+      CONVERT_PRIMITIVE_TO_OBJECT_OR_DEOPT_CASE(CheckedInt64ToTaggedSigned, Smi,
+                                                Word64, Signed)
+      CONVERT_PRIMITIVE_TO_OBJECT_OR_DEOPT_CASE(CheckedUint64ToTaggedSigned,
+                                                Smi, Word64, Unsigned)
+#undef CONVERT_PRIMITIVE_TO_OBJECT_OR_DEOPT_CASE
+
+#define CONVERT_OBJECT_TO_PRIMITIVE_CASE(name, kind, input_assumptions) \
+  case IrOpcode::k##name:                                               \
+    return __ ConvertJSPrimitiveToUntagged(                             \
+        Map(node->InputAt(0)),                                          \
+        ConvertJSPrimitiveToUntaggedOp::UntaggedKind::k##kind,          \
+        ConvertJSPrimitiveToUntaggedOp::InputAssumptions::              \
+            k##input_assumptions);
       CONVERT_OBJECT_TO_PRIMITIVE_CASE(ChangeTaggedSignedToInt32, Int32, Smi)
       CONVERT_OBJECT_TO_PRIMITIVE_CASE(ChangeTaggedSignedToInt64, Int64, Smi)
-      CONVERT_OBJECT_TO_PRIMITIVE_CASE(ChangeTaggedToBit, Bit, Object)
+      CONVERT_OBJECT_TO_PRIMITIVE_CASE(ChangeTaggedToBit, Bit, Boolean)
       CONVERT_OBJECT_TO_PRIMITIVE_CASE(ChangeTaggedToInt32, Int32,
                                        NumberOrOddball)
       CONVERT_OBJECT_TO_PRIMITIVE_CASE(ChangeTaggedToUint32, Uint32,
@@ -788,11 +922,13 @@ OpIndex GraphBuilder::Process(
                                        NumberOrOddball)
 #undef CONVERT_OBJECT_TO_PRIMITIVE_CASE
 
-#define TRUNCATE_OBJECT_TO_PRIMITIVE_CASE(name, kind, input_assumptions)   \
-  case IrOpcode::k##name:                                                  \
-    return __ TruncateObjectToPrimitive(                                   \
-        Map(node->InputAt(0)), TruncateObjectToPrimitiveOp::Kind::k##kind, \
-        TruncateObjectToPrimitiveOp::InputAssumptions::k##input_assumptions);
+#define TRUNCATE_OBJECT_TO_PRIMITIVE_CASE(name, kind, input_assumptions) \
+  case IrOpcode::k##name:                                                \
+    return __ TruncateJSPrimitiveToUntagged(                             \
+        Map(node->InputAt(0)),                                           \
+        TruncateJSPrimitiveToUntaggedOp::UntaggedKind::k##kind,          \
+        TruncateJSPrimitiveToUntaggedOp::InputAssumptions::              \
+            k##input_assumptions);
       TRUNCATE_OBJECT_TO_PRIMITIVE_CASE(TruncateTaggedToWord32, Int32,
                                         NumberOrOddball)
       TRUNCATE_OBJECT_TO_PRIMITIVE_CASE(TruncateBigIntToWord64, Int64, BigInt)
@@ -801,6 +937,27 @@ OpIndex GraphBuilder::Process(
                                         HeapObject)
 #undef TRUNCATE_OBJECT_TO_PRIMITIVE_CASE
 
+    case IrOpcode::kCheckedTruncateTaggedToWord32:
+      DCHECK(dominating_frame_state.valid());
+      using IR = TruncateJSPrimitiveToUntaggedOrDeoptOp::InputRequirement;
+      IR input_requirement;
+      switch (CheckTaggedInputParametersOf(node->op()).mode()) {
+        case CheckTaggedInputMode::kNumber:
+          input_requirement = IR::kNumber;
+          break;
+        case CheckTaggedInputMode::kNumberOrBoolean:
+          input_requirement = IR::kNumberOrBoolean;
+          break;
+        case CheckTaggedInputMode::kNumberOrOddball:
+          input_requirement = IR::kNumberOrOddball;
+          break;
+      }
+      return __ TruncateJSPrimitiveToUntaggedOrDeopt(
+          Map(node->InputAt(0)), dominating_frame_state,
+          TruncateJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt32,
+          input_requirement,
+          CheckTaggedInputParametersOf(node->op()).feedback());
+
 #define CHANGE_OR_DEOPT_INT_CASE(kind)                                     \
   case IrOpcode::kChecked##kind: {                                         \
     DCHECK(dominating_frame_state.valid());                                \
@@ -838,10 +995,10 @@ OpIndex GraphBuilder::Process(
       DCHECK(dominating_frame_state.valid());
       const CheckMinusZeroParameters& params =
           CheckMinusZeroParametersOf(node->op());
-      return __ ConvertObjectToPrimitiveOrDeopt(
+      return __ ConvertJSPrimitiveToUntaggedOrDeopt(
           Map(node->InputAt(0)), dominating_frame_state,
-          ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumber,
-          ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kInt32,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kNumber,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt32,
           params.mode(), params.feedback());
     }
 
@@ -849,10 +1006,10 @@ OpIndex GraphBuilder::Process(
       DCHECK(dominating_frame_state.valid());
       const CheckMinusZeroParameters& params =
           CheckMinusZeroParametersOf(node->op());
-      return __ ConvertObjectToPrimitiveOrDeopt(
+      return __ ConvertJSPrimitiveToUntaggedOrDeopt(
           Map(node->InputAt(0)), dominating_frame_state,
-          ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumber,
-          ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kInt64,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kNumber,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt64,
           params.mode(), params.feedback());
     }
 
@@ -860,40 +1017,42 @@ OpIndex GraphBuilder::Process(
       DCHECK(dominating_frame_state.valid());
       const CheckTaggedInputParameters& params =
           CheckTaggedInputParametersOf(node->op());
-      ConvertObjectToPrimitiveOrDeoptOp::ObjectKind from_kind;
+      ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind from_kind;
       switch (params.mode()) {
-#define CASE(mode)                                                      \
-  case CheckTaggedInputMode::k##mode:                                   \
-    from_kind = ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::k##mode; \
+#define CASE(mode)                                                       \
+  case CheckTaggedInputMode::k##mode:                                    \
+    from_kind =                                                          \
+        ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::k##mode; \
     break;
         CASE(Number)
         CASE(NumberOrBoolean)
         CASE(NumberOrOddball)
 #undef CASE
       }
-      return __ ConvertObjectToPrimitiveOrDeopt(
+      return __ ConvertJSPrimitiveToUntaggedOrDeopt(
           Map(node->InputAt(0)), dominating_frame_state, from_kind,
-          ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kFloat64,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kFloat64,
           CheckForMinusZeroMode::kDontCheckForMinusZero, params.feedback());
     }
 
     case IrOpcode::kCheckedTaggedToArrayIndex: {
       DCHECK(dominating_frame_state.valid());
       const CheckParameters& params = CheckParametersOf(node->op());
-      return __ ConvertObjectToPrimitiveOrDeopt(
+      return __ ConvertJSPrimitiveToUntaggedOrDeopt(
           Map(node->InputAt(0)), dominating_frame_state,
-          ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumberOrString,
-          ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kArrayIndex,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::
+              kNumberOrString,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kArrayIndex,
           CheckForMinusZeroMode::kCheckForMinusZero, params.feedback());
     }
 
     case IrOpcode::kCheckedTaggedSignedToInt32: {
       DCHECK(dominating_frame_state.valid());
       const CheckParameters& params = CheckParametersOf(node->op());
-      return __ ConvertObjectToPrimitiveOrDeopt(
+      return __ ConvertJSPrimitiveToUntaggedOrDeopt(
           Map(node->InputAt(0)), dominating_frame_state,
-          ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kSmi,
-          ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kInt32,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kSmi,
+          ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt32,
           CheckForMinusZeroMode::kDontCheckForMinusZero, params.feedback());
     }
 
@@ -927,18 +1086,24 @@ OpIndex GraphBuilder::Process(
       LoadOp::Kind kind = opcode == IrOpcode::kUnalignedLoad
                               ? LoadOp::Kind::RawUnaligned()
                               : LoadOp::Kind::RawAligned();
+      if (__ output_graph().Get(Map(base)).outputs_rep().at(0) ==
+          RegisterRepresentation::Tagged()) {
+        kind = LoadOp::Kind::TaggedBase();
+      }
       if (index->opcode() == IrOpcode::kInt32Constant) {
         int32_t offset = OpParameter<int32_t>(index->op());
+        if (kind.tagged_base) offset += kHeapObjectTag;
         return __ Load(Map(base), kind, loaded_rep, offset);
       }
       if (index->opcode() == IrOpcode::kInt64Constant) {
         int64_t offset = OpParameter<int64_t>(index->op());
+        if (kind.tagged_base) offset += kHeapObjectTag;
         if (base::IsValueInRangeForNumericType<int32_t>(offset)) {
           return __ Load(Map(base), kind, loaded_rep,
                          static_cast<int32_t>(offset));
         }
       }
-      int32_t offset = 0;
+      int32_t offset = kind.tagged_base ? kHeapObjectTag : 0;
       uint8_t element_size_log2 = 0;
       return __ Load(Map(base), Map(index), kind, loaded_rep, offset,
                      element_size_log2);
@@ -960,6 +1125,7 @@ OpIndex GraphBuilder::Process(
       StoreOp::Kind kind = opcode == IrOpcode::kStore
                                ? StoreOp::Kind::RawAligned()
                                : StoreOp::Kind::RawUnaligned();
+      bool initializing_transitioning = inside_region;
 
       Node* base = node->InputAt(0);
       Node* index = node->InputAt(1);
@@ -969,7 +1135,8 @@ OpIndex GraphBuilder::Process(
         __ Store(Map(base), Map(value), kind,
                  MemoryRepresentation::FromMachineRepresentation(
                      store_rep.representation()),
-                 store_rep.write_barrier_kind(), offset);
+                 store_rep.write_barrier_kind(), offset,
+                 initializing_transitioning);
         return OpIndex::Invalid();
       }
       if (index->opcode() == IrOpcode::kInt64Constant) {
@@ -978,8 +1145,8 @@ OpIndex GraphBuilder::Process(
           __ Store(Map(base), Map(value), kind,
                    MemoryRepresentation::FromMachineRepresentation(
                        store_rep.representation()),
-                   store_rep.write_barrier_kind(),
-                   static_cast<int32_t>(offset));
+                   store_rep.write_barrier_kind(), static_cast<int32_t>(offset),
+                   initializing_transitioning);
           return OpIndex::Invalid();
         }
       }
@@ -988,10 +1155,13 @@ OpIndex GraphBuilder::Process(
       __ Store(Map(base), Map(index), Map(value), kind,
                MemoryRepresentation::FromMachineRepresentation(
                    store_rep.representation()),
-               store_rep.write_barrier_kind(), offset, element_size_log2);
+               store_rep.write_barrier_kind(), offset, element_size_log2,
+               initializing_transitioning);
       return OpIndex::Invalid();
     }
     case IrOpcode::kProtectedStore:
+      // We don't mark ProtectedStores as initialzing even when inside regions,
+      // since we don't store-store eliminate them because they have a raw base.
       __ Store(Map(node->InputAt(0)), Map(node->InputAt(1)),
                Map(node->InputAt(2)), StoreOp::Kind::Protected(),
                MemoryRepresentation::FromMachineRepresentation(
@@ -1049,9 +1219,10 @@ OpIndex GraphBuilder::Process(
            ++i) {
         arguments.emplace_back(Map(node->InputAt(i)));
       }
-
+      CanThrow can_throw =
+          op->HasProperty(Operator::kNoThrow) ? CanThrow::kNo : CanThrow::kYes;
       const TSCallDescriptor* ts_descriptor =
-          TSCallDescriptor::Create(call_descriptor, graph_zone);
+          TSCallDescriptor::Create(call_descriptor, can_throw, graph_zone);
 
       OpIndex frame_state_idx = OpIndex::Invalid();
       if (call_descriptor->NeedsFrameState()) {
@@ -1059,22 +1230,20 @@ OpIndex GraphBuilder::Process(
             node->InputAt(static_cast<int>(call_descriptor->InputCount()))};
         frame_state_idx = Map(frame_state);
       }
-
-      if (!is_final_control) {
-        return EmitProjectionsAndTuple(__ Call(
-            callee, frame_state_idx, base::VectorOf(arguments), ts_descriptor));
-      } else {
-        DCHECK_EQ(block->SuccessorCount(), 2);
-
-        Block* if_success = Map(block->SuccessorAt(0));
-        Block* if_exception = Map(block->SuccessorAt(1));
-        // CallAndCatchException is a block terminator, so we can't generate the
-        // projections right away. We'll generate them in the IfSuccess
-        // successor.
-        return __ CallAndCatchException(callee, frame_state_idx,
-                                        base::VectorOf(arguments), if_success,
-                                        if_exception, ts_descriptor);
+      base::Optional<decltype(assembler)::CatchScope> catch_scope;
+      if (is_final_control) {
+        Block* catch_block = Map(block->SuccessorAt(1));
+        catch_scope.emplace(assembler, catch_block);
+      }
+      OpIndex result = EmitProjectionsAndTuple(__ Call(
+          callee, frame_state_idx, base::VectorOf(arguments), ts_descriptor));
+      if (is_final_control) {
+        // The `__ Call()` before has already created exceptional control flow
+        // and bound a new block for the success case. So we can just `Goto` the
+        // block that Turbofan designated as the `IfSuccess` successor.
+        __ Goto(Map(block->SuccessorAt(0)));
       }
+      return result;
     }
 
     case IrOpcode::kTailCall: {
@@ -1089,8 +1258,10 @@ OpIndex GraphBuilder::Process(
         arguments.emplace_back(Map(node->InputAt(i)));
       }
 
+      CanThrow can_throw =
+          op->HasProperty(Operator::kNoThrow) ? CanThrow::kNo : CanThrow::kYes;
       const TSCallDescriptor* ts_descriptor =
-          TSCallDescriptor::Create(call_descriptor, graph_zone);
+          TSCallDescriptor::Create(call_descriptor, can_throw, graph_zone);
 
       __ TailCall(callee, base::VectorOf(arguments), ts_descriptor);
       return OpIndex::Invalid();
@@ -1120,10 +1291,17 @@ OpIndex GraphBuilder::Process(
       return OpIndex::Invalid();
 
     case IrOpcode::kTrapIf:
-      __ TrapIf(Map(node->InputAt(0)), TrapIdOf(op));
+      // For wasm the dominating_frame_state is invalid and will not be used.
+      // For traps inlined into JS the dominating_frame_state is valid and is
+      // needed for the trap.
+      __ TrapIf(Map(node->InputAt(0)), dominating_frame_state, TrapIdOf(op));
       return OpIndex::Invalid();
+
     case IrOpcode::kTrapUnless:
-      __ TrapIfNot(Map(node->InputAt(0)), TrapIdOf(op));
+      // For wasm the dominating_frame_state is invalid and will not be used.
+      // For traps inlined into JS the dominating_frame_state is valid and is
+      // needed for the trap.
+      __ TrapIfNot(Map(node->InputAt(0)), dominating_frame_state, TrapIdOf(op));
       return OpIndex::Invalid();
 
     case IrOpcode::kDeoptimize: {
@@ -1146,6 +1324,16 @@ OpIndex GraphBuilder::Process(
       __ Unreachable();
       return OpIndex::Invalid();
 
+    case IrOpcode::kDeadValue:
+      // Typically, DeadValue nodes have Unreachable as their input. In this
+      // case, we would not get here because Unreachable already terminated the
+      // block and we stopped generating additional operations.
+      DCHECK_NE(node->InputAt(0)->opcode(), IrOpcode::kUnreachable);
+      // If we find a DeadValue without an Unreachable input, we just generate
+      // one here and stop.
+      __ Unreachable();
+      return OpIndex::Invalid();
+
     case IrOpcode::kProjection: {
       Node* input = node->InputAt(0);
       size_t index = ProjectionIndexOf(op);
@@ -1156,36 +1344,33 @@ OpIndex GraphBuilder::Process(
     }
 
     case IrOpcode::kStaticAssert: {
-      // We currently ignore StaticAsserts in turboshaft (because some of them
-      // need specific unported optimizations to be evaluated).
-      // TODO(turboshaft): once CommonOperatorReducer and MachineOperatorReducer
-      // have been ported, re-enable StaticAsserts.
-      // return __ ReduceStaticAssert(Map(node->InputAt(0)),
-      //                                     StaticAssertSourceOf(node->op()));
+      __ StaticAssert(Map(node->InputAt(0)), StaticAssertSourceOf(node->op()));
       return OpIndex::Invalid();
     }
 
     case IrOpcode::kAllocate: {
       AllocationType allocation = AllocationTypeOf(node->op());
-      return __ Allocate(Map(node->InputAt(0)), allocation,
-                         AllowLargeObjects::kFalse);
+      return __ FinishInitialization(
+          __ Allocate(Map(node->InputAt(0)), allocation));
     }
     // TODO(nicohartmann@): We might not see AllocateRaw here anymore.
     case IrOpcode::kAllocateRaw: {
       Node* size = node->InputAt(0);
       const AllocateParameters& params = AllocateParametersOf(node->op());
-      return __ Allocate(Map(size), params.allocation_type(),
-                         params.allow_large_objects());
+      return __ FinishInitialization(
+          __ Allocate(Map(size), params.allocation_type()));
     }
     case IrOpcode::kStoreToObject: {
       Node* object = node->InputAt(0);
       Node* offset = node->InputAt(1);
       Node* value = node->InputAt(2);
       ObjectAccess const& access = ObjectAccessOf(node->op());
+      bool initializing_transitioning = inside_region;
       __ Store(Map(object), Map(offset), Map(value),
                StoreOp::Kind::TaggedBase(),
                MemoryRepresentation::FromMachineType(access.machine_type),
-               access.write_barrier_kind, kHeapObjectTag);
+               access.write_barrier_kind, kHeapObjectTag,
+               initializing_transitioning);
       return OpIndex::Invalid();
     }
     case IrOpcode::kStoreElement: {
@@ -1197,9 +1382,10 @@ OpIndex GraphBuilder::Process(
       StoreOp::Kind kind = StoreOp::Kind::Aligned(access.base_is_tagged);
       MemoryRepresentation rep =
           MemoryRepresentation::FromMachineType(access.machine_type);
+      bool initializing_transitioning = inside_region;
       __ Store(Map(object), Map(index), Map(value), kind, rep,
                access.write_barrier_kind, access.header_size,
-               rep.SizeInBytesLog2());
+               rep.SizeInBytesLog2(), initializing_transitioning);
       return OpIndex::Invalid();
     }
     case IrOpcode::kStoreField: {
@@ -1227,10 +1413,19 @@ OpIndex GraphBuilder::Process(
         UNIMPLEMENTED();
 #endif
       }
+
+      bool initializing_transitioning =
+          access.maybe_initializing_or_transitioning_store;
+      if (!inside_region) {
+        // Mark stores outside a region as non-initializing and
+        // non-transitioning.
+        initializing_transitioning = false;
+      }
+
       MemoryRepresentation rep =
           MemoryRepresentation::FromMachineType(machine_type);
       __ Store(object, value, kind, rep, access.write_barrier_kind,
-               access.offset);
+               access.offset, initializing_transitioning);
       return OpIndex::Invalid();
     }
     case IrOpcode::kLoadFromObject:
@@ -1436,7 +1631,7 @@ OpIndex GraphBuilder::Process(
 
           // Check if {lhs} is kMinInt and {rhs} is -1, in which case we'd have
           // to return -kMinInt, which is not representable as Word32.
-          IF_UNLIKELY(__ Word32Equal(lhs, kMinInt)) {
+          IF(UNLIKELY(__ Word32Equal(lhs, kMinInt))) {
             __ DeoptimizeIf(__ Word32Equal(rhs, -1), dominating_frame_state,
                             DeoptimizeReason::kOverflow, FeedbackSource{});
           }
@@ -1464,7 +1659,7 @@ OpIndex GraphBuilder::Process(
                       DeoptimizeReason::kDivisionByZero, FeedbackSource{});
       // Check if {lhs} is kMinInt64 and {rhs} is -1, in which case we'd have
       // to return -kMinInt64, which is not representable as Word64.
-      IF_UNLIKELY(__ Word64Equal(lhs, std::numeric_limits<int64_t>::min())) {
+      IF(UNLIKELY(__ Word64Equal(lhs, std::numeric_limits<int64_t>::min()))) {
         __ DeoptimizeIf(__ Word64Equal(rhs, int64_t{-1}),
                         dominating_frame_state, DeoptimizeReason::kOverflow,
                         FeedbackSource{});
@@ -1585,7 +1780,7 @@ OpIndex GraphBuilder::Process(
 
       // While the mod-result cannot overflow, the underlying instruction is
       // `idiv` and will trap when the accompanying div-result overflows.
-      IF_UNLIKELY(__ Word64Equal(lhs, std::numeric_limits<int64_t>::min())) {
+      IF(UNLIKELY(__ Word64Equal(lhs, std::numeric_limits<int64_t>::min()))) {
         __ DeoptimizeIf(__ Word64Equal(rhs, int64_t{-1}),
                         dominating_frame_state, DeoptimizeReason::kOverflow,
                         FeedbackSource{});
@@ -1673,6 +1868,10 @@ OpIndex GraphBuilder::Process(
       return __ StringSubstring(Map(node->InputAt(0)), Map(node->InputAt(1)),
                                 Map(node->InputAt(2)));
 
+    case IrOpcode::kStringConcat:
+      // We don't need node->InputAt(0) here.
+      return __ StringConcat(Map(node->InputAt(1)), Map(node->InputAt(2)));
+
     case IrOpcode::kStringEqual:
       return __ StringEqual(Map(node->InputAt(0)), Map(node->InputAt(1)));
     case IrOpcode::kStringLessThan:
@@ -1681,9 +1880,311 @@ OpIndex GraphBuilder::Process(
       return __ StringLessThanOrEqual(Map(node->InputAt(0)),
                                       Map(node->InputAt(1)));
 
+    case IrOpcode::kArgumentsLength:
+      return __ ArgumentsLength();
+    case IrOpcode::kRestLength:
+      return __ RestLength(FormalParameterCountOf(node->op()));
+
+    case IrOpcode::kNewArgumentsElements: {
+      const auto& p = NewArgumentsElementsParametersOf(node->op());
+      // EffectControlLinearizer used to use `node->op()->properties()` to
+      // construct the builtin call descriptor for this operation. However, this
+      // always seemed to be `kEliminatable` so the Turboshaft
+      // BuiltinCallDescriptor's for those builtins have this property
+      // hard-coded.
+      DCHECK_EQ(node->op()->properties(), Operator::kEliminatable);
+      return __ NewArgumentsElements(Map(node->InputAt(0)), p.arguments_type(),
+                                     p.formal_parameter_count());
+    }
+
+    case IrOpcode::kLoadTypedElement:
+      return __ LoadTypedElement(Map(node->InputAt(0)), Map(node->InputAt(1)),
+                                 Map(node->InputAt(2)), Map(node->InputAt(3)),
+                                 ExternalArrayTypeOf(node->op()));
+    case IrOpcode::kLoadDataViewElement:
+      return __ LoadDataViewElement(
+          Map(node->InputAt(0)), Map(node->InputAt(1)), Map(node->InputAt(2)),
+          Map(node->InputAt(3)), ExternalArrayTypeOf(node->op()));
+    case IrOpcode::kLoadStackArgument:
+      return __ LoadStackArgument(Map(node->InputAt(0)), Map(node->InputAt(1)));
+
+    case IrOpcode::kStoreTypedElement:
+      __ StoreTypedElement(Map(node->InputAt(0)), Map(node->InputAt(1)),
+                           Map(node->InputAt(2)), Map(node->InputAt(3)),
+                           Map(node->InputAt(4)),
+                           ExternalArrayTypeOf(node->op()));
+      return OpIndex::Invalid();
+    case IrOpcode::kStoreDataViewElement:
+      __ StoreDataViewElement(Map(node->InputAt(0)), Map(node->InputAt(1)),
+                              Map(node->InputAt(2)), Map(node->InputAt(3)),
+                              Map(node->InputAt(4)),
+                              ExternalArrayTypeOf(node->op()));
+      return OpIndex::Invalid();
+    case IrOpcode::kTransitionAndStoreElement:
+      __ TransitionAndStoreArrayElement(
+          Map(node->InputAt(0)), Map(node->InputAt(1)), Map(node->InputAt(2)),
+          TransitionAndStoreArrayElementOp::Kind::kElement,
+          FastMapParameterOf(node->op()).object(),
+          DoubleMapParameterOf(node->op()).object());
+      return OpIndex::Invalid();
+    case IrOpcode::kTransitionAndStoreNumberElement:
+      __ TransitionAndStoreArrayElement(
+          Map(node->InputAt(0)), Map(node->InputAt(1)), Map(node->InputAt(2)),
+          TransitionAndStoreArrayElementOp::Kind::kNumberElement, {},
+          DoubleMapParameterOf(node->op()).object());
+      return OpIndex::Invalid();
+    case IrOpcode::kTransitionAndStoreNonNumberElement: {
+      auto kind =
+          ValueTypeParameterOf(node->op())
+                  .Is(compiler::Type::BooleanOrNullOrUndefined())
+              ? TransitionAndStoreArrayElementOp::Kind::kOddballElement
+              : TransitionAndStoreArrayElementOp::Kind::kNonNumberElement;
+      __ TransitionAndStoreArrayElement(
+          Map(node->InputAt(0)), Map(node->InputAt(1)), Map(node->InputAt(2)),
+          kind, FastMapParameterOf(node->op()).object(), {});
+      return OpIndex::Invalid();
+    }
+    case IrOpcode::kStoreSignedSmallElement:
+      __ StoreSignedSmallElement(Map(node->InputAt(0)), Map(node->InputAt(1)),
+                                 Map(node->InputAt(2)));
+      return OpIndex::Invalid();
+
+    case IrOpcode::kCompareMaps: {
+      const ZoneRefSet<v8::internal::Map>& maps =
+          CompareMapsParametersOf(node->op());
+      return __ CompareMaps(Map(node->InputAt(0)), maps);
+    }
+
+    case IrOpcode::kCheckMaps: {
+      DCHECK(dominating_frame_state.valid());
+      const auto& p = CheckMapsParametersOf(node->op());
+      __ CheckMaps(Map(node->InputAt(0)), dominating_frame_state, p.maps(),
+                   p.flags(), p.feedback());
+      return OpIndex{};
+    }
+
+    case IrOpcode::kCheckedUint32Bounds:
+    case IrOpcode::kCheckedUint64Bounds: {
+      WordRepresentation rep = node->opcode() == IrOpcode::kCheckedUint32Bounds
+                                   ? WordRepresentation::Word32()
+                                   : WordRepresentation::Word64();
+      const CheckBoundsParameters& params = CheckBoundsParametersOf(node->op());
+      OpIndex index = Map(node->InputAt(0));
+      OpIndex limit = Map(node->InputAt(1));
+      V<Word32> check = __ UintLessThan(index, limit, rep);
+      if ((params.flags() & CheckBoundsFlag::kAbortOnOutOfBounds) != 0) {
+        IF_NOT(LIKELY(check)) { __ Unreachable(); }
+        END_IF
+      } else {
+        DCHECK(dominating_frame_state.valid());
+        __ DeoptimizeIfNot(check, dominating_frame_state,
+                           DeoptimizeReason::kOutOfBounds,
+                           params.check_parameters().feedback());
+      }
+      return index;
+    }
+
+    case IrOpcode::kCheckIf: {
+      DCHECK(dominating_frame_state.valid());
+      const CheckIfParameters& params = CheckIfParametersOf(node->op());
+      __ DeoptimizeIfNot(Map(node->InputAt(0)), dominating_frame_state,
+                         params.reason(), params.feedback());
+      return OpIndex::Invalid();
+    }
+
+    case IrOpcode::kCheckClosure:
+      DCHECK(dominating_frame_state.valid());
+      return __ CheckedClosure(Map(node->InputAt(0)), dominating_frame_state,
+                               FeedbackCellOf(node->op()));
+
+    case IrOpcode::kCheckEqualsSymbol:
+      DCHECK(dominating_frame_state.valid());
+      __ DeoptimizeIfNot(
+          __ TaggedEqual(Map(node->InputAt(0)), Map(node->InputAt(1))),
+          dominating_frame_state, DeoptimizeReason::kWrongName,
+          FeedbackSource{});
+      return OpIndex::Invalid();
+
+    case IrOpcode::kCheckEqualsInternalizedString:
+      DCHECK(dominating_frame_state.valid());
+      __ CheckEqualsInternalizedString(
+          Map(node->InputAt(0)), Map(node->InputAt(1)), dominating_frame_state);
+      return OpIndex::Invalid();
+
+    case IrOpcode::kCheckFloat64Hole: {
+      DCHECK(dominating_frame_state.valid());
+      V<Float64> value = Map(node->InputAt(0));
+      // TODO(tebbi): If we did partial block cloning, we could emit a
+      // `DeoptimizeIf` operation here. Alternatively, we could use a branch and
+      // a separate block with an unconditional `Deoptimize`.
+      return __ ChangeOrDeopt(
+          value, dominating_frame_state, ChangeOrDeoptOp::Kind::kFloat64NotHole,
+          CheckForMinusZeroMode::kDontCheckForMinusZero,
+          CheckFloat64HoleParametersOf(node->op()).feedback());
+    }
+
+    case IrOpcode::kCheckNotTaggedHole: {
+      DCHECK(dominating_frame_state.valid());
+      V<Object> value = Map(node->InputAt(0));
+      __ DeoptimizeIf(
+          __ TaggedEqual(value,
+                         __ HeapConstant(isolate->factory()->the_hole_value())),
+          dominating_frame_state, DeoptimizeReason::kHole, FeedbackSource{});
+      return value;
+    }
+
+    case IrOpcode::kLoadMessage:
+      return __ LoadMessage(Map(node->InputAt(0)));
+    case IrOpcode::kStoreMessage:
+      __ StoreMessage(Map(node->InputAt(0)), Map(node->InputAt(1)));
+      return OpIndex::Invalid();
+
+    case IrOpcode::kSameValue:
+      return __ SameValue(Map(node->InputAt(0)), Map(node->InputAt(1)),
+                          SameValueOp::Mode::kSameValue);
+    case IrOpcode::kSameValueNumbersOnly:
+      return __ SameValue(Map(node->InputAt(0)), Map(node->InputAt(1)),
+                          SameValueOp::Mode::kSameValueNumbersOnly);
+    case IrOpcode::kNumberSameValue:
+      return __ Float64SameValue(Map(node->InputAt(0)), Map(node->InputAt(1)));
+
+    case IrOpcode::kTypeOf:
+      return __ CallBuiltin_Typeof(isolate, Map(node->InputAt(0)));
+
+    case IrOpcode::kFastApiCall: {
+      DCHECK(dominating_frame_state.valid());
+      FastApiCallNode n(node);
+      const auto& params = n.Parameters();
+      const FastApiCallFunctionVector& c_functions = params.c_functions();
+      const int c_arg_count = params.argument_count();
+
+      base::SmallVector<OpIndex, 16> slow_call_arguments;
+      DCHECK_EQ(node->op()->ValueInputCount() - c_arg_count,
+                n.SlowCallArgumentCount());
+      OpIndex slow_call_callee = Map(n.SlowCallArgument(0));
+      for (int i = 1; i < n.SlowCallArgumentCount(); ++i) {
+        slow_call_arguments.push_back(Map(n.SlowCallArgument(i)));
+      }
+
+      // Overload resolution.
+      auto resolution_result =
+          fast_api_call::OverloadsResolutionResult::Invalid();
+      if (c_functions.size() != 1) {
+        DCHECK_EQ(c_functions.size(), 2);
+        resolution_result =
+            fast_api_call::ResolveOverloads(c_functions, c_arg_count);
+        if (!resolution_result.is_valid()) {
+          return __ Call(
+              slow_call_callee, dominating_frame_state,
+              base::VectorOf(slow_call_arguments),
+              TSCallDescriptor::Create(params.descriptor(), CanThrow::kYes,
+                                       __ graph_zone()));
+        }
+      }
+
+      // Prepare FastCallApiOp parameters.
+      base::SmallVector<OpIndex, 16> arguments;
+      for (int i = 0; i < c_arg_count; ++i) {
+        arguments.push_back(Map(NodeProperties::GetValueInput(node, i)));
+      }
+      OpIndex data_argument =
+          Map(n.SlowCallArgument(FastApiCallNode::kSlowCallDataArgumentIndex));
+      const FastApiCallParameters* parameters = FastApiCallParameters::Create(
+          c_functions, resolution_result, __ graph_zone());
+
+      Label<Object> done(this);
+
+      OpIndex fast_call_result =
+          __ FastApiCall(data_argument, base::VectorOf(arguments), parameters);
+      V<Word32> result_state =
+          __ template Projection<Word32>(fast_call_result, 0);
+
+      IF(LIKELY(__ Word32Equal(result_state, FastApiCallOp::kSuccessValue))) {
+        GOTO(done, __ template Projection<Object>(fast_call_result, 1));
+      }
+      ELSE {
+        // We need to generate a fallback (both fast and slow call) in case:
+        // 1) the generated code might fail, in case e.g. a Smi was passed where
+        // a JSObject was expected and an error must be thrown or
+        // 2) the embedder requested fallback possibility via providing options
+        // arg. None of the above usually holds true for Wasm functions with
+        // primitive types only, so we avoid generating an extra branch here.
+        V<Object> slow_call_result =
+            __ Call(slow_call_callee, dominating_frame_state,
+                    base::VectorOf(slow_call_arguments),
+                    TSCallDescriptor::Create(params.descriptor(),
+                                             CanThrow::kYes, __ graph_zone()));
+        GOTO(done, slow_call_result);
+      }
+      END_IF
+
+      BIND(done, result);
+      return result;
+    }
+
+    case IrOpcode::kRuntimeAbort:
+      __ RuntimeAbort(AbortReasonOf(node->op()));
+      return OpIndex::Invalid();
+
+    case IrOpcode::kDateNow:
+      return __ CallRuntime_DateCurrentTime(isolate, __ NoContextConstant());
+
+    case IrOpcode::kEnsureWritableFastElements:
+      return __ EnsureWritableFastElements(Map(node->InputAt(0)),
+                                           Map(node->InputAt(1)));
+
+    case IrOpcode::kMaybeGrowFastElements: {
+      DCHECK(dominating_frame_state.valid());
+      const GrowFastElementsParameters& params =
+          GrowFastElementsParametersOf(node->op());
+      return __ MaybeGrowFastElements(
+          Map(node->InputAt(0)), Map(node->InputAt(1)), Map(node->InputAt(2)),
+          Map(node->InputAt(3)), dominating_frame_state, params.mode(),
+          params.feedback());
+    }
+
+    case IrOpcode::kTransitionElementsKind:
+      __ TransitionElementsKind(Map(node->InputAt(0)),
+                                ElementsTransitionOf(node->op()));
+      return OpIndex::Invalid();
+
+    case IrOpcode::kAssertType: {
+      compiler::Type type = OpParameter<compiler::Type>(node->op());
+      CHECK(type.CanBeAsserted());
+      V<TurbofanType> allocated_type;
+      {
+        DCHECK(isolate->CurrentLocalHeap()->is_main_thread());
+        base::Optional<UnparkedScope> unparked_scope;
+        if (isolate->CurrentLocalHeap()->IsParked()) {
+          unparked_scope.emplace(isolate->main_thread_local_isolate());
+        }
+        allocated_type =
+            __ HeapConstant(type.AllocateOnHeap(isolate->factory()));
+      }
+      __ CallBuiltin_CheckTurbofanType(isolate, __ NoContextConstant(),
+                                       Map(node->InputAt(0)), allocated_type,
+                                       __ TagSmi(node->id()));
+      return OpIndex::Invalid();
+    }
+
+    case IrOpcode::kFindOrderedHashMapEntry:
+      return __ FindOrderedHashMapEntry(Map(node->InputAt(0)),
+                                        Map(node->InputAt(1)));
+    case IrOpcode::kFindOrderedHashSetEntry:
+      return __ FindOrderedHashSetEntry(Map(node->InputAt(0)),
+                                        Map(node->InputAt(1)));
+    case IrOpcode::kFindOrderedHashMapEntryForInt32Key:
+      return __ FindOrderedHashMapEntryForInt32Key(Map(node->InputAt(0)),
+                                                   Map(node->InputAt(1)));
+
     case IrOpcode::kBeginRegion:
+      inside_region = true;
       return OpIndex::Invalid();
     case IrOpcode::kFinishRegion:
+      inside_region = false;
+      return Map(node->InputAt(0));
+
+    case IrOpcode::kTypeGuard:
       return Map(node->InputAt(0));
 
     default:
@@ -1695,23 +2196,9 @@ OpIndex GraphBuilder::Process(
 
 }  // namespace
 
-base::Optional<BailoutReason> BuildGraph(JSHeapBroker* broker,
-                                         Schedule* schedule, Isolate* isolate,
-                                         Zone* graph_zone, Zone* phase_zone,
-                                         Graph* graph, Linkage* linkage,
-                                         SourcePositionTable* source_positions,
-                                         NodeOriginTable* origins) {
-  GraphBuilder builder{isolate,
-                       broker,
-                       graph_zone,
-                       phase_zone,
-                       *schedule,
-                       Assembler<reducer_list<>>(*graph, *graph, phase_zone,
-                                                 nullptr, std::tuple<>{}),
-                       linkage,
-                       source_positions,
-                       origins};
-  return builder.Run();
+base::Optional<BailoutReason> BuildGraph(Schedule* schedule, Zone* phase_zone,
+                                         Linkage* linkage) {
+  return GraphBuilder{phase_zone, *schedule, linkage}.Run();
 }
 
 #include "src/compiler/turboshaft/undef-assembler-macros.inc"
diff --git a/deps/v8/src/compiler/turboshaft/graph-builder.h b/deps/v8/src/compiler/turboshaft/graph-builder.h
index 86cc8572918bc5..e0d16b538626be 100644
--- a/deps/v8/src/compiler/turboshaft/graph-builder.h
+++ b/deps/v8/src/compiler/turboshaft/graph-builder.h
@@ -14,12 +14,8 @@ class Schedule;
 class SourcePositionTable;
 }
 namespace v8::internal::compiler::turboshaft {
-base::Optional<BailoutReason> BuildGraph(JSHeapBroker* broker,
-                                         Schedule* schedule, Isolate* isolate,
-                                         Zone* graph_zone, Zone* phase_zone,
-                                         Graph* graph, Linkage* linkage,
-                                         SourcePositionTable* source_positions,
-                                         NodeOriginTable* origins);
+base::Optional<BailoutReason> BuildGraph(Schedule* schedule, Zone* phase_zone,
+                                         Linkage* linkage);
 }
 
 #endif  // V8_COMPILER_TURBOSHAFT_GRAPH_BUILDER_H_
diff --git a/deps/v8/src/compiler/turboshaft/graph-visualizer.cc b/deps/v8/src/compiler/turboshaft/graph-visualizer.cc
index edbbdfe601aef1..e06707984025eb 100644
--- a/deps/v8/src/compiler/turboshaft/graph-visualizer.cc
+++ b/deps/v8/src/compiler/turboshaft/graph-visualizer.cc
@@ -38,7 +38,7 @@ void JSONTurboshaftGraphWriter::PrintNodes() {
       os_ << "{\"id\":" << index.id() << ",";
       os_ << "\"title\":\"" << OpcodeName(op.opcode) << "\",";
       os_ << "\"block_id\":" << block.index().id() << ",";
-      os_ << "\"op_properties_type\":\"" << op.Properties() << "\"";
+      os_ << "\"op_effects\":\"" << op.Effects() << "\"";
       if (origins_) {
         NodeOrigin origin = origins_->GetNodeOrigin(index.id());
         if (origin.IsKnown()) {
diff --git a/deps/v8/src/compiler/turboshaft/graph.cc b/deps/v8/src/compiler/turboshaft/graph.cc
index aae0becb583b16..40b3d60afe7bcf 100644
--- a/deps/v8/src/compiler/turboshaft/graph.cc
+++ b/deps/v8/src/compiler/turboshaft/graph.cc
@@ -89,16 +89,12 @@ std::ostream& operator<<(std::ostream& os, const Graph& graph) {
 std::ostream& operator<<(std::ostream& os, const Block::Kind& kind) {
   switch (kind) {
     case Block::Kind::kLoopHeader:
-      os << "LOOP";
-      break;
+      return os << "LOOP";
     case Block::Kind::kMerge:
-      os << "MERGE";
-      break;
+      return os << "MERGE";
     case Block::Kind::kBranchTarget:
-      os << "BLOCK";
-      break;
+      return os << "BLOCK";
   }
-  return os;
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/graph.h b/deps/v8/src/compiler/turboshaft/graph.h
index 8f77f08ebeb2c0..9c8389fc253b37 100644
--- a/deps/v8/src/compiler/turboshaft/graph.h
+++ b/deps/v8/src/compiler/turboshaft/graph.h
@@ -72,9 +72,10 @@ class OperationBuffer {
 
   explicit OperationBuffer(Zone* zone, size_t initial_capacity) : zone_(zone) {
     DCHECK_NE(initial_capacity, 0);
-    begin_ = end_ = zone_->NewArray<OperationStorageSlot>(initial_capacity);
+    begin_ = end_ =
+        zone_->AllocateArray<OperationStorageSlot>(initial_capacity);
     operation_sizes_ =
-        zone_->NewArray<uint16_t>((initial_capacity + 1) / kSlotsPerId);
+        zone_->AllocateArray<uint16_t>((initial_capacity + 1) / kSlotsPerId);
     end_cap_ = begin_ + initial_capacity;
   }
 
@@ -163,11 +164,11 @@ class OperationBuffer {
                                sizeof(OperationStorageSlot));
 
     OperationStorageSlot* new_buffer =
-        zone_->NewArray<OperationStorageSlot>(new_capacity);
+        zone_->AllocateArray<OperationStorageSlot>(new_capacity);
     memcpy(new_buffer, begin_, size * sizeof(OperationStorageSlot));
 
     uint16_t* new_operation_sizes =
-        zone_->NewArray<uint16_t>(new_capacity / kSlotsPerId);
+        zone_->AllocateArray<uint16_t>(new_capacity / kSlotsPerId);
     memcpy(new_operation_sizes, operation_sizes_,
            size / kSlotsPerId * sizeof(uint16_t));
 
@@ -237,7 +238,7 @@ class RandomAccessStackDominatorNode
  public:
   void SetDominator(Derived* dominator);
   void SetAsDominatorRoot();
-  Derived* GetDominator() { return nxt_; }
+  Derived* GetDominator() const { return nxt_; }
 
   // Returns the lowest common dominator of {this} and {other}.
   Derived* GetCommonDominator(
@@ -276,8 +277,6 @@ class Block : public RandomAccessStackDominatorNode<Block> {
   bool IsLoop() const { return kind_ == Kind::kLoopHeader; }
   bool IsMerge() const { return kind_ == Kind::kMerge; }
   bool IsBranchTarget() const { return kind_ == Kind::kBranchTarget; }
-  bool IsHandler() const { return false; }
-  bool IsSwitchCase() const { return false; }
 
   Kind kind() const { return kind_; }
   void SetKind(Kind kind) { kind_ = kind; }
@@ -386,6 +385,7 @@ class Block : public RandomAccessStackDominatorNode<Block> {
     return nullptr;
   }
 
+  bool IsComplete() const { return end_.valid(); }
   OpIndex begin() const {
     DCHECK(begin_.valid());
     return begin_;
@@ -395,7 +395,6 @@ class Block : public RandomAccessStackDominatorNode<Block> {
     return end_;
   }
 
-  // Might return nullptr if the first operation is invalid.
   const Operation& FirstOperation(const Graph& graph) const;
   const Operation& LastOperation(const Graph& graph) const;
 
@@ -403,9 +402,10 @@ class Block : public RandomAccessStackDominatorNode<Block> {
     switch (LastOperation(graph).opcode) {
       case Opcode::kBranch:
       case Opcode::kSwitch:
-      case Opcode::kCallAndCatchException:
+      case Opcode::kCheckException:
         return true;
       default:
+        DCHECK_LE(SuccessorBlocks(*this, graph).size(), 1);
         return false;
     }
   }
@@ -423,8 +423,30 @@ class Block : public RandomAccessStackDominatorNode<Block> {
 
   explicit Block(Kind kind) : kind_(kind) {}
 
-  uint32_t& custom_data() { return custom_data_; }
-  const uint32_t& custom_data() const { return custom_data_; }
+  enum class CustomDataKind {
+    kUnset,  // No custom data has been set for this block.
+    kPhiInputIndex,
+    kDeferredInSchedule,
+  };
+
+  void set_custom_data(uint32_t data, CustomDataKind kind_for_debug_check) {
+    custom_data_ = data;
+#ifdef DEBUG
+    custom_data_kind_for_debug_check_ = kind_for_debug_check;
+#endif
+  }
+
+  uint32_t get_custom_data(CustomDataKind kind_for_debug_check) const {
+    DCHECK_EQ(custom_data_kind_for_debug_check_, kind_for_debug_check);
+    return custom_data_;
+  }
+
+  void clear_custom_data() {
+    custom_data_ = 0;
+#ifdef DEBUG
+    custom_data_kind_for_debug_check_ = CustomDataKind::kUnset;
+#endif
+  }
 
  private:
   // AddPredecessor should never be called directly except from Assembler's
@@ -456,6 +478,7 @@ class Block : public RandomAccessStackDominatorNode<Block> {
   // after previous uses.
   uint32_t custom_data_ = 0;
 #ifdef DEBUG
+  CustomDataKind custom_data_kind_for_debug_check_ = CustomDataKind::kUnset;
   size_t graph_generation_ = 0;
 #endif
 };
@@ -470,6 +493,7 @@ class Graph {
       : operations_(graph_zone, initial_capacity),
         bound_blocks_(graph_zone),
         all_blocks_(graph_zone),
+        block_permutation_(graph_zone),
         graph_zone_(graph_zone),
         source_positions_(graph_zone),
         operation_origins_(graph_zone),
@@ -485,6 +509,7 @@ class Graph {
   void Reset() {
     operations_.Reset();
     bound_blocks_.clear();
+    block_permutation_.clear();
     source_positions_.Reset();
     operation_origins_.Reset();
     operation_types_.Reset();
@@ -514,8 +539,9 @@ class Graph {
     return *ptr;
   }
 
-  void MarkAsUnused(OpIndex i) { Get(i).saturated_use_count = 0; }
+  void MarkAsUnused(OpIndex i) { Get(i).saturated_use_count.SetToZero(); }
 
+  Block& StartBlock() { return Get(BlockIndex(0)); }
   const Block& StartBlock() const { return Get(BlockIndex(0)); }
 
   Block& Get(BlockIndex i) {
@@ -529,11 +555,19 @@ class Graph {
 
   OpIndex Index(const Operation& op) const { return operations_.Index(op); }
   BlockIndex BlockOf(OpIndex index) const {
-    auto it = std::upper_bound(
-        bound_blocks_.begin(), bound_blocks_.end(), index,
-        [](OpIndex value, const Block* b) { return value < b->begin_; });
+    ZoneVector<Block*>::const_iterator it;
+    if (block_permutation_.empty()) {
+      it = std::upper_bound(
+          bound_blocks_.begin(), bound_blocks_.end(), index,
+          [](OpIndex value, const Block* b) { return value < b->begin_; });
+    } else {
+      it = std::upper_bound(
+          block_permutation_.begin(), block_permutation_.end(), index,
+          [](OpIndex value, const Block* b) { return value < b->begin_; });
+    }
     DCHECK_NE(it, bound_blocks_.begin());
     --it;
+    DCHECK((*it)->Contains(index));
     return (*it)->index();
   }
 
@@ -559,13 +593,13 @@ class Graph {
     Op& op = Op::New(this, args...);
     IncrementInputUses(op);
 
-    if (op.Properties().is_required_when_unused) {
+    if (op.IsRequiredWhenUnused()) {
       // Once the graph is built, an operation with a `saturated_use_count` of 0
       // is guaranteed to be unused and can be removed. Thus, to avoid removing
       // operations that never have uses (such as Goto or Branch), we set the
-      // `saturated_use_count` of Operations that are `required_when_unused`
+      // `saturated_use_count` of Operations that are `IsRequiredWhenUnused()`
       // to 1.
-      op.saturated_use_count = 1;
+      op.saturated_use_count.SetToOne();
     }
 
     DCHECK_EQ(result, Index(op));
@@ -650,18 +684,26 @@ class Graph {
   uint32_t op_id_count() const {
     return (operations_.size() + (kSlotsPerId - 1)) / kSlotsPerId;
   }
+  uint32_t number_of_operations() const {
+    uint32_t number_of_operations = 0;
+    for ([[maybe_unused]] auto& op : AllOperations()) {
+      ++number_of_operations;
+    }
+    return number_of_operations;
+  }
   uint32_t op_id_capacity() const {
     return operations_.capacity() / kSlotsPerId;
   }
 
   class OpIndexIterator
-      : public base::iterator<std::bidirectional_iterator_tag, OpIndex> {
+      : public base::iterator<std::bidirectional_iterator_tag, OpIndex,
+                              std::ptrdiff_t, OpIndex*, OpIndex> {
    public:
     using value_type = OpIndex;
 
     explicit OpIndexIterator(OpIndex index, const Graph* graph)
         : index_(index), graph_(graph) {}
-    value_type& operator*() { return index_; }
+    value_type operator*() const { return index_; }
     OpIndexIterator& operator++() {
       index_ = graph_->operations_.Next(index_);
       return *this;
@@ -772,6 +814,7 @@ class Graph {
             base::DerefPtrIterator<const Block>(bound_blocks_.data() +
                                                 bound_blocks_.size())};
   }
+  const ZoneVector<Block*>& blocks_vector() const { return bound_blocks_; }
 
   bool IsLoopBackedge(const GotoOp& op) const {
     DCHECK(op.destination->IsBound());
@@ -810,6 +853,19 @@ class Graph {
   }
 #endif  // DEBUG
 
+  void ReorderBlocks(base::Vector<uint32_t> permutation) {
+    DCHECK_EQ(permutation.size(), bound_blocks_.size());
+    block_permutation_.resize(bound_blocks_.size());
+    std::swap(block_permutation_, bound_blocks_);
+
+    for (size_t i = 0; i < permutation.size(); ++i) {
+      DCHECK_LE(0, permutation[i]);
+      DCHECK_LT(permutation[i], block_permutation_.size());
+      bound_blocks_[i] = block_permutation_[permutation[i]];
+      bound_blocks_[i]->index_ = BlockIndex(static_cast<uint32_t>(i));
+    }
+  }
+
   Graph& GetOrCreateCompanion() {
     if (!companion_) {
       companion_ = std::make_unique<Graph>(graph_zone_, operations_.size());
@@ -827,6 +883,7 @@ class Graph {
     std::swap(operations_, companion.operations_);
     std::swap(bound_blocks_, companion.bound_blocks_);
     std::swap(all_blocks_, companion.all_blocks_);
+    std::swap(block_permutation_, companion.block_permutation_);
     std::swap(next_block_, companion.next_block_);
     std::swap(graph_zone_, companion.graph_zone_);
     std::swap(source_positions_, companion.source_positions_);
@@ -855,26 +912,14 @@ class Graph {
   template <class Op>
   void IncrementInputUses(const Op& op) {
     for (OpIndex input : op.inputs()) {
-      Operation& input_op = Get(input);
-      auto uses = input_op.saturated_use_count;
-      if (V8_LIKELY(uses != Operation::kUnknownUseCount)) {
-        input_op.saturated_use_count = uses + 1;
-      }
+      Get(input).saturated_use_count.Incr();
     }
   }
 
   template <class Op>
   void DecrementInputUses(const Op& op) {
     for (OpIndex input : op.inputs()) {
-      Operation& input_op = Get(input);
-      auto uses = input_op.saturated_use_count;
-      DCHECK_GT(uses, 0);
-      // Do not decrement if we already reached the threshold. In this case, we
-      // don't know the exact number of uses anymore and shouldn't assume
-      // anything.
-      if (V8_LIKELY(uses != Operation::kUnknownUseCount)) {
-        input_op.saturated_use_count = uses - 1;
-      }
+      Get(input).saturated_use_count.Decr();
     }
   }
 
@@ -898,6 +943,10 @@ class Graph {
   OperationBuffer operations_;
   ZoneVector<Block*> bound_blocks_;
   ZoneVector<Block*> all_blocks_;
+  // When `ReorderBlocks` is called, `block_permutation_` contains the original
+  // order of blocks in order to provide a proper OpIndex->Block mapping for
+  // `BlockOf`. In non-reordered graphs, this vector is empty.
+  ZoneVector<Block*> block_permutation_;
   size_t next_block_ = 0;
   Zone* graph_zone_;
   GrowingSidetable<SourcePosition> source_positions_;
@@ -968,7 +1017,12 @@ V8_INLINE bool Block::HasPhis(const Graph& graph) const {
 
 struct PrintAsBlockHeader {
   const Block& block;
-  BlockIndex block_id = block.index();
+  BlockIndex block_id;
+
+  explicit PrintAsBlockHeader(const Block& block)
+      : block(block), block_id(block.index()) {}
+  PrintAsBlockHeader(const Block& block, BlockIndex block_id)
+      : block(block), block_id(block_id) {}
 };
 std::ostream& operator<<(std::ostream& os, PrintAsBlockHeader block);
 std::ostream& operator<<(std::ostream& os, const Graph& graph);
diff --git a/deps/v8/src/compiler/turboshaft/index.h b/deps/v8/src/compiler/turboshaft/index.h
index 1c73a2cbee2b4b..056a74240b32c9 100644
--- a/deps/v8/src/compiler/turboshaft/index.h
+++ b/deps/v8/src/compiler/turboshaft/index.h
@@ -12,13 +12,24 @@
 #include "src/codegen/tnode.h"
 #include "src/compiler/turboshaft/fast-hash.h"
 #include "src/compiler/turboshaft/representations.h"
+#include "src/objects/heap-number.h"
+#include "src/objects/oddball.h"
+#include "src/objects/string.h"
 
 namespace v8::internal::compiler::turboshaft {
+namespace detail {
+template <typename T>
+struct lazy_false : std::false_type {};
+}  // namespace detail
+
 // Operations are stored in possibly muliple sequential storage slots.
 using OperationStorageSlot = std::aligned_storage_t<8, 8>;
 // Operations occupy at least 2 slots, therefore we assign one id per two slots.
 constexpr size_t kSlotsPerId = 2;
 
+template <typename T, typename C>
+class ConstOrV;
+
 // `OpIndex` is an offset from the beginning of the operations buffer.
 // Compared to `Operation*`, it is more memory efficient (32bit) and stable when
 // the operations buffer is re-allocated.
@@ -28,6 +39,12 @@ class OpIndex {
     DCHECK_EQ(offset % sizeof(OperationStorageSlot), 0);
   }
   constexpr OpIndex() : offset_(std::numeric_limits<uint32_t>::max()) {}
+  template <typename T, typename C>
+  OpIndex(const ConstOrV<T, C>&) {  // NOLINT(runtime/explicit)
+    static_assert(detail::lazy_false<T>::value,
+                  "Cannot initialize OpIndex from ConstOrV<>. Did you forget "
+                  "to resolve() it in the assembler?");
+  }
 
   uint32_t id() const {
     // Operations are stored at an offset that's a multiple of
@@ -38,6 +55,13 @@ class OpIndex {
     DCHECK_EQ(offset_ % sizeof(OperationStorageSlot), 0);
     return offset_ / sizeof(OperationStorageSlot) / kSlotsPerId;
   }
+  uint32_t hash() const {
+    // It can be useful to hash OpIndex::Invalid(), so we have this `hash`
+    // function, which returns the id, but without DCHECKing that Invalid is
+    // valid.
+    DCHECK_IMPLIES(valid(), offset_ % sizeof(OperationStorageSlot) == 0);
+    return offset_ / sizeof(OperationStorageSlot) / kSlotsPerId;
+  }
   uint32_t offset() const {
     DCHECK_EQ(offset_ % sizeof(OperationStorageSlot), 0);
     return offset_;
@@ -87,7 +111,7 @@ struct Any {};
 template <size_t Bits>
 struct WordWithBits : public Any {
   static constexpr int bits = Bits;
-  static_assert(Bits == 32 || Bits == 64);
+  static_assert(Bits == 32 || Bits == 64 || Bits == 128);
 };
 
 using Word32 = WordWithBits<32>;
@@ -103,6 +127,8 @@ struct FloatWithBits : public Any {  // FloatAny {
 using Float32 = FloatWithBits<32>;
 using Float64 = FloatWithBits<64>;
 
+using Simd128 = WordWithBits<128>;
+
 // TODO(nicohartmann@): Replace all uses of `V<Tagged>` by `V<Object>`.
 using Tagged = Object;
 
@@ -165,8 +191,7 @@ struct v_traits<Word64> {
 
   template <typename U>
   struct implicitly_convertible_to
-      : std::bool_constant<std::is_base_of_v<U, Word64> ||
-                           std::is_same_v<U, Word32>> {};
+      : std::bool_constant<std::is_base_of_v<U, Word64>> {};
 };
 
 template <>
@@ -197,6 +222,21 @@ struct v_traits<Float64> {
       : std::bool_constant<std::is_base_of_v<U, Float64>> {};
 };
 
+template <>
+struct v_traits<Simd128> {
+  static constexpr bool is_abstract_tag = true;
+  static constexpr RegisterRepresentation rep =
+      RegisterRepresentation::Simd128();
+  using constexpr_type = uint8_t[kSimd128Size];
+  static constexpr bool allows_representation(RegisterRepresentation rep) {
+    return rep == RegisterRepresentation::Simd128();
+  }
+
+  template <typename U>
+  struct implicitly_convertible_to
+      : std::bool_constant<std::is_base_of_v<U, Simd128>> {};
+};
+
 template <typename T>
 struct v_traits<T, typename std::enable_if_t<std::is_base_of_v<Object, T>>> {
   static constexpr bool is_abstract_tag = false;
@@ -212,22 +252,27 @@ struct v_traits<T, typename std::enable_if_t<std::is_base_of_v<Object, T>>> {
 };
 
 template <typename T1, typename T2>
-struct v_traits<UnionT<T1, T2>,
-                typename std::enable_if_t<std::is_base_of_v<Object, T1> &&
-                                          std::is_base_of_v<Object, T2>>> {
+struct v_traits<UnionT<T1, T2>> {
+  static_assert(!v_traits<T1>::is_abstract_tag);
+  static_assert(!v_traits<T2>::is_abstract_tag);
   static constexpr bool is_abstract_tag = false;
-  static constexpr auto rep = RegisterRepresentation::Tagged();
-  static constexpr bool allows_representation(RegisterRepresentation rep) {
-    return rep == RegisterRepresentation::Tagged();
+  static_assert(v_traits<T1>::rep == v_traits<T2>::rep);
+  static constexpr auto rep = v_traits<T1>::rep;
+  static constexpr bool allows_representation(RegisterRepresentation r) {
+    return r == rep;
   }
 
   template <typename U>
   struct implicitly_convertible_to
-      : std::bool_constant<
-            (std::is_base_of_v<U, T1> && std::is_base_of_v<U, T2>) ||
-            std::is_same_v<U, Any> || is_subtype<UnionT<T1, T2>, U>::value> {};
+      : std::bool_constant<(
+            v_traits<T1>::template implicitly_convertible_to<U>::value ||
+            v_traits<T2>::template implicitly_convertible_to<U>::value)> {};
 };
 
+using BooleanOrNullOrUndefined = UnionT<UnionT<Boolean, Null>, Undefined>;
+using NumberOrString = UnionT<Number, String>;
+using PlainPrimitive = UnionT<NumberOrString, BooleanOrNullOrUndefined>;
+
 // V<> represents an SSA-value that is parameterized with the type of the value.
 // Types from the `Object` hierarchy can be provided as well as the abstract
 // representation classes (`Word32`, ...) defined above.
@@ -255,6 +300,7 @@ class V : public OpIndex {
   static V<T> Cast(V<U> index) {
     return V<T>(OpIndex{index});
   }
+  static V<T> Cast(OpIndex index) { return V<T>(index); }
 
   static constexpr bool allows_representation(RegisterRepresentation rep) {
     return v_traits<T>::allows_representation(rep);
@@ -315,10 +361,10 @@ class ConstOrV {
 
 template <>
 struct fast_hash<OpIndex> {
-  V8_INLINE size_t operator()(OpIndex op) const { return op.id(); }
+  V8_INLINE size_t operator()(OpIndex op) const { return op.hash(); }
 };
 
-V8_INLINE size_t hash_value(OpIndex op) { return base::hash_value(op.id()); }
+V8_INLINE size_t hash_value(OpIndex op) { return base::hash_value(op.hash()); }
 
 // `BlockIndex` is the index of a bound block.
 // A dominating block always has a smaller index.
diff --git a/deps/v8/src/compiler/turboshaft/instruction-selection-phase.cc b/deps/v8/src/compiler/turboshaft/instruction-selection-phase.cc
new file mode 100644
index 00000000000000..336c4225fdd768
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/instruction-selection-phase.cc
@@ -0,0 +1,399 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/instruction-selection-phase.h"
+
+#include "src/codegen/optimized-compilation-info.h"
+#include "src/compiler/backend/instruction-selector-impl.h"
+#include "src/compiler/backend/instruction-selector.h"
+#include "src/compiler/graph-visualizer.h"
+#include "src/compiler/pipeline.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/sidetable.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+// Compute the special reverse-post-order block ordering, which is essentially
+// a RPO of the graph where loop bodies are contiguous. Properties:
+// 1. If block A is a predecessor of B, then A appears before B in the order,
+//    unless B is a loop header and A is in the loop headed at B
+//    (i.e. A -> B is a backedge).
+// => If block A dominates block B, then A appears before B in the order.
+// => If block A is a loop header, A appears before all blocks in the loop
+//    headed at A.
+// 2. All loops are contiguous in the order (i.e. no intervening blocks that
+//    do not belong to the loop.)
+// Note a simple RPO traversal satisfies (1) but not (2).
+// TODO(nicohartmann@): Investigate faster and simpler alternatives.
+class TurboshaftSpecialRPONumberer {
+ public:
+  // Numbering for BasicBlock::rpo_number for this block traversal:
+  static const int kBlockOnStack = -2;
+  static const int kBlockVisited1 = -3;
+  static const int kBlockVisited2 = -4;
+  static const int kBlockUnvisited = -1;
+
+  using Backedge = std::pair<const Block*, size_t>;
+
+  struct SpecialRPOStackFrame {
+    const Block* block = nullptr;
+    size_t index = 0;
+    base::SmallVector<Block*, 4> successors;
+
+    SpecialRPOStackFrame(const Block* block, size_t index,
+                         base::SmallVector<Block*, 4> successors)
+        : block(block), index(index), successors(std::move(successors)) {}
+  };
+
+  struct LoopInfo {
+    const Block* header;
+    base::SmallVector<Block const*, 2> outgoing;
+    BitVector* members;
+    LoopInfo* prev;
+    const Block* end;
+    const Block* start;
+
+    void AddOutgoing(Zone* zone, const Block* block) {
+      outgoing.push_back(block);
+    }
+  };
+
+  struct BlockData {
+    static constexpr size_t kNoLoopNumber = std::numeric_limits<size_t>::max();
+    int32_t rpo_number = kBlockUnvisited;
+    size_t loop_number = kNoLoopNumber;
+    const Block* rpo_next = nullptr;
+  };
+
+  TurboshaftSpecialRPONumberer(const Graph& graph, Zone* zone)
+      : graph_(&graph), block_data_(graph.block_count(), zone), zone_(zone) {}
+
+  ZoneVector<uint32_t> ComputeSpecialRPO() {
+    std::stack<SpecialRPOStackFrame> stack;
+    std::vector<Backedge> backedges;
+    size_t num_loops = 0;
+
+    auto Push = [&](const Block* block) {
+      auto succs = SuccessorBlocks(*block, *graph_);
+      stack.emplace(block, 0, succs);
+      set_rpo_number(block, kBlockOnStack);
+    };
+
+    const Block* entry = &graph_->StartBlock();
+
+    // Find correct insertion point within existing order.
+    const Block* order = nullptr;
+
+    Push(&graph_->StartBlock());
+
+    while (!stack.empty()) {
+      SpecialRPOStackFrame& frame = stack.top();
+
+      if (frame.index < frame.successors.size()) {
+        // Process the next successor.
+        const Block* succ = frame.successors[frame.index++];
+        if (rpo_number(succ) == kBlockVisited1) continue;
+        if (rpo_number(succ) == kBlockOnStack) {
+          // The successor is on the stack, so this is a backedge (cycle).
+          DCHECK_EQ(frame.index - 1, 0);
+          backedges.emplace_back(frame.block, frame.index - 1);
+          // Assign a new loop number to the header.
+          DCHECK(!has_loop_number(succ));
+          set_loop_number(succ, num_loops++);
+        } else {
+          // Push the successor onto the stack.
+          DCHECK_EQ(rpo_number(succ), kBlockUnvisited);
+          Push(succ);
+        }
+      } else {
+        // Finished with all successors; pop the stack and add the block.
+        order = PushFront(order, frame.block);
+        set_rpo_number(frame.block, kBlockVisited1);
+        stack.pop();
+      }
+    }
+
+    // If no loops were encountered, then the order we computed was correct.
+    if (num_loops == 0) return ComputeBlockPermutation(entry);
+
+    // Otherwise, compute the loop information from the backedges in order
+    // to perform a traversal that groups loop bodies together.
+    ComputeLoopInfo(num_loops, backedges);
+
+    // Initialize the "loop stack". We assume that the entry cannot be a loop
+    // header.
+    CHECK(!has_loop_number(entry));
+    LoopInfo* loop = nullptr;
+    order = nullptr;
+
+    // Perform an iterative post-order traversal, visiting loop bodies before
+    // edges that lead out of loops. Visits each block once, but linking loop
+    // sections together is linear in the loop size, so overall is
+    // O(|B| + max(loop_depth) * max(|loop|))
+    DCHECK(stack.empty());
+    Push(&graph_->StartBlock());
+    while (!stack.empty()) {
+      SpecialRPOStackFrame& frame = stack.top();
+      const Block* block = frame.block;
+      const Block* succ = nullptr;
+
+      if (frame.index < frame.successors.size()) {
+        // Process the next normal successor.
+        succ = frame.successors[frame.index++];
+      } else if (has_loop_number(block)) {
+        // Process additional outgoing edges from the loop header.
+        if (rpo_number(block) == kBlockOnStack) {
+          // Finish the loop body the first time the header is left on the
+          // stack.
+          DCHECK_NOT_NULL(loop);
+          DCHECK_EQ(loop->header, block);
+          loop->start = PushFront(order, block);
+          order = loop->end;
+          set_rpo_number(block, kBlockVisited2);
+          // Pop the loop stack and continue visiting outgoing edges within
+          // the context of the outer loop, if any.
+          loop = loop->prev;
+          // We leave the loop header on the stack; the rest of this iteration
+          // and later iterations will go through its outgoing edges list.
+        }
+
+        // Use the next outgoing edge if there are any.
+        size_t outgoing_index = frame.index - frame.successors.size();
+        LoopInfo* info = &loops_[loop_number(block)];
+        DCHECK_NE(loop, info);
+        if (block != entry && outgoing_index < info->outgoing.size()) {
+          succ = info->outgoing[outgoing_index];
+          ++frame.index;
+        }
+      }
+
+      if (succ != nullptr) {
+        // Process the next successor.
+        if (rpo_number(succ) == kBlockOnStack) continue;
+        if (rpo_number(succ) == kBlockVisited2) continue;
+        DCHECK_EQ(kBlockVisited1, rpo_number(succ));
+        if (loop != nullptr && !loop->members->Contains(succ->index().id())) {
+          // The successor is not in the current loop or any nested loop.
+          // Add it to the outgoing edges of this loop and visit it later.
+          loop->AddOutgoing(zone_, succ);
+        } else {
+          // Push the successor onto the stack.
+          Push(succ);
+          if (has_loop_number(succ)) {
+            // Push the inner loop onto the loop stack.
+            DCHECK_LT(loop_number(succ), num_loops);
+            LoopInfo* next = &loops_[loop_number(succ)];
+            next->end = order;
+            next->prev = loop;
+            loop = next;
+          }
+        }
+      } else {
+        // Finish with all successors of the current block.
+        if (has_loop_number(block)) {
+          // If we are going to pop a loop header, then add its entire body.
+          LoopInfo* info = &loops_[loop_number(block)];
+          for (const Block* b = info->start; true;
+               b = block_data_[b->index()].rpo_next) {
+            if (block_data_[b->index()].rpo_next == info->end) {
+              PushFront(order, b);
+              info->end = order;
+              break;
+            }
+          }
+          order = info->start;
+        } else {
+          // Pop a single node off the stack and add it to the order.
+          order = PushFront(order, block);
+          set_rpo_number(block, kBlockVisited2);
+        }
+        stack.pop();
+      }
+    }
+
+    return ComputeBlockPermutation(entry);
+  }
+
+ private:
+  // Computes loop membership from the backedges of the control flow graph.
+  void ComputeLoopInfo(size_t num_loops, std::vector<Backedge>& backedges) {
+    std::stack<const Block*> stack;
+
+    // Extend loop information vector.
+    loops_.resize(num_loops, LoopInfo{});
+
+    // Compute loop membership starting from backedges.
+    // O(max(loop_depth) * |loop|)
+    for (auto [backedge, header_index] : backedges) {
+      const Block* header = SuccessorBlocks(*backedge, *graph_)[header_index];
+      DCHECK(header->IsLoop());
+      size_t loop_num = loop_number(header);
+      DCHECK_NULL(loops_[loop_num].header);
+      loops_[loop_num].header = header;
+      loops_[loop_num].members =
+          zone_->New<BitVector>(graph_->block_count(), zone_);
+
+      if (backedge != header) {
+        // As long as the header doesn't have a backedge to itself,
+        // Push the member onto the queue and process its predecessors.
+        DCHECK(!loops_[loop_num].members->Contains(backedge->index().id()));
+        loops_[loop_num].members->Add(backedge->index().id());
+        stack.push(backedge);
+      }
+
+      // Propagate loop membership backwards. All predecessors of M up to the
+      // loop header H are members of the loop too. O(|blocks between M and H|).
+      while (!stack.empty()) {
+        const Block* block = stack.top();
+        stack.pop();
+        for (const Block* pred = block->LastPredecessor(); pred;
+             pred = pred->NeighboringPredecessor()) {
+          if (pred != header) {
+            if (!loops_[loop_num].members->Contains(pred->index().id())) {
+              loops_[loop_num].members->Add(pred->index().id());
+              stack.push(pred);
+            }
+          }
+        }
+      }
+    }
+  }
+
+  ZoneVector<uint32_t> ComputeBlockPermutation(const Block* entry) {
+    ZoneVector<uint32_t> result(graph_->block_count(), zone_);
+    size_t i = 0;
+    for (const Block* b = entry; b; b = block_data_[b->index()].rpo_next) {
+      result[i++] = b->index().id();
+    }
+    DCHECK_EQ(i, graph_->block_count());
+    return result;
+  }
+
+  int32_t rpo_number(const Block* block) const {
+    return block_data_[block->index()].rpo_number;
+  }
+
+  void set_rpo_number(const Block* block, int32_t rpo_number) {
+    block_data_[block->index()].rpo_number = rpo_number;
+  }
+
+  bool has_loop_number(const Block* block) const {
+    return block_data_[block->index()].loop_number != BlockData::kNoLoopNumber;
+  }
+
+  size_t loop_number(const Block* block) const {
+    DCHECK(has_loop_number(block));
+    return block_data_[block->index()].loop_number;
+  }
+
+  void set_loop_number(const Block* block, size_t loop_number) {
+    block_data_[block->index()].loop_number = loop_number;
+  }
+
+  const Block* PushFront(const Block* head, const Block* block) {
+    block_data_[block->index()].rpo_next = head;
+    return block;
+  }
+
+  const Graph* graph_;
+  FixedBlockSidetable<BlockData> block_data_;
+  std::vector<LoopInfo> loops_;
+  Zone* zone_;
+};
+
+base::Optional<BailoutReason> InstructionSelectionPhase::Run(
+    Zone* temp_zone, const CallDescriptor* call_descriptor, Linkage* linkage,
+    CodeTracer* code_tracer) {
+  PipelineData* data = &PipelineData::Get();
+  Graph& graph = PipelineData::Get().graph();
+
+  // Compute special RPO order....
+  TurboshaftSpecialRPONumberer numberer(graph, temp_zone);
+  auto schedule = numberer.ComputeSpecialRPO();
+  graph.ReorderBlocks(base::VectorOf(schedule));
+
+  // Determine deferred blocks.
+  graph.StartBlock().set_custom_data(
+      0, Block::CustomDataKind::kDeferredInSchedule);
+  for (Block& block : graph.blocks()) {
+    const Block* predecessor = block.LastPredecessor();
+    if (predecessor == nullptr) {
+      continue;
+    } else if (block.IsLoop()) {
+      // We only consider the forward edge for loop headers.
+      predecessor = predecessor->NeighboringPredecessor();
+      DCHECK_NOT_NULL(predecessor);
+      DCHECK_EQ(predecessor->NeighboringPredecessor(), nullptr);
+      block.set_custom_data(predecessor->get_custom_data(
+                                Block::CustomDataKind::kDeferredInSchedule),
+                            Block::CustomDataKind::kDeferredInSchedule);
+    } else if (predecessor->NeighboringPredecessor() == nullptr) {
+      // This block has only a single predecessor. Due to edge-split form, those
+      // are the only blocks that can be the target of a branch-like op which
+      // might potentially provide a BranchHint to defer this block.
+      const bool is_deferred =
+          predecessor->get_custom_data(
+              Block::CustomDataKind::kDeferredInSchedule) ||
+          IsUnlikelySuccessor(predecessor, &block, graph);
+      block.set_custom_data(is_deferred,
+                            Block::CustomDataKind::kDeferredInSchedule);
+    } else {
+      block.set_custom_data(true, Block::CustomDataKind::kDeferredInSchedule);
+      for (; predecessor; predecessor = predecessor->NeighboringPredecessor()) {
+        // If there is a single predecessor that is not deferred, then block is
+        // also not deferred.
+        if (!predecessor->get_custom_data(
+                Block::CustomDataKind::kDeferredInSchedule)) {
+          block.set_custom_data(false,
+                                Block::CustomDataKind::kDeferredInSchedule);
+          break;
+        }
+      }
+    }
+  }
+
+  // Print graph once before instruction selection.
+  turboshaft::PrintTurboshaftGraph(temp_zone, code_tracer,
+                                   "before instruction selection");
+
+  // Initialize an instruction sequence.
+  data->InitializeInstructionSequence(call_descriptor);
+
+  // Run the actual instruction selection.
+  InstructionSelector selector = InstructionSelector::ForTurboshaft(
+      temp_zone, graph.op_id_count(), linkage, data->sequence(), &graph,
+      data->frame(),
+      data->info()->switch_jump_table()
+          ? InstructionSelector::kEnableSwitchJumpTable
+          : InstructionSelector::kDisableSwitchJumpTable,
+      &data->info()->tick_counter(), data->broker(),
+      data->address_of_max_unoptimized_frame_height(),
+      data->address_of_max_pushed_argument_count(),
+      data->info()->source_positions()
+          ? InstructionSelector::kAllSourcePositions
+          : InstructionSelector::kCallSourcePositions,
+      InstructionSelector::SupportedFeatures(),
+      v8_flags.turbo_instruction_scheduling
+          ? InstructionSelector::kEnableScheduling
+          : InstructionSelector::kDisableScheduling,
+      data->assembler_options().enable_root_relative_access
+          ? InstructionSelector::kEnableRootsRelativeAddressing
+          : InstructionSelector::kDisableRootsRelativeAddressing,
+      data->info()->trace_turbo_json()
+          ? InstructionSelector::kEnableTraceTurboJson
+          : InstructionSelector::kDisableTraceTurboJson);
+  if (base::Optional<BailoutReason> bailout = selector.SelectInstructions()) {
+    return bailout;
+  }
+  if (data->info()->trace_turbo_json()) {
+    TurboJsonFile json_of(data->info(), std::ios_base::app);
+    json_of << "{\"name\":\"" << phase_name() << "\",\"type\":\"instructions\""
+            << InstructionRangesAsJSON{data->sequence(),
+                                       &selector.instr_origins()}
+            << "},\n";
+  }
+  return base::nullopt;
+}
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/instruction-selection-phase.h b/deps/v8/src/compiler/turboshaft/instruction-selection-phase.h
new file mode 100644
index 00000000000000..a01957a5a5daa6
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/instruction-selection-phase.h
@@ -0,0 +1,28 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_INSTRUCTION_SELECTION_PHASE_H_
+#define V8_COMPILER_TURBOSHAFT_INSTRUCTION_SELECTION_PHASE_H_
+
+#include "src/compiler/turboshaft/phase.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+struct InstructionSelectionPhase {
+  DECL_TURBOSHAFT_PHASE_CONSTANTS(InstructionSelection)
+
+  base::Optional<BailoutReason> Run(Zone* temp_zone,
+                                    const CallDescriptor* call_descriptor,
+                                    Linkage* linkage, CodeTracer* code_tracer);
+};
+
+// Disable printing a default turboshaft graph as this phase produces an
+// instruction seqeuence rather than a new graph.
+template <>
+struct produces_printable_graph<InstructionSelectionPhase>
+    : public std::false_type {};
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_INSTRUCTION_SELECTION_PHASE_H_
diff --git a/deps/v8/src/compiler/turboshaft/int64-lowering-phase.cc b/deps/v8/src/compiler/turboshaft/int64-lowering-phase.cc
new file mode 100644
index 00000000000000..73f136189fb17a
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/int64-lowering-phase.cc
@@ -0,0 +1,25 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/int64-lowering-phase.h"
+
+#if V8_TARGET_ARCH_32_BIT
+#include "src/compiler/turboshaft/int64-lowering-reducer.h"
+#include "src/compiler/turboshaft/optimization-phase.h"
+#include "src/compiler/turboshaft/variable-reducer.h"
+#endif
+
+namespace v8::internal::compiler::turboshaft {
+
+void Int64LoweringPhase::Run(Zone* temp_zone) {
+#if V8_TARGET_ARCH_32_BIT
+  turboshaft::OptimizationPhase<
+      turboshaft::Int64LoweringReducer, turboshaft::VariableReducer,
+      turboshaft::RequiredOptimizationReducer>::Run(temp_zone);
+#else
+  UNREACHABLE();
+#endif
+}
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/late-optimization-phase.h b/deps/v8/src/compiler/turboshaft/int64-lowering-phase.h
similarity index 50%
rename from deps/v8/src/compiler/turboshaft/late-optimization-phase.h
rename to deps/v8/src/compiler/turboshaft/int64-lowering-phase.h
index a2e0fb2085fb97..c873cb7cb28e2c 100644
--- a/deps/v8/src/compiler/turboshaft/late-optimization-phase.h
+++ b/deps/v8/src/compiler/turboshaft/int64-lowering-phase.h
@@ -2,19 +2,19 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#ifndef V8_COMPILER_TURBOSHAFT_LATE_OPTIMIZATION_PHASE_H_
-#define V8_COMPILER_TURBOSHAFT_LATE_OPTIMIZATION_PHASE_H_
+#ifndef V8_COMPILER_TURBOSHAFT_INT64_LOWERING_PHASE_H_
+#define V8_COMPILER_TURBOSHAFT_INT64_LOWERING_PHASE_H_
 
 #include "src/compiler/turboshaft/phase.h"
 
 namespace v8::internal::compiler::turboshaft {
 
-struct LateOptimizationPhase {
-  DECL_TURBOSHAFT_PHASE_CONSTANTS(LateOptimization)
+struct Int64LoweringPhase {
+  DECL_TURBOSHAFT_PHASE_CONSTANTS(Int64Lowering)
 
-  void Run(PipelineData* data, Zone* temp_zone);
+  void Run(Zone* temp_zone);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
 
-#endif  // V8_COMPILER_TURBOSHAFT_LATE_OPTIMIZATION_PHASE_H_
+#endif  // V8_COMPILER_TURBOSHAFT_INT64_LOWERING_PHASE_H_
diff --git a/deps/v8/src/compiler/turboshaft/int64-lowering-reducer.h b/deps/v8/src/compiler/turboshaft/int64-lowering-reducer.h
new file mode 100644
index 00000000000000..da82d29d29a1a6
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/int64-lowering-reducer.h
@@ -0,0 +1,764 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#ifndef V8_COMPILER_TURBOSHAFT_INT64_LOWERING_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_INT64_LOWERING_REDUCER_H_
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/wasm-compiler.h"
+#include "src/compiler/wasm-graph-assembler.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+// This reducer is run on 32 bit platforms to lower unsupported 64 bit integer
+// operations to supported 32 bit operations.
+template <class Next>
+class Int64LoweringReducer : public Next {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  Int64LoweringReducer() { InitializeIndexMaps(); }
+
+  OpIndex REDUCE(WordBinop)(OpIndex left, OpIndex right, WordBinopOp::Kind kind,
+                            WordRepresentation rep) {
+    if (rep == WordRepresentation::Word64()) {
+      switch (kind) {
+        case WordBinopOp::Kind::kAdd:
+          return ReducePairBinOp(left, right, Word32PairBinopOp::Kind::kAdd);
+        case WordBinopOp::Kind::kSub:
+          return ReducePairBinOp(left, right, Word32PairBinopOp::Kind::kSub);
+        case WordBinopOp::Kind::kMul:
+          return ReducePairBinOp(left, right, Word32PairBinopOp::Kind::kMul);
+        case WordBinopOp::Kind::kBitwiseAnd:
+          return ReduceBitwiseAnd(left, right);
+        case WordBinopOp::Kind::kBitwiseOr:
+          return ReduceBitwiseOr(left, right);
+        case WordBinopOp::Kind::kBitwiseXor:
+          return ReduceBitwiseXor(left, right);
+        default:
+          break;
+      }
+    }
+    return Next::ReduceWordBinop(left, right, kind, rep);
+  }
+
+  OpIndex REDUCE(Shift)(OpIndex left, OpIndex right, ShiftOp::Kind kind,
+                        WordRepresentation rep) {
+    if (rep == WordRepresentation::Word64()) {
+      switch (kind) {
+        case ShiftOp::Kind::kShiftLeft:
+          return ReducePairShiftOp(left, right,
+                                   Word32PairBinopOp::Kind::kShiftLeft);
+        case ShiftOp::Kind::kShiftRightArithmetic:
+          return ReducePairShiftOp(
+              left, right, Word32PairBinopOp::Kind::kShiftRightArithmetic);
+        case ShiftOp::Kind::kShiftRightLogical:
+          return ReducePairShiftOp(left, right,
+                                   Word32PairBinopOp::Kind::kShiftRightLogical);
+        case ShiftOp::Kind::kRotateRight:
+          return ReduceRotateRight(left, right);
+        default:
+          break;
+      }
+    }
+    return Next::ReduceShift(left, right, kind, rep);
+  }
+
+  OpIndex REDUCE(Equal)(OpIndex left, OpIndex right,
+                        RegisterRepresentation rep) {
+    if (rep != WordRepresentation::Word64()) {
+      return Next::ReduceEqual(left, right, rep);
+    }
+
+    auto [left_low, left_high] = Unpack(left);
+    auto [right_low, right_high] = Unpack(right);
+    // TODO(wasm): Use explicit comparisons and && here?
+    return __ Word32Equal(
+        __ Word32BitwiseOr(__ Word32BitwiseXor(left_low, right_low),
+                           __ Word32BitwiseXor(left_high, right_high)),
+        0);
+  }
+
+  OpIndex REDUCE(Comparison)(OpIndex left, OpIndex right,
+                             ComparisonOp::Kind kind,
+                             RegisterRepresentation rep) {
+    if (rep != WordRepresentation::Word64()) {
+      return Next::ReduceComparison(left, right, kind, rep);
+    }
+
+    auto [left_low, left_high] = Unpack(left);
+    auto [right_low, right_high] = Unpack(right);
+    V<Word32> high_comparison;
+    V<Word32> low_comparison;
+    switch (kind) {
+      case ComparisonOp::Kind::kSignedLessThan:
+        high_comparison = __ Int32LessThan(left_high, right_high);
+        low_comparison = __ Uint32LessThan(left_low, right_low);
+        break;
+      case ComparisonOp::Kind::kSignedLessThanOrEqual:
+        high_comparison = __ Int32LessThan(left_high, right_high);
+        low_comparison = __ Uint32LessThanOrEqual(left_low, right_low);
+        break;
+      case ComparisonOp::Kind::kUnsignedLessThan:
+        high_comparison = __ Uint32LessThan(left_high, right_high);
+        low_comparison = __ Uint32LessThan(left_low, right_low);
+        break;
+      case ComparisonOp::Kind::kUnsignedLessThanOrEqual:
+        high_comparison = __ Uint32LessThan(left_high, right_high);
+        low_comparison = __ Uint32LessThanOrEqual(left_low, right_low);
+        break;
+    }
+
+    return __ Word32BitwiseOr(
+        high_comparison,
+        __ Word32BitwiseAnd(__ Word32Equal(left_high, right_high),
+                            low_comparison));
+  }
+
+  OpIndex REDUCE(Call)(OpIndex callee, OpIndex frame_state,
+                       base::Vector<const OpIndex> arguments,
+                       const TSCallDescriptor* descriptor, OpEffects effects) {
+    const bool is_tail_call = false;
+    return ReduceCall(callee, frame_state, arguments, descriptor, effects,
+                      is_tail_call);
+  }
+
+  OpIndex REDUCE(TailCall)(OpIndex callee,
+                           base::Vector<const OpIndex> arguments,
+                           const TSCallDescriptor* descriptor) {
+    const bool is_tail_call = true;
+    OpIndex frame_state = OpIndex::Invalid();
+    return ReduceCall(callee, frame_state, arguments, descriptor,
+                      OpEffects().CanCallAnything(), is_tail_call);
+  }
+
+  OpIndex REDUCE(Constant)(ConstantOp::Kind kind, ConstantOp::Storage value) {
+    if (kind == ConstantOp::Kind::kWord64) {
+      uint32_t high = value.integral >> 32;
+      uint32_t low = value.integral & std::numeric_limits<uint32_t>::max();
+      return __ Tuple(__ Word32Constant(low), __ Word32Constant(high));
+    }
+    return Next::ReduceConstant(kind, value);
+  }
+
+  OpIndex REDUCE(Parameter)(int32_t parameter_index, RegisterRepresentation rep,
+                            const char* debug_name = "") {
+    DCHECK_LE(parameter_index, sig_->parameter_count());
+    int32_t new_index = param_index_map_[parameter_index];
+    if (rep == RegisterRepresentation::Word64()) {
+      rep = RegisterRepresentation::Word32();
+      return __ Tuple(Next::ReduceParameter(new_index, rep),
+                      Next::ReduceParameter(new_index + 1, rep));
+    }
+    return Next::ReduceParameter(new_index, rep, debug_name);
+  }
+
+  OpIndex REDUCE(Return)(OpIndex pop_count,
+                         base::Vector<const OpIndex> return_values) {
+    if (!returns_i64_) {
+      return Next::ReduceReturn(pop_count, return_values);
+    }
+    base::SmallVector<OpIndex, 8> lowered_values;
+    for (size_t i = 0; i < sig_->return_count(); ++i) {
+      if (sig_->GetReturn(i) == wasm::kWasmI64) {
+        auto [low, high] = Unpack(return_values[i]);
+        lowered_values.push_back(low);
+        lowered_values.push_back(high);
+      } else {
+        lowered_values.push_back(return_values[i]);
+      }
+    }
+    return Next::ReduceReturn(pop_count, base::VectorOf(lowered_values));
+  }
+
+  OpIndex REDUCE(WordUnary)(OpIndex input, WordUnaryOp::Kind kind,
+                            WordRepresentation rep) {
+    if (rep == RegisterRepresentation::Word64()) {
+      switch (kind) {
+        case WordUnaryOp::Kind::kCountLeadingZeros:
+          return ReduceClz(input);
+        case WordUnaryOp::Kind::kCountTrailingZeros:
+          return ReduceCtz(input);
+        case WordUnaryOp::Kind::kPopCount:
+          return ReducePopCount(input);
+        case WordUnaryOp::Kind::kSignExtend8:
+          return ReduceSignExtend(__ Word32SignExtend8(Unpack(input).first));
+        case WordUnaryOp::Kind::kSignExtend16:
+          return ReduceSignExtend(__ Word32SignExtend16(Unpack(input).first));
+        default:
+          UNIMPLEMENTED();
+      }
+    }
+    return Next::ReduceWordUnary(input, kind, rep);
+  }
+
+  OpIndex REDUCE(Change)(OpIndex input, ChangeOp::Kind kind,
+                         ChangeOp::Assumption assumption,
+                         RegisterRepresentation from,
+                         RegisterRepresentation to) {
+    auto word32 = RegisterRepresentation::Word32();
+    auto word64 = RegisterRepresentation::Word64();
+    auto float64 = RegisterRepresentation::Float64();
+    using Kind = ChangeOp::Kind;
+    if (from != word64 && to != word64) {
+      return Next::ReduceChange(input, kind, assumption, from, to);
+    }
+
+    if (from == word32 && to == word64) {
+      if (kind == Kind::kZeroExtend) {
+        return __ Tuple(input, __ Word32Constant(0));
+      }
+      if (kind == Kind::kSignExtend) {
+        return ReduceSignExtend(input);
+      }
+    }
+    if (from == float64 && to == word64) {
+      if (kind == Kind::kBitcast) {
+        return __ Tuple(__ Float64ExtractLowWord32(input),
+                        __ Float64ExtractHighWord32(input));
+      }
+    }
+    if (from == word64 && to == float64) {
+      if (kind == Kind::kBitcast) {
+        return __ BitcastWord32PairToFloat64(__ Projection(input, 1, word32),
+                                             __ Projection(input, 0, word32));
+      }
+    }
+    if (from == word64 && to == word32 && kind == Kind::kTruncate) {
+      return __ Projection(input, 0, word32);
+    }
+    UNIMPLEMENTED();
+  }
+
+  OpIndex REDUCE(Load)(OpIndex base_idx, OpIndex index, LoadOp::Kind kind,
+                       MemoryRepresentation loaded_rep,
+                       RegisterRepresentation result_rep, int32_t offset,
+                       uint8_t element_scale) {
+    if (kind.is_atomic) {
+      if (loaded_rep == MemoryRepresentation::Int64() ||
+          loaded_rep == MemoryRepresentation::Uint64()) {
+        return ProjectionTuple(Next::ReduceAtomicWord32Pair(
+            base_idx, index, OpIndex::Invalid(), OpIndex::Invalid(),
+            OpIndex::Invalid(), OpIndex::Invalid(),
+            AtomicWord32PairOp::OpKind::kLoad, offset));
+      }
+      if (kind.is_atomic && result_rep == RegisterRepresentation::Word64()) {
+        return __ Tuple(Next::ReduceLoad(base_idx, index, kind, loaded_rep,
+                                         RegisterRepresentation::Word32(),
+                                         offset, element_scale),
+                        __ Word32Constant(0));
+      }
+    }
+    if (loaded_rep == MemoryRepresentation::Int64()) {
+      return __ Tuple(
+          Next::ReduceLoad(base_idx, index, kind, MemoryRepresentation::Int32(),
+                           RegisterRepresentation::Word32(), offset,
+                           element_scale),
+          Next::ReduceLoad(base_idx, index, kind, MemoryRepresentation::Int32(),
+                           RegisterRepresentation::Word32(),
+                           offset + sizeof(int32_t), element_scale));
+    }
+    return Next::ReduceLoad(base_idx, index, kind, loaded_rep, result_rep,
+                            offset, element_scale);
+  }
+
+  OpIndex REDUCE(Store)(OpIndex base, OpIndex index, OpIndex value,
+                        StoreOp::Kind kind, MemoryRepresentation stored_rep,
+                        WriteBarrierKind write_barrier, int32_t offset,
+                        uint8_t element_size_log2,
+                        bool maybe_initializing_or_transitioning) {
+    if (stored_rep == MemoryRepresentation::Int64() ||
+        stored_rep == MemoryRepresentation::Uint64()) {
+      auto [low, high] = Unpack(value);
+      if (kind.is_atomic) {
+        return Next::ReduceAtomicWord32Pair(
+            base, index, low, high, OpIndex::Invalid(), OpIndex::Invalid(),
+            AtomicWord32PairOp::OpKind::kStore, offset);
+      }
+      return __ Tuple(
+          Next::ReduceStore(base, index, low, kind,
+                            MemoryRepresentation::Int32(), write_barrier,
+                            offset, element_size_log2,
+                            maybe_initializing_or_transitioning),
+          Next::ReduceStore(base, index, high, kind,
+                            MemoryRepresentation::Int32(), write_barrier,
+                            offset + sizeof(int32_t), element_size_log2,
+                            maybe_initializing_or_transitioning));
+    }
+    return Next::ReduceStore(base, index, value, kind, stored_rep,
+                             write_barrier, offset, element_size_log2,
+                             maybe_initializing_or_transitioning);
+  }
+
+  OpIndex REDUCE(AtomicRMW)(OpIndex base, OpIndex index, OpIndex value,
+                            OpIndex expected, AtomicRMWOp::BinOp bin_op,
+                            RegisterRepresentation result_rep,
+                            MemoryRepresentation input_rep,
+                            MemoryAccessKind kind) {
+    if (result_rep != RegisterRepresentation::Word64()) {
+      return Next::ReduceAtomicRMW(base, index, value, expected, bin_op,
+                                   result_rep, input_rep, kind);
+    }
+    auto [value_low, value_high] = Unpack(value);
+    if (input_rep == MemoryRepresentation::Int64() ||
+        input_rep == MemoryRepresentation::Uint64()) {
+      if (bin_op == AtomicRMWOp::BinOp::kCompareExchange) {
+        auto [expected_low, expected_high] = Unpack(expected);
+        return ProjectionTuple(Next::ReduceAtomicWord32Pair(
+            base, index, value_low, value_high, expected_low, expected_high,
+            AtomicWord32PairOp::OpKind::kCompareExchange, 0));
+      } else {
+        return ProjectionTuple(Next::ReduceAtomicWord32Pair(
+            base, index, value_low, value_high, OpIndex::Invalid(),
+            OpIndex::Invalid(), AtomicWord32PairOp::OpKindFromBinOp(bin_op),
+            0));
+      }
+    }
+
+    OpIndex new_expected = OpIndex::Invalid();
+    if (bin_op == AtomicRMWOp::BinOp::kCompareExchange) {
+      auto [expected_low, expected_high] = Unpack(expected);
+      new_expected = expected_low;
+    }
+    return __ Tuple(Next::ReduceAtomicRMW(
+                        base, index, value_low, new_expected, bin_op,
+                        RegisterRepresentation::Word32(), input_rep, kind),
+                    __ Word32Constant(0));
+  }
+
+  OpIndex REDUCE(Phi)(base::Vector<const OpIndex> inputs,
+                      RegisterRepresentation rep) {
+    if (rep == RegisterRepresentation::Word64()) {
+      base::SmallVector<OpIndex, 8> inputs_low;
+      base::SmallVector<OpIndex, 8> inputs_high;
+      auto word32 = RegisterRepresentation::Word32();
+      inputs_low.reserve_no_init(inputs.size());
+      inputs_high.reserve_no_init(inputs.size());
+      for (OpIndex input : inputs) {
+        inputs_low.push_back(__ Projection(input, 0, word32));
+        inputs_high.push_back(__ Projection(input, 1, word32));
+      }
+      return __ Tuple(Next::ReducePhi(base::VectorOf(inputs_low), word32),
+                      Next::ReducePhi(base::VectorOf(inputs_high), word32));
+    }
+    return Next::ReducePhi(inputs, rep);
+  }
+
+  OpIndex REDUCE(PendingLoopPhi)(OpIndex first, RegisterRepresentation rep) {
+    if (rep == RegisterRepresentation::Word64()) {
+      V<Word32> low =
+          __ PendingLoopPhi(__ template Projection<Word32>(first, 0));
+      V<Word32> high =
+          __ PendingLoopPhi(__ template Projection<Word32>(first, 1));
+      return __ Tuple(low, high);
+    }
+    return Next::ReducePendingLoopPhi(first, rep);
+  }
+
+  void FixLoopPhi(const PhiOp& input_phi, OpIndex output_index,
+                  Block* output_graph_loop) {
+    if (input_phi.rep == RegisterRepresentation::Word64()) {
+      const TupleOp& tuple = __ Get(output_index).template Cast<TupleOp>();
+      DCHECK_EQ(tuple.input_count, 2);
+      OpIndex new_inputs[2] = {Asm().MapToNewGraph(input_phi.input(0)),
+                               Asm().MapToNewGraph(input_phi.input(1))};
+      for (size_t i = 0; i < 2; ++i) {
+        OpIndex phi_index = tuple.input(i);
+        if (!output_graph_loop->Contains(phi_index)) {
+          continue;
+        }
+#ifdef DEBUG
+        const PendingLoopPhiOp& pending_phi =
+            __ Get(phi_index).template Cast<PendingLoopPhiOp>();
+        DCHECK_EQ(pending_phi.rep, RegisterRepresentation::Word32());
+        DCHECK_EQ(
+            pending_phi.first(),
+            __ Projection(new_inputs[0], i, RegisterRepresentation::Word32()));
+#endif
+        __ output_graph().template Replace<PhiOp>(
+            phi_index,
+            base::VectorOf({__ Projection(new_inputs[0], i,
+                                          RegisterRepresentation::Word32()),
+                            __ Projection(new_inputs[1], i,
+                                          RegisterRepresentation::Word32())}),
+            RegisterRepresentation::Word32());
+      }
+      return;
+    }
+    return Next::FixLoopPhi(input_phi, output_index, output_graph_loop);
+  }
+
+  OpIndex REDUCE(Simd128Splat)(OpIndex input, Simd128SplatOp::Kind kind) {
+    // TODO(14108): Introduce I32-pair splat for better codegen.
+    if (kind != Simd128SplatOp::Kind::kI64x2) {
+      return Next::ReduceSimd128Splat(input, kind);
+    }
+    auto [low, high] = Unpack(input);
+    V<Simd128> base = __ Simd128Splat(low, Simd128SplatOp::Kind::kI32x4);
+    V<Simd128> first_replaced = __ Simd128ReplaceLane(
+        base, high, Simd128ReplaceLaneOp::Kind::kI32x4, 1);
+    return __ Simd128ReplaceLane(first_replaced, high,
+                                 Simd128ReplaceLaneOp::Kind::kI32x4, 3);
+  }
+
+  OpIndex REDUCE(Simd128ExtractLane)(OpIndex input,
+                                     Simd128ExtractLaneOp::Kind kind,
+                                     uint8_t lane) {
+    if (kind != Simd128ExtractLaneOp::Kind::kI64x2) {
+      return Next::ReduceSimd128ExtractLane(input, kind, lane);
+    }
+    OpIndex low = __ Simd128ExtractLane(
+        input, Simd128ExtractLaneOp::Kind::kI32x4, 2 * lane);
+    OpIndex high = __ Simd128ExtractLane(
+        input, Simd128ExtractLaneOp::Kind::kI32x4, 2 * lane + 1);
+    return __ Tuple(low, high);
+  }
+
+  OpIndex REDUCE(Simd128ReplaceLane)(OpIndex into, OpIndex new_lane,
+                                     Simd128ReplaceLaneOp::Kind kind,
+                                     uint8_t lane) {
+    // TODO(14108): Introduce I32-pair lane replacement for better codegen.
+    if (kind != Simd128ReplaceLaneOp::Kind::kI64x2) {
+      return Next::ReduceSimd128ReplaceLane(into, new_lane, kind, lane);
+    }
+    auto [low, high] = Unpack(new_lane);
+    V<Simd128> low_replaced = __ Simd128ReplaceLane(
+        into, low, Simd128ReplaceLaneOp::Kind::kI32x4, 2 * lane);
+    return __ Simd128ReplaceLane(
+        low_replaced, high, Simd128ReplaceLaneOp::Kind::kI32x4, 2 * lane + 1);
+  }
+
+ private:
+  bool CheckPairOrPairOp(OpIndex input) {
+#ifdef DEBUG
+    if (const TupleOp* tuple = Asm().template TryCast<TupleOp>(input)) {
+      DCHECK_EQ(2, tuple->input_count);
+    } else if (const DidntThrowOp* didnt_throw =
+                   Asm().template TryCast<DidntThrowOp>(input)) {
+      // If it's a call, it must be a call that returns exactly one i64.
+      // (Note that the CallDescriptor has already been lowered to [i32, i32].)
+      const CallOp& call =
+          Asm().Get(didnt_throw->throwing_operation()).template Cast<CallOp>();
+      DCHECK_EQ(call.descriptor->descriptor->ReturnCount(), 2);
+      DCHECK_EQ(call.descriptor->descriptor->GetReturnType(0),
+                MachineType::Int32());
+      DCHECK_EQ(call.descriptor->descriptor->GetReturnType(1),
+                MachineType::Int32());
+    } else {
+      DCHECK(Asm().template Is<Word32PairBinopOp>(input));
+    }
+#endif
+    return true;
+  }
+
+  std::pair<V<Word32>, V<Word32>> Unpack(V<Word64> input) {
+    DCHECK(CheckPairOrPairOp(input));
+    return {__ Projection(input, 0, RegisterRepresentation::Word32()),
+            __ Projection(input, 1, RegisterRepresentation::Word32())};
+  }
+
+  // Wrap an operation that doesn't return a tuple already in a tuple of
+  // projections. It is required to immediately emit projections, so that phi
+  // inputs can always map to an already materialized projection.
+  OpIndex ProjectionTuple(OpIndex input) {
+    auto word32 = RegisterRepresentation::Word32();
+    DCHECK(!__ Get(input).template Is<TupleOp>());
+    DCHECK_EQ(__ Get(input).outputs_rep(), base::VectorOf({word32, word32}));
+    return __ Tuple(__ Projection(input, 0, word32),
+                    __ Projection(input, 1, word32));
+  }
+
+  OpIndex ReduceSignExtend(V<Word32> input) {
+    // We use SAR to preserve the sign in the high word.
+    return __ Tuple(input, __ Word32ShiftRightArithmetic(input, 31));
+  }
+
+  OpIndex ReduceClz(V<Word64> input) {
+    auto [low, high] = Unpack(input);
+    ScopedVar<Word32> result(Asm());
+    IF (__ Word32Equal(high, 0)) {
+      result = __ Word32Add(32, __ Word32CountLeadingZeros(low));
+    }
+    ELSE {
+      result = __ Word32CountLeadingZeros(high);
+    }
+    END_IF
+    return __ Tuple(*result, __ Word32Constant(0));
+  }
+
+  OpIndex ReduceCtz(V<Word64> input) {
+    DCHECK(SupportedOperations::word32_ctz());
+    auto [low, high] = Unpack(input);
+    ScopedVar<Word32> result(Asm());
+    IF (__ Word32Equal(low, 0)) {
+      result = __ Word32Add(32, __ Word32CountTrailingZeros(high));
+    }
+    ELSE {
+      result = __ Word32CountTrailingZeros(low);
+    }
+    END_IF
+    return __ Tuple(*result, __ Word32Constant(0));
+  }
+
+  OpIndex ReducePopCount(V<Word64> input) {
+    DCHECK(SupportedOperations::word32_popcnt());
+    auto [low, high] = Unpack(input);
+    return __ Tuple(
+        __ Word32Add(__ Word32PopCount(low), __ Word32PopCount(high)),
+        __ Word32Constant(0));
+  }
+
+  OpIndex ReducePairBinOp(V<Word64> left, V<Word64> right,
+                          Word32PairBinopOp::Kind kind) {
+    auto [left_low, left_high] = Unpack(left);
+    auto [right_low, right_high] = Unpack(right);
+    return ProjectionTuple(
+        __ Word32PairBinop(left_low, left_high, right_low, right_high, kind));
+  }
+
+  OpIndex ReducePairShiftOp(V<Word64> left, V<Word32> right,
+                            Word32PairBinopOp::Kind kind) {
+    auto [left_low, left_high] = Unpack(left);
+    // Note: The rhs of a 64 bit shift is a 32 bit value in turboshaft.
+    V<Word32> right_high = __ Word32Constant(0);
+    return ProjectionTuple(
+        __ Word32PairBinop(left_low, left_high, right, right_high, kind));
+  }
+
+  OpIndex ReduceBitwiseAnd(V<Word64> left, V<Word64> right) {
+    auto [left_low, left_high] = Unpack(left);
+    auto [right_low, right_high] = Unpack(right);
+    V<Word32> low_result = __ Word32BitwiseAnd(left_low, right_low);
+    V<Word32> high_result = __ Word32BitwiseAnd(left_high, right_high);
+    return __ Tuple(low_result, high_result);
+  }
+
+  OpIndex ReduceBitwiseOr(V<Word64> left, V<Word64> right) {
+    auto [left_low, left_high] = Unpack(left);
+    auto [right_low, right_high] = Unpack(right);
+    V<Word32> low_result = __ Word32BitwiseOr(left_low, right_low);
+    V<Word32> high_result = __ Word32BitwiseOr(left_high, right_high);
+    return __ Tuple(low_result, high_result);
+  }
+
+  OpIndex ReduceBitwiseXor(V<Word64> left, V<Word64> right) {
+    auto [left_low, left_high] = Unpack(left);
+    auto [right_low, right_high] = Unpack(right);
+    V<Word32> low_result = __ Word32BitwiseXor(left_low, right_low);
+    V<Word32> high_result = __ Word32BitwiseXor(left_high, right_high);
+    return __ Tuple(low_result, high_result);
+  }
+
+  OpIndex ReduceRotateRight(V<Word64> left, V<Word32> right) {
+    // This reducer assumes that all rotates are mapped to rotate right.
+    DCHECK(!SupportedOperations::word64_rol());
+    auto [left_low, left_high] = Unpack(left);
+    V<Word32> shift = right;
+    uint32_t constant_shift = 0;
+
+    if (Asm().MatchWord32Constant(shift, &constant_shift)) {
+      // Precondition: 0 <= shift < 64.
+      uint32_t shift_value = constant_shift & 0x3F;
+      if (shift_value == 0) {
+        // No-op, return original tuple.
+        return left;
+      }
+      if (shift_value == 32) {
+        // Swap low and high of left.
+        return __ Tuple(left_high, left_low);
+      }
+
+      V<Word32> low_input = left_high;
+      V<Word32> high_input = left_low;
+      if (shift_value < 32) {
+        low_input = left_low;
+        high_input = left_high;
+      }
+
+      uint32_t masked_shift_value = shift_value & 0x1F;
+      V<Word32> masked_shift = __ Word32Constant(masked_shift_value);
+      V<Word32> inv_shift = __ Word32Constant(32 - masked_shift_value);
+
+      V<Word32> low_node = __ Word32BitwiseOr(
+          __ Word32ShiftRightLogical(low_input, masked_shift),
+          __ Word32ShiftLeft(high_input, inv_shift));
+      V<Word32> high_node = __ Word32BitwiseOr(
+          __ Word32ShiftRightLogical(high_input, masked_shift),
+          __ Word32ShiftLeft(low_input, inv_shift));
+      return __ Tuple(low_node, high_node);
+    }
+
+    V<Word32> safe_shift = shift;
+    if (!SupportedOperations::word32_shift_is_safe()) {
+      // safe_shift = shift % 32
+      safe_shift = __ Word32BitwiseAnd(shift, 0x1F);
+    }
+    V<Word32> all_bits_set = __ Word32Constant(-1);
+    V<Word32> inv_mask = __ Word32BitwiseXor(
+        __ Word32ShiftRightLogical(all_bits_set, safe_shift), all_bits_set);
+    V<Word32> bit_mask = __ Word32BitwiseXor(inv_mask, all_bits_set);
+
+    V<Word32> less_than_32 = __ Int32LessThan(shift, 32);
+    // The low word and the high word can be swapped either at the input or
+    // at the output. We swap the inputs so that shift does not have to be
+    // kept for so long in a register.
+    ScopedVar<Word32> var_low(Asm(), left_high);
+    ScopedVar<Word32> var_high(Asm(), left_low);
+    IF (less_than_32) {
+      var_low = left_low;
+      var_high = left_high;
+    }
+    END_IF
+
+    V<Word32> rotate_low = __ Word32RotateRight(*var_low, safe_shift);
+    V<Word32> rotate_high = __ Word32RotateRight(*var_high, safe_shift);
+
+    V<Word32> low_node =
+        __ Word32BitwiseOr(__ Word32BitwiseAnd(rotate_low, bit_mask),
+                           __ Word32BitwiseAnd(rotate_high, inv_mask));
+    V<Word32> high_node =
+        __ Word32BitwiseOr(__ Word32BitwiseAnd(rotate_high, bit_mask),
+                           __ Word32BitwiseAnd(rotate_low, inv_mask));
+    return __ Tuple(low_node, high_node);
+  }
+
+  OpIndex ReduceCall(OpIndex callee, OpIndex frame_state,
+                     base::Vector<const OpIndex> arguments,
+                     const TSCallDescriptor* descriptor, OpEffects effects,
+                     bool is_tail_call) {
+    // Iterate over the call descriptor to skip lowering if the signature does
+    // not contain an i64.
+    const CallDescriptor* call_descriptor = descriptor->descriptor;
+    size_t param_count = call_descriptor->ParameterCount();
+    size_t i64_params = 0;
+    for (size_t i = 0; i < param_count; ++i) {
+      i64_params += call_descriptor->GetParameterType(i).representation() ==
+                    MachineRepresentation::kWord64;
+    }
+    size_t return_count = call_descriptor->ReturnCount();
+    size_t i64_returns = 0;
+    for (size_t i = 0; i < return_count; ++i) {
+      i64_returns += call_descriptor->GetReturnType(i).representation() ==
+                     MachineRepresentation::kWord64;
+    }
+    if (i64_params + i64_returns == 0) {
+      // No lowering required.
+      return is_tail_call ? Next::ReduceTailCall(callee, arguments, descriptor)
+                          : Next::ReduceCall(callee, frame_state, arguments,
+                                             descriptor, effects);
+    }
+
+    // Create descriptor with 2 i32s for every i64.
+    const CallDescriptor* lowered_descriptor =
+        GetI32WasmCallDescriptor(Asm().graph_zone(), call_descriptor);
+
+    // Map the arguments by unpacking i64 arguments (which have already been
+    // lowered to Tuple(i32, i32).)
+    base::SmallVector<OpIndex, 16> lowered_args;
+    lowered_args.reserve_no_init(param_count + i64_params);
+
+    DCHECK_EQ(param_count, arguments.size());
+    for (size_t i = 0; i < param_count; ++i) {
+      if (call_descriptor->GetParameterType(i).representation() ==
+          MachineRepresentation::kWord64) {
+        auto [low, high] = Unpack(arguments[i]);
+        lowered_args.push_back(low);
+        lowered_args.push_back(high);
+      } else {
+        lowered_args.push_back(arguments[i]);
+      }
+    }
+
+    auto lowered_ts_descriptor = TSCallDescriptor::Create(
+        lowered_descriptor, descriptor->can_throw, __ graph_zone());
+    OpIndex call =
+        is_tail_call
+            ? Next::ReduceTailCall(callee, base::VectorOf(lowered_args),
+                                   lowered_ts_descriptor)
+            : Next::ReduceCall(callee, frame_state,
+                               base::VectorOf(lowered_args),
+                               lowered_ts_descriptor, effects);
+    if (is_tail_call) {
+      // Tail calls don't return anything to the calling function.
+      return call;
+    }
+    if (i64_returns == 0 || return_count == 0) {
+      return call;
+    } else if (return_count == 1) {
+      // There isn't any projection in the input graph for calls returning
+      // exactly one value. Return a tuple of projections for the int64.
+      DCHECK_EQ(i64_returns, 1);
+      return ProjectionTuple(call);
+    }
+
+    // Wrap the call node with a tuple of projections of the lowered call.
+    // Example for a call returning [int64, int32]:
+    //   In:  Call(...) -> [int64, int32]
+    //   Out: call = Call() -> [int32, int32, int32]
+    //        Tuple(
+    //           Tuple(Projection(call, 0), Projection(call, 1)),
+    //           Projection(call, 2))
+    //
+    // This way projections on the original call node will be automatically
+    // "rewired" to the correct projection of the lowered call.
+    auto word32 = RegisterRepresentation::Word32();
+    base::SmallVector<OpIndex, 16> tuple_inputs;
+    tuple_inputs.reserve_no_init(return_count);
+    size_t projection_index = 0;  // index of the lowered call results.
+
+    for (size_t i = 0; i < return_count; ++i) {
+      MachineRepresentation machine_rep =
+          call_descriptor->GetReturnType(i).representation();
+      if (machine_rep == MachineRepresentation::kWord64) {
+        tuple_inputs.push_back(
+            __ Tuple(__ Projection(call, projection_index, word32),
+                     __ Projection(call, projection_index + 1, word32)));
+        projection_index += 2;
+      } else {
+        tuple_inputs.push_back(__ Projection(
+            call, projection_index++,
+            RegisterRepresentation::FromMachineRepresentation(machine_rep)));
+      }
+    }
+    DCHECK_EQ(projection_index, return_count + i64_returns);
+    return __ Tuple(base::VectorOf(tuple_inputs));
+  }
+
+  void InitializeIndexMaps() {
+    // Add one implicit parameter in front.
+    param_index_map_.push_back(0);
+    int32_t new_index = 0;
+    for (size_t i = 0; i < sig_->parameter_count(); ++i) {
+      param_index_map_.push_back(++new_index);
+      if (sig_->GetParam(i) == wasm::kWasmI64) {
+        // i64 becomes [i32 low, i32 high], so the next parameter index is
+        // shifted by one.
+        ++new_index;
+      }
+    }
+
+    // TODO(mliedtke): Use sig_.contains(wasm::kWasmI64), once it's merged.
+    returns_i64_ = std::any_of(
+        sig_->returns().begin(), sig_->returns().end(),
+        [](const wasm::ValueType& v) { return v == wasm::kWasmI64; });
+  }
+
+  const wasm::FunctionSig* sig_ = PipelineData::Get().wasm_sig();
+  Zone* zone_ = PipelineData::Get().graph_zone();
+  ZoneVector<int32_t> param_index_map_{__ phase_zone()};
+  bool returns_i64_ = false;  // Returns at least one i64.
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_INT64_LOWERING_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/late-escape-analysis-reducer.cc b/deps/v8/src/compiler/turboshaft/late-escape-analysis-reducer.cc
index 234dab18e9442c..e619f65fa48270 100644
--- a/deps/v8/src/compiler/turboshaft/late-escape-analysis-reducer.cc
+++ b/deps/v8/src/compiler/turboshaft/late-escape-analysis-reducer.cc
@@ -15,7 +15,7 @@ void LateEscapeAnalysisAnalyzer::RecordAllocateUse(OpIndex alloc, OpIndex use) {
   auto [it, new_entry] = alloc_uses_.try_emplace(alloc, phase_zone_);
   auto& uses = it->second;
   if (new_entry) {
-    uses.reserve(graph_.Get(alloc).saturated_use_count);
+    uses.reserve(graph_.Get(alloc).saturated_use_count.Get());
   }
   uses.push_back(use);
 }
@@ -80,6 +80,7 @@ bool LateEscapeAnalysisAnalyzer::EscapesThroughUse(OpIndex alloc,
 }
 
 void LateEscapeAnalysisAnalyzer::MarkToRemove(OpIndex alloc) {
+  if (ShouldSkipOptimizationStep()) return;
   graph_.MarkAsUnused(alloc);
   if (alloc_uses_.find(alloc) == alloc_uses_.end()) {
     return;
diff --git a/deps/v8/src/compiler/turboshaft/late-escape-analysis-reducer.h b/deps/v8/src/compiler/turboshaft/late-escape-analysis-reducer.h
index c0000c8b3bd600..d85856840ce269 100644
--- a/deps/v8/src/compiler/turboshaft/late-escape-analysis-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/late-escape-analysis-reducer.h
@@ -48,18 +48,14 @@ class LateEscapeAnalysisReducer : public Next {
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
-  template <class... Args>
-  explicit LateEscapeAnalysisReducer(const std::tuple<Args...>& args)
-      : Next(args),
-        analyzer_(Asm().modifiable_input_graph(), Asm().phase_zone()) {}
-
   void Analyze() {
     analyzer_.Run();
     Next::Analyze();
   }
 
  private:
-  LateEscapeAnalysisAnalyzer analyzer_;
+  LateEscapeAnalysisAnalyzer analyzer_{Asm().modifiable_input_graph(),
+                                       Asm().phase_zone()};
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/late-load-elimination-reducer.cc b/deps/v8/src/compiler/turboshaft/late-load-elimination-reducer.cc
new file mode 100644
index 00000000000000..ecc0aef684f38a
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/late-load-elimination-reducer.cc
@@ -0,0 +1,383 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/late-load-elimination-reducer.h"
+
+#include "src/compiler/js-heap-broker.h"
+#include "src/objects/code-inl.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+void LateLoadEliminationAnalyzer::ProcessBlock(const Block& block,
+                                               bool compute_start_snapshot) {
+  if (compute_start_snapshot) {
+    BeginBlock(&block);
+  }
+
+  for (OpIndex op_idx : graph_.OperationIndices(block)) {
+    Operation& op = graph_.Get(op_idx);
+    if (ShouldSkipOptimizationStep()) continue;
+    if (ShouldSkipOperation(op)) continue;
+    switch (op.opcode) {
+      case Opcode::kLoad:
+        // Eliminate load or update state
+        ProcessLoad(op_idx, op.Cast<LoadOp>());
+        break;
+      case Opcode::kStore:
+        // Update state (+ maybe invalidate aliases)
+        ProcessStore(op_idx, op.Cast<StoreOp>());
+        break;
+      case Opcode::kAllocate:
+        // Create new non-alias
+        ProcessAllocate(op_idx, op.Cast<AllocateOp>());
+        break;
+      case Opcode::kCall:
+        // Invalidate state (+ maybe invalidate aliases)
+        ProcessCall(op_idx, op.Cast<CallOp>());
+        break;
+      case Opcode::kPhi:
+        // Invalidate aliases
+        ProcessPhi(op_idx, op.Cast<PhiOp>());
+        break;
+      case Opcode::kAssumeMap:
+        // Update known maps
+        ProcessAssumeMap(op_idx, op.Cast<AssumeMapOp>());
+        break;
+      case Opcode::kCatchBlockBegin:
+      case Opcode::kRetain:
+      case Opcode::kDidntThrow:
+      case Opcode::kCheckException:
+        // We explicitely break for those operations that have can_write effects
+        // but don't actually write.
+        break;
+      default:
+        // Operations that `can_write` should invalidate the state. All such
+        // operations should be already handled above, which means that we don't
+        // need a `if (can_write) { Invalidate(); }` here.
+        CHECK(!op.Effects().can_write());
+        break;
+    }
+  }
+
+  FinishBlock(&block);
+}
+
+namespace {
+
+// Returns true if replacing a Load with a RegisterReprsentation
+// {expected_reg_rep} and MemoryRepresentation of {expected_loaded_repr} with an
+// operation with RegisterRepresentation {actual} is valid. For instance,
+// replacing a operation that returns a Float64 by one that returns a Word64 is
+// not valid. Similarly, replacing a Tagged with an untagged value is probably
+// not valid because of the GC.
+bool RepIsCompatible(RegisterRepresentation actual,
+                     RegisterRepresentation expected_reg_repr,
+                     MemoryRepresentation expected_loaded_repr) {
+  if (expected_loaded_repr.SizeInBytes() !=
+      MemoryRepresentation::FromRegisterRepresentation(actual, true)
+          .SizeInBytes()) {
+    // The replacement was truncated when being stored or should be truncated
+    // (or sign-extended) during the load. Since we don't have enough
+    // truncations operators in Turboshaft (eg, we don't have Int32 to Int8
+    // truncation), we just prevent load elimination in this case.
+
+    // TODO(dmercadier): add more truncations operators to Turboshaft, and
+    // insert the correct truncation when there is a missmatch between
+    // {expected_loaded_repr} and {actual}.
+
+    return false;
+  }
+
+  return expected_reg_repr == actual;
+}
+
+}  // namespace
+
+void LateLoadEliminationAnalyzer::ProcessLoad(OpIndex op_idx,
+                                              const LoadOp& load) {
+  if (!load.kind.always_canonically_accessed) {
+    // We don't optimize Loads/Stores to addresses that could be accessed
+    // non-canonically.
+    return;
+  }
+
+  if (OpIndex existing = memory_.Find(load); existing.valid()) {
+    const Operation& replacement = graph_.Get(existing);
+    // We need to make sure that {load} and {replacement} have the same output
+    // representation. In particular, in unreachable code, it's possible that
+    // the two of them have incompatible representations (like one could be
+    // Tagged and the other one Float64).
+    DCHECK_EQ(replacement.outputs_rep().size(), 1);
+    DCHECK_EQ(load.outputs_rep().size(), 1);
+    if (RepIsCompatible(replacement.outputs_rep()[0], load.outputs_rep()[0],
+                        load.loaded_rep)) {
+      replacements_[op_idx] = existing;
+      return;
+    }
+  }
+  // Reset the replacement of {op_idx} to Invalid, in case a previous visit of a
+  // loop has set it to something else.
+  replacements_[op_idx] = OpIndex::Invalid();
+
+  // TODO(dmercadier): if we precisely track maps, then we could know from the
+  // map what we are loading in some cases. For instance, if the elements_kind
+  // of the map is *_DOUBLE_ELEMENTS, then a load at offset
+  // JSObject::kElementsOffset always load a FixedDoubleArray, with map
+  // fixed_double_array_map.
+
+  if (const ConstantOp* base = graph_.Get(load.base()).TryCast<ConstantOp>();
+      base != nullptr && base->kind == ConstantOp::Kind::kExternal) {
+    // External constants can be written by other threads, so we don't
+    // load-eliminate them, in order to always reload them.
+    return;
+  }
+
+  memory_.Insert(load, op_idx);
+}
+
+void LateLoadEliminationAnalyzer::ProcessStore(OpIndex op_idx,
+                                               const StoreOp& store) {
+  if (!store.kind.always_canonically_accessed) {
+    // We don't optimize Loads/Stores to addresses that could be accessed
+    // non-canonically.
+    return;
+  }
+
+  OpIndex value = store.value();
+
+  // Updating the known stored values
+  memory_.Invalidate(store);
+  memory_.Insert(store);
+
+  // Updating aliases if the value stored was known as non-aliasing.
+  if (non_aliasing_objects_.HasKeyFor(value)) {
+    non_aliasing_objects_.Set(value, false);
+  }
+}
+
+namespace {
+
+// If {target} is a HeapObject representing a builtin, return that builtin's ID.
+base::Optional<Builtin> TryGetBuiltinId(ConstantOp* target,
+                                        JSHeapBroker* broker) {
+  if (!target) return base::nullopt;
+  if (target->kind != ConstantOp::Kind::kHeapObject) return base::nullopt;
+  HeapObjectRef ref = MakeRef(broker, target->handle());
+  if (ref.IsCode()) {
+    CodeRef code = ref.AsCode();
+    if (code.object()->is_builtin()) {
+      return code.object()->builtin_id();
+    }
+  }
+  return base::nullopt;
+}
+
+}  // namespace
+
+// Since we only loosely keep track of what can or can't alias, we assume that
+// anything that was guaranteed to not alias with anything (because it's in
+// {non_aliasing_objects_}) can alias with anything when coming back from the
+// call if it was an argument of the call.
+void LateLoadEliminationAnalyzer::ProcessCall(OpIndex op_idx,
+                                              const CallOp& op) {
+  // Some builtins do not create aliases and do not invalidate existing
+  // memory, and some even return fresh objects. For such cases, we don't
+  // invalidate the state, and record the non-alias if any.
+  if (!op.Effects().can_write()) return;
+
+  if (auto builtin_id = TryGetBuiltinId(
+          graph_.Get(op.callee()).TryCast<ConstantOp>(), broker_)) {
+    switch (*builtin_id) {
+      // TODO(dmercadier): extend this list.
+      case Builtin::kCopyFastSmiOrObjectElements:
+        // This function just replaces the Elements array of an object.
+        // It doesn't invalidate any alias or any other memory than this
+        // Elements array.
+        memory_.Invalidate(op.arguments()[0], OpIndex::Invalid(),
+                           JSObject::kElementsOffset);
+        return;
+      case Builtin::kCEntry_Return1_ArgvOnStack_NoBuiltinExit: {
+        DCHECK_GE(op.input_count, 3);
+        if (const ConstantOp* real_callee =
+                graph_.Get(op.input(2)).TryCast<ConstantOp>();
+            real_callee != nullptr &&
+            real_callee->kind == ConstantOp::Kind::kExternal &&
+            real_callee->external_reference() ==
+                ExternalReference::Create(
+                    Runtime::kHandleNoHeapWritesInterrupts)) {
+          // This is a stack check that cannot write heap memory.
+          return;
+        }
+        break;
+      }
+      default:
+        break;
+    }
+  }
+  // Not a builtin call, or not a builtin that we know doesn't invalidate
+  // memory.
+
+  for (OpIndex input : op.inputs()) {
+    InvalidateIfAlias(input);
+  }
+
+  // The call could modify arbitrary memory, so we invalidate every
+  // potentially-aliasing object.
+  memory_.InvalidateMaybeAliasing();
+}
+
+void LateLoadEliminationAnalyzer::InvalidateIfAlias(OpIndex op_idx) {
+  if (auto key = non_aliasing_objects_.TryGetKeyFor(op_idx);
+      key.has_value() && non_aliasing_objects_.Get(*key)) {
+    // An known non-aliasing object was passed as input to the Call; the Call
+    // could create aliases, so we have to consider going forward that this
+    // object could actually have aliases.
+    non_aliasing_objects_.Set(*key, false);
+  }
+}
+
+void LateLoadEliminationAnalyzer::ProcessAllocate(OpIndex op_idx,
+                                                  const AllocateOp&) {
+  non_aliasing_objects_.Set(op_idx, true);
+}
+
+void LateLoadEliminationAnalyzer::ProcessPhi(OpIndex op_idx, const PhiOp& phi) {
+  for (OpIndex input : phi.inputs()) {
+    if (auto key = non_aliasing_objects_.TryGetKeyFor(input)) {
+      non_aliasing_objects_.Set(*key, false);
+    }
+    // If {non_aliasing_objects_} has no key for {input}, then {input} was not
+    // known as non-aliasing (and is thus considered by default as
+    // maybe-aliasing), so there is no need to create an entry for it in
+    // {non_aliasing_objects_}.
+  }
+}
+
+void LateLoadEliminationAnalyzer::ProcessAssumeMap(
+    OpIndex op_idx, const AssumeMapOp& assume_map) {
+  OpIndex object = assume_map.heap_object();
+  object_maps_.Set(object, CombineMinMax(object_maps_.Get(object),
+                                         ComputeMinMaxHash(assume_map.maps)));
+}
+
+void LateLoadEliminationAnalyzer::FinishBlock(const Block* block) {
+  block_to_snapshot_mapping_[block->index()] = Snapshot{
+      non_aliasing_objects_.Seal(), object_maps_.Seal(), memory_.Seal()};
+}
+
+void LateLoadEliminationAnalyzer::SealAndDiscard() {
+  non_aliasing_objects_.Seal();
+  object_maps_.Seal();
+  memory_.Seal();
+}
+
+template <bool for_loop_revisit>
+bool LateLoadEliminationAnalyzer::BeginBlock(const Block* block) {
+  DCHECK_IMPLIES(
+      for_loop_revisit,
+      block->IsLoop() &&
+          block_to_snapshot_mapping_[block->LastPredecessor()->index()]
+              .has_value());
+
+  // Collect the snapshots of all predecessors.
+  {
+    predecessor_alias_snapshots_.clear();
+    predecessor_maps_snapshots_.clear();
+    predecessor_memory_snapshots_.clear();
+    for (const Block* p = block->LastPredecessor(); p != nullptr;
+         p = p->NeighboringPredecessor()) {
+      auto pred_snapshots = block_to_snapshot_mapping_[p->index()];
+      // When we visit the loop for the first time, the loop header hasn't
+      // been visited yet, so we ignore it.
+      DCHECK_IMPLIES(!pred_snapshots.has_value(),
+                     block->IsLoop() && block->LastPredecessor() == p);
+      if (!pred_snapshots.has_value()) {
+        DCHECK(!for_loop_revisit);
+        continue;
+      }
+      // Note that the backedge snapshot of an inner loop in kFirstVisit will
+      // also be taken into account if we are in the kSecondVisit of an outer
+      // loop. The data in the backedge snapshot could be out-dated, but if it
+      // is, then it's fine: if the backedge of the outer-loop was more
+      // restrictive than its forward incoming edge, then the forward incoming
+      // edge of the inner loop should reflect this restriction.
+      predecessor_alias_snapshots_.push_back(pred_snapshots->alias_snapshot);
+      predecessor_memory_snapshots_.push_back(pred_snapshots->memory_snapshot);
+      if (p->NeighboringPredecessor() != nullptr || !block->IsLoop() ||
+          block->LastPredecessor() != p) {
+        // We only add a MapSnapshot predecessor for non-backedge predecessor.
+        // This is because maps coming from inside of the loop may be wrong
+        // until a specific check has been executed.
+        predecessor_maps_snapshots_.push_back(pred_snapshots->maps_snapshot);
+      }
+    }
+  }
+
+  // Note that predecessors are in reverse order, which means that the backedge
+  // is at offset 0.
+  constexpr int kBackedgeOffset = 0;
+  constexpr int kForwardEdgeOffset = 1;
+
+  bool loop_needs_revisit = false;
+  // Start a new snapshot for this block by merging information from
+  // predecessors.
+  auto merge_aliases = [&](AliasKey key,
+                           base::Vector<const bool> predecessors) -> bool {
+    if (for_loop_revisit && predecessors[kForwardEdgeOffset] &&
+        !predecessors[kBackedgeOffset]) {
+      // The backedge doesn't think that {key} is no-alias, but the loop
+      // header previously thought it was --> need to revisit.
+      loop_needs_revisit = true;
+    }
+    return base::all_of(predecessors);
+  };
+  non_aliasing_objects_.StartNewSnapshot(
+      base::VectorOf(predecessor_alias_snapshots_), merge_aliases);
+
+  auto merge_maps =
+      [&](MapKey key,
+          base::Vector<const MapMaskAndOr> predecessors) -> MapMaskAndOr {
+    MapMaskAndOr minmax;
+    for (const MapMaskAndOr pred : predecessors) {
+      if (is_empty(pred)) {
+        // One of the predecessors doesn't have maps for this object, so we have
+        // to assume that this object could have any map.
+        return MapMaskAndOr{};
+      }
+      minmax = CombineMinMax(minmax, pred);
+    }
+    return minmax;
+  };
+  object_maps_.StartNewSnapshot(base::VectorOf(predecessor_maps_snapshots_),
+                                merge_maps);
+
+  // Merging for {memory_} means setting values to Invalid unless all
+  // predecessors have the same value.
+  // TODO(dmercadier): we could insert of Phis during the pass to merge existing
+  // information. This is a bit hard, because we are currently in an analyzer
+  // rather than a reducer. Still, we could "prepare" the insertion now and then
+  // really insert them during the Reduce phase of the OptimizationPhase.
+  auto merge_memory = [&](MemoryKey key,
+                          base::Vector<const OpIndex> predecessors) -> OpIndex {
+    if (for_loop_revisit && predecessors[kForwardEdgeOffset].valid() &&
+        predecessors[kBackedgeOffset] != predecessors[kForwardEdgeOffset]) {
+      // {key} had a value in the loop header, but the backedge and the forward
+      // edge don't agree on its value, which means that the loop invalidated
+      // some memory data, and thus needs to be revisited.
+      loop_needs_revisit = true;
+    }
+    return base::all_equal(predecessors) ? predecessors[0] : OpIndex::Invalid();
+  };
+  memory_.StartNewSnapshot(base::VectorOf(predecessor_memory_snapshots_),
+                           merge_memory);
+
+  if (block->IsLoop()) return loop_needs_revisit;
+  return false;
+}
+
+template bool LateLoadEliminationAnalyzer::BeginBlock<true>(const Block* block);
+template bool LateLoadEliminationAnalyzer::BeginBlock<false>(
+    const Block* block);
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/late-load-elimination-reducer.h b/deps/v8/src/compiler/turboshaft/late-load-elimination-reducer.h
new file mode 100644
index 00000000000000..ba55efea6f8004
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/late-load-elimination-reducer.h
@@ -0,0 +1,773 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_LATE_LOAD_ELIMINATION_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_LATE_LOAD_ELIMINATION_REDUCER_H_
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/doubly-threaded-list.h"
+#include "src/compiler/turboshaft/graph.h"
+#include "src/compiler/turboshaft/snapshot-table.h"
+#include "src/compiler/turboshaft/utils.h"
+#include "src/zone/zone.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+// Design doc:
+// https://docs.google.com/document/d/1AEl4dATNLu8GlLyUBQFXJoCxoAT5BeG7RCWxoEtIBJE/edit?usp=sharing
+
+// Load Elimination removes redundant loads. Loads can be redundant because:
+//
+//   - they follow a store to the same address. For instance:
+//
+//       x.a = 42;
+//       y = x.a;
+//
+//   - or, they follow the same load. For instance:
+//
+//       y = x.a;
+//       z = x.a;
+//
+// The "annoying" part of load elimination is that object can alias, and stores
+// to dynamically computed indices tend to invalidate the whole state. For
+// instance, if we don't know anything about aliasing regarding `a` and `b`,
+// then, in this situation:
+//
+//     x.a = 42
+//     y.a = 25
+//     z = x.a
+//
+// We can't load-eliminate `z = x.a`, since `y` could alias with `x`, and `y.a =
+// 25` could have overwritten `x.a`. Similarly, if we have something like:
+//
+//     x[0] = 42
+//     y[i] = 25
+//     z = x[0]
+//
+// We can't load-eliminate `z = x[0]`, since `y` could alias with `x`, and
+// `y[i]` thus have overwritten `x[0]`.
+//
+//
+// Implementation:
+//
+//   - In a `MemoryContentTable` (a SnapshotTable), we keep track of known
+//     memory values.
+//     * When we visit a Store:
+//       + if it's to a constant offset, we invalidate all of the known values
+//         at the same offset (for all bases).
+//       + if it's to a dynamic index, we invalidate everything (because things
+//         could alias).
+//       We then update the known value at the address of the store.
+//     * When we visit a Call, we invalidate everything (since the function
+//       called could change any memory through aliases).
+//     * When we visit a Load:
+//       + if there is a known value at the address, we replace the Load by this
+//         value.
+//       + otherwise, the result of the Load becomes the known value at the load
+//         address.
+//
+//   - We keep track (using a SparseOpIndexSnapshotTable) of some objects that
+//     are known to not alias with anything: freshly allocated objects, until
+//     they are passed to a function call, stored in an object, or flow in a
+//     Phi. When storing in a fresh object, we only need to invalidate things in
+//     the same object, leaving the rest of the state untouched. When storing in
+//     a non-fresh object, we don't invalidate the state for fresh objects.
+//
+//   - We keep track (using a SparseOpIndexSnapshotTable) of the maps of some
+//     objects (which we get from AssumeMap operations, which are inserted when
+//     lowering CheckMaps). We use them to know if some objects can alias or
+//     not: 2 objects with different maps cannot alias.
+//
+//   - When a loop contains a Store or a Call, it could invalidate previously
+//     eliminated loads in the begining of the loop. Thus, once we reach the end
+//     of a loop, we recompute the header's snapshot using {header, backedge} as
+//     predecessors, and if anything is invalidated by the backedge, we revisit
+//     the loop.
+//
+// How we "keep track" of objects:
+//
+// We need the following operation:
+//     1. Load the value for a {base, index, offset}.
+//     2. Store that {base, index, offset} = value
+//     3. Invalidate everything at a given offset + everything at an index (for
+//       when storing to a base that could alias with other things).
+//     4. Invalidate everything in a base (for when said base is passed to a
+//       function, or when their is an indexed store in this base).
+//     5. Invalidate everything (for an indexed store into an arbitrary base)
+//
+// To have 1. in constant time, we maintain a global hashmap (`all_keys`) from
+// MemoryAddress (= {base, index, offset, element_size_log2, size}) to Keys, and
+// from these Keys, we have constant-time lookup in the SnapshotTable.
+// To have 3. efficiently, we maintain a Map from offsets to lists of every
+// MemoryAddress at this offset (`offset_keys_`).
+// To have 4. efficiently, we have a similar map from bases to lists of every
+// MemoryAddress at this base (`base_keys_`).
+// For 5., we can use either `offset_keys_` or `base_keys_`. In practice, we use
+// the later because it allows us to efficiently skip bases that are known to
+// have no aliases.
+
+// MapMask and related functions are an attempt to avoid having to store sets of
+// maps for each AssumeMap that we encounter by compressing all of the maps into
+// a single uint64_t.
+//
+// For each object, we keep in a MapMaskAndOr the "minimum" and "maximum" of
+// all of its potential maps, where
+//   - "or_" is computed using the union (logical or) of all of its potential
+//     maps.
+//   - "and_" is computed using the intersection (logical and) of all of its
+//     potential maps.
+//
+// Then, given two objects A and B, if A.and_ has a bit set that isn't set in
+// B.or_, it means that all of the maps of A have a bit that none of the maps of
+// B have, ie, A and B are guaranteed to not have a map in common.
+using MapMask = uint64_t;
+struct MapMaskAndOr {
+  MapMask or_ = 0;
+  MapMask and_ = -1ull;
+
+  bool operator==(const MapMaskAndOr& other) const {
+    return or_ == other.or_ && and_ == other.and_;
+  }
+
+  bool operator!=(const MapMaskAndOr& other) const { return !(*this == other); }
+};
+inline bool is_empty(MapMaskAndOr minmax) {
+  return minmax.or_ == 0 && minmax.and_ == -1ull;
+}
+inline MapMask ComputeMapHash(MapRef map) {
+  // `map.hash_value()` is probably not a good enough hash, since most user maps
+  // will have the same upper bits, so we re-hash. We're using xorshift64* (from
+  // "An experimental exploration of Marsaglia’s xorshift generators, scrambled"
+  // by Vigna in ACM Transactions on Mathematical Software, Volume 42).
+  MapMask hash = map.hash_value();
+  hash ^= hash >> 12;
+  hash ^= hash << 25;
+  hash ^= hash >> 27;
+  return hash * 0x2545f4914f6cdd1d;
+}
+inline MapMaskAndOr ComputeMinMaxHash(ZoneRefSet<Map> maps) {
+  MapMaskAndOr minmax;
+  for (MapRef map : maps) {
+    MapMask hash = ComputeMapHash(map);
+    minmax.or_ |= hash;
+    minmax.and_ &= hash;
+  }
+  return minmax;
+}
+inline MapMaskAndOr CombineMinMax(MapMaskAndOr a, MapMaskAndOr b) {
+  return {a.or_ | b.or_, a.and_ & b.and_};
+}
+// Returns true if {a} and {b} could have a map in common.
+inline bool CouldHaveSameMap(MapMaskAndOr a, MapMaskAndOr b) {
+  return ((a.and_ & b.or_) == a.and_) || ((b.and_ & a.or_) == b.and_);
+}
+
+// A Wrapper around a SnapshotTable, which takes care of mapping OpIndex to Key.
+// It uses a ZoneUnorderedMap to store this mapping, and is thus more
+// appropriate for cases where not many OpIndex have a corresponding key.
+template <class Value, class KeyData = NoKeyData>
+class SparseOpIndexSnapshotTable : public SnapshotTable<Value, KeyData> {
+ public:
+  using Base = SnapshotTable<Value, KeyData>;
+  using Key = typename SnapshotTable<Value, KeyData>::Key;
+
+  SparseOpIndexSnapshotTable(const Graph& graph, Zone* zone)
+      : Base(zone), indices_to_keys_(zone) {}
+
+  using Base::Get;
+  Value Get(OpIndex idx) const {
+    auto it = indices_to_keys_.find(idx);
+    if (it == indices_to_keys_.end()) return Value{};
+    return Base::Get(it->second);
+  }
+
+  using Base::Set;
+  bool Set(OpIndex idx, Value new_value) {
+    Key key = GetOrCreateKey(idx);
+    return Base::Set(key, new_value);
+  }
+
+  void NewKey(OpIndex idx, KeyData data, Value initial_value = Value{}) {
+    DCHECK(!indices_to_keys_[idx].has_value());
+    indices_to_keys_[idx] = Base::NewKey(data, initial_value);
+  }
+  void NewKey(OpIndex idx, Value initial_value = Value{}) {
+    NewKey(idx, KeyData{}, initial_value);
+  }
+
+  bool HasKeyFor(OpIndex idx) const {
+    return indices_to_keys_.find(idx) != indices_to_keys_.end();
+  }
+
+  base::Optional<Key> TryGetKeyFor(OpIndex idx) const {
+    auto it = indices_to_keys_.find(idx);
+    if (it != indices_to_keys_.end()) return it->second;
+    return base::nullopt;
+  }
+
+ private:
+  Key GetOrCreateKey(OpIndex idx) {
+    auto it = indices_to_keys_.find(idx);
+    if (it != indices_to_keys_.end()) return it->second;
+    Key key = Base::NewKey();
+    indices_to_keys_.insert({idx, key});
+    return key;
+  }
+  ZoneUnorderedMap<OpIndex, Key> indices_to_keys_;
+};
+
+struct MemoryAddress {
+  OpIndex base;
+  OpIndex index;
+  int32_t offset;
+  uint8_t element_size_log2;
+  uint8_t size;
+
+  bool operator==(const MemoryAddress& other) const {
+    return base == other.base && index == other.index &&
+           offset == other.offset &&
+           element_size_log2 == other.element_size_log2 && size == other.size;
+  }
+};
+
+inline size_t hash_value(MemoryAddress const& mem) {
+  return fast_hash_combine(mem.base, mem.index, mem.offset,
+                           mem.element_size_log2, mem.size);
+}
+
+struct KeyData {
+  using Key = SnapshotTableKey<OpIndex, KeyData>;
+  MemoryAddress mem;
+  // Pointers to the previous and the next Keys at the same base.
+  Key* prev_same_base = nullptr;
+  Key next_same_base = {};
+  // Pointers to either the next/previous Keys at the same offset.
+  Key* prev_same_offset = nullptr;
+  Key next_same_offset = {};
+};
+
+struct OffsetListTraits {
+  using T = SnapshotTable<OpIndex, KeyData>::Key;
+  static T** prev(T t) { return &(t.data().prev_same_offset); }
+  static T* next(T t) { return &(t.data().next_same_offset); }
+  static bool non_empty(T t) { return t.valid(); }
+};
+
+struct BaseListTraits {
+  using T = SnapshotTable<OpIndex, KeyData>::Key;
+  static T** prev(T t) { return &(t.data().prev_same_base); }
+  static T* next(T t) { return &(t.data().next_same_base); }
+  static bool non_empty(T t) { return t.valid(); }
+};
+
+struct BaseData {
+  using Key = SnapshotTable<OpIndex, KeyData>::Key;
+  // List of every value at this base that has an offset rather than an index.
+  DoublyThreadedList<Key, BaseListTraits> with_offsets;
+  // List of every value at this base that has a valid index.
+  DoublyThreadedList<Key, BaseListTraits> with_indices;
+};
+
+class MemoryContentTable
+    : public ChangeTrackingSnapshotTable<MemoryContentTable, OpIndex, KeyData> {
+ public:
+  explicit MemoryContentTable(
+      Zone* zone, SparseOpIndexSnapshotTable<bool>& non_aliasing_objects,
+      SparseOpIndexSnapshotTable<MapMaskAndOr>& object_maps,
+      FixedSidetable<OpIndex>& replacements)
+      : ChangeTrackingSnapshotTable(zone),
+        non_aliasing_objects_(non_aliasing_objects),
+        object_maps_(object_maps),
+        replacements_(replacements),
+        all_keys_(zone),
+        base_keys_(zone),
+        offset_keys_(zone) {}
+
+  void OnNewKey(Key key, OpIndex value) {
+    if (value.valid()) {
+      AddKeyInBaseOffsetMaps(key);
+    }
+  }
+
+  void OnValueChange(Key key, OpIndex old_value, OpIndex new_value) {
+    DCHECK_NE(old_value, new_value);
+    if (old_value.valid() && !new_value.valid()) {
+      RemoveKeyFromBaseOffsetMaps(key);
+    } else if (new_value.valid() && !old_value.valid()) {
+      AddKeyInBaseOffsetMaps(key);
+    } else {
+      DCHECK_EQ(new_value.valid(), old_value.valid());
+    }
+  }
+
+  // Invalidate all previous known memory that could alias with {store}. Returns
+  // the number of invalidated keys.
+  void Invalidate(const StoreOp& store) {
+    Invalidate(store.base(), store.index(), store.offset);
+  }
+
+  void Invalidate(OpIndex base, OpIndex index, int32_t offset) {
+    base = ResolveBase(base);
+
+    if (non_aliasing_objects_.Get(base)) {
+      // Since {base} is non-aliasing, it's enough to just iterate the values at
+      // this base.
+      auto base_keys = base_keys_.find(base);
+      if (base_keys == base_keys_.end()) return;
+      for (auto it = base_keys->second.with_offsets.begin();
+           it != base_keys->second.with_offsets.end();) {
+        Key key = *it;
+        DCHECK_EQ(key.data().mem.base, base);
+        DCHECK(!key.data().mem.index.valid());
+        if (index.valid() || offset == key.data().mem.offset) {
+          // Overwrites {key}.
+          it = base_keys->second.with_offsets.RemoveAt(it);
+          Set(key, OpIndex::Invalid());
+        } else {
+          ++it;
+        }
+      }
+      // Invalidating all of the value with valid Index at base {base}.
+      for (auto it = base_keys->second.with_indices.begin();
+           it != base_keys->second.with_indices.end();) {
+        Key key = *it;
+        DCHECK(key.data().mem.index.valid());
+        it = base_keys->second.with_indices.RemoveAt(it);
+        Set(key, OpIndex::Invalid());
+      }
+    } else {
+      // {base} could alias with other things, so we iterate the whole state.
+      if (index.valid()) {
+        // {index} could be anything, so we invalidate everything.
+        return InvalidateMaybeAliasing();
+      }
+
+      // Invalidating all of the values with valid Index.
+      // TODO(dmercadier): we could keep keys that don't alias here, but that
+      // would require doing a map lookup on the base of each key. A better
+      // alternative would probably be to have 2 {non_alias_index_keys_} and
+      // {maybe_alias_index_keys_} tables instead of just {index_keys_}. This
+      // has the downside that when a base stops being non-alias, all of its
+      // indexed memory cells have to be moved. This could be worked around by
+      // having these 2 tables contain BaseData.with_indices values instead of
+      // Keys, so that a whole BaseData.with_indices can be removed in a single
+      // operation from the global {non_alias_index_keys_}.
+      for (auto it = index_keys_.begin(); it != index_keys_.end();) {
+        Key key = *it;
+        it = index_keys_.RemoveAt(it);
+        Set(key, OpIndex::Invalid());
+      }
+
+      InvalidateAtOffset(offset, base);
+    }
+  }
+
+  // Invalidates all Keys that are not known as non-aliasing.
+  void InvalidateMaybeAliasing() {
+    // We find current active keys through {base_keys_} so that we can bail out
+    // for whole buckets non-aliasing buckets (if we had gone through
+    // {offset_keys_} instead, then for each key we would've had to check
+    // whether it was non-aliasing or not).
+    for (auto& base_keys : base_keys_) {
+      OpIndex base = base_keys.first;
+      if (non_aliasing_objects_.Get(base)) continue;
+      for (auto it = base_keys.second.with_offsets.begin();
+           it != base_keys.second.with_offsets.end();) {
+        Key key = *it;
+        // It's important to remove with RemoveAt before Setting the key to
+        // invalid, otherwise OnKeyChange will remove {key} from {base_keys},
+        // which will invalidate {it}.
+        it = base_keys.second.with_offsets.RemoveAt(it);
+        Set(key, OpIndex::Invalid());
+      }
+      for (auto it = base_keys.second.with_indices.begin();
+           it != base_keys.second.with_indices.end();) {
+        Key key = *it;
+        it = base_keys.second.with_indices.RemoveAt(it);
+        Set(key, OpIndex::Invalid());
+      }
+    }
+  }
+
+  OpIndex Find(const LoadOp& load) {
+    OpIndex base = ResolveBase(load.base());
+    OpIndex index = load.index();
+    int32_t offset = load.offset;
+    uint8_t element_size_log2 = index.valid() ? load.element_size_log2 : 0;
+    uint8_t size = load.loaded_rep.SizeInBytes();
+
+    MemoryAddress mem{base, index, offset, element_size_log2, size};
+    auto key = all_keys_.find(mem);
+    if (key == all_keys_.end()) return OpIndex::Invalid();
+    return Get(key->second);
+  }
+
+  void Insert(const StoreOp& store) {
+    OpIndex base = ResolveBase(store.base());
+    OpIndex index = store.index();
+    int32_t offset = store.offset;
+    uint8_t element_size_log2 = index.valid() ? store.element_size_log2 : 0;
+    OpIndex value = store.value();
+    uint8_t size = store.stored_rep.SizeInBytes();
+
+    if (store.kind.is_immutable) {
+      InsertImmutable(base, index, offset, element_size_log2, size, value);
+    } else {
+      Insert(base, index, offset, element_size_log2, size, value);
+    }
+  }
+
+  void Insert(const LoadOp& load, OpIndex load_idx) {
+    OpIndex base = ResolveBase(load.base());
+    OpIndex index = load.index();
+    int32_t offset = load.offset;
+    uint8_t element_size_log2 = index.valid() ? load.element_size_log2 : 0;
+    uint8_t size = load.loaded_rep.SizeInBytes();
+
+    if (load.kind.is_immutable) {
+      InsertImmutable(base, index, offset, element_size_log2, size, load_idx);
+    } else {
+      Insert(base, index, offset, element_size_log2, size, load_idx);
+    }
+  }
+
+#ifdef DEBUG
+  void Print() {
+    std::cout << "MemoryContentTable:\n";
+    for (const auto& base_keys : base_keys_) {
+      for (Key key : base_keys.second.with_offsets) {
+        std::cout << "  * " << key.data().mem.base << " - "
+                  << key.data().mem.index << " - " << key.data().mem.offset
+                  << " - " << key.data().mem.element_size_log2 << " ==> "
+                  << Get(key) << "\n";
+      }
+      for (Key key : base_keys.second.with_indices) {
+        std::cout << "  * " << key.data().mem.base << " - "
+                  << key.data().mem.index << " - " << key.data().mem.offset
+                  << " - " << key.data().mem.element_size_log2 << " ==> "
+                  << Get(key) << "\n";
+      }
+    }
+  }
+#endif
+
+ private:
+  void Insert(OpIndex base, OpIndex index, int32_t offset,
+              uint8_t element_size_log2, uint8_t size, OpIndex value) {
+    DCHECK_EQ(base, ResolveBase(base));
+
+    MemoryAddress mem{base, index, offset, element_size_log2, size};
+    auto existing_key = all_keys_.find(mem);
+    if (existing_key != all_keys_.end()) {
+      Set(existing_key->second, value);
+      return;
+    }
+
+    // Creating a new key.
+    Key key = NewKey({mem});
+    all_keys_.insert({mem, key});
+    Set(key, value);
+  }
+
+  void InsertImmutable(OpIndex base, OpIndex index, int32_t offset,
+                       uint8_t element_size_log2, uint8_t size, OpIndex value) {
+    DCHECK_EQ(base, ResolveBase(base));
+
+    MemoryAddress mem{base, index, offset, element_size_log2, size};
+    DCHECK_EQ(all_keys_.find(mem), all_keys_.end());
+
+    // Creating a new key.
+    Key key = NewKey({mem});
+    all_keys_.insert({mem, key});
+    // Call `SetNoNotify` to avoid calls to `OnNewKey` and `OnValueChanged`.
+    SetNoNotify(key, value);
+  }
+
+  void InvalidateAtOffset(int32_t offset, OpIndex base) {
+    MapMaskAndOr base_maps = object_maps_.Get(base);
+    auto offset_keys = offset_keys_.find(offset);
+    if (offset_keys == offset_keys_.end()) return;
+    for (auto it = offset_keys->second.begin();
+         it != offset_keys->second.end();) {
+      Key key = *it;
+      DCHECK_EQ(offset, key.data().mem.offset);
+      // It can overwrite previous stores to any base (except non-aliasing
+      // ones).
+      if (non_aliasing_objects_.Get(key.data().mem.base)) {
+        ++it;
+        continue;
+      }
+      MapMaskAndOr this_maps = key.data().mem.base == base
+                                   ? base_maps
+                                   : object_maps_.Get(key.data().mem.base);
+      if (!is_empty(base_maps) && !is_empty(this_maps) &&
+          !CouldHaveSameMap(base_maps, this_maps)) {
+        ++it;
+        continue;
+      }
+      it = offset_keys->second.RemoveAt(it);
+      Set(key, OpIndex::Invalid());
+    }
+  }
+
+  OpIndex ResolveBase(OpIndex base) {
+    while (replacements_[base] != OpIndex::Invalid()) {
+      base = replacements_[base];
+    }
+    return base;
+  }
+
+  void AddKeyInBaseOffsetMaps(Key key) {
+    // Inserting in {base_keys_}.
+    OpIndex base = key.data().mem.base;
+    auto base_keys = base_keys_.find(base);
+    if (base_keys != base_keys_.end()) {
+      if (key.data().mem.index.valid()) {
+        base_keys->second.with_indices.Add(key);
+      } else {
+        base_keys->second.with_offsets.Add(key);
+      }
+    } else {
+      BaseData data;
+      if (key.data().mem.index.valid()) {
+        data.with_indices.Add(key);
+      } else {
+        data.with_offsets.Add(key);
+      }
+      base_keys_.insert({base, std::move(data)});
+    }
+
+    if (key.data().mem.index.valid()) {
+      // Inserting in {index_keys_}
+      index_keys_.Add(key);
+    } else {
+      // Inserting in {offset_keys_}.
+      int offset = key.data().mem.offset;
+      auto offset_keys = offset_keys_.find(offset);
+      if (offset_keys != offset_keys_.end()) {
+        offset_keys->second.Add(key);
+      } else {
+        DoublyThreadedList<Key, OffsetListTraits> list;
+        list.Add(key);
+        offset_keys_.insert({offset, std::move(list)});
+      }
+    }
+  }
+
+  void RemoveKeyFromBaseOffsetMaps(Key key) {
+    // Removing from {base_keys_}.
+    DoublyThreadedList<Key, BaseListTraits>::Remove(key);
+    DoublyThreadedList<Key, OffsetListTraits>::Remove(key);
+  }
+
+  SparseOpIndexSnapshotTable<bool>& non_aliasing_objects_;
+  SparseOpIndexSnapshotTable<MapMaskAndOr>& object_maps_;
+  FixedSidetable<OpIndex>& replacements_;
+
+  // TODO(dmercadier): consider using a faster datastructure than
+  // ZoneUnorderedMap for {all_keys_}, {base_keys_} and {offset_keys_}.
+
+  // A map containing all of the keys, for fast lookup of a specific
+  // MemoryAddress.
+  ZoneUnorderedMap<MemoryAddress, Key> all_keys_;
+  // Map from base OpIndex to keys associated with this base.
+  ZoneUnorderedMap<OpIndex, BaseData> base_keys_;
+  // Map from offsets to keys associated with this offset.
+  ZoneUnorderedMap<int, DoublyThreadedList<Key, OffsetListTraits>> offset_keys_;
+
+  // List of all of the keys that have a valid index.
+  DoublyThreadedList<Key, OffsetListTraits> index_keys_;
+};
+
+class LateLoadEliminationAnalyzer {
+ public:
+  using AliasTable = SparseOpIndexSnapshotTable<bool>;
+  using AliasKey = AliasTable::Key;
+  using AliasSnapshot = AliasTable::Snapshot;
+
+  using MapTable = SparseOpIndexSnapshotTable<MapMaskAndOr>;
+  using MapKey = MapTable::Key;
+  using MapSnapshot = MapTable::Snapshot;
+
+  using MemoryKey = MemoryContentTable::Key;
+  using MemorySnapshot = MemoryContentTable::Snapshot;
+
+  LateLoadEliminationAnalyzer(Graph& graph, Zone* phase_zone,
+                              JSHeapBroker* broker)
+      : graph_(graph),
+        broker_(broker),
+        replacements_(graph.op_id_count(), phase_zone),
+        non_aliasing_objects_(graph, phase_zone),
+        object_maps_(graph, phase_zone),
+        memory_(phase_zone, non_aliasing_objects_, object_maps_, replacements_),
+        block_to_snapshot_mapping_(graph.block_count(), phase_zone),
+        predecessor_alias_snapshots_(phase_zone),
+        predecessor_maps_snapshots_(phase_zone),
+        predecessor_memory_snapshots_(phase_zone) {}
+
+  void Run() {
+    bool compute_start_snapshot = true;
+    for (uint32_t block_index = 0; block_index < graph_.block_count();
+         block_index++) {
+      const Block& block = graph_.Get(BlockIndex{block_index});
+
+      ProcessBlock(block, compute_start_snapshot);
+      compute_start_snapshot = true;
+
+      // Consider re-processing for loops.
+      if (const GotoOp* last = block.LastOperation(graph_).TryCast<GotoOp>()) {
+        if (last->destination->IsLoop() &&
+            last->destination->LastPredecessor() == &block) {
+          const Block* loop_header = last->destination;
+          // {block} is the backedge of a loop. We recompute the loop header's
+          // initial snapshots, and if they differ from its original snapshot,
+          // then we revisit the loop.
+          if (BeginBlock<true>(loop_header)) {
+            // We set the snapshot of the loop's 1st predecessor to the newly
+            // computed snapshot. It's not quite correct, but this predecessor
+            // is guaranteed to end with a Goto, and we are now visiting the
+            // loop, which means that we don't really care about this
+            // predecessor anymore.
+            // The reason for saving this snapshot is to prevent inifinite
+            // looping, since the next time we reach this point, the backedge
+            // snapshot could still invalidate things from the forward edge
+            // snapshot. By restricting the forward edge snapshot, we prevent
+            // this.
+            const Block* loop_1st_pred =
+                loop_header->LastPredecessor()->NeighboringPredecessor();
+            FinishBlock(loop_1st_pred);
+            // And we start a new fresh snapshot from this predecessor.
+            auto pred_snapshots =
+                block_to_snapshot_mapping_[loop_1st_pred->index()];
+            non_aliasing_objects_.StartNewSnapshot(
+                pred_snapshots->alias_snapshot);
+            object_maps_.StartNewSnapshot(pred_snapshots->maps_snapshot);
+            memory_.StartNewSnapshot(pred_snapshots->memory_snapshot);
+
+            block_index = loop_header->index().id() - 1;
+            compute_start_snapshot = false;
+          } else {
+            SealAndDiscard();
+          }
+        }
+      }
+    }
+  }
+
+  OpIndex Replacement(OpIndex index) {
+    DCHECK(graph_.Get(index).Is<LoadOp>());
+    return replacements_[index];
+  }
+
+ private:
+  // During the 1st visit of a loop, we set its status to kFirstVisit. If it
+  // needs revisiting, we set it to kNeedsRevisit. During the 2nd visit, we set
+  // it to kSecondVisit. We never move status from kSecondVisit to kNeedsRevisit
+  // (= we only visit loops at most twice) or from kNeedsRevisit to kFirstVisit.
+  enum LoopStatus { kFirstVisit, kNeedsRevisit, kSecondVisit };
+  void ProcessBlock(const Block& block, bool compute_start_snapshot);
+  void ProcessLoad(OpIndex op_idx, const LoadOp& op);
+  void ProcessStore(OpIndex op_idx, const StoreOp& op);
+  void ProcessAllocate(OpIndex op_idx, const AllocateOp& op);
+  void ProcessCall(OpIndex op_idx, const CallOp& op);
+  void ProcessPhi(OpIndex op_idx, const PhiOp& op);
+  void ProcessAssumeMap(OpIndex op_idx, const AssumeMapOp& op);
+
+  // BeginBlock initializes the various SnapshotTables for {block}, and returns
+  // true if {block} is a loop that should be revisited.
+  template <bool for_loop_revisit = false>
+  bool BeginBlock(const Block* block);
+  void FinishBlock(const Block* block);
+  // Seals the current snapshot, but discards it. This is used when considering
+  // whether a loop should be revisited or not: we recompute the loop header's
+  // snapshots, and then revisit the loop if the snapshots contain
+  // modifications. If the snapshots are unchanged, we discard them and don't
+  // revisit the loop.
+  void SealAndDiscard();
+
+  void InvalidateIfAlias(OpIndex op_idx);
+
+  Graph& graph_;
+  JSHeapBroker* broker_;
+
+  FixedSidetable<OpIndex> replacements_;
+
+  // TODO(dmercadier): {non_aliasing_objects_} tends to be weak for
+  // backing-stores, because they are often stored into an object right after
+  // being created, and often don't have other aliases throughout their
+  // lifetime. It would be more useful to have a more precise tracking of
+  // aliases. Storing a non-aliasing object into a potentially-aliasing one
+  // probably always means that the former becomes potentially-aliasing.
+  // However, storing a non-aliasing object into another non-aliasing object
+  // should be reasonably not-too-hard to track.
+  AliasTable non_aliasing_objects_;
+  MapTable object_maps_;
+  MemoryContentTable memory_;
+
+  struct Snapshot {
+    AliasSnapshot alias_snapshot;
+    MapSnapshot maps_snapshot;
+    MemorySnapshot memory_snapshot;
+  };
+  FixedSidetable<base::Optional<Snapshot>, BlockIndex>
+      block_to_snapshot_mapping_;
+
+  // {predecessor_alias_napshots_}, {predecessor_maps_snapshots_} and
+  // {predecessor_memory_snapshots_} are used as temporary vectors when starting
+  // to process a block. We store them as members to avoid reallocation.
+  ZoneVector<AliasSnapshot> predecessor_alias_snapshots_;
+  ZoneVector<MapSnapshot> predecessor_maps_snapshots_;
+  ZoneVector<MemorySnapshot> predecessor_memory_snapshots_;
+};
+
+template <class Next>
+class LateLoadEliminationReducer : public Next {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  void Analyze() {
+    if (v8_flags.turboshaft_load_elimination) {
+      DCHECK(AllowHandleDereference::IsAllowed());
+      analyzer_.Run();
+      Next::Analyze();
+    }
+  }
+
+  OpIndex REDUCE_INPUT_GRAPH(Load)(OpIndex ig_index, const LoadOp& load) {
+    if (v8_flags.turboshaft_load_elimination) {
+      OpIndex ig_replacement_index = analyzer_.Replacement(ig_index);
+      if (ig_replacement_index.valid()) {
+        OpIndex replacement = Asm().MapToNewGraph(ig_replacement_index);
+        DCHECK(Asm()
+                   .output_graph()
+                   .Get(replacement)
+                   .outputs_rep()[0]
+                   .AllowImplicitRepresentationChangeTo(load.outputs_rep()[0]));
+        return replacement;
+      }
+    }
+    return Next::ReduceInputGraphLoad(ig_index, load);
+  }
+
+  OpIndex REDUCE(AssumeMap)(OpIndex, ZoneRefSet<Map>) {
+    // AssumeMaps are currently not used after Load Elimination. We thus remove
+    // them now. If they ever become needed for later optimizations, we could
+    // consider leaving them in the graph and just ignoring them in the
+    // Instruction Selector.
+    return OpIndex::Invalid();
+  }
+
+ private:
+  LateLoadEliminationAnalyzer analyzer_{Asm().modifiable_input_graph(),
+                                        Asm().phase_zone(),
+                                        PipelineData::Get().broker()};
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_LATE_LOAD_ELIMINATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/layered-hash-map.h b/deps/v8/src/compiler/turboshaft/layered-hash-map.h
index a481a8ddc85c82..6c5eaa566a32c1 100644
--- a/deps/v8/src/compiler/turboshaft/layered-hash-map.h
+++ b/deps/v8/src/compiler/turboshaft/layered-hash-map.h
@@ -85,7 +85,7 @@ LayeredHashMap<Key, Value>::LayeredHashMap(Zone* zone,
   initial_capacity = base::bits::RoundUpToPowerOfTwo32(initial_capacity);
   mask_ = initial_capacity - 1;
   // Allocating the table_
-  table_ = zone_->NewVector(initial_capacity, Entry());
+  table_ = zone_->NewVector<Entry>(initial_capacity);
 }
 
 template <class Key, class Value>
@@ -97,6 +97,7 @@ template <class Key, class Value>
 void LayeredHashMap<Key, Value>::DropLastLayer() {
   DCHECK_GT(depths_heads_.size(), 0);
   for (Entry* entry = depths_heads_.back(); entry != nullptr;) {
+    entry_count_--;
     Entry* next = entry->depth_neighboring_entry;
     *entry = Entry();
     entry = next;
@@ -121,6 +122,7 @@ void LayeredHashMap<Key, Value>::InsertNewKey(Key key, Value value) {
   DCHECK_EQ(destination->hash, 0);
   *destination = Entry{hash, key, value, depths_heads_.back()};
   depths_heads_.back() = destination;
+  entry_count_++;
 }
 
 template <class Key, class Value>
@@ -139,7 +141,7 @@ template <class Key, class Value>
 void LayeredHashMap<Key, Value>::ResizeIfNeeded() {
   if (table_.size() * kNeedResizePercentage > entry_count_) return;
   CHECK_LE(table_.size(), std::numeric_limits<size_t>::max() / kGrowthFactor);
-  table_ = zone_->NewVector<Entry>(table_.size() * kGrowthFactor, Entry());
+  table_ = zone_->NewVector<Entry>(table_.size() * kGrowthFactor);
   mask_ = table_.size() - 1;
   DCHECK_EQ(base::bits::CountPopulation(mask_),
             sizeof(mask_) * 8 - base::bits::CountLeadingZeros(mask_));
diff --git a/deps/v8/src/compiler/turboshaft/machine-lowering-phase.cc b/deps/v8/src/compiler/turboshaft/machine-lowering-phase.cc
index 5473164a31c6bb..c0c14424c5cd49 100644
--- a/deps/v8/src/compiler/turboshaft/machine-lowering-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/machine-lowering-phase.cc
@@ -4,18 +4,30 @@
 
 #include "src/compiler/turboshaft/machine-lowering-phase.h"
 
+#include "src/compiler/turboshaft/fast-api-call-reducer.h"
 #include "src/compiler/turboshaft/machine-lowering-reducer.h"
+#include "src/compiler/turboshaft/machine-optimization-reducer.h"
+#include "src/compiler/turboshaft/required-optimization-reducer.h"
+#include "src/compiler/turboshaft/select-lowering-reducer.h"
 #include "src/compiler/turboshaft/variable-reducer.h"
 #include "src/heap/factory-inl.h"
 
 namespace v8::internal::compiler::turboshaft {
 
-void MachineLoweringPhase::Run(PipelineData* data, Zone* temp_zone) {
-  turboshaft::OptimizationPhase<turboshaft::MachineLoweringReducer,
-                                turboshaft::VariableReducer>::
-      Run(data->isolate(), &data->graph(), temp_zone, data->node_origins(),
-          std::tuple{turboshaft::MachineLoweringReducerArgs{
-              data->isolate()->factory(), data->isolate()}});
+void MachineLoweringPhase::Run(Zone* temp_zone) {
+  if (v8_flags.turboshaft_machine_lowering_opt) {
+    turboshaft::OptimizationPhase<
+        turboshaft::VariableReducer, turboshaft::MachineLoweringReducer,
+        turboshaft::FastApiCallReducer, turboshaft::RequiredOptimizationReducer,
+        turboshaft::SelectLoweringReducer,
+        turboshaft::MachineOptimizationReducerSignallingNanImpossible>::
+        Run(temp_zone);
+  } else {
+    turboshaft::OptimizationPhase<
+        turboshaft::VariableReducer, turboshaft::MachineLoweringReducer,
+        turboshaft::FastApiCallReducer, turboshaft::RequiredOptimizationReducer,
+        turboshaft::SelectLoweringReducer>::Run(temp_zone);
+  }
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/machine-lowering-phase.h b/deps/v8/src/compiler/turboshaft/machine-lowering-phase.h
index 468e627f526910..a0f1dd8c630391 100644
--- a/deps/v8/src/compiler/turboshaft/machine-lowering-phase.h
+++ b/deps/v8/src/compiler/turboshaft/machine-lowering-phase.h
@@ -12,7 +12,7 @@ namespace v8::internal::compiler::turboshaft {
 struct MachineLoweringPhase {
   DECL_TURBOSHAFT_PHASE_CONSTANTS(MachineLowering)
 
-  void Run(PipelineData* data, Zone* temp_zone);
+  void Run(Zone* temp_zone);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/machine-lowering-reducer.h b/deps/v8/src/compiler/turboshaft/machine-lowering-reducer.h
index 41199bec375be7..19b5836b6f3364 100644
--- a/deps/v8/src/compiler/turboshaft/machine-lowering-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/machine-lowering-reducer.h
@@ -5,19 +5,28 @@
 #ifndef V8_COMPILER_TURBOSHAFT_MACHINE_LOWERING_REDUCER_H_
 #define V8_COMPILER_TURBOSHAFT_MACHINE_LOWERING_REDUCER_H_
 
+#include "src/base/logging.h"
 #include "src/base/v8-fallthrough.h"
+#include "src/codegen/external-reference.h"
+#include "src/codegen/machine-type.h"
 #include "src/common/globals.h"
 #include "src/compiler/access-builder.h"
 #include "src/compiler/feedback-source.h"
 #include "src/compiler/globals.h"
 #include "src/compiler/linkage.h"
+#include "src/compiler/node-matchers.h"
+#include "src/compiler/operator.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/compiler/turboshaft/assembler.h"
 #include "src/compiler/turboshaft/index.h"
 #include "src/compiler/turboshaft/operations.h"
 #include "src/compiler/turboshaft/optimization-phase.h"
+#include "src/compiler/turboshaft/phase.h"
 #include "src/compiler/turboshaft/reducer-traits.h"
 #include "src/compiler/turboshaft/representations.h"
+#include "src/compiler/write-barrier-kind.h"
+#include "src/deoptimizer/deoptimize-reason.h"
+#include "src/execution/frame-constants.h"
 #include "src/objects/bigint.h"
 #include "src/objects/heap-number.h"
 #include "src/objects/instance-type.h"
@@ -29,11 +38,6 @@ namespace v8::internal::compiler::turboshaft {
 
 #include "src/compiler/turboshaft/define-assembler-macros.inc"
 
-struct MachineLoweringReducerArgs {
-  Factory* factory;
-  Isolate* isolate;
-};
-
 // MachineLoweringReducer, formerly known as EffectControlLinearizer, lowers
 // simplified operations to machine operations.
 template <typename Next>
@@ -41,15 +45,6 @@ class MachineLoweringReducer : public Next {
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
-  using ArgT =
-      base::append_tuple_type<typename Next::ArgT, MachineLoweringReducerArgs>;
-
-  template <typename... Args>
-  explicit MachineLoweringReducer(const std::tuple<Args...>& args)
-      : Next(args),
-        factory_(std::get<MachineLoweringReducerArgs>(args).factory),
-        isolate_(std::get<MachineLoweringReducerArgs>(args).isolate) {}
-
   bool NeedsHeapObjectCheck(ObjectIsOp::InputAssumptions input_assumptions) {
     // TODO(nicohartmann@): Consider type information once we have that.
     switch (input_assumptions) {
@@ -61,10 +56,10 @@ class MachineLoweringReducer : public Next {
     }
   }
 
-  OpIndex ReduceChangeOrDeopt(OpIndex input, OpIndex frame_state,
-                              ChangeOrDeoptOp::Kind kind,
-                              CheckForMinusZeroMode minus_zero_mode,
-                              const FeedbackSource& feedback) {
+  OpIndex REDUCE(ChangeOrDeopt)(OpIndex input, OpIndex frame_state,
+                                ChangeOrDeoptOp::Kind kind,
+                                CheckForMinusZeroMode minus_zero_mode,
+                                const FeedbackSource& feedback) {
     switch (kind) {
       case ChangeOrDeoptOp::Kind::kUint32ToInt32: {
         __ DeoptimizeIf(__ Int32LessThan(input, 0), frame_state,
@@ -72,8 +67,7 @@ class MachineLoweringReducer : public Next {
         return input;
       }
       case ChangeOrDeoptOp::Kind::kInt64ToInt32: {
-        // Int64 is truncated to Int32 implicitly.
-        V<Word32> i32 = input;
+        V<Word32> i32 = __ TruncateWord64ToWord32(input);
         __ DeoptimizeIfNot(__ Word64Equal(__ ChangeInt32ToInt64(i32), input),
                            frame_state, DeoptimizeReason::kLostPrecision,
                            feedback);
@@ -83,8 +77,7 @@ class MachineLoweringReducer : public Next {
         __ DeoptimizeIfNot(
             __ Uint64LessThanOrEqual(input, static_cast<uint64_t>(kMaxInt)),
             frame_state, DeoptimizeReason::kLostPrecision, feedback);
-        // Uint64 is truncated to Int32 implicitly
-        return input;
+        return __ TruncateWord64ToWord32(input);
       }
       case ChangeOrDeoptOp::Kind::kUint64ToInt64: {
         __ DeoptimizeIfNot(__ Uint64LessThanOrEqual(
@@ -101,7 +94,7 @@ class MachineLoweringReducer : public Next {
 
         if (minus_zero_mode == CheckForMinusZeroMode::kCheckForMinusZero) {
           // Check if {value} is -0.
-          IF_UNLIKELY(__ Word32Equal(i32, 0)) {
+          IF(UNLIKELY(__ Word32Equal(i32, 0))) {
             // In case of 0, we need to check the high bits for the IEEE -0
             // pattern.
             V<Word32> check_negative =
@@ -115,14 +108,14 @@ class MachineLoweringReducer : public Next {
         return i32;
       }
       case ChangeOrDeoptOp::Kind::kFloat64ToInt64: {
-        V<Word64> i64 = __ TruncateFloat64ToInt64OverflowUndefined(input);
+        V<Word64> i64 = __ TruncateFloat64ToInt64OverflowToMin(input);
         __ DeoptimizeIfNot(__ Float64Equal(__ ChangeInt64ToFloat64(i64), input),
                            frame_state, DeoptimizeReason::kLostPrecisionOrNaN,
                            feedback);
 
         if (minus_zero_mode == CheckForMinusZeroMode::kCheckForMinusZero) {
           // Check if {value} is -0.
-          IF_UNLIKELY(__ Word64Equal(i64, 0)) {
+          IF(UNLIKELY(__ Word64Equal(i64, 0))) {
             // In case of 0, we need to check the high bits for the IEEE -0
             // pattern.
             V<Word32> check_negative =
@@ -135,12 +128,54 @@ class MachineLoweringReducer : public Next {
 
         return i64;
       }
+      case ChangeOrDeoptOp::Kind::kFloat64NotHole: {
+        // First check whether {value} is a NaN at all...
+        IF_NOT (LIKELY(__ Float64Equal(input, input))) {
+          // ...and only if {value} is a NaN, perform the expensive bit
+          // check. See http://crbug.com/v8/8264 for details.
+          __ DeoptimizeIf(__ Word32Equal(__ Float64ExtractHighWord32(input),
+                                         kHoleNanUpper32),
+                          frame_state, DeoptimizeReason::kHole, feedback);
+        }
+        END_IF
+        return input;
+      }
     }
     UNREACHABLE();
   }
 
-  V<Word32> ReduceObjectIs(V<Tagged> input, ObjectIsOp::Kind kind,
-                           ObjectIsOp::InputAssumptions input_assumptions) {
+  OpIndex REDUCE(DeoptimizeIf)(OpIndex condition, OpIndex frame_state,
+                               bool negated,
+                               const DeoptimizeParameters* parameters) {
+    LABEL_BLOCK(no_change) {
+      return Next::ReduceDeoptimizeIf(condition, frame_state, negated,
+                                      parameters);
+    }
+    if (ShouldSkipOptimizationStep()) goto no_change;
+    // Block cloning only works for branches, but not for `DeoptimizeIf`. On the
+    // other hand, explicit control flow makes the overall pipeline and
+    // escpecially the register allocator slower. So we only switch a
+    // `DeoptiomizeIf` to a branch if it has a phi input, which indicates that
+    // block cloning could be helpful.
+    if (__ Get(condition).template Is<PhiOp>()) {
+      if (negated) {
+        IF_NOT (LIKELY(condition)) {
+          __ Deoptimize(frame_state, parameters);
+        }
+        END_IF
+      } else {
+        IF (UNLIKELY(condition)) {
+          __ Deoptimize(frame_state, parameters);
+        }
+        END_IF
+      }
+      return OpIndex::Invalid();
+    }
+    goto no_change;
+  }
+
+  V<Word32> REDUCE(ObjectIs)(V<Tagged> input, ObjectIsOp::Kind kind,
+                             ObjectIsOp::InputAssumptions input_assumptions) {
     switch (kind) {
       case ObjectIsOp::Kind::kBigInt:
       case ObjectIsOp::Kind::kBigInt64: {
@@ -151,11 +186,11 @@ class MachineLoweringReducer : public Next {
         if (input_assumptions != ObjectIsOp::InputAssumptions::kBigInt) {
           if (NeedsHeapObjectCheck(input_assumptions)) {
             // Check for Smi.
-            GOTO_IF(IsSmi(input), done, 0);
+            GOTO_IF(__ IsSmi(input), done, 0);
           }
 
           // Check for BigInt.
-          V<Tagged> map = __ LoadMapField(input);
+          V<Map> map = __ LoadMapField(input);
           V<Word32> is_bigint_map =
               __ TaggedEqual(map, __ HeapConstant(factory_->bigint_map()));
           GOTO_IF_NOT(is_bigint_map, done, 0);
@@ -212,11 +247,11 @@ class MachineLoweringReducer : public Next {
 
         // Check for Smi if necessary.
         if (NeedsHeapObjectCheck(input_assumptions)) {
-          GOTO_IF(IsSmi(input), done, 0);
+          GOTO_IF(UNLIKELY(__ IsSmi(input)), done, 0);
         }
 
         // Load bitfield from map.
-        V<Tagged> map = __ LoadMapField(input);
+        V<Map> map = __ LoadMapField(input);
         V<Word32> bitfield =
             __ template LoadField<Word32>(map, AccessBuilder::ForMapBitField());
 
@@ -248,21 +283,24 @@ class MachineLoweringReducer : public Next {
             GOTO_IF_NOT(check, done, 0);
             // Fallthrough into receiver check.
             V8_FALLTHROUGH;
-          case ObjectIsOp::Kind::kReceiver: {
-            static_assert(LAST_TYPE == LAST_JS_RECEIVER_TYPE);
-            V<Word32> instance_type = __ template LoadField<Word32>(
-                map, AccessBuilder::ForMapInstanceType());
-            check =
-                __ Uint32LessThanOrEqual(FIRST_JS_RECEIVER_TYPE, instance_type);
+          case ObjectIsOp::Kind::kReceiver:
+            check = JSAnyIsNotPrimitiveHeapObject(input, map);
             break;
-          }
           case ObjectIsOp::Kind::kReceiverOrNullOrUndefined: {
+#if V8_STATIC_ROOTS_BOOL
+            V<Word32> check0 = JSAnyIsNotPrimitiveHeapObject(input, map);
+            V<Word32> check1 = __ TaggedEqual(
+                input, __ HeapConstant(factory_->undefined_value()));
+            V<Word32> check2 =
+                __ TaggedEqual(input, __ HeapConstant(factory_->null_value()));
+            check =
+                __ Word32BitwiseOr(check0, __ Word32BitwiseOr(check1, check2));
+#else
             static_assert(LAST_PRIMITIVE_HEAP_OBJECT_TYPE == ODDBALL_TYPE);
             static_assert(LAST_TYPE == LAST_JS_RECEIVER_TYPE);
             // Rule out all primitives except oddballs (true, false, undefined,
             // null).
-            V<Word32> instance_type = __ template LoadField<Word32>(
-                map, AccessBuilder::ForMapInstanceType());
+            V<Word32> instance_type = __ LoadInstanceTypeField(map);
             GOTO_IF_NOT(__ Uint32LessThanOrEqual(ODDBALL_TYPE, instance_type),
                         done, 0);
 
@@ -270,6 +308,7 @@ class MachineLoweringReducer : public Next {
             check = __ Word32Equal(
                 0,
                 __ TaggedEqual(map, __ HeapConstant(factory_->boolean_map())));
+#endif  // V8_STATIC_ROOTS_BOOL
             break;
           }
           case ObjectIsOp::Kind::kUndetectable:
@@ -291,17 +330,17 @@ class MachineLoweringReducer : public Next {
         if (!NeedsHeapObjectCheck(input_assumptions)) {
           return __ Word32Constant(0);
         }
-        return IsSmi(input);
+        return __ IsSmi(input);
       }
       case ObjectIsOp::Kind::kNumber: {
         Label<Word32> done(this);
 
         // Check for Smi if necessary.
         if (NeedsHeapObjectCheck(input_assumptions)) {
-          GOTO_IF(IsSmi(input), done, 1);
+          GOTO_IF(__ IsSmi(input), done, 1);
         }
 
-        V<Tagged> map = __ LoadMapField(input);
+        V<Map> map = __ LoadMapField(input);
         GOTO(done,
              __ TaggedEqual(map, __ HeapConstant(factory_->heap_number_map())));
 
@@ -315,13 +354,12 @@ class MachineLoweringReducer : public Next {
 
         // Check for Smi if necessary.
         if (NeedsHeapObjectCheck(input_assumptions)) {
-          GOTO_IF(IsSmi(input), done, 0);
+          GOTO_IF(__ IsSmi(input), done, 0);
         }
 
         // Load instance type from map.
-        V<Tagged> map = __ LoadMapField(input);
-        V<Word32> instance_type = __ template LoadField<Word32>(
-            map, AccessBuilder::ForMapInstanceType());
+        V<Map> map = __ LoadMapField(input);
+        V<Word32> instance_type = __ LoadInstanceTypeField(map);
 
         V<Word32> check;
         switch (kind) {
@@ -348,9 +386,8 @@ class MachineLoweringReducer : public Next {
       case ObjectIsOp::Kind::kInternalizedString: {
         DCHECK_EQ(input_assumptions, ObjectIsOp::InputAssumptions::kHeapObject);
         // Load instance type from map.
-        V<Tagged> map = __ LoadMapField(input);
-        V<Word32> instance_type = __ template LoadField<Word32>(
-            map, AccessBuilder::ForMapInstanceType());
+        V<Map> map = __ LoadMapField(input);
+        V<Word32> instance_type = __ LoadInstanceTypeField(map);
 
         return __ Word32Equal(
             __ Word32BitwiseAnd(instance_type,
@@ -362,12 +399,59 @@ class MachineLoweringReducer : public Next {
     UNREACHABLE();
   }
 
-  V<Word32> ReduceFloatIs(OpIndex input, FloatIsOp::Kind kind,
-                          FloatRepresentation input_rep) {
+  V<Word32> REDUCE(FloatIs)(OpIndex value, NumericKind kind,
+                            FloatRepresentation input_rep) {
     DCHECK_EQ(input_rep, FloatRepresentation::Float64());
     switch (kind) {
-      case FloatIsOp::Kind::kNaN: {
-        OpIndex diff = __ Float64Equal(input, input);
+      case NumericKind::kFloat64Hole: {
+        Label<Word32> done(this);
+        // First check whether {value} is a NaN at all...
+        GOTO_IF(LIKELY(__ Float64Equal(value, value)), done, 0);
+        // ...and only if {value} is a NaN, perform the expensive bit
+        // check. See http://crbug.com/v8/8264 for details.
+        GOTO(done, __ Word32Equal(__ Float64ExtractHighWord32(value),
+                                  kHoleNanUpper32));
+        BIND(done, result);
+        return result;
+      }
+      case NumericKind::kFinite: {
+        V<Float64> diff = __ Float64Sub(value, value);
+        return __ Float64Equal(diff, diff);
+      }
+      case NumericKind::kInteger: {
+        V<Float64> trunc = __ Float64RoundToZero(value);
+        V<Float64> diff = __ Float64Sub(value, trunc);
+        return __ Float64Equal(diff, 0.0);
+      }
+      case NumericKind::kSafeInteger: {
+        Label<Word32> done(this);
+        V<Float64> trunc = __ Float64RoundToZero(value);
+        V<Float64> diff = __ Float64Sub(value, trunc);
+        GOTO_IF_NOT(__ Float64Equal(diff, 0), done, 0);
+        V<Word32> in_range =
+            __ Float64LessThanOrEqual(__ Float64Abs(trunc), kMaxSafeInteger);
+        GOTO(done, in_range);
+
+        BIND(done, result);
+        return result;
+      }
+      case NumericKind::kMinusZero: {
+        if (Is64()) {
+          V<Word64> value64 = __ BitcastFloat64ToWord64(value);
+          return __ Word64Equal(value64, kMinusZeroBits);
+        } else {
+          Label<Word32> done(this);
+          V<Word32> value_lo = __ Float64ExtractLowWord32(value);
+          GOTO_IF_NOT(__ Word32Equal(value_lo, kMinusZeroLoBits), done, 0);
+          V<Word32> value_hi = __ Float64ExtractHighWord32(value);
+          GOTO(done, __ Word32Equal(value_hi, kMinusZeroHiBits));
+
+          BIND(done, result);
+          return result;
+        }
+      }
+      case NumericKind::kNaN: {
+        V<Word32> diff = __ Float64Equal(value, value);
         return __ Word32Equal(diff, 0);
       }
     }
@@ -375,13 +459,86 @@ class MachineLoweringReducer : public Next {
     UNREACHABLE();
   }
 
-  OpIndex ReduceConvertToObject(
-      OpIndex input, ConvertToObjectOp::Kind kind,
+  V<Word32> REDUCE(ObjectIsNumericValue)(V<Object> input, NumericKind kind,
+                                         FloatRepresentation input_rep) {
+    DCHECK_EQ(input_rep, FloatRepresentation::Float64());
+    Label<Word32> done(this);
+
+    switch (kind) {
+      case NumericKind::kFinite:
+      case NumericKind::kInteger:
+      case NumericKind::kSafeInteger:
+        GOTO_IF(__ IsSmi(input), done, 1);
+        break;
+      case NumericKind::kMinusZero:
+      case NumericKind::kNaN:
+        GOTO_IF(__ IsSmi(input), done, 0);
+        break;
+      case NumericKind::kFloat64Hole:
+        // ObjectIsFloat64Hole is not used, but can be implemented when needed.
+        UNREACHABLE();
+    }
+
+    V<Map> map = __ LoadMapField(input);
+    GOTO_IF_NOT(
+        __ TaggedEqual(map, __ HeapConstant(factory_->heap_number_map())), done,
+        0);
+
+    V<Float64> value = __ template LoadField<Float64>(
+        input, AccessBuilder::ForHeapNumberValue());
+    GOTO(done, __ FloatIs(value, kind, input_rep));
+
+    BIND(done, result);
+    return result;
+  }
+
+  V<Object> REDUCE(Convert)(V<Object> input, ConvertOp::Kind from,
+                            ConvertOp::Kind to) {
+    switch (to) {
+      case ConvertOp::Kind::kNumber: {
+        if (from == ConvertOp::Kind::kPlainPrimitive) {
+          return __ CallBuiltin_PlainPrimitiveToNumber(
+              isolate_, V<PlainPrimitive>::Cast(input));
+        } else {
+          DCHECK_EQ(from, ConvertOp::Kind::kString);
+          return __ CallBuiltin_StringToNumber(isolate_,
+                                               V<String>::Cast(input));
+        }
+      }
+      case ConvertOp::Kind::kBoolean: {
+        DCHECK_EQ(from, ConvertOp::Kind::kObject);
+        return __ CallBuiltin_ToBoolean(isolate_, input);
+      }
+      case ConvertOp::Kind::kString: {
+        DCHECK_EQ(from, ConvertOp::Kind::kNumber);
+        return __ CallBuiltin_NumberToString(isolate_, V<Number>::Cast(input));
+      }
+      case ConvertOp::Kind::kSmi: {
+        DCHECK_EQ(from, ConvertOp::Kind::kNumberOrOddball);
+        Label<Smi> done(this);
+        GOTO_IF(LIKELY(__ ObjectIsSmi(input)), done, V<Smi>::Cast(input));
+
+        STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
+                                          Oddball::kToNumberRawOffset);
+        V<Float64> value = __ template LoadField<Float64>(
+            input, AccessBuilder::ForHeapNumberValue());
+        GOTO(done, __ TagSmi(__ ReversibleFloat64ToInt32(value)));
+
+        BIND(done, result);
+        return result;
+      }
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  V<Object> REDUCE(ConvertUntaggedToJSPrimitive)(
+      OpIndex input, ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind kind,
       RegisterRepresentation input_rep,
-      ConvertToObjectOp::InputInterpretation input_interpretation,
+      ConvertUntaggedToJSPrimitiveOp::InputInterpretation input_interpretation,
       CheckForMinusZeroMode minus_zero_mode) {
     switch (kind) {
-      case ConvertToObjectOp::Kind::kBigInt: {
+      case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kBigInt: {
         DCHECK(Is64());
         DCHECK_EQ(input_rep, RegisterRepresentation::Word64());
         Label<Tagged> done(this);
@@ -390,43 +547,48 @@ class MachineLoweringReducer : public Next {
         GOTO_IF(__ Word64Equal(input, int64_t{0}), done,
                 AllocateBigInt(OpIndex::Invalid(), OpIndex::Invalid()));
 
+        // The GOTO_IF above could have been changed to an unconditional GOTO,
+        // in which case we are now in unreachable code, so we can skip the
+        // following step and return.
         if (input_interpretation ==
-            ConvertToObjectOp::InputInterpretation::kSigned) {
+            ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned) {
           // Shift sign bit into BigInt's sign bit position.
           V<Word32> bitfield = __ Word32BitwiseOr(
               BigInt::LengthBits::encode(1),
-              __ Word64ShiftRightLogical(
-                  input, static_cast<int64_t>(63 - BigInt::SignBits::kShift)));
+              __ TruncateWord64ToWord32(__ Word64ShiftRightLogical(
+                  input, static_cast<int32_t>(63 - BigInt::SignBits::kShift))));
 
           // We use (value XOR (value >> 63)) - (value >> 63) to compute the
           // absolute value, in a branchless fashion.
           V<Word64> sign_mask =
-              __ Word64ShiftRightArithmetic(input, int64_t{63});
+              __ Word64ShiftRightArithmetic(input, int32_t{63});
           V<Word64> absolute_value =
               __ Word64Sub(__ Word64BitwiseXor(input, sign_mask), sign_mask);
           GOTO(done, AllocateBigInt(bitfield, absolute_value));
         } else {
-          DCHECK_EQ(input_interpretation,
-                    ConvertToObjectOp::InputInterpretation::kUnsigned);
+          DCHECK_EQ(
+              input_interpretation,
+              ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kUnsigned);
           const auto bitfield = BigInt::LengthBits::encode(1);
           GOTO(done, AllocateBigInt(__ Word32Constant(bitfield), input));
         }
+
         BIND(done, result);
         return result;
       }
-      case ConvertToObjectOp::Kind::kNumber: {
+      case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kNumber: {
         if (input_rep == RegisterRepresentation::Word32()) {
           switch (input_interpretation) {
-            case ConvertToObjectOp::InputInterpretation::kSigned: {
+            case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned: {
               if (SmiValuesAre32Bits()) {
-                return __ SmiTag(input);
+                return __ TagSmi(input);
               }
               DCHECK(SmiValuesAre31Bits());
 
               Label<Tagged> done(this);
               Label<> overflow(this);
 
-              SmiTagOrOverflow(input, &overflow, &done);
+              TagSmiOrOverflow(input, &overflow, &done);
 
               if (BIND(overflow)) {
                 GOTO(done, AllocateHeapNumberWithValue(
@@ -436,35 +598,37 @@ class MachineLoweringReducer : public Next {
               BIND(done, result);
               return result;
             }
-            case ConvertToObjectOp::InputInterpretation::kUnsigned: {
+            case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::
+                kUnsigned: {
               Label<Tagged> done(this);
 
               GOTO_IF(__ Uint32LessThanOrEqual(input, Smi::kMaxValue), done,
-                      __ SmiTag(input));
+                      __ TagSmi(input));
               GOTO(done, AllocateHeapNumberWithValue(
                              __ ChangeUint32ToFloat64(input)));
 
               BIND(done, result);
               return result;
             }
-            case ConvertToObjectOp::InputInterpretation::kCharCode:
-            case ConvertToObjectOp::InputInterpretation::kCodePoint:
+            case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kCharCode:
+            case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::
+                kCodePoint:
               UNREACHABLE();
           }
         } else if (input_rep == RegisterRepresentation::Word64()) {
           switch (input_interpretation) {
-            case ConvertToObjectOp::InputInterpretation::kSigned: {
+            case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned: {
               Label<Tagged> done(this);
               Label<> outside_smi_range(this);
 
-              V<Word32> v32 = input;
+              V<Word32> v32 = __ TruncateWord64ToWord32(input);
               V<Word64> v64 = __ ChangeInt32ToInt64(v32);
               GOTO_IF_NOT(__ Word64Equal(v64, input), outside_smi_range);
 
               if constexpr (SmiValuesAre32Bits()) {
-                GOTO(done, __ SmiTag(input));
+                GOTO(done, __ TagSmi(input));
               } else {
-                SmiTagOrOverflow(v32, &outside_smi_range, &done);
+                TagSmiOrOverflow(v32, &outside_smi_range, &done);
               }
 
               if (BIND(outside_smi_range)) {
@@ -475,19 +639,21 @@ class MachineLoweringReducer : public Next {
               BIND(done, result);
               return result;
             }
-            case ConvertToObjectOp::InputInterpretation::kUnsigned: {
+            case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::
+                kUnsigned: {
               Label<Tagged> done(this);
 
               GOTO_IF(__ Uint64LessThanOrEqual(input, Smi::kMaxValue), done,
-                      __ SmiTag(input));
+                      __ TagSmi(__ TruncateWord64ToWord32(input)));
               GOTO(done,
                    AllocateHeapNumberWithValue(__ ChangeInt64ToFloat64(input)));
 
               BIND(done, result);
               return result;
             }
-            case ConvertToObjectOp::InputInterpretation::kCharCode:
-            case ConvertToObjectOp::InputInterpretation::kCodePoint:
+            case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kCharCode:
+            case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::
+                kCodePoint:
               UNREACHABLE();
           }
         } else {
@@ -510,9 +676,9 @@ class MachineLoweringReducer : public Next {
           }
 
           if constexpr (SmiValuesAre32Bits()) {
-            GOTO(done, __ SmiTag(v32));
+            GOTO(done, __ TagSmi(v32));
           } else {
-            SmiTagOrOverflow(v32, &outside_smi_range, &done);
+            TagSmiOrOverflow(v32, &outside_smi_range, &done);
           }
 
           if (BIND(outside_smi_range)) {
@@ -525,22 +691,22 @@ class MachineLoweringReducer : public Next {
         UNREACHABLE();
         break;
       }
-      case ConvertToObjectOp::Kind::kHeapNumber: {
+      case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kHeapNumber: {
         DCHECK_EQ(input_rep, RegisterRepresentation::Float64());
         DCHECK_EQ(input_interpretation,
-                  ConvertToObjectOp::InputInterpretation::kSigned);
+                  ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned);
         return AllocateHeapNumberWithValue(input);
       }
-      case ConvertToObjectOp::Kind::kSmi: {
+      case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kSmi: {
         DCHECK_EQ(input_rep, RegisterRepresentation::Word32());
         DCHECK_EQ(input_interpretation,
-                  ConvertToObjectOp::InputInterpretation::kSigned);
-        return __ SmiTag(input);
+                  ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned);
+        return __ TagSmi(input);
       }
-      case ConvertToObjectOp::Kind::kBoolean: {
+      case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kBoolean: {
         DCHECK_EQ(input_rep, RegisterRepresentation::Word32());
         DCHECK_EQ(input_interpretation,
-                  ConvertToObjectOp::InputInterpretation::kSigned);
+                  ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned);
         Label<Tagged> done(this);
 
         IF(input) { GOTO(done, __ HeapConstant(factory_->true_value())); }
@@ -550,19 +716,20 @@ class MachineLoweringReducer : public Next {
         BIND(done, result);
         return result;
       }
-      case ConvertToObjectOp::Kind::kString: {
+      case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kString: {
         Label<Word32> single_code(this);
         Label<Tagged> done(this);
 
         if (input_interpretation ==
-            ConvertToObjectOp::InputInterpretation::kCharCode) {
+            ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kCharCode) {
           GOTO(single_code, __ Word32BitwiseAnd(input, 0xFFFF));
         } else {
-          DCHECK_EQ(input_interpretation,
-                    ConvertToObjectOp::InputInterpretation::kCodePoint);
+          DCHECK_EQ(
+              input_interpretation,
+              ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kCodePoint);
           // Check if the input is a single code unit.
-          GOTO_IF_LIKELY(__ Uint32LessThanOrEqual(input, 0xFFFF), single_code,
-                         input);
+          GOTO_IF(LIKELY(__ Uint32LessThanOrEqual(input, 0xFFFF)), single_code,
+                  input);
 
           // Generate surrogate pair string.
 
@@ -587,33 +754,33 @@ class MachineLoweringReducer : public Next {
 #endif
 
           // Allocate a new SeqTwoByteString for {code}.
-          V<Tagged> string =
-              __ Allocate(__ IntPtrConstant(SeqTwoByteString::SizeFor(2)),
-                          AllocationType::kYoung);
+          auto string = __ template Allocate<String>(
+              __ IntPtrConstant(SeqTwoByteString::SizeFor(2)),
+              AllocationType::kYoung);
           // Set padding to 0.
-          __ Store(string, __ IntPtrConstant(0),
-                   StoreOp::Kind::Aligned(BaseTaggedness::kTaggedBase),
-                   MemoryRepresentation::TaggedSigned(), kNoWriteBarrier,
-                   SeqTwoByteString::SizeFor(2) - kObjectAlignment);
-          __ StoreField(string, AccessBuilder::ForMap(),
-                        __ HeapConstant(factory_->string_map()));
-          __ StoreField(string, AccessBuilder::ForNameRawHashField(),
-                        __ Word32Constant(Name::kEmptyHashField));
-          __ StoreField(string, AccessBuilder::ForStringLength(),
-                        __ Word32Constant(2));
-          __ Store(string, code,
-                   StoreOp::Kind::Aligned(BaseTaggedness::kTaggedBase),
-                   MemoryRepresentation::Uint32(), kNoWriteBarrier,
-                   SeqTwoByteString::kHeaderSize);
-          GOTO(done, string);
+          __ Initialize(string, __ IntPtrConstant(0),
+                        MemoryRepresentation::TaggedSigned(),
+                        WriteBarrierKind::kNoWriteBarrier,
+                        SeqTwoByteString::SizeFor(2) - kObjectAlignment);
+          __ InitializeField(
+              string, AccessBuilder::ForMap(),
+              __ HeapConstant(factory_->seq_two_byte_string_map()));
+          __ InitializeField(string, AccessBuilder::ForNameRawHashField(),
+                             __ Word32Constant(Name::kEmptyHashField));
+          __ InitializeField(string, AccessBuilder::ForStringLength(),
+                             __ Word32Constant(2));
+          __ Initialize(string, code, MemoryRepresentation::Uint32(),
+                        WriteBarrierKind::kNoWriteBarrier,
+                        SeqTwoByteString::kHeaderSize);
+          GOTO(done, __ FinishInitialization(std::move(string)));
         }
 
         if (BIND(single_code, code)) {
           // Check if the {code} is a one byte character.
-          IF_LIKELY(
-              __ Uint32LessThanOrEqual(code, String::kMaxOneByteCharCode)) {
+          IF(LIKELY(
+              __ Uint32LessThanOrEqual(code, String::kMaxOneByteCharCode))) {
             // Load the isolate wide single character string table.
-            OpIndex table =
+            V<Tagged> table =
                 __ HeapConstant(factory_->single_character_string_table());
 
             // Compute the {table} index for {code}.
@@ -621,7 +788,7 @@ class MachineLoweringReducer : public Next {
 
             // Load the string for the {code} from the single character string
             // table.
-            OpIndex entry = __ LoadElement(
+            OpIndex entry = __ LoadNonArrayBufferElement(
                 table, AccessBuilder::ForFixedArrayElement(), index);
 
             // Use the {entry} from the {table}.
@@ -629,26 +796,26 @@ class MachineLoweringReducer : public Next {
           }
           ELSE {
             // Allocate a new SeqTwoBytesString for {code}.
-            V<Tagged> string =
-                __ Allocate(__ IntPtrConstant(SeqTwoByteString::SizeFor(1)),
-                            AllocationType::kYoung);
+            auto string = __ template Allocate<String>(
+                __ IntPtrConstant(SeqTwoByteString::SizeFor(1)),
+                AllocationType::kYoung);
 
             // Set padding to 0.
-            __ Store(string, __ IntPtrConstant(0),
-                     StoreOp::Kind::Aligned(BaseTaggedness::kTaggedBase),
-                     MemoryRepresentation::TaggedSigned(), kNoWriteBarrier,
-                     SeqTwoByteString::SizeFor(1) - kObjectAlignment);
-            __ StoreField(string, AccessBuilder::ForMap(),
-                          __ HeapConstant(factory_->string_map()));
-            __ StoreField(string, AccessBuilder::ForNameRawHashField(),
-                          __ Word32Constant(Name::kEmptyHashField));
-            __ StoreField(string, AccessBuilder::ForStringLength(),
-                          __ Word32Constant(1));
-            __ Store(string, code,
-                     StoreOp::Kind::Aligned(BaseTaggedness::kTaggedBase),
-                     MemoryRepresentation::Uint16(), kNoWriteBarrier,
-                     SeqTwoByteString::kHeaderSize);
-            GOTO(done, string);
+            __ Initialize(string, __ IntPtrConstant(0),
+                          MemoryRepresentation::TaggedSigned(),
+                          WriteBarrierKind::kNoWriteBarrier,
+                          SeqTwoByteString::SizeFor(1) - kObjectAlignment);
+            __ InitializeField(
+                string, AccessBuilder::ForMap(),
+                __ HeapConstant(factory_->seq_two_byte_string_map()));
+            __ InitializeField(string, AccessBuilder::ForNameRawHashField(),
+                               __ Word32Constant(Name::kEmptyHashField));
+            __ InitializeField(string, AccessBuilder::ForStringLength(),
+                               __ Word32Constant(1));
+            __ Initialize(string, code, MemoryRepresentation::Uint16(),
+                          WriteBarrierKind::kNoWriteBarrier,
+                          SeqTwoByteString::kHeaderSize);
+            GOTO(done, __ FinishInitialization(std::move(string)));
           }
           END_IF
         }
@@ -661,77 +828,82 @@ class MachineLoweringReducer : public Next {
     UNREACHABLE();
   }
 
-  OpIndex ReduceConvertToObjectOrDeopt(
-      OpIndex input, OpIndex frame_state, ConvertToObjectOrDeoptOp::Kind kind,
+  OpIndex REDUCE(ConvertUntaggedToJSPrimitiveOrDeopt)(
+      OpIndex input, OpIndex frame_state,
+      ConvertUntaggedToJSPrimitiveOrDeoptOp::JSPrimitiveKind kind,
       RegisterRepresentation input_rep,
-      ConvertToObjectOrDeoptOp::InputInterpretation input_interpretation,
+      ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation
+          input_interpretation,
       const FeedbackSource& feedback) {
-    DCHECK_EQ(kind, ConvertToObjectOrDeoptOp::Kind::kSmi);
+    DCHECK_EQ(kind,
+              ConvertUntaggedToJSPrimitiveOrDeoptOp::JSPrimitiveKind::kSmi);
     if (input_rep == RegisterRepresentation::Word32()) {
       if (input_interpretation ==
-          ConvertToObjectOrDeoptOp::InputInterpretation::kSigned) {
+          ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation::kSigned) {
         if constexpr (SmiValuesAre32Bits()) {
-          return __ SmiTag(input);
+          return __ TagSmi(input);
         } else {
           OpIndex test = __ Int32AddCheckOverflow(input, input);
           __ DeoptimizeIf(__ template Projection<Word32>(test, 1), frame_state,
                           DeoptimizeReason::kLostPrecision, feedback);
-          return __ SmiTag(input);
+          return __ BitcastWord32ToTagged(
+              __ template Projection<Word32>(test, 0));
         }
       } else {
-        DCHECK_EQ(input_interpretation,
-                  ConvertToObjectOrDeoptOp::InputInterpretation::kUnsigned);
+        DCHECK_EQ(input_interpretation, ConvertUntaggedToJSPrimitiveOrDeoptOp::
+                                            InputInterpretation::kUnsigned);
         V<Word32> check = __ Uint32LessThanOrEqual(input, Smi::kMaxValue);
         __ DeoptimizeIfNot(check, frame_state, DeoptimizeReason::kLostPrecision,
                            feedback);
-        return __ SmiTag(input);
+        return __ TagSmi(input);
       }
     } else {
       DCHECK_EQ(input_rep, RegisterRepresentation::Word64());
       if (input_interpretation ==
-          ConvertToObjectOrDeoptOp::InputInterpretation::kSigned) {
-        // Word32 truncation is implicit.
-        V<Word32> i32 = input;
+          ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation::kSigned) {
+        V<Word32> i32 = __ TruncateWord64ToWord32(input);
         V<Word32> check = __ Word64Equal(__ ChangeInt32ToInt64(i32), input);
         __ DeoptimizeIfNot(check, frame_state, DeoptimizeReason::kLostPrecision,
                            feedback);
         if constexpr (SmiValuesAre32Bits()) {
-          return __ SmiTag(input);
+          return __ TagSmi(input);
         } else {
           OpIndex test = __ Int32AddCheckOverflow(i32, i32);
           __ DeoptimizeIf(__ template Projection<Word32>(test, 1), frame_state,
                           DeoptimizeReason::kLostPrecision, feedback);
-          return __ SmiTag(i32);
+          return __ BitcastWord32ToTagged(
+              __ template Projection<Word32>(test, 0));
         }
       } else {
-        DCHECK_EQ(input_interpretation,
-                  ConvertToObjectOrDeoptOp::InputInterpretation::kUnsigned);
+        DCHECK_EQ(input_interpretation, ConvertUntaggedToJSPrimitiveOrDeoptOp::
+                                            InputInterpretation::kUnsigned);
         V<Word32> check = __ Uint64LessThanOrEqual(
             input, static_cast<uint64_t>(Smi::kMaxValue));
         __ DeoptimizeIfNot(check, frame_state, DeoptimizeReason::kLostPrecision,
                            feedback);
-        return __ SmiTag(input);
+        return __ TagSmi(input);
       }
     }
 
     UNREACHABLE();
   }
 
-  OpIndex ReduceConvertObjectToPrimitive(
-      OpIndex object, ConvertObjectToPrimitiveOp::Kind kind,
-      ConvertObjectToPrimitiveOp::InputAssumptions input_assumptions) {
+  OpIndex REDUCE(ConvertJSPrimitiveToUntagged)(
+      V<Object> object, ConvertJSPrimitiveToUntaggedOp::UntaggedKind kind,
+      ConvertJSPrimitiveToUntaggedOp::InputAssumptions input_assumptions) {
     switch (kind) {
-      case ConvertObjectToPrimitiveOp::Kind::kInt32:
+      case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kInt32:
         if (input_assumptions ==
-            ConvertObjectToPrimitiveOp::InputAssumptions::kSmi) {
-          return __ SmiUntag(object);
-        } else {
-          DCHECK_EQ(
-              input_assumptions,
-              ConvertObjectToPrimitiveOp::InputAssumptions::kNumberOrOddball);
+            ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kSmi) {
+          return __ UntagSmi(object);
+        } else if (input_assumptions ==
+                   ConvertJSPrimitiveToUntaggedOp::InputAssumptions::
+                       kNumberOrOddball) {
           Label<Word32> done(this);
 
-          IF(__ ObjectIsSmi(object)) { GOTO(done, __ SmiUntag(object)); }
+          IF (LIKELY(__ ObjectIsSmi(object))) {
+            GOTO(done, __ UntagSmi(object));
+          }
           ELSE {
             STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
                                               Oddball::kToNumberRawOffset);
@@ -741,22 +913,34 @@ class MachineLoweringReducer : public Next {
           }
           END_IF
 
+          BIND(done, result);
+          return result;
+        } else {
+          DCHECK_EQ(input_assumptions, ConvertJSPrimitiveToUntaggedOp::
+                                           InputAssumptions::kPlainPrimitive);
+          Label<Word32> done(this);
+          GOTO_IF(LIKELY(__ ObjectIsSmi(object)), done, __ UntagSmi(object));
+          V<Number> number =
+              __ ConvertPlainPrimitiveToNumber(V<PlainPrimitive>::Cast(object));
+          GOTO_IF(__ ObjectIsSmi(number), done, __ UntagSmi(number));
+          V<Float64> f64 = __ template LoadField<Float64>(
+              V<HeapNumber>::Cast(number), AccessBuilder::ForHeapNumberValue());
+          GOTO(done, __ JSTruncateFloat64ToWord32(f64));
           BIND(done, result);
           return result;
         }
         UNREACHABLE();
-      case ConvertObjectToPrimitiveOp::Kind::kInt64:
+      case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kInt64:
         if (input_assumptions ==
-            ConvertObjectToPrimitiveOp::InputAssumptions::kSmi) {
-          return __ ChangeInt32ToInt64(__ SmiUntag(object));
+            ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kSmi) {
+          return __ ChangeInt32ToInt64(__ UntagSmi(object));
         } else {
-          DCHECK_EQ(
-              input_assumptions,
-              ConvertObjectToPrimitiveOp::InputAssumptions::kNumberOrOddball);
+          DCHECK_EQ(input_assumptions, ConvertJSPrimitiveToUntaggedOp::
+                                           InputAssumptions::kNumberOrOddball);
           Label<Word64> done(this);
 
-          IF(__ ObjectIsSmi(object)) {
-            GOTO(done, __ ChangeInt32ToInt64(__ SmiUntag(object)));
+          IF (LIKELY(__ ObjectIsSmi(object))) {
+            GOTO(done, __ ChangeInt32ToInt64(__ UntagSmi(object)));
           }
           ELSE {
             STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
@@ -771,13 +955,15 @@ class MachineLoweringReducer : public Next {
           return result;
         }
         UNREACHABLE();
-      case ConvertObjectToPrimitiveOp::Kind::kUint32: {
+      case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kUint32: {
         DCHECK_EQ(
             input_assumptions,
-            ConvertObjectToPrimitiveOp::InputAssumptions::kNumberOrOddball);
+            ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kNumberOrOddball);
         Label<Word32> done(this);
 
-        IF(__ ObjectIsSmi(object)) { GOTO(done, __ SmiUntag(object)); }
+        IF (LIKELY(__ ObjectIsSmi(object))) {
+          GOTO(done, __ UntagSmi(object));
+        }
         ELSE {
           STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
                                             Oddball::kToNumberRawOffset);
@@ -790,53 +976,73 @@ class MachineLoweringReducer : public Next {
         BIND(done, result);
         return result;
       }
-      case ConvertObjectToPrimitiveOp::Kind::kBit:
+      case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kBit:
         DCHECK_EQ(input_assumptions,
-                  ConvertObjectToPrimitiveOp::InputAssumptions::kObject);
+                  ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kBoolean);
         return __ TaggedEqual(object, __ HeapConstant(factory_->true_value()));
-      case ConvertObjectToPrimitiveOp::Kind::kFloat64: {
-        DCHECK_EQ(
-            input_assumptions,
-            ConvertObjectToPrimitiveOp::InputAssumptions::kNumberOrOddball);
-        Label<Float64> done(this);
+      case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kFloat64: {
+        if (input_assumptions == ConvertJSPrimitiveToUntaggedOp::
+                                     InputAssumptions::kNumberOrOddball) {
+          Label<Float64> done(this);
 
-        IF(__ ObjectIsSmi(object)) {
-          GOTO(done, __ ChangeInt32ToFloat64(__ SmiUntag(object)));
-        }
-        ELSE {
-          STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
-                                            Oddball::kToNumberRawOffset);
-          V<Float64> value = __ template LoadField<Float64>(
-              object, AccessBuilder::ForHeapNumberValue());
-          GOTO(done, value);
-        }
-        END_IF
+          IF (LIKELY(__ ObjectIsSmi(object))) {
+            GOTO(done, __ ChangeInt32ToFloat64(__ UntagSmi(object)));
+          }
+          ELSE {
+            STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
+                                              Oddball::kToNumberRawOffset);
+            V<Float64> value = __ template LoadField<Float64>(
+                object, AccessBuilder::ForHeapNumberValue());
+            GOTO(done, value);
+          }
+          END_IF
 
-        BIND(done, result);
-        return result;
+          BIND(done, result);
+          return result;
+        } else {
+          DCHECK_EQ(input_assumptions, ConvertJSPrimitiveToUntaggedOp::
+                                           InputAssumptions::kPlainPrimitive);
+          Label<Float64> done(this);
+          GOTO_IF(LIKELY(__ ObjectIsSmi(object)), done,
+                  __ ChangeInt32ToFloat64(__ UntagSmi(object)));
+          V<Number> number =
+              __ ConvertPlainPrimitiveToNumber(V<PlainPrimitive>::Cast(object));
+          GOTO_IF(__ ObjectIsSmi(number), done,
+                  __ ChangeInt32ToFloat64(__ UntagSmi(number)));
+          V<Float64> f64 = __ template LoadField<Float64>(
+              V<HeapNumber>::Cast(number), AccessBuilder::ForHeapNumberValue());
+          GOTO(done, f64);
+          BIND(done, result);
+          return result;
+        }
       }
     }
+    UNREACHABLE();
   }
 
-  OpIndex ReduceConvertObjectToPrimitiveOrDeopt(
+  OpIndex REDUCE(ConvertJSPrimitiveToUntaggedOrDeopt)(
       V<Tagged> object, OpIndex frame_state,
-      ConvertObjectToPrimitiveOrDeoptOp::ObjectKind from_kind,
-      ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind to_kind,
+      ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind from_kind,
+      ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind to_kind,
       CheckForMinusZeroMode minus_zero_mode, const FeedbackSource& feedback) {
     switch (to_kind) {
-      case ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kInt32: {
-        if (from_kind == ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kSmi) {
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt32: {
+        if (from_kind ==
+            ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kSmi) {
           __ DeoptimizeIfNot(__ ObjectIsSmi(object), frame_state,
                              DeoptimizeReason::kNotASmi, feedback);
-          return __ SmiUntag(object);
+          return __ UntagSmi(object);
         } else {
-          DCHECK_EQ(from_kind,
-                    ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumber);
+          DCHECK_EQ(
+              from_kind,
+              ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kNumber);
           Label<Word32> done(this);
 
-          IF_LIKELY(__ ObjectIsSmi(object)) { GOTO(done, __ SmiUntag(object)); }
+          IF(LIKELY(__ ObjectIsSmi(object))) {
+            GOTO(done, __ UntagSmi(object));
+          }
           ELSE {
-            V<Tagged> map = __ LoadMapField(object);
+            V<Map> map = __ LoadMapField(object);
             __ DeoptimizeIfNot(
                 __ TaggedEqual(map,
                                __ HeapConstant(factory_->heap_number_map())),
@@ -854,16 +1060,17 @@ class MachineLoweringReducer : public Next {
           return result;
         }
       }
-      case ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kInt64: {
-        DCHECK_EQ(from_kind,
-                  ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumber);
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt64: {
+        DCHECK_EQ(
+            from_kind,
+            ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kNumber);
         Label<Word64> done(this);
 
-        IF_LIKELY(__ ObjectIsSmi(object)) {
-          GOTO(done, __ ChangeInt32ToInt64(__ SmiUntag(object)));
+        IF(LIKELY(__ ObjectIsSmi(object))) {
+          GOTO(done, __ ChangeInt32ToInt64(__ UntagSmi(object)));
         }
         ELSE {
-          V<Tagged> map = __ LoadMapField(object);
+          V<Map> map = __ LoadMapField(object);
           __ DeoptimizeIfNot(
               __ TaggedEqual(map, __ HeapConstant(factory_->heap_number_map())),
               frame_state, DeoptimizeReason::kNotAHeapNumber, feedback);
@@ -878,13 +1085,13 @@ class MachineLoweringReducer : public Next {
         BIND(done, result);
         return result;
       }
-      case ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kFloat64: {
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kFloat64: {
         Label<Float64> done(this);
 
         // In the Smi case, just convert to int32 and then float64.
         // Otherwise, check heap numberness and load the number.
         IF(__ ObjectIsSmi(object)) {
-          GOTO(done, __ ChangeInt32ToFloat64(__ SmiUntag(object)));
+          GOTO(done, __ ChangeInt32ToFloat64(__ UntagSmi(object)));
         }
         ELSE {
           GOTO(done, ConvertHeapObjectToFloat64OrDeopt(object, frame_state,
@@ -895,20 +1102,19 @@ class MachineLoweringReducer : public Next {
         BIND(done, result);
         return result;
       }
-      case ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kArrayIndex: {
-        DCHECK_EQ(
-            from_kind,
-            ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumberOrString);
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kArrayIndex: {
+        DCHECK_EQ(from_kind, ConvertJSPrimitiveToUntaggedOrDeoptOp::
+                                 JSPrimitiveKind::kNumberOrString);
         Label<WordPtr> done(this);
 
-        IF_LIKELY(__ ObjectIsSmi(object)) {
+        IF(LIKELY(__ ObjectIsSmi(object))) {
           // In the Smi case, just convert to intptr_t.
-          GOTO(done, __ ChangeInt32ToIntPtr(__ SmiUntag(object)));
+          GOTO(done, __ ChangeInt32ToIntPtr(__ UntagSmi(object)));
         }
         ELSE {
-          V<Tagged> map = __ LoadMapField(object);
-          IF_LIKELY(__ TaggedEqual(
-              map, __ HeapConstant(factory_->heap_number_map()))) {
+          V<Map> map = __ LoadMapField(object);
+          IF(LIKELY(__ TaggedEqual(
+              map, __ HeapConstant(factory_->heap_number_map())))) {
             V<Float64> heap_number_value = __ template LoadField<Float64>(
                 object, AccessBuilder::ForHeapNumberValue());
             // Perform Turbofan's "CheckedFloat64ToIndex"
@@ -946,8 +1152,7 @@ class MachineLoweringReducer : public Next {
             }
           }
           ELSE {
-            V<Word32> instance_type = __ template LoadField<Word32>(
-                map, AccessBuilder::ForMapInstanceType());
+            V<Word32> instance_type = __ LoadInstanceTypeField(map);
             __ DeoptimizeIfNot(
                 __ Uint32LessThan(instance_type, FIRST_NONSTRING_TYPE),
                 frame_state, DeoptimizeReason::kNotAString, feedback);
@@ -955,11 +1160,12 @@ class MachineLoweringReducer : public Next {
             // TODO(nicohartmann@): We might introduce a Turboshaft way for
             // constructing call descriptors.
             MachineSignature::Builder builder(__ graph_zone(), 1, 1);
-            builder.AddReturn(MachineType::IntPtr());
+            builder.AddReturn(MachineType::Int32());
             builder.AddParam(MachineType::TaggedPointer());
             auto desc = Linkage::GetSimplifiedCDescriptor(__ graph_zone(),
                                                           builder.Build());
-            auto ts_desc = TSCallDescriptor::Create(desc, __ graph_zone());
+            auto ts_desc =
+                TSCallDescriptor::Create(desc, CanThrow::kNo, __ graph_zone());
             OpIndex callee = __ ExternalConstant(
                 ExternalReference::string_to_array_index_function());
             // NOTE: String::ToArrayIndex() currently returns int32_t.
@@ -980,17 +1186,18 @@ class MachineLoweringReducer : public Next {
     UNREACHABLE();
   }
 
-  OpIndex ReduceTruncateObjectToPrimitive(
-      V<Object> object, TruncateObjectToPrimitiveOp::Kind kind,
-      TruncateObjectToPrimitiveOp::InputAssumptions input_assumptions) {
+  OpIndex REDUCE(TruncateJSPrimitiveToUntagged)(
+      V<Object> object, TruncateJSPrimitiveToUntaggedOp::UntaggedKind kind,
+      TruncateJSPrimitiveToUntaggedOp::InputAssumptions input_assumptions) {
     switch (kind) {
-      case TruncateObjectToPrimitiveOp::Kind::kInt32: {
-        DCHECK_EQ(
-            input_assumptions,
-            TruncateObjectToPrimitiveOp::InputAssumptions::kNumberOrOddball);
+      case TruncateJSPrimitiveToUntaggedOp::UntaggedKind::kInt32: {
+        DCHECK_EQ(input_assumptions, TruncateJSPrimitiveToUntaggedOp::
+                                         InputAssumptions::kNumberOrOddball);
         Label<Word32> done(this);
 
-        IF(__ ObjectIsSmi(object)) { GOTO(done, __ SmiUntag(object)); }
+        IF (LIKELY(__ ObjectIsSmi(object))) {
+          GOTO(done, __ UntagSmi(object));
+        }
         ELSE {
           STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
                                             Oddball::kToNumberRawOffset);
@@ -1003,9 +1210,9 @@ class MachineLoweringReducer : public Next {
         BIND(done, result);
         return result;
       }
-      case TruncateObjectToPrimitiveOp::Kind::kInt64: {
+      case TruncateJSPrimitiveToUntaggedOp::UntaggedKind::kInt64: {
         DCHECK_EQ(input_assumptions,
-                  TruncateObjectToPrimitiveOp::InputAssumptions::kBigInt);
+                  TruncateJSPrimitiveToUntaggedOp::InputAssumptions::kBigInt);
         DCHECK(Is64());
         Label<Word64> done(this);
 
@@ -1026,20 +1233,21 @@ class MachineLoweringReducer : public Next {
         BIND(done, result);
         return result;
       }
-      case TruncateObjectToPrimitiveOp::Kind::kBit: {
+      case TruncateJSPrimitiveToUntaggedOp::UntaggedKind::kBit: {
         Label<Word32> done(this);
 
         if (input_assumptions ==
-            TruncateObjectToPrimitiveOp::InputAssumptions::kObject) {
+            TruncateJSPrimitiveToUntaggedOp::InputAssumptions::kObject) {
           // Perform Smi check.
-          IF_UNLIKELY(__ ObjectIsSmi(object)) {
-            GOTO(done, __ Word32Equal(__ TaggedEqual(object, __ SmiTag(0)), 0));
+          IF(UNLIKELY(__ ObjectIsSmi(object))) {
+            GOTO(done, __ Word32Equal(__ TaggedEqual(object, __ TagSmi(0)), 0));
           }
           END_IF
           // Otherwise fall through into HeapObject case.
         } else {
-          DCHECK_EQ(input_assumptions,
-                    TruncateObjectToPrimitiveOp::InputAssumptions::kHeapObject);
+          DCHECK_EQ(
+              input_assumptions,
+              TruncateJSPrimitiveToUntaggedOp::InputAssumptions::kHeapObject);
         }
 
         // Check if {object} is false.
@@ -1064,8 +1272,8 @@ class MachineLoweringReducer : public Next {
             done, 0);
 
         // Check if {object} is a HeapNumber.
-        IF_UNLIKELY(
-            __ TaggedEqual(map, __ HeapConstant(factory_->heap_number_map()))) {
+        IF(UNLIKELY(__ TaggedEqual(
+            map, __ HeapConstant(factory_->heap_number_map())))) {
           // For HeapNumber {object}, just check that its value is not 0.0, -0.0
           // or NaN.
           V<Float64> number_value = __ template LoadField<Float64>(
@@ -1075,8 +1283,8 @@ class MachineLoweringReducer : public Next {
         END_IF
 
         // Check if {object} is a BigInt.
-        IF_UNLIKELY(
-            __ TaggedEqual(map, __ HeapConstant(factory_->bigint_map()))) {
+        IF(UNLIKELY(
+            __ TaggedEqual(map, __ HeapConstant(factory_->bigint_map())))) {
           V<Word32> bitfield = __ template LoadField<Word32>(
               object, AccessBuilder::ForBigIntBitfield());
           GOTO(done, IsNonZero(__ Word32BitwiseAnd(bitfield,
@@ -1094,19 +1302,96 @@ class MachineLoweringReducer : public Next {
     UNREACHABLE();
   }
 
-  // `IsNonZero` converts any non-0 value into 1.
-  V<Word32> IsNonZero(V<Word32> value) {
-    return __ Word32Equal(__ Word32Equal(value, 0), 0);
+  OpIndex REDUCE(TruncateJSPrimitiveToUntaggedOrDeopt)(
+      V<Object> input, OpIndex frame_state,
+      TruncateJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind kind,
+      TruncateJSPrimitiveToUntaggedOrDeoptOp::InputRequirement
+          input_requirement,
+      const FeedbackSource& feedback) {
+    DCHECK_EQ(kind,
+              TruncateJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt32);
+    Label<Word32> done(this);
+    // In the Smi case, just convert to int32.
+    GOTO_IF(LIKELY(__ ObjectIsSmi(input)), done, __ UntagSmi(input));
+
+    // Otherwise, check that it's a heap number or oddball and truncate the
+    // value to int32.
+    V<Float64> number_value = ConvertHeapObjectToFloat64OrDeopt(
+        input, frame_state, input_requirement, feedback);
+    GOTO(done, __ JSTruncateFloat64ToWord32(number_value));
+
+    BIND(done, result);
+    return result;
   }
 
-  OpIndex ReduceNewConsString(OpIndex length, OpIndex first, OpIndex second) {
+  V<Word32> JSAnyIsNotPrimitiveHeapObject(V<Object> value,
+                                          V<Map> value_map = OpIndex{}) {
+    if (!value_map.valid()) {
+      value_map = __ LoadMapField(value);
+    }
+#if V8_STATIC_ROOTS_BOOL
+    // Assumes only primitive objects and JS_RECEIVER's are passed here. All
+    // primitive object's maps are in RO space and are allocated before all
+    // JS_RECEIVER maps. Thus primitive object maps have smaller (compressed)
+    // addresses.
+    return __ Uint32LessThan(
+        InstanceTypeChecker::kNonJsReceiverMapLimit,
+        __ TruncateWordPtrToWord32(__ BitcastTaggedToWord(value_map)));
+#else
+    static_assert(LAST_TYPE == LAST_JS_RECEIVER_TYPE);
+    V<Word32> value_instance_type = __ LoadInstanceTypeField(value_map);
+    return __ Uint32LessThanOrEqual(FIRST_JS_RECEIVER_TYPE,
+                                    value_instance_type);
+#endif
+  }
+
+  OpIndex REDUCE(ConvertJSPrimitiveToObject)(V<Object> value,
+                                             V<Object> global_proxy,
+                                             ConvertReceiverMode mode) {
+    switch (mode) {
+      case ConvertReceiverMode::kNullOrUndefined:
+        return global_proxy;
+      case ConvertReceiverMode::kNotNullOrUndefined:
+      case ConvertReceiverMode::kAny: {
+        Label<Object> done(this);
+
+        // Check if {value} is already a JSReceiver (or null/undefined).
+        Label<> convert_to_object(this);
+        GOTO_IF(UNLIKELY(__ ObjectIsSmi(value)), convert_to_object);
+        GOTO_IF_NOT(LIKELY(__ JSAnyIsNotPrimitiveHeapObject(value)),
+                    convert_to_object);
+        GOTO(done, value);
+
+        // Wrap the primitive {value} into a JSPrimitiveWrapper.
+        if (BIND(convert_to_object)) {
+          if (mode != ConvertReceiverMode::kNotNullOrUndefined) {
+            // Replace the {value} with the {global_proxy}.
+            GOTO_IF(UNLIKELY(__ TaggedEqual(
+                        value, __ HeapConstant(factory_->undefined_value()))),
+                    done, global_proxy);
+            GOTO_IF(UNLIKELY(__ TaggedEqual(
+                        value, __ HeapConstant(factory_->null_value()))),
+                    done, global_proxy);
+          }
+          V<NativeContext> native_context =
+              __ template LoadField<NativeContext>(
+                  global_proxy, AccessBuilder::ForJSGlobalProxyNativeContext());
+          GOTO(done, __ CallBuiltin_ToObject(isolate_, native_context, value));
+        }
+
+        BIND(done, result);
+        return result;
+      }
+    }
+    UNREACHABLE();
+  }
+
+  OpIndex REDUCE(NewConsString)(OpIndex length, OpIndex first, OpIndex second) {
     // Determine the instance types of {first} and {second}.
-    V<Tagged> first_map = __ LoadMapField(first);
-    V<Word32> first_type = __ template LoadField<Word32>(
-        first_map, AccessBuilder::ForMapInstanceType());
-    V<Tagged> second_map = __ LoadMapField(second);
-    V<Word32> second_type = __ template LoadField<Word32>(
-        second_map, AccessBuilder::ForMapInstanceType());
+    V<Map> first_map = __ LoadMapField(first);
+    V<Word32> first_type = __ LoadInstanceTypeField(first_map);
+    V<Map> second_map = __ LoadMapField(second);
+    V<Word32> second_type = __ LoadInstanceTypeField(second_map);
 
     Label<Tagged> allocate_string(this);
     // Determine the proper map for the resulting ConsString.
@@ -1119,7 +1404,8 @@ class MachineLoweringReducer : public Next {
     V<Word32> encoding =
         __ Word32BitwiseAnd(instance_type, kStringEncodingMask);
     IF(__ Word32Equal(encoding, kTwoByteStringTag)) {
-      GOTO(allocate_string, __ HeapConstant(factory_->cons_string_map()));
+      GOTO(allocate_string,
+           __ HeapConstant(factory_->cons_two_byte_string_map()));
     }
     ELSE {
       GOTO(allocate_string,
@@ -1128,19 +1414,19 @@ class MachineLoweringReducer : public Next {
 
     // Allocate the resulting ConsString.
     BIND(allocate_string, map);
-    V<Tagged> string = __ Allocate(__ IntPtrConstant(ConsString::kSize),
-                                   AllocationType::kYoung);
-    __ StoreField(string, AccessBuilder::ForMap(), map);
-    __ StoreField(string, AccessBuilder::ForNameRawHashField(),
-                  __ Word32Constant(Name::kEmptyHashField));
-    __ StoreField(string, AccessBuilder::ForStringLength(), length);
-    __ StoreField(string, AccessBuilder::ForConsStringFirst(), first);
-    __ StoreField(string, AccessBuilder::ForConsStringSecond(), second);
-    return string;
-  }
-
-  OpIndex ReduceNewArray(V<WordPtr> length, NewArrayOp::Kind kind,
-                         AllocationType allocation_type) {
+    auto string = __ template Allocate<String>(
+        __ IntPtrConstant(ConsString::kSize), AllocationType::kYoung);
+    __ InitializeField(string, AccessBuilder::ForMap(), map);
+    __ InitializeField(string, AccessBuilder::ForNameRawHashField(),
+                       __ Word32Constant(Name::kEmptyHashField));
+    __ InitializeField(string, AccessBuilder::ForStringLength(), length);
+    __ InitializeField(string, AccessBuilder::ForConsStringFirst(), first);
+    __ InitializeField(string, AccessBuilder::ForConsStringSecond(), second);
+    return __ FinishInitialization(std::move(string));
+  }
+
+  OpIndex REDUCE(NewArray)(V<WordPtr> length, NewArrayOp::Kind kind,
+                           AllocationType allocation_type) {
     Label<Tagged> done(this);
 
     GOTO_IF(__ WordPtrEqual(length, 0), done,
@@ -1157,7 +1443,7 @@ class MachineLoweringReducer : public Next {
         size_log2 = kDoubleSizeLog2;
         array_map = factory_->fixed_double_array_map();
         access = {kTaggedBase, FixedDoubleArray::kHeaderSize,
-                  compiler::Type::NumberOrHole(), MachineType::Float64(),
+                  compiler::Type::NumberOrTheHole(), MachineType::Float64(),
                   kNoWriteBarrier};
         STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
                                           Oddball::kToNumberRawOffset);
@@ -1175,23 +1461,30 @@ class MachineLoweringReducer : public Next {
         break;
       }
     }
-    V<WordPtr> size = __ WordPtrAdd(__ WordPtrShiftLeft(length, size_log2),
-                                    access.header_size);
+    V<WordPtr> size =
+        __ WordPtrAdd(__ WordPtrShiftLeft(length, static_cast<int>(size_log2)),
+                      access.header_size);
 
     // Allocate the result and initialize the header.
-    V<Tagged> array = __ Allocate(size, allocation_type);
-    __ StoreField(array, AccessBuilder::ForMap(), __ HeapConstant(array_map));
-    __ StoreField(array, AccessBuilder::ForFixedArrayLength(),
-                  __ SmiTag(length));
+    auto uninitialized_array =
+        __ template Allocate<FixedArray>(size, allocation_type);
+    __ InitializeField(uninitialized_array, AccessBuilder::ForMap(),
+                       __ HeapConstant(array_map));
+    __ InitializeField(uninitialized_array,
+                       AccessBuilder::ForFixedArrayLength(),
+                       __ TagSmi(__ TruncateWordPtrToWord32(length)));
+    // TODO(nicohartmann@): Should finish initialization only after all elements
+    // have been initialized.
+    auto array = __ FinishInitialization(std::move(uninitialized_array));
 
     // Initialize the backing store with holes.
     LoopLabel<WordPtr> loop(this);
     GOTO(loop, intptr_t{0});
 
     LOOP(loop, index) {
-      GOTO_IF_NOT_UNLIKELY(__ UintPtrLessThan(index, length), done, array);
+      GOTO_IF_NOT(LIKELY(__ UintPtrLessThan(index, length)), done, array);
 
-      __ StoreElement(array, access, index, the_hole_value);
+      __ StoreNonArrayBufferElement(array, access, index, the_hole_value);
 
       // Advance the {index}.
       GOTO(loop, __ WordPtrAdd(index, 1));
@@ -1201,8 +1494,8 @@ class MachineLoweringReducer : public Next {
     return result;
   }
 
-  OpIndex ReduceDoubleArrayMinMax(V<Tagged> array,
-                                  DoubleArrayMinMaxOp::Kind kind) {
+  OpIndex REDUCE(DoubleArrayMinMax)(V<Tagged> array,
+                                    DoubleArrayMinMaxOp::Kind kind) {
     DCHECK(kind == DoubleArrayMinMaxOp::Kind::kMin ||
            kind == DoubleArrayMinMaxOp::Kind::kMax);
     const bool is_max = kind == DoubleArrayMinMaxOp::Kind::kMax;
@@ -1211,35 +1504,35 @@ class MachineLoweringReducer : public Next {
     V<Float64> empty_value =
         __ Float64Constant(is_max ? -V8_INFINITY : V8_INFINITY);
     V<WordPtr> array_length =
-        __ ChangeInt32ToIntPtr(__ SmiUntag(__ template LoadField<Tagged>(
+        __ ChangeInt32ToIntPtr(__ UntagSmi(__ template LoadField<Tagged>(
             array, AccessBuilder::ForJSArrayLength(
                        ElementsKind::PACKED_DOUBLE_ELEMENTS))));
     V<Tagged> elements = __ template LoadField<Tagged>(
         array, AccessBuilder::ForJSObjectElements());
 
-    Label<Float64> done(this);
-    LoopLabel<WordPtr, Float64> loop(this);
+    Label<> done(this);
+    LoopLabel<WordPtr> loop(this);
+    ScopedVar<Float64> result(Asm(), empty_value);
 
-    GOTO(loop, intptr_t{0}, empty_value);
+    GOTO(loop, intptr_t{0});
 
-    LOOP(loop, index, accumulator) {
-      GOTO_IF_NOT_UNLIKELY(__ UintPtrLessThan(index, array_length), done,
-                           accumulator);
+    LOOP(loop, index) {
+      GOTO_IF_NOT(LIKELY(__ UintPtrLessThan(index, array_length)), done);
 
-      V<Float64> element = __ template LoadElement<Float64>(
+      V<Float64> element = __ template LoadNonArrayBufferElement<Float64>(
           elements, AccessBuilder::ForFixedDoubleArrayElement(), index);
 
-      V<Float64> new_accumulator = is_max ? __ Float64Max(accumulator, element)
-                                          : __ Float64Min(accumulator, element);
-      GOTO(loop, __ WordPtrAdd(index, 1), new_accumulator);
+      result = is_max ? __ Float64Max(*result, element)
+                      : __ Float64Min(*result, element);
+      GOTO(loop, __ WordPtrAdd(index, 1));
     }
 
-    BIND(done, result);
-    return __ ConvertFloat64ToNumber(result,
+    BIND(done);
+    return __ ConvertFloat64ToNumber(*result,
                                      CheckForMinusZeroMode::kCheckForMinusZero);
   }
 
-  OpIndex ReduceLoadFieldByIndex(V<Tagged> object, V<Word32> field_index) {
+  OpIndex REDUCE(LoadFieldByIndex)(V<Tagged> object, V<Word32> field_index) {
     // Index encoding (see `src/objects/field-index-inl.h`):
     // For efficiency, the LoadByFieldIndex instruction takes an index that is
     // optimized for quick access. If the property is inline, the index is
@@ -1253,7 +1546,9 @@ class MachineLoweringReducer : public Next {
     Label<Tagged> done(this);
 
     // Check if field is a mutable double field.
-    GOTO_IF_UNLIKELY(__ WordPtrBitwiseAnd(index, 0x1), double_field);
+    GOTO_IF(
+        UNLIKELY(__ TruncateWordPtrToWord32(__ WordPtrBitwiseAnd(index, 0x1))),
+        double_field);
 
     {
       // The field is a proper Tagged field on {object}. The {index} is
@@ -1320,8 +1615,7 @@ class MachineLoweringReducer : public Next {
         // this is a HeapNumber -- otherwise the load is fine and we don't need
         // to copy anything anyway.
         GOTO_IF(__ ObjectIsSmi(field), done, field);
-        V<Tagged> map =
-            __ template LoadField<Tagged>(field, AccessBuilder::ForMap());
+        V<Map> map = __ LoadMapField(field);
         GOTO_IF_NOT(
             __ TaggedEqual(map, __ HeapConstant(factory_->heap_number_map())),
             done, field);
@@ -1336,8 +1630,8 @@ class MachineLoweringReducer : public Next {
     return result;
   }
 
-  OpIndex ReduceBigIntBinop(V<Tagged> left, V<Tagged> right,
-                            OpIndex frame_state, BigIntBinopOp::Kind kind) {
+  OpIndex REDUCE(BigIntBinop)(V<Tagged> left, V<Tagged> right,
+                              OpIndex frame_state, BigIntBinopOp::Kind kind) {
     const Builtin builtin = GetBuiltinForBigIntBinop(kind);
     switch (kind) {
       case BigIntBinopOp::Kind::kAdd:
@@ -1361,7 +1655,7 @@ class MachineLoweringReducer : public Next {
 
         // Check for exception sentinel: Smi 1 is returned to signal
         // TerminationRequested.
-        IF_UNLIKELY(__ TaggedEqual(result, __ SmiTag(1))) {
+        IF (UNLIKELY(__ TaggedEqual(result, __ TagSmi(1)))) {
           __ CallRuntime_TerminateExecution(isolate_, frame_state,
                                             __ NoContextConstant());
         }
@@ -1385,12 +1679,12 @@ class MachineLoweringReducer : public Next {
     UNREACHABLE();
   }
 
-  V<Word32> ReduceBigIntEqual(V<Tagged> left, V<Tagged> right) {
+  V<Word32> REDUCE(BigIntEqual)(V<Tagged> left, V<Tagged> right) {
     return CallBuiltinForBigIntOp(Builtin::kBigIntEqual, {left, right});
   }
 
-  V<Word32> ReduceBigIntComparison(V<Tagged> left, V<Tagged> right,
-                                   BigIntComparisonOp::Kind kind) {
+  V<Word32> REDUCE(BigIntComparison)(V<Tagged> left, V<Tagged> right,
+                                     BigIntComparisonOp::Kind kind) {
     if (kind == BigIntComparisonOp::Kind::kLessThan) {
       return CallBuiltinForBigIntOp(Builtin::kBigIntLessThan, {left, right});
     } else {
@@ -1400,25 +1694,26 @@ class MachineLoweringReducer : public Next {
     }
   }
 
-  V<Tagged> ReduceBigIntUnary(V<Tagged> input, BigIntUnaryOp::Kind kind) {
+  V<Tagged> REDUCE(BigIntUnary)(V<Tagged> input, BigIntUnaryOp::Kind kind) {
     DCHECK_EQ(kind, BigIntUnaryOp::Kind::kNegate);
     return CallBuiltinForBigIntOp(Builtin::kBigIntUnaryMinus, {input});
   }
 
-  V<Word32> ReduceStringAt(V<String> string, V<WordPtr> pos,
-                           StringAtOp::Kind kind) {
+  V<Word32> REDUCE(StringAt)(V<String> string, V<WordPtr> pos,
+                             StringAtOp::Kind kind) {
     if (kind == StringAtOp::Kind::kCharCode) {
       Label<Word32> done(this);
       Label<> runtime(this);
       // We need a loop here to properly deal with indirect strings
       // (SlicedString, ConsString and ThinString).
-      LoopLabel<String, WordPtr> loop(this);
-      GOTO(loop, string, pos);
-
-      LOOP(loop, receiver, position) {
-        V<Tagged> map = __ LoadMapField(receiver);
-        V<Word32> instance_type = __ template LoadField<Word32>(
-            map, AccessBuilder::ForMapInstanceType());
+      LoopLabel<> loop(this);
+      ScopedVar<String> receiver(Asm(), string);
+      ScopedVar<WordPtr> position(Asm(), pos);
+      GOTO(loop);
+
+      LOOP(loop) {
+        V<Map> map = __ LoadMapField(*receiver);
+        V<Word32> instance_type = __ LoadInstanceTypeField(map);
         V<Word32> representation =
             __ Word32BitwiseAnd(instance_type, kStringRepresentationMask);
 
@@ -1428,21 +1723,21 @@ class MachineLoweringReducer : public Next {
             IF(__ Word32Equal(representation, kConsStringTag)) {
               // if_consstring
               V<String> second = __ template LoadField<String>(
-                  receiver, AccessBuilder::ForConsStringSecond());
-              GOTO_IF_NOT_UNLIKELY(
-                  __ TaggedEqual(second,
-                                 __ HeapConstant(factory_->empty_string())),
+                  *receiver, AccessBuilder::ForConsStringSecond());
+              GOTO_IF_NOT(
+                  LIKELY(__ TaggedEqual(
+                      second, __ HeapConstant(factory_->empty_string()))),
                   runtime);
-              V<String> first = __ template LoadField<String>(
-                  receiver, AccessBuilder::ForConsStringFirst());
-              GOTO(loop, first, position);
+              receiver = __ template LoadField<String>(
+                  *receiver, AccessBuilder::ForConsStringFirst());
+              GOTO(loop);
             }
             ELSE {
               // if_seqstring
               V<Word32> onebyte = __ Word32Equal(
                   __ Word32BitwiseAnd(instance_type, kStringEncodingMask),
                   kOneByteStringTag);
-              GOTO(done, LoadFromSeqString(receiver, position, onebyte));
+              GOTO(done, LoadFromSeqString(*receiver, *position, onebyte));
             }
             END_IF
           }
@@ -1452,29 +1747,29 @@ class MachineLoweringReducer : public Next {
           {
             IF(__ Word32Equal(representation, kThinStringTag)) {
               // if_thinstring
-              V<String> actual = __ template LoadField<String>(
-                  receiver, AccessBuilder::ForThinStringActual());
-              GOTO(loop, actual, position);
+              receiver = __ template LoadField<String>(
+                  *receiver, AccessBuilder::ForThinStringActual());
+              GOTO(loop);
             }
             ELSE_IF(__ Word32Equal(representation, kExternalStringTag)) {
               // if_externalstring
               // We need to bailout to the runtime for uncached external
               // strings.
-              GOTO_IF_UNLIKELY(__ Word32Equal(__ Word32BitwiseAnd(
-                                                  instance_type,
-                                                  kUncachedExternalStringMask),
-                                              kUncachedExternalStringTag),
-                               runtime);
+              GOTO_IF(UNLIKELY(__ Word32Equal(
+                          __ Word32BitwiseAnd(instance_type,
+                                              kUncachedExternalStringMask),
+                          kUncachedExternalStringTag)),
+                      runtime);
 
               OpIndex data = __ LoadField(
-                  receiver, AccessBuilder::ForExternalStringResourceData());
+                  *receiver, AccessBuilder::ForExternalStringResourceData());
               IF(__ Word32Equal(
                   __ Word32BitwiseAnd(instance_type, kStringEncodingMask),
                   kTwoByteStringTag)) {
                 // if_twobyte
                 constexpr uint8_t twobyte_size_log2 = 1;
                 V<Word32> value = __ Load(
-                    data, position,
+                    data, *position,
                     LoadOp::Kind::Aligned(BaseTaggedness::kUntaggedBase),
                     MemoryRepresentation::Uint16(), 0, twobyte_size_log2);
                 GOTO(done, value);
@@ -1483,7 +1778,7 @@ class MachineLoweringReducer : public Next {
                 // if_onebyte
                 constexpr uint8_t onebyte_size_log2 = 0;
                 V<Word32> value = __ Load(
-                    data, position,
+                    data, *position,
                     LoadOp::Kind::Aligned(BaseTaggedness::kUntaggedBase),
                     MemoryRepresentation::Uint8(), 0, onebyte_size_log2);
                 GOTO(done, value);
@@ -1493,12 +1788,12 @@ class MachineLoweringReducer : public Next {
             ELSE_IF(__ Word32Equal(representation, kSlicedStringTag)) {
               // if_slicedstring
               V<Tagged> offset = __ template LoadField<Tagged>(
-                  receiver, AccessBuilder::ForSlicedStringOffset());
-              V<String> parent = __ template LoadField<String>(
-                  receiver, AccessBuilder::ForSlicedStringParent());
-              GOTO(loop, parent,
-                   __ WordPtrAdd(position,
-                                 __ ChangeInt32ToIntPtr(__ SmiUntag(offset))));
+                  *receiver, AccessBuilder::ForSlicedStringOffset());
+              receiver = __ template LoadField<String>(
+                  *receiver, AccessBuilder::ForSlicedStringParent());
+              position = __ WordPtrAdd(
+                  *position, __ ChangeInt32ToIntPtr(__ UntagSmi(offset)));
+              GOTO(loop);
             }
             ELSE { GOTO(runtime); }
             END_IF
@@ -1507,8 +1802,9 @@ class MachineLoweringReducer : public Next {
         END_IF
 
         if (BIND(runtime)) {
-          V<Word32> value = __ SmiUntag(__ CallRuntime_StringCharCodeAt(
-              isolate_, __ NoContextConstant(), receiver, __ SmiTag(position)));
+          V<Word32> value = __ UntagSmi(__ CallRuntime_StringCharCodeAt(
+              isolate_, __ NoContextConstant(), *receiver,
+              __ TagSmi(__ TruncateWordPtrToWord32(*position))));
           GOTO(done, value);
         }
       }
@@ -1520,11 +1816,11 @@ class MachineLoweringReducer : public Next {
       Label<Word32> done(this);
 
       V<Word32> first_code_unit = __ StringCharCodeAt(string, pos);
-      GOTO_IF_NOT_LIKELY(
-          __ Word32Equal(__ Word32BitwiseAnd(first_code_unit, 0xFC00), 0xD800),
-          done, first_code_unit);
+      GOTO_IF_NOT(UNLIKELY(__ Word32Equal(
+                      __ Word32BitwiseAnd(first_code_unit, 0xFC00), 0xD800)),
+                  done, first_code_unit);
       V<WordPtr> length =
-          __ ChangeUint32ToUintPtr(__ template LoadField<WordPtr>(
+          __ ChangeUint32ToUintPtr(__ template LoadField<Word32>(
               string, AccessBuilder::ForStringLength()));
       V<WordPtr> next_index = __ WordPtrAdd(pos, 1);
       GOTO_IF_NOT(__ IntPtrLessThan(next_index, length), done, first_code_unit);
@@ -1547,23 +1843,23 @@ class MachineLoweringReducer : public Next {
     UNREACHABLE();
   }
 
-  V<Word32> ReduceStringLength(V<String> string) {
+  V<Word32> REDUCE(StringLength)(V<String> string) {
     return __ template LoadField<Word32>(string,
                                          AccessBuilder::ForStringLength());
   }
 
-  V<Smi> ReduceStringIndexOf(V<String> string, V<String> search,
-                             V<Smi> position) {
+  V<Smi> REDUCE(StringIndexOf)(V<String> string, V<String> search,
+                               V<Smi> position) {
     return __ CallBuiltin_StringIndexOf(isolate_, string, search, position);
   }
 
-  V<String> ReduceStringFromCodePointAt(V<String> string, V<WordPtr> index) {
+  V<String> REDUCE(StringFromCodePointAt)(V<String> string, V<WordPtr> index) {
     return __ CallBuiltin_StringFromCodePointAt(isolate_, string, index);
   }
 
 #ifdef V8_INTL_SUPPORT
-  V<String> ReduceStringToCaseIntl(V<String> string,
-                                   StringToCaseIntlOp::Kind kind) {
+  V<String> REDUCE(StringToCaseIntl)(V<String> string,
+                                     StringToCaseIntlOp::Kind kind) {
     if (kind == StringToCaseIntlOp::Kind::kLower) {
       return __ CallBuiltin_StringToLowerCaseIntl(
           isolate_, __ NoContextConstant(), string);
@@ -1575,20 +1871,23 @@ class MachineLoweringReducer : public Next {
   }
 #endif  // V8_INTL_SUPPORT
 
-  V<String> ReduceStringSubstring(V<String> string, V<Word32> start,
-                                  V<Word32> end) {
+  V<String> REDUCE(StringSubstring)(V<String> string, V<Word32> start,
+                                    V<Word32> end) {
     V<WordPtr> s = __ ChangeInt32ToIntPtr(start);
     V<WordPtr> e = __ ChangeInt32ToIntPtr(end);
     return __ CallBuiltin_StringSubstring(isolate_, string, s, e);
   }
 
-  V<Boolean> ReduceStringEqual(V<String> left, V<String> right) {
+  V<Boolean> REDUCE(StringEqual)(V<String> left, V<String> right) {
+    Label<Boolean> done(this);
+
+    GOTO_IF(__ TaggedEqual(left, right), done,
+            __ HeapConstant(factory_->true_value()));
+
     V<Word32> left_length =
         __ template LoadField<Word32>(left, AccessBuilder::ForStringLength());
     V<Word32> right_length =
         __ template LoadField<Word32>(right, AccessBuilder::ForStringLength());
-
-    Label<Boolean> done(this);
     IF(__ Word32Equal(left_length, right_length)) {
       GOTO(done,
            __ CallBuiltin_StringEqual(isolate_, left, right,
@@ -1600,8 +1899,14 @@ class MachineLoweringReducer : public Next {
     return result;
   }
 
-  V<Boolean> ReduceStringComparison(V<String> left, V<String> right,
-                                    StringComparisonOp::Kind kind) {
+  V<String> REDUCE(StringConcat)(V<String> left, V<String> right) {
+    // TODO(nicohartmann@): Port StringBuilder once it is stable.
+    return __ CallBuiltin_StringAdd_CheckNone(isolate_, __ NoContextConstant(),
+                                              left, right);
+  }
+
+  V<Boolean> REDUCE(StringComparison)(V<String> left, V<String> right,
+                                      StringComparisonOp::Kind kind) {
     switch (kind) {
       case StringComparisonOp::Kind::kLessThan:
         return __ CallBuiltin_StringLessThan(isolate_, left, right);
@@ -1610,63 +1915,964 @@ class MachineLoweringReducer : public Next {
     }
   }
 
-  // TODO(nicohartmann@): Remove this once ECL has been fully ported.
-  // ECL: ChangeInt64ToSmi(input) ==> MLR: __ SmiTag(input)
-  // ECL: ChangeInt32ToSmi(input) ==> MLR: __ SmiTag(input)
-  // ECL: ChangeUint32ToSmi(input) ==> MLR: __ SmiTag(input)
-  // ECL: ChangeUint64ToSmi(input) ==> MLR: __ SmiTag(input)
-  // ECL: ChangeIntPtrToSmi(input) ==> MLR: __ SmiTag(input)
-  // ECL: ChangeFloat64ToTagged(i, m) ==> MLR: __ ConvertFloat64ToNumber(i, m)
-  // ECL: ChangeSmiToIntPtr(input)
-  //   ==> MLR: __ ChangeInt32ToIntPtr(__ SmiUntag(input))
-  // ECL: ChangeSmiToInt32(input) ==> MLR: __ SmiUntag(input)
-  // ECL: ChangeSmiToInt64(input) ==> MLR: __ ChangeInt32ToInt64(__
-  // SmiUntag(input))
-  // ECL: BuildCheckedHeapNumberOrOddballToFloat64 ==> MLR:
-  // ConvertHeapObjectToFloat64OrDeopt
+  V<Smi> REDUCE(ArgumentsLength)(ArgumentsLengthOp::Kind kind,
+                                 int formal_parameter_count) {
+    V<WordPtr> count =
+        __ LoadOffHeap(__ FramePointer(), StandardFrameConstants::kArgCOffset,
+                       MemoryRepresentation::PointerSized());
+    V<WordPtr> arguments_length = __ WordPtrSub(count, kJSArgcReceiverSlots);
+
+    if (kind == ArgumentsLengthOp::Kind::kArguments) {
+      return __ TagSmi(__ TruncateWordPtrToWord32(arguments_length));
+    } else {
+      DCHECK_EQ(kind, ArgumentsLengthOp::Kind::kRest);
+      V<WordPtr> rest_length =
+          __ WordPtrSub(arguments_length, formal_parameter_count);
+      Label<WordPtr> done(this);
+      IF(__ IntPtrLessThan(rest_length, 0)) { GOTO(done, 0); }
+      ELSE { GOTO(done, rest_length); }
+      END_IF
+
+      BIND(done, value);
+      return __ TagSmi(__ TruncateWordPtrToWord32(value));
+    }
+  }
+
+  V<Object> REDUCE(NewArgumentsElements)(V<Smi> arguments_count,
+                                         CreateArgumentsType type,
+                                         int formal_parameter_count) {
+    V<WordPtr> frame = __ FramePointer();
+    V<WordPtr> p_count = __ IntPtrConstant(formal_parameter_count);
+    switch (type) {
+      case CreateArgumentsType::kMappedArguments:
+        return __ CallBuiltin_NewSloppyArgumentsElements(
+            isolate_, frame, p_count, arguments_count);
+      case CreateArgumentsType::kUnmappedArguments:
+        return __ CallBuiltin_NewStrictArgumentsElements(
+            isolate_, frame, p_count, arguments_count);
+      case CreateArgumentsType::kRestParameter:
+        return __ CallBuiltin_NewRestArgumentsElements(isolate_, frame, p_count,
+                                                       arguments_count);
+    }
+  }
+
+  OpIndex REDUCE(LoadTypedElement)(OpIndex buffer, V<Object> base,
+                                   V<WordPtr> external, V<WordPtr> index,
+                                   ExternalArrayType array_type) {
+    V<WordPtr> data_ptr = BuildTypedArrayDataPointer(base, external);
+
+    // Perform the actual typed element access.
+    OpIndex result = __ LoadArrayBufferElement(
+        data_ptr, AccessBuilder::ForTypedArrayElement(array_type, true), index);
+
+    // We need to keep the {buffer} alive so that the GC will not release the
+    // ArrayBuffer (if there's any) as long as we are still operating on it.
+    __ Retain(buffer);
+    return result;
+  }
+
+  OpIndex REDUCE(LoadDataViewElement)(V<Object> object, V<Object> storage,
+                                      V<WordPtr> index,
+                                      V<Word32> is_little_endian,
+                                      ExternalArrayType element_type) {
+    const MachineType machine_type =
+        AccessBuilder::ForTypedArrayElement(element_type, true).machine_type;
+
+    OpIndex value =
+        __ Load(storage, index,
+                LoadOp::Kind::RawUnaligned().NotAlwaysCanonicallyAccessed(),
+                MemoryRepresentation::FromMachineType(machine_type));
+
+    Variable result = Asm().NewLoopInvariantVariable(
+        RegisterRepresentationForArrayType(element_type));
+    IF(is_little_endian) {
+#if V8_TARGET_LITTLE_ENDIAN
+      Asm().SetVariable(result, value);
+#else
+      Asm().SetVariable(result, BuildReverseBytes(element_type, value));
+#endif  // V8_TARGET_LITTLE_ENDIAN
+    }
+    ELSE {
+#if V8_TARGET_LITTLE_ENDIAN
+      Asm().SetVariable(result, BuildReverseBytes(element_type, value));
+#else
+      Asm().SetVariable(result, value);
+#endif  // V8_TARGET_LITTLE_ENDIAN
+    }
+    END_IF
+
+    // We need to keep the {object} (either the JSArrayBuffer or the JSDataView)
+    // alive so that the GC will not release the JSArrayBuffer (if there's any)
+    // as long as we are still operating on it.
+    __ Retain(object);
+    return Asm().GetVariable(result);
+  }
+
+  V<Object> REDUCE(LoadStackArgument)(V<WordPtr> base, V<WordPtr> index) {
+    V<WordPtr> argument = __ template LoadNonArrayBufferElement<WordPtr>(
+        base, AccessBuilder::ForStackArgument(), index);
+    return __ BitcastWordPtrToTagged(argument);
+  }
+
+  OpIndex REDUCE(StoreTypedElement)(OpIndex buffer, V<Object> base,
+                                    V<WordPtr> external, V<WordPtr> index,
+                                    OpIndex value,
+                                    ExternalArrayType array_type) {
+    V<WordPtr> data_ptr = BuildTypedArrayDataPointer(base, external);
+
+    // Perform the actual typed element access.
+    __ StoreArrayBufferElement(
+        data_ptr, AccessBuilder::ForTypedArrayElement(array_type, true), index,
+        value);
+
+    // We need to keep the {buffer} alive so that the GC will not release the
+    // ArrayBuffer (if there's any) as long as we are still operating on it.
+    __ Retain(buffer);
+    return {};
+  }
+
+  OpIndex REDUCE(StoreDataViewElement)(V<Object> object, V<Object> storage,
+                                       V<WordPtr> index, OpIndex value,
+                                       V<Word32> is_little_endian,
+                                       ExternalArrayType element_type) {
+    const MachineType machine_type =
+        AccessBuilder::ForTypedArrayElement(element_type, true).machine_type;
+
+    Variable value_to_store = Asm().NewLoopInvariantVariable(
+        RegisterRepresentationForArrayType(element_type));
+    IF(is_little_endian) {
+#if V8_TARGET_LITTLE_ENDIAN
+      Asm().SetVariable(value_to_store, value);
+#else
+      Asm().SetVariable(value_to_store, BuildReverseBytes(element_type, value));
+#endif  // V8_TARGET_LITTLE_ENDIAN
+    }
+    ELSE {
+#if V8_TARGET_LITTLE_ENDIAN
+      Asm().SetVariable(value_to_store, BuildReverseBytes(element_type, value));
+#else
+      Asm().SetVariable(value_to_store, value);
+#endif  // V8_TARGET_LITTLE_ENDIAN
+    }
+    END_IF
+
+    __ Store(storage, index, Asm().GetVariable(value_to_store),
+             StoreOp::Kind::RawUnaligned().NotAlwaysCanonicallyAccessed(),
+             MemoryRepresentation::FromMachineType(machine_type),
+             WriteBarrierKind::kNoWriteBarrier);
+
+    // We need to keep the {object} (either the JSArrayBuffer or the JSDataView)
+    // alive so that the GC will not release the JSArrayBuffer (if there's any)
+    // as long as we are still operating on it.
+    __ Retain(object);
+    return {};
+  }
+
+  OpIndex REDUCE(TransitionAndStoreArrayElement)(
+      V<JSArray> array, V<WordPtr> index, OpIndex value,
+      TransitionAndStoreArrayElementOp::Kind kind, MaybeHandle<Map> fast_map,
+      MaybeHandle<Map> double_map) {
+    V<Map> map = __ LoadMapField(array);
+    V<Word32> bitfield2 =
+        __ template LoadField<Word32>(map, AccessBuilder::ForMapBitField2());
+    V<Word32> elements_kind = __ Word32ShiftRightLogical(
+        __ Word32BitwiseAnd(bitfield2, Map::Bits2::ElementsKindBits::kMask),
+        Map::Bits2::ElementsKindBits::kShift);
+
+    switch (kind) {
+      case TransitionAndStoreArrayElementOp::Kind::kElement: {
+        // Possibly transition array based on input and store.
+        //
+        //   -- TRANSITION PHASE -----------------
+        //   kind = ElementsKind(array)
+        //   if value is not smi {
+        //     if kind == HOLEY_SMI_ELEMENTS {
+        //       if value is heap number {
+        //         Transition array to HOLEY_DOUBLE_ELEMENTS
+        //         kind = HOLEY_DOUBLE_ELEMENTS
+        //       } else {
+        //         Transition array to HOLEY_ELEMENTS
+        //         kind = HOLEY_ELEMENTS
+        //       }
+        //     } else if kind == HOLEY_DOUBLE_ELEMENTS {
+        //       if value is not heap number {
+        //         Transition array to HOLEY_ELEMENTS
+        //         kind = HOLEY_ELEMENTS
+        //       }
+        //     }
+        //   }
+        //
+        //   -- STORE PHASE ----------------------
+        //   [make sure {kind} is up-to-date]
+        //   if kind == HOLEY_DOUBLE_ELEMENTS {
+        //     if value is smi {
+        //       float_value = convert smi to float
+        //       Store array[index] = float_value
+        //     } else {
+        //       float_value = value
+        //       Store array[index] = float_value
+        //     }
+        //   } else {
+        //     // kind is HOLEY_SMI_ELEMENTS or HOLEY_ELEMENTS
+        //     Store array[index] = value
+        //   }
+        //
+        Label<Word32> do_store(this);
+        // We can store a smi anywhere.
+        GOTO_IF(__ ObjectIsSmi(value), do_store, elements_kind);
+
+        // {value} is a HeapObject.
+        IF_NOT (LIKELY(__ Int32LessThan(HOLEY_SMI_ELEMENTS, elements_kind))) {
+          // Transition {array} from HOLEY_SMI_ELEMENTS to HOLEY_DOUBLE_ELEMENTS
+          // or to HOLEY_ELEMENTS.
+          V<Map> value_map = __ LoadMapField(value);
+          IF (__ TaggedEqual(value_map,
+                             __ HeapConstant(factory_->heap_number_map()))) {
+            // {value} is a HeapNumber.
+            TransitionElementsTo(array, HOLEY_SMI_ELEMENTS,
+                                 HOLEY_DOUBLE_ELEMENTS,
+                                 double_map.ToHandleChecked());
+            GOTO(do_store, HOLEY_DOUBLE_ELEMENTS);
+          }
+          ELSE {
+            TransitionElementsTo(array, HOLEY_SMI_ELEMENTS, HOLEY_ELEMENTS,
+                                 fast_map.ToHandleChecked());
+            GOTO(do_store, HOLEY_ELEMENTS);
+          }
+          END_IF
+        }
+        END_IF
+
+        GOTO_IF_NOT(LIKELY(__ Int32LessThan(HOLEY_ELEMENTS, elements_kind)),
+                    do_store, elements_kind);
+
+        // We have double elements kind. Only a HeapNumber can be stored
+        // without effecting a transition.
+        V<Map> value_map = __ LoadMapField(value);
+        IF_NOT (UNLIKELY(__ TaggedEqual(
+                    value_map, __ HeapConstant(factory_->heap_number_map())))) {
+          TransitionElementsTo(array, HOLEY_DOUBLE_ELEMENTS, HOLEY_ELEMENTS,
+                               fast_map.ToHandleChecked());
+          GOTO(do_store, HOLEY_ELEMENTS);
+        }
+        END_IF
+
+        GOTO(do_store, elements_kind);
+
+        BIND(do_store, store_kind);
+        V<Object> elements = __ template LoadField<Object>(
+            array, AccessBuilder::ForJSObjectElements());
+        IF (__ Int32LessThan(HOLEY_ELEMENTS, store_kind)) {
+          // Our ElementsKind is HOLEY_DOUBLE_ELEMENTS.
+          IF (__ ObjectIsSmi(value)) {
+            V<Float64> float_value =
+                __ ChangeInt32ToFloat64(__ UntagSmi(value));
+            __ StoreNonArrayBufferElement(
+                elements, AccessBuilder::ForFixedDoubleArrayElement(), index,
+                float_value);
+          }
+          ELSE {
+            V<Float64> float_value = __ template LoadField<Float64>(
+                V<HeapObject>::Cast(value),
+                AccessBuilder::ForHeapNumberValue());
+            __ StoreNonArrayBufferElement(
+                elements, AccessBuilder::ForFixedDoubleArrayElement(), index,
+                __ Float64SilenceNaN(float_value));
+          }
+          END_IF
+        }
+        ELSE {
+          // Our ElementsKind is HOLEY_SMI_ELEMENTS or HOLEY_ELEMENTS.
+          __ StoreNonArrayBufferElement(
+              elements, AccessBuilder::ForFixedArrayElement(HOLEY_ELEMENTS),
+              index, value);
+        }
+        END_IF
+        break;
+      }
+      case TransitionAndStoreArrayElementOp::Kind::kNumberElement: {
+        // Possibly transition array based on input and store.
+        //
+        //   -- TRANSITION PHASE -----------------
+        //   kind = ElementsKind(array)
+        //   if kind == HOLEY_SMI_ELEMENTS {
+        //     Transition array to HOLEY_DOUBLE_ELEMENTS
+        //   } else if kind != HOLEY_DOUBLE_ELEMENTS {
+        //     This is UNREACHABLE, execute a debug break.
+        //   }
+        //
+        //   -- STORE PHASE ----------------------
+        //   Store array[index] = value (it's a float)
+        //
+        // {value} is a float64.
+        IF_NOT (LIKELY(__ Int32LessThan(HOLEY_SMI_ELEMENTS, elements_kind))) {
+          // Transition {array} from HOLEY_SMI_ELEMENTS to
+          // HOLEY_DOUBLE_ELEMENTS.
+          TransitionElementsTo(array, HOLEY_SMI_ELEMENTS, HOLEY_DOUBLE_ELEMENTS,
+                               double_map.ToHandleChecked());
+        }
+        ELSE {
+          // We expect that our input array started at HOLEY_SMI_ELEMENTS, and
+          // climbs the lattice up to HOLEY_DOUBLE_ELEMENTS. Force a debug break
+          // if this assumption is broken. It also would be the case that
+          // loop peeling can break this assumption.
+          IF_NOT (LIKELY(
+                      __ Word32Equal(elements_kind, HOLEY_DOUBLE_ELEMENTS))) {
+            __ Unreachable();
+          }
+          END_IF
+        }
+        END_IF
+
+        V<Object> elements = __ template LoadField<Object>(
+            array, AccessBuilder::ForJSObjectElements());
+        __ StoreNonArrayBufferElement(
+            elements, AccessBuilder::ForFixedDoubleArrayElement(), index,
+            __ Float64SilenceNaN(value));
+        break;
+      }
+      case TransitionAndStoreArrayElementOp::Kind::kOddballElement:
+      case TransitionAndStoreArrayElementOp::Kind::kNonNumberElement: {
+        // Possibly transition array based on input and store.
+        //
+        //   -- TRANSITION PHASE -----------------
+        //   kind = ElementsKind(array)
+        //   if kind == HOLEY_SMI_ELEMENTS {
+        //     Transition array to HOLEY_ELEMENTS
+        //   } else if kind == HOLEY_DOUBLE_ELEMENTS {
+        //     Transition array to HOLEY_ELEMENTS
+        //   }
+        //
+        //   -- STORE PHASE ----------------------
+        //   // kind is HOLEY_ELEMENTS
+        //   Store array[index] = value
+        //
+        IF_NOT (LIKELY(__ Int32LessThan(HOLEY_SMI_ELEMENTS, elements_kind))) {
+          // Transition {array} from HOLEY_SMI_ELEMENTS to HOLEY_ELEMENTS.
+          TransitionElementsTo(array, HOLEY_SMI_ELEMENTS, HOLEY_ELEMENTS,
+                               fast_map.ToHandleChecked());
+        }
+        ELSE_IF (UNLIKELY(__ Int32LessThan(HOLEY_ELEMENTS, elements_kind))) {
+          TransitionElementsTo(array, HOLEY_DOUBLE_ELEMENTS, HOLEY_ELEMENTS,
+                               fast_map.ToHandleChecked());
+        }
+        END_IF
+
+        V<Object> elements = __ template LoadField<Object>(
+            array, AccessBuilder::ForJSObjectElements());
+        ElementAccess access =
+            AccessBuilder::ForFixedArrayElement(HOLEY_ELEMENTS);
+        if (kind == TransitionAndStoreArrayElementOp::Kind::kOddballElement) {
+          access.type = compiler::Type::BooleanOrNullOrUndefined();
+          access.write_barrier_kind = kNoWriteBarrier;
+        }
+        __ StoreNonArrayBufferElement(elements, access, index, value);
+        break;
+      }
+      case TransitionAndStoreArrayElementOp::Kind::kSignedSmallElement: {
+        // Store a signed small in an output array.
+        //
+        //   kind = ElementsKind(array)
+        //
+        //   -- STORE PHASE ----------------------
+        //   if kind == HOLEY_DOUBLE_ELEMENTS {
+        //     float_value = convert int32 to float
+        //     Store array[index] = float_value
+        //   } else {
+        //     // kind is HOLEY_SMI_ELEMENTS or HOLEY_ELEMENTS
+        //     smi_value = convert int32 to smi
+        //     Store array[index] = smi_value
+        //   }
+        //
+        V<Object> elements = __ template LoadField<Object>(
+            array, AccessBuilder::ForJSObjectElements());
+        IF (__ Int32LessThan(HOLEY_ELEMENTS, elements_kind)) {
+          // Our ElementsKind is HOLEY_DOUBLE_ELEMENTS.
+          V<Float64> f64 = __ ChangeInt32ToFloat64(value);
+          __ StoreNonArrayBufferElement(
+              elements, AccessBuilder::ForFixedDoubleArrayElement(), index,
+              f64);
+        }
+        ELSE {
+          // Our ElementsKind is HOLEY_SMI_ELEMENTS or HOLEY_ELEMENTS.
+          // In this case, we know our value is a signed small, and we can
+          // optimize the ElementAccess information.
+          ElementAccess access = AccessBuilder::ForFixedArrayElement();
+          access.type = compiler::Type::SignedSmall();
+          access.machine_type = MachineType::TaggedSigned();
+          access.write_barrier_kind = kNoWriteBarrier;
+          __ StoreNonArrayBufferElement(elements, access, index,
+                                        __ TagSmi(value));
+        }
+        END_IF
+        break;
+      }
+    }
+
+    return OpIndex::Invalid();
+  }
+
+  V<Word32> REDUCE(CompareMaps)(V<HeapObject> heap_object,
+                                const ZoneRefSet<Map>& maps) {
+    return CompareMapAgainstMultipleMaps(__ LoadMapField(heap_object), maps);
+  }
+
+  OpIndex REDUCE(CheckMaps)(V<HeapObject> heap_object, OpIndex frame_state,
+                            const ZoneRefSet<Map>& maps, CheckMapsFlags flags,
+                            const FeedbackSource& feedback) {
+    if (maps.is_empty()) {
+      __ Deoptimize(frame_state, DeoptimizeReason::kWrongMap, feedback);
+      return OpIndex::Invalid();
+    }
+
+    if (flags & CheckMapsFlag::kTryMigrateInstance) {
+      V<Map> heap_object_map = __ LoadMapField(heap_object);
+      IF_NOT (LIKELY(CompareMapAgainstMultipleMaps(heap_object_map, maps))) {
+        // Reloading the map slightly reduces register pressure, and we are on a
+        // slow path here anyway.
+        MigrateInstanceOrDeopt(heap_object, __ LoadMapField(heap_object),
+                               frame_state, feedback);
+        __ DeoptimizeIfNot(__ CompareMaps(heap_object, maps), frame_state,
+                           DeoptimizeReason::kWrongMap, feedback);
+      }
+      END_IF
+    } else {
+      __ DeoptimizeIfNot(__ CompareMaps(heap_object, maps), frame_state,
+                         DeoptimizeReason::kWrongMap, feedback);
+    }
+    // Inserting a AssumeMap so that subsequent optimizations know the map of
+    // this object.
+    __ AssumeMap(heap_object, maps);
+    return OpIndex::Invalid();
+  }
+
+  OpIndex REDUCE(FloatUnary)(OpIndex input, FloatUnaryOp::Kind kind,
+                             FloatRepresentation rep) {
+    LABEL_BLOCK(no_change) { return Next::ReduceFloatUnary(input, kind, rep); }
+    switch (kind) {
+      case FloatUnaryOp::Kind::kRoundUp:
+      case FloatUnaryOp::Kind::kRoundDown:
+      case FloatUnaryOp::Kind::kRoundTiesEven:
+      case FloatUnaryOp::Kind::kRoundToZero: {
+        DCHECK_EQ(rep, FloatRepresentation::Float64());
+        if (FloatUnaryOp::IsSupported(kind, rep)) {
+          // If we have a fast machine operation for this, we can just keep it.
+          goto no_change;
+        }
+        // Otherwise we have to lower it.
+        V<Float64> two_52 = __ Float64Constant(4503599627370496.0E0);
+        V<Float64> minus_two_52 = __ Float64Constant(-4503599627370496.0E0);
+
+        if (kind == FloatUnaryOp::Kind::kRoundUp) {
+          // General case for ceil.
+          //
+          //   if 0.0 < input then
+          //     if 2^52 <= input then
+          //       input
+          //     else
+          //       let temp1 = (2^52 + input) - 2^52 in
+          //       if temp1 < input then
+          //         temp1 + 1
+          //       else
+          //         temp1
+          //   else
+          //     if input == 0 then
+          //       input
+          //     else
+          //       if input <= -2^52 then
+          //         input
+          //       else
+          //         let temp1 = -0 - input in
+          //         let temp2 = (2^52 + temp1) - 2^52 in
+          //         if temp1 < temp2 then -0 - (temp2 - 1) else -0 - temp2
+
+          Label<Float64> done(this);
+
+          IF(LIKELY(__ Float64LessThan(0.0, input))) {
+            GOTO_IF(UNLIKELY(__ Float64LessThanOrEqual(two_52, input)), done,
+                    input);
+            V<Float64> temp1 =
+                __ Float64Sub(__ Float64Add(two_52, input), two_52);
+            GOTO_IF_NOT(__ Float64LessThan(temp1, input), done, temp1);
+            GOTO(done, __ Float64Add(temp1, 1.0));
+          }
+          ELSE_IF(UNLIKELY(__ Float64Equal(input, 0.0))) { GOTO(done, input); }
+          ELSE_IF(UNLIKELY(__ Float64LessThanOrEqual(input, minus_two_52))) {
+            GOTO(done, input);
+          }
+          ELSE {
+            V<Float64> temp1 = __ Float64Sub(-0.0, input);
+            V<Float64> temp2 =
+                __ Float64Sub(__ Float64Add(two_52, temp1), two_52);
+            GOTO_IF_NOT(__ Float64LessThan(temp1, temp2), done,
+                        __ Float64Sub(-0.0, temp2));
+            GOTO(done, __ Float64Sub(-0.0, __ Float64Sub(temp2, 1.0)));
+          }
+          END_IF
+
+          BIND(done, result);
+          return result;
+        } else if (kind == FloatUnaryOp::Kind::kRoundDown) {
+          // General case for floor.
+          //
+          //   if 0.0 < input then
+          //     if 2^52 <= input then
+          //       input
+          //     else
+          //       let temp1 = (2^52 + input) - 2^52 in
+          //       if input < temp1 then
+          //         temp1 - 1
+          //       else
+          //         temp1
+          //   else
+          //     if input == 0 then
+          //       input
+          //     else
+          //       if input <= -2^52 then
+          //         input
+          //       else
+          //         let temp1 = -0 - input in
+          //         let temp2 = (2^52 + temp1) - 2^52 in
+          //         if temp2 < temp1 then
+          //           -1 - temp2
+          //         else
+          //           -0 - temp2
+
+          Label<Float64> done(this);
+
+          IF(LIKELY(__ Float64LessThan(0.0, input))) {
+            GOTO_IF(UNLIKELY(__ Float64LessThanOrEqual(two_52, input)), done,
+                    input);
+            V<Float64> temp1 =
+                __ Float64Sub(__ Float64Add(two_52, input), two_52);
+            GOTO_IF_NOT(__ Float64LessThan(input, temp1), done, temp1);
+            GOTO(done, __ Float64Sub(temp1, 1.0));
+          }
+          ELSE_IF(UNLIKELY(__ Float64Equal(input, 0.0))) { GOTO(done, input); }
+          ELSE_IF(UNLIKELY(__ Float64LessThanOrEqual(input, minus_two_52))) {
+            GOTO(done, input);
+          }
+          ELSE {
+            V<Float64> temp1 = __ Float64Sub(-0.0, input);
+            V<Float64> temp2 =
+                __ Float64Sub(__ Float64Add(two_52, temp1), two_52);
+            GOTO_IF_NOT(__ Float64LessThan(temp2, temp1), done,
+                        __ Float64Sub(-0.0, temp2));
+            GOTO(done, __ Float64Sub(-1.0, temp2));
+          }
+          END_IF
+
+          BIND(done, result);
+          return result;
+        } else if (kind == FloatUnaryOp::Kind::kRoundTiesEven) {
+          // Generate case for round ties to even:
+          //
+          //   let value = floor(input) in
+          //   let temp1 = input - value in
+          //   if temp1 < 0.5 then
+          //     value
+          //   else if 0.5 < temp1 then
+          //     value + 1.0
+          //   else
+          //     let temp2 = value % 2.0 in
+          //     if temp2 == 0.0 then
+          //       value
+          //     else
+          //       value + 1.0
+
+          Label<Float64> done(this);
+
+          V<Float64> value = __ Float64RoundDown(input);
+          V<Float64> temp1 = __ Float64Sub(input, value);
+          GOTO_IF(__ Float64LessThan(temp1, 0.5), done, value);
+          GOTO_IF(__ Float64LessThan(0.5, temp1), done,
+                  __ Float64Add(value, 1.0));
+
+          V<Float64> temp2 = __ Float64Mod(value, 2.0);
+          GOTO_IF(__ Float64Equal(temp2, 0.0), done, value);
+          GOTO(done, __ Float64Add(value, 1.0));
+
+          BIND(done, result);
+          return result;
+        } else if (kind == FloatUnaryOp::Kind::kRoundToZero) {
+          // General case for trunc.
+          //
+          //   if 0.0 < input then
+          //     if 2^52 <= input then
+          //       input
+          //     else
+          //       let temp1 = (2^52 + input) - 2^52 in
+          //       if input < temp1 then
+          //         temp1 - 1
+          //       else
+          //         temp1
+          //   else
+          //     if input == 0 then
+          //        input
+          //     if input <= -2^52 then
+          //       input
+          //     else
+          //       let temp1 = -0 - input in
+          //       let temp2 = (2^52 + temp1) - 2^52 in
+          //       if temp1 < temp2 then
+          //          -0 - (temp2 - 1)
+          //       else
+          //          -0 - temp2
+
+          Label<Float64> done(this);
+
+          IF(__ Float64LessThan(0.0, input)) {
+            GOTO_IF(UNLIKELY(__ Float64LessThanOrEqual(two_52, input)), done,
+                    input);
+
+            V<Float64> temp1 =
+                __ Float64Sub(__ Float64Add(two_52, input), two_52);
+            GOTO_IF(__ Float64LessThan(input, temp1), done,
+                    __ Float64Sub(temp1, 1.0));
+            GOTO(done, temp1);
+          }
+          ELSE {
+            GOTO_IF(UNLIKELY(__ Float64Equal(input, 0.0)), done, input);
+            GOTO_IF(UNLIKELY(__ Float64LessThanOrEqual(input, minus_two_52)),
+                    done, input);
+
+            V<Float64> temp1 = __ Float64Sub(-0.0, input);
+            V<Float64> temp2 =
+                __ Float64Sub(__ Float64Add(two_52, temp1), two_52);
+
+            IF(__ Float64LessThan(temp1, temp2)) {
+              GOTO(done, __ Float64Sub(-0.0, __ Float64Sub(temp2, 1.0)));
+            }
+            ELSE { GOTO(done, __ Float64Sub(-0.0, temp2)); }
+            END_IF
+          }
+          END_IF
+
+          BIND(done, result);
+          return result;
+        }
+        UNREACHABLE();
+      }
+      default:
+        DCHECK(FloatUnaryOp::IsSupported(kind, rep));
+        goto no_change;
+    }
+    UNREACHABLE();
+  }
+
+  V<Object> REDUCE(CheckedClosure)(V<Object> input, OpIndex frame_state,
+                                   Handle<FeedbackCell> feedback_cell) {
+    // Check that {input} is actually a JSFunction.
+    V<Map> map = __ LoadMapField(input);
+    V<Word32> instance_type = __ LoadInstanceTypeField(map);
+    V<Word32> is_function_type = __ Uint32LessThanOrEqual(
+        __ Word32Sub(instance_type, FIRST_JS_FUNCTION_TYPE),
+        (LAST_JS_FUNCTION_TYPE - FIRST_JS_FUNCTION_TYPE));
+    __ DeoptimizeIfNot(is_function_type, frame_state,
+                       DeoptimizeReason::kWrongCallTarget, FeedbackSource{});
+
+    // Check that the {input}s feedback vector cell matches the one
+    // we recorded before.
+    V<HeapObject> cell = __ template LoadField<HeapObject>(
+        input, AccessBuilder::ForJSFunctionFeedbackCell());
+    __ DeoptimizeIfNot(__ TaggedEqual(cell, __ HeapConstant(feedback_cell)),
+                       frame_state, DeoptimizeReason::kWrongFeedbackCell,
+                       FeedbackSource{});
+    return input;
+  }
+
+  OpIndex REDUCE(CheckEqualsInternalizedString)(V<Object> expected,
+                                                V<Object> value,
+                                                OpIndex frame_state) {
+    Label<> done(this);
+    // Check if {expected} and {value} are the same, which is the likely case.
+    GOTO_IF(LIKELY(__ TaggedEqual(expected, value)), done);
+
+    // Now {value} could still be a non-internalized String that matches
+    // {expected}.
+    __ DeoptimizeIf(__ ObjectIsSmi(value), frame_state,
+                    DeoptimizeReason::kWrongName, FeedbackSource{});
+    V<Map> value_map = __ LoadMapField(value);
+    V<Word32> value_instance_type = __ LoadInstanceTypeField(value_map);
+    V<Word32> value_representation =
+        __ Word32BitwiseAnd(value_instance_type, kStringRepresentationMask);
+    // ThinString
+    IF (__ Word32Equal(value_representation, kThinStringTag)) {
+      // The {value} is a ThinString, let's check the actual value.
+      V<String> value_actual = __ template LoadField<String>(
+          value, AccessBuilder::ForThinStringActual());
+      __ DeoptimizeIfNot(__ TaggedEqual(expected, value_actual), frame_state,
+                         DeoptimizeReason::kWrongName, FeedbackSource{});
+    }
+    ELSE {
+      // Check that the {value} is a non-internalized String, if it's anything
+      // else it cannot match the recorded feedback {expected} anyways.
+      __ DeoptimizeIfNot(
+          __ Word32Equal(
+              __ Word32BitwiseAnd(value_instance_type,
+                                  kIsNotStringMask | kIsNotInternalizedMask),
+              kStringTag | kNotInternalizedTag),
+          frame_state, DeoptimizeReason::kWrongName, FeedbackSource{});
+
+      // Try to find the {value} in the string table.
+      MachineSignature::Builder builder(__ graph_zone(), 1, 2);
+      builder.AddReturn(MachineType::AnyTagged());
+      builder.AddParam(MachineType::Pointer());
+      builder.AddParam(MachineType::AnyTagged());
+      OpIndex try_string_to_index_or_lookup_existing = __ ExternalConstant(
+          ExternalReference::try_string_to_index_or_lookup_existing());
+      OpIndex isolate_ptr =
+          __ ExternalConstant(ExternalReference::isolate_address(isolate_));
+      V<String> value_internalized = __ Call(
+          try_string_to_index_or_lookup_existing, {isolate_ptr, value},
+          TSCallDescriptor::Create(Linkage::GetSimplifiedCDescriptor(
+                                       __ graph_zone(), builder.Build()),
+                                   CanThrow::kNo, __ graph_zone()));
+
+      // Now see if the results match.
+      __ DeoptimizeIfNot(__ TaggedEqual(expected, value_internalized),
+                         frame_state, DeoptimizeReason::kWrongName,
+                         FeedbackSource{});
+    }
+    END_IF
+    GOTO(done);
+
+    BIND(done);
+    return OpIndex::Invalid();
+  }
+
+  V<Object> REDUCE(LoadMessage)(V<WordPtr> offset) {
+    return __ BitcastWordPtrToTagged(__ template LoadField<WordPtr>(
+        offset, AccessBuilder::ForExternalIntPtr()));
+  }
+
+  OpIndex REDUCE(StoreMessage)(V<WordPtr> offset, V<Object> object) {
+    __ StoreField(offset, AccessBuilder::ForExternalIntPtr(),
+                  __ BitcastTaggedToWord(object));
+    return OpIndex::Invalid();
+  }
+
+  V<Boolean> REDUCE(SameValue)(OpIndex left, OpIndex right,
+                               SameValueOp::Mode mode) {
+    switch (mode) {
+      case SameValueOp::Mode::kSameValue:
+        return __ CallBuiltin_SameValue(isolate_, left, right);
+      case SameValueOp::Mode::kSameValueNumbersOnly:
+        return __ CallBuiltin_SameValueNumbersOnly(isolate_, left, right);
+    }
+  }
+
+  V<Word32> REDUCE(Float64SameValue)(OpIndex left, OpIndex right) {
+    Label<Word32> done(this);
+
+    IF(__ Float64Equal(left, right)) {
+      // Even if the values are float64-equal, we still need to distinguish
+      // zero and minus zero.
+      V<Word32> left_hi = __ Float64ExtractHighWord32(left);
+      V<Word32> right_hi = __ Float64ExtractHighWord32(right);
+      GOTO(done, __ Word32Equal(left_hi, right_hi));
+    }
+    ELSE {
+      // Return true iff both {lhs} and {rhs} are NaN.
+      GOTO_IF(__ Float64Equal(left, left), done, 0);
+      GOTO_IF(__ Float64Equal(right, right), done, 0);
+      GOTO(done, 1);
+    }
+    END_IF
+
+    BIND(done, result);
+    return result;
+  }
+
+  OpIndex REDUCE(RuntimeAbort)(AbortReason reason) {
+    __ CallRuntime_Abort(isolate_, __ NoContextConstant(),
+                         __ TagSmi(static_cast<int>(reason)));
+    return OpIndex::Invalid();
+  }
+
+  V<Object> REDUCE(EnsureWritableFastElements)(V<Object> object,
+                                               V<Object> elements) {
+    Label<Object> done(this);
+    // Load the current map of {elements}.
+    V<Map> map = __ LoadMapField(elements);
+
+    // Check if {elements} is not a copy-on-write FixedArray.
+    // Nothing to do if the {elements} are not copy-on-write.
+    GOTO_IF(LIKELY(__ TaggedEqual(
+                map, __ HeapConstant(factory_->fixed_array_map()))),
+            done, elements);
+
+    // We need to take a copy of the {elements} and set them up for {object}.
+    V<Object> copy =
+        __ CallBuiltin_CopyFastSmiOrObjectElements(isolate_, object);
+    GOTO(done, copy);
+
+    BIND(done, result);
+    return result;
+  }
+
+  V<Object> REDUCE(MaybeGrowFastElements)(V<Object> object, V<Object> elements,
+                                          V<Word32> index,
+                                          V<Word32> elements_length,
+                                          OpIndex frame_state,
+                                          GrowFastElementsMode mode,
+                                          const FeedbackSource& feedback) {
+    Label<Object> done(this);
+    // Check if we need to grow the {elements} backing store.
+    GOTO_IF(LIKELY(__ Uint32LessThan(index, elements_length)), done, elements);
+    // We need to grow the {elements} for {object}.
+    V<Object> new_elements;
+    switch (mode) {
+      case GrowFastElementsMode::kDoubleElements:
+        new_elements = __ CallBuiltin_GrowFastDoubleElements(isolate_, object,
+                                                             __ TagSmi(index));
+        break;
+      case GrowFastElementsMode::kSmiOrObjectElements:
+        new_elements = __ CallBuiltin_GrowFastSmiOrObjectElements(
+            isolate_, object, __ TagSmi(index));
+        break;
+    }
+
+    // Ensure that we were able to grow the {elements}.
+    __ DeoptimizeIf(__ ObjectIsSmi(new_elements), frame_state,
+                    DeoptimizeReason::kCouldNotGrowElements, feedback);
+    GOTO(done, new_elements);
+
+    BIND(done, result);
+    return result;
+  }
+
+  OpIndex REDUCE(TransitionElementsKind)(V<HeapObject> object,
+                                         const ElementsTransition& transition) {
+    V<Map> source_map = __ HeapConstant(transition.source().object());
+    V<Map> target_map = __ HeapConstant(transition.target().object());
+
+    // Load the current map of {object}.
+    V<Map> map = __ LoadMapField(object);
+
+    // Check if {map} is the same as {source_map}.
+    IF(UNLIKELY(__ TaggedEqual(map, source_map))) {
+      switch (transition.mode()) {
+        case ElementsTransition::kFastTransition:
+          // In-place migration of {object}, just store the {target_map}.
+          __ StoreField(object, AccessBuilder::ForMap(), target_map);
+          break;
+        case ElementsTransition::kSlowTransition:
+          // Instance migration, call out to the runtime for {object}.
+          __ CallRuntime_TransitionElementsKind(
+              isolate_, __ NoContextConstant(), object, target_map);
+          break;
+      }
+    }
+    END_IF
+
+    return OpIndex::Invalid();
+  }
+
+  OpIndex REDUCE(FindOrderedHashEntry)(V<Object> data_structure, OpIndex key,
+                                       FindOrderedHashEntryOp::Kind kind) {
+    switch (kind) {
+      case FindOrderedHashEntryOp::Kind::kFindOrderedHashMapEntry:
+        return __ CallBuiltin_FindOrderedHashMapEntry(
+            isolate_, __ NoContextConstant(), data_structure, key);
+      case FindOrderedHashEntryOp::Kind::kFindOrderedHashMapEntryForInt32Key: {
+        // Compute the integer hash code.
+        V<WordPtr> hash = __ ChangeUint32ToUintPtr(ComputeUnseededHash(key));
+
+        V<WordPtr> number_of_buckets =
+            __ ChangeInt32ToIntPtr(__ UntagSmi(__ template LoadField<Smi>(
+                data_structure,
+                AccessBuilder::ForOrderedHashMapOrSetNumberOfBuckets())));
+        hash = __ WordPtrBitwiseAnd(hash, __ WordPtrSub(number_of_buckets, 1));
+        V<WordPtr> first_entry = __ ChangeInt32ToIntPtr(__ UntagSmi(__ Load(
+            data_structure,
+            __ WordPtrAdd(__ WordPtrShiftLeft(hash, kTaggedSizeLog2),
+                          OrderedHashMap::HashTableStartOffset()),
+            LoadOp::Kind::TaggedBase(), MemoryRepresentation::TaggedSigned())));
+
+        Label<WordPtr> done(this);
+        LoopLabel<WordPtr> loop(this);
+        GOTO(loop, first_entry);
+
+        LOOP(loop, entry) {
+          GOTO_IF(__ WordPtrEqual(entry, OrderedHashMap::kNotFound), done,
+                  entry);
+          V<WordPtr> candidate =
+              __ WordPtrAdd(__ WordPtrMul(entry, OrderedHashMap::kEntrySize),
+                            number_of_buckets);
+          V<Object> candidate_key = __ Load(
+              data_structure,
+              __ WordPtrAdd(__ WordPtrShiftLeft(candidate, kTaggedSizeLog2),
+                            OrderedHashMap::HashTableStartOffset()),
+              LoadOp::Kind::TaggedBase(), MemoryRepresentation::AnyTagged());
+
+          IF (LIKELY(__ ObjectIsSmi(candidate_key))) {
+            GOTO_IF(__ Word32Equal(__ UntagSmi(candidate_key), key), done,
+                    candidate);
+          }
+          ELSE_IF (__ TaggedEqual(
+                       __ LoadMapField(candidate_key),
+                       __ HeapConstant(factory_->heap_number_map()))) {
+            GOTO_IF(__ Float64Equal(
+                        __ template LoadField<Float64>(
+                            candidate_key, AccessBuilder::ForHeapNumberValue()),
+                        __ ChangeInt32ToFloat64(key)),
+                    done, candidate);
+          }
+          END_IF
+
+          V<WordPtr> next_entry = __ ChangeInt32ToIntPtr(__ UntagSmi(__ Load(
+              data_structure,
+              __ WordPtrAdd(__ WordPtrShiftLeft(candidate, kTaggedSizeLog2),
+                            (OrderedHashMap::HashTableStartOffset() +
+                             OrderedHashMap::kChainOffset * kTaggedSize)),
+              LoadOp::Kind::TaggedBase(),
+              MemoryRepresentation::TaggedSigned())));
+          GOTO(loop, next_entry);
+        }
+
+        BIND(done, result);
+        return result;
+      }
+      case FindOrderedHashEntryOp::Kind::kFindOrderedHashSetEntry:
+        return __ CallBuiltin_FindOrderedHashSetEntry(
+            isolate_, __ NoContextConstant(), data_structure, key);
+    }
+  }
 
  private:
-  // TODO(nicohartmann@): Might move some of those helpers into the assembler
-  // interface.
   // Pass {bitfield} = {digit} = OpIndex::Invalid() to construct the canonical
   // 0n BigInt.
   V<BigInt> AllocateBigInt(V<Word32> bitfield, V<Word64> digit) {
+    if (Asm().generating_unreachable_operations()) return OpIndex::Invalid();
+
     DCHECK(Is64());
     DCHECK_EQ(bitfield.valid(), digit.valid());
     static constexpr auto zero_bitfield =
         BigInt::SignBits::update(BigInt::LengthBits::encode(0), false);
 
-    V<Tagged> map = __ HeapConstant(factory_->bigint_map());
-    auto bigint = V<FreshlyAllocatedBigInt>::Cast(
-        __ Allocate(__ IntPtrConstant(BigInt::SizeFor(digit.valid() ? 1 : 0)),
-                    AllocationType::kYoung));
-    __ StoreField(bigint, AccessBuilder::ForMap(), map);
-    __ StoreField(
+    V<Map> map = __ HeapConstant(factory_->bigint_map());
+    auto bigint = __ template Allocate<FreshlyAllocatedBigInt>(
+        __ IntPtrConstant(BigInt::SizeFor(digit.valid() ? 1 : 0)),
+        AllocationType::kYoung);
+    __ InitializeField(bigint, AccessBuilder::ForMap(), map);
+    __ InitializeField(
         bigint, AccessBuilder::ForBigIntBitfield(),
         bitfield.valid() ? bitfield : __ Word32Constant(zero_bitfield));
 
     // BigInts have no padding on 64 bit architectures with pointer compression.
     if (BigInt::HasOptionalPadding()) {
-      __ StoreField(bigint, AccessBuilder::ForBigIntOptionalPadding(),
-                    __ IntPtrConstant(0));
+      __ InitializeField(bigint, AccessBuilder::ForBigIntOptionalPadding(),
+                         __ IntPtrConstant(0));
     }
     if (digit.valid()) {
-      __ StoreField(bigint, AccessBuilder::ForBigIntLeastSignificantDigit64(),
-                    digit);
+      __ InitializeField(
+          bigint, AccessBuilder::ForBigIntLeastSignificantDigit64(), digit);
     }
-    return V<BigInt>::Cast(bigint);
-  }
-
-  // TODO(nicohartmann@): Should also make this an operation and lower in
-  // TagUntagLoweringReducer.
-  V<Word32> IsSmi(V<Tagged> input) {
-    return __ Word32Equal(
-        __ Word32BitwiseAnd(V<Word32>::Cast(input),
-                            static_cast<uint32_t>(kSmiTagMask)),
-        static_cast<uint32_t>(kSmiTag));
+    return V<BigInt>::Cast(__ FinishInitialization(std::move(bigint)));
   }
 
-  void SmiTagOrOverflow(V<Word32> input, Label<>* overflow,
+  void TagSmiOrOverflow(V<Word32> input, Label<>* overflow,
                         Label<Tagged>* done) {
     DCHECK(SmiValuesAre31Bits());
 
@@ -1674,37 +2880,45 @@ class MachineLoweringReducer : public Next {
     // Since smi tagging shifts left by one, it's the same as adding value
     // twice.
     OpIndex add = __ Int32AddCheckOverflow(input, input);
-    V<Word32> check = __ Projection(add, 1, WordRepresentation::Word32());
-    GOTO_IF(check, *overflow);
-    GOTO(*done, __ SmiTag(input));
+    V<Word32> check = __ template Projection<Word32>(add, 1);
+    GOTO_IF(UNLIKELY(check), *overflow);
+    GOTO(*done,
+         __ BitcastWord32ToTagged(__ template Projection<Word32>(add, 0)));
+  }
+
+  // `IsNonZero` converts any non-0 value into 1.
+  V<Word32> IsNonZero(V<Word32> value) {
+    return __ Word32Equal(__ Word32Equal(value, 0), 0);
   }
 
   V<Tagged> AllocateHeapNumberWithValue(V<Float64> value) {
-    V<Tagged> result = __ Allocate(__ IntPtrConstant(HeapNumber::kSize),
-                                   AllocationType::kYoung);
-    __ StoreField(result, AccessBuilder::ForMap(),
-                  __ HeapConstant(factory_->heap_number_map()));
-    __ StoreField(result, AccessBuilder::ForHeapNumberValue(), value);
-    return result;
+    auto result = __ template Allocate<HeapNumber>(
+        __ IntPtrConstant(HeapNumber::kSize), AllocationType::kYoung);
+    __ InitializeField(result, AccessBuilder::ForMap(),
+                       __ HeapConstant(factory_->heap_number_map()));
+    __ InitializeField(result, AccessBuilder::ForHeapNumberValue(), value);
+    return __ FinishInitialization(std::move(result));
   }
 
   V<Float64> ConvertHeapObjectToFloat64OrDeopt(
       V<Tagged> heap_object, OpIndex frame_state,
-      ConvertObjectToPrimitiveOrDeoptOp::ObjectKind input_kind,
+      ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind input_kind,
       const FeedbackSource& feedback) {
-    V<Tagged> map = __ LoadMapField(heap_object);
+    V<Map> map = __ LoadMapField(heap_object);
     V<Word32> check_number =
         __ TaggedEqual(map, __ HeapConstant(factory_->heap_number_map()));
     switch (input_kind) {
-      case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kSmi:
-      case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumberOrString:
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kSmi:
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::
+          kNumberOrString:
         UNREACHABLE();
-      case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumber: {
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kNumber: {
         __ DeoptimizeIfNot(check_number, frame_state,
                            DeoptimizeReason::kNotAHeapNumber, feedback);
         break;
       }
-      case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumberOrBoolean: {
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::
+          kNumberOrBoolean: {
         IF_NOT(check_number) {
           STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
                                             Oddball::kToNumberRawOffset);
@@ -1715,14 +2929,14 @@ class MachineLoweringReducer : public Next {
         END_IF
         break;
       }
-      case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumberOrOddball: {
+      case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::
+          kNumberOrOddball: {
         IF_NOT(check_number) {
           // For oddballs also contain the numeric value, let us just check that
           // we have an oddball here.
           STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
                                             Oddball::kToNumberRawOffset);
-          V<Word32> instance_type = __ template LoadField<Word32>(
-              map, AccessBuilder::ForMapInstanceType());
+          V<Word32> instance_type = __ LoadInstanceTypeField(map);
           __ DeoptimizeIfNot(__ Word32Equal(instance_type, ODDBALL_TYPE),
                              frame_state,
                              DeoptimizeReason::kNotANumberOrOddball, feedback);
@@ -1740,12 +2954,12 @@ class MachineLoweringReducer : public Next {
     Label<Word32> done(this);
 
     IF(onebyte) {
-      GOTO(done, __ template LoadElement<Word32>(
+      GOTO(done, __ template LoadNonArrayBufferElement<Word32>(
                      receiver, AccessBuilder::ForSeqOneByteStringCharacter(),
                      position));
     }
     ELSE {
-      GOTO(done, __ template LoadElement<Word32>(
+      GOTO(done, __ template LoadNonArrayBufferElement<Word32>(
                      receiver, AccessBuilder::ForSeqTwoByteStringCharacter(),
                      position));
     }
@@ -1755,6 +2969,24 @@ class MachineLoweringReducer : public Next {
     return result;
   }
 
+  void MigrateInstanceOrDeopt(V<HeapObject> heap_object, V<Map> heap_object_map,
+                              OpIndex frame_state,
+                              const FeedbackSource& feedback) {
+    // If {heap_object_map} is not deprecated, the migration attempt does not
+    // make sense.
+    V<Word32> bitfield3 = __ template LoadField<Word32>(
+        heap_object_map, AccessBuilder::ForMapBitField3());
+    V<Word32> deprecated =
+        __ Word32BitwiseAnd(bitfield3, Map::Bits3::IsDeprecatedBit::kMask);
+    __ DeoptimizeIfNot(deprecated, frame_state, DeoptimizeReason::kWrongMap,
+                       feedback);
+    V<Object> result = __ CallRuntime_TryMigrateInstance(
+        isolate_, __ NoContextConstant(), heap_object);
+    // TryMigrateInstance returns a Smi value to signal failure.
+    __ DeoptimizeIf(__ ObjectIsSmi(result), frame_state,
+                    DeoptimizeReason::kInstanceMigrationFailed, feedback);
+  }
+
   // TODO(nicohartmann@): Might use the CallBuiltinDescriptors here.
   OpIndex CallBuiltinForBigIntOp(Builtin builtin,
                                  std::initializer_list<OpIndex> arguments) {
@@ -1770,7 +3002,8 @@ class MachineLoweringReducer : public Next {
         __ graph_zone(), callable.descriptor(),
         callable.descriptor().GetStackParameterCount(),
         CallDescriptor::kNoFlags, Operator::kFoldable | Operator::kNoThrow);
-    auto ts_descriptor = TSCallDescriptor::Create(descriptor, __ graph_zone());
+    auto ts_descriptor =
+        TSCallDescriptor::Create(descriptor, CanThrow::kNo, __ graph_zone());
     return __ Call(__ HeapConstant(callable.code()), OpIndex::Invalid(),
                    base::VectorOf(args), ts_descriptor);
   }
@@ -1800,8 +3033,106 @@ class MachineLoweringReducer : public Next {
     }
   }
 
-  Factory* factory_;
-  Isolate* isolate_;
+  V<WordPtr> BuildTypedArrayDataPointer(V<Object> base, V<WordPtr> external) {
+    if (__ MatchZero(base)) return external;
+    V<WordPtr> untagged_base = __ BitcastTaggedToWord(base);
+    if (COMPRESS_POINTERS_BOOL) {
+      // Zero-extend Tagged_t to UintPtr according to current compression
+      // scheme so that the addition with |external_pointer| (which already
+      // contains compensated offset value) will decompress the tagged value.
+      // See JSTypedArray::ExternalPointerCompensationForOnHeapArray() for
+      // details.
+      untagged_base =
+          __ ChangeUint32ToUintPtr(__ TruncateWordPtrToWord32(untagged_base));
+    }
+    return __ WordPtrAdd(untagged_base, external);
+  }
+
+  OpIndex BuildReverseBytes(ExternalArrayType type, OpIndex value) {
+    switch (type) {
+      case kExternalInt8Array:
+      case kExternalUint8Array:
+      case kExternalUint8ClampedArray:
+        return value;
+      case kExternalInt16Array:
+        return __ Word32ShiftRightArithmetic(__ Word32ReverseBytes(value), 16);
+      case kExternalUint16Array:
+        return __ Word32ShiftRightLogical(__ Word32ReverseBytes(value), 16);
+      case kExternalInt32Array:
+      case kExternalUint32Array:
+        return __ Word32ReverseBytes(value);
+      case kExternalFloat32Array: {
+        V<Word32> bytes = __ BitcastFloat32ToWord32(value);
+        V<Word32> reversed = __ Word32ReverseBytes(bytes);
+        return __ BitcastWord32ToFloat32(reversed);
+      }
+      case kExternalFloat64Array: {
+        if constexpr (Is64()) {
+          V<Word64> bytes = __ BitcastFloat64ToWord64(value);
+          V<Word64> reversed = __ Word64ReverseBytes(bytes);
+          return __ BitcastWord64ToFloat64(reversed);
+        } else {
+          V<Word32> reversed_lo =
+              __ Word32ReverseBytes(__ Float64ExtractLowWord32(value));
+          V<Word32> reversed_hi =
+              __ Word32ReverseBytes(__ Float64ExtractHighWord32(value));
+          return __ BitcastWord32PairToFloat64(reversed_lo, reversed_hi);
+        }
+      }
+      case kExternalBigInt64Array:
+      case kExternalBigUint64Array:
+        UNREACHABLE();
+    }
+  }
+
+  V<Word32> ComputeUnseededHash(V<Word32> value) {
+    // See v8::internal::ComputeUnseededHash()
+    value = __ Word32Add(__ Word32BitwiseXor(value, 0xFFFFFFFF),
+                         __ Word32ShiftLeft(value, 15));
+    value = __ Word32BitwiseXor(value, __ Word32ShiftRightLogical(value, 12));
+    value = __ Word32Add(value, __ Word32ShiftLeft(value, 2));
+    value = __ Word32BitwiseXor(value, __ Word32ShiftRightLogical(value, 4));
+    value = __ Word32Mul(value, 2057);
+    value = __ Word32BitwiseXor(value, __ Word32ShiftRightLogical(value, 16));
+    value = __ Word32BitwiseAnd(value, 0x3FFFFFFF);
+    return value;
+  }
+
+  void TransitionElementsTo(V<JSArray> array, ElementsKind from,
+                            ElementsKind to, Handle<Map> target_map) {
+    DCHECK(IsMoreGeneralElementsKindTransition(from, to));
+    DCHECK(to == HOLEY_ELEMENTS || to == HOLEY_DOUBLE_ELEMENTS);
+
+    if (IsSimpleMapChangeTransition(from, to)) {
+      __ StoreField(array, AccessBuilder::ForMap(),
+                    __ HeapConstant(target_map));
+    } else {
+      // Instance migration, call out to the runtime for {array}.
+      __ CallRuntime_TransitionElementsKind(isolate_, __ NoContextConstant(),
+                                            array, __ HeapConstant(target_map));
+    }
+  }
+
+  V<Word32> CompareMapAgainstMultipleMaps(V<Map> heap_object_map,
+                                          const ZoneRefSet<Map>& maps) {
+    if (maps.is_empty()) {
+      return __ Word32Constant(0);
+    }
+    V<Word32> result;
+    for (size_t i = 0; i < maps.size(); ++i) {
+      V<Map> map = __ HeapConstant(maps[i].object());
+      if (i == 0) {
+        result = __ TaggedEqual(heap_object_map, map);
+      } else {
+        result =
+            __ Word32BitwiseOr(result, __ TaggedEqual(heap_object_map, map));
+      }
+    }
+    return result;
+  }
+
+  Isolate* isolate_ = PipelineData::Get().isolate();
+  Factory* factory_ = isolate_->factory();
 };
 
 #include "src/compiler/turboshaft/undef-assembler-macros.inc"
diff --git a/deps/v8/src/compiler/turboshaft/machine-optimization-reducer.h b/deps/v8/src/compiler/turboshaft/machine-optimization-reducer.h
index b5539e06b3dfb0..bc5bde45cdf503 100644
--- a/deps/v8/src/compiler/turboshaft/machine-optimization-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/machine-optimization-reducer.h
@@ -23,14 +23,19 @@
 #include "src/builtins/builtins.h"
 #include "src/codegen/machine-type.h"
 #include "src/compiler/backend/instruction.h"
+#include "src/compiler/compilation-dependencies.h"
+#include "src/compiler/js-heap-broker.h"
 #include "src/compiler/machine-operator-reducer.h"
 #include "src/compiler/turboshaft/assembler.h"
 #include "src/compiler/turboshaft/operations.h"
 #include "src/compiler/turboshaft/representations.h"
+#include "src/handles/handles.h"
 #include "src/numbers/conversions.h"
 
 namespace v8::internal::compiler::turboshaft {
 
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
 template <bool signalling_nan_possible, class Next>
 class MachineOptimizationReducer;
 
@@ -56,16 +61,13 @@ class MachineOptimizationReducer : public Next {
  public:
   using Next::Asm;
 
-  template <class... Args>
-  explicit MachineOptimizationReducer(const std::tuple<Args...>& args)
-      : Next(args) {}
-
   // TODO(mslekova): Implement ReduceSelect and ReducePhi,
   // by reducing `(f > 0) ? f : -f` to `fabs(f)`.
 
-  OpIndex ReduceChange(OpIndex input, ChangeOp::Kind kind,
-                       ChangeOp::Assumption assumption,
-                       RegisterRepresentation from, RegisterRepresentation to) {
+  OpIndex REDUCE(Change)(OpIndex input, ChangeOp::Kind kind,
+                         ChangeOp::Assumption assumption,
+                         RegisterRepresentation from,
+                         RegisterRepresentation to) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceChange(input, kind, assumption, from, to);
     }
@@ -155,6 +157,16 @@ class MachineOptimizationReducer : public Next {
           to == WordRepresentation::Word32()) {
         return Asm().Word32Constant(DoubleToInt32_NoInline(value));
       }
+      if (kind == Kind::kExtractHighHalf) {
+        DCHECK_EQ(to, RegisterRepresentation::Word32());
+        return Asm().Word32Constant(
+            static_cast<uint32_t>(base::bit_cast<uint64_t>(value) >> 32));
+      }
+      if (kind == Kind::kExtractLowHalf) {
+        DCHECK_EQ(to, RegisterRepresentation::Word32());
+        return Asm().Word32Constant(
+            static_cast<uint32_t>(base::bit_cast<uint64_t>(value)));
+      }
     }
     if (float value; from == RegisterRepresentation::Float32() &&
                      Asm().MatchFloat32Constant(input, &value)) {
@@ -174,30 +186,22 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceChange(input, kind, assumption, from, to);
   }
 
-  OpIndex ReduceFloat64InsertWord32(OpIndex float64, OpIndex word32,
-                                    Float64InsertWord32Op::Kind kind) {
+  OpIndex REDUCE(BitcastWord32PairToFloat64)(OpIndex hi_word32,
+                                             OpIndex lo_word32) {
     if (ShouldSkipOptimizationStep()) {
-      return Next::ReduceFloat64InsertWord32(float64, word32, kind);
+      return Next::ReduceBitcastWord32PairToFloat64(hi_word32, lo_word32);
     }
-    double f;
-    uint32_t w;
-    if (Asm().MatchFloat64Constant(float64, &f) &&
-        Asm().MatchWord32Constant(word32, &w)) {
-      uint64_t float_as_word = base::bit_cast<uint64_t>(f);
-      switch (kind) {
-        case Float64InsertWord32Op::Kind::kLowHalf:
-          return Asm().Float64Constant(base::bit_cast<double>(
-              (float_as_word & uint64_t{0xFFFFFFFF00000000}) | w));
-        case Float64InsertWord32Op::Kind::kHighHalf:
-          return Asm().Float64Constant(base::bit_cast<double>(
-              (float_as_word & uint64_t{0xFFFFFFFF}) | (uint64_t{w} << 32)));
-      }
+    uint32_t lo, hi;
+    if (Asm().MatchWord32Constant(hi_word32, &hi) &&
+        Asm().MatchWord32Constant(lo_word32, &lo)) {
+      return Asm().Float64Constant(
+          base::bit_cast<double>(uint64_t{hi} << 32 | uint64_t{lo}));
     }
-    return Next::ReduceFloat64InsertWord32(float64, word32, kind);
+    return Next::ReduceBitcastWord32PairToFloat64(hi_word32, lo_word32);
   }
 
-  OpIndex ReduceTaggedBitcast(OpIndex input, RegisterRepresentation from,
-                              RegisterRepresentation to) {
+  OpIndex REDUCE(TaggedBitcast)(OpIndex input, RegisterRepresentation from,
+                                RegisterRepresentation to) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceTaggedBitcast(input, from, to);
     }
@@ -214,14 +218,14 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceTaggedBitcast(input, from, to);
   }
 
-  OpIndex ReduceFloatUnary(OpIndex input, FloatUnaryOp::Kind kind,
-                           FloatRepresentation rep) {
+  OpIndex REDUCE(FloatUnary)(OpIndex input, FloatUnaryOp::Kind kind,
+                             FloatRepresentation rep) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceFloatUnary(input, kind, rep);
     }
     if (float k; rep == FloatRepresentation::Float32() &&
                  Asm().MatchFloat32Constant(input, &k)) {
-      if (std::isnan(k)) {
+      if (std::isnan(k) && !signalling_nan_possible) {
         return Asm().Float32Constant(std::numeric_limits<float>::quiet_NaN());
       }
       switch (kind) {
@@ -351,8 +355,8 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceFloatUnary(input, kind, rep);
   }
 
-  OpIndex ReduceWordUnary(OpIndex input, WordUnaryOp::Kind kind,
-                          WordRepresentation rep) {
+  OpIndex REDUCE(WordUnary)(OpIndex input, WordUnaryOp::Kind kind,
+                            WordRepresentation rep) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceWordUnary(input, kind, rep);
     }
@@ -397,8 +401,8 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceWordUnary(input, kind, rep);
   }
 
-  OpIndex ReduceFloatBinop(OpIndex lhs, OpIndex rhs, FloatBinopOp::Kind kind,
-                           FloatRepresentation rep) {
+  OpIndex REDUCE(FloatBinop)(OpIndex lhs, OpIndex rhs, FloatBinopOp::Kind kind,
+                             FloatRepresentation rep) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceFloatBinop(lhs, rhs, kind, rep);
     }
@@ -480,7 +484,7 @@ class MachineOptimizationReducer : public Next {
           return Asm().FloatAdd(lhs, lhs, rep);
         }
         // lhs * -1  =>  -lhs
-        if (Asm().MatchFloat(rhs, -1.0)) {
+        if (!signalling_nan_possible && Asm().MatchFloat(rhs, -1.0)) {
           return Asm().FloatNegate(lhs, rep);
         }
       }
@@ -491,7 +495,7 @@ class MachineOptimizationReducer : public Next {
           return lhs;
         }
         // lhs / -1  =>  -lhs
-        if (Asm().MatchFloat(rhs, -1.0)) {
+        if (!signalling_nan_possible && Asm().MatchFloat(rhs, -1.0)) {
           return Asm().FloatNegate(lhs, rep);
         }
         // All reciprocals of non-denormal powers of two can be represented
@@ -594,8 +598,8 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceFloatBinop(lhs, rhs, kind, rep);
   }
 
-  OpIndex ReduceWordBinop(OpIndex left, OpIndex right, WordBinopOp::Kind kind,
-                          WordRepresentation rep) {
+  OpIndex REDUCE(WordBinop)(OpIndex left, OpIndex right, WordBinopOp::Kind kind,
+                            WordRepresentation rep) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceWordBinop(left, right, kind, rep);
     }
@@ -757,8 +761,8 @@ class MachineOptimizationReducer : public Next {
           }
           // left * 2^k  =>  left << k
           if (base::bits::IsPowerOfTwo(right_value)) {
-            OpIndex shift_amount = Asm().WordConstant(
-                base::bits::WhichPowerOfTwo(right_value), rep);
+            OpIndex shift_amount =
+                Asm().Word32Constant(base::bits::WhichPowerOfTwo(right_value));
             return Asm().ShiftLeft(left, shift_amount, rep);
           }
           break;
@@ -789,6 +793,20 @@ class MachineOptimizationReducer : public Next {
             if (IsBit(left_ignore_extensions)) {
               return left;
             }
+
+            // HeapObject & 1 => 1  ("& 1" is a Smi-check)
+            // Note that we don't constant-fold the general case of
+            // "HeapObject binop cst", because it's a bit unclear when such
+            // operations would be used outside of smi-checks, and it's thus
+            // unclear whether constant-folding would be safe.
+            if (const ConstantOp* cst =
+                    Asm().template TryCast<ConstantOp>(left)) {
+              if (cst->kind ==
+                  any_of(ConstantOp::Kind::kHeapObject,
+                         ConstantOp::Kind::kCompressedHeapObject)) {
+                return Asm().WordConstant(1, rep);
+              }
+            }
           }
           break;
         case WordBinopOp::Kind::kSignedDiv:
@@ -893,8 +911,8 @@ class MachineOptimizationReducer : public Next {
         case WordBinopOp::Kind::kSignedDiv:
         case WordBinopOp::Kind::kUnsignedDiv: {
           OpIndex zero = Asm().WordConstant(0, rep);
-          return Asm().ChangeUint32ToUintPtr(
-              Asm().Word32Equal(Asm().Equal(left, zero, rep), 0));
+          V<Word32> result = Asm().Word32Equal(Asm().Equal(left, zero, rep), 0);
+          return Asm().ZeroExtendWord32ToRep(result, rep);
         }
         case WordBinopOp::Kind::kAdd:
         case WordBinopOp::Kind::kMul:
@@ -924,7 +942,7 @@ class MachineOptimizationReducer : public Next {
     // Note the side condition for XOR: the optimization doesn't hold for
     // an effective rotation amount of 0.
 
-    if (!(kind == any_of(WordBinopOp::Kind::kBitwiseAnd,
+    if (!(kind == any_of(WordBinopOp::Kind::kBitwiseOr,
                          WordBinopOp::Kind::kBitwiseXor))) {
       return {};
     }
@@ -979,9 +997,9 @@ class MachineOptimizationReducer : public Next {
     }
   }
 
-  OpIndex ReduceOverflowCheckedBinop(OpIndex left, OpIndex right,
-                                     OverflowCheckedBinopOp::Kind kind,
-                                     WordRepresentation rep) {
+  OpIndex REDUCE(OverflowCheckedBinop)(OpIndex left, OpIndex right,
+                                       OverflowCheckedBinopOp::Kind kind,
+                                       WordRepresentation rep) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceOverflowCheckedBinop(left, right, kind, rep);
     }
@@ -1070,7 +1088,8 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceOverflowCheckedBinop(left, right, kind, rep);
   }
 
-  OpIndex ReduceEqual(OpIndex left, OpIndex right, RegisterRepresentation rep) {
+  OpIndex REDUCE(Equal)(OpIndex left, OpIndex right,
+                        RegisterRepresentation rep) {
     if (ShouldSkipOptimizationStep())
       return Next::ReduceEqual(left, right, rep);
     if (left == right && !rep.IsFloat()) {
@@ -1087,7 +1106,7 @@ class MachineOptimizationReducer : public Next {
     if (Asm().template Is<ConstantOp>(right)) {
       if (Asm().template Is<ConstantOp>(left)) {
         // k1 == k2  =>  k
-        switch (rep) {
+        switch (rep.value()) {
           case RegisterRepresentation::Word32():
           case RegisterRepresentation::Word64(): {
             if (uint64_t k1, k2;
@@ -1112,9 +1131,11 @@ class MachineOptimizationReducer : public Next {
             break;
           }
           case RegisterRepresentation::Tagged(): {
-            // TODO(nicohartmann@): We might optimize comparison of
-            // HeapConstants here, but this requires that we are allowed to
-            // dereference handles.
+            if (Handle<HeapObject> o1, o2;
+                Asm().MatchTaggedConstant(left, &o1) &&
+                Asm().MatchTaggedConstant(right, &o2)) {
+              return Asm().Word32Constant(o1.address() == o2.address());
+            }
             break;
           }
           default:
@@ -1157,7 +1178,7 @@ class MachineOptimizationReducer : public Next {
                   left, &x, rep_w, &k1) &&
               Asm().MatchWordConstant(right, rep_w, &k2) &&
               CountLeadingSignBits(k2, rep_w) > k1 &&
-              Asm().Get(left).saturated_use_count == 0) {
+              Asm().Get(left).saturated_use_count.IsZero()) {
             return Asm().Equal(
                 x, Asm().WordConstant(base::bits::Unsigned(k2) << k1, rep_w),
                 rep_w);
@@ -1181,8 +1202,9 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceEqual(left, right, rep);
   }
 
-  OpIndex ReduceComparison(OpIndex left, OpIndex right, ComparisonOp::Kind kind,
-                           RegisterRepresentation rep) {
+  OpIndex REDUCE(Comparison)(OpIndex left, OpIndex right,
+                             ComparisonOp::Kind kind,
+                             RegisterRepresentation rep) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceComparison(left, right, kind, rep);
     }
@@ -1208,7 +1230,7 @@ class MachineOptimizationReducer : public Next {
     // constant folding
     if (Asm().template Is<ConstantOp>(right) &&
         Asm().template Is<ConstantOp>(left)) {
-      switch (rep) {
+      switch (rep.value()) {
         case RegisterRepresentation::Word32():
         case RegisterRepresentation::Word64(): {
           if (kind ==
@@ -1335,7 +1357,7 @@ class MachineOptimizationReducer : public Next {
                                                                  rep_w, &k1) &&
             Asm().MatchWordConstant(right, rep_w, &k2) &&
             CountLeadingSignBits(k2, rep_w) > k1 &&
-            Asm().Get(left).saturated_use_count == 0) {
+            Asm().Get(left).saturated_use_count.IsZero()) {
           return Asm().Comparison(
               x, Asm().WordConstant(base::bits::Unsigned(k2) << k1, rep_w),
               kind, rep_w);
@@ -1347,7 +1369,7 @@ class MachineOptimizationReducer : public Next {
                                                                  rep_w, &k1) &&
             Asm().MatchWordConstant(left, rep_w, &k2) &&
             CountLeadingSignBits(k2, rep_w) > k1 &&
-            Asm().Get(right).saturated_use_count == 0) {
+            Asm().Get(right).saturated_use_count.IsZero()) {
           return Asm().Comparison(
               Asm().WordConstant(base::bits::Unsigned(k2) << k1, rep_w), x,
               kind, rep_w);
@@ -1380,8 +1402,8 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceComparison(left, right, kind, rep);
   }
 
-  OpIndex ReduceShift(OpIndex left, OpIndex right, ShiftOp::Kind kind,
-                      WordRepresentation rep) {
+  OpIndex REDUCE(Shift)(OpIndex left, OpIndex right, ShiftOp::Kind kind,
+                        WordRepresentation rep) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceShift(left, right, kind, rep);
     }
@@ -1500,7 +1522,9 @@ class MachineOptimizationReducer : public Next {
         // machine instruction Asm().matches that required by JavaScript.
         if (OpIndex a, b; Asm().MatchBitwiseAnd(right, &a, &b,
                                                 WordRepresentation::Word32())) {
+#if defined(__clang__)
           static_assert(0x1f == WordRepresentation::Word32().bit_width() - 1);
+#endif
           if (uint32_t b_value;
               Asm().MatchWord32Constant(b, &b_value) && b_value == 0x1f) {
             return Asm().Shift(left, a, kind, rep);
@@ -1511,8 +1535,8 @@ class MachineOptimizationReducer : public Next {
     return Next::ReduceShift(left, right, kind, rep);
   }
 
-  OpIndex ReduceBranch(OpIndex condition, Block* if_true, Block* if_false,
-                       BranchHint hint) {
+  OpIndex REDUCE(Branch)(OpIndex condition, Block* if_true, Block* if_false,
+                         BranchHint hint) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceBranch(condition, if_true, if_false, hint);
     }
@@ -1534,9 +1558,9 @@ class MachineOptimizationReducer : public Next {
     }
   }
 
-  OpIndex ReduceDeoptimizeIf(OpIndex condition, OpIndex frame_state,
-                             bool negated,
-                             const DeoptimizeParameters* parameters) {
+  OpIndex REDUCE(DeoptimizeIf)(OpIndex condition, OpIndex frame_state,
+                               bool negated,
+                               const DeoptimizeParameters* parameters) {
     if (ShouldSkipOptimizationStep()) {
       return Next::ReduceDeoptimizeIf(condition, frame_state, negated,
                                       parameters);
@@ -1558,14 +1582,15 @@ class MachineOptimizationReducer : public Next {
     }
   }
 
-  OpIndex ReduceTrapIf(OpIndex condition, bool negated, TrapId trap_id) {
+  OpIndex REDUCE(TrapIf)(OpIndex condition, OpIndex frame_state, bool negated,
+                         TrapId trap_id) {
     LABEL_BLOCK(no_change) {
-      return Next::ReduceTrapIf(condition, negated, trap_id);
+      return Next::ReduceTrapIf(condition, frame_state, negated, trap_id);
     }
     if (ShouldSkipOptimizationStep()) goto no_change;
     if (base::Optional<bool> decision = DecideBranchCondition(condition)) {
       if (*decision != negated) {
-        Next::ReduceTrapIf(condition, negated, trap_id);
+        Next::ReduceTrapIf(condition, frame_state, negated, trap_id);
         Asm().Unreachable();
       }
       // `TrapIf` doesn't produce a value.
@@ -1573,18 +1598,19 @@ class MachineOptimizationReducer : public Next {
     }
     if (base::Optional<OpIndex> new_condition =
             ReduceBranchCondition(condition, &negated)) {
-      return Asm().ReduceTrapIf(new_condition.value(), negated, trap_id);
+      return Asm().ReduceTrapIf(new_condition.value(), frame_state, negated,
+                                trap_id);
     } else {
       goto no_change;
     }
   }
 
-  OpIndex ReduceStaticAssert(OpIndex condition, const char* source) {
+  OpIndex REDUCE(StaticAssert)(OpIndex condition, const char* source) {
     LABEL_BLOCK(no_change) {
       return Next::ReduceStaticAssert(condition, source);
     }
     if (base::Optional<bool> decision = DecideBranchCondition(condition)) {
-      if (decision) {
+      if (*decision) {
         // Drop the assert, the condition holds true.
         return OpIndex::Invalid();
       } else {
@@ -1595,8 +1621,9 @@ class MachineOptimizationReducer : public Next {
     goto no_change;
   }
 
-  OpIndex ReduceSwitch(OpIndex input, base::Vector<const SwitchOp::Case> cases,
-                       Block* default_case, BranchHint default_hint) {
+  OpIndex REDUCE(Switch)(OpIndex input,
+                         base::Vector<const SwitchOp::Case> cases,
+                         Block* default_case, BranchHint default_hint) {
     LABEL_BLOCK(no_change) {
       return Next::ReduceSwitch(input, cases, default_case, default_hint);
     }
@@ -1614,10 +1641,11 @@ class MachineOptimizationReducer : public Next {
     goto no_change;
   }
 
-  OpIndex ReduceStore(OpIndex base, OpIndex index, OpIndex value,
-                      StoreOp::Kind kind, MemoryRepresentation stored_rep,
-                      WriteBarrierKind write_barrier, int32_t offset,
-                      uint8_t element_scale) {
+  OpIndex REDUCE(Store)(OpIndex base, OpIndex index, OpIndex value,
+                        StoreOp::Kind kind, MemoryRepresentation stored_rep,
+                        WriteBarrierKind write_barrier, int32_t offset,
+                        uint8_t element_scale,
+                        bool maybe_initializing_or_transitioning) {
     if (!ShouldSkipOptimizationStep()) {
       if (stored_rep.SizeInBytes() <= 4) {
         value = TryRemoveWord32ToWord64Conversion(value);
@@ -1647,40 +1675,57 @@ class MachineOptimizationReducer : public Next {
       }
     }
     return Next::ReduceStore(base, index, value, kind, stored_rep,
-                             write_barrier, offset, element_scale);
+                             write_barrier, offset, element_scale,
+                             maybe_initializing_or_transitioning);
   }
 
-  OpIndex ReduceLoad(OpIndex base, OpIndex index, LoadOp::Kind kind,
-                     MemoryRepresentation loaded_rep,
-                     RegisterRepresentation result_rep, int32_t offset,
-                     uint8_t element_scale) {
+  OpIndex REDUCE(Load)(OpIndex base_idx, OpIndex index, LoadOp::Kind kind,
+                       MemoryRepresentation loaded_rep,
+                       RegisterRepresentation result_rep, int32_t offset,
+                       uint8_t element_scale) {
     while (true) {
       if (ShouldSkipOptimizationStep()) break;
       index = ReduceMemoryIndex(index, &offset, &element_scale);
       if (!kind.tagged_base && !index.valid()) {
         if (OpIndex left, right;
-            Asm().MatchWordAdd(base, &left, &right,
+            Asm().MatchWordAdd(base_idx, &left, &right,
                                WordRepresentation::PointerSized()) &&
             TryAdjustOffset(&offset, Asm().Get(right), element_scale)) {
-          base = left;
+          base_idx = left;
           continue;
         }
       }
       break;
     }
-    return Next::ReduceLoad(base, index, kind, loaded_rep, result_rep, offset,
-                            element_scale);
-  }
-
-  OpIndex ReducePhi(base::Vector<const OpIndex> inputs,
-                    RegisterRepresentation rep) {
-    LABEL_BLOCK(no_change) { return Next::ReducePhi(inputs, rep); }
-    if (inputs.size() == 0) goto no_change;
-    OpIndex first = inputs.first();
-    for (const OpIndex& input : inputs) {
-      if (input != first) goto no_change;
+    if (!index.valid() && Asm().template Is<ConstantOp>(base_idx) &&
+        !ShouldSkipOptimizationStep()) {
+      const ConstantOp& base = Asm().template Cast<ConstantOp>(base_idx);
+      if (base.kind == any_of(ConstantOp::Kind::kHeapObject,
+                              ConstantOp::Kind::kCompressedHeapObject)) {
+        if (offset == HeapObject::kMapOffset) {
+          // Only few loads should be loading the map from a ConstantOp
+          // HeapObject, so unparking the JSHeapBroker here rather than before
+          // the optimization pass itself it probably more efficient.
+          UnparkedScopeIfNeeded scope(PipelineData::Get().broker());
+          AllowHandleDereference allow_handle_dereference;
+
+          OptionalMapRef map = TryMakeRef(broker, base.handle()->map());
+          if (map.has_value() && map->is_stable() && !map->is_deprecated()) {
+            broker->dependencies()->DependOnStableMap(*map);
+            return Asm().HeapConstant(map->object());
+          }
+        }
+        // TODO(dmercadier): consider constant-folding other accesses, in
+        // particular for constant objects (ie, if
+        // base.handle()->InReadOnlySpace() is true). We have to be a bit
+        // careful though, because loading could be invalid (since we could
+        // be in unreachable code). (all objects have a map, so loading the map
+        // should always be safe, regardless of whether we are generating
+        // unreachable code or not)
+      }
     }
-    return first;
+    return Next::ReduceLoad(base_idx, index, kind, loaded_rep, result_rep,
+                            offset, element_scale);
   }
 
  private:
@@ -1932,8 +1977,10 @@ class MachineOptimizationReducer : public Next {
     }
     // left / MinSignedValue  =>  left == MinSignedValue
     if (right == rep.MinSignedValue()) {
-      return Asm().ChangeUint32ToUint64(
-          Asm().Equal(left, Asm().WordConstant(right, rep), rep));
+      OpIndex equal_op = Asm().Equal(left, Asm().WordConstant(right, rep), rep);
+      return rep == WordRepresentation::Word64()
+                 ? Asm().ChangeUint32ToUint64(equal_op)
+                 : equal_op;
     }
     // left / -right  => -(left / right)
     if (right < 0) {
@@ -2087,8 +2134,12 @@ class MachineOptimizationReducer : public Next {
   uint16_t CountLeadingSignBits(int64_t c, WordRepresentation rep) {
     return base::bits::CountLeadingSignBits(c) - (64 - rep.bit_width());
   }
+
+  JSHeapBroker* broker = PipelineData::Get().broker();
 };
 
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_MACHINE_OPTIMIZATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/memory-optimization-reducer.cc b/deps/v8/src/compiler/turboshaft/memory-optimization-reducer.cc
index db3731d79f86ce..1acc5fba094d0d 100644
--- a/deps/v8/src/compiler/turboshaft/memory-optimization-reducer.cc
+++ b/deps/v8/src/compiler/turboshaft/memory-optimization-reducer.cc
@@ -16,10 +16,11 @@ const TSCallDescriptor* CreateAllocateBuiltinDescriptor(Zone* zone) {
           AllocateDescriptor{}.GetStackParameterCount(),
           CallDescriptor::kCanUseRoots, Operator::kNoThrow,
           StubCallMode::kCallCodeObject),
-      zone);
+      CanThrow::kNo, zone);
 }
 
 void MemoryAnalyzer::Run() {
+  if (allocation_folding == AllocationFolding::kDontAllocationFolding) return;
   block_states[current_block] = BlockState{};
   BlockIndex end = BlockIndex(input_graph.block_count());
   while (current_block < end) {
@@ -48,11 +49,10 @@ void MemoryAnalyzer::Process(const Operation& op) {
     ProcessStore(input_graph.Index(op), store->base());
     return;
   }
-  OpProperties properties = op.Properties();
-  if (properties.can_allocate) {
+  if (op.Effects().can_allocate) {
     state = BlockState();
   }
-  if (properties.is_block_terminator) {
+  if (op.IsBlockTerminator()) {
     ProcessBlockTerminator(op);
   }
 }
@@ -82,7 +82,7 @@ void MemoryAnalyzer::ProcessBlockTerminator(const Operation& op) {
       // speculation resulting in processing the loop twice.
       for (const Operation& op :
            input_graph.operations(*goto_op->destination)) {
-        if (op.Properties().can_allocate && !ShouldSkipOperation(op)) {
+        if (op.Effects().can_allocate && !ShouldSkipOperation(op)) {
           state = BlockState();
           break;
         }
diff --git a/deps/v8/src/compiler/turboshaft/memory-optimization-reducer.h b/deps/v8/src/compiler/turboshaft/memory-optimization-reducer.h
index 22231fce556921..229cb167de9ed3 100644
--- a/deps/v8/src/compiler/turboshaft/memory-optimization-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/memory-optimization-reducer.h
@@ -9,10 +9,13 @@
 #include "src/builtins/builtins.h"
 #include "src/codegen/external-reference.h"
 #include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/phase.h"
 #include "src/compiler/turboshaft/utils.h"
 
 namespace v8::internal::compiler::turboshaft {
 
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
 const TSCallDescriptor* CreateAllocateBuiltinDescriptor(Zone* zone);
 
 // The main purpose of memory optimization is folding multiple allocations into
@@ -28,10 +31,16 @@ const TSCallDescriptor* CreateAllocateBuiltinDescriptor(Zone* zone);
 // We can do write barrier elimination across loops if the loop does not contain
 // any potentially allocating operations.
 struct MemoryAnalyzer {
+  enum class AllocationFolding { kDoAllocationFolding, kDontAllocationFolding };
+
   Zone* phase_zone;
   const Graph& input_graph;
-  MemoryAnalyzer(Zone* phase_zone, const Graph& input_graph)
-      : phase_zone(phase_zone), input_graph(input_graph) {}
+  AllocationFolding allocation_folding;
+  MemoryAnalyzer(Zone* phase_zone, const Graph& input_graph,
+                 AllocationFolding allocation_folding)
+      : phase_zone(phase_zone),
+        input_graph(input_graph),
+        allocation_folding(allocation_folding) {}
 
   struct BlockState {
     const AllocateOp* last_allocation = nullptr;
@@ -88,44 +97,37 @@ struct MemoryAnalyzer {
   void MergeCurrentStateIntoSuccessor(const Block* successor);
 };
 
-struct MemoryOptimizationReducerArgs {
-  Isolate* isolate;
-};
-
 template <class Next>
 class MemoryOptimizationReducer : public Next {
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
-  using ArgT = base::append_tuple_type<typename Next::ArgT,
-                                       MemoryOptimizationReducerArgs>;
-
-  template <class... Args>
-  explicit MemoryOptimizationReducer(const std::tuple<Args...>& args)
-      : Next(args),
-        isolate_(std::get<MemoryOptimizationReducerArgs>(args).isolate) {}
-
   void Analyze() {
-    analyzer_.emplace(Asm().phase_zone(), Asm().input_graph());
+    analyzer_.emplace(
+        Asm().phase_zone(), Asm().input_graph(),
+        PipelineData::Get().info()->allocation_folding()
+            ? MemoryAnalyzer::AllocationFolding::kDoAllocationFolding
+            : MemoryAnalyzer::AllocationFolding::kDontAllocationFolding);
     analyzer_->Run();
     Next::Analyze();
   }
 
-  OpIndex ReduceStore(OpIndex base, OpIndex index, OpIndex value,
-                      StoreOp::Kind kind, MemoryRepresentation stored_rep,
-                      WriteBarrierKind write_barrier, int32_t offset,
-                      uint8_t element_scale) {
+  OpIndex REDUCE(Store)(OpIndex base, OpIndex index, OpIndex value,
+                        StoreOp::Kind kind, MemoryRepresentation stored_rep,
+                        WriteBarrierKind write_barrier, int32_t offset,
+                        uint8_t element_scale,
+                        bool maybe_initializing_or_transitioning) {
     if (!ShouldSkipOptimizationStep() &&
         analyzer_->skipped_write_barriers.count(
             Asm().current_operation_origin())) {
       write_barrier = WriteBarrierKind::kNoWriteBarrier;
     }
     return Next::ReduceStore(base, index, value, kind, stored_rep,
-                             write_barrier, offset, element_scale);
+                             write_barrier, offset, element_scale,
+                             maybe_initializing_or_transitioning);
   }
 
-  OpIndex ReduceAllocate(OpIndex size, AllocationType type,
-                         AllowLargeObjects allow_large_objects) {
+  OpIndex REDUCE(Allocate)(OpIndex size, AllocationType type) {
     DCHECK_EQ(type, any_of(AllocationType::kYoung, AllocationType::kOld));
 
     if (v8_flags.single_generation && type == AllocationType::kYoung) {
@@ -136,35 +138,29 @@ class MemoryOptimizationReducer : public Next {
         type == AllocationType::kYoung
             ? ExternalReference::new_space_allocation_top_address(isolate_)
             : ExternalReference::old_space_allocation_top_address(isolate_));
-    Variable top =
-        Asm().NewFreshVariable(RegisterRepresentation::PointerSized());
-    Asm().Set(top, Asm().LoadOffHeap(top_address,
-                                     MemoryRepresentation::PointerSized()));
 
     if (analyzer_->IsFoldedAllocation(Asm().current_operation_origin())) {
-      Asm().StoreOffHeap(top_address, Asm().PointerAdd(Asm().Get(top), size),
+      DCHECK_NE(Asm().GetVariable(top(type)), OpIndex::Invalid());
+      OpIndex obj_addr = Asm().GetVariable(top(type));
+      Asm().SetVariable(top(type),
+                        Asm().PointerAdd(Asm().GetVariable(top(type)), size));
+      Asm().StoreOffHeap(top_address, Asm().GetVariable(top(type)),
                          MemoryRepresentation::PointerSized());
-      return Asm().BitcastWordToTagged(Asm().PointerAdd(
-          Asm().Get(top), Asm().IntPtrConstant(kHeapObjectTag)));
+      return Asm().BitcastWordPtrToTagged(
+          Asm().PointerAdd(obj_addr, Asm().IntPtrConstant(kHeapObjectTag)));
     }
 
+    Asm().SetVariable(
+        top(type),
+        Asm().LoadOffHeap(top_address, MemoryRepresentation::PointerSized()));
+
     OpIndex allocate_builtin;
     if (type == AllocationType::kYoung) {
-      if (allow_large_objects == AllowLargeObjects::kTrue) {
-        allocate_builtin =
-            Asm().BuiltinCode(Builtin::kAllocateInYoungGeneration, isolate_);
-      } else {
-        allocate_builtin = Asm().BuiltinCode(
-            Builtin::kAllocateRegularInYoungGeneration, isolate_);
-      }
+      allocate_builtin =
+          Asm().BuiltinCode(Builtin::kAllocateInYoungGeneration, isolate_);
     } else {
-      if (allow_large_objects == AllowLargeObjects::kTrue) {
-        allocate_builtin =
-            Asm().BuiltinCode(Builtin::kAllocateInOldGeneration, isolate_);
-      } else {
-        allocate_builtin = Asm().BuiltinCode(
-            Builtin::kAllocateRegularInOldGeneration, isolate_);
-      }
+      allocate_builtin =
+          Asm().BuiltinCode(Builtin::kAllocateInOldGeneration, isolate_);
     }
 
     Block* call_runtime = Asm().NewBlock();
@@ -184,17 +180,17 @@ class MemoryOptimizationReducer : public Next {
       reservation_size = size;
     }
     // Check if we can do bump pointer allocation here.
-    bool reachable = true;
-    if (allow_large_objects == AllowLargeObjects::kTrue) {
-      reachable = Asm().GotoIfNot(
-          Asm().UintPtrLessThan(
-              size, Asm().IntPtrConstant(kMaxRegularHeapObjectSize)),
-          call_runtime, BranchHint::kTrue);
-    }
+    bool reachable =
+        Asm().GotoIfNot(
+            Asm().UintPtrLessThan(
+                size, Asm().IntPtrConstant(kMaxRegularHeapObjectSize)),
+            call_runtime,
+            BranchHint::kTrue) != ConditionalGotoStatus::kGotoDestination;
     if (reachable) {
       Asm().Branch(
           Asm().UintPtrLessThan(
-              Asm().PointerAdd(Asm().Get(top), reservation_size), limit),
+              Asm().PointerAdd(Asm().GetVariable(top(type)), reservation_size),
+              limit),
           done, call_runtime, BranchHint::kTrue);
     }
 
@@ -202,20 +198,25 @@ class MemoryOptimizationReducer : public Next {
     if (Asm().Bind(call_runtime)) {
       OpIndex allocated = Asm().Call(allocate_builtin, {reservation_size},
                                      AllocateBuiltinDescriptor());
-      Asm().Set(top, Asm().PointerSub(Asm().BitcastTaggedToWord(allocated),
-                                      Asm().IntPtrConstant(kHeapObjectTag)));
+      Asm().SetVariable(top(type),
+                        Asm().PointerSub(Asm().BitcastTaggedToWord(allocated),
+                                         Asm().IntPtrConstant(kHeapObjectTag)));
       Asm().Goto(done);
     }
 
     Asm().BindReachable(done);
     // Compute the new top and write it back.
-    Asm().StoreOffHeap(top_address, Asm().PointerAdd(Asm().Get(top), size),
+    OpIndex obj_addr = Asm().GetVariable(top(type));
+    Asm().SetVariable(top(type),
+                      Asm().PointerAdd(Asm().GetVariable(top(type)), size));
+    Asm().StoreOffHeap(top_address, Asm().GetVariable(top(type)),
                        MemoryRepresentation::PointerSized());
-    return Asm().BitcastWordToTagged(
-        Asm().PointerAdd(Asm().Get(top), Asm().IntPtrConstant(kHeapObjectTag)));
+    return Asm().BitcastWordPtrToTagged(
+        Asm().PointerAdd(obj_addr, Asm().IntPtrConstant(kHeapObjectTag)));
   }
 
-  OpIndex ReduceDecodeExternalPointer(OpIndex handle, ExternalPointerTag tag) {
+  OpIndex REDUCE(DecodeExternalPointer)(OpIndex handle,
+                                        ExternalPointerTag tag) {
 #ifdef V8_ENABLE_SANDBOX
     // Decode loaded external pointer.
     //
@@ -236,7 +237,7 @@ class MemoryOptimizationReducer : public Next {
             : Asm().ExternalConstant(
                   ExternalReference::external_pointer_table_address(isolate_));
     OpIndex table = Asm().LoadOffHeap(
-        table_address, Internals::kExternalPointerTableBufferOffset,
+        table_address, Internals::kExternalPointerTableBasePointerOffset,
         MemoryRepresentation::PointerSized());
     OpIndex index = Asm().ShiftRightLogical(handle, kExternalPointerIndexShift,
                                             WordRepresentation::Word32());
@@ -252,8 +253,20 @@ class MemoryOptimizationReducer : public Next {
 
  private:
   base::Optional<MemoryAnalyzer> analyzer_;
-  Isolate* isolate_;
+  Isolate* isolate_ = PipelineData::Get().isolate();
   const TSCallDescriptor* allocate_builtin_descriptor_ = nullptr;
+  base::Optional<Variable> top_[2];
+
+  static_assert(static_cast<int>(AllocationType::kYoung) == 0);
+  static_assert(static_cast<int>(AllocationType::kOld) == 1);
+  Variable top(AllocationType type) {
+    DCHECK(type == AllocationType::kYoung || type == AllocationType::kOld);
+    if (V8_UNLIKELY(!top_[static_cast<int>(type)].has_value())) {
+      top_[static_cast<int>(type)].emplace(Asm().NewLoopInvariantVariable(
+          RegisterRepresentation::PointerSized()));
+    }
+    return top_[static_cast<int>(type)].value();
+  }
 
   const TSCallDescriptor* AllocateBuiltinDescriptor() {
     if (allocate_builtin_descriptor_ == nullptr) {
@@ -264,6 +277,8 @@ class MemoryOptimizationReducer : public Next {
   }
 };
 
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_MEMORY_OPTIMIZATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/operation-matching.h b/deps/v8/src/compiler/turboshaft/operation-matcher.h
similarity index 71%
rename from deps/v8/src/compiler/turboshaft/operation-matching.h
rename to deps/v8/src/compiler/turboshaft/operation-matcher.h
index 36bec7663e1fc3..bf94f9775e2589 100644
--- a/deps/v8/src/compiler/turboshaft/operation-matching.h
+++ b/deps/v8/src/compiler/turboshaft/operation-matcher.h
@@ -2,37 +2,37 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#ifndef V8_COMPILER_TURBOSHAFT_OPERATION_MATCHING_H_
-#define V8_COMPILER_TURBOSHAFT_OPERATION_MATCHING_H_
+#ifndef V8_COMPILER_TURBOSHAFT_OPERATION_MATCHER_H_
+#define V8_COMPILER_TURBOSHAFT_OPERATION_MATCHER_H_
 
+#include "src/compiler/turboshaft/graph.h"
 #include "src/compiler/turboshaft/operations.h"
 #include "src/compiler/turboshaft/representations.h"
 
-namespace v8 ::internal::compiler::turboshaft {
+namespace v8::internal::compiler::turboshaft {
 
-template <class Assembler>
-class OperationMatching {
+class OperationMatcher {
  public:
+  explicit OperationMatcher(Graph& graph) : graph_(graph) {}
+
   template <class Op>
-  bool Is(OpIndex op_idx) {
-    return assembler().output_graph().Get(op_idx).template Is<Op>();
+  bool Is(OpIndex op_idx) const {
+    return graph_.Get(op_idx).Is<Op>();
   }
 
   template <class Op>
-  const Op* TryCast(OpIndex op_idx) {
-    return assembler().output_graph().Get(op_idx).template TryCast<Op>();
+  const underlying_operation_t<Op>* TryCast(OpIndex op_idx) const {
+    return graph_.Get(op_idx).TryCast<Op>();
   }
 
   template <class Op>
-  const Op& Cast(OpIndex op_idx) {
-    return assembler().output_graph().Get(op_idx).template Cast<Op>();
+  const underlying_operation_t<Op>& Cast(OpIndex op_idx) const {
+    return graph_.Get(op_idx).Cast<Op>();
   }
 
-  const Operation& Get(OpIndex op_idx) {
-    return assembler().output_graph().Get(op_idx);
-  }
+  const Operation& Get(OpIndex op_idx) const { return graph_.Get(op_idx); }
 
-  bool MatchZero(OpIndex matched) {
+  bool MatchZero(OpIndex matched) const {
     const ConstantOp* op = TryCast<ConstantOp>(matched);
     if (!op) return false;
     switch (op->kind) {
@@ -48,7 +48,12 @@ class OperationMatching {
     }
   }
 
-  bool MatchFloat32Constant(OpIndex matched, float* constant) {
+  bool MatchIntegralZero(OpIndex matched) const {
+    int64_t constant;
+    return MatchSignedIntegralConstant(matched, &constant) && constant == 0;
+  }
+
+  bool MatchFloat32Constant(OpIndex matched, float* constant) const {
     const ConstantOp* op = TryCast<ConstantOp>(matched);
     if (!op) return false;
     if (op->kind != ConstantOp::Kind::kFloat32) return false;
@@ -56,7 +61,7 @@ class OperationMatching {
     return true;
   }
 
-  bool MatchFloat64Constant(OpIndex matched, double* constant) {
+  bool MatchFloat64Constant(OpIndex matched, double* constant) const {
     const ConstantOp* op = TryCast<ConstantOp>(matched);
     if (!op) return false;
     if (op->kind != ConstantOp::Kind::kFloat64) return false;
@@ -64,7 +69,7 @@ class OperationMatching {
     return true;
   }
 
-  bool MatchFloat(OpIndex matched, double* value) {
+  bool MatchFloat(OpIndex matched, double* value) const {
     const ConstantOp* op = TryCast<ConstantOp>(matched);
     if (!op) return false;
     if (op->kind == ConstantOp::Kind::kFloat64) {
@@ -77,24 +82,35 @@ class OperationMatching {
     return false;
   }
 
-  bool MatchFloat(OpIndex matched, double value) {
+  bool MatchFloat(OpIndex matched, double value) const {
     double k;
     if (!MatchFloat(matched, &k)) return false;
     return base::bit_cast<uint64_t>(value) == base::bit_cast<uint64_t>(k) ||
            (std::isnan(k) && std::isnan(value));
   }
 
-  bool MatchNaN(OpIndex matched) {
+  bool MatchNaN(OpIndex matched) const {
     double k;
     return MatchFloat(matched, &k) && std::isnan(k);
   }
 
+  bool MatchTaggedConstant(OpIndex matched, Handle<HeapObject>* tagged) const {
+    const ConstantOp* op = TryCast<ConstantOp>(matched);
+    if (!op) return false;
+    if (!(op->kind == any_of(ConstantOp::Kind::kHeapObject,
+                             ConstantOp::Kind::kCompressedHeapObject))) {
+      return false;
+    }
+    *tagged = op->handle();
+    return true;
+  }
+
   bool MatchWordConstant(OpIndex matched, WordRepresentation rep,
                          uint64_t* unsigned_constant,
-                         int64_t* signed_constant = nullptr) {
+                         int64_t* signed_constant = nullptr) const {
     const ConstantOp* op = TryCast<ConstantOp>(matched);
     if (!op) return false;
-    switch (op->rep) {
+    switch (op->rep.value()) {
       case RegisterRepresentation::Word32():
         if (rep != WordRepresentation::Word32()) return false;
         break;
@@ -131,15 +147,15 @@ class OperationMatching {
   }
 
   bool MatchWordConstant(OpIndex matched, WordRepresentation rep,
-                         int64_t* signed_constant) {
+                         int64_t* signed_constant) const {
     return MatchWordConstant(matched, rep, nullptr, signed_constant);
   }
 
-  bool MatchWord64Constant(OpIndex matched, uint64_t* constant) {
+  bool MatchWord64Constant(OpIndex matched, uint64_t* constant) const {
     return MatchWordConstant(matched, WordRepresentation::Word64(), constant);
   }
 
-  bool MatchWord32Constant(OpIndex matched, uint32_t* constant) {
+  bool MatchWord32Constant(OpIndex matched, uint32_t* constant) const {
     if (uint64_t value;
         MatchWordConstant(matched, WordRepresentation::Word32(), &value)) {
       *constant = static_cast<uint32_t>(value);
@@ -148,11 +164,11 @@ class OperationMatching {
     return false;
   }
 
-  bool MatchWord64Constant(OpIndex matched, int64_t* constant) {
+  bool MatchWord64Constant(OpIndex matched, int64_t* constant) const {
     return MatchWordConstant(matched, WordRepresentation::Word64(), constant);
   }
 
-  bool MatchWord32Constant(OpIndex matched, int32_t* constant) {
+  bool MatchWord32Constant(OpIndex matched, int32_t* constant) const {
     if (int64_t value;
         MatchWordConstant(matched, WordRepresentation::Word32(), &value)) {
       *constant = static_cast<int32_t>(value);
@@ -161,8 +177,41 @@ class OperationMatching {
     return false;
   }
 
+  bool MatchSignedIntegralConstant(OpIndex matched, int64_t* constant) const {
+    if (const ConstantOp* c = TryCast<ConstantOp>(matched)) {
+      if (c->kind == ConstantOp::Kind::kWord32 ||
+          c->kind == ConstantOp::Kind::kWord64) {
+        *constant = c->signed_integral();
+        return true;
+      }
+    }
+    return false;
+  }
+
+  bool MatchUnsignedIntegralConstant(OpIndex matched,
+                                     uint64_t* constant) const {
+    if (const ConstantOp* c = TryCast<ConstantOp>(matched)) {
+      if (c->kind == ConstantOp::Kind::kWord32 ||
+          c->kind == ConstantOp::Kind::kWord64) {
+        *constant = c->integral();
+        return true;
+      }
+    }
+    return false;
+  }
+
+  bool MatchExternalConstant(OpIndex matched,
+                             ExternalReference* reference) const {
+    const ConstantOp* op = TryCast<ConstantOp>(matched);
+    if (!op) return false;
+    if (op->kind != ConstantOp::Kind::kExternal) return false;
+    *reference = op->storage.external;
+    return true;
+  }
+
   bool MatchChange(OpIndex matched, OpIndex* input, ChangeOp::Kind kind,
-                   RegisterRepresentation from, RegisterRepresentation to) {
+                   RegisterRepresentation from,
+                   RegisterRepresentation to) const {
     const ChangeOp* op = TryCast<ChangeOp>(matched);
     if (!op || op->kind != kind || op->from != from || op->to != to) {
       return false;
@@ -172,7 +221,7 @@ class OperationMatching {
   }
 
   bool MatchWordBinop(OpIndex matched, OpIndex* left, OpIndex* right,
-                      WordBinopOp::Kind* kind, WordRepresentation* rep) {
+                      WordBinopOp::Kind* kind, WordRepresentation* rep) const {
     const WordBinopOp* op = TryCast<WordBinopOp>(matched);
     if (!op) return false;
     *kind = op->kind;
@@ -183,7 +232,7 @@ class OperationMatching {
   }
 
   bool MatchWordBinop(OpIndex matched, OpIndex* left, OpIndex* right,
-                      WordBinopOp::Kind kind, WordRepresentation rep) {
+                      WordBinopOp::Kind kind, WordRepresentation rep) const {
     const WordBinopOp* op = TryCast<WordBinopOp>(matched);
     if (!op || kind != op->kind) {
       return false;
@@ -200,23 +249,23 @@ class OperationMatching {
   }
 
   bool MatchWordAdd(OpIndex matched, OpIndex* left, OpIndex* right,
-                    WordRepresentation rep) {
+                    WordRepresentation rep) const {
     return MatchWordBinop(matched, left, right, WordBinopOp::Kind::kAdd, rep);
   }
 
   bool MatchWordSub(OpIndex matched, OpIndex* left, OpIndex* right,
-                    WordRepresentation rep) {
+                    WordRepresentation rep) const {
     return MatchWordBinop(matched, left, right, WordBinopOp::Kind::kSub, rep);
   }
 
   bool MatchBitwiseAnd(OpIndex matched, OpIndex* left, OpIndex* right,
-                       WordRepresentation rep) {
+                       WordRepresentation rep) const {
     return MatchWordBinop(matched, left, right, WordBinopOp::Kind::kBitwiseAnd,
                           rep);
   }
 
   bool MatchEqual(OpIndex matched, OpIndex* left, OpIndex* right,
-                  WordRepresentation rep) {
+                  WordRepresentation rep) const {
     const EqualOp* op = TryCast<EqualOp>(matched);
     if (!op || rep != op->rep) return false;
     *left = op->left();
@@ -225,7 +274,8 @@ class OperationMatching {
   }
 
   bool MatchComparison(OpIndex matched, OpIndex* left, OpIndex* right,
-                       ComparisonOp::Kind* kind, RegisterRepresentation* rep) {
+                       ComparisonOp::Kind* kind,
+                       RegisterRepresentation* rep) const {
     const ComparisonOp* op = TryCast<ComparisonOp>(matched);
     if (!op) return false;
     *kind = op->kind;
@@ -236,7 +286,7 @@ class OperationMatching {
   }
 
   bool MatchFloatUnary(OpIndex matched, OpIndex* input, FloatUnaryOp::Kind kind,
-                       FloatRepresentation rep) {
+                       FloatRepresentation rep) const {
     const FloatUnaryOp* op = TryCast<FloatUnaryOp>(matched);
     if (!op || op->kind != kind || op->rep != rep) return false;
     *input = op->input();
@@ -244,12 +294,13 @@ class OperationMatching {
   }
 
   bool MatchFloatRoundDown(OpIndex matched, OpIndex* input,
-                           FloatRepresentation rep) {
+                           FloatRepresentation rep) const {
     return MatchFloatUnary(matched, input, FloatUnaryOp::Kind::kRoundDown, rep);
   }
 
   bool MatchFloatBinary(OpIndex matched, OpIndex* left, OpIndex* right,
-                        FloatBinopOp::Kind kind, FloatRepresentation rep) {
+                        FloatBinopOp::Kind kind,
+                        FloatRepresentation rep) const {
     const FloatBinopOp* op = TryCast<FloatBinopOp>(matched);
     if (!op || op->kind != kind || op->rep != rep) return false;
     *left = op->left();
@@ -258,13 +309,13 @@ class OperationMatching {
   }
 
   bool MatchFloatSub(OpIndex matched, OpIndex* left, OpIndex* right,
-                     FloatRepresentation rep) {
+                     FloatRepresentation rep) const {
     return MatchFloatBinary(matched, left, right, FloatBinopOp::Kind::kSub,
                             rep);
   }
 
   bool MatchConstantShift(OpIndex matched, OpIndex* input, ShiftOp::Kind* kind,
-                          WordRepresentation* rep, int* amount) {
+                          WordRepresentation* rep, int* amount) const {
     const ShiftOp* op = TryCast<ShiftOp>(matched);
     if (uint32_t rhs_constant;
         op && MatchWord32Constant(op->right(), &rhs_constant) &&
@@ -279,7 +330,7 @@ class OperationMatching {
   }
 
   bool MatchConstantShift(OpIndex matched, OpIndex* input, ShiftOp::Kind kind,
-                          WordRepresentation rep, int* amount) {
+                          WordRepresentation rep, int* amount) const {
     const ShiftOp* op = TryCast<ShiftOp>(matched);
     if (uint32_t rhs_constant;
         op && op->kind == kind &&
@@ -296,7 +347,7 @@ class OperationMatching {
   }
 
   bool MatchConstantRightShift(OpIndex matched, OpIndex* input,
-                               WordRepresentation rep, int* amount) {
+                               WordRepresentation rep, int* amount) const {
     const ShiftOp* op = TryCast<ShiftOp>(matched);
     if (uint32_t rhs_constant;
         op && ShiftOp::IsRightShift(op->kind) && op->rep == rep &&
@@ -312,7 +363,7 @@ class OperationMatching {
   bool MatchConstantShiftRightArithmeticShiftOutZeros(OpIndex matched,
                                                       OpIndex* input,
                                                       WordRepresentation rep,
-                                                      uint16_t* amount) {
+                                                      uint16_t* amount) const {
     const ShiftOp* op = TryCast<ShiftOp>(matched);
     if (uint32_t rhs_constant;
         op && op->kind == ShiftOp::Kind::kShiftRightArithmeticShiftOutZeros &&
@@ -326,9 +377,9 @@ class OperationMatching {
   }
 
  private:
-  Assembler& assembler() { return *static_cast<Assembler*>(this); }
+  Graph& graph_;
 };
 
 }  // namespace v8::internal::compiler::turboshaft
 
-#endif  // V8_COMPILER_TURBOSHAFT_OPERATION_MATCHING_H_
+#endif  // V8_COMPILER_TURBOSHAFT_OPERATION_MATCHER_H_
diff --git a/deps/v8/src/compiler/turboshaft/operations.cc b/deps/v8/src/compiler/turboshaft/operations.cc
index d9b01df05e344a..ee32823536c86c 100644
--- a/deps/v8/src/compiler/turboshaft/operations.cc
+++ b/deps/v8/src/compiler/turboshaft/operations.cc
@@ -5,70 +5,40 @@
 #include "src/compiler/turboshaft/operations.h"
 
 #include <atomic>
+#include <iomanip>
 #include <sstream>
 
 #include "src/base/logging.h"
 #include "src/base/optional.h"
 #include "src/base/platform/mutex.h"
+#include "src/codegen/bailout-reason.h"
 #include "src/codegen/machine-type.h"
 #include "src/common/globals.h"
 #include "src/compiler/backend/instruction-selector.h"
 #include "src/compiler/frame-states.h"
+#include "src/compiler/graph-visualizer.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/turboshaft/deopt-data.h"
 #include "src/compiler/turboshaft/graph.h"
 #include "src/handles/handles-inl.h"
+#include "src/handles/maybe-handles-inl.h"
+
+#ifdef DEBUG
+// For InWritableSharedSpace
+#include "src/objects/objects-inl.h"
+#endif
+
+namespace v8::internal {
+std::ostream& operator<<(std::ostream& os, AbortReason reason) {
+  return os << GetAbortReason(reason);
+}
+}  // namespace v8::internal
 
 namespace v8::internal::compiler::turboshaft {
 
 void Print(const Operation& op) { std::cout << op << "\n"; }
 
-bool AllowImplicitRepresentationChange(RegisterRepresentation actual_rep,
-                                       RegisterRepresentation expected_rep) {
-  if (actual_rep == expected_rep) {
-    return true;
-  }
-  switch (expected_rep.value()) {
-    case RegisterRepresentation::Word32():
-      // We allow implicit 64- to 32-bit truncation.
-      if (actual_rep == RegisterRepresentation::Word64()) {
-        return true;
-      }
-      // We allow implicit tagged -> untagged conversions.
-      // Even without pointer compression, we use `Word32And` for Smi-checks on
-      // tagged values.
-      if (actual_rep == any_of(RegisterRepresentation::Tagged(),
-                               RegisterRepresentation::Compressed())) {
-        return true;
-      }
-      break;
-    case RegisterRepresentation::Word64():
-      // We allow implicit tagged -> untagged conversions.
-      if (kTaggedSize == kInt64Size &&
-          actual_rep == RegisterRepresentation::Tagged()) {
-        return true;
-      }
-      break;
-    case RegisterRepresentation::Tagged():
-      // We allow implicit untagged -> tagged conversions. This is only safe for
-      // Smi values.
-      if (actual_rep == RegisterRepresentation::PointerSized()) {
-        return true;
-      }
-      break;
-    case RegisterRepresentation::Compressed():
-      // Compression is a no-op.
-      if (actual_rep == any_of(RegisterRepresentation::Tagged(),
-                               RegisterRepresentation::PointerSized(),
-                               RegisterRepresentation::Word32())) {
-        return true;
-      }
-      break;
-    default:
-      break;
-  }
-  return false;
-}
+Zone* get_zone(Graph* graph) { return graph->graph_zone(); }
 
 bool ValidOpInputRep(
     const Graph& graph, OpIndex input,
@@ -84,7 +54,7 @@ bool ValidOpInputRep(
       std::cerr << "Turboshaft operation has input #" << input
                 << " with wrong arity.\n";
       std::cerr << "Input has results " << PrintCollection(input_reps)
-                << ", but expected at least " << *projection_index
+                << ", but expected at least " << (*projection_index + 1)
                 << " results.\n";
       return false;
     }
@@ -98,7 +68,7 @@ bool ValidOpInputRep(
     return false;
   }
   for (RegisterRepresentation expected_rep : expected_reps) {
-    if (AllowImplicitRepresentationChange(input_rep, expected_rep)) {
+    if (input_rep.AllowImplicitRepresentationChangeTo(expected_rep)) {
       return true;
     }
   }
@@ -311,6 +281,8 @@ std::ostream& operator<<(std::ostream& os, ChangeOp::Kind kind) {
       return os << "ZeroExtend";
     case ChangeOp::Kind::kSignExtend:
       return os << "SignExtend";
+    case ChangeOp::Kind::kTruncate:
+      return os << "Truncate";
     case ChangeOp::Kind::kBitcast:
       return os << "Bitcast";
   }
@@ -330,6 +302,8 @@ std::ostream& operator<<(std::ostream& os, ChangeOrDeoptOp::Kind kind) {
       return os << "Float64ToInt32";
     case ChangeOrDeoptOp::Kind::kFloat64ToInt64:
       return os << "Float64ToInt64";
+    case ChangeOrDeoptOp::Kind::kFloat64NotHole:
+      return os << "Float64NotHole";
   }
 }
 
@@ -353,15 +327,6 @@ std::ostream& operator<<(std::ostream& os, ChangeOp::Assumption assumption) {
   }
 }
 
-std::ostream& operator<<(std::ostream& os, Float64InsertWord32Op::Kind kind) {
-  switch (kind) {
-    case Float64InsertWord32Op::Kind::kLowHalf:
-      return os << "LowHalf";
-    case Float64InsertWord32Op::Kind::kHighHalf:
-      return os << "HighHalf";
-  }
-}
-
 std::ostream& operator<<(std::ostream& os, SelectOp::Implementation kind) {
   switch (kind) {
     case SelectOp::Implementation::kBranch:
@@ -371,6 +336,48 @@ std::ostream& operator<<(std::ostream& os, SelectOp::Implementation kind) {
   }
 }
 
+std::ostream& operator<<(std::ostream& os, AtomicRMWOp::BinOp bin_op) {
+  switch (bin_op) {
+    case AtomicRMWOp::BinOp::kAdd:
+      return os << "add";
+    case AtomicRMWOp::BinOp::kSub:
+      return os << "sub";
+    case AtomicRMWOp::BinOp::kAnd:
+      return os << "and";
+    case AtomicRMWOp::BinOp::kOr:
+      return os << "or";
+    case AtomicRMWOp::BinOp::kXor:
+      return os << "xor";
+    case AtomicRMWOp::BinOp::kExchange:
+      return os << "exchange";
+    case AtomicRMWOp::BinOp::kCompareExchange:
+      return os << "compare-exchange";
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, AtomicWord32PairOp::OpKind bin_op) {
+  switch (bin_op) {
+    case AtomicWord32PairOp::OpKind::kAdd:
+      return os << "add";
+    case AtomicWord32PairOp::OpKind::kSub:
+      return os << "sub";
+    case AtomicWord32PairOp::OpKind::kAnd:
+      return os << "and";
+    case AtomicWord32PairOp::OpKind::kOr:
+      return os << "or";
+    case AtomicWord32PairOp::OpKind::kXor:
+      return os << "xor";
+    case AtomicWord32PairOp::OpKind::kExchange:
+      return os << "exchange";
+    case AtomicWord32PairOp::OpKind::kCompareExchange:
+      return os << "compare-exchange";
+    case AtomicWord32PairOp::OpKind::kLoad:
+      return os << "load";
+    case AtomicWord32PairOp::OpKind::kStore:
+      return os << "store";
+  }
+}
+
 std::ostream& operator<<(std::ostream& os, FrameConstantOp::Kind kind) {
   switch (kind) {
     case FrameConstantOp::Kind::kStackCheckOffset:
@@ -382,13 +389,6 @@ std::ostream& operator<<(std::ostream& os, FrameConstantOp::Kind kind) {
   }
 }
 
-std::ostream& operator<<(std::ostream& os, TagKind kind) {
-  switch (kind) {
-    case TagKind::kSmiTag:
-      return os << "SmiTag";
-  }
-}
-
 void Operation::PrintInputs(std::ostream& os,
                             const std::string& op_index_prefix) const {
   switch (opcode) {
@@ -412,10 +412,6 @@ void Operation::PrintOptions(std::ostream& os) const {
   }
 }
 
-void PendingLoopPhiOp::PrintOptions(std::ostream& os) const {
-  os << "[" << rep << ", #o" << data.old_backedge_index.id() << "]";
-}
-
 void ConstantOp::PrintOptions(std::ostream& os) const {
   os << "[";
   switch (kind) {
@@ -441,10 +437,10 @@ void ConstantOp::PrintOptions(std::ostream& os) const {
       os << "external: " << external_reference();
       break;
     case Kind::kHeapObject:
-      os << "heap object: " << handle();
+      os << "heap object: " << JSONEscaped(handle());
       break;
     case Kind::kCompressedHeapObject:
-      os << "compressed heap object: " << handle();
+      os << "compressed heap object: " << JSONEscaped(handle());
       break;
     case Kind::kRelocatableWasmCall:
       os << "relocatable wasm call: 0x"
@@ -482,6 +478,7 @@ void LoadOp::PrintOptions(std::ostream& os) const {
   os << "[";
   os << (kind.tagged_base ? "tagged base" : "raw");
   if (kind.maybe_unaligned) os << ", unaligned";
+  if (kind.with_trap_handler) os << ", protected";
   os << ", " << loaded_rep;
   if (element_size_log2 != 0)
     os << ", element size: 2^" << int{element_size_log2};
@@ -489,6 +486,51 @@ void LoadOp::PrintOptions(std::ostream& os) const {
   os << "]";
 }
 
+void AtomicRMWOp::PrintInputs(std::ostream& os,
+                              const std::string& op_index_prefix) const {
+  os << " *(" << op_index_prefix << base().id() << " + " << op_index_prefix
+     << index().id() << ").atomic_" << bin_op << "(";
+  if (bin_op == BinOp::kCompareExchange) {
+    os << "expected: " << op_index_prefix << expected().id();
+    os << ", new: " << op_index_prefix << value().id();
+  } else {
+    os << op_index_prefix << value().id();
+  }
+  os << ")";
+}
+
+void AtomicRMWOp::PrintOptions(std::ostream& os) const {
+  os << "["
+     << "binop: " << bin_op << ", result_rep: " << result_rep
+     << ", input_rep: " << input_rep << "]";
+}
+
+void AtomicWord32PairOp::PrintInputs(std::ostream& os,
+                                     const std::string& op_index_prefix) const {
+  os << " *(" << op_index_prefix << base().id();
+  if (index().valid()) {
+    os << " + " << op_index_prefix << index().id();
+  }
+  if (offset) {
+    os << " + offset=" << offset;
+  }
+  os << ").atomic_word32_pair_" << op_kind << "(";
+  if (op_kind == OpKind::kCompareExchange) {
+    os << "expected: {lo: " << op_index_prefix << value_low().id()
+       << ", hi: " << op_index_prefix << value_high();
+    os << "}, value: {lo: " << op_index_prefix << value_low().id()
+       << ", hi: " << op_index_prefix << value_high() << "}";
+  } else if (op_kind != OpKind::kLoad) {
+    os << "lo: " << op_index_prefix << value_low().id()
+       << ", hi: " << op_index_prefix << value_high();
+  }
+  os << ")";
+}
+
+void AtomicWord32PairOp::PrintOptions(std::ostream& os) const {
+  os << "[opkind: " << op_kind << "]";
+}
+
 void StoreOp::PrintInputs(std::ostream& os,
                           const std::string& op_index_prefix) const {
   os << " *(" << op_index_prefix << base().id();
@@ -507,19 +549,19 @@ void StoreOp::PrintOptions(std::ostream& os) const {
   os << "[";
   os << (kind.tagged_base ? "tagged base" : "raw");
   if (kind.maybe_unaligned) os << ", unaligned";
+  if (kind.with_trap_handler) os << ", protected";
   os << ", " << stored_rep;
   os << ", " << write_barrier;
   if (element_size_log2 != 0)
     os << ", element size: 2^" << int{element_size_log2};
   if (offset != 0) os << ", offset: " << offset;
+  if (maybe_initializing_or_transitioning) os << ", initializing";
   os << "]";
 }
 
 void AllocateOp::PrintOptions(std::ostream& os) const {
   os << "[";
-  os << type << ", ";
-  os << (allow_large_objects == AllowLargeObjects::kTrue ? "allow large objects"
-                                                         : "no large objects");
+  os << type;
   os << "]";
 }
 
@@ -579,6 +621,80 @@ void FrameStateOp::PrintOptions(std::ostream& os) const {
   os << "]";
 }
 
+void FrameStateOp::Validate(const Graph& graph) const {
+  if (inlined) {
+    DCHECK(Get(graph, parent_frame_state()).Is<FrameStateOp>());
+  }
+  FrameStateData::Iterator it = data->iterator(state_values());
+  while (it.has_more()) {
+    switch (it.current_instr()) {
+      case FrameStateData::Instr::kInput: {
+        MachineType type;
+        OpIndex input;
+        it.ConsumeInput(&type, &input);
+        RegisterRepresentation rep =
+            RegisterRepresentation::FromMachineRepresentation(
+                type.representation());
+        if (rep == RegisterRepresentation::Tagged()) {
+          // The deoptimizer can handle compressed values.
+          rep = RegisterRepresentation::Compressed();
+        }
+        DCHECK(ValidOpInputRep(graph, input, rep));
+        break;
+      }
+      case FrameStateData::Instr::kUnusedRegister:
+        it.ConsumeUnusedRegister();
+        break;
+      case FrameStateData::Instr::kDematerializedObject: {
+        uint32_t id;
+        uint32_t field_count;
+        it.ConsumeDematerializedObject(&id, &field_count);
+        break;
+      }
+      case FrameStateData::Instr::kDematerializedObjectReference: {
+        uint32_t id;
+        it.ConsumeDematerializedObjectReference(&id);
+        break;
+      }
+      case FrameStateData::Instr::kArgumentsElements: {
+        CreateArgumentsType type;
+        it.ConsumeArgumentsElements(&type);
+        break;
+      }
+      case FrameStateData::Instr::kArgumentsLength: {
+        it.ConsumeArgumentsLength();
+        break;
+      }
+    }
+  }
+}
+
+void DidntThrowOp::Validate(const Graph& graph) const {
+#ifdef DEBUG
+  DCHECK(MayThrow(graph.Get(throwing_operation()).opcode));
+  switch (graph.Get(throwing_operation()).opcode) {
+    case Opcode::kCall: {
+      auto& call_op = graph.Get(throwing_operation()).Cast<CallOp>();
+      DCHECK(call_op.descriptor->out_reps == outputs_rep());
+      break;
+    }
+    default:
+      UNREACHABLE();
+  }
+  // Check that `may_throw()` is either immediately before or that there is only
+  // a `CheckExceptionOp` in-between.
+  OpIndex this_index = graph.Index(*this);
+  OpIndex in_between = graph.NextIndex(throwing_operation());
+  if (has_catch_block) {
+    DCHECK_NE(in_between, this_index);
+    auto& catch_op = graph.Get(in_between).Cast<CheckExceptionOp>();
+    DCHECK_EQ(catch_op.didnt_throw_block->begin(), this_index);
+  } else {
+    DCHECK_EQ(in_between, this_index);
+  }
+#endif
+}
+
 void WordBinopOp::PrintOptions(std::ostream& os) const {
   os << "[";
   switch (kind) {
@@ -658,6 +774,31 @@ void FloatBinopOp::PrintOptions(std::ostream& os) const {
   os << "]";
 }
 
+void Word32PairBinopOp::PrintOptions(std::ostream& os) const {
+  os << "[";
+  switch (kind) {
+    case Kind::kAdd:
+      os << "Add";
+      break;
+    case Kind::kSub:
+      os << "Sub";
+      break;
+    case Kind::kMul:
+      os << "Mul";
+      break;
+    case Kind::kShiftLeft:
+      os << "ShiftLeft";
+      break;
+    case Kind::kShiftRightArithmetic:
+      os << "ShiftRightSigned";
+      break;
+    case Kind::kShiftRightLogical:
+      os << "ShiftRightUnsigned";
+      break;
+  }
+  os << "]";
+}
+
 void OverflowCheckedBinopOp::PrintOptions(std::ostream& os) const {
   os << "[";
   switch (kind) {
@@ -693,17 +834,40 @@ std::ostream& operator<<(std::ostream& os, const Block* b) {
   return os << b->index();
 }
 
-std::ostream& operator<<(std::ostream& os, OpProperties opProperties) {
-#define PRINT_PROPERTY(Name, ...)             \
-  if (opProperties == OpProperties::Name()) { \
-    return os << #Name;                       \
-  }
-
-  ALL_OP_PROPERTIES(PRINT_PROPERTY)
-
-#undef PRINT_PROPERTY
-
-  UNREACHABLE();
+std::ostream& operator<<(std::ostream& os, OpEffects effects) {
+  auto produce_consume = [](bool produces, bool consumes) {
+    if (!produces && !consumes) {
+      return "🁣";
+    } else if (produces && !consumes) {
+      return "🁤";
+    } else if (!produces && consumes) {
+      return "🁪";
+    } else if (produces && consumes) {
+      return "🁫";
+    }
+    UNREACHABLE();
+  };
+  os << produce_consume(effects.produces.load_heap_memory,
+                        effects.consumes.load_heap_memory);
+  os << produce_consume(effects.produces.load_off_heap_memory,
+                        effects.consumes.load_off_heap_memory);
+  os << "\u2003";  // em space
+  os << produce_consume(effects.produces.store_heap_memory,
+                        effects.consumes.store_heap_memory);
+  os << produce_consume(effects.produces.store_off_heap_memory,
+                        effects.consumes.store_off_heap_memory);
+  os << "\u2003";  // em space
+  os << produce_consume(effects.produces.before_raw_heap_access,
+                        effects.consumes.before_raw_heap_access);
+  os << produce_consume(effects.produces.after_raw_heap_access,
+                        effects.consumes.after_raw_heap_access);
+  os << "\u2003";  // em space
+  os << produce_consume(effects.produces.control_flow,
+                        effects.consumes.control_flow);
+  os << "\u2003";  // em space
+  os << (effects.can_create_identity ? "i" : "_");
+  os << " " << (effects.can_allocate ? "a" : "_");
+  return os;
 }
 
 void SwitchOp::PrintOptions(std::ostream& os) const {
@@ -761,150 +925,197 @@ std::ostream& operator<<(std::ostream& os,
   }
 }
 
-std::ostream& operator<<(std::ostream& os, FloatIsOp::Kind kind) {
+std::ostream& operator<<(std::ostream& os, NumericKind kind) {
   switch (kind) {
-    case FloatIsOp::Kind::kNaN:
+    case NumericKind::kFloat64Hole:
+      return os << "Float64Hole";
+    case NumericKind::kFinite:
+      return os << "Finite";
+    case NumericKind::kInteger:
+      return os << "Integer";
+    case NumericKind::kSafeInteger:
+      return os << "SafeInteger";
+    case NumericKind::kMinusZero:
+      return os << "MinusZero";
+    case NumericKind::kNaN:
       return os << "NaN";
   }
 }
 
-std::ostream& operator<<(std::ostream& os, ConvertToObjectOp::Kind kind) {
+std::ostream& operator<<(std::ostream& os, ConvertOp::Kind kind) {
+  switch (kind) {
+    case ConvertOp::Kind::kObject:
+      return os << "Object";
+    case ConvertOp::Kind::kBoolean:
+      return os << "Boolean";
+    case ConvertOp::Kind::kNumber:
+      return os << "Number";
+    case ConvertOp::Kind::kNumberOrOddball:
+      return os << "NumberOrOddball";
+    case ConvertOp::Kind::kPlainPrimitive:
+      return os << "PlainPrimitive";
+    case ConvertOp::Kind::kString:
+      return os << "String";
+    case ConvertOp::Kind::kSmi:
+      return os << "Smi";
+  }
+}
+
+std::ostream& operator<<(std::ostream& os,
+                         ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind kind) {
   switch (kind) {
-    case ConvertToObjectOp::Kind::kBigInt:
+    case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kBigInt:
       return os << "BigInt";
-    case ConvertToObjectOp::Kind::kBoolean:
+    case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kBoolean:
       return os << "Boolean";
-    case ConvertToObjectOp::Kind::kHeapNumber:
+    case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kHeapNumber:
       return os << "HeapNumber";
-    case ConvertToObjectOp::Kind::kNumber:
+    case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kNumber:
       return os << "Number";
-    case ConvertToObjectOp::Kind::kSmi:
+    case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kSmi:
       return os << "Smi";
-    case ConvertToObjectOp::Kind::kString:
+    case ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind::kString:
       return os << "String";
   }
 }
 
 std::ostream& operator<<(
     std::ostream& os,
-    ConvertToObjectOp::InputInterpretation input_interpretation) {
+    ConvertUntaggedToJSPrimitiveOp::InputInterpretation input_interpretation) {
   switch (input_interpretation) {
-    case ConvertToObjectOp::InputInterpretation::kSigned:
+    case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kSigned:
       return os << "Signed";
-    case ConvertToObjectOp::InputInterpretation::kUnsigned:
+    case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kUnsigned:
       return os << "Unsigned";
-    case ConvertToObjectOp::InputInterpretation::kCharCode:
+    case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kCharCode:
       return os << "CharCode";
-    case ConvertToObjectOp::InputInterpretation::kCodePoint:
+    case ConvertUntaggedToJSPrimitiveOp::InputInterpretation::kCodePoint:
       return os << "CodePoint";
   }
 }
 
-std::ostream& operator<<(std::ostream& os,
-                         ConvertToObjectOrDeoptOp::Kind kind) {
+std::ostream& operator<<(
+    std::ostream& os,
+    ConvertUntaggedToJSPrimitiveOrDeoptOp::JSPrimitiveKind kind) {
   switch (kind) {
-    case ConvertToObjectOrDeoptOp::Kind::kSmi:
+    case ConvertUntaggedToJSPrimitiveOrDeoptOp::JSPrimitiveKind::kSmi:
       return os << "Smi";
   }
 }
 
 std::ostream& operator<<(
-    std::ostream& os,
-    ConvertToObjectOrDeoptOp::InputInterpretation input_interpretation) {
+    std::ostream& os, ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation
+                          input_interpretation) {
   switch (input_interpretation) {
-    case ConvertToObjectOrDeoptOp::InputInterpretation::kSigned:
+    case ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation::kSigned:
       return os << "Signed";
-    case ConvertToObjectOrDeoptOp::InputInterpretation::kUnsigned:
+    case ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation::kUnsigned:
       return os << "Unsigned";
   }
 }
 
 std::ostream& operator<<(std::ostream& os,
-                         ConvertObjectToPrimitiveOp::Kind kind) {
+                         ConvertJSPrimitiveToUntaggedOp::UntaggedKind kind) {
   switch (kind) {
-    case ConvertObjectToPrimitiveOp::Kind::kInt32:
+    case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kInt32:
       return os << "Int32";
-    case ConvertObjectToPrimitiveOp::Kind::kInt64:
+    case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kInt64:
       return os << "Int64";
-    case ConvertObjectToPrimitiveOp::Kind::kUint32:
+    case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kUint32:
       return os << "Uint32";
-    case ConvertObjectToPrimitiveOp::Kind::kBit:
+    case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kBit:
       return os << "Bit";
-    case ConvertObjectToPrimitiveOp::Kind::kFloat64:
+    case ConvertJSPrimitiveToUntaggedOp::UntaggedKind::kFloat64:
       return os << "Float64";
   }
 }
 
 std::ostream& operator<<(
     std::ostream& os,
-    ConvertObjectToPrimitiveOp::InputAssumptions input_assumptions) {
+    ConvertJSPrimitiveToUntaggedOp::InputAssumptions input_assumptions) {
   switch (input_assumptions) {
-    case ConvertObjectToPrimitiveOp::InputAssumptions::kObject:
-      return os << "Object";
-    case ConvertObjectToPrimitiveOp::InputAssumptions::kSmi:
+    case ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kBoolean:
+      return os << "Boolean";
+    case ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kSmi:
       return os << "Smi";
-    case ConvertObjectToPrimitiveOp::InputAssumptions::kNumberOrOddball:
+    case ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kNumberOrOddball:
       return os << "NumberOrOddball";
+    case ConvertJSPrimitiveToUntaggedOp::InputAssumptions::kPlainPrimitive:
+      return os << "PlainPrimitive";
   }
 }
 
 std::ostream& operator<<(
-    std::ostream& os, ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind kind) {
+    std::ostream& os,
+    ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind kind) {
   switch (kind) {
-    case ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kInt32:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt32:
       return os << "Int32";
-    case ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kInt64:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt64:
       return os << "Int64";
-    case ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kFloat64:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kFloat64:
       return os << "Float64";
-    case ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind::kArrayIndex:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kArrayIndex:
       return os << "ArrayIndex";
   }
 }
 
-std::ostream& operator<<(std::ostream& os,
-                         ConvertObjectToPrimitiveOrDeoptOp::ObjectKind kind) {
+std::ostream& operator<<(
+    std::ostream& os,
+    ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind kind) {
   switch (kind) {
-    case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumber:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kNumber:
       return os << "Number";
-    case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumberOrBoolean:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::
+        kNumberOrBoolean:
       return os << "NumberOrBoolean";
-    case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumberOrOddball:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::
+        kNumberOrOddball:
       return os << "NumberOrOddball";
-    case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kNumberOrString:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::
+        kNumberOrString:
       return os << "NumberOrString";
-    case ConvertObjectToPrimitiveOrDeoptOp::ObjectKind::kSmi:
+    case ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind::kSmi:
       return os << "Smi";
   }
 }
 
 std::ostream& operator<<(std::ostream& os,
-                         TruncateObjectToPrimitiveOp::Kind kind) {
+                         TruncateJSPrimitiveToUntaggedOp::UntaggedKind kind) {
   switch (kind) {
-    case TruncateObjectToPrimitiveOp::Kind::kInt32:
+    case TruncateJSPrimitiveToUntaggedOp::UntaggedKind::kInt32:
       return os << "Int32";
-    case TruncateObjectToPrimitiveOp::Kind::kInt64:
+    case TruncateJSPrimitiveToUntaggedOp::UntaggedKind::kInt64:
       return os << "Int64";
-    case TruncateObjectToPrimitiveOp::Kind::kBit:
+    case TruncateJSPrimitiveToUntaggedOp::UntaggedKind::kBit:
       return os << "Bit";
   }
 }
 
 std::ostream& operator<<(
     std::ostream& os,
-    TruncateObjectToPrimitiveOp::InputAssumptions input_assumptions) {
+    TruncateJSPrimitiveToUntaggedOp::InputAssumptions input_assumptions) {
   switch (input_assumptions) {
-    case TruncateObjectToPrimitiveOp::InputAssumptions::kBigInt:
+    case TruncateJSPrimitiveToUntaggedOp::InputAssumptions::kBigInt:
       return os << "BigInt";
-    case TruncateObjectToPrimitiveOp::InputAssumptions::kNumberOrOddball:
+    case TruncateJSPrimitiveToUntaggedOp::InputAssumptions::kNumberOrOddball:
       return os << "NumberOrOddball";
-    case TruncateObjectToPrimitiveOp::InputAssumptions::kHeapObject:
+    case TruncateJSPrimitiveToUntaggedOp::InputAssumptions::kHeapObject:
       return os << "HeapObject";
-    case TruncateObjectToPrimitiveOp::InputAssumptions::kObject:
+    case TruncateJSPrimitiveToUntaggedOp::InputAssumptions::kObject:
       return os << "Object";
   }
 }
 
+std::ostream& operator<<(
+    std::ostream& os,
+    TruncateJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind kind) {
+  switch (kind) {
+    case TruncateJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind::kInt32:
+      return os << "Int32";
+  }
+}
+
 std::ostream& operator<<(std::ostream& os, NewArrayOp::Kind kind) {
   switch (kind) {
     case NewArrayOp::Kind::kDouble:
@@ -993,6 +1204,270 @@ std::ostream& operator<<(std::ostream& os, StringComparisonOp::Kind kind) {
   }
 }
 
+std::ostream& operator<<(std::ostream& os, ArgumentsLengthOp::Kind kind) {
+  switch (kind) {
+    case ArgumentsLengthOp::Kind::kArguments:
+      return os << "Arguments";
+    case ArgumentsLengthOp::Kind::kRest:
+      return os << "Rest";
+  }
+}
+
+std::ostream& operator<<(std::ostream& os,
+                         TransitionAndStoreArrayElementOp::Kind kind) {
+  switch (kind) {
+    case TransitionAndStoreArrayElementOp::Kind::kElement:
+      return os << "Element";
+    case TransitionAndStoreArrayElementOp::Kind::kNumberElement:
+      return os << "NumberElement";
+    case TransitionAndStoreArrayElementOp::Kind::kOddballElement:
+      return os << "OddballElement";
+    case TransitionAndStoreArrayElementOp::Kind::kNonNumberElement:
+      return os << "NonNumberElement";
+    case TransitionAndStoreArrayElementOp::Kind::kSignedSmallElement:
+      return os << "SignedSmallElement";
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, SameValueOp::Mode mode) {
+  switch (mode) {
+    case SameValueOp::Mode::kSameValue:
+      return os << "SameValue";
+    case SameValueOp::Mode::kSameValueNumbersOnly:
+      return os << "SameValueNumbersOnly";
+  }
+}
+
+std::ostream& operator<<(std::ostream& os, FindOrderedHashEntryOp::Kind kind) {
+  switch (kind) {
+    case FindOrderedHashEntryOp::Kind::kFindOrderedHashMapEntry:
+      return os << "FindOrderedHashMapEntry";
+    case FindOrderedHashEntryOp::Kind::kFindOrderedHashMapEntryForInt32Key:
+      return os << "FindOrderedHashMapEntryForInt32Key";
+    case FindOrderedHashEntryOp::Kind::kFindOrderedHashSetEntry:
+      return os << "FindOrderedHashSetEntry";
+  }
+}
+
+#if V8_ENABLE_WEBASSEMBLY
+
+const RegisterRepresentation& RepresentationFor(wasm::ValueType type) {
+  static const RegisterRepresentation kWord32 =
+      RegisterRepresentation::Word32();
+  static const RegisterRepresentation kWord64 =
+      RegisterRepresentation::Word64();
+  static const RegisterRepresentation kFloat32 =
+      RegisterRepresentation::Float32();
+  static const RegisterRepresentation kFloat64 =
+      RegisterRepresentation::Float64();
+  static const RegisterRepresentation kTagged =
+      RegisterRepresentation::Tagged();
+  static const RegisterRepresentation kSimd128 =
+      RegisterRepresentation::Simd128();
+
+  switch (type.kind()) {
+    case wasm::kI8:
+    case wasm::kI16:
+    case wasm::kI32:
+      return kWord32;
+    case wasm::kI64:
+      return kWord64;
+    case wasm::kF32:
+      return kFloat32;
+    case wasm::kF64:
+      return kFloat64;
+    case wasm::kRefNull:
+    case wasm::kRef:
+      return kTagged;
+    case wasm::kS128:
+      return kSimd128;
+    case wasm::kVoid:
+    case wasm::kRtt:
+    case wasm::kBottom:
+      UNREACHABLE();
+  }
+}
+
+namespace {
+void PrintSimd128Value(std::ostream& os, const uint8_t value[kSimd128Size]) {
+  os << "0x" << std::hex << std::setfill('0');
+#ifdef V8_TARGET_BIG_ENDIAN
+  for (int i = 0; i < kSimd128Size; i++) {
+#else
+  for (int i = kSimd128Size - 1; i >= 0; i--) {
+#endif
+    os << std::setw(2) << static_cast<int>(value[i]);
+  }
+  os << std::dec << std::setfill(' ');
+}
+}  // namespace
+
+void Simd128ConstantOp::PrintOptions(std::ostream& os) const {
+  PrintSimd128Value(os, value);
+}
+
+std::ostream& operator<<(std::ostream& os, Simd128BinopOp::Kind kind) {
+  switch (kind) {
+#define PRINT_KIND(kind)              \
+  case Simd128BinopOp::Kind::k##kind: \
+    return os << #kind;
+    FOREACH_SIMD_128_BINARY_OPCODE(PRINT_KIND)
+  }
+#undef PRINT_KIND
+}
+
+std::ostream& operator<<(std::ostream& os, Simd128UnaryOp::Kind kind) {
+  switch (kind) {
+#define PRINT_KIND(kind)              \
+  case Simd128UnaryOp::Kind::k##kind: \
+    return os << #kind;
+    FOREACH_SIMD_128_UNARY_OPCODE(PRINT_KIND)
+  }
+#undef PRINT_KIND
+}
+
+std::ostream& operator<<(std::ostream& os, Simd128ShiftOp::Kind kind) {
+  switch (kind) {
+#define PRINT_KIND(kind)              \
+  case Simd128ShiftOp::Kind::k##kind: \
+    return os << #kind;
+    FOREACH_SIMD_128_SHIFT_OPCODE(PRINT_KIND)
+  }
+#undef PRINT_KIND
+}
+
+std::ostream& operator<<(std::ostream& os, Simd128TestOp::Kind kind) {
+  switch (kind) {
+#define PRINT_KIND(kind)             \
+  case Simd128TestOp::Kind::k##kind: \
+    return os << #kind;
+    FOREACH_SIMD_128_TEST_OPCODE(PRINT_KIND)
+  }
+#undef PRINT_KIND
+}
+
+std::ostream& operator<<(std::ostream& os, Simd128SplatOp::Kind kind) {
+  switch (kind) {
+#define PRINT_KIND(kind)              \
+  case Simd128SplatOp::Kind::k##kind: \
+    return os << #kind;
+    FOREACH_SIMD_128_SPLAT_OPCODE(PRINT_KIND)
+  }
+#undef PRINT_KIND
+}
+
+std::ostream& operator<<(std::ostream& os, Simd128TernaryOp::Kind kind) {
+  switch (kind) {
+#define PRINT_KIND(kind)                \
+  case Simd128TernaryOp::Kind::k##kind: \
+    return os << #kind;
+    FOREACH_SIMD_128_TERNARY_OPCODE(PRINT_KIND)
+  }
+#undef PRINT_KIND
+}
+
+void Simd128ExtractLaneOp::PrintOptions(std::ostream& os) const {
+  os << "[";
+  switch (kind) {
+    case Kind::kI8x16S:
+      os << "I8x16S";
+      break;
+    case Kind::kI8x16U:
+      os << "I8x16U";
+      break;
+    case Kind::kI16x8S:
+      os << "I16x8S";
+      break;
+    case Kind::kI16x8U:
+      os << "I16x8U";
+      break;
+    case Kind::kI32x4:
+      os << "I32x4";
+      break;
+    case Kind::kI64x2:
+      os << "I64x2";
+      break;
+    case Kind::kF32x4:
+      os << "F32x4";
+      break;
+    case Kind::kF64x2:
+      os << "F64x2";
+      break;
+  }
+  os << ", " << static_cast<int32_t>(lane) << "]";
+}
+
+void Simd128ReplaceLaneOp::PrintOptions(std::ostream& os) const {
+  os << "[";
+  switch (kind) {
+    case Kind::kI8x16:
+      os << "I8x16";
+      break;
+    case Kind::kI16x8:
+      os << "I16x8";
+      break;
+    case Kind::kI32x4:
+      os << "I32x4";
+      break;
+    case Kind::kI64x2:
+      os << "I64x2";
+      break;
+    case Kind::kF32x4:
+      os << "F32x4";
+      break;
+    case Kind::kF64x2:
+      os << "F64x2";
+      break;
+  }
+  os << ", " << static_cast<int32_t>(lane) << "]";
+}
+
+void Simd128LaneMemoryOp::PrintOptions(std::ostream& os) const {
+  os << "[" << (mode == Mode::kLoad ? "Load" : "Store") << ", ";
+  if (kind.maybe_unaligned) os << "unaligned, ";
+  if (kind.with_trap_handler) os << "protected, ";
+  switch (lane_kind) {
+    case LaneKind::k8:
+      os << "8";
+      break;
+    case LaneKind::k16:
+      os << "16";
+      break;
+    case LaneKind::k32:
+      os << "32";
+      break;
+    case LaneKind::k64:
+      os << "64";
+      break;
+  }
+  os << "bit, lane: " << static_cast<int>(lane);
+  if (offset != 0) os << ", offset: " << offset;
+  os << "]";
+}
+
+void Simd128LoadTransformOp::PrintOptions(std::ostream& os) const {
+  os << "[";
+  if (load_kind.maybe_unaligned) os << "unaligned, ";
+  if (load_kind.with_trap_handler) os << "protected, ";
+
+  switch (transform_kind) {
+#define PRINT_KIND(kind)       \
+  case TransformKind::k##kind: \
+    os << #kind;               \
+    break;
+    FOREACH_SIMD_128_LOAD_TRANSFORM_OPCODE(PRINT_KIND)
+#undef PRINT_KIND
+  }
+
+  os << ", offset: " << offset << "]";
+}
+
+void Simd128ShuffleOp::PrintOptions(std::ostream& os) const {
+  PrintSimd128Value(os, shuffle);
+}
+
+#endif  // V8_ENABLE_WEBASSEBMLY
+
 std::string Operation::ToString() const {
   std::stringstream ss;
   ss << *this;
@@ -1017,4 +1492,90 @@ void SupportedOperations::Initialize() {
 #undef SET_SUPPORTED
 }
 
+base::SmallVector<Block*, 4> SuccessorBlocks(const Block& block,
+                                             const Graph& graph) {
+  return SuccessorBlocks(block.LastOperation(graph));
+}
+
+// static
+bool SupportedOperations::IsUnalignedLoadSupported(MemoryRepresentation repr) {
+  return InstructionSelector::AlignmentRequirements().IsUnalignedLoadSupported(
+      repr.ToMachineType().representation());
+}
+
+// static
+bool SupportedOperations::IsUnalignedStoreSupported(MemoryRepresentation repr) {
+  return InstructionSelector::AlignmentRequirements().IsUnalignedStoreSupported(
+      repr.ToMachineType().representation());
+}
+
+void CheckExceptionOp::Validate(const Graph& graph) const {
+  DCHECK_NE(didnt_throw_block, catch_block);
+  // `CheckException` should follow right after the throwing operation.
+  DCHECK_EQ(throwing_operation(), graph.PreviousIndex(graph.Index(*this)));
+}
+
+namespace {
+// Ensures basic consistency of representation mapping.
+class InputsRepFactoryCheck : InputsRepFactory {
+  static_assert(*ToMaybeRepPointer(RegisterRepresentation::Word32()) ==
+                MaybeRegisterRepresentation::Word32());
+  static_assert(*ToMaybeRepPointer(RegisterRepresentation::Word64()) ==
+                MaybeRegisterRepresentation::Word64());
+  static_assert(*ToMaybeRepPointer(RegisterRepresentation::Float32()) ==
+                MaybeRegisterRepresentation::Float32());
+  static_assert(*ToMaybeRepPointer(RegisterRepresentation::Float64()) ==
+                MaybeRegisterRepresentation::Float64());
+  static_assert(*ToMaybeRepPointer(RegisterRepresentation::Tagged()) ==
+                MaybeRegisterRepresentation::Tagged());
+  static_assert(*ToMaybeRepPointer(RegisterRepresentation::Compressed()) ==
+                MaybeRegisterRepresentation::Compressed());
+  static_assert(*ToMaybeRepPointer(RegisterRepresentation::Simd128()) ==
+                MaybeRegisterRepresentation::Simd128());
+};
+}  // namespace
+
+bool IsUnlikelySuccessor(const Block* block, const Block* successor,
+                         const Graph& graph) {
+  DCHECK(base::contains(successor->Predecessors(), block));
+  const Operation& terminator = block->LastOperation(graph);
+  switch (terminator.opcode) {
+    case Opcode::kCheckException: {
+      const CheckExceptionOp& check_exception =
+          terminator.Cast<CheckExceptionOp>();
+      return successor == check_exception.catch_block;
+    }
+    case Opcode::kGoto:
+      return false;
+    case Opcode::kBranch: {
+      const BranchOp& branch = terminator.Cast<BranchOp>();
+      return (branch.hint == BranchHint::kTrue &&
+              successor == branch.if_false) ||
+             (branch.hint == BranchHint::kFalse && successor == branch.if_true);
+    }
+    case Opcode::kSwitch: {
+      const SwitchOp& swtch = terminator.Cast<SwitchOp>();
+      if (successor == swtch.default_case) {
+        return swtch.default_hint == BranchHint::kFalse;
+      }
+      auto it = std::find_if(swtch.cases.begin(), swtch.cases.end(),
+                             [successor](const SwitchOp::Case& c) {
+                               return c.destination == successor;
+                             });
+      DCHECK_NE(it, swtch.cases.end());
+      return it->hint == BranchHint::kFalse;
+    }
+    case Opcode::kDeoptimize:
+    case Opcode::kTailCall:
+    case Opcode::kUnreachable:
+    case Opcode::kReturn:
+      UNREACHABLE();
+
+#define NON_TERMINATOR_CASE(op) case Opcode::k##op:
+      TURBOSHAFT_OPERATION_LIST_NOT_BLOCK_TERMINATOR(NON_TERMINATOR_CASE)
+      UNREACHABLE();
+#undef NON_TERMINATOR_CASE
+  }
+}
+
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/operations.h b/deps/v8/src/compiler/turboshaft/operations.h
index 8ef0f79b8e8b65..5b8a4a7a7999ac 100644
--- a/deps/v8/src/compiler/turboshaft/operations.h
+++ b/deps/v8/src/compiler/turboshaft/operations.h
@@ -23,17 +23,25 @@
 #include "src/codegen/external-reference.h"
 #include "src/common/globals.h"
 #include "src/compiler/common-operator.h"
+#include "src/compiler/fast-api-calls.h"
 #include "src/compiler/globals.h"
+#include "src/compiler/simplified-operator.h"
 #include "src/compiler/turboshaft/deopt-data.h"
 #include "src/compiler/turboshaft/fast-hash.h"
 #include "src/compiler/turboshaft/index.h"
 #include "src/compiler/turboshaft/representations.h"
+#include "src/compiler/turboshaft/snapshot-table.h"
 #include "src/compiler/turboshaft/types.h"
 #include "src/compiler/turboshaft/utils.h"
 #include "src/compiler/write-barrier-kind.h"
 
+#if V8_ENABLE_WEBASSEMBLY
+#include "src/wasm/wasm-module.h"
+#endif
+
 namespace v8::internal {
 class HeapObject;
+std::ostream& operator<<(std::ostream& os, AbortReason reason);
 }  // namespace v8::internal
 namespace v8::internal::compiler {
 class CallDescriptor;
@@ -48,13 +56,24 @@ struct FrameStateData;
 class Graph;
 struct FrameStateOp;
 
+// This belongs to `VariableReducer` in `variable-reducer.h`. It is defined here
+// because of cyclic header dependencies.
+struct VariableData {
+  MaybeRegisterRepresentation rep;
+  bool loop_invariant;
+  IntrusiveSetIndex active_loop_variables_index = {};
+};
+using Variable = SnapshotTable<OpIndex, VariableData>::Key;
+
 // DEFINING NEW OPERATIONS
 // =======================
 // For each operation `Foo`, we define:
-// - an entry V(Foo) in TURBOSHAFT_OPERATION_LIST, which defines `Opcode::kFoo`.
-// - a `struct FooOp`
-// The struct derives from `OperationT<Foo>` or `FixedArityOperationT<k, Foo>`
-// Furthermore, it has to contain:
+// - An entry V(Foo) in either TURBOSHAFT_OPERATION_LIST_BLOCK_TERMINATOR or
+//   TURBOSHAFT_OPERATION_LIST_NOT_BLOCK_TERMINATOR, which defines
+//   `Opcode::kFoo` and whether the operation is a block terminator.
+// - A `struct FooOp`, which derives from either `OperationT<FooOp>` or
+//   `FixedArityOperationT<k, FooOp>` if the op always has excactly `k` inputs.
+// Furthermore, the struct has to contain:
 // - A bunch of options directly as public fields.
 // - A getter `options()` returning a tuple of all these options. This is used
 //   for default printing and hashing. Alternatively, `void
@@ -65,8 +84,8 @@ struct FrameStateOp;
 //   a variable arity operation where the constructor doesn't take the inputs as
 //   a single base::Vector<OpIndex> argument, it's also necessary to overwrite
 //   the static `New` function, see `CallOp` for an example.
-// - `OperatorProperties` as either a static constexpr member `properties` or a
-//   non-static method `Properties()` if the properties depend on the particular
+// - `OpEffects` as either a static constexpr member `effects` or a
+//   non-static method `Effects()` if the effects depend on the particular
 //   operation and not just the opcode.
 
 #ifdef V8_INTL_SUPPORT
@@ -75,78 +94,170 @@ struct FrameStateOp;
 #define TURBOSHAFT_INTL_OPERATION_LIST(V)
 #endif  // V8_INTL_SUPPORT
 
-#define TURBOSHAFT_OPERATION_LIST(V) \
-  TURBOSHAFT_INTL_OPERATION_LIST(V)  \
-  V(WordBinop)                       \
-  V(FloatBinop)                      \
-  V(OverflowCheckedBinop)            \
-  V(WordUnary)                       \
-  V(FloatUnary)                      \
-  V(Shift)                           \
-  V(Equal)                           \
-  V(Comparison)                      \
-  V(Change)                          \
-  V(ChangeOrDeopt)                   \
-  V(TryChange)                       \
-  V(Float64InsertWord32)             \
-  V(TaggedBitcast)                   \
-  V(Select)                          \
-  V(PendingLoopPhi)                  \
-  V(Constant)                        \
-  V(Load)                            \
-  V(Store)                           \
-  V(Allocate)                        \
-  V(DecodeExternalPointer)           \
-  V(Retain)                          \
-  V(Parameter)                       \
-  V(OsrValue)                        \
-  V(Goto)                            \
-  V(StackPointerGreaterThan)         \
-  V(StackSlot)                       \
-  V(FrameConstant)                   \
-  V(Deoptimize)                      \
-  V(DeoptimizeIf)                    \
-  V(TrapIf)                          \
-  V(Phi)                             \
-  V(FrameState)                      \
-  V(Call)                            \
-  V(CallAndCatchException)           \
-  V(LoadException)                   \
-  V(TailCall)                        \
-  V(Unreachable)                     \
-  V(Return)                          \
-  V(Branch)                          \
-  V(Switch)                          \
-  V(Tuple)                           \
-  V(Projection)                      \
-  V(StaticAssert)                    \
-  V(CheckTurboshaftTypeOf)           \
-  V(ObjectIs)                        \
-  V(FloatIs)                         \
-  V(ConvertToObject)                 \
-  V(ConvertToObjectOrDeopt)          \
-  V(ConvertObjectToPrimitive)        \
-  V(ConvertObjectToPrimitiveOrDeopt) \
-  V(TruncateObjectToPrimitive)       \
-  V(Tag)                             \
-  V(Untag)                           \
-  V(NewConsString)                   \
-  V(NewArray)                        \
-  V(DoubleArrayMinMax)               \
-  V(LoadFieldByIndex)                \
-  V(DebugBreak)                      \
-  V(BigIntBinop)                     \
-  V(BigIntEqual)                     \
-  V(BigIntComparison)                \
-  V(BigIntUnary)                     \
-  V(LoadRootRegister)                \
-  V(StringAt)                        \
-  V(StringLength)                    \
-  V(StringIndexOf)                   \
-  V(StringFromCodePointAt)           \
-  V(StringSubstring)                 \
-  V(StringEqual)                     \
-  V(StringComparison)
+#ifdef V8_ENABLE_WEBASSEMBLY
+// These operations should be lowered to Machine operations during
+// WasmLoweringPhase.
+#define TURBOSHAFT_WASM_OPERATION_LIST(V) \
+  V(GlobalGet)                            \
+  V(GlobalSet)                            \
+  V(IsNull)                               \
+  V(Null)                                 \
+  V(AssertNotNull)                        \
+  V(RttCanon)                             \
+  V(WasmTypeCheck)                        \
+  V(WasmTypeCast)                         \
+  V(StructGet)                            \
+  V(StructSet)                            \
+  V(ArrayGet)                             \
+  V(ArraySet)                             \
+  V(ArrayLength)
+
+#define TURBOSHAFT_SIMD_OPERATION_LIST(V) \
+  V(Simd128Constant)                      \
+  V(Simd128Binop)                         \
+  V(Simd128Unary)                         \
+  V(Simd128Shift)                         \
+  V(Simd128Test)                          \
+  V(Simd128Splat)                         \
+  V(Simd128Ternary)                       \
+  V(Simd128ExtractLane)                   \
+  V(Simd128ReplaceLane)                   \
+  V(Simd128LaneMemory)                    \
+  V(Simd128LoadTransform)                 \
+  V(Simd128Shuffle)
+
+#else
+#define TURBOSHAFT_WASM_OPERATION_LIST(V)
+#define TURBOSHAFT_SIMD_OPERATION_LIST(V)
+#endif
+
+#define TURBOSHAFT_OPERATION_LIST_BLOCK_TERMINATOR(V) \
+  V(CheckException)                                   \
+  V(Goto)                                             \
+  V(TailCall)                                         \
+  V(Unreachable)                                      \
+  V(Return)                                           \
+  V(Branch)                                           \
+  V(Switch)                                           \
+  V(Deoptimize)
+
+// These operations should be lowered to Machine operations during
+// MachineLoweringPhase.
+#define TURBOSHAFT_SIMPLIFIED_OPERATION_LIST(V) \
+  TURBOSHAFT_INTL_OPERATION_LIST(V)             \
+  V(ArgumentsLength)                            \
+  V(BigIntBinop)                                \
+  V(BigIntComparison)                           \
+  V(BigIntEqual)                                \
+  V(BigIntUnary)                                \
+  V(CheckedClosure)                             \
+  V(CheckEqualsInternalizedString)              \
+  V(CheckMaps)                                  \
+  V(CompareMaps)                                \
+  V(FloatIs)                                    \
+  V(ObjectIs)                                   \
+  V(ObjectIsNumericValue)                       \
+  V(Float64SameValue)                           \
+  V(SameValue)                                  \
+  V(ChangeOrDeopt)                              \
+  V(Convert)                                    \
+  V(ConvertJSPrimitiveToObject)                 \
+  V(ConvertJSPrimitiveToUntagged)               \
+  V(ConvertJSPrimitiveToUntaggedOrDeopt)        \
+  V(ConvertUntaggedToJSPrimitive)               \
+  V(ConvertUntaggedToJSPrimitiveOrDeopt)        \
+  V(TruncateJSPrimitiveToUntagged)              \
+  V(TruncateJSPrimitiveToUntaggedOrDeopt)       \
+  V(DoubleArrayMinMax)                          \
+  V(EnsureWritableFastElements)                 \
+  V(FastApiCall)                                \
+  V(FindOrderedHashEntry)                       \
+  V(LoadDataViewElement)                        \
+  V(LoadFieldByIndex)                           \
+  V(LoadMessage)                                \
+  V(LoadStackArgument)                          \
+  V(LoadTypedElement)                           \
+  V(StoreDataViewElement)                       \
+  V(StoreMessage)                               \
+  V(StoreTypedElement)                          \
+  V(MaybeGrowFastElements)                      \
+  V(NewArgumentsElements)                       \
+  V(NewArray)                                   \
+  V(RuntimeAbort)                               \
+  V(StaticAssert)                               \
+  V(StringAt)                                   \
+  V(StringComparison)                           \
+  V(StringConcat)                               \
+  V(StringEqual)                                \
+  V(StringFromCodePointAt)                      \
+  V(StringIndexOf)                              \
+  V(StringLength)                               \
+  V(StringSubstring)                            \
+  V(NewConsString)                              \
+  V(TransitionAndStoreArrayElement)             \
+  V(TransitionElementsKind)                     \
+  V(DebugPrint)                                 \
+  V(CheckTurboshaftTypeOf)
+
+// These Operations are the lowest level handled by Turboshaft, and are
+// supported by the InstructionSelector.
+#define TURBOSHAFT_MACHINE_OPERATION_LIST(V) \
+  V(WordBinop)                               \
+  V(FloatBinop)                              \
+  V(Word32PairBinop)                         \
+  V(OverflowCheckedBinop)                    \
+  V(WordUnary)                               \
+  V(FloatUnary)                              \
+  V(Shift)                                   \
+  V(Equal)                                   \
+  V(Comparison)                              \
+  V(Change)                                  \
+  V(TryChange)                               \
+  V(BitcastWord32PairToFloat64)              \
+  V(TaggedBitcast)                           \
+  V(Select)                                  \
+  V(PendingLoopPhi)                          \
+  V(Constant)                                \
+  V(LoadRootRegister)                        \
+  V(Load)                                    \
+  V(Store)                                   \
+  V(Retain)                                  \
+  V(Parameter)                               \
+  V(OsrValue)                                \
+  V(StackPointerGreaterThan)                 \
+  V(StackSlot)                               \
+  V(FrameConstant)                           \
+  V(DeoptimizeIf)                            \
+  V(TrapIf)                                  \
+  V(Phi)                                     \
+  V(FrameState)                              \
+  V(Call)                                    \
+  V(CatchBlockBegin)                         \
+  V(DidntThrow)                              \
+  V(Tuple)                                   \
+  V(Projection)                              \
+  V(DebugBreak)                              \
+  V(AssumeMap)                               \
+  V(AtomicRMW)                               \
+  V(AtomicWord32Pair)
+
+// These are operations that are not Machine operations and need to be lowered
+// before Instruction Selection, but they are not lowered during the
+// MachineLoweringPhase.
+#define TURBOSHAFT_OTHER_OPERATION_LIST(V) \
+  V(Allocate)                              \
+  V(DecodeExternalPointer)
+
+#define TURBOSHAFT_OPERATION_LIST_NOT_BLOCK_TERMINATOR(V) \
+  TURBOSHAFT_WASM_OPERATION_LIST(V)                       \
+  TURBOSHAFT_SIMD_OPERATION_LIST(V)                       \
+  TURBOSHAFT_MACHINE_OPERATION_LIST(V)                    \
+  TURBOSHAFT_SIMPLIFIED_OPERATION_LIST(V)                 \
+  TURBOSHAFT_OTHER_OPERATION_LIST(V)
+
+#define TURBOSHAFT_OPERATION_LIST(V)            \
+  TURBOSHAFT_OPERATION_LIST_BLOCK_TERMINATOR(V) \
+  TURBOSHAFT_OPERATION_LIST_NOT_BLOCK_TERMINATOR(V)
 
 enum class Opcode : uint8_t {
 #define ENUM_CONSTANT(Name) k##Name,
@@ -159,80 +270,484 @@ constexpr std::underlying_type_t<Opcode> OpcodeIndex(Opcode x) {
   return static_cast<std::underlying_type_t<Opcode>>(x);
 }
 
+template <class Op>
+struct operation_to_opcode_map {};
+
+#define FORWARD_DECLARE(Name) struct Name##Op;
+TURBOSHAFT_OPERATION_LIST(FORWARD_DECLARE)
+#undef FORWARD_DECLARE
+
+#define OPERATION_OPCODE_MAP_CASE(Name)    \
+  template <>                              \
+  struct operation_to_opcode_map<Name##Op> \
+      : std::integral_constant<Opcode, Opcode::k##Name> {};
+TURBOSHAFT_OPERATION_LIST(OPERATION_OPCODE_MAP_CASE)
+#undef OPERATION_OPCODE_MAP_CASE
+
+template <typename Op, uint64_t Mask, uint64_t Value>
+struct OpMaskT {
+  using operation = Op;
+  static constexpr uint64_t mask = Mask;
+  static constexpr uint64_t value = Value;
+};
+
+#define COUNT_OPCODES(Name) +1
+constexpr uint16_t kNumberOfBlockTerminatorOpcodes =
+    0 TURBOSHAFT_OPERATION_LIST_BLOCK_TERMINATOR(COUNT_OPCODES);
+#undef COUNT_OPCODES
+
 #define COUNT_OPCODES(Name) +1
 constexpr uint16_t kNumberOfOpcodes =
     0 TURBOSHAFT_OPERATION_LIST(COUNT_OPCODES);
 #undef COUNT_OPCODES
 
-struct OpProperties {
-  // The operation may read memory or depend on other information beyond its
-  // inputs. Generating random numbers or nondeterministic behavior counts as
-  // reading.
-  const bool can_read;
-  // The operation may write memory or have other observable side-effects.
-  // Writing to memory allocated as part of the operation does not count, since
-  // it is not observable.
-  const bool can_write;
-  // The operation can allocate memory on the heap, which might also trigger GC.
-  const bool can_allocate;
-  // The operation can abort the current execution by throwing an exception or
-  // deoptimizing.
-  const bool can_abort;
-  // The last operation in a basic block.
-  const bool is_block_terminator;
-  // By being const and not being set in the constructor, these properties are
-  // guaranteed to be derived.
-  const bool is_pure_no_allocation = !(can_read || can_write || can_allocate ||
-                                       can_abort || is_block_terminator);
-  const bool is_required_when_unused =
-      can_write || can_abort || is_block_terminator;
-  // Operations that don't read, write, allocate and aren't block terminators
-  // can be eliminated via value numbering, which means that if there are two
-  // identical operations where one dominates the other, then the second can be
-  // replaced with the first one. This is safe for deopting or throwing
-  // operations, because the first instance would have aborted the execution
-  // already as
-  // `!can_read` guarantees deterministic behavior.
-  const bool can_be_eliminated =
-      !(can_read || can_write || can_allocate || is_block_terminator);
-
-  constexpr OpProperties(bool can_read, bool can_write, bool can_allocate,
-                         bool can_abort, bool is_block_terminator)
-      : can_read(can_read),
-        can_write(can_write),
-        can_allocate(can_allocate),
-        can_abort(can_abort),
-        is_block_terminator(is_block_terminator) {}
-
-#define ALL_OP_PROPERTIES(V)                                        \
-  V(PureNoAllocation, false, false, false, false, false)            \
-  V(PureMayAllocate, false, false, true, false, false)              \
-  V(Reading, true, false, false, false, false)                      \
-  V(Writing, false, true, false, false, false)                      \
-  V(CanAbort, false, false, false, true, false)                     \
-  V(AnySideEffects, true, true, true, true, false)                  \
-  V(BlockTerminator, false, false, false, false, true)              \
-  V(BlockTerminatorWithAnySideEffect, true, true, true, true, true) \
-  V(ReadingAndCanAbort, true, false, false, true, false)            \
-  V(WritingAndCanAbort, false, true, false, true, false)
-
-#define DEFINE_OP_PROPERTY(Name, can_read, can_write, can_allocate, can_abort, \
-                           is_block_terminator)                                \
-  static constexpr OpProperties Name() {                                       \
-    return {can_read, can_write, can_allocate, can_abort,                      \
-            is_block_terminator};                                              \
-  }
-
-  ALL_OP_PROPERTIES(DEFINE_OP_PROPERTY)
-#undef DEFINE_OP_PROPERTY
-
-  bool operator==(const OpProperties& other) const {
-    return can_read == other.can_read && can_write == other.can_write &&
-           can_abort == other.can_abort &&
-           is_block_terminator == other.is_block_terminator;
-  }
-};
-std::ostream& operator<<(std::ostream& os, OpProperties opProperties);
+inline constexpr bool IsBlockTerminator(Opcode opcode) {
+  return OpcodeIndex(opcode) < kNumberOfBlockTerminatorOpcodes;
+}
+
+// This list repeats the operations that may throw and need to be followed by
+// `DidntThrow`.
+#define TURBOSHAFT_THROWING_OPERATIONS_LIST(V) V(Call)
+
+// Operations that need to be followed by `DidntThrowOp`.
+inline constexpr bool MayThrow(Opcode opcode) {
+#define CASE(Name) case Opcode::k##Name:
+  switch (opcode) {
+    TURBOSHAFT_THROWING_OPERATIONS_LIST(CASE)
+    return true;
+    default:
+      return false;
+  }
+#undef CASE
+}
+
+#define FIELD(op, field_name)                                       \
+  OpMaskField<UnwrapRepresentation<decltype(op::field_name)>::type, \
+              OFFSET_OF(op, field_name)>
+
+template <typename T>
+inline base::Vector<T> InitVectorOf(
+    ZoneVector<T>& storage,
+    std::initializer_list<RegisterRepresentation> values) {
+  storage.resize(values.size());
+  size_t i = 0;
+  for (auto&& value : values) {
+    storage[i++] = value;
+  }
+  return base::VectorOf(storage);
+}
+
+class InputsRepFactory {
+ public:
+  constexpr static base::Vector<const MaybeRegisterRepresentation> SingleRep(
+      RegisterRepresentation rep) {
+    return base::VectorOf(ToMaybeRepPointer(rep), 1);
+  }
+
+  constexpr static base::Vector<const MaybeRegisterRepresentation> PairOf(
+      RegisterRepresentation rep) {
+    return base::VectorOf(ToMaybeRepPointer(rep), 2);
+  }
+
+ protected:
+  constexpr static const MaybeRegisterRepresentation* ToMaybeRepPointer(
+      RegisterRepresentation rep) {
+    size_t index = static_cast<size_t>(rep.value()) * 2;
+    DCHECK_LT(index, arraysize(rep_map));
+    return &rep_map[index];
+  }
+
+ private:
+  constexpr static MaybeRegisterRepresentation rep_map[] = {
+      MaybeRegisterRepresentation::Word32(),
+      MaybeRegisterRepresentation::Word32(),
+      MaybeRegisterRepresentation::Word64(),
+      MaybeRegisterRepresentation::Word64(),
+      MaybeRegisterRepresentation::Float32(),
+      MaybeRegisterRepresentation::Float32(),
+      MaybeRegisterRepresentation::Float64(),
+      MaybeRegisterRepresentation::Float64(),
+      MaybeRegisterRepresentation::Tagged(),
+      MaybeRegisterRepresentation::Tagged(),
+      MaybeRegisterRepresentation::Compressed(),
+      MaybeRegisterRepresentation::Compressed(),
+      MaybeRegisterRepresentation::Simd128(),
+      MaybeRegisterRepresentation::Simd128(),
+  };
+};
+
+struct EffectDimensions {
+  // Produced by loads, consumed by operations that should not move before loads
+  // because they change memory.
+  bool load_heap_memory : 1;
+  bool load_off_heap_memory : 1;
+
+  // Produced by stores, consumed by operations that should not move before
+  // stores because they load or store memory.
+  bool store_heap_memory : 1;
+  bool store_off_heap_memory : 1;
+
+  // Operations that perform raw heap access (like initialization) consume
+  // `before_raw_heap_access` and produce `after_raw_heap_access`.
+  // Operations that need the heap to be in a consistent state produce
+  // `before_raw_heap_access` and consume `after_raw_heap_access`.
+  bool before_raw_heap_access : 1;
+  // Produced by operations that access raw/untagged pointers into the
+  // heap or keep such a pointer alive, consumed by operations that can GC to
+  // ensure they don't move before the raw access.
+  bool after_raw_heap_access : 1;
+
+  // Produced by any operation that can affect whether subsequent operations are
+  // executed, for example by branching, deopting, throwing or aborting.
+  // Consumed by all operations that should not be hoisted before a check
+  // because they rely on it. For example, loads usually rely on the shape of
+  // the heap object or the index being in bounds.
+  bool control_flow : 1;
+  // We need to ensure that the padding bits have a specified value, as they are
+  // observable in bitwise operations.
+  uint8_t unused_padding : 1;
+
+  using Bits = uint8_t;
+  constexpr EffectDimensions()
+      : load_heap_memory(false),
+        load_off_heap_memory(false),
+        store_heap_memory(false),
+        store_off_heap_memory(false),
+        before_raw_heap_access(false),
+        after_raw_heap_access(false),
+        control_flow(false),
+        unused_padding(0) {}
+  Bits bits() const { return base::bit_cast<Bits>(*this); }
+  static EffectDimensions FromBits(Bits bits) {
+    return base::bit_cast<EffectDimensions>(bits);
+  }
+  bool operator==(EffectDimensions other) const {
+    return bits() == other.bits();
+  }
+  bool operator!=(EffectDimensions other) const {
+    return bits() != other.bits();
+  }
+};
+static_assert(sizeof(EffectDimensions) == sizeof(EffectDimensions::Bits));
+
+// Possible reorderings are restricted using two bit vectors: `produces` and
+// `consumes`. Two operations cannot be reordered if the first operation
+// produces an effect dimension that the second operation consumes. This is not
+// necessarily symmetric. For example, it is possible to reorder
+//     Load(x)
+//     CheckMaps(y)
+// to become
+//     CheckMaps(x)
+//     Load(y)
+// because the load cannot affect the map check. But the other direction could
+// be unsound, if the load depends on the map check having been executed. The
+// former reordering is useful to push a load across a check into a branch if
+// it is only needed there. The effect system expresses this by having the map
+// check produce `EffectDimensions::control_flow` and the load consuming
+// `EffectDimensions::control_flow`. If the producing operation comes before the
+// consuming operation, then this order has to be preserved. But if the
+// consuming operation comes first, then we are free to reorder them. Operations
+// that produce and consume the same effect dimension always have a fixed order
+// among themselves. For example, stores produce and consume the store
+// dimensions. It is possible for operations to be reorderable unless certain
+// other operations appear in-between. This way, the IR can be generous with
+// reorderings as long as all operations are high-level, but become more
+// restrictive as soon as low-level operations appear. For example, allocations
+// can be freely reordered. Tagged bitcasts can be reordered with other tagged
+// bitcasts. But a tagged bitcast cannot be reordered with allocations, as this
+// would mean that an untagged pointer can be alive while a GC is happening. The
+// way this works is that allocations produce the `before_raw_heap_access`
+// dimension and consume the `after_raw_heap_access` dimension to stay either
+// before or after a raw heap access. This means that there are no ordering
+// constraints between allocations themselves. Bitcasts should not
+// be moved accross an allocation. We treat them as raw heap access by letting
+// them consume `before_raw_heap_access` and produce `after_raw_heap_access`.
+// This way, allocations cannot be moved across bitcasts. Similarily,
+// initializing stores and uninitialized allocations are classified as raw heap
+// access, to prevent any operation that relies on a consistent heap state to be
+// scheduled in the middle of an inline allocation. As long as we didn't lower
+// to raw heap accesses yet, pure allocating operations or operations reading
+// immutable memory can float freely. As soon as there are raw heap accesses,
+// they become more restricted in their movement. Note that calls are not the
+// most side-effectful operations, as they do not leave the heap in an
+// inconsistent state, so they do not need to be marked as raw heap access.
+struct OpEffects {
+  EffectDimensions produces;
+  EffectDimensions consumes;
+
+  // Operations that cannot be merged because they produce identity.  That is,
+  // every repetition can produce a different result, but the order in which
+  // they are executed does not matter. All we care about is that they are
+  // different. Producing a random number or allocating an object with
+  // observable pointer equality are examples. Producing identity doesn't
+  // restrict reordering in straight-line code, but we must prevent using GVN or
+  // moving identity-producing operations in- or out of loops.
+  bool can_create_identity : 1;
+  // If the operation can allocate and therefore can trigger GC.
+  bool can_allocate : 1;
+  // Instructions that have no uses but are `required_when_unused` should not be
+  // removed.
+  bool required_when_unused : 1;
+  // We need to ensure that the padding bits have a specified value, as they are
+  // observable in bitwise operations.  This is split into two fields so that
+  // also MSVC creates the correct object layout.
+  uint8_t unused_padding_1 : 5;
+  uint8_t unused_padding_2;
+
+  constexpr OpEffects()
+      : can_create_identity(false),
+        can_allocate(false),
+        required_when_unused(false),
+        unused_padding_1(0),
+        unused_padding_2(0) {}
+
+  using Bits = uint32_t;
+  Bits bits() const { return base::bit_cast<Bits>(*this); }
+  static OpEffects FromBits(Bits bits) {
+    return base::bit_cast<OpEffects>(bits);
+  }
+
+  bool operator==(OpEffects other) const { return bits() == other.bits(); }
+  bool operator!=(OpEffects other) const { return bits() != other.bits(); }
+  OpEffects operator|(OpEffects other) const {
+    return FromBits(bits() | other.bits());
+  }
+  OpEffects operator&(OpEffects other) const {
+    return FromBits(bits() & other.bits());
+  }
+  bool IsSubsetOf(OpEffects other) const {
+    return (bits() & ~other.bits()) == 0;
+  }
+
+  constexpr OpEffects AssumesConsistentHeap() const {
+    OpEffects result = *this;
+    // Do not move the operation into a region with raw heap access.
+    result.produces.before_raw_heap_access = true;
+    result.consumes.after_raw_heap_access = true;
+    return result;
+  }
+  // Like `CanAllocate()`, but allocated values must be immutable and not have
+  // identity (for example `HeapNumber`).
+  // Note that if we first allocate something as mutable and later make it
+  // immutable, we have to allocate it with identity.
+  constexpr OpEffects CanAllocateWithoutIdentity() const {
+    OpEffects result = AssumesConsistentHeap();
+    result.can_allocate = true;
+    return result;
+  }
+  // Allocations change the GC state and can trigger GC, as well as produce a
+  // fresh identity.
+  constexpr OpEffects CanAllocate() const {
+    return CanAllocateWithoutIdentity().CanCreateIdentity();
+  }
+  // The operation can leave the heap in an incosistent state or have untagged
+  // pointers into the heap as input or output.
+  constexpr OpEffects CanDoRawHeapAccess() const {
+    OpEffects result = *this;
+    // Do not move any operation that relies on a consistent heap state accross.
+    result.produces.after_raw_heap_access = true;
+    result.consumes.before_raw_heap_access = true;
+    return result;
+  }
+  // Reading mutable heap memory. Reading immutable memory doesn't count.
+  constexpr OpEffects CanReadHeapMemory() const {
+    OpEffects result = *this;
+    result.produces.load_heap_memory = true;
+    // Do not reorder before stores.
+    result.consumes.store_heap_memory = true;
+    return result;
+  }
+  // Reading mutable off-heap memory or other input. Reading immutable memory
+  // doesn't count.
+  constexpr OpEffects CanReadOffHeapMemory() const {
+    OpEffects result = *this;
+    result.produces.load_off_heap_memory = true;
+    // Do not reorder before stores.
+    result.consumes.store_off_heap_memory = true;
+    return result;
+  }
+  // Writing any off-memory or other output.
+  constexpr OpEffects CanWriteOffHeapMemory() const {
+    OpEffects result = *this;
+    result.required_when_unused = true;
+    result.produces.store_off_heap_memory = true;
+    // Do not reorder before stores.
+    result.consumes.store_off_heap_memory = true;
+    // Do not reorder before loads.
+    result.consumes.load_off_heap_memory = true;
+    // Do not move before deopting or aborting operations.
+    result.consumes.control_flow = true;
+    return result;
+  }
+  // Writing heap memory that existed before the operation started. Initializing
+  // newly allocated memory doesn't count.
+  constexpr OpEffects CanWriteHeapMemory() const {
+    OpEffects result = *this;
+    result.required_when_unused = true;
+    result.produces.store_heap_memory = true;
+    // Do not reorder before stores.
+    result.consumes.store_heap_memory = true;
+    // Do not reorder before loads.
+    result.consumes.load_heap_memory = true;
+    // Do not move before deopting or aborting operations.
+    result.consumes.control_flow = true;
+    return result;
+  }
+  // Writing any memory or other output, on- or off-heap.
+  constexpr OpEffects CanWriteMemory() const {
+    return CanWriteHeapMemory().CanWriteOffHeapMemory();
+  }
+  // Reading any memory or other input, on- or off-heap.
+  constexpr OpEffects CanReadMemory() const {
+    return CanReadHeapMemory().CanReadOffHeapMemory();
+  }
+  // The operation might read immutable data from the heap, so it can be freely
+  // reordered with operations that keep the heap in a consistent state. But we
+  // must prevent the operation from observing an incompletely initialized
+  // object.
+  constexpr OpEffects CanReadImmutableMemory() const {
+    OpEffects result = AssumesConsistentHeap();
+    return result;
+  }
+  // Partial operations that are only safe to execute after we performed certain
+  // checks, for example loads may only be safe after a corresponding bound or
+  // map checks.
+  constexpr OpEffects CanDependOnChecks() const {
+    OpEffects result = *this;
+    result.consumes.control_flow = true;
+    return result;
+  }
+  // The operation can affect control flow (like branch, deopt, throw or crash).
+  constexpr OpEffects CanChangeControlFlow() const {
+    OpEffects result = *this;
+    result.required_when_unused = true;
+    // Signal that this changes control flow. Prevents stores or operations
+    // relying on checks from flowing before this operation.
+    result.produces.control_flow = true;
+    // Stores must not flow past something that affects control flow.
+    result.consumes.store_heap_memory = true;
+    result.consumes.store_off_heap_memory = true;
+    return result;
+  }
+  // Execution of the current function may end with this operation, for example
+  // because of return, deopt, exception throw or abort/trap.
+  constexpr OpEffects CanLeaveCurrentFunction() const {
+    // All memory becomes observable.
+    return CanChangeControlFlow().CanReadMemory().RequiredWhenUnused();
+  }
+  // The operation can deopt.
+  constexpr OpEffects CanDeopt() const {
+    return CanLeaveCurrentFunction()
+        // We might depend on previous checks to avoid deopting.
+        .CanDependOnChecks();
+  }
+  // Producing identity doesn't prevent reorderings, but it prevents GVN from
+  // de-duplicating identical operations.
+  constexpr OpEffects CanCreateIdentity() const {
+    OpEffects result = *this;
+    result.can_create_identity = true;
+    return result;
+  }
+  // The set of all possible effects.
+  constexpr OpEffects CanCallAnything() const {
+    return CanReadMemory()
+        .CanWriteMemory()
+        .CanAllocate()
+        .CanChangeControlFlow()
+        .CanDependOnChecks()
+        .RequiredWhenUnused();
+  }
+  constexpr OpEffects RequiredWhenUnused() const {
+    OpEffects result = *this;
+    result.required_when_unused = true;
+    return result;
+  }
+
+  // Operations that can be removed if their result is not used. Unused
+  // allocations can be removed.
+  constexpr bool is_required_when_unused() const {
+    return required_when_unused;
+  }
+  // Operations that can be moved before a preceding branch or check.
+  bool hoistable_before_a_branch() const {
+    // Since this excludes `CanDependOnChecks()`, most loads actually cannot be
+    // hoisted.
+    return IsSubsetOf(OpEffects().CanReadMemory());
+  }
+  // Operations that can be eliminated via value numbering, which means that if
+  // there are two identical operations where one dominates the other, then the
+  // second can be replaced with the first one. This is safe for deopting or
+  // throwing operations, because the absence of read effects guarantees
+  // deterministic behavior.
+  bool repetition_is_eliminatable() const {
+    return IsSubsetOf(OpEffects()
+                          .CanDependOnChecks()
+                          .CanChangeControlFlow()
+                          .CanAllocateWithoutIdentity());
+  }
+  bool can_read_mutable_memory() const {
+    return produces.load_heap_memory | produces.load_off_heap_memory;
+  }
+  bool requires_consistent_heap() const {
+    return produces.before_raw_heap_access | consumes.after_raw_heap_access;
+  }
+  bool can_write() const {
+    return produces.store_heap_memory | produces.store_off_heap_memory;
+  }
+};
+static_assert(sizeof(OpEffects) == sizeof(OpEffects::Bits));
+
+inline bool CannotSwapOperations(OpEffects first, OpEffects second) {
+  return first.produces.bits() & (second.consumes.bits());
+}
+
+std::ostream& operator<<(std::ostream& os, OpEffects op_effects);
+
+// SaturatedUint8 is a wrapper around a uint8_t, which can be incremented and
+// decremented with the `Incr` and `Decr` methods. These methods prevent over-
+// and underflow, and saturate once the uint8_t reaches the maximum (255):
+// future increment and decrement will not change the value then.
+// We purposefuly do not expose the uint8_t directly, so that users go through
+// Incr/Decr/SetToZero/SetToOne to manipulate it, so that the saturation and
+// lack of over/underflow is always respected.
+class SaturatedUint8 {
+ public:
+  void Incr() {
+    if (V8_LIKELY(val != kMax)) {
+      val++;
+    }
+  }
+  void Decr() {
+    if (V8_LIKELY(val != 0 && val != kMax)) {
+      val--;
+    }
+  }
+
+  void SetToZero() { val = 0; }
+  void SetToOne() { val = 1; }
+
+  bool IsZero() const { return val == 0; }
+  bool IsOne() const { return val == 1; }
+  bool IsSaturated() const { return val == kMax; }
+  uint8_t Get() const { return val; }
+
+ private:
+  uint8_t val = 0;
+  static constexpr uint8_t kMax = std::numeric_limits<uint8_t>::max();
+};
+
+// underlying_operation<> is used to extract the operation type from OpMaskT
+// classes used in Operation::Is<> and Operation::TryCast<>.
+template <typename T>
+struct underlying_operation {
+  using type = T;
+};
+template <typename T, uint64_t M, uint64_t V>
+struct underlying_operation<OpMaskT<T, M, V>> {
+  using type = T;
+};
+template <typename T>
+using underlying_operation_t = typename underlying_operation<T>::type;
 
 // Baseclass for all Turboshaft operations.
 // The `alignas(OpIndex)` is necessary because it is followed by an array of
@@ -246,9 +761,7 @@ struct alignas(OpIndex) Operation {
   // We use such a small type to save memory and because nodes with a high
   // number of uses are rare. Additionally, we usually only care if the number
   // of uses is 0, 1 or bigger than 1.
-  uint8_t saturated_use_count = 0;
-  static constexpr uint8_t kUnknownUseCount =
-      std::numeric_limits<uint8_t>::max();
+  SaturatedUint8 saturated_use_count;
 
   const uint16_t input_count;
 
@@ -263,32 +776,54 @@ struct alignas(OpIndex) Operation {
   }
 
   base::Vector<const RegisterRepresentation> outputs_rep() const;
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const;
 
   template <class Op>
   bool Is() const {
-    return opcode == Op::opcode;
+    if constexpr (std::is_base_of_v<Operation, Op>) {
+      return opcode == Op::opcode;
+    } else {
+      // Otherwise this must be OpMaskT.
+      static_assert(
+          std::is_same_v<underlying_operation_t<Op>,
+                         typename OpMaskT<typename Op::operation, Op::mask,
+                                          Op::value>::operation>);
+      // We check with the given mask.
+      uint64_t b;
+      memcpy(&b, this, sizeof(uint64_t));
+      b &= Op::mask;
+      return b == Op::value;
+    }
   }
   template <class Op>
-  Op& Cast() {
+  underlying_operation_t<Op>& Cast() {
     DCHECK(Is<Op>());
-    return *static_cast<Op*>(this);
+    return *static_cast<underlying_operation_t<Op>*>(this);
   }
   template <class Op>
-  const Op& Cast() const {
+  const underlying_operation_t<Op>& Cast() const {
     DCHECK(Is<Op>());
-    return *static_cast<const Op*>(this);
+    return *static_cast<const underlying_operation_t<Op>*>(this);
   }
   template <class Op>
-  const Op* TryCast() const {
+  const underlying_operation_t<Op>* TryCast() const {
     if (!Is<Op>()) return nullptr;
-    return static_cast<const Op*>(this);
+    return static_cast<const underlying_operation_t<Op>*>(this);
   }
   template <class Op>
-  Op* TryCast() {
+  underlying_operation_t<Op>* TryCast() {
     if (!Is<Op>()) return nullptr;
-    return static_cast<Op*>(this);
+    return static_cast<underlying_operation_t<Op>*>(this);
+  }
+  OpEffects Effects() const;
+  bool IsBlockTerminator() const {
+    return turboshaft::IsBlockTerminator(opcode);
+  }
+  bool IsRequiredWhenUnused() const {
+    DCHECK_IMPLIES(IsBlockTerminator(), Effects().is_required_when_unused());
+    return Effects().is_required_when_unused();
   }
-  OpProperties Properties() const;
 
   std::string ToString() const;
   void PrintInputs(std::ostream& os, const std::string& op_index_prefix) const;
@@ -318,17 +853,93 @@ inline std::ostream& operator<<(std::ostream& os, const Operation& op) {
 }
 void Print(const Operation& op);
 
+Zone* get_zone(Graph* graph);
+
 OperationStorageSlot* AllocateOpStorage(Graph* graph, size_t slot_count);
 const Operation& Get(const Graph& graph, OpIndex index);
 
-// Determine if an operation declares `properties`, which means that its
-// properties are static and don't depend on inputs or options.
+// Determine if an operation declares `effects`, which means that its
+// effects are static and don't depend on inputs or options.
 template <class Op, class = void>
-struct HasStaticProperties : std::bool_constant<false> {};
+struct HasStaticEffects : std::bool_constant<false> {};
 template <class Op>
-struct HasStaticProperties<Op, std::void_t<decltype(Op::properties)>>
+struct HasStaticEffects<Op, std::void_t<decltype(Op::effects)>>
     : std::bool_constant<true> {};
 
+template <typename T, size_t Offset>
+struct OpMaskField {
+  using type = T;
+  static constexpr size_t offset = Offset;
+  static constexpr size_t size = sizeof(T);
+
+  static_assert(offset + size <= sizeof(uint64_t));
+};
+
+template <typename T>
+constexpr uint64_t encode_for_mask(T value) {
+  return static_cast<uint64_t>(value);
+}
+
+template <typename T>
+struct UnwrapRepresentation {
+  using type = T;
+};
+template <>
+struct UnwrapRepresentation<WordRepresentation> {
+  using type = WordRepresentation::Enum;
+};
+template <>
+struct UnwrapRepresentation<FloatRepresentation> {
+  using type = FloatRepresentation::Enum;
+};
+template <>
+struct UnwrapRepresentation<RegisterRepresentation> {
+  using type = RegisterRepresentation::Enum;
+};
+
+template <typename Op, typename... Fields>
+struct MaskBuilder {
+  static constexpr uint64_t BuildBaseMask() {
+    static_assert(OFFSET_OF(Operation, opcode) == 0);
+    static_assert(sizeof(Operation::opcode) == sizeof(uint8_t));
+    static_assert(sizeof(Operation) == 4);
+    return static_cast<uint64_t>(0xFF);
+  }
+
+  static constexpr uint64_t EncodeBaseValue(Opcode opcode) {
+    static_assert(OFFSET_OF(Operation, opcode) == 0);
+    return static_cast<uint64_t>(opcode);
+  }
+
+  static constexpr uint64_t BuildMask() {
+    constexpr uint64_t base_mask = BuildBaseMask();
+    return (base_mask | ... | BuildFieldMask<Fields>());
+  }
+
+  static constexpr uint64_t EncodeValue(typename Fields::type... args) {
+    constexpr uint64_t base_mask =
+        EncodeBaseValue(operation_to_opcode_map<Op>::value);
+    return (base_mask | ... | EncodeFieldValue<Fields>(args));
+  }
+
+  template <typename F>
+  static constexpr uint64_t BuildFieldMask() {
+    static_assert(F::size < sizeof(uint64_t));
+    static_assert(F::offset + F::size <= sizeof(uint64_t));
+    constexpr uint64_t ones = static_cast<uint64_t>(-1) >>
+                              ((sizeof(uint64_t) - F::size) * kBitsPerByte);
+    return ones << (F::offset * kBitsPerByte);
+  }
+
+  template <typename F>
+  static constexpr uint64_t EncodeFieldValue(typename F::type value) {
+    return encode_for_mask(value) << (F::offset * kBitsPerByte);
+  }
+
+  template <typename Fields::type... Args>
+  using For = OpMaskT<Op, BuildMask(), EncodeValue(Args...)>;
+};
+
 // This template knows the complete type of the operation and is plugged into
 // the inheritance hierarchy. It removes boilerplate from the concrete
 // `Operation` subclasses, defining everything that can be expressed
@@ -341,11 +952,18 @@ struct OperationT : Operation {
 
   static const Opcode opcode;
 
-  static constexpr OpProperties Properties() { return Derived::properties; }
+  static constexpr OpEffects Effects() { return Derived::effects; }
+  static constexpr bool IsBlockTerminator() {
+    return turboshaft::IsBlockTerminator(opcode);
+  }
+  bool IsRequiredWhenUnused() const {
+    return IsBlockTerminator() ||
+           derived_this().Effects().is_required_when_unused();
+  }
 
-  static constexpr base::Optional<OpProperties> PropertiesIfStatic() {
-    if constexpr (HasStaticProperties<Derived>::value) {
-      return Derived::Properties();
+  static constexpr base::Optional<OpEffects> EffectsIfStatic() {
+    if constexpr (HasStaticEffects<Derived>::value) {
+      return Derived::Effects();
     }
     return base::nullopt;
   }
@@ -392,6 +1010,17 @@ struct OperationT : Operation {
     Derived* result = new (ptr) Derived(std::move(args)...);
 #ifdef DEBUG
     result->Validate(*graph);
+    ZoneVector<MaybeRegisterRepresentation> storage(get_zone(graph));
+    base::Vector<const MaybeRegisterRepresentation> expected =
+        result->inputs_rep(storage);
+    // TODO(mliedtke): DCHECK that expected and inputs are of the same size
+    // and adapt inputs_rep() to always emit a representation for all inputs.
+    size_t end = std::min<size_t>(expected.size(), result->input_count);
+    for (size_t i = 0; i < end; ++i) {
+      if (expected[i] == MaybeRegisterRepresentation::None()) continue;
+      DCHECK(ValidOpInputRep(*graph, result->inputs()[i],
+                             RegisterRepresentation(expected[i])));
+    }
 #endif
     // If this DCHECK fails, then the number of inputs specified in the
     // operation constructor and in the static New function disagree.
@@ -417,6 +1046,15 @@ struct OperationT : Operation {
     this->inputs().OverwriteWith(inputs);
   }
 
+  bool EqualsForGVN(const Base& other) const {
+    // By default, GVN only removed identical Operations. However, some
+    // Operations (like DeoptimizeIf) can be GVNed when a dominating
+    // similar-but-not-identical one exists. In that case, the Operation should
+    // redefine EqualsForGVN, so that GVN knows which inputs or options of the
+    // Operation to ignore (you should also probably redefine hash_value,
+    // otherwise GVN won't even try to call EqualsForGVN).
+    return derived_this() == other.derived_this();
+  }
   bool operator==(const Base& other) const {
     return derived_this().inputs() == other.derived_this().inputs() &&
            derived_this().options() == other.derived_this().options();
@@ -474,6 +1112,13 @@ struct OperationT : Operation {
   // forgets to define outputs_rep, then Operation::outputs_rep() tries to call
   // this private version, which fails at compile time.
   base::Vector<const RegisterRepresentation> outputs_rep() const;
+
+  // Returns a vector of the input representations.
+  // The passed in {storage} can be used to store the underlying data.
+  // The returned vector might be smaller than the input_count in which case the
+  // additional inputs are assumed to have no register representation.
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const;
 };
 
 template <size_t InputCount, class Derived>
@@ -546,6 +1191,8 @@ class SupportedOperations {
 
  public:
   static void Initialize();
+  static bool IsUnalignedLoadSupported(MemoryRepresentation repr);
+  static bool IsUnalignedStoreSupported(MemoryRepresentation repr);
   SUPPORTED_OPERATIONS_LIST(DECLARE_GETTER)
 
  private:
@@ -561,8 +1208,15 @@ class SupportedOperations {
 
 template <RegisterRepresentation::Enum... reps>
 base::Vector<const RegisterRepresentation> RepVector() {
-  static const std::array<RegisterRepresentation, sizeof...(reps)> rep_array{
-      RegisterRepresentation{reps}...};
+  static constexpr std::array<RegisterRepresentation, sizeof...(reps)>
+      rep_array{RegisterRepresentation{reps}...};
+  return base::VectorOf(rep_array);
+}
+
+template <MaybeRegisterRepresentation::Enum... reps>
+base::Vector<const MaybeRegisterRepresentation> MaybeRepVector() {
+  static constexpr std::array<MaybeRegisterRepresentation, sizeof...(reps)>
+      rep_array{MaybeRegisterRepresentation{reps}...};
   return base::VectorOf(rep_array);
 }
 
@@ -591,11 +1245,17 @@ struct WordBinopOp : FixedArityOperationT<2, WordBinopOp> {
   Kind kind;
   WordRepresentation rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  // We must avoid division by 0.
+  static constexpr OpEffects effects = OpEffects().CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(static_cast<const RegisterRepresentation*>(&rep), 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::PairOf(rep);
+  }
+
   OpIndex left() const { return input(0); }
   OpIndex right() const { return input(1); }
 
@@ -668,6 +1328,20 @@ struct WordBinopOp : FixedArityOperationT<2, WordBinopOp> {
   void PrintOptions(std::ostream& os) const;
 };
 
+using WordBinopMask =
+    MaskBuilder<WordBinopOp, FIELD(WordBinopOp, kind), FIELD(WordBinopOp, rep)>;
+
+namespace Opmask {
+using kWord32Sub =
+    WordBinopMask::For<WordBinopOp::Kind::kSub, WordRepresentation::Word32()>;
+using kWord32BitwiseAnd = WordBinopMask::For<WordBinopOp::Kind::kBitwiseAnd,
+                                             WordRepresentation::Word32()>;
+using kWord64Sub =
+    WordBinopMask::For<WordBinopOp::Kind::kSub, WordRepresentation::Word64()>;
+using kWord64BitwiseAnd = WordBinopMask::For<WordBinopOp::Kind::kBitwiseAnd,
+                                             WordRepresentation::Word64()>;
+}  // namespace Opmask
+
 struct FloatBinopOp : FixedArityOperationT<2, FloatBinopOp> {
   enum class Kind : uint8_t {
     kAdd,
@@ -683,11 +1357,16 @@ struct FloatBinopOp : FixedArityOperationT<2, FloatBinopOp> {
   Kind kind;
   FloatRepresentation rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(static_cast<const RegisterRepresentation*>(&rep), 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::PairOf(rep);
+  }
+
   OpIndex left() const { return input(0); }
   OpIndex right() const { return input(1); }
 
@@ -720,6 +1399,46 @@ struct FloatBinopOp : FixedArityOperationT<2, FloatBinopOp> {
   void PrintOptions(std::ostream& os) const;
 };
 
+struct Word32PairBinopOp : FixedArityOperationT<4, Word32PairBinopOp> {
+  enum class Kind : uint8_t {
+    kAdd,
+    kSub,
+    kMul,
+    kShiftLeft,
+    kShiftRightArithmetic,
+    kShiftRightLogical,
+  };
+  Kind kind;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Word32(),
+                     RegisterRepresentation::Word32()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      const ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32(),
+                          MaybeRegisterRepresentation::Word32(),
+                          MaybeRegisterRepresentation::Word32(),
+                          MaybeRegisterRepresentation::Word32()>();
+  }
+
+  OpIndex left_low() const { return input(0); }
+  OpIndex left_high() const { return input(1); }
+  OpIndex right_low() const { return input(2); }
+  OpIndex right_high() const { return input(3); }
+
+  Word32PairBinopOp(OpIndex left_low, OpIndex left_high, OpIndex right_low,
+                    OpIndex right_high, Kind kind)
+      : Base(left_low, left_high, right_low, right_high), kind(kind) {}
+
+  void Validate(const Graph& graph) const {}
+  auto options() const { return std::tuple{kind}; }
+  void PrintOptions(std::ostream& os) const;
+};
+
 struct OverflowCheckedBinopOp
     : FixedArityOperationT<2, OverflowCheckedBinopOp> {
   enum class Kind : uint8_t {
@@ -730,7 +1449,7 @@ struct OverflowCheckedBinopOp
   Kind kind;
   WordRepresentation rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     switch (rep.value()) {
       case WordRepresentation::Word32():
@@ -742,6 +1461,11 @@ struct OverflowCheckedBinopOp
     }
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::PairOf(rep);
+  }
+
   OpIndex left() const { return input(0); }
   OpIndex right() const { return input(1); }
 
@@ -778,11 +1502,16 @@ struct WordUnaryOp : FixedArityOperationT<1, WordUnaryOp> {
   };
   Kind kind;
   WordRepresentation rep;
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(static_cast<const RegisterRepresentation*>(&rep), 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(rep);
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   static bool IsSupported(Kind kind, WordRepresentation rep);
@@ -791,7 +1520,6 @@ struct WordUnaryOp : FixedArityOperationT<1, WordUnaryOp> {
       : Base(input), kind(kind), rep(rep) {}
 
   void Validate(const Graph& graph) const {
-    DCHECK(IsSupported(kind, rep));
     DCHECK(ValidOpInputRep(graph, input(), rep));
   }
   auto options() const { return std::tuple{kind, rep}; }
@@ -828,13 +1556,20 @@ struct FloatUnaryOp : FixedArityOperationT<1, FloatUnaryOp> {
     kAtan,
     kAtanh,
   };
+
   Kind kind;
   FloatRepresentation rep;
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(static_cast<const RegisterRepresentation*>(&rep), 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(rep);
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   static bool IsSupported(Kind kind, FloatRepresentation rep);
@@ -843,13 +1578,20 @@ struct FloatUnaryOp : FixedArityOperationT<1, FloatUnaryOp> {
       : Base(input), kind(kind), rep(rep) {}
 
   void Validate(const Graph& graph) const {
-    DCHECK(IsSupported(kind, rep));
     DCHECK(ValidOpInputRep(graph, input(), rep));
   }
   auto options() const { return std::tuple{kind, rep}; }
 };
 std::ostream& operator<<(std::ostream& os, FloatUnaryOp::Kind kind);
 
+using FloatUnaryMask = MaskBuilder<FloatUnaryOp, FIELD(FloatUnaryOp, kind),
+                                   FIELD(FloatUnaryOp, rep)>;
+
+namespace Opmask {
+using kFloat64Abs = FloatUnaryMask::For<FloatUnaryOp::Kind::kAbs,
+                                        FloatRepresentation::Float64()>;
+}
+
 struct ShiftOp : FixedArityOperationT<2, ShiftOp> {
   enum class Kind : uint8_t {
     kShiftRightArithmeticShiftOutZeros,
@@ -862,11 +1604,18 @@ struct ShiftOp : FixedArityOperationT<2, ShiftOp> {
   Kind kind;
   WordRepresentation rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(static_cast<const RegisterRepresentation*>(&rep), 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InitVectorOf(storage,
+                        {static_cast<const RegisterRepresentation&>(rep),
+                         RegisterRepresentation::Word32()});
+  }
+
   OpIndex left() const { return input(0); }
   OpIndex right() const { return input(1); }
 
@@ -911,14 +1660,21 @@ std::ostream& operator<<(std::ostream& os, ShiftOp::Kind kind);
 struct EqualOp : FixedArityOperationT<2, EqualOp> {
   RegisterRepresentation rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Word32()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::PairOf(rep);
+  }
+
   OpIndex left() const { return input(0); }
   OpIndex right() const { return input(1); }
 
+  static bool IsCommutative() { return true; }
+
   bool ValidInputRep(
       base::Vector<const RegisterRepresentation> input_reps) const;
 
@@ -956,11 +1712,16 @@ struct ComparisonOp : FixedArityOperationT<2, ComparisonOp> {
   Kind kind;
   RegisterRepresentation rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Word32()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::PairOf(rep);
+  }
+
   OpIndex left() const { return input(0); }
   OpIndex right() const { return input(1); }
 
@@ -1015,6 +1776,7 @@ struct ComparisonOp : FixedArityOperationT<2, ComparisonOp> {
   }
 };
 std::ostream& operator<<(std::ostream& os, ComparisonOp::Kind kind);
+DEFINE_MULTI_SWITCH_INTEGRAL(ComparisonOp::Kind, 4)
 
 struct ChangeOp : FixedArityOperationT<1, ChangeOp> {
   enum class Kind : uint8_t {
@@ -1036,6 +1798,8 @@ struct ChangeOp : FixedArityOperationT<1, ChangeOp> {
     kZeroExtend,
     // increase bid-width for signed integer values
     kSignExtend,
+    // truncate word64 to word32
+    kTruncate,
     // preserve bits, change meaning
     kBitcast
   };
@@ -1056,6 +1820,10 @@ struct ChangeOp : FixedArityOperationT<1, ChangeOp> {
   RegisterRepresentation from;
   RegisterRepresentation to;
 
+  // Returns true if change<kind>(change<reverse_kind>(a)) == a for all a.
+  // This assumes that change<reverse_kind> uses the inverted {from} and {to}
+  // representations, i.e. the input to the inner change op has the same
+  // representation as the result of the outer change op.
   static bool IsReversible(Kind kind, Assumption assumption,
                            RegisterRepresentation from,
                            RegisterRepresentation to, Kind reverse_kind,
@@ -1099,6 +1867,10 @@ struct ChangeOp : FixedArityOperationT<1, ChangeOp> {
       case Kind::kZeroExtend:
       case Kind::kSignExtend:
         return false;
+      case Kind::kTruncate:
+        DCHECK_EQ(from, RegisterRepresentation::Word64());
+        DCHECK_EQ(to, RegisterRepresentation::Word32());
+        return reverse_kind == Kind::kBitcast;
       case Kind::kBitcast:
         return reverse_kind == Kind::kBitcast;
     }
@@ -1109,11 +1881,16 @@ struct ChangeOp : FixedArityOperationT<1, ChangeOp> {
                         signalling_nan_possible);
   }
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(&to, 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(from);
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   ChangeOp(OpIndex input, Kind kind, Assumption assumption,
@@ -1122,11 +1899,19 @@ struct ChangeOp : FixedArityOperationT<1, ChangeOp> {
 
   void Validate(const Graph& graph) const {
     DCHECK(ValidOpInputRep(graph, input(), from));
+    // Bitcasts from and to Tagged should use a TaggedBitcast instead (which has
+    // different effects, since it's unsafe to reorder such bitcasts accross
+    // GCs).
+    DCHECK_IMPLIES(kind == Kind::kBitcast,
+                   from != RegisterRepresentation::Tagged() &&
+                       to != RegisterRepresentation::Tagged());
   }
   auto options() const { return std::tuple{kind, assumption, from, to}; }
 };
 std::ostream& operator<<(std::ostream& os, ChangeOp::Kind kind);
 std::ostream& operator<<(std::ostream& os, ChangeOp::Assumption assumption);
+DEFINE_MULTI_SWITCH_INTEGRAL(ChangeOp::Kind, 16)
+DEFINE_MULTI_SWITCH_INTEGRAL(ChangeOp::Assumption, 4)
 
 struct ChangeOrDeoptOp : FixedArityOperationT<2, ChangeOrDeoptOp> {
   enum class Kind : uint8_t {
@@ -1136,12 +1921,13 @@ struct ChangeOrDeoptOp : FixedArityOperationT<2, ChangeOrDeoptOp> {
     kUint64ToInt64,
     kFloat64ToInt32,
     kFloat64ToInt64,
+    kFloat64NotHole,
   };
   Kind kind;
   CheckForMinusZeroMode minus_zero_mode;
   FeedbackSource feedback;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects().CanDeopt();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     switch (kind) {
       case Kind::kUint32ToInt32:
@@ -1152,6 +1938,24 @@ struct ChangeOrDeoptOp : FixedArityOperationT<2, ChangeOrDeoptOp> {
       case Kind::kUint64ToInt64:
       case Kind::kFloat64ToInt64:
         return RepVector<RegisterRepresentation::Word64()>();
+      case Kind::kFloat64NotHole:
+        return RepVector<RegisterRepresentation::Float64()>();
+    }
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    switch (kind) {
+      case Kind::kUint32ToInt32:
+        return MaybeRepVector<MaybeRegisterRepresentation::Word32()>();
+      case Kind::kInt64ToInt32:
+      case Kind::kUint64ToInt32:
+      case Kind::kUint64ToInt64:
+        return MaybeRepVector<MaybeRegisterRepresentation::Word64()>();
+      case Kind::kFloat64ToInt32:
+      case Kind::kFloat64ToInt64:
+      case Kind::kFloat64NotHole:
+        return MaybeRepVector<MaybeRegisterRepresentation::Float64()>();
     }
   }
 
@@ -1180,6 +1984,7 @@ struct ChangeOrDeoptOp : FixedArityOperationT<2, ChangeOrDeoptOp> {
         break;
       case Kind::kFloat64ToInt32:
       case Kind::kFloat64ToInt64:
+      case Kind::kFloat64NotHole:
         DCHECK(
             ValidOpInputRep(graph, input(), RegisterRepresentation::Float64()));
         break;
@@ -1204,7 +2009,7 @@ struct TryChangeOp : FixedArityOperationT<1, TryChangeOp> {
   FloatRepresentation from;
   WordRepresentation to;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     switch (to.value()) {
       case WordRepresentation::Word32():
@@ -1216,6 +2021,11 @@ struct TryChangeOp : FixedArityOperationT<1, TryChangeOp> {
     }
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(from);
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   TryChangeOp(OpIndex input, Kind kind, FloatRepresentation from,
@@ -1229,41 +2039,49 @@ struct TryChangeOp : FixedArityOperationT<1, TryChangeOp> {
 };
 std::ostream& operator<<(std::ostream& os, TryChangeOp::Kind kind);
 
-// TODO(tebbi): Unify with other operations.
-struct Float64InsertWord32Op : FixedArityOperationT<2, Float64InsertWord32Op> {
-  enum class Kind { kLowHalf, kHighHalf };
-  Kind kind;
-
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+struct BitcastWord32PairToFloat64Op
+    : FixedArityOperationT<2, BitcastWord32PairToFloat64Op> {
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Float64()>();
   }
 
-  OpIndex float64() const { return input(0); }
-  OpIndex word32() const { return input(1); }
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32(),
+                          MaybeRegisterRepresentation::Word32()>();
+  }
+
+  OpIndex high_word32() const { return input(0); }
+  OpIndex low_word32() const { return input(1); }
 
-  Float64InsertWord32Op(OpIndex float64, OpIndex word32, Kind kind)
-      : Base(float64, word32), kind(kind) {}
+  BitcastWord32PairToFloat64Op(OpIndex high_word32, OpIndex low_word32)
+      : Base(high_word32, low_word32) {}
 
   void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, high_word32(),
+                           RegisterRepresentation::Word32()));
     DCHECK(
-        ValidOpInputRep(graph, float64(), RegisterRepresentation::Float64()));
-    DCHECK(ValidOpInputRep(graph, word32(), RegisterRepresentation::Word32()));
+        ValidOpInputRep(graph, low_word32(), RegisterRepresentation::Word32()));
   }
-  auto options() const { return std::tuple{kind}; }
+  auto options() const { return std::tuple{}; }
 };
-std::ostream& operator<<(std::ostream& os, Float64InsertWord32Op::Kind kind);
 
 struct TaggedBitcastOp : FixedArityOperationT<1, TaggedBitcastOp> {
   RegisterRepresentation from;
   RegisterRepresentation to;
 
   // Due to moving GC, converting from or to pointers doesn't commute with GC.
-  static constexpr OpProperties properties = OpProperties::Reading();
+  static constexpr OpEffects effects = OpEffects().CanDoRawHeapAccess();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(&to, 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(from);
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   TaggedBitcastOp(OpIndex input, RegisterRepresentation from,
@@ -1271,8 +2089,7 @@ struct TaggedBitcastOp : FixedArityOperationT<1, TaggedBitcastOp> {
       : Base(input), from(from), to(to) {}
 
   void Validate(const Graph& graph) const {
-    DCHECK((from == RegisterRepresentation::PointerSized() &&
-            to == RegisterRepresentation::Tagged()) ||
+    DCHECK((from.IsWord() && to == RegisterRepresentation::Tagged()) ||
            (from == RegisterRepresentation::Tagged() &&
             to == RegisterRepresentation::PointerSized()) ||
            (from == RegisterRepresentation::Compressed() &&
@@ -1289,11 +2106,16 @@ struct SelectOp : FixedArityOperationT<3, SelectOp> {
   BranchHint hint;
   Implementation implem;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(&rep, 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InitVectorOf(storage, {RegisterRepresentation::Word32(), rep, rep});
+  }
+
   SelectOp(OpIndex cond, OpIndex vtrue, OpIndex vfalse,
            RegisterRepresentation rep, BranchHint hint, Implementation implem)
       : Base(cond, vtrue, vfalse), rep(rep), hint(hint), implem(implem) {}
@@ -1303,7 +2125,11 @@ struct SelectOp : FixedArityOperationT<3, SelectOp> {
                    (rep == RegisterRepresentation::Word32() &&
                     SupportedOperations::word32_select()) ||
                        (rep == RegisterRepresentation::Word64() &&
-                        SupportedOperations::word64_select()));
+                        SupportedOperations::word64_select()) ||
+                       (rep == RegisterRepresentation::Float32() &&
+                        SupportedOperations::float32_select()) ||
+                       (rep == RegisterRepresentation::Float64() &&
+                        SupportedOperations::float64_select()));
     DCHECK(ValidOpInputRep(graph, cond(), RegisterRepresentation::Word32()));
     DCHECK(ValidOpInputRep(graph, vtrue(), rep));
     DCHECK(ValidOpInputRep(graph, vfalse(), rep));
@@ -1320,11 +2146,23 @@ std::ostream& operator<<(std::ostream& os, SelectOp::Implementation kind);
 struct PhiOp : OperationT<PhiOp> {
   RegisterRepresentation rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  // Phis have to remain at the beginning of the current block. As effects
+  // cannot express this completely, we just mark them as having no effects but
+  // treat them specially when scheduling operations.
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(&rep, 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    storage.resize(input_count);
+    for (size_t i = 0; i < input_count; ++i) {
+      storage[i] = rep;
+    }
+    return base::VectorOf(storage);
+  }
+
   static constexpr size_t kLoopPhiBackEdgeIndex = 1;
 
   explicit PhiOp(base::Vector<const OpIndex> inputs, RegisterRepresentation rep)
@@ -1340,46 +2178,30 @@ struct PhiOp : OperationT<PhiOp> {
   auto options() const { return std::tuple{rep}; }
 };
 
-// Only used when moving a loop phi to a new graph while the loop backedge has
-// not been emitted yet.
+// Used as a placeholder for a loop-phi while building the graph, replaced with
+// a normal `PhiOp` before graph building is over, so it should never appear in
+// a complete graph.
 struct PendingLoopPhiOp : FixedArityOperationT<1, PendingLoopPhiOp> {
-  struct PhiIndex {
-    int index;
-  };
-  struct Data {
-    union {
-      // Used when transforming a Turboshaft graph.
-      // This is not an input because it refers to the old graph.
-      OpIndex old_backedge_index = OpIndex::Invalid();
-      // Used when translating from sea-of-nodes.
-      Node* old_backedge_node;
-      // Used when building loops with the assembler macros.
-      PhiIndex phi_index;
-    };
-    explicit Data(OpIndex old_backedge_index)
-        : old_backedge_index(old_backedge_index) {}
-    explicit Data(Node* old_backedge_node)
-        : old_backedge_node(old_backedge_node) {}
-    explicit Data(PhiIndex phi_index) : phi_index(phi_index) {}
-  };
   RegisterRepresentation rep;
-  Data data;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(&rep, 1);
   }
 
-  OpIndex first() const { return input(0); }
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(rep);
+  }
 
-  PendingLoopPhiOp(OpIndex first, RegisterRepresentation rep, Data data)
-      : Base(first), rep(rep), data(data) {}
+  OpIndex first() const { return input(0); }
+  PendingLoopPhiOp(OpIndex first, RegisterRepresentation rep)
+      : Base(first), rep(rep) {}
 
   void Validate(const Graph& graph) const {
     DCHECK(ValidOpInputRep(graph, first(), rep));
   }
-  std::tuple<> options() const { UNREACHABLE(); }
-  void PrintOptions(std::ostream& os) const;
+  auto options() const { return std::tuple{rep}; }
 };
 
 struct ConstantOp : FixedArityOperationT<0, ConstantOp> {
@@ -1411,13 +2233,24 @@ struct ConstantOp : FixedArityOperationT<0, ConstantOp> {
     Storage(float constant) : float32(constant) {}
     Storage(ExternalReference constant) : external(constant) {}
     Storage(Handle<HeapObject> constant) : handle(constant) {}
+
+    inline bool operator==(const ConstantOp::Storage&) const {
+      // It is tricky to implement this properly. We currently need to define
+      // this for the matchers, but this should never be called.
+      UNREACHABLE();
+    }
   } storage;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(&rep, 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   static RegisterRepresentation Representation(Kind kind) {
     switch (kind) {
       case Kind::kWord32:
@@ -1615,6 +2448,13 @@ struct ConstantOp : FixedArityOperationT<0, ConstantOp> {
   }
 };
 
+using ConstantMask = MaskBuilder<ConstantOp, FIELD(ConstantOp, kind)>;
+
+namespace Opmask {
+using kWord32Constant = ConstantMask::For<ConstantOp::Kind::kWord32>;
+using kWord64Constant = ConstantMask::For<ConstantOp::Kind::kWord64>;
+}  // namespace Opmask
+
 // Load `loaded_rep` from: base + offset + index * 2^element_size_log2.
 // For Kind::tagged_base: subtract kHeapObjectTag,
 //                        `base` has to be the object start.
@@ -1629,6 +2469,35 @@ struct LoadOp : OperationT<LoadOp> {
     bool maybe_unaligned : 1;
     // There is a Wasm trap handler for out-of-bounds accesses.
     bool with_trap_handler : 1;
+    // If {always_canonically_accessed} is true, then:
+    //   - Stores/Loads at this address cannot overlap. Concretely, it means
+    //     that something like this cannot happen:
+    //
+    //         const u32s = Uint32Array.of(3, 8);
+    //         const u8s = new Uint8Array(u32s.buffer);
+    //         u32s[0] = 0xffffffff;
+    //         u8s[1] = 0; // Overlaps with previous store!
+    //
+    //   - Stores/Loads at this address have a canonical base. Concretely, it
+    //     means that something like this cannot happen:
+    //
+    //         let buffer = new ArrayBuffer(10000);
+    //         let ta1 = new Int32Array(buffer, 0/*offset*/);
+    //         let ta2 = new Int32Array(buffer, 100*4/*offset*/);
+    //         ta2[0] = 0xff;
+    //         ta1[100] = 42; // Same destination as the previous store!
+    //
+    // This is mainly used for load elimination: when stores/loads don't have
+    // the {always_canonically_accessed} bit set to true, more things need
+    // to be invalidated.
+    // In the main JS pipeline, only ArrayBuffers (= TypedArray/DataView)
+    // loads/stores have this {always_canonically_accessed} set to false,
+    // and all other loads have it to true.
+    bool always_canonically_accessed : 1;
+    // The loaded value may not change.
+    bool is_immutable : 1;
+    // The load should be atomic.
+    bool is_atomic : 1;
 
     static constexpr Kind Aligned(BaseTaggedness base_is_tagged) {
       switch (base_is_tagged) {
@@ -1638,15 +2507,48 @@ struct LoadOp : OperationT<LoadOp> {
           return RawAligned();
       }
     }
-    static constexpr Kind TaggedBase() { return Kind{true, false, false}; }
-    static constexpr Kind RawAligned() { return Kind{false, false, false}; }
-    static constexpr Kind RawUnaligned() { return Kind{false, true, false}; }
-    static constexpr Kind Protected() { return Kind{false, false, true}; }
+
+    // TODO(dmercadier): use designed initializers once we move to C++20.
+    static constexpr Kind TaggedBase() {
+      return {true, false, false, true, false, false};
+    }
+    static constexpr Kind RawAligned() {
+      return {false, false, false, true, false, false};
+    }
+    static constexpr Kind RawUnaligned() {
+      return {false, true, false, true, false, false};
+    }
+    static constexpr Kind Protected() {
+      return {false, false, true, true, false, false};
+    }
+    static constexpr Kind TrapOnNull() {
+      return {true, false, true, true, false, false};
+    }
+
+    constexpr Kind NotAlwaysCanonicallyAccessed() {
+      Kind kind = *this;
+      kind.always_canonically_accessed = false;
+      return kind;
+    }
+
+    constexpr Kind Immutable() const {
+      Kind kind(*this);
+      kind.is_immutable = true;
+      return kind;
+    }
+
+    constexpr Kind Atomic() const {
+      Kind kind(*this);
+      kind.is_atomic = true;
+      return kind;
+    }
 
     bool operator==(const Kind& other) const {
       return tagged_base == other.tagged_base &&
              maybe_unaligned == other.maybe_unaligned &&
-             with_trap_handler == other.with_trap_handler;
+             with_trap_handler == other.with_trap_handler &&
+             always_canonically_accessed == other.always_canonically_accessed &&
+             is_immutable == other.is_immutable && is_atomic == other.is_atomic;
     }
   };
   Kind kind;
@@ -1655,14 +2557,33 @@ struct LoadOp : OperationT<LoadOp> {
   uint8_t element_size_log2;  // multiply index with 2^element_size_log2
   int32_t offset;             // add offset to scaled index
 
-  OpProperties Properties() const {
-    return kind.with_trap_handler ? OpProperties::ReadingAndCanAbort()
-                                  : OpProperties::Reading();
+  OpEffects Effects() const {
+    // Loads might depend on checks for pointer validity, object layout, bounds
+    // checks, etc.
+    // TODO(tebbi): Distinguish between on-heap and off-heap loads.
+    OpEffects effects = OpEffects().CanReadMemory().CanDependOnChecks();
+    if (kind.with_trap_handler) effects = effects.CanLeaveCurrentFunction();
+    if (kind.is_atomic) {
+      // Atomic load should not be reordered with other loads.
+      effects = effects.CanWriteMemory();
+    }
+    return effects;
   }
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(&result_rep, 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    base::Vector<const MaybeRegisterRepresentation> result =
+        kind.tagged_base
+            ? MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                             MaybeRegisterRepresentation::PointerSized()>()
+            : MaybeRepVector<MaybeRegisterRepresentation::PointerSized(),
+                             MaybeRegisterRepresentation::PointerSized()>();
+    return index().valid() ? result : base::VectorOf(result.data(), 1);
+  }
+
   OpIndex base() const { return input(0); }
   OpIndex index() const {
     return input_count == 2 ? input(1) : OpIndex::Invalid();
@@ -1686,7 +2607,8 @@ struct LoadOp : OperationT<LoadOp> {
   void Validate(const Graph& graph) const {
     DCHECK(loaded_rep.ToRegisterRepresentation() == result_rep ||
            (loaded_rep.IsTagged() &&
-            result_rep == RegisterRepresentation::Compressed()));
+            result_rep == RegisterRepresentation::Compressed()) ||
+           kind.is_atomic);
     DCHECK_IMPLIES(element_size_log2 > 0, index().valid());
     DCHECK(
         kind.tagged_base
@@ -1714,28 +2636,295 @@ struct LoadOp : OperationT<LoadOp> {
 };
 
 V8_INLINE size_t hash_value(LoadOp::Kind kind) {
-  return base::hash_value(static_cast<int>(kind.tagged_base) |
-                          (kind.maybe_unaligned << 1) |
-                          (kind.with_trap_handler << 2));
+  return base::hash_value(
+      static_cast<int>(kind.tagged_base) | (kind.maybe_unaligned << 1) |
+      (kind.always_canonically_accessed << 2) | (kind.is_immutable << 3) |
+      (kind.with_trap_handler << 4) | (kind.is_atomic << 5));
 }
 
-// Store `value` to: base + offset + index * 2^element_size_log2.
-// For Kind::tagged_base: subtract kHeapObjectTag,
-//                        `base` has to be the object start.
-struct StoreOp : OperationT<StoreOp> {
-  using Kind = LoadOp::Kind;
-  Kind kind;
-  MemoryRepresentation stored_rep;
+struct AtomicRMWOp : OperationT<AtomicRMWOp> {
+  enum class BinOp : uint8_t {
+    kAdd,
+    kSub,
+    kAnd,
+    kOr,
+    kXor,
+    kExchange,
+    kCompareExchange
+  };
+  BinOp bin_op;
+  RegisterRepresentation result_rep;
+  MemoryRepresentation input_rep;
+  MemoryAccessKind memory_access_kind;
+  OpEffects Effects() const {
+    OpEffects effects =
+        OpEffects().CanWriteMemory().CanDependOnChecks().CanReadMemory();
+    if (memory_access_kind == MemoryAccessKind::kProtected) {
+      effects = effects.CanLeaveCurrentFunction();
+    }
+    return effects;
+  }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return base::VectorOf(&result_rep, 1);
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    if (bin_op == BinOp::kCompareExchange) {
+      return InitVectorOf(storage, {RegisterRepresentation::PointerSized(),
+                                    RegisterRepresentation::PointerSized(),
+                                    input_rep.ToRegisterRepresentation(),
+                                    input_rep.ToRegisterRepresentation()});
+    }
+    return InitVectorOf(storage, {RegisterRepresentation::PointerSized(),
+                                  RegisterRepresentation::PointerSized(),
+                                  input_rep.ToRegisterRepresentation()});
+  }
+
+  V<WordPtr> base() const { return input(0); }
+  V<WordPtr> index() const { return input(1); }
+  OpIndex value() const { return input(2); }
+  OpIndex expected() const {
+    return (input_count == 4) ? input(3) : OpIndex::Invalid();
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK_EQ(bin_op == BinOp::kCompareExchange, expected().valid());
+  }
+
+  AtomicRMWOp(OpIndex base, OpIndex index, OpIndex value, OpIndex expected,
+              BinOp bin_op, RegisterRepresentation result_rep,
+              MemoryRepresentation input_rep, MemoryAccessKind kind)
+      : Base(3 + expected.valid()),
+        bin_op(bin_op),
+        result_rep(result_rep),
+        input_rep(input_rep),
+        memory_access_kind(kind) {
+    input(0) = base;
+    input(1) = index;
+    input(2) = value;
+    if (expected.valid()) {
+      input(3) = expected;
+    }
+  }
+
+  static AtomicRMWOp& New(Graph* graph, OpIndex base, OpIndex index,
+                          OpIndex value, OpIndex expected, BinOp bin_op,
+                          RegisterRepresentation result_rep,
+                          MemoryRepresentation input_rep,
+                          MemoryAccessKind kind) {
+    return Base::New(graph, 3 + expected.valid(), base, index, value, expected,
+                     bin_op, result_rep, input_rep, kind);
+  }
+
+  void PrintInputs(std::ostream& os, const std::string& op_index_prefix) const;
+
+  void PrintOptions(std::ostream& os) const;
+
+  auto options() const {
+    return std::tuple{bin_op, result_rep, input_rep, memory_access_kind};
+  }
+};
+
+std::ostream& operator<<(std::ostream& os, AtomicRMWOp::BinOp kind);
+
+struct AtomicWord32PairOp : OperationT<AtomicWord32PairOp> {
+  enum class OpKind : uint8_t {
+    kAdd,
+    kSub,
+    kAnd,
+    kOr,
+    kXor,
+    kExchange,
+    kCompareExchange,
+    kLoad,
+    kStore
+  };
+
+  static OpKind OpKindFromBinOp(AtomicRMWOp::BinOp bin_op) {
+    switch (bin_op) {
+      case AtomicRMWOp::BinOp::kAdd:
+        return OpKind::kAdd;
+      case AtomicRMWOp::BinOp::kSub:
+        return OpKind::kSub;
+      case AtomicRMWOp::BinOp::kAnd:
+        return OpKind::kAnd;
+      case AtomicRMWOp::BinOp::kOr:
+        return OpKind::kOr;
+      case AtomicRMWOp::BinOp::kXor:
+        return OpKind::kXor;
+      case AtomicRMWOp::BinOp::kExchange:
+        return OpKind::kExchange;
+      case AtomicRMWOp::BinOp::kCompareExchange:
+        return OpKind::kCompareExchange;
+    }
+  }
+
+  OpKind op_kind;
+  int32_t offset;
+  bool has_index;
+  OpEffects Effects() const {
+    OpEffects effects = OpEffects().CanDependOnChecks();
+    if (op_kind == OpKind::kLoad) {
+      return effects.CanReadMemory();
+    }
+    if (op_kind == OpKind::kStore) {
+      return effects.CanWriteMemory();
+    }
+    return effects.CanReadMemory().CanWriteMemory();
+  }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    if (op_kind == OpKind::kStore) return {};
+    return RepVector<RegisterRepresentation::Word32(),
+                     RegisterRepresentation::Word32()>();
+  }
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    storage.resize(input_count);
+    int idx = 0;
+    storage[idx++] = RegisterRepresentation::PointerSized();  // base
+    if (has_index) {
+      storage[idx++] = RegisterRepresentation::PointerSized();  // index
+    }
+    if (op_kind != OpKind::kLoad) {
+      storage[idx++] = RegisterRepresentation::Word32();  // value_low
+      storage[idx++] = RegisterRepresentation::Word32();  // value_high
+    }
+    if (op_kind == OpKind::kCompareExchange) {
+      storage[idx++] = RegisterRepresentation::Word32();  // expected_low
+      storage[idx++] = RegisterRepresentation::Word32();  // expected_high
+    }
+    DCHECK_EQ(idx, input_count);
+    return base::VectorOf(storage);
+  }
+
+  V<WordPtr> base() const { return input(0); }
+  V<WordPtr> index() const { return has_index ? input(1) : OpIndex::Invalid(); }
+  V<Word32> value_low() const {
+    return (input_count > 1 + has_index) ? input(1 + has_index)
+                                         : OpIndex::Invalid();
+  }
+  V<Word32> value_high() const {
+    return (input_count > 2 + has_index) ? input(2 + has_index)
+                                         : OpIndex::Invalid();
+  }
+  V<Word32> expected_low() const {
+    return (input_count > 3 + has_index) ? input(3 + has_index)
+                                         : OpIndex::Invalid();
+  }
+  V<Word32> expected_high() const {
+    return (input_count > 4 + has_index) ? input(4 + has_index)
+                                         : OpIndex::Invalid();
+  }
+
+  void Validate(const Graph& graph) const {
+    if (op_kind == OpKind::kLoad) {
+      DCHECK_EQ(input_count, 1 + has_index);
+    }
+    DCHECK_EQ(op_kind == OpKind::kLoad, input_count == 1 + has_index);
+    DCHECK_EQ(op_kind == OpKind::kCompareExchange,
+              input_count == 5 + has_index);
+    DCHECK_EQ(op_kind != OpKind::kCompareExchange && op_kind != OpKind::kLoad,
+              input_count == 3 + has_index);
+  }
+
+  AtomicWord32PairOp(V<WordPtr> base, V<WordPtr> index, V<Word32> value_low,
+                     V<Word32> value_high, V<Word32> expected_low,
+                     V<Word32> expected_high, OpKind op_kind, int32_t offset)
+      : Base(1 + index.valid() + value_low.valid() + value_high.valid() +
+             expected_low.valid() + expected_high.valid()),
+        op_kind(op_kind),
+        offset(offset) {
+    DCHECK_EQ(value_low.valid(), value_high.valid());
+    DCHECK_EQ(expected_low.valid(), expected_high.valid());
+    has_index = index.valid();
+    input(0) = base;
+    if (index.valid()) {
+      input(1) = index;
+    }
+    if (value_low.valid()) {
+      input(1 + has_index) = value_low;
+    }
+    if (value_high.valid()) {
+      input(2 + has_index) = value_high;
+    }
+    if (expected_low.valid()) {
+      input(3 + has_index) = expected_low;
+    }
+    if (expected_high.valid()) {
+      input(4 + has_index) = expected_high;
+    }
+  }
+
+  static AtomicWord32PairOp& New(Graph* graph, V<WordPtr> base,
+                                 V<WordPtr> index, V<Word32> value_low,
+                                 V<Word32> value_high, V<Word32> expected_low,
+                                 V<Word32> expected_high, OpKind op_kind,
+                                 int32_t offset) {
+    return Base::New(graph,
+                     1 + index.valid() + value_low.valid() +
+                         value_high.valid() + expected_low.valid() +
+                         expected_high.valid(),
+                     base, index, value_low, value_high, expected_low,
+                     expected_high, op_kind, offset);
+  }
+
+  void PrintInputs(std::ostream& os, const std::string& op_index_prefix) const;
+
+  void PrintOptions(std::ostream& os) const;
+
+  auto options() const { return std::tuple{op_kind, offset}; }
+};
+
+std::ostream& operator<<(std::ostream& os, AtomicWord32PairOp::OpKind kind);
+
+// Store `value` to: base + offset + index * 2^element_size_log2.
+// For Kind::tagged_base: subtract kHeapObjectTag,
+//                        `base` has to be the object start.
+struct StoreOp : OperationT<StoreOp> {
+  using Kind = LoadOp::Kind;
+  Kind kind;
+  MemoryRepresentation stored_rep;
   WriteBarrierKind write_barrier;
   uint8_t element_size_log2;  // multiply index with 2^element_size_log2
   int32_t offset;             // add offset to scaled index
-
-  OpProperties Properties() const {
-    return kind.with_trap_handler ? OpProperties::WritingAndCanAbort()
-                                  : OpProperties::Writing();
+  bool maybe_initializing_or_transitioning;
+
+  OpEffects Effects() const {
+    // Stores might depend on checks for pointer validity, object layout, bounds
+    // checks, etc.
+    // TODO(tebbi): Distinghish between on-heap and off-heap stores.
+    OpEffects effects = OpEffects().CanWriteMemory().CanDependOnChecks();
+    if (kind.with_trap_handler) effects = effects.CanLeaveCurrentFunction();
+    if (maybe_initializing_or_transitioning) {
+      effects = effects.CanDoRawHeapAccess();
+    }
+    if (kind.is_atomic) {
+      // Atomic stores should not be eliminated away, even if the situation
+      // seems to allow e.g. store-store elimination. Elimination is avoided by
+      // setting the `CanReadMemory` effect.
+      effects = effects.CanReadMemory();
+    }
+    return effects;
   }
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    RegisterRepresentation base = kind.tagged_base
+                                      ? RegisterRepresentation::Tagged()
+                                      : RegisterRepresentation::PointerSized();
+    if (index() == OpIndex::Invalid()) {
+      return InitVectorOf(
+          storage, {base, stored_rep.ToRegisterRepresentationForStore()});
+    }
+    return InitVectorOf(storage,
+                        {base, stored_rep.ToRegisterRepresentationForStore(),
+                         RegisterRepresentation::PointerSized()});
+  }
+
   OpIndex base() const { return input(0); }
   OpIndex value() const { return input(1); }
   OpIndex index() const {
@@ -1744,13 +2933,16 @@ struct StoreOp : OperationT<StoreOp> {
 
   StoreOp(OpIndex base, OpIndex index, OpIndex value, Kind kind,
           MemoryRepresentation stored_rep, WriteBarrierKind write_barrier,
-          int32_t offset, uint8_t element_size_log2)
+          int32_t offset, uint8_t element_size_log2,
+          bool maybe_initializing_or_transitioning)
       : Base(2 + index.valid()),
         kind(kind),
         stored_rep(stored_rep),
         write_barrier(write_barrier),
         element_size_log2(element_size_log2),
-        offset(offset) {
+        offset(offset),
+        maybe_initializing_or_transitioning(
+            maybe_initializing_or_transitioning) {
     input(0) = base;
     input(1) = value;
     if (index.valid()) {
@@ -1776,51 +2968,73 @@ struct StoreOp : OperationT<StoreOp> {
   static StoreOp& New(Graph* graph, OpIndex base, OpIndex index, OpIndex value,
                       Kind kind, MemoryRepresentation stored_rep,
                       WriteBarrierKind write_barrier, int32_t offset,
-                      uint8_t element_size_log2) {
+                      uint8_t element_size_log2,
+                      bool maybe_initializing_or_transitioning) {
     return Base::New(graph, 2 + index.valid(), base, index, value, kind,
-                     stored_rep, write_barrier, offset, element_size_log2);
+                     stored_rep, write_barrier, offset, element_size_log2,
+                     maybe_initializing_or_transitioning);
   }
 
   void PrintInputs(std::ostream& os, const std::string& op_index_prefix) const;
   void PrintOptions(std::ostream& os) const;
   auto options() const {
-    return std::tuple{kind, stored_rep, write_barrier, offset,
-                      element_size_log2};
+    return std::tuple{
+        kind,   stored_rep,        write_barrier,
+        offset, element_size_log2, maybe_initializing_or_transitioning};
   }
 };
 
 struct AllocateOp : FixedArityOperationT<1, AllocateOp> {
   AllocationType type;
-  AllowLargeObjects allow_large_objects;
 
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          .CanAllocate()
+          // The resulting object is unitialized, which leaves the heap in an
+          // inconsistent state.
+          .CanDoRawHeapAccess()
+          // Do not move allocations before checks, to avoid OOM or invalid
+          // size.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::PointerSized()>();
+  }
+
   OpIndex size() const { return input(0); }
 
-  AllocateOp(OpIndex size, AllocationType type,
-             AllowLargeObjects allow_large_objects)
-      : Base(size), type(type), allow_large_objects(allow_large_objects) {}
+  AllocateOp(OpIndex size, AllocationType type) : Base(size), type(type) {}
 
   void Validate(const Graph& graph) const {
     DCHECK(
         ValidOpInputRep(graph, size(), RegisterRepresentation::PointerSized()));
   }
   void PrintOptions(std::ostream& os) const;
-  auto options() const { return std::tuple{type, allow_large_objects}; }
+  auto options() const { return std::tuple{type}; }
 };
 
 struct DecodeExternalPointerOp
     : FixedArityOperationT<1, DecodeExternalPointerOp> {
   ExternalPointerTag tag;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  // Accessing external pointers is only safe if the garbage collected pointer
+  // keeping the external pointer alive is retained for the length of the
+  // operation. For this, it is essential that we use a `Retain` operation
+  // placed after the last access to the external data.
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::PointerSized()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32()>();
+  }
+
   OpIndex handle() const { return input(0); }
 
   DecodeExternalPointerOp(OpIndex handle, ExternalPointerTag tag)
@@ -1839,11 +3053,15 @@ struct RetainOp : FixedArityOperationT<1, RetainOp> {
   OpIndex retained() const { return input(0); }
 
   // Retain doesn't actually write, it just keeps a value alive. However, since
-  // this must not be reordered with operations reading from the heap, we mark
-  // it as writing to prevent such reorderings.
-  static constexpr OpProperties properties = OpProperties::Writing();
+  // this must not be reordered with reading operations, we mark it as writing.
+  static constexpr OpEffects effects = OpEffects().CanWriteMemory();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   explicit RetainOp(OpIndex retained) : Base(retained) {}
 
   void Validate(const Graph& graph) const {
@@ -1853,15 +3071,24 @@ struct RetainOp : FixedArityOperationT<1, RetainOp> {
   auto options() const { return std::tuple{}; }
 };
 
+// We compare the stack pointer register with the given limit and a
+// codegen-dependant adjustment.
 struct StackPointerGreaterThanOp
     : FixedArityOperationT<1, StackPointerGreaterThanOp> {
   StackCheckKind kind;
 
-  static constexpr OpProperties properties = OpProperties::Reading();
+  // Since the frame size of optimized functions is constant, this behaves like
+  // a pure operation.
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Word32()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::PointerSized()>();
+  }
+
   OpIndex stack_limit() const { return input(0); }
 
   StackPointerGreaterThanOp(OpIndex stack_limit, StackCheckKind kind)
@@ -1881,11 +3108,18 @@ struct StackSlotOp : FixedArityOperationT<0, StackSlotOp> {
   int size;
   int alignment;
 
-  static constexpr OpProperties properties = OpProperties::Writing();
+  // We can freely reorder stack slot operations, but must not de-duplicate
+  // them.
+  static constexpr OpEffects effects = OpEffects().CanCreateIdentity();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::PointerSized()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   StackSlotOp(int size, int alignment) : size(size), alignment(alignment) {}
   void Validate(const Graph& graph) const {}
   auto options() const { return std::tuple{size, alignment}; }
@@ -1898,7 +3132,7 @@ struct FrameConstantOp : FixedArityOperationT<0, FrameConstantOp> {
   enum class Kind { kStackCheckOffset, kFramePointer, kParentFramePointer };
   Kind kind;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     switch (kind) {
       case Kind::kStackCheckOffset:
@@ -1909,6 +3143,11 @@ struct FrameConstantOp : FixedArityOperationT<0, FrameConstantOp> {
     }
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   explicit FrameConstantOp(Kind kind) : Base(), kind(kind) {}
   void Validate(const Graph& graph) const {}
   auto options() const { return std::tuple{kind}; }
@@ -1919,9 +3158,14 @@ struct FrameStateOp : OperationT<FrameStateOp> {
   bool inlined;
   const FrameStateData* data;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   OpIndex parent_frame_state() const {
     DCHECK(inlined);
     return input(0);
@@ -1946,12 +3190,7 @@ struct FrameStateOp : OperationT<FrameStateOp> {
                const FrameStateData* data)
       : Base(inputs), inlined(inlined), data(data) {}
 
-  void Validate(const Graph& graph) const {
-    if (inlined) {
-      DCHECK(Get(graph, parent_frame_state()).Is<FrameStateOp>());
-    }
-    // TODO(tebbi): Check frame state inputs using `FrameStateData`.
-  }
+  void Validate(const Graph& graph) const;
   void PrintOptions(std::ostream& os) const;
   auto options() const { return std::tuple{inlined, data}; }
 };
@@ -1959,9 +3198,14 @@ struct FrameStateOp : OperationT<FrameStateOp> {
 struct DeoptimizeOp : FixedArityOperationT<1, DeoptimizeOp> {
   const DeoptimizeParameters* parameters;
 
-  static constexpr OpProperties properties = OpProperties::BlockTerminator();
+  static constexpr OpEffects effects = OpEffects().CanDeopt();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   OpIndex frame_state() const { return input(0); }
 
   DeoptimizeOp(OpIndex frame_state, const DeoptimizeParameters* parameters)
@@ -1976,9 +3220,14 @@ struct DeoptimizeIfOp : FixedArityOperationT<2, DeoptimizeIfOp> {
   bool negated;
   const DeoptimizeParameters* parameters;
 
-  static constexpr OpProperties properties = OpProperties::CanAbort();
+  static constexpr OpEffects effects = OpEffects().CanDeopt();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32()>();
+  }
+
   OpIndex condition() const { return input(0); }
   OpIndex frame_state() const { return input(1); }
 
@@ -1988,36 +3237,83 @@ struct DeoptimizeIfOp : FixedArityOperationT<2, DeoptimizeIfOp> {
         negated(negated),
         parameters(parameters) {}
 
+  bool EqualsForGVN(const DeoptimizeIfOp& other) const {
+    // As far as GVN is concerned, the `frame_state` and `parameters` don't
+    // matter: 2 DeoptimizeIf can be GVNed if they have the same `condition` and
+    // same `negated`, regardless of their `frame_state` and `parameters`.
+    return condition() == other.condition() && negated == other.negated;
+  }
+  size_t hash_value() const {
+    // To enable GVNing as described above in `EqualsForGVN`, `hash_value` has
+    // to ignore the `frame_state` and the `parameters`.
+    return fast_hash_combine(Opcode::kDeoptimizeIf, condition(), negated);
+  }
   void Validate(const Graph& graph) const {
     DCHECK(
         ValidOpInputRep(graph, condition(), RegisterRepresentation::Word32()));
+    DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
   }
   auto options() const { return std::tuple{negated, parameters}; }
 };
 
-struct TrapIfOp : FixedArityOperationT<1, TrapIfOp> {
+struct TrapIfOp : OperationT<TrapIfOp> {
   bool negated;
   const TrapId trap_id;
 
-  static constexpr OpProperties properties = OpProperties::CanAbort();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // Traps must not float above a protective check.
+          .CanDependOnChecks()
+          // Subsequent code can rely on the trap not having happened.
+          .CanLeaveCurrentFunction();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32()>();
+  }
+
   OpIndex condition() const { return input(0); }
+  OpIndex frame_state() const {
+    return input_count > 1 ? input(1) : OpIndex::Invalid();
+  }
+
+  TrapIfOp(OpIndex condition, OpIndex frame_state, bool negated,
+           const TrapId trap_id)
+      : Base(1 + frame_state.valid()), negated(negated), trap_id(trap_id) {
+    input(0) = condition;
+    if (frame_state.valid()) {
+      input(1) = frame_state;
+    }
+  }
 
-  TrapIfOp(OpIndex condition, bool negated, const TrapId trap_id)
-      : Base(condition), negated(negated), trap_id(trap_id) {}
+  static TrapIfOp& New(Graph* graph, OpIndex condition, OpIndex frame_state,
+                       bool negated, const TrapId trap_id) {
+    return Base::New(graph, 1 + frame_state.valid(), condition, frame_state,
+                     negated, trap_id);
+  }
 
   void Validate(const Graph& graph) const {
     DCHECK(
         ValidOpInputRep(graph, condition(), RegisterRepresentation::Word32()));
+    if (frame_state().valid()) {
+      DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
+    }
   }
   auto options() const { return std::tuple{negated, trap_id}; }
 };
 
 struct StaticAssertOp : FixedArityOperationT<1, StaticAssertOp> {
-  static constexpr OpProperties properties = OpProperties::CanAbort();
-  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
   const char* source;
+  static constexpr OpEffects effects =
+      OpEffects().CanDependOnChecks().RequiredWhenUnused();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32()>();
+  }
 
   OpIndex condition() const { return Base::input(0); }
 
@@ -2036,11 +3332,16 @@ struct ParameterOp : FixedArityOperationT<0, ParameterOp> {
   RegisterRepresentation rep;
   const char* debug_name;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return {&rep, 1};
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};  // On the callee side a parameter doesn't have an input.
+  }
+
   explicit ParameterOp(int32_t parameter_index, RegisterRepresentation rep,
                        const char* debug_name = "")
       : Base(),
@@ -2055,11 +3356,16 @@ struct ParameterOp : FixedArityOperationT<0, ParameterOp> {
 struct OsrValueOp : FixedArityOperationT<0, OsrValueOp> {
   int32_t index;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   explicit OsrValueOp(int32_t index) : Base(), index(index) {}
   void Validate(const Graph& graph) const {}
   auto options() const { return std::tuple{index}; }
@@ -2067,33 +3373,74 @@ struct OsrValueOp : FixedArityOperationT<0, OsrValueOp> {
 
 struct TSCallDescriptor : public NON_EXPORTED_BASE(ZoneObject) {
   const CallDescriptor* descriptor;
+  base::Vector<const RegisterRepresentation> in_reps;
   base::Vector<const RegisterRepresentation> out_reps;
+  CanThrow can_throw;
 
   TSCallDescriptor(const CallDescriptor* descriptor,
-                   base::Vector<const RegisterRepresentation> out_reps)
-      : descriptor(descriptor), out_reps(out_reps) {}
+                   base::Vector<const RegisterRepresentation> in_reps,
+                   base::Vector<const RegisterRepresentation> out_reps,
+                   CanThrow can_throw)
+      : descriptor(descriptor),
+        in_reps(in_reps),
+        out_reps(out_reps),
+        can_throw(can_throw) {}
 
   static const TSCallDescriptor* Create(const CallDescriptor* descriptor,
-                                        Zone* graph_zone) {
+                                        CanThrow can_throw, Zone* graph_zone) {
+    base::Vector<RegisterRepresentation> in_reps =
+        graph_zone->AllocateVector<RegisterRepresentation>(
+            descriptor->ParameterCount());
+    for (size_t i = 0; i < descriptor->ParameterCount(); ++i) {
+      in_reps[i] = RegisterRepresentation::FromMachineRepresentation(
+          descriptor->GetParameterType(i).representation());
+    }
     base::Vector<RegisterRepresentation> out_reps =
-        graph_zone->NewVector<RegisterRepresentation>(
+        graph_zone->AllocateVector<RegisterRepresentation>(
             descriptor->ReturnCount());
     for (size_t i = 0; i < descriptor->ReturnCount(); ++i) {
       out_reps[i] = RegisterRepresentation::FromMachineRepresentation(
           descriptor->GetReturnType(i).representation());
     }
-    return graph_zone->New<TSCallDescriptor>(descriptor, out_reps);
+    return graph_zone->New<TSCallDescriptor>(descriptor, in_reps, out_reps,
+                                             can_throw);
   }
 };
 
 struct CallOp : OperationT<CallOp> {
   const TSCallDescriptor* descriptor;
+  OpEffects callee_effects;
 
-  static constexpr OpProperties properties = OpProperties::AnySideEffects();
-  base::Vector<const RegisterRepresentation> outputs_rep() const {
+  OpEffects Effects() const {
+    // TODO(dmercadier): return `callee_effects` instead of `CanCallAnything`.
+    // (This has been temporarily changed, because of stability issues)
+    return OpEffects().CanCallAnything();
+    // return callee_effects;
+  }
+
+  // The outputs are produced by the `DidntThrow` operation.
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+  base::Vector<const RegisterRepresentation> results_rep() const {
     return descriptor->out_reps;
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    storage.resize(input_count);
+    size_t i = 0;
+    storage[i++] = MaybeRegisterRepresentation::Tagged();  // True for wasm?
+    if (HasFrameState()) {
+      storage[i++] = MaybeRegisterRepresentation::None();
+    }
+    for (auto rep : descriptor->in_reps) {
+      // In JavaScript, parameters are optional.
+      if (i >= input_count) break;
+      storage[i++] = rep;
+    }
+    storage.resize(i);
+    return base::VectorOf(storage);
+  }
+
   bool HasFrameState() const {
     return descriptor->descriptor->NeedsFrameState();
   }
@@ -2108,9 +3455,10 @@ struct CallOp : OperationT<CallOp> {
 
   CallOp(OpIndex callee, OpIndex frame_state,
          base::Vector<const OpIndex> arguments,
-         const TSCallDescriptor* descriptor)
+         const TSCallDescriptor* descriptor, OpEffects effects)
       : Base(1 + frame_state.valid() + arguments.size()),
-        descriptor(descriptor) {
+        descriptor(descriptor),
+        callee_effects(effects) {
     base::Vector<OpIndex> inputs = this->inputs();
     inputs[0] = callee;
     if (frame_state.valid()) {
@@ -2128,96 +3476,139 @@ struct CallOp : OperationT<CallOp> {
 
   static CallOp& New(Graph* graph, OpIndex callee, OpIndex frame_state,
                      base::Vector<const OpIndex> arguments,
-                     const TSCallDescriptor* descriptor) {
+                     const TSCallDescriptor* descriptor, OpEffects effects) {
     return Base::New(graph, 1 + frame_state.valid() + arguments.size(), callee,
-                     frame_state, arguments, descriptor);
+                     frame_state, arguments, descriptor, effects);
   }
   auto options() const { return std::tuple{descriptor}; }
 };
 
-struct CallAndCatchExceptionOp : OperationT<CallAndCatchExceptionOp> {
-  const TSCallDescriptor* descriptor;
-  Block* if_success;
-  Block* if_exception;
+// Catch an exception from the first operation of the `successor` block and
+// continue execution in `catch_block` in this case.
+struct CheckExceptionOp : FixedArityOperationT<1, CheckExceptionOp> {
+  Block* didnt_throw_block;
+  Block* catch_block;
 
-  static constexpr OpProperties properties =
-      OpProperties::BlockTerminatorWithAnySideEffect();
-  base::Vector<const RegisterRepresentation> outputs_rep() const {
-    return descriptor->out_reps;
-  }
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
-  bool HasFrameState() const {
-    return descriptor->descriptor->NeedsFrameState();
-  }
+  OpIndex throwing_operation() const { return input(0); }
 
-  OpIndex callee() const { return input(0); }
-  OpIndex frame_state() const {
-    return HasFrameState() ? input(1) : OpIndex::Invalid();
-  }
-  base::Vector<const OpIndex> arguments() const {
-    return inputs().SubVector(1 + HasFrameState(), input_count);
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
   }
 
-  CallAndCatchExceptionOp(OpIndex callee, OpIndex frame_state,
-                          base::Vector<const OpIndex> arguments,
-                          Block* if_success, Block* if_exception,
-                          const TSCallDescriptor* descriptor)
-      : Base(1 + frame_state.valid() + arguments.size()),
-        descriptor(descriptor),
-        if_success(if_success),
-        if_exception(if_exception) {
-    base::Vector<OpIndex> inputs = this->inputs();
-    inputs[0] = callee;
-    if (frame_state.valid()) {
-      inputs[1] = frame_state;
-    }
-    inputs.SubVector(1 + frame_state.valid(), inputs.size())
-        .OverwriteWith(arguments);
-  }
+  CheckExceptionOp(OpIndex throwing_operation, Block* successor,
+                   Block* catch_block)
+      : Base(throwing_operation),
+        didnt_throw_block(successor),
+        catch_block(catch_block) {}
 
-  void Validate(const Graph& graph) const {
-    if (frame_state().valid()) {
-      DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
-    }
-  }
+  void Validate(const Graph& graph) const;
 
-  static CallAndCatchExceptionOp& New(Graph* graph, OpIndex callee,
-                                      OpIndex frame_state,
-                                      base::Vector<const OpIndex> arguments,
-                                      Block* if_success, Block* if_exception,
-                                      const TSCallDescriptor* descriptor) {
-    return Base::New(graph, 1 + frame_state.valid() + arguments.size(), callee,
-                     frame_state, arguments, if_success, if_exception,
-                     descriptor);
+  auto options() const { return std::tuple{didnt_throw_block, catch_block}; }
+};
+
+// This is a pseudo-operation that marks the beginning of a catch block. It
+// returns the caught exception.
+struct CatchBlockBeginOp : FixedArityOperationT<0, CatchBlockBeginOp> {
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
   }
 
-  auto options() const {
-    return std::tuple{descriptor, if_success, if_exception};
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
   }
+
+  CatchBlockBeginOp() : Base() {}
+  void Validate(const Graph& graph) const {}
+  auto options() const { return std::tuple{}; }
 };
 
-struct LoadExceptionOp : FixedArityOperationT<0, LoadExceptionOp> {
-  static constexpr OpProperties properties = OpProperties::Reading();
+// Throwing operations always appear together with `DidntThrowOp`, which
+// produces the value in case that no exception was thrown. If the callsite is
+// non-catching, then `DidntThrowOp` follows right after the throwing operation:
+//
+//   100: Call(...)
+//   101: DidntThrow(100)
+//   102: Foo(101)
+//
+// If the callsite can catch, then the
+// pattern is as follows:
+//
+//   100: Call(...)
+//   101: CheckException(B10, B11)
+//
+//   B10:
+//   102: DidntThrow(100)
+//   103: Foo(102)
+//
+//   B11:
+//   200: CatchBlockBegin()
+//   201: ...
+//
+// This complexity is mostly hidden from graph creation, with
+// `DidntThrowOp` and `CheckExceptionOp` being inserted automatically.
+// The correct way to produce `CheckExceptionOp` is to create an
+// `Assembler::CatchScope`, which will cause all throwing operations
+// to add a `CheckExceptionOp` automatically while the scope is active.
+// Since `OptimizationPhase` does this automatically, lowering throwing
+// operations into an arbitrary subgraph works automatically.
+struct DidntThrowOp : FixedArityOperationT<1, DidntThrowOp> {
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+
+  // If there is a `CheckException` operation with a catch block for
+  // `throwing_operation`.
+  bool has_catch_block;
+  // This is a pointer to a vector instead of a vector to save a bit of memory,
+  // using optimal 16 bytes instead of 24.
+  const base::Vector<const RegisterRepresentation>* results_rep;
 
   base::Vector<const RegisterRepresentation> outputs_rep() const {
-    return RepVector<RegisterRepresentation::Tagged()>();
+    return *results_rep;
   }
 
-  LoadExceptionOp() : Base() {}
-  void Validate(const Graph& graph) const {}
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::None()>();
+  }
 
+  OpIndex throwing_operation() const { return input(0); }
+
+  explicit DidntThrowOp(
+      OpIndex throwing_operation, bool has_catch_block,
+      const base::Vector<const RegisterRepresentation>* results_rep)
+      : Base(throwing_operation),
+        has_catch_block(has_catch_block),
+        results_rep(results_rep) {}
+  void Validate(const Graph& graph) const;
   auto options() const { return std::tuple{}; }
 };
 
 struct TailCallOp : OperationT<TailCallOp> {
   const TSCallDescriptor* descriptor;
 
-  static constexpr OpProperties properties =
-      OpProperties::BlockTerminatorWithAnySideEffect();
+  static constexpr OpEffects effects = OpEffects().CanLeaveCurrentFunction();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return descriptor->out_reps;
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    storage.resize(input_count);
+    size_t i = 0;
+    storage[i++] = MaybeRegisterRepresentation::Tagged();  // True for wasm?
+    for (auto rep : descriptor->in_reps) {
+      storage[i++] = rep;
+    }
+    storage.resize(i);
+    return base::VectorOf(storage);
+  }
+
   OpIndex callee() const { return input(0); }
   base::Vector<const OpIndex> arguments() const {
     return inputs().SubVector(1, input_count);
@@ -2242,18 +3633,31 @@ struct TailCallOp : OperationT<TailCallOp> {
 
 // Control-flow should never reach here.
 struct UnreachableOp : FixedArityOperationT<0, UnreachableOp> {
-  static constexpr OpProperties properties = OpProperties::BlockTerminator();
+  static constexpr OpEffects effects =
+      OpEffects().CanDependOnChecks().CanLeaveCurrentFunction();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   UnreachableOp() : Base() {}
   void Validate(const Graph& graph) const {}
   auto options() const { return std::tuple{}; }
 };
 
 struct ReturnOp : OperationT<ReturnOp> {
-  static constexpr OpProperties properties = OpProperties::BlockTerminator();
+  static constexpr OpEffects effects = OpEffects().CanLeaveCurrentFunction();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    // TODO(mliedtke): Ideally, a return op would expect to get the correct
+    // types for all its return values, not just the pop count.
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32()>();
+  }
+
   // Number of additional stack slots to be removed.
   OpIndex pop_count() const { return input(0); }
 
@@ -2282,9 +3686,14 @@ struct ReturnOp : OperationT<ReturnOp> {
 struct GotoOp : FixedArityOperationT<0, GotoOp> {
   Block* destination;
 
-  static constexpr OpProperties properties = OpProperties::BlockTerminator();
+  static constexpr OpEffects effects = OpEffects().CanChangeControlFlow();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   explicit GotoOp(Block* destination) : Base(), destination(destination) {}
   void Validate(const Graph& graph) const {}
   auto options() const { return std::tuple{destination}; }
@@ -2295,9 +3704,14 @@ struct BranchOp : FixedArityOperationT<1, BranchOp> {
   Block* if_false;
   BranchHint hint;
 
-  static constexpr OpProperties properties = OpProperties::BlockTerminator();
+  static constexpr OpEffects effects = OpEffects().CanChangeControlFlow();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32()>();
+  }
+
   OpIndex condition() const { return input(0); }
 
   BranchOp(OpIndex condition, Block* if_true, Block* if_false, BranchHint hint)
@@ -2328,9 +3742,14 @@ struct SwitchOp : FixedArityOperationT<1, SwitchOp> {
   Block* default_case;
   BranchHint default_hint;
 
-  static constexpr OpProperties properties = OpProperties::BlockTerminator();
+  static constexpr OpEffects effects = OpEffects().CanChangeControlFlow();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32()>();
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   SwitchOp(OpIndex input, base::Vector<const Case> cases, Block* default_case,
@@ -2355,11 +3774,10 @@ struct fast_hash<SwitchOp::Case> {
 };
 
 inline base::SmallVector<Block*, 4> SuccessorBlocks(const Operation& op) {
-  DCHECK(op.Properties().is_block_terminator);
   switch (op.opcode) {
-    case Opcode::kCallAndCatchException: {
-      auto& casted = op.Cast<CallAndCatchExceptionOp>();
-      return {casted.if_success, casted.if_exception};
+    case Opcode::kCheckException: {
+      auto& casted = op.Cast<CheckExceptionOp>();
+      return {casted.didnt_throw_block, casted.catch_block};
     }
     case Opcode::kGoto: {
       auto& casted = op.Cast<GotoOp>();
@@ -2370,6 +3788,7 @@ inline base::SmallVector<Block*, 4> SuccessorBlocks(const Operation& op) {
       return {casted.if_true, casted.if_false};
     }
     case Opcode::kReturn:
+    case Opcode::kTailCall:
     case Opcode::kDeoptimize:
     case Opcode::kUnreachable:
       return base::SmallVector<Block*, 4>{};
@@ -2382,17 +3801,27 @@ inline base::SmallVector<Block*, 4> SuccessorBlocks(const Operation& op) {
       result.push_back(casted.default_case);
       return result;
     }
-    default:
+#define NON_TERMINATOR_CASE(op) case Opcode::k##op:
+      TURBOSHAFT_OPERATION_LIST_NOT_BLOCK_TERMINATOR(NON_TERMINATOR_CASE)
       UNREACHABLE();
+#undef NON_TERMINATOR_CASE
   }
 }
 
+base::SmallVector<Block*, 4> SuccessorBlocks(const Block& block,
+                                             const Graph& graph);
+
 // Tuples are only used to lower operations with multiple outputs.
 // `TupleOp` should be folded away by subsequent `ProjectionOp`s.
 struct TupleOp : OperationT<TupleOp> {
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   explicit TupleOp(base::Vector<const OpIndex> inputs) : Base(inputs) {}
   void Validate(const Graph& graph) const {}
   auto options() const { return std::tuple{}; }
@@ -2404,11 +3833,16 @@ struct ProjectionOp : FixedArityOperationT<1, ProjectionOp> {
   uint16_t index;
   RegisterRepresentation rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return base::VectorOf(&rep, 1);
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   ProjectionOp(OpIndex input, uint16_t index, RegisterRepresentation rep)
@@ -2426,9 +3860,17 @@ struct CheckTurboshaftTypeOfOp
   Type type;
   bool successful;
 
-  static constexpr OpProperties properties = OpProperties::AnySideEffects();
+  static constexpr OpEffects effects = OpEffects()
+                                           .CanDependOnChecks()
+                                           .CanReadImmutableMemory()
+                                           .RequiredWhenUnused();
   base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(rep);
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   CheckTurboshaftTypeOfOp(OpIndex input, RegisterRepresentation rep, Type type,
@@ -2467,11 +3909,20 @@ struct ObjectIsOp : FixedArityOperationT<1, ObjectIsOp> {
   Kind kind;
   InputAssumptions input_assumptions;
 
-  static constexpr OpProperties properties = OpProperties::Reading();
+  // All type checks performed by this operator are regarding immutable
+  // properties. Therefore, it can be considered pure. Input assumptions,
+  // howerever, can rely on being scheduled after checks.
+  static constexpr OpEffects effects =
+      OpEffects().CanDependOnChecks().CanReadImmutableMemory();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Word32()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   ObjectIsOp(OpIndex input, Kind kind, InputAssumptions input_assumptions)
@@ -2485,93 +3936,185 @@ std::ostream& operator<<(std::ostream& os, ObjectIsOp::Kind kind);
 std::ostream& operator<<(std::ostream& os,
                          ObjectIsOp::InputAssumptions input_assumptions);
 
+enum class NumericKind : uint8_t {
+  kFloat64Hole,
+  kFinite,
+  kInteger,
+  kSafeInteger,
+  kMinusZero,
+  kNaN,
+};
+std::ostream& operator<<(std::ostream& os, NumericKind kind);
+
 struct FloatIsOp : FixedArityOperationT<1, FloatIsOp> {
-  enum class Kind : uint8_t {
-    kNaN,
-  };
-  Kind kind;
+  NumericKind kind;
   FloatRepresentation input_rep;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  FloatIsOp(OpIndex input, NumericKind kind, FloatRepresentation input_rep)
+      : Base(input), kind(kind), input_rep(input_rep) {}
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Word32()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(input_rep);
+  }
+
   OpIndex input() const { return Base::input(0); }
 
-  FloatIsOp(OpIndex input, Kind kind, FloatRepresentation input_rep)
-      : Base(input), kind(kind), input_rep(input_rep) {}
   void Validate(const Graph& graph) const {
     DCHECK(ValidOpInputRep(graph, input(), input_rep));
   }
   auto options() const { return std::tuple{kind, input_rep}; }
 };
-std::ostream& operator<<(std::ostream& os, FloatIsOp::Kind kind);
 
-struct ConvertToObjectOp : FixedArityOperationT<1, ConvertToObjectOp> {
-  enum class Kind : uint8_t {
-    kBigInt,
-    kBoolean,
-    kHeapNumber,
-    kNumber,
-    kSmi,
-    kString,
-  };
-  enum class InputInterpretation : uint8_t {
-    kSigned,
-    kUnsigned,
-    kCharCode,
-    kCodePoint,
-  };
-  Kind kind;
-  RegisterRepresentation input_rep;
-  InputInterpretation input_interpretation;
-  CheckForMinusZeroMode minus_zero_mode;
+struct ObjectIsNumericValueOp
+    : FixedArityOperationT<1, ObjectIsNumericValueOp> {
+  NumericKind kind;
+  FloatRepresentation input_rep;
+
+  ObjectIsNumericValueOp(OpIndex input, NumericKind kind,
+                         FloatRepresentation input_rep)
+      : Base(input), kind(kind), input_rep(input_rep) {}
 
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  // Heap numbers are immutable, so reading from them is pure. We might rely on
+  // checks to assume that the input is a heap number.
+  static constexpr OpEffects effects =
+      OpEffects().CanDependOnChecks().CanReadImmutableMemory();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
-    return RepVector<RegisterRepresentation::Tagged()>();
+    return RepVector<RegisterRepresentation::Word32()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
   }
 
   OpIndex input() const { return Base::input(0); }
 
-  ConvertToObjectOp(OpIndex input, Kind kind, RegisterRepresentation input_rep,
-                    InputInterpretation input_interpretation,
-                    CheckForMinusZeroMode minus_zero_mode)
-      : Base(input),
-        kind(kind),
-        input_rep(input_rep),
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, input(), RegisterRepresentation::Tagged()));
+  }
+  auto options() const { return std::tuple{kind, input_rep}; }
+};
+
+struct ConvertOp : FixedArityOperationT<1, ConvertOp> {
+  enum class Kind {
+    kObject,
+    kBoolean,
+    kNumber,
+    kNumberOrOddball,
+    kPlainPrimitive,
+    kString,
+    kSmi,
+  };
+  Kind from;
+  Kind to;
+
+  // All properties/values we read are immutable.
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We only allocate identityless primitives here.
+          .CanAllocateWithoutIdentity()
+          // We might use preceding checks to ensure the input has the right
+          // type.
+          .CanDependOnChecks()
+          .CanReadImmutableMemory();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex input() const { return Base::input(0); }
+
+  ConvertOp(OpIndex input, Kind from, Kind to)
+      : Base(input), from(from), to(to) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, input(), RegisterRepresentation::Tagged()));
+  }
+  auto options() const { return std::tuple{from, to}; }
+};
+std::ostream& operator<<(std::ostream& os, ConvertOp::Kind kind);
+
+struct ConvertUntaggedToJSPrimitiveOp
+    : FixedArityOperationT<1, ConvertUntaggedToJSPrimitiveOp> {
+  enum class JSPrimitiveKind : uint8_t {
+    kBigInt,
+    kBoolean,
+    kHeapNumber,
+    kNumber,
+    kSmi,
+    kString,
+  };
+  enum class InputInterpretation : uint8_t {
+    kSigned,
+    kUnsigned,
+    kCharCode,
+    kCodePoint,
+  };
+  JSPrimitiveKind kind;
+  RegisterRepresentation input_rep;
+  InputInterpretation input_interpretation;
+  CheckForMinusZeroMode minus_zero_mode;
+
+  // The input is untagged and the results are identityless primitives.
+  static constexpr OpEffects effects = OpEffects().CanAllocateWithoutIdentity();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(input_rep);
+  }
+
+  OpIndex input() const { return Base::input(0); }
+
+  ConvertUntaggedToJSPrimitiveOp(OpIndex input, JSPrimitiveKind kind,
+                                 RegisterRepresentation input_rep,
+                                 InputInterpretation input_interpretation,
+                                 CheckForMinusZeroMode minus_zero_mode)
+      : Base(input),
+        kind(kind),
+        input_rep(input_rep),
         input_interpretation(input_interpretation),
         minus_zero_mode(minus_zero_mode) {}
 
   void Validate(const Graph& graph) const {
     switch (kind) {
-      case Kind::kBigInt:
+      case JSPrimitiveKind::kBigInt:
         DCHECK_EQ(input_rep, RegisterRepresentation::Word64());
         DCHECK(ValidOpInputRep(graph, input(), input_rep));
         DCHECK_EQ(minus_zero_mode,
                   CheckForMinusZeroMode::kDontCheckForMinusZero);
         break;
-      case Kind::kBoolean:
+      case JSPrimitiveKind::kBoolean:
         DCHECK_EQ(input_rep, RegisterRepresentation::Word32());
         DCHECK(ValidOpInputRep(graph, input(), input_rep));
         DCHECK_EQ(minus_zero_mode,
                   CheckForMinusZeroMode::kDontCheckForMinusZero);
         break;
-      case Kind::kNumber:
-      case Kind::kHeapNumber:
+      case JSPrimitiveKind::kNumber:
+      case JSPrimitiveKind::kHeapNumber:
         DCHECK(ValidOpInputRep(graph, input(), input_rep));
         DCHECK_IMPLIES(
             minus_zero_mode == CheckForMinusZeroMode::kCheckForMinusZero,
             input_rep == RegisterRepresentation::Float64());
         break;
-      case Kind::kSmi:
+      case JSPrimitiveKind::kSmi:
         DCHECK_EQ(input_rep, WordRepresentation::Word32());
         DCHECK_EQ(minus_zero_mode,
                   CheckForMinusZeroMode::kDontCheckForMinusZero);
         DCHECK(ValidOpInputRep(graph, input(), input_rep));
         break;
-      case Kind::kString:
+      case JSPrimitiveKind::kString:
         DCHECK_EQ(input_rep, WordRepresentation::Word32());
         DCHECK_EQ(input_interpretation,
                   any_of(InputInterpretation::kCharCode,
@@ -2585,34 +4128,42 @@ struct ConvertToObjectOp : FixedArityOperationT<1, ConvertToObjectOp> {
     return std::tuple{kind, input_rep, input_interpretation, minus_zero_mode};
   }
 };
-std::ostream& operator<<(std::ostream& os, ConvertToObjectOp::Kind kind);
+std::ostream& operator<<(std::ostream& os,
+                         ConvertUntaggedToJSPrimitiveOp::JSPrimitiveKind kind);
 
-struct ConvertToObjectOrDeoptOp
-    : FixedArityOperationT<2, ConvertToObjectOrDeoptOp> {
-  enum class Kind : uint8_t {
+struct ConvertUntaggedToJSPrimitiveOrDeoptOp
+    : FixedArityOperationT<2, ConvertUntaggedToJSPrimitiveOrDeoptOp> {
+  enum class JSPrimitiveKind : uint8_t {
     kSmi,
   };
   enum class InputInterpretation : uint8_t {
     kSigned,
     kUnsigned,
   };
-  Kind kind;
+  JSPrimitiveKind kind;
   RegisterRepresentation input_rep;
   InputInterpretation input_interpretation;
   FeedbackSource feedback;
 
-  static constexpr OpProperties properties = OpProperties::CanAbort();
+  // We currently only convert Word representations to Smi or deopt. We need to
+  // change the effects if we add more kinds.
+  static constexpr OpEffects effects = OpEffects().CanDeopt();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(input_rep);
+  }
+
   OpIndex input() const { return Base::input(0); }
   OpIndex frame_state() const { return Base::input(1); }
 
-  ConvertToObjectOrDeoptOp(OpIndex input, OpIndex frame_state, Kind kind,
-                           RegisterRepresentation input_rep,
-                           InputInterpretation input_interpretation,
-                           const FeedbackSource& feedback)
+  ConvertUntaggedToJSPrimitiveOrDeoptOp(
+      OpIndex input, OpIndex frame_state, JSPrimitiveKind kind,
+      RegisterRepresentation input_rep,
+      InputInterpretation input_interpretation, const FeedbackSource& feedback)
       : Base(input, frame_state),
         kind(kind),
         input_rep(input_rep),
@@ -2621,20 +4172,23 @@ struct ConvertToObjectOrDeoptOp
 
   void Validate(const Graph& graph) const {
     DCHECK(ValidOpInputRep(graph, input(), input_rep));
+    DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
   }
 
   auto options() const {
     return std::tuple{kind, input_rep, input_interpretation, feedback};
   }
 };
-std::ostream& operator<<(std::ostream& os, ConvertToObjectOrDeoptOp::Kind kind);
 std::ostream& operator<<(
     std::ostream& os,
-    ConvertToObjectOrDeoptOp::InputInterpretation input_interpretation);
+    ConvertUntaggedToJSPrimitiveOrDeoptOp::JSPrimitiveKind kind);
+std::ostream& operator<<(
+    std::ostream& os, ConvertUntaggedToJSPrimitiveOrDeoptOp::InputInterpretation
+                          input_interpretation);
 
-struct ConvertObjectToPrimitiveOp
-    : FixedArityOperationT<1, ConvertObjectToPrimitiveOp> {
-  enum class Kind : uint8_t {
+struct ConvertJSPrimitiveToUntaggedOp
+    : FixedArityOperationT<1, ConvertJSPrimitiveToUntaggedOp> {
+  enum class UntaggedKind : uint8_t {
     kInt32,
     kInt64,
     kUint32,
@@ -2642,31 +4196,42 @@ struct ConvertObjectToPrimitiveOp
     kFloat64,
   };
   enum class InputAssumptions : uint8_t {
-    kObject,
+    kBoolean,
     kSmi,
     kNumberOrOddball,
+    kPlainPrimitive,
   };
-  Kind kind;
+  UntaggedKind kind;
   InputAssumptions input_assumptions;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  // This operation can read memory, but only immutable aspects, so it counts as
+  // pure.
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We might rely on preceding checks to avoid deopts.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     switch (kind) {
-      case Kind::kInt32:
-      case Kind::kUint32:
-      case Kind::kBit:
+      case UntaggedKind::kInt32:
+      case UntaggedKind::kUint32:
+      case UntaggedKind::kBit:
         return RepVector<RegisterRepresentation::Word32()>();
-      case Kind::kInt64:
+      case UntaggedKind::kInt64:
         return RepVector<RegisterRepresentation::Word64()>();
-      case Kind::kFloat64:
+      case UntaggedKind::kFloat64:
         return RepVector<RegisterRepresentation::Float64()>();
     }
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex input() const { return Base::input(0); }
 
-  ConvertObjectToPrimitiveOp(OpIndex input, Kind kind,
-                             InputAssumptions input_assumptions)
+  ConvertJSPrimitiveToUntaggedOp(OpIndex input, UntaggedKind kind,
+                                 InputAssumptions input_assumptions)
       : Base(input), kind(kind), input_assumptions(input_assumptions) {}
   void Validate(const Graph& graph) const {
     DCHECK(ValidOpInputRep(graph, input(), RegisterRepresentation::Tagged()));
@@ -2675,53 +4240,61 @@ struct ConvertObjectToPrimitiveOp
   auto options() const { return std::tuple{kind, input_assumptions}; }
 };
 std::ostream& operator<<(std::ostream& os,
-                         ConvertObjectToPrimitiveOp::Kind kind);
+                         ConvertJSPrimitiveToUntaggedOp::UntaggedKind kind);
 std::ostream& operator<<(
     std::ostream& os,
-    ConvertObjectToPrimitiveOp::InputAssumptions input_assumptions);
+    ConvertJSPrimitiveToUntaggedOp::InputAssumptions input_assumptions);
 
-struct ConvertObjectToPrimitiveOrDeoptOp
-    : FixedArityOperationT<2, ConvertObjectToPrimitiveOrDeoptOp> {
-  enum class PrimitiveKind : uint8_t {
+struct ConvertJSPrimitiveToUntaggedOrDeoptOp
+    : FixedArityOperationT<2, ConvertJSPrimitiveToUntaggedOrDeoptOp> {
+  enum class UntaggedKind : uint8_t {
     kInt32,
     kInt64,
     kFloat64,
     kArrayIndex,
   };
-  enum class ObjectKind : uint8_t {
+  enum class JSPrimitiveKind : uint8_t {
     kNumber,
     kNumberOrBoolean,
     kNumberOrOddball,
     kNumberOrString,
     kSmi,
   };
-  ObjectKind from_kind;
-  PrimitiveKind to_kind;
+  JSPrimitiveKind from_kind;
+  UntaggedKind to_kind;
   CheckForMinusZeroMode minus_zero_mode;
   FeedbackSource feedback;
 
-  static constexpr OpProperties properties = OpProperties::ReadingAndCanAbort();
+  // This operation can read memory, but only immutable aspects, so it counts as
+  // pure.
+  static constexpr OpEffects effects = OpEffects().CanDeopt();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     switch (to_kind) {
-      case PrimitiveKind::kInt32:
+      case UntaggedKind::kInt32:
         return RepVector<RegisterRepresentation::Word32()>();
-      case PrimitiveKind::kInt64:
+      case UntaggedKind::kInt64:
         return RepVector<RegisterRepresentation::Word64()>();
-      case PrimitiveKind::kFloat64:
+      case UntaggedKind::kFloat64:
         return RepVector<RegisterRepresentation::Float64()>();
-      case PrimitiveKind::kArrayIndex:
+      case UntaggedKind::kArrayIndex:
         return Is64() ? RepVector<RegisterRepresentation::Word64()>()
                       : RepVector<RegisterRepresentation::Word32()>();
     }
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex input() const { return Base::input(0); }
   OpIndex frame_state() const { return Base::input(1); }
 
-  ConvertObjectToPrimitiveOrDeoptOp(OpIndex input, OpIndex frame_state,
-                                    ObjectKind from_kind, PrimitiveKind to_kind,
-                                    CheckForMinusZeroMode minus_zero_mode,
-                                    const FeedbackSource& feedback)
+  ConvertJSPrimitiveToUntaggedOrDeoptOp(OpIndex input, OpIndex frame_state,
+                                        JSPrimitiveKind from_kind,
+                                        UntaggedKind to_kind,
+                                        CheckForMinusZeroMode minus_zero_mode,
+                                        const FeedbackSource& feedback)
       : Base(input, frame_state),
         from_kind(from_kind),
         to_kind(to_kind),
@@ -2736,14 +4309,15 @@ struct ConvertObjectToPrimitiveOrDeoptOp
     return std::tuple{from_kind, to_kind, minus_zero_mode, feedback};
   }
 };
-std::ostream& operator<<(std::ostream& os,
-                         ConvertObjectToPrimitiveOrDeoptOp::ObjectKind kind);
-std::ostream& operator<<(std::ostream& os,
-                         ConvertObjectToPrimitiveOrDeoptOp::PrimitiveKind kind);
+std::ostream& operator<<(
+    std::ostream& os,
+    ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind kind);
+std::ostream& operator<<(
+    std::ostream& os, ConvertJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind kind);
 
-struct TruncateObjectToPrimitiveOp
-    : FixedArityOperationT<1, TruncateObjectToPrimitiveOp> {
-  enum class Kind : uint8_t {
+struct TruncateJSPrimitiveToUntaggedOp
+    : FixedArityOperationT<1, TruncateJSPrimitiveToUntaggedOp> {
+  enum class UntaggedKind : uint8_t {
     kInt32,
     kInt64,
     kBit,
@@ -2754,24 +4328,34 @@ struct TruncateObjectToPrimitiveOp
     kHeapObject,
     kObject,
   };
-  Kind kind;
+  UntaggedKind kind;
   InputAssumptions input_assumptions;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  // This operation can read memory, but only immutable aspects, so it counts as
+  // pure.
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We might rely on preceding checks to ensure the input type.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     switch (kind) {
-      case Kind::kInt32:
-      case Kind::kBit:
+      case UntaggedKind::kInt32:
+      case UntaggedKind::kBit:
         return RepVector<RegisterRepresentation::Word32()>();
-      case Kind::kInt64:
+      case UntaggedKind::kInt64:
         return RepVector<RegisterRepresentation::Word64()>();
     }
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex input() const { return Base::input(0); }
 
-  TruncateObjectToPrimitiveOp(OpIndex input, Kind kind,
-                              InputAssumptions input_assumptions)
+  TruncateJSPrimitiveToUntaggedOp(OpIndex input, UntaggedKind kind,
+                                  InputAssumptions input_assumptions)
       : Base(input), kind(kind), input_assumptions(input_assumptions) {}
   void Validate(const Graph& graph) const {
     DCHECK(ValidOpInputRep(graph, input(), RegisterRepresentation::Tagged()));
@@ -2780,60 +4364,108 @@ struct TruncateObjectToPrimitiveOp
   auto options() const { return std::tuple{kind, input_assumptions}; }
 };
 std::ostream& operator<<(std::ostream& os,
-                         TruncateObjectToPrimitiveOp::Kind kind);
+                         TruncateJSPrimitiveToUntaggedOp::UntaggedKind kind);
 std::ostream& operator<<(
     std::ostream& os,
-    TruncateObjectToPrimitiveOp::InputAssumptions input_assumptions);
-
-enum class TagKind {
-  kSmiTag,
-};
-std::ostream& operator<<(std::ostream& os, TagKind kind);
+    TruncateJSPrimitiveToUntaggedOp::InputAssumptions input_assumptions);
 
-struct TagOp : FixedArityOperationT<1, TagOp> {
-  TagKind kind;
+struct TruncateJSPrimitiveToUntaggedOrDeoptOp
+    : FixedArityOperationT<2, TruncateJSPrimitiveToUntaggedOrDeoptOp> {
+  enum class UntaggedKind : uint8_t {
+    kInt32,
+  };
+  using InputRequirement =
+      ConvertJSPrimitiveToUntaggedOrDeoptOp::JSPrimitiveKind;
+  UntaggedKind kind;
+  InputRequirement input_requirement;
+  FeedbackSource feedback;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects().CanDeopt();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
-    return RepVector<RegisterRepresentation::Tagged()>();
+    switch (kind) {
+      case UntaggedKind::kInt32:
+        return RepVector<RegisterRepresentation::Word32()>();
+    }
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
   }
 
   OpIndex input() const { return Base::input(0); }
+  OpIndex frame_state() const { return Base::input(1); }
 
-  TagOp(OpIndex input, TagKind kind) : Base(input), kind(kind) {}
+  TruncateJSPrimitiveToUntaggedOrDeoptOp(OpIndex input, OpIndex frame_state,
+                                         UntaggedKind kind,
+                                         InputRequirement input_requirement,
+                                         const FeedbackSource& feedback)
+      : Base(input, frame_state),
+        kind(kind),
+        input_requirement(input_requirement),
+        feedback(feedback) {}
   void Validate(const Graph& graph) const {
-    DCHECK(ValidOpInputRep(graph, input(), RegisterRepresentation::Word32()));
+    DCHECK(ValidOpInputRep(graph, input(), RegisterRepresentation::Tagged()));
+    DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
   }
 
-  auto options() const { return std::tuple{kind}; }
+  auto options() const { return std::tuple{kind, input_requirement, feedback}; }
 };
+std::ostream& operator<<(
+    std::ostream& os,
+    TruncateJSPrimitiveToUntaggedOrDeoptOp::UntaggedKind kind);
 
-struct UntagOp : FixedArityOperationT<1, UntagOp> {
-  TagKind kind;
-  RegisterRepresentation rep;
+struct ConvertJSPrimitiveToObjectOp
+    : FixedArityOperationT<2, ConvertJSPrimitiveToObjectOp> {
+  ConvertReceiverMode mode;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
-    return base::VectorOf(&rep, 1);
+    return RepVector<RegisterRepresentation::Tagged()>();
   }
 
-  OpIndex input() const { return Base::input(0); }
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex value() const { return Base::input(0); }
+  OpIndex global_proxy() const { return Base::input(1); }
+
+  ConvertJSPrimitiveToObjectOp(OpIndex value, OpIndex global_proxy,
+                               ConvertReceiverMode mode)
+      : Base(value, global_proxy), mode(mode) {}
 
-  UntagOp(OpIndex input, TagKind kind, RegisterRepresentation rep)
-      : Base(input), kind(kind), rep(rep) {}
   void Validate(const Graph& graph) const {
-    DCHECK(ValidOpInputRep(graph, input(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, value(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, global_proxy(),
+                           RegisterRepresentation::Tagged()));
   }
 
-  auto options() const { return std::tuple{kind, rep}; }
+  auto options() const { return std::tuple{mode}; }
 };
 
 struct NewConsStringOp : FixedArityOperationT<3, NewConsStringOp> {
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // Strings are conceptually immutable and don't have identity.
+          .CanAllocateWithoutIdentity()
+          // We might rely on preceding checks to ensure the input is a string
+          // and on their combined length being between ConsString::kMinLength
+          // and ConsString::kMaxLength.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Word32(),
+                          MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex length() const { return Base::input(0); }
   OpIndex first() const { return Base::input(1); }
   OpIndex second() const { return Base::input(2); }
@@ -2857,11 +4489,22 @@ struct NewArrayOp : FixedArityOperationT<1, NewArrayOp> {
   Kind kind;
   AllocationType allocation_type;
 
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // Allocate the result, which has identity.
+          .CanAllocate()
+          // We might have checks to ensure the array length is valid and not
+          // too big.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::PointerSized()>();
+  }
+
   OpIndex length() const { return Base::input(0); }
 
   NewArrayOp(OpIndex length, Kind kind, AllocationType allocation_type)
@@ -2882,11 +4525,23 @@ struct DoubleArrayMinMaxOp : FixedArityOperationT<1, DoubleArrayMinMaxOp> {
   };
   Kind kind;
 
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // Read the array contents.
+          .CanReadHeapMemory()
+          // Allocate the HeapNumber result.
+          .CanAllocateWithoutIdentity()
+          // We might depend on checks to ensure the input is an array.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex array() const { return Base::input(0); }
 
   DoubleArrayMinMaxOp(OpIndex array, Kind kind) : Base(array), kind(kind) {}
@@ -2901,11 +4556,24 @@ std::ostream& operator<<(std::ostream& os, DoubleArrayMinMaxOp::Kind kind);
 // TODO(nicohartmann@): We should consider getting rid of the LoadFieldByIndex
 // operation.
 struct LoadFieldByIndexOp : FixedArityOperationT<2, LoadFieldByIndexOp> {
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // Read the possibly mutable property.
+          .CanReadHeapMemory()
+          // We may allocate heap number for the result.
+          .CanAllocateWithoutIdentity()
+          // We assume the input is an object.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Word32()>();
+  }
+
   OpIndex object() const { return Base::input(0); }
   // Index encoding (see `src/objects/field-index-inl.h`):
   // For efficiency, the LoadByFieldIndex instruction takes an index that is
@@ -2926,9 +4594,13 @@ struct LoadFieldByIndexOp : FixedArityOperationT<2, LoadFieldByIndexOp> {
 };
 
 struct DebugBreakOp : FixedArityOperationT<0, DebugBreakOp> {
-  static constexpr OpProperties properties = OpProperties::AnySideEffects();
-  base::Vector<const RegisterRepresentation> outputs_rep() const {
-    return RepVector<>();
+  // Prevent any reordering.
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
   }
 
   DebugBreakOp() : Base() {}
@@ -2937,6 +4609,34 @@ struct DebugBreakOp : FixedArityOperationT<0, DebugBreakOp> {
   auto options() const { return std::tuple{}; }
 };
 
+struct DebugPrintOp : FixedArityOperationT<1, DebugPrintOp> {
+  RegisterRepresentation rep;
+
+  // We just need to ensure that the debug print stays in the same block and
+  // observes the right memory state. It doesn't actually change control flow,
+  // but pretending so ensures the we do not remove the debug print even though
+  // it is unused. We assume that the debug print doesn't affect memory so that
+  // the scheduling of loads is not affected.
+  static constexpr OpEffects effects =
+      OpEffects().CanChangeControlFlow().CanDependOnChecks().CanReadMemory();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InputsRepFactory::SingleRep(rep);
+  }
+
+  OpIndex input() const { return Base::input(0); }
+
+  DebugPrintOp(OpIndex input, RegisterRepresentation rep)
+      : Base(input), rep(rep) {}
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, input(), rep));
+  }
+
+  auto options() const { return std::tuple{rep}; }
+};
+
 struct BigIntBinopOp : FixedArityOperationT<3, BigIntBinopOp> {
   enum class Kind : uint8_t {
     kAdd,
@@ -2952,13 +4652,22 @@ struct BigIntBinopOp : FixedArityOperationT<3, BigIntBinopOp> {
   };
   Kind kind;
 
-  // TODO(nicohartmann@): Maybe we can specify more precise properties here.
   // These operations can deopt (abort), allocate and read immutable data.
-  static constexpr OpProperties properties = OpProperties::AnySideEffects();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // Allocate the resulting BigInt, which does not have identity.
+          .CanAllocateWithoutIdentity()
+          .CanDeopt();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex left() const { return Base::input(0); }
   OpIndex right() const { return Base::input(1); }
   OpIndex frame_state() const { return Base::input(2); }
@@ -2976,11 +4685,20 @@ struct BigIntBinopOp : FixedArityOperationT<3, BigIntBinopOp> {
 std::ostream& operator<<(std::ostream& os, BigIntBinopOp::Kind kind);
 
 struct BigIntEqualOp : FixedArityOperationT<2, BigIntEqualOp> {
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We rely on the inputs having BigInt type.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex left() const { return Base::input(0); }
   OpIndex right() const { return Base::input(1); }
 
@@ -3001,11 +4719,20 @@ struct BigIntComparisonOp : FixedArityOperationT<2, BigIntComparisonOp> {
   };
   Kind kind;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We rely on the inputs having BigInt type.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex left() const { return Base::input(0); }
   OpIndex right() const { return Base::input(1); }
 
@@ -3027,11 +4754,22 @@ struct BigIntUnaryOp : FixedArityOperationT<1, BigIntUnaryOp> {
   };
   Kind kind;
 
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // BigInt content is immutable, the allocated result does not have
+          // identity.
+          .CanAllocateWithoutIdentity()
+          // We rely on the input being a BigInt.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex input() const { return Base::input(0); }
 
   BigIntUnaryOp(OpIndex input, Kind kind) : Base(input), kind(kind) {}
@@ -3045,11 +4783,16 @@ struct BigIntUnaryOp : FixedArityOperationT<1, BigIntUnaryOp> {
 std::ostream& operator<<(std::ostream& os, BigIntUnaryOp::Kind kind);
 
 struct LoadRootRegisterOp : FixedArityOperationT<0, LoadRootRegisterOp> {
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects = OpEffects();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::PointerSized()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
   LoadRootRegisterOp() : Base() {}
   void Validate(const Graph& graph) const {}
   std::tuple<> options() const { return {}; }
@@ -3062,11 +4805,21 @@ struct StringAtOp : FixedArityOperationT<2, StringAtOp> {
   };
   Kind kind;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects =
+      // String content is immutable, so this operation is pure.
+      OpEffects()
+          // We rely on the input being a string.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Word32()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::PointerSized()>();
+  }
+
   OpIndex string() const { return Base::input(0); }
   OpIndex position() const { return Base::input(1); }
 
@@ -3091,11 +4844,22 @@ struct StringToCaseIntlOp : FixedArityOperationT<1, StringToCaseIntlOp> {
   };
   Kind kind;
 
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // String content is immutable, the allocated result does not have
+          // identity.
+          .CanAllocateWithoutIdentity()
+          // We rely on the input being a string.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex string() const { return Base::input(0); }
 
   StringToCaseIntlOp(OpIndex string, Kind kind) : Base(string), kind(kind) {}
@@ -3110,11 +4874,20 @@ std::ostream& operator<<(std::ostream& os, StringToCaseIntlOp::Kind kind);
 #endif  // V8_INTL_SUPPORT
 
 struct StringLengthOp : FixedArityOperationT<1, StringLengthOp> {
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects =
+      // String content is immutable, so this operation is pure.
+      OpEffects()
+          // We rely on the input being a string.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Word32()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex string() const { return Base::input(0); }
 
   explicit StringLengthOp(OpIndex string) : Base(string) {}
@@ -3127,11 +4900,24 @@ struct StringLengthOp : FixedArityOperationT<1, StringLengthOp> {
 };
 
 struct StringIndexOfOp : FixedArityOperationT<3, StringIndexOfOp> {
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // String content is immutable, the allocated result does not have
+          // identity.
+          .CanAllocateWithoutIdentity()
+          // We rely on the inputs being strings.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
   // Search the string `search` within the string `string` starting at
   // `position`.
   OpIndex string() const { return Base::input(0); }
@@ -3153,11 +4939,23 @@ struct StringIndexOfOp : FixedArityOperationT<3, StringIndexOfOp> {
 
 struct StringFromCodePointAtOp
     : FixedArityOperationT<2, StringFromCodePointAtOp> {
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // String content is immutable, the allocated result does not have
+          // identity.
+          .CanAllocateWithoutIdentity()
+          // We rely on the input being in a certain char range.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::PointerSized()>();
+  }
+
   OpIndex string() const { return Base::input(0); }
   OpIndex index() const { return Base::input(1); }
 
@@ -3174,11 +4972,24 @@ struct StringFromCodePointAtOp
 };
 
 struct StringSubstringOp : FixedArityOperationT<3, StringSubstringOp> {
-  static constexpr OpProperties properties = OpProperties::PureMayAllocate();
+  static constexpr OpEffects effects =
+      OpEffects()
+          // String content is immutable, the allocated result does not have
+          // identity.
+          .CanAllocateWithoutIdentity()
+          // We rely on the input being a string.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Word32(),
+                          MaybeRegisterRepresentation::Word32()>();
+  }
+
   OpIndex string() const { return Base::input(0); }
   OpIndex start() const { return Base::input(1); }
   OpIndex end() const { return Base::input(2); }
@@ -3195,12 +5006,53 @@ struct StringSubstringOp : FixedArityOperationT<3, StringSubstringOp> {
   auto options() const { return std::tuple{}; }
 };
 
+struct StringConcatOp : FixedArityOperationT<2, StringConcatOp> {
+  static constexpr OpEffects effects =
+      OpEffects()
+          // String content is immutable, the allocated result does not have
+          // identity.
+          .CanAllocateWithoutIdentity()
+          // We rely on the inputs being strings.
+          .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex left() const { return Base::input(0); }
+  OpIndex right() const { return Base::input(1); }
+
+  StringConcatOp(OpIndex left, OpIndex right) : Base(left, right) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, left(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, right(), RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{}; }
+};
+
 struct StringEqualOp : FixedArityOperationT<2, StringEqualOp> {
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects =
+      // String content is immutable, so the operation is pure.
+      OpEffects()
+          // We rely on the input being strings.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex left() const { return Base::input(0); }
   OpIndex right() const { return Base::input(1); }
 
@@ -3221,11 +5073,21 @@ struct StringComparisonOp : FixedArityOperationT<2, StringComparisonOp> {
   };
   Kind kind;
 
-  static constexpr OpProperties properties = OpProperties::PureNoAllocation();
+  static constexpr OpEffects effects =
+      // String content is immutable, so the operation is pure.
+      OpEffects()
+          // We rely on the input being strings.
+          .CanDependOnChecks();
   base::Vector<const RegisterRepresentation> outputs_rep() const {
     return RepVector<RegisterRepresentation::Tagged()>();
   }
 
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
   OpIndex left() const { return Base::input(0); }
   OpIndex right() const { return Base::input(1); }
 
@@ -3241,78 +5103,2204 @@ struct StringComparisonOp : FixedArityOperationT<2, StringComparisonOp> {
 };
 std::ostream& operator<<(std::ostream& os, StringComparisonOp::Kind kind);
 
-#define OPERATION_PROPERTIES_CASE(Name) Name##Op::PropertiesIfStatic(),
-static constexpr base::Optional<OpProperties>
-    kOperationPropertiesTable[kNumberOfOpcodes] = {
-        TURBOSHAFT_OPERATION_LIST(OPERATION_PROPERTIES_CASE)};
-#undef OPERATION_PROPERTIES_CASE
+struct ArgumentsLengthOp : FixedArityOperationT<0, ArgumentsLengthOp> {
+  enum class Kind : uint8_t {
+    kArguments,
+    kRest,
+  };
+  Kind kind;
+  int formal_parameter_count =
+      0;  // This field is unused for kind == kArguments.
 
-template <class Op>
-struct operation_to_opcode_map {};
+  static constexpr OpEffects effects = OpEffects();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
 
-#define OPERATION_OPCODE_MAP_CASE(Name)    \
-  template <>                              \
-  struct operation_to_opcode_map<Name##Op> \
-      : std::integral_constant<Opcode, Opcode::k##Name> {};
-TURBOSHAFT_OPERATION_LIST(OPERATION_OPCODE_MAP_CASE)
-#undef OPERATION_OPCODE_MAP_CASE
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
 
-template <class Op>
-const Opcode OperationT<Op>::opcode = operation_to_opcode_map<Op>::value;
+  explicit ArgumentsLengthOp(Kind kind, int formal_parameter_count)
+      : Base(), kind(kind), formal_parameter_count(formal_parameter_count) {
+    DCHECK_IMPLIES(kind == Kind::kArguments, formal_parameter_count == 0);
+  }
 
-template <class Op, class = void>
-struct static_operation_input_count : std::integral_constant<uint32_t, 0> {};
-template <class Op>
-struct static_operation_input_count<Op, std::void_t<decltype(Op::inputs)>>
-    : std::integral_constant<uint32_t, sizeof(Op::inputs) / sizeof(OpIndex)> {};
-constexpr size_t kOperationSizeTable[kNumberOfOpcodes] = {
-#define OPERATION_SIZE(Name) sizeof(Name##Op),
-    TURBOSHAFT_OPERATION_LIST(OPERATION_SIZE)
-#undef OPERATION_SIZE
-};
-constexpr size_t kOperationSizeDividedBySizeofOpIndexTable[kNumberOfOpcodes] = {
-#define OPERATION_SIZE(Name) (sizeof(Name##Op) / sizeof(OpIndex)),
-    TURBOSHAFT_OPERATION_LIST(OPERATION_SIZE)
-#undef OPERATION_SIZE
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind, formal_parameter_count}; }
 };
+std::ostream& operator<<(std::ostream& os, ArgumentsLengthOp::Kind kind);
+
+struct NewArgumentsElementsOp
+    : FixedArityOperationT<1, NewArgumentsElementsOp> {
+  CreateArgumentsType type;
+  int formal_parameter_count;
+
+  static constexpr OpEffects effects =
+      OpEffects()
+          // Allocate the fixed array, which has identity.
+          .CanAllocate()
+          // Do not move the allocation before checks/branches.
+          .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
 
-inline base::Vector<const OpIndex> Operation::inputs() const {
-  // This is actually undefined behavior, since we use the `this` pointer to
-  // access an adjacent object.
-  const OpIndex* ptr = reinterpret_cast<const OpIndex*>(
-      reinterpret_cast<const char*>(this) +
-      kOperationSizeTable[OpcodeIndex(opcode)]);
-  return {ptr, input_count};
-}
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
 
-inline OpProperties Operation::Properties() const {
-  if (auto prop = kOperationPropertiesTable[OpcodeIndex(opcode)]) {
-    return *prop;
+  OpIndex arguments_count() const { return Base::input(0); }
+
+  NewArgumentsElementsOp(OpIndex arguments_count, CreateArgumentsType type,
+                         int formal_parameter_count)
+      : Base(arguments_count),
+        type(type),
+        formal_parameter_count(formal_parameter_count) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, arguments_count(),
+                           RegisterRepresentation::Tagged()));
   }
-  switch (opcode) {
-    case Opcode::kLoad:
-      return Cast<LoadOp>().Properties();
-    case Opcode::kStore:
-      return Cast<StoreOp>().Properties();
-    default:
-      UNREACHABLE();
+
+  auto options() const { return std::tuple{type, formal_parameter_count}; }
+};
+
+inline constexpr RegisterRepresentation RegisterRepresentationForArrayType(
+    ExternalArrayType array_type) {
+  switch (array_type) {
+    case kExternalInt8Array:
+    case kExternalUint8Array:
+    case kExternalUint8ClampedArray:
+    case kExternalInt16Array:
+    case kExternalUint16Array:
+    case kExternalInt32Array:
+    case kExternalUint32Array:
+      return RegisterRepresentation::Word32();
+    case kExternalFloat32Array:
+      return RegisterRepresentation::Float32();
+    case kExternalFloat64Array:
+      return RegisterRepresentation::Float64();
+    case kExternalBigInt64Array:
+    case kExternalBigUint64Array:
+      return RegisterRepresentation::Word64();
   }
 }
 
-// static
-inline size_t Operation::StorageSlotCount(Opcode opcode, size_t input_count) {
-  size_t size = kOperationSizeDividedBySizeofOpIndexTable[OpcodeIndex(opcode)];
-  constexpr size_t r = sizeof(OperationStorageSlot) / sizeof(OpIndex);
-  static_assert(sizeof(OperationStorageSlot) % sizeof(OpIndex) == 0);
-  return std::max<size_t>(2, (r - 1 + size + input_count) / r);
+inline base::Vector<const RegisterRepresentation> VectorForRep(
+    RegisterRepresentation rep) {
+  static constexpr std::array<RegisterRepresentation, 6> table{
+      RegisterRepresentation::Word32(),  RegisterRepresentation::Word64(),
+      RegisterRepresentation::Float32(), RegisterRepresentation::Float64(),
+      RegisterRepresentation::Tagged(),  RegisterRepresentation::Compressed()};
+  return base::VectorOf(&table[static_cast<size_t>(rep.value())], 1);
 }
 
-template <class Op>
-V8_INLINE bool CanBeUsedAsInput(const Op& op) {
-  if (std::is_same<Op, FrameStateOp>::value) {
-    // FrameStateOp is the only Operation that can be used as an input but has
-    // empty `outputs_rep`.
-    return true;
+struct LoadTypedElementOp : FixedArityOperationT<4, LoadTypedElementOp> {
+  ExternalArrayType array_type;
+
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We read mutable memory.
+          .CanReadMemory()
+          // We rely on the input type and a valid index.
+          .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return VectorForRep(RegisterRepresentationForArrayType(array_type));
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::PointerSized(),
+                          MaybeRegisterRepresentation::PointerSized()>();
+  }
+
+  OpIndex buffer() const { return Base::input(0); }
+  OpIndex base() const { return Base::input(1); }
+  OpIndex external() const { return Base::input(2); }
+  OpIndex index() const { return Base::input(3); }
+
+  LoadTypedElementOp(OpIndex buffer, OpIndex base, OpIndex external,
+                     OpIndex index, ExternalArrayType array_type)
+      : Base(buffer, base, external, index), array_type(array_type) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, buffer(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, base(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, external(),
+                           RegisterRepresentation::PointerSized()));
+    DCHECK(ValidOpInputRep(graph, index(),
+                           RegisterRepresentation::PointerSized()));
+  }
+
+  auto options() const { return std::tuple{array_type}; }
+};
+
+struct LoadDataViewElementOp : FixedArityOperationT<4, LoadDataViewElementOp> {
+  ExternalArrayType element_type;
+
+  static constexpr OpEffects effects = OpEffects()
+                                           // We read mutable memory.
+                                           .CanReadMemory()
+                                           // We rely on the input type.
+                                           .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return VectorForRep(RegisterRepresentationForArrayType(element_type));
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::PointerSized(),
+                          MaybeRegisterRepresentation::Word32()>();
+  }
+
+  OpIndex object() const { return Base::input(0); }
+  OpIndex storage() const { return Base::input(1); }
+  OpIndex index() const { return Base::input(2); }
+  OpIndex is_little_endian() const { return Base::input(3); }
+
+  LoadDataViewElementOp(OpIndex object, OpIndex storage, OpIndex index,
+                        OpIndex is_little_endian,
+                        ExternalArrayType element_type)
+      : Base(object, storage, index, is_little_endian),
+        element_type(element_type) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, object(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, storage(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, index(),
+                           RegisterRepresentation::PointerSized()));
+    DCHECK(ValidOpInputRep(graph, is_little_endian(),
+                           RegisterRepresentation::Word32()));
+  }
+
+  auto options() const { return std::tuple{element_type}; }
+};
+
+struct LoadStackArgumentOp : FixedArityOperationT<2, LoadStackArgumentOp> {
+  // Stack arguments are immutable, so reading them is pure.
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We rely on the input being in bounds.
+          .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::PointerSized(),
+                          MaybeRegisterRepresentation::PointerSized()>();
+  }
+
+  OpIndex base() const { return Base::input(0); }
+  OpIndex index() const { return Base::input(1); }
+
+  LoadStackArgumentOp(OpIndex base, OpIndex index) : Base(base, index) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(
+        ValidOpInputRep(graph, base(), RegisterRepresentation::PointerSized()));
+    DCHECK(ValidOpInputRep(graph, index(),
+                           RegisterRepresentation::PointerSized()));
+  }
+
+  auto options() const { return std::tuple{}; }
+};
+
+struct StoreTypedElementOp : FixedArityOperationT<5, StoreTypedElementOp> {
+  ExternalArrayType array_type;
+
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We are reading the backing store pointer and writing into it.
+          .CanReadMemory()
+          .CanWriteMemory()
+          // We rely on the input type and a valid index.
+          .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InitVectorOf(
+        storage,
+        {RegisterRepresentation::Tagged(), RegisterRepresentation::Tagged(),
+         RegisterRepresentation::PointerSized(),
+         RegisterRepresentation::PointerSized(),
+         RegisterRepresentationForArrayType(array_type)});
+  }
+
+  OpIndex buffer() const { return Base::input(0); }
+  OpIndex base() const { return Base::input(1); }
+  OpIndex external() const { return Base::input(2); }
+  OpIndex index() const { return Base::input(3); }
+  OpIndex value() const { return Base::input(4); }
+
+  StoreTypedElementOp(OpIndex buffer, OpIndex base, OpIndex external,
+                      OpIndex index, OpIndex value,
+                      ExternalArrayType array_type)
+      : Base(buffer, base, external, index, value), array_type(array_type) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, buffer(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, base(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, external(),
+                           RegisterRepresentation::PointerSized()));
+    DCHECK(ValidOpInputRep(graph, index(),
+                           RegisterRepresentation::PointerSized()));
+    DCHECK(ValidOpInputRep(graph, value(),
+                           RegisterRepresentationForArrayType(array_type)));
+  }
+
+  auto options() const { return std::tuple{array_type}; }
+};
+
+struct StoreDataViewElementOp
+    : FixedArityOperationT<5, StoreDataViewElementOp> {
+  ExternalArrayType element_type;
+
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We are reading the backing store pointer and writing into it.
+          .CanReadMemory()
+          .CanWriteMemory()
+          // We rely on the input type and a valid index.
+          .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InitVectorOf(
+        storage,
+        {RegisterRepresentation::Tagged(), RegisterRepresentation::Tagged(),
+         RegisterRepresentation::PointerSized(),
+         RegisterRepresentationForArrayType(element_type),
+         RegisterRepresentation::Word32()});
+  }
+
+  OpIndex object() const { return Base::input(0); }
+  OpIndex storage() const { return Base::input(1); }
+  OpIndex index() const { return Base::input(2); }
+  OpIndex value() const { return Base::input(3); }
+  OpIndex is_little_endian() const { return Base::input(4); }
+
+  StoreDataViewElementOp(OpIndex object, OpIndex storage, OpIndex index,
+                         OpIndex value, OpIndex is_little_endian,
+                         ExternalArrayType element_type)
+      : Base(object, storage, index, value, is_little_endian),
+        element_type(element_type) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, object(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, storage(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, index(),
+                           RegisterRepresentation::PointerSized()));
+    DCHECK(ValidOpInputRep(graph, value(),
+                           RegisterRepresentationForArrayType(element_type)));
+    DCHECK(ValidOpInputRep(graph, is_little_endian(),
+                           RegisterRepresentation::Word32()));
+  }
+
+  auto options() const { return std::tuple{element_type}; }
+};
+
+struct TransitionAndStoreArrayElementOp
+    : FixedArityOperationT<3, TransitionAndStoreArrayElementOp> {
+  enum class Kind : uint8_t {
+    kElement,
+    kNumberElement,
+    kOddballElement,
+    kNonNumberElement,
+    kSignedSmallElement,
+  };
+  Kind kind;
+  MaybeHandle<Map> fast_map;
+  MaybeHandle<Map> double_map;
+
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We are reading and writing mutable memory.
+          .CanReadHeapMemory()
+          .CanWriteHeapMemory()
+          // We rely on the input type and a valid index.
+          .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InitVectorOf(storage, {RegisterRepresentation::Tagged(),
+                                  RegisterRepresentation::PointerSized(),
+                                  value_representation()});
+  }
+
+  OpIndex array() const { return Base::input(0); }
+  OpIndex index() const { return Base::input(1); }
+  OpIndex value() const { return Base::input(2); }
+
+  TransitionAndStoreArrayElementOp(OpIndex array, OpIndex index, OpIndex value,
+                                   Kind kind, MaybeHandle<Map> fast_map,
+                                   MaybeHandle<Map> double_map)
+      : Base(array, index, value),
+        kind(kind),
+        fast_map(fast_map),
+        double_map(double_map) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, array(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, index(),
+                           RegisterRepresentation::PointerSized()));
+    DCHECK(ValidOpInputRep(graph, value(), value_representation()));
+  }
+
+  RegisterRepresentation value_representation() const {
+    switch (kind) {
+      case Kind::kElement:
+      case Kind::kNonNumberElement:
+      case Kind::kOddballElement:
+        return RegisterRepresentation::Tagged();
+      case Kind::kNumberElement:
+        return RegisterRepresentation::Float64();
+      case Kind::kSignedSmallElement:
+        return RegisterRepresentation::Word32();
+    }
+  }
+
+  size_t hash_value() const {
+    return fast_hash_combine(kind, fast_map.address(), double_map.address());
+  }
+
+  bool operator==(const TransitionAndStoreArrayElementOp& other) const {
+    return kind == other.kind && fast_map.equals(other.fast_map) &&
+           double_map.equals(other.double_map);
+  }
+
+  auto options() const { return std::tuple{kind, fast_map, double_map}; }
+};
+std::ostream& operator<<(std::ostream& os,
+                         TransitionAndStoreArrayElementOp::Kind kind);
+
+struct CompareMapsOp : FixedArityOperationT<1, CompareMapsOp> {
+  ZoneRefSet<Map> maps;
+
+  static constexpr OpEffects effects = OpEffects().CanReadHeapMemory();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Word32()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex heap_object() const { return Base::input(0); }
+
+  CompareMapsOp(OpIndex heap_object, ZoneRefSet<Map> maps)
+      : Base(heap_object), maps(std::move(maps)) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, heap_object(),
+                           RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{maps}; }
+};
+
+struct CheckMapsOp : FixedArityOperationT<2, CheckMapsOp> {
+  ZoneRefSet<Map> maps;
+  CheckMapsFlags flags;
+  FeedbackSource feedback;
+
+  // TODO(tebbi): Map checks without map transitions have less effects.
+  static constexpr OpEffects effects = OpEffects()
+                                           .CanDependOnChecks()
+                                           .CanDeopt()
+                                           .CanReadHeapMemory()
+                                           .CanWriteHeapMemory();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex heap_object() const { return Base::input(0); }
+  OpIndex frame_state() const { return Base::input(1); }
+
+  CheckMapsOp(OpIndex heap_object, OpIndex frame_state, ZoneRefSet<Map> maps,
+              CheckMapsFlags flags, const FeedbackSource& feedback)
+      : Base(heap_object, frame_state),
+        maps(std::move(maps)),
+        flags(flags),
+        feedback(feedback) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, heap_object(),
+                           RegisterRepresentation::Tagged()));
+    DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
+  }
+
+  auto options() const { return std::tuple{maps, flags, feedback}; }
+};
+
+// AssumeMaps are inserted after CheckMaps have been lowered, in order to keep
+// map information around and easily accessible for subsequent optimization
+// passes (Load Elimination for instance can then use those AssumeMap to
+// determine that some objects don't alias because they have different maps).
+struct AssumeMapOp : FixedArityOperationT<1, AssumeMapOp> {
+  ZoneRefSet<Map> maps;
+  // AssumeMap should not be scheduled before the preceding CheckMaps
+  static constexpr OpEffects effects = OpEffects()
+                                           .CanDependOnChecks()
+                                           .CanReadHeapMemory()
+                                           .CanChangeControlFlow();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex heap_object() const { return Base::input(0); }
+
+  AssumeMapOp(OpIndex heap_object, ZoneRefSet<Map> maps)
+      : Base(heap_object), maps(std::move(maps)) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, heap_object(),
+                           RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{maps}; }
+};
+
+struct CheckedClosureOp : FixedArityOperationT<2, CheckedClosureOp> {
+  Handle<FeedbackCell> feedback_cell;
+
+  // We only check immutable aspects of the incoming value.
+  static constexpr OpEffects effects = OpEffects().CanDeopt();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex input() const { return Base::input(0); }
+  OpIndex frame_state() const { return Base::input(1); }
+
+  CheckedClosureOp(OpIndex input, OpIndex frame_state,
+                   Handle<FeedbackCell> feedback_cell)
+      : Base(input, frame_state), feedback_cell(feedback_cell) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, input(), RegisterRepresentation::Tagged()));
+    DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
+  }
+
+  bool operator==(const CheckedClosureOp& other) const {
+    return feedback_cell.address() == other.feedback_cell.address();
+  }
+  size_t hash_value() const {
+    return base::hash_value(feedback_cell.address());
+  }
+
+  auto options() const { return std::tuple{feedback_cell}; }
+};
+
+struct CheckEqualsInternalizedStringOp
+    : FixedArityOperationT<3, CheckEqualsInternalizedStringOp> {
+  static constexpr OpEffects effects = OpEffects().CanDeopt();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex expected() const { return Base::input(0); }
+  OpIndex value() const { return Base::input(1); }
+  OpIndex frame_state() const { return Base::input(2); }
+
+  CheckEqualsInternalizedStringOp(OpIndex expected, OpIndex value,
+                                  OpIndex frame_state)
+      : Base(expected, value, frame_state) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(
+        ValidOpInputRep(graph, expected(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, value(), RegisterRepresentation::Tagged()));
+    DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
+  }
+
+  auto options() const { return std::tuple{}; }
+};
+
+struct LoadMessageOp : FixedArityOperationT<1, LoadMessageOp> {
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We are reading the message from the isolate.
+          .CanReadOffHeapMemory();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::PointerSized()>();
+  }
+
+  OpIndex offset() const { return Base::input(0); }
+
+  explicit LoadMessageOp(OpIndex offset) : Base(offset) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, offset(),
+                           RegisterRepresentation::PointerSized()));
+  }
+
+  auto options() const { return std::tuple{}; }
+};
+
+struct StoreMessageOp : FixedArityOperationT<2, StoreMessageOp> {
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We are writing the message in the isolate.
+          .CanWriteOffHeapMemory();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::PointerSized(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex offset() const { return Base::input(0); }
+  OpIndex object() const { return Base::input(1); }
+
+  explicit StoreMessageOp(OpIndex offset, OpIndex object)
+      : Base(offset, object) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, offset(),
+                           RegisterRepresentation::PointerSized()));
+    DCHECK(ValidOpInputRep(graph, object(), RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{}; }
+};
+
+struct SameValueOp : FixedArityOperationT<2, SameValueOp> {
+  enum class Mode : uint8_t {
+    kSameValue,
+    kSameValueNumbersOnly,
+  };
+  Mode mode;
+
+  static constexpr OpEffects effects =
+      OpEffects()
+          // We might depend on the inputs being numbers.
+          .CanDependOnChecks();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex left() const { return Base::input(0); }
+  OpIndex right() const { return Base::input(1); }
+
+  SameValueOp(OpIndex left, OpIndex right, Mode mode)
+      : Base(left, right), mode(mode) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, left(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, right(), RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{mode}; }
+};
+std::ostream& operator<<(std::ostream& os, SameValueOp::Mode mode);
+
+struct Float64SameValueOp : FixedArityOperationT<2, Float64SameValueOp> {
+  static constexpr OpEffects effects = OpEffects();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Word32()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Float64(),
+                          MaybeRegisterRepresentation::Float64()>();
+  }
+
+  OpIndex left() const { return Base::input(0); }
+  OpIndex right() const { return Base::input(1); }
+
+  Float64SameValueOp(OpIndex left, OpIndex right) : Base(left, right) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, left(), RegisterRepresentation::Float64()));
+    DCHECK(ValidOpInputRep(graph, right(), RegisterRepresentation::Float64()));
+  }
+
+  auto options() const { return std::tuple{}; }
+};
+
+struct FastApiCallParameters : public NON_EXPORTED_BASE(ZoneObject) {
+  const FastApiCallFunctionVector c_functions;
+  fast_api_call::OverloadsResolutionResult resolution_result;
+
+  const CFunctionInfo* c_signature() const { return c_functions[0].signature; }
+
+  FastApiCallParameters(
+      const FastApiCallFunctionVector& c_functions,
+      const fast_api_call::OverloadsResolutionResult& resolution_result)
+      : c_functions(c_functions), resolution_result(resolution_result) {
+    DCHECK_LT(0, c_functions.size());
+  }
+
+  static const FastApiCallParameters* Create(
+      const FastApiCallFunctionVector& c_functions,
+      const fast_api_call::OverloadsResolutionResult& resolution_result,
+      Zone* graph_zone) {
+    return graph_zone->New<FastApiCallParameters>(std::move(c_functions),
+                                                  resolution_result);
+  }
+};
+
+struct FastApiCallOp : OperationT<FastApiCallOp> {
+  static constexpr uint32_t kSuccessValue = 1;
+  static constexpr uint32_t kFailureValue = 0;
+  const FastApiCallParameters* parameters;
+
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Word32(),
+                     RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    DCHECK_EQ(inputs().size(), 1 + parameters->c_signature()->ArgumentCount());
+    storage.resize(inputs().size());
+    storage[0] = MaybeRegisterRepresentation::Tagged();
+    for (unsigned i = 0; i < parameters->c_signature()->ArgumentCount(); ++i) {
+      storage[i + 1] = argument_representation(i);
+    }
+    return base::VectorOf(storage);
+  }
+
+  MaybeRegisterRepresentation argument_representation(
+      unsigned argument_index) const {
+    const CTypeInfo& arg_type =
+        parameters->c_signature()->ArgumentInfo(argument_index);
+    uint8_t flags = static_cast<uint8_t>(arg_type.GetFlags());
+    switch (arg_type.GetSequenceType()) {
+      case CTypeInfo::SequenceType::kScalar:
+        if (flags & (static_cast<uint8_t>(CTypeInfo::Flags::kEnforceRangeBit) |
+                     static_cast<uint8_t>(CTypeInfo::Flags::kClampBit))) {
+          return MaybeRegisterRepresentation::Float64();
+        }
+        switch (arg_type.GetType()) {
+          case CTypeInfo::Type::kVoid:
+            UNREACHABLE();
+          case CTypeInfo::Type::kBool:
+          case CTypeInfo::Type::kUint8:
+          case CTypeInfo::Type::kInt32:
+          case CTypeInfo::Type::kUint32:
+            return MaybeRegisterRepresentation::Word32();
+          case CTypeInfo::Type::kInt64:
+          case CTypeInfo::Type::kUint64:
+            return MaybeRegisterRepresentation::Word64();
+          case CTypeInfo::Type::kV8Value:
+          case CTypeInfo::Type::kApiObject:
+          case CTypeInfo::Type::kPointer:
+          case CTypeInfo::Type::kSeqOneByteString:
+            return MaybeRegisterRepresentation::Tagged();
+          case CTypeInfo::Type::kFloat32:
+          case CTypeInfo::Type::kFloat64:
+            return MaybeRegisterRepresentation::Float64();
+          case CTypeInfo::Type::kAny:
+            // As the register representation is unknown, just treat it as None
+            // to prevent any validation.
+            return MaybeRegisterRepresentation::None();
+        }
+      case CTypeInfo::SequenceType::kIsSequence:
+      case CTypeInfo::SequenceType::kIsTypedArray:
+        return MaybeRegisterRepresentation::Tagged();
+      case CTypeInfo::SequenceType::kIsArrayBuffer:
+        UNREACHABLE();
+    }
+  }
+
+  OpIndex data_argument() const { return input(0); }
+  base::Vector<const OpIndex> arguments() const {
+    return inputs().SubVector(1, inputs().size());
+  }
+
+  FastApiCallOp(OpIndex data_argument, base::Vector<const OpIndex> arguments,
+                const FastApiCallParameters* parameters)
+      : Base(1 + arguments.size()), parameters(parameters) {
+    base::Vector<OpIndex> inputs = this->inputs();
+    inputs[0] = data_argument;
+    inputs.SubVector(1, 1 + arguments.size()).OverwriteWith(arguments);
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, data_argument(),
+                           RegisterRepresentation::Tagged()));
+    for (unsigned int i = 0; i < parameters->c_signature()->ArgumentCount();
+         ++i) {
+      MaybeRegisterRepresentation maybe_rep = argument_representation(i);
+      if (maybe_rep != MaybeRegisterRepresentation::None()) {
+        DCHECK(ValidOpInputRep(graph, arguments()[i],
+                               RegisterRepresentation(maybe_rep)));
+      }
+    }
+  }
+
+  static FastApiCallOp& New(Graph* graph, OpIndex data_argument,
+                            base::Vector<const OpIndex> arguments,
+                            const FastApiCallParameters* parameters) {
+    return Base::New(graph, 1 /*data_argument*/ + arguments.size(),
+                     data_argument, arguments, parameters);
+  }
+
+  auto options() const { return std::tuple{parameters}; }
+};
+
+struct RuntimeAbortOp : FixedArityOperationT<0, RuntimeAbortOp> {
+  AbortReason reason;
+
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
+  explicit RuntimeAbortOp(AbortReason reason) : reason(reason) {}
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{reason}; }
+};
+
+struct EnsureWritableFastElementsOp
+    : FixedArityOperationT<2, EnsureWritableFastElementsOp> {
+  // TODO(tebbi): Can we have more precise effects here?
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex object() const { return Base::input(0); }
+  OpIndex elements() const { return Base::input(1); }
+
+  EnsureWritableFastElementsOp(OpIndex object, OpIndex elements)
+      : Base(object, elements) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, object(), RegisterRepresentation::Tagged()));
+    DCHECK(
+        ValidOpInputRep(graph, elements(), RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{}; }
+};
+
+struct MaybeGrowFastElementsOp
+    : FixedArityOperationT<5, MaybeGrowFastElementsOp> {
+  GrowFastElementsMode mode;
+  FeedbackSource feedback;
+
+  // TODO(tebbi): Can we have more precise effects here?
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Word32(),
+                          MaybeRegisterRepresentation::Word32()>();
+  }
+
+  OpIndex object() const { return Base::input(0); }
+  OpIndex elements() const { return Base::input(1); }
+  OpIndex index() const { return Base::input(2); }
+  OpIndex elements_length() const { return Base::input(3); }
+  OpIndex frame_state() const { return Base::input(4); }
+
+  MaybeGrowFastElementsOp(OpIndex object, OpIndex elements, OpIndex index,
+                          OpIndex elements_length, OpIndex frame_state,
+                          GrowFastElementsMode mode,
+                          const FeedbackSource& feedback)
+      : Base(object, elements, index, elements_length, frame_state),
+        mode(mode),
+        feedback(feedback) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, object(), RegisterRepresentation::Tagged()));
+    DCHECK(
+        ValidOpInputRep(graph, elements(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, index(), RegisterRepresentation::Word32()));
+    DCHECK(ValidOpInputRep(graph, elements_length(),
+                           RegisterRepresentation::Word32()));
+    DCHECK(Get(graph, frame_state()).Is<FrameStateOp>());
+  }
+
+  auto options() const { return std::tuple{mode}; }
+};
+
+struct TransitionElementsKindOp
+    : FixedArityOperationT<1, TransitionElementsKindOp> {
+  ElementsTransition transition;
+
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex object() const { return Base::input(0); }
+
+  TransitionElementsKindOp(OpIndex object, const ElementsTransition& transition)
+      : Base(object), transition(transition) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, object(), RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{transition}; }
+};
+
+struct FindOrderedHashEntryOp
+    : FixedArityOperationT<2, FindOrderedHashEntryOp> {
+  enum class Kind : uint8_t {
+    kFindOrderedHashMapEntry,
+    kFindOrderedHashMapEntryForInt32Key,
+    kFindOrderedHashSetEntry,
+  };
+  Kind kind;
+
+  // TODO(tebbi): Can we have more precise effects here?
+  static constexpr OpEffects effects = OpEffects().CanCallAnything();
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    switch (kind) {
+      case Kind::kFindOrderedHashMapEntry:
+      case Kind::kFindOrderedHashSetEntry:
+        return RepVector<RegisterRepresentation::Tagged()>();
+      case Kind::kFindOrderedHashMapEntryForInt32Key:
+        return RepVector<RegisterRepresentation::PointerSized()>();
+    }
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return kind == Kind::kFindOrderedHashMapEntryForInt32Key
+               ? MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                                MaybeRegisterRepresentation::Word32()>()
+               : MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                                MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  OpIndex data_structure() const { return Base::input(0); }
+  OpIndex key() const { return Base::input(1); }
+
+  FindOrderedHashEntryOp(OpIndex data_structure, OpIndex key, Kind kind)
+      : Base(data_structure, key), kind(kind) {}
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, data_structure(),
+                           RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, key(),
+                           kind == Kind::kFindOrderedHashMapEntryForInt32Key
+                               ? RegisterRepresentation::Word32()
+                               : RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{kind}; }
+};
+std::ostream& operator<<(std::ostream& os, FindOrderedHashEntryOp::Kind kind);
+
+#if V8_ENABLE_WEBASSEMBLY
+
+const RegisterRepresentation& RepresentationFor(wasm::ValueType type);
+
+struct GlobalGetOp : FixedArityOperationT<1, GlobalGetOp> {
+  const wasm::WasmGlobal* global;
+  static constexpr OpEffects effects = OpEffects().CanReadMemory();
+
+  OpIndex instance() const { return Base::input(0); }
+
+  explicit GlobalGetOp(OpIndex instance, const wasm::WasmGlobal* global)
+      : Base(instance), global(global) {}
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    const RegisterRepresentation& repr = RepresentationFor(global->type);
+    return base::VectorOf(&repr, 1);
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK(
+        ValidOpInputRep(graph, instance(), RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{global}; }
+};
+
+struct GlobalSetOp : FixedArityOperationT<2, GlobalSetOp> {
+  const wasm::WasmGlobal* global;
+  static constexpr OpEffects effects = OpEffects().CanWriteMemory();
+
+  OpIndex instance() const { return Base::input(0); }
+  OpIndex value() const { return Base::input(1); }
+
+  explicit GlobalSetOp(OpIndex instance, OpIndex value,
+                       const wasm::WasmGlobal* global)
+      : Base(instance, value), global(global) {}
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    // TODO(mliedtke): What's the type of value()? Right now it could be
+    // anything and the operation doesn't know it.
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK(
+        ValidOpInputRep(graph, instance(), RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{global}; }
+};
+
+struct NullOp : FixedArityOperationT<0, NullOp> {
+  wasm::ValueType type;
+  static constexpr OpEffects effects = OpEffects();
+
+  explicit NullOp(wasm::ValueType type) : Base(), type(type) {}
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK(type.is_object_reference() && type.is_nullable());
+  }
+
+  auto options() const { return std::tuple{type}; }
+};
+
+struct IsNullOp : FixedArityOperationT<1, IsNullOp> {
+  wasm::ValueType type;
+  static constexpr OpEffects effects = OpEffects();
+
+  OpIndex object() const { return Base::input(0); }
+
+  IsNullOp(OpIndex object, wasm::ValueType type) : Base(object), type(type) {}
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Word32()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, object(), RegisterRepresentation::Tagged()));
+  }
+
+  auto options() const { return std::tuple{type}; }
+};
+
+// Traps on a null input, otherwise returns the input, type-cast to the
+// respective non-nullable type.
+struct AssertNotNullOp : FixedArityOperationT<1, AssertNotNullOp> {
+  wasm::ValueType type;
+  TrapId trap_id;
+
+  // Lowers to a trap and inherits {TrapIf}'s effects.
+  static constexpr OpEffects effects =
+      OpEffects().CanDependOnChecks().CanLeaveCurrentFunction();
+
+  OpIndex object() const { return Base::input(0); }
+
+  AssertNotNullOp(OpIndex object, wasm::ValueType type, TrapId trap_id)
+      : Base(object), type(type), trap_id(trap_id) {}
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  void Validate(const Graph& graph) const {
+    // TODO(14108): Validate.
+  }
+
+  auto options() const { return std::tuple{type, trap_id}; }
+};
+
+// The runtime type (RTT) is a value representing a conrete type (in this case
+// heap-type). The canonical RTTs are implicitly created values and invisible to
+// the user in wasm-gc MVP. (See
+// https://github.com/WebAssembly/gc/blob/main/proposals/gc/MVP.md#runtime-types)
+struct RttCanonOp : FixedArityOperationT<1, RttCanonOp> {
+  uint32_t type_index;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  explicit RttCanonOp(OpIndex instance, uint32_t type_index)
+      : Base(instance), type_index(type_index) {}
+
+  OpIndex instance() const { return Base::input(0); }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{type_index}; }
+};
+
+struct WasmTypeCheckOp : OperationT<WasmTypeCheckOp> {
+  WasmTypeCheckConfig config;
+
+  static constexpr OpEffects effects = OpEffects().AssumesConsistentHeap();
+
+  explicit WasmTypeCheckOp(V<Tagged> object, V<Tagged> rtt,
+                           WasmTypeCheckConfig config)
+      : Base(1 + rtt.valid()), config(config) {
+    input(0) = object;
+    if (rtt.valid()) {
+      input(1) = rtt;
+    }
+  }
+
+  V<Tagged> object() const { return Base::input(0); }
+  V<Tagged> rtt() const {
+    return input_count > 1 ? input(1) : OpIndex::Invalid();
+  }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Word32()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return input_count > 1
+               ? MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                                MaybeRegisterRepresentation::Tagged()>()
+               : MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{config}; }
+
+  static WasmTypeCheckOp& New(Graph* graph, V<Tagged> object, V<Tagged> rtt,
+                              WasmTypeCheckConfig config) {
+    return Base::New(graph, 1 + rtt.valid(), object, rtt, config);
+  }
+};
+
+struct WasmTypeCastOp : OperationT<WasmTypeCastOp> {
+  WasmTypeCheckConfig config;
+
+  static constexpr OpEffects effects = OpEffects().CanLeaveCurrentFunction();
+
+  explicit WasmTypeCastOp(V<Tagged> object, V<Tagged> rtt,
+                          WasmTypeCheckConfig config)
+      : Base(1 + rtt.valid()), config(config) {
+    input(0) = object;
+    if (rtt.valid()) {
+      input(1) = rtt;
+    }
+  }
+
+  V<Tagged> object() const { return Base::input(0); }
+  V<Tagged> rtt() const {
+    return input_count > 1 ? input(1) : OpIndex::Invalid();
+  }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return input_count > 1
+               ? MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                                MaybeRegisterRepresentation::Tagged()>()
+               : MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{config}; }
+
+  static WasmTypeCastOp& New(Graph* graph, V<Tagged> object, V<Tagged> rtt,
+                             WasmTypeCheckConfig config) {
+    return Base::New(graph, 1 + rtt.valid(), object, rtt, config);
+  }
+};
+
+struct StructGetOp : FixedArityOperationT<1, StructGetOp> {
+  const wasm::StructType* type;
+  int field_index;
+  bool is_signed;  // `false` only for unsigned packed type accesses.
+  CheckForNull null_check;
+
+  OpEffects Effects() const {
+    OpEffects result =
+        OpEffects()
+            // This should not float above a protective null check.
+            .CanDependOnChecks()
+            .CanReadMemory();
+    if (null_check == kWithNullCheck) {
+      // This may trap.
+      result = result.CanLeaveCurrentFunction();
+    }
+    return result;
+  }
+
+  StructGetOp(OpIndex object, const wasm::StructType* type, int field_index,
+              bool is_signed, CheckForNull null_check)
+      : Base(object),
+        type(type),
+        field_index(field_index),
+        is_signed(is_signed),
+        null_check(null_check) {}
+
+  OpIndex object() const { return input(0); }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return base::VectorOf(&RepresentationFor(type->field(field_index)), 1);
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged()>();
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK_LT(field_index, type->field_count());
+    DCHECK_IMPLIES(!is_signed, type->field(field_index).is_packed());
+  }
+
+  auto options() const {
+    return std::tuple{type, field_index, is_signed, null_check};
+  }
+};
+
+struct StructSetOp : FixedArityOperationT<2, StructSetOp> {
+  const wasm::StructType* type;
+  int field_index;
+  CheckForNull null_check;
+
+  OpEffects Effects() const {
+    OpEffects result =
+        OpEffects()
+            // This should not float above a protective null check.
+            .CanDependOnChecks()
+            .CanWriteMemory();
+    if (null_check == kWithNullCheck) {
+      // This may trap.
+      result = result.CanLeaveCurrentFunction();
+    }
+    return result;
+  }
+
+  StructSetOp(OpIndex object, OpIndex value, const wasm::StructType* type,
+              int field_index, CheckForNull null_check)
+      : Base(object, value),
+        type(type),
+        field_index(field_index),
+        null_check(null_check) {}
+
+  OpIndex object() const { return input(0); }
+  OpIndex value() const { return input(1); }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    storage.resize(2);
+    storage[0] = RegisterRepresentation::Tagged();
+    storage[1] = RepresentationFor(type->field(field_index));
+    return base::VectorOf(storage);
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK_LT(field_index, type->field_count());
+  }
+
+  auto options() const { return std::tuple{type, field_index, null_check}; }
+};
+
+struct ArrayGetOp : FixedArityOperationT<2, ArrayGetOp> {
+  wasm::ValueType element_type;
+  bool is_signed;
+
+  // ArrayGetOp may never trap as it is always protected by a length check.
+  static constexpr OpEffects effects =
+      OpEffects()
+          // This should not float above a protective null/length check.
+          .CanDependOnChecks()
+          .CanReadMemory();
+
+  ArrayGetOp(OpIndex array, OpIndex index, wasm::ValueType element_type,
+             bool is_signed)
+      : Base(array, index), element_type(element_type), is_signed(is_signed) {}
+
+  OpIndex array() const { return input(0); }
+  OpIndex index() const { return input(1); }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return base::VectorOf(&RepresentationFor(element_type), 1);
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<MaybeRegisterRepresentation::Tagged(),
+                          MaybeRegisterRepresentation::Word32()>();
+  }
+
+  void Validate(const Graph& graph) const {
+    DCHECK(ValidOpInputRep(graph, array(), RegisterRepresentation::Tagged()));
+    DCHECK(ValidOpInputRep(graph, index(), RegisterRepresentation::Word32()));
+  }
+
+  auto options() const { return std::tuple{element_type, is_signed}; }
+};
+
+struct ArraySetOp : FixedArityOperationT<3, ArraySetOp> {
+  wasm::ValueType element_type;
+
+  // ArraySetOp may never trap as it is always protected by a length check.
+  static constexpr OpEffects effects =
+      OpEffects()
+          // This should not float above a protective null/length check.
+          .CanDependOnChecks()
+          .CanWriteMemory();
+
+  ArraySetOp(OpIndex array, OpIndex index, OpIndex value,
+             wasm::ValueType element_type)
+      : Base(array, index, value), element_type(element_type) {}
+
+  OpIndex array() const { return input(0); }
+  OpIndex index() const { return input(1); }
+  OpIndex value() const { return input(2); }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const { return {}; }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InitVectorOf(storage, {RegisterRepresentation::Tagged(),
+                                  RegisterRepresentation::Word32(),
+                                  RepresentationFor(element_type)});
+  }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{element_type}; }
+};
+
+struct ArrayLengthOp : FixedArityOperationT<1, ArrayLengthOp> {
+  CheckForNull null_check;
+
+  OpEffects Effects() const {
+    OpEffects result =
+        OpEffects()
+            // This should not float above a protective null check.
+            .CanDependOnChecks()
+            .CanReadMemory();
+    if (null_check == kWithNullCheck) {
+      // This may trap.
+      result = result.CanLeaveCurrentFunction();
+    }
+    return result;
+  }
+
+  explicit ArrayLengthOp(OpIndex array, CheckForNull null_check)
+      : Base(array), null_check(null_check) {}
+
+  OpIndex array() const { return input(0); }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Word32()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::Tagged()>();
+  }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{null_check}; }
+};
+
+struct Simd128ConstantOp : FixedArityOperationT<0, Simd128ConstantOp> {
+  uint8_t value[kSimd128Size];
+
+  static constexpr OpEffects effects = OpEffects();
+
+  explicit Simd128ConstantOp(const uint8_t incoming_value[kSimd128Size])
+      : Base() {
+    std::copy(incoming_value, incoming_value + kSimd128Size, value);
+  }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return {};
+  }
+
+  void Validate(const Graph& graph) const {
+    // TODO(14108): Validate.
+  }
+
+  auto options() const { return std::tuple{value}; }
+  void PrintOptions(std::ostream& os) const;
+};
+
+#define FOREACH_SIMD_128_BINARY_OPCODE(V) \
+  V(I8x16Swizzle)                         \
+  V(I8x16Eq)                              \
+  V(I8x16Ne)                              \
+  V(I8x16GtS)                             \
+  V(I8x16GtU)                             \
+  V(I8x16GeS)                             \
+  V(I8x16GeU)                             \
+  V(I16x8Eq)                              \
+  V(I16x8Ne)                              \
+  V(I16x8GtS)                             \
+  V(I16x8GtU)                             \
+  V(I16x8GeS)                             \
+  V(I16x8GeU)                             \
+  V(I32x4Eq)                              \
+  V(I32x4Ne)                              \
+  V(I32x4GtS)                             \
+  V(I32x4GtU)                             \
+  V(I32x4GeS)                             \
+  V(I32x4GeU)                             \
+  V(F32x4Eq)                              \
+  V(F32x4Ne)                              \
+  V(F32x4Lt)                              \
+  V(F32x4Le)                              \
+  V(F64x2Eq)                              \
+  V(F64x2Ne)                              \
+  V(F64x2Lt)                              \
+  V(F64x2Le)                              \
+  V(S128And)                              \
+  V(S128AndNot)                           \
+  V(S128Or)                               \
+  V(S128Xor)                              \
+  V(I8x16SConvertI16x8)                   \
+  V(I8x16UConvertI16x8)                   \
+  V(I8x16Add)                             \
+  V(I8x16AddSatS)                         \
+  V(I8x16AddSatU)                         \
+  V(I8x16Sub)                             \
+  V(I8x16SubSatS)                         \
+  V(I8x16SubSatU)                         \
+  V(I8x16MinS)                            \
+  V(I8x16MinU)                            \
+  V(I8x16MaxS)                            \
+  V(I8x16MaxU)                            \
+  V(I8x16RoundingAverageU)                \
+  V(I16x8Q15MulRSatS)                     \
+  V(I16x8SConvertI32x4)                   \
+  V(I16x8UConvertI32x4)                   \
+  V(I16x8Add)                             \
+  V(I16x8AddSatS)                         \
+  V(I16x8AddSatU)                         \
+  V(I16x8Sub)                             \
+  V(I16x8SubSatS)                         \
+  V(I16x8SubSatU)                         \
+  V(I16x8Mul)                             \
+  V(I16x8MinS)                            \
+  V(I16x8MinU)                            \
+  V(I16x8MaxS)                            \
+  V(I16x8MaxU)                            \
+  V(I16x8RoundingAverageU)                \
+  V(I16x8ExtMulLowI8x16S)                 \
+  V(I16x8ExtMulHighI8x16S)                \
+  V(I16x8ExtMulLowI8x16U)                 \
+  V(I16x8ExtMulHighI8x16U)                \
+  V(I32x4Add)                             \
+  V(I32x4Sub)                             \
+  V(I32x4Mul)                             \
+  V(I32x4MinS)                            \
+  V(I32x4MinU)                            \
+  V(I32x4MaxS)                            \
+  V(I32x4MaxU)                            \
+  V(I32x4DotI16x8S)                       \
+  V(I32x4ExtMulLowI16x8S)                 \
+  V(I32x4ExtMulHighI16x8S)                \
+  V(I32x4ExtMulLowI16x8U)                 \
+  V(I32x4ExtMulHighI16x8U)                \
+  V(I64x2Add)                             \
+  V(I64x2Sub)                             \
+  V(I64x2Mul)                             \
+  V(I64x2Eq)                              \
+  V(I64x2Ne)                              \
+  V(I64x2GtS)                             \
+  V(I64x2GeS)                             \
+  V(I64x2ExtMulLowI32x4S)                 \
+  V(I64x2ExtMulHighI32x4S)                \
+  V(I64x2ExtMulLowI32x4U)                 \
+  V(I64x2ExtMulHighI32x4U)                \
+  V(F32x4Add)                             \
+  V(F32x4Sub)                             \
+  V(F32x4Mul)                             \
+  V(F32x4Div)                             \
+  V(F32x4Min)                             \
+  V(F32x4Max)                             \
+  V(F32x4Pmin)                            \
+  V(F32x4Pmax)                            \
+  V(F64x2Add)                             \
+  V(F64x2Sub)                             \
+  V(F64x2Mul)                             \
+  V(F64x2Div)                             \
+  V(F64x2Min)                             \
+  V(F64x2Max)                             \
+  V(F64x2Pmin)                            \
+  V(F64x2Pmax)                            \
+  V(I8x16RelaxedSwizzle)                  \
+  V(F32x4RelaxedMin)                      \
+  V(F32x4RelaxedMax)                      \
+  V(F64x2RelaxedMin)                      \
+  V(F64x2RelaxedMax)                      \
+  V(I16x8RelaxedQ15MulRS)                 \
+  V(I16x8DotI8x16I7x16S)
+
+struct Simd128BinopOp : FixedArityOperationT<2, Simd128BinopOp> {
+  enum class Kind : uint8_t {
+#define DEFINE_KIND(kind) k##kind,
+    FOREACH_SIMD_128_BINARY_OPCODE(DEFINE_KIND)
+#undef DEFINE_KIND
+  };
+
+  Kind kind;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::Simd128(),
+                          RegisterRepresentation::Simd128()>();
+  }
+
+  Simd128BinopOp(OpIndex left, OpIndex right, Kind kind)
+      : Base(left, right), kind(kind) {}
+
+  OpIndex left() const { return input(0); }
+  OpIndex right() const { return input(1); }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind}; }
+};
+std::ostream& operator<<(std::ostream& os, Simd128BinopOp::Kind kind);
+
+#define FOREACH_SIMD_128_UNARY_NON_OPTIONAL_OPCODE(V) \
+  V(S128Not)                                          \
+  V(F32x4DemoteF64x2Zero)                             \
+  V(F64x2PromoteLowF32x4)                             \
+  V(I8x16Abs)                                         \
+  V(I8x16Neg)                                         \
+  V(I8x16Popcnt)                                      \
+  V(I16x8ExtAddPairwiseI8x16S)                        \
+  V(I16x8ExtAddPairwiseI8x16U)                        \
+  V(I32x4ExtAddPairwiseI16x8S)                        \
+  V(I32x4ExtAddPairwiseI16x8U)                        \
+  V(I16x8Abs)                                         \
+  V(I16x8Neg)                                         \
+  V(I16x8SConvertI8x16Low)                            \
+  V(I16x8SConvertI8x16High)                           \
+  V(I16x8UConvertI8x16Low)                            \
+  V(I16x8UConvertI8x16High)                           \
+  V(I32x4Abs)                                         \
+  V(I32x4Neg)                                         \
+  V(I32x4SConvertI16x8Low)                            \
+  V(I32x4SConvertI16x8High)                           \
+  V(I32x4UConvertI16x8Low)                            \
+  V(I32x4UConvertI16x8High)                           \
+  V(I64x2Abs)                                         \
+  V(I64x2Neg)                                         \
+  V(I64x2SConvertI32x4Low)                            \
+  V(I64x2SConvertI32x4High)                           \
+  V(I64x2UConvertI32x4Low)                            \
+  V(I64x2UConvertI32x4High)                           \
+  V(F32x4Abs)                                         \
+  V(F32x4Neg)                                         \
+  V(F32x4Sqrt)                                        \
+  V(F64x2Abs)                                         \
+  V(F64x2Neg)                                         \
+  V(F64x2Sqrt)                                        \
+  V(I32x4SConvertF32x4)                               \
+  V(I32x4UConvertF32x4)                               \
+  V(F32x4SConvertI32x4)                               \
+  V(F32x4UConvertI32x4)                               \
+  V(I32x4TruncSatF64x2SZero)                          \
+  V(I32x4TruncSatF64x2UZero)                          \
+  V(F64x2ConvertLowI32x4S)                            \
+  V(F64x2ConvertLowI32x4U)                            \
+  V(I32x4RelaxedTruncF32x4S)                          \
+  V(I32x4RelaxedTruncF32x4U)                          \
+  V(I32x4RelaxedTruncF64x2SZero)                      \
+  V(I32x4RelaxedTruncF64x2UZero)
+
+#define FOREACH_SIMD_128_UNARY_OPTIONAL_OPCODE(V) \
+  V(F32x4Ceil)                                    \
+  V(F32x4Floor)                                   \
+  V(F32x4Trunc)                                   \
+  V(F32x4NearestInt)                              \
+  V(F64x2Ceil)                                    \
+  V(F64x2Floor)                                   \
+  V(F64x2Trunc)                                   \
+  V(F64x2NearestInt)
+
+#define FOREACH_SIMD_128_UNARY_OPCODE(V)        \
+  FOREACH_SIMD_128_UNARY_NON_OPTIONAL_OPCODE(V) \
+  FOREACH_SIMD_128_UNARY_OPTIONAL_OPCODE(V)
+
+struct Simd128UnaryOp : FixedArityOperationT<1, Simd128UnaryOp> {
+  enum class Kind : uint8_t {
+#define DEFINE_KIND(kind) k##kind,
+    FOREACH_SIMD_128_UNARY_OPCODE(DEFINE_KIND)
+#undef DEFINE_KIND
+  };
+
+  Kind kind;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  Simd128UnaryOp(OpIndex input, Kind kind) : Base(input), kind(kind) {}
+
+  OpIndex input() const { return Base::input(0); }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind}; }
+};
+std::ostream& operator<<(std::ostream& os, Simd128UnaryOp::Kind kind);
+
+#define FOREACH_SIMD_128_SHIFT_OPCODE(V) \
+  V(I8x16Shl)                            \
+  V(I8x16ShrS)                           \
+  V(I8x16ShrU)                           \
+  V(I16x8Shl)                            \
+  V(I16x8ShrS)                           \
+  V(I16x8ShrU)                           \
+  V(I32x4Shl)                            \
+  V(I32x4ShrS)                           \
+  V(I32x4ShrU)                           \
+  V(I64x2Shl)                            \
+  V(I64x2ShrS)                           \
+  V(I64x2ShrU)
+
+struct Simd128ShiftOp : FixedArityOperationT<2, Simd128ShiftOp> {
+  enum class Kind : uint8_t {
+#define DEFINE_KIND(kind) k##kind,
+    FOREACH_SIMD_128_SHIFT_OPCODE(DEFINE_KIND)
+#undef DEFINE_KIND
+  };
+
+  Kind kind;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::Simd128(),
+                          RegisterRepresentation::Word32()>();
+  }
+
+  Simd128ShiftOp(OpIndex input, OpIndex shift, Kind kind)
+      : Base(input, shift), kind(kind) {}
+
+  OpIndex input() const { return Base::input(0); }
+  OpIndex shift() const { return Base::input(1); }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind}; }
+};
+std::ostream& operator<<(std::ostream& os, Simd128ShiftOp::Kind kind);
+
+#define FOREACH_SIMD_128_TEST_OPCODE(V) \
+  V(V128AnyTrue)                        \
+  V(I8x16AllTrue)                       \
+  V(I8x16BitMask)                       \
+  V(I16x8AllTrue)                       \
+  V(I16x8BitMask)                       \
+  V(I32x4AllTrue)                       \
+  V(I32x4BitMask)                       \
+  V(I64x2AllTrue)                       \
+  V(I64x2BitMask)
+
+struct Simd128TestOp : FixedArityOperationT<1, Simd128TestOp> {
+  enum class Kind : uint8_t {
+#define DEFINE_KIND(kind) k##kind,
+    FOREACH_SIMD_128_TEST_OPCODE(DEFINE_KIND)
+#undef DEFINE_KIND
+  };
+
+  Kind kind;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Word32()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  Simd128TestOp(OpIndex input, Kind kind) : Base(input), kind(kind) {}
+
+  OpIndex input() const { return Base::input(0); }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind}; }
+};
+std::ostream& operator<<(std::ostream& os, Simd128TestOp::Kind kind);
+
+#define FOREACH_SIMD_128_SPLAT_OPCODE(V) \
+  V(I8x16)                               \
+  V(I16x8)                               \
+  V(I32x4)                               \
+  V(I64x2)                               \
+  V(F32x4)                               \
+  V(F64x2)
+
+struct Simd128SplatOp : FixedArityOperationT<1, Simd128SplatOp> {
+  enum class Kind : uint8_t {
+#define DEFINE_KIND(kind) k##kind,
+    FOREACH_SIMD_128_SPLAT_OPCODE(DEFINE_KIND)
+#undef DEFINE_KIND
+  };
+
+  Kind kind;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    switch (kind) {
+      case Kind::kI8x16:
+      case Kind::kI16x8:
+      case Kind::kI32x4:
+        return MaybeRepVector<RegisterRepresentation::Word32()>();
+      case Kind::kI64x2:
+        return MaybeRepVector<RegisterRepresentation::Word64()>();
+      case Kind::kF32x4:
+        return MaybeRepVector<RegisterRepresentation::Float32()>();
+      case Kind::kF64x2:
+        return MaybeRepVector<RegisterRepresentation::Float64()>();
+    }
+  }
+
+  Simd128SplatOp(OpIndex input, Kind kind) : Base(input), kind(kind) {}
+
+  OpIndex input() const { return Base::input(0); }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind}; }
+};
+std::ostream& operator<<(std::ostream& os, Simd128SplatOp::Kind kind);
+
+#define FOREACH_SIMD_128_TERNARY_MASK_OPCODE(V) \
+  V(S128Select)                                 \
+  V(I8x16RelaxedLaneSelect)                     \
+  V(I16x8RelaxedLaneSelect)                     \
+  V(I32x4RelaxedLaneSelect)                     \
+  V(I64x2RelaxedLaneSelect)
+
+#define FOREACH_SIMD_128_TERNARY_OTHER_OPCODE(V) \
+  V(F32x4Qfma)                                   \
+  V(F32x4Qfms)                                   \
+  V(F64x2Qfma)                                   \
+  V(F64x2Qfms)                                   \
+  V(I32x4DotI8x16I7x16AddS)
+
+#define FOREACH_SIMD_128_TERNARY_OPCODE(V) \
+  FOREACH_SIMD_128_TERNARY_MASK_OPCODE(V)  \
+  FOREACH_SIMD_128_TERNARY_OTHER_OPCODE(V)
+
+struct Simd128TernaryOp : FixedArityOperationT<3, Simd128TernaryOp> {
+  enum class Kind : uint8_t {
+#define DEFINE_KIND(kind) k##kind,
+    FOREACH_SIMD_128_TERNARY_OPCODE(DEFINE_KIND)
+#undef DEFINE_KIND
+  };
+
+  Kind kind;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::Simd128(),
+                          RegisterRepresentation::Simd128(),
+                          RegisterRepresentation::Simd128()>();
+  }
+
+  Simd128TernaryOp(OpIndex first, OpIndex second, OpIndex third, Kind kind)
+      : Base(first, second, third), kind(kind) {}
+
+  OpIndex first() const { return input(0); }
+  OpIndex second() const { return input(1); }
+  OpIndex third() const { return input(2); }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind}; }
+};
+std::ostream& operator<<(std::ostream& os, Simd128TernaryOp::Kind kind);
+
+struct Simd128ExtractLaneOp : FixedArityOperationT<1, Simd128ExtractLaneOp> {
+  enum class Kind : uint8_t {
+    kI8x16S,
+    kI8x16U,
+    kI16x8S,
+    kI16x8U,
+    kI32x4,
+    kI64x2,
+    kF32x4,
+    kF64x2,
+  };
+
+  Kind kind;
+  uint8_t lane;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    switch (kind) {
+      case Kind::kI8x16S:
+      case Kind::kI8x16U:
+      case Kind::kI16x8S:
+      case Kind::kI16x8U:
+      case Kind::kI32x4:
+        return RepVector<RegisterRepresentation::Word32()>();
+      case Kind::kI64x2:
+        return RepVector<RegisterRepresentation::Word64()>();
+      case Kind::kF32x4:
+        return RepVector<RegisterRepresentation::Float32()>();
+      case Kind::kF64x2:
+        return RepVector<RegisterRepresentation::Float64()>();
+    }
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  Simd128ExtractLaneOp(OpIndex input, Kind kind, uint8_t lane)
+      : Base(input), kind(kind), lane(lane) {}
+
+  OpIndex input() const { return Base::input(0); }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind, lane}; }
+  void PrintOptions(std::ostream& os) const;
+};
+
+struct Simd128ReplaceLaneOp : FixedArityOperationT<2, Simd128ReplaceLaneOp> {
+  enum class Kind : uint8_t {
+    kI8x16,
+    kI16x8,
+    kI32x4,
+    kI64x2,
+    kF32x4,
+    kF64x2,
+  };
+
+  Kind kind;
+  uint8_t lane;
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return InitVectorOf(storage,
+                        {RegisterRepresentation::Simd128(), new_lane_rep()});
+  }
+
+  Simd128ReplaceLaneOp(OpIndex into, OpIndex new_lane, Kind kind, uint8_t lane)
+      : Base(into, new_lane), kind(kind), lane(lane) {}
+
+  OpIndex into() const { return Base::input(0); }
+  OpIndex new_lane() const { return Base::input(1); }
+
+  void Validate(const Graph& graph) const {}
+
+  auto options() const { return std::tuple{kind, lane}; }
+  void PrintOptions(std::ostream& os) const;
+
+  RegisterRepresentation new_lane_rep() const {
+    switch (kind) {
+      case Kind::kI8x16:
+      case Kind::kI16x8:
+      case Kind::kI32x4:
+        return RegisterRepresentation::Word32();
+      case Kind::kI64x2:
+        return RegisterRepresentation::Word64();
+      case Kind::kF32x4:
+        return RegisterRepresentation::Float32();
+      case Kind::kF64x2:
+        return RegisterRepresentation::Float64();
+    }
+  }
+};
+
+// If `mode` is `kLoad`, load a value from `base() + index() + offset`, whose
+// size is determinded by `lane_kind`, and return the Simd128 `value()` with
+// the lane specified by `lane_kind` and `lane` replaced with the loaded value.
+// If `mode` is `kStore`, extract the lane specified by `lane` with size
+// `lane_kind` from `value()`, and store it to `base() + index() + offset`.
+struct Simd128LaneMemoryOp : FixedArityOperationT<3, Simd128LaneMemoryOp> {
+  enum class Mode : bool { kLoad, kStore };
+  using Kind = LoadOp::Kind;
+  enum class LaneKind : uint8_t { k8, k16, k32, k64 };
+
+  Mode mode;
+  Kind kind;
+  LaneKind lane_kind;
+  uint8_t lane;
+  int offset;
+
+  OpEffects Effects() const {
+    OpEffects effects = mode == Mode::kLoad ? OpEffects().CanReadMemory()
+                                            : OpEffects().CanWriteMemory();
+    effects = effects.CanDependOnChecks();
+    if (kind.with_trap_handler) effects = effects.CanLeaveCurrentFunction();
+    return effects;
+  }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return mode == Mode::kLoad ? RepVector<RegisterRepresentation::Simd128()>()
+                               : RepVector<>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::PointerSized(),
+                          RegisterRepresentation::PointerSized(),
+                          RegisterRepresentation::Simd128()>();
+  }
+
+  Simd128LaneMemoryOp(OpIndex base, OpIndex index, OpIndex value, Mode mode,
+                      Kind kind, LaneKind lane_kind, uint8_t lane, int offset)
+      : Base(base, index, value),
+        mode(mode),
+        kind(kind),
+        lane_kind(lane_kind),
+        lane(lane),
+        offset(offset) {}
+
+  OpIndex base() const { return input(0); }
+  OpIndex index() const { return input(1); }
+  OpIndex value() const { return input(2); }
+
+  void Validate(const Graph& graph) {
+    DCHECK(kind ==
+           any_of(Kind::RawAligned(), Kind::RawUnaligned(), Kind::Protected()));
+  }
+
+  auto options() const {
+    return std::tuple{mode, kind, lane_kind, lane, offset};
+  }
+  void PrintOptions(std::ostream& os) const;
+};
+
+#define FOREACH_SIMD_128_LOAD_TRANSFORM_OPCODE(V) \
+  V(8x8S)                                         \
+  V(8x8U)                                         \
+  V(16x4S)                                        \
+  V(16x4U)                                        \
+  V(32x2S)                                        \
+  V(32x2U)                                        \
+  V(8Splat)                                       \
+  V(16Splat)                                      \
+  V(32Splat)                                      \
+  V(64Splat)                                      \
+  V(32Zero)                                       \
+  V(64Zero)
+
+// Load a value from `base() + index() + offset`, whose size is determinded by
+// `transform_kind`, and generate a Simd128 value as follows:
+// - From 8x8S to 32x2U (extend kinds), the loaded value has size 8. It is
+//   interpreted as a vector of values according to the size of the kind, which
+//   populate the even lanes of the generated value. The odd lanes are zero- or
+//   sign-extended according to the kind.
+// - For splat kinds, the loaded value's size is determined by the kind, all
+//   lanes of the generated value are populated with the loaded value.
+// - For "zero" kinds, the loaded value's size is determined by the kind, and
+//   the generated value zero-extends the loaded value.
+struct Simd128LoadTransformOp
+    : FixedArityOperationT<2, Simd128LoadTransformOp> {
+  using LoadKind = LoadOp::Kind;
+  enum class TransformKind : uint8_t {
+#define DEFINE_KIND(kind) k##kind,
+    FOREACH_SIMD_128_LOAD_TRANSFORM_OPCODE(DEFINE_KIND)
+#undef DEFINE_KIND
+  };
+
+  LoadKind load_kind;
+  TransformKind transform_kind;
+  int offset;
+
+  OpEffects Effects() const {
+    OpEffects effects = OpEffects().CanReadMemory().CanDependOnChecks();
+    if (load_kind.with_trap_handler) {
+      effects = effects.CanLeaveCurrentFunction();
+    }
+    return effects;
+  }
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::PointerSized(),
+                          RegisterRepresentation::PointerSized()>();
+  }
+
+  Simd128LoadTransformOp(OpIndex base, OpIndex index, LoadKind load_kind,
+                         TransformKind transform_kind, int offset)
+      : Base(base, index),
+        load_kind(load_kind),
+        transform_kind(transform_kind),
+        offset(offset) {}
+
+  OpIndex base() const { return input(0); }
+  OpIndex index() const { return input(1); }
+
+  void Validate(const Graph& graph) {
+    DCHECK(load_kind == any_of(LoadKind::RawAligned(), LoadKind::RawUnaligned(),
+                               LoadKind::Protected()));
+  }
+
+  auto options() const { return std::tuple{load_kind, transform_kind, offset}; }
+  void PrintOptions(std::ostream& os) const;
+};
+
+// Takes two Simd128 inputs and generates a Simd128 value. The 8-bit lanes of
+// both inputs are numbered 0-31, and each output 8-bit lane is selected from
+// among the input lanes according to `shuffle`.
+struct Simd128ShuffleOp : FixedArityOperationT<2, Simd128ShuffleOp> {
+  uint8_t shuffle[kSimd128Size];
+
+  static constexpr OpEffects effects = OpEffects();
+
+  base::Vector<const RegisterRepresentation> outputs_rep() const {
+    return RepVector<RegisterRepresentation::Simd128()>();
+  }
+
+  base::Vector<const MaybeRegisterRepresentation> inputs_rep(
+      ZoneVector<MaybeRegisterRepresentation>& storage) const {
+    return MaybeRepVector<RegisterRepresentation::Simd128(),
+                          RegisterRepresentation::Simd128()>();
+  }
+
+  Simd128ShuffleOp(OpIndex left, OpIndex right,
+                   const uint8_t incoming_shuffle[kSimd128Size])
+      : Base(left, right) {
+    std::copy(incoming_shuffle, incoming_shuffle + kSimd128Size, shuffle);
+  }
+
+  OpIndex left() const { return input(0); }
+  OpIndex right() const { return input(1); }
+
+  void Validate(const Graph& graph) {}
+
+  auto options() const { return std::tuple{shuffle}; }
+  void PrintOptions(std::ostream& os) const;
+};
+
+#endif  // V8_ENABLE_WEBASSEMBLY
+
+#define OPERATION_EFFECTS_CASE(Name) Name##Op::EffectsIfStatic(),
+static constexpr base::Optional<OpEffects>
+    kOperationEffectsTable[kNumberOfOpcodes] = {
+        TURBOSHAFT_OPERATION_LIST(OPERATION_EFFECTS_CASE)};
+#undef OPERATION_EFFECTS_CASE
+
+template <class Op>
+const Opcode OperationT<Op>::opcode = operation_to_opcode_map<Op>::value;
+
+template <Opcode opcode>
+struct opcode_to_operation_map {};
+
+#define OPERATION_OPCODE_MAP_CASE(Name)             \
+  template <>                                       \
+  struct opcode_to_operation_map<Opcode::k##Name> { \
+    using Op = Name##Op;                            \
+  };
+TURBOSHAFT_OPERATION_LIST(OPERATION_OPCODE_MAP_CASE)
+#undef OPERATION_OPCODE_MAP_CASE
+
+template <class Op, class = void>
+struct static_operation_input_count : std::integral_constant<uint32_t, 0> {};
+template <class Op>
+struct static_operation_input_count<Op, std::void_t<decltype(Op::inputs)>>
+    : std::integral_constant<uint32_t, sizeof(Op::inputs) / sizeof(OpIndex)> {};
+constexpr size_t kOperationSizeTable[kNumberOfOpcodes] = {
+#define OPERATION_SIZE(Name) sizeof(Name##Op),
+    TURBOSHAFT_OPERATION_LIST(OPERATION_SIZE)
+#undef OPERATION_SIZE
+};
+constexpr size_t kOperationSizeDividedBySizeofOpIndexTable[kNumberOfOpcodes] = {
+#define OPERATION_SIZE(Name) (sizeof(Name##Op) / sizeof(OpIndex)),
+    TURBOSHAFT_OPERATION_LIST(OPERATION_SIZE)
+#undef OPERATION_SIZE
+};
+
+inline base::Vector<const OpIndex> Operation::inputs() const {
+  // This is actually undefined behavior, since we use the `this` pointer to
+  // access an adjacent object.
+  const OpIndex* ptr = reinterpret_cast<const OpIndex*>(
+      reinterpret_cast<const char*>(this) +
+      kOperationSizeTable[OpcodeIndex(opcode)]);
+  return {ptr, input_count};
+}
+
+inline OpEffects Operation::Effects() const {
+  if (auto prop = kOperationEffectsTable[OpcodeIndex(opcode)]) {
+    return *prop;
+  }
+  switch (opcode) {
+    case Opcode::kLoad:
+      return Cast<LoadOp>().Effects();
+    case Opcode::kStore:
+      return Cast<StoreOp>().Effects();
+    case Opcode::kCall:
+      return Cast<CallOp>().Effects();
+    case Opcode::kAtomicRMW:
+      return Cast<AtomicRMWOp>().Effects();
+#if V8_ENABLE_WEBASSEMBLY
+    case Opcode::kStructGet:
+      return Cast<StructGetOp>().Effects();
+    case Opcode::kStructSet:
+      return Cast<StructSetOp>().Effects();
+    case Opcode::kArrayLength:
+      return Cast<ArrayLengthOp>().Effects();
+    case Opcode::kSimd128LaneMemory:
+      return Cast<Simd128LaneMemoryOp>().Effects();
+    case Opcode::kSimd128LoadTransform:
+      return Cast<Simd128LoadTransformOp>().Effects();
+#endif
+    default:
+      UNREACHABLE();
+  }
+}
+
+// static
+inline size_t Operation::StorageSlotCount(Opcode opcode, size_t input_count) {
+  size_t size = kOperationSizeDividedBySizeofOpIndexTable[OpcodeIndex(opcode)];
+  constexpr size_t r = sizeof(OperationStorageSlot) / sizeof(OpIndex);
+  static_assert(sizeof(OperationStorageSlot) % sizeof(OpIndex) == 0);
+  return std::max<size_t>(2, (r - 1 + size + input_count) / r);
+}
+
+template <class Op>
+V8_INLINE bool CanBeUsedAsInput(const Op& op) {
+  if (std::is_same<Op, FrameStateOp>::value) {
+    // FrameStateOp is the only Operation that can be used as an input but has
+    // empty `outputs_rep`.
+    return true;
   }
   // For all other Operations, they can only be used as an input if they have at
   // least one output.
@@ -3332,6 +7320,24 @@ inline base::Vector<const RegisterRepresentation> Operation::outputs_rep()
   }
 }
 
+inline base::Vector<const MaybeRegisterRepresentation> Operation::inputs_rep(
+    ZoneVector<MaybeRegisterRepresentation>& storage) const {
+  switch (opcode) {
+#define CASE(type)                         \
+  case Opcode::k##type: {                  \
+    const type##Op& op = Cast<type##Op>(); \
+    return op.inputs_rep(storage);         \
+  }
+    TURBOSHAFT_OPERATION_LIST(CASE)
+#undef CASE
+  }
+}
+
+bool IsUnlikelySuccessor(const Block* block, const Block* successor,
+                         const Graph& graph);
+
+#undef FIELD
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_OPERATIONS_H_
diff --git a/deps/v8/src/compiler/turboshaft/optimization-phase.h b/deps/v8/src/compiler/turboshaft/optimization-phase.h
index b75572a59e3b8c..1a5767d16c0b78 100644
--- a/deps/v8/src/compiler/turboshaft/optimization-phase.h
+++ b/deps/v8/src/compiler/turboshaft/optimization-phase.h
@@ -15,17 +15,17 @@
 #include "src/base/logging.h"
 #include "src/base/small-vector.h"
 #include "src/base/vector.h"
+#include "src/codegen/optimized-compilation-info.h"
 #include "src/compiler/node-origin-table.h"
 #include "src/compiler/turboshaft/graph.h"
 #include "src/compiler/turboshaft/index.h"
 #include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/phase.h"
 #include "src/compiler/turboshaft/reducer-traits.h"
 #include "src/compiler/turboshaft/snapshot-table.h"
 
 namespace v8::internal::compiler::turboshaft {
 
-using Variable =
-    SnapshotTable<OpIndex, base::Optional<RegisterRepresentation>>::Key;
 using MaybeVariable = base::Optional<Variable>;
 
 int CountDecimalDigits(uint32_t value);
@@ -34,40 +34,25 @@ struct PaddingSpace {
 };
 std::ostream& operator<<(std::ostream& os, PaddingSpace padding);
 
-struct AnalyzerBase {
-  Zone* phase_zone;
-  const Graph& graph;
-
-  void Run() {}
-  bool OpIsUsed(OpIndex i) const {
-    const Operation& op = graph.Get(i);
-    return op.saturated_use_count > 0 ||
-           op.Properties().is_required_when_unused;
-  }
-
-  explicit AnalyzerBase(const Graph& graph, Zone* phase_zone)
-      : phase_zone(phase_zone), graph(graph) {}
-};
-
-// All operations whose `saturated_use_count` are unused and can be skipped.
-// Analyzers modify the input graph in-place when they want to mark some
-// Operations as removeable. In order to make that work for operations that have
-// no uses such as Goto and Branch, all operations that have the property
-// `is_required_when_unused` have a non-zero `saturated_use_count`.
+// All operations whose `saturated_use_count` is 0 are unused and can be
+// skipped. Analyzers modify the input graph in-place when they want to mark
+// some Operations as removeable. In order to make that work for operations that
+// have no uses such as Goto and Branch, all operations that have the property
+// `IsRequiredWhenUnused()` have a non-zero `saturated_use_count`.
 V8_INLINE bool ShouldSkipOperation(const Operation& op) {
-  return op.saturated_use_count == 0;
+  return op.saturated_use_count.IsZero();
 }
 
 template <template <class> class... Reducers>
 class OptimizationPhaseImpl {
  public:
-  static void Run(Graph* input, Zone* phase_zone, NodeOriginTable* origins,
-                  const typename Assembler<reducer_list<Reducers...>>::ArgT&
-                      reducer_args = std::tuple<>{}) {
+  static void Run(Zone* phase_zone) {
+    PipelineData& data = PipelineData::Get();
+    Graph& input_graph = data.graph();
     Assembler<reducer_list<Reducers...>> phase(
-        *input, input->GetOrCreateCompanion(), phase_zone, origins,
-        reducer_args);
-    if (v8_flags.turboshaft_trace_reduction) {
+        input_graph, input_graph.GetOrCreateCompanion(), phase_zone,
+        data.node_origins());
+    if (data.info()->turboshaft_trace_reduction()) {
       phase.template VisitGraph<true>();
     } else {
       phase.template VisitGraph<false>();
@@ -77,19 +62,16 @@ class OptimizationPhaseImpl {
 
 template <template <typename> typename... Reducers>
 class OptimizationPhase {
-  using impl_t = OptimizationPhaseImpl<Reducers...>;
-
  public:
-  static void Run(Isolate* isolate, Graph* input, Zone* phase_zone,
-                  NodeOriginTable* origins,
-                  const typename Assembler<reducer_list<Reducers...>>::ArgT&
-                      reducer_args = std::tuple<>{}) {
-    impl_t::Run(input, phase_zone, origins, reducer_args);
+  static void Run(Zone* phase_zone) {
+    OptimizationPhaseImpl<Reducers...>::Run(phase_zone);
   }
 };
 
 template <typename Next>
 class ReducerBaseForwarder;
+template <typename Next>
+class VariableReducer;
 
 template <class Assembler>
 class GraphVisitor {
@@ -170,10 +152,6 @@ class GraphVisitor {
     // version of {input_block} that we just cloned.
     blocks_needing_variables.insert(input_block->index());
 
-    // Updating the origin of "current_block", so that translating Phis can
-    // still properly be done (in OptimizationPhase::ReducePhi).
-    assembler().current_block()->SetOrigin(input_block);
-
     ScopedModification<bool> set_true(&current_block_needs_variables_, true);
     for (OpIndex index : input_graph().OperationIndices(*input_block)) {
       if (const PhiOp* phi =
@@ -188,28 +166,40 @@ class GraphVisitor {
     }
   }
 
+  // {InlineOp} introduces two limitations unlike {CloneAndInlineBlock}:
+  // 1. The input operation must not be emitted anymore as part of its
+  // regular input block;
+  // 2. {InlineOp} must not be used multiple times for the same input op.
+  bool InlineOp(OpIndex index, const Block* input_block) {
+    return VisitOp<false>(index, input_block);
+  }
+
   template <bool can_be_invalid = false>
   OpIndex MapToNewGraph(OpIndex old_index, int predecessor_index = -1) {
     DCHECK(old_index.valid());
     OpIndex result = op_mapping_[old_index.id()];
-    if (!result.valid()) {
-      // {op_mapping} doesn't have a mapping for {old_index}. The assembler
-      // should provide the mapping.
-      MaybeVariable var = GetVariableFor(old_index);
-      if constexpr (can_be_invalid) {
-        if (!var.has_value()) {
-          return OpIndex::Invalid();
+
+    if constexpr (reducer_list_contains<typename Assembler::ReducerList,
+                                        VariableReducer>::value) {
+      if (!result.valid()) {
+        // {op_mapping} doesn't have a mapping for {old_index}. The assembler
+        // should provide the mapping.
+        MaybeVariable var = GetVariableFor(old_index);
+        if constexpr (can_be_invalid) {
+          if (!var.has_value()) {
+            return OpIndex::Invalid();
+          }
+        }
+        DCHECK(var.has_value());
+        if (predecessor_index == -1) {
+          result = assembler().GetVariable(var.value());
+        } else {
+          result =
+              assembler().GetPredecessorValue(var.value(), predecessor_index);
         }
-      }
-      DCHECK(var.has_value());
-      if (predecessor_index == -1) {
-        result = assembler().Get(var.value());
-      } else {
-        result =
-            assembler().GetPredecessorValue(var.value(), predecessor_index);
       }
     }
-    DCHECK(result.valid());
+    DCHECK_IMPLIES(!can_be_invalid, result.valid());
     return result;
   }
 
@@ -262,11 +252,7 @@ class GraphVisitor {
     if (auto* final_goto = last_op.TryCast<GotoOp>()) {
       if (final_goto->destination->IsLoop()) {
         if (input_block->index() > final_goto->destination->index()) {
-          Block* new_loop = final_goto->destination->MapToNextGraph();
-          DCHECK(new_loop->IsLoop());
-          if (new_loop->IsLoop() && new_loop->PredecessorCount() == 1) {
-            output_graph_.TurnLoopIntoMerge(new_loop);
-          }
+          assembler().FinalizeLoop(final_goto->destination->MapToNextGraph());
         } else {
           // We have a forward jump to a loop, rather than a backedge. We
           // don't need to do anything.
@@ -280,12 +266,13 @@ class GraphVisitor {
     Block* current_block = assembler().current_block();
     if (!current_block) return false;
     assembler().SetCurrentOrigin(index);
+    current_block->SetOrigin(input_block);
     OpIndex first_output_index =
         assembler().output_graph().next_operation_index();
     USE(first_output_index);
     const Operation& op = input_graph().Get(index);
     if constexpr (trace_reduction) TraceReductionStart(index);
-    if (ShouldSkipOperation(op)) {
+    if (!ShouldSkipOptimizationStep() && ShouldSkipOperation(op)) {
       if constexpr (trace_reduction) TraceOperationSkipped();
       return true;
     }
@@ -312,6 +299,12 @@ class GraphVisitor {
 #ifdef DEBUG
     if (V8_UNLIKELY(v8_flags.turboshaft_verify_reductions)) {
       if (new_index.valid()) {
+        const Operation& new_op = output_graph().Get(new_index);
+        DCHECK_EQ(new_op.outputs_rep().size(), op.outputs_rep().size());
+        for (size_t i = 0; i < new_op.outputs_rep().size(); ++i) {
+          DCHECK(new_op.outputs_rep()[i].AllowImplicitRepresentationChangeTo(
+              op.outputs_rep()[i]));
+        }
         assembler().Verify(index, new_index);
       }
     }
@@ -348,7 +341,7 @@ class GraphVisitor {
       std::cout << prefix << " n" << index.id() << ": "
                 << PaddingSpace{5 - CountDecimalDigits(index.id())}
                 << OperationPrintStyle{output_graph_.Get(index), "#n"} << "\n";
-      if (op.Properties().is_block_terminator && assembler().current_block() &&
+      if (op.IsBlockTerminator() && assembler().current_block() &&
           assembler().current_block() != current_block) {
         current_block = &assembler().output_graph().Get(
             BlockIndex(current_block->index().id() + 1));
@@ -364,11 +357,15 @@ class GraphVisitor {
   // blocks accordingly.
   V8_INLINE OpIndex AssembleOutputGraphGoto(const GotoOp& op) {
     Block* destination = op.destination->MapToNextGraph();
-    assembler().ReduceGoto(destination);
     if (destination->IsBound()) {
       DCHECK(destination->IsLoop());
-      FixLoopPhis(destination);
+      FixLoopPhis(op.destination);
     }
+    // It is important that we first fix loop phis and then reduce the `Goto`,
+    // because reducing the `Goto` can have side effects, in particular, it can
+    // modify affect the SnapshotTable of `VariableReducer`, which is also used
+    // by `FixLoopPhis()`.
+    assembler().ReduceGoto(destination);
     return OpIndex::Invalid();
   }
   V8_INLINE OpIndex AssembleOutputGraphBranch(const BranchOp& op) {
@@ -395,8 +392,7 @@ class GraphVisitor {
         // emit it's 0'th input.
         return MapToNewGraph(op.input(0));
       }
-      return assembler().PendingLoopPhi(MapToNewGraph(op.input(0)), op.rep,
-                                        op.input(PhiOp::kLoopPhiBackEdgeIndex));
+      return assembler().PendingLoopPhi(MapToNewGraph(op.input(0)), op.rep);
     }
 
     base::Vector<const OpIndex> old_inputs = op.inputs();
@@ -428,9 +424,10 @@ class GraphVisitor {
     DCHECK_IMPLIES(new_pred == nullptr, old_pred == nullptr);
 
     if (new_pred != nullptr) {
-      // If {new_pred} is nullptr, then the order of the predecessors changed.
-      // This should only happen with blocks that were introduced in the
-      // previous graph. For instance, consider this (partial) dominator tree:
+      // If {new_pred} is not nullptr, then the order of the predecessors
+      // changed. This should only happen with blocks that were introduced in
+      // the previous graph. For instance, consider this (partial) dominator
+      // tree:
       //
       //     ╠ 7
       //     ║ ╠ 8
@@ -448,17 +445,15 @@ class GraphVisitor {
 
 #ifdef DEBUG
       // To check that indices are set properly, we zap them in debug builds.
-      const uint32_t invalid_custom_data = std::numeric_limits<uint32_t>::max();
       for (auto& block : assembler().modifiable_input_graph().blocks()) {
-        block.custom_data() = invalid_custom_data;
+        block.clear_custom_data();
       }
 #endif
       uint32_t pos = current_input_block_->PredecessorCount() - 1;
       for (old_pred = current_input_block_->LastPredecessor();
            old_pred != nullptr; old_pred = old_pred->NeighboringPredecessor()) {
         // Store the current index of the {old_pred}.
-        DCHECK_EQ(old_pred->custom_data(), invalid_custom_data);
-        old_pred->custom_data() = pos--;
+        old_pred->set_custom_data(pos--, Block::CustomDataKind::kPhiInputIndex);
       }
 
       // Filling {new_inputs}: we iterate the new predecessors, and, for each
@@ -470,8 +465,8 @@ class GraphVisitor {
            new_pred != nullptr; new_pred = new_pred->NeighboringPredecessor()) {
         const Block* origin = new_pred->OriginForBlockEnd();
         DCHECK_NOT_NULL(origin);
-        DCHECK_NE(origin->custom_data(), invalid_custom_data);
-        OpIndex input = old_inputs[origin->custom_data()];
+        OpIndex input = old_inputs[origin->get_custom_data(
+            Block::CustomDataKind::kPhiInputIndex)];
         // Phis inputs have to come from predecessors. We thus have to
         // MapToNewGraph with {predecessor_index} so that we get an OpIndex that
         // is from a predecessor rather than one that comes from a Variable
@@ -507,21 +502,58 @@ class GraphVisitor {
     OpIndex frame_state = MapToNewGraphIfValid(op.frame_state());
     auto arguments = MapToNewGraph<16>(op.arguments());
     return assembler().ReduceCall(callee, frame_state,
-                                  base::VectorOf(arguments), op.descriptor);
+                                  base::VectorOf(arguments), op.descriptor,
+                                  op.Effects());
+  }
+  OpIndex AssembleOutputGraphDidntThrow(const DidntThrowOp& op) {
+    const Operation& throwing_operation =
+        input_graph().Get(op.throwing_operation());
+    OpIndex result;
+    switch (throwing_operation.opcode) {
+#define CASE(Name)                                                           \
+  case Opcode::k##Name:                                                      \
+    result = AssembleOutputGraph##Name(throwing_operation.Cast<Name##Op>()); \
+    break;
+      TURBOSHAFT_THROWING_OPERATIONS_LIST(CASE)
+#undef CASE
+      default:
+        UNREACHABLE();
+    }
+    return result;
   }
-  OpIndex AssembleOutputGraphCallAndCatchException(
-      const CallAndCatchExceptionOp& op) {
-    OpIndex callee = MapToNewGraph(op.callee());
-    Block* if_success = op.if_success->MapToNextGraph();
-    Block* if_exception = op.if_exception->MapToNextGraph();
-    OpIndex frame_state = MapToNewGraphIfValid(op.frame_state());
-    auto arguments = MapToNewGraph<16>(op.arguments());
-    return assembler().ReduceCallAndCatchException(
-        callee, frame_state, base::VectorOf(arguments), if_success,
-        if_exception, op.descriptor);
+  OpIndex AssembleOutputGraphCheckException(const CheckExceptionOp& op) {
+    Graph::OpIndexIterator it(op.didnt_throw_block->begin(),
+                              &assembler().input_graph());
+    Graph::OpIndexIterator end(op.didnt_throw_block->end(),
+                               &assembler().input_graph());
+    // To translate `CheckException` to the new graph, we reduce the throwing
+    // operation (actually it's `DidntThrow` operation, but that triggers the
+    // actual reduction) with a catch scope. If the reduction replaces the
+    // throwing operation with other throwing operations, all of them will be
+    // connected to the provided catch block. The reduction should automatically
+    // bind a block that represents non-throwing control flow of the original
+    // operation, so we can inline the rest of the `didnt_throw` block.
+    {
+      typename Assembler::CatchScope scope(assembler(),
+                                           op.catch_block->MapToNextGraph());
+      DCHECK(input_graph().Get(*it).template Is<DidntThrowOp>());
+      if (!assembler().InlineOp(*it, op.didnt_throw_block)) {
+        return OpIndex::Invalid();
+      }
+      ++it;
+    }
+    for (; it != end; ++it) {
+      // Using `InlineOp` requires that the inlined operation is not emitted
+      // multiple times. This is the case here because we just removed the
+      // single predecessor of `didnt_throw_block`.
+      if (!assembler().InlineOp(*it, op.didnt_throw_block)) {
+        break;
+      }
+    }
+    return OpIndex::Invalid();
   }
-  OpIndex AssembleOutputGraphLoadException(const LoadExceptionOp& op) {
-    return assembler().ReduceLoadException();
+  OpIndex AssembleOutputGraphCatchBlockBegin(const CatchBlockBeginOp& op) {
+    return assembler().ReduceCatchBlockBegin();
   }
   OpIndex AssembleOutputGraphTailCall(const TailCallOp& op) {
     OpIndex callee = MapToNewGraph(op.callee());
@@ -573,17 +605,10 @@ class GraphVisitor {
     return assembler().ReduceTryChange(MapToNewGraph(op.input()), op.kind,
                                        op.from, op.to);
   }
-  OpIndex AssembleOutputGraphTag(const TagOp& op) {
-    return assembler().ReduceTag(MapToNewGraph(op.input()), op.kind);
-  }
-  OpIndex AssembleOutputGraphUntag(const UntagOp& op) {
-    return assembler().ReduceUntag(MapToNewGraph(op.input()), op.kind, op.rep);
-  }
-
-  OpIndex AssembleOutputGraphFloat64InsertWord32(
-      const Float64InsertWord32Op& op) {
-    return assembler().ReduceFloat64InsertWord32(
-        MapToNewGraph(op.float64()), MapToNewGraph(op.word32()), op.kind);
+  OpIndex AssembleOutputGraphBitcastWord32PairToFloat64(
+      const BitcastWord32PairToFloat64Op& op) {
+    return assembler().ReduceBitcastWord32PairToFloat64(
+        MapToNewGraph(op.high_word32()), MapToNewGraph(op.low_word32()));
   }
   OpIndex AssembleOutputGraphTaggedBitcast(const TaggedBitcastOp& op) {
     return assembler().ReduceTaggedBitcast(MapToNewGraph(op.input()), op.from,
@@ -597,33 +622,53 @@ class GraphVisitor {
     return assembler().ReduceFloatIs(MapToNewGraph(op.input()), op.kind,
                                      op.input_rep);
   }
-  OpIndex AssembleOutputGraphConvertToObject(const ConvertToObjectOp& op) {
-    return assembler().ReduceConvertToObject(
+  OpIndex AssembleOutputGraphObjectIsNumericValue(
+      const ObjectIsNumericValueOp& op) {
+    return assembler().ReduceObjectIsNumericValue(MapToNewGraph(op.input()),
+                                                  op.kind, op.input_rep);
+  }
+  OpIndex AssembleOutputGraphConvert(const ConvertOp& op) {
+    return assembler().ReduceConvert(MapToNewGraph(op.input()), op.from, op.to);
+  }
+  OpIndex AssembleOutputGraphConvertUntaggedToJSPrimitive(
+      const ConvertUntaggedToJSPrimitiveOp& op) {
+    return assembler().ReduceConvertUntaggedToJSPrimitive(
         MapToNewGraph(op.input()), op.kind, op.input_rep,
         op.input_interpretation, op.minus_zero_mode);
   }
-  OpIndex AssembleOutputGraphConvertToObjectOrDeopt(
-      const ConvertToObjectOrDeoptOp& op) {
-    return assembler().ReduceConvertToObjectOrDeopt(
+  OpIndex AssembleOutputGraphConvertUntaggedToJSPrimitiveOrDeopt(
+      const ConvertUntaggedToJSPrimitiveOrDeoptOp& op) {
+    return assembler().ReduceConvertUntaggedToJSPrimitiveOrDeopt(
         MapToNewGraph(op.input()), MapToNewGraph(op.frame_state()), op.kind,
         op.input_rep, op.input_interpretation, op.feedback);
   }
-  OpIndex AssembleOutputGraphConvertObjectToPrimitive(
-      const ConvertObjectToPrimitiveOp& op) {
-    return assembler().ReduceConvertObjectToPrimitive(
+  OpIndex AssembleOutputGraphConvertJSPrimitiveToUntagged(
+      const ConvertJSPrimitiveToUntaggedOp& op) {
+    return assembler().ReduceConvertJSPrimitiveToUntagged(
         MapToNewGraph(op.input()), op.kind, op.input_assumptions);
   }
-  OpIndex AssembleOutputGraphConvertObjectToPrimitiveOrDeopt(
-      const ConvertObjectToPrimitiveOrDeoptOp& op) {
-    return assembler().ReduceConvertObjectToPrimitiveOrDeopt(
+  OpIndex AssembleOutputGraphConvertJSPrimitiveToUntaggedOrDeopt(
+      const ConvertJSPrimitiveToUntaggedOrDeoptOp& op) {
+    return assembler().ReduceConvertJSPrimitiveToUntaggedOrDeopt(
         MapToNewGraph(op.input()), MapToNewGraph(op.frame_state()),
         op.from_kind, op.to_kind, op.minus_zero_mode, op.feedback);
   }
-  OpIndex AssembleOutputGraphTruncateObjectToPrimitive(
-      const TruncateObjectToPrimitiveOp& op) {
-    return assembler().ReduceTruncateObjectToPrimitive(
+  OpIndex AssembleOutputGraphTruncateJSPrimitiveToUntagged(
+      const TruncateJSPrimitiveToUntaggedOp& op) {
+    return assembler().ReduceTruncateJSPrimitiveToUntagged(
         MapToNewGraph(op.input()), op.kind, op.input_assumptions);
   }
+  OpIndex AssembleOutputGraphTruncateJSPrimitiveToUntaggedOrDeopt(
+      const TruncateJSPrimitiveToUntaggedOrDeoptOp& op) {
+    return assembler().ReduceTruncateJSPrimitiveToUntaggedOrDeopt(
+        MapToNewGraph(op.input()), MapToNewGraph(op.frame_state()), op.kind,
+        op.input_requirement, op.feedback);
+  }
+  OpIndex AssembleOutputGraphConvertJSPrimitiveToObject(
+      const ConvertJSPrimitiveToObjectOp& op) {
+    return assembler().ReduceConvertJSPrimitiveToObject(
+        MapToNewGraph(op.value()), MapToNewGraph(op.global_proxy()), op.mode);
+  }
   OpIndex AssembleOutputGraphSelect(const SelectOp& op) {
     return assembler().ReduceSelect(
         MapToNewGraph(op.cond()), MapToNewGraph(op.vtrue()),
@@ -632,6 +677,22 @@ class GraphVisitor {
   OpIndex AssembleOutputGraphConstant(const ConstantOp& op) {
     return assembler().ReduceConstant(op.kind, op.storage);
   }
+  OpIndex AssembleOutputGraphAtomicRMW(const AtomicRMWOp& op) {
+    return assembler().ReduceAtomicRMW(
+        MapToNewGraph(op.base()), MapToNewGraph(op.index()),
+        MapToNewGraph(op.value()), MapToNewGraphIfValid(op.expected()),
+        op.bin_op, op.result_rep, op.input_rep, op.memory_access_kind);
+  }
+
+  OpIndex AssembleOutputGraphAtomicWord32Pair(const AtomicWord32PairOp& op) {
+    return assembler().ReduceAtomicWord32Pair(
+        MapToNewGraph(op.base()), MapToNewGraphIfValid(op.index()),
+        MapToNewGraphIfValid(op.value_low()),
+        MapToNewGraphIfValid(op.value_high()),
+        MapToNewGraphIfValid(op.expected_low()),
+        MapToNewGraphIfValid(op.expected_high()), op.op_kind, op.offset);
+  }
+
   OpIndex AssembleOutputGraphLoad(const LoadOp& op) {
     return assembler().ReduceLoad(
         MapToNewGraph(op.base()), MapToNewGraphIfValid(op.index()), op.kind,
@@ -641,11 +702,12 @@ class GraphVisitor {
     return assembler().ReduceStore(
         MapToNewGraph(op.base()), MapToNewGraphIfValid(op.index()),
         MapToNewGraph(op.value()), op.kind, op.stored_rep, op.write_barrier,
-        op.offset, op.element_size_log2);
+        op.offset, op.element_size_log2,
+        op.maybe_initializing_or_transitioning);
   }
   OpIndex AssembleOutputGraphAllocate(const AllocateOp& op) {
-    return assembler().Allocate(MapToNewGraph(op.size()), op.type,
-                                op.allow_large_objects);
+    return assembler().FinishInitialization(
+        assembler().Allocate(MapToNewGraph(op.size()), op.type));
   }
   OpIndex AssembleOutputGraphDecodeExternalPointer(
       const DecodeExternalPointerOp& op) {
@@ -683,8 +745,9 @@ class GraphVisitor {
                                           op.negated, op.parameters);
   }
   OpIndex AssembleOutputGraphTrapIf(const TrapIfOp& op) {
-    return assembler().ReduceTrapIf(MapToNewGraph(op.condition()), op.negated,
-                                    op.trap_id);
+    return assembler().ReduceTrapIf(MapToNewGraph(op.condition()),
+                                    MapToNewGraphIfValid(op.frame_state()),
+                                    op.negated, op.trap_id);
   }
   OpIndex AssembleOutputGraphTuple(const TupleOp& op) {
     return assembler().ReduceTuple(
@@ -706,7 +769,8 @@ class GraphVisitor {
     return assembler().ReduceUnreachable();
   }
   OpIndex AssembleOutputGraphStaticAssert(const StaticAssertOp& op) {
-    return assembler().ReduceStaticAssert(op.condition(), op.source);
+    return assembler().ReduceStaticAssert(MapToNewGraph(op.condition()),
+                                          op.source);
   }
   OpIndex AssembleOutputGraphCheckTurboshaftTypeOf(
       const CheckTurboshaftTypeOfOp& op) {
@@ -733,6 +797,9 @@ class GraphVisitor {
   OpIndex AssembleOutputGraphDebugBreak(const DebugBreakOp& op) {
     return assembler().ReduceDebugBreak();
   }
+  OpIndex AssembleOutputGraphDebugPrint(const DebugPrintOp& op) {
+    return assembler().ReduceDebugPrint(MapToNewGraph(op.input()), op.rep);
+  }
   OpIndex AssembleOutputGraphBigIntBinop(const BigIntBinopOp& op) {
     return assembler().ReduceBigIntBinop(
         MapToNewGraph(op.left()), MapToNewGraph(op.right()),
@@ -780,6 +847,10 @@ class GraphVisitor {
                                              MapToNewGraph(op.start()),
                                              MapToNewGraph(op.end()));
   }
+  OpIndex AssembleOutputGraphStringConcat(const StringConcatOp& op) {
+    return assembler().ReduceStringConcat(MapToNewGraph(op.left()),
+                                          MapToNewGraph(op.right()));
+  }
   OpIndex AssembleOutputGraphStringEqual(const StringEqualOp& op) {
     return assembler().ReduceStringEqual(MapToNewGraph(op.left()),
                                          MapToNewGraph(op.right()));
@@ -788,23 +859,275 @@ class GraphVisitor {
     return assembler().ReduceStringComparison(
         MapToNewGraph(op.left()), MapToNewGraph(op.right()), op.kind);
   }
+  OpIndex AssembleOutputGraphArgumentsLength(const ArgumentsLengthOp& op) {
+    return assembler().ReduceArgumentsLength(op.kind,
+                                             op.formal_parameter_count);
+  }
+  OpIndex AssembleOutputGraphNewArgumentsElements(
+      const NewArgumentsElementsOp& op) {
+    return assembler().ReduceNewArgumentsElements(
+        MapToNewGraph(op.arguments_count()), op.type,
+        op.formal_parameter_count);
+  }
+  OpIndex AssembleOutputGraphLoadTypedElement(const LoadTypedElementOp& op) {
+    return assembler().ReduceLoadTypedElement(
+        MapToNewGraph(op.buffer()), MapToNewGraph(op.base()),
+        MapToNewGraph(op.external()), MapToNewGraph(op.index()), op.array_type);
+  }
+  OpIndex AssembleOutputGraphLoadDataViewElement(
+      const LoadDataViewElementOp& op) {
+    return assembler().ReduceLoadDataViewElement(
+        MapToNewGraph(op.object()), MapToNewGraph(op.storage()),
+        MapToNewGraph(op.index()), MapToNewGraph(op.is_little_endian()),
+        op.element_type);
+  }
+  OpIndex AssembleOutputGraphLoadStackArgument(const LoadStackArgumentOp& op) {
+    return assembler().ReduceLoadStackArgument(MapToNewGraph(op.base()),
+                                               MapToNewGraph(op.index()));
+  }
+  OpIndex AssembleOutputGraphStoreTypedElement(const StoreTypedElementOp& op) {
+    return assembler().ReduceStoreTypedElement(
+        MapToNewGraph(op.buffer()), MapToNewGraph(op.base()),
+        MapToNewGraph(op.external()), MapToNewGraph(op.index()),
+        MapToNewGraph(op.value()), op.array_type);
+  }
+  OpIndex AssembleOutputGraphStoreDataViewElement(
+      const StoreDataViewElementOp& op) {
+    return assembler().ReduceStoreDataViewElement(
+        MapToNewGraph(op.object()), MapToNewGraph(op.storage()),
+        MapToNewGraph(op.index()), MapToNewGraph(op.value()),
+        MapToNewGraph(op.is_little_endian()), op.element_type);
+  }
+  OpIndex AssembleOutputGraphTransitionAndStoreArrayElement(
+      const TransitionAndStoreArrayElementOp& op) {
+    return assembler().ReduceTransitionAndStoreArrayElement(
+        MapToNewGraph(op.array()), MapToNewGraph(op.index()),
+        MapToNewGraph(op.value()), op.kind, op.fast_map, op.double_map);
+  }
+  OpIndex AssembleOutputGraphCompareMaps(const CompareMapsOp& op) {
+    return assembler().ReduceCompareMaps(MapToNewGraph(op.heap_object()),
+                                         op.maps);
+  }
+  OpIndex AssembleOutputGraphCheckMaps(const CheckMapsOp& op) {
+    return assembler().ReduceCheckMaps(MapToNewGraph(op.heap_object()),
+                                       MapToNewGraph(op.frame_state()), op.maps,
+                                       op.flags, op.feedback);
+  }
+  OpIndex AssembleOutputGraphAssumeMap(const AssumeMapOp& op) {
+    return assembler().ReduceAssumeMap(MapToNewGraph(op.heap_object()),
+                                       op.maps);
+  }
+  OpIndex AssembleOutputGraphCheckedClosure(const CheckedClosureOp& op) {
+    return assembler().ReduceCheckedClosure(MapToNewGraph(op.input()),
+                                            MapToNewGraph(op.frame_state()),
+                                            op.feedback_cell);
+  }
+  OpIndex AssembleOutputGraphCheckEqualsInternalizedString(
+      const CheckEqualsInternalizedStringOp& op) {
+    return assembler().ReduceCheckEqualsInternalizedString(
+        MapToNewGraph(op.expected()), MapToNewGraph(op.value()),
+        MapToNewGraph(op.frame_state()));
+  }
+  OpIndex AssembleOutputGraphLoadMessage(const LoadMessageOp& op) {
+    return assembler().ReduceLoadMessage(MapToNewGraph(op.offset()));
+  }
+  OpIndex AssembleOutputGraphStoreMessage(const StoreMessageOp& op) {
+    return assembler().ReduceStoreMessage(MapToNewGraph(op.offset()),
+                                          MapToNewGraph(op.object()));
+  }
+  OpIndex AssembleOutputGraphSameValue(const SameValueOp& op) {
+    return assembler().ReduceSameValue(MapToNewGraph(op.left()),
+                                       MapToNewGraph(op.right()), op.mode);
+  }
+  OpIndex AssembleOutputGraphFloat64SameValue(const Float64SameValueOp& op) {
+    return assembler().ReduceFloat64SameValue(MapToNewGraph(op.left()),
+                                              MapToNewGraph(op.right()));
+  }
+  OpIndex AssembleOutputGraphFastApiCall(const FastApiCallOp& op) {
+    auto arguments = MapToNewGraph<8>(op.arguments());
+    return assembler().ReduceFastApiCall(MapToNewGraph(op.data_argument()),
+                                         base::VectorOf(arguments),
+                                         op.parameters);
+  }
+  OpIndex AssembleOutputGraphRuntimeAbort(const RuntimeAbortOp& op) {
+    return assembler().ReduceRuntimeAbort(op.reason);
+  }
+  OpIndex AssembleOutputGraphEnsureWritableFastElements(
+      const EnsureWritableFastElementsOp& op) {
+    return assembler().ReduceEnsureWritableFastElements(
+        MapToNewGraph(op.object()), MapToNewGraph(op.elements()));
+  }
+  OpIndex AssembleOutputGraphMaybeGrowFastElements(
+      const MaybeGrowFastElementsOp& op) {
+    return assembler().ReduceMaybeGrowFastElements(
+        MapToNewGraph(op.object()), MapToNewGraph(op.elements()),
+        MapToNewGraph(op.index()), MapToNewGraph(op.elements_length()),
+        MapToNewGraph(op.frame_state()), op.mode, op.feedback);
+  }
+  OpIndex AssembleOutputGraphTransitionElementsKind(
+      const TransitionElementsKindOp& op) {
+    return assembler().ReduceTransitionElementsKind(MapToNewGraph(op.object()),
+                                                    op.transition);
+  }
+  OpIndex AssembleOutputGraphFindOrderedHashEntry(
+      const FindOrderedHashEntryOp& op) {
+    return assembler().ReduceFindOrderedHashEntry(
+        MapToNewGraph(op.data_structure()), MapToNewGraph(op.key()), op.kind);
+  }
+  OpIndex AssembleOutputGraphWord32PairBinop(const Word32PairBinopOp& op) {
+    return assembler().ReduceWord32PairBinop(op.left_low(), op.left_high(),
+                                             op.right_low(), op.right_high(),
+                                             op.kind);
+  }
+
+#ifdef V8_ENABLE_WEBASSEMBLY
+  OpIndex AssembleOutputGraphGlobalGet(const GlobalGetOp& op) {
+    return assembler().ReduceGlobalGet(MapToNewGraph(op.instance()), op.global);
+  }
+
+  OpIndex AssembleOutputGraphGlobalSet(const GlobalSetOp& op) {
+    return assembler().ReduceGlobalSet(MapToNewGraph(op.instance()),
+                                       MapToNewGraph(op.value()), op.global);
+  }
+
+  OpIndex AssembleOutputGraphNull(const NullOp& op) {
+    return assembler().ReduceNull(op.type);
+  }
+
+  OpIndex AssembleOutputGraphIsNull(const IsNullOp& op) {
+    return assembler().ReduceIsNull(MapToNewGraph(op.object()), op.type);
+  }
+
+  OpIndex AssembleOutputGraphAssertNotNull(const AssertNotNullOp& op) {
+    return assembler().ReduceAssertNotNull(MapToNewGraph(op.object()), op.type,
+                                           op.trap_id);
+  }
+
+  OpIndex AssembleOutputGraphRttCanon(const RttCanonOp& op) {
+    return assembler().ReduceRttCanon(MapToNewGraph(op.instance()),
+                                      op.type_index);
+  }
+
+  OpIndex AssembleOutputGraphWasmTypeCheck(const WasmTypeCheckOp& op) {
+    return assembler().ReduceWasmTypeCheck(
+        MapToNewGraph(op.object()), MapToNewGraphIfValid(op.rtt()), op.config);
+  }
+
+  OpIndex AssembleOutputGraphWasmTypeCast(const WasmTypeCastOp& op) {
+    return assembler().ReduceWasmTypeCast(
+        MapToNewGraph(op.object()), MapToNewGraphIfValid(op.rtt()), op.config);
+  }
+
+  OpIndex AssembleOutputGraphStructGet(const StructGetOp& op) {
+    return assembler().ReduceStructGet(MapToNewGraph(op.object()), op.type,
+                                       op.field_index, op.is_signed,
+                                       op.null_check);
+  }
+
+  OpIndex AssembleOutputGraphStructSet(const StructSetOp& op) {
+    return assembler().ReduceStructSet(MapToNewGraph(op.object()),
+                                       MapToNewGraph(op.value()), op.type,
+                                       op.field_index, op.null_check);
+  }
+
+  OpIndex AssembleOutputGraphArrayGet(const ArrayGetOp& op) {
+    return assembler().ReduceArrayGet(MapToNewGraph(op.array()),
+                                      MapToNewGraph(op.index()),
+                                      op.element_type, op.is_signed);
+  }
+
+  OpIndex AssembleOutputGraphArraySet(const ArraySetOp& op) {
+    return assembler().ReduceArraySet(
+        MapToNewGraph(op.array()), MapToNewGraph(op.index()),
+        MapToNewGraph(op.value()), op.element_type);
+  }
+
+  OpIndex AssembleOutputGraphArrayLength(const ArrayLengthOp& op) {
+    return assembler().ReduceArrayLength(MapToNewGraph(op.array()),
+                                         op.null_check);
+  }
+
+  OpIndex AssembleOutputGraphSimd128Constant(const Simd128ConstantOp& op) {
+    return assembler().ReduceSimd128Constant(op.value);
+  }
+
+  OpIndex AssembleOutputGraphSimd128Binop(const Simd128BinopOp& op) {
+    return assembler().ReduceSimd128Binop(MapToNewGraph(op.left()),
+                                          MapToNewGraph(op.right()), op.kind);
+  }
+
+  OpIndex AssembleOutputGraphSimd128Unary(const Simd128UnaryOp& op) {
+    return assembler().ReduceSimd128Unary(MapToNewGraph(op.input()), op.kind);
+  }
+
+  OpIndex AssembleOutputGraphSimd128Shift(const Simd128ShiftOp& op) {
+    return assembler().ReduceSimd128Shift(MapToNewGraph(op.input()),
+                                          MapToNewGraph(op.shift()), op.kind);
+  }
+
+  OpIndex AssembleOutputGraphSimd128Test(const Simd128TestOp& op) {
+    return assembler().ReduceSimd128Test(MapToNewGraph(op.input()), op.kind);
+  }
+
+  OpIndex AssembleOutputGraphSimd128Splat(const Simd128SplatOp& op) {
+    return assembler().ReduceSimd128Splat(MapToNewGraph(op.input()), op.kind);
+  }
+
+  OpIndex AssembleOutputGraphSimd128Ternary(const Simd128TernaryOp& op) {
+    return assembler().ReduceSimd128Ternary(MapToNewGraph(op.first()),
+                                            MapToNewGraph(op.second()),
+                                            MapToNewGraph(op.third()), op.kind);
+  }
+  OpIndex AssembleOutputGraphSimd128ExtractLane(
+      const Simd128ExtractLaneOp& op) {
+    return assembler().ReduceSimd128ExtractLane(MapToNewGraph(op.input()),
+                                                op.kind, op.lane);
+  }
+  OpIndex AssembleOutputGraphSimd128ReplaceLane(
+      const Simd128ReplaceLaneOp& op) {
+    return assembler().ReduceSimd128ReplaceLane(MapToNewGraph(op.into()),
+                                                MapToNewGraph(op.new_lane()),
+                                                op.kind, op.lane);
+  }
+  OpIndex AssembleOutputGraphSimd128LaneMemory(const Simd128LaneMemoryOp& op) {
+    return assembler().ReduceSimd128LaneMemory(
+        MapToNewGraph(op.base()), MapToNewGraph(op.index()),
+        MapToNewGraph(op.value()), op.mode, op.kind, op.lane_kind, op.lane,
+        op.offset);
+  }
+  OpIndex AssembleOutputGraphSimd128LoadTransform(
+      const Simd128LoadTransformOp& op) {
+    return assembler().ReduceSimd128LoadTransform(
+        MapToNewGraph(op.base()), MapToNewGraph(op.index()), op.load_kind,
+        op.transform_kind, op.offset);
+  }
+  OpIndex AssembleOutputGraphSimd128Shuffle(const Simd128ShuffleOp& op) {
+    return assembler().ReduceSimd128Shuffle(
+        MapToNewGraph(op.left()), MapToNewGraph(op.right()), op.shuffle);
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
 
   void CreateOldToNewMapping(OpIndex old_index, OpIndex new_index) {
-    if (current_block_needs_variables_) {
-      MaybeVariable var = GetVariableFor(old_index);
-      if (!var.has_value()) {
-        base::Optional<RegisterRepresentation> rep =
-            input_graph().Get(old_index).outputs_rep().size() == 1
-                ? base::Optional<RegisterRepresentation>{input_graph()
-                                                             .Get(old_index)
-                                                             .outputs_rep()[0]}
-                : base::nullopt;
-        var = assembler().NewFreshVariable(rep);
-        SetVariableFor(old_index, *var);
+    if constexpr (reducer_list_contains<typename Assembler::ReducerList,
+                                        VariableReducer>::value) {
+      if (current_block_needs_variables_) {
+        MaybeVariable var = GetVariableFor(old_index);
+        if (!var.has_value()) {
+          MaybeRegisterRepresentation rep =
+              input_graph().Get(old_index).outputs_rep().size() == 1
+                  ? static_cast<const MaybeRegisterRepresentation&>(
+                        input_graph().Get(old_index).outputs_rep()[0])
+                  : MaybeRegisterRepresentation::None();
+          var = assembler().NewLoopInvariantVariable(rep);
+          SetVariableFor(old_index, *var);
+        }
+        assembler().SetVariable(*var, new_index);
+        return;
       }
-      assembler().Set(*var, new_index);
-      return;
+    } else {
+      DCHECK(!current_block_needs_variables_);
     }
+    DCHECK(!op_mapping_[old_index.id()].valid());
     op_mapping_[old_index.id()] = new_index;
   }
 
@@ -834,16 +1157,23 @@ class GraphVisitor {
     return result;
   }
 
-  void FixLoopPhis(Block* loop) {
-    DCHECK(loop->IsLoop());
-    for (Operation& op : assembler().output_graph().operations(*loop)) {
-      if (auto* pending_phi = op.TryCast<PendingLoopPhiOp>()) {
-        assembler().output_graph().template Replace<PhiOp>(
-            assembler().output_graph().Index(*pending_phi),
-            base::VectorOf(
-                {pending_phi->first(),
-                 MapToNewGraph(pending_phi->data.old_backedge_index)}),
-            pending_phi->rep);
+  void FixLoopPhis(Block* input_graph_loop) {
+    DCHECK(input_graph_loop->IsLoop());
+    Block* output_graph_loop = input_graph_loop->MapToNextGraph();
+    DCHECK(output_graph_loop->IsLoop());
+    for (const Operation& op : assembler().input_graph().operations(
+             input_graph_loop->begin(), input_graph_loop->end())) {
+      if (auto* input_phi = op.TryCast<PhiOp>()) {
+        OpIndex phi_index =
+            MapToNewGraph<true>(assembler().input_graph().Index(*input_phi));
+        if (!phi_index.valid() || !output_graph_loop->Contains(phi_index)) {
+          // Unused phis are skipped, so they are not be mapped to anything in
+          // the new graph. If the phi is reduced to an operation from a
+          // different block, then there is no loop phi in the current loop
+          // header to take care of.
+          continue;
+        }
+        assembler().FixLoopPhi(*input_phi, phi_index, output_graph_loop);
       }
     }
   }
diff --git a/deps/v8/src/compiler/turboshaft/optimize-phase.cc b/deps/v8/src/compiler/turboshaft/optimize-phase.cc
index c104f3b00efd18..7a5f1c4fb017df 100644
--- a/deps/v8/src/compiler/turboshaft/optimize-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/optimize-phase.cc
@@ -8,23 +8,26 @@
 #include "src/compiler/turboshaft/late-escape-analysis-reducer.h"
 #include "src/compiler/turboshaft/machine-optimization-reducer.h"
 #include "src/compiler/turboshaft/memory-optimization-reducer.h"
+#include "src/compiler/turboshaft/pretenuring-propagation-reducer.h"
+#include "src/compiler/turboshaft/required-optimization-reducer.h"
+#include "src/compiler/turboshaft/structural-optimization-reducer.h"
 #include "src/compiler/turboshaft/value-numbering-reducer.h"
 #include "src/compiler/turboshaft/variable-reducer.h"
 #include "src/numbers/conversions-inl.h"
 
 namespace v8::internal::compiler::turboshaft {
 
-void OptimizePhase::Run(PipelineData* data, Zone* temp_zone) {
-  UnparkedScopeIfNeeded scope(data->broker(),
+void OptimizePhase::Run(Zone* temp_zone) {
+  UnparkedScopeIfNeeded scope(PipelineData::Get().broker(),
                               v8_flags.turboshaft_trace_reduction);
   turboshaft::OptimizationPhase<
+      turboshaft::StructuralOptimizationReducer, turboshaft::VariableReducer,
       turboshaft::LateEscapeAnalysisReducer,
-      turboshaft::MemoryOptimizationReducer, turboshaft::VariableReducer,
+      turboshaft::PretenuringPropagationReducer,
+      turboshaft::MemoryOptimizationReducer,
       turboshaft::MachineOptimizationReducerSignallingNanImpossible,
-      turboshaft::ValueNumberingReducer>::
-      Run(data->isolate(), &data->graph(), temp_zone, data->node_origins(),
-          std::tuple{
-              turboshaft::MemoryOptimizationReducerArgs{data->isolate()}});
+      turboshaft::RequiredOptimizationReducer,
+      turboshaft::ValueNumberingReducer>::Run(temp_zone);
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/optimize-phase.h b/deps/v8/src/compiler/turboshaft/optimize-phase.h
index 43fcd2471d3d69..56684176d0e698 100644
--- a/deps/v8/src/compiler/turboshaft/optimize-phase.h
+++ b/deps/v8/src/compiler/turboshaft/optimize-phase.h
@@ -12,7 +12,7 @@ namespace v8::internal::compiler::turboshaft {
 struct OptimizePhase {
   DECL_TURBOSHAFT_PHASE_CONSTANTS(Optimize)
 
-  void Run(PipelineData* data, Zone* temp_zone);
+  void Run(Zone* temp_zone);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/phase.cc b/deps/v8/src/compiler/turboshaft/phase.cc
index be26569e1abdc4..399d227bcb6d43 100644
--- a/deps/v8/src/compiler/turboshaft/phase.cc
+++ b/deps/v8/src/compiler/turboshaft/phase.cc
@@ -12,21 +12,22 @@
 
 namespace v8::internal::compiler::turboshaft {
 
-void PrintTurboshaftGraph(PipelineData* data, Zone* temp_zone,
-                          CodeTracer* code_tracer, const char* phase_name) {
-  if (data->info()->trace_turbo_json()) {
-    UnparkedScopeIfNeeded scope(data->broker());
+void PrintTurboshaftGraph(Zone* temp_zone, CodeTracer* code_tracer,
+                          const char* phase_name) {
+  const PipelineData& data = PipelineData::Get();
+  if (data.info()->trace_turbo_json()) {
+    UnparkedScopeIfNeeded scope(data.broker());
     AllowHandleDereference allow_deref;
-    turboshaft::Graph& graph = data->graph();
+    turboshaft::Graph& graph = data.graph();
 
     {
-      TurboJsonFile json_of(data->info(), std::ios_base::app);
+      TurboJsonFile json_of(data.info(), std::ios_base::app);
       json_of << "{\"name\":\"" << phase_name
               << "\",\"type\":\"turboshaft_graph\",\"data\":"
-              << AsJSON(graph, data->node_origins(), temp_zone) << "},\n";
+              << AsJSON(graph, data.node_origins(), temp_zone) << "},\n";
     }
     PrintTurboshaftCustomDataPerOperation(
-        data->info(), "Properties", graph,
+        data.info(), "Properties", graph,
         [](std::ostream& stream, const turboshaft::Graph& graph,
            turboshaft::OpIndex index) -> bool {
           const auto& op = graph.Get(index);
@@ -34,7 +35,7 @@ void PrintTurboshaftGraph(PipelineData* data, Zone* temp_zone,
           return true;
         });
     PrintTurboshaftCustomDataPerOperation(
-        data->info(), "Types", graph,
+        data.info(), "Types", graph,
         [](std::ostream& stream, const turboshaft::Graph& graph,
            turboshaft::OpIndex index) -> bool {
           turboshaft::Type type = graph.operation_types()[index];
@@ -45,15 +46,16 @@ void PrintTurboshaftGraph(PipelineData* data, Zone* temp_zone,
           return false;
         });
     PrintTurboshaftCustomDataPerOperation(
-        data->info(), "Use Count (saturated)", graph,
+        data.info(), "Use Count (saturated)", graph,
         [](std::ostream& stream, const turboshaft::Graph& graph,
            turboshaft::OpIndex index) -> bool {
-          stream << static_cast<int>(graph.Get(index).saturated_use_count);
+          stream << static_cast<int>(
+              graph.Get(index).saturated_use_count.Get());
           return true;
         });
 #ifdef DEBUG
     PrintTurboshaftCustomDataPerBlock(
-        data->info(), "Type Refinements", graph,
+        data.info(), "Type Refinements", graph,
         [](std::ostream& stream, const turboshaft::Graph& graph,
            turboshaft::BlockIndex index) -> bool {
           const std::vector<std::pair<turboshaft::OpIndex, turboshaft::Type>>&
@@ -68,14 +70,14 @@ void PrintTurboshaftGraph(PipelineData* data, Zone* temp_zone,
 #endif  // DEBUG
   }
 
-  if (data->info()->trace_turbo_graph()) {
+  if (data.info()->trace_turbo_graph()) {
     DCHECK(code_tracer);
-    UnparkedScopeIfNeeded scope(data->broker());
+    UnparkedScopeIfNeeded scope(data.broker());
     AllowHandleDereference allow_deref;
 
     CodeTracer::StreamScope tracing_scope(code_tracer);
     tracing_scope.stream() << "\n----- " << phase_name << " -----\n"
-                           << data->graph();
+                           << data.graph();
   }
 }
 
diff --git a/deps/v8/src/compiler/turboshaft/phase.h b/deps/v8/src/compiler/turboshaft/phase.h
index 8096ac4622c395..091d0886b4622e 100644
--- a/deps/v8/src/compiler/turboshaft/phase.h
+++ b/deps/v8/src/compiler/turboshaft/phase.h
@@ -5,10 +5,16 @@
 #ifndef V8_COMPILER_TURBOSHAFT_PHASE_H_
 #define V8_COMPILER_TURBOSHAFT_PHASE_H_
 
+#include <type_traits>
+
+#include "src/base/contextual.h"
+#include "src/codegen/assembler.h"
+#include "src/compiler/backend/instruction.h"
 #include "src/compiler/compiler-source-position-table.h"
 #include "src/compiler/node-origin-table.h"
 #include "src/compiler/phase.h"
 #include "src/compiler/turboshaft/graph.h"
+#include "src/compiler/turboshaft/sidetable.h"
 
 #define DECL_TURBOSHAFT_PHASE_CONSTANTS(Name)                  \
   DECL_PIPELINE_PHASE_CONSTANTS_HELPER(Turboshaft##Name,       \
@@ -21,20 +27,37 @@ class Schedule;
 
 namespace v8::internal::compiler::turboshaft {
 
-class PipelineData {
+template <typename P>
+struct produces_printable_graph : public std::true_type {};
+
+class PipelineData : public base::ContextualClass<PipelineData> {
  public:
   explicit PipelineData(OptimizedCompilationInfo* const& info,
                         Schedule*& schedule, Zone*& graph_zone,
                         JSHeapBroker*& broker, Isolate* const& isolate,
                         SourcePositionTable*& source_positions,
-                        NodeOriginTable*& node_origins)
+                        NodeOriginTable*& node_origins,
+                        InstructionSequence*& sequence, Frame*& frame,
+                        AssemblerOptions& assembler_options,
+                        size_t* address_of_max_unoptimized_frame_height,
+                        size_t* address_of_max_pushed_argument_count,
+                        Zone*& instruction_zone)
       : info_(info),
         schedule_(schedule),
         graph_zone_(graph_zone),
         broker_(broker),
         isolate_(isolate),
         source_positions_(source_positions),
-        node_origins_(node_origins) {}
+        node_origins_(node_origins),
+        sequence_(sequence),
+        frame_(frame),
+        assembler_options_(assembler_options),
+        address_of_max_unoptimized_frame_height_(
+            address_of_max_unoptimized_frame_height),
+        address_of_max_pushed_argument_count_(
+            address_of_max_pushed_argument_count),
+        instruction_zone_(instruction_zone),
+        graph_(std::make_unique<turboshaft::Graph>(graph_zone_)) {}
 
   bool has_graph() const { return graph_ != nullptr; }
   turboshaft::Graph& graph() const { return *graph_; }
@@ -46,16 +69,43 @@ class PipelineData {
   Isolate* isolate() const { return isolate_; }
   SourcePositionTable* source_positions() const { return source_positions_; }
   NodeOriginTable* node_origins() const { return node_origins_; }
+  InstructionSequence* sequence() const { return sequence_; }
+  Frame* frame() const { return frame_; }
+  AssemblerOptions& assembler_options() const { return assembler_options_; }
+  size_t* address_of_max_unoptimized_frame_height() const {
+    return address_of_max_unoptimized_frame_height_;
+  }
+  size_t* address_of_max_pushed_argument_count() const {
+    return address_of_max_pushed_argument_count_;
+  }
+  Zone* instruction_zone() const { return instruction_zone_; }
 
-  void CreateTurboshaftGraph() {
-    DCHECK_NULL(graph_);
-    DCHECK(graph_zone_);
-    graph_ = std::make_unique<turboshaft::Graph>(graph_zone_);
+#if V8_ENABLE_WEBASSEMBLY
+  const wasm::FunctionSig* wasm_sig() const {
+    DCHECK(wasm_sig_ != nullptr);
+    return wasm_sig_;
   }
+  void set_wasm_sig(const wasm::FunctionSig* sig) { wasm_sig_ = sig; }
+  const wasm::WasmModule* wasm_module() const { return wasm_module_; }
+  void set_wasm_module(const wasm::WasmModule* module) {
+    wasm_module_ = module;
+  }
+#endif
 
   void reset_schedule() { schedule_ = nullptr; }
 
-  void DeleteGraphZone() { graph_ = nullptr; }
+  void InitializeInstructionSequence(const CallDescriptor* call_descriptor) {
+    DCHECK_NULL(sequence_);
+    InstructionBlocks* instruction_blocks =
+        InstructionSequence::InstructionBlocksFor(instruction_zone(), *graph_);
+    sequence_ = instruction_zone()->New<InstructionSequence>(
+        isolate(), instruction_zone(), instruction_blocks);
+    if (call_descriptor && call_descriptor->RequiresFrameAsIncoming()) {
+      sequence_->instruction_blocks()[0]->mark_needs_frame();
+    } else {
+      DCHECK(call_descriptor->CalleeSavedFPRegisters().is_empty());
+    }
+  }
 
  private:
   // Turbofan's PipelineData owns most of these objects. We only hold references
@@ -69,12 +119,25 @@ class PipelineData {
   Isolate* const& isolate_;
   SourcePositionTable*& source_positions_;
   NodeOriginTable*& node_origins_;
-
-  std::unique_ptr<turboshaft::Graph> graph_ = nullptr;
+  InstructionSequence*& sequence_;
+  Frame*& frame_;
+  AssemblerOptions& assembler_options_;
+  size_t* address_of_max_unoptimized_frame_height_;
+  size_t* address_of_max_pushed_argument_count_;
+  Zone*& instruction_zone_;
+
+#if V8_ENABLE_WEBASSEMBLY
+  // TODO(14108): Consider splitting wasm members into its own WasmPipelineData
+  // if we need many of them.
+  const wasm::FunctionSig* wasm_sig_ = nullptr;
+  const wasm::WasmModule* wasm_module_ = nullptr;
+#endif
+
+  std::unique_ptr<turboshaft::Graph> graph_;
 };
 
-void PrintTurboshaftGraph(PipelineData* data, Zone* temp_zone,
-                          CodeTracer* code_tracer, const char* phase_name);
+void PrintTurboshaftGraph(Zone* temp_zone, CodeTracer* code_tracer,
+                          const char* phase_name);
 
 }  // namespace v8::internal::compiler::turboshaft
 
diff --git a/deps/v8/src/compiler/turboshaft/pretenuring-propagation-reducer.cc b/deps/v8/src/compiler/turboshaft/pretenuring-propagation-reducer.cc
new file mode 100644
index 00000000000000..bd9341fc881876
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/pretenuring-propagation-reducer.cc
@@ -0,0 +1,150 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/pretenuring-propagation-reducer.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+namespace {
+
+bool CouldBeAllocate(const Operation& base) {
+  return base.Is<PhiOp>() || base.Is<AllocateOp>();
+}
+
+}  // namespace
+
+void PretenuringPropagationAnalyzer::ProcessStore(const StoreOp& store) {
+  OpIndex base_idx = store.base();
+  OpIndex value_idx = store.value();
+  const Operation& base = input_graph_.Get(base_idx);
+  const Operation& value = input_graph_.Get(value_idx);
+
+  if (!CouldBeAllocate(base) || !CouldBeAllocate(value)) {
+    return;
+  }
+
+  if (value.Is<AllocateOp>() &&
+      value.Cast<AllocateOp>().type == AllocationType::kOld) {
+    // {value} is already Old, and we don't care about new-to-old and old-to-old
+    // stores.
+    return;
+  }
+
+  if (value.Is<PhiOp>() && TryFind(value_idx) == nullptr) {
+    // {value} is not worth being recorded, as it's not an Allocation (or a Phi
+    // of Allocations) that could be promoted to Old.
+    return;
+  }
+
+  ZoneVector<OpIndex>* stored_in_base = FindOrCreate(base_idx);
+  stored_in_base->push_back(value_idx);
+}
+
+void PretenuringPropagationAnalyzer::ProcessPhi(const PhiOp& phi) {
+  // Phis act as storing all of their inputs. It's not how they work in
+  // practice, but if a Phi has a Young input, and is stored in an Old object,
+  // it makes sense to Oldify the phi input.
+
+  // For better performance, we only record inputs that could be an allocation:
+  // Phis with an entry in {store_graph_} or AllocateOp.
+  // Note that this is slightly imprecise for loop Phis (since if the backedge
+  // is a Phi itself, it won't have an entry in {store_graph_} yet), but it
+  // should still be good enough for most cases.
+
+  base::SmallVector<OpIndex, 16> interesting_inputs;
+  for (OpIndex input : phi.inputs()) {
+    const Operation& op = input_graph_.Get(input);
+    if (op.Is<AllocateOp>()) {
+      interesting_inputs.push_back(input);
+    } else if (op.Is<PhiOp>() && TryFind(input) != nullptr) {
+      interesting_inputs.push_back(input);
+    }
+  }
+  if (interesting_inputs.empty()) return;
+
+  ZoneVector<OpIndex>* stored_in_phi = Create(input_graph_.Index(phi));
+  for (OpIndex input : interesting_inputs) {
+    stored_in_phi->push_back(input);
+  }
+}
+
+void PretenuringPropagationAnalyzer::ProcessAllocate(
+    const AllocateOp& allocate) {
+  if (allocate.type == AllocationType::kOld) {
+    // We could be a bit more lazy in storing old AllocateOp into {old_allocs_}
+    // (by waiting for a Store or a Phi to use the AllocateOp), but there is
+    // usually very few old allocation, so it makes sense to do it eagerly.
+    old_allocs_.push_back(input_graph_.Index(allocate));
+  }
+}
+
+bool PretenuringPropagationAnalyzer::PushContainedValues(OpIndex base) {
+  // Push into {queue_} all of the values that are "contained" into {base}:
+  // values that are stored to {base} if {base} is an AllocateOp, or Phi inputs
+  // if {base} is a Phi.
+  ZoneVector<OpIndex>* contained = TryFind(base);
+  if (contained == nullptr) return false;
+  for (OpIndex index : *contained) {
+    queue_.push_back(index);
+  }
+  return true;
+}
+
+// Performs a DFS from {old_alloc} and mark everything it finds as Old. The DFS
+// stops on already-Old nodes.
+void PretenuringPropagationAnalyzer::OldifySubgraph(OpIndex old_alloc) {
+  queue_.clear();
+  if (!PushContainedValues(old_alloc)) return;
+
+  while (!queue_.empty()) {
+    OpIndex idx = queue_.back();
+    queue_.pop_back();
+    Operation& op = input_graph_.Get(idx);
+    if (AllocateOp* alloc = op.TryCast<AllocateOp>()) {
+      if (alloc->type == AllocationType::kOld) continue;
+      alloc->type = AllocationType::kOld;
+      PushContainedValues(idx);
+    } else {
+      DCHECK(op.Is<PhiOp>());
+      if (old_phis_.find(idx) != old_phis_.end()) continue;
+      old_phis_.insert(idx);
+      PushContainedValues(idx);
+    }
+  }
+}
+
+void PretenuringPropagationAnalyzer::PropagateAllocationTypes() {
+  for (OpIndex old_alloc : old_allocs_) {
+    OldifySubgraph(old_alloc);
+  }
+}
+
+void PretenuringPropagationAnalyzer::BuildStoreInputGraph() {
+  for (auto& op : input_graph_.AllOperations()) {
+    if (ShouldSkipOperation(op)) {
+      continue;
+    }
+    switch (op.opcode) {
+      case Opcode::kStore:
+        ProcessStore(op.Cast<StoreOp>());
+        break;
+      case Opcode::kAllocate:
+        ProcessAllocate(op.Cast<AllocateOp>());
+        break;
+      case Opcode::kPhi:
+        ProcessPhi(op.Cast<PhiOp>());
+        break;
+      default:
+        break;
+    }
+  }
+}
+
+void PretenuringPropagationAnalyzer::Run() {
+  BuildStoreInputGraph();
+
+  PropagateAllocationTypes();
+}
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/pretenuring-propagation-reducer.h b/deps/v8/src/compiler/turboshaft/pretenuring-propagation-reducer.h
new file mode 100644
index 00000000000000..d064f970d2c458
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/pretenuring-propagation-reducer.h
@@ -0,0 +1,240 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_PRETENURING_PROPAGATION_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_PRETENURING_PROPAGATION_REDUCER_H_
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/phase.h"
+#include "src/compiler/turboshaft/reducer-traits.h"
+#include "src/compiler/turboshaft/utils.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+// This reducer propagates pretenuring (= allocations of Old objects rather than
+// Young objects) throughout the graph: if a young allocation is stored in a old
+// allocation, then we'll make it old instead. The idea being that 1) if an
+// object is stored in a old object, it makes sense for it for be considered
+// old, and 2) this reduces the size of the remembered sets.
+// For instance, if we have:
+//
+//     a = Allocate(old)
+//     b = Allocate(young)
+//     c = Allocate(young)
+//     b.x = c
+//     a.x = b
+//
+// Then we'll make `b` and `c` allocate Old objects directly, because they'll be
+// stored to old objects (transitively for `c`, but it still counts).
+// On the other hand, if we have:
+//
+//     a = Allocate(old)
+//     b = Allocate(young)
+//     c = Allocate(young)
+//     a.x = c
+//     b.c = a
+//
+// Then we'll allocate `c` Old as well (because it is stored in an old pointer),
+// but `b` will stay young, since it's not stored in an Old object (it contains
+// a pointer to an old object, but that's probably not a good reason to make it
+// old).
+//
+//
+// Implementation
+//
+// In a first phase, we iterate the input graph and create a directed graph
+// (called `store_graph_`) where each node points to the nodes stored in it (so,
+// an edge between `a` and `b` means that `b` is stored in `a`). We also collect
+// all of the old allocations in a separate list (`old_allocs_`). The
+// `store_graph_` of the first example above will thus be:
+//
+//    a -----> b -----> c
+//
+// And the graph of the second example will be:
+//
+//   a -----> c        b -----> a
+//
+// (it contains two unconnected subgraphs)
+//
+// Then, in a second phase, we iterate the old allocations (`old_allocs_`), and
+// for each one, we do a DFS in `store_graph_`, marking all of the nodes we
+// encounter as old, and stopping on old nodes (which 1- prevents infinite loops
+// easily, and 2- is sound because all of the initially-old pointers are roots
+// of this phase). On the 2 examples above, `a` will be the old entry in
+// `old_allocs_`, so in both cases will do a single DFS starting from `a`. In
+// the 1st case, it's easy to see that this DFS will encounter `b` and `c`
+// (which will thus both become Old), while in the 2nd case, this DFS will only
+// reach `c` (which will thus become Old, while `b` won't be changed).
+//
+// To be more precise, we also record Phi inputs in `store_graph_`, so that if
+// we have something like:
+//
+//     a = Allocate(old)
+//     b = Allocate(young)
+//     c = Allocate(young)
+//     p = Phi(b, c)
+//     a.x = p
+//
+// Then we oldify both `b` and `c`. In this case, `store_graph_` would be
+//
+//                --------> b
+//               /
+//      a ----> p
+//               \
+//                --------> c
+//
+// Which means that in the second phase, we'll start a DFS on `a` (the only old
+// allocation), move to `p` (the only node reachable from `a`), and the oldify
+// `b` and `c` (which are reachable from `p`).
+//
+//
+// Limitation: when a Phi of old allocations is used as the left-hand side of a
+// Store where the value being stored is a young allocation, we don't oldify the
+// young allocation. For instance, we won't oldify `a` in this example:
+//
+//     a = Allocate(young)
+//     b = Allocate(old)
+//     c = Allocate(old)
+//     p = Phi(b, c)
+//     p.x = a
+//
+// The reason being that the store_graph sturcture isn't well suited for this,
+// since an edge Phi->Node can mean either that Node is stored (via a StoreOp)
+// in Phi, or that Node is an input of Phi. The `store_graph_` for the example
+// above will thus look like:
+//
+//      ------> b
+//     /
+//    p ------> a
+//     \
+//      ------> c
+//
+// In order to oldify `a`, we would need to register `p` in `old_allocs_`,
+// except that we should only do this when `p` is actually old, and we discover
+// that only in the second phase.
+// Consider for instance this more complex example:
+//
+//     a = Allocate(old)
+//     b = Allocate(young)
+//     c = Allocate(young)
+//     d = Allocate(young)
+//     a.x = b
+//     a.y = c
+//     p = Phi(b, c)
+//     p.x = d
+//
+// The graph will be:
+//
+//      -----> b <-----
+//     /               \
+//    a                 p -----> d
+//     \               /
+//      -----> c <-----
+//
+// And the only entry in `old_allocs_` will be `a`. During the DFS from `a`,
+// allocations `b` and `c` will be oldified. At this point, `p` will point to
+// edges to 2 old (`b` and `c`) and 1 young (`d`) nodes.
+// We could look at all Phis in `store_graph_` and consider one by one for being
+// roots of an oldifying DFS: if all of the inputs of a phi `p` (in the sense
+// OpIndex inputs in the input_graph) are Old, then start an oldifying DFS from
+// `p`. However, the worst case complexity would be something like O(n^2) where
+// `n` is the number of Phis in the graph (since we could end up checking all
+// Phis but only finding a single one that is old, but the DFS could make a
+// single other phi old, thus repeating the process). This complexity could be
+// made linear by maintaining additional datastructures on the side, but there
+// isn't much evidence that this optimization would be often useful in practice.
+
+class PretenuringPropagationAnalyzer {
+ public:
+  PretenuringPropagationAnalyzer(Zone* phase_zone, Graph& mutable_input_graph)
+      : zone_(phase_zone),
+        input_graph_(mutable_input_graph),
+        old_allocs_(phase_zone),
+        store_graph_(phase_zone),
+        old_phis_(phase_zone),
+        queue_(phase_zone) {}
+
+  void Run();
+
+ private:
+  void ProcessStore(const StoreOp& store);
+  void ProcessPhi(const PhiOp& phi);
+  void ProcessAllocate(const AllocateOp& allocate);
+
+  bool PushContainedValues(OpIndex base);
+  void OldifySubgraph(OpIndex old_alloc);
+
+  void BuildStoreInputGraph();
+  void PropagateAllocationTypes();
+
+  ZoneVector<OpIndex>* FindOrCreate(OpIndex idx) {
+    auto it = store_graph_.find(idx);
+    if (it != store_graph_.end()) return it->second;
+    return Create(idx);
+  }
+
+  ZoneVector<OpIndex>* Create(OpIndex idx) {
+    DCHECK_EQ(store_graph_.count(idx), 0);
+    ZoneVector<OpIndex>* stored_items = zone_->New<ZoneVector<OpIndex>>(zone_);
+    store_graph_.insert({idx, stored_items});
+    return stored_items;
+  }
+
+  ZoneVector<OpIndex>* TryFind(OpIndex idx) {
+    auto it = store_graph_.find(idx);
+    if (it != store_graph_.end()) return it->second;
+    return nullptr;
+  }
+
+  Zone* zone_;
+  Graph& input_graph_;
+  ZoneVector<OpIndex> old_allocs_;
+
+  // (see main comment at the begining of this file for the role of
+  // `store_graph_`)
+  // `store_graph_` contains mapping from OpIndex to vector<OpIndex>. If for an
+  // entry `a` it contains a vector `v`, it means that `a` has edges to all of
+  // the values in `v`.
+  ZoneUnorderedMap<OpIndex, ZoneVector<OpIndex>*> store_graph_;
+
+  // AllocateOp have an AllocationType field, which is set to kOld once they've
+  // been visited, thus ensuring that recursion ends. However, PhiOp don't have
+  // such a field. Thus, once we've visited a Phi, we store it in {old_phis_} to
+  // prevent revisiting it.
+  ZoneUnorderedSet<OpIndex> old_phis_;
+
+  // Used in the final phase to do DFS in the graph from each old store. It
+  // could be a local variable, but we instead use an instance variable to reuse
+  // memory.
+  ZoneVector<OpIndex> queue_;
+};
+
+// Forward delcaration
+template <class Next>
+class MemoryOptimizationReducer;
+
+template <class Next>
+class PretenuringPropagationReducer : public Next {
+#if defined(__clang__)
+  // PretenuringPropagationReducer should run before MemoryOptimizationReducer
+  // (because once young allocations are marked for folding, they can't be
+  // oldified anymore). We enforce this by making PretenuringPropagationReducer
+  // run in the same phase as MemoryOptimizationReducer, but before.
+  static_assert(next_contains_reducer<Next, MemoryOptimizationReducer>::value);
+#endif
+
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  void Analyze() {
+    PretenuringPropagationAnalyzer analyzer(Asm().phase_zone(),
+                                            Asm().modifiable_input_graph());
+    analyzer.Run();
+    Next::Analyze();
+  }
+};
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_PRETENURING_PROPAGATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/recreate-schedule-phase.cc b/deps/v8/src/compiler/turboshaft/recreate-schedule-phase.cc
index e6935de65db9e0..b666ac9b04ea9d 100644
--- a/deps/v8/src/compiler/turboshaft/recreate-schedule-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/recreate-schedule-phase.cc
@@ -6,13 +6,9 @@
 
 namespace v8::internal::compiler::turboshaft {
 
-RecreateScheduleResult RecreateSchedulePhase::Run(PipelineData* data,
-                                                  Zone* temp_zone,
+RecreateScheduleResult RecreateSchedulePhase::Run(Zone* temp_zone,
                                                   Linkage* linkage) {
-  return RecreateSchedule(data->graph(), data->broker(),
-                          linkage->GetIncomingDescriptor(), data->graph_zone(),
-                          temp_zone, data->source_positions(),
-                          data->node_origins());
+  return RecreateSchedule(linkage->GetIncomingDescriptor(), temp_zone);
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/recreate-schedule-phase.h b/deps/v8/src/compiler/turboshaft/recreate-schedule-phase.h
index d1e980b4f9dc81..d7c29948de7135 100644
--- a/deps/v8/src/compiler/turboshaft/recreate-schedule-phase.h
+++ b/deps/v8/src/compiler/turboshaft/recreate-schedule-phase.h
@@ -13,8 +13,7 @@ namespace v8::internal::compiler::turboshaft {
 struct RecreateSchedulePhase {
   DECL_TURBOSHAFT_PHASE_CONSTANTS(RecreateSchedule)
 
-  RecreateScheduleResult Run(PipelineData* data, Zone* temp_zone,
-                             Linkage* linkage);
+  RecreateScheduleResult Run(Zone* temp_zone, Linkage* linkage);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/recreate-schedule.cc b/deps/v8/src/compiler/turboshaft/recreate-schedule.cc
index 4832cf415e577d..6060c20c204f07 100644
--- a/deps/v8/src/compiler/turboshaft/recreate-schedule.cc
+++ b/deps/v8/src/compiler/turboshaft/recreate-schedule.cc
@@ -9,6 +9,7 @@
 #include "src/base/small-vector.h"
 #include "src/base/template-utils.h"
 #include "src/base/vector.h"
+#include "src/codegen/callable.h"
 #include "src/codegen/machine-type.h"
 #include "src/common/globals.h"
 #include "src/compiler/backend/instruction-selector.h"
@@ -26,6 +27,8 @@
 #include "src/compiler/turboshaft/deopt-data.h"
 #include "src/compiler/turboshaft/graph.h"
 #include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/phase.h"
+#include "src/compiler/turboshaft/representations.h"
 #include "src/compiler/write-barrier-kind.h"
 #include "src/utils/utils.h"
 #include "src/zone/zone-containers.h"
@@ -35,14 +38,15 @@ namespace v8::internal::compiler::turboshaft {
 namespace {
 
 struct ScheduleBuilder {
-  const Graph& input_graph;
-  JSHeapBroker* broker;
   CallDescriptor* call_descriptor;
-  Zone* graph_zone;
   Zone* phase_zone;
-  SourcePositionTable* source_positions;
-  NodeOriginTable* origins;
 
+  const Graph& input_graph = PipelineData::Get().graph();
+  JSHeapBroker* broker = PipelineData::Get().broker();
+  Zone* graph_zone = PipelineData::Get().graph_zone();
+  SourcePositionTable* source_positions =
+      PipelineData::Get().source_positions();
+  NodeOriginTable* origins = PipelineData::Get().node_origins();
   const size_t node_count_estimate =
       static_cast<size_t>(1.1 * input_graph.op_id_count());
   Schedule* const schedule =
@@ -180,36 +184,9 @@ void ScheduleBuilder::ProcessOperation(const Operation& op) {
 #define SHOULD_HAVE_BEEN_LOWERED(op) \
   Node* ScheduleBuilder::ProcessOperation(const op##Op&) { UNREACHABLE(); }
 // These operations should have been lowered in previous reducers already.
-SHOULD_HAVE_BEEN_LOWERED(Allocate)
-SHOULD_HAVE_BEEN_LOWERED(BigIntBinop)
-SHOULD_HAVE_BEEN_LOWERED(BigIntComparison)
-SHOULD_HAVE_BEEN_LOWERED(BigIntEqual)
-SHOULD_HAVE_BEEN_LOWERED(BigIntUnary)
-SHOULD_HAVE_BEEN_LOWERED(ChangeOrDeopt)
-SHOULD_HAVE_BEEN_LOWERED(ConvertToObject)
-SHOULD_HAVE_BEEN_LOWERED(ConvertToObjectOrDeopt)
-SHOULD_HAVE_BEEN_LOWERED(ConvertObjectToPrimitive)
-SHOULD_HAVE_BEEN_LOWERED(ConvertObjectToPrimitiveOrDeopt)
-SHOULD_HAVE_BEEN_LOWERED(DecodeExternalPointer)
-SHOULD_HAVE_BEEN_LOWERED(DoubleArrayMinMax)
-SHOULD_HAVE_BEEN_LOWERED(FloatIs)
-SHOULD_HAVE_BEEN_LOWERED(LoadFieldByIndex)
-SHOULD_HAVE_BEEN_LOWERED(NewArray)
-SHOULD_HAVE_BEEN_LOWERED(NewConsString)
-SHOULD_HAVE_BEEN_LOWERED(ObjectIs)
-SHOULD_HAVE_BEEN_LOWERED(StringAt)
-SHOULD_HAVE_BEEN_LOWERED(StringComparison)
-SHOULD_HAVE_BEEN_LOWERED(StringEqual)
-SHOULD_HAVE_BEEN_LOWERED(StringFromCodePointAt)
-SHOULD_HAVE_BEEN_LOWERED(StringIndexOf)
-SHOULD_HAVE_BEEN_LOWERED(StringLength)
-SHOULD_HAVE_BEEN_LOWERED(StringSubstring)
-#ifdef V8_INTL_SUPPORT
-SHOULD_HAVE_BEEN_LOWERED(StringToCaseIntl)
-#endif  // V8_INTL_SUPPORT
-SHOULD_HAVE_BEEN_LOWERED(Tag)
-SHOULD_HAVE_BEEN_LOWERED(TruncateObjectToPrimitive)
-SHOULD_HAVE_BEEN_LOWERED(Untag)
+TURBOSHAFT_SIMPLIFIED_OPERATION_LIST(SHOULD_HAVE_BEEN_LOWERED)
+TURBOSHAFT_OTHER_OPERATION_LIST(SHOULD_HAVE_BEEN_LOWERED)
+TURBOSHAFT_WASM_OPERATION_LIST(SHOULD_HAVE_BEEN_LOWERED)
 #undef SHOULD_HAVE_BEEN_LOWERED
 
 Node* ScheduleBuilder::ProcessOperation(const WordBinopOp& op) {
@@ -430,6 +407,7 @@ Node* ScheduleBuilder::ProcessOperation(const WordUnaryOp& op) {
   return AddNode(o, {GetNode(op.input())});
 }
 Node* ScheduleBuilder::ProcessOperation(const FloatUnaryOp& op) {
+  DCHECK(FloatUnaryOp::IsSupported(op.kind, op.rep));
   bool float64 = op.rep == FloatRepresentation::Float64();
   const Operator* o;
   switch (op.kind) {
@@ -571,7 +549,7 @@ Node* ScheduleBuilder::ProcessOperation(const ShiftOp& op) {
 }
 Node* ScheduleBuilder::ProcessOperation(const EqualOp& op) {
   const Operator* o;
-  switch (op.rep) {
+  switch (op.rep.value()) {
     case RegisterRepresentation::Word32():
       o = machine.Word32Equal();
       break;
@@ -594,7 +572,7 @@ Node* ScheduleBuilder::ProcessOperation(const EqualOp& op) {
 }
 Node* ScheduleBuilder::ProcessOperation(const ComparisonOp& op) {
   const Operator* o;
-  switch (op.rep) {
+  switch (op.rep.value()) {
     case RegisterRepresentation::Word32():
       switch (op.kind) {
         case ComparisonOp::Kind::kSignedLessThan:
@@ -712,7 +690,7 @@ Node* ScheduleBuilder::ProcessOperation(const ChangeOp& op) {
           DCHECK_EQ(truncate_kind, TruncateKind::kArchitectureDefault);
           o = machine.RoundFloat64ToInt32();
         } else {
-          machine.TruncateFloat32ToUint32(truncate_kind);
+          o = machine.TruncateFloat64ToUint32();
         }
       } else if (op.from == FloatRepresentation::Float32() &&
                  op.to == WordRepresentation::Word32()) {
@@ -747,9 +725,6 @@ Node* ScheduleBuilder::ProcessOperation(const ChangeOp& op) {
       } else if (op.from == WordRepresentation::Word64() &&
                  op.to == FloatRepresentation::Float32()) {
         o = machine.RoundInt64ToFloat32();
-      } else if (op.from == WordRepresentation::Word32() &&
-                 op.to == FloatRepresentation::Float64()) {
-        o = machine.ChangeInt32ToFloat64();
       } else {
         UNIMPLEMENTED();
       }
@@ -817,6 +792,13 @@ Node* ScheduleBuilder::ProcessOperation(const ChangeOp& op) {
         UNIMPLEMENTED();
       }
       break;
+    case Kind::kTruncate:
+      if (op.from == WordRepresentation::Word64() &&
+          op.to == WordRepresentation::Word32()) {
+        o = machine.TruncateInt64ToInt32();
+      } else {
+        UNIMPLEMENTED();
+      }
   }
   return AddNode(o, {GetNode(op.input())});
 }
@@ -855,23 +837,20 @@ Node* ScheduleBuilder::ProcessOperation(const TryChangeOp& op) {
   }
   return AddNode(o, {GetNode(op.input())});
 }
-Node* ScheduleBuilder::ProcessOperation(const Float64InsertWord32Op& op) {
-  switch (op.kind) {
-    case Float64InsertWord32Op::Kind::kHighHalf:
-      return AddNode(machine.Float64InsertHighWord32(),
-                     {GetNode(op.float64()), GetNode(op.word32())});
-    case Float64InsertWord32Op::Kind::kLowHalf:
-      return AddNode(machine.Float64InsertLowWord32(),
-                     {GetNode(op.float64()), GetNode(op.word32())});
-  }
+Node* ScheduleBuilder::ProcessOperation(
+    const BitcastWord32PairToFloat64Op& op) {
+  Node* temp = AddNode(
+      machine.Float64InsertHighWord32(),
+      {AddNode(common.Float64Constant(0), {}), GetNode(op.high_word32())});
+  return AddNode(machine.Float64InsertLowWord32(),
+                 {temp, GetNode(op.low_word32())});
 }
 Node* ScheduleBuilder::ProcessOperation(const TaggedBitcastOp& op) {
   const Operator* o;
   if (op.from == RegisterRepresentation::Tagged() &&
       op.to == RegisterRepresentation::PointerSized()) {
     o = machine.BitcastTaggedToWord();
-  } else if (op.from == RegisterRepresentation::PointerSized() &&
-             op.to == RegisterRepresentation::Tagged()) {
+  } else if (op.from.IsWord() && op.to == RegisterRepresentation::Tagged()) {
     o = machine.BitcastWordToTagged();
   } else if (op.from == RegisterRepresentation::Compressed() &&
              op.to == RegisterRepresentation::Word32()) {
@@ -888,11 +867,30 @@ Node* ScheduleBuilder::ProcessOperation(const SelectOp& op) {
   DCHECK((op.rep == RegisterRepresentation::Word32() &&
           SupportedOperations::word32_select()) ||
          (op.rep == RegisterRepresentation::Word64() &&
-          SupportedOperations::word64_select()));
-
-  const Operator* o = op.rep == RegisterRepresentation::Word32()
-                          ? machine.Word32Select().op()
-                          : machine.Word64Select().op();
+          SupportedOperations::word64_select()) ||
+         (op.rep == RegisterRepresentation::Float32() &&
+          SupportedOperations::float32_select()) ||
+         (op.rep == RegisterRepresentation::Float64() &&
+          SupportedOperations::float64_select()));
+  const Operator* o = nullptr;
+  switch (op.rep.value()) {
+    case RegisterRepresentation::Enum::kWord32:
+      o = machine.Word32Select().op();
+      break;
+    case RegisterRepresentation::Enum::kWord64:
+      o = machine.Word64Select().op();
+      break;
+    case RegisterRepresentation::Enum::kFloat32:
+      o = machine.Float32Select().op();
+      break;
+    case RegisterRepresentation::Enum::kFloat64:
+      o = machine.Float64Select().op();
+      break;
+    case RegisterRepresentation::Enum::kTagged:
+    case RegisterRepresentation::Enum::kCompressed:
+    case RegisterRepresentation::Enum::kSimd128:
+      UNREACHABLE();
+  }
 
   return AddNode(
       o, {GetNode(op.cond()), GetNode(op.vtrue()), GetNode(op.vfalse())});
@@ -900,6 +898,97 @@ Node* ScheduleBuilder::ProcessOperation(const SelectOp& op) {
 Node* ScheduleBuilder::ProcessOperation(const PendingLoopPhiOp& op) {
   UNREACHABLE();
 }
+
+Node* ScheduleBuilder::ProcessOperation(const AtomicWord32PairOp& op) {
+  DCHECK(!Is64());
+  Node* index;
+  if (op.index().valid() && op.offset) {
+    index = AddNode(machine.Int32Add(),
+                    {GetNode(op.index()), IntPtrConstant(op.offset)});
+  } else if (op.index().valid()) {
+    index = GetNode(op.index());
+  } else {
+    index = IntPtrConstant(op.offset);
+  }
+#define BINOP_CASE(OP)                                                 \
+  if (op.op_kind == AtomicWord32PairOp::OpKind::k##OP) {               \
+    return AddNode(                                                    \
+        machine.Word32AtomicPair##OP(),                                \
+        {GetNode(op.base()),                                           \
+         op.index().valid() ? GetNode(op.index()) : IntPtrConstant(0), \
+         GetNode(op.value_low()), GetNode(op.value_high())});          \
+  }
+#define ATOMIC_BINOPS(V) \
+  V(Add)                 \
+  V(Sub)                 \
+  V(And)                 \
+  V(Or)                  \
+  V(Xor)                 \
+  V(Exchange)
+  ATOMIC_BINOPS(BINOP_CASE)
+#undef ATOMIC_BINOPS
+#undef BINOP_CASE
+
+  if (op.op_kind == AtomicWord32PairOp::OpKind::kLoad) {
+    return AddNode(machine.Word32AtomicPairLoad(AtomicMemoryOrder::kSeqCst),
+                   {GetNode(op.base()), index});
+  }
+  if (op.op_kind == AtomicWord32PairOp::OpKind::kStore) {
+    return AddNode(machine.Word32AtomicPairStore(AtomicMemoryOrder::kSeqCst),
+                   {GetNode(op.base()), index, GetNode(op.value_low()),
+                    GetNode(op.value_high())});
+  }
+  DCHECK_EQ(op.op_kind, AtomicWord32PairOp::OpKind::kCompareExchange);
+  return AddNode(machine.Word32AtomicPairCompareExchange(),
+                 {GetNode(op.base()), index, GetNode(op.expected_low()),
+                  GetNode(op.expected_high()), GetNode(op.value_low()),
+                  GetNode(op.value_high())});
+}
+
+Node* ScheduleBuilder::ProcessOperation(const AtomicRMWOp& op) {
+#define ATOMIC_BINOPS(V) \
+  V(Add)                 \
+  V(Sub)                 \
+  V(And)                 \
+  V(Or)                  \
+  V(Xor)                 \
+  V(Exchange)            \
+  V(CompareExchange)
+
+  AtomicOpParameters param(op.input_rep.ToMachineType(), op.memory_access_kind);
+  const Operator* node_op;
+  if (op.result_rep == RegisterRepresentation::Word32()) {
+    switch (op.bin_op) {
+#define CASE(Name)                               \
+  case AtomicRMWOp::BinOp::k##Name:              \
+    node_op = machine.Word32Atomic##Name(param); \
+    break;
+      ATOMIC_BINOPS(CASE)
+#undef CASE
+    }
+  } else {
+    DCHECK_EQ(op.result_rep, RegisterRepresentation::Word64());
+    switch (op.bin_op) {
+#define CASE(Name)                               \
+  case AtomicRMWOp::BinOp::k##Name:              \
+    node_op = machine.Word64Atomic##Name(param); \
+    break;
+      ATOMIC_BINOPS(CASE)
+#undef CASE
+    }
+  }
+#undef ATOMIC_BINOPS
+  Node* base = GetNode(op.base());
+  Node* index = GetNode(op.index());
+  Node* value = GetNode(op.value());
+  if (op.bin_op == AtomicRMWOp::BinOp::kCompareExchange) {
+    Node* expected = GetNode(op.expected());
+    return AddNode(node_op, {base, index, expected, value});
+  } else {
+    return AddNode(node_op, {base, index, value});
+  }
+}
+
 Node* ScheduleBuilder::ProcessOperation(const TupleOp& op) {
   // Tuples are only used for lowerings during reduction. Therefore, we can
   // assume that it is unused if it occurs at this point.
@@ -966,10 +1055,31 @@ Node* ScheduleBuilder::ProcessOperation(const LoadOp& op) {
   const Operator* o;
   if (op.kind.maybe_unaligned) {
     DCHECK(!op.kind.with_trap_handler);
-    o = machine.UnalignedLoad(loaded_rep);
+    if (loaded_rep.representation() == MachineRepresentation::kWord8 ||
+        machine.UnalignedLoadSupported(loaded_rep.representation())) {
+      o = machine.Load(loaded_rep);
+    } else {
+      o = machine.UnalignedLoad(loaded_rep);
+    }
+  } else if (op.kind.is_atomic) {
+    DCHECK(!op.kind.maybe_unaligned);
+    AtomicLoadParameters params(loaded_rep, AtomicMemoryOrder::kSeqCst,
+                                op.kind.with_trap_handler
+                                    ? MemoryAccessKind::kProtected
+                                    : MemoryAccessKind::kNormal);
+    if (op.result_rep == RegisterRepresentation::Word32()) {
+      o = machine.Word32AtomicLoad(params);
+    } else {
+      DCHECK_EQ(op.result_rep, RegisterRepresentation::Word64());
+      o = machine.Word64AtomicLoad(params);
+    }
   } else if (op.kind.with_trap_handler) {
     DCHECK(!op.kind.maybe_unaligned);
-    o = machine.ProtectedLoad(loaded_rep);
+    if (op.kind.tagged_base) {
+      o = machine.LoadTrapOnNull(loaded_rep);
+    } else {
+      o = machine.ProtectedLoad(loaded_rep);
+    }
   } else {
     o = machine.Load(loaded_rep);
   }
@@ -1001,11 +1111,38 @@ Node* ScheduleBuilder::ProcessOperation(const StoreOp& op) {
   if (op.kind.maybe_unaligned) {
     DCHECK(!op.kind.with_trap_handler);
     DCHECK_EQ(op.write_barrier, WriteBarrierKind::kNoWriteBarrier);
-    o = machine.UnalignedStore(op.stored_rep.ToMachineType().representation());
+    if (op.stored_rep.ToMachineType().representation() ==
+            MachineRepresentation::kWord8 ||
+        machine.UnalignedStoreSupported(
+            op.stored_rep.ToMachineType().representation())) {
+      o = machine.Store(StoreRepresentation(
+          op.stored_rep.ToMachineType().representation(), op.write_barrier));
+    } else {
+      o = machine.UnalignedStore(
+          op.stored_rep.ToMachineType().representation());
+    }
+  } else if (op.kind.is_atomic) {
+    AtomicStoreParameters params(op.stored_rep.ToMachineType().representation(),
+                                 op.write_barrier, AtomicMemoryOrder::kSeqCst,
+                                 op.kind.with_trap_handler
+                                     ? MemoryAccessKind::kProtected
+                                     : MemoryAccessKind::kNormal);
+    if (op.stored_rep == MemoryRepresentation::Int64() ||
+        op.stored_rep == MemoryRepresentation::Uint64()) {
+      o = machine.Word64AtomicStore(params);
+    } else {
+      o = machine.Word32AtomicStore(params);
+    }
   } else if (op.kind.with_trap_handler) {
     DCHECK(!op.kind.maybe_unaligned);
-    DCHECK_EQ(op.write_barrier, WriteBarrierKind::kNoWriteBarrier);
-    o = machine.ProtectedStore(op.stored_rep.ToMachineType().representation());
+    if (op.kind.tagged_base) {
+      o = machine.StoreTrapOnNull(StoreRepresentation(
+          op.stored_rep.ToMachineType().representation(), op.write_barrier));
+    } else {
+      DCHECK_EQ(op.write_barrier, WriteBarrierKind::kNoWriteBarrier);
+      o = machine.ProtectedStore(
+          op.stored_rep.ToMachineType().representation());
+    }
   } else {
     o = machine.Store(StoreRepresentation(
         op.stored_rep.ToMachineType().representation(), op.write_barrier));
@@ -1074,9 +1211,13 @@ Node* ScheduleBuilder::ProcessOperation(const DeoptimizeIfOp& op) {
 }
 Node* ScheduleBuilder::ProcessOperation(const TrapIfOp& op) {
   Node* condition = GetNode(op.condition());
-  const Operator* o =
-      op.negated ? common.TrapUnless(op.trap_id) : common.TrapIf(op.trap_id);
-  return AddNode(o, {condition});
+  bool has_frame_state = op.frame_state().valid();
+  Node* frame_state = has_frame_state ? GetNode(op.frame_state()) : nullptr;
+  const Operator* o = op.negated
+                          ? common.TrapUnless(op.trap_id, has_frame_state)
+                          : common.TrapIf(op.trap_id, has_frame_state);
+  return has_frame_state ? AddNode(o, {condition, frame_state})
+                         : AddNode(o, {condition});
 }
 Node* ScheduleBuilder::ProcessOperation(const DeoptimizeOp& op) {
   Node* frame_state = GetNode(op.frame_state());
@@ -1098,10 +1239,45 @@ Node* ScheduleBuilder::ProcessOperation(const PhiOp& op) {
     loop_phis.emplace_back(node, op.input(1));
     return node;
   } else {
-    base::SmallVector<Node*, 8> inputs;
-    for (OpIndex i : op.inputs()) {
-      inputs.push_back(GetNode(i));
+    // Predecessors of {current_input_block} and the TF's matching block might
+    // not be in the same order, so Phi inputs might need to be reordered to
+    // match the new order.
+    // This is similar to what AssembleOutputGraphPhi in OptimizationPhase does,
+    // except that OptimizationPhase has a new->old block mapping, which we
+    // don't have here in RecreateSchedule, so the implementation is slightly
+    // different (relying on std::lower_bound rather than looking up the
+    // old->new mapping).
+    ZoneVector<BasicBlock*> new_predecessors = current_block->predecessors();
+    // Since RecreateSchedule visits the blocks in increasing ID order,
+    // predecessors should be sorted (we rely on this property to binary search
+    // new predecessors corresponding to old ones).
+    auto cmp_basic_block = [](BasicBlock* a, BasicBlock* b) {
+      return a->id().ToInt() < b->id().ToInt();
+    };
+    DCHECK(std::is_sorted(new_predecessors.begin(), new_predecessors.end(),
+                          cmp_basic_block));
+    size_t predecessor_count = new_predecessors.size();
+    base::SmallVector<Node*, 8> inputs(predecessor_count);
+#ifdef DEBUG
+    std::fill(inputs.begin(), inputs.end(), nullptr);
+#endif
+
+    int current_index = 0;
+    for (Block* pred = current_input_block->LastPredecessor(); pred != nullptr;
+         pred = pred->NeighboringPredecessor()) {
+      size_t pred_index = predecessor_count - current_index - 1;
+      auto lower =
+          std::lower_bound(new_predecessors.begin(), new_predecessors.end(),
+                           GetBlock(*pred), cmp_basic_block);
+      DCHECK_NE(lower, new_predecessors.end());
+      size_t new_pred_index = std::distance(new_predecessors.begin(), lower);
+      // Block {pred_index} became predecessor {new_pred_index} in the TF graph.
+      // We thus put the input {pred_index} in position {new_pred_index}.
+      inputs[new_pred_index] = GetNode(op.input(pred_index));
+      ++current_index;
     }
+    DCHECK(!base::contains(inputs, nullptr));
+
     return AddNode(common.Phi(op.rep.machine_representation(), op.input_count),
                    base::VectorOf(inputs));
   }
@@ -1109,23 +1285,10 @@ Node* ScheduleBuilder::ProcessOperation(const PhiOp& op) {
 Node* ScheduleBuilder::ProcessOperation(const ProjectionOp& op) {
   return AddNode(common.Projection(op.index), {GetNode(op.input())});
 }
-Node* ScheduleBuilder::ProcessOperation(const StaticAssertOp& op) {
-  // Static asserts should be (statically asserted and) removed by turboshaft.
-  UnparkedScopeIfNeeded scope(broker);
-  AllowHandleDereference allow_handle_dereference;
-  std::cout << input_graph.Get(op.condition());
-  FATAL(
-      "Expected Turbofan static assert to hold, but got non-true input:\n  %s",
-      op.source);
-}
-Node* ScheduleBuilder::ProcessOperation(const CheckTurboshaftTypeOfOp& op) {
-  if (op.successful) return GetNode(op.input());
-
-  UnparkedScopeIfNeeded scope(broker);
-  AllowHandleDereference allow_handle_dereference;
-  FATAL("Checking type %s of operation %d:%s failed!",
-        op.type.ToString().c_str(), op.input().id(),
-        input_graph.Get(op.input()).ToString().c_str());
+Node* ScheduleBuilder::ProcessOperation(const AssumeMapOp&) {
+  // AssumeMapOp is just a hint that optimization phases can use, but has no
+  // Turbofan equivalent and is thus not used past this point.
+  return nullptr;
 }
 
 std::pair<Node*, MachineType> ScheduleBuilder::BuildDeoptInput(
@@ -1244,11 +1407,11 @@ Node* ScheduleBuilder::ProcessOperation(const FrameStateOp& op) {
   const FrameStateInfo& info = op.data->frame_state_info;
   auto it = op.data->iterator(op.state_values());
 
+  Node* closure = BuildTaggedInput(&it);
   Node* parameter_state_values = BuildStateValues(&it, info.parameter_count());
+  Node* context = BuildTaggedInput(&it);
   Node* register_state_values = BuildStateValues(&it, info.local_count());
   Node* accumulator_state_values = BuildStateValues(&it, info.stack_count());
-  Node* context = BuildTaggedInput(&it);
-  Node* closure = BuildTaggedInput(&it);
   Node* parent =
       op.inlined ? GetNode(op.parent_frame_state()) : tf_graph->start();
 
@@ -1270,39 +1433,32 @@ Node* ScheduleBuilder::ProcessOperation(const CallOp& op) {
   return AddNode(common.Call(op.descriptor->descriptor),
                  base::VectorOf(inputs));
 }
-Node* ScheduleBuilder::ProcessOperation(const CallAndCatchExceptionOp& op) {
-  // Re-building the call
-  base::SmallVector<Node*, 16> inputs;
-  inputs.push_back(GetNode(op.callee()));
-  for (OpIndex i : op.arguments()) {
-    inputs.push_back(GetNode(i));
-  }
-  if (op.HasFrameState()) {
-    DCHECK(op.frame_state().valid());
-    inputs.push_back(GetNode(op.frame_state()));
-  }
-  Node* call =
-      AddNode(common.Call(op.descriptor->descriptor), base::VectorOf(inputs));
+Node* ScheduleBuilder::ProcessOperation(const CheckExceptionOp& op) {
+  Node* call_node = GetNode(op.throwing_operation());
+  DCHECK_EQ(call_node->opcode(), IrOpcode::kCall);
 
   // Re-building the IfSuccess/IfException mechanism.
-  BasicBlock* success_block = GetBlock(*op.if_success);
-  BasicBlock* exception_block = GetBlock(*op.if_exception);
-  schedule->AddCall(current_block, call, success_block, exception_block);
+  BasicBlock* success_block = GetBlock(*op.didnt_throw_block);
+  BasicBlock* exception_block = GetBlock(*op.catch_block);
+  schedule->AddCall(current_block, call_node, success_block, exception_block);
   // Pass `call` as the control input of `IfSuccess` and as both the effect and
   // control input of `IfException`.
-  Node* if_success = MakeNode(common.IfSuccess(), {call});
-  Node* if_exception = MakeNode(common.IfException(), {call, call});
+  Node* if_success = MakeNode(common.IfSuccess(), {call_node});
+  Node* if_exception = MakeNode(common.IfException(), {call_node, call_node});
   schedule->AddNode(success_block, if_success);
   schedule->AddNode(exception_block, if_exception);
   current_block = nullptr;
-  return call;
+  return nullptr;
 }
-Node* ScheduleBuilder::ProcessOperation(const LoadExceptionOp& op) {
+Node* ScheduleBuilder::ProcessOperation(const CatchBlockBeginOp& op) {
   Node* if_exception = current_block->NodeAt(0);
   DCHECK(if_exception != nullptr &&
          if_exception->opcode() == IrOpcode::kIfException);
   return if_exception;
 }
+Node* ScheduleBuilder::ProcessOperation(const DidntThrowOp& op) {
+  return GetNode(op.throwing_operation());
+}
 Node* ScheduleBuilder::ProcessOperation(const TailCallOp& op) {
   base::SmallVector<Node*, 16> inputs;
   inputs.push_back(GetNode(op.callee()));
@@ -1317,6 +1473,7 @@ Node* ScheduleBuilder::ProcessOperation(const TailCallOp& op) {
 }
 Node* ScheduleBuilder::ProcessOperation(const UnreachableOp& op) {
   Node* node = MakeNode(common.Throw(), {});
+  schedule->AddNode(current_block, MakeNode(common.Unreachable(), {}));
   schedule->AddThrow(current_block, node);
   current_block = nullptr;
   return nullptr;
@@ -1391,17 +1548,225 @@ Node* ScheduleBuilder::ProcessOperation(const LoadRootRegisterOp& op) {
   return AddNode(machine.LoadRootRegister(), {});
 }
 
+Node* ScheduleBuilder::ProcessOperation(const Word32PairBinopOp& op) {
+  using Kind = Word32PairBinopOp::Kind;
+  const Operator* pair_operator = nullptr;
+  switch (op.kind) {
+    case Kind::kAdd:
+      pair_operator = machine.Int32PairAdd();
+      break;
+    case Kind::kSub:
+      pair_operator = machine.Int32PairSub();
+      break;
+    case Kind::kMul:
+      pair_operator = machine.Int32PairMul();
+      break;
+    case Kind::kShiftLeft:
+      pair_operator = machine.Word32PairShl();
+      break;
+    case Kind::kShiftRightArithmetic:
+      pair_operator = machine.Word32PairSar();
+      break;
+    case Kind::kShiftRightLogical:
+      pair_operator = machine.Word32PairShr();
+      break;
+  }
+  return AddNode(pair_operator,
+                 {GetNode(op.left_low()), GetNode(op.left_high()),
+                  GetNode(op.right_low()), GetNode(op.right_high())});
+}
+
+#ifdef V8_ENABLE_WEBASSEMBLY
+Node* ScheduleBuilder::ProcessOperation(const Simd128ConstantOp& op) {
+  return AddNode(machine.S128Const(op.value), {});
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128BinopOp& op) {
+  switch (op.kind) {
+#define HANDLE_KIND(kind)             \
+  case Simd128BinopOp::Kind::k##kind: \
+    return AddNode(machine.kind(), {GetNode(op.left()), GetNode(op.right())});
+    FOREACH_SIMD_128_BINARY_OPCODE(HANDLE_KIND);
+#undef HANDLE_KIND
+  }
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128UnaryOp& op) {
+  switch (op.kind) {
+#define HANDLE_KIND(kind)             \
+  case Simd128UnaryOp::Kind::k##kind: \
+    return AddNode(machine.kind(), {GetNode(op.input())});
+    FOREACH_SIMD_128_UNARY_OPCODE(HANDLE_KIND);
+#undef HANDLE_KIND
+  }
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128ShiftOp& op) {
+  switch (op.kind) {
+#define HANDLE_KIND(kind)             \
+  case Simd128ShiftOp::Kind::k##kind: \
+    return AddNode(machine.kind(), {GetNode(op.input()), GetNode(op.shift())});
+    FOREACH_SIMD_128_SHIFT_OPCODE(HANDLE_KIND);
+#undef HANDLE_KIND
+  }
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128TestOp& op) {
+  switch (op.kind) {
+#define HANDLE_KIND(kind)            \
+  case Simd128TestOp::Kind::k##kind: \
+    return AddNode(machine.kind(), {GetNode(op.input())});
+    FOREACH_SIMD_128_TEST_OPCODE(HANDLE_KIND);
+#undef HANDLE_KIND
+  }
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128SplatOp& op) {
+  switch (op.kind) {
+#define HANDLE_KIND(kind)             \
+  case Simd128SplatOp::Kind::k##kind: \
+    return AddNode(machine.kind##Splat(), {GetNode(op.input())});
+    FOREACH_SIMD_128_SPLAT_OPCODE(HANDLE_KIND);
+#undef HANDLE_KIND
+  }
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128TernaryOp& op) {
+  switch (op.kind) {
+#define HANDLE_KIND(kind)                                                      \
+  case Simd128TernaryOp::Kind::k##kind:                                        \
+    return AddNode(machine.kind(), {GetNode(op.first()), GetNode(op.second()), \
+                                    GetNode(op.third())});
+    FOREACH_SIMD_128_TERNARY_OPCODE(HANDLE_KIND);
+#undef HANDLE_KIND
+  }
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128ExtractLaneOp& op) {
+  const Operator* o = nullptr;
+  switch (op.kind) {
+    case Simd128ExtractLaneOp::Kind::kI8x16S:
+      o = machine.I8x16ExtractLaneS(op.lane);
+      break;
+    case Simd128ExtractLaneOp::Kind::kI8x16U:
+      o = machine.I8x16ExtractLaneU(op.lane);
+      break;
+    case Simd128ExtractLaneOp::Kind::kI16x8S:
+      o = machine.I16x8ExtractLaneS(op.lane);
+      break;
+    case Simd128ExtractLaneOp::Kind::kI16x8U:
+      o = machine.I16x8ExtractLaneU(op.lane);
+      break;
+    case Simd128ExtractLaneOp::Kind::kI32x4:
+      o = machine.I32x4ExtractLane(op.lane);
+      break;
+    case Simd128ExtractLaneOp::Kind::kI64x2:
+      o = machine.I64x2ExtractLane(op.lane);
+      break;
+    case Simd128ExtractLaneOp::Kind::kF32x4:
+      o = machine.F32x4ExtractLane(op.lane);
+      break;
+    case Simd128ExtractLaneOp::Kind::kF64x2:
+      o = machine.F64x2ExtractLane(op.lane);
+      break;
+  }
+
+  return AddNode(o, {GetNode(op.input())});
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128ReplaceLaneOp& op) {
+  const Operator* o = nullptr;
+  switch (op.kind) {
+    case Simd128ReplaceLaneOp::Kind::kI8x16:
+      o = machine.I8x16ReplaceLane(op.lane);
+      break;
+    case Simd128ReplaceLaneOp::Kind::kI16x8:
+      o = machine.I16x8ReplaceLane(op.lane);
+      break;
+    case Simd128ReplaceLaneOp::Kind::kI32x4:
+      o = machine.I32x4ReplaceLane(op.lane);
+      break;
+    case Simd128ReplaceLaneOp::Kind::kI64x2:
+      o = machine.I64x2ReplaceLane(op.lane);
+      break;
+    case Simd128ReplaceLaneOp::Kind::kF32x4:
+      o = machine.F32x4ReplaceLane(op.lane);
+      break;
+    case Simd128ReplaceLaneOp::Kind::kF64x2:
+      o = machine.F64x2ReplaceLane(op.lane);
+      break;
+  }
+
+  return AddNode(o, {GetNode(op.into()), GetNode(op.new_lane())});
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128LaneMemoryOp& op) {
+  DCHECK_EQ(op.offset, 0);
+  MemoryAccessKind access =
+      op.kind.with_trap_handler ? MemoryAccessKind::kProtected
+      : op.kind.maybe_unaligned ? MemoryAccessKind::kUnaligned
+                                : MemoryAccessKind::kNormal;
+
+  MachineType type;
+  switch (op.lane_kind) {
+    case Simd128LaneMemoryOp::LaneKind::k8:
+      type = MachineType::Int8();
+      break;
+    case Simd128LaneMemoryOp::LaneKind::k16:
+      type = MachineType::Int16();
+      break;
+    case Simd128LaneMemoryOp::LaneKind::k32:
+      type = MachineType::Int32();
+      break;
+    case Simd128LaneMemoryOp::LaneKind::k64:
+      type = MachineType::Int64();
+      break;
+  }
+
+  const Operator* o = nullptr;
+  if (op.mode == Simd128LaneMemoryOp::Mode::kLoad) {
+    o = machine.LoadLane(access, type, op.lane);
+  } else {
+    o = machine.StoreLane(access, type.representation(), op.lane);
+  }
+
+  return AddNode(
+      o, {GetNode(op.base()), GetNode(op.index()), GetNode(op.value())});
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128LoadTransformOp& op) {
+  DCHECK_EQ(op.offset, 0);
+  MemoryAccessKind access =
+      op.load_kind.with_trap_handler ? MemoryAccessKind::kProtected
+      : op.load_kind.maybe_unaligned ? MemoryAccessKind::kUnaligned
+                                     : MemoryAccessKind::kNormal;
+  LoadTransformation transformation;
+  switch (op.transform_kind) {
+#define HANDLE_KIND(kind)                                 \
+  case Simd128LoadTransformOp::TransformKind::k##kind:    \
+    transformation = LoadTransformation::kS128Load##kind; \
+    break;
+    FOREACH_SIMD_128_LOAD_TRANSFORM_OPCODE(HANDLE_KIND)
+#undef HANDLE_KIND
+  }
+
+  const Operator* o = machine.LoadTransform(access, transformation);
+
+  return AddNode(o, {GetNode(op.base()), GetNode(op.index())});
+}
+
+Node* ScheduleBuilder::ProcessOperation(const Simd128ShuffleOp& op) {
+  return AddNode(machine.I8x16Shuffle(op.shuffle),
+                 {GetNode(op.left()), GetNode(op.right())});
+}
+
+#endif  // V8_ENABLE_WEBASSEMBLY
+
 }  // namespace
 
-RecreateScheduleResult RecreateSchedule(const Graph& graph,
-                                        JSHeapBroker* broker,
-                                        CallDescriptor* call_descriptor,
-                                        Zone* graph_zone, Zone* phase_zone,
-                                        SourcePositionTable* source_positions,
-                                        NodeOriginTable* origins) {
-  ScheduleBuilder builder{graph,      broker,     call_descriptor,
-                          graph_zone, phase_zone, source_positions,
-                          origins};
+RecreateScheduleResult RecreateSchedule(CallDescriptor* call_descriptor,
+                                        Zone* phase_zone) {
+  ScheduleBuilder builder{call_descriptor, phase_zone};
   return builder.Run();
 }
 
diff --git a/deps/v8/src/compiler/turboshaft/recreate-schedule.h b/deps/v8/src/compiler/turboshaft/recreate-schedule.h
index 43eac5497f2403..045071b29452e1 100644
--- a/deps/v8/src/compiler/turboshaft/recreate-schedule.h
+++ b/deps/v8/src/compiler/turboshaft/recreate-schedule.h
@@ -25,12 +25,8 @@ struct RecreateScheduleResult {
   Schedule* schedule;
 };
 
-RecreateScheduleResult RecreateSchedule(const Graph& graph,
-                                        JSHeapBroker* broker,
-                                        CallDescriptor* call_descriptor,
-                                        Zone* graph_zone, Zone* phase_zone,
-                                        SourcePositionTable* source_positions,
-                                        NodeOriginTable* origins);
+RecreateScheduleResult RecreateSchedule(CallDescriptor* call_descriptor,
+                                        Zone* phase_zone);
 
 }  // namespace v8::internal::compiler::turboshaft
 
diff --git a/deps/v8/src/compiler/turboshaft/reduce-args-helper.h b/deps/v8/src/compiler/turboshaft/reduce-args-helper.h
new file mode 100644
index 00000000000000..a24540ef67e25b
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/reduce-args-helper.h
@@ -0,0 +1,466 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_REDUCE_ARGS_HELPER_H_
+#define V8_COMPILER_TURBOSHAFT_REDUCE_ARGS_HELPER_H_
+
+#include "src/compiler/turboshaft/operations.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+template <class Callback>
+class CallWithReduceArgsHelper {
+ public:
+  explicit CallWithReduceArgsHelper(Callback callback)
+      : callback_(std::move(callback)) {}
+
+  OpIndex operator()(const GotoOp& op) { return callback_(op.destination); }
+
+  OpIndex operator()(const BranchOp& op) {
+    return callback_(op.condition(), op.if_true, op.if_false, op.hint);
+  }
+
+  OpIndex operator()(const SwitchOp& op) {
+    return callback_(op.input(), op.cases, op.default_case, op.default_hint);
+  }
+
+  OpIndex operator()(const PhiOp& op) { return callback_(op.inputs(), op.rep); }
+
+  OpIndex operator()(const PendingLoopPhiOp& op) {
+    return callback_(op.first(), op.rep);
+  }
+
+  OpIndex operator()(const FrameStateOp& op) {
+    return callback_(op.inputs(), op.inlined, op.data);
+  }
+
+  OpIndex operator()(const CallOp& op) {
+    return callback_(op.callee(), op.frame_state(), op.arguments(),
+                     op.descriptor, op.Effects());
+  }
+
+  OpIndex operator()(const CheckExceptionOp& op) {
+    return callback_(op.throwing_operation(), op.didnt_throw_block,
+                     op.catch_block);
+  }
+
+  OpIndex operator()(const CatchBlockBeginOp& op) { return callback_(); }
+
+  OpIndex operator()(const DidntThrowOp& op) {
+    return callback_(op.throwing_operation(), op.has_catch_block,
+                     op.results_rep);
+  }
+
+  OpIndex operator()(const TailCallOp& op) {
+    return callback_(op.callee(), op.arguments(), op.descriptor);
+  }
+
+  OpIndex operator()(const ReturnOp& op) {
+    return callback_(op.pop_count(), op.return_values());
+  }
+
+  OpIndex operator()(const OverflowCheckedBinopOp& op) {
+    return callback_(op.left(), op.right(), op.kind, op.rep);
+  }
+
+  OpIndex operator()(const WordUnaryOp& op) {
+    return callback_(op.input(), op.kind, op.rep);
+  }
+
+  OpIndex operator()(const FloatUnaryOp& op) {
+    return callback_(op.input(), op.kind, op.rep);
+  }
+
+  OpIndex operator()(const ShiftOp& op) {
+    return callback_(op.left(), op.right(), op.kind, op.rep);
+  }
+
+  OpIndex operator()(const EqualOp& op) {
+    return callback_(op.left(), op.right(), op.rep);
+  }
+
+  OpIndex operator()(const ComparisonOp& op) {
+    return callback_(op.left(), op.right(), op.kind, op.rep);
+  }
+
+  OpIndex operator()(const ChangeOp& op) {
+    return callback_(op.input(), op.kind, op.assumption, op.from, op.to);
+  }
+
+  OpIndex operator()(const ChangeOrDeoptOp& op) {
+    return callback_(op.input(), op.frame_state(), op.kind, op.minus_zero_mode,
+                     op.feedback);
+  }
+
+  OpIndex operator()(const TryChangeOp& op) {
+    return callback_(op.input(), op.kind, op.from, op.to);
+  }
+
+  OpIndex operator()(const BitcastWord32PairToFloat64Op& op) {
+    return callback_(op.high_word32(), op.low_word32());
+  }
+
+  OpIndex operator()(const TaggedBitcastOp& op) {
+    return callback_(op.input(), op.from, op.to);
+  }
+
+  OpIndex operator()(const ObjectIsOp& op) {
+    return callback_(op.input(), op.kind, op.input_assumptions);
+  }
+
+  OpIndex operator()(const FloatIsOp& op) {
+    return callback_(op.input(), op.kind, op.input_rep);
+  }
+
+  OpIndex operator()(const ObjectIsNumericValueOp& op) {
+    return callback_(op.input(), op.kind, op.input_rep);
+  }
+
+  OpIndex operator()(const ConvertOp& op) {
+    return callback_(op.input(), op.from, op.to);
+  }
+
+  OpIndex operator()(const ConvertUntaggedToJSPrimitiveOp& op) {
+    return callback_(op.input(), op.kind, op.input_rep, op.input_interpretation,
+                     op.minus_zero_mode);
+  }
+
+  OpIndex operator()(const ConvertUntaggedToJSPrimitiveOrDeoptOp& op) {
+    return callback_(op.input(), op.frame_state(), op.kind, op.input_rep,
+                     op.input_interpretation, op.feedback);
+  }
+
+  OpIndex operator()(const ConvertJSPrimitiveToUntaggedOp& op) {
+    return callback_(op.input(), op.kind, op.input_assumptions);
+  }
+
+  OpIndex operator()(const ConvertJSPrimitiveToUntaggedOrDeoptOp& op) {
+    return callback_(op.input(), op.frame_state(), op.from_kind, op.to_kind,
+                     op.minus_zero_mode, op.feedback);
+  }
+
+  OpIndex operator()(const TruncateJSPrimitiveToUntaggedOp& op) {
+    return callback_(op.input(), op.kind, op.input_assumptions);
+  }
+
+  OpIndex operator()(const TruncateJSPrimitiveToUntaggedOrDeoptOp& op) {
+    return callback_(op.input(), op.frame_state(), op.kind,
+                     op.input_requirement, op.feedback);
+  }
+
+  OpIndex operator()(const ConvertJSPrimitiveToObjectOp& op) {
+    return callback_(op.value(), op.global_proxy(), op.mode);
+  }
+
+  OpIndex operator()(const SelectOp& op) {
+    return callback_(op.cond(), op.vtrue(), op.vfalse(), op.rep, op.hint,
+                     op.implem);
+  }
+
+  OpIndex operator()(const ConstantOp& op) {
+    return callback_(op.kind, op.storage);
+  }
+
+  OpIndex operator()(const LoadOp& op) {
+    return callback_(op.base(), op.index(), op.kind, op.loaded_rep,
+                     op.result_rep, op.offset, op.element_size_log2);
+  }
+
+  OpIndex operator()(const StoreOp& op) {
+    return callback_(op.base(), op.index(), op.value(), op.kind, op.stored_rep,
+                     op.write_barrier, op.offset, op.element_size_log2,
+                     op.maybe_initializing_or_transitioning);
+  }
+
+  OpIndex operator()(const AllocateOp& op) {
+    return callback_(op.size(), op.type);
+  }
+
+  OpIndex operator()(const DecodeExternalPointerOp& op) {
+    return callback_(op.handle(), op.tag);
+  }
+
+  OpIndex operator()(const RetainOp& op) { return callback_(op.retained()); }
+
+  OpIndex operator()(const ParameterOp& op) {
+    return callback_(op.parameter_index, op.rep, op.debug_name);
+  }
+
+  OpIndex operator()(const OsrValueOp& op) { return callback_(op.index); }
+
+  OpIndex operator()(const StackPointerGreaterThanOp& op) {
+    return callback_(op.stack_limit(), op.kind);
+  }
+
+  OpIndex operator()(const StackSlotOp& op) {
+    return callback_(op.size, op.alignment);
+  }
+
+  OpIndex operator()(const FrameConstantOp& op) { return callback_(op.kind); }
+
+  OpIndex operator()(const DeoptimizeOp& op) {
+    return callback_(op.frame_state(), op.parameters);
+  }
+
+  OpIndex operator()(const DeoptimizeIfOp& op) {
+    return callback_(op.condition(), op.frame_state(), op.negated,
+                     op.parameters);
+  }
+
+  OpIndex operator()(const TrapIfOp& op) {
+    return callback_(op.condition(), op.frame_state(), op.negated, op.trap_id);
+  }
+
+  OpIndex operator()(const ProjectionOp& op) {
+    return callback_(op.input(), op.index, op.rep);
+  }
+
+  OpIndex operator()(const WordBinopOp& op) {
+    return callback_(op.left(), op.right(), op.kind, op.rep);
+  }
+
+  OpIndex operator()(const FloatBinopOp& op) {
+    return callback_(op.left(), op.right(), op.kind, op.rep);
+  }
+
+  OpIndex operator()(const UnreachableOp& op) { return callback_(); }
+
+  OpIndex operator()(const StaticAssertOp& op) {
+    return callback_(op.condition(), op.source);
+  }
+
+  OpIndex operator()(const CheckTurboshaftTypeOfOp& op) {
+    return callback_(op.input(), op.rep, op.type, op.successful);
+  }
+
+  OpIndex operator()(const NewConsStringOp& op) {
+    return callback_(op.length(), op.first(), op.second());
+  }
+
+  OpIndex operator()(const NewArrayOp& op) {
+    return callback_(op.length(), op.kind, op.allocation_type);
+  }
+
+  OpIndex operator()(const DoubleArrayMinMaxOp& op) {
+    return callback_(op.array(), op.kind);
+  }
+
+  OpIndex operator()(const LoadFieldByIndexOp& op) {
+    return callback_(op.object(), op.index());
+  }
+
+  OpIndex operator()(const DebugBreakOp& op) { return callback_(); }
+
+  OpIndex operator()(const DebugPrintOp& op) {
+    return callback_(op.input(), op.rep);
+  }
+
+  OpIndex operator()(const BigIntBinopOp& op) {
+    return callback_(op.left(), op.right(), op.frame_state(), op.kind);
+  }
+
+  OpIndex operator()(const BigIntEqualOp& op) {
+    return callback_(op.left(), op.right());
+  }
+
+  OpIndex operator()(const BigIntComparisonOp& op) {
+    return callback_(op.left(), op.right(), op.kind);
+  }
+
+  OpIndex operator()(const BigIntUnaryOp& op) {
+    return callback_(op.input(), op.kind);
+  }
+
+  OpIndex operator()(const LoadRootRegisterOp& op) { return callback_(); }
+
+  OpIndex operator()(const StringAtOp& op) {
+    return callback_(op.string(), op.position(), op.kind);
+  }
+
+#ifdef V8_INTL_SUPPORT
+  OpIndex operator()(const StringToCaseIntlOp& op) {
+    return callback_(op.string(), op.kind);
+  }
+#endif
+
+  OpIndex operator()(const StringLengthOp& op) {
+    return callback_(op.string());
+  }
+
+  OpIndex operator()(const StringIndexOfOp& op) {
+    return callback_(op.string(), op.search(), op.position());
+  }
+
+  OpIndex operator()(const StringFromCodePointAtOp& op) {
+    return callback_(op.string(), op.index());
+  }
+
+  OpIndex operator()(const StringSubstringOp& op) {
+    return callback_(op.string(), op.start(), op.end());
+  }
+
+  OpIndex operator()(const StringConcatOp& op) {
+    return callback_(op.left(), op.right());
+  }
+
+  OpIndex operator()(const StringEqualOp& op) {
+    return callback_(op.left(), op.right());
+  }
+
+  OpIndex operator()(const StringComparisonOp& op) {
+    return callback_(op.left(), op.right(), op.kind);
+  }
+
+  OpIndex operator()(const ArgumentsLengthOp& op) {
+    return callback_(op.kind, op.formal_parameter_count);
+  }
+
+  OpIndex operator()(const NewArgumentsElementsOp& op) {
+    return callback_(op.arguments_count(), op.type, op.formal_parameter_count);
+  }
+
+  OpIndex operator()(const LoadTypedElementOp& op) {
+    return callback_(op.buffer(), op.base(), op.external(), op.index(),
+                     op.array_type);
+  }
+
+  OpIndex operator()(const LoadDataViewElementOp& op) {
+    return callback_(op.object(), op.storage(), op.index(),
+                     op.is_little_endian(), op.element_type);
+  }
+
+  OpIndex operator()(const LoadStackArgumentOp& op) {
+    return callback_(op.base(), op.index());
+  }
+
+  OpIndex operator()(const StoreTypedElementOp& op) {
+    return callback_(op.buffer(), op.base(), op.external(), op.index(),
+                     op.value(), op.array_type);
+  }
+
+  OpIndex operator()(const StoreDataViewElementOp& op) {
+    return callback_(op.object(), op.storage(), op.index(), op.value(),
+                     op.is_little_endian(), op.element_type);
+  }
+
+  OpIndex operator()(const TransitionAndStoreArrayElementOp& op) {
+    return callback_(op.array(), op.index(), op.value(), op.kind, op.fast_map,
+                     op.double_map);
+  }
+
+  OpIndex operator()(const CompareMapsOp& op) {
+    return callback_(op.heap_object(), op.maps);
+  }
+
+  OpIndex operator()(const CheckMapsOp& op) {
+    return callback_(op.heap_object(), op.frame_state(), op.maps, op.flags,
+                     op.feedback);
+  }
+
+  OpIndex operator()(const AssumeMapOp& op) {
+    return callback_(op.heap_object(), op.maps);
+  }
+
+  OpIndex operator()(const CheckedClosureOp& op) {
+    return callback_(op.input(), op.frame_state(), op.feedback_cell);
+  }
+
+  OpIndex operator()(const CheckEqualsInternalizedStringOp& op) {
+    return callback_(op.expected(), op.value(), op.frame_state());
+  }
+
+  OpIndex operator()(const LoadMessageOp& op) { return callback_(op.offset()); }
+
+  OpIndex operator()(const StoreMessageOp& op) {
+    return callback_(op.offset(), op.object());
+  }
+
+  OpIndex operator()(const SameValueOp& op) {
+    return callback_(op.left(), op.right(), op.mode);
+  }
+
+  OpIndex operator()(const Float64SameValueOp& op) {
+    return callback_(op.left(), op.right());
+  }
+
+  OpIndex operator()(const FastApiCallOp& op) {
+    return callback_(op.data_argument(), op.arguments(), op.parameters);
+  }
+
+  OpIndex operator()(const RuntimeAbortOp& op) { return callback_(op.reason); }
+
+  OpIndex operator()(const EnsureWritableFastElementsOp& op) {
+    return callback_(op.object(), op.elements());
+  }
+
+  OpIndex operator()(const MaybeGrowFastElementsOp& op) {
+    return callback_(op.object(), op.elements(), op.index(),
+                     op.elements_length(), op.frame_state(), op.mode,
+                     op.feedback);
+  }
+
+  OpIndex operator()(const TransitionElementsKindOp& op) {
+    return callback_(op.object(), op.transition);
+  }
+
+  OpIndex operator()(const FindOrderedHashEntryOp& op) {
+    return callback_(op.data_structure(), op.key(), op.kind);
+  }
+
+  OpIndex operator()(const Word32PairBinopOp& op) {
+    return callback_(op.left_low(), op.left_high(), op.right_low(),
+                     op.right_high(), op.kind);
+  }
+
+  OpIndex operator()(const TupleOp& tuple) {
+    return callback_(const_cast<TupleOp&>(tuple).inputs());
+  }
+
+#ifdef V8_ENABLE_WEBASSEMBLY
+  OpIndex operator()(const GlobalGetOp& op) {
+    return callback_(op.instance(), op.global);
+  }
+
+  OpIndex operator()(const GlobalSetOp& op) {
+    return callback_(op.instance(), op.value(), op.global);
+  }
+
+  OpIndex operator()(const NullOp& op) { return callback_(op.type); }
+
+  OpIndex operator()(const IsNullOp& op) {
+    return callback_(op.object(), op.type);
+  }
+
+  OpIndex operator()(const AssertNotNullOp& op) {
+    return callback_(op.object(), op.type, op.trap_id);
+  }
+
+  OpIndex operator()(const RttCanonOp& op) {
+    return callback_(op.instance(), op.type_index);
+  }
+
+  OpIndex operator()(const WasmTypeCheckOp& op) {
+    return callback_(op.object(), op.rtt(), op.config);
+  }
+
+  OpIndex operator()(const WasmTypeCastOp& op) {
+    return callback_(op.object(), op.rtt(), op.config);
+  }
+#endif
+
+ private:
+  Callback callback_;
+};
+
+// Construct a callable that takes the Operation as an argument and calls the
+// provided callback with the REDUCE(Op) signature.. This can be used to
+// "unpack" an Operation and pass its values back inta a Reduce function.
+template <class Callback>
+auto CallWithReduceArgs(Callback callback) {
+  return CallWithReduceArgsHelper<Callback>(callback);
+}
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_REDUCE_ARGS_HELPER_H_
diff --git a/deps/v8/src/compiler/turboshaft/representations.cc b/deps/v8/src/compiler/turboshaft/representations.cc
index da29b989517144..d1ee3be369cd0e 100644
--- a/deps/v8/src/compiler/turboshaft/representations.cc
+++ b/deps/v8/src/compiler/turboshaft/representations.cc
@@ -6,20 +6,24 @@
 
 namespace v8::internal::compiler::turboshaft {
 
-std::ostream& operator<<(std::ostream& os, RegisterRepresentation rep) {
+std::ostream& operator<<(std::ostream& os, MaybeRegisterRepresentation rep) {
   switch (rep) {
-    case RegisterRepresentation::Word32():
+    case MaybeRegisterRepresentation::Word32():
       return os << "Word32";
-    case RegisterRepresentation::Word64():
+    case MaybeRegisterRepresentation::Word64():
       return os << "Word64";
-    case RegisterRepresentation::Float32():
+    case MaybeRegisterRepresentation::Float32():
       return os << "Float32";
-    case RegisterRepresentation::Float64():
+    case MaybeRegisterRepresentation::Float64():
       return os << "Float64";
-    case RegisterRepresentation::Tagged():
+    case MaybeRegisterRepresentation::Tagged():
       return os << "Tagged";
-    case RegisterRepresentation::Compressed():
+    case MaybeRegisterRepresentation::Compressed():
       return os << "Compressed";
+    case MaybeRegisterRepresentation::Simd128():
+      return os << "Simd128";
+    case MaybeRegisterRepresentation::None():
+      return os << "None";
   }
 }
 
@@ -51,9 +55,12 @@ std::ostream& operator<<(std::ostream& os, MemoryRepresentation rep) {
       return os << "TaggedPointer";
     case MemoryRepresentation::TaggedSigned():
       return os << "TaggedSigned";
+    case MemoryRepresentation::IndirectPointer():
+      return os << "IndirectPointer";
     case MemoryRepresentation::SandboxedPointer():
       return os << "SandboxedPointer";
+    case MemoryRepresentation::Simd128():
+      return os << "Simd128";
   }
 }
-
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/representations.h b/deps/v8/src/compiler/turboshaft/representations.h
index ce6490aa01788a..bf08a1056d7479 100644
--- a/deps/v8/src/compiler/turboshaft/representations.h
+++ b/deps/v8/src/compiler/turboshaft/representations.h
@@ -17,7 +17,8 @@ namespace v8::internal::compiler::turboshaft {
 class WordRepresentation;
 class FloatRepresentation;
 
-class RegisterRepresentation {
+// Optional register representation.
+class MaybeRegisterRepresentation {
  public:
   enum class Enum : uint8_t {
     kWord32,
@@ -25,43 +26,56 @@ class RegisterRepresentation {
     kFloat32,
     kFloat64,
     kTagged,
-    kCompressed
+    kCompressed,
+    kSimd128,
+    kNone,  // No register representation.
   };
 
-  explicit constexpr RegisterRepresentation(Enum value) : value_(value) {}
-  RegisterRepresentation() : value_(kInvalid) {}
+  explicit constexpr MaybeRegisterRepresentation(Enum value) : value_(value) {}
+  constexpr MaybeRegisterRepresentation() : value_(kInvalid) {}
+
+  constexpr bool is_valid() const { return value_ != kInvalid; }
 
   constexpr Enum value() const {
-    DCHECK_NE(value_, kInvalid);
+    DCHECK(is_valid());
     return value_;
   }
+
   constexpr operator Enum() const { return value(); }
 
-  static constexpr RegisterRepresentation Word32() {
-    return RegisterRepresentation(Enum::kWord32);
+  static constexpr MaybeRegisterRepresentation Word32() {
+    return MaybeRegisterRepresentation(Enum::kWord32);
   }
-  static constexpr RegisterRepresentation Word64() {
-    return RegisterRepresentation(Enum::kWord64);
+
+  static constexpr MaybeRegisterRepresentation Word64() {
+    return MaybeRegisterRepresentation(Enum::kWord64);
   }
-  static constexpr RegisterRepresentation Float32() {
-    return RegisterRepresentation(Enum::kFloat32);
+
+  static constexpr MaybeRegisterRepresentation Float32() {
+    return MaybeRegisterRepresentation(Enum::kFloat32);
   }
-  static constexpr RegisterRepresentation Float64() {
-    return RegisterRepresentation(Enum::kFloat64);
+
+  static constexpr MaybeRegisterRepresentation Float64() {
+    return MaybeRegisterRepresentation(Enum::kFloat64);
   }
-  // A tagged pointer stored in a register, in the case of pointer compression
-  // it is an uncompressed pointer or a Smi.
-  static constexpr RegisterRepresentation Tagged() {
-    return RegisterRepresentation(Enum::kTagged);
+
+  static constexpr MaybeRegisterRepresentation Tagged() {
+    return MaybeRegisterRepresentation(Enum::kTagged);
   }
-  // A compressed tagged pointer stored in a register, the upper 32bit are
-  // unspecified.
-  static constexpr RegisterRepresentation Compressed() {
-    return RegisterRepresentation(Enum::kCompressed);
+
+  static constexpr MaybeRegisterRepresentation Compressed() {
+    return MaybeRegisterRepresentation(Enum::kCompressed);
   }
-  // The equivalent of intptr_t/uintptr_t: An integral type with the same size
-  // as machine pointers.
-  static constexpr RegisterRepresentation PointerSized() {
+
+  static constexpr MaybeRegisterRepresentation Simd128() {
+    return MaybeRegisterRepresentation(Enum::kSimd128);
+  }
+
+  static constexpr MaybeRegisterRepresentation None() {
+    return MaybeRegisterRepresentation(Enum::kNone);
+  }
+
+  static constexpr MaybeRegisterRepresentation PointerSized() {
     if constexpr (kSystemPointerSize == 4) {
       return Word32();
     } else {
@@ -70,7 +84,7 @@ class RegisterRepresentation {
     }
   }
 
-  constexpr bool IsWord() {
+  constexpr bool IsWord() const {
     switch (*this) {
       case Enum::kWord32:
       case Enum::kWord64:
@@ -79,11 +93,13 @@ class RegisterRepresentation {
       case Enum::kFloat64:
       case Enum::kTagged:
       case Enum::kCompressed:
+      case Enum::kSimd128:
+      case Enum::kNone:
         return false;
     }
   }
 
-  constexpr bool IsFloat() {
+  constexpr bool IsFloat() const {
     switch (*this) {
       case Enum::kFloat32:
       case Enum::kFloat64:
@@ -92,6 +108,8 @@ class RegisterRepresentation {
       case Enum::kWord64:
       case Enum::kTagged:
       case Enum::kCompressed:
+      case Enum::kSimd128:
+      case Enum::kNone:
         return false;
     }
   }
@@ -106,12 +124,14 @@ class RegisterRepresentation {
       case Enum::kFloat64:
       case Enum::kTagged:
       case Enum::kCompressed:
+      case Enum::kSimd128:
+      case Enum::kNone:
         UNREACHABLE();
     }
   }
 
   MachineRepresentation machine_representation() const {
-    switch (*this) {
+    switch (this->value()) {
       case Word32():
         return MachineRepresentation::kWord32;
       case Word64():
@@ -124,11 +144,15 @@ class RegisterRepresentation {
         return MachineRepresentation::kTagged;
       case Compressed():
         return MachineRepresentation::kCompressed;
+      case Simd128():
+        return MachineRepresentation::kSimd128;
+      case None():
+        UNREACHABLE();
     }
   }
 
   constexpr uint16_t bit_width() const {
-    switch (*this) {
+    switch (this->value()) {
       case Word32():
         return 32;
       case Word64():
@@ -141,9 +165,77 @@ class RegisterRepresentation {
         return kSystemPointerSize;
       case Compressed():
         return kSystemPointerSize;
+      case Simd128():
+        return 128;
+      case None():
+        UNREACHABLE();
     }
   }
 
+ private:
+  Enum value_;
+
+  static constexpr Enum kInvalid = static_cast<Enum>(-1);
+};
+
+class RegisterRepresentation : public MaybeRegisterRepresentation {
+ public:
+  enum class Enum : uint8_t {
+    kWord32 = static_cast<int>(MaybeRegisterRepresentation::Enum::kWord32),
+    kWord64 = static_cast<int>(MaybeRegisterRepresentation::Enum::kWord64),
+    kFloat32 = static_cast<int>(MaybeRegisterRepresentation::Enum::kFloat32),
+    kFloat64 = static_cast<int>(MaybeRegisterRepresentation::Enum::kFloat64),
+    kTagged = static_cast<int>(MaybeRegisterRepresentation::Enum::kTagged),
+    kCompressed =
+        static_cast<int>(MaybeRegisterRepresentation::Enum::kCompressed),
+    kSimd128 = static_cast<int>(MaybeRegisterRepresentation::Enum::kSimd128),
+  };
+
+  explicit constexpr RegisterRepresentation(Enum value)
+      : MaybeRegisterRepresentation(
+            static_cast<MaybeRegisterRepresentation::Enum>(value)) {}
+  RegisterRepresentation() = default;
+
+  explicit constexpr RegisterRepresentation(MaybeRegisterRepresentation rep)
+      : RegisterRepresentation(static_cast<Enum>(rep.value())) {}
+
+  constexpr operator Enum() const { return value(); }
+
+  constexpr Enum value() const {
+    return static_cast<Enum>(MaybeRegisterRepresentation::value());
+  }
+
+  static constexpr RegisterRepresentation Word32() {
+    return RegisterRepresentation(Enum::kWord32);
+  }
+  static constexpr RegisterRepresentation Word64() {
+    return RegisterRepresentation(Enum::kWord64);
+  }
+  static constexpr RegisterRepresentation Float32() {
+    return RegisterRepresentation(Enum::kFloat32);
+  }
+  static constexpr RegisterRepresentation Float64() {
+    return RegisterRepresentation(Enum::kFloat64);
+  }
+  // A tagged pointer stored in a register, in the case of pointer compression
+  // it is an uncompressed pointer or a Smi.
+  static constexpr RegisterRepresentation Tagged() {
+    return RegisterRepresentation(Enum::kTagged);
+  }
+  // A compressed tagged pointer stored in a register, the upper 32bit are
+  // unspecified.
+  static constexpr RegisterRepresentation Compressed() {
+    return RegisterRepresentation(Enum::kCompressed);
+  }
+  // The equivalent of intptr_t/uintptr_t: An integral type with the same size
+  // as machine pointers.
+  static constexpr RegisterRepresentation PointerSized() {
+    return RegisterRepresentation(MaybeRegisterRepresentation::PointerSized());
+  }
+  static constexpr RegisterRepresentation Simd128() {
+    return RegisterRepresentation(Enum::kSimd128);
+  }
+
   static RegisterRepresentation FromMachineRepresentation(
       MachineRepresentation rep) {
     switch (rep) {
@@ -165,35 +257,95 @@ class RegisterRepresentation {
         return Float32();
       case MachineRepresentation::kFloat64:
         return Float64();
+      case MachineRepresentation::kSimd128:
+        return Simd128();
       case MachineRepresentation::kMapWord:
+      case MachineRepresentation::kIndirectPointer:
       case MachineRepresentation::kSandboxedPointer:
       case MachineRepresentation::kNone:
-      case MachineRepresentation::kSimd128:
       case MachineRepresentation::kSimd256:
         UNREACHABLE();
     }
   }
 
- private:
-  Enum value_;
-
-  static constexpr Enum kInvalid = static_cast<Enum>(-1);
+  constexpr bool AllowImplicitRepresentationChangeTo(
+      RegisterRepresentation dst_rep) const;
 };
 
-V8_INLINE constexpr bool operator==(RegisterRepresentation a,
-                                    RegisterRepresentation b) {
+V8_INLINE constexpr bool operator==(MaybeRegisterRepresentation a,
+                                    MaybeRegisterRepresentation b) {
   return a.value() == b.value();
 }
-V8_INLINE constexpr bool operator!=(RegisterRepresentation a,
-                                    RegisterRepresentation b) {
+V8_INLINE constexpr bool operator!=(MaybeRegisterRepresentation a,
+                                    MaybeRegisterRepresentation b) {
   return a.value() != b.value();
 }
 
-V8_INLINE size_t hash_value(RegisterRepresentation rep) {
+V8_INLINE size_t hash_value(MaybeRegisterRepresentation rep) {
   return static_cast<size_t>(rep.value());
 }
 
-std::ostream& operator<<(std::ostream& os, RegisterRepresentation rep);
+constexpr bool RegisterRepresentation::AllowImplicitRepresentationChangeTo(
+    RegisterRepresentation dst_rep) const {
+  if (*this == dst_rep) {
+    return true;
+  }
+  switch (dst_rep.value()) {
+    case RegisterRepresentation::Word32():
+      // TODO(mliedtke): Remove this once JS graph building and JS reducers
+      // always produce explicit truncations.
+      // We allow implicit 64- to 32-bit truncation.
+      if (*this == RegisterRepresentation::Word64()) {
+        return true;
+      }
+      // We allow implicit tagged -> untagged conversions.
+      // Even without pointer compression, we use `Word32And` for Smi-checks on
+      // tagged values.
+      if (*this == any_of(RegisterRepresentation::Tagged(),
+                          RegisterRepresentation::Compressed())) {
+        return true;
+      }
+      break;
+    case RegisterRepresentation::Word64():
+      // We allow implicit tagged -> untagged conversions.
+      if (kTaggedSize == kInt64Size &&
+          *this == RegisterRepresentation::Tagged()) {
+        return true;
+      }
+      break;
+    case RegisterRepresentation::Tagged():
+      // We allow implicit untagged -> tagged conversions. This is only safe for
+      // Smi values.
+      if (*this == RegisterRepresentation::PointerSized()) {
+        return true;
+      }
+      break;
+    case RegisterRepresentation::Compressed():
+      // Compression is a no-op.
+      if (*this == any_of(RegisterRepresentation::Tagged(),
+                          RegisterRepresentation::PointerSized(),
+                          RegisterRepresentation::Word32())) {
+        return true;
+      }
+      break;
+    default:
+      break;
+  }
+  return false;
+}
+
+std::ostream& operator<<(std::ostream& os, MaybeRegisterRepresentation rep);
+
+template <typename T>
+struct MultiSwitch<
+    T, std::enable_if_t<std::is_base_of_v<MaybeRegisterRepresentation, T>>> {
+  static constexpr uint64_t max_value = 8;
+  static constexpr uint64_t encode(T rep) {
+    const uint64_t value = static_cast<uint64_t>(rep.value());
+    DCHECK_LT(value, max_value);
+    return value;
+  }
+};
 
 class WordRepresentation : public RegisterRepresentation {
  public:
@@ -293,13 +445,18 @@ class MemoryRepresentation {
     kAnyTagged,
     kTaggedPointer,
     kTaggedSigned,
+    kIndirectPointer,
     kSandboxedPointer,
+    kSimd128,
   };
 
   explicit constexpr MemoryRepresentation(Enum value) : value_(value) {}
-  MemoryRepresentation() : value_(kInvalid) {}
+  constexpr MemoryRepresentation() : value_(kInvalid) {}
+
+  constexpr bool is_valid() const { return value_ != kInvalid; }
+
   constexpr Enum value() const {
-    DCHECK_NE(value_, kInvalid);
+    DCHECK(is_valid());
     return value_;
   }
   constexpr operator Enum() const { return value(); }
@@ -343,6 +500,9 @@ class MemoryRepresentation {
   static constexpr MemoryRepresentation TaggedSigned() {
     return MemoryRepresentation(Enum::kTaggedSigned);
   }
+  static constexpr MemoryRepresentation IndirectPointer() {
+    return MemoryRepresentation(Enum::kIndirectPointer);
+  }
   static constexpr MemoryRepresentation SandboxedPointer() {
     return MemoryRepresentation(Enum::kSandboxedPointer);
   }
@@ -354,6 +514,9 @@ class MemoryRepresentation {
       return Uint64();
     }
   }
+  static constexpr MemoryRepresentation Simd128() {
+    return MemoryRepresentation(Enum::kSimd128);
+  }
 
   bool IsWord() const {
     switch (*this) {
@@ -371,7 +534,9 @@ class MemoryRepresentation {
       case AnyTagged():
       case TaggedPointer():
       case TaggedSigned():
+      case IndirectPointer():
       case SandboxedPointer():
+      case Simd128():
         return false;
     }
   }
@@ -393,9 +558,10 @@ class MemoryRepresentation {
       case AnyTagged():
       case TaggedPointer():
       case TaggedSigned():
+      case IndirectPointer():
       case SandboxedPointer():
-        DCHECK(false);
-        return false;
+      case Simd128():
+        UNREACHABLE();
     }
   }
 
@@ -415,7 +581,9 @@ class MemoryRepresentation {
       case Uint64():
       case Float32():
       case Float64():
+      case IndirectPointer():
       case SandboxedPointer():
+      case Simd128():
         return false;
     }
   }
@@ -436,7 +604,9 @@ class MemoryRepresentation {
       case Uint64():
       case Float32():
       case Float64():
+      case IndirectPointer():
       case SandboxedPointer():
+      case Simd128():
         return false;
     }
   }
@@ -461,8 +631,32 @@ class MemoryRepresentation {
       case TaggedPointer():
       case TaggedSigned():
         return RegisterRepresentation::Tagged();
+      case IndirectPointer():
+        return RegisterRepresentation::Tagged();
       case SandboxedPointer():
         return RegisterRepresentation::Word64();
+      case Simd128():
+        return RegisterRepresentation::Simd128();
+    }
+  }
+
+  static MemoryRepresentation FromRegisterRepresentation(
+      RegisterRepresentation repr, bool is_signed) {
+    switch (repr.value()) {
+      case RegisterRepresentation::Word32():
+        return is_signed ? Int32() : Uint32();
+      case RegisterRepresentation::Word64():
+        return is_signed ? Int64() : Uint64();
+      case RegisterRepresentation::Float32():
+        return Float32();
+      case RegisterRepresentation::Float64():
+        return Float64();
+      case RegisterRepresentation::Tagged():
+        return AnyTagged();
+      case RegisterRepresentation::Simd128():
+        return Simd128();
+      case RegisterRepresentation::Compressed():
+        UNREACHABLE();
     }
   }
 
@@ -507,8 +701,12 @@ class MemoryRepresentation {
         return MachineType::TaggedPointer();
       case TaggedSigned():
         return MachineType::TaggedSigned();
+      case IndirectPointer():
+        return MachineType::IndirectPointer();
       case SandboxedPointer():
         return MachineType::SandboxedPointer();
+      case Simd128():
+        return MachineType::Simd128();
     }
   }
 
@@ -530,6 +728,8 @@ class MemoryRepresentation {
         // Turboshaft does not support map packing.
         DCHECK(!V8_MAP_PACKING_BOOL);
         return TaggedPointer();
+      case MachineRepresentation::kIndirectPointer:
+        return IndirectPointer();
       case MachineRepresentation::kTagged:
         return AnyTagged();
       case MachineRepresentation::kFloat32:
@@ -538,9 +738,10 @@ class MemoryRepresentation {
         return Float64();
       case MachineRepresentation::kSandboxedPointer:
         return SandboxedPointer();
+      case MachineRepresentation::kSimd128:
+        return Simd128();
       case MachineRepresentation::kNone:
       case MachineRepresentation::kBit:
-      case MachineRepresentation::kSimd128:
       case MachineRepresentation::kSimd256:
       case MachineRepresentation::kCompressedPointer:
       case MachineRepresentation::kCompressed:
@@ -548,7 +749,7 @@ class MemoryRepresentation {
     }
   }
 
-  static MemoryRepresentation FromMachineRepresentation(
+  static constexpr MemoryRepresentation FromMachineRepresentation(
       MachineRepresentation rep) {
     switch (rep) {
       case MachineRepresentation::kWord8:
@@ -571,13 +772,15 @@ class MemoryRepresentation {
         return Float64();
       case MachineRepresentation::kSandboxedPointer:
         return SandboxedPointer();
+      case MachineRepresentation::kSimd128:
+        return Simd128();
       case MachineRepresentation::kNone:
       case MachineRepresentation::kMapWord:
       case MachineRepresentation::kBit:
-      case MachineRepresentation::kSimd128:
       case MachineRepresentation::kSimd256:
       case MachineRepresentation::kCompressedPointer:
       case MachineRepresentation::kCompressed:
+      case MachineRepresentation::kIndirectPointer:
         UNREACHABLE();
     }
   }
@@ -597,6 +800,7 @@ class MemoryRepresentation {
       case Int32():
       case Uint32():
       case Float32():
+      case IndirectPointer():
         return 2;
       case Int64():
       case Uint64():
@@ -607,6 +811,8 @@ class MemoryRepresentation {
       case TaggedPointer():
       case TaggedSigned():
         return kTaggedSizeLog2;
+      case Simd128():
+        return 4;
     }
   }
 
diff --git a/deps/v8/src/compiler/turboshaft/required-optimization-reducer.h b/deps/v8/src/compiler/turboshaft/required-optimization-reducer.h
new file mode 100644
index 00000000000000..a61dcf7a00fd25
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/required-optimization-reducer.h
@@ -0,0 +1,68 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_REQUIRED_OPTIMIZATION_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_REQUIRED_OPTIMIZATION_REDUCER_H_
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/operations.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+// The RequiredOptimizationReducer performs reductions that might be needed for
+// correctness, because instruction selection or other reducers rely on it. In
+// particular, we have the following dependencies:
+//   - VariableReducer can introduce phi nodes for call target constants, which
+//     have to be reduced in order for instruction selection to detect the call
+//     target. So we have to run RequiredOptimizationReducer at least once after
+//     every occurence of VariableReducer.
+template <class Next>
+class RequiredOptimizationReducer : public Next {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  OpIndex REDUCE(Phi)(base::Vector<const OpIndex> inputs,
+                      RegisterRepresentation rep) {
+    LABEL_BLOCK(no_change) { return Next::ReducePhi(inputs, rep); }
+    if (inputs.size() == 0) goto no_change;
+    OpIndex first = inputs.first();
+    bool same_inputs = true;
+    for (const OpIndex& input : inputs.SubVectorFrom(1)) {
+      if (input != first) {
+        same_inputs = false;
+        break;
+      }
+    }
+    if (same_inputs) {
+      return first;
+    }
+    if (const ConstantOp* first_constant =
+            __ Get(first).template TryCast<ConstantOp>()) {
+      for (const OpIndex& input : inputs.SubVectorFrom(1)) {
+        const ConstantOp* maybe_constant =
+            __ Get(input).template TryCast<ConstantOp>();
+        if (!(maybe_constant && *maybe_constant == *first_constant)) {
+          goto no_change;
+        }
+      }
+      // If all of the predecessors are the same Constant, then we re-emit
+      // this Constant rather than emitting a Phi. This is a good idea in
+      // general, but is in particular needed for Constant that are used as
+      // call target: if they were merged into a Phi, this would result in an
+      // indirect call rather than a direct one, which:
+      //   - is probably slower than a direct call in general
+      //   - is probably not supported for builtins on 32-bit architectures.
+      return __ ReduceConstant(first_constant->kind, first_constant->storage);
+    }
+    goto no_change;
+  }
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_REQUIRED_OPTIMIZATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/runtime-call-descriptors.h b/deps/v8/src/compiler/turboshaft/runtime-call-descriptors.h
index d4c4a25d7b58be..3c901716529026 100644
--- a/deps/v8/src/compiler/turboshaft/runtime-call-descriptors.h
+++ b/deps/v8/src/compiler/turboshaft/runtime-call-descriptors.h
@@ -5,7 +5,9 @@
 #ifndef V8_COMPILER_TURBOSHAFT_RUNTIME_CALL_DESCRIPTORS_H_
 #define V8_COMPILER_TURBOSHAFT_RUNTIME_CALL_DESCRIPTORS_H_
 
+#include "src/compiler/operator.h"
 #include "src/compiler/turboshaft/operations.h"
+#include "src/runtime/runtime.h"
 
 namespace v8::internal::compiler::turboshaft {
 
@@ -22,7 +24,10 @@ struct RuntimeCallDescriptor {
 #ifdef DEBUG
       Derived::Verify(descriptor);
 #endif  // DEBUG
-      return TSCallDescriptor::Create(descriptor, zone);
+      CanThrow can_throw = (Derived::Properties & Operator::kNoThrow)
+                               ? CanThrow::kNo
+                               : CanThrow::kYes;
+      return TSCallDescriptor::Create(descriptor, can_throw, zone);
     }
 
 #ifdef DEBUG
@@ -64,9 +69,27 @@ struct RuntimeCallDescriptor {
 #endif  // DEBUG
   };
 
-  using Boolean = Oddball;
-
  public:
+  struct Abort : public Descriptor<Abort> {
+    static constexpr auto Function = Runtime::kAbort;
+    using arguments_t = std::tuple<V<Smi>>;
+    using result_t = V<Object>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoDeopt | Operator::kNoThrow;
+  };
+
+  struct DateCurrentTime : public Descriptor<DateCurrentTime> {
+    static constexpr auto Function = Runtime::kDateCurrentTime;
+    using arguments_t = std::tuple<>;
+    using result_t = V<Number>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoDeopt | Operator::kNoThrow;
+  };
+
   struct StringCharCodeAt : public Descriptor<StringCharCodeAt> {
     static constexpr auto Function = Runtime::kStringCharCodeAt;
     using arguments_t = std::tuple<V<String>, V<Number>>;
@@ -97,6 +120,26 @@ struct RuntimeCallDescriptor {
     static constexpr bool NeedsFrameState = true;
     static constexpr Operator::Properties Properties = Operator::kNoDeopt;
   };
+
+  struct TransitionElementsKind : public Descriptor<TransitionElementsKind> {
+    static constexpr auto Function = Runtime::kTransitionElementsKind;
+    using arguments_t = std::tuple<V<HeapObject>, V<Map>>;
+    using result_t = V<Object>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoDeopt | Operator::kNoThrow;
+  };
+
+  struct TryMigrateInstance : public Descriptor<TryMigrateInstance> {
+    static constexpr auto Function = Runtime::kTryMigrateInstance;
+    using arguments_t = std::tuple<V<HeapObject>>;
+    using result_t = V<Object>;
+
+    static constexpr bool NeedsFrameState = false;
+    static constexpr Operator::Properties Properties =
+        Operator::kNoDeopt | Operator::kNoThrow;
+  };
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/select-lowering-reducer.h b/deps/v8/src/compiler/turboshaft/select-lowering-reducer.h
index 71eb822b7381d0..6afb796675ef86 100644
--- a/deps/v8/src/compiler/turboshaft/select-lowering-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/select-lowering-reducer.h
@@ -12,6 +12,8 @@
 
 namespace v8::internal::compiler::turboshaft {
 
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
 // Lowers Select operations to diamonds.
 //
 // A Select is conceptually somewhat similar to a ternary if:
@@ -35,58 +37,30 @@ class SelectLoweringReducer : public Next {
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
-  template <class... Args>
-  explicit SelectLoweringReducer(const std::tuple<Args...>& args)
-      : Next(args) {}
-
-  OpIndex ReduceSelect(OpIndex cond, OpIndex vtrue, OpIndex vfalse,
-                       RegisterRepresentation rep, BranchHint hint,
-                       SelectOp::Implementation implem) {
+  OpIndex REDUCE(Select)(OpIndex cond, OpIndex vtrue, OpIndex vfalse,
+                         RegisterRepresentation rep, BranchHint hint,
+                         SelectOp::Implementation implem) {
     if (implem == SelectOp::Implementation::kCMove) {
       // We do not lower Select operations that should be implemented with
       // CMove.
       return Next::ReduceSelect(cond, vtrue, vfalse, rep, hint, implem);
     }
 
-    Block* true_block = Asm().NewBlock();
-    Block* false_block = Asm().NewBlock();
-    Block* merge_block = Asm().NewBlock();
-
-    Asm().Branch(cond, true_block, false_block, hint);
-
-    // Note that it's possible that other reducers of the stack optimizes the
-    // Branch that we just introduced into a Goto (if its condition is already
-    // known). Thus, we check the return values of Bind, and only insert the
-    // Gotos if Bind was successful: if not, then it means that the block
-    // ({true_block} or {false_block}) isn't reachable because the Branch was
-    // optimized to a Goto.
-
-    bool has_true_block = false;
-    bool has_false_block = false;
-
-    if (Asm().Bind(true_block)) {
-      has_true_block = true;
-      Asm().Goto(merge_block);
+    Variable result = Asm().NewLoopInvariantVariable(rep);
+    IF (cond) {
+      Asm().SetVariable(result, vtrue);
     }
-
-    if (Asm().Bind(false_block)) {
-      has_false_block = true;
-      Asm().Goto(merge_block);
+    ELSE {
+      Asm().SetVariable(result, vfalse);
     }
+    END_IF
 
-    Asm().BindReachable(merge_block);
-
-    if (has_true_block && has_false_block) {
-      return Asm().Phi(base::VectorOf({vtrue, vfalse}), rep);
-    } else if (has_true_block) {
-      return vtrue;
-    } else {
-      DCHECK(has_false_block);
-      return vfalse;
-    }
+    return Asm().GetVariable(result);
   }
 };
 
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_SELECT_LOWERING_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/sidetable.h b/deps/v8/src/compiler/turboshaft/sidetable.h
index 84b812f85e65ab..87fceecba8c7f2 100644
--- a/deps/v8/src/compiler/turboshaft/sidetable.h
+++ b/deps/v8/src/compiler/turboshaft/sidetable.h
@@ -33,6 +33,7 @@ class GrowingSidetable {
       : table_(size, initial_value, zone) {}
 
   T& operator[](Key index) {
+    DCHECK(index.valid());
     size_t i = index.id();
     if (V8_UNLIKELY(i >= table_.size())) {
       table_.resize(NextSize(i));
@@ -44,6 +45,7 @@ class GrowingSidetable {
   }
 
   const T& operator[](Key index) const {
+    DCHECK(index.valid());
     size_t i = index.id();
     if (V8_UNLIKELY(i >= table_.size())) {
       table_.resize(NextSize(i));
diff --git a/deps/v8/src/compiler/turboshaft/snapshot-table.h b/deps/v8/src/compiler/turboshaft/snapshot-table.h
index 8a8447c07ec75c..dc577c425d30e1 100644
--- a/deps/v8/src/compiler/turboshaft/snapshot-table.h
+++ b/deps/v8/src/compiler/turboshaft/snapshot-table.h
@@ -10,6 +10,7 @@
 
 #include "src/base/iterator.h"
 #include "src/base/small-vector.h"
+#include "src/compiler/turboshaft/fast-hash.h"
 #include "src/zone/zone-containers.h"
 
 // A `SnapshotTable` stores a mapping from keys to values and creates snapshots,
@@ -32,42 +33,97 @@ namespace v8::internal::compiler::turboshaft {
 
 struct NoKeyData {};
 
+struct NoChangeCallback {
+  template <class Key, class Value>
+  void operator()(Key key, const Value& old_value,
+                  const Value& new_value) const {}
+};
+
+template <class Value, class KeyData>
+class SnapshotTable;
+
+// Place `KeyData` in a superclass to benefit from empty-base optimization.
+template <class Value, class KeyData>
+struct SnapshotTableEntry : KeyData {
+  Value value;
+  // `merge_offset` is the offset in `merge_values_` where we store the
+  // merged values. It is used during merging (to know what to merge) and when
+  // calling GetPredecessorValue.
+  uint32_t merge_offset = kNoMergeOffset;
+  // Used during merging: the index of the predecessor for which we last
+  // recorded a value. This allows us to only use the last value for a given
+  // predecessor and skip over all earlier ones.
+  uint32_t last_merged_predecessor = kNoMergedPredecessor;
+
+  explicit SnapshotTableEntry(Value value, KeyData data)
+      : KeyData(std::move(data)), value(std::move(value)) {}
+
+  static constexpr uint32_t kNoMergeOffset =
+      std::numeric_limits<uint32_t>::max();
+  static constexpr uint32_t kNoMergedPredecessor =
+      std::numeric_limits<uint32_t>::max();
+};
+
+// A `SnapshotTableKey` identifies an entry in the `SnapshotTable`. For better
+// performance, keys always have identity. The template parameter `KeyData` can
+// be used to embed additional data in the keys. A Key is implemented as a
+// pointer into the table, which also contains the `KeyData`. Therefore, keys
+// have pointer-size and are cheap to copy.
+template <class Value, class KeyData>
+class SnapshotTableKey {
+ public:
+  bool operator==(SnapshotTableKey other) const {
+    return entry_ == other.entry_;
+  }
+  const KeyData& data() const { return *entry_; }
+  KeyData& data() { return *entry_; }
+  SnapshotTableKey() : entry_(nullptr) {}
+
+  bool valid() const { return entry_ != nullptr; }
+
+ private:
+  friend class SnapshotTable<Value, KeyData>;
+  SnapshotTableEntry<Value, KeyData>* entry_;
+  explicit SnapshotTableKey(SnapshotTableEntry<Value, KeyData>& entry)
+      : entry_(&entry) {}
+};
+
 template <class Value, class KeyData = NoKeyData>
 class SnapshotTable {
  private:
-  struct TableEntry;
   struct LogEntry;
   struct SnapshotData;
 
  public:
-  // A `Key` identifies an entry in the `SnapshotTable`. For better performance,
-  // keys always have identity. The template parameter `KeyData` can be used to
-  // embed additional data in the keys.
-  // A Key is implemented as a pointer into the table, which also contains the
-  // `KeyData`. Therefore, keys have pointer-size and are cheap to copy.
-  class Key {
-   public:
-    bool operator==(Key other) const { return entry_ == other.entry_; }
-    const KeyData& data() const { return *entry_; }
-    KeyData& data() { return *entry_; }
-
-   private:
-    friend SnapshotTable;
-    TableEntry* entry_;
-    explicit Key(TableEntry& entry) : entry_(&entry) {}
-  };
+  using TableEntry = SnapshotTableEntry<Value, KeyData>;
+  using Key = SnapshotTableKey<Value, KeyData>;
 
   // A `Snapshot` captures the state of the `SnapshotTable`.
   // A `Snapshot` is implemented as a pointer to internal data and is therefore
   // cheap to copy.
+  class MaybeSnapshot;
   class Snapshot {
    public:
     bool operator==(Snapshot other) const { return data_ == other.data_; }
 
    private:
     friend SnapshotTable;
+    friend MaybeSnapshot;
+
     SnapshotData* data_;
     explicit Snapshot(SnapshotData& data) : data_(&data) {}
+    explicit Snapshot(SnapshotData* data) : data_(data) {}
+  };
+
+  class MaybeSnapshot {
+   public:
+    bool has_value() const { return data_ != nullptr; }
+    Snapshot value() const { return Snapshot{data_}; }
+
+    void Set(Snapshot snapshot) { data_ = snapshot.data_; }
+
+   private:
+    SnapshotData* data_ = nullptr;
   };
 
   // A new Snapshot is based on a list of predecessor Snapshots. If no
@@ -77,30 +133,63 @@ class SnapshotTable {
   // unify values that were set since the last common ancestor snapshot.
   // The previous Snapshot needs to be closed using Seal() before another one
   // can be created.
-  void StartNewSnapshot(base::Vector<const Snapshot> predecessors) {
+  // The function `change_callback` is invoked for every atomic update to a
+  // table entry as part of switching to the new snapshot and merging.
+  // Note that the callback might be invoked multiple times for the same key,
+  // because we first roll-back changes to the common ancestor and then apply
+  // the merge function. The second update will have the new value of the first
+  // update as old value. We should not rely on the exact sequence of updates,
+  // only on the fact that the updates collectively transform the table into the
+  // new state. The motivation for this feature are secondary indices that need
+  // to be kept in sync with the main table.
+  template <class ChangeCallback = NoChangeCallback,
+            std::enable_if_t<std::is_invocable_v<ChangeCallback, Key, Value,
+                                                 Value>>* = nullptr>
+  void StartNewSnapshot(base::Vector<const Snapshot> predecessors,
+                        const ChangeCallback& change_callback = {}) {
     DCHECK(current_snapshot_->IsSealed());
-    MoveToNewSnapshot(predecessors);
+    MoveToNewSnapshot(predecessors, change_callback);
 #ifdef DEBUG
     snapshot_was_created_with_merge = false;
 #endif
   }
-  void StartNewSnapshot(std::initializer_list<Snapshot> predecessors = {}) {
-    StartNewSnapshot(base::VectorOf(predecessors));
+  template <class ChangeCallback = NoChangeCallback,
+            std::enable_if_t<std::is_invocable_v<ChangeCallback, Key, Value,
+                                                 Value>>* = nullptr>
+  void StartNewSnapshot(std::initializer_list<Snapshot> predecessors = {},
+                        const ChangeCallback& change_callback = {}) {
+    StartNewSnapshot(base::VectorOf(predecessors), change_callback);
   }
-  void StartNewSnapshot(Snapshot parent) { StartNewSnapshot({parent}); }
-  template <class F>
+  template <class ChangeCallback = NoChangeCallback,
+            std::enable_if_t<std::is_invocable_v<ChangeCallback, Key, Value,
+                                                 Value>>* = nullptr>
+  void StartNewSnapshot(Snapshot parent,
+                        const ChangeCallback& change_callback = {}) {
+    StartNewSnapshot({parent}, change_callback);
+  }
+  template <
+      class MergeFun, class ChangeCallback = NoChangeCallback,
+      std::enable_if_t<
+          std::is_invocable_v<MergeFun, Key, base::Vector<const Value>> &&
+          std::is_invocable_v<ChangeCallback, Key, Value, Value>>* = nullptr>
   void StartNewSnapshot(base::Vector<const Snapshot> predecessors,
-                        F merge_fun) {
-    StartNewSnapshot(predecessors);
-    MergePredecessors(predecessors, merge_fun);
+                        const MergeFun& merge_fun,
+                        const ChangeCallback& change_callback = {}) {
+    StartNewSnapshot(predecessors, change_callback);
+    MergePredecessors(predecessors, merge_fun, change_callback);
 #ifdef DEBUG
     snapshot_was_created_with_merge = true;
 #endif
   }
-  template <class F>
+  template <
+      class MergeFun, class ChangeCallback = NoChangeCallback,
+      std::enable_if_t<
+          std::is_invocable_v<MergeFun, Key, base::Vector<const Value>> &&
+          std::is_invocable_v<ChangeCallback, Key, Value, Value>>* = nullptr>
   void StartNewSnapshot(std::initializer_list<Snapshot> predecessors,
-                        F merge_fun) {
-    StartNewSnapshot(base::VectorOf(predecessors), merge_fun);
+                        const MergeFun& merge_fun,
+                        const ChangeCallback& change_callback = {}) {
+    StartNewSnapshot(base::VectorOf(predecessors), merge_fun, change_callback);
   }
 
   Snapshot Seal() {
@@ -126,7 +215,7 @@ class SnapshotTable {
     return Snapshot{*current_snapshot_};
   }
 
-  const Value& Get(Key key) { return key.entry_->value; }
+  const Value& Get(Key key) const { return key.entry_->value; }
 
   // Returns the value associated to {key} in its {predecessor_index}th
   // predecessor (where "predecessor" refers to the predecessors that were
@@ -142,11 +231,13 @@ class SnapshotTable {
     return merge_values_[key.entry_->merge_offset + predecessor_index];
   }
 
-  void Set(Key key, Value new_value) {
+  // {Set} returns whether the {new_value} is different from the previous value.
+  bool Set(Key key, Value new_value) {
     DCHECK(!current_snapshot_->IsSealed());
-    if (key.entry_->value == new_value) return;
+    if (key.entry_->value == new_value) return false;
     log_.push_back(LogEntry{*key.entry_, key.entry_->value, new_value});
     key.entry_->value = new_value;
+    return true;
   }
 
   explicit SnapshotTable(Zone* zone) : zone_(zone) {
@@ -198,21 +289,27 @@ class SnapshotTable {
     return base::VectorOf(&log_[s->log_begin], s->log_end - s->log_begin);
   }
 
-  void RevertCurrentSnapshot() {
+  template <class ChangeCallback = NoChangeCallback>
+  void RevertCurrentSnapshot(ChangeCallback& change_callback) {
     DCHECK(current_snapshot_->IsSealed());
     base::Vector<LogEntry> log_entries = LogEntries(current_snapshot_);
     for (const LogEntry& entry : base::Reversed(log_entries)) {
       DCHECK_EQ(entry.table_entry.value, entry.new_value);
+      DCHECK_NE(entry.new_value, entry.old_value);
+      change_callback(Key{entry.table_entry}, entry.new_value, entry.old_value);
       entry.table_entry.value = entry.old_value;
     }
     current_snapshot_ = current_snapshot_->parent;
     DCHECK_NOT_NULL(current_snapshot_);
   }
 
-  void ReplaySnapshot(SnapshotData* snapshot) {
+  template <class ChangeCallback = NoChangeCallback>
+  void ReplaySnapshot(SnapshotData* snapshot, ChangeCallback& change_callback) {
     DCHECK_EQ(snapshot->parent, current_snapshot_);
     for (const LogEntry& entry : LogEntries(snapshot)) {
       DCHECK_EQ(entry.table_entry.value, entry.old_value);
+      DCHECK_NE(entry.new_value, entry.old_value);
+      change_callback(Key{entry.table_entry}, entry.old_value, entry.new_value);
       entry.table_entry.value = entry.new_value;
     }
     current_snapshot_ = snapshot;
@@ -220,10 +317,13 @@ class SnapshotTable {
 
   void RecordMergeValue(TableEntry& entry, const Value& value,
                         uint32_t predecessor_index, uint32_t predecessor_count);
-  SnapshotData& MoveToNewSnapshot(base::Vector<const Snapshot> predecessors);
-  template <class F>
+  template <class ChangeCallback>
+  SnapshotData& MoveToNewSnapshot(base::Vector<const Snapshot> predecessors,
+                                  const ChangeCallback& change_callback);
+  template <class MergeFun, class ChangeCallback>
   void MergePredecessors(base::Vector<const Snapshot> predecessors,
-                         F merge_fun);
+                         const MergeFun& merge_fun,
+                         const ChangeCallback& change_callback);
 
   static constexpr uint32_t kNoMergeOffset =
       std::numeric_limits<uint32_t>::max();
@@ -231,23 +331,6 @@ class SnapshotTable {
       std::numeric_limits<uint32_t>::max();
 };
 
-// Place `KeyData` in a superclass to benefit from empty-base optimization.
-template <class Value, class KeyData>
-struct SnapshotTable<Value, KeyData>::TableEntry : KeyData {
-  Value value;
-  // `merge_offset` is the offset in `merge_values_` where we store the
-  // merged values. It is used during merging (to know what to merge) and when
-  // calling GetPredecessorValue.
-  uint32_t merge_offset = kNoMergeOffset;
-  // Used during merging: the index of the predecessor for which we last
-  // recorded a value. This allows us to only use the last value for a given
-  // predecessor and skip over all earlier ones.
-  uint32_t last_merged_predecessor = kNoMergedPredecessor;
-
-  explicit TableEntry(Value value, KeyData data)
-      : KeyData(std::move(data)), value(std::move(value)) {}
-};
-
 template <class Value, class KeyData>
 struct SnapshotTable<Value, KeyData>::LogEntry {
   TableEntry& table_entry;
@@ -335,9 +418,11 @@ void SnapshotTable<Value, KeyData>::RecordMergeValue(
 //   `predecessors`).
 // - Start creating a new snapshot with parent S4.
 template <class Value, class KeyData>
+template <class ChangeCallback>
 typename SnapshotTable<Value, KeyData>::SnapshotData&
 SnapshotTable<Value, KeyData>::MoveToNewSnapshot(
-    base::Vector<const Snapshot> predecessors) {
+    base::Vector<const Snapshot> predecessors,
+    const ChangeCallback& change_callback) {
   DCHECK_WITH_MSG(
       current_snapshot_->IsSealed(),
       "A new Snapshot was opened before the previous Snapshot was sealed.");
@@ -353,7 +438,7 @@ SnapshotTable<Value, KeyData>::MoveToNewSnapshot(
   }
   SnapshotData* go_back_to = common_ancestor->CommonAncestor(current_snapshot_);
   while (current_snapshot_ != go_back_to) {
-    RevertCurrentSnapshot();
+    RevertCurrentSnapshot(change_callback);
   }
   {
     // Replay to common_ancestor.
@@ -362,7 +447,7 @@ SnapshotTable<Value, KeyData>::MoveToNewSnapshot(
       path.push_back(s);
     }
     for (SnapshotData* s : base::Reversed(path)) {
-      ReplaySnapshot(s);
+      ReplaySnapshot(s, change_callback);
     }
   }
 
@@ -375,9 +460,10 @@ SnapshotTable<Value, KeyData>::MoveToNewSnapshot(
 // Merges all entries modified in `predecessors` since the last common ancestor
 // by adding them to the current snapshot.
 template <class Value, class KeyData>
-template <class F>
+template <class MergeFun, class ChangeCallback>
 void SnapshotTable<Value, KeyData>::MergePredecessors(
-    base::Vector<const Snapshot> predecessors, F merge_fun) {
+    base::Vector<const Snapshot> predecessors, const MergeFun& merge_fun,
+    const ChangeCallback& change_callback) {
   CHECK_LE(predecessors.size(), std::numeric_limits<uint32_t>::max());
   uint32_t predecessor_count = static_cast<uint32_t>(predecessors.size());
   if (predecessor_count < 1) return;
@@ -407,11 +493,83 @@ void SnapshotTable<Value, KeyData>::MergePredecessors(
   // the table.
   for (TableEntry* entry : merging_entries_) {
     Key key{*entry};
-    Set(key, merge_fun(key, base::VectorOf(&merge_values_[entry->merge_offset],
-                                           predecessor_count)));
+    Value value = merge_fun(
+        key, base::VectorOf<const Value>(&merge_values_[entry->merge_offset],
+                                         predecessor_count));
+    Value old_value = entry->value;
+    if (Set(key, std::move(value))) {
+      change_callback(key, old_value, entry->value);
+    }
   }
 }
 
+// ChangeTrackingSnapshotTable extends SnapshotTable by automatically invoking
+// OnNewKey and OnValueChange on the subclass whenever the table state changes.
+// This makes it easy to maintain consistent additional tables for faster lookup
+// of the state of the snapshot table, similar to how secondary indices can
+// speed-up lookups in database tables.
+// For example usage, see TEST_F(SnapshotTableTest, ChangeTrackingSnapshotTable)
+// in test/unittests/compiler/turboshaft/snapshot-table-unittest.cc.
+template <class Derived, class Value, class KeyData = NoKeyData>
+class ChangeTrackingSnapshotTable : public SnapshotTable<Value, KeyData> {
+ public:
+  using Super = SnapshotTable<Value, KeyData>;
+  using Super::Super;
+  using typename Super::Key;
+  using typename Super::Snapshot;
+
+  void StartNewSnapshot(base::Vector<const Snapshot> predecessors) {
+    Super::StartNewSnapshot(
+        predecessors,
+        [this](Key key, const Value& old_value, const Value& new_value) {
+          static_cast<Derived*>(this)->OnValueChange(key, old_value, new_value);
+        });
+  }
+  void StartNewSnapshot(std::initializer_list<Snapshot> predecessors = {}) {
+    StartNewSnapshot(base::VectorOf(predecessors));
+  }
+  void StartNewSnapshot(Snapshot parent) { StartNewSnapshot({parent}); }
+  template <class MergeFun,
+            std::enable_if_t<std::is_invocable_v<
+                MergeFun, Key, base::Vector<const Value>>>* = nullptr>
+  void StartNewSnapshot(base::Vector<const Snapshot> predecessors,
+                        const MergeFun& merge_fun) {
+    Super::StartNewSnapshot(
+        predecessors, merge_fun,
+        [this](Key key, const Value& old_value, const Value& new_value) {
+          static_cast<Derived*>(this)->OnValueChange(key, old_value, new_value);
+        });
+  }
+  template <class MergeFun,
+            std::enable_if_t<std::is_invocable_v<
+                MergeFun, Key, base::Vector<const Value>>>* = nullptr>
+  void StartNewSnapshot(std::initializer_list<Snapshot> predecessors,
+                        const MergeFun& merge_fun) {
+    StartNewSnapshot(base::VectorOf(predecessors), merge_fun);
+  }
+
+  void Set(Key key, Value new_value) {
+    Value old_value = Super::Get(key);
+    if (Super::Set(key, std::move(new_value))) {
+      static_cast<Derived*>(this)->OnValueChange(key, old_value,
+                                                 Super::Get(key));
+    }
+  }
+
+  void SetNoNotify(Key key, Value new_value) {
+    Super::Set(key, std::move(new_value));
+  }
+
+  Key NewKey(KeyData data, Value initial_value = Value{}) {
+    Key key = Super::NewKey(std::move(data), std::move(initial_value));
+    static_cast<Derived*>(this)->OnNewKey(key, Super::Get(key));
+    return key;
+  }
+  Key NewKey(Value initial_value = Value{}) {
+    return NewKey(KeyData{}, initial_value);
+  }
+};
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_SNAPSHOT_TABLE_H_
diff --git a/deps/v8/src/compiler/turboshaft/late-optimization-phase.cc b/deps/v8/src/compiler/turboshaft/store-store-elimination-phase.cc
similarity index 52%
rename from deps/v8/src/compiler/turboshaft/late-optimization-phase.cc
rename to deps/v8/src/compiler/turboshaft/store-store-elimination-phase.cc
index c915d043729eb8..459c65a1498c13 100644
--- a/deps/v8/src/compiler/turboshaft/late-optimization-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/store-store-elimination-phase.cc
@@ -2,25 +2,27 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include "src/compiler/turboshaft/late-optimization-phase.h"
+#include "src/compiler/turboshaft/store-store-elimination-phase.h"
 
 #include "src/compiler/turboshaft/branch-elimination-reducer.h"
+#include "src/compiler/turboshaft/late-load-elimination-reducer.h"
 #include "src/compiler/turboshaft/machine-optimization-reducer.h"
-#include "src/compiler/turboshaft/select-lowering-reducer.h"
+#include "src/compiler/turboshaft/required-optimization-reducer.h"
+#include "src/compiler/turboshaft/store-store-elimination-reducer.h"
 #include "src/compiler/turboshaft/value-numbering-reducer.h"
 #include "src/compiler/turboshaft/variable-reducer.h"
 #include "src/numbers/conversions-inl.h"
 
 namespace v8::internal::compiler::turboshaft {
 
-void LateOptimizationPhase::Run(PipelineData* data, Zone* temp_zone) {
-  // TODO(dmercadier,tebbi): add missing CommonOperatorReducer.
+void StoreStoreEliminationPhase::Run(Zone* temp_zone) {
   turboshaft::OptimizationPhase<
-      turboshaft::VariableReducer, turboshaft::BranchEliminationReducer,
-      turboshaft::SelectLoweringReducer,
+      turboshaft::StoreStoreEliminationReducer,
+      turboshaft::LateLoadEliminationReducer, turboshaft::VariableReducer,
       turboshaft::MachineOptimizationReducerSignallingNanImpossible,
-      turboshaft::ValueNumberingReducer>::Run(data->isolate(), &data->graph(),
-                                              temp_zone, data->node_origins());
+      turboshaft::RequiredOptimizationReducer,
+      turboshaft::BranchEliminationReducer,
+      turboshaft::ValueNumberingReducer>::Run(temp_zone);
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/store-store-elimination-phase.h b/deps/v8/src/compiler/turboshaft/store-store-elimination-phase.h
new file mode 100644
index 00000000000000..4f79191d2130f6
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/store-store-elimination-phase.h
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_STORE_STORE_ELIMINATION_PHASE_H_
+#define V8_COMPILER_TURBOSHAFT_STORE_STORE_ELIMINATION_PHASE_H_
+
+#include "src/compiler/turboshaft/phase.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+struct StoreStoreEliminationPhase {
+  DECL_TURBOSHAFT_PHASE_CONSTANTS(StoreStoreElim)
+
+  void Run(Zone* temp_zone);
+};
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_STORE_STORE_ELIMINATION_PHASE_H_
diff --git a/deps/v8/src/compiler/turboshaft/store-store-elimination-reducer.h b/deps/v8/src/compiler/turboshaft/store-store-elimination-reducer.h
new file mode 100644
index 00000000000000..891dbc963e14ad
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/store-store-elimination-reducer.h
@@ -0,0 +1,397 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_STORE_STORE_ELIMINATION_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_STORE_STORE_ELIMINATION_REDUCER_H_
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/graph.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/sidetable.h"
+#include "src/compiler/turboshaft/snapshot-table.h"
+#include "src/compiler/turboshaft/uniform-reducer-adapter.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+// StoreStoreEliminationReducer tries to identify and remove redundant stores.
+// E.g. for an input like
+//
+//   let o = {};
+//   o.x = 2;
+//   o.y = 3;
+//   o.x = 4;
+//   use(o.x);
+//
+// we don't need the first store to `o.x` because the value is overwritten
+// before it can be observed.
+//
+// The analysis considers loads and stores as corresponding pairs of `base` (the
+// OpIndex that defines `o` in the above example) and `offset` (that is the
+// static offset at which the field is stored inside the object). We run the
+// analysis backwards and track potentially redundant stores in a
+// `MaybeRedundantStoresTable` roughly as follows:
+//
+//   1. When we see a `base`+`offset` store and
+//     a. `base`+`offset` is observable in the table, we keep the store, but
+//        track following `base`+`offset` stores as unobservable in the table.
+//     b. `base`+`offset` is unobservable in the table, we can eliminate the
+//        store and keep the table unchanged.
+//     c. `base`+`offset` is gc-observable in the table, we eliminate it only
+//        if it is not an initializing store, otherwise, we keep it and update
+//        the table accordingly.
+//   2. When we see a `base`+`offset` load, we mark all stores to this `offset`
+//      as observable in the table. Notice that we do this regardless of the
+//      `base`, because they might alias potentially.
+//   3. When we see an allocation, we mark all stores that are currently
+//      unobservable, as gc-observable. The idea behind gc-observability is
+//      that we do not observe the actual value stored, but we need to make
+//      sure that the fields are written at least once, so that the GC does not
+//      see uninitialized fields.
+//   4. When we see another operation that can observe memory, we mark all
+//      stores as observable.
+//
+// Notice that the table also tracks the `size` of the store, such that if
+// fields are partially written, we don't incorrectly treat them as redundant to
+// the full store (this can happen in strings for example).
+//
+// When the analysis reaches a branch, we combine values using traditional least
+// upper bound operation on the `StoreObservability` lattice. After processing a
+// loop header, we revisit the loop if the resulting state has changed until we
+// reach a fixpoint.
+//
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+enum class StoreObservability {
+  kUnobservable = 0,
+  kGCObservable = 1,
+  kObservable = 2,
+};
+
+inline std::ostream& operator<<(std::ostream& os,
+                                StoreObservability observability) {
+  switch (observability) {
+    case StoreObservability::kUnobservable:
+      return os << "Unobservable";
+    case StoreObservability::kGCObservable:
+      return os << "GCObservable";
+    case StoreObservability::kObservable:
+      return os << "Observable";
+  }
+}
+
+struct MaybeRedundantStoresKeyData {
+  OpIndex base;
+  int32_t offset;
+  uint8_t size;
+  IntrusiveSetIndex active_keys_index = {};
+};
+
+class MaybeRedundantStoresTable
+    : public ChangeTrackingSnapshotTable<MaybeRedundantStoresTable,
+                                         StoreObservability,
+                                         MaybeRedundantStoresKeyData> {
+  using super =
+      ChangeTrackingSnapshotTable<MaybeRedundantStoresTable, StoreObservability,
+                                  MaybeRedundantStoresKeyData>;
+
+ public:
+  explicit MaybeRedundantStoresTable(const Graph& graph, Zone* zone)
+      : ChangeTrackingSnapshotTable(zone),
+        graph_(graph),
+        block_to_snapshot_mapping_(zone),
+        key_mapping_(zone),
+        active_keys_(zone),
+        successor_snapshots_(zone) {}
+
+  void OnNewKey(Key key, StoreObservability value) {
+    DCHECK_EQ(value, StoreObservability::kObservable);
+    DCHECK(!active_keys_.Contains(key));
+  }
+
+  void OnValueChange(Key key, StoreObservability old_value,
+                     StoreObservability new_value) {
+    DCHECK_NE(old_value, new_value);
+    if (new_value == StoreObservability::kObservable) {
+      active_keys_.Remove(key);
+    } else if (old_value == StoreObservability::kObservable) {
+      active_keys_.Add(key);
+    }
+  }
+
+  void BeginBlock(const Block* block) {
+    // Seal the current block first.
+    if (IsSealed()) {
+      DCHECK_NULL(current_block_);
+    } else {
+      // If we bind a new block while the previous one is still unsealed, we
+      // finalize it.
+      Seal();
+    }
+
+    // Collect the snapshots of all successors.
+    {
+      auto successors = SuccessorBlocks(block->LastOperation(graph_));
+      successor_snapshots_.clear();
+      for (const Block* s : successors) {
+        base::Optional<Snapshot> s_snapshot =
+            block_to_snapshot_mapping_[s->index()];
+        // When we visit the loop for the first time, the loop header hasn't
+        // been visited yet, so we ignore it.
+        DCHECK_IMPLIES(!s_snapshot.has_value(), s->IsLoop());
+        if (!s_snapshot.has_value()) continue;
+        successor_snapshots_.push_back(*s_snapshot);
+      }
+    }
+
+    // Start a new snapshot for this block by merging information from
+    // successors.
+    StartNewSnapshot(
+        base::VectorOf(successor_snapshots_),
+        [](Key, base::Vector<const StoreObservability> successors) {
+          return static_cast<StoreObservability>(
+              *std::max_element(successors.begin(), successors.end()));
+        });
+
+    current_block_ = block;
+  }
+
+  StoreObservability GetObservability(OpIndex base, int32_t offset,
+                                      uint8_t size) {
+    Key key = map_to_key(base, offset, size);
+    if (key.data().size < size) return StoreObservability::kObservable;
+    return Get(key);
+  }
+
+  void MarkStoreAsUnobservable(OpIndex base, int32_t offset, uint8_t size) {
+    // We can only shadow stores to the exact same `base`+`offset` and keep
+    // everything else because they might or might not alias.
+    Key key = map_to_key(base, offset, size);
+    // If the `size` we want to mark unobservable here is less than the size we
+    // have seen for this key before, we do not overwrite the entire field, so
+    // preceeding stores are not (fully) unobservable.
+    if (size < key.data().size) return;
+    Set(key, StoreObservability::kUnobservable);
+  }
+
+  void MarkPotentiallyAliasingStoresAsObservable(OpIndex base, int32_t offset) {
+    // For now, we consider all stores to the same offset as potentially
+    // aliasing. We might improve this to eliminate more precisely, if we have
+    // some sort of aliasing information.
+    for (Key key : active_keys_) {
+      Set(key, StoreObservability::kObservable);
+    }
+  }
+
+  void MarkAllStoresAsObservable() {
+    for (Key key : active_keys_) {
+      Set(key, StoreObservability::kObservable);
+    }
+  }
+
+  void MarkAllStoresAsGCObservable() {
+    for (Key key : active_keys_) {
+      auto current = Get(key);
+      DCHECK_NE(current, StoreObservability::kObservable);
+      if (current == StoreObservability::kUnobservable) {
+        Set(key, StoreObservability::kGCObservable);
+      }
+    }
+  }
+
+  void Seal(bool* snapshot_has_changed = nullptr) {
+    DCHECK(!IsSealed());
+    DCHECK_NOT_NULL(current_block_);
+    DCHECK(current_block_->index().valid());
+    auto& snapshot = block_to_snapshot_mapping_[current_block_->index()];
+    if (!snapshot_has_changed) {
+      snapshot = super::Seal();
+    } else if (!snapshot.has_value()) {
+      *snapshot_has_changed = true;
+      snapshot = super::Seal();
+    } else {
+      auto new_snapshot = super::Seal();
+      *snapshot_has_changed = false;
+      StartNewSnapshot(
+          base::VectorOf({snapshot.value(), new_snapshot}),
+          [&](Key key, base::Vector<const StoreObservability> successors) {
+            DCHECK_LE(successors[0], successors[1]);
+            if (successors[0] != successors[1]) *snapshot_has_changed = true;
+            return static_cast<StoreObservability>(
+                *std::max_element(successors.begin(), successors.end()));
+          });
+      snapshot = super::Seal();
+    }
+    current_block_ = nullptr;
+  }
+
+  void Print(std::ostream& os, const char* sep = "\n") const {
+    bool first = true;
+    for (Key key : active_keys_) {
+      os << (first ? "" : sep) << key.data().base.id() << "@"
+         << key.data().offset << ": " << Get(key);
+      first = false;
+    }
+  }
+
+ private:
+  Key map_to_key(OpIndex base, int32_t offset, uint8_t size) {
+    std::pair p{base, offset};
+    auto it = key_mapping_.find(p);
+    if (it != key_mapping_.end()) return it->second;
+    Key new_key = NewKey(MaybeRedundantStoresKeyData{base, offset, size},
+                         StoreObservability::kObservable);
+    key_mapping_.emplace(p, new_key);
+    return new_key;
+  }
+  struct GetActiveKeysIndex {
+    IntrusiveSetIndex& operator()(Key key) const {
+      return key.data().active_keys_index;
+    }
+  };
+
+  const Graph& graph_;
+  GrowingBlockSidetable<base::Optional<Snapshot>> block_to_snapshot_mapping_;
+  ZoneUnorderedMap<std::pair<OpIndex, int32_t>, Key> key_mapping_;
+  // In `active_keys_`, we track the keys of all stores that arge gc-observable
+  // or unobservable. Keys that are mapped to the default value (observable) are
+  // removed from the `active_keys_`.
+  ZoneIntrusiveSet<Key, GetActiveKeysIndex> active_keys_;
+  const Block* current_block_ = nullptr;
+  // {successor_snapshots_} and {temp_key_vector_} are used as temporary vectors
+  // inside functions. We store them as members to avoid reallocation.
+  ZoneVector<Snapshot> successor_snapshots_;
+};
+
+class RedundantStoreAnalysis {
+ public:
+  RedundantStoreAnalysis(const Graph& graph, Zone* phase_zone)
+      : graph_(graph), table_(graph, phase_zone) {}
+
+  void Run(ZoneSet<OpIndex>& eliminable_stores) {
+    eliminable_stores_ = &eliminable_stores;
+    for (uint32_t processed = graph_.block_count(); processed > 0;
+         --processed) {
+      BlockIndex block_index = static_cast<BlockIndex>(processed - 1);
+
+      const Block& block = graph_.Get(block_index);
+      ProcessBlock(block);
+
+      // If this block is a loop header, check if this loop needs to be
+      // revisited.
+      if (block.IsLoop()) {
+        DCHECK(!table_.IsSealed());
+        bool needs_revisit = false;
+        table_.Seal(&needs_revisit);
+        if (needs_revisit) {
+          Block* back_edge = block.LastPredecessor();
+          DCHECK_GE(back_edge->index(), block_index);
+          processed = back_edge->index().id() + 1;
+        }
+      }
+    }
+    eliminable_stores_ = nullptr;
+  }
+
+  void ProcessBlock(const Block& block) {
+    table_.BeginBlock(&block);
+
+    auto op_range = graph_.OperationIndices(block);
+    for (auto it = op_range.end(); it != op_range.begin();) {
+      --it;
+      OpIndex index = *it;
+      const Operation& op = graph_.Get(index);
+
+      switch (op.opcode) {
+        case Opcode::kStore: {
+          const StoreOp& store = op.Cast<StoreOp>();
+          // TODO(nicohartmann@): Use the new effect flags to distinguish heap
+          // access once available.
+          const bool is_on_heap_store = store.kind.tagged_base;
+          const bool is_field_store = !store.index().valid();
+          const uint8_t size = store.stored_rep.SizeInBytes();
+          // For now we consider only stores of fields of objects on the heap.
+          if (is_on_heap_store && is_field_store) {
+            switch (table_.GetObservability(store.base(), store.offset, size)) {
+              case StoreObservability::kUnobservable:
+                eliminable_stores_->insert(index);
+                break;
+              case StoreObservability::kGCObservable:
+                if (store.maybe_initializing_or_transitioning) {
+                  // We cannot eliminate this store, but we mark all following
+                  // stores to the same `base+offset` as unobservable.
+                  table_.MarkStoreAsUnobservable(store.base(), store.offset,
+                                                 size);
+                } else {
+                  eliminable_stores_->insert(index);
+                }
+                break;
+              case StoreObservability::kObservable:
+                // We cannot eliminate this store, but we mark all following
+                // stores to the same `base+offset` as unobservable.
+                table_.MarkStoreAsUnobservable(store.base(), store.offset,
+                                               size);
+                break;
+            }
+          }
+          break;
+        }
+        case Opcode::kLoad: {
+          const LoadOp& load = op.Cast<LoadOp>();
+          // TODO(nicohartmann@): Use the new effect flags to distinguish heap
+          // access once available.
+          const bool is_on_heap_load = load.kind.tagged_base;
+          const bool is_field_load = !load.index().valid();
+          // For now we consider only loads of fields of objects on the heap.
+          if (is_on_heap_load && is_field_load) {
+            table_.MarkPotentiallyAliasingStoresAsObservable(load.base(),
+                                                             load.offset);
+          }
+          break;
+        }
+        default: {
+          OpEffects effects = op.Effects();
+          if (effects.can_read_mutable_memory()) {
+            table_.MarkAllStoresAsObservable();
+          } else if (effects.requires_consistent_heap()) {
+            table_.MarkAllStoresAsGCObservable();
+          }
+        } break;
+      }
+    }
+  }
+
+ private:
+  const Graph& graph_;
+  MaybeRedundantStoresTable table_;
+  ZoneSet<OpIndex>* eliminable_stores_ = nullptr;
+};
+
+template <class Next>
+class StoreStoreEliminationReducer : public Next {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  void Analyze() {
+    analysis_.Run(eliminable_stores_);
+    Next::Analyze();
+  }
+
+  OpIndex REDUCE_INPUT_GRAPH(Store)(OpIndex ig_index, const StoreOp& store) {
+    if (eliminable_stores_.count(ig_index) > 0) {
+      return OpIndex::Invalid();
+    }
+    return Next::ReduceInputGraphStore(ig_index, store);
+  }
+
+ private:
+  RedundantStoreAnalysis analysis_{Asm().input_graph(), Asm().phase_zone()};
+  ZoneSet<OpIndex> eliminable_stores_{Asm().phase_zone()};
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_STORE_STORE_ELIMINATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/structural-optimization-reducer.h b/deps/v8/src/compiler/turboshaft/structural-optimization-reducer.h
new file mode 100644
index 00000000000000..bf5a49361d8843
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/structural-optimization-reducer.h
@@ -0,0 +1,229 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_STRUCTURAL_OPTIMIZATION_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_STRUCTURAL_OPTIMIZATION_REDUCER_H_
+
+#include <cstdio>
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/index.h"
+#include "src/zone/zone.h"
+
+// The StructuralOptimizationReducer reducer is suitable for changing the
+// graph in a way that doesn't reduce individual operations, rather changes
+// the structure of the graph.
+//
+// We currently support a reduction which transforms if-else cascades
+// that check if a given value is equal to a 32-bit constant from a given set
+// into a switch with cases corresponding to the constants in the set.
+//
+// So for example code like:
+//    [only pure ops 1]
+//    if (x == 3) {
+//      B1;
+//    } else {
+//      [only pure ops 2]
+//      if (x == 5) {
+//        B2;
+//      } else {
+//        B3;
+//      }
+//    }
+//
+// will be transformed to:
+//    [only pure ops 1]
+//    [only pure ops 2]
+//    switch (x) {
+//      case 3:
+//        B1;
+//      case 5:
+//        B2;
+//      default:
+//        B3;
+//    }
+//
+// Or represented graphically:
+//                                                 [only pure ops 1]
+//       [only pure ops 1]                         [only pure ops 2]
+//           x == 3                                    Switch(x)
+//           Branch                                    |    |   |
+//           |    |                                -----    |   ------
+//       -----    ------                    case 3 |        |        | default
+//       |             |                           |        |        |
+//     T |             | F                         v        |        |
+//       v             v                           B1       |        v
+//       B1      [only pure ops 2]    becomes               |        B3
+//                   x == 5           ======>        case 5 |
+//                   Branch                                 v
+//                   |    |                                 B2
+//               -----    ------
+//               |             |
+//             T |             | F
+//               v             v
+//              B2            B3
+//
+
+// TODO(mslekova): Introduce a flag and move to a common graph place.
+// #define TRACE_REDUCTIONS
+#ifdef TRACE_REDUCTIONS
+#define TRACE(str, ...) \
+  { PrintF(str, ##__VA_ARGS__); }
+#else  // TRACE_REDUCTIONS
+#define TRACE(str, ...)
+
+#endif  // TRACE_REDUCTIONS
+
+namespace v8::internal::compiler::turboshaft {
+
+template <class Next>
+class StructuralOptimizationReducer : public Next {
+ public:
+  using Next::Asm;
+
+  OpIndex ReduceInputGraphBranch(OpIndex input_index, const BranchOp& branch) {
+    LABEL_BLOCK(no_change) {
+      return Next::ReduceInputGraphBranch(input_index, branch);
+    }
+    if (ShouldSkipOptimizationStep()) goto no_change;
+
+    TRACE("[structural] Calling ReduceInputGraphBranch for index: %u\n",
+          static_cast<unsigned int>(input_index.id()));
+
+    base::SmallVector<SwitchOp::Case, 16> cases;
+    base::SmallVector<const Block*, 16> false_blocks;
+
+    Block* current_if_false;
+    const BranchOp* current_branch = &branch;
+    BranchHint default_hint = BranchHint::kNone;
+
+    OpIndex switch_var = OpIndex::Invalid();
+    while (true) {
+      // If we encounter a condition that is not equality, we can't turn it
+      // into a switch case.
+      const EqualOp* equal = Asm()
+                                 .input_graph()
+                                 .Get(current_branch->condition())
+                                 .template TryCast<EqualOp>();
+      if (!equal || equal->rep != RegisterRepresentation::Word32()) {
+        TRACE(
+            "\t [bailout] Branch with different condition than Word32 "
+            "Equal.\n");
+        break;
+      }
+
+      // MachineOptimizationReducer should normalize equality to put constants
+      // right.
+      const Operation& right_op = Asm().input_graph().Get(equal->right());
+      if (!right_op.Is<ConstantOp>()) {
+        TRACE("\t [bailout] No constant on the right side of Equal.\n");
+        break;
+      }
+
+      // We can only turn Word32 constant equals to switch cases.
+      const ConstantOp& const_op = right_op.Cast<ConstantOp>();
+      if (const_op.kind != ConstantOp::Kind::kWord32) {
+        TRACE("\t [bailout] Constant is not of type Word32.\n");
+        break;
+      }
+
+      // If we encounter equal to a different value, we can't introduce
+      // a switch.
+      OpIndex current_var = equal->left();
+      if (!switch_var.valid()) {
+        switch_var = current_var;
+      } else if (switch_var != current_var) {
+        TRACE("\t [bailout] Not all branches compare the same variable.\n");
+        break;
+      }
+
+      Block* current_if_true = current_branch->if_true;
+      current_if_false = current_branch->if_false;
+      DCHECK(current_if_true && current_if_false);
+
+      // The current_if_true block becomes the corresponding switch case block.
+      uint32_t value = const_op.word32();
+      cases.emplace_back(value, current_if_true->MapToNextGraph(),
+                         current_branch->hint);
+
+      // All pure ops from the if_false block should be executed before
+      // the switch, except the last Branch operation (which we drop).
+      false_blocks.push_back(current_if_false);
+
+      // If we encounter a if_false block that doesn't end with a Branch,
+      // this means we've reached the end of the cascade.
+      const Operation& maybe_branch =
+          current_if_false->LastOperation(Asm().input_graph());
+      if (!maybe_branch.Is<BranchOp>()) {
+        TRACE("\t [break] Reached end of the if-else cascade.\n");
+        break;
+      }
+
+      default_hint = current_branch->hint;
+
+      // Iterate to the next if_false block in the cascade.
+      current_branch = &maybe_branch.template Cast<BranchOp>();
+
+      // As long as the else blocks contain only pure ops, we can keep
+      // traversing the if-else cascade.
+      if (!ContainsOnlyPureOps(current_branch->if_false, Asm().input_graph())) {
+        TRACE("\t [break] End of only-pure-ops cascade reached.\n");
+        break;
+      }
+    }
+
+    // Probably better to keep short if-else cascades as they are.
+    if (cases.size() <= 2) {
+      TRACE("\t [bailout] Cascade with less than 2 levels of nesting.\n");
+      goto no_change;
+    }
+    CHECK_EQ(cases.size(), false_blocks.size());
+
+    // We're skipping the last false block, as it becomes the default block.
+    for (size_t i = 0; i < false_blocks.size() - 1; ++i) {
+      const Block* block = false_blocks[i];
+      InlineAllOperationsWithoutLast(block);
+    }
+
+    TRACE("[reduce] Successfully emit a Switch with %z cases.", cases.size());
+
+    // The last current_if_true block that ends the cascade becomes the default
+    // case.
+    Block* default_block = current_if_false;
+    Asm().Switch(
+        Asm().MapToNewGraph(switch_var),
+        Asm().output_graph().graph_zone()->CloneVector(base::VectorOf(cases)),
+        default_block->MapToNextGraph(), default_hint);
+    return OpIndex::Invalid();
+  }
+
+ private:
+  static bool ContainsOnlyPureOps(const Block* block, const Graph& graph) {
+    for (const auto& op : base::IterateWithoutLast(graph.operations(*block))) {
+      // We are moving the block content to before the switch, effectively
+      // moving it before the previously existing branches.
+      if (!op.Effects().hoistable_before_a_branch()) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  // Visits and emits {input_block} right now (ie, in the current block)
+  // until the one before the last operation is reached.
+  void InlineAllOperationsWithoutLast(const Block* input_block) {
+    base::iterator_range<Graph::OpIndexIterator> all_ops =
+        Asm().input_graph().OperationIndices(*input_block);
+
+    for (OpIndex op : base::IterateWithoutLast(all_ops)) {
+      Asm().InlineOp(op, input_block);
+    }
+  }
+};
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#undef TRACE
+
+#endif  // V8_COMPILER_TURBOSHAFT_STRUCTURAL_OPTIMIZATION_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/tag-untag-lowering-phase.cc b/deps/v8/src/compiler/turboshaft/tag-untag-lowering-phase.cc
deleted file mode 100644
index b927e69dd90b36..00000000000000
--- a/deps/v8/src/compiler/turboshaft/tag-untag-lowering-phase.cc
+++ /dev/null
@@ -1,16 +0,0 @@
-// Copyright 2023 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/compiler/turboshaft/tag-untag-lowering-phase.h"
-
-#include "src/compiler/turboshaft/tag-untag-lowering-reducer.h"
-
-namespace v8::internal::compiler::turboshaft {
-
-void TagUntagLoweringPhase::Run(PipelineData* data, Zone* temp_zone) {
-  turboshaft::OptimizationPhase<turboshaft::TagUntagLoweringReducer>::Run(
-      data->isolate(), &data->graph(), temp_zone, data->node_origins());
-}
-
-}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/tag-untag-lowering-reducer.h b/deps/v8/src/compiler/turboshaft/tag-untag-lowering-reducer.h
deleted file mode 100644
index 65b756aea77a70..00000000000000
--- a/deps/v8/src/compiler/turboshaft/tag-untag-lowering-reducer.h
+++ /dev/null
@@ -1,64 +0,0 @@
-// Copyright 2023 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_COMPILER_TURBOSHAFT_TAG_UNTAG_LOWERING_REDUCER_H_
-#define V8_COMPILER_TURBOSHAFT_TAG_UNTAG_LOWERING_REDUCER_H_
-
-#include "src/compiler/turboshaft/assembler.h"
-#include "src/compiler/turboshaft/graph.h"
-#include "src/compiler/turboshaft/operations.h"
-#include "src/compiler/turboshaft/representations.h"
-
-namespace v8::internal::compiler::turboshaft {
-
-#include "src/compiler/turboshaft/define-assembler-macros.inc"
-
-template <class Next>
-class TagUntagLoweringReducer : public Next {
-  static constexpr int kSmiShiftBits = kSmiShiftSize + kSmiTagSize;
-
- public:
-  TURBOSHAFT_REDUCER_BOILERPLATE()
-
-  template <class... Args>
-  explicit TagUntagLoweringReducer(const std::tuple<Args...>& args)
-      : Next(args) {}
-
-  OpIndex ReduceTag(OpIndex input, TagKind kind) {
-    DCHECK_EQ(kind, TagKind::kSmiTag);
-    // Do shift on 32bit values if Smis are stored in the lower word.
-    if constexpr (Is64() && SmiValuesAre31Bits()) {
-      return ChangeTaggedInt32ToSmi(__ Word32ShiftLeft(input, kSmiShiftBits));
-    } else {
-      return V<Tagged>::Cast(
-          __ WordPtrShiftLeft(__ ChangeInt32ToIntPtr(input), kSmiShiftBits));
-    }
-  }
-
-  OpIndex ReduceUntag(OpIndex input, TagKind kind, RegisterRepresentation rep) {
-    DCHECK_EQ(kind, TagKind::kSmiTag);
-    DCHECK_EQ(rep, RegisterRepresentation::Word32());
-    if constexpr (Is64() && SmiValuesAre31Bits()) {
-      return __ Word32ShiftRightArithmeticShiftOutZeros(input, kSmiShiftBits);
-    }
-    return V<Word32>::Cast(
-        __ WordPtrShiftRightArithmeticShiftOutZeros(input, kSmiShiftBits));
-  }
-
- private:
-  V<Tagged> ChangeTaggedInt32ToSmi(V<Word32> input) {
-    DCHECK(SmiValuesAre31Bits());
-    // In pointer compression, we smi-corrupt. Then, the upper bits are not
-    // important.
-    return COMPRESS_POINTERS_BOOL
-               ? V<Tagged>::Cast(__ BitcastWord32ToWord64(input))
-               : V<Tagged>::Cast(__ ChangeInt32ToIntPtr(input));
-  }
-};
-
-#include "src/compiler/turboshaft/undef-assembler-macros.inc"
-
-}  // namespace v8::internal::compiler::turboshaft
-
-#endif  // V8_COMPILER_TURBOSHAFT_TAG_UNTAG_LOWERING_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/type-assertions-phase.cc b/deps/v8/src/compiler/turboshaft/type-assertions-phase.cc
index 76966088f188af..4161536d2ec41b 100644
--- a/deps/v8/src/compiler/turboshaft/type-assertions-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/type-assertions-phase.cc
@@ -11,21 +11,17 @@
 
 namespace v8::internal::compiler::turboshaft {
 
-void TypeAssertionsPhase::Run(PipelineData* data, Zone* temp_zone) {
-  UnparkedScopeIfNeeded scope(data->broker());
+void TypeAssertionsPhase::Run(Zone* temp_zone) {
+  UnparkedScopeIfNeeded scope(PipelineData::Get().broker());
 
-  turboshaft::TypeInferenceReducerArgs typing_args{
-      data->isolate(),
+  turboshaft::TypeInferenceReducerArgs::Scope typing_args{
       turboshaft::TypeInferenceReducerArgs::InputGraphTyping::kPrecise,
       turboshaft::TypeInferenceReducerArgs::OutputGraphTyping::
           kPreserveFromInputGraph};
 
-  turboshaft::OptimizationPhase<turboshaft::AssertTypesReducer,
-                                turboshaft::ValueNumberingReducer,
-                                turboshaft::TypeInferenceReducer>::
-      Run(data->isolate(), &data->graph(), temp_zone, data->node_origins(),
-          std::tuple{typing_args,
-                     turboshaft::AssertTypesReducerArgs{data->isolate()}});
+  turboshaft::OptimizationPhase<
+      turboshaft::AssertTypesReducer, turboshaft::ValueNumberingReducer,
+      turboshaft::TypeInferenceReducer>::Run(temp_zone);
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/type-assertions-phase.h b/deps/v8/src/compiler/turboshaft/type-assertions-phase.h
index 2388013daae0b5..606a0fee5ad993 100644
--- a/deps/v8/src/compiler/turboshaft/type-assertions-phase.h
+++ b/deps/v8/src/compiler/turboshaft/type-assertions-phase.h
@@ -12,7 +12,7 @@ namespace v8::internal::compiler::turboshaft {
 struct TypeAssertionsPhase {
   DECL_TURBOSHAFT_PHASE_CONSTANTS(TypeAssertions)
 
-  void Run(PipelineData* data, Zone* temp_zone);
+  void Run(Zone* temp_zone);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/type-inference-analysis.h b/deps/v8/src/compiler/turboshaft/type-inference-analysis.h
index 92c463712211e1..766ef9403a2241 100644
--- a/deps/v8/src/compiler/turboshaft/type-inference-analysis.h
+++ b/deps/v8/src/compiler/turboshaft/type-inference-analysis.h
@@ -60,8 +60,16 @@ class TypeInferenceAnalysis {
          unprocessed_index < graph_.block_count();) {
       BlockIndex block_index = static_cast<BlockIndex>(unprocessed_index);
       ++unprocessed_index;
-
       const Block& block = graph_.Get(block_index);
+
+#ifdef DEBUG
+      if (V8_UNLIKELY(v8_flags.turboshaft_trace_typing)) {
+        std::stringstream os;
+        os << block.kind() << " " << block.index().id();
+        TURBOSHAFT_TRACE_TYPING("=== %s ===\n", os.str().c_str());
+      }
+#endif  // DEBUG
+
       ProcessBlock<false>(block, &unprocessed_index);
     }
     TURBOSHAFT_TRACE_TYPING("=== Completed Type Inference Analysis ===\n");
@@ -108,7 +116,7 @@ class TypeInferenceAnalysis {
     // predecessors.
     {
       auto MergeTypes = [&](table_t::Key,
-                            base::Vector<Type> predecessors) -> Type {
+                            base::Vector<const Type> predecessors) -> Type {
         DCHECK_GT(predecessors.size(), 0);
         Type result_type = predecessors[0];
         for (size_t i = 1; i < predecessors.size(); ++i) {
@@ -154,6 +162,11 @@ class TypeInferenceAnalysis {
         case Opcode::kTuple:
         case Opcode::kStaticAssert:
         case Opcode::kDebugBreak:
+        case Opcode::kDebugPrint:
+#if V8_ENABLE_WEBASSEMBLY
+        case Opcode::kGlobalSet:
+#endif
+        case Opcode::kCheckException:
           // These operations do not produce any output that needs to be typed.
           DCHECK_EQ(0, op.outputs_rep().size());
           break;
@@ -179,8 +192,10 @@ class TypeInferenceAnalysis {
         case Opcode::kWordBinop:
           ProcessWordBinop(index, op.Cast<WordBinopOp>());
           break;
+        case Opcode::kWord32PairBinop:
+        case Opcode::kAtomicWord32Pair:
         case Opcode::kPendingLoopPhi:
-          // Input graph must not contain PendingLoopPhi.
+          // Input graph must not contain these op codes.
           UNREACHABLE();
         case Opcode::kPhi:
           if constexpr (revisit_loop_header) {
@@ -193,9 +208,17 @@ class TypeInferenceAnalysis {
         case Opcode::kGoto: {
           const GotoOp& gto = op.Cast<GotoOp>();
           // Check if this is a backedge.
-          if (gto.destination->IsLoop() &&
-              gto.destination->index() < current_block_->index()) {
-            ProcessBlock<true>(*gto.destination, unprocessed_index);
+          if (gto.destination->IsLoop()) {
+            if (gto.destination->index() < current_block_->index()) {
+              ProcessBlock<true>(*gto.destination, unprocessed_index);
+            } else if (gto.destination->index() == current_block_->index()) {
+              // This is a single block loop. We must only revisit the current
+              // header block if we actually need to, in order to prevent
+              // infinite recursion.
+              if (!revisit_loop_header || loop_needs_revisit) {
+                ProcessBlock<true>(*gto.destination, unprocessed_index);
+              }
+            }
           }
           break;
         }
@@ -207,10 +230,11 @@ class TypeInferenceAnalysis {
         case Opcode::kChange:
         case Opcode::kChangeOrDeopt:
         case Opcode::kTryChange:
-        case Opcode::kFloat64InsertWord32:
+        case Opcode::kBitcastWord32PairToFloat64:
         case Opcode::kTaggedBitcast:
         case Opcode::kSelect:
         case Opcode::kLoad:
+        case Opcode::kAtomicRMW:
         case Opcode::kAllocate:
         case Opcode::kDecodeExternalPointer:
         case Opcode::kParameter:
@@ -219,18 +243,20 @@ class TypeInferenceAnalysis {
         case Opcode::kStackSlot:
         case Opcode::kFrameConstant:
         case Opcode::kCall:
-        case Opcode::kCallAndCatchException:
-        case Opcode::kLoadException:
+        case Opcode::kCatchBlockBegin:
         case Opcode::kTailCall:
+        case Opcode::kDidntThrow:
         case Opcode::kObjectIs:
         case Opcode::kFloatIs:
-        case Opcode::kConvertToObject:
-        case Opcode::kConvertToObjectOrDeopt:
-        case Opcode::kConvertObjectToPrimitive:
-        case Opcode::kConvertObjectToPrimitiveOrDeopt:
-        case Opcode::kTruncateObjectToPrimitive:
-        case Opcode::kTag:
-        case Opcode::kUntag:
+        case Opcode::kObjectIsNumericValue:
+        case Opcode::kConvert:
+        case Opcode::kConvertUntaggedToJSPrimitive:
+        case Opcode::kConvertUntaggedToJSPrimitiveOrDeopt:
+        case Opcode::kConvertJSPrimitiveToUntagged:
+        case Opcode::kConvertJSPrimitiveToUntaggedOrDeopt:
+        case Opcode::kTruncateJSPrimitiveToUntagged:
+        case Opcode::kTruncateJSPrimitiveToUntaggedOrDeopt:
+        case Opcode::kConvertJSPrimitiveToObject:
         case Opcode::kNewConsString:
         case Opcode::kNewArray:
         case Opcode::kDoubleArrayMinMax:
@@ -247,8 +273,59 @@ class TypeInferenceAnalysis {
         case Opcode::kStringIndexOf:
         case Opcode::kStringFromCodePointAt:
         case Opcode::kStringSubstring:
+        case Opcode::kStringConcat:
         case Opcode::kStringEqual:
         case Opcode::kStringComparison:
+        case Opcode::kArgumentsLength:
+        case Opcode::kNewArgumentsElements:
+        case Opcode::kLoadTypedElement:
+        case Opcode::kLoadDataViewElement:
+        case Opcode::kLoadStackArgument:
+        case Opcode::kStoreTypedElement:
+        case Opcode::kStoreDataViewElement:
+        case Opcode::kTransitionAndStoreArrayElement:
+        case Opcode::kCompareMaps:
+        case Opcode::kCheckMaps:
+        case Opcode::kAssumeMap:
+        case Opcode::kCheckedClosure:
+        case Opcode::kCheckEqualsInternalizedString:
+        case Opcode::kLoadMessage:
+        case Opcode::kStoreMessage:
+        case Opcode::kSameValue:
+        case Opcode::kFloat64SameValue:
+        case Opcode::kFastApiCall:
+        case Opcode::kRuntimeAbort:
+        case Opcode::kEnsureWritableFastElements:
+        case Opcode::kMaybeGrowFastElements:
+        case Opcode::kTransitionElementsKind:
+        case Opcode::kFindOrderedHashEntry:
+#if V8_ENABLE_WEBASSEMBLY
+        // TODO(14108): Implement.
+        case Opcode::kGlobalGet:
+        case Opcode::kIsNull:
+        case Opcode::kNull:
+        case Opcode::kAssertNotNull:
+        case Opcode::kRttCanon:
+        case Opcode::kWasmTypeCheck:
+        case Opcode::kWasmTypeCast:
+        case Opcode::kStructGet:
+        case Opcode::kStructSet:
+        case Opcode::kArrayGet:
+        case Opcode::kArraySet:
+        case Opcode::kArrayLength:
+        case Opcode::kSimd128Constant:
+        case Opcode::kSimd128Binop:
+        case Opcode::kSimd128Unary:
+        case Opcode::kSimd128Shift:
+        case Opcode::kSimd128Test:
+        case Opcode::kSimd128Splat:
+        case Opcode::kSimd128Ternary:
+        case Opcode::kSimd128ExtractLane:
+        case Opcode::kSimd128ReplaceLane:
+        case Opcode::kSimd128LaneMemory:
+        case Opcode::kSimd128LoadTransform:
+        case Opcode::kSimd128Shuffle:
+#endif
           // TODO(nicohartmann@): Support remaining operations. For now we
           // compute fallback types.
           if (op.outputs_rep().size() > 0) {
@@ -404,9 +481,21 @@ class TypeInferenceAnalysis {
   }
 
   Type ComputeTypeForPhi(const PhiOp& phi) {
-    Type result_type = GetTypeOrDefault(phi.inputs()[0], Type::None());
+    // Word64 values are truncated to word32 implicitly, we need to handle this
+    // here.
+    auto MaybeTruncate = [&](Type t) -> Type {
+      if (t.IsNone()) return t;
+      if (phi.rep == RegisterRepresentation::Word32()) {
+        return Typer::TruncateWord32Input(t, true, graph_zone_);
+      }
+      return t;
+    };
+
+    Type result_type =
+        MaybeTruncate(GetTypeOrDefault(phi.inputs()[0], Type::None()));
     for (size_t i = 1; i < phi.inputs().size(); ++i) {
-      Type input_type = GetTypeOrDefault(phi.inputs()[i], Type::None());
+      Type input_type =
+          MaybeTruncate(GetTypeOrDefault(phi.inputs()[i], Type::None()));
       result_type = Type::LeastUpperBound(result_type, input_type, graph_zone_);
     }
     return result_type;
diff --git a/deps/v8/src/compiler/turboshaft/type-inference-reducer.h b/deps/v8/src/compiler/turboshaft/type-inference-reducer.h
index c6e039a5dcb772..d76c4330437dcb 100644
--- a/deps/v8/src/compiler/turboshaft/type-inference-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/type-inference-reducer.h
@@ -24,12 +24,15 @@
 
 namespace v8::internal::compiler::turboshaft {
 
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
 template <typename Op>
 V8_INLINE bool CanBeTyped(const Op& operation) {
   return operation.outputs_rep().size() > 0;
 }
 
-struct TypeInferenceReducerArgs {
+struct TypeInferenceReducerArgs
+    : base::ContextualClass<TypeInferenceReducerArgs> {
   enum class InputGraphTyping {
     kNone,     // Do not compute types for the input graph.
     kPrecise,  // Run a complete fixpoint analysis on the input graph.
@@ -42,9 +45,13 @@ struct TypeInferenceReducerArgs {
                             // for new nodes and more precise types where
                             // possible.
   };
-  Isolate* isolate;
   InputGraphTyping input_graph_typing;
   OutputGraphTyping output_graph_typing;
+
+  TypeInferenceReducerArgs(InputGraphTyping input_graph_typing,
+                           OutputGraphTyping output_graph_typing)
+      : input_graph_typing(input_graph_typing),
+        output_graph_typing(output_graph_typing) {}
 };
 
 // TypeInferenceReducer is the central component to infer types for Turboshaft
@@ -76,20 +83,8 @@ class TypeInferenceReducer
 
   using Adapter = UniformReducerAdapter<TypeInferenceReducer, Next>;
   using Args = TypeInferenceReducerArgs;
-  using ArgT = base::append_tuple_type<typename Next::ArgT, Args>;
-
-  template <typename... Ts>
-  explicit TypeInferenceReducer(const std::tuple<Ts...>& args)
-      : Adapter(args),
-        args_(std::get<Args>(args)),
-        input_graph_types_(Asm().graph_zone()),
-        output_graph_types_(Asm().output_graph().operation_types()),
-        table_(Asm().phase_zone()),
-        op_to_key_mapping_(Asm().phase_zone()),
-        block_to_snapshot_mapping_(Asm().input_graph().block_count(),
-                                   base::nullopt, Asm().phase_zone()),
-        predecessors_(Asm().phase_zone()),
-        analyzer_(Asm().modifiable_input_graph(), Asm().phase_zone()) {
+
+  TypeInferenceReducer() {
     // It is not reasonable to try to reuse input graph types if there are none.
     DCHECK_IMPLIES(args_.output_graph_typing ==
                        Args::OutputGraphTyping::kPreserveFromInputGraph,
@@ -209,7 +204,7 @@ class TypeInferenceReducer
     // predecessors.
     {
       auto MergeTypes = [&](table_t::Key,
-                            base::Vector<Type> predecessors) -> Type {
+                            base::Vector<const Type> predecessors) -> Type {
         DCHECK_GT(predecessors.size(), 0);
         Type result_type = predecessors[0];
         for (size_t i = 1; i < predecessors.size(); ++i) {
@@ -287,9 +282,8 @@ class TypeInferenceReducer
     }
   }
 
-  OpIndex ReducePendingLoopPhi(OpIndex first, RegisterRepresentation rep,
-                               PendingLoopPhiOp::Data data) {
-    OpIndex index = Next::ReducePendingLoopPhi(first, rep, data);
+  OpIndex REDUCE(PendingLoopPhi)(OpIndex first, RegisterRepresentation rep) {
+    OpIndex index = Next::ReducePendingLoopPhi(first, rep);
     if (!NeedsTyping(index)) return index;
 
     // There is not much we can do for pending loop phis, because we don't know
@@ -300,8 +294,8 @@ class TypeInferenceReducer
     return index;
   }
 
-  OpIndex ReducePhi(base::Vector<const OpIndex> inputs,
-                    RegisterRepresentation rep) {
+  OpIndex REDUCE(Phi)(base::Vector<const OpIndex> inputs,
+                      RegisterRepresentation rep) {
     OpIndex index = Next::ReducePhi(inputs, rep);
     if (!NeedsTyping(index)) return index;
 
@@ -313,7 +307,7 @@ class TypeInferenceReducer
     return index;
   }
 
-  OpIndex ReduceConstant(ConstantOp::Kind kind, ConstantOp::Storage value) {
+  OpIndex REDUCE(Constant)(ConstantOp::Kind kind, ConstantOp::Storage value) {
     OpIndex index = Next::ReduceConstant(kind, value);
     if (!NeedsTyping(index)) return index;
 
@@ -322,8 +316,9 @@ class TypeInferenceReducer
     return index;
   }
 
-  OpIndex ReduceComparison(OpIndex left, OpIndex right, ComparisonOp::Kind kind,
-                           RegisterRepresentation rep) {
+  OpIndex REDUCE(Comparison)(OpIndex left, OpIndex right,
+                             ComparisonOp::Kind kind,
+                             RegisterRepresentation rep) {
     OpIndex index = Next::ReduceComparison(left, right, kind, rep);
     if (!NeedsTyping(index)) return index;
 
@@ -333,8 +328,8 @@ class TypeInferenceReducer
     return index;
   }
 
-  OpIndex ReduceProjection(OpIndex input, uint16_t idx,
-                           RegisterRepresentation rep) {
+  OpIndex REDUCE(Projection)(OpIndex input, uint16_t idx,
+                             RegisterRepresentation rep) {
     OpIndex index = Next::ReduceProjection(input, idx, rep);
     if (!NeedsTyping(index)) return index;
 
@@ -343,8 +338,8 @@ class TypeInferenceReducer
     return index;
   }
 
-  OpIndex ReduceWordBinop(OpIndex left, OpIndex right, WordBinopOp::Kind kind,
-                          WordRepresentation rep) {
+  OpIndex REDUCE(WordBinop)(OpIndex left, OpIndex right, WordBinopOp::Kind kind,
+                            WordRepresentation rep) {
     OpIndex index = Next::ReduceWordBinop(left, right, kind, rep);
     if (!NeedsTyping(index)) return index;
 
@@ -354,9 +349,9 @@ class TypeInferenceReducer
     return index;
   }
 
-  OpIndex ReduceOverflowCheckedBinop(OpIndex left, OpIndex right,
-                                     OverflowCheckedBinopOp::Kind kind,
-                                     WordRepresentation rep) {
+  OpIndex REDUCE(OverflowCheckedBinop)(OpIndex left, OpIndex right,
+                                       OverflowCheckedBinopOp::Kind kind,
+                                       WordRepresentation rep) {
     OpIndex index = Next::ReduceOverflowCheckedBinop(left, right, kind, rep);
     if (!NeedsTyping(index)) return index;
 
@@ -366,8 +361,8 @@ class TypeInferenceReducer
     return index;
   }
 
-  OpIndex ReduceFloatBinop(OpIndex left, OpIndex right, FloatBinopOp::Kind kind,
-                           FloatRepresentation rep) {
+  OpIndex REDUCE(FloatBinop)(OpIndex left, OpIndex right,
+                             FloatBinopOp::Kind kind, FloatRepresentation rep) {
     OpIndex index = Next::ReduceFloatBinop(left, right, kind, rep);
     if (!NeedsTyping(index)) return index;
 
@@ -377,8 +372,9 @@ class TypeInferenceReducer
     return index;
   }
 
-  OpIndex ReduceCheckTurboshaftTypeOf(OpIndex input, RegisterRepresentation rep,
-                                      Type type, bool successful) {
+  OpIndex REDUCE(CheckTurboshaftTypeOf)(OpIndex input,
+                                        RegisterRepresentation rep, Type type,
+                                        bool successful) {
     Type input_type = GetType(input);
     if (input_type.IsSubtypeOf(type)) {
       OpIndex index = Next::ReduceCheckTurboshaftTypeOf(input, rep, type, true);
@@ -440,7 +436,7 @@ class TypeInferenceReducer
         (og_type.IsInvalid() ? "invalid" : og_type.ToString().c_str()),
         ig_type.ToString().c_str());
 
-    SetType(index, ig_type);
+    RefineOperationType(Asm().current_block(), index, ig_type, 'I');
   }
 
   Type GetTypeOrInvalid(OpIndex index) {
@@ -538,20 +534,26 @@ class TypeInferenceReducer
                                 Args::OutputGraphTyping::kRefineFromInputGraph;
   }
 
-  Args args_;
-  GrowingSidetable<Type> input_graph_types_;
-  GrowingSidetable<Type>& output_graph_types_;
-  table_t table_;
+  TypeInferenceReducerArgs args_{TypeInferenceReducerArgs::Get()};
+  GrowingSidetable<Type> input_graph_types_{Asm().graph_zone()};
+  GrowingSidetable<Type>& output_graph_types_{
+      Asm().output_graph().operation_types()};
+  table_t table_{Asm().phase_zone()};
   const Block* current_block_ = nullptr;
-  GrowingSidetable<base::Optional<table_t::Key>> op_to_key_mapping_;
+  GrowingSidetable<base::Optional<table_t::Key>> op_to_key_mapping_{
+      Asm().phase_zone()};
   GrowingBlockSidetable<base::Optional<table_t::Snapshot>>
-      block_to_snapshot_mapping_;
+      block_to_snapshot_mapping_{Asm().input_graph().block_count(),
+                                 base::nullopt, Asm().phase_zone()};
   // {predecessors_} is used during merging, but we use an instance variable for
   // it, in order to save memory and not reallocate it for each merge.
-  ZoneVector<table_t::Snapshot> predecessors_;
-  TypeInferenceAnalysis analyzer_;
+  ZoneVector<table_t::Snapshot> predecessors_{Asm().phase_zone()};
+  TypeInferenceAnalysis analyzer_{Asm().modifiable_input_graph(),
+                                  Asm().phase_zone()};
 };
 
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_TYPE_INFERENCE_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/typed-optimizations-phase.cc b/deps/v8/src/compiler/turboshaft/typed-optimizations-phase.cc
index 9b40e2836991cc..9245c07059619a 100644
--- a/deps/v8/src/compiler/turboshaft/typed-optimizations-phase.cc
+++ b/deps/v8/src/compiler/turboshaft/typed-optimizations-phase.cc
@@ -10,21 +10,19 @@
 
 namespace v8::internal::compiler::turboshaft {
 
-void TypedOptimizationsPhase::Run(PipelineData* data, Zone* temp_zone) {
+void TypedOptimizationsPhase::Run(Zone* temp_zone) {
 #ifdef DEBUG
-  UnparkedScopeIfNeeded scope(data->broker(), v8_flags.turboshaft_trace_typing);
+  UnparkedScopeIfNeeded scope(PipelineData::Get().broker(),
+                              v8_flags.turboshaft_trace_typing);
 #endif
 
-  turboshaft::TypeInferenceReducerArgs typing_args{
-      data->isolate(),
+  turboshaft::TypeInferenceReducerArgs::Scope typing_args{
       turboshaft::TypeInferenceReducerArgs::InputGraphTyping::kPrecise,
       turboshaft::TypeInferenceReducerArgs::OutputGraphTyping::kNone};
 
   turboshaft::OptimizationPhase<
       turboshaft::TypedOptimizationsReducer,
-      turboshaft::TypeInferenceReducer>::Run(data->isolate(), &data->graph(),
-                                             temp_zone, data->node_origins(),
-                                             {typing_args});
+      turboshaft::TypeInferenceReducer>::Run(temp_zone);
 }
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/typed-optimizations-phase.h b/deps/v8/src/compiler/turboshaft/typed-optimizations-phase.h
index 21440a53e90d3c..ec24bbc4f9af6f 100644
--- a/deps/v8/src/compiler/turboshaft/typed-optimizations-phase.h
+++ b/deps/v8/src/compiler/turboshaft/typed-optimizations-phase.h
@@ -12,7 +12,7 @@ namespace v8::internal::compiler::turboshaft {
 struct TypedOptimizationsPhase {
   DECL_TURBOSHAFT_PHASE_CONSTANTS(TypedOptimizations)
 
-  void Run(PipelineData* data, Zone* temp_zone);
+  void Run(Zone* temp_zone);
 };
 
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/typed-optimizations-reducer.h b/deps/v8/src/compiler/turboshaft/typed-optimizations-reducer.h
index be62b77f20c2a9..961d39d6a92a70 100644
--- a/deps/v8/src/compiler/turboshaft/typed-optimizations-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/typed-optimizations-reducer.h
@@ -19,33 +19,32 @@ class TypeInferenceReducer;
 template <typename Next>
 class TypedOptimizationsReducer
     : public UniformReducerAdapter<TypedOptimizationsReducer, Next> {
+#if defined(__clang__)
   // Typed optimizations require a typed graph.
-  // TODO(nicohartmann@): Reenable this in a way that compiles with msvc light.
-  // static_assert(next_contains_reducer<Next, TypeInferenceReducer>::value);
+  static_assert(next_contains_reducer<Next, TypeInferenceReducer>::value);
+#endif
 
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
   using Adapter = UniformReducerAdapter<TypedOptimizationsReducer, Next>;
 
-  template <typename... Args>
-  explicit TypedOptimizationsReducer(const std::tuple<Args...>& args)
-      : Adapter(args) {}
-
   OpIndex ReduceInputGraphBranch(OpIndex ig_index, const BranchOp& operation) {
-    Type condition_type = GetType(operation.condition());
-    if (!condition_type.IsInvalid()) {
-      if (condition_type.IsNone()) {
-        Asm().Unreachable();
-        return OpIndex::Invalid();
-      }
-      condition_type =
-          Typer::TruncateWord32Input(condition_type, true, Asm().graph_zone());
-      DCHECK(condition_type.IsWord32());
-      if (auto c = condition_type.AsWord32().try_get_constant()) {
-        Block* goto_target = *c == 0 ? operation.if_false : operation.if_true;
-        Asm().Goto(goto_target->MapToNextGraph());
-        return OpIndex::Invalid();
+    if (!ShouldSkipOptimizationStep()) {
+      Type condition_type = GetType(operation.condition());
+      if (!condition_type.IsInvalid()) {
+        if (condition_type.IsNone()) {
+          Asm().Unreachable();
+          return OpIndex::Invalid();
+        }
+        condition_type = Typer::TruncateWord32Input(condition_type, true,
+                                                    Asm().graph_zone());
+        DCHECK(condition_type.IsWord32());
+        if (auto c = condition_type.AsWord32().try_get_constant()) {
+          Block* goto_target = *c == 0 ? operation.if_false : operation.if_true;
+          Asm().Goto(goto_target->MapToNextGraph());
+          return OpIndex::Invalid();
+        }
       }
     }
     return Adapter::ReduceInputGraphBranch(ig_index, operation);
@@ -53,16 +52,19 @@ class TypedOptimizationsReducer
 
   template <typename Op, typename Continuation>
   OpIndex ReduceInputGraphOperation(OpIndex ig_index, const Op& operation) {
-    Type type = GetType(ig_index);
-    if (type.IsNone()) {
-      // This operation is dead. Remove it.
-      DCHECK(CanBeTyped(operation));
-      return OpIndex::Invalid();
-    } else if (!type.IsInvalid()) {
-      // See if we can replace the operation by a constant.
-      if (OpIndex constant = TryAssembleConstantForType(type);
-          constant.valid()) {
-        return constant;
+    if (!ShouldSkipOptimizationStep()) {
+      Type type = GetType(ig_index);
+      if (type.IsNone()) {
+        // This operation is dead. Remove it.
+        DCHECK(CanBeTyped(operation));
+        Asm().Unreachable();
+        return OpIndex::Invalid();
+      } else if (!type.IsInvalid()) {
+        // See if we can replace the operation by a constant.
+        if (OpIndex constant = TryAssembleConstantForType(type);
+            constant.valid()) {
+          return constant;
+        }
       }
     }
 
diff --git a/deps/v8/src/compiler/turboshaft/typer.cc b/deps/v8/src/compiler/turboshaft/typer.cc
index f007f26e35944d..b325f7d9e1ed9b 100644
--- a/deps/v8/src/compiler/turboshaft/typer.cc
+++ b/deps/v8/src/compiler/turboshaft/typer.cc
@@ -84,7 +84,7 @@ void Typer::BranchRefinements::RefineTypes(const Operation& condition,
         return;
     }
 
-    // In some cases, the refined type is not a subtyp eof the old type,
+    // In some cases, the refined type is not a subtype of the old type,
     // because it cannot be represented precisely. In this case we keep the
     // old type to be stable.
     if (l_refined.IsSubtypeOf(lhs)) {
diff --git a/deps/v8/src/compiler/turboshaft/typer.h b/deps/v8/src/compiler/turboshaft/typer.h
index f65ffcdc41d523..690414b465af8b 100644
--- a/deps/v8/src/compiler/turboshaft/typer.h
+++ b/deps/v8/src/compiler/turboshaft/typer.h
@@ -87,7 +87,7 @@ struct WordOperationTyper {
   // element either by increasing the 'to' or decreasing the 'from' of the
   // range, whichever leads to a smaller range.
   static std::pair<word_t, word_t> MakeRange(
-      const base::Vector<const word_t>& elements) {
+      base::Vector<const word_t> elements) {
     DCHECK(!elements.empty());
     DCHECK(detail::is_unique_and_sorted(elements));
     if (elements[elements.size() - 1] - elements[0] <= max / 2) {
@@ -169,7 +169,7 @@ struct WordOperationTyper {
     std::pair<word_t, word_t> x = MakeRange(lhs);
     std::pair<word_t, word_t> y = MakeRange(rhs);
 
-    if (is_wrapping(x) && is_wrapping(y)) {
+    if (!is_wrapping(x) && !is_wrapping(y)) {
       return type_t::Range(x.first - y.second, x.second - y.first, zone);
     }
 
@@ -267,21 +267,15 @@ struct WordOperationTyper {
   static type_t WidenMaximal(const type_t& old_type, const type_t& new_type,
                              Zone* zone) {
     if (new_type.is_any()) return new_type;
+    if (old_type.is_wrapping() || new_type.is_wrapping()) return type_t::Any();
 
-    if (old_type.is_wrapping()) {
-      DCHECK(new_type.is_wrapping());
-      return type_t::Any();
-    } else if (new_type.is_wrapping()) {
-      return type_t::Any();
-    } else {
-      word_t result_from = new_type.unsigned_min();
-      if (result_from < old_type.unsigned_min()) result_from = 0;
-      word_t result_to = new_type.unsigned_max();
-      if (result_to > old_type.unsigned_max()) {
-        result_to = std::numeric_limits<word_t>::max();
-      }
-      return type_t::Range(result_from, result_to, zone);
+    word_t result_from = new_type.unsigned_min();
+    if (result_from < old_type.unsigned_min()) result_from = 0;
+    word_t result_to = new_type.unsigned_max();
+    if (result_to > old_type.unsigned_max()) {
+      result_to = std::numeric_limits<word_t>::max();
     }
+    return type_t::Range(result_from, result_to, zone);
   }
 
   // Performs exponential widening, which means that the number of values
@@ -414,7 +408,11 @@ struct FloatOperationTyper {
   static type_t Range(float_t min, float_t max, uint32_t special_values,
                       Zone* zone) {
     DCHECK_LE(min, max);
-    if (min == max) return Set({min}, special_values, zone);
+    DCHECK_IMPLIES(detail::is_minus_zero(min),
+                   (special_values & type_t::kMinusZero));
+    DCHECK_IMPLIES(detail::is_minus_zero(max),
+                   (special_values & type_t::kMinusZero));
+    if (min == max) return Set({min + float_t{0}}, special_values, zone);
     return type_t::Range(min, max, special_values, zone);
   }
 
@@ -430,6 +428,10 @@ struct FloatOperationTyper {
         0) {
       special_values |= type_t::kMinusZero;
     }
+    if (elements.empty()) {
+      DCHECK_NE(0, special_values);
+      return type_t::OnlySpecialValues(special_values);
+    }
     return type_t::Set(elements, special_values, zone);
   }
 
@@ -678,12 +680,12 @@ struct FloatOperationTyper {
       }
       if V8_UNLIKELY (IsMinusZero(b)) {
         // +-0 / -0 ==> NaN
-        if (a == 0) return nan_v<Bits>;
+        if (a == 0 || std::isnan(a)) return nan_v<Bits>;
         return a > 0 ? -inf : inf;
       }
       if V8_UNLIKELY (b == 0) {
         // +-0 / 0 ==> NaN
-        if (a == 0) return nan_v<Bits>;
+        if (a == 0 || std::isnan(a)) return nan_v<Bits>;
         return a > 0 ? inf : -inf;
       }
       return a / b;
@@ -771,7 +773,7 @@ struct FloatOperationTyper {
         l.has_nan() || IsZeroish(r) || l.min() == -inf || l.max() == inf;
 
     // Deal with -0 inputs, only the signbit of {lhs} matters for the result.
-    bool maybe_minuszero = false;
+    bool maybe_minuszero = l.min() < 0;
     if (l.has_minus_zero()) {
       maybe_minuszero = true;
       l = type_t::LeastUpperBound(l, type_t::Constant(0), zone);
@@ -899,16 +901,21 @@ struct FloatOperationTyper {
       return type_t::NaN();
     }
     bool maybe_nan = l.has_nan() || r.has_nan();
+    // +-1 ** +-Infinity => NaN.
+    if (r.Contains(-inf) || r.Contains(inf)) {
+      if (l.Contains(1) || l.Contains(-1)) maybe_nan = true;
+    }
 
     // a ** b produces NaN if a < 0 && b is fraction.
     if (l.min() < 0.0 && !IsIntegerSet(r)) maybe_nan = true;
 
-    // a ** b produces -0 iff a == -0 and b is odd. Checking for all the cases
-    // where b does only contain odd integer values seems not worth the
-    // additional information we get here. We accept this over-approximation for
-    // now. We could refine this whenever we see a benefit.
-    uint32_t special_values =
-        (maybe_nan ? type_t::kNaN : 0) | l.special_values();
+    // Precise checks for when the result can be -0 is difficult, because of
+    // large (negative) exponents. To be safe we add -0 whenever the left hand
+    // side can be negative. We might refine this when necessary.
+    bool maybe_minus_zero = l.min() < 0.0 || l.has_minus_zero();
+    uint32_t special_values = (maybe_nan ? type_t::kNaN : 0) |
+                              (maybe_minus_zero ? type_t::kMinusZero : 0) |
+                              l.special_values();
 
     // If both sides are decently small sets, we produce the product set.
     auto combine = [](float_t a, float_t b) { return std::pow(a, b); };
@@ -1138,6 +1145,7 @@ class Typer {
 
       case RegisterRepresentation::Tagged():
       case RegisterRepresentation::Compressed():
+      case RegisterRepresentation::Simd128():
         // TODO(nicohartmann@): Support these representations.
         return Type::Any();
     }
@@ -1400,6 +1408,7 @@ class Typer {
         return TypeFloat64Comparison(lhs, rhs, kind, zone);
       case RegisterRepresentation::Tagged():
       case RegisterRepresentation::Compressed():
+      case RegisterRepresentation::Simd128():
         if (lhs.IsNone() || rhs.IsNone()) return Type::None();
         // TODO(nicohartmann@): Support those cases.
         return Word32Type::Set({0, 1}, zone);
diff --git a/deps/v8/src/compiler/turboshaft/types.cc b/deps/v8/src/compiler/turboshaft/types.cc
index 5cdef9eb203c7e..e5a0e5959ac4f6 100644
--- a/deps/v8/src/compiler/turboshaft/types.cc
+++ b/deps/v8/src/compiler/turboshaft/types.cc
@@ -561,9 +561,9 @@ FloatType<Bits> FloatType<Bits>::LeastUpperBound(const FloatType<Bits>& lhs,
     return Range(result_elements.front(), result_elements.back(),
                  special_values, zone);
   } else if (lhs.is_only_special_values()) {
-    return ReplacedSpecialValues(rhs, special_values);
+    return ReplacedSpecialValues(rhs, special_values).template AsFloat<Bits>();
   } else if (rhs.is_only_special_values()) {
-    return ReplacedSpecialValues(lhs, special_values);
+    return ReplacedSpecialValues(lhs, special_values).template AsFloat<Bits>();
   }
 
   // We need to construct a range.
@@ -691,7 +691,7 @@ Type TupleType::LeastUpperBound(const TupleType& lhs, const TupleType& rhs,
                                 Zone* zone) {
   if (lhs.size() != rhs.size()) return Type::Any();
   Payload p;
-  p.array = zone->NewArray<Type>(lhs.size());
+  p.array = zone->AllocateArray<Type>(lhs.size());
   for (int i = 0; i < lhs.size(); ++i) {
     p.array[i] = Type::LeastUpperBound(lhs.element(i), rhs.element(i), zone);
   }
diff --git a/deps/v8/src/compiler/turboshaft/types.h b/deps/v8/src/compiler/turboshaft/types.h
index 3a6f4d192bb8ef..d3545670e4cc72 100644
--- a/deps/v8/src/compiler/turboshaft/types.h
+++ b/deps/v8/src/compiler/turboshaft/types.h
@@ -207,11 +207,20 @@ class V8_EXPORT_PRIVATE Type {
   inline bool IsAny() const { return kind_ == Kind::kAny; }
   template <size_t B>
   inline bool IsWord() const {
+    static_assert(B == 32 || B == 64);
     if constexpr (B == 32)
       return IsWord32();
     else
       return IsWord64();
   }
+  template <size_t B>
+  inline bool IsFloat() const {
+    static_assert(B == 32 || B == 64);
+    if constexpr (B == 32)
+      return IsFloat32();
+    else
+      return IsFloat64();
+  }
 
   // Casts
   inline const Word32Type& AsWord32() const;
@@ -221,11 +230,20 @@ class V8_EXPORT_PRIVATE Type {
   inline const TupleType& AsTuple() const;
   template <size_t B>
   inline const auto& AsWord() const {
+    static_assert(B == 32 || B == 64);
     if constexpr (B == 32)
       return AsWord32();
     else
       return AsWord64();
   }
+  template <size_t B>
+  inline const auto& AsFloat() const {
+    static_assert(B == 32 || B == 64);
+    if constexpr (B == 32)
+      return AsFloat32();
+    else
+      return AsFloat64();
+  }
 
   // Comparison
   bool Equals(const Type& other) const;
@@ -293,7 +311,7 @@ class V8_EXPORT_PRIVATE Type {
 static_assert(sizeof(Type) == 24);
 
 template <size_t Bits>
-class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType : public Type {
+class WordType : public Type {
   static_assert(Bits == 32 || Bits == 64);
   friend class Type;
   static constexpr int kMaxInlineSetSize = 2;
@@ -355,7 +373,7 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType : public Type {
     return Set(base::Vector<const word_t>{elements.begin(), elements.size()},
                zone);
   }
-  static WordType Set(const base::Vector<const word_t>& elements, Zone* zone) {
+  static WordType Set(base::Vector<const word_t> elements, Zone* zone) {
     DCHECK(detail::is_unique_and_sorted(elements));
     DCHECK_IMPLIES(elements.size() > kMaxInlineSetSize, zone != nullptr);
     DCHECK_GT(elements.size(), 0);
@@ -371,7 +389,7 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType : public Type {
     } else {
       // Allocate storage in the zone.
       Payload_OutlineSet p;
-      p.array = zone->NewArray<word_t>(elements.size());
+      p.array = zone->AllocateArray<word_t>(elements.size());
       DCHECK_NOT_NULL(p.array);
       for (size_t i = 0; i < elements.size(); ++i) p.array[i] = elements[i];
       return WordType{SubKind::kSet, static_cast<uint8_t>(elements.size()), p};
@@ -473,8 +491,11 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType : public Type {
       : Type(KIND, static_cast<uint8_t>(sub_kind), set_size, 0, 0, payload) {}
 };
 
+extern template class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType<32>;
+extern template class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType<64>;
+
 template <size_t Bits>
-class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType : public Type {
+class FloatType : public Type {
   static_assert(Bits == 32 || Bits == 64);
   friend class Type;
   static constexpr int kMaxInlineSetSize = 2;
@@ -526,7 +547,7 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType : public Type {
     DCHECK(!detail::is_float_special_value(min));
     DCHECK(!detail::is_float_special_value(max));
     DCHECK_LE(min, max);
-    if (min == max) return Set({min}, zone);
+    if (min == max) return Set({min}, special_values, zone);
     return FloatType{SubKind::kRange, 0, special_values,
                      Payload_Range{min, max}};
   }
@@ -554,7 +575,7 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType : public Type {
     return Set(base::Vector<const float_t>{elements.data(), elements.size()},
                special_values, zone);
   }
-  static FloatType Set(const base::Vector<const float_t>& elements,
+  static FloatType Set(base::Vector<const float_t> elements,
                        uint32_t special_values, Zone* zone) {
     DCHECK(detail::is_unique_and_sorted(elements));
     // NaN should be passed via {special_values} rather than {elements}.
@@ -578,7 +599,7 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType : public Type {
     } else {
       // Allocate storage in the zone.
       Payload_OutlineSet p;
-      p.array = zone->NewArray<float_t>(elements.size());
+      p.array = zone->AllocateArray<float_t>(elements.size());
       DCHECK_NOT_NULL(p.array);
       for (size_t i = 0; i < elements.size(); ++i) {
         p.array[i] = elements[i];
@@ -746,8 +767,11 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType : public Type {
     }
     return Special::kNoSpecialValues;
   }
-  static FloatType ReplacedSpecialValues(const FloatType& t,
-                                         uint32_t special_values) {
+  static Type ReplacedSpecialValues(const FloatType& t,
+                                    uint32_t special_values) {
+    if (special_values == 0 && t.is_only_special_values()) {
+      return FloatType::None();
+    }
     auto result = t;
     result.bitfield_ = special_values;
     DCHECK_EQ(result.bitfield_, result.special_values());
@@ -770,6 +794,9 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType : public Type {
   }
 };
 
+extern template class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType<32>;
+extern template class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType<64>;
+
 class TupleType : public Type {
  public:
   static constexpr int kMaxTupleSize = std::numeric_limits<uint8_t>::max();
@@ -778,17 +805,17 @@ class TupleType : public Type {
   static TupleType Tuple(const Type& element0, const Type& element1,
                          Zone* zone) {
     Payload p;
-    p.array = zone->NewArray<Type>(2);
+    p.array = zone->AllocateArray<Type>(2);
     DCHECK_NOT_NULL(p.array);
     p.array[0] = element0;
     p.array[1] = element1;
     return TupleType{2, p};
   }
 
-  static TupleType Tuple(const base::Vector<Type>& elements, Zone* zone) {
+  static TupleType Tuple(base::Vector<Type> elements, Zone* zone) {
     DCHECK_LE(elements.size(), kMaxTupleSize);
     Payload p;
-    p.array = zone->NewArray<Type>(elements.size());
+    p.array = zone->AllocateArray<Type>(elements.size());
     DCHECK_NOT_NULL(p.array);
     for (size_t i = 0; i < elements.size(); ++i) {
       p.array[i] = elements[i];
@@ -878,6 +905,10 @@ inline bool operator==(const Type& lhs, const Type& rhs) {
   return lhs.Equals(rhs);
 }
 
+inline bool operator!=(const Type& lhs, const Type& rhs) {
+  return !lhs.Equals(rhs);
+}
+
 template <>
 struct fast_hash<Type> {
   size_t operator()(const Type& v) const {
@@ -888,32 +919,6 @@ struct fast_hash<Type> {
   }
 };
 
-// The below exports of the explicitly instantiated template instances produce
-// build errors on v8_linux64_gcc_light_compile_dbg build with
-//
-// error: type attributes ignored after type is already defined
-// [-Werror=attributes] extern template class
-// EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType<32>;
-//
-// No combination of export macros seems to be able to resolve this issue
-// although they seem to work for other classes. A temporary workaround is to
-// disable this warning here locally.
-// TODO(nicohartmann@): Ideally, we would find a better solution than to disable
-// the warning.
-#if V8_CC_GNU
-#pragma GCC diagnostic push
-#pragma GCC diagnostic ignored "-Wattributes"
-#endif  // V8_CC_GNU
-
-extern template class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType<32>;
-extern template class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) WordType<64>;
-extern template class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType<32>;
-extern template class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) FloatType<64>;
-
-#if V8_CC_GNU
-#pragma GCC diagnostic pop
-#endif  // V8_CC_GNU
-
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_TYPES_H_
diff --git a/deps/v8/src/compiler/turboshaft/undef-assembler-macros.inc b/deps/v8/src/compiler/turboshaft/undef-assembler-macros.inc
index e133776754704a..b7e430df2c3b69 100644
--- a/deps/v8/src/compiler/turboshaft/undef-assembler-macros.inc
+++ b/deps/v8/src/compiler/turboshaft/undef-assembler-macros.inc
@@ -17,24 +17,16 @@
 #undef BIND
 #undef ELSE
 #undef ELSE_IF
-#undef ELSE_IF_LIKELY
-#undef ELSE_IF_UNLIKELY
-#undef ELSE_IF_WITH_HINT
 #undef END_IF
 #undef GOTO
 #undef GOTO_IF
-#undef GOTO_IF_LIKELY
 #undef GOTO_IF_NOT
-#undef GOTO_IF_NOT_LIKELY
-#undef GOTO_IF_NOT_UNLIKELY
-#undef GOTO_IF_UNLIKELY
 #undef IF
-#undef IF_LIKELY
-#undef IF_UNLIKELY
-#undef IF_WITH_HINT
 #undef IF_NOT
-#undef IF_NOT_LIKELY
-#undef IF_NOT_UNLIKELY
+#undef LIKLEY
 #undef LOOP
+#undef REDUCE
+#undef REDUCE_INPUT_GRAPH
+#undef UNLIKELY
 
 #undef V8_COMPILER_TURBOSHAFT_ASSEMBLER_MACROS_DEFINED
diff --git a/deps/v8/src/compiler/turboshaft/uniform-reducer-adapter.h b/deps/v8/src/compiler/turboshaft/uniform-reducer-adapter.h
index 10047bba166e13..b9f48e7aa2c5c3 100644
--- a/deps/v8/src/compiler/turboshaft/uniform-reducer-adapter.h
+++ b/deps/v8/src/compiler/turboshaft/uniform-reducer-adapter.h
@@ -22,10 +22,6 @@ namespace v8::internal::compiler::turboshaft {
 //   TURBOSHAFT_REDUCER_BOILERPLATE()
 //   using Adapter = UniformReducerAdapter<MyReducer, Next>;
 //
-//   template <typename... Args>
-//   explicit MyReducer(const std::tuple<Args...>& args)
-//       : Adapter(args) { /* ... */ }
-//
 //   OpIndex ReduceInputGraphConstant(OpIndex ig_index, const ConstantOp& op) {
 //     /* Handle ConstantOps separately */
 //     /* ... */
@@ -66,7 +62,7 @@ namespace v8::internal::compiler::turboshaft {
 //   /* ... */
 // };
 //
-// NOTICE: Inside the ReduceOperation and ReduceInputGraphOperation callbacks,
+// NOTICE: Inside the ReduceXyz and ReduceInputGraphXyz callbacks of MyReducer,
 // you need to make a choice:
 //
 //   A) Call Next::ReduceXyz (or Next::ReduceInputGraphXyz) to forward to the
@@ -113,10 +109,6 @@ namespace v8::internal::compiler::turboshaft {
 template <template <typename> typename Reducer, typename Next>
 class UniformReducerAdapter : public Next {
  public:
-  template <typename... Args>
-  explicit UniformReducerAdapter(const std::tuple<Args...>& args)
-      : Next(args) {}
-
   template <Opcode opcode, typename Continuation, typename... Args>
   OpIndex ReduceOperation(Args... args) {
     return Continuation{this}.Reduce(args...);
diff --git a/deps/v8/src/compiler/turboshaft/use-map.cc b/deps/v8/src/compiler/turboshaft/use-map.cc
new file mode 100644
index 00000000000000..b7a73e57398e2c
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/use-map.cc
@@ -0,0 +1,95 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/use-map.h"
+
+#include "src/compiler/turboshaft/graph.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+UseMap::UseMap(const Graph& graph, Zone* zone)
+    : table_(graph.op_id_count(), zone), uses_(zone), saturated_uses_(zone) {
+  std::vector<std::pair<OpIndex, OpIndex>> delayed_phi_uses;
+
+  // We preallocate for 2 uses per operation.
+  uses_.reserve(graph.op_id_count() * 2);
+
+  // We skip {offset:0} to use {offset == 0} as uninitialized.
+  uint32_t offset = 1;
+  for (uint32_t index = 0; index < graph.block_count(); ++index) {
+    BlockIndex block_index(index);
+    const Block& block = graph.Get(block_index);
+
+    auto block_ops = graph.OperationIndices(block);
+    for (OpIndex op_index : block_ops) {
+      const Operation& op = graph.Get(op_index);
+      // When we see a definition, we allocate space in the {uses_}.
+      DCHECK_EQ(table_[op_index].offset, 0);
+      DCHECK_EQ(table_[op_index].count, 0);
+
+      if (op.saturated_use_count.IsSaturated()) {
+        table_[op_index].offset =
+            -static_cast<int32_t>(saturated_uses_.size()) - 1;
+        saturated_uses_.emplace_back(zone);
+        saturated_uses_.back().reserve(std::numeric_limits<uint8_t>::max());
+      } else {
+        table_[op_index].offset = offset;
+        offset += op.saturated_use_count.Get();
+        uses_.resize(offset);
+      }
+
+      if (block.IsLoop()) {
+        if (op.Is<PhiOp>()) {
+          DCHECK_EQ(op.input_count, 2);
+          DCHECK_EQ(PhiOp::kLoopPhiBackEdgeIndex, 1);
+          AddUse(&graph, op.input(0), op_index);
+          // Delay back edge of loop Phis.
+          delayed_phi_uses.emplace_back(op.input(1), op_index);
+          continue;
+        }
+      }
+
+      // Add uses.
+      for (OpIndex input_index : op.inputs()) {
+        AddUse(&graph, input_index, op_index);
+      }
+    }
+  }
+
+  for (auto [input_index, op_index] : delayed_phi_uses) {
+    AddUse(&graph, input_index, op_index);
+  }
+}
+
+base::Vector<const OpIndex> UseMap::uses(OpIndex index) const {
+  DCHECK(index.valid());
+  int32_t offset = table_[index].offset;
+  uint32_t count = table_[index].count;
+  DCHECK_NE(offset, 0);
+  if (V8_LIKELY(offset > 0)) {
+    return base::Vector<const OpIndex>(uses_.data() + offset, count);
+  } else {
+    DCHECK_EQ(count, saturated_uses_[-offset - 1].size());
+    return base::Vector<const OpIndex>(saturated_uses_[-offset - 1].data(),
+                                       count);
+  }
+}
+
+void UseMap::AddUse(const Graph* graph, OpIndex node, OpIndex use) {
+  int32_t input_offset = table_[node].offset;
+  uint32_t& input_count = table_[node].count;
+  DCHECK_NE(input_offset, 0);
+  if (V8_LIKELY(input_offset > 0)) {
+    DCHECK_LT(input_count, graph->Get(node).saturated_use_count.Get());
+    DCHECK(!uses_[input_offset + input_count].valid());
+    uses_[input_offset + input_count] = use;
+  } else {
+    ZoneVector<OpIndex>& uses = saturated_uses_[-input_offset - 1];
+    DCHECK_EQ(uses.size(), input_count);
+    uses.emplace_back(use);
+  }
+  ++input_count;
+}
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/use-map.h b/deps/v8/src/compiler/turboshaft/use-map.h
new file mode 100644
index 00000000000000..599cd166d18061
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/use-map.h
@@ -0,0 +1,39 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_TURBOSHAFT_USE_MAP_H_
+#define V8_COMPILER_TURBOSHAFT_USE_MAP_H_
+
+#include "src/compiler/turboshaft/sidetable.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+// UseMap computes uses of all operations of the given turboshaft graph. It
+// provides a mapping from `OpIndex` to its `uses`.
+class UseMap {
+  struct PerOperationUses {
+    // We encode offsets as follows:
+    // offset < 0: -offset-1 indexes into {saturated_uses_}.
+    // offset = 0: definition not visited yet.
+    // offset > 0: offset indexes into {uses_}.
+    int32_t offset = 0;
+    uint32_t count = 0;
+  };
+
+ public:
+  UseMap(const Graph& graph, Zone* zone);
+
+  base::Vector<const OpIndex> uses(OpIndex index) const;
+
+ private:
+  void AddUse(const Graph* graph, OpIndex node, OpIndex use);
+
+  FixedSidetable<PerOperationUses> table_;
+  ZoneVector<OpIndex> uses_;
+  ZoneVector<ZoneVector<OpIndex>> saturated_uses_;
+};
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_USE_MAP_H_
diff --git a/deps/v8/src/compiler/turboshaft/utils.h b/deps/v8/src/compiler/turboshaft/utils.h
index 62711415b6bcd7..232c7a6dbd5b43 100644
--- a/deps/v8/src/compiler/turboshaft/utils.h
+++ b/deps/v8/src/compiler/turboshaft/utils.h
@@ -101,6 +101,83 @@ class ScopedModification {
   T old_value_;
 };
 
+// The `multi`-switch mechanism helps to switch on multiple values at the same
+// time. Example:
+//
+//   switch (multi(change.from, change.to)) {
+//     case multi(Word32(), Float32()): ...
+//     case multi(Word32(), Float64()): ...
+//     case multi(Word64(), Float32()): ...
+//     case multi(Word64(), Float64()): ...
+//     ...
+//   }
+//
+// This works for an arbitrary number of dimensions and arbitrary types as long
+// as they can be encoded into an integral value and their combination fits into
+// a uint64_t. For types to be used, they need to provide a specialization of
+// MultiSwitch<T> with this signature:
+//
+//   template<>
+//   struct MultiSwitch<T> {
+//     static constexpr uint64_t max_value = ...
+//     static constexpr uint64_t encode(T value) { ... }
+//   };
+//
+// For `max_value` choose a value that is larger than all encoded values. Choose
+// this as small as possible to make jump tables more dense. If a type's value
+// count is somewhat close to a multiple of two, consider using this, as this
+// might lead to slightly faster encoding. The encoding follows this formula:
+//
+//   multi(v1, v2, v3) =
+//     let t1 = MultiSwitch<T3>::encode(v3) in
+//     let t2 = (t1 * MultiSwitch<T2>::max_value)
+//              + MultiSwitch<T2>::encode(v2) in
+//     (t2 * MultiSwitch<T1>::max_value) + MultiSwitch<T1>::encode(v1)
+//
+// For integral types (like enums), use
+//
+//   DEFINE_MULTI_SWITCH_INTEGRAL(MyType, MaxValue)
+//
+template <typename T, typename Enable = void>
+struct MultiSwitch;
+
+template <typename T, uint64_t MaxValue>
+struct MultiSwitchIntegral {
+  static constexpr uint64_t max_value = MaxValue;
+  static constexpr uint64_t encode(T value) {
+    const uint64_t v = static_cast<uint64_t>(value);
+    DCHECK_LT(v, max_value);
+    return v;
+  }
+};
+
+#define DEFINE_MULTI_SWITCH_INTEGRAL(name, max_value) \
+  template <>                                         \
+  struct MultiSwitch<name> : MultiSwitchIntegral<name, max_value> {};
+
+namespace detail {
+template <typename T>
+constexpr uint64_t multi_encode(const T& value) {
+  return MultiSwitch<T>::encode(value);
+}
+
+template <typename Head, typename Next, typename... Rest>
+constexpr uint64_t multi_encode(const Head& head, const Next& next,
+                                const Rest&... rest) {
+  uint64_t v = multi_encode(next, rest...);
+  DCHECK_LT(
+      v, std::numeric_limits<uint64_t>::max() / MultiSwitch<Head>::max_value);
+  return (v * MultiSwitch<Head>::max_value) + MultiSwitch<Head>::encode(head);
+}
+}  // namespace detail
+
+template <typename... Ts>
+inline constexpr uint64_t multi(const Ts&... values) {
+  return detail::multi_encode(values...);
+}
+
+DEFINE_MULTI_SWITCH_INTEGRAL(bool, 2)
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_UTILS_H_
diff --git a/deps/v8/src/compiler/turboshaft/value-numbering-reducer.h b/deps/v8/src/compiler/turboshaft/value-numbering-reducer.h
index f2667f8e80a0cd..864d6022cc7619 100644
--- a/deps/v8/src/compiler/turboshaft/value-numbering-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/value-numbering-reducer.h
@@ -11,6 +11,7 @@
 #include "src/compiler/turboshaft/fast-hash.h"
 #include "src/compiler/turboshaft/graph.h"
 #include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/turboshaft/reducer-traits.h"
 #include "src/utils/utils.h"
 #include "src/zone/zone-containers.h"
 
@@ -68,32 +69,31 @@ namespace turboshaft {
 // in the linked list, setting all of their `hash` field to 0 (we prevent hashes
 // from being equal to 0, in order to detect empty entries: their hash is 0).
 
+template <class Next>
+class TypeInferenceReducer;
+
 template <class Next>
 class ValueNumberingReducer : public Next {
+#if defined(__clang__)
+  static_assert(next_is_bottom_of_assembler_stack<Next>::value ||
+                next_reducer_is<Next, TypeInferenceReducer>::value);
+#endif
+
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
-  template <class... Args>
-  explicit ValueNumberingReducer(const std::tuple<Args...>& args)
-      : Next(args),
-        dominator_path_(Asm().phase_zone()),
-        depths_heads_(Asm().phase_zone()) {
-    table_ = Asm().phase_zone()->template NewVector<Entry>(
-        base::bits::RoundUpToPowerOfTwo(
-            std::max<size_t>(128, Asm().input_graph().op_id_capacity() / 2)),
-        Entry());
-    entry_count_ = 0;
-    mask_ = table_.size() - 1;
-  }
-
-#define EMIT_OP(Name)                                                 \
-  template <class... Args>                                            \
-  OpIndex Reduce##Name(Args... args) {                                \
-    OpIndex next_index = Asm().output_graph().next_operation_index(); \
-    USE(next_index);                                                  \
-    OpIndex result = Next::Reduce##Name(args...);                     \
-    DCHECK_EQ(next_index, result);                                    \
-    return AddOrFind<Name##Op>(result);                               \
+#define EMIT_OP(Name)                                                      \
+  template <class... Args>                                                 \
+  OpIndex Reduce##Name(Args... args) {                                     \
+    OpIndex next_index = Asm().output_graph().next_operation_index();      \
+    USE(next_index);                                                       \
+    OpIndex result = Next::Reduce##Name(args...);                          \
+    if (ShouldSkipOptimizationStep()) return result;                       \
+    /* Throwing operations have a non-trivial lowering, so they don't work \
+     * with value numbering. */                                            \
+    if constexpr (MayThrow(Opcode::k##Name)) return result;                \
+    DCHECK_EQ(next_index, result);                                         \
+    return AddOrFind<Name##Op>(result);                                    \
   }
   TURBOSHAFT_OPERATION_LIST(EMIT_OP)
 #undef EMIT_OP
@@ -136,8 +136,11 @@ class ValueNumberingReducer : public Next {
   template <class Op>
   OpIndex AddOrFind(OpIndex op_idx) {
     const Op& op = Asm().output_graph().Get(op_idx).template Cast<Op>();
-    if (std::is_same<Op, PendingLoopPhiOp>::value ||
-        !op.Properties().can_be_eliminated) {
+    if (std::is_same_v<Op, PendingLoopPhiOp> || op.IsBlockTerminator() ||
+        (!op.Effects().repetition_is_eliminatable() &&
+         !std::is_same_v<Op, DeoptimizeIfOp>)) {
+      // GVNing DeoptimizeIf is safe, despite its lack of
+      // repetition_is_eliminatable.
       return op_idx;
     }
     RehashIfNeeded();
@@ -160,7 +163,7 @@ class ValueNumberingReducer : public Next {
         if (entry_op.Is<Op>() &&
             (!same_block_only ||
              entry.block == Asm().current_block()->index()) &&
-            entry_op.Cast<Op>() == op) {
+            entry_op.Cast<Op>().EqualsForGVN(op)) {
           Next::RemoveLast(op_idx);
           return entry.value;
         }
@@ -187,8 +190,7 @@ class ValueNumberingReducer : public Next {
   void RehashIfNeeded() {
     if (V8_LIKELY(table_.size() - (table_.size() / 4) > entry_count_)) return;
     base::Vector<Entry> new_table = table_ =
-        Asm().phase_zone()->template NewVector<Entry>(table_.size() * 2,
-                                                      Entry());
+        Asm().phase_zone()->template NewVector<Entry>(table_.size() * 2);
     size_t mask = mask_ = table_.size() - 1;
 
     for (size_t depth_idx = 0; depth_idx < depths_heads_.size(); depth_idx++) {
@@ -260,11 +262,13 @@ class ValueNumberingReducer : public Next {
     return V8_LIKELY(entry > table_.begin()) ? entry - 1 : table_.end() - 1;
   }
 
-  ZoneVector<Block*> dominator_path_;
-  base::Vector<Entry> table_;
-  size_t mask_;
-  size_t entry_count_;
-  ZoneVector<Entry*> depths_heads_;
+  ZoneVector<Block*> dominator_path_{Asm().phase_zone()};
+  base::Vector<Entry> table_ = Asm().phase_zone()->template NewVector<Entry>(
+      base::bits::RoundUpToPowerOfTwo(
+          std::max<size_t>(128, Asm().input_graph().op_id_capacity() / 2)));
+  size_t mask_ = table_.size() - 1;
+  size_t entry_count_ = 0;
+  ZoneVector<Entry*> depths_heads_{Asm().phase_zone()};
 };
 
 }  // namespace turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/variable-reducer.h b/deps/v8/src/compiler/turboshaft/variable-reducer.h
index a5b26207500ca8..7a3691d872fdb2 100644
--- a/deps/v8/src/compiler/turboshaft/variable-reducer.h
+++ b/deps/v8/src/compiler/turboshaft/variable-reducer.h
@@ -13,11 +13,14 @@
 #include "src/compiler/turboshaft/graph.h"
 #include "src/compiler/turboshaft/operations.h"
 #include "src/compiler/turboshaft/representations.h"
+#include "src/compiler/turboshaft/required-optimization-reducer.h"
 #include "src/compiler/turboshaft/snapshot-table.h"
 #include "src/zone/zone-containers.h"
 
 namespace v8::internal::compiler::turboshaft {
 
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
 // When cloning a Block or duplicating an Operation, we end up with some
 // Operations of the old graph mapping to multiple Operations in the new graph.
 // When using those Operations in subsequent Operations, we need to know which
@@ -27,8 +30,10 @@ namespace v8::internal::compiler::turboshaft {
 //
 // The typical workflow when working with the VariableAssembler would be:
 //    - At some point, you need to introduce a Variable (for instance
-//      because you cloned a block or an Operation) and call NewFreshVariable to
-//      get a fresh Variable.
+//      because you cloned a block or an Operation) and call NewVariable or
+//      NewLoopInvariantVariable to get a fresh Variable. A loop invariant
+//      variable must not need loop phis, that is, not change its value
+//      depending on loop iteration while being visible across loop iterations.
 //    - You can then Set the new-OpIndex associated with this Variable in the
 //      current Block with the Set method.
 //    - If you later need to set an OpIndex for this Variable in another Block,
@@ -46,24 +51,48 @@ namespace v8::internal::compiler::turboshaft {
 // book-keeping: the users of the Variable should do that themselves (which
 // is what OptimizationPhase does for instance).
 
-using Variable =
-    SnapshotTable<OpIndex, base::Optional<RegisterRepresentation>>::Key;
-
 template <class Next>
 class VariableReducer : public Next {
-  using Snapshot =
-      SnapshotTable<OpIndex, base::Optional<RegisterRepresentation>>::Snapshot;
+  using Snapshot = SnapshotTable<OpIndex, VariableData>::Snapshot;
+
+  struct GetActiveLoopVariablesIndex {
+    IntrusiveSetIndex& operator()(Variable var) const {
+      return var.data().active_loop_variables_index;
+    }
+  };
+
+  struct VariableTable
+      : ChangeTrackingSnapshotTable<VariableTable, OpIndex, VariableData> {
+    explicit VariableTable(Zone* zone)
+        : ChangeTrackingSnapshotTable<VariableTable, OpIndex, VariableData>(
+              zone),
+          active_loop_variables(zone) {}
+
+    ZoneIntrusiveSet<Variable, GetActiveLoopVariablesIndex>
+        active_loop_variables;
+
+    void OnNewKey(Variable var, OpIndex value) { DCHECK(!value.valid()); }
+    void OnValueChange(Variable var, OpIndex old_value, OpIndex new_value) {
+      if (var.data().loop_invariant) {
+        return;
+      }
+      if (old_value.valid() && !new_value.valid()) {
+        active_loop_variables.Remove(var);
+      } else if (!old_value.valid() && new_value.valid()) {
+        active_loop_variables.Add(var);
+      }
+    }
+  };
 
  public:
   TURBOSHAFT_REDUCER_BOILERPLATE()
 
-  template <class... Args>
-  explicit VariableReducer(const std::tuple<Args...>& args)
-      : Next(args),
-        table_(Asm().phase_zone()),
-        block_to_snapshot_mapping_(Asm().input_graph().block_count(),
-                                   base::nullopt, Asm().phase_zone()),
-        predecessors_(Asm().phase_zone()) {}
+#if defined(__clang__)
+  // Phis with constant inputs introduced by `VariableReducer` need to be
+  // eliminated.
+  static_assert(
+      reducer_list_contains<ReducerList, RequiredOptimizationReducer>::value);
+#endif
 
   void Bind(Block* new_block) {
     Next::Bind(new_block);
@@ -73,81 +102,103 @@ class VariableReducer : public Next {
     predecessors_.clear();
     for (const Block* pred = new_block->LastPredecessor(); pred != nullptr;
          pred = pred->NeighboringPredecessor()) {
-      DCHECK_LT(pred->index().id(), block_to_snapshot_mapping_.size());
       base::Optional<Snapshot> pred_snapshot =
-          block_to_snapshot_mapping_[pred->index().id()];
+          block_to_snapshot_mapping_[pred->index()];
       DCHECK(pred_snapshot.has_value());
       predecessors_.push_back(pred_snapshot.value());
     }
     std::reverse(predecessors_.begin(), predecessors_.end());
 
-    auto merge_variables = [&](Variable var,
-                               base::Vector<OpIndex> predecessors) -> OpIndex {
-      ConstantOp* first_constant = nullptr;
-      if (predecessors[0].valid()) {
-        first_constant = Asm()
-                             .output_graph()
-                             .Get(predecessors[0])
-                             .template TryCast<ConstantOp>();
-      }
-      bool all_are_same_constant = first_constant != nullptr;
-
+    auto merge_variables =
+        [&](Variable var, base::Vector<const OpIndex> predecessors) -> OpIndex {
       for (OpIndex idx : predecessors) {
         if (!idx.valid()) {
           // If any of the predecessors' value is Invalid, then we shouldn't
           // merge {var}.
           return OpIndex::Invalid();
         }
-        if (all_are_same_constant) {
-          if (ConstantOp* other_constant =
-                  Asm()
-                      .output_graph()
-                      .Get(idx)
-                      .template TryCast<ConstantOp>()) {
-            all_are_same_constant = *first_constant == *other_constant;
-          } else {
-            all_are_same_constant = false;
-          }
-        }
-      }
-
-      if (all_are_same_constant) {
-        // If all of the predecessors are the same Constant, then we re-emit
-        // this Constant rather than emitting a Phi. This is a good idea in
-        // general, but is in particular needed for Constant that are used as
-        // call target: if they were merged into a Phi, this would result in an
-        // indirect call rather than a direct one, which:
-        //   - is probably slower than a direct call in general
-        //   - is probably not supported for builtins on 32-bit architectures.
-        return Asm().ReduceConstant(first_constant->kind,
-                                    first_constant->storage);
       }
-      return MergeOpIndices(predecessors, var.data());
+      return MergeOpIndices(predecessors, var.data().rep);
     };
 
     table_.StartNewSnapshot(base::VectorOf(predecessors_), merge_variables);
     current_block_ = new_block;
+    if (new_block->IsLoop()) {
+      for (Variable var : table_.active_loop_variables) {
+        MaybeRegisterRepresentation rep = var.data().rep;
+        DCHECK_NE(rep, MaybeRegisterRepresentation::None());
+        table_.Set(var, __ PendingLoopPhi(table_.Get(var),
+                                          RegisterRepresentation(rep)));
+      }
+      Snapshot loop_header_snapshot = table_.Seal();
+      block_to_snapshot_mapping_[new_block->LastPredecessor()->index()] =
+          loop_header_snapshot;
+      table_.StartNewSnapshot(loop_header_snapshot);
+    }
   }
 
-  OpIndex Get(Variable var) { return table_.Get(var); }
+  OpIndex REDUCE(Goto)(Block* destination) {
+    OpIndex result = Next::ReduceGoto(destination);
+    if (!destination->IsBound()) {
+      return result;
+    }
+    DCHECK(destination->IsLoop());
+    DCHECK(destination->HasExactlyNPredecessors(2));
+    Snapshot loop_header_snapshot =
+        *block_to_snapshot_mapping_
+            [destination->LastPredecessor()->NeighboringPredecessor()->index()];
+    Snapshot backedge_snapshot = table_.Seal();
+    block_to_snapshot_mapping_[current_block_->index()] = backedge_snapshot;
+    auto fix_loop_phis =
+        [&](Variable var, base::Vector<const OpIndex> predecessors) -> OpIndex {
+      if (var.data().loop_invariant) {
+        return predecessors[0];
+      }
+      const OpIndex backedge_value = predecessors[1];
+      if (!backedge_value.valid()) {
+        return OpIndex::Invalid();
+      }
+      const PendingLoopPhiOp& pending_phi =
+          __ Get(predecessors[0]).template Cast<PendingLoopPhiOp>();
+      __ output_graph().template Replace<PhiOp>(
+          predecessors[0],
+          base::VectorOf({pending_phi.first(), backedge_value}),
+          pending_phi.rep);
+      return predecessors[0];
+    };
+
+    table_.StartNewSnapshot(
+        base::VectorOf({loop_header_snapshot, backedge_snapshot}),
+        fix_loop_phis);
+    // We throw away this snapshot.
+    table_.Seal();
+    current_block_ = nullptr;
+
+    return result;
+  }
+
+  OpIndex GetVariable(Variable var) { return table_.Get(var); }
 
   OpIndex GetPredecessorValue(Variable var, int predecessor_index) {
     return table_.GetPredecessorValue(var, predecessor_index);
   }
 
-  void Set(Variable var, OpIndex new_index) {
-    if (V8_UNLIKELY(Asm().generating_unreachable_operations())) return;
+  void SetVariable(Variable var, OpIndex new_index) {
+    if (V8_UNLIKELY(__ generating_unreachable_operations())) return;
     table_.Set(var, new_index);
   }
   template <typename Rep>
   void Set(Variable var, V<Rep> value) {
-    if (V8_UNLIKELY(Asm().generating_unreachable_operations())) return;
-    DCHECK(Rep::allows_representation(*var.data()));
+    if (V8_UNLIKELY(__ generating_unreachable_operations())) return;
+    DCHECK(Rep::allows_representation(RegisterRepresentation(var.data().rep)));
     table_.Set(var, value);
   }
 
-  Variable NewFreshVariable(base::Optional<RegisterRepresentation> rep) {
-    return table_.NewKey(rep, OpIndex::Invalid());
+  Variable NewLoopInvariantVariable(MaybeRegisterRepresentation rep) {
+    return table_.NewKey(VariableData{rep, true}, OpIndex::Invalid());
+  }
+  Variable NewVariable(MaybeRegisterRepresentation rep) {
+    return table_.NewKey(VariableData{rep, false}, OpIndex::Invalid());
   }
 
  private:
@@ -160,79 +211,30 @@ class VariableReducer : public Next {
     }
 
     DCHECK_NOT_NULL(current_block_);
-    Snapshot snapshot = table_.Seal();
-
-    DCHECK(current_block_->index().valid());
-    size_t id = current_block_->index().id();
-    if (id >= block_to_snapshot_mapping_.size()) {
-      // The table initially contains as many entries as blocks in the input
-      // graphs. In most cases, the number of blocks between input and ouput
-      // graphs shouldn't grow too much, so a growth factor of 1.5 should be
-      // reasonable.
-      static constexpr double kGrowthFactor = 1.5;
-      size_t new_size = std::max<size_t>(
-          id, kGrowthFactor * block_to_snapshot_mapping_.size());
-      block_to_snapshot_mapping_.resize(new_size);
-    }
-
-    block_to_snapshot_mapping_[id] = snapshot;
+    block_to_snapshot_mapping_[current_block_->index()] = table_.Seal();
     current_block_ = nullptr;
   }
 
-  OpIndex MergeOpIndices(base::Vector<OpIndex> inputs,
-                         base::Optional<RegisterRepresentation> maybe_rep) {
-    if (maybe_rep.has_value()) {
+  OpIndex MergeOpIndices(base::Vector<const OpIndex> inputs,
+                         MaybeRegisterRepresentation maybe_rep) {
+    if (maybe_rep != MaybeRegisterRepresentation::None()) {
       // Every Operation that has a RegisterRepresentation can be merged with a
       // simple Phi.
-      return Asm().Phi(base::VectorOf(inputs), maybe_rep.value());
+      return __ Phi(base::VectorOf(inputs), RegisterRepresentation(maybe_rep));
+    } else if (__ output_graph().Get(inputs[0]).template Is<FrameStateOp>()) {
+      // Frame states need be be merged recursively, because they represent
+      // multiple scalar values that will lead to multiple phi nodes.
+      return MergeFrameState(inputs);
     } else {
-      switch (Asm().output_graph().Get(inputs[0]).opcode) {
-        case Opcode::kStackPointerGreaterThan:
-          return Asm().Phi(base::VectorOf(inputs),
-                           RegisterRepresentation::Word32());
-        case Opcode::kFrameConstant:
-          return Asm().Phi(base::VectorOf(inputs),
-                           RegisterRepresentation::PointerSized());
-
-        case Opcode::kFrameState:
-          // Merging inputs of the n kFrameState one by one.
-          return MergeFrameState(inputs);
-
-        case Opcode::kOverflowCheckedBinop:
-        case Opcode::kFloat64InsertWord32:
-        case Opcode::kStore:
-        case Opcode::kRetain:
-        case Opcode::kStackSlot:
-        case Opcode::kDeoptimize:
-        case Opcode::kDeoptimizeIf:
-        case Opcode::kTrapIf:
-        case Opcode::kParameter:
-        case Opcode::kOsrValue:
-        case Opcode::kCall:
-        case Opcode::kTailCall:
-        case Opcode::kUnreachable:
-        case Opcode::kReturn:
-        case Opcode::kGoto:
-        case Opcode::kBranch:
-        case Opcode::kSwitch:
-        case Opcode::kTuple:
-        case Opcode::kProjection:
-        case Opcode::kSelect:
-          return OpIndex::Invalid();
-
-        default:
-          // In all other cases, {maybe_rep} should have a value and we
-          // shouldn't end up here.
-          UNREACHABLE();
-      }
+      return OpIndex::Invalid();
     }
   }
 
-  OpIndex MergeFrameState(base::Vector<OpIndex> frame_states_indices) {
+  OpIndex MergeFrameState(base::Vector<const OpIndex> frame_states_indices) {
     base::SmallVector<const FrameStateOp*, 32> frame_states;
     for (OpIndex idx : frame_states_indices) {
       frame_states.push_back(
-          &Asm().output_graph().Get(idx).template Cast<FrameStateOp>());
+          &__ output_graph().Get(idx).template Cast<FrameStateOp>());
     }
     const FrameStateOp* first_frame = frame_states[0];
 
@@ -250,7 +252,7 @@ class VariableReducer : public Next {
 
     // Merging the parent frame states.
     if (first_frame->inlined) {
-      ZoneVector<OpIndex> indices_to_merge(Asm().phase_zone());
+      ZoneVector<OpIndex> indices_to_merge(__ phase_zone());
       bool all_parent_frame_states_are_the_same = true;
       for (auto frame_state : frame_states) {
         indices_to_merge.push_back(frame_state->parent_frame_state());
@@ -270,7 +272,7 @@ class VariableReducer : public Next {
 
     // Merging the state values.
     for (int i = 0; i < first_frame->state_values_count(); i++) {
-      ZoneVector<OpIndex> indices_to_merge(Asm().phase_zone());
+      ZoneVector<OpIndex> indices_to_merge(__ phase_zone());
       bool all_inputs_are_the_same = true;
       for (auto frame_state : frame_states) {
         indices_to_merge.push_back(frame_state->state_value(i));
@@ -290,19 +292,22 @@ class VariableReducer : public Next {
       }
     }
 
-    return Asm().FrameState(base::VectorOf(new_inputs), first_frame->inlined,
-                            first_frame->data);
+    return __ FrameState(base::VectorOf(new_inputs), first_frame->inlined,
+                         first_frame->data);
   }
 
-  SnapshotTable<OpIndex, base::Optional<RegisterRepresentation>> table_;
+  VariableTable table_{__ phase_zone()};
   const Block* current_block_ = nullptr;
-  ZoneVector<base::Optional<Snapshot>> block_to_snapshot_mapping_;
+  GrowingBlockSidetable<base::Optional<Snapshot>> block_to_snapshot_mapping_{
+      __ input_graph().block_count(), base::nullopt, __ phase_zone()};
 
   // {predecessors_} is used during merging, but we use an instance variable for
   // it, in order to save memory and not reallocate it for each merge.
-  ZoneVector<Snapshot> predecessors_;
+  ZoneVector<Snapshot> predecessors_{__ phase_zone()};
 };
 
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
 }  // namespace v8::internal::compiler::turboshaft
 
 #endif  // V8_COMPILER_TURBOSHAFT_VARIABLE_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/wasm-js-lowering-reducer.h b/deps/v8/src/compiler/turboshaft/wasm-js-lowering-reducer.h
new file mode 100644
index 00000000000000..5c39937c8b830e
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/wasm-js-lowering-reducer.h
@@ -0,0 +1,89 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#ifndef V8_COMPILER_TURBOSHAFT_WASM_JS_LOWERING_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_WASM_JS_LOWERING_REDUCER_H_
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/compiler/wasm-graph-assembler.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+// This reducer is part of the JavaScript pipeline and contains lowering of
+// wasm nodes (from inlined wasm functions).
+//
+// The reducer replaces all TrapIf nodes with a conditional goto to deferred
+// code containing a call to the trap builtin.
+template <class Next>
+class WasmJSLoweringReducer : public Next {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  OpIndex REDUCE(TrapIf)(OpIndex condition, OpIndex frame_state, bool negated,
+                         TrapId trap_id) {
+    // All TrapIf nodes in JS need to have a FrameState.
+    DCHECK(frame_state.valid());
+    Builtin trap = wasm::RuntimeStubIdToBuiltinName(
+        static_cast<wasm::WasmCode::RuntimeStubId>(trap_id));
+    // The call is not marked as Operator::kNoDeopt. While it cannot actually
+    // deopt, deopt info based on the provided FrameState is required for stack
+    // trace creation of the wasm trap.
+    const bool needs_frame_state = true;
+    const CallDescriptor* tf_descriptor = GetBuiltinCallDescriptor(
+        trap, Asm().graph_zone(), StubCallMode::kCallBuiltinPointer,
+        needs_frame_state, Operator::kNoProperties);
+    const TSCallDescriptor* ts_descriptor = TSCallDescriptor::Create(
+        tf_descriptor, CanThrow::kYes, Asm().graph_zone());
+
+    OpIndex new_frame_state = CreateFrameStateWithUpdatedBailoutId(frame_state);
+    OpIndex should_trap = negated ? __ Word32Equal(condition, 0) : condition;
+    IF (UNLIKELY(should_trap)) {
+      OpIndex call_target = __ NumberConstant(static_cast<int>(trap));
+      __ Call(call_target, new_frame_state, {}, ts_descriptor);
+      __ Unreachable();  // The trap builtin never returns.
+    }
+    END_IF
+    return OpIndex::Invalid();
+  }
+
+ private:
+  OpIndex CreateFrameStateWithUpdatedBailoutId(OpIndex frame_state) {
+    // Create new FrameState with the correct source position (the position of
+    // the trap location).
+    const FrameStateOp& frame_state_op =
+        Asm().output_graph().Get(frame_state).template Cast<FrameStateOp>();
+    const FrameStateData* data = frame_state_op.data;
+    const FrameStateInfo& info = data->frame_state_info;
+
+    OpIndex origin = Asm().current_operation_origin();
+    DCHECK(origin.valid());
+    int offset = __ input_graph().source_positions()[origin].ScriptOffset();
+
+    const FrameStateInfo* new_info =
+        Asm().graph_zone()->template New<FrameStateInfo>(
+            BytecodeOffset(offset), info.state_combine(), info.function_info());
+    FrameStateData* new_data = Asm().graph_zone()->template New<FrameStateData>(
+        FrameStateData{*new_info, data->instructions, data->machine_types,
+                       data->int_operands});
+    return __ FrameState(frame_state_op.inputs(), frame_state_op.inlined,
+                         new_data);
+  }
+
+  Isolate* isolate_ = PipelineData::Get().isolate();
+  SourcePositionTable* source_positions_ =
+      PipelineData::Get().source_positions();
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_WASM_JS_LOWERING_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/wasm-lowering-reducer.h b/deps/v8/src/compiler/turboshaft/wasm-lowering-reducer.h
new file mode 100644
index 00000000000000..d745d10900188f
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/wasm-lowering-reducer.h
@@ -0,0 +1,661 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#ifndef V8_COMPILER_TURBOSHAFT_WASM_LOWERING_REDUCER_H_
+#define V8_COMPILER_TURBOSHAFT_WASM_LOWERING_REDUCER_H_
+
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/index.h"
+#include "src/compiler/turboshaft/operations.h"
+#include "src/wasm/wasm-engine.h"
+#include "src/wasm/wasm-module.h"
+#include "src/wasm/wasm-objects.h"
+#include "src/wasm/wasm-subtyping.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+#define LOAD_INSTANCE_FIELD(instance_node, name, representation)     \
+  __ Load(instance_node, LoadOp::Kind::TaggedBase(), representation, \
+          WasmInstanceObject::k##name##Offset);
+
+template <class Next>
+class WasmLoweringReducer : public Next {
+ public:
+  TURBOSHAFT_REDUCER_BOILERPLATE()
+
+  OpIndex REDUCE(GlobalGet)(OpIndex instance, const wasm::WasmGlobal* global) {
+    return LowerGlobalSetOrGet(instance, OpIndex::Invalid(), global,
+                               GlobalMode::kLoad);
+  }
+
+  OpIndex REDUCE(GlobalSet)(OpIndex instance, OpIndex value,
+                            const wasm::WasmGlobal* global) {
+    return LowerGlobalSetOrGet(instance, value, global, GlobalMode::kStore);
+  }
+
+  OpIndex REDUCE(Null)(wasm::ValueType type) { return Null(type); }
+
+  OpIndex REDUCE(IsNull)(OpIndex object, wasm::ValueType type) {
+    // TODO(14108): Can this be done simpler for static-roots nowadays?
+    Tagged_t static_null =
+        wasm::GetWasmEngine()->compressed_wasm_null_value_or_zero();
+    OpIndex null_value =
+        !wasm::IsSubtypeOf(type, wasm::kWasmExternRef, module_) &&
+                static_null != 0
+            ? __ UintPtrConstant(static_null)
+            : Null(type);
+    return __ TaggedEqual(object, null_value);
+  }
+
+  OpIndex REDUCE(AssertNotNull)(OpIndex object, wasm::ValueType type,
+                                TrapId trap_id) {
+    if (trap_id == TrapId::kTrapNullDereference) {
+      // Skip the check altogether if null checks are turned off.
+      if (!v8_flags.experimental_wasm_skip_null_checks) {
+        // Use an explicit null check if
+        // (1) we cannot use trap handler or
+        // (2) the object might be a Smi or
+        // (3) the object might be a JS object.
+        if (null_check_strategy_ == NullCheckStrategy::kExplicit ||
+            wasm::IsSubtypeOf(wasm::kWasmI31Ref.AsNonNull(), type, module_) ||
+            wasm::IsSubtypeOf(type, wasm::kWasmExternRef, module_)) {
+          __ TrapIf(__ IsNull(object, type), OpIndex::Invalid(), trap_id);
+        } else {
+          // Otherwise, load the word after the map word.
+          static_assert(WasmStruct::kHeaderSize > kTaggedSize);
+          static_assert(WasmArray::kHeaderSize > kTaggedSize);
+          static_assert(WasmInternalFunction::kHeaderSize > kTaggedSize);
+          __ Load(object, LoadOp::Kind::TrapOnNull(),
+                  MemoryRepresentation::Int32(), kTaggedSize);
+        }
+      }
+    } else {
+      __ TrapIf(__ IsNull(object, type), OpIndex::Invalid(), trap_id);
+    }
+    return object;
+  }
+
+  OpIndex REDUCE(RttCanon)(OpIndex instance, uint32_t type_index) {
+    OpIndex maps_list = LOAD_INSTANCE_FIELD(
+        instance, ManagedObjectMaps, MemoryRepresentation::TaggedPointer());
+    int map_offset = FixedArray::kHeaderSize + type_index * kTaggedSize;
+    return __ Load(maps_list, LoadOp::Kind::TaggedBase(),
+                   MemoryRepresentation::AnyTagged(), map_offset);
+  }
+
+  OpIndex REDUCE(WasmTypeCheck)(V<Tagged> object, V<Tagged> rtt,
+                                WasmTypeCheckConfig config) {
+    if (rtt != OpIndex::Invalid()) {
+      return ReduceWasmTypeCheckRtt(object, rtt, config);
+    } else {
+      return ReduceWasmTypeCheckAbstract(object, config);
+    }
+  }
+
+  OpIndex REDUCE(WasmTypeCast)(V<Tagged> object, V<Tagged> rtt,
+                               WasmTypeCheckConfig config) {
+    if (rtt != OpIndex::Invalid()) {
+      return ReduceWasmTypeCastRtt(object, rtt, config);
+    } else {
+      return ReduceWasmTypeCastAbstract(object, config);
+    }
+  }
+
+  OpIndex REDUCE(StructGet)(OpIndex object, const wasm::StructType* type,
+                            int field_index, bool is_signed,
+                            CheckForNull null_check) {
+    auto [explicit_null_check, implicit_null_check] =
+        null_checks_for_struct_op(null_check, field_index);
+
+    if (explicit_null_check) {
+      __ TrapIf(__ IsNull(object, wasm::kWasmAnyRef), OpIndex::Invalid(),
+                TrapId::kTrapNullDereference);
+    }
+
+    LoadOp::Kind load_kind = implicit_null_check ? LoadOp::Kind::TrapOnNull()
+                                                 : LoadOp::Kind::TaggedBase();
+    MemoryRepresentation repr =
+        RepresentationFor(type->field(field_index), is_signed);
+
+    return __ Load(object, load_kind, repr, field_offset(type, field_index));
+  }
+
+  OpIndex REDUCE(StructSet)(OpIndex object, OpIndex value,
+                            const wasm::StructType* type, int field_index,
+                            CheckForNull null_check) {
+    auto [explicit_null_check, implicit_null_check] =
+        null_checks_for_struct_op(null_check, field_index);
+
+    if (explicit_null_check) {
+      __ TrapIf(__ IsNull(object, wasm::kWasmAnyRef), OpIndex::Invalid(),
+                TrapId::kTrapNullDereference);
+    }
+
+    StoreOp::Kind store_kind = implicit_null_check
+                                   ? StoreOp::Kind::TrapOnNull()
+                                   : StoreOp::Kind::TaggedBase();
+    MemoryRepresentation repr =
+        RepresentationFor(type->field(field_index), true);
+
+    __ Store(object, value, store_kind, repr,
+             type->field(field_index).is_reference() ? kFullWriteBarrier
+                                                     : kNoWriteBarrier,
+             field_offset(type, field_index));
+
+    return OpIndex::Invalid();
+  }
+
+  OpIndex REDUCE(ArrayGet)(OpIndex array, OpIndex index,
+                           wasm::ValueType element_type, bool is_signed) {
+    return __ Load(array, __ ChangeInt32ToIntPtr(index),
+                   LoadOp::Kind::TaggedBase(),
+                   RepresentationFor(element_type, is_signed),
+                   WasmArray::kHeaderSize, element_type.value_kind_size_log2());
+  }
+
+  OpIndex REDUCE(ArraySet)(OpIndex array, OpIndex index, OpIndex value,
+                           wasm::ValueType element_type) {
+    __ Store(array, __ ChangeInt32ToIntPtr(index), value,
+             LoadOp::Kind::TaggedBase(), RepresentationFor(element_type, true),
+             element_type.is_reference() ? kFullWriteBarrier : kNoWriteBarrier,
+             WasmArray::kHeaderSize, element_type.value_kind_size_log2());
+    return OpIndex::Invalid();
+  }
+
+  OpIndex REDUCE(ArrayLength)(OpIndex array, CheckForNull null_check) {
+    bool explicit_null_check =
+        null_check == kWithNullCheck &&
+        null_check_strategy_ == NullCheckStrategy::kExplicit;
+    bool implicit_null_check =
+        null_check == kWithNullCheck &&
+        null_check_strategy_ == NullCheckStrategy::kTrapHandler;
+
+    if (explicit_null_check) {
+      __ TrapIf(__ IsNull(array, wasm::kWasmAnyRef), OpIndex::Invalid(),
+                TrapId::kTrapNullDereference);
+    }
+
+    LoadOp::Kind load_kind = implicit_null_check ? LoadOp::Kind::TrapOnNull()
+                                                 : LoadOp::Kind::TaggedBase();
+
+    return __ Load(array, load_kind, RepresentationFor(wasm::kWasmI32, true),
+                   WasmArray::kLengthOffset);
+  }
+
+ private:
+  enum class GlobalMode { kLoad, kStore };
+
+  static constexpr MemoryRepresentation kMaybeSandboxedPointer =
+      V8_ENABLE_SANDBOX_BOOL ? MemoryRepresentation::SandboxedPointer()
+                             : MemoryRepresentation::PointerSized();
+
+  MemoryRepresentation RepresentationFor(wasm::ValueType type, bool is_signed) {
+    switch (type.kind()) {
+      case wasm::kI8:
+        return is_signed ? MemoryRepresentation::Int8()
+                         : MemoryRepresentation::Uint8();
+      case wasm::kI16:
+        return is_signed ? MemoryRepresentation::Int16()
+                         : MemoryRepresentation::Uint16();
+      case wasm::kI32:
+        return is_signed ? MemoryRepresentation::Int32()
+                         : MemoryRepresentation::Uint32();
+      case wasm::kI64:
+        return is_signed ? MemoryRepresentation::Int64()
+                         : MemoryRepresentation::Uint64();
+      case wasm::kF32:
+        return MemoryRepresentation::Float32();
+      case wasm::kF64:
+        return MemoryRepresentation::Float64();
+      case wasm::kS128:
+        return MemoryRepresentation::Simd128();
+      case wasm::kRtt:
+      case wasm::kRef:
+      case wasm::kRefNull:
+        return MemoryRepresentation::AnyTagged();
+      case wasm::kVoid:
+      case wasm::kBottom:
+        UNREACHABLE();
+    }
+  }
+
+  OpIndex ReduceWasmTypeCheckAbstract(V<Tagged> object,
+                                      WasmTypeCheckConfig config) {
+    const bool object_can_be_null = config.from.is_nullable();
+    const bool null_succeeds = config.to.is_nullable();
+    const bool object_can_be_i31 =
+        wasm::IsSubtypeOf(wasm::kWasmI31Ref.AsNonNull(), config.from,
+                          module_) ||
+        config.from.heap_representation() == wasm::HeapType::kExtern;
+
+    OpIndex result;
+    Label<Word32> end_label(&Asm());
+
+    wasm::HeapType::Representation to_rep = config.to.heap_representation();
+    do {
+      // The none-types only perform a null check. They need no control flow.
+      if (to_rep == wasm::HeapType::kNone ||
+          to_rep == wasm::HeapType::kNoExtern ||
+          to_rep == wasm::HeapType::kNoFunc) {
+        result = __ IsNull(object, config.from);
+        break;
+      }
+      // Null checks performed by any other type check need control flow. We can
+      // skip the null check if null fails, because it's covered by the Smi
+      // check or instance type check we'll do later.
+      if (object_can_be_null && null_succeeds) {
+        const int kResult = 1;
+        GOTO_IF(UNLIKELY(__ IsNull(object, wasm::kWasmAnyRef)), end_label,
+                __ Word32Constant(kResult));
+      }
+      // i31 is special in that the Smi check is the last thing to do.
+      if (to_rep == wasm::HeapType::kI31) {
+        // If earlier optimization passes reached the limit of possible graph
+        // transformations, we could DCHECK(object_can_be_i31) here.
+        result = object_can_be_i31 ? __ IsSmi(object) : __ Word32Constant(0);
+        break;
+      }
+      if (to_rep == wasm::HeapType::kEq) {
+        if (object_can_be_i31) {
+          GOTO_IF(UNLIKELY(__ IsSmi(object)), end_label, __ Word32Constant(1));
+        }
+        // TODO(mliedtke): Ideally we'd be able to mark the map load as
+        // immutable.
+        result = IsDataRefMap(__ LoadMapField(object));
+        break;
+      }
+      // array, struct, string: i31 fails.
+      if (object_can_be_i31) {
+        GOTO_IF(UNLIKELY(__ IsSmi(object)), end_label, __ Word32Constant(0));
+      }
+      if (to_rep == wasm::HeapType::kArray) {
+        result = HasInstanceType(object, WASM_ARRAY_TYPE);
+        break;
+      }
+      if (to_rep == wasm::HeapType::kStruct) {
+        result = HasInstanceType(object, WASM_STRUCT_TYPE);
+        break;
+      }
+      if (to_rep == wasm::HeapType::kString) {
+        V<Word32> instance_type =
+            __ LoadInstanceTypeField(__ LoadMapField(object));
+        result = __ Uint32LessThan(instance_type,
+                                   __ Word32Constant(FIRST_NONSTRING_TYPE));
+        break;
+      }
+      UNREACHABLE();
+    } while (false);
+
+    DCHECK(result.valid());
+    GOTO(end_label, result);
+    BIND(end_label, final_result);
+    return final_result;
+  }
+
+  OpIndex ReduceWasmTypeCastAbstract(V<Tagged> object,
+                                     WasmTypeCheckConfig config) {
+    const bool object_can_be_null = config.from.is_nullable();
+    const bool null_succeeds = config.to.is_nullable();
+    const bool object_can_be_i31 =
+        wasm::IsSubtypeOf(wasm::kWasmI31Ref.AsNonNull(), config.from,
+                          module_) ||
+        config.from.heap_representation() == wasm::HeapType::kExtern;
+
+    Label<> end_label(&Asm());
+
+    wasm::HeapType::Representation to_rep = config.to.heap_representation();
+
+    do {
+      // The none-types only perform a null check.
+      if (to_rep == wasm::HeapType::kNone ||
+          to_rep == wasm::HeapType::kNoExtern ||
+          to_rep == wasm::HeapType::kNoFunc) {
+        __ TrapIfNot(__ IsNull(object, config.from), OpIndex::Invalid(),
+                     TrapId::kTrapIllegalCast);
+        break;
+      }
+      // Null checks performed by any other type cast can be skipped if null
+      // fails, because it's covered by the Smi check
+      // or instance type check we'll do later.
+      if (object_can_be_null && null_succeeds &&
+          !v8_flags.experimental_wasm_skip_null_checks) {
+        GOTO_IF(UNLIKELY(__ IsNull(object, config.from)), end_label);
+      }
+      if (to_rep == wasm::HeapType::kI31) {
+        // If earlier optimization passes reached the limit of possible graph
+        // transformations, we could DCHECK(object_can_be_i31) here.
+        V<Word32> success =
+            object_can_be_i31 ? __ IsSmi(object) : __ Word32Constant(0);
+        __ TrapIfNot(success, OpIndex::Invalid(), TrapId::kTrapIllegalCast);
+        break;
+      }
+      if (to_rep == wasm::HeapType::kEq) {
+        if (object_can_be_i31) {
+          GOTO_IF(UNLIKELY(__ IsSmi(object)), end_label);
+        }
+        __ TrapIfNot(IsDataRefMap(__ LoadMapField(object)), OpIndex::Invalid(),
+                     TrapId::kTrapIllegalCast);
+        break;
+      }
+      // array, struct, string: i31 fails.
+      if (object_can_be_i31) {
+        __ TrapIf(__ IsSmi(object), OpIndex::Invalid(),
+                  TrapId::kTrapIllegalCast);
+      }
+      if (to_rep == wasm::HeapType::kArray) {
+        __ TrapIfNot(HasInstanceType(object, WASM_ARRAY_TYPE),
+                     OpIndex::Invalid(), TrapId::kTrapIllegalCast);
+        break;
+      }
+      if (to_rep == wasm::HeapType::kStruct) {
+        __ TrapIfNot(__ HasInstanceType(object, WASM_STRUCT_TYPE),
+                     OpIndex::Invalid(), TrapId::kTrapIllegalCast);
+        break;
+      }
+      if (to_rep == wasm::HeapType::kString) {
+        V<Word32> instance_type =
+            __ LoadInstanceTypeField(__ LoadMapField(object));
+        __ TrapIfNot(__ Uint32LessThan(instance_type,
+                                       __ Word32Constant(FIRST_NONSTRING_TYPE)),
+                     OpIndex::Invalid(), TrapId::kTrapIllegalCast);
+        break;
+      }
+      UNREACHABLE();
+    } while (false);
+
+    GOTO(end_label);
+    BIND(end_label);
+    return object;
+  }
+
+  OpIndex ReduceWasmTypeCastRtt(V<Tagged> object, V<Tagged> rtt,
+                                WasmTypeCheckConfig config) {
+    int rtt_depth = wasm::GetSubtypingDepth(module_, config.to.ref_index());
+    bool object_can_be_null = config.from.is_nullable();
+    bool object_can_be_i31 =
+        wasm::IsSubtypeOf(wasm::kWasmI31Ref.AsNonNull(), config.from, module_);
+
+    Label<> end_label(&Asm());
+    bool is_cast_from_any = config.from.is_reference_to(wasm::HeapType::kAny);
+
+    // If we are casting from any and null results in check failure, then the
+    // {IsDataRefMap} check below subsumes the null check. Otherwise, perform
+    // an explicit null check now.
+    if (object_can_be_null && (!is_cast_from_any || config.to.is_nullable())) {
+      V<Word32> is_null = __ IsNull(object, wasm::kWasmAnyRef);
+      if (config.to.is_nullable()) {
+        GOTO_IF(UNLIKELY(is_null), end_label);
+      } else if (!v8_flags.experimental_wasm_skip_null_checks) {
+        __ TrapIf(is_null, OpIndex::Invalid(), TrapId::kTrapIllegalCast);
+      }
+    }
+
+    if (object_can_be_i31) {
+      __ TrapIf(__ IsSmi(object), OpIndex::Invalid(), TrapId::kTrapIllegalCast);
+    }
+
+    // TODO(mliedtke): Ideally we'd be able to mark this as immutable as well.
+    V<Map> map = __ LoadMapField(object);
+
+    if (module_->types[config.to.ref_index()].is_final) {
+      __ TrapIfNot(__ TaggedEqual(map, rtt), OpIndex::Invalid(),
+                   TrapId::kTrapIllegalCast);
+      GOTO(end_label);
+    } else {
+      // First, check if types happen to be equal. This has been shown to give
+      // large speedups.
+      GOTO_IF(LIKELY(__ TaggedEqual(map, rtt)), end_label);
+
+      // Check if map instance type identifies a wasm object.
+      if (is_cast_from_any) {
+        V<Word32> is_wasm_obj = IsDataRefMap(map);
+        __ TrapIfNot(is_wasm_obj, OpIndex::Invalid(), TrapId::kTrapIllegalCast);
+      }
+
+      V<Tagged> type_info = LoadWasmTypeInfo(map);
+      DCHECK_GE(rtt_depth, 0);
+      // If the depth of the rtt is known to be less that the minimum supertype
+      // array length, we can access the supertype without bounds-checking the
+      // supertype array.
+      if (static_cast<uint32_t>(rtt_depth) >=
+          wasm::kMinimumSupertypeArraySize) {
+        V<WordPtr> supertypes_length = ChangeSmiToWordPtr(
+            __ Load(type_info, LoadOp::Kind::TaggedBase().Immutable(),
+                    MemoryRepresentation::TaggedSigned(),
+                    WasmTypeInfo::kSupertypesLengthOffset));
+        __ TrapIfNot(
+            __ UintPtrLessThan(__ IntPtrConstant(rtt_depth), supertypes_length),
+            OpIndex::Invalid(), TrapId::kTrapIllegalCast);
+      }
+
+      V<Tagged> maybe_match =
+          __ Load(type_info, LoadOp::Kind::TaggedBase().Immutable(),
+                  MemoryRepresentation::TaggedPointer(),
+                  WasmTypeInfo::kSupertypesOffset + kTaggedSize * rtt_depth);
+
+      __ TrapIfNot(__ TaggedEqual(maybe_match, rtt), OpIndex::Invalid(),
+                   TrapId::kTrapIllegalCast);
+      GOTO(end_label);
+    }
+
+    BIND(end_label);
+    return object;
+  }
+
+  OpIndex ReduceWasmTypeCheckRtt(V<Tagged> object, V<Tagged> rtt,
+                                 WasmTypeCheckConfig config) {
+    int rtt_depth = wasm::GetSubtypingDepth(module_, config.to.ref_index());
+    bool object_can_be_null = config.from.is_nullable();
+    bool object_can_be_i31 =
+        wasm::IsSubtypeOf(wasm::kWasmI31Ref.AsNonNull(), config.from, module_);
+    bool is_cast_from_any = config.from.is_reference_to(wasm::HeapType::kAny);
+
+    Label<Word32> end_label(&Asm());
+
+    // If we are casting from any and null results in check failure, then the
+    // {IsDataRefMap} check below subsumes the null check. Otherwise, perform
+    // an explicit null check now.
+    if (object_can_be_null && (!is_cast_from_any || config.to.is_nullable())) {
+      const int kResult = config.to.is_nullable() ? 1 : 0;
+      GOTO_IF(UNLIKELY(__ IsNull(object, wasm::kWasmAnyRef)), end_label,
+              __ Word32Constant(kResult));
+    }
+
+    if (object_can_be_i31) {
+      GOTO_IF(__ IsSmi(object), end_label, __ Word32Constant(0));
+    }
+
+    // TODO(mliedtke): Ideally we'd be able to mark this as immutable as well.
+    V<Map> map = __ LoadMapField(object);
+
+    if (module_->types[config.to.ref_index()].is_final) {
+      GOTO(end_label, __ TaggedEqual(map, rtt));
+    } else {
+      // First, check if types happen to be equal. This has been shown to give
+      // large speedups.
+      GOTO_IF(LIKELY(__ TaggedEqual(map, rtt)), end_label,
+              __ Word32Constant(1));
+
+      // Check if map instance type identifies a wasm object.
+      if (is_cast_from_any) {
+        V<Word32> is_wasm_obj = IsDataRefMap(map);
+        GOTO_IF_NOT(LIKELY(is_wasm_obj), end_label, __ Word32Constant(0));
+      }
+
+      V<Tagged> type_info = LoadWasmTypeInfo(map);
+      DCHECK_GE(rtt_depth, 0);
+      // If the depth of the rtt is known to be less that the minimum supertype
+      // array length, we can access the supertype without bounds-checking the
+      // supertype array.
+      if (static_cast<uint32_t>(rtt_depth) >=
+          wasm::kMinimumSupertypeArraySize) {
+        // TODO(mliedtke): Why do we convert to word size and not just do a 32
+        // bit operation? (The same applies for WasmTypeCast below.)
+        V<WordPtr> supertypes_length = ChangeSmiToWordPtr(
+            __ Load(type_info, LoadOp::Kind::TaggedBase().Immutable(),
+                    MemoryRepresentation::TaggedSigned(),
+                    WasmTypeInfo::kSupertypesLengthOffset));
+        GOTO_IF_NOT(LIKELY(__ UintPtrLessThan(__ IntPtrConstant(rtt_depth),
+                                              supertypes_length)),
+                    end_label, __ Word32Constant(0));
+      }
+
+      V<Tagged> maybe_match =
+          __ Load(type_info, LoadOp::Kind::TaggedBase().Immutable(),
+                  MemoryRepresentation::TaggedPointer(),
+                  WasmTypeInfo::kSupertypesOffset + kTaggedSize * rtt_depth);
+
+      GOTO(end_label, __ TaggedEqual(maybe_match, rtt));
+    }
+
+    BIND(end_label, result);
+    return result;
+  }
+
+  V<Word32> HasInstanceType(V<Tagged> object, InstanceType instance_type) {
+    // TODO(mliedtke): These loads should be immutable.
+    return __ Word32Equal(__ LoadInstanceTypeField(__ LoadMapField(object)),
+                          __ Word32Constant(instance_type));
+  }
+
+  OpIndex LowerGlobalSetOrGet(OpIndex instance, OpIndex value,
+                              const wasm::WasmGlobal* global, GlobalMode mode) {
+    if (global->mutability && global->imported) {
+      OpIndex imported_mutable_globals =
+          LOAD_INSTANCE_FIELD(instance, ImportedMutableGlobals,
+                              MemoryRepresentation::TaggedPointer());
+      int field_offset =
+          FixedAddressArray::kHeaderSize + global->index * kSystemPointerSize;
+      if (global->type.is_reference()) {
+        OpIndex buffers =
+            LOAD_INSTANCE_FIELD(instance, ImportedMutableGlobalsBuffers,
+                                MemoryRepresentation::TaggedPointer());
+        int offset_in_buffers =
+            FixedArray::kHeaderSize + global->offset * kTaggedSize;
+        OpIndex base =
+            __ Load(buffers, LoadOp::Kind::TaggedBase(),
+                    MemoryRepresentation::AnyTagged(), offset_in_buffers);
+        V<Word32> index = __ Load(imported_mutable_globals, OpIndex::Invalid(),
+                                  LoadOp::Kind::TaggedBase(),
+                                  MemoryRepresentation::Int32(), field_offset);
+        V<WordPtr> index_ptr = __ ChangeInt32ToIntPtr(index);
+        if (mode == GlobalMode::kLoad) {
+          return __ Load(base, index_ptr, LoadOp::Kind::TaggedBase(),
+                         MemoryRepresentation::AnyTagged(),
+                         FixedArray::kObjectsOffset, kTaggedSizeLog2);
+        } else {
+          __ Store(base, index_ptr, value, StoreOp::Kind::TaggedBase(),
+                   MemoryRepresentation::AnyTagged(),
+                   WriteBarrierKind::kFullWriteBarrier,
+                   FixedArray::kObjectsOffset, kTaggedSizeLog2);
+          return OpIndex::Invalid();
+        }
+      } else {
+        // Global is imported mutable but not a reference.
+        OpIndex base = __ Load(imported_mutable_globals, OpIndex::Invalid(),
+                               LoadOp::Kind::TaggedBase(),
+                               kMaybeSandboxedPointer, field_offset);
+        if (mode == GlobalMode::kLoad) {
+          return __ Load(base, LoadOp::Kind::RawAligned(),
+                         RepresentationFor(global->type, true), 0);
+        } else {
+          __ Store(base, value, StoreOp::Kind::RawAligned(),
+                   RepresentationFor(global->type, true),
+                   WriteBarrierKind::kNoWriteBarrier, 0);
+          return OpIndex::Invalid();
+        }
+      }
+    } else if (global->type.is_reference()) {
+      OpIndex base = LOAD_INSTANCE_FIELD(instance, TaggedGlobalsBuffer,
+                                         MemoryRepresentation::TaggedPointer());
+      int offset = FixedArray::kHeaderSize + global->offset * kTaggedSize;
+      if (mode == GlobalMode::kLoad) {
+        return __ Load(base, LoadOp::Kind::TaggedBase(),
+                       MemoryRepresentation::AnyTagged(), offset);
+      } else {
+        __ Store(base, value, StoreOp::Kind::TaggedBase(),
+                 MemoryRepresentation::AnyTagged(),
+                 WriteBarrierKind::kFullWriteBarrier, offset);
+        return OpIndex::Invalid();
+      }
+    } else {
+      OpIndex base =
+          LOAD_INSTANCE_FIELD(instance, GlobalsStart, kMaybeSandboxedPointer);
+      if (mode == GlobalMode::kLoad) {
+        return __ Load(base, LoadOp::Kind::RawAligned(),
+                       RepresentationFor(global->type, true), global->offset);
+      } else {
+        __ Store(base, value, StoreOp::Kind::RawAligned(),
+                 RepresentationFor(global->type, true),
+                 WriteBarrierKind::kNoWriteBarrier, global->offset);
+        return OpIndex::Invalid();
+      }
+    }
+  }
+
+  OpIndex Null(wasm::ValueType type) {
+    OpIndex roots = __ LoadRootRegister();
+    RootIndex index = wasm::IsSubtypeOf(type, wasm::kWasmExternRef, module_)
+                          ? RootIndex::kNullValue
+                          : RootIndex::kWasmNull;
+    return __ Load(roots, LoadOp::Kind::RawAligned().Immutable(),
+                   MemoryRepresentation::PointerSized(),
+                   IsolateData::root_slot_offset(index));
+  }
+
+  V<WordPtr> ChangeSmiToWordPtr(V<Tagged> smi) {
+    return __ ChangeInt32ToIntPtr(__ UntagSmi(smi));
+  }
+
+  V<Word32> IsDataRefMap(V<Map> map) {
+    // TODO(mliedtke): LoadInstanceTypeField should emit an immutable load for
+    // wasm.
+    V<Word32> instance_type = __ LoadInstanceTypeField(map);
+    // We're going to test a range of WasmObject instance types with a single
+    // unsigned comparison.
+    V<Word32> comparison_value =
+        __ Word32Sub(instance_type, FIRST_WASM_OBJECT_TYPE);
+    return __ Uint32LessThanOrEqual(
+        comparison_value, LAST_WASM_OBJECT_TYPE - FIRST_WASM_OBJECT_TYPE);
+  }
+
+  V<Tagged> LoadWasmTypeInfo(V<Map> map) {
+    int offset = Map::kConstructorOrBackPointerOrNativeContextOffset;
+    return __ Load(map, LoadOp::Kind::TaggedBase().Immutable(),
+                   MemoryRepresentation::TaggedPointer(), offset);
+  }
+
+  std::pair<bool, bool> null_checks_for_struct_op(CheckForNull null_check,
+                                                  int field_index) {
+    bool explicit_null_check =
+        null_check == kWithNullCheck &&
+        (null_check_strategy_ == NullCheckStrategy::kExplicit ||
+         field_index > wasm::kMaxStructFieldIndexForImplicitNullCheck);
+    bool implicit_null_check =
+        null_check == kWithNullCheck && !explicit_null_check;
+    return {explicit_null_check, implicit_null_check};
+  }
+
+  int field_offset(const wasm::StructType* type, int field_index) {
+    return WasmStruct::kHeaderSize + type->field_offset(field_index);
+  }
+
+  const wasm::WasmModule* module_ = PipelineData::Get().wasm_module();
+  const NullCheckStrategy null_check_strategy_ =
+      trap_handler::IsTrapHandlerEnabled() && V8_STATIC_ROOTS_BOOL
+          ? NullCheckStrategy::kTrapHandler
+          : NullCheckStrategy::kExplicit;
+};
+
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_WASM_LOWERING_REDUCER_H_
diff --git a/deps/v8/src/compiler/turboshaft/wasm-optimize-phase.cc b/deps/v8/src/compiler/turboshaft/wasm-optimize-phase.cc
new file mode 100644
index 00000000000000..76cb8385f7b20b
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/wasm-optimize-phase.cc
@@ -0,0 +1,24 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/wasm-optimize-phase.h"
+
+#include "src/compiler/js-heap-broker.h"
+#include "src/compiler/turboshaft/machine-optimization-reducer.h"
+#include "src/compiler/turboshaft/value-numbering-reducer.h"
+#include "src/compiler/turboshaft/wasm-lowering-reducer.h"
+#include "src/numbers/conversions-inl.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+void WasmOptimizePhase::Run(Zone* temp_zone) {
+  UnparkedScopeIfNeeded scope(PipelineData::Get().broker(),
+                              v8_flags.turboshaft_trace_reduction);
+  // TODO(14108): Add more reducers as needed.
+  OptimizationPhase<WasmLoweringReducer,
+                    MachineOptimizationReducerSignallingNanPossible,
+                    ValueNumberingReducer>::Run(temp_zone);
+}
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/wasm-optimize-phase.h b/deps/v8/src/compiler/turboshaft/wasm-optimize-phase.h
new file mode 100644
index 00000000000000..9523fa40e867f9
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/wasm-optimize-phase.h
@@ -0,0 +1,24 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#ifndef V8_COMPILER_TURBOSHAFT_WASM_OPTIMIZE_PHASE_H_
+#define V8_COMPILER_TURBOSHAFT_WASM_OPTIMIZE_PHASE_H_
+
+#include "src/compiler/turboshaft/phase.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+struct WasmOptimizePhase {
+  DECL_TURBOSHAFT_PHASE_CONSTANTS(WasmOptimize)
+
+  void Run(Zone* temp_zone);
+};
+
+}  // namespace v8::internal::compiler::turboshaft
+
+#endif  // V8_COMPILER_TURBOSHAFT_WASM_OPTIMIZE_PHASE_H_
diff --git a/deps/v8/src/compiler/turboshaft/wasm-turboshaft-compiler.cc b/deps/v8/src/compiler/turboshaft/wasm-turboshaft-compiler.cc
new file mode 100644
index 00000000000000..9e640ab5b04c7d
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/wasm-turboshaft-compiler.cc
@@ -0,0 +1,64 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/wasm-turboshaft-compiler.h"
+
+#include "src/codegen/optimized-compilation-info.h"
+#include "src/compiler/backend/instruction-selector.h"
+#include "src/compiler/common-operator.h"
+#include "src/compiler/compiler-source-position-table.h"
+#include "src/compiler/graph-visualizer.h"
+#include "src/compiler/machine-operator.h"
+#include "src/compiler/node-origin-table.h"
+#include "src/compiler/pipeline.h"
+// TODO(14108): Remove.
+#include "src/compiler/wasm-compiler.h"
+#include "src/wasm/wasm-engine.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+wasm::WasmCompilationResult ExecuteTurboshaftWasmCompilation(
+    wasm::CompilationEnv* env, compiler::WasmCompilationData& data,
+    wasm::WasmFeatures* detected) {
+  Zone zone(wasm::GetWasmEngine()->allocator(), ZONE_NAME, kCompressGraphZone);
+  compiler::MachineGraph* mcgraph = zone.New<compiler::MachineGraph>(
+      zone.New<compiler::Graph>(&zone), zone.New<CommonOperatorBuilder>(&zone),
+      zone.New<MachineOperatorBuilder>(
+          &zone, MachineType::PointerRepresentation(),
+          InstructionSelector::SupportedMachineOperatorFlags(),
+          InstructionSelector::AlignmentRequirements()));
+
+  OptimizedCompilationInfo info(
+      GetDebugName(&zone, env->module, data.wire_bytes_storage,
+                   data.func_index),
+      &zone, CodeKind::WASM_FUNCTION);
+
+  if (info.trace_turbo_json()) {
+    TurboCfgFile tcf;
+    tcf << AsC1VCompilation(&info);
+  }
+
+  if (info.trace_turbo_json()) {
+    data.node_origins = zone.New<NodeOriginTable>(mcgraph->graph());
+  }
+
+  data.source_positions =
+      mcgraph->zone()->New<SourcePositionTable>(mcgraph->graph());
+  data.assumptions = new wasm::AssumptionsJournal();
+  auto call_descriptor = GetWasmCallDescriptor(&zone, data.func_body.sig);
+
+  if (!Pipeline::GenerateWasmCodeFromTurboshaftGraph(&info, env, data, mcgraph,
+                                                     data.func_body, detected,
+                                                     call_descriptor)) {
+    delete data.assumptions;
+    return {};
+  }
+  auto result = info.ReleaseWasmCompilationResult();
+  CHECK_NOT_NULL(result);  // Compilation expected to succeed.
+  DCHECK_EQ(wasm::ExecutionTier::kTurbofan, result->result_tier);
+  result->assumptions.reset(data.assumptions);
+  return std::move(*result);
+}
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/src/compiler/turboshaft/wasm-turboshaft-compiler.h b/deps/v8/src/compiler/turboshaft/wasm-turboshaft-compiler.h
new file mode 100644
index 00000000000000..4204066055e497
--- /dev/null
+++ b/deps/v8/src/compiler/turboshaft/wasm-turboshaft-compiler.h
@@ -0,0 +1,30 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#ifndef V8_COMPILER_TURBOSHAFT_WASM_TURBOSHAFT_COMPILER_H_
+#define V8_COMPILER_TURBOSHAFT_WASM_TURBOSHAFT_COMPILER_H_
+
+namespace v8::internal::wasm {
+struct CompilationEnv;
+struct WasmCompilationResult;
+class WasmFeatures;
+}  // namespace v8::internal::wasm
+
+namespace v8::internal::compiler {
+struct WasmCompilationData;
+
+namespace turboshaft {
+
+wasm::WasmCompilationResult ExecuteTurboshaftWasmCompilation(
+    wasm::CompilationEnv* env, WasmCompilationData& data,
+    wasm::WasmFeatures* detected);
+
+}
+}  // namespace v8::internal::compiler
+
+#endif  // V8_COMPILER_TURBOSHAFT_WASM_TURBOSHAFT_COMPILER_H_
diff --git a/deps/v8/src/compiler/type-cache.h b/deps/v8/src/compiler/type-cache.h
index f0769068a5d21a..7117e4e4f64292 100644
--- a/deps/v8/src/compiler/type-cache.h
+++ b/deps/v8/src/compiler/type-cache.h
@@ -47,7 +47,8 @@ class V8_EXPORT_PRIVATE TypeCache final {
   Type const kBigInt64 = Type::SignedBigInt64();
   Type const kBigUint64 = Type::UnsignedBigInt64();
 
-  Type const kHoleySmi = Type::Union(Type::SignedSmall(), Type::Hole(), zone());
+  Type const kHoleySmi =
+      Type::Union(Type::SignedSmall(), Type::TheHole(), zone());
 
   Type const kSingletonZero = CreateRange(0.0, 0.0);
   Type const kSingletonOne = CreateRange(1.0, 1.0);
diff --git a/deps/v8/src/compiler/typed-optimization.cc b/deps/v8/src/compiler/typed-optimization.cc
index c40976fe06c7d9..5f89a43950b8b0 100644
--- a/deps/v8/src/compiler/typed-optimization.cc
+++ b/deps/v8/src/compiler/typed-optimization.cc
@@ -176,12 +176,17 @@ Reduction TypedOptimization::ReduceMaybeGrowFastElements(Node* node) {
 
   if (!index_type.IsNone() && !length_type.IsNone() &&
       index_type.Max() < length_type.Min()) {
-    Node* check_bounds = graph()->NewNode(
-        simplified()->CheckBounds(FeedbackSource{},
-                                  CheckBoundsFlag::kAbortOnOutOfBounds),
-        index, length, effect, control);
-    ReplaceWithValue(node, elements, check_bounds);
-    return Replace(check_bounds);
+    if (v8_flags.turbo_typer_hardening) {
+      Node* check_bounds = graph()->NewNode(
+          simplified()->CheckBounds(FeedbackSource{},
+                                    CheckBoundsFlag::kAbortOnOutOfBounds),
+          index, length, effect, control);
+      ReplaceWithValue(node, elements, check_bounds);
+      return Replace(check_bounds);
+    } else {
+      RelaxEffectsAndControls(node);
+      return Replace(elements);
+    }
   }
 
   return NoChange();
@@ -207,7 +212,7 @@ Reduction TypedOptimization::ReduceCheckBounds(Node* node) {
 Reduction TypedOptimization::ReduceCheckNotTaggedHole(Node* node) {
   Node* const input = NodeProperties::GetValueInput(node, 0);
   Type const input_type = NodeProperties::GetType(input);
-  if (!input_type.Maybe(Type::Hole())) {
+  if (!input_type.Maybe(Type::TheHole())) {
     ReplaceWithValue(node, input);
     return Replace(input);
   }
@@ -318,6 +323,7 @@ Reduction TypedOptimization::ReduceNumberFloor(Node* node) {
     Type const lhs_type = NodeProperties::GetType(lhs);
     Node* const rhs = NodeProperties::GetValueInput(input, 1);
     Type const rhs_type = NodeProperties::GetType(rhs);
+    if (lhs_type.IsNone() || rhs_type.IsNone()) return NoChange();
     if (lhs_type.Is(Type::Unsigned32()) && rhs_type.Is(Type::Unsigned32())) {
       // We can replace
       //
@@ -439,7 +445,7 @@ const Operator* TypedOptimization::NumberComparisonFor(const Operator* op) {
 
 Reduction TypedOptimization::
     TryReduceStringComparisonOfStringFromSingleCharCodeToConstant(
-        Node* comparison, const StringRef& string, bool inverted) {
+        Node* comparison, StringRef string, bool inverted) {
   switch (comparison->opcode()) {
     case IrOpcode::kStringEqual:
       if (string.length() != 1) {
@@ -871,7 +877,7 @@ Reduction TypedOptimization::ReduceSpeculativeNumberBinop(Node* node) {
   NumberOperationHint hint = NumberOperationHintOf(node->op());
   if ((hint == NumberOperationHint::kNumber ||
        hint == NumberOperationHint::kNumberOrOddball) &&
-      BothAre(lhs_type, rhs_type, Type::NumberOrUndefinedOrNullOrBoolean())) {
+      BothAre(lhs_type, rhs_type, Type::NumberOrOddball())) {
     // We intentionally do this only in the Number and NumberOrOddball hint case
     // because simplified lowering of these speculative ops may do some clever
     // reductions in the other cases.
diff --git a/deps/v8/src/compiler/typed-optimization.h b/deps/v8/src/compiler/typed-optimization.h
index 3ed9721958ccff..d9b8e3e31127a1 100644
--- a/deps/v8/src/compiler/typed-optimization.h
+++ b/deps/v8/src/compiler/typed-optimization.h
@@ -71,7 +71,7 @@ class V8_EXPORT_PRIVATE TypedOptimization final
       Node* comparison, Node* from_char_code, Type constant_type,
       bool inverted);
   Reduction TryReduceStringComparisonOfStringFromSingleCharCodeToConstant(
-      Node* comparison, const StringRef& string, bool inverted);
+      Node* comparison, StringRef string, bool inverted);
   const Operator* NumberComparisonFor(const Operator* op);
 
   Node* ConvertPlainPrimitiveToNumber(Node* node);
diff --git a/deps/v8/src/compiler/typer.cc b/deps/v8/src/compiler/typer.cc
index 09f1af2e0e5af9..c8981c9cc2e22d 100644
--- a/deps/v8/src/compiler/typer.cc
+++ b/deps/v8/src/compiler/typer.cc
@@ -16,6 +16,7 @@
 #include "src/compiler/loop-variable-optimizer.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/node.h"
+#include "src/compiler/opcodes.h"
 #include "src/compiler/operation-typer.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/compiler/type-cache.h"
@@ -162,7 +163,6 @@ class Typer::Visitor : public Reducer {
       DECLARE_IMPOSSIBLE_CASE(Int32LessThan)
       DECLARE_IMPOSSIBLE_CASE(Int64LessThan)
       DECLARE_IMPOSSIBLE_CASE(Int64LessThanOrEqual)
-      DECLARE_IMPOSSIBLE_CASE(Uint64LessThan)
       DECLARE_IMPOSSIBLE_CASE(Float32Equal)
       DECLARE_IMPOSSIBLE_CASE(Float32LessThan)
       DECLARE_IMPOSSIBLE_CASE(Float32LessThanOrEqual)
@@ -178,6 +178,7 @@ class Typer::Visitor : public Reducer {
       DECLARE_IMPOSSIBLE_CASE(DebugBreak)
       DECLARE_IMPOSSIBLE_CASE(Comment)
       DECLARE_IMPOSSIBLE_CASE(LoadImmutable)
+      DECLARE_IMPOSSIBLE_CASE(StorePair)
       DECLARE_IMPOSSIBLE_CASE(Store)
       DECLARE_IMPOSSIBLE_CASE(StackSlot)
       DECLARE_IMPOSSIBLE_CASE(Word32Popcnt)
@@ -856,7 +857,7 @@ Type Typer::Visitor::TypeParameter(Node* node) {
       return Type::Receiver();
     } else {
       // Parameter[this] can be the_hole for derived class constructors.
-      return Type::Union(Type::Hole(), Type::NonInternal(), typer_->zone());
+      return Type::Union(Type::TheHole(), Type::NonInternal(), typer_->zone());
     }
   } else if (index == start.NewTargetParameterIndex()) {
     if (typer_->flags() & Typer::kNewTargetIsReceiver) {
@@ -1087,6 +1088,24 @@ bool Typer::Visitor::InductionVariablePhiTypeIsPrefixedPoint(
   if (arith_type.IsNone()) {
     type = Type::None();
   } else {
+    // We support a few additional type conversions on the lhs of the arithmetic
+    // operation. This needs to be kept in sync with the corresponding code in
+    // {LoopVariableOptimizer::TryGetInductionVariable}.
+    Node* arith_input = arith->InputAt(0);
+    switch (arith_input->opcode()) {
+      case IrOpcode::kSpeculativeToNumber:
+        type = typer_->operation_typer_.SpeculativeToNumber(type);
+        break;
+      case IrOpcode::kJSToNumber:
+        type = typer_->operation_typer_.ToNumber(type);
+        break;
+      case IrOpcode::kJSToNumberConvertBigInt:
+        type = typer_->operation_typer_.ToNumberConvertBigInt(type);
+        break;
+      default:
+        break;
+    }
+
     // Apply ordinary typing to the "increment" operation.
     // clang-format off
     switch (arith->opcode()) {
@@ -1197,8 +1216,6 @@ Type Typer::Visitor::TypeTypeGuard(Node* node) {
   return typer_->operation_typer()->TypeTypeGuard(node->op(), type);
 }
 
-Type Typer::Visitor::TypeFoldConstant(Node* node) { return Operand(node, 0); }
-
 Type Typer::Visitor::TypeDead(Node* node) { return Type::None(); }
 Type Typer::Visitor::TypeDeadValue(Node* node) { return Type::None(); }
 Type Typer::Visitor::TypeUnreachable(Node* node) { return Type::None(); }
@@ -2581,9 +2598,7 @@ Type Typer::Visitor::TypeRuntimeAbort(Node* node) { UNREACHABLE(); }
 
 Type Typer::Visitor::TypeAssertType(Node* node) { UNREACHABLE(); }
 
-Type Typer::Visitor::TypeVerifyType(Node* node) {
-  return TypeOrNone(node->InputAt(0));
-}
+Type Typer::Visitor::TypeVerifyType(Node* node) { UNREACHABLE(); }
 
 Type Typer::Visitor::TypeCheckTurboshaftTypeOf(Node* node) {
   return TypeOrNone(node->InputAt(0));
diff --git a/deps/v8/src/compiler/types.cc b/deps/v8/src/compiler/types.cc
index 8b0ba9620f4f19..c9e2e0ff94818c 100644
--- a/deps/v8/src/compiler/types.cc
+++ b/deps/v8/src/compiler/types.cc
@@ -135,38 +135,42 @@ Type::bitset Type::BitsetLub() const {
   }
   if (IsRange()) return AsRange()->Lub();
   if (IsTuple()) return BitsetType::kOtherInternal;
+#if V8_ENABLE_WEBASSEMBLY
+  if (IsWasm()) return static_cast<const WasmType*>(ToTypeBase())->Lub();
+#endif
   UNREACHABLE();
 }
 
 // TODO(neis): Once the broker mode kDisabled is gone, change the input type to
 // MapRef and get rid of the HeapObjectType class.
 template <typename MapRefLike>
-Type::bitset BitsetType::Lub(const MapRefLike& map, JSHeapBroker* broker) {
+Type::bitset BitsetType::Lub(MapRefLike map, JSHeapBroker* broker) {
   switch (map.instance_type()) {
-    case CONS_STRING_TYPE:
+    case CONS_TWO_BYTE_STRING_TYPE:
     case CONS_ONE_BYTE_STRING_TYPE:
-    case THIN_STRING_TYPE:
-    case SLICED_STRING_TYPE:
+    case THIN_TWO_BYTE_STRING_TYPE:
+    case THIN_ONE_BYTE_STRING_TYPE:
+    case SLICED_TWO_BYTE_STRING_TYPE:
     case SLICED_ONE_BYTE_STRING_TYPE:
-    case EXTERNAL_STRING_TYPE:
+    case EXTERNAL_TWO_BYTE_STRING_TYPE:
     case EXTERNAL_ONE_BYTE_STRING_TYPE:
-    case UNCACHED_EXTERNAL_STRING_TYPE:
+    case UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE:
-    case STRING_TYPE:
-    case ONE_BYTE_STRING_TYPE:
-    case SHARED_STRING_TYPE:
-    case SHARED_EXTERNAL_STRING_TYPE:
-    case SHARED_ONE_BYTE_STRING_TYPE:
+    case SEQ_TWO_BYTE_STRING_TYPE:
+    case SEQ_ONE_BYTE_STRING_TYPE:
+    case SHARED_SEQ_TWO_BYTE_STRING_TYPE:
+    case SHARED_SEQ_ONE_BYTE_STRING_TYPE:
+    case SHARED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE:
-    case SHARED_UNCACHED_EXTERNAL_STRING_TYPE:
+    case SHARED_UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case SHARED_UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE:
       return kString;
-    case EXTERNAL_INTERNALIZED_STRING_TYPE:
-    case EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE:
-    case UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE:
-    case UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE:
-    case INTERNALIZED_STRING_TYPE:
-    case ONE_BYTE_INTERNALIZED_STRING_TYPE:
+    case EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE:
+    case UNCACHED_EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case UNCACHED_EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE:
+    case INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case INTERNALIZED_ONE_BYTE_STRING_TYPE:
       return kInternalizedString;
     case SYMBOL_TYPE:
       return kSymbol;
@@ -176,8 +180,6 @@ Type::bitset BitsetType::Lub(const MapRefLike& map, JSHeapBroker* broker) {
       switch (map.oddball_type(broker)) {
         case OddballType::kNone:
           break;
-        case OddballType::kHole:
-          return kHole;
         case OddballType::kBoolean:
           return kBoolean;
         case OddballType::kNull:
@@ -190,6 +192,10 @@ Type::bitset BitsetType::Lub(const MapRefLike& map, JSHeapBroker* broker) {
           return kOtherInternal;
       }
       UNREACHABLE();
+    case HOLE_TYPE:
+      // Holes have a single map and we should have distinguished them earlier
+      // by pointer comparison on the value.
+      UNREACHABLE();
     case HEAP_NUMBER_TYPE:
       return kNumber;
     case JS_ARRAY_ITERATOR_PROTOTYPE_TYPE:
@@ -267,6 +273,7 @@ Type::bitset BitsetType::Lub(const MapRefLike& map, JSHeapBroker* broker) {
     case JS_ITERATOR_FILTER_HELPER_TYPE:
     case JS_ITERATOR_TAKE_HELPER_TYPE:
     case JS_ITERATOR_DROP_HELPER_TYPE:
+    case JS_ITERATOR_FLAT_MAP_HELPER_TYPE:
     case JS_VALID_ITERATOR_WRAPPER_TYPE:
     case JS_FINALIZATION_REGISTRY_TYPE:
     case JS_WEAK_MAP_TYPE:
@@ -404,8 +411,7 @@ Type::bitset BitsetType::Lub(const MapRefLike& map, JSHeapBroker* broker) {
 }
 
 // Explicit instantiation.
-template Type::bitset BitsetType::Lub<MapRef>(const MapRef& map,
-                                              JSHeapBroker* broker);
+template Type::bitset BitsetType::Lub<MapRef>(MapRef map, JSHeapBroker* broker);
 
 Type::bitset BitsetType::Lub(double value) {
   DisallowGarbageCollection no_gc;
@@ -521,7 +527,7 @@ bool OtherNumberConstantType::IsOtherNumberConstant(double value) {
 }
 
 HeapConstantType::HeapConstantType(BitsetType::bitset bitset,
-                                   const HeapObjectRef& heap_ref)
+                                   HeapObjectRef heap_ref)
     : TypeBase(kHeapConstant), bitset_(bitset), heap_ref_(heap_ref) {}
 
 Handle<HeapObject> HeapConstantType::Value() const {
@@ -914,6 +920,14 @@ Type Type::Constant(JSHeapBroker* broker, ObjectRef ref, Zone* zone) {
   if (ref.IsString() && !ref.IsInternalizedString()) {
     return Type::String();
   }
+  switch (ref.HoleType()) {
+    case HoleType::kNone:
+      break;
+    case HoleType::kGeneric:
+      return Type::TheHole();
+    case HoleType::kPropertyCell:
+      return Type::PropertyCellHole();
+  }
   return HeapConstant(ref.AsHeapObject(), broker, zone);
 }
 
@@ -1152,9 +1166,9 @@ Type Type::OtherNumberConstant(double value, Zone* zone) {
 }
 
 // static
-Type Type::HeapConstant(const HeapObjectRef& value, JSHeapBroker* broker,
-                        Zone* zone) {
+Type Type::HeapConstant(HeapObjectRef value, JSHeapBroker* broker, Zone* zone) {
   DCHECK(!value.IsHeapNumber());
+  DCHECK_EQ(value.HoleType(), HoleType::kNone);
   DCHECK_IMPLIES(value.IsString(), value.IsInternalizedString());
   BitsetType::bitset bitset =
       BitsetType::Lub(value.GetHeapObjectType(broker), broker);
diff --git a/deps/v8/src/compiler/types.h b/deps/v8/src/compiler/types.h
index 4d56b88477395a..68ada451aab993 100644
--- a/deps/v8/src/compiler/types.h
+++ b/deps/v8/src/compiler/types.h
@@ -128,21 +128,22 @@ namespace compiler {
   V(CallableFunction,         uint64_t{1} << 20)  \
   V(ClassConstructor,         uint64_t{1} << 21)  \
   V(BoundFunction,            uint64_t{1} << 22)  \
-  V(Hole,                     uint64_t{1} << 23)  \
-  V(OtherInternal,            uint64_t{1} << 24)  \
-  V(ExternalPointer,          uint64_t{1} << 25)  \
-  V(Array,                    uint64_t{1} << 26)  \
-  V(UnsignedBigInt63,         uint64_t{1} << 27)  \
-  V(OtherUnsignedBigInt64,    uint64_t{1} << 28)  \
-  V(NegativeBigInt63,         uint64_t{1} << 29)  \
-  V(OtherBigInt,              uint64_t{1} << 30)  \
-  V(WasmObject,               uint64_t{1} << 31)
+  V(OtherInternal,            uint64_t{1} << 23)  \
+  V(ExternalPointer,          uint64_t{1} << 24)  \
+  V(Array,                    uint64_t{1} << 25)  \
+  V(UnsignedBigInt63,         uint64_t{1} << 26)  \
+  V(OtherUnsignedBigInt64,    uint64_t{1} << 27)  \
+  V(NegativeBigInt63,         uint64_t{1} << 28)  \
+  V(OtherBigInt,              uint64_t{1} << 29)  \
+  V(WasmObject,               uint64_t{1} << 30)  \
+  V(SandboxedPointer,         uint64_t{1} << 31)
 
 // We split the macro list into two parts because the Torque equivalent in
 // turbofan-types.tq uses two 32bit bitfield structs.
-#define PROPER_ATOMIC_BITSET_TYPE_HIGH_LIST(V) \
-  V(SandboxedPointer,         uint64_t{1} << 32) \
-  V(Machine,                  uint64_t{1} << 33)
+#define PROPER_ATOMIC_BITSET_TYPE_HIGH_LIST(V)                             \
+  V(Machine,                  uint64_t{1} << 32)                           \
+  V(TheHole,                  uint64_t{1} << 33)                           \
+  V(PropertyCellHole,         uint64_t{1} << 34)
 
 #define PROPER_BITSET_TYPE_LIST(V) \
   V(None,                     uint64_t{0}) \
@@ -178,17 +179,15 @@ namespace compiler {
   V(BooleanOrNumber,              kBoolean | kNumber) \
   V(BooleanOrNullOrNumber,        kBooleanOrNumber | kNull) \
   V(BooleanOrNullOrUndefined,     kBoolean | kNull | kUndefined) \
-  V(Oddball,                      kBooleanOrNullOrUndefined | kHole) \
+  V(Hole,                         kTheHole | kPropertyCellHole) \
   V(NullOrNumber,                 kNull | kNumber) \
   V(NullOrUndefined,              kNull | kUndefined) \
   V(Undetectable,                 kNullOrUndefined | kOtherUndetectable) \
-  V(NumberOrHole,                 kNumber | kHole) \
-  V(NumberOrOddball,              kNumber | kNullOrUndefined | kBoolean | \
-                                  kHole) \
+  V(NumberOrTheHole,              kNumber | kTheHole) \
+  V(NumberOrOddball,              kNumber | kBooleanOrNullOrUndefined ) \
+  V(NumberOrOddballOrTheHole,              kNumberOrOddball| kTheHole ) \
   V(NumericOrString,              kNumeric | kString) \
   V(NumberOrUndefined,            kNumber | kUndefined) \
-  V(NumberOrUndefinedOrNullOrBoolean,  \
-                                  kNumber | kNullOrUndefined | kBoolean) \
   V(PlainPrimitive,               kNumber | kString | kBoolean | \
                                   kNullOrUndefined) \
   V(NonBigIntPrimitive,           kSymbol | kPlainPrimitive) \
@@ -282,7 +281,7 @@ class V8_EXPORT_PRIVATE BitsetType {
   static bitset Lub(HeapObjectType const& type, JSHeapBroker* broker) {
     return Lub<HeapObjectType>(type, broker);
   }
-  static bitset Lub(MapRef const& map, JSHeapBroker* broker) {
+  static bitset Lub(MapRef map, JSHeapBroker* broker) {
     return Lub<MapRef>(map, broker);
   }
   static bitset Lub(double value);
@@ -308,7 +307,7 @@ class V8_EXPORT_PRIVATE BitsetType {
   static inline size_t BoundariesSize();
 
   template <typename MapRefLike>
-  static bitset Lub(MapRefLike const& map, JSHeapBroker* broker);
+  static bitset Lub(MapRefLike map, JSHeapBroker* broker);
 };
 
 // -----------------------------------------------------------------------------
@@ -397,9 +396,17 @@ class WasmType : public TypeBase {
   const wasm::WasmModule* module() const { return module_; }
 
  private:
+  friend class Type;
   friend Zone;
+
   explicit WasmType(wasm::ValueType value_type, const wasm::WasmModule* module)
       : TypeBase(kWasm), value_type_(value_type), module_(module) {}
+
+  BitsetType::bitset Lub() const {
+    // TODO(manoskouk): Specify more concrete types.
+    return BitsetType::kAny;
+  }
+
   wasm::ValueType value_type_;
   const wasm::WasmModule* module_;
 };
@@ -439,7 +446,7 @@ class V8_EXPORT_PRIVATE Type {
   static Type Wasm(wasm::TypeInModule type_in_module, Zone* zone);
 #endif
 
-  static Type For(MapRef const& type, JSHeapBroker* broker) {
+  static Type For(MapRef type, JSHeapBroker* broker) {
     return NewBitset(
         BitsetType::ExpandInternals(BitsetType::Lub(type, broker)));
   }
@@ -480,7 +487,9 @@ class V8_EXPORT_PRIVATE Type {
   const OtherNumberConstantType* AsOtherNumberConstant() const;
   const RangeType* AsRange() const;
   const TupleType* AsTuple() const;
+#ifdef V8_ENABLE_WEBASSEMBLY
   wasm::TypeInModule AsWasm() const;
+#endif
 
   // Minimum and maximum of a numeric type.
   // These functions do not distinguish between -0 and +0.  NaN is ignored.
@@ -559,7 +568,7 @@ class V8_EXPORT_PRIVATE Type {
 
   static Type Range(RangeType::Limits lims, Zone* zone);
   static Type OtherNumberConstant(double value, Zone* zone);
-  static Type HeapConstant(const HeapObjectRef& value, JSHeapBroker* broker,
+  static Type HeapConstant(HeapObjectRef value, JSHeapBroker* broker,
                            Zone* zone);
 
   static bool Overlap(const RangeType* lhs, const RangeType* rhs);
@@ -618,19 +627,19 @@ class OtherNumberConstantType : public TypeBase {
 class V8_EXPORT_PRIVATE HeapConstantType : public NON_EXPORTED_BASE(TypeBase) {
  public:
   Handle<HeapObject> Value() const;
-  const HeapObjectRef& Ref() const { return heap_ref_; }
+  HeapObjectRef Ref() const { return heap_ref_; }
 
  private:
   friend class Type;
   friend class BitsetType;
   friend Zone;
 
-  static HeapConstantType* New(const HeapObjectRef& heap_ref,
+  static HeapConstantType* New(HeapObjectRef heap_ref,
                                BitsetType::bitset bitset, Zone* zone) {
     return zone->New<HeapConstantType>(bitset, heap_ref);
   }
 
-  HeapConstantType(BitsetType::bitset bitset, const HeapObjectRef& heap_ref);
+  HeapConstantType(BitsetType::bitset bitset, HeapObjectRef heap_ref);
 
   BitsetType::bitset Lub() const { return bitset_; }
 
@@ -666,7 +675,7 @@ class StructuralType : public TypeBase {
 
   StructuralType(Kind kind, int length, Zone* zone)
       : TypeBase(kind), length_(length) {
-    elements_ = zone->NewArray<Type>(length);
+    elements_ = zone->AllocateArray<Type>(length);
   }
 
  private:
diff --git a/deps/v8/src/compiler/use-info.h b/deps/v8/src/compiler/use-info.h
index 670a8d6e8b4b87..d413482954dd37 100644
--- a/deps/v8/src/compiler/use-info.h
+++ b/deps/v8/src/compiler/use-info.h
@@ -6,6 +6,7 @@
 #define V8_COMPILER_USE_INFO_H_
 
 #include "src/base/functional.h"
+#include "src/codegen/machine-type.h"
 #include "src/compiler/feedback-source.h"
 #include "src/compiler/globals.h"
 
diff --git a/deps/v8/src/compiler/value-numbering-reducer.cc b/deps/v8/src/compiler/value-numbering-reducer.cc
index 24ad97e6cc27c8..3ad56f4c253b5d 100644
--- a/deps/v8/src/compiler/value-numbering-reducer.cc
+++ b/deps/v8/src/compiler/value-numbering-reducer.cc
@@ -32,7 +32,7 @@ Reduction ValueNumberingReducer::Reduce(Node* node) {
     DCHECK_EQ(0, capacity_);
     // Allocate the initial entries and insert the first entry.
     capacity_ = kInitialCapacity;
-    entries_ = temp_zone()->NewArray<Node*>(kInitialCapacity);
+    entries_ = temp_zone()->AllocateArray<Node*>(kInitialCapacity);
     memset(entries_, 0, sizeof(*entries_) * kInitialCapacity);
     entries_[hash & (kInitialCapacity - 1)] = node;
     size_ = 1;
@@ -152,7 +152,7 @@ void ValueNumberingReducer::Grow() {
   Node** const old_entries = entries_;
   size_t const old_capacity = capacity_;
   capacity_ *= 2;
-  entries_ = temp_zone()->NewArray<Node*>(capacity_);
+  entries_ = temp_zone()->AllocateArray<Node*>(capacity_);
   memset(entries_, 0, sizeof(*entries_) * capacity_);
   size_ = 0;
   size_t const mask = capacity_ - 1;
diff --git a/deps/v8/src/compiler/verifier.cc b/deps/v8/src/compiler/verifier.cc
index b04f380f04dfb0..640dfd4c58ba74 100644
--- a/deps/v8/src/compiler/verifier.cc
+++ b/deps/v8/src/compiler/verifier.cc
@@ -1259,13 +1259,10 @@ void Verifier::Visitor::Check(Node* node, const AllNodes& all) {
       CheckTypeIs(node, Type::Boolean());
       break;
     case IrOpcode::kNumberIsFloat64Hole:
-      CheckValueInputIs(node, 0, Type::NumberOrHole());
+      CheckValueInputIs(node, 0, Type::NumberOrTheHole());
       CheckTypeIs(node, Type::Boolean());
       break;
     case IrOpcode::kNumberIsFinite:
-      CheckValueInputIs(node, 0, Type::Number());
-      CheckTypeIs(node, Type::Boolean());
-      break;
     case IrOpcode::kNumberIsMinusZero:
     case IrOpcode::kNumberIsNaN:
       CheckValueInputIs(node, 0, Type::Number());
@@ -1585,7 +1582,7 @@ void Verifier::Visitor::Check(Node* node, const AllNodes& all) {
       CheckTypeIs(node, Type::Number());
       break;
     case IrOpcode::kCheckFloat64Hole:
-      CheckValueInputIs(node, 0, Type::NumberOrHole());
+      CheckValueInputIs(node, 0, Type::NumberOrTheHole());
       CheckTypeIs(node, Type::NumberOrUndefined());
       break;
     case IrOpcode::kCheckNotTaggedHole:
@@ -1682,14 +1679,6 @@ void Verifier::Visitor::Check(Node* node, const AllNodes& all) {
     case IrOpcode::kTypeGuard:
       CheckTypeIs(node, TypeGuardTypeOf(node->op()));
       break;
-    case IrOpcode::kFoldConstant:
-      if (typing == TYPED) {
-        Type type = NodeProperties::GetType(node);
-        CHECK(type.IsSingleton());
-        CHECK(type.Equals(NodeProperties::GetType(node->InputAt(0))));
-        CHECK(type.Equals(NodeProperties::GetType(node->InputAt(1))));
-      }
-      break;
     case IrOpcode::kDateNow:
       CHECK_EQ(0, value_count);
       CheckTypeIs(node, Type::Number());
@@ -1717,7 +1706,9 @@ void Verifier::Visitor::Check(Node* node, const AllNodes& all) {
       CheckValueInputIs(node, 0, Type::Any());  // callee
       break;
     case IrOpcode::kWasmTypeCheck:
+    case IrOpcode::kWasmTypeCheckAbstract:
     case IrOpcode::kWasmTypeCast:
+    case IrOpcode::kWasmTypeCastAbstract:
     case IrOpcode::kRttCanon:
     case IrOpcode::kNull:
     case IrOpcode::kIsNull:
@@ -1733,7 +1724,7 @@ void Verifier::Visitor::Check(Node* node, const AllNodes& all) {
     case IrOpcode::kWasmArrayInitializeLength:
     case IrOpcode::kStringAsWtf16:
     case IrOpcode::kStringPrepareForGetCodeunit:
-      // TODO(manoskouk): What are the constraints here?
+      // TODO(7748): What are the constraints here?
       break;
 #endif  // V8_ENABLE_WEBASSEMBLY
 
@@ -1746,6 +1737,7 @@ void Verifier::Visitor::Check(Node* node, const AllNodes& all) {
     case IrOpcode::kLoadTrapOnNull:
     case IrOpcode::kStoreTrapOnNull:
     case IrOpcode::kStore:
+    case IrOpcode::kStorePair:
     case IrOpcode::kStackSlot:
     case IrOpcode::kWord32And:
     case IrOpcode::kWord32Or:
diff --git a/deps/v8/src/compiler/wasm-address-reassociation.cc b/deps/v8/src/compiler/wasm-address-reassociation.cc
new file mode 100644
index 00000000000000..3a571bbe7b23f5
--- /dev/null
+++ b/deps/v8/src/compiler/wasm-address-reassociation.cc
@@ -0,0 +1,192 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/wasm-address-reassociation.h"
+
+#include "src/compiler/common-operator.h"
+#include "src/compiler/graph.h"
+#include "src/compiler/js-graph.h"
+#include "src/compiler/machine-graph.h"
+#include "src/compiler/machine-operator.h"
+#include "src/compiler/node-matchers.h"
+#include "src/compiler/node-properties.h"
+#include "src/compiler/node.h"
+#include "src/compiler/opcodes.h"
+#include "src/compiler/operator.h"
+#include "src/zone/zone.h"
+
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+// Wasm address reassociation.
+//
+// wasm32 load and store operations use a 32-bit dynamic offset along with a
+// 32-bit static index to create a 33-bit effective address. This means that
+// to use a static index, greater than zero, the producer needs to prove that
+// the addition of the index won't overflow. However, if we're performing
+// address computations with 64-bits, we should be able to more readily use
+// immediate indexes.
+//
+// So, the purpose of this transform is to pattern match certain address
+// computations and reorganize the operands for more efficient code generation.
+//
+// Many addresses will be computed in the form like this:
+// - ProtectedLoad (IntPtrAdd (base_reg, immediate_offset), register_offset)
+// - ProtectedStore (IntPtrAdd (base_reg, immediate_offset), register_offset)
+
+// And this pass aims to transform this into:
+// - ProtectedLoad (IntPtrAdd (base_reg, register_offset), immediate_offset)
+// - ProtectedStore (IntPtrAdd (base_reg, register_offset), immediate_offset)
+//
+// This allows the reuse of a base pointer across multiple instructions, each of
+// which then has the opportunity to use an immediate offset.
+
+WasmAddressReassociation::WasmAddressReassociation(JSGraph* jsgraph, Zone* zone)
+    : graph_(jsgraph->graph()),
+      common_(jsgraph->common()),
+      machine_(jsgraph->machine()),
+      candidate_base_addrs_(zone),
+      candidates_(zone),
+      zone_(zone) {}
+
+void WasmAddressReassociation::Optimize() {
+  for (auto& candidate : candidates_) {
+    const CandidateAddressKey& key = candidate.first;
+    if (!ShouldTryOptimize(key)) continue;
+    // We've found multiple instances of addresses in the form
+    // object(base + imm_offset), reg_offset
+    // So, create a new object for these operations to share and then use an
+    // immediate offset:
+    // object(base, reg_offset), imm_offset
+    Node* new_object = CreateNewBase(key);
+    CandidateMemOps& mem_ops = candidate.second;
+    size_t num_nodes = mem_ops.GetNumNodes();
+    for (size_t i = 0; i < num_nodes; ++i) {
+      Node* mem_op = mem_ops.mem_op(i);
+      Node* imm_offset =
+          graph_->NewNode(common_->Int64Constant(mem_ops.imm_offset(i)));
+      ReplaceInputs(mem_op, new_object, imm_offset);
+    }
+  }
+}
+
+bool WasmAddressReassociation::ShouldTryOptimize(
+    const CandidateAddressKey& key) const {
+  // We already process the graph in terms of effect chains in an attempt to
+  // reduce the risk of creating large live-ranges, but also set a lower
+  // bound for the number of required users so that the benefits are more
+  // likely to outweigh any detrimental affects, such as additions being shared
+  // and so the number of operations is increased. Benchmarking showed two or
+  // more was a good heuristic.
+  return candidates_.at(key).GetNumNodes() > 1;
+}
+
+Node* WasmAddressReassociation::CreateNewBase(const CandidateAddressKey& key) {
+  CandidateBaseAddr& candidate_base_addr = candidate_base_addrs_.at(key);
+  Node* base = candidate_base_addr.base();
+  Node* reg_offset = candidate_base_addr.offset();
+  return graph_->NewNode(machine_->Int64Add(), base, reg_offset);
+}
+
+void WasmAddressReassociation::ReplaceInputs(Node* mem_op, Node* base,
+                                             Node* offset) {
+  DCHECK_GT(mem_op->InputCount(), 1);
+  DCHECK(NodeProperties::IsConstant(offset));
+  mem_op->ReplaceInput(0, base);
+  mem_op->ReplaceInput(1, offset);
+}
+
+void WasmAddressReassociation::VisitProtectedMemOp(Node* node,
+                                                   NodeId effect_chain) {
+  DCHECK(node->opcode() == IrOpcode::kProtectedLoad ||
+         node->opcode() == IrOpcode::kProtectedStore);
+
+  Node* base(node->InputAt(0));
+  Node* offset(node->InputAt(1));
+
+  if (base->opcode() == IrOpcode::kInt64Add &&
+      offset->opcode() == IrOpcode::kInt64Add) {
+    Int64BinopMatcher base_add(base);
+    Int64BinopMatcher offset_add(offset);
+    if (base_add.right().HasResolvedValue() &&
+        !base_add.left().HasResolvedValue() &&
+        offset_add.right().HasResolvedValue() &&
+        !offset_add.left().HasResolvedValue()) {
+      Node* base_reg = base_add.left().node();
+      Node* reg_offset = offset_add.left().node();
+      int64_t imm_offset =
+          base_add.right().ResolvedValue() + offset_add.right().ResolvedValue();
+      return AddCandidate(node, base_reg, reg_offset, imm_offset, effect_chain);
+    }
+  }
+  if (base->opcode() == IrOpcode::kInt64Add) {
+    Int64BinopMatcher base_add(base);
+    if (base_add.right().HasResolvedValue() &&
+        !base_add.left().HasResolvedValue()) {
+      Node* base_reg = base_add.left().node();
+      Node* reg_offset = node->InputAt(1);
+      int64_t imm_offset = base_add.right().ResolvedValue();
+      return AddCandidate(node, base_reg, reg_offset, imm_offset, effect_chain);
+    }
+  }
+  if (offset->opcode() == IrOpcode::kInt64Add) {
+    Int64BinopMatcher offset_add(offset);
+    if (offset_add.right().HasResolvedValue() &&
+        !offset_add.left().HasResolvedValue()) {
+      Node* base_reg = node->InputAt(0);
+      Node* reg_offset = offset_add.left().node();
+      int64_t imm_offset = offset_add.right().ResolvedValue();
+      return AddCandidate(node, base_reg, reg_offset, imm_offset, effect_chain);
+    }
+  }
+}
+
+void WasmAddressReassociation::AddCandidate(Node* mem_op, Node* base,
+                                            Node* reg_offset,
+                                            int64_t imm_offset,
+                                            NodeId effect_chain) {
+  // Sort base and offset so that the key is the same for either permutation.
+  if (base->id() > reg_offset->id()) {
+    std::swap(base, reg_offset);
+  }
+  CandidateAddressKey key =
+      std::make_tuple(base->id(), reg_offset->id(), effect_chain);
+  bool is_new =
+      candidate_base_addrs_.emplace(key, CandidateBaseAddr(base, reg_offset))
+          .second;
+  auto it = is_new ? candidates_.emplace(key, CandidateMemOps(zone_)).first
+                   : candidates_.find(key);
+  it->second.AddCandidate(mem_op, imm_offset);
+}
+
+bool WasmAddressReassociation::HasCandidateBaseAddr(
+    const CandidateAddressKey& key) const {
+  return candidate_base_addrs_.count(key);
+}
+
+void WasmAddressReassociation::CandidateMemOps::AddCandidate(
+    Node* mem_op, int64_t imm_offset) {
+  DCHECK(mem_op->opcode() == IrOpcode::kProtectedLoad ||
+         mem_op->opcode() == IrOpcode::kProtectedStore);
+  mem_ops_.push_back(mem_op);
+  imm_offsets_.push_back(imm_offset);
+}
+
+size_t WasmAddressReassociation::CandidateMemOps::GetNumNodes() const {
+  DCHECK_EQ(mem_ops_.size(), imm_offsets_.size());
+  return mem_ops_.size();
+}
+
+Node* WasmAddressReassociation::CandidateMemOps::mem_op(size_t i) const {
+  return mem_ops_[i];
+}
+
+int64_t WasmAddressReassociation::CandidateMemOps::imm_offset(size_t i) const {
+  return imm_offsets_[i];
+}
+
+}  // namespace compiler
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/compiler/wasm-address-reassociation.h b/deps/v8/src/compiler/wasm-address-reassociation.h
new file mode 100644
index 00000000000000..aaf62e84e88373
--- /dev/null
+++ b/deps/v8/src/compiler/wasm-address-reassociation.h
@@ -0,0 +1,86 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMPILER_WASM_ADDRESS_REASSOCIATION_H_
+#define V8_COMPILER_WASM_ADDRESS_REASSOCIATION_H_
+
+#include "src/compiler/node-marker.h"
+#include "src/zone/zone-containers.h"
+
+namespace v8 {
+namespace internal {
+
+namespace compiler {
+
+// Forward declarations.
+class CommonOperatorBuilder;
+class Graph;
+class JSGraph;
+class MachineOperatorBuilder;
+class Node;
+
+class V8_EXPORT_PRIVATE WasmAddressReassociation final {
+ public:
+  WasmAddressReassociation(JSGraph* jsgraph, Zone* zone);
+  WasmAddressReassociation(const WasmAddressReassociation&) = delete;
+  WasmAddressReassociation& operator=(const WasmAddressReassociation&) = delete;
+
+  void Optimize();
+  void VisitProtectedMemOp(Node* node, NodeId effect_chain);
+
+ private:
+  // Use the ids of nodes that represent a base and offset, together with an
+  // effect-chain root node id, to create a key for our candidate maps.
+  using CandidateAddressKey = std::tuple<NodeId, NodeId, NodeId>;
+
+  // Holds two nodes that could be summed to create a new base address. We
+  // store these in a map accessed with the above key.
+  class CandidateBaseAddr {
+   public:
+    CandidateBaseAddr(Node* base, Node* offset)
+        : base_reg_(base), offset_reg_(offset) {}
+    Node* base() const { return base_reg_; }
+    Node* offset() const { return offset_reg_; }
+
+   private:
+    Node* base_reg_;
+    Node* offset_reg_;
+  };
+
+  // For a given CandidateBaseAddr, collect loads and stores that could use the
+  // shared object along an immediate index. These are collected in a map which
+  // is accessed with a CandidateAddressKey.
+  class CandidateMemOps : ZoneObject {
+   public:
+    explicit CandidateMemOps(Zone* zone) : mem_ops_(zone), imm_offsets_(zone) {}
+    void AddCandidate(Node* mem_op, int64_t imm_offset);
+    size_t GetNumNodes() const;
+    Node* mem_op(size_t i) const;
+    int64_t imm_offset(size_t i) const;
+
+   private:
+    ZoneVector<Node*> mem_ops_;
+    ZoneVector<int64_t> imm_offsets_;
+  };
+
+  bool ShouldTryOptimize(const CandidateAddressKey& key) const;
+  Node* CreateNewBase(const CandidateAddressKey& key);
+  bool HasCandidateBaseAddr(const CandidateAddressKey& key) const;
+  void AddCandidate(Node* mem_op, Node* base, Node* reg_offset,
+                    int64_t imm_offset, NodeId effect_chain);
+  void ReplaceInputs(Node* mem_op, Node* object, Node* index);
+
+  Graph* const graph_;
+  CommonOperatorBuilder* common_;
+  MachineOperatorBuilder* machine_;
+  ZoneMap<CandidateAddressKey, CandidateBaseAddr> candidate_base_addrs_;
+  ZoneMap<CandidateAddressKey, CandidateMemOps> candidates_;
+  Zone* const zone_;
+};
+
+}  // namespace compiler
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_COMPILER_WASM_ADDRESS_REASSOCIATION_H_
diff --git a/deps/v8/src/compiler/wasm-call-descriptors.cc b/deps/v8/src/compiler/wasm-call-descriptors.cc
index 14633ea9feb17b..8dca33c3237d0e 100644
--- a/deps/v8/src/compiler/wasm-call-descriptors.cc
+++ b/deps/v8/src/compiler/wasm-call-descriptors.cc
@@ -13,8 +13,6 @@ namespace v8::internal::compiler {
 WasmCallDescriptors::WasmCallDescriptors(AccountingAllocator* allocator)
     : zone_(new Zone(allocator, "wasm_call_descriptors")) {
   for (int i = 0; i < kNumCallModes; i++) {
-    i64_to_bigint_descriptors_[i] = compiler::GetBuiltinCallDescriptor(
-        Builtin::kI64ToBigInt, zone_.get(), static_cast<StubCallMode>(i));
     bigint_to_i64_descriptors_[i] = compiler::GetBuiltinCallDescriptor(
         Builtin::kBigIntToI64, zone_.get(), static_cast<StubCallMode>(i));
     bigint_to_i64_descriptor_with_framestate_ =
@@ -22,8 +20,6 @@ WasmCallDescriptors::WasmCallDescriptors(AccountingAllocator* allocator)
                                            StubCallMode::kCallBuiltinPointer,
                                            true);
 #if V8_TARGET_ARCH_32_BIT
-    i32pair_to_bigint_descriptors_[i] = compiler::GetBuiltinCallDescriptor(
-        Builtin::kI32PairToBigInt, zone_.get(), static_cast<StubCallMode>(i));
     bigint_to_i32pair_descriptors_[i] = compiler::GetBuiltinCallDescriptor(
         Builtin::kBigIntToI32Pair, zone_.get(), static_cast<StubCallMode>(i));
     bigint_to_i32pair_descriptor_with_framestate_ =
@@ -40,9 +36,6 @@ compiler::CallDescriptor* WasmCallDescriptors::GetLoweredCallDescriptor(
   // As long as we only have six candidates, linear search is fine.
   // If we ever support more cases, we could use a hash map or something.
   for (int i = 0; i < kNumCallModes; i++) {
-    if (original == i64_to_bigint_descriptors_[i]) {
-      return i32pair_to_bigint_descriptors_[i];
-    }
     if (original == bigint_to_i64_descriptors_[i]) {
       return bigint_to_i32pair_descriptors_[i];
     }
diff --git a/deps/v8/src/compiler/wasm-call-descriptors.h b/deps/v8/src/compiler/wasm-call-descriptors.h
index 8f3fcdcbc8e573..7d0a6a1a95ba79 100644
--- a/deps/v8/src/compiler/wasm-call-descriptors.h
+++ b/deps/v8/src/compiler/wasm-call-descriptors.h
@@ -25,9 +25,6 @@ class WasmCallDescriptors {
  public:
   explicit WasmCallDescriptors(AccountingAllocator* allocator);
 
-  compiler::CallDescriptor* GetI64ToBigIntDescriptor(StubCallMode mode) {
-    return i64_to_bigint_descriptors_[static_cast<size_t>(mode)];
-  }
   compiler::CallDescriptor* GetBigIntToI64Descriptor(StubCallMode mode,
                                                      bool needs_frame_state) {
     if (needs_frame_state) {
@@ -50,12 +47,10 @@ class WasmCallDescriptors {
 
   std::unique_ptr<Zone> zone_;
 
-  compiler::CallDescriptor* i64_to_bigint_descriptors_[kNumCallModes];
   compiler::CallDescriptor* bigint_to_i64_descriptors_[kNumCallModes];
   compiler::CallDescriptor* bigint_to_i64_descriptor_with_framestate_;
 
 #if V8_TARGET_ARCH_32_BIT
-  compiler::CallDescriptor* i32pair_to_bigint_descriptors_[kNumCallModes];
   compiler::CallDescriptor* bigint_to_i32pair_descriptors_[kNumCallModes];
   compiler::CallDescriptor* bigint_to_i32pair_descriptor_with_framestate_;
 #endif  // V8_TARGET_ARCH_32_BIT
diff --git a/deps/v8/src/compiler/wasm-compiler-definitions.cc b/deps/v8/src/compiler/wasm-compiler-definitions.cc
new file mode 100644
index 00000000000000..855002b2b4bcdf
--- /dev/null
+++ b/deps/v8/src/compiler/wasm-compiler-definitions.cc
@@ -0,0 +1,109 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/wasm-compiler-definitions.h"
+
+#include "src/base/strings.h"
+#include "src/codegen/signature.h"
+#include "src/compiler/linkage.h"
+#include "src/wasm/compilation-environment.h"
+#include "src/wasm/wasm-linkage.h"
+#include "src/wasm/wasm-module.h"
+
+namespace v8::internal::compiler {
+
+base::Vector<const char> GetDebugName(Zone* zone,
+                                      const wasm::WasmModule* module,
+                                      const wasm::WireBytesStorage* wire_bytes,
+                                      int index) {
+  base::Optional<wasm::ModuleWireBytes> module_bytes =
+      wire_bytes->GetModuleBytes();
+  if (module_bytes.has_value() &&
+      (v8_flags.trace_turbo || v8_flags.trace_turbo_scheduled ||
+       v8_flags.trace_turbo_graph || v8_flags.print_wasm_code)) {
+    wasm::WireBytesRef name = module->lazily_generated_names.LookupFunctionName(
+        module_bytes.value(), index);
+    if (!name.is_empty()) {
+      int name_len = name.length();
+      char* index_name = zone->AllocateArray<char>(name_len);
+      memcpy(index_name, module_bytes->start() + name.offset(), name_len);
+      return base::Vector<const char>(index_name, name_len);
+    }
+  }
+
+  constexpr int kBufferLength = 24;
+
+  base::EmbeddedVector<char, kBufferLength> name_vector;
+  int name_len = SNPrintF(name_vector, "wasm-function#%d", index);
+  DCHECK(name_len > 0 && name_len < name_vector.length());
+
+  char* index_name = zone->AllocateArray<char>(name_len);
+  memcpy(index_name, name_vector.begin(), name_len);
+  return base::Vector<const char>(index_name, name_len);
+}
+
+MachineRepresentation GetMachineRepresentation(wasm::ValueType type) {
+  return type.machine_representation();
+}
+
+MachineRepresentation GetMachineRepresentation(MachineType type) {
+  return type.representation();
+}
+
+// General code uses the above configuration data.
+CallDescriptor* GetWasmCallDescriptor(Zone* zone, const wasm::FunctionSig* fsig,
+                                      WasmCallKind call_kind,
+                                      bool need_frame_state) {
+  // The extra here is to accomodate the instance object as first parameter
+  // and, when specified, the additional callable.
+  bool extra_callable_param =
+      call_kind == kWasmImportWrapper || call_kind == kWasmCapiFunction;
+
+  int parameter_slots;
+  int return_slots;
+  LocationSignature* location_sig = BuildLocations(
+      zone, fsig, extra_callable_param, &parameter_slots, &return_slots);
+
+  const RegList kCalleeSaveRegisters;
+  const DoubleRegList kCalleeSaveFPRegisters;
+
+  // The target for wasm calls is always a code object.
+  MachineType target_type = MachineType::Pointer();
+  LinkageLocation target_loc = LinkageLocation::ForAnyRegister(target_type);
+
+  CallDescriptor::Kind descriptor_kind;
+  if (call_kind == kWasmFunction) {
+    descriptor_kind = CallDescriptor::kCallWasmFunction;
+  } else if (call_kind == kWasmImportWrapper) {
+    descriptor_kind = CallDescriptor::kCallWasmImportWrapper;
+  } else {
+    DCHECK_EQ(call_kind, kWasmCapiFunction);
+    descriptor_kind = CallDescriptor::kCallWasmCapiFunction;
+  }
+
+  CallDescriptor::Flags flags = need_frame_state
+                                    ? CallDescriptor::kNeedsFrameState
+                                    : CallDescriptor::kNoFlags;
+  return zone->New<CallDescriptor>(       // --
+      descriptor_kind,                    // kind
+      target_type,                        // target MachineType
+      target_loc,                         // target location
+      location_sig,                       // location_sig
+      parameter_slots,                    // parameter slot count
+      compiler::Operator::kNoProperties,  // properties
+      kCalleeSaveRegisters,               // callee-saved registers
+      kCalleeSaveFPRegisters,             // callee-saved fp regs
+      flags,                              // flags
+      "wasm-call",                        // debug name
+      StackArgumentOrder::kDefault,       // order of the arguments in the stack
+      RegList{},                          // allocatable registers
+      return_slots);                      // return slot count
+}
+
+std::ostream& operator<<(std::ostream& os, CheckForNull null_check) {
+  return os << (null_check == kWithoutNullCheck ? "no null check"
+                                                : "null check");
+}
+
+}  // namespace v8::internal::compiler
diff --git a/deps/v8/src/compiler/wasm-compiler-definitions.h b/deps/v8/src/compiler/wasm-compiler-definitions.h
index 34c5228d193750..b10522bc0f825b 100644
--- a/deps/v8/src/compiler/wasm-compiler-definitions.h
+++ b/deps/v8/src/compiler/wasm-compiler-definitions.h
@@ -13,11 +13,24 @@
 #include <ostream>
 
 #include "src/base/functional.h"
+#include "src/base/vector.h"
+#include "src/compiler/linkage.h"
 #include "src/wasm/value-type.h"
+#include "src/wasm/wasm-linkage.h"
+#include "src/zone/zone.h"
 
 namespace v8 {
 namespace internal {
+class LinkageLocation;
+
+namespace wasm {
+struct WasmModule;
+class WireBytesStorage;
+struct ModuleWireBytes;
+}  // namespace wasm
+
 namespace compiler {
+class CallDescriptor;
 
 // If {to} is nullable, it means that null passes the check.
 // {from} may change in compiler optimization passes as the object's type gets
@@ -44,12 +57,109 @@ V8_INLINE bool operator==(const WasmTypeCheckConfig& p1,
 
 static constexpr int kCharWidthBailoutSentinel = 3;
 
-enum NullCheckStrategy { kExplicitNullChecks, kTrapHandler };
+enum class NullCheckStrategy { kExplicit, kTrapHandler };
+
+enum class EnforceBoundsCheck : bool {  // --
+  kNeedsBoundsCheck = true,
+  kCanOmitBoundsCheck = false
+};
+
+enum class BoundsCheckResult {
+  // Dynamically checked (using 1-2 conditional branches).
+  kDynamicallyChecked,
+  // OOB handled via the trap handler.
+  kTrapHandler,
+  // Statically known to be in bounds.
+  kInBounds
+};
 
 // Static knowledge about whether a wasm-gc operation, such as struct.get, needs
 // a null check.
 enum CheckForNull { kWithoutNullCheck, kWithNullCheck };
+std::ostream& operator<<(std::ostream& os, CheckForNull null_check);
+
+base::Vector<const char> GetDebugName(Zone* zone,
+                                      const wasm::WasmModule* module,
+                                      const wasm::WireBytesStorage* wire_bytes,
+                                      int index);
+enum WasmCallKind { kWasmFunction, kWasmImportWrapper, kWasmCapiFunction };
+
+V8_EXPORT_PRIVATE CallDescriptor* GetWasmCallDescriptor(
+    Zone* zone, const wasm::FunctionSig* signature,
+    WasmCallKind kind = kWasmFunction, bool need_frame_state = false);
+
+MachineRepresentation GetMachineRepresentation(wasm::ValueType type);
+
+MachineRepresentation GetMachineRepresentation(MachineType type);
+
+template <typename T>
+LocationSignature* BuildLocations(Zone* zone, const Signature<T>* sig,
+                                  bool extra_callable_param,
+                                  int* parameter_slots, int* return_slots) {
+  int extra_params = extra_callable_param ? 2 : 1;
+  LocationSignature::Builder locations(zone, sig->return_count(),
+                                       sig->parameter_count() + extra_params);
 
+  // Add register and/or stack parameter(s).
+  wasm::LinkageLocationAllocator params(
+      wasm::kGpParamRegisters, wasm::kFpParamRegisters, 0 /* no slot offset */);
+
+  // The instance object.
+  locations.AddParam(params.Next(MachineRepresentation::kTaggedPointer));
+  const size_t param_offset = 1;  // Actual params start here.
+
+  // Parameters are separated into two groups (first all untagged, then all
+  // tagged parameters). This allows for easy iteration of tagged parameters
+  // during frame iteration.
+  const size_t parameter_count = sig->parameter_count();
+  bool has_tagged_param = false;
+  for (size_t i = 0; i < parameter_count; i++) {
+    MachineRepresentation param = GetMachineRepresentation(sig->GetParam(i));
+    // Skip tagged parameters (e.g. any-ref).
+    if (IsAnyTagged(param)) {
+      has_tagged_param = true;
+      continue;
+    }
+    auto l = params.Next(param);
+    locations.AddParamAt(i + param_offset, l);
+  }
+
+  // End the untagged area, so tagged slots come after.
+  params.EndSlotArea();
+
+  if (has_tagged_param) {
+    for (size_t i = 0; i < parameter_count; i++) {
+      MachineRepresentation param = GetMachineRepresentation(sig->GetParam(i));
+      // Skip untagged parameters.
+      if (!IsAnyTagged(param)) continue;
+      auto l = params.Next(param);
+      locations.AddParamAt(i + param_offset, l);
+    }
+  }
+
+  // Import call wrappers have an additional (implicit) parameter, the callable.
+  // For consistency with JS, we use the JSFunction register.
+  if (extra_callable_param) {
+    locations.AddParam(LinkageLocation::ForRegister(
+        kJSFunctionRegister.code(), MachineType::TaggedPointer()));
+  }
+
+  *parameter_slots = AddArgumentPaddingSlots(params.NumStackSlots());
+
+  // Add return location(s).
+  wasm::LinkageLocationAllocator rets(
+      wasm::kGpReturnRegisters, wasm::kFpReturnRegisters, *parameter_slots);
+
+  const size_t return_count = locations.return_count_;
+  for (size_t i = 0; i < return_count; i++) {
+    MachineRepresentation ret = GetMachineRepresentation(sig->GetReturn(i));
+    locations.AddReturn(rets.Next(ret));
+  }
+
+  *return_slots = rets.NumStackSlots();
+
+  return locations.Get();
+}
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/wasm-compiler.cc b/deps/v8/src/compiler/wasm-compiler.cc
index 2d9f56143d2dcb..a1dd77d2cb5260 100644
--- a/deps/v8/src/compiler/wasm-compiler.cc
+++ b/deps/v8/src/compiler/wasm-compiler.cc
@@ -67,6 +67,10 @@ namespace compiler {
 
 namespace {
 
+constexpr MachineType kMaybeSandboxedPointer =
+    V8_ENABLE_SANDBOX_BOOL ? MachineType::SandboxedPointer()
+                           : MachineType::Pointer();
+
 #define FATAL_UNSUPPORTED_OPCODE(opcode)        \
   FATAL("Unsupported opcode 0x%x:%s", (opcode), \
         wasm::WasmOpcodes::OpcodeName(opcode));
@@ -147,9 +151,15 @@ WasmGraphBuilder::WasmGraphBuilder(
       null_check_strategy_(trap_handler::IsTrapHandlerEnabled() &&
                                    V8_STATIC_ROOTS_BOOL
                                ? NullCheckStrategy::kTrapHandler
-                               : NullCheckStrategy::kExplicitNullChecks) {
+                               : NullCheckStrategy::kExplicit) {
   DCHECK_EQ(isolate == nullptr, parameter_mode_ != kNoSpecialParameterMode);
-  DCHECK_IMPLIES(env && env->bounds_checks == wasm::kTrapHandler,
+  DCHECK_IMPLIES(env && env->module &&
+                     std::any_of(env->module->memories.begin(),
+                                 env->module->memories.end(),
+                                 [](auto& memory) {
+                                   return memory.bounds_checks ==
+                                          wasm::kTrapHandler;
+                                 }),
                  trap_handler::IsTrapHandlerEnabled());
   DCHECK_NOT_NULL(mcgraph_);
 }
@@ -159,8 +169,15 @@ WasmGraphBuilder::WasmGraphBuilder(
 WasmGraphBuilder::~WasmGraphBuilder() = default;
 
 bool WasmGraphBuilder::TryWasmInlining(int fct_index,
-                                       wasm::NativeModule* native_module) {
-  DCHECK(v8_flags.experimental_wasm_js_inlining);
+                                       wasm::NativeModule* native_module,
+                                       int inlining_id) {
+#define TRACE(x)                         \
+  do {                                   \
+    if (v8_flags.trace_turbo_inlining) { \
+      StdoutStream() << x << "\n";       \
+    }                                    \
+  } while (false)
+
   DCHECK(native_module->enabled_features().has_gc());
   DCHECK(native_module->HasWireBytes());
   const wasm::WasmModule* module = native_module->module();
@@ -168,13 +185,15 @@ bool WasmGraphBuilder::TryWasmInlining(int fct_index,
   // TODO(mliedtke): What would be a proper maximum size?
   const uint32_t kMaxWasmInlineeSize = 30;
   if (inlinee.code.length() > kMaxWasmInlineeSize) {
+    TRACE("- not inlining: function body is larger than max inlinee size ("
+          << inlinee.code.length() << " > " << kMaxWasmInlineeSize << ")");
     return false;
   }
   if (inlinee.imported) {
-    // Inlining of imported functions is not supported.
+    TRACE("- not inlining: function is imported");
     return false;
   }
-  base::Vector<const byte> bytes(native_module->wire_bytes().SubVector(
+  base::Vector<const uint8_t> bytes(native_module->wire_bytes().SubVector(
       inlinee.code.offset(), inlinee.code.end_offset()));
   const wasm::FunctionBody inlinee_body(inlinee.sig, inlinee.code.offset(),
                                         bytes.begin(), bytes.end());
@@ -188,12 +207,20 @@ bool WasmGraphBuilder::TryWasmInlining(int fct_index,
       // Since this situation is highly unlikely though, we just ignore this
       // inlinee and move on. The same validation error will be triggered
       // again when actually compiling the invalid function.
+      TRACE("- not inlining: function body is invalid");
       return false;
     }
     module->set_function_validated(fct_index);
   }
-  return WasmIntoJSInliner::TryInlining(graph()->zone(), module, mcgraph_,
-                                        inlinee_body, bytes);
+  bool result = WasmIntoJSInliner::TryInlining(
+      graph()->zone(), module, mcgraph_, inlinee_body, bytes,
+      source_position_table_, inlining_id);
+  TRACE((
+      result
+          ? "- inlining"
+          : "- not inlining: function body contains unsupported instructions"));
+  return result;
+#undef TRACE
 }
 
 void WasmGraphBuilder::Start(unsigned params) {
@@ -201,7 +228,7 @@ void WasmGraphBuilder::Start(unsigned params) {
   graph()->SetStart(start);
   SetEffectControl(start);
   // Initialize parameter nodes.
-  parameters_ = zone_->NewArray<Node*>(params);
+  parameters_ = zone_->AllocateArray<Node*>(params);
   for (unsigned i = 0; i < params; i++) {
     parameters_[i] = nullptr;
   }
@@ -331,8 +358,9 @@ Node* WasmGraphBuilder::EffectPhi(unsigned count, Node** effects_and_control) {
 }
 
 Node* WasmGraphBuilder::RefNull(wasm::ValueType type) {
-  return (enabled_features_.has_gc() && parameter_mode_ == kInstanceMode)
-             ? gasm_->Null(type)
+  // We immediately lower null in wrappers, as they do not go through a lowering
+  // phase.
+  return parameter_mode_ == kInstanceMode ? gasm_->Null(type)
          : (type == wasm::kWasmExternRef || type == wasm::kWasmNullExternRef)
              ? LOAD_ROOT(NullValue, null_value)
              : LOAD_ROOT(WasmNull, wasm_null);
@@ -398,9 +426,7 @@ void WasmGraphBuilder::StackCheck(
     WasmInstanceCacheNodes* shared_memory_instance_cache,
     wasm::WasmCodePosition position) {
   DCHECK_NOT_NULL(env_);  // Wrappers don't get stack checks.
-  if (!v8_flags.wasm_stack_checks || !env_->runtime_exception_support) {
-    return;
-  }
+  if (!v8_flags.wasm_stack_checks) return;
 
   Node* limit_address =
       LOAD_INSTANCE_FIELD(StackLimitAddress, MachineType::Pointer());
@@ -412,9 +438,7 @@ void WasmGraphBuilder::StackCheck(
       mcgraph()->machine()->StackPointerGreaterThan(StackCheckKind::kWasm),
       limit, effect()));
 
-  Node* if_true;
-  Node* if_false;
-  BranchExpectTrue(check, &if_true, &if_false);
+  auto [if_true, if_false] = BranchExpectTrue(check);
 
   if (stack_check_call_operator_ == nullptr) {
     // Build and cache the stack check call operator and the constant
@@ -457,10 +481,10 @@ void WasmGraphBuilder::StackCheck(
   // them in contexts where load elimination would eliminate the reload.
   // Therefore, we use plain Load nodes which are not subject to load
   // elimination.
+  DCHECK_IMPLIES(shared_memory_instance_cache, has_cached_memory());
   Node* new_memory_size = shared_memory_instance_cache == nullptr
                               ? nullptr
-                              : LOAD_INSTANCE_FIELD_NO_ELIMINATION(
-                                    MemorySize, MachineType::UintPtr());
+                              : LoadMemSize(cached_memory_index_);
 
   Node* merge = Merge(if_true, control());
   Node* ephi_inputs[] = {check, effect(), merge};
@@ -1103,19 +1127,25 @@ Node* WasmGraphBuilder::Simd128Constant(const uint8_t value[16]) {
   return graph()->NewNode(mcgraph()->machine()->S128Const(value));
 }
 
-Node* WasmGraphBuilder::BranchNoHint(Node* cond, Node** true_node,
-                                     Node** false_node) {
-  return gasm_->Branch(cond, true_node, false_node, BranchHint::kNone);
+std::tuple<Node*, Node*> WasmGraphBuilder::BranchNoHint(Node* cond) {
+  Node* true_node;
+  Node* false_node;
+  gasm_->Branch(cond, &true_node, &false_node, BranchHint::kNone);
+  return {true_node, false_node};
 }
 
-Node* WasmGraphBuilder::BranchExpectFalse(Node* cond, Node** true_node,
-                                          Node** false_node) {
-  return gasm_->Branch(cond, true_node, false_node, BranchHint::kFalse);
+std::tuple<Node*, Node*> WasmGraphBuilder::BranchExpectFalse(Node* cond) {
+  Node* true_node;
+  Node* false_node;
+  gasm_->Branch(cond, &true_node, &false_node, BranchHint::kFalse);
+  return {true_node, false_node};
 }
 
-Node* WasmGraphBuilder::BranchExpectTrue(Node* cond, Node** true_node,
-                                         Node** false_node) {
-  return gasm_->Branch(cond, true_node, false_node, BranchHint::kTrue);
+std::tuple<Node*, Node*> WasmGraphBuilder::BranchExpectTrue(Node* cond) {
+  Node* true_node;
+  Node* false_node;
+  gasm_->Branch(cond, &true_node, &false_node, BranchHint::kTrue);
+  return {true_node, false_node};
 }
 
 Node* WasmGraphBuilder::Select(Node *cond, Node* true_node,
@@ -1140,24 +1170,15 @@ Node* WasmGraphBuilder::Select(Node *cond, Node* true_node,
                                        false_node);
   }
   // Default to control-flow.
-  Node* controls[2];
-  BranchNoHint(cond, &controls[0], &controls[1]);
-  Node* merge = Merge(2, controls);
+
+  auto [if_true, if_false] = BranchNoHint(cond);
+  Node* merge = Merge(if_true, if_false);
   SetControl(merge);
   Node* inputs[] = {true_node, false_node, merge};
   return Phi(type, 2, inputs);
 }
 
 TrapId WasmGraphBuilder::GetTrapIdForTrap(wasm::TrapReason reason) {
-  // TODO(wasm): "!env_" should not happen when compiling an actual wasm
-  // function.
-  if (!env_ || !env_->runtime_exception_support) {
-    // We use TrapId::kInvalid as a marker to tell the code generator
-    // to generate a call to a testing c-function instead of a runtime
-    // stub. This code should only be called from a cctest.
-    return TrapId::kInvalid;
-  }
-
   switch (reason) {
 #define TRAPREASON_TO_TRAPID(name)                                             \
   case wasm::k##name:                                                          \
@@ -1176,14 +1197,14 @@ void WasmGraphBuilder::TrapIfTrue(wasm::TrapReason reason, Node* cond,
                                   wasm::WasmCodePosition position) {
   TrapId trap_id = GetTrapIdForTrap(reason);
   gasm_->TrapIf(cond, trap_id);
-  SetSourcePosition(control(), position);
+  SetSourcePosition(effect(), position);
 }
 
 void WasmGraphBuilder::TrapIfFalse(wasm::TrapReason reason, Node* cond,
                                    wasm::WasmCodePosition position) {
   TrapId trap_id = GetTrapIdForTrap(reason);
   gasm_->TrapUnless(cond, trap_id);
-  SetSourcePosition(control(), position);
+  SetSourcePosition(effect(), position);
 }
 
 Node* WasmGraphBuilder::AssertNotNull(Node* object, wasm::ValueType type,
@@ -1247,6 +1268,7 @@ Node* WasmGraphBuilder::Return(base::Vector<Node*> vals) {
   unsigned count = static_cast<unsigned>(vals.size());
   base::SmallVector<Node*, 8> buf(count + 3);
 
+  // TODOC: What is the meaning of the 0-constant?
   buf[0] = Int32Constant(0);
   if (count > 0) {
     memcpy(buf.data() + 1, vals.begin(), sizeof(void*) * count);
@@ -2137,12 +2159,14 @@ Node* WasmGraphBuilder::BuildCcallConvertFloat(Node* input,
   return tl_d.Phi(int_ty.representation(), nan_val, load);
 }
 
-Node* WasmGraphBuilder::MemoryGrow(Node* input) {
+Node* WasmGraphBuilder::MemoryGrow(const wasm::WasmMemory* memory,
+                                   Node* input) {
   needs_stack_check_ = true;
-  if (!env_->module->is_memory64) {
+  if (!memory->is_memory64) {
     // For 32-bit memories, just call the builtin.
     return gasm_->CallRuntimeStub(wasm::WasmCode::kWasmMemoryGrow,
-                                  Operator::kNoThrow, input);
+                                  Operator::kNoThrow,
+                                  gasm_->Int32Constant(memory->index), input);
   }
 
   // If the input is not a positive int32, growing will always fail
@@ -2157,7 +2181,7 @@ Node* WasmGraphBuilder::MemoryGrow(Node* input) {
 
   Node* grow_result = gasm_->ChangeInt32ToInt64(gasm_->CallRuntimeStub(
       wasm::WasmCode::kWasmMemoryGrow, Operator::kNoThrow,
-      gasm_->TruncateInt64ToInt32(input)));
+      gasm_->Int32Constant(memory->index), gasm_->TruncateInt64ToInt32(input)));
 
   Node* diamond_result = is_32_bit.Phi(MachineRepresentation::kWord64,
                                        grow_result, gasm_->Int64Constant(-1));
@@ -2282,6 +2306,20 @@ Node* WasmGraphBuilder::Rethrow(Node* except_obj) {
                                 Operator::kNoProperties, except_obj);
 }
 
+Node* WasmGraphBuilder::IsExceptionTagUndefined(Node* tag) {
+  return gasm_->TaggedEqual(tag, UndefinedValue());
+}
+
+Node* WasmGraphBuilder::LoadJSTag() {
+  Node* context =
+      LOAD_INSTANCE_FIELD(NativeContext, MachineType::TaggedPointer());
+  Node* tag_obj =
+      gasm_->Load(MachineType::TaggedPointer(), context,
+                  NativeContext::SlotOffset(Context::WASM_JS_TAG_INDEX));
+  return gasm_->Load(MachineType::TaggedPointer(), tag_obj,
+                     wasm::ObjectAccess::ToTagged(WasmTagObject::kTagOffset));
+}
+
 Node* WasmGraphBuilder::ExceptionTagEqual(Node* caught_tag,
                                           Node* expected_tag) {
   return gasm_->WordEqual(caught_tag, expected_tag);
@@ -2366,10 +2404,8 @@ Node* WasmGraphBuilder::BuildI32DivS(Node* left, Node* right,
                                      wasm::WasmCodePosition position) {
   ZeroCheck32(wasm::kTrapDivByZero, right, position);
   Node* previous_effect = effect();
-  Node* denom_is_m1;
-  Node* denom_is_not_m1;
-  BranchExpectFalse(gasm_->Word32Equal(right, Int32Constant(-1)), &denom_is_m1,
-                    &denom_is_not_m1);
+  auto [denom_is_m1, denom_is_not_m1] =
+      BranchExpectFalse(gasm_->Word32Equal(right, Int32Constant(-1)));
   SetControl(denom_is_m1);
   TrapIfEq32(wasm::kTrapDivUnrepresentable, left, kMinInt, position);
   Node* merge = Merge(control(), denom_is_not_m1);
@@ -2549,7 +2585,7 @@ Node* WasmGraphBuilder::BuildI32AsmjsDivU(Node* left, Node* right) {
     return gasm_->Uint32Div(left, right);
   }
 
-  // Explicit check for x % 0.
+  // Explicit check for x / 0.
   Diamond z(graph(), mcgraph()->common(),
             gasm_->Word32Equal(right, Int32Constant(0)), BranchHint::kFalse);
   z.Chain(control());
@@ -2579,10 +2615,8 @@ Node* WasmGraphBuilder::BuildI64DivS(Node* left, Node* right,
   }
   ZeroCheck64(wasm::kTrapDivByZero, right, position);
   Node* previous_effect = effect();
-  Node* denom_is_m1;
-  Node* denom_is_not_m1;
-  BranchExpectFalse(gasm_->Word64Equal(right, Int64Constant(-1)), &denom_is_m1,
-                    &denom_is_not_m1);
+  auto [denom_is_m1, denom_is_not_m1] =
+      BranchExpectFalse(gasm_->Word64Equal(right, Int64Constant(-1)));
   SetControl(denom_is_m1);
   TrapIfEq64(wasm::kTrapDivUnrepresentable, left,
              std::numeric_limits<int64_t>::min(), position);
@@ -2651,7 +2685,9 @@ Node* WasmGraphBuilder::BuildDiv64Call(Node* left, Node* right,
 }
 
 Node* WasmGraphBuilder::IsNull(Node* object, wasm::ValueType type) {
-  return (enabled_features_.has_gc() && parameter_mode_ == kInstanceMode)
+  // We immediately lower null in wrappers, as they do not go through a lowering
+  // phase.
+  return parameter_mode_ == kInstanceMode
              ? gasm_->IsNull(object, type)
              : gasm_->TaggedEqual(object, RefNull(type));
 }
@@ -2784,7 +2820,7 @@ Node* WasmGraphBuilder::BuildImportCall(const wasm::FunctionSig* sig,
       gasm_->IntMul(func_index_intptr,
                     gasm_->IntPtrConstant(kSystemPointerSize)),
       gasm_->IntPtrConstant(
-          wasm::ObjectAccess::ToTagged(FixedArray::kObjectsOffset)));
+          wasm::ObjectAccess::ToTagged(FixedAddressArray::kHeaderSize)));
   Node* imported_targets = LOAD_INSTANCE_FIELD(ImportedFunctionTargets,
                                                MachineType::TaggedPointer());
   Node* target_node = gasm_->LoadImmutableFromObject(MachineType::Pointer(),
@@ -2845,9 +2881,9 @@ void WasmGraphBuilder::LoadIndirectFunctionTable(uint32_t table_index,
                                               MachineType::Uint32());
     }
     *ift_sig_ids = LOAD_MUTABLE_INSTANCE_FIELD(IndirectFunctionTableSigIds,
-                                               MachineType::Pointer());
+                                               MachineType::TaggedPointer());
     *ift_targets = LOAD_MUTABLE_INSTANCE_FIELD(IndirectFunctionTableTargets,
-                                               MachineType::Pointer());
+                                               MachineType::TaggedPointer());
     *ift_instances = LOAD_MUTABLE_INSTANCE_FIELD(IndirectFunctionTableRefs,
                                                  MachineType::TaggedPointer());
     return;
@@ -2864,11 +2900,11 @@ void WasmGraphBuilder::LoadIndirectFunctionTable(uint32_t table_index,
   }
 
   *ift_sig_ids = gasm_->LoadFromObject(
-      MachineType::Pointer(), ift_table,
+      MachineType::TaggedPointer(), ift_table,
       wasm::ObjectAccess::ToTagged(WasmIndirectFunctionTable::kSigIdsOffset));
 
   *ift_targets = gasm_->LoadFromObject(
-      MachineType::Pointer(), ift_table,
+      MachineType::TaggedPointer(), ift_table,
       wasm::ObjectAccess::ToTagged(WasmIndirectFunctionTable::kTargetsOffset));
 
   *ift_instances = gasm_->LoadFromObject(
@@ -2894,6 +2930,7 @@ Node* WasmGraphBuilder::BuildIndirectCall(uint32_t table_index,
                             &ift_instances);
 
   Node* key = args[0];
+  Node* key_intptr = gasm_->BuildChangeUint32ToUintPtr(key);
 
   // Bounds check against the table size.
   Node* in_bounds = gasm_->Uint32LessThan(key, ift_size);
@@ -2914,10 +2951,8 @@ Node* WasmGraphBuilder::BuildIndirectCall(uint32_t table_index,
         MachineType::Uint32(), isorecursive_canonical_types,
         gasm_->IntPtrConstant(sig_index * kInt32Size));
 
-    Node* int32_scaled_key = gasm_->BuildChangeUint32ToUintPtr(
-        gasm_->Word32Shl(key, Int32Constant(2)));
-    Node* loaded_sig = gasm_->LoadFromObject(MachineType::Int32(), ift_sig_ids,
-                                             int32_scaled_key);
+    Node* loaded_sig = gasm_->LoadByteArrayElement(ift_sig_ids, key_intptr,
+                                                   MachineType::Int32());
     Node* sig_match = gasm_->Word32Equal(loaded_sig, expected_sig_id);
 
     if (enabled_features_.has_gc() &&
@@ -2978,25 +3013,18 @@ Node* WasmGraphBuilder::BuildIndirectCall(uint32_t table_index,
       TrapIfFalse(wasm::kTrapFuncSigMismatch, sig_match, position);
     }
   } else if (needs_null_check) {
-    Node* int32_scaled_key = gasm_->BuildChangeUint32ToUintPtr(
-        gasm_->Word32Shl(key, Int32Constant(2)));
-    Node* loaded_sig = gasm_->LoadFromObject(MachineType::Int32(), ift_sig_ids,
-                                             int32_scaled_key);
+    Node* loaded_sig = gasm_->LoadByteArrayElement(ift_sig_ids, key_intptr,
+                                                   MachineType::Int32());
     TrapIfTrue(wasm::kTrapFuncSigMismatch,
                gasm_->Word32Equal(loaded_sig, Int32Constant(-1)), position);
   }
 
-  Node* key_intptr = gasm_->BuildChangeUint32ToUintPtr(key);
-
   Node* target_instance = gasm_->LoadFixedArrayElement(
       ift_instances, key_intptr, MachineType::TaggedPointer());
 
-  Node* intptr_scaled_key =
-      gasm_->IntMul(key_intptr, gasm_->IntPtrConstant(kSystemPointerSize));
-
-  Node* target = gasm_->LoadFromObject(MachineType::Pointer(), ift_targets,
-                                       intptr_scaled_key);
-
+  Node* target = gasm_->LoadExternalPointerArrayElement(
+      ift_targets, key_intptr, kWasmIndirectFunctionTargetTag,
+      BuildLoadIsolateRoot());
   args[0] = target;
 
   const wasm::FunctionSig* sig = env_->module->signature(sig_index);
@@ -3009,11 +3037,32 @@ Node* WasmGraphBuilder::BuildIndirectCall(uint32_t table_index,
   }
 }
 
+Node* WasmGraphBuilder::BuildLoadCodePointerFromObject(Node* object,
+                                                       int field_offset) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  Node* handle =
+      gasm_->LoadFromObject(MachineType::Uint32(), object,
+                            wasm::ObjectAccess::ToTagged(field_offset));
+  Node* index =
+      gasm_->Word32Shr(handle, gasm_->Int32Constant(kCodePointerHandleShift));
+  Node* offset = gasm_->ChangeUint32ToUint64(gasm_->Word32Shl(
+      index, gasm_->Int32Constant(kCodePointerTableEntrySizeLog2)));
+  Node* table =
+      gasm_->ExternalConstant(ExternalReference::code_pointer_table_address());
+
+  return gasm_->Load(MachineType::Pointer(), table, offset);
+#else
+  return gasm_->LoadFromObject(MachineType::Pointer(), object,
+                               wasm::ObjectAccess::ToTagged(field_offset));
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
 Node* WasmGraphBuilder::BuildLoadCallTargetFromExportedFunctionData(
     Node* function) {
   Node* internal = gasm_->LoadFromObject(
       MachineType::TaggedPointer(), function,
       wasm::ObjectAccess::ToTagged(WasmExportedFunctionData::kInternalOffset));
+  // TODO(saelo): should this become a CodePointer instead?
   return gasm_->BuildLoadExternalPointerFromObject(
       internal, WasmInternalFunction::kCallTargetOffset,
       kWasmInternalFunctionCallTargetTag, BuildLoadIsolateRoot());
@@ -3027,7 +3076,7 @@ Node* WasmGraphBuilder::BuildCallRef(const wasm::FunctionSig* sig,
                                      IsReturnCall continuation,
                                      wasm::WasmCodePosition position) {
   if (null_check == kWithNullCheck &&
-      null_check_strategy_ == NullCheckStrategy::kExplicitNullChecks) {
+      null_check_strategy_ == NullCheckStrategy::kExplicit) {
     args[0] =
         AssertNotNull(args[0], wasm::kWasmFuncRef /* good enough */, position);
   }
@@ -3060,9 +3109,8 @@ Node* WasmGraphBuilder::BuildCallRef(const wasm::FunctionSig* sig,
     Node* wrapper_code = gasm_->LoadImmutableFromObject(
         MachineType::TaggedPointer(), function,
         wasm::ObjectAccess::ToTagged(WasmInternalFunction::kCodeOffset));
-    Node* call_target = gasm_->LoadFromObject(
-        MachineType::Pointer(), wrapper_code,
-        wasm::ObjectAccess::ToTagged(Code::kCodeEntryPointOffset));
+    Node* call_target = BuildLoadCodePointerFromObject(
+        wrapper_code, Code::kInstructionStartOffset);
     gasm_->Goto(&end_label, call_target);
   }
 
@@ -3143,9 +3191,9 @@ Node* WasmGraphBuilder::ReturnCallIndirect(uint32_t table_index,
                            kReturnCall);
 }
 
-void WasmGraphBuilder::BrOnNull(Node* ref_object, wasm::ValueType type,
-                                Node** null_node, Node** non_null_node) {
-  BranchExpectFalse(IsNull(ref_object, type), null_node, non_null_node);
+std::tuple<Node*, Node*> WasmGraphBuilder::BrOnNull(Node* ref_object,
+                                                    wasm::ValueType type) {
+  return BranchExpectFalse(IsNull(ref_object, type));
 }
 
 Node* WasmGraphBuilder::BuildI32Rol(Node* left, Node* right) {
@@ -3182,52 +3230,52 @@ void WasmGraphBuilder::InitInstanceCache(
   // Therefore, we use plain Load nodes which are not subject to load
   // elimination.
 
-  // Load the memory start.
-#ifdef V8_ENABLE_SANDBOX
-  instance_cache->mem_start = LOAD_INSTANCE_FIELD_NO_ELIMINATION(
-      MemoryStart, MachineType::SandboxedPointer());
-#else
-  instance_cache->mem_start =
-      LOAD_INSTANCE_FIELD_NO_ELIMINATION(MemoryStart, MachineType::UintPtr());
-#endif
+  // Only cache memory start and size if there is a memory (the nodes would be
+  // dead otherwise, but we can avoid creating them in the first place).
+  if (!has_cached_memory()) return;
+
+  instance_cache->mem_start = LoadMemStart(cached_memory_index_);
 
-  // Load the memory size.
-  instance_cache->mem_size =
-      LOAD_INSTANCE_FIELD_NO_ELIMINATION(MemorySize, MachineType::UintPtr());
+  // TODO(13957): Clamp the loaded memory size to a safe value.
+  instance_cache->mem_size = LoadMemSize(cached_memory_index_);
 }
 
 void WasmGraphBuilder::PrepareInstanceCacheForLoop(
     WasmInstanceCacheNodes* instance_cache, Node* control) {
-#define INTRODUCE_PHI(field, rep)                                            \
-  instance_cache->field = graph()->NewNode(mcgraph()->common()->Phi(rep, 1), \
-                                           instance_cache->field, control);
-
-  INTRODUCE_PHI(mem_start, MachineType::PointerRepresentation());
-  INTRODUCE_PHI(mem_size, MachineType::PointerRepresentation());
-#undef INTRODUCE_PHI
+  if (!has_cached_memory()) return;
+  for (auto field : WasmInstanceCacheNodes::kFields) {
+    instance_cache->*field = graph()->NewNode(
+        mcgraph()->common()->Phi(MachineType::PointerRepresentation(), 1),
+        instance_cache->*field, control);
+  }
 }
 
 void WasmGraphBuilder::NewInstanceCacheMerge(WasmInstanceCacheNodes* to,
                                              WasmInstanceCacheNodes* from,
                                              Node* merge) {
-#define INTRODUCE_PHI(field, rep)                                            \
-  if (to->field != from->field) {                                            \
-    Node* vals[] = {to->field, from->field, merge};                          \
-    to->field = graph()->NewNode(mcgraph()->common()->Phi(rep, 2), 3, vals); \
+  for (auto field : WasmInstanceCacheNodes::kFields) {
+    if (to->*field == from->*field) continue;
+    Node* vals[] = {to->*field, from->*field, merge};
+    to->*field = graph()->NewNode(
+        mcgraph()->common()->Phi(MachineType::PointerRepresentation(), 2), 3,
+        vals);
   }
-
-  INTRODUCE_PHI(mem_start, MachineType::PointerRepresentation());
-  INTRODUCE_PHI(mem_size, MachineType::PointerRepresentation());
-#undef INTRODUCE_PHI
 }
 
 void WasmGraphBuilder::MergeInstanceCacheInto(WasmInstanceCacheNodes* to,
                                               WasmInstanceCacheNodes* from,
                                               Node* merge) {
-  to->mem_size = CreateOrMergeIntoPhi(MachineType::PointerRepresentation(),
-                                      merge, to->mem_size, from->mem_size);
-  to->mem_start = CreateOrMergeIntoPhi(MachineType::PointerRepresentation(),
-                                       merge, to->mem_start, from->mem_start);
+  if (!has_cached_memory()) {
+    // Instance cache nodes should be nullptr then.
+    DCHECK(to->mem_start == nullptr && to->mem_size == nullptr &&
+           from->mem_start == nullptr && from->mem_size == nullptr);
+    return;
+  }
+
+  for (auto field : WasmInstanceCacheNodes::kFields) {
+    to->*field = CreateOrMergeIntoPhi(MachineType::PointerRepresentation(),
+                                      merge, to->*field, from->*field);
+  }
 }
 
 Node* WasmGraphBuilder::CreateOrMergeIntoPhi(MachineRepresentation rep,
@@ -3289,23 +3337,71 @@ void WasmGraphBuilder::SetEffectControl(Node* effect, Node* control) {
   gasm_->InitializeEffectControl(effect, control);
 }
 
-Node* WasmGraphBuilder::MemBuffer(uintptr_t offset) {
+Node* WasmGraphBuilder::MemStart(uint32_t mem_index) {
+  DCHECK_NOT_NULL(instance_cache_);
+  V8_ASSUME(cached_memory_index_ == kNoCachedMemoryIndex ||
+            cached_memory_index_ >= 0);
+  if (mem_index == static_cast<uint8_t>(cached_memory_index_)) {
+    return instance_cache_->mem_start;
+  }
+  return LoadMemStart(mem_index);
+}
+
+Node* WasmGraphBuilder::MemSize(uint32_t mem_index) {
   DCHECK_NOT_NULL(instance_cache_);
-  Node* mem_start = instance_cache_->mem_start;
-  DCHECK_NOT_NULL(mem_start);
+  V8_ASSUME(cached_memory_index_ == kNoCachedMemoryIndex ||
+            cached_memory_index_ >= 0);
+  if (mem_index == static_cast<uint8_t>(cached_memory_index_)) {
+    return instance_cache_->mem_size;
+  }
+
+  return LoadMemSize(mem_index);
+}
+
+Node* WasmGraphBuilder::LoadMemStart(uint32_t mem_index) {
+  if (mem_index == 0) {
+    return LOAD_INSTANCE_FIELD_NO_ELIMINATION(Memory0Start,
+                                              kMaybeSandboxedPointer);
+  }
+  Node* memory_bases_and_sizes =
+      LOAD_INSTANCE_FIELD(MemoryBasesAndSizes, MachineType::TaggedPointer());
+  return gasm_->LoadByteArrayElement(memory_bases_and_sizes,
+                                     gasm_->IntPtrConstant(2 * mem_index),
+                                     kMaybeSandboxedPointer);
+}
+
+Node* WasmGraphBuilder::LoadMemSize(uint32_t mem_index) {
+  wasm::ValueType mem_type = env_->module->memories[mem_index].is_memory64
+                                 ? wasm::kWasmI64
+                                 : wasm::kWasmI32;
+  if (mem_index == 0) {
+    return SetType(
+        LOAD_INSTANCE_FIELD_NO_ELIMINATION(Memory0Size, MachineType::UintPtr()),
+        mem_type);
+  }
+  Node* memory_bases_and_sizes =
+      LOAD_INSTANCE_FIELD(MemoryBasesAndSizes, MachineType::TaggedPointer());
+  return SetType(
+      gasm_->LoadByteArrayElement(memory_bases_and_sizes,
+                                  gasm_->IntPtrConstant(2 * mem_index + 1),
+                                  MachineType::UintPtr()),
+      mem_type);
+}
+
+Node* WasmGraphBuilder::MemBuffer(uint32_t mem_index, uintptr_t offset) {
+  Node* mem_start = MemStart(mem_index);
   if (offset == 0) return mem_start;
   return gasm_->IntAdd(mem_start, gasm_->UintPtrConstant(offset));
 }
 
-Node* WasmGraphBuilder::CurrentMemoryPages() {
+Node* WasmGraphBuilder::CurrentMemoryPages(const wasm::WasmMemory* memory) {
   // CurrentMemoryPages can not be called from asm.js.
   DCHECK_EQ(wasm::kWasmOrigin, env_->module->origin);
-  DCHECK_NOT_NULL(instance_cache_);
-  Node* mem_size = instance_cache_->mem_size;
-  DCHECK_NOT_NULL(mem_size);
+
+  Node* mem_size = MemSize(memory->index);
   Node* result =
-      gasm_->WordShr(mem_size, Int32Constant(wasm::kWasmPageSizeLog2));
-  result = env_->module->is_memory64
+      gasm_->WordShr(mem_size, gasm_->IntPtrConstant(wasm::kWasmPageSizeLog2));
+  result = env_->module->memories[0].is_memory64
                ? gasm_->BuildChangeIntPtrToInt64(result)
                : gasm_->BuildTruncateIntPtrToInt32(result);
   return result;
@@ -3325,10 +3421,10 @@ Node* WasmGraphBuilder::BuildCallToRuntimeWithContext(Runtime::FunctionId f,
   // Isolate independent. At the moment this is only done for CEntryStub(1).
   Node* isolate_root = BuildLoadIsolateRoot();
   DCHECK_EQ(1, fun->result_size);
-  auto centry_id = Builtin::kCEntry_Return1_ArgvOnStack_NoBuiltinExit;
+  auto centry_id = Builtin::kWasmCEntry;
   int builtin_slot_offset = IsolateData::BuiltinSlotOffset(centry_id);
-  Node* centry_stub = gasm_->LoadFromObject(MachineType::Pointer(),
-                                            isolate_root, builtin_slot_offset);
+  Node* centry_stub =
+      gasm_->Load(MachineType::Pointer(), isolate_root, builtin_slot_offset);
   // TODO(titzer): allow arbitrary number of runtime arguments
   // At the moment we only allow 5 parameters. If more parameters are needed,
   // increase this constant accordingly.
@@ -3381,11 +3477,8 @@ void WasmGraphBuilder::GetGlobalBaseAndOffset(const wasm::WasmGlobal& global,
           gasm_->IntPtrConstant(
               wasm::ObjectAccess::ToTagged(FixedArray::kObjectsOffset)));
     } else {
-      MachineType machine_type = V8_ENABLE_SANDBOX_BOOL
-                                     ? MachineType::SandboxedPointer()
-                                     : MachineType::UintPtr();
-      *base = gasm_->LoadFromObject(machine_type, imported_mutable_globals,
-                                    field_offset);
+      *base = gasm_->LoadFromObject(kMaybeSandboxedPointer,
+                                    imported_mutable_globals, field_offset);
       *offset = gasm_->IntPtrConstant(0);
     }
   } else if (global.type.is_reference()) {
@@ -3394,10 +3487,7 @@ void WasmGraphBuilder::GetGlobalBaseAndOffset(const wasm::WasmGlobal& global,
     *offset = gasm_->IntPtrConstant(
         wasm::ObjectAccess::ElementOffsetInTaggedFixedArray(global.offset));
   } else {
-    MachineType machine_type = V8_ENABLE_SANDBOX_BOOL
-                                   ? MachineType::SandboxedPointer()
-                                   : MachineType::UintPtr();
-    *base = LOAD_INSTANCE_FIELD(GlobalsStart, machine_type);
+    *base = LOAD_INSTANCE_FIELD(GlobalsStart, kMaybeSandboxedPointer);
     *offset = gasm_->IntPtrConstant(global.offset);
   }
 }
@@ -3447,26 +3537,23 @@ void WasmGraphBuilder::TableSet(uint32_t table_index, Node* index, Node* val,
                          gasm_->IntPtrConstant(table_index), index, val);
 }
 
-std::pair<Node*, WasmGraphBuilder::BoundsCheckResult>
-WasmGraphBuilder::CheckBoundsAndAlignment(int8_t access_size, Node* index,
-                                          uint64_t offset,
-                                          wasm::WasmCodePosition position,
-                                          EnforceBoundsCheck enforce_check) {
+std::pair<Node*, BoundsCheckResult> WasmGraphBuilder::CheckBoundsAndAlignment(
+    const wasm::WasmMemory* memory, int8_t access_size, Node* index,
+    uintptr_t offset, wasm::WasmCodePosition position,
+    EnforceBoundsCheck enforce_check) {
   // Atomic operations need bounds checks until the backend can emit protected
   // loads.
   BoundsCheckResult bounds_check_result;
-  std::tie(index, bounds_check_result) =
-      BoundsCheckMem(access_size, index, offset, position, enforce_check);
+  std::tie(index, bounds_check_result) = BoundsCheckMem(
+      memory, access_size, index, offset, position, enforce_check);
 
   const uintptr_t align_mask = access_size - 1;
 
-  // {offset} is validated to be within uintptr_t range in {BoundsCheckMem}.
-  uintptr_t capped_offset = static_cast<uintptr_t>(offset);
   // Don't emit an alignment check if the index is a constant.
   // TODO(wasm): a constant match is also done above in {BoundsCheckMem}.
   UintPtrMatcher match(index);
   if (match.HasResolvedValue()) {
-    uintptr_t effective_offset = match.ResolvedValue() + capped_offset;
+    uintptr_t effective_offset = match.ResolvedValue() + offset;
     if ((effective_offset & align_mask) != 0) {
       // statically known to be unaligned; trap.
       TrapIfEq32(wasm::kTrapUnalignedAccess, Int32Constant(0), 0, position);
@@ -3477,7 +3564,8 @@ WasmGraphBuilder::CheckBoundsAndAlignment(int8_t access_size, Node* index,
   // Unlike regular memory accesses, atomic memory accesses should trap if
   // the effective offset is misaligned.
   // TODO(wasm): this addition is redundant with one inserted by {MemBuffer}.
-  Node* effective_offset = gasm_->IntAdd(MemBuffer(capped_offset), index);
+  Node* effective_offset =
+      gasm_->IntAdd(MemBuffer(memory->index, offset), index);
 
   Node* cond =
       gasm_->WordAnd(effective_offset, gasm_->IntPtrConstant(align_mask));
@@ -3489,31 +3577,25 @@ WasmGraphBuilder::CheckBoundsAndAlignment(int8_t access_size, Node* index,
 // Insert code to bounds check a memory access if necessary. Return the
 // bounds-checked index, which is guaranteed to have (the equivalent of)
 // {uintptr_t} representation.
-std::pair<Node*, WasmGraphBuilder::BoundsCheckResult>
-WasmGraphBuilder::BoundsCheckMem(uint8_t access_size, Node* index,
-                                 uint64_t offset,
-                                 wasm::WasmCodePosition position,
-                                 EnforceBoundsCheck enforce_check) {
+std::pair<Node*, BoundsCheckResult> WasmGraphBuilder::BoundsCheckMem(
+    const wasm::WasmMemory* memory, uint8_t access_size, Node* index,
+    uintptr_t offset, wasm::WasmCodePosition position,
+    EnforceBoundsCheck enforce_check) {
   DCHECK_LE(1, access_size);
 
-  // If the offset does not fit in a uintptr_t, this can never succeed on this
-  // machine.
-  if (offset > std::numeric_limits<uintptr_t>::max() ||
-      !base::IsInBounds<uintptr_t>(offset, access_size,
-                                   env_->module->max_memory_size)) {
-    // The access will be out of bounds, even for the largest memory.
-    Trap(wasm::TrapReason::kTrapMemOutOfBounds, position);
-    return {gasm_->UintPtrConstant(0), kOutOfBounds};
-  }
+  // The function body decoder already validated that the access is not
+  // statically OOB.
+  DCHECK(base::IsInBounds<uintptr_t>(offset, access_size,
+                                     memory->max_memory_size));
 
   // Convert the index to uintptr.
-  if (!env_->module->is_memory64) {
+  if (!memory->is_memory64) {
     index = gasm_->BuildChangeUint32ToUintPtr(index);
   } else if (kSystemPointerSize == kInt32Size) {
     // In memory64 mode on 32-bit systems, the upper 32 bits need to be zero to
     // succeed the bounds check.
-    DCHECK_NE(wasm::kTrapHandler, env_->bounds_checks);
-    if (env_->bounds_checks == wasm::kExplicitBoundsChecks) {
+    DCHECK_NE(wasm::kTrapHandler, memory->bounds_checks);
+    if (memory->bounds_checks == wasm::kExplicitBoundsChecks) {
       Node* high_word = gasm_->TruncateInt64ToInt32(
           gasm_->Word64Shr(index, Int32Constant(32)));
       TrapIfTrue(wasm::kTrapMemOutOfBounds, high_word, position);
@@ -3524,7 +3606,8 @@ WasmGraphBuilder::BoundsCheckMem(uint8_t access_size, Node* index,
 
   // If no bounds checks should be performed (for testing), just return the
   // converted index and assume it to be in-bounds.
-  if (env_->bounds_checks == wasm::kNoBoundsChecks) return {index, kInBounds};
+  if (memory->bounds_checks == wasm::kNoBoundsChecks)
+    return {index, BoundsCheckResult::kInBounds};
 
   // The accessed memory is [index + offset, index + end_offset].
   // Check that the last read byte (at {index + end_offset}) is in bounds.
@@ -3538,21 +3621,22 @@ WasmGraphBuilder::BoundsCheckMem(uint8_t access_size, Node* index,
   uintptr_t end_offset = offset + access_size - 1u;
 
   UintPtrMatcher match(index);
-  if (match.HasResolvedValue() && end_offset <= env_->module->min_memory_size &&
-      match.ResolvedValue() < env_->module->min_memory_size - end_offset) {
+  if (match.HasResolvedValue() && end_offset <= memory->min_memory_size &&
+      match.ResolvedValue() < memory->min_memory_size - end_offset) {
     // The input index is a constant and everything is statically within
     // bounds of the smallest possible memory.
-    return {index, kInBounds};
+    return {index, BoundsCheckResult::kInBounds};
   }
 
-  if (env_->bounds_checks == wasm::kTrapHandler &&
-      enforce_check == kCanOmitBoundsCheck) {
-    return {index, kTrapHandler};
+  if (memory->bounds_checks == wasm::kTrapHandler &&
+      enforce_check == EnforceBoundsCheck::kCanOmitBoundsCheck) {
+    return {index, BoundsCheckResult::kTrapHandler};
   }
 
-  Node* mem_size = instance_cache_->mem_size;
+  Node* mem_size = MemSize(memory->index);
+
   Node* end_offset_node = mcgraph_->UintPtrConstant(end_offset);
-  if (end_offset > env_->module->min_memory_size) {
+  if (end_offset > memory->min_memory_size) {
     // The end offset is larger than the smallest memory.
     // Dynamically check the end offset against the dynamic memory size.
     Node* cond = gasm_->UintLessThan(end_offset_node, mem_size);
@@ -3565,7 +3649,7 @@ WasmGraphBuilder::BoundsCheckMem(uint8_t access_size, Node* index,
   // Introduce the actual bounds check.
   Node* cond = gasm_->UintLessThan(index, effective_size);
   TrapIfFalse(wasm::kTrapMemOutOfBounds, cond, position);
-  return {index, kDynamicallyChecked};
+  return {index, BoundsCheckResult::kDynamicallyChecked};
 }
 
 const Operator* WasmGraphBuilder::GetSafeLoadOperator(int offset,
@@ -3695,10 +3779,10 @@ LoadTransformation GetLoadTransformation(
   UNREACHABLE();
 }
 
-MemoryAccessKind GetMemoryAccessKind(
-    MachineGraph* mcgraph, MachineRepresentation memrep,
-    WasmGraphBuilder::BoundsCheckResult bounds_check_result) {
-  if (bounds_check_result == WasmGraphBuilder::kTrapHandler) {
+MemoryAccessKind GetMemoryAccessKind(MachineGraph* mcgraph,
+                                     MachineRepresentation memrep,
+                                     BoundsCheckResult bounds_check_result) {
+  if (bounds_check_result == BoundsCheckResult::kTrapHandler) {
     // Protected instructions do not come in an 'unaligned' flavor, so the trap
     // handler can currently only be used on systems where all memory accesses
     // are allowed to be unaligned.
@@ -3714,8 +3798,9 @@ MemoryAccessKind GetMemoryAccessKind(
 }
 }  // namespace
 
-Node* WasmGraphBuilder::LoadLane(wasm::ValueType type, MachineType memtype,
-                                 Node* value, Node* index, uint64_t offset,
+Node* WasmGraphBuilder::LoadLane(const wasm::WasmMemory* memory,
+                                 wasm::ValueType type, MachineType memtype,
+                                 Node* value, Node* index, uintptr_t offset,
                                  uint32_t alignment, uint8_t laneidx,
                                  wasm::WasmCodePosition position) {
   has_simd_ = true;
@@ -3723,39 +3808,37 @@ Node* WasmGraphBuilder::LoadLane(wasm::ValueType type, MachineType memtype,
   uint8_t access_size = memtype.MemSize();
   BoundsCheckResult bounds_check_result;
   std::tie(index, bounds_check_result) =
-      BoundsCheckMem(access_size, index, offset, position, kCanOmitBoundsCheck);
+      BoundsCheckMem(memory, access_size, index, offset, position,
+                     EnforceBoundsCheck::kCanOmitBoundsCheck);
 
-  // {offset} is validated to be within uintptr_t range in {BoundsCheckMem}.
-  uintptr_t capped_offset = static_cast<uintptr_t>(offset);
   MemoryAccessKind load_kind = GetMemoryAccessKind(
       mcgraph_, memtype.representation(), bounds_check_result);
 
   load = SetEffect(graph()->NewNode(
       mcgraph()->machine()->LoadLane(load_kind, memtype, laneidx),
-      MemBuffer(capped_offset), index, value, effect(), control()));
+      MemBuffer(memory->index, offset), index, value, effect(), control()));
 
   if (load_kind == MemoryAccessKind::kProtected) {
     SetSourcePosition(load, position);
   }
   if (v8_flags.trace_wasm_memory) {
-    TraceMemoryOperation(false, memtype.representation(), index, capped_offset,
+    // TODO(14259): Implement memory tracing for multiple memories.
+    CHECK_EQ(0, memory->index);
+    TraceMemoryOperation(false, memtype.representation(), index, offset,
                          position);
   }
 
   return load;
 }
 
-Node* WasmGraphBuilder::LoadTransform(wasm::ValueType type, MachineType memtype,
+Node* WasmGraphBuilder::LoadTransform(const wasm::WasmMemory* memory,
+                                      wasm::ValueType type, MachineType memtype,
                                       wasm::LoadTransformationKind transform,
-                                      Node* index, uint64_t offset,
+                                      Node* index, uintptr_t offset,
                                       uint32_t alignment,
                                       wasm::WasmCodePosition position) {
   has_simd_ = true;
 
-  Node* load;
-  // {offset} is validated to be within uintptr_t range in {BoundsCheckMem}.
-  uintptr_t capped_offset = static_cast<uintptr_t>(offset);
-
   // Wasm semantics throw on OOB. Introduce explicit bounds check and
   // conditioning when not using the trap handler.
 
@@ -3765,33 +3848,35 @@ Node* WasmGraphBuilder::LoadTransform(wasm::ValueType type, MachineType memtype,
                             : memtype.MemSize();
   BoundsCheckResult bounds_check_result;
   std::tie(index, bounds_check_result) =
-      BoundsCheckMem(access_size, index, offset, position, kCanOmitBoundsCheck);
+      BoundsCheckMem(memory, access_size, index, offset, position,
+                     EnforceBoundsCheck::kCanOmitBoundsCheck);
 
   LoadTransformation transformation = GetLoadTransformation(memtype, transform);
   MemoryAccessKind load_kind = GetMemoryAccessKind(
       mcgraph_, memtype.representation(), bounds_check_result);
 
-  load = SetEffect(graph()->NewNode(
+  Node* load = SetEffect(graph()->NewNode(
       mcgraph()->machine()->LoadTransform(load_kind, transformation),
-      MemBuffer(capped_offset), index, effect(), control()));
+      MemBuffer(memory->index, offset), index, effect(), control()));
 
   if (load_kind == MemoryAccessKind::kProtected) {
     SetSourcePosition(load, position);
   }
 
   if (v8_flags.trace_wasm_memory) {
-    TraceMemoryOperation(false, memtype.representation(), index, capped_offset,
+    // TODO(14259): Implement memory tracing for multiple memories.
+    CHECK_EQ(0, memory->index);
+    TraceMemoryOperation(false, memtype.representation(), index, offset,
                          position);
   }
   return load;
 }
 
-Node* WasmGraphBuilder::LoadMem(wasm::ValueType type, MachineType memtype,
-                                Node* index, uint64_t offset,
+Node* WasmGraphBuilder::LoadMem(const wasm::WasmMemory* memory,
+                                wasm::ValueType type, MachineType memtype,
+                                Node* index, uintptr_t offset,
                                 uint32_t alignment,
                                 wasm::WasmCodePosition position) {
-  Node* load;
-
   if (memtype.representation() == MachineRepresentation::kSimd128) {
     has_simd_ = true;
   }
@@ -3799,23 +3884,23 @@ Node* WasmGraphBuilder::LoadMem(wasm::ValueType type, MachineType memtype,
   // Wasm semantics throw on OOB. Introduce explicit bounds check and
   // conditioning when not using the trap handler.
   BoundsCheckResult bounds_check_result;
-  std::tie(index, bounds_check_result) = BoundsCheckMem(
-      memtype.MemSize(), index, offset, position, kCanOmitBoundsCheck);
-
-  // {offset} is validated to be within uintptr_t range in {BoundsCheckMem}.
-  uintptr_t capped_offset = static_cast<uintptr_t>(offset);
+  std::tie(index, bounds_check_result) =
+      BoundsCheckMem(memory, memtype.MemSize(), index, offset, position,
+                     EnforceBoundsCheck::kCanOmitBoundsCheck);
 
+  Node* mem_start = MemBuffer(memory->index, offset);
+  Node* load;
   switch (GetMemoryAccessKind(mcgraph_, memtype.representation(),
                               bounds_check_result)) {
     case MemoryAccessKind::kUnaligned:
-      load = gasm_->LoadUnaligned(memtype, MemBuffer(capped_offset), index);
+      load = gasm_->LoadUnaligned(memtype, mem_start, index);
       break;
     case MemoryAccessKind::kProtected:
-      load = gasm_->ProtectedLoad(memtype, MemBuffer(capped_offset), index);
+      load = gasm_->ProtectedLoad(memtype, mem_start, index);
       SetSourcePosition(load, position);
       break;
     case MemoryAccessKind::kNormal:
-      load = gasm_->Load(memtype, MemBuffer(capped_offset), index);
+      load = gasm_->Load(memtype, mem_start, index);
       break;
   }
 
@@ -3832,43 +3917,47 @@ Node* WasmGraphBuilder::LoadMem(wasm::ValueType type, MachineType memtype,
   }
 
   if (v8_flags.trace_wasm_memory) {
-    TraceMemoryOperation(false, memtype.representation(), index, capped_offset,
+    // TODO(14259): Implement memory tracing for multiple memories.
+    CHECK_EQ(0, memory->index);
+    TraceMemoryOperation(false, memtype.representation(), index, offset,
                          position);
   }
 
   return load;
 }
 
-void WasmGraphBuilder::StoreLane(MachineRepresentation mem_rep, Node* index,
-                                 uint64_t offset, uint32_t alignment, Node* val,
-                                 uint8_t laneidx,
+void WasmGraphBuilder::StoreLane(const wasm::WasmMemory* memory,
+                                 MachineRepresentation mem_rep, Node* index,
+                                 uintptr_t offset, uint32_t alignment,
+                                 Node* val, uint8_t laneidx,
                                  wasm::WasmCodePosition position,
                                  wasm::ValueType type) {
   has_simd_ = true;
   BoundsCheckResult bounds_check_result;
-  std::tie(index, bounds_check_result) =
-      BoundsCheckMem(i::ElementSizeInBytes(mem_rep), index, offset, position,
-                     kCanOmitBoundsCheck);
-
-  // {offset} is validated to be within uintptr_t range in {BoundsCheckMem}.
-  uintptr_t capped_offset = static_cast<uintptr_t>(offset);
+  std::tie(index, bounds_check_result) = BoundsCheckMem(
+      memory, i::ElementSizeInBytes(mem_rep), index, offset, position,
+      wasm::kPartialOOBWritesAreNoops ? EnforceBoundsCheck::kCanOmitBoundsCheck
+                                      : EnforceBoundsCheck::kNeedsBoundsCheck);
   MemoryAccessKind load_kind =
       GetMemoryAccessKind(mcgraph_, mem_rep, bounds_check_result);
 
   Node* store = SetEffect(graph()->NewNode(
       mcgraph()->machine()->StoreLane(load_kind, mem_rep, laneidx),
-      MemBuffer(capped_offset), index, val, effect(), control()));
+      MemBuffer(memory->index, offset), index, val, effect(), control()));
 
   if (load_kind == MemoryAccessKind::kProtected) {
     SetSourcePosition(store, position);
   }
   if (v8_flags.trace_wasm_memory) {
-    TraceMemoryOperation(true, mem_rep, index, capped_offset, position);
+    // TODO(14259): Implement memory tracing for multiple memories.
+    CHECK_EQ(0, memory->index);
+    TraceMemoryOperation(true, mem_rep, index, offset, position);
   }
 }
 
-void WasmGraphBuilder::StoreMem(MachineRepresentation mem_rep, Node* index,
-                                uint64_t offset, uint32_t alignment, Node* val,
+void WasmGraphBuilder::StoreMem(const wasm::WasmMemory* memory,
+                                MachineRepresentation mem_rep, Node* index,
+                                uintptr_t offset, uint32_t alignment, Node* val,
                                 wasm::WasmCodePosition position,
                                 wasm::ValueType type) {
   if (mem_rep == MachineRepresentation::kSimd128) {
@@ -3876,25 +3965,23 @@ void WasmGraphBuilder::StoreMem(MachineRepresentation mem_rep, Node* index,
   }
 
   BoundsCheckResult bounds_check_result;
-  std::tie(index, bounds_check_result) =
-      BoundsCheckMem(i::ElementSizeInBytes(mem_rep), index, offset, position,
-                     kCanOmitBoundsCheck);
+  std::tie(index, bounds_check_result) = BoundsCheckMem(
+      memory, i::ElementSizeInBytes(mem_rep), index, offset, position,
+      wasm::kPartialOOBWritesAreNoops ? EnforceBoundsCheck::kCanOmitBoundsCheck
+                                      : EnforceBoundsCheck::kNeedsBoundsCheck);
 
 #if defined(V8_TARGET_BIG_ENDIAN)
   val = BuildChangeEndiannessStore(val, mem_rep, type);
 #endif
 
-  // {offset} is validated to be within uintptr_t range in {BoundsCheckMem}.
-  uintptr_t capped_offset = static_cast<uintptr_t>(offset);
-
+  Node* mem_start = MemBuffer(memory->index, offset);
   switch (GetMemoryAccessKind(mcgraph_, mem_rep, bounds_check_result)) {
     case MemoryAccessKind::kUnaligned:
-      gasm_->StoreUnaligned(UnalignedStoreRepresentation{mem_rep},
-                            MemBuffer(capped_offset), index, val);
+      gasm_->StoreUnaligned(UnalignedStoreRepresentation{mem_rep}, mem_start,
+                            index, val);
       break;
     case MemoryAccessKind::kProtected: {
-      Node* store =
-          gasm_->ProtectedStore(mem_rep, MemBuffer(capped_offset), index, val);
+      Node* store = gasm_->ProtectedStore(mem_rep, mem_start, index, val);
       SetSourcePosition(store, position);
       if (mem_rep == MachineRepresentation::kSimd128) {
         graph()->RecordSimdStore(store);
@@ -3903,7 +3990,7 @@ void WasmGraphBuilder::StoreMem(MachineRepresentation mem_rep, Node* index,
     }
     case MemoryAccessKind::kNormal: {
       Node* store = gasm_->Store(StoreRepresentation{mem_rep, kNoWriteBarrier},
-                                 MemBuffer(capped_offset), index, val);
+                                 mem_start, index, val);
       if (mem_rep == MachineRepresentation::kSimd128) {
         graph()->RecordSimdStore(store);
       }
@@ -3912,16 +3999,17 @@ void WasmGraphBuilder::StoreMem(MachineRepresentation mem_rep, Node* index,
   }
 
   if (v8_flags.trace_wasm_memory) {
-    TraceMemoryOperation(true, mem_rep, index, capped_offset, position);
+    // TODO(14259): Implement memory tracing for multiple memories.
+    CHECK_EQ(0, memory->index);
+    TraceMemoryOperation(true, mem_rep, index, offset, position);
   }
 }
 
 Node* WasmGraphBuilder::BuildAsmjsLoadMem(MachineType type, Node* index) {
   DCHECK_NOT_NULL(instance_cache_);
-  Node* mem_start = instance_cache_->mem_start;
-  Node* mem_size = instance_cache_->mem_size;
-  DCHECK_NOT_NULL(mem_start);
-  DCHECK_NOT_NULL(mem_size);
+  DCHECK_EQ(1, env_->module->memories.size());
+  Node* mem_start = MemStart(0);
+  Node* mem_size = MemSize(0);
 
   // Asm.js semantics are defined in terms of typed arrays, hence OOB
   // reads return {undefined} coerced to the result type (0 for integers, NaN
@@ -3964,10 +4052,9 @@ Node* WasmGraphBuilder::BuildAsmjsLoadMem(MachineType type, Node* index) {
 Node* WasmGraphBuilder::BuildAsmjsStoreMem(MachineType type, Node* index,
                                            Node* val) {
   DCHECK_NOT_NULL(instance_cache_);
-  Node* mem_start = instance_cache_->mem_start;
-  Node* mem_size = instance_cache_->mem_size;
-  DCHECK_NOT_NULL(mem_start);
-  DCHECK_NOT_NULL(mem_size);
+  DCHECK_EQ(1, env_->module->memories.size());
+  Node* mem_start = MemStart(0);
+  Node* mem_size = MemSize(0);
 
   // Asm.js semantics are to ignore OOB writes.
   // Note that we check against the memory size ignoring the size of the
@@ -4085,27 +4172,16 @@ void WasmGraphBuilder::LowerInt64(CallOrigin origin) {
 
 Node* WasmGraphBuilder::BuildChangeInt64ToBigInt(Node* input,
                                                  StubCallMode stub_mode) {
-  Node* target;
   if (mcgraph()->machine()->Is64()) {
-    target = (stub_mode == StubCallMode::kCallWasmRuntimeStub)
-                 ? mcgraph()->RelocatableIntPtrConstant(
-                       wasm::WasmCode::kI64ToBigInt, RelocInfo::WASM_STUB_CALL)
-                 : gasm_->GetBuiltinPointerTarget(Builtin::kI64ToBigInt);
+    return gasm_->CallBuiltin(Builtin::kI64ToBigInt, Operator::kEliminatable,
+                              input);
   } else {
-    DCHECK(mcgraph()->machine()->Is32());
-    // On 32-bit platforms we already set the target to the
-    // I32PairToBigInt builtin here, so that we don't have to replace the
-    // target in the int64-lowering.
-    target =
-        (stub_mode == StubCallMode::kCallWasmRuntimeStub)
-            ? mcgraph()->RelocatableIntPtrConstant(
-                  wasm::WasmCode::kI32PairToBigInt, RelocInfo::WASM_STUB_CALL)
-            : gasm_->GetBuiltinPointerTarget(Builtin::kI32PairToBigInt);
-  }
-  CallDescriptor* descriptor =
-      wasm::GetWasmEngine()->call_descriptors()->GetI64ToBigIntDescriptor(
-          stub_mode);
-  return gasm_->Call(descriptor, target, input);
+    Node* low_word = gasm_->TruncateInt64ToInt32(input);
+    Node* high_word = gasm_->TruncateInt64ToInt32(
+        gasm_->Word64Shr(input, gasm_->Int32Constant(32)));
+    return gasm_->CallBuiltin(Builtin::kI32PairToBigInt,
+                              Operator::kEliminatable, low_word, high_word);
+  }
 }
 
 void WasmGraphBuilder::SetSourcePosition(Node* node,
@@ -4834,8 +4910,9 @@ Node* WasmGraphBuilder::Simd8x16ShuffleOp(const uint8_t shuffle[16],
                           inputs[0], inputs[1]);
 }
 
-Node* WasmGraphBuilder::AtomicOp(wasm::WasmOpcode opcode, Node* const* inputs,
-                                 uint32_t alignment, uint64_t offset,
+Node* WasmGraphBuilder::AtomicOp(const wasm::WasmMemory* memory,
+                                 wasm::WasmOpcode opcode, Node* const* inputs,
+                                 uint32_t alignment, uintptr_t offset,
                                  wasm::WasmCodePosition position) {
   struct AtomicOpInfo {
     enum Type : int8_t {
@@ -5003,16 +5080,14 @@ Node* WasmGraphBuilder::AtomicOp(wasm::WasmOpcode opcode, Node* const* inputs,
   Node* index;
   BoundsCheckResult bounds_check_result;
   std::tie(index, bounds_check_result) =
-      CheckBoundsAndAlignment(info.machine_type.MemSize(), inputs[0], offset,
-                              position, enforce_bounds_check);
+      CheckBoundsAndAlignment(memory, info.machine_type.MemSize(), inputs[0],
+                              offset, position, enforce_bounds_check);
   // MemoryAccessKind::kUnaligned is impossible due to explicit aligment check.
   MemoryAccessKind access_kind =
-      bounds_check_result == WasmGraphBuilder::kTrapHandler
+      bounds_check_result == BoundsCheckResult::kTrapHandler
           ? MemoryAccessKind::kProtected
           : MemoryAccessKind::kNormal;
 
-  // {offset} is validated to be within uintptr_t range in {BoundsCheckMem}.
-  uintptr_t capped_offset = static_cast<uintptr_t>(offset);
   if (info.type != AtomicOpInfo::kSpecial) {
     const Operator* op;
     if (info.operator_by_type) {
@@ -5031,7 +5106,7 @@ Node* WasmGraphBuilder::AtomicOp(wasm::WasmOpcode opcode, Node* const* inputs,
                                 access_kind));
     }
 
-    Node* input_nodes[6] = {MemBuffer(capped_offset), index};
+    Node* input_nodes[6] = {MemBuffer(memory->index, offset), index};
     int num_actual_inputs = info.type;
     std::copy_n(inputs + 1, num_actual_inputs, input_nodes + 2);
     input_nodes[num_actual_inputs + 2] = effect();
@@ -5064,15 +5139,14 @@ Node* WasmGraphBuilder::AtomicOp(wasm::WasmOpcode opcode, Node* const* inputs,
     return result;
   }
 
-  // After we've bounds-checked, compute the effective offset.
-  Node* effective_offset =
-      gasm_->IntAdd(gasm_->UintPtrConstant(capped_offset), index);
+  Node* memory_index = gasm_->Int32Constant(memory->index);
+  Node* effective_offset = gasm_->IntAdd(gasm_->UintPtrConstant(offset), index);
 
   switch (opcode) {
     case wasm::kExprAtomicNotify:
       return gasm_->CallRuntimeStub(wasm::WasmCode::kWasmAtomicNotify,
-                                    Operator::kNoThrow, effective_offset,
-                                    inputs[1]);
+                                    Operator::kNoThrow, memory_index,
+                                    effective_offset, inputs[1]);
 
     case wasm::kExprI32AtomicWait: {
       constexpr StubCallMode kStubMode = StubCallMode::kCallWasmRuntimeStub;
@@ -5083,8 +5157,8 @@ Node* WasmGraphBuilder::AtomicOp(wasm::WasmOpcode opcode, Node* const* inputs,
       Node* call_target = mcgraph()->RelocatableIntPtrConstant(
           target, RelocInfo::WASM_STUB_CALL);
 
-      return gasm_->Call(call_descriptor, call_target, effective_offset,
-                         inputs[1],
+      return gasm_->Call(call_descriptor, call_target, memory_index,
+                         effective_offset, inputs[1],
                          BuildChangeInt64ToBigInt(inputs[2], kStubMode));
     }
 
@@ -5097,7 +5171,8 @@ Node* WasmGraphBuilder::AtomicOp(wasm::WasmOpcode opcode, Node* const* inputs,
       Node* call_target = mcgraph()->RelocatableIntPtrConstant(
           target, RelocInfo::WASM_STUB_CALL);
 
-      return gasm_->Call(call_descriptor, call_target, effective_offset,
+      return gasm_->Call(call_descriptor, call_target, memory_index,
+                         effective_offset,
                          BuildChangeInt64ToBigInt(inputs[1], kStubMode),
                          BuildChangeInt64ToBigInt(inputs[2], kStubMode));
     }
@@ -5113,7 +5188,8 @@ void WasmGraphBuilder::AtomicFence() {
       control()));
 }
 
-void WasmGraphBuilder::MemoryInit(uint32_t data_segment_index, Node* dst,
+void WasmGraphBuilder::MemoryInit(const wasm::WasmMemory* memory,
+                                  uint32_t data_segment_index, Node* dst,
                                   Node* src, Node* size,
                                   wasm::WasmCodePosition position) {
   // The data segment index must be in bounds since it is required by
@@ -5123,10 +5199,11 @@ void WasmGraphBuilder::MemoryInit(uint32_t data_segment_index, Node* dst,
   Node* function =
       gasm_->ExternalConstant(ExternalReference::wasm_memory_init());
 
-  MemTypeToUintPtrOrOOBTrap({&dst}, position);
+  MemTypeToUintPtrOrOOBTrap(memory->is_memory64, {&dst}, position);
 
   Node* stack_slot = StoreArgsInStackSlot(
       {{MachineType::PointerRepresentation(), GetInstance()},
+       {MachineRepresentation::kWord32, gasm_->Int32Constant(memory->index)},
        {MachineType::PointerRepresentation(), dst},
        {MachineRepresentation::kWord32, src},
        {MachineRepresentation::kWord32,
@@ -5176,8 +5253,9 @@ Node* WasmGraphBuilder::StoreArgsInStackSlot(
 }
 
 void WasmGraphBuilder::MemTypeToUintPtrOrOOBTrap(
-    std::initializer_list<Node**> nodes, wasm::WasmCodePosition position) {
-  if (!env_->module->is_memory64) {
+    bool is_memory64, std::initializer_list<Node**> nodes,
+    wasm::WasmCodePosition position) {
+  if (!is_memory64) {
     for (Node** node : nodes) {
       *node = gasm_->BuildChangeUint32ToUintPtr(*node);
     }
@@ -5196,15 +5274,23 @@ void WasmGraphBuilder::MemTypeToUintPtrOrOOBTrap(
   TrapIfTrue(wasm::kTrapMemOutOfBounds, any_high_word, position);
 }
 
-void WasmGraphBuilder::MemoryCopy(Node* dst, Node* src, Node* size,
+void WasmGraphBuilder::MemoryCopy(const wasm::WasmMemory* dst_memory,
+                                  const wasm::WasmMemory* src_memory, Node* dst,
+                                  Node* src, Node* size,
                                   wasm::WasmCodePosition position) {
   Node* function =
       gasm_->ExternalConstant(ExternalReference::wasm_memory_copy());
 
-  MemTypeToUintPtrOrOOBTrap({&dst, &src, &size}, position);
+  DCHECK_EQ(dst_memory->is_memory64, src_memory->is_memory64);
+  MemTypeToUintPtrOrOOBTrap(dst_memory->is_memory64, {&dst, &src, &size},
+                            position);
 
   Node* stack_slot = StoreArgsInStackSlot(
       {{MachineType::PointerRepresentation(), GetInstance()},
+       {MachineRepresentation::kWord32,
+        gasm_->Int32Constant(dst_memory->index)},
+       {MachineRepresentation::kWord32,
+        gasm_->Int32Constant(src_memory->index)},
        {MachineType::PointerRepresentation(), dst},
        {MachineType::PointerRepresentation(), src},
        {MachineType::PointerRepresentation(), size}});
@@ -5215,15 +5301,17 @@ void WasmGraphBuilder::MemoryCopy(Node* dst, Node* src, Node* size,
   TrapIfFalse(wasm::kTrapMemOutOfBounds, call, position);
 }
 
-void WasmGraphBuilder::MemoryFill(Node* dst, Node* value, Node* size,
+void WasmGraphBuilder::MemoryFill(const wasm::WasmMemory* memory, Node* dst,
+                                  Node* value, Node* size,
                                   wasm::WasmCodePosition position) {
   Node* function =
       gasm_->ExternalConstant(ExternalReference::wasm_memory_fill());
 
-  MemTypeToUintPtrOrOOBTrap({&dst, &size}, position);
+  MemTypeToUintPtrOrOOBTrap(memory->is_memory64, {&dst, &size}, position);
 
   Node* stack_slot = StoreArgsInStackSlot(
       {{MachineType::PointerRepresentation(), GetInstance()},
+       {MachineRepresentation::kWord32, gasm_->Int32Constant(memory->index)},
        {MachineType::PointerRepresentation(), dst},
        {MachineRepresentation::kWord32, value},
        {MachineType::PointerRepresentation(), size}});
@@ -5251,12 +5339,10 @@ void WasmGraphBuilder::ElemDrop(uint32_t elem_segment_index,
 
   Node* elem_segments =
       LOAD_INSTANCE_FIELD(ElementSegments, MachineType::TaggedPointer());
-  auto store_rep = StoreRepresentation(MachineRepresentation::kTaggedPointer,
-                                       kFullWriteBarrier);
-  gasm_->Store(
-      store_rep, elem_segments,
-      wasm::ObjectAccess::ElementOffsetInTaggedFixedArray(elem_segment_index),
-      LOAD_ROOT(EmptyFixedArray, empty_fixed_array));
+  gasm_->StoreFixedArrayElement(
+      elem_segments, elem_segment_index,
+      LOAD_ROOT(EmptyFixedArray, empty_fixed_array),
+      ObjectAccess(MachineType::TaggedPointer(), kFullWriteBarrier));
 }
 
 void WasmGraphBuilder::TableCopy(uint32_t table_dst_index,
@@ -5269,10 +5355,9 @@ void WasmGraphBuilder::TableCopy(uint32_t table_dst_index,
 
 Node* WasmGraphBuilder::TableGrow(uint32_t table_index, Node* value,
                                   Node* delta) {
-  return gasm_->BuildChangeSmiToInt32(gasm_->CallRuntimeStub(
-      wasm::WasmCode::kWasmTableGrow, Operator::kNoThrow,
-      graph()->NewNode(mcgraph()->common()->NumberConstant(table_index)), delta,
-      value));
+  return gasm_->BuildChangeSmiToInt32(
+      gasm_->CallRuntimeStub(wasm::WasmCode::kWasmTableGrow, Operator::kNoThrow,
+                             gasm_->NumberConstant(table_index), delta, value));
 }
 
 Node* WasmGraphBuilder::TableSize(uint32_t table_index) {
@@ -5290,10 +5375,9 @@ Node* WasmGraphBuilder::TableSize(uint32_t table_index) {
 
 void WasmGraphBuilder::TableFill(uint32_t table_index, Node* start, Node* value,
                                  Node* count) {
-  gasm_->CallRuntimeStub(
-      wasm::WasmCode::kWasmTableFill, Operator::kNoThrow,
-      graph()->NewNode(mcgraph()->common()->NumberConstant(table_index)), start,
-      count, value);
+  gasm_->CallRuntimeStub(wasm::WasmCode::kWasmTableFill, Operator::kNoThrow,
+                         gasm_->NumberConstant(table_index), start, count,
+                         value);
 }
 
 Node* WasmGraphBuilder::DefaultValue(wasm::ValueType type) {
@@ -5372,10 +5456,12 @@ Node* WasmGraphBuilder::ArrayNew(uint32_t array_index,
       LOAD_ROOT(EmptyFixedArray, empty_fixed_array));
   gasm_->ArrayInitializeLength(a, length);
 
-  ArrayFillImpl(
-      a, gasm_->Int32Constant(0),
-      initial_value != nullptr ? initial_value : DefaultValue(element_type),
-      length, type, false);
+  ArrayFillImpl(a, gasm_->Int32Constant(0),
+                initial_value != nullptr
+                    ? initial_value
+                    : SetType(DefaultValue(element_type),
+                              type->element_type().Unpacked()),
+                length, type, false);
 
   return a;
 }
@@ -5401,32 +5487,57 @@ Node* WasmGraphBuilder::ArrayNewFixed(const wasm::ArrayType* type, Node* rtt,
   return array;
 }
 
-Node* WasmGraphBuilder::ArrayNewSegment(const wasm::ArrayType* type,
-                                        uint32_t data_segment, Node* offset,
+Node* WasmGraphBuilder::ArrayNewSegment(uint32_t segment_index, Node* offset,
                                         Node* length, Node* rtt,
+                                        bool is_element,
                                         wasm::WasmCodePosition position) {
-  return gasm_->CallBuiltin(
-      Builtin::kWasmArrayNewSegment, Operator::kNoDeopt | Operator::kNoThrow,
-      gasm_->Uint32Constant(data_segment), offset, length, rtt);
+  Node* array =
+      gasm_->CallBuiltin(Builtin::kWasmArrayNewSegment, Operator::kEliminatable,
+                         gasm_->Uint32Constant(segment_index), offset, length,
+                         gasm_->SmiConstant(is_element ? 1 : 0), rtt);
+  SetSourcePosition(array, position);
+  return array;
+}
+
+// TODO(jkummerow): This check would be more elegant if we made
+// {ArrayNewSegment} a high-level node that's lowered later.
+bool IsArrayNewSegment(Node* node) {
+  if (node->opcode() != IrOpcode::kCall) return false;
+  Node* callee = NodeProperties::GetValueInput(node, 0);
+  if (callee->opcode() != IrOpcode::kNumberConstant) return false;
+  double target = OpParameter<double>(callee->op());
+  return target == static_cast<double>(Builtin::kWasmArrayNewSegment);
+}
+
+void WasmGraphBuilder::ArrayInitSegment(uint32_t segment_index, Node* array,
+                                        Node* array_index, Node* segment_offset,
+                                        Node* length, bool is_element,
+                                        wasm::WasmCodePosition position) {
+  gasm_->CallBuiltin(Builtin::kWasmArrayInitSegment, Operator::kNoProperties,
+                     array_index, segment_offset, length,
+                     gasm_->SmiConstant(segment_index),
+                     gasm_->SmiConstant(is_element ? 1 : 0), array);
+  SetSourcePosition(control(), position);
 }
 
 Node* WasmGraphBuilder::RttCanon(uint32_t type_index) {
-  return graph()->NewNode(gasm_->simplified()->RttCanon(type_index),
-                          GetInstance());
+  Node* rtt = graph()->NewNode(gasm_->simplified()->RttCanon(type_index),
+                               GetInstance());
+  return SetType(rtt, wasm::ValueType::Rtt(type_index));
 }
 
 WasmGraphBuilder::Callbacks WasmGraphBuilder::TestCallbacks(
     GraphAssemblerLabel<1>* label) {
   return {// succeed_if
-          [=](Node* condition, BranchHint hint) -> void {
+          [this, label](Node* condition, BranchHint hint) -> void {
             gasm_->GotoIf(condition, label, hint, Int32Constant(1));
           },
           // fail_if
-          [=](Node* condition, BranchHint hint) -> void {
+          [this, label](Node* condition, BranchHint hint) -> void {
             gasm_->GotoIf(condition, label, hint, Int32Constant(0));
           },
           // fail_if_not
-          [=](Node* condition, BranchHint hint) -> void {
+          [this, label](Node* condition, BranchHint hint) -> void {
             gasm_->GotoIfNot(condition, label, hint, Int32Constant(0));
           }};
 }
@@ -5434,15 +5545,15 @@ WasmGraphBuilder::Callbacks WasmGraphBuilder::TestCallbacks(
 WasmGraphBuilder::Callbacks WasmGraphBuilder::CastCallbacks(
     GraphAssemblerLabel<0>* label, wasm::WasmCodePosition position) {
   return {// succeed_if
-          [=](Node* condition, BranchHint hint) -> void {
+          [this, label](Node* condition, BranchHint hint) -> void {
             gasm_->GotoIf(condition, label, hint);
           },
           // fail_if
-          [=](Node* condition, BranchHint hint) -> void {
+          [this, position](Node* condition, BranchHint hint) -> void {
             TrapIfTrue(wasm::kTrapIllegalCast, condition, position);
           },
           // fail_if_not
-          [=](Node* condition, BranchHint hint) -> void {
+          [this, position](Node* condition, BranchHint hint) -> void {
             TrapIfFalse(wasm::kTrapIllegalCast, condition, position);
           }};
 }
@@ -5513,11 +5624,29 @@ void WasmGraphBuilder::ManagedObjectInstanceCheck(Node* object,
                         BranchHint::kTrue);
 }
 
-void WasmGraphBuilder::BrOnCastAbs(
-    Node** match_control, Node** match_effect, Node** no_match_control,
-    Node** no_match_effect, std::function<void(Callbacks)> type_checker) {
+void WasmGraphBuilder::StringCheck(Node* object, bool object_can_be_null,
+                                   Callbacks callbacks, bool null_succeeds) {
+  if (object_can_be_null) {
+    if (null_succeeds) {
+      callbacks.succeed_if(IsNull(object, wasm::kWasmAnyRef),
+                           BranchHint::kFalse);
+    } else {
+      // The {IsDataRefMap} check below will fail for {null} anyway.
+    }
+  }
+  callbacks.fail_if(gasm_->IsSmi(object), BranchHint::kFalse);
+  Node* map = gasm_->LoadMap(object);
+  Node* instance_type = gasm_->LoadInstanceType(map);
+  Node* check = gasm_->Uint32LessThan(
+      instance_type, gasm_->Uint32Constant(FIRST_NONSTRING_TYPE));
+  callbacks.fail_if_not(check, BranchHint::kTrue);
+}
+
+WasmGraphBuilder::ResultNodesOfBr WasmGraphBuilder::BrOnCastAbs(
+    std::function<void(Callbacks)> type_checker) {
   SmallNodeVector no_match_controls, no_match_effects, match_controls,
       match_effects;
+  Node *match_control, *match_effect, *no_match_control, *no_match_effect;
 
   type_checker(BranchCallbacks(no_match_controls, no_match_effects,
                                match_controls, match_effects));
@@ -5529,27 +5658,29 @@ void WasmGraphBuilder::BrOnCastAbs(
   DCHECK_EQ(match_controls.size(), match_effects.size());
   unsigned match_count = static_cast<unsigned>(match_controls.size());
   if (match_count == 1) {
-    *match_control = match_controls[0];
-    *match_effect = match_effects[0];
+    match_control = match_controls[0];
+    match_effect = match_effects[0];
   } else {
-    *match_control = Merge(match_count, match_controls.data());
+    match_control = Merge(match_count, match_controls.data());
     // EffectPhis need their control dependency as an additional input.
-    match_effects.emplace_back(*match_control);
-    *match_effect = EffectPhi(match_count, match_effects.data());
+    match_effects.emplace_back(match_control);
+    match_effect = EffectPhi(match_count, match_effects.data());
   }
 
   DCHECK_EQ(no_match_controls.size(), no_match_effects.size());
   unsigned no_match_count = static_cast<unsigned>(no_match_controls.size());
   if (no_match_count == 1) {
-    *no_match_control = no_match_controls[0];
-    *no_match_effect = no_match_effects[0];
+    no_match_control = no_match_controls[0];
+    no_match_effect = no_match_effects[0];
   } else {
     // Range is 2..4, so casting to unsigned is safe.
-    *no_match_control = Merge(no_match_count, no_match_controls.data());
+    no_match_control = Merge(no_match_count, no_match_controls.data());
     // EffectPhis need their control dependency as an additional input.
-    no_match_effects.emplace_back(*no_match_control);
-    *no_match_effect = EffectPhi(no_match_count, no_match_effects.data());
+    no_match_effects.emplace_back(no_match_control);
+    no_match_effect = EffectPhi(no_match_count, no_match_effects.data());
   }
+
+  return {match_control, match_effect, no_match_control, no_match_effect};
 }
 
 Node* WasmGraphBuilder::RefTest(Node* object, Node* rtt,
@@ -5557,28 +5688,10 @@ Node* WasmGraphBuilder::RefTest(Node* object, Node* rtt,
   return gasm_->WasmTypeCheck(object, rtt, config);
 }
 
-Node* WasmGraphBuilder::RefTestAbstract(Node* object, wasm::HeapType type,
-                                        bool is_nullable, bool null_succeeds) {
-  switch (type.representation()) {
-    case wasm::HeapType::kEq:
-      return RefIsEq(object, is_nullable, null_succeeds);
-    case wasm::HeapType::kI31:
-      return RefIsI31(object, null_succeeds);
-    case wasm::HeapType::kStruct:
-      return RefIsStruct(object, is_nullable, null_succeeds);
-    case wasm::HeapType::kArray:
-      return RefIsArray(object, is_nullable, null_succeeds);
-    case wasm::HeapType::kNone:
-    case wasm::HeapType::kNoExtern:
-    case wasm::HeapType::kNoFunc:
-      DCHECK(null_succeeds);
-      return IsNull(object, wasm::ValueType::RefNull(type));
-    case wasm::HeapType::kAny:
-      // Any may never need a cast as it is either implicitly convertible or
-      // never convertible for any given type.
-    default:
-      UNREACHABLE();
-  }
+Node* WasmGraphBuilder::RefTestAbstract(Node* object,
+                                        WasmTypeCheckConfig config) {
+  DCHECK(!config.to.has_index());
+  return gasm_->WasmTypeCheckAbstract(object, config);
 }
 
 Node* WasmGraphBuilder::RefCast(Node* object, Node* rtt,
@@ -5589,202 +5702,87 @@ Node* WasmGraphBuilder::RefCast(Node* object, Node* rtt,
   return cast;
 }
 
-Node* WasmGraphBuilder::RefCastAbstract(Node* object, wasm::HeapType type,
-                                        wasm::WasmCodePosition position,
-                                        bool is_nullable, bool null_succeeds) {
-  switch (type.representation()) {
-    case wasm::HeapType::kEq:
-      return RefAsEq(object, is_nullable, position, null_succeeds);
-    case wasm::HeapType::kI31:
-      return RefAsI31(object, position, null_succeeds);
-    case wasm::HeapType::kStruct:
-      return RefAsStruct(object, is_nullable, position, null_succeeds);
-    case wasm::HeapType::kArray:
-      return RefAsArray(object, is_nullable, position, null_succeeds);
-    case wasm::HeapType::kNone:
-    case wasm::HeapType::kNoExtern:
-    case wasm::HeapType::kNoFunc: {
-      DCHECK(null_succeeds);
-      TrapIfFalse(wasm::kTrapIllegalCast,
-                  IsNull(object, wasm::ValueType::RefNull(type)), position);
-      return object;
-    }
-    case wasm::HeapType::kAny:
-      // Any may never need a cast as it is either implicitly convertible or
-      // never convertible for any given type.
-    default:
-      UNREACHABLE();
-  }
-}
-
-void WasmGraphBuilder::BrOnCast(Node* object, Node* rtt,
-                                WasmTypeCheckConfig config,
-                                Node** match_control, Node** match_effect,
-                                Node** no_match_control,
-                                Node** no_match_effect) {
-  Node* true_node;
-  Node* false_node;
-  BranchNoHint(gasm_->WasmTypeCheck(object, rtt, config), &true_node,
-               &false_node);
-
-  *match_effect = *no_match_effect = effect();
-  *match_control = true_node;
-  *no_match_control = false_node;
+Node* WasmGraphBuilder::RefCastAbstract(Node* object,
+                                        WasmTypeCheckConfig config,
+                                        wasm::WasmCodePosition position) {
+  DCHECK(!config.to.has_index());
+  Node* cast = gasm_->WasmTypeCastAbstract(object, config);
+  SetSourcePosition(cast, position);
+  return cast;
 }
 
-Node* WasmGraphBuilder::RefIsEq(Node* object, bool object_can_be_null,
-                                bool null_succeeds) {
-  auto done = gasm_->MakeLabel(MachineRepresentation::kWord32);
-  EqCheck(object, object_can_be_null, TestCallbacks(&done), null_succeeds);
-  gasm_->Goto(&done, Int32Constant(1));
-  gasm_->Bind(&done);
-  return done.PhiAt(0);
-}
+WasmGraphBuilder::ResultNodesOfBr WasmGraphBuilder::BrOnCast(
+    Node* object, Node* rtt, WasmTypeCheckConfig config) {
+  auto [true_node, false_node] =
+      BranchNoHint(gasm_->WasmTypeCheck(object, rtt, config));
 
-Node* WasmGraphBuilder::RefAsEq(Node* object, bool object_can_be_null,
-                                wasm::WasmCodePosition position,
-                                bool null_succeeds) {
-  auto done = gasm_->MakeLabel();
-  EqCheck(object, object_can_be_null, CastCallbacks(&done, position),
-          null_succeeds);
-  gasm_->Goto(&done);
-  gasm_->Bind(&done);
-  return object;
-}
-
-void WasmGraphBuilder::BrOnEq(Node* object, Node* /*rtt*/,
-                              WasmTypeCheckConfig config, Node** match_control,
-                              Node** match_effect, Node** no_match_control,
-                              Node** no_match_effect) {
-  BrOnCastAbs(match_control, match_effect, no_match_control, no_match_effect,
-              [=](Callbacks callbacks) -> void {
-                if (config.from.is_nullable()) {
-                  if (config.to.is_nullable()) {
-                    callbacks.succeed_if(gasm_->IsNull(object, config.from),
-                                         BranchHint::kFalse);
-                  } else {
-                    // The {IsDataRefMap} check below will fail for {null}.
-                  }
-                }
-                callbacks.succeed_if(gasm_->IsSmi(object), BranchHint::kFalse);
-                Node* map = gasm_->LoadMap(object);
-                callbacks.fail_if_not(gasm_->IsDataRefMap(map),
-                                      BranchHint::kTrue);
-              });
-}
-
-Node* WasmGraphBuilder::RefIsStruct(Node* object, bool object_can_be_null,
-                                    bool null_succeeds) {
-  auto done = gasm_->MakeLabel(MachineRepresentation::kWord32);
-  ManagedObjectInstanceCheck(object, object_can_be_null, WASM_STRUCT_TYPE,
-                             TestCallbacks(&done), null_succeeds);
-  gasm_->Goto(&done, Int32Constant(1));
-  gasm_->Bind(&done);
-  return done.PhiAt(0);
+  return {true_node,   // control on match
+          effect(),    // effect on match
+          false_node,  // control on no match
+          effect()};   // effect on no match
 }
 
-Node* WasmGraphBuilder::RefAsStruct(Node* object, bool object_can_be_null,
-                                    wasm::WasmCodePosition position,
-                                    bool null_succeeds) {
-  auto done = gasm_->MakeLabel();
-  ManagedObjectInstanceCheck(object, object_can_be_null, WASM_STRUCT_TYPE,
-                             CastCallbacks(&done, position), null_succeeds);
-  gasm_->Goto(&done);
-  gasm_->Bind(&done);
-  return object;
+WasmGraphBuilder::ResultNodesOfBr WasmGraphBuilder::BrOnEq(
+    Node* object, Node* /*rtt*/, WasmTypeCheckConfig config) {
+  return BrOnCastAbs([this, config, object](Callbacks callbacks) -> void {
+    if (config.from.is_nullable()) {
+      if (config.to.is_nullable()) {
+        callbacks.succeed_if(gasm_->IsNull(object, config.from),
+                             BranchHint::kFalse);
+      } else {
+        // The {IsDataRefMap} check below will fail for {null}.
+      }
+    }
+    callbacks.succeed_if(gasm_->IsSmi(object), BranchHint::kFalse);
+    Node* map = gasm_->LoadMap(object);
+    callbacks.fail_if_not(gasm_->IsDataRefMap(map), BranchHint::kTrue);
+  });
 }
 
-void WasmGraphBuilder::BrOnStruct(Node* object, Node* /*rtt*/,
-                                  WasmTypeCheckConfig config,
-                                  Node** match_control, Node** match_effect,
-                                  Node** no_match_control,
-                                  Node** no_match_effect) {
+WasmGraphBuilder::ResultNodesOfBr WasmGraphBuilder::BrOnStruct(
+    Node* object, Node* /*rtt*/, WasmTypeCheckConfig config) {
   bool null_succeeds = config.to.is_nullable();
-  BrOnCastAbs(match_control, match_effect, no_match_control, no_match_effect,
-              [=](Callbacks callbacks) -> void {
-                return ManagedObjectInstanceCheck(
-                    object, config.from.is_nullable(), WASM_STRUCT_TYPE,
-                    callbacks, null_succeeds);
-              });
-}
-
-Node* WasmGraphBuilder::RefIsArray(Node* object, bool object_can_be_null,
-                                   bool null_succeeds) {
-  auto done = gasm_->MakeLabel(MachineRepresentation::kWord32);
-  ManagedObjectInstanceCheck(object, object_can_be_null, WASM_ARRAY_TYPE,
-                             TestCallbacks(&done), null_succeeds);
-  gasm_->Goto(&done, Int32Constant(1));
-  gasm_->Bind(&done);
-  return done.PhiAt(0);
-}
-
-Node* WasmGraphBuilder::RefAsArray(Node* object, bool object_can_be_null,
-                                   wasm::WasmCodePosition position,
-                                   bool null_succeeds) {
-  auto done = gasm_->MakeLabel();
-  ManagedObjectInstanceCheck(object, object_can_be_null, WASM_ARRAY_TYPE,
-                             CastCallbacks(&done, position), null_succeeds);
-  gasm_->Goto(&done);
-  gasm_->Bind(&done);
-  return object;
+  return BrOnCastAbs(
+      [this, object, config, null_succeeds](Callbacks callbacks) -> void {
+        return ManagedObjectInstanceCheck(object, config.from.is_nullable(),
+                                          WASM_STRUCT_TYPE, callbacks,
+                                          null_succeeds);
+      });
 }
 
-void WasmGraphBuilder::BrOnArray(Node* object, Node* /*rtt*/,
-                                 WasmTypeCheckConfig config,
-                                 Node** match_control, Node** match_effect,
-                                 Node** no_match_control,
-                                 Node** no_match_effect) {
+WasmGraphBuilder::ResultNodesOfBr WasmGraphBuilder::BrOnArray(
+    Node* object, Node* /*rtt*/, WasmTypeCheckConfig config) {
   bool null_succeeds = config.to.is_nullable();
-  BrOnCastAbs(match_control, match_effect, no_match_control, no_match_effect,
-              [=](Callbacks callbacks) -> void {
-                return ManagedObjectInstanceCheck(
-                    object, config.from.is_nullable(), WASM_ARRAY_TYPE,
-                    callbacks, null_succeeds);
-              });
+  return BrOnCastAbs(
+      [this, config, object, null_succeeds](Callbacks callbacks) -> void {
+        return ManagedObjectInstanceCheck(object, config.from.is_nullable(),
+                                          WASM_ARRAY_TYPE, callbacks,
+                                          null_succeeds);
+      });
 }
 
-Node* WasmGraphBuilder::RefIsI31(Node* object, bool null_succeeds) {
-  if (null_succeeds) {
-    auto done = gasm_->MakeLabel(MachineRepresentation::kWord32);
-    gasm_->GotoIf(gasm_->IsSmi(object), &done, BranchHint::kTrue,
-                  Int32Constant(1));
-    gasm_->Goto(&done, gasm_->IsNull(object, wasm::kWasmAnyRef));
-    gasm_->Bind(&done);
-    return done.PhiAt(0);
-  }
-  return gasm_->IsSmi(object);
+WasmGraphBuilder::ResultNodesOfBr WasmGraphBuilder::BrOnI31(
+    Node* object, Node* /* rtt */, WasmTypeCheckConfig config) {
+  return BrOnCastAbs([this, object, config](Callbacks callbacks) -> void {
+    if (config.from.is_nullable()) {
+      if (config.to.is_nullable()) {
+        callbacks.succeed_if(gasm_->IsNull(object, config.from),
+                             BranchHint::kFalse);
+      } else {
+        // Covered by the {IsSmi} check below.
+      }
+    }
+    callbacks.fail_if_not(gasm_->IsSmi(object), BranchHint::kTrue);
+  });
 }
 
-Node* WasmGraphBuilder::RefAsI31(Node* object, wasm::WasmCodePosition position,
-                                 bool null_succeeds) {
-  if (null_succeeds) {
-    auto done = gasm_->MakeLabel();
-    gasm_->GotoIf(gasm_->IsNull(object, wasm::kWasmAnyRef), &done);
-    TrapIfFalse(wasm::kTrapIllegalCast, gasm_->IsSmi(object), position);
-    gasm_->Goto(&done);
-    gasm_->Bind(&done);
-    return object;
-  }
-  TrapIfFalse(wasm::kTrapIllegalCast, gasm_->IsSmi(object), position);
-  return object;
-}
-
-void WasmGraphBuilder::BrOnI31(Node* object, Node* /* rtt */,
-                               WasmTypeCheckConfig config, Node** match_control,
-                               Node** match_effect, Node** no_match_control,
-                               Node** no_match_effect) {
-  BrOnCastAbs(
-      match_control, match_effect, no_match_control, no_match_effect,
-      [=](Callbacks callbacks) -> void {
-        if (config.from.is_nullable()) {
-          if (config.to.is_nullable()) {
-            callbacks.succeed_if(gasm_->IsNull(object, config.from),
-                                 BranchHint::kFalse);
-          } else {
-            // Covered by the {IsSmi} check below.
-          }
-        }
-        callbacks.fail_if_not(gasm_->IsSmi(object), BranchHint::kTrue);
+WasmGraphBuilder::ResultNodesOfBr WasmGraphBuilder::BrOnString(
+    Node* object, Node* /*rtt*/, WasmTypeCheckConfig config) {
+  bool null_succeeds = config.to.is_nullable();
+  return BrOnCastAbs(
+      [this, config, object, null_succeeds](Callbacks callbacks) -> void {
+        return StringCheck(object, config.from.is_nullable(), callbacks,
+                           null_succeeds);
       });
 }
 
@@ -6099,8 +6097,36 @@ Node* WasmGraphBuilder::StringNewWtf8(uint32_t memory,
 }
 
 Node* WasmGraphBuilder::StringNewWtf8Array(unibrow::Utf8Variant variant,
-                                           Node* array, Node* start,
-                                           Node* end) {
+                                           Node* array, CheckForNull null_check,
+                                           Node* start, Node* end,
+                                           wasm::WasmCodePosition position) {
+  // Special case: shortcut a sequence "array from data segment" + "string from
+  // wtf8 array" to directly create a string from the segment.
+  if (IsArrayNewSegment(array)) {
+    // We can only pass 3 untagged parameters to the builtin (on 32-bit
+    // platforms). The segment index is easy to tag: if it validated, it must
+    // be in Smi range.
+    Node* segment_index = NodeProperties::GetValueInput(array, 1);
+    Uint32Matcher index_matcher(segment_index);
+    DCHECK(index_matcher.HasResolvedValue());
+    Node* segment_index_smi = gasm_->SmiConstant(index_matcher.ResolvedValue());
+    // Arbitrary choice for the second tagged parameter: the segment offset.
+    Node* segment_offset = NodeProperties::GetValueInput(array, 2);
+    TrapIfFalse(wasm::kTrapDataSegmentOutOfBounds,
+                gasm_->Uint32LessThan(segment_offset,
+                                      gasm_->Uint32Constant(Smi::kMaxValue)),
+                position);
+    Node* segment_offset_smi = gasm_->BuildChangeInt32ToSmi(segment_offset);
+    Node* segment_length = NodeProperties::GetValueInput(array, 3);
+    return gasm_->CallBuiltin(Builtin::kWasmStringFromDataSegment,
+                              Operator::kEliminatable, segment_length, start,
+                              end, segment_index_smi, segment_offset_smi);
+  }
+
+  // Regular path if the shortcut wasn't taken.
+  if (null_check == kWithNullCheck) {
+    array = AssertNotNull(array, wasm::kWasmArrayRef, position);
+  }
   return gasm_->CallBuiltin(
       Builtin::kWasmStringNewWtf8Array, Operator::kNoDeopt | Operator::kNoThrow,
       start, end, array, gasm_->SmiConstant(static_cast<int32_t>(variant)));
@@ -6113,8 +6139,13 @@ Node* WasmGraphBuilder::StringNewWtf16(uint32_t memory, Node* offset,
                             gasm_->Uint32Constant(memory), offset, size);
 }
 
-Node* WasmGraphBuilder::StringNewWtf16Array(Node* array, Node* start,
-                                            Node* end) {
+Node* WasmGraphBuilder::StringNewWtf16Array(Node* array,
+                                            CheckForNull null_check,
+                                            Node* start, Node* end,
+                                            wasm::WasmCodePosition position) {
+  if (null_check == kWithNullCheck) {
+    array = AssertNotNull(array, wasm::kWasmArrayRef, position);
+  }
   return gasm_->CallBuiltin(Builtin::kWasmStringNewWtf16Array,
                             Operator::kNoDeopt | Operator::kNoThrow, array,
                             start, end);
@@ -6150,9 +6181,7 @@ Node* WasmGraphBuilder::StringMeasureWtf16(Node* string,
   if (null_check == kWithNullCheck) {
     string = AssertNotNull(string, wasm::kWasmStringRef, position);
   }
-  return gasm_->LoadImmutableFromObject(
-      MachineType::Int32(), string,
-      wasm::ObjectAccess::ToTagged(String::kLengthOffset));
+  return gasm_->LoadStringLength(string);
 }
 
 Node* WasmGraphBuilder::StringEncodeWtf8(uint32_t memory,
@@ -6234,20 +6263,19 @@ Node* WasmGraphBuilder::StringConcat(Node* head, CheckForNull head_null_check,
       LOAD_INSTANCE_FIELD(NativeContext, MachineType::TaggedPointer()));
 }
 
-Node* WasmGraphBuilder::StringEqual(Node* a, CheckForNull a_null_check, Node* b,
-                                    CheckForNull b_null_check,
+Node* WasmGraphBuilder::StringEqual(Node* a, wasm::ValueType a_type, Node* b,
+                                    wasm::ValueType b_type,
                                     wasm::WasmCodePosition position) {
   auto done = gasm_->MakeLabel(MachineRepresentation::kWord32);
   // Covers "identical string pointer" and "both are null" cases.
   gasm_->GotoIf(gasm_->TaggedEqual(a, b), &done, Int32Constant(1));
-  if (a_null_check == kWithNullCheck) {
-    gasm_->GotoIf(gasm_->IsNull(a, wasm::kWasmStringRef), &done,
-                  Int32Constant(0));
+  if (a_type.is_nullable()) {
+    gasm_->GotoIf(gasm_->IsNull(a, a_type), &done, Int32Constant(0));
   }
-  if (b_null_check == kWithNullCheck) {
-    gasm_->GotoIf(gasm_->IsNull(b, wasm::kWasmStringRef), &done,
-                  Int32Constant(0));
+  if (b_type.is_nullable()) {
+    gasm_->GotoIf(gasm_->IsNull(b, b_type), &done, Int32Constant(0));
   }
+  // TODO(jkummerow): Call Builtin::kStringEqual directly.
   gasm_->Goto(&done, gasm_->CallBuiltin(Builtin::kWasmStringEqual,
                                         Operator::kEliminatable, a, b));
   gasm_->Bind(&done);
@@ -6324,9 +6352,7 @@ Node* WasmGraphBuilder::StringViewWtf16GetCodeUnit(
   Node* charwidth_shift = gasm_->Projection(2, prepare);
 
   // Bounds check.
-  Node* length = gasm_->LoadImmutableFromObject(
-      MachineType::Int32(), string,
-      wasm::ObjectAccess::ToTagged(String::kLengthOffset));
+  Node* length = gasm_->LoadStringLength(string);
   TrapIfFalse(wasm::kTrapStringOffsetOutOfBounds,
               gasm_->Uint32LessThan(offset, length), position);
 
@@ -6370,6 +6396,80 @@ Node* WasmGraphBuilder::StringViewWtf16GetCodeUnit(
   return done.PhiAt(0);
 }
 
+Node* WasmGraphBuilder::StringCodePointAt(Node* string, CheckForNull null_check,
+                                          Node* offset,
+                                          wasm::WasmCodePosition position) {
+  if (null_check == kWithNullCheck) {
+    string = AssertNotNull(string, wasm::kWasmStringRef, position);
+  }
+  Node* prepare = gasm_->StringPrepareForGetCodeunit(string);
+  Node* base = gasm_->Projection(0, prepare);
+  Node* base_offset = gasm_->Projection(1, prepare);
+  Node* charwidth_shift = gasm_->Projection(2, prepare);
+
+  // Bounds check.
+  Node* length = gasm_->LoadStringLength(string);
+  TrapIfFalse(wasm::kTrapStringOffsetOutOfBounds,
+              gasm_->Uint32LessThan(offset, length), position);
+
+  auto onebyte = gasm_->MakeLabel();
+  auto bailout = gasm_->MakeDeferredLabel();
+  auto done = gasm_->MakeLabel(MachineRepresentation::kWord32);
+  gasm_->GotoIf(
+      gasm_->Word32Equal(charwidth_shift,
+                         gasm_->Int32Constant(kCharWidthBailoutSentinel)),
+      &bailout);
+  gasm_->GotoIf(gasm_->Word32Equal(charwidth_shift, gasm_->Int32Constant(0)),
+                &onebyte);
+
+  // Two-byte.
+  Node* object_offset =
+      gasm_->IntAdd(gasm_->IntMul(gasm_->BuildChangeInt32ToIntPtr(offset),
+                                  gasm_->IntPtrConstant(2)),
+                    base_offset);
+  Node* lead = gasm_->LoadImmutableFromObject(MachineType::Uint16(), base,
+                                              object_offset);
+  Node* is_lead_surrogate =
+      gasm_->Word32Equal(gasm_->Word32And(lead, gasm_->Int32Constant(0xFC00)),
+                         gasm_->Int32Constant(0xD800));
+  gasm_->GotoIfNot(is_lead_surrogate, &done, lead);
+  Node* trail_offset = gasm_->Int32Add(offset, gasm_->Int32Constant(1));
+  gasm_->GotoIfNot(gasm_->Uint32LessThan(trail_offset, length), &done, lead);
+  Node* trail = gasm_->LoadImmutableFromObject(
+      MachineType::Uint16(), base,
+      gasm_->IntAdd(object_offset, gasm_->IntPtrConstant(2)));
+  Node* is_trail_surrogate =
+      gasm_->WordEqual(gasm_->Word32And(trail, gasm_->Int32Constant(0xFC00)),
+                       gasm_->Int32Constant(0xDC00));
+  gasm_->GotoIfNot(is_trail_surrogate, &done, lead);
+  Node* surrogate_bias =
+      gasm_->Int32Constant(0x10000 - (0xD800 << 10) - 0xDC00);
+  Node* result =
+      gasm_->Int32Add(gasm_->Word32Shl(lead, gasm_->Int32Constant(10)),
+                      gasm_->Int32Add(trail, surrogate_bias));
+  gasm_->Goto(&done, result);
+
+  // One-byte.
+  gasm_->Bind(&onebyte);
+  object_offset =
+      gasm_->IntAdd(gasm_->BuildChangeInt32ToIntPtr(offset), base_offset);
+  result =
+      gasm_->LoadImmutableFromObject(MachineType::Uint8(), base, object_offset);
+  gasm_->Goto(&done, result);
+
+  gasm_->Bind(&bailout);
+  gasm_->Goto(&done,
+              gasm_->CallRuntimeStub(wasm::WasmCode::kWasmStringCodePointAt,
+                                     Operator::kPure, string, offset));
+
+  gasm_->Bind(&done);
+  // Make sure the original string is kept alive as long as we're operating
+  // on pointers extracted from it (otherwise e.g. external strings' resources
+  // might get freed prematurely).
+  gasm_->Retain(string);
+  return done.PhiAt(0);
+}
+
 Node* WasmGraphBuilder::StringViewWtf16Encode(uint32_t memory, Node* string,
                                               CheckForNull null_check,
                                               Node* offset, Node* start,
@@ -6463,7 +6563,16 @@ Node* WasmGraphBuilder::StringCompare(Node* lhs, CheckForNull null_check_lhs,
       Builtin::kStringCompare, Operator::kEliminatable, lhs, rhs));
 }
 
+Node* WasmGraphBuilder::StringFromCharCode(Node* char_code) {
+  Node* capped = gasm_->Word32And(char_code, gasm_->Uint32Constant(0xFFFF));
+  return gasm_->CallBuiltin(Builtin::kWasmStringFromCodePoint,
+                            Operator::kEliminatable, capped);
+}
+
 Node* WasmGraphBuilder::StringFromCodePoint(Node* code_point) {
+  // TODO(jkummerow): Refactor the code in
+  // EffectControlLinearizer::LowerStringFromSingleCodePoint to make it
+  // accessible for Wasm.
   return gasm_->CallBuiltin(Builtin::kWasmStringFromCodePoint,
                             Operator::kEliminatable, code_point);
 }
@@ -6541,6 +6650,84 @@ void WasmGraphBuilder::BuildModifyThreadInWasmFlag(bool new_value) {
   BuildModifyThreadInWasmFlagHelper(thread_in_wasm_flag_address, new_value);
 }
 
+Node* WasmGraphBuilder::WellKnown_StringIndexOf(
+    Node* string, Node* search, Node* start, CheckForNull string_null_check,
+    CheckForNull search_null_check) {
+  if (string_null_check == kWithNullCheck) {
+    // If string is null, throw.
+    auto if_not_null = gasm_->MakeLabel();
+    auto if_null = gasm_->MakeDeferredLabel();
+    gasm_->GotoIf(IsNull(string, wasm::kWasmStringRef), &if_null);
+    gasm_->Goto(&if_not_null);
+    gasm_->Bind(&if_null);
+    gasm_->CallBuiltin(Builtin::kThrowIndexOfCalledOnNull, Operator::kNoWrite);
+    gasm_->Unreachable();
+    gasm_->Bind(&if_not_null);
+  }
+  if (search_null_check == kWithNullCheck) {
+    // If search is null, replace it with "null".
+    auto search_not_null =
+        gasm_->MakeLabel(MachineRepresentation::kTaggedPointer);
+    gasm_->GotoIfNot(IsNull(search, wasm::kWasmStringRef), &search_not_null,
+                     search);
+    Node* null_string = LOAD_ROOT(null_string, null_string);
+    gasm_->Goto(&search_not_null, null_string);
+    gasm_->Bind(&search_not_null);
+    search = search_not_null.PhiAt(0);
+  }
+  {
+    // Clamp the start index.
+    auto clamped_start = gasm_->MakeLabel(MachineRepresentation::kWord32);
+    gasm_->GotoIf(gasm_->Int32LessThan(start, Int32Constant(0)), &clamped_start,
+                  Int32Constant(0));
+    Node* length = gasm_->LoadStringLength(string);
+    gasm_->GotoIf(gasm_->Int32LessThan(start, length), &clamped_start, start);
+    gasm_->Goto(&clamped_start, length);
+    gasm_->Bind(&clamped_start);
+    start = clamped_start.PhiAt(0);
+  }
+
+  BuildModifyThreadInWasmFlag(false);
+  // This can't overflow because we've clamped {start} above.
+  Node* start_smi = gasm_->BuildChangeInt32ToSmi(start);
+  Node* result =
+      gasm_->CallBuiltin(Builtin::kStringIndexOf, Operator::kEliminatable,
+                         string, search, start_smi);
+  BuildModifyThreadInWasmFlag(true);
+  return gasm_->BuildChangeSmiToInt32(result);
+}
+
+Node* WasmGraphBuilder::WellKnown_StringToLocaleLowerCaseStringref(
+    int func_index, Node* string, Node* locale,
+    CheckForNull string_null_check) {
+#if V8_INTL_SUPPORT
+  if (string_null_check == kWithNullCheck) {
+    // We can let the builtin throw the exception, but it only checks for
+    // JS null, so we must externalize any Wasm null here.
+    // Externalizing the {locale} is not required, because
+    // {Object::ConvertToString} has been taught how to deal with WasmNull.
+    string = gasm_->WasmExternExternalize(string);
+  }
+  int param_count = 2;  // String, locale.
+  CallDescriptor* call_descriptor = Linkage::GetJSCallDescriptor(
+      zone_, false, param_count, CallDescriptor::kCanUseRoots,
+      Operator::kNoDeopt | Operator::kNoWrite);
+  Node* callees_array =
+      LOAD_INSTANCE_FIELD(WellKnownImports, MachineType::TaggedPointer());
+  Node* callee = gasm_->LoadFixedArrayElementPtr(callees_array, func_index);
+  Node* context = gasm_->LoadContextFromJSFunction(callee);
+  BuildModifyThreadInWasmFlag(false);
+  Node* result = gasm_->Call(call_descriptor, callee, string, locale,
+                             UndefinedValue(),                   // new.target
+                             gasm_->Int32Constant(param_count),  // argc
+                             context);                           // context
+  BuildModifyThreadInWasmFlag(true);
+  return result;
+#else
+  UNREACHABLE();
+#endif
+}
+
 Node* WasmGraphBuilder::WellKnown_StringToLowerCaseStringref(
     Node* string, CheckForNull null_check) {
 #if V8_INTL_SUPPORT
@@ -6566,6 +6753,47 @@ Node* WasmGraphBuilder::WellKnown_StringToLowerCaseStringref(
 #endif
 }
 
+Node* WasmGraphBuilder::WellKnown_ParseFloat(Node* string,
+                                             CheckForNull null_check) {
+  if (null_check == kWithNullCheck) {
+    auto done = gasm_->MakeLabel(MachineRepresentation::kFloat64);
+    auto if_null = gasm_->MakeDeferredLabel();
+    gasm_->GotoIf(IsNull(string, wasm::kWasmStringRef), &if_null);
+    BuildModifyThreadInWasmFlag(false);
+    Node* result = gasm_->CallBuiltin(Builtin::kWasmStringToDouble,
+                                      Operator::kEliminatable, string);
+    BuildModifyThreadInWasmFlag(true);
+    gasm_->Goto(&done, result);
+    gasm_->Bind(&if_null);
+    gasm_->Goto(&done,
+                Float64Constant(std::numeric_limits<double>::quiet_NaN()));
+    gasm_->Bind(&done);
+    return done.PhiAt(0);
+  } else {
+    BuildModifyThreadInWasmFlag(false);
+    Node* result = gasm_->CallBuiltin(Builtin::kWasmStringToDouble,
+                                      Operator::kEliminatable, string);
+    BuildModifyThreadInWasmFlag(true);
+    return result;
+  }
+}
+
+Node* WasmGraphBuilder::WellKnown_DoubleToString(Node* n) {
+  BuildModifyThreadInWasmFlag(false);
+  Node* result = gasm_->CallBuiltin(Builtin::kWasmFloat64ToString,
+                                    Operator::kEliminatable, n);
+  BuildModifyThreadInWasmFlag(true);
+  return result;
+}
+
+Node* WasmGraphBuilder::WellKnown_IntToString(Node* n, Node* radix) {
+  BuildModifyThreadInWasmFlag(false);
+  Node* result = gasm_->CallBuiltin(Builtin::kWasmIntToString,
+                                    Operator::kNoDeopt, n, radix);
+  BuildModifyThreadInWasmFlag(true);
+  return result;
+}
+
 Node* WasmGraphBuilder::I31New(Node* input) {
   if constexpr (SmiValuesAre31Bits()) {
     return gasm_->Word32Shl(input, gasm_->BuildSmiShiftBitsConstant32());
@@ -6624,7 +6852,19 @@ Node* WasmGraphBuilder::SetType(Node* node, wasm::ValueType type) {
   } else {
     // We might try to set the type twice since some nodes are cached in the
     // graph assembler, but we should never change the type.
-    DCHECK_EQ(compiler::NodeProperties::GetType(node).AsWasm().type, type);
+    // The exception is imported strings support, which may special-case
+    // values that are officially externref-typed as being known to be strings.
+#if DEBUG
+    static constexpr wasm::ValueType kRefString =
+        wasm::ValueType::Ref(wasm::HeapType::kString);
+    static constexpr wasm::ValueType kRefExtern =
+        wasm::ValueType::Ref(wasm::HeapType::kExtern);
+    DCHECK(
+        (compiler::NodeProperties::GetType(node).AsWasm().type == type) ||
+        (enabled_features_.has_imported_strings() &&
+         compiler::NodeProperties::GetType(node).AsWasm().type == kRefString &&
+         (type == wasm::kWasmExternRef || type == kRefExtern)));
+#endif
   }
   return node;
 }
@@ -6760,6 +7000,8 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
                                    target, value, context, frame_state)
                      : gasm_->Call(tagged_non_smi_to_int32_operator_.get(),
                                    target, value, context);
+    // The source position here is needed for asm.js, see the comment on the
+    // source position of the call to JavaScript in the wasm-to-js wrapper.
     SetSourcePosition(call, 1);
     gasm_->Goto(&done, call);
     gasm_->Bind(&done);
@@ -6785,7 +7027,7 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
                                            Builtin::kWasmFloat64ToNumber);
     if (!float64_to_number_operator_.is_set()) {
       auto call_descriptor = Linkage::GetStubCallDescriptor(
-          mcgraph()->zone(), WasmFloat64ToNumberDescriptor(), 0,
+          mcgraph()->zone(), WasmFloat64ToTaggedDescriptor(), 0,
           CallDescriptor::kNoFlags, Operator::kNoProperties, stub_mode_);
       float64_to_number_operator_.set(common->Call(call_descriptor));
     }
@@ -6811,6 +7053,8 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
                                    value, context, frame_state)
                      : gasm_->Call(tagged_to_float64_operator_.get(), target,
                                    value, context);
+    // The source position here is needed for asm.js, see the comment on the
+    // source position of the call to JavaScript in the wasm-to-js wrapper.
     SetSourcePosition(call, 1);
     return call;
   }
@@ -6861,10 +7105,21 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
             if (type.heap_representation() == wasm::HeapType::kFunc ||
                 module_->has_signature(type.ref_index())) {
               // Typed function. Extract the external function.
-              return gasm_->LoadFromObject(
+              auto done =
+                  gasm_->MakeLabel(MachineRepresentation::kTaggedPointer);
+              Node* maybe_external = gasm_->LoadFromObject(
                   MachineType::TaggedPointer(), node,
                   wasm::ObjectAccess::ToTagged(
                       WasmInternalFunction::kExternalOffset));
+              gasm_->GotoIfNot(
+                  gasm_->TaggedEqual(maybe_external, UndefinedValue()), &done,
+                  maybe_external);
+              Node* from_builtin = gasm_->CallBuiltin(
+                  Builtin::kWasmInternalFunctionCreateExternal,
+                  Operator::kNoProperties, node, context);
+              gasm_->Goto(&done, from_builtin);
+              gasm_->Bind(&done);
+              return done.PhiAt(0);
             } else {
               return node;
             }
@@ -6897,11 +7152,17 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
                   gasm_->MakeLabel(MachineRepresentation::kTaggedPointer);
               auto null_label = gasm_->MakeLabel();
               gasm_->GotoIf(IsNull(node, type), &null_label);
-              gasm_->Goto(&done,
-                          gasm_->LoadFromObject(
-                              MachineType::TaggedPointer(), node,
-                              wasm::ObjectAccess::ToTagged(
-                                  WasmInternalFunction::kExternalOffset)));
+              Node* maybe_external = gasm_->LoadFromObject(
+                  MachineType::TaggedPointer(), node,
+                  wasm::ObjectAccess::ToTagged(
+                      WasmInternalFunction::kExternalOffset));
+              gasm_->GotoIfNot(
+                  gasm_->TaggedEqual(maybe_external, UndefinedValue()), &done,
+                  maybe_external);
+              Node* from_builtin = gasm_->CallBuiltin(
+                  Builtin::kWasmInternalFunctionCreateExternal,
+                  Operator::kNoProperties, node, context);
+              gasm_->Goto(&done, from_builtin);
               gasm_->Bind(&null_label);
               gasm_->Goto(&done, LOAD_ROOT(NullValue, null_value));
               gasm_->Bind(&done);
@@ -6978,9 +7239,27 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
       case wasm::kRef:
       case wasm::kRefNull: {
         switch (type.heap_representation()) {
-          // TODO(7748): Add more fast paths?
+          // TODO(14034): Add more fast paths?
           case wasm::HeapType::kExtern:
           case wasm::HeapType::kNoExtern:
+            if (type.kind() == wasm::kRef) {
+              Node* null_value = gasm_->LoadImmutable(
+                  MachineType::Pointer(), gasm_->LoadRootRegister(),
+                  IsolateData::root_slot_offset(RootIndex::kNullValue));
+              auto throw_label = gasm_->MakeDeferredLabel();
+              auto done = gasm_->MakeLabel();
+              gasm_->GotoIf(gasm_->TaggedEqual(input, null_value),
+                            &throw_label);
+              gasm_->Goto(&done);
+
+              gasm_->Bind(&throw_label);
+              BuildCallToRuntimeWithContext(Runtime::kWasmThrowJSTypeError,
+                                            js_context, {}, 0);
+              gasm_->Unreachable();
+
+              gasm_->Bind(&done);
+              return input;
+            }
             return input;
           case wasm::HeapType::kString:
             return BuildCheckString(input, js_context, type);
@@ -7394,33 +7673,72 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
   }
 
   Node* BuildSuspend(Node* value, Node* suspender, Node* api_function_ref) {
+    Node* native_context = gasm_->Load(
+        MachineType::TaggedPointer(), api_function_ref,
+        wasm::ObjectAccess::ToTagged(WasmApiFunctionRef::kNativeContextOffset));
+    Node* active_suspender =
+        LOAD_MUTABLE_ROOT(ActiveSuspender, active_suspender);
+
     // If value is a promise, suspend to the js-to-wasm prompt, and resume later
     // with the promise's resolved value.
     auto resume = gasm_->MakeLabel(MachineRepresentation::kTagged);
+    gasm_->GotoIf(IsSmi(value), &resume, value);
+    gasm_->GotoIfNot(gasm_->HasInstanceType(value, JS_PROMISE_TYPE), &resume,
+                     BranchHint::kTrue, value);
+
     // Trap if the suspender argument is not the active suspender or if there is
     // no active suspender.
     auto bad_suspender = gasm_->MakeDeferredLabel();
-    Node* native_context = gasm_->Load(
-        MachineType::TaggedPointer(), api_function_ref,
-        wasm::ObjectAccess::ToTagged(WasmApiFunctionRef::kNativeContextOffset));
-    Node* active_suspender =
-        LOAD_MUTABLE_ROOT(ActiveSuspender, active_suspender);
     gasm_->GotoIf(gasm_->TaggedEqual(active_suspender, UndefinedValue()),
                   &bad_suspender, BranchHint::kFalse);
     gasm_->GotoIfNot(gasm_->TaggedEqual(suspender, active_suspender),
                      &bad_suspender, BranchHint::kFalse);
-    gasm_->GotoIf(IsSmi(value), &resume, value);
-    gasm_->GotoIfNot(gasm_->HasInstanceType(value, JS_PROMISE_TYPE), &resume,
-                     BranchHint::kTrue, value);
+
     auto* call_descriptor =
         GetBuiltinCallDescriptor(Builtin::kWasmSuspend, zone_, stub_mode_);
     Node* call_target = GetTargetForBuiltinCall(wasm::WasmCode::kWasmSuspend,
                                                 Builtin::kWasmSuspend);
-    Node* args[] = {value, suspender};
-    Node* chained_promise = BuildCallToRuntimeWithContext(
-        Runtime::kWasmCreateResumePromise, native_context, args, 2);
-    Node* resolved =
-        gasm_->Call(call_descriptor, call_target, chained_promise, suspender);
+    // Trap if there is any JS frame on the stack. Trap before decrementing the
+    // wasm-to-js counter, since it will already be decremented by the stack
+    // unwinder.
+    Node* counter =
+        gasm_->Load(MachineType::Int32(), suspender,
+                    wasm::ObjectAccess::ToTagged(
+                        WasmSuspenderObject::kWasmToJsCounterOffset));
+    // The counter is about to be decremented, so 1 means no JS frame.
+    Node* cond = gasm_->Word32Equal(Int32Constant(1), counter);
+    auto suspend = gasm_->MakeLabel();
+    gasm_->GotoIf(cond, &suspend);
+    // {ThrowWasmError} expects to be called from wasm code, so set the
+    // thread-in-wasm flag now.
+    // Usually we set this flag later so that it stays off while we convert the
+    // return values. This is a special case, it is safe to set it now because
+    // the error will unwind this frame.
+    BuildModifyThreadInWasmFlag(true);
+    Node* error = gasm_->SmiConstant(
+        Smi::FromInt(
+            static_cast<int32_t>(MessageTemplate::kWasmTrapSuspendJSFrames))
+            .value());
+    BuildCallToRuntimeWithContext(Runtime::kThrowWasmError, native_context,
+                                  &error, 1);
+    TerminateThrow(effect(), control());
+
+    gasm_->Bind(&suspend);
+    Node* on_fulfilled = gasm_->Load(
+        MachineType::TaggedPointer(), suspender,
+        wasm::ObjectAccess::ToTagged(WasmSuspenderObject::kResumeOffset));
+    Node* on_rejected = gasm_->Load(
+        MachineType::TaggedPointer(), suspender,
+        wasm::ObjectAccess::ToTagged(WasmSuspenderObject::kRejectOffset));
+
+    auto* then_call_desc = GetBuiltinCallDescriptor(
+        Builtin::kPerformPromiseThen, zone_, StubCallMode::kCallBuiltinPointer);
+    Node* then_target =
+        gasm_->GetBuiltinPointerTarget(Builtin::kPerformPromiseThen);
+    gasm_->Call(then_call_desc, then_target, value, on_fulfilled, on_rejected,
+                UndefinedValue(), native_context);
+
+    Node* resolved = gasm_->Call(call_descriptor, call_target, suspender);
     gasm_->Goto(&resume, resolved);
     gasm_->Bind(&bad_suspender);
     BuildCallToRuntimeWithContext(Runtime::kThrowBadSuspenderError,
@@ -7461,6 +7779,32 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
 
     Node* call = nullptr;
 
+    Node* active_suspender;
+    if (v8_flags.experimental_wasm_stack_switching) {
+      // Increment the wasm-to-js counter before the call, and decrement it on
+      // return.
+      active_suspender = gasm_->Load(
+          MachineType::Pointer(), BuildLoadIsolateRoot(),
+          IsolateData::root_slot_offset(RootIndex::kActiveSuspender));
+      auto done = gasm_->MakeLabel();
+      Node* no_suspender =
+          gasm_->TaggedEqual(active_suspender, UndefinedValue());
+      gasm_->GotoIf(no_suspender, &done);
+      Node* counter =
+          gasm_->Load(MachineType::Int32(), active_suspender,
+                      wasm::ObjectAccess::ToTagged(
+                          WasmSuspenderObject::kWasmToJsCounterOffset));
+      counter = gasm_->Int32Add(counter, Int32Constant(1));
+      gasm_->Store(
+          StoreRepresentation(MachineRepresentation::kWord32, kNoWriteBarrier),
+          active_suspender,
+          wasm::ObjectAccess::ToTagged(
+              WasmSuspenderObject::kWasmToJsCounterOffset),
+          counter);
+      gasm_->Goto(&done);
+      gasm_->Bind(&done);
+    }
+
     // Clear the ThreadInWasm flag.
     BuildModifyThreadInWasmFlag(false);
 
@@ -7496,9 +7840,6 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
 
         DCHECK_EQ(pos, args.size());
         call = gasm_->Call(call_descriptor, pos, args.begin());
-        if (suspend) {
-          call = BuildSuspend(call, Param(1), Param(0));
-        }
         break;
       }
       // =======================================================================
@@ -7534,9 +7875,6 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
         auto call_descriptor = Linkage::GetJSCallDescriptor(
             graph()->zone(), false, pushed_count + 1, CallDescriptor::kNoFlags);
         call = gasm_->Call(call_descriptor, pos, args.begin());
-        if (suspend) {
-          call = BuildSuspend(call, Param(1), Param(0));
-        }
         break;
       }
       // =======================================================================
@@ -7572,9 +7910,6 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
 
         DCHECK_EQ(pos, args.size());
         call = gasm_->Call(call_descriptor, pos, args.begin());
-        if (suspend) {
-          call = BuildSuspend(call, Param(1), Param(0));
-        }
         break;
       }
       default:
@@ -7582,8 +7917,41 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
     }
     DCHECK_NOT_NULL(call);
 
+    // For asm.js the error location can differ depending on whether an
+    // exception was thrown in imported JS code or an exception was thrown in
+    // the ToNumber builtin that converts the result of the JS code a
+    // WebAssembly value. The source position allows asm.js to determine the
+    // correct error location. Source position 1 encodes the call to ToNumber,
+    // source position 0 encodes the call to the imported JS code.
     SetSourcePosition(call, 0);
 
+    if (v8_flags.experimental_wasm_stack_switching) {
+      if (suspend) {
+        call = BuildSuspend(call, Param(1), Param(0));
+      }
+      auto done = gasm_->MakeLabel();
+      Node* no_suspender =
+          gasm_->TaggedEqual(active_suspender, UndefinedValue());
+      gasm_->GotoIf(no_suspender, &done);
+      // Decrement the wasm-to-js counter.
+      active_suspender = gasm_->Load(
+          MachineType::Pointer(), BuildLoadIsolateRoot(),
+          IsolateData::root_slot_offset(RootIndex::kActiveSuspender));
+      Node* counter =
+          gasm_->Load(MachineType::Int32(), active_suspender,
+                      wasm::ObjectAccess::ToTagged(
+                          WasmSuspenderObject::kWasmToJsCounterOffset));
+      counter = gasm_->Int32Sub(counter, Int32Constant(1));
+      gasm_->Store(
+          StoreRepresentation(MachineRepresentation::kWord32, kNoWriteBarrier),
+          active_suspender,
+          wasm::ObjectAccess::ToTagged(
+              WasmSuspenderObject::kWasmToJsCounterOffset),
+          counter);
+      gasm_->Goto(&done);
+      gasm_->Bind(&done);
+    }
+
     // Convert the return value(s) back.
     if (sig_->return_count() <= 1) {
       Node* val = sig_->return_count() == 0
@@ -7728,7 +8096,7 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
     Handle<JSFunction> target;
     Node* target_node;
     Node* receiver_node;
-    if (callable->IsJSBoundFunction()) {
+    if (IsJSBoundFunction(*callable)) {
       target = handle(
           JSFunction::cast(
               Handle<JSBoundFunction>::cast(callable)->bound_target_function()),
@@ -7741,17 +8109,17 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
           MachineType::TaggedPointer(), callable_node,
           wasm::ObjectAccess::ToTagged(JSBoundFunction::kBoundThisOffset));
     } else {
-      DCHECK(callable->IsJSFunction());
+      DCHECK(IsJSFunction(*callable));
       target = Handle<JSFunction>::cast(callable);
       target_node = callable_node;
       receiver_node =
           BuildReceiverNode(callable_node, native_context, undefined_node);
     }
 
-    SharedFunctionInfo shared = target->shared();
-    FunctionTemplateInfo api_func_data = shared.get_api_func_data();
-    const Address c_address = api_func_data.GetCFunction(0);
-    const v8::CFunctionInfo* c_signature = api_func_data.GetCSignature(0);
+    Tagged<SharedFunctionInfo> shared = target->shared();
+    Tagged<FunctionTemplateInfo> api_func_data = shared->api_func_data();
+    const Address c_address = api_func_data->GetCFunction(0);
+    const v8::CFunctionInfo* c_signature = api_func_data->GetCSignature(0);
 
 #ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
     Address c_functions[] = {c_address};
@@ -7811,16 +8179,12 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
         },
         // Initialize wasm-specific callback options fields
         [this](Node* options_stack_slot) {
-#ifdef V8_ENABLE_SANDBOX
+          // TODO(14260): Do we need to support multiple memories for the fast
+          // API?
           Node* mem_start = LOAD_INSTANCE_FIELD_NO_ELIMINATION(
-              MemoryStart, MachineType::SandboxedPointer());
-#else
-          Node* mem_start = LOAD_INSTANCE_FIELD_NO_ELIMINATION(
-              MemoryStart, MachineType::UintPtr());
-#endif
-
+              Memory0Start, kMaybeSandboxedPointer);
           Node* mem_size = LOAD_INSTANCE_FIELD_NO_ELIMINATION(
-              MemorySize, MachineType::UintPtr());
+              Memory0Size, MachineType::UintPtr());
 
           constexpr int kSize = sizeof(FastApiTypedArray<uint8_t>);
           constexpr int kAlign = alignof(FastApiTypedArray<uint8_t>);
@@ -7964,6 +8328,8 @@ class WasmWrapperGraphBuilder : public WasmGraphBuilder {
       }
     }
     Return(jsval);
+
+    if (ContainsInt64(sig_)) LowerInt64(kCalledFromJS);
   }
 
   void BuildCWasmEntry() {
@@ -8150,6 +8516,15 @@ wasm::WasmOpcode GetMathIntrinsicOpcode(wasm::ImportCallKind kind,
 #undef CASE
 }
 
+MachineGraph* CreateCommonMachineGraph(Zone* zone) {
+  return zone->New<MachineGraph>(
+      zone->New<Graph>(zone), zone->New<CommonOperatorBuilder>(zone),
+      zone->New<MachineOperatorBuilder>(
+          zone, MachineType::PointerRepresentation(),
+          InstructionSelector::SupportedMachineOperatorFlags(),
+          InstructionSelector::AlignmentRequirements()));
+}
+
 wasm::WasmCompilationResult CompileWasmMathIntrinsic(
     wasm::ImportCallKind kind, const wasm::FunctionSig* sig) {
   DCHECK_EQ(1, sig->return_count());
@@ -8162,17 +8537,10 @@ wasm::WasmCompilationResult CompileWasmMathIntrinsic(
   // Compile a Wasm function with a single bytecode and let TurboFan
   // generate either inlined machine code or a call to a helper.
   SourcePositionTable* source_positions = nullptr;
-  MachineGraph* mcgraph = zone.New<MachineGraph>(
-      zone.New<Graph>(&zone), zone.New<CommonOperatorBuilder>(&zone),
-      zone.New<MachineOperatorBuilder>(
-          &zone, MachineType::PointerRepresentation(),
-          InstructionSelector::SupportedMachineOperatorFlags(),
-          InstructionSelector::AlignmentRequirements()));
+  MachineGraph* mcgraph = CreateCommonMachineGraph(&zone);
 
-  wasm::CompilationEnv env(
-      nullptr, wasm::kNoBoundsChecks,
-      wasm::RuntimeExceptionSupport::kNoRuntimeExceptionSupport,
-      wasm::WasmFeatures::All(), wasm::kNoDynamicTiering);
+  wasm::CompilationEnv env(nullptr, wasm::WasmFeatures::All(),
+                           wasm::kNoDynamicTiering);
 
   WasmGraphBuilder builder(&env, mcgraph->zone(), mcgraph, sig,
                            source_positions);
@@ -8292,14 +8660,8 @@ wasm::WasmCode* CompileWasmCapiCallWrapper(wasm::NativeModule* native_module,
 
   Zone zone(wasm::GetWasmEngine()->allocator(), ZONE_NAME, kCompressGraphZone);
 
-  // TODO(jkummerow): Extract common code into helper method.
   SourcePositionTable* source_positions = nullptr;
-  MachineGraph* mcgraph = zone.New<MachineGraph>(
-      zone.New<Graph>(&zone), zone.New<CommonOperatorBuilder>(&zone),
-      zone.New<MachineOperatorBuilder>(
-          &zone, MachineType::PointerRepresentation(),
-          InstructionSelector::SupportedMachineOperatorFlags(),
-          InstructionSelector::AlignmentRequirements()));
+  MachineGraph* mcgraph = CreateCommonMachineGraph(&zone);
 
   WasmWrapperGraphBuilder builder(
       &zone, mcgraph, sig, native_module->module(),
@@ -8321,7 +8683,6 @@ wasm::WasmCode* CompileWasmCapiCallWrapper(wasm::NativeModule* native_module,
       WasmStubAssemblerOptions(), source_positions);
   wasm::WasmCode* published_code;
   {
-    wasm::CodeSpaceWriteScope code_space_write_scope(native_module);
     std::unique_ptr<wasm::WasmCode> wasm_code = native_module->AddCode(
         wasm::kAnonymousFuncIndex, result.code_desc, result.frame_slot_count,
         result.tagged_parameter_slots,
@@ -8344,15 +8705,8 @@ wasm::WasmCode* CompileWasmJSFastCallWrapper(wasm::NativeModule* native_module,
                "wasm.CompileWasmJSFastCallWrapper");
 
   Zone zone(wasm::GetWasmEngine()->allocator(), ZONE_NAME, kCompressGraphZone);
-
-  // TODO(jkummerow): Extract common code into helper method.
   SourcePositionTable* source_positions = nullptr;
-  MachineGraph* mcgraph = zone.New<MachineGraph>(
-      zone.New<Graph>(&zone), zone.New<CommonOperatorBuilder>(&zone),
-      zone.New<MachineOperatorBuilder>(
-          &zone, MachineType::PointerRepresentation(),
-          InstructionSelector::SupportedMachineOperatorFlags(),
-          InstructionSelector::AlignmentRequirements()));
+  MachineGraph* mcgraph = CreateCommonMachineGraph(&zone);
 
   WasmWrapperGraphBuilder builder(
       &zone, mcgraph, sig, native_module->module(),
@@ -8378,7 +8732,6 @@ wasm::WasmCode* CompileWasmJSFastCallWrapper(wasm::NativeModule* native_module,
       call_descriptor, mcgraph, CodeKind::WASM_TO_JS_FUNCTION, debug_name,
       WasmStubAssemblerOptions(), source_positions);
   {
-    wasm::CodeSpaceWriteScope code_space_write_scope(native_module);
     std::unique_ptr<wasm::WasmCode> wasm_code = native_module->AddCode(
         wasm::kAnonymousFuncIndex, result.code_desc, result.frame_slot_count,
         result.tagged_parameter_slots,
@@ -8424,6 +8777,9 @@ MaybeHandle<Code> CompileWasmToJSWrapper(Isolate* isolate,
   // Generate the call descriptor.
   CallDescriptor* incoming =
       GetWasmCallDescriptor(zone.get(), sig, WasmCallKind::kWasmImportWrapper);
+  if (machine->Is32()) {
+    incoming = GetI32WasmCallDescriptor(zone.get(), incoming);
+  }
 
   // Run the compilation job synchronously.
   std::unique_ptr<TurbofanCompilationJob> job(
@@ -8563,36 +8919,6 @@ void BuildGraphForWasmFunction(wasm::CompilationEnv* env,
 #endif
 }
 
-base::Vector<const char> GetDebugName(Zone* zone,
-                                      const wasm::WasmModule* module,
-                                      const wasm::WireBytesStorage* wire_bytes,
-                                      int index) {
-  base::Optional<wasm::ModuleWireBytes> module_bytes =
-      wire_bytes->GetModuleBytes();
-  if (module_bytes.has_value() &&
-      (v8_flags.trace_turbo || v8_flags.trace_turbo_scheduled ||
-       v8_flags.trace_turbo_graph || v8_flags.print_wasm_code)) {
-    wasm::WireBytesRef name = module->lazily_generated_names.LookupFunctionName(
-        module_bytes.value(), index);
-    if (!name.is_empty()) {
-      int name_len = name.length();
-      char* index_name = zone->NewArray<char>(name_len);
-      memcpy(index_name, module_bytes->start() + name.offset(), name_len);
-      return base::Vector<const char>(index_name, name_len);
-    }
-  }
-
-  constexpr int kBufferLength = 24;
-
-  base::EmbeddedVector<char, kBufferLength> name_vector;
-  int name_len = SNPrintF(name_vector, "wasm-function#%d", index);
-  DCHECK(name_len > 0 && name_len < name_vector.length());
-
-  char* index_name = zone->NewArray<char>(name_len);
-  memcpy(index_name, name_vector.begin(), name_len);
-  return base::Vector<const char>(index_name, name_len);
-}
-
 }  // namespace
 
 wasm::WasmCompilationResult ExecuteTurbofanWasmCompilation(
@@ -8606,21 +8932,12 @@ wasm::WasmCompilationResult ExecuteTurbofanWasmCompilation(
                "wasm.CompileTopTier", "func_index", data.func_index,
                "body_size", data.body_size());
   Zone zone(wasm::GetWasmEngine()->allocator(), ZONE_NAME, kCompressGraphZone);
-  MachineGraph* mcgraph = zone.New<MachineGraph>(
-      zone.New<Graph>(&zone), zone.New<CommonOperatorBuilder>(&zone),
-      zone.New<MachineOperatorBuilder>(
-          &zone, MachineType::PointerRepresentation(),
-          InstructionSelector::SupportedMachineOperatorFlags(),
-          InstructionSelector::AlignmentRequirements()));
+  MachineGraph* mcgraph = CreateCommonMachineGraph(&zone);
 
   OptimizedCompilationInfo info(
       GetDebugName(&zone, env->module, data.wire_bytes_storage,
                    data.func_index),
       &zone, CodeKind::WASM_FUNCTION);
-  if (env->runtime_exception_support) {
-    info.set_wasm_runtime_exception_support();
-  }
-
   if (env->enabled_features.has_gc()) info.set_allocation_folding();
 
   if (info.trace_turbo_json()) {
@@ -8640,8 +8957,7 @@ wasm::WasmCompilationResult ExecuteTurbofanWasmCompilation(
   data.loop_infos = &loop_infos;
   data.assumptions = new wasm::AssumptionsJournal();
 
-  wasm::WasmFeatures unused_detected_features;
-  if (!detected) detected = &unused_detected_features;
+  DCHECK_NOT_NULL(detected);
   BuildGraphForWasmFunction(env, data, detected, mcgraph);
 
   if (data.node_origins) {
@@ -8660,17 +8976,15 @@ wasm::WasmCompilationResult ExecuteTurbofanWasmCompilation(
   }
 
   Pipeline::GenerateCodeForWasmFunction(&info, env, data, mcgraph,
-                                        call_descriptor, &inlining_positions);
-
-  if (counters) {
-    int zone_bytes =
-        static_cast<int>(mcgraph->graph()->zone()->allocation_size());
-    counters->wasm_compile_function_peak_memory_bytes()->AddSample(zone_bytes);
-    if (data.body_size() >= 100 * KB) {
-      counters->wasm_compile_huge_function_peak_memory_bytes()->AddSample(
-          zone_bytes);
-    }
+                                        call_descriptor, &inlining_positions,
+                                        detected);
+
+  if (counters && data.body_size() >= 100 * KB) {
+    size_t zone_bytes = mcgraph->graph()->zone()->allocation_size();
+    counters->wasm_compile_huge_function_peak_memory_bytes()->AddSample(
+        static_cast<int>(zone_bytes));
   }
+
   // If we tiered up only one function for debugging, dump statistics
   // immediately.
   if (V8_UNLIKELY(v8_flags.turbo_stats_wasm &&
@@ -8684,171 +8998,6 @@ wasm::WasmCompilationResult ExecuteTurbofanWasmCompilation(
   return std::move(*result);
 }
 
-namespace {
-// Helper for allocating either an GP or FP reg, or the next stack slot.
-class LinkageLocationAllocator {
- public:
-  template <size_t kNumGpRegs, size_t kNumFpRegs>
-  constexpr LinkageLocationAllocator(const Register (&gp)[kNumGpRegs],
-                                     const DoubleRegister (&fp)[kNumFpRegs],
-                                     int slot_offset)
-      : allocator_(wasm::LinkageAllocator(gp, fp)), slot_offset_(slot_offset) {}
-
-  LinkageLocation Next(MachineRepresentation rep) {
-    MachineType type = MachineType::TypeForRepresentation(rep);
-    if (IsFloatingPoint(rep)) {
-      if (allocator_.CanAllocateFP(rep)) {
-        int reg_code = allocator_.NextFpReg(rep);
-        return LinkageLocation::ForRegister(reg_code, type);
-      }
-    } else if (allocator_.CanAllocateGP()) {
-      int reg_code = allocator_.NextGpReg();
-      return LinkageLocation::ForRegister(reg_code, type);
-    }
-    // Cannot use register; use stack slot.
-    int index = -1 - (slot_offset_ + allocator_.NextStackSlot(rep));
-    return LinkageLocation::ForCallerFrameSlot(index, type);
-  }
-
-  int NumStackSlots() const { return allocator_.NumStackSlots(); }
-  void EndSlotArea() { allocator_.EndSlotArea(); }
-
- private:
-  wasm::LinkageAllocator allocator_;
-  // Since params and returns are in different stack frames, we must allocate
-  // them separately. Parameter slots don't need an offset, but return slots
-  // must be offset to just before the param slots, using this |slot_offset_|.
-  int slot_offset_;
-};
-
-MachineRepresentation GetMachineRepresentation(wasm::ValueType type) {
-  return type.machine_representation();
-}
-
-MachineRepresentation GetMachineRepresentation(MachineType type) {
-  return type.representation();
-}
-
-template <typename T>
-LocationSignature* BuildLocations(Zone* zone, const Signature<T>* sig,
-                                  bool extra_callable_param,
-                                  int* parameter_slots, int* return_slots) {
-  int extra_params = extra_callable_param ? 2 : 1;
-  LocationSignature::Builder locations(zone, sig->return_count(),
-                                       sig->parameter_count() + extra_params);
-
-  // Add register and/or stack parameter(s).
-  LinkageLocationAllocator params(
-      wasm::kGpParamRegisters, wasm::kFpParamRegisters, 0 /* no slot offset */);
-
-  // The instance object.
-  locations.AddParam(params.Next(MachineRepresentation::kTaggedPointer));
-  const size_t param_offset = 1;  // Actual params start here.
-
-  // Parameters are separated into two groups (first all untagged, then all
-  // tagged parameters). This allows for easy iteration of tagged parameters
-  // during frame iteration.
-  const size_t parameter_count = sig->parameter_count();
-  bool has_tagged_param = false;
-  for (size_t i = 0; i < parameter_count; i++) {
-    MachineRepresentation param = GetMachineRepresentation(sig->GetParam(i));
-    // Skip tagged parameters (e.g. any-ref).
-    if (IsAnyTagged(param)) {
-      has_tagged_param = true;
-      continue;
-    }
-    auto l = params.Next(param);
-    locations.AddParamAt(i + param_offset, l);
-  }
-
-  // End the untagged area, so tagged slots come after.
-  params.EndSlotArea();
-
-  if (has_tagged_param) {
-    for (size_t i = 0; i < parameter_count; i++) {
-      MachineRepresentation param = GetMachineRepresentation(sig->GetParam(i));
-      // Skip untagged parameters.
-      if (!IsAnyTagged(param)) continue;
-      auto l = params.Next(param);
-      locations.AddParamAt(i + param_offset, l);
-    }
-  }
-
-  // Import call wrappers have an additional (implicit) parameter, the callable.
-  // For consistency with JS, we use the JSFunction register.
-  if (extra_callable_param) {
-    locations.AddParam(LinkageLocation::ForRegister(
-        kJSFunctionRegister.code(), MachineType::TaggedPointer()));
-  }
-
-  *parameter_slots = AddArgumentPaddingSlots(params.NumStackSlots());
-
-  // Add return location(s).
-  LinkageLocationAllocator rets(wasm::kGpReturnRegisters,
-                                wasm::kFpReturnRegisters, *parameter_slots);
-
-  const size_t return_count = locations.return_count_;
-  for (size_t i = 0; i < return_count; i++) {
-    MachineRepresentation ret = GetMachineRepresentation(sig->GetReturn(i));
-    locations.AddReturn(rets.Next(ret));
-  }
-
-  *return_slots = rets.NumStackSlots();
-
-  return locations.Get();
-}
-}  // namespace
-
-// General code uses the above configuration data.
-CallDescriptor* GetWasmCallDescriptor(Zone* zone, const wasm::FunctionSig* fsig,
-                                      WasmCallKind call_kind,
-                                      bool need_frame_state) {
-  // The extra here is to accomodate the instance object as first parameter
-  // and, when specified, the additional callable.
-  bool extra_callable_param =
-      call_kind == kWasmImportWrapper || call_kind == kWasmCapiFunction;
-
-  int parameter_slots;
-  int return_slots;
-  LocationSignature* location_sig = BuildLocations(
-      zone, fsig, extra_callable_param, &parameter_slots, &return_slots);
-
-  const RegList kCalleeSaveRegisters;
-  const DoubleRegList kCalleeSaveFPRegisters;
-
-  // The target for wasm calls is always a code object.
-  MachineType target_type = MachineType::Pointer();
-  LinkageLocation target_loc = LinkageLocation::ForAnyRegister(target_type);
-
-  CallDescriptor::Kind descriptor_kind;
-  if (call_kind == kWasmFunction) {
-    descriptor_kind = CallDescriptor::kCallWasmFunction;
-  } else if (call_kind == kWasmImportWrapper) {
-    descriptor_kind = CallDescriptor::kCallWasmImportWrapper;
-  } else {
-    DCHECK_EQ(call_kind, kWasmCapiFunction);
-    descriptor_kind = CallDescriptor::kCallWasmCapiFunction;
-  }
-
-  CallDescriptor::Flags flags = need_frame_state
-                                    ? CallDescriptor::kNeedsFrameState
-                                    : CallDescriptor::kNoFlags;
-  return zone->New<CallDescriptor>(       // --
-      descriptor_kind,                    // kind
-      target_type,                        // target MachineType
-      target_loc,                         // target location
-      location_sig,                       // location_sig
-      parameter_slots,                    // parameter slot count
-      compiler::Operator::kNoProperties,  // properties
-      kCalleeSaveRegisters,               // callee-saved registers
-      kCalleeSaveFPRegisters,             // callee-saved fp regs
-      flags,                              // flags
-      "wasm-call",                        // debug name
-      StackArgumentOrder::kDefault,       // order of the arguments in the stack
-      RegList{},                          // allocatable registers
-      return_slots);                      // return slot count
-}
-
 namespace {
 
 CallDescriptor* ReplaceTypeInCallDescriptorWith(
diff --git a/deps/v8/src/compiler/wasm-compiler.h b/deps/v8/src/compiler/wasm-compiler.h
index 93bb637e161551..5c466766cc139e 100644
--- a/deps/v8/src/compiler/wasm-compiler.h
+++ b/deps/v8/src/compiler/wasm-compiler.h
@@ -55,7 +55,6 @@ struct WasmTypeCheckConfig;
 }  // namespace compiler
 
 namespace wasm {
-class AssemblerBufferCache;
 struct DecodeStruct;
 class WasmCode;
 class WireBytesStorage;
@@ -121,9 +120,18 @@ V8_EXPORT_PRIVATE Handle<Code> CompileCWasmEntry(
 // and manipulated in wasm-compiler.{h,cc} instead of inside the Wasm decoder.
 // (Note that currently, the globals base is immutable, so not cached here.)
 struct WasmInstanceCacheNodes {
-  Node* mem_start;
-  Node* mem_size;
+  // Cache the memory start and size of one fixed memory per function. Which one
+  // is determined by {WasmGraphBuilder::cached_memory_index}.
+  Node* mem_start = nullptr;
+  Node* mem_size = nullptr;
+
+  // For iteration support. Defined outside the class for MSVC compatibility.
+  using FieldPtr = Node* WasmInstanceCacheNodes::*;
+  static const FieldPtr kFields[2];
 };
+inline constexpr WasmInstanceCacheNodes::FieldPtr
+    WasmInstanceCacheNodes::kFields[] = {&WasmInstanceCacheNodes::mem_start,
+                                         &WasmInstanceCacheNodes::mem_size};
 
 struct WasmLoopInfo {
   Node* header;
@@ -146,7 +154,6 @@ struct WasmCompilationData {
 
   const wasm::FunctionBody& func_body;
   const wasm::WireBytesStorage* wire_bytes_storage;
-  wasm::AssemblerBufferCache* buffer_cache;
   NodeOriginTable* node_origins{nullptr};
   std::vector<WasmLoopInfo>* loop_infos{nullptr};
   wasm::AssumptionsJournal* assumptions{nullptr};
@@ -170,20 +177,6 @@ class WasmGraphBuilder {
     kWasmApiFunctionRefMode,
     kNoSpecialParameterMode
   };
-  enum EnforceBoundsCheck : bool {  // --
-    kNeedsBoundsCheck = true,
-    kCanOmitBoundsCheck = false
-  };
-  enum BoundsCheckResult {
-    // Statically OOB.
-    kOutOfBounds,
-    // Dynamically checked (using 1-2 conditional branches).
-    kDynamicallyChecked,
-    // OOB handled via the trap handler.
-    kTrapHandler,
-    // Statically known to be in bounds.
-    kInBounds
-  };
 
   V8_EXPORT_PRIVATE WasmGraphBuilder(
       wasm::CompilationEnv* env, Zone* zone, MachineGraph* mcgraph,
@@ -202,7 +195,8 @@ class WasmGraphBuilder {
 
   V8_EXPORT_PRIVATE ~WasmGraphBuilder();
 
-  bool TryWasmInlining(int fct_index, wasm::NativeModule* native_module);
+  bool TryWasmInlining(int fct_index, wasm::NativeModule* native_module,
+                       int inlining_id);
 
   //-----------------------------------------------------------------------
   // Operations independent of {control} or {effect}.
@@ -240,11 +234,13 @@ class WasmGraphBuilder {
   Node* Unop(wasm::WasmOpcode opcode, Node* input,
              wasm::ValueType type = wasm::kWasmBottom,
              wasm::WasmCodePosition position = wasm::kNoCodePosition);
-  Node* MemoryGrow(Node* input);
+  Node* MemoryGrow(const wasm::WasmMemory* memory, Node* input);
   Node* Throw(uint32_t tag_index, const wasm::WasmTag* tag,
               const base::Vector<Node*> values,
               wasm::WasmCodePosition position);
   Node* Rethrow(Node* except_obj);
+  Node* IsExceptionTagUndefined(Node* tag);
+  Node* LoadJSTag();
   Node* ExceptionTagEqual(Node* caught_tag, Node* expected_tag);
   Node* LoadTagFromTable(uint32_t tag_index);
   Node* GetExceptionTag(Node* except_obj);
@@ -263,9 +259,11 @@ class WasmGraphBuilder {
   //-----------------------------------------------------------------------
   // Operations that read and/or write {control} and {effect}.
   //-----------------------------------------------------------------------
-  Node* BranchNoHint(Node* cond, Node** true_node, Node** false_node);
-  Node* BranchExpectFalse(Node* cond, Node** true_node, Node** false_node);
-  Node* BranchExpectTrue(Node* cond, Node** true_node, Node** false_node);
+
+  // Branch nodes return the true and false projection.
+  std::tuple<Node*, Node*> BranchNoHint(Node* cond);
+  std::tuple<Node*, Node*> BranchExpectFalse(Node* cond);
+  std::tuple<Node*, Node*> BranchExpectTrue(Node* cond);
 
   void TrapIfTrue(wasm::TrapReason reason, Node* cond,
                   wasm::WasmCodePosition position);
@@ -324,8 +322,8 @@ class WasmGraphBuilder {
                                         Node** failure_control,
                                         bool is_last_case);
 
-  void BrOnNull(Node* ref_object, wasm::ValueType type, Node** non_null_node,
-                Node** null_node);
+  // BrOnNull returns the control for the null and non-null case.
+  std::tuple<Node*, Node*> BrOnNull(Node* ref_object, wasm::ValueType type);
 
   Node* Invert(Node* node);
 
@@ -338,31 +336,35 @@ class WasmGraphBuilder {
   //-----------------------------------------------------------------------
   // Operations that concern the linear memory.
   //-----------------------------------------------------------------------
-  Node* CurrentMemoryPages();
+  Node* CurrentMemoryPages(const wasm::WasmMemory* memory);
   void TraceMemoryOperation(bool is_store, MachineRepresentation, Node* index,
                             uintptr_t offset, wasm::WasmCodePosition);
-  Node* LoadMem(wasm::ValueType type, MachineType memtype, Node* index,
-                uint64_t offset, uint32_t alignment,
-                wasm::WasmCodePosition position);
+  Node* LoadMem(const wasm::WasmMemory* memory, wasm::ValueType type,
+                MachineType memtype, Node* index, uintptr_t offset,
+                uint32_t alignment, wasm::WasmCodePosition position);
 #if defined(V8_TARGET_BIG_ENDIAN) || defined(V8_TARGET_ARCH_S390_LE_SIM)
   Node* LoadTransformBigEndian(wasm::ValueType type, MachineType memtype,
                                wasm::LoadTransformationKind transform,
-                               Node* index, uint64_t offset, uint32_t alignment,
+                               Node* index, uintptr_t offset,
+                               uint32_t alignment,
                                wasm::WasmCodePosition position);
 #endif
-  Node* LoadTransform(wasm::ValueType type, MachineType memtype,
+  Node* LoadTransform(const wasm::WasmMemory* memory, wasm::ValueType type,
+                      MachineType memtype,
                       wasm::LoadTransformationKind transform, Node* index,
-                      uint64_t offset, uint32_t alignment,
+                      uintptr_t offset, uint32_t alignment,
                       wasm::WasmCodePosition position);
-  Node* LoadLane(wasm::ValueType type, MachineType memtype, Node* value,
-                 Node* index, uint64_t offset, uint32_t alignment,
-                 uint8_t laneidx, wasm::WasmCodePosition position);
-  void StoreMem(MachineRepresentation mem_rep, Node* index, uint64_t offset,
-                uint32_t alignment, Node* val, wasm::WasmCodePosition position,
-                wasm::ValueType type);
-  void StoreLane(MachineRepresentation mem_rep, Node* index, uint64_t offset,
-                 uint32_t alignment, Node* val, uint8_t laneidx,
-                 wasm::WasmCodePosition position, wasm::ValueType type);
+  Node* LoadLane(const wasm::WasmMemory* memory, wasm::ValueType type,
+                 MachineType memtype, Node* value, Node* index,
+                 uintptr_t offset, uint32_t alignment, uint8_t laneidx,
+                 wasm::WasmCodePosition position);
+  void StoreMem(const wasm::WasmMemory* memory, MachineRepresentation mem_rep,
+                Node* index, uintptr_t offset, uint32_t alignment, Node* val,
+                wasm::WasmCodePosition position, wasm::ValueType type);
+  void StoreLane(const wasm::WasmMemory* memory, MachineRepresentation mem_rep,
+                 Node* index, uintptr_t offset, uint32_t alignment, Node* val,
+                 uint8_t laneidx, wasm::WasmCodePosition position,
+                 wasm::ValueType type);
   static void PrintDebugName(Node* node);
 
   Node* effect();
@@ -412,18 +414,20 @@ class WasmGraphBuilder {
 
   Node* Simd8x16ShuffleOp(const uint8_t shuffle[16], Node* const* inputs);
 
-  Node* AtomicOp(wasm::WasmOpcode opcode, Node* const* inputs,
-                 uint32_t alignment, uint64_t offset,
+  Node* AtomicOp(const wasm::WasmMemory* memory, wasm::WasmOpcode opcode,
+                 Node* const* inputs, uint32_t alignment, uintptr_t offset,
                  wasm::WasmCodePosition position);
   void AtomicFence();
 
-  void MemoryInit(uint32_t data_segment_index, Node* dst, Node* src, Node* size,
-                  wasm::WasmCodePosition position);
-  void MemoryCopy(Node* dst, Node* src, Node* size,
+  void MemoryInit(const wasm::WasmMemory* memory, uint32_t data_segment_index,
+                  Node* dst, Node* src, Node* size,
                   wasm::WasmCodePosition position);
+  void MemoryCopy(const wasm::WasmMemory* dst_memory,
+                  const wasm::WasmMemory* src_memory, Node* dst, Node* src,
+                  Node* size, wasm::WasmCodePosition position);
   void DataDrop(uint32_t data_segment_index, wasm::WasmCodePosition position);
-  void MemoryFill(Node* dst, Node* fill, Node* size,
-                  wasm::WasmCodePosition position);
+  void MemoryFill(const wasm::WasmMemory* memory, Node* dst, Node* fill,
+                  Node* size, wasm::WasmCodePosition position);
 
   void TableInit(uint32_t table_index, uint32_t elem_segment_index, Node* dst,
                  Node* src, Node* size, wasm::WasmCodePosition position);
@@ -462,8 +466,11 @@ class WasmGraphBuilder {
                  wasm::WasmCodePosition position);
   Node* ArrayNewFixed(const wasm::ArrayType* type, Node* rtt,
                       base::Vector<Node*> elements);
-  Node* ArrayNewSegment(const wasm::ArrayType* type, uint32_t data_segment,
-                        Node* offset, Node* length, Node* rtt,
+  Node* ArrayNewSegment(uint32_t segment_index, Node* offset, Node* length,
+                        Node* rtt, bool is_element,
+                        wasm::WasmCodePosition position);
+  void ArrayInitSegment(uint32_t segment_index, Node* array, Node* array_index,
+                        Node* segment_offset, Node* length, bool is_element,
                         wasm::WasmCodePosition position);
   Node* I31New(Node* input);
   Node* I31GetS(Node* input, CheckForNull null_check,
@@ -473,46 +480,35 @@ class WasmGraphBuilder {
   Node* RttCanon(uint32_t type_index);
 
   Node* RefTest(Node* object, Node* rtt, WasmTypeCheckConfig config);
-  Node* RefTestAbstract(Node* object, wasm::HeapType type, bool is_nullable,
-                        bool null_succeeds);
+  Node* RefTestAbstract(Node* object, WasmTypeCheckConfig config);
   Node* RefCast(Node* object, Node* rtt, WasmTypeCheckConfig config,
                 wasm::WasmCodePosition position);
-  Node* RefCastAbstract(Node* object, wasm::HeapType type,
-                        wasm::WasmCodePosition position, bool is_nullable,
-                        bool null_succeeds);
-  void BrOnCast(Node* object, Node* rtt, WasmTypeCheckConfig config,
-                Node** match_control, Node** match_effect,
-                Node** no_match_control, Node** no_match_effect);
-  Node* RefIsEq(Node* object, bool object_can_be_null, bool null_succeeds);
-  Node* RefAsEq(Node* object, bool object_can_be_null,
-                wasm::WasmCodePosition position, bool null_succeeds);
-  void BrOnEq(Node* object, Node* rtt, WasmTypeCheckConfig config,
-              Node** match_control, Node** match_effect,
-              Node** no_match_control, Node** no_match_effect);
-  Node* RefIsStruct(Node* object, bool object_can_be_null, bool null_succeeds);
-  Node* RefAsStruct(Node* object, bool object_can_be_null,
-                    wasm::WasmCodePosition position, bool null_succeeds);
-  void BrOnStruct(Node* object, Node* rtt, WasmTypeCheckConfig config,
-                  Node** match_control, Node** match_effect,
-                  Node** no_match_control, Node** no_match_effect);
-  Node* RefIsArray(Node* object, bool object_can_be_null, bool null_succeeds);
-  Node* RefAsArray(Node* object, bool object_can_be_null,
-                   wasm::WasmCodePosition position, bool null_succeeds);
-  void BrOnArray(Node* object, Node* rtt, WasmTypeCheckConfig config,
-                 Node** match_control, Node** match_effect,
-                 Node** no_match_control, Node** no_match_effect);
-  Node* RefIsI31(Node* object, bool null_succeeds);
-  Node* RefAsI31(Node* object, wasm::WasmCodePosition position,
-                 bool null_succeeds);
-  void BrOnI31(Node* object, Node* rtt, WasmTypeCheckConfig config,
-               Node** match_control, Node** match_effect,
-               Node** no_match_control, Node** no_match_effect);
+  Node* RefCastAbstract(Node* object, WasmTypeCheckConfig config,
+                        wasm::WasmCodePosition position);
+  struct ResultNodesOfBr {
+    Node* control_on_match;
+    Node* effect_on_match;
+    Node* control_on_no_match;
+    Node* effect_on_no_match;
+  };
+  ResultNodesOfBr BrOnCast(Node* object, Node* rtt, WasmTypeCheckConfig config);
+  ResultNodesOfBr BrOnEq(Node* object, Node* rtt, WasmTypeCheckConfig config);
+  ResultNodesOfBr BrOnStruct(Node* object, Node* rtt,
+                             WasmTypeCheckConfig config);
+  ResultNodesOfBr BrOnArray(Node* object, Node* rtt,
+                            WasmTypeCheckConfig config);
+  ResultNodesOfBr BrOnI31(Node* object, Node* rtt, WasmTypeCheckConfig config);
+  ResultNodesOfBr BrOnString(Node* object, Node* rtt,
+                             WasmTypeCheckConfig config);
+
   Node* StringNewWtf8(uint32_t memory, unibrow::Utf8Variant variant,
                       Node* offset, Node* size);
   Node* StringNewWtf8Array(unibrow::Utf8Variant variant, Node* array,
-                           Node* start, Node* end);
+                           CheckForNull null_check, Node* start, Node* end,
+                           wasm::WasmCodePosition position);
   Node* StringNewWtf16(uint32_t memory, Node* offset, Node* size);
-  Node* StringNewWtf16Array(Node* array, Node* start, Node* end);
+  Node* StringNewWtf16Array(Node* array, CheckForNull null_check, Node* start,
+                            Node* end, wasm::WasmCodePosition position);
   Node* StringAsWtf16(Node* string, CheckForNull null_check,
                       wasm::WasmCodePosition position);
   Node* StringConst(uint32_t index);
@@ -538,8 +534,8 @@ class WasmGraphBuilder {
   Node* StringConcat(Node* head, CheckForNull head_null_check, Node* tail,
                      CheckForNull tail_null_check,
                      wasm::WasmCodePosition position);
-  Node* StringEqual(Node* a, CheckForNull a_null_check, Node* b,
-                    CheckForNull b_null_check, wasm::WasmCodePosition position);
+  Node* StringEqual(Node* a, wasm::ValueType a_type, Node* b,
+                    wasm::ValueType b_type, wasm::WasmCodePosition position);
   Node* StringIsUSVSequence(Node* str, CheckForNull null_check,
                             wasm::WasmCodePosition position);
   Node* StringAsWtf8(Node* str, CheckForNull null_check,
@@ -556,6 +552,8 @@ class WasmGraphBuilder {
   Node* StringViewWtf16GetCodeUnit(Node* string, CheckForNull null_check,
                                    Node* offset,
                                    wasm::WasmCodePosition position);
+  Node* StringCodePointAt(Node* string, CheckForNull null_check, Node* offset,
+                          wasm::WasmCodePosition position);
   Node* StringViewWtf16Encode(uint32_t memory, Node* string,
                               CheckForNull null_check, Node* offset,
                               Node* start, Node* length,
@@ -576,6 +574,7 @@ class WasmGraphBuilder {
   Node* StringCompare(Node* lhs, CheckForNull null_check_lhs, Node* rhs,
                       CheckForNull null_check_rhs,
                       wasm::WasmCodePosition position);
+  Node* StringFromCharCode(Node* char_code);
   Node* StringFromCodePoint(Node* code_point);
   Node* StringHash(Node* string, CheckForNull null_check,
                    wasm::WasmCodePosition position);
@@ -584,13 +583,19 @@ class WasmGraphBuilder {
 
   // Support for well-known imports.
   // See {CheckWellKnownImport} for signature and builtin ID definitions.
+  Node* WellKnown_StringIndexOf(Node* string, Node* search, Node* start,
+                                CheckForNull string_null_check,
+                                CheckForNull search_null_check);
+  Node* WellKnown_StringToLocaleLowerCaseStringref(
+      int func_index, Node* string, Node* locale,
+      CheckForNull string_null_check);
   Node* WellKnown_StringToLowerCaseStringref(Node* string,
                                              CheckForNull null_check);
-  bool has_simd() const { return has_simd_; }
+  Node* WellKnown_ParseFloat(Node* string, CheckForNull null_check);
+  Node* WellKnown_DoubleToString(Node* n);
+  Node* WellKnown_IntToString(Node* n, Node* radix);
 
-  wasm::BoundsCheckStrategy bounds_checks() const {
-    return env_->bounds_checks;
-  }
+  bool has_simd() const { return has_simd_; }
 
   Node* DefaultValue(wasm::ValueType type);
 
@@ -611,6 +616,19 @@ class WasmGraphBuilder {
     inlining_id_ = inlining_id;
   }
 
+  bool has_cached_memory() const {
+    return cached_memory_index_ != kNoCachedMemoryIndex;
+  }
+  int cached_memory_index() const {
+    DCHECK(has_cached_memory());
+    return cached_memory_index_;
+  }
+  void set_cached_memory_index(int cached_memory_index) {
+    DCHECK_LE(0, cached_memory_index);
+    DCHECK(!has_cached_memory());
+    cached_memory_index_ = cached_memory_index;
+  }
+
  protected:
   Node* NoContextConstant();
 
@@ -618,22 +636,28 @@ class WasmGraphBuilder {
   Node* BuildLoadIsolateRoot();
   Node* UndefinedValue();
 
+  // Get a memory start or size, using the cached SSA value if available.
+  Node* MemStart(uint32_t mem_index);
+  Node* MemSize(uint32_t mem_index);
+
+  // Load a memory start or size (without using the cache).
+  Node* LoadMemStart(uint32_t mem_index);
+  Node* LoadMemSize(uint32_t mem_index);
+
   // MemBuffer is only called with valid offsets (after bounds checking), so the
   // offset fits in a platform-dependent uintptr_t.
-  Node* MemBuffer(uintptr_t offset);
+  Node* MemBuffer(uint32_t mem_index, uintptr_t offset);
 
   // BoundsCheckMem receives a 32/64-bit index (depending on
-  // WasmModule::is_memory64) and returns a ptrsize index and information about
+  // {memory->is_memory64}) and returns a ptrsize index and information about
   // the kind of bounds check performed (or why none was needed).
-  std::pair<Node*, BoundsCheckResult> BoundsCheckMem(uint8_t access_size,
-                                                     Node* index,
-                                                     uint64_t offset,
-                                                     wasm::WasmCodePosition,
-                                                     EnforceBoundsCheck);
+  std::pair<Node*, BoundsCheckResult> BoundsCheckMem(
+      const wasm::WasmMemory* memory, uint8_t access_size, Node* index,
+      uintptr_t offset, wasm::WasmCodePosition, EnforceBoundsCheck);
 
   std::pair<Node*, BoundsCheckResult> CheckBoundsAndAlignment(
-      int8_t access_size, Node* index, uint64_t offset, wasm::WasmCodePosition,
-      EnforceBoundsCheck);
+      const wasm::WasmMemory* memory, int8_t access_size, Node* index,
+      uintptr_t offset, wasm::WasmCodePosition, EnforceBoundsCheck);
 
   const Operator* GetSafeLoadOperator(int offset, wasm::ValueType type);
   const Operator* GetSafeStoreOperator(int offset, wasm::ValueType type);
@@ -735,7 +759,8 @@ class WasmGraphBuilder {
                        MachineType result_type, wasm::TrapReason trap_zero,
                        wasm::WasmCodePosition position);
 
-  void MemTypeToUintPtrOrOOBTrap(std::initializer_list<Node**> nodes,
+  void MemTypeToUintPtrOrOOBTrap(bool is_memory64,
+                                 std::initializer_list<Node**> nodes,
                                  wasm::WasmCodePosition position);
 
   void GetGlobalBaseAndOffset(const wasm::WasmGlobal&, Node** base_node,
@@ -767,10 +792,11 @@ class WasmGraphBuilder {
   void ManagedObjectInstanceCheck(Node* object, bool object_can_be_null,
                                   InstanceType instance_type,
                                   Callbacks callbacks, bool null_succeeds);
+  void StringCheck(Node* object, bool object_can_be_null, Callbacks callbacks,
+                   bool null_succeeds);
 
-  void BrOnCastAbs(Node** match_control, Node** match_effect,
-                   Node** no_match_control, Node** no_match_effect,
-                   std::function<void(Callbacks)> type_checker);
+  // BrOnCastAbs returns four node:
+  ResultNodesOfBr BrOnCastAbs(std::function<void(Callbacks)> type_checker);
   void BoundsCheckArray(Node* array, Node* index, CheckForNull null_check,
                         wasm::WasmCodePosition position);
   void BoundsCheckArrayWithLength(Node* array, Node* index, Node* length,
@@ -810,6 +836,8 @@ class WasmGraphBuilder {
   Node* BuildMultiReturnFixedArrayFromIterable(const wasm::FunctionSig* sig,
                                                Node* iterable, Node* context);
 
+  Node* BuildLoadCodePointerFromObject(Node* object, int field_offset);
+
   Node* BuildLoadCallTargetFromExportedFunctionData(Node* function_data);
 
   //-----------------------------------------------------------------------
@@ -861,20 +889,16 @@ class WasmGraphBuilder {
   Isolate* const isolate_;
   SetOncePointer<Node> instance_node_;
   NullCheckStrategy null_check_strategy_;
+  static constexpr int kNoCachedMemoryIndex = -1;
+  int cached_memory_index_ = kNoCachedMemoryIndex;
 };
 
-enum WasmCallKind { kWasmFunction, kWasmImportWrapper, kWasmCapiFunction };
-
 V8_EXPORT_PRIVATE void BuildInlinedJSToWasmWrapper(
     Zone* zone, MachineGraph* mcgraph, const wasm::FunctionSig* signature,
     const wasm::WasmModule* module, Isolate* isolate,
     compiler::SourcePositionTable* spt, wasm::WasmFeatures features,
     Node* frame_state, bool set_in_wasm_flag);
 
-V8_EXPORT_PRIVATE CallDescriptor* GetWasmCallDescriptor(
-    Zone* zone, const wasm::FunctionSig* signature,
-    WasmCallKind kind = kWasmFunction, bool need_frame_state = false);
-
 V8_EXPORT_PRIVATE CallDescriptor* GetI32WasmCallDescriptor(
     Zone* zone, const CallDescriptor* call_descriptor);
 
diff --git a/deps/v8/src/compiler/wasm-escape-analysis.cc b/deps/v8/src/compiler/wasm-escape-analysis.cc
index 2a24bfb8d31d2d..2fd780e6070ad7 100644
--- a/deps/v8/src/compiler/wasm-escape-analysis.cc
+++ b/deps/v8/src/compiler/wasm-escape-analysis.cc
@@ -22,38 +22,52 @@ Reduction WasmEscapeAnalysis::Reduce(Node* node) {
 
 Reduction WasmEscapeAnalysis::ReduceAllocateRaw(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kAllocateRaw);
-  // TODO(manoskouk): Account for phis.
+  // TODO(manoskouk): Account for phis that still have uses.
 
   // Collect all value edges of {node} in this vector.
   std::vector<Edge> value_edges;
   for (Edge edge : node->use_edges()) {
     if (NodeProperties::IsValueEdge(edge)) {
-      if (edge.index() != 0 ||
-          (edge.from()->opcode() != IrOpcode::kStoreToObject &&
-           edge.from()->opcode() != IrOpcode::kInitializeImmutableInObject)) {
+      if ((edge.from()->opcode() == IrOpcode::kPhi &&
+           edge.from()->use_edges().empty()) ||
+          (edge.index() == 0 &&
+           (edge.from()->opcode() == IrOpcode::kStoreToObject ||
+            edge.from()->opcode() == IrOpcode::kInitializeImmutableInObject))) {
+        // StoreToObject, InitializeImmutableInObject and phis without uses can
+        // be replaced and do not require the allocation.
+        value_edges.push_back(edge);
+      } else {
+        // Allocation not reducible.
         return NoChange();
       }
-      value_edges.push_back(edge);
     }
   }
 
   // Remove all discovered stores from the effect chain.
   for (Edge edge : value_edges) {
     DCHECK(NodeProperties::IsValueEdge(edge));
-    DCHECK_EQ(edge.index(), 0);
     Node* use = edge.from();
-    DCHECK(!use->IsDead());
-    DCHECK(use->opcode() == IrOpcode::kStoreToObject ||
-           use->opcode() == IrOpcode::kInitializeImmutableInObject);
-    // The value stored by this StoreToObject node might be another allocation
-    // which has no more uses. Therefore we have to revisit it. Note that this
-    // will not happen automatically: ReplaceWithValue does not trigger revisits
-    // of former inputs of the replaced node.
-    Node* stored_value = NodeProperties::GetValueInput(use, 2);
-    Revisit(stored_value);
-    ReplaceWithValue(use, mcgraph_->Dead(), NodeProperties::GetEffectInput(use),
-                     mcgraph_->Dead());
-    use->Kill();
+
+    if (use->opcode() == IrOpcode::kPhi) {
+      DCHECK(use->use_edges().empty());
+      // Useless phi. Kill it.
+      use->Kill();
+
+    } else {
+      DCHECK_EQ(edge.index(), 0);
+      DCHECK(!use->IsDead());
+      DCHECK(use->opcode() == IrOpcode::kStoreToObject ||
+             use->opcode() == IrOpcode::kInitializeImmutableInObject);
+      // The value stored by this StoreToObject node might be another allocation
+      // which has no more uses. Therefore we have to revisit it. Note that this
+      // will not happen automatically: ReplaceWithValue does not trigger
+      // revisits of former inputs of the replaced node.
+      Node* stored_value = NodeProperties::GetValueInput(use, 2);
+      Revisit(stored_value);
+      ReplaceWithValue(use, mcgraph_->Dead(),
+                       NodeProperties::GetEffectInput(use), mcgraph_->Dead());
+      use->Kill();
+    }
   }
 
   // Remove the allocation from the effect and control chains.
diff --git a/deps/v8/src/compiler/wasm-gc-lowering.cc b/deps/v8/src/compiler/wasm-gc-lowering.cc
index 83b0d66faa4426..de836d93869e0c 100644
--- a/deps/v8/src/compiler/wasm-gc-lowering.cc
+++ b/deps/v8/src/compiler/wasm-gc-lowering.cc
@@ -13,6 +13,7 @@
 #include "src/compiler/operator.h"
 #include "src/compiler/wasm-graph-assembler.h"
 #include "src/objects/heap-number.h"
+#include "src/objects/string.h"
 #include "src/wasm/object-access.h"
 #include "src/wasm/wasm-engine.h"
 #include "src/wasm/wasm-linkage.h"
@@ -30,8 +31,8 @@ WasmGCLowering::WasmGCLowering(Editor* editor, MachineGraph* mcgraph,
     : AdvancedReducer(editor),
       null_check_strategy_(trap_handler::IsTrapHandlerEnabled() &&
                                    V8_STATIC_ROOTS_BOOL && !disable_trap_handler
-                               ? kTrapHandler
-                               : kExplicitNullChecks),
+                               ? NullCheckStrategy::kTrapHandler
+                               : NullCheckStrategy::kExplicit),
       gasm_(mcgraph, mcgraph->zone()),
       module_(module),
       dead_(mcgraph->Dead()),
@@ -42,8 +43,12 @@ Reduction WasmGCLowering::Reduce(Node* node) {
   switch (node->opcode()) {
     case IrOpcode::kWasmTypeCheck:
       return ReduceWasmTypeCheck(node);
+    case IrOpcode::kWasmTypeCheckAbstract:
+      return ReduceWasmTypeCheckAbstract(node);
     case IrOpcode::kWasmTypeCast:
       return ReduceWasmTypeCast(node);
+    case IrOpcode::kWasmTypeCastAbstract:
+      return ReduceWasmTypeCastAbstract(node);
     case IrOpcode::kAssertNotNull:
       return ReduceAssertNotNull(node);
     case IrOpcode::kNull:
@@ -120,9 +125,9 @@ Reduction WasmGCLowering::ReduceWasmTypeCheck(Node* node) {
   auto end_label = gasm_.MakeLabel(MachineRepresentation::kWord32);
   bool is_cast_from_any = config.from.is_reference_to(wasm::HeapType::kAny);
 
-  // Skip the null check if casting from any and if null results in check
-  // failure. In that case the instance type check will identify null as not
-  // being a wasm object and return 0 (failure).
+  // If we are casting from any and null results in check failure, then the
+  // {IsDataRefMap} check below subsumes the null check. Otherwise, perform
+  // an explicit null check now.
   if (object_can_be_null && (!is_cast_from_any || config.to.is_nullable())) {
     const int kResult = config.to.is_nullable() ? 1 : 0;
     gasm_.GotoIf(IsNull(object, wasm::kWasmAnyRef), &end_label,
@@ -181,6 +186,90 @@ Reduction WasmGCLowering::ReduceWasmTypeCheck(Node* node) {
   return Replace(end_label.PhiAt(0));  // Meaningless argument.
 }
 
+Reduction WasmGCLowering::ReduceWasmTypeCheckAbstract(Node* node) {
+  DCHECK_EQ(node->opcode(), IrOpcode::kWasmTypeCheckAbstract);
+
+  Node* object = node->InputAt(0);
+  Node* effect_input = NodeProperties::GetEffectInput(node);
+  Node* control_input = NodeProperties::GetControlInput(node);
+  WasmTypeCheckConfig config = OpParameter<WasmTypeCheckConfig>(node->op());
+  const bool object_can_be_null = config.from.is_nullable();
+  const bool null_succeeds = config.to.is_nullable();
+  const bool object_can_be_i31 =
+      wasm::IsSubtypeOf(wasm::kWasmI31Ref.AsNonNull(), config.from, module_) ||
+      config.from.heap_representation() == wasm::HeapType::kExtern;
+
+  gasm_.InitializeEffectControl(effect_input, control_input);
+
+  Node* result = nullptr;
+  auto end_label = gasm_.MakeLabel(MachineRepresentation::kWord32);
+
+  wasm::HeapType::Representation to_rep = config.to.heap_representation();
+  do {
+    // The none-types only perform a null check. They need no control flow.
+    if (to_rep == wasm::HeapType::kNone ||
+        to_rep == wasm::HeapType::kNoExtern ||
+        to_rep == wasm::HeapType::kNoFunc) {
+      result = IsNull(object, config.from);
+      break;
+    }
+    // Null checks performed by any other type check need control flow. We can
+    // skip the null check if null fails, because it's covered by the Smi check
+    // or instance type check we'll do later.
+    if (object_can_be_null && null_succeeds) {
+      const int kResult = null_succeeds ? 1 : 0;
+      gasm_.GotoIf(IsNull(object, wasm::kWasmAnyRef), &end_label,
+                   BranchHint::kFalse, gasm_.Int32Constant(kResult));
+    }
+    // i31 is special in that the Smi check is the last thing to do.
+    if (to_rep == wasm::HeapType::kI31) {
+      // If earlier optimization passes reached the limit of possible graph
+      // transformations, we could DCHECK(object_can_be_i31) here.
+      result = object_can_be_i31 ? gasm_.IsSmi(object) : gasm_.Int32Constant(0);
+      break;
+    }
+    if (to_rep == wasm::HeapType::kEq) {
+      if (object_can_be_i31) {
+        gasm_.GotoIf(gasm_.IsSmi(object), &end_label, BranchHint::kFalse,
+                     gasm_.Int32Constant(1));
+      }
+      result = gasm_.IsDataRefMap(gasm_.LoadMap(object));
+      break;
+    }
+    // array, struct, string: i31 fails.
+    if (object_can_be_i31) {
+      gasm_.GotoIf(gasm_.IsSmi(object), &end_label, BranchHint::kFalse,
+                   gasm_.Int32Constant(0));
+    }
+    if (to_rep == wasm::HeapType::kArray) {
+      result = gasm_.HasInstanceType(object, WASM_ARRAY_TYPE);
+      break;
+    }
+    if (to_rep == wasm::HeapType::kStruct) {
+      result = gasm_.HasInstanceType(object, WASM_STRUCT_TYPE);
+      break;
+    }
+    if (to_rep == wasm::HeapType::kString) {
+      Node* instance_type = gasm_.LoadInstanceType(gasm_.LoadMap(object));
+      result = gasm_.Uint32LessThan(instance_type,
+                                    gasm_.Uint32Constant(FIRST_NONSTRING_TYPE));
+      break;
+    }
+    UNREACHABLE();
+  } while (false);
+
+  DCHECK_NOT_NULL(result);
+  if (end_label.IsUsed()) {
+    gasm_.Goto(&end_label, result);
+    gasm_.Bind(&end_label);
+    result = end_label.PhiAt(0);
+  }
+
+  ReplaceWithValue(node, result, gasm_.effect(), gasm_.control());
+  node->Kill();
+  return Replace(result);  // Meaningless argument.
+}
+
 Reduction WasmGCLowering::ReduceWasmTypeCast(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kWasmTypeCast);
 
@@ -199,9 +288,9 @@ Reduction WasmGCLowering::ReduceWasmTypeCast(Node* node) {
   auto end_label = gasm_.MakeLabel();
   bool is_cast_from_any = config.from.is_reference_to(wasm::HeapType::kAny);
 
-  // Skip the null check if casting from any and if null results in check
-  // failure. In that case the instance type check will identify null as not
-  // being a wasm object and trap.
+  // If we are casting from any and null results in check failure, then the
+  // {IsDataRefMap} check below subsumes the null check. Otherwise, perform
+  // an explicit null check now.
   if (object_can_be_null && (!is_cast_from_any || config.to.is_nullable())) {
     Node* is_null = IsNull(object, wasm::kWasmAnyRef);
     if (config.to.is_nullable()) {
@@ -270,6 +359,98 @@ Reduction WasmGCLowering::ReduceWasmTypeCast(Node* node) {
   return Replace(object);
 }
 
+Reduction WasmGCLowering::ReduceWasmTypeCastAbstract(Node* node) {
+  DCHECK_EQ(node->opcode(), IrOpcode::kWasmTypeCastAbstract);
+
+  Node* object = node->InputAt(0);
+  Node* effect_input = NodeProperties::GetEffectInput(node);
+  Node* control_input = NodeProperties::GetControlInput(node);
+  WasmTypeCheckConfig config = OpParameter<WasmTypeCheckConfig>(node->op());
+  const bool object_can_be_null = config.from.is_nullable();
+  const bool null_succeeds = config.to.is_nullable();
+  const bool object_can_be_i31 =
+      wasm::IsSubtypeOf(wasm::kWasmI31Ref.AsNonNull(), config.from, module_) ||
+      config.from.heap_representation() == wasm::HeapType::kExtern;
+
+  gasm_.InitializeEffectControl(effect_input, control_input);
+
+  auto end_label = gasm_.MakeLabel();
+
+  wasm::HeapType::Representation to_rep = config.to.heap_representation();
+
+  do {
+    // The none-types only perform a null check.
+    if (to_rep == wasm::HeapType::kNone ||
+        to_rep == wasm::HeapType::kNoExtern ||
+        to_rep == wasm::HeapType::kNoFunc) {
+      gasm_.TrapUnless(IsNull(object, config.from), TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(gasm_.effect(), node);
+      break;
+    }
+    // Null checks performed by any other type cast can be skipped if null
+    // fails, because it's covered by the Smi check
+    // or instance type check we'll do later.
+    if (object_can_be_null && null_succeeds &&
+        !v8_flags.experimental_wasm_skip_null_checks) {
+      gasm_.GotoIf(IsNull(object, config.from), &end_label, BranchHint::kFalse);
+    }
+    if (to_rep == wasm::HeapType::kI31) {
+      // If earlier optimization passes reached the limit of possible graph
+      // transformations, we could DCHECK(object_can_be_i31) here.
+      Node* success =
+          object_can_be_i31 ? gasm_.IsSmi(object) : gasm_.Int32Constant(0);
+      gasm_.TrapUnless(success, TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(gasm_.effect(), node);
+      break;
+    }
+    if (to_rep == wasm::HeapType::kEq) {
+      if (object_can_be_i31) {
+        gasm_.GotoIf(gasm_.IsSmi(object), &end_label, BranchHint::kFalse);
+      }
+      gasm_.TrapUnless(gasm_.IsDataRefMap(gasm_.LoadMap(object)),
+                       TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(gasm_.effect(), node);
+      break;
+    }
+    // array, struct, string: i31 fails.
+    if (object_can_be_i31) {
+      gasm_.TrapIf(gasm_.IsSmi(object), TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(gasm_.effect(), node);
+    }
+    if (to_rep == wasm::HeapType::kArray) {
+      gasm_.TrapUnless(gasm_.HasInstanceType(object, WASM_ARRAY_TYPE),
+                       TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(gasm_.effect(), node);
+      break;
+    }
+    if (to_rep == wasm::HeapType::kStruct) {
+      gasm_.TrapUnless(gasm_.HasInstanceType(object, WASM_STRUCT_TYPE),
+                       TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(gasm_.effect(), node);
+      break;
+    }
+    if (to_rep == wasm::HeapType::kString) {
+      Node* instance_type = gasm_.LoadInstanceType(gasm_.LoadMap(object));
+      gasm_.TrapUnless(
+          gasm_.Uint32LessThan(instance_type,
+                               gasm_.Uint32Constant(FIRST_NONSTRING_TYPE)),
+          TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(gasm_.effect(), node);
+      break;
+    }
+    UNREACHABLE();
+  } while (false);
+
+  if (end_label.IsUsed()) {
+    gasm_.Goto(&end_label);
+    gasm_.Bind(&end_label);
+  }
+
+  ReplaceWithValue(node, object, gasm_.effect(), gasm_.control());
+  node->Kill();
+  return Replace(object);
+}
+
 Reduction WasmGCLowering::ReduceAssertNotNull(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kAssertNotNull);
   Node* effect = NodeProperties::GetEffectInput(node);
@@ -287,7 +468,7 @@ Reduction WasmGCLowering::ReduceAssertNotNull(Node* node) {
       // for null.
       // For subtypes of externref, we use JS null, so we have to check
       // explicitly.
-      if (null_check_strategy_ == kExplicitNullChecks ||
+      if (null_check_strategy_ == NullCheckStrategy::kExplicit ||
           wasm::IsSubtypeOf(wasm::kWasmI31Ref.AsNonNull(), op_parameter.type,
                             module_) ||
           wasm::IsSubtypeOf(op_parameter.type, wasm::kWasmExternRef, module_)) {
@@ -296,7 +477,7 @@ Reduction WasmGCLowering::ReduceAssertNotNull(Node* node) {
       } else {
         static_assert(WasmStruct::kHeaderSize > kTaggedSize);
         static_assert(WasmArray::kHeaderSize > kTaggedSize);
-        // TODO(manoskouk): JSFunction::kHeaderSize also has to be >kTaggedSize.
+        static_assert(WasmInternalFunction::kHeaderSize > kTaggedSize);
         Node* trap_null = gasm_.LoadTrapOnNull(
             MachineType::Int32(), object,
             gasm_.IntPtrConstant(wasm::ObjectAccess::ToTagged(kTaggedSize)));
@@ -484,20 +665,24 @@ Reduction WasmGCLowering::ReduceWasmStructGet(Node* node) {
 
   Node* offset = gasm_.FieldOffset(info.type, info.field_index);
 
-  if (null_check_strategy_ == kExplicitNullChecks &&
-      info.null_check == kWithNullCheck) {
+  bool explicit_null_check =
+      info.null_check == kWithNullCheck &&
+      (null_check_strategy_ == NullCheckStrategy::kExplicit ||
+       info.field_index > wasm::kMaxStructFieldIndexForImplicitNullCheck);
+  bool implicit_null_check =
+      info.null_check == kWithNullCheck && !explicit_null_check;
+
+  if (explicit_null_check) {
     gasm_.TrapIf(IsNull(object, wasm::kWasmAnyRef),
                  TrapId::kTrapNullDereference);
     UpdateSourcePosition(gasm_.effect(), node);
   }
 
-  bool use_null_trap =
-      null_check_strategy_ == kTrapHandler && info.null_check == kWithNullCheck;
-  Node* load = use_null_trap ? gasm_.LoadTrapOnNull(type, object, offset)
+  Node* load = implicit_null_check ? gasm_.LoadTrapOnNull(type, object, offset)
                : info.type->mutability(info.field_index)
                    ? gasm_.LoadFromObject(type, object, offset)
                    : gasm_.LoadImmutableFromObject(type, object, offset);
-  if (use_null_trap) {
+  if (implicit_null_check) {
     UpdateSourcePosition(load, node);
   }
 
@@ -516,8 +701,14 @@ Reduction WasmGCLowering::ReduceWasmStructSet(Node* node) {
   Node* object = NodeProperties::GetValueInput(node, 0);
   Node* value = NodeProperties::GetValueInput(node, 1);
 
-  if (null_check_strategy_ == kExplicitNullChecks &&
-      info.null_check == kWithNullCheck) {
+  bool explicit_null_check =
+      info.null_check == kWithNullCheck &&
+      (null_check_strategy_ == NullCheckStrategy::kExplicit ||
+       info.field_index > wasm::kMaxStructFieldIndexForImplicitNullCheck);
+  bool implicit_null_check =
+      info.null_check == kWithNullCheck && !explicit_null_check;
+
+  if (explicit_null_check) {
     gasm_.TrapIf(IsNull(object, wasm::kWasmAnyRef),
                  TrapId::kTrapNullDereference);
     UpdateSourcePosition(gasm_.effect(), node);
@@ -527,7 +718,7 @@ Reduction WasmGCLowering::ReduceWasmStructSet(Node* node) {
   Node* offset = gasm_.FieldOffset(info.type, info.field_index);
 
   Node* store =
-      null_check_strategy_ == kTrapHandler && info.null_check == kWithNullCheck
+      implicit_null_check
           ? gasm_.StoreTrapOnNull({field_type.machine_representation(),
                                    field_type.is_reference() ? kFullWriteBarrier
                                                              : kNoWriteBarrier},
@@ -537,6 +728,10 @@ Reduction WasmGCLowering::ReduceWasmStructSet(Node* node) {
                                 offset, value)
           : gasm_.InitializeImmutableInObject(
                 ObjectAccessForGCStores(field_type), object, offset, value);
+  if (implicit_null_check) {
+    UpdateSourcePosition(store, node);
+  }
+
   ReplaceWithValue(node, store, gasm_.effect(), gasm_.control());
   node->Kill();
   return Replace(store);
@@ -596,7 +791,7 @@ Reduction WasmGCLowering::ReduceWasmArrayLength(Node* node) {
 
   bool null_check = OpParameter<bool>(node->op());
 
-  if (null_check_strategy_ == kExplicitNullChecks &&
+  if (null_check_strategy_ == NullCheckStrategy::kExplicit &&
       null_check == kWithNullCheck) {
     gasm_.TrapIf(IsNull(object, wasm::kWasmAnyRef),
                  TrapId::kTrapNullDereference);
@@ -604,7 +799,8 @@ Reduction WasmGCLowering::ReduceWasmArrayLength(Node* node) {
   }
 
   bool use_null_trap =
-      null_check_strategy_ == kTrapHandler && null_check == kWithNullCheck;
+      null_check_strategy_ == NullCheckStrategy::kTrapHandler &&
+      null_check == kWithNullCheck;
   Node* length =
       use_null_trap
           ? gasm_.LoadTrapOnNull(
@@ -840,13 +1036,8 @@ void WasmGCLowering::UpdateSourcePosition(Node* new_node, Node* old_node) {
   if (source_position_table_) {
     SourcePosition position =
         source_position_table_->GetSourcePosition(old_node);
-    if (position.ScriptOffset() != kNoSourcePosition) {
-      source_position_table_->SetSourcePosition(new_node, position);
-    } else {
-      // TODO(mliedtke): Source positions are not yet supported for inlining
-      // wasm into JS. Add support for it and replace the if with a DCHECK.
-      DCHECK_EQ(kExplicitNullChecks, null_check_strategy_);
-    }
+    DCHECK(position.ScriptOffset() != kNoSourcePosition);
+    source_position_table_->SetSourcePosition(new_node, position);
   }
 }
 
diff --git a/deps/v8/src/compiler/wasm-gc-lowering.h b/deps/v8/src/compiler/wasm-gc-lowering.h
index 56d89c927df49f..90b7dfa6ad3ad9 100644
--- a/deps/v8/src/compiler/wasm-gc-lowering.h
+++ b/deps/v8/src/compiler/wasm-gc-lowering.h
@@ -33,7 +33,9 @@ class WasmGCLowering final : public AdvancedReducer {
 
  private:
   Reduction ReduceWasmTypeCheck(Node* node);
+  Reduction ReduceWasmTypeCheckAbstract(Node* node);
   Reduction ReduceWasmTypeCast(Node* node);
+  Reduction ReduceWasmTypeCastAbstract(Node* node);
   Reduction ReduceAssertNotNull(Node* node);
   Reduction ReduceNull(Node* node);
   Reduction ReduceIsNull(Node* node);
diff --git a/deps/v8/src/compiler/wasm-gc-operator-reducer.cc b/deps/v8/src/compiler/wasm-gc-operator-reducer.cc
index 40aaa43bb3fffd..fcb0f5544235a8 100644
--- a/deps/v8/src/compiler/wasm-gc-operator-reducer.cc
+++ b/deps/v8/src/compiler/wasm-gc-operator-reducer.cc
@@ -4,6 +4,7 @@
 
 #include "src/compiler/wasm-gc-operator-reducer.h"
 
+#include "src/compiler/compiler-source-position-table.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/compiler/wasm-compiler-definitions.h"
@@ -13,13 +14,14 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-WasmGCOperatorReducer::WasmGCOperatorReducer(Editor* editor, Zone* temp_zone_,
-                                             MachineGraph* mcgraph,
-                                             const wasm::WasmModule* module)
+WasmGCOperatorReducer::WasmGCOperatorReducer(
+    Editor* editor, Zone* temp_zone_, MachineGraph* mcgraph,
+    const wasm::WasmModule* module, SourcePositionTable* source_position_table)
     : AdvancedReducerWithControlPathState(editor, temp_zone_, mcgraph->graph()),
       mcgraph_(mcgraph),
       gasm_(mcgraph, mcgraph->zone()),
-      module_(module) {}
+      module_(module),
+      source_position_table_(source_position_table) {}
 
 Reduction WasmGCOperatorReducer::Reduce(Node* node) {
   switch (node->opcode()) {
@@ -37,8 +39,14 @@ Reduction WasmGCOperatorReducer::Reduce(Node* node) {
       return ReduceCheckNull(node);
     case IrOpcode::kWasmTypeCheck:
       return ReduceWasmTypeCheck(node);
+    case IrOpcode::kWasmTypeCheckAbstract:
+      return ReduceWasmTypeCheckAbstract(node);
     case IrOpcode::kWasmTypeCast:
       return ReduceWasmTypeCast(node);
+    case IrOpcode::kWasmTypeCastAbstract:
+      return ReduceWasmTypeCastAbstract(node);
+    case IrOpcode::kTypeGuard:
+      return ReduceTypeGuard(node);
     case IrOpcode::kWasmExternInternalize:
       return ReduceWasmExternInternalize(node);
     case IrOpcode::kMerge:
@@ -64,12 +72,14 @@ Reduction WasmGCOperatorReducer::Reduce(Node* node) {
 namespace {
 bool InDeadBranch(Node* node) {
   return node->opcode() == IrOpcode::kDead ||
-         NodeProperties::GetType(node).AsWasm().type.is_bottom();
+         node->opcode() == IrOpcode::kDeadValue ||
+         NodeProperties::GetType(node).AsWasm().type.is_uninhabited();
 }
 
 Node* GetAlias(Node* node) {
   switch (node->opcode()) {
     case IrOpcode::kWasmTypeCast:
+    case IrOpcode::kWasmTypeCastAbstract:
     case IrOpcode::kTypeGuard:
     case IrOpcode::kAssertNotNull:
       return NodeProperties::GetValueInput(node, 0);
@@ -78,6 +88,15 @@ Node* GetAlias(Node* node) {
   }
 }
 
+bool IsImplicitInternalization(wasm::ValueType from, wasm::ValueType to,
+                               const wasm::WasmModule* to_module) {
+  return from.is_object_reference() &&
+         from.heap_representation() == wasm::HeapType::kExtern &&
+         to.is_object_reference() &&
+         wasm::IsHeapSubtypeOf(to.heap_type(),
+                               wasm::HeapType(wasm::HeapType::kAny), to_module);
+}
+
 }  // namespace
 
 Node* WasmGCOperatorReducer::SetType(Node* node, wasm::ValueType type) {
@@ -109,11 +128,17 @@ Reduction WasmGCOperatorReducer::ReduceStart(Node* node) {
   return UpdateStates(node, ControlPathTypes(zone()));
 }
 
-wasm::TypeInModule WasmGCOperatorReducer::ObjectTypeFromContext(Node* object,
-                                                                Node* control) {
-  if (InDeadBranch(object)) return {};
+wasm::TypeInModule WasmGCOperatorReducer::ObjectTypeFromContext(
+    Node* object, Node* control, bool allow_non_wasm) {
+  if (object->opcode() == IrOpcode::kDead ||
+      object->opcode() == IrOpcode::kDeadValue) {
+    return {};
+  }
   if (!IsReduced(control)) return {};
-  wasm::TypeInModule type_from_node = NodeProperties::GetType(object).AsWasm();
+  if (allow_non_wasm && !NodeProperties::IsTyped(object)) return {};
+  Type raw_type = NodeProperties::GetType(object);
+  if (allow_non_wasm && !raw_type.IsWasm()) return {};
+  wasm::TypeInModule type_from_node = raw_type.AsWasm();
   ControlPathTypes state = GetState(control);
   NodeWithType type_from_state = state.LookupState(object);
   // We manually resolve TypeGuard aliases in the state.
@@ -121,9 +146,15 @@ wasm::TypeInModule WasmGCOperatorReducer::ObjectTypeFromContext(Node* object,
     object = NodeProperties::GetValueInput(object, 0);
     type_from_state = state.LookupState(object);
   }
-  return type_from_state.IsSet()
-             ? wasm::Intersection(type_from_node, type_from_state.type)
-             : type_from_node;
+  if (!type_from_state.IsSet()) return type_from_node;
+  // When abstract casts have performed implicit internalization (see
+  // {ReduceWasmTypeCastAbstract} below), we may encounter the results
+  // of that here.
+  if (IsImplicitInternalization(type_from_node.type, type_from_state.type.type,
+                                type_from_state.type.module)) {
+    return type_from_state.type;
+  }
+  return wasm::Intersection(type_from_node, type_from_state.type);
 }
 
 Reduction WasmGCOperatorReducer::ReduceWasmStructOperation(Node* node) {
@@ -134,7 +165,7 @@ Reduction WasmGCOperatorReducer::ReduceWasmStructOperation(Node* node) {
   Node* object = NodeProperties::GetValueInput(node, 0);
 
   wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
-  if (object_type.type.is_bottom()) return NoChange();
+  if (object_type.type.is_uninhabited()) return NoChange();
 
   if (object_type.type.is_non_nullable()) {
     // If the object is known to be non-nullable in the context, remove the null
@@ -163,7 +194,7 @@ Reduction WasmGCOperatorReducer::ReduceWasmArrayLength(Node* node) {
   Node* object = NodeProperties::GetValueInput(node, 0);
 
   wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
-  if (object_type.type.is_bottom()) return NoChange();
+  if (object_type.type.is_uninhabited()) return NoChange();
 
   if (object_type.type.is_non_nullable()) {
     // If the object is known to be non-nullable in the context, remove the null
@@ -185,16 +216,18 @@ Reduction WasmGCOperatorReducer::ReduceIf(Node* node, bool condition) {
   DCHECK(node->opcode() == IrOpcode::kIfTrue ||
          node->opcode() == IrOpcode::kIfFalse);
   Node* branch = NodeProperties::GetControlInput(node);
+  if (branch->opcode() == IrOpcode::kDead) return NoChange();
   DCHECK_EQ(branch->opcode(), IrOpcode::kBranch);
   if (!IsReduced(branch)) return NoChange();
   ControlPathTypes parent_state = GetState(branch);
   Node* condition_node = NodeProperties::GetValueInput(branch, 0);
   switch (condition_node->opcode()) {
-    case IrOpcode::kWasmTypeCheck: {
+    case IrOpcode::kWasmTypeCheck:
+    case IrOpcode::kWasmTypeCheckAbstract: {
       if (!condition) break;
       Node* object = NodeProperties::GetValueInput(condition_node, 0);
       wasm::TypeInModule object_type = ObjectTypeFromContext(object, branch);
-      if (object_type.type.is_bottom()) return NoChange();
+      if (object_type.type.is_uninhabited()) return NoChange();
 
       wasm::ValueType to_type =
           OpParameter<WasmTypeCheckConfig>(condition_node->op()).to;
@@ -211,7 +244,7 @@ Reduction WasmGCOperatorReducer::ReduceIf(Node* node, bool condition) {
       Node* object = NodeProperties::GetValueInput(condition_node, 0);
       Node* control = NodeProperties::GetControlInput(condition_node);
       wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
-      if (object_type.type.is_bottom()) return NoChange();
+      if (object_type.type.is_uninhabited()) return NoChange();
       // If the checked value is null, narrow the type to the corresponding
       // null type, otherwise to a non-null reference.
       bool is_null =
@@ -259,7 +292,7 @@ Reduction WasmGCOperatorReducer::ReduceAssertNotNull(Node* node) {
   Node* control = NodeProperties::GetControlInput(node);
 
   wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
-  if (object_type.type.is_bottom()) return NoChange();
+  if (object_type.type.is_uninhabited()) return NoChange();
 
   // Optimize the check away if the argument is known to be non-null.
   if (object_type.type.is_non_nullable()) {
@@ -283,7 +316,7 @@ Reduction WasmGCOperatorReducer::ReduceCheckNull(Node* node) {
   Node* control = NodeProperties::GetControlInput(node);
 
   wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
-  if (object_type.type.is_bottom()) return NoChange();
+  if (object_type.type.is_uninhabited()) return NoChange();
 
   // Optimize the check away if the argument is known to be non-null.
   if (object_type.type.is_non_nullable()) {
@@ -311,13 +344,17 @@ Reduction WasmGCOperatorReducer::ReduceCheckNull(Node* node) {
 Reduction WasmGCOperatorReducer::ReduceWasmExternInternalize(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kWasmExternInternalize);
   // Remove redundant extern.internalize(extern.externalize(...)) pattern.
-  // TODO(mliedtke): Currently this doesn't get fully removed, probably due to
-  // not running dead code elimination in this pipeline step. What would it cost
-  // us to run it here?
-  if (NodeProperties::GetValueInput(node, 0)->opcode() ==
-      IrOpcode::kWasmExternExternalize) {
-    Node* externalize = node->InputAt(0);
-    Node* input = externalize->InputAt(0);
+  Node* input = NodeProperties::GetValueInput(node, 0);
+  while (input->opcode() == IrOpcode::kTypeGuard) {
+    input = NodeProperties::GetValueInput(input, 0);
+  }
+  if (input->opcode() == IrOpcode::kDead ||
+      input->opcode() == IrOpcode::kDeadValue) {
+    return NoChange();
+  }
+  if (input->opcode() == IrOpcode::kWasmExternExternalize) {
+    // "Skip" the extern.externalize which doesn't have an effect on the value.
+    input = NodeProperties::GetValueInput(input, 0);
     ReplaceWithValue(node, input);
     node->Kill();
     return Replace(input);
@@ -325,6 +362,24 @@ Reduction WasmGCOperatorReducer::ReduceWasmExternInternalize(Node* node) {
   return TakeStatesFromFirstControl(node);
 }
 
+Reduction WasmGCOperatorReducer::ReduceTypeGuard(Node* node) {
+  DCHECK_EQ(node->opcode(), IrOpcode::kTypeGuard);
+  Node* control = NodeProperties::GetControlInput(node);
+  Node* object = NodeProperties::GetValueInput(node, 0);
+
+  // Since TypeGuards can be generated for JavaScript, and this phase is run
+  // for wasm-into-JS inlining, we cannot assume the object has a wasm type.
+  wasm::TypeInModule object_type =
+      ObjectTypeFromContext(object, control, /* allow_non_wasm = */ true);
+  if (object_type.type.is_uninhabited()) return NoChange();
+  wasm::TypeInModule guarded_type = TypeGuardTypeOf(node->op()).AsWasm();
+
+  wasm::TypeInModule new_type = wasm::Intersection(object_type, guarded_type);
+
+  return UpdateNodeAndAliasesTypes(node, GetState(control), node, new_type,
+                                   false);
+}
+
 Reduction WasmGCOperatorReducer::ReduceWasmTypeCast(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kWasmTypeCast);
   Node* effect = NodeProperties::GetEffectInput(node);
@@ -333,7 +388,7 @@ Reduction WasmGCOperatorReducer::ReduceWasmTypeCast(Node* node) {
   Node* rtt = NodeProperties::GetValueInput(node, 1);
 
   wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
-  if (object_type.type.is_bottom()) return NoChange();
+  if (object_type.type.is_uninhabited()) return NoChange();
   if (InDeadBranch(rtt)) return NoChange();
   wasm::TypeInModule rtt_type = NodeProperties::GetType(rtt).AsWasm();
   bool to_nullable =
@@ -354,9 +409,10 @@ Reduction WasmGCOperatorReducer::ReduceWasmTypeCast(Node* node) {
       return Changed(node);
     } else {
       gasm_.InitializeEffectControl(effect, control);
-      return Replace(SetType(gasm_.AssertNotNull(object, object_type.type,
-                                                 TrapId::kTrapIllegalCast),
-                             object_type.type.AsNonNull()));
+      Node* assert_not_null = gasm_.AssertNotNull(object, object_type.type,
+                                                  TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(assert_not_null, node);
+      return Replace(SetType(assert_not_null, object_type.type.AsNonNull()));
     }
   }
 
@@ -371,6 +427,7 @@ Reduction WasmGCOperatorReducer::ReduceWasmTypeCast(Node* node) {
                                        : gasm_.Int32Constant(0);
     gasm_.TrapUnless(SetType(non_trapping_condition, wasm::kWasmI32),
                      TrapId::kTrapIllegalCast);
+    UpdateSourcePosition(gasm_.effect(), node);
     Node* null_node = SetType(gasm_.Null(object_type.type),
                               wasm::ToNullSentinel(object_type));
     ReplaceWithValue(node, null_node, gasm_.effect(), gasm_.control());
@@ -394,6 +451,73 @@ Reduction WasmGCOperatorReducer::ReduceWasmTypeCast(Node* node) {
                                    false);
 }
 
+Reduction WasmGCOperatorReducer::ReduceWasmTypeCastAbstract(Node* node) {
+  DCHECK_EQ(node->opcode(), IrOpcode::kWasmTypeCastAbstract);
+  Node* effect = NodeProperties::GetEffectInput(node);
+  Node* control = NodeProperties::GetControlInput(node);
+  Node* object = NodeProperties::GetValueInput(node, 0);
+  WasmTypeCheckConfig config = OpParameter<WasmTypeCheckConfig>(node->op());
+
+  wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
+  if (object_type.type.is_uninhabited()) return NoChange();
+  const bool to_nullable = config.to.is_nullable();
+
+  if (wasm::IsHeapSubtypeOf(object_type.type.heap_type(), config.to.heap_type(),
+                            object_type.module)) {
+    if (to_nullable || object_type.type.is_non_nullable()) {
+      // Type cast will always succeed. Turn it into a TypeGuard to not lose any
+      // type information.
+      // First, relax control.
+      ReplaceWithValue(node, node, node, control);
+      NodeProperties::ChangeOp(
+          node, common()->TypeGuard(NodeProperties::GetType(node)));
+      return Changed(node);
+    } else {
+      gasm_.InitializeEffectControl(effect, control);
+      Node* assert_not_null = gasm_.AssertNotNull(object, object_type.type,
+                                                  TrapId::kTrapIllegalCast);
+      UpdateSourcePosition(assert_not_null, node);
+      return Replace(SetType(assert_not_null, object_type.type.AsNonNull()));
+    }
+  }
+
+  // This can never result from user code, only from internal shortcuts,
+  // e.g. when using externrefs as strings.
+  const bool implicit_internalize =
+      IsImplicitInternalization(config.from, config.to, object_type.module);
+  if (!implicit_internalize &&
+      wasm::HeapTypesUnrelated(object_type.type.heap_type(),
+                               config.to.heap_type(), object_type.module,
+                               object_type.module)) {
+    gasm_.InitializeEffectControl(effect, control);
+    // A cast between unrelated types can only succeed if the argument is null.
+    // Otherwise, it always fails.
+    Node* non_trapping_condition = object_type.type.is_nullable() && to_nullable
+                                       ? gasm_.IsNull(object, object_type.type)
+                                       : gasm_.Int32Constant(0);
+    gasm_.TrapUnless(SetType(non_trapping_condition, wasm::kWasmI32),
+                     TrapId::kTrapIllegalCast);
+    UpdateSourcePosition(gasm_.effect(), node);
+    Node* null_node = SetType(gasm_.Null(object_type.type),
+                              wasm::ToNullSentinel(object_type));
+    ReplaceWithValue(node, null_node, gasm_.effect(), gasm_.control());
+    node->Kill();
+    return Replace(null_node);
+  }
+
+  // Update the from-type in the type cast.
+  NodeProperties::ChangeOp(node, gasm_.simplified()->WasmTypeCastAbstract(
+                                     {object_type.type, config.to}));
+
+  wasm::TypeInModule new_type =
+      implicit_internalize
+          ? wasm::TypeInModule{config.to, module_}
+          : wasm::Intersection(object_type, {config.to, module_});
+
+  return UpdateNodeAndAliasesTypes(node, GetState(control), node, new_type,
+                                   false);
+}
+
 Reduction WasmGCOperatorReducer::ReduceWasmTypeCheck(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kWasmTypeCheck);
   Node* object = NodeProperties::GetValueInput(node, 0);
@@ -402,7 +526,7 @@ Reduction WasmGCOperatorReducer::ReduceWasmTypeCheck(Node* node) {
   Node* control = NodeProperties::GetControlInput(node);
 
   wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
-  if (object_type.type.is_bottom()) return NoChange();
+  if (object_type.type.is_uninhabited()) return NoChange();
   if (InDeadBranch(rtt)) return NoChange();
   wasm::TypeInModule rtt_type = NodeProperties::GetType(rtt).AsWasm();
 
@@ -453,6 +577,73 @@ Reduction WasmGCOperatorReducer::ReduceWasmTypeCheck(Node* node) {
   return TakeStatesFromFirstControl(node);
 }
 
+Reduction WasmGCOperatorReducer::ReduceWasmTypeCheckAbstract(Node* node) {
+  DCHECK_EQ(node->opcode(), IrOpcode::kWasmTypeCheckAbstract);
+  Node* object = NodeProperties::GetValueInput(node, 0);
+  Node* effect = NodeProperties::GetEffectInput(node);
+  Node* control = NodeProperties::GetControlInput(node);
+  WasmTypeCheckConfig config = OpParameter<WasmTypeCheckConfig>(node->op());
+
+  wasm::TypeInModule object_type = ObjectTypeFromContext(object, control);
+  if (object_type.type.is_uninhabited()) return NoChange();
+  const bool null_succeeds = config.to.is_nullable();
+
+  if (wasm::IsHeapSubtypeOf(object_type.type.heap_type(), config.to.heap_type(),
+                            object_type.module)) {
+    // Type cast will fail only on null.
+    gasm_.InitializeEffectControl(effect, control);
+    Node* condition = SetType(object_type.type.is_nullable() && !null_succeeds
+                                  ? gasm_.IsNotNull(object, object_type.type)
+                                  : gasm_.Int32Constant(1),
+                              wasm::kWasmI32);
+    ReplaceWithValue(node, condition);
+    node->Kill();
+    return Replace(condition);
+  }
+
+  // This can never result from user code, only from internal shortcuts,
+  // e.g. when using externrefs as strings.
+  const bool implicit_internalize =
+      config.from.heap_representation() == wasm::HeapType::kExtern &&
+      wasm::IsHeapSubtypeOf(config.to.heap_type(),
+                            wasm::HeapType(wasm::HeapType::kAny),
+                            object_type.module);
+  if (!implicit_internalize &&
+      wasm::HeapTypesUnrelated(object_type.type.heap_type(),
+                               config.to.heap_type(), object_type.module,
+                               object_type.module)) {
+    Node* condition = nullptr;
+    if (null_succeeds && object_type.type.is_nullable()) {
+      // The cast only succeeds in case of null.
+      gasm_.InitializeEffectControl(effect, control);
+      condition =
+          SetType(gasm_.IsNull(object, object_type.type), wasm::kWasmI32);
+    } else {
+      // The cast never succeeds.
+      condition = SetType(gasm_.Int32Constant(0), wasm::kWasmI32);
+    }
+    ReplaceWithValue(node, condition);
+    node->Kill();
+    return Replace(condition);
+  }
+
+  // Update the from-type in the type cast.
+  NodeProperties::ChangeOp(node, gasm_.simplified()->WasmTypeCheckAbstract(
+                                     {object_type.type, config.to}));
+
+  return TakeStatesFromFirstControl(node);
+}
+
+void WasmGCOperatorReducer::UpdateSourcePosition(Node* new_node,
+                                                 Node* old_node) {
+  if (source_position_table_) {
+    SourcePosition position =
+        source_position_table_->GetSourcePosition(old_node);
+    DCHECK(position.ScriptOffset() != kNoSourcePosition);
+    source_position_table_->SetSourcePosition(new_node, position);
+  }
+}
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/compiler/wasm-gc-operator-reducer.h b/deps/v8/src/compiler/wasm-gc-operator-reducer.h
index f2e6706a2ab1d4..8e8ff5f31df925 100644
--- a/deps/v8/src/compiler/wasm-gc-operator-reducer.h
+++ b/deps/v8/src/compiler/wasm-gc-operator-reducer.h
@@ -19,6 +19,7 @@ namespace internal {
 namespace compiler {
 
 class MachineGraph;
+class SourcePositionTable;
 
 struct NodeWithType {
   NodeWithType() : node(nullptr), type(wasm::kWasmVoid, nullptr) {}
@@ -45,7 +46,8 @@ class WasmGCOperatorReducer final
                                                  kMultipleInstances> {
  public:
   WasmGCOperatorReducer(Editor* editor, Zone* temp_zone_, MachineGraph* mcgraph,
-                        const wasm::WasmModule* module);
+                        const wasm::WasmModule* module,
+                        SourcePositionTable* source_position_table);
 
   const char* reducer_name() const override { return "WasmGCOperatorReducer"; }
 
@@ -59,16 +61,23 @@ class WasmGCOperatorReducer final
   Reduction ReduceAssertNotNull(Node* node);
   Reduction ReduceCheckNull(Node* node);
   Reduction ReduceWasmTypeCheck(Node* node);
+  Reduction ReduceWasmTypeCheckAbstract(Node* node);
   Reduction ReduceWasmTypeCast(Node* node);
+  Reduction ReduceWasmTypeCastAbstract(Node* node);
+  Reduction ReduceTypeGuard(Node* node);
   Reduction ReduceWasmExternInternalize(Node* node);
   Reduction ReduceMerge(Node* node);
   Reduction ReduceIf(Node* node, bool condition);
   Reduction ReduceStart(Node* node);
 
   Node* SetType(Node* node, wasm::ValueType type);
+  void UpdateSourcePosition(Node* new_node, Node* old_node);
   // Returns the intersection of the type marked on {object} and the type
   // information about object tracked on {control}'s control path (if present).
-  wasm::TypeInModule ObjectTypeFromContext(Node* object, Node* control);
+  // If {allow_non_wasm}, we bail out if the object's type is not a wasm type
+  // by returning bottom.
+  wasm::TypeInModule ObjectTypeFromContext(Node* object, Node* control,
+                                           bool allow_non_wasm = false);
   Reduction UpdateNodeAndAliasesTypes(Node* state_owner,
                                       ControlPathTypes parent_state, Node* node,
                                       wasm::TypeInModule type,
@@ -81,6 +90,7 @@ class WasmGCOperatorReducer final
   MachineGraph* mcgraph_;
   WasmGraphAssembler gasm_;
   const wasm::WasmModule* module_;
+  SourcePositionTable* source_position_table_;
 };
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/wasm-graph-assembler.cc b/deps/v8/src/compiler/wasm-graph-assembler.cc
index 099871a0cddd90..f5628744b71d3e 100644
--- a/deps/v8/src/compiler/wasm-graph-assembler.cc
+++ b/deps/v8/src/compiler/wasm-graph-assembler.cc
@@ -4,9 +4,11 @@
 
 #include "src/compiler/wasm-graph-assembler.h"
 
+#include "src/common/globals.h"
 #include "src/compiler/diamond.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/wasm-compiler-definitions.h"
+#include "src/objects/string.h"
 #include "src/wasm/object-access.h"
 #include "src/wasm/wasm-objects.h"
 
@@ -127,16 +129,13 @@ Node* WasmGraphAssembler::BuildChangeSmiToIntPtr(Node* value) {
 // at least two places, put a helper function here.
 
 Node* WasmGraphAssembler::Allocate(int size) {
-  AllowLargeObjects allow_large = size < kMaxRegularHeapObjectSize
-                                      ? AllowLargeObjects::kFalse
-                                      : AllowLargeObjects::kTrue;
-  return Allocate(Int32Constant(size), allow_large);
+  return Allocate(Int32Constant(size));
 }
 
-Node* WasmGraphAssembler::Allocate(Node* size, AllowLargeObjects allow_large) {
+Node* WasmGraphAssembler::Allocate(Node* size) {
   return AddNode(graph()->NewNode(
-      simplified_.AllocateRaw(Type::Any(), AllocationType::kYoung, allow_large),
-      size, effect(), control()));
+      simplified_.AllocateRaw(Type::Any(), AllocationType::kYoung), size,
+      effect(), control()));
 }
 
 Node* WasmGraphAssembler::LoadFromObject(MachineType type, Node* base,
@@ -173,34 +172,42 @@ Node* WasmGraphAssembler::InitializeImmutableInObject(ObjectAccess access,
                        offset, value, effect(), control()));
 }
 
-Node* WasmGraphAssembler::BuildLoadExternalPointerFromObject(
-    Node* object, int offset, ExternalPointerTag tag, Node* isolate_root) {
+Node* WasmGraphAssembler::BuildDecodeSandboxedExternalPointer(
+    Node* handle, ExternalPointerTag tag, Node* isolate_root) {
 #ifdef V8_ENABLE_SANDBOX
-  DCHECK_NE(tag, kExternalPointerNullTag);
-  Node* external_pointer = LoadFromObject(MachineType::Uint32(), object,
-                                          wasm::ObjectAccess::ToTagged(offset));
-  static_assert(kExternalPointerIndexShift > kSystemPointerSizeLog2);
-  Node* shift_amount =
-      Int32Constant(kExternalPointerIndexShift - kSystemPointerSizeLog2);
-  Node* scaled_index =
-      ChangeUint32ToUint64(Word32Shr(external_pointer, shift_amount));
+  Node* index = Word32Shr(handle, Int32Constant(kExternalPointerIndexShift));
+  Node* offset = ChangeUint32ToUint64(
+      Word32Shl(index, Int32Constant(kExternalPointerTableEntrySizeLog2)));
   Node* table;
   if (IsSharedExternalPointerType(tag)) {
     Node* table_address =
         Load(MachineType::Pointer(), isolate_root,
              IsolateData::shared_external_pointer_table_offset());
     table = Load(MachineType::Pointer(), table_address,
-                 Internals::kExternalPointerTableBufferOffset);
+                 Internals::kExternalPointerTableBasePointerOffset);
   } else {
     table = Load(MachineType::Pointer(), isolate_root,
                  IsolateData::external_pointer_table_offset() +
-                     Internals::kExternalPointerTableBufferOffset);
+                     Internals::kExternalPointerTableBasePointerOffset);
   }
-  Node* decoded_ptr = Load(MachineType::Pointer(), table, scaled_index);
+  Node* decoded_ptr = Load(MachineType::Pointer(), table, offset);
   return WordAnd(decoded_ptr, IntPtrConstant(~tag));
+#else
+  UNREACHABLE();
+#endif
+}
+
+Node* WasmGraphAssembler::BuildLoadExternalPointerFromObject(
+    Node* object, int field_offset, ExternalPointerTag tag,
+    Node* isolate_root) {
+#ifdef V8_ENABLE_SANDBOX
+  DCHECK_NE(tag, kExternalPointerNullTag);
+  Node* handle = LoadFromObject(MachineType::Uint32(), object,
+                                wasm::ObjectAccess::ToTagged(field_offset));
+  return BuildDecodeSandboxedExternalPointer(handle, tag, isolate_root);
 #else
   return LoadFromObject(MachineType::Pointer(), object,
-                        wasm::ObjectAccess::ToTagged(offset));
+                        wasm::ObjectAccess::ToTagged(field_offset));
 #endif  // V8_ENABLE_SANDBOX
 }
 
@@ -257,6 +264,7 @@ Node* WasmGraphAssembler::LoadFixedArrayLengthAsSmi(Node* fixed_array) {
 Node* WasmGraphAssembler::LoadFixedArrayElement(Node* fixed_array,
                                                 Node* index_intptr,
                                                 MachineType type) {
+  DCHECK(IsSubtype(type.representation(), MachineRepresentation::kTagged));
   Node* offset = IntAdd(
       IntMul(index_intptr, IntPtrConstant(kTaggedSize)),
       IntPtrConstant(wasm::ObjectAccess::ToTagged(FixedArray::kHeaderSize)));
@@ -287,6 +295,31 @@ Node* WasmGraphAssembler::LoadFixedArrayElement(Node* array, int index,
       type, array, wasm::ObjectAccess::ElementOffsetInTaggedFixedArray(index));
 }
 
+Node* WasmGraphAssembler::LoadByteArrayElement(Node* byte_array,
+                                               Node* index_intptr,
+                                               MachineType type) {
+  int element_size = ElementSizeInBytes(type.representation());
+  Node* offset = IntAdd(
+      IntMul(index_intptr, IntPtrConstant(element_size)),
+      IntPtrConstant(wasm::ObjectAccess::ToTagged(ByteArray::kHeaderSize)));
+  return LoadFromObject(type, byte_array, offset);
+}
+
+Node* WasmGraphAssembler::LoadExternalPointerArrayElement(
+    Node* array, Node* index_intptr, ExternalPointerTag tag,
+    Node* isolate_root) {
+  Node* offset = IntAdd(
+      IntMul(index_intptr, IntPtrConstant(kExternalPointerSlotSize)),
+      IntPtrConstant(
+          wasm::ObjectAccess::ToTagged(ExternalPointerArray::kHeaderSize)));
+#ifdef V8_ENABLE_SANDBOX
+  Node* handle = LoadFromObject(MachineType::Uint32(), array, offset);
+  return BuildDecodeSandboxedExternalPointer(handle, tag, isolate_root);
+#else
+  return LoadFromObject(MachineType::Pointer(), array, offset);
+#endif
+}
+
 Node* WasmGraphAssembler::StoreFixedArrayElement(Node* array, int index,
                                                  Node* value,
                                                  ObjectAccess access) {
@@ -370,12 +403,24 @@ Node* WasmGraphAssembler::WasmTypeCheck(Node* object, Node* rtt,
                                   rtt, effect(), control()));
 }
 
+Node* WasmGraphAssembler::WasmTypeCheckAbstract(Node* object,
+                                                WasmTypeCheckConfig config) {
+  return AddNode(graph()->NewNode(simplified_.WasmTypeCheckAbstract(config),
+                                  object, effect(), control()));
+}
+
 Node* WasmGraphAssembler::WasmTypeCast(Node* object, Node* rtt,
                                        WasmTypeCheckConfig config) {
   return AddNode(graph()->NewNode(simplified_.WasmTypeCast(config), object, rtt,
                                   effect(), control()));
 }
 
+Node* WasmGraphAssembler::WasmTypeCastAbstract(Node* object,
+                                               WasmTypeCheckConfig config) {
+  return AddNode(graph()->NewNode(simplified_.WasmTypeCastAbstract(config),
+                                  object, effect(), control()));
+}
+
 Node* WasmGraphAssembler::Null(wasm::ValueType type) {
   return AddNode(graph()->NewNode(simplified_.Null(type)));
 }
@@ -444,6 +489,12 @@ void WasmGraphAssembler::ArrayInitializeLength(Node* array, Node* length) {
                            length, effect(), control()));
 }
 
+Node* WasmGraphAssembler::LoadStringLength(Node* string) {
+  return LoadImmutableFromObject(
+      MachineType::Int32(), string,
+      wasm::ObjectAccess::ToTagged(String::kLengthOffset));
+}
+
 Node* WasmGraphAssembler::StringAsWtf16(Node* string) {
   return AddNode(graph()->NewNode(simplified_.StringAsWtf16(), string, effect(),
                                   control()));
diff --git a/deps/v8/src/compiler/wasm-graph-assembler.h b/deps/v8/src/compiler/wasm-graph-assembler.h
index 7a0a8f96229bbe..bff54591abf0ed 100644
--- a/deps/v8/src/compiler/wasm-graph-assembler.h
+++ b/deps/v8/src/compiler/wasm-graph-assembler.h
@@ -16,21 +16,6 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-constexpr Builtin WasmRuntimeStubIdToBuiltinName(
-    wasm::WasmCode::RuntimeStubId runtime_stub_id) {
-  switch (runtime_stub_id) {
-#define DEF_CASE(name)          \
-  case wasm::WasmCode::k##name: \
-    return Builtin::k##name;
-#define DEF_TRAP_CASE(name) DEF_CASE(ThrowWasm##name)
-    WASM_RUNTIME_STUB_LIST(DEF_CASE, DEF_TRAP_CASE)
-#undef DEF_CASE
-#undef DEF_TRAP_CASE
-    default:
-      UNREACHABLE();
-  }
-}
-
 CallDescriptor* GetBuiltinCallDescriptor(
     Builtin name, Zone* zone, StubCallMode stub_mode,
     bool needs_frame_state = false,
@@ -44,11 +29,14 @@ class WasmGraphAssembler : public GraphAssembler {
       : GraphAssembler(mcgraph, zone, BranchSemantics::kMachine),
         simplified_(zone) {}
 
+  // TODOC(mliedtke): What is the difference between CallRuntimeStub and
+  // CallBuiltin and what are the considerations to take into account when
+  // choosing between them?
   template <typename... Args>
   Node* CallRuntimeStub(wasm::WasmCode::RuntimeStubId stub_id,
                         Operator::Properties properties, Args... args) {
     auto* call_descriptor = GetBuiltinCallDescriptor(
-        WasmRuntimeStubIdToBuiltinName(stub_id), temp_zone(),
+        RuntimeStubIdToBuiltinName(stub_id), temp_zone(),
         StubCallMode::kCallWasmRuntimeStub, false, properties);
     // A direct call to a wasm runtime stub defined in this module.
     // Just encode the stub index. This will be patched at relocation.
@@ -65,11 +53,14 @@ class WasmGraphAssembler : public GraphAssembler {
   template <typename... Args>
   Node* CallBuiltin(Builtin name, Operator::Properties properties,
                     Args... args) {
-    auto* call_descriptor = GetBuiltinCallDescriptor(
-        name, temp_zone(), StubCallMode::kCallBuiltinPointer, false,
-        properties);
-    Node* call_target = GetBuiltinPointerTarget(name);
-    return Call(call_descriptor, call_target, args...);
+    return CallBuiltinImpl(name, false, properties, args...);
+  }
+
+  template <typename... Args>
+  Node* CallBuiltinWithFrameState(Builtin name, Operator::Properties properties,
+                                  Node* frame_state, Args... args) {
+    DCHECK_EQ(frame_state->opcode(), IrOpcode::kFrameState);
+    return CallBuiltinImpl(name, true, properties, frame_state, args...);
   }
 
   // Sets {true_node} and {false_node} to their corresponding Branch outputs.
@@ -121,8 +112,7 @@ class WasmGraphAssembler : public GraphAssembler {
 
   Node* Allocate(int size);
 
-  Node* Allocate(Node* size,
-                 AllowLargeObjects allow_large = AllowLargeObjects::kTrue);
+  Node* Allocate(Node* size);
 
   Node* LoadFromObject(MachineType type, Node* base, Node* offset);
 
@@ -159,10 +149,17 @@ class WasmGraphAssembler : public GraphAssembler {
                                        value);
   }
 
+  Node* BuildDecodeSandboxedExternalPointer(Node* handle,
+                                            ExternalPointerTag tag,
+                                            Node* isolate_root);
   Node* BuildLoadExternalPointerFromObject(Node* object, int offset,
                                            ExternalPointerTag tag,
                                            Node* isolate_root);
 
+  Node* BuildLoadExternalPointerFromObject(Node* object, int offset,
+                                           Node* index, ExternalPointerTag tag,
+                                           Node* isolate_root);
+
   Node* IsSmi(Node* object);
 
   // Maps and their contents.
@@ -200,6 +197,13 @@ class WasmGraphAssembler : public GraphAssembler {
     return LoadFixedArrayElement(array, index, MachineType::AnyTagged());
   }
 
+  Node* LoadByteArrayElement(Node* byte_array, Node* index_intptr,
+                             MachineType type);
+
+  Node* LoadExternalPointerArrayElement(Node* array, Node* index_intptr,
+                                        ExternalPointerTag tag,
+                                        Node* isolate_root);
+
   Node* StoreFixedArrayElement(Node* array, int index, Node* value,
                                ObjectAccess access);
 
@@ -243,8 +247,10 @@ class WasmGraphAssembler : public GraphAssembler {
   Node* IsDataRefMap(Node* map);
 
   Node* WasmTypeCheck(Node* object, Node* rtt, WasmTypeCheckConfig config);
+  Node* WasmTypeCheckAbstract(Node* object, WasmTypeCheckConfig config);
 
   Node* WasmTypeCast(Node* object, Node* rtt, WasmTypeCheckConfig config);
+  Node* WasmTypeCastAbstract(Node* object, WasmTypeCheckConfig config);
 
   Node* Null(wasm::ValueType type);
 
@@ -274,6 +280,8 @@ class WasmGraphAssembler : public GraphAssembler {
 
   void ArrayInitializeLength(Node* array, Node* length);
 
+  Node* LoadStringLength(Node* string);
+
   Node* StringAsWtf16(Node* string);
 
   Node* StringPrepareForGetCodeunit(Node* string);
@@ -283,13 +291,19 @@ class WasmGraphAssembler : public GraphAssembler {
   Node* HasInstanceType(Node* heap_object, InstanceType type);
 
   void TrapIf(Node* condition, TrapId reason) {
-    AddNode(graph()->NewNode(mcgraph()->common()->TrapIf(reason), condition,
-                             effect(), control()));
+    // Initially wasm traps don't have a FrameState.
+    const bool has_frame_state = false;
+    AddNode(
+        graph()->NewNode(mcgraph()->common()->TrapIf(reason, has_frame_state),
+                         condition, effect(), control()));
   }
 
   void TrapUnless(Node* condition, TrapId reason) {
-    AddNode(graph()->NewNode(mcgraph()->common()->TrapUnless(reason), condition,
-                             effect(), control()));
+    // Initially wasm traps don't have a FrameState.
+    const bool has_frame_state = false;
+    AddNode(graph()->NewNode(
+        mcgraph()->common()->TrapUnless(reason, has_frame_state), condition,
+        effect(), control()));
   }
 
   Node* LoadRootRegister() {
@@ -299,6 +313,16 @@ class WasmGraphAssembler : public GraphAssembler {
   SimplifiedOperatorBuilder* simplified() override { return &simplified_; }
 
  private:
+  template <typename... Args>
+  Node* CallBuiltinImpl(Builtin name, bool needs_frame_state,
+                        Operator::Properties properties, Args... args) {
+    auto* call_descriptor = GetBuiltinCallDescriptor(
+        name, temp_zone(), StubCallMode::kCallBuiltinPointer, needs_frame_state,
+        properties);
+    Node* call_target = GetBuiltinPointerTarget(name);
+    return Call(call_descriptor, call_target, args...);
+  }
+
   SimplifiedOperatorBuilder simplified_;
 };
 
diff --git a/deps/v8/src/compiler/wasm-inlining-into-js.cc b/deps/v8/src/compiler/wasm-inlining-into-js.cc
index ac52e9ee52a48a..8326dcc6a06cc6 100644
--- a/deps/v8/src/compiler/wasm-inlining-into-js.cc
+++ b/deps/v8/src/compiler/wasm-inlining-into-js.cc
@@ -4,6 +4,7 @@
 
 #include "src/compiler/wasm-inlining-into-js.h"
 
+#include "src/compiler/compiler-source-position-table.h"
 #include "src/compiler/wasm-compiler-definitions.h"
 #include "src/compiler/wasm-compiler.h"
 #include "src/compiler/wasm-graph-assembler.h"
@@ -30,13 +31,17 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
  public:
   WasmIntoJSInlinerImpl(Zone* zone, const wasm::WasmModule* module,
                         MachineGraph* mcgraph, const wasm::FunctionBody& body,
-                        const base::Vector<const byte>& bytes)
+                        base::Vector<const uint8_t> bytes,
+                        SourcePositionTable* source_position_table,
+                        int inlining_id)
       : wasm::Decoder(bytes.begin(), bytes.end()),
         module_(module),
         mcgraph_(mcgraph),
         body_(body),
         graph_(mcgraph->graph()),
-        gasm_(mcgraph, zone) {
+        gasm_(mcgraph, zone),
+        source_position_table_(source_position_table),
+        inlining_id_(inlining_id) {
     // +1 for instance node.
     size_t params = body.sig->parameter_count() + 1;
     Node* start =
@@ -49,7 +54,7 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
     // We have to add another +1 as the minimum parameter index is actually
     // -1, not 0...
     size_t params_extended = params + 1;
-    parameters_ = zone->NewArray<Node*>(params_extended);
+    parameters_ = zone->AllocateArray<Node*>(params_extended);
     for (unsigned i = 0; i < params_extended; i++) {
       parameters_[i] = nullptr;
     }
@@ -64,8 +69,16 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
     DCHECK_GE(index, kMinParameterIndex);
     int array_index = index - kMinParameterIndex;
     if (parameters_[array_index] == nullptr) {
-      parameters_[array_index] = graph_->NewNode(
+      Node* param = graph_->NewNode(
           mcgraph_->common()->Parameter(index, debug_name), graph_->start());
+      if (index > wasm::kWasmInstanceParameterIndex) {
+        // Add a type guard to keep type information based on the inlinee's
+        // signature.
+        wasm::ValueType type = body_.sig->GetParam(index - 1);
+        Type tf_type = compiler::Type::Wasm(type, module_, graph_->zone());
+        param = gasm_.TypeGuard(tf_type, param);
+      }
+      parameters_[array_index] = param;
     }
     return parameters_[array_index];
   }
@@ -80,7 +93,6 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
       return false;
     }
     // Parse body.
-    // TODO(mliedtke): Use zone vector?
     base::SmallVector<Value, 4> stack;
     while (is_inlineable_) {
       WasmOpcode opcode = ReadOpcode();
@@ -180,7 +192,7 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
                                   ? wasm::Nullability::kNullable
                                   : wasm::Nullability::kNonNullable);
     Node* internalized = gasm_.WasmExternInternalize(input.node);
-    return {internalized, result_type};
+    return TypeNode(internalized, result_type);
   }
 
   Value ParseExternExternalize(Value input) {
@@ -190,13 +202,13 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
                                      ? wasm::Nullability::kNullable
                                      : wasm::Nullability::kNonNullable);
     Node* internalized = gasm_.WasmExternExternalize(input.node);
-    return {internalized, result_type};
+    return TypeNode(internalized, result_type);
   }
 
   Value ParseLocalGet() {
     uint32_t index = consume_u32v();
     DCHECK_LT(index, body_.sig->parameter_count());
-    return {Param(index + 1), body_.sig->GetParam(index)};
+    return TypeNode(Param(index + 1), body_.sig->GetParam(index));
   }
 
   Value ParseStructGet(Value struct_val, WasmOpcode opcode) {
@@ -210,7 +222,8 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
         struct_val.type.is_nullable() ? kWithNullCheck : kWithoutNullCheck;
     Node* member = gasm_.StructGet(struct_val.node, struct_type, field_index,
                                    is_signed, null_check);
-    return {member, struct_type->field(field_index).Unpacked()};
+    SetSourcePosition(member);
+    return TypeNode(member, struct_type->field(field_index).Unpacked());
   }
 
   void ParseStructSet(Value wasm_struct, Value value) {
@@ -223,6 +236,7 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
         wasm_struct.type.is_nullable() ? kWithNullCheck : kWithoutNullCheck;
     gasm_.StructSet(wasm_struct.node, value.node, struct_type, field_index,
                     null_check);
+    SetSourcePosition(gasm_.effect());
   }
 
   Value ParseRefCast(Value input, bool null_succeeds) {
@@ -242,6 +256,7 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
       gasm_.TrapIf(gasm_.IsSmi(input.node), TrapId::kTrapIllegalCast);
       gasm_.TrapUnless(gasm_.HasInstanceType(input.node, WASM_ARRAY_TYPE),
                        TrapId::kTrapIllegalCast);
+      SetSourcePosition(gasm_.effect());
       gasm_.Goto(&done);
       gasm_.Bind(&done);
       // Add TypeGuard for graph typing.
@@ -254,7 +269,7 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
                              Type::Wasm(result_type, module_, graph->zone())),
                          input.node, gasm_.effect(), gasm_.control());
       gasm_.InitializeEffectControl(type_guard, gasm_.control());
-      return {type_guard, result_type};
+      return TypeNode(type_guard, result_type);
     }
     if (module_->has_signature(static_cast<uint32_t>(heap_index))) {
       is_inlineable_ = false;
@@ -265,8 +280,10 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
         null_succeeds ? wasm::kNullable : wasm::kNonNullable);
     Node* rtt = mcgraph_->graph()->NewNode(
         gasm_.simplified()->RttCanon(target_type.ref_index()), instance_node_);
+    TypeNode(rtt, wasm::ValueType::Rtt(target_type.ref_index()));
     Node* cast = gasm_.WasmTypeCast(input.node, rtt, {input.type, target_type});
-    return {cast, target_type};
+    SetSourcePosition(cast);
+    return TypeNode(cast, target_type);
   }
 
   Value ParseArrayLen(Value input) {
@@ -276,7 +293,8 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
     const CheckForNull null_check =
         input.type.is_nullable() ? kWithNullCheck : kWithoutNullCheck;
     Node* len = gasm_.ArrayLength(input.node, null_check);
-    return {len, wasm::kWasmI32};
+    SetSourcePosition(len);
+    return TypeNode(len, wasm::kWasmI32);
   }
 
   Value ParseArrayGet(Value array, Value index, WasmOpcode opcode) {
@@ -288,12 +306,14 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
         array.type.is_nullable() ? kWithNullCheck : kWithoutNullCheck;
     // Perform bounds check.
     Node* length = gasm_.ArrayLength(array.node, null_check);
+    SetSourcePosition(length);
     gasm_.TrapUnless(gasm_.Uint32LessThan(index.node, length),
                      TrapId::kTrapArrayOutOfBounds);
+    SetSourcePosition(gasm_.effect());
     // Perform array.get.
     Node* element =
         gasm_.ArrayGet(array.node, index.node, array_type, is_signed);
-    return {element, array_type->element_type().Unpacked()};
+    return TypeNode(element, array_type->element_type().Unpacked());
   }
 
   void ParseArraySet(Value array, Value index, Value value) {
@@ -304,14 +324,17 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
         array.type.is_nullable() ? kWithNullCheck : kWithoutNullCheck;
     // Perform bounds check.
     Node* length = gasm_.ArrayLength(array.node, null_check);
+    SetSourcePosition(length);
     gasm_.TrapUnless(gasm_.Uint32LessThan(index.node, length),
                      TrapId::kTrapArrayOutOfBounds);
+    SetSourcePosition(gasm_.effect());
     // Perform array.set.
     gasm_.ArraySet(array.node, index.node, value.node, array_type);
   }
 
   WasmOpcode ReadOpcode() {
     DCHECK_LT(pc_, end_);
+    instruction_start_ = pc();
     WasmOpcode opcode = static_cast<WasmOpcode>(*pc_);
     if (!WasmOpcodes::IsPrefixOpcode(opcode)) {
       ++pc_;
@@ -323,6 +346,19 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
     return opcode_with_prefix;
   }
 
+  Value TypeNode(Node* node, wasm::ValueType type) {
+    compiler::NodeProperties::SetType(
+        node, compiler::Type::Wasm(type, module_, graph_->zone()));
+    return {node, type};
+  }
+
+  void SetSourcePosition(Node* node) {
+    if (!source_position_table_->IsEnabled()) return;
+    int offset = static_cast<int>(instruction_start_ - start());
+    source_position_table_->SetSourcePosition(
+        node, SourcePosition(offset, inlining_id_));
+  }
+
   const wasm::WasmModule* module_;
   MachineGraph* mcgraph_;
   const wasm::FunctionBody& body_;
@@ -330,6 +366,9 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
   Graph* graph_;
   Node* instance_node_;
   WasmGraphAssembler gasm_;
+  SourcePositionTable* source_position_table_ = nullptr;
+  const uint8_t* instruction_start_ = pc_;
+  int inlining_id_;
   bool is_inlineable_ = true;
 };
 
@@ -338,8 +377,11 @@ class WasmIntoJSInlinerImpl : private wasm::Decoder {
 bool WasmIntoJSInliner::TryInlining(Zone* zone, const wasm::WasmModule* module,
                                     MachineGraph* mcgraph,
                                     const wasm::FunctionBody& body,
-                                    const base::Vector<const byte>& bytes) {
-  WasmIntoJSInlinerImpl inliner(zone, module, mcgraph, body, bytes);
+                                    base::Vector<const uint8_t> bytes,
+                                    SourcePositionTable* source_position_table,
+                                    int inlining_id) {
+  WasmIntoJSInlinerImpl inliner(zone, module, mcgraph, body, bytes,
+                                source_position_table, inlining_id);
   return inliner.TryInlining();
 }
 
diff --git a/deps/v8/src/compiler/wasm-inlining-into-js.h b/deps/v8/src/compiler/wasm-inlining-into-js.h
index 2f66e02b78bf99..0b78d6c51bdb36 100644
--- a/deps/v8/src/compiler/wasm-inlining-into-js.h
+++ b/deps/v8/src/compiler/wasm-inlining-into-js.h
@@ -23,6 +23,7 @@ struct WasmModule;
 namespace compiler {
 class MachineGraph;
 class Node;
+class SourcePositionTable;
 
 // The WasmIntoJsInliner provides support for inlining very small wasm functions
 // which only contain very specific supported instructions into JS.
@@ -30,7 +31,9 @@ class WasmIntoJSInliner {
  public:
   static bool TryInlining(Zone* zone, const wasm::WasmModule* module,
                           MachineGraph* mcgraph, const wasm::FunctionBody& body,
-                          const base::Vector<const byte>& bytes);
+                          base::Vector<const uint8_t> bytes,
+                          SourcePositionTable* source_position_table,
+                          int inlining_id);
 };
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/wasm-inlining.cc b/deps/v8/src/compiler/wasm-inlining.cc
index 9c04545da9cad3..3468cd5612fa1e 100644
--- a/deps/v8/src/compiler/wasm-inlining.cc
+++ b/deps/v8/src/compiler/wasm-inlining.cc
@@ -4,6 +4,8 @@
 
 #include "src/compiler/wasm-inlining.h"
 
+#include <cinttypes>
+
 #include "src/compiler/all-nodes.h"
 #include "src/compiler/compiler-source-position-table.h"
 #include "src/compiler/node-matchers.h"
@@ -47,7 +49,7 @@ Reduction WasmInliner::ReduceCall(Node* call) {
          call->opcode() == IrOpcode::kTailCall);
 
   if (seen_.find(call) != seen_.end()) {
-    TRACE("function %d: have already seen node %d, skipping\n",
+    TRACE("[function %d: have already seen node %d, skipping]\n",
           data_.func_index, call->id());
     return NoChange();
   }
@@ -58,7 +60,7 @@ Reduction WasmInliner::ReduceCall(Node* call) {
                                      ? IrOpcode::kRelocatableInt32Constant
                                      : IrOpcode::kRelocatableInt64Constant;
   if (callee->opcode() != reloc_opcode) {
-    TRACE("[function %d: considering node %d... not a relocatable constant]\n",
+    TRACE("[function %d: node %d: not a relocatable constant]\n",
           data_.func_index, call->id());
     return NoChange();
   }
@@ -87,7 +89,7 @@ Reduction WasmInliner::ReduceCall(Node* call) {
 
   CHECK_LT(inlinee_index, module()->functions.size());
   const wasm::WasmFunction* inlinee = &module()->functions[inlinee_index];
-  base::Vector<const byte> function_bytes =
+  base::Vector<const uint8_t> function_bytes =
       data_.wire_bytes_storage->GetCode(inlinee->code);
 
   int call_count = GetCallCount(call);
@@ -103,7 +105,7 @@ Reduction WasmInliner::ReduceCall(Node* call) {
     return NoChange();
   }
 
-  Trace(call, inlinee_index, "adding to inlining candidates!");
+  Trace(call, inlinee_index, "adding to inlining candidates");
 
   CandidateInfo candidate{call, inlinee_index, call_count,
                           function_bytes.length()};
@@ -112,30 +114,34 @@ Reduction WasmInliner::ReduceCall(Node* call) {
   return NoChange();
 }
 
-bool SmallEnoughToInline(size_t current_graph_size, uint32_t candidate_size) {
+bool SmallEnoughToInline(size_t current_graph_size, uint32_t candidate_size,
+                         size_t initial_graph_size) {
   if (candidate_size > v8_flags.wasm_inlining_max_size) {
     return false;
   }
-  if (WasmInliner::graph_size_allows_inlining(current_graph_size +
-                                              candidate_size)) {
+  if (WasmInliner::graph_size_allows_inlining(
+          current_graph_size + candidate_size, initial_graph_size)) {
     return true;
   }
   // For truly tiny functions, let's be a bit more generous.
   return candidate_size <= 12 &&
-         WasmInliner::graph_size_allows_inlining(current_graph_size - 100);
+         WasmInliner::graph_size_allows_inlining(current_graph_size - 100,
+                                                 initial_graph_size);
 }
 
 void WasmInliner::Trace(const CandidateInfo& candidate, const char* decision) {
   TRACE(
       "  [function %d: considering candidate {@%d, index=%d, count=%d, "
-      "size=%d}: %s]\n",
+      "size=%d, score=%" PRId64 "}: %s]\n",
       data_.func_index, candidate.node->id(), candidate.inlinee_index,
-      candidate.call_count, candidate.wire_byte_size, decision);
+      candidate.call_count, candidate.wire_byte_size, candidate.score(),
+      decision);
 }
 
 void WasmInliner::Finalize() {
-  TRACE("function %d %s: going though inlining candidates...\n",
-        data_.func_index, debug_name_);
+  TRACE("[function %d (%s): %s]\n", data_.func_index, debug_name_,
+        inlining_candidates_.empty() ? "no inlining candidates"
+                                     : "going through inlining candidates");
   if (inlining_candidates_.empty()) return;
   while (!inlining_candidates_.empty()) {
     CandidateInfo candidate = inlining_candidates_.top();
@@ -148,7 +154,8 @@ void WasmInliner::Finalize() {
     // We could build the candidate's graph first and consider its node count,
     // but it turns out that wire byte size and node count are quite strongly
     // correlated, at about 1.16 nodes per wire byte (measured for J2Wasm).
-    if (!SmallEnoughToInline(current_graph_size_, candidate.wire_byte_size)) {
+    if (!SmallEnoughToInline(current_graph_size_, candidate.wire_byte_size,
+                             initial_graph_size_)) {
       Trace(candidate, "not enough inlining budget");
       continue;
     }
@@ -169,7 +176,7 @@ void WasmInliner::Finalize() {
     }
 #endif
 
-    base::Vector<const byte> function_bytes =
+    base::Vector<const uint8_t> function_bytes =
         data_.wire_bytes_storage->GetCode(inlinee->code);
 
     const wasm::FunctionBody inlinee_body{inlinee->sig, inlinee->code.offset(),
@@ -179,9 +186,8 @@ void WasmInliner::Finalize() {
     // If the inlinee was not validated before, do that now.
     if (V8_UNLIKELY(
             !module()->function_was_validated(candidate.inlinee_index))) {
-      wasm::WasmFeatures unused_detected_features;
-      if (ValidateFunctionBody(env_->enabled_features, module(),
-                               &unused_detected_features, inlinee_body)
+      if (ValidateFunctionBody(env_->enabled_features, module(), detected_,
+                               inlinee_body)
               .failed()) {
         Trace(candidate, "function is invalid");
         // At this point we cannot easily raise a compilation error any more.
@@ -193,7 +199,6 @@ void WasmInliner::Finalize() {
       module()->set_function_validated(candidate.inlinee_index);
     }
 
-    wasm::WasmFeatures detected;
     std::vector<WasmLoopInfo> inlinee_loop_infos;
     wasm::DanglingExceptions dangling_exceptions;
 
@@ -212,7 +217,7 @@ void WasmInliner::Finalize() {
     {
       Graph::SubgraphScope scope(graph());
       wasm::BuildTFGraph(zone()->allocator(), env_->enabled_features, module(),
-                         &builder, &detected, inlinee_body, &inlinee_loop_infos,
+                         &builder, detected_, inlinee_body, &inlinee_loop_infos,
                          &dangling_exceptions, data_.node_origins,
                          candidate.inlinee_index, data_.assumptions,
                          NodeProperties::IsExceptionalCall(call)
@@ -223,7 +228,7 @@ void WasmInliner::Finalize() {
     }
 
     size_t additional_nodes = graph()->NodeCount() - subgraph_min_node_id;
-    Trace(candidate, "inlining!");
+    Trace(candidate, "inlining");
     current_graph_size_ += additional_nodes;
     DCHECK_GE(function_inlining_count_[candidate.inlinee_index], 0);
     function_inlining_count_[candidate.inlinee_index]++;
@@ -238,7 +243,9 @@ void WasmInliner::Finalize() {
     data_.loop_infos->insert(data_.loop_infos->end(),
                              inlinee_loop_infos.begin(),
                              inlinee_loop_infos.end());
-    // Returning after only one inlining has been tried and found worse.
+    // Returning after inlining, so that new calls in the inlined body are added
+    // to the candidates list and prioritized if they have a higher score.
+    return;
   }
 }
 
@@ -286,7 +293,7 @@ void WasmInliner::InlineTailCall(Node* call, Node* callee_start,
   // inlined graph to the end of the caller graph.
   for (Node* const input : callee_end->inputs()) {
     DCHECK(IrOpcode::IsGraphTerminator(input->opcode()));
-    NodeProperties::MergeControlToEnd(graph(), common(), input);
+    MergeControlToEnd(graph(), common(), input);
   }
   for (Edge edge_to_end : call->use_edges()) {
     DCHECK_EQ(edge_to_end.from(), graph()->end());
@@ -320,8 +327,7 @@ void WasmInliner::InlineCall(Node* call, Node* callee_start, Node* callee_end,
       case IrOpcode::kDeoptimize:
       case IrOpcode::kTerminate:
       case IrOpcode::kThrow:
-        NodeProperties::MergeControlToEnd(graph(), common(), input);
-        Revisit(graph()->end());
+        MergeControlToEnd(graph(), common(), input);
         break;
       case IrOpcode::kTailCall: {
         // A tail call in the callee inlined in a regular call in the caller has
@@ -329,6 +335,19 @@ void WasmInliner::InlineCall(Node* call, Node* callee_start, Node* callee_end,
         // inlinee. It will then be handled like any other return.
         auto descriptor = CallDescriptorOf(input->op());
         NodeProperties::ChangeOp(input, common()->Call(descriptor));
+
+        DCHECK_GT(input->op()->EffectOutputCount(), 0);
+        DCHECK_GT(input->op()->ControlOutputCount(), 0);
+        Node* effect = input;
+        Node* control = input;
+        if (is_exceptional_call) {
+          // Remember dangling exception (will be connected later).
+          Node* if_exception = graph()->NewNode(
+              mcgraph()->common()->IfException(), input, control);
+          dangling_exceptions->Add(if_exception, if_exception, if_exception);
+          control = graph()->NewNode(mcgraph()->common()->IfSuccess(), input);
+        }
+
         int return_arity = static_cast<int>(inlinee_sig->return_count());
         NodeVector return_inputs(zone());
         // The first input of a return node is always the 0 constant.
@@ -344,7 +363,7 @@ void WasmInliner::InlineCall(Node* call, Node* callee_start, Node* callee_end,
         } else if (return_arity > 1) {
           for (int i = 0; i < return_arity; i++) {
             Node* ith_projection =
-                graph()->NewNode(common()->Projection(i), input, input);
+                graph()->NewNode(common()->Projection(i), input, control);
             // Similarly here we have to type the call's projections.
             NodeProperties::SetType(
                 ith_projection,
@@ -354,16 +373,6 @@ void WasmInliner::InlineCall(Node* call, Node* callee_start, Node* callee_end,
           }
         }
 
-        Node* effect = input;
-        Node* control = input;
-        if (is_exceptional_call) {
-          // Remember dangling exception (will be connected later).
-          Node* if_exception = graph()->NewNode(
-              mcgraph()->common()->IfException(), input, input);
-          dangling_exceptions->Add(if_exception, if_exception, if_exception);
-          control = graph()->NewNode(mcgraph()->common()->IfSuccess(), input);
-        }
-
         // Add effect and control inputs.
         return_inputs.push_back(effect);
         return_inputs.push_back(control);
diff --git a/deps/v8/src/compiler/wasm-inlining.h b/deps/v8/src/compiler/wasm-inlining.h
index f1e0d126afd976..02b8b1dc8ad929 100644
--- a/deps/v8/src/compiler/wasm-inlining.h
+++ b/deps/v8/src/compiler/wasm-inlining.h
@@ -20,6 +20,7 @@ struct WasmInliningPosition;
 namespace wasm {
 struct CompilationEnv;
 struct DanglingExceptions;
+class WasmFeatures;
 struct WasmModule;
 }  // namespace wasm
 
@@ -34,7 +35,8 @@ class WasmInliner final : public AdvancedReducer {
   WasmInliner(Editor* editor, wasm::CompilationEnv* env,
               WasmCompilationData& data, MachineGraph* mcgraph,
               const char* debug_name,
-              ZoneVector<WasmInliningPosition>* inlining_positions)
+              ZoneVector<WasmInliningPosition>* inlining_positions,
+              wasm::WasmFeatures* detected)
       : AdvancedReducer(editor),
         env_(env),
         data_(data),
@@ -43,7 +45,8 @@ class WasmInliner final : public AdvancedReducer {
         initial_graph_size_(mcgraph->graph()->NodeCount()),
         current_graph_size_(initial_graph_size_),
         inlining_candidates_(),
-        inlining_positions_(inlining_positions) {}
+        inlining_positions_(inlining_positions),
+        detected_(detected) {}
 
   const char* reducer_name() const override { return "WasmInliner"; }
 
@@ -55,8 +58,17 @@ class WasmInliner final : public AdvancedReducer {
   // Inlines calls registered by {Reduce}, until an inlining budget is exceeded.
   void Finalize() final;
 
-  static bool graph_size_allows_inlining(size_t graph_size) {
-    return graph_size < v8_flags.wasm_inlining_budget;
+  static bool graph_size_allows_inlining(size_t graph_size,
+                                         size_t initial_graph_size) {
+    size_t budget =
+        std::max<size_t>(v8_flags.wasm_inlining_min_budget,
+                         v8_flags.wasm_inlining_factor * initial_graph_size);
+    // Independent of the wasm_inlining_budget, for large functions we should
+    // still allow some inlining.
+    size_t full_budget = std::max<size_t>(v8_flags.wasm_inlining_budget,
+                                          initial_graph_size * 1.1);
+    budget = std::min<size_t>(full_budget, budget);
+    return graph_size < budget;
   }
 
  private:
@@ -65,14 +77,26 @@ class WasmInliner final : public AdvancedReducer {
     uint32_t inlinee_index;
     int call_count;
     int wire_byte_size;
+
+    int64_t score() const {
+      // Note that the zero-point is arbitrary. Functions with negative score
+      // can still get inlined.
+
+      // Note(mliedtke): Adding information about "this call has constant
+      // arguments" didn't seem to provide measurable gains at the current
+      // state, still this would be an interesting measure to retry at a later
+      // point potentially together with other metrics.
+      const int count_factor = 2;
+      const int size_factor = 3;
+      return int64_t{call_count} * count_factor -
+             int64_t{wire_byte_size} * size_factor;
+    }
   };
 
   struct LexicographicOrdering {
     // Returns if c1 should be prioritized less than c2.
     bool operator()(CandidateInfo& c1, CandidateInfo& c2) {
-      if (c1.call_count > c2.call_count) return false;
-      if (c2.call_count > c1.call_count) return true;
-      return c1.wire_byte_size > c2.wire_byte_size;
+      return c1.score() < c2.score();
     }
   };
 
@@ -106,6 +130,7 @@ class WasmInliner final : public AdvancedReducer {
   std::unordered_set<Node*> seen_;
   std::unordered_map<uint32_t, int> function_inlining_count_;
   ZoneVector<WasmInliningPosition>* inlining_positions_;
+  wasm::WasmFeatures* detected_;
 };
 
 }  // namespace compiler
diff --git a/deps/v8/src/compiler/wasm-js-lowering.cc b/deps/v8/src/compiler/wasm-js-lowering.cc
new file mode 100644
index 00000000000000..5bfea5b6182c23
--- /dev/null
+++ b/deps/v8/src/compiler/wasm-js-lowering.cc
@@ -0,0 +1,77 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/wasm-js-lowering.h"
+
+#include "src/compiler/common-operator.h"
+#include "src/compiler/compiler-source-position-table.h"
+#include "src/compiler/node-properties.h"
+#include "src/compiler/opcodes.h"
+#include "src/compiler/operator.h"
+#include "src/wasm/wasm-code-manager.h"
+
+namespace v8::internal::compiler {
+
+WasmJSLowering::WasmJSLowering(Editor* editor, MachineGraph* mcgraph,
+                               SourcePositionTable* source_position_table)
+    : AdvancedReducer(editor),
+      gasm_(mcgraph, mcgraph->zone()),
+      mcgraph_(mcgraph),
+      source_position_table_(source_position_table) {}
+
+Reduction WasmJSLowering::Reduce(Node* node) {
+  switch (node->opcode()) {
+    case IrOpcode::kTrapIf:
+    case IrOpcode::kTrapUnless: {
+      Node* effect = NodeProperties::GetEffectInput(node);
+      Node* control = NodeProperties::GetControlInput(node);
+      Node* trap_condition = NodeProperties::GetValueInput(node, 0);
+      auto ool_trap = gasm_.MakeDeferredLabel();
+      gasm_.InitializeEffectControl(effect, control);
+      if (node->opcode() == IrOpcode::kTrapIf) {
+        gasm_.GotoIf(trap_condition, &ool_trap);
+      } else {
+        DCHECK_EQ(node->opcode(), IrOpcode::kTrapUnless);
+        gasm_.GotoIfNot(trap_condition, &ool_trap);
+      }
+      effect = gasm_.effect();
+      control = gasm_.control();
+      Node* goto_node = control;
+
+      // Generate out of line code.
+      gasm_.InitializeEffectControl(nullptr, nullptr);
+      gasm_.Bind(&ool_trap);
+      TrapId trap_id = TrapIdOf(node->op());
+      Builtin trap = wasm::RuntimeStubIdToBuiltinName(
+          static_cast<wasm::WasmCode::RuntimeStubId>(trap_id));
+
+      // Create new FrameState with the correct source position (the position
+      // of the trap location).
+      Node* frame_state = NodeProperties::GetValueInput(node, 1);
+      const FrameStateInfo& info = FrameState(frame_state).frame_state_info();
+      SourcePosition position = source_position_table_->GetSourcePosition(node);
+      Node* new_frame_state = mcgraph_->graph()->CloneNode(frame_state);
+      BytecodeOffset bailout_id(position.ScriptOffset());
+      const Operator* frame_state_op = mcgraph_->common()->FrameState(
+          bailout_id, info.state_combine(), info.function_info());
+      NodeProperties::ChangeOp(new_frame_state, frame_state_op);
+
+      gasm_.CallBuiltinWithFrameState(trap, Operator::kNoProperties,
+                                      new_frame_state);
+      Node* terminate = mcgraph_->graph()->NewNode(
+          mcgraph_->common()->Throw(), gasm_.effect(), gasm_.control());
+      MergeControlToEnd(mcgraph_->graph(), mcgraph_->common(), terminate);
+
+      // Replace the trap node with the conditional branch.
+      gasm_.InitializeEffectControl(effect, control);
+      ReplaceWithValue(node, goto_node, gasm_.effect(), gasm_.control());
+      node->Kill();
+      return Replace(goto_node);
+    }
+    default:
+      return NoChange();
+  }
+}
+
+}  // namespace v8::internal::compiler
diff --git a/deps/v8/src/compiler/wasm-js-lowering.h b/deps/v8/src/compiler/wasm-js-lowering.h
new file mode 100644
index 00000000000000..e3d88f3bb385ee
--- /dev/null
+++ b/deps/v8/src/compiler/wasm-js-lowering.h
@@ -0,0 +1,41 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#ifndef V8_COMPILER_WASM_JS_LOWERING_H_
+#define V8_COMPILER_WASM_JS_LOWERING_H_
+
+#include "src/compiler/graph-reducer.h"
+#include "src/compiler/wasm-compiler-definitions.h"
+#include "src/compiler/wasm-graph-assembler.h"
+
+namespace v8::internal::compiler {
+
+class SourcePositionTable;
+
+// This reducer is part of the JavaScript pipeline and contains lowering of
+// wasm nodes (from inlined wasm functions).
+//
+// The reducer replaces all TrapIf / TrapUnless nodes with a conditional goto to
+// deferred code containing a call to the trap builtin.
+class WasmJSLowering final : public AdvancedReducer {
+ public:
+  WasmJSLowering(Editor* editor, MachineGraph* mcgraph,
+                 SourcePositionTable* source_position_table);
+
+  const char* reducer_name() const override { return "WasmJSLowering"; }
+  Reduction Reduce(Node* node) final;
+
+ private:
+  WasmGraphAssembler gasm_;
+  const MachineGraph* mcgraph_;
+  SourcePositionTable* source_position_table_;
+};
+
+}  // namespace v8::internal::compiler
+
+#endif  // V8_COMPILER_WASM_JS_LOWERING_H_
diff --git a/deps/v8/src/compiler/wasm-load-elimination.cc b/deps/v8/src/compiler/wasm-load-elimination.cc
index 6abd39ef3fa421..086d48938da874 100644
--- a/deps/v8/src/compiler/wasm-load-elimination.cc
+++ b/deps/v8/src/compiler/wasm-load-elimination.cc
@@ -46,6 +46,7 @@ bool MayAlias(Node* lhs, Node* rhs) {
 
 Node* ResolveAliases(Node* node) {
   while (node->opcode() == IrOpcode::kWasmTypeCast ||
+         node->opcode() == IrOpcode::kWasmTypeCastAbstract ||
          node->opcode() == IrOpcode::kAssertNotNull ||
          node->opcode() == IrOpcode::kTypeGuard) {
     node = NodeProperties::GetValueInput(node, 0);
@@ -58,6 +59,7 @@ Node* ResolveAliases(Node* node) {
 constexpr int kArrayLengthFieldIndex = -1;
 constexpr int kStringPrepareForGetCodeunitIndex = -2;
 constexpr int kStringAsWtf16Index = -3;
+constexpr int kExternInternalizeIndex = -4;
 }  // namespace
 
 Reduction WasmLoadElimination::UpdateState(Node* node,
@@ -95,7 +97,18 @@ std::tuple<Node*, Node*> WasmLoadElimination::TruncateAndExtendOrType(
     return {ret, effect};
   }
 
-  wasm::TypeInModule node_type = NodeProperties::GetType(value).AsWasm();
+  // The value might be untyped in case of wasm inlined into JS if the value
+  // comes from a JS node.
+  if (!NodeProperties::IsTyped(value)) {
+    return {value, effect};
+  }
+
+  Type value_type = NodeProperties::GetType(value);
+  if (!value_type.IsWasm()) {
+    return {value, effect};
+  }
+
+  wasm::TypeInModule node_type = value_type.AsWasm();
 
   // TODO(12166): Adapt this if cross-module inlining is allowed.
   if (!wasm::IsSubtypeOf(node_type.type, field_type, node_type.module)) {
@@ -128,6 +141,8 @@ Reduction WasmLoadElimination::Reduce(Node* node) {
       return ReduceStringPrepareForGetCodeunit(node);
     case IrOpcode::kStringAsWtf16:
       return ReduceStringAsWtf16(node);
+    case IrOpcode::kWasmExternInternalize:
+      return ReduceExternInternalize(node);
     case IrOpcode::kEffectPhi:
       return ReduceEffectPhi(node);
     case IrOpcode::kDead:
@@ -141,33 +156,43 @@ Reduction WasmLoadElimination::Reduce(Node* node) {
 
 Reduction WasmLoadElimination::ReduceWasmStructGet(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kWasmStructGet);
-  Node* object = ResolveAliases(NodeProperties::GetValueInput(node, 0));
+  Node* input_struct = NodeProperties::GetValueInput(node, 0);
+  Node* object = ResolveAliases(input_struct);
   Node* effect = NodeProperties::GetEffectInput(node);
   Node* control = NodeProperties::GetControlInput(node);
 
+  if (object->opcode() == IrOpcode::kDead) return NoChange();
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
 
   const WasmFieldInfo& field_info = OpParameter<WasmFieldInfo>(node->op());
   bool is_mutable = field_info.type->mutability(field_info.field_index);
 
-  // - The node can only be typed as bottom in unreachable code.
-  // - We can only find the field in the wrong half-state in unreachable code.
-  if (NodeProperties::GetType(node).AsWasm().type.is_bottom() ||
-      !(is_mutable ? &state->immutable_state : &state->mutable_state)
-           ->LookupField(field_info.field_index, object)
+  // Skip reduction if the input type is nullref. in this case, the struct get
+  // will always trap.
+  wasm::ValueType struct_type =
+      NodeProperties::GetType(input_struct).AsWasm().type;
+  if (struct_type == wasm::kWasmNullRef) {
+    return NoChange();
+  }
+  // The node is in unreachable code if its input is uninhabitable (bottom or
+  // ref none type). It can also be treated as unreachable if the field index is
+  // in the wrong half state. This can happen if an object gets cast to two
+  // unrelated types subsequently (as the state only tracks the field index)
+  // independent of the underlying type.
+  if (struct_type.is_uninhabited() ||
+      !(is_mutable ? state->immutable_state : state->mutable_state)
+           .LookupField(field_info.field_index, object)
            .IsEmpty()) {
-    Node* unreachable =
-        graph()->NewNode(jsgraph()->common()->Unreachable(), effect, control);
-    MachineRepresentation rep =
-        field_info.type->field(field_info.field_index).machine_representation();
-    Node* dead_value =
-        graph()->NewNode(jsgraph()->common()->DeadValue(rep), unreachable);
-    NodeProperties::SetType(dead_value, NodeProperties::GetType(node));
-    ReplaceWithValue(node, dead_value, unreachable, control);
+    ReplaceWithValue(node, dead(), dead(), dead());
+    MergeControlToEnd(graph(), common(),
+                      graph()->NewNode(common()->Throw(), effect, control));
     node->Kill();
-    return Replace(dead_value);
+    return Replace(dead());
   }
+  // If the input type is not (ref null? none) or bottom and we don't have type
+  // inconsistencies, then the result type must be valid.
+  DCHECK(!NodeProperties::GetType(node).AsWasm().type.is_bottom());
 
   HalfState const* half_state =
       is_mutable ? &state->mutable_state : &state->immutable_state;
@@ -197,28 +222,44 @@ Reduction WasmLoadElimination::ReduceWasmStructGet(Node* node) {
 
 Reduction WasmLoadElimination::ReduceWasmStructSet(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kWasmStructSet);
-  Node* object = ResolveAliases(NodeProperties::GetValueInput(node, 0));
+  Node* input_struct = NodeProperties::GetValueInput(node, 0);
+  Node* object = ResolveAliases(input_struct);
   Node* value = NodeProperties::GetValueInput(node, 1);
   Node* effect = NodeProperties::GetEffectInput(node);
   Node* control = NodeProperties::GetControlInput(node);
 
+  if (object->opcode() == IrOpcode::kDead) return NoChange();
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
 
+  // Skip reduction if the input type is nullref. in this case, the struct get
+  // will always trap.
+  wasm::ValueType struct_type =
+      NodeProperties::GetType(input_struct).AsWasm().type;
+  if (struct_type == wasm::kWasmNullRef) {
+    return NoChange();
+  }
+
   const WasmFieldInfo& field_info = OpParameter<WasmFieldInfo>(node->op());
   bool is_mutable = field_info.type->mutability(field_info.field_index);
 
-  if (is_mutable) {
-    // We can find the field in the wrong half-state only in unreachable code.
-    if (!(state->immutable_state.LookupField(field_info.field_index, object)
-              .IsEmpty())) {
-      Node* unreachable =
-          graph()->NewNode(jsgraph()->common()->Unreachable(), effect, control);
-      ReplaceWithValue(node, unreachable, unreachable, control);
-      node->Kill();
-      return Replace(unreachable);
-    }
+  // The struct.set is unreachable if its input struct is an uninhabitable type.
+  // It can also be treated as unreachable if the field index is in the wrong
+  // half state. This can happen if an object gets cast to two unrelated types
+  // subsequently (as the state only tracks the field index) independent of the
+  // underlying type.
+  if (struct_type.is_uninhabited() ||
+      !(is_mutable ? state->immutable_state : state->mutable_state)
+           .LookupField(field_info.field_index, object)
+           .IsEmpty()) {
+    ReplaceWithValue(node, dead(), dead(), dead());
+    MergeControlToEnd(graph(), common(),
+                      graph()->NewNode(common()->Throw(), effect, control));
+    node->Kill();
+    return Replace(dead());
+  }
 
+  if (is_mutable) {
     HalfState const* mutable_state =
         state->mutable_state.KillField(field_info.field_index, object);
     mutable_state =
@@ -227,15 +268,6 @@ Reduction WasmLoadElimination::ReduceWasmStructSet(Node* node) {
         zone()->New<AbstractState>(*mutable_state, state->immutable_state);
     return UpdateState(node, new_state);
   } else {
-    // We can find the field in the wrong half-state only in unreachable code.
-    if (!(state->mutable_state.LookupField(field_info.field_index, object)
-              .IsEmpty())) {
-      Node* unreachable =
-          graph()->NewNode(jsgraph()->common()->Unreachable(), effect, control);
-      ReplaceWithValue(node, unreachable, unreachable, control);
-      node->Kill();
-      return Replace(unreachable);
-    }
     // We should not initialize the same immutable field twice.
     DCHECK(state->immutable_state.LookupField(field_info.field_index, object)
                .IsEmpty());
@@ -247,19 +279,23 @@ Reduction WasmLoadElimination::ReduceWasmStructSet(Node* node) {
   }
 }
 
-Reduction WasmLoadElimination::ReduceWasmArrayLength(Node* node) {
-  DCHECK_EQ(node->opcode(), IrOpcode::kWasmArrayLength);
+Reduction WasmLoadElimination::ReduceLoadLikeFromImmutable(Node* node,
+                                                           int index) {
+  // The index must be negative as it is not a real load, to not confuse it with
+  // actual loads.
+  DCHECK_LT(index, 0);
   Node* object = ResolveAliases(NodeProperties::GetValueInput(node, 0));
   Node* effect = NodeProperties::GetEffectInput(node);
   Node* control = NodeProperties::GetControlInput(node);
 
+  if (object->opcode() == IrOpcode::kDead) return NoChange();
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
 
   HalfState const* immutable_state = &state->immutable_state;
 
   FieldOrElementValue lookup_result =
-      immutable_state->LookupField(kArrayLengthFieldIndex, object);
+      immutable_state->LookupField(index, object);
 
   if (!lookup_result.IsEmpty() && !lookup_result.value->IsDead()) {
     ReplaceWithValue(node, lookup_result.value, effect, control);
@@ -267,8 +303,7 @@ Reduction WasmLoadElimination::ReduceWasmArrayLength(Node* node) {
     return Replace(lookup_result.value);
   }
 
-  immutable_state =
-      immutable_state->AddField(kArrayLengthFieldIndex, object, node);
+  immutable_state = immutable_state->AddField(index, object, node);
 
   AbstractState const* new_state =
       zone()->New<AbstractState>(state->mutable_state, *immutable_state);
@@ -276,12 +311,18 @@ Reduction WasmLoadElimination::ReduceWasmArrayLength(Node* node) {
   return UpdateState(node, new_state);
 }
 
+Reduction WasmLoadElimination::ReduceWasmArrayLength(Node* node) {
+  DCHECK_EQ(node->opcode(), IrOpcode::kWasmArrayLength);
+  return ReduceLoadLikeFromImmutable(node, kArrayLengthFieldIndex);
+}
+
 Reduction WasmLoadElimination::ReduceWasmArrayInitializeLength(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kWasmArrayInitializeLength);
   Node* object = ResolveAliases(NodeProperties::GetValueInput(node, 0));
   Node* value = NodeProperties::GetValueInput(node, 1);
   Node* effect = NodeProperties::GetEffectInput(node);
 
+  if (object->opcode() == IrOpcode::kDead) return NoChange();
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
 
@@ -301,6 +342,7 @@ Reduction WasmLoadElimination::ReduceStringPrepareForGetCodeunit(Node* node) {
   Node* effect = NodeProperties::GetEffectInput(node);
   Node* control = NodeProperties::GetControlInput(node);
 
+  if (object->opcode() == IrOpcode::kDead) return NoChange();
   AbstractState const* state = node_states_.Get(effect);
   if (state == nullptr) return NoChange();
 
@@ -332,31 +374,15 @@ Reduction WasmLoadElimination::ReduceStringPrepareForGetCodeunit(Node* node) {
 
 Reduction WasmLoadElimination::ReduceStringAsWtf16(Node* node) {
   DCHECK_EQ(node->opcode(), IrOpcode::kStringAsWtf16);
-  Node* object = ResolveAliases(NodeProperties::GetValueInput(node, 0));
-  Node* effect = NodeProperties::GetEffectInput(node);
-  Node* control = NodeProperties::GetControlInput(node);
-
-  AbstractState const* state = node_states_.Get(effect);
-  if (state == nullptr) return NoChange();
-
-  HalfState const* immutable_state = &state->immutable_state;
-
-  FieldOrElementValue lookup_result =
-      immutable_state->LookupField(kStringAsWtf16Index, object);
-
-  if (!lookup_result.IsEmpty() && !lookup_result.value->IsDead()) {
-    ReplaceWithValue(node, lookup_result.value, effect, control);
-    node->Kill();
-    return Replace(lookup_result.value);
-  }
-
-  immutable_state =
-      immutable_state->AddField(kStringAsWtf16Index, object, node);
-
-  AbstractState const* new_state =
-      zone()->New<AbstractState>(state->mutable_state, *immutable_state);
+  return ReduceLoadLikeFromImmutable(node, kStringAsWtf16Index);
+}
 
-  return UpdateState(node, new_state);
+Reduction WasmLoadElimination::ReduceExternInternalize(Node* node) {
+  DCHECK_EQ(node->opcode(), IrOpcode::kWasmExternInternalize);
+  // An externref is not immutable meaning it could change. However, the values
+  // relevant for extern.internalize (null, HeapNumber, Smi) are immutable, so
+  // we can treat the externref as immutable.
+  return ReduceLoadLikeFromImmutable(node, kExternInternalizeIndex);
 }
 
 Reduction WasmLoadElimination::ReduceOtherNode(Node* node) {
@@ -452,8 +478,11 @@ WasmLoadElimination::HalfState const* WasmLoadElimination::HalfState::KillField(
 WasmLoadElimination::AbstractState const* WasmLoadElimination::ComputeLoopState(
     Node* node, AbstractState const* state) const {
   DCHECK_EQ(node->opcode(), IrOpcode::kEffectPhi);
+  if (state->mutable_state.IsEmpty()) return state;
   std::queue<Node*> queue;
-  std::unordered_set<Node*> visited;
+  AccountingAllocator allocator;
+  Zone temp_set_zone(&allocator, ZONE_NAME);
+  ZoneUnorderedSet<Node*> visited(&temp_set_zone);
   visited.insert(node);
   for (int i = 1; i < node->InputCount() - 1; ++i) {
     queue.push(node->InputAt(i));
@@ -464,6 +493,12 @@ WasmLoadElimination::AbstractState const* WasmLoadElimination::ComputeLoopState(
     if (visited.insert(current).second) {
       if (current->opcode() == IrOpcode::kWasmStructSet) {
         Node* object = NodeProperties::GetValueInput(current, 0);
+        if (object->opcode() == IrOpcode::kDead ||
+            object->opcode() == IrOpcode::kDeadValue) {
+          // We are in dead code. Bail out with no mutable state.
+          return zone()->New<AbstractState>(HalfState(zone()),
+                                            state->immutable_state);
+        }
         WasmFieldInfo field_info = OpParameter<WasmFieldInfo>(current->op());
         bool is_mutable = field_info.type->mutability(field_info.field_index);
         if (is_mutable) {
@@ -509,6 +544,7 @@ WasmLoadElimination::WasmLoadElimination(Editor* editor, JSGraph* jsgraph,
       empty_state_(zone),
       node_states_(jsgraph->graph()->NodeCount(), zone),
       jsgraph_(jsgraph),
+      dead_(jsgraph->Dead()),
       zone_(zone) {}
 
 CommonOperatorBuilder* WasmLoadElimination::common() const {
diff --git a/deps/v8/src/compiler/wasm-load-elimination.h b/deps/v8/src/compiler/wasm-load-elimination.h
index 76be09d27c5ef4..04a9be5aad22b9 100644
--- a/deps/v8/src/compiler/wasm-load-elimination.h
+++ b/deps/v8/src/compiler/wasm-load-elimination.h
@@ -60,6 +60,10 @@ class V8_EXPORT_PRIVATE WasmLoadElimination final
     bool Equals(HalfState const* that) const {
       return fields_ == that->fields_ && elements_ == that->elements_;
     }
+    bool IsEmpty() const {
+      return fields_.begin() == fields_.end() &&
+             elements_.begin() == elements_.end();
+    }
     void IntersectWith(HalfState const* that);
     HalfState const* KillField(int field_index, Node* object) const;
     HalfState const* AddField(int field_index, Node* object, Node* value) const;
@@ -120,10 +124,15 @@ class V8_EXPORT_PRIVATE WasmLoadElimination final
   Reduction ReduceWasmArrayInitializeLength(Node* node);
   Reduction ReduceStringPrepareForGetCodeunit(Node* node);
   Reduction ReduceStringAsWtf16(Node* node);
+  Reduction ReduceExternInternalize(Node* node);
   Reduction ReduceEffectPhi(Node* node);
   Reduction ReduceStart(Node* node);
   Reduction ReduceOtherNode(Node* node);
 
+  // Reduce an operation that could be treated as a load from an immutable
+  // object.
+  Reduction ReduceLoadLikeFromImmutable(Node* node, int index);
+
   Reduction UpdateState(Node* node, AbstractState const* state);
 
   AbstractState const* ComputeLoopState(Node* node,
@@ -141,12 +150,14 @@ class V8_EXPORT_PRIVATE WasmLoadElimination final
   Isolate* isolate() const;
   Graph* graph() const;
   JSGraph* jsgraph() const { return jsgraph_; }
+  Node* dead() const { return dead_; }
   Zone* zone() const { return zone_; }
   AbstractState const* empty_state() const { return &empty_state_; }
 
   AbstractState const empty_state_;
   NodeAuxData<AbstractState const*> node_states_;
   JSGraph* const jsgraph_;
+  Node* dead_;
   Zone* zone_;
 };
 
diff --git a/deps/v8/src/compiler/wasm-typer.cc b/deps/v8/src/compiler/wasm-typer.cc
index abff2952846af1..05ca35fa5aa1ec 100644
--- a/deps/v8/src/compiler/wasm-typer.cc
+++ b/deps/v8/src/compiler/wasm-typer.cc
@@ -46,17 +46,21 @@ Reduction WasmTyper::Reduce(Node* node) {
   switch (node->opcode()) {
     case IrOpcode::kTypeGuard: {
       if (!AllInputsTyped(node)) return NoChange();
-      TypeInModule guarded_type = TypeGuardTypeOf(node->op()).AsWasm();
-      TypeInModule input_type =
-          NodeProperties::GetType(NodeProperties::GetValueInput(node, 0))
-              .AsWasm();
+      Type guarded_type = TypeGuardTypeOf(node->op());
+      if (!guarded_type.IsWasm()) return NoChange();
+      Type input_type =
+          NodeProperties::GetType(NodeProperties::GetValueInput(node, 0));
+      if (!input_type.IsWasm()) return NoChange();
+      TypeInModule guarded_wasm_type = guarded_type.AsWasm();
+      TypeInModule input_wasm_type = input_type.AsWasm();
       // Note: The intersection type might be bottom. In this case, we are in a
       // dead branch: Type this node as bottom and wait for the
       // WasmGCOperatorReducer to remove it.
-      computed_type = wasm::Intersection(guarded_type, input_type);
+      computed_type = wasm::Intersection(guarded_wasm_type, input_wasm_type);
       break;
     }
-    case IrOpcode::kWasmTypeCast: {
+    case IrOpcode::kWasmTypeCast:
+    case IrOpcode::kWasmTypeCastAbstract: {
       if (!AllInputsTyped(node)) return NoChange();
       TypeInModule object_type =
           NodeProperties::GetType(NodeProperties::GetValueInput(node, 0))
@@ -84,18 +88,20 @@ Reduction WasmTyper::Reduce(Node* node) {
         // For a loop phi, we can forward the non-recursive-input type. We can
         // recompute the type when the rest of the inputs' types are computed.
         Node* non_recursive_input = NodeProperties::GetValueInput(node, 0);
-        if (!NodeProperties::IsTyped(non_recursive_input)) return NoChange();
+        if (!NodeProperties::IsTyped(non_recursive_input) ||
+            !NodeProperties::GetType(non_recursive_input).IsWasm()) {
+          return NoChange();
+        }
         computed_type = NodeProperties::GetType(non_recursive_input).AsWasm();
         TRACE("function: %d, loop phi node: %d, type: %s\n", function_index_,
               node->id(), computed_type.type.name().c_str());
         break;
       }
 
-      computed_type = {
-          wasm::kWasmBottom,
-          NodeProperties::GetType(NodeProperties::GetValueInput(node, 0))
-              .AsWasm()
-              .module};
+      Type input_type =
+          NodeProperties::GetType(NodeProperties::GetValueInput(node, 0));
+      if (!input_type.IsWasm()) return NoChange();
+      computed_type = {wasm::kWasmBottom, input_type.AsWasm().module};
       for (int i = 0; i < node->op()->ValueInputCount(); i++) {
         Node* input = NodeProperties::GetValueInput(node, i);
         TypeInModule input_type = NodeProperties::GetType(input).AsWasm();
@@ -132,8 +138,9 @@ Reduction WasmTyper::Reduce(Node* node) {
       // because it is an internal VM object (e.g. the instance).
       if (!NodeProperties::IsTyped(object)) return NoChange();
       TypeInModule object_type = NodeProperties::GetType(object).AsWasm();
-      // This can happen in unreachable branches.
-      if (object_type.type.is_bottom() || object_type.type.is_uninhabited()) {
+      // {is_uninhabited} can happen in unreachable branches.
+      if (object_type.type.is_uninhabited() ||
+          object_type.type == wasm::kWasmNullRef) {
         computed_type = {wasm::kWasmBottom, object_type.module};
         break;
       }
@@ -150,8 +157,8 @@ Reduction WasmTyper::Reduce(Node* node) {
       // This can happen either because the object has not been typed yet.
       if (!NodeProperties::IsTyped(object)) return NoChange();
       TypeInModule object_type = NodeProperties::GetType(object).AsWasm();
-      // This can happen in unreachable branches.
-      if (object_type.type.is_bottom() || object_type.type.is_uninhabited() ||
+      // {is_uninhabited} can happen in unreachable branches.
+      if (object_type.type.is_uninhabited() ||
           object_type.type == wasm::kWasmNullRef) {
         computed_type = {wasm::kWasmBottom, object_type.module};
         break;
@@ -170,17 +177,26 @@ Reduction WasmTyper::Reduce(Node* node) {
           object_type.module};
       break;
     }
+    case IrOpcode::kNull: {
+      TypeInModule from_node = NodeProperties::GetType(node).AsWasm();
+      computed_type = {wasm::ToNullSentinel(from_node), from_node.module};
+      break;
+    }
     default:
       return NoChange();
   }
 
-  if (NodeProperties::IsTyped(node)) {
+  if (NodeProperties::IsTyped(node) && NodeProperties::GetType(node).IsWasm()) {
     TypeInModule current_type = NodeProperties::GetType(node).AsWasm();
     if (!(current_type.type.is_bottom() || computed_type.type.is_bottom() ||
           wasm::IsSubtypeOf(current_type.type, computed_type.type,
                             current_type.module, computed_type.module) ||
           wasm::IsSubtypeOf(computed_type.type, current_type.type,
-                            computed_type.module, current_type.module))) {
+                            computed_type.module, current_type.module) ||
+          // Imported strings can have more precise types.
+          (current_type.type.heap_representation() == wasm::HeapType::kExtern &&
+           computed_type.type.heap_representation() ==
+               wasm::HeapType::kString))) {
       FATAL(
           "Error - Incompatible types. function: %d, node: %d:%s, input0:%d, "
           "current %s, computed %s\n",
diff --git a/deps/v8/src/compiler/write-barrier-kind.h b/deps/v8/src/compiler/write-barrier-kind.h
index 1f38049f2d7121..fc768eb6940b5d 100644
--- a/deps/v8/src/compiler/write-barrier-kind.h
+++ b/deps/v8/src/compiler/write-barrier-kind.h
@@ -19,6 +19,7 @@ enum WriteBarrierKind : uint8_t {
   kAssertNoWriteBarrier,
   kMapWriteBarrier,
   kPointerWriteBarrier,
+  kIndirectPointerWriteBarrier,
   kEphemeronKeyWriteBarrier,
   kFullWriteBarrier
 };
@@ -37,6 +38,8 @@ inline std::ostream& operator<<(std::ostream& os, WriteBarrierKind kind) {
       return os << "MapWriteBarrier";
     case kPointerWriteBarrier:
       return os << "PointerWriteBarrier";
+    case kIndirectPointerWriteBarrier:
+      return os << "IndirectPointerWriteBarrier";
     case kEphemeronKeyWriteBarrier:
       return os << "EphemeronKeyWriteBarrier";
     case kFullWriteBarrier:
diff --git a/deps/v8/src/d8/async-hooks-wrapper.cc b/deps/v8/src/d8/async-hooks-wrapper.cc
index 8076448a0be4b5..f47c888fe1858b 100644
--- a/deps/v8/src/d8/async-hooks-wrapper.cc
+++ b/deps/v8/src/d8/async-hooks-wrapper.cc
@@ -18,15 +18,17 @@ namespace v8 {
 
 namespace {
 std::shared_ptr<AsyncHooksWrap> UnwrapHook(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
-  HandleScope scope(isolate);
-  Local<Object> hook = args.This();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* v8_isolate = info.GetIsolate();
+  HandleScope scope(v8_isolate);
+  Local<Object> hook = info.This();
 
-  AsyncHooks* hooks = PerIsolateData::Get(isolate)->GetAsyncHooks();
+  AsyncHooks* hooks = PerIsolateData::Get(v8_isolate)->GetAsyncHooks();
 
-  if (!hooks->async_hook_ctor.Get(isolate)->HasInstance(hook)) {
-    isolate->ThrowError("Invalid 'this' passed instead of AsyncHooks instance");
+  if (!hooks->async_hook_ctor.Get(v8_isolate)->HasInstance(hook)) {
+    v8_isolate->ThrowError(
+        "Invalid 'this' passed instead of AsyncHooks instance");
     return nullptr;
   }
 
@@ -34,48 +36,51 @@ std::shared_ptr<AsyncHooksWrap> UnwrapHook(
   return i::Handle<i::Managed<AsyncHooksWrap>>::cast(handle)->get();
 }
 
-void EnableHook(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  auto wrap = UnwrapHook(args);
+void EnableHook(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  auto wrap = UnwrapHook(info);
   if (wrap) wrap->Enable();
 }
 
-void DisableHook(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  auto wrap = UnwrapHook(args);
+void DisableHook(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  auto wrap = UnwrapHook(info);
   if (wrap) wrap->Disable();
 }
 
 }  // namespace
 
-AsyncHooks::AsyncHooks(Isolate* isolate) : isolate_(isolate) {
+AsyncHooks::AsyncHooks(v8::Isolate* v8_isolate) : v8_isolate_(v8_isolate) {
   AsyncContext ctx;
   ctx.execution_async_id = 1;
   ctx.trigger_async_id = 0;
   asyncContexts.push(ctx);
   current_async_id = 1;
 
-  HandleScope handle_scope(isolate_);
+  HandleScope handle_scope(v8_isolate_);
 
-  async_hook_ctor.Reset(isolate_, FunctionTemplate::New(isolate_));
-  async_hook_ctor.Get(isolate_)->SetClassName(
-      String::NewFromUtf8Literal(isolate_, "AsyncHook"));
+  async_hook_ctor.Reset(v8_isolate_, FunctionTemplate::New(v8_isolate_));
+  async_hook_ctor.Get(v8_isolate_)
+      ->SetClassName(String::NewFromUtf8Literal(v8_isolate_, "AsyncHook"));
 
-  async_hooks_templ.Reset(isolate_,
-                          async_hook_ctor.Get(isolate_)->InstanceTemplate());
-  async_hooks_templ.Get(isolate_)->SetInternalFieldCount(1);
-  async_hooks_templ.Get(isolate_)->Set(
-      isolate_, "enable", FunctionTemplate::New(isolate_, EnableHook));
-  async_hooks_templ.Get(isolate_)->Set(
-      isolate_, "disable", FunctionTemplate::New(isolate_, DisableHook));
+  async_hooks_templ.Reset(v8_isolate_,
+                          async_hook_ctor.Get(v8_isolate_)->InstanceTemplate());
+  async_hooks_templ.Get(v8_isolate_)->SetInternalFieldCount(1);
+  async_hooks_templ.Get(v8_isolate_)
+      ->Set(v8_isolate_, "enable",
+            FunctionTemplate::New(v8_isolate_, EnableHook));
+  async_hooks_templ.Get(v8_isolate_)
+      ->Set(v8_isolate_, "disable",
+            FunctionTemplate::New(v8_isolate_, DisableHook));
 
-  async_id_symbol.Reset(isolate_, Private::New(isolate_));
-  trigger_id_symbol.Reset(isolate_, Private::New(isolate_));
+  async_id_symbol.Reset(v8_isolate_, Private::New(v8_isolate_));
+  trigger_id_symbol.Reset(v8_isolate_, Private::New(v8_isolate_));
 
-  isolate_->SetPromiseHook(ShellPromiseHook);
+  v8_isolate_->SetPromiseHook(ShellPromiseHook);
 }
 
 AsyncHooks::~AsyncHooks() {
-  isolate_->SetPromiseHook(nullptr);
-  base::RecursiveMutexGuard lock_guard(&async_wraps_mutex_);
+  v8_isolate_->SetPromiseHook(nullptr);
   async_wraps_.clear();
 }
 
@@ -118,28 +123,33 @@ async_id_t AsyncHooks::GetTriggerAsyncId() const {
 }
 
 Local<Object> AsyncHooks::CreateHook(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
-  EscapableHandleScope handle_scope(isolate);
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* v8_isolate = info.GetIsolate();
+  EscapableHandleScope handle_scope(v8_isolate);
 
-  Local<Context> currentContext = isolate->GetCurrentContext();
+  if (v8_isolate->IsExecutionTerminating()) {
+    return Local<Object>();
+  }
 
-  if (args.Length() != 1 || !args[0]->IsObject()) {
-    isolate->ThrowError("Invalid arguments passed to createHook");
+  Local<Context> currentContext = v8_isolate->GetCurrentContext();
+
+  if (info.Length() != 1 || !info[0]->IsObject()) {
+    v8_isolate->ThrowError("Invalid arguments passed to createHook");
     return Local<Object>();
   }
 
   std::shared_ptr<AsyncHooksWrap> wrap =
-      std::make_shared<AsyncHooksWrap>(isolate);
+      std::make_shared<AsyncHooksWrap>(v8_isolate);
 
-  Local<Object> fn_obj = args[0].As<Object>();
+  Local<Object> fn_obj = info[0].As<Object>();
 
-#define SET_HOOK_FN(name)                                                      \
-  MaybeLocal<Value> name##_maybe_func =                                        \
-      fn_obj->Get(currentContext, String::NewFromUtf8Literal(isolate, #name)); \
-  Local<Value> name##_func;                                                    \
-  if (name##_maybe_func.ToLocal(&name##_func) && name##_func->IsFunction()) {  \
-    wrap->set_##name##_function(name##_func.As<Function>());                   \
+#define SET_HOOK_FN(name)                                                     \
+  MaybeLocal<Value> name##_maybe_func = fn_obj->Get(                          \
+      currentContext, String::NewFromUtf8Literal(v8_isolate, #name));         \
+  Local<Value> name##_func;                                                   \
+  if (name##_maybe_func.ToLocal(&name##_func) && name##_func->IsFunction()) { \
+    wrap->set_##name##_function(name##_func.As<Function>());                  \
   }
 
   SET_HOOK_FN(init);
@@ -148,29 +158,29 @@ Local<Object> AsyncHooks::CreateHook(
   SET_HOOK_FN(promiseResolve);
 #undef SET_HOOK_FN
 
-  Local<Object> obj = async_hooks_templ.Get(isolate)
+  Local<Object> obj = async_hooks_templ.Get(v8_isolate)
                           ->NewInstance(currentContext)
                           .ToLocalChecked();
   i::Handle<i::Object> managed = i::Managed<AsyncHooksWrap>::FromSharedPtr(
-      reinterpret_cast<i::Isolate*>(isolate), sizeof(AsyncHooksWrap), wrap);
+      reinterpret_cast<i::Isolate*>(v8_isolate), sizeof(AsyncHooksWrap), wrap);
   obj->SetInternalField(0, Utils::ToLocal(managed));
 
-  {
-    base::RecursiveMutexGuard lock_guard(&async_wraps_mutex_);
-    async_wraps_.push_back(std::move(wrap));
-  }
+  async_wraps_.push_back(std::move(wrap));
 
   return handle_scope.Escape(obj);
 }
 
 void AsyncHooks::ShellPromiseHook(PromiseHookType type, Local<Promise> promise,
                                   Local<Value> parent) {
-  v8::Isolate* isolate = promise->GetIsolate();
-  if (isolate->IsExecutionTerminating()) return;
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
+  v8::Isolate* v8_isolate = promise->GetIsolate();
+  AsyncHooks* hooks = PerIsolateData::Get(v8_isolate)->GetAsyncHooks();
+  if (v8_isolate->IsExecutionTerminating() || hooks->skip_after_termination_) {
+    hooks->skip_after_termination_ = true;
+    return;
+  }
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
 
-  AsyncHooks* hooks = PerIsolateData::Get(isolate)->GetAsyncHooks();
-  HandleScope handle_scope(isolate);
+  HandleScope handle_scope(v8_isolate);
   // Temporarily clear any scheduled_exception to allow evaluating JS that can
   // throw.
   i::Handle<i::Object> scheduled_exception;
@@ -179,50 +189,52 @@ void AsyncHooks::ShellPromiseHook(PromiseHookType type, Local<Promise> promise,
     i_isolate->clear_scheduled_exception();
   }
   {
-    TryCatch try_catch(isolate);
+    TryCatch try_catch(v8_isolate);
     try_catch.SetVerbose(true);
 
-    Local<Context> currentContext = isolate->GetCurrentContext();
+    Local<Context> currentContext = v8_isolate->GetCurrentContext();
     DCHECK(!currentContext.IsEmpty());
 
     if (type == PromiseHookType::kInit) {
       ++hooks->current_async_id;
-      Local<Integer> async_id = Integer::New(isolate, hooks->current_async_id);
-      CHECK(
-          !promise
-               ->HasPrivate(currentContext, hooks->async_id_symbol.Get(isolate))
-               .ToChecked());
-      promise->SetPrivate(currentContext, hooks->async_id_symbol.Get(isolate),
-                          async_id);
+      Local<Integer> async_id =
+          Integer::New(v8_isolate, hooks->current_async_id);
+      CHECK(!promise
+                 ->HasPrivate(currentContext,
+                              hooks->async_id_symbol.Get(v8_isolate))
+                 .ToChecked());
+      promise->SetPrivate(currentContext,
+                          hooks->async_id_symbol.Get(v8_isolate), async_id);
 
       if (parent->IsPromise()) {
         Local<Promise> parent_promise = parent.As<Promise>();
         Local<Value> parent_async_id =
             parent_promise
                 ->GetPrivate(currentContext,
-                             hooks->async_id_symbol.Get(isolate))
+                             hooks->async_id_symbol.Get(v8_isolate))
                 .ToLocalChecked();
         promise->SetPrivate(currentContext,
-                            hooks->trigger_id_symbol.Get(isolate),
+                            hooks->trigger_id_symbol.Get(v8_isolate),
                             parent_async_id);
       } else {
         CHECK(parent->IsUndefined());
         promise->SetPrivate(currentContext,
-                            hooks->trigger_id_symbol.Get(isolate),
-                            Integer::New(isolate, 0));
+                            hooks->trigger_id_symbol.Get(v8_isolate),
+                            Integer::New(v8_isolate, 0));
       }
     } else if (type == PromiseHookType::kBefore) {
       AsyncContext ctx;
       ctx.execution_async_id =
           promise
-              ->GetPrivate(currentContext, hooks->async_id_symbol.Get(isolate))
+              ->GetPrivate(currentContext,
+                           hooks->async_id_symbol.Get(v8_isolate))
               .ToLocalChecked()
               .As<Integer>()
               ->Value();
       ctx.trigger_async_id =
           promise
               ->GetPrivate(currentContext,
-                           hooks->trigger_id_symbol.Get(isolate))
+                           hooks->trigger_id_symbol.Get(v8_isolate))
               .ToLocalChecked()
               .As<Integer>()
               ->Value();
@@ -231,12 +243,12 @@ void AsyncHooks::ShellPromiseHook(PromiseHookType type, Local<Promise> promise,
       hooks->asyncContexts.pop();
     }
     if (!i::StackLimitCheck{i_isolate}.HasOverflowed()) {
-      base::RecursiveMutexGuard lock_guard(&hooks->async_wraps_mutex_);
-      for (const auto& wrap : hooks->async_wraps_) {
+      for (size_t i = 0; i < hooks->async_wraps_.size(); ++i) {
+        std::shared_ptr<AsyncHooksWrap> wrap = hooks->async_wraps_[i];
         PromiseHookDispatch(type, promise, parent, *wrap, hooks);
         if (try_catch.HasCaught()) break;
       }
-      if (try_catch.HasCaught()) Shell::ReportException(isolate, &try_catch);
+      if (try_catch.HasCaught()) Shell::ReportException(v8_isolate, &try_catch);
     }
   }
   if (!scheduled_exception.is_null()) {
@@ -250,7 +262,7 @@ void AsyncHooks::PromiseHookDispatch(PromiseHookType type,
                                      const AsyncHooksWrap& wrap,
                                      AsyncHooks* hooks) {
   if (!wrap.IsEnabled()) return;
-  v8::Isolate* v8_isolate = hooks->isolate_;
+  v8::Isolate* v8_isolate = hooks->v8_isolate_;
   if (v8_isolate->IsExecutionTerminating()) return;
   HandleScope handle_scope(v8_isolate);
 
diff --git a/deps/v8/src/d8/async-hooks-wrapper.h b/deps/v8/src/d8/async-hooks-wrapper.h
index 3111c3033ace38..868e3949f3bf09 100644
--- a/deps/v8/src/d8/async-hooks-wrapper.h
+++ b/deps/v8/src/d8/async-hooks-wrapper.h
@@ -63,14 +63,13 @@ class AsyncHooks {
   async_id_t GetExecutionAsyncId() const;
   async_id_t GetTriggerAsyncId() const;
 
-  Local<Object> CreateHook(const v8::FunctionCallbackInfo<v8::Value>& args);
+  Local<Object> CreateHook(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   Persistent<FunctionTemplate> async_hook_ctor;
 
  private:
-  base::RecursiveMutex async_wraps_mutex_;
   std::vector<std::shared_ptr<AsyncHooksWrap>> async_wraps_;
-  Isolate* isolate_;
+  v8::Isolate* v8_isolate_;
   Persistent<ObjectTemplate> async_hooks_templ;
   Persistent<Private> async_id_symbol;
   Persistent<Private> trigger_id_symbol;
@@ -84,6 +83,9 @@ class AsyncHooks {
 
   std::stack<AsyncContext> asyncContexts;
   async_id_t current_async_id;
+  // We might end up in an invalid state after skipping steps due to
+  // terminations.
+  bool skip_after_termination_ = false;
 };
 
 }  // namespace v8
diff --git a/deps/v8/src/d8/cov.cc b/deps/v8/src/d8/cov.cc
index fc1d59e7cd2ae3..4f2aa79f38d6f2 100644
--- a/deps/v8/src/d8/cov.cc
+++ b/deps/v8/src/d8/cov.cc
@@ -71,8 +71,10 @@ extern "C" void __sanitizer_cov_trace_pc_guard_init(uint32_t* start,
 uint32_t sanitizer_cov_count_discovered_edges() {
   uint32_t on_edges_counter = 0;
   for (uint32_t i = 1; i < builtins_start; ++i) {
-    // TODO(ralbovsky): Can be optimized for fewer divisions.
-    if (shmem->edges[i / 8] & (1 << (i % 8))) {
+    const uint32_t byteIndex = i >> 3;  // Divide by 8 using a shift operation
+    const uint32_t bitIndex = i & 7;  // Modulo 8 using a bitwise AND operation
+
+    if (shmem->edges[byteIndex] & (1 << bitIndex)) {
       ++on_edges_counter;
     }
   }
@@ -114,9 +116,10 @@ void cov_update_builtins_basic_block_coverage(
   }
   for (uint32_t i = 0; i < cov_map.size(); ++i) {
     if (cov_map[i]) {
-      // TODO(ralbovsky): Can be optimized for fewer divisions.
-      shmem->edges[(i + builtins_start) / 8] |=
-          (1 << ((i + builtins_start) % 8));
+      const uint32_t byteIndex = (i + builtins_start) >> 3;
+      const uint32_t bitIndex = (i + builtins_start) & 7;
+
+      shmem->edges[byteIndex] |= (1 << bitIndex);
     }
   }
 }
diff --git a/deps/v8/src/d8/d8-platforms.cc b/deps/v8/src/d8/d8-platforms.cc
index 5cdd97d5499ebc..51c5d24912d3a7 100644
--- a/deps/v8/src/d8/d8-platforms.cc
+++ b/deps/v8/src/d8/d8-platforms.cc
@@ -48,7 +48,9 @@ class PredictablePlatform final : public Platform {
     return platform_->NumberOfWorkerThreads();
   }
 
-  void CallOnWorkerThread(std::unique_ptr<Task> task) override {
+  void PostTaskOnWorkerThreadImpl(TaskPriority priority,
+                                  std::unique_ptr<Task> task,
+                                  const SourceLocation& location) override {
     // We post worker tasks on the foreground task runner of the
     // {kProcessGlobalPredictablePlatformWorkerTaskQueue} isolate. The task
     // queue of the {kProcessGlobalPredictablePlatformWorkerTaskQueue} isolate
@@ -58,12 +60,15 @@ class PredictablePlatform final : public Platform {
     // background thread. The reason is that code is executed sequentially with
     // the PredictablePlatform, and that the {DefaultPlatform} does not access
     // the isolate but only uses it as the key in a HashMap.
-    GetForegroundTaskRunner(kProcessGlobalPredictablePlatformWorkerTaskQueue)
+    platform_
+        ->GetForegroundTaskRunner(
+            kProcessGlobalPredictablePlatformWorkerTaskQueue)
         ->PostTask(std::move(task));
   }
 
-  void CallDelayedOnWorkerThread(std::unique_ptr<Task> task,
-                                 double delay_in_seconds) override {
+  void PostDelayedTaskOnWorkerThreadImpl(
+      TaskPriority priority, std::unique_ptr<Task> task,
+      double delay_in_seconds, const SourceLocation& location) override {
     // Never run delayed tasks.
   }
 
diff --git a/deps/v8/src/d8/d8-posix.cc b/deps/v8/src/d8/d8-posix.cc
index c2571ef3a01898..6b53da110bde92 100644
--- a/deps/v8/src/d8/d8-posix.cc
+++ b/deps/v8/src/d8/d8-posix.cc
@@ -209,25 +209,25 @@ class ExecArgs {
 };
 
 // Gets the optional timeouts from the arguments to the system() call.
-static bool GetTimeouts(const v8::FunctionCallbackInfo<v8::Value>& args,
+static bool GetTimeouts(const v8::FunctionCallbackInfo<v8::Value>& info,
                         int* read_timeout, int* total_timeout) {
-  if (args.Length() > 3) {
-    if (args[3]->IsNumber()) {
-      *total_timeout = args[3]
-                           ->Int32Value(args.GetIsolate()->GetCurrentContext())
+  if (info.Length() > 3) {
+    if (info[3]->IsNumber()) {
+      *total_timeout = info[3]
+                           ->Int32Value(info.GetIsolate()->GetCurrentContext())
                            .FromJust();
     } else {
-      args.GetIsolate()->ThrowError("system: Argument 4 must be a number");
+      info.GetIsolate()->ThrowError("system: Argument 4 must be a number");
       return false;
     }
   }
-  if (args.Length() > 2) {
-    if (args[2]->IsNumber()) {
-      *read_timeout = args[2]
-                          ->Int32Value(args.GetIsolate()->GetCurrentContext())
+  if (info.Length() > 2) {
+    if (info[2]->IsNumber()) {
+      *read_timeout = info[2]
+                          ->Int32Value(info.GetIsolate()->GetCurrentContext())
                           .FromJust();
     } else {
-      args.GetIsolate()->ThrowError("system: Argument 3 must be a number");
+      info.GetIsolate()->ThrowError("system: Argument 3 must be a number");
       return false;
     }
   }
@@ -410,27 +410,28 @@ static bool WaitForChild(Isolate* isolate, int pid,
 #undef HAS_WAITID
 
 // Implementation of the system() function (see d8.h for details).
-void Shell::System(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  HandleScope scope(args.GetIsolate());
+void Shell::System(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  HandleScope scope(info.GetIsolate());
   int read_timeout = -1;
   int total_timeout = -1;
-  if (!GetTimeouts(args, &read_timeout, &total_timeout)) return;
+  if (!GetTimeouts(info, &read_timeout, &total_timeout)) return;
   Local<Array> command_args;
-  if (args.Length() > 1) {
-    if (!args[1]->IsArray()) {
-      args.GetIsolate()->ThrowError("system: Argument 2 must be an array");
+  if (info.Length() > 1) {
+    if (!info[1]->IsArray()) {
+      info.GetIsolate()->ThrowError("system: Argument 2 must be an array");
       return;
     }
-    command_args = args[1].As<Array>();
+    command_args = info[1].As<Array>();
   } else {
-    command_args = Array::New(args.GetIsolate(), 0);
+    command_args = Array::New(info.GetIsolate(), 0);
   }
   if (command_args->Length() > ExecArgs::kMaxArgs) {
-    args.GetIsolate()->ThrowError("Too many arguments to system()");
+    info.GetIsolate()->ThrowError("Too many arguments to system()");
     return;
   }
-  if (args.Length() < 1) {
-    args.GetIsolate()->ThrowError("Too few arguments to system()");
+  if (info.Length() < 1) {
+    info.GetIsolate()->ThrowError("Too few arguments to system()");
     return;
   }
 
@@ -438,18 +439,18 @@ void Shell::System(const v8::FunctionCallbackInfo<v8::Value>& args) {
   gettimeofday(&start_time, nullptr);
 
   ExecArgs exec_args;
-  if (!exec_args.Init(args.GetIsolate(), args[0], command_args)) {
+  if (!exec_args.Init(info.GetIsolate(), info[0], command_args)) {
     return;
   }
   int exec_error_fds[2];
   int stdout_fds[2];
 
   if (pipe(exec_error_fds) != 0) {
-    args.GetIsolate()->ThrowError("pipe syscall failed.");
+    info.GetIsolate()->ThrowError("pipe syscall failed.");
     return;
   }
   if (pipe(stdout_fds) != 0) {
-    args.GetIsolate()->ThrowError("pipe syscall failed.");
+    info.GetIsolate()->ThrowError("pipe syscall failed.");
     return;
   }
 
@@ -466,14 +467,14 @@ void Shell::System(const v8::FunctionCallbackInfo<v8::Value>& args) {
   OpenFDCloser error_read_closer(exec_error_fds[kReadFD]);
   OpenFDCloser stdout_read_closer(stdout_fds[kReadFD]);
 
-  Isolate* isolate = args.GetIsolate();
+  Isolate* isolate = info.GetIsolate();
   if (!ChildLaunchedOK(isolate, exec_error_fds)) return;
 
   Local<Value> accumulator = GetStdout(isolate, stdout_fds[kReadFD], start_time,
                                        read_timeout, total_timeout);
   if (accumulator->IsUndefined()) {
     kill(pid, SIGINT);  // On timeout, kill the subprocess.
-    args.GetReturnValue().Set(accumulator);
+    info.GetReturnValue().Set(accumulator);
     return;
   }
 
@@ -482,38 +483,40 @@ void Shell::System(const v8::FunctionCallbackInfo<v8::Value>& args) {
     return;
   }
 
-  args.GetReturnValue().Set(accumulator);
+  info.GetReturnValue().Set(accumulator);
 }
 
-void Shell::ChangeDirectory(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() != 1) {
-    args.GetIsolate()->ThrowError("chdir() takes one argument");
+void Shell::ChangeDirectory(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  if (info.Length() != 1) {
+    info.GetIsolate()->ThrowError("chdir() takes one argument");
     return;
   }
-  String::Utf8Value directory(args.GetIsolate(), args[0]);
+  String::Utf8Value directory(info.GetIsolate(), info[0]);
   if (*directory == nullptr) {
-    args.GetIsolate()->ThrowError(
+    info.GetIsolate()->ThrowError(
         "os.chdir(): String conversion of argument failed.");
     return;
   }
   if (chdir(*directory) != 0) {
-    args.GetIsolate()->ThrowError(v8_strerror(args.GetIsolate(), errno));
+    info.GetIsolate()->ThrowError(v8_strerror(info.GetIsolate(), errno));
     return;
   }
 }
 
-void Shell::SetUMask(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() != 1) {
-    args.GetIsolate()->ThrowError("umask() takes one argument");
+void Shell::SetUMask(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  if (info.Length() != 1) {
+    info.GetIsolate()->ThrowError("umask() takes one argument");
     return;
   }
-  if (args[0]->IsNumber()) {
+  if (info[0]->IsNumber()) {
     int previous = umask(
-        args[0]->Int32Value(args.GetIsolate()->GetCurrentContext()).FromJust());
-    args.GetReturnValue().Set(previous);
+        info[0]->Int32Value(info.GetIsolate()->GetCurrentContext()).FromJust());
+    info.GetReturnValue().Set(previous);
     return;
   } else {
-    args.GetIsolate()->ThrowError("umask() argument must be numeric");
+    info.GetIsolate()->ThrowError("umask() argument must be numeric");
     return;
   }
 }
@@ -559,72 +562,76 @@ static bool mkdirp(Isolate* isolate, char* directory, mode_t mask) {
   }
 }
 
-void Shell::MakeDirectory(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void Shell::MakeDirectory(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   mode_t mask = 0777;
-  if (args.Length() == 2) {
-    if (args[1]->IsNumber()) {
-      mask = args[1]
-                 ->Int32Value(args.GetIsolate()->GetCurrentContext())
+  if (info.Length() == 2) {
+    if (info[1]->IsNumber()) {
+      mask = info[1]
+                 ->Int32Value(info.GetIsolate()->GetCurrentContext())
                  .FromJust();
     } else {
-      args.GetIsolate()->ThrowError("mkdirp() second argument must be numeric");
+      info.GetIsolate()->ThrowError("mkdirp() second argument must be numeric");
       return;
     }
-  } else if (args.Length() != 1) {
-    args.GetIsolate()->ThrowError("mkdirp() takes one or two arguments");
+  } else if (info.Length() != 1) {
+    info.GetIsolate()->ThrowError("mkdirp() takes one or two arguments");
     return;
   }
-  String::Utf8Value directory(args.GetIsolate(), args[0]);
+  String::Utf8Value directory(info.GetIsolate(), info[0]);
   if (*directory == nullptr) {
-    args.GetIsolate()->ThrowError(
+    info.GetIsolate()->ThrowError(
         "os.mkdirp(): String conversion of argument failed.");
     return;
   }
-  mkdirp(args.GetIsolate(), *directory, mask);
+  mkdirp(info.GetIsolate(), *directory, mask);
 }
 
-void Shell::RemoveDirectory(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() != 1) {
-    args.GetIsolate()->ThrowError("rmdir() takes one or two arguments");
+void Shell::RemoveDirectory(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  if (info.Length() != 1) {
+    info.GetIsolate()->ThrowError("rmdir() takes one arguments");
     return;
   }
-  String::Utf8Value directory(args.GetIsolate(), args[0]);
+  String::Utf8Value directory(info.GetIsolate(), info[0]);
   if (*directory == nullptr) {
-    args.GetIsolate()->ThrowError(
+    info.GetIsolate()->ThrowError(
         "os.rmdir(): String conversion of argument failed.");
     return;
   }
   rmdir(*directory);
 }
 
-void Shell::SetEnvironment(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() != 2) {
-    args.GetIsolate()->ThrowError("setenv() takes two arguments");
+void Shell::SetEnvironment(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  if (info.Length() != 2) {
+    info.GetIsolate()->ThrowError("setenv() takes two arguments");
     return;
   }
-  String::Utf8Value var(args.GetIsolate(), args[0]);
-  String::Utf8Value value(args.GetIsolate(), args[1]);
+  String::Utf8Value var(info.GetIsolate(), info[0]);
+  String::Utf8Value value(info.GetIsolate(), info[1]);
   if (*var == nullptr) {
-    args.GetIsolate()->ThrowError(
+    info.GetIsolate()->ThrowError(
         "os.setenv(): String conversion of variable name failed.");
     return;
   }
   if (*value == nullptr) {
-    args.GetIsolate()->ThrowError(
+    info.GetIsolate()->ThrowError(
         "os.setenv(): String conversion of variable contents failed.");
     return;
   }
   setenv(*var, *value, 1);
 }
 
-void Shell::UnsetEnvironment(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() != 1) {
-    args.GetIsolate()->ThrowError("unsetenv() takes one argument");
+void Shell::UnsetEnvironment(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  if (info.Length() != 1) {
+    info.GetIsolate()->ThrowError("unsetenv() takes one argument");
     return;
   }
-  String::Utf8Value var(args.GetIsolate(), args[0]);
+  String::Utf8Value var(info.GetIsolate(), info[0]);
   if (*var == nullptr) {
-    args.GetIsolate()->ThrowError(
+    info.GetIsolate()->ThrowError(
         "os.setenv(): String conversion of variable name failed.");
     return;
   }
diff --git a/deps/v8/src/d8/d8-test.cc b/deps/v8/src/d8/d8-test.cc
index c7e790379ea952..ea17a52f8a50fe 100644
--- a/deps/v8/src/d8/d8-test.cc
+++ b/deps/v8/src/d8/d8-test.cc
@@ -16,12 +16,6 @@
 // The fast_c_api object also supports querying the number of fast/slow calls
 // and resetting these counters.
 
-// Make sure to sync the following with src/compiler/globals.h.
-#if defined(V8_TARGET_ARCH_X64) || defined(V8_TARGET_ARCH_ARM64) || \
-    defined(V8_TARGET_ARCH_MIPS64) || defined(V8_TARGET_ARCH_LOONG64)
-#define V8_ENABLE_FP_PARAMS_IN_C_LINKAGE
-#endif
-
 namespace v8 {
 namespace {
 
@@ -33,7 +27,7 @@ namespace {
 
 #define CHECK_SELF_OR_THROW()                                               \
   if (!self) {                                                              \
-    args.GetIsolate()->ThrowError(                                          \
+    info.GetIsolate()->ThrowError(                                          \
         "This method is not defined on objects inheriting from FastCAPI."); \
     return;                                                                 \
   }
@@ -42,6 +36,32 @@ class FastCApiObject {
  public:
   static FastCApiObject& instance();
 
+#ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
+  static AnyCType ThrowFallbackFastCallbackPatch(AnyCType receiver,
+                                                 AnyCType options) {
+    AnyCType ret;
+    ThrowFallbackFastCallback(receiver.object_value, *options.options_value);
+    return ret;
+  }
+
+#endif  //  V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
+  static void ThrowFallbackFastCallback(Local<Object> receiver,
+                                        FastApiCallbackOptions& options) {
+    FastCApiObject* self = UnwrapObject(receiver);
+    self->fast_call_count_++;
+    options.fallback = true;
+  }
+
+  static void ThrowFallbackSlowCallback(
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    FastCApiObject* self = UnwrapObject(info.This());
+    CHECK_SELF_OR_THROW();
+    self->slow_call_count_++;
+
+    info.GetIsolate()->ThrowError("Exception from fallback.");
+  }
+
 #ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
   static AnyCType CopyStringFastCallbackPatch(AnyCType receiver,
                                               AnyCType should_fallback,
@@ -74,8 +94,8 @@ class FastCApiObject {
     memcpy(memory, source.data, source.length);
   }
 
-  static void CopyStringSlowCallback(const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+  static void CopyStringSlowCallback(const FunctionCallbackInfo<Value>& info) {
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
   }
@@ -138,8 +158,8 @@ class FastCApiObject {
 
     // For Wasm call, we don't pass FastCApiObject as the receiver, so we need
     // to retrieve the FastCApiObject instance from a static variable.
-    if (Utils::OpenHandle(*receiver)->IsJSGlobalProxy() ||
-        Utils::OpenHandle(*receiver)->IsUndefined()) {
+    if (IsJSGlobalProxy(*Utils::OpenHandle(*receiver)) ||
+        IsUndefined(*Utils::OpenHandle(*receiver))) {
       // Note: FastCApiObject::instance() returns the reference of an object
       // allocated in thread-local storage, its value cannot be stored in a
       // static variable here.
@@ -157,40 +177,40 @@ class FastCApiObject {
            static_cast<double>(arg_f32) + arg_f64;
   }
 
-  static void AddAllSlowCallback(const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+  static void AddAllSlowCallback(const FunctionCallbackInfo<Value>& info) {
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
     HandleScope handle_scope(isolate);
 
     double sum = 0;
-    if (args.Length() > 1 && args[1]->IsNumber()) {
-      sum += args[1]->Int32Value(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 1 && info[1]->IsNumber()) {
+      sum += info[1]->Int32Value(isolate->GetCurrentContext()).FromJust();
     }
-    if (args.Length() > 2 && args[2]->IsNumber()) {
-      sum += args[2]->Uint32Value(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 2 && info[2]->IsNumber()) {
+      sum += info[2]->Uint32Value(isolate->GetCurrentContext()).FromJust();
     }
-    if (args.Length() > 3 && args[3]->IsNumber()) {
-      sum += args[3]->IntegerValue(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 3 && info[3]->IsNumber()) {
+      sum += info[3]->IntegerValue(isolate->GetCurrentContext()).FromJust();
     }
-    if (args.Length() > 4 && args[4]->IsNumber()) {
-      sum += args[4]->IntegerValue(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 4 && info[4]->IsNumber()) {
+      sum += info[4]->IntegerValue(isolate->GetCurrentContext()).FromJust();
     }
-    if (args.Length() > 5 && args[5]->IsNumber()) {
-      sum += args[5]->NumberValue(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 5 && info[5]->IsNumber()) {
+      sum += info[5]->NumberValue(isolate->GetCurrentContext()).FromJust();
     } else {
       sum += std::numeric_limits<double>::quiet_NaN();
     }
-    if (args.Length() > 6 && args[6]->IsNumber()) {
-      sum += args[6]->NumberValue(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 6 && info[6]->IsNumber()) {
+      sum += info[6]->NumberValue(isolate->GetCurrentContext()).FromJust();
     } else {
       sum += std::numeric_limits<double>::quiet_NaN();
     }
 
-    args.GetReturnValue().Set(Number::New(isolate, sum));
+    info.GetReturnValue().Set(Number::New(isolate, sum));
   }
 
 #ifdef V8_ENABLE_FP_PARAMS_IN_C_LINKAGE
@@ -254,35 +274,36 @@ class FastCApiObject {
     return sum;
   }
   static void AddAllSequenceSlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
 
     HandleScope handle_scope(isolate);
 
-    if (args.Length() < 2) {
+    if (info.Length() < 2) {
       self->slow_call_count_++;
       isolate->ThrowError("This method expects at least 2 arguments.");
       return;
     }
-    if (args[1]->IsTypedArray()) {
-      AddAllTypedArraySlowCallback(args);
+    if (info[1]->IsTypedArray()) {
+      AddAllTypedArraySlowCallback(info);
       return;
     }
     self->slow_call_count_++;
-    if (args[1]->IsUndefined()) {
+    if (info[1]->IsUndefined()) {
       Type dummy_result = 0;
-      args.GetReturnValue().Set(Number::New(isolate, dummy_result));
+      info.GetReturnValue().Set(Number::New(isolate, dummy_result));
       return;
     }
-    if (!args[1]->IsArray()) {
+    if (!info[1]->IsArray()) {
       isolate->ThrowError("This method expects an array as a second argument.");
       return;
     }
 
-    Local<Array> seq_arg = args[1].As<Array>();
+    Local<Array> seq_arg = info[1].As<Array>();
     uint32_t length = seq_arg->Length();
     if (length > 1024) {
       isolate->ThrowError(
@@ -313,45 +334,19 @@ class FastCApiObject {
         return;
       }
     }
-    args.GetReturnValue().Set(Number::New(isolate, sum));
+    info.GetReturnValue().Set(Number::New(isolate, sum));
   }
 #ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
   template <typename T>
-  static const FastApiTypedArray<T>* AnyCTypeToTypedArray(AnyCType arg);
-
-  template <>
-  const FastApiTypedArray<uint8_t>* AnyCTypeToTypedArray<uint8_t>(
-      AnyCType arg) {
-    return arg.uint8_ta_value;
-  }
-
-  template <>
-  const FastApiTypedArray<int32_t>* AnyCTypeToTypedArray<int32_t>(
-      AnyCType arg) {
-    return arg.int32_ta_value;
-  }
-  template <>
-  const FastApiTypedArray<uint32_t>* AnyCTypeToTypedArray<uint32_t>(
-      AnyCType arg) {
-    return arg.uint32_ta_value;
-  }
-  template <>
-  const FastApiTypedArray<int64_t>* AnyCTypeToTypedArray<int64_t>(
-      AnyCType arg) {
-    return arg.int64_ta_value;
-  }
-  template <>
-  const FastApiTypedArray<uint64_t>* AnyCTypeToTypedArray<uint64_t>(
-      AnyCType arg) {
-    return arg.uint64_ta_value;
-  }
-  template <>
-  const FastApiTypedArray<float>* AnyCTypeToTypedArray<float>(AnyCType arg) {
-    return arg.float_ta_value;
-  }
-  template <>
-  const FastApiTypedArray<double>* AnyCTypeToTypedArray<double>(AnyCType arg) {
-    return arg.double_ta_value;
+  static const FastApiTypedArray<T>* AnyCTypeToTypedArray(AnyCType arg) {
+    if constexpr (std::is_same_v<T, uint8_t>) return arg.uint8_ta_value;
+    if constexpr (std::is_same_v<T, int32_t>) return arg.int32_ta_value;
+    if constexpr (std::is_same_v<T, uint32_t>) return arg.uint32_ta_value;
+    if constexpr (std::is_same_v<T, int64_t>) return arg.int64_ta_value;
+    if constexpr (std::is_same_v<T, uint64_t>) return arg.uint64_ta_value;
+    if constexpr (std::is_same_v<T, float>) return arg.float_ta_value;
+    if constexpr (std::is_same_v<T, double>) return arg.double_ta_value;
+    UNREACHABLE();
   }
 
   template <typename T>
@@ -392,26 +387,27 @@ class FastCApiObject {
     return static_cast<Type>(sum);
   }
   static void AddAllTypedArraySlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
     HandleScope handle_scope(isolate);
 
-    if (args.Length() < 2) {
+    if (info.Length() < 2) {
       isolate->ThrowError("This method expects at least 2 arguments.");
       return;
     }
-    if (!args[1]->IsTypedArray()) {
+    if (!info[1]->IsTypedArray()) {
       isolate->ThrowError(
           "This method expects a TypedArray as a second argument.");
       return;
     }
 
-    Local<TypedArray> typed_array_arg = args[1].As<TypedArray>();
+    Local<TypedArray> typed_array_arg = info[1].As<TypedArray>();
     size_t length = typed_array_arg->Length();
 
     void* data = typed_array_arg->Buffer()->GetBackingStore()->Data();
@@ -433,7 +429,7 @@ class FastCApiObject {
           sum += static_cast<uint64_t*>(data)[i];
         }
       }
-      args.GetReturnValue().Set(Number::New(isolate, sum));
+      info.GetReturnValue().Set(Number::New(isolate, sum));
     } else if (typed_array_arg->IsFloat32Array() ||
                typed_array_arg->IsFloat64Array()) {
       double sum = 0;
@@ -444,7 +440,7 @@ class FastCApiObject {
           sum += static_cast<double*>(data)[i];
         }
       }
-      args.GetReturnValue().Set(Number::New(isolate, sum));
+      info.GetReturnValue().Set(Number::New(isolate, sum));
     } else {
       isolate->ThrowError("TypedArray type is not supported.");
       return;
@@ -487,24 +483,25 @@ class FastCApiObject {
 
     return arg_i32 + arg_u32;
   }
-  static void Add32BitIntSlowCallback(const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+  static void Add32BitIntSlowCallback(const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
     HandleScope handle_scope(isolate);
 
     double sum = 0;
-    if (args.Length() > 1 && args[1]->IsNumber()) {
-      sum += args[1]->Int32Value(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 1 && info[1]->IsNumber()) {
+      sum += info[1]->Int32Value(isolate->GetCurrentContext()).FromJust();
     }
-    if (args.Length() > 2 && args[2]->IsNumber()) {
-      sum += args[2]->Uint32Value(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 2 && info[2]->IsNumber()) {
+      sum += info[2]->Uint32Value(isolate->GetCurrentContext()).FromJust();
     }
 
-    args.GetReturnValue().Set(Number::New(isolate, sum));
+    info.GetReturnValue().Set(Number::New(isolate, sum));
   }
 
 #ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
@@ -592,10 +589,11 @@ class FastCApiObject {
                                             arg5_u32, 0, options);
   }
   static void AddAll32BitIntSlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
@@ -603,30 +601,30 @@ class FastCApiObject {
 
     Local<Context> context = isolate->GetCurrentContext();
     double sum = 0;
-    if (args.Length() > 1 && args[1]->IsNumber()) {
-      sum += args[1]->Int32Value(context).FromJust();
+    if (info.Length() > 1 && info[1]->IsNumber()) {
+      sum += info[1]->Int32Value(context).FromJust();
     }
-    if (args.Length() > 2 && args[2]->IsNumber()) {
-      sum += args[2]->Int32Value(context).FromJust();
+    if (info.Length() > 2 && info[2]->IsNumber()) {
+      sum += info[2]->Int32Value(context).FromJust();
     }
-    if (args.Length() > 3 && args[3]->IsNumber()) {
-      sum += args[3]->Int32Value(context).FromJust();
+    if (info.Length() > 3 && info[3]->IsNumber()) {
+      sum += info[3]->Int32Value(context).FromJust();
     }
-    if (args.Length() > 4 && args[4]->IsNumber()) {
-      sum += args[4]->Uint32Value(context).FromJust();
+    if (info.Length() > 4 && info[4]->IsNumber()) {
+      sum += info[4]->Uint32Value(context).FromJust();
     }
-    if (args.Length() > 5 && args[5]->IsNumber()) {
-      sum += args[5]->Uint32Value(context).FromJust();
+    if (info.Length() > 5 && info[5]->IsNumber()) {
+      sum += info[5]->Uint32Value(context).FromJust();
     }
-    if (args.Length() > 6 && args[6]->IsNumber()) {
-      sum += args[6]->Uint32Value(context).FromJust();
+    if (info.Length() > 6 && info[6]->IsNumber()) {
+      sum += info[6]->Uint32Value(context).FromJust();
     }
-    if (args.Length() > 7 && args[7]->IsNumber() && args[8]->IsNumber()) {
-      sum += args[7]->Uint32Value(context).FromJust();
-      sum += args[8]->Uint32Value(context).FromJust();
+    if (info.Length() > 7 && info[7]->IsNumber() && info[8]->IsNumber()) {
+      sum += info[7]->Uint32Value(context).FromJust();
+      sum += info[8]->Uint32Value(context).FromJust();
     }
 
-    args.GetReturnValue().Set(Number::New(isolate, sum));
+    info.GetReturnValue().Set(Number::New(isolate, sum));
   }
 
 #ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
@@ -663,30 +661,31 @@ class FastCApiObject {
   }
 
   static void AddAllAnnotateSlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
     HandleScope handle_scope(isolate);
 
     double sum = 0;
-    if (args.Length() > 1 && args[1]->IsNumber()) {
-      sum += args[1]->Int32Value(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 1 && info[1]->IsNumber()) {
+      sum += info[1]->Int32Value(isolate->GetCurrentContext()).FromJust();
     }
-    if (args.Length() > 2 && args[2]->IsNumber()) {
-      sum += args[2]->Uint32Value(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 2 && info[2]->IsNumber()) {
+      sum += info[2]->Uint32Value(isolate->GetCurrentContext()).FromJust();
     }
-    if (args.Length() > 3 && args[3]->IsNumber()) {
-      sum += args[3]->IntegerValue(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 3 && info[3]->IsNumber()) {
+      sum += info[3]->IntegerValue(isolate->GetCurrentContext()).FromJust();
     }
-    if (args.Length() > 4 && args[4]->IsNumber()) {
-      sum += args[4]->IntegerValue(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 4 && info[4]->IsNumber()) {
+      sum += info[4]->IntegerValue(isolate->GetCurrentContext()).FromJust();
     }
 
-    args.GetReturnValue().Set(Number::New(isolate, sum));
+    info.GetReturnValue().Set(Number::New(isolate, sum));
   }
 
 #ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
@@ -756,38 +755,39 @@ class FastCApiObject {
 
   template <typename IntegerT>
   static void EnforceRangeCompareSlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
     HandleScope handle_scope(isolate);
 
     if (i::v8_flags.fuzzing) {
-      args.GetReturnValue().Set(Boolean::New(isolate, false));
+      info.GetReturnValue().Set(false);
       return;
     }
     double real_arg = 0;
-    if (args.Length() > 1 && args[1]->IsNumber()) {
-      real_arg = args[1]->NumberValue(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 1 && info[1]->IsNumber()) {
+      real_arg = info[1]->NumberValue(isolate->GetCurrentContext()).FromJust();
     }
     bool in_range =
-        args[0]->IsBoolean() && args[0]->BooleanValue(isolate) &&
+        info[0]->IsBoolean() && info[0]->BooleanValue(isolate) &&
         !std::isnan(real_arg) &&
         real_arg <= static_cast<double>(std::numeric_limits<IntegerT>::max()) &&
         real_arg >= static_cast<double>(std::numeric_limits<IntegerT>::min());
     if (in_range) {
       IntegerT checked_arg = std::numeric_limits<IntegerT>::max();
-      if (args.Length() > 2 && args[2]->IsNumber()) {
+      if (info.Length() > 2 && info[2]->IsNumber()) {
         checked_arg =
-            args[2]->NumberValue(isolate->GetCurrentContext()).FromJust();
+            info[2]->NumberValue(isolate->GetCurrentContext()).FromJust();
       }
       CHECK_EQ(static_cast<IntegerT>(real_arg), checked_arg);
-      args.GetReturnValue().Set(Boolean::New(isolate, false));
+      info.GetReturnValue().Set(false);
     } else {
-      args.GetIsolate()->ThrowError("Argument out of range.");
+      info.GetIsolate()->ThrowError("Argument out of range.");
     }
   }
 
@@ -894,22 +894,23 @@ class FastCApiObject {
 
   template <typename IntegerT>
   static void ClampCompareSlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
     double real_arg = 0;
-    if (args.Length() > 1 && args[1]->IsNumber()) {
-      real_arg = args[1]->NumberValue(isolate->GetCurrentContext()).FromJust();
+    if (info.Length() > 1 && info[1]->IsNumber()) {
+      real_arg = info[1]->NumberValue(isolate->GetCurrentContext()).FromJust();
     }
     double checked_arg_dbl = std::numeric_limits<double>::max();
-    if (args.Length() > 2 && args[2]->IsNumber()) {
-      checked_arg_dbl = args[2].As<Number>()->Value();
+    if (info.Length() > 2 && info[2]->IsNumber()) {
+      checked_arg_dbl = info[2].As<Number>()->Value();
     }
-    bool in_range = args[0]->IsBoolean() && args[0]->BooleanValue(isolate) &&
+    bool in_range = info[0]->IsBoolean() && info[0]->BooleanValue(isolate) &&
                     IsInRange<IntegerT>(real_arg) &&
                     IsInRange<IntegerT>(checked_arg_dbl);
 
@@ -919,7 +920,7 @@ class FastCApiObject {
         checked_arg = static_cast<IntegerT>(checked_arg_dbl);
       }
       double result = ClampCompareCompute(in_range, real_arg, checked_arg);
-      args.GetReturnValue().Set(Number::New(isolate, result));
+      info.GetReturnValue().Set(Number::New(isolate, result));
     } else {
       IntegerT clamped = std::numeric_limits<IntegerT>::max();
       if (std::isnan(checked_arg_dbl) || std::isnan(real_arg)) {
@@ -937,7 +938,7 @@ class FastCApiObject {
         clamped = std::clamp(real_arg, static_cast<double>(lower_bound),
                              static_cast<double>(upper_bound));
       }
-      args.GetReturnValue().Set(Number::New(isolate, clamped));
+      info.GetReturnValue().Set(Number::New(isolate, clamped));
     }
   }
 
@@ -962,7 +963,7 @@ class FastCApiObject {
 
     internal::Isolate* i_isolate =
         internal::IsolateFromNeverReadOnlySpaceObject(
-            *reinterpret_cast<internal::Address*>(*object));
+            internal::ValueHelper::ValueAsAddress(*object));
     CHECK_NOT_NULL(i_isolate);
     Isolate* isolate = reinterpret_cast<Isolate*>(i_isolate);
     HandleScope handle_scope(isolate);
@@ -972,33 +973,34 @@ class FastCApiObject {
   }
 
   static void IsFastCApiObjectSlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
 
-    FastCApiObject* self = UnwrapObject(args.This());
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
     HandleScope handle_scope(isolate);
 
     bool result = false;
-    if (args.Length() < 2) {
-      args.GetIsolate()->ThrowError(
+    if (info.Length() < 2) {
+      info.GetIsolate()->ThrowError(
           "is_valid_api_object should be called with 2 arguments");
       return;
     }
-    if (args[1]->IsObject()) {
-      Local<Object> object = args[1].As<Object>();
+    if (info[1]->IsObject()) {
+      Local<Object> object = info[1].As<Object>();
       if (!IsValidApiObject(object)) {
         result = false;
       } else {
-        result = PerIsolateData::Get(args.GetIsolate())
+        result = PerIsolateData::Get(info.GetIsolate())
                      ->GetTestApiObjectCtor()
                      ->IsLeafTemplateForApiObject(object);
       }
     }
 
-    args.GetReturnValue().Set(Boolean::New(isolate, result));
+    info.GetReturnValue().Set(result);
   }
 
   static bool TestWasmMemoryFastCallback(Local<Object> receiver,
@@ -1021,22 +1023,24 @@ class FastCApiObject {
   }
 
   static void TestWasmMemorySlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
-    args.GetIsolate()->ThrowError("should be unreachable from wasm");
+    info.GetIsolate()->ThrowError("should be unreachable from wasm");
   }
 
-  static void AssertIsExternal(const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+  static void AssertIsExternal(const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
 
-    Local<Value> value = args[0];
+    Local<Value> value = info[0];
 
     if (!value->IsExternal()) {
-      args.GetIsolate()->ThrowError("Did not get an external.");
+      info.GetIsolate()->ThrowError("Did not get an external.");
     }
   }
 
@@ -1049,13 +1053,14 @@ class FastCApiObject {
     return static_cast<void*>(self);
   }
 
-  static void GetPointerSlowCallback(const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
-    FastCApiObject* self = UnwrapObject(args.This());
+  static void GetPointerSlowCallback(const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
-    args.GetReturnValue().Set(External::New(isolate, static_cast<void*>(self)));
+    info.GetReturnValue().Set(External::New(isolate, static_cast<void*>(self)));
   }
 
   static void* GetNullPointerFastCallback(Local<Object> receiver,
@@ -1068,13 +1073,14 @@ class FastCApiObject {
   }
 
   static void GetNullPointerSlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    Isolate* isolate = args.GetIsolate();
-    FastCApiObject* self = UnwrapObject(args.This());
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
-    args.GetReturnValue().Set(v8::Null(isolate));
+    info.GetReturnValue().Set(v8::Null(isolate));
   }
 
   static void* PassPointerFastCallback(Local<Object> receiver, void* pointer,
@@ -1086,31 +1092,32 @@ class FastCApiObject {
     return pointer;
   }
 
-  static void PassPointerSlowCallback(const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+  static void PassPointerSlowCallback(const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
-    if (args.Length() != 1) {
-      args.GetIsolate()->ThrowError(
+    if (info.Length() != 1) {
+      info.GetIsolate()->ThrowError(
           "Invalid number of arguments, expected one.");
       return;
     }
 
-    Local<Value> maybe_external = args[0].As<Value>();
+    Local<Value> maybe_external = info[0].As<Value>();
 
     if (maybe_external->IsNull()) {
-      args.GetReturnValue().Set(maybe_external);
+      info.GetReturnValue().Set(maybe_external);
       return;
     }
     if (!maybe_external->IsExternal()) {
-      args.GetIsolate()->ThrowError("Did not get an external.");
+      info.GetIsolate()->ThrowError("Did not get an external.");
       return;
     }
 
-    Local<External> external = args[0].As<External>();
+    Local<External> external = info[0].As<External>();
 
-    args.GetReturnValue().Set(external);
+    info.GetReturnValue().Set(external);
   }
 
   static bool ComparePointersFastCallback(Local<Object> receiver,
@@ -1124,19 +1131,20 @@ class FastCApiObject {
   }
 
   static void ComparePointersSlowCallback(
-      const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+      const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->slow_call_count_++;
 
-    if (args.Length() != 2) {
-      args.GetIsolate()->ThrowError(
+    if (info.Length() != 2) {
+      info.GetIsolate()->ThrowError(
           "Invalid number of arguments, expected two.");
       return;
     }
 
-    Local<Value> value_a = args[0];
-    Local<Value> value_b = args[1];
+    Local<Value> value_a = info[0];
+    Local<Value> value_b = info[1];
 
     void* pointer_a;
     if (value_a->IsNull()) {
@@ -1144,7 +1152,7 @@ class FastCApiObject {
     } else if (value_a->IsExternal()) {
       pointer_a = value_a.As<External>()->Value();
     } else {
-      args.GetIsolate()->ThrowError(
+      info.GetIsolate()->ThrowError(
           "Did not get an external as first parameter.");
       return;
     }
@@ -1155,36 +1163,218 @@ class FastCApiObject {
     } else if (value_b->IsExternal()) {
       pointer_b = value_b.As<External>()->Value();
     } else {
-      args.GetIsolate()->ThrowError(
+      info.GetIsolate()->ThrowError(
           "Did not get an external as second parameter.");
       return;
     }
 
-    args.GetReturnValue().Set(pointer_a == pointer_b);
+    info.GetReturnValue().Set(pointer_a == pointer_b);
+  }
+
+  static int64_t sumInt64FastCallback(Local<Object> receiver, int64_t a,
+                                      int64_t b,
+                                      FastApiCallbackOptions& options) {
+    FastCApiObject* self = UnwrapObject(receiver);
+    CHECK_SELF_OR_FALLBACK(0);
+    self->fast_call_count_++;
+
+    return a + b;
+  }
+
+  template <typename T>
+  static bool Convert(double value, T* out_result) {
+    if (!IsInRange<T>(value)) return false;
+    *out_result = static_cast<T>(value);
+    return true;
+  }
+
+  static void sumInt64AsNumberSlowCallback(
+      const FunctionCallbackInfo<Value>& info) {
+    Isolate* isolate = info.GetIsolate();
+    FastCApiObject* self = UnwrapObject(info.This());
+    CHECK_SELF_OR_THROW();
+    self->slow_call_count_++;
+
+    if (info.Length() != 2) {
+      info.GetIsolate()->ThrowError(
+          "Invalid number of arguments, expected two.");
+      return;
+    }
+
+    Local<Value> value_a = info[0];
+    Local<Value> value_b = info[1];
+
+    if (!value_a->IsNumber()) {
+      info.GetIsolate()->ThrowError("Did not get a number as first parameter.");
+      return;
+    }
+    int64_t a;
+    if (!Convert(value_a.As<Number>()->Value(), &a)) {
+      info.GetIsolate()->ThrowError("First number is out of int64_t range.");
+      return;
+    }
+
+    if (!value_b->IsNumber()) {
+      info.GetIsolate()->ThrowError(
+          "Did not get a number as second parameter.");
+      return;
+    }
+    int64_t b;
+    if (!Convert(value_b.As<Number>()->Value(), &b)) {
+      info.GetIsolate()->ThrowError("Second number is out of int64_t range.");
+      return;
+    }
+
+    info.GetReturnValue().Set(Number::New(isolate, static_cast<double>(a + b)));
+  }
+
+  static void sumInt64AsBigIntSlowCallback(
+      const FunctionCallbackInfo<Value>& info) {
+    Isolate* isolate = info.GetIsolate();
+    FastCApiObject* self = UnwrapObject(info.This());
+    CHECK_SELF_OR_THROW();
+    self->slow_call_count_++;
+
+    if (info.Length() != 2) {
+      info.GetIsolate()->ThrowError(
+          "Invalid number of arguments, expected two.");
+      return;
+    }
+
+    Local<Value> value_a = info[0];
+    Local<Value> value_b = info[1];
+
+    int64_t a;
+    if (value_a->IsBigInt()) {
+      a = static_cast<int64_t>(value_a.As<BigInt>()->Int64Value());
+    } else {
+      info.GetIsolate()->ThrowError("Did not get a BigInt as first parameter.");
+      return;
+    }
+
+    int64_t b;
+    if (value_b->IsBigInt()) {
+      b = static_cast<int64_t>(value_b.As<BigInt>()->Int64Value());
+    } else {
+      info.GetIsolate()->ThrowError(
+          "Did not get a BigInt as second parameter.");
+      return;
+    }
+
+    info.GetReturnValue().Set(BigInt::New(isolate, a + b));
+  }
+
+  static uint64_t sumUint64FastCallback(Local<Object> receiver, uint64_t a,
+                                        uint64_t b,
+                                        FastApiCallbackOptions& options) {
+    FastCApiObject* self = UnwrapObject(receiver);
+    CHECK_SELF_OR_FALLBACK(0);
+    self->fast_call_count_++;
+
+    return a + b;
+  }
+
+  static void sumUint64AsNumberSlowCallback(
+      const FunctionCallbackInfo<Value>& info) {
+    Isolate* isolate = info.GetIsolate();
+    FastCApiObject* self = UnwrapObject(info.This());
+    CHECK_SELF_OR_THROW();
+    self->slow_call_count_++;
+
+    if (info.Length() != 2) {
+      info.GetIsolate()->ThrowError(
+          "Invalid number of arguments, expected two.");
+      return;
+    }
+
+    Local<Value> value_a = info[0];
+    Local<Value> value_b = info[1];
+
+    if (!value_a->IsNumber()) {
+      info.GetIsolate()->ThrowError("Did not get a number as first parameter.");
+      return;
+    }
+    uint64_t a;
+    if (!Convert(value_a.As<Number>()->Value(), &a)) {
+      info.GetIsolate()->ThrowError("First number is out of uint64_t range.");
+      return;
+    }
+
+    if (!value_b->IsNumber()) {
+      info.GetIsolate()->ThrowError(
+          "Did not get a number as second parameter.");
+      return;
+    }
+    uint64_t b;
+    if (!Convert(value_b.As<Number>()->Value(), &b)) {
+      info.GetIsolate()->ThrowError("Second number is out of uint64_t range.");
+      return;
+    }
+
+    info.GetReturnValue().Set(Number::New(isolate, static_cast<double>(a + b)));
+  }
+
+  static void sumUint64AsBigIntSlowCallback(
+      const FunctionCallbackInfo<Value>& info) {
+    Isolate* isolate = info.GetIsolate();
+    FastCApiObject* self = UnwrapObject(info.This());
+    CHECK_SELF_OR_THROW();
+    self->slow_call_count_++;
+
+    if (info.Length() != 2) {
+      info.GetIsolate()->ThrowError(
+          "Invalid number of arguments, expected two.");
+      return;
+    }
+
+    Local<Value> value_a = info[0];
+    Local<Value> value_b = info[1];
+
+    uint64_t a;
+    if (value_a->IsBigInt()) {
+      a = static_cast<uint64_t>(value_a.As<BigInt>()->Uint64Value());
+    } else {
+      info.GetIsolate()->ThrowError("Did not get a BigInt as first parameter.");
+      return;
+    }
+
+    uint64_t b;
+    if (value_b->IsBigInt()) {
+      b = static_cast<uint64_t>(value_b.As<BigInt>()->Uint64Value());
+    } else {
+      info.GetIsolate()->ThrowError(
+          "Did not get a BigInt as second parameter.");
+      return;
+    }
+
+    info.GetReturnValue().Set(BigInt::NewFromUnsigned(isolate, a + b));
   }
 
-  static void FastCallCount(const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+  static void FastCallCount(const FunctionCallbackInfo<Value>& info) {
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
-    args.GetReturnValue().Set(
-        Number::New(args.GetIsolate(), self->fast_call_count()));
+    info.GetReturnValue().Set(
+        Number::New(info.GetIsolate(), self->fast_call_count()));
   }
-  static void SlowCallCount(const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+  static void SlowCallCount(const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
-    args.GetReturnValue().Set(
-        Number::New(args.GetIsolate(), self->slow_call_count()));
+    info.GetReturnValue().Set(
+        Number::New(info.GetIsolate(), self->slow_call_count()));
   }
-  static void ResetCounts(const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+  static void ResetCounts(const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
     self->reset_counts();
-    args.GetReturnValue().Set(Undefined(args.GetIsolate()));
+    info.GetReturnValue().Set(Undefined(info.GetIsolate()));
   }
-  static void SupportsFPParams(const FunctionCallbackInfo<Value>& args) {
-    FastCApiObject* self = UnwrapObject(args.This());
+  static void SupportsFPParams(const FunctionCallbackInfo<Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    FastCApiObject* self = UnwrapObject(info.This());
     CHECK_SELF_OR_THROW();
-    args.GetReturnValue().Set(self->supports_fp_params_);
+    info.GetReturnValue().Set(self->supports_fp_params_);
   }
 
   int fast_call_count() const { return fast_call_count_; }
@@ -1198,8 +1388,8 @@ class FastCApiObject {
 
  private:
   static bool IsValidApiObject(Local<Object> object) {
-    i::Address addr = *reinterpret_cast<i::Address*>(*object);
-    auto instance_type = i::Internals::GetInstanceType(addr);
+    auto instance_type = i::Internals::GetInstanceType(
+        internal::ValueHelper::ValueAsAddress(*object));
     return (base::IsInRange(instance_type, i::Internals::kFirstJSApiObjectType,
                             i::Internals::kLastJSApiObjectType) ||
             instance_type == i::Internals::kJSSpecialApiObjectType);
@@ -1233,6 +1423,7 @@ thread_local FastCApiObject kFastCApiObject;
 FastCApiObject& FastCApiObject::instance() { return kFastCApiObject; }
 
 void CreateFastCAPIObject(const FunctionCallbackInfo<Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   if (!info.IsConstructCall()) {
     info.GetIsolate()->ThrowError(
         "FastCAPI helper must be constructed with new.");
@@ -1255,6 +1446,16 @@ Local<FunctionTemplate> Shell::CreateTestFastCApiTemplate(Isolate* isolate) {
   PerIsolateData::Get(isolate)->SetTestApiObjectCtor(api_obj_ctor);
   Local<Signature> signature = Signature::New(isolate, api_obj_ctor);
   {
+    CFunction throw_fallback_func = CFunction::Make(
+        FastCApiObject::ThrowFallbackFastCallback V8_IF_USE_SIMULATOR(
+            FastCApiObject::ThrowFallbackFastCallbackPatch));
+    api_obj_ctor->PrototypeTemplate()->Set(
+        isolate, "throw_fallback",
+        FunctionTemplate::New(
+            isolate, FastCApiObject::ThrowFallbackSlowCallback, Local<Value>(),
+            signature, 1, ConstructorBehavior::kThrow,
+            SideEffectType::kHasSideEffect, &throw_fallback_func));
+
     CFunction copy_str_func = CFunction::Make(
         FastCApiObject::CopyStringFastCallback V8_IF_USE_SIMULATOR(
             FastCApiObject::CopyStringFastCallbackPatch));
@@ -1637,6 +1838,42 @@ Local<FunctionTemplate> Shell::CreateTestFastCApiTemplate(Isolate* isolate) {
             isolate, FastCApiObject::ComparePointersSlowCallback,
             Local<Value>(), signature, 1, ConstructorBehavior::kThrow,
             SideEffectType::kHasSideEffect, &compare_pointers_c_func));
+    CFunction sum_int64_as_number_c_func =
+        CFunctionBuilder().Fn(FastCApiObject::sumInt64FastCallback).Build();
+    api_obj_ctor->PrototypeTemplate()->Set(
+        isolate, "sum_int64_as_number",
+        FunctionTemplate::New(
+            isolate, FastCApiObject::sumInt64AsNumberSlowCallback,
+            Local<Value>(), signature, 1, ConstructorBehavior::kThrow,
+            SideEffectType::kHasSideEffect, &sum_int64_as_number_c_func));
+    CFunction sum_int64_as_bigint_c_func =
+        CFunctionBuilder()
+            .Fn(FastCApiObject::sumInt64FastCallback)
+            .Build<CFunctionInfo::Int64Representation::kBigInt>();
+    api_obj_ctor->PrototypeTemplate()->Set(
+        isolate, "sum_int64_as_bigint",
+        FunctionTemplate::New(
+            isolate, FastCApiObject::sumInt64AsBigIntSlowCallback,
+            Local<Value>(), signature, 1, ConstructorBehavior::kThrow,
+            SideEffectType::kHasSideEffect, &sum_int64_as_bigint_c_func));
+    CFunction sum_uint64_as_number_c_func =
+        CFunctionBuilder().Fn(FastCApiObject::sumUint64FastCallback).Build();
+    api_obj_ctor->PrototypeTemplate()->Set(
+        isolate, "sum_uint64_as_number",
+        FunctionTemplate::New(
+            isolate, FastCApiObject::sumUint64AsNumberSlowCallback,
+            Local<Value>(), signature, 1, ConstructorBehavior::kThrow,
+            SideEffectType::kHasSideEffect, &sum_uint64_as_number_c_func));
+    CFunction sum_uint64_as_bigint_c_func =
+        CFunctionBuilder()
+            .Fn(FastCApiObject::sumUint64FastCallback)
+            .Build<CFunctionInfo::Int64Representation::kBigInt>();
+    api_obj_ctor->PrototypeTemplate()->Set(
+        isolate, "sum_uint64_as_bigint",
+        FunctionTemplate::New(
+            isolate, FastCApiObject::sumUint64AsBigIntSlowCallback,
+            Local<Value>(), signature, 1, ConstructorBehavior::kThrow,
+            SideEffectType::kHasSideEffect, &sum_uint64_as_bigint_c_func));
 
     api_obj_ctor->PrototypeTemplate()->Set(
         isolate, "fast_call_count",
diff --git a/deps/v8/src/d8/d8.cc b/deps/v8/src/d8/d8.cc
index 6a31685e467728..072f9b276dcbd3 100644
--- a/deps/v8/src/d8/d8.cc
+++ b/deps/v8/src/d8/d8.cc
@@ -18,8 +18,6 @@
 #include <utility>
 #include <vector>
 
-#include "v8-isolate.h"
-
 #ifdef ENABLE_VTUNE_JIT_INTERFACE
 #include "src/third_party/vtune/v8-vtune.h"
 #endif
@@ -29,6 +27,7 @@
 #include "include/v8-function.h"
 #include "include/v8-initialization.h"
 #include "include/v8-inspector.h"
+#include "include/v8-isolate.h"
 #include "include/v8-json.h"
 #include "include/v8-locker.h"
 #include "include/v8-profiler.h"
@@ -43,6 +42,7 @@
 #include "src/base/sanitizer/msan.h"
 #include "src/base/sys-info.h"
 #include "src/base/utils/random-number-generator.h"
+#include "src/compiler-dispatcher/optimizing-compile-dispatcher.h"
 #include "src/d8/d8-console.h"
 #include "src/d8/d8-platforms.h"
 #include "src/d8/d8.h"
@@ -54,7 +54,7 @@
 #include "src/execution/vm-state-inl.h"
 #include "src/flags/flags.h"
 #include "src/handles/maybe-handles.h"
-#include "src/heap/parked-scope.h"
+#include "src/heap/parked-scope-inl.h"
 #include "src/init/v8.h"
 #include "src/interpreter/interpreter.h"
 #include "src/logging/counters.h"
@@ -72,6 +72,15 @@
 #include "src/utils/ostreams.h"
 #include "src/utils/utils.h"
 
+#ifdef V8_OS_DARWIN
+#include <mach/mach.h>
+#include <mach/task_policy.h>
+#endif
+
+#ifdef V8_ENABLE_MAGLEV
+#include "src/maglev/maglev-concurrent-dispatcher.h"
+#endif  // V8_ENABLE_MAGLEV
+
 #if V8_OS_POSIX
 #include <signal.h>
 #endif  // V8_OS_POSIX
@@ -378,7 +387,7 @@ std::shared_ptr<Worker> GetWorkerFromInternalField(Isolate* isolate,
   }
 
   i::Handle<i::Object> handle = Utils::OpenHandle(*object->GetInternalField(0));
-  if (handle->IsSmi()) {
+  if (IsSmi(*handle)) {
     ThrowError(isolate, "Worker is defunct because main thread is terminating");
     return nullptr;
   }
@@ -401,6 +410,7 @@ namespace tracing {
 namespace {
 
 static constexpr char kIncludedCategoriesParam[] = "included_categories";
+static constexpr char kTraceConfigParam[] = "trace_config";
 
 class TraceConfigParser {
  public:
@@ -416,6 +426,13 @@ class TraceConfigParser {
         String::NewFromUtf8(isolate, json_str).ToLocalChecked();
     Local<Value> result = JSON::Parse(context, source).ToLocalChecked();
     Local<v8::Object> trace_config_object = result.As<v8::Object>();
+    // Try reading 'trace_config' property from a full chrome trace config.
+    // https://chromium.googlesource.com/chromium/src/+/master/docs/memory-infra/memory_infra_startup_tracing.md#the-advanced-way
+    Local<Value> maybe_trace_config_object =
+        GetValue(isolate, context, trace_config_object, kTraceConfigParam);
+    if (maybe_trace_config_object->IsObject()) {
+      trace_config_object = maybe_trace_config_object.As<Object>();
+    }
 
     UpdateIncludedCategoriesList(isolate, context, trace_config_object,
                                  trace_config);
@@ -489,7 +506,6 @@ std::unordered_set<std::shared_ptr<Worker>> Shell::running_workers_;
 std::atomic<bool> Shell::script_executed_{false};
 std::atomic<bool> Shell::valid_fuzz_script_{false};
 base::LazyMutex Shell::isolate_status_lock_;
-std::map<v8::Isolate*, bool> Shell::isolate_status_;
 std::map<v8::Isolate*, int> Shell::isolate_running_streaming_tasks_;
 base::LazyMutex Shell::cached_code_mutex_;
 std::map<std::string, std::unique_ptr<ScriptCompiler::CachedData>>
@@ -791,6 +807,56 @@ bool IsValidHostDefinedOptions(Local<Context> context, Local<Data> options,
   if (magic != kHostDefinedOptionsMagicConstant) return false;
   return array->Get(context, 1).As<String>()->StrictEquals(resource_name);
 }
+
+class D8WasmAsyncResolvePromiseTask : public v8::Task {
+ public:
+  D8WasmAsyncResolvePromiseTask(v8::Isolate* isolate,
+                                v8::Local<v8::Context> context,
+                                v8::Local<v8::Promise::Resolver> resolver,
+                                v8::Local<v8::Value> result,
+                                WasmAsyncSuccess success)
+      : isolate_(isolate),
+        context_(isolate, context),
+        resolver_(isolate, resolver),
+        result_(isolate, result),
+        success_(success) {}
+
+  void Run() override {
+    v8::HandleScope scope(isolate_);
+    v8::Local<v8::Context> context = context_.Get(isolate_);
+    MicrotasksScope microtasks_scope(context,
+                                     MicrotasksScope::kDoNotRunMicrotasks);
+    v8::Local<v8::Promise::Resolver> resolver = resolver_.Get(isolate_);
+    v8::Local<v8::Value> result = result_.Get(isolate_);
+
+    Maybe<bool> ret = success_ == WasmAsyncSuccess::kSuccess
+                          ? resolver->Resolve(context, result)
+                          : resolver->Reject(context, result);
+    // It's guaranteed that no exceptions will be thrown by these
+    // operations, but execution might be terminating.
+    CHECK(ret.IsJust() ? ret.FromJust() : isolate_->IsExecutionTerminating());
+  }
+
+ private:
+  v8::Isolate* isolate_;
+  v8::Global<v8::Context> context_;
+  v8::Global<v8::Promise::Resolver> resolver_;
+  v8::Global<v8::Value> result_;
+  WasmAsyncSuccess success_;
+};
+
+void D8WasmAsyncResolvePromiseCallback(
+    v8::Isolate* isolate, v8::Local<v8::Context> context,
+    v8::Local<v8::Promise::Resolver> resolver, v8::Local<v8::Value> result,
+    WasmAsyncSuccess success) {
+  // We have to resolve the promise in a separate task which is not a cancelable
+  // task, to avoid a deadlock when {quit()} is called in the then-handler of
+  // the result promise.
+  g_platform->GetForegroundTaskRunner(isolate)->PostTask(
+      std::make_unique<D8WasmAsyncResolvePromiseTask>(
+          isolate, context, resolver, result, success));
+}
+
 }  // namespace
 
 // Executes a string within the current v8 context.
@@ -883,7 +949,7 @@ bool Shell::ExecuteString(Isolate* isolate, Local<String> source,
     if (options.compile_only) return true;
     if (options.compile_options == ScriptCompiler::kConsumeCodeCache) {
       i::Handle<i::Script> i_script(
-          i::Script::cast(Utils::OpenHandle(*script)->shared().script()),
+          i::Script::cast(Utils::OpenHandle(*script)->shared()->script()),
           i_isolate);
       // TODO(cbruni, chromium:1244145): remove once context-allocated.
       i_script->set_host_defined_options(i::FixedArray::cast(
@@ -899,7 +965,7 @@ bool Shell::ExecuteString(Isolate* isolate, Local<String> source,
       delete cached_data;
     }
     if (process_message_queue) {
-      if (!EmptyMessageQueues(isolate)) success = false;
+      if (!CompleteMessageLoop(isolate)) success = false;
       if (!HandleUnhandledPromiseRejections(isolate)) success = false;
     }
     data->realm_current_ = data->realm_switch_;
@@ -1198,6 +1264,7 @@ struct ModuleResolutionData {
 
 void Shell::ModuleResolutionSuccessCallback(
     const FunctionCallbackInfo<Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   std::unique_ptr<ModuleResolutionData> module_resolution_data(
       static_cast<ModuleResolutionData*>(
           info.Data().As<v8::External>()->Value()));
@@ -1218,6 +1285,7 @@ void Shell::ModuleResolutionSuccessCallback(
 
 void Shell::ModuleResolutionFailureCallback(
     const FunctionCallbackInfo<Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   std::unique_ptr<ModuleResolutionData> module_resolution_data(
       static_cast<ModuleResolutionData*>(
           info.Data().As<v8::External>()->Value()));
@@ -1350,7 +1418,11 @@ void Shell::DoHostImportModuleDynamically(void* import_data) {
                               module_type)
                   .ToLocal(&root_module)) {
     CHECK(try_catch.HasCaught());
-    resolver->Reject(realm, try_catch.Exception()).ToChecked();
+    if (isolate->IsExecutionTerminating()) {
+      Shell::ReportException(isolate, &try_catch);
+    } else {
+      resolver->Reject(realm, try_catch.Exception()).ToChecked();
+    }
     return;
   }
 
@@ -1435,10 +1507,11 @@ bool Shell::ExecuteModule(Isolate* isolate, const char* file_name) {
 
   // Loop until module execution finishes
   Local<Promise> result_promise(result.As<Promise>());
-  while (result_promise->State() == Promise::kPending &&
-         reinterpret_cast<i::Isolate*>(isolate)
-                 ->default_microtask_queue()
-                 ->size() > 0) {
+  while (isolate->HasPendingBackgroundTasks() ||
+         (result_promise->State() == Promise::kPending &&
+          reinterpret_cast<i::Isolate*>(isolate)
+                  ->default_microtask_queue()
+                  ->size() > 0)) {
     Shell::CompleteMessageLoop(isolate);
   }
 
@@ -1655,16 +1728,16 @@ int PerIsolateData::RealmFind(Local<Context> context) {
 }
 
 int PerIsolateData::RealmIndexOrThrow(
-    const v8::FunctionCallbackInfo<v8::Value>& args, int arg_offset) {
-  if (args.Length() < arg_offset || !args[arg_offset]->IsNumber()) {
-    ThrowError(args.GetIsolate(), "Invalid argument");
+    const v8::FunctionCallbackInfo<v8::Value>& info, int arg_offset) {
+  if (info.Length() < arg_offset || !info[arg_offset]->IsNumber()) {
+    ThrowError(info.GetIsolate(), "Invalid argument");
     return -1;
   }
-  int index = args[arg_offset]
-                  ->Int32Value(args.GetIsolate()->GetCurrentContext())
+  int index = info[arg_offset]
+                  ->Int32Value(info.GetIsolate()->GetCurrentContext())
                   .FromMaybe(-1);
   if (index < 0 || index >= realm_count_ || realms_[index].IsEmpty()) {
-    ThrowError(args.GetIsolate(), "Invalid realm index");
+    ThrowError(info.GetIsolate(), "Invalid realm index");
     return -1;
   }
   return index;
@@ -1695,21 +1768,23 @@ uint64_t Shell::GetTracingTimestampFromPerformanceTimestamp(
 }
 
 // performance.now() returns GetTimestamp().
-void Shell::PerformanceNow(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().Set(GetTimestamp());
+void Shell::PerformanceNow(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(GetTimestamp());
 }
 
 // performance.mark() records and returns a PerformanceEntry with the current
 // timestamp.
-void Shell::PerformanceMark(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::PerformanceMark(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   Local<Context> context = isolate->GetCurrentContext();
 
-  if (args.Length() < 1 || !args[0]->IsString()) {
-    ThrowError(args.GetIsolate(), "Invalid 'name' argument");
+  if (info.Length() < 1 || !info[0]->IsString()) {
+    ThrowError(info.GetIsolate(), "Invalid 'name' argument");
     return;
   }
-  Local<String> name = args[0].As<String>();
+  Local<String> name = info[0].As<String>();
 
   double timestamp = GetTimestamp();
 
@@ -1734,27 +1809,28 @@ void Shell::PerformanceMark(const v8::FunctionCallbackInfo<v8::Value>& args) {
                           Integer::New(isolate, 0), ReadOnly)
       .Check();
 
-  args.GetReturnValue().Set(performance_entry);
+  info.GetReturnValue().Set(performance_entry);
 }
 
 // performance.measure() records and returns a PerformanceEntry with a duration
 // since a given mark, or since zero.
 void Shell::PerformanceMeasure(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   Local<Context> context = isolate->GetCurrentContext();
 
-  if (args.Length() < 1 || !args[0]->IsString()) {
-    ThrowError(args.GetIsolate(), "Invalid 'name' argument");
+  if (info.Length() < 1 || !info[0]->IsString()) {
+    ThrowError(info.GetIsolate(), "Invalid 'name' argument");
     return;
   }
-  v8::Local<String> name = args[0].As<String>();
+  v8::Local<String> name = info[0].As<String>();
 
   double start_timestamp = 0;
-  if (args.Length() >= 2) {
-    Local<Value> start_mark = args[1].As<Value>();
+  if (info.Length() >= 2) {
+    Local<Value> start_mark = info[1].As<Value>();
     if (!start_mark->IsObject()) {
-      ThrowError(args.GetIsolate(),
+      ThrowError(info.GetIsolate(),
                  "Invalid 'startMark' argument: Not an Object");
       return;
     }
@@ -1765,14 +1841,14 @@ void Shell::PerformanceMeasure(
       return;
     }
     if (!start_time_field->IsNumber()) {
-      ThrowError(args.GetIsolate(),
+      ThrowError(info.GetIsolate(),
                  "Invalid 'startMark' argument: No numeric 'startTime' field");
       return;
     }
     start_timestamp = start_time_field.As<Number>()->Value();
   }
-  if (args.Length() > 2) {
-    ThrowError(args.GetIsolate(), "Too many arguments");
+  if (info.Length() > 2) {
+    ThrowError(info.GetIsolate(), "Too many arguments");
     return;
   }
 
@@ -1813,18 +1889,19 @@ void Shell::PerformanceMeasure(
           Number::New(isolate, end_timestamp - start_timestamp), ReadOnly)
       .Check();
 
-  args.GetReturnValue().Set(performance_entry);
+  info.GetReturnValue().Set(performance_entry);
 }
 
 // performance.measureMemory() implements JavaScript Memory API proposal.
 // See https://github.com/ulan/javascript-agent-memory/blob/master/explainer.md.
 void Shell::PerformanceMeasureMemory(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   v8::MeasureMemoryMode mode = v8::MeasureMemoryMode::kSummary;
-  v8::Isolate* isolate = args.GetIsolate();
+  v8::Isolate* isolate = info.GetIsolate();
   Local<Context> context = isolate->GetCurrentContext();
-  if (args.Length() >= 1 && args[0]->IsObject()) {
-    Local<Object> object = args[0].As<Object>();
+  if (info.Length() >= 1 && info[0]->IsObject()) {
+    Local<Object> object = info[0].As<Object>();
     Local<Value> value = TryGetValue(isolate, context, object, "detailed")
                              .FromMaybe(Local<Value>());
     if (value.IsEmpty()) {
@@ -1837,52 +1914,55 @@ void Shell::PerformanceMeasureMemory(
   }
   Local<v8::Promise::Resolver> promise_resolver =
       v8::Promise::Resolver::New(context).ToLocalChecked();
-  args.GetIsolate()->MeasureMemory(
+  info.GetIsolate()->MeasureMemory(
       v8::MeasureMemoryDelegate::Default(isolate, context, promise_resolver,
                                          mode),
       v8::MeasureMemoryExecution::kEager);
-  args.GetReturnValue().Set(promise_resolver->GetPromise());
+  info.GetReturnValue().Set(promise_resolver->GetPromise());
 }
 
 // Realm.current() returns the index of the currently active realm.
-void Shell::RealmCurrent(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::RealmCurrent(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
   int index = data->RealmFind(isolate->GetEnteredOrMicrotaskContext());
   if (index == -1) return;
-  args.GetReturnValue().Set(index);
+  info.GetReturnValue().Set(index);
 }
 
 // Realm.owner(o) returns the index of the realm that created o.
-void Shell::RealmOwner(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::RealmOwner(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
-  if (args.Length() < 1 || !args[0]->IsObject()) {
-    ThrowError(args.GetIsolate(), "Invalid argument");
+  if (info.Length() < 1 || !info[0]->IsObject()) {
+    ThrowError(info.GetIsolate(), "Invalid argument");
     return;
   }
   Local<Object> object =
-      args[0]->ToObject(isolate->GetCurrentContext()).ToLocalChecked();
+      info[0]->ToObject(isolate->GetCurrentContext()).ToLocalChecked();
   i::Handle<i::JSReceiver> i_object = Utils::OpenHandle(*object);
-  if (i_object->IsJSGlobalProxy() &&
+  if (IsJSGlobalProxy(*i_object) &&
       i::Handle<i::JSGlobalProxy>::cast(i_object)->IsDetached()) {
     return;
   }
   Local<Context> creation_context;
   if (!object->GetCreationContext().ToLocal(&creation_context)) {
-    ThrowError(args.GetIsolate(), "object doesn't have creation context");
+    ThrowError(info.GetIsolate(), "object doesn't have creation context");
     return;
   }
   int index = data->RealmFind(creation_context);
   if (index == -1) return;
-  args.GetReturnValue().Set(index);
+  info.GetReturnValue().Set(index);
 }
 
 // Realm.global(i) returns the global object of realm i.
 // (Note that properties of global objects cannot be read/written cross-realm.)
-void Shell::RealmGlobal(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  PerIsolateData* data = PerIsolateData::Get(args.GetIsolate());
-  int index = data->RealmIndexOrThrow(args, 0);
+void Shell::RealmGlobal(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  PerIsolateData* data = PerIsolateData::Get(info.GetIsolate());
+  int index = data->RealmIndexOrThrow(info, 0);
   if (index == -1) return;
   // TODO(chromium:324812): Ideally Context::Global should never return raw
   // global objects but return a global proxy. Currently it returns global
@@ -1890,23 +1970,24 @@ void Shell::RealmGlobal(const v8::FunctionCallbackInfo<v8::Value>& args) {
   // following is a workaround till we fix Context::Global so we don't leak
   // global objects.
   Local<Object> global =
-      Local<Context>::New(args.GetIsolate(), data->realms_[index])->Global();
+      Local<Context>::New(info.GetIsolate(), data->realms_[index])->Global();
   i::Handle<i::Object> i_global = Utils::OpenHandle(*global);
-  if (i_global->IsJSGlobalObject()) {
-    i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(args.GetIsolate());
+  if (IsJSGlobalObject(*i_global)) {
+    i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
     i::Handle<i::JSObject> i_global_proxy =
         handle(i::Handle<i::JSGlobalObject>::cast(i_global)->global_proxy(),
                i_isolate);
     global = Utils::ToLocal(i_global_proxy);
   }
-  args.GetReturnValue().Set(global);
+  info.GetReturnValue().Set(global);
 }
 
 MaybeLocal<Context> Shell::CreateRealm(
-    const v8::FunctionCallbackInfo<v8::Value>& args, int index,
+    const v8::FunctionCallbackInfo<v8::Value>& info, int index,
     v8::MaybeLocal<Value> global_object) {
+  DCHECK(i::ValidateCallbackInfo(info));
   const char* kGlobalHandleLabel = "d8::realm";
-  Isolate* isolate = args.GetIsolate();
+  Isolate* isolate = info.GetIsolate();
   TryCatch try_catch(isolate);
   PerIsolateData* data = PerIsolateData::Get(isolate);
   if (index < 0) {
@@ -1931,13 +2012,14 @@ MaybeLocal<Context> Shell::CreateRealm(
   InitializeModuleEmbedderData(context);
   data->realms_[index].Reset(isolate, context);
   data->realms_[index].AnnotateStrongRetainer(kGlobalHandleLabel);
-  args.GetReturnValue().Set(index);
+  info.GetReturnValue().Set(index);
   return context;
 }
 
-void Shell::DisposeRealm(const v8::FunctionCallbackInfo<v8::Value>& args,
+void Shell::DisposeRealm(const v8::FunctionCallbackInfo<v8::Value>& info,
                          int index) {
-  Isolate* isolate = args.GetIsolate();
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
   Local<Context> context = data->realms_[index].Get(isolate);
   data->realms_[index].Reset();
@@ -1948,31 +2030,34 @@ void Shell::DisposeRealm(const v8::FunctionCallbackInfo<v8::Value>& args,
 
 // Realm.create() creates a new realm with a distinct security token
 // and returns its index.
-void Shell::RealmCreate(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  CreateRealm(args, -1, v8::MaybeLocal<Value>());
+void Shell::RealmCreate(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  CreateRealm(info, -1, v8::MaybeLocal<Value>());
 }
 
 // Realm.createAllowCrossRealmAccess() creates a new realm with the same
 // security token as the current realm.
 void Shell::RealmCreateAllowCrossRealmAccess(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   Local<Context> context;
-  if (CreateRealm(args, -1, v8::MaybeLocal<Value>()).ToLocal(&context)) {
+  if (CreateRealm(info, -1, v8::MaybeLocal<Value>()).ToLocal(&context)) {
     context->SetSecurityToken(
-        args.GetIsolate()->GetEnteredOrMicrotaskContext()->GetSecurityToken());
+        info.GetIsolate()->GetEnteredOrMicrotaskContext()->GetSecurityToken());
   }
 }
 
 // Realm.navigate(i) creates a new realm with a distinct security token
 // in place of realm i.
-void Shell::RealmNavigate(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::RealmNavigate(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
-  int index = data->RealmIndexOrThrow(args, 0);
+  int index = data->RealmIndexOrThrow(info, 0);
   if (index == -1) return;
   if (index == 0 || index == data->realm_current_ ||
       index == data->realm_switch_) {
-    ThrowError(args.GetIsolate(), "Invalid realm index");
+    ThrowError(info.GetIsolate(), "Invalid realm index");
     return;
   }
 
@@ -1983,25 +2068,25 @@ void Shell::RealmNavigate(const v8::FunctionCallbackInfo<v8::Value>& args) {
   // advance.
   if (!global_object.IsEmpty()) {
     HandleScope scope(isolate);
-    if (!Utils::OpenHandle(*global_object.ToLocalChecked())
-             ->IsJSGlobalProxy()) {
+    if (!IsJSGlobalProxy(*Utils::OpenHandle(*global_object.ToLocalChecked()))) {
       global_object = v8::MaybeLocal<Value>();
     }
   }
 
-  DisposeRealm(args, index);
-  CreateRealm(args, index, global_object);
+  DisposeRealm(info, index);
+  CreateRealm(info, index, global_object);
 }
 
 // Realm.detachGlobal(i) detaches the global objects of realm i from realm i.
-void Shell::RealmDetachGlobal(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::RealmDetachGlobal(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
-  int index = data->RealmIndexOrThrow(args, 0);
+  int index = data->RealmIndexOrThrow(info, 0);
   if (index == -1) return;
   if (index == 0 || index == data->realm_current_ ||
       index == data->realm_switch_) {
-    ThrowError(args.GetIsolate(), "Invalid realm index");
+    ThrowError(info.GetIsolate(), "Invalid realm index");
     return;
   }
 
@@ -2011,41 +2096,44 @@ void Shell::RealmDetachGlobal(const v8::FunctionCallbackInfo<v8::Value>& args) {
 }
 
 // Realm.dispose(i) disposes the reference to the realm i.
-void Shell::RealmDispose(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::RealmDispose(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
-  int index = data->RealmIndexOrThrow(args, 0);
+  int index = data->RealmIndexOrThrow(info, 0);
   if (index == -1) return;
   if (index == 0 || index == data->realm_current_ ||
       index == data->realm_switch_) {
-    ThrowError(args.GetIsolate(), "Invalid realm index");
+    ThrowError(info.GetIsolate(), "Invalid realm index");
     return;
   }
-  DisposeRealm(args, index);
+  DisposeRealm(info, index);
 }
 
 // Realm.switch(i) switches to the realm i for consecutive interactive inputs.
-void Shell::RealmSwitch(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::RealmSwitch(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
-  int index = data->RealmIndexOrThrow(args, 0);
+  int index = data->RealmIndexOrThrow(info, 0);
   if (index == -1) return;
   data->realm_switch_ = index;
 }
 
 // Realm.eval(i, s) evaluates s in realm i and returns the result.
-void Shell::RealmEval(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::RealmEval(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
-  int index = data->RealmIndexOrThrow(args, 0);
+  int index = data->RealmIndexOrThrow(info, 0);
   if (index == -1) return;
-  if (args.Length() < 2) {
+  if (info.Length() < 2) {
     ThrowError(isolate, "Invalid argument");
     return;
   }
 
   Local<String> source;
-  if (!ReadSource(args, 1, CodeType::kString).ToLocal(&source)) {
+  if (!ReadSource(info, 1, CodeType::kString).ToLocal(&source)) {
     ThrowError(isolate, "Invalid argument");
     return;
   }
@@ -2068,12 +2156,13 @@ void Shell::RealmEval(const v8::FunctionCallbackInfo<v8::Value>& args) {
       return;
     }
   }
-  args.GetReturnValue().Set(result);
+  info.GetReturnValue().Set(result);
 }
 
 // Realm.shared is an accessor for a single shared value across realms.
 void Shell::RealmSharedGet(Local<String> property,
                            const PropertyCallbackInfo<Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
   if (data->realm_shared_.IsEmpty()) return;
@@ -2082,13 +2171,15 @@ void Shell::RealmSharedGet(Local<String> property,
 
 void Shell::RealmSharedSet(Local<String> property, Local<Value> value,
                            const PropertyCallbackInfo<void>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   Isolate* isolate = info.GetIsolate();
   PerIsolateData* data = PerIsolateData::Get(isolate);
   data->realm_shared_.Reset(isolate, value);
 }
 
-void Shell::LogGetAndStop(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::LogGetAndStop(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope handle_scope(isolate);
 
@@ -2122,21 +2213,21 @@ void Shell::LogGetAndStop(const v8::FunctionCallbackInfo<v8::Value>& args) {
                           static_cast<int>(raw_log.size()))
           .ToLocalChecked();
 
-  args.GetReturnValue().Set(result);
+  info.GetReturnValue().Set(result);
 }
 
 void Shell::TestVerifySourcePositions(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  Isolate* isolate = info.GetIsolate();
   // Check if the argument is a valid function.
-  if (args.Length() != 1) {
+  if (info.Length() != 1) {
     ThrowError(isolate, "Expected function as single argument.");
     return;
   }
-  auto arg_handle = Utils::OpenHandle(*args[0]);
-  if (!arg_handle->IsHeapObject() ||
-      !i::Handle<i::HeapObject>::cast(arg_handle)
-           ->IsJSFunctionOrBoundFunctionOrWrappedFunction()) {
+  auto arg_handle = Utils::OpenHandle(*info[0]);
+  if (!IsHeapObject(*arg_handle) ||
+      !IsJSFunctionOrBoundFunctionOrWrappedFunction(
+          *i::Handle<i::HeapObject>::cast(arg_handle))) {
     ThrowError(isolate, "Expected function as single argument.");
     return;
   }
@@ -2147,11 +2238,11 @@ void Shell::TestVerifySourcePositions(
   auto callable =
       i::Handle<i::JSFunctionOrBoundFunctionOrWrappedFunction>::cast(
           arg_handle);
-  while (callable->IsJSBoundFunction()) {
+  while (IsJSBoundFunction(*callable)) {
     internal::DisallowGarbageCollection no_gc;
     auto bound_function = i::Handle<i::JSBoundFunction>::cast(callable);
     auto bound_target = bound_function->bound_target_function();
-    if (!bound_target.IsJSFunctionOrBoundFunctionOrWrappedFunction()) {
+    if (!IsJSFunctionOrBoundFunctionOrWrappedFunction(bound_target)) {
       internal::AllowGarbageCollection allow_gc;
       ThrowError(isolate, "Expected function as bound target.");
       return;
@@ -2162,20 +2253,20 @@ void Shell::TestVerifySourcePositions(
   }
 
   i::Handle<i::JSFunction> function = i::Handle<i::JSFunction>::cast(callable);
-  if (!function->shared().HasBytecodeArray()) {
+  if (!function->shared()->HasBytecodeArray()) {
     ThrowError(isolate, "Function has no BytecodeArray attached.");
     return;
   }
   i::Handle<i::BytecodeArray> bytecodes =
-      handle(function->shared().GetBytecodeArray(i_isolate), i_isolate);
+      handle(function->shared()->GetBytecodeArray(i_isolate), i_isolate);
   i::interpreter::BytecodeArrayIterator bytecode_iterator(bytecodes);
-  bool has_baseline = function->shared().HasBaselineCode();
+  bool has_baseline = function->shared()->HasBaselineCode();
   i::Handle<i::ByteArray> bytecode_offsets;
   std::unique_ptr<i::baseline::BytecodeOffsetIterator> offset_iterator;
   if (has_baseline) {
     bytecode_offsets = handle(
         i::ByteArray::cast(
-            function->shared().GetCode(i_isolate).bytecode_offset_table()),
+            function->shared()->GetCode(i_isolate)->bytecode_offset_table()),
         i_isolate);
     offset_iterator = std::make_unique<i::baseline::BytecodeOffsetIterator>(
         bytecode_offsets, bytecodes);
@@ -2223,52 +2314,53 @@ void Shell::TestVerifySourcePositions(
 }
 
 void Shell::InstallConditionalFeatures(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  Isolate* isolate = info.GetIsolate();
   isolate->InstallConditionalFeatures(isolate->GetCurrentContext());
 }
 
 // async_hooks.createHook() registers functions to be called for different
 // lifetime events of each async operation.
 void Shell::AsyncHooksCreateHook(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
   Local<Object> wrap =
-      PerIsolateData::Get(args.GetIsolate())->GetAsyncHooks()->CreateHook(args);
-  args.GetReturnValue().Set(wrap);
+      PerIsolateData::Get(info.GetIsolate())->GetAsyncHooks()->CreateHook(info);
+  info.GetReturnValue().Set(wrap);
 }
 
 // async_hooks.executionAsyncId() returns the asyncId of the current execution
 // context.
 void Shell::AsyncHooksExecutionAsyncId(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
-  args.GetReturnValue().Set(v8::Number::New(
+  info.GetReturnValue().Set(v8::Number::New(
       isolate,
       PerIsolateData::Get(isolate)->GetAsyncHooks()->GetExecutionAsyncId()));
 }
 
 void Shell::AsyncHooksTriggerAsyncId(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
-  args.GetReturnValue().Set(v8::Number::New(
+  info.GetReturnValue().Set(v8::Number::New(
       isolate,
       PerIsolateData::Get(isolate)->GetAsyncHooks()->GetTriggerAsyncId()));
 }
 
 static v8::debug::DebugDelegate dummy_delegate;
 
-void Shell::EnableDebugger(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::debug::SetDebugDelegate(args.GetIsolate(), &dummy_delegate);
+void Shell::EnableDebugger(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  v8::debug::SetDebugDelegate(info.GetIsolate(), &dummy_delegate);
 }
 
-void Shell::DisableDebugger(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::debug::SetDebugDelegate(args.GetIsolate(), nullptr);
+void Shell::DisableDebugger(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  v8::debug::SetDebugDelegate(info.GetIsolate(), nullptr);
 }
 
-void Shell::SetPromiseHooks(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::SetPromiseHooks(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   if (i::v8_flags.correctness_fuzzer_suppressions) {
     // Setting promise hoooks dynamically has unexpected timing side-effects
     // with certain promise optimizations. We might not get all callbacks for
@@ -2284,12 +2376,12 @@ void Shell::SetPromiseHooks(const v8::FunctionCallbackInfo<v8::Value>& args) {
   HandleScope handle_scope(isolate);
 
   context->SetPromiseHooks(
-    args[0]->IsFunction() ? args[0].As<Function>() : Local<Function>(),
-    args[1]->IsFunction() ? args[1].As<Function>() : Local<Function>(),
-    args[2]->IsFunction() ? args[2].As<Function>() : Local<Function>(),
-    args[3]->IsFunction() ? args[3].As<Function>() : Local<Function>());
+      info[0]->IsFunction() ? info[0].As<Function>() : Local<Function>(),
+      info[1]->IsFunction() ? info[1].As<Function>() : Local<Function>(),
+      info[2]->IsFunction() ? info[2].As<Function>() : Local<Function>(),
+      info[3]->IsFunction() ? info[3].As<Function>() : Local<Function>());
 
-  args.GetReturnValue().Set(v8::Undefined(isolate));
+  info.GetReturnValue().Set(v8::Undefined(isolate));
 #else   // V8_ENABLE_JAVASCRIPT_PROMISE_HOOKS
   ThrowError(isolate,
              "d8.promise.setHooks is disabled due to missing build flag "
@@ -2298,16 +2390,17 @@ void Shell::SetPromiseHooks(const v8::FunctionCallbackInfo<v8::Value>& args) {
 }
 
 void Shell::SerializerSerialize(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
   Local<Context> context = isolate->GetCurrentContext();
 
   ValueSerializer serializer(isolate);
   serializer.WriteHeader();
-  for (int i = 0; i < args.Length(); i++) {
+  for (int i = 0; i < info.Length(); i++) {
     bool ok;
-    if (!serializer.WriteValue(context, args[i]).To(&ok)) return;
+    if (!serializer.WriteValue(context, info[i]).To(&ok)) return;
   }
   Local<v8::ArrayBuffer> buffer;
   {
@@ -2316,21 +2409,22 @@ void Shell::SerializerSerialize(
     memcpy(buffer->GetBackingStore()->Data(), pair.first, pair.second);
     free(pair.first);
   }
-  args.GetReturnValue().Set(buffer);
+  info.GetReturnValue().Set(buffer);
 }
 
 void Shell::SerializerDeserialize(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
   Local<Context> context = isolate->GetCurrentContext();
 
-  if (!args[0]->IsArrayBuffer()) {
+  if (!info[0]->IsArrayBuffer()) {
     ThrowError(isolate, "Can only deserialize from an ArrayBuffer");
     return;
   }
   std::shared_ptr<BackingStore> backing_store =
-      args[0].As<ArrayBuffer>()->GetBackingStore();
+      info[0].As<ArrayBuffer>()->GetBackingStore();
   ValueDeserializer deserializer(
       isolate, static_cast<const uint8_t*>(backing_store->Data()),
       backing_store->ByteLength());
@@ -2338,20 +2432,21 @@ void Shell::SerializerDeserialize(
   if (!deserializer.ReadHeader(context).To(&ok)) return;
   Local<Value> result;
   if (!deserializer.ReadValue(context).ToLocal(&result)) return;
-  args.GetReturnValue().Set(result);
+  info.GetReturnValue().Set(result);
 }
 
 void Shell::ProfilerSetOnProfileEndListener(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
-  if (!args[0]->IsFunction()) {
+  if (!info[0]->IsFunction()) {
     ThrowError(isolate, "The OnProfileEnd listener has to be a function");
     return;
   }
   base::MutexGuard lock_guard(&profiler_end_callback_lock_);
   profiler_end_callback_[isolate] =
-      std::make_pair(Global<Function>(isolate, args[0].As<Function>()),
+      std::make_pair(Global<Function>(isolate, info[0].As<Function>()),
                      Global<Context>(isolate, isolate->GetCurrentContext()));
 }
 
@@ -2378,8 +2473,8 @@ void Shell::ResetOnProfileEndListener(Isolate* isolate) {
 }
 
 void Shell::ProfilerTriggerSample(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   D8Console* console =
       reinterpret_cast<D8Console*>(i_isolate->console_delegate());
@@ -2405,29 +2500,29 @@ void Shell::TriggerOnProfileEndListener(Isolate* isolate, std::string profile) {
   USE(callback->Call(context, Undefined(isolate), 1, argv));
 }
 
-void WriteToFile(FILE* file, const v8::FunctionCallbackInfo<v8::Value>& args,
+void WriteToFile(FILE* file, const v8::FunctionCallbackInfo<v8::Value>& info,
                  int first_arg_index = 0) {
-  for (int i = first_arg_index; i < args.Length(); i++) {
-    HandleScope handle_scope(args.GetIsolate());
+  for (int i = first_arg_index; i < info.Length(); i++) {
+    HandleScope handle_scope(info.GetIsolate());
     if (i != first_arg_index) {
       fprintf(file, " ");
     }
 
     // Explicitly catch potential exceptions in toString().
-    v8::TryCatch try_catch(args.GetIsolate());
-    Local<Value> arg = args[i];
+    v8::TryCatch try_catch(info.GetIsolate());
+    Local<Value> arg = info[i];
     Local<String> str_obj;
 
     if (arg->IsSymbol()) {
-      arg = arg.As<Symbol>()->Description(args.GetIsolate());
+      arg = arg.As<Symbol>()->Description(info.GetIsolate());
     }
-    if (!arg->ToString(args.GetIsolate()->GetCurrentContext())
+    if (!arg->ToString(info.GetIsolate()->GetCurrentContext())
              .ToLocal(&str_obj)) {
       try_catch.ReThrow();
       return;
     }
 
-    v8::String::Utf8Value str(args.GetIsolate(), str_obj);
+    v8::String::Utf8Value str(info.GetIsolate(), str_obj);
     int n = static_cast<int>(fwrite(*str, sizeof(**str), str.length(), file));
     if (n != str.length()) {
       printf("Error in fwrite\n");
@@ -2437,22 +2532,23 @@ void WriteToFile(FILE* file, const v8::FunctionCallbackInfo<v8::Value>& args,
 }
 
 void WriteAndFlush(FILE* file,
-                   const v8::FunctionCallbackInfo<v8::Value>& args) {
-  WriteToFile(file, args);
+                   const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  WriteToFile(file, info);
   fprintf(file, "\n");
   fflush(file);
 }
 
-void Shell::Print(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  WriteAndFlush(stdout, args);
+void Shell::Print(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  WriteAndFlush(stdout, info);
 }
 
-void Shell::PrintErr(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  WriteAndFlush(stderr, args);
+void Shell::PrintErr(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  WriteAndFlush(stderr, info);
 }
 
-void Shell::WriteStdout(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  WriteToFile(stdout, args);
+void Shell::WriteStdout(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  WriteToFile(stdout, info);
 }
 
 // There are two overloads of writeFile().
@@ -2464,30 +2560,31 @@ void Shell::WriteStdout(const v8::FunctionCallbackInfo<v8::Value>& args) {
 //
 // Otherwise, convert arguments to UTF-8 strings, and write them to the file,
 // separated by space.
-void Shell::WriteFile(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  String::Utf8Value file_name(args.GetIsolate(), args[0]);
+void Shell::WriteFile(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  String::Utf8Value file_name(info.GetIsolate(), info[0]);
   if (*file_name == nullptr) {
-    ThrowError(args.GetIsolate(), "Error converting filename to string");
+    ThrowError(info.GetIsolate(), "Error converting filename to string");
     return;
   }
   FILE* file;
-  if (args.Length() == 2 &&
-      (args[1]->IsArrayBuffer() || args[1]->IsArrayBufferView())) {
+  if (info.Length() == 2 &&
+      (info[1]->IsArrayBuffer() || info[1]->IsArrayBufferView())) {
     file = base::Fopen(*file_name, "wb");
     if (file == nullptr) {
-      ThrowError(args.GetIsolate(), "Error opening file");
+      ThrowError(info.GetIsolate(), "Error opening file");
       return;
     }
 
     void* data;
     size_t length;
-    if (args[1]->IsArrayBuffer()) {
-      Local<v8::ArrayBuffer> buffer = Local<v8::ArrayBuffer>::Cast(args[1]);
+    if (info[1]->IsArrayBuffer()) {
+      Local<v8::ArrayBuffer> buffer = Local<v8::ArrayBuffer>::Cast(info[1]);
       length = buffer->ByteLength();
       data = buffer->Data();
     } else {
       Local<v8::ArrayBufferView> buffer_view =
-          Local<v8::ArrayBufferView>::Cast(args[1]);
+          Local<v8::ArrayBufferView>::Cast(info[1]);
       length = buffer_view->ByteLength();
       data = static_cast<uint8_t*>(buffer_view->Buffer()->Data()) +
              buffer_view->ByteOffset();
@@ -2496,30 +2593,31 @@ void Shell::WriteFile(const v8::FunctionCallbackInfo<v8::Value>& args) {
   } else {
     file = base::Fopen(*file_name, "w");
     if (file == nullptr) {
-      ThrowError(args.GetIsolate(), "Error opening file");
+      ThrowError(info.GetIsolate(), "Error opening file");
       return;
     }
-    WriteToFile(file, args, 1);
+    WriteToFile(file, info, 1);
   }
   base::Fclose(file);
 }
 
-void Shell::ReadFile(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  String::Utf8Value file_name(args.GetIsolate(), args[0]);
+void Shell::ReadFile(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  String::Utf8Value file_name(info.GetIsolate(), info[0]);
   if (*file_name == nullptr) {
-    ThrowError(args.GetIsolate(), "Error converting filename to string");
+    ThrowError(info.GetIsolate(), "Error converting filename to string");
     return;
   }
-  if (args.Length() == 2) {
-    String::Utf8Value format(args.GetIsolate(), args[1]);
+  if (info.Length() == 2) {
+    String::Utf8Value format(info.GetIsolate(), info[1]);
     if (*format && std::strcmp(*format, "binary") == 0) {
-      ReadBuffer(args);
+      ReadBuffer(info);
       return;
     }
   }
   Local<String> source;
-  if (!ReadFile(args.GetIsolate(), *file_name).ToLocal(&source)) return;
-  args.GetReturnValue().Set(source);
+  if (!ReadFile(info.GetIsolate(), *file_name).ToLocal(&source)) return;
+  info.GetReturnValue().Set(source);
 }
 
 Local<String> Shell::ReadFromStdin(Isolate* isolate) {
@@ -2562,11 +2660,12 @@ Local<String> Shell::ReadFromStdin(Isolate* isolate) {
   }
 }
 
-void Shell::ExecuteFile(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
-  for (int i = 0; i < args.Length(); i++) {
+void Shell::ExecuteFile(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
+  for (int i = 0; i < info.Length(); i++) {
     HandleScope handle_scope(isolate);
-    String::Utf8Value file_name(isolate, args[i]);
+    String::Utf8Value file_name(isolate, info[i]);
     if (*file_name == nullptr) {
       std::ostringstream oss;
       oss << "Cannot convert file[" << i << "] name to string.";
@@ -2578,7 +2677,7 @@ void Shell::ExecuteFile(const v8::FunctionCallbackInfo<v8::Value>& args) {
     Local<String> source;
     if (!ReadFile(isolate, *file_name).ToLocal(&source)) return;
     if (!ExecuteString(
-            args.GetIsolate(), source,
+            info.GetIsolate(), source,
             String::NewFromUtf8(isolate, *file_name).ToLocalChecked(),
             kNoPrintResult,
             options.quiet_load ? kNoReportExceptions : kReportExceptions,
@@ -2593,21 +2692,22 @@ void Shell::ExecuteFile(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
 }
 
-void Shell::SetTimeout(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
-  args.GetReturnValue().Set(v8::Number::New(isolate, 0));
-  if (args.Length() == 0 || !args[0]->IsFunction()) return;
-  Local<Function> callback = args[0].As<Function>();
+void Shell::SetTimeout(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
+  info.GetReturnValue().Set(v8::Number::New(isolate, 0));
+  if (info.Length() == 0 || !info[0]->IsFunction()) return;
+  Local<Function> callback = info[0].As<Function>();
   Local<Context> context = isolate->GetCurrentContext();
   PerIsolateData::Get(isolate)->SetTimeout(callback, context);
 }
 
 void Shell::ReadCodeTypeAndArguments(
-    const v8::FunctionCallbackInfo<v8::Value>& args, int index,
+    const v8::FunctionCallbackInfo<v8::Value>& info, int index,
     CodeType* code_type, Local<Value>* arguments) {
-  Isolate* isolate = args.GetIsolate();
-  if (args.Length() > index && args[index]->IsObject()) {
-    Local<Object> object = args[index].As<Object>();
+  Isolate* isolate = info.GetIsolate();
+  if (info.Length() > index && info[index]->IsObject()) {
+    Local<Object> object = info[index].As<Object>();
     Local<Context> context = isolate->GetCurrentContext();
     Local<Value> value;
     if (!TryGetValue(isolate, context, object, "type").ToLocal(&value)) {
@@ -2686,47 +2786,47 @@ bool Shell::FunctionAndArgumentsToString(Local<Function> function,
   return true;
 }
 
-// ReadSource() supports reading source code through `args[index]` as specified
-// by the `default_type` or an optional options bag provided in `args[index+1]`
+// ReadSource() supports reading source code through `info[index]` as specified
+// by the `default_type` or an optional options bag provided in `info[index+1]`
 // (e.g. `options={type: 'code_type', arguments:[...]}`).
 MaybeLocal<String> Shell::ReadSource(
-    const v8::FunctionCallbackInfo<v8::Value>& args, int index,
+    const v8::FunctionCallbackInfo<v8::Value>& info, int index,
     CodeType default_type) {
   CodeType code_type;
   Local<Value> arguments;
-  ReadCodeTypeAndArguments(args, index + 1, &code_type, &arguments);
+  ReadCodeTypeAndArguments(info, index + 1, &code_type, &arguments);
 
-  Isolate* isolate = args.GetIsolate();
+  Isolate* isolate = info.GetIsolate();
   Local<String> source;
   if (code_type == CodeType::kNone) {
     code_type = default_type;
   }
   switch (code_type) {
     case CodeType::kFunction:
-      if (!args[index]->IsFunction()) {
+      if (!info[index]->IsFunction()) {
         return MaybeLocal<String>();
       }
       // Source: ( function_to_string )( params )
-      if (!FunctionAndArgumentsToString(args[index].As<Function>(), arguments,
+      if (!FunctionAndArgumentsToString(info[index].As<Function>(), arguments,
                                         &source, isolate)) {
         return MaybeLocal<String>();
       }
       break;
     case CodeType::kFileName: {
-      if (!args[index]->IsString()) {
+      if (!info[index]->IsString()) {
         return MaybeLocal<String>();
       }
-      String::Utf8Value filename(isolate, args[index]);
+      String::Utf8Value filename(isolate, info[index]);
       if (!Shell::ReadFile(isolate, *filename).ToLocal(&source)) {
         return MaybeLocal<String>();
       }
       break;
     }
     case CodeType::kString:
-      if (!args[index]->IsString()) {
+      if (!info[index]->IsString()) {
         return MaybeLocal<String>();
       }
-      source = args[index].As<String>();
+      source = info[index].As<String>();
       break;
     case CodeType::kNone:
     case CodeType::kInvalid:
@@ -2735,21 +2835,22 @@ MaybeLocal<String> Shell::ReadSource(
   return source;
 }
 
-void Shell::WorkerNew(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::WorkerNew(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
-  if (args.Length() < 1 || (!args[0]->IsString() && !args[0]->IsFunction())) {
+  if (info.Length() < 1 || (!info[0]->IsString() && !info[0]->IsFunction())) {
     ThrowError(isolate, "1st argument must be a string or a function");
     return;
   }
 
   Local<String> source;
-  if (!ReadSource(args, 0, CodeType::kFileName).ToLocal(&source)) {
+  if (!ReadSource(info, 0, CodeType::kFileName).ToLocal(&source)) {
     ThrowError(isolate, "Invalid argument");
     return;
   }
 
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     ThrowError(isolate, "Worker must be constructed with new");
     return;
   }
@@ -2757,7 +2858,7 @@ void Shell::WorkerNew(const v8::FunctionCallbackInfo<v8::Value>& args) {
   // Initialize the embedder field to 0; if we return early without
   // creating a new Worker (because the main thread is terminating) we can
   // early-out from the instance calls.
-  args.Holder()->SetInternalField(0, v8::Integer::New(isolate, 0));
+  info.Holder()->SetInternalField(0, v8::Integer::New(isolate, 0));
 
   {
     // Don't allow workers to create more workers if the main thread
@@ -2781,32 +2882,36 @@ void Shell::WorkerNew(const v8::FunctionCallbackInfo<v8::Value>& args) {
     const size_t kWorkerSizeEstimate = 4 * 1024 * 1024;  // stack + heap.
     i::Handle<i::Object> managed = i::Managed<Worker>::FromSharedPtr(
         i_isolate, kWorkerSizeEstimate, worker);
-    args.Holder()->SetInternalField(0, Utils::ToLocal(managed));
-    if (!Worker::StartWorkerThread(isolate, std::move(worker))) {
+    info.Holder()->SetInternalField(0, Utils::ToLocal(managed));
+    base::Thread::Priority priority =
+        options.apply_priority ? base::Thread::Priority::kUserBlocking
+                               : base::Thread::Priority::kDefault;
+    if (!Worker::StartWorkerThread(isolate, std::move(worker), priority)) {
       ThrowError(isolate, "Can't start thread");
       return;
     }
   }
 }
 
-void Shell::WorkerPostMessage(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::WorkerPostMessage(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
 
-  if (args.Length() < 1) {
+  if (info.Length() < 1) {
     ThrowError(isolate, "Invalid argument");
     return;
   }
 
   std::shared_ptr<Worker> worker =
-      GetWorkerFromInternalField(isolate, args.Holder());
+      GetWorkerFromInternalField(isolate, info.Holder());
   if (!worker.get()) {
     return;
   }
 
-  Local<Value> message = args[0];
+  Local<Value> message = info[0];
   Local<Value> transfer =
-      args.Length() >= 2 ? args[1] : Undefined(isolate).As<Value>();
+      info.Length() >= 2 ? info[1] : Undefined(isolate).As<Value>();
   std::unique_ptr<SerializationData> data =
       Shell::SerializeValue(isolate, message, transfer);
   if (data) {
@@ -2814,11 +2919,12 @@ void Shell::WorkerPostMessage(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
 }
 
-void Shell::WorkerGetMessage(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::WorkerGetMessage(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
   std::shared_ptr<Worker> worker =
-      GetWorkerFromInternalField(isolate, args.Holder());
+      GetWorkerFromInternalField(isolate, info.Holder());
   if (!worker.get()) {
     return;
   }
@@ -2827,40 +2933,44 @@ void Shell::WorkerGetMessage(const v8::FunctionCallbackInfo<v8::Value>& args) {
   if (data) {
     Local<Value> value;
     if (Shell::DeserializeValue(isolate, std::move(data)).ToLocal(&value)) {
-      args.GetReturnValue().Set(value);
+      info.GetReturnValue().Set(value);
     }
   }
 }
 
-void Shell::WorkerTerminate(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Shell::WorkerTerminate(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
   std::shared_ptr<Worker> worker =
-      GetWorkerFromInternalField(isolate, args.Holder());
+      GetWorkerFromInternalField(isolate, info.Holder());
   if (!worker.get()) return;
   worker->Terminate();
 }
 
 void Shell::WorkerTerminateAndWait(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
   std::shared_ptr<Worker> worker =
-      GetWorkerFromInternalField(isolate, args.Holder());
+      GetWorkerFromInternalField(isolate, info.Holder());
   if (!worker.get()) {
     return;
   }
 
-  i::ParkedScope parked(
-      reinterpret_cast<i::Isolate*>(isolate)->main_thread_local_isolate());
-  worker->TerminateAndWaitForThread(parked);
+  reinterpret_cast<i::Isolate*>(isolate)
+      ->main_thread_local_isolate()
+      ->BlockMainThreadWhileParked([worker](const i::ParkedScope& parked) {
+        worker->TerminateAndWaitForThread(parked);
+      });
 }
 
-void Shell::QuitOnce(v8::FunctionCallbackInfo<v8::Value>* args) {
-  int exit_code = (*args)[0]
-                      ->Int32Value(args->GetIsolate()->GetCurrentContext())
+void Shell::QuitOnce(v8::FunctionCallbackInfo<v8::Value>* info) {
+  int exit_code = (*info)[0]
+                      ->Int32Value(info->GetIsolate()->GetCurrentContext())
                       .FromMaybe(0);
-  Isolate* isolate = args->GetIsolate();
+  Isolate* isolate = info->GetIsolate();
   ResetOnProfileEndListener(isolate);
   isolate->Exit();
 
@@ -2875,15 +2985,16 @@ void Shell::QuitOnce(v8::FunctionCallbackInfo<v8::Value>* args) {
   // When disposing the shared space isolate, the workers (client isolates) need
   // to be terminated first.
   if (i_isolate->is_shared_space_isolate()) {
-    i::ParkedScope parked(i_isolate->main_thread_local_isolate());
-    WaitForRunningWorkers(parked);
+    i_isolate->main_thread_local_isolate()->BlockMainThreadWhileParked(
+        [](const i::ParkedScope& parked) { WaitForRunningWorkers(parked); });
   }
 
   OnExit(isolate, false);
   base::OS::ExitProcess(exit_code);
 }
 
-void Shell::Terminate(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void Shell::Terminate(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   // Triggering termination from JS can cause some non-determinism thus we
   // skip it for correctness fuzzing.
   // Termination also currently breaks Fuzzilli's REPRL mechanism as the
@@ -2891,27 +3002,21 @@ void Shell::Terminate(const v8::FunctionCallbackInfo<v8::Value>& args) {
   // being processed. This will in turn desynchronize the communication
   // between d8 and Fuzzilli, leading to a crash.
   if (!i::v8_flags.correctness_fuzzer_suppressions && !fuzzilli_reprl) {
-    auto v8_isolate = args.GetIsolate();
+    auto v8_isolate = info.GetIsolate();
     if (!v8_isolate->IsExecutionTerminating()) v8_isolate->TerminateExecution();
   }
 }
 
-void Shell::Quit(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void Shell::Quit(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   base::CallOnce(&quit_once_, &QuitOnce,
-                 const_cast<v8::FunctionCallbackInfo<v8::Value>*>(&args));
-}
-
-void Shell::WaitUntilDone(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  SetWaitUntilDone(args.GetIsolate(), true);
-}
-
-void Shell::NotifyDone(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  SetWaitUntilDone(args.GetIsolate(), false);
+                 const_cast<v8::FunctionCallbackInfo<v8::Value>*>(&info));
 }
 
-void Shell::Version(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().Set(
-      String::NewFromUtf8(args.GetIsolate(), V8::GetVersion())
+void Shell::Version(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(
+      String::NewFromUtf8(info.GetIsolate(), V8::GetVersion())
           .ToLocalChecked());
 }
 
@@ -2923,27 +3028,62 @@ void Shell::Version(const v8::FunctionCallbackInfo<v8::Value>& args) {
 // as first argument (with the idea being that the fuzzer won't be able to
 // generate this value) which then also acts as a selector for the operation
 // to perform.
-void Shell::Fuzzilli(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  HandleScope handle_scope(args.GetIsolate());
+void Shell::Fuzzilli(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  HandleScope handle_scope(info.GetIsolate());
 
-  String::Utf8Value operation(args.GetIsolate(), args[0]);
+  String::Utf8Value operation(info.GetIsolate(), info[0]);
   if (*operation == nullptr) {
     return;
   }
   if (strcmp(*operation, "FUZZILLI_CRASH") == 0) {
-    auto arg = args[1]
-                   ->Int32Value(args.GetIsolate()->GetCurrentContext())
+    auto arg = info[1]
+                   ->Int32Value(info.GetIsolate()->GetCurrentContext())
                    .FromMaybe(0);
     switch (arg) {
       case 0:
         IMMEDIATE_CRASH();
         break;
       case 1:
-        CHECK(0);
+        CHECK(false);
         break;
-      default:
+      case 2:
         DCHECK(false);
         break;
+      case 3: {
+        // Access an invalid address.
+        // We want to use an "interesting" address for the access (instead of
+        // e.g. nullptr). In the (unlikely) case that the address is actually
+        // mapped, simply increment the pointer until it crashes.
+        char* ptr = reinterpret_cast<char*>(0x414141414141ull);
+        for (int i = 0; i < 1024; i++) {
+          *ptr = 'A';
+          ptr += 1 * i::GB;
+        }
+        break;
+      }
+      case 4: {
+        // Use-after-free, likely only crashes in ASan builds.
+        auto* vec = new std::vector<int>(4);
+        delete vec;
+        USE(vec->at(0));
+        break;
+      }
+      case 5: {
+        // Out-of-bounds access (1), likely only crashes in ASan or
+        // "hardened"/"safe" libc++ builds.
+        std::vector<int> vec(5);
+        USE(vec[5]);
+        break;
+      }
+      case 6: {
+        // Out-of-bounds access (2), likely only crashes in ASan builds.
+        std::vector<int> vec(6);
+        memset(vec.data(), 42, 0x100);
+        break;
+      }
+      default:
+        break;
     }
   } else if (strcmp(*operation, "FUZZILLI_PRINT") == 0) {
     static FILE* fzliout = fdopen(REPRL_DWFD, "w");
@@ -2954,7 +3094,7 @@ void Shell::Fuzzilli(const v8::FunctionCallbackInfo<v8::Value>& args) {
       fzliout = stdout;
     }
 
-    String::Utf8Value string(args.GetIsolate(), args[1]);
+    String::Utf8Value string(info.GetIsolate(), info[1]);
     if (*string == nullptr) {
       return;
     }
@@ -3031,7 +3171,11 @@ void Shell::ReportException(Isolate* isolate, Local<v8::Message> message,
 }
 
 void Shell::ReportException(v8::Isolate* isolate, v8::TryCatch* try_catch) {
-  ReportException(isolate, try_catch->Message(), try_catch->Exception());
+  if (isolate->IsExecutionTerminating()) {
+    printf("Got Execution Termination Exception\n");
+  } else {
+    ReportException(isolate, try_catch->Message(), try_catch->Exception());
+  }
 }
 
 void Counter::Bind(const char* name, bool is_histogram) {
@@ -3140,10 +3284,11 @@ Local<String> Shell::Stringify(Isolate* isolate, Local<Value> value) {
   return result.ToLocalChecked().As<String>();
 }
 
-void Shell::NodeTypeCallback(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void Shell::NodeTypeCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
 
-  args.GetReturnValue().Set(v8::Number::New(isolate, 1));
+  info.GetReturnValue().Set(v8::Number::New(isolate, 1));
 }
 
 Local<FunctionTemplate> NewDOMFunctionTemplate(Isolate* isolate,
@@ -3196,39 +3341,6 @@ Local<FunctionTemplate> Shell::CreateNodeTemplates(
   return div_element;
 }
 
-static bool D8AccessCheckCallback(Local<Context> accessing_context,
-                                  Local<Object> accessed_object,
-                                  Local<Value> data) {
-  return Isolate::GetCurrent()
-      ->GetCurrentContext()
-      ->GetSecurityToken()
-      ->StrictEquals(
-          accessed_object->GetCreationContextChecked()->GetSecurityToken());
-}
-
-static void AccessNamedGetter(Local<Name> property,
-                              const PropertyCallbackInfo<Value>& info) {}
-static void AccessNamedSetter(Local<Name> property, Local<Value> value,
-                              const PropertyCallbackInfo<Value>& info) {}
-static void AccessNamedQuery(Local<Name> property,
-                             const PropertyCallbackInfo<Integer>& info) {}
-static void AccessNamedDeleter(Local<Name> property,
-                               const PropertyCallbackInfo<Boolean>& info) {}
-static void AccessNamedEnumerator(const PropertyCallbackInfo<Array>& info) {}
-static void AccessIndexedGetter(uint32_t index,
-                                const PropertyCallbackInfo<Value>& info) {}
-
-static void AccessIndexedSetter(uint32_t index, Local<Value> value,
-                                const PropertyCallbackInfo<Value>& info) {}
-
-static void AccessIndexedQuery(uint32_t index,
-                               const PropertyCallbackInfo<Integer>& info) {}
-
-static void AccessIndexedDeleter(uint32_t index,
-                                 const PropertyCallbackInfo<Boolean>& info) {}
-
-static void AccessIndexedEnumerator(const PropertyCallbackInfo<Array>& info) {}
-
 Local<ObjectTemplate> Shell::CreateGlobalTemplate(Isolate* isolate) {
   Local<ObjectTemplate> global_template = ObjectTemplate::New(isolate);
   global_template->Set(Symbol::GetToStringTag(isolate),
@@ -3286,18 +3398,6 @@ Local<ObjectTemplate> Shell::CreateGlobalTemplate(Isolate* isolate) {
                          Shell::CreateAsyncHookTemplate(isolate));
   }
 
-  if (options.throw_on_failed_access_check ||
-      options.noop_on_failed_access_check) {
-    global_template->SetAccessCheckCallbackAndHandler(
-        D8AccessCheckCallback,
-        v8::NamedPropertyHandlerConfiguration(
-            AccessNamedGetter, AccessNamedSetter, AccessNamedQuery,
-            AccessNamedDeleter, AccessNamedEnumerator),
-        v8::IndexedPropertyHandlerConfiguration(
-            AccessIndexedGetter, AccessIndexedSetter, AccessIndexedQuery,
-            AccessIndexedDeleter, AccessIndexedEnumerator));
-  }
-
   return global_template;
 }
 
@@ -3357,10 +3457,6 @@ Local<ObjectTemplate> Shell::CreateAsyncHookTemplate(Isolate* isolate) {
 
 Local<ObjectTemplate> Shell::CreateTestRunnerTemplate(Isolate* isolate) {
   Local<ObjectTemplate> test_template = ObjectTemplate::New(isolate);
-  test_template->Set(isolate, "notifyDone",
-                     FunctionTemplate::New(isolate, NotifyDone));
-  test_template->Set(isolate, "waitUntilDone",
-                     FunctionTemplate::New(isolate, WaitUntilDone));
   // Reliable access to quit functionality. The "quit" method function
   // installed on the global object can be hidden with the --omit-quit flag
   // (e.g. on asan bots).
@@ -3585,14 +3681,11 @@ void Shell::PromiseRejectCallback(v8::PromiseRejectMessage data) {
   isolate_data->AddUnhandledPromise(promise, message, exception);
 }
 
-static void ThrowOnFailedAccessCheck(Local<Object> host, v8::AccessType type,
-                                     Local<Value> data) {
-  Isolate::GetCurrent()->ThrowError("Error in failed access check callback");
-}
-
 void Shell::Initialize(Isolate* isolate, D8Console* console,
                        bool isOnMainThread) {
   isolate->SetPromiseRejectCallback(PromiseRejectCallback);
+  isolate->SetWasmAsyncResolvePromiseCallback(
+      D8WasmAsyncResolvePromiseCallback);
   if (isOnMainThread) {
     // Set up counters
     if (i::v8_flags.map_counters[0] != '\0') {
@@ -3613,13 +3706,6 @@ void Shell::Initialize(Isolate* isolate, D8Console* console,
   isolate->SetHostCreateShadowRealmContextCallback(
       Shell::HostCreateShadowRealmContext);
 
-  if (options.throw_on_failed_access_check) {
-    isolate->SetFailedAccessCheckCallbackFunction(ThrowOnFailedAccessCheck);
-  } else if (options.noop_on_failed_access_check) {
-    isolate->SetFailedAccessCheckCallbackFunction(
-        [](Local<Object> host, v8::AccessType type, Local<Value> data) {});
-  }
-
   debug::SetConsoleDelegate(isolate, console);
 }
 
@@ -3984,11 +4070,12 @@ MaybeLocal<PrimitiveArray> Shell::ReadLines(Isolate* isolate,
   return exports;
 }
 
-void Shell::ReadBuffer(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void Shell::ReadBuffer(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   static_assert(sizeof(char) == sizeof(uint8_t),
                 "char and uint8_t should both have 1 byte");
-  Isolate* isolate = args.GetIsolate();
-  String::Utf8Value filename(isolate, args[0]);
+  Isolate* isolate = info.GetIsolate();
+  String::Utf8Value filename(isolate, info[0]);
   int length;
   if (*filename == nullptr) {
     ThrowError(isolate, "Error loading file");
@@ -4004,7 +4091,12 @@ void Shell::ReadBuffer(const v8::FunctionCallbackInfo<v8::Value>& args) {
   memcpy(buffer->GetBackingStore()->Data(), data, length);
   delete[] data;
 
-  args.GetReturnValue().Set(buffer);
+  info.GetReturnValue().Set(buffer);
+}
+
+void Shell::ReadLine(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(ReadFromStdin(info.GetIsolate()));
 }
 
 // Reads a file into a v8 string.
@@ -4188,12 +4280,13 @@ class InspectorClient : public v8_inspector::V8InspectorClient {
   }
 
   static void SendInspectorMessage(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    Isolate* isolate = args.GetIsolate();
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(i::ValidateCallbackInfo(info));
+    Isolate* isolate = info.GetIsolate();
     v8::HandleScope handle_scope(isolate);
     Local<Context> context = isolate->GetCurrentContext();
-    args.GetReturnValue().Set(Undefined(isolate));
-    Local<String> message = args[0]->ToString(context).ToLocalChecked();
+    info.GetReturnValue().Set(Undefined(isolate));
+    Local<String> message = info[0]->ToString(context).ToLocalChecked();
     v8_inspector::V8InspectorSession* session =
         InspectorClient::GetSession(context);
     int length = message->Length();
@@ -4204,7 +4297,7 @@ class InspectorClient : public v8_inspector::V8InspectorClient {
       v8::SealHandleScope seal_handle_scope(isolate);
       session->dispatchProtocolMessage(message_view);
     }
-    args.GetReturnValue().Set(True(isolate));
+    info.GetReturnValue().Set(True(isolate));
   }
 
   static const int kContextGroupId = 1;
@@ -4340,7 +4433,6 @@ void SourceGroup::ExecuteInThread() {
   Isolate::CreateParams create_params;
   create_params.array_buffer_allocator = Shell::array_buffer_allocator;
   Isolate* isolate = Isolate::New(create_params);
-  Shell::SetWaitUntilDone(isolate, false);
 
   {
     Isolate::Scope isolate_scope(isolate);
@@ -4442,11 +4534,12 @@ Worker::~Worker() {
 bool Worker::is_running() const { return state_.load() == State::kRunning; }
 
 bool Worker::StartWorkerThread(Isolate* requester,
-                               std::shared_ptr<Worker> worker) {
+                               std::shared_ptr<Worker> worker,
+                               base::Thread::Priority priority) {
   auto expected = State::kReady;
   CHECK(
       worker->state_.compare_exchange_strong(expected, State::kPrepareRunning));
-  auto thread = new WorkerThread(worker);
+  auto thread = new WorkerThread(worker, priority);
   worker->thread_ = thread;
   if (!thread->Start()) return false;
   // Wait until the worker is ready to receive messages.
@@ -4683,22 +4776,23 @@ void Worker::ExecuteInThread() {
   out_semaphore_.Signal();
 }
 
-void Worker::PostMessageOut(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void Worker::PostMessageOut(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   HandleScope handle_scope(isolate);
 
-  if (args.Length() < 1) {
+  if (info.Length() < 1) {
     ThrowError(isolate, "Invalid argument");
     return;
   }
 
-  Local<Value> message = args[0];
+  Local<Value> message = info[0];
   Local<Value> transfer = Undefined(isolate);
   std::unique_ptr<SerializationData> data =
       Shell::SerializeValue(isolate, message, transfer);
   if (data) {
-    DCHECK(args.Data()->IsExternal());
-    Local<External> this_value = args.Data().As<External>();
+    DCHECK(info.Data()->IsExternal());
+    Local<External> this_value = info.Data().As<External>();
     Worker* worker = static_cast<Worker*>(this_value->Value());
     worker->out_queue_.Enqueue(std::move(data));
     worker->out_semaphore_.Signal();
@@ -4883,6 +4977,9 @@ bool Shell::SetOptions(int argc, char* argv[]) {
     } else if (strcmp(argv[i], "--enable-os-system") == 0) {
       options.enable_os_system = true;
       argv[i] = nullptr;
+    } else if (strcmp(argv[i], "--no-apply-priority") == 0) {
+      options.apply_priority = false;
+      argv[i] = nullptr;
     } else if (strcmp(argv[i], "--quiet-load") == 0) {
       options.quiet_load = true;
       argv[i] = nullptr;
@@ -4958,12 +5055,6 @@ bool Shell::SetOptions(int argc, char* argv[]) {
       options.enable_sandbox_crash_filter = true;
       argv[i] = nullptr;
 #endif  // V8_ENABLE_SANDBOX
-    } else if (strcmp(argv[i], "--throw-on-failed-access-check") == 0) {
-      options.throw_on_failed_access_check = true;
-      argv[i] = nullptr;
-    } else if (strcmp(argv[i], "--noop-on-failed-access-check") == 0) {
-      options.noop_on_failed_access_check = true;
-      argv[i] = nullptr;
     } else {
 #ifdef V8_TARGET_OS_WIN
       PreProcessUnicodeFilenameArg(argv, i);
@@ -4971,13 +5062,6 @@ bool Shell::SetOptions(int argc, char* argv[]) {
     }
   }
 
-  if (options.throw_on_failed_access_check &&
-      options.noop_on_failed_access_check && check_d8_flag_contradictions) {
-    FATAL(
-        "Flag --throw-on-failed-access-check is incompatible with "
-        "--noop-on-failed-access-check.");
-  }
-
   const char* usage =
       "Synopsis:\n"
       "  shell [options] [--shell] [<file>...]\n"
@@ -5035,25 +5119,61 @@ bool Shell::SetOptions(int argc, char* argv[]) {
 }
 
 int Shell::RunMain(v8::Isolate* isolate, bool last_run) {
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
+
   for (int i = 1; i < options.num_isolates; ++i) {
     options.isolate_sources[i].StartExecuteInThread();
   }
-  bool success = RunMainIsolate(isolate, last_run);
+
+  // The Context object, created inside RunMainIsolate, is used after the method
+  // returns in some situations:
+  const bool keep_context_alive =
+      last_run && (use_interactive_shell() || i::v8_flags.stress_snapshot);
+  bool success = RunMainIsolate(isolate, keep_context_alive);
   CollectGarbage(isolate);
 
-  // Park the main thread here to prevent deadlocks in shared GCs when waiting
-  // in JoinThread.
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
-  i::ParkedScope parked(i_isolate->main_thread_local_isolate());
+  // Park the main thread here to prevent deadlocks in shared GCs when
+  // waiting in JoinThread.
+  i_isolate->main_thread_local_heap()->BlockMainThreadWhileParked(
+      [last_run](const i::ParkedScope& parked) {
+        for (int i = 1; i < options.num_isolates; ++i) {
+          if (last_run) {
+            options.isolate_sources[i].JoinThread(parked);
+          } else {
+            options.isolate_sources[i].WaitForThread(parked);
+          }
+        }
+        WaitForRunningWorkers(parked);
+      });
 
-  for (int i = 1; i < options.num_isolates; ++i) {
-    if (last_run) {
-      options.isolate_sources[i].JoinThread(parked);
-    } else {
-      options.isolate_sources[i].WaitForThread(parked);
+  // Other threads have terminated, we can now run the artifical
+  // serialize-deserialize pass (which destructively mutates heap state).
+  if (success && last_run && i::v8_flags.stress_snapshot) {
+    HandleScope handle_scope(isolate);
+    static constexpr bool kClearRecompilableData = true;
+    auto context = v8::Local<v8::Context>::New(isolate, evaluation_context_);
+    i::Handle<i::Context> i_context = Utils::OpenHandle(*context);
+    // Stop concurrent compiles before mutating the heap.
+    if (i_isolate->concurrent_recompilation_enabled()) {
+      i_isolate->optimizing_compile_dispatcher()->Stop();
     }
+#if V8_ENABLE_MAGLEV
+    if (i_isolate->maglev_concurrent_dispatcher()->is_enabled()) {
+      i_isolate->maglev_concurrent_dispatcher()->AwaitCompileJobs();
+    }
+#endif  // V8_ENABLE_MAGLEV
+    // TODO(jgruber,v8:10500): Don't deoptimize once we support serialization
+    // of optimized code.
+    i::Deoptimizer::DeoptimizeAll(i_isolate);
+    // Trigger GC to better align with production code. Also needed by
+    // ClearReconstructableDataForSerialization to not look into dead objects.
+    i_isolate->heap()->CollectAllAvailableGarbage(
+        i::GarbageCollectionReason::kSnapshotCreator);
+    i::Snapshot::ClearReconstructableDataForSerialization(
+        i_isolate, kClearRecompilableData);
+    i::Snapshot::SerializeDeserializeAndVerifyForTesting(i_isolate, i_context);
   }
-  WaitForRunningWorkers(parked);
+
   if (Shell::unhandled_promise_rejections_.load() > 0) {
     printf("%i pending unhandled Promise rejection(s) detected.\n",
            Shell::unhandled_promise_rejections_.load());
@@ -5064,11 +5184,13 @@ int Shell::RunMain(v8::Isolate* isolate, bool last_run) {
   }
   // In order to finish successfully, success must be != expected_to_throw.
   if (Shell::options.no_fail) return 0;
+  // Fuzzers aren't expected to use --throws, but may pick it up from testcases.
+  // In that case, just ignore the flag.
+  if (i::v8_flags.fuzzing && Shell::options.expected_to_throw) return 0;
   return (success == Shell::options.expected_to_throw ? 1 : 0);
 }
 
-bool Shell::RunMainIsolate(v8::Isolate* isolate, bool last_run) {
-  Shell::SetWaitUntilDone(isolate, false);
+bool Shell::RunMainIsolate(v8::Isolate* isolate, bool keep_context_alive) {
   if (options.lcov_file) {
     debug::Coverage::SelectMode(isolate, debug::CoverageMode::kBlockCount);
   }
@@ -5082,9 +5204,7 @@ bool Shell::RunMainIsolate(v8::Isolate* isolate, bool last_run) {
     DCHECK(!fuzzilli_reprl);
     return false;
   }
-  bool use_existing_context = last_run && use_interactive_shell();
-  if (use_existing_context) {
-    // Keep using the same context in the interactive shell.
+  if (keep_context_alive) {
     evaluation_context_.Reset(isolate, context);
   }
   bool success = true;
@@ -5096,32 +5216,9 @@ bool Shell::RunMainIsolate(v8::Isolate* isolate, bool last_run) {
     if (!CompleteMessageLoop(isolate)) success = false;
   }
   WriteLcovData(isolate, options.lcov_file);
-  if (last_run && i::v8_flags.stress_snapshot) {
-    {
-      // We can't run the serializer while workers are still active. Ideally,
-      // we'd terminate these properly (see WaitForRunningWorkers), but that's
-      // not easily possible  due to ordering issues. It's not expected to be a
-      // common case, and it's unrelated to issues that stress_snapshot is
-      // intended to catch - simply bail out.
-      base::MutexGuard lock_guard(workers_mutex_.Pointer());
-      if (!running_workers_.empty()) {
-        printf("Warning: stress_snapshot disabled due to active workers\n");
-        return success;
-      }
-    }
-
-    static constexpr bool kClearRecompilableData = true;
-    i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
-    i::Handle<i::Context> i_context = Utils::OpenHandle(*context);
-    // TODO(jgruber,v8:10500): Don't deoptimize once we support serialization
-    // of optimized code.
-    i::Deoptimizer::DeoptimizeAll(i_isolate);
-    i::Snapshot::ClearReconstructableDataForSerialization(
-        i_isolate, kClearRecompilableData);
-    i::Snapshot::SerializeDeserializeAndVerifyForTesting(i_isolate, i_context);
-  }
   return success;
 }
+
 void Shell::CollectGarbage(Isolate* isolate) {
   if (options.send_idle_notification) {
     isolate->ContextDisposedNotification();
@@ -5134,11 +5231,6 @@ void Shell::CollectGarbage(Isolate* isolate) {
   }
 }
 
-void Shell::SetWaitUntilDone(Isolate* isolate, bool value) {
-  base::MutexGuard guard(isolate_status_lock_.Pointer());
-  isolate_status_[isolate] = value;
-}
-
 void Shell::NotifyStartStreamingTask(Isolate* isolate) {
   DCHECK(options.streaming_compile);
   base::MutexGuard guard(isolate_status_lock_.Pointer());
@@ -5215,10 +5307,8 @@ bool ProcessMessages(
 bool Shell::CompleteMessageLoop(Isolate* isolate) {
   auto get_waiting_behaviour = [isolate]() {
     base::MutexGuard guard(isolate_status_lock_.Pointer());
-    DCHECK_GT(isolate_status_.count(isolate), 0);
     bool should_wait = (options.wait_for_background_tasks &&
                         isolate->HasPendingBackgroundTasks()) ||
-                       isolate_status_[isolate] ||
                        isolate_running_streaming_tasks_[isolate] > 0;
     return should_wait ? platform::MessageLoopBehavior::kWaitForWork
                        : platform::MessageLoopBehavior::kDoNotWait;
@@ -5606,6 +5696,16 @@ int Shell::Main(int argc, char* argv[]) {
 
   v8::V8::InitializeICUDefaultLocation(argv[0], options.icu_data_file);
 
+#ifdef V8_OS_DARWIN
+  if (options.apply_priority) {
+    struct task_category_policy category = {.role =
+                                                TASK_FOREGROUND_APPLICATION};
+    task_policy_set(mach_task_self(), TASK_CATEGORY_POLICY,
+                    (task_policy_t)&category, TASK_CATEGORY_POLICY_COUNT);
+    pthread_set_qos_class_self_np(QOS_CLASS_USER_INTERACTIVE, 0);
+  }
+#endif
+
 #ifdef V8_INTL_SUPPORT
   if (options.icu_locale != nullptr) {
     icu::Locale locale(options.icu_locale);
@@ -5666,9 +5766,17 @@ int Shell::Main(int argc, char* argv[]) {
   }
 
   platform::tracing::TracingController* tracing_controller = tracing.get();
-  g_platform = v8::platform::NewDefaultPlatform(
-      options.thread_pool_size, v8::platform::IdleTaskSupport::kEnabled,
-      in_process_stack_dumping, std::move(tracing));
+  if (i::v8_flags.single_threaded) {
+    g_platform = v8::platform::NewSingleThreadedDefaultPlatform(
+        v8::platform::IdleTaskSupport::kEnabled, in_process_stack_dumping,
+        std::move(tracing));
+  } else {
+    g_platform = v8::platform::NewDefaultPlatform(
+        options.thread_pool_size, v8::platform::IdleTaskSupport::kEnabled,
+        in_process_stack_dumping, std::move(tracing),
+        options.apply_priority ? v8::platform::PriorityMode::kApply
+                               : v8::platform::PriorityMode::kDontApply);
+  }
   g_default_platform = g_platform.get();
   if (i::v8_flags.predictable) {
     g_platform = MakePredictablePlatform(std::move(g_platform));
@@ -5845,32 +5953,32 @@ int Shell::Main(int argc, char* argv[]) {
           result = RunMain(isolate, last_run);
         }
       } else if (options.code_cache_options != ShellOptions::kNoProduceCache) {
-        {
-          // Park the main thread here in case the new isolate wants to perform
-          // a shared GC to prevent a deadlock.
-          i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
-          i::ParkedScope parked(i_isolate->main_thread_local_isolate());
-
-          printf("============ Run: Produce code cache ============\n");
-          // First run to produce the cache
-          Isolate::CreateParams create_params2;
-          create_params2.array_buffer_allocator = Shell::array_buffer_allocator;
-          // Use a different hash seed.
-          i::v8_flags.hash_seed = i::v8_flags.hash_seed ^ 1337;
-          Isolate* isolate2 = Isolate::New(create_params2);
-          // Restore old hash seed.
-          i::v8_flags.hash_seed = i::v8_flags.hash_seed ^ 1337;
-          {
-            Isolate::Scope isolate_scope(isolate2);
-            D8Console console2(isolate2);
-            Initialize(isolate2, &console2);
-            PerIsolateData data2(isolate2);
-
-            result = RunMain(isolate2, false);
-            ResetOnProfileEndListener(isolate2);
-          }
-          isolate2->Dispose();
-        }
+        // Park the main thread here in case the new isolate wants to perform
+        // a shared GC to prevent a deadlock.
+        reinterpret_cast<i::Isolate*>(isolate)
+            ->main_thread_local_isolate()
+            ->BlockMainThreadWhileParked([&result]() {
+              printf("============ Run: Produce code cache ============\n");
+              // First run to produce the cache
+              Isolate::CreateParams create_params2;
+              create_params2.array_buffer_allocator =
+                  Shell::array_buffer_allocator;
+              // Use a different hash seed.
+              i::v8_flags.hash_seed = i::v8_flags.hash_seed ^ 1337;
+              Isolate* isolate2 = Isolate::New(create_params2);
+              // Restore old hash seed.
+              i::v8_flags.hash_seed = i::v8_flags.hash_seed ^ 1337;
+              {
+                Isolate::Scope isolate_scope(isolate2);
+                D8Console console2(isolate2);
+                Initialize(isolate2, &console2);
+                PerIsolateData data2(isolate2);
+
+                result = RunMain(isolate2, false);
+                ResetOnProfileEndListener(isolate2);
+              }
+              isolate2->Dispose();
+            });
 
         // Change the options to consume cache
         DCHECK(options.compile_options == v8::ScriptCompiler::kEagerCompile ||
diff --git a/deps/v8/src/d8/d8.h b/deps/v8/src/d8/d8.h
index 2ba3b239b3a148..411a51e351ac2f 100644
--- a/deps/v8/src/d8/d8.h
+++ b/deps/v8/src/d8/d8.h
@@ -207,7 +207,8 @@ class Worker : public std::enable_shared_from_this<Worker> {
 
   // Start running the given worker in another thread.
   static bool StartWorkerThread(Isolate* requester,
-                                std::shared_ptr<Worker> worker);
+                                std::shared_ptr<Worker> worker,
+                                base::Thread::Priority priority);
 
  private:
   friend class ProcessMessageTask;
@@ -227,8 +228,9 @@ class Worker : public std::enable_shared_from_this<Worker> {
 
   class WorkerThread : public base::Thread {
    public:
-    explicit WorkerThread(std::shared_ptr<Worker> worker)
-        : base::Thread(base::Thread::Options("WorkerThread")),
+    explicit WorkerThread(std::shared_ptr<Worker> worker,
+                          base::Thread::Priority priority)
+        : base::Thread(base::Thread::Options("WorkerThread", priority)),
           worker_(std::move(worker)) {}
 
     void Run() override;
@@ -238,7 +240,7 @@ class Worker : public std::enable_shared_from_this<Worker> {
   };
 
   void ExecuteInThread();
-  static void PostMessageOut(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void PostMessageOut(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   i::ParkingSemaphore out_semaphore_{0};
   SerializationDataQueue out_queue_;
@@ -343,7 +345,7 @@ class PerIsolateData {
   Global<FunctionTemplate> test_api_object_ctor_;
   Global<FunctionTemplate> dom_node_ctor_;
 
-  int RealmIndexOrThrow(const v8::FunctionCallbackInfo<v8::Value>& args,
+  int RealmIndexOrThrow(const v8::FunctionCallbackInfo<v8::Value>& info,
                         int arg_offset);
   int RealmFind(Local<Context> context);
 };
@@ -448,6 +450,7 @@ class ShellOptions {
   DisallowReassignment<int> read_from_tcp_port = {"read-from-tcp-port", -1};
   DisallowReassignment<bool> enable_os_system = {"enable-os-system", false};
   DisallowReassignment<bool> quiet_load = {"quiet-load", false};
+  DisallowReassignment<bool> apply_priority = {"apply-priority", true};
   DisallowReassignment<int> thread_pool_size = {"thread-pool-size", 0};
   DisallowReassignment<bool> stress_delay_tasks = {"stress-delay-tasks", false};
   std::vector<const char*> arguments;
@@ -472,10 +475,6 @@ class ShellOptions {
   DisallowReassignment<bool> enable_sandbox_crash_filter = {
       "enable-sandbox-crash-filter", false};
 #endif  // V8_ENABLE_SANDBOX
-  DisallowReassignment<bool> throw_on_failed_access_check = {
-      "throw-on-failed-access-check", false};
-  DisallowReassignment<bool> noop_on_failed_access_check = {
-      "noop-on-failed-access-check", false};
   DisallowReassignment<size_t> max_serializer_memory = {"max-serializer-memory",
                                                         1 * i::MB};
 };
@@ -534,58 +533,58 @@ class Shell : public i::AllStatic {
   static uint64_t GetTracingTimestampFromPerformanceTimestamp(
       double performance_timestamp);
 
-  static void PerformanceNow(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void PerformanceMark(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void PerformanceNow(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void PerformanceMark(const v8::FunctionCallbackInfo<v8::Value>& info);
   static void PerformanceMeasure(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   static void PerformanceMeasureMemory(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
 
-  static void RealmCurrent(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void RealmOwner(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void RealmGlobal(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void RealmCreate(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void RealmNavigate(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void RealmCurrent(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void RealmOwner(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void RealmGlobal(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void RealmCreate(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void RealmNavigate(const v8::FunctionCallbackInfo<v8::Value>& info);
   static void RealmCreateAllowCrossRealmAccess(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   static void RealmDetachGlobal(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void RealmDispose(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void RealmSwitch(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void RealmEval(const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void RealmDispose(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void RealmSwitch(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void RealmEval(const v8::FunctionCallbackInfo<v8::Value>& info);
   static void RealmSharedGet(Local<String> property,
                              const PropertyCallbackInfo<Value>& info);
   static void RealmSharedSet(Local<String> property, Local<Value> value,
                              const PropertyCallbackInfo<void>& info);
 
-  static void LogGetAndStop(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void LogGetAndStop(const v8::FunctionCallbackInfo<v8::Value>& info);
   static void TestVerifySourcePositions(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static void InstallConditionalFeatures(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static void AsyncHooksCreateHook(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   static void AsyncHooksExecutionAsyncId(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   static void AsyncHooksTriggerAsyncId(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
 
-  static void SetPromiseHooks(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void SetPromiseHooks(const v8::FunctionCallbackInfo<v8::Value>& info);
 
-  static void EnableDebugger(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void DisableDebugger(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void EnableDebugger(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void DisableDebugger(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static void SerializerSerialize(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   static void SerializerDeserialize(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static void ProfilerSetOnProfileEndListener(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   static void ProfilerTriggerSample(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static bool HasOnProfileEndListener(Isolate* isolate);
 
@@ -594,45 +593,43 @@ class Shell : public i::AllStatic {
 
   static void ResetOnProfileEndListener(Isolate* isolate);
 
-  static void Print(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void PrintErr(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void WriteStdout(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void WaitUntilDone(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void NotifyDone(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void QuitOnce(v8::FunctionCallbackInfo<v8::Value>* args);
-  static void Quit(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void Terminate(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void Version(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void WriteFile(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void ReadFile(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void Print(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void PrintErr(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void WriteStdout(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void WaitUntilDone(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void NotifyDone(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void QuitOnce(v8::FunctionCallbackInfo<v8::Value>* info);
+  static void Quit(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void Terminate(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void Version(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void WriteFile(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void ReadFile(const v8::FunctionCallbackInfo<v8::Value>& info);
   static char* ReadChars(const char* name, int* size_out);
   static MaybeLocal<PrimitiveArray> ReadLines(Isolate* isolate,
                                               const char* name);
-  static void ReadBuffer(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void ReadBuffer(const v8::FunctionCallbackInfo<v8::Value>& info);
   static Local<String> ReadFromStdin(Isolate* isolate);
-  static void ReadLine(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    args.GetReturnValue().Set(ReadFromStdin(args.GetIsolate()));
-  }
+  static void ReadLine(const v8::FunctionCallbackInfo<v8::Value>& info);
   static void WriteChars(const char* name, uint8_t* buffer, size_t buffer_size);
-  static void ExecuteFile(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void SetTimeout(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void ExecuteFile(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void SetTimeout(const v8::FunctionCallbackInfo<v8::Value>& info);
   static void ReadCodeTypeAndArguments(
-      const v8::FunctionCallbackInfo<v8::Value>& args, int index,
+      const v8::FunctionCallbackInfo<v8::Value>& info, int index,
       CodeType* code_type, Local<Value>* arguments = nullptr);
   static bool FunctionAndArgumentsToString(Local<Function> function,
                                            Local<Value> arguments,
                                            Local<String>* source,
                                            Isolate* isolate);
   static MaybeLocal<String> ReadSource(
-      const v8::FunctionCallbackInfo<v8::Value>& args, int index,
+      const v8::FunctionCallbackInfo<v8::Value>& info, int index,
       CodeType default_type);
-  static void WorkerNew(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void WorkerNew(const v8::FunctionCallbackInfo<v8::Value>& info);
   static void WorkerPostMessage(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void WorkerGetMessage(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void WorkerTerminate(const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void WorkerGetMessage(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void WorkerTerminate(const v8::FunctionCallbackInfo<v8::Value>& info);
   static void WorkerTerminateAndWait(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   // The OS object on the global object contains methods for performing
   // operating system calls:
   //
@@ -646,26 +643,26 @@ class Shell : public i::AllStatic {
   // milliseconds on the total running time of the program.  Exceptions are
   // thrown on timeouts or other errors or if the exit status of the program
   // indicates an error.
-  static void System(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void System(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   // os.chdir(dir) changes directory to the given directory.  Throws an
   // exception/ on error.
-  static void ChangeDirectory(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void ChangeDirectory(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   // os.setenv(variable, value) sets an environment variable.  Repeated calls to
   // this method leak memory due to the API of setenv in the standard C library.
-  static void SetEnvironment(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void UnsetEnvironment(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void SetEnvironment(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void UnsetEnvironment(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   // os.umask(alue) calls the umask system call and returns the old umask.
-  static void SetUMask(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void SetUMask(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   // os.mkdirp(name, mask) creates a directory.  The mask (if present) is anded
   // with the current umask.  Intermediate directories are created if necessary.
   // An exception is not thrown if the directory already exists.  Analogous to
   // the "mkdir -p" command.
-  static void MakeDirectory(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void RemoveDirectory(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void MakeDirectory(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void RemoveDirectory(const v8::FunctionCallbackInfo<v8::Value>& info);
   static MaybeLocal<Promise> HostImportModuleDynamically(
       Local<Context> context, Local<Data> host_defined_options,
       Local<Value> resource_name, Local<String> specifier,
@@ -682,7 +679,7 @@ class Shell : public i::AllStatic {
       Local<Context> initiator_context);
 
 #ifdef V8_FUZZILLI
-  static void Fuzzilli(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void Fuzzilli(const v8::FunctionCallbackInfo<v8::Value>& info);
 #endif  // V8_FUZZILLI
 
   // Data is of type DynamicImportData*. We use void* here to be able
@@ -760,10 +757,10 @@ class Shell : public i::AllStatic {
   static Counter* GetCounter(const char* name, bool is_histogram);
   static Local<String> Stringify(Isolate* isolate, Local<Value> value);
   static void RunShell(Isolate* isolate);
-  static bool RunMainIsolate(Isolate* isolate, bool last_run);
+  static bool RunMainIsolate(Isolate* isolate, bool keep_context_alive);
   static bool SetOptions(int argc, char* argv[]);
 
-  static void NodeTypeCallback(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void NodeTypeCallback(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static Local<FunctionTemplate> CreateEventTargetTemplate(Isolate* isolate);
   static Local<FunctionTemplate> CreateNodeTemplates(
@@ -781,9 +778,9 @@ class Shell : public i::AllStatic {
       Isolate* isolate);
 
   static MaybeLocal<Context> CreateRealm(
-      const v8::FunctionCallbackInfo<v8::Value>& args, int index,
+      const v8::FunctionCallbackInfo<v8::Value>& info, int index,
       v8::MaybeLocal<Value> global_object);
-  static void DisposeRealm(const v8::FunctionCallbackInfo<v8::Value>& args,
+  static void DisposeRealm(const v8::FunctionCallbackInfo<v8::Value>& info,
                            int index);
   static MaybeLocal<Module> FetchModuleTree(v8::Local<v8::Module> origin_module,
                                             v8::Local<v8::Context> context,
diff --git a/deps/v8/src/date/date.h b/deps/v8/src/date/date.h
index 467ba8802df141..b2facb39504658 100644
--- a/deps/v8/src/date/date.h
+++ b/deps/v8/src/date/date.h
@@ -156,7 +156,7 @@ class V8_EXPORT_PRIVATE DateCache {
   // We increment the stamp each time when the timezone information changes.
   // JSDate objects perform stamp check and invalidate their caches if
   // their saved stamp is not equal to the current stamp.
-  Smi stamp() { return stamp_; }
+  Tagged<Smi> stamp() { return stamp_; }
   void* stamp_address() { return &stamp_; }
 
   // These functions are virtual so that we can override them when testing.
diff --git a/deps/v8/src/debug/debug-coverage.cc b/deps/v8/src/debug/debug-coverage.cc
index fa598f46504336..e28ae287cb027c 100644
--- a/deps/v8/src/debug/debug-coverage.cc
+++ b/deps/v8/src/debug/debug-coverage.cc
@@ -23,7 +23,7 @@ class SharedToCounterMap
                                        base::DefaultAllocationPolicy> {
  public:
   using Entry = base::TemplateHashMapEntry<SharedFunctionInfo, uint32_t>;
-  inline void Add(SharedFunctionInfo key, uint32_t count) {
+  inline void Add(Tagged<SharedFunctionInfo> key, uint32_t count) {
     Entry* entry = LookupOrInsert(key, Hash(key), []() { return 0; });
     uint32_t old_count = entry->value;
     if (UINT32_MAX - count < old_count) {
@@ -33,14 +33,14 @@ class SharedToCounterMap
     }
   }
 
-  inline uint32_t Get(SharedFunctionInfo key) {
+  inline uint32_t Get(Tagged<SharedFunctionInfo> key) {
     Entry* entry = Lookup(key, Hash(key));
     if (entry == nullptr) return 0;
     return entry->value;
   }
 
  private:
-  static uint32_t Hash(SharedFunctionInfo key) {
+  static uint32_t Hash(Tagged<SharedFunctionInfo> key) {
     return static_cast<uint32_t>(key.ptr());
   }
 
@@ -48,9 +48,9 @@ class SharedToCounterMap
 };
 
 namespace {
-int StartPosition(SharedFunctionInfo info) {
-  int start = info.function_token_position();
-  if (start == kNoSourcePosition) start = info.StartPosition();
+int StartPosition(Tagged<SharedFunctionInfo> info) {
+  int start = info->function_token_position();
+  if (start == kNoSourcePosition) start = info->StartPosition();
   return start;
 }
 
@@ -66,19 +66,20 @@ void SortBlockData(std::vector<CoverageBlock>& v) {
   std::sort(v.begin(), v.end(), CompareCoverageBlock);
 }
 
-std::vector<CoverageBlock> GetSortedBlockData(SharedFunctionInfo shared) {
-  DCHECK(shared.HasCoverageInfo());
+std::vector<CoverageBlock> GetSortedBlockData(
+    Isolate* isolate, Tagged<SharedFunctionInfo> shared) {
+  DCHECK(shared->HasCoverageInfo(isolate));
 
-  CoverageInfo coverage_info =
-      CoverageInfo::cast(shared.GetDebugInfo().coverage_info());
+  Tagged<CoverageInfo> coverage_info =
+      CoverageInfo::cast(shared->GetDebugInfo(isolate)->coverage_info());
 
   std::vector<CoverageBlock> result;
-  if (coverage_info.slot_count() == 0) return result;
+  if (coverage_info->slot_count() == 0) return result;
 
-  for (int i = 0; i < coverage_info.slot_count(); i++) {
-    const int start_pos = coverage_info.slots_start_source_position(i);
-    const int until_pos = coverage_info.slots_end_source_position(i);
-    const int count = coverage_info.slots_block_count(i);
+  for (int i = 0; i < coverage_info->slot_count(); i++) {
+    const int start_pos = coverage_info->slots_start_source_position(i);
+    const int until_pos = coverage_info->slots_end_source_position(i);
+    const int count = coverage_info->slots_block_count(i);
 
     DCHECK_NE(kNoSourcePosition, start_pos);
     result.emplace_back(start_pos, until_pos, count);
@@ -378,14 +379,14 @@ void ClampToBinary(CoverageFunction* function) {
   }
 }
 
-void ResetAllBlockCounts(SharedFunctionInfo shared) {
-  DCHECK(shared.HasCoverageInfo());
+void ResetAllBlockCounts(Isolate* isolate, Tagged<SharedFunctionInfo> shared) {
+  DCHECK(shared->HasCoverageInfo(isolate));
 
-  CoverageInfo coverage_info =
-      CoverageInfo::cast(shared.GetDebugInfo().coverage_info());
+  Tagged<CoverageInfo> coverage_info =
+      CoverageInfo::cast(shared->GetDebugInfo(isolate)->coverage_info());
 
-  for (int i = 0; i < coverage_info.slot_count(); i++) {
-    coverage_info.ResetBlockCount(i);
+  for (int i = 0; i < coverage_info->slot_count(); i++) {
+    coverage_info->ResetBlockCount(i);
   }
 }
 
@@ -409,8 +410,8 @@ bool IsBinaryMode(debug::CoverageMode mode) {
   }
 }
 
-void CollectBlockCoverageInternal(CoverageFunction* function,
-                                  SharedFunctionInfo info,
+void CollectBlockCoverageInternal(Isolate* isolate, CoverageFunction* function,
+                                  Tagged<SharedFunctionInfo> info,
                                   debug::CoverageMode mode) {
   DCHECK(IsBlockMode(mode));
 
@@ -419,7 +420,7 @@ void CollectBlockCoverageInternal(CoverageFunction* function,
   if (!function->HasNonEmptySourceRange()) return;
 
   function->has_block_coverage = true;
-  function->blocks = GetSortedBlockData(info);
+  function->blocks = GetSortedBlockData(isolate, info);
 
   // If in binary mode, only report counts of 0/1.
   if (mode == debug::CoverageMode::kBlockBinary) ClampToBinary(function);
@@ -467,16 +468,18 @@ void CollectBlockCoverageInternal(CoverageFunction* function,
   FilterEmptyRanges(function);
 }
 
-void CollectBlockCoverage(CoverageFunction* function, SharedFunctionInfo info,
+void CollectBlockCoverage(Isolate* isolate, CoverageFunction* function,
+                          Tagged<SharedFunctionInfo> info,
                           debug::CoverageMode mode) {
-  CollectBlockCoverageInternal(function, info, mode);
+  CollectBlockCoverageInternal(isolate, function, info, mode);
 
   // Reset all counters on the DebugInfo to zero.
-  ResetAllBlockCounts(info);
+  ResetAllBlockCounts(isolate, info);
 }
 
 void PrintBlockCoverage(const CoverageFunction* function,
-                        SharedFunctionInfo info, bool has_nonempty_source_range,
+                        Tagged<SharedFunctionInfo> info,
+                        bool has_nonempty_source_range,
                         bool function_is_relevant) {
   DCHECK(v8_flags.trace_block_coverage);
   std::unique_ptr<char[]> function_name =
@@ -506,49 +509,43 @@ void CollectAndMaybeResetCounts(Isolate* isolate,
     case v8::debug::CoverageMode::kPreciseBinary:
     case v8::debug::CoverageMode::kPreciseCount: {
       // Feedback vectors are already listed to prevent losing them to GC.
-      DCHECK(isolate->factory()
-                 ->feedback_vectors_for_profiling_tools()
-                 ->IsArrayList());
+      DCHECK(IsArrayList(
+          *isolate->factory()->feedback_vectors_for_profiling_tools()));
       Handle<ArrayList> list = Handle<ArrayList>::cast(
           isolate->factory()->feedback_vectors_for_profiling_tools());
       for (int i = 0; i < list->Length(); i++) {
-        FeedbackVector vector = FeedbackVector::cast(list->Get(i));
-        SharedFunctionInfo shared = vector.shared_function_info();
-        DCHECK(shared.IsSubjectToDebugging());
-        uint32_t count = static_cast<uint32_t>(vector.invocation_count());
-        if (reset_count) vector.clear_invocation_count(kRelaxedStore);
+        Tagged<FeedbackVector> vector = FeedbackVector::cast(list->Get(i));
+        Tagged<SharedFunctionInfo> shared = vector->shared_function_info();
+        DCHECK(shared->IsSubjectToDebugging());
+        uint32_t count = static_cast<uint32_t>(vector->invocation_count());
+        if (reset_count) vector->clear_invocation_count(kRelaxedStore);
         counter_map->Add(shared, count);
       }
       break;
     }
     case v8::debug::CoverageMode::kBestEffort: {
-      DCHECK(!isolate->factory()
-                  ->feedback_vectors_for_profiling_tools()
-                  ->IsArrayList());
+      DCHECK(!IsArrayList(
+          *isolate->factory()->feedback_vectors_for_profiling_tools()));
       DCHECK_EQ(v8::debug::CoverageMode::kBestEffort, coverage_mode);
       AllowGarbageCollection allow_gc;
       HeapObjectIterator heap_iterator(isolate->heap());
-      for (HeapObject current_obj = heap_iterator.Next();
+      for (Tagged<HeapObject> current_obj = heap_iterator.Next();
            !current_obj.is_null(); current_obj = heap_iterator.Next()) {
-        if (!current_obj.IsJSFunction()) continue;
-        JSFunction func = JSFunction::cast(current_obj);
-        SharedFunctionInfo shared = func.shared();
-        if (!shared.IsSubjectToDebugging()) continue;
-        if (!(func.has_feedback_vector() ||
-              func.has_closure_feedback_cell_array())) {
+        if (!IsJSFunction(current_obj)) continue;
+        Tagged<JSFunction> func = JSFunction::cast(current_obj);
+        Tagged<SharedFunctionInfo> shared = func->shared();
+        if (!shared->IsSubjectToDebugging()) continue;
+        if (!(func->has_feedback_vector() ||
+              func->has_closure_feedback_cell_array())) {
           continue;
         }
         uint32_t count = 0;
-        if (func.has_feedback_vector()) {
-          count =
-              static_cast<uint32_t>(func.feedback_vector().invocation_count());
-        } else if (func.raw_feedback_cell().interrupt_budget() <
-                   v8_flags.interrupt_budget_for_feedback_allocation) {
-          // TODO(jgruber): The condition above is no longer precise since we
-          // may use either the fixed interrupt_budget or
-          // v8_flags.interrupt_budget_factor_for_feedback_allocation. If the
-          // latter, we may incorrectly set a count of 1.
-          //
+        if (func->has_feedback_vector()) {
+          count = static_cast<uint32_t>(
+              func->feedback_vector()->invocation_count());
+        } else if (func->shared()->HasBytecodeArray() &&
+                   func->raw_feedback_cell()->interrupt_budget() <
+                       TieringManager::InterruptBudgetFor(isolate, func, {})) {
           // We haven't allocated feedback vector, but executed the function
           // atleast once. We don't have precise invocation count here.
           count = 1;
@@ -561,7 +558,7 @@ void CollectAndMaybeResetCounts(Isolate* isolate,
       // vector wasn't allocated yet and the function's interrupt budget wasn't
       // updated (i.e. it didn't execute return / jump).
       for (JavaScriptStackFrameIterator it(isolate); !it.done(); it.Advance()) {
-        SharedFunctionInfo shared = it.frame()->function().shared();
+        Tagged<SharedFunctionInfo> shared = it.frame()->function()->shared();
         if (counter_map->Get(shared) != 0) continue;
         counter_map->Add(shared, 1);
       }
@@ -635,9 +632,9 @@ std::unique_ptr<Coverage> Coverage::Collect(
 
   std::vector<Handle<Script>> scripts;
   Script::Iterator scriptIt(isolate);
-  for (Script script = scriptIt.Next(); !script.is_null();
+  for (Tagged<Script> script = scriptIt.Next(); !script.is_null();
        script = scriptIt.Next()) {
-    if (script.IsUserJavaScript()) scripts.push_back(handle(script, isolate));
+    if (script->IsUserJavaScript()) scripts.push_back(handle(script, isolate));
   }
 
   for (Handle<Script> script : scripts) {
@@ -650,7 +647,7 @@ std::unique_ptr<Coverage> Coverage::Collect(
     {
       // Sort functions by start position, from outer to inner functions.
       SharedFunctionInfo::ScriptIterator infos(isolate, *script);
-      for (SharedFunctionInfo info = infos.Next(); !info.is_null();
+      for (Tagged<SharedFunctionInfo> info = infos.Next(); !info.is_null();
            info = infos.Next()) {
         sorted.emplace_back(handle(info, isolate), counter_map.Get(info));
       }
@@ -716,8 +713,8 @@ std::unique_ptr<Coverage> Coverage::Collect(
       Handle<String> name = SharedFunctionInfo::DebugName(isolate, info);
       CoverageFunction function(start, end, count, name);
 
-      if (IsBlockMode(collectionMode) && info->HasCoverageInfo()) {
-        CollectBlockCoverage(&function, *info, collectionMode);
+      if (IsBlockMode(collectionMode) && info->HasCoverageInfo(isolate)) {
+        CollectBlockCoverage(isolate, &function, *info, collectionMode);
       }
 
       // Only include a function range if itself or its parent function is
@@ -785,30 +782,30 @@ void Coverage::SelectMode(Isolate* isolate, debug::CoverageMode mode) {
       std::vector<Handle<JSFunction>> funcs_needing_feedback_vector;
       {
         HeapObjectIterator heap_iterator(isolate->heap());
-        for (HeapObject o = heap_iterator.Next(); !o.is_null();
+        for (Tagged<HeapObject> o = heap_iterator.Next(); !o.is_null();
              o = heap_iterator.Next()) {
-          if (o.IsJSFunction()) {
-            JSFunction func = JSFunction::cast(o);
-            if (func.has_closure_feedback_cell_array()) {
+          if (IsJSFunction(o)) {
+            Tagged<JSFunction> func = JSFunction::cast(o);
+            if (func->has_closure_feedback_cell_array()) {
               funcs_needing_feedback_vector.push_back(
                   Handle<JSFunction>(func, isolate));
             }
-          } else if (IsBinaryMode(mode) && o.IsSharedFunctionInfo()) {
+          } else if (IsBinaryMode(mode) && IsSharedFunctionInfo(o)) {
             // If collecting binary coverage, reset
             // SFI::has_reported_binary_coverage to avoid optimizing / inlining
             // functions before they have reported coverage.
-            SharedFunctionInfo shared = SharedFunctionInfo::cast(o);
-            shared.set_has_reported_binary_coverage(false);
-          } else if (o.IsFeedbackVector()) {
+            Tagged<SharedFunctionInfo> shared = SharedFunctionInfo::cast(o);
+            shared->set_has_reported_binary_coverage(false);
+          } else if (IsFeedbackVector(o)) {
             // In any case, clear any collected invocation counts.
-            FeedbackVector::cast(o).clear_invocation_count(kRelaxedStore);
+            FeedbackVector::cast(o)->clear_invocation_count(kRelaxedStore);
           }
         }
       }
 
       for (Handle<JSFunction> func : funcs_needing_feedback_vector) {
         IsCompiledScope is_compiled_scope(
-            func->shared().is_compiled_scope(isolate));
+            func->shared()->is_compiled_scope(isolate));
         CHECK(is_compiled_scope.is_compiled());
         JSFunction::EnsureFeedbackVector(isolate, func, &is_compiled_scope);
       }
diff --git a/deps/v8/src/debug/debug-coverage.h b/deps/v8/src/debug/debug-coverage.h
index bb0922f504cd65..32f9f715a65b6b 100644
--- a/deps/v8/src/debug/debug-coverage.h
+++ b/deps/v8/src/debug/debug-coverage.h
@@ -63,7 +63,8 @@ class Coverage : public std::vector<CoverageScript> {
   static std::unique_ptr<Coverage> CollectBestEffort(Isolate* isolate);
 
   // Select code coverage mode.
-  static void SelectMode(Isolate* isolate, debug::CoverageMode mode);
+  V8_EXPORT_PRIVATE static void SelectMode(Isolate* isolate,
+                                           debug::CoverageMode mode);
 
  private:
   static std::unique_ptr<Coverage> Collect(
diff --git a/deps/v8/src/debug/debug-evaluate.cc b/deps/v8/src/debug/debug-evaluate.cc
index 48349f193dce82..ab4843c7cc1c24 100644
--- a/deps/v8/src/debug/debug-evaluate.cc
+++ b/deps/v8/src/debug/debug-evaluate.cc
@@ -76,7 +76,7 @@ MaybeHandle<Object> DebugEvaluate::Global(Isolate* isolate,
   }
   // TODO(cbruni, 1244145): Use host-defined options from script context.
   Handle<FixedArray> host_defined_options(
-      Script::cast(function->shared().script()).host_defined_options(),
+      Script::cast(function->shared()->script())->host_defined_options(),
       isolate);
   MaybeHandle<Object> result = Execution::CallScript(
       isolate, function, Handle<JSObject>(context->global_proxy(), isolate),
@@ -101,7 +101,7 @@ MaybeHandle<Object> DebugEvaluate::Local(Isolate* isolate,
   if (it.is_wasm()) {
     WasmFrame* frame = WasmFrame::cast(it.frame());
     Handle<SharedFunctionInfo> outer_info(
-        isolate->native_context()->empty_function().shared(), isolate);
+        isolate->native_context()->empty_function()->shared(), isolate);
     Handle<JSObject> context_extension = GetWasmDebugProxy(frame);
     Handle<ScopeInfo> scope_info =
         ScopeInfo::CreateForWithScope(isolate, Handle<ScopeInfo>::null());
@@ -141,7 +141,7 @@ MaybeHandle<Object> DebugEvaluate::WithTopmostArguments(Isolate* isolate,
 
   // Get context and receiver.
   Handle<Context> native_context(
-      Context::cast(it.frame()->context()).native_context(), isolate);
+      Context::cast(it.frame()->context())->native_context(), isolate);
 
   // Materialize arguments as property on an extension object.
   Handle<JSObject> materialized = factory->NewSlowJSObjectWithNullProto();
@@ -153,8 +153,8 @@ MaybeHandle<Object> DebugEvaluate::WithTopmostArguments(Isolate* isolate,
 
   // Materialize receiver.
   Handle<Object> this_value(it.frame()->receiver(), isolate);
-  DCHECK_EQ(it.frame()->IsConstructor(), this_value->IsTheHole(isolate));
-  if (!this_value->IsTheHole(isolate)) {
+  DCHECK_EQ(it.frame()->IsConstructor(), IsTheHole(*this_value, isolate));
+  if (!IsTheHole(*this_value, isolate)) {
     Handle<String> this_str = factory->this_string();
     JSObject::SetOwnPropertyIgnoreAttributes(materialized, this_str, this_value,
                                              NONE)
@@ -168,7 +168,7 @@ MaybeHandle<Object> DebugEvaluate::WithTopmostArguments(Isolate* isolate,
   Handle<Context> evaluation_context = factory->NewDebugEvaluateContext(
       native_context, scope_info, materialized, Handle<Context>());
   Handle<SharedFunctionInfo> outer_info(
-      native_context->empty_function().shared(), isolate);
+      native_context->empty_function()->shared(), isolate);
   Handle<JSObject> receiver(native_context->global_proxy(), isolate);
   const bool throw_on_side_effect = false;
   MaybeHandle<Object> maybe_result =
@@ -253,7 +253,7 @@ DebugEvaluate::ContextBuilder::ContextBuilder(Isolate* isolate,
   }
 
   Handle<ScopeInfo> scope_info =
-      evaluation_context_->IsNativeContext()
+      IsNativeContext(*evaluation_context_)
           ? Handle<ScopeInfo>::null()
           : handle(evaluation_context_->scope_info(), isolate);
   for (auto rit = context_chain_.rbegin(); rit != context_chain_.rend();
@@ -273,10 +273,10 @@ DebugEvaluate::ContextBuilder::ContextBuilder(Isolate* isolate,
       // and also associate the temporary scope_info we create here with that
       // blocklist.
       Handle<ScopeInfo> function_scope_info = handle(
-          frame_inspector_.GetFunction()->shared().scope_info(), isolate_);
+          frame_inspector_.GetFunction()->shared()->scope_info(), isolate_);
       Handle<Object> block_list = handle(
           isolate_->LocalsBlockListCacheGet(function_scope_info), isolate_);
-      CHECK(block_list->IsStringSet());
+      CHECK(IsStringSet(*block_list));
       isolate_->LocalsBlockListCacheSet(scope_info, Handle<ScopeInfo>::null(),
                                         Handle<StringSet>::cast(block_list));
     }
@@ -298,7 +298,7 @@ void DebugEvaluate::ContextBuilder::UpdateValues() {
               .ToHandleChecked();
 
       for (int i = 0; i < keys->length(); i++) {
-        DCHECK(keys->get(i).IsString());
+        DCHECK(IsString(keys->get(i)));
         Handle<String> key(String::cast(keys->get(i)), isolate_);
         Handle<Object> value = JSReceiver::GetDataProperty(
             isolate_, element.materialized_object, key);
@@ -312,103 +312,102 @@ void DebugEvaluate::ContextBuilder::UpdateValues() {
 // static
 bool DebugEvaluate::IsSideEffectFreeIntrinsic(Runtime::FunctionId id) {
 // Use macro to include only the non-inlined version of an intrinsic.
-#define INTRINSIC_ALLOWLIST(V)                \
-  /* Conversions */                           \
-  V(NumberToStringSlow)                       \
-  V(ToBigInt)                                 \
-  V(ToLength)                                 \
-  V(ToNumber)                                 \
-  V(ToObject)                                 \
-  V(ToString)                                 \
-  /* Type checks */                           \
-  V(IsArray)                                  \
-  V(IsFunction)                               \
-  V(IsJSProxy)                                \
-  V(IsJSReceiver)                             \
-  V(IsRegExp)                                 \
-  V(IsSmi)                                    \
-  /* Loads */                                 \
-  V(LoadLookupSlotForCall)                    \
-  V(GetProperty)                              \
-  /* Arrays */                                \
-  V(ArraySpeciesConstructor)                  \
-  V(HasFastPackedElements)                    \
-  V(NewArray)                                 \
-  V(NormalizeElements)                        \
-  V(TypedArrayGetBuffer)                      \
-  /* Errors */                                \
-  V(NewTypeError)                             \
-  V(ReThrow)                                  \
-  V(ThrowCalledNonCallable)                   \
-  V(ThrowInvalidStringLength)                 \
-  V(ThrowIteratorError)                       \
-  V(ThrowIteratorResultNotAnObject)           \
-  V(ThrowPatternAssignmentNonCoercible)       \
-  V(ThrowReferenceError)                      \
-  V(ThrowSymbolIteratorInvalid)               \
-  /* Strings */                               \
-  V(StringReplaceOneCharWithString)           \
-  V(StringSubstring)                          \
-  V(StringToNumber)                           \
-  /* BigInts */                               \
-  V(BigIntEqualToBigInt)                      \
-  V(BigIntToBoolean)                          \
-  V(BigIntToNumber)                           \
-  /* Literals */                              \
-  V(CreateArrayLiteral)                       \
-  V(CreateArrayLiteralWithoutAllocationSite)  \
-  V(CreateObjectLiteral)                      \
-  V(CreateObjectLiteralWithoutAllocationSite) \
-  V(CreateRegExpLiteral)                      \
-  V(DefineClass)                              \
-  /* Called from builtins */                  \
-  V(AllocateInYoungGeneration)                \
-  V(AllocateInOldGeneration)                  \
-  V(AllocateSeqOneByteString)                 \
-  V(AllocateSeqTwoByteString)                 \
-  V(ArrayIncludes_Slow)                       \
-  V(ArrayIndexOf)                             \
-  V(ArrayIsArray)                             \
-  V(GetFunctionName)                          \
-  V(GetOwnPropertyDescriptor)                 \
-  V(GlobalPrint)                              \
-  V(HasProperty)                              \
-  V(ObjectCreate)                             \
-  V(ObjectEntries)                            \
-  V(ObjectEntriesSkipFastPath)                \
-  V(ObjectHasOwnProperty)                     \
-  V(ObjectKeys)                               \
-  V(ObjectValues)                             \
-  V(ObjectValuesSkipFastPath)                 \
-  V(ObjectGetOwnPropertyNames)                \
-  V(ObjectGetOwnPropertyNamesTryFast)         \
-  V(ObjectIsExtensible)                       \
-  V(RegExpInitializeAndCompile)               \
-  V(StackGuard)                               \
-  V(StringAdd)                                \
-  V(StringCharCodeAt)                         \
-  V(StringEqual)                              \
-  V(StringParseFloat)                         \
-  V(StringParseInt)                           \
-  V(SymbolDescriptiveString)                  \
-  V(ThrowRangeError)                          \
-  V(ThrowTypeError)                           \
-  V(ToName)                                   \
-  V(TransitionElementsKind)                   \
-  /* Misc. */                                 \
-  V(Call)                                     \
-  V(CompleteInobjectSlackTrackingForMap)      \
-  V(HasInPrototypeChain)                      \
-  V(IncrementUseCounter)                      \
-  V(MaxSmi)                                   \
-  V(NewObject)                                \
-  V(StringMaxLength)                          \
-  V(StringToArray)                            \
-  V(AsyncFunctionEnter)                       \
-  V(AsyncFunctionResolve)                     \
-  /* Test */                                  \
-  V(GetOptimizationStatus)                    \
-  V(OptimizeFunctionOnNextCall)               \
+#define INTRINSIC_ALLOWLIST(V)           \
+  /* Conversions */                      \
+  V(NumberToStringSlow)                  \
+  V(ToBigInt)                            \
+  V(ToLength)                            \
+  V(ToNumber)                            \
+  V(ToObject)                            \
+  V(ToString)                            \
+  /* Type checks */                      \
+  V(IsArray)                             \
+  V(IsFunction)                          \
+  V(IsJSProxy)                           \
+  V(IsJSReceiver)                        \
+  V(IsRegExp)                            \
+  V(IsSmi)                               \
+  /* Loads */                            \
+  V(LoadLookupSlotForCall)               \
+  V(GetProperty)                         \
+  /* Arrays */                           \
+  V(ArraySpeciesConstructor)             \
+  V(HasFastPackedElements)               \
+  V(NewArray)                            \
+  V(NormalizeElements)                   \
+  V(TypedArrayGetBuffer)                 \
+  /* Errors */                           \
+  V(NewTypeError)                        \
+  V(ReThrow)                             \
+  V(ThrowCalledNonCallable)              \
+  V(ThrowInvalidStringLength)            \
+  V(ThrowIteratorError)                  \
+  V(ThrowIteratorResultNotAnObject)      \
+  V(ThrowPatternAssignmentNonCoercible)  \
+  V(ThrowReferenceError)                 \
+  V(ThrowSymbolIteratorInvalid)          \
+  /* Strings */                          \
+  V(StringReplaceOneCharWithString)      \
+  V(StringSubstring)                     \
+  V(StringToNumber)                      \
+  /* BigInts */                          \
+  V(BigIntEqualToBigInt)                 \
+  V(BigIntToBoolean)                     \
+  V(BigIntToNumber)                      \
+  /* Literals */                         \
+  V(CreateArrayLiteral)                  \
+  V(CreateObjectLiteral)                 \
+  V(CreateRegExpLiteral)                 \
+  V(DefineClass)                         \
+  /* Called from builtins */             \
+  V(AllocateInYoungGeneration)           \
+  V(AllocateInOldGeneration)             \
+  V(AllocateSeqOneByteString)            \
+  V(AllocateSeqTwoByteString)            \
+  V(ArrayIncludes_Slow)                  \
+  V(ArrayIndexOf)                        \
+  V(ArrayIsArray)                        \
+  V(GetFunctionName)                     \
+  V(GetOwnPropertyDescriptor)            \
+  V(GlobalPrint)                         \
+  V(HasProperty)                         \
+  V(ObjectCreate)                        \
+  V(ObjectEntries)                       \
+  V(ObjectEntriesSkipFastPath)           \
+  V(ObjectHasOwnProperty)                \
+  V(ObjectKeys)                          \
+  V(ObjectValues)                        \
+  V(ObjectValuesSkipFastPath)            \
+  V(ObjectGetOwnPropertyNames)           \
+  V(ObjectGetOwnPropertyNamesTryFast)    \
+  V(ObjectIsExtensible)                  \
+  V(RegExpInitializeAndCompile)          \
+  V(StackGuard)                          \
+  V(HandleNoHeapWritesInterrupts)        \
+  V(StringAdd)                           \
+  V(StringCharCodeAt)                    \
+  V(StringEqual)                         \
+  V(StringParseFloat)                    \
+  V(StringParseInt)                      \
+  V(SymbolDescriptiveString)             \
+  V(ThrowRangeError)                     \
+  V(ThrowTypeError)                      \
+  V(ToName)                              \
+  V(TransitionElementsKind)              \
+  /* Misc. */                            \
+  V(Call)                                \
+  V(CompleteInobjectSlackTrackingForMap) \
+  V(HasInPrototypeChain)                 \
+  V(IncrementUseCounter)                 \
+  V(MaxSmi)                              \
+  V(NewObject)                           \
+  V(StringMaxLength)                     \
+  V(StringToArray)                       \
+  V(AsyncFunctionEnter)                  \
+  V(AsyncFunctionResolve)                \
+  /* Test */                             \
+  V(GetOptimizationStatus)               \
+  V(OptimizeFunctionOnNextCall)          \
   V(OptimizeOsr)
 
 // Intrinsics with inline versions have to be allowlisted here a second time.
@@ -524,6 +523,7 @@ bool BytecodeHasNoSideEffect(interpreter::Bytecode bytecode) {
     case Bytecode::kToNumber:
     case Bytecode::kToNumeric:
     case Bytecode::kToString:
+    case Bytecode::kToBoolean:
     // Misc.
     case Bytecode::kIncBlockCounter:  // Coverage counters.
     case Bytecode::kForInEnumerate:
@@ -559,6 +559,7 @@ DebugInfo::SideEffectState BuiltinGetSideEffectState(Builtin id) {
     case Builtin::kObjectGetOwnPropertyNames:
     case Builtin::kObjectGetOwnPropertySymbols:
     case Builtin::kObjectGetPrototypeOf:
+    case Builtin::kObjectGroupBy:
     case Builtin::kObjectHasOwn:
     case Builtin::kObjectIs:
     case Builtin::kObjectIsExtensible:
@@ -581,7 +582,6 @@ DebugInfo::SideEffectState BuiltinGetSideEffectState(Builtin id) {
     case Builtin::kArrayPrototypeAt:
     case Builtin::kArrayPrototypeConcat:
     case Builtin::kArrayPrototypeEntries:
-    case Builtin::kArrayPrototypeFill:
     case Builtin::kArrayPrototypeFind:
     case Builtin::kArrayPrototypeFindIndex:
     case Builtin::kArrayPrototypeFindLast:
@@ -589,8 +589,6 @@ DebugInfo::SideEffectState BuiltinGetSideEffectState(Builtin id) {
     case Builtin::kArrayPrototypeFlat:
     case Builtin::kArrayPrototypeFlatMap:
     case Builtin::kArrayPrototypeJoin:
-    case Builtin::kArrayPrototypeGroup:
-    case Builtin::kArrayPrototypeGroupToMap:
     case Builtin::kArrayPrototypeKeys:
     case Builtin::kArrayPrototypeLastIndexOf:
     case Builtin::kArrayPrototypeSlice:
@@ -706,6 +704,7 @@ DebugInfo::SideEffectState BuiltinGetSideEffectState(Builtin id) {
     case Builtin::kDatePrototypeValueOf:
     // Map builtins.
     case Builtin::kMapConstructor:
+    case Builtin::kMapGroupBy:
     case Builtin::kMapPrototypeForEach:
     case Builtin::kMapPrototypeGet:
     case Builtin::kMapPrototypeHas:
@@ -871,8 +870,6 @@ DebugInfo::SideEffectState BuiltinGetSideEffectState(Builtin id) {
     case Builtin::kStrictPoisonPillThrower:
     case Builtin::kAllocateInYoungGeneration:
     case Builtin::kAllocateInOldGeneration:
-    case Builtin::kAllocateRegularInYoungGeneration:
-    case Builtin::kAllocateRegularInOldGeneration:
     case Builtin::kConstructVarargs:
     case Builtin::kConstructWithArrayLike:
     case Builtin::kGetOwnPropertyDescriptor:
@@ -916,6 +913,13 @@ DebugInfo::SideEffectState BuiltinGetSideEffectState(Builtin id) {
     case Builtin::kLocalePrototypeCaseFirst:
     case Builtin::kLocalePrototypeCollation:
     case Builtin::kLocalePrototypeCollations:
+    case Builtin::kLocalePrototypeGetCalendars:
+    case Builtin::kLocalePrototypeGetCollations:
+    case Builtin::kLocalePrototypeGetHourCycles:
+    case Builtin::kLocalePrototypeGetNumberingSystems:
+    case Builtin::kLocalePrototypeGetTextInfo:
+    case Builtin::kLocalePrototypeGetTimeZones:
+    case Builtin::kLocalePrototypeGetWeekInfo:
     case Builtin::kLocalePrototypeHourCycle:
     case Builtin::kLocalePrototypeHourCycles:
     case Builtin::kLocalePrototypeLanguage:
@@ -958,6 +962,7 @@ DebugInfo::SideEffectState BuiltinGetSideEffectState(Builtin id) {
     case Builtin::kSetPrototypeDelete:
     // Array builtins.
     case Builtin::kArrayIteratorPrototypeNext:
+    case Builtin::kArrayPrototypeFill:
     case Builtin::kArrayPrototypePop:
     case Builtin::kArrayPrototypePush:
     case Builtin::kArrayPrototypeReverse:
@@ -1044,7 +1049,7 @@ DebugInfo::SideEffectState DebugEvaluate::FunctionGetSideEffectState(
     Handle<BytecodeArray> bytecode_array(info->GetBytecodeArray(isolate),
                                          isolate);
     if (v8_flags.trace_side_effect_free_debug_evaluate) {
-      bytecode_array->Print();
+      Print(*bytecode_array);
     }
     bool requires_runtime_checks = false;
     for (interpreter::BytecodeArrayIterator it(bytecode_array); !it.done();
@@ -1068,8 +1073,8 @@ DebugInfo::SideEffectState DebugEvaluate::FunctionGetSideEffectState(
                                    : DebugInfo::kHasNoSideEffect;
   } else if (info->IsApiFunction()) {
     Code code = info->GetCode(isolate);
-    if (code.is_builtin()) {
-      return code.builtin_id() == Builtin::kHandleApiCall
+    if (code->is_builtin()) {
+      return code->builtin_id() == Builtin::kHandleApiCallOrConstruct
                  ? DebugInfo::kHasNoSideEffect
                  : DebugInfo::kHasSideEffects;
     }
@@ -1125,6 +1130,7 @@ static bool TransitivelyCalledBuiltinHasNoSideEffect(Builtin caller,
     case Builtin::kCEntry_Return2_ArgvOnStack_NoBuiltinExit:
     case Builtin::kCEntry_Return2_ArgvOnStack_BuiltinExit:
     case Builtin::kCEntry_Return2_ArgvInRegister_NoBuiltinExit:
+    case Builtin::kWasmCEntry:
     case Builtin::kCloneFastJSArray:
     case Builtin::kConstruct:
     case Builtin::kConvertToLocaleString:
@@ -1140,6 +1146,8 @@ static bool TransitivelyCalledBuiltinHasNoSideEffect(Builtin caller,
     case Builtin::kGenericArrayToReversed:
     case Builtin::kGenericArrayWith:
     case Builtin::kGetProperty:
+    case Builtin::kGetPropertyWithReceiver:
+    case Builtin::kGroupByGeneric:
     case Builtin::kHasProperty:
     case Builtin::kCreateHTML:
     case Builtin::kNonNumberToNumber:
@@ -1243,7 +1251,7 @@ void DebugEvaluate::VerifyTransitiveBuiltins(Isolate* isolate) {
       DCHECK(RelocInfo::IsCodeTargetMode(rinfo->rmode()));
       Code lookup_result =
           isolate->heap()->FindCodeForInnerPointer(rinfo->target_address());
-      Builtin callee = lookup_result.builtin_id();
+      Builtin callee = lookup_result->builtin_id();
       if (BuiltinGetSideEffectState(callee) == DebugInfo::kHasNoSideEffect) {
         continue;
       }
diff --git a/deps/v8/src/debug/debug-frames.cc b/deps/v8/src/debug/debug-frames.cc
index 9d55442644ee16..30e09932bb1cf1 100644
--- a/deps/v8/src/debug/debug-frames.cc
+++ b/deps/v8/src/debug/debug-frames.cc
@@ -97,13 +97,12 @@ bool FrameInspector::ParameterIsShadowedByContextLocal(
   return info->ContextSlotIndex(parameter_name) != -1;
 }
 
-RedirectActiveFunctions::RedirectActiveFunctions(SharedFunctionInfo shared,
-                                                 Mode mode)
+RedirectActiveFunctions::RedirectActiveFunctions(
+    Isolate* isolate, Tagged<SharedFunctionInfo> shared, Mode mode)
     : shared_(shared), mode_(mode) {
-  DCHECK(shared.HasBytecodeArray());
-  if (mode == Mode::kUseDebugBytecode) {
-    DCHECK(shared.HasDebugInfo());
-  }
+  DCHECK(shared->HasBytecodeArray());
+  DCHECK_IMPLIES(mode == Mode::kUseDebugBytecode,
+                 shared->HasDebugInfo(isolate));
 }
 
 void RedirectActiveFunctions::VisitThread(Isolate* isolate,
@@ -111,14 +110,15 @@ void RedirectActiveFunctions::VisitThread(Isolate* isolate,
   for (JavaScriptStackFrameIterator it(isolate, top); !it.done();
        it.Advance()) {
     JavaScriptFrame* frame = it.frame();
-    JSFunction function = frame->function();
+    Tagged<JSFunction> function = frame->function();
     if (!frame->is_interpreted()) continue;
-    if (function.shared() != shared_) continue;
+    if (function->shared() != shared_) continue;
     InterpretedFrame* interpreted_frame =
         reinterpret_cast<InterpretedFrame*>(frame);
-    BytecodeArray bytecode = mode_ == Mode::kUseDebugBytecode
-                                 ? shared_.GetDebugInfo().DebugBytecodeArray()
-                                 : shared_.GetBytecodeArray(isolate);
+    Tagged<BytecodeArray> bytecode =
+        mode_ == Mode::kUseDebugBytecode
+            ? shared_->GetDebugInfo(isolate)->DebugBytecodeArray()
+            : shared_->GetBytecodeArray(isolate);
     interpreted_frame->PatchBytecodeArray(bytecode);
   }
 }
diff --git a/deps/v8/src/debug/debug-frames.h b/deps/v8/src/debug/debug-frames.h
index 3afa4ce777c926..b8e99e7fb44c9c 100644
--- a/deps/v8/src/debug/debug-frames.h
+++ b/deps/v8/src/debug/debug-frames.h
@@ -70,7 +70,8 @@ class RedirectActiveFunctions : public ThreadVisitor {
     kUseDebugBytecode,
   };
 
-  explicit RedirectActiveFunctions(SharedFunctionInfo shared, Mode mode);
+  RedirectActiveFunctions(Isolate* isolate, Tagged<SharedFunctionInfo> shared,
+                          Mode mode);
 
   void VisitThread(Isolate* isolate, ThreadLocalTop* top) override;
 
diff --git a/deps/v8/src/debug/debug-interface.cc b/deps/v8/src/debug/debug-interface.cc
index 7a2a610eba5140..fb3b6b69e4be80 100644
--- a/deps/v8/src/debug/debug-interface.cc
+++ b/deps/v8/src/debug/debug-interface.cc
@@ -42,8 +42,8 @@ void SetContextId(Local<Context> context, int id) {
 int GetContextId(Local<Context> context) {
   auto v8_context = Utils::OpenHandle(*context);
   DCHECK_NO_SCRIPT_NO_EXCEPTION(v8_context->GetIsolate());
-  i::Object value = v8_context->debug_context_id();
-  return (value.IsSmi()) ? i::Smi::ToInt(value) : 0;
+  i::Tagged<i::Object> value = v8_context->debug_context_id();
+  return (IsSmi(value)) ? i::Smi::ToInt(value) : 0;
 }
 
 void SetInspector(Isolate* isolate, v8_inspector::V8Inspector* inspector) {
@@ -127,9 +127,9 @@ Local<String> GetDateDescription(Local<Date> date) {
   i::Handle<i::JSDate> jsdate = i::Handle<i::JSDate>::cast(receiver);
   i::Isolate* i_isolate = jsdate->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  auto buffer =
-      i::ToDateString(jsdate->value().Number(), i_isolate->date_cache(),
-                      i::ToDateStringMode::kLocalDateAndTime);
+  auto buffer = i::ToDateString(i::Object::Number(jsdate->value()),
+                                i_isolate->date_cache(),
+                                i::ToDateStringMode::kLocalDateAndTime);
   return Utils::ToLocal(i_isolate->factory()
                             ->NewStringFromUtf8(base::VectorOf(buffer))
                             .ToHandleChecked());
@@ -139,19 +139,20 @@ Local<String> GetFunctionDescription(Local<Function> function) {
   auto receiver = Utils::OpenHandle(*function);
   auto i_isolate = receiver->GetIsolate();
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(i_isolate);
-  if (receiver->IsJSBoundFunction()) {
+  if (IsJSBoundFunction(*receiver)) {
     return Utils::ToLocal(i::JSBoundFunction::ToString(
         i::Handle<i::JSBoundFunction>::cast(receiver)));
   }
-  if (receiver->IsJSFunction()) {
+  if (IsJSFunction(*receiver)) {
     auto js_function = i::Handle<i::JSFunction>::cast(receiver);
 #if V8_ENABLE_WEBASSEMBLY
-    if (js_function->shared().HasWasmExportedFunctionData()) {
+    if (js_function->shared()->HasWasmExportedFunctionData()) {
       auto i_isolate = js_function->GetIsolate();
-      auto func_index =
-          js_function->shared().wasm_exported_function_data().function_index();
+      auto func_index = js_function->shared()
+                            ->wasm_exported_function_data()
+                            ->function_index();
       auto instance = i::handle(
-          js_function->shared().wasm_exported_function_data().instance(),
+          js_function->shared()->wasm_exported_function_data()->instance(),
           i_isolate);
       if (instance->module()->origin == i::wasm::kWasmOrigin) {
         // For asm.js functions, we can still print the source
@@ -295,7 +296,7 @@ bool GetPrivateMembers(Local<Context> context, Local<Object> object, int filter,
   // Estimate number of static private methods/accessors for classes.
   bool has_static_private_methods_or_accessors = false;
   if (include_methods_or_accessors) {
-    if (receiver->IsJSFunction()) {
+    if (IsJSFunction(*receiver)) {
       i::Handle<i::JSFunction> func(i::JSFunction::cast(*receiver), isolate);
       i::Handle<i::SharedFunctionInfo> shared(func->shared(), isolate);
       if (shared->is_class_constructor() &&
@@ -316,15 +317,15 @@ bool GetPrivateMembers(Local<Context> context, Local<Object> object, int filter,
   auto add_private_entry = [&](i::VariableMode mode, i::Handle<i::String> name,
                                i::Handle<i::Object> value) {
     DCHECK_IMPLIES(mode == i::VariableMode::kPrivateMethod,
-                   value->IsJSFunction());
+                   IsJSFunction(*value));
     DCHECK_IMPLIES(mode != i::VariableMode::kPrivateMethod,
-                   value->IsAccessorPair());
+                   IsAccessorPair(*value));
     names_out->push_back(Utils::ToLocal(name));
     values_out->push_back(Utils::ToLocal(value));
   };
   if (has_static_private_methods_or_accessors) {
     i::Handle<i::Context> recevier_context(
-        i::JSFunction::cast(*receiver).context(), isolate);
+        i::JSFunction::cast(*receiver)->context(), isolate);
     ForEachContextLocal(isolate, recevier_context, var_mode_filter,
                         static_filter, add_private_entry);
   }
@@ -338,14 +339,14 @@ bool GetPrivateMembers(Local<Context> context, Local<Object> object, int filter,
         isolate, value, i::Object::GetProperty(isolate, receiver, key), false);
     if (key->is_private_brand()) {
       if (include_methods_or_accessors) {
-        DCHECK(value->IsContext());
+        DCHECK(IsContext(*value));
         i::Handle<i::Context> value_context(i::Context::cast(*value), isolate);
         ForEachContextLocal(isolate, value_context, var_mode_filter,
                             instance_filter, add_private_entry);
       }
     } else if (include_fields) {  // Private fields
       i::Handle<i::String> name(
-          i::String::cast(i::Symbol::cast(*key).description()), isolate);
+          i::String::cast(i::Symbol::cast(*key)->description()), isolate);
       names_out->push_back(Utils::ToLocal(name));
       values_out->push_back(Utils::ToLocal(value));
     }
@@ -358,7 +359,7 @@ bool GetPrivateMembers(Local<Context> context, Local<Object> object, int filter,
 
 MaybeLocal<Context> GetCreationContext(Local<Object> value) {
   i::Handle<i::Object> val = Utils::OpenHandle(*value);
-  if (val->IsJSGlobalProxy()) {
+  if (IsJSGlobalProxy(*val)) {
     return MaybeLocal<Context>();
   }
   return value->GetCreationContext();
@@ -434,7 +435,7 @@ bool CanBreakProgram(Isolate* v8_isolate) {
 
 size_t ScriptSource::Length() const {
   i::Handle<i::HeapObject> source = Utils::OpenHandle(this);
-  if (source->IsString()) return i::Handle<i::String>::cast(source)->length();
+  if (IsString(*source)) return i::Handle<i::String>::cast(source)->length();
   return Size();
 }
 
@@ -446,23 +447,23 @@ size_t ScriptSource::Size() const {
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
   i::Handle<i::HeapObject> source = Utils::OpenHandle(this);
-  if (!source->IsString()) return 0;
+  if (!IsString(*source)) return 0;
   i::Handle<i::String> string = i::Handle<i::String>::cast(source);
   return string->length() * (string->IsTwoByteRepresentation() ? 2 : 1);
 }
 
 MaybeLocal<String> ScriptSource::JavaScriptCode() const {
   i::Handle<i::HeapObject> source = Utils::OpenHandle(this);
-  if (!source->IsString()) return MaybeLocal<String>();
+  if (!IsString(*source)) return MaybeLocal<String>();
   return Utils::ToLocal(i::Handle<i::String>::cast(source));
 }
 
 #if V8_ENABLE_WEBASSEMBLY
 Maybe<MemorySpan<const uint8_t>> ScriptSource::WasmBytecode() const {
   i::Handle<i::HeapObject> source = Utils::OpenHandle(this);
-  if (!source->IsForeign()) return Nothing<MemorySpan<const uint8_t>>();
+  if (!IsForeign(*source)) return Nothing<MemorySpan<const uint8_t>>();
   base::Vector<const uint8_t> wire_bytes =
-      i::Managed<i::wasm::NativeModule>::cast(*source).raw()->wire_bytes();
+      i::Managed<i::wasm::NativeModule>::cast(*source)->raw()->wire_bytes();
   return Just(MemorySpan<const uint8_t>{wire_bytes.begin(), wire_bytes.size()});
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -477,7 +478,7 @@ ScriptOriginOptions Script::OriginOptions() const {
 
 bool Script::WasCompiled() const {
   return Utils::OpenHandle(this)->compilation_state() ==
-         i::Script::COMPILATION_STATE_COMPILED;
+         i::Script::CompilationState::kCompiled;
 }
 
 bool Script::IsEmbedded() const {
@@ -497,34 +498,34 @@ int Script::StartColumn() const {
 int Script::EndLine() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
 #if V8_ENABLE_WEBASSEMBLY
-  if (script->type() == i::Script::TYPE_WASM) return 0;
+  if (script->type() == i::Script::Type::kWasm) return 0;
 #endif  // V8_ENABLE_WEBASSEMBLY
-  if (!script->source().IsString()) {
+  if (!IsString(script->source())) {
     return script->line_offset();
   }
   i::Isolate* isolate = script->GetIsolate();
   i::HandleScope scope(isolate);
   i::Script::PositionInfo info;
-  i::Script::GetPositionInfo(script, i::String::cast(script->source()).length(),
-                             &info, i::Script::WITH_OFFSET);
+  i::Script::GetPositionInfo(
+      script, i::String::cast(script->source())->length(), &info);
   return info.line;
 }
 
 int Script::EndColumn() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
 #if V8_ENABLE_WEBASSEMBLY
-  if (script->type() == i::Script::TYPE_WASM) {
+  if (script->type() == i::Script::Type::kWasm) {
     return script->wasm_native_module()->wire_bytes().length();
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
-  if (!script->source().IsString()) {
+  if (!IsString(script->source())) {
     return script->column_offset();
   }
   i::Isolate* isolate = script->GetIsolate();
   i::HandleScope scope(isolate);
   i::Script::PositionInfo info;
-  i::Script::GetPositionInfo(script, i::String::cast(script->source()).length(),
-                             &info, i::Script::WITH_OFFSET);
+  i::Script::GetPositionInfo(
+      script, i::String::cast(script->source())->length(), &info);
   return info.column;
 }
 
@@ -532,7 +533,7 @@ MaybeLocal<String> Script::Name() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
   i::Isolate* isolate = script->GetIsolate();
   i::Handle<i::Object> value(script->name(), isolate);
-  if (!value->IsString()) return MaybeLocal<String>();
+  if (!IsString(*value)) return MaybeLocal<String>();
   return Utils::ToLocal(i::Handle<i::String>::cast(value));
 }
 
@@ -540,7 +541,7 @@ MaybeLocal<String> Script::SourceURL() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
   i::Isolate* isolate = script->GetIsolate();
   i::Handle<i::PrimitiveHeapObject> value(script->source_url(), isolate);
-  if (!value->IsString()) return MaybeLocal<String>();
+  if (!IsString(*value)) return MaybeLocal<String>();
   return Utils::ToLocal(i::Handle<i::String>::cast(value));
 }
 
@@ -548,7 +549,7 @@ MaybeLocal<String> Script::SourceMappingURL() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
   i::Isolate* isolate = script->GetIsolate();
   i::Handle<i::Object> value(script->source_mapping_url(), isolate);
-  if (!value->IsString()) return MaybeLocal<String>();
+  if (!IsString(*value)) return MaybeLocal<String>();
   return Utils::ToLocal(i::Handle<i::String>::cast(value));
 }
 
@@ -562,8 +563,8 @@ MaybeLocal<String> Script::GetSha256Hash() const {
 
 Maybe<int> Script::ContextId() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  i::Object value = script->context_data();
-  if (value.IsSmi()) return Just(i::Smi::ToInt(value));
+  i::Tagged<i::Object> value = script->context_data();
+  if (IsSmi(value)) return Just(i::Smi::ToInt(value));
   return Nothing<int>();
 }
 
@@ -571,7 +572,7 @@ Local<ScriptSource> Script::Source() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
   i::Isolate* isolate = script->GetIsolate();
 #if V8_ENABLE_WEBASSEMBLY
-  if (script->type() == i::Script::TYPE_WASM) {
+  if (script->type() == i::Script::Type::kWasm) {
     i::Handle<i::Object> wasm_native_module(
         script->wasm_managed_native_module(), isolate);
     return Utils::Convert<i::Object, ScriptSource>(wasm_native_module);
@@ -583,7 +584,7 @@ Local<ScriptSource> Script::Source() const {
 
 #if V8_ENABLE_WEBASSEMBLY
 bool Script::IsWasm() const {
-  return Utils::OpenHandle(this)->type() == i::Script::TYPE_WASM;
+  return Utils::OpenHandle(this)->type() == i::Script::Type::kWasm;
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
@@ -610,7 +611,7 @@ bool Script::GetPossibleBreakpoints(
   CHECK(!start.IsEmpty());
   i::Handle<i::Script> script = Utils::OpenHandle(this);
 #if V8_ENABLE_WEBASSEMBLY
-  if (script->type() == i::Script::TYPE_WASM) {
+  if (script->type() == i::Script::Type::kWasm) {
     i::wasm::NativeModule* native_module = script->wasm_native_module();
     return i::WasmScript::GetPossibleBreakpoints(native_module, start, end,
                                                  locations);
@@ -651,7 +652,7 @@ Maybe<int> Script::GetSourceOffset(const Location& location,
                                    GetSourceOffsetMode mode) const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
 #if V8_ENABLE_WEBASSEMBLY
-  if (script->type() == i::Script::TYPE_WASM) {
+  if (script->type() == i::Script::Type::kWasm) {
     DCHECK_EQ(0, location.GetLineNumber());
     return Just(location.GetColumnNumber());
   }
@@ -710,7 +711,7 @@ Maybe<int> Script::GetSourceOffset(const Location& location,
 Location Script::GetSourceLocation(int offset) const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
   i::Script::PositionInfo info;
-  i::Script::GetPositionInfo(script, offset, &info, i::Script::WITH_OFFSET);
+  i::Script::GetPositionInfo(script, offset, &info);
   if (script->HasSourceURLComment()) {
     // Line/column number for inline <script>s with sourceURL annotation
     // are supposed to be related to the <script> tag, otherwise they
@@ -752,14 +753,15 @@ bool Script::SetInstrumentationBreakpoint(BreakpointId* id) const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
   i::Isolate* isolate = script->GetIsolate();
 #if V8_ENABLE_WEBASSEMBLY
-  if (script->type() == i::Script::TYPE_WASM) {
+  if (script->type() == i::Script::Type::kWasm) {
     isolate->debug()->SetInstrumentationBreakpointForWasmScript(script, id);
     return true;
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
   i::SharedFunctionInfo::ScriptIterator it(isolate, *script);
-  for (i::SharedFunctionInfo sfi = it.Next(); !sfi.is_null(); sfi = it.Next()) {
-    if (sfi.is_toplevel()) {
+  for (i::Tagged<i::SharedFunctionInfo> sfi = it.Next(); !sfi.is_null();
+       sfi = it.Next()) {
+    if (sfi->is_toplevel()) {
       return isolate->debug()->SetBreakpointForFunction(
           handle(sfi, isolate), isolate->factory()->empty_string(), id,
           internal::Debug::kInstrumentation);
@@ -799,7 +801,7 @@ WasmScript* WasmScript::Cast(Script* script) {
 
 WasmScript::DebugSymbolsType WasmScript::GetDebugSymbolType() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
   switch (script->wasm_native_module()->module()->debug_symbols.type) {
     case i::wasm::WasmDebugSymbols::Type::None:
       return WasmScript::DebugSymbolsType::None;
@@ -814,7 +816,7 @@ WasmScript::DebugSymbolsType WasmScript::GetDebugSymbolType() const {
 
 MemorySpan<const char> WasmScript::ExternalSymbolsURL() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
 
   const i::wasm::WasmDebugSymbols& symbols =
       script->wasm_native_module()->module()->debug_symbols;
@@ -830,7 +832,7 @@ MemorySpan<const char> WasmScript::ExternalSymbolsURL() const {
 int WasmScript::NumFunctions() const {
   i::DisallowGarbageCollection no_gc;
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
   i::wasm::NativeModule* native_module = script->wasm_native_module();
   const i::wasm::WasmModule* module = native_module->module();
   DCHECK_GE(i::kMaxInt, module->functions.size());
@@ -840,7 +842,7 @@ int WasmScript::NumFunctions() const {
 int WasmScript::NumImportedFunctions() const {
   i::DisallowGarbageCollection no_gc;
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
   i::wasm::NativeModule* native_module = script->wasm_native_module();
   const i::wasm::WasmModule* module = native_module->module();
   DCHECK_GE(i::kMaxInt, module->num_imported_functions);
@@ -850,7 +852,7 @@ int WasmScript::NumImportedFunctions() const {
 std::pair<int, int> WasmScript::GetFunctionRange(int function_index) const {
   i::DisallowGarbageCollection no_gc;
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
   i::wasm::NativeModule* native_module = script->wasm_native_module();
   const i::wasm::WasmModule* module = native_module->module();
   DCHECK_LE(0, function_index);
@@ -865,7 +867,7 @@ std::pair<int, int> WasmScript::GetFunctionRange(int function_index) const {
 int WasmScript::GetContainingFunction(int byte_offset) const {
   i::DisallowGarbageCollection no_gc;
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
   i::wasm::NativeModule* native_module = script->wasm_native_module();
   const i::wasm::WasmModule* module = native_module->module();
   DCHECK_LE(0, byte_offset);
@@ -877,7 +879,7 @@ void WasmScript::Disassemble(DisassemblyCollector* collector,
                              std::vector<int>* function_body_offsets) {
   i::DisallowGarbageCollection no_gc;
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
   i::wasm::NativeModule* native_module = script->wasm_native_module();
   const i::wasm::WasmModule* module = native_module->module();
   i::wasm::ModuleWireBytes wire_bytes(native_module->wire_bytes());
@@ -885,17 +887,23 @@ void WasmScript::Disassemble(DisassemblyCollector* collector,
                        collector, function_body_offsets);
 }
 
+void Disassemble(base::Vector<const uint8_t> wire_bytes,
+                 DisassemblyCollector* collector,
+                 std::vector<int>* function_body_offsets) {
+  i::wasm::Disassemble(wire_bytes, collector, function_body_offsets);
+}
+
 uint32_t WasmScript::GetFunctionHash(int function_index) {
   i::DisallowGarbageCollection no_gc;
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
   i::wasm::NativeModule* native_module = script->wasm_native_module();
   const i::wasm::WasmModule* module = native_module->module();
   DCHECK_LE(0, function_index);
   DCHECK_GT(module->functions.size(), function_index);
   const i::wasm::WasmFunction& func = module->functions[function_index];
   i::wasm::ModuleWireBytes wire_bytes(native_module->wire_bytes());
-  base::Vector<const i::byte> function_bytes =
+  base::Vector<const uint8_t> function_bytes =
       wire_bytes.GetFunctionBytes(&func);
   // TODO(herhut): Maybe also take module, name and signature into account.
   return i::StringHasher::HashSequentialString(function_bytes.begin(),
@@ -904,7 +912,7 @@ uint32_t WasmScript::GetFunctionHash(int function_index) {
 
 int WasmScript::CodeOffset() const {
   i::Handle<i::Script> script = Utils::OpenHandle(this);
-  DCHECK_EQ(i::Script::TYPE_WASM, script->type());
+  DCHECK_EQ(i::Script::Type::kWasm, script->type());
   i::wasm::NativeModule* native_module = script->wasm_native_module();
   const i::wasm::WasmModule* module = native_module->module();
 
@@ -945,17 +953,17 @@ void GetLoadedScripts(Isolate* v8_isolate,
   {
     i::DisallowGarbageCollection no_gc;
     i::Script::Iterator iterator(isolate);
-    for (i::Script script = iterator.Next(); !script.is_null();
+    for (i::Tagged<i::Script> script = iterator.Next(); !script.is_null();
          script = iterator.Next()) {
 #if V8_ENABLE_WEBASSEMBLY
-      if (script.type() != i::Script::TYPE_NORMAL &&
-          script.type() != i::Script::TYPE_WASM) {
+      if (script->type() != i::Script::Type::kNormal &&
+          script->type() != i::Script::Type::kWasm) {
         continue;
       }
 #else
-      if (script.type() != i::Script::TYPE_NORMAL) continue;
+      if (script->type() != i::Script::Type::kNormal) continue;
 #endif  // V8_ENABLE_WEBASSEMBLY
-      if (!script.HasValidSource()) continue;
+      if (!script->HasValidSource()) continue;
       i::HandleScope handle_scope(isolate);
       i::Handle<i::Script> script_handle(script, isolate);
       scripts.emplace_back(v8_isolate, ToApiHandle<Script>(script_handle));
@@ -1011,10 +1019,10 @@ void ResetBlackboxedStateCache(Isolate* v8_isolate, Local<Script> script) {
   i::DisallowGarbageCollection no_gc;
   i::SharedFunctionInfo::ScriptIterator iter(isolate,
                                              *Utils::OpenHandle(*script));
-  for (i::SharedFunctionInfo info = iter.Next(); !info.is_null();
+  for (i::Tagged<i::SharedFunctionInfo> info = iter.Next(); !info.is_null();
        info = iter.Next()) {
-    if (info.HasDebugInfo()) {
-      info.GetDebugInfo().set_computed_debug_is_blackboxed(false);
+    if (auto debug_info = isolate->debug()->TryGetDebugInfo(info)) {
+      debug_info->set_computed_debug_is_blackboxed(false);
     }
   }
 }
@@ -1023,27 +1031,28 @@ int EstimatedValueSize(Isolate* v8_isolate, Local<Value> value) {
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   ENTER_V8_NO_SCRIPT_NO_EXCEPTION(isolate);
   i::Handle<i::Object> object = Utils::OpenHandle(*value);
-  if (object->IsSmi()) return i::kTaggedSize;
-  CHECK(object->IsHeapObject());
+  if (IsSmi(*object)) return i::kTaggedSize;
+  CHECK(IsHeapObject(*object));
   return i::Handle<i::HeapObject>::cast(object)->Size();
 }
 
 void AccessorPair::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsAccessorPair(), "v8::debug::AccessorPair::Cast",
+  Utils::ApiCheck(i::IsAccessorPair(*obj), "v8::debug::AccessorPair::Cast",
                   "Value is not a v8::debug::AccessorPair");
 }
 
 #if V8_ENABLE_WEBASSEMBLY
 void WasmValueObject::CheckCast(Value* that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(that);
-  Utils::ApiCheck(obj->IsWasmValueObject(), "v8::debug::WasmValueObject::Cast",
+  Utils::ApiCheck(i::IsWasmValueObject(*obj),
+                  "v8::debug::WasmValueObject::Cast",
                   "Value is not a v8::debug::WasmValueObject");
 }
 
 bool WasmValueObject::IsWasmValueObject(Local<Value> that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(*that);
-  return obj->IsWasmValueObject();
+  return i::IsWasmValueObject(*obj);
 }
 
 Local<String> WasmValueObject::type() const {
@@ -1074,8 +1083,8 @@ Local<Function> GetBuiltin(Isolate* v8_isolate, Builtin requested_builtin) {
           .set_map(isolate->strict_function_without_prototype_map())
           .Build();
 
-  fun->shared().set_internal_formal_parameter_count(i::JSParameterCount(0));
-  fun->shared().set_length(0);
+  fun->shared()->set_internal_formal_parameter_count(i::JSParameterCount(0));
+  fun->shared()->set_length(0);
   return Utils::ToLocal(handle_scope.CloseAndEscape(fun));
 }
 
@@ -1113,8 +1122,8 @@ v8::Local<v8::Message> CreateMessageFromException(
 
 MaybeLocal<Script> GeneratorObject::Script() {
   i::Handle<i::JSGeneratorObject> obj = Utils::OpenHandle(this);
-  i::Object maybe_script = obj->function().shared().script();
-  if (!maybe_script.IsScript()) return {};
+  i::Tagged<i::Object> maybe_script = obj->function()->shared()->script();
+  if (!IsScript(maybe_script)) return {};
   i::Handle<i::Script> script(i::Script::cast(maybe_script), obj->GetIsolate());
   return ToApiHandle<v8::debug::Script>(script);
 }
@@ -1127,15 +1136,14 @@ Local<Function> GeneratorObject::Function() {
 Location GeneratorObject::SuspendedLocation() {
   i::Handle<i::JSGeneratorObject> obj = Utils::OpenHandle(this);
   CHECK(obj->is_suspended());
-  i::Object maybe_script = obj->function().shared().script();
-  if (!maybe_script.IsScript()) return Location();
+  i::Tagged<i::Object> maybe_script = obj->function()->shared()->script();
+  if (!IsScript(maybe_script)) return Location();
   i::Isolate* isolate = obj->GetIsolate();
   i::Handle<i::Script> script(i::Script::cast(maybe_script), isolate);
   i::Script::PositionInfo info;
   i::SharedFunctionInfo::EnsureSourcePositionsAvailable(
-      isolate, i::handle(obj->function().shared(), isolate));
-  i::Script::GetPositionInfo(script, obj->source_position(), &info,
-                             i::Script::WITH_OFFSET);
+      isolate, i::handle(obj->function()->shared(), isolate));
+  i::Script::GetPositionInfo(script, obj->source_position(), &info);
   return Location(info.line, info.column);
 }
 
@@ -1217,8 +1225,7 @@ void GlobalLexicalScopeNames(v8::Local<v8::Context> v8_context,
   i::Handle<i::Context> context = Utils::OpenHandle(*v8_context);
   i::Isolate* isolate = context->GetIsolate();
   i::Handle<i::ScriptContextTable> table(
-      context->global_object().native_context().script_context_table(),
-      isolate);
+      context->native_context()->script_context_table(), isolate);
   for (int i = 0; i < table->used(kAcquireLoad); i++) {
     i::Handle<i::Context> script_context =
         i::ScriptContextTable::GetContext(isolate, table, i);
@@ -1245,7 +1252,7 @@ int64_t GetNextRandomInt64(v8::Isolate* v8_isolate) {
 
 int GetDebuggingId(v8::Local<v8::Function> function) {
   i::Handle<i::JSReceiver> callable = v8::Utils::OpenHandle(*function);
-  if (!callable->IsJSFunction()) return i::DebugInfo::kNoDebuggingId;
+  if (!IsJSFunction(*callable)) return i::DebugInfo::kNoDebuggingId;
   i::Handle<i::JSFunction> func = i::Handle<i::JSFunction>::cast(callable);
   int id = func->GetIsolate()->debug()->GetFunctionDebuggingId(func);
   DCHECK_NE(i::DebugInfo::kNoDebuggingId, id);
@@ -1255,7 +1262,7 @@ int GetDebuggingId(v8::Local<v8::Function> function) {
 bool SetFunctionBreakpoint(v8::Local<v8::Function> function,
                            v8::Local<v8::String> condition, BreakpointId* id) {
   i::Handle<i::JSReceiver> callable = Utils::OpenHandle(*function);
-  if (!callable->IsJSFunction()) return false;
+  if (!IsJSFunction(*callable)) return false;
   i::Handle<i::JSFunction> jsfunction =
       i::Handle<i::JSFunction>::cast(callable);
   i::Isolate* isolate = jsfunction->GetIsolate();
@@ -1348,11 +1355,11 @@ MaybeLocal<v8::Value> EphemeronTable::Get(v8::Isolate* isolate,
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   auto self = i::Handle<i::EphemeronHashTable>::cast(Utils::OpenHandle(this));
   i::Handle<i::Object> internal_key = Utils::OpenHandle(*key);
-  DCHECK(internal_key->IsJSReceiver());
+  DCHECK(IsJSReceiver(*internal_key));
 
   i::Handle<i::Object> value(self->Lookup(internal_key), i_isolate);
 
-  if (value->IsTheHole()) return {};
+  if (IsTheHole(*value)) return {};
   return Utils::ToLocal(value);
 }
 
@@ -1362,7 +1369,7 @@ Local<EphemeronTable> EphemeronTable::Set(v8::Isolate* isolate,
   auto self = i::Handle<i::EphemeronHashTable>::cast(Utils::OpenHandle(this));
   i::Handle<i::Object> internal_key = Utils::OpenHandle(*key);
   i::Handle<i::Object> internal_value = Utils::OpenHandle(*value);
-  DCHECK(internal_key->IsJSReceiver());
+  DCHECK(IsJSReceiver(*internal_key));
 
   i::Handle<i::EphemeronHashTable> result(
       i::EphemeronHashTable::Put(self, internal_key, internal_value));
@@ -1398,7 +1405,7 @@ Local<Value> AccessorPair::setter() {
 
 bool AccessorPair::IsAccessorPair(Local<Value> that) {
   i::Handle<i::Object> obj = Utils::OpenHandle(*that);
-  return obj->IsAccessorPair();
+  return i::IsAccessorPair(*obj);
 }
 
 MaybeLocal<Message> GetMessageFromPromise(Local<Promise> p) {
@@ -1409,7 +1416,7 @@ MaybeLocal<Message> GetMessageFromPromise(Local<Promise> p) {
   i::Handle<i::Object> maybeMessage =
       i::JSReceiver::GetDataProperty(isolate, promise, key);
 
-  if (!maybeMessage->IsJSMessageObject(isolate)) return MaybeLocal<Message>();
+  if (!IsJSMessageObject(*maybeMessage, isolate)) return MaybeLocal<Message>();
   return ToApiHandle<Message>(
       i::Handle<i::JSMessageObject>::cast(maybeMessage));
 }
@@ -1451,7 +1458,7 @@ Maybe<bool> DebugPropertyIterator::Advance() {
     return Nothing<bool>();
   }
   Local<v8::Context> context =
-      Utils::ToLocal(handle(isolate_->context(), isolate_));
+      Utils::ToLocal(handle(isolate_->context()->native_context(), isolate_));
   CallDepthScope<false> call_depth_scope(isolate_, context);
 
   if (!AdvanceInternal()) {
diff --git a/deps/v8/src/debug/debug-interface.h b/deps/v8/src/debug/debug-interface.h
index 95d6a8177b7489..5dfd505fed6f14 100644
--- a/deps/v8/src/debug/debug-interface.h
+++ b/deps/v8/src/debug/debug-interface.h
@@ -273,6 +273,13 @@ class WasmScript : public Script {
   int CodeOffset() const;
   int CodeLength() const;
 };
+
+// "Static" version of WasmScript::Disassemble, for use with cached scripts
+// where we only have raw wire bytes available.
+void Disassemble(base::Vector<const uint8_t> wire_bytes,
+                 DisassemblyCollector* collector,
+                 std::vector<int>* function_body_offsets);
+
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 V8_EXPORT_PRIVATE void GetLoadedScripts(
diff --git a/deps/v8/src/debug/debug-property-iterator.cc b/deps/v8/src/debug/debug-property-iterator.cc
index 0487d472dbd694..6be48a007e4ef1 100644
--- a/deps/v8/src/debug/debug-property-iterator.cc
+++ b/deps/v8/src/debug/debug-property-iterator.cc
@@ -20,7 +20,7 @@ std::unique_ptr<DebugPropertyIterator> DebugPropertyIterator::Create(
   auto iterator = std::unique_ptr<DebugPropertyIterator>(
       new DebugPropertyIterator(isolate, receiver, skip_indices));
 
-  if (receiver->IsJSProxy()) {
+  if (IsJSProxy(*receiver)) {
     iterator->AdvanceToPrototype();
   }
 
@@ -186,18 +186,17 @@ bool DebugPropertyIterator::FillKeysForCurrentPrototypeAndStage() {
   Handle<JSReceiver> receiver =
       PrototypeIterator::GetCurrent<JSReceiver>(prototype_iterator_);
   if (stage_ == kExoticIndices) {
-    if (skip_indices_ || !receiver->IsJSTypedArray()) return true;
+    if (skip_indices_ || !IsJSTypedArray(*receiver)) return true;
     Handle<JSTypedArray> typed_array = Handle<JSTypedArray>::cast(receiver);
     current_keys_length_ =
-        typed_array->WasDetached() ? 0 : typed_array->length();
+        typed_array->WasDetached() ? 0 : typed_array->GetLength();
     return true;
   }
   PropertyFilter filter =
       stage_ == kEnumerableStrings ? ENUMERABLE_STRINGS : ALL_PROPERTIES;
   if (KeyAccumulator::GetKeys(isolate_, receiver, KeyCollectionMode::kOwnOnly,
                               filter, GetKeysConversion::kConvertToString,
-                              false,
-                              skip_indices_ || receiver->IsJSTypedArray())
+                              false, skip_indices_ || IsJSTypedArray(*receiver))
           .ToHandle(&current_keys_)) {
     current_keys_length_ = current_keys_->length();
     return true;
@@ -221,7 +220,7 @@ base::Flags<debug::NativeAccessorType, int> GetNativeAccessorDescriptorInternal(
     return debug::NativeAccessorType::None;
   }
   Handle<Object> structure = it.GetAccessors();
-  if (!structure->IsAccessorInfo()) return debug::NativeAccessorType::None;
+  if (!IsAccessorInfo(*structure)) return debug::NativeAccessorType::None;
   base::Flags<debug::NativeAccessorType, int> result;
   if (*structure == *isolate->factory()->value_unavailable_accessor()) {
     return debug::NativeAccessorType::IsValueUnavailable;
@@ -232,10 +231,10 @@ base::Flags<debug::NativeAccessorType, int> GetNativeAccessorDescriptorInternal(
   ACCESSOR_INFO_LIST_GENERATOR(IS_BUILTIN_ACCESSOR, /* not used */)
 #undef IS_BUILTIN_ACCESSOR
   Handle<AccessorInfo> accessor_info = Handle<AccessorInfo>::cast(structure);
-  if (accessor_info->has_getter()) {
+  if (accessor_info->has_getter(isolate)) {
     result |= debug::NativeAccessorType::HasGetter;
   }
-  if (accessor_info->has_setter()) {
+  if (accessor_info->has_setter(isolate)) {
     result |= debug::NativeAccessorType::HasSetter;
   }
   return result;
diff --git a/deps/v8/src/debug/debug-scope-iterator.cc b/deps/v8/src/debug/debug-scope-iterator.cc
index 653d4c07ccdce9..62a5e55053f16c 100644
--- a/deps/v8/src/debug/debug-scope-iterator.cc
+++ b/deps/v8/src/debug/debug-scope-iterator.cc
@@ -12,20 +12,17 @@ namespace v8 {
 
 std::unique_ptr<debug::ScopeIterator> debug::ScopeIterator::CreateForFunction(
     v8::Isolate* v8_isolate, v8::Local<v8::Function> v8_func) {
-  internal::Handle<internal::JSReceiver> receiver =
-      internal::Handle<internal::JSReceiver>::cast(Utils::OpenHandle(*v8_func));
+  internal::Handle<internal::JSReceiver> receiver = Utils::OpenHandle(*v8_func);
 
   // Besides JSFunction and JSBoundFunction, {v8_func} could be an
   // ObjectTemplate with a CallAsFunctionHandler. We only handle plain
   // JSFunctions.
-  if (!receiver->IsJSFunction()) return nullptr;
+  if (!IsJSFunction(*receiver)) return nullptr;
 
   internal::Handle<internal::JSFunction> function =
       internal::Handle<internal::JSFunction>::cast(receiver);
 
-  // Blink has function objects with callable map, JS_SPECIAL_API_OBJECT_TYPE
-  // but without context on heap.
-  if (!function->has_context()) return nullptr;
+  CHECK(function->has_context());
   return std::unique_ptr<debug::ScopeIterator>(new internal::DebugScopeIterator(
       reinterpret_cast<internal::Isolate*>(v8_isolate), function));
 }
@@ -35,7 +32,7 @@ debug::ScopeIterator::CreateForGeneratorObject(
     v8::Isolate* v8_isolate, v8::Local<v8::Object> v8_generator) {
   internal::Handle<internal::Object> generator =
       Utils::OpenHandle(*v8_generator);
-  DCHECK(generator->IsJSGeneratorObject());
+  DCHECK(IsJSGeneratorObject(*generator));
   return std::unique_ptr<debug::ScopeIterator>(new internal::DebugScopeIterator(
       reinterpret_cast<internal::Isolate*>(v8_isolate),
       internal::Handle<internal::JSGeneratorObject>::cast(generator)));
diff --git a/deps/v8/src/debug/debug-scopes.cc b/deps/v8/src/debug/debug-scopes.cc
index 89dbdde1b4556f..1d499d558b7ed4 100644
--- a/deps/v8/src/debug/debug-scopes.cc
+++ b/deps/v8/src/debug/debug-scopes.cc
@@ -28,7 +28,7 @@ ScopeIterator::ScopeIterator(Isolate* isolate, FrameInspector* frame_inspector,
       function_(frame_inspector_->GetFunction()),
       script_(frame_inspector_->GetScript()),
       locals_(StringSet::New(isolate)) {
-  if (!frame_inspector->GetContext()->IsContext()) {
+  if (!IsContext(*frame_inspector->GetContext())) {
     // Optimized frame, context or function cannot be materialized. Give up.
     return;
   }
@@ -36,7 +36,7 @@ ScopeIterator::ScopeIterator(Isolate* isolate, FrameInspector* frame_inspector,
 
 #if V8_ENABLE_WEBASSEMBLY
   // We should not instantiate a ScopeIterator for wasm frames.
-  DCHECK_NE(Script::TYPE_WASM, frame_inspector->GetScript()->type());
+  DCHECK_NE(Script::Type::kWasm, frame_inspector->GetScript()->type());
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   TryParseAndRetrieveScopes(strategy);
@@ -47,10 +47,10 @@ ScopeIterator::~ScopeIterator() = default;
 Handle<Object> ScopeIterator::GetFunctionDebugName() const {
   if (!function_.is_null()) return JSFunction::GetDebugName(function_);
 
-  if (!context_->IsNativeContext()) {
+  if (!IsNativeContext(*context_)) {
     DisallowGarbageCollection no_gc;
-    ScopeInfo closure_info = context_->closure_context().scope_info();
-    Handle<String> debug_name(closure_info.FunctionDebugName(), isolate_);
+    Tagged<ScopeInfo> closure_info = context_->closure_context()->scope_info();
+    Handle<String> debug_name(closure_info->FunctionDebugName(), isolate_);
     if (debug_name->length() > 0) return debug_name;
   }
   return isolate_->factory()->undefined_value();
@@ -60,11 +60,11 @@ ScopeIterator::ScopeIterator(Isolate* isolate, Handle<JSFunction> function)
     : isolate_(isolate),
       context_(function->context(), isolate),
       locals_(StringSet::New(isolate)) {
-  if (!function->shared().IsSubjectToDebugging()) {
+  if (!function->shared()->IsSubjectToDebugging()) {
     context_ = Handle<Context>();
     return;
   }
-  script_ = handle(Script::cast(function->shared().script()), isolate);
+  script_ = handle(Script::cast(function->shared()->script()), isolate);
   UnwrapEvaluationContext();
 }
 
@@ -74,9 +74,9 @@ ScopeIterator::ScopeIterator(Isolate* isolate,
       generator_(generator),
       function_(generator->function(), isolate),
       context_(generator->context(), isolate),
-      script_(Script::cast(function_->shared().script()), isolate),
+      script_(Script::cast(function_->shared()->script()), isolate),
       locals_(StringSet::New(isolate)) {
-  CHECK(function_->shared().IsSubjectToDebugging());
+  CHECK(function_->shared()->IsSubjectToDebugging());
   TryParseAndRetrieveScopes(ReparseStrategy::kFunctionLiteral);
 }
 
@@ -105,9 +105,9 @@ class ScopeChainRetriever {
   ScopeChainRetriever(DeclarationScope* scope, Handle<JSFunction> function,
                       int position)
       : scope_(scope),
-        break_scope_start_(function->shared().StartPosition()),
-        break_scope_end_(function->shared().EndPosition()),
-        break_scope_type_(function->shared().scope_info().scope_type()),
+        break_scope_start_(function->shared()->StartPosition()),
+        break_scope_end_(function->shared()->EndPosition()),
+        break_scope_type_(function->shared()->scope_info()->scope_type()),
         position_(position) {
     DCHECK_NOT_NULL(scope);
     RetrieveScopes();
@@ -201,7 +201,7 @@ void ScopeIterator::TryParseAndRetrieveScopes(ReparseStrategy strategy) {
   // Catch the case when the debugger stops in an internal function.
   Handle<SharedFunctionInfo> shared_info(function_->shared(), isolate_);
   Handle<ScopeInfo> scope_info(shared_info->scope_info(), isolate_);
-  if (shared_info->script().IsUndefined(isolate_)) {
+  if (IsUndefined(shared_info->script(), isolate_)) {
     current_scope_ = closure_scope_ = nullptr;
     context_ = handle(function_->context(), isolate_);
     function_ = Handle<JSFunction>();
@@ -209,14 +209,14 @@ void ScopeIterator::TryParseAndRetrieveScopes(ReparseStrategy strategy) {
   }
 
   bool ignore_nested_scopes = false;
-  if (shared_info->HasBreakInfo() && frame_inspector_ != nullptr) {
+  if (shared_info->HasBreakInfo(isolate_) && frame_inspector_ != nullptr) {
     // The source position at return is always the end of the function,
     // which is not consistent with the current scope chain. Therefore all
     // nested with, catch and block contexts are skipped, and we can only
     // inspect the function scope.
     // This can only happen if we set a break point inside right before the
     // return, which requires a debug info to be available.
-    Handle<DebugInfo> debug_info(shared_info->GetDebugInfo(), isolate_);
+    Handle<DebugInfo> debug_info(shared_info->GetDebugInfo(isolate_), isolate_);
 
     // Find the break point where execution has stopped.
     BreakLocation location = BreakLocation::FromFrame(debug_info, GetFrame());
@@ -225,8 +225,9 @@ void ScopeIterator::TryParseAndRetrieveScopes(ReparseStrategy strategy) {
   }
 
   if (strategy == ReparseStrategy::kScriptIfNeeded) {
-    Object maybe_block_list = isolate_->LocalsBlockListCacheGet(scope_info);
-    calculate_blocklists_ = maybe_block_list.IsTheHole();
+    Tagged<Object> maybe_block_list =
+        isolate_->LocalsBlockListCacheGet(scope_info);
+    calculate_blocklists_ = IsTheHole(maybe_block_list);
     strategy = calculate_blocklists_ ? ReparseStrategy::kScriptIfNeeded
                                      : ReparseStrategy::kFunctionLiteral;
   }
@@ -249,7 +250,7 @@ void ScopeIterator::TryParseAndRetrieveScopes(ReparseStrategy strategy) {
   MaybeHandle<ScopeInfo> maybe_outer_scope;
   if (scope_info->scope_type() == EVAL_SCOPE || script->is_wrapped()) {
     flags.set_is_eval(true);
-    if (!context_->IsNativeContext()) {
+    if (!IsNativeContext(*context_)) {
       maybe_outer_scope = handle(context_->scope_info(), isolate_);
     }
     // Language mode may be inherited from the eval caller.
@@ -319,16 +320,16 @@ void ScopeIterator::TryParseAndRetrieveScopes(ReparseStrategy strategy) {
 
 void ScopeIterator::UnwrapEvaluationContext() {
   if (!context_->IsDebugEvaluateContext()) return;
-  Context current = *context_;
+  Tagged<Context> current = *context_;
   do {
-    Object wrapped = current.get(Context::WRAPPED_CONTEXT_INDEX);
-    if (wrapped.IsContext()) {
+    Tagged<Object> wrapped = current->get(Context::WRAPPED_CONTEXT_INDEX);
+    if (IsContext(wrapped)) {
       current = Context::cast(wrapped);
     } else {
-      DCHECK(!current.previous().is_null());
-      current = current.previous();
+      DCHECK(!current->previous().is_null());
+      current = current->previous();
     }
-  } while (current.IsDebugEvaluateContext());
+  } while (current->IsDebugEvaluateContext());
   context_ = handle(current, isolate_);
 }
 
@@ -356,19 +357,19 @@ Handle<JSObject> ScopeIterator::MaterializeScopeDetails() {
 }
 
 bool ScopeIterator::HasPositionInfo() {
-  return InInnerScope() || !context_->IsNativeContext();
+  return InInnerScope() || !IsNativeContext(*context_);
 }
 
 int ScopeIterator::start_position() {
   if (InInnerScope()) return current_scope_->start_position();
-  if (context_->IsNativeContext()) return 0;
-  return context_->closure_context().scope_info().StartPosition();
+  if (IsNativeContext(*context_)) return 0;
+  return context_->closure_context()->scope_info()->StartPosition();
 }
 
 int ScopeIterator::end_position() {
   if (InInnerScope()) return current_scope_->end_position();
-  if (context_->IsNativeContext()) return 0;
-  return context_->closure_context().scope_info().EndPosition();
+  if (IsNativeContext(*context_)) return 0;
+  return context_->closure_context()->scope_info()->EndPosition();
 }
 
 bool ScopeIterator::DeclaresLocals(Mode mode) const {
@@ -420,7 +421,7 @@ bool ScopeIterator::AdvanceOneScope() {
 }
 
 void ScopeIterator::AdvanceOneContext() {
-  DCHECK(!context_->IsNativeContext());
+  DCHECK(!IsNativeContext(*context_));
   DCHECK(!context_->previous().is_null());
   context_ = handle(context_->previous(), isolate_);
 
@@ -461,7 +462,7 @@ void ScopeIterator::Next() {
 
   if (scope_type == ScopeTypeGlobal) {
     // The global scope is always the last in the chain.
-    DCHECK(context_->IsNativeContext());
+    DCHECK(IsNativeContext(*context_));
     context_ = Handle<Context>();
     DCHECK(Done());
     return;
@@ -513,7 +514,7 @@ ScopeIterator::ScopeType ScopeIterator::Type() const {
         return ScopeTypeModule;
       case SCRIPT_SCOPE:
         DCHECK_IMPLIES(NeedsContext(), context_->IsScriptContext() ||
-                                           context_->IsNativeContext());
+                                           IsNativeContext(*context_));
         return ScopeTypeScript;
       case WITH_SCOPE:
         DCHECK_IMPLIES(NeedsContext(), context_->IsWithContext());
@@ -529,14 +530,14 @@ ScopeIterator::ScopeType ScopeIterator::Type() const {
         DCHECK_IMPLIES(NeedsContext(), context_->IsEvalContext());
         return ScopeTypeEval;
       case SHADOW_REALM_SCOPE:
-        DCHECK_IMPLIES(NeedsContext(), context_->IsNativeContext());
+        DCHECK_IMPLIES(NeedsContext(), IsNativeContext(*context_));
         // TODO(v8:11989): New ScopeType for ShadowRealms?
         return ScopeTypeScript;
     }
     UNREACHABLE();
   }
-  if (context_->IsNativeContext()) {
-    DCHECK(context_->global_object().IsJSGlobalObject());
+  if (IsNativeContext(*context_)) {
+    DCHECK(IsJSGlobalObject(context_->global_object()));
     // If we are at the native context and have not yet seen script scope,
     // fake it.
     return seen_script_scope_ ? ScopeTypeGlobal : ScopeTypeScript;
@@ -577,7 +578,7 @@ Handle<JSObject> ScopeIterator::ScopeObject(Mode mode) {
   Handle<JSObject> scope = isolate_->factory()->NewSlowJSObjectWithNullProto();
   auto visitor = [=](Handle<String> name, Handle<Object> value,
                      ScopeType scope_type) {
-    if (value->IsOptimizedOut(isolate_)) {
+    if (IsOptimizedOut(*value, isolate_)) {
       if (v8_flags.experimental_value_unavailable) {
         JSObject::SetAccessor(scope, name,
                               isolate_->factory()->value_unavailable_accessor(),
@@ -587,7 +588,7 @@ Handle<JSObject> ScopeIterator::ScopeObject(Mode mode) {
       }
       // Reflect optimized out variables as undefined in scope object.
       value = isolate_->factory()->undefined_value();
-    } else if (value->IsTheHole(isolate_)) {
+    } else if (IsTheHole(*value, isolate_)) {
       if (scope_type == ScopeTypeScript &&
           JSReceiver::HasOwnProperty(isolate_, scope, name).FromMaybe(true)) {
         // We also use the hole to represent overridden let-declarations via
@@ -688,7 +689,7 @@ bool ScopeIterator::ClosureScopeHasThisReference() const {
 }
 
 void ScopeIterator::CollectLocalsFromCurrentScope() {
-  DCHECK(locals_->IsStringSet());
+  DCHECK(IsStringSet(*locals_));
   for (Variable* var : *current_scope_->locals()) {
     if (var->location() == VariableLocation::PARAMETER ||
         var->location() == VariableLocation::LOCAL) {
@@ -705,17 +706,17 @@ void ScopeIterator::DebugPrint() {
   switch (Type()) {
     case ScopeIterator::ScopeTypeGlobal:
       os << "Global:\n";
-      context_->Print(os);
+      Print(*context_, os);
       break;
 
     case ScopeIterator::ScopeTypeLocal: {
       os << "Local:\n";
       if (NeedsContext()) {
-        context_->Print(os);
+        Print(*context_, os);
         if (context_->has_extension()) {
           Handle<HeapObject> extension(context_->extension(), isolate_);
-          DCHECK(extension->IsJSContextExtensionObject());
-          extension->Print(os);
+          DCHECK(IsJSContextExtensionObject(*extension));
+          Print(*extension, os);
         }
       }
       break;
@@ -723,29 +724,28 @@ void ScopeIterator::DebugPrint() {
 
     case ScopeIterator::ScopeTypeWith:
       os << "With:\n";
-      context_->extension().Print(os);
+      Print(context_->extension(), os);
       break;
 
     case ScopeIterator::ScopeTypeCatch:
       os << "Catch:\n";
-      context_->extension().Print(os);
-      context_->get(Context::THROWN_OBJECT_INDEX).Print(os);
+      Print(context_->extension(), os);
+      Print(context_->get(Context::THROWN_OBJECT_INDEX), os);
       break;
 
     case ScopeIterator::ScopeTypeClosure:
       os << "Closure:\n";
-      context_->Print(os);
+      Print(*context_, os);
       if (context_->has_extension()) {
         Handle<HeapObject> extension(context_->extension(), isolate_);
-        DCHECK(extension->IsJSContextExtensionObject());
-        extension->Print(os);
+        DCHECK(IsJSContextExtensionObject(*extension));
+        Print(*extension, os);
       }
       break;
 
     case ScopeIterator::ScopeTypeScript:
       os << "Script:\n";
-      context_->global_object().native_context().script_context_table().Print(
-          os);
+      Print(context_->native_context()->script_context_table(), os);
       break;
 
     default:
@@ -761,15 +761,14 @@ int ScopeIterator::GetSourcePosition() const {
   } else {
     DCHECK(!generator_.is_null());
     SharedFunctionInfo::EnsureSourcePositionsAvailable(
-        isolate_, handle(generator_->function().shared(), isolate_));
+        isolate_, handle(generator_->function()->shared(), isolate_));
     return generator_->source_position();
   }
 }
 
 void ScopeIterator::VisitScriptScope(const Visitor& visitor) const {
-  Handle<JSGlobalObject> global(context_->global_object(), isolate_);
   Handle<ScriptContextTable> script_contexts(
-      global->native_context().script_context_table(), isolate_);
+      context_->native_context()->script_context_table(), isolate_);
 
   // Skip the first script since that just declares 'this'.
   for (int context_index = 1;
@@ -797,7 +796,7 @@ void ScopeIterator::VisitModuleScope(const Visitor& visitor) const {
     int index;
     Handle<String> name;
     {
-      String raw_name;
+      Tagged<String> raw_name;
       scope_info->ModuleVariable(i, &raw_name, &index);
       if (ScopeInfo::VariableIsSynthetic(raw_name)) continue;
       name = handle(raw_name, isolate_);
@@ -877,10 +876,10 @@ bool ScopeIterator::VisitLocals(const Visitor& visitor, Mode mode,
         if (frame_inspector_ == nullptr) {
           // Get the variable from the suspended generator.
           DCHECK(!generator_.is_null());
-          FixedArray parameters_and_registers =
+          Tagged<FixedArray> parameters_and_registers =
               generator_->parameters_and_registers();
-          DCHECK_LT(index, parameters_and_registers.length());
-          value = handle(parameters_and_registers.get(index), isolate_);
+          DCHECK_LT(index, parameters_and_registers->length());
+          value = handle(parameters_and_registers->get(index), isolate_);
         } else if (var->IsReceiver()) {
           value = frame_inspector_->GetReceiver();
         } else {
@@ -893,23 +892,23 @@ bool ScopeIterator::VisitLocals(const Visitor& visitor, Mode mode,
         if (frame_inspector_ == nullptr) {
           // Get the variable from the suspended generator.
           DCHECK(!generator_.is_null());
-          FixedArray parameters_and_registers =
+          Tagged<FixedArray> parameters_and_registers =
               generator_->parameters_and_registers();
           int parameter_count =
-              function_->shared().scope_info().ParameterCount();
+              function_->shared()->scope_info()->ParameterCount();
           index += parameter_count;
-          DCHECK_LT(index, parameters_and_registers.length());
-          value = handle(parameters_and_registers.get(index), isolate_);
+          DCHECK_LT(index, parameters_and_registers->length());
+          value = handle(parameters_and_registers->get(index), isolate_);
         } else {
           value = frame_inspector_->GetExpression(index);
-          if (value->IsOptimizedOut(isolate_)) {
+          if (IsOptimizedOut(*value, isolate_)) {
             // We'll rematerialize this later.
             if (current_scope_->is_declaration_scope() &&
                 current_scope_->AsDeclarationScope()->arguments() == var) {
               continue;
             }
           } else if (IsLexicalVariableMode(var->mode()) &&
-                     value->IsUndefined(isolate_) &&
+                     IsUndefined(*value, isolate_) &&
                      GetSourcePosition() != kNoSourcePosition &&
                      GetSourcePosition() <= var->initializer_position()) {
             // Variables that are `undefined` could also mean an elided hole
@@ -929,7 +928,7 @@ bool ScopeIterator::VisitLocals(const Visitor& visitor, Mode mode,
         // don't match (https://crbug.com/753338).
         // Return `undefined` if the context's ScopeInfo doesn't know anything
         // about this variable.
-        if (context_->scope_info().ContextSlotIndex(var->name()) != index) {
+        if (context_->scope_info()->ContextSlotIndex(var->name()) != index) {
           value = isolate_->factory()->undefined_value();
         } else {
           value = handle(context_->get(index), isolate_);
@@ -954,7 +953,7 @@ bool ScopeIterator::VisitLocals(const Visitor& visitor, Mode mode,
 // a proxy, return an empty object.
 Handle<JSObject> ScopeIterator::WithContextExtension() {
   DCHECK(context_->IsWithContext());
-  if (context_->extension_receiver().IsJSProxy()) {
+  if (IsJSProxy(context_->extension_receiver())) {
     return isolate_->factory()->NewSlowJSObjectWithNullProto();
   }
   return handle(JSObject::cast(context_->extension_receiver()), isolate_);
@@ -983,8 +982,9 @@ void ScopeIterator::VisitLocalScope(const Visitor& visitor, Mode mode,
       // FunctionGetArguments does.
       if (frame_inspector_ != nullptr && !closure_scope_->is_arrow_scope() &&
           (closure_scope_->arguments() == nullptr ||
-           frame_inspector_->GetExpression(closure_scope_->arguments()->index())
-               ->IsOptimizedOut(isolate_))) {
+           IsOptimizedOut(*frame_inspector_->GetExpression(
+                              closure_scope_->arguments()->index()),
+                          isolate_))) {
         JavaScriptFrame* frame = GetFrame();
         Handle<JSObject> arguments = Accessors::FunctionGetArguments(
             frame, frame_inspector_->inlined_frame_index());
@@ -1001,9 +1001,9 @@ void ScopeIterator::VisitLocalScope(const Visitor& visitor, Mode mode,
 
   if (mode == Mode::ALL && HasContext()) {
     DCHECK(!context_->IsScriptContext());
-    DCHECK(!context_->IsNativeContext());
+    DCHECK(!IsNativeContext(*context_));
     DCHECK(!context_->IsWithContext());
-    if (!context_->scope_info().SloppyEvalCanExtendVars()) return;
+    if (!context_->scope_info()->SloppyEvalCanExtendVars()) return;
     if (context_->extension_object().is_null()) return;
     Handle<JSObject> extension(context_->extension_object(), isolate_);
     Handle<FixedArray> keys =
@@ -1013,7 +1013,7 @@ void ScopeIterator::VisitLocalScope(const Visitor& visitor, Mode mode,
 
     for (int i = 0; i < keys->length(); i++) {
       // Names of variables introduced by eval are strings.
-      DCHECK(keys->get(i).IsString());
+      DCHECK(IsString(keys->get(i)));
       Handle<String> key(String::cast(keys->get(i)), isolate_);
       Handle<Object> value =
           JSReceiver::GetDataProperty(isolate_, extension, key);
@@ -1064,7 +1064,7 @@ bool ScopeIterator::SetLocalVariableValue(Handle<String> variable_name,
             // Set the variable in the suspended generator.
             DCHECK(!generator_.is_null());
             int parameter_count =
-                function_->shared().scope_info().ParameterCount();
+                function_->shared()->scope_info()->ParameterCount();
             index += parameter_count;
             Handle<FixedArray> parameters_and_registers(
                 generator_->parameters_and_registers(), isolate_);
@@ -1086,7 +1086,8 @@ bool ScopeIterator::SetLocalVariableValue(Handle<String> variable_name,
           // don't match (https://crbug.com/753338).
           // Skip the write if the context's ScopeInfo doesn't know anything
           // about this variable.
-          if (context_->scope_info().ContextSlotIndex(variable_name) != index) {
+          if (context_->scope_info()->ContextSlotIndex(variable_name) !=
+              index) {
             return false;
           }
           context_->set(index, *new_value);
@@ -1109,7 +1110,7 @@ bool ScopeIterator::SetContextExtensionValue(Handle<String> variable_name,
                                              Handle<Object> new_value) {
   if (!context_->has_extension()) return false;
 
-  DCHECK(context_->extension_object().IsJSContextExtensionObject());
+  DCHECK(IsJSContextExtensionObject(context_->extension_object()));
   Handle<JSObject> ext(context_->extension_object(), isolate_);
   LookupIterator it(isolate_, ext, variable_name, LookupIterator::OWN);
   Maybe<bool> maybe = JSReceiver::HasProperty(&it);
@@ -1122,7 +1123,7 @@ bool ScopeIterator::SetContextExtensionValue(Handle<String> variable_name,
 
 bool ScopeIterator::SetContextVariableValue(Handle<String> variable_name,
                                             Handle<Object> new_value) {
-  int slot_index = context_->scope_info().ContextSlotIndex(variable_name);
+  int slot_index = context_->scope_info()->ContextSlotIndex(variable_name);
   if (slot_index < 0) return false;
   context_->set(slot_index, *new_value);
   return true;
@@ -1135,7 +1136,7 @@ bool ScopeIterator::SetModuleVariableValue(Handle<String> variable_name,
   VariableMode mode;
   InitializationFlag init_flag;
   MaybeAssignedFlag maybe_assigned_flag;
-  cell_index = context_->scope_info().ModuleIndex(
+  cell_index = context_->scope_info()->ModuleIndex(
       *variable_name, &mode, &init_flag, &maybe_assigned_flag);
 
   // Setting imports is currently not supported.
@@ -1152,8 +1153,7 @@ bool ScopeIterator::SetModuleVariableValue(Handle<String> variable_name,
 bool ScopeIterator::SetScriptVariableValue(Handle<String> variable_name,
                                            Handle<Object> new_value) {
   Handle<ScriptContextTable> script_contexts(
-      context_->global_object().native_context().script_context_table(),
-      isolate_);
+      context_->native_context()->script_context_table(), isolate_);
   VariableLookupResult lookup_result;
   if (script_contexts->Lookup(variable_name, &lookup_result)) {
     Handle<Context> script_context = ScriptContextTable::GetContext(
@@ -1251,13 +1251,13 @@ Handle<ScopeInfo> LocalBlocklistsCollector::FindScopeInfoForScope(
     Scope* scope) const {
   DisallowGarbageCollection no_gc;
   SharedFunctionInfo::ScriptIterator iterator(isolate_, *script_);
-  for (SharedFunctionInfo info = iterator.Next(); !info.is_null();
+  for (Tagged<SharedFunctionInfo> info = iterator.Next(); !info.is_null();
        info = iterator.Next()) {
-    ScopeInfo scope_info = info.scope_info();
-    if (info.is_compiled() && !scope_info.is_null() &&
-        scope->start_position() == info.StartPosition() &&
-        scope->end_position() == info.EndPosition() &&
-        scope->scope_type() == scope_info.scope_type()) {
+    Tagged<ScopeInfo> scope_info = info->scope_info();
+    if (info->is_compiled() && !scope_info.is_null() &&
+        scope->start_position() == info->StartPosition() &&
+        scope->end_position() == info->EndPosition() &&
+        scope->scope_type() == scope_info->scope_type()) {
       return handle(scope_info, isolate_);
     }
   }
@@ -1281,7 +1281,7 @@ void LocalBlocklistsCollector::StoreFunctionBlocklists(
 void LocalBlocklistsCollector::CollectAndStore() {
   InitializeWithClosureScope();
 
-  while (scope_->outer_scope() && !context_->IsNativeContext()) {
+  while (scope_->outer_scope() && !IsNativeContext(*context_)) {
     AdvanceToNextNonHiddenScope();
     // 1. Add all stack-allocated variables of `scope_` to the various lists.
     CollectCurrentLocalsIntoBlocklists();
@@ -1298,7 +1298,7 @@ void LocalBlocklistsCollector::CollectAndStore() {
         // need to advance `context_`.
         isolate_->LocalsBlockListCacheSet(
             handle(context_->scope_info(), isolate_),
-            handle(context_->previous().scope_info(), isolate_),
+            handle(context_->previous()->scope_info(), isolate_),
             context_blocklist_);
         context_ = handle(context_->previous(), isolate_);
       }
@@ -1328,10 +1328,8 @@ void ScopeIterator::MaybeCollectAndStoreLocalBlocklists() const {
     return;
   }
 
-  DCHECK(isolate_
-             ->LocalsBlockListCacheGet(
-                 handle(function_->shared().scope_info(), isolate_))
-             .IsTheHole());
+  DCHECK(IsTheHole(isolate_->LocalsBlockListCacheGet(
+      handle(function_->shared()->scope_info(), isolate_))));
   LocalBlocklistsCollector collector(isolate_, script_, context_,
                                      closure_scope_);
   collector.CollectAndStore();
diff --git a/deps/v8/src/debug/debug-stack-trace-iterator.cc b/deps/v8/src/debug/debug-stack-trace-iterator.cc
index 0414fdac968a0c..7ef5f236e4f8b9 100644
--- a/deps/v8/src/debug/debug-stack-trace-iterator.cc
+++ b/deps/v8/src/debug/debug-stack-trace-iterator.cc
@@ -69,9 +69,10 @@ void DebugStackTraceIterator::Advance() {
 int DebugStackTraceIterator::GetContextId() const {
   DCHECK(!Done());
   Handle<Object> context = frame_inspector_->GetContext();
-  if (context->IsContext()) {
-    Object value = Context::cast(*context).native_context().debug_context_id();
-    if (value.IsSmi()) return Smi::ToInt(value);
+  if (IsContext(*context)) {
+    Object value =
+        Context::cast(*context)->native_context()->debug_context_id();
+    if (IsSmi(value)) return Smi::ToInt(value);
   }
   return 0;
 }
@@ -79,7 +80,7 @@ int DebugStackTraceIterator::GetContextId() const {
 v8::MaybeLocal<v8::Value> DebugStackTraceIterator::GetReceiver() const {
   DCHECK(!Done());
   if (frame_inspector_->IsJavaScript() &&
-      frame_inspector_->GetFunction()->shared().kind() ==
+      frame_inspector_->GetFunction()->shared()->kind() ==
           FunctionKind::kArrowFunction) {
     // FrameInspector is not able to get receiver for arrow function.
     // So let's try to fetch it using same logic as is used to retrieve 'this'
@@ -98,16 +99,16 @@ v8::MaybeLocal<v8::Value> DebugStackTraceIterator::GetReceiver() const {
       return v8::MaybeLocal<v8::Value>();
     }
     DisallowGarbageCollection no_gc;
-    int slot_index = context->scope_info().ContextSlotIndex(
+    int slot_index = context->scope_info()->ContextSlotIndex(
         ReadOnlyRoots(isolate_).this_string_handle());
     if (slot_index < 0) return v8::MaybeLocal<v8::Value>();
     Handle<Object> value = handle(context->get(slot_index), isolate_);
-    if (value->IsTheHole(isolate_)) return v8::MaybeLocal<v8::Value>();
+    if (IsTheHole(*value, isolate_)) return v8::MaybeLocal<v8::Value>();
     return Utils::ToLocal(value);
   }
 
   Handle<Object> value = frame_inspector_->GetReceiver();
-  if (value.is_null() || (value->IsSmi() || !value->IsTheHole(isolate_))) {
+  if (value.is_null() || (IsSmi(*value) || !IsTheHole(*value, isolate_))) {
     return Utils::ToLocal(value);
   }
   return v8::MaybeLocal<v8::Value>();
@@ -137,7 +138,7 @@ v8::Local<v8::String> DebugStackTraceIterator::GetFunctionDebugName() const {
 v8::Local<v8::debug::Script> DebugStackTraceIterator::GetScript() const {
   DCHECK(!Done());
   Handle<Object> value = frame_inspector_->GetScript();
-  if (!value->IsScript()) return v8::Local<v8::debug::Script>();
+  if (!IsScript(*value)) return v8::Local<v8::debug::Script>();
   return ToApiHandle<debug::Script>(Handle<Script>::cast(value));
 }
 
diff --git a/deps/v8/src/debug/debug-wasm-objects-inl.h b/deps/v8/src/debug/debug-wasm-objects-inl.h
index 18c6b4e9d4288d..3476e82b2171eb 100644
--- a/deps/v8/src/debug/debug-wasm-objects-inl.h
+++ b/deps/v8/src/debug/debug-wasm-objects-inl.h
@@ -20,8 +20,8 @@ OBJECT_CONSTRUCTORS_IMPL(WasmValueObject, JSObject)
 
 CAST_ACCESSOR(WasmValueObject)
 
-ACCESSORS(WasmValueObject, type, String, kTypeOffset)
-ACCESSORS(WasmValueObject, value, Object, kValueOffset)
+ACCESSORS(WasmValueObject, type, Tagged<String>, kTypeOffset)
+ACCESSORS(WasmValueObject, value, Tagged<Object>, kValueOffset)
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/debug/debug-wasm-objects.cc b/deps/v8/src/debug/debug-wasm-objects.cc
index 22d7c26a494bca..4f931c4fb34e93 100644
--- a/deps/v8/src/debug/debug-wasm-objects.cc
+++ b/deps/v8/src/debug/debug-wasm-objects.cc
@@ -72,7 +72,7 @@ Handle<Map> GetOrCreateDebugProxyMap(
     return handle(Map::cast(maps->get(id)), isolate);
   }
   auto tmp = (*create_template_fn)(reinterpret_cast<v8::Isolate*>(isolate));
-  auto fun = ApiNatives::InstantiateFunction(Utils::OpenHandle(*tmp))
+  auto fun = ApiNatives::InstantiateFunction(isolate, Utils::OpenHandle(*tmp))
                  .ToHandleChecked();
   auto map = JSFunction::GetDerivedMap(isolate, fun, fun).ToHandleChecked();
   Map::SetPrototype(isolate, map, isolate->factory()->null_value());
@@ -206,7 +206,7 @@ struct NamedDebugProxy : IndexedDebugProxy<T, id, Provider> {
     Handle<Symbol> symbol = isolate->factory()->wasm_debug_proxy_names_symbol();
     Handle<Object> table_or_undefined =
         JSObject::GetProperty(isolate, holder, symbol).ToHandleChecked();
-    if (!table_or_undefined->IsUndefined(isolate)) {
+    if (!IsUndefined(*table_or_undefined, isolate)) {
       return Handle<NameDictionary>::cast(table_or_undefined);
     }
     auto provider = T::GetProvider(holder, isolate);
@@ -276,10 +276,10 @@ struct FunctionsProxy : NamedDebugProxy<FunctionsProxy, kFunctionsProxy> {
   static Handle<Object> Get(Isolate* isolate,
                             Handle<WasmInstanceObject> instance,
                             uint32_t index) {
-    return handle(WasmInstanceObject::GetOrCreateWasmInternalFunction(
-                      isolate, instance, index)
-                      ->external(),
-                  isolate);
+    Handle<WasmInternalFunction> internal =
+        WasmInstanceObject::GetOrCreateWasmInternalFunction(isolate, instance,
+                                                            index);
+    return WasmInternalFunction::GetOrCreateExternal(internal);
   }
 
   static Handle<String> GetName(Isolate* isolate,
@@ -312,7 +312,7 @@ struct GlobalsProxy : NamedDebugProxy<GlobalsProxy, kGlobalsProxy> {
                                 Handle<WasmInstanceObject> instance,
                                 uint32_t index) {
     wasm::NamesProvider* names =
-        instance->module_object().native_module()->GetNamesProvider();
+        instance->module_object()->native_module()->GetNamesProvider();
     StringBuilder sb;
     names->PrintGlobalName(sb, index);
     return ToInternalString(sb, isolate);
@@ -324,20 +324,20 @@ struct MemoriesProxy : NamedDebugProxy<MemoriesProxy, kMemoriesProxy> {
   static constexpr char const* kClassName = "Memories";
 
   static uint32_t Count(Isolate* isolate, Handle<WasmInstanceObject> instance) {
-    return instance->has_memory_object() ? 1 : 0;
+    return instance->memory_objects()->length();
   }
 
   static Handle<Object> Get(Isolate* isolate,
                             Handle<WasmInstanceObject> instance,
                             uint32_t index) {
-    return handle(instance->memory_object(), isolate);
+    return handle(instance->memory_object(index), isolate);
   }
 
   static Handle<String> GetName(Isolate* isolate,
                                 Handle<WasmInstanceObject> instance,
                                 uint32_t index) {
     wasm::NamesProvider* names =
-        instance->module_object().native_module()->GetNamesProvider();
+        instance->module_object()->native_module()->GetNamesProvider();
     StringBuilder sb;
     names->PrintMemoryName(sb, index);
     return ToInternalString(sb, isolate);
@@ -349,20 +349,20 @@ struct TablesProxy : NamedDebugProxy<TablesProxy, kTablesProxy> {
   static constexpr char const* kClassName = "Tables";
 
   static uint32_t Count(Isolate* isolate, Handle<WasmInstanceObject> instance) {
-    return instance->tables().length();
+    return instance->tables()->length();
   }
 
   static Handle<Object> Get(Isolate* isolate,
                             Handle<WasmInstanceObject> instance,
                             uint32_t index) {
-    return handle(instance->tables().get(index), isolate);
+    return handle(instance->tables()->get(index), isolate);
   }
 
   static Handle<String> GetName(Isolate* isolate,
                                 Handle<WasmInstanceObject> instance,
                                 uint32_t index) {
     wasm::NamesProvider* names =
-        instance->module_object().native_module()->GetNamesProvider();
+        instance->module_object()->native_module()->GetNamesProvider();
     StringBuilder sb;
     names->PrintTableName(sb, index);
     return ToInternalString(sb, isolate);
@@ -381,7 +381,7 @@ struct LocalsProxy : NamedDebugProxy<LocalsProxy, kLocalsProxy, FixedArray> {
     auto function = debug_info->GetFunctionAtAddress(frame->pc());
     auto values = isolate->factory()->NewFixedArray(count + 2);
     Handle<WasmModuleObject> module_object(
-        frame->wasm_instance().module_object(), isolate);
+        frame->wasm_instance()->module_object(), isolate);
     for (int i = 0; i < count; ++i) {
       auto value = WasmValueObject::New(
           isolate,
@@ -390,7 +390,7 @@ struct LocalsProxy : NamedDebugProxy<LocalsProxy, kLocalsProxy, FixedArray> {
           module_object);
       values->set(i, *value);
     }
-    values->set(count + 0, frame->wasm_instance().module_object());
+    values->set(count + 0, frame->wasm_instance()->module_object());
     values->set(count + 1, Smi::FromInt(function.func_index));
     return NamedDebugProxy::Create(isolate, values);
   }
@@ -408,7 +408,7 @@ struct LocalsProxy : NamedDebugProxy<LocalsProxy, kLocalsProxy, FixedArray> {
                                 uint32_t index) {
     uint32_t count = Count(isolate, values);
     auto native_module =
-        WasmModuleObject::cast(values->get(count + 0)).native_module();
+        WasmModuleObject::cast(values->get(count + 0))->native_module();
     auto function_index = Smi::ToInt(Smi::cast(values->get(count + 1)));
     wasm::NamesProvider* names = native_module->GetNamesProvider();
     StringBuilder sb;
@@ -423,12 +423,14 @@ struct StackProxy : IndexedDebugProxy<StackProxy, kStackProxy, FixedArray> {
 
   static Handle<JSObject> Create(WasmFrame* frame) {
     auto isolate = frame->isolate();
-    auto debug_info =
-        frame->wasm_instance().module_object().native_module()->GetDebugInfo();
+    auto debug_info = frame->wasm_instance()
+                          ->module_object()
+                          ->native_module()
+                          ->GetDebugInfo();
     int count = debug_info->GetStackDepth(frame->pc());
     auto values = isolate->factory()->NewFixedArray(count);
     Handle<WasmModuleObject> module_object(
-        frame->wasm_instance().module_object(), isolate);
+        frame->wasm_instance()->module_object(), isolate);
     for (int i = 0; i < count; ++i) {
       auto value = WasmValueObject::New(
           isolate,
@@ -459,7 +461,7 @@ Handle<FixedArray> GetOrCreateInstanceProxyCache(
   Handle<Object> cache;
   Handle<Symbol> symbol = isolate->factory()->wasm_debug_proxy_cache_symbol();
   if (!Object::GetProperty(isolate, instance, symbol).ToHandle(&cache) ||
-      cache->IsUndefined(isolate)) {
+      IsUndefined(*cache, isolate)) {
     cache = isolate->factory()->NewFixedArrayWithHoles(kNumInstanceProxies);
     Object::SetProperty(isolate, instance, symbol, cache).Check();
   }
@@ -554,12 +556,12 @@ class ContextProxyPrototype {
         ASSIGN_RETURN_ON_EXCEPTION(
             isolate, delegate,
             JSObject::GetProperty(isolate, receiver, delegate_name), Object);
-        if (!delegate->IsUndefined(isolate)) {
+        if (!IsUndefined(*delegate, isolate)) {
           Handle<Object> value;
           ASSIGN_RETURN_ON_EXCEPTION(
               isolate, value, Object::GetProperty(isolate, delegate, name),
               Object);
-          if (!value->IsUndefined(isolate)) return value;
+          if (!IsUndefined(*value, isolate)) return value;
         }
       }
     }
@@ -795,13 +797,13 @@ struct StructProxy : NamedDebugProxy<StructProxy, kStructProxy, FixedArray> {
     Handle<FixedArray> data = isolate->factory()->NewFixedArray(kLength);
     data->set(kObjectIndex, *value);
     data->set(kModuleIndex, *module);
-    int struct_type_index = value->map().wasm_type_info().type_index();
+    int struct_type_index = value->map()->wasm_type_info()->type_index();
     data->set(kTypeIndexIndex, Smi::FromInt(struct_type_index));
     return NamedDebugProxy::Create(isolate, data);
   }
 
   static uint32_t Count(Isolate* isolate, Handle<FixedArray> data) {
-    return WasmStruct::cast(data->get(kObjectIndex)).type()->field_count();
+    return WasmStruct::cast(data->get(kObjectIndex))->type()->field_count();
   }
 
   static Handle<Object> Get(Isolate* isolate, Handle<FixedArray> data,
@@ -815,7 +817,7 @@ struct StructProxy : NamedDebugProxy<StructProxy, kStructProxy, FixedArray> {
   static Handle<String> GetName(Isolate* isolate, Handle<FixedArray> data,
                                 uint32_t index) {
     wasm::NativeModule* native_module =
-        WasmModuleObject::cast(data->get(kModuleIndex)).native_module();
+        WasmModuleObject::cast(data->get(kModuleIndex))->native_module();
     int struct_type_index = Smi::ToInt(Smi::cast(data->get(kTypeIndexIndex)));
     wasm::NamesProvider* names = native_module->GetNamesProvider();
     StringBuilder sb;
@@ -857,7 +859,7 @@ struct ArrayProxy : IndexedDebugProxy<ArrayProxy, kArrayProxy, FixedArray> {
   }
 
   static uint32_t Count(Isolate* isolate, Handle<FixedArray> data) {
-    return WasmArray::cast(data->get(kObjectIndex)).length();
+    return WasmArray::cast(data->get(kObjectIndex))->length();
   }
 
   static Handle<Object> Get(Isolate* isolate, Handle<FixedArray> data,
@@ -918,42 +920,48 @@ Handle<WasmValueObject> WasmValueObject::New(
     case wasm::kRefNull:
     case wasm::kRef: {
       Handle<Object> ref = value.to_ref();
-      if (ref->IsWasmStruct()) {
-        WasmTypeInfo type_info = ref->GetHeapObject().map().wasm_type_info();
+      if (IsWasmStruct(*ref)) {
+        Tagged<WasmTypeInfo> type_info =
+            HeapObject::cast(*ref)->map()->wasm_type_info();
         wasm::ValueType type = wasm::ValueType::FromIndex(
-            wasm::ValueKind::kRef, type_info.type_index());
-        Handle<WasmModuleObject> module(type_info.instance().module_object(),
-                                        isolate);
+            wasm::ValueKind::kRef, type_info->type_index());
+        // The cast is safe; structs always have the instance defined.
+        Handle<WasmModuleObject> module(
+            WasmInstanceObject::cast(type_info->instance())->module_object(),
+            isolate);
         t = GetRefTypeName(isolate, type, module->native_module());
         v = StructProxy::Create(isolate, Handle<WasmStruct>::cast(ref), module);
-      } else if (ref->IsWasmArray()) {
-        WasmTypeInfo type_info = ref->GetHeapObject().map().wasm_type_info();
+      } else if (IsWasmArray(*ref)) {
+        Tagged<WasmTypeInfo> type_info =
+            HeapObject::cast(*ref)->map()->wasm_type_info();
         wasm::ValueType type = wasm::ValueType::FromIndex(
-            wasm::ValueKind::kRef, type_info.type_index());
-        Handle<WasmModuleObject> module(type_info.instance().module_object(),
-                                        isolate);
+            wasm::ValueKind::kRef, type_info->type_index());
+        // The cast is safe; arrays always have the instance defined.
+        Handle<WasmModuleObject> module(
+            WasmInstanceObject::cast(type_info->instance())->module_object(),
+            isolate);
         t = GetRefTypeName(isolate, type, module->native_module());
         v = ArrayProxy::Create(isolate, Handle<WasmArray>::cast(ref), module);
-      } else if (ref->IsWasmInternalFunction()) {
+      } else if (IsWasmInternalFunction(*ref)) {
         auto internal_fct = Handle<WasmInternalFunction>::cast(ref);
-        v = handle(internal_fct->external(), isolate);
+        v = WasmInternalFunction::GetOrCreateExternal(internal_fct);
         // If the module is not provided by the caller, retrieve it from the
         // instance object. If the function was created in JavaScript using
         // `new WebAssembly.Function(...)`, a module for name resolution is not
         // available.
         if (module_object.is_null() &&
-            internal_fct->ref().IsWasmInstanceObject()) {
+            IsWasmInstanceObject(internal_fct->ref())) {
           module_object = handle(
-              WasmInstanceObject::cast(internal_fct->ref()).module_object(),
+              WasmInstanceObject::cast(internal_fct->ref())->module_object(),
               isolate);
         }
         t = GetRefTypeName(isolate, value.type(), module_object);
-      } else if (ref->IsWasmNull()) {
+      } else if (IsWasmNull(*ref)) {
         // TODO(manoskouk): Is this value correct?
         v = isolate->factory()->null_value();
         t = GetRefTypeName(isolate, value.type(), module_object);
-      } else if (ref->IsJSFunction() || ref->IsSmi() || ref->IsNull() ||
-                 ref->IsString() ||
+      } else if (IsJSFunction(*ref) || IsSmi(*ref) || IsNull(*ref) ||
+                 IsString(*ref) ||
                  value.type().is_reference_to(wasm::HeapType::kExtern) ||
                  value.type().is_reference_to(wasm::HeapType::kAny)) {
         t = GetRefTypeName(isolate, value.type(), module_object);
@@ -962,7 +970,7 @@ Handle<WasmValueObject> WasmValueObject::New(
         // Fail gracefully.
         base::EmbeddedVector<char, 64> error;
         int len = SNPrintF(error, "unimplemented object type: %d",
-                           HeapObject::cast(*ref).map().instance_type());
+                           HeapObject::cast(*ref)->map()->instance_type());
         t = GetRefTypeName(isolate, value.type(), module_object);
         v = isolate->factory()->InternalizeString(error.SubVector(0, len));
       }
@@ -1059,9 +1067,10 @@ Handle<ArrayList> AddWasmTableObjectInternalProperties(
     Handle<Object> entry = WasmTableObject::Get(isolate, table, i);
     wasm::WasmValue wasm_value(entry, table->type());
     Handle<WasmModuleObject> module;
-    if (table->instance().IsWasmInstanceObject()) {
+    if (IsWasmInstanceObject(table->instance())) {
       module = Handle<WasmModuleObject>(
-          WasmInstanceObject::cast(table->instance()).module_object(), isolate);
+          WasmInstanceObject::cast(table->instance())->module_object(),
+          isolate);
     }
     Handle<Object> debug_value =
         WasmValueObject::New(isolate, wasm_value, module);
diff --git a/deps/v8/src/debug/debug-wasm-objects.h b/deps/v8/src/debug/debug-wasm-objects.h
index fbf290150d1ff2..a464b33659ba49 100644
--- a/deps/v8/src/debug/debug-wasm-objects.h
+++ b/deps/v8/src/debug/debug-wasm-objects.h
@@ -38,8 +38,8 @@ class WasmValueObject : public JSObject {
  public:
   DECL_CAST(WasmValueObject)
 
-  DECL_ACCESSORS(type, String)
-  DECL_ACCESSORS(value, Object)
+  DECL_ACCESSORS(type, Tagged<String>)
+  DECL_ACCESSORS(value, Tagged<Object>)
 
   // Dispatched behavior.
   DECL_PRINTER(WasmValueObject)
diff --git a/deps/v8/src/debug/debug.cc b/deps/v8/src/debug/debug.cc
index ebbbe4d9a2bd75..6ad81e60c911e9 100644
--- a/deps/v8/src/debug/debug.cc
+++ b/deps/v8/src/debug/debug.cc
@@ -71,7 +71,7 @@ class Debug::TemporaryObjectsTracker : public HeapObjectAllocationTracker {
   }
 
   bool HasObject(Handle<HeapObject> obj) const {
-    if (obj->IsJSObject() &&
+    if (IsJSObject(*obj) &&
         Handle<JSObject>::cast(obj)->GetEmbedderFieldCount()) {
       // Embedder may store any pointers using embedder fields and implements
       // non trivial logic, e.g. create wrappers lazily and store pointer to
@@ -98,8 +98,7 @@ Debug::Debug(Isolate* isolate)
       break_on_caught_exception_(false),
       break_on_uncaught_exception_(false),
       side_effect_check_failed_(false),
-      debug_info_list_(nullptr),
-      feature_tracker_(isolate),
+      debug_infos_(isolate),
       isolate_(isolate) {
   ThreadInit();
 }
@@ -161,7 +160,7 @@ void BreakLocation::AllAtCurrentStatement(
   int offset = summary.code_offset();
   Handle<AbstractCode> abstract_code = summary.abstract_code();
   PtrComprCageBase cage_base = GetPtrComprCageBase(*debug_info);
-  if (abstract_code->IsCode(cage_base)) offset = offset - 1;
+  if (IsCode(*abstract_code, cage_base)) offset = offset - 1;
   int statement_position;
   {
     BreakIterator it(debug_info);
@@ -175,13 +174,14 @@ void BreakLocation::AllAtCurrentStatement(
   }
 }
 
-JSGeneratorObject BreakLocation::GetGeneratorObjectForSuspendedFrame(
+Tagged<JSGeneratorObject> BreakLocation::GetGeneratorObjectForSuspendedFrame(
     JavaScriptFrame* frame) const {
   DCHECK(IsSuspend());
   DCHECK_GE(generator_obj_reg_index_, 0);
 
-  Object generator_obj = UnoptimizedFrame::cast(frame)->ReadInterpreterRegister(
-      generator_obj_reg_index_);
+  Tagged<Object> generator_obj =
+      UnoptimizedFrame::cast(frame)->ReadInterpreterRegister(
+          generator_obj_reg_index_);
 
   return JSGeneratorObject::cast(generator_obj);
 }
@@ -220,7 +220,7 @@ bool BreakLocation::HasBreakPoint(Isolate* isolate,
     // Then check whether a break point at that source position would have
     // the same code offset. Otherwise it's just a break location that we can
     // step to, but not actually a location where we can put a break point.
-    DCHECK(abstract_code_->IsBytecodeArray(isolate));
+    DCHECK(IsBytecodeArray(*abstract_code_, isolate));
     BreakIterator it(debug_info);
     it.SkipToPosition(position_);
     return it.code_offset() == code_offset_;
@@ -247,8 +247,8 @@ BreakIterator::BreakIterator(Handle<DebugInfo> debug_info)
     : debug_info_(debug_info),
       break_index_(-1),
       source_position_iterator_(
-          debug_info->DebugBytecodeArray().SourcePositionTable()) {
-  position_ = debug_info->shared().StartPosition();
+          debug_info->DebugBytecodeArray()->SourcePositionTable()) {
+  position_ = debug_info->shared()->StartPosition();
   statement_position_ = position_;
   // There is at least one break location.
   DCHECK(!Done());
@@ -292,14 +292,14 @@ void BreakIterator::Next() {
 }
 
 DebugBreakType BreakIterator::GetDebugBreakType() {
-  BytecodeArray bytecode_array = debug_info_->OriginalBytecodeArray();
+  Tagged<BytecodeArray> bytecode_array = debug_info_->OriginalBytecodeArray();
   interpreter::Bytecode bytecode =
-      interpreter::Bytecodes::FromByte(bytecode_array.get(code_offset()));
+      interpreter::Bytecodes::FromByte(bytecode_array->get(code_offset()));
 
   // Make sure we read the actual bytecode, not a prefix scaling bytecode.
   if (interpreter::Bytecodes::IsPrefixScalingBytecode(bytecode)) {
-    bytecode =
-        interpreter::Bytecodes::FromByte(bytecode_array.get(code_offset() + 1));
+    bytecode = interpreter::Bytecodes::FromByte(
+        bytecode_array->get(code_offset() + 1));
   }
 
   if (bytecode == interpreter::Bytecode::kDebugger) {
@@ -341,9 +341,9 @@ void BreakIterator::ClearDebugBreak() {
   DebugBreakType debug_break_type = GetDebugBreakType();
   if (debug_break_type == DEBUGGER_STATEMENT) return;
   DCHECK(debug_break_type >= DEBUG_BREAK_SLOT);
-  BytecodeArray bytecode_array = debug_info_->DebugBytecodeArray();
-  BytecodeArray original = debug_info_->OriginalBytecodeArray();
-  bytecode_array.set(code_offset(), original.get(code_offset()));
+  Tagged<BytecodeArray> bytecode_array = debug_info_->DebugBytecodeArray();
+  Tagged<BytecodeArray> original = debug_info_->OriginalBytecodeArray();
+  bytecode_array->set(code_offset(), original->get(code_offset()));
 }
 
 BreakLocation BreakIterator::GetBreakLocation() {
@@ -358,7 +358,7 @@ BreakLocation BreakIterator::GetBreakLocation() {
     // index that holds the generator object by reading it directly off the
     // bytecode array, and we'll read the actual generator object off the
     // interpreter stack frame in GetGeneratorObjectForSuspendedFrame.
-    BytecodeArray bytecode_array = debug_info_->OriginalBytecodeArray();
+    Tagged<BytecodeArray> bytecode_array = debug_info_->OriginalBytecodeArray();
     interpreter::BytecodeArrayIterator iterator(
         handle(bytecode_array, isolate()), code_offset());
 
@@ -377,14 +377,6 @@ BreakLocation BreakIterator::GetBreakLocation() {
 
 Isolate* BreakIterator::isolate() { return debug_info_->GetIsolate(); }
 
-void DebugFeatureTracker::Track(DebugFeatureTracker::Feature feature) {
-  uint32_t mask = 1 << feature;
-  // Only count one sample per feature and isolate.
-  if (bitfield_ & mask) return;
-  isolate_->counters()->debug_feature_usage()->AddSample(feature);
-  bitfield_ |= mask;
-}
-
 // Threading support.
 void Debug::ThreadInit() {
   thread_local_.break_frame_id_ = StackFrameId::NO_ID;
@@ -467,17 +459,73 @@ void Debug::Iterate(RootVisitor* v, ThreadLocal* thread_local_data) {
                       FullObjectSlot(&thread_local_data->promise_stack_));
 }
 
-DebugInfoListNode::DebugInfoListNode(Isolate* isolate, DebugInfo debug_info)
-    : next_(nullptr) {
-  // Globalize the request debug info object and make it weak.
-  GlobalHandles* global_handles = isolate->global_handles();
-  debug_info_ = global_handles->Create(debug_info).location();
+void DebugInfoCollection::Insert(Tagged<SharedFunctionInfo> sfi,
+                                 Tagged<DebugInfo> debug_info) {
+  DisallowGarbageCollection no_gc;
+  base::SharedMutexGuard<base::kExclusive> mutex_guard(
+      isolate_->shared_function_info_access());
+
+  DCHECK_EQ(sfi, debug_info->shared());
+  DCHECK(!Contains(sfi));
+  HandleLocation location =
+      isolate_->global_handles()->Create(debug_info).location();
+  list_.push_back(location);
+  map_.emplace(sfi->unique_id(), location);
+  DCHECK(Contains(sfi));
+  DCHECK_EQ(list_.size(), map_.size());
+}
+
+bool DebugInfoCollection::Contains(Tagged<SharedFunctionInfo> sfi) const {
+  auto it = map_.find(sfi->unique_id());
+  if (it == map_.end()) return false;
+  DCHECK_EQ(DebugInfo::cast(Object(*it->second))->shared(), sfi);
+  return true;
+}
+
+base::Optional<DebugInfo> DebugInfoCollection::Find(
+    Tagged<SharedFunctionInfo> sfi) const {
+  auto it = map_.find(sfi->unique_id());
+  if (it == map_.end()) return {};
+  Tagged<DebugInfo> di = DebugInfo::cast(Object(*it->second));
+  DCHECK_EQ(di->shared(), sfi);
+  return di;
+}
+
+void DebugInfoCollection::DeleteSlow(Tagged<SharedFunctionInfo> sfi) {
+  DebugInfoCollection::Iterator it(this);
+  for (; it.HasNext(); it.Advance()) {
+    Tagged<DebugInfo> debug_info = it.Next();
+    if (debug_info->shared() != sfi) continue;
+    it.DeleteNext();
+    return;
+  }
+  UNREACHABLE();
+}
+
+Tagged<DebugInfo> DebugInfoCollection::EntryAsDebugInfo(size_t index) const {
+  DCHECK_LT(index, list_.size());
+  return DebugInfo::cast(Object(*list_[index]));
 }
 
-DebugInfoListNode::~DebugInfoListNode() {
-  if (debug_info_ == nullptr) return;
-  GlobalHandles::Destroy(debug_info_);
-  debug_info_ = nullptr;
+void DebugInfoCollection::DeleteIndex(size_t index) {
+  base::SharedMutexGuard<base::kExclusive> mutex_guard(
+      isolate_->shared_function_info_access());
+
+  Tagged<DebugInfo> debug_info = EntryAsDebugInfo(index);
+  Tagged<SharedFunctionInfo> sfi = debug_info->shared();
+  DCHECK(Contains(sfi));
+
+  auto it = map_.find(sfi->unique_id());
+  HandleLocation location = it->second;
+  DCHECK_EQ(location, list_[index]);
+  map_.erase(it);
+
+  list_[index] = list_.back();
+  list_.pop_back();
+
+  GlobalHandles::Destroy(location);
+  DCHECK(!Contains(sfi));
+  DCHECK_EQ(list_.size(), map_.size());
 }
 
 void Debug::Unload() {
@@ -500,9 +548,8 @@ Debug::OnInstrumentationBreak() {
   HandleScope scope(isolate_);
   DisableBreak no_recursive_break(this);
 
-  Handle<Context> native_context(isolate_->native_context());
   return debug_delegate_->BreakOnInstrumentation(
-      v8::Utils::ToLocal(native_context), kInstrumentationId);
+      v8::Utils::ToLocal(isolate_->native_context()), kInstrumentationId);
 }
 
 void Debug::Break(JavaScriptFrame* frame, Handle<JSFunction> break_target) {
@@ -519,7 +566,7 @@ void Debug::Break(JavaScriptFrame* frame, Handle<JSFunction> break_target) {
   if (!EnsureBreakInfo(shared)) return;
   PrepareFunctionForDebugExecution(shared);
 
-  Handle<DebugInfo> debug_info(shared->GetDebugInfo(), isolate_);
+  Handle<DebugInfo> debug_info(TryGetDebugInfo(*shared).value(), isolate_);
 
   // Find the break location where execution has stopped.
   BreakLocation location = BreakLocation::FromFrame(debug_info, frame);
@@ -661,8 +708,8 @@ bool Debug::IsBreakOnInstrumentation(Handle<DebugInfo> debug_info,
 
   Handle<Object> break_points =
       debug_info->GetBreakPoints(isolate_, location.position());
-  DCHECK(!break_points->IsUndefined(isolate_));
-  if (!break_points->IsFixedArray()) {
+  DCHECK(!IsUndefined(*break_points, isolate_));
+  if (!IsFixedArray(*break_points)) {
     const Handle<BreakPoint> break_point =
         Handle<BreakPoint>::cast(break_points);
     return break_point->id() == kInstrumentationId;
@@ -713,16 +760,29 @@ bool Debug::IsMutedAtCurrentLocation(JavaScriptFrame* frame) {
   return has_break_points && checked.is_null();
 }
 
+namespace {
+
+// Convenience helper for easier base::Optional translation.
+bool ToHandle(Isolate* isolate, base::Optional<DebugInfo> debug_info,
+              Handle<DebugInfo>* out) {
+  if (!debug_info.has_value()) return false;
+  *out = handle(debug_info.value(), isolate);
+  return true;
+}
+
+}  // namespace
+
 MaybeHandle<FixedArray> Debug::GetHitBreakpointsAtCurrentStatement(
     JavaScriptFrame* frame, bool* has_break_points) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   FrameSummary summary = FrameSummary::GetTop(frame);
   Handle<JSFunction> function = summary.AsJavaScript().function();
-  if (!function->shared().HasBreakInfo()) {
+  Handle<DebugInfo> debug_info;
+  if (!ToHandle(isolate_, TryGetDebugInfo(function->shared()), &debug_info) ||
+      !debug_info->HasBreakInfo()) {
     *has_break_points = false;
     return {};
   }
-  Handle<DebugInfo> debug_info(function->shared().GetDebugInfo(), isolate_);
   // Enter the debugger.
   DebugScope debug_scope(this);
   std::vector<BreakLocation> break_locations;
@@ -742,7 +802,7 @@ bool Debug::CheckBreakPoint(Handle<BreakPoint> break_point,
     return false;
   }
 
-  if (!break_point->condition().length()) return true;
+  if (!break_point->condition()->length()) return true;
   Handle<String> condition(break_point->condition(), isolate_);
   MaybeHandle<Object> maybe_result;
   Handle<Object> result;
@@ -773,13 +833,12 @@ bool Debug::CheckBreakPoint(Handle<BreakPoint> break_point,
 
   {
     RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebuggerCallback);
-    Handle<Context> native_context(isolate_->native_context());
     debug_delegate_->BreakpointConditionEvaluated(
-        v8::Utils::ToLocal(native_context), break_point->id(), exception_thrown,
-        v8::Utils::ToLocal(maybe_exception));
+        v8::Utils::ToLocal(isolate_->native_context()), break_point->id(),
+        exception_thrown, v8::Utils::ToLocal(maybe_exception));
   }
 
-  return !result.is_null() ? result->BooleanValue(isolate_) : false;
+  return !result.is_null() ? Object::BooleanValue(*result, isolate_) : false;
 }
 
 bool Debug::SetBreakpoint(Handle<SharedFunctionInfo> shared,
@@ -792,7 +851,7 @@ bool Debug::SetBreakpoint(Handle<SharedFunctionInfo> shared,
   if (!EnsureBreakInfo(shared)) return false;
   PrepareFunctionForDebugExecution(shared);
 
-  Handle<DebugInfo> debug_info(shared->GetDebugInfo(), isolate_);
+  Handle<DebugInfo> debug_info(TryGetDebugInfo(*shared).value(), isolate_);
   // Source positions starts with zero.
   DCHECK_LE(0, *source_position);
 
@@ -804,8 +863,6 @@ bool Debug::SetBreakpoint(Handle<SharedFunctionInfo> shared,
 
   ClearBreakPoints(debug_info);
   ApplyBreakPoints(debug_info);
-
-  feature_tracker()->Track(DebugFeatureTracker::kBreakPoint);
   return true;
 }
 
@@ -817,7 +874,7 @@ bool Debug::SetBreakPointForScript(Handle<Script> script,
   Handle<BreakPoint> break_point =
       isolate_->factory()->NewBreakPoint(*id, condition);
 #if V8_ENABLE_WEBASSEMBLY
-  if (script->type() == Script::TYPE_WASM) {
+  if (script->type() == Script::Type::kWasm) {
     RecordWasmScriptWithBreakpoints(script);
     return WasmScript::SetBreakPoint(script, source_position, break_point);
   }
@@ -829,7 +886,7 @@ bool Debug::SetBreakPointForScript(Handle<Script> script,
   // position.
   Handle<Object> result =
       FindInnermostContainingFunctionInfo(script, *source_position);
-  if (result->IsUndefined(isolate_)) return false;
+  if (IsUndefined(*result, isolate_)) return false;
 
   auto shared = Handle<SharedFunctionInfo>::cast(result);
   if (!EnsureBreakInfo(shared)) return false;
@@ -864,14 +921,14 @@ void Debug::ApplyBreakPoints(Handle<DebugInfo> debug_info) {
     debug_info->SetBreakAtEntry();
   } else {
     if (!debug_info->HasInstrumentedBytecodeArray()) return;
-    FixedArray break_points = debug_info->break_points();
-    for (int i = 0; i < break_points.length(); i++) {
-      if (break_points.get(i).IsUndefined(isolate_)) continue;
-      BreakPointInfo info = BreakPointInfo::cast(break_points.get(i));
-      if (info.GetBreakPointCount(isolate_) == 0) continue;
+    Tagged<FixedArray> break_points = debug_info->break_points();
+    for (int i = 0; i < break_points->length(); i++) {
+      if (IsUndefined(break_points->get(i), isolate_)) continue;
+      Tagged<BreakPointInfo> info = BreakPointInfo::cast(break_points->get(i));
+      if (info->GetBreakPointCount(isolate_) == 0) continue;
       DCHECK(debug_info->HasInstrumentedBytecodeArray());
       BreakIterator it(debug_info);
-      it.SkipToPosition(info.source_position());
+      it.SkipToPosition(info->source_position());
       it.SetDebugBreak();
     }
   }
@@ -901,17 +958,20 @@ void Debug::ClearBreakPoint(Handle<BreakPoint> break_point) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   HandleScope scope(isolate_);
 
-  for (DebugInfoListNode* node = debug_info_list_; node != nullptr;
-       node = node->next()) {
-    if (!node->debug_info()->HasBreakInfo()) continue;
-    Handle<Object> result = DebugInfo::FindBreakPointInfo(
-        isolate_, node->debug_info(), break_point);
-    if (result->IsUndefined(isolate_)) continue;
-    Handle<DebugInfo> debug_info = node->debug_info();
+  DebugInfoCollection::Iterator it(&debug_infos_);
+  for (; it.HasNext(); it.Advance()) {
+    Handle<DebugInfo> debug_info(it.Next(), isolate_);
+    if (!debug_info->HasBreakInfo()) continue;
+
+    Handle<Object> result =
+        DebugInfo::FindBreakPointInfo(isolate_, debug_info, break_point);
+    if (IsUndefined(*result, isolate_)) continue;
+
     if (DebugInfo::ClearBreakPoint(isolate_, debug_info, break_point)) {
       ClearBreakPoints(debug_info);
       if (debug_info->GetBreakPointCount(isolate_) == 0) {
-        RemoveBreakInfoAndMaybeFree(debug_info);
+        debug_info->ClearBreakInfo(isolate_);
+        if (debug_info->IsEmpty()) it.DeleteNext();
       } else {
         ApplyBreakPoints(debug_info);
       }
@@ -947,11 +1007,11 @@ bool Debug::SetBreakpointForFunction(Handle<SharedFunctionInfo> shared,
 #if V8_ENABLE_WEBASSEMBLY
   // Handle wasm function.
   if (shared->HasWasmExportedFunctionData()) {
-    int func_index = shared->wasm_exported_function_data().function_index();
+    int func_index = shared->wasm_exported_function_data()->function_index();
     Handle<WasmInstanceObject> wasm_instance(
-        shared->wasm_exported_function_data().instance(), isolate_);
-    Handle<Script> script(Script::cast(wasm_instance->module_object().script()),
-                          isolate_);
+        shared->wasm_exported_function_data()->instance(), isolate_);
+    Handle<Script> script(
+        Script::cast(wasm_instance->module_object()->script()), isolate_);
     return WasmScript::SetBreakPointOnFirstBreakableForFunction(
         script, func_index, breakpoint);
   }
@@ -970,7 +1030,7 @@ void Debug::RemoveBreakpoint(int id) {
 void Debug::SetInstrumentationBreakpointForWasmScript(Handle<Script> script,
                                                       int* id) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  DCHECK_EQ(Script::TYPE_WASM, script->type());
+  DCHECK_EQ(Script::Type::kWasm, script->type());
   *id = kInstrumentationId;
 
   Handle<BreakPoint> break_point = isolate_->factory()->NewBreakPoint(
@@ -981,7 +1041,7 @@ void Debug::SetInstrumentationBreakpointForWasmScript(Handle<Script> script,
 
 void Debug::RemoveBreakpointForWasmScript(Handle<Script> script, int id) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  if (script->type() == Script::TYPE_WASM) {
+  if (script->type() == Script::Type::kWasm) {
     WasmScript::ClearBreakPointById(script, id);
   }
 }
@@ -997,7 +1057,7 @@ void Debug::RecordWasmScriptWithBreakpoints(Handle<Script> script) {
     DisallowGarbageCollection no_gc;
     for (int idx = wasm_scripts_with_break_points_->length() - 1; idx >= 0;
          --idx) {
-      HeapObject wasm_script;
+      Tagged<HeapObject> wasm_script;
       if (wasm_scripts_with_break_points_->Get(idx).GetHeapObject(
               &wasm_script) &&
           wasm_script == *script) {
@@ -1029,12 +1089,12 @@ void Debug::ClearAllBreakPoints() {
     DisallowGarbageCollection no_gc;
     for (int idx = wasm_scripts_with_break_points_->length() - 1; idx >= 0;
          --idx) {
-      HeapObject raw_wasm_script;
+      Tagged<HeapObject> raw_wasm_script;
       if (wasm_scripts_with_break_points_->Get(idx).GetHeapObject(
               &raw_wasm_script)) {
-        Script wasm_script = Script::cast(raw_wasm_script);
+        Tagged<Script> wasm_script = Script::cast(raw_wasm_script);
         WasmScript::ClearAllBreakpoints(wasm_script);
-        wasm_script.wasm_native_module()->GetDebugInfo()->RemoveIsolate(
+        wasm_script->wasm_native_module()->GetDebugInfo()->RemoveIsolate(
             isolate_);
       }
     }
@@ -1051,7 +1111,7 @@ void Debug::FloodWithOneShot(Handle<SharedFunctionInfo> shared,
   if (!EnsureBreakInfo(shared)) return;
   PrepareFunctionForDebugExecution(shared);
 
-  Handle<DebugInfo> debug_info(shared->GetDebugInfo(), isolate_);
+  Handle<DebugInfo> debug_info(TryGetDebugInfo(*shared).value(), isolate_);
   // Flood the function with break points.
   DCHECK(debug_info->HasInstrumentedBytecodeArray());
   for (BreakIterator it(debug_info); !it.Done(); it.Next()) {
@@ -1082,8 +1142,8 @@ MaybeHandle<FixedArray> Debug::GetHitBreakPoints(Handle<DebugInfo> debug_info,
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   Handle<Object> break_points = debug_info->GetBreakPoints(isolate_, position);
   bool is_break_at_entry = debug_info->BreakAtEntry();
-  DCHECK(!break_points->IsUndefined(isolate_));
-  if (!break_points->IsFixedArray()) {
+  DCHECK(!IsUndefined(*break_points, isolate_));
+  if (!IsFixedArray(*break_points)) {
     const Handle<BreakPoint> break_point =
         Handle<BreakPoint>::cast(break_points);
     *has_break_points = break_point->id() != kInstrumentationId;
@@ -1141,7 +1201,7 @@ void Debug::PrepareStepIn(Handle<JSFunction> function) {
   if (IsBlackboxed(shared)) return;
   if (*function == thread_local_.ignore_step_into_function_) return;
   thread_local_.ignore_step_into_function_ = Smi::zero();
-  FloodWithOneShot(Handle<SharedFunctionInfo>(function->shared(), isolate_));
+  FloodWithOneShot(shared);
 }
 
 void Debug::PrepareStepInSuspendedGenerator() {
@@ -1153,7 +1213,7 @@ void Debug::PrepareStepInSuspendedGenerator() {
   thread_local_.last_step_action_ = StepInto;
   UpdateHookOnFunctionCall();
   Handle<JSFunction> function(
-      JSGeneratorObject::cast(thread_local_.suspended_generator_).function(),
+      JSGeneratorObject::cast(thread_local_.suspended_generator_)->function(),
       isolate_);
   FloodWithOneShot(Handle<SharedFunctionInfo>(function->shared(), isolate_));
   clear_suspended_generator();
@@ -1245,8 +1305,6 @@ void Debug::PrepareStep(StepAction step_action) {
   // If there is no JavaScript stack don't do anything.
   if (frame_id == StackFrameId::NO_ID) return;
 
-  feature_tracker()->Track(DebugFeatureTracker::kStepping);
-
   thread_local_.last_step_action_ = step_action;
 
   DebuggableStackFrameIterator frames_it(isolate_, frame_id);
@@ -1258,7 +1316,7 @@ void Debug::PrepareStep(StepAction step_action) {
 
   if (frame->is_java_script()) {
     JavaScriptFrame* js_frame = JavaScriptFrame::cast(frame);
-    DCHECK(js_frame->function().IsJSFunction());
+    DCHECK(IsJSFunction(js_frame->function()));
 
     // Get the debug info (create it if it does not exist).
     auto summary = FrameSummary::GetTop(frame).AsJavaScript();
@@ -1270,7 +1328,7 @@ void Debug::PrepareStep(StepAction step_action) {
     // PrepareFunctionForDebugExecution can invalidate Baseline frames
     js_frame = JavaScriptFrame::cast(frames_it.Reframe());
 
-    Handle<DebugInfo> debug_info(shared->GetDebugInfo(), isolate_);
+    Handle<DebugInfo> debug_info(TryGetDebugInfo(*shared).value(), isolate_);
     location = BreakLocation::FromFrame(debug_info, js_frame);
 
     // Any step at a return is a step-out, and a step-out at a suspend behaves
@@ -1338,14 +1396,24 @@ void Debug::PrepareStep(StepAction step_action) {
           // initial yield of async generators).
           Handle<JSReceiver> return_value(
               JSReceiver::cast(thread_local_.return_value_), isolate_);
-          Handle<Object> awaited_by = JSReceiver::GetDataProperty(
+          Handle<Object> awaited_by_holder = JSReceiver::GetDataProperty(
               isolate_, return_value,
               isolate_->factory()->promise_awaited_by_symbol());
-          if (awaited_by->IsJSGeneratorObject()) {
-            DCHECK(!has_suspended_generator());
-            thread_local_.suspended_generator_ = *awaited_by;
-            ClearStepping();
-            return;
+          if (IsWeakFixedArray(*awaited_by_holder, isolate_)) {
+            Handle<WeakFixedArray> weak_fixed_array =
+                Handle<WeakFixedArray>::cast(awaited_by_holder);
+            if (weak_fixed_array->length() == 1 &&
+                weak_fixed_array->Get(0).IsWeak()) {
+              Handle<HeapObject> awaited_by(
+                  weak_fixed_array->Get(0).GetHeapObjectAssumeWeak(isolate_),
+                  isolate_);
+              if (IsJSGeneratorObject(*awaited_by)) {
+                DCHECK(!has_suspended_generator());
+                thread_local_.suspended_generator_ = *awaited_by;
+                ClearStepping();
+                return;
+              }
+            }
           }
         }
       }
@@ -1400,29 +1468,31 @@ void Debug::PrepareStep(StepAction step_action) {
 }
 
 // Simple function for returning the source positions for active break points.
+// static
 Handle<Object> Debug::GetSourceBreakLocations(
     Isolate* isolate, Handle<SharedFunctionInfo> shared) {
   RCS_SCOPE(isolate, RuntimeCallCounterId::kDebugger);
-  if (!shared->HasBreakInfo()) {
+  if (!shared->HasBreakInfo(isolate)) {
     return isolate->factory()->undefined_value();
   }
 
-  Handle<DebugInfo> debug_info(shared->GetDebugInfo(), isolate);
+  Handle<DebugInfo> debug_info(
+      isolate->debug()->TryGetDebugInfo(*shared).value(), isolate);
   if (debug_info->GetBreakPointCount(isolate) == 0) {
     return isolate->factory()->undefined_value();
   }
   Handle<FixedArray> locations = isolate->factory()->NewFixedArray(
       debug_info->GetBreakPointCount(isolate));
   int count = 0;
-  for (int i = 0; i < debug_info->break_points().length(); ++i) {
-    if (!debug_info->break_points().get(i).IsUndefined(isolate)) {
-      BreakPointInfo break_point_info =
-          BreakPointInfo::cast(debug_info->break_points().get(i));
-      int break_points = break_point_info.GetBreakPointCount(isolate);
+  for (int i = 0; i < debug_info->break_points()->length(); ++i) {
+    if (!IsUndefined(debug_info->break_points()->get(i), isolate)) {
+      Tagged<BreakPointInfo> break_point_info =
+          BreakPointInfo::cast(debug_info->break_points()->get(i));
+      int break_points = break_point_info->GetBreakPointCount(isolate);
       if (break_points == 0) continue;
       for (int j = 0; j < break_points; ++j) {
         locations->set(count++,
-                       Smi::FromInt(break_point_info.source_position()));
+                       Smi::FromInt(break_point_info->source_position()));
       }
     }
   }
@@ -1455,9 +1525,10 @@ void Debug::ClearOneShot() {
   // The current implementation just runs through all the breakpoints. When the
   // last break point for a function is removed that function is automatically
   // removed from the list.
-  for (DebugInfoListNode* node = debug_info_list_; node != nullptr;
-       node = node->next()) {
-    Handle<DebugInfo> debug_info = node->debug_info();
+  HandleScope scope(isolate_);
+  DebugInfoCollection::Iterator it(&debug_infos_);
+  for (; it.HasNext(); it.Advance()) {
+    Handle<DebugInfo> debug_info(it.Next(), isolate_);
     ClearBreakPoints(debug_info);
     ApplyBreakPoints(debug_info);
   }
@@ -1466,7 +1537,7 @@ void Debug::ClearOneShot() {
 namespace {
 class DiscardBaselineCodeVisitor : public ThreadVisitor {
  public:
-  explicit DiscardBaselineCodeVisitor(SharedFunctionInfo shared)
+  explicit DiscardBaselineCodeVisitor(Tagged<SharedFunctionInfo> shared)
       : shared_(shared) {}
   DiscardBaselineCodeVisitor() : shared_(SharedFunctionInfo()) {}
 
@@ -1475,7 +1546,7 @@ class DiscardBaselineCodeVisitor : public ThreadVisitor {
     bool deopt_all = shared_ == SharedFunctionInfo();
     for (JavaScriptStackFrameIterator it(isolate, top); !it.done();
          it.Advance()) {
-      if (!deopt_all && it.frame()->function().shared() != shared_) continue;
+      if (!deopt_all && it.frame()->function()->shared() != shared_) continue;
       if (it.frame()->type() == StackFrame::BASELINE) {
         BaselineFrame* frame = BaselineFrame::cast(it.frame());
         int bytecode_offset = frame->GetBytecodeOffset();
@@ -1483,10 +1554,10 @@ class DiscardBaselineCodeVisitor : public ThreadVisitor {
         Address advance;
         if (bytecode_offset == kFunctionEntryBytecodeOffset) {
           advance = BUILTIN_CODE(isolate, BaselineOutOfLinePrologueDeopt)
-                        ->InstructionStart();
+                        ->instruction_start();
         } else {
           advance = BUILTIN_CODE(isolate, InterpreterEnterAtNextBytecode)
-                        ->InstructionStart();
+                        ->instruction_start();
         }
         PointerAuthentication::ReplacePC(pc_addr, advance, kSystemPointerSize);
         InterpretedFrame::cast(it.Reframe())
@@ -1507,7 +1578,7 @@ class DiscardBaselineCodeVisitor : public ThreadVisitor {
                   ? Builtin::kInterpreterEnterAtBytecode
                   : Builtin::kInterpreterEnterAtNextBytecode;
           Address advance_pc =
-              isolate->builtins()->code(advance).InstructionStart();
+              isolate->builtins()->code(advance)->instruction_start();
           PointerAuthentication::ReplacePC(pc_addr, advance_pc,
                                            kSystemPointerSize);
         }
@@ -1520,22 +1591,22 @@ class DiscardBaselineCodeVisitor : public ThreadVisitor {
 };
 }  // namespace
 
-void Debug::DiscardBaselineCode(SharedFunctionInfo shared) {
+void Debug::DiscardBaselineCode(Tagged<SharedFunctionInfo> shared) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  DCHECK(shared.HasBaselineCode());
+  DCHECK(shared->HasBaselineCode());
   DiscardBaselineCodeVisitor visitor(shared);
   visitor.VisitThread(isolate_, isolate_->thread_local_top());
   isolate_->thread_manager()->IterateArchivedThreads(&visitor);
   // TODO(v8:11429): Avoid this heap walk somehow.
   HeapObjectIterator iterator(isolate_->heap());
   auto trampoline = BUILTIN_CODE(isolate_, InterpreterEntryTrampoline);
-  shared.FlushBaselineCode();
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  shared->FlushBaselineCode();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (obj.IsJSFunction()) {
-      JSFunction fun = JSFunction::cast(obj);
-      if (fun.shared() == shared && fun.ActiveTierIsBaseline()) {
-        fun.set_code(*trampoline);
+    if (IsJSFunction(obj)) {
+      Tagged<JSFunction> fun = JSFunction::cast(obj);
+      if (fun->shared() == shared && fun->ActiveTierIsBaseline()) {
+        fun->set_code(*trampoline);
       }
     }
   }
@@ -1548,17 +1619,17 @@ void Debug::DiscardAllBaselineCode() {
   HeapObjectIterator iterator(isolate_->heap());
   auto trampoline = BUILTIN_CODE(isolate_, InterpreterEntryTrampoline);
   isolate_->thread_manager()->IterateArchivedThreads(&visitor);
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (obj.IsJSFunction()) {
-      JSFunction fun = JSFunction::cast(obj);
-      if (fun.ActiveTierIsBaseline()) {
-        fun.set_code(*trampoline);
+    if (IsJSFunction(obj)) {
+      Tagged<JSFunction> fun = JSFunction::cast(obj);
+      if (fun->ActiveTierIsBaseline()) {
+        fun->set_code(*trampoline);
       }
-    } else if (obj.IsSharedFunctionInfo()) {
-      SharedFunctionInfo shared = SharedFunctionInfo::cast(obj);
-      if (shared.HasBaselineCode()) {
-        shared.FlushBaselineCode();
+    } else if (IsSharedFunctionInfo(obj)) {
+      Tagged<SharedFunctionInfo> shared = SharedFunctionInfo::cast(obj);
+      if (shared->HasBaselineCode()) {
+        shared->FlushBaselineCode();
       }
     }
   }
@@ -1580,8 +1651,7 @@ void Debug::PrepareFunctionForDebugExecution(
   // info (containing the debug copy) upfront, but since we do not recompile,
   // preparing for break points cannot fail.
   DCHECK(shared->is_compiled());
-  DCHECK(shared->HasDebugInfo());
-  Handle<DebugInfo> debug_info = GetOrCreateDebugInfo(shared);
+  Handle<DebugInfo> debug_info(TryGetDebugInfo(*shared).value(), isolate_);
   if (debug_info->flags(kRelaxedLoad) & DebugInfo::kPreparedForDebugExecution) {
     return;
   }
@@ -1606,7 +1676,7 @@ void Debug::PrepareFunctionForDebugExecution(
   } else {
     // Update PCs on the stack to point to recompiled code.
     RedirectActiveFunctions redirect_visitor(
-        *shared, RedirectActiveFunctions::Mode::kUseDebugBytecode);
+        isolate_, *shared, RedirectActiveFunctions::Mode::kUseDebugBytecode);
     redirect_visitor.VisitThread(isolate_, isolate_->thread_local_top());
     isolate_->thread_manager()->IterateArchivedThreads(&redirect_visitor);
   }
@@ -1618,11 +1688,12 @@ void Debug::PrepareFunctionForDebugExecution(
 
 namespace {
 
-bool IsJSFunctionAndNeedsTrampoline(Object maybe_function) {
-  if (!maybe_function.IsJSFunction()) return false;
-
-  SharedFunctionInfo shared = JSFunction::cast(maybe_function).shared();
-  return shared.HasDebugInfo() && shared.GetDebugInfo().CanBreakAtEntry();
+bool IsJSFunctionAndNeedsTrampoline(Isolate* isolate,
+                                    Tagged<Object> maybe_function) {
+  if (!IsJSFunction(maybe_function)) return false;
+  base::Optional<DebugInfo> debug_info = isolate->debug()->TryGetDebugInfo(
+      JSFunction::cast(maybe_function)->shared());
+  return debug_info.has_value() && debug_info->CanBreakAtEntry();
 }
 
 }  // namespace
@@ -1632,16 +1703,17 @@ void Debug::InstallDebugBreakTrampoline() {
   // Check the list of debug infos whether the debug break trampoline needs to
   // be installed. If that's the case, iterate the heap for functions to rewire
   // to the trampoline.
-  HandleScope scope(isolate_);
   // If there is a breakpoint at function entry, we need to install trampoline.
   bool needs_to_use_trampoline = false;
   // If there we break at entry to an api callback, we need to clear ICs.
   bool needs_to_clear_ic = false;
-  for (DebugInfoListNode* current = debug_info_list_; current != nullptr;
-       current = current->next()) {
-    if (current->debug_info()->CanBreakAtEntry()) {
+
+  DebugInfoCollection::Iterator it(&debug_infos_);
+  for (; it.HasNext(); it.Advance()) {
+    Tagged<DebugInfo> debug_info = it.Next();
+    if (debug_info->CanBreakAtEntry()) {
       needs_to_use_trampoline = true;
-      if (current->debug_info()->shared().IsApiFunction()) {
+      if (debug_info->shared()->IsApiFunction()) {
         needs_to_clear_ic = true;
         break;
       }
@@ -1650,6 +1722,7 @@ void Debug::InstallDebugBreakTrampoline() {
 
   if (!needs_to_use_trampoline) return;
 
+  HandleScope scope(isolate_);
   Handle<Code> trampoline = BUILTIN_CODE(isolate_, DebugBreakTrampoline);
   std::vector<Handle<JSFunction>> needs_compile;
   using AccessorPairWithContext =
@@ -1660,38 +1733,38 @@ void Debug::InstallDebugBreakTrampoline() {
     std::set<AccessorPair> recorded;
     HeapObjectIterator iterator(isolate_->heap());
     DisallowGarbageCollection no_gc;
-    for (HeapObject obj = iterator.Next(); !obj.is_null();
+    for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
          obj = iterator.Next()) {
-      if (needs_to_clear_ic && obj.IsFeedbackVector()) {
-        FeedbackVector::cast(obj).ClearSlots(isolate_);
+      if (needs_to_clear_ic && IsFeedbackVector(obj)) {
+        FeedbackVector::cast(obj)->ClearSlots(isolate_);
         continue;
-      } else if (IsJSFunctionAndNeedsTrampoline(obj)) {
-        JSFunction fun = JSFunction::cast(obj);
-        if (!fun.is_compiled()) {
+      } else if (IsJSFunctionAndNeedsTrampoline(isolate_, obj)) {
+        Tagged<JSFunction> fun = JSFunction::cast(obj);
+        if (!fun->is_compiled()) {
           needs_compile.push_back(handle(fun, isolate_));
         } else {
-          fun.set_code(*trampoline);
+          fun->set_code(*trampoline);
         }
-      } else if (obj.IsJSObject()) {
-        JSObject object = JSObject::cast(obj);
-        DescriptorArray descriptors =
-            object.map().instance_descriptors(kRelaxedLoad);
-
-        for (InternalIndex i : object.map().IterateOwnDescriptors()) {
-          if (descriptors.GetDetails(i).kind() == PropertyKind::kAccessor) {
-            Object value = descriptors.GetStrongValue(i);
-            if (!value.IsAccessorPair()) continue;
-
-            AccessorPair accessor_pair = AccessorPair::cast(value);
-            if (!accessor_pair.getter().IsFunctionTemplateInfo() &&
-                !accessor_pair.setter().IsFunctionTemplateInfo()) {
+      } else if (IsJSObject(obj)) {
+        Tagged<JSObject> object = JSObject::cast(obj);
+        Tagged<DescriptorArray> descriptors =
+            object->map()->instance_descriptors(kRelaxedLoad);
+
+        for (InternalIndex i : object->map()->IterateOwnDescriptors()) {
+          if (descriptors->GetDetails(i).kind() == PropertyKind::kAccessor) {
+            Tagged<Object> value = descriptors->GetStrongValue(i);
+            if (!IsAccessorPair(value)) continue;
+
+            Tagged<AccessorPair> accessor_pair = AccessorPair::cast(value);
+            if (!IsFunctionTemplateInfo(accessor_pair->getter()) &&
+                !IsFunctionTemplateInfo(accessor_pair->setter())) {
               continue;
             }
             if (recorded.find(accessor_pair) != recorded.end()) continue;
 
             needs_instantiate.emplace_back(
                 handle(accessor_pair, isolate_),
-                object.GetCreationContext().ToHandleChecked());
+                object->GetCreationContext().ToHandleChecked());
             recorded.insert(accessor_pair);
           }
         }
@@ -1706,13 +1779,13 @@ void Debug::InstallDebugBreakTrampoline() {
     Handle<NativeContext> native_context = tuple.second;
     Handle<Object> getter = AccessorPair::GetComponent(
         isolate_, native_context, accessor_pair, ACCESSOR_GETTER);
-    if (IsJSFunctionAndNeedsTrampoline(*getter)) {
+    if (IsJSFunctionAndNeedsTrampoline(isolate_, *getter)) {
       Handle<JSFunction>::cast(getter)->set_code(*trampoline);
     }
 
     Handle<Object> setter = AccessorPair::GetComponent(
         isolate_, native_context, accessor_pair, ACCESSOR_SETTER);
-    if (IsJSFunctionAndNeedsTrampoline(*setter)) {
+    if (IsJSFunctionAndNeedsTrampoline(isolate_, *setter)) {
       Handle<JSFunction>::cast(setter)->set_code(*trampoline);
     }
   }
@@ -1771,7 +1844,7 @@ bool Debug::GetPossibleBreakpoints(Handle<Script> script, int start_position,
   if (restrict_to_function) {
     Handle<Object> result =
         FindInnermostContainingFunctionInfo(script, start_position);
-    if (result->IsUndefined(isolate_)) return false;
+    if (IsUndefined(*result, isolate_)) return false;
 
     // Make sure the function has set up the debug info.
     Handle<SharedFunctionInfo> shared =
@@ -1779,7 +1852,7 @@ bool Debug::GetPossibleBreakpoints(Handle<Script> script, int start_position,
     if (!EnsureBreakInfo(shared)) return false;
     PrepareFunctionForDebugExecution(shared);
 
-    Handle<DebugInfo> debug_info(shared->GetDebugInfo(), isolate_);
+    Handle<DebugInfo> debug_info(TryGetDebugInfo(*shared).value(), isolate_);
     FindBreakablePositions(debug_info, start_position, end_position, locations);
     return true;
   }
@@ -1791,8 +1864,8 @@ bool Debug::GetPossibleBreakpoints(Handle<Script> script, int start_position,
     return false;
   }
   for (const auto& candidate : candidates) {
-    CHECK(candidate->HasBreakInfo());
-    Handle<DebugInfo> debug_info(candidate->GetDebugInfo(), isolate_);
+    CHECK(candidate->HasBreakInfo(isolate_));
+    Handle<DebugInfo> debug_info(TryGetDebugInfo(*candidate).value(), isolate_);
     FindBreakablePositions(debug_info, start_position, end_position, locations);
   }
   return true;
@@ -1804,37 +1877,37 @@ class SharedFunctionInfoFinder {
       : current_start_position_(kNoSourcePosition),
         target_position_(target_position) {}
 
-  void NewCandidate(SharedFunctionInfo shared,
-                    JSFunction closure = JSFunction()) {
-    if (!shared.IsSubjectToDebugging()) return;
-    int start_position = shared.function_token_position();
+  void NewCandidate(Tagged<SharedFunctionInfo> shared,
+                    Tagged<JSFunction> closure = JSFunction()) {
+    if (!shared->IsSubjectToDebugging()) return;
+    int start_position = shared->function_token_position();
     if (start_position == kNoSourcePosition) {
-      start_position = shared.StartPosition();
+      start_position = shared->StartPosition();
     }
 
     if (start_position > target_position_) return;
-    if (target_position_ >= shared.EndPosition()) {
+    if (target_position_ >= shared->EndPosition()) {
       // The SharedFunctionInfo::EndPosition() is generally exclusive, but there
       // are assumptions in various places in the debugger that for script level
       // (toplevel function) there's an end position that is technically outside
       // the script. It might be worth revisiting the overall design here at
       // some point in the future.
-      if (!shared.is_toplevel() || target_position_ > shared.EndPosition()) {
+      if (!shared->is_toplevel() || target_position_ > shared->EndPosition()) {
         return;
       }
     }
 
     if (!current_candidate_.is_null()) {
       if (current_start_position_ == start_position &&
-          shared.EndPosition() == current_candidate_.EndPosition()) {
+          shared->EndPosition() == current_candidate_->EndPosition()) {
         // If we already have a matching closure, do not throw it away.
         if (!current_candidate_closure_.is_null() && closure.is_null()) return;
         // If a top-level function contains only one function
         // declaration the source for the top-level and the function
         // is the same. In that case prefer the non top-level function.
-        if (!current_candidate_.is_toplevel() && shared.is_toplevel()) return;
+        if (!current_candidate_->is_toplevel() && shared->is_toplevel()) return;
       } else if (start_position < current_start_position_ ||
-                 current_candidate_.EndPosition() < shared.EndPosition()) {
+                 current_candidate_->EndPosition() < shared->EndPosition()) {
         return;
       }
     }
@@ -1844,9 +1917,9 @@ class SharedFunctionInfoFinder {
     current_candidate_closure_ = closure;
   }
 
-  SharedFunctionInfo Result() { return current_candidate_; }
+  Tagged<SharedFunctionInfo> Result() { return current_candidate_; }
 
-  JSFunction ResultClosure() { return current_candidate_closure_; }
+  Tagged<JSFunction> ResultClosure() { return current_candidate_closure_; }
 
  private:
   SharedFunctionInfo current_candidate_;
@@ -1857,12 +1930,11 @@ class SharedFunctionInfoFinder {
 };
 
 namespace {
-SharedFunctionInfo FindSharedFunctionInfoCandidate(int position,
-                                                   Handle<Script> script,
-                                                   Isolate* isolate) {
+Tagged<SharedFunctionInfo> FindSharedFunctionInfoCandidate(
+    int position, Handle<Script> script, Isolate* isolate) {
   SharedFunctionInfoFinder finder(position);
   SharedFunctionInfo::ScriptIterator iterator(isolate, *script);
-  for (SharedFunctionInfo info = iterator.Next(); !info.is_null();
+  for (Tagged<SharedFunctionInfo> info = iterator.Next(); !info.is_null();
        info = iterator.Next()) {
     finder.NewCandidate(info);
   }
@@ -1874,9 +1946,10 @@ Handle<SharedFunctionInfo> Debug::FindClosestSharedFunctionInfoFromPosition(
     int position, Handle<Script> script,
     Handle<SharedFunctionInfo> outer_shared) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  CHECK(outer_shared->HasBreakInfo());
-  int closest_position = FindBreakablePosition(
-      Handle<DebugInfo>(outer_shared->GetDebugInfo(), isolate_), position);
+  Handle<DebugInfo> outer_debug_info(TryGetDebugInfo(*outer_shared).value(),
+                                     isolate_);
+  CHECK(outer_debug_info->HasBreakInfo());
+  int closest_position = FindBreakablePosition(outer_debug_info, position);
   Handle<SharedFunctionInfo> closest_candidate = outer_shared;
   if (closest_position == position) return outer_shared;
 
@@ -1894,8 +1967,8 @@ Handle<SharedFunctionInfo> Debug::FindClosestSharedFunctionInfoFromPosition(
   }
 
   for (auto candidate : candidates) {
-    CHECK(candidate->HasBreakInfo());
-    Handle<DebugInfo> debug_info(candidate->GetDebugInfo(), isolate_);
+    Handle<DebugInfo> debug_info(TryGetDebugInfo(*candidate).value(), isolate_);
+    CHECK(debug_info->HasBreakInfo());
     const int candidate_position = FindBreakablePosition(debug_info, position);
     if (candidate_position >= position &&
         candidate_position < closest_position) {
@@ -1919,16 +1992,16 @@ bool Debug::FindSharedFunctionInfosIntersectingRange(
     {
       DisallowGarbageCollection no_gc;
       SharedFunctionInfo::ScriptIterator iterator(isolate_, *script);
-      for (SharedFunctionInfo info = iterator.Next(); !info.is_null();
+      for (Tagged<SharedFunctionInfo> info = iterator.Next(); !info.is_null();
            info = iterator.Next()) {
-        if (info.EndPosition() < start_position ||
-            info.StartPosition() >= end_position) {
+        if (info->EndPosition() < start_position ||
+            info->StartPosition() >= end_position) {
           continue;
         }
-        candidateSubsumesRange |= info.StartPosition() <= start_position &&
-                                  info.EndPosition() >= end_position;
-        if (!info.IsSubjectToDebugging()) continue;
-        if (!info.is_compiled() && !info.allows_lazy_compilation()) continue;
+        candidateSubsumesRange |= info->StartPosition() <= start_position &&
+                                  info->EndPosition() >= end_position;
+        if (!info->IsSubjectToDebugging()) continue;
+        if (!info->is_compiled() && !info->allows_lazy_compilation()) continue;
         candidates.push_back(i::handle(info, isolate_));
       }
     }
@@ -1936,12 +2009,12 @@ bool Debug::FindSharedFunctionInfosIntersectingRange(
     if (!triedTopLevelCompile && !candidateSubsumesRange &&
         script->shared_function_info_count() > 0) {
       DCHECK_LE(script->shared_function_info_count(),
-                script->shared_function_infos().length());
-      MaybeObject maybeToplevel = script->shared_function_infos().Get(0);
-      HeapObject heap_object;
+                script->shared_function_infos()->length());
+      MaybeObject maybeToplevel = script->shared_function_infos()->Get(0);
+      Tagged<HeapObject> heap_object;
       const bool topLevelInfoExists =
-          maybeToplevel->GetHeapObject(&heap_object) &&
-          !heap_object.IsUndefined();
+          maybeToplevel.GetHeapObject(&heap_object) &&
+          !IsUndefined(heap_object);
       if (!topLevelInfoExists) {
         triedTopLevelCompile = true;
         const bool success = CompileTopLevel(isolate_, script);
@@ -1991,7 +2064,7 @@ Handle<Object> Debug::FindInnermostContainingFunctionInfo(Handle<Script> script,
     // If there is no shared function info for this script at all, there is
     // no point in looking for it by walking the heap.
 
-    SharedFunctionInfo shared;
+    Tagged<SharedFunctionInfo> shared;
     IsCompiledScope is_compiled_scope;
     {
       shared = FindSharedFunctionInfoCandidate(position, script, isolate_);
@@ -2005,7 +2078,7 @@ Handle<Object> Debug::FindInnermostContainingFunctionInfo(Handle<Script> script,
         continue;
       }
       // We found it if it's already compiled.
-      is_compiled_scope = shared.is_compiled_scope(isolate_);
+      is_compiled_scope = shared->is_compiled_scope(isolate_);
       if (is_compiled_scope.is_compiled()) {
         Handle<SharedFunctionInfo> shared_handle(shared, isolate_);
         // If the iteration count is larger than 1, we had to compile the outer
@@ -2022,7 +2095,7 @@ Handle<Object> Debug::FindInnermostContainingFunctionInfo(Handle<Script> script,
     HandleScope scope(isolate_);
     // InstructionStream that cannot be compiled lazily are internal and not
     // debuggable.
-    DCHECK(shared.allows_lazy_compilation());
+    DCHECK(shared->allows_lazy_compilation());
     if (!Compiler::Compile(isolate_, handle(shared, isolate_),
                            Compiler::CLEAR_EXCEPTION, &is_compiled_scope)) {
       break;
@@ -2035,7 +2108,10 @@ Handle<Object> Debug::FindInnermostContainingFunctionInfo(Handle<Script> script,
 bool Debug::EnsureBreakInfo(Handle<SharedFunctionInfo> shared) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   // Return if we already have the break info for shared.
-  if (shared->HasBreakInfo()) return true;
+  if (shared->HasBreakInfo(isolate_)) {
+    DCHECK(shared->is_compiled());
+    return true;
+  }
   if (!shared->IsSubjectToDebugging() && !CanBreakAtEntry(shared)) {
     return false;
   }
@@ -2074,14 +2150,13 @@ void Debug::CreateBreakInfo(Handle<SharedFunctionInfo> shared) {
 Handle<DebugInfo> Debug::GetOrCreateDebugInfo(
     Handle<SharedFunctionInfo> shared) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  if (shared->HasDebugInfo()) return handle(shared->GetDebugInfo(), isolate_);
 
-  // Create debug info and add it to the list.
-  Handle<DebugInfo> debug_info = isolate_->factory()->NewDebugInfo(shared);
-  DebugInfoListNode* node = new DebugInfoListNode(isolate_, *debug_info);
-  node->set_next(debug_info_list_);
-  debug_info_list_ = node;
+  if (base::Optional<DebugInfo> di = debug_infos_.Find(*shared)) {
+    return handle(di.value(), isolate_);
+  }
 
+  Handle<DebugInfo> debug_info = isolate_->factory()->NewDebugInfo(shared);
+  debug_infos_.Insert(*shared, *debug_info);
   return debug_info;
 }
 
@@ -2110,36 +2185,15 @@ void Debug::ClearAllDebuggerHints() {
       [=](Handle<DebugInfo> info) { info->set_debugger_hints(0); });
 }
 
-void Debug::FindDebugInfo(Handle<DebugInfo> debug_info,
-                          DebugInfoListNode** prev, DebugInfoListNode** curr) {
-  RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  HandleScope scope(isolate_);
-  *prev = nullptr;
-  *curr = debug_info_list_;
-  while (*curr != nullptr) {
-    if ((*curr)->debug_info().is_identical_to(debug_info)) return;
-    *prev = *curr;
-    *curr = (*curr)->next();
-  }
-
-  UNREACHABLE();
-}
-
 void Debug::ClearAllDebugInfos(const DebugInfoClearFunction& clear_function) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  DebugInfoListNode* prev = nullptr;
-  DebugInfoListNode* current = debug_info_list_;
-  while (current != nullptr) {
-    DebugInfoListNode* next = current->next();
-    Handle<DebugInfo> debug_info = current->debug_info();
+
+  HandleScope scope(isolate_);
+  DebugInfoCollection::Iterator it(&debug_infos_);
+  for (; it.HasNext(); it.Advance()) {
+    Handle<DebugInfo> debug_info(it.Next(), isolate_);
     clear_function(debug_info);
-    if (debug_info->IsEmpty()) {
-      FreeDebugInfoListNode(prev, current);
-      current = next;
-    } else {
-      prev = current;
-      current = next;
-    }
+    if (debug_info->IsEmpty()) it.DeleteNext();
   }
 }
 
@@ -2147,56 +2201,35 @@ void Debug::RemoveBreakInfoAndMaybeFree(Handle<DebugInfo> debug_info) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   debug_info->ClearBreakInfo(isolate_);
   if (debug_info->IsEmpty()) {
-    DebugInfoListNode* prev;
-    DebugInfoListNode* node;
-    FindDebugInfo(debug_info, &prev, &node);
-    FreeDebugInfoListNode(prev, node);
+    debug_infos_.DeleteSlow(debug_info->shared());
   }
 }
 
-void Debug::FreeDebugInfoListNode(DebugInfoListNode* prev,
-                                  DebugInfoListNode* node) {
-  RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  DCHECK(node->debug_info()->IsEmpty());
-
-  // Unlink from list. If prev is nullptr we are looking at the first element.
-  if (prev == nullptr) {
-    debug_info_list_ = node->next();
-  } else {
-    prev->set_next(node->next());
-  }
-
-  // Pack script back into the
-  // SFI::script_or_debug_info field.
-  Handle<DebugInfo> debug_info(node->debug_info());
-  debug_info->shared().set_script_or_debug_info(debug_info->script(),
-                                                kReleaseStore);
-
-  delete node;
-}
-
 bool Debug::IsBreakAtReturn(JavaScriptFrame* frame) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   HandleScope scope(isolate_);
 
   // Get the executing function in which the debug break occurred.
-  Handle<SharedFunctionInfo> shared(frame->function().shared(), isolate_);
+  Handle<SharedFunctionInfo> shared(frame->function()->shared(), isolate_);
 
   // With no debug info there are no break points, so we can't be at a return.
-  if (!shared->HasBreakInfo()) return false;
+  Handle<DebugInfo> debug_info;
+  if (!ToHandle(isolate_, TryGetDebugInfo(*shared), &debug_info) ||
+      !debug_info->HasBreakInfo()) {
+    return false;
+  }
 
   DCHECK(!frame->is_optimized());
-  Handle<DebugInfo> debug_info(shared->GetDebugInfo(), isolate_);
   BreakLocation location = BreakLocation::FromFrame(debug_info, frame);
   return location.IsReturn();
 }
 
 Handle<FixedArray> Debug::GetLoadedScripts() {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  isolate_->heap()->CollectAllGarbage(Heap::kNoGCFlags,
+  isolate_->heap()->CollectAllGarbage(GCFlag::kNoFlags,
                                       GarbageCollectionReason::kDebugger);
   Factory* factory = isolate_->factory();
-  if (!factory->script_list()->IsWeakArrayList()) {
+  if (!IsWeakArrayList(*factory->script_list())) {
     return factory->empty_fixed_array();
   }
   Handle<WeakArrayList> array =
@@ -2205,15 +2238,45 @@ Handle<FixedArray> Debug::GetLoadedScripts() {
   int length = 0;
   {
     Script::Iterator iterator(isolate_);
-    for (Script script = iterator.Next(); !script.is_null();
+    for (Tagged<Script> script = iterator.Next(); !script.is_null();
          script = iterator.Next()) {
-      if (script.HasValidSource()) results->set(length++, script);
+      if (script->HasValidSource()) results->set(length++, script);
     }
   }
   return FixedArray::ShrinkOrEmpty(isolate_, results, length);
 }
 
-base::Optional<Object> Debug::OnThrow(Handle<Object> exception) {
+base::Optional<DebugInfo> Debug::TryGetDebugInfo(
+    Tagged<SharedFunctionInfo> sfi) {
+  return debug_infos_.Find(sfi);
+}
+
+bool Debug::HasDebugInfo(Tagged<SharedFunctionInfo> sfi) {
+  return TryGetDebugInfo(sfi).has_value();
+}
+
+bool Debug::HasCoverageInfo(Tagged<SharedFunctionInfo> sfi) {
+  if (base::Optional<DebugInfo> debug_info = TryGetDebugInfo(sfi)) {
+    return debug_info->HasCoverageInfo();
+  }
+  return false;
+}
+
+bool Debug::HasBreakInfo(Tagged<SharedFunctionInfo> sfi) {
+  if (base::Optional<DebugInfo> debug_info = TryGetDebugInfo(sfi)) {
+    return debug_info->HasBreakInfo();
+  }
+  return false;
+}
+
+bool Debug::BreakAtEntry(Tagged<SharedFunctionInfo> sfi) {
+  if (base::Optional<DebugInfo> debug_info = TryGetDebugInfo(sfi)) {
+    return debug_info->BreakAtEntry();
+  }
+  return false;
+}
+
+base::Optional<Tagged<Object>> Debug::OnThrow(Handle<Object> exception) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   if (in_debug_scope() || ignore_events()) return {};
   // Temporarily clear any scheduled_exception to allow evaluating
@@ -2226,8 +2289,8 @@ base::Optional<Object> Debug::OnThrow(Handle<Object> exception) {
   }
   Handle<Object> maybe_promise = isolate_->GetPromiseOnStackOnThrow();
   OnException(exception, maybe_promise,
-              maybe_promise->IsJSPromise() ? v8::debug::kPromiseRejection
-                                           : v8::debug::kException);
+              IsJSPromise(*maybe_promise) ? v8::debug::kPromiseRejection
+                                          : v8::debug::kException);
   if (!scheduled_exception.is_null()) {
     isolate_->set_scheduled_exception(*scheduled_exception);
   }
@@ -2248,10 +2311,10 @@ void Debug::OnPromiseReject(Handle<Object> promise, Handle<Object> value) {
   HandleScope scope(isolate_);
   // Check whether the promise has been marked as having triggered a message.
   Handle<Symbol> key = isolate_->factory()->promise_debug_marker_symbol();
-  if (!promise->IsJSObject() ||
-      JSReceiver::GetDataProperty(isolate_, Handle<JSObject>::cast(promise),
-                                  key)
-          ->IsUndefined(isolate_)) {
+  if (!IsJSObject(*promise) ||
+      IsUndefined(*JSReceiver::GetDataProperty(
+                      isolate_, Handle<JSObject>::cast(promise), key),
+                  isolate_)) {
     OnException(value, promise, v8::debug::kPromiseRejection);
   }
 }
@@ -2298,7 +2361,7 @@ void Debug::OnException(Handle<Object> exception, Handle<Object> promise,
   Isolate::CatchType catch_type = isolate_->PredictExceptionCatcher();
 
   bool uncaught = catch_type == Isolate::NOT_CAUGHT;
-  if (promise->IsJSObject()) {
+  if (IsJSObject(*promise)) {
     Handle<JSObject> jsobject = Handle<JSObject>::cast(promise);
     // Mark the promise as already having triggered a message.
     Handle<Symbol> key = isolate_->factory()->promise_debug_marker_symbol();
@@ -2306,7 +2369,7 @@ void Debug::OnException(Handle<Object> exception, Handle<Object> promise,
                         Just(ShouldThrow::kThrowOnError))
         .Assert();
     // Check whether the promise reject is considered an uncaught exception.
-    if (jsobject->IsJSPromise()) {
+    if (IsJSPromise(*jsobject)) {
       Handle<JSPromise> jspromise = Handle<JSPromise>::cast(jsobject);
 
       // Ignore the exception if the promise was marked as silent
@@ -2344,10 +2407,10 @@ void Debug::OnException(Handle<Object> exception, Handle<Object> promise,
 
   {
     RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebuggerCallback);
-    Handle<Context> native_context(isolate_->native_context());
     debug_delegate_->ExceptionThrown(
-        v8::Utils::ToLocal(native_context), v8::Utils::ToLocal(exception),
-        v8::Utils::ToLocal(promise), uncaught, exception_type);
+        v8::Utils::ToLocal(isolate_->native_context()),
+        v8::Utils::ToLocal(exception), v8::Utils::ToLocal(promise), uncaught,
+        exception_type);
   }
 }
 
@@ -2380,24 +2443,23 @@ void Debug::OnDebugBreak(Handle<FixedArray> break_points_hit,
   std::vector<int> inspector_break_points_hit;
   // This array contains breakpoints installed using JS debug API.
   for (int i = 0; i < break_points_hit->length(); ++i) {
-    BreakPoint break_point = BreakPoint::cast(break_points_hit->get(i));
-    inspector_break_points_hit.push_back(break_point.id());
+    Tagged<BreakPoint> break_point = BreakPoint::cast(break_points_hit->get(i));
+    inspector_break_points_hit.push_back(break_point->id());
   }
   {
     RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebuggerCallback);
-    Handle<Context> native_context(isolate_->native_context());
     if (lastStepAction != StepAction::StepNone)
       break_reasons.Add(debug::BreakReason::kStep);
-    debug_delegate_->BreakProgramRequested(v8::Utils::ToLocal(native_context),
-                                           inspector_break_points_hit,
-                                           break_reasons);
+    debug_delegate_->BreakProgramRequested(
+        v8::Utils::ToLocal(isolate_->native_context()),
+        inspector_break_points_hit, break_reasons);
   }
 }
 
 namespace {
 debug::Location GetDebugLocation(Handle<Script> script, int source_position) {
   Script::PositionInfo info;
-  Script::GetPositionInfo(script, source_position, &info, Script::WITH_OFFSET);
+  Script::GetPositionInfo(script, source_position, &info);
   // V8 provides ScriptCompiler::CompileFunction method which takes
   // expression and compile it as anonymous function like (function() ..
   // expression ..). To produce correct locations for stmts inside of this
@@ -2414,13 +2476,13 @@ bool Debug::IsBlackboxed(Handle<SharedFunctionInfo> shared) {
   Handle<DebugInfo> debug_info = GetOrCreateDebugInfo(shared);
   if (!debug_info->computed_debug_is_blackboxed()) {
     bool is_blackboxed =
-        !shared->IsSubjectToDebugging() || !shared->script().IsScript();
+        !shared->IsSubjectToDebugging() || !IsScript(shared->script());
     if (!is_blackboxed) {
       SuppressDebug while_processing(this);
       HandleScope handle_scope(isolate_);
       PostponeInterruptsScope no_interrupts(isolate_);
       DisableBreak no_recursive_break(this);
-      DCHECK(shared->script().IsScript());
+      DCHECK(IsScript(shared->script()));
       Handle<Script> script(Script::cast(shared->script()), isolate_);
       DCHECK(script->IsUserJavaScript());
       debug::Location start = GetDebugLocation(script, shared->StartPosition());
@@ -2446,18 +2508,17 @@ bool Debug::ShouldBeSkipped() {
   DebuggableStackFrameIterator iterator(isolate_);
   FrameSummary summary = iterator.GetTopValidFrame();
   Handle<Object> script_obj = summary.script();
-  if (!script_obj->IsScript()) return false;
+  if (!IsScript(*script_obj)) return false;
 
   Handle<Script> script = Handle<Script>::cast(script_obj);
   summary.EnsureSourcePositionsAvailable();
   int source_position = summary.SourcePosition();
-  int line = Script::GetLineNumber(script, source_position);
-  int column = Script::GetColumnNumber(script, source_position);
-
+  Script::PositionInfo info;
+  Script::GetPositionInfo(script, source_position, &info);
   {
     RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebuggerCallback);
     return debug_delegate_->ShouldBeSkipped(ToApiHandle<debug::Script>(script),
-                                            line, column);
+                                            info.line, info.column);
   }
 }
 
@@ -2487,7 +2548,6 @@ bool Debug::SetScriptSource(Handle<Script> script, Handle<String> source,
                             debug::LiveEditResult* result) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   DebugScope debug_scope(this);
-  feature_tracker()->Track(DebugFeatureTracker::kLiveEdit);
   running_live_edit_ = true;
   LiveEdit::PatchScript(isolate_, script, source, preview,
                         allow_top_frame_live_editing, result);
@@ -2557,7 +2617,6 @@ void Debug::UpdateState() {
     isolate_->compilation_cache()->DisableScriptAndEval();
     isolate_->CollectSourcePositionsForAllBytecodeArrays();
     is_active = true;
-    feature_tracker()->Track(DebugFeatureTracker::kActive);
   } else {
     isolate_->compilation_cache()->EnableScriptAndEval();
     Unload();
@@ -2595,7 +2654,7 @@ void Debug::HandleDebugBreak(IgnoreBreakMode ignore_break_mode,
     JavaScriptFrame* frame = it.frame()->is_java_script()
                                  ? JavaScriptFrame::cast(it.frame())
                                  : nullptr;
-    if (frame && frame->function().IsJSFunction()) {
+    if (frame && IsJSFunction(frame->function())) {
       Handle<JSFunction> function(frame->function(), isolate_);
       Handle<SharedFunctionInfo> shared(function->shared(), isolate_);
 
@@ -2616,9 +2675,9 @@ void Debug::HandleDebugBreak(IgnoreBreakMode ignore_break_mode,
                               ? IsBlackboxed(shared)
                               : AllFramesOnStackAreBlackboxed();
       if (ignore_break) return;
-      if (function->shared().HasBreakInfo()) {
-        Handle<DebugInfo> debug_info(function->shared().GetDebugInfo(),
-                                     isolate_);
+      Handle<DebugInfo> debug_info;
+      if (ToHandle(isolate_, TryGetDebugInfo(*shared), &debug_info) &&
+          debug_info->HasBreakInfo()) {
         // Enter the debugger.
         DebugScope debug_scope(this);
 
@@ -2674,14 +2733,15 @@ void Debug::PrintBreakLocation() {
   PrintF("[debug] break in function '");
   inspector.GetFunctionName()->PrintOn(stdout);
   PrintF("'.\n");
-  if (script_obj->IsScript()) {
+  if (IsScript(*script_obj)) {
     Handle<Script> script = Handle<Script>::cast(script_obj);
     Handle<String> source(String::cast(script->source()), isolate_);
     Script::InitLineEnds(isolate_, script);
-    int line =
-        Script::GetLineNumber(script, source_position) - script->line_offset();
-    int column = Script::GetColumnNumber(script, source_position) -
-                 (line == 0 ? script->column_offset() : 0);
+    Script::PositionInfo info;
+    Script::GetPositionInfo(script, source_position, &info,
+                            Script::OffsetFlag::kNoOffset);
+    int line = info.line;
+    int column = info.column;
     Handle<FixedArray> line_ends(FixedArray::cast(script->line_ends()),
                                  isolate_);
     int line_start = line == 0 ? 0 : Smi::ToInt(line_ends->get(line - 1)) + 1;
@@ -2761,13 +2821,17 @@ void Debug::UpdateDebugInfosForExecutionMode() {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
   // Walk all debug infos and update their execution mode if it is different
   // from the isolate execution mode.
-  DebugInfoListNode* current = debug_info_list_;
-  while (current != nullptr) {
-    Handle<DebugInfo> debug_info = current->debug_info();
+  const DebugInfo::ExecutionMode current_debug_execution_mode =
+      isolate_->debug_execution_mode();
+
+  HandleScope scope(isolate_);
+  DebugInfoCollection::Iterator it(&debug_infos_);
+  for (; it.HasNext(); it.Advance()) {
+    Handle<DebugInfo> debug_info(it.Next(), isolate_);
     if (debug_info->HasInstrumentedBytecodeArray() &&
-        debug_info->DebugExecutionMode() != isolate_->debug_execution_mode()) {
-      DCHECK(debug_info->shared().HasBytecodeArray());
-      if (isolate_->debug_execution_mode() == DebugInfo::kBreakpoints) {
+        debug_info->DebugExecutionMode() != current_debug_execution_mode) {
+      DCHECK(debug_info->shared()->HasBytecodeArray());
+      if (current_debug_execution_mode == DebugInfo::kBreakpoints) {
         ClearSideEffectChecks(debug_info);
         ApplyBreakPoints(debug_info);
       } else {
@@ -2775,7 +2839,6 @@ void Debug::UpdateDebugInfosForExecutionMode() {
         ApplySideEffectChecks(debug_info);
       }
     }
-    current = current->next();
   }
 }
 
@@ -2789,7 +2852,7 @@ void Debug::SetTerminateOnResume() {
 
 void Debug::StartSideEffectCheckMode() {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  DCHECK(isolate_->debug_execution_mode() != DebugInfo::kSideEffects);
+  DCHECK_EQ(isolate_->debug_execution_mode(), DebugInfo::kBreakpoints);
   isolate_->set_debug_execution_mode(DebugInfo::kSideEffects);
   UpdateHookOnFunctionCall();
   side_effect_check_failed_ = false;
@@ -2808,7 +2871,7 @@ void Debug::StartSideEffectCheckMode() {
 
 void Debug::StopSideEffectCheckMode() {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  DCHECK(isolate_->debug_execution_mode() == DebugInfo::kSideEffects);
+  DCHECK_EQ(isolate_->debug_execution_mode(), DebugInfo::kSideEffects);
   if (side_effect_check_failed_) {
     DCHECK(isolate_->has_pending_exception());
     DCHECK_IMPLIES(v8_flags.strict_termination_checks,
@@ -2862,7 +2925,7 @@ bool Debug::PerformSideEffectCheck(Handle<JSFunction> function,
   DCHECK_EQ(isolate_->debug_execution_mode(), DebugInfo::kSideEffects);
   DisallowJavascriptExecution no_js(isolate_);
   IsCompiledScope is_compiled_scope(
-      function->shared().is_compiled_scope(isolate_));
+      function->shared()->is_compiled_scope(isolate_));
   if (!function->is_compiled() &&
       !Compiler::Compile(isolate_, function, Compiler::KEEP_EXCEPTION,
                          &is_compiled_scope)) {
@@ -2877,7 +2940,7 @@ bool Debug::PerformSideEffectCheck(Handle<JSFunction> function,
     case DebugInfo::kHasSideEffects:
       if (v8_flags.trace_side_effect_free_debug_evaluate) {
         PrintF("[debug-evaluate] Function %s failed side effect check.\n",
-               function->shared().DebugNameCStr().get());
+               function->shared()->DebugNameCStr().get());
       }
       side_effect_check_failed_ = true;
       // Throw an uncatchable termination exception.
@@ -2906,57 +2969,101 @@ Handle<Object> Debug::return_value_handle() {
   return handle(thread_local_.return_value_, isolate_);
 }
 
+bool Debug::PerformSideEffectCheckForAccessor(
+    Handle<AccessorInfo> accessor_info, Handle<Object> receiver,
+    AccessorComponent component) {
+  RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
+  DCHECK_EQ(isolate_->debug_execution_mode(), DebugInfo::kSideEffects);
+
+  // List of allowlisted internal accessors can be found in accessors.h.
+  SideEffectType side_effect_type =
+      component == AccessorComponent::ACCESSOR_SETTER
+          ? accessor_info->setter_side_effect_type()
+          : accessor_info->getter_side_effect_type();
+
+  switch (side_effect_type) {
+    case SideEffectType::kHasNoSideEffect:
+      // We do not support setter accessors with no side effects, since
+      // calling set accessors go through a store bytecode. Store bytecodes
+      // are considered to cause side effects (to non-temporary objects).
+      DCHECK_NE(AccessorComponent::ACCESSOR_SETTER, component);
+      return true;
+
+    case SideEffectType::kHasSideEffectToReceiver:
+      DCHECK(!receiver.is_null());
+      if (PerformSideEffectCheckForObject(receiver)) return true;
+      isolate_->OptionalRescheduleException(false);
+      return false;
+
+    case SideEffectType::kHasSideEffect:
+      break;
+  }
+  if (v8_flags.trace_side_effect_free_debug_evaluate) {
+    PrintF("[debug-evaluate] API Callback '");
+    ShortPrint(accessor_info->name());
+    PrintF("' may cause side effect.\n");
+  }
+
+  side_effect_check_failed_ = true;
+  // Throw an uncatchable termination exception.
+  isolate_->TerminateExecution();
+  isolate_->OptionalRescheduleException(false);
+  return false;
+}
+
+void Debug::IgnoreSideEffectsOnNextCallTo(
+    Handle<CallHandlerInfo> call_handler_info) {
+  DCHECK(call_handler_info->IsSideEffectCallHandlerInfo());
+  // There must be only one such call handler info.
+  CHECK(ignore_side_effects_for_call_handler_info_.is_null());
+  ignore_side_effects_for_call_handler_info_ = call_handler_info;
+}
+
 bool Debug::PerformSideEffectCheckForCallback(
-    Handle<Object> callback_info, Handle<Object> receiver,
-    Debug::AccessorKind accessor_kind) {
+    Handle<CallHandlerInfo> call_handler_info) {
   RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
-  DCHECK_EQ(!receiver.is_null(), callback_info->IsAccessorInfo());
   DCHECK_EQ(isolate_->debug_execution_mode(), DebugInfo::kSideEffects);
-  if (!callback_info.is_null() && callback_info->IsCallHandlerInfo() &&
-      i::CallHandlerInfo::cast(*callback_info).NextCallHasNoSideEffect()) {
+
+  // If an empty |call_handler_info| handle is passed here then it means that
+  // the callback IS side-effectful (see CallApiCallbackWithSideEffects
+  // builtin).
+  if (!call_handler_info.is_null() &&
+      call_handler_info->IsSideEffectFreeCallHandlerInfo()) {
     return true;
   }
-  // TODO(7515): always pass a valid callback info object.
-  if (!callback_info.is_null()) {
-    if (callback_info->IsAccessorInfo()) {
-      // List of allowlisted internal accessors can be found in accessors.h.
-      AccessorInfo info = AccessorInfo::cast(*callback_info);
-      DCHECK_NE(kNotAccessor, accessor_kind);
-      switch (accessor_kind == kSetter ? info.setter_side_effect_type()
-                                       : info.getter_side_effect_type()) {
-        case SideEffectType::kHasNoSideEffect:
-          // We do not support setter accessors with no side effects, since
-          // calling set accessors go through a store bytecode. Store bytecodes
-          // are considered to cause side effects (to non-temporary objects).
-          DCHECK_NE(kSetter, accessor_kind);
-          return true;
-        case SideEffectType::kHasSideEffectToReceiver:
-          DCHECK(!receiver.is_null());
-          if (PerformSideEffectCheckForObject(receiver)) return true;
-          isolate_->OptionalRescheduleException(false);
-          return false;
-        case SideEffectType::kHasSideEffect:
-          break;
-      }
-      if (v8_flags.trace_side_effect_free_debug_evaluate) {
-        PrintF("[debug-evaluate] API Callback '");
-        info.name().ShortPrint();
-        PrintF("' may cause side effect.\n");
-      }
-    } else if (callback_info->IsInterceptorInfo()) {
-      InterceptorInfo info = InterceptorInfo::cast(*callback_info);
-      if (info.has_no_side_effect()) return true;
-      if (v8_flags.trace_side_effect_free_debug_evaluate) {
-        PrintF("[debug-evaluate] API Interceptor may cause side effect.\n");
-      }
-    } else if (callback_info->IsCallHandlerInfo()) {
-      CallHandlerInfo info = CallHandlerInfo::cast(*callback_info);
-      if (info.IsSideEffectFreeCallHandlerInfo()) return true;
-      if (v8_flags.trace_side_effect_free_debug_evaluate) {
-        PrintF("[debug-evaluate] API CallHandlerInfo may cause side effect.\n");
-      }
-    }
+  if (!ignore_side_effects_for_call_handler_info_.is_null()) {
+    // If the |ignore_side_effects_for_call_handler_info_| is set then the next
+    // API callback call must be made to this function.
+    CHECK(ignore_side_effects_for_call_handler_info_.is_identical_to(
+        call_handler_info));
+    ignore_side_effects_for_call_handler_info_ = {};
+    return true;
+  }
+
+  if (v8_flags.trace_side_effect_free_debug_evaluate) {
+    PrintF("[debug-evaluate] API CallHandlerInfo may cause side effect.\n");
   }
+
+  side_effect_check_failed_ = true;
+  // Throw an uncatchable termination exception.
+  isolate_->TerminateExecution();
+  isolate_->OptionalRescheduleException(false);
+  return false;
+}
+
+bool Debug::PerformSideEffectCheckForInterceptor(
+    Handle<InterceptorInfo> interceptor_info) {
+  RCS_SCOPE(isolate_, RuntimeCallCounterId::kDebugger);
+  DCHECK_EQ(isolate_->debug_execution_mode(), DebugInfo::kSideEffects);
+
+  // Empty InterceptorInfo represents operations that do produce side effects.
+  if (!interceptor_info.is_null()) {
+    if (interceptor_info->has_no_side_effect()) return true;
+  }
+  if (v8_flags.trace_side_effect_free_debug_evaluate) {
+    PrintF("[debug-evaluate] API Interceptor may cause side effect.\n");
+  }
+
   side_effect_check_failed_ = true;
   // Throw an uncatchable termination exception.
   isolate_->TerminateExecution();
@@ -2969,8 +3076,8 @@ bool Debug::PerformSideEffectCheckAtBytecode(InterpretedFrame* frame) {
   using interpreter::Bytecode;
 
   DCHECK_EQ(isolate_->debug_execution_mode(), DebugInfo::kSideEffects);
-  SharedFunctionInfo shared = frame->function().shared();
-  BytecodeArray bytecode_array = shared.GetBytecodeArray(isolate_);
+  Tagged<SharedFunctionInfo> shared = frame->function()->shared();
+  Tagged<BytecodeArray> bytecode_array = shared->GetBytecodeArray(isolate_);
   int offset = frame->GetBytecodeOffset();
   interpreter::BytecodeArrayIterator bytecode_iterator(
       handle(bytecode_array, isolate_), offset);
@@ -3007,8 +3114,8 @@ bool Debug::PerformSideEffectCheckForObject(Handle<Object> object) {
   DCHECK_EQ(isolate_->debug_execution_mode(), DebugInfo::kSideEffects);
 
   // We expect no side-effects for primitives.
-  if (object->IsNumber()) return true;
-  if (object->IsName()) return true;
+  if (IsNumber(*object)) return true;
+  if (IsName(*object)) return true;
 
   if (temporary_objects_->HasObject(Handle<HeapObject>::cast(object))) {
     return true;
diff --git a/deps/v8/src/debug/debug.h b/deps/v8/src/debug/debug.h
index cf49ce66e81a4c..a96f057c51ea73 100644
--- a/deps/v8/src/debug/debug.h
+++ b/deps/v8/src/debug/debug.h
@@ -6,6 +6,7 @@
 #define V8_DEBUG_DEBUG_H_
 
 #include <memory>
+#include <unordered_map>
 #include <vector>
 
 #include "src/base/enum-set.h"
@@ -90,7 +91,7 @@ class BreakLocation {
 
   debug::BreakLocationType type() const;
 
-  JSGeneratorObject GetGeneratorObjectForSuspendedFrame(
+  Tagged<JSGeneratorObject> GetGeneratorObjectForSuspendedFrame(
       JavaScriptFrame* frame) const;
 
  private:
@@ -168,44 +169,74 @@ class V8_EXPORT_PRIVATE BreakIterator {
   DISALLOW_GARBAGE_COLLECTION(no_gc_)
 };
 
-// Linked list holding debug info objects. The debug info objects are kept as
-// weak handles to avoid a debug info object to keep a function alive.
-class DebugInfoListNode {
+// Holds all active DebugInfo objects. This is a composite data structure
+// consisting of
+//
+// - an unsorted list-like structure for fast iteration and
+//   deletion-during-iteration, and
+// - a map-like structure for fast SharedFunctionInfo-DebugInfo lookups.
+//
+// DebugInfos are held strongly through global handles.
+//
+// TODO(jgruber): Now that we use an unordered_map as the map-like structure,
+// which supports deletion-during-iteration, the list-like part of this data
+// structure could be removed.
+class DebugInfoCollection final {
+  using HandleLocation = Address*;
+  using SFIUniqueId = uint32_t;  // The type of SFI::unique_id.
+
  public:
-  DebugInfoListNode(Isolate* isolate, DebugInfo debug_info);
-  ~DebugInfoListNode();
+  explicit DebugInfoCollection(Isolate* isolate) : isolate_(isolate) {}
 
-  DebugInfoListNode* next() { return next_; }
-  void set_next(DebugInfoListNode* next) { next_ = next; }
-  Handle<DebugInfo> debug_info() { return Handle<DebugInfo>(debug_info_); }
+  void Insert(Tagged<SharedFunctionInfo> sfi, Tagged<DebugInfo> debug_info);
 
- private:
-  // Global (weak) handle to the debug info object.
-  Address* debug_info_;
+  bool Contains(Tagged<SharedFunctionInfo> sfi) const;
+  base::Optional<DebugInfo> Find(Tagged<SharedFunctionInfo> sfi) const;
 
-  // Next pointer for linked list.
-  DebugInfoListNode* next_;
-};
+  void DeleteSlow(Tagged<SharedFunctionInfo> sfi);
 
-class DebugFeatureTracker {
- public:
-  enum Feature {
-    kActive = 1,
-    kBreakPoint = 2,
-    kStepping = 3,
-    kHeapSnapshot = 4,
-    kAllocationTracking = 5,
-    kProfiler = 6,
-    kLiveEdit = 7,
-  };
+  size_t Size() const { return list_.size(); }
 
-  explicit DebugFeatureTracker(Isolate* isolate)
-      : isolate_(isolate), bitfield_(0) {}
-  void Track(Feature feature);
+  class Iterator final {
+   public:
+    explicit Iterator(DebugInfoCollection* collection)
+        : collection_(collection) {}
+
+    bool HasNext() const {
+      return index_ < static_cast<int>(collection_->list_.size());
+    }
+
+    Tagged<DebugInfo> Next() const {
+      DCHECK_GE(index_, 0);
+      if (!HasNext()) return {};
+      return collection_->EntryAsDebugInfo(index_);
+    }
+
+    void Advance() {
+      DCHECK(HasNext());
+      index_++;
+    }
+
+    void DeleteNext() {
+      DCHECK_GE(index_, 0);
+      DCHECK(HasNext());
+      collection_->DeleteIndex(index_);
+      index_--;  // `Advance` must be called next.
+    }
+
+   private:
+    using HandleLocation = DebugInfoCollection::HandleLocation;
+    DebugInfoCollection* const collection_;
+    int index_ = 0;  // `int` because deletion may rewind to -1.
+  };
 
  private:
-  Isolate* isolate_;
-  uint32_t bitfield_;
+  V8_EXPORT_PRIVATE Tagged<DebugInfo> EntryAsDebugInfo(size_t index) const;
+  void DeleteIndex(size_t index);
+
+  Isolate* const isolate_;
+  std::vector<HandleLocation> list_;
+  std::unordered_map<SFIUniqueId, HandleLocation> map_;
 };
 
 // This class contains the debugger support. The main purpose is to handle
@@ -225,7 +256,7 @@ class V8_EXPORT_PRIVATE Debug {
                     debug::BreakReasons break_reasons = {});
   debug::DebugDelegate::ActionAfterInstrumentation OnInstrumentationBreak();
 
-  base::Optional<Object> OnThrow(Handle<Object> exception)
+  base::Optional<Tagged<Object>> OnThrow(Handle<Object> exception)
       V8_WARN_UNUSED_RESULT;
   void OnPromiseReject(Handle<Object> promise, Handle<Object> value);
   void OnCompileError(Handle<Script> script);
@@ -241,6 +272,13 @@ class V8_EXPORT_PRIVATE Debug {
   // Scripts handling.
   Handle<FixedArray> GetLoadedScripts();
 
+  // DebugInfo accessors.
+  base::Optional<DebugInfo> TryGetDebugInfo(Tagged<SharedFunctionInfo> sfi);
+  bool HasDebugInfo(Tagged<SharedFunctionInfo> sfi);
+  bool HasCoverageInfo(Tagged<SharedFunctionInfo> sfi);
+  bool HasBreakInfo(Tagged<SharedFunctionInfo> sfi);
+  bool BreakAtEntry(Tagged<SharedFunctionInfo> sfi);
+
   // Break point handling.
   enum BreakPointKind { kRegular, kInstrumentation };
   bool SetBreakpoint(Handle<SharedFunctionInfo> shared,
@@ -284,7 +322,7 @@ class V8_EXPORT_PRIVATE Debug {
   void SetBreakOnNextFunctionCall();
   void ClearBreakOnNextFunctionCall();
 
-  void DiscardBaselineCode(SharedFunctionInfo shared);
+  void DiscardBaselineCode(Tagged<SharedFunctionInfo> shared);
   void DiscardAllBaselineCode();
 
   void DeoptimizeFunction(Handle<SharedFunctionInfo> shared);
@@ -356,13 +394,21 @@ class V8_EXPORT_PRIVATE Debug {
   void ApplySideEffectChecks(Handle<DebugInfo> debug_info);
   void ClearSideEffectChecks(Handle<DebugInfo> debug_info);
 
+  // Make a one-time exception for a next call to given side-effectful API
+  // function.
+  void IgnoreSideEffectsOnNextCallTo(Handle<CallHandlerInfo> call_handler_info);
+
   bool PerformSideEffectCheck(Handle<JSFunction> function,
                               Handle<Object> receiver);
 
-  enum AccessorKind { kNotAccessor, kGetter, kSetter };
-  bool PerformSideEffectCheckForCallback(Handle<Object> callback_info,
+  bool PerformSideEffectCheckForAccessor(Handle<AccessorInfo> accessor_info,
                                          Handle<Object> receiver,
-                                         AccessorKind accessor_kind);
+                                         AccessorComponent component);
+  bool PerformSideEffectCheckForCallback(
+      Handle<CallHandlerInfo> call_handler_info);
+  bool PerformSideEffectCheckForInterceptor(
+      Handle<InterceptorInfo> interceptor_info);
+
   bool PerformSideEffectCheckAtBytecode(InterpretedFrame* frame);
   bool PerformSideEffectCheckForObject(Handle<Object> object);
 
@@ -381,8 +427,10 @@ class V8_EXPORT_PRIVATE Debug {
   StackFrameId break_frame_id() { return thread_local_.break_frame_id_; }
 
   Handle<Object> return_value_handle();
-  Object return_value() { return thread_local_.return_value_; }
-  void set_return_value(Object value) { thread_local_.return_value_ = value; }
+  Tagged<Object> return_value() { return thread_local_.return_value_; }
+  void set_return_value(Tagged<Object> value) {
+    thread_local_.return_value_ = value;
+  }
 
   // Support for embedding into generated code.
   Address is_active_address() { return reinterpret_cast<Address>(&is_active_); }
@@ -420,8 +468,6 @@ class V8_EXPORT_PRIVATE Debug {
 
   inline bool break_disabled() const { return break_disabled_; }
 
-  DebugFeatureTracker* feature_tracker() { return &feature_tracker_; }
-
   // For functions in which we cannot set a break point, use a canonical
   // source position for break points.
   static const int kBreakAtEntryPosition = 0;
@@ -514,10 +560,6 @@ class V8_EXPORT_PRIVATE Debug {
   using DebugInfoClearFunction = std::function<void(Handle<DebugInfo>)>;
   void ClearAllDebugInfos(const DebugInfoClearFunction& clear_function);
 
-  void FindDebugInfo(Handle<DebugInfo> debug_info, DebugInfoListNode** prev,
-                     DebugInfoListNode** curr);
-  void FreeDebugInfoListNode(DebugInfoListNode* prev, DebugInfoListNode* node);
-
   void SetTemporaryObjectTrackingDisabled(bool disabled);
   bool GetTemporaryObjectTrackingDisabled() const;
 
@@ -544,7 +586,7 @@ class V8_EXPORT_PRIVATE Debug {
   bool side_effect_check_failed_;
 
   // List of active debug info objects.
-  DebugInfoListNode* debug_info_list_;
+  DebugInfoCollection debug_infos_;
 
   // Used for side effect check to mark temporary objects.
   class TemporaryObjectsTracker;
@@ -552,9 +594,6 @@ class V8_EXPORT_PRIVATE Debug {
 
   Handle<RegExpMatchInfo> regexp_match_info_;
 
-  // Used to collect histogram data on debugger feature usage.
-  DebugFeatureTracker feature_tracker_;
-
   // Per-thread data.
   class ThreadLocal {
    public:
@@ -630,6 +669,12 @@ class V8_EXPORT_PRIVATE Debug {
   Handle<WeakArrayList> wasm_scripts_with_break_points_;
 #endif  // V8_ENABLE_WEBASSEMBLY
 
+  // This is a part of machinery for allowing to ignore side effects for one
+  // call to this API function. See Function::NewInstanceWithSideEffectType().
+  // Since the call_handler_info is allowlisted right before the call to
+  // constructor there must be never more than one such object at a time.
+  Handle<CallHandlerInfo> ignore_side_effects_for_call_handler_info_;
+
   Isolate* isolate_;
 
   friend class Isolate;
diff --git a/deps/v8/src/debug/liveedit.cc b/deps/v8/src/debug/liveedit.cc
index b7ae4aa3ce7713..a40774e01e1dc0 100644
--- a/deps/v8/src/debug/liveedit.cc
+++ b/deps/v8/src/debug/liveedit.cc
@@ -20,6 +20,7 @@
 #include "src/execution/v8threads.h"
 #include "src/logging/log.h"
 #include "src/objects/js-generator-inl.h"
+#include "src/objects/js-objects.h"
 #include "src/objects/objects-inl.h"
 #include "src/parsing/parse-info.h"
 #include "src/parsing/parsing.h"
@@ -536,8 +537,8 @@ bool ParseScript(Isolate* isolate, Handle<Script> script, ParseInfo* parse_info,
     isolate->OptionalRescheduleException(false);
     DCHECK(try_catch.HasCaught());
     result->message = try_catch.Message()->Get();
-    auto self = Utils::OpenHandle(*try_catch.Message());
-    auto msg = i::Handle<i::JSMessageObject>::cast(self);
+    i::Handle<i::JSMessageObject> msg = Utils::OpenHandle(*try_catch.Message());
+    i::JSMessageObject::EnsureSourcePositionsAvailable(isolate, msg);
     result->line_number = msg->GetLineNumber();
     result->column_number = msg->GetColumnNumber();
     result->status = debug::LiveEditResult::COMPILE_ERROR;
@@ -568,13 +569,13 @@ class FunctionDataMap : public ThreadVisitor {
     map_.emplace(GetFuncId(script_id, literal), FunctionData{literal});
   }
 
-  bool Lookup(SharedFunctionInfo sfi, FunctionData** data) {
-    int start_position = sfi.StartPosition();
-    if (!sfi.script().IsScript() || start_position == -1) {
+  bool Lookup(Tagged<SharedFunctionInfo> sfi, FunctionData** data) {
+    int start_position = sfi->StartPosition();
+    if (!IsScript(sfi->script()) || start_position == -1) {
       return false;
     }
-    Script script = Script::cast(sfi.script());
-    return Lookup(GetFuncId(script.id(), sfi), data);
+    Tagged<Script> script = Script::cast(sfi->script());
+    return Lookup(GetFuncId(script->id(), sfi), data);
   }
 
   bool Lookup(Handle<Script> script, FunctionLiteral* literal,
@@ -586,23 +587,23 @@ class FunctionDataMap : public ThreadVisitor {
     {
       HeapObjectIterator iterator(isolate->heap(),
                                   HeapObjectIterator::kFilterUnreachable);
-      for (HeapObject obj = iterator.Next(); !obj.is_null();
+      for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
            obj = iterator.Next()) {
-        if (obj.IsSharedFunctionInfo()) {
-          SharedFunctionInfo sfi = SharedFunctionInfo::cast(obj);
+        if (IsSharedFunctionInfo(obj)) {
+          Tagged<SharedFunctionInfo> sfi = SharedFunctionInfo::cast(obj);
           FunctionData* data = nullptr;
           if (!Lookup(sfi, &data)) continue;
           data->shared = handle(sfi, isolate);
-        } else if (obj.IsJSFunction()) {
-          JSFunction js_function = JSFunction::cast(obj);
-          SharedFunctionInfo sfi = js_function.shared();
+        } else if (IsJSFunction(obj)) {
+          Tagged<JSFunction> js_function = JSFunction::cast(obj);
+          Tagged<SharedFunctionInfo> sfi = js_function->shared();
           FunctionData* data = nullptr;
           if (!Lookup(sfi, &data)) continue;
           data->js_functions.emplace_back(js_function, isolate);
-        } else if (obj.IsJSGeneratorObject()) {
-          JSGeneratorObject gen = JSGeneratorObject::cast(obj);
-          if (gen.is_closed()) continue;
-          SharedFunctionInfo sfi = gen.function().shared();
+        } else if (IsJSGeneratorObject(obj)) {
+          Tagged<JSGeneratorObject> gen = JSGeneratorObject::cast(obj);
+          if (gen->is_closed()) continue;
+          Tagged<SharedFunctionInfo> sfi = gen->function()->shared();
           FunctionData* data = nullptr;
           if (!Lookup(sfi, &data)) continue;
           data->running_generators.emplace_back(gen, isolate);
@@ -634,11 +635,11 @@ class FunctionDataMap : public ThreadVisitor {
     return FuncId(script_id, start_position);
   }
 
-  FuncId GetFuncId(int script_id, SharedFunctionInfo sfi) {
-    DCHECK_EQ(script_id, Script::cast(sfi.script()).id());
-    int start_position = sfi.StartPosition();
+  FuncId GetFuncId(int script_id, Tagged<SharedFunctionInfo> sfi) {
+    DCHECK_EQ(script_id, Script::cast(sfi->script())->id());
+    int start_position = sfi->StartPosition();
     DCHECK_NE(start_position, -1);
-    if (sfi.is_toplevel()) {
+    if (sfi->is_toplevel()) {
       // This is the top-level function, so special case its start position
       DCHECK_EQ(start_position, 0);
       start_position = -1;
@@ -759,39 +760,40 @@ void UpdatePositions(Isolate* isolate, Handle<SharedFunctionInfo> sfi,
 }
 
 #ifdef DEBUG
-ScopeInfo FindOuterScopeInfoFromScriptSfi(Isolate* isolate,
-                                          Handle<Script> script) {
+Tagged<ScopeInfo> FindOuterScopeInfoFromScriptSfi(Isolate* isolate,
+                                                  Handle<Script> script) {
   // We take some SFI from the script and walk outwards until we find the
   // EVAL_SCOPE. Then we do the same search as `DetermineOuterScopeInfo` and
   // check that we found the same ScopeInfo.
   SharedFunctionInfo::ScriptIterator it(isolate, *script);
-  ScopeInfo other_scope_info;
-  for (SharedFunctionInfo sfi = it.Next(); !sfi.is_null(); sfi = it.Next()) {
-    if (!sfi.scope_info().IsEmpty()) {
-      other_scope_info = sfi.scope_info();
+  Tagged<ScopeInfo> other_scope_info;
+  for (Tagged<SharedFunctionInfo> sfi = it.Next(); !sfi.is_null();
+       sfi = it.Next()) {
+    if (!sfi->scope_info()->IsEmpty()) {
+      other_scope_info = sfi->scope_info();
       break;
     }
   }
   if (other_scope_info.is_null()) return other_scope_info;
 
-  while (!other_scope_info.IsEmpty() &&
-         other_scope_info.scope_type() != EVAL_SCOPE &&
-         other_scope_info.HasOuterScopeInfo()) {
-    other_scope_info = other_scope_info.OuterScopeInfo();
+  while (!other_scope_info->IsEmpty() &&
+         other_scope_info->scope_type() != EVAL_SCOPE &&
+         other_scope_info->HasOuterScopeInfo()) {
+    other_scope_info = other_scope_info->OuterScopeInfo();
   }
 
   // This function is only called when we found a ScopeInfo candidate, so
   // technically the EVAL_SCOPE must have an outer_scope_info. But, the GC can
   // clean up some ScopeInfos it thinks are no longer needed. Abort the check
   // in that case.
-  if (!other_scope_info.HasOuterScopeInfo()) return ScopeInfo();
+  if (!other_scope_info->HasOuterScopeInfo()) return ScopeInfo();
 
-  DCHECK_EQ(other_scope_info.scope_type(), EVAL_SCOPE);
-  other_scope_info = other_scope_info.OuterScopeInfo();
+  DCHECK_EQ(other_scope_info->scope_type(), EVAL_SCOPE);
+  other_scope_info = other_scope_info->OuterScopeInfo();
 
-  while (!other_scope_info.IsEmpty() && !other_scope_info.HasContext() &&
-         other_scope_info.HasOuterScopeInfo()) {
-    other_scope_info = other_scope_info.OuterScopeInfo();
+  while (!other_scope_info->IsEmpty() && !other_scope_info->HasContext() &&
+         other_scope_info->HasOuterScopeInfo()) {
+    other_scope_info = other_scope_info->OuterScopeInfo();
   }
   return other_scope_info;
 }
@@ -802,22 +804,22 @@ ScopeInfo FindOuterScopeInfoFromScriptSfi(Isolate* isolate,
 MaybeHandle<ScopeInfo> DetermineOuterScopeInfo(Isolate* isolate,
                                                Handle<Script> script) {
   if (!script->has_eval_from_shared()) return kNullMaybeHandle;
-  DCHECK_EQ(script->compilation_type(), Script::COMPILATION_TYPE_EVAL);
-  ScopeInfo scope_info = script->eval_from_shared().scope_info();
+  DCHECK_EQ(script->compilation_type(), Script::CompilationType::kEval);
+  Tagged<ScopeInfo> scope_info = script->eval_from_shared()->scope_info();
   // Sloppy eval compiles use the ScopeInfo of the context. Let's find it.
-  while (!scope_info.IsEmpty()) {
-    if (scope_info.HasContext()) {
+  while (!scope_info->IsEmpty()) {
+    if (scope_info->HasContext()) {
 #ifdef DEBUG
-      ScopeInfo other_scope_info =
+      Tagged<ScopeInfo> other_scope_info =
           FindOuterScopeInfoFromScriptSfi(isolate, script);
       DCHECK_IMPLIES(!other_scope_info.is_null(),
                      scope_info == other_scope_info);
 #endif
       return handle(scope_info, isolate);
-    } else if (!scope_info.HasOuterScopeInfo()) {
+    } else if (!scope_info->HasOuterScopeInfo()) {
       break;
     }
-    scope_info = scope_info.OuterScopeInfo();
+    scope_info = scope_info->OuterScopeInfo();
   }
 
   return kNullMaybeHandle;
@@ -853,8 +855,8 @@ void LiveEdit::PatchScript(Isolate* isolate, Handle<Script> script,
                    &literals, result))
     return;
 
-  Handle<Script> new_script = isolate->factory()->CloneScript(script);
-  new_script->set_source(*new_source);
+  Handle<Script> new_script =
+      isolate->factory()->CloneScript(script, new_source);
   UnoptimizedCompileState new_compile_state;
   UnoptimizedCompileFlags new_flags =
       UnoptimizedCompileFlags::ForScriptCompile(isolate, *new_script);
@@ -911,16 +913,16 @@ void LiveEdit::PatchScript(Isolate* isolate, Handle<Script> script,
 
     isolate->compilation_cache()->Remove(sfi);
     isolate->debug()->DeoptimizeFunction(sfi);
-    if (sfi->HasDebugInfo()) {
-      Handle<DebugInfo> debug_info(sfi->GetDebugInfo(), isolate);
+    if (base::Optional<DebugInfo> di = sfi->TryGetDebugInfo(isolate)) {
+      Handle<DebugInfo> debug_info(di.value(), isolate);
       isolate->debug()->RemoveBreakInfoAndMaybeFree(debug_info);
     }
     SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, sfi);
     UpdatePositions(isolate, sfi, mapping.second, diffs);
 
-    sfi->set_script(*new_script);
+    sfi->set_script(*new_script, kReleaseStore);
     sfi->set_function_literal_id(mapping.second->function_literal_id());
-    new_script->shared_function_infos().Set(
+    new_script->shared_function_infos()->Set(
         mapping.second->function_literal_id(), HeapObjectReference::Weak(*sfi));
     DCHECK_EQ(sfi->function_literal_id(),
               mapping.second->function_literal_id());
@@ -939,17 +941,18 @@ void LiveEdit::PatchScript(Isolate* isolate, Handle<Script> script,
           *isolate->factory()->many_closures_cell());
       if (!js_function->is_compiled()) continue;
       IsCompiledScope is_compiled_scope(
-          js_function->shared().is_compiled_scope(isolate));
+          js_function->shared()->is_compiled_scope(isolate));
       JSFunction::EnsureFeedbackVector(isolate, js_function,
                                        &is_compiled_scope);
     }
 
     if (!sfi->HasBytecodeArray()) continue;
-    FixedArray constants = sfi->GetBytecodeArray(isolate).constant_pool();
-    for (int i = 0; i < constants.length(); ++i) {
-      if (!constants.get(i).IsSharedFunctionInfo()) continue;
+    Tagged<FixedArray> constants =
+        sfi->GetBytecodeArray(isolate)->constant_pool();
+    for (int i = 0; i < constants->length(); ++i) {
+      if (!IsSharedFunctionInfo(constants->get(i))) continue;
       data = nullptr;
-      if (!function_data_map.Lookup(SharedFunctionInfo::cast(constants.get(i)),
+      if (!function_data_map.Lookup(SharedFunctionInfo::cast(constants->get(i)),
                                     &data)) {
         continue;
       }
@@ -960,7 +963,7 @@ void LiveEdit::PatchScript(Isolate* isolate, Handle<Script> script,
       }
       Handle<SharedFunctionInfo> new_sfi;
       if (!data->shared.ToHandle(&new_sfi)) continue;
-      constants.set(i, *new_sfi);
+      constants->set(i, *new_sfi);
     }
   }
   for (const auto& mapping : changed) {
@@ -981,42 +984,45 @@ void LiveEdit::PatchScript(Isolate* isolate, Handle<Script> script,
     isolate->compilation_cache()->Remove(sfi);
     for (auto& js_function : data->js_functions) {
       js_function->set_shared(*new_sfi);
-      js_function->set_code(js_function->shared().GetCode(isolate));
+      js_function->set_code(js_function->shared()->GetCode(isolate));
 
       js_function->set_raw_feedback_cell(
           *isolate->factory()->many_closures_cell());
       if (!js_function->is_compiled()) continue;
       IsCompiledScope is_compiled_scope(
-          js_function->shared().is_compiled_scope(isolate));
+          js_function->shared()->is_compiled_scope(isolate));
       JSFunction::EnsureFeedbackVector(isolate, js_function,
                                        &is_compiled_scope);
     }
   }
   SharedFunctionInfo::ScriptIterator it(isolate, *new_script);
-  for (SharedFunctionInfo sfi = it.Next(); !sfi.is_null(); sfi = it.Next()) {
-    if (!sfi.HasBytecodeArray()) continue;
-    FixedArray constants = sfi.GetBytecodeArray(isolate).constant_pool();
-    for (int i = 0; i < constants.length(); ++i) {
-      if (!constants.get(i).IsSharedFunctionInfo()) continue;
-      SharedFunctionInfo inner_sfi = SharedFunctionInfo::cast(constants.get(i));
+  for (Tagged<SharedFunctionInfo> sfi = it.Next(); !sfi.is_null();
+       sfi = it.Next()) {
+    if (!sfi->HasBytecodeArray()) continue;
+    Tagged<FixedArray> constants =
+        sfi->GetBytecodeArray(isolate)->constant_pool();
+    for (int i = 0; i < constants->length(); ++i) {
+      if (!IsSharedFunctionInfo(constants->get(i))) continue;
+      Tagged<SharedFunctionInfo> inner_sfi =
+          SharedFunctionInfo::cast(constants->get(i));
       // See if there is a mapping from this function's start position to a
       // unchanged function's id.
       auto unchanged_it =
-          start_position_to_unchanged_id.find(inner_sfi.StartPosition());
+          start_position_to_unchanged_id.find(inner_sfi->StartPosition());
       if (unchanged_it == start_position_to_unchanged_id.end()) continue;
 
       // Grab that function id from the new script's SFI list, which should have
       // already been updated in in the unchanged pass.
-      SharedFunctionInfo old_unchanged_inner_sfi =
+      Tagged<SharedFunctionInfo> old_unchanged_inner_sfi =
           SharedFunctionInfo::cast(new_script->shared_function_infos()
-                                       .Get(unchanged_it->second)
-                                       ->GetHeapObject());
+                                       ->Get(unchanged_it->second)
+                                       .GetHeapObject());
       if (old_unchanged_inner_sfi == inner_sfi) continue;
       DCHECK_NE(old_unchanged_inner_sfi, inner_sfi);
       // Now some sanity checks. Make sure that the unchanged SFI has already
       // been processed and patched to be on the new script ...
-      DCHECK_EQ(old_unchanged_inner_sfi.script(), *new_script);
-      constants.set(i, old_unchanged_inner_sfi);
+      DCHECK_EQ(old_unchanged_inner_sfi->script(), *new_script);
+      constants->set(i, old_unchanged_inner_sfi);
     }
   }
 #ifdef DEBUG
@@ -1028,31 +1034,32 @@ void LiveEdit::PatchScript(Isolate* isolate, Handle<Script> script,
 
     SharedFunctionInfo::ScriptIterator script_it(isolate, *new_script);
     std::set<int> start_positions;
-    for (SharedFunctionInfo sfi = script_it.Next(); !sfi.is_null();
+    for (Tagged<SharedFunctionInfo> sfi = script_it.Next(); !sfi.is_null();
          sfi = script_it.Next()) {
-      DCHECK_EQ(sfi.script(), *new_script);
-      DCHECK_EQ(sfi.function_literal_id(), script_it.CurrentIndex());
+      DCHECK_EQ(sfi->script(), *new_script);
+      DCHECK_EQ(sfi->function_literal_id(), script_it.CurrentIndex());
       // Don't check the start position of the top-level function, as it can
       // overlap with a function in the script.
-      if (sfi.is_toplevel()) {
-        DCHECK_EQ(start_positions.find(sfi.StartPosition()),
+      if (sfi->is_toplevel()) {
+        DCHECK_EQ(start_positions.find(sfi->StartPosition()),
                   start_positions.end());
-        start_positions.insert(sfi.StartPosition());
+        start_positions.insert(sfi->StartPosition());
       }
 
-      if (!sfi.HasBytecodeArray()) continue;
+      if (!sfi->HasBytecodeArray()) continue;
       // Check that all the functions in this function's constant pool are also
       // on the new script, and that their id matches their index in the new
       // scripts function list.
-      FixedArray constants = sfi.GetBytecodeArray(isolate).constant_pool();
-      for (int i = 0; i < constants.length(); ++i) {
-        if (!constants.get(i).IsSharedFunctionInfo()) continue;
-        SharedFunctionInfo inner_sfi =
-            SharedFunctionInfo::cast(constants.get(i));
-        DCHECK_EQ(inner_sfi.script(), *new_script);
+      Tagged<FixedArray> constants =
+          sfi->GetBytecodeArray(isolate)->constant_pool();
+      for (int i = 0; i < constants->length(); ++i) {
+        if (!IsSharedFunctionInfo(constants->get(i))) continue;
+        Tagged<SharedFunctionInfo> inner_sfi =
+            SharedFunctionInfo::cast(constants->get(i));
+        DCHECK_EQ(inner_sfi->script(), *new_script);
         DCHECK_EQ(inner_sfi, new_script->shared_function_infos()
-                                 .Get(inner_sfi.function_literal_id())
-                                 ->GetHeapObject());
+                                 ->Get(inner_sfi->function_literal_id())
+                                 .GetHeapObject());
       }
     }
   }
diff --git a/deps/v8/src/debug/wasm/gdb-server/gdb-server.cc b/deps/v8/src/debug/wasm/gdb-server/gdb-server.cc
index c523f3d70a0af2..cb7065336893c6 100644
--- a/deps/v8/src/debug/wasm/gdb-server/gdb-server.cc
+++ b/deps/v8/src/debug/wasm/gdb-server/gdb-server.cc
@@ -371,7 +371,7 @@ void GdbServer::PrepareStep() {
 void GdbServer::AddWasmModule(uint32_t module_id,
                               Local<debug::WasmScript> wasm_script) {
   // Executed in the isolate thread.
-  DCHECK_EQ(Script::TYPE_WASM, Utils::OpenHandle(*wasm_script)->type());
+  DCHECK_EQ(Script::Type::kWasm, Utils::OpenHandle(*wasm_script)->type());
   v8::Isolate* isolate = wasm_script->GetIsolate();
   scripts_.insert(
       std::make_pair(module_id, WasmModuleDebug(isolate, wasm_script)));
diff --git a/deps/v8/src/debug/wasm/gdb-server/wasm-module-debug.cc b/deps/v8/src/debug/wasm/gdb-server/wasm-module-debug.cc
index 8e0580028a4b6d..841e4dbb25e4ae 100644
--- a/deps/v8/src/debug/wasm/gdb-server/wasm-module-debug.cc
+++ b/deps/v8/src/debug/wasm/gdb-server/wasm-module-debug.cc
@@ -20,7 +20,7 @@ namespace gdb_server {
 
 WasmModuleDebug::WasmModuleDebug(v8::Isolate* isolate,
                                  Local<debug::WasmScript> wasm_script) {
-  DCHECK_EQ(Script::TYPE_WASM, Utils::OpenHandle(*wasm_script)->type());
+  DCHECK_EQ(Script::Type::kWasm, Utils::OpenHandle(*wasm_script)->type());
 
   isolate_ = isolate;
   wasm_script_ = Global<debug::WasmScript>(isolate, wasm_script);
@@ -46,7 +46,7 @@ Handle<WasmInstanceObject> WasmModuleDebug::GetFirstWasmInstance() {
     MaybeObject maybe_instance = weak_instance_list->Get(0);
     if (maybe_instance->IsWeak()) {
       Handle<WasmInstanceObject> instance(
-          WasmInstanceObject::cast(maybe_instance->GetHeapObjectAssumeWeak()),
+          WasmInstanceObject::cast(maybe_instance.GetHeapObjectAssumeWeak()),
           GetIsolate());
       return instance;
     }
diff --git a/deps/v8/src/deoptimizer/DEPS b/deps/v8/src/deoptimizer/DEPS
index 4842a2656288ed..0e45cf04ecb9b1 100644
--- a/deps/v8/src/deoptimizer/DEPS
+++ b/deps/v8/src/deoptimizer/DEPS
@@ -1,5 +1,5 @@
 specific_include_rules = {
-  "translation-array.cc": [
+  "frame-translation-builder.cc": [
     "+third_party/zlib",
   ],
 }
diff --git a/deps/v8/src/deoptimizer/deoptimize-reason.h b/deps/v8/src/deoptimizer/deoptimize-reason.h
index 5e686659e028f3..9b433771fba7a4 100644
--- a/deps/v8/src/deoptimizer/deoptimize-reason.h
+++ b/deps/v8/src/deoptimizer/deoptimize-reason.h
@@ -16,6 +16,7 @@ namespace internal {
   V(CowArrayElementsChanged, "copy-on-write array's elements changed")         \
   V(CouldNotGrowElements, "failed to grow elements store")                     \
   V(PrepareForOnStackReplacement, "prepare for on stack replacement (OSR)")    \
+  V(OSREarlyExit, "exit from OSR'd inner loop")                                \
   V(DeoptimizeNow, "%_DeoptimizeNow")                                          \
   V(DivisionByZero, "division by zero")                                        \
   V(Hole, "hole")                                                              \
@@ -30,10 +31,18 @@ namespace internal {
     "Insufficient type feedback for compare operation")                        \
   V(InsufficientTypeFeedbackForGenericNamedAccess,                             \
     "Insufficient type feedback for generic named access")                     \
+  V(InsufficientTypeFeedbackForGenericGlobalAccess,                            \
+    "Insufficient type feedback for generic global access")                    \
   V(InsufficientTypeFeedbackForGenericKeyedAccess,                             \
     "Insufficient type feedback for generic keyed access")                     \
   V(InsufficientTypeFeedbackForUnaryOperation,                                 \
     "Insufficient type feedback for unary operation")                          \
+  V(InsufficientTypeFeedbackForArrayLiteral,                                   \
+    "Insufficient type feedback for array literal")                            \
+  V(InsufficientTypeFeedbackForObjectLiteral,                                  \
+    "Insufficient type feedback for object literal")                           \
+  V(InsufficientTypeFeedbackForInstanceOf,                                     \
+    "Insufficient type feedback for instanceof")                               \
   V(LostPrecision, "lost precision")                                           \
   V(LostPrecisionOrNaN, "lost precision or NaN")                               \
   V(MinusZero, "minus zero")                                                   \
@@ -59,8 +68,6 @@ namespace internal {
   V(Smi, "Smi")                                                                \
   V(StoreToConstant, "Storing to a constant field")                            \
   V(SuspendGeneratorIsDead, "SuspendGenerator is in a dead branch")            \
-  V(TransitionedToMonomorphicIC, "IC transitioned to monomorphic")             \
-  V(TransitionedToMegamorphicIC, "IC transitioned to megamorphic")             \
   V(Unknown, "(unknown)")                                                      \
   V(ValueMismatch, "value mismatch")                                           \
   V(WrongCallTarget, "wrong call target")                                      \
@@ -68,9 +75,7 @@ namespace internal {
   V(WrongFeedbackCell, "wrong feedback cell")                                  \
   V(WrongInstanceType, "wrong instance type")                                  \
   V(WrongMap, "wrong map")                                                     \
-  V(MissingMap, "missing map")                                                 \
   V(DeprecatedMap, "deprecated map")                                           \
-  V(WrongHandler, "wrong handler")                                             \
   V(WrongName, "wrong name")                                                   \
   V(WrongValue, "wrong value")                                                 \
   V(NoInitialElement, "no initial element")                                    \
@@ -102,7 +107,8 @@ constexpr bool IsDeoptimizationWithoutCodeInvalidation(
   // unoptimized frame layout. Since no actual assumptions in the Maglev code
   // object are violated, it (and any associated cached optimized code) should
   // not be invalidated s.t. we may reenter it in the future.
-  return reason == DeoptimizeReason::kPrepareForOnStackReplacement;
+  return reason == DeoptimizeReason::kPrepareForOnStackReplacement ||
+         reason == DeoptimizeReason::kOSREarlyExit;
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/deoptimizer/deoptimized-frame-info.cc b/deps/v8/src/deoptimizer/deoptimized-frame-info.cc
index c268d7258fa1b6..6e71d4ddf6b5ff 100644
--- a/deps/v8/src/deoptimizer/deoptimized-frame-info.cc
+++ b/deps/v8/src/deoptimizer/deoptimized-frame-info.cc
@@ -37,7 +37,7 @@ DeoptimizedFrameInfo::DeoptimizedFrameInfo(TranslatedState* state,
   DCHECK_EQ(parameter_count,
             Handle<JSFunction>::cast(stack_it->GetValue())
                 ->shared()
-                .internal_formal_parameter_count_without_receiver());
+                ->internal_formal_parameter_count_without_receiver());
 
   stack_it++;  // Skip the function.
   stack_it++;  // Skip the receiver.
diff --git a/deps/v8/src/deoptimizer/deoptimizer-cfi-builtins.cc b/deps/v8/src/deoptimizer/deoptimizer-cfi-builtins.cc
index 58b1c35d5c29a5..16be7da1ff9a08 100644
--- a/deps/v8/src/deoptimizer/deoptimizer-cfi-builtins.cc
+++ b/deps/v8/src/deoptimizer/deoptimizer-cfi-builtins.cc
@@ -43,7 +43,7 @@ constexpr function_ptr builtins[] = {
 };
 
 bool Deoptimizer::IsValidReturnAddress(Address address, Isolate* isolate) {
-  EmbeddedData d = EmbeddedData::GetEmbeddedDataForPC(isolate, address);
+  EmbeddedData d = EmbeddedData::FromBlobForPc(isolate, address);
   Address code_start = reinterpret_cast<Address>(d.code());
   Address offset = address - code_start;
   if (offset >= v8_Default_embedded_blob_code_size_) return false;
diff --git a/deps/v8/src/deoptimizer/deoptimizer.cc b/deps/v8/src/deoptimizer/deoptimizer.cc
index ee5ee898a09208..7026d81fe751db 100644
--- a/deps/v8/src/deoptimizer/deoptimizer.cc
+++ b/deps/v8/src/deoptimizer/deoptimizer.cc
@@ -11,6 +11,7 @@
 #include "src/debug/debug.h"
 #include "src/deoptimizer/deoptimized-frame-info.h"
 #include "src/deoptimizer/materialized-object-store.h"
+#include "src/deoptimizer/translated-state.h"
 #include "src/execution/frames-inl.h"
 #include "src/execution/isolate.h"
 #include "src/execution/pointer-authentication.h"
@@ -23,6 +24,7 @@
 #include "src/objects/js-function-inl.h"
 #include "src/objects/oddball.h"
 #include "src/snapshot/embedded/embedded-data.h"
+#include "src/utils/utils.h"
 
 #if V8_ENABLE_WEBASSEMBLY
 #include "src/wasm/wasm-linkage.h"
@@ -34,6 +36,72 @@ using base::Memory;
 
 namespace internal {
 
+namespace {
+
+class DeoptimizableCodeIterator {
+ public:
+  explicit DeoptimizableCodeIterator(Isolate* isolate);
+  DeoptimizableCodeIterator(const DeoptimizableCodeIterator&) = delete;
+  DeoptimizableCodeIterator& operator=(const DeoptimizableCodeIterator&) =
+      delete;
+  Tagged<Code> Next();
+
+ private:
+  Isolate* const isolate_;
+  std::unique_ptr<SafepointScope> safepoint_scope_;
+  std::unique_ptr<ObjectIterator> object_iterator_;
+  enum { kIteratingCodeSpace, kIteratingCodeLOSpace, kDone } state_;
+
+  DISALLOW_GARBAGE_COLLECTION(no_gc)
+};
+
+DeoptimizableCodeIterator::DeoptimizableCodeIterator(Isolate* isolate)
+    : isolate_(isolate),
+      safepoint_scope_(std::make_unique<SafepointScope>(
+          isolate, isolate->is_shared_space_isolate()
+                       ? SafepointKind::kGlobal
+                       : SafepointKind::kIsolate)),
+      object_iterator_(
+          isolate->heap()->code_space()->GetObjectIterator(isolate->heap())),
+      state_(kIteratingCodeSpace) {}
+
+Tagged<Code> DeoptimizableCodeIterator::Next() {
+  while (true) {
+    Tagged<HeapObject> object = object_iterator_->Next();
+    if (object.is_null()) {
+      // No objects left in the current iterator, try to move to the next space
+      // based on the state.
+      switch (state_) {
+        case kIteratingCodeSpace: {
+          object_iterator_ =
+              isolate_->heap()->code_lo_space()->GetObjectIterator(
+                  isolate_->heap());
+          state_ = kIteratingCodeLOSpace;
+          continue;
+        }
+        case kIteratingCodeLOSpace:
+          // No other spaces to iterate, so clean up and we're done. Keep the
+          // object iterator so that it keeps returning null on Next(), to avoid
+          // needing to branch on state_ before the while loop, but drop the
+          // safepoint scope since we no longer need to stop the heap from
+          // moving.
+          safepoint_scope_.reset();
+          state_ = kDone;
+          V8_FALLTHROUGH;
+        case kDone:
+          return Code();
+      }
+    }
+    Tagged<InstructionStream> istream = InstructionStream::cast(object);
+    Tagged<Code> code;
+    if (!istream->TryGetCode(&code, kAcquireLoad)) continue;
+    if (!CodeKindCanDeoptimize(code->kind())) continue;
+    return code;
+  }
+}
+
+}  // namespace
+
 // {FrameWriter} offers a stack writer abstraction for writing
 // FrameDescriptions. The main service the class provides is managing
 // {top_offset_}, i.e. the offset of the next slot to write to.
@@ -57,7 +125,7 @@ class FrameWriter {
     }
   }
 
-  void PushRawObject(Object obj, const char* debug_hint) {
+  void PushRawObject(Tagged<Object> obj, const char* debug_hint) {
     intptr_t value = obj.ptr();
     PushValue(value);
     if (trace_scope_ != nullptr) {
@@ -94,7 +162,7 @@ class FrameWriter {
 
   void PushTranslatedValue(const TranslatedFrame::iterator& iterator,
                            const char* debug_hint = "") {
-    Object obj = iterator->GetRawValue();
+    Tagged<Object> obj = iterator->GetRawValue();
     PushRawObject(obj, debug_hint);
     if (trace_scope_ != nullptr) {
       PrintF(trace_scope_->file(), " (input #%d)\n", iterator.input_index());
@@ -154,16 +222,16 @@ class FrameWriter {
 #endif
   }
 
-  void DebugPrintOutputObject(Object obj, unsigned output_offset,
+  void DebugPrintOutputObject(Tagged<Object> obj, unsigned output_offset,
                               const char* debug_hint = "") {
     if (trace_scope_ != nullptr) {
       PrintF(trace_scope_->file(), "    " V8PRIxPTR_FMT ": [top + %3d] <- ",
              output_address(output_offset), output_offset);
-      if (obj.IsSmi()) {
+      if (IsSmi(obj)) {
         PrintF(trace_scope_->file(), V8PRIxPTR_FMT " <Smi %d>", obj.ptr(),
                Smi::cast(obj).value());
       } else {
-        obj.ShortPrint(trace_scope_->file());
+        ShortPrint(obj, trace_scope_->file());
       }
       PrintF(trace_scope_->file(), " ;  %s", debug_hint);
     }
@@ -180,7 +248,7 @@ class FrameWriter {
 Deoptimizer* Deoptimizer::New(Address raw_function, DeoptimizeKind kind,
                               Address from, int fp_to_sp_delta,
                               Isolate* isolate) {
-  JSFunction function = JSFunction::cast(Object(raw_function));
+  Tagged<JSFunction> function = JSFunction::cast(Object(raw_function));
   Deoptimizer* deoptimizer =
       new Deoptimizer(isolate, function, kind, from, fp_to_sp_delta);
   isolate->set_current_deoptimizer(deoptimizer);
@@ -229,7 +297,7 @@ DeoptimizedFrameInfo* Deoptimizer::DebuggerInspectableFrame(
 namespace {
 class ActivationsFinder : public ThreadVisitor {
  public:
-  ActivationsFinder(GcSafeCode topmost_optimized_code,
+  ActivationsFinder(Tagged<GcSafeCode> topmost_optimized_code,
                     bool safe_to_deopt_topmost_optimized_code) {
 #ifdef DEBUG
     topmost_ = topmost_optimized_code;
@@ -243,12 +311,12 @@ class ActivationsFinder : public ThreadVisitor {
   void VisitThread(Isolate* isolate, ThreadLocalTop* top) override {
     for (StackFrameIterator it(isolate, top); !it.done(); it.Advance()) {
       if (it.frame()->is_optimized()) {
-        GcSafeCode code = it.frame()->GcSafeLookupCode();
-        if (CodeKindCanDeoptimize(code.kind()) &&
-            code.marked_for_deoptimization()) {
+        Tagged<GcSafeCode> code = it.frame()->GcSafeLookupCode();
+        if (CodeKindCanDeoptimize(code->kind()) &&
+            code->marked_for_deoptimization()) {
           // Obtain the trampoline to the deoptimizer call.
           int trampoline_pc;
-          if (code.is_maglevved()) {
+          if (code->is_maglevved()) {
             MaglevSafepointEntry safepoint = MaglevSafepointTable::FindEntry(
                 isolate, code, it.frame()->pc());
             trampoline_pc = safepoint.trampoline_pc();
@@ -263,7 +331,7 @@ class ActivationsFinder : public ThreadVisitor {
           // Replace the current pc on the stack with the trampoline.
           // TODO(v8:10026): avoid replacing a signed pointer.
           Address* pc_addr = it.frame()->pc_address();
-          Address new_pc = code.InstructionStart() + trampoline_pc;
+          Address new_pc = code->instruction_start() + trampoline_pc;
           PointerAuthentication::ReplacePC(pc_addr, new_pc, kSystemPointerSize);
         }
       }
@@ -283,7 +351,7 @@ class ActivationsFinder : public ThreadVisitor {
 void Deoptimizer::DeoptimizeMarkedCode(Isolate* isolate) {
   DisallowGarbageCollection no_gc;
 
-  GcSafeCode topmost_optimized_code;
+  Tagged<GcSafeCode> topmost_optimized_code;
   bool safe_to_deopt_topmost_optimized_code = false;
 #ifdef DEBUG
   // Make sure all activations of optimized code can deopt at their current PC.
@@ -292,12 +360,12 @@ void Deoptimizer::DeoptimizeMarkedCode(Isolate* isolate) {
   for (StackFrameIterator it(isolate, isolate->thread_local_top()); !it.done();
        it.Advance()) {
     if (it.frame()->is_optimized()) {
-      GcSafeCode code = it.frame()->GcSafeLookupCode();
-      JSFunction function =
+      Tagged<GcSafeCode> code = it.frame()->GcSafeLookupCode();
+      Tagged<JSFunction> function =
           static_cast<OptimizedFrame*>(it.frame())->function();
       TraceFoundActivation(isolate, function);
       bool safe_if_deopt_triggered;
-      if (code.is_maglevved()) {
+      if (code->is_maglevved()) {
         MaglevSafepointEntry safepoint =
             MaglevSafepointTable::FindEntry(isolate, code, it.frame()->pc());
         safe_if_deopt_triggered = safepoint.has_deoptimization_index();
@@ -308,7 +376,7 @@ void Deoptimizer::DeoptimizeMarkedCode(Isolate* isolate) {
       }
 
       // Deopt is checked when we are patching addresses on stack.
-      bool is_builtin_code = code.kind() == CodeKind::BUILTIN;
+      bool is_builtin_code = code->kind() == CodeKind::BUILTIN;
       DCHECK(topmost_optimized_code.is_null() || safe_if_deopt_triggered ||
              is_builtin_code);
       if (topmost_optimized_code.is_null()) {
@@ -338,9 +406,9 @@ void Deoptimizer::DeoptimizeAll(Isolate* isolate) {
 
   // Mark all code, then deoptimize.
   {
-    Code::OptimizedCodeIterator it(isolate);
-    for (Code code = it.Next(); !code.is_null(); code = it.Next()) {
-      code.set_marked_for_deoptimization(true);
+    DeoptimizableCodeIterator it(isolate);
+    for (Tagged<Code> code = it.Next(); !code.is_null(); code = it.Next()) {
+      code->set_marked_for_deoptimization(true);
     }
   }
 
@@ -348,23 +416,24 @@ void Deoptimizer::DeoptimizeAll(Isolate* isolate) {
 }
 
 // static
-void Deoptimizer::DeoptimizeFunction(JSFunction function, Code code) {
-  Isolate* isolate = function.GetIsolate();
+void Deoptimizer::DeoptimizeFunction(Tagged<JSFunction> function,
+                                     Tagged<Code> code) {
+  Isolate* isolate = function->GetIsolate();
   RCS_SCOPE(isolate, RuntimeCallCounterId::kDeoptimizeCode);
   TimerEventScope<TimerEventDeoptimizeCode> timer(isolate);
   TRACE_EVENT0("v8", "V8.DeoptimizeCode");
-  function.ResetIfCodeFlushed();
-  if (code.is_null()) code = function.code();
+  function->ResetIfCodeFlushed();
+  if (code.is_null()) code = function->code();
 
-  if (CodeKindCanDeoptimize(code.kind())) {
+  if (CodeKindCanDeoptimize(code->kind())) {
     // Mark the code for deoptimization and unlink any functions that also
     // refer to that code. The code cannot be shared across native contexts,
     // so we only need to search one.
-    code.set_marked_for_deoptimization(true);
+    code->set_marked_for_deoptimization(true);
     // The code in the function's optimized code feedback vector slot might
     // be different from the code on the function - evict it if necessary.
-    function.feedback_vector().EvictOptimizedCodeMarkedForDeoptimization(
-        isolate, function.shared(), "unlinking code marked for deopt");
+    function->feedback_vector()->EvictOptimizedCodeMarkedForDeoptimization(
+        isolate, function->shared(), "unlinking code marked for deopt");
 
     DeoptimizeMarkedCode(isolate);
   }
@@ -383,10 +452,10 @@ void Deoptimizer::DeoptimizeAllOptimizedCodeWithFunction(
   // Mark all code that inlines this function, then deoptimize.
   bool any_marked = false;
   {
-    Code::OptimizedCodeIterator it(isolate);
-    for (Code code = it.Next(); !code.is_null(); code = it.Next()) {
-      if (code.Inlines(*function)) {
-        code.set_marked_for_deoptimization(true);
+    DeoptimizableCodeIterator it(isolate);
+    for (Tagged<Code> code = it.Next(); !code.is_null(); code = it.Next()) {
+      if (code->Inlines(*function)) {
+        code->set_marked_for_deoptimization(true);
         any_marked = true;
       }
     }
@@ -409,7 +478,7 @@ const char* Deoptimizer::MessageFor(DeoptimizeKind kind) {
   }
 }
 
-Deoptimizer::Deoptimizer(Isolate* isolate, JSFunction function,
+Deoptimizer::Deoptimizer(Isolate* isolate, Tagged<JSFunction> function,
                          DeoptimizeKind kind, Address from, int fp_to_sp_delta)
     : isolate_(isolate),
       function_(function),
@@ -449,14 +518,14 @@ Deoptimizer::Deoptimizer(Isolate* isolate, JSFunction function,
   DCHECK_NE(from, kNullAddress);
   compiled_code_ = isolate_->heap()->FindCodeForInnerPointer(from);
   DCHECK(!compiled_code_.is_null());
-  DCHECK(compiled_code_.IsCode());
+  DCHECK(IsCode(compiled_code_));
 
-  DCHECK(function.IsJSFunction());
+  DCHECK(IsJSFunction(function));
 #ifdef DEBUG
   DCHECK(AllowGarbageCollection::IsAllowed());
   disallow_garbage_collection_ = new DisallowGarbageCollection();
 #endif  // DEBUG
-  CHECK(CodeKindCanDeoptimize(compiled_code_.kind()));
+  CHECK(CodeKindCanDeoptimize(compiled_code_->kind()));
   {
     HandleScope scope(isolate_);
     PROFILE(isolate_, CodeDeoptEvent(handle(compiled_code_, isolate_), kind,
@@ -464,18 +533,18 @@ Deoptimizer::Deoptimizer(Isolate* isolate, JSFunction function,
   }
   unsigned size = ComputeInputFrameSize();
   const int parameter_count =
-      function.shared().internal_formal_parameter_count_with_receiver();
+      function->shared()->internal_formal_parameter_count_with_receiver();
   input_ = new (size) FrameDescription(size, parameter_count, isolate_);
 
   DCHECK_EQ(deopt_exit_index_, kFixedExitSizeMarker);
   // Calculate the deopt exit index from return address.
   DCHECK_GT(kEagerDeoptExitSize, 0);
   DCHECK_GT(kLazyDeoptExitSize, 0);
-  DeoptimizationData deopt_data =
-      DeoptimizationData::cast(compiled_code_.deoptimization_data());
-  Address deopt_start =
-      compiled_code_.InstructionStart() + deopt_data.DeoptExitStart().value();
-  int eager_deopt_count = deopt_data.EagerDeoptCount().value();
+  Tagged<DeoptimizationData> deopt_data =
+      DeoptimizationData::cast(compiled_code_->deoptimization_data());
+  Address deopt_start = compiled_code_->instruction_start() +
+                        deopt_data->DeoptExitStart().value();
+  int eager_deopt_count = deopt_data->EagerDeoptCount().value();
   Address lazy_deopt_start =
       deopt_start + eager_deopt_count * kEagerDeoptExitSize;
   // The deoptimization exits are sorted so that lazy deopt exits appear after
@@ -546,7 +615,7 @@ int LookupCatchHandler(Isolate* isolate, TranslatedFrame* translated_frame,
     case TranslatedFrame::kUnoptimizedFunction: {
       int bytecode_offset = translated_frame->bytecode_offset().ToInt();
       HandlerTable table(
-          translated_frame->raw_shared_info().GetBytecodeArray(isolate));
+          translated_frame->raw_shared_info()->GetBytecodeArray(isolate));
       return table.LookupRange(bytecode_offset, data_out, nullptr);
     }
     case TranslatedFrame::kJavaScriptBuiltinContinuationWithCatch: {
@@ -567,11 +636,11 @@ void Deoptimizer::TraceDeoptBegin(int optimization_id,
   Deoptimizer::DeoptInfo info = Deoptimizer::GetDeoptInfo();
   PrintF(file, "[bailout (kind: %s, reason: %s): begin. deoptimizing ",
          MessageFor(deopt_kind_), DeoptimizeReasonToString(info.deopt_reason));
-  if (function_.IsJSFunction()) {
-    function_.ShortPrint(file);
+  if (IsJSFunction(function_)) {
+    ShortPrint(function_, file);
     PrintF(file, ", ");
   }
-  compiled_code_.ShortPrint(file);
+  ShortPrint(compiled_code_, file);
   PrintF(file,
          ", opt id %d, "
 #ifdef DEBUG
@@ -601,23 +670,24 @@ void Deoptimizer::TraceDeoptEnd(double deopt_duration) {
 }
 
 // static
-void Deoptimizer::TraceMarkForDeoptimization(Isolate* isolate, Code code,
+void Deoptimizer::TraceMarkForDeoptimization(Isolate* isolate,
+                                             Tagged<Code> code,
                                              const char* reason) {
   if (!v8_flags.trace_deopt && !v8_flags.log_deopt) return;
 
   DisallowGarbageCollection no_gc;
-  Object maybe_data = code.deoptimization_data();
+  Tagged<Object> maybe_data = code->deoptimization_data();
   if (maybe_data == ReadOnlyRoots(isolate).empty_fixed_array()) return;
 
-  DeoptimizationData deopt_data = DeoptimizationData::cast(maybe_data);
+  Tagged<DeoptimizationData> deopt_data = DeoptimizationData::cast(maybe_data);
   CodeTracer::Scope scope(isolate->GetCodeTracer());
   if (v8_flags.trace_deopt) {
     PrintF(scope.file(), "[marking dependent code ");
-    code.ShortPrint(scope.file());
+    ShortPrint(code, scope.file());
     PrintF(scope.file(), " (");
-    deopt_data.SharedFunctionInfo().ShortPrint(scope.file());
+    ShortPrint(deopt_data->SharedFunctionInfo(), scope.file());
     PrintF(") (opt id %d) for deoptimization, reason: %s]\n",
-           deopt_data.OptimizationId().value(), reason);
+           deopt_data->OptimizationId().value(), reason);
   }
   if (!v8_flags.log_deopt) return;
   no_gc.Release();
@@ -627,16 +697,15 @@ void Deoptimizer::TraceMarkForDeoptimization(Isolate* isolate, Code code,
         isolate,
         CodeDependencyChangeEvent(
             handle(code, isolate),
-            handle(SharedFunctionInfo::cast(deopt_data.SharedFunctionInfo()),
+            handle(SharedFunctionInfo::cast(deopt_data->SharedFunctionInfo()),
                    isolate),
             reason));
   }
 }
 
 // static
-void Deoptimizer::TraceEvictFromOptimizedCodeCache(Isolate* isolate,
-                                                   SharedFunctionInfo sfi,
-                                                   const char* reason) {
+void Deoptimizer::TraceEvictFromOptimizedCodeCache(
+    Isolate* isolate, Tagged<SharedFunctionInfo> sfi, const char* reason) {
   if (!v8_flags.trace_deopt_verbose) return;
 
   DisallowGarbageCollection no_gc;
@@ -644,17 +713,18 @@ void Deoptimizer::TraceEvictFromOptimizedCodeCache(Isolate* isolate,
   PrintF(scope.file(),
          "[evicting optimized code marked for deoptimization (%s) for ",
          reason);
-  sfi.ShortPrint(scope.file());
+  ShortPrint(sfi, scope.file());
   PrintF(scope.file(), "]\n");
 }
 
 #ifdef DEBUG
 // static
-void Deoptimizer::TraceFoundActivation(Isolate* isolate, JSFunction function) {
+void Deoptimizer::TraceFoundActivation(Isolate* isolate,
+                                       Tagged<JSFunction> function) {
   if (!v8_flags.trace_deopt_verbose) return;
   CodeTracer::Scope scope(isolate->GetCodeTracer());
   PrintF(scope.file(), "[deoptimizer found activation of function: ");
-  function.PrintName(scope.file());
+  function->PrintName(scope.file());
   PrintF(scope.file(), " / %" V8PRIxPTR "]\n", function.ptr());
 }
 #endif  // DEBUG
@@ -679,8 +749,8 @@ void Deoptimizer::DoComputeOutputFrames() {
 
   // Determine basic deoptimization information.  The optimized frame is
   // described by the input data.
-  DeoptimizationData input_data =
-      DeoptimizationData::cast(compiled_code_.deoptimization_data());
+  Tagged<DeoptimizationData> input_data =
+      DeoptimizationData::cast(compiled_code_->deoptimization_data());
 
   {
     // Read caller's PC, caller's FP and caller's constant pool values
@@ -709,25 +779,26 @@ void Deoptimizer::DoComputeOutputFrames() {
            stack_guard->real_jslimit());
 
   BytecodeOffset bytecode_offset =
-      input_data.GetBytecodeOffset(deopt_exit_index_);
-  ByteArray translations = input_data.TranslationByteArray();
+      input_data->GetBytecodeOffsetOrBuiltinContinuationId(deopt_exit_index_);
+  auto translations = input_data->FrameTranslation();
   unsigned translation_index =
-      input_data.TranslationIndex(deopt_exit_index_).value();
+      input_data->TranslationIndex(deopt_exit_index_).value();
 
   if (tracing_enabled()) {
     timer.Start();
-    TraceDeoptBegin(input_data.OptimizationId().value(), bytecode_offset);
+    TraceDeoptBegin(input_data->OptimizationId().value(), bytecode_offset);
   }
 
   FILE* trace_file =
       verbose_tracing_enabled() ? trace_scope()->file() : nullptr;
-  TranslationArrayIterator state_iterator(translations, translation_index);
+  DeoptimizationFrameTranslation::Iterator state_iterator(translations,
+                                                          translation_index);
   translated_state_.Init(
       isolate_, input_->GetFramePointerAddress(), stack_fp_, &state_iterator,
-      input_data.LiteralArray(), input_->GetRegisterValues(), trace_file,
-      function_.IsHeapObject()
-          ? function_.shared()
-                .internal_formal_parameter_count_without_receiver()
+      input_data->LiteralArray(), input_->GetRegisterValues(), trace_file,
+      IsHeapObject(function_)
+          ? function_->shared()
+                ->internal_formal_parameter_count_without_receiver()
           : 0,
       actual_argument_count_ - kJSArgcReceiverSlots);
 
@@ -777,8 +848,11 @@ void Deoptimizer::DoComputeOutputFrames() {
       case TranslatedFrame::kInlinedExtraArguments:
         DoComputeInlinedExtraArguments(translated_frame, frame_index);
         break;
-      case TranslatedFrame::kConstructStub:
-        DoComputeConstructStubFrame(translated_frame, frame_index);
+      case TranslatedFrame::kConstructCreateStub:
+        DoComputeConstructCreateStubFrame(translated_frame, frame_index);
+        break;
+      case TranslatedFrame::kConstructInvokeStub:
+        DoComputeConstructInvokeStubFrame(translated_frame, frame_index);
         break;
       case TranslatedFrame::kBuiltinContinuation:
 #if V8_ENABLE_WEBASSEMBLY
@@ -798,6 +872,10 @@ void Deoptimizer::DoComputeOutputFrames() {
                 ? BuiltinContinuationMode::JAVASCRIPT_HANDLE_EXCEPTION
                 : BuiltinContinuationMode::JAVASCRIPT_WITH_CATCH);
         break;
+#if V8_ENABLE_WEBASSEMBLY
+      case TranslatedFrame::kWasmInlinedIntoJS:
+        FATAL("inlined wasm frames may not appear in deopts for built-ins");
+#endif
       case TranslatedFrame::kInvalid:
         FATAL("invalid frame");
     }
@@ -812,6 +890,22 @@ void Deoptimizer::DoComputeOutputFrames() {
                                             isolate()->cage_base());
 #endif
 
+  // Don't reset the tiering state for OSR code since we might reuse OSR code
+  // after deopt, and we still want to tier up to non-OSR code even if OSR code
+  // deoptimized.
+  bool osr_early_exit = Deoptimizer::GetDeoptInfo().deopt_reason ==
+                        DeoptimizeReason::kOSREarlyExit;
+  if (IsJSFunction(function_) &&
+      (compiled_code_->osr_offset().IsNone()
+           ? function_->code() == compiled_code_
+           : (!osr_early_exit &&
+              DeoptExitIsInsideOsrLoop(isolate(), function_,
+                                       bytecode_offset_in_outermost_frame_,
+                                       compiled_code_->osr_offset())))) {
+    function_->reset_tiering_state();
+    function_->SetInterruptBudget(isolate_, CodeKind::INTERPRETED_FUNCTION);
+  }
+
   // Print some helpful diagnostic information.
   if (verbose_tracing_enabled()) {
     TraceDeoptEnd(timer.Elapsed().InMillisecondsF());
@@ -830,6 +924,45 @@ void Deoptimizer::DoComputeOutputFrames() {
       stack_guard->real_jslimit() - kStackLimitSlackForDeoptimizationInBytes);
 }
 
+// static
+bool Deoptimizer::DeoptExitIsInsideOsrLoop(Isolate* isolate,
+                                           Tagged<JSFunction> function,
+                                           BytecodeOffset deopt_exit_offset,
+                                           BytecodeOffset osr_offset) {
+  DisallowGarbageCollection no_gc;
+  HandleScope scope(isolate);
+  DCHECK(!deopt_exit_offset.IsNone());
+  DCHECK(!osr_offset.IsNone());
+
+  Handle<BytecodeArray> bytecode_array(
+      function->shared()->GetBytecodeArray(isolate), isolate);
+  DCHECK(interpreter::BytecodeArrayIterator::IsValidOffset(
+      bytecode_array, deopt_exit_offset.ToInt()));
+
+  interpreter::BytecodeArrayIterator it(bytecode_array, osr_offset.ToInt());
+  DCHECK_EQ(it.current_bytecode(), interpreter::Bytecode::kJumpLoop);
+
+  for (; !it.done(); it.Advance()) {
+    const int current_offset = it.current_offset();
+    // If we've reached the deopt exit, it's contained in the current loop
+    // (this is covered by IsInRange below, but this check lets us avoid
+    // useless iteration).
+    if (current_offset == deopt_exit_offset.ToInt()) return true;
+    // We're only interested in loop ranges.
+    if (it.current_bytecode() != interpreter::Bytecode::kJumpLoop) continue;
+    // Is the deopt exit contained in the current loop?
+    if (base::IsInRange(deopt_exit_offset.ToInt(), it.GetJumpTargetOffset(),
+                        current_offset)) {
+      return true;
+    }
+    // We've reached nesting level 0, i.e. the current JumpLoop concludes a
+    // top-level loop.
+    const int loop_nesting_level = it.GetImmediateOperand(1);
+    if (loop_nesting_level == 0) return false;
+  }
+
+  UNREACHABLE();
+}
 namespace {
 
 // Get the dispatch builtin for unoptimized frames.
@@ -851,7 +984,7 @@ Builtin DispatchBuiltinFor(bool deopt_to_baseline, bool advance_bc,
 void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
                                             int frame_index,
                                             bool goto_catch_handler) {
-  SharedFunctionInfo shared = translated_frame->raw_shared_info();
+  Tagged<SharedFunctionInfo> shared = translated_frame->raw_shared_info();
   TranslatedFrame::iterator value_iterator = translated_frame->begin();
   const bool is_bottommost = (0 == frame_index);
   const bool is_topmost = (output_count_ - 1 == frame_index);
@@ -861,7 +994,7 @@ void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
       goto_catch_handler ? catch_handler_pc_offset_ : real_bytecode_offset;
 
   const int parameters_count =
-      shared.internal_formal_parameter_count_with_receiver();
+      shared->internal_formal_parameter_count_with_receiver();
 
   // If this is the bottom most frame or the previous frame was the inlined
   // extra arguments frame, then we already have extra arguments in the stack
@@ -878,9 +1011,13 @@ void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
 
   TranslatedFrame::iterator function_iterator = value_iterator++;
 
-  BytecodeArray bytecode_array =
-      shared.HasBreakInfo() ? shared.GetDebugInfo().DebugBytecodeArray()
-                            : shared.GetBytecodeArray(isolate());
+  Tagged<BytecodeArray> bytecode_array;
+  base::Optional<DebugInfo> debug_info = shared->TryGetDebugInfo(isolate());
+  if (debug_info.has_value() && debug_info->HasBreakInfo()) {
+    bytecode_array = debug_info->DebugBytecodeArray();
+  } else {
+    bytecode_array = shared->GetBytecodeArray(isolate());
+  }
 
   // Allocate and store the output frame description.
   FrameDescription* output_frame = new (output_frame_size)
@@ -904,15 +1041,15 @@ void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
       (!is_topmost || (deopt_kind_ == DeoptimizeKind::kLazy)) &&
       !goto_catch_handler;
   const bool deopt_to_baseline =
-      shared.HasBaselineCode() && v8_flags.deopt_to_baseline;
+      shared->HasBaselineCode() && v8_flags.deopt_to_baseline;
   const bool restart_frame = goto_catch_handler && is_restart_frame();
-  Code dispatch_builtin = builtins->code(
+  Tagged<Code> dispatch_builtin = builtins->code(
       DispatchBuiltinFor(deopt_to_baseline, advance_bc, restart_frame));
 
   if (verbose_tracing_enabled()) {
     PrintF(trace_scope()->file(), "  translating %s frame ",
            deopt_to_baseline ? "baseline" : "interpreted");
-    std::unique_ptr<char[]> name = shared.DebugNameCStr();
+    std::unique_ptr<char[]> name = shared->DebugNameCStr();
     PrintF(trace_scope()->file(), "%s", name.get());
     PrintF(trace_scope()->file(), " => bytecode_offset=%d, ",
            real_bytecode_offset);
@@ -1005,7 +1142,7 @@ void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
     }
   }
   // Read the context from the translations.
-  Object context = context_pos->GetRawValue();
+  Tagged<Object> context = context_pos->GetRawValue();
   output_frame->SetContext(static_cast<intptr_t>(context.ptr()));
   frame_writer.PushTranslatedValue(context_pos, "context");
 
@@ -1031,7 +1168,7 @@ void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
   // The bytecode offset was mentioned explicitly in the BEGIN_FRAME.
   const int raw_bytecode_offset =
       BytecodeArray::kHeaderSize - kHeapObjectTag + bytecode_offset;
-  Smi smi_bytecode_offset = Smi::FromInt(raw_bytecode_offset);
+  Tagged<Smi> smi_bytecode_offset = Smi::FromInt(raw_bytecode_offset);
   frame_writer.PushRawObject(smi_bytecode_offset, "bytecode offset\n");
 
   if (verbose_tracing_enabled()) {
@@ -1116,7 +1253,7 @@ void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
   CHECK_EQ(0u, frame_writer.top_offset());
 
   const intptr_t pc =
-      static_cast<intptr_t>(dispatch_builtin.InstructionStart());
+      static_cast<intptr_t>(dispatch_builtin->instruction_start());
   if (is_topmost) {
     // Only the pc of the topmost frame needs to be signed since it is
     // authenticated at the end of the DeoptimizationEntry builtin.
@@ -1130,7 +1267,7 @@ void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
   // Update constant pool.
   if (V8_EMBEDDED_CONSTANT_POOL_BOOL) {
     intptr_t constant_pool_value =
-        static_cast<intptr_t>(dispatch_builtin.constant_pool());
+        static_cast<intptr_t>(dispatch_builtin->constant_pool());
     output_frame->SetConstantPool(constant_pool_value);
     if (is_topmost) {
       Register constant_pool_reg =
@@ -1147,9 +1284,9 @@ void Deoptimizer::DoComputeUnoptimizedFrame(TranslatedFrame* translated_frame,
     Register context_reg = JavaScriptFrame::context_register();
     output_frame->SetRegister(context_reg.code(), context_value);
     // Set the continuation for the topmost frame.
-    Code continuation = builtins->code(Builtin::kNotifyDeoptimized);
+    Tagged<Code> continuation = builtins->code(Builtin::kNotifyDeoptimized);
     output_frame->SetContinuation(
-        static_cast<intptr_t>(continuation.InstructionStart()));
+        static_cast<intptr_t>(continuation->instruction_start()));
   }
 }
 
@@ -1169,7 +1306,7 @@ void Deoptimizer::DoComputeInlinedExtraArguments(
   const int argument_count_without_receiver = translated_frame->height() - 1;
   const int formal_parameter_count =
       translated_frame->raw_shared_info()
-          .internal_formal_parameter_count_without_receiver();
+          ->internal_formal_parameter_count_without_receiver();
   const int extra_argument_count =
       argument_count_without_receiver - formal_parameter_count;
   // The number of pushed arguments is the maximum of the actual argument count
@@ -1217,18 +1354,15 @@ void Deoptimizer::DoComputeInlinedExtraArguments(
   }
 }
 
-void Deoptimizer::DoComputeConstructStubFrame(TranslatedFrame* translated_frame,
-                                              int frame_index) {
+void Deoptimizer::DoComputeConstructCreateStubFrame(
+    TranslatedFrame* translated_frame, int frame_index) {
   TranslatedFrame::iterator value_iterator = translated_frame->begin();
   const bool is_topmost = (output_count_ - 1 == frame_index);
   // The construct frame could become topmost only if we inlined a constructor
   // call which does a tail call (otherwise the tail callee's frame would be
   // the topmost one). So it could only be the DeoptimizeKind::kLazy case.
   CHECK(!is_topmost || deopt_kind_ == DeoptimizeKind::kLazy);
-
-  Builtins* builtins = isolate_->builtins();
-  Code construct_stub = builtins->code(Builtin::kJSConstructStubGeneric);
-  BytecodeOffset bytecode_offset = translated_frame->bytecode_offset();
+  DCHECK_EQ(translated_frame->kind(), TranslatedFrame::kConstructCreateStub);
 
   const int parameters_count = translated_frame->height();
   ConstructStubFrameInfo frame_info =
@@ -1238,11 +1372,8 @@ void Deoptimizer::DoComputeConstructStubFrame(TranslatedFrame* translated_frame,
   TranslatedFrame::iterator function_iterator = value_iterator++;
   if (verbose_tracing_enabled()) {
     PrintF(trace_scope()->file(),
-           "  translating construct stub => bytecode_offset=%d (%s), "
-           "variable_frame_size=%d, frame_size=%d\n",
-           bytecode_offset.ToInt(),
-           bytecode_offset == BytecodeOffset::ConstructStubCreate() ? "create"
-                                                                    : "invoke",
+           "  translating construct create stub => variable_frame_size=%d, "
+           "frame_size=%d\n",
            frame_info.frame_size_in_bytes_without_fixed(), output_frame_size);
   }
 
@@ -1250,8 +1381,6 @@ void Deoptimizer::DoComputeConstructStubFrame(TranslatedFrame* translated_frame,
   FrameDescription* output_frame = new (output_frame_size)
       FrameDescription(output_frame_size, parameters_count, isolate());
   FrameWriter frame_writer(this, output_frame, verbose_trace_scope());
-
-  // Construct stub can not be topmost.
   DCHECK(frame_index > 0 && frame_index < output_count_);
   DCHECK_NULL(output_[frame_index]);
   output_[frame_index] = output_frame;
@@ -1316,16 +1445,8 @@ void Deoptimizer::DoComputeConstructStubFrame(TranslatedFrame* translated_frame,
   // The deopt info contains the implicit receiver or the new target at the
   // position of the receiver. Copy it to the top of stack, with the hole value
   // as padding to maintain alignment.
-
   frame_writer.PushRawObject(roots.the_hole_value(), "padding\n");
-
-  CHECK(bytecode_offset == BytecodeOffset::ConstructStubCreate() ||
-        bytecode_offset == BytecodeOffset::ConstructStubInvoke());
-  const char* debug_hint =
-      bytecode_offset == BytecodeOffset::ConstructStubCreate()
-          ? "new target\n"
-          : "allocated receiver\n";
-  frame_writer.PushTranslatedValue(receiver_iterator, debug_hint);
+  frame_writer.PushTranslatedValue(receiver_iterator, "new target\n");
 
   if (is_topmost) {
     for (int i = 0; i < ArgumentPaddingSlots(1); ++i) {
@@ -1341,12 +1462,11 @@ void Deoptimizer::DoComputeConstructStubFrame(TranslatedFrame* translated_frame,
   CHECK_EQ(0u, frame_writer.top_offset());
 
   // Compute this frame's PC.
-  DCHECK(bytecode_offset.IsValidForConstructStub());
-  Address start = construct_stub.InstructionStart();
+  Tagged<Code> construct_stub =
+      isolate_->builtins()->code(Builtin::kJSConstructStubGeneric);
+  Address start = construct_stub->instruction_start();
   const int pc_offset =
-      bytecode_offset == BytecodeOffset::ConstructStubCreate()
-          ? isolate_->heap()->construct_stub_create_deopt_pc_offset().value()
-          : isolate_->heap()->construct_stub_invoke_deopt_pc_offset().value();
+      isolate_->heap()->construct_stub_create_deopt_pc_offset().value();
   intptr_t pc_value = static_cast<intptr_t>(start + pc_offset);
   if (is_topmost) {
     // Only the pc of the topmost frame needs to be signed since it is
@@ -1360,7 +1480,7 @@ void Deoptimizer::DoComputeConstructStubFrame(TranslatedFrame* translated_frame,
   // Update constant pool.
   if (V8_EMBEDDED_CONSTANT_POOL_BOOL) {
     intptr_t constant_pool_value =
-        static_cast<intptr_t>(construct_stub.constant_pool());
+        static_cast<intptr_t>(construct_stub->constant_pool());
     output_frame->SetConstantPool(constant_pool_value);
     if (is_topmost) {
       Register constant_pool_reg =
@@ -1376,14 +1496,143 @@ void Deoptimizer::DoComputeConstructStubFrame(TranslatedFrame* translated_frame,
     intptr_t context_value = static_cast<intptr_t>(Smi::zero().ptr());
     Register context_reg = JavaScriptFrame::context_register();
     output_frame->SetRegister(context_reg.code(), context_value);
+
+    // Set the continuation for the topmost frame.
+    DCHECK_EQ(DeoptimizeKind::kLazy, deopt_kind_);
+    Tagged<Code> continuation =
+        isolate_->builtins()->code(Builtin::kNotifyDeoptimized);
+    output_frame->SetContinuation(
+        static_cast<intptr_t>(continuation->instruction_start()));
+  }
+}
+
+void Deoptimizer::DoComputeConstructInvokeStubFrame(
+    TranslatedFrame* translated_frame, int frame_index) {
+  TranslatedFrame::iterator value_iterator = translated_frame->begin();
+  const bool is_topmost = (output_count_ - 1 == frame_index);
+  // The construct frame could become topmost only if we inlined a constructor
+  // call which does a tail call (otherwise the tail callee's frame would be
+  // the topmost one). So it could only be the DeoptimizeKind::kLazy case.
+  CHECK(!is_topmost || deopt_kind_ == DeoptimizeKind::kLazy);
+  DCHECK_EQ(translated_frame->kind(), TranslatedFrame::kConstructInvokeStub);
+  DCHECK_EQ(translated_frame->height(), 0);
+
+  FastConstructStubFrameInfo frame_info =
+      FastConstructStubFrameInfo::Precise(is_topmost);
+  const uint32_t output_frame_size = frame_info.frame_size_in_bytes();
+  if (verbose_tracing_enabled()) {
+    PrintF(trace_scope()->file(),
+           "  translating construct invoke stub => variable_frame_size=%d, "
+           "frame_size=%d\n",
+           frame_info.frame_size_in_bytes_without_fixed(), output_frame_size);
   }
 
-  // Set the continuation for the topmost frame.
+  // Allocate and store the output frame description.
+  FrameDescription* output_frame =
+      new (output_frame_size) FrameDescription(output_frame_size, 0, isolate());
+  FrameWriter frame_writer(this, output_frame, verbose_trace_scope());
+  DCHECK(frame_index > 0 && frame_index < output_count_);
+  DCHECK_NULL(output_[frame_index]);
+  output_[frame_index] = output_frame;
+
+  // The top address of the frame is computed from the previous frame's top and
+  // this frame's size.
+  const intptr_t top_address =
+      output_[frame_index - 1]->GetTop() - output_frame_size;
+  output_frame->SetTop(top_address);
+
+  // The allocated receiver of a construct stub frame is passed as the
+  // receiver parameter through the translation. It might be encoding
+  // a captured object, so we need save it for later.
+  TranslatedFrame::iterator receiver_iterator = value_iterator;
+  value_iterator++;
+
+  // Read caller's PC from the previous frame.
+  const intptr_t caller_pc = output_[frame_index - 1]->GetPc();
+  frame_writer.PushApprovedCallerPc(caller_pc);
+
+  // Read caller's FP from the previous frame, and set this frame's FP.
+  const intptr_t caller_fp = output_[frame_index - 1]->GetFp();
+  frame_writer.PushCallerFp(caller_fp);
+
+  const intptr_t fp_value = top_address + frame_writer.top_offset();
+  output_frame->SetFp(fp_value);
+  if (is_topmost) {
+    Register fp_reg = JavaScriptFrame::fp_register();
+    output_frame->SetRegister(fp_reg.code(), fp_value);
+  }
+
+  if (V8_EMBEDDED_CONSTANT_POOL_BOOL) {
+    // Read the caller's constant pool from the previous frame.
+    const intptr_t caller_cp = output_[frame_index - 1]->GetConstantPool();
+    frame_writer.PushCallerConstantPool(caller_cp);
+  }
+  intptr_t marker = StackFrame::TypeToMarker(StackFrame::FAST_CONSTRUCT);
+  frame_writer.PushRawValue(marker, "fast construct stub sentinel\n");
+  frame_writer.PushTranslatedValue(value_iterator++, "context");
+  frame_writer.PushTranslatedValue(receiver_iterator, "implicit receiver");
+
+  // The FastConstructFrame needs to be aligned in some architectures.
+  ReadOnlyRoots roots(isolate());
+  for (int i = 0; i < ArgumentPaddingSlots(1); ++i) {
+    frame_writer.PushRawObject(roots.the_hole_value(), "padding\n");
+  }
+
+  if (is_topmost) {
+    for (int i = 0; i < ArgumentPaddingSlots(1); ++i) {
+      frame_writer.PushRawObject(roots.the_hole_value(), "padding\n");
+    }
+    // Ensure the result is restored back when we return to the stub.
+    Register result_reg = kReturnRegister0;
+    intptr_t result = input_->GetRegister(result_reg.code());
+    frame_writer.PushRawValue(result, "subcall result\n");
+  }
+
+  CHECK_EQ(translated_frame->end(), value_iterator);
+  CHECK_EQ(0u, frame_writer.top_offset());
+
+  // Compute this frame's PC.
+  Tagged<Code> construct_stub = isolate_->builtins()->code(
+      Builtin::kInterpreterPushArgsThenFastConstructFunction);
+  Address start = construct_stub->instruction_start();
+  const int pc_offset =
+      isolate_->heap()->construct_stub_invoke_deopt_pc_offset().value();
+  intptr_t pc_value = static_cast<intptr_t>(start + pc_offset);
+  if (is_topmost) {
+    // Only the pc of the topmost frame needs to be signed since it is
+    // authenticated at the end of the DeoptimizationEntry builtin.
+    output_frame->SetPc(PointerAuthentication::SignAndCheckPC(
+        isolate(), pc_value, frame_writer.frame()->GetTop()));
+  } else {
+    output_frame->SetPc(pc_value);
+  }
+
+  // Update constant pool.
+  if (V8_EMBEDDED_CONSTANT_POOL_BOOL) {
+    intptr_t constant_pool_value =
+        static_cast<intptr_t>(construct_stub->constant_pool());
+    output_frame->SetConstantPool(constant_pool_value);
+    if (is_topmost) {
+      Register constant_pool_reg =
+          JavaScriptFrame::constant_pool_pointer_register();
+      output_frame->SetRegister(constant_pool_reg.code(), constant_pool_value);
+    }
+  }
+
+  // Clear the context register. The context might be a de-materialized object
+  // and will be materialized by {Runtime_NotifyDeoptimized}. For additional
+  // safety we use Smi(0) instead of the potential {arguments_marker} here.
   if (is_topmost) {
+    intptr_t context_value = static_cast<intptr_t>(Smi::zero().ptr());
+    Register context_reg = JavaScriptFrame::context_register();
+    output_frame->SetRegister(context_reg.code(), context_value);
+
+    // Set the continuation for the topmost frame.
     DCHECK_EQ(DeoptimizeKind::kLazy, deopt_kind_);
-    Code continuation = builtins->code(Builtin::kNotifyDeoptimized);
+    Tagged<Code> continuation =
+        isolate_->builtins()->code(Builtin::kNotifyDeoptimized);
     output_frame->SetContinuation(
-        static_cast<intptr_t>(continuation.InstructionStart()));
+        static_cast<intptr_t>(continuation->instruction_start()));
   }
 }
 
@@ -1683,7 +1932,7 @@ void Deoptimizer::DoComputeBuiltinContinuation(
   // sure that it's harvested from the translation and copied into the register
   // set (it was automatically added at the end of the FrameState by the
   // instruction selector).
-  Object context = value_iterator->GetRawValue();
+  Tagged<Object> context = value_iterator->GetRawValue();
   const intptr_t value = context.ptr();
   TranslatedFrame::iterator context_register_value = value_iterator++;
   register_values[kContextRegister.code()] = context_register_value;
@@ -1805,7 +2054,7 @@ void Deoptimizer::DoComputeBuiltinContinuation(
   // For JSToWasmBuiltinContinuations use ContinueToCodeStubBuiltin, and not
   // ContinueToCodeStubBuiltinWithResult because we don't want to overwrite the
   // return value that we have already set.
-  Code continue_to_builtin =
+  Tagged<Code> continue_to_builtin =
       isolate()->builtins()->code(TrampolineForBuiltinContinuation(
           mode, frame_info.frame_has_result_stack_slot() &&
                     !is_js_to_wasm_builtin_continuation));
@@ -1814,24 +2063,25 @@ void Deoptimizer::DoComputeBuiltinContinuation(
     // authenticated at the end of the DeoptimizationEntry builtin.
     const intptr_t top_most_pc = PointerAuthentication::SignAndCheckPC(
         isolate(),
-        static_cast<intptr_t>(continue_to_builtin.InstructionStart()),
+        static_cast<intptr_t>(continue_to_builtin->instruction_start()),
         frame_writer.frame()->GetTop());
     output_frame->SetPc(top_most_pc);
   } else {
     output_frame->SetPc(
-        static_cast<intptr_t>(continue_to_builtin.InstructionStart()));
+        static_cast<intptr_t>(continue_to_builtin->instruction_start()));
   }
 
-  Code continuation = isolate()->builtins()->code(Builtin::kNotifyDeoptimized);
+  Tagged<Code> continuation =
+      isolate()->builtins()->code(Builtin::kNotifyDeoptimized);
   output_frame->SetContinuation(
-      static_cast<intptr_t>(continuation.InstructionStart()));
+      static_cast<intptr_t>(continuation->instruction_start()));
 }
 
 void Deoptimizer::MaterializeHeapObjects() {
   translated_state_.Prepare(static_cast<Address>(stack_fp_));
   if (v8_flags.deopt_every_n_times > 0) {
     // Doing a GC here will find problems with the deoptimized frames.
-    isolate_->heap()->CollectAllGarbage(Heap::kNoGCFlags,
+    isolate_->heap()->CollectAllGarbage(GCFlag::kNoFlags,
                                         GarbageCollectionReason::kTesting);
   }
 
@@ -1842,13 +2092,13 @@ void Deoptimizer::MaterializeHeapObjects() {
       PrintF(trace_scope()->file(),
              "Materialization [" V8PRIxPTR_FMT "] <- " V8PRIxPTR_FMT " ;  ",
              static_cast<intptr_t>(materialization.output_slot_address_),
-             value->ptr());
-      value->ShortPrint(trace_scope()->file());
+             (*value).ptr());
+      ShortPrint(*value, trace_scope()->file());
       PrintF(trace_scope()->file(), "\n");
     }
 
     *(reinterpret_cast<Address*>(materialization.output_slot_address_)) =
-        value->ptr();
+        (*value).ptr();
   }
 
   translated_state_.VerifyMaterializedObjects();
@@ -1868,7 +2118,7 @@ void Deoptimizer::MaterializeHeapObjects() {
 }
 
 void Deoptimizer::QueueValueForMaterialization(
-    Address output_address, Object obj,
+    Address output_address, Tagged<Object> obj,
     const TranslatedFrame::iterator& iterator) {
   if (obj == ReadOnlyRoots(isolate_).arguments_marker()) {
     values_to_materialize_.push_back({output_address, iterator});
@@ -1877,10 +2127,10 @@ void Deoptimizer::QueueValueForMaterialization(
 
 unsigned Deoptimizer::ComputeInputFrameAboveFpFixedSize() const {
   unsigned fixed_size = CommonFrameConstants::kFixedFrameSizeAboveFp;
-  // TODO(jkummerow): If {function_->IsSmi()} can indeed be true, then
+  // TODO(jkummerow): If {IsSmi(function_)} can indeed be true, then
   // {function_} should not have type {JSFunction}.
-  if (!function_.IsSmi()) {
-    fixed_size += ComputeIncomingArgumentSize(function_.shared());
+  if (!IsSmi(function_)) {
+    fixed_size += ComputeIncomingArgumentSize(function_->shared());
   }
   return fixed_size;
 }
@@ -1891,14 +2141,14 @@ namespace {
 // points to immediately after the deopt call).
 //
 // See also the Deoptimizer constructor.
-Address GetDeoptCallPCFromReturnPC(Address return_pc, Code code) {
+Address GetDeoptCallPCFromReturnPC(Address return_pc, Tagged<Code> code) {
   DCHECK_GT(Deoptimizer::kEagerDeoptExitSize, 0);
   DCHECK_GT(Deoptimizer::kLazyDeoptExitSize, 0);
-  DeoptimizationData deopt_data =
-      DeoptimizationData::cast(code.deoptimization_data());
+  Tagged<DeoptimizationData> deopt_data =
+      DeoptimizationData::cast(code->deoptimization_data());
   Address deopt_start =
-      code.InstructionStart() + deopt_data.DeoptExitStart().value();
-  int eager_deopt_count = deopt_data.EagerDeoptCount().value();
+      code->instruction_start() + deopt_data->DeoptExitStart().value();
+  int eager_deopt_count = deopt_data->EagerDeoptCount().value();
   Address lazy_deopt_start =
       deopt_start + eager_deopt_count * Deoptimizer::kEagerDeoptExitSize;
   // The deoptimization exits are sorted so that lazy deopt exits appear
@@ -1920,13 +2170,14 @@ unsigned Deoptimizer::ComputeInputFrameSize() const {
   // function into account so we have to avoid double counting them.
   unsigned fixed_size_above_fp = ComputeInputFrameAboveFpFixedSize();
   unsigned result = fixed_size_above_fp + fp_to_sp_delta_;
-  DCHECK(CodeKindCanDeoptimize(compiled_code_.kind()));
-  unsigned stack_slots = compiled_code_.stack_slots();
-  if (compiled_code_.is_maglevved()) {
+  DCHECK(CodeKindCanDeoptimize(compiled_code_->kind()));
+  unsigned stack_slots = compiled_code_->stack_slots();
+  if (compiled_code_->is_maglevved() && !deoptimizing_throw_) {
     // Maglev code can deopt in deferred code which has spilled registers across
     // the call. These will be included in the fp_to_sp_delta, but the expected
     // frame size won't include them, so we need to check for less-equal rather
-    // than equal.
+    // than equal. For deoptimizing throws, these will have already been trimmed
+    // off.
     CHECK_LE(fixed_size_above_fp + (stack_slots * kSystemPointerSize) -
                  CommonFrameConstants::kFixedFrameSizeAboveFp,
              result);
@@ -1935,7 +2186,7 @@ unsigned Deoptimizer::ComputeInputFrameSize() const {
       Address deopt_call_pc = GetDeoptCallPCFromReturnPC(from_, compiled_code_);
       MaglevSafepointTable table(isolate_, deopt_call_pc, compiled_code_);
       MaglevSafepointEntry safepoint = table.FindEntry(deopt_call_pc);
-      unsigned extra_spills = safepoint.num_pushed_registers();
+      unsigned extra_spills = safepoint.num_extra_spill_slots();
       CHECK_EQ(fixed_size_above_fp + (stack_slots * kSystemPointerSize) -
                    CommonFrameConstants::kFixedFrameSizeAboveFp +
                    extra_spills * kSystemPointerSize,
@@ -1951,13 +2202,15 @@ unsigned Deoptimizer::ComputeInputFrameSize() const {
 }
 
 // static
-unsigned Deoptimizer::ComputeIncomingArgumentSize(SharedFunctionInfo shared) {
-  int parameter_slots = shared.internal_formal_parameter_count_with_receiver();
+unsigned Deoptimizer::ComputeIncomingArgumentSize(
+    Tagged<SharedFunctionInfo> shared) {
+  int parameter_slots = shared->internal_formal_parameter_count_with_receiver();
   return parameter_slots * kSystemPointerSize;
 }
 
-Deoptimizer::DeoptInfo Deoptimizer::GetDeoptInfo(Code code, Address pc) {
-  CHECK(code.InstructionStart() <= pc && pc <= code.InstructionEnd());
+Deoptimizer::DeoptInfo Deoptimizer::GetDeoptInfo(Tagged<Code> code,
+                                                 Address pc) {
+  CHECK(code->instruction_start() <= pc && pc <= code->instruction_end());
   SourcePosition last_position = SourcePosition::Unknown();
   DeoptimizeReason last_reason = DeoptimizeReason::kUnknown;
   uint32_t last_node_id = 0;
diff --git a/deps/v8/src/deoptimizer/deoptimizer.h b/deps/v8/src/deoptimizer/deoptimizer.h
index 02eec6d87be6ba..f37506b7558aca 100644
--- a/deps/v8/src/deoptimizer/deoptimizer.h
+++ b/deps/v8/src/deoptimizer/deoptimizer.h
@@ -43,7 +43,18 @@ class Deoptimizer : public Malloced {
     const int deopt_id;
   };
 
-  static DeoptInfo GetDeoptInfo(Code code, Address from);
+  // Whether the deopt exit is contained by the outermost loop containing the
+  // osr'd loop. For example:
+  //
+  //  for (;;) {
+  //    for (;;) {
+  //    }  // OSR is triggered on this backedge.
+  //  }  // This is the outermost loop containing the osr'd loop.
+  static bool DeoptExitIsInsideOsrLoop(Isolate* isolate,
+                                       Tagged<JSFunction> function,
+                                       BytecodeOffset deopt_exit_offset,
+                                       BytecodeOffset osr_offset);
+  static DeoptInfo GetDeoptInfo(Tagged<Code> code, Address from);
   DeoptInfo GetDeoptInfo() const {
     return Deoptimizer::GetDeoptInfo(compiled_code_, from_);
   }
@@ -75,7 +86,8 @@ class Deoptimizer : public Malloced {
   // again and any activations of the optimized code will get deoptimized when
   // execution returns. If {code} is specified then the given code is targeted
   // instead of the function code (e.g. OSR code not installed on function).
-  static void DeoptimizeFunction(JSFunction function, Code code = {});
+  static void DeoptimizeFunction(Tagged<JSFunction> function,
+                                 Tagged<Code> code = {});
 
   // Deoptimize all code in the given isolate.
   V8_EXPORT_PRIVATE static void DeoptimizeAll(Isolate* isolate);
@@ -130,18 +142,18 @@ class Deoptimizer : public Malloced {
   V8_EXPORT_PRIVATE static const int kLazyDeoptExitSize;
 
   // Tracing.
-  static void TraceMarkForDeoptimization(Isolate* isolate, Code code,
+  static void TraceMarkForDeoptimization(Isolate* isolate, Tagged<Code> code,
                                          const char* reason);
   static void TraceEvictFromOptimizedCodeCache(Isolate* isolate,
-                                               SharedFunctionInfo sfi,
+                                               Tagged<SharedFunctionInfo> sfi,
                                                const char* reason);
 
  private:
-  void QueueValueForMaterialization(Address output_address, Object obj,
+  void QueueValueForMaterialization(Address output_address, Tagged<Object> obj,
                                     const TranslatedFrame::iterator& iterator);
 
-  Deoptimizer(Isolate* isolate, JSFunction function, DeoptimizeKind kind,
-              Address from, int fp_to_sp_delta);
+  Deoptimizer(Isolate* isolate, Tagged<JSFunction> function,
+              DeoptimizeKind kind, Address from, int fp_to_sp_delta);
   void DeleteFrameDescriptions();
 
   void DoComputeOutputFrames();
@@ -149,8 +161,10 @@ class Deoptimizer : public Malloced {
                                  int frame_index, bool goto_catch_handler);
   void DoComputeInlinedExtraArguments(TranslatedFrame* translated_frame,
                                       int frame_index);
-  void DoComputeConstructStubFrame(TranslatedFrame* translated_frame,
-                                   int frame_index);
+  void DoComputeConstructCreateStubFrame(TranslatedFrame* translated_frame,
+                                         int frame_index);
+  void DoComputeConstructInvokeStubFrame(TranslatedFrame* translated_frame,
+                                         int frame_index);
 
   static Builtin TrampolineForBuiltinContinuation(BuiltinContinuationMode mode,
                                                   bool must_handle_result);
@@ -167,7 +181,8 @@ class Deoptimizer : public Malloced {
   unsigned ComputeInputFrameAboveFpFixedSize() const;
   unsigned ComputeInputFrameSize() const;
 
-  static unsigned ComputeIncomingArgumentSize(SharedFunctionInfo shared);
+  static unsigned ComputeIncomingArgumentSize(
+      Tagged<SharedFunctionInfo> shared);
 
   // Tracing.
   bool tracing_enabled() const { return trace_scope_ != nullptr; }
@@ -181,7 +196,8 @@ class Deoptimizer : public Malloced {
   void TraceDeoptBegin(int optimization_id, BytecodeOffset bytecode_offset);
   void TraceDeoptEnd(double deopt_duration);
 #ifdef DEBUG
-  static void TraceFoundActivation(Isolate* isolate, JSFunction function);
+  static void TraceFoundActivation(Isolate* isolate,
+                                   Tagged<JSFunction> function);
 #endif
   static void TraceDeoptAll(Isolate* isolate);
 
diff --git a/deps/v8/src/deoptimizer/translation-array.cc b/deps/v8/src/deoptimizer/frame-translation-builder.cc
similarity index 55%
rename from deps/v8/src/deoptimizer/translation-array.cc
rename to deps/v8/src/deoptimizer/frame-translation-builder.cc
index 72f1004ddb65c7..a2b5d13de4e4d5 100644
--- a/deps/v8/src/deoptimizer/translation-array.cc
+++ b/deps/v8/src/deoptimizer/frame-translation-builder.cc
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include "src/deoptimizer/translation-array.h"
+#include "src/deoptimizer/frame-translation-builder.h"
 
 #include "src/base/vlq.h"
 #include "src/deoptimizer/translated-state.h"
@@ -17,167 +17,6 @@ namespace internal {
 
 namespace {
 
-#ifdef V8_USE_ZLIB
-// Constants describing compressed TranslationArray layout. Only relevant if
-// --turbo-compress-translation-arrays is enabled.
-constexpr int kUncompressedSizeOffset = 0;
-constexpr int kUncompressedSizeSize = kInt32Size;
-constexpr int kCompressedDataOffset =
-    kUncompressedSizeOffset + kUncompressedSizeSize;
-constexpr int kTranslationArrayElementSize = kInt32Size;
-#endif  // V8_USE_ZLIB
-
-}  // namespace
-
-TranslationArrayIterator::TranslationArrayIterator(TranslationArray buffer,
-                                                   int index)
-    : buffer_(buffer), index_(index) {
-#ifdef V8_USE_ZLIB
-  if (V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)) {
-    const int size = buffer_.get_int(kUncompressedSizeOffset);
-    uncompressed_contents_.insert(uncompressed_contents_.begin(), size, 0);
-
-    uLongf uncompressed_size = size * kTranslationArrayElementSize;
-
-    CHECK_EQ(zlib_internal::UncompressHelper(
-                 zlib_internal::ZRAW,
-                 base::bit_cast<Bytef*>(uncompressed_contents_.data()),
-                 &uncompressed_size,
-                 buffer_.GetDataStartAddress() + kCompressedDataOffset,
-                 buffer_.DataSize()),
-             Z_OK);
-    DCHECK(index >= 0 && index < size);
-    return;
-  }
-#endif  // V8_USE_ZLIB
-  DCHECK(!v8_flags.turbo_compress_translation_arrays);
-  DCHECK(index >= 0 && index < buffer.length());
-  // Starting at a location other than a BEGIN would make
-  // MATCH_PREVIOUS_TRANSLATION instructions not work.
-  DCHECK(TranslationOpcodeIsBegin(
-      static_cast<TranslationOpcode>(buffer_.GetDataStartAddress()[index])));
-}
-
-int32_t TranslationArrayIterator::NextOperand() {
-  if (V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)) {
-    return uncompressed_contents_[index_++];
-  } else if (remaining_ops_to_use_from_previous_translation_) {
-    int32_t value =
-        base::VLQDecode(buffer_.GetDataStartAddress(), &previous_index_);
-    DCHECK_LT(previous_index_, index_);
-    return value;
-  } else {
-    int32_t value = base::VLQDecode(buffer_.GetDataStartAddress(), &index_);
-    DCHECK_LE(index_, buffer_.length());
-    return value;
-  }
-}
-
-TranslationOpcode TranslationArrayIterator::NextOpcodeAtPreviousIndex() {
-  TranslationOpcode opcode =
-      static_cast<TranslationOpcode>(buffer_.get(previous_index_++));
-  DCHECK_LT(static_cast<uint32_t>(opcode), kNumTranslationOpcodes);
-  DCHECK_NE(opcode, TranslationOpcode::MATCH_PREVIOUS_TRANSLATION);
-  DCHECK_LT(previous_index_, index_);
-  return opcode;
-}
-
-uint32_t TranslationArrayIterator::NextUnsignedOperandAtPreviousIndex() {
-  uint32_t value =
-      base::VLQDecodeUnsigned(buffer_.GetDataStartAddress(), &previous_index_);
-  DCHECK_LT(previous_index_, index_);
-  return value;
-}
-
-uint32_t TranslationArrayIterator::NextOperandUnsigned() {
-  if (V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)) {
-    return uncompressed_contents_[index_++];
-  } else if (remaining_ops_to_use_from_previous_translation_) {
-    return NextUnsignedOperandAtPreviousIndex();
-  } else {
-    uint32_t value =
-        base::VLQDecodeUnsigned(buffer_.GetDataStartAddress(), &index_);
-    DCHECK_LE(index_, buffer_.length());
-    return value;
-  }
-}
-
-TranslationOpcode TranslationArrayIterator::NextOpcode() {
-  if (V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)) {
-    return static_cast<TranslationOpcode>(NextOperandUnsigned());
-  }
-  if (remaining_ops_to_use_from_previous_translation_) {
-    --remaining_ops_to_use_from_previous_translation_;
-  }
-  if (remaining_ops_to_use_from_previous_translation_) {
-    return NextOpcodeAtPreviousIndex();
-  }
-  uint8_t opcode_byte = buffer_.get(index_++);
-
-  // If the opcode byte is greater than any valid opcode, then the opcode is
-  // implicitly MATCH_PREVIOUS_TRANSLATION and the operand is the opcode byte
-  // minus kNumTranslationOpcodes. This special-case encoding of the most common
-  // opcode saves some memory.
-  if (opcode_byte >= kNumTranslationOpcodes) {
-    remaining_ops_to_use_from_previous_translation_ =
-        opcode_byte - kNumTranslationOpcodes;
-    opcode_byte =
-        static_cast<uint8_t>(TranslationOpcode::MATCH_PREVIOUS_TRANSLATION);
-  } else if (opcode_byte ==
-             static_cast<uint8_t>(
-                 TranslationOpcode::MATCH_PREVIOUS_TRANSLATION)) {
-    remaining_ops_to_use_from_previous_translation_ = NextOperandUnsigned();
-  }
-
-  TranslationOpcode opcode = static_cast<TranslationOpcode>(opcode_byte);
-  DCHECK_LE(index_, buffer_.length());
-  DCHECK_LT(static_cast<uint32_t>(opcode), kNumTranslationOpcodes);
-  if (TranslationOpcodeIsBegin(opcode)) {
-    int temp_index = index_;
-    // The first argument for BEGIN is the distance, in bytes, since the
-    // previous BEGIN, or zero to indicate that MATCH_PREVIOUS_TRANSLATION will
-    // not be used in this translation.
-    uint32_t lookback_distance =
-        base::VLQDecodeUnsigned(buffer_.GetDataStartAddress(), &temp_index);
-    if (lookback_distance) {
-      previous_index_ = index_ - 1 - lookback_distance;
-      DCHECK(TranslationOpcodeIsBegin(
-          static_cast<TranslationOpcode>(buffer_.get(previous_index_))));
-      // The previous BEGIN should specify zero as its lookback distance,
-      // meaning it won't use MATCH_PREVIOUS_TRANSLATION.
-      DCHECK_EQ(buffer_.get(previous_index_ + 1), 0);
-    }
-    ops_since_previous_index_was_updated_ = 1;
-  } else if (opcode == TranslationOpcode::MATCH_PREVIOUS_TRANSLATION) {
-    for (int i = 0; i < ops_since_previous_index_was_updated_; ++i) {
-      SkipOpcodeAndItsOperandsAtPreviousIndex();
-    }
-    ops_since_previous_index_was_updated_ = 0;
-    opcode = NextOpcodeAtPreviousIndex();
-  } else {
-    ++ops_since_previous_index_was_updated_;
-  }
-  return opcode;
-}
-
-bool TranslationArrayIterator::HasNextOpcode() const {
-  if (V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)) {
-    return index_ < static_cast<int>(uncompressed_contents_.size());
-  } else {
-    return index_ < buffer_.length() ||
-           remaining_ops_to_use_from_previous_translation_ > 1;
-  }
-}
-
-void TranslationArrayIterator::SkipOpcodeAndItsOperandsAtPreviousIndex() {
-  TranslationOpcode opcode = NextOpcodeAtPreviousIndex();
-  for (int count = TranslationOpcodeOperandCount(opcode); count != 0; --count) {
-    NextUnsignedOperandAtPreviousIndex();
-  }
-}
-
-namespace {
-
 class OperandBase {
  public:
   explicit OperandBase(uint32_t value) : value_(value) {}
@@ -201,7 +40,7 @@ class UnsignedOperand : public OperandBase {
   explicit UnsignedOperand(uint32_t value) : OperandBase(value) {}
   void WriteVLQ(ZoneVector<uint8_t>* buffer) {
     base::VLQEncodeUnsigned(
-        [buffer](byte value) {
+        [buffer](uint8_t value) {
           buffer->push_back(value);
           return &buffer->back();
         },
@@ -215,7 +54,7 @@ class SignedOperand : public OperandBase {
   explicit SignedOperand(int32_t value) : OperandBase(value) {}
   void WriteVLQ(ZoneVector<uint8_t>* buffer) {
     base::VLQEncode(
-        [buffer](byte value) {
+        [buffer](uint8_t value) {
           buffer->push_back(value);
           return &buffer->back();
         },
@@ -232,28 +71,28 @@ inline bool OperandsEqual(uint32_t* expected_operands, T... operands) {
 }  // namespace
 
 template <typename... T>
-void TranslationArrayBuilder::AddRawToContents(TranslationOpcode opcode,
+void FrameTranslationBuilder::AddRawToContents(TranslationOpcode opcode,
                                                T... operands) {
   DCHECK_EQ(sizeof...(T), TranslationOpcodeOperandCount(opcode));
-  DCHECK(!v8_flags.turbo_compress_translation_arrays);
-  contents_.push_back(static_cast<byte>(opcode));
+  DCHECK(!v8_flags.turbo_compress_frame_translations);
+  contents_.push_back(static_cast<uint8_t>(opcode));
   (..., operands.WriteVLQ(&contents_));
 }
 
 template <typename... T>
-void TranslationArrayBuilder::AddRawToContentsForCompression(
+void FrameTranslationBuilder::AddRawToContentsForCompression(
     TranslationOpcode opcode, T... operands) {
   DCHECK_EQ(sizeof...(T), TranslationOpcodeOperandCount(opcode));
-  DCHECK(v8_flags.turbo_compress_translation_arrays);
-  contents_for_compression_.push_back(static_cast<byte>(opcode));
+  DCHECK(v8_flags.turbo_compress_frame_translations);
+  contents_for_compression_.push_back(static_cast<uint8_t>(opcode));
   (..., contents_for_compression_.push_back(operands.value()));
 }
 
 template <typename... T>
-void TranslationArrayBuilder::AddRawBegin(bool update_feedback, T... operands) {
+void FrameTranslationBuilder::AddRawBegin(bool update_feedback, T... operands) {
   auto opcode = update_feedback ? TranslationOpcode::BEGIN_WITH_FEEDBACK
                                 : TranslationOpcode::BEGIN_WITHOUT_FEEDBACK;
-  if (V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)) {
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
     AddRawToContentsForCompression(opcode, operands...);
   } else {
     AddRawToContents(opcode, operands...);
@@ -265,7 +104,7 @@ void TranslationArrayBuilder::AddRawBegin(bool update_feedback, T... operands) {
   }
 }
 
-int TranslationArrayBuilder::BeginTranslation(int frame_count,
+int FrameTranslationBuilder::BeginTranslation(int frame_count,
                                               int jsframe_count,
                                               bool update_feedback) {
   FinishPendingInstructionIfNeeded();
@@ -304,7 +143,7 @@ int TranslationArrayBuilder::BeginTranslation(int frame_count,
   return start_index;
 }
 
-void TranslationArrayBuilder::FinishPendingInstructionIfNeeded() {
+void FrameTranslationBuilder::FinishPendingInstructionIfNeeded() {
   if (matching_instructions_count_) {
     total_matching_instructions_in_current_translation_ +=
         matching_instructions_count_;
@@ -329,9 +168,9 @@ void TranslationArrayBuilder::FinishPendingInstructionIfNeeded() {
 }
 
 template <typename... T>
-void TranslationArrayBuilder::Add(TranslationOpcode opcode, T... operands) {
+void FrameTranslationBuilder::Add(TranslationOpcode opcode, T... operands) {
   DCHECK_EQ(sizeof...(T), TranslationOpcodeOperandCount(opcode));
-  if (V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)) {
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
     AddRawToContentsForCompression(opcode, operands...);
     return;
   }
@@ -362,14 +201,14 @@ void TranslationArrayBuilder::Add(TranslationOpcode opcode, T... operands) {
   ++instruction_index_within_translation_;
 }
 
-Handle<TranslationArray> TranslationArrayBuilder::ToTranslationArray(
-    Factory* factory) {
+Handle<DeoptimizationFrameTranslation>
+FrameTranslationBuilder::ToFrameTranslation(LocalFactory* factory) {
 #ifdef V8_USE_ZLIB
-  if (V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)) {
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
     const int input_size = SizeInBytes();
     uLongf compressed_data_size = compressBound(input_size);
 
-    ZoneVector<byte> compressed_data(compressed_data_size, zone());
+    ZoneVector<uint8_t> compressed_data(compressed_data_size, zone());
 
     CHECK_EQ(
         zlib_internal::CompressHelper(
@@ -379,27 +218,31 @@ Handle<TranslationArray> TranslationArrayBuilder::ToTranslationArray(
         Z_OK);
 
     const int translation_array_size =
-        static_cast<int>(compressed_data_size) + kUncompressedSizeSize;
-    Handle<TranslationArray> result =
-        factory->NewByteArray(translation_array_size, AllocationType::kOld);
-
-    result->set_int(kUncompressedSizeOffset, Size());
-    std::memcpy(result->GetDataStartAddress() + kCompressedDataOffset,
+        static_cast<int>(compressed_data_size) +
+        DeoptimizationFrameTranslation::kUncompressedSizeSize;
+    Handle<DeoptimizationFrameTranslation> result =
+        factory->NewDeoptimizationFrameTranslation(translation_array_size);
+
+    result->set_int(DeoptimizationFrameTranslation::kUncompressedSizeOffset,
+                    Size());
+    std::memcpy(result->GetDataStartAddress() +
+                    DeoptimizationFrameTranslation::kCompressedDataOffset,
                 compressed_data.data(), compressed_data_size);
 
     return result;
   }
 #endif
-  DCHECK(!v8_flags.turbo_compress_translation_arrays);
+  DCHECK(!v8_flags.turbo_compress_frame_translations);
   FinishPendingInstructionIfNeeded();
-  Handle<TranslationArray> result =
-      factory->NewByteArray(SizeInBytes(), AllocationType::kOld);
+  Handle<DeoptimizationFrameTranslation> result =
+      factory->NewDeoptimizationFrameTranslation(SizeInBytes());
+  if (SizeInBytes() == 0) return result;
   memcpy(result->GetDataStartAddress(), contents_.data(),
          contents_.size() * sizeof(uint8_t));
 #ifdef ENABLE_SLOW_DCHECKS
   if (v8_flags.enable_slow_asserts) {
     // Check that we can read back all of the same content we intended to write.
-    TranslationArrayIterator it(*result, 0);
+    DeoptimizationFrameTranslation::Iterator it(*result, 0);
     for (size_t i = 0; i < all_instructions_.size(); ++i) {
       CHECK(it.HasNextOpcode());
       const Instruction& instruction = all_instructions_[i];
@@ -417,7 +260,7 @@ Handle<TranslationArray> TranslationArrayBuilder::ToTranslationArray(
   return result;
 }
 
-void TranslationArrayBuilder::BeginBuiltinContinuationFrame(
+void FrameTranslationBuilder::BeginBuiltinContinuationFrame(
     BytecodeOffset bytecode_offset, int literal_id, unsigned height) {
   auto opcode = TranslationOpcode::BUILTIN_CONTINUATION_FRAME;
   Add(opcode, SignedOperand(bytecode_offset.ToInt()), SignedOperand(literal_id),
@@ -425,7 +268,7 @@ void TranslationArrayBuilder::BeginBuiltinContinuationFrame(
 }
 
 #if V8_ENABLE_WEBASSEMBLY
-void TranslationArrayBuilder::BeginJSToWasmBuiltinContinuationFrame(
+void FrameTranslationBuilder::BeginJSToWasmBuiltinContinuationFrame(
     BytecodeOffset bytecode_offset, int literal_id, unsigned height,
     base::Optional<wasm::ValueKind> return_kind) {
   auto opcode = TranslationOpcode::JS_TO_WASM_BUILTIN_CONTINUATION_FRAME;
@@ -434,16 +277,23 @@ void TranslationArrayBuilder::BeginJSToWasmBuiltinContinuationFrame(
       SignedOperand(return_kind ? static_cast<int>(return_kind.value())
                                 : kNoWasmReturnKind));
 }
+
+void FrameTranslationBuilder::BeginWasmInlinedIntoJSFrame(
+    BytecodeOffset bailout_id, int literal_id, unsigned height) {
+  auto opcode = TranslationOpcode::WASM_INLINED_INTO_JS_FRAME;
+  Add(opcode, SignedOperand(bailout_id.ToInt()), SignedOperand(literal_id),
+      SignedOperand(height));
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void TranslationArrayBuilder::BeginJavaScriptBuiltinContinuationFrame(
+void FrameTranslationBuilder::BeginJavaScriptBuiltinContinuationFrame(
     BytecodeOffset bytecode_offset, int literal_id, unsigned height) {
   auto opcode = TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_FRAME;
   Add(opcode, SignedOperand(bytecode_offset.ToInt()), SignedOperand(literal_id),
       SignedOperand(height));
 }
 
-void TranslationArrayBuilder::BeginJavaScriptBuiltinContinuationWithCatchFrame(
+void FrameTranslationBuilder::BeginJavaScriptBuiltinContinuationWithCatchFrame(
     BytecodeOffset bytecode_offset, int literal_id, unsigned height) {
   auto opcode =
       TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH_FRAME;
@@ -451,20 +301,24 @@ void TranslationArrayBuilder::BeginJavaScriptBuiltinContinuationWithCatchFrame(
       SignedOperand(height));
 }
 
-void TranslationArrayBuilder::BeginConstructStubFrame(
-    BytecodeOffset bytecode_offset, int literal_id, unsigned height) {
-  auto opcode = TranslationOpcode::CONSTRUCT_STUB_FRAME;
-  Add(opcode, SignedOperand(bytecode_offset.ToInt()), SignedOperand(literal_id),
-      SignedOperand(height));
+void FrameTranslationBuilder::BeginConstructCreateStubFrame(int literal_id,
+                                                            unsigned height) {
+  auto opcode = TranslationOpcode::CONSTRUCT_CREATE_STUB_FRAME;
+  Add(opcode, SignedOperand(literal_id), SignedOperand(height));
+}
+
+void FrameTranslationBuilder::BeginConstructInvokeStubFrame(int literal_id) {
+  auto opcode = TranslationOpcode::CONSTRUCT_INVOKE_STUB_FRAME;
+  Add(opcode, SignedOperand(literal_id));
 }
 
-void TranslationArrayBuilder::BeginInlinedExtraArguments(int literal_id,
+void FrameTranslationBuilder::BeginInlinedExtraArguments(int literal_id,
                                                          unsigned height) {
   auto opcode = TranslationOpcode::INLINED_EXTRA_ARGUMENTS;
   Add(opcode, SignedOperand(literal_id), SignedOperand(height));
 }
 
-void TranslationArrayBuilder::BeginInterpretedFrame(
+void FrameTranslationBuilder::BeginInterpretedFrame(
     BytecodeOffset bytecode_offset, int literal_id, unsigned height,
     int return_value_offset, int return_value_count) {
   if (return_value_count == 0) {
@@ -479,141 +333,152 @@ void TranslationArrayBuilder::BeginInterpretedFrame(
   }
 }
 
-void TranslationArrayBuilder::ArgumentsElements(CreateArgumentsType type) {
+void FrameTranslationBuilder::ArgumentsElements(CreateArgumentsType type) {
   auto opcode = TranslationOpcode::ARGUMENTS_ELEMENTS;
   Add(opcode, SignedOperand(static_cast<uint8_t>(type)));
 }
 
-void TranslationArrayBuilder::ArgumentsLength() {
+void FrameTranslationBuilder::ArgumentsLength() {
   auto opcode = TranslationOpcode::ARGUMENTS_LENGTH;
   Add(opcode);
 }
 
-void TranslationArrayBuilder::BeginCapturedObject(int length) {
+void FrameTranslationBuilder::BeginCapturedObject(int length) {
   auto opcode = TranslationOpcode::CAPTURED_OBJECT;
   Add(opcode, SignedOperand(length));
 }
 
-void TranslationArrayBuilder::DuplicateObject(int object_index) {
+void FrameTranslationBuilder::DuplicateObject(int object_index) {
   auto opcode = TranslationOpcode::DUPLICATED_OBJECT;
   Add(opcode, SignedOperand(object_index));
 }
 
-void TranslationArrayBuilder::StoreRegister(TranslationOpcode opcode,
+void FrameTranslationBuilder::StoreRegister(TranslationOpcode opcode,
                                             Register reg) {
   static_assert(Register::kNumRegisters - 1 <= base::kDataMask);
-  Add(opcode, SmallUnsignedOperand(static_cast<byte>(reg.code())));
+  Add(opcode, SmallUnsignedOperand(static_cast<uint8_t>(reg.code())));
 }
 
-void TranslationArrayBuilder::StoreRegister(Register reg) {
+void FrameTranslationBuilder::StoreRegister(Register reg) {
   auto opcode = TranslationOpcode::REGISTER;
   StoreRegister(opcode, reg);
 }
 
-void TranslationArrayBuilder::StoreInt32Register(Register reg) {
+void FrameTranslationBuilder::StoreInt32Register(Register reg) {
   auto opcode = TranslationOpcode::INT32_REGISTER;
   StoreRegister(opcode, reg);
 }
 
-void TranslationArrayBuilder::StoreInt64Register(Register reg) {
+void FrameTranslationBuilder::StoreInt64Register(Register reg) {
   auto opcode = TranslationOpcode::INT64_REGISTER;
   StoreRegister(opcode, reg);
 }
 
-void TranslationArrayBuilder::StoreSignedBigInt64Register(Register reg) {
+void FrameTranslationBuilder::StoreSignedBigInt64Register(Register reg) {
   auto opcode = TranslationOpcode::SIGNED_BIGINT64_REGISTER;
   StoreRegister(opcode, reg);
 }
 
-void TranslationArrayBuilder::StoreUnsignedBigInt64Register(Register reg) {
+void FrameTranslationBuilder::StoreUnsignedBigInt64Register(Register reg) {
   auto opcode = TranslationOpcode::UNSIGNED_BIGINT64_REGISTER;
   StoreRegister(opcode, reg);
 }
 
-void TranslationArrayBuilder::StoreUint32Register(Register reg) {
+void FrameTranslationBuilder::StoreUint32Register(Register reg) {
   auto opcode = TranslationOpcode::UINT32_REGISTER;
   StoreRegister(opcode, reg);
 }
 
-void TranslationArrayBuilder::StoreBoolRegister(Register reg) {
+void FrameTranslationBuilder::StoreBoolRegister(Register reg) {
   auto opcode = TranslationOpcode::BOOL_REGISTER;
   StoreRegister(opcode, reg);
 }
 
-void TranslationArrayBuilder::StoreFloatRegister(FloatRegister reg) {
+void FrameTranslationBuilder::StoreFloatRegister(FloatRegister reg) {
   static_assert(FloatRegister::kNumRegisters - 1 <= base::kDataMask);
   auto opcode = TranslationOpcode::FLOAT_REGISTER;
-  Add(opcode, SmallUnsignedOperand(static_cast<byte>(reg.code())));
+  Add(opcode, SmallUnsignedOperand(static_cast<uint8_t>(reg.code())));
 }
 
-void TranslationArrayBuilder::StoreDoubleRegister(DoubleRegister reg) {
+void FrameTranslationBuilder::StoreDoubleRegister(DoubleRegister reg) {
   static_assert(DoubleRegister::kNumRegisters - 1 <= base::kDataMask);
   auto opcode = TranslationOpcode::DOUBLE_REGISTER;
-  Add(opcode, SmallUnsignedOperand(static_cast<byte>(reg.code())));
+  Add(opcode, SmallUnsignedOperand(static_cast<uint8_t>(reg.code())));
+}
+
+void FrameTranslationBuilder::StoreHoleyDoubleRegister(DoubleRegister reg) {
+  static_assert(DoubleRegister::kNumRegisters - 1 <= base::kDataMask);
+  auto opcode = TranslationOpcode::HOLEY_DOUBLE_REGISTER;
+  Add(opcode, SmallUnsignedOperand(static_cast<uint8_t>(reg.code())));
 }
 
-void TranslationArrayBuilder::StoreStackSlot(int index) {
-  auto opcode = TranslationOpcode::STACK_SLOT;
+void FrameTranslationBuilder::StoreStackSlot(int index) {
+  auto opcode = TranslationOpcode::TAGGED_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreInt32StackSlot(int index) {
+void FrameTranslationBuilder::StoreInt32StackSlot(int index) {
   auto opcode = TranslationOpcode::INT32_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreInt64StackSlot(int index) {
+void FrameTranslationBuilder::StoreInt64StackSlot(int index) {
   auto opcode = TranslationOpcode::INT64_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreSignedBigInt64StackSlot(int index) {
+void FrameTranslationBuilder::StoreSignedBigInt64StackSlot(int index) {
   auto opcode = TranslationOpcode::SIGNED_BIGINT64_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreUnsignedBigInt64StackSlot(int index) {
+void FrameTranslationBuilder::StoreUnsignedBigInt64StackSlot(int index) {
   auto opcode = TranslationOpcode::UNSIGNED_BIGINT64_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreUint32StackSlot(int index) {
+void FrameTranslationBuilder::StoreUint32StackSlot(int index) {
   auto opcode = TranslationOpcode::UINT32_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreBoolStackSlot(int index) {
+void FrameTranslationBuilder::StoreBoolStackSlot(int index) {
   auto opcode = TranslationOpcode::BOOL_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreFloatStackSlot(int index) {
+void FrameTranslationBuilder::StoreFloatStackSlot(int index) {
   auto opcode = TranslationOpcode::FLOAT_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreDoubleStackSlot(int index) {
+void FrameTranslationBuilder::StoreDoubleStackSlot(int index) {
   auto opcode = TranslationOpcode::DOUBLE_STACK_SLOT;
   Add(opcode, SignedOperand(index));
 }
 
-void TranslationArrayBuilder::StoreLiteral(int literal_id) {
+void FrameTranslationBuilder::StoreHoleyDoubleStackSlot(int index) {
+  auto opcode = TranslationOpcode::HOLEY_DOUBLE_STACK_SLOT;
+  Add(opcode, SignedOperand(index));
+}
+
+void FrameTranslationBuilder::StoreLiteral(int literal_id) {
   auto opcode = TranslationOpcode::LITERAL;
   DCHECK_GE(literal_id, 0);
   Add(opcode, SignedOperand(literal_id));
 }
 
-void TranslationArrayBuilder::StoreOptimizedOut() {
+void FrameTranslationBuilder::StoreOptimizedOut() {
   auto opcode = TranslationOpcode::OPTIMIZED_OUT;
   Add(opcode);
 }
 
-void TranslationArrayBuilder::AddUpdateFeedback(int vector_literal, int slot) {
+void FrameTranslationBuilder::AddUpdateFeedback(int vector_literal, int slot) {
   auto opcode = TranslationOpcode::UPDATE_FEEDBACK;
   Add(opcode, SignedOperand(vector_literal), SignedOperand(slot));
 }
 
-void TranslationArrayBuilder::StoreJSFrameFunction() {
+void FrameTranslationBuilder::StoreJSFrameFunction() {
   StoreStackSlot((StandardFrameConstants::kCallerPCOffset -
                   StandardFrameConstants::kFunctionOffset) /
                  kSystemPointerSize);
diff --git a/deps/v8/src/deoptimizer/translation-array.h b/deps/v8/src/deoptimizer/frame-translation-builder.h
similarity index 72%
rename from deps/v8/src/deoptimizer/translation-array.h
rename to deps/v8/src/deoptimizer/frame-translation-builder.h
index e6279c266a7c97..c2f7398095691f 100644
--- a/deps/v8/src/deoptimizer/translation-array.h
+++ b/deps/v8/src/deoptimizer/frame-translation-builder.h
@@ -2,12 +2,12 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#ifndef V8_DEOPTIMIZER_TRANSLATION_ARRAY_H_
-#define V8_DEOPTIMIZER_TRANSLATION_ARRAY_H_
+#ifndef V8_DEOPTIMIZER_FRAME_TRANSLATION_BUILDER_H_
+#define V8_DEOPTIMIZER_FRAME_TRANSLATION_BUILDER_H_
 
 #include "src/codegen/register.h"
 #include "src/deoptimizer/translation-opcode.h"
-#include "src/objects/fixed-array.h"
+#include "src/objects/deoptimization-data.h"
 #include "src/zone/zone-containers.h"
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -17,62 +17,18 @@
 namespace v8 {
 namespace internal {
 
-class Factory;
+class LocalFactory;
 
-// The TranslationArray is the on-heap representation of translations created
-// during code generation in a (zone-allocated) TranslationArrayBuilder. The
-// translation array specifies how to transform an optimized frame back into
-// one or more unoptimized frames.
-// TODO(jgruber): Consider a real type instead of this type alias.
-using TranslationArray = ByteArray;
-
-class TranslationArrayIterator {
- public:
-  TranslationArrayIterator(TranslationArray buffer, int index);
-
-  int32_t NextOperand();
-
-  uint32_t NextOperandUnsigned();
-
-  TranslationOpcode NextOpcode();
-
-  bool HasNextOpcode() const;
-
-  void SkipOperands(int n) {
-    for (int i = 0; i < n; i++) NextOperand();
-  }
-
- private:
-  TranslationOpcode NextOpcodeAtPreviousIndex();
-  uint32_t NextUnsignedOperandAtPreviousIndex();
-  void SkipOpcodeAndItsOperandsAtPreviousIndex();
-
-  std::vector<int32_t> uncompressed_contents_;
-  TranslationArray buffer_;
-  int index_;
-
-  // This decrementing counter indicates how many more times to read operations
-  // from the previous translation before continuing to move the index forward.
-  int remaining_ops_to_use_from_previous_translation_ = 0;
-
-  // An index into buffer_ for operations starting at a previous BEGIN, which
-  // can be used to read operations referred to by MATCH_PREVIOUS_TRANSLATION.
-  int previous_index_ = 0;
-
-  // When starting a new MATCH_PREVIOUS_TRANSLATION operation, we'll need to
-  // advance the previous_index_ by this many steps.
-  int ops_since_previous_index_was_updated_ = 0;
-};
-
-class TranslationArrayBuilder {
+class FrameTranslationBuilder {
  public:
-  explicit TranslationArrayBuilder(Zone* zone)
+  explicit FrameTranslationBuilder(Zone* zone)
       : contents_(zone),
         contents_for_compression_(zone),
         basis_instructions_(zone),
         zone_(zone) {}
 
-  Handle<TranslationArray> ToTranslationArray(Factory* factory);
+  Handle<DeoptimizationFrameTranslation> ToFrameTranslation(
+      LocalFactory* factory);
 
   int BeginTranslation(int frame_count, int jsframe_count,
                        bool update_feedback);
@@ -81,14 +37,16 @@ class TranslationArrayBuilder {
                              unsigned height, int return_value_offset,
                              int return_value_count);
   void BeginInlinedExtraArguments(int literal_id, unsigned height);
-  void BeginConstructStubFrame(BytecodeOffset bailout_id, int literal_id,
-                               unsigned height);
+  void BeginConstructCreateStubFrame(int literal_id, unsigned height);
+  void BeginConstructInvokeStubFrame(int literal_id);
   void BeginBuiltinContinuationFrame(BytecodeOffset bailout_id, int literal_id,
                                      unsigned height);
 #if V8_ENABLE_WEBASSEMBLY
   void BeginJSToWasmBuiltinContinuationFrame(
       BytecodeOffset bailout_id, int literal_id, unsigned height,
       base::Optional<wasm::ValueKind> return_kind);
+  void BeginWasmInlinedIntoJSFrame(BytecodeOffset bailout_id, int literal_id,
+                                   unsigned height);
 #endif  // V8_ENABLE_WEBASSEMBLY
   void BeginJavaScriptBuiltinContinuationFrame(BytecodeOffset bailout_id,
                                                int literal_id, unsigned height);
@@ -109,6 +67,7 @@ class TranslationArrayBuilder {
   void StoreBoolRegister(Register reg);
   void StoreFloatRegister(FloatRegister reg);
   void StoreDoubleRegister(DoubleRegister reg);
+  void StoreHoleyDoubleRegister(DoubleRegister reg);
   void StoreStackSlot(int index);
   void StoreInt32StackSlot(int index);
   void StoreInt64StackSlot(int index);
@@ -118,6 +77,7 @@ class TranslationArrayBuilder {
   void StoreBoolStackSlot(int index);
   void StoreFloatStackSlot(int index);
   void StoreDoubleStackSlot(int index);
+  void StoreHoleyDoubleStackSlot(int index);
   void StoreLiteral(int literal_id);
   void StoreOptimizedOut();
   void StoreJSFrameFunction();
@@ -150,12 +110,12 @@ class TranslationArrayBuilder {
   void Add(TranslationOpcode opcode, T... operands);
 
   // Adds the instruction to contents_, without performing the other steps of
-  // Add(). Requires !v8_flags.turbo_compress_translation_arrays.
+  // Add(). Requires !v8_flags.turbo_compress_frame_translations.
   template <typename... T>
   void AddRawToContents(TranslationOpcode opcode, T... operands);
 
   // Adds the instruction to contents_for_compression_, without performing the
-  // other steps of Add(). Requires v8_flags.turbo_compress_translation_arrays.
+  // other steps of Add(). Requires v8_flags.turbo_compress_frame_translations.
   template <typename... T>
   void AddRawToContentsForCompression(TranslationOpcode opcode, T... operands);
 
@@ -165,12 +125,12 @@ class TranslationArrayBuilder {
   void AddRawBegin(bool update_feedback, T... operands);
 
   int Size() const {
-    return V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)
+    return V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)
                ? static_cast<int>(contents_for_compression_.size())
                : static_cast<int>(contents_.size());
   }
   int SizeInBytes() const {
-    return V8_UNLIKELY(v8_flags.turbo_compress_translation_arrays)
+    return V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)
                ? Size() * kInt32Size
                : Size();
   }
@@ -211,4 +171,4 @@ class TranslationArrayBuilder {
 }  // namespace internal
 }  // namespace v8
 
-#endif  // V8_DEOPTIMIZER_TRANSLATION_ARRAY_H_
+#endif  // V8_DEOPTIMIZER_FRAME_TRANSLATION_BUILDER_H_
diff --git a/deps/v8/src/deoptimizer/materialized-object-store.cc b/deps/v8/src/deoptimizer/materialized-object-store.cc
index a69c594628e8e3..bfcbcbfdf4f143 100644
--- a/deps/v8/src/deoptimizer/materialized-object-store.cc
+++ b/deps/v8/src/deoptimizer/materialized-object-store.cc
@@ -40,14 +40,14 @@ bool MaterializedObjectStore::Remove(Address fp) {
   int index = static_cast<int>(std::distance(frame_fps_.begin(), it));
 
   frame_fps_.erase(it);
-  FixedArray array = isolate()->heap()->materialized_objects();
+  Tagged<FixedArray> array = isolate()->heap()->materialized_objects();
 
-  CHECK_LT(index, array.length());
+  CHECK_LT(index, array->length());
   int fps_size = static_cast<int>(frame_fps_.size());
   for (int i = index; i < fps_size; i++) {
-    array.set(i, array.get(i + 1));
+    array->set(i, array->get(i + 1));
   }
-  array.set(fps_size, ReadOnlyRoots(isolate()).undefined_value());
+  array->set(fps_size, ReadOnlyRoots(isolate()).undefined_value());
   return true;
 }
 
@@ -79,7 +79,8 @@ Handle<FixedArray> MaterializedObjectStore::EnsureStackEntries(int length) {
   for (int i = 0; i < array->length(); i++) {
     new_array->set(i, array->get(i));
   }
-  HeapObject undefined_value = ReadOnlyRoots(isolate()).undefined_value();
+  Tagged<HeapObject> undefined_value =
+      ReadOnlyRoots(isolate()).undefined_value();
   for (int i = array->length(); i < length; i++) {
     new_array->set(i, undefined_value);
   }
diff --git a/deps/v8/src/deoptimizer/translated-state.cc b/deps/v8/src/deoptimizer/translated-state.cc
index a9c6693ca933e0..fc7c1b94009c64 100644
--- a/deps/v8/src/deoptimizer/translated-state.cc
+++ b/deps/v8/src/deoptimizer/translated-state.cc
@@ -7,6 +7,7 @@
 #include <iomanip>
 
 #include "src/base/memory.h"
+#include "src/base/v8-fallthrough.h"
 #include "src/common/assert-scope.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/deoptimizer/materialized-object-store.h"
@@ -32,286 +33,308 @@ using base::ReadUnalignedValue;
 
 namespace internal {
 
-void TranslationArrayPrintSingleFrame(
-    std::ostream& os, TranslationArray translation_array, int translation_index,
-    DeoptimizationLiteralArray literal_array) {
-  DisallowGarbageCollection gc_oh_noes;
-  TranslationArrayIterator iterator(translation_array, translation_index);
+void DeoptimizationFrameTranslationPrintSingleOpcode(
+    std::ostream& os, TranslationOpcode opcode,
+    DeoptimizationFrameTranslation::Iterator& iterator,
+    Tagged<DeoptimizationLiteralArray> literal_array) {
   disasm::NameConverter converter;
+  switch (opcode) {
+    case TranslationOpcode::BEGIN_WITH_FEEDBACK:
+    case TranslationOpcode::BEGIN_WITHOUT_FEEDBACK:
+    case TranslationOpcode::MATCH_PREVIOUS_TRANSLATION: {
+      iterator.NextOperand();  // Skip the lookback distance.
+      int frame_count = iterator.NextOperand();
+      int jsframe_count = iterator.NextOperand();
+      os << "{frame count=" << frame_count
+         << ", js frame count=" << jsframe_count << "}";
+      break;
+    }
 
-  TranslationOpcode opcode = iterator.NextOpcode();
-  DCHECK(TranslationOpcodeIsBegin(opcode));
-  iterator.NextOperand();  // Skip the lookback distance.
-  int frame_count = iterator.NextOperand();
-  int jsframe_count = iterator.NextOperand();
-  os << "  " << TranslationOpcodeToString(opcode)
-     << " {frame count=" << frame_count << ", js frame count=" << jsframe_count
-     << "}\n";
-
-  while (iterator.HasNextOpcode()) {
-    opcode = iterator.NextOpcode();
-    if (TranslationOpcodeIsBegin(opcode)) break;
-
-    os << std::setw(31) << "    " << TranslationOpcodeToString(opcode) << " ";
-
-    switch (opcode) {
-      case TranslationOpcode::BEGIN_WITH_FEEDBACK:
-      case TranslationOpcode::BEGIN_WITHOUT_FEEDBACK:
-      case TranslationOpcode::MATCH_PREVIOUS_TRANSLATION:
-        UNREACHABLE();
-
-      case TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN:
-      case TranslationOpcode::INTERPRETED_FRAME_WITHOUT_RETURN: {
-        int bytecode_offset = iterator.NextOperand();
-        int shared_info_id = iterator.NextOperand();
-        unsigned height = iterator.NextOperand();
-        int return_value_offset = 0;
-        int return_value_count = 0;
-        if (opcode == TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN) {
-          DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 5);
-          return_value_offset = iterator.NextOperand();
-          return_value_count = iterator.NextOperand();
-        } else {
-          DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 3);
-        }
-        Object shared_info = literal_array.get(shared_info_id);
-        os << "{bytecode_offset=" << bytecode_offset << ", function="
-           << SharedFunctionInfo::cast(shared_info).DebugNameCStr().get()
-           << ", height=" << height << ", retval=@" << return_value_offset
-           << "(#" << return_value_count << ")}";
-        break;
-      }
-
-      case TranslationOpcode::CONSTRUCT_STUB_FRAME: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 3);
-        int bailout_id = iterator.NextOperand();
-        int shared_info_id = iterator.NextOperand();
-        Object shared_info = literal_array.get(shared_info_id);
-        unsigned height = iterator.NextOperand();
-        os << "{bailout_id=" << bailout_id << ", function="
-           << SharedFunctionInfo::cast(shared_info).DebugNameCStr().get()
-           << ", height=" << height << "}";
-        break;
-      }
-
-      case TranslationOpcode::BUILTIN_CONTINUATION_FRAME:
-      case TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_FRAME:
-      case TranslationOpcode::
-          JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH_FRAME: {
+    case TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN:
+    case TranslationOpcode::INTERPRETED_FRAME_WITHOUT_RETURN: {
+      int bytecode_offset = iterator.NextOperand();
+      int shared_info_id = iterator.NextOperand();
+      unsigned height = iterator.NextOperand();
+      int return_value_offset = 0;
+      int return_value_count = 0;
+      if (opcode == TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN) {
+        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 5);
+        return_value_offset = iterator.NextOperand();
+        return_value_count = iterator.NextOperand();
+      } else {
         DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 3);
-        int bailout_id = iterator.NextOperand();
-        int shared_info_id = iterator.NextOperand();
-        Object shared_info = literal_array.get(shared_info_id);
-        unsigned height = iterator.NextOperand();
-        os << "{bailout_id=" << bailout_id << ", function="
-           << SharedFunctionInfo::cast(shared_info).DebugNameCStr().get()
-           << ", height=" << height << "}";
-        break;
       }
+      Object shared_info = literal_array->get(shared_info_id);
+      os << "{bytecode_offset=" << bytecode_offset << ", function="
+         << SharedFunctionInfo::cast(shared_info)->DebugNameCStr().get()
+         << ", height=" << height << ", retval=@" << return_value_offset << "(#"
+         << return_value_count << ")}";
+      break;
+    }
 
 #if V8_ENABLE_WEBASSEMBLY
-      case TranslationOpcode::JS_TO_WASM_BUILTIN_CONTINUATION_FRAME: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 4);
-        int bailout_id = iterator.NextOperand();
-        int shared_info_id = iterator.NextOperand();
-        Object shared_info = literal_array.get(shared_info_id);
-        unsigned height = iterator.NextOperand();
-        int wasm_return_type = iterator.NextOperand();
-        os << "{bailout_id=" << bailout_id << ", function="
-           << SharedFunctionInfo::cast(shared_info).DebugNameCStr().get()
-           << ", height=" << height << ", wasm_return_type=" << wasm_return_type
-           << "}";
-        break;
-      }
+    case TranslationOpcode::WASM_INLINED_INTO_JS_FRAME: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 3);
+      int bailout_id = iterator.NextOperand();
+      int shared_info_id = iterator.NextOperand();
+      Object shared_info = literal_array->get(shared_info_id);
+      unsigned height = iterator.NextOperand();
+      os << "{bailout_id=" << bailout_id << ", function="
+         << SharedFunctionInfo::cast(shared_info)->DebugNameCStr().get()
+         << ", height=" << height << "}";
+      break;
+    }
+
+#endif
+    case TranslationOpcode::CONSTRUCT_CREATE_STUB_FRAME: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 2);
+      int shared_info_id = iterator.NextOperand();
+      Object shared_info = literal_array->get(shared_info_id);
+      unsigned height = iterator.NextOperand();
+      os << "{construct create stub, function="
+         << SharedFunctionInfo::cast(shared_info)->DebugNameCStr().get()
+         << ", height=" << height << "}";
+      break;
+    }
+
+    case TranslationOpcode::CONSTRUCT_INVOKE_STUB_FRAME: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int shared_info_id = iterator.NextOperand();
+      Object shared_info = literal_array->get(shared_info_id);
+      os << "{construct invoke stub, function="
+         << SharedFunctionInfo::cast(shared_info)->DebugNameCStr().get() << "}";
+      break;
+    }
+
+    case TranslationOpcode::BUILTIN_CONTINUATION_FRAME:
+    case TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_FRAME:
+    case TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH_FRAME: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 3);
+      int bailout_id = iterator.NextOperand();
+      int shared_info_id = iterator.NextOperand();
+      Object shared_info = literal_array->get(shared_info_id);
+      unsigned height = iterator.NextOperand();
+      os << "{bailout_id=" << bailout_id << ", function="
+         << SharedFunctionInfo::cast(shared_info)->DebugNameCStr().get()
+         << ", height=" << height << "}";
+      break;
+    }
+
+#if V8_ENABLE_WEBASSEMBLY
+    case TranslationOpcode::JS_TO_WASM_BUILTIN_CONTINUATION_FRAME: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 4);
+      int bailout_id = iterator.NextOperand();
+      int shared_info_id = iterator.NextOperand();
+      Object shared_info = literal_array->get(shared_info_id);
+      unsigned height = iterator.NextOperand();
+      int wasm_return_type = iterator.NextOperand();
+      os << "{bailout_id=" << bailout_id << ", function="
+         << SharedFunctionInfo::cast(shared_info)->DebugNameCStr().get()
+         << ", height=" << height << ", wasm_return_type=" << wasm_return_type
+         << "}";
+      break;
+    }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-      case TranslationOpcode::INLINED_EXTRA_ARGUMENTS: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 2);
-        int shared_info_id = iterator.NextOperand();
-        Object shared_info = literal_array.get(shared_info_id);
-        unsigned height = iterator.NextOperand();
-        os << "{function="
-           << SharedFunctionInfo::cast(shared_info).DebugNameCStr().get()
-           << ", height=" << height << "}";
-        break;
-      }
+    case TranslationOpcode::INLINED_EXTRA_ARGUMENTS: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 2);
+      int shared_info_id = iterator.NextOperand();
+      Object shared_info = literal_array->get(shared_info_id);
+      unsigned height = iterator.NextOperand();
+      os << "{function="
+         << SharedFunctionInfo::cast(shared_info)->DebugNameCStr().get()
+         << ", height=" << height << "}";
+      break;
+    }
 
-      case TranslationOpcode::REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << converter.NameOfCPURegister(reg_code) << "}";
-        break;
-      }
+    case TranslationOpcode::REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << converter.NameOfCPURegister(reg_code) << "}";
+      break;
+    }
 
-      case TranslationOpcode::INT32_REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << converter.NameOfCPURegister(reg_code) << " (int32)}";
-        break;
-      }
+    case TranslationOpcode::INT32_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << converter.NameOfCPURegister(reg_code) << " (int32)}";
+      break;
+    }
 
-      case TranslationOpcode::INT64_REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << converter.NameOfCPURegister(reg_code) << " (int64)}";
-        break;
-      }
+    case TranslationOpcode::INT64_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << converter.NameOfCPURegister(reg_code) << " (int64)}";
+      break;
+    }
 
-      case TranslationOpcode::SIGNED_BIGINT64_REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << converter.NameOfCPURegister(reg_code)
-           << " (signed bigint64)}";
-        break;
-      }
+    case TranslationOpcode::SIGNED_BIGINT64_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << converter.NameOfCPURegister(reg_code)
+         << " (signed bigint64)}";
+      break;
+    }
 
-      case TranslationOpcode::UNSIGNED_BIGINT64_REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << converter.NameOfCPURegister(reg_code)
-           << " (unsigned bigint64)}";
-        break;
-      }
+    case TranslationOpcode::UNSIGNED_BIGINT64_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << converter.NameOfCPURegister(reg_code)
+         << " (unsigned bigint64)}";
+      break;
+    }
 
-      case TranslationOpcode::UINT32_REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << converter.NameOfCPURegister(reg_code)
-           << " (uint32)}";
-        break;
-      }
+    case TranslationOpcode::UINT32_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << converter.NameOfCPURegister(reg_code) << " (uint32)}";
+      break;
+    }
 
-      case TranslationOpcode::BOOL_REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << converter.NameOfCPURegister(reg_code) << " (bool)}";
-        break;
-      }
+    case TranslationOpcode::BOOL_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << converter.NameOfCPURegister(reg_code) << " (bool)}";
+      break;
+    }
 
-      case TranslationOpcode::FLOAT_REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << FloatRegister::from_code(reg_code) << "}";
-        break;
-      }
+    case TranslationOpcode::FLOAT_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << FloatRegister::from_code(reg_code) << "}";
+      break;
+    }
 
-      case TranslationOpcode::DOUBLE_REGISTER: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int reg_code = iterator.NextOperandUnsigned();
-        os << "{input=" << DoubleRegister::from_code(reg_code) << "}";
-        break;
-      }
+    case TranslationOpcode::DOUBLE_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << DoubleRegister::from_code(reg_code) << "}";
+      break;
+    }
 
-      case TranslationOpcode::STACK_SLOT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int input_slot_index = iterator.NextOperand();
-        os << "{input=" << input_slot_index << "}";
-        break;
-      }
+    case TranslationOpcode::HOLEY_DOUBLE_REGISTER: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int reg_code = iterator.NextOperandUnsigned();
+      os << "{input=" << DoubleRegister::from_code(reg_code) << " (holey)}";
+      break;
+    }
 
-      case TranslationOpcode::INT32_STACK_SLOT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int input_slot_index = iterator.NextOperand();
-        os << "{input=" << input_slot_index << " (int32)}";
-        break;
-      }
+    case TranslationOpcode::TAGGED_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << "}";
+      break;
+    }
 
-      case TranslationOpcode::INT64_STACK_SLOT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int input_slot_index = iterator.NextOperand();
-        os << "{input=" << input_slot_index << " (int64)}";
-        break;
-      }
+    case TranslationOpcode::INT32_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << " (int32)}";
+      break;
+    }
 
-      case TranslationOpcode::SIGNED_BIGINT64_STACK_SLOT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int input_slot_index = iterator.NextOperand();
-        os << "{input=" << input_slot_index << " (signed bigint64)}";
-        break;
-      }
+    case TranslationOpcode::INT64_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << " (int64)}";
+      break;
+    }
 
-      case TranslationOpcode::UNSIGNED_BIGINT64_STACK_SLOT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int input_slot_index = iterator.NextOperand();
-        os << "{input=" << input_slot_index << " (unsigned bigint64)}";
-        break;
-      }
+    case TranslationOpcode::SIGNED_BIGINT64_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << " (signed bigint64)}";
+      break;
+    }
 
-      case TranslationOpcode::UINT32_STACK_SLOT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int input_slot_index = iterator.NextOperand();
-        os << "{input=" << input_slot_index << " (uint32)}";
-        break;
-      }
+    case TranslationOpcode::UNSIGNED_BIGINT64_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << " (unsigned bigint64)}";
+      break;
+    }
 
-      case TranslationOpcode::BOOL_STACK_SLOT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int input_slot_index = iterator.NextOperand();
-        os << "{input=" << input_slot_index << " (bool)}";
-        break;
-      }
+    case TranslationOpcode::UINT32_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << " (uint32)}";
+      break;
+    }
 
-      case TranslationOpcode::FLOAT_STACK_SLOT:
-      case TranslationOpcode::DOUBLE_STACK_SLOT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int input_slot_index = iterator.NextOperand();
-        os << "{input=" << input_slot_index << "}";
-        break;
-      }
+    case TranslationOpcode::BOOL_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << " (bool)}";
+      break;
+    }
 
-      case TranslationOpcode::OPTIMIZED_OUT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 0);
-        os << "{optimized_out}}";
-        break;
-      }
+    case TranslationOpcode::FLOAT_STACK_SLOT:
+    case TranslationOpcode::DOUBLE_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << "}";
+      break;
+    }
 
-      case TranslationOpcode::LITERAL: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int literal_index = iterator.NextOperand();
-        Object literal_value = literal_array.get(literal_index);
-        os << "{literal_id=" << literal_index << " (" << Brief(literal_value)
-           << ")}";
-        break;
-      }
+    case TranslationOpcode::HOLEY_DOUBLE_STACK_SLOT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int input_slot_index = iterator.NextOperand();
+      os << "{input=" << input_slot_index << " (holey)}";
+      break;
+    }
 
-      case TranslationOpcode::DUPLICATED_OBJECT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int object_index = iterator.NextOperand();
-        os << "{object_index=" << object_index << "}";
-        break;
-      }
+    case TranslationOpcode::OPTIMIZED_OUT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 0);
+      os << "{optimized_out}}";
+      break;
+    }
 
-      case TranslationOpcode::ARGUMENTS_ELEMENTS: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        CreateArgumentsType arguments_type =
-            static_cast<CreateArgumentsType>(iterator.NextOperand());
-        os << "{arguments_type=" << arguments_type << "}";
-        break;
-      }
-      case TranslationOpcode::ARGUMENTS_LENGTH: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 0);
-        os << "{arguments_length}";
-        break;
-      }
+    case TranslationOpcode::LITERAL: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int literal_index = iterator.NextOperand();
+      Object literal_value = literal_array->get(literal_index);
+      os << "{literal_id=" << literal_index << " (" << Brief(literal_value)
+         << ")}";
+      break;
+    }
 
-      case TranslationOpcode::CAPTURED_OBJECT: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
-        int args_length = iterator.NextOperand();
-        os << "{length=" << args_length << "}";
-        break;
-      }
+    case TranslationOpcode::DUPLICATED_OBJECT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int object_index = iterator.NextOperand();
+      os << "{object_index=" << object_index << "}";
+      break;
+    }
 
-      case TranslationOpcode::UPDATE_FEEDBACK: {
-        DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 2);
-        int literal_index = iterator.NextOperand();
-        FeedbackSlot slot(iterator.NextOperand());
-        os << "{feedback={vector_index=" << literal_index << ", slot=" << slot
-           << "}}";
-        break;
-      }
+    case TranslationOpcode::ARGUMENTS_ELEMENTS: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      CreateArgumentsType arguments_type =
+          static_cast<CreateArgumentsType>(iterator.NextOperand());
+      os << "{arguments_type=" << arguments_type << "}";
+      break;
+    }
+    case TranslationOpcode::ARGUMENTS_LENGTH: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 0);
+      os << "{arguments_length}";
+      break;
+    }
+
+    case TranslationOpcode::CAPTURED_OBJECT: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 1);
+      int args_length = iterator.NextOperand();
+      os << "{length=" << args_length << "}";
+      break;
+    }
+
+    case TranslationOpcode::UPDATE_FEEDBACK: {
+      DCHECK_EQ(TranslationOpcodeOperandCount(opcode), 2);
+      int literal_index = iterator.NextOperand();
+      FeedbackSlot slot(iterator.NextOperand());
+      os << "{feedback={vector_index=" << literal_index << ", slot=" << slot
+         << "}}";
+      break;
     }
-    os << "\n";
   }
+  os << "\n";
 }
 
 // static
@@ -347,6 +370,14 @@ TranslatedValue TranslatedValue::NewDouble(TranslatedState* container,
   return slot;
 }
 
+// static
+TranslatedValue TranslatedValue::NewHoleyDouble(TranslatedState* container,
+                                                Float64 value) {
+  TranslatedValue slot(container, kHoleyDouble);
+  slot.double_value_ = value;
+  return slot;
+}
+
 // static
 TranslatedValue TranslatedValue::NewInt32(TranslatedState* container,
                                           int32_t value) {
@@ -397,7 +428,7 @@ TranslatedValue TranslatedValue::NewBool(TranslatedState* container,
 
 // static
 TranslatedValue TranslatedValue::NewTagged(TranslatedState* container,
-                                           Object literal) {
+                                           Tagged<Object> literal) {
   TranslatedValue slot(container, kTagged);
   slot.raw_literal_ = literal;
   return slot;
@@ -410,7 +441,7 @@ TranslatedValue TranslatedValue::NewInvalid(TranslatedState* container) {
 
 Isolate* TranslatedValue::isolate() const { return container_->isolate(); }
 
-Object TranslatedValue::raw_literal() const {
+Tagged<Object> TranslatedValue::raw_literal() const {
   DCHECK_EQ(kTagged, kind());
   return raw_literal_;
 }
@@ -441,7 +472,7 @@ Float32 TranslatedValue::float_value() const {
 }
 
 Float64 TranslatedValue::double_value() const {
-  DCHECK_EQ(kDouble, kind());
+  DCHECK(kDouble == kind() || kHoleyDouble == kind());
   return double_value_;
 }
 
@@ -455,12 +486,12 @@ int TranslatedValue::object_index() const {
   return materialization_info_.id_;
 }
 
-Object TranslatedValue::GetRawValue() const {
+Tagged<Object> TranslatedValue::GetRawValue() const {
   // If we have a value, return it.
   if (materialization_state() == kFinished) {
     int smi;
-    if (storage_->IsHeapNumber() &&
-        DoubleToSmiInteger(storage_->Number(), &smi)) {
+    if (IsHeapNumber(*storage_) &&
+        DoubleToSmiInteger(Object::Number(*storage_), &smi)) {
       return Smi::FromInt(smi);
     }
     return *storage_;
@@ -470,25 +501,25 @@ Object TranslatedValue::GetRawValue() const {
   switch (kind()) {
     case kTagged: {
       Object object = raw_literal();
-      if (object.IsSlicedString()) {
+      if (IsSlicedString(object)) {
         // If {object} is a sliced string of length smaller than
         // SlicedString::kMinLength, then trim the underlying SeqString and
         // return it. This assumes that such sliced strings are only built by
         // the fast string builder optimization of Turbofan's
         // StringBuilderOptimizer/EffectControlLinearizer.
         SlicedString string = SlicedString::cast(object);
-        if (string.length() < SlicedString::kMinLength) {
-          String backing_store = string.parent();
-          CHECK(backing_store.IsSeqString());
+        if (string->length() < SlicedString::kMinLength) {
+          String backing_store = string->parent();
+          CHECK(IsSeqString(backing_store));
 
           // Creating filler at the end of the backing store if needed.
           int string_size =
-              backing_store.IsSeqOneByteString()
-                  ? SeqOneByteString::SizeFor(backing_store.length())
-                  : SeqTwoByteString::SizeFor(backing_store.length());
-          int needed_size = backing_store.IsSeqOneByteString()
-                                ? SeqOneByteString::SizeFor(string.length())
-                                : SeqTwoByteString::SizeFor(string.length());
+              IsSeqOneByteString(backing_store)
+                  ? SeqOneByteString::SizeFor(backing_store->length())
+                  : SeqTwoByteString::SizeFor(backing_store->length());
+          int needed_size = IsSeqOneByteString(backing_store)
+                                ? SeqOneByteString::SizeFor(string->length())
+                                : SeqTwoByteString::SizeFor(string->length());
           if (needed_size < string_size) {
             Address new_end = backing_store.address() + needed_size;
             isolate()->heap()->CreateFillerObjectAt(
@@ -496,11 +527,11 @@ Object TranslatedValue::GetRawValue() const {
           }
 
           // Updating backing store's length, effectively trimming it.
-          backing_store.set_length(string.length());
+          backing_store->set_length(string->length());
 
           // Zeroing the padding bytes of {backing_store}.
           SeqString::DataAndPaddingSizes sz =
-              SeqString::cast(backing_store).GetDataAndPaddingSizes();
+              SeqString::cast(backing_store)->GetDataAndPaddingSizes();
           auto padding =
               reinterpret_cast<char*>(backing_store.address() + sz.data_size);
           for (int i = 0; i < sz.padding_size; ++i) {
@@ -564,6 +595,15 @@ Object TranslatedValue::GetRawValue() const {
       break;
     }
 
+    case kHoleyDouble:
+      if (double_value().is_hole_nan()) {
+        // Hole NaNs that made it to here represent the undefined value.
+        return ReadOnlyRoots(isolate()).undefined_value();
+      }
+      // If this is not the hole nan, then this is a normal double value, so
+      // fall through to that.
+      V8_FALLTHROUGH;
+
     case kDouble: {
       int smi;
       if (DoubleToSmiInteger(double_value().get_scalar(), &smi)) {
@@ -591,14 +631,14 @@ Handle<Object> TranslatedValue::GetValue() {
   Handle<Object> value(GetRawValue(), isolate());
   if (materialization_state() == kFinished) return value;
 
-  if (value->IsSmi()) {
+  if (IsSmi(*value)) {
     // Even though stored as a Smi, this number might instead be needed as a
     // HeapNumber when materializing a JSObject with a field of HeapObject
     // representation. Since we don't have this information available here, we
     // just always allocate a HeapNumber and later extract the Smi again if we
     // don't need a HeapObject.
     set_initialized_storage(
-        isolate()->factory()->NewHeapNumber(value->Number()));
+        isolate()->factory()->NewHeapNumber(Object::Number(*value)));
     return value;
   }
 
@@ -621,13 +661,6 @@ Handle<Object> TranslatedValue::GetValue() {
     //    pass the verifier.
     container_->EnsureObjectAllocatedAt(this);
 
-    // Finish any sweeping so that it becomes safe to overwrite the ByteArray
-    // headers.
-    // TODO(hpayer): Find a cleaner way to support a group of
-    // non-fully-initialized objects.
-    isolate()->heap()->EnsureSweepingCompleted(
-        Heap::SweepingForcedFinalizationMode::kV8Only);
-
     // 2. Initialize the objects. If we have allocated only byte arrays
     //    for some objects, we now overwrite the byte arrays with the
     //    correct object fields. Note that this phase does not allocate
@@ -661,6 +694,9 @@ Handle<Object> TranslatedValue::GetValue() {
       heap_object = isolate()->factory()->NewHeapNumber(number);
       break;
     case TranslatedValue::kDouble:
+    // We shouldn't have hole values by now, so treat holey double as normal
+    // double.s
+    case TranslatedValue::kHoleyDouble:
       number = double_value().get_scalar();
       heap_object = isolate()->factory()->NewHeapNumber(number);
       break;
@@ -685,7 +721,7 @@ bool TranslatedValue::IsMaterializedObject() const {
 
 bool TranslatedValue::IsMaterializableByDebugger() const {
   // At the moment, we only allow materialization of doubles.
-  return (kind() == kDouble);
+  return (kind() == kDouble || kind() == kHoleyDouble);
 }
 
 int TranslatedValue::GetChildrenCount() const {
@@ -726,7 +762,7 @@ Float64 TranslatedState::GetDoubleSlot(Address fp, int slot_offset) {
 }
 
 void TranslatedValue::Handlify() {
-  if (kind() == kTagged && raw_literal().IsHeapObject()) {
+  if (kind() == kTagged && IsHeapObject(raw_literal())) {
     set_initialized_storage(
         Handle<HeapObject>(HeapObject::cast(raw_literal()), isolate()));
     raw_literal_ = Object();
@@ -734,8 +770,8 @@ void TranslatedValue::Handlify() {
 }
 
 TranslatedFrame TranslatedFrame::UnoptimizedFrame(
-    BytecodeOffset bytecode_offset, SharedFunctionInfo shared_info, int height,
-    int return_value_offset, int return_value_count) {
+    BytecodeOffset bytecode_offset, Tagged<SharedFunctionInfo> shared_info,
+    int height, int return_value_offset, int return_value_count) {
   TranslatedFrame frame(kUnoptimizedFunction, shared_info, height,
                         return_value_offset, return_value_count);
   frame.bytecode_offset_ = bytecode_offset;
@@ -743,20 +779,22 @@ TranslatedFrame TranslatedFrame::UnoptimizedFrame(
 }
 
 TranslatedFrame TranslatedFrame::InlinedExtraArguments(
-    SharedFunctionInfo shared_info, int height) {
+    Tagged<SharedFunctionInfo> shared_info, int height) {
   return TranslatedFrame(kInlinedExtraArguments, shared_info, height);
 }
 
-TranslatedFrame TranslatedFrame::ConstructStubFrame(
-    BytecodeOffset bytecode_offset, SharedFunctionInfo shared_info,
-    int height) {
-  TranslatedFrame frame(kConstructStub, shared_info, height);
-  frame.bytecode_offset_ = bytecode_offset;
-  return frame;
+TranslatedFrame TranslatedFrame::ConstructCreateStubFrame(
+    Tagged<SharedFunctionInfo> shared_info, int height) {
+  return TranslatedFrame(kConstructCreateStub, shared_info, height);
+}
+
+TranslatedFrame TranslatedFrame::ConstructInvokeStubFrame(
+    Tagged<SharedFunctionInfo> shared_info) {
+  return TranslatedFrame(kConstructInvokeStub, shared_info, 0);
 }
 
 TranslatedFrame TranslatedFrame::BuiltinContinuationFrame(
-    BytecodeOffset bytecode_offset, SharedFunctionInfo shared_info,
+    BytecodeOffset bytecode_offset, Tagged<SharedFunctionInfo> shared_info,
     int height) {
   TranslatedFrame frame(kBuiltinContinuation, shared_info, height);
   frame.bytecode_offset_ = bytecode_offset;
@@ -764,9 +802,17 @@ TranslatedFrame TranslatedFrame::BuiltinContinuationFrame(
 }
 
 #if V8_ENABLE_WEBASSEMBLY
+TranslatedFrame TranslatedFrame::WasmInlinedIntoJSFrame(
+    BytecodeOffset bytecode_offset, Tagged<SharedFunctionInfo> shared_info,
+    int height) {
+  TranslatedFrame frame(kWasmInlinedIntoJS, shared_info, height);
+  frame.bytecode_offset_ = bytecode_offset;
+  return frame;
+}
+
 TranslatedFrame TranslatedFrame::JSToWasmBuiltinContinuationFrame(
-    BytecodeOffset bytecode_offset, SharedFunctionInfo shared_info, int height,
-    base::Optional<wasm::ValueKind> return_kind) {
+    BytecodeOffset bytecode_offset, Tagged<SharedFunctionInfo> shared_info,
+    int height, base::Optional<wasm::ValueKind> return_kind) {
   TranslatedFrame frame(kJSToWasmBuiltinContinuation, shared_info, height);
   frame.bytecode_offset_ = bytecode_offset;
   frame.return_kind_ = return_kind;
@@ -775,7 +821,7 @@ TranslatedFrame TranslatedFrame::JSToWasmBuiltinContinuationFrame(
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 TranslatedFrame TranslatedFrame::JavaScriptBuiltinContinuationFrame(
-    BytecodeOffset bytecode_offset, SharedFunctionInfo shared_info,
+    BytecodeOffset bytecode_offset, Tagged<SharedFunctionInfo> shared_info,
     int height) {
   TranslatedFrame frame(kJavaScriptBuiltinContinuation, shared_info, height);
   frame.bytecode_offset_ = bytecode_offset;
@@ -783,7 +829,7 @@ TranslatedFrame TranslatedFrame::JavaScriptBuiltinContinuationFrame(
 }
 
 TranslatedFrame TranslatedFrame::JavaScriptBuiltinContinuationWithCatchFrame(
-    BytecodeOffset bytecode_offset, SharedFunctionInfo shared_info,
+    BytecodeOffset bytecode_offset, Tagged<SharedFunctionInfo> shared_info,
     int height) {
   TranslatedFrame frame(kJavaScriptBuiltinContinuationWithCatch, shared_info,
                         height);
@@ -799,7 +845,7 @@ int TranslatedFrame::GetValueCount() {
   switch (kind()) {
     case kUnoptimizedFunction: {
       int parameter_count =
-          raw_shared_info_.internal_formal_parameter_count_with_receiver();
+          raw_shared_info_->internal_formal_parameter_count_with_receiver();
       static constexpr int kTheContext = 1;
       static constexpr int kTheAccumulator = 1;
       return height() + parameter_count + kTheContext + kTheFunction +
@@ -809,7 +855,8 @@ int TranslatedFrame::GetValueCount() {
     case kInlinedExtraArguments:
       return height() + kTheFunction;
 
-    case kConstructStub:
+    case kConstructCreateStub:
+    case kConstructInvokeStub:
     case kBuiltinContinuation:
 #if V8_ENABLE_WEBASSEMBLY
     case kJSToWasmBuiltinContinuation:
@@ -819,6 +866,12 @@ int TranslatedFrame::GetValueCount() {
       static constexpr int kTheContext = 1;
       return height() + kTheContext + kTheFunction;
     }
+#if V8_ENABLE_WEBASSEMBLY
+    case kWasmInlinedIntoJS: {
+      static constexpr int kTheContext = 1;
+      return height() + kTheContext + kTheFunction;
+    }
+#endif  // V8_ENABLE_WEBASSEMBLY
 
     case kInvalid:
       UNREACHABLE();
@@ -837,15 +890,16 @@ void TranslatedFrame::Handlify(Isolate* isolate) {
 }
 
 TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
-    TranslationArrayIterator* iterator,
-    DeoptimizationLiteralArray literal_array, Address fp, FILE* trace_file) {
+    DeoptimizationFrameTranslation::Iterator* iterator,
+    Tagged<DeoptimizationLiteralArray> literal_array, Address fp,
+    FILE* trace_file) {
   TranslationOpcode opcode = iterator->NextOpcode();
   switch (opcode) {
     case TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN:
     case TranslationOpcode::INTERPRETED_FRAME_WITHOUT_RETURN: {
       BytecodeOffset bytecode_offset = BytecodeOffset(iterator->NextOperand());
-      SharedFunctionInfo shared_info =
-          SharedFunctionInfo::cast(literal_array.get(iterator->NextOperand()));
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
       int height = iterator->NextOperand();
       int return_value_offset = 0;
       int return_value_count = 0;
@@ -854,10 +908,10 @@ TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
         return_value_count = iterator->NextOperand();
       }
       if (trace_file != nullptr) {
-        std::unique_ptr<char[]> name = shared_info.DebugNameCStr();
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
         PrintF(trace_file, "  reading input frame %s", name.get());
         int arg_count =
-            shared_info.internal_formal_parameter_count_with_receiver();
+            shared_info->internal_formal_parameter_count_with_receiver();
         PrintF(trace_file,
                " => bytecode_offset=%d, args=%d, height=%d, retval=%i(#%i); "
                "inputs:\n",
@@ -870,39 +924,50 @@ TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
     }
 
     case TranslationOpcode::INLINED_EXTRA_ARGUMENTS: {
-      SharedFunctionInfo shared_info =
-          SharedFunctionInfo::cast(literal_array.get(iterator->NextOperand()));
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
       int height = iterator->NextOperand();
       if (trace_file != nullptr) {
-        std::unique_ptr<char[]> name = shared_info.DebugNameCStr();
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
         PrintF(trace_file, "  reading inlined arguments frame %s", name.get());
         PrintF(trace_file, " => height=%d; inputs:\n", height);
       }
       return TranslatedFrame::InlinedExtraArguments(shared_info, height);
     }
 
-    case TranslationOpcode::CONSTRUCT_STUB_FRAME: {
-      BytecodeOffset bytecode_offset = BytecodeOffset(iterator->NextOperand());
-      SharedFunctionInfo shared_info =
-          SharedFunctionInfo::cast(literal_array.get(iterator->NextOperand()));
+    case TranslationOpcode::CONSTRUCT_CREATE_STUB_FRAME: {
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
       int height = iterator->NextOperand();
       if (trace_file != nullptr) {
-        std::unique_ptr<char[]> name = shared_info.DebugNameCStr();
-        PrintF(trace_file, "  reading construct stub frame %s", name.get());
-        PrintF(trace_file, " => bytecode_offset=%d, height=%d; inputs:\n",
-               bytecode_offset.ToInt(), height);
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
+        PrintF(trace_file,
+               "  reading construct create stub frame %s => height = %d; "
+               "inputs:\n",
+               name.get(), height);
+      }
+      return TranslatedFrame::ConstructCreateStubFrame(shared_info, height);
+    }
+
+    case TranslationOpcode::CONSTRUCT_INVOKE_STUB_FRAME: {
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
+      if (trace_file != nullptr) {
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
+        PrintF(trace_file,
+               "  reading construct invoke stub frame %s, inputs:\n",
+               name.get());
       }
-      return TranslatedFrame::ConstructStubFrame(bytecode_offset, shared_info,
-                                                 height);
+      return TranslatedFrame::ConstructInvokeStubFrame(shared_info);
     }
 
     case TranslationOpcode::BUILTIN_CONTINUATION_FRAME: {
       BytecodeOffset bytecode_offset = BytecodeOffset(iterator->NextOperand());
-      SharedFunctionInfo shared_info =
-          SharedFunctionInfo::cast(literal_array.get(iterator->NextOperand()));
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
       int height = iterator->NextOperand();
       if (trace_file != nullptr) {
-        std::unique_ptr<char[]> name = shared_info.DebugNameCStr();
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
         PrintF(trace_file, "  reading builtin continuation frame %s",
                name.get());
         PrintF(trace_file, " => bytecode_offset=%d, height=%d; inputs:\n",
@@ -913,10 +978,26 @@ TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
     }
 
 #if V8_ENABLE_WEBASSEMBLY
+    case TranslationOpcode::WASM_INLINED_INTO_JS_FRAME: {
+      BytecodeOffset bailout_id = BytecodeOffset(iterator->NextOperand());
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
+      int height = iterator->NextOperand();
+      if (trace_file != nullptr) {
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
+        PrintF(trace_file, "  reading Wasm inlined into JS frame %s",
+               name.get());
+        PrintF(trace_file, " => bailout_id=%d, height=%d ; inputs:\n",
+               bailout_id.ToInt(), height);
+      }
+      return TranslatedFrame::WasmInlinedIntoJSFrame(bailout_id, shared_info,
+                                                     height);
+    }
+
     case TranslationOpcode::JS_TO_WASM_BUILTIN_CONTINUATION_FRAME: {
       BytecodeOffset bailout_id = BytecodeOffset(iterator->NextOperand());
-      SharedFunctionInfo shared_info =
-          SharedFunctionInfo::cast(literal_array.get(iterator->NextOperand()));
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
       int height = iterator->NextOperand();
       int return_kind_code = iterator->NextOperand();
       base::Optional<wasm::ValueKind> return_kind;
@@ -924,7 +1005,7 @@ TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
         return_kind = static_cast<wasm::ValueKind>(return_kind_code);
       }
       if (trace_file != nullptr) {
-        std::unique_ptr<char[]> name = shared_info.DebugNameCStr();
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
         PrintF(trace_file, "  reading JS to Wasm builtin continuation frame %s",
                name.get());
         PrintF(trace_file,
@@ -939,11 +1020,11 @@ TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
 
     case TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_FRAME: {
       BytecodeOffset bytecode_offset = BytecodeOffset(iterator->NextOperand());
-      SharedFunctionInfo shared_info =
-          SharedFunctionInfo::cast(literal_array.get(iterator->NextOperand()));
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
       int height = iterator->NextOperand();
       if (trace_file != nullptr) {
-        std::unique_ptr<char[]> name = shared_info.DebugNameCStr();
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
         PrintF(trace_file, "  reading JavaScript builtin continuation frame %s",
                name.get());
         PrintF(trace_file, " => bytecode_offset=%d, height=%d; inputs:\n",
@@ -955,11 +1036,11 @@ TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
 
     case TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH_FRAME: {
       BytecodeOffset bytecode_offset = BytecodeOffset(iterator->NextOperand());
-      SharedFunctionInfo shared_info =
-          SharedFunctionInfo::cast(literal_array.get(iterator->NextOperand()));
+      Tagged<SharedFunctionInfo> shared_info =
+          SharedFunctionInfo::cast(literal_array->get(iterator->NextOperand()));
       int height = iterator->NextOperand();
       if (trace_file != nullptr) {
-        std::unique_ptr<char[]> name = shared_info.DebugNameCStr();
+        std::unique_ptr<char[]> name = shared_info->DebugNameCStr();
         PrintF(trace_file,
                "  reading JavaScript builtin continuation frame with catch %s",
                name.get());
@@ -985,7 +1066,8 @@ TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
     case TranslationOpcode::BOOL_REGISTER:
     case TranslationOpcode::FLOAT_REGISTER:
     case TranslationOpcode::DOUBLE_REGISTER:
-    case TranslationOpcode::STACK_SLOT:
+    case TranslationOpcode::HOLEY_DOUBLE_REGISTER:
+    case TranslationOpcode::TAGGED_STACK_SLOT:
     case TranslationOpcode::INT32_STACK_SLOT:
     case TranslationOpcode::INT64_STACK_SLOT:
     case TranslationOpcode::SIGNED_BIGINT64_STACK_SLOT:
@@ -994,6 +1076,7 @@ TranslatedFrame TranslatedState::CreateNextTranslatedFrame(
     case TranslationOpcode::BOOL_STACK_SLOT:
     case TranslationOpcode::FLOAT_STACK_SLOT:
     case TranslationOpcode::DOUBLE_STACK_SLOT:
+    case TranslationOpcode::HOLEY_DOUBLE_STACK_SLOT:
     case TranslationOpcode::LITERAL:
     case TranslationOpcode::OPTIMIZED_OUT:
     case TranslationOpcode::MATCH_PREVIOUS_TRANSLATION:
@@ -1018,9 +1101,9 @@ void TranslatedFrame::AdvanceIterator(
 
 // Creates translated values for an arguments backing store, or the backing
 // store for rest parameters depending on the given {type}. The TranslatedValue
-// objects for the fields are not read from the TranslationArrayIterator, but
-// instead created on-the-fly based on dynamic information in the optimized
-// frame.
+// objects for the fields are not read from the
+// DeoptimizationFrameTranslation::Iterator, but instead created on-the-fly
+// based on dynamic information in the optimized frame.
 void TranslatedState::CreateArgumentsElementsTranslatedValues(
     int frame_index, Address input_frame_pointer, CreateArgumentsType type,
     FILE* trace_file) {
@@ -1076,14 +1159,14 @@ void TranslatedState::CreateArgumentsElementsTranslatedValues(
 // infrastracture is not GC safe.
 // Thus we build a temporary structure in malloced space.
 // The TranslatedValue objects created correspond to the static translation
-// instructions from the TranslationArrayIterator, except for
+// instructions from the DeoptimizationFrameTranslation::Iterator, except for
 // TranslationOpcode::ARGUMENTS_ELEMENTS, where the number and values of the
 // FixedArray elements depend on dynamic information from the optimized frame.
 // Returns the number of expected nested translations from the
-// TranslationArrayIterator.
+// DeoptimizationFrameTranslation::Iterator.
 int TranslatedState::CreateNextTranslatedValue(
-    int frame_index, TranslationArrayIterator* iterator,
-    DeoptimizationLiteralArray literal_array, Address fp,
+    int frame_index, DeoptimizationFrameTranslation::Iterator* iterator,
+    Tagged<DeoptimizationLiteralArray> literal_array, Address fp,
     RegisterValues* registers, FILE* trace_file) {
   disasm::NameConverter converter;
 
@@ -1097,11 +1180,13 @@ int TranslatedState::CreateNextTranslatedValue(
     case TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN:
     case TranslationOpcode::INTERPRETED_FRAME_WITHOUT_RETURN:
     case TranslationOpcode::INLINED_EXTRA_ARGUMENTS:
-    case TranslationOpcode::CONSTRUCT_STUB_FRAME:
+    case TranslationOpcode::CONSTRUCT_CREATE_STUB_FRAME:
+    case TranslationOpcode::CONSTRUCT_INVOKE_STUB_FRAME:
     case TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_FRAME:
     case TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH_FRAME:
     case TranslationOpcode::BUILTIN_CONTINUATION_FRAME:
 #if V8_ENABLE_WEBASSEMBLY
+    case TranslationOpcode::WASM_INLINED_INTO_JS_FRAME:
     case TranslationOpcode::JS_TO_WASM_BUILTIN_CONTINUATION_FRAME:
 #endif  // V8_ENABLE_WEBASSEMBLY
     case TranslationOpcode::UPDATE_FEEDBACK:
@@ -1164,7 +1249,7 @@ int TranslatedState::CreateNextTranslatedValue(
       if (trace_file != nullptr) {
         PrintF(trace_file, V8PRIxPTR_FMT " ; %s ", uncompressed_value,
                converter.NameOfCPURegister(input_reg));
-        Object(uncompressed_value).ShortPrint(trace_file);
+        ShortPrint(Object(uncompressed_value), trace_file);
       }
       TranslatedValue translated_value =
           TranslatedValue::NewTagged(this, Object(uncompressed_value));
@@ -1315,7 +1400,30 @@ int TranslatedState::CreateNextTranslatedValue(
       return translated_value.GetChildrenCount();
     }
 
-    case TranslationOpcode::STACK_SLOT: {
+    case TranslationOpcode::HOLEY_DOUBLE_REGISTER: {
+      int input_reg = iterator->NextOperandUnsigned();
+      if (registers == nullptr) {
+        TranslatedValue translated_value = TranslatedValue::NewInvalid(this);
+        frame.Add(translated_value);
+        return translated_value.GetChildrenCount();
+      }
+      Float64 value = registers->GetDoubleRegister(input_reg);
+      if (trace_file != nullptr) {
+        if (value.is_hole_nan()) {
+          PrintF(trace_file, "the hole");
+        } else {
+          PrintF(trace_file, "%e", value.get_scalar());
+        }
+        PrintF(trace_file, " ; %s (holey double)",
+               RegisterName(DoubleRegister::from_code(input_reg)));
+      }
+      TranslatedValue translated_value =
+          TranslatedValue::NewHoleyDouble(this, value);
+      frame.Add(translated_value);
+      return translated_value.GetChildrenCount();
+    }
+
+    case TranslationOpcode::TAGGED_STACK_SLOT: {
       int slot_offset =
           OptimizedFrame::StackSlotOffsetRelativeToFp(iterator->NextOperand());
       intptr_t value = *(reinterpret_cast<intptr_t*>(fp + slot_offset));
@@ -1324,7 +1432,7 @@ int TranslatedState::CreateNextTranslatedValue(
         PrintF(trace_file, V8PRIxPTR_FMT " ;  [fp %c %3d]  ",
                uncompressed_value, slot_offset < 0 ? '-' : '+',
                std::abs(slot_offset));
-        Object(uncompressed_value).ShortPrint(trace_file);
+        ShortPrint(Object(uncompressed_value), trace_file);
       }
       TranslatedValue translated_value =
           TranslatedValue::NewTagged(this, Object(uncompressed_value));
@@ -1444,13 +1552,32 @@ int TranslatedState::CreateNextTranslatedValue(
       return translated_value.GetChildrenCount();
     }
 
+    case TranslationOpcode::HOLEY_DOUBLE_STACK_SLOT: {
+      int slot_offset =
+          OptimizedFrame::StackSlotOffsetRelativeToFp(iterator->NextOperand());
+      Float64 value = GetDoubleSlot(fp, slot_offset);
+      if (trace_file != nullptr) {
+        if (value.is_hole_nan()) {
+          PrintF(trace_file, "the hole");
+        } else {
+          PrintF(trace_file, "%e", value.get_scalar());
+        }
+        PrintF(trace_file, " ; (holey double) [fp %c %d] ",
+               slot_offset < 0 ? '-' : '+', std::abs(slot_offset));
+      }
+      TranslatedValue translated_value =
+          TranslatedValue::NewHoleyDouble(this, value);
+      frame.Add(translated_value);
+      return translated_value.GetChildrenCount();
+    }
+
     case TranslationOpcode::LITERAL: {
       int literal_index = iterator->NextOperand();
-      Object value = literal_array.get(literal_index);
+      Object value = literal_array->get(literal_index);
       if (trace_file != nullptr) {
         PrintF(trace_file, V8PRIxPTR_FMT " ; (literal %2d) ", value.ptr(),
                literal_index);
-        value.ShortPrint(trace_file);
+        ShortPrint(value, trace_file);
       }
 
       TranslatedValue translated_value =
@@ -1490,21 +1617,21 @@ TranslatedState::TranslatedState(const JavaScriptFrame* frame)
       static_cast<const OptimizedFrame*>(frame)->GetDeoptimizationData(
           &deopt_index);
   DCHECK(!data.is_null() && deopt_index != SafepointEntry::kNoDeoptIndex);
-  TranslationArrayIterator it(data.TranslationByteArray(),
-                              data.TranslationIndex(deopt_index).value());
+  DeoptimizationFrameTranslation::Iterator it(
+      data->FrameTranslation(), data->TranslationIndex(deopt_index).value());
   int actual_argc = frame->GetActualArgumentCount();
-  Init(frame->isolate(), frame->fp(), frame->fp(), &it, data.LiteralArray(),
+  Init(frame->isolate(), frame->fp(), frame->fp(), &it, data->LiteralArray(),
        nullptr /* registers */, nullptr /* trace file */,
        frame->function()
-           .shared()
-           .internal_formal_parameter_count_without_receiver(),
+           ->shared()
+           ->internal_formal_parameter_count_without_receiver(),
        actual_argc);
 }
 
 void TranslatedState::Init(Isolate* isolate, Address input_frame_pointer,
                            Address stack_frame_pointer,
-                           TranslationArrayIterator* iterator,
-                           DeoptimizationLiteralArray literal_array,
+                           DeoptimizationFrameTranslation::Iterator* iterator,
+                           Tagged<DeoptimizationLiteralArray> literal_array,
                            RegisterValues* registers, FILE* trace_file,
                            int formal_parameter_count,
                            int actual_argument_count) {
@@ -1655,7 +1782,7 @@ void TranslatedState::InitializeCapturedObjectAt(
   // an existing object here.
   CHECK_EQ(frame->values_[value_index].kind(), TranslatedValue::kTagged);
   Handle<Map> map = Handle<Map>::cast(frame->values_[value_index].GetValue());
-  CHECK(map->IsMap());
+  CHECK(IsMap(*map));
   value_index++;
 
   // Handle the special cases.
@@ -1690,7 +1817,7 @@ void TranslatedState::InitializeCapturedObjectAt(
       break;
 
     default:
-      CHECK(map->IsJSObjectMap());
+      CHECK(IsJSObjectMap(*map));
       InitializeJSObjectAt(frame, &value_index, slot, map, no_gc);
       break;
   }
@@ -1715,7 +1842,7 @@ void TranslatedState::EnsureObjectAllocatedAt(TranslatedValue* slot) {
 
 int TranslatedValue::GetSmiValue() const {
   Object value = GetRawValue();
-  CHECK(value.IsSmi());
+  CHECK(IsSmi(value));
   return Smi::cast(value).value();
 }
 
@@ -1732,8 +1859,8 @@ void TranslatedState::MaterializeFixedDoubleArray(TranslatedFrame* frame,
     CHECK_NE(TranslatedValue::kCapturedObject,
              frame->values_[*value_index].kind());
     Handle<Object> value = frame->values_[*value_index].GetValue();
-    if (value->IsNumber()) {
-      array->set(i, value->Number());
+    if (IsNumber(*value)) {
+      array->set(i, Object::Number(*value));
     } else {
       CHECK(value.is_identical_to(isolate()->factory()->the_hole_value()));
       array->set_the_hole(isolate(), i);
@@ -1749,18 +1876,16 @@ void TranslatedState::MaterializeHeapNumber(TranslatedFrame* frame,
   CHECK_NE(TranslatedValue::kCapturedObject,
            frame->values_[*value_index].kind());
   Handle<Object> value = frame->values_[*value_index].GetValue();
-  CHECK(value->IsNumber());
-  Handle<HeapNumber> box = isolate()->factory()->NewHeapNumber(value->Number());
+  CHECK(IsNumber(*value));
+  Handle<HeapNumber> box =
+      isolate()->factory()->NewHeapNumber(Object::Number(*value));
   (*value_index)++;
   slot->set_storage(box);
 }
 
 namespace {
 
-enum StorageKind : uint8_t {
-  kStoreTagged,
-  kStoreHeapObject
-};
+enum StorageKind : uint8_t { kStoreTagged, kStoreHeapObject };
 
 }  // namespace
 
@@ -1795,7 +1920,7 @@ void TranslatedState::EnsureCapturedObjectAllocatedAt(
   // an existing object here.
   CHECK_EQ(frame->values_[value_index].kind(), TranslatedValue::kTagged);
   Handle<Map> map = Handle<Map>::cast(frame->values_[value_index].GetValue());
-  CHECK(map->IsMap());
+  CHECK(IsMap(*map));
   value_index++;
 
   // Handle the special cases.
@@ -1835,7 +1960,7 @@ void TranslatedState::EnsureCapturedObjectAllocatedAt(
       CHECK_EQ(instance_size, slot->GetChildrenCount() * kTaggedSize);
 
       // Canonicalize empty fixed array.
-      if (*map == ReadOnlyRoots(isolate()).empty_fixed_array().map() &&
+      if (*map == ReadOnlyRoots(isolate()).empty_fixed_array()->map() &&
           array_length == 0) {
         slot->set_storage(isolate()->factory()->empty_fixed_array());
       } else {
@@ -1893,7 +2018,7 @@ void TranslatedState::EnsureCapturedObjectAllocatedAt(
       TranslatedValue* elements_slot = frame->ValueAt(value_index);
       value_index++, remaining_children_count--;
       if (elements_slot->kind() == TranslatedValue::kCapturedObject ||
-          !map->IsJSArrayMap()) {
+          !IsJSArrayMap(*map)) {
         // Handle this case with the other remaining children below.
         value_index--, remaining_children_count++;
       } else {
@@ -1921,8 +2046,8 @@ void TranslatedValue::ReplaceElementsArrayWithCopy() {
   DCHECK_EQ(kind(), TranslatedValue::kTagged);
   DCHECK_EQ(materialization_state(), TranslatedValue::kFinished);
   auto elements = Handle<FixedArrayBase>::cast(GetValue());
-  DCHECK(elements->IsFixedArray() || elements->IsFixedDoubleArray());
-  if (elements->IsFixedDoubleArray()) {
+  DCHECK(IsFixedArray(*elements) || IsFixedDoubleArray(*elements));
+  if (IsFixedDoubleArray(*elements)) {
     DCHECK(!elements->IsCowArray());
     set_storage(isolate()->factory()->CopyFixedDoubleArray(
         Handle<FixedDoubleArray>::cast(elements)));
@@ -1967,19 +2092,19 @@ void TranslatedState::EnsurePropertiesAllocatedAndMarked(
   properties_slot->set_storage(object_storage);
 
   DisallowGarbageCollection no_gc;
-  auto raw_map = *map;
-  auto raw_object_storage = *object_storage;
+  Tagged<Map> raw_map = *map;
+  Tagged<ByteArray> raw_object_storage = *object_storage;
 
   // Set markers for out-of-object properties.
   DescriptorArray descriptors = map->instance_descriptors(isolate());
   for (InternalIndex i : map->IterateOwnDescriptors()) {
     FieldIndex index = FieldIndex::ForDescriptor(raw_map, i);
-    Representation representation = descriptors.GetDetails(i).representation();
+    Representation representation = descriptors->GetDetails(i).representation();
     if (!index.is_inobject() &&
         (representation.IsDouble() || representation.IsHeapObject())) {
       int outobject_index = index.outobject_array_index();
       int array_index = outobject_index * kTaggedSize;
-      raw_object_storage.set(array_index, kStoreHeapObject);
+      raw_object_storage->set(array_index, kStoreHeapObject);
     }
   }
 }
@@ -1992,35 +2117,35 @@ Handle<ByteArray> TranslatedState::AllocateStorageFor(TranslatedValue* slot) {
   Handle<ByteArray> object_storage =
       isolate()->factory()->NewByteArray(allocate_size, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  auto raw_object_storage = *object_storage;
+  Tagged<ByteArray> raw_object_storage = *object_storage;
   for (int i = 0; i < object_storage->length(); i++) {
-    raw_object_storage.set(i, kStoreTagged);
+    raw_object_storage->set(i, kStoreTagged);
   }
   return object_storage;
 }
 
 void TranslatedState::EnsureJSObjectAllocated(TranslatedValue* slot,
                                               Handle<Map> map) {
-  CHECK(map->IsJSObjectMap());
+  CHECK(IsJSObjectMap(*map));
   CHECK_EQ(map->instance_size(), slot->GetChildrenCount() * kTaggedSize);
 
   Handle<ByteArray> object_storage = AllocateStorageFor(slot);
 
   // Now we handle the interesting (JSObject) case.
   DisallowGarbageCollection no_gc;
-  auto raw_map = *map;
-  auto raw_object_storage = *object_storage;
+  Tagged<Map> raw_map = *map;
+  Tagged<ByteArray> raw_object_storage = *object_storage;
   DescriptorArray descriptors = map->instance_descriptors(isolate());
 
   // Set markers for in-object properties.
-  for (InternalIndex i : raw_map.IterateOwnDescriptors()) {
+  for (InternalIndex i : raw_map->IterateOwnDescriptors()) {
     FieldIndex index = FieldIndex::ForDescriptor(raw_map, i);
-    Representation representation = descriptors.GetDetails(i).representation();
+    Representation representation = descriptors->GetDetails(i).representation();
     if (index.is_inobject() &&
         (representation.IsDouble() || representation.IsHeapObject())) {
       CHECK_GE(index.index(), FixedArray::kHeaderSize / kTaggedSize);
       int array_index = index.index() * kTaggedSize - FixedArray::kHeaderSize;
-      raw_object_storage.set(array_index, kStoreHeapObject);
+      raw_object_storage->set(array_index, kStoreHeapObject);
     }
   }
   slot->set_storage(object_storage);
@@ -2073,6 +2198,10 @@ void TranslatedState::InitializeJSObjectAt(
   isolate()->heap()->NotifyObjectLayoutChange(*object_storage, no_gc,
                                               InvalidateRecordedSlots::kNo);
 
+  // Finish any sweeping so that it becomes safe to overwrite the ByteArray
+  // headers. See chromium:1228036.
+  isolate()->heap()->EnsureSweepingCompletedForObject(*object_storage);
+
   // Fill the property array field.
   {
     Handle<Object> properties = GetValueAndAdvance(frame, value_index);
@@ -2092,15 +2221,31 @@ void TranslatedState::InitializeJSObjectAt(
     // should be fully initialized by now).
     int offset = i * kTaggedSize;
     uint8_t marker = object_storage->ReadField<uint8_t>(offset);
+#ifdef V8_CODE_POINTER_SANDBOXING
+    static_assert(kAllIndirectPointerObjectsAreCode);
+    if (InstanceTypeChecker::IsJSFunction(map->instance_type()) &&
+        offset == JSFunction::kCodeOffset) {
+      // We're materializing a JSFunction's reference to a Code object. This is
+      // an indirect pointer, so need special handling. TODO(saelo) generalize
+      // this, for example by introducing a new kStoreIndirectPointer marker
+      // value.
+      Handle<HeapObject> field_value = slot->storage();
+      CHECK(IsCode(*field_value));
+      Code value = Code::cast(*field_value);
+      object_storage->RawIndirectPointerField(offset).Relaxed_Store(value);
+      INDIRECT_POINTER_WRITE_BARRIER(*object_storage, offset, value);
+    } else if (marker == kStoreHeapObject) {
+#else
     if (marker == kStoreHeapObject) {
+#endif  // V8_CODE_POINTER_SANDBOXING
       Handle<HeapObject> field_value = slot->storage();
       WRITE_FIELD(*object_storage, offset, *field_value);
       WRITE_BARRIER(*object_storage, offset, *field_value);
     } else {
       CHECK_EQ(kStoreTagged, marker);
       Handle<Object> field_value = slot->GetValue();
-      DCHECK_IMPLIES(field_value->IsHeapNumber(),
-                     !IsSmiDouble(field_value->Number()));
+      DCHECK_IMPLIES(IsHeapNumber(*field_value),
+                     !IsSmiDouble(Object::Number(*field_value)));
       WRITE_FIELD(*object_storage, offset, *field_value);
       WRITE_BARRIER(*object_storage, offset, *field_value);
     }
@@ -2135,6 +2280,10 @@ void TranslatedState::InitializeObjectWithTaggedFieldsAt(
   isolate()->heap()->NotifyObjectLayoutChange(*object_storage, no_gc,
                                               InvalidateRecordedSlots::kNo);
 
+  // Finish any sweeping so that it becomes safe to overwrite the ByteArray
+  // headers. See chromium:1228036.
+  isolate()->heap()->EnsureSweepingCompletedForObject(*object_storage);
+
   // Write the fields to the object.
   for (int i = 1; i < children_count; i++) {
     slot = GetResolvedSlotAndAdvance(frame, value_index);
@@ -2146,8 +2295,8 @@ void TranslatedState::InitializeObjectWithTaggedFieldsAt(
     } else {
       CHECK(marker == kStoreTagged || i == 1);
       field_value = slot->GetValue();
-      DCHECK_IMPLIES(field_value->IsHeapNumber(),
-                     !IsSmiDouble(field_value->Number()));
+      DCHECK_IMPLIES(IsHeapNumber(*field_value),
+                     !IsSmiDouble(Object::Number(*field_value)));
     }
     WRITE_FIELD(*object_storage, offset, *field_value);
     WRITE_BARRIER(*object_storage, offset, *field_value);
@@ -2268,15 +2417,15 @@ void TranslatedState::StoreMaterializedValuesAndDeopt(JavaScriptFrame* frame) {
       DCHECK_EQ(*previous_value, *marker);
     } else {
       if (*previous_value == *marker) {
-        if (value->IsSmi()) {
-          value = isolate()->factory()->NewHeapNumber(value->Number());
+        if (IsSmi(*value)) {
+          value = isolate()->factory()->NewHeapNumber(Object::Number(*value));
         }
         previously_materialized_objects->set(i, *value);
         value_changed = true;
       } else {
         CHECK(*previous_value == *value ||
-              (previous_value->IsHeapNumber() && value->IsSmi() &&
-               previous_value->Number() == value->Number()));
+              (IsHeapNumber(*previous_value) && IsSmi(*value) &&
+               Object::Number(*previous_value) == Object::Number(*value)));
       }
     }
   }
@@ -2316,7 +2465,7 @@ void TranslatedState::UpdateFromPreviouslyMaterializedObjects() {
       if (value_info->kind() == TranslatedValue::kCapturedObject) {
         Handle<Object> object(previously_materialized_objects->get(i),
                               isolate_);
-        CHECK(object->IsHeapObject());
+        CHECK(IsHeapObject(*object));
         value_info->set_initialized_storage(Handle<HeapObject>::cast(object));
       }
     }
@@ -2332,7 +2481,7 @@ void TranslatedState::VerifyMaterializedObjects() {
     if (slot->kind() == TranslatedValue::kCapturedObject) {
       CHECK_EQ(slot, GetValueByObjectIndex(slot->object_index()));
       if (slot->materialization_state() == TranslatedValue::kFinished) {
-        slot->storage()->ObjectVerify(isolate());
+        Object::ObjectVerify(*slot->storage(), isolate());
       } else {
         CHECK_EQ(slot->materialization_state(),
                  TranslatedValue::kUninitialized);
@@ -2354,11 +2503,11 @@ bool TranslatedState::DoUpdateFeedback() {
 }
 
 void TranslatedState::ReadUpdateFeedback(
-    TranslationArrayIterator* iterator,
-    DeoptimizationLiteralArray literal_array, FILE* trace_file) {
+    DeoptimizationFrameTranslation::Iterator* iterator,
+    Tagged<DeoptimizationLiteralArray> literal_array, FILE* trace_file) {
   CHECK_EQ(TranslationOpcode::UPDATE_FEEDBACK, iterator->NextOpcode());
   feedback_vector_ =
-      FeedbackVector::cast(literal_array.get(iterator->NextOperand()));
+      FeedbackVector::cast(literal_array->get(iterator->NextOperand()));
   feedback_slot_ = FeedbackSlot(iterator->NextOperand());
   if (trace_file != nullptr) {
     PrintF(trace_file, "  reading FeedbackVector (slot %d)\n",
diff --git a/deps/v8/src/deoptimizer/translated-state.h b/deps/v8/src/deoptimizer/translated-state.h
index 38230029df70ba..34ed35845353ca 100644
--- a/deps/v8/src/deoptimizer/translated-state.h
+++ b/deps/v8/src/deoptimizer/translated-state.h
@@ -8,7 +8,8 @@
 #include <stack>
 #include <vector>
 
-#include "src/deoptimizer/translation-array.h"
+#include "src/deoptimizer/frame-translation-builder.h"
+#include "src/objects/deoptimization-data.h"
 #include "src/objects/feedback-vector.h"
 #include "src/objects/heap-object.h"
 #include "src/objects/shared-function-info.h"
@@ -27,15 +28,15 @@ class TranslatedState;
 // TODO(jgruber): This duplicates decoding logic already present in
 // TranslatedState/TranslatedFrame. Deduplicate into one class, e.g. by basing
 // printing off TranslatedFrame.
-void TranslationArrayPrintSingleFrame(std::ostream& os,
-                                      TranslationArray translation_array,
-                                      int translation_index,
-                                      DeoptimizationLiteralArray literal_array);
+void DeoptimizationFrameTranslationPrintSingleOpcode(
+    std::ostream& os, TranslationOpcode opcode,
+    DeoptimizationFrameTranslation::Iterator& iterator,
+    Tagged<DeoptimizationLiteralArray> literal_array);
 
 // The Translated{Value,Frame,State} class hierarchy are a set of utility
 // functions to work with the combination of translations (built from a
-// TranslationArray) and the actual current CPU state (represented by
-// RegisterValues).
+// DeoptimizationFrameTranslation) and the actual current CPU state (represented
+// by RegisterValues).
 //
 // TranslatedState: describes the entire stack state of the current optimized
 // frame, contains:
@@ -49,7 +50,7 @@ class TranslatedValue {
   // Allocation-free getter of the value.
   // Returns ReadOnlyRoots::arguments_marker() if allocation would be necessary
   // to get the value. In the case of numbers, returns a Smi if possible.
-  Object GetRawValue() const;
+  Tagged<Object> GetRawValue() const;
 
   // Convenience wrapper around GetRawValue (checked).
   int GetSmiValue() const;
@@ -78,6 +79,7 @@ class TranslatedValue {
     kBoolBit,
     kFloat,
     kDouble,
+    kHoleyDouble,
     kCapturedObject,   // Object captured by the escape analysis.
                        // The number of nested objects can be obtained
                        // with the DeferredObjectLength() method
@@ -108,6 +110,8 @@ class TranslatedValue {
   static TranslatedValue NewDuplicateObject(TranslatedState* container, int id);
   static TranslatedValue NewFloat(TranslatedState* container, Float32 value);
   static TranslatedValue NewDouble(TranslatedState* container, Float64 value);
+  static TranslatedValue NewHoleyDouble(TranslatedState* container,
+                                        Float64 value);
   static TranslatedValue NewInt32(TranslatedState* container, int32_t value);
   static TranslatedValue NewInt64(TranslatedState* container, int64_t value);
   static TranslatedValue NewInt64ToBigInt(TranslatedState* container,
@@ -116,7 +120,8 @@ class TranslatedValue {
                                            uint64_t value);
   static TranslatedValue NewUInt32(TranslatedState* container, uint32_t value);
   static TranslatedValue NewBool(TranslatedState* container, uint32_t value);
-  static TranslatedValue NewTagged(TranslatedState* container, Object literal);
+  static TranslatedValue NewTagged(TranslatedState* container,
+                                   Tagged<Object> literal);
   static TranslatedValue NewInvalid(TranslatedState* container);
 
   Isolate* isolate() const;
@@ -150,7 +155,7 @@ class TranslatedValue {
 
   union {
     // kind kTagged. After handlification it is always nullptr.
-    Object raw_literal_;
+    Tagged<Object> raw_literal_;
     // kind is kUInt32 or kBoolBit.
     uint32_t uint32_value_;
     // kind is kInt32.
@@ -161,14 +166,14 @@ class TranslatedValue {
     int64_t int64_value_;
     // kind is kFloat
     Float32 float_value_;
-    // kind is kDouble
+    // kind is kDouble or kHoleyDouble
     Float64 double_value_;
     // kind is kDuplicatedObject or kCapturedObject.
     MaterializedObjectInfo materialization_info_;
   };
 
   // Checked accessors for the union members.
-  Object raw_literal() const;
+  Tagged<Object> raw_literal() const;
   int32_t int32_value() const;
   int64_t int64_value() const;
   uint32_t uint32_value() const;
@@ -184,9 +189,11 @@ class TranslatedFrame {
   enum Kind {
     kUnoptimizedFunction,
     kInlinedExtraArguments,
-    kConstructStub,
+    kConstructCreateStub,
+    kConstructInvokeStub,
     kBuiltinContinuation,
 #if V8_ENABLE_WEBASSEMBLY
+    kWasmInlinedIntoJS,
     kJSToWasmBuiltinContinuation,
 #endif  // V8_ENABLE_WEBASSEMBLY
     kJavaScriptBuiltinContinuation,
@@ -210,7 +217,7 @@ class TranslatedFrame {
   int return_value_offset() const { return return_value_offset_; }
   int return_value_count() const { return return_value_count_; }
 
-  SharedFunctionInfo raw_shared_info() const {
+  Tagged<SharedFunctionInfo> raw_shared_info() const {
     CHECK(!raw_shared_info_.is_null());
     return raw_shared_info_;
   }
@@ -276,28 +283,34 @@ class TranslatedFrame {
   friend class Deoptimizer;
 
   // Constructor static methods.
-  static TranslatedFrame UnoptimizedFrame(BytecodeOffset bytecode_offset,
-                                          SharedFunctionInfo shared_info,
-                                          int height, int return_value_offset,
-                                          int return_value_count);
+  static TranslatedFrame UnoptimizedFrame(
+      BytecodeOffset bytecode_offset, Tagged<SharedFunctionInfo> shared_info,
+      int height, int return_value_offset, int return_value_count);
   static TranslatedFrame AccessorFrame(Kind kind,
-                                       SharedFunctionInfo shared_info);
-  static TranslatedFrame InlinedExtraArguments(SharedFunctionInfo shared_info,
-                                               int height);
-  static TranslatedFrame ConstructStubFrame(BytecodeOffset bailout_id,
-                                            SharedFunctionInfo shared_info,
-                                            int height);
+                                       Tagged<SharedFunctionInfo> shared_info);
+  static TranslatedFrame InlinedExtraArguments(
+      Tagged<SharedFunctionInfo> shared_info, int height);
+  static TranslatedFrame ConstructCreateStubFrame(
+      Tagged<SharedFunctionInfo> shared_info, int height);
+  static TranslatedFrame ConstructInvokeStubFrame(
+      Tagged<SharedFunctionInfo> shared_info);
   static TranslatedFrame BuiltinContinuationFrame(
-      BytecodeOffset bailout_id, SharedFunctionInfo shared_info, int height);
+      BytecodeOffset bailout_id, Tagged<SharedFunctionInfo> shared_info,
+      int height);
 #if V8_ENABLE_WEBASSEMBLY
+  static TranslatedFrame WasmInlinedIntoJSFrame(
+      BytecodeOffset bailout_id, Tagged<SharedFunctionInfo> shared_info,
+      int height);
   static TranslatedFrame JSToWasmBuiltinContinuationFrame(
-      BytecodeOffset bailout_id, SharedFunctionInfo shared_info, int height,
-      base::Optional<wasm::ValueKind> return_type);
+      BytecodeOffset bailout_id, Tagged<SharedFunctionInfo> shared_info,
+      int height, base::Optional<wasm::ValueKind> return_type);
 #endif  // V8_ENABLE_WEBASSEMBLY
   static TranslatedFrame JavaScriptBuiltinContinuationFrame(
-      BytecodeOffset bailout_id, SharedFunctionInfo shared_info, int height);
+      BytecodeOffset bailout_id, Tagged<SharedFunctionInfo> shared_info,
+      int height);
   static TranslatedFrame JavaScriptBuiltinContinuationWithCatchFrame(
-      BytecodeOffset bailout_id, SharedFunctionInfo shared_info, int height);
+      BytecodeOffset bailout_id, Tagged<SharedFunctionInfo> shared_info,
+      int height);
   static TranslatedFrame InvalidFrame() {
     return TranslatedFrame(kInvalid, SharedFunctionInfo());
   }
@@ -305,7 +318,7 @@ class TranslatedFrame {
   static void AdvanceIterator(std::deque<TranslatedValue>::iterator* iter);
 
   TranslatedFrame(Kind kind,
-                  SharedFunctionInfo shared_info = SharedFunctionInfo(),
+                  Tagged<SharedFunctionInfo> shared_info = SharedFunctionInfo(),
                   int height = 0, int return_value_offset = 0,
                   int return_value_count = 0)
       : kind_(kind),
@@ -387,9 +400,11 @@ class TranslatedState {
   Isolate* isolate() { return isolate_; }
 
   void Init(Isolate* isolate, Address input_frame_pointer,
-            Address stack_frame_pointer, TranslationArrayIterator* iterator,
-            DeoptimizationLiteralArray literal_array, RegisterValues* registers,
-            FILE* trace_file, int parameter_count, int actual_argument_count);
+            Address stack_frame_pointer,
+            DeoptimizationFrameTranslation::Iterator* iterator,
+            Tagged<DeoptimizationLiteralArray> literal_array,
+            RegisterValues* registers, FILE* trace_file, int parameter_count,
+            int actual_argument_count);
 
   void VerifyMaterializedObjects();
   bool DoUpdateFeedback();
@@ -404,13 +419,13 @@ class TranslatedState {
   enum Purpose { kDeoptimization, kFrameInspection };
 
   TranslatedFrame CreateNextTranslatedFrame(
-      TranslationArrayIterator* iterator,
-      DeoptimizationLiteralArray literal_array, Address fp, FILE* trace_file);
-  int CreateNextTranslatedValue(int frame_index,
-                                TranslationArrayIterator* iterator,
-                                DeoptimizationLiteralArray literal_array,
-                                Address fp, RegisterValues* registers,
-                                FILE* trace_file);
+      DeoptimizationFrameTranslation::Iterator* iterator,
+      Tagged<DeoptimizationLiteralArray> literal_array, Address fp,
+      FILE* trace_file);
+  int CreateNextTranslatedValue(
+      int frame_index, DeoptimizationFrameTranslation::Iterator* iterator,
+      Tagged<DeoptimizationLiteralArray> literal_array, Address fp,
+      RegisterValues* registers, FILE* trace_file);
   Address DecompressIfNeeded(intptr_t value);
   void CreateArgumentsElementsTranslatedValues(int frame_index,
                                                Address input_frame_pointer,
@@ -445,8 +460,8 @@ class TranslatedState {
       TranslatedFrame* frame, int* value_index, TranslatedValue* slot,
       Handle<Map> map, const DisallowGarbageCollection& no_gc);
 
-  void ReadUpdateFeedback(TranslationArrayIterator* iterator,
-                          DeoptimizationLiteralArray literal_array,
+  void ReadUpdateFeedback(DeoptimizationFrameTranslation::Iterator* iterator,
+                          Tagged<DeoptimizationLiteralArray> literal_array,
                           FILE* trace_file);
 
   TranslatedValue* ResolveCapturedObject(TranslatedValue* slot);
diff --git a/deps/v8/src/deoptimizer/translation-opcode.h b/deps/v8/src/deoptimizer/translation-opcode.h
index 31e8e542038863..5c5996ab71e711 100644
--- a/deps/v8/src/deoptimizer/translation-opcode.h
+++ b/deps/v8/src/deoptimizer/translation-opcode.h
@@ -11,42 +11,52 @@ namespace v8 {
 namespace internal {
 
 // V(name, operand_count)
-#define TRANSLATION_OPCODE_LIST(V)                        \
-  V(ARGUMENTS_ELEMENTS, 1)                                \
-  V(ARGUMENTS_LENGTH, 0)                                  \
-  V(BEGIN_WITHOUT_FEEDBACK, 3)                            \
-  V(BEGIN_WITH_FEEDBACK, 3)                               \
-  V(BOOL_REGISTER, 1)                                     \
-  V(BOOL_STACK_SLOT, 1)                                   \
-  V(BUILTIN_CONTINUATION_FRAME, 3)                        \
-  V(CAPTURED_OBJECT, 1)                                   \
-  V(CONSTRUCT_STUB_FRAME, 3)                              \
-  V(DOUBLE_REGISTER, 1)                                   \
-  V(DOUBLE_STACK_SLOT, 1)                                 \
-  V(DUPLICATED_OBJECT, 1)                                 \
-  V(FLOAT_REGISTER, 1)                                    \
-  V(FLOAT_STACK_SLOT, 1)                                  \
-  V(INLINED_EXTRA_ARGUMENTS, 2)                           \
-  V(INT32_REGISTER, 1)                                    \
-  V(INT32_STACK_SLOT, 1)                                  \
-  V(INT64_REGISTER, 1)                                    \
-  V(INT64_STACK_SLOT, 1)                                  \
-  V(SIGNED_BIGINT64_REGISTER, 1)                          \
-  V(SIGNED_BIGINT64_STACK_SLOT, 1)                        \
-  V(UNSIGNED_BIGINT64_REGISTER, 1)                        \
-  V(UNSIGNED_BIGINT64_STACK_SLOT, 1)                      \
-  V(INTERPRETED_FRAME_WITH_RETURN, 5)                     \
-  V(INTERPRETED_FRAME_WITHOUT_RETURN, 3)                  \
-  V(JAVA_SCRIPT_BUILTIN_CONTINUATION_FRAME, 3)            \
-  V(JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH_FRAME, 3) \
-  IF_WASM(V, JS_TO_WASM_BUILTIN_CONTINUATION_FRAME, 4)    \
-  V(OPTIMIZED_OUT, 0)                                     \
-  V(LITERAL, 1)                                           \
-  V(REGISTER, 1)                                          \
-  V(STACK_SLOT, 1)                                        \
-  V(UINT32_REGISTER, 1)                                   \
-  V(UINT32_STACK_SLOT, 1)                                 \
-  V(UPDATE_FEEDBACK, 2)                                   \
+#define TRANSLATION_JS_FRAME_OPCODE_LIST(V)    \
+  V(INTERPRETED_FRAME_WITH_RETURN, 5)          \
+  V(INTERPRETED_FRAME_WITHOUT_RETURN, 3)       \
+  V(JAVA_SCRIPT_BUILTIN_CONTINUATION_FRAME, 3) \
+  V(JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH_FRAME, 3)
+
+#define TRANSLATION_FRAME_OPCODE_LIST(V)               \
+  V(CONSTRUCT_CREATE_STUB_FRAME, 2)                    \
+  V(CONSTRUCT_INVOKE_STUB_FRAME, 1)                    \
+  V(BUILTIN_CONTINUATION_FRAME, 3)                     \
+  IF_WASM(V, JS_TO_WASM_BUILTIN_CONTINUATION_FRAME, 4) \
+  IF_WASM(V, WASM_INLINED_INTO_JS_FRAME, 3)            \
+  V(INLINED_EXTRA_ARGUMENTS, 2)
+
+#define TRANSLATION_OPCODE_LIST(V)    \
+  TRANSLATION_JS_FRAME_OPCODE_LIST(V) \
+  TRANSLATION_FRAME_OPCODE_LIST(V)    \
+  V(ARGUMENTS_ELEMENTS, 1)            \
+  V(ARGUMENTS_LENGTH, 0)              \
+  V(BEGIN_WITHOUT_FEEDBACK, 3)        \
+  V(BEGIN_WITH_FEEDBACK, 3)           \
+  V(BOOL_REGISTER, 1)                 \
+  V(BOOL_STACK_SLOT, 1)               \
+  V(CAPTURED_OBJECT, 1)               \
+  V(DOUBLE_REGISTER, 1)               \
+  V(DOUBLE_STACK_SLOT, 1)             \
+  V(HOLEY_DOUBLE_REGISTER, 1)         \
+  V(HOLEY_DOUBLE_STACK_SLOT, 1)       \
+  V(DUPLICATED_OBJECT, 1)             \
+  V(FLOAT_REGISTER, 1)                \
+  V(FLOAT_STACK_SLOT, 1)              \
+  V(INT32_REGISTER, 1)                \
+  V(INT32_STACK_SLOT, 1)              \
+  V(INT64_REGISTER, 1)                \
+  V(INT64_STACK_SLOT, 1)              \
+  V(SIGNED_BIGINT64_REGISTER, 1)      \
+  V(SIGNED_BIGINT64_STACK_SLOT, 1)    \
+  V(UNSIGNED_BIGINT64_REGISTER, 1)    \
+  V(UNSIGNED_BIGINT64_STACK_SLOT, 1)  \
+  V(OPTIMIZED_OUT, 0)                 \
+  V(LITERAL, 1)                       \
+  V(REGISTER, 1)                      \
+  V(TAGGED_STACK_SLOT, 1)             \
+  V(UINT32_REGISTER, 1)               \
+  V(UINT32_STACK_SLOT, 1)             \
+  V(UPDATE_FEEDBACK, 2)               \
   V(MATCH_PREVIOUS_TRANSLATION, 1)
 
 enum class TranslationOpcode {
@@ -58,6 +68,10 @@ enum class TranslationOpcode {
 #define PLUS_ONE(...) +1
 static constexpr int kNumTranslationOpcodes =
     0 TRANSLATION_OPCODE_LIST(PLUS_ONE);
+static constexpr int kNumTranslationJsFrameOpcodes =
+    0 TRANSLATION_JS_FRAME_OPCODE_LIST(PLUS_ONE);
+static constexpr int kNumTranslationFrameOpcodes =
+    kNumTranslationJsFrameOpcodes TRANSLATION_FRAME_OPCODE_LIST(PLUS_ONE);
 #undef PLUS_ONE
 
 inline int TranslationOpcodeOperandCount(TranslationOpcode o) {
@@ -67,13 +81,6 @@ inline int TranslationOpcodeOperandCount(TranslationOpcode o) {
   return counts[static_cast<int>(o)];
 }
 
-inline const char* TranslationOpcodeToString(TranslationOpcode o) {
-#define CASE(name, ...) #name,
-  static const char* const names[] = {TRANSLATION_OPCODE_LIST(CASE)};
-#undef CASE
-  return names[static_cast<int>(o)];
-}
-
 constexpr int kMaxTranslationOperandCount = 5;
 #define CASE(name, operand_count) \
   static_assert(operand_count <= kMaxTranslationOperandCount);
@@ -85,7 +92,42 @@ inline bool TranslationOpcodeIsBegin(TranslationOpcode o) {
          o == TranslationOpcode::BEGIN_WITHOUT_FEEDBACK;
 }
 
+inline bool IsTranslationFrameOpcode(TranslationOpcode o) {
+  static_assert(
+      0 == static_cast<int>(TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN));
+  static_assert(kNumTranslationJsFrameOpcodes < kNumTranslationFrameOpcodes);
+  return static_cast<int>(o) < kNumTranslationFrameOpcodes;
+}
+
+inline bool IsTranslationJsFrameOpcode(TranslationOpcode o) {
+  static_assert(
+      kNumTranslationJsFrameOpcodes ==
+      static_cast<int>(TranslationOpcode::CONSTRUCT_CREATE_STUB_FRAME));
+  return static_cast<int>(o) < kNumTranslationJsFrameOpcodes;
+}
+
+inline bool IsTranslationInterpreterFrameOpcode(TranslationOpcode o) {
+  return o == TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN ||
+         o == TranslationOpcode::INTERPRETED_FRAME_WITHOUT_RETURN;
+}
+
+inline std::ostream& operator<<(std::ostream& out, TranslationOpcode opcode) {
+  switch (opcode) {
+#define CASE(name, _)           \
+  case TranslationOpcode::name: \
+    out << #name;               \
+    break;
+    TRANSLATION_OPCODE_LIST(CASE)
+#undef CASE
+    default:
+      out << "BROKEN_OPCODE_" << static_cast<uint8_t>(opcode);
+      break;
+  }
+  return out;
+}
+
 #undef TRANSLATION_OPCODE_LIST
+#undef TRANSLATION_FRAME_OPCODE_LIST
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/diagnostics/arm/disasm-arm.cc b/deps/v8/src/diagnostics/arm/disasm-arm.cc
index 01b697b4bb49eb..2e21165e83267c 100644
--- a/deps/v8/src/diagnostics/arm/disasm-arm.cc
+++ b/deps/v8/src/diagnostics/arm/disasm-arm.cc
@@ -10,9 +10,9 @@
 //
 //   NameConverter converter;
 //   Disassembler d(converter);
-//   for (byte* pc = begin; pc < end;) {
+//   for (uint8_t* pc = begin; pc < end;) {
 //     v8::base::EmbeddedVector<char, 256> buffer;
-//     byte* prev_pc = pc;
+//     uint8_t* prev_pc = pc;
 //     pc += d.InstructionDecode(buffer, pc);
 //     printf("%p    %08x      %s\n",
 //            prev_pc, *reinterpret_cast<int32_t*>(prev_pc), buffer);
@@ -60,10 +60,10 @@ class Decoder {
 
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
-  int InstructionDecode(byte* instruction);
+  int InstructionDecode(uint8_t* instruction);
 
-  static bool IsConstantPoolAt(byte* instr_ptr);
-  static int ConstantPoolSizeAt(byte* instr_ptr);
+  static bool IsConstantPoolAt(uint8_t* instr_ptr);
+  static int ConstantPoolSizeAt(uint8_t* instr_ptr);
 
  private:
   // Bottleneck functions to print into the out_buffer.
@@ -525,8 +525,8 @@ int Decoder::FormatOption(Instruction* instr, const char* format) {
       }
       // 'msg: for simulator break instructions
       DCHECK(STRING_STARTS_WITH(format, "msg"));
-      byte* str =
-          reinterpret_cast<byte*>(instr->InstructionBits() & 0x0FFFFFFF);
+      uint8_t* str =
+          reinterpret_cast<uint8_t*>(instr->InstructionBits() & 0x0FFFFFFF);
       out_buffer_pos_ += base::SNPrintF(out_buffer_ + out_buffer_pos_, "%s",
                                         converter_.NameInCode(str));
       return 3;
@@ -634,7 +634,7 @@ int Decoder::FormatOption(Instruction* instr, const char* format) {
       int off = (static_cast<uint32_t>(instr->SImmed24Value()) << 2) + 8u;
       out_buffer_pos_ += base::SNPrintF(
           out_buffer_ + out_buffer_pos_, "%+d -> %s", off,
-          converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + off));
+          converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + off));
       return 6;
     }
     case 'u': {  // 'u: signed or unsigned multiplies
@@ -663,8 +663,9 @@ int Decoder::FormatOption(Instruction* instr, const char* format) {
     case 'A': {
       // Print pc-relative address.
       int offset = instr->Offset12Value();
-      byte* pc = reinterpret_cast<byte*>(instr) + Instruction::kPcLoadDelta;
-      byte* addr;
+      uint8_t* pc =
+          reinterpret_cast<uint8_t*>(instr) + Instruction::kPcLoadDelta;
+      uint8_t* addr;
       switch (instr->PUField()) {
         case db_x: {
           addr = pc - offset;
@@ -1762,7 +1763,7 @@ void Decoder::DecodeVCVTBetweenFloatingPointAndInteger(Instruction* instr) {
 }
 
 void Decoder::DecodeVmovImmediate(Instruction* instr) {
-  byte cmode = instr->Bits(11, 8);
+  uint8_t cmode = instr->Bits(11, 8);
   int vd = instr->VFPDRegValue(kSimd128Precision);
   int a = instr->Bit(24);
   int bcd = instr->Bits(18, 16);
@@ -2514,12 +2515,12 @@ void Decoder::DecodeAdvancedSIMDElementOrStructureLoadStore(
 
 #undef VERIFY
 
-bool Decoder::IsConstantPoolAt(byte* instr_ptr) {
+bool Decoder::IsConstantPoolAt(uint8_t* instr_ptr) {
   int instruction_bits = *(reinterpret_cast<int*>(instr_ptr));
   return (instruction_bits & kConstantPoolMarkerMask) == kConstantPoolMarker;
 }
 
-int Decoder::ConstantPoolSizeAt(byte* instr_ptr) {
+int Decoder::ConstantPoolSizeAt(uint8_t* instr_ptr) {
   if (IsConstantPoolAt(instr_ptr)) {
     int instruction_bits = *(reinterpret_cast<int*>(instr_ptr));
     return DecodeConstantPoolLength(instruction_bits);
@@ -2529,7 +2530,7 @@ int Decoder::ConstantPoolSizeAt(byte* instr_ptr) {
 }
 
 // Disassemble the instruction at *instr_ptr into the output buffer.
-int Decoder::InstructionDecode(byte* instr_ptr) {
+int Decoder::InstructionDecode(uint8_t* instr_ptr) {
   Instruction* instr = Instruction::At(reinterpret_cast<Address>(instr_ptr));
   // Print raw instruction bytes.
   out_buffer_pos_ += base::SNPrintF(out_buffer_ + out_buffer_pos_,
@@ -2589,12 +2590,12 @@ int Decoder::InstructionDecode(byte* instr_ptr) {
 
 namespace disasm {
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -2610,7 +2611,7 @@ const char* NameConverter::NameOfXMMRegister(int reg) const {
   UNREACHABLE();  // ARM does not have any XMM registers
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // The default name converter is called for unknown code. So we will not try
   // to access any memory.
   return "";
@@ -2619,23 +2620,23 @@ const char* NameConverter::NameInCode(byte* addr) const {
 //------------------------------------------------------------------------------
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instruction) {
+                                    uint8_t* instruction) {
   v8::internal::Decoder d(converter_, buffer);
   return d.InstructionDecode(instruction);
 }
 
-int Disassembler::ConstantPoolSizeAt(byte* instruction) {
+int Disassembler::ConstantPoolSizeAt(uint8_t* instruction) {
   return v8::internal::Decoder::ConstantPoolSizeAt(instruction);
 }
 
-void Disassembler::Disassemble(FILE* f, byte* begin, byte* end,
+void Disassembler::Disassemble(FILE* f, uint8_t* begin, uint8_t* end,
                                UnimplementedOpcodeAction unimplemented_action) {
   NameConverter converter;
   Disassembler d(converter, unimplemented_action);
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     v8::base::EmbeddedVector<char, 128> buffer;
     buffer[0] = '\0';
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     pc += d.InstructionDecode(buffer, pc);
     v8::internal::PrintF(f, "%p    %08x      %s\n", static_cast<void*>(prev_pc),
                          *reinterpret_cast<int32_t*>(prev_pc), buffer.begin());
diff --git a/deps/v8/src/diagnostics/arm64/disasm-arm64.cc b/deps/v8/src/diagnostics/arm64/disasm-arm64.cc
index 94471fa2c7707b..7cadde65a4a897 100644
--- a/deps/v8/src/diagnostics/arm64/disasm-arm64.cc
+++ b/deps/v8/src/diagnostics/arm64/disasm-arm64.cc
@@ -4463,12 +4463,12 @@ void PrintDisassembler::ProcessOutput(Instruction* instr) {
 
 namespace disasm {
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -4492,7 +4492,7 @@ const char* NameConverter::NameOfXMMRegister(int reg) const {
   UNREACHABLE();  // ARM64 does not have any XMM registers
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // The default name converter is called for unknown code, so we will not try
   // to access any memory.
   return "";
@@ -4517,7 +4517,7 @@ class BufferDisassembler : public v8::internal::DisassemblingDecoder {
 };
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instr) {
+                                    uint8_t* instr) {
   USE(converter_);  // avoid unused field warning
   v8::internal::Decoder<v8::internal::DispatchingDecoderVisitor> decoder;
   BufferDisassembler disasm(buffer);
@@ -4527,18 +4527,18 @@ int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
   return v8::internal::kInstrSize;
 }
 
-int Disassembler::ConstantPoolSizeAt(byte* instr) {
+int Disassembler::ConstantPoolSizeAt(uint8_t* instr) {
   return v8::internal::Assembler::ConstantPoolSizeAt(
       reinterpret_cast<v8::internal::Instruction*>(instr));
 }
 
-void Disassembler::Disassemble(FILE* file, byte* start, byte* end,
+void Disassembler::Disassemble(FILE* file, uint8_t* start, uint8_t* end,
                                UnimplementedOpcodeAction) {
   v8::internal::Decoder<v8::internal::DispatchingDecoderVisitor> decoder;
   v8::internal::PrintDisassembler disasm(file);
   decoder.AppendVisitor(&disasm);
 
-  for (byte* pc = start; pc < end; pc += v8::internal::kInstrSize) {
+  for (uint8_t* pc = start; pc < end; pc += v8::internal::kInstrSize) {
     decoder.Decode(reinterpret_cast<v8::internal::Instruction*>(pc));
   }
 }
diff --git a/deps/v8/src/diagnostics/basic-block-profiler.cc b/deps/v8/src/diagnostics/basic-block-profiler.cc
index 9fb5cd89509d8e..ba1a6e151697d9 100644
--- a/deps/v8/src/diagnostics/basic-block-profiler.cc
+++ b/deps/v8/src/diagnostics/basic-block-profiler.cc
@@ -17,6 +17,7 @@ namespace v8 {
 namespace internal {
 
 DEFINE_LAZY_LEAKY_OBJECT_GETTER(BasicBlockProfiler, BasicBlockProfiler::Get)
+DEFINE_LAZY_LEAKY_OBJECT_GETTER(BuiltinsCallGraph, BuiltinsCallGraph::Get)
 
 BasicBlockProfilerData::BasicBlockProfilerData(size_t n_blocks)
     : block_ids_(n_blocks), counts_(n_blocks, 0) {}
@@ -76,29 +77,30 @@ BasicBlockProfilerData::BasicBlockProfilerData(
 }
 
 BasicBlockProfilerData::BasicBlockProfilerData(
-    OnHeapBasicBlockProfilerData js_heap_data) {
+    Tagged<OnHeapBasicBlockProfilerData> js_heap_data) {
   CopyFromJSHeap(js_heap_data);
 }
 
 void BasicBlockProfilerData::CopyFromJSHeap(
-    OnHeapBasicBlockProfilerData js_heap_data) {
-  function_name_ = js_heap_data.name().ToCString().get();
-  schedule_ = js_heap_data.schedule().ToCString().get();
-  code_ = js_heap_data.code().ToCString().get();
-  FixedUInt32Array counts = FixedUInt32Array::cast(js_heap_data.counts());
+    Tagged<OnHeapBasicBlockProfilerData> js_heap_data) {
+  function_name_ = js_heap_data->name()->ToCString().get();
+  schedule_ = js_heap_data->schedule()->ToCString().get();
+  code_ = js_heap_data->code()->ToCString().get();
+  FixedUInt32Array counts = FixedUInt32Array::cast(js_heap_data->counts());
   for (int i = 0; i < counts.length() / kBlockCountSlotSize; ++i) {
     counts_.push_back(counts.get(i));
   }
-  FixedInt32Array block_ids(js_heap_data.block_ids());
+  FixedInt32Array block_ids(js_heap_data->block_ids());
   for (int i = 0; i < block_ids.length() / kBlockIdSlotSize; ++i) {
     block_ids_.push_back(block_ids.get(i));
   }
-  PodArray<std::pair<int32_t, int32_t>> branches = js_heap_data.branches();
-  for (int i = 0; i < branches.length(); ++i) {
-    branches_.push_back(branches.get(i));
+  Tagged<PodArray<std::pair<int32_t, int32_t>>> branches =
+      js_heap_data->branches();
+  for (int i = 0; i < branches->length(); ++i) {
+    branches_.push_back(branches->get(i));
   }
   CHECK_EQ(block_ids_.size(), counts_.size());
-  hash_ = js_heap_data.hash();
+  hash_ = js_heap_data->hash();
 }
 
 Handle<OnHeapBasicBlockProfilerData> BasicBlockProfilerData::CopyToJSHeap(
@@ -148,7 +150,7 @@ void BasicBlockProfiler::ResetCounts(Isolate* isolate) {
                          isolate);
   for (int i = 0; i < list->Length(); ++i) {
     Handle<FixedUInt32Array> counts(
-        OnHeapBasicBlockProfilerData::cast(list->Get(i)).counts(), isolate);
+        OnHeapBasicBlockProfilerData::cast(list->Get(i))->counts(), isolate);
     for (int j = 0; j < counts->length() / kBlockCountSlotSize; ++j) {
       counts->set(j, 0);
     }
@@ -157,7 +159,7 @@ void BasicBlockProfiler::ResetCounts(Isolate* isolate) {
 
 bool BasicBlockProfiler::HasData(Isolate* isolate) {
   return data_list_.size() > 0 ||
-         isolate->heap()->basic_block_profiling_data().Length() > 0;
+         isolate->heap()->basic_block_profiling_data()->Length() > 0;
 }
 
 void BasicBlockProfiler::Print(Isolate* isolate, std::ostream& os) {
@@ -199,12 +201,12 @@ void BasicBlockProfiler::Log(Isolate* isolate, std::ostream& os) {
 
 std::vector<bool> BasicBlockProfiler::GetCoverageBitmap(Isolate* isolate) {
   DisallowGarbageCollection no_gc;
-  ArrayList list(isolate->heap()->basic_block_profiling_data());
+  Tagged<ArrayList> list(isolate->heap()->basic_block_profiling_data());
   std::vector<bool> out;
-  int list_length = list.Length();
+  int list_length = list->Length();
   for (int i = 0; i < list_length; ++i) {
     BasicBlockProfilerData data(
-        OnHeapBasicBlockProfilerData::cast(list.Get(i)));
+        OnHeapBasicBlockProfilerData::cast(list->Get(i)));
     for (size_t j = 0; j < data.n_blocks(); ++j) {
       out.push_back(data.counts_[j] > 0);
     }
@@ -272,5 +274,27 @@ std::ostream& operator<<(std::ostream& os, const BasicBlockProfilerData& d) {
   return os;
 }
 
+BuiltinsCallGraph::BuiltinsCallGraph() : all_hash_matched_(true) {}
+
+void BuiltinsCallGraph::AddBuiltinCall(Builtin caller, Builtin callee,
+                                       int32_t block_id) {
+  if (builtin_call_map_.count(caller) == 0) {
+    builtin_call_map_.emplace(caller, BuiltinCallees());
+  }
+  BuiltinCallees& callees = builtin_call_map_.at(caller);
+  if (callees.count(block_id) == 0) {
+    callees.emplace(block_id, BlockCallees());
+  }
+  BlockCallees& block_callees = callees.at(block_id);
+  if (block_callees.count(callee) == 0) {
+    block_callees.emplace(callee);
+  }
+}
+
+const BuiltinCallees* BuiltinsCallGraph::GetBuiltinCallees(Builtin builtin) {
+  if (builtin_call_map_.count(builtin) == 0) return nullptr;
+  return &builtin_call_map_.at(builtin);
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/diagnostics/basic-block-profiler.h b/deps/v8/src/diagnostics/basic-block-profiler.h
index ae4bee99b73f6c..4b266dbd3b5c30 100644
--- a/deps/v8/src/diagnostics/basic-block-profiler.h
+++ b/deps/v8/src/diagnostics/basic-block-profiler.h
@@ -27,7 +27,7 @@ class BasicBlockProfilerData {
   V8_EXPORT_PRIVATE BasicBlockProfilerData(
       Handle<OnHeapBasicBlockProfilerData> js_heap_data, Isolate* isolate);
   V8_EXPORT_PRIVATE BasicBlockProfilerData(
-      OnHeapBasicBlockProfilerData js_heap_data);
+      Tagged<OnHeapBasicBlockProfilerData> js_heap_data);
 
   BasicBlockProfilerData(const BasicBlockProfilerData&) = delete;
   BasicBlockProfilerData& operator=(const BasicBlockProfilerData&) = delete;
@@ -59,7 +59,7 @@ class BasicBlockProfilerData {
 
   V8_EXPORT_PRIVATE void ResetCounts();
 
-  void CopyFromJSHeap(OnHeapBasicBlockProfilerData js_heap_data);
+  void CopyFromJSHeap(Tagged<OnHeapBasicBlockProfilerData> js_heap_data);
 
   // These vectors are indexed by reverse post-order block number.
   std::vector<int32_t> block_ids_;
@@ -101,6 +101,34 @@ class BasicBlockProfiler {
 
 std::ostream& operator<<(std::ostream& os, const BasicBlockProfilerData& s);
 
+// This struct comprises all callee inside a block.
+using BlockCallees = std::set<Builtin>;
+// This struct describes a call inside a caller, the key is block id, the value
+// is a set of callee builtins.
+using BuiltinCallees = std::unordered_map<int32_t, BlockCallees>;
+// This struct describes a map for all builtins which will call other builtin.
+using BuiltinCallMap = std::unordered_map<Builtin, BuiltinCallees>;
+
+class BuiltinsCallGraph {
+ public:
+  BuiltinsCallGraph();
+  ~BuiltinsCallGraph() = default;
+  BuiltinsCallGraph(const BuiltinsCallGraph&) = delete;
+  BuiltinsCallGraph& operator=(const BuiltinsCallGraph&) = delete;
+
+  static BuiltinsCallGraph* Get();
+  void AddBuiltinCall(Builtin caller, Builtin callee, int32_t block_id);
+  const BuiltinCallees* GetBuiltinCallees(Builtin builtin);
+  V8_INLINE bool all_hash_matched() const { return all_hash_matched_; }
+  V8_INLINE void set_all_hash_matched(bool all_hash_matched) {
+    all_hash_matched_ = all_hash_matched;
+  }
+
+ private:
+  BuiltinCallMap builtin_call_map_;
+  bool all_hash_matched_;
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/diagnostics/compilation-statistics.cc b/deps/v8/src/diagnostics/compilation-statistics.cc
index 74fa232a08066f..f6b26cd563b87a 100644
--- a/deps/v8/src/diagnostics/compilation-statistics.cc
+++ b/deps/v8/src/diagnostics/compilation-statistics.cc
@@ -4,6 +4,7 @@
 
 #include "src/diagnostics/compilation-statistics.h"
 
+#include <iomanip>
 #include <ostream>
 #include <vector>
 
@@ -44,6 +45,7 @@ void CompilationStatistics::RecordPhaseKindStats(const char* phase_kind_name,
 void CompilationStatistics::RecordTotalStats(const BasicStats& stats) {
   base::MutexGuard guard(&record_mutex_);
   total_stats_.Accumulate(stats);
+  total_stats_.count_++;
 }
 
 void CompilationStatistics::BasicStats::Accumulate(const BasicStats& stats) {
@@ -54,6 +56,8 @@ void CompilationStatistics::BasicStats::Accumulate(const BasicStats& stats) {
     max_allocated_bytes_ = stats.max_allocated_bytes_;
     function_name_ = stats.function_name_;
   }
+  input_graph_size_ += stats.input_graph_size_;
+  output_graph_size_ += stats.output_graph_size_;
 }
 
 std::string CompilationStatistics::BasicStats::AsJSON() {
@@ -80,6 +84,7 @@ std::string CompilationStatistics::BasicStats::AsJSON() {
 }
 
 static void WriteLine(std::ostream& os, bool machine_format, const char* name,
+                      const char* compiler,
                       const CompilationStatistics::BasicStats& stats,
                       const CompilationStatistics::BasicStats& total_stats) {
   const size_t kBufferSize = 128;
@@ -90,21 +95,34 @@ static void WriteLine(std::ostream& os, bool machine_format, const char* name,
   double size_percent =
       static_cast<double>(stats.total_allocated_bytes_ * 100) /
       static_cast<double>(total_stats.total_allocated_bytes_);
+  double growth =
+      static_cast<double>(stats.output_graph_size_) / stats.input_graph_size_;
+  double mops_per_s = (stats.output_graph_size_ / 1000000.0) / (ms / 1000.0);
+
   if (machine_format) {
     base::OS::SNPrintF(buffer, kBufferSize,
-                       "\"%s_time\"=%.3f\n\"%s_space\"=%zu", name, ms, name,
-                       stats.total_allocated_bytes_);
+                       "\"%s_%s_time\"=%.3f\n\"%s_%s_space\"=%zu", compiler,
+                       name, ms, compiler, name, stats.total_allocated_bytes_);
     os << buffer;
   } else {
-    base::OS::SNPrintF(buffer, kBufferSize,
-                       "%34s %10.3f (%5.1f%%)  %10zu (%5.1f%%) %10zu %10zu",
-                       name, ms, percent, stats.total_allocated_bytes_,
-                       size_percent, stats.max_allocated_bytes_,
-                       stats.absolute_max_allocated_bytes_);
+    if (stats.output_graph_size_ != 0) {
+      base::OS::SNPrintF(
+          buffer, kBufferSize,
+          "%34s %10.3f (%4.1f%%)  %10zu (%4.1f%%) %10zu %10zu   %5.3f %6.2f",
+          name, ms, percent, stats.total_allocated_bytes_, size_percent,
+          stats.max_allocated_bytes_, stats.absolute_max_allocated_bytes_,
+          growth, mops_per_s);
+    } else {
+      base::OS::SNPrintF(
+          buffer, kBufferSize,
+          "%34s %10.3f (%4.1f%%)  %10zu (%4.1f%%) %10zu %10zu               ",
+          name, ms, percent, stats.total_allocated_bytes_, size_percent,
+          stats.max_allocated_bytes_, stats.absolute_max_allocated_bytes_);
+    }
 
     os << buffer;
     if (!stats.function_name_.empty()) {
-      os << "   " << stats.function_name_.c_str();
+      os << "  " << stats.function_name_.c_str();
     }
     os << std::endl;
   }
@@ -115,12 +133,12 @@ static void WriteFullLine(std::ostream& os) {
         "-----------------------------------------------------------\n";
 }
 
-static void WriteHeader(std::ostream& os) {
+static void WriteHeader(std::ostream& os, const char* compiler) {
   WriteFullLine(os);
-  os << "                Turbofan phase            Time (ms)    "
-     << "                   Space (bytes)             Function\n"
+  os << std::setw(24) << compiler << " phase            Time (ms)   "
+     << "                   Space (bytes)            Growth MOps/s Function\n"
      << "                                                       "
-     << "          Total          Max.     Abs. max.\n";
+     << "         Total         Max.     Abs. max.\n";
   WriteFullLine(os);
 }
 
@@ -149,7 +167,7 @@ std::ostream& operator<<(std::ostream& os, const AsPrintableStatistics& ps) {
     sorted_phases[it->second.insert_order_] = it;
   }
 
-  if (!ps.machine_output) WriteHeader(os);
+  if (!ps.machine_output) WriteHeader(os, ps.compiler);
   for (const auto& phase_kind_it : sorted_phase_kinds) {
     const auto& phase_kind_name = phase_kind_it->first;
     if (!ps.machine_output) {
@@ -157,20 +175,25 @@ std::ostream& operator<<(std::ostream& os, const AsPrintableStatistics& ps) {
         const auto& phase_stats = phase_it->second;
         if (phase_stats.phase_kind_name_ != phase_kind_name) continue;
         const auto& phase_name = phase_it->first;
-        WriteLine(os, ps.machine_output, phase_name.c_str(), phase_stats,
-                  s.total_stats_);
+        WriteLine(os, ps.machine_output, phase_name.c_str(), ps.compiler,
+                  phase_stats, s.total_stats_);
       }
       WritePhaseKindBreak(os);
     }
     const auto& phase_kind_stats = phase_kind_it->second;
-    WriteLine(os, ps.machine_output, phase_kind_name.c_str(), phase_kind_stats,
-              s.total_stats_);
+    WriteLine(os, ps.machine_output, phase_kind_name.c_str(), ps.compiler,
+              phase_kind_stats, s.total_stats_);
     os << std::endl;
   }
 
   if (!ps.machine_output) WriteFullLine(os);
-  WriteLine(os, ps.machine_output, "totals", s.total_stats_, s.total_stats_);
+  WriteLine(os, ps.machine_output, "totals", ps.compiler, s.total_stats_,
+            s.total_stats_);
 
+  if (ps.machine_output) {
+    os << std::endl;
+    os << "\"" << ps.compiler << "_totals_count\"=" << s.total_stats_.count_;
+  }
   return os;
 }
 
diff --git a/deps/v8/src/diagnostics/compilation-statistics.h b/deps/v8/src/diagnostics/compilation-statistics.h
index f656c0827f6ac2..f93fa48095a5c1 100644
--- a/deps/v8/src/diagnostics/compilation-statistics.h
+++ b/deps/v8/src/diagnostics/compilation-statistics.h
@@ -19,6 +19,7 @@ class OptimizedCompilationInfo;
 class CompilationStatistics;
 
 struct AsPrintableStatistics {
+  const char* compiler;
   const CompilationStatistics& s;
   const bool machine_output;
 };
@@ -31,19 +32,16 @@ class CompilationStatistics final : public Malloced {
 
   class BasicStats {
    public:
-    BasicStats()
-        : total_allocated_bytes_(0),
-          max_allocated_bytes_(0),
-          absolute_max_allocated_bytes_(0) {}
-
     void Accumulate(const BasicStats& stats);
 
     std::string AsJSON();
 
     base::TimeDelta delta_;
-    size_t total_allocated_bytes_;
-    size_t max_allocated_bytes_;
-    size_t absolute_max_allocated_bytes_;
+    size_t total_allocated_bytes_ = 0;
+    size_t max_allocated_bytes_ = 0;
+    size_t absolute_max_allocated_bytes_ = 0;
+    size_t input_graph_size_ = 0;
+    size_t output_graph_size_ = 0;
     std::string function_name_;
   };
 
@@ -58,8 +56,9 @@ class CompilationStatistics final : public Malloced {
  private:
   class TotalStats : public BasicStats {
    public:
-    TotalStats() : source_size_(0) {}
+    TotalStats() : source_size_(0), count_(0) {}
     uint64_t source_size_;
+    size_t count_;
   };
 
   class OrderedStats : public BasicStats {
diff --git a/deps/v8/src/diagnostics/disasm.h b/deps/v8/src/diagnostics/disasm.h
index aea93a235b8d5d..0b96b4aae83ccf 100644
--- a/deps/v8/src/diagnostics/disasm.h
+++ b/deps/v8/src/diagnostics/disasm.h
@@ -9,8 +9,6 @@
 
 namespace disasm {
 
-using byte = unsigned char;
-
 // Interface and default implementation for converting addresses and
 // register-numbers to text.  The default implementation is machine
 // specific.
@@ -20,9 +18,9 @@ class V8_EXPORT_PRIVATE NameConverter {
   virtual const char* NameOfCPURegister(int reg) const;
   virtual const char* NameOfByteCPURegister(int reg) const;
   virtual const char* NameOfXMMRegister(int reg) const;
-  virtual const char* NameOfAddress(byte* addr) const;
-  virtual const char* NameOfConstant(byte* addr) const;
-  virtual const char* NameInCode(byte* addr) const;
+  virtual const char* NameOfAddress(uint8_t* addr) const;
+  virtual const char* NameOfConstant(uint8_t* addr) const;
+  virtual const char* NameInCode(uint8_t* addr) const;
 
   // Given a root-register-relative offset, returns either a name or nullptr if
   // none is found.
@@ -56,16 +54,16 @@ class Disassembler {
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
   V8_EXPORT_PRIVATE int InstructionDecode(v8::base::Vector<char> buffer,
-                                          byte* instruction);
+                                          uint8_t* instruction);
 
   // Returns -1 if instruction does not mark the beginning of a constant pool,
   // or the number of entries in the constant pool beginning here.
-  int ConstantPoolSizeAt(byte* instruction);
+  int ConstantPoolSizeAt(uint8_t* instruction);
 
   // Write disassembly into specified file 'f' using specified NameConverter
   // (see constructor).
   V8_EXPORT_PRIVATE static void Disassemble(
-      FILE* f, byte* begin, byte* end,
+      FILE* f, uint8_t* begin, uint8_t* end,
       UnimplementedOpcodeAction unimplemented_action =
           kAbortOnUnimplementedOpcode);
 
diff --git a/deps/v8/src/diagnostics/disassembler.cc b/deps/v8/src/diagnostics/disassembler.cc
index 6f0b60f41a0019..6656cf4fc5f05b 100644
--- a/deps/v8/src/diagnostics/disassembler.cc
+++ b/deps/v8/src/diagnostics/disassembler.cc
@@ -42,8 +42,8 @@ class V8NameConverter : public disasm::NameConverter {
  public:
   explicit V8NameConverter(Isolate* isolate, CodeReference code = {})
       : isolate_(isolate), code_(code) {}
-  const char* NameOfAddress(byte* pc) const override;
-  const char* NameInCode(byte* addr) const override;
+  const char* NameOfAddress(uint8_t* pc) const override;
+  const char* NameInCode(uint8_t* addr) const override;
   const char* RootRelativeName(int offset) const override;
 
   const CodeReference& code() const { return code_; }
@@ -82,7 +82,7 @@ void V8NameConverter::InitExternalRefsCache() const {
   }
 }
 
-const char* V8NameConverter::NameOfAddress(byte* pc) const {
+const char* V8NameConverter::NameOfAddress(uint8_t* pc) const {
   if (!code_.is_null()) {
     const char* name =
         isolate_ ? isolate_->builtins()->Lookup(reinterpret_cast<Address>(pc))
@@ -115,7 +115,7 @@ const char* V8NameConverter::NameOfAddress(byte* pc) const {
   return disasm::NameConverter::NameOfAddress(pc);
 }
 
-const char* V8NameConverter::NameInCode(byte* addr) const {
+const char* V8NameConverter::NameInCode(uint8_t* addr) const {
   // The V8NameConverter is used for well known code, so we can "safely"
   // dereference pointers in generated code.
   return code_.is_null() ? "" : reinterpret_cast<const char*>(addr);
@@ -243,7 +243,7 @@ static void PrintRelocInfo(std::ostringstream& out, Isolate* isolate,
   } else if (RelocInfo::IsEmbeddedObjectMode(rmode)) {
     HeapStringAllocator allocator;
     StringStream accumulator(&allocator);
-    relocinfo->target_object(isolate).ShortPrint(&accumulator);
+    ShortPrint(relocinfo->target_object(isolate), &accumulator);
     std::unique_ptr<char[]> obj_name = accumulator.ToCString();
     const bool is_compressed = RelocInfo::IsCompressedEmbeddedObject(rmode);
     out << "    ;; " << (is_compressed ? "(compressed) " : "")
@@ -257,11 +257,11 @@ static void PrintRelocInfo(std::ostringstream& out, Isolate* isolate,
     out << "    ;; external reference (" << reference_name << ")";
   } else if (RelocInfo::IsCodeTargetMode(rmode)) {
     out << "    ;; code:";
-    Code code =
+    Tagged<Code> code =
         isolate->heap()->FindCodeForInnerPointer(relocinfo->target_address());
-    CodeKind kind = code.kind();
-    if (code.is_builtin()) {
-      out << " Builtin::" << Builtins::name(code.builtin_id());
+    CodeKind kind = code->kind();
+    if (code->is_builtin()) {
+      out << " Builtin::" << Builtins::name(code->builtin_id());
     } else {
       out << " " << CodeKindToString(kind);
     }
@@ -280,12 +280,12 @@ static void PrintRelocInfo(std::ostringstream& out, Isolate* isolate,
 
 static int DecodeIt(Isolate* isolate, ExternalReferenceEncoder* ref_encoder,
                     std::ostream& os, CodeReference code,
-                    const V8NameConverter& converter, byte* begin, byte* end,
-                    Address current_pc) {
+                    const V8NameConverter& converter, uint8_t* begin,
+                    uint8_t* end, Address current_pc, size_t range_limit) {
   CHECK(!code.is_null());
   v8::base::EmbeddedVector<char, 128> decode_buffer;
   std::ostringstream out;
-  byte* pc = begin;
+  uint8_t* pc = begin;
   disasm::Disassembler d(converter,
                          disasm::Disassembler::kContinueOnUnimplementedOpcode);
   RelocIterator rit(code);
@@ -294,7 +294,7 @@ static int DecodeIt(Isolate* isolate, ExternalReferenceEncoder* ref_encoder,
 
   while (pc < end) {
     // First decode instruction so that we know its length.
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     bool decoding_constant_pool = constants > 0;
     if (decoding_constant_pool) {
       SNPrintF(
@@ -313,31 +313,39 @@ static int DecodeIt(Isolate* isolate, ExternalReferenceEncoder* ref_encoder,
         pc += 4;
       } else if (!rit.done() &&
                  rit.rinfo()->pc() == reinterpret_cast<Address>(pc) &&
-                 (rit.rinfo()->rmode() == RelocInfo::INTERNAL_REFERENCE ||
-                  rit.rinfo()->rmode() == RelocInfo::LITERAL_CONSTANT)) {
-        // raw pointer embedded in code stream, e.g., jump table
-        byte* ptr =
-            base::ReadUnalignedValue<byte*>(reinterpret_cast<Address>(pc));
-        if (RelocInfo::IsInternalReference(rit.rinfo()->rmode())) {
-          SNPrintF(decode_buffer,
-                   "%08" V8PRIxPTR "       jump table entry %4zu",
-                   reinterpret_cast<intptr_t>(ptr),
-                   static_cast<size_t>(ptr - begin));
-        } else {
-          const char* kType = RelocInfo::IsLiteralConstant(rit.rinfo()->rmode())
-                                  ? "    literal constant"
-                                  : "embedded data object";
-          SNPrintF(decode_buffer, "%08" V8PRIxPTR "       %s 0x%08" V8PRIxPTR,
-                   reinterpret_cast<intptr_t>(ptr), kType,
-                   reinterpret_cast<intptr_t>(ptr));
-        }
+                 rit.rinfo()->rmode() == RelocInfo::INTERNAL_REFERENCE) {
+        // A raw pointer embedded in code stream.
+        uint8_t* ptr =
+            base::ReadUnalignedValue<uint8_t*>(reinterpret_cast<Address>(pc));
+        SNPrintF(decode_buffer, "%08" V8PRIxPTR "       jump table entry %4zu",
+                 reinterpret_cast<intptr_t>(ptr),
+                 static_cast<size_t>(ptr - begin));
         pc += sizeof(ptr);
+#ifdef V8_TARGET_ARCH_X64
+      } else if (!rit.done() &&
+                 rit.rinfo()->pc() == reinterpret_cast<Address>(pc) &&
+                 rit.rinfo()->rmode() ==
+                     RelocInfo::RELATIVE_SWITCH_TABLE_ENTRY) {
+        int target_pc_offset = static_cast<int>(rit.rinfo()->data());
+        uint8_t* ptr = begin + target_pc_offset;
+        SNPrintF(decode_buffer, "%08" V8PRIxPTR "       jump table entry %4zx",
+                 reinterpret_cast<intptr_t>(ptr),
+                 static_cast<size_t>(target_pc_offset));
+        // We use emitl (4 bytes) for the value in the table.
+        pc += 4;
+#endif  // V8_TARGET_ARCH_X64
       } else {
         decode_buffer[0] = '\0';
         pc += d.InstructionDecode(decode_buffer, pc);
       }
     }
 
+    Address pc_address = reinterpret_cast<Address>(pc);
+    if (range_limit != 0) {
+      if (pc_address > current_pc + range_limit) break;
+      if (pc_address <= current_pc - range_limit) continue;
+    }
+
     // Collect RelocInfo for this instruction (prev_pc .. pc-1)
     std::vector<const char*> comments;
     std::vector<Address> pcs;
@@ -350,9 +358,13 @@ static int DecodeIt(Isolate* isolate, ExternalReferenceEncoder* ref_encoder,
       datas.push_back(rit.rinfo()->data());
       rit.next();
     }
-    while (cit.HasCurrent() &&
-           cit.GetPCOffset() < static_cast<Address>(pc - begin)) {
-      comments.push_back(cit.GetComment());
+    while (cit.HasCurrent()) {
+      Address cur = cit.GetPCOffset();
+      if (cur >= static_cast<Address>(pc - begin)) break;
+      if (range_limit == 0 ||
+          cur + range_limit > current_pc - reinterpret_cast<Address>(begin)) {
+        comments.push_back(cit.GetComment());
+      }
       cit.Next();
     }
 
@@ -384,9 +396,7 @@ static int DecodeIt(Isolate* isolate, ExternalReferenceEncoder* ref_encoder,
       if (host.is_code()) {
         code_handle = host.as_code();
 
-        RelocInfo relocinfo(pcs[i], rmodes[i], datas[i], *code_handle,
-                            code_handle->instruction_stream(), constant_pool);
-
+        RelocInfo relocinfo(pcs[i], rmodes[i], datas[i], constant_pool);
         bool first_reloc_info = (i == 0);
         PrintRelocInfo(out, isolate, ref_encoder, os, code, &relocinfo,
                        first_reloc_info);
@@ -402,7 +412,7 @@ static int DecodeIt(Isolate* isolate, ExternalReferenceEncoder* ref_encoder,
     // by IsInConstantPool() below.
     if (pcs.empty() && !code.is_null() && !decoding_constant_pool) {
       RelocInfo dummy_rinfo(reinterpret_cast<Address>(prev_pc),
-                            RelocInfo::NO_INFO, 0, Code(), InstructionStream());
+                            RelocInfo::NO_INFO);
       if (dummy_rinfo.IsInConstantPool()) {
         Address constant_pool_entry_address =
             dummy_rinfo.constant_pool_entry_address();
@@ -430,16 +440,21 @@ static int DecodeIt(Isolate* isolate, ExternalReferenceEncoder* ref_encoder,
 
   // Emit comments following the last instruction (if any).
   while (cit.HasCurrent()) {
-    out << "                  " << cit.GetComment();
-    DumpBuffer(os, out);
+    Address cur = cit.GetPCOffset();
+    if (range_limit == 0 ||
+        cur + range_limit == current_pc - reinterpret_cast<Address>(begin)) {
+      out << "                  " << cit.GetComment();
+      DumpBuffer(os, out);
+    }
     cit.Next();
   }
 
   return static_cast<int>(pc - begin);
 }
 
-int Disassembler::Decode(Isolate* isolate, std::ostream& os, byte* begin,
-                         byte* end, CodeReference code, Address current_pc) {
+int Disassembler::Decode(Isolate* isolate, std::ostream& os, uint8_t* begin,
+                         uint8_t* end, CodeReference code, Address current_pc,
+                         size_t range_limit) {
   DCHECK_WITH_MSG(v8_flags.text_is_readable,
                   "Builtins disassembly requires a readable .text section");
   V8NameConverter v8NameConverter(isolate, code);
@@ -450,19 +465,20 @@ int Disassembler::Decode(Isolate* isolate, std::ostream& os, byte* begin,
     DisallowGarbageCollection no_alloc;
     ExternalReferenceEncoder ref_encoder(isolate);
     return DecodeIt(isolate, &ref_encoder, os, code, v8NameConverter, begin,
-                    end, current_pc);
+                    end, current_pc, range_limit);
   } else {
     // No isolate => isolate-independent code. Only V8 External references
     // available.
     return DecodeIt(nullptr, nullptr, os, code, v8NameConverter, begin, end,
-                    current_pc);
+                    current_pc, range_limit);
   }
 }
 
 #else  // ENABLE_DISASSEMBLER
 
-int Disassembler::Decode(Isolate* isolate, std::ostream& os, byte* begin,
-                         byte* end, CodeReference code, Address current_pc) {
+int Disassembler::Decode(Isolate* isolate, std::ostream& os, uint8_t* begin,
+                         uint8_t* end, CodeReference code, Address current_pc,
+                         size_t range_limit) {
   return 0;
 }
 
diff --git a/deps/v8/src/diagnostics/disassembler.h b/deps/v8/src/diagnostics/disassembler.h
index 2373cae2324c95..560d2d4814217d 100644
--- a/deps/v8/src/diagnostics/disassembler.h
+++ b/deps/v8/src/diagnostics/disassembler.h
@@ -21,9 +21,10 @@ class Disassembler : public AllStatic {
   // the code object is used for name resolution and may be null.
   // TODO(titzer): accept a {WasmCodeManager*} if {isolate} is null
   V8_EXPORT_PRIVATE static int Decode(Isolate* isolate, std::ostream& os,
-                                      byte* begin, byte* end,
+                                      uint8_t* begin, uint8_t* end,
                                       CodeReference code = {},
-                                      Address current_pc = kNullAddress);
+                                      Address current_pc = kNullAddress,
+                                      size_t range_limit = 0);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/diagnostics/eh-frame.cc b/deps/v8/src/diagnostics/eh-frame.cc
index 223e288e6e9efb..ff249c2da7a6d7 100644
--- a/deps/v8/src/diagnostics/eh-frame.cc
+++ b/deps/v8/src/diagnostics/eh-frame.cc
@@ -90,7 +90,7 @@ void EhFrameWriter::WriteCie() {
   static const int kCIEIdentifier = 0;
   static const int kCIEVersion = 3;
   static const int kAugmentationDataSize = 2;
-  static const byte kAugmentationString[] = {'z', 'L', 'R', 0};
+  static const uint8_t kAugmentationString[] = {'z', 'L', 'R', 0};
 
   // Placeholder for the size of the CIE.
   int size_offset = eh_frame_offset();
@@ -242,8 +242,8 @@ void EhFrameWriter::WritePaddingToAlignedSize(int unpadded_size) {
 
   int padding_size = RoundUp(unpadded_size, kSystemPointerSize) - unpadded_size;
 
-  byte nop = static_cast<byte>(EhFrameConstants::DwarfOpcodes::kNop);
-  static const byte kPadding[] = {nop, nop, nop, nop, nop, nop, nop, nop};
+  uint8_t nop = static_cast<uint8_t>(EhFrameConstants::DwarfOpcodes::kNop);
+  static const uint8_t kPadding[] = {nop, nop, nop, nop, nop, nop, nop, nop};
   DCHECK_LE(padding_size, static_cast<int>(sizeof(kPadding)));
   WriteBytes(&kPadding[0], padding_size);
 }
@@ -364,7 +364,8 @@ void EhFrameWriter::Finish(int code_size) {
   PatchInt32(GetProcedureSizeOffset(), code_size);
 
   // Terminate the .eh_frame.
-  static const byte kTerminator[EhFrameConstants::kEhFrameTerminatorSize] = {0};
+  static const uint8_t kTerminator[EhFrameConstants::kEhFrameTerminatorSize] = {
+      0};
   WriteBytes(&kTerminator[0], EhFrameConstants::kEhFrameTerminatorSize);
 
   WriteEhFrameHdr(code_size);
@@ -380,7 +381,7 @@ void EhFrameWriter::GetEhFrame(CodeDesc* desc) {
 
 void EhFrameWriter::WriteULeb128(uint32_t value) {
   do {
-    byte chunk = value & 0x7F;
+    uint8_t chunk = value & 0x7F;
     value >>= 7;
     if (value != 0) chunk |= 0x80;
     WriteByte(chunk);
@@ -391,7 +392,7 @@ void EhFrameWriter::WriteSLeb128(int32_t value) {
   static const int kSignBitMask = 0x40;
   bool done;
   do {
-    byte chunk = value & 0x7F;
+    uint8_t chunk = value & 0x7F;
     value >>= 7;
     done = ((value == 0) && ((chunk & kSignBitMask) == 0)) ||
            ((value == -1) && ((chunk & kSignBitMask) != 0));
@@ -417,9 +418,9 @@ int32_t EhFrameIterator::GetNextSLeb128() {
 }
 
 // static
-uint32_t EhFrameIterator::DecodeULeb128(const byte* encoded,
+uint32_t EhFrameIterator::DecodeULeb128(const uint8_t* encoded,
                                         int* encoded_size) {
-  const byte* current = encoded;
+  const uint8_t* current = encoded;
   uint32_t result = 0;
   int shift = 0;
 
@@ -436,13 +437,14 @@ uint32_t EhFrameIterator::DecodeULeb128(const byte* encoded,
 }
 
 // static
-int32_t EhFrameIterator::DecodeSLeb128(const byte* encoded, int* encoded_size) {
-  static const byte kSignBitMask = 0x40;
+int32_t EhFrameIterator::DecodeSLeb128(const uint8_t* encoded,
+                                       int* encoded_size) {
+  static const uint8_t kSignBitMask = 0x40;
 
-  const byte* current = encoded;
+  const uint8_t* current = encoded;
   int32_t result = 0;
   int shift = 0;
-  byte chunk;
+  uint8_t chunk;
 
   do {
     chunk = *current++;
@@ -479,8 +481,8 @@ class V8_NODISCARD StreamModifiersScope final {
 
 // static
 void EhFrameDisassembler::DumpDwarfDirectives(std::ostream& stream,
-                                              const byte* start,
-                                              const byte* end) {
+                                              const uint8_t* start,
+                                              const uint8_t* end) {
   StreamModifiersScope modifiers_scope(&stream);
 
   EhFrameIterator eh_frame_iterator(start, end);
@@ -489,7 +491,7 @@ void EhFrameDisassembler::DumpDwarfDirectives(std::ostream& stream,
   while (!eh_frame_iterator.Done()) {
     stream << eh_frame_iterator.current_address() << "  ";
 
-    byte bytecode = eh_frame_iterator.GetNextByte();
+    uint8_t bytecode = eh_frame_iterator.GetNextByte();
 
     if (((bytecode >> EhFrameConstants::kLocationMaskSize) & 0xFF) ==
         EhFrameConstants::kLocationTag) {
@@ -596,9 +598,9 @@ void EhFrameDisassembler::DisassembleToStream(std::ostream& stream) {
       kInt32Size;
   const int fde_offset = cie_size;
 
-  const byte* cie_directives_start =
+  const uint8_t* cie_directives_start =
       start_ + EhFrameConstants::kInitialStateOffsetInCie;
-  const byte* cie_directives_end = start_ + cie_size;
+  const uint8_t* cie_directives_end = start_ + cie_size;
   DCHECK_LE(cie_directives_start, cie_directives_end);
 
   stream << reinterpret_cast<const void*>(start_) << "  .eh_frame: CIE\n";
@@ -616,7 +618,7 @@ void EhFrameDisassembler::DisassembleToStream(std::ostream& stream) {
   uint32_t procedure_size =
       base::ReadUnalignedValue<uint32_t>(procedure_size_address);
 
-  const byte* fde_start = start_ + fde_offset;
+  const uint8_t* fde_start = start_ + fde_offset;
   stream << reinterpret_cast<const void*>(fde_start) << "  .eh_frame: FDE\n"
          << reinterpret_cast<const void*>(procedure_offset_address)
          << "  | procedure_offset=" << procedure_offset << '\n'
@@ -625,18 +627,18 @@ void EhFrameDisassembler::DisassembleToStream(std::ostream& stream) {
 
   const int fde_directives_offset = fde_offset + 4 * kInt32Size + 1;
 
-  const byte* fde_directives_start = start_ + fde_directives_offset;
-  const byte* fde_directives_end = end_ - EhFrameConstants::kEhFrameHdrSize -
-                                   EhFrameConstants::kEhFrameTerminatorSize;
+  const uint8_t* fde_directives_start = start_ + fde_directives_offset;
+  const uint8_t* fde_directives_end = end_ - EhFrameConstants::kEhFrameHdrSize -
+                                      EhFrameConstants::kEhFrameTerminatorSize;
   DCHECK_LE(fde_directives_start, fde_directives_end);
 
   DumpDwarfDirectives(stream, fde_directives_start, fde_directives_end);
 
-  const byte* fde_terminator_start = fde_directives_end;
+  const uint8_t* fde_terminator_start = fde_directives_end;
   stream << reinterpret_cast<const void*>(fde_terminator_start)
          << "  .eh_frame: terminator\n";
 
-  const byte* eh_frame_hdr_start =
+  const uint8_t* eh_frame_hdr_start =
       fde_terminator_start + EhFrameConstants::kEhFrameTerminatorSize;
   stream << reinterpret_cast<const void*>(eh_frame_hdr_start)
          << "  .eh_frame_hdr\n";
diff --git a/deps/v8/src/diagnostics/eh-frame.h b/deps/v8/src/diagnostics/eh-frame.h
index 3cd3318f6942b8..10a1daa5f2d061 100644
--- a/deps/v8/src/diagnostics/eh-frame.h
+++ b/deps/v8/src/diagnostics/eh-frame.h
@@ -19,7 +19,7 @@ class CodeDesc;
 class V8_EXPORT_PRIVATE EhFrameConstants final
     : public NON_EXPORTED_BASE(AllStatic) {
  public:
-  enum class DwarfOpcodes : byte {
+  enum class DwarfOpcodes : uint8_t {
     kNop = 0x00,
     kAdvanceLoc1 = 0x02,
     kAdvanceLoc2 = 0x03,
@@ -32,7 +32,7 @@ class V8_EXPORT_PRIVATE EhFrameConstants final
     kOffsetExtendedSf = 0x11,
   };
 
-  enum DwarfEncodingSpecifiers : byte {
+  enum DwarfEncodingSpecifiers : uint8_t {
     kUData4 = 0x03,
     kSData4 = 0x0b,
     kPcRel = 0x10,
@@ -138,18 +138,18 @@ class V8_EXPORT_PRIVATE EhFrameWriter {
   void WriteSLeb128(int32_t value);
   void WriteULeb128(uint32_t value);
 
-  void WriteByte(byte value) { eh_frame_buffer_.push_back(value); }
+  void WriteByte(uint8_t value) { eh_frame_buffer_.push_back(value); }
   void WriteOpcode(EhFrameConstants::DwarfOpcodes opcode) {
-    WriteByte(static_cast<byte>(opcode));
+    WriteByte(static_cast<uint8_t>(opcode));
   }
-  void WriteBytes(const byte* start, int size) {
+  void WriteBytes(const uint8_t* start, int size) {
     eh_frame_buffer_.insert(eh_frame_buffer_.end(), start, start + size);
   }
   void WriteInt16(uint16_t value) {
-    WriteBytes(reinterpret_cast<const byte*>(&value), sizeof(value));
+    WriteBytes(reinterpret_cast<const uint8_t*>(&value), sizeof(value));
   }
   void WriteInt32(uint32_t value) {
-    WriteBytes(reinterpret_cast<const byte*>(&value), sizeof(value));
+    WriteBytes(reinterpret_cast<const uint8_t*>(&value), sizeof(value));
   }
   void PatchInt32(int base_offset, uint32_t value) {
     DCHECK_EQ(
@@ -207,12 +207,12 @@ class V8_EXPORT_PRIVATE EhFrameWriter {
   InternalState writer_state_;
   Register base_register_;
   int base_offset_;
-  ZoneVector<byte> eh_frame_buffer_;
+  ZoneVector<uint8_t> eh_frame_buffer_;
 };
 
 class V8_EXPORT_PRIVATE EhFrameIterator {
  public:
-  EhFrameIterator(const byte* start, const byte* end)
+  EhFrameIterator(const uint8_t* start, const uint8_t* end)
       : start_(start), next_(start), end_(end) {
     DCHECK_LE(start, end);
   }
@@ -238,7 +238,7 @@ class V8_EXPORT_PRIVATE EhFrameIterator {
 
   uint32_t GetNextUInt32() { return GetNextValue<uint32_t>(); }
   uint16_t GetNextUInt16() { return GetNextValue<uint16_t>(); }
-  byte GetNextByte() { return GetNextValue<byte>(); }
+  uint8_t GetNextByte() { return GetNextValue<uint8_t>(); }
   EhFrameConstants::DwarfOpcodes GetNextOpcode() {
     return static_cast<EhFrameConstants::DwarfOpcodes>(GetNextByte());
   }
@@ -265,8 +265,8 @@ class V8_EXPORT_PRIVATE EhFrameIterator {
  private:
   static const int kDirectivesOffsetInFde = 4 * kInt32Size + 1;
 
-  static uint32_t DecodeULeb128(const byte* encoded, int* encoded_size);
-  static int32_t DecodeSLeb128(const byte* encoded, int* encoded_size);
+  static uint32_t DecodeULeb128(const uint8_t* encoded, int* encoded_size);
+  static int32_t DecodeSLeb128(const uint8_t* encoded, int* encoded_size);
 
   template <typename T>
   T GetNextValue() {
@@ -277,16 +277,16 @@ class V8_EXPORT_PRIVATE EhFrameIterator {
     return result;
   }
 
-  const byte* start_;
-  const byte* next_;
-  const byte* end_;
+  const uint8_t* start_;
+  const uint8_t* next_;
+  const uint8_t* end_;
 };
 
 #ifdef ENABLE_DISASSEMBLER
 
 class EhFrameDisassembler final {
  public:
-  EhFrameDisassembler(const byte* start, const byte* end)
+  EhFrameDisassembler(const uint8_t* start, const uint8_t* end)
       : start_(start), end_(end) {
     DCHECK_LT(start, end);
   }
@@ -296,13 +296,13 @@ class EhFrameDisassembler final {
   void DisassembleToStream(std::ostream& stream);
 
  private:
-  static void DumpDwarfDirectives(std::ostream& stream, const byte* start,
-                                  const byte* end);
+  static void DumpDwarfDirectives(std::ostream& stream, const uint8_t* start,
+                                  const uint8_t* end);
 
   static const char* DwarfRegisterCodeToString(int code);
 
-  const byte* start_;
-  const byte* end_;
+  const uint8_t* start_;
+  const uint8_t* end_;
 };
 
 #endif
diff --git a/deps/v8/src/diagnostics/etw-jit-win.cc b/deps/v8/src/diagnostics/etw-jit-win.cc
index 9f3820220c3e0a..ed9a24bb12d981 100644
--- a/deps/v8/src/diagnostics/etw-jit-win.cc
+++ b/deps/v8/src/diagnostics/etw-jit-win.cc
@@ -36,60 +36,67 @@ namespace {
 class IsolateLoadScriptData {
  public:
   explicit IsolateLoadScriptData(Isolate* isolate) : isolate_(isolate) {}
-  virtual ~IsolateLoadScriptData() {
-    // When this is destroyed, it is because Isolate is being destroyed
-    // also in Isolate::Deinit, that while already cancel all cancellable
-    // tasks.
-    if (HasPendingLog()) {
-      pending_log_task_id_ = CancelableTaskManager::kInvalidTaskId;
-    }
+  explicit IsolateLoadScriptData(IsolateLoadScriptData&& rhs) V8_NOEXCEPT {
+    isolate_ = rhs.isolate_;
+    loaded_scripts_ids_ = std::move(rhs.loaded_scripts_ids_);
+    event_id_ = rhs.event_id_.load();
   }
 
   static void AddIsolate(Isolate* isolate);
   static void RemoveIsolate(Isolate* isolate);
-  static void LogIsolatePendingLogs(Isolate* isolate);
   static void UpdateAllIsolates(bool etw_enabled);
   static bool MaybeAddLoadedScript(Isolate* isolate, int script_id);
-  static void EnableLog(Isolate* isolate);
-  static void DisableLog(Isolate* isolate);
+  static void EnableLog(Isolate* isolate, size_t event_id);
+  static void DisableLog(Isolate* isolate, size_t event_id);
+
+  static void EnableLogWithFilterDataOnAllIsolates(const uint8_t* data,
+                                                   size_t size);
+  static void EnableLogWithFilterData(
+      Isolate* isolate, size_t event_id,
+      const std::string& EnableLogWithFilterData);
 
  private:
   static IsolateLoadScriptData& GetData(Isolate* isolate);
-  bool HasPendingLog() const {
-    return pending_log_task_id_ != CancelableTaskManager::kInvalidTaskId;
-  }
-  void RemovePendingLog() {
-    pending_log_task_id_ = CancelableTaskManager::kInvalidTaskId;
-  }
-  void CancelPendingLog() {
-    DCHECK(HasPendingLog());
-    isolate_->cancelable_task_manager()->TryAbort(pending_log_task_id_);
-    RemovePendingLog();
-  }
   void EnqueueEnableLog() {
-    if (HasPendingLog()) {
-      CancelPendingLog();
-    }
-    auto v8_isolate = reinterpret_cast<v8::Isolate*>(isolate_);
-    Isolate* isolate = isolate_;
-    auto task = MakeCancelableTask(isolate_, [isolate] { EnableLog(isolate); });
-    pending_log_task_id_ = task->id();
-    auto taskrunner =
-        V8::GetCurrentPlatform()->GetForegroundTaskRunner(v8_isolate);
-    taskrunner->PostTask(std::move(task));
+    size_t event_id = event_id_.fetch_add(1);
+    isolate_->RequestInterrupt(
+        // Executed in the isolate thread.
+        [](v8::Isolate* v8_isolate, void* data) {
+          EnableLog(reinterpret_cast<Isolate*>(v8_isolate),
+                    reinterpret_cast<size_t>(data));
+        },
+        reinterpret_cast<void*>(event_id + 1));
   }
   void EnqueueDisableLog() {
-    if (HasPendingLog()) {
-      CancelPendingLog();
-    }
-    auto v8_isolate = reinterpret_cast<v8::Isolate*>(isolate_);
-    Isolate* isolate = isolate_;
-    auto task =
-        MakeCancelableTask(isolate_, [isolate] { DisableLog(isolate); });
-    pending_log_task_id_ = task->id();
-    auto taskrunner =
-        V8::GetCurrentPlatform()->GetForegroundTaskRunner(v8_isolate);
-    taskrunner->PostTask(std::move(task));
+    size_t event_id = event_id_.fetch_add(1);
+    isolate_->RequestInterrupt(
+        // Executed in the isolate thread.
+        [](v8::Isolate* v8_isolate, void* data) {
+          DisableLog(reinterpret_cast<Isolate*>(v8_isolate),
+                     reinterpret_cast<size_t>(data));
+        },
+        reinterpret_cast<void*>(event_id + 1));
+  }
+
+  struct EnableWithFilterDataInterruptData {
+    size_t event_id;
+    std::string payload;
+  };
+
+  void EnqueueEnableLogWithFilterData(const std::string& etw_filter_payload) {
+    size_t event_id = event_id_.fetch_add(1);
+    isolate_->RequestInterrupt(
+        // Executed in the isolate thread.
+        [](v8::Isolate* v8_isolate, void* data) {
+          std::unique_ptr<EnableWithFilterDataInterruptData> interrupt_data(
+              reinterpret_cast<EnableWithFilterDataInterruptData*>(data));
+          size_t event_id = interrupt_data->event_id;
+          std::string etw_filter_payload = interrupt_data->payload;
+          EnableLogWithFilterData(reinterpret_cast<Isolate*>(v8_isolate),
+                                  event_id, etw_filter_payload);
+        },
+        new EnableWithFilterDataInterruptData{event_id + 1,
+                                              etw_filter_payload});
   }
 
   bool IsScriptLoaded(int script_id) const {
@@ -98,10 +105,11 @@ class IsolateLoadScriptData {
   void AddLoadedScript(int script_id) { loaded_scripts_ids_.insert(script_id); }
   void RemoveAllLoadedScripts() { loaded_scripts_ids_.clear(); }
 
+  size_t CurrentEventId() const { return event_id_.load(); }
+
   Isolate* isolate_ = nullptr;
   std::unordered_set<int> loaded_scripts_ids_;
-  CancelableTaskManager::Id pending_log_task_id_ =
-      CancelableTaskManager::kInvalidTaskId;
+  std::atomic<size_t> event_id_ = 0;
 };
 
 static base::LazyMutex isolates_mutex = LAZY_MUTEX_INITIALIZER;
@@ -110,49 +118,96 @@ using IsolateMapType =
 static base::LazyInstance<IsolateMapType>::type isolate_map =
     LAZY_INSTANCE_INITIALIZER;
 
+using FilterDataType = std::string;
+// Used when Isolates are created during a ETW tracing session.
+static base::LazyInstance<FilterDataType>::type etw_filter_payload =
+    LAZY_INSTANCE_INITIALIZER;
+
+// static
 IsolateLoadScriptData& IsolateLoadScriptData::GetData(Isolate* isolate) {
   return isolate_map.Pointer()->at(isolate);
 }
 
+// static
 void IsolateLoadScriptData::AddIsolate(Isolate* isolate) {
   base::MutexGuard guard(isolates_mutex.Pointer());
   isolate_map.Pointer()->emplace(isolate, IsolateLoadScriptData(isolate));
 }
 
+// static
 void IsolateLoadScriptData::RemoveIsolate(Isolate* isolate) {
   base::MutexGuard guard(isolates_mutex.Pointer());
   isolate_map.Pointer()->erase(isolate);
 }
 
-void IsolateLoadScriptData::EnableLog(Isolate* isolate) {
-  bool has_pending_log = false;
+// static
+void IsolateLoadScriptData::EnableLog(Isolate* isolate, size_t event_id) {
   {
     base::MutexGuard guard(isolates_mutex.Pointer());
     auto& data = GetData(isolate);
-    if (data.HasPendingLog()) {
-      has_pending_log = true;
-      data.CancelPendingLog();
+    if (event_id > 0 && data.CurrentEventId() != event_id) {
+      // This interrupt was canceled by a newer interrupt.
+      return;
     }
   }
 
   // This cannot be done while isolate_mutex is locked, as it can call
   // EventHandler while in the call for all the existing code.
-  isolate->v8_file_logger()->SetEtwCodeEventHandler(
-      has_pending_log ? kJitCodeEventEnumExisting : kJitCodeEventDefault);
+  isolate->v8_file_logger()->SetEtwCodeEventHandler(kJitCodeEventDefault);
 }
 
-void IsolateLoadScriptData::DisableLog(Isolate* isolate) {
+// static
+void IsolateLoadScriptData::DisableLog(Isolate* isolate, size_t event_id) {
   {
     base::MutexGuard guard(isolates_mutex.Pointer());
     auto& data = GetData(isolate);
-    if (data.HasPendingLog()) {
-      data.CancelPendingLog();
+    if (event_id > 0 && data.CurrentEventId() != event_id) {
+      // This interrupt was canceled by a newer interrupt.
+      return;
     }
     data.RemoveAllLoadedScripts();
   }
   isolate->v8_file_logger()->ResetEtwCodeEventHandler();
 }
 
+// static
+void IsolateLoadScriptData::EnableLogWithFilterData(
+    Isolate* isolate, size_t event_id, const std::string& etw_filter_payload) {
+  {
+    base::MutexGuard guard(isolates_mutex.Pointer());
+    auto& data = GetData(isolate);
+    if (event_id > 0 && data.CurrentEventId() != event_id) {
+      // This interrupt was canceled by a newer interrupt.
+      return;
+    }
+  }
+
+  DCHECK(!etw_filter_payload.empty());
+
+  // We should not call back into V8 from the RunFilterETWSessionByURLCallback
+  // callback.
+  DisallowJavascriptExecution no_js(isolate);
+
+  if (isolate->RunFilterETWSessionByURLCallback(etw_filter_payload)) {
+    isolate->v8_file_logger()->SetEtwCodeEventHandler(kJitCodeEventDefault);
+  }
+}
+
+// static
+void IsolateLoadScriptData::EnableLogWithFilterDataOnAllIsolates(
+    const uint8_t* data, size_t size) {
+  base::MutexGuard guard(isolates_mutex.Pointer());
+  std::string etw_filter_payload;
+  etw_filter_payload.assign(data, data + size);
+  std::for_each(
+      isolate_map.Pointer()->begin(), isolate_map.Pointer()->end(),
+      [&etw_filter_payload](auto& pair) {
+        auto& isolate_data = pair.second;
+        isolate_data.EnqueueEnableLogWithFilterData(etw_filter_payload);
+      });
+}
+
+// static
 void IsolateLoadScriptData::UpdateAllIsolates(bool etw_enabled) {
   base::MutexGuard guard(isolates_mutex.Pointer());
   std::for_each(isolate_map.Pointer()->begin(), isolate_map.Pointer()->end(),
@@ -166,6 +221,7 @@ void IsolateLoadScriptData::UpdateAllIsolates(bool etw_enabled) {
                 });
 }
 
+// static
 bool IsolateLoadScriptData::MaybeAddLoadedScript(Isolate* isolate,
                                                  int script_id) {
   base::MutexGuard guard(isolates_mutex.Pointer());
@@ -179,32 +235,23 @@ bool IsolateLoadScriptData::MaybeAddLoadedScript(Isolate* isolate,
 
 }  // namespace
 
-void EnableETWLog(Isolate* isolate) {
-  IsolateLoadScriptData::EnableLog(isolate);
+void MaybeSetHandlerNow(Isolate* isolate) {
+  if (is_etw_enabled) {
+    if (etw_filter_payload.Pointer()->empty()) {
+      IsolateLoadScriptData::EnableLog(isolate, 0);
+    } else {
+      IsolateLoadScriptData::EnableLogWithFilterData(
+          isolate, 0, *etw_filter_payload.Pointer());
+    }
+  }
 }
 
 // TODO(v8/11911): UnboundScript::GetLineNumber should be replaced
 SharedFunctionInfo GetSharedFunctionInfo(const JitCodeEvent* event) {
-  return event->script.IsEmpty() ? SharedFunctionInfo()
+  return event->script.IsEmpty() ? Tagged<SharedFunctionInfo>()
                                  : *Utils::OpenHandle(*event->script);
 }
 
-int GetScriptLineNumber(const JitCodeEvent* event) {
-  auto sfi = GetSharedFunctionInfo(event);
-  return sfi.is_null()
-             ? -1  // invalid sentinel number
-             : Script::cast(sfi.script()).GetLineNumber(sfi.StartPosition()) +
-                   1;
-}
-
-int GetScriptColumnNumber(const JitCodeEvent* event) {
-  auto sfi = GetSharedFunctionInfo(event);
-  return sfi.is_null()
-             ? -1  // invalid sentinel number
-             : Script::cast(sfi.script()).GetColumnNumber(sfi.StartPosition()) +
-                   1;
-}
-
 std::wstring GetScriptMethodNameFromEvent(const JitCodeEvent* event) {
   int name_len = static_cast<int>(event->name.len);
   // Note: event->name.str is not null terminated.
@@ -250,7 +297,7 @@ void UpdateETWEnabled(bool enabled) {
 void WINAPI ETWEnableCallback(LPCGUID /* source_id */, ULONG is_enabled,
                               UCHAR level, ULONGLONG match_any_keyword,
                               ULONGLONG match_all_keyword,
-                              PEVENT_FILTER_DESCRIPTOR /* filter_data */,
+                              PEVENT_FILTER_DESCRIPTOR filter_data,
                               PVOID /* callback_context */) {
   DCHECK(v8_flags.enable_etw_stack_walking);
   bool is_etw_enabled_now =
@@ -258,7 +305,36 @@ void WINAPI ETWEnableCallback(LPCGUID /* source_id */, ULONG is_enabled,
       (match_any_keyword & kJScriptRuntimeKeyword) &&
       ((match_all_keyword & kJScriptRuntimeKeyword) == match_all_keyword);
 
-  UpdateETWEnabled(is_etw_enabled_now);
+  FilterDataType* etw_filter = etw_filter_payload.Pointer();
+
+  if (!is_etw_enabled_now || !filter_data ||
+      filter_data->Type != EVENT_FILTER_TYPE_SCHEMATIZED) {
+    etw_filter->clear();
+    UpdateETWEnabled(is_etw_enabled_now);
+    return;
+  }
+
+  if (is_etw_enabled) return;
+
+  if (filter_data->Size <= sizeof(EVENT_FILTER_DESCRIPTOR)) {
+    return;  // Invalid data
+  }
+
+  EVENT_FILTER_HEADER* filter_event_header =
+      reinterpret_cast<EVENT_FILTER_HEADER*>(filter_data->Ptr);
+  if (filter_event_header->Size < sizeof(EVENT_FILTER_HEADER)) {
+    return;  // Invalid data
+  }
+
+  const uint8_t* payload_start =
+      reinterpret_cast<uint8_t*>(filter_event_header) +
+      sizeof(EVENT_FILTER_HEADER);
+  const size_t payload_size =
+      filter_event_header->Size - sizeof(EVENT_FILTER_HEADER);
+  etw_filter->assign(payload_start, payload_start + payload_size);
+  is_etw_enabled = is_etw_enabled_now;
+  IsolateLoadScriptData::EnableLogWithFilterDataOnAllIsolates(
+      reinterpret_cast<const uint8_t*>(etw_filter->data()), etw_filter->size());
 }
 
 void Register() {
@@ -288,24 +364,32 @@ void EventHandler(const JitCodeEvent* event) {
 
   std::wstring method_name = GetScriptMethodName(event);
 
+  // No heap allocations after this point.
+  DisallowGarbageCollection no_gc;
+
   v8::Isolate* script_context = event->isolate;
-  v8::Local<v8::UnboundScript> script = event->script;
+  Isolate* isolate = reinterpret_cast<Isolate*>(script_context);
+
   int script_id = 0;
-  if (!script.IsEmpty()) {
-    // if the first time seeing this source file, log the SourceLoad event
-    script_id = script->GetId();
+  uint32_t script_line = -1;
+  uint32_t script_column = -1;
+
+  SharedFunctionInfo sfi = GetSharedFunctionInfo(event);
+  if (!sfi.is_null() && IsScript(sfi.script())) {
+    Script script = Script::cast(sfi.script());
 
-    auto isolate = reinterpret_cast<Isolate*>(script_context);
+    // if the first time seeing this source file, log the SourceLoad event
+    script_id = script.id();
     if (IsolateLoadScriptData::MaybeAddLoadedScript(isolate, script_id)) {
-      v8::Local<v8::Value> script_name = script->GetScriptName();
       std::wstring wstr_name(0, L'\0');
-      if (script_name->IsString()) {
-        auto v8str_name = script_name.As<v8::String>();
-        wstr_name.resize(v8str_name->Length());
+      Object script_name = script.GetNameOrSourceURL();
+      if (IsString(script_name)) {
+        String v8str_name = String::cast(script_name);
+        wstr_name.resize(v8str_name.length());
         // On Windows wchar_t == uint16_t. const_Cast needed for C++14.
         uint16_t* wstr_data = const_cast<uint16_t*>(
             reinterpret_cast<const uint16_t*>(wstr_name.data()));
-        v8str_name->Write(event->isolate, wstr_data);
+        String::WriteToFlat(v8str_name, wstr_data, 0, v8str_name.length());
       }
 
       constexpr static auto source_load_event_meta =
@@ -320,6 +404,11 @@ void EventHandler(const JitCodeEvent* event) {
                    (uint32_t)0,  // SourceFlags
                    wstr_name);
     }
+
+    Script::PositionInfo info;
+    script.GetPositionInfo(sfi.StartPosition(), &info);
+    script_line = info.line + 1;
+    script_column = info.column + 1;
   }
 
   constexpr static auto method_load_event_meta =
@@ -332,13 +421,13 @@ void EventHandler(const JitCodeEvent* event) {
       Field("MethodAddressRangeID", TlgInUINT16),
       Field("SourceID", TlgInUINT64), Field("Line", TlgInUINT32),
       Field("Column", TlgInUINT32), Field("MethodName", TlgInUNICODESTRING));
+
   LogEventData(g_v8Provider, &method_load_event_meta, &method_load_event_fields,
                script_context, event->code_start, (uint64_t)event->code_len,
                (uint32_t)0,  // MethodId
                (uint16_t)0,  // MethodFlags
                (uint16_t)0,  // MethodAddressRangeId
-               (uint64_t)script_id, (uint32_t)GetScriptLineNumber(event),
-               (uint32_t)GetScriptColumnNumber(event), method_name);
+               (uint64_t)script_id, script_line, script_column, method_name);
 }
 
 }  // namespace ETWJITInterface
diff --git a/deps/v8/src/diagnostics/etw-jit-win.h b/deps/v8/src/diagnostics/etw-jit-win.h
index 324b6ad1c2efa6..e1d835591eb423 100644
--- a/deps/v8/src/diagnostics/etw-jit-win.h
+++ b/deps/v8/src/diagnostics/etw-jit-win.h
@@ -23,12 +23,7 @@ void Unregister();
 void AddIsolate(Isolate* isolate);
 void RemoveIsolate(Isolate* isolate);
 void EventHandler(const v8::JitCodeEvent* event);
-void EnableETWLog(Isolate* isolate);
-V8_INLINE void MaybeSetHandlerNow(Isolate* isolate) {
-  if (is_etw_enabled) {
-    EnableETWLog(isolate);
-  }
-}
+void MaybeSetHandlerNow(Isolate* isolate);
 }  // namespace ETWJITInterface
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/diagnostics/gdb-jit.cc b/deps/v8/src/diagnostics/gdb-jit.cc
index 83d69ae72dd3bb..efeb95f81a85d7 100644
--- a/deps/v8/src/diagnostics/gdb-jit.cc
+++ b/deps/v8/src/diagnostics/gdb-jit.cc
@@ -54,7 +54,7 @@ class Writer {
       : debug_object_(debug_object),
         position_(0),
         capacity_(1024),
-        buffer_(reinterpret_cast<byte*>(base::Malloc(capacity_))) {}
+        buffer_(reinterpret_cast<uint8_t*>(base::Malloc(capacity_))) {}
 
   ~Writer() { base::Free(buffer_); }
 
@@ -107,13 +107,13 @@ class Writer {
   void Ensure(uintptr_t pos) {
     if (capacity_ < pos) {
       while (capacity_ < pos) capacity_ *= 2;
-      buffer_ = reinterpret_cast<byte*>(base::Realloc(buffer_, capacity_));
+      buffer_ = reinterpret_cast<uint8_t*>(base::Realloc(buffer_, capacity_));
     }
   }
 
   DebugObject* debug_object() { return debug_object_; }
 
-  byte* buffer() { return buffer_; }
+  uint8_t* buffer() { return buffer_; }
 
   void Align(uintptr_t align) {
     uintptr_t delta = position_ % align;
@@ -174,7 +174,7 @@ class Writer {
   DebugObject* debug_object_;
   uintptr_t position_;
   uintptr_t capacity_;
-  byte* buffer_;
+  uint8_t* buffer_;
 };
 
 class ELFStringTable;
@@ -927,7 +927,7 @@ class CodeDescription {
 
   ScopeInfo scope_info() const {
     DCHECK(has_scope_info());
-    return shared_info_.scope_info();
+    return shared_info_->scope_info();
   }
 
   uintptr_t CodeStart() const { return code_region_.begin(); }
@@ -937,10 +937,10 @@ class CodeDescription {
   uintptr_t CodeSize() const { return code_region_.size(); }
 
   bool has_script() {
-    return !shared_info_.is_null() && shared_info_.script().IsScript();
+    return !shared_info_.is_null() && IsScript(shared_info_->script());
   }
 
-  Script script() { return Script::cast(shared_info_.script()); }
+  Script script() { return Script::cast(shared_info_->script()); }
 
   bool IsLineInfoAvailable() { return lineinfo_ != nullptr; }
 
@@ -959,8 +959,8 @@ class CodeDescription {
 #endif
 
   std::unique_ptr<char[]> GetFilename() {
-    if (!shared_info_.is_null() && script().name().IsString()) {
-      return String::cast(script().name()).ToCString();
+    if (!shared_info_.is_null() && IsString(script()->name())) {
+      return String::cast(script()->name())->ToCString();
     } else {
       std::unique_ptr<char[]> result(new char[1]);
       result[0] = 0;
@@ -970,7 +970,7 @@ class CodeDescription {
 
   int GetScriptLineNumber(int pos) {
     if (!shared_info_.is_null()) {
-      return script().GetLineNumber(pos) + 1;
+      return script()->GetLineNumber(pos) + 1;
     } else {
       return 0;
     }
@@ -1105,10 +1105,10 @@ class DebugInfoSection : public DebugSection {
 #endif
       fb_block_size.set(static_cast<uint32_t>(w->position() - fb_block_start));
 
-      int params = scope.ParameterCount();
-      int context_slots = scope.ContextLocalCount();
+      int params = scope->ParameterCount();
+      int context_slots = scope->ContextLocalCount();
       // The real slot ID is internal_slots + context_slot_id.
-      int internal_slots = scope.ContextHeaderLength();
+      int internal_slots = scope->ContextHeaderLength();
       int current_abbreviation = 4;
 
       for (int param = 0; param < params; ++param) {
@@ -1266,8 +1266,8 @@ class DebugAbbrevSection : public DebugSection {
 
     if (extra_info) {
       ScopeInfo scope = desc_->scope_info();
-      int params = scope.ParameterCount();
-      int context_slots = scope.ContextLocalCount();
+      int params = scope->ParameterCount();
+      int context_slots = scope->ContextLocalCount();
       // The real slot ID is internal_slots + context_slot_id.
       int internal_slots = Context::MIN_CONTEXT_SLOTS;
       // Total children is params + context_slots + internal_slots + 2
@@ -1749,7 +1749,7 @@ JITDescriptor __jit_debug_descriptor = {1, 0, nullptr, nullptr};
 #ifdef OBJECT_PRINT
 void __gdb_print_v8_object(Object object) {
   StdoutStream os;
-  object.Print(os);
+  Print(object, os);
   os << std::flush;
 }
 #endif
@@ -1993,7 +1993,7 @@ static void AddJITCodeEntry(CodeMap* map, const base::AddressRegion region,
     SNPrintF(base::Vector<char>(file_name, kMaxFileNameSize),
              "/tmp/elfdump%s%d.o", (name_hint != nullptr) ? name_hint : "",
              file_num++);
-    WriteBytes(file_name, reinterpret_cast<byte*>(entry->symfile_addr_),
+    WriteBytes(file_name, reinterpret_cast<uint8_t*>(entry->symfile_addr_),
                static_cast<int>(entry->symfile_size_));
   }
 #endif
@@ -2052,7 +2052,7 @@ void EventHandler(const v8::JitCodeEvent* event) {
       std::string event_name(event->name.str, event->name.len);
       // It's called UnboundScript in the API but it's a SharedFunctionInfo.
       SharedFunctionInfo shared = event->script.IsEmpty()
-                                      ? SharedFunctionInfo()
+                                      ? Tagged<SharedFunctionInfo>()
                                       : *Utils::OpenHandle(*event->script);
       Isolate* isolate = reinterpret_cast<Isolate*>(event->isolate);
       bool is_function = false;
@@ -2065,7 +2065,7 @@ void EventHandler(const v8::JitCodeEvent* event) {
       // TODO(zhin): Rename is_function to be more accurate.
       if (event->code_type == v8::JitCodeEvent::JIT_CODE) {
         Code lookup_result = isolate->heap()->FindCodeForInnerPointer(addr);
-        is_function = CodeKindIsOptimizedJSFunction(lookup_result.kind());
+        is_function = CodeKindIsOptimizedJSFunction(lookup_result->kind());
       }
       AddCode(event_name.c_str(), {addr, event->code_len}, shared, lineinfo,
               isolate, is_function);
diff --git a/deps/v8/src/diagnostics/ia32/disasm-ia32.cc b/deps/v8/src/diagnostics/ia32/disasm-ia32.cc
index 5f19dd03e0629e..92929b09177ab2 100644
--- a/deps/v8/src/diagnostics/ia32/disasm-ia32.cc
+++ b/deps/v8/src/diagnostics/ia32/disasm-ia32.cc
@@ -115,7 +115,7 @@ struct InstructionDesc {
 class InstructionTable {
  public:
   InstructionTable();
-  const InstructionDesc& Get(byte x) const { return instructions_[x]; }
+  const InstructionDesc& Get(uint8_t x) const { return instructions_[x]; }
   static InstructionTable* get_instance() {
     static InstructionTable table;
     return &table;
@@ -126,7 +126,7 @@ class InstructionTable {
   void Clear();
   void Init();
   void CopyTable(const ByteMnemonic bm[], InstructionType type);
-  void SetTableRange(InstructionType type, byte start, byte end,
+  void SetTableRange(InstructionType type, uint8_t start, uint8_t end,
                      const char* mnem);
   void AddJumpConditionalShort();
 };
@@ -170,9 +170,9 @@ void InstructionTable::CopyTable(const ByteMnemonic bm[],
   }
 }
 
-void InstructionTable::SetTableRange(InstructionType type, byte start, byte end,
-                                     const char* mnem) {
-  for (byte b = start; b <= end; b++) {
+void InstructionTable::SetTableRange(InstructionType type, uint8_t start,
+                                     uint8_t end, const char* mnem) {
+  for (uint8_t b = start; b <= end; b++) {
     InstructionDesc* id = &instructions_[b];
     DCHECK_EQ(NO_INSTR, id->type);  // Information not already entered.
     id->mnem = mnem;
@@ -181,7 +181,7 @@ void InstructionTable::SetTableRange(InstructionType type, byte start, byte end,
 }
 
 void InstructionTable::AddJumpConditionalShort() {
-  for (byte b = 0x70; b <= 0x7F; b++) {
+  for (uint8_t b = 0x70; b <= 0x7F; b++) {
     InstructionDesc* id = &instructions_[b];
     DCHECK_EQ(NO_INSTR, id->type);  // Information not already entered.
     id->mnem = jump_conditional_mnem[b & 0x0F];
@@ -227,13 +227,13 @@ class DisassemblerIA32 {
 
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
-  int InstructionDecode(v8::base::Vector<char> buffer, byte* instruction);
+  int InstructionDecode(v8::base::Vector<char> buffer, uint8_t* instruction);
 
  private:
   const NameConverter& converter_;
-  byte vex_byte0_;  // 0xC4 or 0xC5
-  byte vex_byte1_;
-  byte vex_byte2_;  // only for 3 bytes vex prefix
+  uint8_t vex_byte0_;  // 0xC4 or 0xC5
+  uint8_t vex_byte1_;
+  uint8_t vex_byte2_;  // only for 3 bytes vex prefix
   InstructionTable* instruction_table_;
   v8::base::EmbeddedVector<char, 128> tmp_buffer_;
   unsigned int tmp_buffer_pos_;
@@ -262,31 +262,31 @@ class DisassemblerIA32 {
 
   bool vex_128() {
     DCHECK(vex_byte0_ == 0xC4 || vex_byte0_ == 0xC5);
-    byte checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
     return (checked & 4) == 0;
   }
 
   bool vex_none() {
     DCHECK(vex_byte0_ == 0xC4 || vex_byte0_ == 0xC5);
-    byte checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
     return (checked & 3) == 0;
   }
 
   bool vex_66() {
     DCHECK(vex_byte0_ == 0xC4 || vex_byte0_ == 0xC5);
-    byte checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
     return (checked & 3) == 1;
   }
 
   bool vex_f3() {
     DCHECK(vex_byte0_ == 0xC4 || vex_byte0_ == 0xC5);
-    byte checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
     return (checked & 3) == 2;
   }
 
   bool vex_f2() {
     DCHECK(vex_byte0_ == 0xC4 || vex_byte0_ == 0xC5);
-    byte checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
     return (checked & 3) == 3;
   }
 
@@ -312,7 +312,7 @@ class DisassemblerIA32 {
 
   int vex_vreg() {
     DCHECK(vex_byte0_ == 0xC4 || vex_byte0_ == 0xC5);
-    byte checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == 0xC4 ? vex_byte2_ : vex_byte1_;
     return ~(checked >> 3) & 0xF;
   }
 
@@ -330,18 +330,18 @@ class DisassemblerIA32 {
     return converter_.NameOfXMMRegister(reg);
   }
 
-  const char* NameOfAddress(byte* addr) const {
+  const char* NameOfAddress(uint8_t* addr) const {
     return converter_.NameOfAddress(addr);
   }
 
   // Disassembler helper functions.
-  static void get_modrm(byte data, int* mod, int* regop, int* rm) {
+  static void get_modrm(uint8_t data, int* mod, int* regop, int* rm) {
     *mod = (data >> 6) & 3;
     *regop = (data & 0x38) >> 3;
     *rm = data & 7;
   }
 
-  static void get_sib(byte data, int* scale, int* index, int* base) {
+  static void get_sib(uint8_t data, int* scale, int* index, int* base) {
     *scale = (data >> 6) & 3;
     *index = (data >> 3) & 7;
     *base = data & 7;
@@ -349,23 +349,24 @@ class DisassemblerIA32 {
 
   using RegisterNameMapping = const char* (DisassemblerIA32::*)(int reg) const;
 
-  int PrintRightOperandHelper(byte* modrmp, RegisterNameMapping register_name);
-  int PrintRightOperand(byte* modrmp);
-  int PrintRightByteOperand(byte* modrmp);
-  int PrintRightXMMOperand(byte* modrmp);
-  int PrintOperands(const char* mnem, OperandOrder op_order, byte* data);
-  int PrintImmediateOp(byte* data);
-  int F7Instruction(byte* data);
-  int D1D3C1Instruction(byte* data);
-  int JumpShort(byte* data);
-  int JumpConditional(byte* data, const char* comment);
-  int JumpConditionalShort(byte* data, const char* comment);
-  int SetCC(byte* data);
-  int CMov(byte* data);
-  int FPUInstruction(byte* data);
-  int MemoryFPUInstruction(int escape_opcode, int regop, byte* modrm_start);
-  int RegisterFPUInstruction(int escape_opcode, byte modrm_byte);
-  int AVXInstruction(byte* data);
+  int PrintRightOperandHelper(uint8_t* modrmp,
+                              RegisterNameMapping register_name);
+  int PrintRightOperand(uint8_t* modrmp);
+  int PrintRightByteOperand(uint8_t* modrmp);
+  int PrintRightXMMOperand(uint8_t* modrmp);
+  int PrintOperands(const char* mnem, OperandOrder op_order, uint8_t* data);
+  int PrintImmediateOp(uint8_t* data);
+  int F7Instruction(uint8_t* data);
+  int D1D3C1Instruction(uint8_t* data);
+  int JumpShort(uint8_t* data);
+  int JumpConditional(uint8_t* data, const char* comment);
+  int JumpConditionalShort(uint8_t* data, const char* comment);
+  int SetCC(uint8_t* data);
+  int CMov(uint8_t* data);
+  int FPUInstruction(uint8_t* data);
+  int MemoryFPUInstruction(int escape_opcode, int regop, uint8_t* modrm_start);
+  int RegisterFPUInstruction(int escape_opcode, uint8_t modrm_byte);
+  int AVXInstruction(uint8_t* data);
   PRINTF_FORMAT(2, 3) void AppendToBuffer(const char* format, ...);
 
   void UnimplementedInstruction() {
@@ -388,7 +389,7 @@ void DisassemblerIA32::AppendToBuffer(const char* format, ...) {
 }
 
 int DisassemblerIA32::PrintRightOperandHelper(
-    byte* modrmp, RegisterNameMapping direct_register_name) {
+    uint8_t* modrmp, RegisterNameMapping direct_register_name) {
   int mod, regop, rm;
   get_modrm(*modrmp, &mod, &regop, &rm);
   RegisterNameMapping register_name =
@@ -399,7 +400,7 @@ int DisassemblerIA32::PrintRightOperandHelper(
         AppendToBuffer("[0x%x]", Imm32(modrmp + 1));
         return 5;
       } else if (rm == esp) {
-        byte sib = *(modrmp + 1);
+        uint8_t sib = *(modrmp + 1);
         int scale, index, base;
         get_sib(sib, &scale, &index, &base);
         if (index == esp && base == esp && scale == 0 /*times_1*/) {
@@ -426,7 +427,7 @@ int DisassemblerIA32::PrintRightOperandHelper(
     case 1:  // fall through
     case 2: {
       if (rm == esp) {
-        byte sib = *(modrmp + 1);
+        uint8_t sib = *(modrmp + 1);
         int scale, index, base;
         get_sib(sib, &scale, &index, &base);
         int disp = mod == 2 ? Imm32(modrmp + 2) : Imm8(modrmp + 2);
@@ -456,24 +457,24 @@ int DisassemblerIA32::PrintRightOperandHelper(
   UNREACHABLE();
 }
 
-int DisassemblerIA32::PrintRightOperand(byte* modrmp) {
+int DisassemblerIA32::PrintRightOperand(uint8_t* modrmp) {
   return PrintRightOperandHelper(modrmp, &DisassemblerIA32::NameOfCPURegister);
 }
 
-int DisassemblerIA32::PrintRightByteOperand(byte* modrmp) {
+int DisassemblerIA32::PrintRightByteOperand(uint8_t* modrmp) {
   return PrintRightOperandHelper(modrmp,
                                  &DisassemblerIA32::NameOfByteCPURegister);
 }
 
-int DisassemblerIA32::PrintRightXMMOperand(byte* modrmp) {
+int DisassemblerIA32::PrintRightXMMOperand(uint8_t* modrmp) {
   return PrintRightOperandHelper(modrmp, &DisassemblerIA32::NameOfXMMRegister);
 }
 
 // Returns number of bytes used including the current *data.
 // Writes instruction's mnemonic, left and right operands to 'tmp_buffer_'.
 int DisassemblerIA32::PrintOperands(const char* mnem, OperandOrder op_order,
-                                    byte* data) {
-  byte modrm = *data;
+                                    uint8_t* data) {
+  uint8_t modrm = *data;
   int mod, regop, rm;
   get_modrm(modrm, &mod, &regop, &rm);
   int advance = 0;
@@ -497,9 +498,9 @@ int DisassemblerIA32::PrintOperands(const char* mnem, OperandOrder op_order,
 
 // Returns number of bytes used by machine instruction, including *data byte.
 // Writes immediate instructions to 'tmp_buffer_'.
-int DisassemblerIA32::PrintImmediateOp(byte* data) {
+int DisassemblerIA32::PrintImmediateOp(uint8_t* data) {
   bool sign_extension_bit = (*data & 0x02) != 0;
-  byte modrm = *(data + 1);
+  uint8_t modrm = *(data + 1);
   int mod, regop, rm;
   get_modrm(modrm, &mod, &regop, &rm);
   const char* mnem = "Imm???";
@@ -540,9 +541,9 @@ int DisassemblerIA32::PrintImmediateOp(byte* data) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerIA32::F7Instruction(byte* data) {
+int DisassemblerIA32::F7Instruction(uint8_t* data) {
   DCHECK_EQ(0xF7, *data);
-  byte modrm = *++data;
+  uint8_t modrm = *++data;
   int mod, regop, rm;
   get_modrm(modrm, &mod, &regop, &rm);
   const char* mnem = "";
@@ -580,10 +581,10 @@ int DisassemblerIA32::F7Instruction(byte* data) {
   return 1 + count;
 }
 
-int DisassemblerIA32::D1D3C1Instruction(byte* data) {
-  byte op = *data;
+int DisassemblerIA32::D1D3C1Instruction(uint8_t* data) {
+  uint8_t op = *data;
   DCHECK(op == 0xD1 || op == 0xD3 || op == 0xC1);
-  byte modrm = *++data;
+  uint8_t modrm = *++data;
   int mod, regop, rm;
   get_modrm(modrm, &mod, &regop, &rm);
   int imm8 = -1;
@@ -632,19 +633,19 @@ int DisassemblerIA32::D1D3C1Instruction(byte* data) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerIA32::JumpShort(byte* data) {
+int DisassemblerIA32::JumpShort(uint8_t* data) {
   DCHECK_EQ(0xEB, *data);
-  byte b = *(data + 1);
-  byte* dest = data + static_cast<int8_t>(b) + 2;
+  uint8_t b = *(data + 1);
+  uint8_t* dest = data + static_cast<int8_t>(b) + 2;
   AppendToBuffer("jmp %s", NameOfAddress(dest));
   return 2;
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerIA32::JumpConditional(byte* data, const char* comment) {
+int DisassemblerIA32::JumpConditional(uint8_t* data, const char* comment) {
   DCHECK_EQ(0x0F, *data);
-  byte cond = *(data + 1) & 0x0F;
-  byte* dest = data + Imm32(data + 2) + 6;
+  uint8_t cond = *(data + 1) & 0x0F;
+  uint8_t* dest = data + Imm32(data + 2) + 6;
   const char* mnem = jump_conditional_mnem[cond];
   AppendToBuffer("%s %s", mnem, NameOfAddress(dest));
   if (comment != nullptr) {
@@ -654,10 +655,10 @@ int DisassemblerIA32::JumpConditional(byte* data, const char* comment) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerIA32::JumpConditionalShort(byte* data, const char* comment) {
-  byte cond = *data & 0x0F;
-  byte b = *(data + 1);
-  byte* dest = data + static_cast<int8_t>(b) + 2;
+int DisassemblerIA32::JumpConditionalShort(uint8_t* data, const char* comment) {
+  uint8_t cond = *data & 0x0F;
+  uint8_t b = *(data + 1);
+  uint8_t* dest = data + static_cast<int8_t>(b) + 2;
   const char* mnem = jump_conditional_mnem[cond];
   AppendToBuffer("%s %s", mnem, NameOfAddress(dest));
   if (comment != nullptr) {
@@ -667,9 +668,9 @@ int DisassemblerIA32::JumpConditionalShort(byte* data, const char* comment) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerIA32::SetCC(byte* data) {
+int DisassemblerIA32::SetCC(uint8_t* data) {
   DCHECK_EQ(0x0F, *data);
-  byte cond = *(data + 1) & 0x0F;
+  uint8_t cond = *(data + 1) & 0x0F;
   const char* mnem = set_conditional_mnem[cond];
   AppendToBuffer("%s ", mnem);
   PrintRightByteOperand(data + 2);
@@ -677,9 +678,9 @@ int DisassemblerIA32::SetCC(byte* data) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerIA32::CMov(byte* data) {
+int DisassemblerIA32::CMov(uint8_t* data) {
   DCHECK_EQ(0x0F, *data);
-  byte cond = *(data + 1) & 0x0F;
+  uint8_t cond = *(data + 1) & 0x0F;
   const char* mnem = conditional_move_mnem[cond];
   int op_size = PrintOperands(mnem, REG_OPER_OP_ORDER, data + 2);
   return 2 + op_size;  // includes 0x0F
@@ -687,9 +688,9 @@ int DisassemblerIA32::CMov(byte* data) {
 
 const char* sf_str[4] = {"", "rl", "ra", "ll"};
 
-int DisassemblerIA32::AVXInstruction(byte* data) {
-  byte opcode = *data;
-  byte* current = data + 1;
+int DisassemblerIA32::AVXInstruction(uint8_t* data) {
+  uint8_t opcode = *data;
+  uint8_t* current = data + 1;
   if (vex_66() && vex_0f38()) {
     int mod, regop, rm, vvvv = vex_vreg();
     get_modrm(*current, &mod, &regop, &rm);
@@ -1406,10 +1407,10 @@ int DisassemblerIA32::AVXInstruction(byte* data) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerIA32::FPUInstruction(byte* data) {
-  byte escape_opcode = *data;
+int DisassemblerIA32::FPUInstruction(uint8_t* data) {
+  uint8_t escape_opcode = *data;
   DCHECK_EQ(0xD8, escape_opcode & 0xF8);
-  byte modrm_byte = *(data + 1);
+  uint8_t modrm_byte = *(data + 1);
 
   if (modrm_byte >= 0xC0) {
     return RegisterFPUInstruction(escape_opcode, modrm_byte);
@@ -1419,7 +1420,7 @@ int DisassemblerIA32::FPUInstruction(byte* data) {
 }
 
 int DisassemblerIA32::MemoryFPUInstruction(int escape_opcode, int modrm_byte,
-                                           byte* modrm_start) {
+                                           uint8_t* modrm_start) {
   const char* mnem = "?";
   int regop = (modrm_byte >> 3) & 0x7;  // reg/op field of modrm byte.
   switch (escape_opcode) {
@@ -1502,7 +1503,7 @@ int DisassemblerIA32::MemoryFPUInstruction(int escape_opcode, int modrm_byte,
 }
 
 int DisassemblerIA32::RegisterFPUInstruction(int escape_opcode,
-                                             byte modrm_byte) {
+                                             uint8_t modrm_byte) {
   bool has_register = false;  // Is the FPU register encoded in modrm_byte?
   const char* mnem = "?";
 
@@ -1701,7 +1702,7 @@ int DisassemblerIA32::RegisterFPUInstruction(int escape_opcode,
 
 // Mnemonics for instructions 0xF0 byte.
 // Returns nullptr if the instruction is not handled here.
-static const char* F0Mnem(byte f0byte) {
+static const char* F0Mnem(uint8_t f0byte) {
   switch (f0byte) {
     case 0x0B:
       return "ud2";
@@ -1746,9 +1747,9 @@ static const char* F0Mnem(byte f0byte) {
 
 // Disassembled instruction '*instr' and writes it into 'out_buffer'.
 int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
-                                        byte* instr) {
+                                        uint8_t* instr) {
   tmp_buffer_pos_ = 0;  // starting to write as position 0
-  byte* data = instr;
+  uint8_t* data = instr;
   // Check for hints.
   const char* branch_hint = nullptr;
   // We use these two prefixes only with branch prediction
@@ -1800,7 +1801,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
         break;
 
       case MOVE_REG_INSTR: {
-        byte* addr = reinterpret_cast<byte*>(Imm32(data + 1));
+        uint8_t* addr = reinterpret_cast<uint8_t*>(Imm32(data + 1));
         AppendToBuffer("mov %s,%s", NameOfCPURegister(*data & 0x07),
                        NameOfAddress(addr));
         data += 5;
@@ -1808,14 +1809,14 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
       }
 
       case CALL_JUMP_INSTR: {
-        byte* addr = data + Imm32(data + 1) + 5;
+        uint8_t* addr = data + Imm32(data + 1) + 5;
         AppendToBuffer("%s %s", idesc.mnem, NameOfAddress(addr));
         data += 5;
         break;
       }
 
       case SHORT_IMMEDIATE_INSTR: {
-        byte* addr = reinterpret_cast<byte*>(Imm32(data + 1));
+        uint8_t* addr = reinterpret_cast<uint8_t*>(Imm32(data + 1));
         AppendToBuffer("%s eax,%s", idesc.mnem, NameOfAddress(addr));
         data += 5;
         break;
@@ -1878,7 +1879,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
         break;
 
       case 0x0F: {
-        byte f0byte = data[1];
+        uint8_t f0byte = data[1];
         const char* f0mnem = F0Mnem(f0byte);
         int mod, regop, rm;
         // Not every instruction use this, and it is safe to index data+2 as all
@@ -2220,7 +2221,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
             data += PrintRightXMMOperand(data);
           } else if (*data == 0x38) {
             data++;
-            byte op = *data;
+            uint8_t op = *data;
             data++;
             int mod, regop, rm;
             get_modrm(*data, &mod, &regop, &rm);
@@ -2268,7 +2269,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
                   "roundss",
                   "roundsd",
               };
-              byte op = *data;
+              uint8_t op = *data;
               data++;
               int mod, regop, rm;
               get_modrm(*data, &mod, &regop, &rm);
@@ -2376,7 +2377,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
             const char* const pseudo_op[] = {"andpd",   "andnpd", "orpd",
                                              "xorpd",   "addpd",  "mulpd",
                                              "cvtpd2ps"};
-            byte op = *data;
+            uint8_t op = *data;
             data++;
             int mod, regop, rm;
             get_modrm(*data, &mod, &regop, &rm);
@@ -2390,7 +2391,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
                 "divpd",
                 "maxpd",
             };
-            byte op = *data;
+            uint8_t op = *data;
             data++;
             int mod, regop, rm;
             get_modrm(*data, &mod, &regop, &rm);
@@ -2514,7 +2515,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
                            NameOfXMMRegister(rm));
             data++;
           } else {
-            byte op = *data;
+            uint8_t op = *data;
             data++;
             int mod, regop, rm;
             get_modrm(*data, &mod, &regop, &rm);
@@ -2592,7 +2593,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
 
       case 0xF2:
         if (*(data + 1) == 0x0F) {
-          byte b2 = *(data + 2);
+          uint8_t b2 = *(data + 2);
           if (b2 == 0x11) {
             AppendToBuffer("movsd ");
             data += 3;
@@ -2675,7 +2676,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
 
       case 0xF3:
         if (*(data + 1) == 0x0F) {
-          byte b2 = *(data + 2);
+          uint8_t b2 = *(data + 2);
           if (b2 == 0x11) {
             AppendToBuffer("movss ");
             data += 3;
@@ -2841,7 +2842,7 @@ int DisassemblerIA32::InstructionDecode(v8::base::Vector<char> out_buffer,
 
   int outp = 0;
   // Instruction bytes.
-  for (byte* bp = instr; bp < data; bp++) {
+  for (uint8_t* bp = instr; bp < data; bp++) {
     outp += v8::base::SNPrintF(out_buffer + outp, "%02x", *bp);
   }
   // Indent instruction, leaving space for 6 bytes, i.e. 12 characters in hex.
@@ -2864,12 +2865,12 @@ static const char* const byte_cpu_regs[8] = {"al", "cl", "dl", "bl",
 static const char* const xmm_regs[8] = {"xmm0", "xmm1", "xmm2", "xmm3",
                                         "xmm4", "xmm5", "xmm6", "xmm7"};
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -2888,7 +2889,7 @@ const char* NameConverter::NameOfXMMRegister(int reg) const {
   return "noxmmreg";
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // IA32 does not embed debug strings at the moment.
   UNREACHABLE();
 }
@@ -2896,28 +2897,28 @@ const char* NameConverter::NameInCode(byte* addr) const {
 //------------------------------------------------------------------------------
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instruction) {
+                                    uint8_t* instruction) {
   DisassemblerIA32 d(converter_, unimplemented_opcode_action());
   return d.InstructionDecode(buffer, instruction);
 }
 
 // The IA-32 assembler does not currently use constant pools.
-int Disassembler::ConstantPoolSizeAt(byte* instruction) { return -1; }
+int Disassembler::ConstantPoolSizeAt(uint8_t* instruction) { return -1; }
 
 // static
-void Disassembler::Disassemble(FILE* f, byte* begin, byte* end,
+void Disassembler::Disassemble(FILE* f, uint8_t* begin, uint8_t* end,
                                UnimplementedOpcodeAction unimplemented_action) {
   NameConverter converter;
   Disassembler d(converter, unimplemented_action);
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     v8::base::EmbeddedVector<char, 128> buffer;
     buffer[0] = '\0';
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     pc += d.InstructionDecode(buffer, pc);
     fprintf(f, "%p", static_cast<void*>(prev_pc));
     fprintf(f, "    ");
 
-    for (byte* bp = prev_pc; bp < pc; bp++) {
+    for (uint8_t* bp = prev_pc; bp < pc; bp++) {
       fprintf(f, "%02x", *bp);
     }
     for (int i = 6 - (pc - prev_pc); i >= 0; i--) {
diff --git a/deps/v8/src/diagnostics/loong64/disasm-loong64.cc b/deps/v8/src/diagnostics/loong64/disasm-loong64.cc
index 9d8aee96a3a367..ed036ee54a6ce9 100644
--- a/deps/v8/src/diagnostics/loong64/disasm-loong64.cc
+++ b/deps/v8/src/diagnostics/loong64/disasm-loong64.cc
@@ -39,7 +39,7 @@ class Decoder {
 
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
-  int InstructionDecode(byte* instruction);
+  int InstructionDecode(uint8_t* instruction);
 
  private:
   // Bottleneck functions to print into the out_buffer.
@@ -297,7 +297,7 @@ void Decoder::PrintPCOffs16(Instruction* instr) {
                (32 - kOffsLowBits - n_bits);
   out_buffer_pos_ += base::SNPrintF(
       out_buffer_ + out_buffer_pos_, "%s",
-      converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + target));
+      converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + target));
 }
 
 void Decoder::PrintPCOffs21(Instruction* instr) {
@@ -308,7 +308,7 @@ void Decoder::PrintPCOffs21(Instruction* instr) {
       (32 - kOffsLowBits - kOffs21HighBits - n_bits);
   out_buffer_pos_ += base::SNPrintF(
       out_buffer_ + out_buffer_pos_, "%s",
-      converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + target));
+      converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + target));
 }
 
 void Decoder::PrintPCOffs26(Instruction* instr) {
@@ -319,7 +319,7 @@ void Decoder::PrintPCOffs26(Instruction* instr) {
       (32 - kOffsLowBits - kOffs26HighBits - n_bits);
   out_buffer_pos_ += base::SNPrintF(
       out_buffer_ + out_buffer_pos_, "%s",
-      converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + target));
+      converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + target));
 }
 
 void Decoder::PrintOffs16(Instruction* instr) {
@@ -1598,7 +1598,7 @@ void Decoder::DecodeTypekOp22(Instruction* instr) {
   }
 }
 
-int Decoder::InstructionDecode(byte* instr_ptr) {
+int Decoder::InstructionDecode(uint8_t* instr_ptr) {
   Instruction* instr = Instruction::At(instr_ptr);
   out_buffer_pos_ += base::SNPrintF(out_buffer_ + out_buffer_pos_,
                                     "%08x       ", instr->InstructionBits());
@@ -1653,12 +1653,12 @@ int Decoder::InstructionDecode(byte* instr_ptr) {
 
 namespace disasm {
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -1674,7 +1674,7 @@ const char* NameConverter::NameOfByteCPURegister(int reg) const {
   UNREACHABLE();
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // The default name converter is called for unknown code. So we will not try
   // to access any memory.
   return "";
@@ -1683,21 +1683,21 @@ const char* NameConverter::NameInCode(byte* addr) const {
 //------------------------------------------------------------------------------
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instruction) {
+                                    uint8_t* instruction) {
   v8::internal::Decoder d(converter_, buffer);
   return d.InstructionDecode(instruction);
 }
 
-int Disassembler::ConstantPoolSizeAt(byte* instruction) { return -1; }
+int Disassembler::ConstantPoolSizeAt(uint8_t* instruction) { return -1; }
 
-void Disassembler::Disassemble(FILE* f, byte* begin, byte* end,
+void Disassembler::Disassemble(FILE* f, uint8_t* begin, uint8_t* end,
                                UnimplementedOpcodeAction unimplemented_action) {
   NameConverter converter;
   Disassembler d(converter, unimplemented_action);
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     v8::base::EmbeddedVector<char, 128> buffer;
     buffer[0] = '\0';
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     pc += d.InstructionDecode(buffer, pc);
     v8::internal::PrintF(f, "%p    %08x      %s\n", static_cast<void*>(prev_pc),
                          *reinterpret_cast<int32_t*>(prev_pc), buffer.begin());
diff --git a/deps/v8/src/diagnostics/mips64/disasm-mips64.cc b/deps/v8/src/diagnostics/mips64/disasm-mips64.cc
index 0712431fc3b8fb..fa80ad2519f873 100644
--- a/deps/v8/src/diagnostics/mips64/disasm-mips64.cc
+++ b/deps/v8/src/diagnostics/mips64/disasm-mips64.cc
@@ -10,9 +10,9 @@
 //
 //   NameConverter converter;
 //   Disassembler d(converter);
-//   for (byte* pc = begin; pc < end;) {
+//   for (uint8_t* pc = begin; pc < end;) {
 //     v8::base::EmbeddedVector<char, 256> buffer;
-//     byte* prev_pc = pc;
+//     uint8_t* prev_pc = pc;
 //     pc += d.InstructionDecode(buffer, pc);
 //     printf("%p    %08x      %s\n",
 //            prev_pc, *reinterpret_cast<int32_t*>(prev_pc), buffer);
@@ -59,7 +59,7 @@ class Decoder {
 
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
-  int InstructionDecode(byte* instruction);
+  int InstructionDecode(uint8_t* instruction);
 
  private:
   // Bottleneck functions to print into the out_buffer.
@@ -356,10 +356,10 @@ void Decoder::PrintXImm16(Instruction* instr) {
 //      PC + delta_pc + (offset << n_bits)
 void Decoder::PrintPCImm16(Instruction* instr, int delta_pc, int n_bits) {
   int16_t offset = instr->Imm16Value();
-  out_buffer_pos_ +=
-      base::SNPrintF(out_buffer_ + out_buffer_pos_, "%s",
-                     converter_.NameOfAddress(reinterpret_cast<byte*>(instr) +
-                                              delta_pc + (offset << n_bits)));
+  out_buffer_pos_ += base::SNPrintF(
+      out_buffer_ + out_buffer_pos_, "%s",
+      converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + delta_pc +
+                               (offset << n_bits)));
 }
 
 // Print 18-bit signed immediate value.
@@ -413,10 +413,10 @@ void Decoder::PrintPCImm21(Instruction* instr, int delta_pc, int n_bits) {
   // set sign
   imm21 <<= (32 - kImm21Bits);
   imm21 >>= (32 - kImm21Bits);
-  out_buffer_pos_ +=
-      base::SNPrintF(out_buffer_ + out_buffer_pos_, "%s",
-                     converter_.NameOfAddress(reinterpret_cast<byte*>(instr) +
-                                              delta_pc + (imm21 << n_bits)));
+  out_buffer_pos_ += base::SNPrintF(
+      out_buffer_ + out_buffer_pos_, "%s",
+      converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + delta_pc +
+                               (imm21 << n_bits)));
 }
 
 // Print 26-bit hex immediate value.
@@ -445,10 +445,10 @@ void Decoder::PrintPCImm26(Instruction* instr, int delta_pc, int n_bits) {
   // set sign
   imm26 <<= (32 - kImm26Bits);
   imm26 >>= (32 - kImm26Bits);
-  out_buffer_pos_ +=
-      base::SNPrintF(out_buffer_ + out_buffer_pos_, "%s",
-                     converter_.NameOfAddress(reinterpret_cast<byte*>(instr) +
-                                              delta_pc + (imm26 << n_bits)));
+  out_buffer_pos_ += base::SNPrintF(
+      out_buffer_ + out_buffer_pos_, "%s",
+      converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + delta_pc +
+                               (imm26 << n_bits)));
 }
 
 // Print absoulte address for 26-bit offset or immediate value.
@@ -458,9 +458,9 @@ void Decoder::PrintPCImm26(Instruction* instr) {
   int32_t imm26 = instr->Imm26Value();
   uint64_t pc_mask = ~0xFFFFFFF;
   uint64_t pc = ((uint64_t)(instr + 1) & pc_mask) | (imm26 << 2);
-  out_buffer_pos_ +=
-      base::SNPrintF(out_buffer_ + out_buffer_pos_, "%s",
-                     converter_.NameOfAddress((reinterpret_cast<byte*>(pc))));
+  out_buffer_pos_ += base::SNPrintF(
+      out_buffer_ + out_buffer_pos_, "%s",
+      converter_.NameOfAddress((reinterpret_cast<uint8_t*>(pc))));
 }
 
 void Decoder::PrintBp2(Instruction* instr) {
@@ -2934,7 +2934,7 @@ void Decoder::DecodeTypeMsa2RF(Instruction* instr) {
 // All instructions are one word long, except for the simulator
 // pseudo-instruction stop(msg). For that one special case, we return
 // size larger than one kInstrSize.
-int Decoder::InstructionDecode(byte* instr_ptr) {
+int Decoder::InstructionDecode(uint8_t* instr_ptr) {
   Instruction* instr = Instruction::At(instr_ptr);
   // Print raw instruction bytes.
   out_buffer_pos_ += base::SNPrintF(out_buffer_ + out_buffer_pos_,
@@ -2966,12 +2966,12 @@ int Decoder::InstructionDecode(byte* instr_ptr) {
 
 namespace disasm {
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -2987,7 +2987,7 @@ const char* NameConverter::NameOfByteCPURegister(int reg) const {
   UNREACHABLE();  // MIPS does not have the concept of a byte register.
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // The default name converter is called for unknown code. So we will not try
   // to access any memory.
   return "";
@@ -2996,22 +2996,22 @@ const char* NameConverter::NameInCode(byte* addr) const {
 //------------------------------------------------------------------------------
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instruction) {
+                                    uint8_t* instruction) {
   v8::internal::Decoder d(converter_, buffer);
   return d.InstructionDecode(instruction);
 }
 
 // The MIPS assembler does not currently use constant pools.
-int Disassembler::ConstantPoolSizeAt(byte* instruction) { return -1; }
+int Disassembler::ConstantPoolSizeAt(uint8_t* instruction) { return -1; }
 
-void Disassembler::Disassemble(FILE* f, byte* begin, byte* end,
+void Disassembler::Disassemble(FILE* f, uint8_t* begin, uint8_t* end,
                                UnimplementedOpcodeAction unimplemented_action) {
   NameConverter converter;
   Disassembler d(converter, unimplemented_action);
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     v8::base::EmbeddedVector<char, 128> buffer;
     buffer[0] = '\0';
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     pc += d.InstructionDecode(buffer, pc);
     v8::internal::PrintF(f, "%p    %08x      %s\n", static_cast<void*>(prev_pc),
                          *reinterpret_cast<int32_t*>(prev_pc), buffer.begin());
diff --git a/deps/v8/src/diagnostics/objects-debug.cc b/deps/v8/src/diagnostics/objects-debug.cc
index 17578d7855b753..3224b899b8a59b 100644
--- a/deps/v8/src/diagnostics/objects-debug.cc
+++ b/deps/v8/src/diagnostics/objects-debug.cc
@@ -2,6 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include "src/base/logging.h"
 #include "src/codegen/assembler-inl.h"
 #include "src/common/globals.h"
 #include "src/date/date.h"
@@ -66,6 +67,7 @@
 #include "src/objects/js-segmenter-inl.h"
 #include "src/objects/js-segments-inl.h"
 #endif  // V8_INTL_SUPPORT
+#include "src/objects/hole-inl.h"
 #include "src/objects/js-raw-json-inl.h"
 #include "src/objects/js-shared-array-inl.h"
 #include "src/objects/js-struct-inl.h"
@@ -127,85 +129,88 @@ namespace internal {
     TorqueGeneratedClassVerifiers::Class##Verify(*this, isolate); \
   }
 
-void Object::ObjectVerify(Isolate* isolate) {
+// static
+void Object::ObjectVerify(Tagged<Object> obj, Isolate* isolate) {
   RCS_SCOPE(isolate, RuntimeCallCounterId::kObjectVerify);
-  if (IsSmi()) {
-    Smi::cast(*this).SmiVerify(isolate);
+  if (IsSmi(obj)) {
+    Smi::SmiVerify(Smi::cast(obj), isolate);
   } else {
-    HeapObject::cast(*this).HeapObjectVerify(isolate);
+    HeapObject::cast(obj)->HeapObjectVerify(isolate);
   }
   PtrComprCageBase cage_base(isolate);
-  CHECK(!IsConstructor(cage_base) || IsCallable(cage_base));
+  CHECK(!IsConstructor(obj, cage_base) || IsCallable(obj, cage_base));
 }
 
-void Object::VerifyPointer(Isolate* isolate, Object p) {
-  if (p.IsHeapObject()) {
+void Object::VerifyPointer(Isolate* isolate, Tagged<Object> p) {
+  if (IsHeapObject(p)) {
     HeapObject::VerifyHeapPointer(isolate, p);
   } else {
-    CHECK(p.IsSmi());
+    CHECK(IsSmi(p));
   }
 }
 
-void Object::VerifyAnyTagged(Isolate* isolate, Object p) {
-  if (p.IsHeapObject()) {
+void Object::VerifyAnyTagged(Isolate* isolate, Tagged<Object> p) {
+  if (IsHeapObject(p)) {
     if (V8_EXTERNAL_CODE_SPACE_BOOL) {
       CHECK(IsValidHeapObject(isolate->heap(), HeapObject::cast(p)));
     } else {
       HeapObject::VerifyHeapPointer(isolate, p);
     }
   } else {
-    CHECK(p.IsSmi());
+    CHECK(IsSmi(p));
   }
 }
 
 void MaybeObject::VerifyMaybeObjectPointer(Isolate* isolate, MaybeObject p) {
-  HeapObject heap_object;
-  if (p->GetHeapObject(&heap_object)) {
+  Tagged<HeapObject> heap_object;
+  if (p.GetHeapObject(&heap_object)) {
     HeapObject::VerifyHeapPointer(isolate, heap_object);
   } else {
     CHECK(p->IsSmi() || p->IsCleared() || MapWord::IsPacked(p->ptr()));
   }
 }
 
-void Smi::SmiVerify(Isolate* isolate) {
-  CHECK(IsSmi());
-  CHECK(!IsCallable());
-  CHECK(!IsConstructor());
+// static
+void Smi::SmiVerify(Tagged<Smi> obj, Isolate* isolate) {
+  CHECK(IsSmi(obj));
+  CHECK(!IsCallable(obj));
+  CHECK(!IsConstructor(obj));
 }
 
-void TaggedIndex::TaggedIndexVerify(Isolate* isolate) {
-  CHECK(IsTaggedIndex());
+// static
+void TaggedIndex::TaggedIndexVerify(Tagged<TaggedIndex> obj, Isolate* isolate) {
+  CHECK(IsTaggedIndex(obj));
 }
 
 void HeapObject::HeapObjectVerify(Isolate* isolate) {
-  CHECK(IsHeapObject());
+  CHECK(IsHeapObject(*this));
   PtrComprCageBase cage_base(isolate);
   VerifyPointer(isolate, map(cage_base));
-  CHECK(map(cage_base).IsMap(cage_base));
+  CHECK(IsMap(map(cage_base), cage_base));
 
   CHECK(CheckRequiredAlignment(isolate));
 
-  switch (map(cage_base).instance_type()) {
+  switch (map(cage_base)->instance_type()) {
 #define STRING_TYPE_CASE(TYPE, size, name, CamelName) case TYPE:
     STRING_TYPE_LIST(STRING_TYPE_CASE)
 #undef STRING_TYPE_CASE
-    if (IsConsString(cage_base)) {
-      ConsString::cast(*this).ConsStringVerify(isolate);
-    } else if (IsSlicedString(cage_base)) {
-      SlicedString::cast(*this).SlicedStringVerify(isolate);
-    } else if (IsThinString(cage_base)) {
-      ThinString::cast(*this).ThinStringVerify(isolate);
-    } else if (IsSeqString(cage_base)) {
-      SeqString::cast(*this).SeqStringVerify(isolate);
-    } else if (IsExternalString(cage_base)) {
-      ExternalString::cast(*this).ExternalStringVerify(isolate);
+    if (IsConsString(*this, cage_base)) {
+      ConsString::cast(*this)->ConsStringVerify(isolate);
+    } else if (IsSlicedString(*this, cage_base)) {
+      SlicedString::cast(*this)->SlicedStringVerify(isolate);
+    } else if (IsThinString(*this, cage_base)) {
+      ThinString::cast(*this)->ThinStringVerify(isolate);
+    } else if (IsSeqString(*this, cage_base)) {
+      SeqString::cast(*this)->SeqStringVerify(isolate);
+    } else if (IsExternalString(*this, cage_base)) {
+      ExternalString::cast(*this)->ExternalStringVerify(isolate);
     } else {
-      String::cast(*this).StringVerify(isolate);
+      String::cast(*this)->StringVerify(isolate);
     }
     break;
     case OBJECT_BOILERPLATE_DESCRIPTION_TYPE:
       ObjectBoilerplateDescription::cast(*this)
-          .ObjectBoilerplateDescriptionVerify(isolate);
+          ->ObjectBoilerplateDescriptionVerify(isolate);
       break;
     // FixedArray types
     case CLOSURE_FEEDBACK_CELL_ARRAY_TYPE:
@@ -221,7 +226,7 @@ void HeapObject::HeapObjectVerify(Isolate* isolate) {
     case SIMPLE_NUMBER_DICTIONARY_TYPE:
     case EPHEMERON_HASH_TABLE_TYPE:
     case SCRIPT_CONTEXT_TABLE_TYPE:
-      FixedArray::cast(*this).FixedArrayVerify(isolate);
+      FixedArray::cast(*this)->FixedArrayVerify(isolate);
       break;
     case AWAIT_CONTEXT_TYPE:
     case BLOCK_CONTEXT_TYPE:
@@ -232,20 +237,20 @@ void HeapObject::HeapObjectVerify(Isolate* isolate) {
     case MODULE_CONTEXT_TYPE:
     case SCRIPT_CONTEXT_TYPE:
     case WITH_CONTEXT_TYPE:
-      Context::cast(*this).ContextVerify(isolate);
+      Context::cast(*this)->ContextVerify(isolate);
       break;
     case NATIVE_CONTEXT_TYPE:
-      NativeContext::cast(*this).NativeContextVerify(isolate);
+      NativeContext::cast(*this)->NativeContextVerify(isolate);
       break;
     case FEEDBACK_METADATA_TYPE:
-      FeedbackMetadata::cast(*this).FeedbackMetadataVerify(isolate);
+      FeedbackMetadata::cast(*this)->FeedbackMetadataVerify(isolate);
       break;
     case TRANSITION_ARRAY_TYPE:
-      TransitionArray::cast(*this).TransitionArrayVerify(isolate);
+      TransitionArray::cast(*this)->TransitionArrayVerify(isolate);
       break;
 
     case INSTRUCTION_STREAM_TYPE:
-      InstructionStream::cast(*this).InstructionStreamVerify(isolate);
+      InstructionStream::cast(*this)->InstructionStreamVerify(isolate);
       break;
     case JS_API_OBJECT_TYPE:
     case JS_ARRAY_ITERATOR_PROTOTYPE_TYPE:
@@ -261,37 +266,37 @@ void HeapObject::HeapObjectVerify(Isolate* isolate) {
     case JS_SPECIAL_API_OBJECT_TYPE:
     case JS_STRING_ITERATOR_PROTOTYPE_TYPE:
     case JS_TYPED_ARRAY_PROTOTYPE_TYPE:
-      JSObject::cast(*this).JSObjectVerify(isolate);
+      JSObject::cast(*this)->JSObjectVerify(isolate);
       break;
 #if V8_ENABLE_WEBASSEMBLY
     case WASM_INSTANCE_OBJECT_TYPE:
-      WasmInstanceObject::cast(*this).WasmInstanceObjectVerify(isolate);
+      WasmInstanceObject::cast(*this)->WasmInstanceObjectVerify(isolate);
       break;
     case WASM_VALUE_OBJECT_TYPE:
-      WasmValueObject::cast(*this).WasmValueObjectVerify(isolate);
+      WasmValueObject::cast(*this)->WasmValueObjectVerify(isolate);
       break;
     case WASM_EXCEPTION_PACKAGE_TYPE:
-      WasmExceptionPackage::cast(*this).WasmExceptionPackageVerify(isolate);
+      WasmExceptionPackage::cast(*this)->WasmExceptionPackageVerify(isolate);
       break;
 #endif  // V8_ENABLE_WEBASSEMBLY
     case JS_SET_KEY_VALUE_ITERATOR_TYPE:
     case JS_SET_VALUE_ITERATOR_TYPE:
-      JSSetIterator::cast(*this).JSSetIteratorVerify(isolate);
+      JSSetIterator::cast(*this)->JSSetIteratorVerify(isolate);
       break;
     case JS_MAP_KEY_ITERATOR_TYPE:
     case JS_MAP_KEY_VALUE_ITERATOR_TYPE:
     case JS_MAP_VALUE_ITERATOR_TYPE:
-      JSMapIterator::cast(*this).JSMapIteratorVerify(isolate);
+      JSMapIterator::cast(*this)->JSMapIteratorVerify(isolate);
       break;
     case FILLER_TYPE:
       break;
     case CODE_TYPE:
-      Code::cast(*this).CodeVerify(isolate);
+      Code::cast(*this)->CodeVerify(isolate);
       break;
 
-#define MAKE_TORQUE_CASE(Name, TYPE)         \
-  case TYPE:                                 \
-    Name::cast(*this).Name##Verify(isolate); \
+#define MAKE_TORQUE_CASE(Name, TYPE)          \
+  case TYPE:                                  \
+    Name::cast(*this)->Name##Verify(isolate); \
     break;
       // Every class that has its fields defined in a .tq file and corresponds
       // to exactly one InstanceType value is included in the following list.
@@ -300,19 +305,19 @@ void HeapObject::HeapObjectVerify(Isolate* isolate) {
 #undef MAKE_TORQUE_CASE
 
     case ALLOCATION_SITE_TYPE:
-      AllocationSite::cast(*this).AllocationSiteVerify(isolate);
+      AllocationSite::cast(*this)->AllocationSiteVerify(isolate);
       break;
 
     case LOAD_HANDLER_TYPE:
-      LoadHandler::cast(*this).LoadHandlerVerify(isolate);
+      LoadHandler::cast(*this)->LoadHandlerVerify(isolate);
       break;
 
     case STORE_HANDLER_TYPE:
-      StoreHandler::cast(*this).StoreHandlerVerify(isolate);
+      StoreHandler::cast(*this)->StoreHandlerVerify(isolate);
       break;
 
     case BIG_INT_BASE_TYPE:
-      BigIntBase::cast(*this).BigIntBaseVerify(isolate);
+      BigIntBase::cast(*this)->BigIntBaseVerify(isolate);
       break;
 
     case JS_CLASS_CONSTRUCTOR_TYPE:
@@ -323,7 +328,7 @@ void HeapObject::HeapObjectVerify(Isolate* isolate) {
   case TYPE##_TYPED_ARRAY_CONSTRUCTOR_TYPE:
       TYPED_ARRAYS(TYPED_ARRAY_CONSTRUCTORS_SWITCH)
 #undef TYPED_ARRAY_CONSTRUCTORS_SWITCH
-      JSFunction::cast(*this).JSFunctionVerify(isolate);
+      JSFunction::cast(*this)->JSFunctionVerify(isolate);
       break;
     case JS_LAST_DUMMY_API_OBJECT_TYPE:
       UNREACHABLE();
@@ -331,20 +336,20 @@ void HeapObject::HeapObjectVerify(Isolate* isolate) {
 }
 
 // static
-void HeapObject::VerifyHeapPointer(Isolate* isolate, Object p) {
-  CHECK(p.IsHeapObject());
+void HeapObject::VerifyHeapPointer(Isolate* isolate, Tagged<Object> p) {
+  CHECK(IsHeapObject(p));
   // If you crashed here and {isolate->is_shared()}, there is a bug causing the
   // host of {p} to point to a non-shared object.
   CHECK(IsValidHeapObject(isolate->heap(), HeapObject::cast(p)));
-  CHECK_IMPLIES(V8_EXTERNAL_CODE_SPACE_BOOL, !p.IsInstructionStream());
+  CHECK_IMPLIES(V8_EXTERNAL_CODE_SPACE_BOOL, !IsInstructionStream(p));
 }
 
 // static
-void HeapObject::VerifyCodePointer(Isolate* isolate, Object p) {
-  CHECK(p.IsHeapObject());
+void HeapObject::VerifyCodePointer(Isolate* isolate, Tagged<Object> p) {
+  CHECK(IsHeapObject(p));
   CHECK(IsValidCodeObject(isolate->heap(), HeapObject::cast(p)));
   PtrComprCageBase cage_base(isolate);
-  CHECK(HeapObject::cast(p).IsInstructionStream(cage_base));
+  CHECK(IsInstructionStream(HeapObject::cast(p), cage_base));
 }
 
 void Symbol::SymbolVerify(Isolate* isolate) {
@@ -353,7 +358,7 @@ void Symbol::SymbolVerify(Isolate* isolate) {
   const bool has_hash = TryGetHash(&hash);
   CHECK(has_hash);
   CHECK_GT(hash, 0);
-  CHECK(description().IsUndefined(isolate) || description().IsString());
+  CHECK(IsUndefined(description(), isolate) || IsString(description()));
   CHECK_IMPLIES(IsPrivateName(), IsPrivate());
   CHECK_IMPLIES(IsPrivateBrand(), IsPrivateName());
 }
@@ -365,9 +370,9 @@ void BytecodeArray::BytecodeArrayVerify(Isolate* isolate) {
   // - No Illegal bytecodes.
   // - No consecutive sequences of prefix Wide / ExtraWide.
   TorqueGeneratedClassVerifiers::BytecodeArrayVerify(*this, isolate);
-  for (int i = 0; i < constant_pool(isolate).length(); ++i) {
+  for (int i = 0; i < constant_pool(isolate)->length(); ++i) {
     // No ThinStrings in the constant pool.
-    CHECK(!constant_pool(isolate).get(isolate, i).IsThinString(isolate));
+    CHECK(!IsThinString(constant_pool(isolate)->get(isolate, i), isolate));
   }
 }
 
@@ -380,39 +385,39 @@ bool JSObject::ElementsAreSafeToExamine(PtrComprCageBase cage_base) const {
 
 namespace {
 
-void VerifyJSObjectElements(Isolate* isolate, JSObject object) {
+void VerifyJSObjectElements(Isolate* isolate, Tagged<JSObject> object) {
   // Only TypedArrays can have these specialized elements.
-  if (object.IsJSTypedArray()) {
+  if (IsJSTypedArray(object)) {
     // TODO(bmeurer,v8:4153): Fix CreateTypedArray to either not instantiate
     // the object or propertly initialize it on errors during construction.
     /* CHECK(object->HasTypedArrayOrRabGsabTypedArrayElements()); */
     return;
   }
-  CHECK(!object.elements().IsByteArray());
+  CHECK(!IsByteArray(object->elements()));
 
-  if (object.HasDoubleElements()) {
-    if (object.elements().length() > 0) {
-      CHECK(object.elements().IsFixedDoubleArray());
+  if (object->HasDoubleElements()) {
+    if (object->elements()->length() > 0) {
+      CHECK(IsFixedDoubleArray(object->elements()));
     }
     return;
   }
 
-  if (object.HasSloppyArgumentsElements()) {
-    CHECK(object.elements().IsSloppyArgumentsElements());
+  if (object->HasSloppyArgumentsElements()) {
+    CHECK(IsSloppyArgumentsElements(object->elements()));
     return;
   }
 
-  FixedArray elements = FixedArray::cast(object.elements());
-  if (object.HasSmiElements()) {
+  Tagged<FixedArray> elements = FixedArray::cast(object->elements());
+  if (object->HasSmiElements()) {
     // We might have a partially initialized backing store, in which case we
     // allow the hole + smi values.
-    for (int i = 0; i < elements.length(); i++) {
-      Object value = elements.get(i);
-      CHECK(value.IsSmi() || value.IsTheHole(isolate));
+    for (int i = 0; i < elements->length(); i++) {
+      Tagged<Object> value = elements->get(i);
+      CHECK(IsSmi(value) || IsTheHole(value, isolate));
     }
-  } else if (object.HasObjectElements()) {
-    for (int i = 0; i < elements.length(); i++) {
-      Object element = elements.get(i);
+  } else if (object->HasObjectElements()) {
+    for (int i = 0; i < elements->length(); i++) {
+      Tagged<Object> element = elements->get(i);
       CHECK(!HasWeakHeapObjectTag(element));
     }
   }
@@ -423,28 +428,28 @@ void JSObject::JSObjectVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSObjectVerify(*this, isolate);
   VerifyHeapPointer(isolate, elements());
 
-  CHECK_IMPLIES(HasSloppyArgumentsElements(), IsJSArgumentsObject());
+  CHECK_IMPLIES(HasSloppyArgumentsElements(), IsJSArgumentsObject(*this));
   if (HasFastProperties()) {
-    int actual_unused_property_fields = map().GetInObjectProperties() +
-                                        property_array().length() -
-                                        map().NextFreePropertyIndex();
-    if (map().UnusedPropertyFields() != actual_unused_property_fields) {
+    int actual_unused_property_fields = map()->GetInObjectProperties() +
+                                        property_array()->length() -
+                                        map()->NextFreePropertyIndex();
+    if (map()->UnusedPropertyFields() != actual_unused_property_fields) {
       // There are two reasons why this can happen:
       // - in the middle of StoreTransitionStub when the new extended backing
       //   store is already set into the object and the allocation of the
       //   HeapNumber triggers GC while the map isn't updated yet.
       // - deletion of the last property can leave additional backing store
       //   capacity behind.
-      CHECK_GT(actual_unused_property_fields, map().UnusedPropertyFields());
-      int delta = actual_unused_property_fields - map().UnusedPropertyFields();
+      CHECK_GT(actual_unused_property_fields, map()->UnusedPropertyFields());
+      int delta = actual_unused_property_fields - map()->UnusedPropertyFields();
       CHECK_EQ(0, delta % JSObject::kFieldsAdded);
     }
-    DescriptorArray descriptors = map().instance_descriptors(isolate);
+    Tagged<DescriptorArray> descriptors = map()->instance_descriptors(isolate);
     bool is_transitionable_fast_elements_kind =
-        IsTransitionableFastElementsKind(map().elements_kind());
+        IsTransitionableFastElementsKind(map()->elements_kind());
 
-    for (InternalIndex i : map().IterateOwnDescriptors()) {
-      PropertyDetails details = descriptors.GetDetails(i);
+    for (InternalIndex i : map()->IterateOwnDescriptors()) {
+      PropertyDetails details = descriptors->GetDetails(i);
       if (details.location() == PropertyLocation::kField) {
         DCHECK_EQ(PropertyKind::kData, details.kind());
         Representation r = details.representation();
@@ -452,44 +457,44 @@ void JSObject::JSObjectVerify(Isolate* isolate) {
         if (COMPRESS_POINTERS_BOOL && index.is_inobject()) {
           VerifyObjectField(isolate, index.offset());
         }
-        Object value = RawFastPropertyAt(index);
-        if (r.IsDouble()) DCHECK(value.IsHeapNumber());
-        if (value.IsUninitialized(isolate)) continue;
-        if (r.IsSmi()) DCHECK(value.IsSmi());
-        if (r.IsHeapObject()) DCHECK(value.IsHeapObject());
-        FieldType field_type = descriptors.GetFieldType(i);
-        bool type_is_none = field_type.IsNone();
-        bool type_is_any = field_type.IsAny();
+        Tagged<Object> value = RawFastPropertyAt(index);
+        if (r.IsDouble()) DCHECK(IsHeapNumber(value));
+        if (IsUninitialized(value, isolate)) continue;
+        if (r.IsSmi()) DCHECK(IsSmi(value));
+        if (r.IsHeapObject()) DCHECK(IsHeapObject(value));
+        Tagged<FieldType> field_type = descriptors->GetFieldType(i);
+        bool type_is_none = IsNone(field_type);
+        bool type_is_any = IsAny(field_type);
         if (r.IsNone()) {
           CHECK(type_is_none);
         } else if (!type_is_any && !(type_is_none && r.IsHeapObject())) {
-          CHECK(!field_type.NowStable() || field_type.NowContains(value));
+          CHECK(!field_type->NowStable() || field_type->NowContains(value));
         }
         CHECK_IMPLIES(is_transitionable_fast_elements_kind,
                       Map::IsMostGeneralFieldType(r, field_type));
       }
     }
 
-    if (map().EnumLength() != kInvalidEnumCacheSentinel) {
-      EnumCache enum_cache = descriptors.enum_cache();
-      FixedArray keys = enum_cache.keys();
-      FixedArray indices = enum_cache.indices();
-      CHECK_LE(map().EnumLength(), keys.length());
+    if (map()->EnumLength() != kInvalidEnumCacheSentinel) {
+      Tagged<EnumCache> enum_cache = descriptors->enum_cache();
+      Tagged<FixedArray> keys = enum_cache->keys();
+      Tagged<FixedArray> indices = enum_cache->indices();
+      CHECK_LE(map()->EnumLength(), keys->length());
       CHECK_IMPLIES(indices != ReadOnlyRoots(isolate).empty_fixed_array(),
-                    keys.length() == indices.length());
+                    keys->length() == indices->length());
     }
   }
 
   // If a GC was caused while constructing this object, the elements
   // pointer may point to a one pointer filler map.
   if (ElementsAreSafeToExamine(isolate)) {
-    CHECK_EQ((map().has_fast_smi_or_object_elements() ||
-              map().has_any_nonextensible_elements() ||
+    CHECK_EQ((map()->has_fast_smi_or_object_elements() ||
+              map()->has_any_nonextensible_elements() ||
               (elements() == GetReadOnlyRoots().empty_fixed_array()) ||
               HasFastStringWrapperElements()),
-             (elements().map() == GetReadOnlyRoots().fixed_array_map() ||
-              elements().map() == GetReadOnlyRoots().fixed_cow_array_map()));
-    CHECK_EQ(map().has_fast_object_elements(), HasObjectElements());
+             (elements()->map() == GetReadOnlyRoots().fixed_array_map() ||
+              elements()->map() == GetReadOnlyRoots().fixed_cow_array_map()));
+    CHECK_EQ(map()->has_fast_object_elements(), HasObjectElements());
     VerifyJSObjectElements(isolate, *this);
   }
 }
@@ -502,50 +507,50 @@ void Map::MapVerify(Isolate* isolate) {
   CHECK(instance_size() == kVariableSizeSentinel ||
         (kTaggedSize <= instance_size() &&
          static_cast<size_t>(instance_size()) < heap->Capacity()));
-  if (IsContextMap()) {
+  if (IsContextMap(*this)) {
     // The map for the NativeContext is allocated before the NativeContext
     // itself, so it may happen that during a GC the native_context() is still
     // null.
-    CHECK(native_context_or_null().IsNull() ||
-          native_context().IsNativeContext());
+    CHECK(IsNull(native_context_or_null()) ||
+          IsNativeContext(native_context()));
   } else {
-    if (GetBackPointer().IsUndefined(isolate)) {
+    if (IsUndefined(GetBackPointer(), isolate)) {
       // Root maps must not have descriptors in the descriptor array that do not
       // belong to the map.
       CHECK_EQ(NumberOfOwnDescriptors(),
-               instance_descriptors(isolate).number_of_descriptors());
+               instance_descriptors(isolate)->number_of_descriptors());
     } else {
       // If there is a parent map it must be non-stable.
-      Map parent = Map::cast(GetBackPointer());
-      CHECK(!parent.is_stable());
-      DescriptorArray descriptors = instance_descriptors(isolate);
-      if (descriptors == parent.instance_descriptors(isolate)) {
-        if (NumberOfOwnDescriptors() == parent.NumberOfOwnDescriptors() + 1) {
+      Tagged<Map> parent = Map::cast(GetBackPointer());
+      CHECK(!parent->is_stable());
+      Tagged<DescriptorArray> descriptors = instance_descriptors(isolate);
+      if (descriptors == parent->instance_descriptors(isolate)) {
+        if (NumberOfOwnDescriptors() == parent->NumberOfOwnDescriptors() + 1) {
           // Descriptors sharing through property transitions takes over
           // ownership from the parent map.
-          CHECK(!parent.owns_descriptors());
+          CHECK(!parent->owns_descriptors());
         } else {
-          CHECK_EQ(NumberOfOwnDescriptors(), parent.NumberOfOwnDescriptors());
+          CHECK_EQ(NumberOfOwnDescriptors(), parent->NumberOfOwnDescriptors());
           // Descriptors sharing through special transitions properly takes over
           // ownership from the parent map unless it uses the canonical empty
           // descriptor array.
           if (descriptors != ReadOnlyRoots(isolate).empty_descriptor_array()) {
-            CHECK_IMPLIES(owns_descriptors(), !parent.owns_descriptors());
-            CHECK_IMPLIES(parent.owns_descriptors(), !owns_descriptors());
+            CHECK_IMPLIES(owns_descriptors(), !parent->owns_descriptors());
+            CHECK_IMPLIES(parent->owns_descriptors(), !owns_descriptors());
           }
         }
       }
     }
   }
-  SLOW_DCHECK(instance_descriptors(isolate).IsSortedNoDuplicates());
+  SLOW_DCHECK(instance_descriptors(isolate)->IsSortedNoDuplicates());
   SLOW_DCHECK(TransitionsAccessor(isolate, *this).IsSortedNoDuplicates());
   SLOW_DCHECK(
       TransitionsAccessor(isolate, *this).IsConsistentWithBackPointers());
   // Only JSFunction maps have has_prototype_slot() bit set and constructible
   // JSFunction objects must have prototype slot.
-  CHECK_IMPLIES(has_prototype_slot(), IsJSFunctionMap());
+  CHECK_IMPLIES(has_prototype_slot(), IsJSFunctionMap(*this));
 
-  if (IsJSObjectMap()) {
+  if (IsJSObjectMap(*this)) {
     int header_end_offset = JSObject::GetHeaderSize(*this);
     int inobject_fields_start_offset = GetInObjectPropertyOffset(0);
     // Ensure that embedder fields are located exactly between header and
@@ -555,43 +560,78 @@ void Map::MapVerify(Isolate* isolate) {
                  JSObject::GetEmbedderFieldCount(*this) * kEmbedderDataSlotSize,
              inobject_fields_start_offset);
 
-    if (IsJSSharedStructMap() || IsJSSharedArrayMap() || IsJSAtomicsMutex() ||
-        IsJSAtomicsCondition()) {
-      CHECK(InSharedHeap());
-      CHECK(GetBackPointer().IsUndefined(isolate));
-      Object maybe_cell = prototype_validity_cell(kRelaxedLoad);
-      if (maybe_cell.IsCell()) CHECK(maybe_cell.InSharedHeap());
-      CHECK(!is_extensible());
-      CHECK(!is_prototype_map());
-      CHECK(OnlyHasSimpleProperties());
-      CHECK(instance_descriptors(isolate).InSharedHeap());
-      if (IsJSSharedArrayMap()) {
-        CHECK(has_shared_array_elements());
+    if (IsJSSharedStructMap(*this) || IsJSSharedArrayMap(*this) ||
+        IsJSAtomicsMutex(*this) || IsJSAtomicsCondition(*this)) {
+      if (COMPRESS_POINTERS_IN_ISOLATE_CAGE_BOOL) {
+        // TODO(v8:14089): Verify what should be checked in this configuration
+        // and again merge with the else-branch below.
+        // CHECK(InSharedHeap());
+        CHECK(IsUndefined(GetBackPointer(), isolate));
+        // Object maybe_cell = prototype_validity_cell(kRelaxedLoad);
+        // if (maybe_cell.IsCell()) CHECK(maybe_cell.InSharedHeap());
+        CHECK(!is_extensible());
+        CHECK(!is_prototype_map());
+        CHECK(OnlyHasSimpleProperties());
+        // CHECK(instance_descriptors(isolate).InSharedHeap());
+        if (IsJSSharedArrayMap(*this)) {
+          CHECK(has_shared_array_elements());
+        }
+      } else {
+        CHECK(Object::InSharedHeap(*this));
+        CHECK(IsUndefined(GetBackPointer(), isolate));
+        Tagged<Object> maybe_cell = prototype_validity_cell(kRelaxedLoad);
+        if (IsCell(maybe_cell)) CHECK(Object::InSharedHeap(maybe_cell));
+        CHECK(!is_extensible());
+        CHECK(!is_prototype_map());
+        CHECK(OnlyHasSimpleProperties());
+        CHECK(Object::InSharedHeap(instance_descriptors(isolate)));
+        if (IsJSSharedArrayMap(*this)) {
+          CHECK(has_shared_array_elements());
+        }
+      }
+    }
+
+    // Check constuctor value in JSFunction's maps.
+    if (IsJSFunctionMap(*this) && !IsMap(constructor_or_back_pointer())) {
+      Tagged<Object> maybe_constructor = constructor_or_back_pointer();
+      // Constructor field might still contain a tuple if this map used to
+      // have non-instance prototype earlier.
+      CHECK_IMPLIES(has_non_instance_prototype(), IsTuple2(maybe_constructor));
+      if (IsTuple2(maybe_constructor)) {
+        Tagged<Tuple2> tuple = Tuple2::cast(maybe_constructor);
+        // Unwrap the {constructor, non-instance_prototype} pair.
+        maybe_constructor = tuple->value1();
+        CHECK(!IsJSReceiver(tuple->value2()));
       }
+      CHECK(IsJSFunction(maybe_constructor) ||
+            IsFunctionTemplateInfo(maybe_constructor) ||
+            // The above check might fail until empty function setup is done.
+            IsUndefined(isolate->raw_native_context()->get(
+                Context::EMPTY_FUNCTION_INDEX)));
     }
   }
 
-  if (!may_have_interesting_symbols()) {
+  if (!may_have_interesting_properties()) {
     CHECK(!has_named_interceptor());
     CHECK(!is_dictionary_map());
     CHECK(!is_access_check_needed());
-    DescriptorArray const descriptors = instance_descriptors(isolate);
+    Tagged<DescriptorArray> const descriptors = instance_descriptors(isolate);
     for (InternalIndex i : IterateOwnDescriptors()) {
-      CHECK(!descriptors.GetKey(i).IsInterestingSymbol());
+      CHECK(!descriptors->GetKey(i)->IsInteresting(isolate));
     }
   }
-  CHECK_IMPLIES(has_named_interceptor(), may_have_interesting_symbols());
-  CHECK_IMPLIES(is_dictionary_map(), may_have_interesting_symbols());
-  CHECK_IMPLIES(is_access_check_needed(), may_have_interesting_symbols());
-  CHECK_IMPLIES(IsJSObjectMap() && !CanHaveFastTransitionableElementsKind(),
-                IsDictionaryElementsKind(elements_kind()) ||
-                    IsTerminalElementsKind(elements_kind()) ||
-                    IsAnyHoleyNonextensibleElementsKind(elements_kind()) ||
-                    IsSharedArrayElementsKind(elements_kind()));
+  CHECK_IMPLIES(has_named_interceptor(), may_have_interesting_properties());
+  CHECK_IMPLIES(is_dictionary_map(), may_have_interesting_properties());
+  CHECK_IMPLIES(is_access_check_needed(), may_have_interesting_properties());
+  CHECK_IMPLIES(
+      IsJSObjectMap(*this) && !CanHaveFastTransitionableElementsKind(),
+      IsDictionaryElementsKind(elements_kind()) ||
+          IsTerminalElementsKind(elements_kind()) ||
+          IsAnyHoleyNonextensibleElementsKind(elements_kind()) ||
+          IsSharedArrayElementsKind(elements_kind()));
   CHECK_IMPLIES(is_deprecated(), !is_stable());
   if (is_prototype_map()) {
-    CHECK(prototype_info() == Smi::zero() ||
-          prototype_info().IsPrototypeInfo());
+    CHECK(prototype_info() == Smi::zero() || IsPrototypeInfo(prototype_info()));
   }
 }
 
@@ -610,7 +650,7 @@ void EmbedderDataArray::EmbedderDataArrayVerify(Isolate* isolate) {
   EmbedderDataSlot start(*this, 0);
   EmbedderDataSlot end(*this, length());
   for (EmbedderDataSlot slot = start; slot < end; ++slot) {
-    Object e = slot.load_tagged();
+    Tagged<Object> e = slot.load_tagged();
     Object::VerifyPointer(isolate, e);
   }
 }
@@ -620,8 +660,8 @@ void FixedArray::FixedArrayVerify(Isolate* isolate) {
   if (*this == ReadOnlyRoots(isolate).empty_fixed_array()) {
     CHECK_EQ(length(), 0);
     CHECK_EQ(map(), ReadOnlyRoots(isolate).fixed_array_map());
-  } else if (IsArrayList()) {
-    ArrayList::cast(*this).ArrayListVerify(isolate);
+  } else if (IsArrayList(*this)) {
+    ArrayList::cast(*this)->ArrayListVerify(isolate);
   }
 }
 
@@ -635,7 +675,7 @@ void WeakFixedArray::WeakFixedArrayVerify(Isolate* isolate) {
 void ArrayList::ArrayListVerify(Isolate* isolate) {
   // Avoid calling the torque-generated ArrayListVerify to prevent an endlessly
   // recursion verification.
-  CHECK(IsArrayList());
+  CHECK(IsArrayList(*this));
   CHECK_LE(ArrayList::kLengthIndex, length());
   CHECK_LE(0, Length());
   if (Length() == 0 && length() == ArrayList::kLengthIndex) {
@@ -652,7 +692,7 @@ void PropertyArray::PropertyArrayVerify(Isolate* isolate) {
   // There are no empty PropertyArrays.
   CHECK_LT(0, length());
   for (int i = 0; i < length(); i++) {
-    Object e = get(i);
+    Tagged<Object> e = get(i);
     Object::VerifyPointer(isolate, e);
   }
 }
@@ -683,9 +723,9 @@ void Context::ContextVerify(Isolate* isolate) {
 
 void NativeContext::NativeContextVerify(Isolate* isolate) {
   ContextVerify(isolate);
-  CHECK(retained_maps() == Smi::zero() || retained_maps().IsWeakArrayList());
+  CHECK(retained_maps() == Smi::zero() || IsWeakArrayList(retained_maps()));
   CHECK_EQ(length(), NativeContext::NATIVE_CONTEXT_SLOTS);
-  CHECK_EQ(kVariableSizeSentinel, map().instance_size());
+  CHECK_EQ(kVariableSizeSentinel, map()->instance_size());
 }
 
 void FeedbackMetadata::FeedbackMetadataVerify(Isolate* isolate) {
@@ -718,27 +758,27 @@ void DescriptorArray::DescriptorArrayVerify(Isolate* isolate) {
     int expected_field_index = 0;
     for (InternalIndex descriptor :
          InternalIndex::Range(number_of_descriptors())) {
-      Object key = *(GetDescriptorSlot(descriptor.as_int()) + kEntryKeyIndex);
+      Tagged<Object> key =
+          *(GetDescriptorSlot(descriptor.as_int()) + kEntryKeyIndex);
       // number_of_descriptors() may be out of sync with the actual descriptors
       // written during descriptor array construction.
-      if (key.IsUndefined(isolate)) continue;
+      if (IsUndefined(key, isolate)) continue;
       PropertyDetails details = GetDetails(descriptor);
-      if (Name::cast(key).IsPrivate()) {
+      if (Name::cast(key)->IsPrivate()) {
         CHECK_NE(details.attributes() & DONT_ENUM, 0);
       }
       MaybeObject value = GetValue(descriptor);
-      HeapObject heap_object;
+      Tagged<HeapObject> heap_object;
       if (details.location() == PropertyLocation::kField) {
         CHECK_EQ(details.field_index(), expected_field_index);
-        CHECK(
-            value == MaybeObject::FromObject(FieldType::None()) ||
-            value == MaybeObject::FromObject(FieldType::Any()) ||
-            value->IsCleared() ||
-            (value->GetHeapObjectIfWeak(&heap_object) && heap_object.IsMap()));
+        CHECK(value == MaybeObject::FromObject(FieldType::None()) ||
+              value == MaybeObject::FromObject(FieldType::Any()) ||
+              value->IsCleared() ||
+              (value.GetHeapObjectIfWeak(&heap_object) && IsMap(heap_object)));
         expected_field_index += details.field_width_in_words();
       } else {
         CHECK(!value->IsWeakOrCleared());
-        CHECK(!value->cast<Object>().IsMap());
+        CHECK(!IsMap(value->cast<Object>()));
       }
     }
   }
@@ -751,14 +791,14 @@ void TransitionArray::TransitionArrayVerify(Isolate* isolate) {
 
 namespace {
 void SloppyArgumentsElementsVerify(Isolate* isolate,
-                                   SloppyArgumentsElements elements,
-                                   JSObject holder) {
-  elements.SloppyArgumentsElementsVerify(isolate);
-  ElementsKind kind = holder.GetElementsKind();
+                                   Tagged<SloppyArgumentsElements> elements,
+                                   Tagged<JSObject> holder) {
+  elements->SloppyArgumentsElementsVerify(isolate);
+  ElementsKind kind = holder->GetElementsKind();
   bool is_fast = kind == FAST_SLOPPY_ARGUMENTS_ELEMENTS;
-  Context context_object = elements.context();
-  FixedArray arg_elements = elements.arguments();
-  if (arg_elements.length() == 0) {
+  Tagged<Context> context_object = elements->context();
+  Tagged<FixedArray> arg_elements = elements->arguments();
+  if (arg_elements->length() == 0) {
     CHECK(arg_elements == ReadOnlyRoots(isolate).empty_fixed_array());
     return;
   }
@@ -773,8 +813,8 @@ void SloppyArgumentsElementsVerify(Isolate* isolate,
   for (int i = 0; i < nofMappedParameters; i++) {
     // Verify that each context-mapped argument is either the hole or a valid
     // Smi within context length range.
-    Object mapped = elements.mapped_entries(i, kRelaxedLoad);
-    if (mapped.IsTheHole(isolate)) {
+    Tagged<Object> mapped = elements->mapped_entries(i, kRelaxedLoad);
+    if (IsTheHole(mapped, isolate)) {
       // Slow sloppy arguments can be holey.
       if (!is_fast) continue;
       // Fast sloppy arguments elements are never holey. Either the element is
@@ -786,16 +826,16 @@ void SloppyArgumentsElementsVerify(Isolate* isolate,
     nofMappedParameters++;
     CHECK_LE(maxMappedIndex, mappedIndex);
     maxMappedIndex = mappedIndex;
-    Object value = context_object.get(mappedIndex);
-    CHECK(value.IsObject());
+    Tagged<Object> value = context_object->get(mappedIndex);
+    CHECK(IsObject(value));
     // None of the context-mapped entries should exist in the arguments
     // elements.
     CHECK(!accessor->HasElement(holder, i, arg_elements));
   }
-  CHECK_LE(nofMappedParameters, context_object.length());
-  CHECK_LE(nofMappedParameters, arg_elements.length());
-  CHECK_LE(maxMappedIndex, context_object.length());
-  CHECK_LE(maxMappedIndex, arg_elements.length());
+  CHECK_LE(nofMappedParameters, context_object->length());
+  CHECK_LE(nofMappedParameters, arg_elements->length());
+  CHECK_LE(maxMappedIndex, context_object->length());
+  CHECK_LE(maxMappedIndex, arg_elements->length());
 }
 }  // namespace
 
@@ -829,31 +869,31 @@ void JSAsyncGeneratorObject::JSAsyncGeneratorObjectVerify(Isolate* isolate) {
 void JSDate::JSDateVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSDateVerify(*this, isolate);
 
-  if (month().IsSmi()) {
+  if (IsSmi(month())) {
     int month = Smi::ToInt(this->month());
     CHECK(0 <= month && month <= 11);
   }
-  if (day().IsSmi()) {
+  if (IsSmi(day())) {
     int day = Smi::ToInt(this->day());
     CHECK(1 <= day && day <= 31);
   }
-  if (hour().IsSmi()) {
+  if (IsSmi(hour())) {
     int hour = Smi::ToInt(this->hour());
     CHECK(0 <= hour && hour <= 23);
   }
-  if (min().IsSmi()) {
+  if (IsSmi(min())) {
     int min = Smi::ToInt(this->min());
     CHECK(0 <= min && min <= 59);
   }
-  if (sec().IsSmi()) {
+  if (IsSmi(sec())) {
     int sec = Smi::ToInt(this->sec());
     CHECK(0 <= sec && sec <= 59);
   }
-  if (weekday().IsSmi()) {
+  if (IsSmi(weekday())) {
     int weekday = Smi::ToInt(this->weekday());
     CHECK(0 <= weekday && weekday <= 6);
   }
-  if (cache_stamp().IsSmi()) {
+  if (IsSmi(cache_stamp())) {
     CHECK(Smi::ToInt(cache_stamp()) <=
           Smi::ToInt(isolate->date_cache()->stamp()));
   }
@@ -863,7 +903,7 @@ void String::StringVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::StringVerify(*this, isolate);
   CHECK(length() >= 0 && length() <= Smi::kMaxValue);
   CHECK_IMPLIES(length() == 0, *this == ReadOnlyRoots(isolate).empty_string());
-  if (IsInternalizedString()) {
+  if (IsInternalizedString(*this)) {
     CHECK(HasHashCode());
     CHECK(!ObjectInYoungGeneration(*this));
   }
@@ -872,26 +912,26 @@ void String::StringVerify(Isolate* isolate) {
 void ConsString::ConsStringVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::ConsStringVerify(*this, isolate);
   CHECK_GE(length(), ConsString::kMinLength);
-  CHECK(length() == first().length() + second().length());
+  CHECK(length() == first()->length() + second()->length());
   if (IsFlat(isolate)) {
     // A flat cons can only be created by String::SlowFlatten.
     // Afterwards, the first part may be externalized or internalized.
-    CHECK(first().IsSeqString() || first().IsExternalString() ||
-          first().IsThinString());
+    CHECK(IsSeqString(first()) || IsExternalString(first()) ||
+          IsThinString(first()));
   }
 }
 
 void ThinString::ThinStringVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::ThinStringVerify(*this, isolate);
   CHECK(!HasForwardingIndex(kAcquireLoad));
-  CHECK(actual().IsInternalizedString());
-  CHECK(actual().IsSeqString() || actual().IsExternalString());
+  CHECK(IsInternalizedString(actual()));
+  CHECK(IsSeqString(actual()) || IsExternalString(actual()));
 }
 
 void SlicedString::SlicedStringVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::SlicedStringVerify(*this, isolate);
-  CHECK(!parent().IsConsString());
-  CHECK(!parent().IsSlicedString());
+  CHECK(!IsConsString(parent()));
+  CHECK(!IsSlicedString(parent()));
 #ifdef DEBUG
   if (!isolate->has_turbofan_string_builders()) {
     // Turbofan's string builder optimization can introduce SlicedString that
@@ -907,8 +947,8 @@ USE_TORQUE_VERIFIER(ExternalString)
 
 void JSBoundFunction::JSBoundFunctionVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSBoundFunctionVerify(*this, isolate);
-  CHECK(IsCallable());
-  CHECK_EQ(IsConstructor(), bound_target_function().IsConstructor());
+  CHECK(IsCallable(*this));
+  CHECK_EQ(IsConstructor(*this), IsConstructor(bound_target_function()));
 }
 
 void JSFunction::JSFunctionVerify(Isolate* isolate) {
@@ -922,16 +962,16 @@ void JSFunction::JSFunctionVerify(Isolate* isolate) {
                 8 * kTaggedSize);
 
   JSFunctionOrBoundFunctionOrWrappedFunctionVerify(isolate);
-  CHECK(IsJSFunction());
+  CHECK(IsJSFunction(*this));
   VerifyPointer(isolate, shared(isolate));
-  CHECK(shared(isolate).IsSharedFunctionInfo());
+  CHECK(IsSharedFunctionInfo(shared(isolate)));
   VerifyPointer(isolate, context(isolate, kRelaxedLoad));
-  CHECK(context(isolate, kRelaxedLoad).IsContext());
+  CHECK(IsContext(context(isolate, kRelaxedLoad)));
   VerifyPointer(isolate, raw_feedback_cell(isolate));
-  CHECK(raw_feedback_cell(isolate).IsFeedbackCell());
+  CHECK(IsFeedbackCell(raw_feedback_cell(isolate)));
   VerifyPointer(isolate, code(isolate));
-  CHECK(code(isolate).IsCode());
-  CHECK(map(isolate).is_callable());
+  CHECK(IsCode(code(isolate)));
+  CHECK(map(isolate)->is_callable());
   Handle<JSFunction> function(*this, isolate);
   LookupIterator it(isolate, function, isolate->factory()->prototype_string(),
                     LookupIterator::OWN_SKIP_INTERCEPTOR);
@@ -942,26 +982,44 @@ void JSFunction::JSFunctionVerify(Isolate* isolate) {
   if (has_prototype_property()) {
     CHECK(it.IsFound());
     CHECK_EQ(LookupIterator::ACCESSOR, it.state());
-    CHECK(it.GetAccessors()->IsAccessorInfo());
+    CHECK(IsAccessorInfo(*it.GetAccessors()));
   } else {
     CHECK(!it.IsFound() || it.state() != LookupIterator::ACCESSOR ||
-          !it.GetAccessors()->IsAccessorInfo());
+          !IsAccessorInfo(*it.GetAccessors()));
   }
 }
 
 void SharedFunctionInfo::SharedFunctionInfoVerify(Isolate* isolate) {
   // TODO(leszeks): Add a TorqueGeneratedClassVerifier for LocalIsolate.
-  this->SharedFunctionInfoVerify(ReadOnlyRoots(isolate));
+  SharedFunctionInfoVerify(ReadOnlyRoots(isolate));
 }
 
 void SharedFunctionInfo::SharedFunctionInfoVerify(LocalIsolate* isolate) {
-  this->SharedFunctionInfoVerify(ReadOnlyRoots(isolate));
+  SharedFunctionInfoVerify(ReadOnlyRoots(isolate));
 }
 
+namespace {
+
+bool ShouldVerifySharedFunctionInfoFunctionIndex(
+    Tagged<SharedFunctionInfo> sfi) {
+  if (!sfi->HasBuiltinId()) return true;
+  switch (sfi->builtin_id()) {
+    case Builtin::kPromiseCapabilityDefaultReject:
+    case Builtin::kPromiseCapabilityDefaultResolve:
+      // For these we manually set custom function indices.
+      return false;
+    default:
+      return true;
+  }
+  UNREACHABLE();
+}
+
+}  // namespace
+
 void SharedFunctionInfo::SharedFunctionInfoVerify(ReadOnlyRoots roots) {
-  Object value = name_or_scope_info(kAcquireLoad);
-  if (value.IsScopeInfo()) {
-    CHECK(!ScopeInfo::cast(value).IsEmpty());
+  Tagged<Object> value = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(value)) {
+    CHECK(!ScopeInfo::cast(value)->IsEmpty());
     CHECK_NE(value, roots.empty_scope_info());
   }
 
@@ -977,27 +1035,28 @@ void SharedFunctionInfo::SharedFunctionInfoVerify(ReadOnlyRoots roots) {
         HasUncompiledDataWithoutPreparseData());
 
   {
-    auto script = script_or_debug_info(kAcquireLoad);
-    CHECK(script.IsUndefined(roots) || script.IsScript() ||
-          script.IsDebugInfo());
+    Tagged<HeapObject> script = this->script(kAcquireLoad);
+    CHECK(IsUndefined(script, roots) || IsScript(script));
   }
 
   if (!is_compiled()) {
     CHECK(!HasFeedbackMetadata());
-    CHECK(outer_scope_info().IsScopeInfo() ||
-          outer_scope_info().IsTheHole(roots));
+    CHECK(IsScopeInfo(outer_scope_info()) ||
+          IsTheHole(outer_scope_info(), roots));
   } else if (HasBytecodeArray() && HasFeedbackMetadata()) {
-    CHECK(feedback_metadata().IsFeedbackMetadata());
+    CHECK(IsFeedbackMetadata(feedback_metadata()));
   }
 
-  int expected_map_index =
-      Context::FunctionMapIndex(language_mode(), kind(), HasSharedName());
-  CHECK_EQ(expected_map_index, function_map_index());
+  if (ShouldVerifySharedFunctionInfoFunctionIndex(*this)) {
+    int expected_map_index =
+        Context::FunctionMapIndex(language_mode(), kind(), HasSharedName());
+    CHECK_EQ(expected_map_index, function_map_index());
+  }
 
-  if (!scope_info().IsEmpty()) {
-    ScopeInfo info = scope_info();
-    CHECK(kind() == info.function_kind());
-    CHECK_EQ(internal::IsModule(kind()), info.scope_type() == MODULE_SCOPE);
+  Tagged<ScopeInfo> info = EarlyScopeInfo(kAcquireLoad);
+  if (!info->IsEmpty()) {
+    CHECK(kind() == info->function_kind());
+    CHECK_EQ(internal::IsModule(kind()), info->scope_type() == MODULE_SCOPE);
   }
 
   if (IsApiFunction()) {
@@ -1016,16 +1075,16 @@ void SharedFunctionInfo::SharedFunctionInfoVerify(ReadOnlyRoots roots) {
 
 void JSGlobalProxy::JSGlobalProxyVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSGlobalProxyVerify(*this, isolate);
-  CHECK(map().is_access_check_needed());
+  CHECK(map()->is_access_check_needed());
   // Make sure that this object has no properties, elements.
-  CHECK_EQ(0, FixedArray::cast(elements()).length());
+  CHECK_EQ(0, FixedArray::cast(elements())->length());
 }
 
 void JSGlobalObject::JSGlobalObjectVerify(Isolate* isolate) {
-  CHECK(IsJSGlobalObject());
+  CHECK(IsJSGlobalObject(*this));
   // Do not check the dummy global object for the builtins.
-  if (global_dictionary(kAcquireLoad).NumberOfElements() == 0 &&
-      elements().length() == 0) {
+  if (global_dictionary(kAcquireLoad)->NumberOfElements() == 0 &&
+      elements()->length() == 0) {
     return;
   }
   JSObjectVerify(isolate);
@@ -1033,27 +1092,27 @@ void JSGlobalObject::JSGlobalObjectVerify(Isolate* isolate) {
 
 void Oddball::OddballVerify(Isolate* isolate) {
   PrimitiveHeapObjectVerify(isolate);
-  CHECK(IsOddball(isolate));
+  CHECK(IsOddball(*this, isolate));
 
   Heap* heap = isolate->heap();
-  Object string = to_string();
+  Tagged<Object> string = to_string();
   VerifyPointer(isolate, string);
-  CHECK(string.IsString());
-  Object type = type_of();
+  CHECK(IsString(string));
+  Tagged<Object> type = type_of();
   VerifyPointer(isolate, type);
-  CHECK(type.IsString());
-  Object kind_value = TaggedField<Object>::load(*this, kKindOffset);
+  CHECK(IsString(type));
+  Tagged<Object> kind_value = TaggedField<Object>::load(*this, kKindOffset);
   VerifyPointer(isolate, kind_value);
-  CHECK(kind_value.IsSmi());
+  CHECK(IsSmi(kind_value));
 
-  Object number = to_number();
+  Tagged<Object> number = to_number();
   VerifyPointer(isolate, number);
-  CHECK(number.IsSmi() || number.IsHeapNumber());
-  if (number.IsHeapObject()) {
+  CHECK(IsSmi(number) || IsHeapNumber(number));
+  if (IsHeapObject(number)) {
     CHECK(number == ReadOnlyRoots(heap).nan_value() ||
           number == ReadOnlyRoots(heap).hole_nan_value());
   } else {
-    CHECK(number.IsSmi());
+    CHECK(IsSmi(number));
     int value = Smi::ToInt(number);
     // Hidden oddballs have negative smis.
     const int kLeastHiddenOddballNumber = -7;
@@ -1064,8 +1123,6 @@ void Oddball::OddballVerify(Isolate* isolate) {
   ReadOnlyRoots roots(heap);
   if (map() == roots.undefined_map()) {
     CHECK(*this == roots.undefined_value());
-  } else if (map() == roots.the_hole_map()) {
-    CHECK(*this == roots.the_hole_value());
   } else if (map() == roots.null_map()) {
     CHECK(*this == roots.null_value());
   } else if (map() == roots.boolean_map()) {
@@ -1092,17 +1149,31 @@ void Oddball::OddballVerify(Isolate* isolate) {
   }
 }
 
+void Hole::HoleVerify(Isolate* isolate) {
+  ReadOnlyRoots roots(isolate->heap());
+  CHECK_EQ(map(), roots.hole_map());
+
+#define COMPARE_ROOTS_VALUE(_, Value, __) \
+  if (*this == roots.Value()) {           \
+    return;                               \
+  }
+  HOLE_LIST(COMPARE_ROOTS_VALUE);
+#undef COMPARE_ROOTS_VALUE
+
+  UNREACHABLE();
+}
+
 void PropertyCell::PropertyCellVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::PropertyCellVerify(*this, isolate);
-  CHECK(name().IsUniqueName());
+  CHECK(IsUniqueName(name()));
   CheckDataIsCompatible(property_details(), value());
 }
 
 void Code::CodeVerify(Isolate* isolate) {
-  CHECK(IsCode());
+  CHECK(IsCode(*this));
   if (has_instruction_stream()) {
-    InstructionStream istream = instruction_stream();
-    CHECK_EQ(istream.code(kAcquireLoad), *this);
+    Tagged<InstructionStream> istream = instruction_stream();
+    CHECK_EQ(istream->code(kAcquireLoad), *this);
     CHECK_EQ(safepoint_table_offset(), 0);
     CHECK_LE(safepoint_table_offset(), handler_table_offset());
     CHECK_LE(handler_table_offset(), constant_pool_offset());
@@ -1110,35 +1181,41 @@ void Code::CodeVerify(Isolate* isolate) {
     CHECK_LE(code_comments_offset(), unwinding_info_offset());
     CHECK_LE(unwinding_info_offset(), metadata_size());
 
-    relocation_info().ObjectVerify(isolate);
-
     // Ensure the cached code entry point corresponds to the InstructionStream
     // object associated with this Code.
 #if defined(V8_COMPRESS_POINTERS) && defined(V8_SHORT_BUILTIN_CALLS)
-    if (istream.instruction_start() == code_entry_point()) {
+    if (istream->instruction_start() == instruction_start()) {
       // Most common case, all good.
     } else {
       // When shared pointer compression cage is enabled and it has the
       // embedded code blob copy then the
       // InstructionStream::instruction_start() might return the address of
       // the remapped builtin regardless of whether the builtins copy existed
-      // when the code_entry_point value was cached in the Code (see
+      // when the instruction_start value was cached in the Code (see
       // InstructionStream::OffHeapInstructionStart()).  So, do a reverse
-      // Code object lookup via code_entry_point value to ensure it
+      // Code object lookup via instruction_start value to ensure it
       // corresponds to this current Code object.
-      Code lookup_result =
-          isolate->heap()->FindCodeForInnerPointer(code_entry_point());
+      Tagged<Code> lookup_result =
+          isolate->heap()->FindCodeForInnerPointer(instruction_start());
       CHECK_EQ(lookup_result, *this);
     }
 #else
-    CHECK_EQ(istream.instruction_start(), code_entry_point());
+    CHECK_EQ(istream->instruction_start(), instruction_start());
 #endif  // V8_COMPRESS_POINTERS && V8_SHORT_BUILTIN_CALLS
   }
+
+#if defined(V8_CODE_POINTER_SANDBOXING)
+  // Check that the code pointer table entry is consistent, i.e. points back to
+  // this Code object.
+  CHECK_EQ(ReadIndirectPointerField(kCodePointerTableEntryOffset), *this);
+#endif
 }
 
 void InstructionStream::InstructionStreamVerify(Isolate* isolate) {
+  Tagged<Code> code;
+  if (!TryGetCode(&code, kAcquireLoad)) return;
   CHECK(
-      IsAligned(code(kAcquireLoad).instruction_size(),
+      IsAligned(code->instruction_size(),
                 static_cast<unsigned>(InstructionStream::kMetadataAlignment)));
 #if !defined(_MSC_VER) || defined(__clang__)
   // See also: PlatformEmbeddedFileWriterWin::AlignToCodeAlignment.
@@ -1147,13 +1224,15 @@ void InstructionStream::InstructionStreamVerify(Isolate* isolate) {
 #endif  // !defined(_MSC_VER) || defined(__clang__)
   CHECK_IMPLIES(!ReadOnlyHeap::Contains(*this),
                 IsAligned(instruction_start(), kCodeAlignment));
-  CHECK_EQ(*this, code(kAcquireLoad).instruction_stream());
+  CHECK_EQ(*this, code->instruction_stream());
   CHECK(V8_ENABLE_THIRD_PARTY_HEAP_BOOL ||
-        CodeSize() <= MemoryChunkLayout::MaxRegularCodeObjectSize() ||
+        Size() <= MemoryChunkLayout::MaxRegularCodeObjectSize() ||
         isolate->heap()->InSpace(*this, CODE_LO_SPACE));
   Address last_gc_pc = kNullAddress;
 
-  for (RelocIterator it(code(kAcquireLoad)); !it.done(); it.next()) {
+  Object::ObjectVerify(relocation_info(), isolate);
+
+  for (RelocIterator it(code); !it.done(); it.next()) {
     it.rinfo()->Verify(isolate);
     // Ensure that GC will not iterate twice over the same pointer.
     if (RelocInfo::IsGCRelocMode(it.rinfo()->rmode())) {
@@ -1168,37 +1247,36 @@ void JSArray::JSArrayVerify(Isolate* isolate) {
   // If a GC was caused while constructing this array, the elements
   // pointer may point to a one pointer filler map.
   if (!ElementsAreSafeToExamine(isolate)) return;
-  if (elements().IsUndefined(isolate)) return;
-  CHECK(elements().IsFixedArray() || elements().IsFixedDoubleArray());
-  if (elements().length() == 0) {
+  if (IsUndefined(elements(), isolate)) return;
+  CHECK(IsFixedArray(elements()) || IsFixedDoubleArray(elements()));
+  if (elements()->length() == 0) {
     CHECK_EQ(elements(), ReadOnlyRoots(isolate).empty_fixed_array());
   }
   // Verify that the length and the elements backing store are in sync.
-  if (length().IsSmi() &&
-      (HasFastElements() || HasAnyNonextensibleElements())) {
-    if (elements().length() > 0) {
-      CHECK_IMPLIES(HasDoubleElements(), elements().IsFixedDoubleArray());
+  if (IsSmi(length()) && (HasFastElements() || HasAnyNonextensibleElements())) {
+    if (elements()->length() > 0) {
+      CHECK_IMPLIES(HasDoubleElements(), IsFixedDoubleArray(elements()));
       CHECK_IMPLIES(HasSmiOrObjectElements() || HasAnyNonextensibleElements(),
-                    elements().IsFixedArray());
+                    IsFixedArray(elements()));
     }
     int size = Smi::ToInt(length());
     // Holey / Packed backing stores might have slack or might have not been
     // properly initialized yet.
-    CHECK(size <= elements().length() ||
+    CHECK(size <= elements()->length() ||
           elements() == ReadOnlyRoots(isolate).empty_fixed_array());
   } else {
     CHECK(HasDictionaryElements());
     uint32_t array_length;
-    CHECK(length().ToArrayLength(&array_length));
+    CHECK(Object::ToArrayLength(length(), &array_length));
     if (array_length == 0xFFFFFFFF) {
-      CHECK(length().ToArrayLength(&array_length));
+      CHECK(Object::ToArrayLength(length(), &array_length));
     }
     if (array_length != 0) {
-      NumberDictionary dict = NumberDictionary::cast(elements());
+      Tagged<NumberDictionary> dict = NumberDictionary::cast(elements());
       // The dictionary can never have more elements than the array length + 1.
       // If the backing store grows the verification might be triggered with
       // the old length in place.
-      uint32_t nof_elements = static_cast<uint32_t>(dict.NumberOfElements());
+      uint32_t nof_elements = static_cast<uint32_t>(dict->NumberOfElements());
       if (nof_elements != 0) nof_elements--;
       CHECK_LE(nof_elements, array_length);
     }
@@ -1207,28 +1285,28 @@ void JSArray::JSArrayVerify(Isolate* isolate) {
 
 void JSSet::JSSetVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSSetVerify(*this, isolate);
-  CHECK(table().IsOrderedHashSet() || table().IsUndefined(isolate));
+  CHECK(IsOrderedHashSet(table()) || IsUndefined(table(), isolate));
   // TODO(arv): Verify OrderedHashTable too.
 }
 
 void JSMap::JSMapVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSMapVerify(*this, isolate);
-  CHECK(table().IsOrderedHashMap() || table().IsUndefined(isolate));
+  CHECK(IsOrderedHashMap(table()) || IsUndefined(table(), isolate));
   // TODO(arv): Verify OrderedHashTable too.
 }
 
 void JSSetIterator::JSSetIteratorVerify(Isolate* isolate) {
-  CHECK(IsJSSetIterator());
+  CHECK(IsJSSetIterator(*this));
   JSCollectionIteratorVerify(isolate);
-  CHECK(table().IsOrderedHashSet());
-  CHECK(index().IsSmi());
+  CHECK(IsOrderedHashSet(table()));
+  CHECK(IsSmi(index()));
 }
 
 void JSMapIterator::JSMapIteratorVerify(Isolate* isolate) {
-  CHECK(IsJSMapIterator());
+  CHECK(IsJSMapIterator(*this));
   JSCollectionIteratorVerify(isolate);
-  CHECK(table().IsOrderedHashMap());
-  CHECK(index().IsSmi());
+  CHECK(IsOrderedHashMap(table()));
+  CHECK(IsSmi(index()));
 }
 
 USE_TORQUE_VERIFIER(JSShadowRealm)
@@ -1236,35 +1314,36 @@ USE_TORQUE_VERIFIER(JSWrappedFunction)
 
 namespace {
 
-void VerifyElementIsShared(Object element) {
+void VerifyElementIsShared(Tagged<Object> element) {
   // Exception for ThinStrings:
   // When storing a ThinString in a shared object, we want to store the actual
   // string, which is shared when sharing the string table.
   // It is possible that a stored shared string migrates to a ThinString later
   // on, which is fine as the ThinString resides in shared space if the original
   // string was in shared space.
-  if (element.IsThinString()) {
+  if (IsThinString(element)) {
     CHECK(v8_flags.shared_string_table);
-    CHECK(element.InWritableSharedSpace());
+    CHECK(Object::InWritableSharedSpace(element));
   } else {
-    CHECK(element.IsShared());
+    CHECK(IsShared(element));
   }
 }
 
 }  // namespace
 
 void JSSharedStruct::JSSharedStructVerify(Isolate* isolate) {
-  CHECK(IsJSSharedStruct());
+  CHECK(IsJSSharedStruct(*this));
   CHECK(InWritableSharedSpace());
   JSObjectVerify(isolate);
   CHECK(HasFastProperties());
   // Shared structs can only point to primitives or other shared HeapObjects,
   // even internally.
-  Map struct_map = map();
-  CHECK(property_array().InSharedHeap());
-  DescriptorArray descriptors = struct_map.instance_descriptors(isolate);
-  for (InternalIndex i : struct_map.IterateOwnDescriptors()) {
-    PropertyDetails details = descriptors.GetDetails(i);
+  Tagged<Map> struct_map = map();
+  CHECK(Object::InSharedHeap(property_array()));
+  Tagged<DescriptorArray> descriptors =
+      struct_map->instance_descriptors(isolate);
+  for (InternalIndex i : struct_map->IterateOwnDescriptors()) {
+    PropertyDetails details = descriptors->GetDetails(i);
     CHECK_EQ(PropertyKind::kData, details.kind());
     CHECK_EQ(PropertyLocation::kField, details.location());
     CHECK(details.representation().IsTagged());
@@ -1274,115 +1353,121 @@ void JSSharedStruct::JSSharedStructVerify(Isolate* isolate) {
 }
 
 void JSAtomicsMutex::JSAtomicsMutexVerify(Isolate* isolate) {
-  CHECK(IsJSAtomicsMutex());
+  CHECK(IsJSAtomicsMutex(*this));
   CHECK(InWritableSharedSpace());
   JSObjectVerify(isolate);
 }
 
 void JSAtomicsCondition::JSAtomicsConditionVerify(Isolate* isolate) {
-  CHECK(IsJSAtomicsCondition());
-  CHECK(InSharedHeap());
+  CHECK(IsJSAtomicsCondition(*this));
+  CHECK(Object::InSharedHeap(*this));
   JSObjectVerify(isolate);
 }
 
 void JSSharedArray::JSSharedArrayVerify(Isolate* isolate) {
-  CHECK(IsJSSharedArray());
+  CHECK(IsJSSharedArray(*this));
   JSObjectVerify(isolate);
   CHECK(HasFastProperties());
   // Shared arrays can only point to primitives or other shared HeapObjects,
   // even internally.
-  FixedArray storage = FixedArray::cast(elements());
-  uint32_t length = storage.length();
+  Tagged<FixedArray> storage = FixedArray::cast(elements());
+  uint32_t length = storage->length();
   for (uint32_t j = 0; j < length; j++) {
-    Object element_value = storage.get(j);
+    Tagged<Object> element_value = storage->get(j);
     VerifyElementIsShared(element_value);
   }
 }
 
 void JSIteratorMapHelper::JSIteratorMapHelperVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSIteratorMapHelperVerify(*this, isolate);
-  CHECK(mapper().IsCallable());
-  CHECK_GE(counter().Number(), 0);
+  CHECK(IsCallable(mapper()));
+  CHECK_GE(Object::Number(counter()), 0);
 }
 
 void JSIteratorFilterHelper::JSIteratorFilterHelperVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSIteratorFilterHelperVerify(*this, isolate);
-  CHECK(predicate().IsCallable());
-  CHECK_GE(counter().Number(), 0);
+  CHECK(IsCallable(predicate()));
+  CHECK_GE(Object::Number(counter()), 0);
 }
 
 void JSIteratorTakeHelper::JSIteratorTakeHelperVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSIteratorTakeHelperVerify(*this, isolate);
-  CHECK_GE(remaining().Number(), 0);
+  CHECK_GE(Object::Number(remaining()), 0);
 }
 
 void JSIteratorDropHelper::JSIteratorDropHelperVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSIteratorDropHelperVerify(*this, isolate);
-  CHECK_GE(remaining().Number(), 0);
+  CHECK_GE(Object::Number(remaining()), 0);
+}
+
+void JSIteratorFlatMapHelper::JSIteratorFlatMapHelperVerify(Isolate* isolate) {
+  TorqueGeneratedClassVerifiers::JSIteratorFlatMapHelperVerify(*this, isolate);
+  CHECK(IsCallable(mapper()));
+  CHECK_GE(Object::Number(counter()), 0);
 }
 
 void WeakCell::WeakCellVerify(Isolate* isolate) {
-  CHECK(IsWeakCell());
+  CHECK(IsWeakCell(*this));
 
-  CHECK(target().IsUndefined(isolate) || target().CanBeHeldWeakly());
+  CHECK(IsUndefined(target(), isolate) || Object::CanBeHeldWeakly(target()));
 
-  CHECK(prev().IsWeakCell() || prev().IsUndefined(isolate));
-  if (prev().IsWeakCell()) {
-    CHECK_EQ(WeakCell::cast(prev()).next(), *this);
+  CHECK(IsWeakCell(prev()) || IsUndefined(prev(), isolate));
+  if (IsWeakCell(prev())) {
+    CHECK_EQ(WeakCell::cast(prev())->next(), *this);
   }
 
-  CHECK(next().IsWeakCell() || next().IsUndefined(isolate));
-  if (next().IsWeakCell()) {
-    CHECK_EQ(WeakCell::cast(next()).prev(), *this);
+  CHECK(IsWeakCell(next()) || IsUndefined(next(), isolate));
+  if (IsWeakCell(next())) {
+    CHECK_EQ(WeakCell::cast(next())->prev(), *this);
   }
 
-  CHECK_IMPLIES(unregister_token().IsUndefined(isolate),
-                key_list_prev().IsUndefined(isolate));
-  CHECK_IMPLIES(unregister_token().IsUndefined(isolate),
-                key_list_next().IsUndefined(isolate));
+  CHECK_IMPLIES(IsUndefined(unregister_token(), isolate),
+                IsUndefined(key_list_prev(), isolate));
+  CHECK_IMPLIES(IsUndefined(unregister_token(), isolate),
+                IsUndefined(key_list_next(), isolate));
 
-  CHECK(key_list_prev().IsWeakCell() || key_list_prev().IsUndefined(isolate));
+  CHECK(IsWeakCell(key_list_prev()) || IsUndefined(key_list_prev(), isolate));
 
-  CHECK(key_list_next().IsWeakCell() || key_list_next().IsUndefined(isolate));
+  CHECK(IsWeakCell(key_list_next()) || IsUndefined(key_list_next(), isolate));
 
-  CHECK(finalization_registry().IsUndefined(isolate) ||
-        finalization_registry().IsJSFinalizationRegistry());
+  CHECK(IsUndefined(finalization_registry(), isolate) ||
+        IsJSFinalizationRegistry(finalization_registry()));
 }
 
 void JSWeakRef::JSWeakRefVerify(Isolate* isolate) {
-  CHECK(IsJSWeakRef());
+  CHECK(IsJSWeakRef(*this));
   JSObjectVerify(isolate);
-  CHECK(target().IsUndefined(isolate) || target().CanBeHeldWeakly());
+  CHECK(IsUndefined(target(), isolate) || Object::CanBeHeldWeakly(target()));
 }
 
 void JSFinalizationRegistry::JSFinalizationRegistryVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSFinalizationRegistryVerify(*this, isolate);
-  if (active_cells().IsWeakCell()) {
-    CHECK(WeakCell::cast(active_cells()).prev().IsUndefined(isolate));
+  if (IsWeakCell(active_cells())) {
+    CHECK(IsUndefined(WeakCell::cast(active_cells())->prev(), isolate));
   }
-  if (cleared_cells().IsWeakCell()) {
-    CHECK(WeakCell::cast(cleared_cells()).prev().IsUndefined(isolate));
+  if (IsWeakCell(cleared_cells())) {
+    CHECK(IsUndefined(WeakCell::cast(cleared_cells())->prev(), isolate));
   }
 }
 
 void JSWeakMap::JSWeakMapVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSWeakMapVerify(*this, isolate);
-  CHECK(table().IsEphemeronHashTable() || table().IsUndefined(isolate));
+  CHECK(IsEphemeronHashTable(table()) || IsUndefined(table(), isolate));
 }
 
 void JSArrayIterator::JSArrayIteratorVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSArrayIteratorVerify(*this, isolate);
 
-  CHECK_GE(next_index().Number(), 0);
-  CHECK_LE(next_index().Number(), kMaxSafeInteger);
+  CHECK_GE(Object::Number(next_index()), 0);
+  CHECK_LE(Object::Number(next_index()), kMaxSafeInteger);
 
-  if (iterated_object().IsJSTypedArray()) {
+  if (IsJSTypedArray(iterated_object())) {
     // JSTypedArray::length is limited to Smi range.
-    CHECK(next_index().IsSmi());
-    CHECK_LE(next_index().Number(), Smi::kMaxValue);
-  } else if (iterated_object().IsJSArray()) {
+    CHECK(IsSmi(next_index()));
+    CHECK_LE(Object::Number(next_index()), Smi::kMaxValue);
+  } else if (IsJSArray(iterated_object())) {
     // JSArray::length is limited to Uint32 range.
-    CHECK_LE(next_index().Number(), kMaxUInt32);
+    CHECK_LE(Object::Number(next_index()), kMaxUInt32);
   }
 }
 
@@ -1394,25 +1479,25 @@ void JSStringIterator::JSStringIteratorVerify(Isolate* isolate) {
 
 void JSWeakSet::JSWeakSetVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSWeakSetVerify(*this, isolate);
-  CHECK(table().IsEphemeronHashTable() || table().IsUndefined(isolate));
+  CHECK(IsEphemeronHashTable(table()) || IsUndefined(table(), isolate));
 }
 
 void CallableTask::CallableTaskVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::CallableTaskVerify(*this, isolate);
-  CHECK(callable().IsCallable());
+  CHECK(IsCallable(callable()));
 }
 
 void JSPromise::JSPromiseVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSPromiseVerify(*this, isolate);
   if (status() == Promise::kPending) {
-    CHECK(reactions().IsSmi() || reactions().IsPromiseReaction());
+    CHECK(IsSmi(reactions()) || IsPromiseReaction(reactions()));
   }
 }
 
 template <typename Derived>
 void SmallOrderedHashTable<Derived>::SmallOrderedHashTableVerify(
     Isolate* isolate) {
-  CHECK(IsSmallOrderedHashTable());
+  CHECK(IsSmallOrderedHashTable(*this));
 
   int capacity = Capacity();
   CHECK_GE(capacity, kMinCapacity);
@@ -1434,7 +1519,7 @@ void SmallOrderedHashTable<Derived>::SmallOrderedHashTableVerify(
 
   for (int entry = 0; entry < NumberOfElements(); entry++) {
     for (int offset = 0; offset < Derived::kEntrySize; offset++) {
-      Object val = GetDataEntry(entry, offset);
+      Tagged<Object> val = GetDataEntry(entry, offset);
       VerifyPointer(isolate, val);
     }
   }
@@ -1442,48 +1527,48 @@ void SmallOrderedHashTable<Derived>::SmallOrderedHashTableVerify(
   for (int entry = NumberOfElements() + NumberOfDeletedElements();
        entry < Capacity(); entry++) {
     for (int offset = 0; offset < Derived::kEntrySize; offset++) {
-      Object val = GetDataEntry(entry, offset);
-      CHECK(val.IsTheHole(isolate));
+      Tagged<Object> val = GetDataEntry(entry, offset);
+      CHECK(IsTheHole(val, isolate));
     }
   }
 }
 
 void SmallOrderedHashMap::SmallOrderedHashMapVerify(Isolate* isolate) {
-  CHECK(IsSmallOrderedHashMap());
+  CHECK(IsSmallOrderedHashMap(*this));
   SmallOrderedHashTable<SmallOrderedHashMap>::SmallOrderedHashTableVerify(
       isolate);
   for (int entry = NumberOfElements(); entry < NumberOfDeletedElements();
        entry++) {
     for (int offset = 0; offset < kEntrySize; offset++) {
-      Object val = GetDataEntry(entry, offset);
-      CHECK(val.IsTheHole(isolate));
+      Tagged<Object> val = GetDataEntry(entry, offset);
+      CHECK(IsTheHole(val, isolate));
     }
   }
 }
 
 void SmallOrderedHashSet::SmallOrderedHashSetVerify(Isolate* isolate) {
-  CHECK(IsSmallOrderedHashSet());
+  CHECK(IsSmallOrderedHashSet(*this));
   SmallOrderedHashTable<SmallOrderedHashSet>::SmallOrderedHashTableVerify(
       isolate);
   for (int entry = NumberOfElements(); entry < NumberOfDeletedElements();
        entry++) {
     for (int offset = 0; offset < kEntrySize; offset++) {
-      Object val = GetDataEntry(entry, offset);
-      CHECK(val.IsTheHole(isolate));
+      Tagged<Object> val = GetDataEntry(entry, offset);
+      CHECK(IsTheHole(val, isolate));
     }
   }
 }
 
 void SmallOrderedNameDictionary::SmallOrderedNameDictionaryVerify(
     Isolate* isolate) {
-  CHECK(IsSmallOrderedNameDictionary());
+  CHECK(IsSmallOrderedNameDictionary(*this));
   SmallOrderedHashTable<
       SmallOrderedNameDictionary>::SmallOrderedHashTableVerify(isolate);
   for (int entry = NumberOfElements(); entry < NumberOfDeletedElements();
        entry++) {
     for (int offset = 0; offset < kEntrySize; offset++) {
-      Object val = GetDataEntry(entry, offset);
-      CHECK(val.IsTheHole(isolate) ||
+      Tagged<Object> val = GetDataEntry(entry, offset);
+      CHECK(IsTheHole(val, isolate) ||
             (PropertyDetails::Empty().AsSmi() == Smi::cast(val)));
     }
   }
@@ -1499,7 +1584,7 @@ void SwissNameDictionary::SwissNameDictionaryVerify(Isolate* isolate,
 
   CHECK(IsValidCapacity(Capacity()));
 
-  meta_table().ByteArrayVerify(isolate);
+  meta_table()->ByteArrayVerify(isolate);
 
   int seen_deleted = 0;
   int seen_present = 0;
@@ -1508,28 +1593,28 @@ void SwissNameDictionary::SwissNameDictionaryVerify(Isolate* isolate,
     ctrl_t ctrl = GetCtrl(i);
 
     if (IsFull(ctrl) || slow_checks) {
-      Object key = KeyAt(i);
-      Object value = ValueAtRaw(i);
+      Tagged<Object> key = KeyAt(i);
+      Tagged<Object> value = ValueAtRaw(i);
 
       if (IsFull(ctrl)) {
         ++seen_present;
 
-        Name name = Name::cast(key);
+        Tagged<Name> name = Name::cast(key);
         if (slow_checks) {
-          CHECK_EQ(swiss_table::H2(name.hash()), ctrl);
+          CHECK_EQ(swiss_table::H2(name->hash()), ctrl);
         }
 
-        CHECK(!key.IsTheHole());
-        CHECK(!value.IsTheHole());
-        name.NameVerify(isolate);
-        value.ObjectVerify(isolate);
+        CHECK(!IsTheHole(key));
+        CHECK(!IsTheHole(value));
+        name->NameVerify(isolate);
+        Object::ObjectVerify(value, isolate);
       } else if (IsDeleted(ctrl)) {
         ++seen_deleted;
-        CHECK(key.IsTheHole());
-        CHECK(value.IsTheHole());
+        CHECK(IsTheHole(key));
+        CHECK(IsTheHole(value));
       } else if (IsEmpty(ctrl)) {
-        CHECK(key.IsTheHole());
-        CHECK(value.IsTheHole());
+        CHECK(IsTheHole(key));
+        CHECK(IsTheHole(value));
       } else {
         // Something unexpected. Note that we don't use kSentinel at the moment.
         UNREACHABLE();
@@ -1568,26 +1653,28 @@ void JSRegExp::JSRegExpVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSRegExpVerify(*this, isolate);
   switch (type_tag()) {
     case JSRegExp::ATOM: {
-      FixedArray arr = FixedArray::cast(data());
-      CHECK(arr.get(JSRegExp::kAtomPatternIndex).IsString());
+      Tagged<FixedArray> arr = FixedArray::cast(data());
+      CHECK(IsString(arr->get(JSRegExp::kAtomPatternIndex)));
       break;
     }
     case JSRegExp::EXPERIMENTAL: {
-      FixedArray arr = FixedArray::cast(data());
-      Smi uninitialized = Smi::FromInt(JSRegExp::kUninitializedValue);
+      Tagged<FixedArray> arr = FixedArray::cast(data());
+      Tagged<Smi> uninitialized = Smi::FromInt(JSRegExp::kUninitializedValue);
 
-      Object latin1_code = arr.get(JSRegExp::kIrregexpLatin1CodeIndex);
-      Object uc16_code = arr.get(JSRegExp::kIrregexpUC16CodeIndex);
-      Object latin1_bytecode = arr.get(JSRegExp::kIrregexpLatin1BytecodeIndex);
-      Object uc16_bytecode = arr.get(JSRegExp::kIrregexpUC16BytecodeIndex);
+      Tagged<Object> latin1_code = arr->get(JSRegExp::kIrregexpLatin1CodeIndex);
+      Tagged<Object> uc16_code = arr->get(JSRegExp::kIrregexpUC16CodeIndex);
+      Tagged<Object> latin1_bytecode =
+          arr->get(JSRegExp::kIrregexpLatin1BytecodeIndex);
+      Tagged<Object> uc16_bytecode =
+          arr->get(JSRegExp::kIrregexpUC16BytecodeIndex);
 
-      bool is_compiled = latin1_code.IsCode();
+      bool is_compiled = IsCode(latin1_code);
       if (is_compiled) {
-        CHECK_EQ(Code::cast(latin1_code).builtin_id(),
+        CHECK_EQ(Code::cast(latin1_code)->builtin_id(),
                  Builtin::kRegExpExperimentalTrampoline);
         CHECK_EQ(uc16_code, latin1_code);
 
-        CHECK(latin1_bytecode.IsByteArray());
+        CHECK(IsByteArray(latin1_bytecode));
         CHECK_EQ(uc16_bytecode, latin1_bytecode);
       } else {
         CHECK_EQ(latin1_code, uninitialized);
@@ -1597,70 +1684,72 @@ void JSRegExp::JSRegExpVerify(Isolate* isolate) {
         CHECK_EQ(uc16_bytecode, uninitialized);
       }
 
-      CHECK_EQ(arr.get(JSRegExp::kIrregexpMaxRegisterCountIndex),
+      CHECK_EQ(arr->get(JSRegExp::kIrregexpMaxRegisterCountIndex),
                uninitialized);
-      CHECK(arr.get(JSRegExp::kIrregexpCaptureCountIndex).IsSmi());
-      CHECK_GE(Smi::ToInt(arr.get(JSRegExp::kIrregexpCaptureCountIndex)), 0);
-      CHECK_EQ(arr.get(JSRegExp::kIrregexpTicksUntilTierUpIndex),
+      CHECK(IsSmi(arr->get(JSRegExp::kIrregexpCaptureCountIndex)));
+      CHECK_GE(Smi::ToInt(arr->get(JSRegExp::kIrregexpCaptureCountIndex)), 0);
+      CHECK_EQ(arr->get(JSRegExp::kIrregexpTicksUntilTierUpIndex),
                uninitialized);
-      CHECK_EQ(arr.get(JSRegExp::kIrregexpBacktrackLimit), uninitialized);
+      CHECK_EQ(arr->get(JSRegExp::kIrregexpBacktrackLimit), uninitialized);
       break;
     }
     case JSRegExp::IRREGEXP: {
       bool can_be_interpreted = RegExp::CanGenerateBytecode();
 
-      FixedArray arr = FixedArray::cast(data());
-      Object one_byte_data = arr.get(JSRegExp::kIrregexpLatin1CodeIndex);
+      Tagged<FixedArray> arr = FixedArray::cast(data());
+      Tagged<Object> one_byte_data =
+          arr->get(JSRegExp::kIrregexpLatin1CodeIndex);
       // Smi : Not compiled yet (-1).
       // InstructionStream: Compiled irregexp code or trampoline to the
       // interpreter.
-      CHECK((one_byte_data.IsSmi() &&
+      CHECK((IsSmi(one_byte_data) &&
              Smi::ToInt(one_byte_data) == JSRegExp::kUninitializedValue) ||
-            one_byte_data.IsCode());
-      Object uc16_data = arr.get(JSRegExp::kIrregexpUC16CodeIndex);
-      CHECK((uc16_data.IsSmi() &&
+            IsCode(one_byte_data));
+      Tagged<Object> uc16_data = arr->get(JSRegExp::kIrregexpUC16CodeIndex);
+      CHECK((IsSmi(uc16_data) &&
              Smi::ToInt(uc16_data) == JSRegExp::kUninitializedValue) ||
-            uc16_data.IsCode());
+            IsCode(uc16_data));
 
-      Object one_byte_bytecode =
-          arr.get(JSRegExp::kIrregexpLatin1BytecodeIndex);
+      Tagged<Object> one_byte_bytecode =
+          arr->get(JSRegExp::kIrregexpLatin1BytecodeIndex);
       // Smi : Not compiled yet (-1).
       // ByteArray: Bytecode to interpret regexp.
-      CHECK((one_byte_bytecode.IsSmi() &&
+      CHECK((IsSmi(one_byte_bytecode) &&
              Smi::ToInt(one_byte_bytecode) == JSRegExp::kUninitializedValue) ||
-            (can_be_interpreted && one_byte_bytecode.IsByteArray()));
-      Object uc16_bytecode = arr.get(JSRegExp::kIrregexpUC16BytecodeIndex);
-      CHECK((uc16_bytecode.IsSmi() &&
+            (can_be_interpreted && IsByteArray(one_byte_bytecode)));
+      Tagged<Object> uc16_bytecode =
+          arr->get(JSRegExp::kIrregexpUC16BytecodeIndex);
+      CHECK((IsSmi(uc16_bytecode) &&
              Smi::ToInt(uc16_bytecode) == JSRegExp::kUninitializedValue) ||
-            (can_be_interpreted && uc16_bytecode.IsByteArray()));
+            (can_be_interpreted && IsByteArray(uc16_bytecode)));
 
-      CHECK_IMPLIES(one_byte_data.IsSmi(), one_byte_bytecode.IsSmi());
-      CHECK_IMPLIES(uc16_data.IsSmi(), uc16_bytecode.IsSmi());
+      CHECK_IMPLIES(IsSmi(one_byte_data), IsSmi(one_byte_bytecode));
+      CHECK_IMPLIES(IsSmi(uc16_data), IsSmi(uc16_bytecode));
 
-      CHECK(arr.get(JSRegExp::kIrregexpCaptureCountIndex).IsSmi());
-      CHECK_GE(Smi::ToInt(arr.get(JSRegExp::kIrregexpCaptureCountIndex)), 0);
-      CHECK(arr.get(JSRegExp::kIrregexpMaxRegisterCountIndex).IsSmi());
-      CHECK(arr.get(JSRegExp::kIrregexpTicksUntilTierUpIndex).IsSmi());
-      CHECK(arr.get(JSRegExp::kIrregexpBacktrackLimit).IsSmi());
+      CHECK(IsSmi(arr->get(JSRegExp::kIrregexpCaptureCountIndex)));
+      CHECK_GE(Smi::ToInt(arr->get(JSRegExp::kIrregexpCaptureCountIndex)), 0);
+      CHECK(IsSmi(arr->get(JSRegExp::kIrregexpMaxRegisterCountIndex)));
+      CHECK(IsSmi(arr->get(JSRegExp::kIrregexpTicksUntilTierUpIndex)));
+      CHECK(IsSmi(arr->get(JSRegExp::kIrregexpBacktrackLimit)));
       break;
     }
     default:
       CHECK_EQ(JSRegExp::NOT_COMPILED, type_tag());
-      CHECK(data().IsUndefined(isolate));
+      CHECK(IsUndefined(data(), isolate));
       break;
   }
 }
 
 void JSProxy::JSProxyVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::JSProxyVerify(*this, isolate);
-  CHECK(map().GetConstructor().IsJSFunction());
+  CHECK(IsJSFunction(map()->GetConstructor()));
   if (!IsRevoked()) {
-    CHECK_EQ(target().IsCallable(), map().is_callable());
-    CHECK_EQ(target().IsConstructor(), map().is_constructor());
+    CHECK_EQ(IsCallable(target()), map()->is_callable());
+    CHECK_EQ(IsConstructor(target()), map()->is_constructor());
   }
-  CHECK(map().prototype().IsNull(isolate));
+  CHECK(IsNull(map()->prototype(), isolate));
   // There should be no properties on a Proxy.
-  CHECK_EQ(0, map().NumberOfOwnDescriptors());
+  CHECK_EQ(0, map()->NumberOfOwnDescriptors());
 }
 
 void JSArrayBuffer::JSArrayBufferVerify(Isolate* isolate) {
@@ -1688,7 +1777,7 @@ void JSDataView::JSDataViewVerify(Isolate* isolate) {
   CHECK(!IsVariableLength());
   if (!WasDetached()) {
     CHECK_EQ(reinterpret_cast<uint8_t*>(
-                 JSArrayBuffer::cast(buffer()).backing_store()) +
+                 JSArrayBuffer::cast(buffer())->backing_store()) +
                  byte_offset(),
              data_pointer());
   }
@@ -1699,7 +1788,7 @@ void JSRabGsabDataView::JSRabGsabDataViewVerify(Isolate* isolate) {
   CHECK(IsVariableLength());
   if (!WasDetached()) {
     CHECK_EQ(reinterpret_cast<uint8_t*>(
-                 JSArrayBuffer::cast(buffer()).backing_store()) +
+                 JSArrayBuffer::cast(buffer())->backing_store()) +
                  byte_offset(),
              data_pointer());
   }
@@ -1720,26 +1809,26 @@ void SourceTextModuleInfoEntry::SourceTextModuleInfoEntryVerify(
     Isolate* isolate) {
   TorqueGeneratedClassVerifiers::SourceTextModuleInfoEntryVerify(*this,
                                                                  isolate);
-  CHECK_IMPLIES(import_name().IsString(), module_request() >= 0);
-  CHECK_IMPLIES(export_name().IsString() && import_name().IsString(),
-                local_name().IsUndefined(isolate));
+  CHECK_IMPLIES(IsString(import_name()), module_request() >= 0);
+  CHECK_IMPLIES(IsString(export_name()) && IsString(import_name()),
+                IsUndefined(local_name(), isolate));
 }
 
 void Module::ModuleVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::ModuleVerify(*this, isolate);
 
-  CHECK_EQ(status() == Module::kErrored, !exception().IsTheHole(isolate));
+  CHECK_EQ(status() == Module::kErrored, !IsTheHole(exception(), isolate));
 
-  CHECK(module_namespace().IsUndefined(isolate) ||
-        module_namespace().IsJSModuleNamespace());
-  if (module_namespace().IsJSModuleNamespace()) {
+  CHECK(IsUndefined(module_namespace(), isolate) ||
+        IsJSModuleNamespace(module_namespace()));
+  if (IsJSModuleNamespace(module_namespace())) {
     CHECK_LE(Module::kLinking, status());
-    CHECK_EQ(JSModuleNamespace::cast(module_namespace()).module(), *this);
+    CHECK_EQ(JSModuleNamespace::cast(module_namespace())->module(), *this);
   }
 
   if (!(status() == kErrored || status() == kEvaluating ||
         status() == kEvaluated)) {
-    CHECK(top_level_capability().IsUndefined());
+    CHECK(IsUndefined(top_level_capability()));
   }
 
   CHECK_NE(hash(), 0);
@@ -1748,13 +1837,13 @@ void Module::ModuleVerify(Isolate* isolate) {
 void ModuleRequest::ModuleRequestVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::ModuleRequestVerify(*this, isolate);
   CHECK_EQ(0,
-           import_assertions().length() % ModuleRequest::kAssertionEntrySize);
+           import_assertions()->length() % ModuleRequest::kAssertionEntrySize);
 
-  for (int i = 0; i < import_assertions().length();
+  for (int i = 0; i < import_assertions()->length();
        i += ModuleRequest::kAssertionEntrySize) {
-    CHECK(import_assertions().get(i).IsString());      // Assertion key
-    CHECK(import_assertions().get(i + 1).IsString());  // Assertion value
-    CHECK(import_assertions().get(i + 2).IsSmi());     // Assertion location
+    CHECK(IsString(import_assertions()->get(i)));      // Assertion key
+    CHECK(IsString(import_assertions()->get(i + 1)));  // Assertion value
+    CHECK(IsSmi(import_assertions()->get(i + 2)));     // Assertion location
   }
 }
 
@@ -1762,46 +1851,46 @@ void SourceTextModule::SourceTextModuleVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::SourceTextModuleVerify(*this, isolate);
 
   if (status() == kErrored) {
-    CHECK(code().IsSharedFunctionInfo());
+    CHECK(IsSharedFunctionInfo(code()));
   } else if (status() == kEvaluating || status() == kEvaluated) {
-    CHECK(code().IsJSGeneratorObject());
+    CHECK(IsJSGeneratorObject(code()));
   } else {
     if (status() == kLinked) {
-      CHECK(code().IsJSGeneratorObject());
+      CHECK(IsJSGeneratorObject(code()));
     } else if (status() == kLinking) {
-      CHECK(code().IsJSFunction());
+      CHECK(IsJSFunction(code()));
     } else if (status() == kPreLinking) {
-      CHECK(code().IsSharedFunctionInfo());
+      CHECK(IsSharedFunctionInfo(code()));
     } else if (status() == kUnlinked) {
-      CHECK(code().IsSharedFunctionInfo());
+      CHECK(IsSharedFunctionInfo(code()));
     }
     CHECK(!AsyncParentModuleCount());
     CHECK(!pending_async_dependencies());
     CHECK(!IsAsyncEvaluating());
   }
 
-  CHECK_EQ(requested_modules().length(), info().module_requests().length());
+  CHECK_EQ(requested_modules()->length(), info()->module_requests()->length());
 }
 
 void SyntheticModule::SyntheticModuleVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::SyntheticModuleVerify(*this, isolate);
 
-  for (int i = 0; i < export_names().length(); i++) {
-    CHECK(export_names().get(i).IsString());
+  for (int i = 0; i < export_names()->length(); i++) {
+    CHECK(IsString(export_names()->get(i)));
   }
 }
 
 void PrototypeInfo::PrototypeInfoVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::PrototypeInfoVerify(*this, isolate);
-  if (prototype_users().IsWeakArrayList()) {
+  if (IsWeakArrayList(prototype_users())) {
     PrototypeUsers::Verify(WeakArrayList::cast(prototype_users()));
   } else {
-    CHECK(prototype_users().IsSmi());
+    CHECK(IsSmi(prototype_users()));
   }
 }
 
-void PrototypeUsers::Verify(WeakArrayList array) {
-  if (array.length() == 0) {
+void PrototypeUsers::Verify(Tagged<WeakArrayList> array) {
+  if (array->length() == 0) {
     // Allow empty & uninitialized lists.
     return;
   }
@@ -1810,26 +1899,26 @@ void PrototypeUsers::Verify(WeakArrayList array) {
   int empty_slots_count = 0;
   while (empty_slot != kNoEmptySlotsMarker) {
     CHECK_GT(empty_slot, 0);
-    CHECK_LT(empty_slot, array.length());
-    empty_slot = array.Get(empty_slot).ToSmi().value();
+    CHECK_LT(empty_slot, array->length());
+    empty_slot = array->Get(empty_slot).ToSmi().value();
     ++empty_slots_count;
   }
 
   // Verify that all elements are either weak pointers or SMIs marking empty
   // slots.
   int weak_maps_count = 0;
-  for (int i = kFirstIndex; i < array.length(); ++i) {
-    HeapObject heap_object;
-    MaybeObject object = array.Get(i);
-    if ((object->GetHeapObjectIfWeak(&heap_object) && heap_object.IsMap()) ||
+  for (int i = kFirstIndex; i < array->length(); ++i) {
+    Tagged<HeapObject> heap_object;
+    MaybeObject object = array->Get(i);
+    if ((object.GetHeapObjectIfWeak(&heap_object) && IsMap(heap_object)) ||
         object->IsCleared()) {
       ++weak_maps_count;
     } else {
-      CHECK(object->IsSmi());
+      CHECK(IsSmi(object));
     }
   }
 
-  CHECK_EQ(weak_maps_count + empty_slots_count + 1, array.length());
+  CHECK_EQ(weak_maps_count + empty_slots_count + 1, array->length());
 }
 
 void EnumCache::EnumCacheVerify(Isolate* isolate) {
@@ -1843,13 +1932,13 @@ void EnumCache::EnumCacheVerify(Isolate* isolate) {
 
 void ObjectBoilerplateDescription::ObjectBoilerplateDescriptionVerify(
     Isolate* isolate) {
-  CHECK(IsObjectBoilerplateDescription());
+  CHECK(IsObjectBoilerplateDescription(*this));
   CHECK_GE(this->length(),
            ObjectBoilerplateDescription::kDescriptionStartIndex);
   this->FixedArrayVerify(isolate);
   for (int i = 0; i < length(); ++i) {
     // No ThinStrings in the boilerplate.
-    CHECK(!get(isolate, i).IsThinString(isolate));
+    CHECK(!IsThinString(get(isolate, i), isolate));
   }
 }
 
@@ -1857,7 +1946,7 @@ void ObjectBoilerplateDescription::ObjectBoilerplateDescriptionVerify(
 
 void WasmInstanceObject::WasmInstanceObjectVerify(Isolate* isolate) {
   JSObjectVerify(isolate);
-  CHECK(IsWasmInstanceObject());
+  CHECK(IsWasmInstanceObject(*this));
 
   // Just generically check all tagged fields. Don't check the untagged fields,
   // as some of them might still contain the "undefined" value if the
@@ -1870,23 +1959,23 @@ void WasmInstanceObject::WasmInstanceObjectVerify(Isolate* isolate) {
 
 void WasmValueObject::WasmValueObjectVerify(Isolate* isolate) {
   JSObjectVerify(isolate);
-  CHECK(IsWasmValueObject());
+  CHECK(IsWasmValueObject(*this));
 }
 
 void WasmExceptionPackage::WasmExceptionPackageVerify(Isolate* isolate) {
   JSObjectVerify(isolate);
-  CHECK(IsWasmExceptionPackage());
+  CHECK(IsWasmExceptionPackage(*this));
 }
 
 void WasmExportedFunctionData::WasmExportedFunctionDataVerify(
     Isolate* isolate) {
   TorqueGeneratedClassVerifiers::WasmExportedFunctionDataVerify(*this, isolate);
   CHECK(
-      wrapper_code().kind() == CodeKind::JS_TO_WASM_FUNCTION ||
-      wrapper_code().kind() == CodeKind::C_WASM_ENTRY ||
-      (wrapper_code().is_builtin() &&
-       (wrapper_code().builtin_id() == Builtin::kGenericJSToWasmWrapper ||
-        wrapper_code().builtin_id() == Builtin::kWasmReturnPromiseOnSuspend)));
+      wrapper_code()->kind() == CodeKind::JS_TO_WASM_FUNCTION ||
+      wrapper_code()->kind() == CodeKind::C_WASM_ENTRY ||
+      (wrapper_code()->is_builtin() &&
+       (wrapper_code()->builtin_id() == Builtin::kJSToWasmWrapper ||
+        wrapper_code()->builtin_id() == Builtin::kWasmReturnPromiseOnSuspend)));
 }
 
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -1900,12 +1989,12 @@ void DataHandler::DataHandlerVerify(Isolate* isolate) {
   static_assert(DataHandler::kHeaderSize == 6 * kTaggedSize);
 
   StructVerify(isolate);
-  CHECK(IsDataHandler());
+  CHECK(IsDataHandler(*this));
   VerifyPointer(isolate, smi_handler(isolate));
-  CHECK_IMPLIES(!smi_handler().IsSmi(),
-                IsStoreHandler() && smi_handler().IsCode());
+  CHECK_IMPLIES(!IsSmi(smi_handler()),
+                IsStoreHandler(*this) && IsCode(smi_handler()));
   VerifyPointer(isolate, validity_cell(isolate));
-  CHECK(validity_cell().IsSmi() || validity_cell().IsCell());
+  CHECK(IsSmi(validity_cell()) || IsCell(validity_cell()));
   int data_count = data_field_count();
   if (data_count >= 1) {
     VerifyMaybeObjectField(isolate, kData1Offset);
@@ -1932,41 +2021,48 @@ void CallHandlerInfo::CallHandlerInfoVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::CallHandlerInfoVerify(*this, isolate);
   CHECK(map() == ReadOnlyRoots(isolate).side_effect_call_handler_info_map() ||
         map() ==
-            ReadOnlyRoots(isolate).side_effect_free_call_handler_info_map() ||
-        map() == ReadOnlyRoots(isolate)
-                     .next_call_side_effect_free_call_handler_info_map());
+            ReadOnlyRoots(isolate).side_effect_free_call_handler_info_map());
 }
 
 void AllocationSite::AllocationSiteVerify(Isolate* isolate) {
-  CHECK(IsAllocationSite());
-  CHECK(dependent_code().IsDependentCode());
-  CHECK(transition_info_or_boilerplate().IsSmi() ||
-        transition_info_or_boilerplate().IsJSObject());
-  CHECK(nested_site().IsAllocationSite() || nested_site() == Smi::zero());
+  CHECK(IsAllocationSite(*this));
+  CHECK(IsDependentCode(dependent_code()));
+  CHECK(IsSmi(transition_info_or_boilerplate()) ||
+        IsJSObject(transition_info_or_boilerplate()));
+  CHECK(IsAllocationSite(nested_site()) || nested_site() == Smi::zero());
 }
 
 void Script::ScriptVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::ScriptVerify(*this, isolate);
+#if V8_ENABLE_WEBASSEMBLY
+  if (type() == Script::Type::kWasm) {
+    CHECK_EQ(line_ends(), ReadOnlyRoots(isolate).empty_fixed_array());
+  } else {
+    CHECK(CanHaveLineEnds());
+  }
+#else   // V8_ENABLE_WEBASSEMBLY
+  CHECK(CanHaveLineEnds());
+#endif  // V8_ENABLE_WEBASSEMBLY
   for (int i = 0; i < shared_function_info_count(); ++i) {
-    MaybeObject maybe_object = shared_function_infos().Get(i);
-    HeapObject heap_object;
+    MaybeObject maybe_object = shared_function_infos()->Get(i);
+    Tagged<HeapObject> heap_object;
     CHECK(maybe_object->IsWeak() || maybe_object->IsCleared() ||
-          (maybe_object->GetHeapObjectIfStrong(&heap_object) &&
-           heap_object.IsUndefined(isolate)));
+          (maybe_object.GetHeapObjectIfStrong(&heap_object) &&
+           IsUndefined(heap_object, isolate)));
   }
 }
 
 void NormalizedMapCache::NormalizedMapCacheVerify(Isolate* isolate) {
-  WeakFixedArray::cast(*this).WeakFixedArrayVerify(isolate);
+  WeakFixedArray::cast(*this)->WeakFixedArrayVerify(isolate);
   if (v8_flags.enable_slow_asserts) {
     for (int i = 0; i < length(); i++) {
       MaybeObject e = WeakFixedArray::Get(i);
-      HeapObject heap_object;
-      if (e->GetHeapObjectIfWeak(&heap_object)) {
-        Map::cast(heap_object).DictionaryMapVerify(isolate);
+      Tagged<HeapObject> heap_object;
+      if (e.GetHeapObjectIfWeak(&heap_object)) {
+        Map::cast(heap_object)->DictionaryMapVerify(isolate);
       } else {
-        CHECK(e->IsCleared() || (e->GetHeapObjectIfStrong(&heap_object) &&
-                                 heap_object.IsUndefined(isolate)));
+        CHECK(e->IsCleared() || (e.GetHeapObjectIfStrong(&heap_object) &&
+                                 IsUndefined(heap_object, isolate)));
       }
     }
   }
@@ -1978,8 +2074,8 @@ void PreparseData::PreparseDataVerify(Isolate* isolate) {
   CHECK_LE(0, children_length());
 
   for (int i = 0; i < children_length(); ++i) {
-    Object child = get_child_raw(i);
-    CHECK(child.IsNull() || child.IsPreparseData());
+    Tagged<Object> child = get_child_raw(i);
+    CHECK(IsNull(child) || IsPreparseData(child));
     VerifyPointer(isolate, child);
   }
 }
@@ -1988,9 +2084,9 @@ void CallSiteInfo::CallSiteInfoVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::CallSiteInfoVerify(*this, isolate);
 #if V8_ENABLE_WEBASSEMBLY
   CHECK_IMPLIES(IsAsmJsWasm(), IsWasm());
-  CHECK_IMPLIES(IsWasm(), receiver_or_instance().IsWasmInstanceObject());
-  CHECK_IMPLIES(IsWasm(), function().IsSmi());
-  CHECK_IMPLIES(!IsWasm(), function().IsJSFunction());
+  CHECK_IMPLIES(IsWasm(), IsWasmInstanceObject(receiver_or_instance()));
+  CHECK_IMPLIES(IsWasm() || IsBuiltin(), IsSmi(function()));
+  CHECK_IMPLIES(!IsWasm() && !IsBuiltin(), IsJSFunction(function()));
   CHECK_IMPLIES(IsAsync(), !IsWasm());
   CHECK_IMPLIES(IsConstructor(), !IsWasm());
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -1998,8 +2094,8 @@ void CallSiteInfo::CallSiteInfoVerify(Isolate* isolate) {
 
 void FunctionTemplateRareData::FunctionTemplateRareDataVerify(
     Isolate* isolate) {
-  CHECK(c_function_overloads().IsFixedArray() ||
-        c_function_overloads().IsUndefined(isolate));
+  CHECK(IsFixedArray(c_function_overloads()) ||
+        IsUndefined(c_function_overloads(), isolate));
 }
 
 void StackFrameInfo::StackFrameInfoVerify(Isolate* isolate) {
@@ -2008,8 +2104,8 @@ void StackFrameInfo::StackFrameInfoVerify(Isolate* isolate) {
 
 void ErrorStackData::ErrorStackDataVerify(Isolate* isolate) {
   TorqueGeneratedClassVerifiers::ErrorStackDataVerify(*this, isolate);
-  CHECK_IMPLIES(!call_site_infos_or_formatted_stack().IsFixedArray(),
-                limit_or_stack_frame_infos().IsFixedArray());
+  CHECK_IMPLIES(!IsFixedArray(call_site_infos_or_formatted_stack()),
+                IsFixedArray(limit_or_stack_frame_infos()));
 }
 
 // Helper class for verifying the string table.
@@ -2026,12 +2122,12 @@ class StringTableVerifier : public RootVisitor {
                          OffHeapObjectSlot end) override {
     // Visit all HeapObject pointers in [start, end).
     for (OffHeapObjectSlot p = start; p < end; ++p) {
-      Object o = p.load(isolate_);
+      Tagged<Object> o = p.load(isolate_);
       DCHECK(!HasWeakHeapObjectTag(o));
-      if (o.IsHeapObject()) {
-        HeapObject object = HeapObject::cast(o);
+      if (IsHeapObject(o)) {
+        Tagged<HeapObject> object = HeapObject::cast(o);
         // Check that the string is actually internalized.
-        CHECK(object.IsInternalizedString());
+        CHECK(IsInternalizedString(object));
       }
     }
   }
@@ -2057,24 +2153,24 @@ void JSObject::IncrementSpillStatistics(Isolate* isolate,
   // Named properties
   if (HasFastProperties()) {
     info->number_of_objects_with_fast_properties_++;
-    info->number_of_fast_used_fields_ += map().NextFreePropertyIndex();
-    info->number_of_fast_unused_fields_ += map().UnusedPropertyFields();
-  } else if (IsJSGlobalObject()) {
-    GlobalDictionary dict =
-        JSGlobalObject::cast(*this).global_dictionary(kAcquireLoad);
-    info->number_of_slow_used_properties_ += dict.NumberOfElements();
+    info->number_of_fast_used_fields_ += map()->NextFreePropertyIndex();
+    info->number_of_fast_unused_fields_ += map()->UnusedPropertyFields();
+  } else if (IsJSGlobalObject(*this)) {
+    Tagged<GlobalDictionary> dict =
+        JSGlobalObject::cast(*this)->global_dictionary(kAcquireLoad);
+    info->number_of_slow_used_properties_ += dict->NumberOfElements();
     info->number_of_slow_unused_properties_ +=
-        dict.Capacity() - dict.NumberOfElements();
+        dict->Capacity() - dict->NumberOfElements();
   } else if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-    SwissNameDictionary dict = property_dictionary_swiss();
-    info->number_of_slow_used_properties_ += dict.NumberOfElements();
+    Tagged<SwissNameDictionary> dict = property_dictionary_swiss();
+    info->number_of_slow_used_properties_ += dict->NumberOfElements();
     info->number_of_slow_unused_properties_ +=
-        dict.Capacity() - dict.NumberOfElements();
+        dict->Capacity() - dict->NumberOfElements();
   } else {
-    NameDictionary dict = property_dictionary();
-    info->number_of_slow_used_properties_ += dict.NumberOfElements();
+    Tagged<NameDictionary> dict = property_dictionary();
+    info->number_of_slow_used_properties_ += dict->NumberOfElements();
     info->number_of_slow_unused_properties_ +=
-        dict.Capacity() - dict.NumberOfElements();
+        dict->Capacity() - dict->NumberOfElements();
   }
   // Indexed properties
   switch (GetElementsKind()) {
@@ -2094,10 +2190,10 @@ void JSObject::IncrementSpillStatistics(Isolate* isolate,
     case SHARED_ARRAY_ELEMENTS: {
       info->number_of_objects_with_fast_elements_++;
       int holes = 0;
-      FixedArray e = FixedArray::cast(elements());
-      int len = e.length();
+      Tagged<FixedArray> e = FixedArray::cast(elements());
+      int len = e->length();
       for (int i = 0; i < len; i++) {
-        if (e.get(i).IsTheHole(isolate)) holes++;
+        if (IsTheHole(e->get(i), isolate)) holes++;
       }
       info->number_of_fast_used_elements_ += len - holes;
       info->number_of_fast_unused_elements_ += holes;
@@ -2111,16 +2207,16 @@ void JSObject::IncrementSpillStatistics(Isolate* isolate,
 #undef TYPED_ARRAY_CASE
       {
         info->number_of_objects_with_fast_elements_++;
-        FixedArrayBase e = FixedArrayBase::cast(elements());
-        info->number_of_fast_used_elements_ += e.length();
+        Tagged<FixedArrayBase> e = FixedArrayBase::cast(elements());
+        info->number_of_fast_used_elements_ += e->length();
         break;
       }
     case DICTIONARY_ELEMENTS:
     case SLOW_STRING_WRAPPER_ELEMENTS: {
-      NumberDictionary dict = element_dictionary();
-      info->number_of_slow_used_elements_ += dict.NumberOfElements();
+      Tagged<NumberDictionary> dict = element_dictionary();
+      info->number_of_slow_used_elements_ += dict->NumberOfElements();
       info->number_of_slow_unused_elements_ +=
-          dict.Capacity() - dict.NumberOfElements();
+          dict->Capacity() - dict->NumberOfElements();
       break;
     }
     case FAST_SLOPPY_ARGUMENTS_ELEMENTS:
@@ -2168,20 +2264,20 @@ void JSObject::SpillInformation::Print() {
 }
 
 bool DescriptorArray::IsSortedNoDuplicates() {
-  Name current_key;
+  Tagged<Name> current_key;
   uint32_t current = 0;
   for (int i = 0; i < number_of_descriptors(); i++) {
-    Name key = GetSortedKey(i);
+    Tagged<Name> key = GetSortedKey(i);
     uint32_t hash;
-    const bool has_hash = key.TryGetHash(&hash);
+    const bool has_hash = key->TryGetHash(&hash);
     CHECK(has_hash);
     if (key == current_key) {
-      Print();
+      Print(*this);
       return false;
     }
     current_key = key;
     if (hash < current) {
-      Print();
+      Print(*this);
       return false;
     }
     current = hash;
@@ -2190,21 +2286,21 @@ bool DescriptorArray::IsSortedNoDuplicates() {
 }
 
 bool TransitionArray::IsSortedNoDuplicates() {
-  Name prev_key;
+  Tagged<Name> prev_key;
   PropertyKind prev_kind = PropertyKind::kData;
   PropertyAttributes prev_attributes = NONE;
   uint32_t prev_hash = 0;
 
   for (int i = 0; i < number_of_transitions(); i++) {
-    Name key = GetSortedKey(i);
+    Tagged<Name> key = GetSortedKey(i);
     uint32_t hash;
-    const bool has_hash = key.TryGetHash(&hash);
+    const bool has_hash = key->TryGetHash(&hash);
     CHECK(has_hash);
     PropertyKind kind = PropertyKind::kData;
     PropertyAttributes attributes = NONE;
-    if (!TransitionsAccessor::IsSpecialTransition(key.GetReadOnlyRoots(),
+    if (!TransitionsAccessor::IsSpecialTransition(key->GetReadOnlyRoots(),
                                                   key)) {
-      Map target = GetTarget(i);
+      Tagged<Map> target = GetTarget(i);
       PropertyDetails details =
           TransitionsAccessor::GetTargetDetails(key, target);
       kind = details.kind();
@@ -2217,7 +2313,7 @@ bool TransitionArray::IsSortedNoDuplicates() {
     int cmp = CompareKeys(prev_key, prev_hash, prev_kind, prev_attributes, key,
                           hash, kind, attributes);
     if (cmp >= 0) {
-      Print();
+      Print(*this);
       return false;
     }
     prev_key = key;
@@ -2231,17 +2327,18 @@ bool TransitionArray::IsSortedNoDuplicates() {
 bool TransitionsAccessor::IsSortedNoDuplicates() {
   // Simple and non-existent transitions are always sorted.
   if (encoding() != kFullTransitionArray) return true;
-  return transitions().IsSortedNoDuplicates();
+  return transitions()->IsSortedNoDuplicates();
 }
 
-static bool CheckOneBackPointer(Map current_map, Object target) {
-  return !target.IsMap() || Map::cast(target).GetBackPointer() == current_map;
+static bool CheckOneBackPointer(Tagged<Map> current_map,
+                                Tagged<Object> target) {
+  return !IsMap(target) || Map::cast(target)->GetBackPointer() == current_map;
 }
 
 bool TransitionsAccessor::IsConsistentWithBackPointers() {
   int num_transitions = NumberOfTransitions();
   for (int i = 0; i < num_transitions; i++) {
-    Map target = GetTarget(i);
+    Tagged<Map> target = GetTarget(i);
     if (!CheckOneBackPointer(map_, target)) return false;
   }
   return true;
diff --git a/deps/v8/src/diagnostics/objects-printer.cc b/deps/v8/src/diagnostics/objects-printer.cc
index 30d8095f62a741..5d9509112f11bc 100644
--- a/deps/v8/src/diagnostics/objects-printer.cc
+++ b/deps/v8/src/diagnostics/objects-printer.cc
@@ -19,6 +19,7 @@
 #include "src/objects/instance-type.h"
 #include "src/regexp/regexp.h"
 #include "src/snapshot/embedded/embedded-data.h"
+#include "src/strings/string-stream.h"
 #include "src/utils/ostreams.h"
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -31,38 +32,42 @@
 namespace v8 {
 namespace internal {
 
+namespace {
+constexpr char kUnavailableString[] = "unavailable";
+}  // namespace
+
 #ifdef OBJECT_PRINT
 
-void Object::Print() const {
+void Print(Tagged<Object> obj) {
   // Output into debugger's command window if a debugger is attached.
   DbgStdoutStream dbg_os;
-  this->Print(dbg_os);
+  Print(obj, dbg_os);
   dbg_os << std::flush;
 
   StdoutStream os;
-  this->Print(os);
+  Print(obj, os);
   os << std::flush;
 }
 
-void Object::Print(std::ostream& os) const {
-  if (IsSmi()) {
-    os << "Smi: " << std::hex << "0x" << Smi::ToInt(*this);
-    os << std::dec << " (" << Smi::ToInt(*this) << ")\n";
+void Print(Tagged<Object> obj, std::ostream& os) {
+  if (IsSmi(obj)) {
+    os << "Smi: " << std::hex << "0x" << Smi::ToInt(obj);
+    os << std::dec << " (" << Smi::ToInt(obj) << ")\n";
   } else {
-    HeapObject::cast(*this).HeapObjectPrint(os);
+    HeapObject::cast(obj)->HeapObjectPrint(os);
   }
 }
 
 namespace {
 
-void PrintHeapObjectHeaderWithoutMap(HeapObject object, std::ostream& os,
-                                     const char* id) {
-  PtrComprCageBase cage_base = GetPtrComprCageBaseSlow(object);
+void PrintHeapObjectHeaderWithoutMap(Tagged<HeapObject> object,
+                                     std::ostream& os, const char* id) {
+  PtrComprCageBase cage_base = GetPtrComprCageBase();
   os << reinterpret_cast<void*>(object.ptr()) << ": [";
   if (id != nullptr) {
     os << id;
   } else {
-    os << object.map(cage_base).instance_type();
+    os << object->map(cage_base)->instance_type();
   }
   os << "]";
   if (ReadOnlyHeap::Contains(object)) {
@@ -73,11 +78,11 @@ void PrintHeapObjectHeaderWithoutMap(HeapObject object, std::ostream& os,
 }
 
 template <typename T>
-void PrintDictionaryContents(std::ostream& os, T dict) {
+void PrintDictionaryContents(std::ostream& os, Tagged<T> dict) {
   DisallowGarbageCollection no_gc;
-  ReadOnlyRoots roots = dict.GetReadOnlyRoots();
+  ReadOnlyRoots roots = dict->GetReadOnlyRoots();
 
-  if (dict.Capacity() == 0) {
+  if (dict->Capacity() == 0) {
     return;
   }
 
@@ -86,34 +91,34 @@ void PrintDictionaryContents(std::ostream& os, T dict) {
   // IterateEntries for SwissNameDictionary needs to create a handle.
   HandleScope scope(isolate);
 #endif
-  for (InternalIndex i : dict.IterateEntries()) {
-    Object k;
-    if (!dict.ToKey(roots, i, &k)) continue;
+  for (InternalIndex i : dict->IterateEntries()) {
+    Tagged<Object> k;
+    if (!dict->ToKey(roots, i, &k)) continue;
     os << "\n   ";
-    if (k.IsString()) {
-      String::cast(k).PrintUC16(os);
+    if (IsString(k)) {
+      String::cast(k)->PrintUC16(os);
     } else {
       os << Brief(k);
     }
-    os << ": " << Brief(dict.ValueAt(i)) << " ";
-    dict.DetailsAt(i).PrintAsSlowTo(os, !T::kIsOrderedDictionaryType);
+    os << ": " << Brief(dict->ValueAt(i)) << " ";
+    dict->DetailsAt(i).PrintAsSlowTo(os, !T::kIsOrderedDictionaryType);
   }
 }
 }  // namespace
 
 void HeapObject::PrintHeader(std::ostream& os, const char* id) {
   PrintHeapObjectHeaderWithoutMap(*this, os, id);
-  PtrComprCageBase cage_base = GetPtrComprCageBaseSlow(*this);
-  if (!IsMap(cage_base)) os << "\n - map: " << Brief(map(cage_base));
+  PtrComprCageBase cage_base = GetPtrComprCageBase();
+  if (!IsMap(*this, cage_base)) os << "\n - map: " << Brief(map(cage_base));
 }
 
 void HeapObject::HeapObjectPrint(std::ostream& os) {
-  PtrComprCageBase cage_base = GetPtrComprCageBaseSlow(*this);
+  PtrComprCageBase cage_base = GetPtrComprCageBase();
 
-  InstanceType instance_type = map(cage_base).instance_type();
+  InstanceType instance_type = map(cage_base)->instance_type();
 
   if (instance_type < FIRST_NONSTRING_TYPE) {
-    String::cast(*this).StringPrint(os);
+    String::cast(*this)->StringPrint(os);
     os << "\n";
     return;
   }
@@ -128,56 +133,56 @@ void HeapObject::HeapObjectPrint(std::ostream& os) {
     case MODULE_CONTEXT_TYPE:
     case SCRIPT_CONTEXT_TYPE:
     case WITH_CONTEXT_TYPE:
-      Context::cast(*this).ContextPrint(os);
+      Context::cast(*this)->ContextPrint(os);
       break;
     case SCRIPT_CONTEXT_TABLE_TYPE:
-      FixedArray::cast(*this).FixedArrayPrint(os);
+      FixedArray::cast(*this)->FixedArrayPrint(os);
       break;
     case NATIVE_CONTEXT_TYPE:
-      NativeContext::cast(*this).NativeContextPrint(os);
+      NativeContext::cast(*this)->NativeContextPrint(os);
       break;
     case HASH_TABLE_TYPE:
-      ObjectHashTable::cast(*this).ObjectHashTablePrint(os);
+      ObjectHashTable::cast(*this)->ObjectHashTablePrint(os);
       break;
     case NAME_TO_INDEX_HASH_TABLE_TYPE:
-      NameToIndexHashTable::cast(*this).NameToIndexHashTablePrint(os);
+      NameToIndexHashTable::cast(*this)->NameToIndexHashTablePrint(os);
       break;
     case REGISTERED_SYMBOL_TABLE_TYPE:
-      RegisteredSymbolTable::cast(*this).RegisteredSymbolTablePrint(os);
+      RegisteredSymbolTable::cast(*this)->RegisteredSymbolTablePrint(os);
       break;
     case ORDERED_HASH_MAP_TYPE:
-      OrderedHashMap::cast(*this).OrderedHashMapPrint(os);
+      OrderedHashMap::cast(*this)->OrderedHashMapPrint(os);
       break;
     case ORDERED_HASH_SET_TYPE:
-      OrderedHashSet::cast(*this).OrderedHashSetPrint(os);
+      OrderedHashSet::cast(*this)->OrderedHashSetPrint(os);
       break;
     case ORDERED_NAME_DICTIONARY_TYPE:
-      OrderedNameDictionary::cast(*this).OrderedNameDictionaryPrint(os);
+      OrderedNameDictionary::cast(*this)->OrderedNameDictionaryPrint(os);
       break;
     case NAME_DICTIONARY_TYPE:
-      NameDictionary::cast(*this).NameDictionaryPrint(os);
+      NameDictionary::cast(*this)->NameDictionaryPrint(os);
       break;
     case GLOBAL_DICTIONARY_TYPE:
-      GlobalDictionary::cast(*this).GlobalDictionaryPrint(os);
+      GlobalDictionary::cast(*this)->GlobalDictionaryPrint(os);
       break;
     case SIMPLE_NUMBER_DICTIONARY_TYPE:
-      FixedArray::cast(*this).FixedArrayPrint(os);
+      FixedArray::cast(*this)->FixedArrayPrint(os);
       break;
     case NUMBER_DICTIONARY_TYPE:
-      NumberDictionary::cast(*this).NumberDictionaryPrint(os);
+      NumberDictionary::cast(*this)->NumberDictionaryPrint(os);
       break;
     case EPHEMERON_HASH_TABLE_TYPE:
-      EphemeronHashTable::cast(*this).EphemeronHashTablePrint(os);
+      EphemeronHashTable::cast(*this)->EphemeronHashTablePrint(os);
       break;
     case OBJECT_BOILERPLATE_DESCRIPTION_TYPE:
       ObjectBoilerplateDescription::cast(*this)
-          .ObjectBoilerplateDescriptionPrint(os);
+          ->ObjectBoilerplateDescriptionPrint(os);
       break;
     case TRANSITION_ARRAY_TYPE:
-      TransitionArray::cast(*this).TransitionArrayPrint(os);
+      TransitionArray::cast(*this)->TransitionArrayPrint(os);
       break;
     case CLOSURE_FEEDBACK_CELL_ARRAY_TYPE:
-      ClosureFeedbackCellArray::cast(*this).ClosureFeedbackCellArrayPrint(os);
+      ClosureFeedbackCellArray::cast(*this)->ClosureFeedbackCellArrayPrint(os);
       break;
 
     case FILLER_TYPE:
@@ -197,37 +202,37 @@ void HeapObject::HeapObjectPrint(std::ostream& os) {
     case JS_SPECIAL_API_OBJECT_TYPE:
     case JS_STRING_ITERATOR_PROTOTYPE_TYPE:
     case JS_TYPED_ARRAY_PROTOTYPE_TYPE:
-      JSObject::cast(*this).JSObjectPrint(os);
+      JSObject::cast(*this)->JSObjectPrint(os);
       break;
 #if V8_ENABLE_WEBASSEMBLY
     case WASM_INSTANCE_OBJECT_TYPE:
-      WasmInstanceObject::cast(*this).WasmInstanceObjectPrint(os);
+      WasmInstanceObject::cast(*this)->WasmInstanceObjectPrint(os);
       break;
     case WASM_VALUE_OBJECT_TYPE:
-      WasmValueObject::cast(*this).WasmValueObjectPrint(os);
+      WasmValueObject::cast(*this)->WasmValueObjectPrint(os);
       break;
     case WASM_EXCEPTION_PACKAGE_TYPE:
-      WasmExceptionPackage::cast(*this).WasmExceptionPackagePrint(os);
+      WasmExceptionPackage::cast(*this)->WasmExceptionPackagePrint(os);
       break;
 #endif  // V8_ENABLE_WEBASSEMBLY
     case INSTRUCTION_STREAM_TYPE:
-      InstructionStream::cast(*this).InstructionStreamPrint(os);
+      InstructionStream::cast(*this)->InstructionStreamPrint(os);
       break;
     case CODE_TYPE:
-      Code::cast(*this).CodePrint(os);
+      Code::cast(*this)->CodePrint(os);
       break;
     case JS_SET_KEY_VALUE_ITERATOR_TYPE:
     case JS_SET_VALUE_ITERATOR_TYPE:
-      JSSetIterator::cast(*this).JSSetIteratorPrint(os);
+      JSSetIterator::cast(*this)->JSSetIteratorPrint(os);
       break;
     case JS_MAP_KEY_ITERATOR_TYPE:
     case JS_MAP_KEY_VALUE_ITERATOR_TYPE:
     case JS_MAP_VALUE_ITERATOR_TYPE:
-      JSMapIterator::cast(*this).JSMapIteratorPrint(os);
+      JSMapIterator::cast(*this)->JSMapIteratorPrint(os);
       break;
-#define MAKE_TORQUE_CASE(Name, TYPE)   \
-  case TYPE:                           \
-    Name::cast(*this).Name##Print(os); \
+#define MAKE_TORQUE_CASE(Name, TYPE)    \
+  case TYPE:                            \
+    Name::cast(*this)->Name##Print(os); \
     break;
       // Every class that has its fields defined in a .tq file and corresponds
       // to exactly one InstanceType value is included in the following list.
@@ -236,19 +241,19 @@ void HeapObject::HeapObjectPrint(std::ostream& os) {
 #undef MAKE_TORQUE_CASE
 
     case ALLOCATION_SITE_TYPE:
-      AllocationSite::cast(*this).AllocationSitePrint(os);
+      AllocationSite::cast(*this)->AllocationSitePrint(os);
       break;
     case LOAD_HANDLER_TYPE:
-      LoadHandler::cast(*this).LoadHandlerPrint(os);
+      LoadHandler::cast(*this)->LoadHandlerPrint(os);
       break;
     case STORE_HANDLER_TYPE:
-      StoreHandler::cast(*this).StoreHandlerPrint(os);
+      StoreHandler::cast(*this)->StoreHandlerPrint(os);
       break;
     case FEEDBACK_METADATA_TYPE:
-      FeedbackMetadata::cast(*this).FeedbackMetadataPrint(os);
+      FeedbackMetadata::cast(*this)->FeedbackMetadataPrint(os);
       break;
     case BIG_INT_BASE_TYPE:
-      BigIntBase::cast(*this).BigIntBasePrint(os);
+      BigIntBase::cast(*this)->BigIntBasePrint(os);
       break;
     case JS_CLASS_CONSTRUCTOR_TYPE:
     case JS_PROMISE_CONSTRUCTOR_TYPE:
@@ -258,34 +263,35 @@ void HeapObject::HeapObjectPrint(std::ostream& os) {
   case TYPE##_TYPED_ARRAY_CONSTRUCTOR_TYPE:
       TYPED_ARRAYS(TYPED_ARRAY_CONSTRUCTORS_SWITCH)
 #undef TYPED_ARRAY_CONSTRUCTORS_SWITCH
-      JSFunction::cast(*this).JSFunctionPrint(os);
-      break;
-    case INTERNALIZED_STRING_TYPE:
-    case EXTERNAL_INTERNALIZED_STRING_TYPE:
-    case ONE_BYTE_INTERNALIZED_STRING_TYPE:
-    case EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE:
-    case UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE:
-    case UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE:
-    case STRING_TYPE:
-    case CONS_STRING_TYPE:
-    case EXTERNAL_STRING_TYPE:
-    case SLICED_STRING_TYPE:
-    case THIN_STRING_TYPE:
-    case ONE_BYTE_STRING_TYPE:
+      JSFunction::cast(*this)->JSFunctionPrint(os);
+      break;
+    case INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case INTERNALIZED_ONE_BYTE_STRING_TYPE:
+    case EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE:
+    case UNCACHED_EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case UNCACHED_EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE:
+    case SEQ_TWO_BYTE_STRING_TYPE:
+    case CONS_TWO_BYTE_STRING_TYPE:
+    case EXTERNAL_TWO_BYTE_STRING_TYPE:
+    case SLICED_TWO_BYTE_STRING_TYPE:
+    case THIN_TWO_BYTE_STRING_TYPE:
+    case SEQ_ONE_BYTE_STRING_TYPE:
     case CONS_ONE_BYTE_STRING_TYPE:
     case EXTERNAL_ONE_BYTE_STRING_TYPE:
     case SLICED_ONE_BYTE_STRING_TYPE:
-    case UNCACHED_EXTERNAL_STRING_TYPE:
+    case THIN_ONE_BYTE_STRING_TYPE:
+    case UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE:
-    case SHARED_STRING_TYPE:
-    case SHARED_ONE_BYTE_STRING_TYPE:
-    case SHARED_EXTERNAL_STRING_TYPE:
+    case SHARED_SEQ_TWO_BYTE_STRING_TYPE:
+    case SHARED_SEQ_ONE_BYTE_STRING_TYPE:
+    case SHARED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE:
-    case SHARED_UNCACHED_EXTERNAL_STRING_TYPE:
+    case SHARED_UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case SHARED_UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE:
     case JS_LAST_DUMMY_API_OBJECT_TYPE:
       // TODO(all): Handle these types too.
-      os << "UNKNOWN TYPE " << map().instance_type();
+      os << "UNKNOWN TYPE " << map()->instance_type();
       UNREACHABLE();
   }
 }
@@ -309,13 +315,13 @@ void FreeSpace::FreeSpacePrint(std::ostream& os) {
 
 bool JSObject::PrintProperties(std::ostream& os) {
   if (HasFastProperties()) {
-    DescriptorArray descs = map().instance_descriptors(GetIsolate());
-    int nof_inobject_properties = map().GetInObjectProperties();
-    for (InternalIndex i : map().IterateOwnDescriptors()) {
+    Tagged<DescriptorArray> descs = map()->instance_descriptors(GetIsolate());
+    int nof_inobject_properties = map()->GetInObjectProperties();
+    for (InternalIndex i : map()->IterateOwnDescriptors()) {
       os << "\n    ";
-      descs.GetKey(i).NamePrint(os);
+      descs->GetKey(i)->NamePrint(os);
       os << ": ";
-      PropertyDetails details = descs.GetDetails(i);
+      PropertyDetails details = descs->GetDetails(i);
       switch (details.location()) {
         case PropertyLocation::kField: {
           FieldIndex field_index = FieldIndex::ForDetails(map(), details);
@@ -323,7 +329,7 @@ bool JSObject::PrintProperties(std::ostream& os) {
           break;
         }
         case PropertyLocation::kDescriptor:
-          os << Brief(descs.GetStrongValue(i));
+          os << Brief(descs->GetStrongValue(i));
           break;
       }
       os << " ";
@@ -340,10 +346,10 @@ bool JSObject::PrintProperties(std::ostream& os) {
         os << ", location: descriptor";
       }
     }
-    return map().NumberOfOwnDescriptors() > 0;
-  } else if (IsJSGlobalObject()) {
+    return map()->NumberOfOwnDescriptors() > 0;
+  } else if (IsJSGlobalObject(*this)) {
     PrintDictionaryContents(
-        os, JSGlobalObject::cast(*this).global_dictionary(kAcquireLoad));
+        os, JSGlobalObject::cast(*this)->global_dictionary(kAcquireLoad));
   } else if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
     PrintDictionaryContents(os, property_dictionary_swiss());
   } else {
@@ -355,27 +361,27 @@ bool JSObject::PrintProperties(std::ostream& os) {
 namespace {
 
 template <class T>
-bool IsTheHoleAt(T array, int index) {
+bool IsTheHoleAt(Tagged<T> array, int index) {
   return false;
 }
 
 template <>
-bool IsTheHoleAt(FixedDoubleArray array, int index) {
-  return array.is_the_hole(index);
+bool IsTheHoleAt(Tagged<FixedDoubleArray> array, int index) {
+  return array->is_the_hole(index);
 }
 
 template <class T>
-double GetScalarElement(T array, int index) {
+double GetScalarElement(Tagged<T> array, int index) {
   if (IsTheHoleAt(array, index)) {
     return std::numeric_limits<double>::quiet_NaN();
   }
-  return array.get_scalar(index);
+  return array->get_scalar(index);
 }
 
 template <class T>
-void DoPrintElements(std::ostream& os, Object object, int length) {
+void DoPrintElements(std::ostream& os, Tagged<Object> object, int length) {
   const bool print_the_hole = std::is_same<T, FixedDoubleArray>::value;
-  T array = T::cast(object);
+  Tagged<T> array = T::cast(object);
   if (length == 0) return;
   int previous_index = 0;
   double previous_value = GetScalarElement(array, 0);
@@ -436,15 +442,16 @@ void PrintTypedArrayElements(std::ostream& os, const ElementType* data_ptr,
 }
 
 template <typename T>
-void PrintFixedArrayElements(std::ostream& os, T array) {
+void PrintFixedArrayElements(std::ostream& os, Tagged<T> array) {
   // Print in array notation for non-sparse arrays.
-  Object previous_value = array.length() > 0 ? array.get(0) : Object();
-  Object value;
+  if (array->length() == 0) return;
+  Tagged<Object> previous_value = array->get(0);
+  Tagged<Object> value;
   int previous_index = 0;
   int i;
-  for (i = 1; i <= array.length(); i++) {
-    if (i < array.length()) value = array.get(i);
-    if (previous_value == value && i != array.length()) {
+  for (i = 1; i <= array->length(); i++) {
+    if (i < array->length()) value = array->get(i);
+    if (previous_value == value && i != array->length()) {
       continue;
     }
     os << "\n";
@@ -459,36 +466,37 @@ void PrintFixedArrayElements(std::ostream& os, T array) {
   }
 }
 
-void PrintDictionaryElements(std::ostream& os, FixedArrayBase elements) {
+void PrintDictionaryElements(std::ostream& os,
+                             Tagged<FixedArrayBase> elements) {
   // Print some internal fields
-  NumberDictionary dict = NumberDictionary::cast(elements);
-  if (dict.requires_slow_elements()) {
+  Tagged<NumberDictionary> dict = NumberDictionary::cast(elements);
+  if (dict->requires_slow_elements()) {
     os << "\n   - requires_slow_elements";
   } else {
-    os << "\n   - max_number_key: " << dict.max_number_key();
+    os << "\n   - max_number_key: " << dict->max_number_key();
   }
   PrintDictionaryContents(os, dict);
 }
 
 void PrintSloppyArgumentElements(std::ostream& os, ElementsKind kind,
-                                 SloppyArgumentsElements elements) {
-  FixedArray arguments_store = elements.arguments();
-  os << "\n    0: context: " << Brief(elements.context())
+                                 Tagged<SloppyArgumentsElements> elements) {
+  Tagged<FixedArray> arguments_store = elements->arguments();
+  os << "\n    0: context: " << Brief(elements->context())
      << "\n    1: arguments_store: " << Brief(arguments_store)
      << "\n    parameter to context slot map:";
-  for (int i = 0; i < elements.length(); i++) {
-    Object mapped_entry = elements.mapped_entries(i, kRelaxedLoad);
+  for (int i = 0; i < elements->length(); i++) {
+    Tagged<Object> mapped_entry = elements->mapped_entries(i, kRelaxedLoad);
     os << "\n    " << i << ": param(" << i << "): " << Brief(mapped_entry);
-    if (mapped_entry.IsTheHole()) {
+    if (IsTheHole(mapped_entry)) {
       os << " in the arguments_store[" << i << "]";
     } else {
       os << " in the context";
     }
   }
-  if (arguments_store.length() == 0) return;
+  if (arguments_store->length() == 0) return;
   os << "\n }"
      << "\n - arguments_store: " << Brief(arguments_store) << " "
-     << ElementsKindToString(arguments_store.map().elements_kind()) << " {";
+     << ElementsKindToString(arguments_store->map()->elements_kind()) << " {";
   if (kind == FAST_SLOPPY_ARGUMENTS_ELEMENTS) {
     PrintFixedArrayElements(os, arguments_store);
   } else {
@@ -500,7 +508,7 @@ void PrintSloppyArgumentElements(std::ostream& os, ElementsKind kind,
 void PrintEmbedderData(Isolate* isolate, std::ostream& os,
                        EmbedderDataSlot slot) {
   DisallowGarbageCollection no_gc;
-  Object value = slot.load_tagged();
+  Tagged<Object> value = slot.load_tagged();
   os << Brief(value);
   void* raw_pointer;
   if (slot.ToAlignedPointer(isolate, &raw_pointer)) {
@@ -514,7 +522,7 @@ void JSObject::PrintElements(std::ostream& os) {
   // Don't call GetElementsKind, its validation code can cause the printer to
   // fail when debugging.
   os << " - elements: " << Brief(elements()) << " {";
-  switch (map().elements_kind()) {
+  switch (map()->elements_kind()) {
     case HOLEY_SMI_ELEMENTS:
     case PACKED_SMI_ELEMENTS:
     case HOLEY_ELEMENTS:
@@ -532,18 +540,18 @@ void JSObject::PrintElements(std::ostream& os) {
     }
     case HOLEY_DOUBLE_ELEMENTS:
     case PACKED_DOUBLE_ELEMENTS: {
-      DoPrintElements<FixedDoubleArray>(os, elements(), elements().length());
+      DoPrintElements<FixedDoubleArray>(os, elements(), elements()->length());
       break;
     }
 
-#define PRINT_ELEMENTS(Type, type, TYPE, elementType)                         \
-  case TYPE##_ELEMENTS: {                                                     \
-    size_t length = JSTypedArray::cast(*this).GetLength();                    \
-    bool is_on_heap = JSTypedArray::cast(*this).is_on_heap();                 \
-    const elementType* data_ptr =                                             \
-        static_cast<const elementType*>(JSTypedArray::cast(*this).DataPtr()); \
-    PrintTypedArrayElements<elementType>(os, data_ptr, length, is_on_heap);   \
-    break;                                                                    \
+#define PRINT_ELEMENTS(Type, type, TYPE, elementType)                          \
+  case TYPE##_ELEMENTS: {                                                      \
+    size_t length = JSTypedArray::cast(*this)->GetLength();                    \
+    bool is_on_heap = JSTypedArray::cast(*this)->is_on_heap();                 \
+    const elementType* data_ptr =                                              \
+        static_cast<const elementType*>(JSTypedArray::cast(*this)->DataPtr()); \
+    PrintTypedArrayElements<elementType>(os, data_ptr, length, is_on_heap);    \
+    break;                                                                     \
   }
       TYPED_ARRAYS(PRINT_ELEMENTS)
       RAB_GSAB_TYPED_ARRAYS(PRINT_ELEMENTS)
@@ -555,7 +563,7 @@ void JSObject::PrintElements(std::ostream& os) {
       break;
     case FAST_SLOPPY_ARGUMENTS_ELEMENTS:
     case SLOW_SLOPPY_ARGUMENTS_ELEMENTS:
-      PrintSloppyArgumentElements(os, map().elements_kind(),
+      PrintSloppyArgumentElements(os, map()->elements_kind(),
                                   SloppyArgumentsElements::cast(elements()));
       break;
     case WASM_ARRAY_ELEMENTS:
@@ -567,50 +575,50 @@ void JSObject::PrintElements(std::ostream& os) {
   os << "\n }\n";
 }
 
-static void JSObjectPrintHeader(std::ostream& os, JSObject obj,
+static void JSObjectPrintHeader(std::ostream& os, Tagged<JSObject> obj,
                                 const char* id) {
-  Isolate* isolate = obj.GetIsolate();
-  obj.PrintHeader(os, id);
+  Isolate* isolate = obj->GetIsolate();
+  obj->PrintHeader(os, id);
   // Don't call GetElementsKind, its validation code can cause the printer to
   // fail when debugging.
   os << " [";
-  if (obj.HasFastProperties()) {
+  if (obj->HasFastProperties()) {
     os << "FastProperties";
   } else {
     os << "DictionaryProperties";
   }
   PrototypeIterator iter(isolate, obj);
   os << "]\n - prototype: " << Brief(iter.GetCurrent());
-  os << "\n - elements: " << Brief(obj.elements()) << " ["
-     << ElementsKindToString(obj.map().elements_kind());
-  if (obj.elements().IsCowArray()) os << " (COW)";
+  os << "\n - elements: " << Brief(obj->elements()) << " ["
+     << ElementsKindToString(obj->map()->elements_kind());
+  if (obj->elements()->IsCowArray()) os << " (COW)";
   os << "]";
-  Object hash = obj.GetHash();
-  if (hash.IsSmi()) {
+  Tagged<Object> hash = Object::GetHash(obj);
+  if (IsSmi(hash)) {
     os << "\n - hash: " << Brief(hash);
   }
-  if (obj.GetEmbedderFieldCount() > 0) {
-    os << "\n - embedder fields: " << obj.GetEmbedderFieldCount();
+  if (obj->GetEmbedderFieldCount() > 0) {
+    os << "\n - embedder fields: " << obj->GetEmbedderFieldCount();
   }
 }
 
-static void JSObjectPrintBody(std::ostream& os, JSObject obj,
+static void JSObjectPrintBody(std::ostream& os, Tagged<JSObject> obj,
                               bool print_elements = true) {
   os << "\n - properties: ";
-  Object properties_or_hash = obj.raw_properties_or_hash(kRelaxedLoad);
-  if (!properties_or_hash.IsSmi()) {
+  Tagged<Object> properties_or_hash = obj->raw_properties_or_hash(kRelaxedLoad);
+  if (!IsSmi(properties_or_hash)) {
     os << Brief(properties_or_hash);
   }
   os << "\n - All own properties (excluding elements): {";
-  if (obj.PrintProperties(os)) os << "\n ";
+  if (obj->PrintProperties(os)) os << "\n ";
   os << "}\n";
 
   if (print_elements) {
-    size_t length = obj.IsJSTypedArray() ? JSTypedArray::cast(obj).GetLength()
-                                         : obj.elements().length();
-    if (length > 0) obj.PrintElements(os);
+    size_t length = IsJSTypedArray(obj) ? JSTypedArray::cast(obj)->GetLength()
+                                        : obj->elements()->length();
+    if (length > 0) obj->PrintElements(os);
   }
-  int embedder_fields = obj.GetEmbedderFieldCount();
+  int embedder_fields = obj->GetEmbedderFieldCount();
   if (embedder_fields > 0) {
     Isolate* isolate = GetIsolateForSandbox(obj);
     os << " - embedder fields = {";
@@ -663,28 +671,28 @@ void JSGeneratorObject::JSGeneratorObjectPrint(std::ostream& os) {
   if (is_suspended()) os << " (suspended)";
   if (is_suspended()) {
     DisallowGarbageCollection no_gc;
-    SharedFunctionInfo fun_info = function().shared();
-    if (fun_info.HasSourceCode()) {
-      Script script = Script::cast(fun_info.script());
-      String script_name = script.name().IsString()
-                               ? String::cast(script.name())
-                               : GetReadOnlyRoots().empty_string();
+    Tagged<SharedFunctionInfo> fun_info = function()->shared();
+    if (fun_info->HasSourceCode()) {
+      Tagged<Script> script = Script::cast(fun_info->script());
+      Tagged<String> script_name = IsString(script->name())
+                                       ? Tagged<String>::cast(script->name())
+                                       : GetReadOnlyRoots().empty_string();
 
       os << "\n - source position: ";
       // Can't collect source positions here if not available as that would
       // allocate memory.
       Isolate* isolate = GetIsolate();
-      if (fun_info.HasBytecodeArray() &&
-          fun_info.GetBytecodeArray(isolate).HasSourcePositionTable()) {
+      if (fun_info->HasBytecodeArray() &&
+          fun_info->GetBytecodeArray(isolate)->HasSourcePositionTable()) {
         os << source_position();
         os << " (";
-        script_name.PrintUC16(os);
-        int lin = script.GetLineNumber(source_position()) + 1;
-        int col = script.GetColumnNumber(source_position()) + 1;
-        os << ", lin " << lin;
-        os << ", col " << col;
+        script_name->PrintUC16(os);
+        Script::PositionInfo info;
+        script->GetPositionInfo(source_position(), &info);
+        os << ", line " << info.line + 1;
+        os << ", column " << info.column + 1;
       } else {
-        os << "unavailable";
+        os << kUnavailableString;
       }
       os << ")";
     }
@@ -736,7 +744,7 @@ void Symbol::SymbolPrint(std::ostream& os) {
   PrintHeader(os, "Symbol");
   os << "\n - hash: " << hash();
   os << "\n - description: " << Brief(description());
-  if (description().IsUndefined()) {
+  if (IsUndefined(description())) {
     os << " (" << PrivateSymbolToName() << ")";
   }
   os << "\n - private: " << is_private();
@@ -748,12 +756,12 @@ void Symbol::SymbolPrint(std::ostream& os) {
 void DescriptorArray::DescriptorArrayPrint(std::ostream& os) {
   PrintHeader(os, "DescriptorArray");
   os << "\n - enum_cache: ";
-  if (enum_cache().keys().length() == 0) {
+  if (enum_cache()->keys()->length() == 0) {
     os << "empty";
   } else {
-    os << enum_cache().keys().length();
-    os << "\n   - keys: " << Brief(enum_cache().keys());
-    os << "\n   - indices: " << Brief(enum_cache().indices());
+    os << enum_cache()->keys()->length();
+    os << "\n   - keys: " << Brief(enum_cache()->keys());
+    os << "\n   - indices: " << Brief(enum_cache()->indices());
   }
   os << "\n - nof slack descriptors: " << number_of_slack_descriptors();
   os << "\n - nof descriptors: " << number_of_descriptors();
@@ -766,10 +774,10 @@ void DescriptorArray::DescriptorArrayPrint(std::ostream& os) {
 }
 
 namespace {
-void PrintFixedArrayWithHeader(std::ostream& os, FixedArray array,
+void PrintFixedArrayWithHeader(std::ostream& os, Tagged<FixedArray> array,
                                const char* type) {
-  array.PrintHeader(os, type);
-  os << "\n - length: " << array.length();
+  array->PrintHeader(os, type);
+  os << "\n - length: " << array->length();
   PrintFixedArrayElements(os, array);
   os << "\n";
 }
@@ -848,27 +856,34 @@ void AccessorInfo::AccessorInfoPrint(std::ostream& os) {
   os << "\n - setter_side_effect_type: "
      << SideEffectType2String(setter_side_effect_type());
   os << "\n - initial_attributes: " << initial_property_attributes();
-  os << "\n - getter: " << reinterpret_cast<void*>(getter());
-  if (USE_SIMULATOR_BOOL) {
-    os << "\n - maybe_redirected_getter: "
-       << reinterpret_cast<void*>(maybe_redirected_getter());
+  Isolate* isolate;
+  if (GetIsolateFromHeapObject(*this, &isolate)) {
+    os << "\n - getter: " << reinterpret_cast<void*>(getter(isolate));
+    if (USE_SIMULATOR_BOOL) {
+      os << "\n - maybe_redirected_getter: "
+         << reinterpret_cast<void*>(maybe_redirected_getter(isolate));
+    }
+    os << "\n - setter: " << reinterpret_cast<void*>(setter(isolate));
+  } else {
+    os << "\n - getter: " << kUnavailableString;
+    os << "\n - maybe_redirected_getter: " << kUnavailableString;
+    os << "\n - setter: " << kUnavailableString;
   }
-  os << "\n - setter: " << reinterpret_cast<void*>(setter());
   os << '\n';
 }
 
 namespace {
-void PrintContextWithHeader(std::ostream& os, Context context,
+void PrintContextWithHeader(std::ostream& os, Tagged<Context> context,
                             const char* type) {
-  context.PrintHeader(os, type);
-  os << "\n - type: " << context.map().instance_type();
-  os << "\n - scope_info: " << Brief(context.scope_info());
-  os << "\n - previous: " << Brief(context.unchecked_previous());
-  os << "\n - native_context: " << Brief(context.native_context());
-  if (context.scope_info().HasContextExtensionSlot()) {
-    os << "\n - extension: " << context.extension();
-  }
-  os << "\n - length: " << context.length();
+  context->PrintHeader(os, type);
+  os << "\n - type: " << context->map()->instance_type();
+  os << "\n - scope_info: " << Brief(context->scope_info());
+  os << "\n - previous: " << Brief(context->unchecked_previous());
+  os << "\n - native_context: " << Brief(context->native_context());
+  if (context->scope_info()->HasContextExtensionSlot()) {
+    os << "\n - extension: " << context->extension();
+  }
+  os << "\n - length: " << context->length();
   os << "\n - elements:";
   PrintFixedArrayElements(os, context);
   os << "\n";
@@ -903,11 +918,11 @@ void PrintTableContentsGeneric(std::ostream& os, T dict,
   ReadOnlyRoots roots = dict.GetReadOnlyRoots();
 
   for (InternalIndex i : dict.IterateEntries()) {
-    Object k;
+    Tagged<Object> k;
     if (!dict.ToKey(roots, i, &k)) continue;
     os << "\n   " << std::setw(12) << i.as_int() << ": ";
-    if (k.IsString()) {
-      String::cast(k).PrintUC16(os);
+    if (IsString(k)) {
+      String::cast(k)->PrintUC16(os);
     } else {
       os << Brief(k);
     }
@@ -918,9 +933,9 @@ void PrintTableContentsGeneric(std::ostream& os, T dict,
   }
 }
 
-void PrintNameDictionaryFlags(std::ostream& os, NameDictionary dict) {
-  if (dict.may_have_interesting_symbols()) {
-    os << "\n - may_have_interesting_symbols";
+void PrintNameDictionaryFlags(std::ostream& os, Tagged<NameDictionary> dict) {
+  if (dict->may_have_interesting_properties()) {
+    os << "\n - may_have_interesting_properties";
   }
 }
 
@@ -969,8 +984,8 @@ void PrintOrderedHashTableHeaderAndBuckets(std::ostream& os, T table,
 
   os << "\n - buckets: {";
   for (int bucket = 0; bucket < table.NumberOfBuckets(); bucket++) {
-    Object entry = table.get(T::HashTableStartIndex() + bucket);
-    DCHECK(entry.IsSmi());
+    Tagged<Object> entry = table.get(T::HashTableStartIndex() + bucket);
+    DCHECK(IsSmi(entry));
     os << "\n   " << std::setw(12) << bucket << ": " << Brief(entry);
   }
   os << "\n }";
@@ -1103,14 +1118,14 @@ void SwissNameDictionary::SwissNameDictionaryPrint(std::ostream& os) {
 
   os << "\n - data table (omitting slots where key is the hole): {";
   for (int bucket = 0; bucket < this->Capacity(); ++bucket) {
-    Object k;
+    Tagged<Object> k;
     if (!this->ToKey(this->GetReadOnlyRoots(), bucket, &k)) continue;
 
-    Object value = this->ValueAtRaw(bucket);
+    Tagged<Object> value = this->ValueAtRaw(bucket);
     PropertyDetails details = this->DetailsAt(bucket);
     os << "\n   " << std::setw(12) << std::dec << bucket << ": ";
-    if (k.IsString()) {
-      String::cast(k).PrintUC16(os);
+    if (IsString(k)) {
+      String::cast(k)->PrintUC16(os);
     } else {
       os << Brief(k);
     }
@@ -1125,7 +1140,7 @@ void PropertyArray::PropertyArrayPrint(std::ostream& os) {
   PrintHeader(os, "PropertyArray");
   os << "\n - length: " << length();
   os << "\n - hash: " << Hash();
-  PrintFixedArrayElements(os, *this);
+  PrintFixedArrayElements(os, Tagged(*this));
   os << "\n";
 }
 
@@ -1234,9 +1249,8 @@ void FeedbackVector::FeedbackVectorPrint(std::ostream& os) {
   os << "\n - maybe has maglev code: " << maybe_has_maglev_code();
   os << "\n - maybe has turbofan code: " << maybe_has_turbofan_code();
   os << "\n - invocation count: " << invocation_count();
-  os << "\n - profiler ticks: " << profiler_ticks();
   os << "\n - closure feedback cell array: ";
-  closure_feedback_cell_array().ClosureFeedbackCellArrayPrint(os);
+  closure_feedback_cell_array()->ClosureFeedbackCellArrayPrint(os);
 
   FeedbackMetadataIterator iter(metadata());
   while (iter.HasNext()) {
@@ -1293,7 +1307,7 @@ void FeedbackNexus::Print(std::ostream& os) {
             StoreHandler::PrintHandler(GetFeedbackExtra().GetHeapObjectOrSmi(),
                                        os);
           }
-        } else if (GetFeedback().GetHeapObjectOrSmi().IsPropertyCell()) {
+        } else if (IsPropertyCell(GetFeedback().GetHeapObjectOrSmi())) {
           os << Brief(GetFeedback());
         } else {
           // Lexical variable mode: the variable location is encoded in the SMI.
@@ -1312,23 +1326,23 @@ void FeedbackNexus::Print(std::ostream& os) {
       os << InlineCacheState2String(ic_state());
       if (ic_state() == InlineCacheState::MONOMORPHIC) {
         os << "\n   " << Brief(GetFeedback()) << ": ";
-        Object handler = GetFeedbackExtra().GetHeapObjectOrSmi();
-        if (handler.IsWeakFixedArray()) {
-          handler = WeakFixedArray::cast(handler).Get(0).GetHeapObjectOrSmi();
+        Tagged<Object> handler = GetFeedbackExtra().GetHeapObjectOrSmi();
+        if (IsWeakFixedArray(handler)) {
+          handler = WeakFixedArray::cast(handler)->Get(0).GetHeapObjectOrSmi();
         }
         LoadHandler::PrintHandler(handler, os);
       } else if (ic_state() == InlineCacheState::POLYMORPHIC) {
-        HeapObject feedback = GetFeedback().GetHeapObject();
-        WeakFixedArray array;
-        if (feedback.IsName()) {
+        Tagged<HeapObject> feedback = GetFeedback().GetHeapObject();
+        Tagged<WeakFixedArray> array;
+        if (IsName(feedback)) {
           os << " with name " << Brief(feedback);
           array = WeakFixedArray::cast(GetFeedbackExtra().GetHeapObject());
         } else {
           array = WeakFixedArray::cast(feedback);
         }
-        for (int i = 0; i < array.length(); i += 2) {
-          os << "\n   " << Brief(array.Get(i)) << ": ";
-          LoadHandler::PrintHandler(array.Get(i + 1).GetHeapObjectOrSmi(), os);
+        for (int i = 0; i < array->length(); i += 2) {
+          os << "\n   " << Brief(array->Get(i)) << ": ";
+          LoadHandler::PrintHandler(array->Get(i + 1).GetHeapObjectOrSmi(), os);
         }
       }
       break;
@@ -1339,24 +1353,34 @@ void FeedbackNexus::Print(std::ostream& os) {
     case FeedbackSlotKind::kSetKeyedStrict: {
       os << InlineCacheState2String(ic_state());
       if (ic_state() == InlineCacheState::MONOMORPHIC) {
-        os << "\n   " << Brief(GetFeedback()) << ": ";
-        Object handler = GetFeedbackExtra().GetHeapObjectOrSmi();
-        if (handler.IsWeakFixedArray()) {
-          handler = WeakFixedArray::cast(handler).Get(0).GetHeapObjectOrSmi();
+        Tagged<HeapObject> feedback = GetFeedback().GetHeapObject();
+        if (IsName(feedback)) {
+          os << " with name " << Brief(feedback);
+          Tagged<WeakFixedArray> array =
+              WeakFixedArray::cast(GetFeedbackExtra().GetHeapObject());
+          os << "\n   " << Brief(array->Get(0)) << ": ";
+          Tagged<Object> handler = array->Get(1).GetHeapObjectOrSmi();
+          StoreHandler::PrintHandler(handler, os);
+        } else {
+          os << "\n   " << Brief(feedback) << ": ";
+          StoreHandler::PrintHandler(GetFeedbackExtra().GetHeapObjectOrSmi(),
+                                     os);
         }
-        StoreHandler::PrintHandler(handler, os);
       } else if (ic_state() == InlineCacheState::POLYMORPHIC) {
-        HeapObject feedback = GetFeedback().GetHeapObject();
-        WeakFixedArray array;
-        if (feedback.IsName()) {
+        Tagged<HeapObject> feedback = GetFeedback().GetHeapObject();
+        Tagged<WeakFixedArray> array;
+        if (IsName(feedback)) {
           os << " with name " << Brief(feedback);
           array = WeakFixedArray::cast(GetFeedbackExtra().GetHeapObject());
         } else {
           array = WeakFixedArray::cast(feedback);
         }
-        for (int i = 0; i < array.length(); i += 2) {
-          os << "\n   " << Brief(array.Get(i)) << ": ";
-          StoreHandler::PrintHandler(array.Get(i + 1).GetHeapObjectOrSmi(), os);
+        for (int i = 0; i < array->length(); i += 2) {
+          os << "\n   " << Brief(array->Get(i)) << ": ";
+          if (!array->Get(i + 1).IsCleared()) {
+            StoreHandler::PrintHandler(array->Get(i + 1).GetHeapObjectOrSmi(),
+                                       os);
+          }
         }
       }
       break;
@@ -1386,10 +1410,15 @@ void FeedbackNexus::Print(std::ostream& os) {
 void Oddball::OddballPrint(std::ostream& os) {
   PrintHeapObjectHeaderWithoutMap(*this, os, "Oddball");
   os << ": ";
-  String s = to_string();
-  os << s.PrefixForDebugPrint();
-  s.PrintUC16(os);
-  os << s.SuffixForDebugPrint();
+  Tagged<String> s = to_string();
+  os << s->PrefixForDebugPrint();
+  s->PrintUC16(os);
+  os << s->SuffixForDebugPrint();
+  os << std::endl;
+}
+
+void Hole::HolePrint(std::ostream& os) {
+  PrintHeapObjectHeaderWithoutMap(*this, os, "Hole");
   os << std::endl;
 }
 
@@ -1436,10 +1465,18 @@ void JSMessageObject::JSMessageObjectPrint(std::ostream& os) {
   JSObjectPrintHeader(os, *this, "JSMessageObject");
   os << "\n - type: " << static_cast<int>(type());
   os << "\n - arguments: " << Brief(argument());
-  os << "\n - start_position: " << start_position();
-  os << "\n - end_position: " << end_position();
   os << "\n - script: " << Brief(script());
   os << "\n - stack_frames: " << Brief(stack_frames());
+  os << "\n - shared_info: " << Brief(shared_info());
+  if (shared_info() == Smi::zero()) {
+    os << " (cleared after calculating line ends)";
+  } else if (shared_info() == Smi::FromInt(-1)) {
+    os << "(no line ends needed)";
+  }
+  os << "\n - bytecode_offset: " << bytecode_offset();
+  os << "\n - start_position: " << start_position();
+  os << "\n - end_position: " << end_position();
+  os << "\n - error_level: " << error_level();
   JSObjectPrintBody(os, *this);
 }
 
@@ -1452,8 +1489,8 @@ void String::StringPrint(std::ostream& os) {
 }
 
 void Name::NamePrint(std::ostream& os) {
-  if (IsString()) {
-    String::cast(*this).StringPrint(os);
+  if (IsString(*this)) {
+    String::cast(*this)->StringPrint(os);
   } else {
     os << Brief(*this);
   }
@@ -1465,19 +1502,19 @@ static const char* const weekdays[] = {"???", "Sun", "Mon", "Tue",
 void JSDate::JSDatePrint(std::ostream& os) {
   JSObjectPrintHeader(os, *this, "JSDate");
   os << "\n - value: " << Brief(value());
-  if (!year().IsSmi()) {
+  if (!IsSmi(year())) {
     os << "\n - time = NaN\n";
   } else {
     // TODO(svenpanne) Add some basic formatting to our streams.
     base::ScopedVector<char> buf(100);
     SNPrintF(buf, "\n - time = %s %04d/%02d/%02d %02d:%02d:%02d\n",
-             weekdays[weekday().IsSmi() ? Smi::ToInt(weekday()) + 1 : 0],
-             year().IsSmi() ? Smi::ToInt(year()) : -1,
-             month().IsSmi() ? Smi::ToInt(month()) : -1,
-             day().IsSmi() ? Smi::ToInt(day()) : -1,
-             hour().IsSmi() ? Smi::ToInt(hour()) : -1,
-             min().IsSmi() ? Smi::ToInt(min()) : -1,
-             sec().IsSmi() ? Smi::ToInt(sec()) : -1);
+             weekdays[IsSmi(weekday()) ? Smi::ToInt(weekday()) + 1 : 0],
+             IsSmi(year()) ? Smi::ToInt(year()) : -1,
+             IsSmi(month()) ? Smi::ToInt(month()) : -1,
+             IsSmi(day()) ? Smi::ToInt(day()) : -1,
+             IsSmi(hour()) ? Smi::ToInt(hour()) : -1,
+             IsSmi(min()) ? Smi::ToInt(min()) : -1,
+             IsSmi(sec()) ? Smi::ToInt(sec()) : -1);
     os << buf.begin();
   }
   JSObjectPrintBody(os, *this);
@@ -1534,16 +1571,16 @@ void JSFinalizationRegistry::JSFinalizationRegistryPrint(std::ostream& os) {
   os << "\n - native_context: " << Brief(native_context());
   os << "\n - cleanup: " << Brief(cleanup());
   os << "\n - active_cells: " << Brief(active_cells());
-  Object active_cell = active_cells();
-  while (active_cell.IsWeakCell()) {
+  Tagged<Object> active_cell = active_cells();
+  while (IsWeakCell(active_cell)) {
     os << "\n   - " << Brief(active_cell);
-    active_cell = WeakCell::cast(active_cell).next();
+    active_cell = WeakCell::cast(active_cell)->next();
   }
   os << "\n - cleared_cells: " << Brief(cleared_cells());
-  Object cleared_cell = cleared_cells();
-  while (cleared_cell.IsWeakCell()) {
+  Tagged<Object> cleared_cell = cleared_cells();
+  while (IsWeakCell(cleared_cell)) {
     os << "\n   - " << Brief(cleared_cell);
-    cleared_cell = WeakCell::cast(cleared_cell).next();
+    cleared_cell = WeakCell::cast(cleared_cell)->next();
   }
   os << "\n - key_map: " << Brief(key_map());
   JSObjectPrintBody(os, *this);
@@ -1617,6 +1654,16 @@ void JSIteratorDropHelper::JSIteratorDropHelperPrint(std::ostream& os) {
   JSObjectPrintBody(os, *this);
 }
 
+void JSIteratorFlatMapHelper::JSIteratorFlatMapHelperPrint(std::ostream& os) {
+  JSIteratorHelperPrintHeader(os, "JSIteratorFlatMapHelper");
+  os << "\n - mapper: " << Brief(mapper());
+  os << "\n - counter: " << counter();
+  os << "\n - innerIterator.object" << Brief(innerIterator_object());
+  os << "\n - innerIterator.next" << Brief(innerIterator_next());
+  os << "\n - innerAlive" << innerAlive();
+  JSObjectPrintBody(os, *this);
+}
+
 void JSWeakMap::JSWeakMapPrint(std::ostream& os) {
   JSObjectPrintHeader(os, *this, "JSWeakMap");
   os << "\n - table: " << Brief(table());
@@ -1655,7 +1702,7 @@ void JSTypedArray::JSTypedArrayPrint(std::ostream& os) {
      << reinterpret_cast<void*>(static_cast<Address>(base_ptr));
   os << "\n   - external_pointer: "
      << reinterpret_cast<void*>(external_pointer());
-  if (!buffer().IsJSArrayBuffer()) {
+  if (!IsJSArrayBuffer(buffer())) {
     os << "\n <invalid buffer>\n";
     return;
   }
@@ -1678,7 +1725,7 @@ void JSDataView::JSDataViewPrint(std::ostream& os) {
   os << "\n - buffer =" << Brief(buffer());
   os << "\n - byte_offset: " << byte_offset();
   os << "\n - byte_length: " << byte_length();
-  if (!buffer().IsJSArrayBuffer()) {
+  if (!IsJSArrayBuffer(buffer())) {
     os << "\n <invalid buffer>";
     return;
   }
@@ -1693,7 +1740,7 @@ void JSRabGsabDataView::JSRabGsabDataViewPrint(std::ostream& os) {
   os << "\n - byte_length: " << byte_length();
   if (is_length_tracking()) os << "\n - length-tracking";
   if (is_backed_by_rab()) os << "\n - backed-by-rab";
-  if (!buffer().IsJSArrayBuffer()) {
+  if (!IsJSArrayBuffer(buffer())) {
     os << "\n <invalid buffer>";
     return;
   }
@@ -1716,7 +1763,7 @@ void JSFunction::JSFunctionPrint(std::ostream& os) {
   if (has_prototype_slot()) {
     if (has_prototype()) {
       os << Brief(prototype());
-      if (map().has_non_instance_prototype()) {
+      if (map()->has_non_instance_prototype()) {
         os << " (non-instance prototype)";
       }
     }
@@ -1726,48 +1773,48 @@ void JSFunction::JSFunctionPrint(std::ostream& os) {
     os << "<no-prototype-slot>";
   }
   os << "\n - shared_info: " << Brief(shared());
-  os << "\n - name: " << Brief(shared().Name());
+  os << "\n - name: " << Brief(shared()->Name());
 
   // Print Builtin name for builtin functions
-  Builtin builtin = code().builtin_id();
+  Builtin builtin = code()->builtin_id();
   if (Builtins::IsBuiltinId(builtin)) {
     os << "\n - builtin: " << isolate->builtins()->name(builtin);
   }
 
   os << "\n - formal_parameter_count: "
-     << shared().internal_formal_parameter_count_without_receiver();
-  os << "\n - kind: " << shared().kind();
+     << shared()->internal_formal_parameter_count_without_receiver();
+  os << "\n - kind: " << shared()->kind();
   os << "\n - context: " << Brief(context());
   os << "\n - code: " << Brief(code());
-  if (code().kind() == CodeKind::FOR_TESTING) {
+  if (code()->kind() == CodeKind::FOR_TESTING) {
     os << "\n - FOR_TESTING";
   } else if (ActiveTierIsIgnition()) {
     os << "\n - interpreted";
-    if (shared().HasBytecodeArray()) {
-      os << "\n - bytecode: " << shared().GetBytecodeArray(isolate);
+    if (shared()->HasBytecodeArray()) {
+      os << "\n - bytecode: " << shared()->GetBytecodeArray(isolate);
     }
   }
 #if V8_ENABLE_WEBASSEMBLY
   if (WasmExportedFunction::IsWasmExportedFunction(*this)) {
-    WasmExportedFunction function = WasmExportedFunction::cast(*this);
-    os << "\n - Wasm instance: " << Brief(function.instance());
-    os << "\n - Wasm function index: " << function.function_index();
+    Tagged<WasmExportedFunction> function = WasmExportedFunction::cast(*this);
+    os << "\n - Wasm instance: " << Brief(function->instance());
+    os << "\n - Wasm function index: " << function->function_index();
   }
   if (WasmJSFunction::IsWasmJSFunction(*this)) {
-    WasmJSFunction function = WasmJSFunction::cast(*this);
-    os << "\n - Wasm wrapper around: " << Brief(function.GetCallable());
+    Tagged<WasmJSFunction> function = WasmJSFunction::cast(*this);
+    os << "\n - Wasm wrapper around: " << Brief(function->GetCallable());
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
-  shared().PrintSourceCode(os);
+  shared()->PrintSourceCode(os);
   JSObjectPrintBody(os, *this);
   os << " - feedback vector: ";
-  if (!shared().HasFeedbackMetadata()) {
+  if (!shared()->HasFeedbackMetadata()) {
     os << "feedback metadata is not available in SFI\n";
   } else if (has_feedback_vector()) {
-    feedback_vector().FeedbackVectorPrint(os);
+    feedback_vector()->FeedbackVectorPrint(os);
   } else if (has_closure_feedback_cell_array()) {
     os << "No feedback vector, but we have a closure feedback cell array\n";
-    closure_feedback_cell_array().ClosureFeedbackCellArrayPrint(os);
+    closure_feedback_cell_array()->ClosureFeedbackCellArrayPrint(os);
   } else {
     os << "not available\n";
   }
@@ -1776,10 +1823,10 @@ void JSFunction::JSFunctionPrint(std::ostream& os) {
 void SharedFunctionInfo::PrintSourceCode(std::ostream& os) {
   if (HasSourceCode()) {
     os << "\n - source code: ";
-    String source = String::cast(Script::cast(script()).source());
+    Tagged<String> source = String::cast(Script::cast(script())->source());
     int start = StartPosition();
     int length = EndPosition() - start;
-    std::unique_ptr<char[]> source_string = source.ToCString(
+    std::unique_ptr<char[]> source_string = source->ToCString(
         DISALLOW_NULLS, FAST_STRING_TRAVERSAL, start, length, nullptr);
     os << source_string.get();
   }
@@ -1813,13 +1860,13 @@ void SharedFunctionInfo::SharedFunctionInfoPrint(std::ostream& os) {
   os << "\n - expected_nof_properties: "
      << static_cast<int>(expected_nof_properties());
   os << "\n - language_mode: " << language_mode();
-  os << "\n - data: " << Brief(function_data(kAcquireLoad));
-  os << "\n - code (from data): ";
+  os << "\n - function_data: " << Brief(function_data(kAcquireLoad));
+  os << "\n - code (from function_data): ";
   Isolate* isolate;
   if (GetIsolateFromHeapObject(*this, &isolate)) {
     os << Brief(GetCode(isolate));
   } else {
-    os << "<unavailable>";
+    os << kUnavailableString;
   }
   PrintSourceCode(os);
   // Script files are often large, thus only print their {Brief} representation.
@@ -1827,11 +1874,6 @@ void SharedFunctionInfo::SharedFunctionInfoPrint(std::ostream& os) {
   os << "\n - function token position: " << function_token_position();
   os << "\n - start position: " << StartPosition();
   os << "\n - end position: " << EndPosition();
-  if (HasDebugInfo()) {
-    os << "\n - debug info: " << Brief(GetDebugInfo());
-  } else {
-    os << "\n - no debug info";
-  }
   os << "\n - scope info: " << Brief(scope_info());
   if (HasOuterScopeInfo()) {
     os << "\n - outer scope info: " << Brief(GetOuterScopeInfo());
@@ -1839,10 +1881,13 @@ void SharedFunctionInfo::SharedFunctionInfoPrint(std::ostream& os) {
   os << "\n - length: " << length();
   os << "\n - feedback_metadata: ";
   if (HasFeedbackMetadata()) {
-    feedback_metadata().FeedbackMetadataPrint(os);
+    feedback_metadata()->FeedbackMetadataPrint(os);
   } else {
     os << "<none>";
   }
+  os << "\n - function_literal_id: " << function_literal_id();
+  os << "\n - unique_id: " << unique_id();
+  os << "\n - age: " << age();
   os << "\n";
 }
 
@@ -1866,7 +1911,7 @@ void JSGlobalObject::JSGlobalObjectPrint(std::ostream& os) {
 void PropertyCell::PropertyCellPrint(std::ostream& os) {
   PrintHeader(os, "PropertyCell");
   os << "\n - name: ";
-  name().NamePrint(os);
+  name()->NamePrint(os);
   os << "\n - value: " << Brief(value(kAcquireLoad));
   os << "\n - details: ";
   PropertyDetails details = property_details(kAcquireLoad);
@@ -1876,30 +1921,55 @@ void PropertyCell::PropertyCellPrint(std::ostream& os) {
 }
 
 void InstructionStream::InstructionStreamPrint(std::ostream& os) {
-  PrintHeader(os, "InstructionStream");
-  Code the_code = code(kAcquireLoad);
-  os << "\n - code: " << Brief(the_code);
-#ifdef ENABLE_DISASSEMBLER
-  the_code.Disassemble(nullptr, os, GetIsolate());
-#endif
+  code(kAcquireLoad)->CodePrint(os);
 }
 
-void Code::CodePrint(std::ostream& os) {
+void Code::CodePrint(std::ostream& os, const char* name, Address current_pc) {
+  // This prints the entire {Code,InstructionStream} composite object.
+  //
+  // First, Code:
   PrintHeader(os, "Code");
   os << "\n - kind: " << CodeKindToString(kind());
   if (is_builtin()) {
-    os << "\n - builtin: " << Builtins::name(builtin_id());
-  }
+    os << "\n - builtin_id: " << Builtins::name(builtin_id());
+  }
+  os << "\n - deoptimization_data_or_interpreter_data: "
+     << Brief(raw_deoptimization_data_or_interpreter_data());
+  os << "\n - position_table: " << Brief(raw_position_table());
+  os << "\n - instruction_stream: " << Brief(raw_instruction_stream());
+  os << "\n - instruction_start: "
+     << reinterpret_cast<void*>(instruction_start());
+  os << "\n - is_turbofanned: " << is_turbofanned();
+  os << "\n - stack_slots: " << stack_slots();
+  os << "\n - marked_for_deoptimization: " << marked_for_deoptimization();
+  os << "\n - embedded_objects_cleared: " << embedded_objects_cleared();
+  os << "\n - can_have_weak_objects: " << can_have_weak_objects();
+  os << "\n - instruction_size: " << instruction_size();
+  os << "\n - metadata_size: " << metadata_size();
+
+  os << "\n - inlined_bytecode_size: " << inlined_bytecode_size();
+  os << "\n - osr_offset: " << osr_offset();
+  os << "\n - handler_table_offset: " << handler_table_offset();
+  os << "\n - unwinding_info_offset: " << unwinding_info_offset();
+  if (V8_EMBEDDED_CONSTANT_POOL_BOOL) {
+    os << "\n - constant_pool_offset: " << constant_pool_offset();
+  }
+  os << "\n - code_comments_offset: " << code_comments_offset();
+
+  // Then, InstructionStream:
   if (has_instruction_stream()) {
-    os << "\n - instruction_stream: " << Brief(raw_instruction_stream());
+    Tagged<InstructionStream> istream = instruction_stream();
+    os << "\n - instruction_stream.relocation_info: "
+       << Brief(istream->relocation_info());
+    os << "\n - instruction_stream.body_size: " << istream->body_size();
   }
-  os << "\n - code_entry_point: "
-     << reinterpret_cast<void*>(code_entry_point());
-  os << "\n - kind_specific_flags: " << kind_specific_flags(kRelaxedLoad);
   os << "\n";
-  if (has_instruction_stream()) {
-    instruction_stream().Print(os);
-  }
+
+  // Finally, the disassembly:
+#ifdef ENABLE_DISASSEMBLER
+  os << "\n--- Disassembly: ---\n";
+  Disassemble(name, os, Isolate::Current(), current_pc);
+#endif
 }
 
 void Foreign::ForeignPrint(std::ostream& os) {
@@ -1928,17 +1998,17 @@ void AsyncGeneratorRequest::AsyncGeneratorRequestPrint(std::ostream& os) {
   os << "\n";
 }
 
-static void PrintModuleFields(Module module, std::ostream& os) {
-  os << "\n - exports: " << Brief(module.exports());
-  os << "\n - status: " << module.status();
-  os << "\n - exception: " << Brief(module.exception());
+static void PrintModuleFields(Tagged<Module> module, std::ostream& os) {
+  os << "\n - exports: " << Brief(module->exports());
+  os << "\n - status: " << module->status();
+  os << "\n - exception: " << Brief(module->exception());
 }
 
 void Module::ModulePrint(std::ostream& os) {
-  if (this->IsSourceTextModule()) {
-    SourceTextModule::cast(*this).SourceTextModulePrint(os);
-  } else if (this->IsSyntheticModule()) {
-    SyntheticModule::cast(*this).SyntheticModulePrint(os);
+  if (IsSourceTextModule(*this)) {
+    SourceTextModule::cast(*this)->SourceTextModulePrint(os);
+  } else if (IsSyntheticModule(*this)) {
+    SyntheticModule::cast(*this)->SyntheticModulePrint(os);
   } else {
     UNREACHABLE();
   }
@@ -1948,9 +2018,9 @@ void SourceTextModule::SourceTextModulePrint(std::ostream& os) {
   PrintHeader(os, "SourceTextModule");
   PrintModuleFields(*this, os);
   os << "\n - sfi/code/info: " << Brief(code());
-  Script script = GetScript();
+  Tagged<Script> script = GetScript();
   os << "\n - script: " << Brief(script);
-  os << "\n - origin: " << Brief(script.GetNameOrSourceURL());
+  os << "\n - origin: " << Brief(script->GetNameOrSourceURL());
   os << "\n - requested_modules: " << Brief(requested_modules());
   os << "\n - import_meta: " << Brief(import_meta(kAcquireLoad));
   os << "\n - cycle_root: " << Brief(cycle_root());
@@ -1986,7 +2056,7 @@ void ArrayBoilerplateDescription::ArrayBoilerplateDescriptionPrint(
 void AsmWasmData::AsmWasmDataPrint(std::ostream& os) {
   PrintHeader(os, "AsmWasmData");
   os << "\n - native module: " << Brief(managed_native_module());
-  os << "\n - uses bitset: " << uses_bitset().value();
+  os << "\n - uses bitset: " << uses_bitset()->value();
   os << "\n";
 }
 
@@ -2042,7 +2112,16 @@ void WasmStruct::WasmStructPrint(std::ostream& os) {
         break;
       }
       case wasm::kS128:
-        os << "UNIMPLEMENTED";  // TODO(7748): Implement.
+        os << "0x" << std::hex << std::setfill('0');
+#ifdef V8_TARGET_BIG_ENDIAN
+        for (int j = 0; j < kSimd128Size; j++) {
+#else
+        for (int j = kSimd128Size - 1; j >= 0; j--) {
+#endif
+          os << std::setw(2)
+             << static_cast<int>(reinterpret_cast<uint8_t*>(field_address)[j]);
+        }
+        os << std::dec << std::setfill(' ');
         break;
       case wasm::kBottom:
       case wasm::kVoid:
@@ -2103,15 +2182,18 @@ void WasmArray::WasmArrayPrint(std::ostream& os) {
       for (uint32_t i = 0;
            i < std::min(this->length(), kWasmArrayMaximumPrintedElements);
            i++) {
-        os << "\n   " << static_cast<int>(i) << " - 0x" << std::hex;
+        os << "\n   " << static_cast<int>(i) << " - 0x" << std::hex
+           << std::setfill('0');
 #ifdef V8_TARGET_BIG_ENDIAN
         for (int j = 0; j < kSimd128Size; j++) {
 #else
         for (int j = kSimd128Size - 1; j >= 0; j--) {
 #endif
-          os << reinterpret_cast<byte*>(this->ElementAddress(i))[j];
+          os << std::setw(2)
+             << static_cast<int>(
+                    reinterpret_cast<uint8_t*>(this->ElementAddress(i))[j]);
         }
-        os << std::dec;
+        os << std::dec << std::setfill(' ');
       }
       if (this->length() > kWasmArrayMaximumPrintedElements) os << "\n   ...";
       break;
@@ -2136,7 +2218,11 @@ void WasmSuspenderObject::WasmSuspenderObjectPrint(std::ostream& os) {
   PrintHeader(os, "WasmSuspenderObject");
   os << "\n - continuation: " << continuation();
   os << "\n - parent: " << parent();
+  os << "\n - promise: " << promise();
+  os << "\n - resume: " << resume();
+  os << "\n - reject: " << reject();
   os << "\n - state: " << state();
+  os << "\n - wasm_to_js_counter: " << wasm_to_js_counter();
   os << "\n";
 }
 
@@ -2155,7 +2241,7 @@ void WasmInstanceObject::WasmInstanceObjectPrint(std::ostream& os) {
   PRINT_WASM_INSTANCE_FIELD(module_object, Brief);
   PRINT_WASM_INSTANCE_FIELD(exports_object, Brief);
   PRINT_WASM_INSTANCE_FIELD(native_context, Brief);
-  PRINT_OPTIONAL_WASM_INSTANCE_FIELD(memory_object, Brief);
+  PRINT_WASM_INSTANCE_FIELD(memory_objects, Brief);
   PRINT_OPTIONAL_WASM_INSTANCE_FIELD(untagged_globals_buffer, Brief);
   PRINT_OPTIONAL_WASM_INSTANCE_FIELD(tagged_globals_buffer, Brief);
   PRINT_OPTIONAL_WASM_INSTANCE_FIELD(imported_mutable_globals_buffers, Brief);
@@ -2167,8 +2253,9 @@ void WasmInstanceObject::WasmInstanceObjectPrint(std::ostream& os) {
   PRINT_WASM_INSTANCE_FIELD(wasm_internal_functions, Brief);
   PRINT_WASM_INSTANCE_FIELD(managed_object_maps, Brief);
   PRINT_WASM_INSTANCE_FIELD(feedback_vectors, Brief);
-  PRINT_WASM_INSTANCE_FIELD(memory_start, to_void_ptr);
-  PRINT_WASM_INSTANCE_FIELD(memory_size, +);
+  PRINT_WASM_INSTANCE_FIELD(well_known_imports, Brief);
+  PRINT_WASM_INSTANCE_FIELD(memory0_start, to_void_ptr);
+  PRINT_WASM_INSTANCE_FIELD(memory0_size, +);
   PRINT_WASM_INSTANCE_FIELD(stack_limit_address, to_void_ptr);
   PRINT_WASM_INSTANCE_FIELD(real_stack_limit_address, to_void_ptr);
   PRINT_WASM_INSTANCE_FIELD(new_allocation_limit_address, to_void_ptr);
@@ -2179,8 +2266,8 @@ void WasmInstanceObject::WasmInstanceObjectPrint(std::ostream& os) {
   PRINT_WASM_INSTANCE_FIELD(globals_start, to_void_ptr);
   PRINT_WASM_INSTANCE_FIELD(imported_mutable_globals, Brief);
   PRINT_WASM_INSTANCE_FIELD(indirect_function_table_size, +);
-  PRINT_WASM_INSTANCE_FIELD(indirect_function_table_sig_ids, to_void_ptr);
-  PRINT_WASM_INSTANCE_FIELD(indirect_function_table_targets, to_void_ptr);
+  PRINT_WASM_INSTANCE_FIELD(indirect_function_table_sig_ids, Brief);
+  PRINT_WASM_INSTANCE_FIELD(indirect_function_table_targets, Brief);
   PRINT_WASM_INSTANCE_FIELD(isorecursive_canonical_types,
                             reinterpret_cast<const uint32_t*>);
   PRINT_WASM_INSTANCE_FIELD(jump_table_start, to_void_ptr);
@@ -2189,6 +2276,7 @@ void WasmInstanceObject::WasmInstanceObjectPrint(std::ostream& os) {
   PRINT_WASM_INSTANCE_FIELD(element_segments, Brief);
   PRINT_WASM_INSTANCE_FIELD(hook_on_function_call_address, to_void_ptr);
   PRINT_WASM_INSTANCE_FIELD(tiering_budget_array, to_void_ptr);
+  PRINT_WASM_INSTANCE_FIELD(memory_bases_and_sizes, Brief);
   PRINT_WASM_INSTANCE_FIELD(break_on_entry, static_cast<int>);
   JSObjectPrintBody(os, *this);
   os << "\n";
@@ -2218,8 +2306,6 @@ void WasmExportedFunctionData::WasmExportedFunctionDataPrint(std::ostream& os) {
 void WasmJSFunctionData::WasmJSFunctionDataPrint(std::ostream& os) {
   PrintHeader(os, "WasmJSFunctionData");
   WasmFunctionDataPrint(os);
-  os << "\n - serialized_return_count: " << serialized_return_count();
-  os << "\n - serialized_parameter_count: " << serialized_parameter_count();
   os << "\n - serialized_signature: " << Brief(serialized_signature());
   os << "\n";
 }
@@ -2236,6 +2322,8 @@ void WasmApiFunctionRef::WasmApiFunctionRefPrint(std::ostream& os) {
   os << "\n - callable: " << Brief(callable());
   os << "\n - instance: " << Brief(instance());
   os << "\n - suspend: " << suspend();
+  os << "\n - wrapper_budget: " << wrapper_budget();
+  os << "\n - call_origin: " << Brief(call_origin());
   os << "\n";
 }
 
@@ -2289,12 +2377,8 @@ void WasmIndirectFunctionTable::WasmIndirectFunctionTablePrint(
     std::ostream& os) {
   PrintHeader(os, "WasmIndirectFunctionTable");
   os << "\n - size: " << size();
-  os << "\n - sig_ids: " << static_cast<void*>(sig_ids());
-  os << "\n - targets: " << static_cast<void*>(targets());
-  if (has_managed_native_allocations()) {
-    os << "\n - managed_native_allocations: "
-       << Brief(managed_native_allocations());
-  }
+  os << "\n - sig_ids: " << Brief(sig_ids());
+  os << "\n - targets: " << Brief(targets());
   os << "\n - refs: " << Brief(refs());
   os << "\n";
 }
@@ -2344,43 +2428,21 @@ void StoreHandler::StoreHandlerPrint(std::ostream& os) {
 
 void CallHandlerInfo::CallHandlerInfoPrint(std::ostream& os) {
   PrintHeader(os, "CallHandlerInfo");
-  os << "\n - callback: " << reinterpret_cast<void*>(callback());
-  if (USE_SIMULATOR_BOOL) {
-    os << "\n - maybe_redirected_callback: "
-       << reinterpret_cast<void*>(maybe_redirected_callback());
+  Isolate* isolate;
+  if (GetIsolateFromHeapObject(*this, &isolate)) {
+    os << "\n - callback: " << reinterpret_cast<void*>(callback(isolate));
+    if (USE_SIMULATOR_BOOL) {
+      os << "\n - maybe_redirected_callback: "
+         << reinterpret_cast<void*>(maybe_redirected_callback(isolate));
+    }
+  } else {
+    os << "\n - callback: " << kUnavailableString;
+    os << "\n - maybe_redirected_callback: " << kUnavailableString;
   }
   os << "\n - data: " << Brief(data());
   os << "\n - side_effect_free: "
      << (IsSideEffectFreeCallHandlerInfo() ? "true" : "false");
-  os << "\n";
-}
-
-void FunctionTemplateInfo::FunctionTemplateInfoPrint(std::ostream& os) {
-  PrintHeader(os, "FunctionTemplateInfo");
-  os << "\n - class name: " << Brief(class_name());
-  os << "\n - tag: " << tag();
-  os << "\n - serial_number: " << serial_number();
-  os << "\n - property_list: " << Brief(property_list());
-  os << "\n - call_code: " << Brief(call_code(kAcquireLoad));
-  os << "\n - property_accessors: " << Brief(property_accessors());
-  os << "\n - signature: " << Brief(signature());
-  os << "\n - cached_property_name: " << Brief(cached_property_name());
-  os << "\n - undetectable: " << (undetectable() ? "true" : "false");
-  os << "\n - need_access_check: " << (needs_access_check() ? "true" : "false");
-  os << "\n - instantiated: " << (instantiated() ? "true" : "false");
-  os << "\n - rare_data: " << Brief(rare_data(kAcquireLoad));
-  os << "\n";
-}
-
-void ObjectTemplateInfo::ObjectTemplateInfoPrint(std::ostream& os) {
-  PrintHeader(os, "ObjectTemplateInfo");
-  os << "\n - tag: " << tag();
-  os << "\n - serial_number: " << serial_number();
-  os << "\n - property_list: " << Brief(property_list());
-  os << "\n - property_accessors: " << Brief(property_accessors());
-  os << "\n - constructor: " << Brief(constructor());
-  os << "\n - embedder_field_count: " << embedder_field_count();
-  os << "\n - immutable_proto: " << (immutable_proto() ? "true" : "false");
+  os << "\n - owner_template: " << Brief(owner_template());
   os << "\n";
 }
 
@@ -2399,7 +2461,7 @@ void AllocationSite::AllocationSitePrint(std::ostream& os) {
   if (!PointsToLiteral()) {
     ElementsKind kind = GetElementsKind();
     os << "Array allocation with ElementsKind " << ElementsKindToString(kind);
-  } else if (boilerplate().IsJSArray()) {
+  } else if (IsJSArray(boilerplate())) {
     os << "Array literal with boilerplate " << Brief(boilerplate());
   } else {
     os << "Object literal with boilerplate " << Brief(boilerplate());
@@ -2411,7 +2473,7 @@ void AllocationMemento::AllocationMementoPrint(std::ostream& os) {
   PrintHeader(os, "AllocationMemento");
   os << "\n - allocation site: ";
   if (IsValid()) {
-    GetAllocationSite().AllocationSitePrint(os);
+    GetAllocationSite()->AllocationSitePrint(os);
   } else {
     os << "<invalid>\n";
   }
@@ -2430,18 +2492,19 @@ void Script::ScriptPrint(std::ostream& os) {
   os << "\n - line_offset: " << line_offset();
   os << "\n - column_offset: " << column_offset();
   os << "\n - context data: " << Brief(context_data());
-  os << "\n - type: " << type();
+  os << "\n - type: " << static_cast<int>(type());
   os << "\n - line ends: " << Brief(line_ends());
+  if (!has_line_ends()) os << " (not set)";
   os << "\n - id: " << id();
   os << "\n - source_url: " << Brief(source_url());
   os << "\n - source_mapping_url: " << Brief(source_mapping_url());
   os << "\n - host_defined_options: " << Brief(host_defined_options());
-  os << "\n - compilation type: " << compilation_type();
+  os << "\n - compilation type: " << static_cast<int>(compilation_type());
   os << "\n - compiled lazy function positions: "
      << compiled_lazy_function_positions();
   bool is_wasm = false;
 #if V8_ENABLE_WEBASSEMBLY
-  if ((is_wasm = (type() == TYPE_WASM))) {
+  if ((is_wasm = (type() == Type::kWasm))) {
     if (has_wasm_breakpoint_infos()) {
       os << "\n - wasm_breakpoint_infos: " << Brief(wasm_breakpoint_infos());
     }
@@ -2629,13 +2692,13 @@ void JSSegments::JSSegmentsPrint(std::ostream& os) {
 #endif  // V8_INTL_SUPPORT
 
 namespace {
-void PrintScopeInfoList(ScopeInfo scope_info, std::ostream& os,
+void PrintScopeInfoList(Tagged<ScopeInfo> scope_info, std::ostream& os,
                         const char* list_name, int length) {
   DisallowGarbageCollection no_gc;
   if (length <= 0) return;
   os << "\n - " << list_name;
   os << " {\n";
-  for (auto it : ScopeInfo::IterateLocalNames(&scope_info, no_gc)) {
+  for (auto it : ScopeInfo::IterateLocalNames(scope_info, no_gc)) {
     os << "    - " << it->index() << ": " << it->name() << "\n";
   }
   os << "  }";
@@ -2644,7 +2707,7 @@ void PrintScopeInfoList(ScopeInfo scope_info, std::ostream& os,
 
 void ScopeInfo::ScopeInfoPrint(std::ostream& os) {
   PrintHeader(os, "ScopeInfo");
-  if (IsEmpty()) {
+  if (this->IsEmpty()) {
     os << "\n - empty\n";
     return;
   }
@@ -2671,7 +2734,7 @@ void ScopeInfo::ScopeInfoPrint(std::ostream& os) {
   if (HasNewTarget()) os << "\n - needs new target";
   if (HasFunctionName()) {
     os << "\n - function name(" << FunctionVariableBits::decode(flags) << "): ";
-    FunctionName().ShortPrint(os);
+    ShortPrint(FunctionName(), os);
   }
   if (IsAsmModule()) os << "\n - asm module";
   if (HasSimpleParameters()) os << "\n - simple parameters";
@@ -2729,6 +2792,346 @@ void HeapNumber::HeapNumberPrint(std::ostream& os) {
 
 #endif  // OBJECT_PRINT
 
+void HeapObject::HeapObjectShortPrint(std::ostream& os) {
+  PtrComprCageBase cage_base = GetPtrComprCageBase();
+  os << AsHex::Address(this->ptr()) << " ";
+
+  if (IsString(*this, cage_base)) {
+    HeapStringAllocator allocator;
+    StringStream accumulator(&allocator);
+    String::cast(*this)->StringShortPrint(&accumulator);
+    os << accumulator.ToCString().get();
+    return;
+  }
+  if (IsJSObject(*this, cage_base)) {
+    HeapStringAllocator allocator;
+    StringStream accumulator(&allocator);
+    JSObject::cast(*this)->JSObjectShortPrint(&accumulator);
+    os << accumulator.ToCString().get();
+    return;
+  }
+  switch (map(cage_base)->instance_type()) {
+    case MAP_TYPE: {
+      os << "<Map";
+      Tagged<Map> mapInstance = Map::cast(*this);
+      if (mapInstance->instance_size() != kVariableSizeSentinel) {
+        os << "[" << mapInstance->instance_size() << "]";
+      }
+      os << "(";
+      if (IsJSObjectMap(mapInstance)) {
+        os << ElementsKindToString(mapInstance->elements_kind());
+      } else {
+        os << mapInstance->instance_type();
+      }
+      os << ")>";
+    } break;
+    case AWAIT_CONTEXT_TYPE: {
+      os << "<AwaitContext generator= ";
+      HeapStringAllocator allocator;
+      StringStream accumulator(&allocator);
+      ShortPrint(Context::cast(*this)->extension(), &accumulator);
+      os << accumulator.ToCString().get();
+      os << '>';
+      break;
+    }
+    case BLOCK_CONTEXT_TYPE:
+      os << "<BlockContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case CATCH_CONTEXT_TYPE:
+      os << "<CatchContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case DEBUG_EVALUATE_CONTEXT_TYPE:
+      os << "<DebugEvaluateContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case EVAL_CONTEXT_TYPE:
+      os << "<EvalContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case FUNCTION_CONTEXT_TYPE:
+      os << "<FunctionContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case MODULE_CONTEXT_TYPE:
+      os << "<ModuleContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case NATIVE_CONTEXT_TYPE:
+      os << "<NativeContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case SCRIPT_CONTEXT_TYPE:
+      os << "<ScriptContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case WITH_CONTEXT_TYPE:
+      os << "<WithContext[" << Context::cast(*this)->length() << "]>";
+      break;
+    case SCRIPT_CONTEXT_TABLE_TYPE:
+      os << "<ScriptContextTable[" << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case HASH_TABLE_TYPE:
+      os << "<HashTable[" << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case ORDERED_HASH_MAP_TYPE:
+      os << "<OrderedHashMap[" << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case ORDERED_HASH_SET_TYPE:
+      os << "<OrderedHashSet[" << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case ORDERED_NAME_DICTIONARY_TYPE:
+      os << "<OrderedNameDictionary[" << FixedArray::cast(*this)->length()
+         << "]>";
+      break;
+    case NAME_DICTIONARY_TYPE:
+      os << "<NameDictionary[" << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case SWISS_NAME_DICTIONARY_TYPE:
+      os << "<SwissNameDictionary["
+         << SwissNameDictionary::cast(*this)->Capacity() << "]>";
+      break;
+    case GLOBAL_DICTIONARY_TYPE:
+      os << "<GlobalDictionary[" << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case NUMBER_DICTIONARY_TYPE:
+      os << "<NumberDictionary[" << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case SIMPLE_NUMBER_DICTIONARY_TYPE:
+      os << "<SimpleNumberDictionary[" << FixedArray::cast(*this)->length()
+         << "]>";
+      break;
+    case FIXED_ARRAY_TYPE:
+      os << "<FixedArray[" << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case OBJECT_BOILERPLATE_DESCRIPTION_TYPE:
+      os << "<ObjectBoilerplateDescription["
+         << FixedArray::cast(*this)->length() << "]>";
+      break;
+    case FIXED_DOUBLE_ARRAY_TYPE:
+      os << "<FixedDoubleArray[" << FixedDoubleArray::cast(*this)->length()
+         << "]>";
+      break;
+    case BYTE_ARRAY_TYPE:
+      os << "<ByteArray[" << ByteArray::cast(*this)->length() << "]>";
+      break;
+    case BYTECODE_ARRAY_TYPE:
+      os << "<BytecodeArray[" << BytecodeArray::cast(*this)->length() << "]>";
+      break;
+    case EXTERNAL_POINTER_ARRAY_TYPE:
+      os << "<ExternalPointerArray["
+         << ExternalPointerArray::cast(*this)->length() << "]>";
+      break;
+    case DESCRIPTOR_ARRAY_TYPE:
+      os << "<DescriptorArray["
+         << DescriptorArray::cast(*this)->number_of_descriptors() << "]>";
+      break;
+    case TRANSITION_ARRAY_TYPE:
+      os << "<TransitionArray[" << TransitionArray::cast(*this)->length()
+         << "]>";
+      break;
+    case PROPERTY_ARRAY_TYPE:
+      os << "<PropertyArray[" << PropertyArray::cast(*this)->length() << "]>";
+      break;
+    case FEEDBACK_CELL_TYPE: {
+      {
+        ReadOnlyRoots roots = GetReadOnlyRoots();
+        os << "<FeedbackCell[";
+        if (map() == roots.no_closures_cell_map()) {
+          os << "no feedback";
+        } else if (map() == roots.one_closure_cell_map()) {
+          os << "one closure";
+        } else if (map() == roots.many_closures_cell_map()) {
+          os << "many closures";
+        } else {
+          os << "!!!INVALID MAP!!!";
+        }
+        os << "]>";
+      }
+      break;
+    }
+    case CLOSURE_FEEDBACK_CELL_ARRAY_TYPE:
+      os << "<ClosureFeedbackCellArray["
+         << ClosureFeedbackCellArray::cast(*this)->length() << "]>";
+      break;
+    case FEEDBACK_VECTOR_TYPE:
+      os << "<FeedbackVector[" << FeedbackVector::cast(*this)->length() << "]>";
+      break;
+    case FREE_SPACE_TYPE:
+      os << "<FreeSpace[" << FreeSpace::cast(*this)->size(kRelaxedLoad) << "]>";
+      break;
+
+    case PREPARSE_DATA_TYPE: {
+      Tagged<PreparseData> data = PreparseData::cast(*this);
+      os << "<PreparseData[data=" << data->data_length()
+         << " children=" << data->children_length() << "]>";
+      break;
+    }
+
+    case UNCOMPILED_DATA_WITHOUT_PREPARSE_DATA_TYPE: {
+      Tagged<UncompiledDataWithoutPreparseData> data =
+          UncompiledDataWithoutPreparseData::cast(*this);
+      os << "<UncompiledDataWithoutPreparseData (" << data->start_position()
+         << ", " << data->end_position() << ")]>";
+      break;
+    }
+
+    case UNCOMPILED_DATA_WITH_PREPARSE_DATA_TYPE: {
+      Tagged<UncompiledDataWithPreparseData> data =
+          UncompiledDataWithPreparseData::cast(*this);
+      os << "<UncompiledDataWithPreparseData (" << data->start_position()
+         << ", " << data->end_position()
+         << ") preparsed=" << Brief(data->preparse_data()) << ">";
+      break;
+    }
+
+    case SHARED_FUNCTION_INFO_TYPE: {
+      Tagged<SharedFunctionInfo> shared = SharedFunctionInfo::cast(*this);
+      std::unique_ptr<char[]> debug_name = shared->DebugNameCStr();
+      if (debug_name[0] != '\0') {
+        os << "<SharedFunctionInfo " << debug_name.get() << ">";
+      } else {
+        os << "<SharedFunctionInfo>";
+      }
+      break;
+    }
+    case JS_MESSAGE_OBJECT_TYPE:
+      os << "<JSMessageObject>";
+      break;
+#define MAKE_STRUCT_CASE(TYPE, Name, name)    \
+  case TYPE:                                  \
+    os << "<" #Name;                          \
+    Name::cast(*this)->BriefPrintDetails(os); \
+    os << ">";                                \
+    break;
+      STRUCT_LIST(MAKE_STRUCT_CASE)
+#undef MAKE_STRUCT_CASE
+    case ALLOCATION_SITE_TYPE: {
+      os << "<AllocationSite";
+      AllocationSite::cast(*this)->BriefPrintDetails(os);
+      os << ">";
+      break;
+    }
+    case SCOPE_INFO_TYPE: {
+      Tagged<ScopeInfo> scope = ScopeInfo::cast(*this);
+      os << "<ScopeInfo";
+      if (!scope->IsEmpty()) os << " " << scope->scope_type();
+      os << ">";
+      break;
+    }
+    case CODE_TYPE: {
+      Tagged<Code> code = Code::cast(*this);
+      os << "<Code " << CodeKindToString(code->kind());
+      if (code->is_builtin()) {
+        os << " " << Builtins::name(code->builtin_id());
+      }
+      os << ">";
+      break;
+    }
+    case HOLE_TYPE: {
+#define PRINT_HOLE(Type, Value, _) \
+  if (Is##Type(*this)) {           \
+    os << "<" #Value ">";          \
+    break;                         \
+  }
+      HOLE_LIST(PRINT_HOLE)
+#undef PRINT_HOLE
+      UNREACHABLE();
+    }
+    case INSTRUCTION_STREAM_TYPE: {
+      Tagged<InstructionStream> istream = InstructionStream::cast(*this);
+      Tagged<Code> code = istream->code(kAcquireLoad);
+      os << "<InstructionStream " << CodeKindToString(code->kind());
+      if (code->is_builtin()) {
+        os << " " << Builtins::name(code->builtin_id());
+      }
+      os << ">";
+      break;
+    }
+    case ODDBALL_TYPE: {
+      if (IsUndefined(*this)) {
+        os << "<undefined>";
+      } else if (IsNull(*this)) {
+        os << "<null>";
+      } else if (IsTrue(*this)) {
+        os << "<true>";
+      } else if (IsFalse(*this)) {
+        os << "<false>";
+      } else {
+        os << "<Odd Oddball: ";
+        os << Oddball::cast(*this)->to_string()->ToCString().get();
+        os << ">";
+      }
+      break;
+    }
+    case SYMBOL_TYPE: {
+      Tagged<Symbol> symbol = Symbol::cast(*this);
+      symbol->SymbolShortPrint(os);
+      break;
+    }
+    case HEAP_NUMBER_TYPE: {
+      os << "<HeapNumber ";
+      HeapNumber::cast(*this)->HeapNumberShortPrint(os);
+      os << ">";
+      break;
+    }
+    case BIGINT_TYPE: {
+      os << "<BigInt ";
+      BigInt::cast(*this)->BigIntShortPrint(os);
+      os << ">";
+      break;
+    }
+    case JS_PROXY_TYPE:
+      os << "<JSProxy>";
+      break;
+    case FOREIGN_TYPE:
+      os << "<Foreign>";
+      break;
+    case CELL_TYPE: {
+      os << "<Cell value= ";
+      HeapStringAllocator allocator;
+      StringStream accumulator(&allocator);
+      ShortPrint(Cell::cast(*this)->value(), &accumulator);
+      os << accumulator.ToCString().get();
+      os << '>';
+      break;
+    }
+    case PROPERTY_CELL_TYPE: {
+      Tagged<PropertyCell> cell = PropertyCell::cast(*this);
+      os << "<PropertyCell name=";
+      ShortPrint(cell->name(), os);
+      os << " value=";
+      HeapStringAllocator allocator;
+      StringStream accumulator(&allocator);
+      ShortPrint(cell->value(kAcquireLoad), &accumulator);
+      os << accumulator.ToCString().get();
+      os << '>';
+      break;
+    }
+    case ACCESSOR_INFO_TYPE: {
+      Tagged<AccessorInfo> info = AccessorInfo::cast(*this);
+      os << "<AccessorInfo ";
+      os << "name= " << Brief(info->name());
+      os << ", data= " << Brief(info->data());
+      os << ">";
+      break;
+    }
+    case CALL_HANDLER_INFO_TYPE: {
+      Tagged<CallHandlerInfo> info = CallHandlerInfo::cast(*this);
+      os << "<CallHandlerInfo ";
+      Isolate* isolate;
+      if (GetIsolateFromHeapObject(*this, &isolate)) {
+        os << "callback= " << reinterpret_cast<void*>(info->callback(isolate));
+      } else {
+        os << "callback= " << kUnavailableString;
+      }
+      os << ", data= " << Brief(info->data());
+      if (info->IsSideEffectFreeCallHandlerInfo()) {
+        os << ", side_effect_free= true>";
+      } else {
+        os << ", side_effect_free= false>";
+      }
+      break;
+    }
+    default:
+      os << "<Other heap object (" << map()->instance_type() << ")>";
+      break;
+  }
+}
+
 void HeapNumber::HeapNumberShortPrint(std::ostream& os) {
   static constexpr uint64_t kUint64AllBitsSet =
       static_cast<uint64_t>(int64_t{-1});
@@ -2754,39 +3157,51 @@ void HeapNumber::HeapNumberShortPrint(std::ostream& os) {
 
 // TODO(cbruni): remove once the new maptracer is in place.
 void Name::NameShortPrint() {
-  if (this->IsString()) {
-    PrintF("%s", String::cast(*this).ToCString().get());
+  if (IsString(*this)) {
+    PrintF("%s", String::cast(*this)->ToCString().get());
   } else {
-    DCHECK(this->IsSymbol());
-    Symbol s = Symbol::cast(*this);
-    if (s.description().IsUndefined()) {
-      PrintF("#<%s>", s.PrivateSymbolToName());
+    DCHECK(IsSymbol(*this));
+    Tagged<Symbol> s = Symbol::cast(*this);
+    if (IsUndefined(s->description())) {
+      PrintF("#<%s>", s->PrivateSymbolToName());
     } else {
-      PrintF("<%s>", String::cast(s.description()).ToCString().get());
+      PrintF("<%s>", String::cast(s->description())->ToCString().get());
     }
   }
 }
 
 // TODO(cbruni): remove once the new maptracer is in place.
 int Name::NameShortPrint(base::Vector<char> str) {
-  if (this->IsString()) {
-    return SNPrintF(str, "%s", String::cast(*this).ToCString().get());
+  if (IsString(*this)) {
+    return SNPrintF(str, "%s", String::cast(*this)->ToCString().get());
   } else {
-    DCHECK(this->IsSymbol());
-    Symbol s = Symbol::cast(*this);
-    if (s.description().IsUndefined()) {
-      return SNPrintF(str, "#<%s>", s.PrivateSymbolToName());
+    DCHECK(IsSymbol(*this));
+    Tagged<Symbol> s = Symbol::cast(*this);
+    if (IsUndefined(s->description())) {
+      return SNPrintF(str, "#<%s>", s->PrivateSymbolToName());
     } else {
       return SNPrintF(str, "<%s>",
-                      String::cast(s.description()).ToCString().get());
+                      String::cast(s->description())->ToCString().get());
     }
   }
 }
 
+void Symbol::SymbolShortPrint(std::ostream& os) {
+  os << "<Symbol:";
+  if (!IsUndefined(description())) {
+    os << " ";
+    Tagged<String> description_as_string = String::cast(description());
+    description_as_string->PrintUC16(os, 0, description_as_string->length());
+  } else {
+    os << " (" << PrivateSymbolToName() << ")";
+  }
+  os << ">";
+}
+
 void Map::PrintMapDetails(std::ostream& os) {
   DisallowGarbageCollection no_gc;
   this->MapPrint(os);
-  instance_descriptors().PrintDescriptors(os);
+  instance_descriptors()->PrintDescriptors(os);
 }
 
 void Map::MapPrint(std::ostream& os) {
@@ -2802,11 +3217,11 @@ void Map::MapPrint(std::ostream& os) {
   } else {
     os << instance_size();
   }
-  if (IsJSObjectMap()) {
+  if (IsJSObjectMap(*this)) {
     os << "\n - inobject properties: " << GetInObjectProperties();
+    os << "\n - unused property fields: " << UnusedPropertyFields();
   }
   os << "\n - elements kind: " << ElementsKindToString(elements_kind());
-  os << "\n - unused property fields: " << UnusedPropertyFields();
   os << "\n - enum length: ";
   if (EnumLength() == kInvalidEnumCacheSentinel) {
     os << "invalid";
@@ -2819,7 +3234,8 @@ void Map::MapPrint(std::ostream& os) {
   if (is_dictionary_map()) os << "\n - dictionary_map";
   if (has_named_interceptor()) os << "\n - named_interceptor";
   if (has_indexed_interceptor()) os << "\n - indexed_interceptor";
-  if (may_have_interesting_symbols()) os << "\n - may_have_interesting_symbols";
+  if (may_have_interesting_properties())
+    os << "\n - may_have_interesting_properties";
   if (is_undetectable()) os << "\n - undetectable";
   if (is_callable()) os << "\n - callable";
   if (is_constructor()) os << "\n - constructor";
@@ -2829,7 +3245,7 @@ void Map::MapPrint(std::ostream& os) {
   }
   if (is_access_check_needed()) os << "\n - access_check_needed";
   if (!is_extensible()) os << "\n - non-extensible";
-  if (IsContextMap()) {
+  if (IsContextMap(*this)) {
     os << "\n - native context: " << Brief(native_context());
   } else if (is_prototype_map()) {
     os << "\n - prototype_map";
@@ -2851,11 +3267,11 @@ void Map::MapPrint(std::ostream& os) {
     int nof_transitions = transitions.NumberOfTransitions();
     if (nof_transitions > 0) {
       os << "\n - transitions #" << nof_transitions << ": ";
-      HeapObject heap_object;
-      Smi smi;
+      Tagged<HeapObject> heap_object;
+      Tagged<Smi> smi;
       if (raw_transitions()->ToSmi(&smi)) {
         os << Brief(smi);
-      } else if (raw_transitions()->GetHeapObject(&heap_object)) {
+      } else if (raw_transitions().GetHeapObject(&heap_object)) {
         os << Brief(heap_object);
       }
 #ifdef OBJECT_PRINT
@@ -2864,7 +3280,10 @@ void Map::MapPrint(std::ostream& os) {
     }
   }
   os << "\n - prototype: " << Brief(prototype());
-  if (!IsContextMap()) {
+  if (has_non_instance_prototype()) {
+    os << "\n - non-instance prototype: " << Brief(GetNonInstancePrototype());
+  }
+  if (!IsContextMap(*this)) {
     os << "\n - constructor: " << Brief(GetConstructor());
   }
   os << "\n - dependent code: " << Brief(dependent_code());
@@ -2874,12 +3293,12 @@ void Map::MapPrint(std::ostream& os) {
 
 void DescriptorArray::PrintDescriptors(std::ostream& os) {
   for (InternalIndex i : InternalIndex::Range(number_of_descriptors())) {
-    Name key = GetKey(i);
+    Tagged<Name> key = GetKey(i);
     os << "\n  [" << i.as_int() << "]: ";
 #ifdef OBJECT_PRINT
-    key.NamePrint(os);
+    key->NamePrint(os);
 #else
-    key.ShortPrint(os);
+    ShortPrint(key, os);
 #endif
     os << " ";
     PrintDescriptorDetails(os, i, PropertyDetails::kPrintFull);
@@ -2895,17 +3314,17 @@ void DescriptorArray::PrintDescriptorDetails(std::ostream& os,
   os << " @ ";
   switch (details.location()) {
     case PropertyLocation::kField: {
-      FieldType field_type = GetFieldType(descriptor);
-      field_type.PrintTo(os);
+      Tagged<FieldType> field_type = GetFieldType(descriptor);
+      field_type->PrintTo(os);
       break;
     }
     case PropertyLocation::kDescriptor:
-      Object value = GetStrongValue(descriptor);
+      Tagged<Object> value = GetStrongValue(descriptor);
       os << Brief(value);
-      if (value.IsAccessorPair()) {
-        AccessorPair pair = AccessorPair::cast(value);
-        os << "(get: " << Brief(pair.getter())
-           << ", set: " << Brief(pair.setter()) << ")";
+      if (IsAccessorPair(value)) {
+        Tagged<AccessorPair> pair = AccessorPair::cast(value);
+        os << "(get: " << Brief(pair->getter())
+           << ", set: " << Brief(pair->setter()) << ")";
       }
       break;
   }
@@ -2927,16 +3346,16 @@ char* String::ToAsciiArray() {
 }
 
 // static
-void TransitionsAccessor::PrintOneTransition(std::ostream& os, Name key,
-                                             Map target) {
+void TransitionsAccessor::PrintOneTransition(std::ostream& os, Tagged<Name> key,
+                                             Tagged<Map> target) {
   os << "\n     ";
 #ifdef OBJECT_PRINT
-  key.NamePrint(os);
+  key->NamePrint(os);
 #else
-  key.ShortPrint(os);
+  ShortPrint(key, os);
 #endif
   os << ": ";
-  ReadOnlyRoots roots = key.GetReadOnlyRoots();
+  ReadOnlyRoots roots = key->GetReadOnlyRoots();
   if (key == roots.nonextensible_symbol()) {
     os << "(transition to non-extensible)";
   } else if (key == roots.sealed_symbol()) {
@@ -2944,17 +3363,17 @@ void TransitionsAccessor::PrintOneTransition(std::ostream& os, Name key,
   } else if (key == roots.frozen_symbol()) {
     os << "(transition to frozen)";
   } else if (key == roots.elements_transition_symbol()) {
-    os << "(transition to " << ElementsKindToString(target.elements_kind())
+    os << "(transition to " << ElementsKindToString(target->elements_kind())
        << ")";
   } else if (key == roots.strict_function_transition_symbol()) {
     os << " (transition to strict function)";
   } else {
     DCHECK(!IsSpecialTransition(roots, key));
     os << "(transition to ";
-    InternalIndex descriptor = target.LastAdded();
-    DescriptorArray descriptors = target.instance_descriptors();
-    descriptors.PrintDescriptorDetails(os, descriptor,
-                                       PropertyDetails::kForTransitions);
+    InternalIndex descriptor = target->LastAdded();
+    Tagged<DescriptorArray> descriptors = target->instance_descriptors();
+    descriptors->PrintDescriptorDetails(os, descriptor,
+                                        PropertyDetails::kForTransitions);
     os << ")";
   }
   os << " -> " << Brief(target);
@@ -2964,8 +3383,8 @@ void TransitionArray::PrintInternal(std::ostream& os) {
   int num_transitions = number_of_transitions();
   os << "Transition array #" << num_transitions << ":";
   for (int i = 0; i < num_transitions; i++) {
-    Name key = GetKey(i);
-    Map target = GetTarget(i);
+    Tagged<Name> key = GetKey(i);
+    Tagged<Map> target = GetTarget(i);
     TransitionsAccessor::PrintOneTransition(os, key, target);
   }
   os << "\n" << std::flush;
@@ -2978,13 +3397,14 @@ void TransitionsAccessor::PrintTransitions(std::ostream& os) {
     case kMigrationTarget:
       return;
     case kWeakRef: {
-      Map target = Map::cast(raw_transitions_->GetHeapObjectAssumeWeak());
-      Name key = GetSimpleTransitionKey(target);
+      Tagged<Map> target =
+          Map::cast(raw_transitions_.GetHeapObjectAssumeWeak());
+      Tagged<Name> key = GetSimpleTransitionKey(target);
       PrintOneTransition(os, key, target);
       break;
     }
     case kFullTransitionArray:
-      return transitions().PrintInternal(os);
+      return transitions()->PrintInternal(os);
   }
 }
 
@@ -3002,8 +3422,8 @@ void TransitionsAccessor::PrintTransitionTree(
   int num_transitions = NumberOfTransitions();
   if (num_transitions == 0) return;
   for (int i = 0; i < num_transitions; i++) {
-    Name key = GetKey(i);
-    Map target = GetTarget(i);
+    Tagged<Name> key = GetKey(i);
+    Tagged<Map> target = GetTarget(i);
     os << std::endl
        << "  " << level << "/" << i << ":" << std::setw(level * 2 + 2) << " ";
     std::stringstream ss;
@@ -3017,22 +3437,23 @@ void TransitionsAccessor::PrintTransitionTree(
     } else if (key == roots.frozen_symbol()) {
       os << "to frozen";
     } else if (key == roots.elements_transition_symbol()) {
-      os << "to " << ElementsKindToString(target.elements_kind());
+      os << "to " << ElementsKindToString(target->elements_kind());
     } else if (key == roots.strict_function_transition_symbol()) {
       os << "to strict function";
     } else {
 #ifdef OBJECT_PRINT
-      key.NamePrint(os);
+      key->NamePrint(os);
 #else
-      key.ShortPrint(os);
+      ShortPrint(key, os);
 #endif
       os << " ";
       DCHECK(!IsSpecialTransition(ReadOnlyRoots(isolate_), key));
       os << "to ";
-      InternalIndex descriptor = target.LastAdded();
-      DescriptorArray descriptors = target.instance_descriptors(isolate_);
-      descriptors.PrintDescriptorDetails(os, descriptor,
-                                         PropertyDetails::kForTransitions);
+      InternalIndex descriptor = target->LastAdded();
+      Tagged<DescriptorArray> descriptors =
+          target->instance_descriptors(isolate_);
+      descriptors->PrintDescriptorDetails(os, descriptor,
+                                          PropertyDetails::kForTransitions);
     }
     TransitionsAccessor transitions(isolate_, target);
     transitions.PrintTransitionTree(os, level + 1, no_gc);
@@ -3052,7 +3473,7 @@ void JSObject::PrintTransitions(std::ostream& os) {
 
 namespace {
 
-inline i::Object GetObjectFromRaw(void* object) {
+inline i::Tagged<i::Object> GetObjectFromRaw(void* object) {
   i::Address object_ptr = reinterpret_cast<i::Address>(object);
 #ifdef V8_COMPRESS_POINTERS
   if (RoundDown<i::kPtrComprCageBaseAlignment>(object_ptr) == i::kNullAddress) {
@@ -3071,13 +3492,14 @@ inline i::Object GetObjectFromRaw(void* object) {
 // The following functions are used by our gdb macros.
 //
 V8_DONT_STRIP_SYMBOL
-V8_EXPORT_PRIVATE extern i::Object _v8_internal_Get_Object(void* object) {
+V8_EXPORT_PRIVATE extern i::Tagged<i::Object> _v8_internal_Get_Object(
+    void* object) {
   return GetObjectFromRaw(object);
 }
 
 V8_DONT_STRIP_SYMBOL
 V8_EXPORT_PRIVATE extern void _v8_internal_Print_Object(void* object) {
-  GetObjectFromRaw(object).Print();
+  i::Print(GetObjectFromRaw(object));
 }
 
 V8_DONT_STRIP_SYMBOL
@@ -3123,12 +3545,47 @@ V8_EXPORT_PRIVATE extern void _v8_internal_Print_Code(void* object) {
     return;
   }
 
-#ifdef ENABLE_DISASSEMBLER
+#if defined(OBJECT_PRINT)
+  i::StdoutStream os;
+  lookup_result->CodePrint(os, nullptr, address);
+#elif defined(ENABLE_DISASSEMBLER)
   i::StdoutStream os;
   lookup_result->Disassemble(nullptr, os, isolate, address);
-#else   // ENABLE_DISASSEMBLER
-  lookup_result->Print();
-#endif  // ENABLE_DISASSEMBLER
+#else
+  i::Print(*lookup_result);
+#endif
+}
+
+V8_DONT_STRIP_SYMBOL
+V8_EXPORT_PRIVATE extern void _v8_internal_Print_OnlyCode(void* object,
+                                                          size_t range_limit) {
+  i::Address address = reinterpret_cast<i::Address>(object);
+  i::Isolate* isolate = i::Isolate::Current();
+
+#if V8_ENABLE_WEBASSEMBLY
+  {
+    i::wasm::WasmCodeRefScope scope;
+    if (i::wasm::GetWasmCodeManager()->LookupCode(address)) {
+      i::PrintF("Not supported on wasm code");
+      return;
+    }
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
+
+  v8::base::Optional<i::Code> lookup_result =
+      isolate->heap()->TryFindCodeForInnerPointerForPrinting(address);
+  if (!lookup_result.has_value()) {
+    i::PrintF(
+        "%p is not within the current isolate's code or embedded spaces\n",
+        object);
+    return;
+  }
+
+#if defined(ENABLE_DISASSEMBLER)
+  i::StdoutStream os;
+  lookup_result->DisassembleOnlyCode(nullptr, os, isolate, address,
+                                     range_limit);
+#endif
 }
 
 V8_DONT_STRIP_SYMBOL
@@ -3139,12 +3596,12 @@ V8_EXPORT_PRIVATE extern void _v8_internal_Print_StackTrace() {
 
 V8_DONT_STRIP_SYMBOL
 V8_EXPORT_PRIVATE extern void _v8_internal_Print_TransitionTree(void* object) {
-  i::Object o(GetObjectFromRaw(object));
-  if (!o.IsMap()) {
+  i::Tagged<i::Object> o(GetObjectFromRaw(object));
+  if (!IsMap(o)) {
     printf("Please provide a valid Map\n");
   } else {
 #if defined(DEBUG) || defined(OBJECT_PRINT)
-    i::Map map = i::Map::unchecked_cast(o);
+    i::Tagged<i::Map> map = i::Map::unchecked_cast(o);
     i::TransitionsAccessor transitions(i::Isolate::Current(), map);
     transitions.PrintTransitionTree();
 #endif
diff --git a/deps/v8/src/diagnostics/perf-jit.cc b/deps/v8/src/diagnostics/perf-jit.cc
index b3758680d1d55e..59a774b270ce15 100644
--- a/deps/v8/src/diagnostics/perf-jit.cc
+++ b/deps/v8/src/diagnostics/perf-jit.cc
@@ -28,6 +28,7 @@
 #include "src/diagnostics/perf-jit.h"
 
 #include "src/common/assert-scope.h"
+#include "src/flags/flags.h"
 
 // Only compile the {LinuxPerfJitLogger} on Linux.
 #if V8_OS_LINUX
@@ -116,7 +117,7 @@ struct PerfJitCodeUnwindingInfo : PerfJitBase {
   // Followed by size_ - sizeof(PerfJitCodeUnwindingInfo) bytes of data.
 };
 
-const char LinuxPerfJitLogger::kFilenameFormatString[] = "./jit-%d.dump";
+const char LinuxPerfJitLogger::kFilenameFormatString[] = "%s/jit-%d.dump";
 
 // Extra padding for the PID in the filename
 const int LinuxPerfJitLogger::kFilenameBufferPadding = 16;
@@ -135,9 +136,11 @@ void LinuxPerfJitLogger::OpenJitDumpFile() {
   // Open the perf JIT dump file.
   perf_output_handle_ = nullptr;
 
-  int bufferSize = sizeof(kFilenameFormatString) + kFilenameBufferPadding;
+  size_t bufferSize = strlen(v8_flags.perf_prof_path) +
+                      sizeof(kFilenameFormatString) + kFilenameBufferPadding;
   base::ScopedVector<char> perf_dump_name(bufferSize);
-  int size = SNPrintF(perf_dump_name, kFilenameFormatString, process_id_);
+  int size = SNPrintF(perf_dump_name, kFilenameFormatString,
+                      v8_flags.perf_prof_path.value(), process_id_);
   CHECK_NE(size, -1);
 
   int fd = open(perf_dump_name.begin(), O_CREAT | O_TRUNC | O_RDWR, 0666);
@@ -217,11 +220,11 @@ uint64_t LinuxPerfJitLogger::GetTimestamp() {
 }
 
 void LinuxPerfJitLogger::LogRecordedBuffer(
-    AbstractCode abstract_code, MaybeHandle<SharedFunctionInfo> maybe_shared,
-    const char* name, int length) {
+    Tagged<AbstractCode> abstract_code,
+    MaybeHandle<SharedFunctionInfo> maybe_sfi, const char* name, int length) {
   DisallowGarbageCollection no_gc;
   if (v8_flags.perf_basic_prof_only_functions) {
-    CodeKind code_kind = abstract_code.kind(isolate_);
+    CodeKind code_kind = abstract_code->kind(isolate_);
     if (code_kind != CodeKind::INTERPRETED_FUNCTION &&
         code_kind != CodeKind::TURBOFAN && code_kind != CodeKind::MAGLEV &&
         code_kind != CodeKind::BASELINE) {
@@ -234,27 +237,29 @@ void LinuxPerfJitLogger::LogRecordedBuffer(
   if (perf_output_handle_ == nullptr) return;
 
   // We only support non-interpreted functions.
-  if (!abstract_code.IsCode(isolate_)) return;
-  Code code = Code::cast(abstract_code);
+  if (!IsCode(abstract_code, isolate_)) return;
+  Tagged<Code> code = Code::cast(abstract_code);
 
   // Debug info has to be emitted first.
-  Handle<SharedFunctionInfo> shared;
-  if (v8_flags.perf_prof && maybe_shared.ToHandle(&shared)) {
+  Handle<SharedFunctionInfo> sfi;
+  if (v8_flags.perf_prof && maybe_sfi.ToHandle(&sfi)) {
     // TODO(herhut): This currently breaks for js2wasm/wasm2js functions.
-    CodeKind kind = code.kind();
+    CodeKind kind = code->kind();
     if (kind != CodeKind::JS_TO_WASM_FUNCTION &&
         kind != CodeKind::WASM_TO_JS_FUNCTION) {
-      LogWriteDebugInfo(code, shared);
+      DCHECK_IMPLIES(IsScript(sfi->script()),
+                     Script::cast(sfi->script())->has_line_ends());
+      LogWriteDebugInfo(code, sfi);
     }
   }
 
   const char* code_name = name;
-  uint8_t* code_pointer = reinterpret_cast<uint8_t*>(code.InstructionStart());
+  uint8_t* code_pointer = reinterpret_cast<uint8_t*>(code->instruction_start());
 
   // Unwinding info comes right after debug info.
   if (v8_flags.perf_prof_unwinding_info) LogWriteUnwindingInfo(code);
 
-  WriteJitCodeLoadEntry(code_pointer, code.InstructionSize(), code_name,
+  WriteJitCodeLoadEntry(code_pointer, code->instruction_size(), code_name,
                         length);
 }
 
@@ -302,19 +307,21 @@ constexpr size_t kUnknownScriptNameStringLen =
     arraysize(kUnknownScriptNameString) - 1;
 
 namespace {
-base::Vector<const char> GetScriptName(Object maybeScript,
+base::Vector<const char> GetScriptName(Tagged<Object> maybeScript,
                                        std::unique_ptr<char[]>* storage,
                                        const DisallowGarbageCollection& no_gc) {
-  if (maybeScript.IsScript()) {
-    Object name_or_url = Script::cast(maybeScript).GetNameOrSourceURL();
-    if (name_or_url.IsSeqOneByteString()) {
-      SeqOneByteString str = SeqOneByteString::cast(name_or_url);
-      return {reinterpret_cast<char*>(str.GetChars(no_gc)),
-              static_cast<size_t>(str.length())};
-    } else if (name_or_url.IsString()) {
+  if (IsScript(maybeScript)) {
+    Tagged<Object> name_or_url =
+        Script::cast(maybeScript)->GetNameOrSourceURL();
+    if (IsSeqOneByteString(name_or_url)) {
+      Tagged<SeqOneByteString> str = SeqOneByteString::cast(name_or_url);
+      return {reinterpret_cast<char*>(str->GetChars(no_gc)),
+              static_cast<size_t>(str->length())};
+    } else if (IsString(name_or_url)) {
       int length;
-      *storage = String::cast(name_or_url)
-                     .ToCString(DISALLOW_NULLS, FAST_STRING_TRAVERSAL, &length);
+      *storage =
+          String::cast(name_or_url)
+              ->ToCString(DISALLOW_NULLS, FAST_STRING_TRAVERSAL, &length);
       return {storage->get(), static_cast<size_t>(length)};
     }
   }
@@ -323,11 +330,11 @@ base::Vector<const char> GetScriptName(Object maybeScript,
 
 }  // namespace
 
-SourcePositionInfo GetSourcePositionInfo(Isolate* isolate, Code code,
+SourcePositionInfo GetSourcePositionInfo(Isolate* isolate, Tagged<Code> code,
                                          Handle<SharedFunctionInfo> function,
                                          SourcePosition pos) {
   DisallowGarbageCollection disallow;
-  if (code.is_turbofanned()) {
+  if (code->is_turbofanned()) {
     return pos.FirstInfo(isolate, code);
   } else {
     return SourcePositionInfo(isolate, pos, function);
@@ -336,34 +343,34 @@ SourcePositionInfo GetSourcePositionInfo(Isolate* isolate, Code code,
 
 }  // namespace
 
-void LinuxPerfJitLogger::LogWriteDebugInfo(Code code,
+void LinuxPerfJitLogger::LogWriteDebugInfo(Tagged<Code> code,
                                            Handle<SharedFunctionInfo> shared) {
   // Line ends of all scripts have been initialized prior to this.
   DisallowGarbageCollection no_gc;
   // The WasmToJS wrapper stubs have source position entries.
-  SharedFunctionInfo raw_shared = *shared;
-  if (!raw_shared.HasSourceCode()) return;
+  Tagged<SharedFunctionInfo> raw_shared = *shared;
+  if (!raw_shared->HasSourceCode()) return;
 
   PerfJitCodeDebugInfo debug_info;
   uint32_t size = sizeof(debug_info);
 
-  ByteArray source_position_table =
-      code.SourcePositionTable(isolate_, raw_shared);
+  Tagged<ByteArray> source_position_table =
+      code->SourcePositionTable(isolate_, raw_shared);
   // Compute the entry count and get the names of all scripts.
   // Avoid additional work if the script name is repeated. Multiple script
   // names only occur for cross-script inlining.
   uint32_t entry_count = 0;
-  Object last_script = Smi::zero();
+  Tagged<Object> last_script = Smi::zero();
   size_t last_script_name_size = 0;
   std::vector<base::Vector<const char>> script_names;
   for (SourcePositionTableIterator iterator(source_position_table);
        !iterator.done(); iterator.Advance()) {
     SourcePositionInfo info(GetSourcePositionInfo(isolate_, code, shared,
                                                   iterator.source_position()));
-    Object current_script = *info.script;
+    Tagged<Object> current_script = *info.script;
     if (current_script != last_script) {
       std::unique_ptr<char[]> name_storage;
-      auto name = GetScriptName(raw_shared.script(), &name_storage, no_gc);
+      auto name = GetScriptName(raw_shared->script(), &name_storage, no_gc);
       script_names.push_back(name);
       // Add the size of the name after each entry.
       last_script_name_size = name.size() + sizeof(kStringTerminator);
@@ -379,7 +386,7 @@ void LinuxPerfJitLogger::LogWriteDebugInfo(Code code,
 
   debug_info.event_ = PerfJitCodeLoad::kDebugInfo;
   debug_info.time_stamp_ = GetTimestamp();
-  debug_info.address_ = code.InstructionStart();
+  debug_info.address_ = code->instruction_start();
   debug_info.entry_count_ = entry_count;
 
   // Add the sizes of fixed parts of entries.
@@ -389,7 +396,7 @@ void LinuxPerfJitLogger::LogWriteDebugInfo(Code code,
   debug_info.size_ = size + padding;
   LogWriteBytes(reinterpret_cast<const char*>(&debug_info), sizeof(debug_info));
 
-  Address code_start = code.InstructionStart();
+  Address code_start = code->instruction_start();
 
   last_script = Smi::zero();
   int script_names_index = 0;
@@ -405,7 +412,7 @@ void LinuxPerfJitLogger::LogWriteDebugInfo(Code code,
     entry.line_number_ = info.line + 1;
     entry.column_ = info.column + 1;
     LogWriteBytes(reinterpret_cast<const char*>(&entry), sizeof(entry));
-    Object current_script = *info.script;
+    Tagged<Object> current_script = *info.script;
     auto name_string = script_names[script_names_index];
     LogWriteBytes(name_string.begin(),
                   static_cast<uint32_t>(name_string.size()));
@@ -488,14 +495,14 @@ void LinuxPerfJitLogger::LogWriteDebugInfo(const wasm::WasmCode* code) {
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void LinuxPerfJitLogger::LogWriteUnwindingInfo(Code code) {
+void LinuxPerfJitLogger::LogWriteUnwindingInfo(Tagged<Code> code) {
   PerfJitCodeUnwindingInfo unwinding_info_header;
   unwinding_info_header.event_ = PerfJitCodeLoad::kUnwindingInfo;
   unwinding_info_header.time_stamp_ = GetTimestamp();
   unwinding_info_header.eh_frame_hdr_size_ = EhFrameConstants::kEhFrameHdrSize;
 
-  if (code.has_unwinding_info()) {
-    unwinding_info_header.unwinding_size_ = code.unwinding_info_size();
+  if (code->has_unwinding_info()) {
+    unwinding_info_header.unwinding_size_ = code->unwinding_info_size();
     unwinding_info_header.mapped_size_ = unwinding_info_header.unwinding_size_;
   } else {
     unwinding_info_header.unwinding_size_ = EhFrameConstants::kEhFrameHdrSize;
@@ -510,9 +517,9 @@ void LinuxPerfJitLogger::LogWriteUnwindingInfo(Code code) {
   LogWriteBytes(reinterpret_cast<const char*>(&unwinding_info_header),
                 sizeof(unwinding_info_header));
 
-  if (code.has_unwinding_info()) {
-    LogWriteBytes(reinterpret_cast<const char*>(code.unwinding_info_start()),
-                  code.unwinding_info_size());
+  if (code->has_unwinding_info()) {
+    LogWriteBytes(reinterpret_cast<const char*>(code->unwinding_info_start()),
+                  code->unwinding_info_size());
   } else {
     OFStream perf_output_stream(perf_output_handle_);
     EhFrameWriter::WriteEmptyEhFrame(perf_output_stream);
diff --git a/deps/v8/src/diagnostics/perf-jit.h b/deps/v8/src/diagnostics/perf-jit.h
index 64161d072232d8..294c0cd32da4b6 100644
--- a/deps/v8/src/diagnostics/perf-jit.h
+++ b/deps/v8/src/diagnostics/perf-jit.h
@@ -44,10 +44,12 @@ class LinuxPerfJitLogger : public CodeEventLogger {
   explicit LinuxPerfJitLogger(Isolate* isolate);
   ~LinuxPerfJitLogger() override;
 
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) override {
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) override {
     UNREACHABLE();  // Unsupported.
   }
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) override {}
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                         Tagged<BytecodeArray> to) override {}
   void CodeDisableOptEvent(Handle<AbstractCode> code,
                            Handle<SharedFunctionInfo> shared) override {}
 
@@ -58,7 +60,7 @@ class LinuxPerfJitLogger : public CodeEventLogger {
   void CloseMarkerFile(void* marker_address);
 
   uint64_t GetTimestamp();
-  void LogRecordedBuffer(AbstractCode code,
+  void LogRecordedBuffer(Tagged<AbstractCode> code,
                          MaybeHandle<SharedFunctionInfo> maybe_shared,
                          const char* name, int length) override;
 #if V8_ENABLE_WEBASSEMBLY
@@ -79,11 +81,11 @@ class LinuxPerfJitLogger : public CodeEventLogger {
 
   void LogWriteBytes(const char* bytes, int size);
   void LogWriteHeader();
-  void LogWriteDebugInfo(Code code, Handle<SharedFunctionInfo> shared);
+  void LogWriteDebugInfo(Tagged<Code> code, Handle<SharedFunctionInfo> shared);
 #if V8_ENABLE_WEBASSEMBLY
   void LogWriteDebugInfo(const wasm::WasmCode* code);
 #endif  // V8_ENABLE_WEBASSEMBLY
-  void LogWriteUnwindingInfo(Code code);
+  void LogWriteUnwindingInfo(Tagged<Code> code);
 
   static const uint32_t kElfMachIA32 = 3;
   static const uint32_t kElfMachX64 = 62;
diff --git a/deps/v8/src/diagnostics/ppc/disasm-ppc.cc b/deps/v8/src/diagnostics/ppc/disasm-ppc.cc
index 88a14da01736b8..ee159069430987 100644
--- a/deps/v8/src/diagnostics/ppc/disasm-ppc.cc
+++ b/deps/v8/src/diagnostics/ppc/disasm-ppc.cc
@@ -10,9 +10,9 @@
 //
 //   NameConverter converter;
 //   Disassembler d(converter);
-//   for (byte* pc = begin; pc < end;) {
+//   for (uint8_t* pc = begin; pc < end;) {
 //     v8::base::EmbeddedVector<char, 256> buffer;
-//     byte* prev_pc = pc;
+//     uint8_t* prev_pc = pc;
 //     pc += d.InstructionDecode(buffer, pc);
 //     printf("%p    %08x      %s\n",
 //            prev_pc, *reinterpret_cast<int32_t*>(prev_pc), buffer);
@@ -59,7 +59,7 @@ class Decoder {
 
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
-  int InstructionDecode(byte* instruction);
+  int InstructionDecode(uint8_t* instruction);
 
   // Prefixed instructions.
   enum PrefixType { not_prefixed, is_prefixed };
@@ -356,13 +356,13 @@ int Decoder::FormatOption(Instruction* instr, const char* format) {
         int off = ((instr->Bits(25, 2)) << 8) >> 6;
         out_buffer_pos_ += base::SNPrintF(
             out_buffer_ + out_buffer_pos_, "%+d -> %s", off,
-            converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + off));
+            converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + off));
         return 8;
       } else if ((format[6] == '1') && (format[7] == '6')) {
         int off = ((instr->Bits(15, 2)) << 18) >> 16;
         out_buffer_pos_ += base::SNPrintF(
             out_buffer_ + out_buffer_pos_, "%+d -> %s", off,
-            converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + off));
+            converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + off));
         return 8;
       }
       break;
@@ -1535,13 +1535,13 @@ void Decoder::DecodeExt6(Instruction* instr) {
     }
   }
   switch (EXT6 | (instr->BitField(10, 3))) {
-#define DECODE_XX3_VECTOR_INSTRUCTIONS(name, opcode_name, opcode_value) \
-  case opcode_name: {                                                   \
-    Format(instr, #name " 'Xt, 'Xa, 'Xb");                              \
-    return;                                                             \
+#define DECODE_XX3_VECTOR_B_FORM_INSTRUCTIONS(name, opcode_name, opcode_value) \
+  case opcode_name: {                                                          \
+    Format(instr, #name " 'Xt, 'Xa, 'Xb");                                     \
+    return;                                                                    \
   }
-    PPC_XX3_OPCODE_VECTOR_LIST(DECODE_XX3_VECTOR_INSTRUCTIONS)
-#undef DECODE_XX3_VECTOR_INSTRUCTIONS
+    PPC_XX3_OPCODE_VECTOR_B_FORM_LIST(DECODE_XX3_VECTOR_B_FORM_INSTRUCTIONS)
+#undef DECODE_XX3_VECTOR_B_FORM_INSTRUCTIONS
 #define DECODE_XX3_SCALAR_INSTRUCTIONS(name, opcode_name, opcode_value) \
   case opcode_name: {                                                   \
     Format(instr, #name " 'Dt, 'Da, 'Db");                              \
@@ -1582,7 +1582,7 @@ void Decoder::DecodeExt6(Instruction* instr) {
 #undef VERIFY
 
 // Disassemble the instruction at *instr_ptr into the output buffer.
-int Decoder::InstructionDecode(byte* instr_ptr) {
+int Decoder::InstructionDecode(uint8_t* instr_ptr) {
   Instruction* instr = Instruction::At(instr_ptr);
 
   uint32_t opcode = instr->OpcodeValue() << 26;
@@ -1936,12 +1936,12 @@ int Decoder::InstructionDecode(byte* instr_ptr) {
 
 namespace disasm {
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -1957,7 +1957,7 @@ const char* NameConverter::NameOfXMMRegister(int reg) const {
   UNREACHABLE();  // PPC does not have any XMM registers
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // The default name converter is called for unknown code. So we will not try
   // to access any memory.
   return "";
@@ -1966,22 +1966,22 @@ const char* NameConverter::NameInCode(byte* addr) const {
 //------------------------------------------------------------------------------
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instruction) {
+                                    uint8_t* instruction) {
   v8::internal::Decoder d(converter_, buffer);
   return d.InstructionDecode(instruction);
 }
 
 // The PPC assembler does not currently use constant pools.
-int Disassembler::ConstantPoolSizeAt(byte* instruction) { return -1; }
+int Disassembler::ConstantPoolSizeAt(uint8_t* instruction) { return -1; }
 
-void Disassembler::Disassemble(FILE* f, byte* begin, byte* end,
+void Disassembler::Disassemble(FILE* f, uint8_t* begin, uint8_t* end,
                                UnimplementedOpcodeAction unimplemented_action) {
   NameConverter converter;
   Disassembler d(converter, unimplemented_action);
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     v8::base::EmbeddedVector<char, 128> buffer;
     buffer[0] = '\0';
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     pc += d.InstructionDecode(buffer, pc);
     v8::internal::PrintF(f, "%p    %08x      %s\n", static_cast<void*>(prev_pc),
                          *reinterpret_cast<int32_t*>(prev_pc), buffer.begin());
diff --git a/deps/v8/src/diagnostics/riscv/disasm-riscv.cc b/deps/v8/src/diagnostics/riscv/disasm-riscv.cc
index 57931af574b071..99c155e21f6f00 100644
--- a/deps/v8/src/diagnostics/riscv/disasm-riscv.cc
+++ b/deps/v8/src/diagnostics/riscv/disasm-riscv.cc
@@ -10,9 +10,9 @@
 //
 //   NameConverter converter;
 //   Disassembler d(converter);
-//   for (byte* pc = begin; pc < end;) {
+//   for (uint8_t* pc = begin; pc < end;) {
 //     v8::base::EmbeddedVector<char, 256> buffer;
-//     byte* prev_pc = pc;
+//     uint8_t* prev_pc = pc;
 //     pc += d.InstructionDecode(buffer, pc);
 //     printf("%p    %08x      %s\n",
 //            prev_pc, *reinterpret_cast<int32_t*>(prev_pc), buffer);
@@ -56,7 +56,7 @@ class Decoder {
 
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
-  int InstructionDecode(byte* instruction);
+  int InstructionDecode(uint8_t* instruction);
 
  private:
   // Bottleneck functions to print into the out_buffer.
@@ -264,7 +264,7 @@ void Decoder::PrintTarget(Instruction* instr) {
       int32_t imm = Assembler::BrachlongOffset((instr - 4)->InstructionBits(),
                                                instr->InstructionBits());
       const char* target =
-          converter_.NameOfAddress(reinterpret_cast<byte*>(instr - 4) + imm);
+          converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr - 4) + imm);
       out_buffer_pos_ +=
           base::SNPrintF(out_buffer_ + out_buffer_pos_, " -> %s", target);
       return;
@@ -275,7 +275,7 @@ void Decoder::PrintTarget(Instruction* instr) {
 void Decoder::PrintBranchOffset(Instruction* instr) {
   int32_t imm = instr->BranchOffset();
   const char* target =
-      converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + imm);
+      converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + imm);
   out_buffer_pos_ +=
       base::SNPrintF(out_buffer_ + out_buffer_pos_, "%d -> %s", imm, target);
 }
@@ -313,7 +313,7 @@ void Decoder::PrintImm20U(Instruction* instr) {
 void Decoder::PrintImm20J(Instruction* instr) {
   int32_t imm = instr->Imm20JValue();
   const char* target =
-      converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + imm);
+      converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + imm);
   out_buffer_pos_ +=
       base::SNPrintF(out_buffer_ + out_buffer_pos_, "%d -> %s", imm, target);
 }
@@ -2114,7 +2114,7 @@ void Decoder::DecodeRvvIVI(Instruction* instr) {
       Format(instr, "vslidedown.vi 'vd, 'vs2, 'uimm5'vm");
       break;
     case RO_V_VSLIDEUP_VI:
-      Format(instr, "vslideup.vi   'vd, 'vs2, 'uimm5'vm");
+      Format(instr, "vslideup.vi 'vd, 'vs2, 'uimm5'vm");
       break;
     case RO_V_VSRL_VI:
       Format(instr, "vsrl.vi   'vd, 'vs2, 'uimm5'vm");
@@ -2169,7 +2169,10 @@ void Decoder::DecodeRvvIVX(Instruction* instr) {
       Format(instr, "vssub.vx  'vd, 'vs2, 'rs1'vm");
       break;
     case RO_V_VRSUB_VX:
-      Format(instr, "vrsub.vx  'vd, 'vs2, 'rs1'vm");
+      if (instr->Rs1Value() == zero_reg.code())
+        Format(instr, "vneg.vv   'vd, 'vs2'vm");
+      else
+        Format(instr, "vrsub.vx  'vd, 'vs2, 'rs1'vm");
       break;
     case RO_V_VMIN_VX:
       Format(instr, "vmin.vx   'vd, 'vs2, 'rs1'vm");
@@ -2229,6 +2232,9 @@ void Decoder::DecodeRvvIVX(Instruction* instr) {
     case RO_V_VSLIDEDOWN_VX:
       Format(instr, "vslidedown.vx 'vd, 'vs2, 'rs1'vm");
       break;
+    case RO_V_VSLIDEUP_VX:
+      Format(instr, "vslideup.vx 'vd, 'vs2, 'rs1'vm");
+      break;
     case RO_V_VADC_VX:
       if (!instr->RvvVM()) {
         Format(instr, "vadc.vxm  'vd, 'vs2, 'rs1");
@@ -2386,6 +2392,12 @@ void Decoder::DecodeRvvMVX(Instruction* instr) {
     case RO_V_VWADD_VX:
       Format(instr, "vwadd.vx 'vd, 'vs2, 'rs1'vm");
       break;
+    case RO_V_VSLIDE1DOWN_VX:
+      Format(instr, "vslide1down.vx 'vd, 'vs2, 'rs1'vm");
+      break;
+    case RO_V_VSLIDE1UP_VX:
+      Format(instr, "vslide1up.vx 'vd, 'vs2, 'rs1'vm");
+      break;
     default:
       UNSUPPORTED_RISCV();
   }
@@ -2480,7 +2492,7 @@ void Decoder::DecodeRvvFVV(Instruction* instr) {
       break;
     case RO_V_VFSGNJN_VV:
       if (instr->Vs1Value() == instr->Vs2Value()) {
-        Format(instr, "vneg.vv   'vd, 'vs1'vm");
+        Format(instr, "vfneg.vv  'vd, 'vs1'vm");
       } else {
         Format(instr, "vfsgnjn.vv   'vd, 'vs2, 'vs1'vm");
       }
@@ -2547,10 +2559,10 @@ void Decoder::DecodeRvvFVV(Instruction* instr) {
     case RO_V_VFWSUB_W_VV:
       Format(instr, "vfwsub.wv 'vd, 'vs2, 'vs1'vm");
       break;
-    case RO_V_VFWREDUSUM_VV:
+    case RO_V_VFWREDUSUM_VS:
       Format(instr, "vfwredusum.vs 'vd, 'vs2, 'vs1'vm");
       break;
-    case RO_V_VFWREDOSUM_VV:
+    case RO_V_VFWREDOSUM_VS:
       Format(instr, "vfwredosum.vs 'vd, 'vs2, 'vs1'vm");
       break;
     case RO_V_VFWMUL_VV:
@@ -2586,7 +2598,11 @@ void Decoder::DecodeRvvFVF(Instruction* instr) {
       Format(instr, "vfsgnjn.vf   'vd, 'vs2, 'fs1'vm");
       break;
     case RO_V_VFMV_VF:
-      Format(instr, "vfmv.v.f  'vd, 'fs1");
+      if (instr->RvvVM()) {
+        Format(instr, "vfmv.v.f  'vd, 'fs1");
+      } else {
+        Format(instr, "vfmerge.vfm 'vd, 'vs2, 'fs1, v0");
+      }
       break;
     case RO_V_VFMADD_VF:
       Format(instr, "vfmadd.vf 'vd, 'fs1, 'vs2'vm");
@@ -2642,6 +2658,19 @@ void Decoder::DecodeRvvFVF(Instruction* instr) {
     case RO_V_VFADD_VF:
       Format(instr, "vfadd.vf 'vd, 'vs2, 'fs1'vm");
       break;
+    case RO_V_VFMV_SF:
+      if (instr->Vs2Value() == 0x0) {
+        Format(instr, "vfmv.s.f   'vd, 'fs1");
+      } else {
+        UNSUPPORTED_RISCV();
+      }
+      break;
+    case RO_V_VFSLIDE1DOWN_VF:
+      Format(instr, "vfslide1down.vf 'vd, 'vs2, 'fs1'vm");
+      break;
+    case RO_V_VFSLIDE1UP_VF:
+      Format(instr, "vfslide1up.vf 'vd, 'vs2, 'fs1'vm");
+      break;
     default:
       UNSUPPORTED_RISCV();
   }
@@ -2722,21 +2751,21 @@ void Decoder::DecodeRvvVL(Instruction* instr) {
   //      (kRvvMopMask | kRvvNfMask | kBaseOpcodeMask)) {
   if (RO_V_VL == instr_temp) {
     if (!(instr->InstructionBits() & (kRvvRs2Mask))) {
-      snprintf(str, sizeof(str), "vle%d.v       'vd, ('rs1)'vm",
+      snprintf(str, sizeof(str), "vle%d.v    'vd, ('rs1)'vm",
                instr->vl_vs_width());
       Format(instr, str);
     } else {
-      snprintf(str, sizeof(str), "vle%dff.v       'vd, ('rs1)'vm",
+      snprintf(str, sizeof(str), "vle%dff.v  'vd, ('rs1)'vm",
                instr->vl_vs_width());
       Format(instr, str);
     }
   } else if (RO_V_VLS == instr_temp) {
-    snprintf(str, sizeof(str), "vlse%d.v       'vd, ('rs1), 'rs2'vm",
+    snprintf(str, sizeof(str), "vlse%d.v   'vd, ('rs1), 'rs2'vm",
              instr->vl_vs_width());
     Format(instr, str);
 
   } else if (RO_V_VLX == instr_temp) {
-    snprintf(str, sizeof(str), "vlxei%d.v       'vd, ('rs1), 'vs2'vm",
+    snprintf(str, sizeof(str), "vlxei%d.v  'vd, ('rs1), 'vs2'vm",
              instr->vl_vs_width());
     Format(instr, str);
   } else if (RO_V_VLSEG2 == instr_temp || RO_V_VLSEG3 == instr_temp ||
@@ -2744,10 +2773,10 @@ void Decoder::DecodeRvvVL(Instruction* instr) {
              RO_V_VLSEG6 == instr_temp || RO_V_VLSEG7 == instr_temp ||
              RO_V_VLSEG8 == instr_temp) {
     if (!(instr->InstructionBits() & (kRvvRs2Mask))) {
-      snprintf(str, sizeof(str), "vlseg%de%d.v       'vd, ('rs1)'vm",
+      snprintf(str, sizeof(str), "vlseg%de%d.v  'vd, ('rs1)'vm",
                switch_nf(instr), instr->vl_vs_width());
     } else {
-      snprintf(str, sizeof(str), "vlseg%de%dff.v       'vd, ('rs1)'vm",
+      snprintf(str, sizeof(str), "vlseg%de%dff.v  'vd, ('rs1)'vm",
                switch_nf(instr), instr->vl_vs_width());
     }
     Format(instr, str);
@@ -2755,14 +2784,14 @@ void Decoder::DecodeRvvVL(Instruction* instr) {
              RO_V_VLSSEG4 == instr_temp || RO_V_VLSSEG5 == instr_temp ||
              RO_V_VLSSEG6 == instr_temp || RO_V_VLSSEG7 == instr_temp ||
              RO_V_VLSSEG8 == instr_temp) {
-    snprintf(str, sizeof(str), "vlsseg%de%d.v       'vd, ('rs1), 'rs2'vm",
+    snprintf(str, sizeof(str), "vlsseg%de%d.v  'vd, ('rs1), 'rs2'vm",
              switch_nf(instr), instr->vl_vs_width());
     Format(instr, str);
   } else if (RO_V_VLXSEG2 == instr_temp || RO_V_VLXSEG3 == instr_temp ||
              RO_V_VLXSEG4 == instr_temp || RO_V_VLXSEG5 == instr_temp ||
              RO_V_VLXSEG6 == instr_temp || RO_V_VLXSEG7 == instr_temp ||
              RO_V_VLXSEG8 == instr_temp) {
-    snprintf(str, sizeof(str), "vlxseg%dei%d.v       'vd, ('rs1), 'vs2'vm",
+    snprintf(str, sizeof(str), "vlxseg%dei%d.v  'vd, ('rs1), 'vs2'vm",
              switch_nf(instr), instr->vl_vs_width());
     Format(instr, str);
   }
@@ -2853,7 +2882,7 @@ void Decoder::DecodeRvvVS(Instruction* instr) {
 // All instructions are one word long, except for the simulator
 // pseudo-instruction stop(msg). For that one special case, we return
 // size larger than one kInstrSize.
-int Decoder::InstructionDecode(byte* instr_ptr) {
+int Decoder::InstructionDecode(uint8_t* instr_ptr) {
   Instruction* instr = Instruction::At(instr_ptr);
   // Print raw instruction bytes.
   out_buffer_pos_ += base::SNPrintF(out_buffer_ + out_buffer_pos_,
@@ -2914,7 +2943,7 @@ int Decoder::InstructionDecode(byte* instr_ptr) {
 #endif
     default:
       Format(instr, "UNSUPPORTED");
-      UNSUPPORTED_RISCV();
+      break;
   }
   return instr->InstructionSize();
 }
@@ -2926,12 +2955,12 @@ int Decoder::InstructionDecode(byte* instr_ptr) {
 
 namespace disasm {
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -2948,7 +2977,7 @@ const char* NameConverter::NameOfByteCPURegister(int reg) const {
   // return "nobytereg";
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // The default name converter is called for unknown code. So we will not try
   // to access any memory.
   return "";
@@ -2957,24 +2986,24 @@ const char* NameConverter::NameInCode(byte* addr) const {
 //------------------------------------------------------------------------------
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instruction) {
+                                    uint8_t* instruction) {
   v8::internal::Decoder d(converter_, buffer);
   return d.InstructionDecode(instruction);
 }
 
-int Disassembler::ConstantPoolSizeAt(byte* instruction) {
+int Disassembler::ConstantPoolSizeAt(uint8_t* instruction) {
   return v8::internal::Assembler::ConstantPoolSizeAt(
       reinterpret_cast<v8::internal::Instruction*>(instruction));
 }
 
-void Disassembler::Disassemble(FILE* f, byte* begin, byte* end,
+void Disassembler::Disassemble(FILE* f, uint8_t* begin, uint8_t* end,
                                UnimplementedOpcodeAction unimplemented_action) {
   NameConverter converter;
   Disassembler d(converter, unimplemented_action);
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     v8::base::EmbeddedVector<char, 128> buffer;
     buffer[0] = '\0';
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     pc += d.InstructionDecode(buffer, pc);
     v8::internal::PrintF(f, "%p    %08x      %s\n", static_cast<void*>(prev_pc),
                          *reinterpret_cast<uint32_t*>(prev_pc), buffer.begin());
diff --git a/deps/v8/src/diagnostics/s390/disasm-s390.cc b/deps/v8/src/diagnostics/s390/disasm-s390.cc
index 97f0113d3b65b0..8cfe0397146c69 100644
--- a/deps/v8/src/diagnostics/s390/disasm-s390.cc
+++ b/deps/v8/src/diagnostics/s390/disasm-s390.cc
@@ -10,9 +10,9 @@
 //
 //   NameConverter converter;
 //   Disassembler d(converter);
-//   for (byte* pc = begin; pc < end;) {
+//   for (uint8_t* pc = begin; pc < end;) {
 //     v8::base::EmbeddedVector<char, 256> buffer;
-//     byte* prev_pc = pc;
+//     uint8_t* prev_pc = pc;
 //     pc += d.InstructionDecode(buffer, pc);
 //     printf("%p    %08x      %s\n",
 //            prev_pc, *reinterpret_cast<int32_t*>(prev_pc), buffer);
@@ -59,7 +59,7 @@ class Decoder {
 
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
-  int InstructionDecode(byte* instruction);
+  int InstructionDecode(uint8_t* instruction);
 
  private:
   // Bottleneck functions to print into the out_buffer.
@@ -281,13 +281,13 @@ int Decoder::FormatOption(Instruction* instr, const char* format) {
         int off = ((instr->Bits(25, 2)) << 8) >> 6;
         out_buffer_pos_ += base::SNPrintF(
             out_buffer_ + out_buffer_pos_, "%+d -> %s", off,
-            converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + off));
+            converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + off));
         return 8;
       } else if ((format[6] == '1') && (format[7] == '6')) {
         int off = ((instr->Bits(15, 2)) << 18) >> 16;
         out_buffer_pos_ += base::SNPrintF(
             out_buffer_ + out_buffer_pos_, "%+d -> %s", off,
-            converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + off));
+            converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + off));
         return 8;
       }
       break;
@@ -411,7 +411,7 @@ int Decoder::FormatImmediate(Instruction* instr, const char* format) {
 
     out_buffer_pos_ += base::SNPrintF(
         out_buffer_ + out_buffer_pos_, "%d -> %s", value,
-        converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + value));
+        converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + value));
     return 2;
   } else if (format[1] == '5') {  // immediate in 16-31, but outputs as offset
     RILInstruction* rilinstr = reinterpret_cast<RILInstruction*>(instr);
@@ -423,7 +423,7 @@ int Decoder::FormatImmediate(Instruction* instr, const char* format) {
 
     out_buffer_pos_ += base::SNPrintF(
         out_buffer_ + out_buffer_pos_, "%d -> %s", value,
-        converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + value));
+        converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + value));
     return 2;
   } else if (format[1] == '6') {  // unsigned immediate in 16-31
     RIInstruction* riinstr = reinterpret_cast<RIInstruction*>(instr);
@@ -483,7 +483,7 @@ int Decoder::FormatImmediate(Instruction* instr, const char* format) {
 
     out_buffer_pos_ += base::SNPrintF(
         out_buffer_ + out_buffer_pos_, "%d -> %s", value,
-        converter_.NameOfAddress(reinterpret_cast<byte*>(instr) + value));
+        converter_.NameOfAddress(reinterpret_cast<uint8_t*>(instr) + value));
     return 2;
   }
 
@@ -1009,7 +1009,7 @@ bool Decoder::DecodeGeneric(Instruction* instr) {
 }
 
 // Disassemble the instruction at *instr_ptr into the output buffer.
-int Decoder::InstructionDecode(byte* instr_ptr) {
+int Decoder::InstructionDecode(uint8_t* instr_ptr) {
   Instruction* instr = Instruction::At(instr_ptr);
   int instrLength = instr->InstructionLength();
 
@@ -1041,12 +1041,12 @@ int Decoder::InstructionDecode(byte* instr_ptr) {
 
 namespace disasm {
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -1064,7 +1064,7 @@ const char* NameConverter::NameOfXMMRegister(int reg) const {
   UNREACHABLE();
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // The default name converter is called for unknown code. So we will not try
   // to access any memory.
   return "";
@@ -1073,22 +1073,22 @@ const char* NameConverter::NameInCode(byte* addr) const {
 //------------------------------------------------------------------------------
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instruction) {
+                                    uint8_t* instruction) {
   v8::internal::Decoder d(converter_, buffer);
   return d.InstructionDecode(instruction);
 }
 
 // The S390 assembler does not currently use constant pools.
-int Disassembler::ConstantPoolSizeAt(byte* instruction) { return -1; }
+int Disassembler::ConstantPoolSizeAt(uint8_t* instruction) { return -1; }
 
-void Disassembler::Disassemble(FILE* f, byte* begin, byte* end,
+void Disassembler::Disassemble(FILE* f, uint8_t* begin, uint8_t* end,
                                UnimplementedOpcodeAction unimplemented_action) {
   NameConverter converter;
   Disassembler d(converter, unimplemented_action);
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     v8::base::EmbeddedVector<char, 128> buffer;
     buffer[0] = '\0';
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     pc += d.InstructionDecode(buffer, pc);
     v8::internal::PrintF(f, "%p    %08x      %s\n", static_cast<void*>(prev_pc),
                          *reinterpret_cast<int32_t*>(prev_pc), buffer.begin());
diff --git a/deps/v8/src/diagnostics/unwinder.cc b/deps/v8/src/diagnostics/unwinder.cc
index 00a5e7dbe68cd0..ab524e8826fc7c 100644
--- a/deps/v8/src/diagnostics/unwinder.cc
+++ b/deps/v8/src/diagnostics/unwinder.cc
@@ -22,10 +22,10 @@ i::Address Load(i::Address address) {
 
 namespace {
 
-const i::byte* CalculateEnd(const void* start, size_t length_in_bytes) {
+const uint8_t* CalculateEnd(const void* start, size_t length_in_bytes) {
   // Given that the length of the memory range is in bytes and it is not
-  // necessarily aligned, we need to do the pointer arithmetic in byte* here.
-  const i::byte* start_as_byte = reinterpret_cast<const i::byte*>(start);
+  // necessarily aligned, we need to do the pointer arithmetic in uint8_t* here.
+  const uint8_t* start_as_byte = reinterpret_cast<const uint8_t*>(start);
   return start_as_byte + length_in_bytes;
 }
 
diff --git a/deps/v8/src/diagnostics/x64/disasm-x64.cc b/deps/v8/src/diagnostics/x64/disasm-x64.cc
index 69a315d494e32c..10bca12ce4dd8c 100644
--- a/deps/v8/src/diagnostics/x64/disasm-x64.cc
+++ b/deps/v8/src/diagnostics/x64/disasm-x64.cc
@@ -153,15 +153,15 @@ struct InstructionDesc {
 class InstructionTable {
  public:
   InstructionTable();
-  const InstructionDesc& Get(byte x) const { return instructions_[x]; }
+  const InstructionDesc& Get(uint8_t x) const { return instructions_[x]; }
 
  private:
   InstructionDesc instructions_[256];
   void Clear();
   void Init();
   void CopyTable(const ByteMnemonic bm[], InstructionType type);
-  void SetTableRange(InstructionType type, byte start, byte end, bool byte_size,
-                     const char* mnem);
+  void SetTableRange(InstructionType type, uint8_t start, uint8_t end,
+                     bool byte_size, const char* mnem);
   void AddJumpConditionalShort();
 };
 
@@ -204,9 +204,10 @@ void InstructionTable::CopyTable(const ByteMnemonic bm[],
   }
 }
 
-void InstructionTable::SetTableRange(InstructionType type, byte start, byte end,
-                                     bool byte_size, const char* mnem) {
-  for (byte b = start; b <= end; b++) {
+void InstructionTable::SetTableRange(InstructionType type, uint8_t start,
+                                     uint8_t end, bool byte_size,
+                                     const char* mnem) {
+  for (uint8_t b = start; b <= end; b++) {
     InstructionDesc* id = &instructions_[b];
     DCHECK_EQ(NO_INSTR, id->type);  // Information not already entered
     id->mnem = mnem;
@@ -216,7 +217,7 @@ void InstructionTable::SetTableRange(InstructionType type, byte start, byte end,
 }
 
 void InstructionTable::AddJumpConditionalShort() {
-  for (byte b = 0x70; b <= 0x7F; b++) {
+  for (uint8_t b = 0x70; b <= 0x7F; b++) {
     InstructionDesc* id = &instructions_[b];
     DCHECK_EQ(NO_INSTR, id->type);  // Information not already entered
     id->mnem = nullptr;             // Computed depending on condition code.
@@ -311,7 +312,7 @@ class DisassemblerX64 {
 
   // Writes one disassembled instruction into 'buffer' (0-terminated).
   // Returns the length of the disassembled machine instruction in bytes.
-  int InstructionDecode(v8::base::Vector<char> buffer, byte* instruction);
+  int InstructionDecode(v8::base::Vector<char> buffer, uint8_t* instruction);
 
  private:
   enum OperandSize {
@@ -325,20 +326,20 @@ class DisassemblerX64 {
   v8::base::EmbeddedVector<char, 128> tmp_buffer_;
   unsigned int tmp_buffer_pos_;
   bool abort_on_unimplemented_;
-  // Prefixes parsed
-  byte rex_;
-  byte operand_size_;    // 0x66 or (if no group 3 prefix is present) 0x0.
-  byte group_1_prefix_;  // 0xF2, 0xF3, or (if no group 1 prefix is present) 0.
-  byte segment_prefix_;  // 0x64 or (if no group 2 prefix is present) 0.
-  byte address_size_prefix_;  // 0x67 or (if no group 4 prefix is present) 0.
-  byte vex_byte0_;            // 0xC4 or 0xC5
-  byte vex_byte1_;
-  byte vex_byte2_;  // only for 3 bytes vex prefix
+  // Prefixes parsed.
+  uint8_t rex_;
+  uint8_t operand_size_;         // 0x66 or (without group 3 prefix) 0x0.
+  uint8_t group_1_prefix_;       // 0xF2, 0xF3, or (without group 1 prefix) 0.
+  uint8_t segment_prefix_;       // 0x64 or (without group 2 prefix) 0.
+  uint8_t address_size_prefix_;  // 0x67 or (without group 4 prefix) 0.
+  uint8_t vex_byte0_;            // 0xC4 or 0xC5.
+  uint8_t vex_byte1_;
+  uint8_t vex_byte2_;  // only for 3 bytes vex prefix.
   // Byte size operand override.
   bool byte_size_operand_;
   const InstructionTable* const instruction_table_;
 
-  void setRex(byte rex) {
+  void setRex(uint8_t rex) {
     DCHECK_EQ(0x40, rex & 0xF0);
     rex_ = rex;
   }
@@ -363,37 +364,37 @@ class DisassemblerX64 {
 
   bool vex_128() {
     DCHECK(vex_byte0_ == VEX3_PREFIX || vex_byte0_ == VEX2_PREFIX);
-    byte checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
     return (checked & 4) == 0;
   }
 
   bool vex_256() const {
     DCHECK(vex_byte0_ == VEX3_PREFIX || vex_byte0_ == VEX2_PREFIX);
-    byte checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
     return (checked & 4) != 0;
   }
 
   bool vex_none() {
     DCHECK(vex_byte0_ == VEX3_PREFIX || vex_byte0_ == VEX2_PREFIX);
-    byte checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
     return (checked & 3) == 0;
   }
 
   bool vex_66() {
     DCHECK(vex_byte0_ == VEX3_PREFIX || vex_byte0_ == VEX2_PREFIX);
-    byte checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
     return (checked & 3) == 1;
   }
 
   bool vex_f3() {
     DCHECK(vex_byte0_ == VEX3_PREFIX || vex_byte0_ == VEX2_PREFIX);
-    byte checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
     return (checked & 3) == 2;
   }
 
   bool vex_f2() {
     DCHECK(vex_byte0_ == VEX3_PREFIX || vex_byte0_ == VEX2_PREFIX);
-    byte checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
     return (checked & 3) == 3;
   }
 
@@ -414,7 +415,7 @@ class DisassemblerX64 {
 
   int vex_vreg() {
     DCHECK(vex_byte0_ == VEX3_PREFIX || vex_byte0_ == VEX2_PREFIX);
-    byte checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
+    uint8_t checked = vex_byte0_ == VEX3_PREFIX ? vex_byte2_ : vex_byte1_;
     return ~(checked >> 3) & 0xF;
   }
 
@@ -449,18 +450,18 @@ class DisassemblerX64 {
     }
   }
 
-  const char* NameOfAddress(byte* addr) const {
+  const char* NameOfAddress(uint8_t* addr) const {
     return converter_.NameOfAddress(addr);
   }
 
   // Disassembler helper functions.
-  void get_modrm(byte data, int* mod, int* regop, int* rm) {
+  void get_modrm(uint8_t data, int* mod, int* regop, int* rm) {
     *mod = (data >> 6) & 3;
     *regop = ((data & 0x38) >> 3) | (rex_r() ? 8 : 0);
     *rm = (data & 7) | (rex_b() ? 8 : 0);
   }
 
-  void get_sib(byte data, int* scale, int* index, int* base) {
+  void get_sib(uint8_t data, int* scale, int* index, int* base) {
     *scale = (data >> 6) & 3;
     *index = ((data >> 3) & 7) | (rex_x() ? 8 : 0);
     *base = (data & 7) | (rex_b() ? 8 : 0);
@@ -469,27 +470,27 @@ class DisassemblerX64 {
   using RegisterNameMapping = const char* (DisassemblerX64::*)(int reg) const;
 
   void TryAppendRootRelativeName(int offset);
-  int PrintRightOperandHelper(byte* modrmp, RegisterNameMapping register_name);
-  int PrintRightOperand(byte* modrmp);
-  int PrintRightByteOperand(byte* modrmp);
-  int PrintRightXMMOperand(byte* modrmp);
-  int PrintRightAVXOperand(byte* modrmp);
-  int PrintOperands(const char* mnem, OperandType op_order, byte* data);
-  int PrintImmediate(byte* data, OperandSize size);
-  int PrintImmediateOp(byte* data);
-  const char* TwoByteMnemonic(byte opcode);
-  int TwoByteOpcodeInstruction(byte* data);
-  int ThreeByteOpcodeInstruction(byte* data);
-  int F6F7Instruction(byte* data);
-  int ShiftInstruction(byte* data);
-  int JumpShort(byte* data);
-  int JumpConditional(byte* data);
-  int JumpConditionalShort(byte* data);
-  int SetCC(byte* data);
-  int FPUInstruction(byte* data);
-  int MemoryFPUInstruction(int escape_opcode, int regop, byte* modrm_start);
-  int RegisterFPUInstruction(int escape_opcode, byte modrm_byte);
-  int AVXInstruction(byte* data);
+  int PrintRightOperandHelper(uint8_t* modrmp, RegisterNameMapping);
+  int PrintRightOperand(uint8_t* modrmp);
+  int PrintRightByteOperand(uint8_t* modrmp);
+  int PrintRightXMMOperand(uint8_t* modrmp);
+  int PrintRightAVXOperand(uint8_t* modrmp);
+  int PrintOperands(const char* mnem, OperandType op_order, uint8_t* data);
+  int PrintImmediate(uint8_t* data, OperandSize size);
+  int PrintImmediateOp(uint8_t* data);
+  const char* TwoByteMnemonic(uint8_t opcode);
+  int TwoByteOpcodeInstruction(uint8_t* data);
+  int ThreeByteOpcodeInstruction(uint8_t* data);
+  int F6F7Instruction(uint8_t* data);
+  int ShiftInstruction(uint8_t* data);
+  int JumpShort(uint8_t* data);
+  int JumpConditional(uint8_t* data);
+  int JumpConditionalShort(uint8_t* data);
+  int SetCC(uint8_t* data);
+  int FPUInstruction(uint8_t* data);
+  int MemoryFPUInstruction(int escape_opcode, int regop, uint8_t* modrm_start);
+  int RegisterFPUInstruction(int escape_opcode, uint8_t modrm_byte);
+  int AVXInstruction(uint8_t* data);
   PRINTF_FORMAT(2, 3) void AppendToBuffer(const char* format, ...);
 
   void UnimplementedInstruction() {
@@ -516,7 +517,7 @@ void DisassemblerX64::TryAppendRootRelativeName(int offset) {
 }
 
 int DisassemblerX64::PrintRightOperandHelper(
-    byte* modrmp, RegisterNameMapping direct_register_name) {
+    uint8_t* modrmp, RegisterNameMapping direct_register_name) {
   int mod, regop, rm;
   get_modrm(*modrmp, &mod, &regop, &rm);
   RegisterNameMapping register_name =
@@ -528,7 +529,7 @@ int DisassemblerX64::PrintRightOperandHelper(
         return 5;
       } else if ((rm & 7) == 4) {
         // Codes for SIB byte.
-        byte sib = *(modrmp + 1);
+        uint8_t sib = *(modrmp + 1);
         int scale, index, base;
         get_sib(sib, &scale, &index, &base);
         if (index == 4 && (base & 7) == 4 && scale == 0 /*times_1*/) {
@@ -558,7 +559,7 @@ int DisassemblerX64::PrintRightOperandHelper(
     case 1:  // fall through
     case 2:
       if ((rm & 7) == 4) {
-        byte sib = *(modrmp + 1);
+        uint8_t sib = *(modrmp + 1);
         int scale, index, base;
         get_sib(sib, &scale, &index, &base);
         int disp = (mod == 2) ? Imm32(modrmp + 2) : Imm8(modrmp + 2);
@@ -592,7 +593,7 @@ int DisassemblerX64::PrintRightOperandHelper(
   UNREACHABLE();
 }
 
-int DisassemblerX64::PrintImmediate(byte* data, OperandSize size) {
+int DisassemblerX64::PrintImmediate(uint8_t* data, OperandSize size) {
   int64_t value;
   int count;
   switch (size) {
@@ -619,28 +620,28 @@ int DisassemblerX64::PrintImmediate(byte* data, OperandSize size) {
   return count;
 }
 
-int DisassemblerX64::PrintRightOperand(byte* modrmp) {
+int DisassemblerX64::PrintRightOperand(uint8_t* modrmp) {
   return PrintRightOperandHelper(modrmp, &DisassemblerX64::NameOfCPURegister);
 }
 
-int DisassemblerX64::PrintRightByteOperand(byte* modrmp) {
+int DisassemblerX64::PrintRightByteOperand(uint8_t* modrmp) {
   return PrintRightOperandHelper(modrmp,
                                  &DisassemblerX64::NameOfByteCPURegister);
 }
 
-int DisassemblerX64::PrintRightXMMOperand(byte* modrmp) {
+int DisassemblerX64::PrintRightXMMOperand(uint8_t* modrmp) {
   return PrintRightOperandHelper(modrmp, &DisassemblerX64::NameOfXMMRegister);
 }
 
-int DisassemblerX64::PrintRightAVXOperand(byte* modrmp) {
+int DisassemblerX64::PrintRightAVXOperand(uint8_t* modrmp) {
   return PrintRightOperandHelper(modrmp, &DisassemblerX64::NameOfAVXRegister);
 }
 
 // Returns number of bytes used including the current *data.
 // Writes instruction's mnemonic, left and right operands to 'tmp_buffer_'.
 int DisassemblerX64::PrintOperands(const char* mnem, OperandType op_order,
-                                   byte* data) {
-  byte modrm = *data;
+                                   uint8_t* data) {
+  uint8_t modrm = *data;
   int mod, regop, rm;
   get_modrm(modrm, &mod, &regop, &rm);
   int advance = 0;
@@ -690,9 +691,10 @@ int DisassemblerX64::PrintOperands(const char* mnem, OperandType op_order,
 
 // Returns number of bytes used by machine instruction, including *data byte.
 // Writes immediate instructions to 'tmp_buffer_'.
-int DisassemblerX64::PrintImmediateOp(byte* data) {
-  bool byte_size_immediate = (*data & 0x02) != 0;
-  byte modrm = *(data + 1);
+int DisassemblerX64::PrintImmediateOp(uint8_t* data) {
+  DCHECK(*data == 0x80 || *data == 0x81 || *data == 0x83);
+  bool byte_size_immediate = *data != 0x81;
+  uint8_t modrm = *(data + 1);
   int mod, regop, rm;
   get_modrm(modrm, &mod, &regop, &rm);
   const char* mnem = "Imm???";
@@ -725,7 +727,8 @@ int DisassemblerX64::PrintImmediateOp(byte* data) {
       UnimplementedInstruction();
   }
   AppendToBuffer("%s%c ", mnem, operand_size_code());
-  int count = PrintRightOperand(data + 1);
+  int count = byte_size_operand_ ? PrintRightByteOperand(data + 1)
+                                 : PrintRightOperand(data + 1);
   AppendToBuffer(",0x");
   OperandSize immediate_size =
       byte_size_immediate ? OPERAND_BYTE_SIZE : operand_size();
@@ -734,9 +737,9 @@ int DisassemblerX64::PrintImmediateOp(byte* data) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerX64::F6F7Instruction(byte* data) {
+int DisassemblerX64::F6F7Instruction(uint8_t* data) {
   DCHECK(*data == 0xF7 || *data == 0xF6);
-  byte modrm = *(data + 1);
+  uint8_t modrm = *(data + 1);
   int mod, regop, rm;
   get_modrm(modrm, &mod, &regop, &rm);
   if (regop != 0) {
@@ -788,8 +791,8 @@ int DisassemblerX64::F6F7Instruction(byte* data) {
   }
 }
 
-int DisassemblerX64::ShiftInstruction(byte* data) {
-  byte op = *data & (~1);
+int DisassemblerX64::ShiftInstruction(uint8_t* data) {
+  uint8_t op = *data & (~1);
   int count = 1;
   if (op != 0xD0 && op != 0xD2 && op != 0xC0) {
     UnimplementedInstruction();
@@ -797,7 +800,7 @@ int DisassemblerX64::ShiftInstruction(byte* data) {
   }
   // Print mneumonic.
   {
-    byte modrm = *(data + count);
+    uint8_t modrm = *(data + count);
     int mod, regop, rm;
     get_modrm(modrm, &mod, &regop, &rm);
     regop &= 0x7;  // The REX.R bit does not affect the operation.
@@ -849,38 +852,38 @@ int DisassemblerX64::ShiftInstruction(byte* data) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerX64::JumpShort(byte* data) {
+int DisassemblerX64::JumpShort(uint8_t* data) {
   DCHECK_EQ(0xEB, *data);
-  byte b = *(data + 1);
-  byte* dest = data + static_cast<int8_t>(b) + 2;
+  uint8_t b = *(data + 1);
+  uint8_t* dest = data + static_cast<int8_t>(b) + 2;
   AppendToBuffer("jmp %s", NameOfAddress(dest));
   return 2;
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerX64::JumpConditional(byte* data) {
+int DisassemblerX64::JumpConditional(uint8_t* data) {
   DCHECK_EQ(0x0F, *data);
-  byte cond = *(data + 1) & 0x0F;
-  byte* dest = data + Imm32(data + 2) + 6;
+  uint8_t cond = *(data + 1) & 0x0F;
+  uint8_t* dest = data + Imm32(data + 2) + 6;
   const char* mnem = conditional_code_suffix[cond];
   AppendToBuffer("j%s %s", mnem, NameOfAddress(dest));
   return 6;  // includes 0x0F
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerX64::JumpConditionalShort(byte* data) {
-  byte cond = *data & 0x0F;
-  byte b = *(data + 1);
-  byte* dest = data + static_cast<int8_t>(b) + 2;
+int DisassemblerX64::JumpConditionalShort(uint8_t* data) {
+  uint8_t cond = *data & 0x0F;
+  uint8_t b = *(data + 1);
+  uint8_t* dest = data + static_cast<int8_t>(b) + 2;
   const char* mnem = conditional_code_suffix[cond];
   AppendToBuffer("j%s %s", mnem, NameOfAddress(dest));
   return 2;
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerX64::SetCC(byte* data) {
+int DisassemblerX64::SetCC(uint8_t* data) {
   DCHECK_EQ(0x0F, *data);
-  byte cond = *(data + 1) & 0x0F;
+  uint8_t cond = *(data + 1) & 0x0F;
   const char* mnem = conditional_code_suffix[cond];
   AppendToBuffer("set%s%c ", mnem, operand_size_code());
   PrintRightByteOperand(data + 2);
@@ -889,9 +892,9 @@ int DisassemblerX64::SetCC(byte* data) {
 
 const char* sf_str[4] = {"", "rl", "ra", "ll"};
 
-int DisassemblerX64::AVXInstruction(byte* data) {
-  byte opcode = *data;
-  byte* current = data + 1;
+int DisassemblerX64::AVXInstruction(uint8_t* data) {
+  uint8_t opcode = *data;
+  uint8_t* current = data + 1;
   if (vex_66() && vex_0f38()) {
     int mod, regop, rm, vvvv = vex_vreg();
     get_modrm(*current, &mod, &regop, &rm);
@@ -900,6 +903,10 @@ int DisassemblerX64::AVXInstruction(byte* data) {
         AppendToBuffer("vbroadcastss %s,", NameOfAVXRegister(regop));
         current += PrintRightXMMOperand(current);
         break;
+      case 0x19:
+        AppendToBuffer("vbroadcastsd %s,", NameOfAVXRegister(regop));
+        current += PrintRightXMMOperand(current);
+        break;
       case 0xF7:
         AppendToBuffer("shlx%c %s,", operand_size_code(),
                        NameOfCPURegister(regop));
@@ -973,6 +980,17 @@ int DisassemblerX64::AVXInstruction(byte* data) {
     int mod, regop, rm, vvvv = vex_vreg();
     get_modrm(*current, &mod, &regop, &rm);
     switch (opcode) {
+      case 0x00:
+        AppendToBuffer("vpermq %s,", NameOfAVXRegister(regop));
+        current += PrintRightAVXOperand(current);
+        AppendToBuffer(",0x%x", *current++);
+        break;
+      case 0x06:
+        AppendToBuffer("vperm2f128 %s,%s,", NameOfAVXRegister(regop),
+                       NameOfAVXRegister(vvvv));
+        current += PrintRightAVXOperand(current);
+        AppendToBuffer(",0x%x", *current++);
+        break;
       case 0x08:
         AppendToBuffer("vroundps %s,", NameOfAVXRegister(regop));
         current += PrintRightAVXOperand(current);
@@ -1045,6 +1063,12 @@ int DisassemblerX64::AVXInstruction(byte* data) {
         current += PrintRightOperand(current);
         AppendToBuffer(",0x%x", *current++);
         break;
+      case 0x38:
+        AppendToBuffer("vinserti128 %s,%s,", NameOfAVXRegister(regop),
+                       NameOfAVXRegister(vvvv));
+        current += PrintRightXMMOperand(current);
+        AppendToBuffer(",0x%x", *current++);
+        break;
       case 0x4A: {
         AppendToBuffer("vblendvps %s,%s,", NameOfAVXRegister(regop),
                        NameOfAVXRegister(vvvv));
@@ -1567,10 +1591,10 @@ int DisassemblerX64::AVXInstruction(byte* data) {
 }
 
 // Returns number of bytes used, including *data.
-int DisassemblerX64::FPUInstruction(byte* data) {
-  byte escape_opcode = *data;
+int DisassemblerX64::FPUInstruction(uint8_t* data) {
+  uint8_t escape_opcode = *data;
   DCHECK_EQ(0xD8, escape_opcode & 0xF8);
-  byte modrm_byte = *(data + 1);
+  uint8_t modrm_byte = *(data + 1);
 
   if (modrm_byte >= 0xC0) {
     return RegisterFPUInstruction(escape_opcode, modrm_byte);
@@ -1580,7 +1604,7 @@ int DisassemblerX64::FPUInstruction(byte* data) {
 }
 
 int DisassemblerX64::MemoryFPUInstruction(int escape_opcode, int modrm_byte,
-                                          byte* modrm_start) {
+                                          uint8_t* modrm_start) {
   const char* mnem = "?";
   int regop = (modrm_byte >> 3) & 0x7;  // reg/op field of modrm byte.
   switch (escape_opcode) {
@@ -1654,7 +1678,7 @@ int DisassemblerX64::MemoryFPUInstruction(int escape_opcode, int modrm_byte,
 }
 
 int DisassemblerX64::RegisterFPUInstruction(int escape_opcode,
-                                            byte modrm_byte) {
+                                            uint8_t modrm_byte) {
   bool has_register = false;  // Is the FPU register encoded in modrm_byte?
   const char* mnem = "?";
 
@@ -1837,9 +1861,9 @@ int DisassemblerX64::RegisterFPUInstruction(int escape_opcode,
 
 // Handle all two-byte opcodes, which start with 0x0F.
 // These instructions may be affected by an 0x66, 0xF2, or 0xF3 prefix.
-int DisassemblerX64::TwoByteOpcodeInstruction(byte* data) {
-  byte opcode = *(data + 1);
-  byte* current = data + 2;
+int DisassemblerX64::TwoByteOpcodeInstruction(uint8_t* data) {
+  uint8_t opcode = *(data + 1);
+  uint8_t* current = data + 2;
   // At return, "current" points to the start of the next instruction.
   const char* mnemonic = TwoByteMnemonic(opcode);
   // Not every instruction will use this, but it doesn't hurt to figure it out
@@ -2173,13 +2197,13 @@ int DisassemblerX64::TwoByteOpcodeInstruction(byte* data) {
 // Handle all three-byte opcodes, which start with 0x0F38 or 0x0F3A.
 // These instructions may be affected by an 0x66, 0xF2, or 0xF3 prefix, but we
 // only have instructions prefixed with 0x66 for now.
-int DisassemblerX64::ThreeByteOpcodeInstruction(byte* data) {
+int DisassemblerX64::ThreeByteOpcodeInstruction(uint8_t* data) {
   DCHECK_EQ(0x0F, *data);
   // Only support 3-byte opcodes prefixed with 0x66 for now.
   DCHECK_EQ(0x66, operand_size_);
-  byte second_byte = *(data + 1);
-  byte third_byte = *(data + 2);
-  byte* current = data + 3;
+  uint8_t second_byte = *(data + 1);
+  uint8_t third_byte = *(data + 2);
+  uint8_t* current = data + 3;
   int mod, regop, rm;
   get_modrm(*current, &mod, &regop, &rm);
   if (second_byte == 0x38) {
@@ -2267,7 +2291,7 @@ int DisassemblerX64::ThreeByteOpcodeInstruction(byte* data) {
 // Mnemonics for two-byte opcode instructions starting with 0x0F.
 // The argument is the second byte of the two-byte opcode.
 // Returns nullptr if the instruction is not handled here.
-const char* DisassemblerX64::TwoByteMnemonic(byte opcode) {
+const char* DisassemblerX64::TwoByteMnemonic(uint8_t opcode) {
   if (opcode >= 0xC8 && opcode <= 0xCF) return "bswap";
   switch (opcode) {
     case 0x1F:
@@ -2328,12 +2352,12 @@ const char* DisassemblerX64::TwoByteMnemonic(byte opcode) {
 
 // Disassembles the instruction at instr, and writes it into out_buffer.
 int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
-                                       byte* instr) {
+                                       uint8_t* instr) {
   tmp_buffer_pos_ = 0;  // starting to write as position 0
-  byte* data = instr;
+  uint8_t* data = instr;
   bool processed = true;  // Will be set to false if the current instruction
                           // is not in 'instructions' table.
-  byte current;
+  uint8_t current;
 
   // Scan for prefixes.
   while (true) {
@@ -2419,18 +2443,18 @@ int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
         data++;
         break;
       case MOVE_REG_INSTR: {
-        byte* addr = nullptr;
+        uint8_t* addr = nullptr;
         switch (operand_size()) {
           case OPERAND_WORD_SIZE:
-            addr = reinterpret_cast<byte*>(Imm16(data + 1));
+            addr = reinterpret_cast<uint8_t*>(Imm16(data + 1));
             data += 3;
             break;
           case OPERAND_DOUBLEWORD_SIZE:
-            addr = reinterpret_cast<byte*>(Imm32_U(data + 1));
+            addr = reinterpret_cast<uint8_t*>(Imm32_U(data + 1));
             data += 5;
             break;
           case OPERAND_QUADWORD_SIZE:
-            addr = reinterpret_cast<byte*>(Imm64(data + 1));
+            addr = reinterpret_cast<uint8_t*>(Imm64(data + 1));
             data += 9;
             break;
           default:
@@ -2443,7 +2467,7 @@ int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
       }
 
       case CALL_JUMP_INSTR: {
-        byte* addr = data + Imm32(data + 1) + 5;
+        uint8_t* addr = data + Imm32(data + 1) + 5;
         AppendToBuffer("%s %s", idesc.mnem, NameOfAddress(addr));
         data += 5;
         break;
@@ -2494,6 +2518,9 @@ int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
         break;
       }
 
+      case 0x80:
+        byte_size_operand_ = true;
+        V8_FALLTHROUGH;
       case 0x81:  // fall through
       case 0x83:  // 0x81 with sign extension bit set
         data += PrintImmediateOp(data);
@@ -2574,15 +2601,6 @@ int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
         }
       } break;
 
-      case 0x80: {
-        data++;
-        AppendToBuffer("cmpb ");
-        data += PrintRightByteOperand(data);
-        int32_t imm = *data;
-        AppendToBuffer(",0x%x", imm);
-        data++;
-      } break;
-
       case 0x88:  // 8bit, fall through
       case 0x89:  // 32bit
       {
@@ -2637,7 +2655,7 @@ int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
       case 0xBE:
       case 0xBF: {
         // mov reg8,imm8 or mov reg32,imm32
-        byte opcode = *data;
+        uint8_t opcode = *data;
         data++;
         bool is_32bit = (opcode >= 0xB8);
         int reg = (opcode & 0x7) | (rex_b() ? 8 : 0);
@@ -2678,7 +2696,7 @@ int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
         switch (operand_size()) {
           case OPERAND_DOUBLEWORD_SIZE: {
             const char* memory_location =
-                NameOfAddress(reinterpret_cast<byte*>(Imm32(data + 1)));
+                NameOfAddress(reinterpret_cast<uint8_t*>(Imm32(data + 1)));
             if (*data == 0xA1) {  // Opcode 0xA1
               AppendToBuffer("movzxlq rax,(%s)", memory_location);
             } else {  // Opcode 0xA3
@@ -2690,7 +2708,7 @@ int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
           case OPERAND_QUADWORD_SIZE: {
             // New x64 instruction mov rax,(imm_64).
             const char* memory_location =
-                NameOfAddress(reinterpret_cast<byte*>(Imm64(data + 1)));
+                NameOfAddress(reinterpret_cast<uint8_t*>(Imm64(data + 1)));
             if (*data == 0xA1) {  // Opcode 0xA1
               AppendToBuffer("movq rax,(%s)", memory_location);
             } else {  // Opcode 0xA3
@@ -2784,7 +2802,7 @@ int DisassemblerX64::InstructionDecode(v8::base::Vector<char> out_buffer,
 
   int outp = 0;
   // Instruction bytes.
-  for (byte* bp = instr; bp < data; bp++) {
+  for (uint8_t* bp = instr; bp < data; bp++) {
     outp += v8::base::SNPrintF(out_buffer + outp, "%02x", *bp);
   }
   // Indent instruction, leaving space for 10 bytes, i.e. 20 characters in hex.
@@ -2815,12 +2833,12 @@ static const char* const ymm_regs[16] = {
     "ymm0", "ymm1", "ymm2",  "ymm3",  "ymm4",  "ymm5",  "ymm6",  "ymm7",
     "ymm8", "ymm9", "ymm10", "ymm11", "ymm12", "ymm13", "ymm14", "ymm15"};
 
-const char* NameConverter::NameOfAddress(byte* addr) const {
+const char* NameConverter::NameOfAddress(uint8_t* addr) const {
   v8::base::SNPrintF(tmp_buffer_, "%p", static_cast<void*>(addr));
   return tmp_buffer_.begin();
 }
 
-const char* NameConverter::NameOfConstant(byte* addr) const {
+const char* NameConverter::NameOfConstant(uint8_t* addr) const {
   return NameOfAddress(addr);
 }
 
@@ -2844,7 +2862,7 @@ const char* NameOfYMMRegister(int reg) {
   return "noymmreg";
 }
 
-const char* NameConverter::NameInCode(byte* addr) const {
+const char* NameConverter::NameInCode(uint8_t* addr) const {
   // X64 does not embed debug strings at the moment.
   UNREACHABLE();
 }
@@ -2852,27 +2870,27 @@ const char* NameConverter::NameInCode(byte* addr) const {
 //------------------------------------------------------------------------------
 
 int Disassembler::InstructionDecode(v8::base::Vector<char> buffer,
-                                    byte* instruction) {
+                                    uint8_t* instruction) {
   DisassemblerX64 d(converter_, unimplemented_opcode_action());
   return d.InstructionDecode(buffer, instruction);
 }
 
 // The X64 assembler does not use constant pools.
-int Disassembler::ConstantPoolSizeAt(byte* instruction) { return -1; }
+int Disassembler::ConstantPoolSizeAt(uint8_t* instruction) { return -1; }
 
-void Disassembler::Disassemble(FILE* f, byte* begin, byte* end,
+void Disassembler::Disassemble(FILE* f, uint8_t* begin, uint8_t* end,
                                UnimplementedOpcodeAction unimplemented_action) {
   NameConverter converter;
   Disassembler d(converter, unimplemented_action);
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     v8::base::EmbeddedVector<char, 128> buffer;
     buffer[0] = '\0';
-    byte* prev_pc = pc;
+    uint8_t* prev_pc = pc;
     pc += d.InstructionDecode(buffer, pc);
     fprintf(f, "%p", static_cast<void*>(prev_pc));
     fprintf(f, "    ");
 
-    for (byte* bp = prev_pc; bp < pc; bp++) {
+    for (uint8_t* bp = prev_pc; bp < pc; bp++) {
       fprintf(f, "%02x", *bp);
     }
     for (int i = 6 - static_cast<int>(pc - prev_pc); i >= 0; i--) {
diff --git a/deps/v8/src/execution/OWNERS b/deps/v8/src/execution/OWNERS
index 6adcb7afc828ad..0e1bd476eebe18 100644
--- a/deps/v8/src/execution/OWNERS
+++ b/deps/v8/src/execution/OWNERS
@@ -2,6 +2,7 @@ bmeurer@chromium.org
 ishell@chromium.org
 jgruber@chromium.org
 jkummerow@chromium.org
+leszeks@chromium.org
 verwaest@chromium.org
 victorgomes@chromium.org
 
diff --git a/deps/v8/src/execution/arguments-inl.h b/deps/v8/src/execution/arguments-inl.h
index 6fdd91ae6a9c82..4caeb93bf6519d 100644
--- a/deps/v8/src/execution/arguments-inl.h
+++ b/deps/v8/src/execution/arguments-inl.h
@@ -17,7 +17,7 @@ namespace internal {
 template <ArgumentsType T>
 Arguments<T>::ChangeValueScope::ChangeValueScope(Isolate* isolate,
                                                  Arguments* args, int index,
-                                                 Object value)
+                                                 Tagged<Object> value)
     : location_(args->address_of_arg_at(index)) {
   old_value_ = handle(Object(*location_), isolate);
   *location_ = value.ptr();
@@ -25,9 +25,9 @@ Arguments<T>::ChangeValueScope::ChangeValueScope(Isolate* isolate,
 
 template <ArgumentsType T>
 int Arguments<T>::smi_value_at(int index) const {
-  Object obj = (*this)[index];
+  Tagged<Object> obj = (*this)[index];
   int value = Smi::ToInt(obj);
-  DCHECK_IMPLIES(obj.IsTaggedIndex(), value == tagged_index_value_at(index));
+  DCHECK_IMPLIES(IsTaggedIndex(obj), value == tagged_index_value_at(index));
   return value;
 }
 
@@ -45,7 +45,7 @@ int Arguments<T>::tagged_index_value_at(int index) const {
 
 template <ArgumentsType T>
 double Arguments<T>::number_value_at(int index) const {
-  return (*this)[index].Number();
+  return Object::Number((*this)[index]);
 }
 
 template <ArgumentsType T>
diff --git a/deps/v8/src/execution/arguments.h b/deps/v8/src/execution/arguments.h
index 441fc83221d0cc..248d0fd3ba5141 100644
--- a/deps/v8/src/execution/arguments.h
+++ b/deps/v8/src/execution/arguments.h
@@ -38,8 +38,8 @@ class Arguments {
   class ChangeValueScope {
    public:
     inline ChangeValueScope(Isolate* isolate, Arguments* args, int index,
-                            Object value);
-    ~ChangeValueScope() { *location_ = old_value_->ptr(); }
+                            Tagged<Object> value);
+    ~ChangeValueScope() { *location_ = (*old_value_).ptr(); }
 
    private:
     Address* location_;
@@ -51,13 +51,15 @@ class Arguments {
     DCHECK_GE(length_, 0);
   }
 
-  V8_INLINE Object operator[](int index) const {
+  V8_INLINE Tagged<Object> operator[](int index) const {
     return Object(*address_of_arg_at(index));
   }
 
   template <class S = Object>
   V8_INLINE Handle<S> at(int index) const;
 
+  V8_INLINE FullObjectSlot slot_from_address_at(int index, int offset) const;
+
   V8_INLINE int smi_value_at(int index) const;
   V8_INLINE uint32_t positive_smi_value_at(int index) const;
 
@@ -92,6 +94,12 @@ Handle<S> Arguments<T>::at(int index) const {
   return Handle<S>::cast(obj);
 }
 
+template <ArgumentsType T>
+FullObjectSlot Arguments<T>::slot_from_address_at(int index, int offset) const {
+  Address* location = *reinterpret_cast<Address**>(address_of_arg_at(index));
+  return FullObjectSlot(location + offset);
+}
+
 #ifdef DEBUG
 #define CLOBBER_DOUBLE_REGISTERS() ClobberDoubleRegisters(1, 2, 3, 4);
 #else
@@ -122,18 +130,18 @@ Handle<S> Arguments<T>::at(int index) const {
 
 #endif  // V8_RUNTIME_CALL_STATS
 
-#define RUNTIME_FUNCTION_RETURNS_TYPE(Type, InternalType, Convert, Name)    \
-  static V8_INLINE InternalType __RT_impl_##Name(RuntimeArguments args,     \
-                                                 Isolate* isolate);         \
-  RUNTIME_ENTRY_WITH_RCS(Type, InternalType, Convert, Name)                 \
-  Type Name(int args_length, Address* args_object, Isolate* isolate) {      \
-    DCHECK(isolate->context().is_null() || isolate->context().IsContext()); \
-    CLOBBER_DOUBLE_REGISTERS();                                             \
-    TEST_AND_CALL_RCS(Name)                                                 \
-    RuntimeArguments args(args_length, args_object);                        \
-    return Convert(__RT_impl_##Name(args, isolate));                        \
-  }                                                                         \
-                                                                            \
+#define RUNTIME_FUNCTION_RETURNS_TYPE(Type, InternalType, Convert, Name)   \
+  static V8_INLINE InternalType __RT_impl_##Name(RuntimeArguments args,    \
+                                                 Isolate* isolate);        \
+  RUNTIME_ENTRY_WITH_RCS(Type, InternalType, Convert, Name)                \
+  Type Name(int args_length, Address* args_object, Isolate* isolate) {     \
+    DCHECK(isolate->context().is_null() || IsContext(isolate->context())); \
+    CLOBBER_DOUBLE_REGISTERS();                                            \
+    TEST_AND_CALL_RCS(Name)                                                \
+    RuntimeArguments args(args_length, args_object);                       \
+    return Convert(__RT_impl_##Name(args, isolate));                       \
+  }                                                                        \
+                                                                           \
   static InternalType __RT_impl_##Name(RuntimeArguments args, Isolate* isolate)
 
 #ifdef DEBUG
diff --git a/deps/v8/src/execution/arm/simulator-arm.cc b/deps/v8/src/execution/arm/simulator-arm.cc
index 1c67a84a0a261e..4a3bdc8b9cc83f 100644
--- a/deps/v8/src/execution/arm/simulator-arm.cc
+++ b/deps/v8/src/execution/arm/simulator-arm.cc
@@ -159,7 +159,8 @@ namespace {
 // (simulator) builds.
 void SetInstructionBitsInCodeSpace(Instruction* instr, Instr value,
                                    Heap* heap) {
-  CodeSpaceMemoryModificationScope scope(heap);
+  CodePageMemoryModificationScope scope(
+      MemoryChunk::FromAddress(reinterpret_cast<Address>(instr)));
   instr->SetInstructionBits(value);
 }
 }  // namespace
@@ -202,7 +203,8 @@ void ArmDebugger::Debug() {
       disasm::Disassembler dasm(converter);
       // use a reasonably large buffer
       v8::base::EmbeddedVector<char, 256> buffer;
-      dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(sim_->get_pc()));
+      dasm.InstructionDecode(buffer,
+                             reinterpret_cast<uint8_t*>(sim_->get_pc()));
       PrintF("  0x%08x  %s\n", sim_->get_pc(), buffer.begin());
       last_pc = sim_->get_pc();
     }
@@ -307,10 +309,10 @@ bool ArmDebugger::ExecDebugCommand(ArrayUniquePtr<char> line_ptr) {
       int32_t value;
       StdoutStream os;
       if (GetValue(arg1, &value)) {
-        Object obj(value);
+        Tagged<Object> obj(value);
         os << arg1 << ": \n";
 #ifdef DEBUG
-        obj.Print(os);
+        Print(obj, os);
         os << "\n";
 #else
         os << Brief(obj) << "\n";
@@ -353,16 +355,16 @@ bool ArmDebugger::ExecDebugCommand(ArrayUniquePtr<char> line_ptr) {
     while (cur < end) {
       PrintF("  0x%08" V8PRIxPTR ":  0x%08x %10d",
              reinterpret_cast<intptr_t>(cur), *cur, *cur);
-      Object obj(*cur);
+      Tagged<Object> obj(*cur);
       Heap* current_heap = sim_->isolate_->heap();
       if (!skip_obj_print) {
-        if (obj.IsSmi() ||
+        if (IsSmi(obj) ||
             IsValidHeapObject(current_heap, HeapObject::cast(obj))) {
           PrintF(" (");
-          if (obj.IsSmi()) {
+          if (IsSmi(obj)) {
             PrintF("smi %d", Smi::ToInt(obj));
           } else {
-            obj.ShortPrint();
+            ShortPrint(obj);
           }
           PrintF(")");
         }
@@ -376,12 +378,12 @@ bool ArmDebugger::ExecDebugCommand(ArrayUniquePtr<char> line_ptr) {
     // use a reasonably large buffer
     v8::base::EmbeddedVector<char, 256> buffer;
 
-    byte* prev = nullptr;
-    byte* cur = nullptr;
-    byte* end = nullptr;
+    uint8_t* prev = nullptr;
+    uint8_t* cur = nullptr;
+    uint8_t* end = nullptr;
 
     if (argc == 1) {
-      cur = reinterpret_cast<byte*>(sim_->get_pc());
+      cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
       end = cur + (10 * kInstrSize);
     } else if (argc == 2) {
       int regnum = Registers::Number(arg1);
@@ -389,7 +391,7 @@ bool ArmDebugger::ExecDebugCommand(ArrayUniquePtr<char> line_ptr) {
         // The argument is an address or a register name.
         int32_t value;
         if (GetValue(arg1, &value)) {
-          cur = reinterpret_cast<byte*>(value);
+          cur = reinterpret_cast<uint8_t*>(value);
           // Disassemble 10 instructions at <arg1>.
           end = cur + (10 * kInstrSize);
         }
@@ -397,7 +399,7 @@ bool ArmDebugger::ExecDebugCommand(ArrayUniquePtr<char> line_ptr) {
         // The argument is the number of instructions.
         int32_t value;
         if (GetValue(arg1, &value)) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
           // Disassemble <arg1> instructions.
           end = cur + (value * kInstrSize);
         }
@@ -406,7 +408,7 @@ bool ArmDebugger::ExecDebugCommand(ArrayUniquePtr<char> line_ptr) {
       int32_t value1;
       int32_t value2;
       if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-        cur = reinterpret_cast<byte*>(value1);
+        cur = reinterpret_cast<uint8_t*>(value1);
         end = cur + (value2 * kInstrSize);
       }
     }
@@ -681,8 +683,7 @@ void Simulator::CheckICache(base::CustomMatcherHashMap* i_cache,
 Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   // Set up simulator support first. Some of this information is needed to
   // setup the architecture state.
-  size_t stack_size = 1 * 1024 * 1024;  // allocate 1MB for stack
-  stack_ = reinterpret_cast<char*>(base::Malloc(stack_size));
+  stack_ = reinterpret_cast<uint8_t*>(base::Malloc(kAllocatedStackSize));
   pc_modified_ = false;
   icount_ = 0;
   break_pc_ = nullptr;
@@ -719,9 +720,8 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   inexact_vfp_flag_ = false;
 
   // The sp is initialized to point to the bottom (high address) of the
-  // allocated stack area. To be safe in potential stack underflows we leave
-  // some buffer below.
-  registers_[sp] = reinterpret_cast<int32_t>(stack_) + stack_size - 64;
+  // usable stack area.
+  registers_[sp] = reinterpret_cast<int32_t>(stack_) + kUsableStackSize;
   // The lr and pc are initialized to a known bad value that will cause an
   // access violation if the simulator ever tries to execute it.
   registers_[pc] = bad_lr;
@@ -1143,9 +1143,16 @@ uintptr_t Simulator::StackLimit(uintptr_t c_limit) const {
     return reinterpret_cast<uintptr_t>(get_sp());
   }
 
-  // Otherwise the limit is the JS stack. Leave a safety margin of 4 KiB
-  // to prevent overrunning the stack when pushing values.
-  return reinterpret_cast<uintptr_t>(stack_) + 4 * KB;
+  // Otherwise the limit is the JS stack. Leave a safety margin to prevent
+  // overrunning the stack when pushing values.
+  return reinterpret_cast<uintptr_t>(stack_) + kAdditionalStackMargin;
+}
+
+base::Vector<uint8_t> Simulator::GetCurrentStackView() const {
+  // We do not add an additional safety margin as above in
+  // Simulator::StackLimit, as this is currently only used in wasm::StackMemory,
+  // which adds its own margin.
+  return base::VectorOf(stack_, kUsableStackSize);
 }
 
 // Unsupported instructions use Format to print an error and stop execution.
@@ -1610,16 +1617,17 @@ using SimulatorRuntimeCompareCall = int64_t (*)(double darg0, double darg1);
 using SimulatorRuntimeFPFPCall = double (*)(double darg0, double darg1);
 using SimulatorRuntimeFPCall = double (*)(double darg0);
 using SimulatorRuntimeFPIntCall = double (*)(double darg0, int32_t arg0);
+// Define four args for future flexibility; at the time of this writing only
+// one is ever used.
+using SimulatorRuntimeFPTaggedCall = double (*)(int32_t arg0, int32_t arg1,
+                                                int32_t arg2, int32_t arg3);
 
 // This signature supports direct call in to API function native callback
 // (refer to InvocationCallback in v8.h).
 using SimulatorRuntimeDirectApiCall = void (*)(int32_t arg0);
-using SimulatorRuntimeProfilingApiCall = void (*)(int32_t arg0, void* arg1);
 
 // This signature supports direct call to accessor getter callback.
 using SimulatorRuntimeDirectGetterCall = void (*)(int32_t arg0, int32_t arg1);
-using SimulatorRuntimeProfilingGetterCall = void (*)(int32_t arg0, int32_t arg1,
-                                                     void* arg2);
 
 // Separate for fine-grained UBSan blocklisting. Casting any given C++
 // function to {SimulatorRuntimeCall} is undefined behavior; but since
@@ -1638,21 +1646,6 @@ int64_t UnsafeGenericFunctionCall(intptr_t function, int32_t arg0, int32_t arg1,
                 arg10, arg11, arg12, arg13, arg14, arg15, arg16, arg17, arg18,
                 arg19);
 }
-void UnsafeDirectApiCall(intptr_t function, int32_t arg0) {
-  SimulatorRuntimeDirectApiCall target =
-      reinterpret_cast<SimulatorRuntimeDirectApiCall>(function);
-  target(arg0);
-}
-void UnsafeProfilingApiCall(intptr_t function, int32_t arg0, int32_t arg1) {
-  SimulatorRuntimeProfilingApiCall target =
-      reinterpret_cast<SimulatorRuntimeProfilingApiCall>(function);
-  target(arg0, Redirection::UnwrapRedirection(arg1));
-}
-void UnsafeDirectGetterCall(intptr_t function, int32_t arg0, int32_t arg1) {
-  SimulatorRuntimeDirectGetterCall target =
-      reinterpret_cast<SimulatorRuntimeDirectGetterCall>(function);
-  target(arg0, arg1);
-}
 
 // Software interrupt instructions are used by the simulator to call into the
 // C-based V8 runtime.
@@ -1778,7 +1771,7 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           default:
             UNREACHABLE();
         }
-        if (v8_flags.trace_sim || !stack_aligned) {
+        if (v8_flags.trace_sim) {
           switch (redirection->type()) {
             case ExternalReference::BUILTIN_COMPARE_CALL:
               PrintF("Returned %08x\n", static_cast<int32_t>(iresult));
@@ -1792,7 +1785,8 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
               UNREACHABLE();
           }
         }
-      } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
+      } else if (redirection->type() ==
+                 ExternalReference::BUILTIN_FP_POINTER_CALL) {
         if (v8_flags.trace_sim || !stack_aligned) {
           PrintF("Call to host function at %p args %08x",
                  reinterpret_cast<void*>(external), arg0);
@@ -1802,25 +1796,35 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           PrintF("\n");
         }
         CHECK(stack_aligned);
-        UnsafeDirectApiCall(external, arg0);
+        SimulatorRuntimeFPTaggedCall target =
+            reinterpret_cast<SimulatorRuntimeFPTaggedCall>(external);
+        double dresult = target(arg0, arg1, arg2, arg3);
 #ifdef DEBUG
         TrashCallerSaveRegisters();
 #endif
-      } else if (redirection->type() == ExternalReference::PROFILING_API_CALL) {
+        SetFpResult(dresult);
+        if (v8_flags.trace_sim) {
+          PrintF("Returned %f\n", dresult);
+        }
+      } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
+        // void f(v8::FunctionCallbackInfo&)
         if (v8_flags.trace_sim || !stack_aligned) {
-          PrintF("Call to host function at %p args %08x %08x",
-                 reinterpret_cast<void*>(external), arg0, arg1);
+          PrintF("Call to host function at %p args %08x",
+                 reinterpret_cast<void*>(external), arg0);
           if (!stack_aligned) {
             PrintF(" with unaligned stack %08x\n", get_register(sp));
           }
           PrintF("\n");
         }
         CHECK(stack_aligned);
-        UnsafeProfilingApiCall(external, arg0, arg1);
+        SimulatorRuntimeDirectApiCall target =
+            reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
+        target(arg0);
 #ifdef DEBUG
         TrashCallerSaveRegisters();
 #endif
       } else if (redirection->type() == ExternalReference::DIRECT_GETTER_CALL) {
+        // void f(v8::Local<String> property, v8::PropertyCallbackInfo& info)
         if (v8_flags.trace_sim || !stack_aligned) {
           PrintF("Call to host function at %p args %08x %08x",
                  reinterpret_cast<void*>(external), arg0, arg1);
@@ -1830,24 +1834,9 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           PrintF("\n");
         }
         CHECK(stack_aligned);
-        UnsafeDirectGetterCall(external, arg0, arg1);
-#ifdef DEBUG
-        TrashCallerSaveRegisters();
-#endif
-      } else if (redirection->type() ==
-                 ExternalReference::PROFILING_GETTER_CALL) {
-        if (v8_flags.trace_sim || !stack_aligned) {
-          PrintF("Call to host function at %p args %08x %08x %08x",
-                 reinterpret_cast<void*>(external), arg0, arg1, arg2);
-          if (!stack_aligned) {
-            PrintF(" with unaligned stack %08x\n", get_register(sp));
-          }
-          PrintF("\n");
-        }
-        CHECK(stack_aligned);
-        SimulatorRuntimeProfilingGetterCall target =
-            reinterpret_cast<SimulatorRuntimeProfilingGetterCall>(external);
-        target(arg0, arg1, Redirection::UnwrapRedirection(arg2));
+        SimulatorRuntimeDirectGetterCall target =
+            reinterpret_cast<SimulatorRuntimeDirectGetterCall>(external);
+        target(arg0, arg1);
 #ifdef DEBUG
         TrashCallerSaveRegisters();
 #endif
@@ -2669,10 +2658,10 @@ void Simulator::DecodeType2(Instruction* instr) {
   }
   if (instr->HasB()) {
     if (instr->HasL()) {
-      byte val = ReadBU(addr);
+      uint8_t val = ReadBU(addr);
       set_register(rd, val);
     } else {
-      byte val = get_register(rd);
+      uint8_t val = get_register(rd);
       WriteB(addr, val);
     }
   } else {
@@ -4089,7 +4078,7 @@ uint16_t Multiply(uint16_t a, uint16_t b) {
 }
 
 void VmovImmediate(Simulator* simulator, Instruction* instr) {
-  byte cmode = instr->Bits(11, 8);
+  uint8_t cmode = instr->Bits(11, 8);
   int vd = instr->VFPDRegValue(kDoublePrecision);
   int q = instr->Bit(6);
   int regs = q ? 2 : 1;
@@ -6134,7 +6123,7 @@ void Simulator::InstructionDecode(Instruction* instr) {
     disasm::Disassembler dasm(converter);
     // use a reasonably large buffer
     v8::base::EmbeddedVector<char, 256> buffer;
-    dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(instr));
+    dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(instr));
     PrintF("  0x%08" V8PRIxPTR "  %s\n", reinterpret_cast<intptr_t>(instr),
            buffer.begin());
   }
@@ -6538,6 +6527,7 @@ void Simulator::GlobalMonitor::RemoveProcessor(Processor* processor) {
 //
 // The following functions are used by our gdb macros.
 //
+V8_DONT_STRIP_SYMBOL
 V8_EXPORT_PRIVATE extern bool _v8_internal_Simulator_ExecDebugCommand(
     const char* command) {
   i::Isolate* isolate = i::Isolate::Current();
diff --git a/deps/v8/src/execution/arm/simulator-arm.h b/deps/v8/src/execution/arm/simulator-arm.h
index 28cf72591cad5d..95a7e79383a0b1 100644
--- a/deps/v8/src/execution/arm/simulator-arm.h
+++ b/deps/v8/src/execution/arm/simulator-arm.h
@@ -232,8 +232,12 @@ class Simulator : public SimulatorBase {
 
   Address get_sp() const { return static_cast<Address>(get_register(sp)); }
 
-  // Accessor to the internal simulator stack area.
+  // Accessor to the internal simulator stack area. Adds a safety
+  // margin to prevent overflows (kAdditionalStackMargin).
   uintptr_t StackLimit(uintptr_t c_limit) const;
+  // Return current stack view, without additional safety margins.
+  // Users, for example wasm::StackMemory, can add their own.
+  base::Vector<uint8_t> GetCurrentStackView() const;
 
   // Executes ARM instructions until the PC reaches end_sim_pc.
   void Execute();
@@ -466,7 +470,14 @@ class Simulator : public SimulatorBase {
   bool inexact_vfp_flag_;
 
   // Simulator support.
-  char* stack_;
+  uint8_t* stack_;
+  static const size_t kAllocatedStackSize = 1 * MB;
+  // We leave a small buffer below the usable stack to protect against potential
+  // stack underflows.
+  static const int kStackMargin = 64;
+  // Added in Simulator::StackLimit()
+  static const int kAdditionalStackMargin = 4 * KB;
+  static const size_t kUsableStackSize = kAllocatedStackSize - kStackMargin;
   bool pc_modified_;
   int icount_;
 
diff --git a/deps/v8/src/execution/arm64/pointer-authentication-arm64.h b/deps/v8/src/execution/arm64/pointer-authentication-arm64.h
index 5f90c6e94baaa6..d98414833e99ff 100644
--- a/deps/v8/src/execution/arm64/pointer-authentication-arm64.h
+++ b/deps/v8/src/execution/arm64/pointer-authentication-arm64.h
@@ -30,11 +30,21 @@ V8_INLINE Address PointerAuthentication::AuthenticatePC(
       "  mov x17, %[pc]\n"
       "  mov x16, %[stack_ptr]\n"
       "  autib1716\n"
-      "  ldr xzr, [x17]\n"
       "  mov %[pc], x17\n"
+      // Save LR.
+      "  mov x16, x30\n"
+      // Check if authentication was successful, otherwise crash.
+      "  mov x30, x17\n"
+      "  xpaclri\n"
+      "  cmp x30, x17\n"
+      // Restore LR.
+      "  mov x30, x16\n"
+      "  b.eq 1f\n"
+      "  brk #0\n"
+      "1:\n"
       : [pc] "+r"(pc)
       : [stack_ptr] "r"(sp)
-      : "x16", "x17");
+      : "x16", "x17", "x30");
 #endif
   return pc;
 }
@@ -86,10 +96,20 @@ V8_INLINE void PointerAuthentication::ReplacePC(Address* pc_address,
       "  mov %[new_pc], x17\n"
       "  mov x17, %[old_pc]\n"
       "  autib1716\n"
-      "  ldr xzr, [x17]\n"
+      // Save LR.
+      "  mov x16, x30\n"
+      // Check if authentication was successful, otherwise crash.
+      "  mov x30, x17\n"
+      "  xpaclri\n"
+      "  cmp x30, x17\n"
+      // Restore LR.
+      "  mov x30, x16\n"
+      "  b.eq 1f\n"
+      "  brk #0\n"
+      "1:\n"
       : [new_pc] "+&r"(new_pc)
       : [sp] "r"(sp), [old_pc] "r"(old_pc)
-      : "x16", "x17");
+      : "x16", "x17", "x30");
 #endif
   *pc_address = new_pc;
 }
diff --git a/deps/v8/src/execution/arm64/simulator-arm64.cc b/deps/v8/src/execution/arm64/simulator-arm64.cc
index 548cd3017bcbc1..beba51defc519d 100644
--- a/deps/v8/src/execution/arm64/simulator-arm64.cc
+++ b/deps/v8/src/execution/arm64/simulator-arm64.cc
@@ -24,6 +24,7 @@
 #include "src/heap/combined-heap.h"
 #include "src/objects/objects-inl.h"
 #include "src/runtime/runtime-utils.h"
+#include "src/snapshot/embedded/embedded-data.h"
 #include "src/utils/ostreams.h"
 
 #if V8_OS_WIN
@@ -34,11 +35,6 @@
 #include "src/trap-handler/trap-handler-simulator.h"
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-#if defined(_MSC_VER)
-// define full memory barrier for msvc
-#define __sync_synchronize _ReadWriteBarrier
-#endif
-
 namespace v8 {
 namespace internal {
 
@@ -318,9 +314,17 @@ uintptr_t Simulator::StackLimit(uintptr_t c_limit) const {
     return get_sp();
   }
 
-  // Otherwise the limit is the JS stack. Leave a safety margin of 4 KiB
-  // to prevent overrunning the stack when pushing values.
-  return stack_limit_ + 4 * KB;
+  // Otherwise the limit is the JS stack. Leave a safety margin to prevent
+  // overrunning the stack when pushing values.
+  return stack_limit_ + kAdditionalStackMargin;
+}
+
+base::Vector<uint8_t> Simulator::GetCurrentStackView() const {
+  // We do not add an additional safety margin as above in
+  // Simulator::StackLimit, as users of this method are expected to add their
+  // own margin.
+  return base::VectorOf(reinterpret_cast<uint8_t*>(stack_limit_),
+                        UsableStackSize());
 }
 
 void Simulator::SetRedirectInstruction(Instruction* instruction) {
@@ -361,10 +365,11 @@ void Simulator::Init(FILE* stream) {
   ResetState();
 
   // Allocate and setup the simulator stack.
-  stack_size_ = (v8_flags.sim_stack_size * KB) + (2 * stack_protection_size_);
-  stack_ = reinterpret_cast<uintptr_t>(new byte[stack_size_]);
-  stack_limit_ = stack_ + stack_protection_size_;
-  uintptr_t tos = stack_ + stack_size_ - stack_protection_size_;
+  size_t stack_size = AllocatedStackSize();
+
+  stack_ = reinterpret_cast<uintptr_t>(new uint8_t[stack_size]);
+  stack_limit_ = stack_ + kStackProtectionSize;
+  uintptr_t tos = stack_ + stack_size - kStackProtectionSize;
   // The stack pointer must be 16-byte aligned.
   set_sp(tos & ~0xFULL);
 
@@ -403,7 +408,7 @@ void Simulator::ResetState() {
 
 Simulator::~Simulator() {
   GlobalMonitor::Get()->RemoveProcessor(&global_monitor_processor_);
-  delete[] reinterpret_cast<byte*>(stack_);
+  delete[] reinterpret_cast<uint8_t*>(stack_);
   delete disassembler_decoder_;
   delete print_disasm_;
   delete decoder_;
@@ -464,16 +469,17 @@ using SimulatorRuntimeCompareCall = int64_t (*)(double arg1, double arg2);
 using SimulatorRuntimeFPFPCall = double (*)(double arg1, double arg2);
 using SimulatorRuntimeFPCall = double (*)(double arg1);
 using SimulatorRuntimeFPIntCall = double (*)(double arg1, int32_t arg2);
+// Define four args for future flexibility; at the time of this writing only
+// one is ever used.
+using SimulatorRuntimeFPTaggedCall = double (*)(int64_t arg0, int64_t arg1,
+                                                int64_t arg2, int64_t arg3);
 
 // This signature supports direct call in to API function native callback
 // (refer to InvocationCallback in v8.h).
 using SimulatorRuntimeDirectApiCall = void (*)(int64_t arg0);
-using SimulatorRuntimeProfilingApiCall = void (*)(int64_t arg0, void* arg1);
 
 // This signature supports direct call to accessor getter callback.
 using SimulatorRuntimeDirectGetterCall = void (*)(int64_t arg0, int64_t arg1);
-using SimulatorRuntimeProfilingGetterCall = void (*)(int64_t arg0, int64_t arg1,
-                                                     void* arg2);
 
 // Separate for fine-grained UBSan blocklisting. Casting any given C++
 // function to {SimulatorRuntimeCall} is undefined behavior; but since
@@ -491,21 +497,6 @@ ObjectPair UnsafeGenericFunctionCall(
                 arg10, arg11, arg12, arg13, arg14, arg15, arg16, arg17, arg18,
                 arg19);
 }
-void UnsafeDirectApiCall(int64_t function, int64_t arg0) {
-  SimulatorRuntimeDirectApiCall target =
-      reinterpret_cast<SimulatorRuntimeDirectApiCall>(function);
-  target(arg0);
-}
-void UnsafeProfilingApiCall(int64_t function, int64_t arg0, void* arg1) {
-  SimulatorRuntimeProfilingApiCall target =
-      reinterpret_cast<SimulatorRuntimeProfilingApiCall>(function);
-  target(arg0, arg1);
-}
-void UnsafeDirectGetterCall(int64_t function, int64_t arg0, int64_t arg1) {
-  SimulatorRuntimeDirectGetterCall target =
-      reinterpret_cast<SimulatorRuntimeDirectGetterCall>(function);
-  target(arg0, arg1);
-}
 
 using MixedRuntimeCall_0 = AnyCType (*)();
 
@@ -789,18 +780,6 @@ void Simulator::DoRuntimeCall(Instruction* instr) {
       break;
     }
 
-    case ExternalReference::DIRECT_API_CALL: {
-      // void f(v8::FunctionCallbackInfo&)
-      TraceSim("Type: DIRECT_API_CALL\n");
-      TraceSim("Arguments: 0x%016" PRIx64 "\n", xreg(0));
-      UnsafeDirectApiCall(external, xreg(0));
-      TraceSim("No return value.");
-#ifdef DEBUG
-      CorruptAllCallerSavedCPURegisters();
-#endif
-      break;
-    }
-
     case ExternalReference::BUILTIN_COMPARE_CALL: {
       // int f(double, double)
       TraceSim("Type: BUILTIN_COMPARE_CALL\n");
@@ -861,25 +840,31 @@ void Simulator::DoRuntimeCall(Instruction* instr) {
       break;
     }
 
-    case ExternalReference::DIRECT_GETTER_CALL: {
-      // void f(Local<String> property, PropertyCallbackInfo& info)
-      TraceSim("Type: DIRECT_GETTER_CALL\n");
-      TraceSim("Arguments: 0x%016" PRIx64 ", 0x%016" PRIx64 "\n", xreg(0),
-               xreg(1));
-      UnsafeDirectGetterCall(external, xreg(0), xreg(1));
-      TraceSim("No return value.");
+    case ExternalReference::BUILTIN_FP_POINTER_CALL: {
+      // double f(Address tagged_ptr)
+      TraceSim("Type: BUILTIN_FP_POINTER_CALL\n");
+      SimulatorRuntimeFPTaggedCall target =
+          reinterpret_cast<SimulatorRuntimeFPTaggedCall>(external);
+      TraceSim(
+          "Arguments: "
+          "0x%016" PRIx64 ", 0x%016" PRIx64 ", 0x%016" PRIx64 ", 0x%016" PRIx64,
+          arg0, arg1, arg2, arg3);
+      double result = target(arg0, arg1, arg2, arg3);
+      TraceSim("Returned: %f\n", result);
 #ifdef DEBUG
       CorruptAllCallerSavedCPURegisters();
 #endif
+      set_dreg(0, result);
       break;
     }
 
-    case ExternalReference::PROFILING_API_CALL: {
-      // void f(v8::FunctionCallbackInfo&, v8::FunctionCallback)
-      TraceSim("Type: PROFILING_API_CALL\n");
-      void* arg1 = Redirection::UnwrapRedirection(xreg(1));
-      TraceSim("Arguments: 0x%016" PRIx64 ", %p\n", xreg(0), arg1);
-      UnsafeProfilingApiCall(external, xreg(0), arg1);
+    case ExternalReference::DIRECT_API_CALL: {
+      // void f(v8::FunctionCallbackInfo&)
+      TraceSim("Type: DIRECT_API_CALL\n");
+      TraceSim("Arguments: 0x%016" PRIx64 "\n", arg0);
+      SimulatorRuntimeDirectApiCall target =
+          reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
+      target(arg0);
       TraceSim("No return value.");
 #ifdef DEBUG
       CorruptAllCallerSavedCPURegisters();
@@ -887,16 +872,13 @@ void Simulator::DoRuntimeCall(Instruction* instr) {
       break;
     }
 
-    case ExternalReference::PROFILING_GETTER_CALL: {
-      // void f(Local<String> property, PropertyCallbackInfo& info,
-      //        AccessorNameGetterCallback callback)
-      TraceSim("Type: PROFILING_GETTER_CALL\n");
-      SimulatorRuntimeProfilingGetterCall target =
-          reinterpret_cast<SimulatorRuntimeProfilingGetterCall>(external);
-      void* arg2 = Redirection::UnwrapRedirection(xreg(2));
-      TraceSim("Arguments: 0x%016" PRIx64 ", 0x%016" PRIx64 ", %p\n", xreg(0),
-               xreg(1), arg2);
-      target(xreg(0), xreg(1), arg2);
+    case ExternalReference::DIRECT_GETTER_CALL: {
+      // void f(v8::Local<String> property, v8::PropertyCallbackInfo& info)
+      TraceSim("Type: DIRECT_GETTER_CALL\n");
+      TraceSim("Arguments: 0x%016" PRIx64 ", 0x%016" PRIx64 "\n", arg0, arg1);
+      SimulatorRuntimeDirectGetterCall target =
+          reinterpret_cast<SimulatorRuntimeDirectGetterCall>(external);
+      target(arg0, arg1);
       TraceSim("No return value.");
 #ifdef DEBUG
       CorruptAllCallerSavedCPURegisters();
@@ -2558,7 +2540,7 @@ void Simulator::CompareAndSwapHelper(const Instruction* instr) {
   T data = MemoryRead<T>(address);
   if (is_acquire) {
     // Approximate load-acquire by issuing a full barrier after the load.
-    __sync_synchronize();
+    std::atomic_thread_fence(std::memory_order_seq_cst);
   }
 
   if (data == comparevalue) {
@@ -2568,7 +2550,7 @@ void Simulator::CompareAndSwapHelper(const Instruction* instr) {
       local_monitor_.NotifyStore();
       GlobalMonitor::Get()->NotifyStore_Locked(&global_monitor_processor_);
       // Approximate store-release by issuing a full barrier before the store.
-      __sync_synchronize();
+      std::atomic_thread_fence(std::memory_order_seq_cst);
     }
 
     MemoryWrite<T>(address, newvalue);
@@ -2614,7 +2596,7 @@ void Simulator::CompareAndSwapPairHelper(const Instruction* instr) {
 
   if (is_acquire) {
     // Approximate load-acquire by issuing a full barrier after the load.
-    __sync_synchronize();
+    std::atomic_thread_fence(std::memory_order_seq_cst);
   }
 
   bool same =
@@ -2626,7 +2608,7 @@ void Simulator::CompareAndSwapPairHelper(const Instruction* instr) {
       local_monitor_.NotifyStore();
       GlobalMonitor::Get()->NotifyStore_Locked(&global_monitor_processor_);
       // Approximate store-release by issuing a full barrier before the store.
-      __sync_synchronize();
+      std::atomic_thread_fence(std::memory_order_seq_cst);
     }
 
     MemoryWrite<T>(address, newvalue_low);
@@ -2670,7 +2652,7 @@ void Simulator::AtomicMemorySimpleHelper(const Instruction* instr) {
 
   if (is_acquire) {
     // Approximate load-acquire by issuing a full barrier after the load.
-    __sync_synchronize();
+    std::atomic_thread_fence(std::memory_order_seq_cst);
   }
 
   T result = 0;
@@ -2707,7 +2689,7 @@ void Simulator::AtomicMemorySimpleHelper(const Instruction* instr) {
     local_monitor_.NotifyStore();
     GlobalMonitor::Get()->NotifyStore_Locked(&global_monitor_processor_);
     // Approximate store-release by issuing a full barrier before the store.
-    __sync_synchronize();
+    std::atomic_thread_fence(std::memory_order_seq_cst);
   }
 
   MemoryWrite<T>(address, result);
@@ -2738,7 +2720,7 @@ void Simulator::AtomicMemorySwapHelper(const Instruction* instr) {
   T data = MemoryRead<T>(address);
   if (is_acquire) {
     // Approximate load-acquire by issuing a full barrier after the load.
-    __sync_synchronize();
+    std::atomic_thread_fence(std::memory_order_seq_cst);
   }
 
   if (is_release) {
@@ -2746,7 +2728,7 @@ void Simulator::AtomicMemorySwapHelper(const Instruction* instr) {
     local_monitor_.NotifyStore();
     GlobalMonitor::Get()->NotifyStore_Locked(&global_monitor_processor_);
     // Approximate store-release by issuing a full barrier before the store.
-    __sync_synchronize();
+    std::atomic_thread_fence(std::memory_order_seq_cst);
   }
   MemoryWrite<T>(address, reg<T>(rs));
 
@@ -3743,11 +3725,7 @@ void Simulator::VisitSystem(Instruction* instr) {
         UNIMPLEMENTED();
     }
   } else if (instr->Mask(MemBarrierFMask) == MemBarrierFixed) {
-#if defined(V8_OS_WIN)
-    MemoryBarrier();
-#else
-    __sync_synchronize();
-#endif
+    std::atomic_thread_fence(std::memory_order_seq_cst);
   } else {
     UNIMPLEMENTED();
   }
@@ -3967,10 +3945,10 @@ bool Simulator::ExecDebugCommand(ArrayUniquePtr<char> line_ptr) {
       int64_t value;
       StdoutStream os;
       if (GetValue(arg1, &value)) {
-        Object obj(value);
+        Tagged<Object> obj(value);
         os << arg1 << ": \n";
 #ifdef DEBUG
-        obj.Print(os);
+        Print(obj, os);
         os << "\n";
 #else
         os << Brief(obj) << "\n";
@@ -4025,15 +4003,15 @@ bool Simulator::ExecDebugCommand(ArrayUniquePtr<char> line_ptr) {
       PrintF("  0x%016" PRIx64 ":  0x%016" PRIx64 " %10" PRId64,
              reinterpret_cast<uint64_t>(cur), *cur, *cur);
       if (!skip_obj_print) {
-        Object obj(*cur);
+        Tagged<Object> obj(*cur);
         Heap* current_heap = isolate_->heap();
-        if (obj.IsSmi() ||
+        if (IsSmi(obj) ||
             IsValidHeapObject(current_heap, HeapObject::cast(obj))) {
           PrintF(" (");
-          if (obj.IsSmi()) {
+          if (IsSmi(obj)) {
             PrintF("smi %" PRId32, Smi::ToInt(obj));
           } else {
-            obj.ShortPrint();
+            ShortPrint(obj);
           }
           PrintF(")");
         }
@@ -4192,6 +4170,13 @@ void Simulator::VisitException(Instruction* instr) {
             PrintF(stream_, "# %sDebugger hit %d.%s\n", clr_debug_number, code,
                    clr_normal);
           }
+          Builtin maybe_builtin = OffHeapInstructionStream::TryLookupCode(
+              Isolate::Current(), reinterpret_cast<Address>(pc_));
+          if (Builtins::IsBuiltinId(maybe_builtin)) {
+            char const* name = Builtins::name(maybe_builtin);
+            PrintF(stream_, "# %s                %sLOCATION: %s%s\n",
+                   clr_debug_number, clr_debug_message, name, clr_normal);
+          }
         }
 
         // Other options.
@@ -4242,7 +4227,8 @@ void Simulator::VisitException(Instruction* instr) {
         DoRuntimeCall(instr);
       } else if (instr->ImmException() == kImmExceptionIsPrintf) {
         DoPrintf(instr);
-
+      } else if (instr->ImmException() == kImmExceptionIsSwitchStackLimit) {
+        DoSwitchStackLimit(instr);
       } else if (instr->ImmException() == kImmExceptionIsUnreachable) {
         fprintf(stream_, "Hit UNREACHABLE marker at PC=%p.\n",
                 reinterpret_cast<void*>(pc_));
@@ -6395,6 +6381,11 @@ void Simulator::VisitNEONPerm(Instruction* instr) {
   }
 }
 
+void Simulator::DoSwitchStackLimit(Instruction* instr) {
+  const int64_t stack_limit = xreg(16);
+  stack_limit_ = static_cast<uintptr_t>(stack_limit);
+}
+
 void Simulator::DoPrintf(Instruction* instr) {
   DCHECK((instr->Mask(ExceptionMask) == HLT) &&
          (instr->ImmException() == kImmExceptionIsPrintf));
@@ -6719,6 +6710,7 @@ void Simulator::GlobalMonitor::RemoveProcessor(Processor* processor) {
 //
 // The following functions are used by our gdb macros.
 //
+V8_DONT_STRIP_SYMBOL
 V8_EXPORT_PRIVATE extern bool _v8_internal_Simulator_ExecDebugCommand(
     const char* command) {
   i::Isolate* isolate = i::Isolate::Current();
diff --git a/deps/v8/src/execution/arm64/simulator-arm64.h b/deps/v8/src/execution/arm64/simulator-arm64.h
index b3c5eda2a781f4..15f9584029e34a 100644
--- a/deps/v8/src/execution/arm64/simulator-arm64.h
+++ b/deps/v8/src/execution/arm64/simulator-arm64.h
@@ -629,6 +629,8 @@ class LogicVRegister {
     return *this;
   }
 
+  bool Is(const LogicVRegister& r) const { return &register_ == &r.register_; }
+
  private:
   SimVRegister& register_;
 
@@ -744,8 +746,12 @@ class Simulator : public DecoderVisitor, public SimulatorBase {
   // Pop an address from the JS stack.
   uintptr_t PopAddress();
 
-  // Accessor to the internal simulator stack area.
+  // Accessor to the internal simulator stack area. Adds a safety
+  // margin to prevent overflows (kAdditionalStackMargin).
   uintptr_t StackLimit(uintptr_t c_limit) const;
+  // Return current stack view, without additional safety margins.
+  // Users, for example wasm::StackMemory, can add their own.
+  base::Vector<uint8_t> GetCurrentStackView() const;
 
   V8_EXPORT_PRIVATE void ResetState();
 
@@ -2277,6 +2283,9 @@ class Simulator : public DecoderVisitor, public SimulatorBase {
   // Pseudo Printf instruction
   void DoPrintf(Instruction* instr);
 
+  // Pseudo instruction for switching stack limit
+  void DoSwitchStackLimit(Instruction* instr);
+
   // Processor state ---------------------------------------
 
   // Output stream.
@@ -2324,9 +2333,15 @@ class Simulator : public DecoderVisitor, public SimulatorBase {
 
   // Stack
   uintptr_t stack_;
-  static const size_t stack_protection_size_ = KB;
-  size_t stack_size_;
+  static const size_t kStackProtectionSize = KB;
+  // This includes a protection margin at each end of the stack area.
+  static size_t AllocatedStackSize() {
+    return (v8_flags.sim_stack_size * KB) + (2 * kStackProtectionSize);
+  }
+  static size_t UsableStackSize() { return v8_flags.sim_stack_size * KB; }
   uintptr_t stack_limit_;
+  // Added in Simulator::StackLimit()
+  static const int kAdditionalStackMargin = 4 * KB;
 
   Decoder<DispatchingDecoderVisitor>* decoder_;
   Decoder<DispatchingDecoderVisitor>* disassembler_decoder_;
diff --git a/deps/v8/src/execution/arm64/simulator-logic-arm64.cc b/deps/v8/src/execution/arm64/simulator-logic-arm64.cc
index 555625988c1a66..da7062fbada00e 100644
--- a/deps/v8/src/execution/arm64/simulator-logic-arm64.cc
+++ b/deps/v8/src/execution/arm64/simulator-logic-arm64.cc
@@ -586,32 +586,32 @@ LogicVRegister Simulator::cmp(VectorFormat vform, LogicVRegister dst,
                               const LogicVRegister& src2, Condition cond) {
   dst.ClearForWrite(vform);
   for (int i = 0; i < LaneCountFromFormat(vform); i++) {
+    bool result = false;
     int64_t sa = src1.Int(vform, i);
     int64_t sb = src2.Int(vform, i);
     uint64_t ua = src1.Uint(vform, i);
     uint64_t ub = src2.Uint(vform, i);
-    bool result = false;
     switch (cond) {
       case eq:
-        result = (ua == ub);
+        result = (src1.Is(src2) || ua == ub);
         break;
       case ge:
-        result = (sa >= sb);
+        result = (src1.Is(src2) || sa >= sb);
         break;
       case gt:
-        result = (sa > sb);
+        result = (!src1.Is(src2) && sa > sb);
         break;
       case hi:
-        result = (ua > ub);
+        result = (!src1.Is(src2) && ua > ub);
         break;
       case hs:
-        result = (ua >= ub);
+        result = (src1.Is(src2) || ua >= ub);
         break;
       case lt:
-        result = (sa < sb);
+        result = (!src1.Is(src2) && sa < sb);
         break;
       case le:
-        result = (sa <= sb);
+        result = (src1.Is(src2) || sa <= sb);
         break;
       default:
         UNREACHABLE();
@@ -1023,7 +1023,8 @@ LogicVRegister Simulator::eor(VectorFormat vform, LogicVRegister dst,
                               const LogicVRegister& src2) {
   dst.ClearForWrite(vform);
   for (int i = 0; i < LaneCountFromFormat(vform); i++) {
-    dst.SetUint(vform, i, src1.Uint(vform, i) ^ src2.Uint(vform, i));
+    dst.SetUint(vform, i,
+                src1.Is(src2) ? 0 : src1.Uint(vform, i) ^ src2.Uint(vform, i));
   }
   return dst;
 }
diff --git a/deps/v8/src/execution/execution.cc b/deps/v8/src/execution/execution.cc
index 00da2d38a71574..93077c26d66a9a 100644
--- a/deps/v8/src/execution/execution.cc
+++ b/deps/v8/src/execution/execution.cc
@@ -26,7 +26,7 @@ Handle<Object> NormalizeReceiver(Isolate* isolate, Handle<Object> receiver) {
   // Convert calls on global objects to be calls on the global
   // receiver instead to avoid having a 'this' pointer which refers
   // directly to a global object.
-  if (receiver->IsJSGlobalObject()) {
+  if (IsJSGlobalObject(*receiver)) {
     return handle(Handle<JSGlobalObject>::cast(receiver)->global_proxy(),
                   isolate);
   }
@@ -52,9 +52,9 @@ struct InvokeParams {
                                             MicrotaskQueue* microtask_queue);
 
   bool IsScript() const {
-    if (!target->IsJSFunction()) return false;
+    if (!IsJSFunction(*target)) return false;
     Handle<JSFunction> function = Handle<JSFunction>::cast(target);
-    return function->shared().is_script();
+    return function->shared()->is_script();
   }
 
   Handle<FixedArray> GetAndResetHostDefinedOptions() {
@@ -113,7 +113,7 @@ InvokeParams InvokeParams::SetUpForCall(Isolate* isolate,
   params.receiver = NormalizeReceiver(isolate, receiver);
   // Check for host-defined options argument for scripts.
   DCHECK_IMPLIES(params.IsScript(), argc == 1);
-  DCHECK_IMPLIES(params.IsScript(), argv[0]->IsFixedArray());
+  DCHECK_IMPLIES(params.IsScript(), IsFixedArray(*argv[0]));
   params.argc = argc;
   params.argv = argv;
   params.new_target = isolate->factory()->undefined_value();
@@ -136,7 +136,7 @@ InvokeParams InvokeParams::SetUpForTryCall(
   params.receiver = NormalizeReceiver(isolate, receiver);
   // Check for host-defined options argument for scripts.
   DCHECK_IMPLIES(params.IsScript(), argc == 1);
-  DCHECK_IMPLIES(params.IsScript(), argv[0]->IsFixedArray());
+  DCHECK_IMPLIES(params.IsScript(), IsFixedArray(*argv[0]));
   params.argc = argc;
   params.argv = argv;
   params.new_target = isolate->factory()->undefined_value();
@@ -189,15 +189,15 @@ MaybeHandle<Context> NewScriptContext(Isolate* isolate,
   // TODO(cbruni, 1244145): Use passed in host_defined_options.
   // Creating a script context is a side effect, so abort if that's not
   // allowed.
-  if (isolate->debug_execution_mode() == DebugInfo::kSideEffects) {
+  if (isolate->should_check_side_effects()) {
     isolate->Throw(*isolate->factory()->NewEvalError(
         MessageTemplate::kNoSideEffectDebugEvaluate));
     return MaybeHandle<Context>();
   }
   SaveAndSwitchContext save(isolate, function->context());
-  SharedFunctionInfo sfi = function->shared();
-  Handle<Script> script(Script::cast(sfi.script()), isolate);
-  Handle<ScopeInfo> scope_info(sfi.scope_info(), isolate);
+  Tagged<SharedFunctionInfo> sfi = function->shared();
+  Handle<Script> script(Script::cast(sfi->script()), isolate);
+  Handle<ScopeInfo> scope_info(sfi->scope_info(), isolate);
   Handle<NativeContext> native_context(NativeContext::cast(function->context()),
                                        isolate);
   Handle<JSGlobalObject> global_object(native_context->global_object(),
@@ -221,7 +221,7 @@ MaybeHandle<Context> NewScriptContext(Isolate* isolate,
                (mode == VariableMode::kConst &&
                 lookup.mode == VariableMode::kConst)) &&
               scope_info->IsReplModeScope() &&
-              context->scope_info().IsReplModeScope())) {
+              context->scope_info()->IsReplModeScope())) {
           // ES#sec-globaldeclarationinstantiation 5.b:
           // If envRec.HasLexicalDeclaration(name) is true, throw a SyntaxError
           // exception.
@@ -276,12 +276,10 @@ MaybeHandle<Context> NewScriptContext(Isolate* isolate,
 V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
                                                  const InvokeParams& params) {
   RCS_SCOPE(isolate, RuntimeCallCounterId::kInvoke);
-  DCHECK(!params.receiver->IsJSGlobalObject());
+  DCHECK(!IsJSGlobalObject(*params.receiver));
   DCHECK_LE(params.argc, FixedArray::kMaxLength);
 
 #if V8_ENABLE_WEBASSEMBLY
-  // When executing JS code, there should be no {CodeSpaceWriteScope} open.
-  DCHECK(!wasm::CodeSpaceWriteScope::IsInScope());
   // If we have PKU support for Wasm, ensure that code is currently write
   // protected for this thread.
   DCHECK_IMPLIES(wasm::GetWasmCodeManager()->HasMemoryProtectionKeySupport(),
@@ -305,19 +303,19 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
 
   // api callbacks can be called directly, unless we want to take the detour
   // through JS to set up a frame for break-at-entry.
-  if (params.target->IsJSFunction()) {
+  if (IsJSFunction(*params.target)) {
     Handle<JSFunction> function = Handle<JSFunction>::cast(params.target);
-    if ((!params.is_construct || function->IsConstructor()) &&
-        function->shared().IsApiFunction() &&
-        !function->shared().BreakAtEntry()) {
+    if ((!params.is_construct || IsConstructor(*function)) &&
+        function->shared()->IsApiFunction() &&
+        !function->shared()->BreakAtEntry(isolate)) {
       SaveAndSwitchContext save(isolate, function->context());
-      DCHECK(function->context().global_object().IsJSGlobalObject());
+      DCHECK(IsJSGlobalObject(function->context()->global_object()));
 
       Handle<Object> receiver = params.is_construct
                                     ? isolate->factory()->the_hole_value()
                                     : params.receiver;
-      Handle<FunctionTemplateInfo> fun_data(
-          function->shared().get_api_func_data(), isolate);
+      Handle<FunctionTemplateInfo> fun_data(function->shared()->api_func_data(),
+                                            isolate);
       auto value = Builtins::InvokeApiFunction(
           isolate, params.is_construct, fun_data, receiver, params.argc,
           params.argv, Handle<HeapObject>::cast(params.new_target));
@@ -334,17 +332,17 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
       return value;
     }
 #ifdef DEBUG
-    if (function->shared().is_script()) {
+    if (function->shared()->is_script()) {
       DCHECK(params.IsScript());
-      DCHECK(params.receiver->IsJSGlobalProxy());
+      DCHECK(IsJSGlobalProxy(*params.receiver));
       DCHECK_EQ(params.argc, 1);
-      DCHECK(params.argv[0]->IsFixedArray());
+      DCHECK(IsFixedArray(*params.argv[0]));
     } else {
       DCHECK(!params.IsScript());
     }
 #endif
     // Set up a ScriptContext when running scripts that need it.
-    if (function->shared().needs_script_context()) {
+    if (function->shared()->needs_script_context()) {
       Handle<Context> context;
       Handle<FixedArray> host_defined_options =
           const_cast<InvokeParams&>(params).GetAndResetHostDefinedOptions();
@@ -365,7 +363,9 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
 
   // Entering JavaScript.
   VMState<JS> state(isolate);
-  CHECK(AllowJavascriptExecution::IsAllowed(isolate));
+  if (!AllowJavascriptExecution::IsAllowed(isolate)) {
+    GRACEFUL_FATAL("Invoke in DisallowJavascriptExecutionScope");
+  }
   if (!ThrowOnJavascriptExecution::IsAllowed(isolate)) {
     isolate->ThrowIllegalOperation();
     if (params.message_handling == Execution::MessageHandling::kReport) {
@@ -380,8 +380,8 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
   isolate->IncrementJavascriptExecutionCounter();
 
   if (params.execution_target == Execution::Target::kCallable) {
-    Handle<Context> context = isolate->native_context();
-    if (!context->script_execution_callback().IsUndefined(isolate)) {
+    Handle<NativeContext> context = isolate->native_context();
+    if (!IsUndefined(context->script_execution_callback(), isolate)) {
       v8::Context::AbortScriptExecutionCallback callback =
           v8::ToCData<v8::Context::AbortScriptExecutionCallback>(
               context->script_execution_callback());
@@ -396,7 +396,7 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
   }
 
   // Placeholder for return value.
-  Object value;
+  Tagged<Object> value;
   Handle<Code> code =
       JSEntry(isolate, params.execution_target, params.is_construct);
   {
@@ -417,11 +417,11 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
           Address receiver, intptr_t argc, Address** argv)>;
       // clang-format on
       JSEntryFunction stub_entry =
-          JSEntryFunction::FromAddress(isolate, code->InstructionStart());
+          JSEntryFunction::FromAddress(isolate, code->instruction_start());
 
-      Address orig_func = params.new_target->ptr();
-      Address func = params.target->ptr();
-      Address recv = params.receiver->ptr();
+      Address orig_func = (*params.new_target).ptr();
+      Address func = (*params.target).ptr();
+      Address recv = (*params.receiver).ptr();
       Address** argv = reinterpret_cast<Address**>(params.argv);
       RCS_SCOPE(isolate, RuntimeCallCounterId::kJS_Execution);
       value = Object(stub_entry.Call(isolate->isolate_data()->isolate_root(),
@@ -437,7 +437,7 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
           Address root_register_value, MicrotaskQueue* microtask_queue)>;
       // clang-format on
       JSEntryFunction stub_entry =
-          JSEntryFunction::FromAddress(isolate, code->InstructionStart());
+          JSEntryFunction::FromAddress(isolate, code->instruction_start());
 
       RCS_SCOPE(isolate, RuntimeCallCounterId::kJS_Execution);
       value = Object(stub_entry.Call(isolate->isolate_data()->isolate_root(),
@@ -447,12 +447,12 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Invoke(Isolate* isolate,
 
 #ifdef VERIFY_HEAP
   if (v8_flags.verify_heap) {
-    value.ObjectVerify(isolate);
+    Object::ObjectVerify(value, isolate);
   }
 #endif
 
   // Update the pending exception flag and return the value.
-  bool has_exception = value.IsException(isolate);
+  bool has_exception = IsException(value, isolate);
   DCHECK(has_exception == isolate->has_pending_exception());
   if (has_exception) {
     if (params.message_handling == Execution::MessageHandling::kReport) {
@@ -524,8 +524,8 @@ MaybeHandle<Object> Execution::Call(Isolate* isolate, Handle<Object> callable,
                                     Handle<Object> receiver, int argc,
                                     Handle<Object> argv[]) {
   // Use Execution::CallScript instead for scripts:
-  DCHECK_IMPLIES(callable->IsJSFunction(),
-                 !JSFunction::cast(*callable).shared().is_script());
+  DCHECK_IMPLIES(IsJSFunction(*callable),
+                 !JSFunction::cast(*callable)->shared()->is_script());
   return Invoke(isolate, InvokeParams::SetUpForCall(isolate, callable, receiver,
                                                     argc, argv));
 }
@@ -535,8 +535,8 @@ MaybeHandle<Object> Execution::CallScript(Isolate* isolate,
                                           Handle<JSFunction> script_function,
                                           Handle<Object> receiver,
                                           Handle<Object> host_defined_options) {
-  DCHECK(script_function->shared().is_script());
-  DCHECK(receiver->IsJSGlobalProxy() || receiver->IsJSGlobalObject());
+  DCHECK(script_function->shared()->is_script());
+  DCHECK(IsJSGlobalProxy(*receiver) || IsJSGlobalObject(*receiver));
   return Invoke(
       isolate, InvokeParams::SetUpForCall(isolate, script_function, receiver, 1,
                                           &host_defined_options));
@@ -546,7 +546,7 @@ MaybeHandle<Object> Execution::CallBuiltin(Isolate* isolate,
                                            Handle<JSFunction> builtin,
                                            Handle<Object> receiver, int argc,
                                            Handle<Object> argv[]) {
-  DCHECK(builtin->code().is_builtin());
+  DCHECK(builtin->code()->is_builtin());
   DisableBreak no_break(isolate->debug());
   return Invoke(isolate, InvokeParams::SetUpForCall(isolate, builtin, receiver,
                                                     argc, argv));
@@ -572,8 +572,8 @@ MaybeHandle<Object> Execution::TryCallScript(
     Handle<Object> receiver, Handle<FixedArray> host_defined_options,
     MessageHandling message_handling, MaybeHandle<Object>* exception_out,
     bool reschedule_terminate) {
-  DCHECK(script_function->shared().is_script());
-  DCHECK(receiver->IsJSGlobalProxy() || receiver->IsJSGlobalObject());
+  DCHECK(script_function->shared()->is_script());
+  DCHECK(IsJSGlobalProxy(*receiver) || IsJSGlobalObject(*receiver));
   Handle<Object> argument = host_defined_options;
   return InvokeWithTryCatch(
       isolate, InvokeParams::SetUpForTryCall(
@@ -587,8 +587,8 @@ MaybeHandle<Object> Execution::TryCall(
     int argc, Handle<Object> argv[], MessageHandling message_handling,
     MaybeHandle<Object>* exception_out, bool reschedule_terminate) {
   // Use Execution::TryCallScript instead for scripts:
-  DCHECK_IMPLIES(callable->IsJSFunction(),
-                 !JSFunction::cast(*callable).shared().is_script());
+  DCHECK_IMPLIES(IsJSFunction(*callable),
+                 !JSFunction::cast(*callable)->shared()->is_script());
   return InvokeWithTryCatch(
       isolate, InvokeParams::SetUpForTryCall(
                    isolate, callable, receiver, argc, argv, message_handling,
@@ -619,7 +619,7 @@ void Execution::CallWasm(Isolate* isolate, Handle<Code> wrapper_code,
   using WasmEntryStub = GeneratedCode<Address(
       Address target, Address object_ref, Address argv, Address c_entry_fp)>;
   WasmEntryStub stub_entry =
-      WasmEntryStub::FromAddress(isolate, wrapper_code->InstructionStart());
+      WasmEntryStub::FromAddress(isolate, wrapper_code->instruction_start());
 
   // Save and restore context around invocation and block the
   // allocation of handles without explicit handle scopes.
@@ -648,7 +648,7 @@ void Execution::CallWasm(Isolate* isolate, Handle<Code> wrapper_code,
     static_assert(compiler::CWasmEntryParameters::kObjectRef == 1);
     static_assert(compiler::CWasmEntryParameters::kArgumentsBuffer == 2);
     static_assert(compiler::CWasmEntryParameters::kCEntryFp == 3);
-    Address result = stub_entry.Call(wasm_call_target, object_ref->ptr(),
+    Address result = stub_entry.Call(wasm_call_target, (*object_ref).ptr(),
                                      packed_args, saved_c_entry_fp);
     if (result != kNullAddress) {
       isolate->set_pending_exception(Object(result));
diff --git a/deps/v8/src/execution/execution.h b/deps/v8/src/execution/execution.h
index cca98f5568b71a..572eea5dbdd1b3 100644
--- a/deps/v8/src/execution/execution.h
+++ b/deps/v8/src/execution/execution.h
@@ -12,9 +12,6 @@ namespace internal {
 
 class MicrotaskQueue;
 
-template <typename T>
-class Handle;
-
 class Execution final : public AllStatic {
  public:
   // Whether to report pending messages, or keep them pending on the isolate.
diff --git a/deps/v8/src/execution/frame-constants.h b/deps/v8/src/execution/frame-constants.h
index 34291940b8d9b1..6ad8c5b8209993 100644
--- a/deps/v8/src/execution/frame-constants.h
+++ b/deps/v8/src/execution/frame-constants.h
@@ -204,21 +204,6 @@ class BuiltinFrameConstants : public TypedFrameConstants {
   DEFINE_TYPED_FRAME_SIZES(2);
 };
 
-// Fixed frame slots shared by the js-to-wasm wrapper, the
-// ReturnPromiseOnSuspend wrapper and the WasmResume wrapper.
-class BuiltinWasmWrapperConstants : public TypedFrameConstants {
- public:
-  // This slot contains the number of slots at the top of the frame that need to
-  // be scanned by the GC.
-  static constexpr int kGCScanSlotCountOffset =
-      TYPED_FRAME_PUSHED_VALUE_OFFSET(0);
-  // The number of parameters passed to this function.
-  static constexpr int kInParamCountOffset = TYPED_FRAME_PUSHED_VALUE_OFFSET(1);
-  // The number of parameters according to the signature.
-  static constexpr int kParamCountOffset = TYPED_FRAME_PUSHED_VALUE_OFFSET(2);
-  static constexpr int kSuspenderOffset = TYPED_FRAME_PUSHED_VALUE_OFFSET(3);
-};
-
 class ConstructFrameConstants : public TypedFrameConstants {
  public:
   // FP-relative.
@@ -231,6 +216,15 @@ class ConstructFrameConstants : public TypedFrameConstants {
   DEFINE_TYPED_FRAME_SIZES(5);
 };
 
+class FastConstructFrameConstants : public TypedFrameConstants {
+ public:
+  // FP-relative.
+  static constexpr int kContextOffset = TYPED_FRAME_PUSHED_VALUE_OFFSET(0);
+  static constexpr int kImplicitReceiverOffset =
+      TYPED_FRAME_PUSHED_VALUE_OFFSET(1);
+  DEFINE_TYPED_FRAME_SIZES(2);
+};
+
 #if V8_ENABLE_WEBASSEMBLY
 class CWasmEntryFrameConstants : public TypedFrameConstants {
  public:
@@ -252,6 +246,84 @@ class WasmExitFrameConstants : public WasmFrameConstants {
   static const int kCallingPCOffset = TYPED_FRAME_PUSHED_VALUE_OFFSET(1);
   DEFINE_TYPED_FRAME_SIZES(2);
 };
+
+// Fixed frame slots used by the js-to-wasm wrapper.
+class JSToWasmWrapperFrameConstants : public TypedFrameConstants {
+ public:
+  // FP-relative.
+  static constexpr int kResultArrayParamOffset = 2 * kSystemPointerSize;
+  static constexpr int kInstanceParamOffset = 3 * kSystemPointerSize;
+
+  // Contains RawPtr to stack-allocated buffer.
+  static constexpr int kWrapperBufferOffset =
+      TYPED_FRAME_PUSHED_VALUE_OFFSET(0);
+
+  // Offsets into the wrapper buffer for values passed from Torque to the
+  // assembly builtin.
+  static constexpr size_t kWrapperBufferReturnCount = 0;
+  static constexpr size_t kWrapperBufferRefReturnCount = 4;
+  static constexpr size_t kWrapperBufferSigRepresentationArray = 8;
+  static constexpr size_t kWrapperBufferStackReturnBufferSize = 16;
+  static constexpr size_t kWrapperBufferCallTarget = 24;
+  static constexpr size_t kWrapperBufferParamStart = 32;
+  static constexpr size_t kWrapperBufferParamEnd = 40;
+
+  // Offsets into the wrapper buffer for values passed from the assembly builtin
+  // to Torque.
+  static constexpr size_t kWrapperBufferStackReturnBufferStart = 16;
+  static constexpr size_t kWrapperBufferFPReturnRegister1 = 24;
+  static constexpr size_t kWrapperBufferFPReturnRegister2 = 32;
+  static constexpr size_t kWrapperBufferGPReturnRegister1 = 40;
+  static constexpr size_t kWrapperBufferGPReturnRegister2 =
+      kWrapperBufferGPReturnRegister1 + kSystemPointerSize;
+
+  // Size of the wrapper buffer
+  static constexpr int kWrapperBufferSize =
+      kWrapperBufferGPReturnRegister2 + kSystemPointerSize;
+  static_assert(kWrapperBufferParamEnd + kSystemPointerSize <=
+                kWrapperBufferSize);
+};
+
+// Fixed frame slots used by the ReturnPromiseOnSuspendAsm wrapper
+// and the WasmResume wrapper.
+class StackSwitchFrameConstants : public JSToWasmWrapperFrameConstants {
+ public:
+  //  StackSwitching stack layout
+  //  ------+-----------------+----------------------
+  //        |  return addr    |
+  //    fp  |- - - - - - - - -|  -------------------|
+  //        |       fp        |                     |
+  //   fp-p |- - - - - - - - -|                     |
+  //        |  frame marker   |                     | no GC scan
+  //  fp-2p |- - - - - - - - -|                     |
+  //        |   scan_count    |                     |
+  //  fp-3p |- - - - - - - - -|  -------------------|
+  //        |  wasm_instance  |                     |
+  //  fp-4p |- - - - - - - - -|                     | fixed GC scan
+  //        |  result_array   |                     |
+  //  fp-5p |- - - - - - - - -|  -------------------|
+  //        |      ....       | <- spill_slot_limit |
+  //        |   spill slots   |                     | GC scan scan_count slots
+  //        |      ....       | <- spill_slot_base--|
+  //        |- - - - - - - - -|                     |
+  // This slot contains the number of slots at the top of the frame that need to
+  // be scanned by the GC.
+  static constexpr int kGCScanSlotCountOffset =
+      TYPED_FRAME_PUSHED_VALUE_OFFSET(1);
+  // Tagged pointer to wasm instance.
+  static constexpr int kInstanceOffset = TYPED_FRAME_PUSHED_VALUE_OFFSET(2);
+  // Tagged pointer to a JS Array for result values.
+  static constexpr int kResultArrayOffset = TYPED_FRAME_PUSHED_VALUE_OFFSET(3);
+
+  static constexpr int kLastSpillOffset = kResultArrayOffset;
+  static constexpr int kNumSpillSlots = 4;
+};
+
+class WasmToJSWrapperConstants {
+ public:
+  // FP-relative.
+  static constexpr size_t kSignatureOffset = 2 * kSystemPointerSize;
+};
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 class BuiltinContinuationFrameConstants : public TypedFrameConstants {
@@ -287,7 +359,8 @@ class ExitFrameConstants : public TypedFrameConstants {
   static constexpr int kCallerSPDisplacement = kCallerSPOffset;
 };
 
-// Behaves like an exit frame but with target and new target args.
+// Behaves like an exit frame but with target, new target and arguments count
+// args.
 class BuiltinExitFrameConstants : public ExitFrameConstants {
  public:
   static constexpr int kNewTargetOffset =
@@ -303,6 +376,44 @@ class BuiltinExitFrameConstants : public ExitFrameConstants {
       kNumExtraArgsWithoutReceiver + 1;
 };
 
+// Behaves like an exit frame but with target and arguments count args followed
+// by v8::FunctionCallbackInfo's implicit arguments, followed by JS arguments
+// passed to the JS function (receiver and etc.).
+class ApiCallbackExitFrameConstants : public ExitFrameConstants {
+ public:
+  // The following two constants must be in sync with v8::FunctionCallbackInfo's
+  // layout.
+  static constexpr int kFunctionCallbackInfoNewTargetIndex = 5;
+  static constexpr int kFunctionCallbackInfoArgsLength = 6;
+
+  // Target, argc, context and optional padding (for arm64).
+  static constexpr int kTargetOffset = kCallerPCOffset + 1 * kSystemPointerSize;
+  static constexpr int kArgcOffset = kTargetOffset + 1 * kSystemPointerSize;
+  static constexpr int kContextOffset = kArgcOffset + 1 * kSystemPointerSize;
+  static constexpr int kOptionalPaddingOffset =
+      kContextOffset + 1 * kSystemPointerSize;
+
+#if V8_TARGET_ARCH_ARM64
+  // Padding is required to keep the stack 16-byte aligned.
+  static constexpr int kOptionalPaddingSize = kSystemPointerSize;
+  static constexpr int kAdditionalParametersCount = 4;
+#else
+  static constexpr int kOptionalPaddingSize = 0;
+  static constexpr int kAdditionalParametersCount = 3;
+#endif  // V8_TARGET_ARCH_ARM64
+
+  // FunctionCallbackInfo.
+  static constexpr int kFunctionCallbackInfoOffset =
+      kOptionalPaddingOffset + kOptionalPaddingSize;
+  static constexpr int kNewTargetOffset =
+      kFunctionCallbackInfoOffset +
+      kFunctionCallbackInfoNewTargetIndex * kSystemPointerSize;
+  // JS arguments.
+  static constexpr int kFirstArgumentOffset =
+      kFunctionCallbackInfoOffset +
+      kFunctionCallbackInfoArgsLength * kSystemPointerSize;
+};
+
 // Unoptimized frames are used for interpreted and baseline-compiled JavaScript
 // frames. They are a "standard" frame, with an additional fixed header for the
 // BytecodeArray, bytecode offset (if running interpreted), feedback vector (if
diff --git a/deps/v8/src/execution/frames-inl.h b/deps/v8/src/execution/frames-inl.h
index 22e9719ff26fd4..2f5582bbc395b9 100644
--- a/deps/v8/src/execution/frames-inl.h
+++ b/deps/v8/src/execution/frames-inl.h
@@ -127,7 +127,7 @@ inline ExitFrame::ExitFrame(StackFrameIteratorBase* iterator)
 inline BuiltinExitFrame::BuiltinExitFrame(StackFrameIteratorBase* iterator)
     : ExitFrame(iterator) {}
 
-inline Object BuiltinExitFrame::receiver_slot_object() const {
+inline Tagged<Object> BuiltinExitFrame::receiver_slot_object() const {
   // The receiver is the first argument on the frame.
   // fp[1]: return address.
   // ------- fixed extra builtin arguments -------
@@ -141,29 +141,55 @@ inline Object BuiltinExitFrame::receiver_slot_object() const {
   return Object(base::Memory<Address>(fp() + receiverOffset));
 }
 
-inline Object BuiltinExitFrame::argc_slot_object() const {
+inline Tagged<Object> BuiltinExitFrame::argc_slot_object() const {
   return Object(
       base::Memory<Address>(fp() + BuiltinExitFrameConstants::kArgcOffset));
 }
 
-inline Object BuiltinExitFrame::target_slot_object() const {
+inline Tagged<Object> BuiltinExitFrame::target_slot_object() const {
   return Object(
       base::Memory<Address>(fp() + BuiltinExitFrameConstants::kTargetOffset));
 }
 
-inline Object BuiltinExitFrame::new_target_slot_object() const {
+inline Tagged<Object> BuiltinExitFrame::new_target_slot_object() const {
   return Object(base::Memory<Address>(
       fp() + BuiltinExitFrameConstants::kNewTargetOffset));
 }
 
+inline ApiCallbackExitFrame::ApiCallbackExitFrame(
+    StackFrameIteratorBase* iterator)
+    : ExitFrame(iterator) {}
+
+inline FullObjectSlot ApiCallbackExitFrame::receiver_slot() const {
+  // The receiver is the first argument on the frame.
+  return FullObjectSlot(fp() +
+                        ApiCallbackExitFrameConstants::kFirstArgumentOffset);
+}
+
+inline FullObjectSlot ApiCallbackExitFrame::argc_slot() const {
+  return FullObjectSlot(fp() + ApiCallbackExitFrameConstants::kArgcOffset);
+}
+
+inline FullObjectSlot ApiCallbackExitFrame::context_slot() const {
+  return FullObjectSlot(fp() + ApiCallbackExitFrameConstants::kContextOffset);
+}
+
+inline FullObjectSlot ApiCallbackExitFrame::target_slot() const {
+  return FullObjectSlot(fp() + ApiCallbackExitFrameConstants::kTargetOffset);
+}
+
+inline FullObjectSlot ApiCallbackExitFrame::new_target_slot() const {
+  return FullObjectSlot(fp() + ApiCallbackExitFrameConstants::kNewTargetOffset);
+}
+
 inline CommonFrame::CommonFrame(StackFrameIteratorBase* iterator)
     : StackFrame(iterator) {}
 
-inline Object CommonFrame::GetExpression(int index) const {
+inline Tagged<Object> CommonFrame::GetExpression(int index) const {
   return Object(base::Memory<Address>(GetExpressionAddress(index)));
 }
 
-inline void CommonFrame::SetExpression(int index, Object value) {
+inline void CommonFrame::SetExpression(int index, Tagged<Object> value) {
   base::Memory<Address>(GetExpressionAddress(index)) = value.ptr();
 }
 
@@ -179,7 +205,8 @@ inline Address CommonFrame::caller_pc() const {
 inline bool CommonFrameWithJSLinkage::IsConstructFrame(Address fp) {
   intptr_t frame_type =
       base::Memory<intptr_t>(fp + TypedFrameConstants::kFrameTypeOffset);
-  return frame_type == StackFrame::TypeToMarker(StackFrame::CONSTRUCT);
+  return frame_type == StackFrame::TypeToMarker(StackFrame::CONSTRUCT) ||
+         frame_type == StackFrame::TypeToMarker(StackFrame::FAST_CONSTRUCT);
 }
 
 inline JavaScriptFrame::JavaScriptFrame(StackFrameIteratorBase* iterator)
@@ -197,11 +224,11 @@ inline int CommonFrameWithJSLinkage::GetActualArgumentCount() const {
   return 0;
 }
 
-inline void JavaScriptFrame::set_receiver(Object value) {
+inline void JavaScriptFrame::set_receiver(Tagged<Object> value) {
   base::Memory<Address>(GetParameterSlot(-1)) = value.ptr();
 }
 
-inline Object JavaScriptFrame::function_slot_object() const {
+inline Tagged<Object> JavaScriptFrame::function_slot_object() const {
   const int offset = StandardFrameConstants::kFunctionOffset;
   return Object(base::Memory<Address>(fp() + offset));
 }
@@ -272,6 +299,9 @@ inline InternalFrame::InternalFrame(StackFrameIteratorBase* iterator)
 inline ConstructFrame::ConstructFrame(StackFrameIteratorBase* iterator)
     : InternalFrame(iterator) {}
 
+inline FastConstructFrame::FastConstructFrame(StackFrameIteratorBase* iterator)
+    : InternalFrame(iterator) {}
+
 inline BuiltinContinuationFrame::BuiltinContinuationFrame(
     StackFrameIteratorBase* iterator)
     : InternalFrame(iterator) {}
@@ -320,14 +350,14 @@ JavaScriptFrame* DebuggableStackFrameIterator::javascript_frame() const {
 // static
 inline bool StackFrameIteratorForProfiler::IsValidFrameType(
     StackFrame::Type type) {
-#if V8_ENABLE_WEBASSEMBLY
   return StackFrame::IsJavaScript(type) || type == StackFrame::EXIT ||
-         type == StackFrame::BUILTIN_EXIT || type == StackFrame::WASM ||
-         type == StackFrame::WASM_TO_JS || type == StackFrame::JS_TO_WASM;
-#else
-  return StackFrame::IsJavaScript(type) || type == StackFrame::EXIT ||
-         type == StackFrame::BUILTIN_EXIT;
+         type == StackFrame::BUILTIN_EXIT ||
+         type == StackFrame::API_CALLBACK_EXIT ||
+#if V8_ENABLE_WEBASSEMBLY
+         type == StackFrame::WASM || type == StackFrame::WASM_TO_JS ||
+         type == StackFrame::JS_TO_WASM ||
 #endif  // V8_ENABLE_WEBASSEMBLY
+         false;
 }
 
 inline StackFrame* StackFrameIteratorForProfiler::frame() const {
diff --git a/deps/v8/src/execution/frames.cc b/deps/v8/src/execution/frames.cc
index b5def7fa4792ed..9c8b4d589f9c4e 100644
--- a/deps/v8/src/execution/frames.cc
+++ b/deps/v8/src/execution/frames.cc
@@ -8,8 +8,11 @@
 #include <memory>
 #include <sstream>
 
+#include "src/api/api-arguments.h"
+#include "src/api/api-natives.h"
 #include "src/base/bits.h"
 #include "src/codegen/interface-descriptors.h"
+#include "src/codegen/linkage-location.h"
 #include "src/codegen/macro-assembler.h"
 #include "src/codegen/maglev-safepoint-table.h"
 #include "src/codegen/register-configuration.h"
@@ -32,9 +35,11 @@
 
 #if V8_ENABLE_WEBASSEMBLY
 #include "src/debug/debug-wasm-objects.h"
+#include "src/wasm/serialized-signature-inl.h"
 #include "src/wasm/stacks.h"
 #include "src/wasm/wasm-code-manager.h"
 #include "src/wasm/wasm-engine.h"
+#include "src/wasm/wasm-linkage.h"
 #include "src/wasm/wasm-objects-inl.h"
 #endif  // V8_ENABLE_WEBASSEMBLY
 
@@ -249,9 +254,10 @@ FrameSummary DebuggableStackFrameIterator::GetTopValidFrame() const {
   frame()->Summarize(&frames);
   if (is_javascript()) {
     for (int i = static_cast<int>(frames.size()) - 1; i >= 0; i--) {
-      JSFunction function = *frames[i].AsJavaScript().function();
-      if (!function.shared().IsSubjectToDebugging()) continue;
-      return frames[i];
+      const FrameSummary& summary = frames[i];
+      if (summary.is_subject_to_debugging()) {
+        return summary;
+      }
     }
     UNREACHABLE();
   }
@@ -264,8 +270,9 @@ FrameSummary DebuggableStackFrameIterator::GetTopValidFrame() const {
 // static
 bool DebuggableStackFrameIterator::IsValidFrame(StackFrame* frame) {
   if (frame->is_java_script()) {
-    JSFunction function = static_cast<JavaScriptFrame*>(frame)->function();
-    return function.shared().IsSubjectToDebugging();
+    Tagged<JSFunction> function =
+        static_cast<JavaScriptFrame*>(frame)->function();
+    return function->shared()->IsSubjectToDebugging();
   }
 #if V8_ENABLE_WEBASSEMBLY
   if (frame->is_wasm()) return true;
@@ -277,8 +284,8 @@ bool DebuggableStackFrameIterator::IsValidFrame(StackFrame* frame) {
 
 namespace {
 
-bool IsInterpreterFramePc(Isolate* isolate, Address pc,
-                          StackFrame::State* state) {
+base::Optional<bool> IsInterpreterFramePc(Isolate* isolate, Address pc,
+                                          StackFrame::State* state) {
   Builtin builtin = OffHeapInstructionStream::TryLookupCode(isolate, pc);
   if (builtin != Builtin::kNoBuiltinId &&
       (builtin == Builtin::kInterpreterEntryTrampoline ||
@@ -293,18 +300,21 @@ bool IsInterpreterFramePc(Isolate* isolate, Address pc,
     MSAN_MEMORY_IS_INITIALIZED(
         state->fp + StandardFrameConstants::kFunctionOffset,
         kSystemPointerSize);
-    Object maybe_function = Object(
+    Tagged<Object> maybe_function = Object(
         Memory<Address>(state->fp + StandardFrameConstants::kFunctionOffset));
     // There's no need to run a full ContainsSlow if we know the frame can't be
     // an InterpretedFrame,  so we do these fast checks first
-    if (StackFrame::IsTypeMarker(marker) || maybe_function.IsSmi()) {
+    if (StackFrame::IsTypeMarker(marker) || IsSmi(maybe_function)) {
       return false;
     } else if (!isolate->heap()->InSpaceSlow(pc, CODE_SPACE)) {
       return false;
     }
-    Code interpreter_entry_trampoline =
+    if (!ThreadIsolation::CanLookupStartOfJitAllocationAt(pc)) {
+      return {};
+    }
+    Tagged<Code> interpreter_entry_trampoline =
         isolate->heap()->FindCodeForInnerPointer(pc);
-    return interpreter_entry_trampoline.is_interpreter_trampoline_builtin();
+    return interpreter_entry_trampoline->is_interpreter_trampoline_builtin();
   } else {
     return false;
   }
@@ -411,6 +421,7 @@ StackFrameIteratorForProfiler::StackFrameIteratorForProfiler(
     // in a bytecode handler with elided frame. In that case, set the PC
     // properly and make sure we do not drop the frame.
     bool is_no_frame_bytecode_handler = false;
+    bool cant_lookup_frame_type = false;
     if (IsNoFrameBytecodeHandlerPc(isolate, pc, fp)) {
       Address* top_location = nullptr;
       if (top_link_register_) {
@@ -420,7 +431,13 @@ StackFrameIteratorForProfiler::StackFrameIteratorForProfiler(
         top_location = reinterpret_cast<Address*>(sp);
       }
 
-      if (IsInterpreterFramePc(isolate, *top_location, &state)) {
+      base::Optional<bool> is_interpreter_frame_pc =
+          IsInterpreterFramePc(isolate, *top_location, &state);
+      // Since we're in a signal handler, the pc lookup might not be possible
+      // since the required locks are taken by the same thread.
+      if (!is_interpreter_frame_pc.has_value()) {
+        cant_lookup_frame_type = true;
+      } else if (is_interpreter_frame_pc.value()) {
         state.pc_address = top_location;
         is_no_frame_bytecode_handler = true;
         advance_frame = false;
@@ -434,7 +451,9 @@ StackFrameIteratorForProfiler::StackFrameIteratorForProfiler(
     static_assert(StandardFrameConstants::kFunctionOffset <
                   StandardFrameConstants::kContextOffset);
     Address function_slot = fp + StandardFrameConstants::kFunctionOffset;
-    if (IsValidStackAddress(function_slot)) {
+    if (cant_lookup_frame_type) {
+      type = StackFrame::NO_FRAME_TYPE;
+    } else if (IsValidStackAddress(function_slot)) {
       if (is_no_frame_bytecode_handler) {
         type = StackFrame::INTERPRETED;
       } else {
@@ -500,8 +519,13 @@ bool StackFrameIteratorForProfiler::IsValidCaller(StackFrame* frame) {
     // See EntryFrame::GetCallerState. It computes the caller FP address
     // and calls ExitFrame::GetStateForFramePointer on it. We need to be
     // sure that caller FP address is valid.
-    Address next_exit_frame_fp = Memory<Address>(
-        frame->fp() + EntryFrameConstants::kNextExitFrameFPOffset);
+    Address next_exit_frame_fp_address =
+        frame->fp() + EntryFrameConstants::kNextExitFrameFPOffset;
+    // Profiling tick might be triggered in the middle of JSEntry builtin
+    // before the next_exit_frame_fp value is initialized. IsValidExitFrame()
+    // is able to deal with such a case, so just suppress the MSan warning.
+    MSAN_MEMORY_IS_INITIALIZED(next_exit_frame_fp_address, kSystemPointerSize);
+    Address next_exit_frame_fp = Memory<Address>(next_exit_frame_fp_address);
     if (!IsValidExitFrame(next_exit_frame_fp)) return false;
   }
   frame->ComputeCallerState(&state);
@@ -541,7 +565,8 @@ void StackFrameIteratorForProfiler::Advance() {
       break;
     }
 #endif  // V8_ENABLE_WEBASSEMBLY
-    if (frame_->is_exit() || frame_->is_builtin_exit()) {
+    if (frame_->is_exit() || frame_->is_builtin_exit() ||
+        frame_->is_api_callback_exit()) {
       // Some of the EXIT frames may have ExternalCallbackScope allocated on
       // top of them. In that case the scope corresponds to the first EXIT
       // frame beneath it. There may be other EXIT frames on top of the
@@ -556,6 +581,16 @@ void StackFrameIteratorForProfiler::Advance() {
   }
 }
 
+StackFrameIteratorForProfilerForTesting::
+    StackFrameIteratorForProfilerForTesting(Isolate* isolate, Address pc,
+                                            Address fp, Address sp, Address lr,
+                                            Address js_entry_sp)
+    : StackFrameIteratorForProfiler(isolate, pc, fp, sp, lr, js_entry_sp) {}
+
+void StackFrameIteratorForProfilerForTesting::Advance() {
+  StackFrameIteratorForProfiler::Advance();
+}
+
 // -------------------------------------------------------------------------
 
 namespace {
@@ -566,34 +601,35 @@ base::Optional<GcSafeCode> GetContainingCode(Isolate* isolate, Address pc) {
 
 }  // namespace
 
-GcSafeCode StackFrame::GcSafeLookupCode() const {
+Tagged<GcSafeCode> StackFrame::GcSafeLookupCode() const {
   base::Optional<GcSafeCode> result = GetContainingCode(isolate(), pc());
   DCHECK_GE(pc(), result->InstructionStart(isolate(), pc()));
   DCHECK_LT(pc(), result->InstructionEnd(isolate(), pc()));
   return result.value();
 }
 
-Code StackFrame::LookupCode() const {
+Tagged<Code> StackFrame::LookupCode() const {
   DCHECK_NE(isolate()->heap()->gc_state(), Heap::MARK_COMPACT);
-  return GcSafeLookupCode().UnsafeCastToCode();
+  return GcSafeLookupCode()->UnsafeCastToCode();
 }
 
 void StackFrame::IteratePc(RootVisitor* v, Address* pc_address,
                            Address* constant_pool_address,
-                           GcSafeCode holder) const {
+                           Tagged<GcSafeCode> holder) const {
   const Address old_pc = ReadPC(pc_address);
-  DCHECK_GE(old_pc, holder.InstructionStart(isolate(), old_pc));
-  DCHECK_LT(old_pc, holder.InstructionEnd(isolate(), old_pc));
+  DCHECK_GE(old_pc, holder->InstructionStart(isolate(), old_pc));
+  DCHECK_LT(old_pc, holder->InstructionEnd(isolate(), old_pc));
 
   // Keep the old pc offset before visiting the code since we need it to
   // calculate the new pc after a potential InstructionStream move.
-  const uintptr_t pc_offset_from_start = old_pc - holder.InstructionStart();
+  const uintptr_t pc_offset_from_start = old_pc - holder->instruction_start();
 
   // Visit.
-  GcSafeCode visited_holder = holder;
+  Tagged<GcSafeCode> visited_holder = holder;
   PtrComprCageBase code_cage_base{isolate()->code_cage_base()};
-  const Object old_istream = holder.raw_instruction_stream(code_cage_base);
-  Object visited_istream = old_istream;
+  const Tagged<Object> old_istream =
+      holder->raw_instruction_stream(code_cage_base);
+  Tagged<Object> visited_istream = old_istream;
   v->VisitRunningCode(FullObjectSlot{&visited_holder},
                       FullObjectSlot{&visited_istream});
   if (visited_istream == old_istream) {
@@ -603,15 +639,15 @@ void StackFrame::IteratePc(RootVisitor* v, Address* pc_address,
     return;
   }
 
-  DCHECK(visited_holder.has_instruction_stream());
+  DCHECK(visited_holder->has_instruction_stream());
 
-  InstructionStream istream =
+  Tagged<InstructionStream> istream =
       InstructionStream::unchecked_cast(visited_istream);
-  const Address new_pc = istream.instruction_start() + pc_offset_from_start;
+  const Address new_pc = istream->instruction_start() + pc_offset_from_start;
   // TODO(v8:10026): avoid replacing a signed pointer.
   PointerAuthentication::ReplacePC(pc_address, new_pc, kSystemPointerSize);
   if (V8_EMBEDDED_CONSTANT_POOL_BOOL && constant_pool_address != nullptr) {
-    *constant_pool_address = visited_holder.constant_pool();
+    *constant_pool_address = visited_holder->constant_pool(istream);
   }
 }
 
@@ -623,15 +659,15 @@ void StackFrame::SetReturnAddressLocationResolver(
 
 namespace {
 
-StackFrame::Type ComputeBuiltinFrameType(GcSafeCode code) {
-  if (code.is_interpreter_trampoline_builtin() ||
-      code.is_baseline_trampoline_builtin()) {
+StackFrame::Type ComputeBuiltinFrameType(Tagged<GcSafeCode> code) {
+  if (code->is_interpreter_trampoline_builtin() ||
+      code->is_baseline_trampoline_builtin()) {
     // Frames for baseline entry trampolines on the stack are still interpreted
     // frames.
     return StackFrame::INTERPRETED;
-  } else if (code.is_baseline_leave_frame_builtin()) {
+  } else if (code->is_baseline_leave_frame_builtin()) {
     return StackFrame::BASELINE;
-  } else if (code.is_turbofanned()) {
+  } else if (code->is_turbofanned()) {
     // TODO(bmeurer): We treat frames for BUILTIN Code objects as
     // OptimizedFrame for now (all the builtins with JavaScript linkage are
     // actually generated with TurboFan currently, so this is sound).
@@ -643,9 +679,11 @@ StackFrame::Type ComputeBuiltinFrameType(GcSafeCode code) {
 StackFrame::Type SafeStackFrameType(StackFrame::Type candidate) {
   DCHECK_LE(static_cast<uintptr_t>(candidate), StackFrame::NUMBER_OF_TYPES);
   switch (candidate) {
+    case StackFrame::API_CALLBACK_EXIT:
     case StackFrame::BUILTIN_CONTINUATION:
     case StackFrame::BUILTIN_EXIT:
     case StackFrame::CONSTRUCT:
+    case StackFrame::FAST_CONSTRUCT:
     case StackFrame::CONSTRUCT_ENTRY:
     case StackFrame::ENTRY:
     case StackFrame::EXIT:
@@ -754,7 +792,7 @@ StackFrame::Type StackFrameIterator::ComputeStackFrameType(
       return StackFrame::TURBOFAN;
 #if V8_ENABLE_WEBASSEMBLY
     case CodeKind::JS_TO_WASM_FUNCTION:
-      if (lookup_result->builtin_id() == Builtin::kGenericJSToWasmWrapper) {
+      if (lookup_result->builtin_id() == Builtin::kJSToWasmWrapperAsm) {
         return StackFrame::JS_TO_WASM;
       }
       return StackFrame::TURBOFAN_STUB_WITH_CONTEXT;
@@ -797,6 +835,16 @@ StackFrame::Type StackFrameIteratorForProfiler::ComputeStackFrameType(
   }
 #endif
 
+  // We use unauthenticated_pc because it may come from
+  // fast_c_call_caller_pc_address, for which authentication does not work.
+  const Address pc = StackFrame::unauthenticated_pc(state->pc_address);
+#if V8_ENABLE_WEBASSEMBLY
+  Code wrapper = isolate()->builtins()->code(Builtin::kWasmToJsWrapperCSA);
+  if (pc >= wrapper.instruction_start() && pc <= wrapper.instruction_end()) {
+    return StackFrame::WASM_TO_JS;
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
+
   MSAN_MEMORY_IS_INITIALIZED(
       state->fp + CommonFrameConstants::kContextOrFrameTypeOffset,
       kSystemPointerSize);
@@ -810,18 +858,27 @@ StackFrame::Type StackFrameIteratorForProfiler::ComputeStackFrameType(
     return SafeStackFrameType(StackFrame::MarkerToType(marker));
   }
 
-  // We use unauthenticated_pc because it may come from
-  // fast_c_call_caller_pc_address, for which authentication does not work.
-  const Address pc = StackFrame::unauthenticated_pc(state->pc_address);
   MSAN_MEMORY_IS_INITIALIZED(
       state->fp + StandardFrameConstants::kFunctionOffset, kSystemPointerSize);
-  Object maybe_function = Object(
+  Tagged<Object> maybe_function = Object(
       Memory<Address>(state->fp + StandardFrameConstants::kFunctionOffset));
-  if (maybe_function.IsSmi()) {
+  if (IsSmi(maybe_function)) {
     return StackFrame::NATIVE;
-  } else if (IsInterpreterFramePc(isolate(), pc, state)) {
+  }
+
+  base::Optional<bool> is_interpreter_frame =
+      IsInterpreterFramePc(isolate(), pc, state);
+
+  // We might not be able to lookup the frame type since we're inside a signal
+  // handler and the required locks are taken.
+  if (!is_interpreter_frame.has_value()) {
+    return StackFrame::NO_FRAME_TYPE;
+  }
+
+  if (is_interpreter_frame.value()) {
     return StackFrame::INTERPRETED;
   }
+
   return StackFrame::TURBOFAN;
 }
 
@@ -843,7 +900,7 @@ void NativeFrame::ComputeCallerState(State* state) const {
   state->constant_pool_address = nullptr;
 }
 
-HeapObject EntryFrame::unchecked_code() const {
+Tagged<HeapObject> EntryFrame::unchecked_code() const {
   return isolate()->builtins()->code(Builtin::kJSEntry);
 }
 
@@ -865,7 +922,7 @@ StackFrame::Type CWasmEntryFrame::GetCallerState(State* state) const {
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-HeapObject ConstructEntryFrame::unchecked_code() const {
+Tagged<HeapObject> ConstructEntryFrame::unchecked_code() const {
   return isolate()->builtins()->code(Builtin::kJSConstructEntry);
 }
 
@@ -903,12 +960,12 @@ StackFrame::Type ExitFrame::GetStateForFramePointer(Address fp, State* state) {
 }
 
 StackFrame::Type ExitFrame::ComputeFrameType(Address fp) {
-  // Distinguish between between regular and builtin exit frames.
+  // Distinguish between different exit frame types.
   // Default to EXIT in all hairy cases (e.g., when called from profiler).
   const int offset = ExitFrameConstants::kFrameTypeOffset;
-  Object marker(Memory<Address>(fp + offset));
+  Tagged<Object> marker(Memory<Address>(fp + offset));
 
-  if (!marker.IsSmi()) {
+  if (!IsSmi(marker)) {
     return EXIT;
   }
 
@@ -917,6 +974,7 @@ StackFrame::Type ExitFrame::ComputeFrameType(Address fp) {
   StackFrame::Type frame_type = static_cast<StackFrame::Type>(marker_int >> 1);
   switch (frame_type) {
     case BUILTIN_EXIT:
+    case API_CALLBACK_EXIT:
 #if V8_ENABLE_WEBASSEMBLY
     case WASM_EXIT:
     case STACK_SWITCH:
@@ -961,21 +1019,23 @@ void BuiltinExitFrame::Summarize(std::vector<FrameSummary>* frames) const {
   DCHECK(frames->empty());
   Handle<FixedArray> parameters = GetParameters();
   DisallowGarbageCollection no_gc;
-  Code code = LookupCode();
-  int code_offset = code.GetOffsetFromInstructionStart(isolate(), pc());
+  Tagged<Code> code = LookupCode();
+  int code_offset = code->GetOffsetFromInstructionStart(isolate(), pc());
   FrameSummary::JavaScriptFrameSummary summary(
       isolate(), receiver(), function(), AbstractCode::cast(code), code_offset,
       IsConstructor(), *parameters);
   frames->push_back(summary);
 }
 
-JSFunction BuiltinExitFrame::function() const {
+Tagged<JSFunction> BuiltinExitFrame::function() const {
   return JSFunction::cast(target_slot_object());
 }
 
-Object BuiltinExitFrame::receiver() const { return receiver_slot_object(); }
+Tagged<Object> BuiltinExitFrame::receiver() const {
+  return receiver_slot_object();
+}
 
-Object BuiltinExitFrame::GetParameter(int i) const {
+Tagged<Object> BuiltinExitFrame::GetParameter(int i) const {
   DCHECK(i >= 0 && i < ComputeParametersCount());
   int offset =
       BuiltinExitFrameConstants::kFirstArgumentOffset + i * kSystemPointerSize;
@@ -983,8 +1043,8 @@ Object BuiltinExitFrame::GetParameter(int i) const {
 }
 
 int BuiltinExitFrame::ComputeParametersCount() const {
-  Object argc_slot = argc_slot_object();
-  DCHECK(argc_slot.IsSmi());
+  Tagged<Object> argc_slot = argc_slot_object();
+  DCHECK(IsSmi(argc_slot));
   // Argc also counts the receiver, target, new target, and argc itself as args,
   // therefore the real argument count is argc - 4.
   int argc = Smi::ToInt(argc_slot) - 4;
@@ -1005,7 +1065,97 @@ Handle<FixedArray> BuiltinExitFrame::GetParameters() const {
 }
 
 bool BuiltinExitFrame::IsConstructor() const {
-  return !new_target_slot_object().IsUndefined(isolate());
+  return !IsUndefined(new_target_slot_object(), isolate());
+}
+
+// Ensure layout of v8::FunctionCallbackInfo is in sync with
+// ApiCallbackExitFrameConstants.
+static_assert(
+    ApiCallbackExitFrameConstants::kFunctionCallbackInfoNewTargetIndex ==
+    FunctionCallbackArguments::kNewTargetIndex);
+static_assert(ApiCallbackExitFrameConstants::kFunctionCallbackInfoArgsLength ==
+              FunctionCallbackArguments::kArgsLength);
+
+Tagged<HeapObject> ApiCallbackExitFrame::target() const {
+  Tagged<Object> function = *target_slot();
+  DCHECK(IsJSFunction(function) || IsFunctionTemplateInfo(function));
+  return HeapObject::cast(function);
+}
+
+void ApiCallbackExitFrame::set_target(Tagged<HeapObject> function) const {
+  DCHECK(IsJSFunction(function) || IsFunctionTemplateInfo(function));
+  target_slot().store(function);
+}
+
+Handle<JSFunction> ApiCallbackExitFrame::GetFunction() const {
+  Tagged<HeapObject> maybe_function = target();
+  if (IsJSFunction(maybe_function)) {
+    return Handle<JSFunction>(target_slot().location());
+  }
+  DCHECK(IsFunctionTemplateInfo(maybe_function));
+  Handle<FunctionTemplateInfo> function_template_info(
+      FunctionTemplateInfo::cast(maybe_function), isolate());
+
+  // Instantiate function for the correct context.
+  DCHECK(IsContext(*context_slot()));
+  Handle<NativeContext> native_context(
+      Context::cast(*context_slot())->native_context(), isolate());
+
+  Handle<JSFunction> function =
+      ApiNatives::InstantiateFunction(isolate(), native_context,
+                                      function_template_info)
+          .ToHandleChecked();
+
+  set_target(*function);
+  return function;
+}
+
+Tagged<Object> ApiCallbackExitFrame::receiver() const {
+  return *receiver_slot();
+}
+
+Tagged<Object> ApiCallbackExitFrame::GetParameter(int i) const {
+  DCHECK(i >= 0 && i < ComputeParametersCount());
+  int offset = ApiCallbackExitFrameConstants::kFirstArgumentOffset +
+               i * kSystemPointerSize;
+  return Object(Memory<Address>(fp() + offset));
+}
+
+int ApiCallbackExitFrame::ComputeParametersCount() const {
+  Tagged<Object> argc_value = *argc_slot();
+  DCHECK(IsSmi(argc_value));
+  int argc = Smi::ToInt(argc_value);
+  DCHECK_GE(argc, 0);
+  return argc;
+}
+
+Handle<FixedArray> ApiCallbackExitFrame::GetParameters() const {
+  if (V8_LIKELY(!v8_flags.detailed_error_stack_trace)) {
+    return isolate()->factory()->empty_fixed_array();
+  }
+  int param_count = ComputeParametersCount();
+  auto parameters = isolate()->factory()->NewFixedArray(param_count);
+  for (int i = 0; i < param_count; i++) {
+    parameters->set(i, GetParameter(i));
+  }
+  return parameters;
+}
+
+bool ApiCallbackExitFrame::IsConstructor() const {
+  return !IsUndefined(*new_target_slot(), isolate());
+}
+
+void ApiCallbackExitFrame::Summarize(std::vector<FrameSummary>* frames) const {
+  DCHECK(frames->empty());
+  Handle<FixedArray> parameters = GetParameters();
+  Handle<JSFunction> function = GetFunction();
+  DisallowGarbageCollection no_gc;
+  Tagged<Code> code = LookupCode();
+  int code_offset = code->GetOffsetFromInstructionStart(isolate(), pc());
+  FrameSummary::JavaScriptFrameSummary summary(
+      isolate(), receiver(), *function, AbstractCode::cast(code), code_offset,
+      IsConstructor(), *parameters);
+  frames->push_back(summary);
 }
 
 namespace {
@@ -1038,8 +1188,8 @@ void StackFrame::Print(StringStream* accumulator, PrintMode mode,
 void BuiltinExitFrame::Print(StringStream* accumulator, PrintMode mode,
                              int index) const {
   DisallowGarbageCollection no_gc;
-  Object receiver = this->receiver();
-  JSFunction function = this->function();
+  Tagged<Object> receiver = this->receiver();
+  Tagged<JSFunction> function = this->function();
 
   accumulator->PrintSecurityTokenIfChanged(function);
   PrintIndex(accumulator, mode, index);
@@ -1058,6 +1208,29 @@ void BuiltinExitFrame::Print(StringStream* accumulator, PrintMode mode,
   accumulator->Add(")\n\n");
 }
 
+void ApiCallbackExitFrame::Print(StringStream* accumulator, PrintMode mode,
+                                 int index) const {
+  Handle<JSFunction> function = GetFunction();
+  DisallowGarbageCollection no_gc;
+  Tagged<Object> receiver = this->receiver();
+
+  accumulator->PrintSecurityTokenIfChanged(*function);
+  PrintIndex(accumulator, mode, index);
+  accumulator->Add("api callback exit frame: ");
+  if (IsConstructor()) accumulator->Add("new ");
+  accumulator->PrintFunction(*function, receiver);
+
+  accumulator->Add("(this=%o", receiver);
+
+  // Print the parameters.
+  int parameters_count = ComputeParametersCount();
+  for (int i = 0; i < parameters_count; i++) {
+    accumulator->Add(",%o", GetParameter(i));
+  }
+
+  accumulator->Add(")\n\n");
+}
+
 Address CommonFrame::GetExpressionAddress(int n) const {
   const int offset = StandardFrameConstants::kExpressionsOffset;
   return fp() + offset - n * kSystemPointerSize;
@@ -1068,14 +1241,14 @@ Address UnoptimizedFrame::GetExpressionAddress(int n) const {
   return fp() + offset - n * kSystemPointerSize;
 }
 
-Object CommonFrame::context() const {
+Tagged<Object> CommonFrame::context() const {
   return ReadOnlyRoots(isolate()).undefined_value();
 }
 
 int CommonFrame::position() const {
-  Code code = LookupCode();
-  int code_offset = code.GetOffsetFromInstructionStart(isolate(), pc());
-  return AbstractCode::cast(code).SourcePosition(isolate(), code_offset);
+  Tagged<Code> code = LookupCode();
+  int code_offset = code->GetOffsetFromInstructionStart(isolate(), pc());
+  return AbstractCode::cast(code)->SourcePosition(isolate(), code_offset);
 }
 
 int CommonFrame::ComputeExpressionsCount() const {
@@ -1147,13 +1320,14 @@ void VisitSpillSlot(Isolate* isolate, RootVisitor* v,
           cage_base, static_cast<Tagged_t>(value));
       if (DEBUG_BOOL) {
         // Ensure that the spill slot contains correct heap object.
-        HeapObject raw = HeapObject::cast(Object(*spill_slot.location()));
-        MapWord map_word = raw.map_word(cage_base, kRelaxedLoad);
-        HeapObject forwarded = map_word.IsForwardingAddress()
-                                   ? map_word.ToForwardingAddress(raw)
-                                   : raw;
+        Tagged<HeapObject> raw =
+            HeapObject::cast(Object(*spill_slot.location()));
+        MapWord map_word = raw->map_word(cage_base, kRelaxedLoad);
+        Tagged<HeapObject> forwarded = map_word.IsForwardingAddress()
+                                           ? map_word.ToForwardingAddress(raw)
+                                           : raw;
         bool is_self_forwarded =
-            forwarded.map_word(cage_base, kRelaxedLoad) ==
+            forwarded->map_word(cage_base, kRelaxedLoad) ==
             MapWord::FromForwardingAddress(forwarded, forwarded);
         if (is_self_forwarded) {
           // The object might be in a self-forwarding state if it's located
@@ -1161,14 +1335,14 @@ void VisitSpillSlot(Isolate* isolate, RootVisitor* v,
           CHECK(BasicMemoryChunk::FromHeapObject(forwarded)
                     ->InNewLargeObjectSpace());
         } else {
-          HeapObject forwarded_map = forwarded.map(cage_base);
+          Tagged<HeapObject> forwarded_map = forwarded->map(cage_base);
           // The map might be forwarded as well.
           MapWord fwd_map_map_word =
-              forwarded_map.map_word(cage_base, kRelaxedLoad);
+              forwarded_map->map_word(cage_base, kRelaxedLoad);
           if (fwd_map_map_word.IsForwardingAddress()) {
             forwarded_map = fwd_map_map_word.ToForwardingAddress(forwarded_map);
           }
-          CHECK(forwarded_map.IsMap(cage_base));
+          CHECK(IsMap(forwarded_map, cage_base));
         }
       }
     }
@@ -1272,7 +1446,7 @@ void WasmFrame::Iterate(RootVisitor* v) const {
   //  |    in_param 0   |  <-- first_tagged_parameter_slot
   //  +-----------------+-----------------------------------------
   //
-  // (*) Only if compiled by liftoff and with --wasm-speculative-inlining
+  // (*) Only if compiled by Liftoff and with --experimental-wasm-inlining.
 
   auto* wasm_code = wasm::GetWasmCodeManager()->LookupCode(pc());
   DCHECK(wasm_code);
@@ -1345,6 +1519,122 @@ void WasmFrame::Iterate(RootVisitor* v) const {
   v->VisitRootPointers(Root::kStackRoots, nullptr, frame_header_base,
                        frame_header_limit);
 }
+
+void TypedFrame::IterateParamsOfWasmToJSWrapper(RootVisitor* v) const {
+  Tagged<Object> maybe_signature = Object(
+      Memory<Address>(fp() + WasmToJSWrapperConstants::kSignatureOffset));
+  // The signature slot contains a marker and not a signature, so there is
+  // nothing we have to iterate here.
+  if (IsSmi(maybe_signature)) {
+    return;
+  }
+
+  FullObjectSlot sig_slot(fp() + WasmToJSWrapperConstants::kSignatureOffset);
+  VisitSpillSlot(isolate(), v, sig_slot);
+
+  // Load the signature, considering forward pointers.
+  PtrComprCageBase cage_base(isolate());
+  Tagged<HeapObject> raw = HeapObject::cast(maybe_signature);
+  MapWord map_word = raw->map_word(cage_base, kRelaxedLoad);
+  Tagged<HeapObject> forwarded =
+      map_word.IsForwardingAddress() ? map_word.ToForwardingAddress(raw) : raw;
+  Tagged<PodArray<wasm::ValueType>> sig =
+      PodArray<wasm::ValueType>::cast(forwarded);
+
+  size_t parameter_count = wasm::SerializedSignatureHelper::ParamCount(sig);
+  wasm::LinkageLocationAllocator allocator(wasm::kGpParamRegisters,
+                                           wasm::kFpParamRegisters, 0);
+  // The first parameter is the instance, which we don't have to scan. We have
+  // to tell the LinkageLocationAllocator about it though.
+  allocator.Next(MachineRepresentation::kTaggedPointer);
+
+  // Parameters are separated into two groups (first all untagged, then all
+  // tagged parameters). Therefore we first have to iterate over the signature
+  // first to process all untagged parameters, and afterwards we can scan the
+  // tagged parameters.
+  bool has_tagged_param = false;
+  for (size_t i = 0; i < parameter_count; i++) {
+    wasm::ValueType type = wasm::SerializedSignatureHelper::GetParam(sig, i);
+    MachineRepresentation param = type.machine_representation();
+    // Skip tagged parameters (e.g. any-ref).
+    if (IsAnyTagged(param)) {
+      has_tagged_param = true;
+      continue;
+    }
+    if (kSystemPointerSize == 8 || param != MachineRepresentation::kWord64) {
+      allocator.Next(param);
+    } else {
+      allocator.Next(MachineRepresentation::kWord32);
+      allocator.Next(MachineRepresentation::kWord32);
+    }
+  }
+
+  // End the untagged area, so tagged slots come after. This means, especially,
+  // that tagged parameters should not fill holes in the untagged area.
+  allocator.EndSlotArea();
+
+  if (!has_tagged_param) return;
+
+#if V8_TARGET_ARCH_ARM64
+  constexpr size_t size_of_sig = 2;
+#else
+  constexpr size_t size_of_sig = 1;
+#endif
+
+  for (size_t i = 0; i < parameter_count; i++) {
+    wasm::ValueType type = wasm::SerializedSignatureHelper::GetParam(sig, i);
+    MachineRepresentation param = type.machine_representation();
+    // Skip untagged parameters.
+    if (!IsAnyTagged(param)) continue;
+    LinkageLocation l = allocator.Next(param);
+    if (l.IsRegister()) {
+      // Calculate the slot offset.
+      int slot_offset = 0;
+      // We have to do a reverse lookup in the kGPParamRegisters array. This
+      // can be optimized if necessary.
+      for (size_t i = 1; i < arraysize(wasm::kGpParamRegisters); ++i) {
+        if (wasm::kGpParamRegisters[i].code() == l.AsRegister()) {
+          // The first register (the instance) does not get spilled.
+          slot_offset = static_cast<int>(i) - 1;
+          break;
+        }
+      }
+      // Caller FP + return address + signature.
+      size_t param_start_offset = 2 + size_of_sig;
+      FullObjectSlot param_start(fp() +
+                                 param_start_offset * kSystemPointerSize);
+      FullObjectSlot tagged_slot = param_start + slot_offset;
+      VisitSpillSlot(isolate(), v, tagged_slot);
+    } else {
+      // Caller frame slots have negative indices and start at -1. Flip it
+      // back to a positive offset (to be added to the frame's FP to find the
+      // slot).
+      int slot_offset = -l.GetLocation() - 1;
+      // Caller FP + return address + signature + spilled registers (without
+      // the instance register).
+      size_t slots_per_float64 = kDoubleSize / kSystemPointerSize;
+      size_t param_start_offset =
+          arraysize(wasm::kGpParamRegisters) - 1 +
+          (arraysize(wasm::kFpParamRegisters) * slots_per_float64) + 2 +
+          size_of_sig;
+
+      // The wasm-to-js wrapper pushes all but the first gp parameter register
+      // on the stack, so if the number of gp parameter registers is even, this
+      // means that the wrapper pushed an odd number. In that case, and when the
+      // size of a double on the stack is two words, then there is an alignment
+      // word between the pushed gp registers and the pushed fp registers, so
+      // that the whole spill area is double-size aligned.
+      if (arraysize(wasm::kGpParamRegisters) % 2 == (0) &&
+          kSystemPointerSize != kDoubleSize) {
+        param_start_offset++;
+      }
+      FullObjectSlot param_start(fp() +
+                                 param_start_offset * kSystemPointerSize);
+      FullObjectSlot tagged_slot = param_start + slot_offset;
+      VisitSpillSlot(isolate(), v, tagged_slot);
+    }
+  }
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 void TypedFrame::Iterate(RootVisitor* v) const {
@@ -1374,8 +1664,14 @@ void TypedFrame::Iterate(RootVisitor* v) const {
   InnerPointerToCodeCache::InnerPointerToCodeCacheEntry* entry =
       isolate()->inner_pointer_to_code_cache()->GetCacheEntry(inner_pointer);
   CHECK(entry->code.has_value());
-  GcSafeCode code = entry->code.value();
-  DCHECK(code.is_turbofanned());
+  Tagged<GcSafeCode> code = entry->code.value();
+#if V8_ENABLE_WEBASSEMBLY
+  if (code->is_builtin() &&
+      code->builtin_id() == Builtin::kWasmToJsWrapperCSA) {
+    IterateParamsOfWasmToJSWrapper(v);
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
+  DCHECK(code->is_turbofanned());
   SafepointEntry safepoint_entry =
       GetSafepointEntryFromCodeCache(isolate(), inner_pointer, entry);
 
@@ -1388,7 +1684,7 @@ void TypedFrame::Iterate(RootVisitor* v) const {
   // Determine the fixed header and spill slot area size.
   int frame_header_size = TypedFrameConstants::kFixedFrameSizeFromFp;
   int spill_slots_size =
-      code.stack_slots() * kSystemPointerSize -
+      code->stack_slots() * kSystemPointerSize -
       (frame_header_size + StandardFrameConstants::kFixedFrameSizeAboveFp);
 
   // Fixed frame slots.
@@ -1407,7 +1703,7 @@ void TypedFrame::Iterate(RootVisitor* v) const {
   }
 
   // Visit pointer spill slots and locals.
-  DCHECK_GE((code.stack_slots() + kBitsPerByte) / kBitsPerByte,
+  DCHECK_GE((code->stack_slots() + kBitsPerByte) / kBitsPerByte,
             safepoint_entry.tagged_slots().size());
   VisitSpillSlots(isolate(), v, parameters_limit,
                   safepoint_entry.tagged_slots());
@@ -1432,7 +1728,7 @@ void MaglevFrame::Iterate(RootVisitor* v) const {
   //  | pushed_double n |  <-- parameters_limit          ^
   //  |       ...       |                                |
   //  | pushed_double 0 |                                |
-  //  +- - - - - - - - -+                     num_pushed_registers
+  //  +- - - - - - - - -+                     num_extra_spill_slots
   //  |   pushed_reg n  |                                |
   //  |       ...       |                                |
   //  |   pushed_reg 0  |  <-- pushed_register_base      v
@@ -1463,8 +1759,8 @@ void MaglevFrame::Iterate(RootVisitor* v) const {
   InnerPointerToCodeCache::InnerPointerToCodeCacheEntry* entry =
       isolate()->inner_pointer_to_code_cache()->GetCacheEntry(inner_pointer);
   CHECK(entry->code.has_value());
-  GcSafeCode code = entry->code.value();
-  DCHECK(code.is_maglevved());
+  Tagged<GcSafeCode> code = entry->code.value();
+  DCHECK(code->is_maglevved());
   MaglevSafepointEntry maglev_safepoint_entry =
       GetMaglevSafepointEntryFromCodeCache(isolate(), inner_pointer, entry);
 
@@ -1485,17 +1781,17 @@ void MaglevFrame::Iterate(RootVisitor* v) const {
   uint32_t tagged_slot_count = maglev_safepoint_entry.num_tagged_slots();
   uint32_t spill_slot_count =
       tagged_slot_count + maglev_safepoint_entry.num_untagged_slots();
-  DCHECK_EQ(code.stack_slots(),
+  DCHECK_EQ(code->stack_slots(),
             StandardFrameConstants::kFixedSlotCount +
                 maglev_safepoint_entry.num_tagged_slots() +
                 maglev_safepoint_entry.num_untagged_slots());
 
   // Visit the outgoing parameters if they are tagged.
-  DCHECK(code.has_tagged_outgoing_params());
+  DCHECK(code->has_tagged_outgoing_params());
   FullObjectSlot parameters_base(&Memory<Address>(sp()));
   FullObjectSlot parameters_limit =
       frame_header_base - spill_slot_count -
-      maglev_safepoint_entry.num_pushed_registers();
+      maglev_safepoint_entry.num_extra_spill_slots();
   v->VisitRootPointers(Root::kStackRoots, nullptr, parameters_base,
                        parameters_limit);
 
@@ -1503,7 +1799,7 @@ void MaglevFrame::Iterate(RootVisitor* v) const {
   // a call. These are distinct from normal spill slots and live between the
   // normal spill slots and the pushed parameters. Some of these are tagged,
   // as indicated by the tagged register indexes, and should be visited too.
-  if (maglev_safepoint_entry.num_pushed_registers() > 0) {
+  if (maglev_safepoint_entry.num_extra_spill_slots() > 0) {
     FullObjectSlot pushed_register_base =
         frame_header_base - spill_slot_count - 1;
     uint32_t tagged_register_indexes =
@@ -1531,31 +1827,59 @@ void MaglevFrame::Iterate(RootVisitor* v) const {
   IteratePc(v, pc_address(), constant_pool_address(), code);
 }
 
+Handle<JSFunction> MaglevFrame::GetInnermostFunction() const {
+  std::vector<FrameSummary> frames;
+  Summarize(&frames);
+  return frames.back().AsJavaScript().function();
+}
+
 BytecodeOffset MaglevFrame::GetBytecodeOffsetForOSR() const {
   int deopt_index = SafepointEntry::kNoDeoptIndex;
-  const DeoptimizationData data = GetDeoptimizationData(&deopt_index);
+  const Tagged<DeoptimizationData> data = GetDeoptimizationData(&deopt_index);
   if (deopt_index == SafepointEntry::kNoDeoptIndex) {
     CHECK(data.is_null());
     FATAL("Missing deoptimization information for OptimizedFrame::Summarize.");
   }
 
-  return data.GetBytecodeOffset(deopt_index);
+  DeoptimizationFrameTranslation::Iterator it(
+      data->FrameTranslation(), data->TranslationIndex(deopt_index).value());
+  // Search the innermost interpreter frame and get its bailout id. The
+  // translation stores frames bottom up.
+  int js_frames = it.EnterBeginOpcode().js_frame_count;
+  DCHECK_GT(js_frames, 0);
+  BytecodeOffset offset = BytecodeOffset::None();
+  while (js_frames > 0) {
+    TranslationOpcode frame = it.SeekNextJSFrame();
+    --js_frames;
+    if (IsTranslationInterpreterFrameOpcode(frame)) {
+      offset = BytecodeOffset(it.NextOperand());
+      it.SkipOperands(TranslationOpcodeOperandCount(frame) - 1);
+    } else {
+      it.SkipOperands(TranslationOpcodeOperandCount(frame));
+    }
+  }
+
+  return offset;
 }
 
-bool CommonFrame::HasTaggedOutgoingParams(GcSafeCode code_lookup) const {
+bool CommonFrame::HasTaggedOutgoingParams(
+    Tagged<GcSafeCode> code_lookup) const {
 #if V8_ENABLE_WEBASSEMBLY
   // With inlined JS-to-Wasm calls, we can be in an OptimizedFrame and
-  // directly call a Wasm function from JavaScript. In this case the
-  // parameters we pass to the callee are not tagged.
+  // directly call a Wasm function from JavaScript. In this case the Wasm frame
+  // is responsible for visiting incoming potentially tagged parameters.
+  // (This is required for tail-call support: If the direct callee tail-called
+  // another function which then caused a GC, the caller would not be able to
+  // determine where there might be tagged parameters.)
   wasm::WasmCode* wasm_callee =
       wasm::GetWasmCodeManager()->LookupCode(callee_pc());
-  return (wasm_callee == nullptr) && code_lookup.has_tagged_outgoing_params();
+  return (wasm_callee == nullptr) && code_lookup->has_tagged_outgoing_params();
 #else
-  return code_lookup.has_tagged_outgoing_params();
+  return code_lookup->has_tagged_outgoing_params();
 #endif  // V8_ENABLE_WEBASSEMBLY
 }
 
-HeapObject TurbofanStubWithContextFrame::unchecked_code() const {
+Tagged<HeapObject> TurbofanStubWithContextFrame::unchecked_code() const {
   base::Optional<GcSafeCode> code_lookup =
       isolate()->heap()->GcSafeTryFindCodeForInnerPointer(pc());
   if (!code_lookup.has_value()) return {};
@@ -1593,8 +1917,8 @@ void CommonFrame::IterateTurbofanOptimizedFrame(RootVisitor* v) const {
   InnerPointerToCodeCache::InnerPointerToCodeCacheEntry* entry =
       isolate()->inner_pointer_to_code_cache()->GetCacheEntry(inner_pointer);
   CHECK(entry->code.has_value());
-  GcSafeCode code = entry->code.value();
-  DCHECK(code.is_turbofanned());
+  Tagged<GcSafeCode> code = entry->code.value();
+  DCHECK(code->is_turbofanned());
   SafepointEntry safepoint_entry =
       GetSafepointEntryFromCodeCache(isolate(), inner_pointer, entry);
 
@@ -1608,7 +1932,7 @@ void CommonFrame::IterateTurbofanOptimizedFrame(RootVisitor* v) const {
   // Determine the fixed header and spill slot area size.
   int frame_header_size = StandardFrameConstants::kFixedFrameSizeFromFp;
   int spill_slot_count =
-      code.stack_slots() - StandardFrameConstants::kFixedSlotCount;
+      code->stack_slots() - StandardFrameConstants::kFixedSlotCount;
 
   // Fixed frame slots.
   FullObjectSlot frame_header_base(&Memory<Address>(fp() - frame_header_size));
@@ -1626,7 +1950,7 @@ void CommonFrame::IterateTurbofanOptimizedFrame(RootVisitor* v) const {
 
   // Spill slots are in the region ]frame_header_base, parameters_limit];
   // Visit pointer spill slots and locals.
-  DCHECK_GE((code.stack_slots() + kBitsPerByte) / kBitsPerByte,
+  DCHECK_GE((code->stack_slots() + kBitsPerByte) / kBitsPerByte,
             safepoint_entry.tagged_slots().size());
   VisitSpillSlots(isolate(), v, parameters_limit,
                   safepoint_entry.tagged_slots());
@@ -1648,7 +1972,7 @@ void TurbofanFrame::Iterate(RootVisitor* v) const {
   return IterateTurbofanOptimizedFrame(v);
 }
 
-HeapObject StubFrame::unchecked_code() const {
+Tagged<HeapObject> StubFrame::unchecked_code() const {
   base::Optional<GcSafeCode> code_lookup =
       isolate()->heap()->GcSafeTryFindCodeForInnerPointer(pc());
   if (!code_lookup.has_value()) return {};
@@ -1656,15 +1980,38 @@ HeapObject StubFrame::unchecked_code() const {
 }
 
 int StubFrame::LookupExceptionHandlerInTable() {
-  Code code = LookupCode();
-  DCHECK(code.is_turbofanned());
-  DCHECK_EQ(code.kind(), CodeKind::BUILTIN);
+  Tagged<Code> code = LookupCode();
+  DCHECK(code->is_turbofanned());
+  DCHECK(code->has_handler_table());
   HandlerTable table(code);
-  int pc_offset = code.GetOffsetFromInstructionStart(isolate(), pc());
+  int pc_offset = code->GetOffsetFromInstructionStart(isolate(), pc());
   return table.LookupReturn(pc_offset);
 }
 
-void JavaScriptFrame::SetParameterValue(int index, Object value) const {
+void StubFrame::Summarize(std::vector<FrameSummary>* frames) const {
+#if V8_ENABLE_WEBASSEMBLY
+  Tagged<Code> code = LookupCode();
+  if (code->kind() != CodeKind::BUILTIN) return;
+  // We skip most stub frames from stack traces, but a few builtins
+  // specifically exist to pretend to be another builtin throwing an
+  // exception.
+  switch (code->builtin_id()) {
+    case Builtin::kThrowIndexOfCalledOnNull:
+    case Builtin::kThrowToLowerCaseCalledOnNull:
+    case Builtin::kWasmIntToString: {
+      // When adding builtins here, also implement naming support for them.
+      DCHECK_NE(nullptr, Builtins::NameForStackTrace(code->builtin_id()));
+      FrameSummary::BuiltinFrameSummary summary(isolate(), code->builtin_id());
+      frames->push_back(summary);
+      break;
+    }
+    default:
+      break;
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
+}
+
+void JavaScriptFrame::SetParameterValue(int index, Tagged<Object> value) const {
   Memory<Address>(GetParameterSlot(index)) = value.ptr();
 }
 
@@ -1672,12 +2019,12 @@ bool JavaScriptFrame::IsConstructor() const {
   return IsConstructFrame(caller_fp());
 }
 
-HeapObject CommonFrameWithJSLinkage::unchecked_code() const {
-  return function().code();
+Tagged<HeapObject> CommonFrameWithJSLinkage::unchecked_code() const {
+  return function()->code();
 }
 
 int TurbofanFrame::ComputeParametersCount() const {
-  if (GcSafeLookupCode().kind() == CodeKind::BUILTIN) {
+  if (GcSafeLookupCode()->kind() == CodeKind::BUILTIN) {
     return static_cast<int>(
                Memory<intptr_t>(fp() + StandardFrameConstants::kArgCOffset)) -
            kJSArgcReceiverSlots;
@@ -1693,7 +2040,7 @@ Address JavaScriptFrame::GetCallerStackPointer() const {
 void JavaScriptFrame::GetFunctions(
     std::vector<SharedFunctionInfo>* functions) const {
   DCHECK(functions->empty());
-  functions->push_back(function().shared());
+  functions->push_back(function()->shared());
 }
 
 void JavaScriptFrame::GetFunctions(
@@ -1703,7 +2050,7 @@ void JavaScriptFrame::GetFunctions(
   GetFunctions(&raw_functions);
   for (const auto& raw_function : raw_functions) {
     functions->push_back(
-        Handle<SharedFunctionInfo>(raw_function, function().GetIsolate()));
+        Handle<SharedFunctionInfo>(raw_function, function()->GetIsolate()));
   }
 }
 
@@ -1714,10 +2061,10 @@ bool CommonFrameWithJSLinkage::IsConstructor() const {
 void CommonFrameWithJSLinkage::Summarize(
     std::vector<FrameSummary>* functions) const {
   DCHECK(functions->empty());
-  GcSafeCode code = GcSafeLookupCode();
-  int offset = code.GetOffsetFromInstructionStart(isolate(), pc());
+  Tagged<GcSafeCode> code = GcSafeLookupCode();
+  int offset = code->GetOffsetFromInstructionStart(isolate(), pc());
   Handle<AbstractCode> abstract_code(
-      AbstractCode::cast(code.UnsafeCastToCode()), isolate());
+      AbstractCode::cast(code->UnsafeCastToCode()), isolate());
   Handle<FixedArray> params = GetParameters();
   FrameSummary::JavaScriptFrameSummary summary(
       isolate(), receiver(), function(), *abstract_code, offset,
@@ -1725,63 +2072,66 @@ void CommonFrameWithJSLinkage::Summarize(
   functions->push_back(summary);
 }
 
-JSFunction JavaScriptFrame::function() const {
+Tagged<JSFunction> JavaScriptFrame::function() const {
   return JSFunction::cast(function_slot_object());
 }
 
-Object JavaScriptFrame::unchecked_function() const {
+Tagged<Object> JavaScriptFrame::unchecked_function() const {
   // During deoptimization of an optimized function, we may have yet to
   // materialize some closures on the stack. The arguments marker object
   // marks this case.
-  DCHECK(function_slot_object().IsJSFunction() ||
+  DCHECK(IsJSFunction(function_slot_object()) ||
          ReadOnlyRoots(isolate()).arguments_marker() == function_slot_object());
   return function_slot_object();
 }
 
-Object CommonFrameWithJSLinkage::receiver() const { return GetParameter(-1); }
+Tagged<Object> CommonFrameWithJSLinkage::receiver() const {
+  // TODO(cbruni): document this better
+  return GetParameter(-1);
+}
 
-Object JavaScriptFrame::context() const {
+Tagged<Object> JavaScriptFrame::context() const {
   const int offset = StandardFrameConstants::kContextOffset;
-  Object maybe_result(Memory<Address>(fp() + offset));
-  DCHECK(!maybe_result.IsSmi());
+  Tagged<Object> maybe_result(Memory<Address>(fp() + offset));
+  DCHECK(!IsSmi(maybe_result));
   return maybe_result;
 }
 
-Script JavaScriptFrame::script() const {
-  return Script::cast(function().shared().script());
+Tagged<Script> JavaScriptFrame::script() const {
+  return Script::cast(function()->shared()->script());
 }
 
 int CommonFrameWithJSLinkage::LookupExceptionHandlerInTable(
     int* stack_depth, HandlerTable::CatchPrediction* prediction) {
   if (DEBUG_BOOL) {
-    Code code_lookup_result = LookupCode();
-    CHECK(!code_lookup_result.has_handler_table());
-    CHECK(!code_lookup_result.is_optimized_code() ||
-          code_lookup_result.kind() == CodeKind::BASELINE);
+    Tagged<Code> code_lookup_result = LookupCode();
+    CHECK(!code_lookup_result->has_handler_table());
+    CHECK(!code_lookup_result->is_optimized_code() ||
+          code_lookup_result->kind() == CodeKind::BASELINE);
   }
   return -1;
 }
 
-void JavaScriptFrame::PrintFunctionAndOffset(JSFunction function,
-                                             AbstractCode code, int code_offset,
-                                             FILE* file,
+void JavaScriptFrame::PrintFunctionAndOffset(Tagged<JSFunction> function,
+                                             Tagged<AbstractCode> code,
+                                             int code_offset, FILE* file,
                                              bool print_line_number) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(function);
-  PrintF(file, "%s", CodeKindToMarker(code.kind(cage_base)));
-  function.PrintName(file);
+  PrintF(file, "%s", CodeKindToMarker(code->kind(cage_base)));
+  function->PrintName(file);
   PrintF(file, "+%d", code_offset);
   if (print_line_number) {
-    SharedFunctionInfo shared = function.shared();
-    int source_pos = code.SourcePosition(cage_base, code_offset);
-    Object maybe_script = shared.script();
-    if (maybe_script.IsScript()) {
-      Script script = Script::cast(maybe_script);
-      int line = script.GetLineNumber(source_pos) + 1;
-      Object script_name_raw = script.name();
-      if (script_name_raw.IsString()) {
-        String script_name = String::cast(script.name());
+    Tagged<SharedFunctionInfo> shared = function->shared();
+    int source_pos = code->SourcePosition(cage_base, code_offset);
+    Tagged<Object> maybe_script = shared->script();
+    if (IsScript(maybe_script)) {
+      Tagged<Script> script = Script::cast(maybe_script);
+      int line = script->GetLineNumber(source_pos) + 1;
+      Tagged<Object> script_name_raw = script->name();
+      if (IsString(script_name_raw)) {
+        Tagged<String> script_name = String::cast(script->name());
         std::unique_ptr<char[]> c_script_name =
-            script_name.ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL);
+            script_name->ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL);
         PrintF(file, " at %s:%d", c_script_name.get(), line);
       } else {
         PrintF(file, " at <unknown>:%d", line);
@@ -1801,9 +2151,9 @@ void JavaScriptFrame::PrintTop(Isolate* isolate, FILE* file, bool print_args,
     if (it.frame()->is_java_script()) {
       JavaScriptFrame* frame = it.frame();
       if (frame->IsConstructor()) PrintF(file, "new ");
-      JSFunction function = frame->function();
+      Tagged<JSFunction> function = frame->function();
       int code_offset = 0;
-      AbstractCode abstract_code = function.abstract_code(isolate);
+      Tagged<AbstractCode> abstract_code = function->abstract_code(isolate);
       if (frame->is_interpreted()) {
         InterpretedFrame* iframe = reinterpret_cast<InterpretedFrame*>(frame);
         code_offset = iframe->GetBytecodeOffset();
@@ -1813,7 +2163,7 @@ void JavaScriptFrame::PrintTop(Isolate* isolate, FILE* file, bool print_args,
         code_offset = baseline_frame->GetBytecodeOffset();
         abstract_code = AbstractCode::cast(baseline_frame->GetBytecodeArray());
       } else {
-        code_offset = frame->LookupCode().GetOffsetFromInstructionStart(
+        code_offset = frame->LookupCode()->GetOffsetFromInstructionStart(
             isolate, frame->pc());
       }
       PrintFunctionAndOffset(function, abstract_code, code_offset, file,
@@ -1823,11 +2173,11 @@ void JavaScriptFrame::PrintTop(Isolate* isolate, FILE* file, bool print_args,
         // (we are intentionally only printing the actually
         // supplied parameters, not all parameters required)
         PrintF(file, "(this=");
-        frame->receiver().ShortPrint(file);
+        ShortPrint(frame->receiver(), file);
         const int length = frame->ComputeParametersCount();
         for (int i = 0; i < length; i++) {
           PrintF(file, ", ");
-          frame->GetParameter(i).ShortPrint(file);
+          ShortPrint(frame->GetParameter(i), file);
         }
         PrintF(file, ")");
       }
@@ -1838,35 +2188,38 @@ void JavaScriptFrame::PrintTop(Isolate* isolate, FILE* file, bool print_args,
 }
 
 // static
-void JavaScriptFrame::CollectFunctionAndOffsetForICStats(JSFunction function,
-                                                         AbstractCode code,
-                                                         int code_offset) {
+void JavaScriptFrame::CollectFunctionAndOffsetForICStats(
+    Tagged<JSFunction> function, Tagged<AbstractCode> code, int code_offset) {
   auto ic_stats = ICStats::instance();
   ICInfo& ic_info = ic_stats->Current();
   PtrComprCageBase cage_base = GetPtrComprCageBase(function);
-  SharedFunctionInfo shared = function.shared(cage_base);
+  Tagged<SharedFunctionInfo> shared = function->shared(cage_base);
 
   ic_info.function_name = ic_stats->GetOrCacheFunctionName(function);
   ic_info.script_offset = code_offset;
 
-  int source_pos = code.SourcePosition(cage_base, code_offset);
-  Object maybe_script = shared.script(cage_base);
-  if (maybe_script.IsScript(cage_base)) {
-    Script script = Script::cast(maybe_script);
-    ic_info.line_num = script.GetLineNumber(source_pos) + 1;
-    ic_info.column_num = script.GetColumnNumber(source_pos);
+  int source_pos = code->SourcePosition(cage_base, code_offset);
+  Tagged<Object> maybe_script = shared->script(cage_base, kAcquireLoad);
+  if (IsScript(maybe_script, cage_base)) {
+    Tagged<Script> script = Script::cast(maybe_script);
+    Script::PositionInfo info;
+    script->GetPositionInfo(source_pos, &info);
+    ic_info.line_num = info.line + 1;
+    ic_info.column_num = info.column + 1;
     ic_info.script_name = ic_stats->GetOrCacheScriptName(script);
   }
 }
 
-Object CommonFrameWithJSLinkage::GetParameter(int index) const {
+Tagged<Object> CommonFrameWithJSLinkage::GetParameter(int index) const {
   return Object(Memory<Address>(GetParameterSlot(index)));
 }
 
 int CommonFrameWithJSLinkage::ComputeParametersCount() const {
   DCHECK(!iterator_->IsStackFrameIteratorForProfiler() &&
          isolate()->heap()->gc_state() == Heap::NOT_IN_GC);
-  return function().shared().internal_formal_parameter_count_without_receiver();
+  return function()
+      ->shared()
+      ->internal_formal_parameter_count_without_receiver();
 }
 
 int JavaScriptFrame::GetActualArgumentCount() const {
@@ -1889,7 +2242,7 @@ Handle<FixedArray> CommonFrameWithJSLinkage::GetParameters() const {
   return parameters;
 }
 
-JSFunction JavaScriptBuiltinContinuationFrame::function() const {
+Tagged<JSFunction> JavaScriptBuiltinContinuationFrame::function() const {
   const int offset = BuiltinContinuationFrameConstants::kFunctionOffset;
   return JSFunction::cast(Object(base::Memory<Address>(fp() + offset)));
 }
@@ -1899,7 +2252,7 @@ int JavaScriptBuiltinContinuationFrame::ComputeParametersCount() const {
   // register.
   DCHECK_EQ(RegisterConfiguration::Default()->GetAllocatableGeneralCode(0),
             kJavaScriptCallArgCountRegister.code());
-  Object argc_object(
+  Tagged<Object> argc_object(
       Memory<Address>(fp() + BuiltinContinuationFrameConstants::kArgCOffset));
   return Smi::ToInt(argc_object) - kJSArgcReceiverSlots;
 }
@@ -1911,13 +2264,13 @@ intptr_t JavaScriptBuiltinContinuationFrame::GetSPToFPDelta() const {
   return height;
 }
 
-Object JavaScriptBuiltinContinuationFrame::context() const {
+Tagged<Object> JavaScriptBuiltinContinuationFrame::context() const {
   return Object(Memory<Address>(
       fp() + BuiltinContinuationFrameConstants::kBuiltinContextOffset));
 }
 
 void JavaScriptBuiltinContinuationWithCatchFrame::SetException(
-    Object exception) {
+    Tagged<Object> exception) {
   int argc = ComputeParametersCount();
   Address exception_argument_slot =
       fp() + BuiltinContinuationFrameConstants::kFixedFrameSizeAboveFp +
@@ -1930,9 +2283,9 @@ void JavaScriptBuiltinContinuationWithCatchFrame::SetException(
 }
 
 FrameSummary::JavaScriptFrameSummary::JavaScriptFrameSummary(
-    Isolate* isolate, Object receiver, JSFunction function,
-    AbstractCode abstract_code, int code_offset, bool is_constructor,
-    FixedArray parameters)
+    Isolate* isolate, Tagged<Object> receiver, Tagged<JSFunction> function,
+    Tagged<AbstractCode> abstract_code, int code_offset, bool is_constructor,
+    Tagged<FixedArray> parameters)
     : FrameSummaryBase(isolate, FrameSummary::JAVA_SCRIPT),
       receiver_(receiver, isolate),
       function_(function, isolate),
@@ -1940,7 +2293,7 @@ FrameSummary::JavaScriptFrameSummary::JavaScriptFrameSummary(
       code_offset_(code_offset),
       is_constructor_(is_constructor),
       parameters_(parameters, isolate) {
-  DCHECK(!CodeKindIsOptimizedJSFunction(abstract_code.kind(isolate)));
+  DCHECK(!CodeKindIsOptimizedJSFunction(abstract_code->kind(isolate)));
 }
 
 void FrameSummary::EnsureSourcePositionsAvailable() {
@@ -1965,12 +2318,12 @@ bool FrameSummary::JavaScriptFrameSummary::AreSourcePositionsAvailable() const {
   return !v8_flags.enable_lazy_source_positions ||
          function()
              ->shared()
-             .GetBytecodeArray(isolate())
-             .HasSourcePositionTable();
+             ->GetBytecodeArray(isolate())
+             ->HasSourcePositionTable();
 }
 
 bool FrameSummary::JavaScriptFrameSummary::is_subject_to_debugging() const {
-  return function()->shared().IsSubjectToDebugging();
+  return function()->shared()->IsSubjectToDebugging();
 }
 
 int FrameSummary::JavaScriptFrameSummary::SourcePosition() const {
@@ -1982,7 +2335,7 @@ int FrameSummary::JavaScriptFrameSummary::SourceStatementPosition() const {
 }
 
 Handle<Object> FrameSummary::JavaScriptFrameSummary::script() const {
-  return handle(function_->shared().script(), isolate());
+  return handle(function_->shared()->script(), isolate());
 }
 
 Handle<Context> FrameSummary::JavaScriptFrameSummary::native_context() const {
@@ -1995,7 +2348,7 @@ FrameSummary::JavaScriptFrameSummary::CreateStackFrameInfo() const {
   Handle<Script> script(Script::cast(shared->script()), isolate());
   Handle<String> function_name = JSFunction::GetDebugName(function_);
   if (function_name->length() == 0 &&
-      script->compilation_type() == Script::COMPILATION_TYPE_EVAL) {
+      script->compilation_type() == Script::CompilationType::kEval) {
     function_name = isolate()->factory()->eval_string();
   }
   int bytecode_offset = code_offset();
@@ -2035,13 +2388,13 @@ uint32_t FrameSummary::WasmFrameSummary::function_index() const {
 }
 
 int FrameSummary::WasmFrameSummary::SourcePosition() const {
-  const wasm::WasmModule* module = wasm_instance()->module_object().module();
+  const wasm::WasmModule* module = wasm_instance()->module_object()->module();
   return GetSourcePosition(module, function_index(), code_offset(),
                            at_to_number_conversion());
 }
 
 Handle<Script> FrameSummary::WasmFrameSummary::script() const {
-  return handle(wasm_instance()->module_object().script(),
+  return handle(wasm_instance()->module_object()->script(),
                 wasm_instance()->GetIsolate());
 }
 
@@ -2056,6 +2409,69 @@ Handle<StackFrameInfo> FrameSummary::WasmFrameSummary::CreateStackFrameInfo()
   return isolate()->factory()->NewStackFrameInfo(script(), SourcePosition(),
                                                  function_name, false);
 }
+
+FrameSummary::WasmInlinedFrameSummary::WasmInlinedFrameSummary(
+    Isolate* isolate, Handle<WasmInstanceObject> instance, int function_index,
+    int op_wire_bytes_offset)
+    : FrameSummaryBase(isolate, WASM_INLINED),
+      wasm_instance_(instance),
+      function_index_(function_index),
+      op_wire_bytes_offset_(op_wire_bytes_offset) {}
+
+Handle<Object> FrameSummary::WasmInlinedFrameSummary::receiver() const {
+  return wasm_instance_->GetIsolate()->global_proxy();
+}
+
+uint32_t FrameSummary::WasmInlinedFrameSummary::function_index() const {
+  return function_index_;
+}
+
+int FrameSummary::WasmInlinedFrameSummary::SourcePosition() const {
+  const wasm::WasmModule* module = wasm_instance()->module_object()->module();
+  return GetSourcePosition(module, function_index(), code_offset(), false);
+}
+
+Handle<Script> FrameSummary::WasmInlinedFrameSummary::script() const {
+  return handle(wasm_instance()->module_object()->script(),
+                wasm_instance()->GetIsolate());
+}
+
+Handle<Context> FrameSummary::WasmInlinedFrameSummary::native_context() const {
+  return handle(wasm_instance()->native_context(), isolate());
+}
+
+Handle<StackFrameInfo>
+FrameSummary::WasmInlinedFrameSummary::CreateStackFrameInfo() const {
+  Handle<String> function_name =
+      GetWasmFunctionDebugName(isolate(), wasm_instance(), function_index());
+  return isolate()->factory()->NewStackFrameInfo(script(), SourcePosition(),
+                                                 function_name, false);
+}
+
+FrameSummary::BuiltinFrameSummary::BuiltinFrameSummary(Isolate* isolate,
+                                                       Builtin builtin)
+    : FrameSummaryBase(isolate, FrameSummary::BUILTIN), builtin_(builtin) {}
+
+Handle<Object> FrameSummary::BuiltinFrameSummary::receiver() const {
+  return isolate()->factory()->undefined_value();
+}
+
+Handle<Object> FrameSummary::BuiltinFrameSummary::script() const {
+  return isolate()->factory()->undefined_value();
+}
+
+Handle<Context> FrameSummary::BuiltinFrameSummary::native_context() const {
+  return isolate()->native_context();
+}
+
+Handle<StackFrameInfo> FrameSummary::BuiltinFrameSummary::CreateStackFrameInfo()
+    const {
+  Handle<String> name_str = isolate()->factory()->NewStringFromAsciiChecked(
+      Builtins::NameForStackTrace(builtin_));
+  return isolate()->factory()->NewStackFrameInfo(
+      Handle<HeapObject>::cast(script()), SourcePosition(), name_str, false);
+}
+
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 FrameSummary::~FrameSummary() {
@@ -2098,16 +2514,20 @@ FrameSummary FrameSummary::Get(const CommonFrame* frame, int index) {
 }
 
 #if V8_ENABLE_WEBASSEMBLY
-#define FRAME_SUMMARY_DISPATCH(ret, name)   \
-  ret FrameSummary::name() const {          \
-    switch (base_.kind()) {                 \
-      case JAVA_SCRIPT:                     \
-        return java_script_summary_.name(); \
-      case WASM:                            \
-        return wasm_summary_.name();        \
-      default:                              \
-        UNREACHABLE();                      \
-    }                                       \
+#define FRAME_SUMMARY_DISPATCH(ret, name)    \
+  ret FrameSummary::name() const {           \
+    switch (base_.kind()) {                  \
+      case JAVA_SCRIPT:                      \
+        return java_script_summary_.name();  \
+      case WASM:                             \
+        return wasm_summary_.name();         \
+      case WASM_INLINED:                     \
+        return wasm_inlined_summary_.name(); \
+      case BUILTIN:                          \
+        return builtin_summary_.name();      \
+      default:                               \
+        UNREACHABLE();                       \
+    }                                        \
   }
 #else
 #define FRAME_SUMMARY_DISPATCH(ret, name) \
@@ -2135,13 +2555,13 @@ void OptimizedFrame::Summarize(std::vector<FrameSummary>* frames) const {
 
   // Delegate to JS frame in absence of deoptimization info.
   // TODO(turbofan): Revisit once we support deoptimization across the board.
-  GcSafeCode code = GcSafeLookupCode();
-  if (code.kind() == CodeKind::BUILTIN) {
+  Handle<GcSafeCode> code(GcSafeLookupCode(), isolate());
+  if (code->kind() == CodeKind::BUILTIN) {
     return JavaScriptFrame::Summarize(frames);
   }
 
   int deopt_index = SafepointEntry::kNoDeoptIndex;
-  DeoptimizationData const data = GetDeoptimizationData(&deopt_index);
+  Tagged<DeoptimizationData> const data = GetDeoptimizationData(&deopt_index);
   if (deopt_index == SafepointEntry::kNoDeoptIndex) {
     // Hack: For maglevved function entry, we don't emit lazy deopt information,
     // so create an extra special summary here.
@@ -2150,20 +2570,10 @@ void OptimizedFrame::Summarize(std::vector<FrameSummary>* frames) const {
     // summary which is a bit more aware of maglev behaviour and can e.g. handle
     // more compact safepointed frame information for both function entry and
     // loop stack checks.
-    //
-    // TODO(7748): For JS functions containing inlined wasm we need support to
-    // create a frame summary for the wasm function as well which is needed for
-    // wasm trap stack traces. Also, the current hack does not preserve the code
-    // position in the JavaScript frame.
-    if (code.is_maglevved()
-#if V8_ENABLE_WEBASSEMBLY
-        || ((code.kind() == CodeKind::TURBOFAN) &&
-            v8_flags.experimental_wasm_js_inlining)
-#endif
-    ) {
+    if (code->is_maglevved()) {
       DCHECK(frames->empty());
       Handle<AbstractCode> abstract_code(
-          AbstractCode::cast(function().shared().GetBytecodeArray(isolate())),
+          AbstractCode::cast(function()->shared()->GetBytecodeArray(isolate())),
           isolate());
       Handle<FixedArray> params = GetParameters();
       FrameSummary::JavaScriptFrameSummary summary(
@@ -2232,10 +2642,25 @@ void OptimizedFrame::Summarize(std::vector<FrameSummary>* frames) const {
           is_constructor, *params);
       frames->push_back(summary);
       is_constructor = false;
-    } else if (it->kind() == TranslatedFrame::kConstructStub) {
+    } else if (it->kind() == TranslatedFrame::kConstructCreateStub ||
+               it->kind() == TranslatedFrame::kConstructInvokeStub) {
       // The next encountered JS frame will be marked as a constructor call.
       DCHECK(!is_constructor);
       is_constructor = true;
+#if V8_ENABLE_WEBASSEMBLY
+    } else if (it->kind() == TranslatedFrame::kWasmInlinedIntoJS) {
+      Handle<SharedFunctionInfo> shared_info = it->shared_info();
+      DCHECK_NE(isolate()->heap()->gc_state(), Heap::MARK_COMPACT);
+
+      Tagged<WasmExportedFunctionData> function_data =
+          shared_info->wasm_exported_function_data();
+      Handle<WasmInstanceObject> instance =
+          handle(function_data->instance(), isolate());
+      int func_index = function_data->function_index();
+      FrameSummary::WasmInlinedFrameSummary summary(
+          isolate(), instance, func_index, it->bytecode_offset().ToInt());
+      frames->push_back(summary);
+#endif  // V8_ENABLE_WEBASSEMBLY
     }
   }
 }
@@ -2246,68 +2671,70 @@ int OptimizedFrame::LookupExceptionHandlerInTable(
   // to use FrameSummary to find the corresponding code offset in unoptimized
   // code to perform prediction there.
   DCHECK_NULL(prediction);
-  Code code = LookupCode();
+  Tagged<Code> code = LookupCode();
 
   HandlerTable table(code);
   if (table.NumberOfReturnEntries() == 0) return -1;
 
-  int pc_offset = code.GetOffsetFromInstructionStart(isolate(), pc());
+  int pc_offset = code->GetOffsetFromInstructionStart(isolate(), pc());
   DCHECK_NULL(data);  // Data is not used and will not return a value.
 
   // When the return pc has been replaced by a trampoline there won't be
   // a handler for this trampoline. Thus we need to use the return pc that
   // _used to be_ on the stack to get the right ExceptionHandler.
-  if (CodeKindCanDeoptimize(code.kind()) && code.marked_for_deoptimization()) {
+  if (CodeKindCanDeoptimize(code->kind()) &&
+      code->marked_for_deoptimization()) {
     pc_offset = FindReturnPCForTrampoline(code, pc_offset);
   }
   return table.LookupReturn(pc_offset);
 }
 
-int MaglevFrame::FindReturnPCForTrampoline(Code code, int trampoline_pc) const {
-  DCHECK_EQ(code.kind(), CodeKind::MAGLEV);
-  DCHECK(code.marked_for_deoptimization());
+int MaglevFrame::FindReturnPCForTrampoline(Tagged<Code> code,
+                                           int trampoline_pc) const {
+  DCHECK_EQ(code->kind(), CodeKind::MAGLEV);
+  DCHECK(code->marked_for_deoptimization());
   MaglevSafepointTable safepoints(isolate(), pc(), code);
   return safepoints.find_return_pc(trampoline_pc);
 }
 
-int TurbofanFrame::FindReturnPCForTrampoline(Code code,
+int TurbofanFrame::FindReturnPCForTrampoline(Tagged<Code> code,
                                              int trampoline_pc) const {
-  DCHECK_EQ(code.kind(), CodeKind::TURBOFAN);
-  DCHECK(code.marked_for_deoptimization());
+  DCHECK_EQ(code->kind(), CodeKind::TURBOFAN);
+  DCHECK(code->marked_for_deoptimization());
   SafepointTable safepoints(isolate(), pc(), code);
   return safepoints.find_return_pc(trampoline_pc);
 }
 
-DeoptimizationData OptimizedFrame::GetDeoptimizationData(
+Tagged<DeoptimizationData> OptimizedFrame::GetDeoptimizationData(
     int* deopt_index) const {
   DCHECK(is_optimized());
 
-  JSFunction opt_function = function();
-  Code code = opt_function.code();
+  Tagged<JSFunction> opt_function = function();
+  Tagged<Code> code = opt_function->code();
 
   // The code object may have been replaced by lazy deoptimization. Fall back
   // to a slow search in this case to find the original optimized code object.
-  if (!code.contains(isolate(), pc())) {
+  if (!code->contains(isolate(), pc())) {
     code = isolate()
                ->heap()
                ->GcSafeFindCodeForInnerPointer(pc())
-               .UnsafeCastToCode();
+               ->UnsafeCastToCode();
   }
   DCHECK(!code.is_null());
-  DCHECK(CodeKindCanDeoptimize(code.kind()));
+  DCHECK(CodeKindCanDeoptimize(code->kind()));
 
-  if (code.is_maglevved()) {
+  if (code->is_maglevved()) {
     MaglevSafepointEntry safepoint_entry =
-        code.GetMaglevSafepointEntry(isolate(), pc());
+        code->GetMaglevSafepointEntry(isolate(), pc());
     if (safepoint_entry.has_deoptimization_index()) {
       *deopt_index = safepoint_entry.deoptimization_index();
-      return DeoptimizationData::cast(code.deoptimization_data());
+      return DeoptimizationData::cast(code->deoptimization_data());
     }
   } else {
-    SafepointEntry safepoint_entry = code.GetSafepointEntry(isolate(), pc());
+    SafepointEntry safepoint_entry = code->GetSafepointEntry(isolate(), pc());
     if (safepoint_entry.has_deoptimization_index()) {
       *deopt_index = safepoint_entry.deoptimization_index();
-      return DeoptimizationData::cast(code.deoptimization_data());
+      return DeoptimizationData::cast(code->deoptimization_data());
     }
   }
   *deopt_index = SafepointEntry::kNoDeoptIndex;
@@ -2321,48 +2748,35 @@ void OptimizedFrame::GetFunctions(
 
   // Delegate to JS frame in absence of turbofan deoptimization.
   // TODO(turbofan): Revisit once we support deoptimization across the board.
-  Code code = LookupCode();
-  if (code.kind() == CodeKind::BUILTIN) {
+  Tagged<Code> code = LookupCode();
+  if (code->kind() == CodeKind::BUILTIN) {
     return JavaScriptFrame::GetFunctions(functions);
   }
 
   DisallowGarbageCollection no_gc;
   int deopt_index = SafepointEntry::kNoDeoptIndex;
-  DeoptimizationData const data = GetDeoptimizationData(&deopt_index);
+  Tagged<DeoptimizationData> const data = GetDeoptimizationData(&deopt_index);
   DCHECK(!data.is_null());
   DCHECK_NE(SafepointEntry::kNoDeoptIndex, deopt_index);
-  DeoptimizationLiteralArray const literal_array = data.LiteralArray();
+  Tagged<DeoptimizationLiteralArray> const literal_array = data->LiteralArray();
 
-  TranslationArrayIterator it(data.TranslationByteArray(),
-                              data.TranslationIndex(deopt_index).value());
-  TranslationOpcode opcode = it.NextOpcode();
-  DCHECK(TranslationOpcodeIsBegin(opcode));
-  it.NextOperand();  // Skip lookback distance.
-  it.NextOperand();  // Skip frame count.
-  int jsframe_count = it.NextOperand();
+  DeoptimizationFrameTranslation::Iterator it(
+      data->FrameTranslation(), data->TranslationIndex(deopt_index).value());
+  int jsframe_count = it.EnterBeginOpcode().js_frame_count;
 
   // We insert the frames in reverse order because the frames
   // in the deoptimization translation are ordered bottom-to-top.
   while (jsframe_count != 0) {
-    opcode = it.NextOpcode();
-    if (opcode == TranslationOpcode::INTERPRETED_FRAME_WITH_RETURN ||
-        opcode == TranslationOpcode::INTERPRETED_FRAME_WITHOUT_RETURN ||
-        opcode == TranslationOpcode::JAVA_SCRIPT_BUILTIN_CONTINUATION_FRAME ||
-        opcode == TranslationOpcode::
-                      JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH_FRAME) {
-      it.NextOperand();  // Skip bailout id.
-      jsframe_count--;
-
-      // The second operand of the frame points to the function.
-      Object shared = literal_array.get(it.NextOperand());
-      functions->push_back(SharedFunctionInfo::cast(shared));
-
-      // Skip over remaining operands to advance to the next opcode.
-      it.SkipOperands(TranslationOpcodeOperandCount(opcode) - 2);
-    } else {
-      // Skip over operands to advance to the next opcode.
-      it.SkipOperands(TranslationOpcodeOperandCount(opcode));
-    }
+    TranslationOpcode opcode = it.SeekNextJSFrame();
+    it.NextOperand();  // Skip bailout id.
+    jsframe_count--;
+
+    // The second operand of the frame points to the function.
+    Tagged<Object> shared = literal_array->get(it.NextOperand());
+    functions->push_back(SharedFunctionInfo::cast(shared));
+
+    // Skip over remaining operands to advance to the next opcode.
+    it.SkipOperands(TranslationOpcodeOperandCount(opcode) - 2);
   }
 }
 
@@ -2372,9 +2786,9 @@ int OptimizedFrame::StackSlotOffsetRelativeToFp(int slot_index) {
 }
 
 int UnoptimizedFrame::position() const {
-  AbstractCode code = AbstractCode::cast(GetBytecodeArray());
+  Tagged<AbstractCode> code = AbstractCode::cast(GetBytecodeArray());
   int code_offset = GetBytecodeOffset();
-  return code.SourcePosition(isolate(), code_offset);
+  return code->SourcePosition(isolate(), code_offset);
 }
 
 int UnoptimizedFrame::LookupExceptionHandlerInTable(
@@ -2383,7 +2797,7 @@ int UnoptimizedFrame::LookupExceptionHandlerInTable(
   return table.LookupRange(GetBytecodeOffset(), context_register, prediction);
 }
 
-BytecodeArray UnoptimizedFrame::GetBytecodeArray() const {
+Tagged<BytecodeArray> UnoptimizedFrame::GetBytecodeArray() const {
   const int index = UnoptimizedFrameConstants::kBytecodeArrayExpressionIndex;
   DCHECK_EQ(UnoptimizedFrameConstants::kBytecodeArrayFromFp,
             UnoptimizedFrameConstants::kExpressionsOffset -
@@ -2391,7 +2805,8 @@ BytecodeArray UnoptimizedFrame::GetBytecodeArray() const {
   return BytecodeArray::cast(GetExpression(index));
 }
 
-Object UnoptimizedFrame::ReadInterpreterRegister(int register_index) const {
+Tagged<Object> UnoptimizedFrame::ReadInterpreterRegister(
+    int register_index) const {
   const int index = UnoptimizedFrameConstants::kRegisterFileExpressionIndex;
   DCHECK_EQ(UnoptimizedFrameConstants::kRegisterFileFromFp,
             UnoptimizedFrameConstants::kExpressionsOffset -
@@ -2440,7 +2855,8 @@ void InterpretedFrame::PatchBytecodeOffset(int new_offset) {
   SetExpression(index, Smi::FromInt(raw_offset));
 }
 
-void InterpretedFrame::PatchBytecodeArray(BytecodeArray bytecode_array) {
+void InterpretedFrame::PatchBytecodeArray(
+    Tagged<BytecodeArray> bytecode_array) {
   const int index = InterpreterFrameConstants::kBytecodeArrayExpressionIndex;
   DCHECK_EQ(InterpreterFrameConstants::kBytecodeArrayFromFp,
             InterpreterFrameConstants::kExpressionsOffset -
@@ -2449,22 +2865,22 @@ void InterpretedFrame::PatchBytecodeArray(BytecodeArray bytecode_array) {
 }
 
 int BaselineFrame::GetBytecodeOffset() const {
-  Code code = LookupCode();
-  return code.GetBytecodeOffsetForBaselinePC(this->pc(), GetBytecodeArray());
+  Tagged<Code> code = LookupCode();
+  return code->GetBytecodeOffsetForBaselinePC(this->pc(), GetBytecodeArray());
 }
 
 intptr_t BaselineFrame::GetPCForBytecodeOffset(int bytecode_offset) const {
-  Code code = LookupCode();
-  return code.GetBaselineStartPCForBytecodeOffset(bytecode_offset,
-                                                  GetBytecodeArray());
+  Tagged<Code> code = LookupCode();
+  return code->GetBaselineStartPCForBytecodeOffset(bytecode_offset,
+                                                   GetBytecodeArray());
 }
 
-void BaselineFrame::PatchContext(Context value) {
+void BaselineFrame::PatchContext(Tagged<Context> value) {
   base::Memory<Address>(fp() + BaselineFrameConstants::kContextOffset) =
       value.ptr();
 }
 
-JSFunction BuiltinFrame::function() const {
+Tagged<JSFunction> BuiltinFrame::function() const {
   const int offset = BuiltinFrameConstants::kFunctionOffset;
   return JSFunction::cast(Object(base::Memory<Address>(fp() + offset)));
 }
@@ -2486,17 +2902,17 @@ void WasmFrame::Print(StringStream* accumulator, PrintMode mode,
   }
   wasm::WasmCodeRefScope code_ref_scope;
   accumulator->Add(is_wasm_to_js() ? "Wasm-to-JS [" : "Wasm [");
-  accumulator->PrintName(script().name());
+  accumulator->PrintName(script()->name());
   Address instruction_start = wasm_code()->instruction_start();
   base::Vector<const uint8_t> raw_func_name =
-      module_object().GetRawFunctionName(function_index());
+      module_object()->GetRawFunctionName(function_index());
   const int kMaxPrintedFunctionName = 64;
   char func_name[kMaxPrintedFunctionName + 1];
   int func_name_len = std::min(kMaxPrintedFunctionName, raw_func_name.length());
   memcpy(func_name, raw_func_name.begin(), func_name_len);
   func_name[func_name_len] = '\0';
   int pos = position();
-  const wasm::WasmModule* module = wasm_instance().module_object().module();
+  const wasm::WasmModule* module = wasm_instance()->module_object()->module();
   int func_index = function_index();
   int func_code_offset = module->functions[func_index].code.offset();
   accumulator->Add("], function #%u ('%s'), pc=%p (+0x%x), pos=%d (+%d)\n",
@@ -2510,18 +2926,18 @@ wasm::WasmCode* WasmFrame::wasm_code() const {
   return wasm::GetWasmCodeManager()->LookupCode(pc());
 }
 
-WasmInstanceObject WasmFrame::wasm_instance() const {
+Tagged<WasmInstanceObject> WasmFrame::wasm_instance() const {
   const int offset = WasmFrameConstants::kWasmInstanceOffset;
-  Object instance(Memory<Address>(fp() + offset));
+  Tagged<Object> instance(Memory<Address>(fp() + offset));
   return WasmInstanceObject::cast(instance);
 }
 
 wasm::NativeModule* WasmFrame::native_module() const {
-  return module_object().native_module();
+  return module_object()->native_module();
 }
 
-WasmModuleObject WasmFrame::module_object() const {
-  return wasm_instance().module_object();
+Tagged<WasmModuleObject> WasmFrame::module_object() const {
+  return wasm_instance()->module_object();
 }
 
 int WasmFrame::function_index() const {
@@ -2529,11 +2945,11 @@ int WasmFrame::function_index() const {
   return wasm_code()->index();
 }
 
-Script WasmFrame::script() const { return module_object().script(); }
+Tagged<Script> WasmFrame::script() const { return module_object()->script(); }
 
 int WasmFrame::position() const {
   wasm::WasmCodeRefScope code_ref_scope;
-  const wasm::WasmModule* module = wasm_instance().module_object().module();
+  const wasm::WasmModule* module = wasm_instance()->module_object()->module();
   return GetSourcePosition(module, function_index(), generated_code_offset(),
                            at_to_number_conversion());
 }
@@ -2549,7 +2965,9 @@ bool WasmFrame::is_inspectable() const {
   return wasm_code()->is_inspectable();
 }
 
-Object WasmFrame::context() const { return wasm_instance().native_context(); }
+Tagged<Object> WasmFrame::context() const {
+  return wasm_instance()->native_context();
+}
 
 void WasmFrame::Summarize(std::vector<FrameSummary>* functions) const {
   DCHECK(functions->empty());
@@ -2589,19 +3007,38 @@ void WasmFrame::Summarize(std::vector<FrameSummary>* functions) const {
 }
 
 bool WasmFrame::at_to_number_conversion() const {
+  if (callee_pc() == kNullAddress) return false;
   // Check whether our callee is a WASM_TO_JS frame, and this frame is at the
   // ToNumber conversion call.
-  wasm::WasmCode* code =
-      callee_pc() != kNullAddress
-          ? wasm::GetWasmCodeManager()->LookupCode(callee_pc())
-          : nullptr;
-  if (!code || code->kind() != wasm::WasmCode::kWasmToJsWrapper) return false;
-  int offset = static_cast<int>(callee_pc() - code->instruction_start());
-  int pos = code->GetSourceOffsetBefore(offset);
-  // The imported call has position 0, ToNumber has position 1.
-  // If there is no source position available, this is also not a ToNumber call.
-  DCHECK(pos == wasm::kNoCodePosition || pos == 0 || pos == 1);
-  return pos == 1;
+  wasm::WasmCode* wasm_code =
+      wasm::GetWasmCodeManager()->LookupCode(callee_pc());
+
+  if (wasm_code) {
+    if (wasm_code->kind() != wasm::WasmCode::kWasmToJsWrapper) return false;
+    int offset = static_cast<int>(callee_pc() - wasm_code->instruction_start());
+    int pos = wasm_code->GetSourceOffsetBefore(offset);
+    // The imported call has position 0, ToNumber has position 1.
+    // If there is no source position available, this is also not a ToNumber
+    // call.
+    DCHECK(pos == wasm::kNoCodePosition || pos == 0 || pos == 1);
+    return pos == 1;
+  }
+
+  InnerPointerToCodeCache::InnerPointerToCodeCacheEntry* entry =
+      isolate()->inner_pointer_to_code_cache()->GetCacheEntry(callee_pc());
+  CHECK(entry->code.has_value());
+  Tagged<GcSafeCode> code = entry->code.value();
+  if (!code->is_builtin() ||
+      code->builtin_id() != Builtin::kWasmToJsWrapperCSA) {
+    return false;
+  }
+  // The generic wasm-to-js wrapper initially pushes the signature on the stack,
+  // but overwrites the signature just before the call to JavaScript. Therefore,
+  // if the signature is still there, we are at the to-number conversion, if the
+  // slot is empty, then we are at the call to JavaScript.
+  FullObjectSlot sig_slot(callee_fp() +
+                          WasmToJSWrapperConstants::kSignatureOffset);
+  return *sig_slot.location() != kNullAddress;
 }
 
 int WasmFrame::LookupExceptionHandlerInTable() {
@@ -2640,43 +3077,19 @@ void WasmDebugBreakFrame::Print(StringStream* accumulator, PrintMode mode,
   if (mode != OVERVIEW) accumulator->Add("\n");
 }
 
-WasmInstanceObject WasmToJsFrame::wasm_instance() const {
+Tagged<WasmInstanceObject> WasmToJsFrame::wasm_instance() const {
   // WasmToJsFrames hold the {WasmApiFunctionRef} object in the instance slot.
   // Load the instance from there.
   const int offset = WasmFrameConstants::kWasmInstanceOffset;
-  Object func_ref_obj(Memory<Address>(fp() + offset));
-  WasmApiFunctionRef func_ref = WasmApiFunctionRef::cast(func_ref_obj);
-  return WasmInstanceObject::cast(func_ref.instance());
+  Tagged<Object> func_ref_obj(Memory<Address>(fp() + offset));
+  Tagged<WasmApiFunctionRef> func_ref = WasmApiFunctionRef::cast(func_ref_obj);
+  return WasmInstanceObject::cast(func_ref->instance());
 }
 
 void JsToWasmFrame::Iterate(RootVisitor* v) const {
-  DCHECK_EQ(GetContainingCode(isolate(), pc())->builtin_id(),
-            Builtin::kGenericJSToWasmWrapper);
-
-  //  GenericJSToWasmWrapper stack layout
-  //  ------+-----------------+----------------------
-  //        |  return addr    |
-  //    fp  |- - - - - - - - -|  -------------------|
-  //        |       fp        |                     |
-  //   fp-p |- - - - - - - - -|                     |
-  //        |  frame marker   |                     | no GC scan
-  //  fp-2p |- - - - - - - - -|                     |
-  //        |   scan_count    |                     |
-  //  fp-3p |- - - - - - - - -|  -------------------|
-  //        |      ....       | <- spill_slot_limit |
-  //        |   spill slots   |                     | GC scan scan_count slots
-  //        |      ....       | <- spill_slot_base--|
-  //        |- - - - - - - - -|                     |
-  // The [fp + BuiltinFrameConstants::kGCScanSlotCount] on the stack is a value
-  // indicating how many values should be scanned from the top.
-  intptr_t scan_count = *reinterpret_cast<intptr_t*>(
-      fp() + BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
-
-  FullObjectSlot spill_slot_base(&Memory<Address>(sp()));
-  FullObjectSlot spill_slot_limit(
-      &Memory<Address>(sp() + scan_count * kSystemPointerSize));
-  v->VisitRootPointers(Root::kStackRoots, nullptr, spill_slot_base,
-                       spill_slot_limit);
+  // WrapperBuffer slot is RawPtr pointing to a stack.
+  // Wasm instance and JS result array are passed as stack params.
+  // So there is no need to visit them.
 }
 
 void StackSwitchFrame::Iterate(RootVisitor* v) const {
@@ -2686,7 +3099,7 @@ void StackSwitchFrame::Iterate(RootVisitor* v) const {
   // The [fp + BuiltinFrameConstants::kGCScanSlotCountOffset] on the stack is a
   // value indicating how many values should be scanned from the top.
   intptr_t scan_count = *reinterpret_cast<intptr_t*>(
-      fp() + BuiltinWasmWrapperConstants::kGCScanSlotCountOffset);
+      fp() + StackSwitchFrameConstants::kGCScanSlotCountOffset);
 
   FullObjectSlot spill_slot_base(&Memory<Address>(sp()));
   FullObjectSlot spill_slot_limit(
@@ -2694,9 +3107,12 @@ void StackSwitchFrame::Iterate(RootVisitor* v) const {
   v->VisitRootPointers(Root::kStackRoots, nullptr, spill_slot_base,
                        spill_slot_limit);
   // Also visit fixed spill slots that contain references.
-  FullObjectSlot suspender_slot(
-      &Memory<Address>(fp() + BuiltinWasmWrapperConstants::kSuspenderOffset));
-  v->VisitRootPointer(Root::kStackRoots, nullptr, suspender_slot);
+  FullObjectSlot instance_slot(
+      &Memory<Address>(fp() + StackSwitchFrameConstants::kInstanceOffset));
+  v->VisitRootPointer(Root::kStackRoots, nullptr, instance_slot);
+  FullObjectSlot result_array_slot(
+      &Memory<Address>(fp() + StackSwitchFrameConstants::kResultArrayOffset));
+  v->VisitRootPointer(Root::kStackRoots, nullptr, result_array_slot);
 }
 
 // static
@@ -2709,7 +3125,7 @@ void StackSwitchFrame::GetStateForJumpBuffer(wasm::JumpBuffer* jmpbuf,
 }
 
 int WasmLiftoffSetupFrame::GetDeclaredFunctionIndex() const {
-  Object func_index(Memory<Address>(
+  Tagged<Object> func_index(Memory<Address>(
       sp() + WasmLiftoffSetupFrameConstants::kDeclaredFunctionIndexOffset));
   return Smi::ToInt(func_index);
 }
@@ -2798,7 +3214,8 @@ void WasmLiftoffSetupFrame::Iterate(RootVisitor* v) const {
 
 namespace {
 
-void PrintFunctionSource(StringStream* accumulator, SharedFunctionInfo shared) {
+void PrintFunctionSource(StringStream* accumulator,
+                         Tagged<SharedFunctionInfo> shared) {
   if (v8_flags.max_stack_trace_source_length != 0) {
     std::ostringstream os;
     os << "--------- s o u r c e   c o d e ---------\n"
@@ -2812,12 +3229,12 @@ void PrintFunctionSource(StringStream* accumulator, SharedFunctionInfo shared) {
 
 void JavaScriptFrame::Print(StringStream* accumulator, PrintMode mode,
                             int index) const {
-  Handle<SharedFunctionInfo> shared = handle(function().shared(), isolate());
+  Handle<SharedFunctionInfo> shared = handle(function()->shared(), isolate());
   SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate(), shared);
 
   DisallowGarbageCollection no_gc;
-  Object receiver = this->receiver();
-  JSFunction function = this->function();
+  Tagged<Object> receiver = this->receiver();
+  Tagged<JSFunction> function = this->function();
 
   accumulator->PrintSecurityTokenIfChanged(function);
   PrintIndex(accumulator, mode, index);
@@ -2830,25 +3247,25 @@ void JavaScriptFrame::Print(StringStream* accumulator, PrintMode mode,
   // doesn't contain scope info, scope_info will return 0 for the number of
   // parameters, stack local variables, context local variables, stack slots,
   // or context slots.
-  ScopeInfo scope_info = shared->scope_info();
-  Object script_obj = shared->script();
-  if (script_obj.IsScript()) {
-    Script script = Script::cast(script_obj);
+  Tagged<ScopeInfo> scope_info = shared->scope_info();
+  Tagged<Object> script_obj = shared->script();
+  if (IsScript(script_obj)) {
+    Tagged<Script> script = Script::cast(script_obj);
     accumulator->Add(" [");
-    accumulator->PrintName(script.name());
+    accumulator->PrintName(script->name());
 
     if (is_interpreted()) {
       const InterpretedFrame* iframe = InterpretedFrame::cast(this);
-      BytecodeArray bytecodes = iframe->GetBytecodeArray();
+      Tagged<BytecodeArray> bytecodes = iframe->GetBytecodeArray();
       int offset = iframe->GetBytecodeOffset();
       int source_pos =
-          AbstractCode::cast(bytecodes).SourcePosition(isolate(), offset);
-      int line = script.GetLineNumber(source_pos) + 1;
+          AbstractCode::cast(bytecodes)->SourcePosition(isolate(), offset);
+      int line = script->GetLineNumber(source_pos) + 1;
       accumulator->Add(":%d] [bytecode=%p offset=%d]", line,
                        reinterpret_cast<void*>(bytecodes.ptr()), offset);
     } else {
       int function_start_pos = shared->StartPosition();
-      int line = script.GetLineNumber(function_start_pos) + 1;
+      int line = script->GetLineNumber(function_start_pos) + 1;
       accumulator->Add(":~%d] [pc=%p]", line, reinterpret_cast<void*>(pc()));
     }
   }
@@ -2876,15 +3293,15 @@ void JavaScriptFrame::Print(StringStream* accumulator, PrintMode mode,
   accumulator->Add(" {\n");
 
   // Compute the number of locals and expression stack elements.
-  int heap_locals_count = scope_info.ContextLocalCount();
+  int heap_locals_count = scope_info->ContextLocalCount();
   int expressions_count = ComputeExpressionsCount();
 
   // Try to get hold of the context of this frame.
-  Context context;
-  if (this->context().IsContext()) {
+  Tagged<Context> context;
+  if (IsContext(this->context())) {
     context = Context::cast(this->context());
-    while (context.IsWithContext()) {
-      context = context.previous();
+    while (context->IsWithContext()) {
+      context = context->previous();
       DCHECK(!context.is_null());
     }
   }
@@ -2893,14 +3310,14 @@ void JavaScriptFrame::Print(StringStream* accumulator, PrintMode mode,
   if (heap_locals_count > 0) {
     accumulator->Add("  // heap-allocated locals\n");
   }
-  for (auto it : ScopeInfo::IterateLocalNames(&scope_info, no_gc)) {
+  for (auto it : ScopeInfo::IterateLocalNames(scope_info, no_gc)) {
     accumulator->Add("  var ");
     accumulator->PrintName(it->name());
     accumulator->Add(" = ");
     if (!context.is_null()) {
       int slot_index = Context::MIN_CONTEXT_SLOTS + it->index();
-      if (slot_index < context.length()) {
-        accumulator->Add("%o", context.get(slot_index));
+      if (slot_index < context->length()) {
+        accumulator->Add("%o", context->get(slot_index));
       } else {
         accumulator->Add(
             "// warning: missing context slot - inconsistent frame?");
@@ -2952,7 +3369,7 @@ void JavaScriptFrame::Iterate(RootVisitor* v) const {
 }
 
 void InternalFrame::Iterate(RootVisitor* v) const {
-  GcSafeCode code = GcSafeLookupCode();
+  Tagged<GcSafeCode> code = GcSafeLookupCode();
   IteratePc(v, pc_address(), constant_pool_address(), code);
   // Internal frames typically do not receive any arguments, hence their stack
   // only contains tagged pointers.
@@ -2960,7 +3377,7 @@ void InternalFrame::Iterate(RootVisitor* v) const {
   // the full stack frame contains only tagged pointers or only raw values.
   // This is used for the WasmCompileLazy builtin, where we actually pass
   // untagged arguments and also store untagged values on the stack.
-  if (code.has_tagged_outgoing_params()) IterateExpressions(v);
+  if (code->has_tagged_outgoing_params()) IterateExpressions(v);
 }
 
 // -------------------------------------------------------------------------
@@ -3107,6 +3524,23 @@ ConstructStubFrameInfo::ConstructStubFrameInfo(int translation_height,
                          ConstructFrameConstants::kFixedFrameSize;
 }
 
+FastConstructStubFrameInfo::FastConstructStubFrameInfo(bool is_topmost) {
+  // If the construct frame appears to be topmost we should ensure that the
+  // value of result register is preserved during continuation execution.
+  // We do this here by "pushing" the result of the constructor function to
+  // the top of the reconstructed stack and popping it in
+  // {Builtin::kNotifyDeoptimized}.
+
+  static constexpr int kTopOfStackPadding = TopOfStackRegisterPaddingSlots();
+  static constexpr int kTheResult = 1;
+  const int adjusted_height =
+      ArgumentPaddingSlots(1) +
+      (is_topmost ? kTheResult + kTopOfStackPadding : 0);
+  frame_size_in_bytes_without_fixed_ = adjusted_height * kSystemPointerSize;
+  frame_size_in_bytes_ = frame_size_in_bytes_without_fixed_ +
+                         FastConstructFrameConstants::kFixedFrameSize;
+}
+
 BuiltinContinuationFrameInfo::BuiltinContinuationFrameInfo(
     int translation_height,
     const CallInterfaceDescriptor& continuation_descriptor,
diff --git a/deps/v8/src/execution/frames.h b/deps/v8/src/execution/frames.h
index 03ab9d0e8dc19b..378b7570f0185c 100644
--- a/deps/v8/src/execution/frames.h
+++ b/deps/v8/src/execution/frames.h
@@ -7,12 +7,18 @@
 
 #include "include/v8-initialization.h"
 #include "src/base/bounds.h"
+#include "src/codegen/handler-table.h"
 #include "src/codegen/safepoint-table.h"
 #include "src/common/globals.h"
 #include "src/handles/handles.h"
 #include "src/objects/code.h"
+#include "src/objects/deoptimization-data.h"
 #include "src/objects/objects.h"
 
+#if V8_ENABLE_WEBASSEMBLY
+#include "src/wasm/wasm-code-manager.h"
+#endif  // V8_ENABLE_WEBASSEMBLY
+
 //
 // Frame inheritance hierarchy (please keep in sync with frame-constants.h):
 // - CommonFrame
@@ -40,6 +46,7 @@
 //       - CWasmEntryFrame
 //     - Internal
 //       - ConstructFrame
+//       - FastConstructFrame
 //       - BuiltinContinuationFrame
 //     - WasmFrame
 //       - WasmExitFrame
@@ -124,8 +131,10 @@ class StackHandler {
     JavaScriptBuiltinContinuationWithCatchFrame)                          \
   V(INTERNAL, InternalFrame)                                              \
   V(CONSTRUCT, ConstructFrame)                                            \
+  V(FAST_CONSTRUCT, FastConstructFrame)                                   \
   V(BUILTIN, BuiltinFrame)                                                \
   V(BUILTIN_EXIT, BuiltinExitFrame)                                       \
+  V(API_CALLBACK_EXIT, ApiCallbackExitFrame)                              \
   V(NATIVE, NativeFrame)                                                  \
   V(IRREGEXP, IrregexpFrame)
 
@@ -254,7 +263,9 @@ class StackFrame {
     return type() == JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH;
   }
   bool is_construct() const { return type() == CONSTRUCT; }
+  bool is_fast_construct() const { return type() == FAST_CONSTRUCT; }
   bool is_builtin_exit() const { return type() == BUILTIN_EXIT; }
+  bool is_api_callback_exit() const { return type() == API_CALLBACK_EXIT; }
   bool is_irregexp() const { return type() == IRREGEXP; }
 
   static bool IsJavaScript(Type t) {
@@ -304,15 +315,16 @@ class StackFrame {
   // This method is used by Isolate::PushStackTraceAndDie() for collecting a
   // stack trace on fatal error and thus it might be called in the middle of GC
   // and should be as safe as possible.
-  virtual HeapObject unchecked_code() const = 0;
+  virtual Tagged<HeapObject> unchecked_code() const = 0;
 
   // Search for the code associated with this frame.
-  V8_EXPORT_PRIVATE Code LookupCode() const;
-  V8_EXPORT_PRIVATE GcSafeCode GcSafeLookupCode() const;
+  V8_EXPORT_PRIVATE Tagged<Code> LookupCode() const;
+  V8_EXPORT_PRIVATE Tagged<GcSafeCode> GcSafeLookupCode() const;
 
   virtual void Iterate(RootVisitor* v) const = 0;
   void IteratePc(RootVisitor* v, Address* pc_address,
-                 Address* constant_pool_address, GcSafeCode holder) const;
+                 Address* constant_pool_address,
+                 Tagged<GcSafeCode> holder) const;
 
   // Sets a callback function for return-address rewriting profilers
   // to resolve the location of a return address to the location of the
@@ -370,7 +382,10 @@ class V8_EXPORT_PRIVATE FrameSummary {
 // Subclasses for the different summary kinds:
 #define FRAME_SUMMARY_VARIANTS(F)                                          \
   F(JAVA_SCRIPT, JavaScriptFrameSummary, java_script_summary_, JavaScript) \
-  IF_WASM(F, WASM, WasmFrameSummary, wasm_summary_, Wasm)
+  IF_WASM(F, BUILTIN, BuiltinFrameSummary, builtin_summary_, Builtin)      \
+  IF_WASM(F, WASM, WasmFrameSummary, wasm_summary_, Wasm)                  \
+  IF_WASM(F, WASM_INLINED, WasmInlinedFrameSummary, wasm_inlined_summary_, \
+          WasmInlined)
 
 #define FRAME_SUMMARY_KIND(kind, type, field, desc) kind,
   enum Kind { FRAME_SUMMARY_VARIANTS(FRAME_SUMMARY_KIND) };
@@ -390,10 +405,10 @@ class V8_EXPORT_PRIVATE FrameSummary {
 
   class JavaScriptFrameSummary : public FrameSummaryBase {
    public:
-    JavaScriptFrameSummary(Isolate* isolate, Object receiver,
-                           JSFunction function, AbstractCode abstract_code,
-                           int code_offset, bool is_constructor,
-                           FixedArray parameters);
+    JavaScriptFrameSummary(Isolate* isolate, Tagged<Object> receiver,
+                           Tagged<JSFunction> function,
+                           Tagged<AbstractCode> abstract_code, int code_offset,
+                           bool is_constructor, Tagged<FixedArray> parameters);
 
     void EnsureSourcePositionsAvailable();
     bool AreSourcePositionsAvailable() const;
@@ -423,8 +438,8 @@ class V8_EXPORT_PRIVATE FrameSummary {
 #if V8_ENABLE_WEBASSEMBLY
   class WasmFrameSummary : public FrameSummaryBase {
    public:
-    WasmFrameSummary(Isolate*, Handle<WasmInstanceObject>, wasm::WasmCode*,
-                     int byte_offset, int function_index,
+    WasmFrameSummary(Isolate* isolate, Handle<WasmInstanceObject> instance,
+                     wasm::WasmCode* code, int byte_offset, int function_index,
                      bool at_to_number_conversion);
 
     Handle<Object> receiver() const;
@@ -449,6 +464,52 @@ class V8_EXPORT_PRIVATE FrameSummary {
     int byte_offset_;
     int function_index_;
   };
+
+  // Summary of a wasm frame inlined into JavaScript. (Wasm frames inlined into
+  // wasm are expressed by a WasmFrameSummary.)
+  class WasmInlinedFrameSummary : public FrameSummaryBase {
+   public:
+    WasmInlinedFrameSummary(Isolate* isolate,
+                            Handle<WasmInstanceObject> instance,
+                            int function_index, int op_wire_bytes_offset);
+
+    Handle<WasmInstanceObject> wasm_instance() const { return wasm_instance_; }
+    Handle<Object> receiver() const;
+    uint32_t function_index() const;
+    int code_offset() const { return op_wire_bytes_offset_; }
+    bool is_constructor() const { return false; }
+    bool is_subject_to_debugging() const { return true; }
+    Handle<Script> script() const;
+    int SourcePosition() const;
+    int SourceStatementPosition() const { return SourcePosition(); }
+    Handle<Context> native_context() const;
+    Handle<StackFrameInfo> CreateStackFrameInfo() const;
+
+   private:
+    Handle<WasmInstanceObject> wasm_instance_;
+    int function_index_;
+    int op_wire_bytes_offset_;  // relative to function offset.
+  };
+
+  class BuiltinFrameSummary : public FrameSummaryBase {
+   public:
+    BuiltinFrameSummary(Isolate*, Builtin);
+
+    Builtin builtin() const { return builtin_; }
+
+    Handle<Object> receiver() const;
+    int code_offset() const { return 0; }
+    bool is_constructor() const { return false; }
+    bool is_subject_to_debugging() const { return false; }
+    Handle<Object> script() const;
+    int SourcePosition() const { return kNoSourcePosition; }
+    int SourceStatementPosition() const { return 0; }
+    Handle<Context> native_context() const;
+    Handle<StackFrameInfo> CreateStackFrameInfo() const;
+
+   private:
+    Builtin builtin_;
+  };
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 #define FRAME_SUMMARY_CONS(kind, type, field, desc) \
@@ -498,13 +559,13 @@ class V8_EXPORT_PRIVATE FrameSummary {
 class CommonFrame : public StackFrame {
  public:
   // Accessors.
-  virtual Object context()
+  virtual Tagged<Object> context()
       const;  // TODO(victorgomes): CommonFrames don't have context.
   virtual int position() const;
 
   // Access the expressions in the stack frame including locals.
-  inline Object GetExpression(int index) const;
-  inline void SetExpression(int index, Object value);
+  inline Tagged<Object> GetExpression(int index) const;
+  inline void SetExpression(int index, Tagged<Object> value);
   int ComputeExpressionsCount() const;
 
   Address GetCallerStackPointer() const override;
@@ -522,7 +583,7 @@ class CommonFrame : public StackFrame {
  protected:
   inline explicit CommonFrame(StackFrameIteratorBase* iterator);
 
-  bool HasTaggedOutgoingParams(GcSafeCode code_lookup) const;
+  bool HasTaggedOutgoingParams(Tagged<GcSafeCode> code_lookup) const;
 
   void ComputeCallerState(State* state) const override;
 
@@ -546,7 +607,7 @@ class TurbofanStubWithContextFrame : public CommonFrame {
  public:
   Type type() const override { return TURBOFAN_STUB_WITH_CONTEXT; }
 
-  HeapObject unchecked_code() const override;
+  Tagged<HeapObject> unchecked_code() const override;
   void Iterate(RootVisitor* v) const override;
 
  protected:
@@ -559,9 +620,11 @@ class TurbofanStubWithContextFrame : public CommonFrame {
 
 class TypedFrame : public CommonFrame {
  public:
-  HeapObject unchecked_code() const override { return {}; }
+  Tagged<HeapObject> unchecked_code() const override { return {}; }
   void Iterate(RootVisitor* v) const override;
 
+  void IterateParamsOfWasmToJSWrapper(RootVisitor* v) const;
+
  protected:
   inline explicit TypedFrame(StackFrameIteratorBase* iterator);
 };
@@ -569,16 +632,16 @@ class TypedFrame : public CommonFrame {
 class CommonFrameWithJSLinkage : public CommonFrame {
  public:
   // Accessors.
-  virtual JSFunction function() const = 0;
+  virtual Tagged<JSFunction> function() const = 0;
 
   // Access the parameters.
-  virtual Object receiver() const;
-  virtual Object GetParameter(int index) const;
+  virtual Tagged<Object> receiver() const;
+  virtual Tagged<Object> GetParameter(int index) const;
   virtual int ComputeParametersCount() const;
   Handle<FixedArray> GetParameters() const;
   virtual int GetActualArgumentCount() const;
 
-  HeapObject unchecked_code() const override;
+  Tagged<HeapObject> unchecked_code() const override;
 
   // Lookup exception handler for current {pc}, returns -1 if none found. Also
   // returns data associated with the handler site specific to the frame type:
@@ -615,16 +678,16 @@ class JavaScriptFrame : public CommonFrameWithJSLinkage {
   Type type() const override = 0;
 
   // Accessors.
-  JSFunction function() const override;
-  Object unchecked_function() const;
-  Script script() const;
-  Object context() const override;
+  Tagged<JSFunction> function() const override;
+  Tagged<Object> unchecked_function() const;
+  Tagged<Script> script() const;
+  Tagged<Object> context() const override;
   int GetActualArgumentCount() const override;
 
-  inline void set_receiver(Object value);
+  inline void set_receiver(Tagged<Object> value);
 
   // Debugger access.
-  void SetParameterValue(int index, Object value) const;
+  void SetParameterValue(int index, Tagged<Object> value) const;
 
   // Check if this frame is a constructor frame invoked through 'new'.
   bool IsConstructor() const override;
@@ -651,15 +714,15 @@ class JavaScriptFrame : public CommonFrameWithJSLinkage {
     return static_cast<JavaScriptFrame*>(frame);
   }
 
-  static void PrintFunctionAndOffset(JSFunction function, AbstractCode code,
-                                     int code_offset, FILE* file,
-                                     bool print_line_number);
+  static void PrintFunctionAndOffset(Tagged<JSFunction> function,
+                                     Tagged<AbstractCode> code, int code_offset,
+                                     FILE* file, bool print_line_number);
 
   static void PrintTop(Isolate* isolate, FILE* file, bool print_args,
                        bool print_line_number);
 
-  static void CollectFunctionAndOffsetForICStats(JSFunction function,
-                                                 AbstractCode code,
+  static void CollectFunctionAndOffsetForICStats(Tagged<JSFunction> function,
+                                                 Tagged<AbstractCode> code,
                                                  int code_offset);
 
  protected:
@@ -670,7 +733,7 @@ class JavaScriptFrame : public CommonFrameWithJSLinkage {
   virtual void PrintFrameKind(StringStream* accumulator) const {}
 
  private:
-  inline Object function_slot_object() const;
+  inline Tagged<Object> function_slot_object() const;
 
   friend class StackFrameIteratorBase;
 };
@@ -696,7 +759,7 @@ class EntryFrame : public TypedFrame {
  public:
   Type type() const override { return ENTRY; }
 
-  HeapObject unchecked_code() const override;
+  Tagged<HeapObject> unchecked_code() const override;
 
   // Garbage collection support.
   void Iterate(RootVisitor* v) const override;
@@ -725,7 +788,7 @@ class ConstructEntryFrame : public EntryFrame {
  public:
   Type type() const override { return CONSTRUCT_ENTRY; }
 
-  HeapObject unchecked_code() const override;
+  Tagged<HeapObject> unchecked_code() const override;
 
   static ConstructEntryFrame* cast(StackFrame* frame) {
     DCHECK(frame->is_construct_entry());
@@ -777,10 +840,10 @@ class BuiltinExitFrame : public ExitFrame {
  public:
   Type type() const override { return BUILTIN_EXIT; }
 
-  JSFunction function() const;
+  Tagged<JSFunction> function() const;
 
-  Object receiver() const;
-  Object GetParameter(int i) const;
+  Tagged<Object> receiver() const;
+  Tagged<Object> GetParameter(int i) const;
   int ComputeParametersCount() const;
   Handle<FixedArray> GetParameters() const;
 
@@ -797,10 +860,60 @@ class BuiltinExitFrame : public ExitFrame {
   inline explicit BuiltinExitFrame(StackFrameIteratorBase* iterator);
 
  private:
-  inline Object receiver_slot_object() const;
-  inline Object argc_slot_object() const;
-  inline Object target_slot_object() const;
-  inline Object new_target_slot_object() const;
+  inline Tagged<Object> receiver_slot_object() const;
+  inline Tagged<Object> argc_slot_object() const;
+  inline Tagged<Object> target_slot_object() const;
+  inline Tagged<Object> new_target_slot_object() const;
+
+  friend class StackFrameIteratorBase;
+};
+
+// Api callback exit frames are a special case of exit frames, which are used
+// whenever an Api functions (such as v8::Function or v8::FunctionTemplate) are
+// called. Their main purpose is to allow these functions to appear in stack
+// traces.
+class ApiCallbackExitFrame : public ExitFrame {
+ public:
+  Type type() const override { return API_CALLBACK_EXIT; }
+
+  // ApiCallbackExitFrame might contain either FunctionTemplateInfo or
+  // JSFunction in the function slot.
+  Tagged<HeapObject> target() const;
+
+  // In case function slot contains FunctionTemplateInfo, instantiate the
+  // function, stores it in the function slot and returns JSFunction handle.
+  Handle<JSFunction> GetFunction() const;
+
+  Tagged<Object> receiver() const;
+  Tagged<Object> GetParameter(int i) const;
+  int ComputeParametersCount() const;
+  Handle<FixedArray> GetParameters() const;
+
+  // Check if this frame is a constructor frame invoked through 'new'.
+  bool IsConstructor() const;
+
+  void Print(StringStream* accumulator, PrintMode mode,
+             int index) const override;
+
+  // Summarize Frame
+  void Summarize(std::vector<FrameSummary>* frames) const override;
+
+  static ApiCallbackExitFrame* cast(StackFrame* frame) {
+    DCHECK(frame->is_api_callback_exit());
+    return static_cast<ApiCallbackExitFrame*>(frame);
+  }
+
+ protected:
+  inline explicit ApiCallbackExitFrame(StackFrameIteratorBase* iterator);
+
+ private:
+  inline void set_target(Tagged<HeapObject> function) const;
+
+  inline FullObjectSlot receiver_slot() const;
+  inline FullObjectSlot argc_slot() const;
+  inline FullObjectSlot context_slot() const;
+  inline FullObjectSlot target_slot() const;
+  inline FullObjectSlot new_target_slot() const;
 
   friend class StackFrameIteratorBase;
 };
@@ -809,12 +922,14 @@ class StubFrame : public TypedFrame {
  public:
   Type type() const override { return STUB; }
 
-  HeapObject unchecked_code() const override;
+  Tagged<HeapObject> unchecked_code() const override;
 
   // Lookup exception handler for current {pc}, returns -1 if none found. Only
   // TurboFan stub frames are supported.
   int LookupExceptionHandlerInTable();
 
+  void Summarize(std::vector<FrameSummary>* frames) const override;
+
  protected:
   inline explicit StubFrame(StackFrameIteratorBase* iterator);
 
@@ -831,7 +946,7 @@ class OptimizedFrame : public JavaScriptFrame {
 
   void Summarize(std::vector<FrameSummary>* frames) const override;
 
-  DeoptimizationData GetDeoptimizationData(int* deopt_index) const;
+  Tagged<DeoptimizationData> GetDeoptimizationData(int* deopt_index) const;
 
   static int StackSlotOffsetRelativeToFp(int slot_index);
 
@@ -839,7 +954,8 @@ class OptimizedFrame : public JavaScriptFrame {
   int LookupExceptionHandlerInTable(
       int* data, HandlerTable::CatchPrediction* prediction) override;
 
-  virtual int FindReturnPCForTrampoline(Code code, int trampoline_pc) const = 0;
+  virtual int FindReturnPCForTrampoline(Tagged<Code> code,
+                                        int trampoline_pc) const = 0;
 
  protected:
   inline explicit OptimizedFrame(StackFrameIteratorBase* iterator);
@@ -861,10 +977,10 @@ class UnoptimizedFrame : public JavaScriptFrame {
   virtual int GetBytecodeOffset() const = 0;
 
   // Returns the frame's current bytecode array.
-  BytecodeArray GetBytecodeArray() const;
+  Tagged<BytecodeArray> GetBytecodeArray() const;
 
   // Access to the interpreter register file for this frame.
-  Object ReadInterpreterRegister(int register_index) const;
+  Tagged<Object> ReadInterpreterRegister(int register_index) const;
 
   // Build a list with summaries for this frame including all inlined frames.
   void Summarize(std::vector<FrameSummary>* frames) const override;
@@ -896,7 +1012,7 @@ class InterpretedFrame : public UnoptimizedFrame {
 
   // Updates the frame's BytecodeArray with |bytecode_array|. Used by the
   // debugger to swap execution onto a BytecodeArray patched with breakpoints.
-  void PatchBytecodeArray(BytecodeArray bytecode_array);
+  void PatchBytecodeArray(Tagged<BytecodeArray> bytecode_array);
 
   static InterpretedFrame* cast(StackFrame* frame) {
     DCHECK(frame->is_interpreted());
@@ -925,7 +1041,7 @@ class BaselineFrame : public UnoptimizedFrame {
 
   intptr_t GetPCForBytecodeOffset(int lookup_offset) const;
 
-  void PatchContext(Context value);
+  void PatchContext(Tagged<Context> value);
 
   static BaselineFrame* cast(StackFrame* frame) {
     DCHECK(frame->is_baseline());
@@ -950,8 +1066,10 @@ class MaglevFrame : public OptimizedFrame {
 
   void Iterate(RootVisitor* v) const override;
 
-  int FindReturnPCForTrampoline(Code code, int trampoline_pc) const override;
+  int FindReturnPCForTrampoline(Tagged<Code> code,
+                                int trampoline_pc) const override;
 
+  Handle<JSFunction> GetInnermostFunction() const;
   BytecodeOffset GetBytecodeOffsetForOSR() const;
 
   static intptr_t StackGuardFrameSize(int register_input_count);
@@ -971,7 +1089,8 @@ class TurbofanFrame : public OptimizedFrame {
 
   void Iterate(RootVisitor* v) const override;
 
-  int FindReturnPCForTrampoline(Code code, int trampoline_pc) const override;
+  int FindReturnPCForTrampoline(Tagged<Code> code,
+                                int trampoline_pc) const override;
 
  protected:
   inline explicit TurbofanFrame(StackFrameIteratorBase* iterator);
@@ -979,7 +1098,7 @@ class TurbofanFrame : public OptimizedFrame {
  private:
   friend class StackFrameIteratorBase;
 
-  Object StackSlotAt(int index) const;
+  Tagged<Object> StackSlotAt(int index) const;
 };
 
 // Builtin frames are built for builtins with JavaScript linkage, such as
@@ -993,7 +1112,7 @@ class BuiltinFrame final : public TypedFrameWithJSLinkage {
     return static_cast<BuiltinFrame*>(frame);
   }
 
-  JSFunction function() const override;
+  Tagged<JSFunction> function() const override;
   int ComputeParametersCount() const override;
 
  protected:
@@ -1018,14 +1137,14 @@ class WasmFrame : public TypedFrame {
   void Iterate(RootVisitor* v) const override;
 
   // Accessors.
-  virtual V8_EXPORT_PRIVATE WasmInstanceObject wasm_instance() const;
+  virtual V8_EXPORT_PRIVATE Tagged<WasmInstanceObject> wasm_instance() const;
   V8_EXPORT_PRIVATE wasm::NativeModule* native_module() const;
   wasm::WasmCode* wasm_code() const;
   int function_index() const;
-  Script script() const;
+  Tagged<Script> script() const;
   // Byte position in the module, or asm.js source position.
   int position() const override;
-  Object context() const override;
+  Tagged<Object> context() const override;
   bool at_to_number_conversion() const;
   // Generated code byte offset in the function.
   int generated_code_offset() const;
@@ -1043,7 +1162,7 @@ class WasmFrame : public TypedFrame {
 
  private:
   friend class StackFrameIteratorBase;
-  WasmModuleObject module_object() const;
+  Tagged<WasmModuleObject> module_object() const;
 };
 
 class WasmExitFrame : public WasmFrame {
@@ -1085,7 +1204,7 @@ class WasmToJsFrame : public WasmFrame {
   Type type() const override { return WASM_TO_JS; }
 
   int position() const override { return 0; }
-  WasmInstanceObject wasm_instance() const override;
+  Tagged<WasmInstanceObject> wasm_instance() const override;
 
  protected:
   inline explicit WasmToJsFrame(StackFrameIteratorBase* iterator);
@@ -1206,6 +1325,24 @@ class ConstructFrame : public InternalFrame {
   friend class StackFrameIteratorBase;
 };
 
+// Fast construct frames are special construct trampoline frames that avoid
+// pushing arguments to the stack twice.
+class FastConstructFrame : public InternalFrame {
+ public:
+  Type type() const override { return FAST_CONSTRUCT; }
+
+  static FastConstructFrame* cast(StackFrame* frame) {
+    DCHECK(frame->is_fast_construct());
+    return static_cast<FastConstructFrame*>(frame);
+  }
+
+ protected:
+  inline explicit FastConstructFrame(StackFrameIteratorBase* iterator);
+
+ private:
+  friend class StackFrameIteratorBase;
+};
+
 class BuiltinContinuationFrame : public InternalFrame {
  public:
   Type type() const override { return BUILTIN_CONTINUATION; }
@@ -1231,11 +1368,11 @@ class JavaScriptBuiltinContinuationFrame : public TypedFrameWithJSLinkage {
     return static_cast<JavaScriptBuiltinContinuationFrame*>(frame);
   }
 
-  JSFunction function() const override;
+  Tagged<JSFunction> function() const override;
   int ComputeParametersCount() const override;
   intptr_t GetSPToFPDelta() const;
 
-  Object context() const override;
+  Tagged<Object> context() const override;
 
  protected:
   inline explicit JavaScriptBuiltinContinuationFrame(
@@ -1259,7 +1396,7 @@ class JavaScriptBuiltinContinuationWithCatchFrame
 
   // Patch in the exception object at the appropriate location into the stack
   // frame.
-  void SetException(Object exception);
+  void SetException(Tagged<Object> exception);
 
  protected:
   inline explicit JavaScriptBuiltinContinuationWithCatchFrame(
@@ -1433,8 +1570,11 @@ class V8_EXPORT_PRIVATE DebuggableStackFrameIterator {
 // Similar to StackFrameIterator, but can be created and used at any time and
 // any stack state. Currently, the only user is the profiler; if this ever
 // changes, find another name for this class.
-class V8_EXPORT_PRIVATE StackFrameIteratorForProfiler
-    : public StackFrameIteratorBase {
+// IMPORTANT: Do not mark this class as V8_EXPORT_PRIVATE. The profiler creates
+// instances of this class from a signal handler. If we use V8_EXPORT_PRIVATE
+// "ld" inserts a symbol stub for the constructor call that may crash with
+// a stackoverflow when called from a signal handler.
+class StackFrameIteratorForProfiler : public StackFrameIteratorBase {
  public:
   StackFrameIteratorForProfiler(Isolate* isolate, Address pc, Address fp,
                                 Address sp, Address lr, Address js_entry_sp);
@@ -1477,6 +1617,21 @@ class V8_EXPORT_PRIVATE StackFrameIteratorForProfiler
   Address top_link_register_;
 };
 
+// We cannot export 'StackFrameIteratorForProfiler' for cctests since the
+// linker inserted symbol stub may cuase a stack overflow
+// (https://crbug.com/1449195).
+// We subclass it and export the subclass instead.
+class V8_EXPORT_PRIVATE StackFrameIteratorForProfilerForTesting
+    : public StackFrameIteratorForProfiler {
+ public:
+  StackFrameIteratorForProfilerForTesting(Isolate* isolate, Address pc,
+                                          Address fp, Address sp, Address lr,
+                                          Address js_entry_sp);
+  // Re-declare methods needed by the test. Otherwise we'd have to
+  // export individual methods on the base class (which we don't want to risk).
+  void Advance();
+};
+
 // Frame layout helper classes. Used by the deoptimizer and instruction
 // selector.
 // -------------------------------------------------------------------------
@@ -1563,6 +1718,29 @@ class ConstructStubFrameInfo {
   uint32_t frame_size_in_bytes_;
 };
 
+class FastConstructStubFrameInfo {
+ public:
+  static FastConstructStubFrameInfo Precise(bool is_topmost) {
+    return FastConstructStubFrameInfo(is_topmost);
+  }
+
+  static FastConstructStubFrameInfo Conservative() {
+    // Assume it is the top most frame when conservative.
+    return FastConstructStubFrameInfo(true);
+  }
+
+  uint32_t frame_size_in_bytes_without_fixed() const {
+    return frame_size_in_bytes_without_fixed_;
+  }
+  uint32_t frame_size_in_bytes() const { return frame_size_in_bytes_; }
+
+ private:
+  explicit FastConstructStubFrameInfo(bool is_topmost);
+
+  uint32_t frame_size_in_bytes_without_fixed_;
+  uint32_t frame_size_in_bytes_;
+};
+
 // Used by BuiltinContinuationFrameInfo.
 class CallInterfaceDescriptor;
 class RegisterConfiguration;
diff --git a/deps/v8/src/execution/futex-emulation.cc b/deps/v8/src/execution/futex-emulation.cc
index cae89d616f6764..4bd05339659c01 100644
--- a/deps/v8/src/execution/futex-emulation.cc
+++ b/deps/v8/src/execution/futex-emulation.cc
@@ -257,8 +257,8 @@ enum WaitReturnValue : int { kOk = 0, kNotEqualValue = 1, kTimedOut = 2 };
 
 namespace {
 
-Object WaitJsTranslateReturn(Isolate* isolate, Object res) {
-  if (res.IsSmi()) {
+Tagged<Object> WaitJsTranslateReturn(Isolate* isolate, Tagged<Object> res) {
+  if (IsSmi(res)) {
     int val = Smi::ToInt(res);
     switch (val) {
       case WaitReturnValue::kOk:
@@ -276,42 +276,45 @@ Object WaitJsTranslateReturn(Isolate* isolate, Object res) {
 
 }  // namespace
 
-Object FutexEmulation::WaitJs32(Isolate* isolate, WaitMode mode,
-                                Handle<JSArrayBuffer> array_buffer, size_t addr,
-                                int32_t value, double rel_timeout_ms) {
-  Object res =
+Tagged<Object> FutexEmulation::WaitJs32(Isolate* isolate, WaitMode mode,
+                                        Handle<JSArrayBuffer> array_buffer,
+                                        size_t addr, int32_t value,
+                                        double rel_timeout_ms) {
+  Tagged<Object> res =
       Wait<int32_t>(isolate, mode, array_buffer, addr, value, rel_timeout_ms);
   return WaitJsTranslateReturn(isolate, res);
 }
 
-Object FutexEmulation::WaitJs64(Isolate* isolate, WaitMode mode,
-                                Handle<JSArrayBuffer> array_buffer, size_t addr,
-                                int64_t value, double rel_timeout_ms) {
-  Object res =
+Tagged<Object> FutexEmulation::WaitJs64(Isolate* isolate, WaitMode mode,
+                                        Handle<JSArrayBuffer> array_buffer,
+                                        size_t addr, int64_t value,
+                                        double rel_timeout_ms) {
+  Tagged<Object> res =
       Wait<int64_t>(isolate, mode, array_buffer, addr, value, rel_timeout_ms);
   return WaitJsTranslateReturn(isolate, res);
 }
 
-Object FutexEmulation::WaitWasm32(Isolate* isolate,
-                                  Handle<JSArrayBuffer> array_buffer,
-                                  size_t addr, int32_t value,
-                                  int64_t rel_timeout_ns) {
+Tagged<Object> FutexEmulation::WaitWasm32(Isolate* isolate,
+                                          Handle<JSArrayBuffer> array_buffer,
+                                          size_t addr, int32_t value,
+                                          int64_t rel_timeout_ns) {
   return Wait<int32_t>(isolate, WaitMode::kSync, array_buffer, addr, value,
                        rel_timeout_ns >= 0, rel_timeout_ns, CallType::kIsWasm);
 }
 
-Object FutexEmulation::WaitWasm64(Isolate* isolate,
-                                  Handle<JSArrayBuffer> array_buffer,
-                                  size_t addr, int64_t value,
-                                  int64_t rel_timeout_ns) {
+Tagged<Object> FutexEmulation::WaitWasm64(Isolate* isolate,
+                                          Handle<JSArrayBuffer> array_buffer,
+                                          size_t addr, int64_t value,
+                                          int64_t rel_timeout_ns) {
   return Wait<int64_t>(isolate, WaitMode::kSync, array_buffer, addr, value,
                        rel_timeout_ns >= 0, rel_timeout_ns, CallType::kIsWasm);
 }
 
 template <typename T>
-Object FutexEmulation::Wait(Isolate* isolate, WaitMode mode,
-                            Handle<JSArrayBuffer> array_buffer, size_t addr,
-                            T value, double rel_timeout_ms) {
+Tagged<Object> FutexEmulation::Wait(Isolate* isolate, WaitMode mode,
+                                    Handle<JSArrayBuffer> array_buffer,
+                                    size_t addr, T value,
+                                    double rel_timeout_ms) {
   DCHECK_LT(addr, array_buffer->GetByteLength());
 
   bool use_timeout = rel_timeout_ms != V8_INFINITY;
@@ -344,10 +347,11 @@ double WaitTimeoutInMs(double timeout_ns) {
 }  // namespace
 
 template <typename T>
-Object FutexEmulation::Wait(Isolate* isolate, WaitMode mode,
-                            Handle<JSArrayBuffer> array_buffer, size_t addr,
-                            T value, bool use_timeout, int64_t rel_timeout_ns,
-                            CallType call_type) {
+Tagged<Object> FutexEmulation::Wait(Isolate* isolate, WaitMode mode,
+                                    Handle<JSArrayBuffer> array_buffer,
+                                    size_t addr, T value, bool use_timeout,
+                                    int64_t rel_timeout_ns,
+                                    CallType call_type) {
   if (mode == WaitMode::kSync) {
     return WaitSync(isolate, array_buffer, addr, value, use_timeout,
                     rel_timeout_ns, call_type);
@@ -358,10 +362,11 @@ Object FutexEmulation::Wait(Isolate* isolate, WaitMode mode,
 }
 
 template <typename T>
-Object FutexEmulation::WaitSync(Isolate* isolate,
-                                Handle<JSArrayBuffer> array_buffer, size_t addr,
-                                T value, bool use_timeout,
-                                int64_t rel_timeout_ns, CallType call_type) {
+Tagged<Object> FutexEmulation::WaitSync(Isolate* isolate,
+                                        Handle<JSArrayBuffer> array_buffer,
+                                        size_t addr, T value, bool use_timeout,
+                                        int64_t rel_timeout_ns,
+                                        CallType call_type) {
   VMState<ATOMICS_WAIT> state(isolate);
   base::TimeDelta rel_timeout =
       base::TimeDelta::FromNanoseconds(rel_timeout_ns);
@@ -444,8 +449,9 @@ Object FutexEmulation::WaitSync(Isolate* isolate,
       // notification will wake up the condition variable. node->waiting() will
       // be false, so we'll loop and then check interrupts.
       if (interrupted) {
-        Object interrupt_object = isolate->stack_guard()->HandleInterrupts();
-        if (interrupt_object.IsException(isolate)) {
+        Tagged<Object> interrupt_object =
+            isolate->stack_guard()->HandleInterrupts();
+        if (IsException(interrupt_object, isolate)) {
           result = handle(interrupt_object, isolate);
           callback_result = AtomicsWaitEvent::kTerminatedExecution;
           lock_guard.Lock();
@@ -522,17 +528,17 @@ FutexWaitListNode::FutexWaitListNode(
   promise_.Reset(v8_isolate, local_promise);
   promise_.SetWeak();
   Handle<NativeContext> native_context(isolate->native_context());
-  v8::Local<v8::Context> local_native_context =
-      Utils::ToLocal(Handle<Context>::cast(native_context));
+  v8::Local<v8::Context> local_native_context = Utils::ToLocal(native_context);
   native_context_.Reset(v8_isolate, local_native_context);
   native_context_.SetWeak();
 }
 
 template <typename T>
-Object FutexEmulation::WaitAsync(Isolate* isolate,
-                                 Handle<JSArrayBuffer> array_buffer,
-                                 size_t addr, T value, bool use_timeout,
-                                 int64_t rel_timeout_ns, CallType call_type) {
+Tagged<Object> FutexEmulation::WaitAsync(Isolate* isolate,
+                                         Handle<JSArrayBuffer> array_buffer,
+                                         size_t addr, T value, bool use_timeout,
+                                         int64_t rel_timeout_ns,
+                                         CallType call_type) {
   base::TimeDelta rel_timeout =
       base::TimeDelta::FromNanoseconds(rel_timeout_ns);
 
@@ -651,8 +657,8 @@ Object FutexEmulation::WaitAsync(Isolate* isolate,
   return *result;
 }
 
-Object FutexEmulation::Wake(Handle<JSArrayBuffer> array_buffer, size_t addr,
-                            uint32_t num_waiters_to_wake) {
+Tagged<Object> FutexEmulation::Wake(Handle<JSArrayBuffer> array_buffer,
+                                    size_t addr, uint32_t num_waiters_to_wake) {
   DCHECK_LT(addr, array_buffer->GetByteLength());
 
   int waiters_woken = 0;
@@ -914,8 +920,8 @@ void FutexEmulation::IsolateDeinit(Isolate* isolate) {
   g_wait_list.Pointer()->Verify();
 }
 
-Object FutexEmulation::NumWaitersForTesting(Handle<JSArrayBuffer> array_buffer,
-                                            size_t addr) {
+Tagged<Object> FutexEmulation::NumWaitersForTesting(
+    Handle<JSArrayBuffer> array_buffer, size_t addr) {
   DCHECK_LT(addr, array_buffer->GetByteLength());
   std::shared_ptr<BackingStore> backing_store = array_buffer->GetBackingStore();
 
@@ -942,7 +948,7 @@ Object FutexEmulation::NumWaitersForTesting(Handle<JSArrayBuffer> array_buffer,
   return Smi::FromInt(waiters);
 }
 
-Object FutexEmulation::NumAsyncWaitersForTesting(Isolate* isolate) {
+Tagged<Object> FutexEmulation::NumAsyncWaitersForTesting(Isolate* isolate) {
   NoGarbageCollectionMutexGuard lock_guard(g_mutex.Pointer());
 
   int waiters = 0;
@@ -959,7 +965,7 @@ Object FutexEmulation::NumAsyncWaitersForTesting(Isolate* isolate) {
   return Smi::FromInt(waiters);
 }
 
-Object FutexEmulation::NumUnresolvedAsyncPromisesForTesting(
+Tagged<Object> FutexEmulation::NumUnresolvedAsyncPromisesForTesting(
     Handle<JSArrayBuffer> array_buffer, size_t addr) {
   DCHECK_LT(addr, array_buffer->GetByteLength());
   std::shared_ptr<BackingStore> backing_store = array_buffer->GetBackingStore();
diff --git a/deps/v8/src/execution/futex-emulation.h b/deps/v8/src/execution/futex-emulation.h
index 4747ed5f48394c..156b9c00be1050 100644
--- a/deps/v8/src/execution/futex-emulation.h
+++ b/deps/v8/src/execution/futex-emulation.h
@@ -38,8 +38,6 @@ namespace internal {
 class BackingStore;
 class FutexWaitList;
 
-template <typename T>
-class Handle;
 class Isolate;
 class JSArrayBuffer;
 
@@ -150,53 +148,53 @@ class FutexEmulation : public AllStatic {
   // |rel_timeout_ms| can be Infinity.
   // If woken, return "ok", otherwise return "timed-out". The initial check and
   // the decision to wait happen atomically.
-  static Object WaitJs32(Isolate* isolate, WaitMode mode,
-                         Handle<JSArrayBuffer> array_buffer, size_t addr,
-                         int32_t value, double rel_timeout_ms);
+  static Tagged<Object> WaitJs32(Isolate* isolate, WaitMode mode,
+                                 Handle<JSArrayBuffer> array_buffer,
+                                 size_t addr, int32_t value,
+                                 double rel_timeout_ms);
 
   // An version of WaitJs32 for int64_t values.
-  static Object WaitJs64(Isolate* isolate, WaitMode mode,
-                         Handle<JSArrayBuffer> array_buffer, size_t addr,
-                         int64_t value, double rel_timeout_ms);
+  static Tagged<Object> WaitJs64(Isolate* isolate, WaitMode mode,
+                                 Handle<JSArrayBuffer> array_buffer,
+                                 size_t addr, int64_t value,
+                                 double rel_timeout_ms);
 
   // Same as WaitJs above except it returns 0 (ok), 1 (not equal) and 2 (timed
   // out) as expected by Wasm.
-  V8_EXPORT_PRIVATE static Object WaitWasm32(Isolate* isolate,
-                                             Handle<JSArrayBuffer> array_buffer,
-                                             size_t addr, int32_t value,
-                                             int64_t rel_timeout_ns);
+  V8_EXPORT_PRIVATE static Tagged<Object> WaitWasm32(
+      Isolate* isolate, Handle<JSArrayBuffer> array_buffer, size_t addr,
+      int32_t value, int64_t rel_timeout_ns);
 
   // Same as Wait32 above except it checks for an int64_t value in the
   // array_buffer.
-  V8_EXPORT_PRIVATE static Object WaitWasm64(Isolate* isolate,
-                                             Handle<JSArrayBuffer> array_buffer,
-                                             size_t addr, int64_t value,
-                                             int64_t rel_timeout_ns);
+  V8_EXPORT_PRIVATE static Tagged<Object> WaitWasm64(
+      Isolate* isolate, Handle<JSArrayBuffer> array_buffer, size_t addr,
+      int64_t value, int64_t rel_timeout_ns);
 
   // Wake |num_waiters_to_wake| threads that are waiting on the given |addr|.
   // |num_waiters_to_wake| can be kWakeAll, in which case all waiters are
   // woken. The rest of the waiters will continue to wait. The return value is
   // the number of woken waiters.
-  V8_EXPORT_PRIVATE static Object Wake(Handle<JSArrayBuffer> array_buffer,
-                                       size_t addr,
-                                       uint32_t num_waiters_to_wake);
+  V8_EXPORT_PRIVATE static Tagged<Object> Wake(
+      Handle<JSArrayBuffer> array_buffer, size_t addr,
+      uint32_t num_waiters_to_wake);
 
   // Called before |isolate| dies. Removes async waiters owned by |isolate|.
   static void IsolateDeinit(Isolate* isolate);
 
   // Return the number of threads or async waiters waiting on |addr|. Should
   // only be used for testing.
-  static Object NumWaitersForTesting(Handle<JSArrayBuffer> array_buffer,
-                                     size_t addr);
+  static Tagged<Object> NumWaitersForTesting(Handle<JSArrayBuffer> array_buffer,
+                                             size_t addr);
 
   // Return the number of async waiters (which belong to |isolate|) waiting.
   // Should only be used for testing.
-  static Object NumAsyncWaitersForTesting(Isolate* isolate);
+  static Tagged<Object> NumAsyncWaitersForTesting(Isolate* isolate);
 
   // Return the number of async waiters which were waiting for |addr| and are
   // now waiting for the Promises to be resolved. Should only be used for
   // testing.
-  static Object NumUnresolvedAsyncPromisesForTesting(
+  static Tagged<Object> NumUnresolvedAsyncPromisesForTesting(
       Handle<JSArrayBuffer> array_buffer, size_t addr);
 
  private:
@@ -206,25 +204,27 @@ class FutexEmulation : public AllStatic {
   friend class AsyncWaiterTimeoutTask;
 
   template <typename T>
-  static Object Wait(Isolate* isolate, WaitMode mode,
-                     Handle<JSArrayBuffer> array_buffer, size_t addr, T value,
-                     double rel_timeout_ms);
+  static Tagged<Object> Wait(Isolate* isolate, WaitMode mode,
+                             Handle<JSArrayBuffer> array_buffer, size_t addr,
+                             T value, double rel_timeout_ms);
 
   template <typename T>
-  static Object Wait(Isolate* isolate, WaitMode mode,
-                     Handle<JSArrayBuffer> array_buffer, size_t addr, T value,
-                     bool use_timeout, int64_t rel_timeout_ns,
-                     CallType call_type = CallType::kIsNotWasm);
+  static Tagged<Object> Wait(Isolate* isolate, WaitMode mode,
+                             Handle<JSArrayBuffer> array_buffer, size_t addr,
+                             T value, bool use_timeout, int64_t rel_timeout_ns,
+                             CallType call_type = CallType::kIsNotWasm);
 
   template <typename T>
-  static Object WaitSync(Isolate* isolate, Handle<JSArrayBuffer> array_buffer,
-                         size_t addr, T value, bool use_timeout,
-                         int64_t rel_timeout_ns, CallType call_type);
+  static Tagged<Object> WaitSync(Isolate* isolate,
+                                 Handle<JSArrayBuffer> array_buffer,
+                                 size_t addr, T value, bool use_timeout,
+                                 int64_t rel_timeout_ns, CallType call_type);
 
   template <typename T>
-  static Object WaitAsync(Isolate* isolate, Handle<JSArrayBuffer> array_buffer,
-                          size_t addr, T value, bool use_timeout,
-                          int64_t rel_timeout_ns, CallType call_type);
+  static Tagged<Object> WaitAsync(Isolate* isolate,
+                                  Handle<JSArrayBuffer> array_buffer,
+                                  size_t addr, T value, bool use_timeout,
+                                  int64_t rel_timeout_ns, CallType call_type);
 
   // Resolve the Promises of the async waiters which belong to |isolate|.
   static void ResolveAsyncWaiterPromises(Isolate* isolate);
diff --git a/deps/v8/src/execution/interrupts-scope.h b/deps/v8/src/execution/interrupts-scope.h
index 29de448ad6ce0f..8be3ce989aaed0 100644
--- a/deps/v8/src/execution/interrupts-scope.h
+++ b/deps/v8/src/execution/interrupts-scope.h
@@ -17,7 +17,7 @@ class Isolate;
 // not affect other interrupts.
 class V8_NODISCARD InterruptsScope {
  public:
-  enum Mode : byte { kPostponeInterrupts, kRunInterrupts, kNoop };
+  enum Mode : uint8_t { kPostponeInterrupts, kRunInterrupts, kNoop };
 
   V8_EXPORT_PRIVATE InterruptsScope(Isolate* isolate, uint32_t intercept_mask,
                                     Mode mode)
diff --git a/deps/v8/src/execution/isolate-data.h b/deps/v8/src/execution/isolate-data.h
index 9961be3ff5527b..f635c0fc4a72c2 100644
--- a/deps/v8/src/execution/isolate-data.h
+++ b/deps/v8/src/execution/isolate-data.h
@@ -12,6 +12,7 @@
 #include "src/execution/thread-local-top.h"
 #include "src/heap/linear-allocation-area.h"
 #include "src/roots/roots.h"
+#include "src/sandbox/code-pointer-table.h"
 #include "src/sandbox/external-pointer-table.h"
 #include "src/utils/utils.h"
 #include "testing/gtest/include/gtest/gtest_prod.h"  // nogncheck
@@ -30,7 +31,7 @@ class Isolate;
   V(kIsMinorMarkingFlag, kUInt8Size, is_minor_marking_flag)                   \
   V(kIsSharedSpaceIsolateFlag, kUInt8Size, is_shared_space_isolate_flag)      \
   V(kUsesSharedHeapFlag, kUInt8Size, uses_shared_heap_flag)                   \
-  V(kIsProfilingOffset, kUInt8Size, is_profiling)                             \
+  V(kExecutionModeOffset, kUInt8Size, execution_mode)                         \
   V(kStackIsIterableOffset, kUInt8Size, stack_is_iterable)                    \
   V(kTablesAlignmentPaddingOffset, 2, tables_alignment_padding)               \
   /* Tier 0 tables (small but fast access). */                                \
@@ -49,9 +50,12 @@ class Isolate;
   V(kFastApiCallTargetOffset, kSystemPointerSize, fast_api_call_target)       \
   V(kLongTaskStatsCounterOffset, kSizetSize, long_task_stats_counter)         \
   V(kThreadLocalTopOffset, ThreadLocalTop::kSizeInBytes, thread_local_top)    \
+  V(kHandleScopeDataOffset, HandleScopeData::kSizeInBytes, handle_scope_data) \
   V(kEmbedderDataOffset, Internals::kNumIsolateDataSlots* kSystemPointerSize, \
     embedder_data)                                                            \
   ISOLATE_DATA_FIELDS_POINTER_COMPRESSION(V)                                  \
+  V(kApiCallbackThunkArgumentOffset, kSystemPointerSize,                      \
+    api_callback_thunk_argument)                                              \
   /* Full tables (arbitrary size, potentially slower access). */              \
   V(kRootsTableOffset, RootsTable::kEntriesCount* kSystemPointerSize,         \
     roots_table)                                                              \
@@ -132,6 +136,9 @@ class IsolateData final {
   Address* builtin_tier0_entry_table() { return builtin_tier0_entry_table_; }
   Address* builtin_tier0_table() { return builtin_tier0_table_; }
   RootsTable& roots() { return roots_table_; }
+  Address api_callback_thunk_argument() const {
+    return api_callback_thunk_argument_;
+  }
   const RootsTable& roots() const { return roots_table_; }
   ExternalReferenceTable* external_reference_table() {
     return &external_reference_table_;
@@ -190,11 +197,11 @@ class IsolateData final {
   uint8_t is_shared_space_isolate_flag_ = false;
   uint8_t uses_shared_heap_flag_ = false;
 
-  // true if the Isolate is being profiled. Causes collection of extra compile
-  // info.
-  // This flag is checked on every API callback/getter call.
-  // Only valid values are 0 or 1.
-  std::atomic<uint8_t> is_profiling_{false};
+  // Storage for is_profiling and should_check_side_effects booleans.
+  // This value is checked on every API callback/getter call.
+  base::Flags<IsolateExecutionModeFlag, uint8_t, std::atomic<uint8_t>>
+      execution_mode_ = {IsolateExecutionModeFlag::kNoFlags};
+  static_assert(sizeof(execution_mode_) == 1);
 
   //
   // Not super hot flags, which are put here because we have to align the
@@ -233,6 +240,7 @@ class IsolateData final {
   size_t long_task_stats_counter_ = 0;
 
   ThreadLocalTop thread_local_top_;
+  HandleScopeData handle_scope_data_;
 
   // These fields are accessed through the API, offsets must be kept in sync
   // with v8::internal::Internals (in include/v8-internal.h) constants. The
@@ -246,6 +254,10 @@ class IsolateData final {
   ExternalPointerTable* shared_external_pointer_table_;
 #endif
 
+  // This is a storage for an additional argument for the Api callback thunk
+  // functions, see InvokeAccessorGetterCallback and InvokeFunctionCallback.
+  Address api_callback_thunk_argument_ = kNullAddress;
+
   RootsTable roots_table_;
   ExternalReferenceTable external_reference_table_;
 
diff --git a/deps/v8/src/execution/isolate-inl.h b/deps/v8/src/execution/isolate-inl.h
index 8edeb5dfb837ab..d956e5f088cf49 100644
--- a/deps/v8/src/execution/isolate-inl.h
+++ b/deps/v8/src/execution/isolate-inl.h
@@ -41,27 +41,27 @@ V8_INLINE Isolate* Isolate::Current() {
 
 bool Isolate::IsCurrent() const { return this == TryGetCurrent(); }
 
-void Isolate::set_context(Context context) {
-  DCHECK(context.is_null() || context.IsContext());
+void Isolate::set_context(Tagged<Context> context) {
+  DCHECK(context.is_null() || IsContext(context));
   thread_local_top()->context_ = context;
 }
 
 Handle<NativeContext> Isolate::native_context() {
   DCHECK(!context().is_null());
-  return handle(context().native_context(), this);
+  return handle(context()->native_context(), this);
 }
 
-NativeContext Isolate::raw_native_context() {
+Tagged<NativeContext> Isolate::raw_native_context() {
   DCHECK(!context().is_null());
-  return context().native_context();
+  return context()->native_context();
 }
 
-void Isolate::set_pending_message(Object message_obj) {
-  DCHECK(message_obj.IsTheHole(this) || message_obj.IsJSMessageObject());
+void Isolate::set_pending_message(Tagged<Object> message_obj) {
+  DCHECK(IsTheHole(message_obj, this) || IsJSMessageObject(message_obj));
   thread_local_top()->pending_message_ = message_obj;
 }
 
-Object Isolate::pending_message() {
+Tagged<Object> Isolate::pending_message() {
   return thread_local_top()->pending_message_;
 }
 
@@ -70,48 +70,48 @@ void Isolate::clear_pending_message() {
 }
 
 bool Isolate::has_pending_message() {
-  return !pending_message().IsTheHole(this);
+  return !IsTheHole(pending_message(), this);
 }
 
-Object Isolate::pending_exception() {
+Tagged<Object> Isolate::pending_exception() {
   CHECK(has_pending_exception());
-  DCHECK(!thread_local_top()->pending_exception_.IsException(this));
+  DCHECK(!IsException(thread_local_top()->pending_exception_, this));
   return thread_local_top()->pending_exception_;
 }
 
-void Isolate::set_pending_exception(Object exception_obj) {
-  DCHECK(!exception_obj.IsException(this));
+void Isolate::set_pending_exception(Tagged<Object> exception_obj) {
+  DCHECK(!IsException(exception_obj, this));
   thread_local_top()->pending_exception_ = exception_obj;
 }
 
 void Isolate::clear_pending_exception() {
-  DCHECK(!thread_local_top()->pending_exception_.IsException(this));
+  DCHECK(!IsException(thread_local_top()->pending_exception_, this));
   thread_local_top()->pending_exception_ = ReadOnlyRoots(this).the_hole_value();
 }
 
 bool Isolate::has_pending_exception() {
-  DCHECK(!thread_local_top()->pending_exception_.IsException(this));
-  return !thread_local_top()->pending_exception_.IsTheHole(this);
+  DCHECK(!IsException(thread_local_top()->pending_exception_, this));
+  return !IsTheHole(thread_local_top()->pending_exception_, this);
 }
 
-Object Isolate::scheduled_exception() {
+Tagged<Object> Isolate::scheduled_exception() {
   DCHECK(has_scheduled_exception());
-  DCHECK(!thread_local_top()->scheduled_exception_.IsException(this));
+  DCHECK(!IsException(thread_local_top()->scheduled_exception_, this));
   return thread_local_top()->scheduled_exception_;
 }
 
 bool Isolate::has_scheduled_exception() {
-  DCHECK(!thread_local_top()->scheduled_exception_.IsException(this));
+  DCHECK(!IsException(thread_local_top()->scheduled_exception_, this));
   return thread_local_top()->scheduled_exception_ !=
          ReadOnlyRoots(this).the_hole_value();
 }
 
 void Isolate::clear_scheduled_exception() {
-  DCHECK(!thread_local_top()->scheduled_exception_.IsException(this));
+  DCHECK(!IsException(thread_local_top()->scheduled_exception_, this));
   set_scheduled_exception(ReadOnlyRoots(this).the_hole_value());
 }
 
-void Isolate::set_scheduled_exception(Object exception) {
+void Isolate::set_scheduled_exception(Tagged<Object> exception) {
   thread_local_top()->scheduled_exception_ = exception;
 }
 
@@ -126,13 +126,13 @@ bool Isolate::is_execution_terminating() {
 }
 
 #ifdef DEBUG
-Object Isolate::VerifyBuiltinsResult(Object result) {
+Tagged<Object> Isolate::VerifyBuiltinsResult(Tagged<Object> result) {
   DCHECK_EQ(has_pending_exception(), result == ReadOnlyRoots(this).exception());
 #ifdef V8_COMPRESS_POINTERS
   // Check that the returned pointer is actually part of the current isolate,
   // because that's the assumption in generated code (which might call this
   // builtin).
-  if (!result.IsSmi()) {
+  if (!IsSmi(result)) {
     DCHECK_EQ(result.ptr(), V8HeapCompressionScheme::DecompressTagged(
                                 this, static_cast<Tagged_t>(result.ptr())));
   }
@@ -162,13 +162,13 @@ ObjectPair Isolate::VerifyBuiltinsResult(ObjectPair pair) {
 }
 #endif  // DEBUG
 
-bool Isolate::is_catchable_by_javascript(Object exception) {
+bool Isolate::is_catchable_by_javascript(Tagged<Object> exception) {
   return exception != ReadOnlyRoots(heap()).termination_exception();
 }
 
-bool Isolate::is_catchable_by_wasm(Object exception) {
+bool Isolate::is_catchable_by_wasm(Tagged<Object> exception) {
   if (!is_catchable_by_javascript(exception)) return false;
-  if (!exception.IsJSObject()) return true;
+  if (!IsJSObject(exception)) return true;
   // We don't allocate, but the LookupIterator interface expects a handle.
   DisallowGarbageCollection no_gc;
   HandleScope handle_scope(this);
@@ -185,11 +185,11 @@ void Isolate::FireBeforeCallEnteredCallback() {
 }
 
 Handle<JSGlobalObject> Isolate::global_object() {
-  return handle(context().global_object(), this);
+  return handle(context()->global_object(), this);
 }
 
 Handle<JSGlobalProxy> Isolate::global_proxy() {
-  return handle(context().global_proxy(), this);
+  return handle(context()->global_proxy(), this);
 }
 
 Isolate::ExceptionScope::ExceptionScope(Isolate* isolate)
@@ -200,7 +200,7 @@ Isolate::ExceptionScope::~ExceptionScope() {
   isolate_->set_pending_exception(*pending_exception_);
 }
 
-bool Isolate::IsAnyInitialArrayPrototype(JSArray array) {
+bool Isolate::IsAnyInitialArrayPrototype(Tagged<JSArray> array) {
   DisallowGarbageCollection no_gc;
   return IsInAnyContext(array, Context::INITIAL_ARRAY_PROTOTYPE_INDEX);
 }
@@ -235,12 +235,12 @@ void Isolate::DidFinishModuleAsyncEvaluation(unsigned ordinal) {
   }
 }
 
-#define NATIVE_CONTEXT_FIELD_ACCESSOR(index, type, name)    \
-  Handle<type> Isolate::name() {                            \
-    return Handle<type>(raw_native_context().name(), this); \
-  }                                                         \
-  bool Isolate::is_##name(type value) {                     \
-    return raw_native_context().is_##name(value);           \
+#define NATIVE_CONTEXT_FIELD_ACCESSOR(index, type, name)     \
+  Handle<type> Isolate::name() {                             \
+    return Handle<type>(raw_native_context()->name(), this); \
+  }                                                          \
+  bool Isolate::is_##name(type value) {                      \
+    return raw_native_context()->is_##name(value);           \
   }
 NATIVE_CONTEXT_FIELDS(NATIVE_CONTEXT_FIELD_ACCESSOR)
 #undef NATIVE_CONTEXT_FIELD_ACCESSOR
diff --git a/deps/v8/src/execution/isolate-utils-inl.h b/deps/v8/src/execution/isolate-utils-inl.h
index bbefedff4183f1..c3eafef7ca8c79 100644
--- a/deps/v8/src/execution/isolate-utils-inl.h
+++ b/deps/v8/src/execution/isolate-utils-inl.h
@@ -13,7 +13,7 @@
 namespace v8 {
 namespace internal {
 
-V8_INLINE Heap* GetHeapFromWritableObject(HeapObject object) {
+V8_INLINE Heap* GetHeapFromWritableObject(Tagged<HeapObject> object) {
   // Avoid using the below GetIsolateFromWritableObject because we want to be
   // able to get the heap, but not the isolate, for off-thread objects.
 
@@ -26,7 +26,7 @@ V8_INLINE Heap* GetHeapFromWritableObject(HeapObject object) {
 #endif  // V8_ENABLE_THIRD_PARTY_HEAP
 }
 
-V8_INLINE Isolate* GetIsolateFromWritableObject(HeapObject object) {
+V8_INLINE Isolate* GetIsolateFromWritableObject(Tagged<HeapObject> object) {
 #ifdef V8_ENABLE_THIRD_PARTY_HEAP
   return Heap::GetIsolateFromWritableObject(object);
 #else
@@ -34,7 +34,8 @@ V8_INLINE Isolate* GetIsolateFromWritableObject(HeapObject object) {
 #endif  // V8_ENABLE_THIRD_PARTY_HEAP
 }
 
-V8_INLINE bool GetIsolateFromHeapObject(HeapObject object, Isolate** isolate) {
+V8_INLINE bool GetIsolateFromHeapObject(Tagged<HeapObject> object,
+                                        Isolate** isolate) {
 #ifdef V8_ENABLE_THIRD_PARTY_HEAP
   *isolate = Heap::GetIsolateFromWritableObject(object);
   return true;
@@ -52,7 +53,7 @@ V8_INLINE bool GetIsolateFromHeapObject(HeapObject object, Isolate** isolate) {
 
 // Use this function instead of Internals::GetIsolateForSandbox for internal
 // code, as this function is fully inlinable.
-V8_INLINE static Isolate* GetIsolateForSandbox(HeapObject object) {
+V8_INLINE static Isolate* GetIsolateForSandbox(Tagged<HeapObject> object) {
 #ifdef V8_ENABLE_SANDBOX
   return GetIsolateFromWritableObject(object);
 #else
@@ -61,28 +62,6 @@ V8_INLINE static Isolate* GetIsolateForSandbox(HeapObject object) {
 #endif
 }
 
-// This is an external code space friendly version of GetPtrComprCageBase(..)
-// which also works for objects located in external code space.
-//
-// NOTE: it's supposed to be used only for the cases where performance doesn't
-// matter. For example, in debug only code or in debugging macros.
-// In production code the preferred way is to use precomputed cage base value
-// which is a result of PtrComprCageBase{isolate} or GetPtrComprCageBase()
-// applied to a heap object which is known to not be a part of external code
-// space.
-V8_INLINE PtrComprCageBase GetPtrComprCageBaseSlow(HeapObject object) {
-  if (V8_EXTERNAL_CODE_SPACE_BOOL) {
-    Isolate* isolate;
-    if (GetIsolateFromHeapObject(object, &isolate)) {
-      return PtrComprCageBase{isolate};
-    }
-    // If the Isolate can't be obtained then the heap object is a read-only
-    // one and therefore not a InstructionStream object, so fallback to
-    // auto-computing cage base value.
-  }
-  return GetPtrComprCageBase(object);
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/execution/isolate-utils.h b/deps/v8/src/execution/isolate-utils.h
index c41788d9452636..c7176d233d412c 100644
--- a/deps/v8/src/execution/isolate-utils.h
+++ b/deps/v8/src/execution/isolate-utils.h
@@ -15,16 +15,17 @@ namespace internal {
 // computation of cage base inside trivial accessors for optimizing value
 // decompression. When pointer compression is disabled this function always
 // returns nullptr.
-V8_INLINE PtrComprCageBase GetPtrComprCageBase(HeapObject object);
+V8_INLINE PtrComprCageBase GetPtrComprCageBase(Tagged<HeapObject> object);
 
-V8_INLINE Heap* GetHeapFromWritableObject(HeapObject object);
+V8_INLINE Heap* GetHeapFromWritableObject(Tagged<HeapObject> object);
 
-V8_INLINE Isolate* GetIsolateFromWritableObject(HeapObject object);
+V8_INLINE Isolate* GetIsolateFromWritableObject(Tagged<HeapObject> object);
 
 // Returns true if it succeeded to obtain isolate from given object.
 // If it fails then the object is definitely a read-only object but it may also
 // succeed for read only objects if pointer compression is enabled.
-V8_INLINE bool GetIsolateFromHeapObject(HeapObject object, Isolate** isolate);
+V8_INLINE bool GetIsolateFromHeapObject(Tagged<HeapObject> object,
+                                        Isolate** isolate);
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/execution/isolate.cc b/deps/v8/src/execution/isolate.cc
index 06c707da96ca34..cbe353e95f5584 100644
--- a/deps/v8/src/execution/isolate.cc
+++ b/deps/v8/src/execution/isolate.cc
@@ -29,6 +29,7 @@
 #include "src/baseline/baseline-batch-compiler.h"
 #include "src/bigint/bigint.h"
 #include "src/builtins/builtins-promise.h"
+#include "src/builtins/builtins.h"
 #include "src/builtins/constants-table-builder.h"
 #include "src/codegen/assembler-inl.h"
 #include "src/codegen/compilation-cache.h"
@@ -60,7 +61,7 @@
 #include "src/handles/persistent-handles.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap-verifier.h"
-#include "src/heap/local-heap.h"
+#include "src/heap/local-heap-inl.h"
 #include "src/heap/parked-scope.h"
 #include "src/heap/read-only-heap.h"
 #include "src/heap/safepoint.h"
@@ -88,6 +89,7 @@
 #include "src/objects/managed-inl.h"
 #include "src/objects/module-inl.h"
 #include "src/objects/promise-inl.h"
+#include "src/objects/property-descriptor.h"
 #include "src/objects/prototype.h"
 #include "src/objects/slots.h"
 #include "src/objects/smi.h"
@@ -446,17 +448,16 @@ size_t Isolate::HashIsolateForEmbeddedBlob() {
     uint8_t* const code_ptr = reinterpret_cast<uint8_t*>(code.address());
 
     // These static asserts ensure we don't miss relevant fields. We don't hash
-    // code cage base and code entry point. Other data fields must remain the
-    // same.
-    static_assert(Code::kCodePointerFieldsStrongEndOffset ==
-                  Code::kCodeEntryPointOffset);
-
-    static_assert(Code::kCodeEntryPointOffsetEnd + 1 == Code::kFlagsOffset);
-    static_assert(Code::kFlagsOffsetEnd + 1 == Code::kBuiltinIdOffset);
-    static_assert(Code::kBuiltinIdOffsetEnd + 1 ==
-                  Code::kKindSpecificFlagsOffset);
-    static_assert(Code::kKindSpecificFlagsOffsetEnd + 1 ==
-                  Code::kInstructionSizeOffset);
+    // instruction_start, but other data fields must remain the same.
+    static_assert(Code::kEndOfStrongFieldsOffset ==
+                  Code::kInstructionStartOffset);
+#ifdef V8_CODE_POINTER_SANDBOXING
+    static_assert(Code::kCodePointerTableEntryOffsetEnd + 1 ==
+                  Code::kFlagsOffset);
+#else
+    static_assert(Code::kInstructionStartOffsetEnd + 1 == Code::kFlagsOffset);
+#endif
+    static_assert(Code::kFlagsOffsetEnd + 1 == Code::kInstructionSizeOffset);
     static_assert(Code::kInstructionSizeOffsetEnd + 1 ==
                   Code::kMetadataSizeOffset);
     static_assert(Code::kMetadataSizeOffsetEnd + 1 ==
@@ -472,8 +473,9 @@ size_t Isolate::HashIsolateForEmbeddedBlob() {
     static_assert(Code::kConstantPoolOffsetOffsetEnd + 1 ==
                   Code::kCodeCommentsOffsetOffset);
     static_assert(Code::kCodeCommentsOffsetOffsetEnd + 1 ==
-                  Code::kUnalignedSize);
-    constexpr int kStartOffset = Code::kFlagsOffset;
+                  Code::kBuiltinIdOffset);
+    static_assert(Code::kBuiltinIdOffsetEnd + 1 == Code::kUnalignedSize);
+    static constexpr int kStartOffset = Code::kFlagsOffset;
 
     for (int j = kStartOffset; j < Code::kUnalignedSize; j++) {
       hash = base::hash_combine(hash, size_t{code_ptr[j]});
@@ -482,7 +484,7 @@ size_t Isolate::HashIsolateForEmbeddedBlob() {
 
   // The builtins constants table is also tightly tied to embedded builtins.
   hash = base::hash_combine(
-      hash, static_cast<size_t>(heap_.builtins_constants_table().length()));
+      hash, static_cast<size_t>(heap_.builtins_constants_table()->length()));
 
   return hash;
 }
@@ -719,7 +721,7 @@ class CallSiteBuilder {
         limit_(limit),
         caller_(caller),
         skip_next_frame_(mode != SKIP_NONE) {
-    DCHECK_IMPLIES(mode_ == SKIP_UNTIL_SEEN, caller_->IsJSFunction());
+    DCHECK_IMPLIES(mode_ == SKIP_UNTIL_SEEN, IsJSFunction(*caller_));
     // Modern web applications are usually built with multiple layers of
     // framework and library code, and stack depth tends to be more than
     // a dozen frames, so we over-allocate a bit here to avoid growing
@@ -734,6 +736,14 @@ class CallSiteBuilder {
       AppendWasmFrame(summary.AsWasm());
       return true;
     }
+    if (summary.IsWasmInlined()) {
+      AppendWasmInlinedFrame(summary.AsWasmInlined());
+      return true;
+    }
+    if (summary.IsBuiltin()) {
+      AppendBuiltinFrame(summary.AsBuiltin());
+      return true;
+    }
 #endif  // V8_ENABLE_WEBASSEMBLY
     AppendJavaScriptFrame(summary.AsJavaScript());
     return true;
@@ -746,7 +756,7 @@ class CallSiteBuilder {
     if (IsStrictFrame(function)) flags |= CallSiteInfo::kIsStrict;
 
     Handle<Object> receiver(generator_object->receiver(), isolate_);
-    Handle<BytecodeArray> code(function->shared().GetBytecodeArray(isolate_),
+    Handle<BytecodeArray> code(function->shared()->GetBytecodeArray(isolate_),
                                isolate_);
     // The stored bytecode offset is relative to a different base than what
     // is used in the source position table, hence the subtraction.
@@ -758,7 +768,7 @@ class CallSiteBuilder {
       parameters = isolate_->factory()->CopyFixedArrayUpTo(
           handle(generator_object->parameters_and_registers(), isolate_),
           function->shared()
-              .internal_formal_parameter_count_without_receiver());
+              ->internal_formal_parameter_count_without_receiver());
     }
 
     AppendFrame(receiver, function, code, offset, flags, parameters);
@@ -770,7 +780,7 @@ class CallSiteBuilder {
     int flags =
         CallSiteInfo::kIsAsync | CallSiteInfo::kIsSourcePositionComputed;
 
-    Handle<Object> receiver(combinator->native_context().promise_function(),
+    Handle<Object> receiver(combinator->native_context()->promise_function(),
                             isolate_);
     Handle<Code> code(combinator->code(), isolate_);
 
@@ -803,7 +813,7 @@ class CallSiteBuilder {
     if (summary.code()->kind() != wasm::WasmCode::kWasmFunction) return;
     Handle<WasmInstanceObject> instance = summary.wasm_instance();
     int flags = CallSiteInfo::kIsWasm;
-    if (instance->module_object().is_asm_js()) {
+    if (instance->module_object()->is_asm_js()) {
       flags |= CallSiteInfo::kIsAsmJsWasm;
       if (summary.at_to_number_conversion()) {
         flags |= CallSiteInfo::kIsAsmJsAtNumberConversion;
@@ -812,12 +822,31 @@ class CallSiteBuilder {
 
     auto code = Managed<wasm::GlobalWasmCodeRef>::Allocate(
         isolate_, 0, summary.code(),
-        instance->module_object().shared_native_module());
+        instance->module_object()->shared_native_module());
     AppendFrame(instance,
                 handle(Smi::FromInt(summary.function_index()), isolate_), code,
                 summary.code_offset(), flags,
                 isolate_->factory()->empty_fixed_array());
   }
+
+  void AppendWasmInlinedFrame(
+      FrameSummary::WasmInlinedFrameSummary const& summary) {
+    Handle<HeapObject> code = isolate_->factory()->undefined_value();
+    int flags = CallSiteInfo::kIsWasm;
+    AppendFrame(summary.wasm_instance(),
+                handle(Smi::FromInt(summary.function_index()), isolate_), code,
+                summary.code_offset(), flags,
+                isolate_->factory()->empty_fixed_array());
+  }
+
+  void AppendBuiltinFrame(FrameSummary::BuiltinFrameSummary const& summary) {
+    Builtin builtin = summary.builtin();
+    Handle<Code> code = isolate_->builtins()->code_handle(builtin);
+    Handle<Object> function(Smi::FromInt(static_cast<int>(builtin)), isolate_);
+    int flags = CallSiteInfo::kIsBuiltin;
+    AppendFrame(summary.receiver(), function, code, summary.code_offset(),
+                flags, isolate_->factory()->empty_fixed_array());
+  }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   bool Full() { return index_ >= limit_; }
@@ -834,7 +863,7 @@ class CallSiteBuilder {
   bool IsStrictFrame(Handle<JSFunction> function) {
     if (!encountered_strict_function_) {
       encountered_strict_function_ =
-          is_strict(function->shared().language_mode());
+          is_strict(function->shared()->language_mode());
     }
     return encountered_strict_function_;
   }
@@ -871,7 +900,7 @@ class CallSiteBuilder {
     // TODO(szuend): Remove this check once the flag is enabled
     //               by default.
     if (!v8_flags.experimental_stack_trace_frames &&
-        function->shared().IsApiFunction()) {
+        function->shared()->IsApiFunction()) {
       return false;
     }
     // Functions defined not in user scripts are not visible unless directly
@@ -879,8 +908,9 @@ class CallSiteBuilder {
     // The --builtins-in-stack-traces command line flag allows including
     // internal call sites in the stack trace for debugging purposes.
     if (!v8_flags.builtins_in_stack_traces &&
-        !function->shared().IsUserJavaScript()) {
-      return function->shared().native() || function->shared().IsApiFunction();
+        !function->shared()->IsUserJavaScript()) {
+      return function->shared()->native() ||
+             function->shared()->IsApiFunction();
     }
     return true;
   }
@@ -888,7 +918,7 @@ class CallSiteBuilder {
   void AppendFrame(Handle<Object> receiver_or_instance, Handle<Object> function,
                    Handle<HeapObject> code, int offset, int flags,
                    Handle<FixedArray> parameters) {
-    if (receiver_or_instance->IsTheHole(isolate_)) {
+    if (IsTheHole(*receiver_or_instance, isolate_)) {
       // TODO(jgruber): Fix all cases in which frames give us a hole value
       // (e.g. the receiver in RegExp constructor frames).
       receiver_or_instance = isolate_->factory()->undefined_value();
@@ -915,10 +945,10 @@ bool GetStackTraceLimit(Isolate* isolate, int* result) {
   Handle<String> key = isolate->factory()->stackTraceLimit_string();
   Handle<Object> stack_trace_limit =
       JSReceiver::GetDataProperty(isolate, error, key);
-  if (!stack_trace_limit->IsNumber()) return false;
+  if (!IsNumber(*stack_trace_limit)) return false;
 
   // Ensure that limit is not negative.
-  *result = std::max(FastD2IChecked(stack_trace_limit->Number()), 0);
+  *result = std::max(FastD2IChecked(Object::Number(*stack_trace_limit)), 0);
 
   if (*result != v8_flags.stack_trace_limit) {
     isolate->CountUsage(v8::Isolate::kErrorStackTraceLimit);
@@ -927,10 +957,11 @@ bool GetStackTraceLimit(Isolate* isolate, int* result) {
   return true;
 }
 
-bool IsBuiltinFunction(Isolate* isolate, HeapObject object, Builtin builtin) {
-  if (!object.IsJSFunction()) return false;
+bool IsBuiltinFunction(Isolate* isolate, Tagged<HeapObject> object,
+                       Builtin builtin) {
+  if (!IsJSFunction(object)) return false;
   JSFunction const function = JSFunction::cast(object);
-  return function.code() == isolate->builtins()->code(builtin);
+  return function->code() == isolate->builtins()->code(builtin);
 }
 
 void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
@@ -940,10 +971,10 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
     if (promise->status() != Promise::kPending) return;
 
     // Check that we have exactly one PromiseReaction on the {promise}.
-    if (!promise->reactions().IsPromiseReaction()) return;
+    if (!IsPromiseReaction(promise->reactions())) return;
     Handle<PromiseReaction> reaction(
         PromiseReaction::cast(promise->reactions()), isolate);
-    if (!reaction->next().IsSmi()) return;
+    if (!IsSmi(reaction->next())) return;
 
     // Check if the {reaction} has one of the known async function or
     // async generator continuations as its fulfill handler.
@@ -957,7 +988,7 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
       // Now peek into the handlers' AwaitContext to get to
       // the JSGeneratorObject for the async function.
       Handle<Context> context(
-          JSFunction::cast(reaction->fulfill_handler()).context(), isolate);
+          JSFunction::cast(reaction->fulfill_handler())->context(), isolate);
       Handle<JSGeneratorObject> generator_object(
           JSGeneratorObject::cast(context->extension()), isolate);
       CHECK(generator_object->is_suspended());
@@ -966,14 +997,14 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
       builder->AppendAsyncFrame(generator_object);
 
       // Try to continue from here.
-      if (generator_object->IsJSAsyncFunctionObject()) {
+      if (IsJSAsyncFunctionObject(*generator_object)) {
         Handle<JSAsyncFunctionObject> async_function_object =
             Handle<JSAsyncFunctionObject>::cast(generator_object);
         promise = handle(async_function_object->promise(), isolate);
       } else {
         Handle<JSAsyncGeneratorObject> async_generator_object =
             Handle<JSAsyncGeneratorObject>::cast(generator_object);
-        if (async_generator_object->queue().IsUndefined(isolate)) return;
+        if (IsUndefined(async_generator_object->queue(), isolate)) return;
         Handle<AsyncGeneratorRequest> async_generator_request(
             AsyncGeneratorRequest::cast(async_generator_object->queue()),
             isolate);
@@ -985,7 +1016,7 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
       Handle<JSFunction> function(JSFunction::cast(reaction->fulfill_handler()),
                                   isolate);
       Handle<Context> context(function->context(), isolate);
-      Handle<JSFunction> combinator(context->native_context().promise_all(),
+      Handle<JSFunction> combinator(context->native_context()->promise_all(),
                                     isolate);
       builder->AppendPromiseCombinatorFrame(function, combinator);
 
@@ -996,7 +1027,7 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
           PromiseBuiltins::kPromiseAllResolveElementCapabilitySlot;
       Handle<PromiseCapability> capability(
           PromiseCapability::cast(context->get(index)), isolate);
-      if (!capability->promise().IsJSPromise()) return;
+      if (!IsJSPromise(capability->promise())) return;
       promise = handle(JSPromise::cast(capability->promise()), isolate);
     } else if (IsBuiltinFunction(
                    isolate, reaction->fulfill_handler(),
@@ -1005,7 +1036,7 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
                                   isolate);
       Handle<Context> context(function->context(), isolate);
       Handle<JSFunction> combinator(
-          context->native_context().promise_all_settled(), isolate);
+          context->native_context()->promise_all_settled(), isolate);
       builder->AppendPromiseCombinatorFrame(function, combinator);
 
       // Now peak into the Promise.allSettled() resolve element context to
@@ -1015,14 +1046,14 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
           PromiseBuiltins::kPromiseAllResolveElementCapabilitySlot;
       Handle<PromiseCapability> capability(
           PromiseCapability::cast(context->get(index)), isolate);
-      if (!capability->promise().IsJSPromise()) return;
+      if (!IsJSPromise(capability->promise())) return;
       promise = handle(JSPromise::cast(capability->promise()), isolate);
     } else if (IsBuiltinFunction(isolate, reaction->reject_handler(),
                                  Builtin::kPromiseAnyRejectElementClosure)) {
       Handle<JSFunction> function(JSFunction::cast(reaction->reject_handler()),
                                   isolate);
       Handle<Context> context(function->context(), isolate);
-      Handle<JSFunction> combinator(context->native_context().promise_any(),
+      Handle<JSFunction> combinator(context->native_context()->promise_any(),
                                     isolate);
       builder->AppendPromiseCombinatorFrame(function, combinator);
 
@@ -1032,7 +1063,7 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
       int const index = PromiseBuiltins::kPromiseAnyRejectElementCapabilitySlot;
       Handle<PromiseCapability> capability(
           PromiseCapability::cast(context->get(index)), isolate);
-      if (!capability->promise().IsJSPromise()) return;
+      if (!IsJSPromise(capability->promise())) return;
       promise = handle(JSPromise::cast(capability->promise()), isolate);
     } else if (IsBuiltinFunction(isolate, reaction->fulfill_handler(),
                                  Builtin::kPromiseCapabilityDefaultResolve)) {
@@ -1048,16 +1079,16 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
       // (only works for native promise chains).
       Handle<HeapObject> promise_or_capability(
           reaction->promise_or_capability(), isolate);
-      if (promise_or_capability->IsJSPromise()) {
+      if (IsJSPromise(*promise_or_capability)) {
         promise = Handle<JSPromise>::cast(promise_or_capability);
-      } else if (promise_or_capability->IsPromiseCapability()) {
+      } else if (IsPromiseCapability(*promise_or_capability)) {
         Handle<PromiseCapability> capability =
             Handle<PromiseCapability>::cast(promise_or_capability);
-        if (!capability->promise().IsJSPromise()) return;
+        if (!IsJSPromise(capability->promise())) return;
         promise = handle(JSPromise::cast(capability->promise()), isolate);
       } else {
         // Otherwise the {promise_or_capability} must be undefined here.
-        CHECK(promise_or_capability->IsUndefined(isolate));
+        CHECK(IsUndefined(*promise_or_capability, isolate));
         return;
       }
     }
@@ -1066,7 +1097,7 @@ void CaptureAsyncStackTrace(Isolate* isolate, Handle<JSPromise> promise,
 
 void CaptureAsyncStackTrace(Isolate* isolate, CallSiteBuilder* builder) {
   Handle<Object> current_microtask = isolate->factory()->current_microtask();
-  if (current_microtask->IsPromiseReactionJobTask()) {
+  if (IsPromiseReactionJobTask(*current_microtask)) {
     Handle<PromiseReactionJobTask> promise_reaction_job_task =
         Handle<PromiseReactionJobTask>::cast(current_microtask);
     // Check if the {reaction} has one of the known async function or
@@ -1085,12 +1116,12 @@ void CaptureAsyncStackTrace(Isolate* isolate, CallSiteBuilder* builder) {
       // Now peek into the handlers' AwaitContext to get to
       // the JSGeneratorObject for the async function.
       Handle<Context> context(
-          JSFunction::cast(promise_reaction_job_task->handler()).context(),
+          JSFunction::cast(promise_reaction_job_task->handler())->context(),
           isolate);
       Handle<JSGeneratorObject> generator_object(
           JSGeneratorObject::cast(context->extension()), isolate);
       if (generator_object->is_executing()) {
-        if (generator_object->IsJSAsyncFunctionObject()) {
+        if (IsJSAsyncFunctionObject(*generator_object)) {
           Handle<JSAsyncFunctionObject> async_function_object =
               Handle<JSAsyncFunctionObject>::cast(generator_object);
           Handle<JSPromise> promise(async_function_object->promise(), isolate);
@@ -1099,7 +1130,7 @@ void CaptureAsyncStackTrace(Isolate* isolate, CallSiteBuilder* builder) {
           Handle<JSAsyncGeneratorObject> async_generator_object =
               Handle<JSAsyncGeneratorObject>::cast(generator_object);
           Handle<Object> queue(async_generator_object->queue(), isolate);
-          if (!queue->IsUndefined(isolate)) {
+          if (!IsUndefined(*queue, isolate)) {
             Handle<AsyncGeneratorRequest> async_generator_request =
                 Handle<AsyncGeneratorRequest>::cast(queue);
             Handle<JSPromise> promise(
@@ -1115,7 +1146,7 @@ void CaptureAsyncStackTrace(Isolate* isolate, CallSiteBuilder* builder) {
       // the {promise_reaction_job_task}.
       Handle<HeapObject> promise_or_capability(
           promise_reaction_job_task->promise_or_capability(), isolate);
-      if (promise_or_capability->IsJSPromise()) {
+      if (IsJSPromise(*promise_or_capability)) {
         Handle<JSPromise> promise =
             Handle<JSPromise>::cast(promise_or_capability);
         CaptureAsyncStackTrace(isolate, promise, builder);
@@ -1131,6 +1162,7 @@ void VisitStack(Isolate* isolate, Visitor* visitor,
   for (StackFrameIterator it(isolate); !it.done(); it.Advance()) {
     StackFrame* frame = it.frame();
     switch (frame->type()) {
+      case StackFrame::API_CALLBACK_EXIT:
       case StackFrame::BUILTIN_EXIT:
       case StackFrame::JAVA_SCRIPT_BUILTIN_CONTINUATION:
       case StackFrame::JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH:
@@ -1140,6 +1172,7 @@ void VisitStack(Isolate* isolate, Visitor* visitor,
       case StackFrame::BASELINE:
       case StackFrame::BUILTIN:
 #if V8_ENABLE_WEBASSEMBLY
+      case StackFrame::STUB:
       case StackFrame::WASM:
 #endif  // V8_ENABLE_WEBASSEMBLY
       {
@@ -1232,7 +1265,7 @@ MaybeHandle<JSObject> Isolate::CaptureAndSetErrorStack(
   // collect a "detailed stack trace" eagerly and stash that away.
   if (capture_stack_trace_for_uncaught_exceptions_) {
     Handle<Object> limit_or_stack_frame_infos;
-    if (error_stack->IsUndefined(this) ||
+    if (IsUndefined(*error_stack, this) ||
         (stack_trace_for_uncaught_exceptions_options_ &
          StackTrace::kExposeFramesAcrossSecurityOrigins)) {
       limit_or_stack_frame_infos = CaptureDetailedStackTrace(
@@ -1259,34 +1292,34 @@ MaybeHandle<JSObject> Isolate::CaptureAndSetErrorStack(
 }
 
 Handle<FixedArray> Isolate::GetDetailedStackTrace(
-    Handle<JSReceiver> error_object) {
-  Handle<Object> error_stack = JSReceiver::GetDataProperty(
-      this, error_object, factory()->error_stack_symbol());
-  if (!error_stack->IsErrorStackData()) {
-    return Handle<FixedArray>();
-  }
+    Handle<JSReceiver> maybe_error_object) {
+  ErrorUtils::StackPropertyLookupResult lookup =
+      ErrorUtils::GetErrorStackProperty(this, maybe_error_object);
+
+  if (!IsErrorStackData(*lookup.error_stack)) return {};
   Handle<ErrorStackData> error_stack_data =
-      Handle<ErrorStackData>::cast(error_stack);
+      Handle<ErrorStackData>::cast(lookup.error_stack);
+
   ErrorStackData::EnsureStackFrameInfos(this, error_stack_data);
-  if (!error_stack_data->limit_or_stack_frame_infos().IsFixedArray()) {
-    return Handle<FixedArray>();
-  }
+
+  if (!IsFixedArray(error_stack_data->limit_or_stack_frame_infos())) return {};
   return handle(
       FixedArray::cast(error_stack_data->limit_or_stack_frame_infos()), this);
 }
 
 Handle<FixedArray> Isolate::GetSimpleStackTrace(
-    Handle<JSReceiver> error_object) {
-  Handle<Object> error_stack = JSReceiver::GetDataProperty(
-      this, error_object, factory()->error_stack_symbol());
-  if (error_stack->IsFixedArray()) {
-    return Handle<FixedArray>::cast(error_stack);
+    Handle<JSReceiver> maybe_error_object) {
+  ErrorUtils::StackPropertyLookupResult lookup =
+      ErrorUtils::GetErrorStackProperty(this, maybe_error_object);
+
+  if (IsFixedArray(*lookup.error_stack)) {
+    return Handle<FixedArray>::cast(lookup.error_stack);
   }
-  if (!error_stack->IsErrorStackData()) {
+  if (!IsErrorStackData(*lookup.error_stack)) {
     return factory()->empty_fixed_array();
   }
   Handle<ErrorStackData> error_stack_data =
-      Handle<ErrorStackData>::cast(error_stack);
+      Handle<ErrorStackData>::cast(lookup.error_stack);
   if (!error_stack_data->HasCallSiteInfos()) {
     return factory()->empty_fixed_array();
   }
@@ -1304,15 +1337,15 @@ Address Isolate::GetAbstractPC(int* line, int* column) {
   JavaScriptFrame* frame = it.frame();
   DCHECK(!frame->is_builtin());
 
-  Handle<SharedFunctionInfo> shared = handle(frame->function().shared(), this);
+  Handle<SharedFunctionInfo> shared = handle(frame->function()->shared(), this);
   SharedFunctionInfo::EnsureSourcePositionsAvailable(this, shared);
   int position = frame->position();
 
-  Object maybe_script = frame->function().shared().script();
-  if (maybe_script.IsScript()) {
+  Tagged<Object> maybe_script = frame->function()->shared()->script();
+  if (IsScript(maybe_script)) {
     Handle<Script> script(Script::cast(maybe_script), this);
     Script::PositionInfo info;
-    Script::GetPositionInfo(script, position, &info, Script::WITH_OFFSET);
+    Script::GetPositionInfo(script, position, &info);
     *line = info.line + 1;
     *column = info.column + 1;
   } else {
@@ -1323,7 +1356,7 @@ Address Isolate::GetAbstractPC(int* line, int* column) {
   if (frame->is_unoptimized()) {
     UnoptimizedFrame* iframe = static_cast<UnoptimizedFrame*>(frame);
     Address bytecode_start =
-        iframe->GetBytecodeArray().GetFirstBytecodeAddress();
+        iframe->GetBytecodeArray()->GetFirstBytecodeAddress();
     return bytecode_start + iframe->GetBytecodeOffset();
   }
 
@@ -1391,7 +1424,7 @@ class CurrentScriptNameStackVisitor {
     Handle<Script> script = Handle<Script>::cast(summary.script());
     Handle<Object> name_or_url_obj =
         handle(script->GetNameOrSourceURL(), isolate_);
-    if (!name_or_url_obj->IsString()) return true;
+    if (!IsString(*name_or_url_obj)) return true;
 
     Handle<String> name_or_url = Handle<String>::cast(name_or_url_obj);
     if (!name_or_url->length()) return true;
@@ -1471,12 +1504,13 @@ void Isolate::SetFailedAccessCheckCallback(
   thread_local_top()->failed_access_check_callback_ = callback;
 }
 
-void Isolate::ReportFailedAccessCheck(Handle<JSObject> receiver) {
+MaybeHandle<Object> Isolate::ReportFailedAccessCheck(
+    Handle<JSObject> receiver) {
   if (!thread_local_top()->failed_access_check_callback_) {
-    return ScheduleThrow(*factory()->NewTypeError(MessageTemplate::kNoAccess));
+    THROW_NEW_ERROR(this, NewTypeError(MessageTemplate::kNoAccess), Object);
   }
 
-  DCHECK(receiver->IsAccessCheckNeeded());
+  DCHECK(IsAccessCheckNeeded(*receiver));
   DCHECK(!context().is_null());
 
   // Get the data object from access check info.
@@ -1487,21 +1521,25 @@ void Isolate::ReportFailedAccessCheck(Handle<JSObject> receiver) {
     AccessCheckInfo access_check_info = AccessCheckInfo::Get(this, receiver);
     if (access_check_info.is_null()) {
       no_gc.Release();
-      return ScheduleThrow(
-          *factory()->NewTypeError(MessageTemplate::kNoAccess));
+      THROW_NEW_ERROR(this, NewTypeError(MessageTemplate::kNoAccess), Object);
     }
-    data = handle(access_check_info.data(), this);
+    data = handle(access_check_info->data(), this);
   }
 
-  // Leaving JavaScript.
-  VMState<EXTERNAL> state(this);
-  thread_local_top()->failed_access_check_callback_(
-      v8::Utils::ToLocal(receiver), v8::ACCESS_HAS, v8::Utils::ToLocal(data));
+  {
+    // Leaving JavaScript.
+    VMState<EXTERNAL> state(this);
+    thread_local_top()->failed_access_check_callback_(
+        v8::Utils::ToLocal(receiver), v8::ACCESS_HAS, v8::Utils::ToLocal(data));
+  }
+  RETURN_VALUE_IF_SCHEDULED_EXCEPTION(this, {});
+  // Throw exception even the callback forgot to do so.
+  THROW_NEW_ERROR(this, NewTypeError(MessageTemplate::kNoAccess), Object);
 }
 
-bool Isolate::MayAccess(Handle<Context> accessing_context,
+bool Isolate::MayAccess(Handle<NativeContext> accessing_context,
                         Handle<JSObject> receiver) {
-  DCHECK(receiver->IsJSGlobalProxy() || receiver->IsAccessCheckNeeded());
+  DCHECK(IsJSGlobalProxy(*receiver) || IsAccessCheckNeeded(*receiver));
 
   // Check for compatibility between the security tokens in the
   // current lexical context and the accessed object.
@@ -1511,18 +1549,15 @@ bool Isolate::MayAccess(Handle<Context> accessing_context,
   {
     DisallowGarbageCollection no_gc;
 
-    if (receiver->IsJSGlobalProxy()) {
-      Object receiver_context = JSGlobalProxy::cast(*receiver).native_context();
-      if (!receiver_context.IsContext()) return false;
+    if (IsJSGlobalProxy(*receiver)) {
+      Tagged<Object> receiver_context =
+          JSGlobalProxy::cast(*receiver)->native_context();
+      if (!IsContext(receiver_context)) return false;
 
-      // Get the native context of current top context.
-      // avoid using Isolate::native_context() because it uses Handle.
-      Context native_context =
-          accessing_context->global_object().native_context();
-      if (receiver_context == native_context) return true;
+      if (receiver_context == *accessing_context) return true;
 
-      if (Context::cast(receiver_context).security_token() ==
-          native_context.security_token())
+      if (Context::cast(receiver_context)->security_token() ==
+          accessing_context->security_token())
         return true;
     }
   }
@@ -1534,9 +1569,9 @@ bool Isolate::MayAccess(Handle<Context> accessing_context,
     DisallowGarbageCollection no_gc;
     AccessCheckInfo access_check_info = AccessCheckInfo::Get(this, receiver);
     if (access_check_info.is_null()) return false;
-    Object fun_obj = access_check_info.callback();
+    Tagged<Object> fun_obj = access_check_info->callback();
     callback = v8::ToCData<v8::AccessCheckCallback>(fun_obj);
-    data = handle(access_check_info.data(), this);
+    data = handle(access_check_info->data(), this);
   }
 
   {
@@ -1547,7 +1582,7 @@ bool Isolate::MayAccess(Handle<Context> accessing_context,
   }
 }
 
-Object Isolate::StackOverflow() {
+Tagged<Object> Isolate::StackOverflow() {
   // Whoever calls this method should not have overflown the stack limit by too
   // much. Otherwise we risk actually running out of stack space.
   // We allow for up to 8kB overflow, because we typically allow up to 4KB
@@ -1587,7 +1622,7 @@ Object Isolate::StackOverflow() {
 
 #ifdef VERIFY_HEAP
   if (v8_flags.verify_heap && v8_flags.stress_compaction) {
-    heap()->CollectAllGarbage(Heap::kNoGCFlags,
+    heap()->CollectAllGarbage(GCFlag::kNoFlags,
                               GarbageCollectionReason::kTesting);
   }
 #endif  // VERIFY_HEAP
@@ -1595,7 +1630,8 @@ Object Isolate::StackOverflow() {
   return ReadOnlyRoots(heap()).exception();
 }
 
-Object Isolate::ThrowAt(Handle<JSObject> exception, MessageLocation* location) {
+Tagged<Object> Isolate::ThrowAt(Handle<JSObject> exception,
+                                MessageLocation* location) {
   Handle<Name> key_start_pos = factory()->error_start_pos_symbol();
   Object::SetProperty(this, exception, key_start_pos,
                       handle(Smi::FromInt(location->start_pos()), this),
@@ -1619,7 +1655,7 @@ Object Isolate::ThrowAt(Handle<JSObject> exception, MessageLocation* location) {
   return ThrowInternal(*exception, location);
 }
 
-Object Isolate::TerminateExecution() {
+Tagged<Object> Isolate::TerminateExecution() {
   return Throw(ReadOnlyRoots(this).termination_exception());
 }
 
@@ -1660,6 +1696,20 @@ void Isolate::InvokeApiInterruptCallbacks() {
   }
 }
 
+void Isolate::RequestInvalidateNoProfilingProtector() {
+  // This request might be triggered from arbitrary thread but protector
+  // invalidation must happen on the main thread, so use Api interrupt
+  // to achieve that.
+  RequestInterrupt(
+      [](v8::Isolate* isolate, void*) {
+        Isolate* i_isolate = reinterpret_cast<Isolate*>(isolate);
+        if (Protectors::IsNoProfilingIntact(i_isolate)) {
+          Protectors::InvalidateNoProfiling(i_isolate);
+        }
+      },
+      nullptr);
+}
+
 namespace {
 
 void ReportBootstrappingException(Handle<Object> exception,
@@ -1673,27 +1723,27 @@ void ReportBootstrappingException(Handle<Object> exception,
   // to the console for easier debugging.
   int line_number =
       location->script()->GetLineNumber(location->start_pos()) + 1;
-  if (exception->IsString() && location->script()->name().IsString()) {
+  if (IsString(*exception) && IsString(location->script()->name())) {
     base::OS::PrintError(
         "Extension or internal compilation error: %s in %s at line %d.\n",
-        String::cast(*exception).ToCString().get(),
-        String::cast(location->script()->name()).ToCString().get(),
+        String::cast(*exception)->ToCString().get(),
+        String::cast(location->script()->name())->ToCString().get(),
         line_number);
-  } else if (location->script()->name().IsString()) {
+  } else if (IsString(location->script()->name())) {
     base::OS::PrintError(
         "Extension or internal compilation error in %s at line %d.\n",
-        String::cast(location->script()->name()).ToCString().get(),
+        String::cast(location->script()->name())->ToCString().get(),
         line_number);
-  } else if (exception->IsString()) {
+  } else if (IsString(*exception)) {
     base::OS::PrintError("Extension or internal compilation error: %s.\n",
-                         String::cast(*exception).ToCString().get());
+                         String::cast(*exception)->ToCString().get());
   } else {
     base::OS::PrintError("Extension or internal compilation error.\n");
   }
 #ifdef OBJECT_PRINT
   // Since comments and empty lines have been stripped from the source of
   // builtins, print the actual source here so that line numbers match.
-  if (location->script()->source().IsString()) {
+  if (IsString(location->script()->source())) {
     Handle<String> src(String::cast(location->script()->source()),
                        location->script()->GetIsolate());
     PrintF("Failing script:");
@@ -1753,7 +1803,8 @@ Handle<JSMessageObject> Isolate::CreateMessageOrAbort(
   return message_obj;
 }
 
-Object Isolate::ThrowInternal(Object raw_exception, MessageLocation* location) {
+Tagged<Object> Isolate::ThrowInternal(Tagged<Object> raw_exception,
+                                      MessageLocation* location) {
   DCHECK(!has_pending_exception());
   IF_WASM(DCHECK_IMPLIES, trap_handler::IsTrapHandlerEnabled(),
           !trap_handler::IsThreadInWasm());
@@ -1768,8 +1819,8 @@ Object Isolate::ThrowInternal(Object raw_exception, MessageLocation* location) {
       Handle<Script> script = location->script();
       Handle<Object> name(script->GetNameOrSourceURL(), this);
       PrintF("at ");
-      if (name->IsString() && String::cast(*name).length() > 0)
-        String::cast(*name).PrintOn(stdout);
+      if (IsString(*name) && String::cast(*name)->length() > 0)
+        String::cast(*name)->PrintOn(stdout);
       else
         PrintF("<anonymous>");
 // Script::GetLineNumber and Script::GetColumnNumber can allocate on the heap to
@@ -1779,18 +1830,19 @@ Object Isolate::ThrowInternal(Object raw_exception, MessageLocation* location) {
 #else
       if ((false)) {
 #endif
-        PrintF(", %d:%d - %d:%d\n",
-               Script::GetLineNumber(script, location->start_pos()) + 1,
-               Script::GetColumnNumber(script, location->start_pos()),
-               Script::GetLineNumber(script, location->end_pos()) + 1,
-               Script::GetColumnNumber(script, location->end_pos()));
+        Script::PositionInfo start_pos;
+        Script::PositionInfo end_pos;
+        Script::GetPositionInfo(script, location->start_pos(), &start_pos);
+        Script::GetPositionInfo(script, location->end_pos(), &end_pos);
+        PrintF(", %d:%d - %d:%d\n", start_pos.line + 1, start_pos.column + 1,
+               end_pos.line + 1, end_pos.column + 1);
         // Make sure to update the raw exception pointer in case it moved.
         raw_exception = *exception;
       } else {
         PrintF(", line %d\n", script->GetLineNumber(location->start_pos()) + 1);
       }
     }
-    raw_exception.Print();
+    Print(raw_exception);
     PrintF("Stack Trace:\n");
     PrintStack(stdout);
     PrintF("=========================================================\n");
@@ -1813,7 +1865,8 @@ Object Isolate::ThrowInternal(Object raw_exception, MessageLocation* location) {
 
   // Notify debugger of exception.
   if (is_catchable_by_javascript(raw_exception)) {
-    base::Optional<Object> maybe_exception = debug()->OnThrow(exception);
+    base::Optional<Tagged<Object>> maybe_exception =
+        debug()->OnThrow(exception);
     if (maybe_exception.has_value()) {
       return *maybe_exception;
     }
@@ -1842,7 +1895,7 @@ Object Isolate::ThrowInternal(Object raw_exception, MessageLocation* location) {
   return ReadOnlyRoots(heap()).exception();
 }
 
-Object Isolate::ReThrow(Object exception) {
+Tagged<Object> Isolate::ReThrow(Tagged<Object> exception) {
   DCHECK(!has_pending_exception());
 
   // Set the exception being re-thrown.
@@ -1850,7 +1903,8 @@ Object Isolate::ReThrow(Object exception) {
   return ReadOnlyRoots(heap()).exception();
 }
 
-Object Isolate::ReThrow(Object exception, Object message) {
+Tagged<Object> Isolate::ReThrow(Tagged<Object> exception,
+                                Tagged<Object> message) {
   DCHECK(!has_pending_exception());
   DCHECK(!has_pending_message());
 
@@ -1881,7 +1935,7 @@ class SetThreadInWasmFlagScope {
 #endif  // V8_ENABLE_WEBASSEMBLY
 }  // namespace
 
-Object Isolate::UnwindAndFindHandler() {
+Tagged<Object> Isolate::UnwindAndFindHandler() {
   // TODO(v8:12676): Fix gcmole failures in this function.
   DisableGCMole no_gcmole;
   DisallowGarbageCollection no_gc;
@@ -1894,7 +1948,7 @@ Object Isolate::UnwindAndFindHandler() {
   // handler handles such non-wasm exceptions.
   SetThreadInWasmFlagScope set_thread_in_wasm_flag_scope;
 #endif  // V8_ENABLE_WEBASSEMBLY
-  Object exception = pending_exception();
+  Tagged<Object> exception = pending_exception();
 
   auto FoundHandler = [&](Context context, Address instruction_start,
                           intptr_t handler_offset,
@@ -1928,7 +1982,7 @@ Object Isolate::UnwindAndFindHandler() {
     // uncatchable terminate exception, we need to clear the array join stack to
     // avoid leaving the stack in an invalid state.
     // See also CycleProtectedArrayJoin.
-    raw_native_context().set_array_join_stack(
+    raw_native_context()->set_array_join_stack(
         ReadOnlyRoots(this).undefined_value());
   }
 
@@ -1936,7 +1990,7 @@ Object Isolate::UnwindAndFindHandler() {
 
 #if V8_ENABLE_WEBASSEMBLY
   // Iterate the chain of stack segments for wasm stack switching.
-  WasmContinuationObject current_stack;
+  Tagged<WasmContinuationObject> current_stack;
   if (v8_flags.experimental_wasm_stack_switching) {
     current_stack =
         WasmContinuationObject::cast(root(RootIndex::kActiveContinuation));
@@ -1947,43 +2001,16 @@ Object Isolate::UnwindAndFindHandler() {
   // over the stack and dispatching according to the frame type.
   for (StackFrameIterator iter(this);; iter.Advance(), visited_frames++) {
 #if V8_ENABLE_WEBASSEMBLY
-    if (v8_flags.experimental_wasm_stack_switching && iter.done()) {
-      // We reached the end of the current stack segment. Follow the linked-list
-      // of stacks to find the next frame, and perform the implicit stack
-      // switch.
-      auto stack = Managed<wasm::StackMemory>::cast(current_stack.stack());
-      // Mark this stack as empty.
-      DCHECK_EQ(stack.get()->jmpbuf()->state, wasm::JumpBuffer::Active);
-      stack.get()->jmpbuf()->state = wasm::JumpBuffer::Retired;
-      HeapObject parent = current_stack.parent();
-      DCHECK(!parent.IsUndefined());
-      current_stack = WasmContinuationObject::cast(parent);
-      wasm::StackMemory* parent_stack =
-          Managed<wasm::StackMemory>::cast(current_stack.stack()).get().get();
-      DCHECK_EQ(parent_stack->jmpbuf()->state, wasm::JumpBuffer::Inactive);
-      parent_stack->jmpbuf()->state = wasm::JumpBuffer::Active;
-      iter.Reset(thread_local_top(), parent_stack);
-
-      // Update the continuation and suspender state.
-      roots_table().slot(RootIndex::kActiveContinuation).store(current_stack);
-      WasmSuspenderObject suspender =
-          WasmSuspenderObject::cast(root(RootIndex::kActiveSuspender));
-      if (!suspender.parent().IsUndefined()) {
-        suspender.set_state(WasmSuspenderObject::State::kInactive);
-        auto parent_suspender = WasmSuspenderObject::cast(suspender.parent());
-        parent_suspender.set_state(WasmSuspenderObject::State::kActive);
-        // For now, assume that a suspender contains a single continuation.
-        // TODO(thibaudm): When core stack-switching is added, only update the
-        // suspender when we exit its outermost stack.
-        DCHECK_EQ(current_stack, parent_suspender.continuation());
-      }
-      roots_table().slot(RootIndex::kActiveSuspender).store(suspender.parent());
-      if (v8_flags.trace_wasm_stack_switching) {
-        PrintF("Switch to stack #%d (unwind)\n", parent_stack->id());
-      }
-      uintptr_t limit =
-          reinterpret_cast<uintptr_t>(parent_stack->jmpbuf()->stack_limit);
-      stack_guard()->SetStackLimit(limit);
+    if (v8_flags.experimental_wasm_stack_switching &&
+        iter.frame()->type() == StackFrame::STACK_SWITCH) {
+      Code code = builtins()->code(Builtin::kWasmReturnPromiseOnSuspendAsm);
+      HandlerTable table(code);
+      Address instruction_start =
+          code->InstructionStart(this, iter.frame()->pc());
+      int handler_offset = table.LookupReturn(0);
+      return FoundHandler(Context(), instruction_start, handler_offset,
+                          kNullAddress, iter.frame()->sp(), iter.frame()->fp(),
+                          visited_frames);
     }
 #endif
     // Handler must exist.
@@ -2001,34 +2028,33 @@ Object Isolate::UnwindAndFindHandler() {
       CHECK(!catchable_by_js);
       CHECK(frame->is_java_script());
 
-      if (frame->is_turbofan()) {
+      if (frame->is_optimized()) {
         Code code = frame->LookupCode();
         // The debugger triggers lazy deopt for the "to-be-restarted" frame
         // immediately when the CDP event arrives while paused.
-        CHECK(code.marked_for_deoptimization());
+        CHECK(code->marked_for_deoptimization());
         set_deoptimizer_lazy_throw(true);
 
         // Jump directly to the optimized frames return, to immediately fall
         // into the deoptimizer.
         const int offset =
-            static_cast<int>(frame->pc() - code.InstructionStart());
+            static_cast<int>(frame->pc() - code->instruction_start());
 
         // Compute the stack pointer from the frame pointer. This ensures that
         // argument slots on the stack are dropped as returning would.
         // Note: Needed by the deoptimizer to rematerialize frames.
         Address return_sp = frame->fp() +
                             StandardFrameConstants::kFixedFrameSizeAboveFp -
-                            code.stack_slots() * kSystemPointerSize;
-        return FoundHandler(Context(), code.InstructionStart(), offset,
-                            code.constant_pool(), return_sp, frame->fp(),
+                            code->stack_slots() * kSystemPointerSize;
+        return FoundHandler(Context(), code->instruction_start(), offset,
+                            code->constant_pool(), return_sp, frame->fp(),
                             visited_frames);
       }
-      DCHECK(!frame->is_maglev());
 
       debug()->clear_restart_frame();
       Code code = *BUILTIN_CODE(this, RestartFrameTrampoline);
-      return FoundHandler(Context(), code.InstructionStart(), 0,
-                          code.constant_pool(), kNullAddress, frame->fp(),
+      return FoundHandler(Context(), code->instruction_start(), 0,
+                          code->constant_pool(), kNullAddress, frame->fp(),
                           visited_frames);
     }
 
@@ -2044,8 +2070,9 @@ Object Isolate::UnwindAndFindHandler() {
         // Gather information from the handler.
         Code code = frame->LookupCode();
         HandlerTable table(code);
-        return FoundHandler(Context(), code.InstructionStart(this, frame->pc()),
-                            table.LookupReturn(0), code.constant_pool(),
+        return FoundHandler(Context(),
+                            code->InstructionStart(this, frame->pc()),
+                            table.LookupReturn(0), code->constant_pool(),
                             handler->address() + StackHandlerConstants::kSize,
                             0, visited_frames);
       }
@@ -2056,7 +2083,7 @@ Object Isolate::UnwindAndFindHandler() {
         thread_local_top()->handler_ = handler->next_address();
         Code code = frame->LookupCode();
         HandlerTable table(code);
-        Address instruction_start = code.InstructionStart();
+        Address instruction_start = code->instruction_start();
         int return_offset = static_cast<int>(frame->pc() - instruction_start);
         int handler_offset = table.LookupReturn(return_offset);
         DCHECK_NE(-1, handler_offset);
@@ -2064,9 +2091,9 @@ Object Isolate::UnwindAndFindHandler() {
         // argument slots on the stack are dropped as returning would.
         Address return_sp = frame->fp() +
                             StandardFrameConstants::kFixedFrameSizeAboveFp -
-                            code.stack_slots() * kSystemPointerSize;
+                            code->stack_slots() * kSystemPointerSize;
         return FoundHandler(Context(), instruction_start, handler_offset,
-                            code.constant_pool(), return_sp, frame->fp(),
+                            code->constant_pool(), return_sp, frame->fp(),
                             visited_frames);
       }
 
@@ -2104,6 +2131,19 @@ Object Isolate::UnwindAndFindHandler() {
         // out to user code that could throw.
         UNREACHABLE();
       }
+      case StackFrame::WASM_TO_JS:
+        if (v8_flags.experimental_wasm_stack_switching) {
+          // Decrement the Wasm-to-JS counter.
+          Tagged<Object> suspender_obj = root(RootIndex::kActiveSuspender);
+          if (!IsUndefined(suspender_obj)) {
+            Tagged<WasmSuspenderObject> suspender =
+                WasmSuspenderObject::cast(suspender_obj);
+            int wasm_to_js_counter = suspender->wasm_to_js_counter();
+            DCHECK_LT(0, wasm_to_js_counter);
+            suspender->set_wasm_to_js_counter(wasm_to_js_counter - 1);
+          }
+        }
+        break;
 #endif  // V8_ENABLE_WEBASSEMBLY
 
       case StackFrame::MAGLEV:
@@ -2119,22 +2159,22 @@ Object Isolate::UnwindAndFindHandler() {
         // that argument slots on the stack are dropped as returning would.
         Address return_sp = frame->fp() +
                             StandardFrameConstants::kFixedFrameSizeAboveFp -
-                            code.stack_slots() * kSystemPointerSize;
+                            code->stack_slots() * kSystemPointerSize;
 
         // TODO(bmeurer): Turbofanned BUILTIN frames appear as TURBOFAN,
         // but do not have a code kind of TURBOFAN.
-        if (CodeKindCanDeoptimize(code.kind()) &&
-            code.marked_for_deoptimization()) {
+        if (CodeKindCanDeoptimize(code->kind()) &&
+            code->marked_for_deoptimization()) {
           // If the target code is lazy deoptimized, we jump to the original
           // return address, but we make a note that we are throwing, so
           // that the deoptimizer can do the right thing.
-          offset = static_cast<int>(frame->pc() - code.InstructionStart());
+          offset = static_cast<int>(frame->pc() - code->instruction_start());
           set_deoptimizer_lazy_throw(true);
         }
 
-        return FoundHandler(Context(), code.InstructionStart(this, frame->pc()),
-                            offset, code.constant_pool(), return_sp,
-                            frame->fp(), visited_frames);
+        return FoundHandler(
+            Context(), code->InstructionStart(this, frame->pc()), offset,
+            code->constant_pool(), return_sp, frame->fp(), visited_frames);
       }
 
       case StackFrame::STUB: {
@@ -2149,8 +2189,7 @@ Object Isolate::UnwindAndFindHandler() {
         // The code might be a dynamically generated stub or a turbofanned
         // embedded builtin.
         Code code = stub_frame->LookupCode();
-        if (code.kind() != CodeKind::BUILTIN || !code.is_turbofanned() ||
-            !code.has_handler_table()) {
+        if (!code->is_turbofanned() || !code->has_handler_table()) {
           break;
         }
 
@@ -2161,11 +2200,11 @@ Object Isolate::UnwindAndFindHandler() {
         // that argument slots on the stack are dropped as returning would.
         Address return_sp = frame->fp() +
                             StandardFrameConstants::kFixedFrameSizeAboveFp -
-                            code.stack_slots() * kSystemPointerSize;
+                            code->stack_slots() * kSystemPointerSize;
 
-        return FoundHandler(Context(), code.InstructionStart(this, frame->pc()),
-                            offset, code.constant_pool(), return_sp,
-                            frame->fp(), visited_frames);
+        return FoundHandler(
+            Context(), code->InstructionStart(this, frame->pc()), offset,
+            code->constant_pool(), return_sp, frame->fp(), visited_frames);
       }
 
       case StackFrame::INTERPRETED:
@@ -2174,7 +2213,7 @@ Object Isolate::UnwindAndFindHandler() {
         if (!catchable_by_js) break;
         UnoptimizedFrame* js_frame = UnoptimizedFrame::cast(frame);
         int register_slots = UnoptimizedFrameConstants::RegisterStackSlotCount(
-            js_frame->GetBytecodeArray().register_count());
+            js_frame->GetBytecodeArray()->register_count());
         int context_reg = 0;  // Will contain register index holding context.
         int offset =
             js_frame->LookupExceptionHandlerInTable(&context_reg, nullptr);
@@ -2194,7 +2233,7 @@ Object Isolate::UnwindAndFindHandler() {
         // the correct context for the handler from the interpreter register.
         Context context =
             Context::cast(js_frame->ReadInterpreterRegister(context_reg));
-        DCHECK(context.IsContext());
+        DCHECK(IsContext(context));
 
         if (frame->is_baseline()) {
           BaselineFrame* sp_frame = BaselineFrame::cast(js_frame);
@@ -2203,8 +2242,8 @@ Object Isolate::UnwindAndFindHandler() {
           // Patch the context register directly on the frame, so that we don't
           // need to have a context read + write in the baseline code.
           sp_frame->PatchContext(context);
-          return FoundHandler(Context(), code.InstructionStart(), pc_offset,
-                              code.constant_pool(), return_sp, sp_frame->fp(),
+          return FoundHandler(Context(), code->instruction_start(), pc_offset,
+                              code->constant_pool(), return_sp, sp_frame->fp(),
                               visited_frames);
         } else {
           InterpretedFrame::cast(js_frame)->PatchBytecodeOffset(
@@ -2219,8 +2258,8 @@ Object Isolate::UnwindAndFindHandler() {
           // because at a minimum, an exit frame into C++ has to separate
           // it and the context in which this C++ code runs.
           CHECK_GE(visited_frames, 1);
-          return FoundHandler(context, code.InstructionStart(), 0,
-                              code.constant_pool(), return_sp, frame->fp(),
+          return FoundHandler(context, code->instruction_start(), 0,
+                              code->constant_pool(), return_sp, frame->fp(),
                               visited_frames - 1);
         }
       }
@@ -2243,8 +2282,8 @@ Object Isolate::UnwindAndFindHandler() {
         // Reconstruct the stack pointer from the frame pointer.
         Address return_sp = js_frame->fp() - js_frame->GetSPToFPDelta();
         Code code = js_frame->LookupCode();
-        return FoundHandler(Context(), code.InstructionStart(), 0,
-                            code.constant_pool(), return_sp, frame->fp(),
+        return FoundHandler(Context(), code->instruction_start(), 0,
+                            code->constant_pool(), return_sp, frame->fp(),
                             visited_frames);
       }
 
@@ -2259,7 +2298,7 @@ Object Isolate::UnwindAndFindHandler() {
       USE(removed);
       // If there were any materialized objects, the code should be
       // marked for deopt.
-      DCHECK_IMPLIES(removed, frame->LookupCode().marked_for_deoptimization());
+      DCHECK_IMPLIES(removed, frame->LookupCode()->marked_for_deoptimization());
     }
   }
 
@@ -2267,6 +2306,19 @@ Object Isolate::UnwindAndFindHandler() {
 }
 
 namespace {
+
+HandlerTable::CatchPrediction CatchPredictionFor(Builtin builtin_id) {
+  switch (builtin_id) {
+#define CASE(Name)       \
+  case Builtin::k##Name: \
+    return HandlerTable::PROMISE;
+    BUILTIN_PROMISE_REJECTION_PREDICTION_LIST(CASE)
+#undef CASE
+    default:
+      return HandlerTable::UNCAUGHT;
+  }
+}
+
 HandlerTable::CatchPrediction PredictException(JavaScriptFrame* frame) {
   HandlerTable::CatchPrediction prediction;
   if (frame->is_optimized()) {
@@ -2281,7 +2333,7 @@ HandlerTable::CatchPrediction PredictException(JavaScriptFrame* frame) {
         const FrameSummary& summary = summaries[i - 1];
         Handle<AbstractCode> code = summary.AsJavaScript().abstract_code();
         if (code->kind(cage_base) == CodeKind::BUILTIN) {
-          prediction = code->GetBuiltinCatchPrediction(cage_base);
+          auto prediction = CatchPredictionFor(code->GetCode()->builtin_id());
           if (prediction == HandlerTable::UNCAUGHT) continue;
           return prediction;
         }
@@ -2364,14 +2416,14 @@ Isolate::CatchType Isolate::PredictExceptionCatcher() {
           break;
         }
 
-        CatchType prediction = ToCatchType(code->GetBuiltinCatchPrediction());
+        auto prediction = ToCatchType(CatchPredictionFor(code->builtin_id()));
         if (prediction != NOT_CAUGHT) return prediction;
         break;
       }
 
       case StackFrame::JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH: {
         base::Optional<Code> code = frame->LookupCode();
-        CatchType prediction = ToCatchType(code->GetBuiltinCatchPrediction());
+        auto prediction = ToCatchType(CatchPredictionFor(code->builtin_id()));
         if (prediction != NOT_CAUGHT) return prediction;
         break;
       }
@@ -2386,12 +2438,12 @@ Isolate::CatchType Isolate::PredictExceptionCatcher() {
   return NOT_CAUGHT;
 }
 
-Object Isolate::ThrowIllegalOperation() {
+Tagged<Object> Isolate::ThrowIllegalOperation() {
   if (v8_flags.stack_trace_on_illegal) PrintStack(stdout);
   return Throw(ReadOnlyRoots(heap()).illegal_access_string());
 }
 
-void Isolate::ScheduleThrow(Object exception) {
+void Isolate::ScheduleThrow(Tagged<Object> exception) {
   // When scheduling a throw we first throw the exception to get the
   // error reporting if it is uncaught before rescheduling it.
   Throw(exception);
@@ -2409,8 +2461,8 @@ void Isolate::RestorePendingMessageFromTryCatch(v8::TryCatch* handler) {
   DCHECK(handler->HasCaught());
   DCHECK(handler->rethrow_);
   DCHECK(handler->capture_message_);
-  Object message(reinterpret_cast<Address>(handler->message_obj_));
-  DCHECK(message.IsJSMessageObject() || message.IsTheHole(this));
+  Tagged<Object> message(reinterpret_cast<Address>(handler->message_obj_));
+  DCHECK(IsJSMessageObject(message) || IsTheHole(message, this));
   set_pending_message(message);
 }
 
@@ -2436,8 +2488,8 @@ void Isolate::CancelScheduledExceptionFromTryCatch(v8::TryCatch* handler) {
   }
 }
 
-Object Isolate::PromoteScheduledException() {
-  Object thrown = scheduled_exception();
+Tagged<Object> Isolate::PromoteScheduledException() {
+  Tagged<Object> thrown = scheduled_exception();
   clear_scheduled_exception();
   // Re-throw the exception to avoid getting repeated error reporting.
   return ReThrow(thrown);
@@ -2451,6 +2503,7 @@ void Isolate::PrintCurrentStackTrace(std::ostream& out) {
   for (int i = 0; i < frames->length(); ++i) {
     Handle<CallSiteInfo> frame(CallSiteInfo::cast(frames->get(i)), this);
     SerializeCallSiteInfo(this, frame, &builder);
+    if (i != frames->length() - 1) builder.AppendCharacter('\n');
   }
 
   Handle<String> stack_trace = builder.Finish().ToHandleChecked();
@@ -2469,7 +2522,8 @@ bool Isolate::ComputeLocation(MessageLocation* target) {
   FrameSummary summary = it.GetTopValidFrame();
   Handle<SharedFunctionInfo> shared;
   Handle<Object> script = summary.script();
-  if (!script->IsScript() || Script::cast(*script).source().IsUndefined(this)) {
+  if (!IsScript(*script) ||
+      IsUndefined(Script::cast(*script)->source(), this)) {
     return false;
   }
 
@@ -2489,24 +2543,24 @@ bool Isolate::ComputeLocation(MessageLocation* target) {
 
 bool Isolate::ComputeLocationFromException(MessageLocation* target,
                                            Handle<Object> exception) {
-  if (!exception->IsJSObject()) return false;
+  if (!IsJSObject(*exception)) return false;
 
   Handle<Name> start_pos_symbol = factory()->error_start_pos_symbol();
   Handle<Object> start_pos = JSReceiver::GetDataProperty(
       this, Handle<JSObject>::cast(exception), start_pos_symbol);
-  if (!start_pos->IsSmi()) return false;
-  int start_pos_value = Handle<Smi>::cast(start_pos)->value();
+  if (!IsSmi(*start_pos)) return false;
+  int start_pos_value = Smi::cast(*start_pos).value();
 
   Handle<Name> end_pos_symbol = factory()->error_end_pos_symbol();
   Handle<Object> end_pos = JSReceiver::GetDataProperty(
       this, Handle<JSObject>::cast(exception), end_pos_symbol);
-  if (!end_pos->IsSmi()) return false;
-  int end_pos_value = Handle<Smi>::cast(end_pos)->value();
+  if (!IsSmi(*end_pos)) return false;
+  int end_pos_value = Smi::cast(*end_pos).value();
 
   Handle<Name> script_symbol = factory()->error_script_symbol();
   Handle<Object> script = JSReceiver::GetDataProperty(
       this, Handle<JSObject>::cast(exception), script_symbol);
-  if (!script->IsScript()) return false;
+  if (!IsScript(*script)) return false;
 
   Handle<Script> cast_script(Script::cast(*script), this);
   *target = MessageLocation(cast_script, start_pos_value, end_pos_value);
@@ -2515,7 +2569,7 @@ bool Isolate::ComputeLocationFromException(MessageLocation* target,
 
 bool Isolate::ComputeLocationFromSimpleStackTrace(MessageLocation* target,
                                                   Handle<Object> exception) {
-  if (!exception->IsJSReceiver()) {
+  if (!IsJSReceiver(*exception)) {
     return false;
   }
   Handle<FixedArray> call_site_infos =
@@ -2532,7 +2586,7 @@ bool Isolate::ComputeLocationFromSimpleStackTrace(MessageLocation* target,
 
 bool Isolate::ComputeLocationFromDetailedStackTrace(MessageLocation* target,
                                                     Handle<Object> exception) {
-  if (!exception->IsJSReceiver()) return false;
+  if (!IsJSReceiver(*exception)) return false;
 
   Handle<FixedArray> stack_frame_infos =
       GetDetailedStackTrace(Handle<JSReceiver>::cast(exception));
@@ -2551,7 +2605,7 @@ Handle<JSMessageObject> Isolate::CreateMessage(Handle<Object> exception,
                                                MessageLocation* location) {
   Handle<FixedArray> stack_trace_object;
   if (capture_stack_trace_for_uncaught_exceptions_) {
-    if (exception->IsJSError()) {
+    if (IsJSError(*exception)) {
       // We fetch the stack trace that corresponds to this error object.
       // If the lookup fails, the exception is probably not a valid Error
       // object. In that case, we fall through and capture the stack trace
@@ -2582,7 +2636,7 @@ Handle<JSMessageObject> Isolate::CreateMessage(Handle<Object> exception,
 Handle<JSMessageObject> Isolate::CreateMessageFromException(
     Handle<Object> exception) {
   Handle<FixedArray> stack_trace_object;
-  if (exception->IsJSError()) {
+  if (IsJSError(*exception)) {
     stack_trace_object =
         GetDetailedStackTrace(Handle<JSObject>::cast(exception));
   }
@@ -2600,7 +2654,7 @@ Handle<JSMessageObject> Isolate::CreateMessageFromException(
 }
 
 Isolate::ExceptionHandlerType Isolate::TopExceptionHandlerType(
-    Object exception) {
+    Tagged<Object> exception) {
   DCHECK_NE(ReadOnlyRoots(heap()).the_hole_value(), exception);
 
   Address js_handler = Isolate::handler(thread_local_top());
@@ -2647,7 +2701,7 @@ void Isolate::ReportPendingMessages() {
   // The embedder might run script in response to an exception.
   AllowJavascriptExecutionDebugOnly allow_script(this);
 
-  Object exception_obj = pending_exception();
+  Tagged<Object> exception_obj = pending_exception();
   ExceptionHandlerType top_handler = TopExceptionHandlerType(exception_obj);
 
   // Try to propagate the exception to an external v8::TryCatch handler. If
@@ -2658,7 +2712,7 @@ void Isolate::ReportPendingMessages() {
   if (!has_been_propagated) return;
 
   // Clear the pending message object early to avoid endless recursion.
-  Object message_obj = pending_message();
+  Tagged<Object> message_obj = pending_message();
   clear_pending_message();
 
   // For uncatchable exceptions we do nothing. If needed, the exception and the
@@ -2679,7 +2733,7 @@ void Isolate::ReportPendingMessages() {
   }
 
   // Actually report the pending message to all message handlers.
-  if (!message_obj.IsTheHole(this) && should_report_exception) {
+  if (!IsTheHole(message_obj, this) && should_report_exception) {
     HandleScope scope(this);
     Handle<JSMessageObject> message(JSMessageObject::cast(message_obj), this);
     Handle<Object> exception(exception_obj, this);
@@ -2742,14 +2796,14 @@ void Isolate::PushPromise(Handle<JSObject> promise) {
 void Isolate::PopPromise() {
   if (!IsPromiseStackEmpty()) {
     debug()->thread_local_.promise_stack_ =
-        PromiseOnStack::cast(debug()->thread_local_.promise_stack_).prev();
+        PromiseOnStack::cast(debug()->thread_local_.promise_stack_)->prev();
   }
 }
 
 bool Isolate::IsPromiseStackEmpty() const {
-  DCHECK_IMPLIES(!debug()->thread_local_.promise_stack_.IsSmi(),
-                 debug()->thread_local_.promise_stack_.IsPromiseOnStack());
-  return debug()->thread_local_.promise_stack_.IsSmi();
+  DCHECK_IMPLIES(!IsSmi(debug()->thread_local_.promise_stack_),
+                 IsPromiseOnStack(debug()->thread_local_.promise_stack_));
+  return IsSmi(debug()->thread_local_.promise_stack_);
 }
 
 namespace {
@@ -2764,25 +2818,25 @@ bool PromiseIsRejectHandler(Isolate* isolate, Handle<JSReceiver> handler) {
   Handle<Symbol> key = isolate->factory()->promise_forwarding_handler_symbol();
   Handle<Object> forwarding_handler =
       JSReceiver::GetDataProperty(isolate, handler, key);
-  return forwarding_handler->IsUndefined(isolate);
+  return IsUndefined(*forwarding_handler, isolate);
 }
 
 bool PromiseHasUserDefinedRejectHandlerInternal(Isolate* isolate,
                                                 Handle<JSPromise> promise) {
   Handle<Object> current(promise->reactions(), isolate);
-  while (!current->IsSmi()) {
+  while (!IsSmi(*current)) {
     Handle<PromiseReaction> reaction = Handle<PromiseReaction>::cast(current);
     Handle<HeapObject> promise_or_capability(reaction->promise_or_capability(),
                                              isolate);
-    if (!promise_or_capability->IsUndefined(isolate)) {
-      if (!promise_or_capability->IsJSPromise()) {
+    if (!IsUndefined(*promise_or_capability, isolate)) {
+      if (!IsJSPromise(*promise_or_capability)) {
         promise_or_capability = handle(
             Handle<PromiseCapability>::cast(promise_or_capability)->promise(),
             isolate);
       }
-      if (promise_or_capability->IsJSPromise()) {
+      if (IsJSPromise(*promise_or_capability)) {
         promise = Handle<JSPromise>::cast(promise_or_capability);
-        if (!reaction->reject_handler().IsUndefined(isolate)) {
+        if (!IsUndefined(reaction->reject_handler(), isolate)) {
           Handle<JSReceiver> reject_handler(
               JSReceiver::cast(reaction->reject_handler()), isolate);
           if (PromiseIsRejectHandler(isolate, reject_handler)) return true;
@@ -2811,7 +2865,7 @@ bool Isolate::PromiseHasUserDefinedRejectHandler(Handle<JSPromise> promise) {
     }
     Handle<Object> outer_promise_obj =
         JSObject::GetDataProperty(this, promise, key);
-    if (!outer_promise_obj->IsJSPromise()) break;
+    if (!IsJSPromise(*outer_promise_obj)) break;
     promise = Handle<JSPromise>::cast(outer_promise_obj);
   }
 
@@ -2844,7 +2898,7 @@ Handle<Object> Isolate::GetPromiseOnStackOnThrow() {
           !code->is_turbofanned()) {
         continue;
       }
-      catch_prediction = code->GetBuiltinCatchPrediction();
+      catch_prediction = CatchPredictionFor(code->builtin_id());
     } else {
       continue;
     }
@@ -2853,7 +2907,7 @@ Handle<Object> Isolate::GetPromiseOnStackOnThrow() {
       case HandlerTable::UNCAUGHT:
         continue;
       case HandlerTable::CAUGHT:
-        if (retval->IsJSPromise()) {
+        if (IsJSPromise(*retval)) {
           // Caught the result of an inner async/await invocation.
           // Mark the inner promise as caught in the "synchronous case" so
           // that Debug::OnException will see. In the synchronous case,
@@ -2866,7 +2920,7 @@ Handle<Object> Isolate::GetPromiseOnStackOnThrow() {
         return retval;
       case HandlerTable::PROMISE: {
         Handle<JSObject> promise;
-        if (promise_stack->IsPromiseOnStack() &&
+        if (IsPromiseOnStack(*promise_stack) &&
             PromiseOnStack::GetPromise(
                 Handle<PromiseOnStack>::cast(promise_stack))
                 .ToHandle(&promise)) {
@@ -2881,7 +2935,7 @@ Handle<Object> Isolate::GetPromiseOnStackOnThrow() {
         // dependents is found, or a non-async stack frame is encountered, in
         // order to handle the synchronous async/await catch prediction case:
         // assume that async function calls are awaited.
-        if (!promise_stack->IsPromiseOnStack()) {
+        if (!IsPromiseOnStack(*promise_stack)) {
           return retval;
         }
         Handle<PromiseOnStack> promise_on_stack =
@@ -2890,7 +2944,7 @@ Handle<Object> Isolate::GetPromiseOnStackOnThrow() {
             PromiseOnStack::GetPromise(promise_on_stack);
         if (maybe_promise.is_null()) return retval;
         retval = maybe_promise.ToHandleChecked();
-        if (retval->IsJSPromise()) {
+        if (IsJSPromise(*retval)) {
           if (PromiseHasUserDefinedRejectHandler(
                   Handle<JSPromise>::cast(retval))) {
             return retval;
@@ -2920,11 +2974,11 @@ void Isolate::SetAbortOnUncaughtExceptionCallback(
   abort_on_uncaught_exception_callback_ = callback;
 }
 
-void Isolate::InstallConditionalFeatures(Handle<Context> context) {
+void Isolate::InstallConditionalFeatures(Handle<NativeContext> context) {
   Handle<JSGlobalObject> global = handle(context->global_object(), this);
   // If some fuzzer decided to make the global object non-extensible, then
   // we can't install any features (and would CHECK-fail if we tried).
-  if (!global->map().is_extensible()) return;
+  if (!global->map()->is_extensible()) return;
   Handle<String> sab_name = factory()->SharedArrayBuffer_string();
   if (IsSharedArrayBufferConstructorEnabled(context)) {
     if (!JSObject::HasRealNamedProperty(this, global, sab_name)
@@ -2933,11 +2987,21 @@ void Isolate::InstallConditionalFeatures(Handle<Context> context) {
                             shared_array_buffer_fun(), DONT_ENUM);
     }
   }
-}
 
-bool Isolate::IsSharedArrayBufferConstructorEnabled(Handle<Context> context) {
-  if (!v8_flags.harmony_sharedarraybuffer) return false;
+  // Cache the "compile hints magic enabled" information so that it's available
+  // during script streaming (when we don't have an entered NativeContext and
+  // cannot query it). This will enable the feature for an Isolate if any
+  // NativeContext enables it. But this overapproximation is fine, since the
+  // site also has to enable the feature by inserting the magic comment - so an
+  // experiment can guard against accidental enabling by not adding the magic
+  // comment.
+  if (!allow_compile_hints_magic_) {
+    allow_compile_hints_magic_ = IsCompileHintsMagicEnabled(context);
+  }
+}
 
+bool Isolate::IsSharedArrayBufferConstructorEnabled(
+    Handle<NativeContext> context) {
   if (!v8_flags.enable_sharedarraybuffer_per_context) return true;
 
   if (sharedarraybuffer_constructor_enabled_callback()) {
@@ -2947,7 +3011,7 @@ bool Isolate::IsSharedArrayBufferConstructorEnabled(Handle<Context> context) {
   return false;
 }
 
-bool Isolate::IsWasmGCEnabled(Handle<Context> context) {
+bool Isolate::IsWasmGCEnabled(Handle<NativeContext> context) {
 #ifdef V8_ENABLE_WEBASSEMBLY
   v8::WasmGCEnabledCallback callback = wasm_gc_enabled_callback();
   if (callback) {
@@ -2960,7 +3024,19 @@ bool Isolate::IsWasmGCEnabled(Handle<Context> context) {
 #endif
 }
 
-bool Isolate::IsWasmStringRefEnabled(Handle<Context> context) {
+bool Isolate::IsCompileHintsMagicEnabled(Handle<NativeContext> context) {
+  v8::JavaScriptCompileHintsMagicEnabledCallback callback =
+      compile_hints_magic_enabled_callback();
+  if (callback) {
+    v8::Local<v8::Context> api_context = v8::Utils::ToLocal(context);
+    if (callback(api_context)) {
+      return true;
+    }
+  }
+  return false;
+}
+
+bool Isolate::IsWasmStringRefEnabled(Handle<NativeContext> context) {
   // If Wasm GC is explicitly enabled via a callback, also enable stringref.
 #ifdef V8_ENABLE_WEBASSEMBLY
   v8::WasmGCEnabledCallback callback = wasm_gc_enabled_callback();
@@ -2974,7 +3050,7 @@ bool Isolate::IsWasmStringRefEnabled(Handle<Context> context) {
 #endif
 }
 
-bool Isolate::IsWasmInliningEnabled(Handle<Context> context) {
+bool Isolate::IsWasmInliningEnabled(Handle<NativeContext> context) {
   // If Wasm GC is explicitly enabled via a callback, also enable inlining.
 #ifdef V8_ENABLE_WEBASSEMBLY
   v8::WasmGCEnabledCallback callback = wasm_gc_enabled_callback();
@@ -2988,7 +3064,35 @@ bool Isolate::IsWasmInliningEnabled(Handle<Context> context) {
 #endif
 }
 
-Handle<Context> Isolate::GetIncumbentContext() {
+bool Isolate::IsWasmInliningIntoJSEnabled(Handle<NativeContext> context) {
+  // If Wasm GC is explicitly enabled via a callback, also enable inlining.
+#ifdef V8_ENABLE_WEBASSEMBLY
+  v8::WasmGCEnabledCallback callback = wasm_gc_enabled_callback();
+  if (callback) {
+    v8::Local<v8::Context> api_context = v8::Utils::ToLocal(context);
+    if (callback(api_context)) return true;
+  }
+  return v8_flags.experimental_wasm_js_inlining;
+#else
+  return false;
+#endif
+}
+
+bool Isolate::IsWasmImportedStringsEnabled(Handle<NativeContext> context) {
+#ifdef V8_ENABLE_WEBASSEMBLY
+  v8::WasmImportedStringsEnabledCallback callback =
+      wasm_imported_strings_enabled_callback();
+  if (callback) {
+    v8::Local<v8::Context> api_context = v8::Utils::ToLocal(context);
+    if (callback(api_context)) return true;
+  }
+  return v8_flags.experimental_wasm_imported_strings;
+#else
+  return false;
+#endif
+}
+
+Handle<NativeContext> Isolate::GetIncumbentContext() {
   JavaScriptStackFrameIterator it(this);
 
   // 1st candidate: most-recently-entered author function's context
@@ -3002,7 +3106,7 @@ Handle<Context> Isolate::GetIncumbentContext() {
   if (!it.done() &&
       (!top_backup_incumbent || it.frame()->sp() < top_backup_incumbent)) {
     Context context = Context::cast(it.frame()->context());
-    return Handle<Context>(context.native_context(), this);
+    return Handle<NativeContext>(context->native_context(), this);
   }
 
   // 2nd candidate: the last Context::Scope's incumbent context if any.
@@ -3029,7 +3133,7 @@ char* Isolate::ArchiveThread(char* to) {
 char* Isolate::RestoreThread(char* from) {
   MemCopy(reinterpret_cast<char*>(thread_local_top()), from,
           sizeof(ThreadLocalTop));
-  DCHECK(context().is_null() || context().IsContext());
+  DCHECK(context().is_null() || IsContext(context()));
   return from + sizeof(ThreadLocalTop);
 }
 
@@ -3082,35 +3186,64 @@ void Isolate::UnregisterManagedPtrDestructor(ManagedPtrDestructor* destructor) {
 
 #if V8_ENABLE_WEBASSEMBLY
 void Isolate::AddSharedWasmMemory(Handle<WasmMemoryObject> memory_object) {
-  HandleScope scope(this);
   Handle<WeakArrayList> shared_wasm_memories =
       factory()->shared_wasm_memories();
-  shared_wasm_memories = WeakArrayList::AddToEnd(
+  shared_wasm_memories = WeakArrayList::Append(
       this, shared_wasm_memories, MaybeObjectHandle::Weak(memory_object));
   heap()->set_shared_wasm_memories(*shared_wasm_memories);
 }
 
+void Isolate::SyncStackLimit() {
+  // Synchronize the stack limit with the active continuation for
+  // stack-switching. This can be done before or after changing the stack
+  // pointer itself, as long as we update both before the next stack check.
+  // {StackGuard::SetStackLimitForStackSwitching} doesn't update the value of
+  // the jslimit if it contains a sentinel value, and it is also thread-safe. So
+  // if an interrupt is requested before, during or after this call, it will be
+  // preserved and handled at the next stack check.
+
+  DisallowGarbageCollection no_gc;
+  auto continuation =
+      WasmContinuationObject::cast(root(RootIndex::kActiveContinuation));
+  wasm::StackMemory* stack =
+      Managed<wasm::StackMemory>::cast(continuation->stack())->raw();
+  if (v8_flags.trace_wasm_stack_switching) {
+    PrintF("Switch to stack #%d\n", stack->id());
+  }
+  uintptr_t limit = reinterpret_cast<uintptr_t>(stack->jmpbuf()->stack_limit);
+  stack_guard()->SetStackLimitForStackSwitching(limit);
+  RecordStackSwitchForScanning();
+}
+
 void Isolate::RecordStackSwitchForScanning() {
-  Object current = root(RootIndex::kActiveContinuation);
-  DCHECK(!current.IsUndefined());
+  Tagged<Object> current = root(RootIndex::kActiveContinuation);
+  DCHECK(!IsUndefined(current));
   stack().ClearStackSegments();
   wasm::StackMemory* wasm_stack =
       Managed<wasm::StackMemory>::cast(
-          WasmContinuationObject::cast(current).stack())
-          .get()
+          WasmContinuationObject::cast(current)->stack())
+          ->get()
           .get();
-  current = WasmContinuationObject::cast(current).parent();
+  current = WasmContinuationObject::cast(current)->parent();
   heap()->SetStackStart(reinterpret_cast<void*>(wasm_stack->base()));
+  thread_local_top()->is_on_central_stack_flag_ = IsUndefined(current);
   // We don't need to add all inactive stacks. Only the ones in the active chain
   // may contain cpp heap pointers.
-  while (!current.IsUndefined()) {
+  while (!IsUndefined(current)) {
     auto cont = WasmContinuationObject::cast(current);
     auto* wasm_stack =
-        Managed<wasm::StackMemory>::cast(cont.stack()).get().get();
+        Managed<wasm::StackMemory>::cast(cont->stack())->get().get();
     stack().AddStackSegment(
         reinterpret_cast<const void*>(wasm_stack->base()),
         reinterpret_cast<const void*>(wasm_stack->jmpbuf()->sp));
-    current = cont.parent();
+    current = cont->parent();
+    // If the parent is undefined, wasm_stack is the central stack.
+    // Update the central stack SP for switching in CEntry.
+    if (IsUndefined(current)) {
+      thread_local_top()->central_stack_sp_ = wasm_stack->jmpbuf()->sp;
+      thread_local_top()->central_stack_limit_ =
+          reinterpret_cast<Address>(wasm_stack->jmpbuf()->stack_limit);
+    }
   }
 }
 
@@ -3352,6 +3485,7 @@ void Isolate::SetUpFromReadOnlyArtifacts(
   if (ReadOnlyHeap::IsReadOnlySpaceShared()) {
     DCHECK_NOT_NULL(artifacts);
     artifacts_ = artifacts;
+    InitializeNextUniqueSfiId(artifacts->initial_next_unique_sfi_id());
   } else {
     DCHECK_NULL(artifacts);
   }
@@ -3380,9 +3514,7 @@ Isolate::Isolate(std::unique_ptr<i::IsolateAllocator> isolate_allocator)
       detailed_source_positions_for_profiling_(v8_flags.detailed_line_info),
       persistent_handles_list_(new PersistentHandlesList()),
       jitless_(v8_flags.jitless),
-#if V8_SFI_HAS_UNIQUE_ID
       next_unique_sfi_id_(0),
-#endif
       next_module_async_evaluating_ordinal_(
           SourceTextModule::kFirstAsyncEvaluatingOrdinal),
       cancelable_task_manager_(new CancelableTaskManager()) {
@@ -3393,7 +3525,7 @@ Isolate::Isolate(std::unique_ptr<i::IsolateAllocator> isolate_allocator)
   // before it is entered.
   thread_manager_ = new ThreadManager(this);
 
-  handle_scope_data_.Initialize();
+  handle_scope_data()->Initialize();
 
 #define ISOLATE_INIT_EXECUTE(type, name, initial_value) \
   name##_ = (initial_value);
@@ -3415,8 +3547,8 @@ Isolate::Isolate(std::unique_ptr<i::IsolateAllocator> isolate_allocator)
 
 void Isolate::CheckIsolateLayout() {
 #ifdef V8_ENABLE_SANDBOX
-  CHECK_EQ(static_cast<int>(OFFSET_OF(ExternalPointerTable, buffer_)),
-           Internals::kExternalPointerTableBufferOffset);
+  CHECK_EQ(static_cast<int>(OFFSET_OF(ExternalPointerTable, base_)),
+           Internals::kExternalPointerTableBasePointerOffset);
   CHECK_EQ(static_cast<int>(sizeof(ExternalPointerTable)),
            Internals::kExternalPointerTableSize);
   CHECK_EQ(static_cast<int>(sizeof(ExternalPointerTable)),
@@ -3453,6 +3585,13 @@ void Isolate::CheckIsolateLayout() {
            Internals::kIsolateLongTaskStatsCounterOffset);
   CHECK_EQ(static_cast<int>(OFFSET_OF(Isolate, isolate_data_.stack_guard_)),
            Internals::kIsolateStackGuardOffset);
+
+  CHECK_EQ(
+      static_cast<int>(OFFSET_OF(Isolate, isolate_data_.thread_local_top_)),
+      Internals::kIsolateThreadLocalTopOffset);
+  CHECK_EQ(
+      static_cast<int>(OFFSET_OF(Isolate, isolate_data_.handle_scope_data_)),
+      Internals::kIsolateHandleScopeDataOffset);
   CHECK_EQ(static_cast<int>(OFFSET_OF(Isolate, isolate_data_.embedder_data_)),
            Internals::kIsolateEmbedderDataOffset);
 #ifdef V8_COMPRESS_POINTERS
@@ -3460,6 +3599,10 @@ void Isolate::CheckIsolateLayout() {
                OFFSET_OF(Isolate, isolate_data_.external_pointer_table_)),
            Internals::kIsolateExternalPointerTableOffset);
 #endif
+  CHECK_EQ(static_cast<int>(
+               OFFSET_OF(Isolate, isolate_data_.api_callback_thunk_argument_)),
+           Internals::kIsolateApiCallbackThunkArgumentOffset);
+
   CHECK_EQ(static_cast<int>(OFFSET_OF(Isolate, isolate_data_.roots_table_)),
            Internals::kIsolateRootsOffset);
 
@@ -3479,8 +3622,8 @@ void Isolate::ClearSerializerData() {
 // cache.
 void Isolate::UpdateLogObjectRelocation() {
   log_object_relocation_ = v8_flags.verify_predictable ||
-                           v8_file_logger()->is_logging() || is_profiling() ||
-                           v8_file_logger()->is_listening_to_code_events() ||
+                           IsLoggingCodeCreation() ||
+                           v8_file_logger()->is_logging() ||
                            (heap_profiler() != nullptr &&
                             heap_profiler()->is_tracking_object_moves()) ||
                            heap()->has_heap_object_allocation_tracker();
@@ -3497,8 +3640,9 @@ void Isolate::Deinit() {
 
   if (has_shared_space() && !is_shared_space_isolate()) {
     IgnoreLocalGCRequests ignore_gc_requests(heap());
-    ParkedScope parked_scope(main_thread_local_heap());
-    shared_space_isolate()->global_safepoint()->clients_mutex_.Lock();
+    main_thread_local_heap()->BlockMainThreadWhileParked([this]() {
+      shared_space_isolate()->global_safepoint()->clients_mutex_.Lock();
+    });
   }
 
   DisallowGarbageCollection no_gc;
@@ -3651,14 +3795,27 @@ void Isolate::Deinit() {
   }
 
 #ifdef V8_COMPRESS_POINTERS
+  external_pointer_table().TearDownSpace(heap()->external_pointer_space());
+  external_pointer_table().DetachSpaceFromReadOnlySegment(
+      heap()->read_only_external_pointer_space());
+  external_pointer_table().TearDownSpace(
+      heap()->read_only_external_pointer_space());
   external_pointer_table().TearDown();
   if (owns_shareable_data()) {
+    shared_external_pointer_table().TearDownSpace(
+        shared_external_pointer_space());
     shared_external_pointer_table().TearDown();
     delete isolate_data_.shared_external_pointer_table_;
     isolate_data_.shared_external_pointer_table_ = nullptr;
+    delete shared_external_pointer_space_;
+    shared_external_pointer_space_ = nullptr;
   }
 #endif  // V8_COMPRESS_POINTERS
 
+#ifdef V8_CODE_POINTER_SANDBOXING
+  GetProcessWideCodePointerTable()->TearDownSpace(heap()->code_pointer_space());
+#endif
+
   {
     base::MutexGuard lock_guard(&thread_data_table_mutex_);
     thread_data_table_.RemoveAllThreads();
@@ -3670,6 +3827,20 @@ void Isolate::SetIsolateThreadLocals(Isolate* isolate,
   g_current_isolate_ = isolate;
   g_current_per_isolate_thread_data_ = data;
 
+#ifdef V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE
+  if (isolate) {
+    V8HeapCompressionScheme::InitBase(isolate->cage_base());
+#ifdef V8_EXTERNAL_CODE_SPACE
+    ExternalCodeCompressionScheme::InitBase(isolate->code_cage_base());
+#endif  // V8_EXTERNAL_CODE_SPACE
+  } else {
+    V8HeapCompressionScheme::InitBase(kNullAddress);
+#ifdef V8_EXTERNAL_CODE_SPACE
+    ExternalCodeCompressionScheme::InitBase(kNullAddress);
+#endif  // V8_EXTERNAL_CODE_SPACE
+  }
+#endif  // V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE
+
   if (isolate && isolate->main_thread_local_isolate()) {
     WriteBarrier::SetForThread(
         isolate->main_thread_local_heap()->marking_barrier());
@@ -3780,7 +3951,7 @@ void Isolate::SetTerminationOnExternalTryCatch() {
 
 bool Isolate::PropagatePendingExceptionToExternalTryCatch(
     ExceptionHandlerType top_handler) {
-  Object exception = pending_exception();
+  Tagged<Object> exception = pending_exception();
 
   if (top_handler == ExceptionHandlerType::kJavaScriptHandler) {
     thread_local_top()->external_caught_exception_ = false;
@@ -3798,8 +3969,8 @@ bool Isolate::PropagatePendingExceptionToExternalTryCatch(
     SetTerminationOnExternalTryCatch();
   } else {
     v8::TryCatch* handler = try_catch_handler();
-    DCHECK(pending_message().IsJSMessageObject() ||
-           pending_message().IsTheHole(this));
+    DCHECK(IsJSMessageObject(pending_message()) ||
+           IsTheHole(pending_message(), this));
     handler->can_continue_ = true;
     handler->has_terminated_ = false;
     handler->exception_ = reinterpret_cast<void*>(exception.ptr());
@@ -3825,27 +3996,28 @@ void Isolate::InitializeLoggingAndCounters() {
 
 namespace {
 
-void CreateOffHeapTrampolines(Isolate* isolate) {
+void FinalizeBuiltinCodeObjects(Isolate* isolate) {
   DCHECK_NOT_NULL(isolate->embedded_blob_code());
   DCHECK_NE(0, isolate->embedded_blob_code_size());
   DCHECK_NOT_NULL(isolate->embedded_blob_data());
   DCHECK_NE(0, isolate->embedded_blob_data_size());
 
-  HandleScope scope(isolate);
-  Builtins* builtins = isolate->builtins();
-
   EmbeddedData d = EmbeddedData::FromBlob(isolate);
-
+  HandleScope scope(isolate);
   static_assert(Builtins::kAllBuiltinsAreIsolateIndependent);
   for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
        ++builtin) {
-    Address instruction_start = d.InstructionStartOfBuiltin(builtin);
-    Handle<Code> trampoline = isolate->factory()->NewOffHeapTrampolineFor(
-        builtins->code_handle(builtin), instruction_start);
+    Handle<Code> old_code = isolate->builtins()->code_handle(builtin);
+    // Note that `old_code.instruction_start` might point to `old_code`'s
+    // InstructionStream which might be GCed once we replace the old code
+    // with the new code.
+    Address instruction_start = d.InstructionStartOf(builtin);
+    Handle<Code> new_code = isolate->factory()->NewCodeObjectForEmbeddedBuiltin(
+        old_code, instruction_start);
 
     // From this point onwards, the old builtin code object is unreachable and
     // will be collected by the next GC.
-    builtins->set_code(builtin, *trampoline);
+    isolate->builtins()->set_code(builtin, *new_code);
   }
 }
 
@@ -3887,7 +4059,6 @@ void Isolate::CreateAndSetEmbeddedBlob() {
   base::MutexGuard guard(current_embedded_blob_refcount_mutex_.Pointer());
 
   PrepareBuiltinSourcePositionMap();
-
   PrepareBuiltinLabelInfoMap();
 
   // If a sticky blob has been set, we reuse it.
@@ -3915,8 +4086,7 @@ void Isolate::CreateAndSetEmbeddedBlob() {
   }
 
   MaybeRemapEmbeddedBuiltinsIntoCodeRange();
-
-  CreateOffHeapTrampolines(this);
+  FinalizeBuiltinCodeObjects(this);
 }
 
 void Isolate::InitializeIsShortBuiltinCallsEnabled() {
@@ -4090,12 +4260,6 @@ class BigIntPlatform : public bigint::Platform {
  private:
   Isolate* isolate_;
 };
-
-void ResetBeforeGC(v8::Isolate* v8_isolate, v8::GCType gc_type,
-                   v8::GCCallbackFlags flags, void* data) {
-  Isolate* isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
-  isolate->compilation_cache()->MarkCompactPrologue();
-}
 }  // namespace
 
 VirtualMemoryCage* Isolate::GetPtrComprCodeCageForTesting() {
@@ -4115,17 +4279,11 @@ void Isolate::VerifyStaticRoots() {
                 STATIC_ROOTS_FAILED_MSG);
   auto& roots = roots_table();
   RootIndex idx = RootIndex::kFirstReadOnlyRoot;
-  ReadOnlyPage* first_page = read_only_heap()->read_only_space()->pages()[0];
   for (Tagged_t cmp_ptr : StaticReadOnlyRootsPointerTable) {
     Address the_root = roots[idx];
     Address ptr =
         V8HeapCompressionScheme::DecompressTagged(cage_base(), cmp_ptr);
     CHECK_WITH_MSG(the_root == ptr, STATIC_ROOTS_FAILED_MSG);
-    // All roots must fit on first page, since only this page is guaranteed to
-    // have a stable offset from the cage base. If this ever changes we need
-    // to load more pages with predictable offset at
-    // ReadOnlySpace::InitFromMemoryDump.
-    CHECK(first_page->Contains(the_root));
     ++idx;
   }
 
@@ -4151,42 +4309,42 @@ void Isolate::VerifyStaticRoots() {
   // such that the static map range is restored (consult static-roots.h for a
   // sorted list of addresses) or remove the offending entry from the list.
   for (auto idx = RootIndex::kFirstRoot; idx <= RootIndex::kLastRoot; ++idx) {
-    Object obj = roots_table().slot(idx).load(this);
-    if (obj.ptr() == kNullAddress || !obj.IsMap()) continue;
+    Tagged<Object> obj = roots_table().slot(idx).load(this);
+    if (obj.ptr() == kNullAddress || !IsMap(obj)) continue;
     Map map = Map::cast(obj);
 
 #define INSTANCE_TYPE_CHECKER_SINGLE(type, _)  \
   CHECK_EQ(InstanceTypeChecker::Is##type(map), \
-           InstanceTypeChecker::Is##type(map.instance_type()));
+           InstanceTypeChecker::Is##type(map->instance_type()));
     INSTANCE_TYPE_CHECKERS_SINGLE(INSTANCE_TYPE_CHECKER_SINGLE)
 #undef INSTANCE_TYPE_CHECKER_SINGLE
 
 #define INSTANCE_TYPE_CHECKER_RANGE(type, _1, _2) \
   CHECK_EQ(InstanceTypeChecker::Is##type(map),    \
-           InstanceTypeChecker::Is##type(map.instance_type()));
+           InstanceTypeChecker::Is##type(map->instance_type()));
     INSTANCE_TYPE_CHECKERS_RANGE(INSTANCE_TYPE_CHECKER_RANGE)
 #undef INSTANCE_TYPE_CHECKER_RANGE
 
     // This limit is used in various places as a fast IsJSReceiver check.
     CHECK_IMPLIES(
-        InstanceTypeChecker::IsPrimitiveHeapObject(map.instance_type()),
+        InstanceTypeChecker::IsPrimitiveHeapObject(map->instance_type()),
         V8HeapCompressionScheme::CompressObject(map.ptr()) <
             InstanceTypeChecker::kNonJsReceiverMapLimit);
-    CHECK_IMPLIES(InstanceTypeChecker::IsJSReceiver(map.instance_type()),
-                  V8HeapCompressionScheme::CompressObject(map.ptr()) >
+    CHECK_IMPLIES(InstanceTypeChecker::IsJSReceiver(map->instance_type()),
+                  V8HeapCompressionScheme::CompressObject(map.ptr()) >=
                       InstanceTypeChecker::kNonJsReceiverMapLimit);
     CHECK(InstanceTypeChecker::kNonJsReceiverMapLimit <
           read_only_heap()->read_only_space()->Size());
 
-    if (InstanceTypeChecker::IsString(map.instance_type())) {
+    if (InstanceTypeChecker::IsString(map->instance_type())) {
       CHECK_EQ(InstanceTypeChecker::IsString(map),
-               InstanceTypeChecker::IsString(map.instance_type()));
+               InstanceTypeChecker::IsString(map->instance_type()));
       CHECK_EQ(InstanceTypeChecker::IsExternalString(map),
-               InstanceTypeChecker::IsExternalString(map.instance_type()));
+               InstanceTypeChecker::IsExternalString(map->instance_type()));
       CHECK_EQ(InstanceTypeChecker::IsInternalizedString(map),
-               InstanceTypeChecker::IsInternalizedString(map.instance_type()));
+               InstanceTypeChecker::IsInternalizedString(map->instance_type()));
       CHECK_EQ(InstanceTypeChecker::IsThinString(map),
-               InstanceTypeChecker::IsThinString(map.instance_type()));
+               InstanceTypeChecker::IsThinString(map->instance_type()));
     }
   }
 
@@ -4213,8 +4371,8 @@ bool Isolate::Init(SnapshotData* startup_snapshot_data,
   DCHECK_EQ(create_heap_objects, startup_snapshot_data == nullptr);
   DCHECK_EQ(create_heap_objects, read_only_snapshot_data == nullptr);
 
-  // Code space setup requires the permissions to be set to default state.
-  RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
+  EnableRoAllocationForSnapshotScope enable_ro_allocation(this);
+
   base::ElapsedTimer timer;
   if (create_heap_objects && v8_flags.profile_deserialization) timer.Start();
 
@@ -4342,6 +4500,19 @@ bool Isolate::Init(SnapshotData* startup_snapshot_data,
     // embedded blob.
     MaybeRemapEmbeddedBuiltinsIntoCodeRange();
   }
+  {
+    // Must be done before deserializing RO space since the deserialization
+    // process refers to these data structures.
+    isolate_data_.external_reference_table()->InitIsolateIndependent();
+#ifdef V8_COMPRESS_POINTERS
+    external_pointer_table().Initialize();
+    external_pointer_table().InitializeSpace(
+        heap()->read_only_external_pointer_space());
+    external_pointer_table().AttachSpaceToReadOnlySegment(
+        heap()->read_only_external_pointer_space());
+    external_pointer_table().InitializeSpace(heap()->external_pointer_space());
+#endif  // V8_COMPRESS_POINTERS
+  }
   ReadOnlyHeap::SetUp(this, read_only_snapshot_data, can_rehash);
   heap_.SetUpSpaces(isolate_data_.new_allocation_info_,
                     isolate_data_.old_allocation_info_);
@@ -4374,9 +4545,11 @@ bool Isolate::Init(SnapshotData* startup_snapshot_data,
     }
     code_cage_base_ = ExternalCodeCompressionScheme::PrepareCageBaseAddress(
         code_cage->base());
-#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
+    if (COMPRESS_POINTERS_IN_ISOLATE_CAGE_BOOL) {
+      // .. now that it's available, initialize the thread-local base.
+      ExternalCodeCompressionScheme::InitBase(code_cage_base_);
+    }
     CHECK_EQ(ExternalCodeCompressionScheme::base(), code_cage_base_);
-#endif  // V8_COMPRESS_POINTERS_IN_SHARED_CAGE
 
     // Ensure that ExternalCodeCompressionScheme is applicable to all objects
     // stored in the code cage.
@@ -4394,17 +4567,26 @@ bool Isolate::Init(SnapshotData* startup_snapshot_data,
   isolate_data_.external_reference_table()->Init(this);
 
 #ifdef V8_COMPRESS_POINTERS
-  external_pointer_table().Init(this);
   if (owns_shareable_data()) {
     isolate_data_.shared_external_pointer_table_ = new ExternalPointerTable();
-    shared_external_pointer_table().Init(this);
+    shared_external_pointer_space_ = new ExternalPointerTable::Space();
+    shared_external_pointer_table().Initialize();
+    shared_external_pointer_table().InitializeSpace(
+        shared_external_pointer_space());
   } else {
     DCHECK(has_shared_space());
     isolate_data_.shared_external_pointer_table_ =
         shared_space_isolate()->isolate_data_.shared_external_pointer_table_;
+    shared_external_pointer_space_ =
+        shared_space_isolate()->shared_external_pointer_space_;
   }
 #endif  // V8_COMPRESS_POINTERS
 
+#ifdef V8_CODE_POINTER_SANDBOXING
+  GetProcessWideCodePointerTable()->InitializeSpace(
+      heap()->code_pointer_space());
+#endif
+
 #if V8_ENABLE_WEBASSEMBLY
   wasm::GetWasmEngine()->AddIsolate(this);
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -4457,10 +4639,6 @@ bool Isolate::Init(SnapshotData* startup_snapshot_data,
   // embedded blob setup).
   init_memcopy_functions();
 
-  if (v8_flags.log_internal_timer_events) {
-    set_event_logger(V8FileLogger::DefaultEventLoggerSentinel);
-  }
-
   if (v8_flags.trace_turbo || v8_flags.trace_turbo_graph ||
       v8_flags.turbo_profiling) {
     PrintF("Concurrent recompilation has been disabled for tracing.\n");
@@ -4472,33 +4650,21 @@ bool Isolate::Init(SnapshotData* startup_snapshot_data,
   // clearing/updating ICs (and thus affecting tiering decisions).
   tiering_manager_ = new TieringManager(this);
 
-  // If we are deserializing, read the state into the now-empty heap.
-  {
-    CodePageCollectionMemoryModificationScope modification_scope(heap());
-
-    if (create_heap_objects) {
-      read_only_heap_->OnCreateHeapObjectsComplete(this);
-    } else {
-      SharedHeapDeserializer shared_heap_deserializer(
-          this, shared_heap_snapshot_data, can_rehash);
-      shared_heap_deserializer.DeserializeIntoIsolate();
-
-      StartupDeserializer startup_deserializer(this, startup_snapshot_data,
-                                               can_rehash);
-      startup_deserializer.DeserializeIntoIsolate();
-    }
-    if (DEBUG_BOOL) VerifyStaticRoots();
-    load_stub_cache_->Initialize();
-    store_stub_cache_->Initialize();
-    interpreter_->Initialize();
-    heap_.NotifyDeserializationComplete();
-  }
+  if (!create_heap_objects) {
+    // If we are deserializing, read the state into the now-empty heap.
+    SharedHeapDeserializer shared_heap_deserializer(
+        this, shared_heap_snapshot_data, can_rehash);
+    shared_heap_deserializer.DeserializeIntoIsolate();
 
-#ifdef VERIFY_HEAP
-  if (v8_flags.verify_heap) {
-    HeapVerifier::VerifyReadOnlyHeap(&heap_);
+    StartupDeserializer startup_deserializer(this, startup_snapshot_data,
+                                             can_rehash);
+    startup_deserializer.DeserializeIntoIsolate();
   }
-#endif
+  if (DEBUG_BOOL) VerifyStaticRoots();
+  load_stub_cache_->Initialize();
+  store_stub_cache_->Initialize();
+  interpreter_->Initialize();
+  heap_.NotifyDeserializationComplete();
 
   delete setup_delegate_;
   setup_delegate_ = nullptr;
@@ -4560,6 +4726,10 @@ bool Isolate::Init(SnapshotData* startup_snapshot_data,
     PrintF("[Initializing isolate from scratch took %0.3f ms]\n", ms);
   }
 
+  if (initialized_from_snapshot_) {
+    SLOW_DCHECK(SharedFunctionInfo::UniqueIdsAreUnique(this));
+  }
+
 #ifdef V8_ENABLE_WEBASSEMBLY
   if (v8_flags.experimental_wasm_stack_switching) {
     std::unique_ptr<wasm::StackMemory> stack(
@@ -4578,24 +4748,27 @@ bool Isolate::Init(SnapshotData* startup_snapshot_data,
         .store(*continuation);
   }
 #if V8_STATIC_ROOTS_BOOL
-  if (!create_heap_objects) {
-    // Protect the payload of wasm null.
-    page_allocator()->DecommitPages(
-        reinterpret_cast<void*>(factory()->wasm_null()->payload()),
-        WasmNull::kSize - kTaggedSize);
+  // Protect the payload of wasm null.
+  if (!page_allocator()->DecommitPages(
+          reinterpret_cast<void*>(factory()->wasm_null()->payload()),
+          WasmNull::kSize - kTaggedSize)) {
+    V8::FatalProcessOutOfMemory(this, "decommitting WasmNull payload");
   }
 #endif  // V8_STATIC_ROOTS_BOOL
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-  heap()->AddGCPrologueCallback(ResetBeforeGC, kGCTypeMarkSweepCompact,
-                                nullptr);
-
   // Isolate initialization allocates long living objects that should be
   // pretenured to old space.
   DCHECK_IMPLIES(heap()->new_space(), heap()->new_space()->Size() == 0);
   DCHECK_IMPLIES(heap()->new_lo_space(), heap()->new_lo_space()->Size() == 0);
   DCHECK_EQ(heap()->gc_count(), 0);
 
+#if defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+  if (v8_flags.enable_etw_stack_walking) {
+    ETWJITInterface::MaybeSetHandlerNow(this);
+  }
+#endif  // defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+
   initialized_ = true;
 
   return true;
@@ -4623,7 +4796,6 @@ void Isolate::Enter() {
     }
   }
 
-  RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
   PerIsolateThreadData* data = FindOrAllocatePerThreadDataForThisThread();
   DCHECK_NOT_NULL(data);
   DCHECK(data->isolate_ == this);
@@ -4696,15 +4868,32 @@ void Isolate::DumpAndResetStats() {
     DCHECK(v8_flags.turbo_stats || v8_flags.turbo_stats_nvp);
     StdoutStream os;
     if (v8_flags.turbo_stats) {
-      AsPrintableStatistics ps = {*turbo_statistics_, false};
+      AsPrintableStatistics ps = {"Turbofan", *turbo_statistics_, false};
       os << ps << std::endl;
     }
     if (v8_flags.turbo_stats_nvp) {
-      AsPrintableStatistics ps = {*turbo_statistics_, true};
+      AsPrintableStatistics ps = {"Turbofan", *turbo_statistics_, true};
       os << ps << std::endl;
     }
     turbo_statistics_.reset();
   }
+
+#ifdef V8_ENABLE_MAGLEV
+  if (maglev_statistics_ != nullptr) {
+    DCHECK(v8_flags.maglev_stats || v8_flags.maglev_stats_nvp);
+    StdoutStream os;
+    if (v8_flags.maglev_stats) {
+      AsPrintableStatistics ps = {"Maglev", *maglev_statistics_, false};
+      os << ps << std::endl;
+    }
+    if (v8_flags.maglev_stats_nvp) {
+      AsPrintableStatistics ps = {"Maglev", *maglev_statistics_, true};
+      os << ps << std::endl;
+    }
+    maglev_statistics_.reset();
+  }
+#endif  // V8_ENABLE_MAGLEV
+
 #if V8_ENABLE_WEBASSEMBLY
   // TODO(7424): There is no public API for the {WasmEngine} yet. So for now we
   // just dump and reset the engines statistics together with the Isolate.
@@ -4747,6 +4936,12 @@ void Isolate::AbortConcurrentOptimization(BlockingBehavior behavior) {
     DisallowGarbageCollection no_recursive_gc;
     optimizing_compile_dispatcher()->Flush(behavior);
   }
+#ifdef V8_ENABLE_MAGLEV
+  if (maglev_concurrent_dispatcher()->is_enabled()) {
+    DisallowGarbageCollection no_recursive_gc;
+    maglev_concurrent_dispatcher()->Flush(behavior);
+  }
+#endif
 }
 
 std::shared_ptr<CompilationStatistics> Isolate::GetTurboStatistics() {
@@ -4756,6 +4951,17 @@ std::shared_ptr<CompilationStatistics> Isolate::GetTurboStatistics() {
   return turbo_statistics_;
 }
 
+#ifdef V8_ENABLE_MAGLEV
+
+std::shared_ptr<CompilationStatistics> Isolate::GetMaglevStatistics() {
+  if (maglev_statistics_ == nullptr) {
+    maglev_statistics_.reset(new CompilationStatistics());
+  }
+  return maglev_statistics_;
+}
+
+#endif  // V8_ENABLE_MAGLEV
+
 CodeTracer* Isolate::GetCodeTracer() {
   if (code_tracer() == nullptr) set_code_tracer(new CodeTracer(id()));
   return code_tracer();
@@ -4769,37 +4975,46 @@ bool Isolate::use_optimizer() {
 
 void Isolate::IncreaseTotalRegexpCodeGenerated(Handle<HeapObject> code) {
   PtrComprCageBase cage_base(this);
-  DCHECK(code->IsCode(cage_base) || code->IsByteArray(cage_base));
+  DCHECK(IsCode(*code, cage_base) || IsByteArray(*code, cage_base));
   total_regexp_code_generated_ += code->Size(cage_base);
 }
 
 bool Isolate::NeedsDetailedOptimizedCodeLineInfo() const {
-  return NeedsSourcePositionsForProfiling() ||
-         detailed_source_positions_for_profiling();
+  return NeedsSourcePositions() || detailed_source_positions_for_profiling();
+}
+
+bool Isolate::IsLoggingCodeCreation() const {
+  return v8_file_logger()->is_listening_to_code_events() || is_profiling() ||
+         v8_flags.log_function_events ||
+         logger()->is_listening_to_code_events();
 }
 
-bool Isolate::NeedsSourcePositionsForProfiling() const {
+bool Isolate::AllowsCodeCompaction() const {
+  return v8_flags.compact_code_space && logger()->allows_code_compaction();
+}
+
+bool Isolate::NeedsSourcePositions() const {
   return
       // Static conditions.
       v8_flags.trace_deopt || v8_flags.trace_turbo ||
       v8_flags.trace_turbo_graph || v8_flags.turbo_profiling ||
       v8_flags.print_maglev_code || v8_flags.perf_prof || v8_flags.log_maps ||
-      v8_flags.log_ic ||
+      v8_flags.log_ic || v8_flags.log_function_events ||
       // Dynamic conditions; changing any of these conditions triggers source
       // position collection for the entire heap
       // (CollectSourcePositionsForAllBytecodeArrays).
       is_profiling() || debug_->is_active() || v8_file_logger_->is_logging();
 }
 
-void Isolate::SetFeedbackVectorsForProfilingTools(Object value) {
-  DCHECK(value.IsUndefined(this) || value.IsArrayList());
+void Isolate::SetFeedbackVectorsForProfilingTools(Tagged<Object> value) {
+  DCHECK(IsUndefined(value, this) || IsArrayList(value));
   heap()->set_feedback_vectors_for_profiling_tools(value);
 }
 
 void Isolate::MaybeInitializeVectorListFromHeap() {
-  if (!heap()->feedback_vectors_for_profiling_tools().IsUndefined(this)) {
+  if (!IsUndefined(heap()->feedback_vectors_for_profiling_tools(), this)) {
     // Already initialized, return early.
-    DCHECK(heap()->feedback_vectors_for_profiling_tools().IsArrayList());
+    DCHECK(IsArrayList(heap()->feedback_vectors_for_profiling_tools()));
     return;
   }
 
@@ -4808,15 +5023,15 @@ void Isolate::MaybeInitializeVectorListFromHeap() {
 
   {
     HeapObjectIterator heap_iterator(heap());
-    for (HeapObject current_obj = heap_iterator.Next(); !current_obj.is_null();
-         current_obj = heap_iterator.Next()) {
-      if (!current_obj.IsFeedbackVector()) continue;
+    for (Tagged<HeapObject> current_obj = heap_iterator.Next();
+         !current_obj.is_null(); current_obj = heap_iterator.Next()) {
+      if (!IsFeedbackVector(current_obj)) continue;
 
       FeedbackVector vector = FeedbackVector::cast(current_obj);
-      SharedFunctionInfo shared = vector.shared_function_info();
+      SharedFunctionInfo shared = vector->shared_function_info();
 
       // No need to preserve the feedback vector for non-user-visible functions.
-      if (!shared.IsSubjectToDebugging()) continue;
+      if (!shared->IsSubjectToDebugging()) continue;
 
       vectors.emplace_back(vector, this);
     }
@@ -4837,38 +5052,38 @@ void Isolate::set_date_cache(DateCache* date_cache) {
 }
 
 Isolate::KnownPrototype Isolate::IsArrayOrObjectOrStringPrototype(
-    Object object) {
-  Object context = heap()->native_contexts_list();
-  while (!context.IsUndefined(this)) {
+    Tagged<Object> object) {
+  Tagged<Object> context = heap()->native_contexts_list();
+  while (!IsUndefined(context, this)) {
     Context current_context = Context::cast(context);
-    if (current_context.initial_object_prototype() == object) {
+    if (current_context->initial_object_prototype() == object) {
       return KnownPrototype::kObject;
-    } else if (current_context.initial_array_prototype() == object) {
+    } else if (current_context->initial_array_prototype() == object) {
       return KnownPrototype::kArray;
-    } else if (current_context.initial_string_prototype() == object) {
+    } else if (current_context->initial_string_prototype() == object) {
       return KnownPrototype::kString;
     }
-    context = current_context.next_context_link();
+    context = current_context->next_context_link();
   }
   return KnownPrototype::kNone;
 }
 
-bool Isolate::IsInAnyContext(Object object, uint32_t index) {
+bool Isolate::IsInAnyContext(Tagged<Object> object, uint32_t index) {
   DisallowGarbageCollection no_gc;
-  Object context = heap()->native_contexts_list();
-  while (!context.IsUndefined(this)) {
+  Tagged<Object> context = heap()->native_contexts_list();
+  while (!IsUndefined(context, this)) {
     Context current_context = Context::cast(context);
-    if (current_context.get(index) == object) {
+    if (current_context->get(index) == object) {
       return true;
     }
-    context = current_context.next_context_link();
+    context = current_context->next_context_link();
   }
   return false;
 }
 
 void Isolate::UpdateNoElementsProtectorOnSetElement(Handle<JSObject> object) {
   DisallowGarbageCollection no_gc;
-  if (!object->map().is_prototype_map()) return;
+  if (!object->map()->is_prototype_map()) return;
   if (!Protectors::IsNoElementsIntact(this)) return;
   KnownPrototype obj_type = IsArrayOrObjectOrStringPrototype(*object);
   if (obj_type == KnownPrototype::kNone) return;
@@ -4884,15 +5099,15 @@ void Isolate::UpdateTypedArraySpeciesLookupChainProtectorOnSetPrototype(
     Handle<JSObject> object) {
   // Setting the __proto__ of TypedArray constructor could change TypedArray's
   // @@species. So we need to invalidate the @@species protector.
-  if (object->IsTypedArrayConstructor() &&
+  if (IsTypedArrayConstructor(*object) &&
       Protectors::IsTypedArraySpeciesLookupChainIntact(this)) {
     Protectors::InvalidateTypedArraySpeciesLookupChain(this);
   }
 }
 
-void Isolate::UpdateNumberStringPrototypeNoReplaceProtectorOnSetPrototype(
+void Isolate::UpdateNumberStringNotRegexpLikeProtectorOnSetPrototype(
     Handle<JSObject> object) {
-  if (!Protectors::IsNumberStringPrototypeNoReplaceIntact(this)) {
+  if (!Protectors::IsNumberStringNotRegexpLikeIntact(this)) {
     return;
   }
   // We need to protect the prototype chain of `Number.prototype` and
@@ -4902,9 +5117,9 @@ void Isolate::UpdateNumberStringPrototypeNoReplaceProtectorOnSetPrototype(
   // checking for a prototype that is a JSPrimitiveWrapper. This is a safe
   // approximation. Using JSPrimitiveWrapper as prototype should be
   // sufficiently rare.
-  DCHECK(!object->IsJSObjectPrototype());
-  if (object->map().is_prototype_map() && (object->IsJSPrimitiveWrapper())) {
-    Protectors::InvalidateNumberStringPrototypeNoReplace(this);
+  DCHECK(!IsJSObjectPrototype(*object));
+  if (object->map()->is_prototype_map() && (IsJSPrimitiveWrapper(*object))) {
+    Protectors::InvalidateNumberStringNotRegexpLike(this);
   }
 }
 
@@ -5081,8 +5296,9 @@ MaybeHandle<JSPromise> NewRejectedPromise(Isolate* isolate,
 MaybeHandle<JSPromise> Isolate::RunHostImportModuleDynamicallyCallback(
     MaybeHandle<Script> maybe_referrer, Handle<Object> specifier,
     MaybeHandle<Object> maybe_import_assertions_argument) {
-  v8::Local<v8::Context> api_context =
-      v8::Utils::ToLocal(Handle<Context>::cast(native_context()));
+  DCHECK(!is_execution_terminating());
+  DCHECK(!is_execution_termination_pending());
+  v8::Local<v8::Context> api_context = v8::Utils::ToLocal(native_context());
   if (host_import_module_dynamically_with_import_assertions_callback_ ==
           nullptr &&
       host_import_module_dynamically_callback_ == nullptr) {
@@ -5094,6 +5310,9 @@ MaybeHandle<JSPromise> Isolate::RunHostImportModuleDynamicallyCallback(
   Handle<String> specifier_str;
   MaybeHandle<String> maybe_specifier = Object::ToString(this, specifier);
   if (!maybe_specifier.ToHandle(&specifier_str)) {
+    if (is_execution_termination_pending()) {
+      return MaybeHandle<JSPromise>();
+    }
     Handle<Object> exception(pending_exception(), this);
     clear_pending_exception();
     return NewRejectedPromise(this, api_context, exception);
@@ -5104,6 +5323,9 @@ MaybeHandle<JSPromise> Isolate::RunHostImportModuleDynamicallyCallback(
   Handle<FixedArray> import_assertions_array;
   if (!GetImportAssertionsFromArgument(maybe_import_assertions_argument)
            .ToHandle(&import_assertions_array)) {
+    if (is_execution_termination_pending()) {
+      return MaybeHandle<JSPromise>();
+    }
     Handle<Object> exception(pending_exception(), this);
     clear_pending_exception();
     return NewRejectedPromise(this, api_context, exception);
@@ -5150,15 +5372,16 @@ MaybeHandle<FixedArray> Isolate::GetImportAssertionsFromArgument(
   Handle<FixedArray> import_assertions_array = factory()->empty_fixed_array();
   Handle<Object> import_assertions_argument;
   if (!maybe_import_assertions_argument.ToHandle(&import_assertions_argument) ||
-      import_assertions_argument->IsUndefined()) {
+      IsUndefined(*import_assertions_argument)) {
     return import_assertions_array;
   }
 
   // The parser shouldn't have allowed the second argument to import() if
   // the flag wasn't enabled.
-  DCHECK(v8_flags.harmony_import_assertions);
+  DCHECK(v8_flags.harmony_import_assertions ||
+         v8_flags.harmony_import_attributes);
 
-  if (!import_assertions_argument->IsJSReceiver()) {
+  if (!IsJSReceiver(*import_assertions_argument)) {
     this->Throw(
         *factory()->NewTypeError(MessageTemplate::kNonObjectImportArgument));
     return MaybeHandle<FixedArray>();
@@ -5166,21 +5389,38 @@ MaybeHandle<FixedArray> Isolate::GetImportAssertionsFromArgument(
 
   Handle<JSReceiver> import_assertions_argument_receiver =
       Handle<JSReceiver>::cast(import_assertions_argument);
-  Handle<Name> key = factory()->assert_string();
 
   Handle<Object> import_assertions_object;
-  if (!JSReceiver::GetProperty(this, import_assertions_argument_receiver, key)
-           .ToHandle(&import_assertions_object)) {
-    // This can happen if the property has a getter function that throws
-    // an error.
-    return MaybeHandle<FixedArray>();
+
+  if (v8_flags.harmony_import_attributes) {
+    Handle<Name> with_key = factory()->with_string();
+    if (!JSReceiver::GetProperty(this, import_assertions_argument_receiver,
+                                 with_key)
+             .ToHandle(&import_assertions_object)) {
+      // This can happen if the property has a getter function that throws
+      // an error.
+      return MaybeHandle<FixedArray>();
+    }
+  }
+
+  if (v8_flags.harmony_import_assertions &&
+      (!v8_flags.harmony_import_attributes ||
+       IsUndefined(*import_assertions_object))) {
+    Handle<Name> assert_key = factory()->assert_string();
+    if (!JSReceiver::GetProperty(this, import_assertions_argument_receiver,
+                                 assert_key)
+             .ToHandle(&import_assertions_object)) {
+      // This can happen if the property has a getter function that throws
+      // an error.
+      return MaybeHandle<FixedArray>();
+    }
   }
 
-  // If there is no 'assert' option in the options bag, it's not an error. Just
-  // do the import() as if no assertions were provided.
-  if (import_assertions_object->IsUndefined()) return import_assertions_array;
+  // If there is no 'with' or 'assert' option in the options bag, it's not an
+  // error. Just do the import() as if no assertions were provided.
+  if (IsUndefined(*import_assertions_object)) return import_assertions_array;
 
-  if (!import_assertions_object->IsJSReceiver()) {
+  if (!IsJSReceiver(*import_assertions_object)) {
     this->Throw(
         *factory()->NewTypeError(MessageTemplate::kNonObjectAssertOption));
     return MaybeHandle<FixedArray>();
@@ -5199,6 +5439,8 @@ MaybeHandle<FixedArray> Isolate::GetImportAssertionsFromArgument(
     return MaybeHandle<FixedArray>();
   }
 
+  bool has_non_string_attribute = false;
+
   // The assertions will be passed to the host in the form: [key1,
   // value1, key2, value2, ...].
   constexpr size_t kAssertionEntrySizeForDynamicImport = 2;
@@ -5207,18 +5449,16 @@ MaybeHandle<FixedArray> Isolate::GetImportAssertionsFromArgument(
   for (int i = 0; i < assertion_keys->length(); i++) {
     Handle<String> assertion_key(String::cast(assertion_keys->get(i)), this);
     Handle<Object> assertion_value;
-    if (!JSReceiver::GetProperty(this, import_assertions_object_receiver,
-                                 assertion_key)
+    if (!Object::GetPropertyOrElement(this, import_assertions_object_receiver,
+                                      assertion_key)
              .ToHandle(&assertion_value)) {
       // This can happen if the property has a getter function that throws
       // an error.
       return MaybeHandle<FixedArray>();
     }
 
-    if (!assertion_value->IsString()) {
-      this->Throw(*factory()->NewTypeError(
-          MessageTemplate::kNonStringImportAssertionValue));
-      return MaybeHandle<FixedArray>();
+    if (!IsString(*assertion_value)) {
+      has_non_string_attribute = true;
     }
 
     import_assertions_array->set((i * kAssertionEntrySizeForDynamicImport),
@@ -5227,6 +5467,12 @@ MaybeHandle<FixedArray> Isolate::GetImportAssertionsFromArgument(
                                  *assertion_value);
   }
 
+  if (has_non_string_attribute) {
+    this->Throw(*factory()->NewTypeError(
+        MessageTemplate::kNonStringImportAssertionValue));
+    return MaybeHandle<FixedArray>();
+  }
+
   return import_assertions_array;
 }
 
@@ -5246,11 +5492,10 @@ void Isolate::SetHostImportModuleDynamicallyCallback(
 
 MaybeHandle<JSObject> Isolate::RunHostInitializeImportMetaObjectCallback(
     Handle<SourceTextModule> module) {
-  CHECK(module->import_meta(kAcquireLoad).IsTheHole(this));
+  CHECK(IsTheHole(module->import_meta(kAcquireLoad), this));
   Handle<JSObject> import_meta = factory()->NewJSObjectWithNullProto();
   if (host_initialize_import_meta_object_callback_ != nullptr) {
-    v8::Local<v8::Context> api_context =
-        v8::Utils::ToLocal(Handle<Context>(native_context()));
+    v8::Local<v8::Context> api_context = v8::Utils::ToLocal(native_context());
     host_initialize_import_meta_object_callback_(
         api_context, Utils::ToLocal(Handle<Module>::cast(module)),
         v8::Local<v8::Object>::Cast(v8::Utils::ToLocal(import_meta)));
@@ -5280,8 +5525,7 @@ MaybeHandle<NativeContext> Isolate::RunHostCreateShadowRealmContextCallback() {
     return kNullMaybeHandle;
   }
 
-  v8::Local<v8::Context> api_context =
-      v8::Utils::ToLocal(Handle<Context>(native_context()));
+  v8::Local<v8::Context> api_context = v8::Utils::ToLocal(native_context());
   v8::Local<v8::Context> shadow_realm_context;
   ASSIGN_RETURN_ON_SCHEDULED_EXCEPTION_VALUE(
       this, shadow_realm_context,
@@ -5289,14 +5533,15 @@ MaybeHandle<NativeContext> Isolate::RunHostCreateShadowRealmContextCallback() {
       MaybeHandle<NativeContext>());
   Handle<Context> shadow_realm_context_handle =
       v8::Utils::OpenHandle(*shadow_realm_context);
-  DCHECK(shadow_realm_context_handle->IsNativeContext());
+  DCHECK(IsNativeContext(*shadow_realm_context_handle));
   shadow_realm_context_handle->set_scope_info(
       ReadOnlyRoots(this).shadow_realm_scope_info());
   return Handle<NativeContext>::cast(shadow_realm_context_handle);
 }
 
 MaybeHandle<Object> Isolate::RunPrepareStackTraceCallback(
-    Handle<Context> context, Handle<JSObject> error, Handle<JSArray> sites) {
+    Handle<NativeContext> context, Handle<JSObject> error,
+    Handle<JSArray> sites) {
   v8::Local<v8::Context> api_context = Utils::ToLocal(context);
 
   v8::Local<v8::Value> stack;
@@ -5363,6 +5608,20 @@ bool Isolate::HasPrepareStackTraceCallback() const {
   return prepare_stack_trace_callback_ != nullptr;
 }
 
+#if defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+void Isolate::SetFilterETWSessionByURLCallback(
+    FilterETWSessionByURLCallback callback) {
+  filter_etw_session_by_url_callback_ = callback;
+}
+
+bool Isolate::RunFilterETWSessionByURLCallback(
+    const std::string& etw_filter_payload) {
+  if (!filter_etw_session_by_url_callback_) return true;
+  v8::Local<v8::Context> context = Utils::ToLocal(native_context());
+  return filter_etw_session_by_url_callback_(context, etw_filter_payload);
+}
+#endif  // V8_OS_WIN && V8_ENABLE_ETW_STACK_WALKING
+
 void Isolate::SetAddCrashKeyCallback(AddCrashKeyCallback callback) {
   add_crash_key_callback_ = callback;
 
@@ -5520,20 +5779,20 @@ void Isolate::OnTerminationDuringRunMicrotasks() {
   // Empty the promise stack.
   debug()->thread_local_.promise_stack_ = Smi::zero();
 
-  if (current_microtask->IsPromiseReactionJobTask()) {
+  if (IsPromiseReactionJobTask(*current_microtask)) {
     Handle<PromiseReactionJobTask> promise_reaction_job_task =
         Handle<PromiseReactionJobTask>::cast(current_microtask);
     Handle<HeapObject> promise_or_capability(
         promise_reaction_job_task->promise_or_capability(), this);
-    if (promise_or_capability->IsPromiseCapability()) {
+    if (IsPromiseCapability(*promise_or_capability)) {
       promise_or_capability = handle(
           Handle<PromiseCapability>::cast(promise_or_capability)->promise(),
           this);
     }
-    if (promise_or_capability->IsJSPromise()) {
+    if (IsJSPromise(*promise_or_capability)) {
       OnPromiseAfter(Handle<JSPromise>::cast(promise_or_capability));
     }
-  } else if (current_microtask->IsPromiseResolveThenableJobTask()) {
+  } else if (IsPromiseResolveThenableJobTask(*current_microtask)) {
     Handle<PromiseResolveThenableJobTask> promise_resolve_thenable_job_task =
         Handle<PromiseResolveThenableJobTask>::cast(current_microtask);
     Handle<JSPromise> promise_to_resolve(
@@ -5569,8 +5828,8 @@ void Isolate::CountUsage(v8::Isolate::UseCounterFeature feature) {
   // TODO(jgruber): Consider either removing the native context requirement in
   // blink, or passing it to the callback explicitly.
   if (heap_.gc_state() == Heap::NOT_IN_GC && !context().is_null()) {
-    DCHECK(context().IsContext());
-    DCHECK(context().native_context().IsNativeContext());
+    DCHECK(IsContext(context()));
+    DCHECK(IsNativeContext(context()->native_context()));
     if (use_counter_callback_) {
       HandleScope handle_scope(this);
       use_counter_callback_(reinterpret_cast<v8::Isolate*>(this), feature);
@@ -5603,13 +5862,12 @@ std::string Isolate::GetTurboCfgFileName(Isolate* isolate) {
 }
 
 // Heap::detached_contexts tracks detached contexts as pairs
-// (number of GC since the context was detached, the context).
+// (the context, number of GC since the context was detached).
 void Isolate::AddDetachedContext(Handle<Context> context) {
   HandleScope scope(this);
   Handle<WeakArrayList> detached_contexts = factory()->detached_contexts();
   detached_contexts = WeakArrayList::AddToEnd(
-      this, detached_contexts, MaybeObjectHandle(Smi::zero(), this),
-      MaybeObjectHandle::Weak(context));
+      this, detached_contexts, MaybeObjectHandle::Weak(context), Smi::zero());
   heap()->set_detached_contexts(*detached_contexts);
 }
 
@@ -5620,19 +5878,18 @@ void Isolate::CheckDetachedContextsAfterGC() {
   if (length == 0) return;
   int new_length = 0;
   for (int i = 0; i < length; i += 2) {
-    int mark_sweeps = detached_contexts->Get(i).ToSmi().value();
-    MaybeObject context = detached_contexts->Get(i + 1);
+    MaybeObject context = detached_contexts->Get(i);
     DCHECK(context->IsWeakOrCleared());
     if (!context->IsCleared()) {
-      detached_contexts->Set(
-          new_length, MaybeObject::FromSmi(Smi::FromInt(mark_sweeps + 1)));
-      detached_contexts->Set(new_length + 1, context);
+      int mark_sweeps = detached_contexts->Get(i + 1).ToSmi().value();
+      detached_contexts->Set(new_length, context);
+      detached_contexts->Set(new_length + 1, Smi::FromInt(mark_sweeps + 1));
       new_length += 2;
     }
   }
   detached_contexts->set_length(new_length);
   while (new_length < length) {
-    detached_contexts->Set(new_length, MaybeObject::FromSmi(Smi::zero()));
+    detached_contexts->Set(new_length, Smi::zero());
     ++new_length;
   }
 
@@ -5640,8 +5897,8 @@ void Isolate::CheckDetachedContextsAfterGC() {
     PrintF("%d detached contexts are collected out of %d\n",
            length - new_length, length);
     for (int i = 0; i < new_length; i += 2) {
-      int mark_sweeps = detached_contexts->Get(i).ToSmi().value();
-      MaybeObject context = detached_contexts->Get(i + 1);
+      MaybeObject context = detached_contexts->Get(i);
+      int mark_sweeps = detached_contexts->Get(i + 1).ToSmi().value();
       DCHECK(context->IsWeakOrCleared());
       if (mark_sweeps > 3) {
         PrintF("detached context %p\n survived %d GCs (leak?)\n",
@@ -5653,20 +5910,20 @@ void Isolate::CheckDetachedContextsAfterGC() {
 
 void Isolate::DetachGlobal(Handle<Context> env) {
   counters()->errors_thrown_per_context()->AddSample(
-      env->native_context().GetErrorsThrown());
+      env->native_context()->GetErrorsThrown());
 
   ReadOnlyRoots roots(this);
   Handle<JSGlobalProxy> global_proxy(env->global_proxy(), this);
   global_proxy->set_native_context(roots.null_value());
-  // NOTE: Turbofan's JSNativeContextSpecialization depends on DetachGlobal
-  // causing a map change.
+  // NOTE: Turbofan's JSNativeContextSpecialization and Maglev depend on
+  // DetachGlobal causing a map change.
   JSObject::ForceSetPrototype(this, global_proxy, factory()->null_value());
-  global_proxy->map().set_constructor_or_back_pointer(roots.null_value(),
-                                                      kRelaxedStore);
+  global_proxy->map()->set_constructor_or_back_pointer(roots.null_value(),
+                                                       kRelaxedStore);
   if (v8_flags.track_detached_contexts) AddDetachedContext(env);
   DCHECK(global_proxy->IsDetached());
 
-  env->native_context().set_microtask_queue(this, nullptr);
+  env->native_context()->set_microtask_queue(this, nullptr);
 }
 
 double Isolate::LoadStartTimeMs() {
@@ -5687,7 +5944,14 @@ void Isolate::SetRAILMode(RAILMode rail_mode) {
   }
   rail_mode_.store(rail_mode);
   if (old_rail_mode == PERFORMANCE_LOAD && rail_mode != PERFORMANCE_LOAD) {
-    heap()->incremental_marking()->incremental_marking_job()->ScheduleTask();
+    if (auto* job = heap()->incremental_marking()->incremental_marking_job()) {
+      // The task will start incremental marking (if needed not already started)
+      // and advance marking if incremental marking is active.
+      job->ScheduleTask();
+    }
+    if (auto* job = heap()->minor_gc_job()) {
+      job->SchedulePreviouslyRequestedTask();
+    }
   }
   if (v8_flags.trace_rail) {
     PrintIsolate(this, "RAIL mode: %s\n", RAILModeName(rail_mode));
@@ -5730,11 +5994,18 @@ void Isolate::CollectSourcePositionsForAllBytecodeArrays() {
   std::vector<Handle<SharedFunctionInfo>> sfis;
   {
     HeapObjectIterator iterator(heap());
-    for (HeapObject obj = iterator.Next(); !obj.is_null();
+    for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
          obj = iterator.Next()) {
-      if (!obj.IsSharedFunctionInfo()) continue;
+      if (!IsSharedFunctionInfo(obj)) continue;
       SharedFunctionInfo sfi = SharedFunctionInfo::cast(obj);
-      if (!sfi.CanCollectSourcePosition(this)) continue;
+      // If the script is a Smi, then the SharedFunctionInfo is in
+      // the process of being deserialized.
+      Tagged<Object> script = sfi->raw_script(kAcquireLoad);
+      if (IsSmi(script)) {
+        DCHECK_EQ(script, Smi::uninitialized_deserialization_value());
+        continue;
+      }
+      if (!sfi->CanCollectSourcePosition(this)) continue;
       sfis.push_back(Handle<SharedFunctionInfo>(sfi, this));
     }
   }
@@ -5748,13 +6019,13 @@ void Isolate::CollectSourcePositionsForAllBytecodeArrays() {
 namespace {
 
 std::string GetStringFromLocales(Isolate* isolate, Handle<Object> locales) {
-  if (locales->IsUndefined(isolate)) return "";
-  return std::string(String::cast(*locales).ToCString().get());
+  if (IsUndefined(*locales, isolate)) return "";
+  return std::string(String::cast(*locales)->ToCString().get());
 }
 
 bool StringEqualsLocales(Isolate* isolate, const std::string& str,
                          Handle<Object> locales) {
-  if (locales->IsUndefined(isolate)) return str == "";
+  if (IsUndefined(*locales, isolate)) return str == "";
   return Handle<String>::cast(locales)->IsEqualTo(
       base::VectorOf(str.c_str(), str.length()));
 }
@@ -5838,6 +6109,24 @@ bool StackLimitCheck::JsHasOverflowed(uintptr_t gap) const {
   return GetCurrentStackPosition() - gap < stack_guard->real_climit();
 }
 
+bool StackLimitCheck::WasmHasOverflowed(uintptr_t gap) const {
+  StackGuard* stack_guard = isolate_->stack_guard();
+  auto sp = isolate_->thread_local_top()->secondary_stack_sp_;
+  auto limit = isolate_->thread_local_top()->secondary_stack_limit_;
+  if (sp == 0) {
+#ifdef USE_SIMULATOR
+    // The simulator uses a separate JS stack.
+    // Use it if code is executed on the central stack.
+    Address jssp_address = Simulator::current(isolate_)->get_sp();
+    uintptr_t jssp = static_cast<uintptr_t>(jssp_address);
+    if (jssp - gap < stack_guard->real_jslimit()) return true;
+#endif  // USE_SIMULATOR
+    sp = GetCurrentStackPosition();
+    limit = stack_guard->real_climit();
+  }
+  return sp - gap < limit;
+}
+
 SaveContext::SaveContext(Isolate* isolate) : isolate_(isolate) {
   if (!isolate->context().is_null()) {
     context_ = Handle<Context>(isolate->context(), isolate);
@@ -5845,11 +6134,11 @@ SaveContext::SaveContext(Isolate* isolate) : isolate_(isolate) {
 }
 
 SaveContext::~SaveContext() {
-  isolate_->set_context(context_.is_null() ? Context() : *context_);
+  isolate_->set_context(context_.is_null() ? Tagged<Context>() : *context_);
 }
 
 SaveAndSwitchContext::SaveAndSwitchContext(Isolate* isolate,
-                                           Context new_context)
+                                           Tagged<Context> new_context)
     : SaveContext(isolate) {
   isolate->set_context(new_context);
 }
@@ -5936,7 +6225,7 @@ v8::metrics::Recorder::ContextId Isolate::GetOrRegisterRecorderContextId(
     Handle<NativeContext> context) {
   if (serializer_enabled_) return v8::metrics::Recorder::ContextId::Empty();
   i::Object id = context->recorder_context_id();
-  if (id.IsNullOrUndefined()) {
+  if (IsNullOrUndefined(id)) {
     CHECK_LT(last_recorder_context_id_, i::Smi::kMaxValue);
     context->set_recorder_context_id(
         i::Smi::FromIntptr(++last_recorder_context_id_));
@@ -5951,7 +6240,7 @@ v8::metrics::Recorder::ContextId Isolate::GetOrRegisterRecorderContextId(
         RemoveContextIdCallback, v8::WeakCallbackType::kParameter);
     return v8::metrics::Recorder::ContextId(last_recorder_context_id_);
   } else {
-    DCHECK(id.IsSmi());
+    DCHECK(IsSmi(id));
     return v8::metrics::Recorder::ContextId(
         static_cast<uintptr_t>(i::Smi::ToInt(id)));
   }
@@ -6063,7 +6352,7 @@ ExternalPointerHandle Isolate::GetOrCreateWaiterQueueNodeExternalPointer() {
     handle = waiter_queue_node_external_pointer_handle_;
   } else {
     handle = shared_external_pointer_table().AllocateAndInitializeEntry(
-        this, kNullAddress, kWaiterQueueNodeTag);
+        shared_external_pointer_space(), kNullAddress, kWaiterQueueNodeTag);
     waiter_queue_node_external_pointer_handle_ = handle;
   }
   DCHECK_NE(0, handle);
@@ -6075,15 +6364,15 @@ void Isolate::LocalsBlockListCacheSet(Handle<ScopeInfo> scope_info,
                                       Handle<ScopeInfo> outer_scope_info,
                                       Handle<StringSet> locals_blocklist) {
   Handle<EphemeronHashTable> cache;
-  if (heap()->locals_block_list_cache().IsEphemeronHashTable()) {
+  if (IsEphemeronHashTable(heap()->locals_block_list_cache())) {
     cache = handle(EphemeronHashTable::cast(heap()->locals_block_list_cache()),
                    this);
   } else {
-    CHECK(heap()->locals_block_list_cache().IsUndefined());
+    CHECK(IsUndefined(heap()->locals_block_list_cache()));
     constexpr int kInitialCapacity = 8;
     cache = EphemeronHashTable::New(this, kInitialCapacity);
   }
-  DCHECK(cache->IsEphemeronHashTable());
+  DCHECK(IsEphemeronHashTable(*cache));
 
   Handle<Object> value;
   if (!outer_scope_info.is_null()) {
@@ -6098,71 +6387,35 @@ void Isolate::LocalsBlockListCacheSet(Handle<ScopeInfo> scope_info,
   heap()->set_locals_block_list_cache(*cache);
 }
 
-Object Isolate::LocalsBlockListCacheGet(Handle<ScopeInfo> scope_info) {
+Tagged<Object> Isolate::LocalsBlockListCacheGet(Handle<ScopeInfo> scope_info) {
   DisallowGarbageCollection no_gc;
 
-  if (!heap()->locals_block_list_cache().IsEphemeronHashTable()) {
+  if (!IsEphemeronHashTable(heap()->locals_block_list_cache())) {
     return ReadOnlyRoots(this).the_hole_value();
   }
 
-  Object maybe_value =
+  Tagged<Object> maybe_value =
       EphemeronHashTable::cast(heap()->locals_block_list_cache())
-          .Lookup(scope_info);
-  if (maybe_value.IsTuple2()) return Tuple2::cast(maybe_value).value2();
+          ->Lookup(scope_info);
+  if (IsTuple2(maybe_value)) return Tuple2::cast(maybe_value)->value2();
 
-  CHECK(maybe_value.IsStringSet() || maybe_value.IsTheHole());
+  CHECK(IsStringSet(maybe_value) || IsTheHole(maybe_value));
   return maybe_value;
 }
 
-namespace {
-class DefaultWasmAsyncResolvePromiseTask : public v8::Task {
- public:
-  DefaultWasmAsyncResolvePromiseTask(v8::Isolate* isolate,
-                                     v8::Local<v8::Context> context,
-                                     v8::Local<v8::Promise::Resolver> resolver,
-                                     v8::Local<v8::Value> result,
-                                     WasmAsyncSuccess success)
-      : isolate_(isolate),
-        context_(isolate, context),
-        resolver_(isolate, resolver),
-        result_(isolate, result),
-        success_(success) {}
-
-  void Run() override {
-    v8::HandleScope scope(isolate_);
-    v8::Local<v8::Context> context = context_.Get(isolate_);
-    MicrotasksScope microtasks_scope(context,
-                                     MicrotasksScope::kDoNotRunMicrotasks);
-    v8::Local<v8::Promise::Resolver> resolver = resolver_.Get(isolate_);
-    v8::Local<v8::Value> result = result_.Get(isolate_);
-
-    Maybe<bool> ret = success_ == WasmAsyncSuccess::kSuccess
-                          ? resolver->Resolve(context, result)
-                          : resolver->Reject(context, result);
-    // It's guaranteed that no exceptions will be thrown by these
-    // operations, but execution might be terminating.
-    CHECK(ret.IsJust() ? ret.FromJust() : isolate_->IsExecutionTerminating());
-  }
-
- private:
-  v8::Isolate* isolate_;
-  v8::Global<v8::Context> context_;
-  v8::Global<v8::Promise::Resolver> resolver_;
-  v8::Global<v8::Value> result_;
-  WasmAsyncSuccess success_;
-};
-}  // namespace
-
 void DefaultWasmAsyncResolvePromiseCallback(
     v8::Isolate* isolate, v8::Local<v8::Context> context,
     v8::Local<v8::Promise::Resolver> resolver, v8::Local<v8::Value> result,
     WasmAsyncSuccess success) {
-  // We have to resolve the promise in a separate task which is not a cancelable
-  // task, to avoid a deadlock when {quit()} is called in the then-handler of
-  // the result promise.
-  V8::GetCurrentPlatform()->GetForegroundTaskRunner(isolate)->PostTask(
-      std::make_unique<DefaultWasmAsyncResolvePromiseTask>(
-          isolate, context, resolver, result, success));
+  MicrotasksScope microtasks_scope(context,
+                                   MicrotasksScope::kDoNotRunMicrotasks);
+
+  Maybe<bool> ret = success == WasmAsyncSuccess::kSuccess
+                        ? resolver->Resolve(context, result)
+                        : resolver->Reject(context, result);
+  // It's guaranteed that no exceptions will be thrown by these
+  // operations, but execution might be terminating.
+  CHECK(ret.IsJust() ? ret.FromJust() : isolate->IsExecutionTerminating());
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/execution/isolate.h b/deps/v8/src/execution/isolate.h
index 929435239ff8f3..cc472d796566c9 100644
--- a/deps/v8/src/execution/isolate.h
+++ b/deps/v8/src/execution/isolate.h
@@ -41,8 +41,10 @@
 #include "src/objects/contexts.h"
 #include "src/objects/debug-objects.h"
 #include "src/objects/js-objects.h"
+#include "src/objects/tagged.h"
 #include "src/runtime/runtime.h"
-#include "src/sandbox/external-pointer.h"
+#include "src/sandbox/code-pointer-table.h"
+#include "src/sandbox/external-pointer-table.h"
 #include "src/utils/allocation.h"
 
 #ifdef DEBUG
@@ -509,9 +511,11 @@ using DebugObjectCache = std::vector<Handle<HeapObject>>;
   V(WasmAsyncResolvePromiseCallback, wasm_async_resolve_promise_callback,     \
     DefaultWasmAsyncResolvePromiseCallback)                                   \
   V(WasmLoadSourceMapCallback, wasm_load_source_map_callback, nullptr)        \
-  V(WasmSimdEnabledCallback, wasm_simd_enabled_callback, nullptr)             \
-  V(WasmExceptionsEnabledCallback, wasm_exceptions_enabled_callback, nullptr) \
   V(WasmGCEnabledCallback, wasm_gc_enabled_callback, nullptr)                 \
+  V(WasmImportedStringsEnabledCallback,                                       \
+    wasm_imported_strings_enabled_callback, nullptr)                          \
+  V(JavaScriptCompileHintsMagicEnabledCallback,                               \
+    compile_hints_magic_enabled_callback, nullptr)                            \
   /* State for Relocatable. */                                                \
   V(Relocatable*, relocatable_top, nullptr)                                   \
   V(DebugObjectCache*, string_stream_debug_object_cache, nullptr)             \
@@ -530,8 +534,6 @@ using DebugObjectCache = std::vector<Handle<HeapObject>>;
   V(size_t, num_cpu_profilers, 0)                                             \
   /* true if a trace is being formatted through Error.prepareStackTrace. */   \
   V(bool, formatting_stack_trace, false)                                      \
-  /* Perform side effect checks on function call and API callbacks. */        \
-  V(DebugInfo::ExecutionMode, debug_execution_mode, DebugInfo::kBreakpoints)  \
   V(bool, disable_bytecode_flushing, false)                                   \
   V(int, last_console_context_id, 0)                                          \
   V(v8_inspector::V8Inspector*, inspector, nullptr)                           \
@@ -546,7 +548,8 @@ using DebugObjectCache = std::vector<Handle<HeapObject>>;
   V(uint32_t, javascript_execution_counter, 0)                                \
   V(bool, deoptimization_assert, true)                                        \
   V(bool, compilation_assert, true)                                           \
-  V(bool, no_exception_assert, true)
+  V(bool, no_exception_assert, true)                                          \
+  V(uint32_t, wasm_switch_to_the_central_stack_counter, 0)
 
 #define THREAD_LOCAL_TOP_ACCESSOR(type, name)                         \
   inline void set_##name(type v) { thread_local_top()->name##_ = v; } \
@@ -743,6 +746,12 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     return &boilerplate_migration_access_;
   }
 
+  ReadOnlyArtifacts* read_only_artifacts() const {
+    ReadOnlyArtifacts* artifacts = artifacts_.get();
+    DCHECK_IMPLIES(ReadOnlyHeap::IsReadOnlySpaceShared(), artifacts != nullptr);
+    return artifacts;
+  }
+
   // The isolate's string table.
   StringTable* string_table() const { return string_table_.get(); }
   StringForwardingTable* string_forwarding_table() const {
@@ -752,8 +761,8 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   Address get_address_from_id(IsolateAddressId id);
 
   // Access to top context (where the current function object was created).
-  Context context() const { return thread_local_top()->context_; }
-  inline void set_context(Context context);
+  Tagged<Context> context() const { return thread_local_top()->context_; }
+  inline void set_context(Tagged<Context> context);
   Context* context_address() { return &thread_local_top()->context_; }
 
   // Access to current thread id.
@@ -764,13 +773,17 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     return thread_local_top()->thread_id_.load(std::memory_order_relaxed);
   }
 
-  void InstallConditionalFeatures(Handle<Context> context);
+  void InstallConditionalFeatures(Handle<NativeContext> context);
 
-  bool IsSharedArrayBufferConstructorEnabled(Handle<Context> context);
+  bool IsSharedArrayBufferConstructorEnabled(Handle<NativeContext> context);
 
-  bool IsWasmGCEnabled(Handle<Context> context);
-  bool IsWasmStringRefEnabled(Handle<Context> context);
-  bool IsWasmInliningEnabled(Handle<Context> context);
+  bool IsWasmGCEnabled(Handle<NativeContext> context);
+  bool IsWasmStringRefEnabled(Handle<NativeContext> context);
+  bool IsWasmInliningEnabled(Handle<NativeContext> context);
+  bool IsWasmInliningIntoJSEnabled(Handle<NativeContext> context);
+  bool IsWasmImportedStringsEnabled(Handle<NativeContext> context);
+
+  bool IsCompileHintsMagicEnabled(Handle<NativeContext> context);
 
   THREAD_LOCAL_TOP_ADDRESS(Context, pending_handler_context)
   THREAD_LOCAL_TOP_ADDRESS(Address, pending_handler_entrypoint)
@@ -789,25 +802,25 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   // Interface to pending exception.
   THREAD_LOCAL_TOP_ADDRESS(Object, pending_exception)
-  inline Object pending_exception();
-  inline void set_pending_exception(Object exception_obj);
+  inline Tagged<Object> pending_exception();
+  inline void set_pending_exception(Tagged<Object> exception_obj);
   inline void clear_pending_exception();
   inline bool has_pending_exception();
 
   THREAD_LOCAL_TOP_ADDRESS(Object, pending_message)
   inline void clear_pending_message();
-  inline Object pending_message();
+  inline Tagged<Object> pending_message();
   inline bool has_pending_message();
-  inline void set_pending_message(Object message_obj);
+  inline void set_pending_message(Tagged<Object> message_obj);
 
   THREAD_LOCAL_TOP_ADDRESS(Object, scheduled_exception)
-  inline Object scheduled_exception();
+  inline Tagged<Object> scheduled_exception();
   inline bool has_scheduled_exception();
   inline void clear_scheduled_exception();
-  inline void set_scheduled_exception(Object exception);
+  inline void set_scheduled_exception(Tagged<Object> exception);
 
 #ifdef DEBUG
-  inline Object VerifyBuiltinsResult(Object result);
+  inline Tagged<Object> VerifyBuiltinsResult(Tagged<Object> result);
   inline ObjectPair VerifyBuiltinsResult(ObjectPair pair);
 #endif
 
@@ -817,10 +830,10 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     kNone
   };
 
-  ExceptionHandlerType TopExceptionHandlerType(Object exception);
+  ExceptionHandlerType TopExceptionHandlerType(Tagged<Object> exception);
 
-  inline bool is_catchable_by_javascript(Object exception);
-  inline bool is_catchable_by_wasm(Object exception);
+  inline bool is_catchable_by_javascript(Tagged<Object> exception);
+  inline bool is_catchable_by_wasm(Tagged<Object> exception);
   inline bool is_execution_terminating();
   inline bool is_execution_termination_pending();
 
@@ -835,9 +848,10 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     return &thread_local_top()->c_entry_fp_;
   }
   static uint32_t c_entry_fp_offset() {
-    return static_cast<uint32_t>(
-        OFFSET_OF(Isolate, thread_local_top()->c_entry_fp_) -
-        isolate_root_bias());
+    return static_cast<uint32_t>(OFFSET_OF(Isolate, isolate_data_) +
+                                 OFFSET_OF(IsolateData, thread_local_top_) +
+                                 OFFSET_OF(ThreadLocalTop, c_entry_fp_) -
+                                 isolate_root_bias());
   }
   inline Address* handler_address() { return &thread_local_top()->handler_; }
   inline Address* c_function_address() {
@@ -955,16 +969,20 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   // Returns if the given context may access the given global object. If
   // the result is false, the pending exception is guaranteed to be
   // set.
-  bool MayAccess(Handle<Context> accessing_context, Handle<JSObject> receiver);
+  bool MayAccess(Handle<NativeContext> accessing_context,
+                 Handle<JSObject> receiver);
 
   void SetFailedAccessCheckCallback(v8::FailedAccessCheckCallback callback);
-  void ReportFailedAccessCheck(Handle<JSObject> receiver);
+  V8_WARN_UNUSED_RESULT MaybeHandle<Object> ReportFailedAccessCheck(
+      Handle<JSObject> receiver);
 
   // Exception throwing support. The caller should use the result
   // of Throw() as its return value.
-  Object Throw(Object exception) { return ThrowInternal(exception, nullptr); }
-  Object ThrowAt(Handle<JSObject> exception, MessageLocation* location);
-  Object ThrowIllegalOperation();
+  Tagged<Object> Throw(Tagged<Object> exception) {
+    return ThrowInternal(exception, nullptr);
+  }
+  Tagged<Object> ThrowAt(Handle<JSObject> exception, MessageLocation* location);
+  Tagged<Object> ThrowIllegalOperation();
 
   template <typename T>
   V8_WARN_UNUSED_RESULT MaybeHandle<T> Throw(Handle<Object> exception) {
@@ -1005,12 +1023,12 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   // reporting was handled when the exception was thrown originally.
   // The first overload doesn't set the corresponding pending message, which
   // has to be set separately or be guaranteed to not have changed.
-  Object ReThrow(Object exception);
-  Object ReThrow(Object exception, Object message);
+  Tagged<Object> ReThrow(Tagged<Object> exception);
+  Tagged<Object> ReThrow(Tagged<Object> exception, Tagged<Object> message);
 
   // Find the correct handler for the current pending exception. This also
   // clears and returns the current pending exception.
-  Object UnwindAndFindHandler();
+  Tagged<Object> UnwindAndFindHandler();
 
   // Tries to predict whether an exception will be caught. Note that this can
   // only produce an estimate, because it is undecidable whether a finally
@@ -1024,7 +1042,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   };
   CatchType PredictExceptionCatcher();
 
-  void ScheduleThrow(Object exception);
+  void ScheduleThrow(Tagged<Object> exception);
   // Re-set pending message, script and positions reported to the TryCatch
   // back to the TLS for re-use when rethrowing.
   void RestorePendingMessageFromTryCatch(v8::TryCatch* handler);
@@ -1033,7 +1051,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   void ReportPendingMessages();
 
   // Promote a scheduled exception to pending. Asserts has_scheduled_exception.
-  Object PromoteScheduledException();
+  Tagged<Object> PromoteScheduledException();
 
   // Attempts to compute the current source location, storing the
   // result in the target out parameter. The source location is attached to a
@@ -1057,13 +1075,15 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   Handle<JSMessageObject> CreateMessageFromException(Handle<Object> exception);
 
   // Out of resource exception helpers.
-  Object StackOverflow();
-  Object TerminateExecution();
+  Tagged<Object> StackOverflow();
+  Tagged<Object> TerminateExecution();
   void CancelTerminateExecution();
 
   void RequestInterrupt(InterruptCallback callback, void* data);
   void InvokeApiInterruptCallbacks();
 
+  void RequestInvalidateNoProfilingProtector();
+
   // Administration
   void Iterate(RootVisitor* v);
   void Iterate(RootVisitor* v, ThreadLocalTop* t);
@@ -1072,9 +1092,9 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   // Returns the current native context.
   inline Handle<NativeContext> native_context();
-  inline NativeContext raw_native_context();
+  inline Tagged<NativeContext> raw_native_context();
 
-  Handle<Context> GetIncumbentContext();
+  Handle<NativeContext> GetIncumbentContext();
 
   void RegisterTryCatchHandler(v8::TryCatch* that);
   void UnregisterTryCatchHandler(v8::TryCatch* that);
@@ -1137,7 +1157,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   }
   TieringManager* tiering_manager() { return tiering_manager_; }
   CompilationCache* compilation_cache() { return compilation_cache_; }
-  V8FileLogger* v8_file_logger() {
+  V8FileLogger* v8_file_logger() const {
     // Call InitializeLoggingAndCounters() if logging is needed before
     // the isolate is fully initialized.
     DCHECK_NOT_NULL(v8_file_logger_);
@@ -1211,7 +1231,9 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
                                sizeof(IsolateData));
   }
 
-  Object root(RootIndex index) const { return Object(roots_table()[index]); }
+  Tagged<Object> root(RootIndex index) const {
+    return Object(roots_table()[index]);
+  }
 
   Handle<Object> root_handle(RootIndex index) {
     return Handle<Object>(&roots_table()[index]);
@@ -1222,6 +1244,11 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     return isolate_data()->external_reference_table();
   }
 
+  ExternalReferenceTable* external_reference_table_unsafe() {
+    // The table may only be partially initialized at this point.
+    return isolate_data()->external_reference_table();
+  }
+
   Address* builtin_entry_table() { return isolate_data_.builtin_entry_table(); }
   V8_INLINE Address* builtin_table() { return isolate_data_.builtin_table(); }
   V8_INLINE Address* builtin_tier0_table() {
@@ -1262,12 +1289,16 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     // flag in ThreadLocalTop in thread_in_wasm_flag_address_. This function
     // here returns the offset of that member from {isolate_root()}.
     return static_cast<uint32_t>(
-        OFFSET_OF(Isolate, thread_local_top()->thread_in_wasm_flag_address_) -
+        OFFSET_OF(Isolate, isolate_data_) +
+        OFFSET_OF(IsolateData, thread_local_top_) +
+        OFFSET_OF(ThreadLocalTop, thread_in_wasm_flag_address_) -
         isolate_root_bias());
   }
 
   THREAD_LOCAL_TOP_ADDRESS(Address, thread_in_wasm_flag_address)
 
+  THREAD_LOCAL_TOP_ADDRESS(bool, is_on_central_stack_flag)
+
   MaterializedObjectStore* materialized_object_store() const {
     return materialized_object_store_;
   }
@@ -1276,7 +1307,9 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     return descriptor_lookup_cache_;
   }
 
-  V8_INLINE HandleScopeData* handle_scope_data() { return &handle_scope_data_; }
+  V8_INLINE HandleScopeData* handle_scope_data() {
+    return &isolate_data_.handle_scope_data_;
+  }
 
   HandleScopeImplementer* handle_scope_implementer() const {
     DCHECK(handle_scope_implementer_);
@@ -1330,17 +1363,37 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   Debug* debug() const { return debug_; }
 
   bool is_profiling() const {
-    return isolate_data_.is_profiling_.load(std::memory_order_relaxed);
+    return isolate_data_.execution_mode_ &
+           IsolateExecutionModeFlag::kIsProfiling;
   }
 
   void SetIsProfiling(bool enabled) {
     if (enabled) {
       CollectSourcePositionsForAllBytecodeArrays();
+      RequestInvalidateNoProfilingProtector();
     }
-    isolate_data_.is_profiling_.store(enabled, std::memory_order_relaxed);
+    isolate_data_.execution_mode_.set(IsolateExecutionModeFlag::kIsProfiling,
+                                      enabled);
     UpdateLogObjectRelocation();
   }
 
+  // Perform side effect checks on function calls and API callbacks.
+  // See Debug::StartSideEffectCheckMode().
+  bool should_check_side_effects() const {
+    return isolate_data_.execution_mode_ &
+           IsolateExecutionModeFlag::kCheckSideEffects;
+  }
+
+  DebugInfo::ExecutionMode debug_execution_mode() const {
+    return should_check_side_effects() ? DebugInfo::kSideEffects
+                                       : DebugInfo::kBreakpoints;
+  }
+  void set_debug_execution_mode(DebugInfo::ExecutionMode debug_execution_mode) {
+    bool check_side_effects = debug_execution_mode == DebugInfo::kSideEffects;
+    isolate_data_.execution_mode_.set(
+        IsolateExecutionModeFlag::kCheckSideEffects, check_side_effects);
+  }
+
   Logger* logger() const { return logger_; }
   HeapProfiler* heap_profiler() const { return heap_profiler_; }
 
@@ -1398,7 +1451,11 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   bool initialized_from_snapshot() { return initialized_from_snapshot_; }
 
-  bool NeedsSourcePositionsForProfiling() const;
+  bool NeedsSourcePositions() const;
+
+  bool IsLoggingCodeCreation() const;
+
+  bool AllowsCodeCompaction() const;
 
   bool NeedsDetailedOptimizedCodeLineInfo() const;
 
@@ -1439,7 +1496,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   // needed anymore. This keeps many feedback vectors alive, but code
   // coverage or type profile are used for debugging only and increase in
   // memory usage is expected.
-  void SetFeedbackVectorsForProfilingTools(Object value);
+  void SetFeedbackVectorsForProfilingTools(Tagged<Object> value);
 
   void MaybeInitializeVectorListFromHeap();
 
@@ -1479,7 +1536,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   enum class KnownPrototype { kNone, kObject, kArray, kString };
 
-  KnownPrototype IsArrayOrObjectOrStringPrototype(Object object);
+  KnownPrototype IsArrayOrObjectOrStringPrototype(Tagged<Object> object);
 
   // On intent to set an element in object, make sure that appropriate
   // notifications occur if the set is on the elements of the array or
@@ -1494,14 +1551,14 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   }
   void UpdateTypedArraySpeciesLookupChainProtectorOnSetPrototype(
       Handle<JSObject> object);
-  void UpdateNumberStringPrototypeNoReplaceProtectorOnSetPrototype(
+  void UpdateNumberStringNotRegexpLikeProtectorOnSetPrototype(
       Handle<JSObject> object);
   void UpdateNoElementsProtectorOnNormalizeElements(Handle<JSObject> object) {
     UpdateNoElementsProtectorOnSetElement(object);
   }
 
   // Returns true if array is the initial array prototype in any native context.
-  inline bool IsAnyInitialArrayPrototype(JSArray array);
+  inline bool IsAnyInitialArrayPrototype(Tagged<JSArray> array);
 
   std::unique_ptr<PersistentHandles> NewPersistentHandles();
 
@@ -1550,6 +1607,9 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   }
 
   std::shared_ptr<CompilationStatistics> GetTurboStatistics();
+#ifdef V8_ENABLE_MAGLEV
+  std::shared_ptr<CompilationStatistics> GetMaglevStatistics();
+#endif
   CodeTracer* GetCodeTracer();
 
   void DumpAndResetStats();
@@ -1562,10 +1622,6 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   bool jitless() const { return jitless_; }
 
-  DebugInfo::ExecutionMode* debug_execution_mode_address() {
-    return &debug_execution_mode_;
-  }
-
   base::RandomNumberGenerator* random_number_generator();
 
   base::RandomNumberGenerator* fuzzer_rng();
@@ -1629,21 +1685,12 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   int GetNextScriptId();
 
-#if V8_SFI_HAS_UNIQUE_ID
-  int GetNextUniqueSharedFunctionInfoId() {
-    int current_id = next_unique_sfi_id_.load(std::memory_order_relaxed);
-    int next_id;
-    do {
-      if (current_id >= Smi::kMaxValue) {
-        next_id = 0;
-      } else {
-        next_id = current_id + 1;
-      }
-    } while (!next_unique_sfi_id_.compare_exchange_weak(
-        current_id, next_id, std::memory_order_relaxed));
-    return current_id;
+  uint32_t next_unique_sfi_id() const {
+    return next_unique_sfi_id_.load(std::memory_order_relaxed);
+  }
+  uint32_t GetAndIncNextUniqueSfiId() {
+    return next_unique_sfi_id_.fetch_add(1, std::memory_order_relaxed);
   }
-#endif
 
 #ifdef V8_ENABLE_JAVASCRIPT_PROMISE_HOOKS
   void SetHasContextPromiseHooks(bool context_promise_hook) {
@@ -1797,7 +1844,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     return lazy_compile_dispatcher_.get();
   }
 
-  bool IsInAnyContext(Object object, uint32_t index);
+  bool IsInAnyContext(Tagged<Object> object, uint32_t index);
 
   void ClearKeptObjects();
 
@@ -1842,7 +1889,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 #endif  // V8_OS_WIN64
 
   void SetPrepareStackTraceCallback(PrepareStackTraceCallback callback);
-  MaybeHandle<Object> RunPrepareStackTraceCallback(Handle<Context>,
+  MaybeHandle<Object> RunPrepareStackTraceCallback(Handle<NativeContext>,
                                                    Handle<JSObject> Error,
                                                    Handle<JSArray> sites);
   bool HasPrepareStackTraceCallback() const;
@@ -1854,6 +1901,12 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     }
   }
 
+#if defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+  // Specifies the callback called when an ETW tracing session starts.
+  void SetFilterETWSessionByURLCallback(FilterETWSessionByURLCallback callback);
+  bool RunFilterETWSessionByURLCallback(const std::string& payload);
+#endif  // V8_OS_WIN && V8_ENABLE_ETW_STACK_WALKING
+
   void SetRAILMode(RAILMode rail_mode);
 
   RAILMode rail_mode() { return rail_mode_.load(); }
@@ -1875,12 +1928,6 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   bool IsIsolateInBackground() { return is_isolate_in_background_; }
 
-  void EnableMemorySavingsMode() { memory_savings_mode_active_ = true; }
-
-  void DisableMemorySavingsMode() { memory_savings_mode_active_ = false; }
-
-  bool IsMemorySavingsModeActive() { return memory_savings_mode_active_; }
-
   PRINTF_FORMAT(2, 3) void PrintWithTimestamp(const char* format, ...);
 
   void set_allow_atomics_wait(bool set) { allow_atomics_wait_ = set; }
@@ -1939,6 +1986,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   Isolate* AsIsolate() { return this; }
   LocalIsolate* AsLocalIsolate() { return main_thread_local_isolate(); }
+  Isolate* GetMainThreadIsolateUnsafe() { return this; }
 
   LocalHeap* main_thread_local_heap();
   LocalHeap* CurrentLocalHeap();
@@ -1964,6 +2012,10 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
     return *isolate_data_.shared_external_pointer_table_;
   }
 
+  ExternalPointerTable::Space* shared_external_pointer_space() {
+    return shared_external_pointer_space_;
+  }
+
   Address shared_external_pointer_table_address_address() {
     return reinterpret_cast<Address>(
         &isolate_data_.shared_external_pointer_table_);
@@ -2020,6 +2072,8 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   // Update the thread local's Stack object so that it is aware of the new stack
   // start and the inactive stacks.
   void RecordStackSwitchForScanning();
+
+  void SyncStackLimit();
 #endif
 
   // Access to the global "locals block list cache". Caches outer-stack
@@ -2030,10 +2084,33 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
                                Handle<ScopeInfo> outer_scope_info,
                                Handle<StringSet> locals_blocklist);
   // Returns either `TheHole` or `StringSet`.
-  Object LocalsBlockListCacheGet(Handle<ScopeInfo> scope_info);
+  Tagged<Object> LocalsBlockListCacheGet(Handle<ScopeInfo> scope_info);
 
   void VerifyStaticRoots();
 
+  bool allow_compile_hints_magic() const { return allow_compile_hints_magic_; }
+
+  class EnableRoAllocationForSnapshotScope final {
+   public:
+    explicit EnableRoAllocationForSnapshotScope(Isolate* isolate)
+        : isolate_(isolate) {
+      CHECK(!isolate_->enable_ro_allocation_for_snapshot_);
+      isolate_->enable_ro_allocation_for_snapshot_ = true;
+    }
+
+    ~EnableRoAllocationForSnapshotScope() {
+      CHECK(isolate_->enable_ro_allocation_for_snapshot_);
+      isolate_->enable_ro_allocation_for_snapshot_ = false;
+    }
+
+   private:
+    Isolate* const isolate_;
+  };
+
+  bool enable_ro_allocation_for_snapshot() const {
+    return enable_ro_allocation_for_snapshot_;
+  }
+
  private:
   explicit Isolate(std::unique_ptr<IsolateAllocator> isolate_allocator);
   ~Isolate();
@@ -2137,7 +2214,8 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   void AddCrashKeysForIsolateAndHeapPointers();
 
   // Returns the Exception sentinel.
-  Object ThrowInternal(Object exception, MessageLocation* location);
+  Tagged<Object> ThrowInternal(Tagged<Object> exception,
+                               MessageLocation* location);
 
   // This class contains a collection of data accessible from both C++ runtime
   // and compiled code (including assembly stubs, builtins, interpreter bytecode
@@ -2182,7 +2260,6 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   StackTrace::StackTraceOptions stack_trace_for_uncaught_exceptions_options_ =
       StackTrace::kOverview;
   DescriptorLookupCache* descriptor_lookup_cache_ = nullptr;
-  HandleScopeData handle_scope_data_;
   HandleScopeImplementer* handle_scope_implementer_ = nullptr;
   UnicodeCache* unicode_cache_ = nullptr;
   AccountingAllocator* allocator_ = nullptr;
@@ -2269,11 +2346,7 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   // True if the isolate is in background. This flag is used
   // to prioritize between memory usage and latency.
-  bool is_isolate_in_background_ = false;
-
-  // True if the isolate is in memory savings mode. This flag is used to
-  // favor memory over runtime performance.
-  bool memory_savings_mode_active_ = false;
+  std::atomic<bool> is_isolate_in_background_ = false;
 
   // Indicates whether the isolate owns shareable data.
   // Only false for client isolates attached to a shared isolate.
@@ -2350,14 +2423,21 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   bool force_slow_path_ = false;
 
+  // Certain objects may be allocated in RO space if suitable for the snapshot.
+  bool enable_ro_allocation_for_snapshot_ = false;
+
   bool initialized_ = false;
   bool jitless_ = false;
 
-  int next_optimization_id_ = 0;
+  std::atomic<int> next_optimization_id_ = 0;
 
-#if V8_SFI_HAS_UNIQUE_ID
-  std::atomic<int> next_unique_sfi_id_;
-#endif
+  void InitializeNextUniqueSfiId(uint32_t id) {
+    uint32_t expected = 0;  // Called at most once per Isolate on startup.
+    bool successfully_exchanged = next_unique_sfi_id_.compare_exchange_strong(
+        expected, id, std::memory_order_relaxed, std::memory_order_relaxed);
+    CHECK(successfully_exchanged);
+  }
+  std::atomic<uint32_t> next_unique_sfi_id_;
 
   unsigned next_module_async_evaluating_ordinal_;
 
@@ -2370,6 +2450,9 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   v8::Isolate::UseCounterCallback use_counter_callback_ = nullptr;
 
   std::shared_ptr<CompilationStatistics> turbo_statistics_;
+#ifdef V8_ENABLE_MAGLEV
+  std::shared_ptr<CompilationStatistics> maglev_statistics_;
+#endif
   std::shared_ptr<metrics::Recorder> metrics_recorder_;
   uintptr_t last_recorder_context_id_ = 0;
   std::unordered_map<uintptr_t, v8::Global<v8::Context>>
@@ -2424,6 +2507,10 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   bool allow_atomics_wait_ = true;
 
+  // Cache for the JavaScriptCompileHintsMagic origin trial.
+  // TODO(v8:13917): Remove when the origin trial is removed.
+  bool allow_compile_hints_magic_ = false;
+
   base::Mutex managed_ptr_destructors_mutex_;
   ManagedPtrDestructor* managed_ptr_destructors_head_ = nullptr;
 
@@ -2441,6 +2528,10 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
 
   PrepareStackTraceCallback prepare_stack_trace_callback_ = nullptr;
 
+#if defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+  FilterETWSessionByURLCallback filter_etw_session_by_url_callback_ = nullptr;
+#endif  // V8_OS_WIN && V8_ENABLE_ETW_STACK_WALKING
+
   // TODO(kenton@cloudflare.com): This mutex can be removed if
   // thread_data_table_ is always accessed under the isolate lock. I do not
   // know if this is the case, so I'm preserving it for now.
@@ -2451,6 +2542,10 @@ class V8_EXPORT_PRIVATE Isolate final : private HiddenFactory {
   base::Optional<Isolate*> shared_space_isolate_;
 
 #ifdef V8_COMPRESS_POINTERS
+  // Stores the external pointer table space for the shared external pointer
+  // table.
+  ExternalPointerTable::Space* shared_external_pointer_space_ = nullptr;
+
   // The external pointer handle to the Isolate's main thread's WaiterQueueNode.
   // It is used to wait for JS-exposed mutex or condition variable.
   ExternalPointerHandle waiter_queue_node_external_pointer_handle_ =
@@ -2529,7 +2624,7 @@ class V8_EXPORT_PRIVATE SaveContext {
 // constructor.
 class V8_EXPORT_PRIVATE SaveAndSwitchContext : public SaveContext {
  public:
-  SaveAndSwitchContext(Isolate* isolate, Context new_context);
+  SaveAndSwitchContext(Isolate* isolate, Tagged<Context> new_context);
 };
 
 // A scope which sets the given isolate's context to null for its lifetime to
@@ -2588,6 +2683,12 @@ class StackLimitCheck {
   // Use this to check for stack-overflow when entering runtime from JS code.
   bool JsHasOverflowed(uintptr_t gap = 0) const;
 
+  // Use this to check for stack-overflow when entering runtime from Wasm code.
+  // If it is called from the central stack, while a switch was performed,
+  // it checks logical stack limit of a secondary stack stored in the isolate,
+  // instead checking actual one.
+  bool WasmHasOverflowed(uintptr_t gap = 0) const;
+
   // Use this to check for interrupt request in C++ code.
   V8_INLINE bool InterruptRequested() {
     StackGuard* stack_guard = isolate_->stack_guard();
diff --git a/deps/v8/src/execution/local-isolate-inl.h b/deps/v8/src/execution/local-isolate-inl.h
index 80baf1ab0eea08..c23aa483d0def3 100644
--- a/deps/v8/src/execution/local-isolate-inl.h
+++ b/deps/v8/src/execution/local-isolate-inl.h
@@ -22,7 +22,7 @@ ReadOnlyHeap* LocalIsolate::read_only_heap() const {
   return isolate_->read_only_heap();
 }
 
-Object LocalIsolate::root(RootIndex index) const {
+Tagged<Object> LocalIsolate::root(RootIndex index) const {
   DCHECK(RootsTable::IsImmortalImmovable(index));
   return isolate_->root(index);
 }
@@ -32,6 +32,11 @@ Handle<Object> LocalIsolate::root_handle(RootIndex index) const {
   return isolate_->root_handle(index);
 }
 
+template <typename Callback>
+V8_INLINE void LocalIsolate::BlockMainThreadWhileParked(Callback callback) {
+  heap_.BlockMainThreadWhileParked(callback);
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/execution/local-isolate.cc b/deps/v8/src/execution/local-isolate.cc
index ff3cfc99eff732..596541b6dd1a90 100644
--- a/deps/v8/src/execution/local-isolate.cc
+++ b/deps/v8/src/execution/local-isolate.cc
@@ -54,12 +54,6 @@ bool LocalIsolate::has_active_deserializer() const {
 
 int LocalIsolate::GetNextScriptId() { return isolate_->GetNextScriptId(); }
 
-#if V8_SFI_HAS_UNIQUE_ID
-int LocalIsolate::GetNextUniqueSharedFunctionInfoId() {
-  return isolate_->GetNextUniqueSharedFunctionInfoId();
-}
-#endif  // V8_SFI_HAS_UNIQUE_ID
-
 // Used for lazy initialization, based on an assumption that most
 // LocalIsolates won't be used to parse any BigInt literals.
 void LocalIsolate::InitializeBigIntProcessor() {
diff --git a/deps/v8/src/execution/local-isolate.h b/deps/v8/src/execution/local-isolate.h
index 2cddb1567e06bb..b9cdec9e7039db 100644
--- a/deps/v8/src/execution/local-isolate.h
+++ b/deps/v8/src/execution/local-isolate.h
@@ -53,16 +53,21 @@ class V8_EXPORT_PRIVATE LocalIsolate final : private HiddenLocalFactory {
                                            OFFSET_OF(LocalIsolate, heap_));
   }
 
-  bool is_main_thread() { return heap()->is_main_thread(); }
+  bool is_main_thread() const { return heap()->is_main_thread(); }
 
   LocalHeap* heap() { return &heap_; }
+  const LocalHeap* heap() const { return &heap_; }
 
   inline Address cage_base() const;
   inline Address code_cage_base() const;
   inline ReadOnlyHeap* read_only_heap() const;
-  inline Object root(RootIndex index) const;
+  inline Tagged<Object> root(RootIndex index) const;
   inline Handle<Object> root_handle(RootIndex index) const;
 
+  base::RandomNumberGenerator* fuzzer_rng() const {
+    return isolate_->fuzzer_rng();
+  }
+
   StringTable* string_table() const { return isolate_->string_table(); }
   base::SharedMutex* internalized_string_access() {
     return isolate_->internalized_string_access();
@@ -95,6 +100,7 @@ class V8_EXPORT_PRIVATE LocalIsolate final : private HiddenLocalFactory {
   AccountingAllocator* allocator() { return isolate_->allocator(); }
 
   bool has_pending_exception() const { return false; }
+  bool serializer_enabled() const { return isolate_->serializer_enabled(); }
 
   void RegisterDeserializerStarted();
   void RegisterDeserializerFinished();
@@ -109,9 +115,9 @@ class V8_EXPORT_PRIVATE LocalIsolate final : private HiddenLocalFactory {
   }
 
   int GetNextScriptId();
-#if V8_SFI_HAS_UNIQUE_ID
-  int GetNextUniqueSharedFunctionInfoId();
-#endif  // V8_SFI_HAS_UNIQUE_ID
+  uint32_t GetAndIncNextUniqueSfiId() {
+    return isolate_->GetAndIncNextUniqueSfiId();
+  }
 
   // TODO(cbruni): rename this back to logger() once the V8FileLogger
   // refactoring is completed.
@@ -128,8 +134,6 @@ class V8_EXPORT_PRIVATE LocalIsolate final : private HiddenLocalFactory {
     return bigint_processor_;
   }
 
-  bool is_main_thread() const { return heap_.is_main_thread(); }
-
   // AsIsolate is only allowed on the main-thread.
   Isolate* AsIsolate() {
     DCHECK(is_main_thread());
@@ -142,10 +146,18 @@ class V8_EXPORT_PRIVATE LocalIsolate final : private HiddenLocalFactory {
   // only constructor.
   Isolate* GetMainThreadIsolateUnsafe() const { return isolate_; }
 
+  const v8::StartupData* snapshot_blob() const {
+    return isolate_->snapshot_blob();
+  }
   Object* pending_message_address() {
     return isolate_->pending_message_address();
   }
 
+  int NextOptimizationId() { return isolate_->NextOptimizationId(); }
+
+  template <typename Callback>
+  V8_INLINE void BlockMainThreadWhileParked(Callback callback);
+
 #ifdef V8_INTL_SUPPORT
   // WARNING: This might be out-of-sync with the main-thread.
   const std::string& DefaultLocale();
diff --git a/deps/v8/src/execution/loong64/simulator-loong64.cc b/deps/v8/src/execution/loong64/simulator-loong64.cc
index 7c1e4b1d8fc380..2b414558551e98 100644
--- a/deps/v8/src/execution/loong64/simulator-loong64.cc
+++ b/deps/v8/src/execution/loong64/simulator-loong64.cc
@@ -317,7 +317,8 @@ void Loong64Debugger::Debug() {
       disasm::Disassembler dasm(converter);
       // Use a reasonably large buffer.
       v8::base::EmbeddedVector<char, 256> buffer;
-      dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(sim_->get_pc()));
+      dasm.InstructionDecode(buffer,
+                             reinterpret_cast<uint8_t*>(sim_->get_pc()));
       PrintF("  0x%016" PRIx64 "   %s\n", sim_->get_pc(), buffer.begin());
       last_pc = sim_->get_pc();
     }
@@ -408,10 +409,10 @@ void Loong64Debugger::Debug() {
           int64_t value;
           StdoutStream os;
           if (GetValue(arg1, &value)) {
-            Object obj(value);
+            Tagged<Object> obj(value);
             os << arg1 << ": \n";
 #ifdef DEBUG
-            obj.Print(os);
+            Print(obj, os);
             os << "\n";
 #else
             os << Brief(obj) << "\n";
@@ -454,16 +455,16 @@ void Loong64Debugger::Debug() {
         while (cur < end) {
           PrintF("  0x%012" PRIxPTR " :  0x%016" PRIx64 "  %14" PRId64 " ",
                  reinterpret_cast<intptr_t>(cur), *cur, *cur);
-          Object obj(*cur);
+          Tagged<Object> obj(*cur);
           Heap* current_heap = sim_->isolate_->heap();
           if (!skip_obj_print) {
-            if (obj.IsSmi() ||
+            if (IsSmi(obj) ||
                 IsValidHeapObject(current_heap, HeapObject::cast(obj))) {
               PrintF(" (");
-              if (obj.IsSmi()) {
+              if (IsSmi(obj)) {
                 PrintF("smi %d", Smi::ToInt(obj));
               } else {
-                obj.ShortPrint();
+                ShortPrint(obj);
               }
               PrintF(")");
             }
@@ -479,11 +480,11 @@ void Loong64Debugger::Debug() {
         // Use a reasonably large buffer.
         v8::base::EmbeddedVector<char, 256> buffer;
 
-        byte* cur = nullptr;
-        byte* end = nullptr;
+        uint8_t* cur = nullptr;
+        uint8_t* end = nullptr;
 
         if (argc == 1) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
           end = cur + (10 * kInstrSize);
         } else if (argc == 2) {
           int regnum = Registers::Number(arg1);
@@ -491,7 +492,7 @@ void Loong64Debugger::Debug() {
             // The argument is an address or a register name.
             int64_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(value);
+              cur = reinterpret_cast<uint8_t*>(value);
               // Disassemble 10 instructions at <arg1>.
               end = cur + (10 * kInstrSize);
             }
@@ -499,7 +500,7 @@ void Loong64Debugger::Debug() {
             // The argument is the number of instructions.
             int64_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(sim_->get_pc());
+              cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
               // Disassemble <arg1> instructions.
               end = cur + (value * kInstrSize);
             }
@@ -508,7 +509,7 @@ void Loong64Debugger::Debug() {
           int64_t value1;
           int64_t value2;
           if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-            cur = reinterpret_cast<byte*>(value1);
+            cur = reinterpret_cast<uint8_t*>(value1);
             end = cur + (value2 * kInstrSize);
           }
         }
@@ -608,16 +609,16 @@ void Loong64Debugger::Debug() {
         // Use a reasonably large buffer.
         v8::base::EmbeddedVector<char, 256> buffer;
 
-        byte* cur = nullptr;
-        byte* end = nullptr;
+        uint8_t* cur = nullptr;
+        uint8_t* end = nullptr;
 
         if (argc == 1) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
           end = cur + (10 * kInstrSize);
         } else if (argc == 2) {
           int64_t value;
           if (GetValue(arg1, &value)) {
-            cur = reinterpret_cast<byte*>(value);
+            cur = reinterpret_cast<uint8_t*>(value);
             // no length parameter passed, assume 10 instructions
             end = cur + (10 * kInstrSize);
           }
@@ -625,7 +626,7 @@ void Loong64Debugger::Debug() {
           int64_t value1;
           int64_t value2;
           if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-            cur = reinterpret_cast<byte*>(value1);
+            cur = reinterpret_cast<uint8_t*>(value1);
             end = cur + (value2 * kInstrSize);
           }
         }
@@ -798,8 +799,9 @@ void Simulator::CheckICache(base::CustomMatcherHashMap* i_cache,
 Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   // Set up simulator support first. Some of this information is needed to
   // setup the architecture state.
-  stack_size_ = v8_flags.sim_stack_size * KB;
-  stack_ = reinterpret_cast<char*>(base::Malloc(stack_size_));
+  size_t stack_size = AllocatedStackSize();
+  stack_ = reinterpret_cast<uintptr_t>(new uint8_t[stack_size]);
+  stack_limit_ = stack_ + kStackProtectionSize;
   pc_modified_ = false;
   icount_ = 0;
   break_count_ = 0;
@@ -823,7 +825,7 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   // The sp is initialized to point to the bottom (high address) of the
   // allocated stack area. To be safe in potential stack underflows we leave
   // some buffer below.
-  registers_[sp] = reinterpret_cast<int64_t>(stack_) + stack_size_ - 64;
+  registers_[sp] = stack_ + stack_size - kStackProtectionSize;
   // The ra and pc are initialized to a known bad value that will cause an
   // access violation if the simulator ever tries to execute it.
   registers_[pc] = bad_ra;
@@ -834,7 +836,7 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
 
 Simulator::~Simulator() {
   GlobalMonitor::Get()->RemoveLinkedAddress(&global_monitor_thread_);
-  base::Free(stack_);
+  delete[] reinterpret_cast<uint8_t*>(stack_);
 }
 
 // Get the active Simulator for the current thread.
@@ -1990,12 +1992,20 @@ uintptr_t Simulator::StackLimit(uintptr_t c_limit) const {
   // The simulator uses a separate JS stack. If we have exhausted the C stack,
   // we also drop down the JS limit to reflect the exhaustion on the JS stack.
   if (base::Stack::GetCurrentStackPosition() < c_limit) {
-    return reinterpret_cast<uintptr_t>(get_sp());
+    return get_sp();
   }
 
-  // Otherwise the limit is the JS stack. Leave a safety margin of 1024 bytes
+  // Otherwise the limit is the JS stack. Leave a safety margin
   // to prevent overrunning the stack when pushing values.
-  return reinterpret_cast<uintptr_t>(stack_) + 1024;
+  return stack_limit_ + kAdditionalStackMargin;
+}
+
+base::Vector<uint8_t> Simulator::GetCurrentStackView() const {
+  // We do not add an additional safety margin as above in
+  // Simulator::StackLimit, as users of this method are expected to add their
+  // own margin.
+  return base::VectorOf(reinterpret_cast<uint8_t*>(stack_limit_),
+                        UsableStackSize());
 }
 
 // Unsupported instructions use Format to print an error and stop execution.
@@ -2023,16 +2033,17 @@ using SimulatorRuntimeCompareCall = int64_t (*)(double darg0, double darg1);
 using SimulatorRuntimeFPFPCall = double (*)(double darg0, double darg1);
 using SimulatorRuntimeFPCall = double (*)(double darg0);
 using SimulatorRuntimeFPIntCall = double (*)(double darg0, int32_t arg0);
+// Define four args for future flexibility; at the time of this writing only
+// one is ever used.
+using SimulatorRuntimeFPTaggedCall = double (*)(int64_t arg0, int64_t arg1,
+                                                int64_t arg2, int64_t arg3);
 
 // This signature supports direct call in to API function native callback
 // (refer to InvocationCallback in v8.h).
 using SimulatorRuntimeDirectApiCall = void (*)(int64_t arg0);
-using SimulatorRuntimeProfilingApiCall = void (*)(int64_t arg0, void* arg1);
 
 // This signature supports direct call to accessor getter callback.
 using SimulatorRuntimeDirectGetterCall = void (*)(int64_t arg0, int64_t arg1);
-using SimulatorRuntimeProfilingGetterCall = void (*)(int64_t arg0, int64_t arg1,
-                                                     void* arg2);
 
 using MixedRuntimeCall_0 = AnyCType (*)();
 
@@ -2327,6 +2338,19 @@ void Simulator::SoftwareInterrupt() {
             UNREACHABLE();
         }
       }
+    } else if (redirection->type() ==
+               ExternalReference::BUILTIN_FP_POINTER_CALL) {
+      if (v8_flags.trace_sim) {
+        PrintF("Call to host function at %p args %08" PRIx64 " \n",
+               reinterpret_cast<void*>(external), arg0);
+      }
+      SimulatorRuntimeFPTaggedCall target =
+          reinterpret_cast<SimulatorRuntimeFPTaggedCall>(external);
+      double dresult = target(arg0, arg1, arg2, arg3);
+      SetFpResult(dresult);
+      if (v8_flags.trace_sim) {
+        PrintF("Returned %f\n", dresult);
+      }
     } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
       if (v8_flags.trace_sim) {
         PrintF("Call to host function at %p args %08" PRIx64 " \n",
@@ -2335,15 +2359,6 @@ void Simulator::SoftwareInterrupt() {
       SimulatorRuntimeDirectApiCall target =
           reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
       target(arg0);
-    } else if (redirection->type() == ExternalReference::PROFILING_API_CALL) {
-      if (v8_flags.trace_sim) {
-        PrintF("Call to host function at %p args %08" PRIx64 "  %08" PRIx64
-               " \n",
-               reinterpret_cast<void*>(external), arg0, arg1);
-      }
-      SimulatorRuntimeProfilingApiCall target =
-          reinterpret_cast<SimulatorRuntimeProfilingApiCall>(external);
-      target(arg0, Redirection::UnwrapRedirection(arg1));
     } else if (redirection->type() == ExternalReference::DIRECT_GETTER_CALL) {
       if (v8_flags.trace_sim) {
         PrintF("Call to host function at %p args %08" PRIx64 "  %08" PRIx64
@@ -2353,16 +2368,6 @@ void Simulator::SoftwareInterrupt() {
       SimulatorRuntimeDirectGetterCall target =
           reinterpret_cast<SimulatorRuntimeDirectGetterCall>(external);
       target(arg0, arg1);
-    } else if (redirection->type() ==
-               ExternalReference::PROFILING_GETTER_CALL) {
-      if (v8_flags.trace_sim) {
-        PrintF("Call to host function at %p args %08" PRIx64 "  %08" PRIx64
-               "  %08" PRIx64 " \n",
-               reinterpret_cast<void*>(external), arg0, arg1, arg2);
-      }
-      SimulatorRuntimeProfilingGetterCall target =
-          reinterpret_cast<SimulatorRuntimeProfilingGetterCall>(external);
-      target(arg0, arg1, Redirection::UnwrapRedirection(arg2));
     } else {
       DCHECK(redirection->type() == ExternalReference::BUILTIN_CALL ||
              redirection->type() == ExternalReference::BUILTIN_CALL_PAIR);
@@ -5282,7 +5287,7 @@ void Simulator::InstructionDecode(Instruction* instr) {
     disasm::NameConverter converter;
     disasm::Disassembler dasm(converter);
     // Use a reasonably large buffer.
-    dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(instr));
+    dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(instr));
   }
 
   static int instr_count = 0;
diff --git a/deps/v8/src/execution/loong64/simulator-loong64.h b/deps/v8/src/execution/loong64/simulator-loong64.h
index 70e53d97d20da8..c26a7922e71836 100644
--- a/deps/v8/src/execution/loong64/simulator-loong64.h
+++ b/deps/v8/src/execution/loong64/simulator-loong64.h
@@ -266,9 +266,14 @@ class Simulator : public SimulatorBase {
 
   Address get_sp() const { return static_cast<Address>(get_register(sp)); }
 
-  // Accessor to the internal simulator stack area.
+  // Accessor to the internal simulator stack area. Adds a safety
+  // margin to prevent overflows (kAdditionalStackMargin).
   uintptr_t StackLimit(uintptr_t c_limit) const;
 
+  // Return current stack view, without additional safety margins.
+  // Users, for example wasm::StackMemory, can add their own.
+  base::Vector<uint8_t> GetCurrentStackView() const;
+
   // Executes LOONG64 instructions until the PC reaches end_sim_pc.
   void Execute();
 
@@ -584,9 +589,17 @@ class Simulator : public SimulatorBase {
   uint32_t FCSR_;
 
   // Simulator support.
-  // Allocate 1MB for stack.
-  size_t stack_size_;
-  char* stack_;
+  uintptr_t stack_;
+  static const size_t kStackProtectionSize = KB;
+  // This includes a protection margin at each end of the stack area.
+  static size_t AllocatedStackSize() {
+    return (v8_flags.sim_stack_size * KB) + (2 * kStackProtectionSize);
+  }
+  static size_t UsableStackSize() { return v8_flags.sim_stack_size * KB; }
+  uintptr_t stack_limit_;
+  // Added in Simulator::StackLimit()
+  static const int kAdditionalStackMargin = 4 * KB;
+
   bool pc_modified_;
   int64_t icount_;
   int break_count_;
diff --git a/deps/v8/src/execution/messages.cc b/deps/v8/src/execution/messages.cc
index bceca2180fd9ab..c599e83b00ffe3 100644
--- a/deps/v8/src/execution/messages.cc
+++ b/deps/v8/src/execution/messages.cc
@@ -18,6 +18,7 @@
 #include "src/objects/call-site-info-inl.h"
 #include "src/objects/foreign-inl.h"
 #include "src/objects/js-array-inl.h"
+#include "src/objects/property-descriptor.h"
 #include "src/objects/struct-inl.h"
 #include "src/parsing/parse-info.h"
 #include "src/parsing/parsing.h"
@@ -66,7 +67,7 @@ void MessageHandler::DefaultMessageReport(Isolate* isolate,
     HandleScope scope(isolate);
     Handle<Object> data(loc->script()->name(), isolate);
     std::unique_ptr<char[]> data_str;
-    if (data->IsString())
+    if (IsString(*data))
       data_str = Handle<String>::cast(data)->ToCString(DISALLOW_NULLS);
     PrintF("%s:%i: %s\n", data_str.get() ? data_str.get() : "<unknown>",
            loc->start_pos(), str.get());
@@ -116,7 +117,7 @@ void MessageHandler::ReportMessage(Isolate* isolate, const MessageLocation* loc,
   // and ignore scheduled exceptions callbacks can throw.
 
   // We pass the exception object into the message handler callback though.
-  Object exception_object = ReadOnlyRoots(isolate).undefined_value();
+  Tagged<Object> exception_object = ReadOnlyRoots(isolate).undefined_value();
   if (isolate->has_pending_exception()) {
     exception_object = isolate->pending_exception();
   }
@@ -127,14 +128,14 @@ void MessageHandler::ReportMessage(Isolate* isolate, const MessageLocation* loc,
   isolate->set_external_caught_exception(false);
 
   // Turn the exception on the message into a string if it is an object.
-  if (message->argument().IsJSObject()) {
+  if (IsJSObject(message->argument())) {
     HandleScope scope(isolate);
     Handle<Object> argument(message->argument(), isolate);
 
     MaybeHandle<Object> maybe_stringified;
     Handle<Object> stringified;
     // Make sure we don't leak uncaught internally generated Error objects.
-    if (argument->IsJSError()) {
+    if (IsJSError(*argument)) {
       maybe_stringified = Object::NoSideEffectsToString(isolate, argument);
     } else {
       v8::TryCatch catcher(reinterpret_cast<v8::Isolate*>(isolate));
@@ -163,9 +164,8 @@ void MessageHandler::ReportMessageNoExceptions(
   v8::Local<v8::Message> api_message_obj = v8::Utils::MessageToLocal(message);
   int error_level = api_message_obj->ErrorLevel();
 
-  Handle<TemplateList> global_listeners =
-      isolate->factory()->message_listeners();
-  int global_length = global_listeners->length();
+  Handle<ArrayList> global_listeners = isolate->factory()->message_listeners();
+  int global_length = global_listeners->Length();
   if (global_length == 0) {
     DefaultMessageReport(isolate, loc, message);
     if (isolate->has_scheduled_exception()) {
@@ -174,22 +174,22 @@ void MessageHandler::ReportMessageNoExceptions(
   } else {
     for (int i = 0; i < global_length; i++) {
       HandleScope scope(isolate);
-      if (global_listeners->get(i).IsUndefined(isolate)) continue;
-      FixedArray listener = FixedArray::cast(global_listeners->get(i));
-      Foreign callback_obj = Foreign::cast(listener.get(0));
+      if (IsUndefined(global_listeners->Get(i), isolate)) continue;
+      Tagged<FixedArray> listener = FixedArray::cast(global_listeners->Get(i));
+      Tagged<Foreign> callback_obj = Foreign::cast(listener->get(0));
       int32_t message_levels =
-          static_cast<int32_t>(Smi::ToInt(listener.get(2)));
+          static_cast<int32_t>(Smi::ToInt(listener->get(2)));
       if (!(message_levels & error_level)) {
         continue;
       }
       v8::MessageCallback callback =
-          FUNCTION_CAST<v8::MessageCallback>(callback_obj.foreign_address());
-      Handle<Object> callback_data(listener.get(1), isolate);
+          FUNCTION_CAST<v8::MessageCallback>(callback_obj->foreign_address());
+      Handle<Object> callback_data(listener->get(1), isolate);
       {
         RCS_SCOPE(isolate, RuntimeCallCounterId::kMessageListenerCallback);
         // Do not allow exceptions to propagate.
         v8::TryCatch try_catch(reinterpret_cast<v8::Isolate*>(isolate));
-        callback(api_message_obj, callback_data->IsUndefined(isolate)
+        callback(api_message_obj, IsUndefined(*callback_data, isolate)
                                       ? api_exception_obj
                                       : v8::Utils::ToLocal(callback_data));
       }
@@ -299,16 +299,14 @@ MaybeHandle<Object> ErrorUtils::FormatStackTrace(Isolate* isolate,
   if (v8_flags.correctness_fuzzer_suppressions) {
     return isolate->factory()->empty_string();
   }
-  DCHECK(raw_stack->IsFixedArray());
+  DCHECK(IsFixedArray(*raw_stack));
   Handle<FixedArray> elems = Handle<FixedArray>::cast(raw_stack);
 
   const bool in_recursion = isolate->formatting_stack_trace();
   const bool has_overflowed = i::StackLimitCheck{isolate}.HasOverflowed();
-  Handle<Context> error_context;
+  Handle<NativeContext> error_context;
   if (!in_recursion && !has_overflowed &&
       error->GetCreationContext().ToHandle(&error_context)) {
-    DCHECK(error_context->IsNativeContext());
-
     if (isolate->HasPrepareStackTraceCallback()) {
       PrepareStackTraceScope scope(isolate);
 
@@ -335,7 +333,7 @@ MaybeHandle<Object> ErrorUtils::FormatStackTrace(Isolate* isolate,
           JSFunction::GetProperty(isolate, global_error, "prepareStackTrace"),
           Object);
 
-      if (prepare_stack_trace->IsJSFunction()) {
+      if (IsJSFunction(*prepare_stack_trace)) {
         PrepareStackTraceScope scope(isolate);
 
         isolate->CountUsage(v8::Isolate::kErrorPrepareStackTrace);
@@ -346,10 +344,10 @@ MaybeHandle<Object> ErrorUtils::FormatStackTrace(Isolate* isolate,
 
         const int argc = 2;
         base::ScopedVector<Handle<Object>> argv(argc);
-        if (V8_UNLIKELY(error->IsJSGlobalObject())) {
+        if (V8_UNLIKELY(IsJSGlobalObject(*error))) {
           // Pass global proxy instead of global object.
           argv[0] =
-              handle(JSGlobalObject::cast(*error).global_proxy(), isolate);
+              handle(JSGlobalObject::cast(*error)->global_proxy(), isolate);
         } else {
           argv[0] = error;
         }
@@ -499,7 +497,7 @@ MaybeHandle<JSObject> ErrorUtils::Construct(Isolate* isolate,
   // When we're passed a JSFunction as new target, we can skip frames until that
   // specific function is seen instead of unconditionally skipping the first
   // frame.
-  if (new_target->IsJSFunction()) {
+  if (IsJSFunction(*new_target)) {
     mode = SKIP_UNTIL_SEEN;
     caller = new_target;
   }
@@ -528,8 +526,8 @@ MaybeHandle<JSObject> ErrorUtils::Construct(
   // 1. If NewTarget is undefined, let newTarget be the active function object,
   // else let newTarget be NewTarget.
   Handle<JSReceiver> new_target_recv =
-      new_target->IsJSReceiver() ? Handle<JSReceiver>::cast(new_target)
-                                 : Handle<JSReceiver>::cast(target);
+      IsJSReceiver(*new_target) ? Handle<JSReceiver>::cast(new_target)
+                                : Handle<JSReceiver>::cast(target);
 
   // 2. Let O be ? OrdinaryCreateFromConstructor(newTarget, "%ErrorPrototype%",
   //    « [[ErrorData]] »).
@@ -545,7 +543,7 @@ MaybeHandle<JSObject> ErrorUtils::Construct(
   //     true, [[Enumerable]]: false, [[Configurable]]: true}.
   //  c. Perform ! DefinePropertyOrThrow(O, "message", msgDesc).
   // 4. Return O.
-  if (!message->IsUndefined(isolate)) {
+  if (!IsUndefined(*message, isolate)) {
     Handle<String> msg_string;
     ASSIGN_RETURN_ON_EXCEPTION(isolate, msg_string,
                                Object::ToString(isolate, message), JSObject);
@@ -556,12 +554,12 @@ MaybeHandle<JSObject> ErrorUtils::Construct(
         JSObject);
   }
 
-  if (!options->IsUndefined(isolate)) {
+  if (!IsUndefined(*options, isolate)) {
     // If Type(options) is Object and ? HasProperty(options, "cause") then
     //   a. Let cause be ? Get(options, "cause").
     //   b. Perform ! CreateNonEnumerableDataPropertyOrThrow(O, "cause", cause).
     Handle<Name> cause_string = isolate->factory()->cause_string();
-    if (options->IsJSReceiver()) {
+    if (IsJSReceiver(*options)) {
       Handle<JSReceiver> js_options = Handle<JSReceiver>::cast(options);
       Maybe<bool> has_cause =
           JSObject::HasProperty(isolate, js_options, cause_string);
@@ -605,7 +603,7 @@ MaybeHandle<String> GetStringPropertyOrDefault(Isolate* isolate,
                              JSObject::GetProperty(isolate, recv, key), String);
 
   Handle<String> str;
-  if (obj->IsUndefined(isolate)) {
+  if (IsUndefined(*obj, isolate)) {
     str = default_str;
   } else {
     ASSIGN_RETURN_ON_EXCEPTION(isolate, str, Object::ToString(isolate, obj),
@@ -622,7 +620,7 @@ MaybeHandle<String> ErrorUtils::ToString(Isolate* isolate,
                                          Handle<Object> receiver) {
   // 1. Let O be the this value.
   // 2. If Type(O) is not Object, throw a TypeError exception.
-  if (!receiver->IsJSReceiver()) {
+  if (!IsJSReceiver(*receiver)) {
     return isolate->Throw<String>(isolate->factory()->NewTypeError(
         MessageTemplate::kIncompatibleMethodReceiver,
         isolate->factory()->NewStringFromAsciiChecked(
@@ -712,7 +710,7 @@ Handle<JSObject> ErrorUtils::MakeGenericError(
 
   Handle<Object> no_caller;
   // The call below can't fail because constructor is a builtin.
-  DCHECK(constructor->shared().HasBuiltinId());
+  DCHECK(constructor->shared()->HasBuiltinId());
   return ErrorUtils::Construct(isolate, constructor, constructor, msg, options,
                                mode, no_caller, StackTraceCollection::kEnabled)
       .ToHandleChecked();
@@ -734,8 +732,8 @@ bool ComputeLocation(Isolate* isolate, MessageLocation* target) {
     SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, shared);
     int pos =
         summary.abstract_code()->SourcePosition(isolate, summary.code_offset());
-    if (script->IsScript() &&
-        !(Handle<Script>::cast(script)->source().IsUndefined(isolate))) {
+    if (IsScript(*script) &&
+        !(IsUndefined(Handle<Script>::cast(script)->source(), isolate))) {
       Handle<Script> casted_script = Handle<Script>::cast(script);
       *target = MessageLocation(casted_script, pos, pos + 1, shared);
       return true;
@@ -748,7 +746,7 @@ Handle<String> BuildDefaultCallSite(Isolate* isolate, Handle<Object> object) {
   IncrementalStringBuilder builder(isolate);
 
   builder.AppendString(Object::TypeOf(isolate, object));
-  if (object->IsString()) {
+  if (IsString(*object)) {
     builder.AppendCStringLiteral(" \"");
     Handle<String> string = Handle<String>::cast(object);
     // This threshold must be sufficiently far below String::kMaxLength that
@@ -763,13 +761,13 @@ Handle<String> BuildDefaultCallSite(Isolate* isolate, Handle<Object> object) {
       builder.AppendCStringLiteral("<...>");
     }
     builder.AppendCStringLiteral("\"");
-  } else if (object->IsNull(isolate)) {
+  } else if (IsNull(*object, isolate)) {
     builder.AppendCStringLiteral(" null");
-  } else if (object->IsTrue(isolate)) {
+  } else if (IsTrue(*object, isolate)) {
     builder.AppendCStringLiteral(" true");
-  } else if (object->IsFalse(isolate)) {
+  } else if (IsFalse(*object, isolate)) {
     builder.AppendCStringLiteral(" false");
-  } else if (object->IsNumber()) {
+  } else if (IsNumber(*object)) {
     builder.AppendCharacter(' ');
     builder.AppendString(isolate->factory()->NumberToString(object));
   }
@@ -837,8 +835,9 @@ Handle<JSObject> ErrorUtils::NewIteratorError(Isolate* isolate,
   return isolate->factory()->NewTypeError(id, callsite);
 }
 
-Object ErrorUtils::ThrowSpreadArgError(Isolate* isolate, MessageTemplate id,
-                                       Handle<Object> object) {
+Tagged<Object> ErrorUtils::ThrowSpreadArgError(Isolate* isolate,
+                                               MessageTemplate id,
+                                               Handle<Object> object) {
   MessageLocation location;
   Handle<String> callsite;
   if (ComputeLocation(isolate, &location)) {
@@ -892,17 +891,16 @@ Handle<JSObject> ErrorUtils::NewConstructedNonConstructable(
   return isolate->factory()->NewTypeError(id, callsite);
 }
 
-Object ErrorUtils::ThrowLoadFromNullOrUndefined(Isolate* isolate,
-                                                Handle<Object> object,
-                                                MaybeHandle<Object> key) {
-  DCHECK(object->IsNullOrUndefined());
+Tagged<Object> ErrorUtils::ThrowLoadFromNullOrUndefined(
+    Isolate* isolate, Handle<Object> object, MaybeHandle<Object> key) {
+  DCHECK(IsNullOrUndefined(*object));
 
   MaybeHandle<String> maybe_property_name;
 
   // Try to extract the property name from the given key, if any.
   Handle<Object> key_handle;
   if (key.ToHandle(&key_handle)) {
-    if (key_handle->IsString()) {
+    if (IsString(*key_handle)) {
       maybe_property_name = Handle<String>::cast(key_handle);
     } else {
       maybe_property_name =
@@ -1002,20 +1000,52 @@ Object ErrorUtils::ThrowLoadFromNullOrUndefined(Isolate* isolate,
   return ReadOnlyRoots(isolate).exception();
 }
 
+// static
+bool ErrorUtils::HasErrorStackSymbolOwnProperty(Isolate* isolate,
+                                                Handle<JSObject> object) {
+  // TODO(v8:5962): consider adding object->IsWasmExceptionPackage() here
+  // once it's guaranteed that WasmExceptionPackage has |error_stack_symbol|
+  // property.
+  Handle<Name> name = isolate->factory()->error_stack_symbol();
+  if (IsJSError(*object)) {
+    DCHECK(JSReceiver::HasOwnProperty(isolate, object, name).FromMaybe(false));
+    return true;
+  }
+  return JSReceiver::HasOwnProperty(isolate, object, name).FromMaybe(false);
+}
+
+// static
+ErrorUtils::StackPropertyLookupResult ErrorUtils::GetErrorStackProperty(
+    Isolate* isolate, Handle<JSReceiver> maybe_error_object) {
+  LookupIterator it(isolate, LookupIterator::PROTOTYPE_CHAIN_SKIP_INTERCEPTOR,
+                    maybe_error_object,
+                    isolate->factory()->error_stack_symbol());
+  Handle<Object> result = JSReceiver::GetDataProperty(&it);
+
+  if (!it.IsFound()) {
+    return {MaybeHandle<JSObject>{}, isolate->factory()->undefined_value()};
+  }
+  return {it.GetHolder<JSObject>(), result};
+}
+
 // static
 MaybeHandle<Object> ErrorUtils::GetFormattedStack(
-    Isolate* isolate, Handle<JSObject> error_object) {
+    Isolate* isolate, Handle<JSObject> maybe_error_object) {
   TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.stack_trace"), __func__);
 
-  Handle<Object> error_stack = JSReceiver::GetDataProperty(
-      isolate, error_object, isolate->factory()->error_stack_symbol());
-  if (error_stack->IsErrorStackData()) {
+  ErrorUtils::StackPropertyLookupResult lookup =
+      ErrorUtils::GetErrorStackProperty(isolate, maybe_error_object);
+
+  if (IsErrorStackData(*lookup.error_stack)) {
     Handle<ErrorStackData> error_stack_data =
-        Handle<ErrorStackData>::cast(error_stack);
+        Handle<ErrorStackData>::cast(lookup.error_stack);
     if (error_stack_data->HasFormattedStack()) {
       return handle(error_stack_data->formatted_stack(), isolate);
     }
     ErrorStackData::EnsureStackFrameInfos(isolate, error_stack_data);
+
+    Handle<JSObject> error_object =
+        lookup.error_stack_symbol_holder.ToHandleChecked();
     Handle<Object> formatted_stack;
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, formatted_stack,
@@ -1026,12 +1056,14 @@ MaybeHandle<Object> ErrorUtils::GetFormattedStack(
     return formatted_stack;
   }
 
-  if (error_stack->IsFixedArray()) {
+  if (IsFixedArray(*lookup.error_stack)) {
+    Handle<JSObject> error_object =
+        lookup.error_stack_symbol_holder.ToHandleChecked();
     Handle<Object> formatted_stack;
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, formatted_stack,
         FormatStackTrace(isolate, error_object,
-                         Handle<FixedArray>::cast(error_stack)),
+                         Handle<FixedArray>::cast(lookup.error_stack)),
         Object);
     RETURN_ON_EXCEPTION(
         isolate,
@@ -1043,18 +1075,24 @@ MaybeHandle<Object> ErrorUtils::GetFormattedStack(
     return formatted_stack;
   }
 
-  return error_stack;
+  return lookup.error_stack;
 }
 
 // static
 void ErrorUtils::SetFormattedStack(Isolate* isolate,
-                                   Handle<JSObject> error_object,
+                                   Handle<JSObject> maybe_error_object,
                                    Handle<Object> formatted_stack) {
-  Handle<Object> error_stack = JSReceiver::GetDataProperty(
-      isolate, error_object, isolate->factory()->error_stack_symbol());
-  if (error_stack->IsErrorStackData()) {
+  ErrorUtils::StackPropertyLookupResult lookup =
+      ErrorUtils::GetErrorStackProperty(isolate, maybe_error_object);
+
+  Handle<JSObject> error_object;
+  // Do nothing in case |maybe_error_object| is not an Error, i.e. its
+  // prototype doesn't contain objects with |error_stack_symbol| property.
+  if (!lookup.error_stack_symbol_holder.ToHandle(&error_object)) return;
+
+  if (IsErrorStackData(*lookup.error_stack)) {
     Handle<ErrorStackData> error_stack_data =
-        Handle<ErrorStackData>::cast(error_stack);
+        Handle<ErrorStackData>::cast(lookup.error_stack);
     ErrorStackData::EnsureStackFrameInfos(isolate, error_stack_data);
     error_stack_data->set_formatted_stack(*formatted_stack);
   } else {
@@ -1066,5 +1104,39 @@ void ErrorUtils::SetFormattedStack(Isolate* isolate,
   }
 }
 
+// static
+MaybeHandle<Object> ErrorUtils::CaptureStackTrace(Isolate* isolate,
+                                                  Handle<JSObject> object,
+                                                  FrameSkipMode mode,
+                                                  Handle<Object> caller) {
+  Factory* factory = isolate->factory();
+  Handle<Name> name = factory->stack_string();
+
+  // Explicitly check for frozen objects to simplify things since we need to
+  // add both "stack" and "error_stack_symbol" properties in one go.
+  if (!JSObject::IsExtensible(isolate, object)) {
+    return isolate->Throw<Object>(
+        factory->NewTypeError(MessageTemplate::kDefineDisallowed, name));
+  }
+
+  // Add the stack accessors.
+  PropertyDescriptor desc;
+  desc.set_enumerable(false);
+  desc.set_configurable(true);
+  desc.set_get(factory->error_stack_getter_fun_template());
+  desc.set_set(factory->error_stack_setter_fun_template());
+  Maybe<bool> success = JSReceiver::DefineOwnProperty(
+      isolate, object, name, &desc, Just(kThrowOnError));
+
+  MAYBE_RETURN(success, {});
+
+  // Collect the stack trace and store it in |object|'s private
+  // "error_stack_symbol" property.
+  RETURN_ON_EXCEPTION(
+      isolate, isolate->CaptureAndSetErrorStack(object, mode, caller), Object);
+
+  return isolate->factory()->undefined_value();
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/execution/messages.h b/deps/v8/src/execution/messages.h
index a6bbb30ba63874..1a9921f777be5f 100644
--- a/deps/v8/src/execution/messages.h
+++ b/deps/v8/src/execution/messages.h
@@ -16,6 +16,7 @@
 #include "src/base/optional.h"
 #include "src/common/message-template.h"
 #include "src/handles/handles.h"
+#include "src/handles/maybe-handles.h"
 
 namespace v8 {
 class Value;
@@ -105,17 +106,39 @@ class ErrorUtils : public AllStatic {
   static Handle<JSObject> NewConstructedNonConstructable(Isolate* isolate,
                                                          Handle<Object> source);
   // Returns the Exception sentinel.
-  static Object ThrowSpreadArgError(Isolate* isolate, MessageTemplate id,
-                                    Handle<Object> object);
+  static Tagged<Object> ThrowSpreadArgError(Isolate* isolate,
+                                            MessageTemplate id,
+                                            Handle<Object> object);
   // Returns the Exception sentinel.
-  static Object ThrowLoadFromNullOrUndefined(Isolate* isolate,
-                                             Handle<Object> object,
-                                             MaybeHandle<Object> key);
-
-  static MaybeHandle<Object> GetFormattedStack(Isolate* isolate,
-                                               Handle<JSObject> error_object);
-  static void SetFormattedStack(Isolate* isolate, Handle<JSObject> error_object,
+  static Tagged<Object> ThrowLoadFromNullOrUndefined(Isolate* isolate,
+                                                     Handle<Object> object,
+                                                     MaybeHandle<Object> key);
+
+  // Returns true if given object has own |error_stack_symbol| property.
+  static bool HasErrorStackSymbolOwnProperty(Isolate* isolate,
+                                             Handle<JSObject> object);
+
+  struct StackPropertyLookupResult {
+    // The holder of the |error_stack_symbol| or empty handle.
+    MaybeHandle<JSObject> error_stack_symbol_holder;
+    // The value of the |error_stack_symbol| property or |undefined_value|.
+    Handle<Object> error_stack;
+  };
+  // Gets |error_stack_symbol| property value by looking up the prototype chain.
+  static StackPropertyLookupResult GetErrorStackProperty(
+      Isolate* isolate, Handle<JSReceiver> maybe_error_object);
+
+  static MaybeHandle<Object> GetFormattedStack(
+      Isolate* isolate, Handle<JSObject> maybe_error_object);
+  static void SetFormattedStack(Isolate* isolate,
+                                Handle<JSObject> maybe_error_object,
                                 Handle<Object> formatted_stack);
+
+  // Collects the stack trace and installs the stack property accessors.
+  static MaybeHandle<Object> CaptureStackTrace(Isolate* isolate,
+                                               Handle<JSObject> object,
+                                               FrameSkipMode mode,
+                                               Handle<Object> caller);
 };
 
 class MessageFormatter {
diff --git a/deps/v8/src/execution/microtask-queue.cc b/deps/v8/src/execution/microtask-queue.cc
index 64c853e302e6f4..290780fa181c6b 100644
--- a/deps/v8/src/execution/microtask-queue.cc
+++ b/deps/v8/src/execution/microtask-queue.cc
@@ -71,7 +71,7 @@ MicrotaskQueue::~MicrotaskQueue() {
 Address MicrotaskQueue::CallEnqueueMicrotask(Isolate* isolate,
                                              intptr_t microtask_queue_pointer,
                                              Address raw_microtask) {
-  Microtask microtask = Microtask::cast(Object(raw_microtask));
+  Tagged<Microtask> microtask = Microtask::cast(Object(raw_microtask));
   reinterpret_cast<MicrotaskQueue*>(microtask_queue_pointer)
       ->EnqueueMicrotask(microtask);
   return Smi::zero().ptr();
@@ -97,7 +97,7 @@ void MicrotaskQueue::EnqueueMicrotask(v8::Isolate* v8_isolate,
   EnqueueMicrotask(*microtask);
 }
 
-void MicrotaskQueue::EnqueueMicrotask(Microtask microtask) {
+void MicrotaskQueue::EnqueueMicrotask(Tagged<Microtask> microtask) {
   if (size_ == capacity_) {
     // Keep the capacity of |ring_buffer_| power of 2, so that the JIT
     // implementation can calculate the modulo easily.
@@ -148,6 +148,10 @@ class SetIsRunningMicrotasks {
 }  // namespace
 
 int MicrotaskQueue::RunMicrotasks(Isolate* isolate) {
+  SetIsRunningMicrotasks scope(&is_running_microtasks_);
+  v8::Isolate::SuppressMicrotaskExecutionScope suppress(
+      reinterpret_cast<v8::Isolate*>(isolate), this);
+
   if (!size()) {
     OnCompleted(isolate);
     return 0;
@@ -163,9 +167,6 @@ int MicrotaskQueue::RunMicrotasks(Isolate* isolate) {
 
   int processed_microtask_count;
   {
-    SetIsRunningMicrotasks scope(&is_running_microtasks_);
-    v8::Isolate::SuppressMicrotaskExecutionScope suppress(
-        reinterpret_cast<v8::Isolate*>(isolate), this);
     HandleScopeImplementer::EnteredContextRewindScope rewind_scope(
         isolate->handle_scope_implementer());
     TRACE_EVENT_BEGIN0("v8.execute", "RunMicrotasks");
@@ -202,10 +203,10 @@ void MicrotaskQueue::IterateMicrotasks(RootVisitor* visitor) {
     // Iterate pending Microtasks as root objects to avoid the write barrier for
     // all single Microtask. If this hurts the GC performance, use a FixedArray.
     visitor->VisitRootPointers(
-        Root::kStrongRoots, nullptr, FullObjectSlot(ring_buffer_ + start_),
+        Root::kMicroTasks, nullptr, FullObjectSlot(ring_buffer_ + start_),
         FullObjectSlot(ring_buffer_ + std::min(start_ + size_, capacity_)));
     visitor->VisitRootPointers(
-        Root::kStrongRoots, nullptr, FullObjectSlot(ring_buffer_),
+        Root::kMicroTasks, nullptr, FullObjectSlot(ring_buffer_),
         FullObjectSlot(ring_buffer_ + std::max(start_ + size_ - capacity_,
                                                static_cast<intptr_t>(0))));
   }
@@ -251,9 +252,9 @@ void MicrotaskQueue::OnCompleted(Isolate* isolate) const {
   }
 }
 
-Microtask MicrotaskQueue::get(intptr_t index) const {
+Tagged<Microtask> MicrotaskQueue::get(intptr_t index) const {
   DCHECK_LT(index, size_);
-  Object microtask(ring_buffer_[(index + start_) % capacity_]);
+  Tagged<Object> microtask(ring_buffer_[(index + start_) % capacity_]);
   return Microtask::cast(microtask);
 }
 
diff --git a/deps/v8/src/execution/microtask-queue.h b/deps/v8/src/execution/microtask-queue.h
index 6091fa3575cf82..8ef62824d475d7 100644
--- a/deps/v8/src/execution/microtask-queue.h
+++ b/deps/v8/src/execution/microtask-queue.h
@@ -21,6 +21,8 @@ class Isolate;
 class Microtask;
 class Object;
 class RootVisitor;
+template <typename T>
+class Tagged;
 
 class V8_EXPORT_PRIVATE MicrotaskQueue final : public v8::MicrotaskQueue {
  public:
@@ -51,7 +53,7 @@ class V8_EXPORT_PRIVATE MicrotaskQueue final : public v8::MicrotaskQueue {
            !HasMicrotasksSuppressions();
   }
 
-  void EnqueueMicrotask(Microtask microtask);
+  void EnqueueMicrotask(Tagged<Microtask> microtask);
   void AddMicrotasksCompletedCallback(
       MicrotasksCompletedCallbackWithData callback, void* data) override;
   void RemoveMicrotasksCompletedCallback(
@@ -100,7 +102,7 @@ class V8_EXPORT_PRIVATE MicrotaskQueue final : public v8::MicrotaskQueue {
   intptr_t size() const { return size_; }
   intptr_t start() const { return start_; }
 
-  Microtask get(intptr_t index) const;
+  Tagged<Microtask> get(intptr_t index) const;
 
   MicrotaskQueue* next() const { return next_; }
   MicrotaskQueue* prev() const { return prev_; }
diff --git a/deps/v8/src/execution/mips64/simulator-mips64.cc b/deps/v8/src/execution/mips64/simulator-mips64.cc
index 6be43e6ecd93b5..52aad543f18e22 100644
--- a/deps/v8/src/execution/mips64/simulator-mips64.cc
+++ b/deps/v8/src/execution/mips64/simulator-mips64.cc
@@ -304,7 +304,8 @@ void MipsDebugger::Debug() {
       disasm::Disassembler dasm(converter);
       // Use a reasonably large buffer.
       v8::base::EmbeddedVector<char, 256> buffer;
-      dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(sim_->get_pc()));
+      dasm.InstructionDecode(buffer,
+                             reinterpret_cast<uint8_t*>(sim_->get_pc()));
       PrintF("  0x%016" PRIx64 "   %s\n", sim_->get_pc(), buffer.begin());
       last_pc = sim_->get_pc();
     }
@@ -395,10 +396,10 @@ void MipsDebugger::Debug() {
           int64_t value;
           StdoutStream os;
           if (GetValue(arg1, &value)) {
-            Object obj(value);
+            Tagged<Object> obj(value);
             os << arg1 << ": \n";
 #ifdef DEBUG
-            obj.Print(os);
+            Print(obj, os);
             os << "\n";
 #else
             os << Brief(obj) << "\n";
@@ -441,16 +442,16 @@ void MipsDebugger::Debug() {
         while (cur < end) {
           PrintF("  0x%012" PRIxPTR " :  0x%016" PRIx64 "  %14" PRId64 " ",
                  reinterpret_cast<intptr_t>(cur), *cur, *cur);
-          Object obj(*cur);
+          Tagged<Object> obj(*cur);
           Heap* current_heap = sim_->isolate_->heap();
           if (!skip_obj_print) {
-            if (obj.IsSmi() ||
+            if (IsSmi(obj) ||
                 IsValidHeapObject(current_heap, HeapObject::cast(obj))) {
               PrintF(" (");
-              if (obj.IsSmi()) {
+              if (IsSmi(obj)) {
                 PrintF("smi %d", Smi::ToInt(obj));
               } else {
-                obj.ShortPrint();
+                ShortPrint(obj);
               }
               PrintF(")");
             }
@@ -466,11 +467,11 @@ void MipsDebugger::Debug() {
         // Use a reasonably large buffer.
         v8::base::EmbeddedVector<char, 256> buffer;
 
-        byte* cur = nullptr;
-        byte* end = nullptr;
+        uint8_t* cur = nullptr;
+        uint8_t* end = nullptr;
 
         if (argc == 1) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
           end = cur + (10 * kInstrSize);
         } else if (argc == 2) {
           int regnum = Registers::Number(arg1);
@@ -478,7 +479,7 @@ void MipsDebugger::Debug() {
             // The argument is an address or a register name.
             int64_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(value);
+              cur = reinterpret_cast<uint8_t*>(value);
               // Disassemble 10 instructions at <arg1>.
               end = cur + (10 * kInstrSize);
             }
@@ -486,7 +487,7 @@ void MipsDebugger::Debug() {
             // The argument is the number of instructions.
             int64_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(sim_->get_pc());
+              cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
               // Disassemble <arg1> instructions.
               end = cur + (value * kInstrSize);
             }
@@ -495,7 +496,7 @@ void MipsDebugger::Debug() {
           int64_t value1;
           int64_t value2;
           if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-            cur = reinterpret_cast<byte*>(value1);
+            cur = reinterpret_cast<uint8_t*>(value1);
             end = cur + (value2 * kInstrSize);
           }
         }
@@ -595,16 +596,16 @@ void MipsDebugger::Debug() {
         // Use a reasonably large buffer.
         v8::base::EmbeddedVector<char, 256> buffer;
 
-        byte* cur = nullptr;
-        byte* end = nullptr;
+        uint8_t* cur = nullptr;
+        uint8_t* end = nullptr;
 
         if (argc == 1) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
           end = cur + (10 * kInstrSize);
         } else if (argc == 2) {
           int64_t value;
           if (GetValue(arg1, &value)) {
-            cur = reinterpret_cast<byte*>(value);
+            cur = reinterpret_cast<uint8_t*>(value);
             // no length parameter passed, assume 10 instructions
             end = cur + (10 * kInstrSize);
           }
@@ -612,7 +613,7 @@ void MipsDebugger::Debug() {
           int64_t value1;
           int64_t value2;
           if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-            cur = reinterpret_cast<byte*>(value1);
+            cur = reinterpret_cast<uint8_t*>(value1);
             end = cur + (value2 * kInstrSize);
           }
         }
@@ -785,8 +786,9 @@ void Simulator::CheckICache(base::CustomMatcherHashMap* i_cache,
 Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   // Set up simulator support first. Some of this information is needed to
   // setup the architecture state.
-  stack_size_ = v8_flags.sim_stack_size * KB;
-  stack_ = reinterpret_cast<char*>(base::Malloc(stack_size_));
+  size_t stack_size = AllocatedStackSize();
+  stack_ = reinterpret_cast<uintptr_t>(new uint8_t[stack_size]);
+  stack_limit_ = stack_ + kStackProtectionSize;
   pc_modified_ = false;
   icount_ = 0;
   break_count_ = 0;
@@ -813,7 +815,7 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   // The sp is initialized to point to the bottom (high address) of the
   // allocated stack area. To be safe in potential stack underflows we leave
   // some buffer below.
-  registers_[sp] = reinterpret_cast<int64_t>(stack_) + stack_size_ - 64;
+  registers_[sp] = stack_ + stack_size - kStackProtectionSize;
   // The ra and pc are initialized to a known bad value that will cause an
   // access violation if the simulator ever tries to execute it.
   registers_[pc] = bad_ra;
@@ -824,7 +826,7 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
 
 Simulator::~Simulator() {
   GlobalMonitor::Get()->RemoveLinkedAddress(&global_monitor_thread_);
-  base::Free(stack_);
+  delete[] reinterpret_cast<uint8_t*>(stack_);
 }
 
 // Get the active Simulator for the current thread.
@@ -2173,12 +2175,20 @@ uintptr_t Simulator::StackLimit(uintptr_t c_limit) const {
   // The simulator uses a separate JS stack. If we have exhausted the C stack,
   // we also drop down the JS limit to reflect the exhaustion on the JS stack.
   if (base::Stack::GetCurrentStackPosition() < c_limit) {
-    return reinterpret_cast<uintptr_t>(get_sp());
+    return get_sp();
   }
 
-  // Otherwise the limit is the JS stack. Leave a safety margin of 1024 bytes
+  // Otherwise the limit is the JS stack. Leave a safety margin
   // to prevent overrunning the stack when pushing values.
-  return reinterpret_cast<uintptr_t>(stack_) + 1024;
+  return stack_limit_ + kAdditionalStackMargin;
+}
+
+base::Vector<uint8_t> Simulator::GetCurrentStackView() const {
+  // We do not add an additional safety margin as above in
+  // Simulator::StackLimit, as users of this method are expected to add their
+  // own margin.
+  return base::VectorOf(reinterpret_cast<uint8_t*>(stack_limit_),
+                        UsableStackSize());
 }
 
 // Unsupported instructions use Format to print an error and stop execution.
@@ -2205,16 +2215,17 @@ using SimulatorRuntimeCompareCall = int64_t (*)(double darg0, double darg1);
 using SimulatorRuntimeFPFPCall = double (*)(double darg0, double darg1);
 using SimulatorRuntimeFPCall = double (*)(double darg0);
 using SimulatorRuntimeFPIntCall = double (*)(double darg0, int32_t arg0);
+// Define four args for future flexibility; at the time of this writing only
+// one is ever used.
+using SimulatorRuntimeFPTaggedCall = double (*)(int64_t arg0, int64_t arg1,
+                                                int64_t arg2, int64_t arg3);
 
 // This signature supports direct call in to API function native callback
 // (refer to InvocationCallback in v8.h).
 using SimulatorRuntimeDirectApiCall = void (*)(int64_t arg0);
-using SimulatorRuntimeProfilingApiCall = void (*)(int64_t arg0, void* arg1);
 
 // This signature supports direct call to accessor getter callback.
 using SimulatorRuntimeDirectGetterCall = void (*)(int64_t arg0, int64_t arg1);
-using SimulatorRuntimeProfilingGetterCall = void (*)(int64_t arg0, int64_t arg1,
-                                                     void* arg2);
 
 using MixedRuntimeCall_0 = AnyCType (*)();
 
@@ -2510,6 +2521,19 @@ void Simulator::SoftwareInterrupt() {
             UNREACHABLE();
         }
       }
+    } else if (redirection->type() ==
+               ExternalReference::BUILTIN_FP_POINTER_CALL) {
+      if (v8_flags.trace_sim) {
+        PrintF("Call to host function at %p args %08" PRIx64 " \n",
+               reinterpret_cast<void*>(external), arg0);
+      }
+      SimulatorRuntimeFPTaggedCall target =
+          reinterpret_cast<SimulatorRuntimeFPTaggedCall>(external);
+      double dresult = target(arg0, arg1, arg2, arg3);
+      SetFpResult(dresult);
+      if (v8_flags.trace_sim) {
+        PrintF("Returned %f\n", dresult);
+      }
     } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
       if (v8_flags.trace_sim) {
         PrintF("Call to host function at %p args %08" PRIx64 " \n",
@@ -2518,15 +2542,6 @@ void Simulator::SoftwareInterrupt() {
       SimulatorRuntimeDirectApiCall target =
           reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
       target(arg0);
-    } else if (redirection->type() == ExternalReference::PROFILING_API_CALL) {
-      if (v8_flags.trace_sim) {
-        PrintF("Call to host function at %p args %08" PRIx64 "  %08" PRIx64
-               " \n",
-               reinterpret_cast<void*>(external), arg0, arg1);
-      }
-      SimulatorRuntimeProfilingApiCall target =
-          reinterpret_cast<SimulatorRuntimeProfilingApiCall>(external);
-      target(arg0, Redirection::UnwrapRedirection(arg1));
     } else if (redirection->type() == ExternalReference::DIRECT_GETTER_CALL) {
       if (v8_flags.trace_sim) {
         PrintF("Call to host function at %p args %08" PRIx64 "  %08" PRIx64
@@ -2536,16 +2551,6 @@ void Simulator::SoftwareInterrupt() {
       SimulatorRuntimeDirectGetterCall target =
           reinterpret_cast<SimulatorRuntimeDirectGetterCall>(external);
       target(arg0, arg1);
-    } else if (redirection->type() ==
-               ExternalReference::PROFILING_GETTER_CALL) {
-      if (v8_flags.trace_sim) {
-        PrintF("Call to host function at %p args %08" PRIx64 "  %08" PRIx64
-               "  %08" PRIx64 " \n",
-               reinterpret_cast<void*>(external), arg0, arg1, arg2);
-      }
-      SimulatorRuntimeProfilingGetterCall target =
-          reinterpret_cast<SimulatorRuntimeProfilingGetterCall>(external);
-      target(arg0, arg1, Redirection::UnwrapRedirection(arg2));
     } else {
       DCHECK(redirection->type() == ExternalReference::BUILTIN_CALL ||
              redirection->type() == ExternalReference::BUILTIN_CALL_PAIR);
@@ -4151,12 +4156,12 @@ void Simulator::DecodeTypeRegisterSPECIAL() {
           switch (sa()) {
             case DIV_OP:
               if (rt_u_32 != 0) {
-                SetResult(rd_reg(), rs_u_32 / rt_u_32);
+                SetResult(rd_reg(), static_cast<int32_t>(rs_u_32 / rt_u_32));
               }
               break;
             case MOD_OP:
               if (rt_u() != 0) {
-                SetResult(rd_reg(), rs_u_32 % rt_u_32);
+                SetResult(rd_reg(), static_cast<int32_t>(rs_u_32 % rt_u_32));
               }
               break;
             default:
@@ -4168,8 +4173,8 @@ void Simulator::DecodeTypeRegisterSPECIAL() {
           if (rt_u() != 0) {
             uint32_t rt_u_32 = static_cast<uint32_t>(rt_u());
             uint32_t rs_u_32 = static_cast<uint32_t>(rs_u());
-            set_register(LO, rs_u_32 / rt_u_32);
-            set_register(HI, rs_u_32 % rt_u_32);
+            set_register(LO, static_cast<int32_t>(rs_u_32 / rt_u_32));
+            set_register(HI, static_cast<int32_t>(rs_u_32 % rt_u_32));
           }
         }
       }
@@ -7476,7 +7481,7 @@ void Simulator::InstructionDecode(Instruction* instr) {
     disasm::NameConverter converter;
     disasm::Disassembler dasm(converter);
     // Use a reasonably large buffer.
-    dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(instr));
+    dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(instr));
   }
 
   instr_ = instr;
diff --git a/deps/v8/src/execution/mips64/simulator-mips64.h b/deps/v8/src/execution/mips64/simulator-mips64.h
index cb8fd153c7ca23..dcf7ab309dabca 100644
--- a/deps/v8/src/execution/mips64/simulator-mips64.h
+++ b/deps/v8/src/execution/mips64/simulator-mips64.h
@@ -295,9 +295,14 @@ class Simulator : public SimulatorBase {
 
   Address get_sp() const { return static_cast<Address>(get_register(sp)); }
 
-  // Accessor to the internal simulator stack area.
+  // Accessor to the internal simulator stack area. Adds a safety
+  // margin to prevent overflows (kAdditionalStackMargin).
   uintptr_t StackLimit(uintptr_t c_limit) const;
 
+  // Return current stack view, without additional safety margins.
+  // Users, for example wasm::StackMemory, can add their own.
+  base::Vector<uint8_t> GetCurrentStackView() const;
+
   // Executes MIPS instructions until the PC reaches end_sim_pc.
   void Execute();
 
@@ -673,9 +678,17 @@ class Simulator : public SimulatorBase {
   uint32_t MSACSR_;
 
   // Simulator support.
-  // Allocate 1MB for stack.
-  size_t stack_size_;
-  char* stack_;
+  uintptr_t stack_;
+  static const size_t kStackProtectionSize = KB;
+  // This includes a protection margin at each end of the stack area.
+  static size_t AllocatedStackSize() {
+    return (v8_flags.sim_stack_size * KB) + (2 * kStackProtectionSize);
+  }
+  static size_t UsableStackSize() { return v8_flags.sim_stack_size * KB; }
+  uintptr_t stack_limit_;
+  // Added in Simulator::StackLimit()
+  static const int kAdditionalStackMargin = 4 * KB;
+
   bool pc_modified_;
   int64_t icount_;
   int break_count_;
diff --git a/deps/v8/src/execution/ppc/simulator-ppc.cc b/deps/v8/src/execution/ppc/simulator-ppc.cc
index b2d57fba1af9f5..7a8e9b3acd6675 100644
--- a/deps/v8/src/execution/ppc/simulator-ppc.cc
+++ b/deps/v8/src/execution/ppc/simulator-ppc.cc
@@ -129,7 +129,8 @@ namespace {
 // (simulator) builds.
 void SetInstructionBitsInCodeSpace(Instruction* instr, Instr value,
                                    Heap* heap) {
-  CodeSpaceMemoryModificationScope scope(heap);
+  CodePageMemoryModificationScope scope(
+      MemoryChunk::FromAddress(reinterpret_cast<Address>(instr)));
   instr->SetInstructionBits(value);
 }
 }  // namespace
@@ -191,7 +192,8 @@ void PPCDebugger::Debug() {
       disasm::Disassembler dasm(converter);
       // use a reasonably large buffer
       v8::base::EmbeddedVector<char, 256> buffer;
-      dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(sim_->get_pc()));
+      dasm.InstructionDecode(buffer,
+                             reinterpret_cast<uint8_t*>(sim_->get_pc()));
       PrintF("  0x%08" V8PRIxPTR "  %s\n", sim_->get_pc(), buffer.begin());
       last_pc = sim_->get_pc();
     }
@@ -232,7 +234,7 @@ void PPCDebugger::Debug() {
             // use a reasonably large buffer
             v8::base::EmbeddedVector<char, 256> buffer;
             dasm.InstructionDecode(buffer,
-                                   reinterpret_cast<byte*>(sim_->get_pc()));
+                                   reinterpret_cast<uint8_t*>(sim_->get_pc()));
             PrintF("  0x%08" V8PRIxPTR "  %s\n", sim_->get_pc(),
                    buffer.begin());
             sim_->ExecuteInstruction(
@@ -336,10 +338,10 @@ void PPCDebugger::Debug() {
           intptr_t value;
           StdoutStream os;
           if (GetValue(arg1, &value)) {
-            Object obj(value);
+            Tagged<Object> obj(value);
             os << arg1 << ": \n";
 #ifdef DEBUG
-            obj.Print(os);
+            Print(obj, os);
             os << "\n";
 #else
             os << Brief(obj) << "\n";
@@ -390,16 +392,16 @@ void PPCDebugger::Debug() {
         while (cur < end) {
           PrintF("  0x%08" V8PRIxPTR ":  0x%08" V8PRIxPTR " %10" V8PRIdPTR,
                  reinterpret_cast<intptr_t>(cur), *cur, *cur);
-          Object obj(*cur);
+          Tagged<Object> obj(*cur);
           Heap* current_heap = sim_->isolate_->heap();
           if (!skip_obj_print) {
-            if (obj.IsSmi() ||
+            if (IsSmi(obj) ||
                 IsValidHeapObject(current_heap, HeapObject::cast(obj))) {
               PrintF(" (");
-              if (obj.IsSmi()) {
+              if (IsSmi(obj)) {
                 PrintF("smi %d", Smi::ToInt(obj));
               } else {
-                obj.ShortPrint();
+                ShortPrint(obj);
               }
               PrintF(")");
             }
@@ -413,12 +415,12 @@ void PPCDebugger::Debug() {
         // use a reasonably large buffer
         v8::base::EmbeddedVector<char, 256> buffer;
 
-        byte* prev = nullptr;
-        byte* cur = nullptr;
-        byte* end = nullptr;
+        uint8_t* prev = nullptr;
+        uint8_t* cur = nullptr;
+        uint8_t* end = nullptr;
 
         if (argc == 1) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
           end = cur + (10 * kInstrSize);
         } else if (argc == 2) {
           int regnum = Registers::Number(arg1);
@@ -426,7 +428,7 @@ void PPCDebugger::Debug() {
             // The argument is an address or a register name.
             intptr_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(value);
+              cur = reinterpret_cast<uint8_t*>(value);
               // Disassemble 10 instructions at <arg1>.
               end = cur + (10 * kInstrSize);
             }
@@ -434,7 +436,7 @@ void PPCDebugger::Debug() {
             // The argument is the number of instructions.
             intptr_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(sim_->get_pc());
+              cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
               // Disassemble <arg1> instructions.
               end = cur + (value * kInstrSize);
             }
@@ -443,7 +445,7 @@ void PPCDebugger::Debug() {
           intptr_t value1;
           intptr_t value2;
           if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-            cur = reinterpret_cast<byte*>(value1);
+            cur = reinterpret_cast<uint8_t*>(value1);
             end = cur + (value2 * kInstrSize);
           }
         }
@@ -736,13 +738,7 @@ void Simulator::CheckICache(base::CustomMatcherHashMap* i_cache,
 Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
 // Set up simulator support first. Some of this information is needed to
 // setup the architecture state.
-#if V8_TARGET_ARCH_PPC64
-  size_t stack_size = v8_flags.sim_stack_size * KB;
-#else
-  size_t stack_size = MB;  // allocate 1MB for stack
-#endif
-  stack_size += 2 * stack_protection_size_;
-  stack_ = reinterpret_cast<char*>(base::Malloc(stack_size));
+  stack_ = reinterpret_cast<uint8_t*>(base::Malloc(AllocatedStackSize()));
   pc_modified_ = false;
   icount_ = 0;
   break_pc_ = nullptr;
@@ -767,8 +763,7 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   // The sp is initialized to point to the bottom (high address) of the
   // allocated stack area. To be safe in potential stack underflows we leave
   // some buffer below.
-  registers_[sp] =
-      reinterpret_cast<intptr_t>(stack_) + stack_size - stack_protection_size_;
+  registers_[sp] = reinterpret_cast<intptr_t>(stack_) + UsableStackSize();
 
   last_debugger_input_ = nullptr;
 }
@@ -891,7 +886,14 @@ uintptr_t Simulator::StackLimit(uintptr_t c_limit) const {
 
   // Otherwise the limit is the JS stack. Leave a safety margin to prevent
   // overrunning the stack when pushing values.
-  return reinterpret_cast<uintptr_t>(stack_) + stack_protection_size_;
+  return reinterpret_cast<uintptr_t>(stack_) + kStackProtectionSize;
+}
+
+base::Vector<uint8_t> Simulator::GetCurrentStackView() const {
+  // We do not add an additional safety margin as above in
+  // Simulator::StackLimit, as this is currently only used in wasm::StackMemory,
+  // which adds its own margin.
+  return base::VectorOf(stack_, UsableStackSize());
 }
 
 // Unsupported instructions use Format to print an error and stop execution.
@@ -961,16 +963,17 @@ using SimulatorRuntimeCompareCall = int (*)(double darg0, double darg1);
 using SimulatorRuntimeFPFPCall = double (*)(double darg0, double darg1);
 using SimulatorRuntimeFPCall = double (*)(double darg0);
 using SimulatorRuntimeFPIntCall = double (*)(double darg0, intptr_t arg0);
+// Define four args for future flexibility; at the time of this writing only
+// one is ever used.
+using SimulatorRuntimeFPTaggedCall = double (*)(int32_t arg0, int32_t arg1,
+                                                int32_t arg2, int32_t arg3);
 
 // This signature supports direct call in to API function native callback
 // (refer to InvocationCallback in v8.h).
 using SimulatorRuntimeDirectApiCall = void (*)(intptr_t arg0);
-using SimulatorRuntimeProfilingApiCall = void (*)(intptr_t arg0, void* arg1);
 
 // This signature supports direct call to accessor getter callback.
 using SimulatorRuntimeDirectGetterCall = void (*)(intptr_t arg0, intptr_t arg1);
-using SimulatorRuntimeProfilingGetterCall = void (*)(intptr_t arg0,
-                                                     intptr_t arg1, void* arg2);
 
 // Software interrupt instructions are used by the simulator to call into the
 // C-based V8 runtime.
@@ -1084,7 +1087,7 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           default:
             UNREACHABLE();
         }
-        if (v8_flags.trace_sim || !stack_aligned) {
+        if (v8_flags.trace_sim) {
           switch (redirection->type()) {
             case ExternalReference::BUILTIN_COMPARE_CALL:
               PrintF("Returned %08x\n", iresult);
@@ -1098,9 +1101,8 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
               UNREACHABLE();
           }
         }
-      } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
-        // See callers of MacroAssembler::CallApiFunctionAndReturn for
-        // explanation of register usage.
+      } else if (redirection->type() ==
+                 ExternalReference::BUILTIN_FP_POINTER_CALL) {
         if (v8_flags.trace_sim || !stack_aligned) {
           PrintF("Call to host function at %p args %08" V8PRIxPTR,
                  reinterpret_cast<void*>(external), arg[0]);
@@ -1111,16 +1113,23 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           PrintF("\n");
         }
         CHECK(stack_aligned);
-        SimulatorRuntimeDirectApiCall target =
-            reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
-        target(arg[0]);
-      } else if (redirection->type() == ExternalReference::PROFILING_API_CALL) {
+        SimulatorRuntimeFPTaggedCall target =
+            reinterpret_cast<SimulatorRuntimeFPTaggedCall>(external);
+        double dresult = target(arg[0], arg[1], arg[2], arg[3]);
+#ifdef DEBUG
+        TrashCallerSaveRegisters();
+#endif
+        SetFpResult(dresult);
+        if (v8_flags.trace_sim) {
+          PrintF("Returned %f\n", dresult);
+        }
+      } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
         // See callers of MacroAssembler::CallApiFunctionAndReturn for
         // explanation of register usage.
+        // void f(v8::FunctionCallbackInfo&)
         if (v8_flags.trace_sim || !stack_aligned) {
-          PrintF("Call to host function at %p args %08" V8PRIxPTR
-                 " %08" V8PRIxPTR,
-                 reinterpret_cast<void*>(external), arg[0], arg[1]);
+          PrintF("Call to host function at %p args %08" V8PRIxPTR,
+                 reinterpret_cast<void*>(external), arg[0]);
           if (!stack_aligned) {
             PrintF(" with unaligned stack %08" V8PRIxPTR "\n",
                    get_register(sp));
@@ -1128,12 +1137,13 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           PrintF("\n");
         }
         CHECK(stack_aligned);
-        SimulatorRuntimeProfilingApiCall target =
-            reinterpret_cast<SimulatorRuntimeProfilingApiCall>(external);
-        target(arg[0], Redirection::UnwrapRedirection(arg[1]));
+        SimulatorRuntimeDirectApiCall target =
+            reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
+        target(arg[0]);
       } else if (redirection->type() == ExternalReference::DIRECT_GETTER_CALL) {
         // See callers of MacroAssembler::CallApiFunctionAndReturn for
         // explanation of register usage.
+        // void f(v8::Local<String> property, v8::PropertyCallbackInfo& info)
         if (v8_flags.trace_sim || !stack_aligned) {
           PrintF("Call to host function at %p args %08" V8PRIxPTR
                  " %08" V8PRIxPTR,
@@ -1151,25 +1161,6 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           arg[0] = base::bit_cast<intptr_t>(arg[0]);
         }
         target(arg[0], arg[1]);
-      } else if (redirection->type() ==
-                 ExternalReference::PROFILING_GETTER_CALL) {
-        if (v8_flags.trace_sim || !stack_aligned) {
-          PrintF("Call to host function at %p args %08" V8PRIxPTR
-                 " %08" V8PRIxPTR " %08" V8PRIxPTR,
-                 reinterpret_cast<void*>(external), arg[0], arg[1], arg[2]);
-          if (!stack_aligned) {
-            PrintF(" with unaligned stack %08" V8PRIxPTR "\n",
-                   get_register(sp));
-          }
-          PrintF("\n");
-        }
-        CHECK(stack_aligned);
-        SimulatorRuntimeProfilingGetterCall target =
-            reinterpret_cast<SimulatorRuntimeProfilingGetterCall>(external);
-        if (!ABI_PASSES_HANDLES_IN_REGS) {
-          arg[0] = base::bit_cast<intptr_t>(arg[0]);
-        }
-        target(arg[0], arg[1], Redirection::UnwrapRedirection(arg[2]));
       } else {
         // builtin call.
         if (v8_flags.trace_sim || !stack_aligned) {
@@ -1357,11 +1348,11 @@ void Simulator::SetCR0(intptr_t result, bool setSO) {
   condition_reg_ = (condition_reg_ & ~0xF0000000) | bf;
 }
 
-void Simulator::SetCR6(bool true_for_all, bool false_for_all) {
+void Simulator::SetCR6(bool true_for_all) {
   int32_t clear_cr6_mask = 0xFFFFFF0F;
   if (true_for_all) {
     condition_reg_ = (condition_reg_ & clear_cr6_mask) | 0x80;
-  } else if (false_for_all) {
+  } else {
     condition_reg_ = (condition_reg_ & clear_cr6_mask) | 0x20;
   }
 }
@@ -1432,14 +1423,13 @@ template <typename A, typename T, typename Operation>
 void VectorCompareOp(Simulator* sim, Instruction* instr, bool is_fp,
                      Operation op) {
   DECODE_VX_INSTRUCTION(t, a, b, T)
-  bool true_for_all = true, false_for_all = true;
+  bool true_for_all = true;
   FOR_EACH_LANE(i, A) {
     A a_val = sim->get_simd_register_by_lane<A>(a, i);
     A b_val = sim->get_simd_register_by_lane<A>(b, i);
     T t_val = 0;
     bool is_not_nan = is_fp ? !isnan(a_val) && !isnan(b_val) : true;
     if (is_not_nan && op(a_val, b_val)) {
-      false_for_all = false;
       t_val = -1;  // Set all bits to 1 indicating true.
     } else {
       true_for_all = false;
@@ -1447,7 +1437,7 @@ void VectorCompareOp(Simulator* sim, Instruction* instr, bool is_fp,
     sim->set_simd_register_by_lane<T>(t, i, t_val);
   }
   if (instr->Bit(10)) {  // RC bit set.
-    sim->SetCR6(true_for_all, false_for_all);
+    sim->SetCR6(true_for_all);
   }
 }
 
@@ -5432,7 +5422,7 @@ void Simulator::Trace(Instruction* instr) {
   disasm::Disassembler dasm(converter);
   // use a reasonably large buffer
   v8::base::EmbeddedVector<char, 256> buffer;
-  dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(instr));
+  dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(instr));
   PrintF("%05d  %08" V8PRIxPTR "  %s\n", icount_,
          reinterpret_cast<intptr_t>(instr), buffer.begin());
 }
diff --git a/deps/v8/src/execution/ppc/simulator-ppc.h b/deps/v8/src/execution/ppc/simulator-ppc.h
index bfabd9af5c8c8b..bc46f008faca13 100644
--- a/deps/v8/src/execution/ppc/simulator-ppc.h
+++ b/deps/v8/src/execution/ppc/simulator-ppc.h
@@ -200,8 +200,12 @@ class Simulator : public SimulatorBase {
   // Accessor to the internal Link Register
   intptr_t get_lr() const;
 
-  // Accessor to the internal simulator stack area.
+  // Accessor to the internal simulator stack area. Adds a safety
+  // margin to prevent overflows.
   uintptr_t StackLimit(uintptr_t c_limit) const;
+  // Return current stack view, without additional safety margins.
+  // Users, for example wasm::StackMemory, can add their own.
+  base::Vector<uint8_t> GetCurrentStackView() const;
 
   // Executes PPC instructions until the PC reaches end_sim_pc.
   void Execute();
@@ -351,7 +355,7 @@ class Simulator : public SimulatorBase {
 
   void Trace(Instruction* instr);
   void SetCR0(intptr_t result, bool setSO = false);
-  void SetCR6(bool true_for_all, bool false_for_all);
+  void SetCR6(bool true_for_all);
   void ExecuteBranchConditional(Instruction* instr, BCType type);
   void ExecuteGeneric(Instruction* instr);
 
@@ -467,8 +471,20 @@ class Simulator : public SimulatorBase {
   }
 
   // Simulator support.
-  char* stack_;
-  static const size_t stack_protection_size_ = 256 * kSystemPointerSize;
+  uint8_t* stack_;
+  static const size_t kStackProtectionSize = 256 * kSystemPointerSize;
+  // This includes a protection margin at each end of the stack area.
+  static size_t AllocatedStackSize() {
+#if V8_TARGET_ARCH_PPC64
+    size_t stack_size = v8_flags.sim_stack_size * KB;
+#else
+    size_t stack_size = MB;  // allocate 1MB for stack
+#endif
+    return stack_size + (2 * kStackProtectionSize);
+  }
+  static size_t UsableStackSize() {
+    return AllocatedStackSize() - kStackProtectionSize;
+  }
   bool pc_modified_;
   int icount_;
 
diff --git a/deps/v8/src/execution/protectors-inl.h b/deps/v8/src/execution/protectors-inl.h
index c4d1a3c681383b..92bda9827b3a94 100644
--- a/deps/v8/src/execution/protectors-inl.h
+++ b/deps/v8/src/execution/protectors-inl.h
@@ -16,8 +16,8 @@ namespace internal {
   bool Protectors::Is##name##Intact(Isolate* isolate) {                  \
     PropertyCell cell =                                                  \
         PropertyCell::cast(isolate->root(RootIndex::k##root_index));     \
-    return cell.value().IsSmi() &&                                       \
-           Smi::ToInt(cell.value()) == kProtectorValid;                  \
+    return IsSmi(cell->value()) &&                                       \
+           Smi::ToInt(cell->value()) == kProtectorValid;                 \
   }
 DECLARED_PROTECTORS_ON_ISOLATE(DEFINE_PROTECTOR_ON_ISOLATE_CHECK)
 #undef DEFINE_PROTECTORS_ON_ISOLATE_CHECK
diff --git a/deps/v8/src/execution/protectors.cc b/deps/v8/src/execution/protectors.cc
index 2889b76a6f23a1..90916bcdba3dea 100644
--- a/deps/v8/src/execution/protectors.cc
+++ b/deps/v8/src/execution/protectors.cc
@@ -47,7 +47,7 @@ DECLARED_PROTECTORS_ON_ISOLATE(V)
 
 #define INVALIDATE_PROTECTOR_ON_ISOLATE_DEFINITION(name, unused_index, cell) \
   void Protectors::Invalidate##name(Isolate* isolate) {                      \
-    DCHECK(isolate->factory()->cell()->value().IsSmi());                     \
+    DCHECK(IsSmi(isolate->factory()->cell()->value()));                      \
     DCHECK(Is##name##Intact(isolate));                                       \
     if (v8_flags.trace_protector_invalidation) {                             \
       TraceProtectorInvalidation(#name);                                     \
diff --git a/deps/v8/src/execution/protectors.h b/deps/v8/src/execution/protectors.h
index 271661dddff9fb..89ce4a3d214bd1 100644
--- a/deps/v8/src/execution/protectors.h
+++ b/deps/v8/src/execution/protectors.h
@@ -27,6 +27,7 @@ class Protectors : public AllStatic {
   V(NoElements, NoElementsProtector, no_elements_protector)                   \
                                                                               \
   V(MegaDOM, MegaDOMProtector, mega_dom_protector)                            \
+  V(NoProfiling, NoProfilingProtector, no_profiling_protector)                \
                                                                               \
   /* The MapIterator protector protects the original iteration behaviors   */ \
   /* of Map.prototype.keys(), Map.prototype.values(), and                  */ \
@@ -40,15 +41,17 @@ class Protectors : public AllStatic {
   /*   property holder is the %IteratorPrototype%. Note that this also     */ \
   /*   invalidates the SetIterator protector (see below).                  */ \
   V(MapIteratorLookupChain, MapIteratorProtector, map_iterator_protector)     \
-  /* String.prototype.replace looks up Symbol.replace (aka @@replace) on   */ \
+  /* String.prototype.{matchAll|replace|split} looks up                    */ \
+  /* Symbol.{matchAll|replace|split} (aka @@matchAll, @@replace @split) on */ \
   /* the search term to check if it is regexp-like.                        */ \
   /* This protector ensures the prototype chain of String.prototype and    */ \
-  /* Number.prototype does not contain Symbol.replace.                     */ \
-  /* It enables a fast-path for String.prototype.replace by ensuring that  */ \
+  /* Number.prototype does not contain Symbol.{matchAll|replace|split}.    */ \
+  /* It enables a fast-path for String.prototype.{matchAll|replace|split}  */ \
+  /* by ensuring that                                                      */ \
   /* the implicit wrapper object for strings and numbers do not contain    */ \
-  /* the property Symbol.replace.                                          */ \
-  V(NumberStringPrototypeNoReplace, NumberStringPrototypeNoReplaceProtector,  \
-    number_string_prototype_no_replace_protector)                             \
+  /* the property Symbol.{matchAll|replace|split}.                         */ \
+  V(NumberStringNotRegexpLike, NumberStringNotRegexpLikeProtector,            \
+    number_string_not_regexp_like_protector)                                  \
   V(RegExpSpeciesLookupChain, RegExpSpeciesProtector,                         \
     regexp_species_protector)                                                 \
   V(PromiseHook, PromiseHookProtector, promise_hook_protector)                \
diff --git a/deps/v8/src/execution/riscv/frame-constants-riscv.h b/deps/v8/src/execution/riscv/frame-constants-riscv.h
index e73e43629fc10e..7addd469cf96fa 100644
--- a/deps/v8/src/execution/riscv/frame-constants-riscv.h
+++ b/deps/v8/src/execution/riscv/frame-constants-riscv.h
@@ -9,7 +9,6 @@
 #include "src/base/macros.h"
 #include "src/execution/frame-constants.h"
 #include "src/wasm/baseline/liftoff-assembler-defs.h"
-#include "src/wasm/wasm-linkage.h"
 
 namespace v8 {
 namespace internal {
@@ -24,10 +23,12 @@ class EntryFrameConstants : public AllStatic {
 class WasmLiftoffSetupFrameConstants : public TypedFrameConstants {
  public:
   // Number of gp parameters, without the instance.
-  static constexpr int kNumberOfSavedGpParamRegs =
-      arraysize(wasm::kGpParamRegisters) - 1;
-  static constexpr int kNumberOfSavedFpParamRegs =
-      arraysize(wasm::kFpParamRegisters);
+  // Note that {kNumberOfSavedGpParamRegs} = arraysize(wasm::kGpParamRegisters)
+  // - 1, {kNumberOfSavedFpParamRegs} = arraysize(wasm::kFpParamRegisters). Here
+  // we use immediate values instead to avoid circular references (introduced by
+  // linkage_location.h, issue: v8:14035) and resultant compilation errors.
+  static constexpr int kNumberOfSavedGpParamRegs = 6;
+  static constexpr int kNumberOfSavedFpParamRegs = 8;
   static constexpr int kNumberOfSavedAllParamRegs =
       kNumberOfSavedGpParamRegs + kNumberOfSavedFpParamRegs;
   static constexpr int kInstanceSpillOffset =
diff --git a/deps/v8/src/execution/riscv/simulator-riscv.cc b/deps/v8/src/execution/riscv/simulator-riscv.cc
index 9582db489638a3..1baf9eb6c66457 100644
--- a/deps/v8/src/execution/riscv/simulator-riscv.cc
+++ b/deps/v8/src/execution/riscv/simulator-riscv.cc
@@ -284,6 +284,48 @@ struct type_sew_t<128> {
   auto& vd = Rvvelt<type_sew_t<x>::type>(rvv_vd_reg(), i, true); \
   auto vs2 = Rvvelt<type_sew_t<x>::type>(rvv_vs2_reg(), i - offset);
 
+#define VX_SLIDE1DOWN_PARAMS(x, off)                                          \
+  auto& vd = Rvvelt<type_sew_t<x>::type>(rvv_vd_reg(), i, true);              \
+  if ((i + off) == rvv_vlmax()) {                                             \
+    type_sew_t<x>::type src = (type_sew_t<x>::type)(get_register(rs1_reg())); \
+    vd = src;                                                                 \
+  } else {                                                                    \
+    auto src = Rvvelt<type_sew_t<x>::type>(rvv_vs2_reg(), i + off);           \
+    vd = src;                                                                 \
+  }
+
+#define VX_SLIDE1UP_PARAMS(x, offset)                                         \
+  auto& vd = Rvvelt<type_sew_t<x>::type>(rvv_vd_reg(), i, true);              \
+  if (i == 0 && rvv_vstart() == 0) {                                          \
+    type_sew_t<x>::type src = (type_sew_t<x>::type)(get_register(rs1_reg())); \
+    vd = src;                                                                 \
+  } else {                                                                    \
+    auto src = Rvvelt<type_sew_t<x>::type>(rvv_vs2_reg(), i - offset);        \
+    vd = src;                                                                 \
+  }
+
+#define VF_SLIDE1DOWN_PARAMS(x, offset)                                \
+  auto& vd = Rvvelt<type_sew_t<x>::type>(rvv_vd_reg(), i, true);       \
+  if ((i + offset) == rvv_vlmax()) {                                   \
+    auto src = base::bit_cast<type_sew_t<x>::type>(                    \
+        get_fpu_register_Float##x(rs1_reg()).get_bits());              \
+    vd = src;                                                          \
+  } else {                                                             \
+    auto src = Rvvelt<type_sew_t<x>::type>(rvv_vs2_reg(), i + offset); \
+    vd = src;                                                          \
+  }
+
+#define VF_SLIDE1UP_PARAMS(x, offset)                                  \
+  auto& vd = Rvvelt<type_sew_t<x>::type>(rvv_vd_reg(), i, true);       \
+  if (i == rvv_vstart() && i == 0) {                                   \
+    auto src = base::bit_cast<type_sew_t<x>::type>(                    \
+        get_fpu_register_Float##x(rs1_reg()).get_bits());              \
+    vd = src;                                                          \
+  } else {                                                             \
+    auto src = Rvvelt<type_sew_t<x>::type>(rvv_vs2_reg(), i - offset); \
+    vd = src;                                                          \
+  }
+
 /* Vector Integer Extension */
 #define VI_VIE_PARAMS(x, scale)                                  \
   if ((x / scale) < 8) UNREACHABLE();                            \
@@ -790,6 +832,41 @@ struct type_sew_t<128> {
   }                               \
   RVV_VI_LOOP_CMP_END
 
+#define RVV_VI_VF_MERGE_LOOP_BASE \
+  for (uint64_t i = rvv_vstart(); i < rvv_vl(); i++) {
+#define RVV_VI_VF_MERGE_LOOP_END \
+  set_rvv_vstart(0);             \
+  }
+
+#define RVV_VI_VF_MERGE_LOOP(BODY16, BODY32, BODY64)        \
+  RVV_VI_VF_MERGE_LOOP_BASE                                 \
+  switch (rvv_vsew()) {                                     \
+    case E16: {                                             \
+      UNIMPLEMENTED();                                      \
+    }                                                       \
+    case E32: {                                             \
+      int32_t& vd = Rvvelt<int32_t>(rvv_vd_reg(), i, true); \
+      int32_t fs1 = base::bit_cast<int32_t>(                \
+          get_fpu_register_Float32(rs1_reg()).get_bits());  \
+      int32_t vs2 = Rvvelt<int32_t>(rvv_vs2_reg(), i);      \
+      BODY32;                                               \
+      break;                                                \
+    }                                                       \
+    case E64: {                                             \
+      int64_t& vd = Rvvelt<int64_t>(rvv_vd_reg(), i, true); \
+      int64_t fs1 = base::bit_cast<int64_t>(                \
+          get_fpu_register_Float64(rs1_reg()).get_bits());  \
+      int64_t vs2 = Rvvelt<int64_t>(rvv_vs2_reg(), i);      \
+      BODY64;                                               \
+      break;                                                \
+    }                                                       \
+    default:                                                \
+      UNREACHABLE();                                        \
+      break;                                                \
+  }                                                         \
+  RVV_VI_VF_MERGE_LOOP_END                                  \
+  rvv_trace_vd();
+
 #define RVV_VI_VFP_LOOP_BASE                           \
   for (uint64_t i = rvv_vstart(); i < rvv_vl(); ++i) { \
     RVV_VI_LOOP_MASK_SKIP();
@@ -853,6 +930,36 @@ struct type_sew_t<128> {
   RVV_VI_VFP_LOOP_END                                     \
   rvv_trace_vd();
 
+#define RVV_VFSGNJ_VV_VF_LOOP(BODY16, BODY32, BODY64)         \
+  RVV_VI_VFP_LOOP_BASE                                        \
+  switch (rvv_vsew()) {                                       \
+    case E16: {                                               \
+      UNIMPLEMENTED();                                        \
+      break;                                                  \
+    }                                                         \
+    case E32: {                                               \
+      uint32_t& vd = Rvvelt<uint32_t>(rvv_vd_reg(), i, true); \
+      uint32_t vs1 = Rvvelt<uint32_t>(rvv_vs1_reg(), i);      \
+      uint32_t vs2 = Rvvelt<uint32_t>(rvv_vs2_reg(), i);      \
+      Float32 fs1 = get_fpu_register_Float32(rs1_reg());      \
+      BODY32;                                                 \
+      break;                                                  \
+    }                                                         \
+    case E64: {                                               \
+      uint64_t& vd = Rvvelt<uint64_t>(rvv_vd_reg(), i, true); \
+      uint64_t vs1 = Rvvelt<uint64_t>(rvv_vs1_reg(), i);      \
+      uint64_t vs2 = Rvvelt<uint64_t>(rvv_vs2_reg(), i);      \
+      Float64 fs1 = get_fpu_register_Float64(rs1_reg());      \
+      BODY64;                                                 \
+      break;                                                  \
+    }                                                         \
+    default:                                                  \
+      require(0);                                             \
+      break;                                                  \
+  }                                                           \
+  RVV_VI_VFP_LOOP_END                                         \
+  rvv_trace_vd();
+
 #define RVV_VI_VFP_VF_LOOP_WIDEN(BODY32, vs2_is_widen)                         \
   RVV_VI_VFP_LOOP_BASE                                                         \
   switch (rvv_vsew()) {                                                        \
@@ -1185,11 +1292,11 @@ struct type_sew_t<128> {
   if (v8_flags.trace_sim) {                                                    \
     __int128_t value = Vregister_[rvv_vd_reg()];                               \
     SNPrintF(trace_buf_,                                                       \
-             "%016" REGIx_FORMAT "%016" REGIx_FORMAT                           \
-             " <-- 0x%016" REGIx_FORMAT,                                       \
+             "%016" PRIx64 "%016" PRIx64 "    (%" PRId64 ")    vlen:%" PRId64  \
+             " <-- [addr: %" REGIx_FORMAT "]",                                 \
              *(reinterpret_cast<int64_t*>(&value) + 1),                        \
-             *reinterpret_cast<int64_t*>(&value),                              \
-             (uint64_t)(get_register(rs1_reg())));                             \
+             *reinterpret_cast<int64_t*>(&value), icount_, rvv_vlen(),         \
+             (sreg_t)(get_register(rs1_reg())));                               \
   }
 
 #define RVV_VI_ST(stride, offset, elt_width, is_mask_ldst)                     \
@@ -1211,11 +1318,11 @@ struct type_sew_t<128> {
   if (v8_flags.trace_sim) {                                                    \
     __int128_t value = Vregister_[rvv_vd_reg()];                               \
     SNPrintF(trace_buf_,                                                       \
-             "%016" REGIx_FORMAT "%016" REGIx_FORMAT                           \
-             " --> 0x%016" REGIx_FORMAT,                                       \
+             "%016" PRIx64 "%016" PRIx64 "    (%" PRId64 ")    vlen:%" PRId64  \
+             " --> [addr: %" REGIx_FORMAT "]",                                 \
              *(reinterpret_cast<int64_t*>(&value) + 1),                        \
-             *reinterpret_cast<int64_t*>(&value),                              \
-             (uint64_t)(get_register(rs1_reg())));                             \
+             *reinterpret_cast<int64_t*>(&value), icount_, rvv_vlen(),         \
+             (sreg_t)(get_register(rs1_reg())));                               \
   }
 
 #define VI_VFP_LOOP_SCALE_BASE                      \
@@ -1285,14 +1392,14 @@ static inline uint8_t get_round(int vxrm, uint64_t v, uint8_t shift) {
 
 template <typename Src, typename Dst>
 inline Dst signed_saturation(Src v, uint n) {
-  Dst smax = (Dst)(INTPTR_MAX >> (64 - n));
-  Dst smin = (Dst)(INTPTR_MIN >> (64 - n));
+  Dst smax = (Dst)(INTPTR_MAX >> (sizeof(intptr_t) * 8 - n));
+  Dst smin = (Dst)(INTPTR_MIN >> (sizeof(intptr_t) * 8 - n));
   return (v > smax) ? smax : ((v < smin) ? smin : (Dst)v);
 }
 
 template <typename Src, typename Dst>
 inline Dst unsigned_saturation(Src v, uint n) {
-  Dst umax = (Dst)(UINTPTR_MAX >> (64 - n));
+  Dst umax = (Dst)(UINTPTR_MAX >> (sizeof(uintptr_t) * 8 - n));
   return (v > umax) ? umax : ((v < 0) ? 0 : (Dst)v);
 }
 
@@ -1467,7 +1574,7 @@ uint32_t get_fcsr_condition_bit(uint32_t cc) {
 // field of a subsequent LUI instruction; otherwise returns -1
 static inline int32_t get_ebreak_code(Instruction* instr) {
   DCHECK(instr->InstructionBits() == kBreakInstr);
-  byte* cur = reinterpret_cast<byte*>(instr);
+  uint8_t* cur = reinterpret_cast<uint8_t*>(instr);
   Instruction* next_instr = reinterpret_cast<Instruction*>(cur + kInstrSize);
   if (next_instr->BaseOpcodeFieldRaw() == LUI)
     return (next_instr->Imm20UValue());
@@ -1512,7 +1619,7 @@ class RiscvDebugger {
   v8::base::EmbeddedVector<char, 256> buffer;                          \
   disasm::NameConverter converter;                                     \
   disasm::Disassembler dasm(converter);                                \
-  dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(&instr_));    \
+  dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(&instr_)); \
   printf("Sim: Unsupported inst. Func:%s Line:%d PC:0x%" REGIx_FORMAT, \
          __FUNCTION__, __LINE__, get_pc());                            \
   PrintF(" %-44s\n", buffer.begin());                                  \
@@ -1678,7 +1785,8 @@ void RiscvDebugger::Debug() {
       if (name != nullptr) {
         PrintF("Call builtin:  %s\n", name);
       }
-      dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(sim_->get_pc()));
+      dasm.InstructionDecode(buffer,
+                             reinterpret_cast<uint8_t*>(sim_->get_pc()));
       PrintF("  0x%016" REGIx_FORMAT "   %s\n", sim_->get_pc(), buffer.begin());
       last_pc = sim_->get_pc();
     }
@@ -1745,7 +1853,7 @@ void RiscvDebugger::Debug() {
 #ifdef CAN_USE_RVV_INSTRUCTIONS
             } else if (vregnum != kInvalidVRegister) {
               __int128_t v = GetVRegisterValue(vregnum);
-              PrintF("\t%s:0x%016" REGIx_FORMAT "%016" REGIx_FORMAT "\n",
+              PrintF("\t%s:0x%016" PRIx64 "%016" PRIx64 "\n",
                      VRegisters::Name(vregnum), (uint64_t)(v >> 64),
                      (uint64_t)v);
 #endif
@@ -1784,7 +1892,7 @@ void RiscvDebugger::Debug() {
             Object obj(value);
             os << arg1 << ": \n";
 #ifdef DEBUG
-            obj.Print(os);
+            Print(obj, os);
             os << "\n";
 #else
             os << Brief(obj) << "\n";
@@ -1832,13 +1940,13 @@ void RiscvDebugger::Debug() {
                  reinterpret_cast<intptr_t>(cur), *cur, *cur);
           Object obj(*cur);
           Heap* current_heap = sim_->isolate_->heap();
-          if (obj.IsSmi() ||
+          if (IsSmi(obj) ||
               IsValidHeapObject(current_heap, HeapObject::cast(obj))) {
             PrintF(" (");
-            if (obj.IsSmi()) {
+            if (IsSmi(obj)) {
               PrintF("smi %d", Smi::ToInt(obj));
             } else {
-              obj.ShortPrint();
+              ShortPrint(obj);
             }
             PrintF(")");
           }
@@ -1897,11 +2005,11 @@ void RiscvDebugger::Debug() {
         // Use a reasonably large buffer.
         v8::base::EmbeddedVector<char, 256> buffer;
 
-        byte* cur = nullptr;
-        byte* end = nullptr;
+        uint8_t* cur = nullptr;
+        uint8_t* end = nullptr;
 
         if (argc == 1) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
           end = cur + (10 * kInstrSize);
         } else if (argc == 2) {
           int regnum = Registers::Number(arg1);
@@ -1909,7 +2017,7 @@ void RiscvDebugger::Debug() {
             // The argument is an address or a register name.
             sreg_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(value);
+              cur = reinterpret_cast<uint8_t*>(value);
               // Disassemble 10 instructions at <arg1>.
               end = cur + (10 * kInstrSize);
             }
@@ -1917,7 +2025,7 @@ void RiscvDebugger::Debug() {
             // The argument is the number of instructions.
             sreg_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(sim_->get_pc());
+              cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
               // Disassemble <arg1> instructions.
               end = cur + (value * kInstrSize);
             }
@@ -1926,7 +2034,7 @@ void RiscvDebugger::Debug() {
           sreg_t value1;
           sreg_t value2;
           if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-            cur = reinterpret_cast<byte*>(value1);
+            cur = reinterpret_cast<uint8_t*>(value1);
             end = cur + (value2 * kInstrSize);
           }
         }
@@ -2018,16 +2126,16 @@ void RiscvDebugger::Debug() {
         // Use a reasonably large buffer.
         v8::base::EmbeddedVector<char, 256> buffer;
 
-        byte* cur = nullptr;
-        byte* end = nullptr;
+        uint8_t* cur = nullptr;
+        uint8_t* end = nullptr;
 
         if (argc == 1) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
           end = cur + (10 * kInstrSize);
         } else if (argc == 2) {
           sreg_t value;
           if (GetValue(arg1, &value)) {
-            cur = reinterpret_cast<byte*>(value);
+            cur = reinterpret_cast<uint8_t*>(value);
             // no length parameter passed, assume 10 instructions
             end = cur + (10 * kInstrSize);
           }
@@ -2035,7 +2143,7 @@ void RiscvDebugger::Debug() {
           sreg_t value1;
           sreg_t value2;
           if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-            cur = reinterpret_cast<byte*>(value1);
+            cur = reinterpret_cast<uint8_t*>(value1);
             end = cur + (value2 * kInstrSize);
           }
         }
@@ -2267,8 +2375,7 @@ void Simulator::CheckICache(base::CustomMatcherHashMap* i_cache,
 Simulator::Simulator(Isolate* isolate) : isolate_(isolate), builtins_(isolate) {
   // Set up simulator support first. Some of this information is needed to
   // setup the architecture state.
-  stack_size_ = v8_flags.sim_stack_size * KB;
-  stack_ = reinterpret_cast<char*>(malloc(stack_size_));
+  stack_ = reinterpret_cast<uint8_t*>(base::Malloc(AllocatedStackSize()));
   pc_modified_ = false;
   icount_ = 0;
   break_count_ = 0;
@@ -2292,7 +2399,7 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate), builtins_(isolate) {
   // The sp is initialized to point to the bottom (high address) of the
   // allocated stack area. To be safe in potential stack underflows we leave
   // some buffer below.
-  registers_[sp] = reinterpret_cast<sreg_t>(stack_) + stack_size_ - xlen;
+  registers_[sp] = reinterpret_cast<intptr_t>(stack_) + UsableStackSize();
   // The ra and pc are initialized to a known bad value that will cause an
   // access violation if the simulator ever tries to execute it.
   registers_[pc] = bad_ra;
@@ -2437,7 +2544,7 @@ Float32 Simulator::get_fpu_register_Float32(int fpureg) const {
   DCHECK((fpureg >= 0) && (fpureg < kNumFPURegisters));
   if (!is_boxed_float(FPUregisters_[fpureg])) {
     std::cout << std::hex << FPUregisters_[fpureg] << std::endl;
-    return Float32::FromBits(0x7ffc0000);
+    return Float32::FromBits(0x7fc00000);
   }
   return Float32::FromBits(
       *base::bit_cast<uint32_t*>(const_cast<int64_t*>(&FPUregisters_[fpureg])));
@@ -2651,7 +2758,7 @@ void Simulator::TraceRegWr(int64_t value, TraceType t) {
   }
 }
 
-#elif V8_TARGET_ARCH_32_BIT
+#elif V8_TARGET_ARCH_RISCV32
 template <typename T>
 void Simulator::TraceRegWr(T value, TraceType t) {
   if (v8_flags.trace_sim) {
@@ -2797,8 +2904,9 @@ void Simulator::TraceMemWr(sreg_t addr, T value) {
         } else {
           SNPrintF(trace_buf_,
                    "                    (%" PRIu64
-                   ")    flt:%e --> [addr: %" REGIx_FORMAT "]",
-                   icount_, static_cast<float>(value), addr);
+                   ")    flt:%e bit:%x --> [addr: %" REGIx_FORMAT "]",
+                   icount_, static_cast<float>(value),
+                   base::bit_cast<int32_t, float>(value), addr);
         }
         break;
       case 8:
@@ -2811,8 +2919,13 @@ void Simulator::TraceMemWr(sreg_t addr, T value) {
         } else {
           SNPrintF(trace_buf_,
                    "                    (%" PRIu64
-                   ")    dbl:%e --> [addr: %" REGIx_FORMAT "]",
-                   icount_, static_cast<double>(value), addr);
+#if V8_TARGET_ARCH_RISCV64
+                   ")    dbl:%e bit:%lx --> [addr: %" REGIx_FORMAT "]",
+#elif V8_TARGET_ARCH_RISCV32
+                   ")    dbl:%e bit:%llx --> [addr: %" REGIx_FORMAT "]",
+#endif
+                   icount_, static_cast<double>(value),
+                   base::bit_cast<int64_t, double>(value), addr);
         }
         break;
       default:
@@ -2825,8 +2938,12 @@ void Simulator::TraceMemWrDouble(sreg_t addr, double value) {
   if (v8_flags.trace_sim) {
     SNPrintF(trace_buf_,
              "                    (%" PRIu64
-             ")    dbl:%e --> [addr: %" REGIx_FORMAT "]",
-             icount_, value, addr);
+#if V8_TARGET_ARCH_RISCV64
+             ")    dbl:%e bit:%lx--> [addr: %" REGIx_FORMAT "]",
+#elif V8_TARGET_ARCH_RISCV32
+             ")    dbl:%e bit:%llx--> [addr: %" REGIx_FORMAT "]",
+#endif
+             icount_, value, base::bit_cast<int64_t, double>(value), addr);
   }
 }
 // RISCV Memory Read/Write functions
@@ -2934,9 +3051,16 @@ uintptr_t Simulator::StackLimit(uintptr_t c_limit) const {
     return reinterpret_cast<uintptr_t>(get_sp());
   }
 
-  // Otherwise the limit is the JS stack. Leave a safety margin of 4 KiB
-  // to prevent overrunning the stack when pushing values.
-  return reinterpret_cast<uintptr_t>(stack_) + 4 * KB;
+  // Otherwise the limit is the JS stack. Leave a safety margin to prevent
+  // overrunning the stack when pushing values.
+  return reinterpret_cast<uintptr_t>(stack_) + kStackProtectionSize;
+}
+
+base::Vector<uint8_t> Simulator::GetCurrentStackView() const {
+  // We do not add an additional safety margin as above in
+  // Simulator::StackLimit, as this is currently only used in wasm::StackMemory,
+  // which adds its own margin.
+  return base::VectorOf(stack_, UsableStackSize());
 }
 
 // Unsupported instructions use Format to print an error and stop execution.
@@ -2971,12 +3095,14 @@ using SimulatorRuntimeFPIntCall = double (*)(double darg0, int32_t arg0);
 // This signature supports direct call in to API function native callback
 // (refer to InvocationCallback in v8.h).
 using SimulatorRuntimeDirectApiCall = void (*)(sreg_t arg0);
-using SimulatorRuntimeProfilingApiCall = void (*)(sreg_t arg0, void* arg1);
 
 // This signature supports direct call to accessor getter callback.
 using SimulatorRuntimeDirectGetterCall = void (*)(sreg_t arg0, sreg_t arg1);
-using SimulatorRuntimeProfilingGetterCall = void (*)(sreg_t arg0, sreg_t arg1,
-                                                     void* arg2);
+
+// Define four args for future flexibility; at the time of this writing only
+// one is ever used.
+using SimulatorRuntimeFPTaggedCall = double (*)(int64_t arg0, int64_t arg1,
+                                                int64_t arg2, int64_t arg3);
 
 // Software interrupt instructions are used by the simulator to call into the
 // C-based V8 runtime. They are also used for debugging with simulator.
@@ -3108,7 +3234,23 @@ void Simulator::SoftwareInterrupt() {
             UNREACHABLE();
         }
       }
+    } else if (redirection->type() ==
+               ExternalReference::BUILTIN_FP_POINTER_CALL) {
+      if (v8_flags.trace_sim) {
+        PrintF("Call to host function at %p args %08" REGIx_FORMAT " \n",
+               reinterpret_cast<void*>(external), arg0);
+      }
+      SimulatorRuntimeFPTaggedCall target =
+          reinterpret_cast<SimulatorRuntimeFPTaggedCall>(external);
+      double dresult = target(arg0, arg1, arg2, arg3);
+      SetFpResult(dresult);
+      if (v8_flags.trace_sim) {
+        PrintF("Returned %f\n", dresult);
+      }
     } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
+      // See callers of MacroAssembler::CallApiFunctionAndReturn for
+      // explanation of register usage.
+      // void f(v8::FunctionCallbackInfo&)
       if (v8_flags.trace_sim) {
         PrintF("Call to host function %s at %p args %08" REGIx_FORMAT " \n",
                ExternalReferenceTable::NameOfIsolateIndependentAddress(pc),
@@ -3117,37 +3259,18 @@ void Simulator::SoftwareInterrupt() {
       SimulatorRuntimeDirectApiCall target =
           reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
       target(arg0);
-    } else if (redirection->type() == ExternalReference::PROFILING_API_CALL) {
-      if (v8_flags.trace_sim) {
-        PrintF("Call to host function %s at %p args %08" REGIx_FORMAT
-               "  %08" REGIx_FORMAT " \n",
-               ExternalReferenceTable::NameOfIsolateIndependentAddress(pc),
-               reinterpret_cast<void*>(external), arg0, arg1);
-      }
-      SimulatorRuntimeProfilingApiCall target =
-          reinterpret_cast<SimulatorRuntimeProfilingApiCall>(external);
-      target(arg0, Redirection::UnwrapRedirection(arg1));
     } else if (redirection->type() == ExternalReference::DIRECT_GETTER_CALL) {
+      // See callers of MacroAssembler::CallApiFunctionAndReturn for
+      // explanation of register usage.
+      // void f(v8::Local<String> property, v8::PropertyCallbackInfo& info)
       if (v8_flags.trace_sim) {
-        PrintF("Call to host function %s at %p args %08" REGIx_FORMAT
+        PrintF("Call to host function at %p args %08" REGIx_FORMAT
                "  %08" REGIx_FORMAT " \n",
-               ExternalReferenceTable::NameOfIsolateIndependentAddress(pc),
                reinterpret_cast<void*>(external), arg0, arg1);
       }
       SimulatorRuntimeDirectGetterCall target =
           reinterpret_cast<SimulatorRuntimeDirectGetterCall>(external);
       target(arg0, arg1);
-    } else if (redirection->type() ==
-               ExternalReference::PROFILING_GETTER_CALL) {
-      if (v8_flags.trace_sim) {
-        PrintF("Call to host function %s at %p args %08" REGIx_FORMAT
-               "  %08" REGIx_FORMAT "  %08" REGIx_FORMAT " \n",
-               ExternalReferenceTable::NameOfIsolateIndependentAddress(pc),
-               reinterpret_cast<void*>(external), arg0, arg1, arg2);
-      }
-      SimulatorRuntimeProfilingGetterCall target =
-          reinterpret_cast<SimulatorRuntimeProfilingGetterCall>(external);
-      target(arg0, arg1, Redirection::UnwrapRedirection(arg2));
     } else {
       DCHECK(
           redirection->type() == ExternalReference::BUILTIN_CALL ||
@@ -3387,7 +3510,7 @@ void Simulator::DecodeRVRType() {
       set_rd(rs1() & rs2());
       break;
     }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
     case RO_ADDW: {
       set_rd(sext32(rs1() + rs2()));
       break;
@@ -3408,7 +3531,7 @@ void Simulator::DecodeRVRType() {
       set_rd(sext32(int32_t(rs1()) >> (rs2() & 0x1F)));
       break;
     }
-#endif /* V8_TARGET_ARCH_64_BIT */
+#endif /* V8_TARGET_ARCH_RISCV64 */
       // TODO(riscv): Add RISCV M extension macro
     case RO_MUL: {
       set_rd(rs1() * rs2());
@@ -3470,7 +3593,7 @@ void Simulator::DecodeRVRType() {
       }
       break;
     }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
     case RO_MULW: {
       set_rd(sext32(sext32(rs1()) * sext32(rs2())));
       break;
@@ -3519,7 +3642,7 @@ void Simulator::DecodeRVRType() {
       }
       break;
     }
-#endif /*V8_TARGET_ARCH_64_BIT*/
+#endif /*V8_TARGET_ARCH_RISCV64*/
       // TODO(riscv): End Add RISCV M extension macro
     default: {
       switch (instr_.BaseOpcode()) {
@@ -3896,7 +4019,7 @@ void Simulator::DecodeRVRAType() {
           instr_.instr(), WORD)));
       break;
     }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
     case RO_LR_D: {
       base::MutexGuard lock_guard(&GlobalMonitor::Get()->mutex);
       int64_t addr = rs1();
@@ -3976,7 +4099,7 @@ void Simulator::DecodeRVRAType() {
           instr_.instr(), DWORD));
       break;
     }
-#endif /*V8_TARGET_ARCH_64_BIT*/
+#endif /*V8_TARGET_ARCH_RISCV64*/
     // TODO(riscv): End Add macro for RISCV A extension
     default: {
       UNSUPPORTED();
@@ -4113,7 +4236,7 @@ void Simulator::DecodeRVRFPType() {
               RoundF2IHelper<uint32_t>(original_val, instr_.RoundMode())));
           break;
         }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
         case 0b00010: {  // RO_FCVT_L_S
           set_rd(RoundF2IHelper<int64_t>(original_val, instr_.RoundMode()));
           break;
@@ -4122,7 +4245,7 @@ void Simulator::DecodeRVRFPType() {
           set_rd(RoundF2IHelper<uint64_t>(original_val, instr_.RoundMode()));
           break;
         }
-#endif /* V8_TARGET_ARCH_64_BIT */
+#endif /* V8_TARGET_ARCH_RISCV64 */
         default: {
           UNSUPPORTED();
         }
@@ -4180,7 +4303,7 @@ void Simulator::DecodeRVRFPType() {
           set_frd(static_cast<float>((uint32_t)rs1()));
           break;
         }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
         case 0b00010: {  // RO_FCVT_S_L
           set_frd(static_cast<float>((int64_t)rs1()));
           break;
@@ -4189,7 +4312,7 @@ void Simulator::DecodeRVRFPType() {
           set_frd(static_cast<float>((uint64_t)rs1()));
           break;
         }
-#endif /* V8_TARGET_ARCH_64_BIT */
+#endif /* V8_TARGET_ARCH_RISCV64 */
         default: {
           UNSUPPORTED();
         }
@@ -4364,12 +4487,12 @@ void Simulator::DecodeRVRFPType() {
           set_rd(FclassHelper(drs1()));
           break;
         }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
         case 0b000: {  // RO_FMV_X_D
           set_rd(base::bit_cast<int64_t>(drs1()));
           break;
         }
-#endif /* V8_TARGET_ARCH_64_BIT */
+#endif /* V8_TARGET_ARCH_RISCV64 */
         default: {
           UNSUPPORTED();
         }
@@ -4388,7 +4511,7 @@ void Simulator::DecodeRVRFPType() {
               RoundF2IHelper<uint32_t>(original_val, instr_.RoundMode())));
           break;
         }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
         case 0b00010: {  // RO_FCVT_L_D
           set_rd(RoundF2IHelper<int64_t>(original_val, instr_.RoundMode()));
           break;
@@ -4397,7 +4520,7 @@ void Simulator::DecodeRVRFPType() {
           set_rd(RoundF2IHelper<uint64_t>(original_val, instr_.RoundMode()));
           break;
         }
-#endif /* V8_TARGET_ARCH_64_BIT */
+#endif /* V8_TARGET_ARCH_RISCV64 */
         default: {
           UNSUPPORTED();
         }
@@ -4414,7 +4537,7 @@ void Simulator::DecodeRVRFPType() {
           set_drd((uint32_t)rs1());
           break;
         }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
         case 0b00010: {  // RO_FCVT_D_L
           set_drd((int64_t)rs1());
           break;
@@ -4423,14 +4546,14 @@ void Simulator::DecodeRVRFPType() {
           set_drd((uint64_t)rs1());
           break;
         }
-#endif /* V8_TARGET_ARCH_64_BIT */
+#endif /* V8_TARGET_ARCH_RISCV64 */
         default: {
           UNSUPPORTED();
         }
       }
       break;
     }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
     case RO_FMV_D_X: {
       if (instr_.Funct3Value() == 0b000 && instr_.Rs2Value() == 0b00000) {
         // Since FMV preserves source bit-pattern, no need to canonize
@@ -4440,7 +4563,7 @@ void Simulator::DecodeRVRFPType() {
       }
       break;
     }
-#endif /* V8_TARGET_ARCH_64_BIT */
+#endif /* V8_TARGET_ARCH_RISCV64 */
     default: {
       UNSUPPORTED();
     }
@@ -4709,7 +4832,7 @@ void Simulator::DecodeRVIType() {
         if (builtin != Builtin::kNoBuiltinId) {
           auto code = builtins_.code(builtin);
           if ((rs1_reg() != ra || imm12() != 0)) {
-            if ((Address)get_pc() == code.InstructionStart()) {
+            if ((Address)get_pc() == code.instruction_start()) {
               sreg_t arg0 = get_register(a0);
               sreg_t arg1 = get_register(a1);
               sreg_t arg2 = get_register(a2);
@@ -4775,7 +4898,7 @@ void Simulator::DecodeRVIType() {
       TraceMemRd(addr, val, get_register(rd_reg()));
       break;
     }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
     case RO_LWU: {
       int64_t addr = rs1() + imm12();
       uint32_t val = ReadMem<uint32_t>(addr, instr_.instr());
@@ -4790,7 +4913,7 @@ void Simulator::DecodeRVIType() {
       TraceMemRd(addr, val, get_register(rd_reg()));
       break;
     }
-#endif /*V8_TARGET_ARCH_64_BIT*/
+#endif /*V8_TARGET_ARCH_RISCV64*/
     case RO_ADDI: {
       set_rd(sext_xlen(rs1() + imm12()));
       break;
@@ -4830,7 +4953,7 @@ void Simulator::DecodeRVIType() {
       }
       break;
     }
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
     case RO_ADDIW: {
       set_rd(sext32(rs1() + imm12()));
       break;
@@ -4847,7 +4970,7 @@ void Simulator::DecodeRVIType() {
       }
       break;
     }
-#endif /*V8_TARGET_ARCH_64_BIT*/
+#endif /*V8_TARGET_ARCH_RISCV64*/
     case RO_FENCE: {
       // DO nothing in sumulator
       break;
@@ -4952,11 +5075,11 @@ void Simulator::DecodeRVSType() {
     case RO_SW:
       WriteMem<uint32_t>(rs1() + s_imm12(), (uint32_t)rs2(), instr_.instr());
       break;
-#ifdef V8_TARGET_ARCH_64_BIT
+#ifdef V8_TARGET_ARCH_RISCV64
     case RO_SD:
       WriteMem<uint64_t>(rs1() + s_imm12(), (uint64_t)rs2(), instr_.instr());
       break;
-#endif /*V8_TARGET_ARCH_64_BIT*/
+#endif /*V8_TARGET_ARCH_RISCV64*/
     // TODO(riscv): use F Extension macro block
     case RO_FSW: {
       WriteMem<Float32>(rs1() + s_imm12(), get_fpu_register_Float32(rs2_reg()),
@@ -5094,7 +5217,7 @@ void Simulator::DecodeCAType() {
     case RO_C_AND:
       set_rvc_rs1s(rvc_rs1s() & rvc_rs2s());
       break;
-#if V8_TARGET_ARCH_64_BIT
+#if V8_TARGET_ARCH_RISCV64
     case RO_C_SUBW:
       set_rvc_rs1s(sext32(rvc_rs1s() - rvc_rs2s()));
       break;
@@ -5115,7 +5238,7 @@ void Simulator::DecodeCIType() {
       else  // c.addi
         set_rvc_rd(sext_xlen(rvc_rs1() + rvc_imm6()));
       break;
-#if V8_TARGET_ARCH_64_BIT
+#if V8_TARGET_ARCH_RISCV64
     case RO_C_ADDIW:
       set_rvc_rd(sext32(rvc_rs1() + rvc_imm6()));
       break;
@@ -5146,7 +5269,7 @@ void Simulator::DecodeCIType() {
                        get_fpu_register(rvc_frd_reg()));
       break;
     }
-#if V8_TARGET_ARCH_64_BIT
+#if V8_TARGET_ARCH_RISCV64
     case RO_C_LWSP: {
       sreg_t addr = get_register(sp) + rvc_imm6_lwsp();
       int64_t val = ReadMem<int32_t>(addr, instr_.instr());
@@ -5161,7 +5284,7 @@ void Simulator::DecodeCIType() {
       TraceMemRd(addr, val, get_register(rvc_rd_reg()));
       break;
     }
-#elif V8_TARGET_ARCH_32_BIT
+#elif V8_TARGET_ARCH_RISCV32
     case RO_C_FLWSP: {
       sreg_t addr = get_register(sp) + rvc_imm6_ldsp();
       uint32_t val = ReadMem<uint32_t>(addr, instr_.instr());
@@ -5202,7 +5325,7 @@ void Simulator::DecodeCSSType() {
                         instr_.instr());
       break;
     }
-#if V8_TARGET_ARCH_32_BIT
+#if V8_TARGET_ARCH_RISCV32
     case RO_C_FSWSP: {
       sreg_t addr = get_register(sp) + rvc_imm6_sdsp();
       WriteMem<Float32>(addr, get_fpu_register_Float32(rvc_rs2_reg()),
@@ -5215,7 +5338,7 @@ void Simulator::DecodeCSSType() {
       WriteMem<int32_t>(addr, (int32_t)rvc_rs2(), instr_.instr());
       break;
     }
-#if V8_TARGET_ARCH_64_BIT
+#if V8_TARGET_ARCH_RISCV64
     case RO_C_SDSP: {
       sreg_t addr = get_register(sp) + rvc_imm6_sdsp();
       WriteMem<int64_t>(addr, (int64_t)rvc_rs2(), instr_.instr());
@@ -5242,7 +5365,7 @@ void Simulator::DecodeCLType() {
       set_rvc_drs2s(Float64::FromBits(val), false);
       break;
     }
-#if V8_TARGET_ARCH_64_BIT
+#if V8_TARGET_ARCH_RISCV64
     case RO_C_LD: {
       sreg_t addr = rvc_rs1s() + rvc_imm5_d();
       int64_t val = ReadMem<int64_t>(addr, instr_.instr());
@@ -5250,7 +5373,7 @@ void Simulator::DecodeCLType() {
       TraceMemRd(addr, val, get_register(rvc_rs2s_reg()));
       break;
     }
-#elif V8_TARGET_ARCH_32_BIT
+#elif V8_TARGET_ARCH_RISCV32
     case RO_C_FLW: {
       sreg_t addr = rvc_rs1s() + rvc_imm5_d();
       uint32_t val = ReadMem<uint32_t>(addr, instr_.instr());
@@ -5270,7 +5393,7 @@ void Simulator::DecodeCSType() {
       WriteMem<int32_t>(addr, (int32_t)rvc_rs2s(), instr_.instr());
       break;
     }
-#if V8_TARGET_ARCH_64_BIT
+#if V8_TARGET_ARCH_RISCV64
     case RO_C_SD: {
       sreg_t addr = rvc_rs1s() + rvc_imm5_d();
       WriteMem<int64_t>(addr, (int64_t)rvc_rs2s(), instr_.instr());
@@ -5609,14 +5732,14 @@ void Simulator::DecodeRvvIVV() {
       }
       break;
     case RO_V_VSLL_VV: {
-      RVV_VI_VV_LOOP({ vd = vs2 << vs1; })
+      RVV_VI_VV_LOOP({ vd = vs2 << (vs1 & (rvv_sew() - 1)); })
       break;
     }
     case RO_V_VSRL_VV:
-      RVV_VI_VV_ULOOP({ vd = vs2 >> vs1; })
+      RVV_VI_VV_ULOOP({ vd = vs2 >> (vs1 & (rvv_sew() - 1)); })
       break;
     case RO_V_VSRA_VV:
-      RVV_VI_VV_LOOP({ vd = vs2 >> vs1; })
+      RVV_VI_VV_LOOP({ vd = vs2 >> (vs1 & (rvv_sew() - 1)); })
       break;
     case RO_V_VSMUL_VV: {
       RVV_VI_GENERAL_LOOP_BASE
@@ -5693,7 +5816,7 @@ void Simulator::DecodeRvvIVV() {
       // disasm::NameConverter converter;
       // disasm::Disassembler dasm(converter);
       // // Use a reasonably large buffer.
-      // dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(&instr_));
+      // dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(&instr_));
 
       // PrintF("EXECUTING  0x%08" PRIxPTR "   %-44s\n",
       //        reinterpret_cast<intptr_t>(&instr_), buffer.begin());
@@ -5856,13 +5979,13 @@ void Simulator::DecodeRvvIVI() {
       rvv_trace_vd();
     } break;
     case RO_V_VSRL_VI:
-      RVV_VI_VI_ULOOP({ vd = vs2 >> uimm5; })
+      RVV_VI_VI_ULOOP({ vd = vs2 >> (uimm5 & (rvv_sew() - 1)); })
       break;
     case RO_V_VSRA_VI:
       RVV_VI_VI_LOOP({ vd = vs2 >> (simm5 & (rvv_sew() - 1) & 0x1f); })
       break;
     case RO_V_VSLL_VI:
-      RVV_VI_VI_ULOOP({ vd = vs2 << uimm5; })
+      RVV_VI_VI_ULOOP({ vd = vs2 << (uimm5 & (rvv_sew() - 1)); })
       break;
     case RO_V_VADC_VI:
       if (instr_.RvvVM()) {
@@ -6060,9 +6183,68 @@ void Simulator::DecodeRvvIVX() {
     case RO_V_VMSGTU_VX:
       RVV_VI_VX_ULOOP_CMP({ res = vs2 > rs1; })
       break;
-    case RO_V_VSLIDEDOWN_VX:
-      UNIMPLEMENTED_RISCV();
-      break;
+    case RO_V_VSLIDEDOWN_VX: {
+      RVV_VI_CHECK_SLIDE(false);
+
+      const sreg_t sh = get_register(rs1_reg());
+      RVV_VI_GENERAL_LOOP_BASE
+
+      reg_t offset = 0;
+      bool is_valid = (i + sh) < rvv_vlmax();
+
+      if (is_valid) {
+        offset = sh;
+      }
+
+      switch (rvv_vsew()) {
+        case E8: {
+          VI_XI_SLIDEDOWN_PARAMS(8, offset);
+          vd = is_valid ? vs2 : 0;
+        } break;
+        case E16: {
+          VI_XI_SLIDEDOWN_PARAMS(16, offset);
+          vd = is_valid ? vs2 : 0;
+        } break;
+        case E32: {
+          VI_XI_SLIDEDOWN_PARAMS(32, offset);
+          vd = is_valid ? vs2 : 0;
+        } break;
+        default: {
+          VI_XI_SLIDEDOWN_PARAMS(64, offset);
+          vd = is_valid ? vs2 : 0;
+        } break;
+      }
+      RVV_VI_LOOP_END
+      rvv_trace_vd();
+    } break;
+    case RO_V_VSLIDEUP_VX: {
+      RVV_VI_CHECK_SLIDE(true);
+
+      const reg_t offset = get_register(rs1_reg());
+      RVV_VI_GENERAL_LOOP_BASE
+      if (rvv_vstart() < offset && i < offset) continue;
+
+      switch (rvv_vsew()) {
+        case E8: {
+          VI_XI_SLIDEUP_PARAMS(8, offset);
+          vd = vs2;
+        } break;
+        case E16: {
+          VI_XI_SLIDEUP_PARAMS(16, offset);
+          vd = vs2;
+        } break;
+        case E32: {
+          VI_XI_SLIDEUP_PARAMS(32, offset);
+          vd = vs2;
+        } break;
+        default: {
+          VI_XI_SLIDEUP_PARAMS(64, offset);
+          vd = vs2;
+        } break;
+      }
+      RVV_VI_LOOP_END
+      rvv_trace_vd();
+    } break;
     case RO_V_VADC_VX:
       if (instr_.RvvVM()) {
         RVV_VI_XI_LOOP_WITH_CARRY({
@@ -6075,7 +6257,7 @@ void Simulator::DecodeRvvIVX() {
       }
       break;
     case RO_V_VSLL_VX: {
-      RVV_VI_VX_LOOP({ vd = vs2 << rs1; })
+      RVV_VI_VX_LOOP({ vd = vs2 << (rs1 & (rvv_sew() - 1)); })
       break;
     }
     case RO_V_VSRL_VX: {
@@ -6162,6 +6344,7 @@ void Simulator::DecodeRvvMVV() {
     }
     case RO_V_VWXUNARY0: {
       if (rvv_vs1_reg() == 0) {
+        // vmv.x.s
         switch (rvv_vsew()) {
           case E8:
             set_rd(Rvvelt<type_sew_t<8>::type>(rvv_vs2_reg(), 0));
@@ -6181,7 +6364,8 @@ void Simulator::DecodeRvvMVV() {
         set_rvv_vstart(0);
         rvv_trace_vd();
       } else if (rvv_vs1_reg() == 0b10000) {
-        uint64_t cnt = 0;
+        // vpopc
+        reg_t cnt = 0;
         RVV_VI_GENERAL_LOOP_BASE
         RVV_VI_LOOP_MASK_SKIP()
         const uint8_t idx = i / 64;
@@ -6192,7 +6376,8 @@ void Simulator::DecodeRvvMVV() {
         set_register(rd_reg(), cnt);
         rvv_trace_vd();
       } else if (rvv_vs1_reg() == 0b10001) {
-        int64_t index = -1;
+        // vfirst
+        sreg_t index = -1;
         RVV_VI_GENERAL_LOOP_BASE
         RVV_VI_LOOP_MASK_SKIP()
         const uint8_t idx = i / 64;
@@ -6209,7 +6394,7 @@ void Simulator::DecodeRvvMVV() {
         v8::base::EmbeddedVector<char, 256> buffer;
         disasm::NameConverter converter;
         disasm::Disassembler dasm(converter);
-        dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(&instr_));
+        dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(&instr_));
         PrintF("EXECUTING  0x%08" PRIxPTR "   %-44s\n",
                reinterpret_cast<intptr_t>(&instr_), buffer.begin());
         UNIMPLEMENTED_RISCV();
@@ -6305,7 +6490,7 @@ void Simulator::DecodeRvvMVV() {
       v8::base::EmbeddedVector<char, 256> buffer;
       disasm::NameConverter converter;
       disasm::Disassembler dasm(converter);
-      dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(&instr_));
+      dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(&instr_));
       PrintF("EXECUTING  0x%08" PRIxPTR "   %-44s\n",
              reinterpret_cast<intptr_t>(&instr_), buffer.begin());
       UNIMPLEMENTED_RISCV();
@@ -6368,11 +6553,52 @@ void Simulator::DecodeRvvMVX() {
       })
       break;
     }
+    case RO_V_VSLIDE1DOWN_VX: {
+      RVV_VI_CHECK_SLIDE(false);
+      RVV_VI_GENERAL_LOOP_BASE
+      switch (rvv_vsew()) {
+        case E8: {
+          VX_SLIDE1DOWN_PARAMS(8, 1);
+        } break;
+        case E16: {
+          VX_SLIDE1DOWN_PARAMS(16, 1);
+        } break;
+        case E32: {
+          VX_SLIDE1DOWN_PARAMS(32, 1);
+        } break;
+        default: {
+          VX_SLIDE1DOWN_PARAMS(64, 1);
+        } break;
+      }
+      RVV_VI_LOOP_END
+      rvv_trace_vd();
+    } break;
+    case RO_V_VSLIDE1UP_VX: {
+      RVV_VI_CHECK_SLIDE(true);
+      RVV_VI_GENERAL_LOOP_BASE
+      if (i < rvv_vstart()) continue;
+      switch (rvv_vsew()) {
+        case E8: {
+          VX_SLIDE1UP_PARAMS(8, 1);
+        } break;
+        case E16: {
+          VX_SLIDE1UP_PARAMS(16, 1);
+        } break;
+        case E32: {
+          VX_SLIDE1UP_PARAMS(32, 1);
+        } break;
+        default: {
+          VX_SLIDE1UP_PARAMS(64, 1);
+        } break;
+      }
+      RVV_VI_LOOP_END
+      rvv_trace_vd();
+    } break;
     default:
       v8::base::EmbeddedVector<char, 256> buffer;
       disasm::NameConverter converter;
       disasm::Disassembler dasm(converter);
-      dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(&instr_));
+      dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(&instr_));
       PrintF("EXECUTING  0x%08" PRIxPTR "   %-44s\n",
              reinterpret_cast<intptr_t>(&instr_), buffer.begin());
       UNIMPLEMENTED_RISCV();
@@ -6735,19 +6961,49 @@ void Simulator::DecodeRvvFVV() {
       break;
     }
     case RO_V_VFSGNJ_VV:
-      RVV_VI_VFP_VV_LOOP({ UNIMPLEMENTED(); },
-                         { vd = fsgnj32(vs2, vs1, false, false); },
-                         { vd = fsgnj64(vs2, vs1, false, false); })
+      RVV_VFSGNJ_VV_VF_LOOP({ UNIMPLEMENTED(); },
+                            {
+                              vd = fsgnj32(Float32::FromBits(vs2),
+                                           Float32::FromBits(vs1), false, false)
+                                       .get_bits();
+                              USE(fs1);
+                            },
+                            {
+                              vd = fsgnj64(Float64::FromBits(vs2),
+                                           Float64::FromBits(vs1), false, false)
+                                       .get_bits();
+                              USE(fs1);
+                            })
       break;
     case RO_V_VFSGNJN_VV:
-      RVV_VI_VFP_VV_LOOP({ UNIMPLEMENTED(); },
-                         { vd = fsgnj32(vs2, vs1, true, false); },
-                         { vd = fsgnj64(vs2, vs1, true, false); })
+      RVV_VFSGNJ_VV_VF_LOOP({ UNIMPLEMENTED(); },
+                            {
+                              vd = fsgnj32(Float32::FromBits(vs2),
+                                           Float32::FromBits(vs1), true, false)
+                                       .get_bits();
+                              USE(fs1);
+                            },
+                            {
+                              vd = fsgnj64(Float64::FromBits(vs2),
+                                           Float64::FromBits(vs1), true, false)
+                                       .get_bits();
+                              USE(fs1);
+                            })
       break;
     case RO_V_VFSGNJX_VV:
-      RVV_VI_VFP_VV_LOOP({ UNIMPLEMENTED(); },
-                         { vd = fsgnj32(vs2, vs1, false, true); },
-                         { vd = fsgnj64(vs2, vs1, false, true); })
+      RVV_VFSGNJ_VV_VF_LOOP({ UNIMPLEMENTED(); },
+                            {
+                              vd = fsgnj32(Float32::FromBits(vs2),
+                                           Float32::FromBits(vs1), false, true)
+                                       .get_bits();
+                              USE(fs1);
+                            },
+                            {
+                              vd = fsgnj64(Float64::FromBits(vs2),
+                                           Float64::FromBits(vs1), false, true)
+                                       .get_bits();
+                              USE(fs1);
+                            })
       break;
     case RO_V_VFADD_VV:
       RVV_VI_VFP_VV_LOOP(
@@ -6879,8 +7135,8 @@ void Simulator::DecodeRvvFVV() {
           },
           false)
       break;
-    case RO_V_VFWREDUSUM_VV:
-    case RO_V_VFWREDOSUM_VV:
+    case RO_V_VFWREDUSUM_VS:
+    case RO_V_VFWREDOSUM_VS:
       RVV_VI_CHECK_DSS(true);
       switch (rvv_vsew()) {
         case E16:
@@ -6913,7 +7169,7 @@ void Simulator::DecodeRvvFVV() {
           require(false);
           break;
       }
-
+      rvv_trace_vd();
       break;
     case RO_V_VFMADD_VV:
       RVV_VI_VFP_FMA_VV_LOOP({RVV_VI_VFP_FMA(float, vd, vs1, vs2)},
@@ -6969,20 +7225,19 @@ void Simulator::DecodeRvvFVV() {
           UNIMPLEMENTED();
         }
         case E32: {
-          float fs2 = Rvvelt<float>(rvv_vs2_reg(), 0);
-          set_fpu_register_float(rd_reg(), fs2);
+          uint32_t fs2 = Rvvelt<uint32_t>(rvv_vs2_reg(), 0);
+          set_frd(Float32::FromBits(fs2));
           break;
         }
         case E64: {
-          double fs2 = Rvvelt<double>(rvv_vs2_reg(), 0);
-          set_fpu_register_double(rd_reg(), fs2);
+          uint64_t fs2 = Rvvelt<uint64_t>(rvv_vs2_reg(), 0);
+          set_drd(Float64::FromBits(fs2));
           break;
         }
         default:
           require(0);
           break;
       }
-      rvv_trace_vd();
       break;
     default:
       UNSUPPORTED_RISCV();
@@ -6993,32 +7248,68 @@ void Simulator::DecodeRvvFVF() {
   DCHECK_EQ(instr_.InstructionBits() & (kBaseOpcodeMask | kFunct3Mask), OP_FVF);
   switch (instr_.InstructionBits() & kVTypeMask) {
     case RO_V_VFSGNJ_VF:
-      RVV_VI_VFP_VF_LOOP(
-          {}, { vd = fsgnj32(vs2, fs1, false, false); },
-          { vd = fsgnj64(vs2, fs1, false, false); })
+      RVV_VFSGNJ_VV_VF_LOOP(
+          {},
+          {
+            vd = fsgnj32(Float32::FromBits(vs2), fs1, false, false).get_bits();
+            USE(vs1);
+          },
+          {
+            vd = fsgnj64(Float64::FromBits(vs2), fs1, false, false).get_bits();
+            USE(vs1);
+          })
       break;
     case RO_V_VFSGNJN_VF:
-      RVV_VI_VFP_VF_LOOP(
-          {}, { vd = fsgnj32(vs2, fs1, true, false); },
-          { vd = fsgnj64(vs2, fs1, true, false); })
+      RVV_VFSGNJ_VV_VF_LOOP(
+          {},
+          {
+            vd = fsgnj32(Float32::FromBits(vs2), fs1, true, false).get_bits();
+            USE(vs1);
+          },
+          {
+            vd = fsgnj64(Float64::FromBits(vs2), fs1, true, false).get_bits();
+            USE(vs1);
+          })
       break;
     case RO_V_VFSGNJX_VF:
-      RVV_VI_VFP_VF_LOOP(
-          {}, { vd = fsgnj32(vs2, fs1, false, true); },
-          { vd = fsgnj64(vs2, fs1, false, true); })
-      break;
-    case RO_V_VFMV_VF:
-      RVV_VI_VFP_VF_LOOP(
+      RVV_VFSGNJ_VV_VF_LOOP(
           {},
           {
-            vd = fs1;
-            USE(vs2);
+            vd = fsgnj32(Float32::FromBits(vs2), fs1, false, true).get_bits();
+            USE(vs1);
           },
           {
-            vd = fs1;
-            USE(vs2);
+            vd = fsgnj64(Float64::FromBits(vs2), fs1, false, true).get_bits();
+            USE(vs1);
           })
       break;
+    case RO_V_VFMV_VF:
+      if (instr_.RvvVM()) {
+        RVV_VI_VF_MERGE_LOOP(
+            {},
+            {
+              vd = fs1;
+              USE(vs2);
+            },
+            {
+              vd = fs1;
+              USE(vs2);
+            });
+      } else {
+        RVV_VI_VF_MERGE_LOOP(
+            {},
+            {
+              bool use_first =
+                  (Rvvelt<uint64_t>(0, (i / 64)) >> (i % 64)) & 0x1;
+              vd = use_first ? fs1 : vs2;
+            },
+            {
+              bool use_first =
+                  (Rvvelt<uint64_t>(0, (i / 64)) >> (i % 64)) & 0x1;
+              vd = use_first ? fs1 : vs2;
+            });
+      }
+      break;
     case RO_V_VFADD_VF:
       RVV_VI_VFP_VF_LOOP(
           { UNIMPLEMENTED(); },
@@ -7154,6 +7445,73 @@ void Simulator::DecodeRvvFVF() {
       RVV_VI_CHECK_DSS(true);
       RVV_VI_VFP_VF_LOOP_WIDEN({RVV_VI_VFP_FMA(double, -vs2, fs1, vs3)}, false)
       break;
+    case RO_V_VFMV_SF: {
+      if (instr_.Vs2Value() == 0x0) {
+        if (rvv_vl() > 0 && rvv_vstart() < rvv_vl()) {
+          switch (rvv_vsew()) {
+            case E8:
+              UNREACHABLE();
+            case E16:
+              UNREACHABLE();
+            case E32:
+              Rvvelt<uint32_t>(rvv_vd_reg(), 0, true) =
+                  (uint32_t)(get_fpu_register_Float32(rs1_reg()).get_bits());
+              break;
+            case E64:
+              Rvvelt<uint64_t>(rvv_vd_reg(), 0, true) =
+                  (uint64_t)(get_fpu_register_Float64(rs1_reg()).get_bits());
+              break;
+            default:
+              UNREACHABLE();
+          }
+        }
+        set_rvv_vstart(0);
+        rvv_trace_vd();
+      } else {
+        UNSUPPORTED_RISCV();
+      }
+    } break;
+    case RO_V_VFSLIDE1DOWN_VF: {
+      RVV_VI_CHECK_SLIDE(false);
+      RVV_VI_GENERAL_LOOP_BASE
+      switch (rvv_vsew()) {
+        case E8: {
+          UNSUPPORTED();
+        }
+        case E16: {
+          UNSUPPORTED();
+        }
+        case E32: {
+          VF_SLIDE1DOWN_PARAMS(32, 1);
+        } break;
+        default: {
+          VF_SLIDE1DOWN_PARAMS(64, 1);
+        } break;
+      }
+      RVV_VI_LOOP_END
+      rvv_trace_vd();
+    } break;
+    case RO_V_VFSLIDE1UP_VF: {
+      RVV_VI_CHECK_SLIDE(true);
+      RVV_VI_GENERAL_LOOP_BASE
+      if (i < rvv_vstart()) continue;
+      switch (rvv_vsew()) {
+        case E8: {
+          UNSUPPORTED();
+        }
+        case E16: {
+          UNSUPPORTED();
+        }
+        case E32: {
+          VF_SLIDE1UP_PARAMS(32, 1);
+        } break;
+        default: {
+          VF_SLIDE1UP_PARAMS(64, 1);
+        } break;
+      }
+      RVV_VI_LOOP_END
+      rvv_trace_vd();
+    } break;
     default:
       UNSUPPORTED_RISCV();
   }
@@ -7258,7 +7616,7 @@ void Simulator::InstructionDecode(Instruction* instr) {
     disasm::NameConverter converter;
     disasm::Disassembler dasm(converter);
     // Use a reasonably large buffer.
-    dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(instr));
+    dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(instr));
 
     // PrintF("EXECUTING  0x%08" PRIxPTR "   %-44s\n",
     //        reinterpret_cast<intptr_t>(instr), buffer.begin());
@@ -7343,17 +7701,18 @@ void Simulator::InstructionDecode(Instruction* instr) {
            " ",
            reinterpret_cast<intptr_t>(watch_address_), *watch_address_,
            *watch_address_);
-    Object obj(*watch_address_);
-    Heap* current_heap = isolate_->heap();
-    if (obj.IsSmi() || IsValidHeapObject(current_heap, HeapObject::cast(obj))) {
-      PrintF(" (");
-      if (obj.IsSmi()) {
-        PrintF("smi %d", Smi::ToInt(obj));
-      } else {
-        obj.ShortPrint();
-      }
-      PrintF(")");
-    }
+    // Object obj(*watch_address_);
+    // Heap* current_heap = isolate_->heap();
+    // if (obj.IsSmi() || IsValidHeapObject(current_heap,
+    // HeapObject::cast(obj))) {
+    //   PrintF(" (");
+    //   if (obj.IsSmi()) {
+    //     PrintF("smi %d", Smi::ToInt(obj));
+    //   } else {
+    //     ShortPrint(obj);
+    //   }
+    //   PrintF(")");
+    // }
     PrintF("\n");
     if (watch_value_ != *watch_address_) {
       RiscvDebugger dbg(this);
diff --git a/deps/v8/src/execution/riscv/simulator-riscv.h b/deps/v8/src/execution/riscv/simulator-riscv.h
index c744bf9921591a..38ea7e41277ffc 100644
--- a/deps/v8/src/execution/riscv/simulator-riscv.h
+++ b/deps/v8/src/execution/riscv/simulator-riscv.h
@@ -70,6 +70,8 @@ T Nabs(T a) {
 }
 
 #if defined(USE_SIMULATOR)
+typedef signed __int128_t __attribute__((__mode__(__TI__)));
+typedef unsigned __uint128_t __attribute__((__mode__(__TI__)));
 // Running with a simulator.
 
 #include "src/base/hashmap.h"
@@ -525,8 +527,12 @@ class Simulator : public SimulatorBase {
 
   Address get_sp() const { return static_cast<Address>(get_register(sp)); }
 
-  // Accessor to the internal simulator stack area.
+  // Accessor to the internal simulator stack area. Adds a safety
+  // margin to prevent overflows (kAdditionalStackMargin).
   uintptr_t StackLimit(uintptr_t c_limit) const;
+  // Return current stack view, without additional safety margins.
+  // Users, for example wasm::StackMemory, can add their own.
+  base::Vector<uint8_t> GetCurrentStackView() const;
 
   // Executes RISC-V instructions until the PC reaches end_sim_pc.
   void Execute();
@@ -842,8 +848,8 @@ class Simulator : public SimulatorBase {
         if (trace_buf_[i] == '\0') break;
       }
       SNPrintF(trace_buf_.SubVector(i, trace_buf_.length()),
-               "  sew:%s lmul:%s vstart:%lu vl:%lu", rvv_sew_s(), rvv_lmul_s(),
-               rvv_vstart(), rvv_vl());
+               "  sew:%s lmul:%s vstart:%" PRId64 "vl:%" PRId64, rvv_sew_s(),
+               rvv_lmul_s(), rvv_vstart(), rvv_vl());
     }
   }
 
@@ -1091,8 +1097,21 @@ class Simulator : public SimulatorBase {
 #endif
   // Simulator support.
   // Allocate 1MB for stack.
-  size_t stack_size_;
-  char* stack_;
+  uint8_t* stack_;
+  static const size_t kStackProtectionSize = 256 * kSystemPointerSize;
+  // This includes a protection margin at each end of the stack area.
+  static size_t AllocatedStackSize() {
+#if V8_TARGET_ARCH_PPC64
+    size_t stack_size = v8_flags.sim_stack_size * KB;
+#else
+    size_t stack_size = 1 * MB;  // allocate 1MB for stack
+#endif
+    return stack_size + (2 * kStackProtectionSize);
+  }
+  static size_t UsableStackSize() {
+    return AllocatedStackSize() - kStackProtectionSize;
+  }
+
   bool pc_modified_;
   int64_t icount_;
   sreg_t* watch_address_ = nullptr;
diff --git a/deps/v8/src/execution/s390/simulator-s390.cc b/deps/v8/src/execution/s390/simulator-s390.cc
index 84df3a2bbde535..8828d3a4935cfe 100644
--- a/deps/v8/src/execution/s390/simulator-s390.cc
+++ b/deps/v8/src/execution/s390/simulator-s390.cc
@@ -139,7 +139,8 @@ namespace {
 // (simulator) builds.
 void SetInstructionBitsInCodeSpace(Instruction* instr, Instr value,
                                    Heap* heap) {
-  CodeSpaceMemoryModificationScope scope(heap);
+  CodePageMemoryModificationScope scope(
+      MemoryChunk::FromAddress(reinterpret_cast<Address>(instr)));
   instr->SetInstructionBits(value);
 }
 }  // namespace
@@ -201,7 +202,8 @@ void S390Debugger::Debug() {
       disasm::Disassembler dasm(converter);
       // use a reasonably large buffer
       v8::base::EmbeddedVector<char, 256> buffer;
-      dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(sim_->get_pc()));
+      dasm.InstructionDecode(buffer,
+                             reinterpret_cast<uint8_t*>(sim_->get_pc()));
       PrintF("  0x%08" V8PRIxPTR "  %s\n", sim_->get_pc(), buffer.begin());
       last_pc = sim_->get_pc();
     }
@@ -245,8 +247,8 @@ void S390Debugger::Debug() {
             // Interpret a numeric argument as the number of instructions to
             // step past.
             for (int i = 1; (!sim_->has_bad_pc()) && i < value; i++) {
-              dasm.InstructionDecode(buffer,
-                                     reinterpret_cast<byte*>(sim_->get_pc()));
+              dasm.InstructionDecode(
+                  buffer, reinterpret_cast<uint8_t*>(sim_->get_pc()));
               PrintF("  0x%08" V8PRIxPTR "  %s\n", sim_->get_pc(),
                      buffer.begin());
               sim_->ExecuteInstruction(
@@ -256,8 +258,8 @@ void S390Debugger::Debug() {
             // Otherwise treat it as the mnemonic of the opcode to stop at.
             char mnemonic[256];
             while (!sim_->has_bad_pc()) {
-              dasm.InstructionDecode(buffer,
-                                     reinterpret_cast<byte*>(sim_->get_pc()));
+              dasm.InstructionDecode(
+                  buffer, reinterpret_cast<uint8_t*>(sim_->get_pc()));
               char* mnemonicStart = buffer.begin();
               while (*mnemonicStart != 0 && *mnemonicStart != ' ')
                 mnemonicStart++;
@@ -368,10 +370,10 @@ void S390Debugger::Debug() {
           intptr_t value;
           StdoutStream os;
           if (GetValue(arg1, &value)) {
-            Object obj(value);
+            Tagged<Object> obj(value);
             os << arg1 << ": \n";
 #ifdef DEBUG
-            obj.Print(os);
+            Print(obj, os);
             os << "\n";
 #else
             os << Brief(obj) << "\n";
@@ -422,14 +424,14 @@ void S390Debugger::Debug() {
         while (cur < end) {
           PrintF("  0x%08" V8PRIxPTR ":  0x%08" V8PRIxPTR " %10" V8PRIdPTR,
                  reinterpret_cast<intptr_t>(cur), *cur, *cur);
-          Object obj(*cur);
+          Tagged<Object> obj(*cur);
           Heap* current_heap = sim_->isolate_->heap();
           if (!skip_obj_print) {
-            if (obj.IsSmi()) {
+            if (IsSmi(obj)) {
               PrintF(" (smi %d)", Smi::ToInt(obj));
             } else if (IsValidHeapObject(current_heap, HeapObject::cast(obj))) {
               PrintF(" (");
-              obj.ShortPrint();
+              ShortPrint(obj);
               PrintF(")");
             }
             PrintF("\n");
@@ -442,26 +444,26 @@ void S390Debugger::Debug() {
         // use a reasonably large buffer
         v8::base::EmbeddedVector<char, 256> buffer;
 
-        byte* prev = nullptr;
-        byte* cur = nullptr;
+        uint8_t* prev = nullptr;
+        uint8_t* cur = nullptr;
         // Default number of instructions to disassemble.
         int32_t numInstructions = 10;
 
         if (argc == 1) {
-          cur = reinterpret_cast<byte*>(sim_->get_pc());
+          cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
         } else if (argc == 2) {
           int regnum = Registers::Number(arg1);
           if (regnum != kNoRegister || strncmp(arg1, "0x", 2) == 0) {
             // The argument is an address or a register name.
             intptr_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(value);
+              cur = reinterpret_cast<uint8_t*>(value);
             }
           } else {
             // The argument is the number of instructions.
             intptr_t value;
             if (GetValue(arg1, &value)) {
-              cur = reinterpret_cast<byte*>(sim_->get_pc());
+              cur = reinterpret_cast<uint8_t*>(sim_->get_pc());
               // Disassemble <arg1> instructions.
               numInstructions = static_cast<int32_t>(value);
             }
@@ -470,7 +472,7 @@ void S390Debugger::Debug() {
           intptr_t value1;
           intptr_t value2;
           if (GetValue(arg1, &value1) && GetValue(arg2, &value2)) {
-            cur = reinterpret_cast<byte*>(value1);
+            cur = reinterpret_cast<uint8_t*>(value1);
             // Disassemble <arg2> instructions.
             numInstructions = static_cast<int32_t>(value2);
           }
@@ -1578,13 +1580,7 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   base::CallOnce(&once, &Simulator::EvalTableInit);
 // Set up simulator support first. Some of this information is needed to
 // setup the architecture state.
-#if V8_TARGET_ARCH_S390X
-  size_t stack_size = v8_flags.sim_stack_size * KB;
-#else
-  size_t stack_size = MB;  // allocate 1MB for stack
-#endif
-  stack_size += 2 * stack_protection_size_;
-  stack_ = reinterpret_cast<char*>(base::Malloc(stack_size));
+  stack_ = reinterpret_cast<uint8_t*>(base::Malloc(AllocatedStackSize()));
   pc_modified_ = false;
   icount_ = 0;
   break_pc_ = nullptr;
@@ -1613,8 +1609,7 @@ Simulator::Simulator(Isolate* isolate) : isolate_(isolate) {
   // The sp is initialized to point to the bottom (high address) of the
   // allocated stack area. To be safe in potential stack underflows we leave
   // some buffer below.
-  registers_[sp] =
-      reinterpret_cast<intptr_t>(stack_) + stack_size - stack_protection_size_;
+  registers_[sp] = reinterpret_cast<intptr_t>(stack_) + UsableStackSize();
 
   last_debugger_input_ = nullptr;
 }
@@ -1889,7 +1884,14 @@ uintptr_t Simulator::StackLimit(uintptr_t c_limit) const {
 
   // Otherwise the limit is the JS stack. Leave a safety margin to prevent
   // overrunning the stack when pushing values.
-  return reinterpret_cast<uintptr_t>(stack_) + stack_protection_size_;
+  return reinterpret_cast<uintptr_t>(stack_) + kStackProtectionSize;
+}
+
+base::Vector<uint8_t> Simulator::GetCurrentStackView() const {
+  // We do not add an additional safety margin as above in
+  // Simulator::StackLimit, as this is currently only used in wasm::StackMemory,
+  // which adds its own margin.
+  return base::VectorOf(stack_, UsableStackSize());
 }
 
 // Unsupported instructions use Format to print an error and stop execution.
@@ -1960,16 +1962,16 @@ using SimulatorRuntimeCompareCall = int (*)(double darg0, double darg1);
 using SimulatorRuntimeFPFPCall = double (*)(double darg0, double darg1);
 using SimulatorRuntimeFPCall = double (*)(double darg0);
 using SimulatorRuntimeFPIntCall = double (*)(double darg0, intptr_t arg0);
+// Define four args for future flexibility; at the time of this writing only
+// one is ever used.
+using SimulatorRuntimeFPTaggedCall = double (*)(int32_t arg0, int32_t arg1,
+                                                int32_t arg2, int32_t arg3);
 
 // This signature supports direct call in to API function native callback
 // (refer to InvocationCallback in v8.h).
 using SimulatorRuntimeDirectApiCall = void (*)(intptr_t arg0);
-using SimulatorRuntimeProfilingApiCall = void (*)(intptr_t arg0, void* arg1);
-
 // This signature supports direct call to accessor getter callback.
 using SimulatorRuntimeDirectGetterCall = void (*)(intptr_t arg0, intptr_t arg1);
-using SimulatorRuntimeProfilingGetterCall = void (*)(intptr_t arg0,
-                                                     intptr_t arg1, void* arg2);
 
 // Software interrupt instructions are used by the simulator to call into the
 // C-based V8 runtime.
@@ -2088,7 +2090,7 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           default:
             UNREACHABLE();
         }
-        if (v8_flags.trace_sim || !stack_aligned) {
+        if (v8_flags.trace_sim) {
           switch (redirection->type()) {
             case ExternalReference::BUILTIN_COMPARE_CALL:
               PrintF("Returned %08x\n", iresult);
@@ -2102,29 +2104,35 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
               UNREACHABLE();
           }
         }
-      } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
-        // See callers of MacroAssembler::CallApiFunctionAndReturn for
-        // explanation of register usage.
+      } else if (redirection->type() ==
+                 ExternalReference::BUILTIN_FP_POINTER_CALL) {
         if (v8_flags.trace_sim || !stack_aligned) {
           PrintF("Call to host function at %p args %08" V8PRIxPTR,
                  reinterpret_cast<void*>(external), arg[0]);
           if (!stack_aligned) {
             PrintF(" with unaligned stack %08" V8PRIxPTR "\n",
-                   static_cast<intptr_t>(get_register(sp)));
+                   get_register(sp));
           }
           PrintF("\n");
         }
         CHECK(stack_aligned);
-        SimulatorRuntimeDirectApiCall target =
-            reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
-        target(arg[0]);
-      } else if (redirection->type() == ExternalReference::PROFILING_API_CALL) {
+        SimulatorRuntimeFPTaggedCall target =
+            reinterpret_cast<SimulatorRuntimeFPTaggedCall>(external);
+        double dresult = target(arg[0], arg[1], arg[2], arg[3]);
+#ifdef DEBUG
+        TrashCallerSaveRegisters();
+#endif
+        SetFpResult(dresult);
+        if (v8_flags.trace_sim) {
+          PrintF("Returned %f\n", dresult);
+        }
+      } else if (redirection->type() == ExternalReference::DIRECT_API_CALL) {
         // See callers of MacroAssembler::CallApiFunctionAndReturn for
         // explanation of register usage.
+        // void f(v8::FunctionCallbackInfo&)
         if (v8_flags.trace_sim || !stack_aligned) {
-          PrintF("Call to host function at %p args %08" V8PRIxPTR
-                 " %08" V8PRIxPTR,
-                 reinterpret_cast<void*>(external), arg[0], arg[1]);
+          PrintF("Call to host function at %p args %08" V8PRIxPTR,
+                 reinterpret_cast<void*>(external), arg[0]);
           if (!stack_aligned) {
             PrintF(" with unaligned stack %08" V8PRIxPTR "\n",
                    static_cast<intptr_t>(get_register(sp)));
@@ -2132,12 +2140,13 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           PrintF("\n");
         }
         CHECK(stack_aligned);
-        SimulatorRuntimeProfilingApiCall target =
-            reinterpret_cast<SimulatorRuntimeProfilingApiCall>(external);
-        target(arg[0], Redirection::UnwrapRedirection(arg[1]));
+        SimulatorRuntimeDirectApiCall target =
+            reinterpret_cast<SimulatorRuntimeDirectApiCall>(external);
+        target(arg[0]);
       } else if (redirection->type() == ExternalReference::DIRECT_GETTER_CALL) {
         // See callers of MacroAssembler::CallApiFunctionAndReturn for
         // explanation of register usage.
+        // void f(v8::Local<String> property, v8::PropertyCallbackInfo& info)
         if (v8_flags.trace_sim || !stack_aligned) {
           PrintF("Call to host function at %p args %08" V8PRIxPTR
                  " %08" V8PRIxPTR,
@@ -2155,25 +2164,6 @@ void Simulator::SoftwareInterrupt(Instruction* instr) {
           arg[0] = base::bit_cast<intptr_t>(arg[0]);
         }
         target(arg[0], arg[1]);
-      } else if (redirection->type() ==
-                 ExternalReference::PROFILING_GETTER_CALL) {
-        if (v8_flags.trace_sim || !stack_aligned) {
-          PrintF("Call to host function at %p args %08" V8PRIxPTR
-                 " %08" V8PRIxPTR " %08" V8PRIxPTR,
-                 reinterpret_cast<void*>(external), arg[0], arg[1], arg[2]);
-          if (!stack_aligned) {
-            PrintF(" with unaligned stack %08" V8PRIxPTR "\n",
-                   static_cast<intptr_t>(get_register(sp)));
-          }
-          PrintF("\n");
-        }
-        CHECK(stack_aligned);
-        SimulatorRuntimeProfilingGetterCall target =
-            reinterpret_cast<SimulatorRuntimeProfilingGetterCall>(external);
-        if (!ABI_PASSES_HANDLES_IN_REGS) {
-          arg[0] = base::bit_cast<intptr_t>(arg[0]);
-        }
-        target(arg[0], arg[1], Redirection::UnwrapRedirection(arg[2]));
       } else {
         // builtin call.
         if (v8_flags.trace_sim || !stack_aligned) {
@@ -2456,7 +2446,7 @@ void Simulator::ExecuteInstruction(Instruction* instr, bool auto_incr_pc) {
     disasm::Disassembler dasm(converter);
     // use a reasonably large buffer
     v8::base::EmbeddedVector<char, 256> buffer;
-    dasm.InstructionDecode(buffer, reinterpret_cast<byte*>(instr));
+    dasm.InstructionDecode(buffer, reinterpret_cast<uint8_t*>(instr));
     PrintF("%05" PRId64 "  %08" V8PRIxPTR "  %s\n", icount_,
            reinterpret_cast<intptr_t>(instr), buffer.begin());
 
@@ -5305,16 +5295,16 @@ EVALUATE(EX) {
   int32_t r1_val = get_low_register<int32_t>(r1);
 
   SixByteInstr the_instr = Instruction::InstructionBits(
-      reinterpret_cast<const byte*>(b2_val + x2_val + d2_val));
+      reinterpret_cast<const uint8_t*>(b2_val + x2_val + d2_val));
   int inst_length = Instruction::InstructionLength(
-      reinterpret_cast<const byte*>(b2_val + x2_val + d2_val));
+      reinterpret_cast<const uint8_t*>(b2_val + x2_val + d2_val));
 
   char new_instr_buf[8];
   char* addr = reinterpret_cast<char*>(&new_instr_buf[0]);
   the_instr |= static_cast<SixByteInstr>(r1_val & 0xFF)
                << (8 * inst_length - 16);
   Instruction::SetInstructionBits<SixByteInstr>(
-      reinterpret_cast<byte*>(addr), static_cast<SixByteInstr>(the_instr));
+      reinterpret_cast<uint8_t*>(addr), static_cast<SixByteInstr>(the_instr));
   ExecuteInstruction(reinterpret_cast<Instruction*>(addr), false);
   return length;
 }
diff --git a/deps/v8/src/execution/s390/simulator-s390.h b/deps/v8/src/execution/s390/simulator-s390.h
index b7ccf1007cd7ab..51af2a97216fcf 100644
--- a/deps/v8/src/execution/s390/simulator-s390.h
+++ b/deps/v8/src/execution/s390/simulator-s390.h
@@ -160,8 +160,12 @@ class Simulator : public SimulatorBase {
 
   Address get_sp() const { return static_cast<Address>(get_register(sp)); }
 
-  // Accessor to the internal simulator stack area.
+  // Accessor to the internal simulator stack area. Adds a safety
+  // margin to prevent overflows.
   uintptr_t StackLimit(uintptr_t c_limit) const;
+  // Return current stack view, without additional safety margins.
+  // Users, for example wasm::StackMemory, can add their own.
+  base::Vector<uint8_t> GetCurrentStackView() const;
 
   // Executes S390 instructions until the PC reaches end_sim_pc.
   void Execute();
@@ -418,8 +422,20 @@ class Simulator : public SimulatorBase {
   intptr_t special_reg_pc_;
 
   // Simulator support.
-  char* stack_;
-  static const size_t stack_protection_size_ = 256 * kSystemPointerSize;
+  uint8_t* stack_;
+  static const size_t kStackProtectionSize = 256 * kSystemPointerSize;
+  // This includes a protection margin at each end of the stack area.
+  static size_t AllocatedStackSize() {
+#if V8_TARGET_ARCH_S390X
+    size_t stack_size = v8_flags.sim_stack_size * KB;
+#else
+    size_t stack_size = MB;  // allocate 1MB for stack
+#endif
+    return stack_size + (2 * kStackProtectionSize);
+  }
+  static size_t UsableStackSize() {
+    return AllocatedStackSize() - kStackProtectionSize;
+  }
   bool pc_modified_;
   int64_t icount_;
 
diff --git a/deps/v8/src/execution/simulator.h b/deps/v8/src/execution/simulator.h
index c685609e3da972..07495a148eca0b 100644
--- a/deps/v8/src/execution/simulator.h
+++ b/deps/v8/src/execution/simulator.h
@@ -9,6 +9,8 @@
 #include "src/objects/code.h"
 
 #if !defined(USE_SIMULATOR)
+#include "src/base/platform/platform.h"
+#include "src/execution/isolate.h"
 #include "src/utils/utils.h"
 #endif
 
@@ -49,6 +51,15 @@ class SimulatorStack : public v8::internal::AllStatic {
     return Simulator::current(isolate)->StackLimit(c_limit);
   }
 
+  static inline base::Vector<uint8_t> GetCurrentStackView(
+      v8::internal::Isolate* isolate) {
+    return Simulator::current(isolate)->GetCurrentStackView();
+  }
+
+  // When running on the simulator, we should leave the C stack limits alone
+  // when switching stacks for Wasm.
+  static inline bool ShouldSwitchCStackForWasmStackSwitching() { return false; }
+
   // Returns the current stack address on the simulator stack frame.
   // The returned address is comparable with JS stack address.
   static inline uintptr_t RegisterJSStackComparableAddress(
@@ -79,6 +90,19 @@ class SimulatorStack : public v8::internal::AllStatic {
     return c_limit;
   }
 
+  static inline base::Vector<uint8_t> GetCurrentStackView(
+      v8::internal::Isolate* isolate) {
+    uintptr_t limit = isolate->stack_guard()->real_jslimit();
+    uintptr_t stack_start = base::Stack::GetStackStart();
+    DCHECK_LE(limit, stack_start);
+    size_t size = stack_start - limit;
+    return base::VectorOf(reinterpret_cast<uint8_t*>(limit), size);
+  }
+
+  // When running on real hardware, we should also switch the C stack limit
+  // when switching stacks for Wasm.
+  static inline bool ShouldSwitchCStackForWasmStackSwitching() { return true; }
+
   // Returns the current stack address on the native stack frame.
   // The returned address is comparable with JS stack address.
   static inline uintptr_t RegisterJSStackComparableAddress(
@@ -106,12 +130,12 @@ class GeneratedCode {
     return GeneratedCode(isolate, reinterpret_cast<Signature*>(addr));
   }
 
-  static GeneratedCode FromBuffer(Isolate* isolate, byte* buffer) {
+  static GeneratedCode FromBuffer(Isolate* isolate, uint8_t* buffer) {
     return GeneratedCode(isolate, reinterpret_cast<Signature*>(buffer));
   }
 
-  static GeneratedCode FromCode(Isolate* isolate, Code code) {
-    return FromAddress(isolate, code.InstructionStart());
+  static GeneratedCode FromCode(Isolate* isolate, Tagged<Code> code) {
+    return FromAddress(isolate, code->instruction_start());
   }
 
 #ifdef USE_SIMULATOR
diff --git a/deps/v8/src/execution/stack-guard.cc b/deps/v8/src/execution/stack-guard.cc
index ff64beb8b22cc9..563916a4e96c35 100644
--- a/deps/v8/src/execution/stack-guard.cc
+++ b/deps/v8/src/execution/stack-guard.cc
@@ -8,6 +8,7 @@
 #include "src/compiler-dispatcher/optimizing-compile-dispatcher.h"
 #include "src/execution/interrupts-scope.h"
 #include "src/execution/isolate.h"
+#include "src/execution/protectors-inl.h"
 #include "src/execution/simulator.h"
 #include "src/logging/counters.h"
 #include "src/objects/backing-store.h"
@@ -26,23 +27,51 @@
 namespace v8 {
 namespace internal {
 
-void StackGuard::set_interrupt_limits(const ExecutionAccess& lock) {
+void StackGuard::update_interrupt_requests_and_stack_limits(
+    const ExecutionAccess& lock) {
   DCHECK_NOT_NULL(isolate_);
-  thread_local_.set_jslimit(kInterruptLimit);
-  thread_local_.set_climit(kInterruptLimit);
+  if (has_pending_interrupts(lock)) {
+    thread_local_.set_jslimit(kInterruptLimit);
+    thread_local_.set_climit(kInterruptLimit);
+  } else {
+    thread_local_.set_jslimit(thread_local_.real_jslimit_);
+    thread_local_.set_climit(thread_local_.real_climit_);
+  }
+  for (InterruptLevel level :
+       std::array{InterruptLevel::kNoGC, InterruptLevel::kNoHeapWrites,
+                  InterruptLevel::kAnyEffect}) {
+    thread_local_.set_interrupt_requested(
+        level, InterruptLevelMask(level) & thread_local_.interrupt_flags_);
+  }
 }
 
-void StackGuard::reset_limits(const ExecutionAccess& lock) {
-  DCHECK_NOT_NULL(isolate_);
-  thread_local_.set_jslimit(thread_local_.real_jslimit_);
-  thread_local_.set_climit(thread_local_.real_climit_);
+void StackGuard::SetStackLimit(uintptr_t limit) {
+  ExecutionAccess access(isolate_);
+  SetStackLimitInternal(access, limit,
+                        SimulatorStack::JsLimitFromCLimit(isolate_, limit));
 }
 
-void StackGuard::SetStackLimit(uintptr_t limit) {
+void StackGuard::SetStackLimitForStackSwitching(uintptr_t limit) {
   ExecutionAccess access(isolate_);
+  uintptr_t climit = SimulatorStack::ShouldSwitchCStackForWasmStackSwitching()
+                         ? limit
+                         : thread_local_.real_climit_;
+  SetStackLimitInternal(access, climit, limit);
+}
+
+void StackGuard::SetStackLimitInternal(const ExecutionAccess& lock,
+                                       uintptr_t limit, uintptr_t jslimit) {
+  // If secondary stack SP is not 0, it means we are currently switching
+  // to the central stack from a secondary stack.
+  if (isolate_->thread_local_top()->secondary_stack_sp_ != 0) {
+    DCHECK(isolate_->thread_local_top()->is_on_central_stack_flag_);
+    // Update only logical stack limit here.
+    // It will be synchronized on the exit from CEntry.
+    isolate_->thread_local_top()->secondary_stack_limit_ = jslimit;
+    return;
+  }
   // If the current limits are special (e.g. due to a pending interrupt) then
   // leave them alone.
-  uintptr_t jslimit = SimulatorStack::JsLimitFromCLimit(isolate_, limit);
   if (thread_local_.jslimit() == thread_local_.real_jslimit_) {
     thread_local_.set_jslimit(jslimit);
   }
@@ -64,18 +93,6 @@ void StackGuard::AdjustStackLimitForSimulator() {
   }
 }
 
-void StackGuard::EnableInterrupts() {
-  ExecutionAccess access(isolate_);
-  if (has_pending_interrupts(access)) {
-    set_interrupt_limits(access);
-  }
-}
-
-void StackGuard::DisableInterrupts() {
-  ExecutionAccess access(isolate_);
-  reset_limits(access);
-}
-
 void StackGuard::PushInterruptsScope(InterruptsScope* scope) {
   ExecutionAccess access(isolate_);
   DCHECK_NE(scope->mode_, InterruptsScope::kNoop);
@@ -95,10 +112,8 @@ void StackGuard::PushInterruptsScope(InterruptsScope* scope) {
       current->intercepted_flags_ &= ~scope->intercept_mask_;
     }
     thread_local_.interrupt_flags_ |= restored_flags;
-
-    if (has_pending_interrupts(access)) set_interrupt_limits(access);
   }
-  if (!has_pending_interrupts(access)) reset_limits(access);
+  update_interrupt_requests_and_stack_limits(access);
   // Add scope to the chain.
   scope->prev_ = thread_local_.interrupt_scopes_;
   thread_local_.interrupt_scopes_ = scope;
@@ -126,7 +141,7 @@ void StackGuard::PopInterruptsScope() {
       }
     }
   }
-  if (has_pending_interrupts(access)) set_interrupt_limits(access);
+  update_interrupt_requests_and_stack_limits(access);
   // Remove scope from chain.
   thread_local_.interrupt_scopes_ = top->prev_;
 }
@@ -146,7 +161,7 @@ void StackGuard::RequestInterrupt(InterruptFlag flag) {
 
   // Not intercepted.  Set as active interrupt flag.
   thread_local_.interrupt_flags_ |= flag;
-  set_interrupt_limits(access);
+  update_interrupt_requests_and_stack_limits(access);
 
   // If this isolate is waiting in a futex, notify it to wake up.
   isolate_->futex_wait_list_node()->NotifyWake();
@@ -162,37 +177,36 @@ void StackGuard::ClearInterrupt(InterruptFlag flag) {
 
   // Clear the interrupt flag from the active interrupt flags.
   thread_local_.interrupt_flags_ &= ~flag;
-  if (!has_pending_interrupts(access)) reset_limits(access);
+  update_interrupt_requests_and_stack_limits(access);
 }
 
 bool StackGuard::HasTerminationRequest() {
+  if (!thread_local_.has_interrupt_requested(InterruptLevel::kNoGC)) {
+    return false;
+  }
   ExecutionAccess access(isolate_);
   if ((thread_local_.interrupt_flags_ & TERMINATE_EXECUTION) != 0) {
     thread_local_.interrupt_flags_ &= ~TERMINATE_EXECUTION;
-    if (!has_pending_interrupts(access)) reset_limits(access);
+    update_interrupt_requests_and_stack_limits(access);
     return true;
   }
   return false;
 }
 
-int StackGuard::FetchAndClearInterrupts() {
+int StackGuard::FetchAndClearInterrupts(InterruptLevel level) {
   ExecutionAccess access(isolate_);
-
-  int result = 0;
+  InterruptFlag mask = InterruptLevelMask(level);
   if ((thread_local_.interrupt_flags_ & TERMINATE_EXECUTION) != 0) {
     // The TERMINATE_EXECUTION interrupt is special, since it terminates
     // execution but should leave V8 in a resumable state. If it exists, we only
     // fetch and clear that bit. On resume, V8 can continue processing other
     // interrupts.
-    result = TERMINATE_EXECUTION;
-    thread_local_.interrupt_flags_ &= ~TERMINATE_EXECUTION;
-    if (!has_pending_interrupts(access)) reset_limits(access);
-  } else {
-    result = static_cast<int>(thread_local_.interrupt_flags_);
-    thread_local_.interrupt_flags_ = 0;
-    reset_limits(access);
+    mask = TERMINATE_EXECUTION;
   }
 
+  int result = static_cast<int>(thread_local_.interrupt_flags_ & mask);
+  thread_local_.interrupt_flags_ &= ~mask;
+  update_interrupt_requests_and_stack_limits(access);
   return result;
 }
 
@@ -264,7 +278,7 @@ class V8_NODISCARD ShouldBeZeroOnReturnScope final {
 
 }  // namespace
 
-Object StackGuard::HandleInterrupts() {
+Tagged<Object> StackGuard::HandleInterrupts(InterruptLevel level) {
   TRACE_EVENT0("v8.execute", "V8.HandleInterrupts");
 
 #if DEBUG
@@ -278,7 +292,7 @@ Object StackGuard::HandleInterrupts() {
 
   // Fetch and clear interrupt bits in one go. See comments inside the method
   // for special handling of TERMINATE_EXECUTION.
-  int interrupt_flags = FetchAndClearInterrupts();
+  int interrupt_flags = FetchAndClearInterrupts(level);
 
   // All interrupts should be fully processed when returning from this method.
   ShouldBeZeroOnReturnScope should_be_zero_on_return(&interrupt_flags);
@@ -293,6 +307,10 @@ Object StackGuard::HandleInterrupts() {
     isolate_->heap()->HandleGCRequest();
   }
 
+  if (TestAndClear(&interrupt_flags, START_INCREMENTAL_MARKING)) {
+    isolate_->heap()->StartIncrementalMarkingOnInterrupt();
+  }
+
   if (TestAndClear(&interrupt_flags, GLOBAL_SAFEPOINT)) {
     TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"), "V8.GlobalSafepoint");
     isolate_->main_thread_local_heap()->Safepoint();
@@ -348,6 +366,16 @@ Object StackGuard::HandleInterrupts() {
     isolate_->InvokeApiInterruptCallbacks();
   }
 
+#ifdef V8_RUNTIME_CALL_STATS
+  // Runtime call stats can be enabled at any via Chrome tracing and since
+  // there's no global list of active Isolates this seems to be the only
+  // simple way to invalidate the protector.
+  if (TracingFlags::is_runtime_stats_enabled() &&
+      Protectors::IsNoProfilingIntact(isolate_)) {
+    Protectors::InvalidateNoProfiling(isolate_);
+  }
+#endif
+
   isolate_->counters()->stack_interrupts()->Increment();
 
   return ReadOnlyRoots(isolate_).undefined_value();
diff --git a/deps/v8/src/execution/stack-guard.h b/deps/v8/src/execution/stack-guard.h
index 8cdf755c0d29bf..1f1fcc190ee188 100644
--- a/deps/v8/src/execution/stack-guard.h
+++ b/deps/v8/src/execution/stack-guard.h
@@ -28,10 +28,18 @@ class V8_EXPORT_PRIVATE V8_NODISCARD StackGuard final {
 
   explicit StackGuard(Isolate* isolate) : isolate_(isolate) {}
 
-  // Pass the address beyond which the stack should not grow.  The stack
+  // Pass the address beyond which the stack should not grow. The stack
   // is assumed to grow downwards.
+  // When executing on the simulator, we set the stack limits to the limits of
+  // the simulator's stack instead of using {limit}.
   void SetStackLimit(uintptr_t limit);
 
+  // Similar to the method above, with one important difference: With Wasm
+  // stack switching, we always want to switch to {limit}, even when running on
+  // the simulator, since we might be switching to a Wasm continuation that's
+  // not on the main stack.
+  void SetStackLimitForStackSwitching(uintptr_t limit);
+
   // The simulator uses a separate JS stack. Limits on the JS stack might have
   // to be adjusted in order to reflect overflows of the C stack, because we
   // cannot rely on the interleaving of frames on the simulator.
@@ -45,20 +53,32 @@ class V8_EXPORT_PRIVATE V8_NODISCARD StackGuard final {
   // Sets up the default stack guard for this thread.
   void InitThread(const ExecutionAccess& lock);
 
-#define INTERRUPT_LIST(V)                                         \
-  V(TERMINATE_EXECUTION, TerminateExecution, 0)                   \
-  V(GC_REQUEST, GC, 1)                                            \
-  V(INSTALL_CODE, InstallCode, 2)                                 \
-  V(INSTALL_BASELINE_CODE, InstallBaselineCode, 3)                \
-  V(API_INTERRUPT, ApiInterrupt, 4)                               \
-  V(DEOPT_MARKED_ALLOCATION_SITES, DeoptMarkedAllocationSites, 5) \
-  V(GROW_SHARED_MEMORY, GrowSharedMemory, 6)                      \
-  V(LOG_WASM_CODE, LogWasmCode, 7)                                \
-  V(WASM_CODE_GC, WasmCodeGC, 8)                                  \
-  V(INSTALL_MAGLEV_CODE, InstallMaglevCode, 9)                    \
-  V(GLOBAL_SAFEPOINT, GlobalSafepoint, 10)
-
-#define V(NAME, Name, id)                                    \
+  // Code locations that check for interrupts might only handle a subset of the
+  // available interrupts, expressed as an `InterruptLevel`. These levels are
+  // also associated with side effects that are allowed for the respective
+  // level. The levels are inclusive, which is specified using the order in the
+  // enum. For example, a site that handles `kAnyEffect` will also handle the
+  // preceding levels.
+  enum class InterruptLevel { kNoGC, kNoHeapWrites, kAnyEffect };
+  static constexpr int kNumberOfInterruptLevels = 3;
+
+#define INTERRUPT_LIST(V)                                                      \
+  V(TERMINATE_EXECUTION, TerminateExecution, 0, InterruptLevel::kNoGC)         \
+  V(GC_REQUEST, GC, 1, InterruptLevel::kNoHeapWrites)                          \
+  V(INSTALL_CODE, InstallCode, 2, InterruptLevel::kAnyEffect)                  \
+  V(INSTALL_BASELINE_CODE, InstallBaselineCode, 3, InterruptLevel::kAnyEffect) \
+  V(API_INTERRUPT, ApiInterrupt, 4, InterruptLevel::kNoHeapWrites)             \
+  V(DEOPT_MARKED_ALLOCATION_SITES, DeoptMarkedAllocationSites, 5,              \
+    InterruptLevel::kNoHeapWrites)                                             \
+  V(GROW_SHARED_MEMORY, GrowSharedMemory, 6, InterruptLevel::kAnyEffect)       \
+  V(LOG_WASM_CODE, LogWasmCode, 7, InterruptLevel::kAnyEffect)                 \
+  V(WASM_CODE_GC, WasmCodeGC, 8, InterruptLevel::kNoHeapWrites)                \
+  V(INSTALL_MAGLEV_CODE, InstallMaglevCode, 9, InterruptLevel::kAnyEffect)     \
+  V(GLOBAL_SAFEPOINT, GlobalSafepoint, 10, InterruptLevel::kNoHeapWrites)      \
+  V(START_INCREMENTAL_MARKING, StartIncrementalMarking, 11,                    \
+    InterruptLevel::kNoHeapWrites)
+
+#define V(NAME, Name, id, interrupt_level)                   \
   inline bool Check##Name() { return CheckInterrupt(NAME); } \
   inline void Request##Name() { RequestInterrupt(NAME); }    \
   inline void Clear##Name() { ClearInterrupt(NAME); }
@@ -67,16 +87,23 @@ class V8_EXPORT_PRIVATE V8_NODISCARD StackGuard final {
 
   // Flag used to set the interrupt causes.
   enum InterruptFlag : uint32_t {
-#define V(NAME, Name, id) NAME = (1 << id),
+#define V(NAME, Name, id, interrupt_level) NAME = (1 << id),
     INTERRUPT_LIST(V)
 #undef V
-#define V(NAME, Name, id) NAME |
+#define V(NAME, Name, id, interrupt_level) NAME |
         ALL_INTERRUPTS = INTERRUPT_LIST(V) 0
 #undef V
   };
   static_assert(InterruptFlag::ALL_INTERRUPTS <
                 std::numeric_limits<uint32_t>::max());
 
+  static constexpr InterruptFlag InterruptLevelMask(InterruptLevel level) {
+#define V(NAME, Name, id, interrupt_level) \
+  | (interrupt_level <= level ? NAME : 0)
+    return static_cast<InterruptFlag>(0 INTERRUPT_LIST(V));
+#undef V
+  }
+
   uintptr_t climit() { return thread_local_.climit(); }
   uintptr_t jslimit() { return thread_local_.jslimit(); }
   // This provides an asynchronous read of the stack limits for the current
@@ -90,17 +117,24 @@ class V8_EXPORT_PRIVATE V8_NODISCARD StackGuard final {
   Address address_of_real_jslimit() {
     return reinterpret_cast<Address>(&thread_local_.real_jslimit_);
   }
+  Address address_of_interrupt_request(InterruptLevel level) {
+    return reinterpret_cast<Address>(
+        &thread_local_.interrupt_requested_[static_cast<int>(level)]);
+  }
 
   // If the stack guard is triggered, but it is not an actual
   // stack overflow, then handle the interruption accordingly.
-  Object HandleInterrupts();
+  // Only interrupts that match the given `InterruptLevel` will be handled,
+  // leaving other interrupts pending as if this method had not been called.
+  Tagged<Object> HandleInterrupts(
+      InterruptLevel level = InterruptLevel::kAnyEffect);
 
   // Special case of {HandleInterrupts}: checks for termination requests only.
   // This is guaranteed to never cause GC, so can be used to interrupt
   // long-running computations that are not GC-safe.
   bool HasTerminationRequest();
 
-  static constexpr int kSizeInBytes = 7 * kSystemPointerSize;
+  static constexpr int kSizeInBytes = 8 * kSystemPointerSize;
 
   static char* Iterate(RootVisitor* v, char* thread_storage) {
     return thread_storage + ArchiveSpacePerThread();
@@ -110,7 +144,10 @@ class V8_EXPORT_PRIVATE V8_NODISCARD StackGuard final {
   bool CheckInterrupt(InterruptFlag flag);
   void RequestInterrupt(InterruptFlag flag);
   void ClearInterrupt(InterruptFlag flag);
-  int FetchAndClearInterrupts();
+  int FetchAndClearInterrupts(InterruptLevel level);
+
+  void SetStackLimitInternal(const ExecutionAccess& lock, uintptr_t limit,
+                             uintptr_t jslimit);
 
   // You should hold the ExecutionAccess lock when calling this method.
   bool has_pending_interrupts(const ExecutionAccess& lock) {
@@ -118,15 +155,8 @@ class V8_EXPORT_PRIVATE V8_NODISCARD StackGuard final {
   }
 
   // You should hold the ExecutionAccess lock when calling this method.
-  inline void set_interrupt_limits(const ExecutionAccess& lock);
-
-  // Reset limits to actual values. For example after handling interrupt.
-  // You should hold the ExecutionAccess lock when calling this method.
-  inline void reset_limits(const ExecutionAccess& lock);
-
-  // Enable or disable interrupts.
-  void EnableInterrupts();
-  void DisableInterrupts();
+  inline void update_interrupt_requests_and_stack_limits(
+      const ExecutionAccess& lock);
 
 #if V8_TARGET_ARCH_64_BIT
   static const uintptr_t kInterruptLimit = uintptr_t{0xfffffffffffffffe};
@@ -180,6 +210,20 @@ class V8_EXPORT_PRIVATE V8_NODISCARD StackGuard final {
                                  static_cast<base::AtomicWord>(limit));
     }
 
+    // Interrupt request bytes can be read without any lock.
+    // Writing requires the ExecutionAccess lock.
+    base::Atomic8 interrupt_requested_[kNumberOfInterruptLevels] = {
+        false, false, false};
+
+    void set_interrupt_requested(InterruptLevel level, bool requested) {
+      base::Relaxed_Store(&interrupt_requested_[static_cast<int>(level)],
+                          requested);
+    }
+
+    bool has_interrupt_requested(InterruptLevel level) {
+      return base::Relaxed_Load(&interrupt_requested_[static_cast<int>(level)]);
+    }
+
     InterruptsScope* interrupt_scopes_ = nullptr;
     uint32_t interrupt_flags_ = 0;
   };
diff --git a/deps/v8/src/execution/thread-local-top.cc b/deps/v8/src/execution/thread-local-top.cc
index 05cc20b8e480f8..eb3ea9b36f1977 100644
--- a/deps/v8/src/execution/thread-local-top.cc
+++ b/deps/v8/src/execution/thread-local-top.cc
@@ -5,6 +5,7 @@
 #include "src/execution/thread-local-top.h"
 #include "src/execution/isolate.h"
 #include "src/execution/simulator.h"
+#include "src/base/sanitizer/msan.h"
 
 #if V8_ENABLE_WEBASSEMBLY
 #include "src/trap-handler/trap-handler.h"
@@ -37,6 +38,11 @@ void ThreadLocalTop::Clear() {
   current_embedder_state_ = nullptr;
   failed_access_check_callback_ = nullptr;
   thread_in_wasm_flag_address_ = kNullAddress;
+  is_on_central_stack_flag_ = true;
+  central_stack_sp_ = kNullAddress;
+  central_stack_limit_ = kNullAddress;
+  secondary_stack_sp_ = kNullAddress;
+  secondary_stack_limit_ = kNullAddress;
 }
 
 void ThreadLocalTop::Initialize(Isolate* isolate) {
@@ -46,6 +52,7 @@ void ThreadLocalTop::Initialize(Isolate* isolate) {
 #if V8_ENABLE_WEBASSEMBLY
   thread_in_wasm_flag_address_ = reinterpret_cast<Address>(
       trap_handler::GetThreadInWasmThreadLocalAddress());
+  is_on_central_stack_flag_ = true;
 #endif  // V8_ENABLE_WEBASSEMBLY
 #ifdef USE_SIMULATOR
   simulator_ = Simulator::current(isolate);
diff --git a/deps/v8/src/execution/thread-local-top.h b/deps/v8/src/execution/thread-local-top.h
index 989c817f318ff3..15a0f64f94e77e 100644
--- a/deps/v8/src/execution/thread-local-top.h
+++ b/deps/v8/src/execution/thread-local-top.h
@@ -29,7 +29,7 @@ class ThreadLocalTop {
   // TODO(all): This is not particularly beautiful. We should probably
   // refactor this to really consist of just Addresses and 32-bit
   // integer fields.
-  static constexpr uint32_t kSizeInBytes = 25 * kSystemPointerSize;
+  static constexpr uint32_t kSizeInBytes = 30 * kSystemPointerSize;
 
   // Does early low-level initialization that does not depend on the
   // isolate being present.
@@ -146,8 +146,25 @@ class ThreadLocalTop {
 
   // Address of the thread-local "thread in wasm" flag.
   Address thread_in_wasm_flag_address_;
+
+  // Wasm Stack Switching: The central stack.
+  // If set, then we are currently executing code on the central stack.
+  bool is_on_central_stack_flag_;
+  // On switching from the central stack these fields are set
+  // to the central stack's SP and stack limit accordingly,
+  // to use for switching from secondary stacks.
+  Address central_stack_sp_;
+  Address central_stack_limit_;
+  // On switching to the central stack these fields are set
+  // to the secondary stack's SP and stack limit accordingly.
+  // It is used if we need to check for the stack overflow condition
+  // on the secondary stack, during execution on the central stack.
+  Address secondary_stack_sp_;
+  Address secondary_stack_limit_;
 };
 
+static_assert(ThreadLocalTop::kSizeInBytes == sizeof(ThreadLocalTop));
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/execution/tiering-manager.cc b/deps/v8/src/execution/tiering-manager.cc
index ce51a184f41812..387cc1f09600fb 100644
--- a/deps/v8/src/execution/tiering-manager.cc
+++ b/deps/v8/src/execution/tiering-manager.cc
@@ -28,8 +28,7 @@ namespace internal {
 
 #define OPTIMIZATION_REASON_LIST(V)   \
   V(DoNotOptimize, "do not optimize") \
-  V(HotAndStable, "hot and stable")   \
-  V(SmallFunction, "small function")
+  V(HotAndStable, "hot and stable")
 
 enum class OptimizationReason : uint8_t {
 #define OPTIMIZATION_REASON_CONSTANTS(Constant, message) k##Constant,
@@ -65,10 +64,6 @@ class OptimizationDecision {
     return {OptimizationReason::kHotAndStable, CodeKind::TURBOFAN,
             ConcurrencyMode::kConcurrent};
   }
-  static constexpr OptimizationDecision TurbofanSmallFunction() {
-    return {OptimizationReason::kSmallFunction, CodeKind::TURBOFAN,
-            ConcurrencyMode::kConcurrent};
-  }
   static constexpr OptimizationDecision DoNotOptimize() {
     return {OptimizationReason::kDoNotOptimize,
             // These values don't matter but we have to pass something.
@@ -97,28 +92,30 @@ static_assert(sizeof(OptimizationDecision) <= kInt32Size);
 
 namespace {
 
-void TraceInOptimizationQueue(JSFunction function, CodeKind current_code_kind) {
+void TraceInOptimizationQueue(Tagged<JSFunction> function,
+                              CodeKind current_code_kind) {
   if (v8_flags.trace_opt_verbose) {
     PrintF("[not marking function %s (%s) for optimization: already queued]\n",
-           function.DebugNameCStr().get(), CodeKindToString(current_code_kind));
+           function->DebugNameCStr().get(),
+           CodeKindToString(current_code_kind));
   }
 }
 
-void TraceHeuristicOptimizationDisallowed(JSFunction function) {
+void TraceHeuristicOptimizationDisallowed(Tagged<JSFunction> function) {
   if (v8_flags.trace_opt_verbose) {
     PrintF(
         "[not marking function %s for optimization: marked with "
         "%%PrepareFunctionForOptimization for manual optimization]\n",
-        function.DebugNameCStr().get());
+        function->DebugNameCStr().get());
   }
 }
 
-void TraceRecompile(Isolate* isolate, JSFunction function,
+void TraceRecompile(Isolate* isolate, Tagged<JSFunction> function,
                     OptimizationDecision d) {
   if (v8_flags.trace_opt) {
     CodeTracer::Scope scope(isolate->GetCodeTracer());
     PrintF(scope.file(), "[marking ");
-    function.ShortPrint(scope.file());
+    ShortPrint(function, scope.file());
     PrintF(scope.file(), " for optimization to %s, %s, reason: %s",
            CodeKindToString(d.code_kind), ToString(d.concurrency_mode),
            OptimizationReasonToString(d.optimization_reason));
@@ -128,27 +125,46 @@ void TraceRecompile(Isolate* isolate, JSFunction function,
 
 }  // namespace
 
-void TraceManualRecompile(JSFunction function, CodeKind code_kind,
+void TraceManualRecompile(Tagged<JSFunction> function, CodeKind code_kind,
                           ConcurrencyMode concurrency_mode) {
   if (v8_flags.trace_opt) {
     PrintF("[manually marking ");
-    function.ShortPrint();
+    ShortPrint(function);
     PrintF(" for optimization to %s, %s]\n", CodeKindToString(code_kind),
            ToString(concurrency_mode));
   }
 }
 
-void TieringManager::Optimize(JSFunction function, OptimizationDecision d) {
+void TieringManager::Optimize(Tagged<JSFunction> function,
+                              OptimizationDecision d) {
   DCHECK(d.should_optimize());
   TraceRecompile(isolate_, function, d);
-  function.MarkForOptimization(isolate_, d.code_kind, d.concurrency_mode);
+  function->MarkForOptimization(isolate_, d.code_kind, d.concurrency_mode);
+}
+
+void TieringManager::MarkForTurboFanOptimization(Tagged<JSFunction> function) {
+  Optimize(function, OptimizationDecision::TurbofanHotAndStable());
 }
 
 namespace {
 
+// Returns true when |function| should be enqueued for sparkplug compilation for
+// the first time.
+bool FirstTimeTierUpToSparkplug(Isolate* isolate, Tagged<JSFunction> function) {
+  return !function->has_feedback_vector() ||
+         // We request sparkplug even in the presence of a fbv, if we are
+         // running ignition and haven't enqueued the function for sparkplug
+         // batch compilation yet. This ensures we tier-up to sparkplug when the
+         // feedback vector is allocated eagerly (e.g. for logging function
+         // events; see JSFunction::InitializeFeedbackCell()).
+         (function->ActiveTierIsIgnition() &&
+          CanCompileWithBaseline(isolate, function->shared()) &&
+          !function->shared()->sparkplug_compiled());
+}
+
 bool TiersUpToMaglev(CodeKind code_kind) {
   // TODO(v8:7700): Flip the UNLIKELY when appropriate.
-  return V8_UNLIKELY(v8_flags.maglev) &&
+  return V8_UNLIKELY(maglev::IsMaglevEnabled()) &&
          CodeKindIsUnoptimizedJSFunction(code_kind);
 }
 
@@ -162,90 +178,90 @@ int InterruptBudgetFor(base::Optional<CodeKind> code_kind,
       (code_kind.has_value() && code_kind.value() == CodeKind::TURBOFAN)) {
     return v8_flags.invocation_count_for_osr * bytecode_length;
   }
+  // TODO(olivf) In case we are currently executing below Maglev and have
+  // CodeKind::MAGLEV waiting we should also OSR. But currently we cannot know
+  // if this helper is called from Maglev code or below.
+  if (maglev::IsMaglevOsrEnabled() && IsRequestMaglev(tiering_state)) {
+    return v8_flags.invocation_count_for_maglev_osr * bytecode_length;
+  }
   return TiersUpToMaglev(code_kind) && tiering_state == TieringState::kNone
              ? v8_flags.invocation_count_for_maglev * bytecode_length
-             : v8_flags.interrupt_budget;
+             : v8_flags.invocation_count_for_turbofan * bytecode_length;
 }
 
 }  // namespace
 
 // static
-int TieringManager::InterruptBudgetFor(Isolate* isolate, JSFunction function) {
-  DCHECK(function.shared().is_compiled());
+int TieringManager::InterruptBudgetFor(
+    Isolate* isolate, Tagged<JSFunction> function,
+    base::Optional<CodeKind> override_active_tier) {
+  DCHECK(function->shared()->is_compiled());
   const int bytecode_length =
-      function.shared().GetBytecodeArray(isolate).length();
-  if (function.has_feedback_vector()) {
-    if (bytecode_length > v8_flags.max_optimized_bytecode_size) {
-      // Decrease times of interrupt budget underflow, the reason of not setting
-      // to INT_MAX is the interrupt budget may overflow when doing add
-      // operation for forward jump.
-      return INT_MAX / 2;
-    }
-    return ::i::InterruptBudgetFor(function.GetActiveTier(),
-                                   function.tiering_state(), bytecode_length);
-  }
+      function->shared()->GetBytecodeArray(isolate)->length();
 
-  DCHECK(!function.has_feedback_vector());
-  return bytecode_length *
-         v8_flags.interrupt_budget_factor_for_feedback_allocation;
-}
+  if (FirstTimeTierUpToSparkplug(isolate, function)) {
+    return bytecode_length * v8_flags.invocation_count_for_feedback_allocation;
+  }
 
-// static
-int TieringManager::InitialInterruptBudget() {
-  return V8_LIKELY(v8_flags.lazy_feedback_allocation)
-             ? v8_flags.interrupt_budget_for_feedback_allocation
-             : v8_flags.interrupt_budget;
+  DCHECK(function->has_feedback_vector());
+  if (bytecode_length > v8_flags.max_optimized_bytecode_size) {
+    // Decrease times of interrupt budget underflow, the reason of not setting
+    // to INT_MAX is the interrupt budget may overflow when doing add
+    // operation for forward jump.
+    return INT_MAX / 2;
+  }
+  return ::i::InterruptBudgetFor(
+      override_active_tier ? override_active_tier : function->GetActiveTier(),
+      function->tiering_state(), bytecode_length);
 }
 
 namespace {
 
-void TrySetOsrUrgency(Isolate* isolate, JSFunction function, int osr_urgency) {
-  SharedFunctionInfo shared = function.shared();
+void TrySetOsrUrgency(Isolate* isolate, Tagged<JSFunction> function,
+                      int osr_urgency) {
+  Tagged<SharedFunctionInfo> shared = function->shared();
   if (V8_UNLIKELY(!v8_flags.use_osr)) return;
-  if (V8_UNLIKELY(shared.optimization_disabled())) return;
+  if (V8_UNLIKELY(shared->optimization_disabled())) return;
 
   // We've passed all checks - bump the OSR urgency.
 
-  FeedbackVector fv = function.feedback_vector();
+  Tagged<FeedbackVector> fv = function->feedback_vector();
   if (V8_UNLIKELY(v8_flags.trace_osr)) {
     CodeTracer::Scope scope(isolate->GetCodeTracer());
     PrintF(scope.file(),
            "[OSR - setting osr urgency. function: %s, old urgency: %d, new "
            "urgency: %d]\n",
-           function.DebugNameCStr().get(), fv.osr_urgency(), osr_urgency);
+           function->DebugNameCStr().get(), fv->osr_urgency(), osr_urgency);
   }
 
-  DCHECK_GE(osr_urgency, fv.osr_urgency());  // Never lower urgency here.
-  fv.set_osr_urgency(osr_urgency);
+  DCHECK_GE(osr_urgency, fv->osr_urgency());  // Never lower urgency here.
+  fv->set_osr_urgency(osr_urgency);
 }
 
-void TryIncrementOsrUrgency(Isolate* isolate, JSFunction function) {
-  int old_urgency = function.feedback_vector().osr_urgency();
+void TryIncrementOsrUrgency(Isolate* isolate, Tagged<JSFunction> function) {
+  int old_urgency = function->feedback_vector()->osr_urgency();
   int new_urgency = std::min(old_urgency + 1, FeedbackVector::kMaxOsrUrgency);
   TrySetOsrUrgency(isolate, function, new_urgency);
 }
 
-void TryRequestOsrAtNextOpportunity(Isolate* isolate, JSFunction function) {
+void TryRequestOsrAtNextOpportunity(Isolate* isolate,
+                                    Tagged<JSFunction> function) {
   TrySetOsrUrgency(isolate, function, FeedbackVector::kMaxOsrUrgency);
 }
 
-bool ShouldOptimizeAsSmallFunction(int bytecode_size, bool any_ic_changed) {
-  return !any_ic_changed &&
-         bytecode_size < v8_flags.max_bytecode_size_for_early_opt;
-}
-
 }  // namespace
 
-void TieringManager::RequestOsrAtNextOpportunity(JSFunction function) {
+void TieringManager::RequestOsrAtNextOpportunity(Tagged<JSFunction> function) {
   DisallowGarbageCollection no_gc;
   TryRequestOsrAtNextOpportunity(isolate_, function);
 }
 
-void TieringManager::MaybeOptimizeFrame(JSFunction function,
+void TieringManager::MaybeOptimizeFrame(Tagged<JSFunction> function,
                                         CodeKind current_code_kind) {
-  const TieringState tiering_state = function.feedback_vector().tiering_state();
+  const TieringState tiering_state =
+      function->feedback_vector()->tiering_state();
   const TieringState osr_tiering_state =
-      function.feedback_vector().osr_tiering_state();
+      function->feedback_vector()->osr_tiering_state();
   // Attenzione! Update this constant in case the condition below changes.
   static_assert(kTieringStateInProgressBlocksTierup);
   if (V8_UNLIKELY(IsInProgress(tiering_state)) ||
@@ -264,19 +280,26 @@ void TieringManager::MaybeOptimizeFrame(JSFunction function,
   }
 
   // TODO(v8:7700): Consider splitting this up for Maglev/Turbofan.
-  if (V8_UNLIKELY(function.shared().optimization_disabled())) return;
+  if (V8_UNLIKELY(function->shared()->optimization_disabled())) return;
 
   if (V8_UNLIKELY(v8_flags.always_osr)) {
     TryRequestOsrAtNextOpportunity(isolate_, function);
     // Continue below and do a normal optimized compile as well.
   }
 
+  const bool maglev_osr = maglev::IsMaglevOsrEnabled();
   // Baseline OSR uses a separate mechanism and must not be considered here,
   // therefore we limit to kOptimizedJSFunctionCodeKindsMask.
-  // TODO(v8:7700): Change the condition below for Maglev OSR once it is
-  // implemented.
   if (IsRequestTurbofan(tiering_state) ||
-      function.HasAvailableCodeKind(CodeKind::TURBOFAN)) {
+      (maglev_osr && IsRequestMaglev(tiering_state)) ||
+      (current_code_kind < CodeKind::TURBOFAN &&
+       function->HasAvailableCodeKind(CodeKind::TURBOFAN)) ||
+      (maglev_osr && current_code_kind < CodeKind::MAGLEV &&
+       function->HasAvailableCodeKind(CodeKind::MAGLEV))) {
+    if (maglev_osr && current_code_kind == CodeKind::MAGLEV &&
+        !v8_flags.osr_from_maglev)
+      return;
+
     // OSR kicks in only once we've previously decided to tier up, but we are
     // still in a lower-tier frame (this implies a long-running loop).
     TryIncrementOsrUrgency(isolate_, function);
@@ -287,20 +310,18 @@ void TieringManager::MaybeOptimizeFrame(JSFunction function,
   }
 
   DCHECK(!IsRequestTurbofan(tiering_state));
-  DCHECK(!function.HasAvailableCodeKind(CodeKind::TURBOFAN));
+  DCHECK(!function->HasAvailableCodeKind(CodeKind::TURBOFAN));
   OptimizationDecision d =
-      ShouldOptimize(function.feedback_vector(), current_code_kind);
+      ShouldOptimize(function->feedback_vector(), current_code_kind);
   // We might be stuck in a baseline frame that wants to tier up to Maglev, but
   // is in a loop, and can't OSR, because Maglev doesn't have OSR. Allow it to
   // skip over Maglev by re-checking ShouldOptimize as if we were in Maglev.
-  // TODO(v8:7700): Remove this when Maglev can OSR.
-  static_assert(!CodeKindCanOSR(CodeKind::MAGLEV));
-  if (d.should_optimize() && d.code_kind == CodeKind::MAGLEV) {
+  if (!maglev_osr && d.should_optimize() && d.code_kind == CodeKind::MAGLEV) {
     bool is_marked_for_maglev_optimization =
         IsRequestMaglev(tiering_state) ||
-        function.HasAvailableCodeKind(CodeKind::MAGLEV);
+        function->HasAvailableCodeKind(CodeKind::MAGLEV);
     if (is_marked_for_maglev_optimization) {
-      d = ShouldOptimize(function.feedback_vector(), CodeKind::MAGLEV);
+      d = ShouldOptimize(function->feedback_vector(), CodeKind::MAGLEV);
     }
   }
 
@@ -308,119 +329,94 @@ void TieringManager::MaybeOptimizeFrame(JSFunction function,
 }
 
 OptimizationDecision TieringManager::ShouldOptimize(
-    FeedbackVector feedback_vector, CodeKind current_code_kind,
-    bool after_next_tick) {
-  SharedFunctionInfo shared = feedback_vector.shared_function_info();
+    Tagged<FeedbackVector> feedback_vector, CodeKind current_code_kind) {
+  Tagged<SharedFunctionInfo> shared = feedback_vector->shared_function_info();
   if (TiersUpToMaglev(current_code_kind) &&
-      shared.PassesFilter(v8_flags.maglev_filter) &&
-      !shared.maglev_compilation_failed()) {
-    if (any_ic_changed_) return OptimizationDecision::DoNotOptimize();
+      shared->PassesFilter(v8_flags.maglev_filter) &&
+      !shared->maglev_compilation_failed()) {
     return OptimizationDecision::Maglev();
   } else if (current_code_kind == CodeKind::TURBOFAN) {
     // Already in the top tier.
     return OptimizationDecision::DoNotOptimize();
   }
 
-  if (!v8_flags.turbofan || !shared.PassesFilter(v8_flags.turbo_filter)) {
+  if (!v8_flags.turbofan || !shared->PassesFilter(v8_flags.turbo_filter)) {
     return OptimizationDecision::DoNotOptimize();
   }
 
-  BytecodeArray bytecode = shared.GetBytecodeArray(isolate_);
-  if (bytecode.length() > v8_flags.max_optimized_bytecode_size) {
+  Tagged<BytecodeArray> bytecode = shared->GetBytecodeArray(isolate_);
+  if (bytecode->length() > v8_flags.max_optimized_bytecode_size) {
     return OptimizationDecision::DoNotOptimize();
   }
-  const int ticks =
-      feedback_vector.profiler_ticks() + (after_next_tick ? 1 : 0);
-  const int ticks_for_optimization =
-      v8_flags.ticks_before_optimization +
-      (bytecode.length() / v8_flags.bytecode_size_allowance_per_tick);
-  if (ticks >= ticks_for_optimization) {
-    return OptimizationDecision::TurbofanHotAndStable();
-  } else if (ShouldOptimizeAsSmallFunction(bytecode.length(),
-                                           any_ic_changed_)) {
-    // If no IC was patched since the last tick and this function is very
-    // small, optimistically optimize it now.
-    return OptimizationDecision::TurbofanSmallFunction();
-  } else if (!after_next_tick && v8_flags.trace_opt_verbose) {
-    PrintF("[not yet optimizing %s, not enough ticks: %d/%d and ",
-           shared.DebugNameCStr().get(), ticks, ticks_for_optimization);
-    if (any_ic_changed_) {
-      PrintF("ICs changed]\n");
-    } else {
-      PrintF(" too large for small function optimization: %d/%d]\n",
-             bytecode.length(),
-             v8_flags.max_bytecode_size_for_early_opt.value());
-    }
-  }
 
-  return OptimizationDecision::DoNotOptimize();
+  return OptimizationDecision::TurbofanHotAndStable();
 }
 
-void TieringManager::NotifyICChanged(FeedbackVector vector) {
-  if (v8_flags.global_ic_updated_flag) {
-    any_ic_changed_ = true;
-  }
-  if (v8_flags.reset_interrupt_on_ic_update) {
-    CodeKind code_kind = vector.has_optimized_code()
-                             ? vector.optimized_code().kind()
-                         : vector.shared_function_info().HasBaselineCode()
-                             ? CodeKind::BASELINE
-                             : CodeKind::INTERPRETED_FUNCTION;
-    OptimizationDecision decision = ShouldOptimize(vector, code_kind, true);
-    if (decision.should_optimize()) {
-      SharedFunctionInfo shared = vector.shared_function_info();
-      int bytecode_length = shared.GetBytecodeArray(isolate_).length();
-      FeedbackCell cell = vector.parent_feedback_cell();
-      int minimum = v8_flags.minimum_invocations_after_ic_update;
-      int new_budget = minimum * bytecode_length;
-      int current_budget = cell.interrupt_budget();
-      if (new_budget > current_budget) {
-        if (v8_flags.trace_opt_verbose) {
-          PrintF("[delaying optimization of %s, IC changed]\n",
-                 shared.DebugNameCStr().get());
-        }
-        cell.set_interrupt_budget(new_budget);
+void TieringManager::NotifyICChanged(Tagged<FeedbackVector> vector) {
+  CodeKind code_kind = vector->has_optimized_code()
+                           ? vector->optimized_code()->kind()
+                       : vector->shared_function_info()->HasBaselineCode()
+                           ? CodeKind::BASELINE
+                           : CodeKind::INTERPRETED_FUNCTION;
+  OptimizationDecision decision = ShouldOptimize(vector, code_kind);
+  if (decision.should_optimize()) {
+    Tagged<SharedFunctionInfo> shared = vector->shared_function_info();
+    int bytecode_length = shared->GetBytecodeArray(isolate_)->length();
+    Tagged<FeedbackCell> cell = vector->parent_feedback_cell();
+    int invocations = v8_flags.minimum_invocations_after_ic_update;
+    int bytecodes = std::min(bytecode_length, (kMaxInt >> 1) / invocations);
+    int new_budget = invocations * bytecodes;
+    int current_budget = cell->interrupt_budget();
+    if (new_budget > current_budget) {
+      if (v8_flags.trace_opt_verbose) {
+        PrintF("[delaying optimization of %s, IC changed]\n",
+               shared->DebugNameCStr().get());
       }
+      cell->set_interrupt_budget(new_budget);
     }
   }
 }
 
-TieringManager::OnInterruptTickScope::OnInterruptTickScope(
-    TieringManager* profiler)
-    : profiler_(profiler) {
+TieringManager::OnInterruptTickScope::OnInterruptTickScope() {
   TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
                "V8.MarkCandidatesForOptimization");
 }
 
-TieringManager::OnInterruptTickScope::~OnInterruptTickScope() {
-  profiler_->any_ic_changed_ = false;
-}
-
 void TieringManager::OnInterruptTick(Handle<JSFunction> function,
                                      CodeKind code_kind) {
   IsCompiledScope is_compiled_scope(
-      function->shared().is_compiled_scope(isolate_));
+      function->shared()->is_compiled_scope(isolate_));
 
   // Remember whether the function had a vector at this point. This is relevant
   // later since the configuration 'Ignition without a vector' can be
   // considered a tier on its own. We begin tiering up to tiers higher than
   // Sparkplug only when reaching this point *with* a feedback vector.
   const bool had_feedback_vector = function->has_feedback_vector();
+  const bool first_time_tiered_up_to_sparkplug =
+      FirstTimeTierUpToSparkplug(isolate_, *function);
+  const bool compile_sparkplug =
+      CanCompileWithBaseline(isolate_, function->shared()) &&
+      function->ActiveTierIsIgnition();
 
   // Ensure that the feedback vector has been allocated.
   if (!had_feedback_vector) {
+    if (compile_sparkplug) {
+      // Mark the function as compiled with sparkplug before the feedback vector
+      // is created to initialize the interrupt budget for the next tier.
+      function->shared()->set_sparkplug_compiled(true);
+    }
     JSFunction::CreateAndAttachFeedbackVector(isolate_, function,
                                               &is_compiled_scope);
     DCHECK(is_compiled_scope.is_compiled());
     // Also initialize the invocation count here. This is only really needed for
     // OSR. When we OSR functions with lazy feedback allocation we want to have
     // a non zero invocation count so we can inline functions.
-    function->feedback_vector().set_invocation_count(1, kRelaxedStore);
+    function->feedback_vector()->set_invocation_count(1, kRelaxedStore);
   }
 
   DCHECK(function->has_feedback_vector());
-  DCHECK(function->shared().is_compiled());
-  DCHECK(function->shared().HasBytecodeArray());
+  DCHECK(function->shared()->is_compiled());
+  DCHECK(function->shared()->HasBytecodeArray());
 
   // TODO(jgruber): Consider integrating this into a linear tiering system
   // controlled by TieringState in which the order is always
@@ -430,23 +426,26 @@ void TieringManager::OnInterruptTick(Handle<JSFunction> function,
   // batching compilation can introduce arbitrary latency between the SP
   // compile request and fulfillment, which doesn't work with strictly linear
   // tiering.
-  if (CanCompileWithBaseline(isolate_, function->shared()) &&
-      function->ActiveTierIsIgnition()) {
+  if (compile_sparkplug) {
     if (v8_flags.baseline_batch_compilation) {
       isolate_->baseline_batch_compiler()->EnqueueFunction(function);
     } else {
       IsCompiledScope is_compiled_scope(
-          function->shared().is_compiled_scope(isolate_));
+          function->shared()->is_compiled_scope(isolate_));
       Compiler::CompileBaseline(isolate_, function, Compiler::CLEAR_EXCEPTION,
                                 &is_compiled_scope);
     }
-    function->shared().set_sparkplug_compiled(true);
   }
 
   // We only tier up beyond sparkplug if we already had a feedback vector.
-  if (!had_feedback_vector) {
-    // The interrupt budget has already been set by
-    // JSFunction::CreateAndAttachFeedbackVector.
+  if (first_time_tiered_up_to_sparkplug) {
+    // If we didn't have a feedback vector, the interrupt budget has already
+    // been set by JSFunction::CreateAndAttachFeedbackVector, so no need to
+    // set it again.
+    if (had_feedback_vector) {
+      function->shared()->set_sparkplug_compiled(true);
+      function->SetInterruptBudget(isolate_);
+    }
     return;
   }
 
@@ -460,10 +459,8 @@ void TieringManager::OnInterruptTick(Handle<JSFunction> function,
   // --- We've decided to proceed for now. ---
 
   DisallowGarbageCollection no_gc;
-  OnInterruptTickScope scope(this);
-  JSFunction function_obj = *function;
-
-  function_obj.feedback_vector().SaturatingIncrementProfilerTicks();
+  OnInterruptTickScope scope;
+  Tagged<JSFunction> function_obj = *function;
 
   MaybeOptimizeFrame(function_obj, code_kind);
 
diff --git a/deps/v8/src/execution/tiering-manager.h b/deps/v8/src/execution/tiering-manager.h
index f7645b1993c665..59a8c746649a30 100644
--- a/deps/v8/src/execution/tiering-manager.h
+++ b/deps/v8/src/execution/tiering-manager.h
@@ -5,6 +5,8 @@
 #ifndef V8_EXECUTION_TIERING_MANAGER_H_
 #define V8_EXECUTION_TIERING_MANAGER_H_
 
+#include <optional>
+
 #include "src/common/assert-scope.h"
 #include "src/handles/handles.h"
 #include "src/utils/allocation.h"
@@ -19,7 +21,7 @@ class OptimizationDecision;
 enum class CodeKind : uint8_t;
 enum class OptimizationReason : uint8_t;
 
-void TraceManualRecompile(JSFunction function, CodeKind code_kind,
+void TraceManualRecompile(Tagged<JSFunction> function, CodeKind code_kind,
                           ConcurrencyMode concurrency_mode);
 
 class TieringManager {
@@ -28,43 +30,41 @@ class TieringManager {
 
   void OnInterruptTick(Handle<JSFunction> function, CodeKind code_kind);
 
-  void NotifyICChanged(FeedbackVector vector);
+  void NotifyICChanged(Tagged<FeedbackVector> vector);
 
   // After this request, the next JumpLoop will perform OSR.
-  void RequestOsrAtNextOpportunity(JSFunction function);
+  void RequestOsrAtNextOpportunity(Tagged<JSFunction> function);
 
   // For use when a JSFunction is available.
-  static int InterruptBudgetFor(Isolate* isolate, JSFunction function);
-  // For use when no JSFunction is available.
-  static int InitialInterruptBudget();
+  static int InterruptBudgetFor(
+      Isolate* isolate, Tagged<JSFunction> function,
+      base::Optional<CodeKind> override_active_tier = {});
+
+  void MarkForTurboFanOptimization(Tagged<JSFunction> function);
 
  private:
   // Make the decision whether to optimize the given function, and mark it for
   // optimization if the decision was 'yes'.
   // This function is also responsible for bumping the OSR urgency.
-  void MaybeOptimizeFrame(JSFunction function, CodeKind code_kind);
+  void MaybeOptimizeFrame(Tagged<JSFunction> function, CodeKind code_kind);
 
   // After next tick indicates whether we've precremented the ticks before
   // calling this function, or whether we're pretending that we already got the
   // tick.
-  OptimizationDecision ShouldOptimize(FeedbackVector feedback_vector,
-                                      CodeKind code_kind,
-                                      bool after_next_tick = false);
-  void Optimize(JSFunction function, OptimizationDecision decision);
-  void Baseline(JSFunction function, OptimizationReason reason);
+  OptimizationDecision ShouldOptimize(Tagged<FeedbackVector> feedback_vector,
+                                      CodeKind code_kind);
+  void Optimize(Tagged<JSFunction> function, OptimizationDecision decision);
+  void Baseline(Tagged<JSFunction> function, OptimizationReason reason);
 
   class V8_NODISCARD OnInterruptTickScope final {
    public:
-    explicit OnInterruptTickScope(TieringManager* profiler);
-    ~OnInterruptTickScope();
+    OnInterruptTickScope();
 
    private:
-    TieringManager* const profiler_;
     DisallowGarbageCollection no_gc;
   };
 
   Isolate* const isolate_;
-  bool any_ic_changed_ = false;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/execution/vm-state-inl.h b/deps/v8/src/execution/vm-state-inl.h
index 58429adde6c5a9..c397b1cf7d0000 100644
--- a/deps/v8/src/execution/vm-state-inl.h
+++ b/deps/v8/src/execution/vm-state-inl.h
@@ -60,14 +60,18 @@ ExternalCallbackScope::ExternalCallbackScope(Isolate* isolate, Address callback)
   scope_address_ = Simulator::current(isolate)->get_sp();
 #endif
   vm_state_.isolate_->set_external_callback_scope(this);
+#ifdef V8_RUNTIME_CALL_STATS
   TRACE_EVENT_BEGIN0(TRACE_DISABLED_BY_DEFAULT("v8.runtime"),
                      "V8.ExternalCallback");
+#endif
 }
 
 ExternalCallbackScope::~ExternalCallbackScope() {
   vm_state_.isolate_->set_external_callback_scope(previous_scope_);
+#ifdef V8_RUNTIME_CALL_STATS
   TRACE_EVENT_END0(TRACE_DISABLED_BY_DEFAULT("v8.runtime"),
                    "V8.ExternalCallback");
+#endif
 }
 
 Address ExternalCallbackScope::scope_address() {
diff --git a/deps/v8/src/extensions/cputracemark-extension.cc b/deps/v8/src/extensions/cputracemark-extension.cc
index 881ca3b1dcbe75..714ce73b3b065e 100644
--- a/deps/v8/src/extensions/cputracemark-extension.cc
+++ b/deps/v8/src/extensions/cputracemark-extension.cc
@@ -6,6 +6,7 @@
 
 #include "include/v8-isolate.h"
 #include "include/v8-template.h"
+#include "src/api/api.h"
 
 namespace v8 {
 namespace internal {
@@ -17,9 +18,10 @@ CpuTraceMarkExtension::GetNativeFunctionTemplate(v8::Isolate* isolate,
 }
 
 void CpuTraceMarkExtension::Mark(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() < 1 || !args[0]->IsUint32()) {
-    args.GetIsolate()->ThrowError(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  if (info.Length() < 1 || !info[0]->IsUint32()) {
+    info.GetIsolate()->ThrowError(
         "First parameter to cputracemark() must be a unsigned int32.");
     return;
   }
@@ -29,7 +31,7 @@ void CpuTraceMarkExtension::Mark(
 #if defined(__clang__)
   // for non msvc build
   uint32_t param =
-      args[0]->Uint32Value(args.GetIsolate()->GetCurrentContext()).ToChecked();
+      info[0]->Uint32Value(info.GetIsolate()->GetCurrentContext()).ToChecked();
 
   int magic_dummy;
 
diff --git a/deps/v8/src/extensions/cputracemark-extension.h b/deps/v8/src/extensions/cputracemark-extension.h
index 4eca092d4b7193..8324941ada99b4 100644
--- a/deps/v8/src/extensions/cputracemark-extension.h
+++ b/deps/v8/src/extensions/cputracemark-extension.h
@@ -25,7 +25,7 @@ class CpuTraceMarkExtension : public v8::Extension {
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
 
  private:
-  static void Mark(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void Mark(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static const char* BuildSource(char* buf, size_t size, const char* fun_name) {
     base::SNPrintF(base::Vector<char>(buf, static_cast<int>(size)),
diff --git a/deps/v8/src/extensions/externalize-string-extension.cc b/deps/v8/src/extensions/externalize-string-extension.cc
index dea0a9ff20ab31..45329d77e33248 100644
--- a/deps/v8/src/extensions/externalize-string-extension.cc
+++ b/deps/v8/src/extensions/externalize-string-extension.cc
@@ -38,17 +38,39 @@ using SimpleOneByteStringResource =
 using SimpleTwoByteStringResource =
     SimpleStringResource<base::uc16, v8::String::ExternalStringResource>;
 
-const char* const ExternalizeStringExtension::kSource =
-    "native function externalizeString();"
-    "native function isOneByteString();"
-    "function x() { return 1; }";
-
+static constexpr int kMinOneByteLength =
+    kExternalPointerSlotSize - kTaggedSize + 1;
+static constexpr int kMinTwoByteLength =
+    (kExternalPointerSlotSize - kTaggedSize) / sizeof(base::uc16) + 1;
+static constexpr int kMinOneByteCachedLength =
+    2 * kExternalPointerSlotSize - kTaggedSize + 1;
+static constexpr int kMinTwoByteCachedLength =
+    (2 * kExternalPointerSlotSize - kTaggedSize) / sizeof(base::uc16) + 1;
+
+// static
+const char* ExternalizeStringExtension::BuildSource(char* buf, size_t size) {
+  base::SNPrintF(base::Vector<char>(buf, static_cast<int>(size)),
+                 "native function externalizeString();"
+                 "native function createExternalizableString();"
+                 "native function isOneByteString();"
+                 "let kExternalStringMinOneByteLength = %d;"
+                 "let kExternalStringMinTwoByteLength = %d;"
+                 "let kExternalStringMinOneByteCachedLength = %d;"
+                 "let kExternalStringMinTwoByteCachedLength = %d;",
+                 kMinOneByteLength, kMinTwoByteLength, kMinOneByteCachedLength,
+                 kMinTwoByteCachedLength);
+  return buf;
+}
 v8::Local<v8::FunctionTemplate>
 ExternalizeStringExtension::GetNativeFunctionTemplate(
     v8::Isolate* isolate, v8::Local<v8::String> str) {
   if (strcmp(*v8::String::Utf8Value(isolate, str), "externalizeString") == 0) {
     return v8::FunctionTemplate::New(isolate,
                                      ExternalizeStringExtension::Externalize);
+  } else if (strcmp(*v8::String::Utf8Value(isolate, str),
+                    "createExternalizableString") == 0) {
+    return v8::FunctionTemplate::New(
+        isolate, ExternalizeStringExtension::CreateExternalizableString);
   } else {
     DCHECK_EQ(strcmp(*v8::String::Utf8Value(isolate, str), "isOneByteString"),
               0);
@@ -68,29 +90,23 @@ bool HasExternalForwardingIndex(Isolate* isolate, Handle<String> string) {
 }  // namespace
 
 void ExternalizeStringExtension::Externalize(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() < 1 || !args[0]->IsString()) {
-    args.GetIsolate()->ThrowError(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  if (info.Length() < 1 || !info[0]->IsString()) {
+    info.GetIsolate()->ThrowError(
         "First parameter to externalizeString() must be a string.");
     return;
   }
-  bool force_two_byte = false;
-  if (args.Length() >= 2) {
-    if (args[1]->IsBoolean()) {
-      force_two_byte = args[1]->BooleanValue(args.GetIsolate());
-    } else {
-      args.GetIsolate()->ThrowError(
-          "Second parameter to externalizeString() must be a boolean.");
-      return;
-    }
-  }
   bool result = false;
-  Handle<String> string = Utils::OpenHandle(*args[0].As<v8::String>());
-  if (!string->SupportsExternalization()) {
-    args.GetIsolate()->ThrowError("string does not support externalization.");
+  Handle<String> string = Utils::OpenHandle(*info[0].As<v8::String>());
+  const bool externalize_as_one_byte = string->IsOneByteRepresentation();
+  if (!string->SupportsExternalization(
+          externalize_as_one_byte ? v8::String::Encoding::ONE_BYTE_ENCODING
+                                  : v8::String::Encoding::TWO_BYTE_ENCODING)) {
+    info.GetIsolate()->ThrowError("string does not support externalization.");
     return;
   }
-  if (string->IsOneByteRepresentation() && !force_two_byte) {
+  if (externalize_as_one_byte) {
     uint8_t* data = new uint8_t[string->length()];
     String::WriteToFlat(*string, data, 0, string->length());
     SimpleOneByteStringResource* resource = new SimpleOneByteStringResource(
@@ -111,23 +127,116 @@ void ExternalizeStringExtension::Externalize(
   // sometimes failing if another thread won and already forwarded the string to
   // the external resource. Don't consider those races as failures.
   if (!result && !HasExternalForwardingIndex(
-                     reinterpret_cast<Isolate*>(args.GetIsolate()), string)) {
-    args.GetIsolate()->ThrowError("externalizeString() failed.");
+                     reinterpret_cast<Isolate*>(info.GetIsolate()), string)) {
+    info.GetIsolate()->ThrowError("externalizeString() failed.");
     return;
   }
 }
 
+namespace {
+
+MaybeHandle<String> CopyConsStringToOld(Isolate* isolate,
+                                        Handle<ConsString> string) {
+  return isolate->factory()->NewConsString(handle(string->first(), isolate),
+                                           handle(string->second(), isolate),
+                                           AllocationType::kOld);
+}
+
+}  // namespace
+
+void ExternalizeStringExtension::CreateExternalizableString(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  if (info.Length() < 1 || !info[0]->IsString()) {
+    info.GetIsolate()->ThrowError(
+        "First parameter to createExternalizableString() must be a string.");
+    return;
+  }
+  Handle<String> string = Utils::OpenHandle(*info[0].As<v8::String>());
+  Isolate* isolate = reinterpret_cast<Isolate*>(info.GetIsolate());
+  v8::String::Encoding encoding = string->IsOneByteRepresentation(isolate)
+                                      ? v8::String::Encoding::ONE_BYTE_ENCODING
+                                      : v8::String::Encoding::TWO_BYTE_ENCODING;
+  if (string->SupportsExternalization(encoding)) {
+    info.GetReturnValue().Set(Utils::ToLocal(string));
+    return;
+  }
+  // Return the string if it is already externalized.
+  if (StringShape(*string).IsExternal()) {
+    info.GetReturnValue().Set(Utils::ToLocal(string));
+    return;
+  }
+
+  // Read-only strings are never externalizable. Don't try to copy them as
+  // some parts of the code might rely on some strings being in RO space (i.e.
+  // empty string).
+  if (IsReadOnlyHeapObject(*string)) {
+    info.GetIsolate()->ThrowError("Read-only strings cannot be externalized.");
+    return;
+  }
+#ifdef V8_COMPRESS_POINTERS
+  // Small strings may not be in-place externalizable.
+  if (string->Size() < ExternalString::kUncachedSize) {
+    info.GetIsolate()->ThrowError("String is too short to be externalized.");
+    return;
+  }
+#endif
+
+  // Special handling for ConsStrings, as the ConsString -> ExternalString
+  // migration is special for GC (Tagged pointers to Untagged pointers).
+  // Skip if the ConsString is flat (second is empty), as we won't be guaranteed
+  // a string in old space in that case.
+  if (IsConsString(*string, isolate) && !string->IsFlat(isolate)) {
+    Handle<String> result;
+    if (CopyConsStringToOld(isolate, Handle<ConsString>::cast(string))
+            .ToHandle(&result)) {
+      DCHECK(result->SupportsExternalization(encoding));
+      info.GetReturnValue().Set(Utils::ToLocal(result));
+      return;
+    }
+  }
+  // All other strings can be implicitly flattened.
+  if (encoding == v8::String::ONE_BYTE_ENCODING) {
+    MaybeHandle<SeqOneByteString> maybe_result =
+        isolate->factory()->NewRawOneByteString(string->length(),
+                                                AllocationType::kOld);
+    Handle<SeqOneByteString> result;
+    if (maybe_result.ToHandle(&result)) {
+      DisallowGarbageCollection no_gc;
+      String::WriteToFlat(*string, result->GetChars(no_gc), 0,
+                          string->length());
+      DCHECK(result->SupportsExternalization(encoding));
+      info.GetReturnValue().Set(Utils::ToLocal(Handle<String>::cast(result)));
+      return;
+    }
+  } else {
+    MaybeHandle<SeqTwoByteString> maybe_result =
+        isolate->factory()->NewRawTwoByteString(string->length(),
+                                                AllocationType::kOld);
+    Handle<SeqTwoByteString> result;
+    if (maybe_result.ToHandle(&result)) {
+      DisallowGarbageCollection no_gc;
+      String::WriteToFlat(*string, result->GetChars(no_gc), 0,
+                          string->length());
+      DCHECK(result->SupportsExternalization(encoding));
+      info.GetReturnValue().Set(Utils::ToLocal(Handle<String>::cast(result)));
+      return;
+    }
+  }
+  info.GetIsolate()->ThrowError("Unable to create string");
+}
 
 void ExternalizeStringExtension::IsOneByte(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() != 1 || !args[0]->IsString()) {
-    args.GetIsolate()->ThrowError(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  if (info.Length() != 1 || !info[0]->IsString()) {
+    info.GetIsolate()->ThrowError(
         "isOneByteString() requires a single string argument.");
     return;
   }
   bool is_one_byte =
-      Utils::OpenHandle(*args[0].As<v8::String>())->IsOneByteRepresentation();
-  args.GetReturnValue().Set(is_one_byte);
+      Utils::OpenHandle(*info[0].As<v8::String>())->IsOneByteRepresentation();
+  info.GetReturnValue().Set(is_one_byte);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/extensions/externalize-string-extension.h b/deps/v8/src/extensions/externalize-string-extension.h
index 8fce62191d0c85..2ae6db14893953 100644
--- a/deps/v8/src/extensions/externalize-string-extension.h
+++ b/deps/v8/src/extensions/externalize-string-extension.h
@@ -16,13 +16,19 @@ namespace internal {
 
 class ExternalizeStringExtension : public v8::Extension {
  public:
-  ExternalizeStringExtension() : v8::Extension("v8/externalize", kSource) {}
+  ExternalizeStringExtension()
+      : v8::Extension("v8/externalize", BuildSource(buffer_, sizeof(buffer_))) {
+  }
   v8::Local<v8::FunctionTemplate> GetNativeFunctionTemplate(
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
-  static void Externalize(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void IsOneByte(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void Externalize(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void CreateExternalizableString(
+      const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void IsOneByte(const v8::FunctionCallbackInfo<v8::Value>& info);
 
  private:
+  static const char* BuildSource(char* buf, size_t size);
+  char buffer_[300];
   static const char* const kSource;
 };
 
diff --git a/deps/v8/src/extensions/gc-extension.cc b/deps/v8/src/extensions/gc-extension.cc
index 16fdeb457b2554..274da1374edafe 100644
--- a/deps/v8/src/extensions/gc-extension.cc
+++ b/deps/v8/src/extensions/gc-extension.cc
@@ -10,6 +10,7 @@
 #include "include/v8-persistent-handle.h"
 #include "include/v8-primitive.h"
 #include "include/v8-template.h"
+#include "src/api/api.h"
 #include "src/base/optional.h"
 #include "src/base/platform/platform.h"
 #include "src/execution/isolate.h"
@@ -30,48 +31,58 @@ struct GCOptions {
 
 Maybe<bool> IsProperty(v8::Isolate* isolate, v8::Local<v8::Context> ctx,
                        v8::Local<v8::Object> object, const char* key,
-                       const char* value) {
+                       const char* value, bool* found_options_object) {
   auto k = v8::String::NewFromUtf8(isolate, key).ToLocalChecked();
-  // Get will return undefined for non-existing keys which will make
-  // StrictEquals fail.
   auto maybe_property = object->Get(ctx, k);
+  // Handle pending or scheduled exception.
   if (maybe_property.IsEmpty()) return Nothing<bool>();
-  return Just<bool>(maybe_property.ToLocalChecked()->StrictEquals(
+  // If the property does not exist or is explicitly set to undefined,
+  // return false.
+  auto property = maybe_property.ToLocalChecked();
+  if (property->IsUndefined()) return Just<bool>(false);
+  // If it exists, the object defines the option.
+  *found_options_object = true;
+  return Just<bool>(property->StrictEquals(
       v8::String::NewFromUtf8(isolate, value).ToLocalChecked()));
 }
 
 Maybe<GCOptions> Parse(v8::Isolate* isolate,
-                       const v8::FunctionCallbackInfo<v8::Value>& args) {
+                       const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  DCHECK_LT(0, info.Length());
+
   // Default values.
   auto options =
       GCOptions{v8::Isolate::GarbageCollectionType::kFullGarbageCollection,
                 ExecutionType::kSync};
   bool found_options_object = false;
 
-  if (args.Length() > 0 && args[0]->IsObject()) {
+  if (info[0]->IsObject()) {
     v8::HandleScope scope(isolate);
     auto ctx = isolate->GetCurrentContext();
-    auto param = v8::Local<v8::Object>::Cast(args[0]);
-    auto maybe_type = IsProperty(isolate, ctx, param, "type", "minor");
+    auto param = v8::Local<v8::Object>::Cast(info[0]);
+    auto maybe_type =
+        IsProperty(isolate, ctx, param, "type", "minor", &found_options_object);
     if (maybe_type.IsNothing()) return Nothing<GCOptions>();
     if (maybe_type.ToChecked()) {
-      found_options_object = true;
+      DCHECK(found_options_object);
       options.type =
           v8::Isolate::GarbageCollectionType::kMinorGarbageCollection;
     }
-    auto maybe_execution =
-        IsProperty(isolate, ctx, param, "execution", "async");
+    auto maybe_execution = IsProperty(isolate, ctx, param, "execution", "async",
+                                      &found_options_object);
     if (maybe_execution.IsNothing()) return Nothing<GCOptions>();
     if (maybe_execution.ToChecked()) {
-      found_options_object = true;
+      DCHECK(found_options_object);
       options.execution = ExecutionType::kAsync;
     }
   }
 
-  // If no options object is present default to legacy behavior.
+  // If the parameter is not an object or if it does not define any options,
+  // default to legacy behavior.
   if (!found_options_object) {
     options.type =
-        args[0]->BooleanValue(isolate)
+        info[0]->BooleanValue(isolate)
             ? v8::Isolate::GarbageCollectionType::kMinorGarbageCollection
             : v8::Isolate::GarbageCollectionType::kFullGarbageCollection;
   }
@@ -82,21 +93,21 @@ Maybe<GCOptions> Parse(v8::Isolate* isolate,
 void InvokeGC(v8::Isolate* isolate, ExecutionType execution_type,
               v8::Isolate::GarbageCollectionType type) {
   Heap* heap = reinterpret_cast<Isolate*>(isolate)->heap();
+  EmbedderStackStateScope stack_scope(
+      heap,
+      execution_type == ExecutionType::kAsync
+          ? EmbedderStackStateScope::kImplicitThroughTask
+          : EmbedderStackStateScope::kExplicitInvocation,
+      execution_type == ExecutionType::kAsync
+          ? StackState::kNoHeapPointers
+          : StackState::kMayContainHeapPointers);
   switch (type) {
     case v8::Isolate::GarbageCollectionType::kMinorGarbageCollection:
       heap->CollectGarbage(i::NEW_SPACE, i::GarbageCollectionReason::kTesting,
                            kGCCallbackFlagForced);
       break;
     case v8::Isolate::GarbageCollectionType::kFullGarbageCollection:
-      EmbedderStackStateScope stack_scope(
-          heap,
-          execution_type == ExecutionType::kAsync
-              ? EmbedderStackStateScope::kImplicitThroughTask
-              : EmbedderStackStateScope::kExplicitInvocation,
-          execution_type == ExecutionType::kAsync
-              ? StackState::kNoHeapPointers
-              : StackState::kMayContainHeapPointers);
-      heap->PreciseCollectAllGarbage(i::Heap::kNoGCFlags,
+      heap->PreciseCollectAllGarbage(i::GCFlag::kNoFlags,
                                      i::GarbageCollectionReason::kTesting,
                                      kGCCallbackFlagForced);
       break;
@@ -141,17 +152,18 @@ v8::Local<v8::FunctionTemplate> GCExtension::GetNativeFunctionTemplate(
   return v8::FunctionTemplate::New(isolate, GCExtension::GC);
 }
 
-void GCExtension::GC(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void GCExtension::GC(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
 
   // Immediate bailout if no arguments are provided.
-  if (args.Length() == 0) {
+  if (info.Length() == 0) {
     InvokeGC(isolate, ExecutionType::kSync,
              v8::Isolate::GarbageCollectionType::kFullGarbageCollection);
     return;
   }
 
-  auto maybe_options = Parse(isolate, args);
+  auto maybe_options = Parse(isolate, info);
   if (maybe_options.IsNothing()) return;
   GCOptions options = maybe_options.ToChecked();
   switch (options.execution) {
@@ -162,7 +174,7 @@ void GCExtension::GC(const v8::FunctionCallbackInfo<v8::Value>& args) {
       v8::HandleScope scope(isolate);
       auto resolver = v8::Promise::Resolver::New(isolate->GetCurrentContext())
                           .ToLocalChecked();
-      args.GetReturnValue().Set(resolver->GetPromise());
+      info.GetReturnValue().Set(resolver->GetPromise());
       auto task_runner =
           V8::GetCurrentPlatform()->GetForegroundTaskRunner(isolate);
       CHECK(task_runner->NonNestableTasksEnabled());
diff --git a/deps/v8/src/extensions/gc-extension.h b/deps/v8/src/extensions/gc-extension.h
index f38a946b9facd2..32edd9615585c0 100644
--- a/deps/v8/src/extensions/gc-extension.h
+++ b/deps/v8/src/extensions/gc-extension.h
@@ -38,7 +38,7 @@ class GCExtension : public v8::Extension {
                       BuildSource(buffer_, sizeof(buffer_), fun_name)) {}
   v8::Local<v8::FunctionTemplate> GetNativeFunctionTemplate(
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
-  static void GC(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void GC(const v8::FunctionCallbackInfo<v8::Value>& info);
 
  private:
   static const char* BuildSource(char* buf, size_t size, const char* fun_name) {
diff --git a/deps/v8/src/extensions/ignition-statistics-extension.cc b/deps/v8/src/extensions/ignition-statistics-extension.cc
index 454a85f50a5ae2..dbb0da8563afac 100644
--- a/deps/v8/src/extensions/ignition-statistics-extension.cc
+++ b/deps/v8/src/extensions/ignition-statistics-extension.cc
@@ -28,9 +28,10 @@ const char* const IgnitionStatisticsExtension::kSource =
     "native function getIgnitionDispatchCounters();";
 
 void IgnitionStatisticsExtension::GetIgnitionDispatchCounters(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().Set(
-      Utils::ToLocal(reinterpret_cast<Isolate*>(args.GetIsolate())
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(
+      Utils::ToLocal(reinterpret_cast<Isolate*>(info.GetIsolate())
                          ->interpreter()
                          ->GetDispatchCountersObject()));
 }
diff --git a/deps/v8/src/extensions/ignition-statistics-extension.h b/deps/v8/src/extensions/ignition-statistics-extension.h
index deffe4c9156143..2a62b1b225e42d 100644
--- a/deps/v8/src/extensions/ignition-statistics-extension.h
+++ b/deps/v8/src/extensions/ignition-statistics-extension.h
@@ -23,7 +23,7 @@ class IgnitionStatisticsExtension : public v8::Extension {
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
 
   static void GetIgnitionDispatchCounters(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
 
  private:
   static const char* const kSource;
diff --git a/deps/v8/src/extensions/statistics-extension.cc b/deps/v8/src/extensions/statistics-extension.cc
index ea333762c9a927..a5e2c24e4ca29e 100644
--- a/deps/v8/src/extensions/statistics-extension.cc
+++ b/deps/v8/src/extensions/statistics-extension.cc
@@ -9,6 +9,7 @@
 #include "src/execution/isolate.h"
 #include "src/heap/heap-inl.h"  // crbug.com/v8/8499
 #include "src/logging/counters.h"
+#include "src/objects/tagged.h"
 #include "src/roots/roots.h"
 
 namespace v8 {
@@ -59,21 +60,21 @@ static void AddNumber64(v8::Isolate* isolate,
       .FromJust();
 }
 
-
 void StatisticsExtension::GetCounters(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = reinterpret_cast<Isolate*>(args.GetIsolate());
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  Isolate* isolate = reinterpret_cast<Isolate*>(info.GetIsolate());
   Heap* heap = isolate->heap();
 
-  if (args.Length() > 0) {  // GC if first argument evaluates to true.
-    if (args[0]->IsBoolean() && args[0]->BooleanValue(args.GetIsolate())) {
-      heap->CollectAllGarbage(Heap::kNoGCFlags,
+  if (info.Length() > 0) {  // GC if first argument evaluates to true.
+    if (info[0]->IsBoolean() && info[0]->BooleanValue(info.GetIsolate())) {
+      heap->CollectAllGarbage(GCFlag::kNoFlags,
                               GarbageCollectionReason::kCountersExtension);
     }
   }
 
   Counters* counters = isolate->counters();
-  v8::Local<v8::Object> result = v8::Object::New(args.GetIsolate());
+  v8::Local<v8::Object> result = v8::Object::New(info.GetIsolate());
 
   struct StatisticsCounter {
     v8::internal::StatsCounter* counter;
@@ -89,7 +90,7 @@ void StatisticsExtension::GetCounters(
   // clang-format on
 
   for (size_t i = 0; i < arraysize(counter_list); i++) {
-    AddCounter(args.GetIsolate(), result, counter_list[i].counter,
+    AddCounter(info.GetIsolate(), result, counter_list[i].counter,
                counter_list[i].name);
   }
 
@@ -129,46 +130,47 @@ void StatisticsExtension::GetCounters(
   };
 
   for (size_t i = 0; i < arraysize(numbers); i++) {
-    AddNumber(args.GetIsolate(), result, numbers[i].number, numbers[i].name);
+    AddNumber(info.GetIsolate(), result, numbers[i].number, numbers[i].name);
   }
 
-  AddNumber64(args.GetIsolate(), result, heap->external_memory(),
+  AddNumber64(info.GetIsolate(), result, heap->external_memory(),
               "amount_of_external_allocated_memory");
 
   int reloc_info_total = 0;
   int source_position_table_total = 0;
   {
     HeapObjectIterator iterator(
-        reinterpret_cast<Isolate*>(args.GetIsolate())->heap());
+        reinterpret_cast<Isolate*>(info.GetIsolate())->heap());
     DCHECK(!AllowGarbageCollection::IsAllowed());
-    for (HeapObject obj = iterator.Next(); !obj.is_null();
+    for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
          obj = iterator.Next()) {
-      Object maybe_source_positions;
-      if (obj.IsCode()) {
-        Code code = Code::cast(obj);
-        reloc_info_total += code.relocation_info().Size();
+      Tagged<Object> maybe_source_positions;
+      if (IsCode(obj)) {
+        Tagged<Code> code = Code::cast(obj);
+        reloc_info_total += code->relocation_size();
         // Baseline code doesn't have source positions since it uses
         // interpreter code positions.
-        if (code.kind() == CodeKind::BASELINE) continue;
-        maybe_source_positions = code.source_position_table();
-      } else if (obj.IsBytecodeArray()) {
+        if (code->kind() == CodeKind::BASELINE) continue;
+        maybe_source_positions = code->source_position_table();
+      } else if (IsBytecodeArray(obj)) {
         maybe_source_positions =
-            BytecodeArray::cast(obj).source_position_table(kAcquireLoad);
+            BytecodeArray::cast(obj)->source_position_table(kAcquireLoad);
       } else {
         continue;
       }
-      if (!maybe_source_positions.IsByteArray()) continue;
-      ByteArray source_positions = ByteArray::cast(maybe_source_positions);
-      if (source_positions.length() == 0) continue;
-      source_position_table_total += source_positions.Size();
+      if (!IsByteArray(maybe_source_positions)) continue;
+      Tagged<ByteArray> source_positions =
+          ByteArray::cast(maybe_source_positions);
+      if (source_positions->length() == 0) continue;
+      source_position_table_total += source_positions->Size();
     }
   }
 
-  AddNumber(args.GetIsolate(), result, reloc_info_total,
+  AddNumber(info.GetIsolate(), result, reloc_info_total,
             "reloc_info_total_size");
-  AddNumber(args.GetIsolate(), result, source_position_table_total,
+  AddNumber(info.GetIsolate(), result, source_position_table_total,
             "source_position_table_total_size");
-  args.GetReturnValue().Set(result);
+  info.GetReturnValue().Set(result);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/extensions/statistics-extension.h b/deps/v8/src/extensions/statistics-extension.h
index f2b0256ee2ea3b..d06ef45404fdc2 100644
--- a/deps/v8/src/extensions/statistics-extension.h
+++ b/deps/v8/src/extensions/statistics-extension.h
@@ -19,7 +19,7 @@ class StatisticsExtension : public v8::Extension {
   StatisticsExtension() : v8::Extension("v8/statistics", kSource) {}
   v8::Local<v8::FunctionTemplate> GetNativeFunctionTemplate(
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
-  static void GetCounters(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void GetCounters(const v8::FunctionCallbackInfo<v8::Value>& info);
 
  private:
   static const char* const kSource;
diff --git a/deps/v8/src/extensions/trigger-failure-extension.cc b/deps/v8/src/extensions/trigger-failure-extension.cc
index 2c66d036a25542..19e2eb790da843 100644
--- a/deps/v8/src/extensions/trigger-failure-extension.cc
+++ b/deps/v8/src/extensions/trigger-failure-extension.cc
@@ -39,21 +39,18 @@ TriggerFailureExtension::GetNativeFunctionTemplate(v8::Isolate* isolate,
   }
 }
 
-
 void TriggerFailureExtension::TriggerCheckFalse(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
   CHECK(false);
 }
 
-
 void TriggerFailureExtension::TriggerAssertFalse(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
   DCHECK(false);
 }
 
-
 void TriggerFailureExtension::TriggerSlowAssertFalse(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
   SLOW_DCHECK(false);
 }
 
diff --git a/deps/v8/src/extensions/trigger-failure-extension.h b/deps/v8/src/extensions/trigger-failure-extension.h
index 22039ccb276d23..1a34f86d040656 100644
--- a/deps/v8/src/extensions/trigger-failure-extension.h
+++ b/deps/v8/src/extensions/trigger-failure-extension.h
@@ -20,11 +20,11 @@ class TriggerFailureExtension : public v8::Extension {
   v8::Local<v8::FunctionTemplate> GetNativeFunctionTemplate(
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
   static void TriggerCheckFalse(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   static void TriggerAssertFalse(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
   static void TriggerSlowAssertFalse(
-      const v8::FunctionCallbackInfo<v8::Value>& args);
+      const v8::FunctionCallbackInfo<v8::Value>& info);
 
  private:
   static const char* const kSource;
diff --git a/deps/v8/src/extensions/vtunedomain-support-extension.cc b/deps/v8/src/extensions/vtunedomain-support-extension.cc
index fcf2aa6961ca9b..d3b28e243c1e2e 100644
--- a/deps/v8/src/extensions/vtunedomain-support-extension.cc
+++ b/deps/v8/src/extensions/vtunedomain-support-extension.cc
@@ -102,7 +102,7 @@ VTuneDomainSupportExtension::GetNativeFunctionTemplate(
   return v8::FunctionTemplate::New(isolate, VTuneDomainSupportExtension::Mark);
 }
 
-// args should take three parameters
+// info should take three parameters
 // %0 : string, which is the domain name. Domain is used to tagging trace data
 // for different modules or libraryies in a program
 // %1 : string, which is the task name. Task is a logical unit of work performed
@@ -110,19 +110,19 @@ VTuneDomainSupportExtension::GetNativeFunctionTemplate(
 // %2 : string, "start" / "end". Action to be taken on a task in a particular
 // domain
 void VTuneDomainSupportExtension::Mark(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Length() != 3 || !args[0]->IsString() || !args[1]->IsString() ||
-      !args[2]->IsString()) {
-    args.GetIsolate()->ThrowError(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  if (info.Length() != 3 || !info[0]->IsString() || !info[1]->IsString() ||
+      !info[2]->IsString()) {
+    info.GetIsolate()->ThrowError(
         "Parameter number should be exactly three, first domain name"
         "second task name, third start/end");
     return;
   }
 
-  v8::Isolate* isolate = args.GetIsolate();
-  v8::String::Utf8Value domainName(isolate, args[0]);
-  v8::String::Utf8Value taskName(isolate, args[1]);
-  v8::String::Utf8Value statName(isolate, args[2]);
+  v8::Isolate* isolate = info.GetIsolate();
+  v8::String::Utf8Value domainName(isolate, info[0]);
+  v8::String::Utf8Value taskName(isolate, info[1]);
+  v8::String::Utf8Value statName(isolate, info[2]);
 
   char* cdomainName = *domainName;
   char* ctaskName = *taskName;
@@ -133,8 +133,8 @@ void VTuneDomainSupportExtension::Mark(
 
   int r = 0;
   if ((r = libvtune::invoke(params.str().c_str())) != 0) {
-    args.GetIsolate()->ThrowError(
-        v8::String::NewFromUtf8(args.GetIsolate(), std::to_string(r).c_str())
+    info.GetIsolate()->ThrowError(
+        v8::String::NewFromUtf8(info.GetIsolate(), std::to_string(r).c_str())
             .ToLocalChecked());
   }
 }
diff --git a/deps/v8/src/extensions/vtunedomain-support-extension.h b/deps/v8/src/extensions/vtunedomain-support-extension.h
index cccfd7422351b3..296a99c32cefb3 100644
--- a/deps/v8/src/extensions/vtunedomain-support-extension.h
+++ b/deps/v8/src/extensions/vtunedomain-support-extension.h
@@ -35,7 +35,7 @@ class VTuneDomainSupportExtension : public v8::Extension {
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
 
  private:
-  static void Mark(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void Mark(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static const char* BuildSource(char* buf, size_t size, const char* fun_name) {
     base::SNPrintF(base::Vector<char>(buf, static_cast<int>(size)),
diff --git a/deps/v8/src/flags/flag-definitions.h b/deps/v8/src/flags/flag-definitions.h
index 8a3ab897c67e98..6acb97299e0026 100644
--- a/deps/v8/src/flags/flag-definitions.h
+++ b/deps/v8/src/flags/flag-definitions.h
@@ -123,13 +123,19 @@
 #error ENABLE_SPARKPLUG must be defined at this point.
 #endif  // ENABLE_SPARKPLUG
 
-#if ENABLE_SPARKPLUG && !defined(ANDROID)
-// Enable Sparkplug by default on desktop-only.
+#if ENABLE_SPARKPLUG
 #define ENABLE_SPARKPLUG_BY_DEFAULT true
 #else
 #define ENABLE_SPARKPLUG_BY_DEFAULT false
 #endif
 
+#if V8_ENABLE_MAGLEV && !defined(ANDROID)
+// Enable Maglev by default on desktop-only.
+#define ENABLE_MAGLEV_BY_DEFAULT true
+#else
+#define ENABLE_MAGLEV_BY_DEFAULT false
+#endif
+
 // Supported ARM configurations are:
 //  "armv6":       ARMv6 + VFPv2
 //  "armv7":       ARMv7 + VFPv3-D32 + NEON
@@ -231,59 +237,83 @@ DEFINE_BOOL(trace_temporal, false, "trace temporal code")
 DEFINE_BOOL(harmony, false, "enable all completed harmony features")
 DEFINE_BOOL(harmony_shipping, true, "enable all shipped harmony features")
 
+DEFINE_BOOL(js_staging, false, "enable all completed JavaScript features")
+DEFINE_BOOL(js_shipping, true, "enable all shipped JavaScript features")
+
 // Update bootstrapper.cc whenever adding a new feature flag.
 
 // Features that are still work in progress (behind individual flags).
+//
+// The "harmony" naming is now outdated and will no longer be used for new JS
+// features. Use the JAVASCRIPT macros instead.
+//
+// TODO(v8:14214): Remove --harmony flags once transition is complete.
 #define HARMONY_INPROGRESS_BASE(V)                                             \
+  V(harmony_import_attributes, "harmony import attributes")                    \
   V(harmony_weak_refs_with_cleanup_some,                                       \
     "harmony weak references with FinalizationRegistry.prototype.cleanupSome") \
   V(harmony_temporal, "Temporal")                                              \
   V(harmony_shadow_realm, "harmony ShadowRealm")                               \
   V(harmony_struct, "harmony structs, shared structs, and shared arrays")      \
-  V(harmony_array_from_async, "harmony Array.fromAsync")                       \
-  V(harmony_iterator_helpers, "JavaScript iterator helpers")
+  V(harmony_array_from_async, "harmony Array.fromAsync")
+
+#define JAVASCRIPT_INPROGRESS_FEATURES_BASE(V)
 
 #ifdef V8_INTL_SUPPORT
-#define HARMONY_INPROGRESS(V)                             \
-  HARMONY_INPROGRESS_BASE(V)                              \
-  V(harmony_intl_best_fit_matcher, "Intl BestFitMatcher") \
+#define HARMONY_INPROGRESS(V)                                           \
+  HARMONY_INPROGRESS_BASE(V)                                            \
+  V(harmony_intl_best_fit_matcher, "Intl BestFitMatcher")               \
+  /* Following two flags should ship the same time but may stage */     \
+  /* differently . */                                                   \
+  V(harmony_remove_intl_locale_info_getters,                            \
+    "Remove Obsoleted Intl Locale Info getters")                        \
+  V(harmony_intl_locale_info_func, "Intl Locale Info API as functions") \
   V(harmony_intl_duration_format, "Intl DurationFormat API")
+
+#define JAVASCRIPT_INPROGRESS_FEATURES(V) JAVASCRIPT_INPROGRESS_FEATURES_BASE(V)
 #else
 #define HARMONY_INPROGRESS(V) HARMONY_INPROGRESS_BASE(V)
+#define JAVASCRIPT_INPROGRESS_FEATURES(V) JAVASCRIPT_INPROGRESS_FEATURES_BASE(V)
 #endif
 
 // Features that are complete (but still behind the --harmony flag).
-#define HARMONY_STAGED_BASE(V)                                 \
-  V(harmony_rab_gsab_transfer, "harmony ArrayBuffer.transfer") \
-  V(harmony_array_grouping, "harmony array grouping")          \
-  V(harmony_json_parse_with_source, "harmony json parse with source")
+#define HARMONY_STAGED_BASE(V)                  \
+  V(harmony_set_methods, "harmony Set Methods") \
+  V(harmony_iterator_helpers, "JavaScript iterator helpers")
 
-DEFINE_IMPLICATION(harmony_rab_gsab_transfer, harmony_rab_gsab)
+#define JAVASCRIPT_STAGED_FEATURES_BASE(V) \
+  V(js_promise_withresolvers, "Promise.withResolvers")
+
+DEFINE_WEAK_IMPLICATION(harmony_rab_gsab_transfer, harmony_rab_gsab)
 
 #ifdef V8_INTL_SUPPORT
 #define HARMONY_STAGED(V) HARMONY_STAGED_BASE(V)
+#define JAVASCRIPT_STAGED_FEATURES(V) JAVASCRIPT_STAGED_FEATURES_BASE(V)
 #else
 #define HARMONY_STAGED(V) HARMONY_STAGED_BASE(V)
+#define JAVASCRIPT_STAGED_FEATURES(V) JAVASCRIPT_STAGED_FEATURES_BASE(V)
 #endif
 
 // Features that are shipping (turned on by default, but internal flag remains).
 #define HARMONY_SHIPPING_BASE(V)                                       \
-  V(harmony_sharedarraybuffer, "harmony sharedarraybuffer")            \
-  V(harmony_atomics, "harmony atomics")                                \
   V(harmony_import_assertions, "harmony import assertions")            \
-  V(harmony_symbol_as_weakmap_key, "harmony symbols as weakmap keys")  \
   V(harmony_change_array_by_copy, "harmony change-Array-by-copy")      \
   V(harmony_string_is_well_formed, "harmony String#{is,to}WellFormed") \
   V(harmony_rab_gsab,                                                  \
     "harmony ResizableArrayBuffer / GrowableSharedArrayBuffer")        \
-  V(harmony_regexp_unicode_sets, "harmony RegExp Unicode Sets")
+  V(harmony_regexp_unicode_sets, "harmony RegExp Unicode Sets")        \
+  V(harmony_json_parse_with_source, "harmony json parse with source")  \
+  V(harmony_rab_gsab_transfer, "harmony ArrayBuffer.transfer")         \
+  V(harmony_array_grouping, "harmony array grouping")
+
+#define JAVASCRIPT_SHIPPING_FEATURES_BASE(V)
 
 #ifdef V8_INTL_SUPPORT
-#define HARMONY_SHIPPING(V) \
-  HARMONY_SHIPPING_BASE(V)  \
-  V(harmony_intl_number_format_v3, "Intl.NumberFormat v3")
+#define HARMONY_SHIPPING(V) HARMONY_SHIPPING_BASE(V)
+#define JAVASCRIPT_SHIPPING_FEATURES(V) JAVASCRIPT_SHIPPING_FEATURES_BASE(V)
 #else
 #define HARMONY_SHIPPING(V) HARMONY_SHIPPING_BASE(V)
+#define JAVASCRIPT_SHIPPING_FEATURES(V) JAVASCRIPT_SHIPPING_FEATURES_BASE(V)
 #endif
 
 // Once a shipping feature has proved stable in the wild, it will be dropped
@@ -299,18 +329,25 @@ DEFINE_IMPLICATION(harmony_rab_gsab_transfer, harmony_rab_gsab)
               "enable " #description " (in progress / experimental)") \
   DEFINE_IMPLICATION(id, experimental)
 HARMONY_INPROGRESS(FLAG_INPROGRESS_FEATURES)
+JAVASCRIPT_INPROGRESS_FEATURES(FLAG_INPROGRESS_FEATURES)
 #undef FLAG_INPROGRESS_FEATURES
 
 #define FLAG_STAGED_FEATURES(id, description)    \
   DEFINE_BOOL(id, false, "enable " #description) \
-  DEFINE_IMPLICATION(harmony, id)
+  DEFINE_IMPLICATION(harmony, id)                \
+  DEFINE_IMPLICATION(js_staging, id)
 HARMONY_STAGED(FLAG_STAGED_FEATURES)
+JAVASCRIPT_STAGED_FEATURES(FLAG_STAGED_FEATURES)
+DEFINE_IMPLICATION(harmony, js_staging)
 #undef FLAG_STAGED_FEATURES
 
-#define FLAG_SHIPPING_FEATURES(id, description) \
-  DEFINE_BOOL(id, true, "enable " #description) \
-  DEFINE_NEG_NEG_IMPLICATION(harmony_shipping, id)
+#define FLAG_SHIPPING_FEATURES(id, description)    \
+  DEFINE_BOOL(id, true, "enable " #description)    \
+  DEFINE_NEG_NEG_IMPLICATION(harmony_shipping, id) \
+  DEFINE_NEG_NEG_IMPLICATION(js_shipping, id)
 HARMONY_SHIPPING(FLAG_SHIPPING_FEATURES)
+JAVASCRIPT_SHIPPING_FEATURES(FLAG_SHIPPING_FEATURES)
+DEFINE_NEG_NEG_IMPLICATION(harmony_shipping, js_shipping)
 #undef FLAG_SHIPPING_FEATURES
 
 DEFINE_BOOL(builtin_subclassing, true,
@@ -443,13 +480,28 @@ DEFINE_BOOL_READONLY(
 DEFINE_BOOL_READONLY(conservative_stack_scanning,
                      V8_ENABLE_CONSERVATIVE_STACK_SCANNING_BOOL,
                      "use conservative stack scanning")
-DEFINE_IMPLICATION(conservative_stack_scanning, minor_mc)
+DEFINE_IMPLICATION(conservative_stack_scanning, minor_ms)
 DEFINE_NEG_IMPLICATION(conservative_stack_scanning, compact_with_stack)
 
-#if V8_ENABLE_WEBASSEMBLY
-DEFINE_NEG_IMPLICATION(conservative_stack_scanning,
-                       experimental_wasm_stack_switching)
-#endif  // V8_ENABLE_WEBASSEMBLY
+#ifdef V8_ENABLE_DIRECT_HANDLE
+#define V8_ENABLE_DIRECT_HANDLE_BOOL true
+#else
+#define V8_ENABLE_DIRECT_HANDLE_BOOL false
+#endif
+DEFINE_BOOL_READONLY(direct_handle, V8_ENABLE_DIRECT_HANDLE_BOOL,
+                     "use direct handles with conservative stack scanning")
+// Do not use direct handles without conservative stack scanning, as this would
+// break the correctness of the GC.
+DEFINE_NEG_NEG_IMPLICATION(conservative_stack_scanning, direct_handle)
+
+#ifdef V8_ENABLE_DIRECT_LOCAL
+#define V8_ENABLE_DIRECT_LOCAL_BOOL true
+#else
+#define V8_ENABLE_DIRECT_LOCAL_BOOL false
+#endif
+DEFINE_BOOL_READONLY(direct_local, V8_ENABLE_DIRECT_LOCAL_BOOL,
+                     "use direct local handles")
+DEFINE_IMPLICATION(direct_local, conservative_stack_scanning)
 
 #ifdef V8_ENABLE_FUTURE
 #define FUTURE_BOOL true
@@ -464,33 +516,58 @@ DEFINE_BOOL(force_emit_interrupt_budget_checks, false,
             "force emit tier-up logic from all non-turbofan code, even if it "
             "is the top enabled tier")
 #ifdef V8_ENABLE_MAGLEV
-#define V8_ENABLE_MAGLEV_BOOL true
-DEFINE_BOOL(maglev, false, "enable the maglev optimizing compiler")
+DEFINE_BOOL(maglev, ENABLE_MAGLEV_BY_DEFAULT,
+            "enable the maglev optimizing compiler")
 DEFINE_WEAK_IMPLICATION(future, maglev)
 DEFINE_EXPERIMENTAL_FEATURE(
     maglev_future,
     "enable maglev features that we want to ship in the not-too-far future")
 DEFINE_IMPLICATION(maglev_future, maglev)
-DEFINE_EXPERIMENTAL_FEATURE(maglev_inlining,
-                            "enable inlining in the maglev optimizing compiler")
-DEFINE_EXPERIMENTAL_FEATURE(
-    maglev_untagged_phis,
-    "enable phi untagging in the maglev optimizing compiler")
+DEFINE_BOOL(maglev_inlining, true,
+            "enable inlining in the maglev optimizing compiler")
+DEFINE_BOOL(maglev_loop_peeling, false,
+            "enable loop peeling in the maglev optimizing compiler")
+DEFINE_BOOL(maglev_deopt_data_on_background, true,
+            "Generate deopt data on background thread")
+DEFINE_BOOL(maglev_build_code_on_background, true,
+            "Generate code on background thread")
+DEFINE_WEAK_IMPLICATION(maglev_build_code_on_background,
+                        maglev_deopt_data_on_background)
+DEFINE_BOOL(maglev_destroy_on_background, true,
+            "Destroy compilation jobs on background thread")
 DEFINE_WEAK_IMPLICATION(maglev_future, maglev_inlining)
-DEFINE_WEAK_IMPLICATION(maglev_future, maglev_untagged_phis)
+DEFINE_WEAK_IMPLICATION(maglev_future, maglev_loop_peeling)
 
-DEFINE_INT(max_maglev_inline_depth, 1,
-           "max depth of functions that Maglev will inline")
+DEFINE_UINT(
+    concurrent_maglev_max_threads, 1,
+    "max number of threads that concurrent Maglev can use (0 for unbounded)")
+DEFINE_BOOL(concurrent_maglev_high_priority_threads, false,
+            "use high priority compiler threads for concurrent Maglev")
+
+DEFINE_INT(
+    max_maglev_inline_depth, 1,
+    "max depth of functions that Maglev will inline excl. small functions")
+DEFINE_INT(
+    max_maglev_hard_inline_depth, 10,
+    "max depth of functions that Maglev will inline incl. small functions")
 DEFINE_INT(max_maglev_inlined_bytecode_size, 460,
            "maximum size of bytecode for a single inlining")
 DEFINE_INT(max_maglev_inlined_bytecode_size_cumulative, 920,
-           "maximum cumulative size of bytecode considered for inlining")
+           "maximum cumulative size of bytecode considered for inlining excl. "
+           "small functions")
 DEFINE_INT(max_maglev_inlined_bytecode_size_small, 27,
            "maximum size of bytecode considered for small function inlining")
 DEFINE_FLOAT(min_maglev_inlining_frequency, 0.10,
              "minimum frequency for inlining")
+DEFINE_WEAK_VALUE_IMPLICATION(turbofan, max_maglev_inline_depth, 1)
+DEFINE_WEAK_VALUE_IMPLICATION(turbofan, max_maglev_inlined_bytecode_size, 100)
+DEFINE_WEAK_VALUE_IMPLICATION(turbofan,
+                              max_maglev_inlined_bytecode_size_cumulative, 920)
+DEFINE_WEAK_VALUE_IMPLICATION(turbofan, min_maglev_inlining_frequency, 0.95)
 DEFINE_BOOL(maglev_reuse_stack_slots, true,
             "reuse stack slots in the maglev optimizing compiler")
+DEFINE_BOOL(maglev_untagged_phis, true,
+            "enable phi untagging in the maglev optimizing compiler")
 
 DEFINE_BOOL(
     optimize_on_next_call_optimizes_to_maglev, false,
@@ -502,7 +579,6 @@ DEFINE_BOOL(stress_maglev, false, "trigger maglev compilation earlier")
 DEFINE_IMPLICATION(stress_maglev, maglev)
 DEFINE_WEAK_VALUE_IMPLICATION(stress_maglev, invocation_count_for_maglev, 4)
 #else
-#define V8_ENABLE_MAGLEV_BOOL false
 DEFINE_BOOL_READONLY(maglev, false, "enable the maglev optimizing compiler")
 DEFINE_BOOL_READONLY(
     maglev_future, false,
@@ -522,16 +598,38 @@ DEFINE_BOOL(maglev_assert, false, "insert extra assertion in maglev code")
 DEFINE_DEBUG_BOOL(maglev_assert_stack_size, true,
                   "insert stack size checks before every IR node")
 DEFINE_BOOL(maglev_break_on_entry, false, "insert an int3 on maglev entries")
-DEFINE_BOOL(print_maglev_graph, false, "print maglev graph")
-DEFINE_BOOL(print_maglev_deopt_verbose, false, "print verbose deopt info")
+DEFINE_BOOL(maglev_print_feedback, true,
+            "print feedback vector for maglev compiled code")
+
 DEFINE_BOOL(print_maglev_code, false, "print maglev code")
 DEFINE_BOOL(trace_maglev_graph_building, false, "trace maglev graph building")
-DEFINE_BOOL(trace_maglev_regalloc, false, "trace maglev register allocation")
 DEFINE_BOOL(trace_maglev_inlining, false, "trace maglev inlining")
 DEFINE_BOOL(trace_maglev_inlining_verbose, false,
             "trace maglev inlining (verbose)")
 DEFINE_IMPLICATION(trace_maglev_inlining_verbose, trace_maglev_inlining)
 
+#ifdef V8_ENABLE_MAGLEV_GRAPH_PRINTER
+DEFINE_BOOL(print_maglev_deopt_verbose, false, "print verbose deopt info")
+DEFINE_BOOL(print_maglev_graph, false, "print the final maglev graph")
+DEFINE_BOOL(print_maglev_graphs, false, "print maglev graph across all phases")
+DEFINE_BOOL(trace_maglev_phi_untagging, false, "trace maglev phi untagging")
+DEFINE_BOOL(trace_maglev_regalloc, false, "trace maglev register allocation")
+#else
+DEFINE_BOOL_READONLY(print_maglev_deopt_verbose, false,
+                     "print verbose deopt info")
+DEFINE_BOOL_READONLY(print_maglev_graph, false, "print the final maglev graph")
+DEFINE_BOOL_READONLY(print_maglev_graphs, false,
+                     "print maglev graph across all phases")
+DEFINE_BOOL_READONLY(trace_maglev_phi_untagging, false,
+                     "trace maglev phi untagging")
+DEFINE_BOOL_READONLY(trace_maglev_regalloc, false,
+                     "trace maglev register allocation")
+#endif  // V8_ENABLE_MAGLEV_GRAPH_PRINTER
+
+DEFINE_BOOL(maglev_stats, false, "print Maglev statistics")
+DEFINE_BOOL(maglev_stats_nvp, false,
+            "print Maglev statistics in machine-readable format")
+
 // TODO(v8:7700): Remove once stable.
 DEFINE_BOOL(maglev_function_context_specialization, true,
             "enable function context specialization in maglev")
@@ -591,12 +689,15 @@ DEFINE_NEG_IMPLICATION(jitless, maglev)
 // Doesn't work without an executable code space.
 DEFINE_NEG_IMPLICATION(jitless, interpreted_frames_native_stack)
 
+DEFINE_BOOL(memory_protection_keys, true,
+            "protect code memory with PKU if available")
+
 DEFINE_BOOL(assert_types, false,
             "generate runtime type assertions to test the typer")
 // TODO(tebbi): Support allocating types from background thread.
 DEFINE_NEG_IMPLICATION(assert_types, concurrent_recompilation)
-DEFINE_BOOL(
-    turboshaft_assert_types, false,
+DEFINE_EXPERIMENTAL_FEATURE(
+    turboshaft_assert_types,
     "generate runtime type assertions to test the turboshaft type system")
 DEFINE_NEG_IMPLICATION(turboshaft_assert_types, concurrent_recompilation)
 
@@ -624,7 +725,23 @@ DEFINE_BOOL(allocation_site_pretenuring, true,
             "pretenure with allocation sites")
 DEFINE_BOOL(page_promotion, true, "promote pages based on utilization")
 DEFINE_INT(page_promotion_threshold, 70,
-           "min percentage of live bytes on a page to enable fast evacuation")
+           "min percentage of live bytes on a page to enable fast evacuation "
+           "in full GCs")
+DEFINE_INT(minor_ms_page_promotion_threshold, 50,
+           "min percentage of live bytes on a page to enable fast evacuation "
+           "in MinorMS")
+DEFINE_INT(minor_ms_page_promotion_max_lab_threshold, 30,
+           "max percentage of labs out of a page to still be considered for "
+           "page promotion")
+DEFINE_UINT(minor_ms_max_page_age, 4,
+            "max age for a page after which it is force promoted to old space")
+DEFINE_UINT(minor_ms_max_new_space_capacity_mb, 72,
+            "max new space capacity in MBs when using MinorMS. When pointer "
+            "compression is disabled, twice the capacity is used.")
+DEFINE_UINT(scavenger_max_new_space_capacity_mb, 8,
+            "max new space capacity in MBs when using Scavenger. When pointer "
+            "compression is disabled, twice the capacity is used.")
+DEFINE_BOOL(trace_page_promotions, false, "trace page promotion decisions")
 DEFINE_BOOL(trace_pretenuring, false,
             "trace pretenuring decisions of HAllocate instructions")
 DEFINE_BOOL(trace_pretenuring_statistics, false,
@@ -635,6 +752,14 @@ DEFINE_BOOL(trace_block_coverage, false,
 DEFINE_BOOL(trace_protector_invalidation, false,
             "trace protector cell invalidations")
 
+#ifdef V8_MINORMS_STRING_SHORTCUTTING
+DEFINE_BOOL(minor_ms_shortcut_strings, false,
+            "short cut strings during marking")
+#else
+DEFINE_BOOL_READONLY(minor_ms_shortcut_strings, false,
+                     "short cut strings during marking")
+#endif
+
 DEFINE_BOOL(feedback_normalization, false,
             "feed back normalization to constructors")
 // TODO(jkummerow): This currently adds too much load on the stub cache.
@@ -650,47 +775,51 @@ DEFINE_BOOL(unbox_double_arrays, true, "automatically unbox arrays of doubles")
 DEFINE_BOOL_READONLY(string_slices, true, "use string slices")
 
 // Tiering: Sparkplug / feedback vector allocation.
-DEFINE_INT(interrupt_budget_for_feedback_allocation, 940,
-           "The fixed interrupt budget (in bytecode size) for allocating "
-           "feedback vectors")
-DEFINE_INT(interrupt_budget_factor_for_feedback_allocation, 8,
-           "The interrupt budget factor (applied to bytecode size) for "
-           "allocating feedback vectors, used when bytecode size is known")
+DEFINE_INT(invocation_count_for_feedback_allocation, 8,
+           "invocation count required for allocating feedback vectors")
 
 // Tiering: Maglev.
-DEFINE_INT(invocation_count_for_maglev, 100,
-           "interrupt budget which should be used for the profiler counter")
+DEFINE_INT(invocation_count_for_maglev, 400,
+           "invocation count required for optimizing with Maglev")
+DEFINE_INT(invocation_count_for_maglev_osr, 100,
+           "invocation count required for maglev OSR")
+DEFINE_BOOL(osr_from_maglev, false,
+            "whether we try to OSR to Turbofan from OSR'd Maglev")
+DEFINE_BOOL(always_osr_from_maglev, false,
+            "whether we try to OSR to Turbofan from any Maglev")
+DEFINE_VALUE_IMPLICATION(always_osr_from_maglev, osr_from_maglev, true)
 
 // Tiering: Turbofan.
-DEFINE_INT(interrupt_budget, 66 * KB,
-           "interrupt budget which should be used for the profiler counter")
-DEFINE_INT(ticks_before_optimization, 3,
-           "the number of times we have to go through the interrupt budget "
-           "before considering this function for optimization")
-DEFINE_INT(bytecode_size_allowance_per_tick, 150,
-           "increases the number of ticks required for optimization by "
-           "bytecode.length/X")
-DEFINE_INT(invocation_count_for_osr, 500,
-           "number of invocations we want to see after requesting previous "
-           "tier up to increase the OSR urgency")
-DEFINE_INT(
-    max_bytecode_size_for_early_opt, 81,
-    "Maximum bytecode length for a function to be optimized on the first tick")
-DEFINE_BOOL(global_ic_updated_flag, false,
-            "Track, globally, whether any IC changed, and use this in tierup "
-            "heuristics.")
+DEFINE_INT(invocation_count_for_turbofan, 3000,
+           "invocation count required for optimizing with TurboFan")
+DEFINE_INT(invocation_count_for_osr, 500, "invocation count required for OSR")
+DEFINE_INT(osr_to_tierup, 1,
+           "number to decrease the invocation budget by when we follow OSR")
 DEFINE_INT(minimum_invocations_after_ic_update, 500,
            "How long to minimally wait after IC update before tier up")
-DEFINE_BOOL(reset_interrupt_on_ic_update, true,
-            "On IC change, reset the interrupt budget for just that function.")
-DEFINE_BOOL(reset_ticks_on_ic_update, true,
-            "On IC change, reset the ticks for just that function.")
-DEFINE_BOOL(maglev_increase_budget_forward_jump, false,
-            "Increase interrupt budget on forward jumps in maglev code")
-DEFINE_WEAK_VALUE_IMPLICATION(maglev, max_bytecode_size_for_early_opt, 0)
-DEFINE_WEAK_VALUE_IMPLICATION(maglev, ticks_before_optimization, 1)
-DEFINE_WEAK_VALUE_IMPLICATION(maglev, bytecode_size_allowance_per_tick, 10000)
-DEFINE_WEAK_VALUE_IMPLICATION(maglev, reset_ticks_on_ic_update, false)
+DEFINE_INT(minimum_invocations_before_optimization, 2,
+           "Minimum number of invocations we need before non-OSR optimization")
+
+// Tiering: JIT fuzzing.
+//
+// When --jit-fuzzing is enabled, various tiering related thresholds are
+// lowered so that the different JIT tiers are reached roughly within a few
+// dozen executions of the code instead of a few hundred or thousand. As a rule
+// of thumb, aiming for things to happen 5x to 10x sooner in this mode than
+// they otherwise would is probably not unreasonable.
+DEFINE_BOOL(jit_fuzzing, false,
+            "Set JIT tiering thresholds suitable for JIT fuzzing")
+// Tier up to Sparkplug should happen after a handful o executions in ignition.
+DEFINE_NEG_IMPLICATION(jit_fuzzing, lazy_feedback_allocation)
+DEFINE_NEG_IMPLICATION(jit_fuzzing, baseline_batch_compilation)
+// Tier up to Maglev should happen soon afterwards.
+DEFINE_VALUE_IMPLICATION(jit_fuzzing, invocation_count_for_maglev, 10)
+// And tier up to Turbofan should happen after a couple dozen or so executions.
+DEFINE_VALUE_IMPLICATION(jit_fuzzing, invocation_count_for_turbofan, 20)
+// Additionally, some other JIT-related thresholds should also be lowered.
+DEFINE_VALUE_IMPLICATION(jit_fuzzing, invocation_count_for_osr, 5)
+DEFINE_VALUE_IMPLICATION(jit_fuzzing, invocation_count_for_maglev_osr, 1)
+DEFINE_VALUE_IMPLICATION(jit_fuzzing, minimum_invocations_after_ic_update, 5)
 
 // Flags for inline caching and feedback vectors.
 DEFINE_BOOL(use_ic, true, "use inline caching")
@@ -705,6 +834,8 @@ DEFINE_BOOL(ignition_filter_expression_positions, true,
 DEFINE_BOOL(ignition_share_named_property_feedback, true,
             "share feedback slots when loading the same named property from "
             "the same object")
+DEFINE_BOOL(ignition_elide_redundant_tdz_checks, true,
+            "elide TDZ checks dominated by other TDZ checks")
 DEFINE_BOOL(print_bytecode, false,
             "print bytecode generated by ignition interpreter")
 DEFINE_BOOL(enable_lazy_source_positions, V8_LAZY_SOURCE_POSITIONS_BOOL,
@@ -795,8 +926,8 @@ DEFINE_BOOL(trace_baseline_concurrent_compilation, false,
 // Internalize into a shared string table in the shared isolate
 DEFINE_BOOL(shared_string_table, false, "internalize strings into shared table")
 DEFINE_IMPLICATION(harmony_struct, shared_string_table)
-DEFINE_BOOL(
-    always_use_string_forwarding_table, false,
+DEFINE_EXPERIMENTAL_FEATURE(
+    always_use_string_forwarding_table,
     "use string forwarding table instead of thin strings for all strings")
 // With --always-use-string-forwarding-table, we can have young generation
 // string entries in the forwarding table, requiring table updates when these
@@ -829,20 +960,29 @@ DEFINE_INT(concurrent_recompilation_queue_length, 8,
            "the length of the concurrent compilation queue")
 DEFINE_INT(concurrent_recompilation_delay, 0,
            "artificial compilation delay in ms")
+DEFINE_UINT(
+    concurrent_turbofan_max_threads, 0,
+    "max number of threads that concurrent Turbofan can use (0 for unbounded)")
 DEFINE_BOOL(
     stress_concurrent_inlining, false,
     "create additional concurrent optimization jobs but throw away result")
 DEFINE_IMPLICATION(stress_concurrent_inlining, concurrent_recompilation)
 DEFINE_IMPLICATION(stress_concurrent_inlining, turbofan)
 DEFINE_NEG_IMPLICATION(stress_concurrent_inlining, lazy_feedback_allocation)
-DEFINE_WEAK_VALUE_IMPLICATION(stress_concurrent_inlining, interrupt_budget,
-                              15 * KB)
+DEFINE_WEAK_VALUE_IMPLICATION(stress_concurrent_inlining,
+                              invocation_count_for_turbofan, 150)
 DEFINE_BOOL(maglev_overwrite_budget, false,
             "whether maglev resets the interrupt budget")
 DEFINE_WEAK_IMPLICATION(maglev, maglev_overwrite_budget)
 DEFINE_NEG_IMPLICATION(stress_concurrent_inlining, maglev_overwrite_budget)
-DEFINE_WEAK_VALUE_IMPLICATION(maglev_overwrite_budget, interrupt_budget,
-                              200 * KB)
+DEFINE_WEAK_VALUE_IMPLICATION(maglev_overwrite_budget,
+                              invocation_count_for_turbofan, 5000)
+DEFINE_BOOL(maglev_overwrite_osr_budget, false,
+            "whether maglev resets the OSR interrupt budget")
+DEFINE_WEAK_IMPLICATION(maglev_osr, maglev_overwrite_osr_budget)
+DEFINE_NEG_IMPLICATION(stress_concurrent_inlining, maglev_overwrite_osr_budget)
+DEFINE_WEAK_VALUE_IMPLICATION(maglev_overwrite_osr_budget,
+                              invocation_count_for_osr, 800)
 DEFINE_BOOL(stress_concurrent_inlining_attach_code, false,
             "create additional concurrent optimization jobs")
 DEFINE_IMPLICATION(stress_concurrent_inlining_attach_code,
@@ -878,12 +1018,13 @@ DEFINE_BOOL_READONLY(turbofan, false, "use the Turbofan optimizing compiler")
 DEFINE_BOOL_READONLY(opt, false, "use the Turbofan optimizing compiler")
 #endif  // V8_ENABLE_TURBOFAN
 
-DEFINE_BOOL(turbo_sp_frame_access, false,
-            "use stack pointer-relative access to frame wherever possible")
 DEFINE_BOOL(
     stress_turbo_late_spilling, false,
     "optimize placement of all spill instructions, not just loop-top phis")
 
+DEFINE_BOOL(turbo_wasm_address_reassociation, true,
+            "refactor address components for immediate indexing")
+
 DEFINE_STRING(turbo_filter, "*", "optimization filter for TurboFan compiler")
 DEFINE_BOOL(trace_turbo, false, "trace generated TurboFan IR")
 DEFINE_STRING(trace_turbo_path, nullptr,
@@ -900,13 +1041,24 @@ DEFINE_STRING(trace_turbo_cfg_file, nullptr,
 DEFINE_BOOL(trace_turbo_types, true, "trace TurboFan's types")
 DEFINE_BOOL(trace_turbo_scheduler, false, "trace TurboFan's scheduler")
 DEFINE_BOOL(trace_turbo_reduction, false, "trace TurboFan's various reducers")
-DEFINE_BOOL(trace_turbo_trimming, false, "trace TurboFan's graph trimmer")
-DEFINE_BOOL(trace_turbo_jt, false, "trace TurboFan's jump threading")
-DEFINE_BOOL(trace_turbo_ceq, false, "trace TurboFan's control equivalence")
-DEFINE_BOOL(trace_turbo_loop, false, "trace TurboFan's loop optimizations")
-DEFINE_BOOL(trace_turbo_alloc, false, "trace TurboFan's register allocator")
-DEFINE_BOOL(trace_all_uses, false, "trace all use positions")
-DEFINE_BOOL(trace_representation, false, "trace representation types")
+#ifdef V8_ENABLE_SLOW_TRACING
+#define DEFINE_SLOW_TRACING_BOOL DEFINE_BOOL
+#else
+#define DEFINE_SLOW_TRACING_BOOL DEFINE_BOOL_READONLY
+#endif  // V8_ENABLE_SLOW_TRACING
+DEFINE_SLOW_TRACING_BOOL(trace_turbo_trimming, false,
+                         "trace TurboFan's graph trimmer")
+DEFINE_SLOW_TRACING_BOOL(trace_turbo_jt, false,
+                         "trace TurboFan's jump threading")
+DEFINE_SLOW_TRACING_BOOL(trace_turbo_ceq, false,
+                         "trace TurboFan's control equivalence")
+DEFINE_SLOW_TRACING_BOOL(trace_turbo_loop, false,
+                         "trace TurboFan's loop optimizations")
+DEFINE_SLOW_TRACING_BOOL(trace_turbo_alloc, false,
+                         "trace TurboFan's register allocator")
+DEFINE_SLOW_TRACING_BOOL(trace_all_uses, false, "trace all use positions")
+DEFINE_SLOW_TRACING_BOOL(trace_representation, false,
+                         "trace representation types")
 DEFINE_BOOL(
     trace_turbo_stack_accesses, false,
     "trace stack load/store counters for optimized code in run-time (x64 only)")
@@ -965,12 +1117,17 @@ DEFINE_BOOL(trace_turbo_inlining, false, "trace TurboFan inlining")
 DEFINE_BOOL(turbo_inline_array_builtins, true,
             "inline array builtins in TurboFan code")
 DEFINE_BOOL(use_osr, true, "use on-stack replacement")
+DEFINE_BOOL(maglev_osr, true, "use maglev as on-stack replacement target")
+
+// When using maglev as OSR target allow us to tier up further
+DEFINE_WEAK_VALUE_IMPLICATION(maglev_osr, osr_from_maglev, true)
+DEFINE_NEG_VALUE_IMPLICATION(use_osr, maglev_osr, false)
+DEFINE_NEG_VALUE_IMPLICATION(turbofan, osr_from_maglev, false)
 DEFINE_BOOL(concurrent_osr, true, "enable concurrent OSR")
 
-// TODO(dmercadier): re-enable Turbofan's string builder once it's fixed.
+// TODO(dmercadier): fix and re-enable string builder.
 DEFINE_BOOL_READONLY(turbo_string_builder, false,
                      "use TurboFan fast string builder")
-// DEFINE_WEAK_IMPLICATION(future, turbo_string_builder)
 
 DEFINE_BOOL(trace_osr, false, "trace on-stack replacement")
 DEFINE_BOOL(log_or_trace_osr, false,
@@ -994,12 +1151,18 @@ DEFINE_STRING(
     turbo_profiling_output, nullptr,
     "emit data about basic block usage in builtins to this file "
     "(requires that V8 was built with v8_enable_builtins_profiling=true)")
+DEFINE_BOOL(reorder_builtins, false,
+            "enable builtin reordering when run mksnapshot.")
 
 DEFINE_BOOL(abort_on_bad_builtin_profile_data, false,
             "flag for mksnapshot, abort if builtins profile can't be applied")
 DEFINE_BOOL(
     warn_about_builtin_profile_data, false,
     "flag for mksnapshot, emit warnings when applying builtin profile data")
+DEFINE_STRING(
+    dump_builtins_hashes_to_file, nullptr,
+    "flag for mksnapshot, dump CSA builtins graph hashes to this file")
+
 DEFINE_BOOL(turbo_verify_allocation, DEBUG_BOOL,
             "verify register allocation in TurboFan")
 DEFINE_BOOL(turbo_move_optimization, true, "optimize gap moves in TurboFan")
@@ -1019,6 +1182,9 @@ DEFINE_IMPLICATION(turbo_stress_instruction_scheduling,
 DEFINE_BOOL(turbo_store_elimination, true,
             "enable store-store elimination in TurboFan")
 DEFINE_BOOL(trace_store_elimination, false, "trace store elimination")
+DEFINE_BOOL_READONLY(turbo_typer_hardening, true,
+                     "extra bounds checks to protect against some known typer "
+                     "mismatch exploit techniques (best effort)")
 
 #if defined(V8_TARGET_ARCH_X64) || defined(V8_TARGET_ARCH_IA32)
 DEFINE_BOOL(turbo_rewrite_far_jumps, true,
@@ -1036,11 +1202,12 @@ DEFINE_BOOL(
     "simulate GC/compiler thread race related to https://crbug.com/v8/8520")
 DEFINE_BOOL(turbo_fast_api_calls, true, "enable fast API calls from TurboFan")
 #ifdef V8_USE_ZLIB
-DEFINE_BOOL(turbo_compress_translation_arrays, false,
-            "compress translation arrays (experimental)")
+DEFINE_BOOL(turbo_compress_frame_translations, false,
+            "compress deoptimization frame translations (experimental)")
 #else
-DEFINE_BOOL_READONLY(turbo_compress_translation_arrays, false,
-                     "compress translation arrays (experimental)")
+DEFINE_BOOL_READONLY(
+    turbo_compress_frame_translations, false,
+    "compress deoptimization frame translations (experimental)")
 #endif  // V8_USE_ZLIB
 DEFINE_BOOL(turbo_inline_js_wasm_calls, true, "inline JS->Wasm calls")
 DEFINE_BOOL(turbo_use_mid_tier_regalloc_for_huge_functions, true,
@@ -1054,15 +1221,39 @@ DEFINE_BOOL(turbo_optimize_math_minmax, true,
 
 DEFINE_BOOL(turbo_collect_feedback_in_generic_lowering, false,
             "enable experimental feedback collection in generic lowering.")
-DEFINE_BOOL(isolate_script_cache_ageing, true,
-            "enable ageing of the isolate script cache.")
 
-DEFINE_EXPERIMENTAL_FEATURE(turboshaft,
-                            "enable TurboFan's Turboshaft phases for JS")
+DEFINE_BOOL(turboshaft, false, "enable TurboFan's Turboshaft phases for JS")
+DEFINE_WEAK_IMPLICATION(future, turboshaft)
+
 DEFINE_BOOL(turboshaft_trace_reduction, false,
             "trace individual Turboshaft reduction steps")
+DEFINE_BOOL(turboshaft_enable_debug_features, false,
+            "enables Turboshaft's DebugPrint, StaticAssert and "
+            "CheckTurboshaftTypeOf operations")
 DEFINE_EXPERIMENTAL_FEATURE(turboshaft_wasm,
                             "enable TurboFan's Turboshaft phases for wasm")
+DEFINE_EXPERIMENTAL_FEATURE(turboshaft_typed_optimizations,
+                            "enable an additional Turboshaft phase that "
+                            "performs optimizations based on type information")
+DEFINE_EXPERIMENTAL_FEATURE(
+    turboshaft_instruction_selection,
+    "run instruction selection on Turboshaft IR directly")
+DEFINE_EXPERIMENTAL_FEATURE(turboshaft_load_elimination,
+                            "enable Turboshaft's low-level load elimination")
+DEFINE_EXPERIMENTAL_FEATURE(turboshaft_machine_lowering_opt,
+                            "enable MachineOptimization during MachineLowering")
+DEFINE_EXPERIMENTAL_FEATURE(
+    turboshaft_future,
+    "enable Turboshaft features that we want to ship in the not-too-far future")
+DEFINE_IMPLICATION(turboshaft_future, turboshaft)
+DEFINE_WEAK_IMPLICATION(turboshaft_future, turboshaft_load_elimination)
+DEFINE_WEAK_IMPLICATION(turboshaft_future, turboshaft_machine_lowering_opt)
+// TODO(nicohartmann): re-enable turboshaft instruction selection behind
+// turboshaft future.
+// #ifdef V8_TARGET_ARCH_X64
+// DEFINE_WEAK_IMPLICATION(turboshaft_future, turboshaft_instruction_selection)
+// #endif
+
 #ifdef DEBUG
 DEFINE_UINT64(turboshaft_opt_bisect_limit, std::numeric_limits<uint64_t>::max(),
               "stop applying optional optimizations after a specified number "
@@ -1089,6 +1280,9 @@ DEFINE_VALUE_IMPLICATION(optimize_for_size, max_semi_space_size, size_t{1})
 DEFINE_BOOL(wasm_generic_wrapper, true,
             "allow use of the generic js-to-wasm wrapper instead of "
             "per-signature wrappers")
+DEFINE_BOOL(wasm_to_js_generic_wrapper, false,
+            "allow use of the generic wasm-to-js wrapper instead of "
+            "per-signature wrappers")
 DEFINE_BOOL(enable_wasm_arm64_generic_wrapper, true,
             "allow use of the generic js-to-wasm wrapper instead of "
             "per-signature wrappers on arm64")
@@ -1098,8 +1292,9 @@ DEFINE_INT(wasm_num_compilation_tasks, 128,
 DEFINE_VALUE_IMPLICATION(single_threaded, wasm_num_compilation_tasks, 0)
 DEFINE_DEBUG_BOOL(trace_wasm_native_heap, false,
                   "trace wasm native heap events")
-DEFINE_BOOL(wasm_memory_protection_keys, true,
-            "protect wasm code memory with PKU if available")
+DEFINE_BOOL(trace_wasm_offheap_memory, false,
+            "print details of wasm off-heap memory when the memory measurement "
+            "API is used")
 DEFINE_DEBUG_BOOL(trace_wasm_serialization, false,
                   "trace serialization/deserialization")
 DEFINE_BOOL(wasm_async_compilation, true,
@@ -1124,8 +1319,10 @@ DEFINE_BOOL(wasm_tier_up, true,
 DEFINE_BOOL(wasm_dynamic_tiering, true,
             "enable dynamic tier up to the optimizing compiler")
 DEFINE_NEG_NEG_IMPLICATION(liftoff, wasm_dynamic_tiering)
-DEFINE_INT(wasm_tiering_budget, 1800000,
+DEFINE_INT(wasm_tiering_budget, 13'000'000,
            "budget for dynamic tiering (rough approximation of bytes executed")
+DEFINE_INT(wasm_wrapper_tiering_budget, wasm::kGenericWrapperBudget,
+           "budget for wrapper tierup (number of calls until tier-up)")
 DEFINE_INT(max_wasm_functions, wasm::kV8MaxWasmFunctions,
            "maximum number of wasm functions supported in a module")
 DEFINE_INT(
@@ -1136,8 +1333,6 @@ DEFINE_BOOL(trace_wasm_compilation_times, false,
 DEFINE_INT(wasm_tier_up_filter, -1, "only tier-up function with this index")
 DEFINE_DEBUG_BOOL(trace_wasm_decoder, false, "trace decoding of wasm code")
 DEFINE_DEBUG_BOOL(trace_wasm_compiler, false, "trace compiling of wasm code")
-DEFINE_DEBUG_BOOL(trace_wasm_interpreter, false,
-                  "trace interpretation of wasm code")
 DEFINE_DEBUG_BOOL(trace_wasm_streaming, false,
                   "trace streaming compilation of wasm code")
 DEFINE_DEBUG_BOOL(trace_wasm_stack_switching, false,
@@ -1162,14 +1357,18 @@ DEFINE_DEBUG_BOOL(trace_liftoff, false,
                   "trace Liftoff, the baseline compiler for WebAssembly")
 DEFINE_BOOL(trace_wasm_memory, false,
             "print all memory updates performed in wasm code")
-// Fuzzers use {wasm_tier_mask_for_testing} and {wasm_debug_mask_for_testing}
-// together with {liftoff} and {no_wasm_tier_up} to force some functions to be
-// compiled with TurboFan or for debug.
+// Fuzzers use {wasm_tier_mask_for_testing}, {wasm_debug_mask_for_testing}, and
+// {wasm_turboshaft_mask_for_testing} together with {liftoff} and
+// {no_wasm_tier_up} to force some functions to be compiled with TurboFan or for
+// debug.
 DEFINE_INT(wasm_tier_mask_for_testing, 0,
            "bitmask of functions to compile with TurboFan instead of Liftoff")
 DEFINE_INT(wasm_debug_mask_for_testing, 0,
            "bitmask of functions to compile for debugging, only applies if the "
            "tier is Liftoff")
+DEFINE_INT(
+    wasm_turboshaft_mask_for_testing, 0,
+    "bitmask of functions to compile with Turboshaft instead of TurboFan")
 // TODO(clemensb): Introduce experimental_wasm_pgo to read from a custom section
 // instead of from a local file.
 DEFINE_BOOL(
@@ -1240,27 +1439,29 @@ DEFINE_NEG_NEG_IMPLICATION(wasm_bounds_checks, wasm_enforce_bounds_checks)
 DEFINE_BOOL(wasm_math_intrinsics, true,
             "intrinsify some Math imports into wasm")
 
-DEFINE_BOOL(
-    wasm_inlining, false,
-    "enable inlining of wasm functions into wasm functions (experimental)")
 DEFINE_SIZE_T(wasm_inlining_budget, 5000,
               "maximum graph size (in TF nodes) that allows inlining more")
 DEFINE_SIZE_T(wasm_inlining_max_size, 500,
               "maximum function size (in wire bytes) that may be inlined")
-DEFINE_BOOL(wasm_speculative_inlining, false,
-            "enable speculative inlining of call_ref targets (experimental)")
+DEFINE_SIZE_T(
+    wasm_inlining_factor, 3,
+    "maximum multiple graph size (in TF nodes) in comparison to initial size")
+DEFINE_SIZE_T(wasm_inlining_min_budget, 50,
+              "minimum graph size budget (in TF nodes) for which the "
+              "wasm_inlinining_factor does not apply")
 DEFINE_BOOL(trace_wasm_inlining, false, "trace wasm inlining")
-DEFINE_BOOL(trace_wasm_speculative_inlining, false,
-            "trace wasm speculative inlining")
 DEFINE_BOOL(trace_wasm_typer, false, "trace wasm typer")
 DEFINE_BOOL(wasm_final_types, false,
             "enable final types as default for wasm-gc")
-DEFINE_IMPLICATION(wasm_speculative_inlining, wasm_inlining)
-DEFINE_WEAK_IMPLICATION(experimental_wasm_gc, wasm_speculative_inlining)
-// For historical reasons, both --wasm-inlining and --wasm-speculative-inlining
-// are aliases for --experimental-wasm-inlining.
-DEFINE_IMPLICATION(wasm_inlining, experimental_wasm_inlining)
-DEFINE_IMPLICATION(wasm_speculative_inlining, experimental_wasm_inlining)
+// Disable GC proposal prototype instructions that are not part of the prototype
+// spec any more but are kept in V8 until the final op-code reshuffling.
+DEFINE_BOOL(wasm_disable_deprecated, false,
+            "disable deprecated gc instructions")
+
+DEFINE_WEAK_IMPLICATION(experimental_wasm_gc, experimental_wasm_inlining)
+DEFINE_WEAK_IMPLICATION(experimental_wasm_gc, experimental_wasm_js_inlining)
+// Stage wasm inlining in --future.
+DEFINE_WEAK_IMPLICATION(future, experimental_wasm_inlining)
 
 DEFINE_BOOL(wasm_loop_unrolling, true,
             "enable loop unrolling for wasm functions")
@@ -1322,8 +1523,9 @@ DEFINE_DEBUG_BOOL(trace_wasm_instances, false,
 
 // Flags for WASM SIMD256 revectorize
 #ifdef V8_ENABLE_WASM_SIMD256_REVEC
-DEFINE_BOOL(experimental_wasm_revectorize, false,
-            "enable 128 to 256 bit revectorization for Webassembly SIMD")
+DEFINE_EXPERIMENTAL_FEATURE(
+    experimental_wasm_revectorize,
+    "enable 128 to 256 bit revectorization for Webassembly SIMD")
 DEFINE_BOOL(trace_wasm_revectorize, false, "trace wasm revectorize")
 #endif  // V8_ENABLE_WASM_SIMD256_REVEC
 
@@ -1375,6 +1577,7 @@ DEFINE_BOOL(trace_gc_nvp, false,
             "after each garbage collection")
 DEFINE_BOOL(trace_gc_ignore_scavenger, false,
             "do not print trace line after scavenger collection")
+DEFINE_BOOL(trace_memory_reducer, false, "print memory reducer behavior")
 DEFINE_BOOL(trace_idle_notification, false,
             "print one trace line following each idle notification")
 DEFINE_BOOL(trace_idle_notification_verbose, false,
@@ -1412,35 +1615,36 @@ DEFINE_INT(trace_duplicate_threshold_kb, 0,
 DEFINE_BOOL(trace_fragmentation, false, "report fragmentation for old space")
 DEFINE_BOOL(trace_fragmentation_verbose, false,
             "report fragmentation for old space (detailed)")
-DEFINE_BOOL(minor_mc_trace_fragmentation, false,
+DEFINE_BOOL(minor_ms_trace_fragmentation, false,
             "trace fragmentation after marking")
 DEFINE_BOOL(trace_evacuation, false, "report evacuation statistics")
 DEFINE_BOOL(trace_mutator_utilization, false,
             "print mutator utilization, allocation speed, gc speed")
 DEFINE_BOOL(incremental_marking, true, "use incremental marking")
-DEFINE_BOOL(incremental_marking_wrappers, true,
-            "use incremental marking for marking wrappers")
+DEFINE_BOOL(incremental_marking_bailout_when_ahead_of_schedule, true,
+            "bails out of incremental marking when ahead of schedule")
 DEFINE_BOOL(incremental_marking_task, true, "use tasks for incremental marking")
+DEFINE_INT(incremental_marking_task_delay_ms, 0,
+           "incremental marking task delay. 0 means not using delayed tasks.")
 DEFINE_INT(incremental_marking_soft_trigger, 0,
            "threshold for starting incremental marking via a task in percent "
            "of available space: limit - size")
-DEFINE_BOOL(fast_forward_schedule, false, "Fast forwards marking schedule")
 DEFINE_INT(incremental_marking_hard_trigger, 0,
            "threshold for starting incremental marking immediately in percent "
            "of available space: limit - size")
 DEFINE_BOOL(trace_unmapper, false, "Trace the unmapping")
 DEFINE_BOOL(parallel_scavenge, true, "parallel scavenge")
 DEFINE_BOOL(minor_gc_task, true, "schedule scavenge tasks")
-DEFINE_INT(minor_gc_task_trigger, 80,
-           "minor GC task trigger in percent of the current heap limit")
+DEFINE_UINT(minor_gc_task_trigger, 80,
+            "minor GC task trigger in percent of the current heap limit")
 DEFINE_BOOL(scavenge_separate_stack_scanning, false,
             "use a separate phase for stack scanning in scavenge")
 DEFINE_BOOL(trace_parallel_scavenge, false, "trace parallel scavenge")
 DEFINE_EXPERIMENTAL_FEATURE(
     cppgc_young_generation,
     "run young generation garbage collections in Oilpan")
-// CppGC young generation (enables unified young heap) is based on Minor MC.
-DEFINE_IMPLICATION(cppgc_young_generation, minor_mc)
+// CppGC young generation (enables unified young heap) is based on Minor MS.
+DEFINE_IMPLICATION(cppgc_young_generation, minor_ms)
 // Unified young generation disables the unmodified wrapper reclamation
 // optimization.
 DEFINE_NEG_IMPLICATION(cppgc_young_generation, reclaim_unmodified_wrappers)
@@ -1470,6 +1674,8 @@ DEFINE_NEG_NEG_IMPLICATION(concurrent_sweeping,
 DEFINE_BOOL(parallel_compaction, true, "use parallel compaction")
 DEFINE_BOOL(parallel_pointer_update, true,
             "use parallel pointer update during compaction")
+DEFINE_BOOL(parallel_weak_ref_clearing, true,
+            "use parallel threads to clear weak refs in the atomic pause.")
 DEFINE_BOOL(detect_ineffective_gcs_near_heap_limit, true,
             "trigger out-of-memory failure to avoid GC storm near heap limit")
 DEFINE_BOOL(trace_incremental_marking, false,
@@ -1530,6 +1736,9 @@ DEFINE_BOOL(memory_reducer_for_small_heaps, true,
             "use memory reducer for small heaps")
 DEFINE_BOOL(memory_reducer_single_gc, false,
             "only schedule a single GC from memory reducer")
+DEFINE_WEAK_IMPLICATION(future, memory_reducer_single_gc)
+DEFINE_INT(memory_reducer_gc_count, 3,
+           "Maximum number of memory reducer GCs scheduled")
 DEFINE_INT(heap_growing_percent, 0,
            "specifies heap growing factor as (1 + heap_growing_percent/100)")
 DEFINE_INT(v8_os_page_size, 0, "override OS page size (in KBytes)")
@@ -1557,9 +1766,14 @@ DEFINE_BOOL(flush_baseline_code, false,
             "flush of baseline code when it has not been executed recently")
 DEFINE_BOOL(flush_bytecode, true,
             "flush of bytecode when it has not been executed recently")
-DEFINE_INT(bytecode_old_age, 5, "number of gcs before we flush code")
+DEFINE_INT(bytecode_old_age, 6, "number of gcs before we flush code")
+DEFINE_BOOL(flush_code_based_on_time, false,
+            "Use time-base code flushing instead of age.")
+DEFINE_BOOL(flush_code_based_on_tab_visibility, false,
+            "Flush code when tab goes into the background.")
+DEFINE_INT(bytecode_old_time, 30, "number of seconds before we flush code")
 DEFINE_BOOL(stress_flush_code, false, "stress code flushing")
-DEFINE_BOOL(trace_flush_bytecode, false, "trace bytecode flushing")
+DEFINE_BOOL(trace_flush_code, false, "trace bytecode flushing")
 DEFINE_BOOL(use_marking_progress_bar, true,
             "Use a progress bar to scan large objects in increments when "
             "incremental marking is active.")
@@ -1593,6 +1807,9 @@ DEFINE_BOOL(gc_experiment_less_compaction, false,
 DEFINE_INT(gc_memory_reducer_start_delay_ms, 8000,
            "Delay before memory reducer start")
 
+DEFINE_BOOL(concurrent_marking_high_priority_threads, false,
+            "use high priority threads for concurrent Marking")
+
 DEFINE_BOOL(disable_abortjs, false, "disables AbortJS runtime function")
 
 DEFINE_BOOL(randomize_all_allocations, false,
@@ -1605,9 +1822,6 @@ DEFINE_BOOL(manual_evacuation_candidates_selection, false,
 
 DEFINE_BOOL(clear_free_memory, false, "initialize free memory with 0")
 
-DEFINE_BOOL(crash_on_aborted_evacuation, false,
-            "crash when evacuation of page fails")
-
 // v8::CppHeap flags that allow fine-grained control of how C++ memory is
 // reclaimed in the garbage collector.
 DEFINE_BOOL(cppheap_incremental_marking, false,
@@ -1621,6 +1835,15 @@ DEFINE_NEG_NEG_IMPLICATION(cppheap_incremental_marking,
                            cppheap_concurrent_marking)
 DEFINE_WEAK_IMPLICATION(concurrent_marking, cppheap_concurrent_marking)
 
+DEFINE_BOOL(memory_balancer, false,
+            "use membalancer, "
+            "a new heap limit balancing algorithm")
+DEFINE_FLOAT(memory_balancer_c_value, 3e-10,
+             "c value for membalancer. "
+             "A special constant to balance between memory and space tradeoff. "
+             "The smaller the more memory it uses.")
+DEFINE_NEG_IMPLICATION(memory_balancer, memory_reducer)
+
 // assembler-ia32.cc / assembler-arm.cc / assembler-arm64.cc / assembler-x64.cc
 #ifdef V8_ENABLE_DEBUG_CODE
 DEFINE_BOOL(debug_code, DEBUG_BOOL,
@@ -1758,6 +1981,12 @@ DEFINE_INT(switch_table_spread_threshold, 3,
 DEFINE_INT(switch_table_min_cases, 6,
            "the number of Smi integer cases present in the switch statement "
            "before using the jump table optimization")
+// Note that enabling this stress mode might result in a failure to compile
+// even a top-level code.
+DEFINE_INT(stress_lazy_compilation, 0,
+           "stress lazy compilation by simulating stack overflow during "
+           "unoptimized bytecode generation with 1/n-th probability, "
+           "do nothing on 0")
 
 // codegen-ia32.cc / codegen-arm.cc
 DEFINE_BOOL(trace, false, "trace javascript function calls")
@@ -1769,6 +1998,7 @@ DEFINE_BOOL(lazy_streaming, true,
             "use lazy compilation during streaming compilation")
 DEFINE_BOOL(max_lazy, false, "ignore eager compilation hints")
 DEFINE_IMPLICATION(max_lazy, lazy)
+DEFINE_BOOL(compile_hints_magic, false, "enable magic compile hints comments")
 DEFINE_BOOL(trace_opt, false, "trace optimized compilation")
 DEFINE_BOOL(trace_opt_verbose, false,
             "extra verbose optimized compilation tracing")
@@ -1827,7 +2057,7 @@ DEFINE_BOOL(
 DEFINE_BOOL(hard_abort, true, "abort by crashing")
 DEFINE_NEG_IMPLICATION(fuzzing, hard_abort)
 
-DEFINE_BOOL(experimental_value_unavailable, false,
+DEFINE_BOOL(experimental_value_unavailable, true,
             "enable experimental <value unavailable> in scopes")
 
 // disassembler
@@ -1863,6 +2093,7 @@ DEFINE_INT(heap_snapshot_string_limit, 1024,
            "truncate strings to this length in the heap snapshot")
 DEFINE_BOOL(heap_profiler_show_hidden_objects, false,
             "use 'native' rather than 'hidden' node type in snapshot")
+DEFINE_BOOL(profile_heap_snapshot, false, "dump time spent on heap snapshot")
 #ifdef V8_ENABLE_HEAP_SNAPSHOT_VERIFY
 DEFINE_BOOL(heap_snapshot_verify, false,
             "verify that heap snapshot matches marking visitor behavior")
@@ -2073,6 +2304,13 @@ DEFINE_UINT(regexp_backtracks_before_fallback, 50000,
             "to experimental engine if "
             "enable_experimental_regexp_engine_on_excessive_backtracks is set")
 
+DEFINE_BOOL(trace_read_only_promotion, false,
+            "trace the read-only promotion pass")
+DEFINE_BOOL(trace_read_only_promotion_verbose, false,
+            "trace the read-only promotion pass")
+DEFINE_WEAK_IMPLICATION(trace_read_only_promotion_verbose,
+                        trace_read_only_promotion)
+
 // Testing flags test/cctest/test-{flags,api,serialization}.cc
 DEFINE_BOOL(testing_bool_flag, true, "testing_bool_flag")
 DEFINE_MAYBE_BOOL(testing_maybe_bool_flag, "testing_maybe_bool_flag")
@@ -2119,9 +2357,11 @@ DEFINE_STRING(embedded_src, nullptr,
 DEFINE_STRING(
     embedded_variant, nullptr,
     "Label to disambiguate symbols in embedded data file. (mksnapshot only)")
+#if V8_STATIC_ROOTS_GENERATION_BOOL
 DEFINE_STRING(static_roots_src, nullptr,
               "Path for writing a fresh static-roots.h. (mksnapshot only, "
               "build without static roots only)")
+#endif
 DEFINE_STRING(startup_src, nullptr,
               "Write V8 startup as C++ src. (mksnapshot only)")
 DEFINE_STRING(startup_blob, nullptr,
@@ -2134,8 +2374,11 @@ DEFINE_BOOL(target_is_simulator, false,
             "simulator and it can generate simulator-specific instructions. "
             "(mksnapshot only)")
 DEFINE_STRING(turbo_profiling_input, nullptr,
-              "Path of the input file containing basic block counters for "
+              "Path of the input file containing basic information for "
               "builtins. (mksnapshot only)")
+DEFINE_STRING(turbo_log_builtins_count_input, nullptr,
+              "Path of the input file containing basic block counters for "
+              "builtins for logging in turbolizer. (mksnapshot only)")
 
 // On some platforms, the .text section only has execute permissions.
 DEFINE_BOOL(text_is_readable, true,
@@ -2143,17 +2386,33 @@ DEFINE_BOOL(text_is_readable, true,
 DEFINE_NEG_NEG_IMPLICATION(text_is_readable, partial_constant_pool)
 
 //
-// Minor mark compact collector flags.
+// Minor mark sweep collector flags.
 //
-DEFINE_BOOL(trace_minor_mc_parallel_marking, false,
+DEFINE_BOOL(trace_minor_ms_parallel_marking, false,
             "trace parallel marking for the young generation")
-DEFINE_EXPERIMENTAL_FEATURE(minor_mc,
-                            "perform young generation mark compact GCs")
-DEFINE_IMPLICATION(minor_mc, separate_gc_phases)
+DEFINE_BOOL(minor_ms, false, "perform young generation mark sweep GCs")
+DEFINE_IMPLICATION(minor_ms, separate_gc_phases)
+DEFINE_IMPLICATION(minor_ms, page_promotion)
 
-DEFINE_EXPERIMENTAL_FEATURE(concurrent_minor_mc_marking,
-                            "perform young generation marking concurrently")
-DEFINE_NEG_NEG_IMPLICATION(concurrent_marking, concurrent_minor_mc_marking)
+DEFINE_BOOL(concurrent_minor_ms_marking, false,
+            "perform young generation marking concurrently")
+DEFINE_NEG_NEG_IMPLICATION(concurrent_marking, concurrent_minor_ms_marking)
+DEFINE_IMPLICATION(concurrent_minor_ms_marking, minor_ms)
+
+#ifndef DEBUG
+#define V8_MINOR_MS_CONCURRENT_MARKING_MIN_CAPACITY_DEFAULT 8
+#else
+#define V8_MINOR_MS_CONCURRENT_MARKING_MIN_CAPACITY_DEFAULT 0
+#endif
+
+DEFINE_UINT(minor_ms_min_new_space_capacity_for_concurrent_marking_mb,
+            V8_MINOR_MS_CONCURRENT_MARKING_MIN_CAPACITY_DEFAULT,
+            "min new space capacity in MBs for using young generation "
+            "concurrent marking.")
+
+DEFINE_UINT(minor_ms_concurrent_marking_trigger, 90,
+            "minor ms concurrent marking trigger in percent of the current new "
+            "space capacity")
 
 //
 // Dev shell flags
@@ -2281,6 +2540,10 @@ DEFINE_BOOL(log, false,
             "Minimal logging (no API, code, GC, suspect, or handles samples).")
 DEFINE_BOOL(log_all, false, "Log all events to the log file.")
 
+DEFINE_BOOL(log_internal_timer_events, false, "See --log-timer-events")
+DEFINE_BOOL(log_timer_events, false,
+            "Log timer events (incl. console.time* and Date.now).")
+
 DEFINE_BOOL(log_source_code, false, "Log source code.")
 DEFINE_BOOL(log_source_position, false, "Log detailed source information.")
 DEFINE_BOOL(log_code, false,
@@ -2328,15 +2591,28 @@ DEFINE_BOOL(ll_prof, false, "Enable low-level linux profiler.")
 #define DEFINE_PERF_PROF_IMPLICATION(...)
 #endif
 
+#if defined(ANDROID)
+#define DEFAULT_PERF_BASIC_PROF_PATH "/data/local/tmp"
+#define DEFAULT_PERF_PROF_PATH DEFAULT_PERF_BASIC_PROF_PATH
+#else
+#define DEFAULT_PERF_BASIC_PROF_PATH "/tmp"
+#define DEFAULT_PERF_PROF_PATH "."
+#endif
+
 DEFINE_PERF_PROF_BOOL(perf_basic_prof,
                       "Enable perf linux profiler (basic support).")
 DEFINE_NEG_IMPLICATION(perf_basic_prof, compact_code_space)
+DEFINE_STRING(perf_basic_prof_path, DEFAULT_PERF_BASIC_PROF_PATH,
+              "directory to write perf-<pid>.map symbol file to")
 DEFINE_PERF_PROF_BOOL(
     perf_basic_prof_only_functions,
     "Only report function code ranges to perf (i.e. no stubs).")
 DEFINE_PERF_PROF_IMPLICATION(perf_basic_prof_only_functions, perf_basic_prof)
+
 DEFINE_PERF_PROF_BOOL(
     perf_prof, "Enable perf linux profiler (experimental annotate support).")
+DEFINE_STRING(perf_prof_path, DEFAULT_PERF_PROF_PATH,
+              "directory to write jit-<pid>.dump symbol file to")
 DEFINE_PERF_PROF_BOOL(
     perf_prof_annotate_wasm,
     "Used with --perf-prof, load wasm source map and provide annotate "
@@ -2366,8 +2642,6 @@ DEFINE_BOOL_READONLY(
 
 DEFINE_STRING(gc_fake_mmap, "/tmp/__v8_gc__",
               "Specify the name of the file for fake gc mmap used in ll_prof")
-DEFINE_BOOL(log_internal_timer_events, false, "Time internal events.")
-DEFINE_IMPLICATION(log_internal_timer_events, prof)
 
 DEFINE_BOOL(redirect_code_traces, false,
             "output deopt information and disassembly into file "
@@ -2392,8 +2666,6 @@ DEFINE_BOOL(interpreted_frames_native_stack, false,
 DEFINE_BOOL(enable_etw_stack_walking, false,
             "Enable etw stack walking for windows")
 DEFINE_WEAK_IMPLICATION(future, enable_etw_stack_walking)
-// Don't move code objects.
-DEFINE_NEG_IMPLICATION(enable_etw_stack_walking, compact_code_space)
 #else
 DEFINE_BOOL_READONLY(enable_etw_stack_walking, false,
                      "Enable etw stack walking for windows")
@@ -2452,6 +2724,10 @@ DEFINE_NEG_IMPLICATION(predictable, stress_concurrent_inlining)
 DEFINE_NEG_IMPLICATION(predictable, lazy_compile_dispatcher)
 DEFINE_NEG_IMPLICATION(predictable, parallel_compile_tasks_for_eager_toplevel)
 DEFINE_NEG_IMPLICATION(predictable, parallel_compile_tasks_for_lazy)
+#ifdef V8_ENABLE_MAGLEV
+DEFINE_NEG_IMPLICATION(predictable, maglev_deopt_data_on_background)
+DEFINE_NEG_IMPLICATION(predictable, maglev_build_code_on_background)
+#endif  // V8_ENABLE_MAGLEV
 
 DEFINE_BOOL(predictable_gc_schedule, false,
             "Predictable garbage collection schedule. Fixes heap growing, "
@@ -2475,6 +2751,10 @@ DEFINE_NEG_IMPLICATION(single_threaded, lazy_compile_dispatcher)
 DEFINE_NEG_IMPLICATION(single_threaded,
                        parallel_compile_tasks_for_eager_toplevel)
 DEFINE_NEG_IMPLICATION(single_threaded, parallel_compile_tasks_for_lazy)
+#ifdef V8_ENABLE_MAGLEV
+DEFINE_NEG_IMPLICATION(single_threaded, maglev_deopt_data_on_background)
+DEFINE_NEG_IMPLICATION(single_threaded, maglev_build_code_on_background)
+#endif  // V8_ENABLE_MAGLEV
 
 //
 // Parallel and concurrent GC (Orinoco) related flags.
@@ -2485,11 +2765,15 @@ DEFINE_NEG_IMPLICATION(single_threaded_gc, concurrent_sweeping)
 DEFINE_NEG_IMPLICATION(single_threaded_gc, parallel_compaction)
 DEFINE_NEG_IMPLICATION(single_threaded_gc, parallel_marking)
 DEFINE_NEG_IMPLICATION(single_threaded_gc, parallel_pointer_update)
+DEFINE_NEG_IMPLICATION(single_threaded_gc, parallel_weak_ref_clearing)
 DEFINE_NEG_IMPLICATION(single_threaded_gc, parallel_scavenge)
 DEFINE_NEG_IMPLICATION(single_threaded_gc, concurrent_array_buffer_sweeping)
 DEFINE_NEG_IMPLICATION(single_threaded_gc, stress_concurrent_allocation)
 DEFINE_NEG_IMPLICATION(single_threaded_gc, cppheap_concurrent_marking)
 
+DEFINE_BOOL(single_threaded_gc_in_background, false,
+            "disable the use of background gc tasks when in background")
+
 #if defined(V8_USE_LIBM_TRIG_FUNCTIONS)
 DEFINE_BOOL(use_libm_trig_functions, true, "use libm trig functions")
 #endif
diff --git a/deps/v8/src/flags/flags.cc b/deps/v8/src/flags/flags.cc
index e41b71f85ec657..6aec81f35608f9 100644
--- a/deps/v8/src/flags/flags.cc
+++ b/deps/v8/src/flags/flags.cc
@@ -10,6 +10,7 @@
 #include <cstdlib>
 #include <cstring>
 #include <iomanip>
+#include <set>
 #include <sstream>
 
 #include "src/base/functional.h"
@@ -103,7 +104,12 @@ struct Flag {
   const char* cmt_;     // A comment about the flags purpose.
   bool owns_ptr_;       // Does the flag own its string value?
   SetBy set_by_ = SetBy::kDefault;
+  // Name of the flag implying this flag, if any.
   const char* implied_by_ = nullptr;
+#ifdef DEBUG
+  // Pointer to the flag implying this flag, if any.
+  const Flag* implied_by_ptr_ = nullptr;
+#endif
 
   FlagType type() const { return type_; }
 
@@ -113,6 +119,17 @@ struct Flag {
 
   bool PointsTo(const void* ptr) const { return valptr_ == ptr; }
 
+#ifdef DEBUG
+  bool ImpliedBy(const void* ptr) const {
+    const Flag* current = this->implied_by_ptr_;
+    while (current != nullptr) {
+      if (current->PointsTo(ptr)) return true;
+      current = current->implied_by_ptr_;
+    }
+    return false;
+  }
+#endif
+
   bool bool_variable() const { return GetValue<TYPE_BOOL, bool>(); }
 
   void set_bool_variable(bool value, SetBy set_by) {
@@ -333,6 +350,15 @@ struct Flag {
     if (IsAnyImplication(new_set_by)) {
       DCHECK_NOT_NULL(implied_by);
       implied_by_ = implied_by;
+#ifdef DEBUG
+      // This only works when implied_by is a flag_name or !flag_name, but it
+      // can also be a condition e.g. flag_name > 3. Since this is only used for
+      // checks in DEBUG mode, we will just ignore the more complex conditions
+      // for now - that will just lead to a nullptr which won't be followed.
+      implied_by_ptr_ = static_cast<Flag*>(
+          FindFlagByName(implied_by[0] == '!' ? implied_by + 1 : implied_by));
+      DCHECK_NE(implied_by_ptr_, this);
+#endif
     }
     return change_flag;
   }
@@ -534,15 +560,71 @@ uint32_t ComputeFlagListHash() {
   std::ostringstream modified_args_as_string;
   if (COMPRESS_POINTERS_BOOL) modified_args_as_string << "ptr-compr";
   if (DEBUG_BOOL) modified_args_as_string << "debug";
+
+#ifdef DEBUG
+  // These two sets are used to check that we don't leave out any flags
+  // implied by --predictable in the list below.
+  std::set<const char*> flags_implied_by_predictable;
+  std::set<const char*> flags_ignored_because_of_predictable;
+#endif
+
   for (const Flag& flag : flags) {
     if (flag.IsDefault()) continue;
+#ifdef DEBUG
+    if (flag.ImpliedBy(&v8_flags.predictable)) {
+      flags_implied_by_predictable.insert(flag.name());
+    }
+#endif
     // We want to be able to flip --profile-deserialization without
     // causing the code cache to get invalidated by this hash.
     if (flag.PointsTo(&v8_flags.profile_deserialization)) continue;
-    // Skip v8_flags.random_seed to allow predictable code caching.
+    // Skip v8_flags.random_seed and v8_flags.predictable to allow predictable
+    // code caching.
     if (flag.PointsTo(&v8_flags.random_seed)) continue;
+    if (flag.PointsTo(&v8_flags.predictable)) continue;
+
+    // The following flags are implied by --predictable (some negated).
+    if (flag.PointsTo(&v8_flags.concurrent_sparkplug) ||
+        flag.PointsTo(&v8_flags.concurrent_recompilation) ||
+#ifdef V8_ENABLE_MAGLEV
+        flag.PointsTo(&v8_flags.maglev_deopt_data_on_background) ||
+        flag.PointsTo(&v8_flags.maglev_build_code_on_background) ||
+#endif
+        flag.PointsTo(&v8_flags.parallel_scavenge) ||
+        flag.PointsTo(&v8_flags.concurrent_marking) ||
+        flag.PointsTo(&v8_flags.concurrent_array_buffer_sweeping) ||
+        flag.PointsTo(&v8_flags.parallel_marking) ||
+        flag.PointsTo(&v8_flags.concurrent_sweeping) ||
+        flag.PointsTo(&v8_flags.parallel_compaction) ||
+        flag.PointsTo(&v8_flags.parallel_pointer_update) ||
+        flag.PointsTo(&v8_flags.parallel_weak_ref_clearing) ||
+        flag.PointsTo(&v8_flags.memory_reducer) ||
+        flag.PointsTo(&v8_flags.cppheap_concurrent_marking) ||
+        flag.PointsTo(&v8_flags.cppheap_incremental_marking) ||
+        flag.PointsTo(&v8_flags.single_threaded_gc)) {
+#ifdef DEBUG
+      if (flag.ImpliedBy(&v8_flags.predictable)) {
+        flags_ignored_because_of_predictable.insert(flag.name());
+      }
+#endif
+      continue;
+    }
     modified_args_as_string << flag;
   }
+
+#ifdef DEBUG
+  for (const char* name : flags_implied_by_predictable) {
+    if (flags_ignored_because_of_predictable.find(name) ==
+        flags_ignored_because_of_predictable.end()) {
+      PrintF(
+          "%s should be added to the list of "
+          "flags_ignored_because_of_predictable\n",
+          name);
+      UNREACHABLE();
+    }
+  }
+#endif
+
   std::string args(modified_args_as_string.str());
   // Generate a hash that is not 0.
   uint32_t hash = static_cast<uint32_t>(base::hash_range(
diff --git a/deps/v8/src/handles/global-handles-inl.h b/deps/v8/src/handles/global-handles-inl.h
index 1017d9437a9be5..0bee8ea54a3807 100644
--- a/deps/v8/src/handles/global-handles-inl.h
+++ b/deps/v8/src/handles/global-handles-inl.h
@@ -13,11 +13,17 @@ namespace v8 {
 namespace internal {
 
 template <typename T>
-Handle<T> GlobalHandles::Create(T value) {
+Handle<T> GlobalHandles::Create(Tagged<T> value) {
   static_assert(std::is_base_of<Object, T>::value, "static type violation");
   // The compiler should only pick this method if T is not Object.
   static_assert(!std::is_same<Object, T>::value, "compiler error");
-  return Handle<T>::cast(Create(Object(value)));
+  return Handle<T>::cast(Create(Tagged<Object>(value)));
+}
+
+template <typename T>
+Handle<T> GlobalHandles::Create(T value) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return Create(Tagged<T>(value));
 }
 
 template <typename T>
diff --git a/deps/v8/src/handles/global-handles.cc b/deps/v8/src/handles/global-handles.cc
index 3cacf0a3a7cef8..7bf9188e72b7b2 100644
--- a/deps/v8/src/handles/global-handles.cc
+++ b/deps/v8/src/handles/global-handles.cc
@@ -319,7 +319,7 @@ class NodeBase {
   }
 
   // Publishes all internal state to be consumed by other threads.
-  Handle<Object> Publish(Object object) {
+  Handle<Object> Publish(Tagged<Object> object) {
     DCHECK(!AsChild()->IsInUse());
     data_.parameter = nullptr;
     AsChild()->MarkAsUsed();
@@ -335,7 +335,7 @@ class NodeBase {
     DCHECK(!AsChild()->IsInUse());
   }
 
-  Object object() const { return Object(object_); }
+  Tagged<Object> object() const { return Object(object_); }
   FullObjectSlot location() { return FullObjectSlot(&object_); }
   Handle<Object> handle() { return Handle<Object>(&object_); }
   Address raw_object() const { return object_; }
@@ -407,8 +407,9 @@ class NodeBase {
 
 namespace {
 
-void ExtractInternalFields(JSObject jsobject, void** embedder_fields, int len) {
-  int field_count = jsobject.GetEmbedderFieldCount();
+void ExtractInternalFields(Tagged<JSObject> jsobject, void** embedder_fields,
+                           int len) {
+  int field_count = jsobject->GetEmbedderFieldCount();
   Isolate* isolate = GetIsolateForSandbox(jsobject);
   for (int i = 0; i < len; ++i) {
     if (field_count == i) break;
@@ -541,7 +542,7 @@ class GlobalHandles::Node final : public NodeBase<GlobalHandles::Node> {
     void* embedder_fields[v8::kEmbedderFieldsInWeakCallback] = {nullptr,
                                                                 nullptr};
     if (weakness_type() == WeaknessType::kCallbackWithTwoEmbedderFields &&
-        object().IsJSObject()) {
+        IsJSObject(object())) {
       ExtractInternalFields(JSObject::cast(object()), embedder_fields,
                             v8::kEmbedderFieldsInWeakCallback);
     }
@@ -614,13 +615,13 @@ GlobalHandles::~GlobalHandles() = default;
 namespace {
 
 template <typename NodeType>
-bool NeedsTrackingInYoungNodes(Object value, NodeType* node) {
+bool NeedsTrackingInYoungNodes(Tagged<Object> value, NodeType* node) {
   return ObjectInYoungGeneration(value) && !node->is_in_young_list();
 }
 
 }  // namespace
 
-Handle<Object> GlobalHandles::Create(Object value) {
+Handle<Object> GlobalHandles::Create(Tagged<Object> value) {
   GlobalHandles::Node* node = regular_nodes_->Allocate();
   if (NeedsTrackingInYoungNodes(value, node)) {
     young_nodes_.push_back(node);
@@ -630,7 +631,7 @@ Handle<Object> GlobalHandles::Create(Object value) {
 }
 
 Handle<Object> GlobalHandles::Create(Address value) {
-  return Create(Object(value));
+  return Create(Tagged<Object>(value));
 }
 
 Handle<Object> GlobalHandles::CopyGlobal(Address* location) {
@@ -639,7 +640,7 @@ Handle<Object> GlobalHandles::CopyGlobal(Address* location) {
       Node::FromLocation(location)->global_handles();
 #ifdef VERIFY_HEAP
   if (v8_flags.verify_heap) {
-    Object(*location).ObjectVerify(global_handles->isolate());
+    Object::ObjectVerify(Object(*location), global_handles->isolate());
   }
 #endif  // VERIFY_HEAP
   return global_handles->Create(*location);
@@ -742,7 +743,7 @@ void GlobalHandles::ProcessWeakYoungObjects(
 }
 
 void GlobalHandles::InvokeSecondPassPhantomCallbacks() {
-  DCHECK(AllowJavascriptExecution::IsAllowed(isolate()));
+  AllowJavascriptExecution js(isolate());
   DCHECK(AllowGarbageCollection::IsAllowed());
 
   if (second_pass_callbacks_.empty()) return;
@@ -1038,10 +1039,11 @@ void EternalHandles::PostGarbageCollectionProcessing() {
   young_node_indices_.resize(last);
 }
 
-void EternalHandles::Create(Isolate* isolate, Object object, int* index) {
+void EternalHandles::Create(Isolate* isolate, Tagged<Object> object,
+                            int* index) {
   DCHECK_EQ(kInvalidIndex, *index);
   if (object == Object()) return;
-  Object the_hole = ReadOnlyRoots(isolate).the_hole_value();
+  Tagged<Object> the_hole = ReadOnlyRoots(isolate).the_hole_value();
   DCHECK_NE(the_hole, object);
   int block = size_ >> kShift;
   int offset = size_ & kMask;
diff --git a/deps/v8/src/handles/global-handles.h b/deps/v8/src/handles/global-handles.h
index 5026e75b931e43..31f91ec5553ef4 100644
--- a/deps/v8/src/handles/global-handles.h
+++ b/deps/v8/src/handles/global-handles.h
@@ -71,9 +71,11 @@ class V8_EXPORT_PRIVATE GlobalHandles final {
   ~GlobalHandles();
 
   // Creates a new global handle that is alive until Destroy is called.
-  Handle<Object> Create(Object value);
+  Handle<Object> Create(Tagged<Object> value);
   Handle<Object> Create(Address value);
 
+  template <typename T>
+  inline Handle<T> Create(Tagged<T> value);
   template <typename T>
   inline Handle<T> Create(T value);
 
@@ -197,7 +199,8 @@ class EternalHandles final {
   EternalHandles& operator=(const EternalHandles&) = delete;
 
   // Create an EternalHandle, overwriting the index.
-  V8_EXPORT_PRIVATE void Create(Isolate* isolate, Object object, int* index);
+  V8_EXPORT_PRIVATE void Create(Isolate* isolate, Tagged<Object> object,
+                                int* index);
 
   // Grab the handle for an existing EternalHandle.
   inline Handle<Object> Get(int index) {
diff --git a/deps/v8/src/handles/handles-inl.h b/deps/v8/src/handles/handles-inl.h
index e47ee146bff615..8ddb49f17b0ce6 100644
--- a/deps/v8/src/handles/handles-inl.h
+++ b/deps/v8/src/handles/handles-inl.h
@@ -12,13 +12,17 @@
 #include "src/handles/local-handles-inl.h"
 #include "src/objects/objects.h"
 
+#ifdef DEBUG
+#include "src/utils/ostreams.h"
+#endif
+
 namespace v8 {
 namespace internal {
 
 class LocalHeap;
 
 HandleBase::HandleBase(Address object, Isolate* isolate)
-    : location_(HandleScope::GetHandle(isolate, object)) {}
+    : location_(HandleScope::CreateHandle(isolate, object)) {}
 
 HandleBase::HandleBase(Address object, LocalIsolate* isolate)
     : location_(LocalHandleScope::GetHandle(isolate->heap(), object)) {}
@@ -26,7 +30,7 @@ HandleBase::HandleBase(Address object, LocalIsolate* isolate)
 HandleBase::HandleBase(Address object, LocalHeap* local_heap)
     : location_(LocalHandleScope::GetHandle(local_heap, object)) {}
 
-bool HandleBase::is_identical_to(const HandleBase that) const {
+bool HandleBase::is_identical_to(const HandleBase& that) const {
   SLOW_DCHECK((this->location_ == nullptr || this->IsDereferenceAllowed()) &&
               (that.location_ == nullptr || that.IsDereferenceAllowed()));
   if (this->location_ == that.location_) return true;
@@ -36,7 +40,7 @@ bool HandleBase::is_identical_to(const HandleBase that) const {
 
 // Allocate a new handle for the object, do not canonicalize.
 template <typename T>
-Handle<T> Handle<T>::New(T object, Isolate* isolate) {
+Handle<T> Handle<T>::New(Tagged<T> object, Isolate* isolate) {
   return Handle(HandleScope::CreateHandle(isolate, object.ptr()));
 }
 
@@ -48,37 +52,118 @@ const Handle<T> Handle<T>::cast(Handle<S> that) {
 }
 
 template <typename T>
-Handle<T>::Handle(T object, Isolate* isolate)
+Handle<T>::Handle(Tagged<T> object, Isolate* isolate)
     : HandleBase(object.ptr(), isolate) {}
 
 template <typename T>
-Handle<T>::Handle(T object, LocalIsolate* isolate)
+Handle<T>::Handle(Tagged<T> object, LocalIsolate* isolate)
     : HandleBase(object.ptr(), isolate) {}
 
 template <typename T>
-Handle<T>::Handle(T object, LocalHeap* local_heap)
+Handle<T>::Handle(Tagged<T> object, LocalHeap* local_heap)
     : HandleBase(object.ptr(), local_heap) {}
 
 template <typename T>
-V8_INLINE Handle<T> handle(T object, Isolate* isolate) {
+V8_INLINE Handle<T> handle(Tagged<T> object, Isolate* isolate) {
   return Handle<T>(object, isolate);
 }
 
 template <typename T>
-V8_INLINE Handle<T> handle(T object, LocalIsolate* isolate) {
+V8_INLINE Handle<T> handle(Tagged<T> object, LocalIsolate* isolate) {
   return Handle<T>(object, isolate);
 }
 
 template <typename T>
-V8_INLINE Handle<T> handle(T object, LocalHeap* local_heap) {
+V8_INLINE Handle<T> handle(Tagged<T> object, LocalHeap* local_heap) {
   return Handle<T>(object, local_heap);
 }
 
+template <typename T>
+V8_INLINE Handle<T> handle(T object, Isolate* isolate) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return handle(Tagged<T>(object), isolate);
+}
+
+template <typename T>
+V8_INLINE Handle<T> handle(T object, LocalIsolate* isolate) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return handle(Tagged<T>(object), isolate);
+}
+
+template <typename T>
+V8_INLINE Handle<T> handle(T object, LocalHeap* local_heap) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return handle(Tagged<T>(object), local_heap);
+}
+
 template <typename T>
 inline std::ostream& operator<<(std::ostream& os, Handle<T> handle) {
   return os << Brief(*handle);
 }
 
+#ifdef V8_ENABLE_DIRECT_HANDLE
+
+template <typename T>
+V8_INLINE DirectHandle<T>::DirectHandle(Tagged<T> object)
+    : DirectHandle(object.ptr()) {}
+
+template <typename T>
+template <typename S>
+V8_INLINE const DirectHandle<T> DirectHandle<T>::cast(DirectHandle<S> that) {
+  T::cast(Object(that.address()));
+  return DirectHandle<T>(that.address());
+}
+
+template <typename T>
+template <typename S>
+V8_INLINE const DirectHandle<T> DirectHandle<T>::cast(Handle<S> that) {
+  DCHECK(that.location() != nullptr);
+  T::cast(*FullObjectSlot(that.address()));
+  return DirectHandle<T>(*that.location());
+}
+
+template <typename T>
+inline std::ostream& operator<<(std::ostream& os, DirectHandle<T> handle) {
+  return os << Brief(*handle);
+}
+
+#endif  // V8_ENABLE_DIRECT_HANDLE
+
+template <typename T>
+V8_INLINE DirectHandle<T> direct_handle(Tagged<T> object, Isolate* isolate) {
+  return DirectHandle<T>(object, isolate);
+}
+
+template <typename T>
+V8_INLINE DirectHandle<T> direct_handle(Tagged<T> object,
+                                        LocalIsolate* isolate) {
+  return DirectHandle<T>(object, isolate);
+}
+
+template <typename T>
+V8_INLINE DirectHandle<T> direct_handle(Tagged<T> object,
+                                        LocalHeap* local_heap) {
+  return DirectHandle<T>(object, local_heap);
+}
+
+template <typename T>
+V8_INLINE DirectHandle<T> direct_handle(T object, Isolate* isolate) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return direct_handle(Tagged<T>(object), isolate);
+}
+
+template <typename T>
+V8_INLINE DirectHandle<T> direct_handle(T object, LocalIsolate* isolate) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return direct_handle(Tagged<T>(object), isolate);
+}
+
+template <typename T>
+V8_INLINE DirectHandle<T> direct_handle(T object, LocalHeap* local_heap) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return direct_handle(Tagged<T>(object), local_heap);
+}
+
 HandleScope::HandleScope(Isolate* isolate) {
   HandleScopeData* data = isolate->handle_scope_data();
   isolate_ = isolate;
@@ -161,9 +246,12 @@ Handle<T> HandleScope::CloseAndEscape(Handle<T> handle_value) {
 
 Address* HandleScope::CreateHandle(Isolate* isolate, Address value) {
   DCHECK(AllowHandleAllocation::IsAllowed());
+  DCHECK(isolate->main_thread_local_heap()->IsRunning());
+  DCHECK_WITH_MSG(isolate->thread_id() == ThreadId::Current(),
+                  "main-thread handle can only be created on the main thread.");
   HandleScopeData* data = isolate->handle_scope_data();
   Address* result = data->next;
-  if (result == data->limit) {
+  if (V8_UNLIKELY(result == data->limit)) {
     result = Extend(isolate);
   }
   // Update the current next field, set the value in the created handle,
@@ -176,16 +264,6 @@ Address* HandleScope::CreateHandle(Isolate* isolate, Address value) {
   return result;
 }
 
-Address* HandleScope::GetHandle(Isolate* isolate, Address value) {
-  DCHECK(AllowHandleAllocation::IsAllowed());
-  DCHECK(isolate->main_thread_local_heap()->IsRunning());
-  DCHECK_WITH_MSG(isolate->thread_id() == ThreadId::Current(),
-                  "main-thread handle can only be created on the main thread.");
-  HandleScopeData* data = isolate->handle_scope_data();
-  CanonicalHandleScope* canonical = data->canonical_scope;
-  return canonical ? canonical->Lookup(value) : CreateHandle(isolate, value);
-}
-
 #ifdef DEBUG
 inline SealHandleScope::SealHandleScope(Isolate* isolate) : isolate_(isolate) {
   // Make sure the current thread is allowed to create handles to begin with.
@@ -208,8 +286,22 @@ inline SealHandleScope::~SealHandleScope() {
   DCHECK_EQ(current->level, current->sealed_level);
   current->sealed_level = prev_sealed_level_;
 }
+#endif  // DEBUG
 
-#endif
+#ifdef V8_ENABLE_DIRECT_HANDLE
+bool DirectHandleBase::is_identical_to(const DirectHandleBase& that) const {
+  SLOW_DCHECK(
+      (this->address() == kTaggedNullAddress || this->IsDereferenceAllowed()) &&
+      (that.address() == kTaggedNullAddress || that.IsDereferenceAllowed()));
+  if (this->address() == kTaggedNullAddress &&
+      that.address() == kTaggedNullAddress)
+    return true;
+  if (this->address() == kTaggedNullAddress ||
+      that.address() == kTaggedNullAddress)
+    return false;
+  return Object(this->address()) == Object(that.address());
+}
+#endif  // V8_ENABLE_DIRECT_HANDLE
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/handles/handles.cc b/deps/v8/src/handles/handles.cc
index 8cfe353f9a89d1..2dd1b68c3052c2 100644
--- a/deps/v8/src/handles/handles.cc
+++ b/deps/v8/src/handles/handles.cc
@@ -22,6 +22,8 @@
 #ifdef DEBUG
 // For GetIsolateFromWritableHeapObject.
 #include "src/heap/heap-write-barrier-inl.h"
+// For GetIsolateFromWritableObject.
+#include "src/execution/isolate-utils-inl.h"
 #endif
 
 namespace v8 {
@@ -34,18 +36,19 @@ ASSERT_TRIVIALLY_COPYABLE(HandleBase);
 ASSERT_TRIVIALLY_COPYABLE(Handle<Object>);
 ASSERT_TRIVIALLY_COPYABLE(MaybeHandle<Object>);
 
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+#ifdef V8_ENABLE_DIRECT_HANDLE
 
 ASSERT_TRIVIALLY_COPYABLE(DirectHandle<Object>);
-ASSERT_TRIVIALLY_COPYABLE(DirectMaybeHandle<Object>);
+ASSERT_TRIVIALLY_COPYABLE(MaybeDirectHandle<Object>);
 
-#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+#endif  // V8_ENABLE_DIRECT_HANDLE
 
 #ifdef DEBUG
+
 bool HandleBase::IsDereferenceAllowed() const {
   DCHECK_NOT_NULL(location_);
   Object object(*location_);
-  if (object.IsSmi()) return true;
+  if (IsSmi(object)) return true;
   HeapObject heap_object = HeapObject::cast(object);
   if (IsReadOnlyHeapObject(heap_object)) return true;
   Isolate* isolate = GetIsolateFromWritableObject(heap_object);
@@ -90,13 +93,12 @@ bool HandleBase::IsDereferenceAllowed() const {
   return true;
 }
 
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+#ifdef V8_ENABLE_DIRECT_HANDLE
 
-template <typename T>
-bool DirectHandle<T>::IsDereferenceAllowed() const {
+bool DirectHandleBase::IsDereferenceAllowed() const {
   DCHECK_NE(obj_, kTaggedNullAddress);
   Object object(obj_);
-  if (object.IsSmi()) return true;
+  if (IsSmi(object)) return true;
   HeapObject heap_object = HeapObject::cast(object);
   if (IsReadOnlyHeapObject(heap_object)) return true;
   Isolate* isolate = GetIsolateFromWritableObject(heap_object);
@@ -122,7 +124,14 @@ bool DirectHandle<T>::IsDereferenceAllowed() const {
   return true;
 }
 
-#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+void DirectHandleBase::VerifyOnStackAndMainThread() const {
+  internal::HandleHelper::VerifyOnStack(this);
+  // The following verifies that we are on the main thread, as
+  // LocalHeap::Current is not set in that case.
+  DCHECK_NULL(LocalHeap::Current());
+}
+
+#endif  // V8_ENABLE_DIRECT_HANDLE
 
 #endif  // DEBUG
 
@@ -199,75 +208,5 @@ Address HandleScope::current_limit_address(Isolate* isolate) {
   return reinterpret_cast<Address>(&isolate->handle_scope_data()->limit);
 }
 
-CanonicalHandleScope::CanonicalHandleScope(Isolate* isolate, Zone* zone)
-    : zone_(zone == nullptr ? new Zone(isolate->allocator(), ZONE_NAME) : zone),
-      isolate_(isolate) {
-  HandleScopeData* handle_scope_data = isolate_->handle_scope_data();
-  prev_canonical_scope_ = handle_scope_data->canonical_scope;
-  handle_scope_data->canonical_scope = this;
-  root_index_map_ = new RootIndexMap(isolate);
-  identity_map_ = std::make_unique<CanonicalHandlesMap>(
-      isolate->heap(), ZoneAllocationPolicy(zone_));
-  canonical_level_ = handle_scope_data->level;
-}
-
-CanonicalHandleScope::~CanonicalHandleScope() {
-  delete root_index_map_;
-  // Note: both the identity_map_ (zone-allocated) and the zone_ itself may
-  // have custom ownership semantics, controlled by subclasses. For example, in
-  // case of external ownership, the subclass destructor may 'steal' both by
-  // resetting the identity map pointer and nulling the zone.
-  identity_map_.reset();
-  delete zone_;
-  isolate_->handle_scope_data()->canonical_scope = prev_canonical_scope_;
-}
-
-Address* CanonicalHandleScope::Lookup(Address object) {
-  DCHECK_LE(canonical_level_, isolate_->handle_scope_data()->level);
-  if (isolate_->handle_scope_data()->level != canonical_level_) {
-    // We are in an inner handle scope. Do not canonicalize since we will leave
-    // this handle scope while still being in the canonical scope.
-    return HandleScope::CreateHandle(isolate_, object);
-  }
-  if (Internals::HasHeapObjectTag(object)) {
-    RootIndex root_index;
-    if (root_index_map_->Lookup(object, &root_index)) {
-      return isolate_->root_handle(root_index).location();
-    }
-  }
-  auto find_result = identity_map_->FindOrInsert(Object(object));
-  if (!find_result.already_exists) {
-    // Allocate new handle location.
-    *find_result.entry = HandleScope::CreateHandle(isolate_, object);
-  }
-  return *find_result.entry;
-}
-
-std::unique_ptr<CanonicalHandlesMap>
-CanonicalHandleScope::DetachCanonicalHandles() {
-  return std::move(identity_map_);
-}
-
-template <class CompilationInfoT>
-CanonicalHandleScopeForOptimization<CompilationInfoT>::
-    CanonicalHandleScopeForOptimization(Isolate* isolate,
-                                        CompilationInfoT* info)
-    : CanonicalHandleScope(isolate, info->zone()), info_(info) {}
-
-template <class CompilationInfoT>
-CanonicalHandleScopeForOptimization<
-    CompilationInfoT>::~CanonicalHandleScopeForOptimization() {
-  // We created the identity map on the compilation info's zone(). Pass
-  // ownership to the compilation info which is responsible for the disposal.
-  info_->set_canonical_handles(DetachCanonicalHandles());
-  zone_ = nullptr;  // We don't own the zone, null it.
-}
-
-template class CanonicalHandleScopeForOptimization<OptimizedCompilationInfo>;
-#ifdef V8_ENABLE_MAGLEV
-template class CanonicalHandleScopeForOptimization<
-    maglev::ExportedMaglevCompilationInfo>;
-#endif  // V8_ENABLE_MAGLEV
-
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/handles/handles.h b/deps/v8/src/handles/handles.h
index 29da54bf9fa59a..f340210c704763 100644
--- a/deps/v8/src/handles/handles.h
+++ b/deps/v8/src/handles/handles.h
@@ -13,6 +13,10 @@
 #include "src/common/globals.h"
 #include "src/zone/zone.h"
 
+#ifdef V8_ENABLE_DIRECT_HANDLE
+#include "src/flags/flags.h"
+#endif
+
 namespace v8 {
 
 class HandleScope;
@@ -24,8 +28,7 @@ class HandleScopeImplementer;
 class Isolate;
 class LocalHeap;
 class LocalIsolate;
-template <typename T>
-class MaybeHandle;
+class TaggedIndex;
 class Object;
 class OrderedHashMap;
 class OrderedHashSet;
@@ -40,16 +43,11 @@ class WasmExportedFunctionData;
 constexpr Address kTaggedNullAddress = 0x1;
 
 // ----------------------------------------------------------------------------
-// Base class for Handle instantiations.  Don't use directly.
+// Base class for Handle instantiations. Don't use directly.
 class HandleBase {
  public:
-  V8_INLINE explicit HandleBase(Address* location) : location_(location) {}
-  V8_INLINE explicit HandleBase(Address object, Isolate* isolate);
-  V8_INLINE explicit HandleBase(Address object, LocalIsolate* isolate);
-  V8_INLINE explicit HandleBase(Address object, LocalHeap* local_heap);
-
   // Check if this handle refers to the exact same object as the other handle.
-  V8_INLINE bool is_identical_to(const HandleBase that) const;
+  V8_INLINE bool is_identical_to(const HandleBase& that) const;
   V8_INLINE bool is_null() const { return location_ == nullptr; }
 
   // Returns the raw address where this handle is stored. This should only be
@@ -67,6 +65,11 @@ class HandleBase {
   }
 
  protected:
+  V8_INLINE explicit HandleBase(Address* location) : location_(location) {}
+  V8_INLINE explicit HandleBase(Address object, Isolate* isolate);
+  V8_INLINE explicit HandleBase(Address object, LocalIsolate* isolate);
+  V8_INLINE explicit HandleBase(Address object, LocalHeap* local_heap);
+
 #ifdef DEBUG
   bool V8_EXPORT_PRIVATE IsDereferenceAllowed() const;
 #else
@@ -94,55 +97,63 @@ class HandleBase {
 template <typename T>
 class Handle final : public HandleBase {
  public:
-  // {ObjectRef} is returned by {Handle::operator->}. It should never be stored
-  // anywhere or used in any other code; no one should ever have to spell out
-  // {ObjectRef} in code. Its only purpose is to be dereferenced immediately by
-  // "operator-> chaining". Returning the address of the field is valid because
-  // this objects lifetime only ends at the end of the full statement.
-  class ObjectRef {
-   public:
-    T* operator->() { return &object_; }
-
-   private:
-    friend class Handle<T>;
-    explicit ObjectRef(T object) : object_(object) {}
-
-    T object_;
-  };
-
-  V8_INLINE explicit Handle() : HandleBase(nullptr) {
-    // Skip static type check in order to allow Handle<XXX>::null() as default
-    // parameter values in non-inl header files without requiring full
-    // definition of type XXX.
-  }
+  V8_INLINE Handle() : HandleBase(nullptr) {}
 
   V8_INLINE explicit Handle(Address* location) : HandleBase(location) {
-    // This static type check also fails for forward class declarations.
-    static_assert(std::is_convertible<T*, Object*>::value,
-                  "static type violation");
     // TODO(jkummerow): Runtime type check here as a SLOW_DCHECK?
   }
 
-  V8_INLINE Handle(T object, Isolate* isolate);
-  V8_INLINE Handle(T object, LocalIsolate* isolate);
-  V8_INLINE Handle(T object, LocalHeap* local_heap);
+  V8_INLINE Handle(Tagged<T> object, Isolate* isolate);
+  V8_INLINE Handle(Tagged<T> object, LocalIsolate* isolate);
+  V8_INLINE Handle(Tagged<T> object, LocalHeap* local_heap);
 
-  // Allocate a new handle for the object, do not canonicalize.
-  V8_INLINE static Handle<T> New(T object, Isolate* isolate);
+  // Allocate a new handle for the object.
+  V8_INLINE static Handle<T> New(Tagged<T> object, Isolate* isolate);
 
   // Constructor for handling automatic up casting.
   // Ex. Handle<JSFunction> can be passed when Handle<Object> is expected.
-  template <typename S, typename = typename std::enable_if<
-                            std::is_convertible<S*, T*>::value>::type>
+  template <typename S,
+            typename = std::enable_if_t<std::is_convertible_v<S*, T*>>>
   V8_INLINE Handle(Handle<S> handle) : HandleBase(handle) {}
 
-  V8_INLINE ObjectRef operator->() const { return ObjectRef{**this}; }
+  // Access a member of the T object referenced by this handle.
+  //
+  // This is actually a double dereference -- first it dereferences the Handle
+  // pointing to a Tagged<T>, and then continues through Tagged<T>::operator->.
+  // This means that this is only permitted for Tagged<T> with an operator->,
+  // i.e. for on-heap object T.
+  V8_INLINE Tagged<T> operator->() const {
+    if constexpr (std::is_base_of_v<HeapObject, T> ||
+                  std::is_convertible_v<T*, HeapObject*>) {
+      return **this;
+    } else {
+      // `static_assert(false)` in this else clause was an unconditional error
+      // before CWG2518. See https://reviews.llvm.org/D144285
+#if defined(__clang__) && __clang_major__ >= 17
+      // For non-HeapObjects, there's no on-heap object to dereference, so
+      // disallow using operator->.
+      //
+      // If you got an error here and want to access the Tagged<T>, use
+      // operator* -- e.g. for `Tagged<Smi>::value()`, use `(*handle).value()`.
+      static_assert(
+          false,
+          "This handle does not reference a heap object. Use `(*handle).foo`.");
+#endif
+    }
+  }
 
-  V8_INLINE T operator*() const {
-    // unchecked_cast because we rather trust Handle<T> to contain a T than
-    // include all the respective -inl.h headers for SLOW_DCHECKs.
+  V8_INLINE Tagged<T> operator*() const {
+    // This static type check also fails for forward class declarations. We
+    // check on access instead of on construction to allow Handles to forward
+    // declared types.
+    static_assert(
+        std::is_base_of_v<Object, T> || std::is_convertible_v<T*, Object*>,
+        "static type violation");
+    // Direct construction of Tagged from address, without a type check, because
+    // we rather trust Handle<T> to contain a T than include all the respective
+    // -inl.h headers for SLOW_DCHECKs.
     SLOW_DCHECK(IsDereferenceAllowed());
-    return T::unchecked_cast(Object(*location()));
+    return Tagged<T>(*location());
   }
 
   template <typename S>
@@ -224,9 +235,6 @@ class V8_NODISCARD HandleScope {
   // Counts the number of allocated handles.
   V8_EXPORT_PRIVATE static int NumberOfHandles(Isolate* isolate);
 
-  // Create a new handle or lookup a canonical handle.
-  V8_INLINE static Address* GetHandle(Isolate* isolate, Address value);
-
   // Creates a new handle with the given value.
   V8_INLINE static Address* CreateHandle(Isolate* isolate, Address value);
 
@@ -261,7 +269,7 @@ class V8_NODISCARD HandleScope {
                                    Address* prev_limit);
 
   // Extend the handle scope making room for more handles.
-  V8_EXPORT_PRIVATE static Address* Extend(Isolate* isolate);
+  V8_EXPORT_PRIVATE V8_NOINLINE static Address* Extend(Isolate* isolate);
 
 #ifdef ENABLE_HANDLE_ZAPPING
   // Zaps the handles in the half-open interval [start, end).
@@ -276,71 +284,12 @@ class V8_NODISCARD HandleScope {
   friend class PersistentHandles;
 };
 
-// Forward declarations for CanonicalHandleScope.
+// Forward declaration for CanonicalHandlesMap.
 template <typename V, class AllocationPolicy>
 class IdentityMap;
-class RootIndexMap;
-class OptimizedCompilationInfo;
-
-namespace maglev {
-class ExportedMaglevCompilationInfo;
-}  // namespace maglev
 
 using CanonicalHandlesMap = IdentityMap<Address*, ZoneAllocationPolicy>;
 
-// A CanonicalHandleScope does not open a new HandleScope. It changes the
-// existing HandleScope so that Handles created within are canonicalized.
-// This does not apply to nested inner HandleScopes unless a nested
-// CanonicalHandleScope is introduced. Handles are only canonicalized within
-// the same CanonicalHandleScope, but not across nested ones.
-class V8_EXPORT_PRIVATE V8_NODISCARD CanonicalHandleScope {
- public:
-  // If no Zone is passed to this constructor, we create (and own) a new zone.
-  // To properly dispose of said zone, we need to first free the identity_map_
-  // which is done manually even though identity_map_ is a unique_ptr.
-  explicit CanonicalHandleScope(Isolate* isolate, Zone* zone = nullptr);
-  ~CanonicalHandleScope();
-
- protected:
-  std::unique_ptr<CanonicalHandlesMap> DetachCanonicalHandles();
-
-  Zone* zone_;  // *Not* const, may be mutated by subclasses.
-
- private:
-  Address* Lookup(Address object);
-
-  Isolate* const isolate_;
-  RootIndexMap* root_index_map_;
-  std::unique_ptr<CanonicalHandlesMap> identity_map_;
-  // Ordinary nested handle scopes within the current one are not canonical.
-  int canonical_level_;
-  // We may have nested canonical scopes. Handles are canonical within each one.
-  CanonicalHandleScope* prev_canonical_scope_;
-
-  friend class HandleScope;
-};
-
-template <class CompilationInfoT>
-class V8_EXPORT_PRIVATE V8_NODISCARD CanonicalHandleScopeForOptimization final
-    : public CanonicalHandleScope {
- public:
-  // We created the
-  // CanonicalHandlesMap on the compilation info's zone(). In the
-  // CanonicalHandleScope destructor we hand off the canonical handle map to the
-  // compilation info. The compilation info is responsible for the disposal.
-  explicit CanonicalHandleScopeForOptimization(Isolate* isolate,
-                                               CompilationInfoT* info);
-  ~CanonicalHandleScopeForOptimization();
-
- private:
-  CompilationInfoT* const info_;
-};
-
-using CanonicalHandleScopeForTurbofan =
-    CanonicalHandleScopeForOptimization<OptimizedCompilationInfo>;
-using CanonicalHandleScopeForMaglev =
-    CanonicalHandleScopeForOptimization<maglev::ExportedMaglevCompilationInfo>;
-
 // Seal off the current HandleScope so that new handles can only be created
 // if a new HandleScope is entered.
 class V8_NODISCARD SealHandleScope final {
@@ -360,20 +309,60 @@ class V8_NODISCARD SealHandleScope final {
 };
 
 struct HandleScopeData final {
+  static constexpr uint32_t kSizeInBytes =
+      2 * kSystemPointerSize + 2 * kInt32Size;
+
   Address* next;
   Address* limit;
   int level;
   int sealed_level;
-  CanonicalHandleScope* canonical_scope;
 
   void Initialize() {
     next = limit = nullptr;
     sealed_level = level = 0;
-    canonical_scope = nullptr;
   }
 };
 
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+static_assert(HandleScopeData::kSizeInBytes == sizeof(HandleScopeData));
+
+#ifdef V8_ENABLE_DIRECT_HANDLE
+// Direct handles should not be used without conservative stack scanning,
+// as this would break the correctness of the GC.
+static_assert(V8_ENABLE_CONSERVATIVE_STACK_SCANNING_BOOL);
+
+// ----------------------------------------------------------------------------
+// Base class for DirectHandle instantiations. Don't use directly.
+class DirectHandleBase {
+ public:
+  // Check if this handle refers to the exact same object as the other handle.
+  V8_INLINE bool is_identical_to(const DirectHandleBase& that) const;
+  V8_INLINE bool is_null() const { return obj_ == kTaggedNullAddress; }
+
+  V8_INLINE Address address() const { return obj_; }
+
+ protected:
+  V8_INLINE explicit DirectHandleBase(Address object) : obj_(object) {
+#ifdef DEBUG
+    VerifyOnStackAndMainThread();
+#endif
+  }
+
+  V8_INLINE explicit DirectHandleBase(Address object, Isolate* isolate);
+  V8_INLINE explicit DirectHandleBase(Address object, LocalIsolate* isolate);
+  V8_INLINE explicit DirectHandleBase(Address object, LocalHeap* local_heap);
+
+#ifdef DEBUG
+  bool V8_EXPORT_PRIVATE IsDereferenceAllowed() const;
+  V8_EXPORT_PRIVATE void VerifyOnStackAndMainThread() const;
+#else
+  V8_INLINE
+  bool V8_EXPORT_PRIVATE IsDereferenceAllowed() const { return true; }
+#endif  // DEBUG
+
+  // This is a direct pointer to either a tagged object or SMI. Design overview:
+  // https://docs.google.com/document/d/1uRGYQM76vk1fc_aDqDH3pm2qhaJtnK2oyzeVng4cS6I/
+  Address obj_;
+};
 
 // ----------------------------------------------------------------------------
 // A DirectHandle provides a reference to an object without an intermediate
@@ -390,20 +379,25 @@ struct HandleScopeData final {
 // Further motivation is explained in the design doc:
 // https://docs.google.com/document/d/1uRGYQM76vk1fc_aDqDH3pm2qhaJtnK2oyzeVng4cS6I/
 template <typename T>
-class DirectHandle final {
+class DirectHandle final : public DirectHandleBase {
  public:
-  V8_INLINE explicit DirectHandle() : obj_(kTaggedNullAddress) {
-    // Skip static type check in order to allow DirectHandle<XXX>::null() as
-    // default parameter values in non-inl header files without requiring full
-    // definition of type XXX.
-  }
+  V8_INLINE DirectHandle() : DirectHandle(kTaggedNullAddress) {}
 
-  V8_INLINE bool is_null() const { return obj_ == kTaggedNullAddress; }
+  V8_INLINE explicit DirectHandle(Address object) : DirectHandleBase(object) {}
 
-  V8_INLINE explicit DirectHandle(Address object) : obj_(object) {
-    // This static type check also fails for forward class declarations.
-    static_assert(std::is_convertible<T*, Object*>::value,
-                  "static type violation");
+  V8_INLINE explicit DirectHandle(Tagged<T> object);
+  V8_INLINE DirectHandle(Tagged<T> object, Isolate* isolate)
+      : DirectHandle(object) {}
+  V8_INLINE DirectHandle(Tagged<T> object, LocalIsolate* isolate)
+      : DirectHandle(object) {}
+  V8_INLINE DirectHandle(Tagged<T> object, LocalHeap* local_heap)
+      : DirectHandle(object) {}
+
+  V8_INLINE explicit DirectHandle(Address* address)
+      : DirectHandle(address == nullptr ? kTaggedNullAddress : *address) {}
+
+  V8_INLINE static DirectHandle<T> New(Tagged<T> object, Isolate* isolate) {
+    return DirectHandle<T>(object);
   }
 
   // Constructor for handling automatic up casting.
@@ -411,29 +405,53 @@ class DirectHandle final {
   // expected.
   template <typename S, typename = typename std::enable_if<
                             std::is_convertible<S*, T*>::value>::type>
-  V8_INLINE DirectHandle(DirectHandle<S> handle) : obj_(handle.obj_) {}
+  V8_INLINE DirectHandle(DirectHandle<S> handle) : DirectHandle(handle.obj_) {}
 
-  V8_INLINE T operator->() const { return obj_; }
+  template <typename S, typename = typename std::enable_if<
+                            std::is_convertible<S*, T*>::value>::type>
+  V8_INLINE DirectHandle(Handle<S> handle)
+      : DirectHandle(handle.location() != nullptr ? *handle.location()
+                                                  : kTaggedNullAddress) {}
+
+  V8_INLINE Tagged<T> operator->() const {
+    if constexpr (std::is_base_of_v<HeapObject, T> ||
+                  std::is_convertible_v<T*, HeapObject*>) {
+      return **this;
+    } else {
+      // For non-HeapObjects, there's no on-heap object to dereference, so
+      // disallow using operator->.
+      //
+      // If you got an error here and want to access the Tagged<T>, use
+      // operator* -- e.g. for `Tagged<Smi>::value()`, use `(*handle).value()`.
+      static_assert(
+          false,
+          "This handle does not reference a heap object. Use `(*handle).foo`.");
+    }
+  }
 
-  V8_INLINE T operator*() const {
+  V8_INLINE Tagged<T> operator*() const {
+    // This static type check also fails for forward class declarations. We
+    // check on access instead of on construction to allow DirectHandles to
+    // forward declared types.
+    static_assert(
+        std::is_base_of_v<Object, T> || std::is_convertible_v<T*, Object*>,
+        "static type violation");
+    // Direct construction of Tagged from address, without a type check, because
+    // we rather trust DirectHandle<T> to contain a T than include all the
+    // respective -inl.h headers for SLOW_DCHECKs.
     SLOW_DCHECK(IsDereferenceAllowed());
-    return T::unchecked_cast(Object(obj_));
+    return Tagged<T>(address());
   }
 
   template <typename S>
-  inline static const DirectHandle<T> cast(DirectHandle<S> that);
+  V8_INLINE static const DirectHandle<T> cast(DirectHandle<S> that);
 
-  // Consider declaring values that contain empty handles as
-  // MaybeHandle to force validation before being used as handles.
-  static const DirectHandle<T> null() { return DirectHandle<T>(); }
+  template <typename S>
+  V8_INLINE static const DirectHandle<T> cast(Handle<S> that);
 
- protected:
-#ifdef DEBUG
-  bool V8_EXPORT_PRIVATE IsDereferenceAllowed() const;
-#else
-  V8_INLINE
-  bool V8_EXPORT_PRIVATE IsDereferenceAllowed() const { return true; }
-#endif  // DEBUG
+  // Consider declaring values that contain empty handles as
+  // MaybeDirectHandle to force validation before being used as handles.
+  V8_INLINE static const DirectHandle<T> null() { return DirectHandle<T>(); }
 
  private:
   // DirectHandles of different classes are allowed to access each other's
@@ -443,16 +461,12 @@ class DirectHandle final {
   // MaybeDirectHandle is allowed to access obj_.
   template <typename>
   friend class MaybeDirectHandle;
-
-  // This is a direct pointer to either a tagged object or SMI. Design overview:
-  // https://docs.google.com/document/d/1uRGYQM76vk1fc_aDqDH3pm2qhaJtnK2oyzeVng4cS6I/
-  T obj_;
 };
 
 template <typename T>
 std::ostream& operator<<(std::ostream& os, DirectHandle<T> handle);
 
-#endif
+#endif  // V8_ENABLE_DIRECT_HANDLE
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/handles/local-handles.cc b/deps/v8/src/handles/local-handles.cc
index 0676a9b85be2db..fdf42fd3c064be 100644
--- a/deps/v8/src/handles/local-handles.cc
+++ b/deps/v8/src/handles/local-handles.cc
@@ -16,7 +16,7 @@ namespace internal {
 Address* LocalHandleScope::GetMainThreadHandle(LocalHeap* local_heap,
                                                Address value) {
   Isolate* isolate = local_heap->heap()->isolate();
-  return HandleScope::GetHandle(isolate, value);
+  return HandleScope::CreateHandle(isolate, value);
 }
 
 void LocalHandleScope::OpenMainThreadScope(LocalHeap* local_heap) {
diff --git a/deps/v8/src/handles/maybe-handles-inl.h b/deps/v8/src/handles/maybe-handles-inl.h
index 62c00dde3422e7..6f4fdcc209141d 100644
--- a/deps/v8/src/handles/maybe-handles-inl.h
+++ b/deps/v8/src/handles/maybe-handles-inl.h
@@ -22,9 +22,9 @@ MaybeHandle<T>::MaybeHandle(T object, LocalHeap* local_heap)
     : MaybeHandle(handle(object, local_heap)) {}
 
 MaybeObjectHandle::MaybeObjectHandle(MaybeObject object, Isolate* isolate) {
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
   DCHECK(!object->IsCleared());
-  if (object->GetHeapObjectIfWeak(&heap_object)) {
+  if (object.GetHeapObjectIfWeak(&heap_object)) {
     handle_ = handle(heap_object, isolate);
     reference_type_ = HeapObjectReferenceType::WEAK;
   } else {
@@ -35,9 +35,9 @@ MaybeObjectHandle::MaybeObjectHandle(MaybeObject object, Isolate* isolate) {
 
 MaybeObjectHandle::MaybeObjectHandle(MaybeObject object,
                                      LocalHeap* local_heap) {
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
   DCHECK(!object->IsCleared());
-  if (object->GetHeapObjectIfWeak(&heap_object)) {
+  if (object.GetHeapObjectIfWeak(&heap_object)) {
     handle_ = handle(heap_object, local_heap);
     reference_type_ = HeapObjectReferenceType::WEAK;
   } else {
@@ -49,15 +49,16 @@ MaybeObjectHandle::MaybeObjectHandle(MaybeObject object,
 MaybeObjectHandle::MaybeObjectHandle(Handle<Object> object)
     : reference_type_(HeapObjectReferenceType::STRONG), handle_(object) {}
 
-MaybeObjectHandle::MaybeObjectHandle(Object object, Isolate* isolate)
+MaybeObjectHandle::MaybeObjectHandle(Tagged<Object> object, Isolate* isolate)
     : reference_type_(HeapObjectReferenceType::STRONG),
       handle_(object, isolate) {}
 
-MaybeObjectHandle::MaybeObjectHandle(Object object, LocalHeap* local_heap)
+MaybeObjectHandle::MaybeObjectHandle(Tagged<Object> object,
+                                     LocalHeap* local_heap)
     : reference_type_(HeapObjectReferenceType::STRONG),
       handle_(object, local_heap) {}
 
-MaybeObjectHandle::MaybeObjectHandle(Object object,
+MaybeObjectHandle::MaybeObjectHandle(Tagged<Object> object,
                                      HeapObjectReferenceType reference_type,
                                      Isolate* isolate)
     : reference_type_(reference_type), handle_(handle(object, isolate)) {}
@@ -70,7 +71,8 @@ MaybeObjectHandle MaybeObjectHandle::Weak(Handle<Object> object) {
   return MaybeObjectHandle(object, HeapObjectReferenceType::WEAK);
 }
 
-MaybeObjectHandle MaybeObjectHandle::Weak(Object object, Isolate* isolate) {
+MaybeObjectHandle MaybeObjectHandle::Weak(Tagged<Object> object,
+                                          Isolate* isolate) {
   return MaybeObjectHandle(object, HeapObjectReferenceType::WEAK, isolate);
 }
 
@@ -111,6 +113,118 @@ inline MaybeObjectHandle handle(MaybeObject object, LocalHeap* local_heap) {
   return MaybeObjectHandle(object, local_heap);
 }
 
+template <typename T>
+inline std::ostream& operator<<(std::ostream& os, MaybeHandle<T> handle) {
+  if (handle.is_null()) return os << "null";
+  return os << handle.ToHandleChecked();
+}
+
+#ifdef V8_ENABLE_DIRECT_HANDLE
+
+template <typename T>
+MaybeDirectHandle<T>::MaybeDirectHandle(T object, Isolate* isolate)
+    : MaybeDirectHandle(direct_handle(object, isolate)) {}
+
+template <typename T>
+MaybeDirectHandle<T>::MaybeDirectHandle(T object, LocalHeap* local_heap)
+    : MaybeDirectHandle(direct_handle(object, local_heap)) {}
+
+template <typename T>
+inline std::ostream& operator<<(std::ostream& os, MaybeDirectHandle<T> handle) {
+  if (handle.is_null()) return os << "null";
+  return os << handle.ToHandleChecked();
+}
+
+MaybeObjectDirectHandle::MaybeObjectDirectHandle(MaybeObject object,
+                                                 Isolate* isolate) {
+  Tagged<HeapObject> heap_object;
+  DCHECK(!object->IsCleared());
+  if (object.GetHeapObjectIfWeak(&heap_object)) {
+    handle_ = direct_handle(heap_object, isolate);
+    reference_type_ = HeapObjectReferenceType::WEAK;
+  } else {
+    handle_ = direct_handle(object->cast<Object>(), isolate);
+    reference_type_ = HeapObjectReferenceType::STRONG;
+  }
+}
+
+MaybeObjectDirectHandle::MaybeObjectDirectHandle(MaybeObject object,
+                                                 LocalHeap* local_heap) {
+  Tagged<HeapObject> heap_object;
+  DCHECK(!object->IsCleared());
+  if (object.GetHeapObjectIfWeak(&heap_object)) {
+    handle_ = direct_handle(heap_object, local_heap);
+    reference_type_ = HeapObjectReferenceType::WEAK;
+  } else {
+    handle_ = direct_handle(object->cast<Object>(), local_heap);
+    reference_type_ = HeapObjectReferenceType::STRONG;
+  }
+}
+
+MaybeObjectDirectHandle::MaybeObjectDirectHandle(DirectHandle<Object> object)
+    : reference_type_(HeapObjectReferenceType::STRONG), handle_(object) {}
+
+MaybeObjectDirectHandle::MaybeObjectDirectHandle(Object object,
+                                                 Isolate* isolate)
+    : reference_type_(HeapObjectReferenceType::STRONG),
+      handle_(object, isolate) {}
+
+MaybeObjectDirectHandle::MaybeObjectDirectHandle(Object object,
+                                                 LocalHeap* local_heap)
+    : reference_type_(HeapObjectReferenceType::STRONG),
+      handle_(object, local_heap) {}
+
+MaybeObjectDirectHandle::MaybeObjectDirectHandle(
+    Object object, HeapObjectReferenceType reference_type, Isolate* isolate)
+    : reference_type_(reference_type), handle_(object, isolate) {}
+
+MaybeObjectDirectHandle::MaybeObjectDirectHandle(
+    DirectHandle<Object> object, HeapObjectReferenceType reference_type)
+    : reference_type_(reference_type), handle_(object) {}
+
+MaybeObjectDirectHandle MaybeObjectDirectHandle::Weak(
+    DirectHandle<Object> object) {
+  return MaybeObjectDirectHandle(object, HeapObjectReferenceType::WEAK);
+}
+
+MaybeObjectDirectHandle MaybeObjectDirectHandle::Weak(Object object,
+                                                      Isolate* isolate) {
+  return MaybeObjectDirectHandle(object, HeapObjectReferenceType::WEAK,
+                                 isolate);
+}
+
+bool MaybeObjectDirectHandle::is_identical_to(
+    const MaybeObjectDirectHandle& other) const {
+  DirectHandle<Object> this_handle;
+  DirectHandle<Object> other_handle;
+  return reference_type_ == other.reference_type_ &&
+         handle_.ToHandle(&this_handle) ==
+             other.handle_.ToHandle(&other_handle) &&
+         this_handle.is_identical_to(other_handle);
+}
+
+MaybeObject MaybeObjectDirectHandle::operator*() const {
+  if (reference_type_ == HeapObjectReferenceType::WEAK) {
+    return HeapObjectReference::Weak(*handle_.ToHandleChecked());
+  } else {
+    return MaybeObject::FromObject(*handle_.ToHandleChecked());
+  }
+}
+
+MaybeObject MaybeObjectDirectHandle::operator->() const {
+  if (reference_type_ == HeapObjectReferenceType::WEAK) {
+    return HeapObjectReference::Weak(*handle_.ToHandleChecked());
+  } else {
+    return MaybeObject::FromObject(*handle_.ToHandleChecked());
+  }
+}
+
+DirectHandle<Object> MaybeObjectDirectHandle::object() const {
+  return handle_.ToHandleChecked();
+}
+
+#endif  // V8_ENABLE_DIRECT_HANDLE
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/handles/maybe-handles.h b/deps/v8/src/handles/maybe-handles.h
index 07607a71733034..b3134b6d75781a 100644
--- a/deps/v8/src/handles/maybe-handles.h
+++ b/deps/v8/src/handles/maybe-handles.h
@@ -18,12 +18,12 @@ constexpr NullMaybeHandleType kNullMaybeHandle;
 
 // ----------------------------------------------------------------------------
 // A Handle can be converted into a MaybeHandle. Converting a MaybeHandle
-// into a Handle requires checking that it does not point to nullptr.  This
+// into a Handle requires checking that it does not point to nullptr. This
 // ensures nullptr checks before use.
 //
-// Also note that Handles do not provide default equality comparison or hashing
-// operators on purpose. Such operators would be misleading, because intended
-// semantics is ambiguous between Handle location and object identity.
+// Also note that MaybeHandles do not provide default equality comparison or
+// hashing operators on purpose. Such operators would be misleading, because
+// intended semantics is ambiguous between handle location and object identity.
 template <typename T>
 class MaybeHandle final {
  public:
@@ -38,7 +38,8 @@ class MaybeHandle final {
   V8_INLINE MaybeHandle(Handle<S> handle) : location_(handle.location_) {}
 
   // Constructor for handling automatic up casting.
-  // Ex. MaybeHandle<JSArray> can be passed when Handle<Object> is expected.
+  // Ex. MaybeHandle<JSArray> can be passed when MaybeHandle<Object> is
+  // expected.
   template <typename S, typename = typename std::enable_if<
                             std::is_convertible<S*, T*>::value>::type>
   V8_INLINE MaybeHandle(MaybeHandle<S> maybe_handle)
@@ -67,6 +68,11 @@ class MaybeHandle final {
     }
   }
 
+  // Location equality.
+  bool equals(MaybeHandle<T> other) const {
+    return address() == other.address();
+  }
+
   // Returns the raw address where this handle is stored. This should only be
   // used for hashing handles; do not ever try to dereference it.
   V8_INLINE Address address() const {
@@ -82,8 +88,15 @@ class MaybeHandle final {
   // other's location_.
   template <typename>
   friend class MaybeHandle;
+#ifdef V8_ENABLE_DIRECT_HANDLE
+  template <typename>
+  friend class MaybeDirectHandle;
+#endif
 };
 
+template <typename T>
+std::ostream& operator<<(std::ostream& os, MaybeHandle<T> handle);
+
 // A handle which contains a potentially weak pointer. Keeps it alive (strongly)
 // while the MaybeObjectHandle is alive.
 class MaybeObjectHandle {
@@ -91,12 +104,12 @@ class MaybeObjectHandle {
   inline MaybeObjectHandle()
       : reference_type_(HeapObjectReferenceType::STRONG) {}
   inline MaybeObjectHandle(MaybeObject object, Isolate* isolate);
-  inline MaybeObjectHandle(Object object, Isolate* isolate);
+  inline MaybeObjectHandle(Tagged<Object> object, Isolate* isolate);
   inline MaybeObjectHandle(MaybeObject object, LocalHeap* local_heap);
-  inline MaybeObjectHandle(Object object, LocalHeap* local_heap);
+  inline MaybeObjectHandle(Tagged<Object> object, LocalHeap* local_heap);
   inline explicit MaybeObjectHandle(Handle<Object> object);
 
-  static inline MaybeObjectHandle Weak(Object object, Isolate* isolate);
+  static inline MaybeObjectHandle Weak(Tagged<Object> object, Isolate* isolate);
   static inline MaybeObjectHandle Weak(Handle<Object> object);
 
   inline MaybeObject operator*() const;
@@ -107,7 +120,7 @@ class MaybeObjectHandle {
   bool is_null() const { return handle_.is_null(); }
 
  private:
-  inline MaybeObjectHandle(Object object,
+  inline MaybeObjectHandle(Tagged<Object> object,
                            HeapObjectReferenceType reference_type,
                            Isolate* isolate);
   inline MaybeObjectHandle(Handle<Object> object,
@@ -117,46 +130,63 @@ class MaybeObjectHandle {
   MaybeHandle<Object> handle_;
 };
 
-#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+#ifdef V8_ENABLE_DIRECT_HANDLE
 
 template <typename T>
-class DirectMaybeHandle final {
+class MaybeDirectHandle final {
  public:
-  V8_INLINE DirectMaybeHandle() = default;
+  V8_INLINE MaybeDirectHandle() = default;
 
-  V8_INLINE DirectMaybeHandle(NullMaybeHandleType) {}
+  V8_INLINE MaybeDirectHandle(NullMaybeHandleType) {}
 
   // Constructor for handling automatic up casting from DirectHandle.
-  // Ex. DirectHandle<JSArray> can be passed when DirectMaybeHandle<Object> is
+  // Ex. DirectHandle<JSArray> can be passed when MaybeDirectHandle<Object> is
   // expected.
   template <typename S, typename = typename std::enable_if<
                             std::is_convertible<S*, T*>::value>::type>
-  V8_INLINE DirectMaybeHandle(DirectHandle<S> handle)
-      : location_(handle.location_) {}
+  V8_INLINE MaybeDirectHandle(DirectHandle<S> handle)
+      : location_(handle.address()) {}
 
-  // Constructor for handling automatic up casting.
-  // Ex. DirectMaybeHandle<JSArray> can be passed when DirectHandle<Object> is
+  // Constructor for handling automatic up casting from Handle.
+  // Ex. Handle<JSArray> can be passed when MaybeDirectHandle<Object> is
   // expected.
   template <typename S, typename = typename std::enable_if<
                             std::is_convertible<S*, T*>::value>::type>
-  V8_INLINE DirectMaybeHandle(DirectMaybeHandle<S> maybe_handle)
+  V8_INLINE MaybeDirectHandle(Handle<S> handle)
+      : MaybeDirectHandle(DirectHandle<S>(handle)) {}
+
+  // Constructor for handling automatic up casting.
+  // Ex. MaybeDirectHandle<JSArray> can be passed when MaybeDirectHandle<Object>
+  // is expected.
+  template <typename S, typename = typename std::enable_if<
+                            std::is_convertible<S*, T*>::value>::type>
+  V8_INLINE MaybeDirectHandle(MaybeDirectHandle<S> maybe_handle)
       : location_(maybe_handle.location_) {}
 
-  V8_INLINE DirectMaybeHandle(T object, Isolate* isolate);
-  V8_INLINE DirectMaybeHandle(T object, LocalHeap* local_heap);
+  // Constructor for handling automatic up casting from MaybeHandle.
+  // Ex. MaybeHandle<JSArray> can be passed when
+  // MaybeDirectHandle<Object> is expected.
+  template <typename S, typename = typename std::enable_if<
+                            std::is_convertible<S*, T*>::value>::type>
+  V8_INLINE MaybeDirectHandle(MaybeHandle<S> maybe_handle)
+      : location_(maybe_handle.location_ == nullptr ? kTaggedNullAddress
+                                                    : *maybe_handle.location_) {
+  }
+
+  V8_INLINE MaybeDirectHandle(T object, Isolate* isolate);
+  V8_INLINE MaybeDirectHandle(T object, LocalHeap* local_heap);
 
   V8_INLINE void Assert() const { DCHECK_NE(location_, kTaggedNullAddress); }
   V8_INLINE void Check() const { CHECK_NE(location_, kTaggedNullAddress); }
 
-  V8_INLINE DirectHandle<T> ToDirectHandleChecked() const {
+  V8_INLINE DirectHandle<T> ToHandleChecked() const {
     Check();
     return DirectHandle<T>(location_);
   }
 
   // Convert to a DirectHandle with a type that can be upcasted to.
   template <typename S>
-  V8_WARN_UNUSED_RESULT V8_INLINE bool ToDirectHandle(
-      DirectHandle<S>* out) const {
+  V8_WARN_UNUSED_RESULT V8_INLINE bool ToHandle(DirectHandle<S>* out) const {
     if (location_ == kTaggedNullAddress) {
       *out = DirectHandle<T>::null();
       return false;
@@ -174,13 +204,44 @@ class DirectMaybeHandle final {
  protected:
   Address location_ = kTaggedNullAddress;
 
-  // DirectMaybeHandles of different classes are allowed to access each
+  // MaybeDirectHandles of different classes are allowed to access each
   // other's location_.
   template <typename>
-  friend class DirectMaybeHandle;
+  friend class MaybeDirectHandle;
+};
+
+class MaybeObjectDirectHandle {
+ public:
+  inline MaybeObjectDirectHandle()
+      : reference_type_(HeapObjectReferenceType::STRONG) {}
+  inline MaybeObjectDirectHandle(MaybeObject object, Isolate* isolate);
+  inline MaybeObjectDirectHandle(Object object, Isolate* isolate);
+  inline MaybeObjectDirectHandle(MaybeObject object, LocalHeap* local_heap);
+  inline MaybeObjectDirectHandle(Object object, LocalHeap* local_heap);
+  inline explicit MaybeObjectDirectHandle(DirectHandle<Object> object);
+
+  static inline MaybeObjectDirectHandle Weak(Object object, Isolate* isolate);
+  static inline MaybeObjectDirectHandle Weak(DirectHandle<Object> object);
+
+  inline MaybeObject operator*() const;
+  inline MaybeObject operator->() const;
+  inline DirectHandle<Object> object() const;
+
+  inline bool is_identical_to(const MaybeObjectDirectHandle& other) const;
+  bool is_null() const { return handle_.is_null(); }
+
+ private:
+  inline MaybeObjectDirectHandle(Object object,
+                                 HeapObjectReferenceType reference_type,
+                                 Isolate* isolate);
+  inline MaybeObjectDirectHandle(DirectHandle<Object> object,
+                                 HeapObjectReferenceType reference_type);
+
+  HeapObjectReferenceType reference_type_;
+  MaybeDirectHandle<Object> handle_;
 };
 
-#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+#endif  // V8_ENABLE_DIRECT_HANDLE
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/handles/persistent-handles.cc b/deps/v8/src/handles/persistent-handles.cc
index 7e03f9bb9be3a0..ac2db0836f50cf 100644
--- a/deps/v8/src/handles/persistent-handles.cc
+++ b/deps/v8/src/handles/persistent-handles.cc
@@ -169,5 +169,11 @@ std::unique_ptr<PersistentHandles> PersistentHandlesScope::Detach() {
   return ph;
 }
 
+// static
+bool PersistentHandlesScope::IsActive(Isolate* isolate) {
+  return isolate->handle_scope_implementer()
+             ->last_handle_before_deferred_block_ != nullptr;
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/handles/persistent-handles.h b/deps/v8/src/handles/persistent-handles.h
index 0f5dc9e260a5e8..aa5d0c695cf85d 100644
--- a/deps/v8/src/handles/persistent-handles.h
+++ b/deps/v8/src/handles/persistent-handles.h
@@ -33,7 +33,7 @@ class PersistentHandles {
   V8_EXPORT_PRIVATE void Iterate(RootVisitor* visitor);
 
   template <typename T>
-  Handle<T> NewHandle(T obj) {
+  Handle<T> NewHandle(Tagged<T> obj) {
 #ifdef DEBUG
     CheckOwnerIsNotParked();
 #endif
@@ -45,6 +45,12 @@ class PersistentHandles {
     return NewHandle(*obj);
   }
 
+  template <typename T>
+  Handle<T> NewHandle(T obj) {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return NewHandle(Tagged<T>(obj));
+  }
+
   Isolate* isolate() const { return isolate_; }
 
 #ifdef DEBUG
@@ -113,6 +119,10 @@ class V8_NODISCARD PersistentHandlesScope {
   // Moves all blocks of this scope into PersistentHandles and returns it.
   V8_EXPORT_PRIVATE std::unique_ptr<PersistentHandles> Detach();
 
+  // Returns true if the current active handle scope is a persistent handle
+  // scope, thus all handles created become persistent handles.
+  V8_EXPORT_PRIVATE static bool IsActive(Isolate* isolate);
+
  private:
   Address* first_block_;
   Address* prev_limit_;
diff --git a/deps/v8/src/handles/shared-object-conveyor-handles.cc b/deps/v8/src/handles/shared-object-conveyor-handles.cc
index f3e9e4ef3bd6e7..1fa3ce82546c99 100644
--- a/deps/v8/src/handles/shared-object-conveyor-handles.cc
+++ b/deps/v8/src/handles/shared-object-conveyor-handles.cc
@@ -15,8 +15,9 @@ SharedObjectConveyorHandles::SharedObjectConveyorHandles(Isolate* isolate)
     : persistent_handles_(
           isolate->shared_space_isolate()->NewPersistentHandles()) {}
 
-uint32_t SharedObjectConveyorHandles::Persist(HeapObject shared_object) {
-  DCHECK(shared_object.IsShared());
+uint32_t SharedObjectConveyorHandles::Persist(
+    Tagged<HeapObject> shared_object) {
+  DCHECK(IsShared(shared_object));
   uint32_t id = static_cast<uint32_t>(shared_objects_.size());
   shared_objects_.push_back(persistent_handles_->NewHandle(shared_object));
   return id;
diff --git a/deps/v8/src/handles/shared-object-conveyor-handles.h b/deps/v8/src/handles/shared-object-conveyor-handles.h
index f6b50de6c368b9..073ae1d335a014 100644
--- a/deps/v8/src/handles/shared-object-conveyor-handles.h
+++ b/deps/v8/src/handles/shared-object-conveyor-handles.h
@@ -34,13 +34,13 @@ class SharedObjectConveyorHandles {
   SharedObjectConveyorHandles& operator=(const SharedObjectConveyorHandles&) =
       delete;
 
-  uint32_t Persist(HeapObject shared_object);
+  uint32_t Persist(Tagged<HeapObject> shared_object);
 
   bool HasPersisted(uint32_t object_id) const {
     return object_id < shared_objects_.size();
   }
 
-  HeapObject GetPersisted(uint32_t object_id) const {
+  Tagged<HeapObject> GetPersisted(uint32_t object_id) const {
     DCHECK(HasPersisted(object_id));
     return *shared_objects_[object_id];
   }
diff --git a/deps/v8/src/handles/traced-handles.cc b/deps/v8/src/handles/traced-handles.cc
index d9e2a0e23a563d..4c99ae927e372a 100644
--- a/deps/v8/src/handles/traced-handles.cc
+++ b/deps/v8/src/handles/traced-handles.cc
@@ -110,11 +110,11 @@ class TracedNode final {
     }
   }
   Address raw_object() const { return object_; }
-  Object object() const { return Object(object_); }
+  Tagged<Object> object() const { return Tagged<Object>(object_); }
   Handle<Object> handle() { return Handle<Object>(&object_); }
   FullObjectSlot location() { return FullObjectSlot(&object_); }
 
-  Handle<Object> Publish(Object object, bool needs_young_bit_update,
+  Handle<Object> Publish(Tagged<Object> object, bool needs_young_bit_update,
                          bool needs_black_allocation, bool has_old_host);
   void Release();
 
@@ -152,7 +152,8 @@ TracedNode::TracedNode(IndexType index, IndexType next_free_index)
 }
 
 // Publishes all internal state to be consumed by other threads.
-Handle<Object> TracedNode::Publish(Object object, bool needs_young_bit_update,
+Handle<Object> TracedNode::Publish(Tagged<Object> object,
+                                   bool needs_young_bit_update,
                                    bool needs_black_allocation,
                                    bool has_old_host) {
   DCHECK(!is_in_use());
@@ -545,7 +546,8 @@ class TracedHandlesImpl final {
   TracedNode* AllocateNode();
   void FreeNode(TracedNode*);
 
-  bool NeedsToBeRemembered(Object value, TracedNode* node, Address* slot,
+  bool NeedsToBeRemembered(Tagged<Object> value, TracedNode* node,
+                           Address* slot,
                            GlobalHandleStoreMode store_mode) const;
 
   TracedNodeBlock::OverallList blocks_;
@@ -632,13 +634,13 @@ TracedHandlesImpl::~TracedHandlesImpl() {
 }
 
 namespace {
-bool NeedsTrackingInYoungNodes(Object object, TracedNode* node) {
+bool NeedsTrackingInYoungNodes(Tagged<Object> object, TracedNode* node) {
   return ObjectInYoungGeneration(object) && !node->is_in_young_list();
 }
 }  // namespace
 
 bool TracedHandlesImpl::NeedsToBeRemembered(
-    Object object, TracedNode* node, Address* slot,
+    Tagged<Object> object, TracedNode* node, Address* slot,
     GlobalHandleStoreMode store_mode) const {
   DCHECK(!node->has_old_host());
   if (store_mode == GlobalHandleStoreMode::kInitializingStore) {
@@ -658,7 +660,7 @@ bool TracedHandlesImpl::NeedsToBeRemembered(
 
 Handle<Object> TracedHandlesImpl::Create(Address value, Address* slot,
                                          GlobalHandleStoreMode store_mode) {
-  Object object(value);
+  Tagged<Object> object(value);
   auto* node = AllocateNode();
   bool needs_young_bit_update = false;
   if (NeedsTrackingInYoungNodes(object, node)) {
@@ -717,7 +719,7 @@ void TracedHandlesImpl::Copy(const TracedNode& from_node, Address** to) {
   SetSlotThreadSafe(to, o.location());
 #ifdef VERIFY_HEAP
   if (v8_flags.verify_heap) {
-    Object(**to).ObjectVerify(isolate_);
+    Object::ObjectVerify(Tagged<Object>(**to), isolate_);
   }
 #endif  // VERIFY_HEAP
 }
@@ -912,6 +914,12 @@ void TracedHandlesImpl::ProcessYoungObjects(
   auto* const handler = isolate_->heap()->GetEmbedderRootsHandler();
   if (!handler) return;
 
+  // If CppGC is attached, since the embeeder may trigger allocations in
+  // ResetRoot().
+  if (auto* cpp_heap = CppHeap::From(isolate_->heap()->cpp_heap())) {
+    cpp_heap->EnterNoGCScope();
+  }
+
   for (TracedNode* node : young_nodes_) {
     if (!node->is_in_use()) continue;
 
@@ -935,6 +943,10 @@ void TracedHandlesImpl::ProcessYoungObjects(
       }
     }
   }
+
+  if (auto* cpp_heap = CppHeap::From(isolate_->heap()->cpp_heap())) {
+    cpp_heap->LeaveNoGCScope();
+  }
 }
 
 void TracedHandlesImpl::Iterate(RootVisitor* visitor) {
@@ -1114,8 +1126,8 @@ void TracedHandles::Move(Address** from, Address** to) {
 }
 
 namespace {
-Object MarkObject(Object obj, TracedNode& node,
-                  TracedHandles::MarkMode mark_mode) {
+Tagged<Object> MarkObject(Tagged<Object> obj, TracedNode& node,
+                          TracedHandles::MarkMode mark_mode) {
   if (mark_mode == TracedHandles::MarkMode::kOnlyYoung &&
       !node.is_in_young_list())
     return Smi::zero();
@@ -1130,11 +1142,11 @@ Object MarkObject(Object obj, TracedNode& node,
 }  // namespace
 
 // static
-Object TracedHandles::Mark(Address* location, MarkMode mark_mode) {
+Tagged<Object> TracedHandles::Mark(Address* location, MarkMode mark_mode) {
   // The load synchronizes internal bitfields that are also read atomically
   // from the concurrent marker. The counterpart is `TracedNode::Publish()`.
-  Object object =
-      Object(reinterpret_cast<std::atomic<Address>*>(location)->load(
+  Tagged<Object> object =
+      Tagged<Object>(reinterpret_cast<std::atomic<Address>*>(location)->load(
           std::memory_order_acquire));
   auto* node = TracedNode::FromLocation(location);
   DCHECK(node->is_in_use<AccessMode::ATOMIC>());
@@ -1142,9 +1154,9 @@ Object TracedHandles::Mark(Address* location, MarkMode mark_mode) {
 }
 
 // static
-Object TracedHandles::MarkConservatively(Address* inner_location,
-                                         Address* traced_node_block_base,
-                                         MarkMode mark_mode) {
+Tagged<Object> TracedHandles::MarkConservatively(
+    Address* inner_location, Address* traced_node_block_base,
+    MarkMode mark_mode) {
   // Compute the `TracedNode` address based on its inner pointer.
   const ptrdiff_t delta = reinterpret_cast<uintptr_t>(inner_location) -
                           reinterpret_cast<uintptr_t>(traced_node_block_base);
diff --git a/deps/v8/src/handles/traced-handles.h b/deps/v8/src/handles/traced-handles.h
index b1817e148c130d..c5de08b4101d1e 100644
--- a/deps/v8/src/handles/traced-handles.h
+++ b/deps/v8/src/handles/traced-handles.h
@@ -28,10 +28,10 @@ class V8_EXPORT_PRIVATE TracedHandles final {
   static void Copy(const Address* const* from, Address** to);
   static void Move(Address** from, Address** to);
 
-  static Object Mark(Address* location, MarkMode mark_mode);
-  static Object MarkConservatively(Address* inner_location,
-                                   Address* traced_node_block_base,
-                                   MarkMode mark_mode);
+  static Tagged<Object> Mark(Address* location, MarkMode mark_mode);
+  static Tagged<Object> MarkConservatively(Address* inner_location,
+                                           Address* traced_node_block_base,
+                                           MarkMode mark_mode);
 
   explicit TracedHandles(Isolate*);
   ~TracedHandles();
diff --git a/deps/v8/src/heap/OWNERS b/deps/v8/src/heap/OWNERS
index bcdce0ea89a247..936b02ab7db0da 100644
--- a/deps/v8/src/heap/OWNERS
+++ b/deps/v8/src/heap/OWNERS
@@ -6,4 +6,5 @@ nikolaos@chromium.org
 omerkatz@chromium.org
 
 per-file *factory*=file:../objects/OWNERS
+per-file read-only-promotion.*=file:../snapshot/OWNERS
 per-file static-roots.h=file:../../COMMON_OWNERS
diff --git a/deps/v8/src/heap/allocation-observer.cc b/deps/v8/src/heap/allocation-observer.cc
index 651b0add2ab7f5..f3a3628463a397 100644
--- a/deps/v8/src/heap/allocation-observer.cc
+++ b/deps/v8/src/heap/allocation-observer.cc
@@ -92,7 +92,6 @@ void AllocationCounter::InvokeAllocationObservers(Address soon_object,
   DCHECK(pending_removed_.empty());
 
   for (AllocationObserverCounter& aoc : observers_) {
-    DCHECK_LT(current_counter_, aoc.next_counter_);
     if (aoc.next_counter_ - current_counter_ <= aligned_object_size) {
       {
         DisallowGarbageCollection no_gc;
diff --git a/deps/v8/src/heap/allocation-result.h b/deps/v8/src/heap/allocation-result.h
index df723a77d7d304..e8fcd9dce24e23 100644
--- a/deps/v8/src/heap/allocation-result.h
+++ b/deps/v8/src/heap/allocation-result.h
@@ -28,7 +28,7 @@ class AllocationResult final {
  public:
   static AllocationResult Failure() { return AllocationResult(); }
 
-  static AllocationResult FromObject(HeapObject heap_object) {
+  static AllocationResult FromObject(Tagged<HeapObject> heap_object) {
     return AllocationResult(heap_object);
   }
 
@@ -45,12 +45,12 @@ class AllocationResult final {
     return true;
   }
 
-  HeapObject ToObjectChecked() const {
+  Tagged<HeapObject> ToObjectChecked() const {
     CHECK(!IsFailure());
     return HeapObject::cast(object_);
   }
 
-  HeapObject ToObject() const {
+  Tagged<HeapObject> ToObject() const {
     DCHECK(!IsFailure());
     return HeapObject::cast(object_);
   }
@@ -61,7 +61,8 @@ class AllocationResult final {
   }
 
  private:
-  explicit AllocationResult(HeapObject heap_object) : object_(heap_object) {}
+  explicit AllocationResult(Tagged<HeapObject> heap_object)
+      : object_(heap_object) {}
 
   HeapObject object_;
 };
diff --git a/deps/v8/src/heap/allocation-stats.h b/deps/v8/src/heap/allocation-stats.h
index f02f2594d98666..d6fb95d309930e 100644
--- a/deps/v8/src/heap/allocation-stats.h
+++ b/deps/v8/src/heap/allocation-stats.h
@@ -8,6 +8,7 @@
 #include <atomic>
 #include <unordered_map>
 
+#include "src/base/functional.h"
 #include "src/base/macros.h"
 #include "src/heap/basic-memory-chunk.h"
 
@@ -108,7 +109,8 @@ class AllocationStats {
   std::atomic<size_t> size_;
 
 #ifdef DEBUG
-  std::unordered_map<const BasicMemoryChunk*, size_t, BasicMemoryChunk::Hasher>
+  std::unordered_map<const BasicMemoryChunk*, size_t,
+                     base::hash<const BasicMemoryChunk*>>
       allocated_on_page_;
 #endif
 };
diff --git a/deps/v8/src/heap/array-buffer-sweeper.cc b/deps/v8/src/heap/array-buffer-sweeper.cc
index 370ed0aa812b37..0c2839dbd157cc 100644
--- a/deps/v8/src/heap/array-buffer-sweeper.cc
+++ b/deps/v8/src/heap/array-buffer-sweeper.cc
@@ -155,20 +155,29 @@ void ArrayBufferSweeper::FinishIfDone() {
 void ArrayBufferSweeper::RequestSweep(
     SweepingType type, TreatAllYoungAsPromoted treat_all_young_as_promoted) {
   DCHECK(!sweeping_in_progress());
-  DCHECK(local_sweeper_.IsEmpty());
 
   if (young_.IsEmpty() && (old_.IsEmpty() || type == SweepingType::kYoung))
     return;
 
+  GCTracer::Scope::ScopeId scope_id =
+      type == SweepingType::kYoung
+          ? GCTracer::Scope::MINOR_MS_FINISH_SWEEP_ARRAY_BUFFERS
+          : GCTracer::Scope::MC_FINISH_SWEEP_ARRAY_BUFFERS;
+  auto trace_id = GetTraceIdForFlowEvent(scope_id);
+  TRACE_GC_WITH_FLOW(heap_->tracer(), scope_id, trace_id,
+                     TRACE_EVENT_FLAG_FLOW_OUT);
   Prepare(type, treat_all_young_as_promoted);
   if (!heap_->IsTearingDown() && !heap_->ShouldReduceMemory() &&
-      v8_flags.concurrent_array_buffer_sweeping) {
-    auto task = MakeCancelableTask(heap_->isolate(), [this, type] {
-      GCTracer::Scope::ScopeId scope_id =
+      v8_flags.concurrent_array_buffer_sweeping &&
+      heap_->ShouldUseBackgroundThreads()) {
+    auto task = MakeCancelableTask(heap_->isolate(), [this, type, trace_id] {
+      GCTracer::Scope::ScopeId background_scope_id =
           type == SweepingType::kYoung
               ? GCTracer::Scope::BACKGROUND_YOUNG_ARRAY_BUFFER_SWEEP
               : GCTracer::Scope::BACKGROUND_FULL_ARRAY_BUFFER_SWEEP;
-      TRACE_GC_EPOCH(heap_->tracer(), scope_id, ThreadKind::kBackground);
+      TRACE_GC_EPOCH_WITH_FLOW(heap_->tracer(), background_scope_id,
+                               ThreadKind::kBackground, trace_id,
+                               TRACE_EVENT_FLAG_FLOW_IN);
       base::MutexGuard guard(&sweeping_mutex_);
       DoSweep();
       job_finished_.NotifyAll();
@@ -223,9 +232,6 @@ void ArrayBufferSweeper::Finalize() {
   young_.Append(&job_->young_);
   old_.Append(&job_->old_);
   DecrementExternalMemoryCounters(job_->freed_bytes_);
-
-  local_sweeper_.Finalize();
-
   job_.reset();
   DCHECK(!sweeping_in_progress());
 }
@@ -240,7 +246,7 @@ void ArrayBufferSweeper::ReleaseAll(ArrayBufferList* list) {
   *list = ArrayBufferList();
 }
 
-void ArrayBufferSweeper::Append(JSArrayBuffer object,
+void ArrayBufferSweeper::Append(Tagged<JSArrayBuffer> object,
                                 ArrayBufferExtension* extension) {
   size_t bytes = extension->accounting_length();
 
@@ -255,7 +261,7 @@ void ArrayBufferSweeper::Append(JSArrayBuffer object,
   IncrementExternalMemoryCounters(bytes);
 }
 
-void ArrayBufferSweeper::Detach(JSArrayBuffer object,
+void ArrayBufferSweeper::Detach(Tagged<JSArrayBuffer> object,
                                 ArrayBufferExtension* extension) {
   // Finish sweeping here first such that the code below is guaranteed to
   // observe the same sweeping state.
@@ -376,5 +382,11 @@ void ArrayBufferSweeper::SweepingJob::SweepYoung() {
   young_ = new_young;
 }
 
+uint64_t ArrayBufferSweeper::GetTraceIdForFlowEvent(
+    GCTracer::Scope::ScopeId scope_id) const {
+  return reinterpret_cast<uint64_t>(this) ^
+         heap_->tracer()->CurrentEpoch(scope_id);
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/array-buffer-sweeper.h b/deps/v8/src/heap/array-buffer-sweeper.h
index b49e54b994058b..2acbb2236ba6aa 100644
--- a/deps/v8/src/heap/array-buffer-sweeper.h
+++ b/deps/v8/src/heap/array-buffer-sweeper.h
@@ -53,14 +53,14 @@ class ArrayBufferSweeper final {
   ~ArrayBufferSweeper();
 
   void RequestSweep(SweepingType sweeping_type,
-                    TreatAllYoungAsPromoted treat_young_as_promoted);
+                    TreatAllYoungAsPromoted treat_all_young_as_promoted);
   void EnsureFinished();
 
   // Track the given ArrayBufferExtension for the given JSArrayBuffer.
-  void Append(JSArrayBuffer object, ArrayBufferExtension* extension);
+  void Append(Tagged<JSArrayBuffer> object, ArrayBufferExtension* extension);
 
   // Detaches an ArrayBufferExtension from a JSArrayBuffer.
-  void Detach(JSArrayBuffer object, ArrayBufferExtension* extension);
+  void Detach(Tagged<JSArrayBuffer> object, ArrayBufferExtension* extension);
 
   const ArrayBufferList& young() const { return young_; }
   const ArrayBufferList& old() const { return old_; }
@@ -70,10 +70,9 @@ class ArrayBufferSweeper final {
   // Bytes accounted in the old generation. Rebuilt during sweeping.
   size_t OldBytes() const { return old().ApproximateBytes(); }
 
-  bool sweeping_in_progress() const {
-    DCHECK_IMPLIES(!job_, local_sweeper_.IsEmpty());
-    return job_.get();
-  }
+  bool sweeping_in_progress() const { return job_.get(); }
+
+  uint64_t GetTraceIdForFlowEvent(GCTracer::Scope::ScopeId scope_id) const;
 
  private:
   struct SweepingJob;
diff --git a/deps/v8/src/heap/base-space.cc b/deps/v8/src/heap/base-space.cc
deleted file mode 100644
index bb03ea660a58c5..00000000000000
--- a/deps/v8/src/heap/base-space.cc
+++ /dev/null
@@ -1,35 +0,0 @@
-// Copyright 2020 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/heap/base-space.h"
-
-namespace v8 {
-namespace internal {
-
-const char* BaseSpace::GetSpaceName(AllocationSpace space) {
-  switch (space) {
-    case NEW_SPACE:
-      return "new_space";
-    case OLD_SPACE:
-      return "old_space";
-    case CODE_SPACE:
-      return "code_space";
-    case SHARED_SPACE:
-      return "shared_space";
-    case LO_SPACE:
-      return "large_object_space";
-    case NEW_LO_SPACE:
-      return "new_large_object_space";
-    case CODE_LO_SPACE:
-      return "code_large_object_space";
-    case SHARED_LO_SPACE:
-      return "shared_large_object_space";
-    case RO_SPACE:
-      return "read_only_space";
-  }
-  UNREACHABLE();
-}
-
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/src/heap/base-space.h b/deps/v8/src/heap/base-space.h
index fe456bb86c77e9..2c8a3a86c890b2 100644
--- a/deps/v8/src/heap/base-space.h
+++ b/deps/v8/src/heap/base-space.h
@@ -31,24 +31,6 @@ class V8_EXPORT_PRIVATE BaseSpace : public Malloced {
 
   AllocationSpace identity() const { return id_; }
 
-  // Returns name of the space.
-  static const char* GetSpaceName(AllocationSpace space);
-
-  const char* name() const { return GetSpaceName(id_); }
-
-  void AccountCommitted(size_t bytes) {
-    DCHECK_GE(committed_ + bytes, committed_);
-    committed_ += bytes;
-    if (committed_ > max_committed_) {
-      max_committed_ = committed_;
-    }
-  }
-
-  void AccountUncommitted(size_t bytes) {
-    DCHECK_GE(committed_, committed_ - bytes);
-    committed_ -= bytes;
-  }
-
   // Return the total amount committed memory for this space, i.e., allocatable
   // memory and page headers.
   virtual size_t CommittedMemory() const { return committed_; }
@@ -67,18 +49,30 @@ class V8_EXPORT_PRIVATE BaseSpace : public Malloced {
 #endif  // VERIFY_HEAP
 
  protected:
-  BaseSpace(Heap* heap, AllocationSpace id)
-      : heap_(heap), id_(id), committed_(0), max_committed_(0) {}
+  BaseSpace(Heap* heap, AllocationSpace id) : heap_(heap), id_(id) {}
 
   virtual ~BaseSpace() = default;
 
+  void AccountCommitted(size_t bytes) {
+    DCHECK_GE(committed_ + bytes, committed_);
+    committed_ += bytes;
+    if (committed_ > max_committed_) {
+      max_committed_ = committed_;
+    }
+  }
+
+  void AccountUncommitted(size_t bytes) {
+    DCHECK_GE(committed_, committed_ - bytes);
+    committed_ -= bytes;
+  }
+
  protected:
   Heap* heap_;
   AllocationSpace id_;
 
   // Keeps track of committed memory in a space.
-  std::atomic<size_t> committed_;
-  size_t max_committed_;
+  std::atomic<size_t> committed_{0};
+  size_t max_committed_ = 0;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/base/DEPS b/deps/v8/src/heap/base/DEPS
new file mode 100644
index 00000000000000..204a108a6c85cd
--- /dev/null
+++ b/deps/v8/src/heap/base/DEPS
@@ -0,0 +1,10 @@
+# This should follow the same rules as src/base/DEPS in that we only want to
+# include src/base and a few API includes.
+include_rules = [
+  "-include",
+  "+include/v8config.h",
+  "+include/v8-platform.h",
+  "-src",
+  "+src/base",
+  "+src/heap/base",
+]
diff --git a/deps/v8/src/heap/base/asm/loong64/push_registers_asm.cc b/deps/v8/src/heap/base/asm/loong64/push_registers_asm.cc
index aa8dcd356bf9ea..1e6b8d367f4d04 100644
--- a/deps/v8/src/heap/base/asm/loong64/push_registers_asm.cc
+++ b/deps/v8/src/heap/base/asm/loong64/push_registers_asm.cc
@@ -17,32 +17,32 @@ asm(".text                                               \n"
     "PushAllRegistersAndIterateStack:                    \n"
     // Push all callee-saved registers and save return address.
     "  addi.d $sp, $sp, -96                              \n"
-    "  st.d $ra, $sp, 88                                 \n"
-    "  st.d $s8, $sp, 80                                 \n"
-    "  st.d $sp, $sp, 72                                 \n"
-    "  st.d $fp, $sp, 64                                 \n"
-    "  st.d $s7, $sp, 56                                 \n"
-    "  st.d $s6, $sp, 48                                 \n"
-    "  st.d $s5, $sp, 40                                 \n"
-    "  st.d $s4, $sp, 32                                 \n"
-    "  st.d $s3, $sp, 24                                 \n"
-    "  st.d $s2, $sp, 16                                 \n"
-    "  st.d $s1, $sp,  8                                 \n"
-    "  st.d $s0, $sp,  0                                 \n"
+    "  st.d $s8, $sp, 88                                 \n"
+    "  st.d $s7, $sp, 80                                 \n"
+    "  st.d $s6, $sp, 72                                 \n"
+    "  st.d $s5, $sp, 64                                 \n"
+    "  st.d $s4, $sp, 56                                 \n"
+    "  st.d $s3, $sp, 48                                 \n"
+    "  st.d $s2, $sp, 40                                 \n"
+    "  st.d $s1, $sp, 32                                 \n"
+    "  st.d $s0, $sp, 24                                 \n"
+    "  st.d $fp, $sp, 16                                 \n"
+    "  st.d $sp, $sp,  8                                 \n"
+    "  st.d $ra, $sp,  0                                 \n"
     // Maintain frame pointer.
-    "  addi.d $s8, $sp, 0                                \n"
+    "  addi.d $fp, $sp, 0                                \n"
     // Pass 1st parameter (a0) unchanged (Stack*).
     // Pass 2nd parameter (a1) unchanged (StackVisitor*).
     // Save 3rd parameter (a2; IterateStackCallback).
-    "  addi.d $a3, $a2, 0                                \n"
+    "  addi.d $t7, $a2, 0                                \n"
     // Call the callback.
     // Pass 3rd parameter as sp (stack pointer).
     "  addi.d $a2, $sp, 0                                \n"
-    "  jirl $ra, $a3, 0                                  \n"
+    "  jirl $ra, $t7, 0                                  \n"
     // Load return address.
-    "  ld.d $ra, $sp, 88                                 \n"
+    "  ld.d $ra, $sp, 0                                  \n"
     // Restore frame pointer.
-    "  ld.d $s8, $sp, 80                                 \n"
+    "  ld.d $fp, $sp, 16                                 \n"
     // Discard all callee-saved registers.
     "  addi.d $sp, $sp, 96                               \n"
     "  jirl $zero, $ra, 0                                \n");
diff --git a/deps/v8/src/heap/base/asm/mips64/push_registers_asm.cc b/deps/v8/src/heap/base/asm/mips64/push_registers_asm.cc
index 47779e0736849d..2b8072970952e9 100644
--- a/deps/v8/src/heap/base/asm/mips64/push_registers_asm.cc
+++ b/deps/v8/src/heap/base/asm/mips64/push_registers_asm.cc
@@ -35,9 +35,9 @@ asm(".text                                               \n"
     // Pass 1st parameter (a0) unchanged (Stack*).
     // Pass 2nd parameter (a1) unchanged (StackVisitor*).
     // Save 3rd parameter (a2; IterateStackCallback).
-    "  move $a3, $a2                                     \n"
+    "  move $t9, $a2                                     \n"
     // Call the callback.
-    "  jalr $a3                                          \n"
+    "  jalr $t9                                          \n"
     // Delay slot: Pass 3rd parameter as sp (stack pointer).
     "  move $a2, $sp                                     \n"
     // Load return address.
diff --git a/deps/v8/src/heap/base/basic-slot-set.h b/deps/v8/src/heap/base/basic-slot-set.h
index 87faceec44c9f3..25eedb9f6d1140 100644
--- a/deps/v8/src/heap/base/basic-slot-set.h
+++ b/deps/v8/src/heap/base/basic-slot-set.h
@@ -250,36 +250,27 @@ class BasicSlotSet {
   // });
   //
   // Releases memory for empty buckets with FREE_EMPTY_BUCKETS.
-  template <typename Callback>
+  template <AccessMode access_mode = AccessMode::ATOMIC, typename Callback>
   size_t Iterate(Address chunk_start, size_t start_bucket, size_t end_bucket,
                  Callback callback, EmptyBucketMode mode) {
-    return Iterate(chunk_start, start_bucket, end_bucket, callback,
-                   [this, mode](size_t bucket_index) {
-                     if (mode == EmptyBucketMode::FREE_EMPTY_BUCKETS) {
-                       ReleaseBucket(bucket_index);
-                     }
-                   });
-  }
-
-  bool FreeEmptyBuckets(size_t buckets) {
-    bool empty = true;
-    for (size_t bucket_index = 0; bucket_index < buckets; bucket_index++) {
-      if (!FreeBucketIfEmpty(bucket_index)) {
-        empty = false;
-      }
-    }
-
-    return empty;
+    return Iterate<access_mode>(
+        chunk_start, start_bucket, end_bucket, callback,
+        [this, mode](size_t bucket_index) {
+          if (mode == EmptyBucketMode::FREE_EMPTY_BUCKETS) {
+            ReleaseBucket(bucket_index);
+          }
+        });
   }
 
-  static const int kCellsPerBucket = 32;
-  static const int kCellsPerBucketLog2 = 5;
-  static const int kCellSizeBytesLog2 = 2;
-  static const int kCellSizeBytes = 1 << kCellSizeBytesLog2;
-  static const int kBitsPerCell = 32;
-  static const int kBitsPerCellLog2 = 5;
-  static const int kBitsPerBucket = kCellsPerBucket * kBitsPerCell;
-  static const int kBitsPerBucketLog2 = kCellsPerBucketLog2 + kBitsPerCellLog2;
+  static constexpr int kCellsPerBucket = 32;
+  static constexpr int kCellsPerBucketLog2 = 5;
+  static constexpr int kCellSizeBytesLog2 = 2;
+  static constexpr int kCellSizeBytes = 1 << kCellSizeBytesLog2;
+  static constexpr int kBitsPerCell = 32;
+  static constexpr int kBitsPerCellLog2 = 5;
+  static constexpr int kBitsPerBucket = kCellsPerBucket * kBitsPerCell;
+  static constexpr int kBitsPerBucketLog2 =
+      kCellsPerBucketLog2 + kBitsPerCellLog2;
 
   class Bucket final {
     uint32_t cells_[kCellsPerBucket];
@@ -292,19 +283,21 @@ class BasicSlotSet {
     }
 
     uint32_t* cells() { return cells_; }
-    uint32_t* cell(int cell_index) { return cells() + cell_index; }
+    const uint32_t* cells() const { return cells_; }
+    uint32_t* cell(int cell_index) { return cells_ + cell_index; }
+    const uint32_t* cell(int cell_index) const { return cells_ + cell_index; }
 
     template <AccessMode access_mode = AccessMode::ATOMIC>
     uint32_t LoadCell(int cell_index) {
       DCHECK_LT(cell_index, kCellsPerBucket);
-      if (access_mode == AccessMode::ATOMIC)
-        return v8::base::AsAtomic32::Acquire_Load(cells() + cell_index);
-      return *(cells() + cell_index);
+      if constexpr (access_mode == AccessMode::ATOMIC)
+        return v8::base::AsAtomic32::Acquire_Load(cell(cell_index));
+      return *(cell(cell_index));
     }
 
     template <AccessMode access_mode = AccessMode::ATOMIC>
     void SetCellBits(int cell_index, uint32_t mask) {
-      if (access_mode == AccessMode::ATOMIC) {
+      if constexpr (access_mode == AccessMode::ATOMIC) {
         v8::base::AsAtomic32::SetBits(cell(cell_index), mask, mask);
       } else {
         uint32_t* c = cell(cell_index);
@@ -312,15 +305,20 @@ class BasicSlotSet {
       }
     }
 
+    template <AccessMode access_mode = AccessMode::ATOMIC>
     void ClearCellBits(int cell_index, uint32_t mask) {
-      v8::base::AsAtomic32::SetBits(cell(cell_index), 0u, mask);
+      if constexpr (access_mode == AccessMode::ATOMIC) {
+        v8::base::AsAtomic32::SetBits(cell(cell_index), 0u, mask);
+      } else {
+        *cell(cell_index) &= ~mask;
+      }
     }
 
     void StoreCell(int cell_index, uint32_t value) {
       v8::base::AsAtomic32::Release_Store(cell(cell_index), value);
     }
 
-    bool IsEmpty() {
+    bool IsEmpty() const {
       for (int i = 0; i < kCellsPerBucket; i++) {
         if (cells_[i] != 0) {
           return false;
@@ -331,18 +329,19 @@ class BasicSlotSet {
   };
 
  protected:
-  template <typename Callback, typename EmptyBucketCallback>
+  template <AccessMode access_mode = AccessMode::ATOMIC, typename Callback,
+            typename EmptyBucketCallback>
   size_t Iterate(Address chunk_start, size_t start_bucket, size_t end_bucket,
                  Callback callback, EmptyBucketCallback empty_bucket_callback) {
     size_t new_count = 0;
     for (size_t bucket_index = start_bucket; bucket_index < end_bucket;
          bucket_index++) {
-      Bucket* bucket = LoadBucket(bucket_index);
+      Bucket* bucket = LoadBucket<access_mode>(bucket_index);
       if (bucket != nullptr) {
         size_t in_bucket_count = 0;
         size_t cell_offset = bucket_index << kBitsPerBucketLog2;
         for (int i = 0; i < kCellsPerBucket; i++, cell_offset += kBitsPerCell) {
-          uint32_t cell = bucket->LoadCell(i);
+          uint32_t cell = bucket->template LoadCell<access_mode>(i);
           if (cell) {
             uint32_t old_cell = cell;
             uint32_t mask = 0;
@@ -359,7 +358,7 @@ class BasicSlotSet {
             }
             uint32_t new_cell = old_cell & ~mask;
             if (old_cell != new_cell) {
-              bucket->ClearCellBits(i, mask);
+              bucket->template ClearCellBits<access_mode>(i, mask);
             }
           }
         }
diff --git a/deps/v8/src/heap/base/bytes.h b/deps/v8/src/heap/base/bytes.h
new file mode 100644
index 00000000000000..2beedad69e069a
--- /dev/null
+++ b/deps/v8/src/heap/base/bytes.h
@@ -0,0 +1,63 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_BASE_BYTES_H_
+#define V8_HEAP_BASE_BYTES_H_
+
+#include <algorithm>
+#include <cstddef>
+#include <limits>
+
+#include "src/base/optional.h"
+#include "src/base/platform/time.h"
+#include "src/base/ring-buffer.h"
+
+namespace heap::base {
+
+struct BytesAndDuration final {
+  constexpr BytesAndDuration() = default;
+  constexpr BytesAndDuration(size_t bytes, v8::base::TimeDelta duration)
+      : bytes(bytes), duration(duration) {}
+
+  size_t bytes = 0;
+  v8::base::TimeDelta duration;
+};
+
+using BytesAndDurationBuffer = v8::base::RingBuffer<BytesAndDuration>;
+
+// Returns the average speed of events recorded in `buffer` including an
+// `initial` event in Bytes/ms. If provided, `selected_duration` will bound the
+// events considered (which uses the order of events in
+// `BytesAndDurationBuffer`). The bounds are in Bytes/ms and can be used to
+// bound non-zero speeds.
+inline double AverageSpeed(
+    const BytesAndDurationBuffer& buffer, const BytesAndDuration& initial,
+    v8::base::Optional<v8::base::TimeDelta> selected_duration,
+    size_t min_non_empty_speed = 0,
+    size_t max_speed = std::numeric_limits<size_t>::max()) {
+  const BytesAndDuration sum = buffer.Reduce(
+      [selected_duration](const BytesAndDuration& a,
+                          const BytesAndDuration& b) {
+        if (selected_duration.has_value() &&
+            a.duration >= selected_duration.value()) {
+          return a;
+        }
+        return BytesAndDuration(a.bytes + b.bytes, a.duration + b.duration);
+      },
+      initial);
+  const auto duration = sum.duration;
+  // TODO(v8:14140): The return value should really be an optional double to
+  // indicate no speed.
+  if (duration.IsZero()) {
+    return 0.0;
+  }
+  return std::max(
+      std::min(static_cast<double>(sum.bytes) / duration.InMillisecondsF(),
+               static_cast<double>(max_speed)),
+      static_cast<double>(min_non_empty_speed));
+}
+
+}  // namespace heap::base
+
+#endif  // V8_HEAP_BASE_BYTES_H_
diff --git a/deps/v8/src/heap/base/incremental-marking-schedule.cc b/deps/v8/src/heap/base/incremental-marking-schedule.cc
new file mode 100644
index 00000000000000..9ad330a94dab10
--- /dev/null
+++ b/deps/v8/src/heap/base/incremental-marking-schedule.cc
@@ -0,0 +1,136 @@
+// Copyright 2020 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/base/incremental-marking-schedule.h"
+
+#include <cmath>
+
+#include "src/base/platform/time.h"
+
+namespace heap::base {
+
+namespace {
+
+constexpr auto kTimeDeltaForPredictableSchedule =
+    v8::base::TimeDelta::FromMilliseconds(1);
+
+}  // namespace
+
+// static
+std::unique_ptr<IncrementalMarkingSchedule>
+IncrementalMarkingSchedule::CreateWithDefaultMinimumMarkedBytesPerStep(
+    bool predictable_schedule) {
+  return std::unique_ptr<IncrementalMarkingSchedule>(
+      new IncrementalMarkingSchedule(
+          kDefaultMinimumMarkedBytesPerIncrementalStep, predictable_schedule));
+}
+
+// static
+std::unique_ptr<IncrementalMarkingSchedule>
+IncrementalMarkingSchedule::CreateWithZeroMinimumMarkedBytesPerStep(
+    bool predictable_schedule) {
+  return std::unique_ptr<IncrementalMarkingSchedule>(
+      new IncrementalMarkingSchedule(0, predictable_schedule));
+}
+
+IncrementalMarkingSchedule::IncrementalMarkingSchedule(
+    size_t min_marked_bytes_per_step, bool predictable_schedule)
+    : min_marked_bytes_per_step_(min_marked_bytes_per_step),
+      predictable_schedule_(predictable_schedule) {
+  if (predictable_schedule_) {
+    elapsed_time_override_.emplace(kTimeDeltaForPredictableSchedule);
+  }
+}
+
+void IncrementalMarkingSchedule::NotifyIncrementalMarkingStart() {
+  DCHECK(incremental_marking_start_time_.IsNull());
+  incremental_marking_start_time_ = v8::base::TimeTicks::Now();
+}
+
+void IncrementalMarkingSchedule::UpdateMutatorThreadMarkedBytes(
+    size_t overall_marked_bytes) {
+  mutator_thread_marked_bytes_ = overall_marked_bytes;
+}
+
+void IncrementalMarkingSchedule::AddConcurrentlyMarkedBytes(
+    size_t marked_bytes) {
+  concurrently_marked_bytes_.fetch_add(marked_bytes, std::memory_order_relaxed);
+}
+
+size_t IncrementalMarkingSchedule::GetOverallMarkedBytes() const {
+  return mutator_thread_marked_bytes_ + GetConcurrentlyMarkedBytes();
+}
+
+size_t IncrementalMarkingSchedule::GetConcurrentlyMarkedBytes() const {
+  return concurrently_marked_bytes_.load(std::memory_order_relaxed);
+}
+
+v8::base::TimeDelta IncrementalMarkingSchedule::GetElapsedTime() {
+  if (elapsed_time_override_.has_value()) {
+    const v8::base::TimeDelta elapsed_time = *elapsed_time_override_;
+    if (predictable_schedule_) {
+      elapsed_time_override_ = kTimeDeltaForPredictableSchedule;
+    } else {
+      elapsed_time_override_.reset();
+    }
+    return elapsed_time;
+  }
+  return v8::base::TimeTicks::Now() - incremental_marking_start_time_;
+}
+
+const IncrementalMarkingSchedule::StepInfo
+IncrementalMarkingSchedule::GetCurrentStepInfo() const {
+  return current_step_;
+}
+
+size_t IncrementalMarkingSchedule::GetNextIncrementalStepDuration(
+    size_t estimated_live_bytes) {
+  last_estimated_live_bytes_ = estimated_live_bytes;
+  DCHECK(!incremental_marking_start_time_.IsNull());
+  const auto elapsed_time = GetElapsedTime();
+  const size_t last_marked_bytes = current_step_.marked_bytes();
+  const size_t actual_marked_bytes = GetOverallMarkedBytes();
+  const size_t expected_marked_bytes =
+      std::ceil(estimated_live_bytes * elapsed_time.InMillisecondsF() /
+                kEstimatedMarkingTime.InMillisecondsF());
+  // Stash away the current data for others to access.
+  current_step_ = {mutator_thread_marked_bytes_, GetConcurrentlyMarkedBytes(),
+                   estimated_live_bytes, expected_marked_bytes, elapsed_time};
+  if ((actual_marked_bytes >= last_marked_bytes) &&
+      (actual_marked_bytes - last_marked_bytes) <
+          kStepSizeWhenNotMakingProgress) {
+    return std::max(kStepSizeWhenNotMakingProgress, min_marked_bytes_per_step_);
+  }
+  if (expected_marked_bytes < actual_marked_bytes) {
+    // Marking is ahead of schedule, incremental marking should do the minimum.
+    return min_marked_bytes_per_step_;
+  }
+  // Assuming marking will take |kEstimatedMarkingTime|, overall there will
+  // be |estimated_live_bytes| live bytes to mark, and that marking speed is
+  // constant, after |elapsed_time| the number of marked_bytes should be
+  // |estimated_live_bytes| * (|elapsed_time| / |kEstimatedMarkingTime|),
+  // denoted as |expected_marked_bytes|.  If |actual_marked_bytes| is less,
+  // i.e. marking is behind schedule, incremental marking should help "catch
+  // up" by marking (|expected_marked_bytes| - |actual_marked_bytes|).
+  return std::max(min_marked_bytes_per_step_,
+                  expected_marked_bytes - actual_marked_bytes);
+}
+
+constexpr double
+    IncrementalMarkingSchedule::kEphemeronPairsFlushingRatioIncrements;
+bool IncrementalMarkingSchedule::ShouldFlushEphemeronPairs() {
+  if (GetOverallMarkedBytes() <
+      (ephemeron_pairs_flushing_ratio_target_ * last_estimated_live_bytes_))
+    return false;
+  ephemeron_pairs_flushing_ratio_target_ +=
+      kEphemeronPairsFlushingRatioIncrements;
+  return true;
+}
+
+void IncrementalMarkingSchedule::SetElapsedTimeForTesting(
+    v8::base::TimeDelta elapsed_time) {
+  elapsed_time_override_.emplace(elapsed_time);
+}
+
+}  // namespace heap::base
diff --git a/deps/v8/src/heap/base/incremental-marking-schedule.h b/deps/v8/src/heap/base/incremental-marking-schedule.h
new file mode 100644
index 00000000000000..f8377208ec4a1b
--- /dev/null
+++ b/deps/v8/src/heap/base/incremental-marking-schedule.h
@@ -0,0 +1,138 @@
+// Copyright 2020 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_BASE_INCREMENTAL_MARKING_SCHEDULE_H_
+#define V8_HEAP_BASE_INCREMENTAL_MARKING_SCHEDULE_H_
+
+#include <atomic>
+#include <memory>
+
+#include "src/base/optional.h"
+#include "src/base/platform/time.h"
+
+namespace heap::base {
+
+// Incremental marking schedule that assumes a fixed time window for scheduling
+// incremental marking steps.
+//
+// Usage:
+// 1. NotifyIncrementalMarkingStart()
+// 2. Any combination of:
+//   -> UpdateMutatorThreadMarkedBytes(mutator_marked_bytes)
+//   -> AddConcurrentlyMarkedBytes(concurrently_marked_bytes_delta)
+//   -> MarkSynchronously(GetNextIncrementalStepDuration(estimated_live_size))
+class V8_EXPORT_PRIVATE IncrementalMarkingSchedule final {
+ public:
+  struct StepInfo final {
+    size_t mutator_marked_bytes = 0;
+    size_t concurrent_marked_bytes = 0;
+    size_t estimated_live_bytes = 0;
+    size_t expected_marked_bytes = 0;
+    v8::base::TimeDelta elapsed_time;
+
+    size_t marked_bytes() const {
+      return mutator_marked_bytes + concurrent_marked_bytes;
+    }
+    // Returns the schedule delta in bytes. Positive and negative delta values
+    // indicate that the marked bytes are ahead and behind the expected
+    // schedule, respectively.
+    int64_t scheduled_delta_bytes() const {
+      return static_cast<int64_t>(marked_bytes()) - expected_marked_bytes;
+    }
+
+    // Returns whether the schedule is behind the expectation.
+    bool is_behind_expectation() const { return scheduled_delta_bytes() < 0; }
+  };
+
+  // Estimated walltime duration of incremental marking per GC cycle. This value
+  // determines how the mutator thread will try to catch up on incremental
+  // marking steps.
+  static constexpr v8::base::TimeDelta kEstimatedMarkingTime =
+      v8::base::TimeDelta::FromMilliseconds(500);
+
+  // Minimum number of bytes that should be marked during an incremental
+  // marking step.
+  static constexpr size_t kDefaultMinimumMarkedBytesPerIncrementalStep =
+      64 * 1024;
+
+  // Step size used when no progress is being made. This step size should allow
+  // for finalizing marking.
+  static constexpr size_t kStepSizeWhenNotMakingProgress = 64 * 1024;
+
+  static std::unique_ptr<IncrementalMarkingSchedule>
+  CreateWithDefaultMinimumMarkedBytesPerStep(bool predictable_schedule = false);
+  static std::unique_ptr<IncrementalMarkingSchedule>
+  CreateWithZeroMinimumMarkedBytesPerStep(bool predictable_schedule = false);
+
+  IncrementalMarkingSchedule(const IncrementalMarkingSchedule&) = delete;
+  IncrementalMarkingSchedule& operator=(const IncrementalMarkingSchedule&) =
+      delete;
+
+  // Notifies the schedule that incremental marking has been started.
+  void NotifyIncrementalMarkingStart();
+
+  // Updates the mutator marked bytes. Must be called from the thread owning the
+  // schedule. The schedule supports marked bytes being adjusted downwards,
+  // i.e., going backwards in the schedule.
+  void UpdateMutatorThreadMarkedBytes(size_t);
+
+  // Adds concurrently marked bytes. May be called from any thread. Not required
+  // to be complete, i.e., it is okay to not report bytes already marked for the
+  // schedule.
+  void AddConcurrentlyMarkedBytes(size_t);
+
+  // Returns the reported overall marked bytes including those marked by the
+  // mutator and concurrently.
+  size_t GetOverallMarkedBytes() const;
+
+  // Returns the reported concurrently marked bytes. Only as accurate as
+  // `AddConcurrentlyMarkedBytes()` is.
+  size_t GetConcurrentlyMarkedBytes() const;
+
+  // Computes the next step duration based on reported marked bytes and the
+  // current `estimated_live_bytes`.
+  size_t GetNextIncrementalStepDuration(size_t estimated_live_bytes);
+
+  // Returns the step info for the current step. This function is most useful
+  // after calling `GetNextIncrementalStepDuration()` to report scheduling
+  // details.
+  const StepInfo GetCurrentStepInfo() const;
+
+  // Returns whether locally cached ephemerons should be flushed and made
+  // available globally. Will only return true once every
+  // `kEphemeronPairsFlushingRatioIncrements` percent of overall marked bytes.
+  bool ShouldFlushEphemeronPairs();
+
+  // The minimum marked bytes per step. This is a lower bound for all the step
+  // sizes returned from `GetNextIncrementalStepDuration()`.
+  size_t min_marked_bytes_per_step() const {
+    return min_marked_bytes_per_step_;
+  }
+
+  // Sets the elapsed time for testing purposes. Is reset after calling
+  // `GetNextIncrementalStepDuration()`.
+  void SetElapsedTimeForTesting(v8::base::TimeDelta);
+
+ private:
+  static constexpr double kEphemeronPairsFlushingRatioIncrements = 0.25;
+
+  IncrementalMarkingSchedule(size_t minimum_marked_bytes_per_step,
+                             bool predictable_schedule);
+
+  v8::base::TimeDelta GetElapsedTime();
+
+  v8::base::TimeTicks incremental_marking_start_time_;
+  size_t mutator_thread_marked_bytes_ = 0;
+  std::atomic_size_t concurrently_marked_bytes_{0};
+  size_t last_estimated_live_bytes_ = 0;
+  double ephemeron_pairs_flushing_ratio_target_ = 0.25;
+  StepInfo current_step_;
+  const size_t min_marked_bytes_per_step_;
+  const bool predictable_schedule_ = false;
+  v8::base::Optional<v8::base::TimeDelta> elapsed_time_override_;
+};
+
+}  // namespace heap::base
+
+#endif  // V8_HEAP_BASE_INCREMENTAL_MARKING_SCHEDULE_H_
diff --git a/deps/v8/src/heap/base/stack.cc b/deps/v8/src/heap/base/stack.cc
index 3a0ec5f352dc84..ef0241aa399eb7 100644
--- a/deps/v8/src/heap/base/stack.cc
+++ b/deps/v8/src/heap/base/stack.cc
@@ -16,10 +16,8 @@ namespace heap::base {
 // Pushes all callee-saved registers to the stack and invokes the callback,
 // passing the supplied pointers (stack and argument) and the intended stack
 // marker.
-using IterateStackCallback = void (*)(const Stack*, StackVisitor*, const void*);
-extern "C" void PushAllRegistersAndIterateStack(const Stack* stack,
-                                                StackVisitor* visitor,
-                                                IterateStackCallback callback);
+extern "C" void PushAllRegistersAndIterateStack(
+    Stack* stack, void* argument, Stack::IterateStackCallback callback);
 
 bool Stack::IsOnStack(const void* slot) const {
   DCHECK_NOT_NULL(stack_start_);
@@ -144,8 +142,10 @@ void IteratePointersInStack(StackVisitor* visitor, const void* top,
 }  // namespace
 
 // static
-void Stack::IteratePointersImpl(const Stack* stack, StackVisitor* visitor,
+void Stack::IteratePointersImpl(const Stack* stack, void* argument,
                                 const void* stack_end) {
+  StackVisitor* visitor = static_cast<StackVisitor*>(argument);
+
 #ifdef V8_USE_ADDRESS_SANITIZER
   const void* asan_fake_stack = __asan_get_current_fake_stack();
 #else
@@ -170,15 +170,9 @@ void Stack::IteratePointersImpl(const Stack* stack, StackVisitor* visitor,
   IterateUnsafeStackIfNecessary(visitor);
 }
 
-void Stack::IteratePointers(StackVisitor* visitor) const {
-  // TODO(v8:13493): Remove the implication as soon as IsOnCurrentStack is
-  // compatible with stack switching.
-  DCHECK_IMPLIES(!wasm_stack_switching_, IsOnCurrentStack(stack_start_));
-  PushAllRegistersAndIterateStack(this, visitor, &IteratePointersImpl);
-  // No need to deal with callee-saved registers as they will be kept alive by
-  // the regular conservative stack iteration.
-  // TODO(chromium:1056170): Add support for SIMD and/or filtering.
-  IterateUnsafeStackIfNecessary(visitor);
+void Stack::IteratePointersForTesting(StackVisitor* visitor) {
+  SetMarkerAndCallback(
+      [this, visitor]() { IteratePointersUntilMarker(visitor); });
 }
 
 void Stack::IteratePointersUntilMarker(StackVisitor* visitor) const {
@@ -205,4 +199,10 @@ void Stack::AddStackSegment(const void* start, const void* top) {
 
 void Stack::ClearStackSegments() { inactive_stacks_.clear(); }
 
+void Stack::SetMarkerAndCallbackHelper(void* argument,
+                                       IterateStackCallback callback) {
+  PushAllRegistersAndIterateStack(this, argument, callback);
+  // TODO(chromium:1056170): Add support for SIMD and/or filtering.
+}
+
 }  // namespace heap::base
diff --git a/deps/v8/src/heap/base/stack.h b/deps/v8/src/heap/base/stack.h
index 1d3aaab3db8bce..d7600d92bbcf43 100644
--- a/deps/v8/src/heap/base/stack.h
+++ b/deps/v8/src/heap/base/stack.h
@@ -30,61 +30,77 @@ class StackVisitor {
 // of relevant GC stack regions where interesting pointers can be found.
 class V8_EXPORT_PRIVATE Stack final {
  public:
-  explicit Stack(const void* stack_start = nullptr,
-                 bool wasm_stack_switching = false)
-      : stack_start_(stack_start),
-        wasm_stack_switching_(wasm_stack_switching) {}
+  explicit Stack(const void* stack_start = nullptr)
+      : stack_start_(stack_start) {}
 
   // Sets the start of the stack.
-  void SetStackStart(const void* stack_start, bool wasm_stack_switching) {
-    stack_start_ = stack_start;
-    wasm_stack_switching_ = wasm_stack_switching;
-  }
+  void SetStackStart(const void* stack_start) { stack_start_ = stack_start; }
 
   // Returns true if |slot| is part of the stack and false otherwise.
   bool IsOnStack(const void* slot) const;
 
-  // Word-aligned iteration of the stack. Callee-saved registers are pushed to
-  // the stack before iterating pointers. Slot values are passed on to
-  // `visitor`.
-  void IteratePointers(StackVisitor* visitor) const;
-
-  // Word-aligned iteration of the stack, starting at the `stack_marker_`. Slot
-  // values are passed on to `visitor`. This is intended to be used with
-  // verifiers that only visit a subset of the stack of IteratePointers().
-  //
-  // **Ignores:**
-  // - Callee-saved registers.
-  // - SafeStack.
+  // Word-aligned iteration of the stack, starting at the `stack_marker_`
+  // and going to the stack start. Slot values are passed on to `visitor`.
   void IteratePointersUntilMarker(StackVisitor* visitor) const;
 
   void AddStackSegment(const void* start, const void* top);
   void ClearStackSegments();
 
-  // This method should be inlined, to set the marker at the current frame's
-  // stack top.
-  V8_INLINE void SetMarkerToCurrentStackPosition() {
-    stack_marker_ = v8::base::Stack::GetCurrentStackPosition();
+  // Push callee-saved registers to the stack, set the stack marker to the
+  // current stack top and invoke the callback.
+  template <typename Callback>
+  V8_INLINE void SetMarkerAndCallback(Callback callback) {
+    SetMarkerAndCallbackHelper(static_cast<void*>(&callback),
+                               &SetMarkerAndCallbackImpl<Callback>);
+  }
+
+  template <typename Callback>
+  V8_INLINE void SetMarkerIfNeededAndCallback(Callback callback) {
+    if (stack_marker_ == nullptr) {
+      SetMarkerAndCallbackHelper(static_cast<void*>(&callback),
+                                 &SetMarkerAndCallbackImpl<Callback>);
+    } else {
+      DCHECK(IsOnCurrentStack(stack_marker_));
+      callback();
+    }
   }
 
+  using IterateStackCallback = void (*)(Stack*, void*, const void*);
+
+  // This method combines SetMarkerAndCallback with IteratePointersUntilMarker.
+  // Callee-saved registers are pushed to the stack and then a word-aligned
+  // iteration of the stack is performed. Slot values are passed on to
+  // `visitor`. To be used for testing.
+  void IteratePointersForTesting(StackVisitor* visitor);
+
+  bool IsMarkerSet() const { return stack_marker_ != nullptr; }
+
  private:
 #ifdef DEBUG
   static bool IsOnCurrentStack(const void* ptr);
 #endif
 
-  static void IteratePointersImpl(const Stack* stack, StackVisitor* visitor,
+  static void IteratePointersImpl(const Stack* stack, void* argument,
                                   const void* stack_end);
 
+  V8_NOINLINE void SetMarkerAndCallbackHelper(void* argument,
+                                              IterateStackCallback callback);
+
+  template <typename Callback>
+  static void SetMarkerAndCallbackImpl(Stack* stack, void* argument,
+                                       const void* stack_end) {
+    DCHECK_NULL(stack->stack_marker_);
+    stack->stack_marker_ = stack_end;
+    Callback* callback = static_cast<Callback*>(argument);
+    (*callback)();
+    stack->stack_marker_ = nullptr;
+  }
+
   const void* stack_start_;
 
   // Marker that signals end of the interesting stack region in which on-heap
   // pointers can be found.
-  const void* stack_marker_;
-
-  // TODO(v8:13493): This is for suppressing the check that we are in the
-  // correct stack, in the case of  WASM stack switching. It will be removed as
-  // soon as context saving becomes compatible with stack switching.
-  bool wasm_stack_switching_;
+  const void* stack_marker_ = nullptr;
 
   // Stack segments that may also contain pointers and should be scanned.
   struct StackSegments {
diff --git a/deps/v8/src/heap/base/worklist.h b/deps/v8/src/heap/base/worklist.h
index 0fc798e321de4c..efe8aaedc1eedf 100644
--- a/deps/v8/src/heap/base/worklist.h
+++ b/deps/v8/src/heap/base/worklist.h
@@ -61,7 +61,7 @@ class Worklist final {
   class Local;
   class Segment;
 
-  static constexpr int kMinSegmentSizeForTesting = MinSegmentSize;
+  static constexpr int kMinSegmentSize = MinSegmentSize;
 
   Worklist() = default;
   ~Worklist() { CHECK(IsEmpty()); }
@@ -224,6 +224,7 @@ class Worklist<EntryType, MinSegmentSize>::Segment final
     } else {
       result = v8::base::AllocateAtLeast<char>(wanted_bytes);
     }
+    DCHECK_NOT_NULL(result.ptr);
     return new (result.ptr)
         Segment(CapacityForMallocSize(result.count * sizeof(char)));
   }
@@ -386,6 +387,7 @@ template <typename EntryType, uint16_t MinSegmentSize>
 void Worklist<EntryType, MinSegmentSize>::Local::Push(EntryType entry) {
   if (V8_UNLIKELY(push_segment_->IsFull())) {
     PublishPushSegment();
+    push_segment_ = NewSegment();
   }
   push_segment()->Push(entry);
 }
@@ -420,14 +422,19 @@ bool Worklist<EntryType, MinSegmentSize>::Local::IsGlobalEmpty() const {
 
 template <typename EntryType, uint16_t MinSegmentSize>
 void Worklist<EntryType, MinSegmentSize>::Local::Publish() {
-  if (!push_segment_->IsEmpty()) PublishPushSegment();
-  if (!pop_segment_->IsEmpty()) PublishPopSegment();
+  if (!push_segment_->IsEmpty()) {
+    PublishPushSegment();
+    push_segment_ = internal::SegmentBase::GetSentinelSegmentAddress();
+  }
+  if (!pop_segment_->IsEmpty()) {
+    PublishPopSegment();
+    pop_segment_ = internal::SegmentBase::GetSentinelSegmentAddress();
+  }
 }
 
 template <typename EntryType, uint16_t MinSegmentSize>
 void Worklist<EntryType, MinSegmentSize>::Local::Merge(
     Worklist<EntryType, MinSegmentSize>::Local& other) {
-  other.Publish();
   worklist_.Merge(other.worklist_);
 }
 
@@ -435,14 +442,12 @@ template <typename EntryType, uint16_t MinSegmentSize>
 void Worklist<EntryType, MinSegmentSize>::Local::PublishPushSegment() {
   if (push_segment_ != internal::SegmentBase::GetSentinelSegmentAddress())
     worklist_.Push(push_segment());
-  push_segment_ = NewSegment();
 }
 
 template <typename EntryType, uint16_t MinSegmentSize>
 void Worklist<EntryType, MinSegmentSize>::Local::PublishPopSegment() {
   if (pop_segment_ != internal::SegmentBase::GetSentinelSegmentAddress())
     worklist_.Push(pop_segment());
-  pop_segment_ = NewSegment();
 }
 
 template <typename EntryType, uint16_t MinSegmentSize>
diff --git a/deps/v8/src/heap/basic-memory-chunk.cc b/deps/v8/src/heap/basic-memory-chunk.cc
index 152786f19d106e..76c0cc865de410 100644
--- a/deps/v8/src/heap/basic-memory-chunk.cc
+++ b/deps/v8/src/heap/basic-memory-chunk.cc
@@ -8,6 +8,7 @@
 
 #include "src/heap/heap-write-barrier-inl.h"
 #include "src/heap/incremental-marking.h"
+#include "src/heap/marking-inl.h"
 #include "src/objects/heap-object.h"
 #include "src/utils/allocation.h"
 
@@ -60,14 +61,9 @@ BasicMemoryChunk::BasicMemoryChunk(Heap* heap, BaseSpace* space,
       area_start_(area_start),
       area_end_(area_end),
       allocated_bytes_(area_end - area_start),
-      wasted_memory_(0),
       high_water_mark_(area_start - reinterpret_cast<Address>(this)),
       owner_(space),
-      reservation_(std::move(reservation)) {
-  if (space->identity() != RO_SPACE) {
-    marking_bitmap<AccessMode::NON_ATOMIC>()->Clear();
-  }
-}
+      reservation_(std::move(reservation)) {}
 
 bool BasicMemoryChunk::InOldSpace() const {
   return owner()->identity() == OLD_SPACE;
@@ -82,23 +78,10 @@ void BasicMemoryChunk::SynchronizedHeapLoad() const {
   CHECK(reinterpret_cast<Heap*>(
             base::Acquire_Load(reinterpret_cast<base::AtomicWord*>(
                 &(const_cast<BasicMemoryChunk*>(this)->heap_)))) != nullptr ||
-        InReadOnlySpaceRaw());
+        IsFlagSet(READ_ONLY_HEAP));
 }
 #endif
 
-// static
-MarkBit BasicMemoryChunk::ComputeMarkBit(HeapObject object) {
-  return BasicMemoryChunk::ComputeMarkBit(object.address());
-}
-
-// static
-MarkBit BasicMemoryChunk::ComputeMarkBit(Address address) {
-  BasicMemoryChunk* chunk = BasicMemoryChunk::FromAddress(address);
-  int index = chunk->AddressToMarkbitIndex(address);
-  return chunk->marking_bitmap<AccessMode::NON_ATOMIC>()->MarkBitFromIndex(
-      index);
-}
-
 class BasicMemoryChunkValidator {
   // Computed offsets should match the compiler generated ones.
   static_assert(BasicMemoryChunk::kSizeOffset ==
diff --git a/deps/v8/src/heap/basic-memory-chunk.h b/deps/v8/src/heap/basic-memory-chunk.h
index 2b14498f84bea5..6822ff72f52335 100644
--- a/deps/v8/src/heap/basic-memory-chunk.h
+++ b/deps/v8/src/heap/basic-memory-chunk.h
@@ -10,6 +10,7 @@
 
 #include "src/base/atomic-utils.h"
 #include "src/base/flags.h"
+#include "src/base/functional.h"
 #include "src/common/globals.h"
 #include "src/flags/flags.h"
 #include "src/heap/marking.h"
@@ -24,13 +25,6 @@ class BaseSpace;
 
 class BasicMemoryChunk {
  public:
-  // Use with std data structures.
-  struct Hasher {
-    size_t operator()(const BasicMemoryChunk* const chunk) const {
-      return reinterpret_cast<size_t>(chunk) >> kPageSizeBits;
-    }
-  };
-
   // All possible flags that can be set on a page. While the value of flags
   // doesn't matter in principle, keep flags used in the write barrier together
   // in order to have dense page flag checks in the write barrier.
@@ -71,84 +65,110 @@ class BasicMemoryChunk {
     // from new to old space during evacuation.
     PAGE_NEW_OLD_PROMOTION = 1u << 10,
 
-    // |PAGE_NEW_NEW_PROMOTION|: A page tagged with this flag has been moved
-    // within the new space during evacuation.
-    PAGE_NEW_NEW_PROMOTION = 1u << 11,
-
     // This flag is intended to be used for testing. Works only when both
     // v8_flags.stress_compaction and
     // v8_flags.manual_evacuation_candidates_selection are set. It forces the
     // page to become an evacuation candidate at next candidates selection
     // cycle.
-    FORCE_EVACUATION_CANDIDATE_FOR_TESTING = 1u << 12,
+    FORCE_EVACUATION_CANDIDATE_FOR_TESTING = 1u << 11,
 
     // This flag is intended to be used for testing.
-    NEVER_ALLOCATE_ON_PAGE = 1u << 13,
+    NEVER_ALLOCATE_ON_PAGE = 1u << 12,
 
     // The memory chunk is already logically freed, however the actual freeing
     // still has to be performed.
-    PRE_FREED = 1u << 14,
+    PRE_FREED = 1u << 13,
 
     // |POOLED|: When actually freeing this chunk, only uncommit and do not
     // give up the reservation as we still reuse the chunk at some point.
-    POOLED = 1u << 15,
+    POOLED = 1u << 14,
 
     // |COMPACTION_WAS_ABORTED|: Indicates that the compaction in this page
     //   has been aborted and needs special handling by the sweeper.
-    COMPACTION_WAS_ABORTED = 1u << 16,
+    COMPACTION_WAS_ABORTED = 1u << 15,
 
-    NEW_SPACE_BELOW_AGE_MARK = 1u << 18,
+    NEW_SPACE_BELOW_AGE_MARK = 1u << 16,
 
     // The memory chunk freeing bookkeeping has been performed but the chunk has
     // not yet been freed.
-    UNREGISTERED = 1u << 19,
+    UNREGISTERED = 1u << 17,
 
     // The memory chunk is pinned in memory and can't be moved. This is likely
     // because there exists a potential pointer to somewhere in the chunk which
     // can't be updated.
-    PINNED = 1u << 20,
+    PINNED = 1u << 18,
 
     // A Page with code objects.
-    IS_EXECUTABLE = 1u << 21,
+    IS_EXECUTABLE = 1u << 19,
   };
 
   using MainThreadFlags = base::Flags<Flag, uintptr_t>;
 
   static constexpr MainThreadFlags kAllFlagsMask = ~MainThreadFlags(NO_FLAGS);
-
   static constexpr MainThreadFlags kPointersToHereAreInterestingMask =
       POINTERS_TO_HERE_ARE_INTERESTING;
-
   static constexpr MainThreadFlags kPointersFromHereAreInterestingMask =
       POINTERS_FROM_HERE_ARE_INTERESTING;
-
   static constexpr MainThreadFlags kEvacuationCandidateMask =
       EVACUATION_CANDIDATE;
-
   static constexpr MainThreadFlags kIsInYoungGenerationMask =
       MainThreadFlags(FROM_PAGE) | MainThreadFlags(TO_PAGE);
-
   static constexpr MainThreadFlags kIsLargePageMask = LARGE_PAGE;
-
   static constexpr MainThreadFlags kInSharedHeap = IN_WRITABLE_SHARED_SPACE;
-
   static constexpr MainThreadFlags kIncrementalMarking = INCREMENTAL_MARKING;
-
   static constexpr MainThreadFlags kSkipEvacuationSlotsRecordingMask =
       MainThreadFlags(kEvacuationCandidateMask) |
       MainThreadFlags(kIsInYoungGenerationMask);
 
-  static const intptr_t kAlignment =
+  static constexpr intptr_t kAlignment =
       (static_cast<uintptr_t>(1) << kPageSizeBits);
+  static constexpr intptr_t kAlignmentMask = kAlignment - 1;
+
+  static constexpr intptr_t kSizeOffset = MemoryChunkLayout::kSizeOffset;
+  static constexpr intptr_t kFlagsOffset = MemoryChunkLayout::kFlagsOffset;
+  static constexpr intptr_t kHeapOffset = MemoryChunkLayout::kHeapOffset;
+  static constexpr intptr_t kAreaStartOffset =
+      MemoryChunkLayout::kAreaStartOffset;
+  static constexpr intptr_t kAreaEndOffset = MemoryChunkLayout::kAreaEndOffset;
+  static constexpr intptr_t kMarkingBitmapOffset =
+      MemoryChunkLayout::kMarkingBitmapOffset;
+  static constexpr size_t kHeaderSize =
+      MemoryChunkLayout::kBasicMemoryChunkHeaderSize;
+
+  static constexpr Address BaseAddress(Address a) {
+    return a & ~kAlignmentMask;
+  }
+
+  // Only works if the pointer is in the first kPageSize of the MemoryChunk.
+  static BasicMemoryChunk* FromAddress(Address a) {
+    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
+    return reinterpret_cast<BasicMemoryChunk*>(BaseAddress(a));
+  }
+
+  // Only works if the object is in the first kPageSize of the MemoryChunk.
+  static BasicMemoryChunk* FromHeapObject(Tagged<HeapObject> o) {
+    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
+    return reinterpret_cast<BasicMemoryChunk*>(BaseAddress(o.ptr()));
+  }
 
-  static const intptr_t kAlignmentMask = kAlignment - 1;
+  static inline void UpdateHighWaterMark(Address mark) {
+    if (mark == kNullAddress) return;
+    // Need to subtract one from the mark because when a chunk is full the
+    // top points to the next address after the chunk, which effectively belongs
+    // to another chunk. See the comment to Page::FromAllocationAreaAddress.
+    BasicMemoryChunk* chunk = BasicMemoryChunk::FromAddress(mark - 1);
+    intptr_t new_mark = static_cast<intptr_t>(mark - chunk->address());
+    intptr_t old_mark = chunk->high_water_mark_.load(std::memory_order_relaxed);
+    while ((new_mark > old_mark) &&
+           !chunk->high_water_mark_.compare_exchange_weak(
+               old_mark, new_mark, std::memory_order_acq_rel)) {
+    }
+  }
 
   BasicMemoryChunk(Heap* heap, BaseSpace* space, size_t chunk_size,
                    Address area_start, Address area_end,
                    VirtualMemory reservation);
 
-  static Address BaseAddress(Address a) { return a & ~kAlignmentMask; }
-
   Address address() const { return reinterpret_cast<Address>(this); }
 
   // Returns the offset of a given address to this page.
@@ -156,16 +176,6 @@ class BasicMemoryChunk {
     return static_cast<size_t>(a - address());
   }
 
-  // Some callers rely on the fact that this can operate on both
-  // tagged and aligned object addresses.
-  inline uint32_t AddressToMarkbitIndex(Address addr) const {
-    return static_cast<uint32_t>(addr - this->address()) >> kTaggedSizeLog2;
-  }
-
-  inline Address MarkbitIndexToAddress(uint32_t index) const {
-    return this->address() + (index << kTaggedSizeLog2);
-  }
-
   size_t size() const { return size_; }
   void set_size(size_t size) { size_ = size; }
 
@@ -185,9 +195,10 @@ class BasicMemoryChunk {
 
   // Gets the chunk's owner or null if the space has been detached.
   BaseSpace* owner() const { return owner_; }
-
   void set_owner(BaseSpace* space) { owner_ = space; }
 
+  // Return all current flags.
+  MainThreadFlags GetFlags() const { return main_thread_flags_; }
   void SetFlag(Flag flag) { main_thread_flags_ |= flag; }
   bool IsFlagSet(Flag flag) const { return main_thread_flags_ & flag; }
   void ClearFlag(Flag flag) {
@@ -200,13 +211,6 @@ class BasicMemoryChunk {
     main_thread_flags_ = (main_thread_flags_ & ~mask) | (flags & mask);
   }
 
-  // Return all current flags.
-  MainThreadFlags GetFlags() const { return main_thread_flags_; }
-
- private:
-  bool InReadOnlySpaceRaw() const { return IsFlagSet(READ_ONLY_HEAP); }
-
- public:
   bool InReadOnlySpace() const {
 #ifdef THREAD_SANITIZER
     // This is needed because TSAN does not process the memory fence
@@ -217,7 +221,6 @@ class BasicMemoryChunk {
   }
 
   bool NeverEvacuate() const { return IsFlagSet(NEVER_EVACUATE); }
-
   void MarkNeverEvacuate() { SetFlag(NEVER_EVACUATE); }
 
   bool CanAllocate() const {
@@ -279,51 +282,8 @@ class BasicMemoryChunk {
   void add_wasted_memory(size_t waste) { wasted_memory_ += waste; }
   size_t allocated_bytes() const { return allocated_bytes_; }
 
-  static const intptr_t kSizeOffset = MemoryChunkLayout::kSizeOffset;
-  static const intptr_t kFlagsOffset = MemoryChunkLayout::kFlagsOffset;
-  static const intptr_t kHeapOffset = MemoryChunkLayout::kHeapOffset;
-  static const intptr_t kAreaStartOffset = MemoryChunkLayout::kAreaStartOffset;
-  static const intptr_t kAreaEndOffset = MemoryChunkLayout::kAreaEndOffset;
-  static const intptr_t kMarkingBitmapOffset =
-      MemoryChunkLayout::kMarkingBitmapOffset;
-  static const size_t kHeaderSize =
-      MemoryChunkLayout::kBasicMemoryChunkHeaderSize;
-
-  // Only works if the pointer is in the first kPageSize of the MemoryChunk.
-  static BasicMemoryChunk* FromAddress(Address a) {
-    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
-    return reinterpret_cast<BasicMemoryChunk*>(BaseAddress(a));
-  }
-
-  // Only works if the object is in the first kPageSize of the MemoryChunk.
-  static BasicMemoryChunk* FromHeapObject(HeapObject o) {
-    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
-    return reinterpret_cast<BasicMemoryChunk*>(BaseAddress(o.ptr()));
-  }
-
-  template <AccessMode mode>
-  ConcurrentBitmap<mode>* marking_bitmap() const {
-    DCHECK(!InReadOnlySpace());
-    return static_cast<ConcurrentBitmap<mode>*>(
-        Bitmap::FromAddress(address() + kMarkingBitmapOffset));
-  }
-
   Address HighWaterMark() const { return address() + high_water_mark_; }
 
-  static inline void UpdateHighWaterMark(Address mark) {
-    if (mark == kNullAddress) return;
-    // Need to subtract one from the mark because when a chunk is full the
-    // top points to the next address after the chunk, which effectively belongs
-    // to another chunk. See the comment to Page::FromAllocationAreaAddress.
-    BasicMemoryChunk* chunk = BasicMemoryChunk::FromAddress(mark - 1);
-    intptr_t new_mark = static_cast<intptr_t>(mark - chunk->address());
-    intptr_t old_mark = chunk->high_water_mark_.load(std::memory_order_relaxed);
-    while ((new_mark > old_mark) &&
-           !chunk->high_water_mark_.compare_exchange_weak(
-               old_mark, new_mark, std::memory_order_acq_rel)) {
-    }
-  }
-
   VirtualMemory* reserved_memory() { return &reservation_; }
 
   void ResetAllocationStatistics() {
@@ -349,10 +309,6 @@ class BasicMemoryChunk {
   void SynchronizedHeapLoad() const;
 #endif
 
-  // Computes position of object in marking bitmap. Useful for debugging.
-  V8_ALLOW_UNUSED static MarkBit ComputeMarkBit(HeapObject object);
-  V8_ALLOW_UNUSED static MarkBit ComputeMarkBit(Address address);
-
  protected:
   // Overall size of the chunk, including the header and guards.
   size_t size_;
@@ -375,7 +331,7 @@ class BasicMemoryChunk {
   // linear allocation area.
   size_t allocated_bytes_;
   // Freed memory that was not added to the free list.
-  size_t wasted_memory_;
+  size_t wasted_memory_ = 0;
 
   // Assuming the initial allocation on a page is sequential, count highest
   // number of bytes ever allocated on the page.
@@ -401,6 +357,32 @@ DEFINE_OPERATORS_FOR_FLAGS(BasicMemoryChunk::MainThreadFlags)
 static_assert(std::is_standard_layout<BasicMemoryChunk>::value);
 
 }  // namespace internal
+
+namespace base {
+
+// Define special hash function for chunk pointers, to be used with std data
+// structures, e.g.
+// std::unordered_set<BasicMemoryChunk*, base::hash<BasicMemoryChunk*>
+// This hash function discards the trailing zero bits (chunk alignment).
+// Notice that, when pointer compression is enabled, it also discards the
+// cage base.
+template <>
+struct hash<const i::BasicMemoryChunk*> {
+  V8_INLINE size_t operator()(const i::BasicMemoryChunk* chunk) const {
+    return static_cast<v8::internal::Tagged_t>(
+               reinterpret_cast<uintptr_t>(chunk)) >>
+           kPageSizeBits;
+  }
+};
+
+template <>
+struct hash<i::BasicMemoryChunk*> {
+  V8_INLINE size_t operator()(i::BasicMemoryChunk* chunk) const {
+    return hash<const i::BasicMemoryChunk*>()(chunk);
+  }
+};
+
+}  // namespace base
 }  // namespace v8
 
 #endif  // V8_HEAP_BASIC_MEMORY_CHUNK_H_
diff --git a/deps/v8/src/heap/code-object-registry.cc b/deps/v8/src/heap/code-object-registry.cc
deleted file mode 100644
index 91315fbed6f234..00000000000000
--- a/deps/v8/src/heap/code-object-registry.cc
+++ /dev/null
@@ -1,71 +0,0 @@
-// Copyright 2020 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/heap/code-object-registry.h"
-
-#include <algorithm>
-
-#include "src/base/logging.h"
-
-namespace v8 {
-namespace internal {
-
-void CodeObjectRegistry::RegisterNewlyAllocatedCodeObject(Address code) {
-  base::RecursiveMutexGuard guard(&code_object_registry_mutex_);
-  if (is_sorted_) {
-    is_sorted_ =
-        (code_object_registry_.empty() || code_object_registry_.back() < code);
-  }
-  code_object_registry_.push_back(code);
-}
-
-void CodeObjectRegistry::ReinitializeFrom(std::vector<Address>&& code_objects) {
-  base::RecursiveMutexGuard guard(&code_object_registry_mutex_);
-
-#if DEBUG
-  Address last_start = kNullAddress;
-  for (Address object_start : code_objects) {
-    DCHECK_LT(last_start, object_start);
-    last_start = object_start;
-  }
-#endif  // DEBUG
-
-  is_sorted_ = true;
-  code_object_registry_ = std::move(code_objects);
-}
-
-bool CodeObjectRegistry::Contains(Address object) const {
-  base::RecursiveMutexGuard guard(&code_object_registry_mutex_);
-  if (!is_sorted_) {
-    std::sort(code_object_registry_.begin(), code_object_registry_.end());
-    is_sorted_ = true;
-  }
-  return (std::binary_search(code_object_registry_.begin(),
-                             code_object_registry_.end(), object));
-}
-
-Address CodeObjectRegistry::GetCodeObjectStartFromInnerAddress(
-    Address address) const {
-  base::RecursiveMutexGuard guard(&code_object_registry_mutex_);
-  if (!is_sorted_) {
-    std::sort(code_object_registry_.begin(), code_object_registry_.end());
-    is_sorted_ = true;
-  }
-
-  // The code registry can't be empty, else the code object can't exist.
-  DCHECK(!code_object_registry_.empty());
-
-  // std::upper_bound returns the first code object strictly greater than
-  // address, so the code object containing the address has to be the previous
-  // one.
-  auto it = std::upper_bound(code_object_registry_.begin(),
-                             code_object_registry_.end(), address);
-  // The address has to be contained in a code object, so necessarily the
-  // address can't be smaller than the first code object.
-  DCHECK_NE(it, code_object_registry_.begin());
-  return *(--it);
-}
-
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/src/heap/code-object-registry.h b/deps/v8/src/heap/code-object-registry.h
deleted file mode 100644
index 65f67c66e33192..00000000000000
--- a/deps/v8/src/heap/code-object-registry.h
+++ /dev/null
@@ -1,43 +0,0 @@
-// Copyright 2020 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_HEAP_CODE_OBJECT_REGISTRY_H_
-#define V8_HEAP_CODE_OBJECT_REGISTRY_H_
-
-#include <vector>
-
-#include "src/base/macros.h"
-#include "src/base/platform/mutex.h"
-#include "src/common/globals.h"
-
-namespace v8 {
-namespace internal {
-
-// The CodeObjectRegistry holds all start addresses of code objects of a given
-// MemoryChunk. Each MemoryChunk owns a separate CodeObjectRegistry. The
-// CodeObjectRegistry allows fast lookup from an inner pointer of a code object
-// to the actual code object.
-class V8_EXPORT_PRIVATE CodeObjectRegistry {
- public:
-  void RegisterNewlyAllocatedCodeObject(Address code);
-  void ReinitializeFrom(std::vector<Address>&& code_objects);
-  bool Contains(Address code) const;
-  Address GetCodeObjectStartFromInnerAddress(Address address) const;
-
- private:
-  // A vector of addresses, which may be sorted. This is set to 'mutable' so
-  // that it can be lazily sorted during GetCodeObjectStartFromInnerAddress.
-  mutable std::vector<Address> code_object_registry_;
-  mutable bool is_sorted_ = true;
-  // The mutex has to be recursive because profiler tick might happen while
-  // holding this lock, then the profiler will try to iterate the call stack
-  // which might end up calling GetCodeObjectStartFromInnerAddress() and thus
-  // trying to lock the mutex for a second time.
-  mutable base::RecursiveMutex code_object_registry_mutex_;
-};
-
-}  // namespace internal
-}  // namespace v8
-
-#endif  // V8_HEAP_CODE_OBJECT_REGISTRY_H_
diff --git a/deps/v8/src/heap/code-range.cc b/deps/v8/src/heap/code-range.cc
index 34bf43145813ed..488a38242a5ee8 100644
--- a/deps/v8/src/heap/code-range.cc
+++ b/deps/v8/src/heap/code-range.cc
@@ -233,9 +233,11 @@ bool CodeRange::InitReservation(v8::PageAllocator* page_allocator,
     CHECK_EQ(reserved_area, 0);
     void* base = reinterpret_cast<void*>(page_allocator_->begin());
     size_t size = page_allocator_->size();
-    CHECK(params.page_allocator->SetPermissions(
-        base, size, PageAllocator::kReadWriteExecute));
-    CHECK(params.page_allocator->DiscardSystemPages(base, size));
+    if (!params.page_allocator->SetPermissions(
+            base, size, PageAllocator::kReadWriteExecute)) {
+      return false;
+    }
+    if (!params.page_allocator->DiscardSystemPages(base, size)) return false;
   }
   return true;
 }
@@ -362,7 +364,7 @@ uint8_t* CodeRange::RemapEmbeddedBuiltins(Isolate* isolate,
   embedded_blob_code_copy =
       reinterpret_cast<uint8_t*>(page_allocator()->AllocatePages(
           hint, allocate_code_size, kAllocatePageSize,
-          PageAllocator::kNoAccess));
+          PageAllocator::kNoAccessWillJitLater));
 
   if (!embedded_blob_code_copy) {
     V8::FatalProcessOutOfMemory(
diff --git a/deps/v8/src/heap/code-stats.cc b/deps/v8/src/heap/code-stats.cc
index 66d1791c2623f4..f016c695f0e0fb 100644
--- a/deps/v8/src/heap/code-stats.cc
+++ b/deps/v8/src/heap/code-stats.cc
@@ -15,24 +15,25 @@ namespace v8 {
 namespace internal {
 
 // Record code statistics.
-void CodeStatistics::RecordCodeAndMetadataStatistics(HeapObject object,
+void CodeStatistics::RecordCodeAndMetadataStatistics(Tagged<HeapObject> object,
                                                      Isolate* isolate) {
   PtrComprCageBase cage_base(isolate);
-  if (object.IsScript(cage_base)) {
-    Script script = Script::cast(object);
+  if (IsScript(object, cage_base)) {
+    Tagged<Script> script = Script::cast(object);
     // Log the size of external source code.
-    Object source = script.source(cage_base);
-    if (source.IsExternalString(cage_base)) {
-      ExternalString external_source_string = ExternalString::cast(source);
+    Tagged<Object> source = script->source(cage_base);
+    if (IsExternalString(source, cage_base)) {
+      Tagged<ExternalString> external_source_string =
+          ExternalString::cast(source);
       int size = isolate->external_script_source_size();
-      size += external_source_string.ExternalPayloadSize();
+      size += external_source_string->ExternalPayloadSize();
       isolate->set_external_script_source_size(size);
     }
-  } else if (object.IsAbstractCode(cage_base)) {
+  } else if (IsAbstractCode(object, cage_base)) {
     // Record code+metadata statistics.
-    AbstractCode abstract_code = AbstractCode::cast(object);
-    int size = abstract_code.SizeIncludingMetadata(cage_base);
-    if (abstract_code.IsCode(cage_base)) {
+    Tagged<AbstractCode> abstract_code = AbstractCode::cast(object);
+    int size = abstract_code->SizeIncludingMetadata(cage_base);
+    if (IsCode(abstract_code, cage_base)) {
       size += isolate->code_and_metadata_size();
       isolate->set_code_and_metadata_size(size);
     } else {
@@ -42,9 +43,9 @@ void CodeStatistics::RecordCodeAndMetadataStatistics(HeapObject object,
 
 #ifdef DEBUG
     // Record code kind and code comment statistics.
-    CodeKind code_kind = abstract_code.kind(cage_base);
+    CodeKind code_kind = abstract_code->kind(cage_base);
     isolate->code_kind_statistics()[static_cast<int>(code_kind)] +=
-        abstract_code.Size(cage_base);
+        abstract_code->Size(cage_base);
     CodeStatistics::CollectCodeCommentStatistics(abstract_code, isolate);
 #endif
   }
@@ -197,22 +198,19 @@ void CodeStatistics::CollectCommentStatistics(Isolate* isolate,
 }
 
 // Collects code comment statistics.
-void CodeStatistics::CollectCodeCommentStatistics(AbstractCode obj,
+void CodeStatistics::CollectCodeCommentStatistics(Tagged<AbstractCode> obj,
                                                   Isolate* isolate) {
   // Bytecode objects do not contain RelocInfo.
   PtrComprCageBase cage_base{isolate};
-  if (!obj.IsCode(cage_base)) return;
+  if (!IsCode(obj, cage_base)) return;
 
   Code code = Code::cast(obj);
 
   // Off-heap builtins might contain comments but they are a part of binary so
   // it doesn't make sense to account them in the stats.
-  // TODO(jgruber): We can change this to `IsBuiltin` once it's guaranteed that
-  // non-builtin Code objects have an instruction_stream at all times (even
-  // during initialization).
-  if (!obj.has_instruction_stream(cage_base)) return;
+  if (!code->has_instruction_stream()) return;
 
-  CodeCommentsIterator cit(code.code_comments(), code.code_comments_size());
+  CodeCommentsIterator cit(code->code_comments(), code->code_comments_size());
   int delta = 0;
   int prev_pc_offset = 0;
   while (cit.HasCurrent()) {
@@ -222,8 +220,8 @@ void CodeStatistics::CollectCodeCommentStatistics(AbstractCode obj,
     cit.Next();
   }
 
-  DCHECK(0 <= prev_pc_offset && prev_pc_offset <= code.InstructionSize());
-  delta += static_cast<int>(code.InstructionSize() - prev_pc_offset);
+  DCHECK(0 <= prev_pc_offset && prev_pc_offset <= code->instruction_size());
+  delta += static_cast<int>(code->instruction_size() - prev_pc_offset);
   EnterComment(isolate, "NoComment", delta);
 }
 #endif
diff --git a/deps/v8/src/heap/code-stats.h b/deps/v8/src/heap/code-stats.h
index 90c0fff4b8caf6..66958b50e9ba8e 100644
--- a/deps/v8/src/heap/code-stats.h
+++ b/deps/v8/src/heap/code-stats.h
@@ -14,6 +14,8 @@ class HeapObject;
 class Isolate;
 class OldLargeObjectSpace;
 class PagedSpace;
+template <typename T>
+class Tagged;
 
 class CodeStatistics {
  public:
@@ -33,13 +35,14 @@ class CodeStatistics {
 #endif
 
  private:
-  static void RecordCodeAndMetadataStatistics(HeapObject object,
+  static void RecordCodeAndMetadataStatistics(Tagged<HeapObject> object,
                                               Isolate* isolate);
 
 #ifdef DEBUG
   static void CollectCommentStatistics(Isolate* isolate,
                                        CodeCommentsIterator* it);
-  static void CollectCodeCommentStatistics(AbstractCode obj, Isolate* isolate);
+  static void CollectCodeCommentStatistics(Tagged<AbstractCode> obj,
+                                           Isolate* isolate);
   static void EnterComment(Isolate* isolate, const char* comment, int delta);
   static void ResetCodeStatistics(Isolate* isolate);
 #endif
diff --git a/deps/v8/src/heap/collection-barrier.cc b/deps/v8/src/heap/collection-barrier.cc
index 9486c234b0f9db..1bc9a972fab5a3 100644
--- a/deps/v8/src/heap/collection-barrier.cc
+++ b/deps/v8/src/heap/collection-barrier.cc
@@ -11,12 +11,16 @@
 #include "src/handles/handles.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap.h"
-#include "src/heap/local-heap.h"
+#include "src/heap/local-heap-inl.h"
 #include "src/heap/parked-scope.h"
 
 namespace v8 {
 namespace internal {
 
+CollectionBarrier::CollectionBarrier(
+    Heap* heap, std::shared_ptr<v8::TaskRunner> foreground_task_runner)
+    : heap_(heap), foreground_task_runner_(foreground_task_runner) {}
+
 bool CollectionBarrier::WasGCRequested() {
   return collection_requested_.load();
 }
@@ -95,28 +99,32 @@ bool CollectionBarrier::AwaitCollectionBackground(LocalHeap* local_heap) {
   }
 
   // The first thread needs to activate the stack guard and post the task.
-  if (first_thread) ActivateStackGuardAndPostTask();
-
-  ParkedScope scope(local_heap);
-  base::MutexGuard guard(&mutex_);
+  if (first_thread) {
+    Isolate* isolate = heap_->isolate();
+    ExecutionAccess access(isolate);
+    isolate->stack_guard()->RequestGC();
 
-  while (block_for_collection_) {
-    if (shutdown_requested_) return false;
-    cv_wakeup_.Wait(&mutex_);
+    foreground_task_runner_->PostTask(
+        std::make_unique<BackgroundCollectionInterruptTask>(heap_));
   }
 
-  // Collection may have been cancelled while blocking for it.
-  return collection_performed_;
-}
+  bool collection_performed = false;
+  local_heap->BlockWhileParked([this, &collection_performed]() {
+    base::MutexGuard guard(&mutex_);
+
+    while (block_for_collection_) {
+      if (shutdown_requested_) {
+        collection_performed = false;
+        return;
+      }
+      cv_wakeup_.Wait(&mutex_);
+    }
 
-void CollectionBarrier::ActivateStackGuardAndPostTask() {
-  Isolate* isolate = heap_->isolate();
-  ExecutionAccess access(isolate);
-  isolate->stack_guard()->RequestGC();
+    // Collection may have been cancelled while blocking for it.
+    collection_performed = collection_performed_;
+  });
 
-  V8::GetCurrentPlatform()
-      ->GetForegroundTaskRunner(reinterpret_cast<v8::Isolate*>(isolate))
-      ->PostTask(std::make_unique<BackgroundCollectionInterruptTask>(heap_));
+  return collection_performed;
 }
 
 void CollectionBarrier::StopTimeToCollectionTimer() {
diff --git a/deps/v8/src/heap/collection-barrier.h b/deps/v8/src/heap/collection-barrier.h
index fd894324a6fca8..f77a6f3cfa79d4 100644
--- a/deps/v8/src/heap/collection-barrier.h
+++ b/deps/v8/src/heap/collection-barrier.h
@@ -22,7 +22,8 @@ class Heap;
 // This class stops and resumes all background threads waiting for GC.
 class CollectionBarrier {
  public:
-  explicit CollectionBarrier(Heap* heap) : heap_(heap) {}
+  CollectionBarrier(
+      Heap* heap, std::shared_ptr<v8::TaskRunner> foreground_task_runner);
 
   // Returns true when collection was requested.
   bool WasGCRequested();
@@ -49,9 +50,6 @@ class CollectionBarrier {
   bool AwaitCollectionBackground(LocalHeap* local_heap);
 
  private:
-  // Activate stack guards and posting a task to perform the GC.
-  void ActivateStackGuardAndPostTask();
-
   Heap* heap_;
   base::Mutex mutex_;
   base::ConditionVariable cv_wakeup_;
@@ -72,6 +70,9 @@ class CollectionBarrier {
 
   // Will be set as soon as Isolate starts tear down.
   bool shutdown_requested_ = false;
+
+  // Used to post tasks on the main thread.
+  std::shared_ptr<v8::TaskRunner> foreground_task_runner_;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/combined-heap.cc b/deps/v8/src/heap/combined-heap.cc
index 0416bb62a42926..9c5bb152b86e99 100644
--- a/deps/v8/src/heap/combined-heap.cc
+++ b/deps/v8/src/heap/combined-heap.cc
@@ -13,8 +13,8 @@ CombinedHeapObjectIterator::CombinedHeapObjectIterator(
     : heap_iterator_(heap, filtering),
       ro_heap_iterator_(heap->isolate()->read_only_heap()) {}
 
-HeapObject CombinedHeapObjectIterator::Next() {
-  HeapObject object = ro_heap_iterator_.Next();
+Tagged<HeapObject> CombinedHeapObjectIterator::Next() {
+  Tagged<HeapObject> object = ro_heap_iterator_.Next();
   if (!object.is_null()) {
     return object;
   }
diff --git a/deps/v8/src/heap/combined-heap.h b/deps/v8/src/heap/combined-heap.h
index b8627686a20447..655f90979a58cf 100644
--- a/deps/v8/src/heap/combined-heap.h
+++ b/deps/v8/src/heap/combined-heap.h
@@ -16,14 +16,13 @@ namespace internal {
 
 // This class allows iteration over the entire heap (Heap and ReadOnlyHeap). It
 // uses the HeapObjectIterator to iterate over non-read-only objects and accepts
-// the same filtering option. (Interrupting iteration while filtering
-// unreachable objects is still forbidden)
+// the same filtering option.
 class V8_EXPORT_PRIVATE CombinedHeapObjectIterator final {
  public:
   CombinedHeapObjectIterator(
       Heap* heap, HeapObjectIterator::HeapObjectsFiltering filtering =
                       HeapObjectIterator::HeapObjectsFiltering::kNoFiltering);
-  HeapObject Next();
+  Tagged<HeapObject> Next();
 
  private:
   HeapObjectIterator heap_iterator_;
@@ -31,7 +30,7 @@ class V8_EXPORT_PRIVATE CombinedHeapObjectIterator final {
 };
 
 V8_WARN_UNUSED_RESULT inline bool IsValidHeapObject(Heap* heap,
-                                                    HeapObject object) {
+                                                    Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
     return third_party_heap::Heap::IsValidHeapObject(object);
   }
@@ -40,7 +39,7 @@ V8_WARN_UNUSED_RESULT inline bool IsValidHeapObject(Heap* heap,
 }
 
 V8_WARN_UNUSED_RESULT inline bool IsValidCodeObject(Heap* heap,
-                                                    HeapObject object) {
+                                                    Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
     return third_party_heap::Heap::IsValidCodeObject(object);
   }
diff --git a/deps/v8/src/heap/concurrent-allocator-inl.h b/deps/v8/src/heap/concurrent-allocator-inl.h
index 9b9ab114e685b7..5328899ce392b5 100644
--- a/deps/v8/src/heap/concurrent-allocator-inl.h
+++ b/deps/v8/src/heap/concurrent-allocator-inl.h
@@ -52,7 +52,8 @@ AllocationResult ConcurrentAllocator::AllocateInLabFastUnaligned(
     return AllocationResult::Failure();
   }
 
-  HeapObject object = HeapObject::FromAddress(lab_.IncrementTop(size_in_bytes));
+  Tagged<HeapObject> object =
+      HeapObject::FromAddress(lab_.IncrementTop(size_in_bytes));
   return AllocationResult::FromObject(object);
 }
 
@@ -67,10 +68,11 @@ AllocationResult ConcurrentAllocator::AllocateInLabFastAligned(
     return AllocationResult::Failure();
   }
 
-  HeapObject object = HeapObject::FromAddress(lab_.IncrementTop(aligned_size));
+  Tagged<HeapObject> object =
+      HeapObject::FromAddress(lab_.IncrementTop(aligned_size));
 
   if (filler_size > 0) {
-    object = owning_heap()->PrecedeWithFiller(object, filler_size);
+    object = owning_heap()->PrecedeWithFillerBackground(object, filler_size);
   }
 
   return AllocationResult::FromObject(object);
diff --git a/deps/v8/src/heap/concurrent-allocator.cc b/deps/v8/src/heap/concurrent-allocator.cc
index fac728b4542076..20302ce70ef29d 100644
--- a/deps/v8/src/heap/concurrent-allocator.cc
+++ b/deps/v8/src/heap/concurrent-allocator.cc
@@ -89,28 +89,31 @@ ConcurrentAllocator::ConcurrentAllocator(LocalHeap* local_heap,
 }
 
 void ConcurrentAllocator::FreeLinearAllocationArea() {
-  // The code page of the linear allocation area needs to be unprotected
-  // because we are going to write a filler into that memory area below.
-  base::Optional<CodePageMemoryModificationScope> optional_scope;
-  if (IsLabValid() && space_->identity() == CODE_SPACE) {
-    optional_scope.emplace(MemoryChunk::FromAddress(lab_.top()));
-  }
-  if (lab_.top() != lab_.limit() && IsBlackAllocationEnabled()) {
-    Page::FromAddress(lab_.top())
-        ->DestroyBlackAreaBackground(lab_.top(), lab_.limit());
+  if (IsLabValid() && lab_.top() != lab_.limit()) {
+    base::Optional<CodePageHeaderModificationScope> optional_scope;
+    if (space_->identity() == CODE_SPACE) {
+      optional_scope.emplace("Clears marking bitmap in the page header.");
+    }
+
+    Page* page = Page::FromAddress(lab_.top());
+
+    if (IsBlackAllocationEnabled()) {
+      page->DestroyBlackArea(lab_.top(), lab_.limit());
+    }
+
+    // When starting incremental marking free lists are dropped for evacuation
+    // candidates. So for evacuation candidates we just make the free memory
+    // iterable.
+    CHECK(!page->IsEvacuationCandidate());
+    base::MutexGuard guard(space_->mutex());
+    space_->Free(lab_.top(), lab_.limit() - lab_.top(),
+                 SpaceAccountingMode::kSpaceAccounted);
   }
 
-  MakeLabIterable();
   ResetLab();
 }
 
 void ConcurrentAllocator::MakeLinearAllocationAreaIterable() {
-  // The code page of the linear allocation area needs to be unprotected
-  // because we are going to write a filler into that memory area below.
-  base::Optional<CodePageMemoryModificationScope> optional_scope;
-  if (IsLabValid() && space_->identity() == CODE_SPACE) {
-    optional_scope.emplace(MemoryChunk::FromAddress(lab_.top()));
-  }
   MakeLabIterable();
 }
 
@@ -125,7 +128,7 @@ void ConcurrentAllocator::MarkLinearAllocationAreaBlack() {
           "Marking InstructionStream objects requires write access to the "
           "Code page header");
     }
-    Page::FromAllocationAreaAddress(top)->CreateBlackAreaBackground(top, limit);
+    Page::FromAllocationAreaAddress(top)->CreateBlackArea(top, limit);
   }
 }
 
@@ -140,8 +143,7 @@ void ConcurrentAllocator::UnmarkLinearAllocationArea() {
           "Marking InstructionStream objects requires write access to the "
           "Code page header");
     }
-    Page::FromAllocationAreaAddress(top)->DestroyBlackAreaBackground(top,
-                                                                     limit);
+    Page::FromAllocationAreaAddress(top)->DestroyBlackArea(top, limit);
   }
 }
 
@@ -172,7 +174,7 @@ bool ConcurrentAllocator::AllocateLab(AllocationOrigin origin) {
   if (IsBlackAllocationEnabled()) {
     Address top = lab_.top();
     Address limit = lab_.limit();
-    Page::FromAllocationAreaAddress(top)->CreateBlackAreaBackground(top, limit);
+    Page::FromAllocationAreaAddress(top)->CreateBlackArea(top, limit);
   }
 
   return true;
@@ -194,14 +196,17 @@ ConcurrentAllocator::AllocateFromSpaceFreeList(size_t min_size_in_bytes,
                                                   max_size_in_bytes, origin);
   if (result) return result;
 
+  uint64_t trace_flow_id = owning_heap()->sweeper()->GetTraceIdForFlowEvent(
+      GCTracer::Scope::MC_BACKGROUND_SWEEPING);
   // Sweeping is still in progress.
   if (owning_heap()->sweeping_in_progress()) {
     // First try to refill the free-list, concurrent sweeper threads
     // may have freed some objects in the meantime.
     {
-      TRACE_GC_EPOCH(owning_heap()->tracer(),
-                     GCTracer::Scope::MC_BACKGROUND_SWEEPING,
-                     ThreadKind::kBackground);
+      TRACE_GC_EPOCH_WITH_FLOW(
+          owning_heap()->tracer(), GCTracer::Scope::MC_BACKGROUND_SWEEPING,
+          ThreadKind::kBackground, trace_flow_id,
+          TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
       space_->RefillFreeList();
     }
 
@@ -210,40 +215,43 @@ ConcurrentAllocator::AllocateFromSpaceFreeList(size_t min_size_in_bytes,
         min_size_in_bytes, max_size_in_bytes, origin);
     if (result) return result;
 
-    // Now contribute to sweeping from background thread and then try to
-    // reallocate.
-    int max_freed;
-    {
-      TRACE_GC_EPOCH(owning_heap()->tracer(),
-                     GCTracer::Scope::MC_BACKGROUND_SWEEPING,
-                     ThreadKind::kBackground);
-      const int kMaxPagesToSweep = 1;
-      max_freed = owning_heap()->sweeper()->ParallelSweepSpace(
-          space_->identity(), Sweeper::SweepingMode::kLazyOrConcurrent,
-          static_cast<int>(min_size_in_bytes), kMaxPagesToSweep);
-      space_->RefillFreeList();
-    }
-
-    if (static_cast<size_t>(max_freed) >= min_size_in_bytes) {
-      result = space_->TryAllocationFromFreeListBackground(
-          min_size_in_bytes, max_size_in_bytes, origin);
-      if (result) return result;
+    if (owning_heap()->major_sweeping_in_progress()) {
+      // Now contribute to sweeping from background thread and then try to
+      // reallocate.
+      int max_freed;
+      {
+        TRACE_GC_EPOCH_WITH_FLOW(
+            owning_heap()->tracer(), GCTracer::Scope::MC_BACKGROUND_SWEEPING,
+            ThreadKind::kBackground, trace_flow_id,
+            TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
+        const int kMaxPagesToSweep = 1;
+        max_freed = owning_heap()->sweeper()->ParallelSweepSpace(
+            space_->identity(), Sweeper::SweepingMode::kLazyOrConcurrent,
+            static_cast<int>(min_size_in_bytes), kMaxPagesToSweep);
+        space_->RefillFreeList();
+      }
+
+      if (static_cast<size_t>(max_freed) >= min_size_in_bytes) {
+        result = space_->TryAllocationFromFreeListBackground(
+            min_size_in_bytes, max_size_in_bytes, origin);
+        if (result) return result;
+      }
     }
   }
 
   if (owning_heap()->ShouldExpandOldGenerationOnSlowAllocation(local_heap_,
                                                                origin) &&
-      owning_heap()->CanExpandOldGenerationBackground(local_heap_,
-                                                      space_->AreaSize())) {
+      owning_heap()->CanExpandOldGeneration(space_->AreaSize())) {
     result = space_->TryExpandBackground(max_size_in_bytes);
     if (result) return result;
   }
 
-  if (owning_heap()->sweeping_in_progress()) {
+  if (owning_heap()->major_sweeping_in_progress()) {
     // Complete sweeping for this space.
-    TRACE_GC_EPOCH(owning_heap()->tracer(),
-                   GCTracer::Scope::MC_BACKGROUND_SWEEPING,
-                   ThreadKind::kBackground);
+    TRACE_GC_EPOCH_WITH_FLOW(
+        owning_heap()->tracer(), GCTracer::Scope::MC_BACKGROUND_SWEEPING,
+        ThreadKind::kBackground, trace_flow_id,
+        TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
     owning_heap()->DrainSweepingWorklistForSpace(space_->identity());
 
     space_->RefillFreeList();
@@ -270,9 +278,9 @@ AllocationResult ConcurrentAllocator::AllocateOutsideLab(
 
   DCHECK_GE(result->second, aligned_size_in_bytes);
 
-  HeapObject object = HeapObject::FromAddress(result->first);
+  Tagged<HeapObject> object = HeapObject::FromAddress(result->first);
   if (requested_filler_size > 0) {
-    object = owning_heap()->AlignWithFiller(
+    object = owning_heap()->AlignWithFillerBackground(
         object, size_in_bytes, static_cast<int>(result->second), alignment);
   }
 
diff --git a/deps/v8/src/heap/concurrent-marking.cc b/deps/v8/src/heap/concurrent-marking.cc
index bb9f1ae91721f0..14cf52df6e9b8a 100644
--- a/deps/v8/src/heap/concurrent-marking.cc
+++ b/deps/v8/src/heap/concurrent-marking.cc
@@ -4,12 +4,16 @@
 
 #include "src/heap/concurrent-marking.h"
 
+#include <algorithm>
 #include <stack>
 #include <unordered_map>
 
 #include "include/v8config.h"
+#include "src/base/logging.h"
 #include "src/common/globals.h"
 #include "src/execution/isolate.h"
+#include "src/flags/flags.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/gc-tracer-inl.h"
 #include "src/heap/gc-tracer.h"
 #include "src/heap/heap-inl.h"
@@ -23,14 +27,19 @@
 #include "src/heap/memory-chunk.h"
 #include "src/heap/memory-measurement-inl.h"
 #include "src/heap/memory-measurement.h"
+#include "src/heap/minor-mark-sweep-inl.h"
+#include "src/heap/minor-mark-sweep.h"
 #include "src/heap/object-lock.h"
 #include "src/heap/objects-visiting-inl.h"
 #include "src/heap/objects-visiting.h"
+#include "src/heap/pretenuring-handler.h"
 #include "src/heap/weak-object-worklists.h"
+#include "src/heap/young-generation-marking-visitor.h"
 #include "src/init/v8.h"
 #include "src/objects/data-handler-inl.h"
 #include "src/objects/embedder-data-array-inl.h"
 #include "src/objects/hash-table-inl.h"
+#include "src/objects/heap-object.h"
 #include "src/objects/js-array-buffer-inl.h"
 #include "src/objects/slots-inl.h"
 #include "src/objects/transitions-inl.h"
@@ -38,208 +47,67 @@
 #include "src/utils/utils-inl.h"
 #include "src/utils/utils.h"
 
-// These strings can be sources of safe string transitions. Transitions are safe
-// if they don't result in invalidated slots. It's safe to read the length field
-// on such strings as that's common for all.
-//
-// No special visitors are generated for such strings.
-// V(VisitorId, Typename)
-#define SAFE_STRING_TRANSITION_SOURCES(V) \
-  V(SeqOneByteString, SeqOneByteString)   \
-  V(SeqTwoByteString, SeqTwoByteString)
-
-// These strings can be sources of unsafe string transitions.
-// V(VisitorId, TypeName)
-#define UNSAFE_STRING_TRANSITION_SOURCES(V) \
-  V(ExternalString, ExternalString)         \
-  V(ConsString, ConsString)                 \
-  V(SlicedString, SlicedString)
-
-// V(VisitorId, TypeName)
-#define UNSAFE_STRING_TRANSITION_TARGETS(V) \
-  UNSAFE_STRING_TRANSITION_SOURCES(V)       \
-  V(ShortcutCandidate, ConsString)          \
-  V(ThinString, ThinString)
-
 namespace v8 {
 namespace internal {
 
-class ConcurrentMarkingState final
-    : public MarkingStateBase<ConcurrentMarkingState, AccessMode::ATOMIC> {
- public:
-  ConcurrentMarkingState(PtrComprCageBase cage_base,
-                         MemoryChunkDataMap* memory_chunk_data)
-      : MarkingStateBase(cage_base), memory_chunk_data_(memory_chunk_data) {}
-
-  ConcurrentBitmap<AccessMode::ATOMIC>* bitmap(
-      const BasicMemoryChunk* chunk) const {
-    return chunk->marking_bitmap<AccessMode::ATOMIC>();
-  }
-
-  void IncrementLiveBytes(MemoryChunk* chunk, intptr_t by) {
-    DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
-                   IsAligned(by, kObjectAlignment8GbHeap));
-    (*memory_chunk_data_)[chunk].live_bytes += by;
-  }
-
-  // The live_bytes and SetLiveBytes methods of the marking state are
-  // not used by the concurrent marker.
-
- private:
-  MemoryChunkDataMap* memory_chunk_data_;
-};
-
-class ConcurrentMarkingVisitorUtility {
- public:
-  template <typename Visitor, typename T>
-  static int VisitStringLocked(Visitor* visitor, T object) {
-    SharedObjectLockGuard guard(object);
-    CHECK(visitor->ShouldVisit(object));
-    visitor->VisitMapPointerIfNeeded(object);
-    // The object has been locked. At this point exclusive access is guaranteed
-    // but we must re-read the map and check whether the string has
-    // transitioned.
-    Map map = object.map();
-    int size;
-    switch (map.visitor_id()) {
-#define UNSAFE_STRING_TRANSITION_TARGET_CASE(VisitorId, TypeName) \
-  case kVisit##VisitorId:                                         \
-    size = TypeName::BodyDescriptor::SizeOf(map, object);         \
-    TypeName::BodyDescriptor::IterateBody(                        \
-        map, TypeName::unchecked_cast(object), size, visitor);    \
-    break;
-
-      UNSAFE_STRING_TRANSITION_TARGETS(UNSAFE_STRING_TRANSITION_TARGET_CASE)
-#undef UNSAFE_STRING_TRANSITION_TARGET_CASE
-      default:
-        UNREACHABLE();
-    }
-    return size;
-  }
-};
-
-class YoungGenerationConcurrentMarkingVisitor final
-    : public YoungGenerationMarkingVisitorBase<
-          YoungGenerationConcurrentMarkingVisitor, ConcurrentMarkingState> {
- public:
-  YoungGenerationConcurrentMarkingVisitor(
-      Heap* heap, MarkingWorklists::Local* worklists_local,
-      MemoryChunkDataMap* memory_chunk_data)
-      : YoungGenerationMarkingVisitorBase<
-            YoungGenerationConcurrentMarkingVisitor, ConcurrentMarkingState>(
-            heap->isolate(), worklists_local),
-        marking_state_(heap->isolate(), memory_chunk_data) {}
-
-  using YoungGenerationMarkingVisitorBase<
-      YoungGenerationConcurrentMarkingVisitor,
-      ConcurrentMarkingState>::VisitMapPointerIfNeeded;
-
-  template <typename T>
-  static V8_INLINE T Cast(HeapObject object) {
-    return T::cast(object);
-  }
-
-  bool ShouldVisit(HeapObject object) {
-    CHECK(marking_state_.GreyToBlack(object));
-    return true;
-  }
-
-#define VISIT_AS_LOCKED_STRING(VisitorId, TypeName)                          \
-  int Visit##TypeName(Map map, TypeName object) {                            \
-    return ConcurrentMarkingVisitorUtility::VisitStringLocked(this, object); \
-  }
-  UNSAFE_STRING_TRANSITION_SOURCES(VISIT_AS_LOCKED_STRING)
-#undef VISIT_AS_LOCKED_STRING
-
-  void VisitMapPointer(HeapObject host) final { UNREACHABLE(); }
-
-  template <typename TSlot>
-  void RecordSlot(HeapObject object, TSlot slot, HeapObject target) {}
-
-  ConcurrentMarkingState* marking_state() { return &marking_state_; }
-
- private:
-  ConcurrentMarkingState marking_state_;
-};
-
-#define UNCHECKED_CAST(VisitorId, TypeName)                                   \
-  template <>                                                                 \
-  TypeName YoungGenerationConcurrentMarkingVisitor::Cast(HeapObject object) { \
-    return TypeName::unchecked_cast(object);                                  \
-  }
-SAFE_STRING_TRANSITION_SOURCES(UNCHECKED_CAST)
-// Casts are also needed for unsafe ones for the initial dispatch in
-// HeapVisitor.
-UNSAFE_STRING_TRANSITION_SOURCES(UNCHECKED_CAST)
-#undef UNCHECKED_CAST
-
 class ConcurrentMarkingVisitor final
-    : public MarkingVisitorBase<ConcurrentMarkingVisitor,
-                                ConcurrentMarkingState> {
+    : public FullMarkingVisitorBase<ConcurrentMarkingVisitor> {
  public:
-  ConcurrentMarkingVisitor(int task_id,
-                           MarkingWorklists::Local* local_marking_worklists,
+  ConcurrentMarkingVisitor(MarkingWorklists::Local* local_marking_worklists,
                            WeakObjects::Local* local_weak_objects, Heap* heap,
                            unsigned mark_compact_epoch,
                            base::EnumSet<CodeFlushMode> code_flush_mode,
                            bool embedder_tracing_enabled,
                            bool should_keep_ages_unchanged,
+                           uint16_t code_flushing_increase,
                            MemoryChunkDataMap* memory_chunk_data)
-      : MarkingVisitorBase(local_marking_worklists, local_weak_objects, heap,
-                           mark_compact_epoch, code_flush_mode,
-                           embedder_tracing_enabled,
-                           should_keep_ages_unchanged),
-        marking_state_(heap->isolate(), memory_chunk_data),
+      : FullMarkingVisitorBase(
+            local_marking_worklists, local_weak_objects, heap,
+            mark_compact_epoch, code_flush_mode, embedder_tracing_enabled,
+            should_keep_ages_unchanged, code_flushing_increase),
         memory_chunk_data_(memory_chunk_data) {}
 
-  using MarkingVisitorBase<ConcurrentMarkingVisitor,
-                           ConcurrentMarkingState>::VisitMapPointerIfNeeded;
-
-  template <typename T>
-  static V8_INLINE T Cast(HeapObject object) {
-    return T::cast(object);
-  }
+  using FullMarkingVisitorBase<
+      ConcurrentMarkingVisitor>::VisitMapPointerIfNeeded;
 
-  bool ShouldVisit(HeapObject object) {
-    CHECK(marking_state_.GreyToBlack(object));
-    return true;
-  }
-
-#define VISIT_AS_LOCKED_STRING(VisitorId, TypeName)                          \
-  int Visit##TypeName(Map map, TypeName object) {                            \
-    return ConcurrentMarkingVisitorUtility::VisitStringLocked(this, object); \
-  }
-  UNSAFE_STRING_TRANSITION_SOURCES(VISIT_AS_LOCKED_STRING)
-#undef VISIT_AS_LOCKED_STRING
+  static constexpr bool EnableConcurrentVisitation() { return true; }
 
   // Implements ephemeron semantics: Marks value if key is already reachable.
   // Returns true if value was actually marked.
-  bool ProcessEphemeron(HeapObject key, HeapObject value) {
-    if (marking_state_.IsBlackOrGrey(key)) {
-      if (marking_state_.TryMark(value)) {
+  bool ProcessEphemeron(Tagged<HeapObject> key, Tagged<HeapObject> value) {
+    if (IsMarked(key)) {
+      if (TryMark(value)) {
         local_marking_worklists_->Push(value);
         return true;
       }
 
-    } else if (marking_state_.IsUnmarked(value)) {
+    } else if (IsUnmarked(value)) {
       local_weak_objects_->next_ephemerons_local.Push(Ephemeron{key, value});
     }
     return false;
   }
 
   template <typename TSlot>
-  void RecordSlot(HeapObject object, TSlot slot, HeapObject target) {
+  void RecordSlot(Tagged<HeapObject> object, TSlot slot,
+                  Tagged<HeapObject> target) {
     MarkCompactCollector::RecordSlot(object, slot, target);
   }
 
-  ConcurrentMarkingState* marking_state() { return &marking_state_; }
+  void IncrementLiveBytesCached(MemoryChunk* chunk, intptr_t by) {
+    DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
+                   IsAligned(by, kObjectAlignment8GbHeap));
+    (*memory_chunk_data_)[chunk].live_bytes += by;
+  }
 
  private:
-  void RecordRelocSlot(RelocInfo* rinfo, HeapObject target) {
-    if (!MarkCompactCollector::ShouldRecordRelocSlot(rinfo, target)) return;
+  void RecordRelocSlot(Tagged<InstructionStream> host, RelocInfo* rinfo,
+                       Tagged<HeapObject> target) {
+    if (!MarkCompactCollector::ShouldRecordRelocSlot(host, rinfo, target)) {
+      return;
+    }
 
     MarkCompactCollector::RecordRelocSlotInfo info =
-        MarkCompactCollector::ProcessRelocInfo(rinfo, target);
+        MarkCompactCollector::ProcessRelocInfo(host, rinfo, target);
 
     MemoryChunkData& data = (*memory_chunk_data_)[info.memory_chunk];
     if (!data.typed_slots) {
@@ -252,30 +120,18 @@ class ConcurrentMarkingVisitor final
     return TraceRetainingPathMode::kDisabled;
   }
 
-  ConcurrentMarkingState marking_state_;
   MemoryChunkDataMap* memory_chunk_data_;
 
-  friend class MarkingVisitorBase<ConcurrentMarkingVisitor,
-                                  ConcurrentMarkingState>;
+  friend class MarkingVisitorBase<ConcurrentMarkingVisitor>;
 };
 
-#define UNCHECKED_CAST(VisitorId, TypeName)                    \
-  template <>                                                  \
-  TypeName ConcurrentMarkingVisitor::Cast(HeapObject object) { \
-    return TypeName::unchecked_cast(object);                   \
-  }
-SAFE_STRING_TRANSITION_SOURCES(UNCHECKED_CAST)
-// Casts are also needed for unsafe ones for the initial dispatch in
-// HeapVisitor.
-UNSAFE_STRING_TRANSITION_SOURCES(UNCHECKED_CAST)
-#undef UNCHECKED_CAST
-
-// The Deserializer changes the map from StrongDescriptorArray to
-// DescriptorArray
-template <>
-StrongDescriptorArray ConcurrentMarkingVisitor::Cast(HeapObject object) {
-  return StrongDescriptorArray::unchecked_cast(DescriptorArray::cast(object));
-}
+struct ConcurrentMarking::TaskState {
+  size_t marked_bytes = 0;
+  MemoryChunkDataMap memory_chunk_data;
+  NativeContextStats native_context_stats;
+  PretenuringHandler::PretenuringFeedbackMap local_pretenuring_feedback{
+      PretenuringHandler::kInitialFeedbackCapacity};
+};
 
 class ConcurrentMarking::JobTaskMajor : public v8::JobTask {
  public:
@@ -286,7 +142,10 @@ class ConcurrentMarking::JobTaskMajor : public v8::JobTask {
       : concurrent_marking_(concurrent_marking),
         mark_compact_epoch_(mark_compact_epoch),
         code_flush_mode_(code_flush_mode),
-        should_keep_ages_unchanged_(should_keep_ages_unchanged) {}
+        should_keep_ages_unchanged_(should_keep_ages_unchanged),
+        trace_id_(reinterpret_cast<uint64_t>(concurrent_marking) ^
+                  concurrent_marking->heap_->tracer()->CurrentEpoch(
+                      GCTracer::Scope::MC_BACKGROUND_MARKING)) {}
 
   ~JobTaskMajor() override = default;
   JobTaskMajor(const JobTaskMajor&) = delete;
@@ -300,9 +159,10 @@ class ConcurrentMarking::JobTaskMajor : public v8::JobTask {
                                     mark_compact_epoch_,
                                     should_keep_ages_unchanged_);
     } else {
-      TRACE_GC_EPOCH(concurrent_marking_->heap_->tracer(),
-                     GCTracer::Scope::MC_BACKGROUND_MARKING,
-                     ThreadKind::kBackground);
+      TRACE_GC_EPOCH_WITH_FLOW(concurrent_marking_->heap_->tracer(),
+                               GCTracer::Scope::MC_BACKGROUND_MARKING,
+                               ThreadKind::kBackground, trace_id_,
+                               TRACE_EVENT_FLAG_FLOW_IN);
       concurrent_marking_->RunMajor(delegate, code_flush_mode_,
                                     mark_compact_epoch_,
                                     should_keep_ages_unchanged_);
@@ -310,20 +170,26 @@ class ConcurrentMarking::JobTaskMajor : public v8::JobTask {
   }
 
   size_t GetMaxConcurrency(size_t worker_count) const override {
-    return concurrent_marking_->GetMaxConcurrency(worker_count);
+    return concurrent_marking_->GetMajorMaxConcurrency(worker_count);
   }
 
+  uint64_t trace_id() const { return trace_id_; }
+
  private:
   ConcurrentMarking* concurrent_marking_;
   const unsigned mark_compact_epoch_;
   base::EnumSet<CodeFlushMode> code_flush_mode_;
   const bool should_keep_ages_unchanged_;
+  const uint64_t trace_id_;
 };
 
 class ConcurrentMarking::JobTaskMinor : public v8::JobTask {
  public:
   explicit JobTaskMinor(ConcurrentMarking* concurrent_marking)
-      : concurrent_marking_(concurrent_marking) {}
+      : concurrent_marking_(concurrent_marking),
+        trace_id_(reinterpret_cast<uint64_t>(concurrent_marking) ^
+                  concurrent_marking->heap_->tracer()->CurrentEpoch(
+                      GCTracer::Scope::MINOR_MS_MARK_PARALLEL)) {}
 
   ~JobTaskMinor() override = default;
   JobTaskMinor(const JobTaskMinor&) = delete;
@@ -332,22 +198,29 @@ class ConcurrentMarking::JobTaskMinor : public v8::JobTask {
   // v8::JobTask overrides.
   void Run(JobDelegate* delegate) override {
     if (delegate->IsJoiningThread()) {
+      TRACE_GC_WITH_FLOW(concurrent_marking_->heap_->tracer(),
+                         GCTracer::Scope::MINOR_MS_MARK_PARALLEL, trace_id_,
+                         TRACE_EVENT_FLAG_FLOW_IN);
       // TRACE_GC is not needed here because the caller opens the right scope.
       concurrent_marking_->RunMinor(delegate);
     } else {
-      TRACE_GC_EPOCH(concurrent_marking_->heap_->tracer(),
-                     GCTracer::Scope::MINOR_MC_BACKGROUND_MARKING,
-                     ThreadKind::kBackground);
+      TRACE_GC_EPOCH_WITH_FLOW(concurrent_marking_->heap_->tracer(),
+                               GCTracer::Scope::MINOR_MS_BACKGROUND_MARKING,
+                               ThreadKind::kBackground, trace_id_,
+                               TRACE_EVENT_FLAG_FLOW_IN);
       concurrent_marking_->RunMinor(delegate);
     }
   }
 
   size_t GetMaxConcurrency(size_t worker_count) const override {
-    return concurrent_marking_->GetMaxConcurrency(worker_count);
+    return concurrent_marking_->GetMinorMaxConcurrency(worker_count);
   }
 
+  uint64_t trace_id() const { return trace_id_; }
+
  private:
   ConcurrentMarking* concurrent_marking_;
+  const uint64_t trace_id_;
 };
 
 ConcurrentMarking::ConcurrentMarking(Heap* heap, WeakObjects* weak_objects)
@@ -369,11 +242,12 @@ ConcurrentMarking::ConcurrentMarking(Heap* heap, WeakObjects* weak_objects)
   }
 }
 
+ConcurrentMarking::~ConcurrentMarking() = default;
+
 void ConcurrentMarking::RunMajor(JobDelegate* delegate,
                                  base::EnumSet<CodeFlushMode> code_flush_mode,
                                  unsigned mark_compact_epoch,
                                  bool should_keep_ages_unchanged) {
-  RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
   size_t kBytesUntilInterruptCheck = 64 * KB;
   int kObjectsUntilInterruptCheck = 1000;
   uint8_t task_id = delegate->GetTaskId() + 1;
@@ -385,11 +259,10 @@ void ConcurrentMarking::RunMajor(JobDelegate* delegate,
                               : MarkingWorklists::Local::kNoCppMarkingState);
   WeakObjects::Local local_weak_objects(weak_objects_);
   ConcurrentMarkingVisitor visitor(
-      task_id, &local_marking_worklists, &local_weak_objects, heap_,
-      mark_compact_epoch, code_flush_mode, heap_->cpp_heap(),
-      should_keep_ages_unchanged, &task_state->memory_chunk_data);
-  NativeContextInferrer& native_context_inferrer =
-      task_state->native_context_inferrer;
+      &local_marking_worklists, &local_weak_objects, heap_, mark_compact_epoch,
+      code_flush_mode, heap_->cpp_heap(), should_keep_ages_unchanged,
+      heap_->tracer()->CodeFlushingIncrease(), &task_state->memory_chunk_data);
+  NativeContextInferrer native_context_inferrer;
   NativeContextStats& native_context_stats = task_state->native_context_stats;
   double time_ms;
   size_t marked_bytes = 0;
@@ -421,12 +294,13 @@ void ConcurrentMarking::RunMajor(JobDelegate* delegate,
       int objects_processed = 0;
       while (current_marked_bytes < kBytesUntilInterruptCheck &&
              objects_processed < kObjectsUntilInterruptCheck) {
-        HeapObject object;
+        Tagged<HeapObject> object;
         if (!local_marking_worklists.Pop(&object)) {
           done = true;
           break;
         }
         DCHECK(!object.InReadOnlySpace());
+        DCHECK_EQ(GetIsolateFromWritableObject(object), isolate);
         objects_processed++;
 
         Address new_space_top = kNullAddress;
@@ -449,7 +323,9 @@ void ConcurrentMarking::RunMajor(JobDelegate* delegate,
             addr == new_large_object) {
           local_marking_worklists.PushOnHold(object);
         } else {
-          Map map = object.map(isolate, kAcquireLoad);
+          Tagged<Map> map = object->map(isolate, kAcquireLoad);
+          // The marking worklist should never contain filler objects.
+          CHECK(!IsFreeSpaceOrFillerMap(map));
           if (is_per_context_mode) {
             Address context;
             if (native_context_inferrer.Infer(isolate, map, object, &context)) {
@@ -457,7 +333,7 @@ void ConcurrentMarking::RunMajor(JobDelegate* delegate,
             }
           }
           const auto visited_size = visitor.Visit(map, object);
-          visitor.marking_state()->IncrementLiveBytes(
+          visitor.IncrementLiveBytesCached(
               MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(object)),
               ALIGN_TO_ALLOCATION_ALIGNMENT(visited_size));
           if (is_per_context_mode) {
@@ -472,8 +348,7 @@ void ConcurrentMarking::RunMajor(JobDelegate* delegate,
       base::AsAtomicWord::Relaxed_Store<size_t>(&task_state->marked_bytes,
                                                 marked_bytes);
       if (delegate->ShouldYield()) {
-        TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-                     "ConcurrentMarking::RunMajor Preempted");
+        TRACE_GC_NOTE("ConcurrentMarking::RunMajor Preempted");
         break;
       }
     }
@@ -501,18 +376,84 @@ void ConcurrentMarking::RunMajor(JobDelegate* delegate,
         "Major task %d concurrently marked %dKB in %.2fms\n", task_id,
         static_cast<int>(marked_bytes / KB), time_ms);
   }
+
+  DCHECK(task_state->local_pretenuring_feedback.empty());
 }
 
+namespace {
+
+V8_INLINE bool IsYoungObjectInLab(Heap* heap, Tagged<HeapObject> heap_object) {
+  // The order of the two loads is important.
+  Address new_space_top = heap->new_space()->original_top_acquire();
+  Address new_space_limit = heap->new_space()->original_limit_relaxed();
+  Address new_large_object = heap->new_lo_space()->pending_object();
+
+  Address addr = heap_object.address();
+
+  return (new_space_top <= addr && addr < new_space_limit) ||
+         addr == new_large_object;
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+V8_INLINE size_t MinorMarkingLoopImpl(
+    Heap* heap, JobDelegate* delegate,
+    PretenuringHandler::PretenuringFeedbackMap* local_pretenuring_feedback) {
+  static constexpr size_t kBytesUntilInterruptCheck = 64 * KB;
+  static constexpr int kObjectsUntilInterruptCheck = 1000;
+  size_t marked_bytes = 0;
+  size_t current_marked_bytes = 0;
+  int objects_processed = 0;
+  YoungGenerationMarkingVisitor<marking_mode> visitor(
+      heap, local_pretenuring_feedback);
+  YoungGenerationRememberedSetsMarkingWorklist::Local remembered_sets(
+      heap->minor_mark_sweep_collector()->remembered_sets_marking_handler());
+  auto& marking_worklists_local = visitor.marking_worklists_local();
+  Isolate* isolate = heap->isolate();
+  do {
+    if (delegate->IsJoiningThread()) {
+      marking_worklists_local.MergeOnHold();
+    }
+    Tagged<HeapObject> heap_object;
+    TRACE_GC_EPOCH(heap->tracer(),
+                   GCTracer::Scope::MINOR_MS_BACKGROUND_MARKING_CLOSURE,
+                   ThreadKind::kBackground);
+    while (marking_worklists_local.Pop(&heap_object)) {
+      if (IsYoungObjectInLab(heap, heap_object)) {
+        visitor.marking_worklists_local().PushOnHold(heap_object);
+      } else {
+        Tagged<Map> map = heap_object->map(isolate);
+        const auto visited_size = visitor.Visit(map, heap_object);
+        if (visited_size) {
+          current_marked_bytes += visited_size;
+          visitor.IncrementLiveBytesCached(
+              MemoryChunk::FromHeapObject(heap_object),
+              ALIGN_TO_ALLOCATION_ALIGNMENT(visited_size));
+        }
+      }
+
+      if (current_marked_bytes >= kBytesUntilInterruptCheck ||
+          ++objects_processed >= kObjectsUntilInterruptCheck) {
+        marked_bytes += current_marked_bytes;
+        if (delegate->ShouldYield()) {
+          TRACE_GC_NOTE("ConcurrentMarking::RunMinor Preempted");
+          return marked_bytes;
+        }
+        objects_processed = 0;
+        current_marked_bytes = 0;
+      }
+    }
+  } while (remembered_sets.ProcessNextItem(&visitor));
+  return marked_bytes + current_marked_bytes;
+}
+
+}  // namespace
+
 void ConcurrentMarking::RunMinor(JobDelegate* delegate) {
-  RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
-  size_t kBytesUntilInterruptCheck = 64 * KB;
-  int kObjectsUntilInterruptCheck = 1000;
+  DCHECK_NOT_NULL(heap_->new_space());
+  DCHECK_NOT_NULL(heap_->new_lo_space());
   uint8_t task_id = delegate->GetTaskId() + 1;
+  DCHECK_LT(task_id, task_state_.size());
   TaskState* task_state = task_state_[task_id].get();
-  MarkingWorklists::Local local_marking_worklists(
-      marking_worklists_, MarkingWorklists::Local::kNoCppMarkingState);
-  YoungGenerationConcurrentMarkingVisitor visitor(
-      heap_, &local_marking_worklists, &task_state->memory_chunk_data);
   double time_ms;
   size_t marked_bytes = 0;
   Isolate* isolate = heap_->isolate();
@@ -523,74 +464,29 @@ void ConcurrentMarking::RunMinor(JobDelegate* delegate) {
 
   {
     TimedScope scope(&time_ms);
-    bool done = false;
-    CodePageHeaderModificationScope rwx_write_scope(
-        "Marking a InstructionStream object requires write access to the "
-        "Code page header");
-    while (!done) {
-      size_t current_marked_bytes = 0;
-      int objects_processed = 0;
-      while (current_marked_bytes < kBytesUntilInterruptCheck &&
-             objects_processed < kObjectsUntilInterruptCheck) {
-        HeapObject object;
-        if (!local_marking_worklists.Pop(&object)) {
-          done = true;
-          break;
-        }
-        objects_processed++;
-
-        Address new_space_top = kNullAddress;
-        Address new_space_limit = kNullAddress;
-        Address new_large_object = kNullAddress;
-
-        if (heap_->new_space()) {
-          // The order of the two loads is important.
-          new_space_top = heap_->new_space()->original_top_acquire();
-          new_space_limit = heap_->new_space()->original_limit_relaxed();
-        }
-
-        if (heap_->new_lo_space()) {
-          new_large_object = heap_->new_lo_space()->pending_object();
-        }
-
-        Address addr = object.address();
-
-        if ((new_space_top <= addr && addr < new_space_limit) ||
-            addr == new_large_object) {
-          local_marking_worklists.PushOnHold(object);
-        } else {
-          Map map = object.map(isolate, kAcquireLoad);
-          const auto visited_size = visitor.Visit(map, object);
-          current_marked_bytes += visited_size;
-          if (visited_size) {
-            visitor.marking_state()->IncrementLiveBytes(
-                MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(object)),
-                ALIGN_TO_ALLOCATION_ALIGNMENT(visited_size));
-          }
-        }
-      }
-      marked_bytes += current_marked_bytes;
-      base::AsAtomicWord::Relaxed_Store<size_t>(&task_state->marked_bytes,
-                                                marked_bytes);
-      if (delegate->ShouldYield()) {
-        TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-                     "ConcurrentMarking::RunMinor Preempted");
-        break;
-      }
+    if (heap_->minor_mark_sweep_collector()->is_in_atomic_pause()) {
+      marked_bytes =
+          MinorMarkingLoopImpl<YoungGenerationMarkingVisitationMode::kParallel>(
+              heap_, delegate, &task_state->local_pretenuring_feedback);
+    } else {
+      marked_bytes = MinorMarkingLoopImpl<
+          YoungGenerationMarkingVisitationMode::kConcurrent>(
+          heap_, delegate, &task_state->local_pretenuring_feedback);
     }
-
-    local_marking_worklists.Publish();
-    base::AsAtomicWord::Relaxed_Store<size_t>(&task_state->marked_bytes, 0);
-    total_marked_bytes_ += marked_bytes;
   }
+
   if (v8_flags.trace_concurrent_marking) {
     heap_->isolate()->PrintWithTimestamp(
         "Minor task %d concurrently marked %dKB in %.2fms\n", task_id,
         static_cast<int>(marked_bytes / KB), time_ms);
   }
+
+  DCHECK(task_state->memory_chunk_data.empty());
+  DCHECK(task_state->native_context_stats.Empty());
+  DCHECK_EQ(0, task_state->marked_bytes);
 }
 
-size_t ConcurrentMarking::GetMaxConcurrency(size_t worker_count) {
+size_t ConcurrentMarking::GetMajorMaxConcurrency(size_t worker_count) {
   size_t marking_items = marking_worklists_->shared()->Size();
   marking_items += marking_worklists_->other()->Size();
   for (auto& worklist : marking_worklists_->context_worklists())
@@ -603,59 +499,123 @@ size_t ConcurrentMarking::GetMaxConcurrency(size_t worker_count) {
                             weak_objects_->current_ephemerons.Size()}));
 }
 
-void ConcurrentMarking::ScheduleJob(GarbageCollector garbage_collector,
-                                    TaskPriority priority) {
+size_t ConcurrentMarking::GetMinorMaxConcurrency(size_t worker_count) {
+  size_t marking_items = marking_worklists_->shared()->Size() +
+                         heap_->minor_mark_sweep_collector()
+                             ->remembered_sets_marking_handler()
+                             ->RemainingRememberedSetsMarkingIteams();
+  DCHECK(marking_worklists_->other()->IsEmpty());
+  DCHECK(!marking_worklists_->IsUsingContextWorklists());
+  return std::min<size_t>(task_state_.size() - 1, worker_count + marking_items);
+}
+
+void ConcurrentMarking::TryScheduleJob(GarbageCollector garbage_collector,
+                                       TaskPriority priority) {
   DCHECK(v8_flags.parallel_marking || v8_flags.concurrent_marking);
   DCHECK(!heap_->IsTearingDown());
   DCHECK(IsStopped());
 
+  if (garbage_collector == GarbageCollector::MARK_COMPACTOR &&
+      !heap_->mark_compact_collector()->UseBackgroundThreadsInCycle()) {
+    return;
+  }
+
+  if (v8_flags.concurrent_marking_high_priority_threads) {
+    priority = TaskPriority::kUserBlocking;
+  }
+
+  DCHECK(
+      std::all_of(task_state_.begin(), task_state_.end(), [](auto& task_state) {
+        return task_state->local_pretenuring_feedback.empty();
+      }));
   garbage_collector_ = garbage_collector;
   if (garbage_collector == GarbageCollector::MARK_COMPACTOR) {
     marking_worklists_ = heap_->mark_compact_collector()->marking_worklists();
-    job_handle_ = V8::GetCurrentPlatform()->PostJob(
-        priority, std::make_unique<JobTaskMajor>(
-                      this, heap_->mark_compact_collector()->epoch(),
-                      heap_->mark_compact_collector()->code_flush_mode(),
-                      heap_->ShouldCurrentGCKeepAgesUnchanged()));
+    auto job = std::make_unique<JobTaskMajor>(
+        this, heap_->mark_compact_collector()->epoch(),
+        heap_->mark_compact_collector()->code_flush_mode(),
+        heap_->ShouldCurrentGCKeepAgesUnchanged());
+    current_job_trace_id_.emplace(job->trace_id());
+    TRACE_GC_NOTE_WITH_FLOW("Major concurrent marking started", job->trace_id(),
+                            TRACE_EVENT_FLAG_FLOW_OUT);
+    job_handle_ = V8::GetCurrentPlatform()->PostJob(priority, std::move(job));
   } else {
-    DCHECK(garbage_collector == GarbageCollector::MINOR_MARK_COMPACTOR);
+    DCHECK(garbage_collector == GarbageCollector::MINOR_MARK_SWEEPER);
     marking_worklists_ =
-        heap_->minor_mark_compact_collector()->marking_worklists();
-    job_handle_ = V8::GetCurrentPlatform()->PostJob(
-        priority, std::make_unique<JobTaskMinor>(this));
+        heap_->minor_mark_sweep_collector()->marking_worklists();
+    auto job = std::make_unique<JobTaskMinor>(this);
+    current_job_trace_id_.emplace(job->trace_id());
+    TRACE_GC_NOTE_WITH_FLOW("Minor concurrent marking started", job->trace_id(),
+                            TRACE_EVENT_FLAG_FLOW_OUT);
+    job_handle_ = V8::GetCurrentPlatform()->PostJob(priority, std::move(job));
   }
   DCHECK(job_handle_->IsValid());
 }
 
-bool ConcurrentMarking::IsWorkLeft() {
+bool ConcurrentMarking::IsWorkLeft() const {
+  DCHECK(garbage_collector_.has_value());
+  if (garbage_collector_ == GarbageCollector::MARK_COMPACTOR) {
+    return !marking_worklists_->shared()->IsEmpty() ||
+           !weak_objects_->current_ephemerons.IsEmpty() ||
+           !weak_objects_->discovered_ephemerons.IsEmpty();
+  }
+  DCHECK_EQ(GarbageCollector::MINOR_MARK_SWEEPER, garbage_collector_);
   return !marking_worklists_->shared()->IsEmpty() ||
-         !weak_objects_->current_ephemerons.IsEmpty() ||
-         !weak_objects_->discovered_ephemerons.IsEmpty();
+         (heap_->minor_mark_sweep_collector()
+              ->remembered_sets_marking_handler()
+              ->RemainingRememberedSetsMarkingIteams() > 0);
 }
 
 void ConcurrentMarking::RescheduleJobIfNeeded(
     GarbageCollector garbage_collector, TaskPriority priority) {
   DCHECK(v8_flags.parallel_marking || v8_flags.concurrent_marking);
+
+  if (garbage_collector == GarbageCollector::MARK_COMPACTOR &&
+      !heap_->mark_compact_collector()->UseBackgroundThreadsInCycle()) {
+    return;
+  }
+
   if (heap_->IsTearingDown()) return;
 
   if (IsStopped()) {
     // This DCHECK is for the case that concurrent marking was paused.
     DCHECK_IMPLIES(garbage_collector_.has_value(),
                    garbage_collector == garbage_collector_);
-    ScheduleJob(garbage_collector, priority);
+    TryScheduleJob(garbage_collector, priority);
   } else {
-    DCHECK_EQ(garbage_collector, garbage_collector_);
+    DCHECK(garbage_collector_.has_value());
+    DCHECK_EQ(garbage_collector, garbage_collector_.value());
     if (!IsWorkLeft()) return;
     if (priority != TaskPriority::kUserVisible)
       job_handle_->UpdatePriority(priority);
+    DCHECK(current_job_trace_id_.has_value());
+    TRACE_GC_NOTE_WITH_FLOW(
+        garbage_collector_ == GarbageCollector::MARK_COMPACTOR
+            ? "Major concurrent marking rescheduled"
+            : "Minor concurrent marking rescheduled",
+        current_job_trace_id_.value(),
+        TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
     job_handle_->NotifyConcurrencyIncrease();
   }
 }
 
+void ConcurrentMarking::FlushPretenuringFeedback() {
+  PretenuringHandler* pretenuring_handler = heap_->pretenuring_handler();
+  for (auto& task_state : task_state_) {
+    pretenuring_handler->MergeAllocationSitePretenuringFeedback(
+        task_state->local_pretenuring_feedback);
+    task_state->local_pretenuring_feedback.clear();
+  }
+}
+
 void ConcurrentMarking::Join() {
   DCHECK(v8_flags.parallel_marking || v8_flags.concurrent_marking);
+  DCHECK_IMPLIES(
+      garbage_collector_ == GarbageCollector::MARK_COMPACTOR,
+      heap_->mark_compact_collector()->UseBackgroundThreadsInCycle());
   if (!job_handle_ || !job_handle_->IsValid()) return;
   job_handle_->Join();
+  current_job_trace_id_.reset();
   garbage_collector_.reset();
 }
 
@@ -664,14 +624,15 @@ bool ConcurrentMarking::Pause() {
   if (!job_handle_ || !job_handle_->IsValid()) return false;
 
   job_handle_->Cancel();
+  DCHECK(current_job_trace_id_.has_value());
+  TRACE_GC_NOTE_WITH_FLOW(garbage_collector_ == GarbageCollector::MARK_COMPACTOR
+                              ? "Major concurrent marking paused"
+                              : "Minor concurrent marking paused",
+                          current_job_trace_id_.value(),
+                          TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
   return true;
 }
 
-void ConcurrentMarking::Cancel() {
-  Pause();
-  garbage_collector_.reset();
-}
-
 bool ConcurrentMarking::IsStopped() {
   if (!v8_flags.concurrent_marking && !v8_flags.parallel_marking) return true;
 
@@ -680,6 +641,12 @@ bool ConcurrentMarking::IsStopped() {
 
 void ConcurrentMarking::Resume() {
   DCHECK(garbage_collector_.has_value());
+  DCHECK(current_job_trace_id_.has_value());
+  TRACE_GC_NOTE_WITH_FLOW(garbage_collector_ == GarbageCollector::MARK_COMPACTOR
+                              ? "Major concurrent marking resumed"
+                              : "Minor concurrent marking resumed",
+                          current_job_trace_id_.value(),
+                          TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
   RescheduleJobIfNeeded(garbage_collector_.value());
 }
 
@@ -691,8 +658,7 @@ void ConcurrentMarking::FlushNativeContexts(NativeContextStats* main_stats) {
   }
 }
 
-void ConcurrentMarking::FlushMemoryChunkData(
-    NonAtomicMarkingState* marking_state) {
+void ConcurrentMarking::FlushMemoryChunkData() {
   DCHECK(!job_handle_ || !job_handle_->IsValid());
   for (size_t i = 1; i < task_state_.size(); i++) {
     MemoryChunkDataMap& memory_chunk_data = task_state_[i]->memory_chunk_data;
@@ -702,7 +668,7 @@ void ConcurrentMarking::FlushMemoryChunkData(
       MemoryChunk* memory_chunk = pair.first;
       MemoryChunkData& data = pair.second;
       if (data.live_bytes) {
-        marking_state->IncrementLiveBytes(memory_chunk, data.live_bytes);
+        memory_chunk->IncrementLiveBytesAtomically(data.live_bytes);
       }
       if (data.typed_slots) {
         RememberedSet<OLD_TO_OLD>::MergeTyped(memory_chunk,
@@ -718,11 +684,7 @@ void ConcurrentMarking::FlushMemoryChunkData(
 void ConcurrentMarking::ClearMemoryChunkData(MemoryChunk* chunk) {
   DCHECK(!job_handle_ || !job_handle_->IsValid());
   for (size_t i = 1; i < task_state_.size(); i++) {
-    auto it = task_state_[i]->memory_chunk_data.find(chunk);
-    if (it != task_state_[i]->memory_chunk_data.end()) {
-      it->second.live_bytes = 0;
-      it->second.typed_slots.reset();
-    }
+    task_state_[i]->memory_chunk_data.erase(chunk);
   }
 }
 
@@ -740,6 +702,7 @@ ConcurrentMarking::PauseScope::PauseScope(ConcurrentMarking* concurrent_marking)
     : concurrent_marking_(concurrent_marking),
       resume_on_exit_(v8_flags.concurrent_marking &&
                       concurrent_marking_->Pause()) {
+  DCHECK(!v8_flags.minor_ms);
   DCHECK_IMPLIES(resume_on_exit_, v8_flags.concurrent_marking);
 }
 
diff --git a/deps/v8/src/heap/concurrent-marking.h b/deps/v8/src/heap/concurrent-marking.h
index 0759c8306c2066..d9b92050256dd6 100644
--- a/deps/v8/src/heap/concurrent-marking.h
+++ b/deps/v8/src/heap/concurrent-marking.h
@@ -9,6 +9,7 @@
 
 #include "include/v8-platform.h"
 #include "src/base/atomic-utils.h"
+#include "src/base/functional.h"
 #include "src/base/optional.h"
 #include "src/base/platform/condition-variable.h"
 #include "src/base/platform/mutex.h"
@@ -36,8 +37,66 @@ struct MemoryChunkData {
   std::unique_ptr<TypedSlots> typed_slots;
 };
 
-using MemoryChunkDataMap =
-    std::unordered_map<MemoryChunk*, MemoryChunkData, MemoryChunk::Hasher>;
+// This class is a wrapper around an unordered_map that defines the minimum
+// interface to be usable in marking. It aims to provide faster access in the
+// common case where the requested element is the same as the one previously
+// tried.
+class MemoryChunkDataMap final {
+  using MemoryChunkDataMapT = std::unordered_map<MemoryChunk*, MemoryChunkData,
+                                                 base::hash<MemoryChunk*>>;
+
+ public:
+  MemoryChunkDataMapT::mapped_type& operator[](
+      const MemoryChunkDataMapT::key_type& key) {
+    // nullptr value is used to indicate absence of a last key.
+    DCHECK_NOT_NULL(key);
+
+    if (key == last_key_) {
+      return *last_mapped_;
+    }
+
+    auto it = map_.find(key);
+    if (it == map_.end()) {
+      auto result = map_.emplace(key, MemoryChunkData());
+      DCHECK(result.second);
+      it = result.first;
+    }
+
+    last_key_ = key;
+    last_mapped_ = &it->second;
+
+    return it->second;
+  }
+
+  MemoryChunkDataMapT::size_type erase(
+      const MemoryChunkDataMapT::key_type& key) {
+    last_key_ = nullptr;
+    last_mapped_ = nullptr;
+    return map_.erase(key);
+  }
+
+  // No iterator is cached in this class so an actual find() has to be executed
+  // everytime.
+  MemoryChunkDataMapT::iterator find(const MemoryChunkDataMapT::key_type& key) {
+    return map_.find(key);
+  }
+
+  MemoryChunkDataMapT::iterator begin() { return map_.begin(); }
+  MemoryChunkDataMapT::const_iterator end() { return map_.end(); }
+
+  void clear() {
+    last_key_ = nullptr;
+    last_mapped_ = nullptr;
+    map_.clear();
+  }
+
+  bool empty() const { return map_.empty(); }
+
+ private:
+  MemoryChunkDataMapT::key_type last_key_ = nullptr;
+  MemoryChunkDataMapT::mapped_type* last_mapped_ = nullptr;
+  MemoryChunkDataMapT map_;
+};
 
 class V8_EXPORT_PRIVATE ConcurrentMarking {
  public:
@@ -55,19 +114,19 @@ class V8_EXPORT_PRIVATE ConcurrentMarking {
   };
 
   ConcurrentMarking(Heap* heap, WeakObjects* weak_objects);
+  ~ConcurrentMarking();
 
   // Schedules asynchronous job to perform concurrent marking at |priority|.
   // Objects in the heap should not be moved while these are active (can be
   // stopped safely via Stop() or PauseScope).
-  void ScheduleJob(GarbageCollector garbage_collector,
-                   TaskPriority priority = TaskPriority::kUserVisible);
+  void TryScheduleJob(GarbageCollector garbage_collector,
+                      TaskPriority priority = TaskPriority::kUserVisible);
 
   // Waits for scheduled job to complete.
   void Join();
   // Preempts ongoing job ASAP. Returns true if concurrent marking was in
   // progress, false otherwise.
   bool Pause();
-  void Cancel();
 
   // Schedules asynchronous job to perform concurrent marking at |priority| if
   // not already running, otherwise adjusts the number of workers running job
@@ -77,11 +136,13 @@ class V8_EXPORT_PRIVATE ConcurrentMarking {
       TaskPriority priority = TaskPriority::kUserVisible);
   // Flushes native context sizes to the given table of the main thread.
   void FlushNativeContexts(NativeContextStats* main_stats);
-  // Flushes memory chunk data using the given marking state.
-  void FlushMemoryChunkData(NonAtomicMarkingState* marking_state);
+  // Flushes memory chunk data.
+  void FlushMemoryChunkData();
   // This function is called for a new space page that was cleared after
   // scavenge and is going to be re-used.
   void ClearMemoryChunkData(MemoryChunk* chunk);
+  // Flushes pretenuring feedback.
+  void FlushPretenuringFeedback();
 
   // Checks if all threads are stopped.
   bool IsStopped();
@@ -94,26 +155,24 @@ class V8_EXPORT_PRIVATE ConcurrentMarking {
   bool another_ephemeron_iteration() {
     return another_ephemeron_iteration_.load();
   }
-  base::Optional<GarbageCollector> garbage_collector() const {
-    return garbage_collector_;
+
+  GarbageCollector garbage_collector() const {
+    DCHECK(garbage_collector_.has_value());
+    return garbage_collector_.value();
   }
 
+  bool IsWorkLeft() const;
+
  private:
-  struct TaskState {
-    size_t marked_bytes = 0;
-    MemoryChunkDataMap memory_chunk_data;
-    NativeContextInferrer native_context_inferrer;
-    NativeContextStats native_context_stats;
-    char cache_line_padding[64];
-  };
+  struct TaskState;
   class JobTaskMinor;
   class JobTaskMajor;
   void RunMinor(JobDelegate* delegate);
   void RunMajor(JobDelegate* delegate,
                 base::EnumSet<CodeFlushMode> code_flush_mode,
                 unsigned mark_compact_epoch, bool should_keep_ages_unchanged);
-  size_t GetMaxConcurrency(size_t worker_count);
-  bool IsWorkLeft();
+  size_t GetMajorMaxConcurrency(size_t worker_count);
+  size_t GetMinorMaxConcurrency(size_t worker_count);
   void Resume();
 
   std::unique_ptr<JobHandle> job_handle_;
@@ -124,6 +183,7 @@ class V8_EXPORT_PRIVATE ConcurrentMarking {
   std::vector<std::unique_ptr<TaskState>> task_state_;
   std::atomic<size_t> total_marked_bytes_{0};
   std::atomic<bool> another_ephemeron_iteration_{false};
+  base::Optional<uint64_t> current_job_trace_id_;
 
   friend class Heap;
 };
diff --git a/deps/v8/src/heap/conservative-stack-visitor.cc b/deps/v8/src/heap/conservative-stack-visitor.cc
index 6c50b7b9a747ef..c50530ff1a6422 100644
--- a/deps/v8/src/heap/conservative-stack-visitor.cc
+++ b/deps/v8/src/heap/conservative-stack-visitor.cc
@@ -5,6 +5,8 @@
 #include "src/heap/conservative-stack-visitor.h"
 
 #include "src/execution/isolate-inl.h"
+#include "src/heap/basic-memory-chunk.h"
+#include "src/heap/marking-inl.h"
 #include "src/objects/visitors.h"
 
 #ifdef V8_COMPRESS_POINTERS
@@ -21,100 +23,18 @@ ConservativeStackVisitor::ConservativeStackVisitor(Isolate* isolate,
       allocator_(isolate->heap()->memory_allocator()),
       collector_(delegate->collector()) {}
 
-namespace {
-
-// This utility function returns the highest address in the page that is lower
-// than maybe_inner_ptr, has its markbit set, and whose previous address (if it
-// exists) does not have its markbit set. This address is guaranteed to be the
-// start of a valid object in the page. In case the markbit corresponding to
-// maybe_inner_ptr is set, the function bails out and returns kNullAddress.
-Address FindPreviousObjectForConservativeMarking(const Page* page,
-                                                 Address maybe_inner_ptr) {
-  auto* bitmap = page->marking_bitmap<AccessMode::NON_ATOMIC>();
-  const MarkBit::CellType* cells = bitmap->cells();
-
-  // The first actual bit of the bitmap, corresponding to page->area_start(),
-  // is at start_index which is somewhere in (not necessarily at the start of)
-  // start_cell_index.
-  const uint32_t start_index = page->AddressToMarkbitIndex(page->area_start());
-  const uint32_t start_cell_index = Bitmap::IndexToCell(start_index);
-  // We assume that all markbits before start_index are clear:
-  // SLOW_DCHECK(bitmap->AllBitsClearInRange(0, start_index));
-  // This has already been checked for the entire bitmap before starting marking
-  // by MarkCompactCollector::VerifyMarkbitsAreClean.
-
-  const uint32_t index = page->AddressToMarkbitIndex(maybe_inner_ptr);
-  uint32_t cell_index = Bitmap::IndexToCell(index);
-  const MarkBit::CellType mask = 1u << Bitmap::IndexInCell(index);
-  MarkBit::CellType cell = cells[cell_index];
-
-  // If the markbit is already set, bail out.
-  if ((cell & mask) != 0) return kNullAddress;
-
-  // Clear the bits corresponding to higher addresses in the cell.
-  cell &= ((~static_cast<MarkBit::CellType>(0)) >>
-           (Bitmap::kBitsPerCell - Bitmap::IndexInCell(index) - 1));
-
-  // Traverse the bitmap backwards, until we find a markbit that is set and
-  // whose previous markbit (if it exists) is unset.
-  // First, iterate backwards to find a cell with any set markbit.
-  while (cell == 0 && cell_index > start_cell_index) cell = cells[--cell_index];
-  if (cell == 0) {
-    DCHECK_EQ(start_cell_index, cell_index);
-    // We have reached the start of the page.
-    return page->area_start();
-  }
-
-  // We have found such a cell.
-  const uint32_t leading_zeros = base::bits::CountLeadingZeros(cell);
-  const uint32_t leftmost_ones =
-      base::bits::CountLeadingZeros(~(cell << leading_zeros));
-  const uint32_t index_of_last_leftmost_one =
-      Bitmap::kBitsPerCell - leading_zeros - leftmost_ones;
-
-  // If the leftmost sequence of set bits does not reach the start of the cell,
-  // we found it.
-  if (index_of_last_leftmost_one > 0) {
-    return page->MarkbitIndexToAddress(cell_index * Bitmap::kBitsPerCell +
-                                       index_of_last_leftmost_one);
-  }
-
-  // The leftmost sequence of set bits reaches the start of the cell. We must
-  // keep traversing backwards until we find the first unset markbit.
-  if (cell_index == start_cell_index) {
-    // We have reached the start of the page.
-    return page->area_start();
-  }
-
-  // Iterate backwards to find a cell with any unset markbit.
-  do {
-    cell = cells[--cell_index];
-  } while (~cell == 0 && cell_index > start_cell_index);
-  if (~cell == 0) {
-    DCHECK_EQ(start_cell_index, cell_index);
-    // We have reached the start of the page.
-    return page->area_start();
-  }
-
-  // We have found such a cell.
-  const uint32_t leading_ones = base::bits::CountLeadingZeros(~cell);
-  const uint32_t index_of_last_leading_one =
-      Bitmap::kBitsPerCell - leading_ones;
-  DCHECK_LT(0, index_of_last_leading_one);
-  return page->MarkbitIndexToAddress(cell_index * Bitmap::kBitsPerCell +
-                                     index_of_last_leading_one);
-}
-
-}  // namespace
+ConservativeStackVisitor::ConservativeStackVisitor(Isolate* isolate,
+                                                   GarbageCollector collector)
+    : cage_base_(isolate),
+      delegate_(nullptr),
+      allocator_(isolate->heap()->memory_allocator()),
+      collector_(collector) {}
 
-// static
-Address ConservativeStackVisitor::FindBasePtrForMarking(
-    Address maybe_inner_ptr, MemoryAllocator* allocator,
-    GarbageCollector collector) {
+Address ConservativeStackVisitor::FindBasePtr(Address maybe_inner_ptr) const {
   // Check if the pointer is contained by a normal or large page owned by this
   // heap. Bail out if it is not.
-  const MemoryChunk* chunk =
-      allocator->LookupChunkContainingAddress(maybe_inner_ptr);
+  const BasicMemoryChunk* chunk =
+      allocator_->LookupChunkContainingAddress(maybe_inner_ptr);
   if (chunk == nullptr) return kNullAddress;
   DCHECK(chunk->Contains(maybe_inner_ptr));
   // If it is contained in a large page, we want to mark the only object on it.
@@ -123,23 +43,21 @@ Address ConservativeStackVisitor::FindBasePtrForMarking(
     // space or filler objects in large pages. A few cctests violate this now.
     HeapObject obj(static_cast<const LargePage*>(chunk)->GetObject());
     PtrComprCageBase cage_base{chunk->heap()->isolate()};
-    return obj.IsFreeSpaceOrFiller(cage_base) ? kNullAddress : obj.address();
+    return IsFreeSpaceOrFiller(obj, cage_base) ? kNullAddress : obj.address();
   }
   // Otherwise, we have a pointer inside a normal page.
   const Page* page = static_cast<const Page*>(chunk);
   // If it is not in the young generation and we're only interested in young
   // generation pointers, we must ignore it.
-  if (Heap::IsYoungGenerationCollector(collector) && !page->InYoungGeneration())
+  if (Heap::IsYoungGenerationCollector(collector_) &&
+      !page->InYoungGeneration())
     return kNullAddress;
   // If it is in the young generation "from" semispace, it is not used and we
   // must ignore it, as its markbits may not be clean.
   if (page->IsFromPage()) return kNullAddress;
   // Try to find the address of a previous valid object on this page.
   Address base_ptr =
-      FindPreviousObjectForConservativeMarking(page, maybe_inner_ptr);
-  // If the markbit is set, then we have an object that does not need to be
-  // marked.
-  if (base_ptr == kNullAddress) return kNullAddress;
+      MarkingBitmap::FindPreviousValidObject(page, maybe_inner_ptr);
   // Iterate through the objects in the page forwards, until we find the object
   // containing maybe_inner_ptr.
   DCHECK_LE(base_ptr, maybe_inner_ptr);
@@ -149,7 +67,7 @@ Address ConservativeStackVisitor::FindBasePtrForMarking(
     const int size = obj.Size(cage_base);
     DCHECK_LT(0, size);
     if (maybe_inner_ptr < base_ptr + size)
-      return obj.IsFreeSpaceOrFiller(cage_base) ? kNullAddress : base_ptr;
+      return IsFreeSpaceOrFiller(obj, cage_base) ? kNullAddress : base_ptr;
     base_ptr += size;
     DCHECK_LT(base_ptr, page->area_end());
   }
@@ -157,20 +75,39 @@ Address ConservativeStackVisitor::FindBasePtrForMarking(
 
 void ConservativeStackVisitor::VisitPointer(const void* pointer) {
   auto address = reinterpret_cast<Address>(const_cast<void*>(pointer));
-  VisitConservativelyIfPointer(address);
+  VisitConservativelyIfPointer<false>(address);
 #ifdef V8_COMPRESS_POINTERS
   V8HeapCompressionScheme::ProcessIntermediatePointers(
       cage_base_, address,
-      [this](Address ptr) { VisitConservativelyIfPointer(ptr); });
+      [this](Address ptr) { VisitConservativelyIfPointer<true>(ptr); });
 #endif  // V8_COMPRESS_POINTERS
 }
 
+template <bool is_known_to_be_in_cage>
 void ConservativeStackVisitor::VisitConservativelyIfPointer(Address address) {
-  Address base_ptr = FindBasePtrForMarking(address, allocator_, collector_);
+#ifdef V8_COMPRESS_POINTERS
+  if constexpr (!is_known_to_be_in_cage) {
+    // Bail out immediately if the pointer is not in the cage.
+    if (V8HeapCompressionScheme::GetPtrComprCageBaseAddress(address) !=
+        cage_base_.address())
+      return;
+  }
+  DCHECK_EQ(V8HeapCompressionScheme::GetPtrComprCageBaseAddress(address),
+            cage_base_.address());
+#endif  // V8_COMPRESS_POINTERS
+  // Bail out immediately if the pointer is not in the space managed by the
+  // allocator.
+  if (allocator_->IsOutsideAllocatedSpace(address)) {
+    DCHECK_EQ(nullptr, allocator_->LookupChunkContainingAddress(address));
+    return;
+  }
+  // Proceed with inner-pointer resolution.
+  Address base_ptr = FindBasePtr(address);
   if (base_ptr == kNullAddress) return;
   HeapObject obj = HeapObject::FromAddress(base_ptr);
   Object root = obj;
-  delegate_->VisitRootPointer(Root::kHandleScope, nullptr,
+  DCHECK_NOT_NULL(delegate_);
+  delegate_->VisitRootPointer(Root::kStackRoots, nullptr,
                               FullObjectSlot(&root));
   // Check that the delegate visitor did not modify the root slot.
   DCHECK_EQ(root, obj);
diff --git a/deps/v8/src/heap/conservative-stack-visitor.h b/deps/v8/src/heap/conservative-stack-visitor.h
index 432af420c11576..45cd825739a4ea 100644
--- a/deps/v8/src/heap/conservative-stack-visitor.h
+++ b/deps/v8/src/heap/conservative-stack-visitor.h
@@ -24,17 +24,22 @@ class V8_EXPORT_PRIVATE ConservativeStackVisitor
 
   // This method finds an object header based on a `maybe_inner_ptr`. It returns
   // `kNullAddress` if the parameter does not point to (the interior of) a valid
-  // heap object, or if it points to (the interior of) some object that is
-  // already marked as live (black or grey).
-  // The GarbageCollector parameter is only used to determine which kind of
-  // heap objects we are interested in. For MARK_COMPACTOR all heap objects are
-  // considered, whereas for young generation collectors we only consider
-  // objects in the young generation.
-  static Address FindBasePtrForMarking(Address maybe_inner_ptr,
-                                       MemoryAllocator* allocator,
-                                       GarbageCollector collector);
+  // heap object. The allocator_ field is used to provide the set of valid heap
+  // pages. The collector_ field is used to determine which kind of heap objects
+  // we are interested in. For MARK_COMPACTOR all heap objects are considered,
+  // whereas for young generation collectors we only consider objects in the
+  // young generation.
+  Address FindBasePtr(Address maybe_inner_ptr) const;
+
+  static ConservativeStackVisitor ForTesting(Isolate* isolate,
+                                             GarbageCollector collector) {
+    return ConservativeStackVisitor(isolate, collector);
+  }
 
  private:
+  ConservativeStackVisitor(Isolate* isolate, GarbageCollector collector);
+
+  template <bool is_known_to_be_in_cage>
   void VisitConservativelyIfPointer(Address address);
 
   const PtrComprCageBase cage_base_;
diff --git a/deps/v8/src/heap/cppgc-js/cpp-heap.cc b/deps/v8/src/heap/cppgc-js/cpp-heap.cc
index 81fe3fb4497d89..0e60f91a52a7b9 100644
--- a/deps/v8/src/heap/cppgc-js/cpp-heap.cc
+++ b/deps/v8/src/heap/cppgc-js/cpp-heap.cc
@@ -47,7 +47,7 @@
 #include "src/heap/gc-tracer.h"
 #include "src/heap/heap.h"
 #include "src/heap/marking-worklist.h"
-#include "src/heap/sweeper.h"
+#include "src/heap/minor-mark-sweep.h"
 #include "src/heap/traced-handles-marking-visitor.h"
 #include "src/init/v8.h"
 #include "src/profiler/heap-profiler.h"
@@ -206,7 +206,7 @@ class UnifiedHeapConcurrentMarker
   UnifiedHeapConcurrentMarker(
       cppgc::internal::HeapBase& heap, Heap* v8_heap,
       cppgc::internal::MarkingWorklists& marking_worklists,
-      cppgc::internal::IncrementalMarkingSchedule& incremental_marking_schedule,
+      ::heap::base::IncrementalMarkingSchedule& incremental_marking_schedule,
       cppgc::Platform* platform,
       UnifiedHeapMarkingState& unified_heap_marking_state,
       CppHeap::CollectionType collection_type)
@@ -320,7 +320,7 @@ UnifiedHeapMarker::UnifiedHeapMarker(Heap* v8_heap,
       conservative_marking_visitor_(heap, mutator_marking_state_,
                                     *marking_visitor_) {
   concurrent_marker_ = std::make_unique<UnifiedHeapConcurrentMarker>(
-      heap_, v8_heap, marking_worklists_, schedule_, platform_,
+      heap_, v8_heap, marking_worklists_, *schedule_, platform_,
       mutator_unified_heap_marking_state_, config.collection_type);
 }
 
@@ -528,6 +528,42 @@ class SweepingOnMutatorThreadForGlobalHandlesObserver final
   TracedHandles& traced_handles_;
 };
 
+class MoveListenerImpl final : public HeapProfilerNativeMoveListener,
+                               public cppgc::internal::MoveListener {
+ public:
+  MoveListenerImpl(HeapProfiler* profiler, CppHeap* heap)
+      : HeapProfilerNativeMoveListener(profiler), heap_(heap) {}
+  ~MoveListenerImpl() {
+    if (active_) {
+      heap_->UnregisterMoveListener(this);
+    }
+  }
+
+  // HeapProfilerNativeMoveListener implementation:
+  void StartListening() override {
+    if (active_) return;
+    active_ = true;
+    heap_->RegisterMoveListener(this);
+  }
+  void StopListening() override {
+    if (!active_) return;
+    active_ = false;
+    heap_->UnregisterMoveListener(this);
+  }
+
+  // cppgc::internal::MoveListener implementation:
+  void OnMove(uint8_t* from, uint8_t* to,
+              size_t size_including_header) override {
+    ObjectMoveEvent(reinterpret_cast<Address>(from),
+                    reinterpret_cast<Address>(to),
+                    static_cast<int>(size_including_header));
+  }
+
+ private:
+  CppHeap* heap_;
+  bool active_ = false;
+};
+
 }  // namespace
 
 void CppHeap::AttachIsolate(Isolate* isolate) {
@@ -537,13 +573,14 @@ void CppHeap::AttachIsolate(Isolate* isolate) {
   heap_ = isolate->heap();
   static_cast<CppgcPlatformAdapter*>(platform())
       ->SetIsolate(reinterpret_cast<v8::Isolate*>(isolate_));
-  if (isolate_->heap_profiler()) {
-    isolate_->heap_profiler()->AddBuildEmbedderGraphCallback(
-        &CppGraphBuilder::Run, this);
+  if (auto* heap_profiler = isolate_->heap_profiler()) {
+    heap_profiler->AddBuildEmbedderGraphCallback(&CppGraphBuilder::Run, this);
+    heap_profiler->set_native_move_listener(
+        std::make_unique<MoveListenerImpl>(heap_profiler, this));
   }
   SetMetricRecorder(std::make_unique<MetricRecorderAdapter>(*this));
   oom_handler().SetCustomHandler(&FatalOutOfMemoryHandlerImpl);
-  ReduceGCCapabilitiesFromFlags();
+  UpdateGCCapabilitiesFromFlags();
   sweeping_on_mutator_thread_observer_ =
       std::make_unique<SweepingOnMutatorThreadForGlobalHandlesObserver>(
           *this, *isolate_->traced_handles());
@@ -564,10 +601,10 @@ void CppHeap::DetachIsolate() {
 
   sweeping_on_mutator_thread_observer_.reset();
 
-  auto* heap_profiler = isolate_->heap_profiler();
-  if (heap_profiler) {
+  if (auto* heap_profiler = isolate_->heap_profiler()) {
     heap_profiler->RemoveBuildEmbedderGraphCallback(&CppGraphBuilder::Run,
                                                     this);
+    heap_profiler->set_native_move_listener(nullptr);
   }
   SetMetricRecorder(nullptr);
   isolate_ = nullptr;
@@ -607,6 +644,13 @@ CppHeap::MarkingType CppHeap::SelectMarkingType() const {
   if (IsForceGC(current_gc_flags_) && !force_incremental_marking_for_testing_)
     return MarkingType::kAtomic;
 
+  const MarkingType marking_type = marking_support();
+
+  if (marking_type == MarkingType::kIncrementalAndConcurrent && heap_ &&
+      !heap_->ShouldUseBackgroundThreads()) {
+    return MarkingType::kIncremental;
+  }
+
   return marking_support();
 }
 
@@ -616,7 +660,7 @@ CppHeap::SweepingType CppHeap::SelectSweepingType() const {
   return sweeping_support();
 }
 
-void CppHeap::ReduceGCCapabilitiesFromFlags() {
+void CppHeap::UpdateGCCapabilitiesFromFlags() {
   CHECK_IMPLIES(v8_flags.cppheap_concurrent_marking,
                 v8_flags.cppheap_incremental_marking);
   if (v8_flags.cppheap_concurrent_marking) {
@@ -678,10 +722,15 @@ void CppHeap::InitializeTracing(CollectionType collection_type,
   current_gc_flags_ = gc_flags;
 
   const cppgc::internal::MarkingConfig marking_config{
-      *collection_type_, StackState::kNoHeapPointers, SelectMarkingType(),
+      *collection_type_,
+      StackState::kNoHeapPointers,
+      SelectMarkingType(),
       IsForceGC(current_gc_flags_)
           ? cppgc::internal::MarkingConfig::IsForcedGC::kForced
-          : cppgc::internal::MarkingConfig::IsForcedGC::kNotForced};
+          : cppgc::internal::MarkingConfig::IsForcedGC::kNotForced,
+      v8::base::TimeDelta::FromMilliseconds(
+          v8_flags.incremental_marking_task_delay_ms),
+      v8_flags.incremental_marking_bailout_when_ahead_of_schedule};
   DCHECK_IMPLIES(!isolate_,
                  (MarkingType::kAtomic == marking_config.marking_type) ||
                      force_incremental_marking_for_testing_);
@@ -703,7 +752,7 @@ MarkingWorklists::Local* GetV8MarkingWorklists(
   if (collection_type == cppgc::internal::CollectionType::kMajor) {
     return heap->mark_compact_collector()->local_marking_worklists();
   } else {
-    return heap->minor_mark_compact_collector()->local_marking_worklists();
+    return heap->minor_mark_sweep_collector()->local_marking_worklists();
   }
 }
 }  // namespace
@@ -724,7 +773,7 @@ void CppHeap::StartTracing() {
   marking_done_ = false;
 }
 
-bool CppHeap::AdvanceTracing(double max_duration) {
+bool CppHeap::AdvanceTracing(v8::base::TimeDelta max_duration) {
   if (!TracingInitialized()) return true;
   is_in_v8_marking_step_ = true;
   cppgc::internal::StatsCollector::EnabledScope stats_scope(
@@ -732,8 +781,7 @@ bool CppHeap::AdvanceTracing(double max_duration) {
       in_atomic_pause_ ? cppgc::internal::StatsCollector::kAtomicMark
                        : cppgc::internal::StatsCollector::kIncrementalMark);
   const v8::base::TimeDelta deadline =
-      in_atomic_pause_ ? v8::base::TimeDelta::Max()
-                       : v8::base::TimeDelta::FromMillisecondsD(max_duration);
+      in_atomic_pause_ ? v8::base::TimeDelta::Max() : max_duration;
   const size_t marked_bytes_limit = in_atomic_pause_ ? SIZE_MAX : 0;
   DCHECK_NOT_NULL(marker_);
   if (in_atomic_pause_) {
@@ -782,15 +830,15 @@ bool CppHeap::FinishConcurrentMarkingIfNeeded() {
   return marker_->JoinConcurrentMarkingIfNeeded();
 }
 
-void CppHeap::WriteBarrier(JSObject js_object) {
-  DCHECK(js_object.MayHaveEmbedderFields());
+void CppHeap::WriteBarrier(Tagged<JSObject> js_object) {
+  DCHECK(js_object->MayHaveEmbedderFields());
   DCHECK_NOT_NULL(isolate()->heap()->mark_compact_collector());
 
   const auto descriptor = wrapper_descriptor();
   const auto min_field_count =
       1 + std::max(descriptor.wrappable_type_index,
                    descriptor.wrappable_instance_index);
-  if (js_object.GetEmbedderFieldCount() < min_field_count) return;
+  if (js_object->GetEmbedderFieldCount() < min_field_count) return;
 
   const EmbedderDataSlot type_slot(js_object, descriptor.wrappable_type_index);
   const EmbedderDataSlot instance_slot(js_object,
@@ -800,7 +848,7 @@ void CppHeap::WriteBarrier(JSObject js_object) {
       ->mark_compact_collector()
       ->local_marking_worklists()
       ->cpp_marking_state()
-      ->MarkAndPushForWriteBarrier(type_slot, instance_slot);
+      ->MarkAndPush(type_slot, instance_slot);
 }
 
 namespace {
@@ -906,11 +954,8 @@ void CppHeap::AllocatedObjectSizeDecreased(size_t bytes) {
 }
 
 void CppHeap::ReportBufferedAllocationSizeIfPossible() {
-  // Avoid reporting to V8 in the following conditions as that may trigger GC
-  // finalizations where not allowed.
-  // - Recursive sweeping.
-  // - GC forbidden scope.
-  if (sweeper().IsSweepingOnMutatorThread() || in_no_gc_scope() || !isolate_) {
+  // Reporting memory to V8 may trigger GC.
+  if (!IsGCAllowed()) {
     return;
   }
 
@@ -951,18 +996,21 @@ void CppHeap::ReportBufferedAllocationSizeIfPossible() {
 
 void CppHeap::CollectGarbageForTesting(CollectionType collection_type,
                                        StackState stack_state) {
-  if (in_no_gc_scope()) return;
+  if (!IsDetachedGCAllowed()) {
+    return;
+  }
 
   // Finish sweeping in case it is still running.
   sweeper().FinishIfRunning();
 
-  stack()->SetMarkerToCurrentStackPosition();
-
   if (isolate_) {
     reinterpret_cast<v8::Isolate*>(isolate_)
         ->RequestGarbageCollectionForTesting(
             v8::Isolate::kFullGarbageCollection, stack_state);
-  } else {
+    return;
+  }
+
+  stack()->SetMarkerIfNeededAndCallback([this, collection_type, stack_state]() {
     // Perform an atomic GC, with starting incremental/concurrent marking and
     // immediately finalizing the garbage collection.
     if (!IsMarking()) {
@@ -970,12 +1018,12 @@ void CppHeap::CollectGarbageForTesting(CollectionType collection_type,
       StartTracing();
     }
     EnterFinalPause(stack_state);
-    CHECK(AdvanceTracing(std::numeric_limits<double>::infinity()));
+    CHECK(AdvanceTracing(v8::base::TimeDelta::Max()));
     if (FinishConcurrentMarkingIfNeeded()) {
-      CHECK(AdvanceTracing(std::numeric_limits<double>::infinity()));
+      CHECK(AdvanceTracing(v8::base::TimeDelta::Max()));
     }
     TraceEpilogue();
-  }
+  });
 }
 
 void CppHeap::EnableDetachedGarbageCollectionsForTesting() {
@@ -1126,14 +1174,15 @@ CppHeap::PauseConcurrentMarkingScope::PauseConcurrentMarkingScope(
 }
 
 void CppHeap::CollectGarbage(cppgc::internal::GCConfig config) {
-  if (in_no_gc_scope() || !isolate_) return;
-
+  if (!IsGCAllowed()) {
+    return;
+  }
   // TODO(mlippautz): Respect full config.
-  const int flags =
+  const auto flags =
       (config.free_memory_handling ==
        cppgc::internal::GCConfig::FreeMemoryHandling::kDiscardWherePossible)
-          ? Heap::kReduceMemoryFootprintMask
-          : Heap::kNoGCFlags;
+          ? GCFlag::kReduceMemoryFootprint
+          : GCFlag::kNoFlags;
   isolate_->heap()->CollectAllGarbage(
       flags, GarbageCollectionReason::kCppHeapAllocationFailure);
 }
@@ -1157,8 +1206,16 @@ void CppHeap::ResetCrossHeapRememberedSet() {
   cross_heap_remembered_set_.Reset(*isolate_);
 }
 
-void CppHeap::ReduceGCCapabilitiesFromFlagsForTesting() {
-  ReduceGCCapabilitiesFromFlags();
+void CppHeap::UpdateGCCapabilitiesFromFlagsForTesting() {
+  UpdateGCCapabilitiesFromFlags();
+}
+
+bool CppHeap::IsDetachedGCAllowed() const {
+  return (isolate_ || in_detached_testing_mode_) && HeapBase::IsGCAllowed();
+}
+
+bool CppHeap::IsGCAllowed() const {
+  return isolate_ && HeapBase::IsGCAllowed();
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/cppgc-js/cpp-heap.h b/deps/v8/src/heap/cppgc-js/cpp-heap.h
index 5cc53037f6b8f9..5c6079866fbdf4 100644
--- a/deps/v8/src/heap/cppgc-js/cpp-heap.h
+++ b/deps/v8/src/heap/cppgc-js/cpp-heap.h
@@ -141,12 +141,12 @@ class V8_EXPORT_PRIVATE CppHeap final
       CollectionType,
       GarbageCollectionFlags = GarbageCollectionFlagValues::kNoFlags);
   void StartTracing();
-  bool AdvanceTracing(double max_duration);
+  bool AdvanceTracing(v8::base::TimeDelta max_duration);
   bool IsTracingDone() const;
   void TraceEpilogue();
   void EnterFinalPause(cppgc::EmbedderStackState stack_state);
   bool FinishConcurrentMarkingIfNeeded();
-  void WriteBarrier(JSObject);
+  void WriteBarrier(Tagged<JSObject>);
 
   bool ShouldFinalizeIncrementalMarking() const;
 
@@ -180,7 +180,7 @@ class V8_EXPORT_PRIVATE CppHeap final
   size_t epoch() const override;
 
   V8_INLINE void RememberCrossHeapReferenceIfNeeded(
-      v8::internal::JSObject host_obj, void* value);
+      v8::internal::Tagged<v8::internal::JSObject> host_obj, void* value);
   template <typename F>
   inline void VisitCrossHeapRememberedSetIfNeeded(F f);
   void ResetCrossHeapRememberedSet();
@@ -188,10 +188,10 @@ class V8_EXPORT_PRIVATE CppHeap final
   // Testing-only APIs.
   void EnableDetachedGarbageCollectionsForTesting();
   void CollectGarbageForTesting(CollectionType, StackState);
-  void ReduceGCCapabilitiesFromFlagsForTesting();
+  void UpdateGCCapabilitiesFromFlagsForTesting();
 
  private:
-  void ReduceGCCapabilitiesFromFlags();
+  void UpdateGCCapabilitiesFromFlags();
 
   void FinalizeIncrementalGarbageCollectionIfNeeded(
       cppgc::Heap::StackState) final {
@@ -210,6 +210,9 @@ class V8_EXPORT_PRIVATE CppHeap final
 
   bool TracingInitialized() const { return collection_type_.has_value(); }
 
+  bool IsGCAllowed() const override;
+  bool IsDetachedGCAllowed() const;
+
   Heap* heap() const { return heap_; }
 
   Isolate* isolate_ = nullptr;
@@ -249,7 +252,7 @@ class V8_EXPORT_PRIVATE CppHeap final
 };
 
 void CppHeap::RememberCrossHeapReferenceIfNeeded(
-    v8::internal::JSObject host_obj, void* value) {
+    v8::internal::Tagged<v8::internal::JSObject> host_obj, void* value) {
   if (!generational_gc_supported()) return;
   DCHECK(isolate_);
   cross_heap_remembered_set_.RememberReferenceIfNeeded(*isolate_, host_obj,
diff --git a/deps/v8/src/heap/cppgc-js/cpp-marking-state-inl.h b/deps/v8/src/heap/cppgc-js/cpp-marking-state-inl.h
index 3e52ae3c43334a..16d95a669480ad 100644
--- a/deps/v8/src/heap/cppgc-js/cpp-marking-state-inl.h
+++ b/deps/v8/src/heap/cppgc-js/cpp-marking-state-inl.h
@@ -8,7 +8,6 @@
 #include "src/heap/cppgc-js/cpp-marking-state.h"
 #include "src/heap/cppgc-js/wrappable-info-inl.h"
 #include "src/heap/cppgc-js/wrappable-info.h"
-#include "src/heap/cppgc/heap-page.h"
 #include "src/objects/embedder-data-slot.h"
 #include "src/objects/js-objects.h"
 
@@ -16,7 +15,7 @@ namespace v8 {
 namespace internal {
 
 bool CppMarkingState::ExtractEmbedderDataSnapshot(
-    Map map, JSObject object, EmbedderDataSnapshot& snapshot) {
+    Tagged<Map> map, Tagged<JSObject> object, EmbedderDataSnapshot& snapshot) {
   if (JSObject::GetEmbedderFieldCount(map) < 2) return false;
 
   EmbedderDataSlot::PopulateEmbedderDataSnapshot(
@@ -43,20 +42,6 @@ void CppMarkingState::MarkAndPush(const EmbedderDataSlot type_slot,
   }
 }
 
-// TODO(v8:13796): Remove this if it doesn't flush out any issues.
-void CppMarkingState::MarkAndPushForWriteBarrier(
-    const EmbedderDataSlot type_slot, const EmbedderDataSlot instance_slot) {
-  const auto maybe_info = WrappableInfo::From(
-      isolate_, type_slot, instance_slot, wrapper_descriptor_);
-  if (maybe_info.has_value()) {
-    cppgc::internal::HeapObjectHeader& header =
-        cppgc::internal::HeapObjectHeader::FromObject(maybe_info->instance);
-    CHECK_EQ(&header, &cppgc::internal::BasePage::FromPayload(&header)
-                           ->ObjectHeaderFromInnerAddress(&header));
-    marking_state_.MarkAndPush(header);
-  }
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/cppgc-js/cpp-marking-state.h b/deps/v8/src/heap/cppgc-js/cpp-marking-state.h
index 3710ad4c197c96..15260b2f017cbc 100644
--- a/deps/v8/src/heap/cppgc-js/cpp-marking-state.h
+++ b/deps/v8/src/heap/cppgc-js/cpp-marking-state.h
@@ -43,13 +43,12 @@ class CppMarkingState final {
 
   void Publish() { marking_state_.Publish(); }
 
-  inline bool ExtractEmbedderDataSnapshot(Map, JSObject, EmbedderDataSnapshot&);
+  inline bool ExtractEmbedderDataSnapshot(Tagged<Map>, Tagged<JSObject>,
+                                          EmbedderDataSnapshot&);
 
   inline void MarkAndPush(const EmbedderDataSnapshot&);
   inline void MarkAndPush(const EmbedderDataSlot type_slot,
                           const EmbedderDataSlot instance_slot);
-  inline void MarkAndPushForWriteBarrier(const EmbedderDataSlot type_slot,
-                                         const EmbedderDataSlot instance_slot);
 
   bool IsLocalEmpty() {
     return marking_state_.marking_worklist().IsLocalEmpty();
diff --git a/deps/v8/src/heap/cppgc-js/cpp-snapshot.cc b/deps/v8/src/heap/cppgc-js/cpp-snapshot.cc
index 61d635e3bfa441..b2316db611e1ab 100644
--- a/deps/v8/src/heap/cppgc-js/cpp-snapshot.cc
+++ b/deps/v8/src/heap/cppgc-js/cpp-snapshot.cc
@@ -8,6 +8,7 @@
 
 #include "include/cppgc/internal/name-trait.h"
 #include "include/cppgc/trace-trait.h"
+#include "include/cppgc/visitor.h"
 #include "include/v8-cppgc.h"
 #include "include/v8-profiler.h"
 #include "src/api/api-inl.h"
@@ -37,8 +38,9 @@ using cppgc::internal::HeapObjectHeader;
 // Node representing a C++ object on the heap.
 class EmbedderNode : public v8::EmbedderGraph::Node {
  public:
-  EmbedderNode(cppgc::internal::HeapObjectName name, size_t size)
-      : name_(name), size_(size) {
+  EmbedderNode(const HeapObjectHeader* header_address,
+               cppgc::internal::HeapObjectName name, size_t size)
+      : header_address_(header_address), name_(name), size_(size) {
     USE(size_);
   }
   ~EmbedderNode() override = default;
@@ -75,7 +77,10 @@ class EmbedderNode : public v8::EmbedderGraph::Node {
     return named_edge_str;
   }
 
+  const void* GetAddress() override { return header_address_; }
+
  private:
+  const void* header_address_;
   cppgc::internal::HeapObjectName name_;
   size_t size_;
   Node* wrapper_node_ = nullptr;
@@ -83,11 +88,13 @@ class EmbedderNode : public v8::EmbedderGraph::Node {
   std::vector<std::unique_ptr<char[]>> named_edges_;
 };
 
+constexpr HeapObjectHeader* kNoNativeAddress = nullptr;
+
 // Node representing an artificial root group, e.g., set of Persistent handles.
 class EmbedderRootNode final : public EmbedderNode {
  public:
   explicit EmbedderRootNode(const char* name)
-      : EmbedderNode({name, false}, 0) {}
+      : EmbedderNode(kNoNativeAddress, {name, false}, 0) {}
   ~EmbedderRootNode() final = default;
 
   bool IsRootNode() final { return true; }
@@ -358,11 +365,11 @@ void* ExtractEmbedderDataBackref(Isolate* isolate, CppHeap& cpp_heap,
   if (!v8_value->IsObject()) return nullptr;
 
   Handle<Object> v8_object = Utils::OpenHandle(*v8_value);
-  if (!v8_object->IsJSObject() ||
-      !JSObject::cast(*v8_object).MayHaveEmbedderFields())
+  if (!IsJSObject(*v8_object) ||
+      !JSObject::cast(*v8_object)->MayHaveEmbedderFields())
     return nullptr;
 
-  JSObject js_object = JSObject::cast(*v8_object);
+  Tagged<JSObject> js_object = JSObject::cast(*v8_object);
 
   const auto maybe_info =
       WrappableInfo::From(isolate, js_object, cpp_heap.wrapper_descriptor());
@@ -433,9 +440,9 @@ class CppGraphBuilderImpl final {
   }
 
   EmbedderNode* AddNode(const HeapObjectHeader& header) {
-    return static_cast<EmbedderNode*>(
-        graph_.AddNode(std::unique_ptr<v8::EmbedderGraph::Node>{
-            new EmbedderNode(header.GetName(), header.AllocatedSize())}));
+    return static_cast<EmbedderNode*>(graph_.AddNode(
+        std::unique_ptr<v8::EmbedderGraph::Node>{new EmbedderNode(
+            &header, header.GetName(), header.AllocatedSize())}));
   }
 
   void AddEdge(State& parent, const HeapObjectHeader& header,
@@ -777,7 +784,10 @@ class CppGraphBuilderImpl::VisitationItem final : public WorkstackItemBase {
     }
     ParentScope parent_scope(current_);
     VisiblityVisitor object_visitor(graph_builder, parent_scope);
-    current_.header()->Trace(&object_visitor);
+    if (!current_.header()->IsInConstruction()) {
+      // TODO(mlippautz): Handle in construction objects.
+      current_.header()->Trace(&object_visitor);
+    }
     if (!parent_) {
       current_.UnmarkPending();
     }
@@ -861,6 +871,48 @@ void CppGraphBuilderImpl::VisitRootForGraphBuilding(
   AddRootEdge(root, current, loc.ToString());
 }
 
+namespace {
+
+// Visitor adds edges from native stack roots to objects.
+class GraphBuildingStackVisitor
+    : public cppgc::internal::ConservativeTracingVisitor,
+      public ::heap::base::StackVisitor,
+      public cppgc::Visitor {
+ public:
+  GraphBuildingStackVisitor(CppHeap& heap,
+                            GraphBuildingRootVisitor& root_visitor)
+      : cppgc::internal::ConservativeTracingVisitor(heap, *heap.page_backend(),
+                                                    *this),
+        cppgc::Visitor(cppgc::internal::VisitorFactory::CreateKey()),
+        root_visitor_(root_visitor) {}
+
+  void VisitPointer(const void* address) final {
+    // Entry point for stack walk. The conservative visitor dispatches as
+    // follows:
+    // - Fully constructed objects: VisitFullyConstructedConservatively()
+    // - Objects in construction: VisitInConstructionConservatively()
+    TraceConservativelyIfNeeded(address);
+  }
+
+  void VisitFullyConstructedConservatively(HeapObjectHeader& header) final {
+    root_visitor_.VisitRoot(header.ObjectStart(),
+                            {header.ObjectStart(), nullptr},
+                            cppgc::SourceLocation());
+  }
+
+  void VisitInConstructionConservatively(HeapObjectHeader& header,
+                                         TraceConservativelyCallback) final {
+    root_visitor_.VisitRoot(header.ObjectStart(),
+                            {header.ObjectStart(), nullptr},
+                            cppgc::SourceLocation());
+  }
+
+ private:
+  GraphBuildingRootVisitor& root_visitor_;
+};
+
+}  // namespace
+
 void CppGraphBuilderImpl::Run() {
   // Sweeping from a previous GC might still be running, in which case not all
   // pages have been returned to spaces yet.
@@ -881,7 +933,10 @@ void CppGraphBuilderImpl::Run() {
 
     ParentScope parent_scope(state);
     GraphBuildingVisitor object_visitor(*this, parent_scope);
-    state.header()->Trace(&object_visitor);
+    if (!state.header()->IsInConstruction()) {
+      // TODO(mlippautz): Handle in-construction objects.
+      state.header()->Trace(&object_visitor);
+    }
     state.ForAllEphemeronEdges([this, &state](const HeapObjectHeader& value) {
       AddEdge(state, value, "part of key -> value pair in ephemeron table");
     });
@@ -894,18 +949,29 @@ void CppGraphBuilderImpl::Run() {
   });
   // Add roots.
   {
-    ParentScope parent_scope(states_.CreateRootState(AddRootNode("C++ roots")));
+    ParentScope parent_scope(
+        states_.CreateRootState(AddRootNode("C++ Persistent roots")));
     GraphBuildingRootVisitor root_object_visitor(*this, parent_scope);
     cpp_heap_.GetStrongPersistentRegion().Iterate(root_object_visitor);
   }
   {
-    ParentScope parent_scope(
-        states_.CreateRootState(AddRootNode("C++ cross-thread roots")));
+    ParentScope parent_scope(states_.CreateRootState(
+        AddRootNode("C++ CrossThreadPersistent roots")));
     GraphBuildingRootVisitor root_object_visitor(*this, parent_scope);
     cppgc::internal::PersistentRegionLock guard;
     cpp_heap_.GetStrongCrossThreadPersistentRegion().Iterate(
         root_object_visitor);
   }
+  // Only add stack roots in case the callback is not run from generating a
+  // snapshot without stack. This avoids adding false-positive edges when
+  // conservatively scanning the stack.
+  if (cpp_heap_.isolate()->heap()->IsGCWithStack()) {
+    ParentScope parent_scope(
+        states_.CreateRootState(AddRootNode("C++ native stack roots")));
+    GraphBuildingRootVisitor root_object_visitor(*this, parent_scope);
+    GraphBuildingStackVisitor stack_visitor(cpp_heap_, root_object_visitor);
+    cpp_heap_.stack()->IteratePointersUntilMarker(&stack_visitor);
+  }
 }
 
 // static
diff --git a/deps/v8/src/heap/cppgc-js/cross-heap-remembered-set.cc b/deps/v8/src/heap/cppgc-js/cross-heap-remembered-set.cc
index 5c70fdeb22a44d..926e27b4121ceb 100644
--- a/deps/v8/src/heap/cppgc-js/cross-heap-remembered-set.cc
+++ b/deps/v8/src/heap/cppgc-js/cross-heap-remembered-set.cc
@@ -10,9 +10,8 @@
 
 namespace v8::internal {
 
-void CrossHeapRememberedSet::RememberReferenceIfNeeded(Isolate& isolate,
-                                                       JSObject host_obj,
-                                                       void* cppgc_object) {
+void CrossHeapRememberedSet::RememberReferenceIfNeeded(
+    Isolate& isolate, Tagged<JSObject> host_obj, void* cppgc_object) {
   DCHECK_NOT_NULL(cppgc_object);
   // Any in-cage pointer must point to a vaild, not freed cppgc object.
   auto* page =
diff --git a/deps/v8/src/heap/cppgc-js/cross-heap-remembered-set.h b/deps/v8/src/heap/cppgc-js/cross-heap-remembered-set.h
index ba28c377f514e4..cff3320ff01831 100644
--- a/deps/v8/src/heap/cppgc-js/cross-heap-remembered-set.h
+++ b/deps/v8/src/heap/cppgc-js/cross-heap-remembered-set.h
@@ -9,7 +9,7 @@
 
 #include "src/base/macros.h"
 #include "src/handles/handles.h"
-#include "src/objects/js-objects.h"
+#include "src/objects/tagged.h"
 
 namespace cppgc::internal {
 class HeapBase;
@@ -17,6 +17,8 @@ class HeapBase;
 
 namespace v8::internal {
 
+class JSObject;
+
 // The class is used to remember V8 to Oilpan references.
 class V8_EXPORT_PRIVATE CrossHeapRememberedSet final {
  public:
@@ -26,7 +28,7 @@ class V8_EXPORT_PRIVATE CrossHeapRememberedSet final {
   CrossHeapRememberedSet(const CrossHeapRememberedSet&) = delete;
   CrossHeapRememberedSet(CrossHeapRememberedSet&&) = delete;
 
-  void RememberReferenceIfNeeded(Isolate& isolate, JSObject host_obj,
+  void RememberReferenceIfNeeded(Isolate& isolate, Tagged<JSObject> host_obj,
                                  void* cppgc_object);
   void Reset(Isolate& isolate);
 
diff --git a/deps/v8/src/heap/cppgc-js/unified-heap-marking-state-inl.h b/deps/v8/src/heap/cppgc-js/unified-heap-marking-state-inl.h
index 719cb95de11809..7d3ba074497624 100644
--- a/deps/v8/src/heap/cppgc-js/unified-heap-marking-state-inl.h
+++ b/deps/v8/src/heap/cppgc-js/unified-heap-marking-state-inl.h
@@ -40,22 +40,32 @@ void UnifiedHeapMarkingState::MarkAndPush(
   if (!traced_handle_location) {
     return;
   }
-  Object object = TracedHandles::Mark(traced_handle_location, mark_mode_);
-  if (!object.IsHeapObject()) {
+  Tagged<Object> object =
+      TracedHandles::Mark(traced_handle_location, mark_mode_);
+  if (!IsHeapObject(object)) {
     // The embedder is not aware of whether numbers are materialized as heap
     // objects are just passed around as Smis.
     return;
   }
-  HeapObject heap_object = HeapObject::cast(object);
+  Tagged<HeapObject> heap_object = HeapObject::cast(object);
   if (heap_object.InReadOnlySpace()) return;
+  if (!ShouldMarkObject(heap_object)) return;
   if (marking_state_->TryMark(heap_object)) {
     local_marking_worklist_->Push(heap_object);
   }
   if (V8_UNLIKELY(track_retaining_path_)) {
-    heap_->AddRetainingRoot(Root::kWrapperTracing, heap_object);
+    heap_->AddRetainingRoot(Root::kTracedHandles, heap_object);
   }
 }
 
+bool UnifiedHeapMarkingState::ShouldMarkObject(
+    Tagged<HeapObject> object) const {
+  // Keep up-to-date with MarkCompactCollector::ShouldMarkObject.
+  if (V8_LIKELY(!has_shared_space_)) return true;
+  if (is_shared_space_isolate_) return true;
+  return !object.InAnySharedSpace();
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/cppgc-js/unified-heap-marking-state.cc b/deps/v8/src/heap/cppgc-js/unified-heap-marking-state.cc
index 83c4e17eeac6a7..b7700d243354f9 100644
--- a/deps/v8/src/heap/cppgc-js/unified-heap-marking-state.cc
+++ b/deps/v8/src/heap/cppgc-js/unified-heap-marking-state.cc
@@ -5,6 +5,7 @@
 #include "src/heap/cppgc-js/unified-heap-marking-state.h"
 
 #include "src/base/logging.h"
+#include "src/heap/heap-inl.h"
 #include "src/heap/mark-compact.h"
 
 namespace v8 {
@@ -14,6 +15,9 @@ UnifiedHeapMarkingState::UnifiedHeapMarkingState(
     Heap* heap, MarkingWorklists::Local* local_marking_worklist,
     cppgc::internal::CollectionType collection_type)
     : heap_(heap),
+      has_shared_space_(heap && heap->isolate()->has_shared_space()),
+      is_shared_space_isolate_(heap &&
+                               heap->isolate()->is_shared_space_isolate()),
       marking_state_(heap_ ? heap_->marking_state() : nullptr),
       local_marking_worklist_(local_marking_worklist),
       track_retaining_path_(v8_flags.track_retaining_path),
diff --git a/deps/v8/src/heap/cppgc-js/unified-heap-marking-state.h b/deps/v8/src/heap/cppgc-js/unified-heap-marking-state.h
index 21ac09d81cbf54..f550bd3dd258fa 100644
--- a/deps/v8/src/heap/cppgc-js/unified-heap-marking-state.h
+++ b/deps/v8/src/heap/cppgc-js/unified-heap-marking-state.h
@@ -27,9 +27,12 @@ class UnifiedHeapMarkingState final {
   void Update(MarkingWorklists::Local*);
 
   V8_INLINE void MarkAndPush(const TracedReferenceBase&);
+  V8_INLINE bool ShouldMarkObject(Tagged<HeapObject> object) const;
 
  private:
   Heap* const heap_;
+  const bool has_shared_space_;
+  const bool is_shared_space_isolate_;
   MarkingState* const marking_state_;
   MarkingWorklists::Local* local_marking_worklist_ = nullptr;
   const bool track_retaining_path_;
diff --git a/deps/v8/src/heap/cppgc-js/unified-heap-marking-visitor.cc b/deps/v8/src/heap/cppgc-js/unified-heap-marking-visitor.cc
index c44ea620548037..ab6329c81cb664 100644
--- a/deps/v8/src/heap/cppgc-js/unified-heap-marking-visitor.cc
+++ b/deps/v8/src/heap/cppgc-js/unified-heap-marking-visitor.cc
@@ -10,10 +10,13 @@
 #include "src/heap/cppgc/visitor.h"
 #include "src/heap/heap.h"
 #include "src/heap/mark-compact.h"
+#include "src/heap/minor-mark-sweep.h"
 
 namespace v8 {
 namespace internal {
 
+struct Dummy;
+
 namespace {
 std::unique_ptr<MarkingWorklists::Local> GetV8MarkingWorklists(
     Heap* heap, cppgc::internal::CollectionType collection_type) {
@@ -21,7 +24,7 @@ std::unique_ptr<MarkingWorklists::Local> GetV8MarkingWorklists(
   auto* worklist =
       (collection_type == cppgc::internal::CollectionType::kMajor)
           ? heap->mark_compact_collector()->marking_worklists()
-          : heap->minor_mark_compact_collector()->marking_worklists();
+          : heap->minor_mark_sweep_collector()->marking_worklists();
   return std::make_unique<MarkingWorklists::Local>(worklist);
 }
 }  // namespace
@@ -38,6 +41,40 @@ void UnifiedHeapMarkingVisitorBase::Visit(const void* object,
   marking_state_.MarkAndPush(object, desc);
 }
 
+void UnifiedHeapMarkingVisitorBase::VisitMultipleUncompressedMember(
+    const void* start, size_t len,
+    TraceDescriptorCallback get_trace_descriptor) {
+  const char* it = static_cast<const char*>(start);
+  const char* end = it + len * cppgc::internal::kSizeOfUncompressedMember;
+  for (; it < end; it += cppgc::internal::kSizeOfUncompressedMember) {
+    const auto* current =
+        reinterpret_cast<const cppgc::internal::RawPointer*>(it);
+    const void* object = current->LoadAtomic();
+    if (!object) continue;
+
+    marking_state_.MarkAndPush(object, get_trace_descriptor(object));
+  }
+}
+
+#if defined(CPPGC_POINTER_COMPRESSION)
+
+void UnifiedHeapMarkingVisitorBase::VisitMultipleCompressedMember(
+    const void* start, size_t len,
+    TraceDescriptorCallback get_trace_descriptor) {
+  const char* it = static_cast<const char*>(start);
+  const char* end = it + len * cppgc::internal::kSizeofCompressedMember;
+  for (; it < end; it += cppgc::internal::kSizeofCompressedMember) {
+    const auto* current =
+        reinterpret_cast<const cppgc::internal::CompressedPointer*>(it);
+    const void* object = current->LoadAtomic();
+    if (!object) continue;
+
+    marking_state_.MarkAndPush(object, get_trace_descriptor(object));
+  }
+}
+
+#endif  // defined(CPPGC_POINTER_COMPRESSION)
+
 void UnifiedHeapMarkingVisitorBase::VisitWeak(const void* object,
                                               TraceDescriptor desc,
                                               WeakCallback weak_callback,
diff --git a/deps/v8/src/heap/cppgc-js/unified-heap-marking-visitor.h b/deps/v8/src/heap/cppgc-js/unified-heap-marking-visitor.h
index 9031fa4f9a411d..38ab4adbb83d5e 100644
--- a/deps/v8/src/heap/cppgc-js/unified-heap-marking-visitor.h
+++ b/deps/v8/src/heap/cppgc-js/unified-heap-marking-visitor.h
@@ -13,8 +13,6 @@
 
 namespace cppgc {
 
-class SourceLocation;
-
 namespace internal {
 class ConcurrentMarkingState;
 class BasicMarkingState;
@@ -23,10 +21,13 @@ class MutatorMarkingState;
 }  // namespace cppgc
 
 namespace v8 {
+
+class SourceLocation;
+
 namespace internal {
 
-using cppgc::SourceLocation;
 using cppgc::TraceDescriptor;
+using cppgc::TraceDescriptorCallback;
 using cppgc::WeakCallback;
 using cppgc::internal::HeapBase;
 using cppgc::internal::MutatorMarkingState;
@@ -42,6 +43,12 @@ class V8_EXPORT_PRIVATE UnifiedHeapMarkingVisitorBase : public JSVisitor {
  protected:
   // C++ handling.
   void Visit(const void*, TraceDescriptor) final;
+  void VisitMultipleUncompressedMember(const void*, size_t,
+                                       TraceDescriptorCallback) final;
+#if defined(CPPGC_POINTER_COMPRESSION)
+  void VisitMultipleCompressedMember(const void*, size_t,
+                                     TraceDescriptorCallback) final;
+#endif  // defined(CPPGC_POINTER_COMPRESSION)
   void VisitWeak(const void*, TraceDescriptor, WeakCallback, const void*) final;
   void VisitEphemeron(const void*, const void*, TraceDescriptor) final;
   void VisitWeakContainer(const void* self, TraceDescriptor strong_desc,
diff --git a/deps/v8/src/heap/cppgc-js/wrappable-info-inl.h b/deps/v8/src/heap/cppgc-js/wrappable-info-inl.h
index e9c65fd2d5f70c..4f9e0ebf3d3de5 100644
--- a/deps/v8/src/heap/cppgc-js/wrappable-info-inl.h
+++ b/deps/v8/src/heap/cppgc-js/wrappable-info-inl.h
@@ -14,10 +14,10 @@ namespace v8::internal {
 
 // static
 base::Optional<WrappableInfo> WrappableInfo::From(
-    Isolate* isolate, JSObject wrapper,
+    Isolate* isolate, Tagged<JSObject> wrapper,
     const WrapperDescriptor& wrapper_descriptor) {
-  DCHECK(wrapper.MayHaveEmbedderFields());
-  return wrapper.GetEmbedderFieldCount() < 2
+  DCHECK(wrapper->MayHaveEmbedderFields());
+  return wrapper->GetEmbedderFieldCount() < 2
              ? base::Optional<WrappableInfo>()
              : From(isolate,
                     EmbedderDataSlot(wrapper,
diff --git a/deps/v8/src/heap/cppgc-js/wrappable-info.h b/deps/v8/src/heap/cppgc-js/wrappable-info.h
index 7a11daa10aa222..11292783f5cd54 100644
--- a/deps/v8/src/heap/cppgc-js/wrappable-info.h
+++ b/deps/v8/src/heap/cppgc-js/wrappable-info.h
@@ -16,7 +16,8 @@ class Isolate;
 
 struct WrappableInfo final {
  public:
-  static V8_INLINE base::Optional<WrappableInfo> From(Isolate*, JSObject,
+  static V8_INLINE base::Optional<WrappableInfo> From(Isolate*,
+                                                      Tagged<JSObject>,
                                                       const WrapperDescriptor&);
   static V8_INLINE base::Optional<WrappableInfo> From(
       Isolate*, const EmbedderDataSlot& type_slot,
diff --git a/deps/v8/src/heap/cppgc/caged-heap-local-data.cc b/deps/v8/src/heap/cppgc/caged-heap-local-data.cc
index 487fb931955d82..398dfe2af87b6d 100644
--- a/deps/v8/src/heap/cppgc/caged-heap-local-data.cc
+++ b/deps/v8/src/heap/cppgc/caged-heap-local-data.cc
@@ -58,7 +58,7 @@ AgeTable::Age AgeTable::GetAgeForRange(uintptr_t offset_begin,
 }
 
 void AgeTable::ResetForTesting() {
-  std::fill(table_.begin(), table_.end(), Age::kOld);
+  std::fill(&table_[0], &table_[CagedHeapBase::GetAgeTableSize()], Age::kOld);
 }
 
 #endif  // defined(CPPGC_YOUNG_GENERATION)
diff --git a/deps/v8/src/heap/cppgc/caged-heap.cc b/deps/v8/src/heap/cppgc/caged-heap.cc
index 38fb59afb4dbb7..58e90d4d6063b5 100644
--- a/deps/v8/src/heap/cppgc/caged-heap.cc
+++ b/deps/v8/src/heap/cppgc/caged-heap.cc
@@ -13,6 +13,7 @@
 #error "Must be compiled with caged heap enabled"
 #endif
 
+#include "include/cppgc/internal/api-constants.h"
 #include "include/cppgc/internal/caged-heap-local-data.h"
 #include "include/cppgc/member.h"
 #include "include/cppgc/platform.h"
@@ -29,38 +30,43 @@
 namespace cppgc {
 namespace internal {
 
-static_assert(api_constants::kCagedHeapReservationSize ==
-              kCagedHeapReservationSize);
-static_assert(api_constants::kCagedHeapReservationAlignment ==
-              kCagedHeapReservationAlignment);
-
 uintptr_t CagedHeapBase::g_heap_base_ = 0u;
+size_t CagedHeapBase::g_age_table_size_ = 0u;
 
 CagedHeap* CagedHeap::instance_ = nullptr;
 
 namespace {
 
 VirtualMemory ReserveCagedHeap(PageAllocator& platform_allocator) {
-  DCHECK_EQ(0u,
-            kCagedHeapReservationSize % platform_allocator.AllocatePageSize());
+  DCHECK_EQ(0u, api_constants::kCagedHeapMaxReservationSize %
+                    platform_allocator.AllocatePageSize());
 
   static constexpr size_t kAllocationTries = 4;
   for (size_t i = 0; i < kAllocationTries; ++i) {
 #if defined(CPPGC_POINTER_COMPRESSION)
-    // If pointer compression is enabled, reserve 2x of cage size and leave only
-    // the upper half. This is needed to make sure that compressed pointers have
-    // the most significant bit set to 1, so that on decompression the bit will
-    // be sign-extended. This saves us a branch and 'or' operation during
-    // compression.
+    // We want compressed pointers to have the most significant bit set to 1.
+    // That way, on decompression the bit will be sign-extended. This saves us a
+    // branch and 'or' operation during compression.
+    //
+    // We achieve this by over-reserving the cage and selecting a sub-region
+    // from the upper half of the reservation that has the bit pattern we need.
+    // Examples:
+    // - For a 4GB cage with 1 bit of pointer compression shift, reserve 8GB and
+    // use the upper 4GB.
+    // - For an 8GB cage with 3 bits of pointer compression shift, reserve 32GB
+    // and use the first 8GB of the upper 16 GB.
+    //
     // TODO(chromium:1325007): Provide API in PageAllocator to left trim
-    // allocations and return the half of the reservation back to the OS.
-    static constexpr size_t kTryReserveSize = 2 * kCagedHeapReservationSize;
+    // allocations and return unused portions of the reservation back to the OS.
+    static constexpr size_t kTryReserveSize =
+        2 * api_constants::kCagedHeapMaxReservationSize;
     static constexpr size_t kTryReserveAlignment =
-        2 * kCagedHeapReservationAlignment;
+        2 * api_constants::kCagedHeapReservationAlignment;
 #else   // !defined(CPPGC_POINTER_COMPRESSION)
-    static constexpr size_t kTryReserveSize = kCagedHeapReservationSize;
+    static constexpr size_t kTryReserveSize =
+        api_constants::kCagedHeapMaxReservationSize;
     static constexpr size_t kTryReserveAlignment =
-        kCagedHeapReservationAlignment;
+        api_constants::kCagedHeapReservationAlignment;
 #endif  // !defined(CPPGC_POINTER_COMPRESSION)
     void* hint = reinterpret_cast<void*>(RoundDown(
         reinterpret_cast<uintptr_t>(platform_allocator.GetRandomMmapAddr()),
@@ -77,8 +83,10 @@ VirtualMemory ReserveCagedHeap(PageAllocator& platform_allocator) {
 }  // namespace
 
 // static
-void CagedHeap::InitializeIfNeeded(PageAllocator& platform_allocator) {
-  static v8::base::LeakyObject<CagedHeap> caged_heap(platform_allocator);
+void CagedHeap::InitializeIfNeeded(PageAllocator& platform_allocator,
+                                   size_t desired_heap_size) {
+  static v8::base::LeakyObject<CagedHeap> caged_heap(platform_allocator,
+                                                     desired_heap_size);
 }
 
 // static
@@ -87,12 +95,16 @@ CagedHeap& CagedHeap::Instance() {
   return *instance_;
 }
 
-CagedHeap::CagedHeap(PageAllocator& platform_allocator)
+CagedHeap::CagedHeap(PageAllocator& platform_allocator,
+                     size_t desired_heap_size)
     : reserved_area_(ReserveCagedHeap(platform_allocator)) {
   using CagedAddress = CagedHeap::AllocatorType::Address;
 
 #if defined(CPPGC_POINTER_COMPRESSION)
-  static constexpr size_t kBaseOffset = kCagedHeapReservationSize;
+  // Pick a base offset according to pointer compression shift. See comment in
+  // ReserveCagedHeap().
+  static constexpr size_t kBaseOffset =
+      api_constants::kCagedHeapMaxReservationSize;
 #else   // !defined(CPPGC_POINTER_COMPRESSION)
   static constexpr size_t kBaseOffset = 0;
 #endif  //! defined(CPPGC_POINTER_COMPRESSION)
@@ -108,27 +120,34 @@ CagedHeap::CagedHeap(PageAllocator& platform_allocator)
   CageBaseGlobalUpdater::UpdateCageBase(CagedHeapBase::g_heap_base_);
 #endif  // defined(CPPGC_POINTER_COMPRESSION)
 
+  const size_t total_heap_size = std::clamp<size_t>(
+      v8::base::bits::RoundUpToPowerOfTwo64(desired_heap_size),
+      api_constants::kCagedHeapDefaultReservationSize,
+      api_constants::kCagedHeapMaxReservationSize);
+
+  const size_t local_data_size =
+      CagedHeapLocalData::CalculateLocalDataSizeForHeapSize(total_heap_size);
   if (!platform_allocator.SetPermissions(
           cage_start,
-          RoundUp(sizeof(CagedHeapLocalData),
-                  platform_allocator.CommitPageSize()),
+          RoundUp(local_data_size, platform_allocator.CommitPageSize()),
           PageAllocator::kReadWrite)) {
     GetGlobalOOMHandler()("Oilpan: CagedHeap commit CageHeapLocalData.");
   }
 
   const CagedAddress caged_heap_start = RoundUp(
-      reinterpret_cast<CagedAddress>(cage_start) + sizeof(CagedHeapLocalData),
-      kPageSize);
+      reinterpret_cast<CagedAddress>(cage_start) + local_data_size, kPageSize);
   const size_t local_data_size_with_padding =
       caged_heap_start - reinterpret_cast<CagedAddress>(cage_start);
 
   page_bounded_allocator_ = std::make_unique<v8::base::BoundedPageAllocator>(
       &platform_allocator, caged_heap_start,
-      kCagedHeapReservationSize - local_data_size_with_padding, kPageSize,
+      total_heap_size - local_data_size_with_padding, kPageSize,
       v8::base::PageInitializationMode::kAllocatedPagesMustBeZeroInitialized,
       v8::base::PageFreeingMode::kMakeInaccessible);
 
   instance_ = this;
+  CagedHeapBase::g_age_table_size_ = AgeTable::CalculateAgeTableSizeForHeapSize(
+      api_constants::kCagedHeapDefaultReservationSize);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/cppgc/caged-heap.h b/deps/v8/src/heap/cppgc/caged-heap.h
index dc42501ca7c4d1..c35d0c4af75cec 100644
--- a/deps/v8/src/heap/cppgc/caged-heap.h
+++ b/deps/v8/src/heap/cppgc/caged-heap.h
@@ -29,19 +29,20 @@ class V8_EXPORT_PRIVATE CagedHeap final {
 
   template <typename RetType = uintptr_t>
   static RetType OffsetFromAddress(const void* address) {
-    static_assert(
-        std::numeric_limits<RetType>::max() >= (kCagedHeapReservationSize - 1),
-        "The return type should be large enough");
+    static_assert(std::numeric_limits<RetType>::max() >=
+                      (api_constants::kCagedHeapMaxReservationSize - 1),
+                  "The return type should be large enough");
     return reinterpret_cast<uintptr_t>(address) &
-           (kCagedHeapReservationAlignment - 1);
+           (api_constants::kCagedHeapReservationAlignment - 1);
   }
 
   static uintptr_t BaseFromAddress(const void* address) {
     return reinterpret_cast<uintptr_t>(address) &
-           ~(kCagedHeapReservationAlignment - 1);
+           ~(api_constants::kCagedHeapReservationAlignment - 1);
   }
 
-  static void InitializeIfNeeded(PageAllocator&);
+  static void InitializeIfNeeded(PageAllocator& platform_allocator,
+                                 size_t desired_heap_size);
 
   static CagedHeap& Instance();
 
@@ -66,7 +67,8 @@ class V8_EXPORT_PRIVATE CagedHeap final {
   friend class v8::base::LeakyObject<CagedHeap>;
   friend class testing::TestWithHeap;
 
-  explicit CagedHeap(PageAllocator& platform_allocator);
+  explicit CagedHeap(PageAllocator& platform_allocator,
+                     size_t desired_heap_size);
 
   static CagedHeap* instance_;
 
diff --git a/deps/v8/src/heap/cppgc/compactor.cc b/deps/v8/src/heap/cppgc/compactor.cc
index 68ee147dda8798..895b7925af6246 100644
--- a/deps/v8/src/heap/cppgc/compactor.cc
+++ b/deps/v8/src/heap/cppgc/compactor.cc
@@ -39,13 +39,14 @@ class MovableReferences final {
   using MovableReference = CompactionWorklists::MovableReference;
 
  public:
-  explicit MovableReferences(HeapBase& heap) : heap_(heap) {}
+  explicit MovableReferences(HeapBase& heap)
+      : heap_(heap), heap_has_move_listeners_(heap.HasMoveListeners()) {}
 
   // Adds a slot for compaction. Filters slots in dead objects.
   void AddOrFilter(MovableReference*);
 
   // Relocates a backing store |from| -> |to|.
-  void Relocate(Address from, Address to);
+  void Relocate(Address from, Address to, size_t size_including_header);
 
   // Relocates interior slots in a backing store that is moved |from| -> |to|.
   void RelocateInteriorReferences(Address from, Address to, size_t size);
@@ -70,6 +71,8 @@ class MovableReferences final {
   // - Upon moving an object this value is adjusted accordingly.
   std::map<MovableReference*, Address> interior_movable_references_;
 
+  const bool heap_has_move_listeners_;
+
 #if DEBUG
   // The following two collections are used to allow refer back from a slot to
   // an already moved object.
@@ -134,11 +137,18 @@ void MovableReferences::AddOrFilter(MovableReference* slot) {
 #endif  // DEBUG
 }
 
-void MovableReferences::Relocate(Address from, Address to) {
+void MovableReferences::Relocate(Address from, Address to,
+                                 size_t size_including_header) {
 #if DEBUG
   moved_objects_.insert(from);
 #endif  // DEBUG
 
+  if (V8_UNLIKELY(heap_has_move_listeners_)) {
+    heap_.CallMoveListeners(from - sizeof(HeapObjectHeader),
+                            to - sizeof(HeapObjectHeader),
+                            size_including_header);
+  }
+
   // Interior slots always need to be processed for moved objects.
   // Consider an object A with slot A.x pointing to value B where A is
   // allocated on a movable page itself. When B is finally moved, it needs to
@@ -257,7 +267,8 @@ class CompactionState final {
       else
         memcpy(compact_frontier, header, size);
       movable_references_.Relocate(header + sizeof(HeapObjectHeader),
-                                   compact_frontier + sizeof(HeapObjectHeader));
+                                   compact_frontier + sizeof(HeapObjectHeader),
+                                   size);
     }
     current_page_->object_start_bitmap().SetBit(compact_frontier);
     used_bytes_in_current_page_ += size;
diff --git a/deps/v8/src/heap/cppgc/concurrent-marker.cc b/deps/v8/src/heap/cppgc/concurrent-marker.cc
index 0a02ddf61f8df0..2c9401b683b673 100644
--- a/deps/v8/src/heap/cppgc/concurrent-marker.cc
+++ b/deps/v8/src/heap/cppgc/concurrent-marker.cc
@@ -5,9 +5,8 @@
 #include "src/heap/cppgc/concurrent-marker.h"
 
 #include "include/cppgc/platform.h"
+#include "src/heap/cppgc/heap-base.h"
 #include "src/heap/cppgc/heap-object-header.h"
-#include "src/heap/cppgc/heap.h"
-#include "src/heap/cppgc/liveness-broker.h"
 #include "src/heap/cppgc/marking-state.h"
 #include "src/heap/cppgc/marking-visitor.h"
 #include "src/heap/cppgc/stats-collector.h"
@@ -26,7 +25,7 @@ template <size_t kDeadlineCheckInterval = kDefaultDeadlineCheckInterval,
           typename WorklistLocal, typename Callback>
 bool DrainWorklistWithYielding(
     JobDelegate* job_delegate, ConcurrentMarkingState& marking_state,
-    IncrementalMarkingSchedule& incremental_marking_schedule,
+    heap::base::IncrementalMarkingSchedule& incremental_marking_schedule,
     WorklistLocal& worklist_local, Callback callback) {
   return DrainWorklistWithPredicate<kDeadlineCheckInterval>(
       [&incremental_marking_schedule, &marking_state, job_delegate]() {
@@ -84,7 +83,7 @@ void ConcurrentMarkingTask::Run(JobDelegate* job_delegate) {
       concurrent_marker_.CreateConcurrentMarkingVisitor(
           concurrent_marking_state);
   ProcessWorklists(job_delegate, concurrent_marking_state,
-                   *concurrent_marking_visitor.get());
+                   *concurrent_marking_visitor);
   concurrent_marker_.incremental_marking_schedule().AddConcurrentlyMarkedBytes(
       concurrent_marking_state.RecentlyMarkedBytes());
   concurrent_marking_state.Publish();
@@ -174,7 +173,7 @@ void ConcurrentMarkingTask::ProcessWorklists(
 
 ConcurrentMarkerBase::ConcurrentMarkerBase(
     HeapBase& heap, MarkingWorklists& marking_worklists,
-    IncrementalMarkingSchedule& incremental_marking_schedule,
+    heap::base::IncrementalMarkingSchedule& incremental_marking_schedule,
     cppgc::Platform* platform)
     : heap_(heap),
       marking_worklists_(marking_worklists),
@@ -252,7 +251,8 @@ void ConcurrentMarkerBase::IncreaseMarkingPriorityIfNeeded() {
               last_concurrently_marked_bytes_update_)
                  .InMilliseconds() >
              kMarkingScheduleRatioBeforeConcurrentPriorityIncrease *
-                 IncrementalMarkingSchedule::kEstimatedMarkingTimeMs) {
+                 heap::base::IncrementalMarkingSchedule::kEstimatedMarkingTime
+                     .InMillisecondsF()) {
     concurrent_marking_handle_->UpdatePriority(
         cppgc::TaskPriority::kUserBlocking);
     concurrent_marking_priority_increased_ = true;
diff --git a/deps/v8/src/heap/cppgc/concurrent-marker.h b/deps/v8/src/heap/cppgc/concurrent-marker.h
index 484bc06a530e35..be2f19ac0cc6cd 100644
--- a/deps/v8/src/heap/cppgc/concurrent-marker.h
+++ b/deps/v8/src/heap/cppgc/concurrent-marker.h
@@ -6,7 +6,7 @@
 #define V8_HEAP_CPPGC_CONCURRENT_MARKER_H_
 
 #include "include/cppgc/platform.h"
-#include "src/heap/cppgc/incremental-marking-schedule.h"
+#include "src/heap/base/incremental-marking-schedule.h"
 #include "src/heap/cppgc/marking-state.h"
 #include "src/heap/cppgc/marking-visitor.h"
 #include "src/heap/cppgc/marking-worklists.h"
@@ -17,7 +17,8 @@ namespace internal {
 class V8_EXPORT_PRIVATE ConcurrentMarkerBase {
  public:
   ConcurrentMarkerBase(HeapBase&, MarkingWorklists&,
-                       IncrementalMarkingSchedule&, cppgc::Platform*);
+                       heap::base::IncrementalMarkingSchedule&,
+                       cppgc::Platform*);
   virtual ~ConcurrentMarkerBase();
 
   ConcurrentMarkerBase(const ConcurrentMarkerBase&) = delete;
@@ -36,7 +37,7 @@ class V8_EXPORT_PRIVATE ConcurrentMarkerBase {
 
   HeapBase& heap() const { return heap_; }
   MarkingWorklists& marking_worklists() const { return marking_worklists_; }
-  IncrementalMarkingSchedule& incremental_marking_schedule() const {
+  heap::base::IncrementalMarkingSchedule& incremental_marking_schedule() const {
     return incremental_marking_schedule_;
   }
 
@@ -49,7 +50,7 @@ class V8_EXPORT_PRIVATE ConcurrentMarkerBase {
  private:
   HeapBase& heap_;
   MarkingWorklists& marking_worklists_;
-  IncrementalMarkingSchedule& incremental_marking_schedule_;
+  heap::base::IncrementalMarkingSchedule& incremental_marking_schedule_;
   cppgc::Platform* const platform_;
 
   // The job handle doubles as flag to denote concurrent marking was started.
@@ -62,9 +63,10 @@ class V8_EXPORT_PRIVATE ConcurrentMarkerBase {
 
 class V8_EXPORT_PRIVATE ConcurrentMarker : public ConcurrentMarkerBase {
  public:
-  ConcurrentMarker(HeapBase& heap, MarkingWorklists& marking_worklists,
-                   IncrementalMarkingSchedule& incremental_marking_schedule,
-                   cppgc::Platform* platform)
+  ConcurrentMarker(
+      HeapBase& heap, MarkingWorklists& marking_worklists,
+      heap::base::IncrementalMarkingSchedule& incremental_marking_schedule,
+      cppgc::Platform* platform)
       : ConcurrentMarkerBase(heap, marking_worklists,
                              incremental_marking_schedule, platform) {}
 
diff --git a/deps/v8/src/heap/cppgc/free-list.h b/deps/v8/src/heap/cppgc/free-list.h
index 29645c8b14021f..04d758c9fd84e6 100644
--- a/deps/v8/src/heap/cppgc/free-list.h
+++ b/deps/v8/src/heap/cppgc/free-list.h
@@ -36,8 +36,8 @@ class V8_EXPORT_PRIVATE FreeList {
   FreeList(const FreeList&) = delete;
   FreeList& operator=(const FreeList&) = delete;
 
-  FreeList(FreeList&& freelist) V8_NOEXCEPT;
-  FreeList& operator=(FreeList&& freelist) V8_NOEXCEPT;
+  FreeList(FreeList&& other) V8_NOEXCEPT;
+  FreeList& operator=(FreeList&& other) V8_NOEXCEPT;
 
   // Allocates entries which are at least of the provided size.
   Block Allocate(size_t);
diff --git a/deps/v8/src/heap/cppgc/gc-info-table.cc b/deps/v8/src/heap/cppgc/gc-info-table.cc
index 1c86fbb342e5e6..671ff8c098f670 100644
--- a/deps/v8/src/heap/cppgc/gc-info-table.cc
+++ b/deps/v8/src/heap/cppgc/gc-info-table.cc
@@ -132,7 +132,7 @@ GCInfoIndex GCInfoTable::RegisterNewGCInfo(
 
   // Check the registered index again after taking the lock as some other
   // thread may have registered the info at the same time.
-  GCInfoIndex index = registered_index.load(std::memory_order_relaxed);
+  const GCInfoIndex index = registered_index.load(std::memory_order_relaxed);
   if (index) {
     return index;
   }
@@ -141,7 +141,7 @@ GCInfoIndex GCInfoTable::RegisterNewGCInfo(
     Resize();
   }
 
-  GCInfoIndex new_index = current_index_++;
+  const GCInfoIndex new_index = current_index_++;
   CHECK_LT(new_index, GCInfoTable::kMaxIndex);
   table_[new_index] = info;
   registered_index.store(new_index, std::memory_order_release);
diff --git a/deps/v8/src/heap/cppgc/gc-info-table.h b/deps/v8/src/heap/cppgc/gc-info-table.h
index a4911d78b1206b..2551dd76719248 100644
--- a/deps/v8/src/heap/cppgc/gc-info-table.h
+++ b/deps/v8/src/heap/cppgc/gc-info-table.h
@@ -22,10 +22,14 @@ namespace internal {
 // GCInfo contains metadata for objects that are instantiated from classes that
 // inherit from GarbageCollected.
 struct GCInfo final {
+  constexpr GCInfo(FinalizationCallback finalize, TraceCallback trace,
+                   NameCallback name)
+      : finalize(finalize), trace(trace), name(name) {}
+
   FinalizationCallback finalize;
   TraceCallback trace;
   NameCallback name;
-  bool has_v_table;
+  size_t padding = 0;
 };
 
 class V8_EXPORT GCInfoTable final {
diff --git a/deps/v8/src/heap/cppgc/gc-info.cc b/deps/v8/src/heap/cppgc/gc-info.cc
index fcbf6ac3561055..b9512dde52a48f 100644
--- a/deps/v8/src/heap/cppgc/gc-info.cc
+++ b/deps/v8/src/heap/cppgc/gc-info.cc
@@ -8,8 +8,7 @@
 #include "include/v8config.h"
 #include "src/heap/cppgc/gc-info-table.h"
 
-namespace cppgc {
-namespace internal {
+namespace cppgc::internal {
 
 namespace {
 
@@ -20,70 +19,36 @@ HeapObjectName GetHiddenName(const void*, HeapObjectNameForUnnamedObject) {
 }  // namespace
 
 // static
-void EnsureGCInfoIndexTrait::EnsureGCInfoIndexPolymorphic(
+GCInfoIndex EnsureGCInfoIndexTrait::EnsureGCInfoIndex(
     std::atomic<GCInfoIndex>& registered_index, TraceCallback trace_callback,
     FinalizationCallback finalization_callback, NameCallback name_callback) {
-  GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
+  return GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
       registered_index,
-      {finalization_callback, trace_callback, name_callback, true});
+      GCInfo(finalization_callback, trace_callback, name_callback));
 }
 
 // static
-void EnsureGCInfoIndexTrait::EnsureGCInfoIndexPolymorphic(
+GCInfoIndex EnsureGCInfoIndexTrait::EnsureGCInfoIndex(
     std::atomic<GCInfoIndex>& registered_index, TraceCallback trace_callback,
     FinalizationCallback finalization_callback) {
-  GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
+  return GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
       registered_index,
-      {finalization_callback, trace_callback, GetHiddenName, true});
+      GCInfo(finalization_callback, trace_callback, GetHiddenName));
 }
 
 // static
-void EnsureGCInfoIndexTrait::EnsureGCInfoIndexPolymorphic(
+GCInfoIndex EnsureGCInfoIndexTrait::EnsureGCInfoIndex(
     std::atomic<GCInfoIndex>& registered_index, TraceCallback trace_callback,
     NameCallback name_callback) {
-  GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
-      registered_index, {nullptr, trace_callback, name_callback, true});
+  return GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
+      registered_index, GCInfo(nullptr, trace_callback, name_callback));
 }
 
 // static
-void EnsureGCInfoIndexTrait::EnsureGCInfoIndexPolymorphic(
+GCInfoIndex EnsureGCInfoIndexTrait::EnsureGCInfoIndex(
     std::atomic<GCInfoIndex>& registered_index, TraceCallback trace_callback) {
-  GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
-      registered_index, {nullptr, trace_callback, GetHiddenName, true});
+  return GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
+      registered_index, GCInfo(nullptr, trace_callback, GetHiddenName));
 }
 
-// static
-void EnsureGCInfoIndexTrait::EnsureGCInfoIndexNonPolymorphic(
-    std::atomic<GCInfoIndex>& registered_index, TraceCallback trace_callback,
-    FinalizationCallback finalization_callback, NameCallback name_callback) {
-  GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
-      registered_index,
-      {finalization_callback, trace_callback, name_callback, false});
-}
-
-// static
-void EnsureGCInfoIndexTrait::EnsureGCInfoIndexNonPolymorphic(
-    std::atomic<GCInfoIndex>& registered_index, TraceCallback trace_callback,
-    FinalizationCallback finalization_callback) {
-  GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
-      registered_index,
-      {finalization_callback, trace_callback, GetHiddenName, false});
-}
-
-// static
-void EnsureGCInfoIndexTrait::EnsureGCInfoIndexNonPolymorphic(
-    std::atomic<GCInfoIndex>& registered_index, TraceCallback trace_callback,
-    NameCallback name_callback) {
-  GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
-      registered_index, {nullptr, trace_callback, name_callback, false});
-}
-
-// static
-void EnsureGCInfoIndexTrait::EnsureGCInfoIndexNonPolymorphic(
-    std::atomic<GCInfoIndex>& registered_index, TraceCallback trace_callback) {
-  GlobalGCInfoTable::GetMutable().RegisterNewGCInfo(
-      registered_index, {nullptr, trace_callback, GetHiddenName, false});
-}
-
-}  // namespace internal
-}  // namespace cppgc
+}  // namespace cppgc::internal
diff --git a/deps/v8/src/heap/cppgc/globals.h b/deps/v8/src/heap/cppgc/globals.h
index 67ccd37e2550e8..c5dd401db1c881 100644
--- a/deps/v8/src/heap/cppgc/globals.h
+++ b/deps/v8/src/heap/cppgc/globals.h
@@ -73,13 +73,6 @@ constexpr size_t kLargeObjectSizeThreshold = kPageSize / 2;
 constexpr GCInfoIndex kFreeListGCInfoIndex = 0;
 constexpr size_t kFreeListEntrySize = 2 * sizeof(uintptr_t);
 
-#if defined(CPPGC_2GB_CAGE)
-constexpr size_t kCagedHeapReservationSize = static_cast<size_t>(2) * kGB;
-#else   // !defined(CPPGC_2GB_CAGE)
-constexpr size_t kCagedHeapReservationSize = static_cast<size_t>(4) * kGB;
-#endif  // !defined(CPPGC_2GB_CAGE)
-constexpr size_t kCagedHeapReservationAlignment = kCagedHeapReservationSize;
-
 #if defined(CPPGC_POINTER_COMPRESSION)
 constexpr size_t kSlotSize = sizeof(uint32_t);
 #else   // !defined(CPPGC_POINTER_COMPRESSION)
diff --git a/deps/v8/src/heap/cppgc/heap-base.cc b/deps/v8/src/heap/cppgc/heap-base.cc
index bf76376939f2bd..8bc01353c0c4f3 100644
--- a/deps/v8/src/heap/cppgc/heap-base.cc
+++ b/deps/v8/src/heap/cppgc/heap-base.cc
@@ -108,7 +108,7 @@ HeapBase::HeapBase(
       lsan_page_allocator_(std::make_unique<v8::base::LsanPageAllocator>(
           platform_->GetPageAllocator())),
 #endif  // LEAK_SANITIZER
-      page_backend_(InitializePageBackend(*page_allocator(), *oom_handler_)),
+      page_backend_(InitializePageBackend(*page_allocator())),
       stats_collector_(std::make_unique<StatsCollector>(platform_.get())),
       stack_(std::make_unique<heap::base::Stack>(
           v8::base::Stack::GetStackStart())),
@@ -118,10 +118,10 @@ HeapBase::HeapBase(
                         *prefinalizer_handler_, *oom_handler_,
                         garbage_collector),
       sweeper_(*this),
-      strong_persistent_region_(*oom_handler_.get()),
-      weak_persistent_region_(*oom_handler_.get()),
-      strong_cross_thread_persistent_region_(*oom_handler_.get()),
-      weak_cross_thread_persistent_region_(*oom_handler_.get()),
+      strong_persistent_region_(*oom_handler_),
+      weak_persistent_region_(*oom_handler_),
+      strong_cross_thread_persistent_region_(*oom_handler_),
+      weak_cross_thread_persistent_region_(*oom_handler_),
 #if defined(CPPGC_YOUNG_GENERATION)
       remembered_set_(*this),
 #endif  // defined(CPPGC_YOUNG_GENERATION)
@@ -148,13 +148,13 @@ size_t HeapBase::ObjectPayloadSize() const {
 
 // static
 std::unique_ptr<PageBackend> HeapBase::InitializePageBackend(
-    PageAllocator& allocator, FatalOutOfMemoryHandler& oom_handler) {
+    PageAllocator& allocator) {
 #if defined(CPPGC_CAGED_HEAP)
   auto& caged_heap = CagedHeap::Instance();
-  return std::make_unique<PageBackend>(
-      caged_heap.page_allocator(), caged_heap.page_allocator(), oom_handler);
+  return std::make_unique<PageBackend>(caged_heap.page_allocator(),
+                                       caged_heap.page_allocator());
 #else   // !CPPGC_CAGED_HEAP
-  return std::make_unique<PageBackend>(allocator, allocator, oom_handler);
+  return std::make_unique<PageBackend>(allocator, allocator);
 #endif  // !CPPGC_CAGED_HEAP
 }
 
@@ -218,8 +218,11 @@ void HeapBase::ResetRememberedSet() {
 #endif  // defined(CPPGC_YOUNG_GENERATION)
 
 void HeapBase::Terminate() {
-  DCHECK(!IsMarking());
+  CHECK(!IsMarking());
   CHECK(!in_disallow_gc_scope());
+  // Cannot use IsGCAllowed() as `Terminate()` will be invoked after detaching
+  // which implies GC is prohibited at this point.
+  CHECK(!sweeper().IsSweepingOnMutatorThread());
 
   sweeper().FinishIfRunning();
 
@@ -234,10 +237,7 @@ void HeapBase::Terminate() {
   constexpr size_t kMaxTerminationGCs = 20;
   size_t gc_count = 0;
   bool more_termination_gcs_needed = false;
-
   do {
-    CHECK_LT(gc_count++, kMaxTerminationGCs);
-
     // Clear root sets.
     strong_persistent_region_.ClearAllUsedNodes();
     weak_persistent_region_.ClearAllUsedNodes();
@@ -277,15 +277,20 @@ void HeapBase::Terminate() {
           return strong_cross_thread_persistent_region_.NodesInUse() ||
                  weak_cross_thread_persistent_region_.NodesInUse();
         }();
-  } while (more_termination_gcs_needed);
-
-  object_allocator().ResetLinearAllocationBuffers();
-  disallow_gc_scope_++;
+    gc_count++;
+  } while (more_termination_gcs_needed && (gc_count < kMaxTerminationGCs));
 
   CHECK_EQ(0u, strong_persistent_region_.NodesInUse());
   CHECK_EQ(0u, weak_persistent_region_.NodesInUse());
-  CHECK_EQ(0u, strong_cross_thread_persistent_region_.NodesInUse());
-  CHECK_EQ(0u, weak_cross_thread_persistent_region_.NodesInUse());
+  {
+    PersistentRegionLock guard;
+    CHECK_EQ(0u, strong_cross_thread_persistent_region_.NodesInUse());
+    CHECK_EQ(0u, weak_cross_thread_persistent_region_.NodesInUse());
+  }
+  CHECK_LE(gc_count, kMaxTerminationGCs);
+
+  object_allocator().ResetLinearAllocationBuffers();
+  disallow_gc_scope_++;
 }
 
 HeapStatistics HeapBase::CollectStatistics(
@@ -304,6 +309,33 @@ HeapStatistics HeapBase::CollectStatistics(
   return HeapStatisticsCollector().CollectDetailedStatistics(this);
 }
 
+void HeapBase::CallMoveListeners(Address from, Address to,
+                                 size_t size_including_header) {
+  for (const auto& listener : move_listeners_) {
+    listener->OnMove(from, to, size_including_header);
+  }
+}
+
+void HeapBase::RegisterMoveListener(MoveListener* listener) {
+  // Registering the same listener multiple times would work, but probably
+  // indicates a mistake in the component requesting the registration.
+  DCHECK_EQ(std::find(move_listeners_.begin(), move_listeners_.end(), listener),
+            move_listeners_.end());
+  move_listeners_.push_back(listener);
+}
+
+void HeapBase::UnregisterMoveListener(MoveListener* listener) {
+  auto it =
+      std::remove(move_listeners_.begin(), move_listeners_.end(), listener);
+  move_listeners_.erase(it, move_listeners_.end());
+}
+
+bool HeapBase::IsGCAllowed() const {
+  // GC is prohibited in a GC forbidden scope, or when currently sweeping an
+  // object.
+  return !sweeper().IsSweepingOnMutatorThread() && !in_no_gc_scope();
+}
+
 ClassNameAsHeapObjectNameScope::ClassNameAsHeapObjectNameScope(HeapBase& heap)
     : heap_(heap),
       saved_heap_object_name_value_(heap_.name_of_unnamed_object()) {
diff --git a/deps/v8/src/heap/cppgc/heap-base.h b/deps/v8/src/heap/cppgc/heap-base.h
index ac1dd3ff5b9d5a..756787b5ce893d 100644
--- a/deps/v8/src/heap/cppgc/heap-base.h
+++ b/deps/v8/src/heap/cppgc/heap-base.h
@@ -66,6 +66,15 @@ class StatsCollector;
 
 enum class HeapObjectNameForUnnamedObject : uint8_t;
 
+class MoveListener {
+ public:
+  // This function may be called simultaneously on multiple threads.
+  // Implementations must not attempt to allocate or do any other actions
+  // which could trigger reentrant GC.
+  virtual void OnMove(Address from, Address to,
+                      size_t size_including_header) = 0;
+};
+
 // Base class for heap implementations.
 class V8_EXPORT_PRIVATE HeapBase : public cppgc::HeapHandle {
  public:
@@ -219,20 +228,36 @@ class V8_EXPORT_PRIVATE HeapBase : public cppgc::HeapHandle {
     name_for_unnamed_object_ = value;
   }
 
+  // Callback support so that other components can listen to when objects are
+  // moved.
+  bool HasMoveListeners() const { return !move_listeners_.empty(); }
+  void CallMoveListeners(Address from, Address to,
+                         size_t size_including_header);
+  void RegisterMoveListener(MoveListener* listener);
+  void UnregisterMoveListener(MoveListener* listener);
+
   void set_incremental_marking_in_progress(bool value) {
     is_incremental_marking_in_progress_ = value;
   }
 
+  void EnterNoGCScope() { ++no_gc_scope_; }
+  void LeaveNoGCScope() {
+    DCHECK_GT(no_gc_scope_, 0);
+    --no_gc_scope_;
+  }
+
   using HeapHandle::is_incremental_marking_in_progress;
 
  protected:
   static std::unique_ptr<PageBackend> InitializePageBackend(
-      PageAllocator& allocator, FatalOutOfMemoryHandler& oom_handler);
+      PageAllocator& allocator);
 
   // Used by the incremental scheduler to finalize a GC if supported.
   virtual void FinalizeIncrementalGarbageCollectionIfNeeded(
       cppgc::Heap::StackState) = 0;
 
+  virtual bool IsGCAllowed() const;
+
   bool in_no_gc_scope() const { return no_gc_scope_ > 0; }
 
   bool IsMarking() const { return marker_.get(); }
@@ -298,9 +323,10 @@ class V8_EXPORT_PRIVATE HeapBase : public cppgc::HeapHandle {
   HeapObjectNameForUnnamedObject name_for_unnamed_object_ =
       HeapObjectNameForUnnamedObject::kUseHiddenName;
 
+  std::vector<MoveListener*> move_listeners_;
+
   friend class MarkerBase::IncrementalMarkingTask;
   friend class cppgc::subtle::DisallowGarbageCollectionScope;
-  friend class cppgc::subtle::NoGarbageCollectionScope;
   friend class cppgc::testing::Heap;
   friend class cppgc::testing::OverrideEmbedderStackStateScope;
 };
diff --git a/deps/v8/src/heap/cppgc/heap-config.h b/deps/v8/src/heap/cppgc/heap-config.h
index a89581387bff69..c9fbfbf9fb7d70 100644
--- a/deps/v8/src/heap/cppgc/heap-config.h
+++ b/deps/v8/src/heap/cppgc/heap-config.h
@@ -6,6 +6,7 @@
 #define V8_HEAP_CPPGC_HEAP_CONFIG_H_
 
 #include "include/cppgc/heap.h"
+#include "src/base/platform/time.h"
 
 namespace cppgc::internal {
 
@@ -29,6 +30,8 @@ struct MarkingConfig {
   StackState stack_state = StackState::kMayContainHeapPointers;
   MarkingType marking_type = MarkingType::kIncremental;
   IsForcedGC is_forced_gc = IsForcedGC::kNotForced;
+  v8::base::TimeDelta incremental_task_delay = v8::base::TimeDelta();
+  bool bailout_of_marking_when_ahead_of_schedule = false;
 };
 
 struct SweepingConfig {
diff --git a/deps/v8/src/heap/cppgc/heap-consistency.cc b/deps/v8/src/heap/cppgc/heap-consistency.cc
index 504caa6f0ddd62..527994c1a77171 100644
--- a/deps/v8/src/heap/cppgc/heap-consistency.cc
+++ b/deps/v8/src/heap/cppgc/heap-consistency.cc
@@ -44,14 +44,13 @@ DisallowGarbageCollectionScope::~DisallowGarbageCollectionScope() {
 // static
 void NoGarbageCollectionScope::Enter(cppgc::HeapHandle& heap_handle) {
   auto& heap_base = internal::HeapBase::From(heap_handle);
-  heap_base.no_gc_scope_++;
+  heap_base.EnterNoGCScope();
 }
 
 // static
 void NoGarbageCollectionScope::Leave(cppgc::HeapHandle& heap_handle) {
   auto& heap_base = internal::HeapBase::From(heap_handle);
-  DCHECK_GT(heap_base.no_gc_scope_, 0);
-  heap_base.no_gc_scope_--;
+  heap_base.LeaveNoGCScope();
 }
 
 NoGarbageCollectionScope::NoGarbageCollectionScope(
diff --git a/deps/v8/src/heap/cppgc/heap-growing.cc b/deps/v8/src/heap/cppgc/heap-growing.cc
index 0af0119863aebd..f38d360340be53 100644
--- a/deps/v8/src/heap/cppgc/heap-growing.cc
+++ b/deps/v8/src/heap/cppgc/heap-growing.cc
@@ -9,9 +9,9 @@
 
 #include "include/cppgc/platform.h"
 #include "src/base/macros.h"
+#include "src/heap/base/incremental-marking-schedule.h"
 #include "src/heap/cppgc/globals.h"
 #include "src/heap/cppgc/heap.h"
-#include "src/heap/cppgc/incremental-marking-schedule.h"
 #include "src/heap/cppgc/stats-collector.h"
 #include "src/heap/cppgc/task-handle.h"
 
@@ -124,7 +124,8 @@ void HeapGrowing::HeapGrowingImpl::ConfigureLimit(
   //    essentially always running and write barriers are always active (in
   //    case allocation rate is very high).
   size_t estimated_bytes_allocated_during_incremental_gc =
-      std::ceil(IncrementalMarkingSchedule::kEstimatedMarkingTimeMs *
+      std::ceil(heap::base::IncrementalMarkingSchedule::kEstimatedMarkingTime
+                    .InMillisecondsF() *
                 stats_collector_->GetRecentAllocationSpeedInBytesPerMs());
   size_t limit_incremental_gc_based_on_allocation_rate =
       limit_for_atomic_gc_ - estimated_bytes_allocated_during_incremental_gc;
diff --git a/deps/v8/src/heap/cppgc/heap-object-header.h b/deps/v8/src/heap/cppgc/heap-object-header.h
index 451afe84773f00..e4b1ca780637e0 100644
--- a/deps/v8/src/heap/cppgc/heap-object-header.h
+++ b/deps/v8/src/heap/cppgc/heap-object-header.h
@@ -11,6 +11,7 @@
 
 #include "include/cppgc/allocation.h"
 #include "include/cppgc/internal/gc-info.h"
+#include "include/cppgc/internal/member-storage.h"
 #include "include/cppgc/internal/name-trait.h"
 #include "src/base/atomic-utils.h"
 #include "src/base/bit-field.h"
@@ -312,7 +313,11 @@ bool HeapObjectHeader::IsFinalizable() const {
 
 #if defined(CPPGC_CAGED_HEAP)
 void HeapObjectHeader::SetNextUnfinalized(HeapObjectHeader* next) {
+#if defined(CPPGC_POINTER_COMPRESSION)
+  next_unfinalized_ = CompressedPointer::Compress(next);
+#else   // !defined(CPPGC_POINTER_COMPRESSION)
   next_unfinalized_ = CagedHeap::OffsetFromAddress<uint32_t>(next);
+#endif  // !defined(CPPGC_POINTER_COMPRESSION)
 }
 
 HeapObjectHeader* HeapObjectHeader::GetNextUnfinalized(
@@ -320,9 +325,14 @@ HeapObjectHeader* HeapObjectHeader::GetNextUnfinalized(
   DCHECK(cage_base);
   DCHECK_EQ(0u,
             CagedHeap::OffsetFromAddress(reinterpret_cast<void*>(cage_base)));
+#if defined(CPPGC_POINTER_COMPRESSION)
+  return reinterpret_cast<HeapObjectHeader*>(
+      CompressedPointer::Decompress(next_unfinalized_));
+#else   // !defined(CPPGC_POINTER_COMPRESSION)
   return next_unfinalized_ ? reinterpret_cast<HeapObjectHeader*>(
                                  cage_base + next_unfinalized_)
                            : nullptr;
+#endif  // !defined(CPPGC_POINTER_COMPRESSION)
 }
 #endif  // defined(CPPGC_CAGED_HEAP)
 
diff --git a/deps/v8/src/heap/cppgc/heap.cc b/deps/v8/src/heap/cppgc/heap.cc
index 1f3e70440d6263..845f72d6cf7d85 100644
--- a/deps/v8/src/heap/cppgc/heap.cc
+++ b/deps/v8/src/heap/cppgc/heap.cc
@@ -101,7 +101,9 @@ void Heap::CollectGarbage(GCConfig config) {
   DCHECK_EQ(GCConfig::MarkingType::kAtomic, config.marking_type);
   CheckConfig(config, marking_support_, sweeping_support_);
 
-  if (in_no_gc_scope()) return;
+  if (!IsGCAllowed()) {
+    return;
+  }
 
   config_ = config;
 
@@ -162,11 +164,15 @@ void Heap::StartGarbageCollection(GCConfig config) {
 }
 
 void Heap::FinalizeGarbageCollection(StackState stack_state) {
+  stack()->SetMarkerIfNeededAndCallback(
+      [this, stack_state]() { FinalizeGarbageCollectionImpl(stack_state); });
+}
+
+void Heap::FinalizeGarbageCollectionImpl(StackState stack_state) {
   DCHECK(IsMarking());
   DCHECK(!in_no_gc_scope());
   CHECK(!in_disallow_gc_scope());
   config_.stack_state = stack_state;
-  stack()->SetMarkerToCurrentStackPosition();
   in_atomic_pause_ = true;
 
 #if defined(CPPGC_YOUNG_GENERATION)
diff --git a/deps/v8/src/heap/cppgc/heap.h b/deps/v8/src/heap/cppgc/heap.h
index 3a9e09fa5ffbcc..4622470d4fb308 100644
--- a/deps/v8/src/heap/cppgc/heap.h
+++ b/deps/v8/src/heap/cppgc/heap.h
@@ -48,6 +48,7 @@ class V8_EXPORT_PRIVATE Heap final : public HeapBase,
  private:
   void StartGarbageCollection(GCConfig);
   void FinalizeGarbageCollection(StackState);
+  void FinalizeGarbageCollectionImpl(StackState);
 
   void FinalizeIncrementalGarbageCollectionIfNeeded(StackState) final;
 
diff --git a/deps/v8/src/heap/cppgc/incremental-marking-schedule.cc b/deps/v8/src/heap/cppgc/incremental-marking-schedule.cc
deleted file mode 100644
index ce7d1aadc35193..00000000000000
--- a/deps/v8/src/heap/cppgc/incremental-marking-schedule.cc
+++ /dev/null
@@ -1,91 +0,0 @@
-// Copyright 2020 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/heap/cppgc/incremental-marking-schedule.h"
-
-#include <cmath>
-
-#include "src/heap/cppgc/globals.h"
-
-namespace cppgc {
-namespace internal {
-
-// static
-constexpr size_t IncrementalMarkingSchedule::kInvalidLastEstimatedLiveBytes;
-
-const double IncrementalMarkingSchedule::kEstimatedMarkingTimeMs = 500.0;
-const size_t IncrementalMarkingSchedule::kMinimumMarkedBytesPerIncrementalStep =
-    64 * kKB;
-
-void IncrementalMarkingSchedule::NotifyIncrementalMarkingStart() {
-  DCHECK(incremental_marking_start_time_.IsNull());
-  incremental_marking_start_time_ = v8::base::TimeTicks::Now();
-}
-
-void IncrementalMarkingSchedule::UpdateMutatorThreadMarkedBytes(
-    size_t overall_marked_bytes) {
-  mutator_thread_marked_bytes_ = overall_marked_bytes;
-}
-
-void IncrementalMarkingSchedule::AddConcurrentlyMarkedBytes(
-    size_t marked_bytes) {
-  concurrently_marked_bytes_.fetch_add(marked_bytes, std::memory_order_relaxed);
-}
-
-size_t IncrementalMarkingSchedule::GetOverallMarkedBytes() const {
-  return mutator_thread_marked_bytes_ + GetConcurrentlyMarkedBytes();
-}
-
-size_t IncrementalMarkingSchedule::GetConcurrentlyMarkedBytes() const {
-  return concurrently_marked_bytes_.load(std::memory_order_relaxed);
-}
-
-double IncrementalMarkingSchedule::GetElapsedTimeInMs(
-    v8::base::TimeTicks start_time) {
-  if (elapsed_time_for_testing_ != kNoSetElapsedTimeForTesting) {
-    double elapsed_time = elapsed_time_for_testing_;
-    elapsed_time_for_testing_ = kNoSetElapsedTimeForTesting;
-    return elapsed_time;
-  }
-  return (v8::base::TimeTicks::Now() - start_time).InMillisecondsF();
-}
-
-size_t IncrementalMarkingSchedule::GetNextIncrementalStepDuration(
-    size_t estimated_live_bytes) {
-  last_estimated_live_bytes_ = estimated_live_bytes;
-  DCHECK(!incremental_marking_start_time_.IsNull());
-  double elapsed_time_in_ms =
-      GetElapsedTimeInMs(incremental_marking_start_time_);
-  size_t actual_marked_bytes = GetOverallMarkedBytes();
-  size_t expected_marked_bytes = std::ceil(
-      estimated_live_bytes * elapsed_time_in_ms / kEstimatedMarkingTimeMs);
-  if (expected_marked_bytes < actual_marked_bytes) {
-    // Marking is ahead of schedule, incremental marking should do the minimum.
-    return kMinimumMarkedBytesPerIncrementalStep;
-  }
-  // Assuming marking will take |kEstimatedMarkingTime|, overall there will
-  // be |estimated_live_bytes| live bytes to mark, and that marking speed is
-  // constant, after |elapsed_time| the number of marked_bytes should be
-  // |estimated_live_bytes| * (|elapsed_time| / |kEstimatedMarkingTime|),
-  // denoted as |expected_marked_bytes|.  If |actual_marked_bytes| is less,
-  // i.e. marking is behind schedule, incremental marking should help "catch
-  // up" by marking (|expected_marked_bytes| - |actual_marked_bytes|).
-  return std::max(kMinimumMarkedBytesPerIncrementalStep,
-                  expected_marked_bytes - actual_marked_bytes);
-}
-
-constexpr double
-    IncrementalMarkingSchedule::kEphemeronPairsFlushingRatioIncrements;
-bool IncrementalMarkingSchedule::ShouldFlushEphemeronPairs() {
-  DCHECK_NE(kInvalidLastEstimatedLiveBytes, last_estimated_live_bytes_);
-  if (GetOverallMarkedBytes() <
-      (ephemeron_pairs_flushing_ratio_target * last_estimated_live_bytes_))
-    return false;
-  ephemeron_pairs_flushing_ratio_target +=
-      kEphemeronPairsFlushingRatioIncrements;
-  return true;
-}
-
-}  // namespace internal
-}  // namespace cppgc
diff --git a/deps/v8/src/heap/cppgc/incremental-marking-schedule.h b/deps/v8/src/heap/cppgc/incremental-marking-schedule.h
deleted file mode 100644
index 22f023e6206a15..00000000000000
--- a/deps/v8/src/heap/cppgc/incremental-marking-schedule.h
+++ /dev/null
@@ -1,61 +0,0 @@
-// Copyright 2020 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_HEAP_CPPGC_INCREMENTAL_MARKING_SCHEDULE_H_
-#define V8_HEAP_CPPGC_INCREMENTAL_MARKING_SCHEDULE_H_
-
-#include <atomic>
-
-#include "src/base/platform/time.h"
-
-namespace cppgc {
-namespace internal {
-
-class V8_EXPORT_PRIVATE IncrementalMarkingSchedule {
- public:
-  // Estimated duration of GC cycle in milliseconds.
-  static const double kEstimatedMarkingTimeMs;
-
-  // Minimum number of bytes that should be marked during an incremental
-  // marking step.
-  static const size_t kMinimumMarkedBytesPerIncrementalStep;
-
-  void NotifyIncrementalMarkingStart();
-
-  void UpdateMutatorThreadMarkedBytes(size_t);
-  void AddConcurrentlyMarkedBytes(size_t);
-
-  size_t GetOverallMarkedBytes() const;
-  size_t GetConcurrentlyMarkedBytes() const;
-
-  size_t GetNextIncrementalStepDuration(size_t);
-
-  void SetElapsedTimeForTesting(double elapsed_time) {
-    elapsed_time_for_testing_ = elapsed_time;
-  }
-
-  bool ShouldFlushEphemeronPairs();
-
- private:
-  double GetElapsedTimeInMs(v8::base::TimeTicks);
-
-  v8::base::TimeTicks incremental_marking_start_time_;
-
-  size_t mutator_thread_marked_bytes_ = 0;
-  std::atomic_size_t concurrently_marked_bytes_{0};
-
-  // Using -1 as sentinel to denote
-  static constexpr double kNoSetElapsedTimeForTesting = -1;
-  double elapsed_time_for_testing_ = kNoSetElapsedTimeForTesting;
-
-  static constexpr size_t kInvalidLastEstimatedLiveBytes = -1;
-  size_t last_estimated_live_bytes_ = kInvalidLastEstimatedLiveBytes;
-  double ephemeron_pairs_flushing_ratio_target = 0.25;
-  static constexpr double kEphemeronPairsFlushingRatioIncrements = 0.25;
-};
-
-}  // namespace internal
-}  // namespace cppgc
-
-#endif  // V8_HEAP_CPPGC_INCREMENTAL_MARKING_SCHEDULE_H_
diff --git a/deps/v8/src/heap/cppgc/marker.cc b/deps/v8/src/heap/cppgc/marker.cc
index bc715e19178d8b..003318ed613790 100644
--- a/deps/v8/src/heap/cppgc/marker.cc
+++ b/deps/v8/src/heap/cppgc/marker.cc
@@ -11,6 +11,7 @@
 #include "include/cppgc/heap-consistency.h"
 #include "include/cppgc/platform.h"
 #include "src/base/platform/time.h"
+#include "src/heap/base/incremental-marking-schedule.h"
 #include "src/heap/cppgc/globals.h"
 #include "src/heap/cppgc/heap-object-header.h"
 #include "src/heap/cppgc/heap-page.h"
@@ -19,6 +20,7 @@
 #include "src/heap/cppgc/liveness-broker.h"
 #include "src/heap/cppgc/marking-state.h"
 #include "src/heap/cppgc/marking-visitor.h"
+#include "src/heap/cppgc/marking-worklists.h"
 #include "src/heap/cppgc/process-heap.h"
 #include "src/heap/cppgc/stats-collector.h"
 #include "src/heap/cppgc/write-barrier.h"
@@ -71,8 +73,8 @@ bool DrainWorklistWithBytesAndTimeDeadline(BasicMarkingState& marking_state,
       worklist_local, callback);
 }
 
-size_t GetNextIncrementalStepDuration(IncrementalMarkingSchedule& schedule,
-                                      HeapBase& heap) {
+size_t GetNextIncrementalStepDuration(
+    heap::base::IncrementalMarkingSchedule& schedule, HeapBase& heap) {
   return schedule.GetNextIncrementalStepDuration(
       heap.stats_collector()->allocated_object_size());
 }
@@ -115,16 +117,30 @@ MarkerBase::IncrementalMarkingTask::Post(cppgc::TaskRunner* runner,
   DCHECK_IMPLIES(marker->heap().stack_support() !=
                      HeapBase::StackSupport::kSupportsConservativeStackScan,
                  runner->NonNestableTasksEnabled());
-  const auto stack_state_for_task = runner->NonNestableTasksEnabled()
-                                        ? StackState::kNoHeapPointers
-                                        : StackState::kMayContainHeapPointers;
-  auto task =
-      std::make_unique<IncrementalMarkingTask>(marker, stack_state_for_task);
+
+  const bool should_use_delayed_task =
+      !marker->config_.incremental_task_delay.IsZero() &&
+      marker->IsAheadOfSchedule();
+  const bool non_nestable_tasks_enabled = runner->NonNestableTasksEnabled();
+
+  auto task = std::make_unique<IncrementalMarkingTask>(
+      marker, non_nestable_tasks_enabled ? StackState::kNoHeapPointers
+                                         : StackState::kMayContainHeapPointers);
   auto handle = task->handle_;
-  if (runner->NonNestableTasksEnabled()) {
-    runner->PostNonNestableTask(std::move(task));
+  if (non_nestable_tasks_enabled) {
+    if (should_use_delayed_task) {
+      runner->PostNonNestableDelayedTask(
+          std::move(task), marker->config_.incremental_task_delay.InSecondsF());
+    } else {
+      runner->PostNonNestableTask(std::move(task));
+    }
   } else {
-    runner->PostTask(std::move(task));
+    if (should_use_delayed_task) {
+      runner->PostDelayedTask(
+          std::move(task), marker->config_.incremental_task_delay.InSecondsF());
+    } else {
+      runner->PostTask(std::move(task));
+    }
   }
   return handle;
 }
@@ -148,7 +164,12 @@ MarkerBase::MarkerBase(HeapBase& heap, cppgc::Platform* platform,
       platform_(platform),
       foreground_task_runner_(platform_->GetForegroundTaskRunner()),
       mutator_marking_state_(heap, marking_worklists_,
-                             heap.compactor().compaction_worklists()) {
+                             heap.compactor().compaction_worklists()),
+      schedule_(config.bailout_of_marking_when_ahead_of_schedule
+                    ? ::heap::base::IncrementalMarkingSchedule::
+                          CreateWithZeroMinimumMarkedBytesPerStep()
+                    : ::heap::base::IncrementalMarkingSchedule::
+                          CreateWithDefaultMinimumMarkedBytesPerStep()) {
   DCHECK_IMPLIES(config_.collection_type == CollectionType::kMinor,
                  heap_.generational_gc_supported());
 }
@@ -223,7 +244,7 @@ void MarkerBase::StartMarking() {
         heap().stats_collector(), StatsCollector::kMarkIncrementalStart);
 
     // Performing incremental or concurrent marking.
-    schedule_.NotifyIncrementalMarkingStart();
+    schedule_->NotifyIncrementalMarkingStart();
     // Scanning the stack is expensive so we only do it at the atomic pause.
     VisitRoots(StackState::kNoHeapPointers);
     ScheduleIncrementalMarkingTask();
@@ -253,6 +274,8 @@ void MarkerBase::EnterAtomicPause(StackState stack_state) {
   StatsCollector::EnabledScope stats_scope(heap().stats_collector(),
                                            StatsCollector::kMarkAtomicPrologue);
 
+  const MarkingConfig::MarkingType old_marking_type = config_.marking_type;
+
   if (ExitIncrementalMarkingIfNeeded(config_, heap())) {
     // Cancel remaining incremental tasks. Concurrent marking jobs are left to
     // run in parallel with the atomic pause until the mutator thread runs out
@@ -271,7 +294,7 @@ void MarkerBase::EnterAtomicPause(StackState stack_state) {
     VisitRoots(config_.stack_state);
     HandleNotFullyConstructedObjects();
   }
-  if (heap().marking_support() ==
+  if (old_marking_type ==
       MarkingConfig::MarkingType::kIncrementalAndConcurrent) {
     // Start parallel marking.
     mutator_marking_state_.Publish();
@@ -292,7 +315,7 @@ void MarkerBase::LeaveAtomicPause() {
     DCHECK(!incremental_marking_handle_);
     heap().stats_collector()->NotifyMarkingCompleted(
         // GetOverallMarkedBytes also includes concurrently marked bytes.
-        schedule_.GetOverallMarkedBytes());
+        schedule_->GetOverallMarkedBytes());
     is_marking_ = false;
   }
   {
@@ -342,7 +365,8 @@ class WeakCallbackJobTask final : public cppgc::JobTask {
   }
 
   size_t GetMaxConcurrency(size_t worker_count) const override {
-    return std::min(static_cast<size_t>(1), callback_worklist_->Size());
+    return std::min(static_cast<size_t>(1),
+                    callback_worklist_->Size() + worker_count);
   }
 
  private:
@@ -447,18 +471,18 @@ void MarkerBase::VisitRoots(StackState stack_state) {
   heap().object_allocator().ResetLinearAllocationBuffers();
 
   {
-    {
-      StatsCollector::DisabledScope inner_stats_scope(
-          heap().stats_collector(), StatsCollector::kMarkVisitPersistents);
-      RootMarkingVisitor root_marking_visitor(mutator_marking_state_);
-      heap().GetStrongPersistentRegion().Iterate(root_marking_visitor);
-    }
+    StatsCollector::DisabledScope inner_stats_scope(
+        heap().stats_collector(), StatsCollector::kMarkVisitPersistents);
+    RootMarkingVisitor root_marking_visitor(mutator_marking_state_);
+    heap().GetStrongPersistentRegion().Iterate(root_marking_visitor);
   }
 
   if (stack_state != StackState::kNoHeapPointers) {
     StatsCollector::DisabledScope stack_stats_scope(
         heap().stats_collector(), StatsCollector::kMarkVisitStack);
-    heap().stack()->IteratePointers(&stack_visitor());
+    heap().stack()->SetMarkerIfNeededAndCallback([this]() {
+      heap().stack()->IteratePointersUntilMarker(&stack_visitor());
+    });
   }
 
 #if defined(CPPGC_YOUNG_GENERATION)
@@ -546,7 +570,7 @@ bool MarkerBase::AdvanceMarkingWithLimits(v8::base::TimeDelta max_duration,
   if (!main_marking_disabled_for_testing_) {
     if (marked_bytes_limit == 0) {
       marked_bytes_limit = mutator_marking_state_.marked_bytes() +
-                           GetNextIncrementalStepDuration(schedule_, heap_);
+                           GetNextIncrementalStepDuration(*schedule_, heap_);
     }
     StatsCollector::EnabledScope deadline_scope(
         heap().stats_collector(),
@@ -559,7 +583,7 @@ bool MarkerBase::AdvanceMarkingWithLimits(v8::base::TimeDelta max_duration,
       // adjustment.
       is_done = ProcessWorklistsWithDeadline(marked_bytes_limit, deadline);
     }
-    schedule_.UpdateMutatorThreadMarkedBytes(
+    schedule_->UpdateMutatorThreadMarkedBytes(
         mutator_marking_state_.marked_bytes());
   }
   mutator_marking_state_.Publish();
@@ -583,7 +607,7 @@ bool MarkerBase::ProcessWorklistsWithDeadline(
   do {
     mutator_marking_state_.ResetDidDiscoverNewEphemeronPairs();
     if ((config_.marking_type == MarkingConfig::MarkingType::kAtomic) ||
-        schedule_.ShouldFlushEphemeronPairs()) {
+        schedule_->ShouldFlushEphemeronPairs()) {
       mutator_marking_state_.FlushDiscoveredEphemeronPairs();
     }
 
@@ -595,7 +619,7 @@ bool MarkerBase::ProcessWorklistsWithDeadline(
           heap().stats_collector(), StatsCollector::kMarkProcessBailOutObjects);
       if (!DrainWorklistWithBytesAndTimeDeadline<kDefaultDeadlineCheckInterval /
                                                  5>(
-              mutator_marking_state_, marked_bytes_deadline, time_deadline,
+              mutator_marking_state_, SIZE_MAX, time_deadline,
               mutator_marking_state_.concurrent_marking_bailout_worklist(),
               [this](
                   const MarkingWorklists::ConcurrentMarkingBailoutItem& item) {
@@ -707,6 +731,19 @@ void MarkerBase::MarkNotFullyConstructedObjects() {
   }
 }
 
+bool MarkerBase::IsAheadOfSchedule() const {
+  static constexpr size_t kNumOfBailoutObjectsForNormalTask = 512;
+  if (marking_worklists_.concurrent_marking_bailout_worklist()->Size() *
+          MarkingWorklists::ConcurrentMarkingBailoutWorklist::kMinSegmentSize >
+      kNumOfBailoutObjectsForNormalTask) {
+    return false;
+  }
+  if (schedule_->GetCurrentStepInfo().is_behind_expectation()) {
+    return false;
+  }
+  return true;
+}
+
 void MarkerBase::ClearAllWorklistsForTesting() {
   marking_worklists_.ClearForTesting();
   auto* compaction_worklists = heap_.compactor().compaction_worklists();
@@ -737,7 +774,7 @@ Marker::Marker(HeapBase& heap, cppgc::Platform* platform, MarkingConfig config)
       conservative_marking_visitor_(heap, mutator_marking_state_,
                                     marking_visitor_) {
   concurrent_marker_ = std::make_unique<ConcurrentMarker>(
-      heap_, marking_worklists_, schedule_, platform_);
+      heap_, marking_worklists_, *schedule_, platform_);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/cppgc/marker.h b/deps/v8/src/heap/cppgc/marker.h
index 7586a43957304f..dcd75ece4ab303 100644
--- a/deps/v8/src/heap/cppgc/marker.h
+++ b/deps/v8/src/heap/cppgc/marker.h
@@ -12,11 +12,11 @@
 #include "include/cppgc/visitor.h"
 #include "src/base/macros.h"
 #include "src/base/platform/time.h"
+#include "src/heap/base/incremental-marking-schedule.h"
 #include "src/heap/base/worklist.h"
 #include "src/heap/cppgc/concurrent-marker.h"
 #include "src/heap/cppgc/globals.h"
 #include "src/heap/cppgc/heap-config.h"
-#include "src/heap/cppgc/incremental-marking-schedule.h"
 #include "src/heap/cppgc/marking-state.h"
 #include "src/heap/cppgc/marking-visitor.h"
 #include "src/heap/cppgc/marking-worklists.h"
@@ -112,6 +112,9 @@ class V8_EXPORT_PRIVATE MarkerBase {
 
   bool IsMarking() const { return is_marking_; }
 
+  // Returns whether marking is considered ahead of schedule.
+  bool IsAheadOfSchedule() const;
+
   void SetMainThreadMarkingDisabledForTesting(bool);
   void WaitForConcurrentMarkingForTesting();
   void ClearAllWorklistsForTesting();
@@ -136,7 +139,13 @@ class V8_EXPORT_PRIVATE MarkerBase {
   virtual ConservativeTracingVisitor& conservative_visitor() = 0;
   virtual heap::base::StackVisitor& stack_visitor() = 0;
 
-  bool ProcessWorklistsWithDeadline(size_t, v8::base::TimeTicks);
+  // Processes the worklists with given deadlines. The deadlines are only
+  // checked every few objects.
+  // - `marked_bytes_deadline`: Only process this many bytes. Ignored for
+  //   processing concurrent bailout objects.
+  // - `time_deadline`: Time deadline that is always respected.
+  bool ProcessWorklistsWithDeadline(size_t marked_bytes_deadline,
+                                    v8::base::TimeTicks time_deadline);
 
   void VisitRoots(StackState);
 
@@ -165,8 +174,7 @@ class V8_EXPORT_PRIVATE MarkerBase {
   MutatorMarkingState mutator_marking_state_;
   bool is_marking_{false};
 
-  IncrementalMarkingSchedule schedule_;
-
+  std::unique_ptr<heap::base::IncrementalMarkingSchedule> schedule_;
   std::unique_ptr<ConcurrentMarkerBase> concurrent_marker_{nullptr};
 
   bool main_marking_disabled_for_testing_{false};
diff --git a/deps/v8/src/heap/cppgc/marking-verifier.cc b/deps/v8/src/heap/cppgc/marking-verifier.cc
index fbd7de335f666c..420518ca64de9c 100644
--- a/deps/v8/src/heap/cppgc/marking-verifier.cc
+++ b/deps/v8/src/heap/cppgc/marking-verifier.cc
@@ -39,7 +39,7 @@ MarkingVerifierBase::MarkingVerifierBase(
     HeapBase& heap, CollectionType collection_type,
     VerificationState& verification_state,
     std::unique_ptr<cppgc::Visitor> visitor)
-    : ConservativeTracingVisitor(heap, *heap.page_backend(), *visitor.get()),
+    : ConservativeTracingVisitor(heap, *heap.page_backend(), *visitor),
       verification_state_(verification_state),
       visitor_(std::move(visitor)),
       collection_type_(collection_type) {}
diff --git a/deps/v8/src/heap/cppgc/marking-visitor.cc b/deps/v8/src/heap/cppgc/marking-visitor.cc
index 544b6f8100369f..842ace2708345a 100644
--- a/deps/v8/src/heap/cppgc/marking-visitor.cc
+++ b/deps/v8/src/heap/cppgc/marking-visitor.cc
@@ -4,6 +4,7 @@
 
 #include "src/heap/cppgc/marking-visitor.h"
 
+#include "include/cppgc/internal/member-storage.h"
 #include "src/heap/cppgc/globals.h"
 #include "src/heap/cppgc/heap.h"
 #include "src/heap/cppgc/marking-state.h"
@@ -11,6 +12,8 @@
 namespace cppgc {
 namespace internal {
 
+struct Dummy;
+
 MarkingVisitorBase::MarkingVisitorBase(HeapBase& heap,
                                        BasicMarkingState& marking_state)
     : marking_state_(marking_state) {}
@@ -19,6 +22,39 @@ void MarkingVisitorBase::Visit(const void* object, TraceDescriptor desc) {
   marking_state_.MarkAndPush(object, desc);
 }
 
+void MarkingVisitorBase::VisitMultipleUncompressedMember(
+    const void* start, size_t len,
+    TraceDescriptorCallback get_trace_descriptor) {
+  const char* it = static_cast<const char*>(start);
+  const char* end = it + len * cppgc::internal::kSizeOfUncompressedMember;
+  for (; it < end; it += cppgc::internal::kSizeOfUncompressedMember) {
+    const auto* current = reinterpret_cast<const internal::RawPointer*>(it);
+    const void* object = current->LoadAtomic();
+    if (!object) continue;
+
+    marking_state_.MarkAndPush(object, get_trace_descriptor(object));
+  }
+}
+
+#if defined(CPPGC_POINTER_COMPRESSION)
+
+void MarkingVisitorBase::VisitMultipleCompressedMember(
+    const void* start, size_t len,
+    TraceDescriptorCallback get_trace_descriptor) {
+  const char* it = static_cast<const char*>(start);
+  const char* end = it + len * cppgc::internal::kSizeofCompressedMember;
+  for (; it < end; it += cppgc::internal::kSizeofCompressedMember) {
+    const auto* current =
+        reinterpret_cast<const internal::CompressedPointer*>(it);
+    const void* object = current->LoadAtomic();
+    if (!object) continue;
+
+    marking_state_.MarkAndPush(object, get_trace_descriptor(object));
+  }
+}
+
+#endif  // defined(CPPGC_POINTER_COMPRESSION)
+
 void MarkingVisitorBase::VisitWeak(const void* object, TraceDescriptor desc,
                                    WeakCallback weak_callback,
                                    const void* weak_member) {
diff --git a/deps/v8/src/heap/cppgc/marking-visitor.h b/deps/v8/src/heap/cppgc/marking-visitor.h
index 3fea6acbccb4c9..ede3d3a424bdb7 100644
--- a/deps/v8/src/heap/cppgc/marking-visitor.h
+++ b/deps/v8/src/heap/cppgc/marking-visitor.h
@@ -27,9 +27,15 @@ class V8_EXPORT_PRIVATE MarkingVisitorBase : public VisitorBase {
 
  protected:
   void Visit(const void*, TraceDescriptor) final;
+  void VisitMultipleUncompressedMember(const void*, size_t,
+                                       TraceDescriptorCallback) final;
+#if defined(CPPGC_POINTER_COMPRESSION)
+  void VisitMultipleCompressedMember(const void*, size_t,
+                                     TraceDescriptorCallback) final;
+#endif  // defined(CPPGC_POINTER_COMPRESSION)
   void VisitWeak(const void*, TraceDescriptor, WeakCallback, const void*) final;
   void VisitEphemeron(const void*, const void*, TraceDescriptor) final;
-  void VisitWeakContainer(const void* self, TraceDescriptor strong_desc,
+  void VisitWeakContainer(const void* object, TraceDescriptor strong_desc,
                           TraceDescriptor weak_desc, WeakCallback callback,
                           const void* data) final;
   void RegisterWeakCallback(WeakCallback, const void*) final;
diff --git a/deps/v8/src/heap/cppgc/marking-worklists.h b/deps/v8/src/heap/cppgc/marking-worklists.h
index 7ec2e8daf22111..443f5553377152 100644
--- a/deps/v8/src/heap/cppgc/marking-worklists.h
+++ b/deps/v8/src/heap/cppgc/marking-worklists.h
@@ -109,6 +109,10 @@ class MarkingWorklists {
   WeakCustomCallbackWorklist* weak_custom_callback_worklist() {
     return &weak_custom_callback_worklist_;
   }
+  const ConcurrentMarkingBailoutWorklist* concurrent_marking_bailout_worklist()
+      const {
+    return &concurrent_marking_bailout_worklist_;
+  }
   ConcurrentMarkingBailoutWorklist* concurrent_marking_bailout_worklist() {
     return &concurrent_marking_bailout_worklist_;
   }
diff --git a/deps/v8/src/heap/cppgc/page-memory.cc b/deps/v8/src/heap/cppgc/page-memory.cc
index 7555b688833380..24c898c9b900dd 100644
--- a/deps/v8/src/heap/cppgc/page-memory.cc
+++ b/deps/v8/src/heap/cppgc/page-memory.cc
@@ -51,14 +51,13 @@ V8_WARN_UNUSED_RESULT bool TryProtect(PageAllocator& allocator,
                                   PageAllocator::Permission::kNoAccess);
 }
 
-MemoryRegion ReserveMemoryRegion(PageAllocator& allocator,
-                                 FatalOutOfMemoryHandler& oom_handler,
-                                 size_t allocation_size) {
+v8::base::Optional<MemoryRegion> ReserveMemoryRegion(PageAllocator& allocator,
+                                                     size_t allocation_size) {
   void* region_memory =
       allocator.AllocatePages(nullptr, allocation_size, kPageSize,
                               PageAllocator::Permission::kNoAccess);
   if (!region_memory) {
-    oom_handler("Oilpan: Reserving memory.");
+    return v8::base::nullopt;
   }
   const MemoryRegion reserved_region(static_cast<Address>(region_memory),
                                      allocation_size);
@@ -88,14 +87,21 @@ PageMemoryRegion::~PageMemoryRegion() {
 // static
 constexpr size_t NormalPageMemoryRegion::kNumPageRegions;
 
-NormalPageMemoryRegion::NormalPageMemoryRegion(
-    PageAllocator& allocator, FatalOutOfMemoryHandler& oom_handler)
-    : PageMemoryRegion(
-          allocator,
-          ReserveMemoryRegion(allocator, oom_handler,
-                              RoundUp(kPageSize * kNumPageRegions,
-                                      allocator.AllocatePageSize())),
-          false) {
+// static
+std::unique_ptr<NormalPageMemoryRegion> NormalPageMemoryRegion::Create(
+    PageAllocator& allocator) {
+  const auto region = ReserveMemoryRegion(
+      allocator,
+      RoundUp(kPageSize * kNumPageRegions, allocator.AllocatePageSize()));
+  if (!region) return {};
+  auto result = std::unique_ptr<NormalPageMemoryRegion>(
+      new NormalPageMemoryRegion(allocator, *region));
+  return result;
+}
+
+NormalPageMemoryRegion::NormalPageMemoryRegion(PageAllocator& allocator,
+                                               MemoryRegion region)
+    : PageMemoryRegion(allocator, region, false) {
 #ifdef DEBUG
   for (size_t i = 0; i < kNumPageRegions; ++i) {
     DCHECK_EQ(false, page_memories_in_use_[i]);
@@ -126,15 +132,21 @@ void NormalPageMemoryRegion::UnprotectForTesting() {
   }
 }
 
-LargePageMemoryRegion::LargePageMemoryRegion(
-    PageAllocator& allocator, FatalOutOfMemoryHandler& oom_handler,
-    size_t length)
-    : PageMemoryRegion(
-          allocator,
-          ReserveMemoryRegion(allocator, oom_handler,
-                              RoundUp(length + 2 * kGuardPageSize,
-                                      allocator.AllocatePageSize())),
-          true) {}
+// static
+std::unique_ptr<LargePageMemoryRegion> LargePageMemoryRegion::Create(
+    PageAllocator& allocator, size_t length) {
+  const auto region = ReserveMemoryRegion(
+      allocator,
+      RoundUp(length + 2 * kGuardPageSize, allocator.AllocatePageSize()));
+  if (!region) return {};
+  auto result = std::unique_ptr<LargePageMemoryRegion>(
+      new LargePageMemoryRegion(allocator, *region));
+  return result;
+}
+
+LargePageMemoryRegion::LargePageMemoryRegion(PageAllocator& allocator,
+                                             MemoryRegion region)
+    : PageMemoryRegion(allocator, region, true) {}
 
 LargePageMemoryRegion::~LargePageMemoryRegion() = default;
 
@@ -177,11 +189,9 @@ std::pair<NormalPageMemoryRegion*, Address> NormalPageMemoryPool::Take() {
 }
 
 PageBackend::PageBackend(PageAllocator& normal_page_allocator,
-                         PageAllocator& large_page_allocator,
-                         FatalOutOfMemoryHandler& oom_handler)
+                         PageAllocator& large_page_allocator)
     : normal_page_allocator_(normal_page_allocator),
-      large_page_allocator_(large_page_allocator),
-      oom_handler_(oom_handler) {}
+      large_page_allocator_(large_page_allocator) {}
 
 PageBackend::~PageBackend() = default;
 
@@ -189,8 +199,10 @@ Address PageBackend::TryAllocateNormalPageMemory() {
   v8::base::MutexGuard guard(&mutex_);
   std::pair<NormalPageMemoryRegion*, Address> result = page_pool_.Take();
   if (!result.first) {
-    auto pmr = std::make_unique<NormalPageMemoryRegion>(normal_page_allocator_,
-                                                        oom_handler_);
+    auto pmr = NormalPageMemoryRegion::Create(normal_page_allocator_);
+    if (!pmr) {
+      return nullptr;
+    }
     for (size_t i = 0; i < NormalPageMemoryRegion::kNumPageRegions; ++i) {
       page_pool_.Add(pmr.get(),
                      pmr->GetPageMemory(i).writeable_region().base());
@@ -217,8 +229,10 @@ void PageBackend::FreeNormalPageMemory(size_t bucket, Address writeable_base) {
 
 Address PageBackend::TryAllocateLargePageMemory(size_t size) {
   v8::base::MutexGuard guard(&mutex_);
-  auto pmr = std::make_unique<LargePageMemoryRegion>(large_page_allocator_,
-                                                     oom_handler_, size);
+  auto pmr = LargePageMemoryRegion::Create(large_page_allocator_, size);
+  if (!pmr) {
+    return nullptr;
+  }
   const PageMemory pm = pmr->GetPageMemory();
   if (V8_LIKELY(TryUnprotect(large_page_allocator_, pm))) {
     page_memory_region_tree_.Add(pmr.get());
diff --git a/deps/v8/src/heap/cppgc/page-memory.h b/deps/v8/src/heap/cppgc/page-memory.h
index 8200c773783895..c6a71fdd2c27d4 100644
--- a/deps/v8/src/heap/cppgc/page-memory.h
+++ b/deps/v8/src/heap/cppgc/page-memory.h
@@ -19,8 +19,6 @@
 namespace cppgc {
 namespace internal {
 
-class FatalOutOfMemoryHandler;
-
 class V8_EXPORT_PRIVATE MemoryRegion final {
  public:
   MemoryRegion() = default;
@@ -94,7 +92,7 @@ class V8_EXPORT_PRIVATE NormalPageMemoryRegion final : public PageMemoryRegion {
  public:
   static constexpr size_t kNumPageRegions = 10;
 
-  NormalPageMemoryRegion(PageAllocator&, FatalOutOfMemoryHandler&);
+  static std::unique_ptr<NormalPageMemoryRegion> Create(PageAllocator&);
   ~NormalPageMemoryRegion() override;
 
   const PageMemory GetPageMemory(size_t index) const {
@@ -120,6 +118,8 @@ class V8_EXPORT_PRIVATE NormalPageMemoryRegion final : public PageMemoryRegion {
   void UnprotectForTesting() final;
 
  private:
+  NormalPageMemoryRegion(PageAllocator&, MemoryRegion);
+
   void ChangeUsed(size_t index, bool value) {
     DCHECK_LT(index, kNumPageRegions);
     DCHECK_EQ(value, !page_memories_in_use_[index]);
@@ -137,7 +137,7 @@ class V8_EXPORT_PRIVATE NormalPageMemoryRegion final : public PageMemoryRegion {
 // LargePageMemoryRegion serves a single large PageMemory object.
 class V8_EXPORT_PRIVATE LargePageMemoryRegion final : public PageMemoryRegion {
  public:
-  LargePageMemoryRegion(PageAllocator&, FatalOutOfMemoryHandler&, size_t);
+  static std::unique_ptr<LargePageMemoryRegion> Create(PageAllocator&, size_t);
   ~LargePageMemoryRegion() override;
 
   const PageMemory GetPageMemory() const {
@@ -150,6 +150,9 @@ class V8_EXPORT_PRIVATE LargePageMemoryRegion final : public PageMemoryRegion {
   inline Address Lookup(ConstAddress) const;
 
   void UnprotectForTesting() final;
+
+ private:
+  LargePageMemoryRegion(PageAllocator&, MemoryRegion);
 };
 
 // A PageMemoryRegionTree is a binary search tree of PageMemoryRegions sorted
@@ -196,7 +199,7 @@ class V8_EXPORT_PRIVATE NormalPageMemoryPool final {
 class V8_EXPORT_PRIVATE PageBackend final {
  public:
   PageBackend(PageAllocator& normal_page_allocator,
-              PageAllocator& large_page_allocator, FatalOutOfMemoryHandler&);
+              PageAllocator& large_page_allocator);
   ~PageBackend();
 
   // Allocates a normal page from the backend.
@@ -230,7 +233,6 @@ class V8_EXPORT_PRIVATE PageBackend final {
   mutable v8::base::Mutex mutex_;
   PageAllocator& normal_page_allocator_;
   PageAllocator& large_page_allocator_;
-  FatalOutOfMemoryHandler& oom_handler_;
   NormalPageMemoryPool page_pool_;
   PageMemoryRegionTree page_memory_region_tree_;
   std::vector<std::unique_ptr<PageMemoryRegion>> normal_page_memory_regions_;
diff --git a/deps/v8/src/heap/cppgc/platform.cc b/deps/v8/src/heap/cppgc/platform.cc
index 57f63c1d441033..0f20ba0e891acd 100644
--- a/deps/v8/src/heap/cppgc/platform.cc
+++ b/deps/v8/src/heap/cppgc/platform.cc
@@ -87,7 +87,8 @@ TracingController* Platform::GetTracingController() {
   return tracing_controller.get();
 }
 
-void InitializeProcess(PageAllocator* page_allocator) {
+void InitializeProcess(PageAllocator* page_allocator,
+                       size_t desired_heap_size) {
 #if defined(V8_USE_ADDRESS_SANITIZER) && defined(V8_TARGET_ARCH_64_BIT)
   // Retrieve asan's internal shadow memory granularity and check that Oilpan's
   // object alignment/sizes are multiple of this granularity. This is needed to
@@ -104,7 +105,7 @@ void InitializeProcess(PageAllocator* page_allocator) {
   CHECK(!internal::g_page_allocator);
   internal::GlobalGCInfoTable::Initialize(allocator);
 #if defined(CPPGC_CAGED_HEAP)
-  internal::CagedHeap::InitializeIfNeeded(allocator);
+  internal::CagedHeap::InitializeIfNeeded(allocator, desired_heap_size);
 #endif  // defined(CPPGC_CAGED_HEAP)
   internal::g_page_allocator = &allocator;
 }
diff --git a/deps/v8/src/heap/cppgc/source-location.cc b/deps/v8/src/heap/cppgc/source-location.cc
deleted file mode 100644
index 95154cf6d5da4d..00000000000000
--- a/deps/v8/src/heap/cppgc/source-location.cc
+++ /dev/null
@@ -1,16 +0,0 @@
-// Copyright 2020 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "include/cppgc/source-location.h"
-
-namespace cppgc {
-
-std::string SourceLocation::ToString() const {
-  if (!file_) {
-    return {};
-  }
-  return std::string(function_) + "@" + file_ + ":" + std::to_string(line_);
-}
-
-}  // namespace cppgc
diff --git a/deps/v8/src/heap/cppgc/stats-collector.h b/deps/v8/src/heap/cppgc/stats-collector.h
index 2cf728489d0a9c..d8414ae3c6e2d0 100644
--- a/deps/v8/src/heap/cppgc/stats-collector.h
+++ b/deps/v8/src/heap/cppgc/stats-collector.h
@@ -8,6 +8,7 @@
 #include <stddef.h>
 #include <stdint.h>
 
+#include <algorithm>
 #include <atomic>
 #include <vector>
 
diff --git a/deps/v8/src/heap/cppgc/visitor.cc b/deps/v8/src/heap/cppgc/visitor.cc
index 8d3737f0fc3e69..d517cd558328e7 100644
--- a/deps/v8/src/heap/cppgc/visitor.cc
+++ b/deps/v8/src/heap/cppgc/visitor.cc
@@ -65,20 +65,20 @@ void ConservativeTracingVisitor::TraceConservatively(
 }
 
 void ConservativeTracingVisitor::TryTracePointerConservatively(
-    Address pointer) {
+    Address address) {
 #if defined(CPPGC_CAGED_HEAP)
   // TODO(chromium:1056170): Add support for SIMD in stack scanning.
-  if (V8_LIKELY(!CagedHeapBase::IsWithinCage(pointer))) return;
+  if (V8_LIKELY(!CagedHeapBase::IsWithinCage(address))) return;
 #endif  // defined(CPPGC_CAGED_HEAP)
 
   const BasePage* page = reinterpret_cast<const BasePage*>(
-      page_backend_.Lookup(const_cast<ConstAddress>(pointer)));
+      page_backend_.Lookup(const_cast<ConstAddress>(address)));
 
   if (!page) return;
 
   DCHECK_EQ(&heap_, &page->heap());
 
-  auto* header = page->TryObjectHeaderFromInnerAddress(pointer);
+  auto* header = page->TryObjectHeaderFromInnerAddress(address);
 
   if (!header) return;
 
diff --git a/deps/v8/src/heap/cppgc/write-barrier.cc b/deps/v8/src/heap/cppgc/write-barrier.cc
index a2f1eb4ab4f08b..c0b0b518bd5031 100644
--- a/deps/v8/src/heap/cppgc/write-barrier.cc
+++ b/deps/v8/src/heap/cppgc/write-barrier.cc
@@ -128,7 +128,7 @@ void WriteBarrier::GenerationalBarrierSlow(const CagedHeapLocalData& local_data,
                                            HeapHandle* heap_handle) {
   DCHECK(slot);
   DCHECK(heap_handle);
-  DCHECK_GT(kCagedHeapReservationSize, value_offset);
+  DCHECK_GT(api_constants::kCagedHeapMaxReservationSize, value_offset);
   // A write during atomic pause (e.g. pre-finalizer) may trigger the slow path
   // of the barrier. This is a result of the order of bailouts where not marking
   // results in applying the generational barrier.
@@ -148,7 +148,7 @@ void WriteBarrier::GenerationalBarrierForUncompressedSlotSlow(
     const void* slot, uintptr_t value_offset, HeapHandle* heap_handle) {
   DCHECK(slot);
   DCHECK(heap_handle);
-  DCHECK_GT(kCagedHeapReservationSize, value_offset);
+  DCHECK_GT(api_constants::kCagedHeapMaxReservationSize, value_offset);
   // A write during atomic pause (e.g. pre-finalizer) may trigger the slow path
   // of the barrier. This is a result of the order of bailouts where not marking
   // results in applying the generational barrier.
diff --git a/deps/v8/src/heap/ephemeron-remembered-set.cc b/deps/v8/src/heap/ephemeron-remembered-set.cc
new file mode 100644
index 00000000000000..b019d1a1798138
--- /dev/null
+++ b/deps/v8/src/heap/ephemeron-remembered-set.cc
@@ -0,0 +1,33 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/ephemeron-remembered-set.h"
+
+#include "src/heap/heap-inl.h"
+#include "src/heap/remembered-set.h"
+
+namespace v8::internal {
+
+void EphemeronRememberedSet::RecordEphemeronKeyWrite(
+    Tagged<EphemeronHashTable> table, Address slot) {
+  DCHECK(ObjectInYoungGeneration(HeapObjectSlot(slot).ToHeapObject()));
+  int slot_index = EphemeronHashTable::SlotToIndex(table.address(), slot);
+  InternalIndex entry = EphemeronHashTable::IndexToEntry(slot_index);
+  base::MutexGuard guard(&insertion_mutex_);
+  auto it = tables_.insert({table, IndicesSet()});
+  it.first->second.insert(entry.as_int());
+}
+
+void EphemeronRememberedSet::RecordEphemeronKeyWrites(
+    Tagged<EphemeronHashTable> table, IndicesSet indices) {
+  base::MutexGuard guard(&insertion_mutex_);
+  auto it = tables_.find(table);
+  if (it != tables_.end()) {
+    it->second.merge(std::move(indices));
+  } else {
+    tables_.insert({table, std::move(indices)});
+  }
+}
+
+}  // namespace v8::internal
diff --git a/deps/v8/src/heap/ephemeron-remembered-set.h b/deps/v8/src/heap/ephemeron-remembered-set.h
new file mode 100644
index 00000000000000..277337a225cf27
--- /dev/null
+++ b/deps/v8/src/heap/ephemeron-remembered-set.h
@@ -0,0 +1,46 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_EPHEMERON_REMEMBERED_SET_H_
+#define V8_HEAP_EPHEMERON_REMEMBERED_SET_H_
+
+#include <unordered_map>
+#include <unordered_set>
+
+#include "src/base/platform/mutex.h"
+#include "src/heap/base/worklist.h"
+#include "src/objects/hash-table.h"
+
+namespace v8::internal {
+
+// Stores ephemeron entries where the EphemeronHashTable is in old-space,
+// and the key of the entry is in new-space. Such keys do not appear in the
+// usual OLD_TO_NEW remembered set. The remembered set is used to avoid
+// strongifying keys in such hash tables in young generation garbage
+// collections.
+class EphemeronRememberedSet final {
+ public:
+  static constexpr int kEphemeronTableListSegmentSize = 128;
+  using TableList = ::heap::base::Worklist<Tagged<EphemeronHashTable>,
+                                           kEphemeronTableListSegmentSize>;
+
+  using IndicesSet = std::unordered_set<int>;
+  using TableMap = std::unordered_map<Tagged<EphemeronHashTable>, IndicesSet,
+                                      Object::Hasher>;
+
+  void RecordEphemeronKeyWrite(Tagged<EphemeronHashTable> table,
+                               Address key_slot);
+  void RecordEphemeronKeyWrites(Tagged<EphemeronHashTable> table,
+                                IndicesSet indices);
+
+  TableMap* tables() { return &tables_; }
+
+ private:
+  base::Mutex insertion_mutex_;
+  TableMap tables_;
+};
+
+}  // namespace v8::internal
+
+#endif  // V8_HEAP_EPHEMERON_REMEMBERED_SET_H_
diff --git a/deps/v8/src/heap/evacuation-allocator-inl.h b/deps/v8/src/heap/evacuation-allocator-inl.h
index a53017090e3b64..4e61e577863bf1 100644
--- a/deps/v8/src/heap/evacuation-allocator-inl.h
+++ b/deps/v8/src/heap/evacuation-allocator-inl.h
@@ -34,8 +34,8 @@ AllocationResult EvacuationAllocator::Allocate(AllocationSpace space,
   }
 }
 
-void EvacuationAllocator::FreeLast(AllocationSpace space, HeapObject object,
-                                   int object_size) {
+void EvacuationAllocator::FreeLast(AllocationSpace space,
+                                   Tagged<HeapObject> object, int object_size) {
   object_size = ALIGN_TO_ALLOCATION_ALIGNMENT(object_size);
   switch (space) {
     case NEW_SPACE:
@@ -53,7 +53,7 @@ void EvacuationAllocator::FreeLast(AllocationSpace space, HeapObject object,
   }
 }
 
-void EvacuationAllocator::FreeLastInNewSpace(HeapObject object,
+void EvacuationAllocator::FreeLastInNewSpace(Tagged<HeapObject> object,
                                              int object_size) {
   if (!new_space_lab_.TryFreeLast(object, object_size)) {
     // We couldn't free the last object so we have to write a proper filler.
@@ -62,7 +62,7 @@ void EvacuationAllocator::FreeLastInNewSpace(HeapObject object,
 }
 
 void EvacuationAllocator::FreeLastInCompactionSpace(AllocationSpace space,
-                                                    HeapObject object,
+                                                    Tagged<HeapObject> object,
                                                     int object_size) {
   if (!compaction_spaces_.Get(space)->TryFreeLast(object.address(),
                                                   object_size)) {
diff --git a/deps/v8/src/heap/evacuation-allocator.h b/deps/v8/src/heap/evacuation-allocator.h
index 8503e74889f025..e1e1686076de0a 100644
--- a/deps/v8/src/heap/evacuation-allocator.h
+++ b/deps/v8/src/heap/evacuation-allocator.h
@@ -49,7 +49,7 @@ class EvacuationAllocator {
   inline AllocationResult Allocate(AllocationSpace space, int object_size,
                                    AllocationOrigin origin,
                                    AllocationAlignment alignment);
-  inline void FreeLast(AllocationSpace space, HeapObject object,
+  inline void FreeLast(AllocationSpace space, Tagged<HeapObject> object,
                        int object_size);
 
  private:
@@ -59,9 +59,10 @@ class EvacuationAllocator {
   inline bool NewLocalAllocationBuffer();
   inline AllocationResult AllocateInLAB(int object_size,
                                         AllocationAlignment alignment);
-  inline void FreeLastInNewSpace(HeapObject object, int object_size);
+  inline void FreeLastInNewSpace(Tagged<HeapObject> object, int object_size);
   inline void FreeLastInCompactionSpace(AllocationSpace space,
-                                        HeapObject object, int object_size);
+                                        Tagged<HeapObject> object,
+                                        int object_size);
 
   Heap* const heap_;
   NewSpace* const new_space_;
diff --git a/deps/v8/src/heap/evacuation-verifier-inl.h b/deps/v8/src/heap/evacuation-verifier-inl.h
index 476176306cd4eb..832b4437967d31 100644
--- a/deps/v8/src/heap/evacuation-verifier-inl.h
+++ b/deps/v8/src/heap/evacuation-verifier-inl.h
@@ -14,48 +14,30 @@ namespace internal {
 
 #ifdef VERIFY_HEAP
 
-void FullEvacuationVerifier::VerifyHeapObjectImpl(HeapObject heap_object) {
+void EvacuationVerifier::VerifyHeapObjectImpl(Tagged<HeapObject> heap_object) {
   if (!ShouldVerifyObject(heap_object)) return;
   CHECK_IMPLIES(Heap::InYoungGeneration(heap_object),
                 Heap::InToPage(heap_object));
   CHECK(!MarkCompactCollector::IsOnEvacuationCandidate(heap_object));
 }
 
-bool FullEvacuationVerifier::ShouldVerifyObject(HeapObject heap_object) {
+bool EvacuationVerifier::ShouldVerifyObject(Tagged<HeapObject> heap_object) {
   const bool in_shared_heap = heap_object.InWritableSharedSpace();
   return heap_->isolate()->is_shared_space_isolate() ? in_shared_heap
                                                      : !in_shared_heap;
 }
 
 template <typename TSlot>
-void FullEvacuationVerifier::VerifyPointersImpl(TSlot start, TSlot end) {
+void EvacuationVerifier::VerifyPointersImpl(TSlot start, TSlot end) {
   for (TSlot current = start; current < end; ++current) {
     typename TSlot::TObject object = current.load(cage_base());
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
     if (object.GetHeapObjectIfStrong(&heap_object)) {
       VerifyHeapObjectImpl(heap_object);
     }
   }
 }
 
-void YoungGenerationEvacuationVerifier::VerifyHeapObjectImpl(
-    HeapObject heap_object) {
-  CHECK_IMPLIES(Heap::InYoungGeneration(heap_object),
-                Heap::InToPage(heap_object));
-}
-
-template <typename TSlot>
-void YoungGenerationEvacuationVerifier::VerifyPointersImpl(TSlot start,
-                                                           TSlot end) {
-  for (TSlot current = start; current < end; ++current) {
-    typename TSlot::TObject object = current.load(cage_base());
-    HeapObject heap_object;
-    if (object.GetHeapObject(&heap_object)) {
-      VerifyHeapObjectImpl(heap_object);
-    }
-  }
-}
-
 #endif  // VERIFY_HEAP
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/evacuation-verifier.cc b/deps/v8/src/heap/evacuation-verifier.cc
index 5134b7f02f8435..332b5fa2d74ed7 100644
--- a/deps/v8/src/heap/evacuation-verifier.cc
+++ b/deps/v8/src/heap/evacuation-verifier.cc
@@ -15,29 +15,58 @@ namespace internal {
 EvacuationVerifier::EvacuationVerifier(Heap* heap)
     : ObjectVisitorWithCageBases(heap), heap_(heap) {}
 
-void EvacuationVerifier::VisitPointers(HeapObject host, ObjectSlot start,
-                                       ObjectSlot end) {
-  VerifyPointers(start, end);
+void EvacuationVerifier::Run() {
+  DCHECK(!heap_->sweeping_in_progress());
+  VerifyRoots();
+  VerifyEvacuation(heap_->new_space());
+  VerifyEvacuation(heap_->old_space());
+  VerifyEvacuation(heap_->code_space());
+  if (heap_->shared_space()) VerifyEvacuation(heap_->shared_space());
 }
 
-void EvacuationVerifier::VisitPointers(HeapObject host, MaybeObjectSlot start,
+void EvacuationVerifier::VisitPointers(Tagged<HeapObject> host,
+                                       ObjectSlot start, ObjectSlot end) {
+  VerifyPointersImpl(start, end);
+}
+
+void EvacuationVerifier::VisitPointers(Tagged<HeapObject> host,
+                                       MaybeObjectSlot start,
                                        MaybeObjectSlot end) {
-  VerifyPointers(start, end);
+  VerifyPointersImpl(start, end);
 }
 
-void EvacuationVerifier::VisitCodePointer(Code host, CodeObjectSlot slot) {
-  VerifyCodePointer(slot);
+void EvacuationVerifier::VisitInstructionStreamPointer(
+    Tagged<Code> host, InstructionStreamSlot slot) {
+  Tagged<Object> maybe_code = slot.load(code_cage_base());
+  Tagged<HeapObject> code;
+  // The slot might contain smi during Code creation, so skip it.
+  if (maybe_code.GetHeapObject(&code)) {
+    VerifyHeapObjectImpl(code);
+  }
 }
 
 void EvacuationVerifier::VisitRootPointers(Root root, const char* description,
                                            FullObjectSlot start,
                                            FullObjectSlot end) {
-  VerifyRootPointers(start, end);
+  VerifyPointersImpl(start, end);
+}
+
+void EvacuationVerifier::VisitMapPointer(Tagged<HeapObject> object) {
+  VerifyHeapObjectImpl(object->map(cage_base()));
+}
+
+void EvacuationVerifier::VisitCodeTarget(Tagged<InstructionStream> host,
+                                         RelocInfo* rinfo) {
+  Tagged<InstructionStream> target =
+      InstructionStream::FromTargetAddress(rinfo->target_address());
+  VerifyHeapObjectImpl(target);
 }
 
-void EvacuationVerifier::VisitMapPointer(HeapObject object) {
-  VerifyMap(object.map(cage_base()));
+void EvacuationVerifier::VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                                              RelocInfo* rinfo) {
+  VerifyHeapObjectImpl(rinfo->target_object(cage_base()));
 }
+
 void EvacuationVerifier::VerifyRoots() {
   heap_->IterateRootsIncludingClients(
       this,
@@ -47,17 +76,17 @@ void EvacuationVerifier::VerifyRoots() {
 void EvacuationVerifier::VerifyEvacuationOnPage(Address start, Address end) {
   Address current = start;
   while (current < end) {
-    HeapObject object = HeapObject::FromAddress(current);
-    if (!object.IsFreeSpaceOrFiller(cage_base())) {
-      object.Iterate(cage_base(), this);
+    Tagged<HeapObject> object = HeapObject::FromAddress(current);
+    if (!IsFreeSpaceOrFiller(object, cage_base())) {
+      object->Iterate(cage_base(), this);
     }
-    current += ALIGN_TO_ALLOCATION_ALIGNMENT(object.Size(cage_base()));
+    current += ALIGN_TO_ALLOCATION_ALIGNMENT(object->Size(cage_base()));
   }
 }
 
 void EvacuationVerifier::VerifyEvacuation(NewSpace* space) {
   if (!space) return;
-  if (v8_flags.minor_mc) {
+  if (v8_flags.minor_ms) {
     VerifyEvacuation(PagedNewSpace::From(space)->paged_space());
     return;
   }
@@ -83,91 +112,6 @@ void EvacuationVerifier::VerifyEvacuation(PagedSpaceBase* space) {
   }
 }
 
-FullEvacuationVerifier::FullEvacuationVerifier(Heap* heap)
-    : EvacuationVerifier(heap) {}
-
-void FullEvacuationVerifier::Run() {
-  DCHECK(!heap_->sweeping_in_progress());
-  VerifyRoots();
-  VerifyEvacuation(heap_->new_space());
-  VerifyEvacuation(heap_->old_space());
-  VerifyEvacuation(heap_->code_space());
-  if (heap_->shared_space()) VerifyEvacuation(heap_->shared_space());
-}
-
-void FullEvacuationVerifier::VerifyMap(Map map) { VerifyHeapObjectImpl(map); }
-void FullEvacuationVerifier::VerifyPointers(ObjectSlot start, ObjectSlot end) {
-  VerifyPointersImpl(start, end);
-}
-void FullEvacuationVerifier::VerifyPointers(MaybeObjectSlot start,
-                                            MaybeObjectSlot end) {
-  VerifyPointersImpl(start, end);
-}
-void FullEvacuationVerifier::VerifyCodePointer(CodeObjectSlot slot) {
-  Object maybe_code = slot.load(code_cage_base());
-  HeapObject code;
-  // The slot might contain smi during Code creation, so skip it.
-  if (maybe_code.GetHeapObject(&code)) {
-    VerifyHeapObjectImpl(code);
-  }
-}
-void FullEvacuationVerifier::VisitCodeTarget(RelocInfo* rinfo) {
-  InstructionStream target =
-      InstructionStream::FromTargetAddress(rinfo->target_address());
-  VerifyHeapObjectImpl(target);
-}
-void FullEvacuationVerifier::VisitEmbeddedPointer(RelocInfo* rinfo) {
-  VerifyHeapObjectImpl(rinfo->target_object(cage_base()));
-}
-void FullEvacuationVerifier::VerifyRootPointers(FullObjectSlot start,
-                                                FullObjectSlot end) {
-  VerifyPointersImpl(start, end);
-}
-
-YoungGenerationEvacuationVerifier::YoungGenerationEvacuationVerifier(Heap* heap)
-    : EvacuationVerifier(heap) {}
-
-void YoungGenerationEvacuationVerifier::YoungGenerationEvacuationVerifier::
-    Run() {
-  DCHECK(!heap_->sweeping_in_progress());
-  VerifyRoots();
-  VerifyEvacuation(heap_->new_space());
-  VerifyEvacuation(heap_->old_space());
-  VerifyEvacuation(heap_->code_space());
-}
-
-void YoungGenerationEvacuationVerifier::VerifyMap(Map map) {
-  VerifyHeapObjectImpl(map);
-}
-void YoungGenerationEvacuationVerifier::VerifyPointers(ObjectSlot start,
-                                                       ObjectSlot end) {
-  VerifyPointersImpl(start, end);
-}
-void YoungGenerationEvacuationVerifier::VerifyPointers(MaybeObjectSlot start,
-                                                       MaybeObjectSlot end) {
-  VerifyPointersImpl(start, end);
-}
-void YoungGenerationEvacuationVerifier::VerifyCodePointer(CodeObjectSlot slot) {
-  Object maybe_code = slot.load(code_cage_base());
-  HeapObject code;
-  // The slot might contain smi during Code creation, so skip it.
-  if (maybe_code.GetHeapObject(&code)) {
-    VerifyHeapObjectImpl(code);
-  }
-}
-void YoungGenerationEvacuationVerifier::VisitCodeTarget(RelocInfo* rinfo) {
-  InstructionStream target =
-      InstructionStream::FromTargetAddress(rinfo->target_address());
-  VerifyHeapObjectImpl(target);
-}
-void YoungGenerationEvacuationVerifier::VisitEmbeddedPointer(RelocInfo* rinfo) {
-  VerifyHeapObjectImpl(rinfo->target_object(cage_base()));
-}
-void YoungGenerationEvacuationVerifier::VerifyRootPointers(FullObjectSlot start,
-                                                           FullObjectSlot end) {
-  VerifyPointersImpl(start, end);
-}
-
 #endif  // VERIFY_HEAP
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/evacuation-verifier.h b/deps/v8/src/heap/evacuation-verifier.h
index 039d793f33db37..dea0601e64d11a 100644
--- a/deps/v8/src/heap/evacuation-verifier.h
+++ b/deps/v8/src/heap/evacuation-verifier.h
@@ -15,34 +15,32 @@ namespace internal {
 
 #ifdef VERIFY_HEAP
 
-class EvacuationVerifier : public ObjectVisitorWithCageBases,
-                           public RootVisitor {
+class EvacuationVerifier final : public ObjectVisitorWithCageBases,
+                                 public RootVisitor {
  public:
-  virtual void Run() = 0;
-
-  void VisitPointers(HeapObject host, ObjectSlot start,
-                     ObjectSlot end) override;
-
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
-                     MaybeObjectSlot end) override;
+  explicit EvacuationVerifier(Heap* heap);
 
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override;
+  void Run();
 
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                     ObjectSlot end) final;
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
+                     MaybeObjectSlot end) final;
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) final;
   void VisitRootPointers(Root root, const char* description,
-                         FullObjectSlot start, FullObjectSlot end) override;
+                         FullObjectSlot start, FullObjectSlot end) final;
+  void VisitMapPointer(Tagged<HeapObject> object) final;
+  void VisitCodeTarget(Tagged<InstructionStream> host, RelocInfo* rinfo) final;
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) final;
 
-  void VisitMapPointer(HeapObject object) override;
+ private:
+  V8_INLINE void VerifyHeapObjectImpl(Tagged<HeapObject> heap_object);
+  V8_INLINE bool ShouldVerifyObject(Tagged<HeapObject> heap_object);
 
- protected:
-  explicit EvacuationVerifier(Heap* heap);
-
-  inline Heap* heap() { return heap_; }
-
-  virtual void VerifyMap(Map map) = 0;
-  virtual void VerifyPointers(ObjectSlot start, ObjectSlot end) = 0;
-  virtual void VerifyPointers(MaybeObjectSlot start, MaybeObjectSlot end) = 0;
-  virtual void VerifyCodePointer(CodeObjectSlot slot) = 0;
-  virtual void VerifyRootPointers(FullObjectSlot start, FullObjectSlot end) = 0;
+  template <typename TSlot>
+  void VerifyPointersImpl(TSlot start, TSlot end);
 
   void VerifyRoots();
   void VerifyEvacuationOnPage(Address start, Address end);
@@ -52,50 +50,6 @@ class EvacuationVerifier : public ObjectVisitorWithCageBases,
   Heap* heap_;
 };
 
-class FullEvacuationVerifier : public EvacuationVerifier {
- public:
-  explicit FullEvacuationVerifier(Heap* heap);
-
-  void Run() override;
-
- protected:
-  V8_INLINE void VerifyHeapObjectImpl(HeapObject heap_object);
-
-  V8_INLINE bool ShouldVerifyObject(HeapObject heap_object);
-
-  template <typename TSlot>
-  void VerifyPointersImpl(TSlot start, TSlot end);
-
-  void VerifyMap(Map map) override;
-  void VerifyPointers(ObjectSlot start, ObjectSlot end) override;
-  void VerifyPointers(MaybeObjectSlot start, MaybeObjectSlot end) override;
-  void VerifyCodePointer(CodeObjectSlot slot) override;
-  void VisitCodeTarget(RelocInfo* rinfo) override;
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override;
-  void VerifyRootPointers(FullObjectSlot start, FullObjectSlot end) override;
-};
-
-class YoungGenerationEvacuationVerifier : public EvacuationVerifier {
- public:
-  explicit YoungGenerationEvacuationVerifier(Heap* heap);
-
-  void Run() override;
-
- protected:
-  V8_INLINE void VerifyHeapObjectImpl(HeapObject heap_object);
-
-  template <typename TSlot>
-  void VerifyPointersImpl(TSlot start, TSlot end);
-
-  void VerifyMap(Map map) override;
-  void VerifyPointers(ObjectSlot start, ObjectSlot end) override;
-  void VerifyPointers(MaybeObjectSlot start, MaybeObjectSlot end) override;
-  void VerifyCodePointer(CodeObjectSlot slot) override;
-  void VisitCodeTarget(RelocInfo* rinfo) override;
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override;
-  void VerifyRootPointers(FullObjectSlot start, FullObjectSlot end) override;
-};
-
 #endif  // VERIFY_HEAP
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/factory-base-inl.h b/deps/v8/src/heap/factory-base-inl.h
index c02d7fb41097a9..4d9a8272ebe95b 100644
--- a/deps/v8/src/heap/factory-base-inl.h
+++ b/deps/v8/src/heap/factory-base-inl.h
@@ -11,6 +11,7 @@
 #include "src/objects/map.h"
 #include "src/objects/slots-inl.h"
 #include "src/objects/smi.h"
+#include "src/objects/struct-inl.h"
 #include "src/roots/roots.h"
 
 namespace v8 {
@@ -25,8 +26,9 @@ READ_ONLY_ROOT_LIST(ROOT_ACCESSOR)
 #undef ROOT_ACCESSOR
 
 template <typename Impl>
-Handle<Oddball> FactoryBase<Impl>::ToBoolean(bool value) {
-  return value ? impl()->true_value() : impl()->false_value();
+Handle<Boolean> FactoryBase<Impl>::ToBoolean(bool value) {
+  return value ? Handle<Boolean>::cast(impl()->true_value())
+               : Handle<Boolean>::cast(impl()->false_value());
 }
 
 template <typename Impl>
@@ -104,24 +106,24 @@ Handle<HeapNumber> FactoryBase<Impl>::NewHeapNumberWithHoleNaN() {
 
 template <typename Impl>
 template <typename StructType>
-StructType FactoryBase<Impl>::NewStructInternal(InstanceType type,
-                                                AllocationType allocation) {
+Tagged<StructType> FactoryBase<Impl>::NewStructInternal(
+    InstanceType type, AllocationType allocation) {
   ReadOnlyRoots roots = read_only_roots();
-  Map map = Map::GetMapFor(roots, type);
+  Tagged<Map> map = Map::GetMapFor(roots, type);
   int size = StructType::kSize;
   return StructType::cast(NewStructInternal(roots, map, size, allocation));
 }
 
 template <typename Impl>
-Struct FactoryBase<Impl>::NewStructInternal(ReadOnlyRoots roots, Map map,
-                                            int size,
-                                            AllocationType allocation) {
-  DCHECK_EQ(size, map.instance_size());
-  HeapObject result = AllocateRawWithImmortalMap(size, allocation, map);
-  Struct str = Struct::cast(result);
-  Object value = roots.undefined_value();
+Tagged<Struct> FactoryBase<Impl>::NewStructInternal(ReadOnlyRoots roots,
+                                                    Tagged<Map> map, int size,
+                                                    AllocationType allocation) {
+  DCHECK_EQ(size, map->instance_size());
+  Tagged<HeapObject> result = AllocateRawWithImmortalMap(size, allocation, map);
+  Tagged<Struct> str = Tagged<Struct>::cast(result);
+  Tagged<Undefined> undefined = roots.undefined_value();
   int length = (size >> kTaggedSizeLog2) - 1;
-  MemsetTagged(str.RawField(Struct::kHeaderSize), value, length);
+  MemsetTagged(str->RawField(Struct::kHeaderSize), undefined, length);
   return str;
 }
 
diff --git a/deps/v8/src/heap/factory-base.cc b/deps/v8/src/heap/factory-base.cc
index 13b712bf94785c..e8146d994054fa 100644
--- a/deps/v8/src/heap/factory-base.cc
+++ b/deps/v8/src/heap/factory-base.cc
@@ -36,10 +36,10 @@ template <typename Impl>
 template <AllocationType allocation>
 Handle<HeapNumber> FactoryBase<Impl>::NewHeapNumber() {
   static_assert(HeapNumber::kSize <= kMaxRegularHeapObjectSize);
-  Map map = read_only_roots().heap_number_map();
-  HeapObject result = AllocateRawWithImmortalMap(HeapNumber::kSize, allocation,
-                                                 map, kDoubleUnaligned);
-  return handle(HeapNumber::cast(result), isolate());
+  Tagged<Map> map = read_only_roots().heap_number_map();
+  Tagged<HeapObject> result = AllocateRawWithImmortalMap(
+      HeapNumber::kSize, allocation, map, kDoubleUnaligned);
+  return handle(Tagged<HeapNumber>::cast(result), isolate());
 }
 
 template V8_EXPORT_PRIVATE Handle<HeapNumber>
@@ -58,8 +58,8 @@ template <typename Impl>
 Handle<Struct> FactoryBase<Impl>::NewStruct(InstanceType type,
                                             AllocationType allocation) {
   ReadOnlyRoots roots = read_only_roots();
-  Map map = Map::GetMapFor(roots, type);
-  int size = map.instance_size();
+  Tagged<Map> map = Map::GetMapFor(roots, type);
+  int size = map->instance_size();
   return handle(NewStructInternal(roots, map, size, allocation), isolate());
 }
 
@@ -68,48 +68,60 @@ Handle<AccessorPair> FactoryBase<Impl>::NewAccessorPair() {
   auto accessors =
       NewStructInternal<AccessorPair>(ACCESSOR_PAIR_TYPE, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  accessors.set_getter(read_only_roots().null_value(), SKIP_WRITE_BARRIER);
-  accessors.set_setter(read_only_roots().null_value(), SKIP_WRITE_BARRIER);
+  accessors->set_getter(read_only_roots().null_value(), SKIP_WRITE_BARRIER);
+  accessors->set_setter(read_only_roots().null_value(), SKIP_WRITE_BARRIER);
   return handle(accessors, isolate());
 }
 
 template <typename Impl>
 Handle<Code> FactoryBase<Impl>::NewCode(const NewCodeOptions& options) {
-  Map map = read_only_roots().code_map();
-  int size = map.instance_size();
-  DCHECK_NE(options.allocation, AllocationType::kYoung);
-  Code code =
-      Code::cast(AllocateRawWithImmortalMap(size, options.allocation, map));
-  DisallowGarbageCollection no_gc;
-  code.initialize_flags(options.kind, options.builtin, options.is_turbofanned,
-                        options.stack_slots);
-  code.set_kind_specific_flags(options.kind_specific_flags, kRelaxedStore);
   Isolate* isolate_for_sandbox = impl()->isolate_for_sandbox();
-  code.set_raw_instruction_stream(Smi::zero(), SKIP_WRITE_BARRIER);
-  code.init_code_entry_point(isolate_for_sandbox, kNullAddress);
-  code.set_instruction_size(options.instruction_size);
-  code.set_metadata_size(options.metadata_size);
-  code.set_relocation_info(*options.reloc_info);
-  code.set_inlined_bytecode_size(options.inlined_bytecode_size);
-  code.set_osr_offset(options.osr_offset);
-  code.set_handler_table_offset(options.handler_table_offset);
-  code.set_constant_pool_offset(options.constant_pool_offset);
-  code.set_code_comments_offset(options.code_comments_offset);
-  code.set_unwinding_info_offset(options.unwinding_info_offset);
+  Tagged<Map> map = read_only_roots().code_map();
+  int size = map->instance_size();
+  Tagged<Code> code = Tagged<Code>::cast(
+      AllocateRawWithImmortalMap(size, AllocationType::kOld, map));
+  DisallowGarbageCollection no_gc;
+  code->init_instruction_start(isolate_for_sandbox, kNullAddress);
+  code->initialize_flags(options.kind, options.is_turbofanned,
+                         options.stack_slots);
+  code->set_builtin_id(options.builtin);
+  code->set_instruction_size(options.instruction_size);
+  code->set_metadata_size(options.metadata_size);
+  code->set_inlined_bytecode_size(options.inlined_bytecode_size);
+  code->set_osr_offset(options.osr_offset);
+  code->set_handler_table_offset(options.handler_table_offset);
+  code->set_constant_pool_offset(options.constant_pool_offset);
+  code->set_code_comments_offset(options.code_comments_offset);
+  code->set_unwinding_info_offset(options.unwinding_info_offset);
 
   if (options.kind == CodeKind::BASELINE) {
-    code.set_bytecode_or_interpreter_data(
+    code->set_bytecode_or_interpreter_data(
         *options.bytecode_or_deoptimization_data);
-    code.set_bytecode_offset_table(
+    code->set_bytecode_offset_table(
         *options.bytecode_offsets_or_source_position_table);
   } else {
-    code.set_deoptimization_data(
+    code->set_deoptimization_data(
         FixedArray::cast(*options.bytecode_or_deoptimization_data));
-    code.set_source_position_table(
+    code->set_source_position_table(
         *options.bytecode_offsets_or_source_position_table);
   }
 
-  code.clear_padding();
+  Handle<InstructionStream> istream;
+  if (options.instruction_stream.ToHandle(&istream)) {
+    CodePageHeaderModificationScope header_modification_scope(
+        "Setting the instruction_stream can trigger a write to the marking "
+        "bitmap.");
+    DCHECK_EQ(options.instruction_start, kNullAddress);
+    code->SetInstructionStreamAndInstructionStart(isolate_for_sandbox,
+                                                  *istream);
+  } else {
+    DCHECK_NE(options.instruction_start, kNullAddress);
+    code->set_raw_instruction_stream(Smi::zero(), SKIP_WRITE_BARRIER);
+    code->SetInstructionStartForOffHeapBuiltin(isolate_for_sandbox,
+                                               options.instruction_start);
+  }
+
+  code->clear_padding();
   return handle(code, isolate());
 }
 
@@ -149,16 +161,16 @@ Handle<FixedArray> FactoryBase<Impl>::NewFixedArrayWithHoles(
 
 template <typename Impl>
 Handle<FixedArray> FactoryBase<Impl>::NewFixedArrayWithFiller(
-    Handle<Map> map, int length, Handle<Oddball> filler,
+    Handle<Map> map, int length, Handle<HeapObject> filler,
     AllocationType allocation) {
-  HeapObject result = AllocateRawFixedArray(length, allocation);
+  Tagged<HeapObject> result = AllocateRawFixedArray(length, allocation);
   DisallowGarbageCollection no_gc;
   DCHECK(ReadOnlyHeap::Contains(*map));
   DCHECK(ReadOnlyHeap::Contains(*filler));
-  result.set_map_after_allocation(*map, SKIP_WRITE_BARRIER);
-  FixedArray array = FixedArray::cast(result);
-  array.set_length(length);
-  MemsetTagged(array.data_start(), *filler, length);
+  result->set_map_after_allocation(*map, SKIP_WRITE_BARRIER);
+  Tagged<FixedArray> array = Tagged<FixedArray>::cast(result);
+  array->set_length(length);
+  MemsetTagged(array->data_start(), *filler, length);
   return handle(array, isolate());
 }
 
@@ -170,13 +182,13 @@ Handle<FixedArray> FactoryBase<Impl>::NewFixedArrayWithZeroes(
   if (length > FixedArray::kMaxLength) {
     FATAL("Invalid FixedArray size %d", length);
   }
-  HeapObject result = AllocateRawFixedArray(length, allocation);
+  Tagged<HeapObject> result = AllocateRawFixedArray(length, allocation);
   DisallowGarbageCollection no_gc;
-  result.set_map_after_allocation(read_only_roots().fixed_array_map(),
-                                  SKIP_WRITE_BARRIER);
-  FixedArray array = FixedArray::cast(result);
-  array.set_length(length);
-  MemsetTagged(array.data_start(), Smi::zero(), length);
+  result->set_map_after_allocation(read_only_roots().fixed_array_map(),
+                                   SKIP_WRITE_BARRIER);
+  Tagged<FixedArray> array = Tagged<FixedArray>::cast(result);
+  array->set_length(length);
+  MemsetTagged(array->data_start(), Smi::zero(), length);
   return handle(array, isolate());
 }
 
@@ -190,29 +202,29 @@ Handle<FixedArrayBase> FactoryBase<Impl>::NewFixedDoubleArray(
     UNREACHABLE();
   }
   int size = FixedDoubleArray::SizeFor(length);
-  Map map = read_only_roots().fixed_double_array_map();
-  HeapObject result =
+  Tagged<Map> map = read_only_roots().fixed_double_array_map();
+  Tagged<HeapObject> result =
       AllocateRawWithImmortalMap(size, allocation, map, kDoubleAligned);
   DisallowGarbageCollection no_gc;
-  FixedDoubleArray array = FixedDoubleArray::cast(result);
-  array.set_length(length);
+  Tagged<FixedDoubleArray> array = Tagged<FixedDoubleArray>::cast(result);
+  array->set_length(length);
   return handle(array, isolate());
 }
 
 template <typename Impl>
 Handle<WeakFixedArray> FactoryBase<Impl>::NewWeakFixedArrayWithMap(
-    Map map, int length, AllocationType allocation) {
+    Tagged<Map> map, int length, AllocationType allocation) {
   // Zero-length case must be handled outside.
   DCHECK_LT(0, length);
   DCHECK(ReadOnlyHeap::Contains(map));
 
-  HeapObject result =
+  Tagged<HeapObject> result =
       AllocateRawArray(WeakFixedArray::SizeFor(length), allocation);
-  result.set_map_after_allocation(map, SKIP_WRITE_BARRIER);
+  result->set_map_after_allocation(map, SKIP_WRITE_BARRIER);
   DisallowGarbageCollection no_gc;
-  WeakFixedArray array = WeakFixedArray::cast(result);
-  array.set_length(length);
-  MemsetTagged(ObjectSlot(array.data_start()),
+  Tagged<WeakFixedArray> array = Tagged<WeakFixedArray>::cast(result);
+  array->set_length(length);
+  MemsetTagged(ObjectSlot(array->data_start()),
                read_only_roots().undefined_value(), length);
 
   return handle(array, isolate());
@@ -236,19 +248,57 @@ Handle<ByteArray> FactoryBase<Impl>::NewByteArray(int length,
   }
   if (length == 0) return impl()->empty_byte_array();
   int size = ALIGN_TO_ALLOCATION_ALIGNMENT(ByteArray::SizeFor(length));
-  HeapObject result = AllocateRawWithImmortalMap(
+  Tagged<HeapObject> result = AllocateRawWithImmortalMap(
       size, allocation, read_only_roots().byte_array_map());
   DisallowGarbageCollection no_gc;
-  ByteArray array = ByteArray::cast(result);
-  array.set_length(length);
-  array.clear_padding();
+  Tagged<ByteArray> array = Tagged<ByteArray>::cast(result);
+  array->set_length(length);
+  array->clear_padding();
+  return handle(array, isolate());
+}
+
+template <typename Impl>
+Handle<ExternalPointerArray> FactoryBase<Impl>::NewExternalPointerArray(
+    int length, AllocationType allocation) {
+  if (length < 0 || length > ExternalPointerArray::kMaxLength) {
+    FATAL("Fatal JavaScript invalid size error %d", length);
+    UNREACHABLE();
+  }
+  if (length == 0) return impl()->empty_external_pointer_array();
+  int size =
+      ALIGN_TO_ALLOCATION_ALIGNMENT(ExternalPointerArray::SizeFor(length));
+  Tagged<HeapObject> result = AllocateRawWithImmortalMap(
+      size, allocation, read_only_roots().external_pointer_array_map());
+  DisallowGarbageCollection no_gc;
+  Tagged<ExternalPointerArray> array = ExternalPointerArray::cast(result);
+  // ExternalPointerArrays must be initialized to zero so that when the sandbox
+  // is enabled, they contain all kNullExternalPointerHandle values.
+  static_assert(kNullExternalPointerHandle == 0);
+  Address data_start = array.address() + ExternalPointerArray::kHeaderSize;
+  size_t byte_length = length * kExternalPointerSlotSize;
+  memset(reinterpret_cast<uint8_t*>(data_start), 0, byte_length);
+  array->set_length(length);
   return handle(array, isolate());
 }
 
+template <typename Impl>
+Handle<DeoptimizationLiteralArray>
+FactoryBase<Impl>::NewDeoptimizationLiteralArray(int length) {
+  return Handle<DeoptimizationLiteralArray>::cast(
+      NewWeakFixedArray(length, AllocationType::kOld));
+}
+
+template <typename Impl>
+Handle<DeoptimizationFrameTranslation>
+FactoryBase<Impl>::NewDeoptimizationFrameTranslation(int length) {
+  return Handle<DeoptimizationFrameTranslation>::cast(
+      NewByteArray(length, AllocationType::kOld));
+}
+
 template <typename Impl>
 Handle<BytecodeArray> FactoryBase<Impl>::NewBytecodeArray(
-    int length, const byte* raw_bytecodes, int frame_size, int parameter_count,
-    Handle<FixedArray> constant_pool) {
+    int length, const uint8_t* raw_bytecodes, int frame_size,
+    int parameter_count, Handle<FixedArray> constant_pool) {
   if (length < 0 || length > BytecodeArray::kMaxLength) {
     FATAL("Fatal JavaScript invalid size error %d", length);
     UNREACHABLE();
@@ -258,24 +308,23 @@ Handle<BytecodeArray> FactoryBase<Impl>::NewBytecodeArray(
   DCHECK(!Heap::InYoungGeneration(*constant_pool));
 
   int size = BytecodeArray::SizeFor(length);
-  HeapObject result = AllocateRawWithImmortalMap(
+  Tagged<HeapObject> result = AllocateRawWithImmortalMap(
       size, AllocationType::kOld, read_only_roots().bytecode_array_map());
   DisallowGarbageCollection no_gc;
-  BytecodeArray instance = BytecodeArray::cast(result);
-  instance.set_length(length);
-  instance.set_frame_size(frame_size);
-  instance.set_parameter_count(parameter_count);
-  instance.set_incoming_new_target_or_generator_register(
+  Tagged<BytecodeArray> instance = Tagged<BytecodeArray>::cast(result);
+  instance->set_length(length);
+  instance->set_frame_size(frame_size);
+  instance->set_parameter_count(parameter_count);
+  instance->set_incoming_new_target_or_generator_register(
       interpreter::Register::invalid_value());
-  instance.set_bytecode_age(0);
-  instance.set_constant_pool(*constant_pool);
-  instance.set_handler_table(read_only_roots().empty_byte_array(),
-                             SKIP_WRITE_BARRIER);
-  instance.set_source_position_table(read_only_roots().undefined_value(),
-                                     kReleaseStore, SKIP_WRITE_BARRIER);
-  CopyBytes(reinterpret_cast<byte*>(instance.GetFirstBytecodeAddress()),
+  instance->set_constant_pool(*constant_pool);
+  instance->set_handler_table(read_only_roots().empty_byte_array(),
+                              SKIP_WRITE_BARRIER);
+  instance->set_source_position_table(read_only_roots().undefined_value(),
+                                      kReleaseStore, SKIP_WRITE_BARRIER);
+  CopyBytes(reinterpret_cast<uint8_t*>(instance->GetFirstBytecodeAddress()),
             raw_bytecodes, length);
-  instance.clear_padding();
+  instance->clear_padding();
   return handle(instance, isolate());
 }
 
@@ -290,42 +339,38 @@ template <typename Impl>
 Handle<Script> FactoryBase<Impl>::NewScriptWithId(
     Handle<PrimitiveHeapObject> source, int script_id,
     ScriptEventType script_event_type) {
-  DCHECK(source->IsString() || source->IsUndefined());
+  DCHECK(IsString(*source) || IsUndefined(*source));
   // Create and initialize script object.
   ReadOnlyRoots roots = read_only_roots();
   Handle<Script> script = handle(
       NewStructInternal<Script>(SCRIPT_TYPE, AllocationType::kOld), isolate());
   {
     DisallowGarbageCollection no_gc;
-    Script raw = *script;
-    raw.set_source(*source);
-    raw.set_name(roots.undefined_value(), SKIP_WRITE_BARRIER);
-    raw.set_id(script_id);
-    raw.set_line_offset(0);
-    raw.set_column_offset(0);
-    raw.set_context_data(roots.undefined_value(), SKIP_WRITE_BARRIER);
-    raw.set_type(Script::TYPE_NORMAL);
-    raw.set_line_ends(roots.undefined_value(), SKIP_WRITE_BARRIER);
-    raw.set_eval_from_shared_or_wrapped_arguments(roots.undefined_value(),
-                                                  SKIP_WRITE_BARRIER);
-    raw.set_eval_from_position(0);
-    raw.set_shared_function_infos(roots.empty_weak_fixed_array(),
+    Tagged<Script> raw = *script;
+    raw->set_source(*source);
+    raw->set_name(roots.undefined_value(), SKIP_WRITE_BARRIER);
+    raw->set_id(script_id);
+    raw->set_line_offset(0);
+    raw->set_column_offset(0);
+    raw->set_context_data(roots.undefined_value(), SKIP_WRITE_BARRIER);
+    raw->set_type(Script::Type::kNormal);
+    raw->set_line_ends(Smi::zero());
+    raw->set_eval_from_shared_or_wrapped_arguments(roots.undefined_value(),
+                                                   SKIP_WRITE_BARRIER);
+    raw->set_eval_from_position(0);
+    raw->set_shared_function_infos(roots.empty_weak_fixed_array(),
+                                   SKIP_WRITE_BARRIER);
+    raw->set_flags(0);
+    raw->set_host_defined_options(roots.empty_fixed_array(),
                                   SKIP_WRITE_BARRIER);
-    raw.set_flags(0);
-    raw.set_host_defined_options(roots.empty_fixed_array(), SKIP_WRITE_BARRIER);
-    raw.set_source_hash(roots.undefined_value(), SKIP_WRITE_BARRIER);
-    raw.set_compiled_lazy_function_positions(roots.undefined_value(),
-                                             SKIP_WRITE_BARRIER);
+    raw->set_source_hash(roots.undefined_value(), SKIP_WRITE_BARRIER);
+    raw->set_compiled_lazy_function_positions(roots.undefined_value(),
+                                              SKIP_WRITE_BARRIER);
 #ifdef V8_SCRIPTORMODULE_LEGACY_LIFETIME
-    raw.set_script_or_modules(roots.empty_array_list());
+    raw->set_script_or_modules(roots.empty_array_list());
 #endif
   }
-
-  if (script_id != Script::kTemporaryScriptId) {
-    impl()->AddToScriptList(script);
-  }
-
-  LOG(isolate(), ScriptEvent(script_event_type, script_id));
+  impl()->ProcessNewScript(script, script_event_type);
   return script;
 }
 
@@ -337,9 +382,9 @@ Handle<ArrayList> FactoryBase<Impl>::NewArrayList(int size,
       NewFixedArray(size + ArrayList::kFirstIndex, allocation);
   {
     DisallowGarbageCollection no_gc;
-    FixedArray raw = *fixed_array;
-    raw.set_map_no_write_barrier(read_only_roots().array_list_map());
-    ArrayList::cast(raw).SetLength(0);
+    Tagged<FixedArray> raw = *fixed_array;
+    raw->set_map_no_write_barrier(read_only_roots().array_list_map());
+    ArrayList::cast(raw)->SetLength(0);
   }
   return Handle<ArrayList>::cast(fixed_array);
 }
@@ -361,14 +406,14 @@ Handle<SharedFunctionInfo> FactoryBase<Impl>::NewSharedFunctionInfoForLiteral(
 template <typename Impl>
 Handle<SharedFunctionInfo> FactoryBase<Impl>::CloneSharedFunctionInfo(
     Handle<SharedFunctionInfo> other) {
-  Map map = read_only_roots().shared_function_info_map();
+  Tagged<Map> map = read_only_roots().shared_function_info_map();
 
-  SharedFunctionInfo shared =
+  Tagged<SharedFunctionInfo> shared =
       SharedFunctionInfo::cast(NewWithImmortalMap(map, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
 
-  shared.clear_padding();
-  shared.CopyFrom(*other);
+  shared->clear_padding();
+  shared->CopyFrom(*other);
 
   return handle(shared, isolate());
 }
@@ -377,14 +422,15 @@ template <typename Impl>
 Handle<PreparseData> FactoryBase<Impl>::NewPreparseData(int data_length,
                                                         int children_length) {
   int size = PreparseData::SizeFor(data_length, children_length);
-  PreparseData result = PreparseData::cast(AllocateRawWithImmortalMap(
-      size, AllocationType::kOld, read_only_roots().preparse_data_map()));
+  Tagged<PreparseData> result =
+      Tagged<PreparseData>::cast(AllocateRawWithImmortalMap(
+          size, AllocationType::kOld, read_only_roots().preparse_data_map()));
   DisallowGarbageCollection no_gc;
-  result.set_data_length(data_length);
-  result.set_children_length(children_length);
-  MemsetTagged(result.inner_data_start(), read_only_roots().null_value(),
+  result->set_data_length(data_length);
+  result->set_children_length(children_length);
+  MemsetTagged(result->inner_data_start(), read_only_roots().null_value(),
                children_length);
-  result.clear_padding();
+  result->clear_padding();
   return handle(result, isolate());
 }
 
@@ -434,17 +480,18 @@ template <typename Impl>
 Handle<SharedFunctionInfo> FactoryBase<Impl>::NewSharedFunctionInfo(
     MaybeHandle<String> maybe_name, MaybeHandle<HeapObject> maybe_function_data,
     Builtin builtin, FunctionKind kind) {
-  Handle<SharedFunctionInfo> shared = NewSharedFunctionInfo();
+  Handle<SharedFunctionInfo> shared =
+      NewSharedFunctionInfo(AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  SharedFunctionInfo raw = *shared;
+  Tagged<SharedFunctionInfo> raw = *shared;
   // Function names are assumed to be flat elsewhere.
   Handle<String> shared_name;
   bool has_shared_name = maybe_name.ToHandle(&shared_name);
   if (has_shared_name) {
     DCHECK(shared_name->IsFlat());
-    raw.set_name_or_scope_info(*shared_name, kReleaseStore);
+    raw->set_name_or_scope_info(*shared_name, kReleaseStore);
   } else {
-    DCHECK_EQ(raw.name_or_scope_info(kAcquireLoad),
+    DCHECK_EQ(raw->name_or_scope_info(kAcquireLoad),
               SharedFunctionInfo::kNoSharedNameSentinel);
   }
 
@@ -453,20 +500,20 @@ Handle<SharedFunctionInfo> FactoryBase<Impl>::NewSharedFunctionInfo(
     // If we pass function_data then we shouldn't pass a builtin index, and
     // the function_data should not be code with a builtin.
     DCHECK(!Builtins::IsBuiltinId(builtin));
-    DCHECK(!function_data->IsInstructionStream());
-    raw.set_function_data(*function_data, kReleaseStore);
+    DCHECK(!IsInstructionStream(*function_data));
+    raw->set_function_data(*function_data, kReleaseStore);
   } else if (Builtins::IsBuiltinId(builtin)) {
-    raw.set_builtin_id(builtin);
+    raw->set_builtin_id(builtin);
   } else {
-    DCHECK(raw.HasBuiltinId());
-    DCHECK_EQ(Builtin::kIllegal, raw.builtin_id());
+    DCHECK(raw->HasBuiltinId());
+    DCHECK_EQ(Builtin::kIllegal, raw->builtin_id());
   }
 
-  raw.CalculateConstructAsBuiltin();
-  raw.set_kind(kind);
+  raw->CalculateConstructAsBuiltin();
+  raw->set_kind(kind);
 
 #ifdef VERIFY_HEAP
-  if (v8_flags.verify_heap) raw.SharedFunctionInfoVerify(isolate());
+  if (v8_flags.verify_heap) raw->SharedFunctionInfoVerify(isolate());
 #endif  // VERIFY_HEAP
   return shared;
 }
@@ -518,8 +565,8 @@ FactoryBase<Impl>::NewArrayBoilerplateDescription(
   auto result = NewStructInternal<ArrayBoilerplateDescription>(
       ARRAY_BOILERPLATE_DESCRIPTION_TYPE, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  result.set_elements_kind(elements_kind);
-  result.set_constant_elements(*constant_values);
+  result->set_elements_kind(elements_kind);
+  result->set_constant_elements(*constant_values);
   return handle(result, isolate());
 }
 
@@ -527,13 +574,13 @@ template <typename Impl>
 Handle<RegExpBoilerplateDescription>
 FactoryBase<Impl>::NewRegExpBoilerplateDescription(Handle<FixedArray> data,
                                                    Handle<String> source,
-                                                   Smi flags) {
+                                                   Tagged<Smi> flags) {
   auto result = NewStructInternal<RegExpBoilerplateDescription>(
       REG_EXP_BOILERPLATE_DESCRIPTION_TYPE, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  result.set_data(*data);
-  result.set_source(*source);
-  result.set_flags(flags.value());
+  result->set_data(*data);
+  result->set_source(*source);
+  result->set_flags(flags.value());
   return handle(result, isolate());
 }
 
@@ -546,8 +593,8 @@ FactoryBase<Impl>::NewTemplateObjectDescription(
   auto result = NewStructInternal<TemplateObjectDescription>(
       TEMPLATE_OBJECT_DESCRIPTION_TYPE, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  result.set_raw_strings(*raw_strings);
-  result.set_cooked_strings(*cooked_strings);
+  result->set_raw_strings(*raw_strings);
+  result->set_cooked_strings(*cooked_strings);
   return handle(result, isolate());
 }
 
@@ -556,15 +603,16 @@ Handle<FeedbackMetadata> FactoryBase<Impl>::NewFeedbackMetadata(
     int slot_count, int create_closure_slot_count, AllocationType allocation) {
   DCHECK_LE(0, slot_count);
   int size = FeedbackMetadata::SizeFor(slot_count);
-  FeedbackMetadata result = FeedbackMetadata::cast(AllocateRawWithImmortalMap(
-      size, allocation, read_only_roots().feedback_metadata_map()));
-  result.set_slot_count(slot_count);
-  result.set_create_closure_slot_count(create_closure_slot_count);
+  Tagged<FeedbackMetadata> result =
+      Tagged<FeedbackMetadata>::cast(AllocateRawWithImmortalMap(
+          size, allocation, read_only_roots().feedback_metadata_map()));
+  result->set_slot_count(slot_count);
+  result->set_create_closure_slot_count(create_closure_slot_count);
 
   // Initialize the data section to 0.
   int data_size = size - FeedbackMetadata::kHeaderSize;
-  Address data_start = result.address() + FeedbackMetadata::kHeaderSize;
-  memset(reinterpret_cast<byte*>(data_start), 0, data_size);
+  Address data_start = result->address() + FeedbackMetadata::kHeaderSize;
+  memset(reinterpret_cast<uint8_t*>(data_start), 0, data_size);
   // Fields have been zeroed out but not initialized, so this object will not
   // pass object verification at this point.
   return handle(result, isolate());
@@ -576,13 +624,13 @@ Handle<CoverageInfo> FactoryBase<Impl>::NewCoverageInfo(
   const int slot_count = static_cast<int>(slots.size());
 
   int size = CoverageInfo::SizeFor(slot_count);
-  Map map = read_only_roots().coverage_info_map();
-  CoverageInfo info = CoverageInfo::cast(
+  Tagged<Map> map = read_only_roots().coverage_info_map();
+  Tagged<CoverageInfo> info = CoverageInfo::cast(
       AllocateRawWithImmortalMap(size, AllocationType::kOld, map));
-  info.set_slot_count(slot_count);
+  info->set_slot_count(slot_count);
   for (int i = 0; i < slot_count; i++) {
     SourceRange range = slots[i];
-    info.InitializeSlot(i, range.start, range.end);
+    info->InitializeSlot(i, range.start, range.end);
   }
   return handle(info, isolate());
 }
@@ -627,7 +675,7 @@ template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
 
 template <typename Impl>
 Handle<String> FactoryBase<Impl>::InternalizeString(
-    const base::Vector<const uint8_t>& string, bool convert_encoding) {
+    base::Vector<const uint8_t> string, bool convert_encoding) {
   SequentialStringKey<uint8_t> key(string, HashSeed(read_only_roots()),
                                    convert_encoding);
   return InternalizeStringWithKey(&key);
@@ -635,7 +683,7 @@ Handle<String> FactoryBase<Impl>::InternalizeString(
 
 template <typename Impl>
 Handle<String> FactoryBase<Impl>::InternalizeString(
-    const base::Vector<const uint16_t>& string, bool convert_encoding) {
+    base::Vector<const uint16_t> string, bool convert_encoding) {
   SequentialStringKey<uint16_t> key(string, HashSeed(read_only_roots()),
                                     convert_encoding);
   return InternalizeStringWithKey(&key);
@@ -643,7 +691,7 @@ Handle<String> FactoryBase<Impl>::InternalizeString(
 
 template <typename Impl>
 Handle<SeqOneByteString> FactoryBase<Impl>::NewOneByteInternalizedString(
-    const base::Vector<const uint8_t>& str, uint32_t raw_hash_field) {
+    base::Vector<const uint8_t> str, uint32_t raw_hash_field) {
   Handle<SeqOneByteString> result =
       AllocateRawOneByteInternalizedString(str.length(), raw_hash_field);
   // No synchronization is needed since the shared string hasn't yet escaped to
@@ -656,7 +704,7 @@ Handle<SeqOneByteString> FactoryBase<Impl>::NewOneByteInternalizedString(
 
 template <typename Impl>
 Handle<SeqTwoByteString> FactoryBase<Impl>::NewTwoByteInternalizedString(
-    const base::Vector<const base::uc16>& str, uint32_t raw_hash_field) {
+    base::Vector<const base::uc16> str, uint32_t raw_hash_field) {
   Handle<SeqTwoByteString> result =
       AllocateRawTwoByteInternalizedString(str.length(), raw_hash_field);
   // No synchronization is needed since the shared string hasn't yet escaped to
@@ -670,7 +718,7 @@ Handle<SeqTwoByteString> FactoryBase<Impl>::NewTwoByteInternalizedString(
 template <typename Impl>
 Handle<SeqOneByteString>
 FactoryBase<Impl>::NewOneByteInternalizedStringFromTwoByte(
-    const base::Vector<const base::uc16>& str, uint32_t raw_hash_field) {
+    base::Vector<const base::uc16> str, uint32_t raw_hash_field) {
   Handle<SeqOneByteString> result =
       AllocateRawOneByteInternalizedString(str.length(), raw_hash_field);
   DisallowGarbageCollection no_gc;
@@ -683,7 +731,7 @@ FactoryBase<Impl>::NewOneByteInternalizedStringFromTwoByte(
 template <typename Impl>
 template <typename SeqStringT>
 MaybeHandle<SeqStringT> FactoryBase<Impl>::NewRawStringWithMap(
-    int length, Map map, AllocationType allocation) {
+    int length, Tagged<Map> map, AllocationType allocation) {
   DCHECK(SeqStringT::IsCompatibleMap(map, read_only_roots()));
   DCHECK_IMPLIES(!StringShape(map).IsShared(),
                  RefineAllocationTypeForInPlaceInternalizableString(
@@ -708,7 +756,7 @@ MaybeHandle<SeqStringT> FactoryBase<Impl>::NewRawStringWithMap(
 template <typename Impl>
 MaybeHandle<SeqOneByteString> FactoryBase<Impl>::NewRawOneByteString(
     int length, AllocationType allocation) {
-  Map map = read_only_roots().one_byte_string_map();
+  Tagged<Map> map = read_only_roots().seq_one_byte_string_map();
   return NewRawStringWithMap<SeqOneByteString>(
       length, map,
       RefineAllocationTypeForInPlaceInternalizableString(allocation, map));
@@ -717,7 +765,7 @@ MaybeHandle<SeqOneByteString> FactoryBase<Impl>::NewRawOneByteString(
 template <typename Impl>
 MaybeHandle<SeqTwoByteString> FactoryBase<Impl>::NewRawTwoByteString(
     int length, AllocationType allocation) {
-  Map map = read_only_roots().string_map();
+  Tagged<Map> map = read_only_roots().seq_two_byte_string_map();
   return NewRawStringWithMap<SeqTwoByteString>(
       length, map,
       RefineAllocationTypeForInPlaceInternalizableString(allocation, map));
@@ -727,7 +775,7 @@ template <typename Impl>
 MaybeHandle<SeqOneByteString> FactoryBase<Impl>::NewRawSharedOneByteString(
     int length) {
   return NewRawStringWithMap<SeqOneByteString>(
-      length, read_only_roots().shared_one_byte_string_map(),
+      length, read_only_roots().shared_seq_one_byte_string_map(),
       AllocationType::kSharedOld);
 }
 
@@ -735,18 +783,18 @@ template <typename Impl>
 MaybeHandle<SeqTwoByteString> FactoryBase<Impl>::NewRawSharedTwoByteString(
     int length) {
   return NewRawStringWithMap<SeqTwoByteString>(
-      length, read_only_roots().shared_string_map(),
+      length, read_only_roots().shared_seq_two_byte_string_map(),
       AllocationType::kSharedOld);
 }
 
 template <typename Impl>
 MaybeHandle<String> FactoryBase<Impl>::NewConsString(
     Handle<String> left, Handle<String> right, AllocationType allocation) {
-  if (left->IsThinString()) {
-    left = handle(ThinString::cast(*left).actual(), isolate());
+  if (IsThinString(*left)) {
+    left = handle(ThinString::cast(*left)->actual(), isolate());
   }
-  if (right->IsThinString()) {
-    right = handle(ThinString::cast(*right).actual(), isolate());
+  if (IsThinString(*right)) {
+    right = handle(ThinString::cast(*right)->actual(), isolate());
   }
   int left_length = left->length();
   if (left_length == 0) return right;
@@ -821,23 +869,23 @@ Handle<String> FactoryBase<Impl>::NewConsString(Handle<String> left,
                                                 Handle<String> right,
                                                 int length, bool one_byte,
                                                 AllocationType allocation) {
-  DCHECK(!left->IsThinString());
-  DCHECK(!right->IsThinString());
+  DCHECK(!IsThinString(*left));
+  DCHECK(!IsThinString(*right));
   DCHECK_GE(length, ConsString::kMinLength);
   DCHECK_LE(length, String::kMaxLength);
 
-  ConsString result = ConsString::cast(
+  Tagged<ConsString> result = Tagged<ConsString>::cast(
       one_byte ? NewWithImmortalMap(
                      read_only_roots().cons_one_byte_string_map(), allocation)
-               : NewWithImmortalMap(read_only_roots().cons_string_map(),
-                                    allocation));
+               : NewWithImmortalMap(
+                     read_only_roots().cons_two_byte_string_map(), allocation));
 
   DisallowGarbageCollection no_gc;
-  WriteBarrierMode mode = result.GetWriteBarrierMode(no_gc);
-  result.set_raw_hash_field(String::kEmptyHashField);
-  result.set_length(length);
-  result.set_first(*left, mode);
-  result.set_second(*right, mode);
+  WriteBarrierMode mode = result->GetWriteBarrierMode(no_gc);
+  result->set_raw_hash_field(String::kEmptyHashField);
+  result->set_length(length);
+  result->set_first(*left, mode);
+  result->set_second(*right, mode);
   return handle(result, isolate());
 }
 
@@ -846,7 +894,7 @@ Handle<String> FactoryBase<Impl>::LookupSingleCharacterStringFromCode(
     uint16_t code) {
   if (code <= unibrow::Latin1::kMaxChar) {
     DisallowGarbageCollection no_gc;
-    Object value = single_character_string_table()->get(code);
+    Tagged<Object> value = single_character_string_table()->get(code);
     DCHECK_NE(value, *undefined_value());
     return handle(String::cast(value), isolate());
   }
@@ -856,7 +904,7 @@ Handle<String> FactoryBase<Impl>::LookupSingleCharacterStringFromCode(
 
 template <typename Impl>
 MaybeHandle<String> FactoryBase<Impl>::NewStringFromOneByte(
-    const base::Vector<const uint8_t>& string, AllocationType allocation) {
+    base::Vector<const uint8_t> string, AllocationType allocation) {
   DCHECK_NE(allocation, AllocationType::kReadOnly);
   int length = string.length();
   if (length == 0) return empty_string();
@@ -871,7 +919,7 @@ MaybeHandle<String> FactoryBase<Impl>::NewStringFromOneByte(
   // SharedStringAccessGuardIfNeeded is NotNeeded because {result} is freshly
   // allocated and hasn't escaped the factory yet, so it can't be concurrently
   // accessed.
-  CopyChars(SeqOneByteString::cast(*result).GetChars(
+  CopyChars(SeqOneByteString::cast(*result)->GetChars(
                 no_gc, SharedStringAccessGuardIfNeeded::NotNeeded()),
             string.begin(), length);
   return result;
@@ -895,8 +943,8 @@ V8_INLINE Handle<String> CharToString(FactoryBase<Impl>* factory,
 template <typename Impl>
 Handle<String> FactoryBase<Impl>::NumberToString(Handle<Object> number,
                                                  NumberCacheMode mode) {
-  SLOW_DCHECK(number->IsNumber());
-  if (number->IsSmi()) return SmiToString(Smi::cast(*number), mode);
+  SLOW_DCHECK(IsNumber(*number));
+  if (IsSmi(*number)) return SmiToString(Smi::cast(*number), mode);
 
   double double_value = Handle<HeapNumber>::cast(number)->value();
   // Try to canonicalize doubles.
@@ -918,7 +966,7 @@ Handle<String> FactoryBase<Impl>::HeapNumberToString(Handle<HeapNumber> number,
 
   if (mode == NumberCacheMode::kBoth) {
     Handle<Object> cached = impl()->NumberToStringCacheGet(*number, hash);
-    if (!cached->IsUndefined(isolate())) return Handle<String>::cast(cached);
+    if (!IsUndefined(*cached, isolate())) return Handle<String>::cast(cached);
   }
 
   Handle<String> result;
@@ -939,7 +987,7 @@ Handle<String> FactoryBase<Impl>::HeapNumberToString(Handle<HeapNumber> number,
 }
 
 template <typename Impl>
-inline Handle<String> FactoryBase<Impl>::SmiToString(Smi number,
+inline Handle<String> FactoryBase<Impl>::SmiToString(Tagged<Smi> number,
                                                      NumberCacheMode mode) {
   int hash = mode == NumberCacheMode::kIgnore
                  ? 0
@@ -947,7 +995,7 @@ inline Handle<String> FactoryBase<Impl>::SmiToString(Smi number,
 
   if (mode == NumberCacheMode::kBoth) {
     Handle<Object> cached = impl()->NumberToStringCacheGet(number, hash);
-    if (!cached->IsUndefined(isolate())) return Handle<String>::cast(cached);
+    if (!IsUndefined(*cached, isolate())) return Handle<String>::cast(cached);
   }
 
   Handle<String> result;
@@ -968,12 +1016,12 @@ inline Handle<String> FactoryBase<Impl>::SmiToString(Smi number,
   static_assert(Smi::kMaxValue <= std::numeric_limits<uint32_t>::max());
   {
     DisallowGarbageCollection no_gc;
-    String raw = *result;
-    if (raw.raw_hash_field() == String::kEmptyHashField &&
+    Tagged<String> raw = *result;
+    if (raw->raw_hash_field() == String::kEmptyHashField &&
         number.value() >= 0) {
       uint32_t raw_hash_field = StringHasher::MakeArrayIndexHash(
-          static_cast<uint32_t>(number.value()), raw.length());
-      raw.set_raw_hash_field(raw_hash_field);
+          static_cast<uint32_t>(number.value()), raw->length());
+      raw->set_raw_hash_field(raw_hash_field);
     }
   }
   return result;
@@ -986,11 +1034,12 @@ Handle<FreshlyAllocatedBigInt> FactoryBase<Impl>::NewBigInt(
     FATAL("Fatal JavaScript invalid size error %d", length);
     UNREACHABLE();
   }
-  HeapObject result = AllocateRawWithImmortalMap(
+  Tagged<HeapObject> result = AllocateRawWithImmortalMap(
       BigInt::SizeFor(length), allocation, read_only_roots().bigint_map());
   DisallowGarbageCollection no_gc;
-  FreshlyAllocatedBigInt bigint = FreshlyAllocatedBigInt::cast(result);
-  bigint.clear_padding();
+  Tagged<FreshlyAllocatedBigInt> bigint =
+      Tagged<FreshlyAllocatedBigInt>::cast(result);
+  bigint->clear_padding();
   return handle(bigint, isolate());
 }
 
@@ -999,10 +1048,10 @@ Handle<ScopeInfo> FactoryBase<Impl>::NewScopeInfo(int length,
                                                   AllocationType type) {
   DCHECK(type == AllocationType::kOld || type == AllocationType::kReadOnly);
   int size = ScopeInfo::SizeFor(length);
-  HeapObject obj = AllocateRawWithImmortalMap(
+  Tagged<HeapObject> obj = AllocateRawWithImmortalMap(
       size, type, read_only_roots().scope_info_map());
-  ScopeInfo scope_info = ScopeInfo::cast(obj);
-  MemsetTagged(scope_info.data_start(), read_only_roots().undefined_value(),
+  Tagged<ScopeInfo> scope_info = ScopeInfo::cast(obj);
+  MemsetTagged(scope_info->data_start(), read_only_roots().undefined_value(),
                length);
   return handle(scope_info, isolate());
 }
@@ -1015,22 +1064,18 @@ Handle<SourceTextModuleInfo> FactoryBase<Impl>::NewSourceTextModuleInfo() {
 }
 
 template <typename Impl>
-Handle<SharedFunctionInfo> FactoryBase<Impl>::NewSharedFunctionInfo() {
-  Map map = read_only_roots().shared_function_info_map();
+Handle<SharedFunctionInfo> FactoryBase<Impl>::NewSharedFunctionInfo(
+    AllocationType allocation) {
+  Tagged<Map> map = read_only_roots().shared_function_info_map();
+  Tagged<SharedFunctionInfo> shared =
+      SharedFunctionInfo::cast(NewWithImmortalMap(map, allocation));
 
-  SharedFunctionInfo shared =
-      SharedFunctionInfo::cast(NewWithImmortalMap(map, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  int unique_id = -1;
-#if V8_SFI_HAS_UNIQUE_ID
-  unique_id = isolate()->GetNextUniqueSharedFunctionInfoId();
-#endif  // V8_SFI_HAS_UNIQUE_ID
-
-  shared.Init(read_only_roots(), unique_id);
-
+  shared->Init(read_only_roots(), isolate()->GetAndIncNextUniqueSfiId());
 #ifdef VERIFY_HEAP
-  if (v8_flags.verify_heap) shared.SharedFunctionInfoVerify(isolate());
+  if (v8_flags.verify_heap) shared->SharedFunctionInfoVerify(isolate());
 #endif  // VERIFY_HEAP
+
   return handle(shared, isolate());
 }
 
@@ -1041,9 +1086,9 @@ Handle<DescriptorArray> FactoryBase<Impl>::NewDescriptorArray(
   // Zero-length case must be handled outside.
   DCHECK_LT(0, number_of_all_descriptors);
   int size = DescriptorArray::SizeFor(number_of_all_descriptors);
-  HeapObject obj = AllocateRawWithImmortalMap(
+  Tagged<HeapObject> obj = AllocateRawWithImmortalMap(
       size, allocation, read_only_roots().descriptor_array_map());
-  DescriptorArray array = DescriptorArray::cast(obj);
+  Tagged<DescriptorArray> array = DescriptorArray::cast(obj);
 
   auto raw_gc_state = DescriptorArrayMarkingState::kInitialGCState;
   if (allocation != AllocationType::kYoung &&
@@ -1057,9 +1102,9 @@ Handle<DescriptorArray> FactoryBase<Impl>::NewDescriptorArray(
           heap->mark_compact_collector()->epoch(), number_of_descriptors);
     }
   }
-  array.Initialize(read_only_roots().empty_enum_cache(),
-                   read_only_roots().undefined_value(), number_of_descriptors,
-                   slack, raw_gc_state);
+  array->Initialize(read_only_roots().empty_enum_cache(),
+                    read_only_roots().undefined_value(), number_of_descriptors,
+                    slack, raw_gc_state);
   return handle(array, isolate());
 }
 
@@ -1068,8 +1113,8 @@ Handle<ClassPositions> FactoryBase<Impl>::NewClassPositions(int start,
                                                             int end) {
   auto result = NewStructInternal<ClassPositions>(CLASS_POSITIONS_TYPE,
                                                   AllocationType::kOld);
-  result.set_start(start);
-  result.set_end(end);
+  result->set_start(start);
+  result->set_end(end);
   return handle(result, isolate());
 }
 
@@ -1081,21 +1126,20 @@ FactoryBase<Impl>::AllocateRawOneByteInternalizedString(
   // The canonical empty_string is the only zero-length string we allow.
   DCHECK_IMPLIES(length == 0, !impl()->EmptyStringRootIsInitialized());
 
-  Map map = read_only_roots().one_byte_internalized_string_map();
-  int size = SeqOneByteString::SizeFor(length);
-  HeapObject result = AllocateRawWithImmortalMap(
-      size,
+  Tagged<Map> map = read_only_roots().internalized_one_byte_string_map();
+  const int size = SeqOneByteString::SizeFor(length);
+  const AllocationType allocation =
       RefineAllocationTypeForInPlaceInternalizableString(
           impl()->CanAllocateInReadOnlySpace() ? AllocationType::kReadOnly
                                                : AllocationType::kOld,
-          map),
-      map);
-  SeqOneByteString answer = SeqOneByteString::cast(result);
+          map);
+  Tagged<HeapObject> result = AllocateRawWithImmortalMap(size, allocation, map);
+  Tagged<SeqOneByteString> answer = Tagged<SeqOneByteString>::cast(result);
   DisallowGarbageCollection no_gc;
-  answer.clear_padding_destructively(length);
-  answer.set_length(length);
-  answer.set_raw_hash_field(raw_hash_field);
-  DCHECK_EQ(size, answer.Size());
+  answer->clear_padding_destructively(length);
+  answer->set_length(length);
+  answer->set_raw_hash_field(raw_hash_field);
+  DCHECK_EQ(size, answer->Size());
   return handle(answer, isolate());
 }
 
@@ -1106,25 +1150,26 @@ FactoryBase<Impl>::AllocateRawTwoByteInternalizedString(
   CHECK_GE(String::kMaxLength, length);
   DCHECK_NE(0, length);  // Use Heap::empty_string() instead.
 
-  Map map = read_only_roots().internalized_string_map();
+  Tagged<Map> map = read_only_roots().internalized_two_byte_string_map();
   int size = SeqTwoByteString::SizeFor(length);
-  SeqTwoByteString answer = SeqTwoByteString::cast(AllocateRawWithImmortalMap(
-      size,
-      RefineAllocationTypeForInPlaceInternalizableString(AllocationType::kOld,
-                                                         map),
-      map));
+  Tagged<SeqTwoByteString> answer =
+      SeqTwoByteString::cast(AllocateRawWithImmortalMap(
+          size,
+          RefineAllocationTypeForInPlaceInternalizableString(
+              AllocationType::kOld, map),
+          map));
   DisallowGarbageCollection no_gc;
-  answer.clear_padding_destructively(length);
-  answer.set_length(length);
-  answer.set_raw_hash_field(raw_hash_field);
-  DCHECK_EQ(size, answer.Size());
+  answer->clear_padding_destructively(length);
+  answer->set_length(length);
+  answer->set_raw_hash_field(raw_hash_field);
+  DCHECK_EQ(size, answer->Size());
   return handle(answer, isolate());
 }
 
 template <typename Impl>
-HeapObject FactoryBase<Impl>::AllocateRawArray(int size,
-                                               AllocationType allocation) {
-  HeapObject result = AllocateRaw(size, allocation);
+Tagged<HeapObject> FactoryBase<Impl>::AllocateRawArray(
+    int size, AllocationType allocation) {
+  Tagged<HeapObject> result = AllocateRaw(size, allocation);
   if (!V8_ENABLE_THIRD_PARTY_HEAP_BOOL &&
       (size >
        isolate()->heap()->AsHeap()->MaxRegularHeapObjectSize(allocation)) &&
@@ -1135,8 +1180,8 @@ HeapObject FactoryBase<Impl>::AllocateRawArray(int size,
 }
 
 template <typename Impl>
-HeapObject FactoryBase<Impl>::AllocateRawFixedArray(int length,
-                                                    AllocationType allocation) {
+Tagged<HeapObject> FactoryBase<Impl>::AllocateRawFixedArray(
+    int length, AllocationType allocation) {
   if (length < 0 || length > FixedArray::kMaxLength) {
     FATAL("Fatal JavaScript invalid size error %d", length);
     UNREACHABLE();
@@ -1145,7 +1190,7 @@ HeapObject FactoryBase<Impl>::AllocateRawFixedArray(int length,
 }
 
 template <typename Impl>
-HeapObject FactoryBase<Impl>::AllocateRawWeakArrayList(
+Tagged<HeapObject> FactoryBase<Impl>::AllocateRawWeakArrayList(
     int capacity, AllocationType allocation) {
   if (capacity < 0 || capacity > WeakArrayList::kMaxCapacity) {
     FATAL("Fatal JavaScript invalid size error %d", capacity);
@@ -1155,28 +1200,28 @@ HeapObject FactoryBase<Impl>::AllocateRawWeakArrayList(
 }
 
 template <typename Impl>
-HeapObject FactoryBase<Impl>::NewWithImmortalMap(Map map,
-                                                 AllocationType allocation) {
-  return AllocateRawWithImmortalMap(map.instance_size(), allocation, map);
+Tagged<HeapObject> FactoryBase<Impl>::NewWithImmortalMap(
+    Tagged<Map> map, AllocationType allocation) {
+  return AllocateRawWithImmortalMap(map->instance_size(), allocation, map);
 }
 
 template <typename Impl>
-HeapObject FactoryBase<Impl>::AllocateRawWithImmortalMap(
-    int size, AllocationType allocation, Map map,
+Tagged<HeapObject> FactoryBase<Impl>::AllocateRawWithImmortalMap(
+    int size, AllocationType allocation, Tagged<Map> map,
     AllocationAlignment alignment) {
   // TODO(delphick): Potentially you could also pass a immortal immovable Map
   // from OLD_SPACE here, like external_map or message_object_map, but currently
   // no one does so this check is sufficient.
   DCHECK(ReadOnlyHeap::Contains(map));
-  HeapObject result = AllocateRaw(size, allocation, alignment);
+  Tagged<HeapObject> result = AllocateRaw(size, allocation, alignment);
   DisallowGarbageCollection no_gc;
-  result.set_map_after_allocation(map, SKIP_WRITE_BARRIER);
+  result->set_map_after_allocation(map, SKIP_WRITE_BARRIER);
   return result;
 }
 
 template <typename Impl>
-HeapObject FactoryBase<Impl>::AllocateRaw(int size, AllocationType allocation,
-                                          AllocationAlignment alignment) {
+Tagged<HeapObject> FactoryBase<Impl>::AllocateRaw(
+    int size, AllocationType allocation, AllocationAlignment alignment) {
   return impl()->AllocateRaw(size, allocation, alignment);
 }
 
@@ -1203,12 +1248,12 @@ FactoryBase<Impl>::NewSwissNameDictionaryWithCapacity(
   Handle<ByteArray> meta_table =
       impl()->NewByteArray(meta_table_length, allocation);
 
-  Map map = read_only_roots().swiss_name_dictionary_map();
+  Tagged<Map> map = read_only_roots().swiss_name_dictionary_map();
   int size = SwissNameDictionary::SizeFor(capacity);
-  SwissNameDictionary table = SwissNameDictionary::cast(
+  Tagged<SwissNameDictionary> table = SwissNameDictionary::cast(
       AllocateRawWithImmortalMap(size, allocation, map));
   DisallowGarbageCollection no_gc;
-  table.Initialize(isolate(), *meta_table, capacity);
+  table->Initialize(isolate(), *meta_table, capacity);
   return handle(table, isolate());
 }
 
@@ -1226,33 +1271,34 @@ FactoryBase<Impl>::NewFunctionTemplateRareData() {
       NewStructInternal<FunctionTemplateRareData>(
           FUNCTION_TEMPLATE_RARE_DATA_TYPE, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  function_template_rare_data.set_c_function_overloads(
+  function_template_rare_data->set_c_function_overloads(
       *impl()->empty_fixed_array(), SKIP_WRITE_BARRIER);
   return handle(function_template_rare_data, isolate());
 }
 
 template <typename Impl>
 MaybeHandle<Map> FactoryBase<Impl>::GetInPlaceInternalizedStringMap(
-    Map from_string_map) {
-  InstanceType instance_type = from_string_map.instance_type();
+    Tagged<Map> from_string_map) {
+  InstanceType instance_type = from_string_map->instance_type();
   MaybeHandle<Map> map;
   switch (instance_type) {
-    case STRING_TYPE:
-    case SHARED_STRING_TYPE:
-      map = read_only_roots().internalized_string_map_handle();
+    case SEQ_TWO_BYTE_STRING_TYPE:
+    case SHARED_SEQ_TWO_BYTE_STRING_TYPE:
+      map = read_only_roots().internalized_two_byte_string_map_handle();
       break;
-    case ONE_BYTE_STRING_TYPE:
-    case SHARED_ONE_BYTE_STRING_TYPE:
-      map = read_only_roots().one_byte_internalized_string_map_handle();
+    case SEQ_ONE_BYTE_STRING_TYPE:
+    case SHARED_SEQ_ONE_BYTE_STRING_TYPE:
+      map = read_only_roots().internalized_one_byte_string_map_handle();
       break;
-    case SHARED_EXTERNAL_STRING_TYPE:
-    case EXTERNAL_STRING_TYPE:
-      map = read_only_roots().external_internalized_string_map_handle();
+    case SHARED_EXTERNAL_TWO_BYTE_STRING_TYPE:
+    case EXTERNAL_TWO_BYTE_STRING_TYPE:
+      map =
+          read_only_roots().external_internalized_two_byte_string_map_handle();
       break;
     case SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE:
     case EXTERNAL_ONE_BYTE_STRING_TYPE:
       map =
-          read_only_roots().external_one_byte_internalized_string_map_handle();
+          read_only_roots().external_internalized_one_byte_string_map_handle();
       break;
     default:
       break;
@@ -1264,9 +1310,9 @@ MaybeHandle<Map> FactoryBase<Impl>::GetInPlaceInternalizedStringMap(
 template <typename Impl>
 AllocationType
 FactoryBase<Impl>::RefineAllocationTypeForInPlaceInternalizableString(
-    AllocationType allocation, Map string_map) {
+    AllocationType allocation, Tagged<Map> string_map) {
 #ifdef DEBUG
-  InstanceType instance_type = string_map.instance_type();
+  InstanceType instance_type = string_map->instance_type();
   DCHECK(InstanceTypeChecker::IsInternalizedString(instance_type) ||
          String::IsInPlaceInternalizable(instance_type));
 #endif
diff --git a/deps/v8/src/heap/factory-base.h b/deps/v8/src/heap/factory-base.h
index 9739d52e408886..23d6ebb01318ec 100644
--- a/deps/v8/src/heap/factory-base.h
+++ b/deps/v8/src/heap/factory-base.h
@@ -8,8 +8,8 @@
 #include "src/base/export-template.h"
 #include "src/base/strings.h"
 #include "src/common/globals.h"
+#include "src/handles/maybe-handles.h"
 #include "src/objects/code-kind.h"
-#include "src/objects/fixed-array.h"
 #include "src/objects/function-kind.h"
 #include "src/objects/instance-type.h"
 #include "src/roots/roots.h"
@@ -18,23 +18,30 @@
 namespace v8 {
 namespace internal {
 
-class HeapObject;
-class SharedFunctionInfo;
-class FunctionLiteral;
-class SeqOneByteString;
-class SeqTwoByteString;
+class ArrayBoilerplateDescription;
+class BytecodeArray;
+class ClassPositions;
+class CoverageInfo;
+class DeoptimizationLiteralArray;
+class DeoptimizationFrameTranslation;
+class FixedArray;
+template <typename T>
+class FixedIntegerArray;
 class FreshlyAllocatedBigInt;
+class FunctionLiteral;
+class HeapObject;
 class ObjectBoilerplateDescription;
-class ArrayBoilerplateDescription;
+template <typename T>
+class PodArray;
+class PreparseData;
 class RegExpBoilerplateDescription;
-class TemplateObjectDescription;
+class SeqOneByteString;
+class SeqTwoByteString;
+class SharedFunctionInfo;
 class SourceTextModuleInfo;
-class PreparseData;
+class TemplateObjectDescription;
 class UncompiledDataWithoutPreparseData;
 class UncompiledDataWithPreparseData;
-class BytecodeArray;
-class CoverageInfo;
-class ClassPositions;
 struct SourceRange;
 enum class Builtin : int32_t;
 template <typename T>
@@ -49,6 +56,9 @@ class FactoryBase;
 
 enum class NumberCacheMode { kIgnore, kSetOnly, kBoth };
 
+using FixedInt32Array = FixedIntegerArray<int32_t>;
+using FixedUInt32Array = FixedIntegerArray<uint32_t>;
+
 // Putting Torque-generated definitions in a superclass allows to shadow them
 // easily when they shouldn't be used and to reference them when they happen to
 // have the same signature.
@@ -66,8 +76,6 @@ struct NewCodeOptions {
   Builtin builtin;
   bool is_turbofanned;
   int stack_slots;
-  int kind_specific_flags;
-  AllocationType allocation;
   int instruction_size;
   int metadata_size;
   unsigned int inlined_bytecode_size;
@@ -76,16 +84,21 @@ struct NewCodeOptions {
   int constant_pool_offset;
   int code_comments_offset;
   int32_t unwinding_info_offset;
-  Handle<ByteArray> reloc_info;
   Handle<HeapObject> bytecode_or_deoptimization_data;
   Handle<ByteArray> bytecode_offsets_or_source_position_table;
+  // Either instruction_stream is set and instruction_start is kNullAddress, or
+  // instruction_stream is empty and instruction_start a valid target.
+  MaybeHandle<InstructionStream> instruction_stream;
+  Address instruction_start;
 };
 
 template <typename Impl>
 class FactoryBase : public TorqueGeneratedFactory<Impl> {
  public:
+  Handle<Code> NewCode(const NewCodeOptions& options);
+
   // Converts the given boolean condition to JavaScript boolean value.
-  inline Handle<Oddball> ToBoolean(bool value);
+  inline Handle<Boolean> ToBoolean(bool value);
 
 #define ROOT_ACCESSOR(Type, name, CamelName) inline Handle<Type> name();
   READ_ONLY_ROOT_LIST(ROOT_ACCESSOR)
@@ -119,9 +132,6 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
   // Create a pre-tenured empty AccessorPair.
   Handle<AccessorPair> NewAccessorPair();
 
-  // Creates a new Code for a InstructionStream object.
-  Handle<Code> NewCode(const NewCodeOptions& options);
-
   // Allocates a fixed array initialized with undefined values.
   Handle<FixedArray> NewFixedArray(
       int length, AllocationType allocation = AllocationType::kYoung);
@@ -149,7 +159,8 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
   // Allocates a weak fixed array-like object with given map and initialized
   // with undefined values. Length must be > 0.
   Handle<WeakFixedArray> NewWeakFixedArrayWithMap(
-      Map map, int length, AllocationType allocation = AllocationType::kYoung);
+      Tagged<Map> map, int length,
+      AllocationType allocation = AllocationType::kYoung);
 
   // Allocates a fixed array which may contain in-place weak references. The
   // array is initialized with undefined values
@@ -161,7 +172,15 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
   Handle<ByteArray> NewByteArray(
       int length, AllocationType allocation = AllocationType::kYoung);
 
-  Handle<BytecodeArray> NewBytecodeArray(int length, const byte* raw_bytecodes,
+  Handle<ExternalPointerArray> NewExternalPointerArray(
+      int length, AllocationType allocation = AllocationType::kYoung);
+
+  Handle<DeoptimizationLiteralArray> NewDeoptimizationLiteralArray(int length);
+  Handle<DeoptimizationFrameTranslation> NewDeoptimizationFrameTranslation(
+      int length);
+
+  Handle<BytecodeArray> NewBytecodeArray(int length,
+                                         const uint8_t* raw_bytecodes,
                                          int frame_size, int parameter_count,
                                          Handle<FixedArray> constant_pool);
 
@@ -175,7 +194,7 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
       ElementsKind elements_kind, Handle<FixedArrayBase> constant_values);
 
   Handle<RegExpBoilerplateDescription> NewRegExpBoilerplateDescription(
-      Handle<FixedArray> data, Handle<String> source, Smi flags);
+      Handle<FixedArray> data, Handle<String> source, Tagged<Smi> flags);
 
   // Create a new TemplateObjectDescription struct.
   Handle<TemplateObjectDescription> NewTemplateObjectDescription(
@@ -228,20 +247,20 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
 
   Handle<CoverageInfo> NewCoverageInfo(const ZoneVector<SourceRange>& slots);
 
-  Handle<String> InternalizeString(const base::Vector<const uint8_t>& string,
+  Handle<String> InternalizeString(base::Vector<const uint8_t> string,
                                    bool convert_encoding = false);
-  Handle<String> InternalizeString(const base::Vector<const uint16_t>& string,
+  Handle<String> InternalizeString(base::Vector<const uint16_t> string,
                                    bool convert_encoding = false);
 
   template <class StringTableKey>
   Handle<String> InternalizeStringWithKey(StringTableKey* key);
 
   Handle<SeqOneByteString> NewOneByteInternalizedString(
-      const base::Vector<const uint8_t>& str, uint32_t raw_hash_field);
+      base::Vector<const uint8_t> str, uint32_t raw_hash_field);
   Handle<SeqTwoByteString> NewTwoByteInternalizedString(
-      const base::Vector<const base::uc16>& str, uint32_t raw_hash_field);
+      base::Vector<const base::uc16> str, uint32_t raw_hash_field);
   Handle<SeqOneByteString> NewOneByteInternalizedStringFromTwoByte(
-      const base::Vector<const base::uc16>& str, uint32_t raw_hash_field);
+      base::Vector<const base::uc16> str, uint32_t raw_hash_field);
 
   Handle<SeqOneByteString> AllocateRawOneByteInternalizedString(
       int length, uint32_t raw_hash_field);
@@ -253,7 +272,7 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
   Handle<String> LookupSingleCharacterStringFromCode(uint16_t code);
 
   MaybeHandle<String> NewStringFromOneByte(
-      const base::Vector<const uint8_t>& string,
+      base::Vector<const uint8_t> string,
       AllocationType allocation = AllocationType::kYoung);
 
   inline Handle<String> NewStringFromAsciiChecked(
@@ -284,7 +303,7 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
       Handle<HeapNumber> number, double value,
       NumberCacheMode mode = NumberCacheMode::kBoth);
   V8_WARN_UNUSED_RESULT Handle<String> SmiToString(
-      Smi number, NumberCacheMode mode = NumberCacheMode::kBoth);
+      Tagged<Smi> number, NumberCacheMode mode = NumberCacheMode::kBoth);
 
   V8_WARN_UNUSED_RESULT MaybeHandle<SeqOneByteString> NewRawSharedOneByteString(
       int length);
@@ -303,7 +322,7 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
   Handle<SourceTextModuleInfo> NewSourceTextModuleInfo();
 
   Handle<DescriptorArray> NewDescriptorArray(
-      int number_of_entries, int slack = 0,
+      int number_of_descriptors, int slack = 0,
       AllocationType allocation = AllocationType::kYoung);
 
   Handle<ClassPositions> NewClassPositions(int start, int end);
@@ -317,36 +336,39 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
 
   Handle<FunctionTemplateRareData> NewFunctionTemplateRareData();
 
-  MaybeHandle<Map> GetInPlaceInternalizedStringMap(Map from_string_map);
+  MaybeHandle<Map> GetInPlaceInternalizedStringMap(Tagged<Map> from_string_map);
 
   AllocationType RefineAllocationTypeForInPlaceInternalizableString(
-      AllocationType allocation, Map string_map);
+      AllocationType allocation, Tagged<Map> string_map);
 
  protected:
   // Must be large enough to fit any double, int, or size_t.
   static constexpr int kNumberToStringBufferSize = 32;
 
   // Allocate memory for an uninitialized array (e.g., a FixedArray or similar).
-  HeapObject AllocateRawArray(int size, AllocationType allocation);
-  HeapObject AllocateRawFixedArray(int length, AllocationType allocation);
-  HeapObject AllocateRawWeakArrayList(int length, AllocationType allocation);
+  Tagged<HeapObject> AllocateRawArray(int size, AllocationType allocation);
+  Tagged<HeapObject> AllocateRawFixedArray(int length,
+                                           AllocationType allocation);
+  Tagged<HeapObject> AllocateRawWeakArrayList(int length,
+                                              AllocationType allocation);
 
   template <typename StructType>
-  inline StructType NewStructInternal(InstanceType type,
-                                      AllocationType allocation);
-  Struct NewStructInternal(ReadOnlyRoots roots, Map map, int size,
-                           AllocationType allocation);
+  inline Tagged<StructType> NewStructInternal(InstanceType type,
+                                              AllocationType allocation);
+  Tagged<Struct> NewStructInternal(ReadOnlyRoots roots, Tagged<Map> map,
+                                   int size, AllocationType allocation);
 
-  HeapObject AllocateRawWithImmortalMap(
-      int size, AllocationType allocation, Map map,
+  Tagged<HeapObject> AllocateRawWithImmortalMap(
+      int size, AllocationType allocation, Tagged<Map> map,
       AllocationAlignment alignment = kTaggedAligned);
-  HeapObject NewWithImmortalMap(Map map, AllocationType allocation);
+  Tagged<HeapObject> NewWithImmortalMap(Tagged<Map> map,
+                                        AllocationType allocation);
 
   Handle<FixedArray> NewFixedArrayWithFiller(Handle<Map> map, int length,
-                                             Handle<Oddball> filler,
+                                             Handle<HeapObject> filler,
                                              AllocationType allocation);
 
-  Handle<SharedFunctionInfo> NewSharedFunctionInfo();
+  Handle<SharedFunctionInfo> NewSharedFunctionInfo(AllocationType allocation);
   Handle<SharedFunctionInfo> NewSharedFunctionInfo(
       MaybeHandle<String> maybe_name,
       MaybeHandle<HeapObject> maybe_function_data, Builtin builtin,
@@ -355,7 +377,7 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
   Handle<String> MakeOrFindTwoCharacterString(uint16_t c1, uint16_t c2);
 
   template <typename SeqStringT>
-  MaybeHandle<SeqStringT> NewRawStringWithMap(int length, Map map,
+  MaybeHandle<SeqStringT> NewRawStringWithMap(int length, Tagged<Map> map,
                                               AllocationType allocation);
 
  private:
@@ -363,8 +385,9 @@ class FactoryBase : public TorqueGeneratedFactory<Impl> {
   auto isolate() { return impl()->isolate(); }
   ReadOnlyRoots read_only_roots() { return impl()->read_only_roots(); }
 
-  HeapObject AllocateRaw(int size, AllocationType allocation,
-                         AllocationAlignment alignment = kTaggedAligned);
+  Tagged<HeapObject> AllocateRaw(
+      int size, AllocationType allocation,
+      AllocationAlignment alignment = kTaggedAligned);
 
   friend TorqueGeneratedFactory<Impl>;
 };
diff --git a/deps/v8/src/heap/factory-inl.h b/deps/v8/src/heap/factory-inl.h
index f3f246091d78b3..8cc29c0453faf1 100644
--- a/deps/v8/src/heap/factory-inl.h
+++ b/deps/v8/src/heap/factory-inl.h
@@ -9,9 +9,11 @@
 
 // Clients of this interface shouldn't depend on lots of heap internals.
 // Do not include anything from src/heap here!
+// TODO(all): Remove the heap-inl.h include below.
 #include "src/execution/isolate-inl.h"
 #include "src/handles/handles-inl.h"
 #include "src/heap/factory-base-inl.h"
+#include "src/heap/heap-inl.h"  // For MaxNumberToStringCacheSize.
 #include "src/objects/feedback-cell.h"
 #include "src/objects/heap-number-inl.h"
 #include "src/objects/objects-inl.h"
@@ -30,22 +32,31 @@ namespace internal {
 MUTABLE_ROOT_LIST(ROOT_ACCESSOR)
 #undef ROOT_ACCESSOR
 
-bool Factory::CodeBuilder::CompiledWithConcurrentBaseline() const {
-  return v8_flags.concurrent_sparkplug && kind_ == CodeKind::BASELINE &&
-         !local_isolate_->is_main_thread();
-}
-
 Handle<String> Factory::InternalizeString(Handle<String> string) {
-  if (string->IsInternalizedString()) return string;
+  if (IsInternalizedString(*string)) return string;
   return isolate()->string_table()->LookupString(isolate(), string);
 }
 
 Handle<Name> Factory::InternalizeName(Handle<Name> name) {
-  if (name->IsUniqueName()) return name;
+  if (IsUniqueName(*name)) return name;
   return isolate()->string_table()->LookupString(isolate(),
                                                  Handle<String>::cast(name));
 }
 
+template <size_t N>
+Handle<String> Factory::NewStringFromStaticChars(const char (&str)[N],
+                                                 AllocationType allocation) {
+  DCHECK_EQ(N, strlen(str) + 1);
+  return NewStringFromOneByte(base::StaticOneByteVector(str), allocation)
+      .ToHandleChecked();
+}
+
+Handle<String> Factory::NewStringFromAsciiChecked(const char* str,
+                                                  AllocationType allocation) {
+  return NewStringFromOneByte(base::OneByteVector(str), allocation)
+      .ToHandleChecked();
+}
+
 Handle<String> Factory::NewSubString(Handle<String> str, int begin, int end) {
   if (begin == 0 && end == str->length()) return str;
   return NewProperSubString(str, begin, end);
@@ -67,6 +78,13 @@ Handle<JSObject> Factory::NewFastOrSlowJSObjectFromMap(
              : NewJSObjectFromMap(map, allocation, allocation_site);
 }
 
+Handle<JSObject> Factory::NewFastOrSlowJSObjectFromMap(Handle<Map> map) {
+  return NewFastOrSlowJSObjectFromMap(
+      map, V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL
+               ? SwissNameDictionary::kInitialCapacity
+               : NameDictionary::kInitialCapacity);
+}
+
 Handle<Object> Factory::NewURIError() {
   return NewError(isolate()->uri_error_function(),
                   MessageTemplate::kURIMalformed);
@@ -83,15 +101,15 @@ HeapAllocator* Factory::allocator() const {
 Factory::CodeBuilder& Factory::CodeBuilder::set_interpreter_data(
     Handle<HeapObject> interpreter_data) {
   // This DCHECK requires this function to be in -inl.h.
-  DCHECK(interpreter_data->IsInterpreterData() ||
-         interpreter_data->IsBytecodeArray());
+  DCHECK(IsInterpreterData(*interpreter_data) ||
+         IsBytecodeArray(*interpreter_data));
   interpreter_data_ = interpreter_data;
   return *this;
 }
 
 void Factory::NumberToStringCacheSet(Handle<Object> number, int hash,
                                      Handle<String> js_string) {
-  if (!number_string_cache()->get(hash * 2).IsUndefined(isolate()) &&
+  if (!IsUndefined(number_string_cache()->get(hash * 2), isolate()) &&
       !v8_flags.optimize_for_size) {
     int full_size = isolate()->heap()->MaxNumberToStringCacheSize();
     if (number_string_cache()->length() != full_size) {
@@ -102,18 +120,19 @@ void Factory::NumberToStringCacheSet(Handle<Object> number, int hash,
     }
   }
   DisallowGarbageCollection no_gc;
-  FixedArray cache = *number_string_cache();
-  cache.set(hash * 2, *number);
-  cache.set(hash * 2 + 1, *js_string);
+  Tagged<FixedArray> cache = *number_string_cache();
+  cache->set(hash * 2, *number);
+  cache->set(hash * 2 + 1, *js_string);
 }
 
-Handle<Object> Factory::NumberToStringCacheGet(Object number, int hash) {
+Handle<Object> Factory::NumberToStringCacheGet(Tagged<Object> number,
+                                               int hash) {
   DisallowGarbageCollection no_gc;
-  FixedArray cache = *number_string_cache();
-  Object key = cache.get(hash * 2);
-  if (key == number || (key.IsHeapNumber() && number.IsHeapNumber() &&
-                        key.Number() == number.Number())) {
-    return Handle<String>(String::cast(cache.get(hash * 2 + 1)), isolate());
+  Tagged<FixedArray> cache = *number_string_cache();
+  Tagged<Object> key = cache->get(hash * 2);
+  if (key == number || (IsHeapNumber(key) && IsHeapNumber(number) &&
+                        Object::Number(key) == Object::Number(number))) {
+    return Handle<String>(String::cast(cache->get(hash * 2 + 1)), isolate());
   }
   return undefined_value();
 }
diff --git a/deps/v8/src/heap/factory.cc b/deps/v8/src/heap/factory.cc
index c952862340dd63..462a3944e14d6d 100644
--- a/deps/v8/src/heap/factory.cc
+++ b/deps/v8/src/heap/factory.cc
@@ -95,7 +95,8 @@ Factory::CodeBuilder::CodeBuilder(Isolate* isolate, const CodeDesc& desc,
       local_isolate_(isolate_->main_thread_local_isolate()),
       code_desc_(desc),
       kind_(kind),
-      position_table_(isolate_->factory()->empty_byte_array()) {}
+      position_table_(isolate_->factory()->empty_byte_array()),
+      deoptimization_data_(DeoptimizationData::Empty(isolate_)) {}
 
 Factory::CodeBuilder::CodeBuilder(LocalIsolate* local_isolate,
                                   const CodeDesc& desc, CodeKind kind)
@@ -103,52 +104,31 @@ Factory::CodeBuilder::CodeBuilder(LocalIsolate* local_isolate,
       local_isolate_(local_isolate),
       code_desc_(desc),
       kind_(kind),
-      position_table_(isolate_->factory()->empty_byte_array()) {}
+      position_table_(isolate_->factory()->empty_byte_array()),
+      deoptimization_data_(DeoptimizationData::Empty(isolate_)) {}
+
+Handle<ByteArray> Factory::CodeBuilder::NewByteArray(
+    int length, AllocationType allocation) {
+  return local_isolate_->factory()->NewByteArray(length, allocation);
+}
+
+Handle<Code> Factory::CodeBuilder::NewCode(const NewCodeOptions& options) {
+  return local_isolate_->factory()->NewCode(options);
+}
 
 MaybeHandle<Code> Factory::CodeBuilder::BuildInternal(
     bool retry_allocation_or_fail) {
-  const auto factory = isolate_->factory();
-  // Allocate objects needed for code initialization.
   Handle<ByteArray> reloc_info =
-      CompiledWithConcurrentBaseline()
-          ? local_isolate_->factory()->NewByteArray(code_desc_.reloc_size,
-                                                    AllocationType::kOld)
-          : factory->NewByteArray(code_desc_.reloc_size, AllocationType::kOld);
-
-  Handle<Code> code;
+      NewByteArray(code_desc_.reloc_size, AllocationType::kOld);
 
-  NewCodeOptions new_code_options = {
-      /*kind=*/kind_,
-      /*builtin=*/builtin_,
-      /*is_turbofanned=*/is_turbofanned_,
-      /*stack_slots=*/stack_slots_,
-      /*kind_specific_flags=*/kind_specific_flags_,
-      /*allocation=*/AllocationType::kOld,
-      /*instruction_size=*/code_desc_.instruction_size(),
-      /*metadata_size=*/code_desc_.metadata_size(),
-      /*inlined_bytecode_size=*/inlined_bytecode_size_,
-      /*osr_offset=*/osr_offset_,
-      /*handler_table_offset=*/code_desc_.handler_table_offset_relative(),
-      /*constant_pool_offset=*/code_desc_.constant_pool_offset_relative(),
-      /*code_comments_offset=*/code_desc_.code_comments_offset_relative(),
-      /*unwinding_info_offset=*/code_desc_.unwinding_info_offset_relative(),
-      /*reloc_info=*/reloc_info,
-      /*bytecode_or_deoptimization_data=*/kind_ == CodeKind::BASELINE
-          ? interpreter_data_
-          : deoptimization_data_,
-      /*bytecode_offsets_or_source_position_table=*/position_table_};
-
-  if (CompiledWithConcurrentBaseline()) {
-    code = local_isolate_->factory()->NewCode(new_code_options);
-  } else {
-    code = factory->NewCode(new_code_options);
-  }
+  CodePageHeaderModificationScope memory_write_scope(
+      "Write barriers need to access the IStreams' page headers.");
 
   // Basic block profiling data for builtins is stored in the JS heap rather
   // than in separately-allocated C++ objects. Allocate that data now if
   // appropriate.
   Handle<OnHeapBasicBlockProfilerData> on_heap_profiler_data;
-  if (profiler_data_ && isolate_->IsGeneratingEmbeddedBuiltins()) {
+  if (V8_UNLIKELY(profiler_data_ && isolate_->IsGeneratingEmbeddedBuiltins())) {
     on_heap_profiler_data = profiler_data_->CopyToJSHeap(isolate_);
 
     // Add the on-heap data to a global list, which keeps it alive and allows
@@ -160,152 +140,139 @@ MaybeHandle<Code> Factory::CodeBuilder::BuildInternal(
     isolate_->heap()->SetBasicBlockProfilingData(new_list);
   }
 
-  static_assert(InstructionStream::kOnHeapBodyIsContiguous);
-  Heap* heap = isolate_->heap();
-  CodePageCollectionMemoryModificationScope code_allocation(heap);
-
-  Handle<InstructionStream> instruction_stream;
-  if (CompiledWithConcurrentBaseline()) {
-    if (!AllocateConcurrentSparkplugInstructionStream(retry_allocation_or_fail)
-             .ToHandle(&instruction_stream)) {
-      return {};
-    }
-  } else if (!AllocateInstructionStream(retry_allocation_or_fail)
-                  .ToHandle(&instruction_stream)) {
+  Tagged<HeapObject> istream_allocation =
+      AllocateUninitializedInstructionStream(retry_allocation_or_fail);
+  if (istream_allocation->is_null()) {
     return {};
   }
 
+  Handle<InstructionStream> istream;
   {
-    InstructionStream raw_istream = *instruction_stream;
+    // The InstructionStream object has not been fully initialized yet. We
+    // rely on the fact that no allocation will happen from this point on.
     DisallowGarbageCollection no_gc;
+    Tagged<InstructionStream> raw_istream = InstructionStream::Initialize(
+        istream_allocation,
+        ReadOnlyRoots(local_isolate_).instruction_stream_map(),
+        code_desc_.body_size(), *reloc_info);
+    istream = handle(raw_istream, local_isolate_);
+    DCHECK(IsAligned(istream->instruction_start(), kCodeAlignment));
+    DCHECK_IMPLIES(
+        !V8_ENABLE_THIRD_PARTY_HEAP_BOOL &&
+            !local_isolate_->heap()->heap()->code_region().is_empty(),
+        local_isolate_->heap()->heap()->code_region().contains(
+            istream->address()));
+  }
 
-    // This might impact direct concurrent reads from TF if we are resetting
-    // this field. We currently assume it's immutable thus a relaxed read (after
-    // passing IsPendingAllocation).
-    raw_istream.set_code(*code, kReleaseStore);
-
-    // Allow self references to created code object by patching the handle to
-    // point to the newly allocated InstructionStream object.
-    Handle<Object> self_reference;
-    if (self_reference_.ToHandle(&self_reference)) {
-      DCHECK(self_reference->IsOddball());
-      DCHECK_EQ(Oddball::cast(*self_reference).kind(),
-                Oddball::kSelfReferenceMarker);
-      DCHECK_NE(kind_, CodeKind::BASELINE);
-      if (isolate_->IsGeneratingEmbeddedBuiltins()) {
-        isolate_->builtins_constants_table_builder()->PatchSelfReference(
-            self_reference, instruction_stream);
+  Handle<Code> code;
+  {
+    static_assert(InstructionStream::kOnHeapBodyIsContiguous);
+
+    NewCodeOptions new_code_options = {
+        kind_,
+        builtin_,
+        is_turbofanned_,
+        stack_slots_,
+        code_desc_.instruction_size(),
+        code_desc_.metadata_size(),
+        inlined_bytecode_size_,
+        osr_offset_,
+        code_desc_.handler_table_offset_relative(),
+        code_desc_.constant_pool_offset_relative(),
+        code_desc_.code_comments_offset_relative(),
+        code_desc_.unwinding_info_offset_relative(),
+        /*bytecode_or_deoptimization_data=*/kind_ == CodeKind::BASELINE
+            ? interpreter_data_
+            : deoptimization_data_,
+        /*bytecode_offsets_or_source_position_table=*/position_table_,
+        istream,
+        /*instruction_start=*/kNullAddress,
+    };
+    code = NewCode(new_code_options);
+    DCHECK_EQ(istream->body_size(), code->body_size());
+
+    {
+      DisallowGarbageCollection no_gc;
+      Tagged<InstructionStream> raw_istream = *istream;
+
+      // Allow self references to created code object by patching the handle to
+      // point to the newly allocated InstructionStream object.
+      Handle<Object> self_reference;
+      if (self_reference_.ToHandle(&self_reference)) {
+        DCHECK(IsOddball(*self_reference));
+        DCHECK_EQ(Oddball::cast(*self_reference)->kind(),
+                  Oddball::kSelfReferenceMarker);
+        DCHECK_NE(kind_, CodeKind::BASELINE);
+        if (isolate_->IsGeneratingEmbeddedBuiltins()) {
+          isolate_->builtins_constants_table_builder()->PatchSelfReference(
+              self_reference, istream);
+        }
+        self_reference.PatchValue(raw_istream);
       }
-      self_reference.PatchValue(*instruction_stream);
-    }
 
-    // Likewise, any references to the basic block counters marker need to be
-    // updated to point to the newly-allocated counters array.
-    if (!on_heap_profiler_data.is_null()) {
-      isolate_->builtins_constants_table_builder()
-          ->PatchBasicBlockCountersReference(
-              handle(on_heap_profiler_data->counts(), isolate_));
-    }
-
-    if (V8_EXTERNAL_CODE_SPACE_BOOL) {
-      raw_istream.set_main_cage_base(isolate_->cage_base(), kRelaxedStore);
-    }
-    code->SetInstructionStreamAndEntryPoint(isolate_, raw_istream);
-
-    // Migrate generated code.
-    // The generated code can contain embedded objects (typically from
-    // handles) in a pointer-to-tagged-value format (i.e. with indirection
-    // like a handle) that are dereferenced during the copy to point directly
-    // to the actual heap objects. These pointers can include references to
-    // the code object itself, through the self_reference parameter.
-    code->CopyFromNoFlush(*reloc_info, heap, code_desc_);
+      // Likewise, any references to the basic block counters marker need to be
+      // updated to point to the newly-allocated counters array.
+      if (V8_UNLIKELY(!on_heap_profiler_data.is_null())) {
+        isolate_->builtins_constants_table_builder()
+            ->PatchBasicBlockCountersReference(
+                handle(on_heap_profiler_data->counts(), isolate_));
+      }
 
-    code->ClearInstructionStreamPadding();
+      // Migrate generated code.
+      // The generated code can contain embedded objects (typically from
+      // handles) in a pointer-to-tagged-value format (i.e. with indirection
+      // like a handle) that are dereferenced during the copy to point
+      // directly to the actual heap objects. These pointers can include
+      // references to the code object itself, through the self_reference
+      // parameter.
+      istream->Finalize(*code, *reloc_info, code_desc_, isolate_->heap());
 
 #ifdef VERIFY_HEAP
-    if (v8_flags.verify_heap) {
-      HeapObject::VerifyCodePointer(isolate_, raw_istream);
-    }
+      if (v8_flags.verify_heap) {
+        HeapObject::VerifyCodePointer(isolate_, raw_istream);
+      }
 #endif
-
-    // Flush the instruction cache before changing the permissions.
-    // Note: we do this before setting permissions to ReadExecute because on
-    // some older ARM kernels there is a bug which causes an access error on
-    // cache flush instructions to trigger access error on non-writable memory.
-    // See https://bugs.chromium.org/p/v8/issues/detail?id=8157
-    code->FlushICache();
+    }
   }
 
-  if (V8_UNLIKELY(profiler_data_ && v8_flags.turbo_profiling_verbose)) {
 #ifdef ENABLE_DISASSEMBLER
+  if (V8_UNLIKELY(profiler_data_ && v8_flags.turbo_profiling_verbose)) {
     std::ostringstream os;
     code->Disassemble(nullptr, os, isolate_);
     if (!on_heap_profiler_data.is_null()) {
       Handle<String> disassembly =
-          isolate_->factory()->NewStringFromAsciiChecked(os.str().c_str(),
-                                                         AllocationType::kOld);
+          local_isolate_->factory()->NewStringFromAsciiChecked(
+              os.str().c_str(), AllocationType::kOld);
       on_heap_profiler_data->set_code(*disassembly);
     } else {
       profiler_data_->SetCode(os);
     }
-#endif  // ENABLE_DISASSEMBLER
   }
+#endif  // ENABLE_DISASSEMBLER
 
   return code;
 }
 
-// TODO(victorgomes): Unify the two AllocateCodes
-MaybeHandle<InstructionStream> Factory::CodeBuilder::AllocateInstructionStream(
+Tagged<HeapObject> Factory::CodeBuilder::AllocateUninitializedInstructionStream(
     bool retry_allocation_or_fail) {
-  Heap* heap = isolate_->heap();
-  HeapAllocator* allocator = heap->allocator();
-  HeapObject result;
-  const AllocationType allocation_type = AllocationType::kCode;
+  LocalHeap* heap = local_isolate_->heap();
+  Tagged<HeapObject> result;
   const int object_size = InstructionStream::SizeFor(code_desc_.body_size());
   if (retry_allocation_or_fail) {
-    result = allocator->AllocateRawWith<HeapAllocator::kRetryOrFail>(
-        object_size, allocation_type, AllocationOrigin::kRuntime);
+    // Only allowed to do `retry_allocation_or_fail` from the main thread.
+    // TODO(leszeks): Remove the retrying allocation, always use TryBuild in
+    // the code builder.
+    DCHECK(local_isolate_->is_main_thread());
+    result =
+        heap->heap()->allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
+            object_size, AllocationType::kCode, AllocationOrigin::kRuntime);
+    CHECK(!result.is_null());
+    return result;
   } else {
-    result = allocator->AllocateRawWith<HeapAllocator::kLightRetry>(
-        object_size, allocation_type, AllocationOrigin::kRuntime);
-    // Return an empty handle if we cannot allocate the code object.
-    if (result.is_null()) return MaybeHandle<InstructionStream>();
+    // Return null if we cannot allocate the code object.
+    return heap->AllocateRawWith<LocalHeap::kLightRetry>(object_size,
+                                                         AllocationType::kCode);
   }
-
-  // The code object has not been fully initialized yet.  We rely on the
-  // fact that no allocation will happen from this point on.
-  DisallowGarbageCollection no_gc;
-  result.set_map_after_allocation(
-      *isolate_->factory()->instruction_stream_map(), SKIP_WRITE_BARRIER);
-  Handle<InstructionStream> istream =
-      handle(InstructionStream::cast(result), isolate_);
-  DCHECK(IsAligned(istream->instruction_start(), kCodeAlignment));
-  DCHECK_IMPLIES(
-      !V8_ENABLE_THIRD_PARTY_HEAP_BOOL && !heap->code_region().is_empty(),
-      heap->code_region().contains(istream->address()));
-  return istream;
-}
-
-MaybeHandle<InstructionStream>
-Factory::CodeBuilder::AllocateConcurrentSparkplugInstructionStream(
-    bool retry_allocation_or_fail) {
-  LocalHeap* heap = local_isolate_->heap();
-  const int object_size = InstructionStream::SizeFor(code_desc_.body_size());
-  HeapObject result;
-  if (!heap->AllocateRaw(object_size, AllocationType::kCode).To(&result)) {
-    return MaybeHandle<InstructionStream>();
-  }
-  CHECK(!result.is_null());
-
-  // The code object has not been fully initialized yet.  We rely on the
-  // fact that no allocation will happen from this point on.
-  DisallowGarbageCollection no_gc;
-  result.set_map_after_allocation(
-      *local_isolate_->factory()->instruction_stream_map(), SKIP_WRITE_BARRIER);
-  Handle<InstructionStream> istream =
-      handle(InstructionStream::cast(result), local_isolate_);
-  DCHECK(IsAligned(istream->instruction_start(), kCodeAlignment));
-  return istream;
 }
 
 MaybeHandle<Code> Factory::CodeBuilder::TryBuild() {
@@ -316,13 +283,13 @@ Handle<Code> Factory::CodeBuilder::Build() {
   return BuildInternal(true).ToHandleChecked();
 }
 
-HeapObject Factory::AllocateRaw(int size, AllocationType allocation,
-                                AllocationAlignment alignment) {
+Tagged<HeapObject> Factory::AllocateRaw(int size, AllocationType allocation,
+                                        AllocationAlignment alignment) {
   return allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
       size, allocation, AllocationOrigin::kRuntime, alignment);
 }
 
-HeapObject Factory::AllocateRawWithAllocationSite(
+Tagged<HeapObject> Factory::AllocateRawWithAllocationSite(
     Handle<Map> map, AllocationType allocation,
     Handle<AllocationSite> allocation_site) {
   DCHECK(map->instance_type() != MAP_TYPE);
@@ -331,42 +298,45 @@ HeapObject Factory::AllocateRawWithAllocationSite(
     DCHECK(V8_ALLOCATION_SITE_TRACKING_BOOL);
     size += ALIGN_TO_ALLOCATION_ALIGNMENT(AllocationMemento::kSize);
   }
-  HeapObject result = allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
-      size, allocation);
+  Tagged<HeapObject> result =
+      allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(size,
+                                                                allocation);
   WriteBarrierMode write_barrier_mode = allocation == AllocationType::kYoung
                                             ? SKIP_WRITE_BARRIER
                                             : UPDATE_WRITE_BARRIER;
-  result.set_map_after_allocation(*map, write_barrier_mode);
+  result->set_map_after_allocation(*map, write_barrier_mode);
   if (!allocation_site.is_null()) {
     int aligned_size = ALIGN_TO_ALLOCATION_ALIGNMENT(map->instance_size());
-    AllocationMemento alloc_memento =
-        AllocationMemento::unchecked_cast(Object(result.ptr() + aligned_size));
+    Tagged<AllocationMemento> alloc_memento =
+        Tagged<AllocationMemento>::unchecked_cast(
+            Tagged<Object>(result.ptr() + aligned_size));
     InitializeAllocationMemento(alloc_memento, *allocation_site);
   }
   return result;
 }
 
-void Factory::InitializeAllocationMemento(AllocationMemento memento,
-                                          AllocationSite allocation_site) {
+void Factory::InitializeAllocationMemento(
+    Tagged<AllocationMemento> memento, Tagged<AllocationSite> allocation_site) {
   DCHECK(V8_ALLOCATION_SITE_TRACKING_BOOL);
-  memento.set_map_after_allocation(*allocation_memento_map(),
-                                   SKIP_WRITE_BARRIER);
-  memento.set_allocation_site(allocation_site, SKIP_WRITE_BARRIER);
+  memento->set_map_after_allocation(*allocation_memento_map(),
+                                    SKIP_WRITE_BARRIER);
+  memento->set_allocation_site(allocation_site, SKIP_WRITE_BARRIER);
   if (v8_flags.allocation_site_pretenuring) {
-    allocation_site.IncrementMementoCreateCount();
+    allocation_site->IncrementMementoCreateCount();
   }
 }
 
-HeapObject Factory::New(Handle<Map> map, AllocationType allocation) {
+Tagged<HeapObject> Factory::New(Handle<Map> map, AllocationType allocation) {
   DCHECK(map->instance_type() != MAP_TYPE);
   int size = map->instance_size();
-  HeapObject result = allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
-      size, allocation);
+  Tagged<HeapObject> result =
+      allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(size,
+                                                                allocation);
   // New space objects are allocated white.
   WriteBarrierMode write_barrier_mode = allocation == AllocationType::kYoung
                                             ? SKIP_WRITE_BARRIER
                                             : UPDATE_WRITE_BARRIER;
-  result.set_map_after_allocation(*map, write_barrier_mode);
+  result->set_map_after_allocation(*map, write_barrier_mode);
   return result;
 }
 
@@ -375,8 +345,9 @@ Handle<HeapObject> Factory::NewFillerObject(int size,
                                             AllocationType allocation,
                                             AllocationOrigin origin) {
   Heap* heap = isolate()->heap();
-  HeapObject result = allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
-      size, allocation, origin, alignment);
+  Tagged<HeapObject> result =
+      allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
+          size, allocation, origin, alignment);
   heap->CreateFillerObjectAt(result.address(), size);
   return Handle<HeapObject>(result, isolate());
 }
@@ -385,10 +356,10 @@ Handle<PrototypeInfo> Factory::NewPrototypeInfo() {
   auto result = NewStructInternal<PrototypeInfo>(PROTOTYPE_INFO_TYPE,
                                                  AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  result.set_prototype_users(Smi::zero());
-  result.set_registry_slot(PrototypeInfo::UNREGISTERED);
-  result.set_bit_field(0);
-  result.set_module_namespace(*undefined_value(), SKIP_WRITE_BARRIER);
+  result->set_prototype_users(Smi::zero());
+  result->set_registry_slot(PrototypeInfo::UNREGISTERED);
+  result->set_bit_field(0);
+  result->set_module_namespace(*undefined_value(), SKIP_WRITE_BARRIER);
   return handle(result, isolate());
 }
 
@@ -398,11 +369,16 @@ Handle<EnumCache> Factory::NewEnumCache(Handle<FixedArray> keys,
   DCHECK(allocation == AllocationType::kOld ||
          allocation == AllocationType::kSharedOld);
   DCHECK_EQ(allocation == AllocationType::kSharedOld,
-            keys->InSharedHeap() && indices->InSharedHeap());
+            Object::InSharedHeap(*keys) && Object::InSharedHeap(*indices));
   auto result = NewStructInternal<EnumCache>(ENUM_CACHE_TYPE, allocation);
   DisallowGarbageCollection no_gc;
-  result.set_keys(*keys);
-  result.set_indices(*indices);
+  result->set_keys(*keys);
+  result->set_indices(*indices);
+  return handle(result, isolate());
+}
+
+Handle<Tuple2> Factory::NewTuple2Uninitialized(AllocationType allocation) {
+  auto result = NewStructInternal<Tuple2>(TUPLE2_TYPE, allocation);
   return handle(result, isolate());
 }
 
@@ -410,14 +386,21 @@ Handle<Tuple2> Factory::NewTuple2(Handle<Object> value1, Handle<Object> value2,
                                   AllocationType allocation) {
   auto result = NewStructInternal<Tuple2>(TUPLE2_TYPE, allocation);
   DisallowGarbageCollection no_gc;
-  result.set_value1(*value1);
-  result.set_value2(*value2);
+  result->set_value1(*value1);
+  result->set_value2(*value2);
   return handle(result, isolate());
 }
 
+Handle<Hole> Factory::NewHole() {
+  Handle<Hole> hole(Hole::cast(New(hole_map(), AllocationType::kReadOnly)),
+                    isolate());
+  Hole::Initialize(isolate(), hole, hole_nan_value());
+  return hole;
+}
+
 Handle<Oddball> Factory::NewOddball(Handle<Map> map, const char* to_string,
                                     Handle<Object> to_number,
-                                    const char* type_of, byte kind) {
+                                    const char* type_of, uint8_t kind) {
   Handle<Oddball> oddball(Oddball::cast(New(map, AllocationType::kReadOnly)),
                           isolate());
   Oddball::Initialize(isolate(), oddball, to_string, to_number, type_of, kind);
@@ -441,12 +424,13 @@ Handle<PropertyArray> Factory::NewPropertyArray(int length,
                                                 AllocationType allocation) {
   DCHECK_LE(0, length);
   if (length == 0) return empty_property_array();
-  HeapObject result = AllocateRawFixedArray(length, allocation);
+  Tagged<HeapObject> result = AllocateRawFixedArray(length, allocation);
   DisallowGarbageCollection no_gc;
-  result.set_map_after_allocation(*property_array_map(), SKIP_WRITE_BARRIER);
-  PropertyArray array = PropertyArray::cast(result);
-  array.initialize_length(length);
-  MemsetTagged(array.data_start(), read_only_roots().undefined_value(), length);
+  result->set_map_after_allocation(*property_array_map(), SKIP_WRITE_BARRIER);
+  Tagged<PropertyArray> array = Tagged<PropertyArray>::cast(result);
+  array->initialize_length(length);
+  MemsetTagged(array->data_start(), read_only_roots().undefined_value(),
+               length);
   return handle(array, isolate());
 }
 
@@ -458,17 +442,17 @@ MaybeHandle<FixedArray> Factory::TryNewFixedArray(
   int size = FixedArray::SizeFor(length);
   Heap* heap = isolate()->heap();
   AllocationResult allocation = heap->AllocateRaw(size, allocation_type);
-  HeapObject result;
+  Tagged<HeapObject> result;
   if (!allocation.To(&result)) return MaybeHandle<FixedArray>();
   if ((size > heap->MaxRegularHeapObjectSize(allocation_type)) &&
       v8_flags.use_marking_progress_bar) {
     LargePage::FromHeapObject(result)->ProgressBar().Enable();
   }
   DisallowGarbageCollection no_gc;
-  result.set_map_after_allocation(*fixed_array_map(), SKIP_WRITE_BARRIER);
-  FixedArray array = FixedArray::cast(result);
-  array.set_length(length);
-  MemsetTagged(array.data_start(), *undefined_value(), length);
+  result->set_map_after_allocation(*fixed_array_map(), SKIP_WRITE_BARRIER);
+  Tagged<FixedArray> array = Tagged<FixedArray>::cast(result);
+  array->set_length(length);
+  MemsetTagged(array->data_start(), *undefined_value(), length);
   return handle(array, isolate());
 }
 
@@ -488,37 +472,39 @@ Handle<FeedbackVector> Factory::NewFeedbackVector(
     Handle<SharedFunctionInfo> shared,
     Handle<ClosureFeedbackCellArray> closure_feedback_cell_array,
     Handle<FeedbackCell> parent_feedback_cell) {
-  int length = shared->feedback_metadata().slot_count();
+  int length = shared->feedback_metadata()->slot_count();
   DCHECK_LE(0, length);
   int size = FeedbackVector::SizeFor(length);
 
-  FeedbackVector vector = FeedbackVector::cast(AllocateRawWithImmortalMap(
-      size, AllocationType::kOld, *feedback_vector_map()));
+  Tagged<FeedbackVector> vector =
+      Tagged<FeedbackVector>::cast(AllocateRawWithImmortalMap(
+          size, AllocationType::kOld, *feedback_vector_map()));
   DisallowGarbageCollection no_gc;
-  vector.set_shared_function_info(*shared);
-  vector.set_maybe_optimized_code(HeapObjectReference::ClearedValue(isolate()));
-  vector.set_length(length);
-  vector.set_invocation_count(0);
-  vector.set_profiler_ticks(0);
-  vector.set_placeholder0(0);
-  vector.reset_osr_state();
-  vector.reset_flags();
-  vector.set_log_next_execution(v8_flags.log_function_events);
-  vector.set_closure_feedback_cell_array(*closure_feedback_cell_array);
-  vector.set_parent_feedback_cell(*parent_feedback_cell);
+  vector->set_shared_function_info(*shared);
+  vector->set_maybe_optimized_code(
+      HeapObjectReference::ClearedValue(isolate()));
+  vector->set_length(length);
+  vector->set_invocation_count(0);
+  vector->set_placeholder0(0);
+  vector->reset_osr_state();
+  vector->reset_flags();
+  vector->set_log_next_execution(v8_flags.log_function_events);
+  vector->set_closure_feedback_cell_array(*closure_feedback_cell_array);
+  vector->set_parent_feedback_cell(*parent_feedback_cell);
 
   // TODO(leszeks): Initialize based on the feedback metadata.
-  MemsetTagged(ObjectSlot(vector.slots_start()), *undefined_value(), length);
+  MemsetTagged(ObjectSlot(vector->slots_start()), *undefined_value(), length);
   return handle(vector, isolate());
 }
 
 Handle<EmbedderDataArray> Factory::NewEmbedderDataArray(int length) {
   DCHECK_LE(0, length);
   int size = EmbedderDataArray::SizeFor(length);
-  EmbedderDataArray array = EmbedderDataArray::cast(AllocateRawWithImmortalMap(
-      size, AllocationType::kYoung, *embedder_data_array_map()));
+  Tagged<EmbedderDataArray> array =
+      Tagged<EmbedderDataArray>::cast(AllocateRawWithImmortalMap(
+          size, AllocationType::kYoung, *embedder_data_array_map()));
   DisallowGarbageCollection no_gc;
-  array.set_length(length);
+  array->set_length(length);
 
   if (length > 0) {
     for (int i = 0; i < length; i++) {
@@ -555,7 +541,8 @@ Handle<T> Factory::AllocateSmallOrderedHashTable(Handle<Map> map, int capacity,
   DCHECK_EQ(0, capacity % T::kLoadFactor);
 
   int size = T::SizeFor(capacity);
-  HeapObject result = AllocateRawWithImmortalMap(size, allocation, *map);
+  Tagged<HeapObject> result =
+      AllocateRawWithImmortalMap(size, allocation, *map);
   Handle<T> table(T::cast(result), isolate());
   table->Initialize(isolate(), capacity);
   return table;
@@ -594,12 +581,6 @@ Handle<OrderedHashMap> Factory::NewOrderedHashMap() {
       .ToHandleChecked();
 }
 
-Handle<OrderedNameDictionary> Factory::NewOrderedNameDictionary(int capacity) {
-  return OrderedNameDictionary::Allocate(isolate(), capacity,
-                                         AllocationType::kYoung)
-      .ToHandleChecked();
-}
-
 Handle<NameDictionary> Factory::NewNameDictionary(int at_least_space_for) {
   return NameDictionary::New(isolate(), at_least_space_for);
 }
@@ -608,11 +589,11 @@ Handle<PropertyDescriptorObject> Factory::NewPropertyDescriptorObject() {
   auto object = NewStructInternal<PropertyDescriptorObject>(
       PROPERTY_DESCRIPTOR_OBJECT_TYPE, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  object.set_flags(0);
-  Oddball the_hole = read_only_roots().the_hole_value();
-  object.set_value(the_hole, SKIP_WRITE_BARRIER);
-  object.set_get(the_hole, SKIP_WRITE_BARRIER);
-  object.set_set(the_hole, SKIP_WRITE_BARRIER);
+  object->set_flags(0);
+  Tagged<Hole> the_hole = read_only_roots().the_hole_value();
+  object->set_value(the_hole, SKIP_WRITE_BARRIER);
+  object->set_get(the_hole, SKIP_WRITE_BARRIER);
+  object->set_set(the_hole, SKIP_WRITE_BARRIER);
   return handle(object, isolate());
 }
 
@@ -628,18 +609,17 @@ Handle<SwissNameDictionary> Factory::CreateCanonicalEmptySwissNameDictionary() {
       NewByteArray(SwissNameDictionary::kMetaTableEnumerationDataStartIndex,
                    AllocationType::kReadOnly);
 
-  Map map = roots.swiss_name_dictionary_map();
+  Tagged<Map> map = roots.swiss_name_dictionary_map();
   int size = SwissNameDictionary::SizeFor(0);
-  HeapObject obj =
+  Tagged<HeapObject> obj =
       AllocateRawWithImmortalMap(size, AllocationType::kReadOnly, map);
-  SwissNameDictionary result = SwissNameDictionary::cast(obj);
-  result.Initialize(isolate(), *empty_meta_table, 0);
+  Tagged<SwissNameDictionary> result = Tagged<SwissNameDictionary>::cast(obj);
+  result->Initialize(isolate(), *empty_meta_table, 0);
   return handle(result, isolate());
 }
 
 // Internalized strings are created in the old generation (data space).
-Handle<String> Factory::InternalizeUtf8String(
-    const base::Vector<const char>& string) {
+Handle<String> Factory::InternalizeUtf8String(base::Vector<const char> string) {
   base::Vector<const uint8_t> utf8_data =
       base::Vector<const uint8_t>::cast(string);
   Utf8Decoder decoder(utf8_data);
@@ -761,8 +741,8 @@ MaybeHandle<String> NewStringFromUtf8Variant(Isolate* isolate,
 }  // namespace
 
 MaybeHandle<String> Factory::NewStringFromUtf8(
-    const base::Vector<const uint8_t>& string,
-    unibrow::Utf8Variant utf8_variant, AllocationType allocation) {
+    base::Vector<const uint8_t> string, unibrow::Utf8Variant utf8_variant,
+    AllocationType allocation) {
   if (string.size() > kMaxInt) {
     // The Utf8Decode can't handle longer inputs, and we couldn't create
     // strings from them anyway.
@@ -773,8 +753,8 @@ MaybeHandle<String> Factory::NewStringFromUtf8(
                                   allocation);
 }
 
-MaybeHandle<String> Factory::NewStringFromUtf8(
-    const base::Vector<const char>& string, AllocationType allocation) {
+MaybeHandle<String> Factory::NewStringFromUtf8(base::Vector<const char> string,
+                                               AllocationType allocation) {
   return NewStringFromUtf8(base::Vector<const uint8_t>::cast(string),
                            unibrow::Utf8Variant::kLossyUtf8, allocation);
 }
@@ -817,14 +797,14 @@ namespace {
 struct Wtf16Decoder {
   int length_;
   bool is_one_byte_;
-  explicit Wtf16Decoder(const base::Vector<const uint16_t>& data)
+  explicit Wtf16Decoder(base::Vector<const uint16_t> data)
       : length_(data.length()),
         is_one_byte_(String::IsOneByte(data.begin(), length_)) {}
   bool is_invalid() const { return false; }
   bool is_one_byte() const { return is_one_byte_; }
   int utf16_length() const { return length_; }
   template <typename Char>
-  void Decode(Char* out, const base::Vector<const uint16_t>& data) {
+  void Decode(Char* out, base::Vector<const uint16_t> data) {
     CopyChars(out, data.begin(), length_);
   }
 };
@@ -927,7 +907,7 @@ MaybeHandle<String> Factory::NewStringFromTwoByte(const base::uc16* string,
 }
 
 MaybeHandle<String> Factory::NewStringFromTwoByte(
-    const base::Vector<const base::uc16>& string, AllocationType allocation) {
+    base::Vector<const base::uc16> string, AllocationType allocation) {
   return NewStringFromTwoByte(string.begin(), string.length(), allocation);
 }
 
@@ -939,7 +919,7 @@ MaybeHandle<String> Factory::NewStringFromTwoByte(
 
 #if V8_ENABLE_WEBASSEMBLY
 MaybeHandle<String> Factory::NewStringFromTwoByteLittleEndian(
-    const base::Vector<const base::uc16>& str, AllocationType allocation) {
+    base::Vector<const base::uc16> str, AllocationType allocation) {
 #if defined(V8_TARGET_LITTLE_ENDIAN)
   return NewStringFromTwoByte(str, allocation);
 #elif defined(V8_TARGET_BIG_ENDIAN)
@@ -972,6 +952,13 @@ Handle<String> Factory::NewInternalizedStringImpl(Handle<String> string,
 
 StringTransitionStrategy Factory::ComputeInternalizationStrategyForString(
     Handle<String> string, MaybeHandle<Map>* internalized_map) {
+  // The serializer requires internalized strings to be in ReadOnlySpace s.t.
+  // other objects referencing the string can be allocated in RO space
+  // themselves.
+  if (isolate()->enable_ro_allocation_for_snapshot() &&
+      isolate()->serializer_enabled()) {
+    return StringTransitionStrategy::kCopy;
+  }
   // Do not internalize young strings in-place: This allows us to ignore both
   // string table and stub cache on scavenges.
   if (Heap::InYoungGeneration(*string)) {
@@ -979,7 +966,7 @@ StringTransitionStrategy Factory::ComputeInternalizationStrategyForString(
   }
   // If the string table is shared, we need to copy if the string is not already
   // in the shared heap.
-  if (v8_flags.shared_string_table && !string->InSharedHeap()) {
+  if (v8_flags.shared_string_table && !Object::InSharedHeap(*string)) {
     return StringTransitionStrategy::kCopy;
   }
   DCHECK_NOT_NULL(internalized_map);
@@ -987,7 +974,7 @@ StringTransitionStrategy Factory::ComputeInternalizationStrategyForString(
   // This method may be called concurrently, so snapshot the map from the input
   // string instead of the calling IsType methods on HeapObject, which would
   // reload the map each time.
-  Map map = string->map();
+  Tagged<Map> map = string->map();
   *internalized_map = GetInPlaceInternalizedStringMap(map);
   if (!internalized_map->is_null()) {
     return StringTransitionStrategy::kInPlace;
@@ -1002,14 +989,14 @@ template <class StringClass>
 Handle<StringClass> Factory::InternalizeExternalString(Handle<String> string) {
   Handle<Map> map =
       GetInPlaceInternalizedStringMap(string->map()).ToHandleChecked();
-  StringClass external_string =
-      StringClass::cast(New(map, AllocationType::kOld));
+  Tagged<StringClass> external_string =
+      Tagged<StringClass>::cast(New(map, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  external_string.InitExternalPointerFields(isolate());
-  StringClass cast_string = StringClass::cast(*string);
-  external_string.set_length(cast_string.length());
-  external_string.set_raw_hash_field(cast_string.raw_hash_field());
-  external_string.SetResource(isolate(), nullptr);
+  external_string->InitExternalPointerFields(isolate());
+  Tagged<StringClass> cast_string = Tagged<StringClass>::cast(*string);
+  external_string->set_length(cast_string->length());
+  external_string->set_raw_hash_field(cast_string->raw_hash_field());
+  external_string->SetResource(isolate(), nullptr);
   isolate()->heap()->RegisterExternalString(external_string);
   return handle(external_string, isolate());
 }
@@ -1023,32 +1010,33 @@ StringTransitionStrategy Factory::ComputeSharingStrategyForString(
     Handle<String> string, MaybeHandle<Map>* shared_map) {
   DCHECK(v8_flags.shared_string_table);
   // TODO(pthier): Avoid copying LO-space strings. Update page flags instead.
-  if (!string->InSharedHeap()) {
+  if (!Object::InSharedHeap(*string)) {
     return StringTransitionStrategy::kCopy;
   }
   DCHECK_NOT_NULL(shared_map);
   DisallowGarbageCollection no_gc;
-  InstanceType instance_type = string->map().instance_type();
+  InstanceType instance_type = string->map()->instance_type();
   if (StringShape(instance_type).IsShared()) {
     return StringTransitionStrategy::kAlreadyTransitioned;
   }
   switch (instance_type) {
-    case STRING_TYPE:
-      *shared_map = read_only_roots().shared_string_map_handle();
+    case SEQ_TWO_BYTE_STRING_TYPE:
+      *shared_map = read_only_roots().shared_seq_two_byte_string_map_handle();
       return StringTransitionStrategy::kInPlace;
-    case ONE_BYTE_STRING_TYPE:
-      *shared_map = read_only_roots().shared_one_byte_string_map_handle();
+    case SEQ_ONE_BYTE_STRING_TYPE:
+      *shared_map = read_only_roots().shared_seq_one_byte_string_map_handle();
       return StringTransitionStrategy::kInPlace;
-    case EXTERNAL_STRING_TYPE:
-      *shared_map = read_only_roots().shared_external_string_map_handle();
+    case EXTERNAL_TWO_BYTE_STRING_TYPE:
+      *shared_map =
+          read_only_roots().shared_external_two_byte_string_map_handle();
       return StringTransitionStrategy::kInPlace;
     case EXTERNAL_ONE_BYTE_STRING_TYPE:
       *shared_map =
           read_only_roots().shared_external_one_byte_string_map_handle();
       return StringTransitionStrategy::kInPlace;
-    case UNCACHED_EXTERNAL_STRING_TYPE:
-      *shared_map =
-          read_only_roots().shared_uncached_external_string_map_handle();
+    case UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE:
+      *shared_map = read_only_roots()
+                        .shared_uncached_external_two_byte_string_map_handle();
       return StringTransitionStrategy::kInPlace;
     case UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE:
       *shared_map = read_only_roots()
@@ -1074,6 +1062,35 @@ Handle<String> Factory::NewSurrogatePairString(uint16_t lead, uint16_t trail) {
   return str;
 }
 
+Handle<String> Factory::NewCopiedSubstring(Handle<String> str, int begin,
+                                           int length) {
+  DCHECK(str->IsFlat());  // Callers must flatten.
+  DCHECK_GT(length, 0);   // Callers must handle empty string.
+  bool one_byte;
+  if (str->IsOneByteRepresentation()) {
+    one_byte = true;
+  } else {
+    DisallowGarbageCollection no_gc;
+    const uint16_t* src = str->GetFlatContent(no_gc).ToUC16Vector().data();
+    one_byte = String::IsOneByte(src + begin, length);
+  }
+  if (one_byte) {
+    Handle<SeqOneByteString> result =
+        NewRawOneByteString(length).ToHandleChecked();
+    DisallowGarbageCollection no_gc;
+    uint8_t* dest = result->GetChars(no_gc);
+    String::WriteToFlat(*str, dest, begin, length);
+    return result;
+  } else {
+    Handle<SeqTwoByteString> result =
+        NewRawTwoByteString(length).ToHandleChecked();
+    DisallowGarbageCollection no_gc;
+    base::uc16* dest = result->GetChars(no_gc);
+    String::WriteToFlat(*str, dest, begin, length);
+    return result;
+  }
+}
+
 Handle<String> Factory::NewProperSubString(Handle<String> str, int begin,
                                            int end) {
 #if VERIFY_HEAP
@@ -1098,45 +1115,32 @@ Handle<String> Factory::NewProperSubString(Handle<String> str, int begin,
   }
 
   if (!v8_flags.string_slices || length < SlicedString::kMinLength) {
-    if (str->IsOneByteRepresentation()) {
-      Handle<SeqOneByteString> result =
-          NewRawOneByteString(length).ToHandleChecked();
-      DisallowGarbageCollection no_gc;
-      uint8_t* dest = result->GetChars(no_gc);
-      String::WriteToFlat(*str, dest, begin, length);
-      return result;
-    } else {
-      Handle<SeqTwoByteString> result =
-          NewRawTwoByteString(length).ToHandleChecked();
-      DisallowGarbageCollection no_gc;
-      base::uc16* dest = result->GetChars(no_gc);
-      String::WriteToFlat(*str, dest, begin, length);
-      return result;
-    }
+    return NewCopiedSubstring(str, begin, length);
   }
 
   int offset = begin;
 
-  if (str->IsSlicedString()) {
+  if (IsSlicedString(*str)) {
     Handle<SlicedString> slice = Handle<SlicedString>::cast(str);
     str = Handle<String>(slice->parent(), isolate());
     offset += slice->offset();
   }
-  if (str->IsThinString()) {
+  if (IsThinString(*str)) {
     Handle<ThinString> thin = Handle<ThinString>::cast(str);
     str = handle(thin->actual(), isolate());
   }
 
-  DCHECK(str->IsSeqString() || str->IsExternalString());
+  DCHECK(IsSeqString(*str) || IsExternalString(*str));
   Handle<Map> map = str->IsOneByteRepresentation()
                         ? sliced_one_byte_string_map()
-                        : sliced_string_map();
-  SlicedString slice = SlicedString::cast(New(map, AllocationType::kYoung));
+                        : sliced_two_byte_string_map();
+  Tagged<SlicedString> slice =
+      Tagged<SlicedString>::cast(New(map, AllocationType::kYoung));
   DisallowGarbageCollection no_gc;
-  slice.set_raw_hash_field(String::kEmptyHashField);
-  slice.set_length(length);
-  slice.set_parent(*str);
-  slice.set_offset(offset);
+  slice->set_raw_hash_field(String::kEmptyHashField);
+  slice->set_length(length);
+  slice->set_parent(*str);
+  slice->set_offset(offset);
   return handle(slice, isolate());
 }
 
@@ -1151,13 +1155,13 @@ MaybeHandle<String> Factory::NewExternalStringFromOneByte(
   Handle<Map> map = resource->IsCacheable()
                         ? external_one_byte_string_map()
                         : uncached_external_one_byte_string_map();
-  ExternalOneByteString external_string =
-      ExternalOneByteString::cast(New(map, AllocationType::kOld));
+  Tagged<ExternalOneByteString> external_string =
+      Tagged<ExternalOneByteString>::cast(New(map, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  external_string.InitExternalPointerFields(isolate());
-  external_string.set_length(static_cast<int>(length));
-  external_string.set_raw_hash_field(String::kEmptyHashField);
-  external_string.SetResource(isolate(), resource);
+  external_string->InitExternalPointerFields(isolate());
+  external_string->set_length(static_cast<int>(length));
+  external_string->set_raw_hash_field(String::kEmptyHashField);
+  external_string->SetResource(isolate(), resource);
 
   isolate()->heap()->RegisterExternalString(external_string);
 
@@ -1172,15 +1176,16 @@ MaybeHandle<String> Factory::NewExternalStringFromTwoByte(
   }
   if (length == 0) return empty_string();
 
-  Handle<Map> map = resource->IsCacheable() ? external_string_map()
-                                            : uncached_external_string_map();
-  ExternalTwoByteString string =
-      ExternalTwoByteString::cast(New(map, AllocationType::kOld));
+  Handle<Map> map = resource->IsCacheable()
+                        ? external_two_byte_string_map()
+                        : uncached_external_two_byte_string_map();
+  Tagged<ExternalTwoByteString> string =
+      Tagged<ExternalTwoByteString>::cast(New(map, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  string.InitExternalPointerFields(isolate());
-  string.set_length(static_cast<int>(length));
-  string.set_raw_hash_field(String::kEmptyHashField);
-  string.SetResource(isolate(), resource);
+  string->InitExternalPointerFields(isolate());
+  string->set_length(static_cast<int>(length));
+  string->set_raw_hash_field(String::kEmptyHashField);
+  string->SetResource(isolate(), resource);
 
   isolate()->heap()->RegisterExternalString(string);
 
@@ -1195,35 +1200,35 @@ Handle<JSStringIterator> Factory::NewJSStringIterator(Handle<String> string) {
       Handle<JSStringIterator>::cast(NewJSObjectFromMap(map));
 
   DisallowGarbageCollection no_gc;
-  JSStringIterator raw = *iterator;
-  raw.set_string(*flat_string);
-  raw.set_index(0);
+  Tagged<JSStringIterator> raw = *iterator;
+  raw->set_string(*flat_string);
+  raw->set_index(0);
   return iterator;
 }
 
-Symbol Factory::NewSymbolInternal(AllocationType allocation) {
+Tagged<Symbol> Factory::NewSymbolInternal(AllocationType allocation) {
   DCHECK(allocation != AllocationType::kYoung);
   // Statically ensure that it is safe to allocate symbols in paged spaces.
   static_assert(Symbol::kSize <= kMaxRegularHeapObjectSize);
 
-  Symbol symbol = Symbol::cast(AllocateRawWithImmortalMap(
+  Tagged<Symbol> symbol = Tagged<Symbol>::cast(AllocateRawWithImmortalMap(
       Symbol::kSize, allocation, read_only_roots().symbol_map()));
   DisallowGarbageCollection no_gc;
   // Generate a random hash value.
   int hash = isolate()->GenerateIdentityHash(Name::HashBits::kMax);
-  symbol.set_raw_hash_field(
+  symbol->set_raw_hash_field(
       Name::CreateHashFieldValue(hash, Name::HashFieldType::kHash));
   if (isolate()->read_only_heap()->roots_init_complete()) {
-    symbol.set_description(read_only_roots().undefined_value(),
-                           SKIP_WRITE_BARRIER);
+    symbol->set_description(read_only_roots().undefined_value(),
+                            SKIP_WRITE_BARRIER);
   } else {
     // Can't use setter during bootstrapping as its typecheck tries to access
     // the roots table before it is initialized.
     TaggedField<Object>::store(symbol, Symbol::kDescriptionOffset,
                                read_only_roots().undefined_value());
   }
-  symbol.set_flags(0);
-  DCHECK(!symbol.is_private());
+  symbol->set_flags(0);
+  DCHECK(!symbol->is_private());
   return symbol;
 }
 
@@ -1233,38 +1238,39 @@ Handle<Symbol> Factory::NewSymbol(AllocationType allocation) {
 
 Handle<Symbol> Factory::NewPrivateSymbol(AllocationType allocation) {
   DCHECK(allocation != AllocationType::kYoung);
-  Symbol symbol = NewSymbolInternal(allocation);
+  Tagged<Symbol> symbol = NewSymbolInternal(allocation);
   DisallowGarbageCollection no_gc;
-  symbol.set_is_private(true);
+  symbol->set_is_private(true);
   return handle(symbol, isolate());
 }
 
 Handle<Symbol> Factory::NewPrivateNameSymbol(Handle<String> name) {
-  Symbol symbol = NewSymbolInternal();
+  Tagged<Symbol> symbol = NewSymbolInternal();
   DisallowGarbageCollection no_gc;
-  symbol.set_is_private_name();
-  symbol.set_description(*name);
+  symbol->set_is_private_name();
+  symbol->set_description(*name);
   return handle(symbol, isolate());
 }
 
-Context Factory::NewContextInternal(Handle<Map> map, int size,
-                                    int variadic_part_length,
-                                    AllocationType allocation) {
+Tagged<Context> Factory::NewContextInternal(Handle<Map> map, int size,
+                                            int variadic_part_length,
+                                            AllocationType allocation) {
   DCHECK_LE(Context::kTodoHeaderSize, size);
   DCHECK(IsAligned(size, kTaggedSize));
   DCHECK_LE(Context::MIN_CONTEXT_SLOTS, variadic_part_length);
   DCHECK_LE(Context::SizeFor(variadic_part_length), size);
 
-  HeapObject result = allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
-      size, allocation);
-  result.set_map_after_allocation(*map);
+  Tagged<HeapObject> result =
+      allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(size,
+                                                                allocation);
+  result->set_map_after_allocation(*map);
   DisallowGarbageCollection no_gc;
-  Context context = Context::cast(result);
-  context.set_length(variadic_part_length);
-  DCHECK_EQ(context.SizeFromMap(*map), size);
+  Tagged<Context> context = Tagged<Context>::cast(result);
+  context->set_length(variadic_part_length);
+  DCHECK_EQ(context->SizeFromMap(*map), size);
   if (size > Context::kTodoHeaderSize) {
-    ObjectSlot start = context.RawField(Context::kTodoHeaderSize);
-    ObjectSlot end = context.RawField(size);
+    ObjectSlot start = context->RawField(Context::kTodoHeaderSize);
+    ObjectSlot end = context->RawField(size);
     size_t slot_count = end - start;
     MemsetTagged(start, *undefined_value(), slot_count);
   }
@@ -1273,21 +1279,22 @@ Context Factory::NewContextInternal(Handle<Map> map, int size,
 
 Handle<NativeContext> Factory::NewNativeContext() {
   Handle<Map> map = NewMap(NATIVE_CONTEXT_TYPE, kVariableSizeSentinel);
-  NativeContext context = NativeContext::cast(NewContextInternal(
-      map, NativeContext::kSize, NativeContext::NATIVE_CONTEXT_SLOTS,
-      AllocationType::kOld));
+  Tagged<NativeContext> context =
+      Tagged<NativeContext>::cast(NewContextInternal(
+          map, NativeContext::kSize, NativeContext::NATIVE_CONTEXT_SLOTS,
+          AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  context.set_native_context_map(*map);
+  context->set_native_context_map(*map);
   map->set_native_context(context);
   // The ExternalPointerTable is a C++ object.
-  context.set_scope_info(*native_scope_info());
-  context.set_previous(Context());
-  context.set_extension(*undefined_value());
-  context.set_errors_thrown(Smi::zero());
-  context.set_math_random_index(Smi::zero());
-  context.set_serialized_objects(*empty_fixed_array());
-  context.init_microtask_queue(isolate(), nullptr);
-  context.set_retained_maps(*empty_weak_array_list());
+  context->set_scope_info(*native_scope_info());
+  context->set_previous(Context());
+  context->set_extension(*undefined_value());
+  context->set_errors_thrown(Smi::zero());
+  context->set_math_random_index(Smi::zero());
+  context->set_serialized_objects(*empty_fixed_array());
+  context->init_microtask_queue(isolate(), nullptr);
+  context->set_retained_maps(*empty_weak_array_list());
   return handle(context, isolate());
 }
 
@@ -1295,14 +1302,14 @@ Handle<Context> Factory::NewScriptContext(Handle<NativeContext> outer,
                                           Handle<ScopeInfo> scope_info) {
   DCHECK_EQ(scope_info->scope_type(), SCRIPT_SCOPE);
   int variadic_part_length = scope_info->ContextLength();
-  Context context =
+  Tagged<Context> context =
       NewContextInternal(handle(outer->script_context_map(), isolate()),
                          Context::SizeFor(variadic_part_length),
                          variadic_part_length, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  context.set_scope_info(*scope_info);
-  context.set_previous(*outer);
-  DCHECK(context.IsScriptContext());
+  context->set_scope_info(*scope_info);
+  context->set_previous(*outer);
+  DCHECK(context->IsScriptContext());
   return handle(context, isolate());
 }
 
@@ -1321,14 +1328,14 @@ Handle<Context> Factory::NewModuleContext(Handle<SourceTextModule> module,
                                           Handle<ScopeInfo> scope_info) {
   DCHECK_EQ(scope_info->scope_type(), MODULE_SCOPE);
   int variadic_part_length = scope_info->ContextLength();
-  Context context = NewContextInternal(
+  Tagged<Context> context = NewContextInternal(
       isolate()->module_context_map(), Context::SizeFor(variadic_part_length),
       variadic_part_length, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  context.set_scope_info(*scope_info);
-  context.set_previous(*outer);
-  context.set_extension(*module);
-  DCHECK(context.IsModuleContext());
+  context->set_scope_info(*scope_info);
+  context->set_previous(*outer);
+  context->set_extension(*module);
+  DCHECK(context->IsModuleContext());
   return handle(context, isolate());
 }
 
@@ -1346,12 +1353,12 @@ Handle<Context> Factory::NewFunctionContext(Handle<Context> outer,
       UNREACHABLE();
   }
   int variadic_part_length = scope_info->ContextLength();
-  Context context =
+  Tagged<Context> context =
       NewContextInternal(map, Context::SizeFor(variadic_part_length),
                          variadic_part_length, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  context.set_scope_info(*scope_info);
-  context.set_previous(*outer);
+  context->set_scope_info(*scope_info);
+  context->set_previous(*outer);
   return handle(context, isolate());
 }
 
@@ -1362,14 +1369,15 @@ Handle<Context> Factory::NewCatchContext(Handle<Context> previous,
   static_assert(Context::MIN_CONTEXT_SLOTS == Context::THROWN_OBJECT_INDEX);
   // TODO(ishell): Take the details from CatchContext class.
   int variadic_part_length = Context::MIN_CONTEXT_SLOTS + 1;
-  Context context = NewContextInternal(
+  Tagged<Context> context = NewContextInternal(
       isolate()->catch_context_map(), Context::SizeFor(variadic_part_length),
       variadic_part_length, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
   DCHECK_IMPLIES(!v8_flags.single_generation, Heap::InYoungGeneration(context));
-  context.set_scope_info(*scope_info, SKIP_WRITE_BARRIER);
-  context.set_previous(*previous, SKIP_WRITE_BARRIER);
-  context.set(Context::THROWN_OBJECT_INDEX, *thrown_object, SKIP_WRITE_BARRIER);
+  context->set_scope_info(*scope_info, SKIP_WRITE_BARRIER);
+  context->set_previous(*previous, SKIP_WRITE_BARRIER);
+  context->set(Context::THROWN_OBJECT_INDEX, *thrown_object,
+               SKIP_WRITE_BARRIER);
   return handle(context, isolate());
 }
 
@@ -1383,17 +1391,17 @@ Handle<Context> Factory::NewDebugEvaluateContext(Handle<Context> previous,
                                : Handle<HeapObject>::cast(extension);
   // TODO(ishell): Take the details from DebugEvaluateContextContext class.
   int variadic_part_length = Context::MIN_CONTEXT_EXTENDED_SLOTS + 1;
-  Context context =
+  Tagged<Context> context =
       NewContextInternal(isolate()->debug_evaluate_context_map(),
                          Context::SizeFor(variadic_part_length),
                          variadic_part_length, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
   DCHECK_IMPLIES(!v8_flags.single_generation, Heap::InYoungGeneration(context));
-  context.set_scope_info(*scope_info, SKIP_WRITE_BARRIER);
-  context.set_previous(*previous, SKIP_WRITE_BARRIER);
-  context.set_extension(*ext, SKIP_WRITE_BARRIER);
+  context->set_scope_info(*scope_info, SKIP_WRITE_BARRIER);
+  context->set_previous(*previous, SKIP_WRITE_BARRIER);
+  context->set_extension(*ext, SKIP_WRITE_BARRIER);
   if (!wrapped.is_null()) {
-    context.set(Context::WRAPPED_CONTEXT_INDEX, *wrapped, SKIP_WRITE_BARRIER);
+    context->set(Context::WRAPPED_CONTEXT_INDEX, *wrapped, SKIP_WRITE_BARRIER);
   }
   return handle(context, isolate());
 }
@@ -1404,14 +1412,14 @@ Handle<Context> Factory::NewWithContext(Handle<Context> previous,
   DCHECK_EQ(scope_info->scope_type(), WITH_SCOPE);
   // TODO(ishell): Take the details from WithContext class.
   int variadic_part_length = Context::MIN_CONTEXT_EXTENDED_SLOTS;
-  Context context = NewContextInternal(
+  Tagged<Context> context = NewContextInternal(
       isolate()->with_context_map(), Context::SizeFor(variadic_part_length),
       variadic_part_length, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
   DCHECK_IMPLIES(!v8_flags.single_generation, Heap::InYoungGeneration(context));
-  context.set_scope_info(*scope_info, SKIP_WRITE_BARRIER);
-  context.set_previous(*previous, SKIP_WRITE_BARRIER);
-  context.set_extension(*extension, SKIP_WRITE_BARRIER);
+  context->set_scope_info(*scope_info, SKIP_WRITE_BARRIER);
+  context->set_previous(*previous, SKIP_WRITE_BARRIER);
+  context->set_extension(*extension, SKIP_WRITE_BARRIER);
   return handle(context, isolate());
 }
 
@@ -1420,27 +1428,27 @@ Handle<Context> Factory::NewBlockContext(Handle<Context> previous,
   DCHECK_IMPLIES(scope_info->scope_type() != BLOCK_SCOPE,
                  scope_info->scope_type() == CLASS_SCOPE);
   int variadic_part_length = scope_info->ContextLength();
-  Context context = NewContextInternal(
+  Tagged<Context> context = NewContextInternal(
       isolate()->block_context_map(), Context::SizeFor(variadic_part_length),
       variadic_part_length, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
   DCHECK_IMPLIES(!v8_flags.single_generation, Heap::InYoungGeneration(context));
-  context.set_scope_info(*scope_info, SKIP_WRITE_BARRIER);
-  context.set_previous(*previous, SKIP_WRITE_BARRIER);
+  context->set_scope_info(*scope_info, SKIP_WRITE_BARRIER);
+  context->set_previous(*previous, SKIP_WRITE_BARRIER);
   return handle(context, isolate());
 }
 
 Handle<Context> Factory::NewBuiltinContext(Handle<NativeContext> native_context,
                                            int variadic_part_length) {
   DCHECK_LE(Context::MIN_CONTEXT_SLOTS, variadic_part_length);
-  Context context = NewContextInternal(
+  Tagged<Context> context = NewContextInternal(
       isolate()->function_context_map(), Context::SizeFor(variadic_part_length),
       variadic_part_length, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
   DCHECK_IMPLIES(!v8_flags.single_generation, Heap::InYoungGeneration(context));
-  context.set_scope_info(read_only_roots().empty_scope_info(),
-                         SKIP_WRITE_BARRIER);
-  context.set_previous(*native_context, SKIP_WRITE_BARRIER);
+  context->set_scope_info(read_only_roots().empty_scope_info(),
+                          SKIP_WRITE_BARRIER);
+  context->set_previous(*native_context, SKIP_WRITE_BARRIER);
   return handle(context, isolate());
 }
 
@@ -1448,24 +1456,24 @@ Handle<AliasedArgumentsEntry> Factory::NewAliasedArgumentsEntry(
     int aliased_context_slot) {
   auto entry = NewStructInternal<AliasedArgumentsEntry>(
       ALIASED_ARGUMENTS_ENTRY_TYPE, AllocationType::kYoung);
-  entry.set_aliased_context_slot(aliased_context_slot);
+  entry->set_aliased_context_slot(aliased_context_slot);
   return handle(entry, isolate());
 }
 
 Handle<AccessorInfo> Factory::NewAccessorInfo() {
-  AccessorInfo info =
-      AccessorInfo::cast(New(accessor_info_map(), AllocationType::kOld));
+  Tagged<AccessorInfo> info = Tagged<AccessorInfo>::cast(
+      New(accessor_info_map(), AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  info.set_name(*empty_string(), SKIP_WRITE_BARRIER);
-  info.set_data(*undefined_value(), SKIP_WRITE_BARRIER);
-  info.set_flags(0);  // Must clear the flags, it was initialized as undefined.
-  info.set_is_sloppy(true);
-  info.set_initial_property_attributes(NONE);
+  info->set_name(*empty_string(), SKIP_WRITE_BARRIER);
+  info->set_data(*undefined_value(), SKIP_WRITE_BARRIER);
+  info->set_flags(0);  // Must clear the flags, it was initialized as undefined.
+  info->set_is_sloppy(true);
+  info->set_initial_property_attributes(NONE);
 
-  info.init_getter(isolate(), kNullAddress);
-  info.init_setter(isolate(), kNullAddress);
+  info->init_getter(isolate(), kNullAddress);
+  info->init_setter(isolate(), kNullAddress);
 
-  info.clear_padding();
+  info->clear_padding();
 
   return handle(info, isolate());
 }
@@ -1473,26 +1481,34 @@ Handle<AccessorInfo> Factory::NewAccessorInfo() {
 Handle<ErrorStackData> Factory::NewErrorStackData(
     Handle<Object> call_site_infos_or_formatted_stack,
     Handle<Object> limit_or_stack_frame_infos) {
-  ErrorStackData error_stack_data = NewStructInternal<ErrorStackData>(
+  Tagged<ErrorStackData> error_stack_data = NewStructInternal<ErrorStackData>(
       ERROR_STACK_DATA_TYPE, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  error_stack_data.set_call_site_infos_or_formatted_stack(
+  error_stack_data->set_call_site_infos_or_formatted_stack(
       *call_site_infos_or_formatted_stack, SKIP_WRITE_BARRIER);
-  error_stack_data.set_limit_or_stack_frame_infos(*limit_or_stack_frame_infos,
-                                                  SKIP_WRITE_BARRIER);
+  error_stack_data->set_limit_or_stack_frame_infos(*limit_or_stack_frame_infos,
+                                                   SKIP_WRITE_BARRIER);
   return handle(error_stack_data, isolate());
 }
 
-void Factory::AddToScriptList(Handle<Script> script) {
-  Handle<WeakArrayList> scripts = script_list();
-  scripts =
-      WeakArrayList::Append(isolate(), scripts, MaybeObjectHandle::Weak(script),
-                            AllocationType::kOld);
-  isolate()->heap()->set_script_list(*scripts);
+void Factory::ProcessNewScript(Handle<Script> script,
+                               ScriptEventType script_event_type) {
+  int script_id = script->id();
+  if (script_id != Script::kTemporaryScriptId) {
+    Handle<WeakArrayList> scripts = script_list();
+    scripts = WeakArrayList::Append(isolate(), scripts,
+                                    MaybeObjectHandle::Weak(script),
+                                    AllocationType::kOld);
+    isolate()->heap()->set_script_list(*scripts);
+  }
+  if (IsString(script->source()) && isolate()->NeedsSourcePositions()) {
+    Script::InitLineEnds(isolate(), script);
+  }
+  LOG(isolate(), ScriptEvent(script_event_type, script_id));
 }
 
-Handle<Script> Factory::CloneScript(Handle<Script> script) {
-  Heap* heap = isolate()->heap();
+Handle<Script> Factory::CloneScript(Handle<Script> script,
+                                    Handle<String> source) {
   int script_id = isolate()->GetNextScriptId();
 #ifdef V8_SCRIPTORMODULE_LEGACY_LIFETIME
   Handle<ArrayList> list = ArrayList::New(isolate(), 0);
@@ -1501,47 +1517,42 @@ Handle<Script> Factory::CloneScript(Handle<Script> script) {
       Handle<Script>::cast(NewStruct(SCRIPT_TYPE, AllocationType::kOld));
   {
     DisallowGarbageCollection no_gc;
-    Script new_script = *new_script_handle;
-    const Script old_script = *script;
-    new_script.set_source(old_script.source());
-    new_script.set_name(old_script.name());
-    new_script.set_id(script_id);
-    new_script.set_line_offset(old_script.line_offset());
-    new_script.set_column_offset(old_script.column_offset());
-    new_script.set_context_data(old_script.context_data());
-    new_script.set_type(old_script.type());
-    new_script.set_line_ends(*undefined_value(), SKIP_WRITE_BARRIER);
-    new_script.set_eval_from_shared_or_wrapped_arguments(
+    Tagged<Script> new_script = *new_script_handle;
+    const Tagged<Script> old_script = *script;
+    new_script->set_source(*source);
+    new_script->set_name(old_script->name());
+    new_script->set_id(script_id);
+    new_script->set_line_offset(old_script->line_offset());
+    new_script->set_column_offset(old_script->column_offset());
+    new_script->set_context_data(old_script->context_data());
+    new_script->set_type(old_script->type());
+    new_script->set_line_ends(Smi::zero());
+    new_script->set_eval_from_shared_or_wrapped_arguments(
         script->eval_from_shared_or_wrapped_arguments());
-    new_script.set_shared_function_infos(*empty_weak_fixed_array(),
-                                         SKIP_WRITE_BARRIER);
-    new_script.set_eval_from_position(old_script.eval_from_position());
-    new_script.set_flags(old_script.flags());
-    new_script.set_host_defined_options(old_script.host_defined_options());
-    new_script.set_source_hash(*undefined_value(), SKIP_WRITE_BARRIER);
-    new_script.set_compiled_lazy_function_positions(*undefined_value(),
-                                                    SKIP_WRITE_BARRIER);
+    new_script->set_shared_function_infos(*empty_weak_fixed_array(),
+                                          SKIP_WRITE_BARRIER);
+    new_script->set_eval_from_position(old_script->eval_from_position());
+    new_script->set_flags(old_script->flags());
+    new_script->set_host_defined_options(old_script->host_defined_options());
+    new_script->set_source_hash(*undefined_value(), SKIP_WRITE_BARRIER);
+    new_script->set_compiled_lazy_function_positions(*undefined_value(),
+                                                     SKIP_WRITE_BARRIER);
 #ifdef V8_SCRIPTORMODULE_LEGACY_LIFETIME
-    new_script.set_script_or_modules(*list);
+    new_script->set_script_or_modules(*list);
 #endif
   }
-
-  Handle<WeakArrayList> scripts = script_list();
-  scripts = WeakArrayList::AddToEnd(isolate(), scripts,
-                                    MaybeObjectHandle::Weak(new_script_handle));
-  heap->set_script_list(*scripts);
-  LOG(isolate(), ScriptEvent(ScriptEventType::kCreate, script_id));
+  ProcessNewScript(new_script_handle, ScriptEventType::kCreate);
   return new_script_handle;
 }
 
 Handle<CallableTask> Factory::NewCallableTask(Handle<JSReceiver> callable,
                                               Handle<Context> context) {
-  DCHECK(callable->IsCallable());
+  DCHECK(IsCallable(*callable));
   auto microtask = NewStructInternal<CallableTask>(CALLABLE_TASK_TYPE,
                                                    AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  microtask.set_callable(*callable, SKIP_WRITE_BARRIER);
-  microtask.set_context(*context, SKIP_WRITE_BARRIER);
+  microtask->set_callable(*callable, SKIP_WRITE_BARRIER);
+  microtask->set_context(*context, SKIP_WRITE_BARRIER);
   return handle(microtask, isolate());
 }
 
@@ -1550,22 +1561,22 @@ Handle<CallbackTask> Factory::NewCallbackTask(Handle<Foreign> callback,
   auto microtask = NewStructInternal<CallbackTask>(CALLBACK_TASK_TYPE,
                                                    AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  microtask.set_callback(*callback, SKIP_WRITE_BARRIER);
-  microtask.set_data(*data, SKIP_WRITE_BARRIER);
+  microtask->set_callback(*callback, SKIP_WRITE_BARRIER);
+  microtask->set_data(*data, SKIP_WRITE_BARRIER);
   return handle(microtask, isolate());
 }
 
 Handle<PromiseResolveThenableJobTask> Factory::NewPromiseResolveThenableJobTask(
     Handle<JSPromise> promise_to_resolve, Handle<JSReceiver> thenable,
     Handle<JSReceiver> then, Handle<Context> context) {
-  DCHECK(then->IsCallable());
+  DCHECK(IsCallable(*then));
   auto microtask = NewStructInternal<PromiseResolveThenableJobTask>(
       PROMISE_RESOLVE_THENABLE_JOB_TASK_TYPE, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  microtask.set_promise_to_resolve(*promise_to_resolve, SKIP_WRITE_BARRIER);
-  microtask.set_thenable(*thenable, SKIP_WRITE_BARRIER);
-  microtask.set_then(*then, SKIP_WRITE_BARRIER);
-  microtask.set_context(*context, SKIP_WRITE_BARRIER);
+  microtask->set_promise_to_resolve(*promise_to_resolve, SKIP_WRITE_BARRIER);
+  microtask->set_thenable(*thenable, SKIP_WRITE_BARRIER);
+  microtask->set_then(*then, SKIP_WRITE_BARRIER);
+  microtask->set_context(*context, SKIP_WRITE_BARRIER);
   return handle(microtask, isolate());
 }
 
@@ -1573,18 +1584,18 @@ Handle<Foreign> Factory::NewForeign(Address addr,
                                     AllocationType allocation_type) {
   // Statically ensure that it is safe to allocate foreigns in paged spaces.
   static_assert(Foreign::kSize <= kMaxRegularHeapObjectSize);
-  Map map = *foreign_map();
-  Foreign foreign = Foreign::cast(
-      AllocateRawWithImmortalMap(map.instance_size(), allocation_type, map));
+  Tagged<Map> map = *foreign_map();
+  Tagged<Foreign> foreign = Tagged<Foreign>::cast(
+      AllocateRawWithImmortalMap(map->instance_size(), allocation_type, map));
   DisallowGarbageCollection no_gc;
-  foreign.init_foreign_address(isolate(), addr);
+  foreign->init_foreign_address(isolate(), addr);
   return handle(foreign, isolate());
 }
 
 #if V8_ENABLE_WEBASSEMBLY
 Handle<WasmTypeInfo> Factory::NewWasmTypeInfo(
     Address type_address, Handle<Map> opt_parent, int instance_size_bytes,
-    Handle<WasmInstanceObject> instance, uint32_t type_index) {
+    Handle<WasmInstanceObject> opt_instance, uint32_t type_index) {
   // We pretenure WasmTypeInfo objects for two reasons:
   // (1) They are referenced by Maps, which are assumed to be long-lived,
   //     so pretenuring the WTI is a bit more efficient.
@@ -1601,7 +1612,7 @@ Handle<WasmTypeInfo> Factory::NewWasmTypeInfo(
     for (int i = 0; i < parent_type_info->supertypes_length(); i++) {
       Handle<Object> supertype =
           handle(parent_type_info->supertypes(i), isolate());
-      if (supertype->IsUndefined() && first_undefined_index == -1) {
+      if (IsUndefined(*supertype) && first_undefined_index == -1) {
         first_undefined_index = i;
       }
       supertypes.emplace_back(supertype);
@@ -1612,117 +1623,133 @@ Handle<WasmTypeInfo> Factory::NewWasmTypeInfo(
       supertypes.emplace_back(opt_parent);
     }
   }
-  Map map = *wasm_type_info_map();
-  WasmTypeInfo result = WasmTypeInfo::cast(AllocateRawWithImmortalMap(
-      WasmTypeInfo::SizeFor(static_cast<int>(supertypes.size())),
-      AllocationType::kOld, map));
+  Tagged<Map> map = *wasm_type_info_map();
+  Tagged<WasmTypeInfo> result =
+      Tagged<WasmTypeInfo>::cast(AllocateRawWithImmortalMap(
+          WasmTypeInfo::SizeFor(static_cast<int>(supertypes.size())),
+          AllocationType::kOld, map));
   DisallowGarbageCollection no_gc;
-  result.set_supertypes_length(static_cast<int>(supertypes.size()));
+  result->set_supertypes_length(static_cast<int>(supertypes.size()));
   for (size_t i = 0; i < supertypes.size(); i++) {
-    result.set_supertypes(static_cast<int>(i), *supertypes[i]);
+    result->set_supertypes(static_cast<int>(i), *supertypes[i]);
   }
-  result.init_native_type(isolate(), type_address);
-  result.set_instance(*instance);
-  result.set_type_index(type_index);
+  result->init_native_type(isolate(), type_address);
+  result->set_instance(opt_instance.is_null()
+                           ? HeapObject::cast(*undefined_value())
+                           : HeapObject::cast(*opt_instance));
+  result->set_type_index(type_index);
   return handle(result, isolate());
 }
 
 Handle<WasmApiFunctionRef> Factory::NewWasmApiFunctionRef(
-    Handle<JSReceiver> callable, wasm::Suspend suspend,
-    Handle<WasmInstanceObject> instance) {
-  Map map = *wasm_api_function_ref_map();
-  auto result = WasmApiFunctionRef::cast(AllocateRawWithImmortalMap(
-      map.instance_size(), AllocationType::kOld, map));
+    Handle<HeapObject> callable, wasm::Suspend suspend,
+    Handle<HeapObject> instance,
+    Handle<PodArray<wasm::ValueType>> serialized_sig) {
+  Tagged<Map> map = *wasm_api_function_ref_map();
+  auto result = Tagged<WasmApiFunctionRef>::cast(AllocateRawWithImmortalMap(
+      map->instance_size(), AllocationType::kOld, map));
   DisallowGarbageCollection no_gc;
-  result.set_native_context(*isolate()->native_context());
-  if (!callable.is_null()) {
-    result.set_callable(*callable);
+  result->set_native_context(*isolate()->native_context());
+  if (!callable.is_null() && *callable != *undefined_value()) {
+    result->set_callable(*callable);
   } else {
-    result.set_callable(*undefined_value());
+    result->set_callable(*undefined_value());
   }
-  result.set_suspend(suspend);
-  if (!instance.is_null()) {
-    result.set_instance(*instance);
+  result->set_suspend(suspend);
+  if (!instance.is_null() && *instance != *undefined_value()) {
+    result->set_instance(*instance);
   } else {
-    result.set_instance(*undefined_value());
+    result->set_instance(*undefined_value());
   }
+  result->set_wrapper_budget(v8_flags.wasm_wrapper_tiering_budget);
+  result->set_call_origin(Smi::FromInt(WasmApiFunctionRef::kInvalidCallOrigin));
+  result->set_sig(*serialized_sig);
   return handle(result, isolate());
 }
 
+Handle<WasmApiFunctionRef> Factory::NewWasmApiFunctionRef(
+    Handle<WasmApiFunctionRef> ref) {
+  return NewWasmApiFunctionRef(handle(ref->callable(), isolate()),
+                               static_cast<wasm::Suspend>(ref->suspend()),
+                               handle(ref->instance(), isolate()),
+                               handle(ref->sig(), isolate()));
+}
+
 Handle<WasmInternalFunction> Factory::NewWasmInternalFunction(
-    Address opt_call_target, Handle<HeapObject> ref, Handle<Map> rtt) {
-  HeapObject raw = AllocateRaw(rtt->instance_size(), AllocationType::kOld);
-  raw.set_map_after_allocation(*rtt);
-  WasmInternalFunction result = WasmInternalFunction::cast(raw);
+    Address opt_call_target, Handle<HeapObject> ref, Handle<Map> rtt,
+    int function_index) {
+  Tagged<HeapObject> raw =
+      AllocateRaw(rtt->instance_size(), AllocationType::kOld);
+  raw->set_map_after_allocation(*rtt);
+  Tagged<WasmInternalFunction> result = Tagged<WasmInternalFunction>::cast(raw);
   DisallowGarbageCollection no_gc;
-  result.init_call_target(isolate(), opt_call_target);
-  result.set_ref(*ref);
+  result->init_call_target(isolate(), opt_call_target);
+  DCHECK(IsWasmInstanceObject(*ref) || IsWasmApiFunctionRef(*ref));
+  result->set_ref(*ref);
   // Default values, will be overwritten by the caller.
-  result.set_code(*BUILTIN_CODE(isolate(), Abort));
-  result.set_external(*undefined_value());
+  result->set_code(*BUILTIN_CODE(isolate(), Abort));
+  result->set_function_index(function_index);
+  result->set_external(*undefined_value());
   return handle(result, isolate());
 }
 
 Handle<WasmJSFunctionData> Factory::NewWasmJSFunctionData(
-    Address opt_call_target, Handle<JSReceiver> callable, int return_count,
-    int parameter_count, Handle<PodArray<wasm::ValueType>> serialized_sig,
-    Handle<Code> wrapper_code, Handle<Map> rtt, wasm::Suspend suspend,
-    wasm::Promise promise) {
-  Handle<WasmApiFunctionRef> ref =
-      NewWasmApiFunctionRef(callable, suspend, Handle<WasmInstanceObject>());
+    Address opt_call_target, Handle<JSReceiver> callable,
+    Handle<PodArray<wasm::ValueType>> serialized_sig, Handle<Code> wrapper_code,
+    Handle<Map> rtt, wasm::Suspend suspend, wasm::Promise promise) {
+  Handle<WasmApiFunctionRef> ref = NewWasmApiFunctionRef(
+      callable, suspend, Handle<WasmInstanceObject>(), serialized_sig);
+
   Handle<WasmInternalFunction> internal =
-      NewWasmInternalFunction(opt_call_target, ref, rtt);
-  Map map = *wasm_js_function_data_map();
-  WasmJSFunctionData result =
-      WasmJSFunctionData::cast(AllocateRawWithImmortalMap(
-          map.instance_size(), AllocationType::kOld, map));
+      NewWasmInternalFunction(opt_call_target, ref, rtt, -1);
+  WasmApiFunctionRef::SetInternalFunctionAsCallOrigin(ref, internal);
+  Tagged<Map> map = *wasm_js_function_data_map();
+  Tagged<WasmJSFunctionData> result =
+      Tagged<WasmJSFunctionData>::cast(AllocateRawWithImmortalMap(
+          map->instance_size(), AllocationType::kOld, map));
   DisallowGarbageCollection no_gc;
-  result.set_internal(*internal);
-  result.set_wrapper_code(*wrapper_code);
-  result.set_serialized_return_count(return_count);
-  result.set_serialized_parameter_count(parameter_count);
-  result.set_serialized_signature(*serialized_sig);
-  result.set_js_promise_flags(WasmFunctionData::SuspendField::encode(suspend) |
-                              WasmFunctionData::PromiseField::encode(promise));
+  result->set_internal(*internal);
+  result->set_wrapper_code(*wrapper_code);
+  result->set_serialized_signature(*serialized_sig);
+  result->set_js_promise_flags(WasmFunctionData::SuspendField::encode(suspend) |
+                               WasmFunctionData::PromiseField::encode(promise));
   return handle(result, isolate());
 }
 
 Handle<WasmResumeData> Factory::NewWasmResumeData(
     Handle<WasmSuspenderObject> suspender, wasm::OnResume on_resume) {
-  Map map = *wasm_resume_data_map();
-  WasmResumeData result = WasmResumeData::cast(AllocateRawWithImmortalMap(
-      map.instance_size(), AllocationType::kOld, map));
+  Tagged<Map> map = *wasm_resume_data_map();
+  Tagged<WasmResumeData> result =
+      Tagged<WasmResumeData>::cast(AllocateRawWithImmortalMap(
+          map->instance_size(), AllocationType::kOld, map));
   DisallowGarbageCollection no_gc;
-  result.set_suspender(*suspender);
-  result.set_on_resume(static_cast<int>(on_resume));
+  result->set_suspender(*suspender);
+  result->set_on_resume(static_cast<int>(on_resume));
   return handle(result, isolate());
 }
 
 Handle<WasmExportedFunctionData> Factory::NewWasmExportedFunctionData(
     Handle<Code> export_wrapper, Handle<WasmInstanceObject> instance,
-    Address call_target, Handle<Object> ref, int func_index,
+    Handle<WasmInternalFunction> internal, int func_index,
     const wasm::FunctionSig* sig, uint32_t canonical_type_index,
-    int wrapper_budget, Handle<Map> rtt, wasm::Promise promise) {
-  Handle<WasmInternalFunction> internal =
-      NewWasmInternalFunction(call_target, Handle<HeapObject>::cast(ref), rtt);
-  Map map = *wasm_exported_function_data_map();
-  WasmExportedFunctionData result =
-      WasmExportedFunctionData::cast(AllocateRawWithImmortalMap(
-          map.instance_size(), AllocationType::kOld, map));
+    int wrapper_budget, wasm::Promise promise) {
+  Tagged<Map> map = *wasm_exported_function_data_map();
+  Tagged<WasmExportedFunctionData> result =
+      Tagged<WasmExportedFunctionData>::cast(AllocateRawWithImmortalMap(
+          map->instance_size(), AllocationType::kOld, map));
   DisallowGarbageCollection no_gc;
-  DCHECK(ref->IsWasmInstanceObject() || ref->IsWasmApiFunctionRef());
-  result.set_internal(*internal);
-  result.set_wrapper_code(*export_wrapper);
-  result.set_instance(*instance);
-  result.set_function_index(func_index);
-  result.init_sig(isolate(), sig);
-  result.set_canonical_type_index(canonical_type_index);
-  result.set_wrapper_budget(wrapper_budget);
+  result->set_internal(*internal);
+  result->set_wrapper_code(*export_wrapper);
+  result->set_instance(*instance);
+  result->set_function_index(func_index);
+  result->init_sig(isolate(), sig);
+  result->set_canonical_type_index(canonical_type_index);
+  result->set_wrapper_budget(wrapper_budget);
   // We can't skip the write barrier because Code objects are not immovable.
-  result.set_c_wrapper_code(*BUILTIN_CODE(isolate(), Illegal),
-                            UPDATE_WRITE_BARRIER);
-  result.set_packed_args_size(0);
-  result.set_js_promise_flags(
+  result->set_c_wrapper_code(*BUILTIN_CODE(isolate(), Illegal),
+                             UPDATE_WRITE_BARRIER);
+  result->set_packed_args_size(0);
+  result->set_js_promise_flags(
       WasmFunctionData::SuspendField::encode(wasm::kNoSuspend) |
       WasmFunctionData::PromiseField::encode(promise));
   return handle(result, isolate());
@@ -1732,50 +1759,59 @@ Handle<WasmCapiFunctionData> Factory::NewWasmCapiFunctionData(
     Address call_target, Handle<Foreign> embedder_data,
     Handle<Code> wrapper_code, Handle<Map> rtt,
     Handle<PodArray<wasm::ValueType>> serialized_sig) {
-  Handle<WasmApiFunctionRef> ref = NewWasmApiFunctionRef(
-      Handle<JSReceiver>(), wasm::kNoSuspend, Handle<WasmInstanceObject>());
+  Handle<WasmApiFunctionRef> ref =
+      NewWasmApiFunctionRef(Handle<JSReceiver>(), wasm::kNoSuspend,
+                            Handle<WasmInstanceObject>(), serialized_sig);
   Handle<WasmInternalFunction> internal =
-      NewWasmInternalFunction(call_target, ref, rtt);
-  Map map = *wasm_capi_function_data_map();
-  WasmCapiFunctionData result =
-      WasmCapiFunctionData::cast(AllocateRawWithImmortalMap(
-          map.instance_size(), AllocationType::kOld, map));
+      NewWasmInternalFunction(call_target, ref, rtt, -1);
+  WasmApiFunctionRef::SetInternalFunctionAsCallOrigin(ref, internal);
+  Tagged<Map> map = *wasm_capi_function_data_map();
+  Tagged<WasmCapiFunctionData> result =
+      Tagged<WasmCapiFunctionData>::cast(AllocateRawWithImmortalMap(
+          map->instance_size(), AllocationType::kOld, map));
   DisallowGarbageCollection no_gc;
-  result.set_internal(*internal);
-  result.set_wrapper_code(*wrapper_code);
-  result.set_embedder_data(*embedder_data);
-  result.set_serialized_signature(*serialized_sig);
-  result.set_js_promise_flags(
+  result->set_internal(*internal);
+  result->set_wrapper_code(*wrapper_code);
+  result->set_embedder_data(*embedder_data);
+  result->set_serialized_signature(*serialized_sig);
+  result->set_js_promise_flags(
       WasmFunctionData::SuspendField::encode(wasm::kNoSuspend) |
       WasmFunctionData::PromiseField::encode(wasm::kNoPromise));
   return handle(result, isolate());
 }
 
+Tagged<WasmArray> Factory::NewWasmArrayUninitialized(uint32_t length,
+                                                     Handle<Map> map) {
+  Tagged<HeapObject> raw =
+      AllocateRaw(WasmArray::SizeFor(*map, length), AllocationType::kYoung);
+  DisallowGarbageCollection no_gc;
+  raw->set_map_after_allocation(*map);
+  Tagged<WasmArray> result = Tagged<WasmArray>::cast(raw);
+  result->set_raw_properties_or_hash(*empty_fixed_array(), kRelaxedStore);
+  result->set_length(length);
+  return result;
+}
+
 Handle<WasmArray> Factory::NewWasmArray(const wasm::ArrayType* type,
                                         uint32_t length,
                                         wasm::WasmValue initial_value,
                                         Handle<Map> map) {
-  HeapObject raw =
-      AllocateRaw(WasmArray::SizeFor(*map, length), AllocationType::kYoung);
+  Tagged<WasmArray> result = NewWasmArrayUninitialized(length, map);
   DisallowGarbageCollection no_gc;
-  raw.set_map_after_allocation(*map);
-  WasmArray result = WasmArray::cast(raw);
-  result.set_raw_properties_or_hash(*empty_fixed_array(), kRelaxedStore);
-  result.set_length(length);
   if (type->element_type().is_numeric()) {
     if (initial_value.zero_byte_representation()) {
-      memset(reinterpret_cast<void*>(result.ElementAddress(0)), 0,
+      memset(reinterpret_cast<void*>(result->ElementAddress(0)), 0,
              length * type->element_type().value_kind_size());
     } else {
       wasm::WasmValue packed = initial_value.Packed(type->element_type());
       for (uint32_t i = 0; i < length; i++) {
-        Address address = result.ElementAddress(i);
-        packed.CopyTo(reinterpret_cast<byte*>(address));
+        Address address = result->ElementAddress(i);
+        packed.CopyTo(reinterpret_cast<uint8_t*>(address));
       }
     }
   } else {
     for (uint32_t i = 0; i < length; i++) {
-      result.SetTaggedElement(i, initial_value.to_ref());
+      result->SetTaggedElement(i, initial_value.to_ref());
     }
   }
   return handle(result, isolate());
@@ -1785,23 +1821,18 @@ Handle<WasmArray> Factory::NewWasmArrayFromElements(
     const wasm::ArrayType* type, const std::vector<wasm::WasmValue>& elements,
     Handle<Map> map) {
   uint32_t length = static_cast<uint32_t>(elements.size());
-  HeapObject raw =
-      AllocateRaw(WasmArray::SizeFor(*map, length), AllocationType::kYoung);
+  Tagged<WasmArray> result = NewWasmArrayUninitialized(length, map);
   DisallowGarbageCollection no_gc;
-  raw.set_map_after_allocation(*map);
-  WasmArray result = WasmArray::cast(raw);
-  result.set_raw_properties_or_hash(*empty_fixed_array(), kRelaxedStore);
-  result.set_length(length);
   if (type->element_type().is_numeric()) {
     for (uint32_t i = 0; i < length; i++) {
-      Address address = result.ElementAddress(i);
+      Address address = result->ElementAddress(i);
       elements[i]
           .Packed(type->element_type())
-          .CopyTo(reinterpret_cast<byte*>(address));
+          .CopyTo(reinterpret_cast<uint8_t*>(address));
     }
   } else {
     for (uint32_t i = 0; i < length; i++) {
-      result.SetTaggedElement(i, elements[i].to_ref());
+      result->SetTaggedElement(i, elements[i].to_ref());
     }
   }
   return handle(result, isolate());
@@ -1811,19 +1842,20 @@ Handle<WasmArray> Factory::NewWasmArrayFromMemory(uint32_t length,
                                                   Handle<Map> map,
                                                   Address source) {
   wasm::ValueType element_type =
-      reinterpret_cast<wasm::ArrayType*>(map->wasm_type_info().native_type())
+      reinterpret_cast<wasm::ArrayType*>(map->wasm_type_info()->native_type())
           ->element_type();
   DCHECK(element_type.is_numeric());
-  HeapObject raw =
-      AllocateRaw(WasmArray::SizeFor(*map, length), AllocationType::kYoung);
+  Tagged<WasmArray> result = NewWasmArrayUninitialized(length, map);
   DisallowGarbageCollection no_gc;
-  raw.set_map_after_allocation(*map);
-  WasmArray result = WasmArray::cast(raw);
-  result.set_raw_properties_or_hash(*empty_fixed_array(), kRelaxedStore);
-  result.set_length(length);
-  MemCopy(reinterpret_cast<void*>(result.ElementAddress(0)),
+#if V8_TARGET_BIG_ENDIAN
+  MemCopyAndSwitchEndianness(reinterpret_cast<void*>(result->ElementAddress(0)),
+                             reinterpret_cast<void*>(source), length,
+                             element_type.value_kind_size());
+#else
+  MemCopy(reinterpret_cast<void*>(result->ElementAddress(0)),
           reinterpret_cast<void*>(source),
           length * element_type.value_kind_size());
+#endif
 
   return handle(result, isolate());
 }
@@ -1832,24 +1864,9 @@ Handle<Object> Factory::NewWasmArrayFromElementSegment(
     Handle<WasmInstanceObject> instance, uint32_t segment_index,
     uint32_t start_offset, uint32_t length, Handle<Map> map) {
   DCHECK(WasmArray::type(*map)->element_type().is_reference());
-  HeapObject raw =
-      AllocateRaw(WasmArray::SizeFor(*map, length), AllocationType::kYoung);
-  {
-    DisallowGarbageCollection no_gc;
-    raw.set_map_after_allocation(*map);
-    WasmArray result = WasmArray::cast(raw);
-    result.set_raw_properties_or_hash(*empty_fixed_array(), kRelaxedStore);
-    result.set_length(length);
-    // We have to initialize the elements to a default value, because we might
-    // allocate new objects while computing the elements below.
-    for (uint32_t i = 0; i < length; i++) {
-      result.SetTaggedElement(i, undefined_value(), SKIP_WRITE_BARRIER);
-    }
-  }
 
-  Handle<WasmArray> result = handle(WasmArray::cast(raw), isolate());
-
-  // Lazily initialize the element segment if needed.
+  // If the element segment has not been initialized yet, lazily initialize it
+  // now.
   AccountingAllocator allocator;
   Zone zone(&allocator, ZONE_NAME);
   base::Optional<MessageTemplate> opt_error =
@@ -1859,29 +1876,34 @@ Handle<Object> Factory::NewWasmArrayFromElementSegment(
   }
 
   Handle<FixedArray> elements =
-      handle(FixedArray::cast(instance->element_segments().get(segment_index)),
+      handle(FixedArray::cast(instance->element_segments()->get(segment_index)),
              isolate());
 
-  for (uint32_t i = 0; i < length; i++) {
-    result->SetTaggedElement(
-        i, handle(elements->get(start_offset + i), isolate()));
+  Tagged<WasmArray> result = NewWasmArrayUninitialized(length, map);
+  DisallowGarbageCollection no_gc;
+  if (length > 0) {
+    isolate()->heap()->CopyRange(result, result->ElementSlot(0),
+                                 elements->RawFieldOfElementAt(start_offset),
+                                 length, SKIP_WRITE_BARRIER);
   }
-
-  return result;
+  return handle(result, isolate());
 }
 
 Handle<WasmStruct> Factory::NewWasmStruct(const wasm::StructType* type,
                                           wasm::WasmValue* args,
                                           Handle<Map> map) {
-  HeapObject raw = AllocateRaw(WasmStruct::Size(type), AllocationType::kYoung);
-  raw.set_map_after_allocation(*map);
-  WasmStruct result = WasmStruct::cast(raw);
-  result.set_raw_properties_or_hash(*empty_fixed_array(), kRelaxedStore);
+  Tagged<HeapObject> raw =
+      AllocateRaw(WasmStruct::Size(type), AllocationType::kYoung);
+  raw->set_map_after_allocation(*map);
+  Tagged<WasmStruct> result = WasmStruct::cast(raw);
+  result->set_raw_properties_or_hash(*empty_fixed_array(), kRelaxedStore);
   for (uint32_t i = 0; i < type->field_count(); i++) {
     int offset = type->field_offset(i);
     if (type->field(i).is_numeric()) {
-      Address address = result.RawFieldAddress(offset);
-      args[i].Packed(type->field(i)).CopyTo(reinterpret_cast<byte*>(address));
+      Address address = result->RawFieldAddress(offset);
+      args[i]
+          .Packed(type->field(i))
+          .CopyTo(reinterpret_cast<uint8_t*>(address));
     } else {
       offset += WasmStruct::kHeaderSize;
       TaggedField<Object>::store(result, offset, *args[i].to_ref());
@@ -1893,12 +1915,12 @@ Handle<WasmStruct> Factory::NewWasmStruct(const wasm::StructType* type,
 Handle<WasmContinuationObject> Factory::NewWasmContinuationObject(
     Address jmpbuf, Handle<Foreign> managed_stack, Handle<HeapObject> parent,
     AllocationType allocation) {
-  Map map = *wasm_continuation_object_map();
-  auto result = WasmContinuationObject::cast(
-      AllocateRawWithImmortalMap(map.instance_size(), allocation, map));
-  result.init_jmpbuf(isolate(), jmpbuf);
-  result.set_stack(*managed_stack);
-  result.set_parent(*parent);
+  Tagged<Map> map = *wasm_continuation_object_map();
+  auto result = Tagged<WasmContinuationObject>::cast(
+      AllocateRawWithImmortalMap(map->instance_size(), allocation, map));
+  result->init_jmpbuf(isolate(), jmpbuf);
+  result->set_stack(*managed_stack);
+  result->set_parent(*parent);
   return handle(result, isolate());
 }
 
@@ -1926,54 +1948,57 @@ Handle<SharedFunctionInfo> Factory::NewSharedFunctionInfoForWasmCapiFunction(
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-Handle<Cell> Factory::NewCell(Smi value) {
+Handle<Cell> Factory::NewCell(Tagged<Smi> value) {
   static_assert(Cell::kSize <= kMaxRegularHeapObjectSize);
-  Cell result = Cell::cast(AllocateRawWithImmortalMap(
+  Tagged<Cell> result = Tagged<Cell>::cast(AllocateRawWithImmortalMap(
       Cell::kSize, AllocationType::kOld, *cell_map()));
   DisallowGarbageCollection no_gc;
-  result.set_value(value, WriteBarrierMode::SKIP_WRITE_BARRIER);
+  result->set_value(value, WriteBarrierMode::SKIP_WRITE_BARRIER);
   return handle(result, isolate());
 }
 
 Handle<Cell> Factory::NewCell() {
   static_assert(Cell::kSize <= kMaxRegularHeapObjectSize);
-  Cell result = Cell::cast(AllocateRawWithImmortalMap(
+  Tagged<Cell> result = Tagged<Cell>::cast(AllocateRawWithImmortalMap(
       Cell::kSize, AllocationType::kOld, *cell_map()));
-  result.set_value(read_only_roots().undefined_value(),
-                   WriteBarrierMode::SKIP_WRITE_BARRIER);
+  result->set_value(read_only_roots().undefined_value(),
+                    WriteBarrierMode::SKIP_WRITE_BARRIER);
   return handle(result, isolate());
 }
 
 Handle<FeedbackCell> Factory::NewNoClosuresCell(Handle<HeapObject> value) {
-  FeedbackCell result = FeedbackCell::cast(AllocateRawWithImmortalMap(
-      FeedbackCell::kAlignedSize, AllocationType::kOld,
-      *no_closures_cell_map()));
+  Tagged<FeedbackCell> result =
+      Tagged<FeedbackCell>::cast(AllocateRawWithImmortalMap(
+          FeedbackCell::kAlignedSize, AllocationType::kOld,
+          *no_closures_cell_map()));
   DisallowGarbageCollection no_gc;
-  result.set_value(*value);
-  result.SetInitialInterruptBudget();
-  result.clear_padding();
+  result->set_value(*value);
+  result->clear_interrupt_budget();
+  result->clear_padding();
   return handle(result, isolate());
 }
 
 Handle<FeedbackCell> Factory::NewOneClosureCell(Handle<HeapObject> value) {
-  FeedbackCell result = FeedbackCell::cast(AllocateRawWithImmortalMap(
-      FeedbackCell::kAlignedSize, AllocationType::kOld,
-      *one_closure_cell_map()));
+  Tagged<FeedbackCell> result =
+      Tagged<FeedbackCell>::cast(AllocateRawWithImmortalMap(
+          FeedbackCell::kAlignedSize, AllocationType::kOld,
+          *one_closure_cell_map()));
   DisallowGarbageCollection no_gc;
-  result.set_value(*value);
-  result.SetInitialInterruptBudget();
-  result.clear_padding();
+  result->set_value(*value);
+  result->clear_interrupt_budget();
+  result->clear_padding();
   return handle(result, isolate());
 }
 
 Handle<FeedbackCell> Factory::NewManyClosuresCell(Handle<HeapObject> value) {
-  FeedbackCell result = FeedbackCell::cast(AllocateRawWithImmortalMap(
-      FeedbackCell::kAlignedSize, AllocationType::kOld,
-      *many_closures_cell_map()));
+  Tagged<FeedbackCell> result =
+      Tagged<FeedbackCell>::cast(AllocateRawWithImmortalMap(
+          FeedbackCell::kAlignedSize, AllocationType::kOld,
+          *many_closures_cell_map()));
   DisallowGarbageCollection no_gc;
-  result.set_value(*value);
-  result.SetInitialInterruptBudget();
-  result.clear_padding();
+  result->set_value(*value);
+  result->clear_interrupt_budget();
+  result->clear_padding();
   return handle(result, isolate());
 }
 
@@ -1981,20 +2006,21 @@ Handle<PropertyCell> Factory::NewPropertyCell(Handle<Name> name,
                                               PropertyDetails details,
                                               Handle<Object> value,
                                               AllocationType allocation) {
-  DCHECK(name->IsUniqueName());
+  DCHECK(IsUniqueName(*name));
   static_assert(PropertyCell::kSize <= kMaxRegularHeapObjectSize);
-  PropertyCell cell = PropertyCell::cast(AllocateRawWithImmortalMap(
-      PropertyCell::kSize, allocation, *global_property_cell_map()));
+  Tagged<PropertyCell> cell =
+      Tagged<PropertyCell>::cast(AllocateRawWithImmortalMap(
+          PropertyCell::kSize, allocation, *global_property_cell_map()));
   DisallowGarbageCollection no_gc;
-  cell.set_dependent_code(
+  cell->set_dependent_code(
       DependentCode::empty_dependent_code(ReadOnlyRoots(isolate())),
       SKIP_WRITE_BARRIER);
   WriteBarrierMode mode = allocation == AllocationType::kYoung
                               ? SKIP_WRITE_BARRIER
                               : UPDATE_WRITE_BARRIER;
-  cell.set_name(*name, mode);
-  cell.set_value(*value, mode);
-  cell.set_property_details_raw(details.AsSmi(), SKIP_WRITE_BARRIER);
+  cell->set_name(*name, mode);
+  cell->set_value(*value, mode);
+  cell->set_property_details_raw(details.AsSmi(), SKIP_WRITE_BARRIER);
   return handle(cell, isolate());
 }
 
@@ -2052,64 +2078,70 @@ Handle<Map> Factory::NewMap(InstanceType type, int instance_size,
                      IsSharedArrayElementsKind(elements_kind));
   DCHECK(allocation_type == AllocationType::kMap ||
          allocation_type == AllocationType::kSharedMap);
-  HeapObject result = allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
-      Map::kSize, allocation_type);
+  Tagged<HeapObject> result =
+      allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
+          Map::kSize, allocation_type);
   DisallowGarbageCollection no_gc;
   Heap* roots = allocation_type == AllocationType::kMap
                     ? isolate()->heap()
                     : isolate()->shared_space_isolate()->heap();
-  result.set_map_after_allocation(ReadOnlyRoots(roots).meta_map(),
-                                  SKIP_WRITE_BARRIER);
+  result->set_map_after_allocation(ReadOnlyRoots(roots).meta_map(),
+                                   SKIP_WRITE_BARRIER);
 #if V8_STATIC_ROOTS_BOOL
   CHECK_IMPLIES(InstanceTypeChecker::IsJSReceiver(type),
                 V8HeapCompressionScheme::CompressObject(result.ptr()) >
                     InstanceTypeChecker::kNonJsReceiverMapLimit);
 #endif
+  isolate()->counters()->maps_created()->Increment();
   return handle(InitializeMap(Map::cast(result), type, instance_size,
                               elements_kind, inobject_properties, roots),
                 isolate());
 }
 
-Map Factory::InitializeMap(Map map, InstanceType type, int instance_size,
-                           ElementsKind elements_kind, int inobject_properties,
-                           Heap* roots) {
+Tagged<Map> Factory::InitializeMap(Tagged<Map> map, InstanceType type,
+                                   int instance_size,
+                                   ElementsKind elements_kind,
+                                   int inobject_properties, Heap* roots) {
   DisallowGarbageCollection no_gc;
-  map.set_bit_field(0);
-  map.set_bit_field2(Map::Bits2::NewTargetIsBaseBit::encode(true));
+  map->set_bit_field(0);
+  map->set_bit_field2(Map::Bits2::NewTargetIsBaseBit::encode(true));
   int bit_field3 =
       Map::Bits3::EnumLengthBits::encode(kInvalidEnumCacheSentinel) |
       Map::Bits3::OwnsDescriptorsBit::encode(true) |
       Map::Bits3::ConstructionCounterBits::encode(Map::kNoSlackTracking) |
       Map::Bits3::IsExtensibleBit::encode(true);
-  map.set_bit_field3(bit_field3);
-  map.set_instance_type(type);
+  map->set_bit_field3(bit_field3);
+  map->set_instance_type(type);
   ReadOnlyRoots ro_roots(roots);
-  map.init_prototype_and_constructor_or_back_pointer(ro_roots);
-  map.set_instance_size(instance_size);
-  if (map.IsJSObjectMap()) {
-    DCHECK(!ReadOnlyHeap::Contains(map));
-    map.SetInObjectPropertiesStartInWords(instance_size / kTaggedSize -
-                                          inobject_properties);
-    DCHECK_EQ(map.GetInObjectProperties(), inobject_properties);
-    map.set_prototype_validity_cell(ro_roots.invalid_prototype_validity_cell(),
-                                    kRelaxedStore);
+  map->init_prototype_and_constructor_or_back_pointer(ro_roots);
+  map->set_instance_size(instance_size);
+  if (IsJSObjectMap(*map)) {
+    // Shared space JS objects have fixed layout and can have RO maps. No other
+    // JS objects have RO maps.
+    DCHECK_IMPLIES(!IsAlwaysSharedSpaceJSObjectMap(*map),
+                   !ReadOnlyHeap::Contains(map));
+    map->SetInObjectPropertiesStartInWords(instance_size / kTaggedSize -
+                                           inobject_properties);
+    DCHECK_EQ(map->GetInObjectProperties(), inobject_properties);
+    map->set_prototype_validity_cell(ro_roots.invalid_prototype_validity_cell(),
+                                     kRelaxedStore);
   } else {
     DCHECK_EQ(inobject_properties, 0);
-    map.set_inobject_properties_start_or_constructor_function_index(0);
-    map.set_prototype_validity_cell(Smi::FromInt(Map::kPrototypeChainValid),
-                                    kRelaxedStore, SKIP_WRITE_BARRIER);
+    map->set_inobject_properties_start_or_constructor_function_index(0);
+    map->set_prototype_validity_cell(Smi::FromInt(Map::kPrototypeChainValid),
+                                     kRelaxedStore, SKIP_WRITE_BARRIER);
   }
-  map.set_dependent_code(DependentCode::empty_dependent_code(ro_roots),
-                         SKIP_WRITE_BARRIER);
-  map.set_raw_transitions(MaybeObject::FromSmi(Smi::zero()),
+  map->set_dependent_code(DependentCode::empty_dependent_code(ro_roots),
                           SKIP_WRITE_BARRIER);
-  map.SetInObjectUnusedPropertyFields(inobject_properties);
-  map.SetInstanceDescriptors(isolate(), ro_roots.empty_descriptor_array(), 0);
+  map->set_raw_transitions(MaybeObject::FromSmi(Smi::zero()),
+                           SKIP_WRITE_BARRIER);
+  map->SetInObjectUnusedPropertyFields(inobject_properties);
+  map->SetInstanceDescriptors(isolate(), ro_roots.empty_descriptor_array(), 0);
   // Must be called only after |instance_type| and |instance_size| are set.
-  map.set_visitor_id(Map::GetVisitorId(map));
-  DCHECK(!map.is_in_retained_map_list());
-  map.clear_padding();
-  map.set_elements_kind(elements_kind);
+  map->set_visitor_id(Map::GetVisitorId(map));
+  DCHECK(!map->is_in_retained_map_list());
+  map->clear_padding();
+  map->set_elements_kind(elements_kind);
   if (v8_flags.log_maps) LOG(isolate(), MapCreate(map));
   return map;
 }
@@ -2150,7 +2182,7 @@ Handle<JSObject> Factory::CopyJSObjectWithAllocationSite(
     adjusted_object_size +=
         ALIGN_TO_ALLOCATION_ALIGNMENT(AllocationMemento::kSize);
   }
-  HeapObject raw_clone =
+  Tagged<HeapObject> raw_clone =
       allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
           adjusted_object_size, AllocationType::kYoung);
 
@@ -2167,34 +2199,36 @@ Handle<JSObject> Factory::CopyJSObjectWithAllocationSite(
     isolate()->heap()->WriteBarrierForRange(raw_clone, start, end);
   }
   if (!site.is_null()) {
-    AllocationMemento alloc_memento = AllocationMemento::unchecked_cast(
-        Object(raw_clone.ptr() + aligned_object_size));
+    Tagged<AllocationMemento> alloc_memento =
+        Tagged<AllocationMemento>::unchecked_cast(
+            Tagged<Object>(raw_clone.ptr() + aligned_object_size));
     InitializeAllocationMemento(alloc_memento, *site);
   }
 
   SLOW_DCHECK(clone->GetElementsKind() == source->GetElementsKind());
-  FixedArrayBase elements = source->elements();
+  Tagged<FixedArrayBase> elements = source->elements();
   // Update elements if necessary.
-  if (elements.length() > 0) {
-    FixedArrayBase elem;
-    if (elements.map() == *fixed_cow_array_map()) {
+  if (elements->length() > 0) {
+    Tagged<FixedArrayBase> elem;
+    if (elements->map() == *fixed_cow_array_map()) {
       elem = elements;
     } else if (source->HasDoubleElements()) {
       elem = *CopyFixedDoubleArray(
           handle(FixedDoubleArray::cast(elements), isolate()));
     } else {
-      elem = *CopyFixedArray(handle(FixedArray::cast(elements), isolate()));
+      elem = *CopyFixedArray(
+          handle(Tagged<FixedArray>::cast(elements), isolate()));
     }
     clone->set_elements(elem);
   }
 
   // Update properties if necessary.
   if (source->HasFastProperties()) {
-    PropertyArray properties = source->property_array();
-    if (properties.length() > 0) {
+    Tagged<PropertyArray> properties = source->property_array();
+    if (properties->length() > 0) {
       // TODO(gsathya): Do not copy hash code.
       Handle<PropertyArray> prop = CopyArrayWithMap(
-          handle(properties, isolate()), handle(properties.map(), isolate()));
+          handle(properties, isolate()), handle(properties->map(), isolate()));
       clone->set_raw_properties_or_hash(*prop, kRelaxedStore);
     }
   } else {
@@ -2213,17 +2247,18 @@ Handle<JSObject> Factory::CopyJSObjectWithAllocationSite(
 
 namespace {
 template <typename T>
-void initialize_length(T array, int length) {
-  array.set_length(length);
+void initialize_length(Tagged<T> array, int length) {
+  array->set_length(length);
 }
 
 template <>
-void initialize_length<PropertyArray>(PropertyArray array, int length) {
-  array.initialize_length(length);
+void initialize_length<PropertyArray>(Tagged<PropertyArray> array, int length) {
+  array->initialize_length(length);
 }
 
-inline void InitEmbedderFields(i::JSObject obj, i::Object initial_value) {
-  for (int i = 0; i < obj.GetEmbedderFieldCount(); i++) {
+inline void InitEmbedderFields(Tagged<JSObject> obj,
+                               Tagged<Object> initial_value) {
+  for (int i = 0; i < obj->GetEmbedderFieldCount(); i++) {
     EmbedderDataSlot(obj, i).Initialize(initial_value);
   }
 }
@@ -2231,16 +2266,17 @@ inline void InitEmbedderFields(i::JSObject obj, i::Object initial_value) {
 }  // namespace
 
 template <typename T>
-Handle<T> Factory::CopyArrayWithMap(Handle<T> src, Handle<Map> map) {
+Handle<T> Factory::CopyArrayWithMap(Handle<T> src, Handle<Map> map,
+                                    AllocationType allocation) {
   int len = src->length();
-  HeapObject new_object = AllocateRawFixedArray(len, AllocationType::kYoung);
+  Tagged<HeapObject> new_object = AllocateRawFixedArray(len, allocation);
   DisallowGarbageCollection no_gc;
-  new_object.set_map_after_allocation(*map, SKIP_WRITE_BARRIER);
-  T result = T::cast(new_object);
+  new_object->set_map_after_allocation(*map, SKIP_WRITE_BARRIER);
+  Tagged<T> result = Tagged<T>::cast(new_object);
   initialize_length(result, len);
   // Copy the content.
-  WriteBarrierMode mode = result.GetWriteBarrierMode(no_gc);
-  result.CopyElements(isolate(), 0, *src, 0, len, mode);
+  WriteBarrierMode mode = result->GetWriteBarrierMode(no_gc);
+  result->CopyElements(isolate(), 0, *src, 0, len, mode);
   return handle(result, isolate());
 }
 
@@ -2251,22 +2287,23 @@ Handle<T> Factory::CopyArrayAndGrow(Handle<T> src, int grow_by,
   DCHECK_LE(grow_by, kMaxInt - src->length());
   int old_len = src->length();
   int new_len = old_len + grow_by;
-  HeapObject new_object = AllocateRawFixedArray(new_len, allocation);
+  Tagged<HeapObject> new_object = AllocateRawFixedArray(new_len, allocation);
   DisallowGarbageCollection no_gc;
-  new_object.set_map_after_allocation(src->map(), SKIP_WRITE_BARRIER);
-  T result = T::cast(new_object);
+  new_object->set_map_after_allocation(src->map(), SKIP_WRITE_BARRIER);
+  Tagged<T> result = Tagged<T>::cast(new_object);
   initialize_length(result, new_len);
   // Copy the content.
-  WriteBarrierMode mode = result.GetWriteBarrierMode(no_gc);
-  result.CopyElements(isolate(), 0, *src, 0, old_len, mode);
-  MemsetTagged(ObjectSlot(result.data_start() + old_len),
+  WriteBarrierMode mode = result->GetWriteBarrierMode(no_gc);
+  result->CopyElements(isolate(), 0, *src, 0, old_len, mode);
+  MemsetTagged(ObjectSlot(result->data_start() + old_len),
                read_only_roots().undefined_value(), grow_by);
   return handle(result, isolate());
 }
 
 Handle<FixedArray> Factory::CopyFixedArrayWithMap(Handle<FixedArray> array,
-                                                  Handle<Map> map) {
-  return CopyArrayWithMap(array, map);
+                                                  Handle<Map> map,
+                                                  AllocationType allocation) {
+  return CopyArrayWithMap(array, map, allocation);
 }
 
 Handle<WeakArrayList> Factory::NewUninitializedWeakArrayList(
@@ -2274,13 +2311,14 @@ Handle<WeakArrayList> Factory::NewUninitializedWeakArrayList(
   DCHECK_LE(0, capacity);
   if (capacity == 0) return empty_weak_array_list();
 
-  HeapObject heap_object = AllocateRawWeakArrayList(capacity, allocation);
+  Tagged<HeapObject> heap_object =
+      AllocateRawWeakArrayList(capacity, allocation);
   DisallowGarbageCollection no_gc;
-  heap_object.set_map_after_allocation(*weak_array_list_map(),
-                                       SKIP_WRITE_BARRIER);
-  WeakArrayList result = WeakArrayList::cast(heap_object);
-  result.set_length(0);
-  result.set_capacity(capacity);
+  heap_object->set_map_after_allocation(*weak_array_list_map(),
+                                        SKIP_WRITE_BARRIER);
+  Tagged<WeakArrayList> result = Tagged<WeakArrayList>::cast(heap_object);
+  result->set_length(0);
+  result->set_capacity(capacity);
   return handle(result, isolate());
 }
 
@@ -2301,7 +2339,7 @@ Handle<FixedArray> Factory::CopyFixedArrayAndGrow(Handle<FixedArray> array,
 
 Handle<WeakFixedArray> Factory::CopyWeakFixedArrayAndGrow(
     Handle<WeakFixedArray> src, int grow_by) {
-  DCHECK(!src->IsTransitionArray());  // Compacted by GC, this code doesn't work
+  DCHECK(!IsTransitionArray(*src));  // Compacted by GC, this code doesn't work
   return CopyArrayAndGrow(src, grow_by, AllocationType::kOld);
 }
 
@@ -2313,13 +2351,13 @@ Handle<WeakArrayList> Factory::CopyWeakArrayListAndGrow(
   Handle<WeakArrayList> result =
       NewUninitializedWeakArrayList(new_capacity, allocation);
   DisallowGarbageCollection no_gc;
-  WeakArrayList raw = *result;
+  Tagged<WeakArrayList> raw = *result;
   int old_len = src->length();
-  raw.set_length(old_len);
+  raw->set_length(old_len);
   // Copy the content.
-  WriteBarrierMode mode = raw.GetWriteBarrierMode(no_gc);
-  raw.CopyElements(isolate(), 0, *src, 0, old_len, mode);
-  MemsetTagged(ObjectSlot(raw.data_start() + old_len),
+  WriteBarrierMode mode = raw->GetWriteBarrierMode(no_gc);
+  raw->CopyElements(isolate(), 0, *src, 0, old_len, mode);
+  MemsetTagged(ObjectSlot(raw->data_start() + old_len),
                read_only_roots().undefined_value(), new_capacity - old_len);
   return result;
 }
@@ -2332,18 +2370,18 @@ Handle<WeakArrayList> Factory::CompactWeakArrayList(Handle<WeakArrayList> src,
 
   // Copy the content.
   DisallowGarbageCollection no_gc;
-  WeakArrayList raw_src = *src;
-  WeakArrayList raw_result = *result;
-  WriteBarrierMode mode = raw_result.GetWriteBarrierMode(no_gc);
-  int copy_to = 0, length = raw_src.length();
+  Tagged<WeakArrayList> raw_src = *src;
+  Tagged<WeakArrayList> raw_result = *result;
+  WriteBarrierMode mode = raw_result->GetWriteBarrierMode(no_gc);
+  int copy_to = 0, length = raw_src->length();
   for (int i = 0; i < length; i++) {
-    MaybeObject element = raw_src.Get(i);
+    MaybeObject element = raw_src->Get(i);
     if (element->IsCleared()) continue;
-    raw_result.Set(copy_to++, element, mode);
+    raw_result->Set(copy_to++, element, mode);
   }
-  raw_result.set_length(copy_to);
+  raw_result->set_length(copy_to);
 
-  MemsetTagged(ObjectSlot(raw_result.data_start() + copy_to),
+  MemsetTagged(ObjectSlot(raw_result->data_start() + copy_to),
                read_only_roots().undefined_value(), new_capacity - copy_to);
   return result;
 }
@@ -2359,14 +2397,14 @@ Handle<FixedArray> Factory::CopyFixedArrayUpTo(Handle<FixedArray> array,
   DCHECK_LE(0, new_len);
   DCHECK_LE(new_len, array->length());
   if (new_len == 0) return empty_fixed_array();
-  HeapObject heap_object = AllocateRawFixedArray(new_len, allocation);
+  Tagged<HeapObject> heap_object = AllocateRawFixedArray(new_len, allocation);
   DisallowGarbageCollection no_gc;
-  heap_object.set_map_after_allocation(*fixed_array_map(), SKIP_WRITE_BARRIER);
-  FixedArray result = FixedArray::cast(heap_object);
-  result.set_length(new_len);
+  heap_object->set_map_after_allocation(*fixed_array_map(), SKIP_WRITE_BARRIER);
+  Tagged<FixedArray> result = Tagged<FixedArray>::cast(heap_object);
+  result->set_length(new_len);
   // Copy the content.
-  WriteBarrierMode mode = result.GetWriteBarrierMode(no_gc);
-  result.CopyElements(isolate(), 0, *array, 0, new_len, mode);
+  WriteBarrierMode mode = result->GetWriteBarrierMode(no_gc);
+  result->CopyElements(isolate(), 0, *array, 0, new_len, mode);
   return handle(result, isolate());
 }
 
@@ -2458,10 +2496,10 @@ Handle<JSObject> Factory::NewFunctionPrototype(Handle<JSFunction> function) {
   // can be from a different context.
   Handle<NativeContext> native_context(function->native_context(), isolate());
   Handle<Map> new_map;
-  if (V8_UNLIKELY(IsAsyncGeneratorFunction(function->shared().kind()))) {
+  if (V8_UNLIKELY(IsAsyncGeneratorFunction(function->shared()->kind()))) {
     new_map = handle(native_context->async_generator_object_prototype_map(),
                      isolate());
-  } else if (IsResumableFunction(function->shared().kind())) {
+  } else if (IsResumableFunction(function->shared()->kind())) {
     // Generator and async function prototypes can share maps since they
     // don't have "constructor" properties.
     new_map =
@@ -2478,7 +2516,7 @@ Handle<JSObject> Factory::NewFunctionPrototype(Handle<JSFunction> function) {
   DCHECK(!new_map->is_prototype_map());
   Handle<JSObject> prototype = NewJSObjectFromMap(new_map);
 
-  if (!IsResumableFunction(function->shared().kind())) {
+  if (!IsResumableFunction(function->shared()->kind())) {
     JSObject::AddProperty(isolate(), prototype, constructor_string(), function,
                           DONT_ENUM);
   }
@@ -2493,83 +2531,66 @@ Handle<JSObject> Factory::NewExternal(void* value) {
   return external;
 }
 
-Handle<DeoptimizationLiteralArray> Factory::NewDeoptimizationLiteralArray(
-    int length) {
-  return Handle<DeoptimizationLiteralArray>::cast(
-      NewWeakFixedArray(length, AllocationType::kOld));
-}
-
-Handle<Code> Factory::NewOffHeapTrampolineFor(Handle<Code> code,
-                                              Address off_heap_entry) {
+Handle<Code> Factory::NewCodeObjectForEmbeddedBuiltin(Handle<Code> code,
+                                                      Address off_heap_entry) {
   CHECK_NOT_NULL(isolate()->embedded_blob_code());
   CHECK_NE(0, isolate()->embedded_blob_code_size());
   CHECK(Builtins::IsIsolateIndependentBuiltin(*code));
 
-#if !defined(V8_SHORT_BUILTIN_CALLS) || \
-    defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE)
-  // Builtins have a single unique shared entry point per process. The
-  // embedded builtins region may be remapped into the process-wide code
-  // range, but that happens before RO space is deserialized. Their Code
-  // objects can be shared in RO space.
-  const AllocationType allocation_type = AllocationType::kReadOnly;
-#else
-  // Builtins may be remapped more than once per process and thus their
-  // Code objects cannot be shared.
-  const AllocationType allocation_type = AllocationType::kOld;
-#endif  // !defined(V8_SHORT_BUILTIN_CALLS) ||
-        // defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE)
-
-  NewCodeOptions new_code_options = {
-      /*kind=*/code->kind(),
-      /*builtin=*/code->builtin_id(),
-      /*is_turbofanned=*/code->is_turbofanned(),
-      /*stack_slots=*/code->stack_slots(),
-      /*kind_specific_flags=*/code->kind_specific_flags(kRelaxedLoad),
-      /*allocation=*/allocation_type,
-      /*instruction_size=*/code->instruction_size(),
-      /*metadata_size=*/code->metadata_size(),
-      /*inlined_bytecode_size=*/code->inlined_bytecode_size(),
-      /*osr_offset=*/code->osr_offset(),
-      /*handler_table_offset=*/code->handler_table_offset(),
-      /*constant_pool_offset=*/code->constant_pool_offset(),
-      /*code_comments_offset=*/code->code_comments_offset(),
-      /*unwinding_info_offset=*/code->unwinding_info_offset(),
-      /*reloc_info=*/
-      Handle<ByteArray>(read_only_roots().empty_byte_array(), isolate()),
-      /*bytecode_or_deoptimization_data=*/
-      Handle<FixedArray>(read_only_roots().empty_fixed_array(), isolate()),
-      /*bytecode_offsets_or_source_position_table=*/
-      Handle<ByteArray>(read_only_roots().empty_byte_array(), isolate())};
-
-  Handle<Code> off_heap_trampoline = NewCode(new_code_options);
-  off_heap_trampoline->set_code_entry_point(isolate(),
-                                            code->code_entry_point());
-
-  DCHECK_EQ(code->instruction_size(), code->OffHeapInstructionSize());
-  DCHECK_EQ(code->metadata_size(), code->OffHeapMetadataSize());
+  DCHECK(code->has_instruction_stream());  // Just generated as on-heap code.
+  DCHECK(Builtins::IsBuiltinId(code->builtin_id()));
   DCHECK_EQ(code->inlined_bytecode_size(), 0);
   DCHECK_EQ(code->osr_offset(), BytecodeOffset::None());
+  DCHECK_EQ(code->raw_deoptimization_data_or_interpreter_data(),
+            read_only_roots().empty_fixed_array());
+  // .. because we don't explicitly initialize these flags:
+  DCHECK(!code->marked_for_deoptimization());
+  DCHECK(!code->can_have_weak_objects());
+  DCHECK(!code->embedded_objects_cleared());
+  // This check would fail. We explicitly replace any existing position tables
+  // with the empty byte array below. Note this isn't strictly necessary - we
+  // could keep the position tables if we'd properly allocate them into RO
+  // space when needed.
+  // DCHECK_EQ(code->raw_position_table(), *empty_byte_array());
 
-  return off_heap_trampoline;
+  NewCodeOptions new_code_options = {
+      code->kind(),
+      code->builtin_id(),
+      code->is_turbofanned(),
+      code->stack_slots(),
+      code->instruction_size(),
+      code->metadata_size(),
+      code->inlined_bytecode_size(),
+      code->osr_offset(),
+      code->handler_table_offset(),
+      code->constant_pool_offset(),
+      code->code_comments_offset(),
+      code->unwinding_info_offset(),
+      handle(code->raw_deoptimization_data_or_interpreter_data(), isolate()),
+      /*bytecode_offsets_or_source_position_table=*/empty_byte_array(),
+      /*instruction_stream=*/MaybeHandle<InstructionStream>{},
+      off_heap_entry,
+  };
+
+  return NewCode(new_code_options);
 }
 
 Handle<BytecodeArray> Factory::CopyBytecodeArray(Handle<BytecodeArray> source) {
   int size = BytecodeArray::SizeFor(source->length());
-  BytecodeArray copy = BytecodeArray::cast(AllocateRawWithImmortalMap(
+  Tagged<BytecodeArray> copy = BytecodeArray::cast(AllocateRawWithImmortalMap(
       size, AllocationType::kOld, *bytecode_array_map()));
   DisallowGarbageCollection no_gc;
-  BytecodeArray raw_source = *source;
-  copy.set_length(raw_source.length());
-  copy.set_frame_size(raw_source.frame_size());
-  copy.set_parameter_count(raw_source.parameter_count());
-  copy.set_incoming_new_target_or_generator_register(
-      raw_source.incoming_new_target_or_generator_register());
-  copy.set_constant_pool(raw_source.constant_pool());
-  copy.set_handler_table(raw_source.handler_table());
-  copy.set_source_position_table(raw_source.source_position_table(kAcquireLoad),
-                                 kReleaseStore);
-  copy.set_bytecode_age(raw_source.bytecode_age());
-  raw_source.CopyBytecodesTo(copy);
+  Tagged<BytecodeArray> raw_source = *source;
+  copy->set_length(raw_source->length());
+  copy->set_frame_size(raw_source->frame_size());
+  copy->set_parameter_count(raw_source->parameter_count());
+  copy->set_incoming_new_target_or_generator_register(
+      raw_source->incoming_new_target_or_generator_register());
+  copy->set_constant_pool(raw_source->constant_pool());
+  copy->set_handler_table(raw_source->handler_table());
+  copy->set_source_position_table(
+      raw_source->source_position_table(kAcquireLoad), kReleaseStore);
+  raw_source->CopyBytecodesTo(copy);
   return handle(copy, isolate());
 }
 
@@ -2577,6 +2598,9 @@ Handle<JSObject> Factory::NewJSObject(Handle<JSFunction> constructor,
                                       AllocationType allocation) {
   JSFunction::EnsureHasInitialMap(constructor);
   Handle<Map> map(constructor->initial_map(), isolate());
+  // NewJSObjectFromMap does not support creating dictionary mode objects. Need
+  // to use NewSlowJSObjectFromMap instead.
+  DCHECK(!map->is_dictionary_map());
   return NewJSObjectFromMap(map, allocation);
 }
 
@@ -2643,9 +2667,9 @@ Handle<JSGlobalObject> Factory::NewJSGlobalObject(
 
   // Create a new map for the global object.
   Handle<Map> new_map = Map::CopyDropDescriptors(isolate(), map);
-  Map raw_map = *new_map;
-  raw_map.set_may_have_interesting_symbols(true);
-  raw_map.set_is_dictionary_map(true);
+  Tagged<Map> raw_map = *new_map;
+  raw_map->set_may_have_interesting_properties(true);
+  raw_map->set_is_dictionary_map(true);
   LOG(isolate(), MapDetails(raw_map));
 
   // Set up the global object as a normalized object.
@@ -2653,15 +2677,16 @@ Handle<JSGlobalObject> Factory::NewJSGlobalObject(
   global->set_map(raw_map, kReleaseStore);
 
   // Make sure result is a global object with properties in dictionary.
-  DCHECK(global->IsJSGlobalObject() && !global->HasFastProperties());
+  DCHECK(IsJSGlobalObject(*global) && !global->HasFastProperties());
   return global;
 }
 
-void Factory::InitializeJSObjectFromMap(JSObject obj, Object properties,
-                                        Map map) {
+void Factory::InitializeJSObjectFromMap(Tagged<JSObject> obj,
+                                        Tagged<Object> properties,
+                                        Tagged<Map> map) {
   DisallowGarbageCollection no_gc;
-  obj.set_raw_properties_or_hash(properties, kRelaxedStore);
-  obj.initialize_elements();
+  obj->set_raw_properties_or_hash(properties, kRelaxedStore);
+  obj->initialize_elements();
   // TODO(1240798): Initialize the object's body using valid initial values
   // according to the object's initial map.  For example, if the map's
   // instance type is JS_ARRAY_TYPE, the length field should be initialized
@@ -2672,10 +2697,11 @@ void Factory::InitializeJSObjectFromMap(JSObject obj, Object properties,
   InitializeJSObjectBody(obj, map, JSObject::kHeaderSize);
 }
 
-void Factory::InitializeJSObjectBody(JSObject obj, Map map, int start_offset) {
+void Factory::InitializeJSObjectBody(Tagged<JSObject> obj, Tagged<Map> map,
+                                     int start_offset) {
   DisallowGarbageCollection no_gc;
-  if (start_offset == map.instance_size()) return;
-  DCHECK_LT(start_offset, map.instance_size());
+  if (start_offset == map->instance_size()) return;
+  DCHECK_LT(start_offset, map->instance_size());
 
   // We cannot always fill with one_pointer_filler_map because objects
   // created from API functions expect their embedder fields to be initialized
@@ -2686,12 +2712,12 @@ void Factory::InitializeJSObjectBody(JSObject obj, Map map, int start_offset) {
 
   // In case of Array subclassing the |map| could already be transitioned
   // to different elements kind from the initial map on which we track slack.
-  bool in_progress = map.IsInobjectSlackTrackingInProgress();
-  obj.InitializeBody(map, start_offset, in_progress,
-                     ReadOnlyRoots(isolate()).one_pointer_filler_map_word(),
-                     *undefined_value());
+  bool in_progress = map->IsInobjectSlackTrackingInProgress();
+  obj->InitializeBody(map, start_offset, in_progress,
+                      ReadOnlyRoots(isolate()).one_pointer_filler_map_word(),
+                      *undefined_value());
   if (in_progress) {
-    map.FindRootMap(isolate()).InobjectSlackTrackingStep(isolate());
+    map->FindRootMap(isolate())->InobjectSlackTrackingStep(isolate());
   }
 }
 
@@ -2706,20 +2732,20 @@ Handle<JSObject> Factory::NewJSObjectFromMap(
   // AllocateGlobalObject to be properly initialized.
   DCHECK(map->instance_type() != JS_GLOBAL_OBJECT_TYPE);
 
-  JSObject js_obj = JSObject::cast(
+  Tagged<JSObject> js_obj = Tagged<JSObject>::cast(
       AllocateRawWithAllocationSite(map, allocation, allocation_site));
 
   InitializeJSObjectFromMap(js_obj, *empty_fixed_array(), *map);
 
-  DCHECK(js_obj.HasFastElements() ||
+  DCHECK(js_obj->HasFastElements() ||
          (isolate()->bootstrapper()->IsActive() ||
           *map == isolate()
                       ->raw_native_context()
-                      .js_array_template_literal_object_map()) ||
-         js_obj.HasTypedArrayOrRabGsabTypedArrayElements() ||
-         js_obj.HasFastStringWrapperElements() ||
-         js_obj.HasFastArgumentsElements() || js_obj.HasDictionaryElements() ||
-         js_obj.HasSharedArrayElements());
+                      ->js_array_template_literal_object_map()) ||
+         js_obj->HasTypedArrayOrRabGsabTypedArrayElements() ||
+         js_obj->HasFastStringWrapperElements() ||
+         js_obj->HasFastArgumentsElements() ||
+         js_obj->HasDictionaryElements() || js_obj->HasSharedArrayElements());
   return handle(js_obj, isolate());
 }
 
@@ -2739,13 +2765,19 @@ Handle<JSObject> Factory::NewSlowJSObjectFromMap(
   return js_object;
 }
 
+Handle<JSObject> Factory::NewSlowJSObjectFromMap(Handle<Map> map) {
+  return NewSlowJSObjectFromMap(map, V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL
+                                         ? SwissNameDictionary::kInitialCapacity
+                                         : NameDictionary::kInitialCapacity);
+}
+
 Handle<JSObject> Factory::NewSlowJSObjectWithPropertiesAndElements(
     Handle<HeapObject> prototype, Handle<HeapObject> properties,
     Handle<FixedArrayBase> elements) {
   DCHECK_IMPLIES(V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL,
-                 properties->IsSwissNameDictionary());
+                 IsSwissNameDictionary(*properties));
   DCHECK_IMPLIES(!V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL,
-                 properties->IsNameDictionary());
+                 IsNameDictionary(*properties));
 
   Handle<Map> object_map = isolate()->slow_object_with_object_prototype_map();
   if (object_map->prototype() != *prototype) {
@@ -2756,7 +2788,7 @@ Handle<JSObject> Factory::NewSlowJSObjectWithPropertiesAndElements(
       NewJSObjectFromMap(object_map, AllocationType::kYoung);
   object->set_raw_properties_or_hash(*properties);
   if (*elements != read_only_roots().empty_fixed_array()) {
-    DCHECK(elements->IsNumberDictionary());
+    DCHECK(IsNumberDictionary(*elements));
     object_map =
         JSObject::GetElementsTransitionMap(object, DICTIONARY_ELEMENTS);
     JSObject::MigrateToMap(isolate(), object, object_map);
@@ -2798,11 +2830,11 @@ Handle<JSArray> Factory::NewJSArrayWithUnverifiedElements(
     Handle<FixedArrayBase> elements, ElementsKind elements_kind, int length,
     AllocationType allocation) {
   DCHECK(length <= elements->length());
-  NativeContext native_context = isolate()->raw_native_context();
-  Map map = native_context.GetInitialJSArrayMap(elements_kind);
+  Tagged<NativeContext> native_context = isolate()->raw_native_context();
+  Tagged<Map> map = native_context->GetInitialJSArrayMap(elements_kind);
   if (map.is_null()) {
-    JSFunction array_function = native_context.array_function();
-    map = array_function.initial_map();
+    Tagged<JSFunction> array_function = native_context->array_function();
+    map = array_function->initial_map();
   }
   return NewJSArrayWithUnverifiedElements(handle(map, isolate()), elements,
                                           length, allocation);
@@ -2813,9 +2845,9 @@ Handle<JSArray> Factory::NewJSArrayWithUnverifiedElements(
     AllocationType allocation) {
   auto array = Handle<JSArray>::cast(NewJSObjectFromMap(map, allocation));
   DisallowGarbageCollection no_gc;
-  JSArray raw = *array;
-  raw.set_elements(*elements);
-  raw.set_length(Smi::FromInt(length));
+  Tagged<JSArray> raw = *array;
+  raw->set_elements(*elements);
+  raw->set_length(Smi::FromInt(length));
   return array;
 }
 
@@ -2835,12 +2867,12 @@ Handle<JSArray> Factory::NewJSArrayForTemplateLiteralArray(
                  isolate()),
           cooked_strings, cooked_strings->length(), AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  TemplateLiteralObject raw_template_object = *template_object;
-  DCHECK_EQ(raw_template_object.map(),
+  Tagged<TemplateLiteralObject> raw_template_object = *template_object;
+  DCHECK_EQ(raw_template_object->map(),
             native_context->js_array_template_literal_object_map());
-  raw_template_object.set_raw(*raw_object);
-  raw_template_object.set_function_literal_id(function_literal_id);
-  raw_template_object.set_slot_id(slot_id);
+  raw_template_object->set_raw(*raw_object);
+  raw_template_object->set_function_literal_id(function_literal_id);
+  raw_template_object->set_slot_id(slot_id);
   return template_object;
 }
 
@@ -2849,10 +2881,10 @@ void Factory::NewJSArrayStorage(Handle<JSArray> array, int length, int capacity,
   DCHECK(capacity >= length);
 
   if (capacity == 0) {
-    JSArray raw = *array;
+    Tagged<JSArray> raw = *array;
     DisallowGarbageCollection no_gc;
-    raw.set_length(Smi::zero());
-    raw.set_elements(*empty_fixed_array());
+    raw->set_length(Smi::zero());
+    raw->set_elements(*empty_fixed_array());
     return;
   }
 
@@ -2860,9 +2892,9 @@ void Factory::NewJSArrayStorage(Handle<JSArray> array, int length, int capacity,
   Handle<FixedArrayBase> elms =
       NewJSArrayStorage(array->GetElementsKind(), capacity, mode);
   DisallowGarbageCollection no_gc;
-  JSArray raw = *array;
-  raw.set_elements(*elms);
-  raw.set_length(Smi::FromInt(length));
+  Tagged<JSArray> raw = *array;
+  raw->set_elements(*elms);
+  raw->set_length(Smi::FromInt(length));
 }
 
 Handle<FixedArrayBase> Factory::NewJSArrayStorage(
@@ -2870,18 +2902,22 @@ Handle<FixedArrayBase> Factory::NewJSArrayStorage(
   DCHECK_GT(capacity, 0);
   Handle<FixedArrayBase> elms;
   if (IsDoubleElementsKind(elements_kind)) {
-    if (mode == DONT_INITIALIZE_ARRAY_ELEMENTS) {
+    if (mode == ArrayStorageAllocationMode::DONT_INITIALIZE_ARRAY_ELEMENTS) {
       elms = NewFixedDoubleArray(capacity);
     } else {
-      DCHECK(mode == INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
+      DCHECK_EQ(
+          mode,
+          ArrayStorageAllocationMode::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
       elms = NewFixedDoubleArrayWithHoles(capacity);
     }
   } else {
     DCHECK(IsSmiOrObjectElementsKind(elements_kind));
-    if (mode == DONT_INITIALIZE_ARRAY_ELEMENTS) {
+    if (mode == ArrayStorageAllocationMode::DONT_INITIALIZE_ARRAY_ELEMENTS) {
       elms = NewFixedArray(capacity);
     } else {
-      DCHECK(mode == INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
+      DCHECK_EQ(
+          mode,
+          ArrayStorageAllocationMode::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
       elms = NewFixedArrayWithHoles(capacity);
     }
   }
@@ -2889,8 +2925,8 @@ Handle<FixedArrayBase> Factory::NewJSArrayStorage(
 }
 
 Handle<JSWeakMap> Factory::NewJSWeakMap() {
-  NativeContext native_context = isolate()->raw_native_context();
-  Handle<Map> map(native_context.js_weak_map_fun().initial_map(), isolate());
+  Tagged<NativeContext> native_context = isolate()->raw_native_context();
+  Handle<Map> map(native_context->js_weak_map_fun()->initial_map(), isolate());
   Handle<JSWeakMap> weakmap(JSWeakMap::cast(*NewJSObjectFromMap(map)),
                             isolate());
   {
@@ -2914,13 +2950,13 @@ Handle<JSModuleNamespace> Factory::NewJSModuleNamespace() {
 
 Handle<JSWrappedFunction> Factory::NewJSWrappedFunction(
     Handle<NativeContext> creation_context, Handle<Object> target) {
-  DCHECK(target->IsCallable());
+  DCHECK(IsCallable(*target));
   Handle<Map> map(
       Map::cast(creation_context->get(Context::WRAPPED_FUNCTION_MAP_INDEX)),
       isolate());
   // 2. Let wrapped be ! MakeBasicObject(internalSlotsList).
   // 3. Set wrapped.[[Prototype]] to
-  // callerRealm.[[Intrinsics]].[[%Function.prototype%]].
+  // callerRealm.[[Intrinsics]].[[%Function->prototype%]].
   // 4. Set wrapped.[[Call]] as described in 2.1.
   Handle<JSWrappedFunction> wrapped = Handle<JSWrappedFunction>::cast(
       isolate()->factory()->NewJSObjectFromMap(map));
@@ -2935,7 +2971,7 @@ Handle<JSWrappedFunction> Factory::NewJSWrappedFunction(
 
 Handle<JSGeneratorObject> Factory::NewJSGeneratorObject(
     Handle<JSFunction> function) {
-  DCHECK(IsResumableFunction(function->shared().kind()));
+  DCHECK(IsResumableFunction(function->shared()->kind()));
   JSFunction::EnsureHasInitialMap(function);
   Handle<Map> map(function->initial_map(), isolate());
 
@@ -2948,42 +2984,42 @@ Handle<JSGeneratorObject> Factory::NewJSGeneratorObject(
 Handle<SourceTextModule> Factory::NewSourceTextModule(
     Handle<SharedFunctionInfo> sfi) {
   Handle<SourceTextModuleInfo> module_info(
-      sfi->scope_info().ModuleDescriptorInfo(), isolate());
+      sfi->scope_info()->ModuleDescriptorInfo(), isolate());
   Handle<ObjectHashTable> exports =
       ObjectHashTable::New(isolate(), module_info->RegularExportCount());
   Handle<FixedArray> regular_exports =
       NewFixedArray(module_info->RegularExportCount());
   Handle<FixedArray> regular_imports =
-      NewFixedArray(module_info->regular_imports().length());
-  int requested_modules_length = module_info->module_requests().length();
+      NewFixedArray(module_info->regular_imports()->length());
+  int requested_modules_length = module_info->module_requests()->length();
   Handle<FixedArray> requested_modules =
       requested_modules_length > 0 ? NewFixedArray(requested_modules_length)
                                    : empty_fixed_array();
 
   ReadOnlyRoots roots(isolate());
-  SourceTextModule module = SourceTextModule::cast(
+  Tagged<SourceTextModule> module = Tagged<SourceTextModule>::cast(
       New(source_text_module_map(), AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  module.set_code(*sfi);
-  module.set_exports(*exports);
-  module.set_regular_exports(*regular_exports);
-  module.set_regular_imports(*regular_imports);
-  module.set_hash(isolate()->GenerateIdentityHash(Smi::kMaxValue));
-  module.set_module_namespace(roots.undefined_value(), SKIP_WRITE_BARRIER);
-  module.set_requested_modules(*requested_modules);
-  module.set_status(Module::kUnlinked);
-  module.set_exception(roots.the_hole_value(), SKIP_WRITE_BARRIER);
-  module.set_top_level_capability(roots.undefined_value(), SKIP_WRITE_BARRIER);
-  module.set_import_meta(roots.the_hole_value(), kReleaseStore,
-                         SKIP_WRITE_BARRIER);
-  module.set_dfs_index(-1);
-  module.set_dfs_ancestor_index(-1);
-  module.set_flags(0);
-  module.set_async(IsAsyncModule(sfi->kind()));
-  module.set_async_evaluating_ordinal(SourceTextModule::kNotAsyncEvaluated);
-  module.set_cycle_root(roots.the_hole_value(), SKIP_WRITE_BARRIER);
-  module.set_async_parent_modules(roots.empty_array_list());
-  module.set_pending_async_dependencies(0);
+  module->set_code(*sfi);
+  module->set_exports(*exports);
+  module->set_regular_exports(*regular_exports);
+  module->set_regular_imports(*regular_imports);
+  module->set_hash(isolate()->GenerateIdentityHash(Smi::kMaxValue));
+  module->set_module_namespace(roots.undefined_value(), SKIP_WRITE_BARRIER);
+  module->set_requested_modules(*requested_modules);
+  module->set_status(Module::kUnlinked);
+  module->set_exception(roots.the_hole_value(), SKIP_WRITE_BARRIER);
+  module->set_top_level_capability(roots.undefined_value(), SKIP_WRITE_BARRIER);
+  module->set_import_meta(roots.the_hole_value(), kReleaseStore,
+                          SKIP_WRITE_BARRIER);
+  module->set_dfs_index(-1);
+  module->set_dfs_ancestor_index(-1);
+  module->set_flags(0);
+  module->set_async(IsAsyncModule(sfi->kind()));
+  module->set_async_evaluating_ordinal(SourceTextModule::kNotAsyncEvaluated);
+  module->set_cycle_root(roots.the_hole_value(), SKIP_WRITE_BARRIER);
+  module->set_async_parent_modules(roots.empty_array_list());
+  module->set_pending_async_dependencies(0);
   return handle(module, isolate());
 }
 
@@ -2997,25 +3033,26 @@ Handle<SyntheticModule> Factory::NewSyntheticModule(
   Handle<Foreign> evaluation_steps_foreign =
       NewForeign(reinterpret_cast<i::Address>(evaluation_steps));
 
-  SyntheticModule module =
-      SyntheticModule::cast(New(synthetic_module_map(), AllocationType::kOld));
+  Tagged<SyntheticModule> module = Tagged<SyntheticModule>::cast(
+      New(synthetic_module_map(), AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  module.set_hash(isolate()->GenerateIdentityHash(Smi::kMaxValue));
-  module.set_module_namespace(roots.undefined_value(), SKIP_WRITE_BARRIER);
-  module.set_status(Module::kUnlinked);
-  module.set_exception(roots.the_hole_value(), SKIP_WRITE_BARRIER);
-  module.set_top_level_capability(roots.undefined_value(), SKIP_WRITE_BARRIER);
-  module.set_name(*module_name);
-  module.set_export_names(*export_names);
-  module.set_exports(*exports);
-  module.set_evaluation_steps(*evaluation_steps_foreign);
+  module->set_hash(isolate()->GenerateIdentityHash(Smi::kMaxValue));
+  module->set_module_namespace(roots.undefined_value(), SKIP_WRITE_BARRIER);
+  module->set_status(Module::kUnlinked);
+  module->set_exception(roots.the_hole_value(), SKIP_WRITE_BARRIER);
+  module->set_top_level_capability(roots.undefined_value(), SKIP_WRITE_BARRIER);
+  module->set_name(*module_name);
+  module->set_export_names(*export_names);
+  module->set_exports(*exports);
+  module->set_evaluation_steps(*evaluation_steps_foreign);
   return handle(module, isolate());
 }
 
 Handle<JSArrayBuffer> Factory::NewJSArrayBuffer(
     std::shared_ptr<BackingStore> backing_store, AllocationType allocation) {
-  Handle<Map> map(isolate()->native_context()->array_buffer_fun().initial_map(),
-                  isolate());
+  Handle<Map> map(
+      isolate()->native_context()->array_buffer_fun()->initial_map(),
+      isolate());
   ResizableFlag resizable_by_js = ResizableFlag::kNotResizable;
   if (v8_flags.harmony_rab_gsab && backing_store->is_resizable_by_js()) {
     resizable_by_js = ResizableFlag::kResizable;
@@ -3061,8 +3098,9 @@ MaybeHandle<JSArrayBuffer> Factory::NewJSArrayBufferAndBackingStore(
       if (!backing_store) return MaybeHandle<JSArrayBuffer>();
     }
   }
-  Handle<Map> map(isolate()->native_context()->array_buffer_fun().initial_map(),
-                  isolate());
+  Handle<Map> map(
+      isolate()->native_context()->array_buffer_fun()->initial_map(),
+      isolate());
   auto array_buffer =
       Handle<JSArrayBuffer>::cast(NewJSObjectFromMap(map, allocation));
   array_buffer->Setup(SharedFlag::kNotShared, resizable,
@@ -3075,7 +3113,7 @@ Handle<JSArrayBuffer> Factory::NewJSSharedArrayBuffer(
   DCHECK_IMPLIES(backing_store->is_resizable_by_js(),
                  v8_flags.harmony_rab_gsab);
   Handle<Map> map(
-      isolate()->native_context()->shared_array_buffer_fun().initial_map(),
+      isolate()->native_context()->shared_array_buffer_fun()->initial_map(),
       isolate());
   auto result = Handle<JSArrayBuffer>::cast(
       NewJSObjectFromMap(map, AllocationType::kYoung));
@@ -3094,9 +3132,9 @@ Handle<JSIteratorResult> Factory::NewJSIteratorResult(Handle<Object> value,
   Handle<JSIteratorResult> js_iter_result = Handle<JSIteratorResult>::cast(
       NewJSObjectFromMap(map, AllocationType::kYoung));
   DisallowGarbageCollection no_gc;
-  JSIteratorResult raw = *js_iter_result;
-  raw.set_value(*value, SKIP_WRITE_BARRIER);
-  raw.set_done(*ToBoolean(done), SKIP_WRITE_BARRIER);
+  Tagged<JSIteratorResult> raw = *js_iter_result;
+  raw->set_value(*value, SKIP_WRITE_BARRIER);
+  raw->set_done(*ToBoolean(done), SKIP_WRITE_BARRIER);
   return js_iter_result;
 }
 
@@ -3108,9 +3146,9 @@ Handle<JSAsyncFromSyncIterator> Factory::NewJSAsyncFromSyncIterator(
       Handle<JSAsyncFromSyncIterator>::cast(
           NewJSObjectFromMap(map, AllocationType::kYoung));
   DisallowGarbageCollection no_gc;
-  JSAsyncFromSyncIterator raw = *iterator;
-  raw.set_sync_iterator(*sync_iterator, SKIP_WRITE_BARRIER);
-  raw.set_next(*next, SKIP_WRITE_BARRIER);
+  Tagged<JSAsyncFromSyncIterator> raw = *iterator;
+  raw->set_sync_iterator(*sync_iterator, SKIP_WRITE_BARRIER);
+  raw->set_next(*next, SKIP_WRITE_BARRIER);
   return iterator;
 }
 
@@ -3158,15 +3196,15 @@ Handle<JSArrayBufferView> Factory::NewJSArrayBufferView(
   Handle<JSArrayBufferView> array_buffer_view = Handle<JSArrayBufferView>::cast(
       NewJSObjectFromMap(map, AllocationType::kYoung));
   DisallowGarbageCollection no_gc;
-  JSArrayBufferView raw = *array_buffer_view;
-  raw.set_elements(*elements, SKIP_WRITE_BARRIER);
-  raw.set_buffer(*buffer, SKIP_WRITE_BARRIER);
-  raw.set_byte_offset(byte_offset);
-  raw.set_byte_length(byte_length);
-  raw.set_bit_field(0);
+  Tagged<JSArrayBufferView> raw = *array_buffer_view;
+  raw->set_elements(*elements, SKIP_WRITE_BARRIER);
+  raw->set_buffer(*buffer, SKIP_WRITE_BARRIER);
+  raw->set_byte_offset(byte_offset);
+  raw->set_byte_length(byte_length);
+  raw->set_bit_field(0);
   // TODO(v8) remove once embedder data slots are always zero-initialized.
   InitEmbedderFields(raw, Smi::zero());
-  DCHECK_EQ(raw.GetEmbedderFieldCount(),
+  DCHECK_EQ(raw->GetEmbedderFieldCount(),
             v8::ArrayBufferView::kEmbedderFieldCount);
   return array_buffer_view;
 }
@@ -3186,12 +3224,12 @@ Handle<JSTypedArray> Factory::NewJSTypedArray(ExternalArrayType type,
   Handle<Map> map;
   if (is_backed_by_rab || is_length_tracking) {
     map = handle(
-        isolate()->raw_native_context().TypedArrayElementsKindToRabGsabCtorMap(
+        isolate()->raw_native_context()->TypedArrayElementsKindToRabGsabCtorMap(
             elements_kind),
         isolate());
   } else {
     map =
-        handle(isolate()->raw_native_context().TypedArrayElementsKindToCtorMap(
+        handle(isolate()->raw_native_context()->TypedArrayElementsKindToCtorMap(
                    elements_kind),
                isolate());
   }
@@ -3211,12 +3249,12 @@ Handle<JSTypedArray> Factory::NewJSTypedArray(ExternalArrayType type,
   Handle<JSTypedArray> typed_array =
       Handle<JSTypedArray>::cast(NewJSArrayBufferView(
           map, empty_byte_array(), buffer, byte_offset, byte_length));
-  JSTypedArray raw = *typed_array;
+  Tagged<JSTypedArray> raw = *typed_array;
   DisallowGarbageCollection no_gc;
-  raw.set_length(length);
-  raw.SetOffHeapDataPtr(isolate(), buffer->backing_store(), byte_offset);
-  raw.set_is_length_tracking(is_length_tracking);
-  raw.set_is_backed_by_rab(is_backed_by_rab);
+  raw->set_length(length);
+  raw->SetOffHeapDataPtr(isolate(), buffer->backing_store(), byte_offset);
+  raw->set_is_length_tracking(is_length_tracking);
+  raw->set_is_backed_by_rab(is_backed_by_rab);
   return typed_array;
 }
 
@@ -3235,7 +3273,7 @@ Handle<JSDataViewOrRabGsabDataView> Factory::NewJSDataViewOrRabGsabDataView(
     map = handle(isolate()->native_context()->js_rab_gsab_data_view_map(),
                  isolate());
   } else {
-    map = handle(isolate()->native_context()->data_view_fun().initial_map(),
+    map = handle(isolate()->native_context()->data_view_fun()->initial_map(),
                  isolate());
   }
   Handle<JSDataViewOrRabGsabDataView> obj =
@@ -3251,9 +3289,9 @@ Handle<JSDataViewOrRabGsabDataView> Factory::NewJSDataViewOrRabGsabDataView(
 MaybeHandle<JSBoundFunction> Factory::NewJSBoundFunction(
     Handle<JSReceiver> target_function, Handle<Object> bound_this,
     base::Vector<Handle<Object>> bound_args) {
-  DCHECK(target_function->IsCallable());
-  static_assert(InstructionStream::kMaxArguments <= FixedArray::kMaxLength);
-  if (bound_args.length() >= InstructionStream::kMaxArguments) {
+  DCHECK(IsCallable(*target_function));
+  static_assert(Code::kMaxArguments <= FixedArray::kMaxLength);
+  if (bound_args.length() >= Code::kMaxArguments) {
     THROW_NEW_ERROR(isolate(),
                     NewRangeError(MessageTemplate::kTooManyArguments),
                     JSBoundFunction);
@@ -3280,22 +3318,22 @@ MaybeHandle<JSBoundFunction> Factory::NewJSBoundFunction(
   }
 
   // Setup the map for the JSBoundFunction instance.
-  Handle<Map> map = target_function->IsConstructor()
+  Handle<Map> map = IsConstructor(*target_function)
                         ? isolate()->bound_function_with_constructor_map()
                         : isolate()->bound_function_without_constructor_map();
   if (map->prototype() != *prototype) {
     map = Map::TransitionToPrototype(isolate(), map, prototype);
   }
-  DCHECK_EQ(target_function->IsConstructor(), map->is_constructor());
+  DCHECK_EQ(IsConstructor(*target_function), map->is_constructor());
 
   // Setup the JSBoundFunction instance.
   Handle<JSBoundFunction> result = Handle<JSBoundFunction>::cast(
       NewJSObjectFromMap(map, AllocationType::kYoung));
   DisallowGarbageCollection no_gc;
-  JSBoundFunction raw = *result;
-  raw.set_bound_target_function(*target_function, SKIP_WRITE_BARRIER);
-  raw.set_bound_this(*bound_this, SKIP_WRITE_BARRIER);
-  raw.set_bound_arguments(*bound_arguments, SKIP_WRITE_BARRIER);
+  Tagged<JSBoundFunction> raw = *result;
+  raw->set_bound_target_function(*target_function, SKIP_WRITE_BARRIER);
+  raw->set_bound_this(*bound_this, SKIP_WRITE_BARRIER);
+  raw->set_bound_arguments(*bound_arguments, SKIP_WRITE_BARRIER);
   return result;
 }
 
@@ -3303,17 +3341,18 @@ MaybeHandle<JSBoundFunction> Factory::NewJSBoundFunction(
 Handle<JSProxy> Factory::NewJSProxy(Handle<JSReceiver> target,
                                     Handle<JSReceiver> handler) {
   // Allocate the proxy object.
-  Handle<Map> map = target->IsCallable()
-                        ? target->IsConstructor()
+  Handle<Map> map = IsCallable(*target)
+                        ? IsConstructor(*target)
                               ? isolate()->proxy_constructor_map()
                               : isolate()->proxy_callable_map()
                         : isolate()->proxy_map();
-  DCHECK(map->prototype().IsNull(isolate()));
-  JSProxy result = JSProxy::cast(New(map, AllocationType::kYoung));
+  DCHECK(IsNull(map->prototype(), isolate()));
+  Tagged<JSProxy> result =
+      Tagged<JSProxy>::cast(New(map, AllocationType::kYoung));
   DisallowGarbageCollection no_gc;
-  result.initialize_properties(isolate());
-  result.set_target(*target, SKIP_WRITE_BARRIER);
-  result.set_handler(*handler, SKIP_WRITE_BARRIER);
+  result->initialize_properties(isolate());
+  result->set_target(*target, SKIP_WRITE_BARRIER);
+  result->set_handler(*handler, SKIP_WRITE_BARRIER);
   return handle(result, isolate());
 }
 
@@ -3324,9 +3363,9 @@ Handle<JSGlobalProxy> Factory::NewUninitializedJSGlobalProxy(int size) {
   // Maintain invariant expected from any JSGlobalProxy.
   {
     DisallowGarbageCollection no_gc;
-    Map raw = *map;
-    raw.set_is_access_check_needed(true);
-    raw.set_may_have_interesting_symbols(true);
+    Tagged<Map> raw = *map;
+    raw->set_is_access_check_needed(true);
+    raw->set_may_have_interesting_properties(true);
     LOG(isolate(), MapDetails(raw));
   }
   Handle<JSGlobalProxy> proxy = Handle<JSGlobalProxy>::cast(
@@ -3364,8 +3403,8 @@ void Factory::ReinitializeJSGlobalProxy(Handle<JSGlobalProxy> object,
   DisallowGarbageCollection no_gc;
 
   // Reset the map for the object.
-  JSGlobalProxy raw = *object;
-  raw.set_map(*map, kReleaseStore);
+  Tagged<JSGlobalProxy> raw = *object;
+  raw->set_map(*map, kReleaseStore);
 
   // Reinitialize the object from the constructor map.
   InitializeJSObjectFromMap(raw, *raw_properties_or_hash, *map);
@@ -3376,37 +3415,37 @@ Handle<JSMessageObject> Factory::NewJSMessageObject(
     int end_position, Handle<SharedFunctionInfo> shared_info,
     int bytecode_offset, Handle<Script> script, Handle<Object> stack_frames) {
   Handle<Map> map = message_object_map();
-  JSMessageObject message_obj =
-      JSMessageObject::cast(New(map, AllocationType::kYoung));
+  Tagged<JSMessageObject> message_obj =
+      Tagged<JSMessageObject>::cast(New(map, AllocationType::kYoung));
   DisallowGarbageCollection no_gc;
-  message_obj.set_raw_properties_or_hash(*empty_fixed_array(),
-                                         SKIP_WRITE_BARRIER);
-  message_obj.initialize_elements();
-  message_obj.set_elements(*empty_fixed_array(), SKIP_WRITE_BARRIER);
-  message_obj.set_type(message);
-  message_obj.set_argument(*argument, SKIP_WRITE_BARRIER);
-  message_obj.set_start_position(start_position);
-  message_obj.set_end_position(end_position);
-  message_obj.set_script(*script, SKIP_WRITE_BARRIER);
+  message_obj->set_raw_properties_or_hash(*empty_fixed_array(),
+                                          SKIP_WRITE_BARRIER);
+  message_obj->initialize_elements();
+  message_obj->set_elements(*empty_fixed_array(), SKIP_WRITE_BARRIER);
+  message_obj->set_type(message);
+  message_obj->set_argument(*argument, SKIP_WRITE_BARRIER);
+  message_obj->set_start_position(start_position);
+  message_obj->set_end_position(end_position);
+  message_obj->set_script(*script, SKIP_WRITE_BARRIER);
   if (start_position >= 0) {
     // If there's a start_position, then there's no need to store the
     // SharedFunctionInfo as it will never be necessary to regenerate the
     // position.
-    message_obj.set_shared_info(*undefined_value(), SKIP_WRITE_BARRIER);
-    message_obj.set_bytecode_offset(Smi::FromInt(0));
+    message_obj->set_shared_info(Smi::FromInt(-1));
+    message_obj->set_bytecode_offset(Smi::FromInt(0));
   } else {
-    message_obj.set_bytecode_offset(Smi::FromInt(bytecode_offset));
+    message_obj->set_bytecode_offset(Smi::FromInt(bytecode_offset));
     if (shared_info.is_null()) {
-      message_obj.set_shared_info(*undefined_value(), SKIP_WRITE_BARRIER);
+      message_obj->set_shared_info(Smi::FromInt(-1));
       DCHECK_EQ(bytecode_offset, -1);
     } else {
-      message_obj.set_shared_info(*shared_info, SKIP_WRITE_BARRIER);
+      message_obj->set_shared_info(*shared_info, SKIP_WRITE_BARRIER);
       DCHECK_GE(bytecode_offset, kFunctionEntryBytecodeOffset);
     }
   }
 
-  message_obj.set_stack_frames(*stack_frames, SKIP_WRITE_BARRIER);
-  message_obj.set_error_level(v8::Isolate::kMessageError);
+  message_obj->set_stack_frames(*stack_frames, SKIP_WRITE_BARRIER);
+  message_obj->set_error_level(v8::Isolate::kMessageError);
   return handle(message_obj, isolate());
 }
 
@@ -3423,7 +3462,7 @@ Handle<SharedFunctionInfo> Factory::NewSharedFunctionInfoForBuiltin(
                                kind);
 }
 
-int Factory::NumberToStringCacheHash(Smi number) {
+int Factory::NumberToStringCacheHash(Tagged<Smi> number) {
   int mask = (number_string_cache()->length() >> 1) - 1;
   return number.value() & mask;
 }
@@ -3463,38 +3502,34 @@ Handle<String> Factory::SizeToString(size_t value, bool check_cache) {
   }
   {
     DisallowGarbageCollection no_gc;
-    String raw = *result;
+    Tagged<String> raw = *result;
     if (value <= JSArray::kMaxArrayIndex &&
-        raw.raw_hash_field() == String::kEmptyHashField) {
+        raw->raw_hash_field() == String::kEmptyHashField) {
       uint32_t raw_hash_field = StringHasher::MakeArrayIndexHash(
-          static_cast<uint32_t>(value), raw.length());
-      raw.set_raw_hash_field(raw_hash_field);
+          static_cast<uint32_t>(value), raw->length());
+      raw->set_raw_hash_field(raw_hash_field);
     }
   }
   return result;
 }
 
 Handle<DebugInfo> Factory::NewDebugInfo(Handle<SharedFunctionInfo> shared) {
-  DCHECK(!shared->HasDebugInfo());
+  DCHECK(!shared->HasDebugInfo(isolate()));
 
   auto debug_info =
       NewStructInternal<DebugInfo>(DEBUG_INFO_TYPE, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  SharedFunctionInfo raw_shared = *shared;
-  debug_info.set_flags(DebugInfo::kNone, kRelaxedStore);
-  debug_info.set_shared(raw_shared);
-  debug_info.set_debugger_hints(0);
-  DCHECK_EQ(DebugInfo::kNoDebuggingId, debug_info.debugging_id());
-  debug_info.set_script(raw_shared.script_or_debug_info(kAcquireLoad));
-  HeapObject undefined = *undefined_value();
-  debug_info.set_original_bytecode_array(undefined, kReleaseStore,
-                                         SKIP_WRITE_BARRIER);
-  debug_info.set_debug_bytecode_array(undefined, kReleaseStore,
-                                      SKIP_WRITE_BARRIER);
-  debug_info.set_break_points(*empty_fixed_array(), SKIP_WRITE_BARRIER);
-
-  // Link debug info to function.
-  raw_shared.SetDebugInfo(debug_info);
+  Tagged<SharedFunctionInfo> raw_shared = *shared;
+  debug_info->set_flags(DebugInfo::kNone, kRelaxedStore);
+  debug_info->set_shared(raw_shared);
+  debug_info->set_debugger_hints(0);
+  DCHECK_EQ(DebugInfo::kNoDebuggingId, debug_info->debugging_id());
+  Tagged<HeapObject> undefined = *undefined_value();
+  debug_info->set_original_bytecode_array(undefined, kReleaseStore,
+                                          SKIP_WRITE_BARRIER);
+  debug_info->set_debug_bytecode_array(undefined, kReleaseStore,
+                                       SKIP_WRITE_BARRIER);
+  debug_info->set_break_points(*empty_fixed_array(), SKIP_WRITE_BARRIER);
 
   return handle(debug_info, isolate());
 }
@@ -3503,8 +3538,9 @@ Handle<BreakPointInfo> Factory::NewBreakPointInfo(int source_position) {
   auto new_break_point_info = NewStructInternal<BreakPointInfo>(
       BREAK_POINT_INFO_TYPE, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  new_break_point_info.set_source_position(source_position);
-  new_break_point_info.set_break_points(*undefined_value(), SKIP_WRITE_BARRIER);
+  new_break_point_info->set_source_position(source_position);
+  new_break_point_info->set_break_points(*undefined_value(),
+                                         SKIP_WRITE_BARRIER);
   return handle(new_break_point_info, isolate());
 }
 
@@ -3512,8 +3548,8 @@ Handle<BreakPoint> Factory::NewBreakPoint(int id, Handle<String> condition) {
   auto new_break_point =
       NewStructInternal<BreakPoint>(BREAK_POINT_TYPE, AllocationType::kOld);
   DisallowGarbageCollection no_gc;
-  new_break_point.set_id(id);
-  new_break_point.set_condition(*condition);
+  new_break_point->set_id(id);
+  new_break_point->set_condition(*condition);
   return handle(new_break_point, isolate());
 }
 
@@ -3524,12 +3560,12 @@ Handle<CallSiteInfo> Factory::NewCallSiteInfo(
   auto info = NewStructInternal<CallSiteInfo>(CALL_SITE_INFO_TYPE,
                                               AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  info.set_receiver_or_instance(*receiver_or_instance, SKIP_WRITE_BARRIER);
-  info.set_function(*function, SKIP_WRITE_BARRIER);
-  info.set_code_object(*code_object, SKIP_WRITE_BARRIER);
-  info.set_code_offset_or_source_position(code_offset_or_source_position);
-  info.set_flags(flags);
-  info.set_parameters(*parameters, SKIP_WRITE_BARRIER);
+  info->set_receiver_or_instance(*receiver_or_instance, SKIP_WRITE_BARRIER);
+  info->set_function(*function, SKIP_WRITE_BARRIER);
+  info->set_code_object(*code_object, SKIP_WRITE_BARRIER);
+  info->set_code_offset_or_source_position(code_offset_or_source_position);
+  info->set_flags(flags);
+  info->set_parameters(*parameters, SKIP_WRITE_BARRIER);
   return handle(info, isolate());
 }
 
@@ -3537,32 +3573,32 @@ Handle<StackFrameInfo> Factory::NewStackFrameInfo(
     Handle<HeapObject> shared_or_script, int bytecode_offset_or_source_position,
     Handle<String> function_name, bool is_constructor) {
   DCHECK_GE(bytecode_offset_or_source_position, 0);
-  StackFrameInfo info = NewStructInternal<StackFrameInfo>(
+  Tagged<StackFrameInfo> info = NewStructInternal<StackFrameInfo>(
       STACK_FRAME_INFO_TYPE, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  info.set_flags(0);
-  info.set_shared_or_script(*shared_or_script, SKIP_WRITE_BARRIER);
-  info.set_bytecode_offset_or_source_position(
+  info->set_flags(0);
+  info->set_shared_or_script(*shared_or_script, SKIP_WRITE_BARRIER);
+  info->set_bytecode_offset_or_source_position(
       bytecode_offset_or_source_position);
-  info.set_function_name(*function_name, SKIP_WRITE_BARRIER);
-  info.set_is_constructor(is_constructor);
+  info->set_function_name(*function_name, SKIP_WRITE_BARRIER);
+  info->set_is_constructor(is_constructor);
   return handle(info, isolate());
 }
 
 Handle<PromiseOnStack> Factory::NewPromiseOnStack(Handle<Object> prev,
                                                   Handle<JSObject> promise) {
-  PromiseOnStack promise_on_stack = NewStructInternal<PromiseOnStack>(
+  Tagged<PromiseOnStack> promise_on_stack = NewStructInternal<PromiseOnStack>(
       PROMISE_ON_STACK_TYPE, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  promise_on_stack.set_prev(*prev, SKIP_WRITE_BARRIER);
-  promise_on_stack.set_promise(*MaybeObjectHandle::Weak(promise));
+  promise_on_stack->set_prev(*prev, SKIP_WRITE_BARRIER);
+  promise_on_stack->set_promise(*MaybeObjectHandle::Weak(promise));
   return handle(promise_on_stack, isolate());
 }
 
 Handle<JSObject> Factory::NewArgumentsObject(Handle<JSFunction> callee,
                                              int length) {
-  bool strict_mode_callee = is_strict(callee->shared().language_mode()) ||
-                            !callee->shared().has_simple_parameters();
+  bool strict_mode_callee = is_strict(callee->shared()->language_mode()) ||
+                            !callee->shared()->has_simple_parameters();
   Handle<Map> map = strict_mode_callee ? isolate()->strict_arguments_map()
                                        : isolate()->sloppy_arguments_map();
   AllocationSiteUsageContext context(isolate(), Handle<AllocationSite>(),
@@ -3595,10 +3631,10 @@ Handle<Map> Factory::ObjectLiteralMapFromCache(Handle<NativeContext> context,
 
   // Check to see whether there is a matching element in the cache.
   MaybeObject result = cache->Get(number_of_properties);
-  HeapObject heap_object;
-  if (result->GetHeapObjectIfWeak(&heap_object)) {
-    Map map = Map::cast(heap_object);
-    DCHECK(!map.is_dictionary_map());
+  Tagged<HeapObject> heap_object;
+  if (result.GetHeapObjectIfWeak(&heap_object)) {
+    Tagged<Map> map = Tagged<Map>::cast(heap_object);
+    DCHECK(!map->is_dictionary_map());
     return handle(map, isolate());
   }
 
@@ -3612,10 +3648,11 @@ Handle<Map> Factory::ObjectLiteralMapFromCache(Handle<NativeContext> context,
 Handle<MegaDomHandler> Factory::NewMegaDomHandler(MaybeObjectHandle accessor,
                                                   MaybeObjectHandle context) {
   Handle<Map> map = read_only_roots().mega_dom_handler_map_handle();
-  MegaDomHandler handler = MegaDomHandler::cast(New(map, AllocationType::kOld));
+  Tagged<MegaDomHandler> handler =
+      Tagged<MegaDomHandler>::cast(New(map, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  handler.set_accessor(*accessor, kReleaseStore);
-  handler.set_context(*context);
+  handler->set_accessor(*accessor, kReleaseStore);
+  handler->set_context(*context);
   return handle(handler, isolate());
 }
 
@@ -3661,13 +3698,13 @@ Handle<StoreHandler> Factory::NewStoreHandler(int data_count) {
 
 void Factory::SetRegExpAtomData(Handle<JSRegExp> regexp, Handle<String> source,
                                 JSRegExp::Flags flags, Handle<Object> data) {
-  FixedArray store =
+  Tagged<FixedArray> store =
       *NewFixedArray(JSRegExp::kAtomDataSize, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  store.set(JSRegExp::kTagIndex, Smi::FromInt(JSRegExp::ATOM));
-  store.set(JSRegExp::kSourceIndex, *source, SKIP_WRITE_BARRIER);
-  store.set(JSRegExp::kFlagsIndex, Smi::FromInt(flags));
-  store.set(JSRegExp::kAtomPatternIndex, *data, SKIP_WRITE_BARRIER);
+  store->set(JSRegExp::kTagIndex, Smi::FromInt(JSRegExp::ATOM));
+  store->set(JSRegExp::kSourceIndex, *source, SKIP_WRITE_BARRIER);
+  store->set(JSRegExp::kFlagsIndex, Smi::FromInt(flags));
+  store->set(JSRegExp::kAtomPatternIndex, *data, SKIP_WRITE_BARRIER);
   regexp->set_data(store);
 }
 
@@ -3676,25 +3713,25 @@ void Factory::SetRegExpIrregexpData(Handle<JSRegExp> regexp,
                                     JSRegExp::Flags flags, int capture_count,
                                     uint32_t backtrack_limit) {
   DCHECK(Smi::IsValid(backtrack_limit));
-  FixedArray store =
+  Tagged<FixedArray> store =
       *NewFixedArray(JSRegExp::kIrregexpDataSize, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  Smi uninitialized = Smi::FromInt(JSRegExp::kUninitializedValue);
-  Smi ticks_until_tier_up = v8_flags.regexp_tier_up
-                                ? Smi::FromInt(v8_flags.regexp_tier_up_ticks)
-                                : uninitialized;
-  store.set(JSRegExp::kTagIndex, Smi::FromInt(JSRegExp::IRREGEXP));
-  store.set(JSRegExp::kSourceIndex, *source, SKIP_WRITE_BARRIER);
-  store.set(JSRegExp::kFlagsIndex, Smi::FromInt(flags));
-  store.set(JSRegExp::kIrregexpLatin1CodeIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpUC16CodeIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpLatin1BytecodeIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpUC16BytecodeIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpMaxRegisterCountIndex, Smi::zero());
-  store.set(JSRegExp::kIrregexpCaptureCountIndex, Smi::FromInt(capture_count));
-  store.set(JSRegExp::kIrregexpCaptureNameMapIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpTicksUntilTierUpIndex, ticks_until_tier_up);
-  store.set(JSRegExp::kIrregexpBacktrackLimit, Smi::FromInt(backtrack_limit));
+  Tagged<Smi> uninitialized = Smi::FromInt(JSRegExp::kUninitializedValue);
+  Tagged<Smi> ticks_until_tier_up =
+      v8_flags.regexp_tier_up ? Smi::FromInt(v8_flags.regexp_tier_up_ticks)
+                              : uninitialized;
+  store->set(JSRegExp::kTagIndex, Smi::FromInt(JSRegExp::IRREGEXP));
+  store->set(JSRegExp::kSourceIndex, *source, SKIP_WRITE_BARRIER);
+  store->set(JSRegExp::kFlagsIndex, Smi::FromInt(flags));
+  store->set(JSRegExp::kIrregexpLatin1CodeIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpUC16CodeIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpLatin1BytecodeIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpUC16BytecodeIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpMaxRegisterCountIndex, Smi::zero());
+  store->set(JSRegExp::kIrregexpCaptureCountIndex, Smi::FromInt(capture_count));
+  store->set(JSRegExp::kIrregexpCaptureNameMapIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpTicksUntilTierUpIndex, ticks_until_tier_up);
+  store->set(JSRegExp::kIrregexpBacktrackLimit, Smi::FromInt(backtrack_limit));
   regexp->set_data(store);
 }
 
@@ -3702,23 +3739,23 @@ void Factory::SetRegExpExperimentalData(Handle<JSRegExp> regexp,
                                         Handle<String> source,
                                         JSRegExp::Flags flags,
                                         int capture_count) {
-  FixedArray store =
+  Tagged<FixedArray> store =
       *NewFixedArray(JSRegExp::kExperimentalDataSize, AllocationType::kYoung);
   DisallowGarbageCollection no_gc;
-  Smi uninitialized = Smi::FromInt(JSRegExp::kUninitializedValue);
-
-  store.set(JSRegExp::kTagIndex, Smi::FromInt(JSRegExp::EXPERIMENTAL));
-  store.set(JSRegExp::kSourceIndex, *source, SKIP_WRITE_BARRIER);
-  store.set(JSRegExp::kFlagsIndex, Smi::FromInt(flags));
-  store.set(JSRegExp::kIrregexpLatin1CodeIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpUC16CodeIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpLatin1BytecodeIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpUC16BytecodeIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpMaxRegisterCountIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpCaptureCountIndex, Smi::FromInt(capture_count));
-  store.set(JSRegExp::kIrregexpCaptureNameMapIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpTicksUntilTierUpIndex, uninitialized);
-  store.set(JSRegExp::kIrregexpBacktrackLimit, uninitialized);
+  Tagged<Smi> uninitialized = Smi::FromInt(JSRegExp::kUninitializedValue);
+
+  store->set(JSRegExp::kTagIndex, Smi::FromInt(JSRegExp::EXPERIMENTAL));
+  store->set(JSRegExp::kSourceIndex, *source, SKIP_WRITE_BARRIER);
+  store->set(JSRegExp::kFlagsIndex, Smi::FromInt(flags));
+  store->set(JSRegExp::kIrregexpLatin1CodeIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpUC16CodeIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpLatin1BytecodeIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpUC16BytecodeIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpMaxRegisterCountIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpCaptureCountIndex, Smi::FromInt(capture_count));
+  store->set(JSRegExp::kIrregexpCaptureNameMapIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpTicksUntilTierUpIndex, uninitialized);
+  store->set(JSRegExp::kIrregexpBacktrackLimit, uninitialized);
   regexp->set_data(store);
 }
 
@@ -3733,12 +3770,12 @@ Handle<RegExpMatchInfo> Factory::NewRegExpMatchInfo() {
   Handle<RegExpMatchInfo> result = Handle<RegExpMatchInfo>::cast(elems);
   {
     DisallowGarbageCollection no_gc;
-    RegExpMatchInfo raw = *result;
-    raw.SetNumberOfCaptureRegisters(RegExpMatchInfo::kInitialCaptureIndices);
-    raw.SetLastSubject(*empty_string(), SKIP_WRITE_BARRIER);
-    raw.SetLastInput(*undefined_value(), SKIP_WRITE_BARRIER);
-    raw.SetCapture(0, 0);
-    raw.SetCapture(1, 0);
+    Tagged<RegExpMatchInfo> raw = *result;
+    raw->SetNumberOfCaptureRegisters(RegExpMatchInfo::kInitialCaptureIndices);
+    raw->SetLastSubject(*empty_string(), SKIP_WRITE_BARRIER);
+    raw->SetLastInput(*undefined_value(), SKIP_WRITE_BARRIER);
+    raw->SetCapture(0, 0);
+    raw->SetCapture(1, 0);
   }
   return result;
 }
@@ -3778,14 +3815,21 @@ Handle<Map> Factory::CreateSloppyFunctionMap(
       TERMINAL_FAST_ELEMENTS_KIND, inobject_properties_count);
   {
     DisallowGarbageCollection no_gc;
-    Map raw_map = *map;
-    raw_map.set_has_prototype_slot(has_prototype);
-    raw_map.set_is_constructor(has_prototype);
-    raw_map.set_is_callable(true);
+    Tagged<Map> raw_map = *map;
+    raw_map->set_has_prototype_slot(has_prototype);
+    raw_map->set_is_constructor(has_prototype);
+    raw_map->set_is_callable(true);
   }
   Handle<JSFunction> empty_function;
   if (maybe_empty_function.ToHandle(&empty_function)) {
+    // Temporarily set constructor to empty function to calm down map verifier.
+    map->SetConstructor(*empty_function);
     Map::SetPrototype(isolate(), map, empty_function);
+  } else {
+    // |maybe_empty_function| is allowed to be empty only during empty function
+    // creation.
+    DCHECK(IsUndefined(
+        isolate()->raw_native_context()->get(Context::EMPTY_FUNCTION_INDEX)));
   }
 
   //
@@ -3844,8 +3888,8 @@ Handle<Map> Factory::CreateSloppyFunctionMap(
     map->AppendDescriptor(isolate(), &d);
   }
   DCHECK_EQ(inobject_properties_count, field_index);
-  DCHECK_EQ(0,
-            map->instance_descriptors(isolate()).number_of_slack_descriptors());
+  DCHECK_EQ(
+      0, map->instance_descriptors(isolate())->number_of_slack_descriptors());
   LOG(isolate(), MapDetails(*map));
   return map;
 }
@@ -3870,10 +3914,12 @@ Handle<Map> Factory::CreateStrictFunctionMap(
       TERMINAL_FAST_ELEMENTS_KIND, inobject_properties_count);
   {
     DisallowGarbageCollection no_gc;
-    Map raw_map = *map;
-    raw_map.set_has_prototype_slot(has_prototype);
-    raw_map.set_is_constructor(has_prototype);
-    raw_map.set_is_callable(true);
+    Tagged<Map> raw_map = *map;
+    raw_map->set_has_prototype_slot(has_prototype);
+    raw_map->set_is_constructor(has_prototype);
+    raw_map->set_is_callable(true);
+    // Temporarily set constructor to empty function to calm down map verifier.
+    raw_map->SetConstructor(*empty_function);
   }
   Map::SetPrototype(isolate(), map, empty_function);
 
@@ -3922,8 +3968,8 @@ Handle<Map> Factory::CreateStrictFunctionMap(
     map->AppendDescriptor(isolate(), &d);
   }
   DCHECK_EQ(inobject_properties_count, field_index);
-  DCHECK_EQ(0,
-            map->instance_descriptors(isolate()).number_of_slack_descriptors());
+  DCHECK_EQ(
+      0, map->instance_descriptors(isolate())->number_of_slack_descriptors());
   LOG(isolate(), MapDetails(*map));
   return map;
 }
@@ -3933,11 +3979,13 @@ Handle<Map> Factory::CreateClassFunctionMap(Handle<JSFunction> empty_function) {
       NewMap(JS_CLASS_CONSTRUCTOR_TYPE, JSFunction::kSizeWithPrototype);
   {
     DisallowGarbageCollection no_gc;
-    Map raw_map = *map;
-    raw_map.set_has_prototype_slot(true);
-    raw_map.set_is_constructor(true);
-    raw_map.set_is_prototype_map(true);
-    raw_map.set_is_callable(true);
+    Tagged<Map> raw_map = *map;
+    raw_map->set_has_prototype_slot(true);
+    raw_map->set_is_constructor(true);
+    raw_map->set_is_prototype_map(true);
+    raw_map->set_is_callable(true);
+    // Temporarily set constructor to empty function to calm down map verifier.
+    raw_map->SetConstructor(*empty_function);
   }
   Map::SetPrototype(isolate(), map, empty_function);
 
@@ -3972,12 +4020,12 @@ Handle<JSPromise> Factory::NewJSPromiseWithoutHook() {
   Handle<JSPromise> promise =
       Handle<JSPromise>::cast(NewJSObject(isolate()->promise_function()));
   DisallowGarbageCollection no_gc;
-  JSPromise raw = *promise;
-  raw.set_reactions_or_result(Smi::zero(), SKIP_WRITE_BARRIER);
-  raw.set_flags(0);
+  Tagged<JSPromise> raw = *promise;
+  raw->set_reactions_or_result(Smi::zero(), SKIP_WRITE_BARRIER);
+  raw->set_flags(0);
   // TODO(v8) remove once embedder data slots are always zero-initialized.
   InitEmbedderFields(*promise, Smi::zero());
-  DCHECK_EQ(raw.GetEmbedderFieldCount(), v8::Promise::kEmbedderFieldCount);
+  DCHECK_EQ(raw->GetEmbedderFieldCount(), v8::Promise::kEmbedderFieldCount);
   return promise;
 }
 
@@ -3992,10 +4040,11 @@ Handle<CallHandlerInfo> Factory::NewCallHandlerInfo(bool has_no_side_effect) {
   Handle<Map> map = has_no_side_effect
                         ? side_effect_free_call_handler_info_map()
                         : side_effect_call_handler_info_map();
-  CallHandlerInfo info = CallHandlerInfo::cast(New(map, AllocationType::kOld));
+  Tagged<CallHandlerInfo> info =
+      Tagged<CallHandlerInfo>::cast(New(map, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  info.set_data(*undefined_value(), SKIP_WRITE_BARRIER);
-  info.init_callback(isolate(), kNullAddress);
+  info->set_data(*undefined_value(), SKIP_WRITE_BARRIER);
+  info->init_callback(isolate(), kNullAddress);
   return handle(info, isolate());
 }
 
@@ -4022,7 +4071,7 @@ Handle<JSFunction> Factory::NewFunctionForTesting(Handle<String> name) {
 }
 
 Handle<JSSharedStruct> Factory::NewJSSharedStruct(
-    Handle<JSFunction> constructor) {
+    Handle<JSFunction> constructor, Handle<Object> maybe_elements_template) {
   SharedObjectSafePublishGuard publish_guard;
 
   Handle<Map> instance_map(constructor->initial_map(), isolate());
@@ -4038,6 +4087,13 @@ Handle<JSSharedStruct> Factory::NewJSSharedStruct(
   Handle<JSSharedStruct> instance = Handle<JSSharedStruct>::cast(
       NewJSObject(constructor, AllocationType::kSharedOld));
 
+  if (!IsUndefined(*maybe_elements_template)) {
+    Handle<NumberDictionary> dictionary = NumberDictionary::ShallowCopy(
+        isolate(), Handle<NumberDictionary>::cast(maybe_elements_template),
+        AllocationType::kSharedOld);
+    instance->set_elements(*dictionary);
+  }
+
   // The struct object has not been fully initialized yet. Disallow allocation
   // from this point on.
   DisallowGarbageCollection no_gc;
@@ -4063,7 +4119,7 @@ Handle<JSSharedArray> Factory::NewJSSharedArray(Handle<JSFunction> constructor,
 
 Handle<JSAtomicsMutex> Factory::NewJSAtomicsMutex() {
   SharedObjectSafePublishGuard publish_guard;
-  Handle<Map> map = isolate()->js_atomics_mutex_map();
+  Handle<Map> map = read_only_roots().js_atomics_mutex_map_handle();
   Handle<JSAtomicsMutex> mutex = Handle<JSAtomicsMutex>::cast(
       NewJSObjectFromMap(map, AllocationType::kSharedOld));
   mutex->set_state(JSAtomicsMutex::kUnlocked);
@@ -4073,7 +4129,7 @@ Handle<JSAtomicsMutex> Factory::NewJSAtomicsMutex() {
 
 Handle<JSAtomicsCondition> Factory::NewJSAtomicsCondition() {
   SharedObjectSafePublishGuard publish_guard;
-  Handle<Map> map = isolate()->js_atomics_condition_map();
+  Handle<Map> map = read_only_roots().js_atomics_condition_map_handle();
   Handle<JSAtomicsCondition> cond = Handle<JSAtomicsCondition>::cast(
       NewJSObjectFromMap(map, AllocationType::kSharedOld));
   cond->set_state(JSAtomicsCondition::kEmptyState);
@@ -4090,14 +4146,18 @@ Handle<JSFunction> Factory::JSFunctionBuilder::Build() {
   PrepareFeedbackCell();
 
   Handle<Code> code = handle(sfi_->GetCode(isolate_), isolate_);
+  // Retain the code across the call to BuildRaw, because it allocates and can
+  // trigger code to be flushed. Otherwise the SFI's compiled state and the
+  // function's compiled state can diverge, and the call to PostInstantiation
+  // below can fail to initialize the feedback vector.
+  IsCompiledScope is_compiled_scope(sfi_->is_compiled_scope(isolate_));
   Handle<JSFunction> result = BuildRaw(code);
 
   if (code->kind() == CodeKind::BASELINE) {
-    IsCompiledScope is_compiled_scope(sfi_->is_compiled_scope(isolate_));
     JSFunction::EnsureFeedbackVector(isolate_, result, &is_compiled_scope);
   }
 
-  Compiler::PostInstantiation(result);
+  Compiler::PostInstantiation(result, &is_compiled_scope);
   return result;
 }
 
@@ -4111,21 +4171,22 @@ Handle<JSFunction> Factory::JSFunctionBuilder::BuildRaw(Handle<Code> code) {
   DCHECK(InstanceTypeChecker::IsJSFunction(*map));
 
   // Allocation.
-  JSFunction function = JSFunction::cast(factory->New(map, allocation_type_));
+  Tagged<JSFunction> function =
+      Tagged<JSFunction>::cast(factory->New(map, allocation_type_));
   DisallowGarbageCollection no_gc;
 
   WriteBarrierMode mode = allocation_type_ == AllocationType::kYoung
                               ? SKIP_WRITE_BARRIER
                               : UPDATE_WRITE_BARRIER;
   // Header initialization.
-  function.initialize_properties(isolate);
-  function.initialize_elements();
-  function.set_shared(*sfi_, mode);
-  function.set_context(*context_, kReleaseStore, mode);
-  function.set_raw_feedback_cell(*feedback_cell, mode);
-  function.set_code(*code, kReleaseStore, mode);
-  if (function.has_prototype_slot()) {
-    function.set_prototype_or_initial_map(
+  function->initialize_properties(isolate);
+  function->initialize_elements();
+  function->set_shared(*sfi_, mode);
+  function->set_context(*context_, kReleaseStore, mode);
+  function->set_raw_feedback_cell(*feedback_cell, mode);
+  function->set_code(*code, kReleaseStore, mode);
+  if (function->has_prototype_slot()) {
+    function->set_prototype_or_initial_map(
         ReadOnlyRoots(isolate).the_hole_value(), kReleaseStore,
         SKIP_WRITE_BARRIER);
   }
@@ -4141,7 +4202,7 @@ void Factory::JSFunctionBuilder::PrepareMap() {
   if (maybe_map_.is_null()) {
     // No specific map requested, use the default.
     maybe_map_ = handle(
-        Map::cast(context_->native_context().get(sfi_->function_map_index())),
+        Map::cast(context_->native_context()->get(sfi_->function_map_index())),
         isolate_);
   }
 }
diff --git a/deps/v8/src/heap/factory.h b/deps/v8/src/heap/factory.h
index 3890807e1a7616..5c71e925d3ca3f 100644
--- a/deps/v8/src/heap/factory.h
+++ b/deps/v8/src/heap/factory.h
@@ -17,12 +17,8 @@
 #include "src/handles/maybe-handles.h"
 #include "src/heap/factory-base.h"
 #include "src/heap/heap.h"
-#include "src/objects/code.h"
-#include "src/objects/dictionary.h"
-#include "src/objects/js-array.h"
+// TODO(leszeks): Remove this by forward declaring JSRegExp::Flags.
 #include "src/objects/js-regexp.h"
-#include "src/objects/shared-function-info.h"
-#include "src/objects/string.h"
 
 namespace unibrow {
 enum class Utf8Variant : uint8_t;
@@ -46,6 +42,8 @@ class EmbedderDataArray;
 class ArrayBoilerplateDescription;
 class CoverageInfo;
 class DebugInfo;
+class DeoptimizationData;
+class DeoptimizationLiteralArray;
 class EnumCache;
 class FreshlyAllocatedBigInt;
 class Isolate;
@@ -66,6 +64,8 @@ class NativeContext;
 class PromiseResolveThenableJobTask;
 class RegExpMatchInfo;
 class ScriptContextTable;
+template <typename>
+class Signature;
 class SourceTextModule;
 class StackFrameInfo;
 class StringSet;
@@ -76,6 +76,7 @@ class WasmCapiFunctionData;
 class WasmExportedFunctionData;
 class WasmJSFunctionData;
 class WeakCell;
+
 #if V8_ENABLE_WEBASSEMBLY
 namespace wasm {
 class ArrayType;
@@ -85,6 +86,8 @@ class WasmValue;
 enum class OnResume : int;
 enum Suspend : bool;
 enum Promise : bool;
+class ValueType;
+using FunctionSig = Signature<ValueType>;
 }  // namespace wasm
 #endif
 
@@ -112,6 +115,11 @@ enum FunctionMode {
       kWithReadonlyPrototypeBit | kWithNameBit,
 };
 
+enum class ArrayStorageAllocationMode {
+  DONT_INITIALIZE_ARRAY_ELEMENTS,
+  INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE
+};
+
 // Interface for handle based allocation.
 class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
  public:
@@ -119,7 +127,9 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
 
   Handle<Oddball> NewOddball(Handle<Map> map, const char* to_string,
                              Handle<Object> to_number, const char* type_of,
-                             byte kind);
+                             uint8_t kind);
+
+  Handle<Hole> NewHole();
 
   // Marks self references within code generation.
   Handle<Oddball> NewSelfReferenceMarker();
@@ -161,11 +171,6 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   // |at_least_space_for| entries can be added without reallocating.
   Handle<NameDictionary> NewNameDictionary(int at_least_space_for);
 
-  // Allocates an OrderedNameDictionary of the given capacity. This guarantees
-  // that |capacity| entries can be added without reallocating.
-  Handle<OrderedNameDictionary> NewOrderedNameDictionary(
-      int capacity = OrderedNameDictionary::kInitialCapacity);
-
   Handle<OrderedHashSet> NewOrderedHashSet();
   Handle<OrderedHashMap> NewOrderedHashMap();
   Handle<SmallOrderedHashSet> NewSmallOrderedHashSet(
@@ -189,6 +194,7 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
       AllocationType allocation = AllocationType::kOld);
 
   // Create a new Tuple2 struct.
+  Handle<Tuple2> NewTuple2Uninitialized(AllocationType allocation);
   Handle<Tuple2> NewTuple2(Handle<Object> value1, Handle<Object> value2,
                            AllocationType allocation);
 
@@ -197,7 +203,7 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
 
   // Finds the internalized copy for string in the string table.
   // If not found, a new string is added to the table and returned.
-  Handle<String> InternalizeUtf8String(const base::Vector<const char>& str);
+  Handle<String> InternalizeUtf8String(base::Vector<const char> str);
   Handle<String> InternalizeUtf8String(const char* str) {
     return InternalizeUtf8String(base::CStrVector(str));
   }
@@ -210,6 +216,11 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
     return InternalizeString(base::Vector<const uint8_t>::cast(str));
   }
 
+  Handle<String> InternalizeString(const char* str,
+                                   bool convert_encoding = false) {
+    return InternalizeString(base::OneByteVector(str));
+  }
+
   template <typename SeqString>
   Handle<String> InternalizeString(Handle<SeqString>, int from, int length,
                                    bool convert_encoding = false);
@@ -241,26 +252,17 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   // One-byte strings are pretenured when used as keys in the SourceCodeCache.
   template <size_t N>
   inline Handle<String> NewStringFromStaticChars(
-      const char (&str)[N],
-      AllocationType allocation = AllocationType::kYoung) {
-    DCHECK_EQ(N, strlen(str) + 1);
-    return NewStringFromOneByte(base::StaticOneByteVector(str), allocation)
-        .ToHandleChecked();
-  }
-
+      const char (&str)[N], AllocationType allocation = AllocationType::kYoung);
   inline Handle<String> NewStringFromAsciiChecked(
-      const char* str, AllocationType allocation = AllocationType::kYoung) {
-    return NewStringFromOneByte(base::OneByteVector(str), allocation)
-        .ToHandleChecked();
-  }
+      const char* str, AllocationType allocation = AllocationType::kYoung);
 
   // UTF8 strings are pretenured when used for regexp literal patterns and
   // flags in the parser.
   V8_WARN_UNUSED_RESULT MaybeHandle<String> NewStringFromUtf8(
-      const base::Vector<const char>& str,
+      base::Vector<const char> str,
       AllocationType allocation = AllocationType::kYoung);
   V8_WARN_UNUSED_RESULT MaybeHandle<String> NewStringFromUtf8(
-      const base::Vector<const uint8_t>& str, unibrow::Utf8Variant utf8_variant,
+      base::Vector<const uint8_t> str, unibrow::Utf8Variant utf8_variant,
       AllocationType allocation = AllocationType::kYoung);
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -284,7 +286,7 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
       AllocationType allocation = AllocationType::kYoung);
 
   V8_WARN_UNUSED_RESULT MaybeHandle<String> NewStringFromTwoByte(
-      const base::Vector<const base::uc16>& str,
+      base::Vector<const base::uc16> str,
       AllocationType allocation = AllocationType::kYoung);
 
   V8_WARN_UNUSED_RESULT MaybeHandle<String> NewStringFromTwoByte(
@@ -295,7 +297,7 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   // Usually the two-byte encodings are in the native endianness, but for
   // WebAssembly linear memory, they are explicitly little-endian.
   V8_WARN_UNUSED_RESULT MaybeHandle<String> NewStringFromTwoByteLittleEndian(
-      const base::Vector<const base::uc16>& str,
+      base::Vector<const base::uc16> str,
       AllocationType allocation = AllocationType::kYoung);
 #endif  // V8_ENABLE_WEBASSEMBLY
 
@@ -343,6 +345,9 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
 
   // Create a new string object which holds a proper substring of a string.
   Handle<String> NewProperSubString(Handle<String> str, int begin, int end);
+  // Same, but always copies (never creates a SlicedString).
+  // {str} must be flat, {length} must be non-zero.
+  Handle<String> NewCopiedSubstring(Handle<String> str, int begin, int length);
 
   // Create a new string object which holds a substring of a string.
   inline Handle<String> NewSubString(Handle<String> str, int begin, int end);
@@ -353,9 +358,9 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   // because we cannot change the underlying buffer.  Note that these strings
   // are backed by a string resource that resides outside the V8 heap.
   V8_WARN_UNUSED_RESULT MaybeHandle<String> NewExternalStringFromOneByte(
-      const ExternalOneByteString::Resource* resource);
+      const v8::String::ExternalOneByteStringResource* resource);
   V8_WARN_UNUSED_RESULT MaybeHandle<String> NewExternalStringFromTwoByte(
-      const ExternalTwoByteString::Resource* resource);
+      const v8::String::ExternalStringResource* resource);
 
   // Create a symbol in old or read-only space.
   Handle<Symbol> NewSymbol(AllocationType allocation = AllocationType::kOld);
@@ -418,7 +423,7 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
       Handle<Object> call_site_infos_or_formatted_stack,
       Handle<Object> limit_or_stack_frame_infos);
 
-  Handle<Script> CloneScript(Handle<Script> script);
+  Handle<Script> CloneScript(Handle<Script> script, Handle<String> source);
 
   Handle<BreakPointInfo> NewBreakPointInfo(int source_position);
   Handle<BreakPoint> NewBreakPoint(int id, Handle<String> condition);
@@ -450,7 +455,7 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   Handle<Foreign> NewForeign(
       Address addr, AllocationType allocation_type = AllocationType::kYoung);
 
-  Handle<Cell> NewCell(Smi value);
+  Handle<Cell> NewCell(Tagged<Smi> value);
   Handle<Cell> NewCell();
 
   Handle<PropertyCell> NewPropertyCell(
@@ -476,9 +481,9 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   // Initializes the fields of a newly created Map using roots from the
   // passed-in Heap. Exposed for tests and heap setup; other code should just
   // call NewMap which takes care of it.
-  Map InitializeMap(Map map, InstanceType type, int instance_size,
-                    ElementsKind elements_kind, int inobject_properties,
-                    Heap* roots);
+  Tagged<Map> InitializeMap(Tagged<Map> map, InstanceType type,
+                            int instance_size, ElementsKind elements_kind,
+                            int inobject_properties, Heap* roots);
 
   // Allocate a block of memory of the given AllocationType (filled with a
   // filler). Used as a fall-back for generated code when the space is full.
@@ -496,8 +501,9 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   Handle<JSObject> CopyJSObjectWithAllocationSite(Handle<JSObject> object,
                                                   Handle<AllocationSite> site);
 
-  Handle<FixedArray> CopyFixedArrayWithMap(Handle<FixedArray> array,
-                                           Handle<Map> map);
+  Handle<FixedArray> CopyFixedArrayWithMap(
+      Handle<FixedArray> array, Handle<Map> map,
+      AllocationType allocation = AllocationType::kYoung);
 
   Handle<FixedArray> CopyFixedArrayAndGrow(
       Handle<FixedArray> array, int grow_by,
@@ -528,6 +534,24 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
 
   Handle<FixedDoubleArray> CopyFixedDoubleArray(Handle<FixedDoubleArray> array);
 
+  template <ExternalPointerTag tag>
+  Handle<ExternalPointerArray> CopyExternalPointerArrayAndGrow(
+      Handle<ExternalPointerArray> src, int grow_by,
+      AllocationType alloction = AllocationType::kYoung) {
+    int old_len = src->length();
+    int new_len = old_len + grow_by;
+    Handle<ExternalPointerArray> result = NewExternalPointerArray(new_len);
+
+    // Copy the pointers one-by-one. We can't just do a memcpy here since when
+    // the sandbox is enabled, this array will contain external pointer handles
+    // which must not be copied/moved between objects.
+    for (int i = 0; i < old_len; i++) {
+      result->set<tag>(i, isolate(), src->get<tag>(i, isolate()));
+    }
+
+    return result;
+  }
+
   // Creates a new HeapNumber in read-only space if possible otherwise old
   // space.
   Handle<HeapNumber> NewHeapNumberForCodeAssembler(double value);
@@ -557,19 +581,19 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   Handle<JSObject> NewJSObjectFromMap(
       Handle<Map> map, AllocationType allocation = AllocationType::kYoung,
       Handle<AllocationSite> allocation_site = Handle<AllocationSite>::null());
-  // Like NewJSObjectFromMap, but includes allocating a properties dictionary.
+  // Like NewJSObjectFromMap, but includes allocating a properties dictionary.);
   Handle<JSObject> NewSlowJSObjectFromMap(
-      Handle<Map> map,
-      int number_of_slow_properties = NameDictionary::kInitialCapacity,
+      Handle<Map> map, int number_of_slow_properties,
       AllocationType allocation = AllocationType::kYoung,
       Handle<AllocationSite> allocation_site = Handle<AllocationSite>::null());
+  Handle<JSObject> NewSlowJSObjectFromMap(Handle<Map> map);
   // Calls NewJSObjectFromMap or NewSlowJSObjectFromMap depending on whether the
   // map is a dictionary map.
   inline Handle<JSObject> NewFastOrSlowJSObjectFromMap(
-      Handle<Map> map,
-      int number_of_slow_properties = NameDictionary::kInitialCapacity,
+      Handle<Map> map, int number_of_slow_properties,
       AllocationType allocation = AllocationType::kYoung,
       Handle<AllocationSite> allocation_site = Handle<AllocationSite>::null());
+  inline Handle<JSObject> NewFastOrSlowJSObjectFromMap(Handle<Map> map);
   // Allocates and initializes a new JavaScript object with the given
   // {prototype} and {properties}. The newly created object will be
   // in dictionary properties mode. The {elements} can either be the
@@ -586,7 +610,8 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   // according to the specified mode.
   Handle<JSArray> NewJSArray(
       ElementsKind elements_kind, int length, int capacity,
-      ArrayStorageAllocationMode mode = DONT_INITIALIZE_ARRAY_ELEMENTS,
+      ArrayStorageAllocationMode mode =
+          ArrayStorageAllocationMode::DONT_INITIALIZE_ARRAY_ELEMENTS,
       AllocationType allocation = AllocationType::kYoung);
 
   Handle<JSArray> NewJSArray(
@@ -595,8 +620,10 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
     if (capacity != 0) {
       elements_kind = GetHoleyElementsKind(elements_kind);
     }
-    return NewJSArray(elements_kind, 0, capacity,
-                      INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE, allocation);
+    return NewJSArray(
+        elements_kind, 0, capacity,
+        ArrayStorageAllocationMode::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE,
+        allocation);
   }
 
   // Create a JSArray with the given elements.
@@ -615,7 +642,8 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
 
   void NewJSArrayStorage(
       Handle<JSArray> array, int length, int capacity,
-      ArrayStorageAllocationMode mode = DONT_INITIALIZE_ARRAY_ELEMENTS);
+      ArrayStorageAllocationMode mode =
+          ArrayStorageAllocationMode::DONT_INITIALIZE_ARRAY_ELEMENTS);
 
   Handle<JSWeakMap> NewJSWeakMap();
 
@@ -630,28 +658,32 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   Handle<WasmTypeInfo> NewWasmTypeInfo(Address type_address,
                                        Handle<Map> opt_parent,
                                        int instance_size_bytes,
-                                       Handle<WasmInstanceObject> instance,
+                                       Handle<WasmInstanceObject> opt_instance,
                                        uint32_t type_index);
   Handle<WasmInternalFunction> NewWasmInternalFunction(Address opt_call_target,
                                                        Handle<HeapObject> ref,
-                                                       Handle<Map> rtt);
+                                                       Handle<Map> rtt,
+                                                       int function_index);
   Handle<WasmCapiFunctionData> NewWasmCapiFunctionData(
       Address call_target, Handle<Foreign> embedder_data,
       Handle<Code> wrapper_code, Handle<Map> rtt,
       Handle<PodArray<wasm::ValueType>> serialized_sig);
   Handle<WasmExportedFunctionData> NewWasmExportedFunctionData(
       Handle<Code> export_wrapper, Handle<WasmInstanceObject> instance,
-      Address call_target, Handle<Object> ref, int func_index,
+      Handle<WasmInternalFunction> internal, int func_index,
       const wasm::FunctionSig* sig, uint32_t canonical_type_index,
-      int wrapper_budget, Handle<Map> rtt, wasm::Promise promise);
+      int wrapper_budget, wasm::Promise promise);
   Handle<WasmApiFunctionRef> NewWasmApiFunctionRef(
-      Handle<JSReceiver> callable, wasm::Suspend suspend,
-      Handle<WasmInstanceObject> instance);
+      Handle<HeapObject> callable, wasm::Suspend suspend,
+      Handle<HeapObject> instance,
+      Handle<PodArray<wasm::ValueType>> serialized_sig);
+  Handle<WasmApiFunctionRef> NewWasmApiFunctionRef(
+      Handle<WasmApiFunctionRef> ref);
   // {opt_call_target} is kNullAddress for JavaScript functions, and
   // non-null for exported Wasm functions.
   Handle<WasmJSFunctionData> NewWasmJSFunctionData(
-      Address opt_call_target, Handle<JSReceiver> callable, int return_count,
-      int parameter_count, Handle<PodArray<wasm::ValueType>> serialized_sig,
+      Address opt_call_target, Handle<JSReceiver> callable,
+      Handle<PodArray<wasm::ValueType>> serialized_sig,
       Handle<Code> wrapper_code, Handle<Map> rtt, wasm::Suspend suspend,
       wasm::Promise promise);
   Handle<WasmResumeData> NewWasmResumeData(
@@ -751,12 +783,20 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   // Create an External object for V8's external API.
   Handle<JSObject> NewExternal(void* value);
 
-  Handle<DeoptimizationLiteralArray> NewDeoptimizationLiteralArray(int length);
-
-  // Allocates a new code object and initializes it as the trampoline to the
-  // given off-heap entry point.
-  Handle<Code> NewOffHeapTrampolineFor(Handle<Code> code,
-                                       Address off_heap_entry);
+  // Allocates a new code object and initializes it to point to the given
+  // off-heap entry point.
+  //
+  // Note it wouldn't be strictly necessary to create new Code objects, instead
+  // Code::instruction_start and instruction_stream could be reset. But creating
+  // a new Code object doesn't hurt much (it only makes mksnapshot slightly more
+  // expensive) and has real benefits:
+  // - it moves all special-casing to mksnapshot-time; at normal runtime, the
+  //   system only sees a) non-builtin Code objects (not in RO space, with
+  //   instruction_stream set) and b) builtin Code objects (maybe in RO space,
+  //   without instruction_stream set).
+  // - it's a convenient bottleneck to make the RO-space allocation decision.
+  Handle<Code> NewCodeObjectForEmbeddedBuiltin(Handle<Code> code,
+                                               Address off_heap_entry);
 
   Handle<BytecodeArray> CopyBytecodeArray(Handle<BytecodeArray>);
 
@@ -879,11 +919,12 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
 
   Handle<CallHandlerInfo> NewCallHandlerInfo(bool has_no_side_effect = false);
 
-  HeapObject NewForTest(Handle<Map> map, AllocationType allocation) {
+  Tagged<HeapObject> NewForTest(Handle<Map> map, AllocationType allocation) {
     return New(map, allocation);
   }
 
-  Handle<JSSharedStruct> NewJSSharedStruct(Handle<JSFunction> constructor);
+  Handle<JSSharedStruct> NewJSSharedStruct(
+      Handle<JSFunction> constructor, Handle<Object> maybe_elements_template);
 
   Handle<JSSharedArray> NewJSSharedArray(Handle<JSFunction> constructor,
                                          int length);
@@ -1006,11 +1047,6 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
       return *this;
     }
 
-    CodeBuilder& set_kind_specific_flags(int32_t flags) {
-      kind_specific_flags_ = flags;
-      return *this;
-    }
-
     CodeBuilder& set_stack_slots(int stack_slots) {
       stack_slots_ = stack_slots;
       return *this;
@@ -1021,14 +1057,15 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
       return *this;
     }
 
-    inline bool CompiledWithConcurrentBaseline() const;
-
    private:
     MaybeHandle<Code> BuildInternal(bool retry_allocation_or_fail);
-    MaybeHandle<InstructionStream> AllocateInstructionStream(
-        bool retry_allocation_or_fail);
-    MaybeHandle<InstructionStream> AllocateConcurrentSparkplugInstructionStream(
+
+    Handle<ByteArray> NewByteArray(int length, AllocationType allocation);
+    // Return an allocation suitable for InstructionStreams but without writing
+    // the map.
+    Tagged<HeapObject> AllocateUninitializedInstructionStream(
         bool retry_allocation_or_fail);
+    Handle<Code> NewCode(const NewCodeOptions& options);
 
     Isolate* const isolate_;
     LocalIsolate* local_isolate_;
@@ -1039,12 +1076,10 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
     Builtin builtin_ = Builtin::kNoBuiltinId;
     uint32_t inlined_bytecode_size_ = 0;
     BytecodeOffset osr_offset_ = BytecodeOffset::None();
-    int32_t kind_specific_flags_ = 0;
-    // Either source_position_table for non-baseline code
-    // or bytecode_offset_table for baseline code.
+    // Either source_position_table for non-baseline code or
+    // bytecode_offset_table for baseline code.
     Handle<ByteArray> position_table_;
-    Handle<DeoptimizationData> deoptimization_data_ =
-        DeoptimizationData::Empty(isolate_);
+    Handle<DeoptimizationData> deoptimization_data_;
     Handle<HeapObject> interpreter_data_;
     BasicBlockProfilerData* profiler_data_ = nullptr;
     bool is_turbofanned_ = false;
@@ -1056,8 +1091,9 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
 
   // ------
   // Customization points for FactoryBase
-  HeapObject AllocateRaw(int size, AllocationType allocation,
-                         AllocationAlignment alignment = kTaggedAligned);
+  Tagged<HeapObject> AllocateRaw(
+      int size, AllocationType allocation,
+      AllocationAlignment alignment = kTaggedAligned);
 
   Isolate* isolate() const {
     // Downcast to the privately inherited sub-class using c-style casts to
@@ -1083,10 +1119,11 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   bool EmptyStringRootIsInitialized();
   AllocationType AllocationTypeForInPlaceInternalizableString();
 
-  void AddToScriptList(Handle<Script> shared);
+  void ProcessNewScript(Handle<Script> shared,
+                        ScriptEventType script_event_type);
   // ------
 
-  HeapObject AllocateRawWithAllocationSite(
+  Tagged<HeapObject> AllocateRawWithAllocationSite(
       Handle<Map> map, AllocationType allocation,
       Handle<AllocationSite> allocation_site);
 
@@ -1094,14 +1131,15 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
       Handle<Map> map, Handle<FixedArrayBase> elements,
       Handle<JSArrayBuffer> buffer, size_t byte_offset, size_t byte_length);
 
-  Symbol NewSymbolInternal(AllocationType allocation = AllocationType::kOld);
+  Tagged<Symbol> NewSymbolInternal(
+      AllocationType allocation = AllocationType::kOld);
 
   // Allocates new context with given map, sets length and initializes the
   // after-header part with uninitialized values and leaves the context header
   // uninitialized.
-  Context NewContextInternal(Handle<Map> map, int size,
-                             int variadic_part_length,
-                             AllocationType allocation);
+  Tagged<Context> NewContextInternal(Handle<Map> map, int size,
+                                     int variadic_part_length,
+                                     AllocationType allocation);
 
   template <typename T>
   Handle<T> AllocateSmallOrderedHashTable(Handle<Map> map, int capacity,
@@ -1109,10 +1147,12 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
 
   // Creates a heap object based on the map. The fields of the heap object are
   // not initialized, it's the responsibility of the caller to do that.
-  HeapObject New(Handle<Map> map, AllocationType allocation);
+  Tagged<HeapObject> New(Handle<Map> map, AllocationType allocation);
 
   template <typename T>
-  Handle<T> CopyArrayWithMap(Handle<T> src, Handle<Map> map);
+  Handle<T> CopyArrayWithMap(
+      Handle<T> src, Handle<Map> map,
+      AllocationType allocation = AllocationType::kYoung);
   template <typename T>
   Handle<T> CopyArrayAndGrow(Handle<T> src, int grow_by,
                              AllocationType allocation);
@@ -1121,12 +1161,13 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
                                            AllocationType allocation);
 
   // Functions to get the hash of a number for the number_string_cache.
-  int NumberToStringCacheHash(Smi number);
+  int NumberToStringCacheHash(Tagged<Smi> number);
   int NumberToStringCacheHash(double number);
 
   // Attempt to find the number in a small cache.  If we finds it, return
   // the string representation of the number.  Otherwise return undefined.
-  V8_INLINE Handle<Object> NumberToStringCacheGet(Object number, int hash);
+  V8_INLINE Handle<Object> NumberToStringCacheGet(Tagged<Object> number,
+                                                  int hash);
 
   // Update the cache with a new number-string pair.
   V8_INLINE void NumberToStringCacheSet(Handle<Object> number, int hash,
@@ -1147,18 +1188,28 @@ class V8_EXPORT_PRIVATE Factory : public FactoryBase<Factory> {
   // this method requires capacity greater than zero.
   Handle<FixedArrayBase> NewJSArrayStorage(
       ElementsKind elements_kind, int capacity,
-      ArrayStorageAllocationMode mode = DONT_INITIALIZE_ARRAY_ELEMENTS);
+      ArrayStorageAllocationMode mode =
+          ArrayStorageAllocationMode::DONT_INITIALIZE_ARRAY_ELEMENTS);
 
-  void InitializeAllocationMemento(AllocationMemento memento,
-                                   AllocationSite allocation_site);
+  void InitializeAllocationMemento(Tagged<AllocationMemento> memento,
+                                   Tagged<AllocationSite> allocation_site);
 
   // Initializes a JSObject based on its map.
-  void InitializeJSObjectFromMap(JSObject obj, Object properties, Map map);
+  void InitializeJSObjectFromMap(Tagged<JSObject> obj,
+                                 Tagged<Object> properties, Tagged<Map> map);
   // Initializes JSObject body starting at given offset.
-  void InitializeJSObjectBody(JSObject obj, Map map, int start_offset);
+  void InitializeJSObjectBody(Tagged<JSObject> obj, Tagged<Map> map,
+                              int start_offset);
 
   Handle<WeakArrayList> NewUninitializedWeakArrayList(
       int capacity, AllocationType allocation = AllocationType::kYoung);
+
+#if V8_ENABLE_WEBASSEMBLY
+  // The resulting array will be uninitialized, which means GC might fail for
+  // reference arrays until initialization. Follow this up with a
+  // {DisallowGarbageCollection} scope until initialization.
+  Tagged<WasmArray> NewWasmArrayUninitialized(uint32_t length, Handle<Map> map);
+#endif  // V8_ENABLE_WEBASSEMBLY
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/finalization-registry-cleanup-task.cc b/deps/v8/src/heap/finalization-registry-cleanup-task.cc
index 18222e783d17b5..dc8ceb49c18b6f 100644
--- a/deps/v8/src/heap/finalization-registry-cleanup-task.cc
+++ b/deps/v8/src/heap/finalization-registry-cleanup-task.cc
@@ -55,16 +55,16 @@ void FinalizationRegistryCleanupTask::RunInternal() {
 
   // Since FinalizationRegistry cleanup callbacks are scheduled by V8, enter the
   // FinalizationRegistry's context.
-  Handle<Context> context(
-      Context::cast(finalization_registry->native_context()), isolate);
+  Handle<NativeContext> native_context(finalization_registry->native_context(),
+                                       isolate);
   Handle<Object> callback(finalization_registry->cleanup(), isolate);
-  v8::Context::Scope context_scope(v8::Utils::ToLocal(context));
+  v8::Context::Scope context_scope(v8::Utils::ToLocal(native_context));
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
   v8::TryCatch catcher(v8_isolate);
   catcher.SetVerbose(true);
   std::unique_ptr<MicrotasksScope> microtasks_scope;
   MicrotaskQueue* microtask_queue =
-      finalization_registry->native_context().microtask_queue();
+      finalization_registry->native_context()->microtask_queue();
   if (!microtask_queue) microtask_queue = isolate->default_microtask_queue();
   if (microtask_queue &&
       microtask_queue->microtasks_policy() == v8::MicrotasksPolicy::kScoped) {
@@ -85,11 +85,11 @@ void FinalizationRegistryCleanupTask::RunInternal() {
   // and should be requeued.
   //
   // TODO(syg): Implement better scheduling for finalizers.
-  InvokeFinalizationRegistryCleanupFromTask(context, finalization_registry,
-                                            callback);
+  InvokeFinalizationRegistryCleanupFromTask(native_context,
+                                            finalization_registry, callback);
   if (finalization_registry->NeedsCleanup() &&
       !finalization_registry->scheduled_for_cleanup()) {
-    auto nop = [](HeapObject, ObjectSlot, Object) {};
+    auto nop = [](Tagged<HeapObject>, ObjectSlot, Tagged<Object>) {};
     heap_->EnqueueDirtyJSFinalizationRegistry(*finalization_registry, nop);
   }
 
diff --git a/deps/v8/src/heap/free-list-inl.h b/deps/v8/src/heap/free-list-inl.h
index bf60485fa8a7b0..ca50c292c40a15 100644
--- a/deps/v8/src/heap/free-list-inl.h
+++ b/deps/v8/src/heap/free-list-inl.h
@@ -30,6 +30,14 @@ Page* FreeList::GetPageForCategoryType(FreeListCategoryType type) {
   }
 }
 
+bool FreeList::IsEmpty() {
+  bool empty = true;
+  ForAllFreeListCategories([&empty](FreeListCategory* category) {
+    if (!category->is_empty()) empty = false;
+  });
+  return empty;
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/free-list.cc b/deps/v8/src/heap/free-list.cc
index 423611579a475a..7fa99151631d66 100644
--- a/deps/v8/src/heap/free-list.cc
+++ b/deps/v8/src/heap/free-list.cc
@@ -9,6 +9,7 @@
 #include "src/heap/free-list-inl.h"
 #include "src/heap/heap.h"
 #include "src/heap/memory-chunk-inl.h"
+#include "src/heap/page-inl.h"
 #include "src/objects/free-space-inl.h"
 
 namespace v8 {
@@ -27,41 +28,38 @@ void FreeListCategory::Reset(FreeList* owner) {
   available_ = 0;
 }
 
-FreeSpace FreeListCategory::PickNodeFromList(size_t minimum_size,
-                                             size_t* node_size) {
-  FreeSpace node = top();
+Tagged<FreeSpace> FreeListCategory::PickNodeFromList(size_t minimum_size,
+                                                     size_t* node_size) {
+  Tagged<FreeSpace> node = top();
   DCHECK(!node.is_null());
   DCHECK(Page::FromHeapObject(node)->CanAllocate());
-  if (static_cast<size_t>(node.Size()) < minimum_size) {
+  if (static_cast<size_t>(node->Size()) < minimum_size) {
     *node_size = 0;
     return FreeSpace();
   }
-  set_top(node.next());
-  *node_size = node.Size();
+  set_top(node->next());
+  *node_size = node->Size();
   UpdateCountersAfterAllocation(*node_size);
   return node;
 }
 
-FreeSpace FreeListCategory::SearchForNodeInList(size_t minimum_size,
-                                                size_t* node_size) {
-  FreeSpace prev_non_evac_node;
-  for (FreeSpace cur_node = top(); !cur_node.is_null();
-       cur_node = cur_node.next()) {
+Tagged<FreeSpace> FreeListCategory::SearchForNodeInList(size_t minimum_size,
+                                                        size_t* node_size) {
+  Tagged<FreeSpace> prev_non_evac_node;
+  for (Tagged<FreeSpace> cur_node = top(); !cur_node.is_null();
+       cur_node = cur_node->next()) {
     DCHECK(Page::FromHeapObject(cur_node)->CanAllocate());
-    size_t size = cur_node.size(kRelaxedLoad);
+    size_t size = cur_node->size(kRelaxedLoad);
     if (size >= minimum_size) {
       DCHECK_GE(available_, size);
       UpdateCountersAfterAllocation(size);
       if (cur_node == top()) {
-        set_top(cur_node.next());
+        set_top(cur_node->next());
       }
       if (!prev_non_evac_node.is_null()) {
-        MemoryChunk* chunk = MemoryChunk::FromHeapObject(prev_non_evac_node);
-        if (chunk->owner_identity() == CODE_SPACE) {
-          chunk->heap()->UnprotectAndRegisterMemoryChunk(
-              chunk, UnprotectMemoryOrigin::kMaybeOffMainThread);
-        }
-        prev_non_evac_node.set_next(cur_node.next());
+        CodePageMemoryModificationScope code_modification_scope(
+            BasicMemoryChunk::FromHeapObject(prev_non_evac_node));
+        prev_non_evac_node->set_next(cur_node->next());
       }
       *node_size = size;
       return cur_node;
@@ -74,8 +72,14 @@ FreeSpace FreeListCategory::SearchForNodeInList(size_t minimum_size,
 
 void FreeListCategory::Free(Address start, size_t size_in_bytes, FreeMode mode,
                             FreeList* owner) {
-  FreeSpace free_space = FreeSpace::cast(HeapObject::FromAddress(start));
-  free_space.set_next(top());
+  Tagged<FreeSpace> free_space =
+      FreeSpace::cast(HeapObject::FromAddress(start));
+  DCHECK_EQ(free_space->Size(), size_in_bytes);
+  {
+    CodePageMemoryModificationScope memory_modification_scope(
+        BasicMemoryChunk::FromAddress(start));
+    free_space->set_next(top());
+  }
   set_top(free_space);
   available_ += size_in_bytes;
   if (mode == kLinkCategory) {
@@ -88,16 +92,16 @@ void FreeListCategory::Free(Address start, size_t size_in_bytes, FreeMode mode,
 }
 
 void FreeListCategory::RepairFreeList(Heap* heap) {
-  Map free_space_map = ReadOnlyRoots(heap).free_space_map();
-  FreeSpace n = top();
+  Tagged<Map> free_space_map = ReadOnlyRoots(heap).free_space_map();
+  Tagged<FreeSpace> n = top();
   while (!n.is_null()) {
-    ObjectSlot map_slot = n.map_slot();
+    ObjectSlot map_slot = n->map_slot();
     if (map_slot.contains_map_value(kNullAddress)) {
       map_slot.store_map(free_space_map);
     } else {
       DCHECK(map_slot.contains_map_value(free_space_map.ptr()));
     }
-    n = n.next();
+    n = n->next();
   }
 }
 
@@ -109,20 +113,23 @@ void FreeListCategory::Relink(FreeList* owner) {
 // ------------------------------------------------
 // Generic FreeList methods (alloc/free related)
 
-FreeList* FreeList::CreateFreeList() { return new FreeListManyCachedOrigin(); }
+std::unique_ptr<FreeList> FreeList::CreateFreeList() {
+  return std::make_unique<FreeListManyCachedOrigin>();
+}
 
-FreeList* FreeList::CreateFreeListForNewSpace() {
-  return new FreeListManyCachedFastPathForNewSpace();
+std::unique_ptr<FreeList> FreeList::CreateFreeListForNewSpace() {
+  return std::make_unique<FreeListManyCachedFastPathForNewSpace>();
 }
 
-FreeSpace FreeList::TryFindNodeIn(FreeListCategoryType type,
-                                  size_t minimum_size, size_t* node_size) {
+Tagged<FreeSpace> FreeList::TryFindNodeIn(FreeListCategoryType type,
+                                          size_t minimum_size,
+                                          size_t* node_size) {
   FreeListCategory* category = categories_[type];
   if (category == nullptr) return FreeSpace();
-  FreeSpace node = category->PickNodeFromList(minimum_size, node_size);
+  Tagged<FreeSpace> node = category->PickNodeFromList(minimum_size, node_size);
   if (!node.is_null()) {
     DecreaseAvailableBytes(*node_size);
-    DCHECK(IsVeryLong() || Available() == SumFreeLists());
+    VerifyAvailable();
   }
   if (category->is_empty()) {
     RemoveCategory(category);
@@ -130,17 +137,17 @@ FreeSpace FreeList::TryFindNodeIn(FreeListCategoryType type,
   return node;
 }
 
-FreeSpace FreeList::SearchForNodeInList(FreeListCategoryType type,
-                                        size_t minimum_size,
-                                        size_t* node_size) {
+Tagged<FreeSpace> FreeList::SearchForNodeInList(FreeListCategoryType type,
+                                                size_t minimum_size,
+                                                size_t* node_size) {
   FreeListCategoryIterator it(this, type);
-  FreeSpace node;
+  Tagged<FreeSpace> node;
   while (it.HasNext()) {
     FreeListCategory* current = it.Next();
     node = current->SearchForNodeInList(minimum_size, node_size);
     if (!node.is_null()) {
       DecreaseAvailableBytes(*node_size);
-      DCHECK(IsVeryLong() || Available() == SumFreeLists());
+      VerifyAvailable();
       if (current->is_empty()) {
         RemoveCategory(current);
       }
@@ -157,7 +164,6 @@ size_t FreeList::Free(Address start, size_t size_in_bytes, FreeMode mode) {
   // Blocks have to be a minimum size to hold free list items.
   if (size_in_bytes < min_block_size_) {
     page->add_wasted_memory(size_in_bytes);
-    wasted_bytes_ += size_in_bytes;
     return size_in_bytes;
   }
 
@@ -213,10 +219,11 @@ Page* FreeListMany::GetPageForSize(size_t size_in_bytes) {
   return page;
 }
 
-FreeSpace FreeListMany::Allocate(size_t size_in_bytes, size_t* node_size,
-                                 AllocationOrigin origin) {
+Tagged<FreeSpace> FreeListMany::Allocate(size_t size_in_bytes,
+                                         size_t* node_size,
+                                         AllocationOrigin origin) {
   DCHECK_GE(kMaxBlockSize, size_in_bytes);
-  FreeSpace node;
+  Tagged<FreeSpace> node;
   FreeListCategoryType type = SelectFreeListCategoryType(size_in_bytes);
   for (int i = type; i < last_category_ && node.is_null(); i++) {
     node = TryFindNodeIn(static_cast<FreeListCategoryType>(i), size_in_bytes,
@@ -232,7 +239,7 @@ FreeSpace FreeListMany::Allocate(size_t size_in_bytes, size_t* node_size,
     Page::FromHeapObject(node)->IncreaseAllocatedBytes(*node_size);
   }
 
-  DCHECK(IsVeryLong() || Available() == SumFreeLists());
+  VerifyAvailable();
   return node;
 }
 
@@ -283,7 +290,6 @@ size_t FreeListManyCached::Free(Address start, size_t size_in_bytes,
   // Blocks have to be a minimum size to hold free list items.
   if (size_in_bytes < min_block_size_) {
     page->add_wasted_memory(size_in_bytes);
-    wasted_bytes_ += size_in_bytes;
     return size_in_bytes;
   }
 
@@ -306,12 +312,13 @@ size_t FreeListManyCached::Free(Address start, size_t size_in_bytes,
   return 0;
 }
 
-FreeSpace FreeListManyCached::Allocate(size_t size_in_bytes, size_t* node_size,
-                                       AllocationOrigin origin) {
+Tagged<FreeSpace> FreeListManyCached::Allocate(size_t size_in_bytes,
+                                               size_t* node_size,
+                                               AllocationOrigin origin) {
   USE(origin);
   DCHECK_GE(kMaxBlockSize, size_in_bytes);
 
-  FreeSpace node;
+  Tagged<FreeSpace> node;
   FreeListCategoryType type = SelectFreeListCategoryType(size_in_bytes);
   type = next_nonempty_category[type];
   for (; type < last_category_; type = next_nonempty_category[type + 1]) {
@@ -338,19 +345,18 @@ FreeSpace FreeListManyCached::Allocate(size_t size_in_bytes, size_t* node_size,
     Page::FromHeapObject(node)->IncreaseAllocatedBytes(*node_size);
   }
 
-  DCHECK(IsVeryLong() || Available() == SumFreeLists());
+  VerifyAvailable();
   return node;
 }
 
 // ------------------------------------------------
 // FreeListManyCachedFastPathBase implementation
 
-FreeSpace FreeListManyCachedFastPathBase::Allocate(size_t size_in_bytes,
-                                                   size_t* node_size,
-                                                   AllocationOrigin origin) {
+Tagged<FreeSpace> FreeListManyCachedFastPathBase::Allocate(
+    size_t size_in_bytes, size_t* node_size, AllocationOrigin origin) {
   USE(origin);
   DCHECK_GE(kMaxBlockSize, size_in_bytes);
-  FreeSpace node;
+  Tagged<FreeSpace> node;
 
   // Fast path part 1: searching the last categories
   FreeListCategoryType first_category =
@@ -404,16 +410,16 @@ FreeSpace FreeListManyCachedFastPathBase::Allocate(size_t size_in_bytes,
   CheckCacheIntegrity();
 #endif
 
-  DCHECK(IsVeryLong() || Available() == SumFreeLists());
+  VerifyAvailable();
   return node;
 }
 
 // ------------------------------------------------
 // FreeListManyCachedOrigin implementation
 
-FreeSpace FreeListManyCachedOrigin::Allocate(size_t size_in_bytes,
-                                             size_t* node_size,
-                                             AllocationOrigin origin) {
+Tagged<FreeSpace> FreeListManyCachedOrigin::Allocate(size_t size_in_bytes,
+                                                     size_t* node_size,
+                                                     AllocationOrigin origin) {
   if (origin == AllocationOrigin::kGC) {
     return FreeListManyCached::Allocate(size_in_bytes, node_size, origin);
   } else {
@@ -505,27 +511,27 @@ void FreeList::PrintCategories(FreeListCategoryType type) {
 
 size_t FreeListCategory::SumFreeList() {
   size_t sum = 0;
-  FreeSpace cur = top();
+  Tagged<FreeSpace> cur = top();
   while (!cur.is_null()) {
     // We can't use "cur->map()" here because both cur's map and the
     // root can be null during bootstrapping.
     DCHECK(
-        cur.map_slot().contains_map_value(Page::FromHeapObject(cur)
-                                              ->heap()
-                                              ->isolate()
-                                              ->root(RootIndex::kFreeSpaceMap)
-                                              .ptr()));
-    sum += cur.size(kRelaxedLoad);
-    cur = cur.next();
+        cur->map_slot().contains_map_value(Page::FromHeapObject(cur)
+                                               ->heap()
+                                               ->isolate()
+                                               ->root(RootIndex::kFreeSpaceMap)
+                                               .ptr()));
+    sum += cur->size(kRelaxedLoad);
+    cur = cur->next();
   }
   return sum;
 }
 int FreeListCategory::FreeListLength() {
   int length = 0;
-  FreeSpace cur = top();
+  Tagged<FreeSpace> cur = top();
   while (!cur.is_null()) {
     length++;
-    cur = cur.next();
+    cur = cur->next();
   }
   return length;
 }
diff --git a/deps/v8/src/heap/free-list.h b/deps/v8/src/heap/free-list.h
index 147c93e56ca422..374ee3a2ba1549 100644
--- a/deps/v8/src/heap/free-list.h
+++ b/deps/v8/src/heap/free-list.h
@@ -59,18 +59,18 @@ class FreeListCategory {
   // category is currently unlinked.
   void Relink(FreeList* owner);
 
-  void Free(Address address, size_t size_in_bytes, FreeMode mode,
+  void Free(Address start, size_t size_in_bytes, FreeMode mode,
             FreeList* owner);
 
   // Performs a single try to pick a node of at least |minimum_size| from the
   // category. Stores the actual size in |node_size|. Returns nullptr if no
   // node is found.
-  V8_EXPORT_PRIVATE FreeSpace PickNodeFromList(size_t minimum_size,
-                                               size_t* node_size);
+  V8_EXPORT_PRIVATE Tagged<FreeSpace> PickNodeFromList(size_t minimum_size,
+                                                       size_t* node_size);
 
   // Picks a node of at least |minimum_size| from the category. Stores the
   // actual size in |node_size|. Returns nullptr if no node is found.
-  FreeSpace SearchForNodeInList(size_t minimum_size, size_t* node_size);
+  Tagged<FreeSpace> SearchForNodeInList(size_t minimum_size, size_t* node_size);
 
   inline bool is_linked(FreeList* owner) const;
   bool is_empty() { return top().is_null(); }
@@ -81,8 +81,8 @@ class FreeListCategory {
 
   template <typename Callback>
   void IterateNodesForTesting(Callback callback) {
-    for (FreeSpace cur_node = top(); !cur_node.is_null();
-         cur_node = cur_node.next()) {
+    for (Tagged<FreeSpace> cur_node = top(); !cur_node.is_null();
+         cur_node = cur_node->next()) {
       callback(cur_node);
     }
   }
@@ -96,8 +96,8 @@ class FreeListCategory {
   // allocation of size |allocation_size|.
   inline void UpdateCountersAfterAllocation(size_t allocation_size);
 
-  FreeSpace top() { return top_; }
-  void set_top(FreeSpace top) { top_ = top; }
+  Tagged<FreeSpace> top() { return top_; }
+  void set_top(Tagged<FreeSpace> top) { top_ = top; }
   FreeListCategory* prev() { return prev_; }
   void set_prev(FreeListCategory* prev) { prev_ = prev; }
   FreeListCategory* next() { return next_; }
@@ -132,9 +132,10 @@ class FreeListCategory {
 class FreeList {
  public:
   // Creates a Freelist of the default class.
-  V8_EXPORT_PRIVATE static FreeList* CreateFreeList();
+  V8_EXPORT_PRIVATE static std::unique_ptr<FreeList> CreateFreeList();
   // Creates a Freelist for new space.
-  V8_EXPORT_PRIVATE static FreeList* CreateFreeListForNewSpace();
+  V8_EXPORT_PRIVATE static std::unique_ptr<FreeList>
+  CreateFreeListForNewSpace();
 
   virtual ~FreeList() = default;
 
@@ -154,9 +155,8 @@ class FreeList {
   // bytes. Returns the actual node size in node_size which can be bigger than
   // size_in_bytes. This method returns null if the allocation request cannot be
   // handled by the free list.
-  virtual V8_WARN_UNUSED_RESULT FreeSpace Allocate(size_t size_in_bytes,
-                                                   size_t* node_size,
-                                                   AllocationOrigin origin) = 0;
+  virtual V8_WARN_UNUSED_RESULT Tagged<FreeSpace> Allocate(
+      size_t size_in_bytes, size_t* node_size, AllocationOrigin origin) = 0;
 
   // Returns a page containing an entry for a given type, or nullptr otherwise.
   V8_EXPORT_PRIVATE virtual Page* GetPageForSize(size_t size_in_bytes) = 0;
@@ -165,7 +165,7 @@ class FreeList {
 
   // Return the number of bytes available on the free list.
   size_t Available() {
-    DCHECK(available_ == SumFreeLists());
+    VerifyAvailable();
     return available_;
   }
 
@@ -173,13 +173,11 @@ class FreeList {
   void IncreaseAvailableBytes(size_t bytes) { available_ += bytes; }
   void DecreaseAvailableBytes(size_t bytes) { available_ -= bytes; }
 
-  bool IsEmpty() {
-    bool empty = true;
-    ForAllFreeListCategories([&empty](FreeListCategory* category) {
-      if (!category->is_empty()) empty = false;
-    });
-    return empty;
-  }
+  size_t wasted_bytes() const { return wasted_bytes_; }
+  void increase_wasted_bytes(size_t bytes) { wasted_bytes_ += bytes; }
+  void decrease_wasted_bytes(size_t bytes) { wasted_bytes_ -= bytes; }
+
+  inline bool IsEmpty();
 
   // Used after booting the VM.
   void RepairLists(Heap* heap);
@@ -189,8 +187,6 @@ class FreeList {
   int number_of_categories() { return number_of_categories_; }
   FreeListCategoryType last_category() { return last_category_; }
 
-  size_t wasted_bytes() { return wasted_bytes_; }
-
   size_t min_block_size() const { return min_block_size_; }
 
   template <typename Callback>
@@ -235,18 +231,22 @@ class FreeList {
 
 #ifdef DEBUG
   V8_EXPORT_PRIVATE size_t SumFreeLists();
-  bool IsVeryLong();
+  V8_EXPORT_PRIVATE bool IsVeryLong();
 #endif
 
+  void VerifyAvailable() {
+    DCHECK(IsVeryLong() || available_ == SumFreeLists());
+  }
+
   // Tries to retrieve a node from the first category in a given |type|.
   // Returns nullptr if the category is empty or the top entry is smaller
   // than minimum_size.
-  FreeSpace TryFindNodeIn(FreeListCategoryType type, size_t minimum_size,
-                          size_t* node_size);
+  Tagged<FreeSpace> TryFindNodeIn(FreeListCategoryType type,
+                                  size_t minimum_size, size_t* node_size);
 
   // Searches a given |type| for a node of at least |minimum_size|.
-  FreeSpace SearchForNodeInList(FreeListCategoryType type, size_t minimum_size,
-                                size_t* node_size);
+  Tagged<FreeSpace> SearchForNodeInList(FreeListCategoryType type,
+                                        size_t minimum_size, size_t* node_size);
 
   // Returns the smallest category in which an object of |size_in_bytes| could
   // fit.
@@ -263,11 +263,13 @@ class FreeList {
   FreeListCategoryType last_category_ = 0;
   size_t min_block_size_ = 0;
 
-  std::atomic<size_t> wasted_bytes_{0};
   FreeListCategory** categories_ = nullptr;
 
-  // |available_|: The number of bytes in this freelist.
+  // The number of bytes in this freelist that are available for allocation.
   size_t available_ = 0;
+  // Number of wasted bytes in this free list that are not available for
+  // allocation.
+  size_t wasted_bytes_ = 0;
 
   friend class FreeListCategory;
   friend class Page;
@@ -276,31 +278,6 @@ class FreeList {
   friend class MapSpace;
 };
 
-// FreeList used for spaces that don't have freelists
-// (only the LargeObject space for now).
-class NoFreeList final : public FreeList {
- public:
-  size_t GuaranteedAllocatable(size_t maximum_freed) final {
-    FATAL("NoFreeList can't be used as a standard FreeList. ");
-  }
-  size_t Free(Address start, size_t size_in_bytes, FreeMode mode) final {
-    FATAL("NoFreeList can't be used as a standard FreeList.");
-  }
-  V8_WARN_UNUSED_RESULT FreeSpace Allocate(size_t size_in_bytes,
-                                           size_t* node_size,
-                                           AllocationOrigin origin) final {
-    FATAL("NoFreeList can't be used as a standard FreeList.");
-  }
-  Page* GetPageForSize(size_t size_in_bytes) final {
-    FATAL("NoFreeList can't be used as a standard FreeList.");
-  }
-
- private:
-  FreeListCategoryType SelectFreeListCategoryType(size_t size_in_bytes) final {
-    FATAL("NoFreeList can't be used as a standard FreeList.");
-  }
-};
-
 // Use 24 Freelists: on per 16 bytes between 24 and 256, and then a few ones for
 // larger sizes. See the variable |categories_min| for the size of each
 // Freelist.  Allocation is done using a best-fit strategy (considering only the
@@ -316,9 +293,9 @@ class V8_EXPORT_PRIVATE FreeListMany : public FreeList {
   FreeListMany();
   ~FreeListMany() override;
 
-  V8_WARN_UNUSED_RESULT FreeSpace Allocate(size_t size_in_bytes,
-                                           size_t* node_size,
-                                           AllocationOrigin origin) override;
+  V8_WARN_UNUSED_RESULT Tagged<FreeSpace> Allocate(
+      size_t size_in_bytes, size_t* node_size,
+      AllocationOrigin origin) override;
 
  protected:
   static const size_t kMinBlockSize = 3 * kTaggedSize;
@@ -372,9 +349,9 @@ class V8_EXPORT_PRIVATE FreeListManyCached : public FreeListMany {
  public:
   FreeListManyCached();
 
-  V8_WARN_UNUSED_RESULT FreeSpace Allocate(size_t size_in_bytes,
-                                           size_t* node_size,
-                                           AllocationOrigin origin) override;
+  V8_WARN_UNUSED_RESULT Tagged<FreeSpace> Allocate(
+      size_t size_in_bytes, size_t* node_size,
+      AllocationOrigin origin) override;
 
   size_t Free(Address start, size_t size_in_bytes, FreeMode mode) override;
 
@@ -452,16 +429,16 @@ class V8_EXPORT_PRIVATE FreeListManyCachedFastPathBase
  public:
   enum class SmallBlocksMode { kAllow, kProhibit };
 
-  FreeListManyCachedFastPathBase(SmallBlocksMode small_blocks_mode)
+  explicit FreeListManyCachedFastPathBase(SmallBlocksMode small_blocks_mode)
       : small_blocks_mode_(small_blocks_mode) {
     if (small_blocks_mode_ == SmallBlocksMode::kProhibit) {
       min_block_size_ = kFastPathStart;
     }
   }
 
-  V8_WARN_UNUSED_RESULT FreeSpace Allocate(size_t size_in_bytes,
-                                           size_t* node_size,
-                                           AllocationOrigin origin) override;
+  V8_WARN_UNUSED_RESULT Tagged<FreeSpace> Allocate(
+      size_t size_in_bytes, size_t* node_size,
+      AllocationOrigin origin) override;
 
  protected:
   // Objects in the 18th category are at least 2048 bytes
@@ -523,9 +500,9 @@ class FreeListManyCachedFastPathForNewSpace
 class V8_EXPORT_PRIVATE FreeListManyCachedOrigin
     : public FreeListManyCachedFastPath {
  public:
-  V8_WARN_UNUSED_RESULT FreeSpace Allocate(size_t size_in_bytes,
-                                           size_t* node_size,
-                                           AllocationOrigin origin) override;
+  V8_WARN_UNUSED_RESULT Tagged<FreeSpace> Allocate(
+      size_t size_in_bytes, size_t* node_size,
+      AllocationOrigin origin) override;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/gc-callbacks.h b/deps/v8/src/heap/gc-callbacks.h
index 448ab6549bd576..ae96c44818a73a 100644
--- a/deps/v8/src/heap/gc-callbacks.h
+++ b/deps/v8/src/heap/gc-callbacks.h
@@ -11,36 +11,30 @@
 
 #include "include/v8-callbacks.h"
 #include "src/base/logging.h"
+#include "src/common/assert-scope.h"
 
 namespace v8::internal {
 
-template <typename IsolateType, typename InvokeScope>
 class GCCallbacks final {
  public:
-  using CallbackType = void (*)(IsolateType*, GCType, GCCallbackFlags, void*);
+  using CallbackType = void (*)(v8::Isolate*, GCType, GCCallbackFlags, void*);
 
-  constexpr GCCallbacks() = default;
-
-  void Add(CallbackType callback, IsolateType* isolate, GCType gc_type,
+  void Add(CallbackType callback, v8::Isolate* isolate, GCType gc_type,
            void* data) {
     DCHECK_NOT_NULL(callback);
-    DCHECK_EQ(callbacks_.end(),
-              std::find(callbacks_.begin(), callbacks_.end(),
-                        CallbackData{callback, isolate, gc_type, data}));
+    DCHECK_EQ(callbacks_.end(), FindCallback(callback, data));
     callbacks_.emplace_back(callback, isolate, gc_type, data);
   }
 
   void Remove(CallbackType callback, void* data) {
-    auto it =
-        std::find(callbacks_.begin(), callbacks_.end(),
-                  CallbackData{callback, nullptr, GCType::kGCTypeAll, data});
+    auto it = FindCallback(callback, data);
     DCHECK_NE(callbacks_.end(), it);
     *it = callbacks_.back();
     callbacks_.pop_back();
   }
 
   void Invoke(GCType gc_type, GCCallbackFlags gc_callback_flags) const {
-    InvokeScope scope;
+    AllowGarbageCollection scope;
     for (const CallbackData& callback_data : callbacks_) {
       if (gc_type & callback_data.gc_type) {
         callback_data.callback(callback_data.isolate, gc_type,
@@ -53,23 +47,79 @@ class GCCallbacks final {
 
  private:
   struct CallbackData final {
-    CallbackData(CallbackType callback, IsolateType* isolate, GCType gc_type,
+    CallbackData(CallbackType callback, v8::Isolate* isolate, GCType gc_type,
                  void* user_data)
         : callback(callback),
           isolate(isolate),
           gc_type(gc_type),
           user_data(user_data) {}
 
-    bool operator==(const CallbackData& other) const {
-      return callback == other.callback && user_data == other.user_data;
+    CallbackType callback;
+    v8::Isolate* isolate;
+    GCType gc_type;
+    void* user_data;
+  };
+
+  std::vector<CallbackData>::iterator FindCallback(CallbackType callback,
+                                                   void* data) {
+    return std::find_if(callbacks_.begin(), callbacks_.end(),
+                        [callback, data](CallbackData& callback_data) {
+                          return callback_data.callback == callback &&
+                                 callback_data.user_data == data;
+                        });
+  }
+
+  std::vector<CallbackData> callbacks_;
+};
+
+class GCCallbacksInSafepoint final {
+ public:
+  using CallbackType = void (*)(void*);
+
+  enum GCType { kLocal = 1 << 0, kShared = 1 << 1, kAll = kLocal | kShared };
+
+  void Add(CallbackType callback, void* data, GCType gc_type) {
+    DCHECK_NOT_NULL(callback);
+    DCHECK_EQ(callbacks_.end(), FindCallback(callback, data));
+    callbacks_.emplace_back(callback, data, gc_type);
+  }
+
+  void Remove(CallbackType callback, void* data) {
+    auto it = FindCallback(callback, data);
+    DCHECK_NE(callbacks_.end(), it);
+    *it = callbacks_.back();
+    callbacks_.pop_back();
+  }
+
+  void Invoke(GCType gc_type) const {
+    DisallowGarbageCollection scope;
+    for (const CallbackData& callback_data : callbacks_) {
+      if (callback_data.gc_type_ & gc_type)
+        callback_data.callback(callback_data.user_data);
     }
+  }
+
+  bool IsEmpty() const { return callbacks_.empty(); }
+
+ private:
+  struct CallbackData final {
+    CallbackData(CallbackType callback, void* user_data, GCType gc_type)
+        : callback(callback), user_data(user_data), gc_type_(gc_type) {}
 
     CallbackType callback;
-    IsolateType* isolate;
-    GCType gc_type;
     void* user_data;
+    GCType gc_type_;
   };
 
+  std::vector<CallbackData>::iterator FindCallback(CallbackType callback,
+                                                   void* data) {
+    return std::find_if(callbacks_.begin(), callbacks_.end(),
+                        [callback, data](CallbackData& callback_data) {
+                          return callback_data.callback == callback &&
+                                 callback_data.user_data == data;
+                        });
+  }
+
   std::vector<CallbackData> callbacks_;
 };
 
diff --git a/deps/v8/src/heap/gc-idle-time-handler.cc b/deps/v8/src/heap/gc-idle-time-handler.cc
index 7700dc29c2c21f..892fbd8dd3b6d5 100644
--- a/deps/v8/src/heap/gc-idle-time-handler.cc
+++ b/deps/v8/src/heap/gc-idle-time-handler.cc
@@ -10,28 +10,11 @@
 namespace v8 {
 namespace internal {
 
-const double GCIdleTimeHandler::kConservativeTimeRatio = 0.9;
-
 void GCIdleTimeHeapState::Print() {
   PrintF("size_of_objects=%zu ", size_of_objects);
   PrintF("incremental_marking_stopped=%d ", incremental_marking_stopped);
 }
 
-size_t GCIdleTimeHandler::EstimateMarkingStepSize(
-    double idle_time_in_ms, double marking_speed_in_bytes_per_ms) {
-  DCHECK_LT(0, idle_time_in_ms);
-
-  if (marking_speed_in_bytes_per_ms == 0) {
-    marking_speed_in_bytes_per_ms = kInitialConservativeMarkingSpeed;
-  }
-
-  double marking_step_size = marking_speed_in_bytes_per_ms * idle_time_in_ms;
-  if (marking_step_size >= kMaximumMarkingStepSize) {
-    return kMaximumMarkingStepSize;
-  }
-  return static_cast<size_t>(marking_step_size * kConservativeTimeRatio);
-}
-
 // The following logic is implemented by the controller:
 // (1) If we don't have any idle time, do nothing, unless a context was
 // disposed, incremental marking is stopped, and the heap is small. Then do
diff --git a/deps/v8/src/heap/gc-idle-time-handler.h b/deps/v8/src/heap/gc-idle-time-handler.h
index 163318f28b2f1c..a2bf044bc150e7 100644
--- a/deps/v8/src/heap/gc-idle-time-handler.h
+++ b/deps/v8/src/heap/gc-idle-time-handler.h
@@ -28,21 +28,6 @@ class GCIdleTimeHeapState {
 // operations are executing during IdleNotification.
 class V8_EXPORT_PRIVATE GCIdleTimeHandler {
  public:
-  // If we haven't recorded any incremental marking events yet, we carefully
-  // mark with a conservative lower bound for the marking speed.
-  static const size_t kInitialConservativeMarkingSpeed = 100 * KB;
-
-  // Maximum marking step size returned by EstimateMarkingStepSize.
-  static const size_t kMaximumMarkingStepSize = 700 * MB;
-
-  // We have to make sure that we finish the IdleNotification before
-  // idle_time_in_ms. Hence, we conservatively prune our workload estimate.
-  static const double kConservativeTimeRatio;
-
-  // This is the maximum scheduled idle time. Note that it can be more than
-  // 16.66 ms when there is currently no rendering going on.
-  static const size_t kMaxScheduledIdleTime = 50;
-
   GCIdleTimeHandler() = default;
   GCIdleTimeHandler(const GCIdleTimeHandler&) = delete;
   GCIdleTimeHandler& operator=(const GCIdleTimeHandler&) = delete;
@@ -52,9 +37,6 @@ class V8_EXPORT_PRIVATE GCIdleTimeHandler {
 
   bool Enabled();
 
-  static size_t EstimateMarkingStepSize(double idle_time_in_ms,
-                                        double marking_speed_in_bytes_per_ms);
-
   static double EstimateFinalIncrementalMarkCompactTime(
       size_t size_of_objects, double mark_compact_speed_in_bytes_per_ms);
 };
diff --git a/deps/v8/src/heap/gc-tracer-inl.h b/deps/v8/src/heap/gc-tracer-inl.h
index 2b97360270ee21..ee4563ff87e913 100644
--- a/deps/v8/src/heap/gc-tracer-inl.h
+++ b/deps/v8/src/heap/gc-tracer-inl.h
@@ -5,6 +5,7 @@
 #ifndef V8_HEAP_GC_TRACER_INL_H_
 #define V8_HEAP_GC_TRACER_INL_H_
 
+#include "src/base/logging.h"
 #include "src/base/platform/platform.h"
 #include "src/execution/isolate.h"
 #include "src/heap/gc-tracer.h"
@@ -13,33 +14,28 @@
 namespace v8 {
 namespace internal {
 
-GCTracer::IncrementalMarkingInfos::IncrementalMarkingInfos()
-    : duration(0), longest_step(0), steps(0) {}
-
-void GCTracer::IncrementalMarkingInfos::Update(double delta) {
+constexpr GCTracer::IncrementalInfos& GCTracer::IncrementalInfos::operator+=(
+    base::TimeDelta delta) {
   steps++;
   duration += delta;
   if (delta > longest_step) {
     longest_step = delta;
   }
-}
-
-void GCTracer::IncrementalMarkingInfos::ResetCurrentCycle() {
-  duration = 0;
-  longest_step = 0;
-  steps = 0;
+  return *this;
 }
 
 GCTracer::Scope::Scope(GCTracer* tracer, ScopeId scope, ThreadKind thread_kind)
     : tracer_(tracer),
       scope_(scope),
       thread_kind_(thread_kind),
-      start_time_(tracer_->MonotonicallyIncreasingTimeInMs()) {
+      start_time_(base::TimeTicks::Now()) {
+  DCHECK_IMPLIES(
+      thread_kind_ == ThreadKind::kMain,
+      tracer_->heap_->IsMainThread() || tracer_->heap_->IsSharedMainThread());
+
 #ifdef V8_RUNTIME_CALL_STATS
   if (V8_LIKELY(!TracingFlags::is_runtime_stats_enabled())) return;
   if (thread_kind_ == ThreadKind::kMain) {
-    DCHECK(tracer_->heap_->IsMainThread() ||
-           tracer_->heap_->IsSharedMainThread());
     runtime_stats_ = tracer_->heap_->isolate_->counters()->runtime_call_stats();
     runtime_stats_->Enter(&timer_, GCTracer::RCSCounterFromScope(scope));
   } else {
@@ -52,20 +48,17 @@ GCTracer::Scope::Scope(GCTracer* tracer, ScopeId scope, ThreadKind thread_kind)
 }
 
 GCTracer::Scope::~Scope() {
-  double duration_ms = tracer_->MonotonicallyIncreasingTimeInMs() - start_time_;
-  tracer_->AddScopeSample(scope_, duration_ms);
+  const base::TimeDelta duration = base::TimeTicks::Now() - start_time_;
+  tracer_->AddScopeSample(scope_, duration);
 
   if (thread_kind_ == ThreadKind::kMain) {
-    DCHECK(tracer_->heap_->IsMainThread() ||
-           tracer_->heap_->IsSharedMainThread());
     if (scope_ == ScopeId::MC_INCREMENTAL ||
         scope_ == ScopeId::MC_INCREMENTAL_START ||
         scope_ == ScopeId::MC_INCREMENTAL_FINALIZE) {
       auto* long_task_stats =
           tracer_->heap_->isolate_->GetCurrentLongTaskStats();
       long_task_stats->gc_full_incremental_wall_clock_duration_us +=
-          static_cast<int64_t>(duration_ms *
-                               base::Time::kMicrosecondsPerMillisecond);
+          duration.InMicroseconds();
     }
   }
 
@@ -107,70 +100,33 @@ constexpr int GCTracer::Scope::IncrementalOffset(ScopeId id) {
 }
 
 constexpr bool GCTracer::Event::IsYoungGenerationEvent(Type type) {
-  DCHECK_NE(START, type);
-  return type == SCAVENGER || type == MINOR_MARK_COMPACTOR ||
-         type == INCREMENTAL_MINOR_MARK_COMPACTOR;
+  DCHECK_NE(Type::START, type);
+  return type == Type::SCAVENGER || type == Type::MINOR_MARK_SWEEPER ||
+         type == Type::INCREMENTAL_MINOR_MARK_SWEEPER;
 }
 
 CollectionEpoch GCTracer::CurrentEpoch(Scope::ScopeId id) const {
   return Scope::NeedsYoungEpoch(id) ? epoch_young_ : epoch_full_;
 }
 
-#ifdef DEBUG
-bool GCTracer::IsInObservablePause() const {
-  return 0.0 < start_of_observable_pause_;
-}
-
-bool GCTracer::IsInAtomicPause() const {
-  return current_.state == Event::State::ATOMIC;
+double GCTracer::current_scope(Scope::ScopeId id) const {
+  DCHECK_GT(Scope::NUMBER_OF_SCOPES, id);
+  return current_.scopes[id].InMillisecondsF();
 }
 
-bool GCTracer::IsConsistentWithCollector(GarbageCollector collector) const {
-  return (collector == GarbageCollector::SCAVENGER &&
-          current_.type == Event::SCAVENGER) ||
-         (collector == GarbageCollector::MINOR_MARK_COMPACTOR &&
-          (current_.type == Event::MINOR_MARK_COMPACTOR ||
-           current_.type == Event::INCREMENTAL_MINOR_MARK_COMPACTOR)) ||
-         (collector == GarbageCollector::MARK_COMPACTOR &&
-          (current_.type == Event::MARK_COMPACTOR ||
-           current_.type == Event::INCREMENTAL_MARK_COMPACTOR));
-}
-
-bool GCTracer::IsSweepingInProgress() const {
-  return (current_.type == Event::MARK_COMPACTOR ||
-          current_.type == Event::INCREMENTAL_MARK_COMPACTOR ||
-          current_.type == Event::MINOR_MARK_COMPACTOR ||
-          current_.type == Event::INCREMENTAL_MINOR_MARK_COMPACTOR) &&
-         current_.state == Event::State::SWEEPING;
-}
-#endif
-
-constexpr double GCTracer::current_scope(Scope::ScopeId id) const {
-  if (Scope::FIRST_INCREMENTAL_SCOPE <= id &&
-      id <= Scope::LAST_INCREMENTAL_SCOPE) {
-    return incremental_scope(id).duration;
-  } else if (Scope::FIRST_BACKGROUND_SCOPE <= id &&
-             id <= Scope::LAST_BACKGROUND_SCOPE) {
-    return background_counter_[id].total_duration_ms;
-  } else {
-    DCHECK_GT(Scope::NUMBER_OF_SCOPES, id);
-    return current_.scopes[id];
-  }
-}
-
-constexpr const GCTracer::IncrementalMarkingInfos& GCTracer::incremental_scope(
+constexpr const GCTracer::IncrementalInfos& GCTracer::incremental_scope(
     Scope::ScopeId id) const {
   return incremental_scopes_[Scope::IncrementalOffset(id)];
 }
 
-void GCTracer::AddScopeSample(Scope::ScopeId id, double duration) {
+void GCTracer::AddScopeSample(Scope::ScopeId id, base::TimeDelta duration) {
   if (Scope::FIRST_INCREMENTAL_SCOPE <= id &&
       id <= Scope::LAST_INCREMENTAL_SCOPE) {
-    incremental_scopes_[Scope::IncrementalOffset(id)].Update(duration);
+    incremental_scopes_[Scope::IncrementalOffset(id)] += duration;
   } else if (Scope::FIRST_BACKGROUND_SCOPE <= id &&
              id <= Scope::LAST_BACKGROUND_SCOPE) {
-    base::MutexGuard guard(&background_counter_mutex_);
-    background_counter_[id].total_duration_ms += duration;
+    base::MutexGuard guard(&background_scopes_mutex_);
+    background_scopes_[id] += duration;
   } else {
     DCHECK_GT(Scope::NUMBER_OF_SCOPES, id);
     current_.scopes[id] += duration;
@@ -190,15 +146,6 @@ RuntimeCallCounterId GCTracer::RCSCounterFromScope(Scope::ScopeId id) {
 }
 #endif  // defined(V8_RUNTIME_CALL_STATS)
 
-double GCTracer::MonotonicallyIncreasingTimeInMs() {
-  if (V8_UNLIKELY(v8_flags.predictable)) {
-    return heap_->MonotonicallyIncreasingTimeInMs();
-  } else {
-    return base::TimeTicks::Now().ToInternalValue() /
-           static_cast<double>(base::Time::kMicrosecondsPerMillisecond);
-  }
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/gc-tracer.cc b/deps/v8/src/heap/gc-tracer.cc
index db450fc3738eb8..15eea500e072f3 100644
--- a/deps/v8/src/heap/gc-tracer.cc
+++ b/deps/v8/src/heap/gc-tracer.cc
@@ -8,6 +8,9 @@
 
 #include "include/v8-metrics.h"
 #include "src/base/atomic-utils.h"
+#include "src/base/logging.h"
+#include "src/base/optional.h"
+#include "src/base/platform/time.h"
 #include "src/base/strings.h"
 #include "src/common/globals.h"
 #include "src/execution/thread-id.h"
@@ -17,6 +20,7 @@
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap.h"
 #include "src/heap/incremental-marking.h"
+#include "src/heap/memory-balancer.h"
 #include "src/heap/spaces.h"
 #include "src/logging/counters.h"
 #include "src/logging/metrics.h"
@@ -38,11 +42,30 @@ static size_t CountTotalHolesSize(Heap* heap) {
 }
 
 namespace {
+
 std::atomic<CollectionEpoch> global_epoch{0};
 
 CollectionEpoch next_epoch() {
   return global_epoch.fetch_add(1, std::memory_order_relaxed) + 1;
 }
+
+using BytesAndDuration = ::heap::base::BytesAndDuration;
+
+double BoundedAverageSpeed(
+    const base::RingBuffer<BytesAndDuration>& buffer,
+    const BytesAndDuration& initial,
+    v8::base::Optional<v8::base::TimeDelta> selected_duration) {
+  constexpr size_t kMinNonEmptySpeedInBytesPerMs = 1;
+  constexpr size_t kMaxSpeedInBytesPerMs = GB;
+  return ::heap::base::AverageSpeed(buffer, initial, selected_duration,
+                                    kMinNonEmptySpeedInBytesPerMs,
+                                    kMaxSpeedInBytesPerMs);
+}
+
+double BoundedAverageSpeed(const base::RingBuffer<BytesAndDuration>& buffer) {
+  return BoundedAverageSpeed(buffer, BytesAndDuration(), base::nullopt);
+}
+
 }  // namespace
 
 GCTracer::Event::Event(Type type, State state,
@@ -51,192 +74,135 @@ GCTracer::Event::Event(Type type, State state,
     : type(type),
       state(state),
       gc_reason(gc_reason),
-      collector_reason(collector_reason),
-      start_time(0.0),
-      end_time(0.0),
-      reduce_memory(false),
-      start_object_size(0),
-      end_object_size(0),
-      start_memory_size(0),
-      end_memory_size(0),
-      start_holes_size(0),
-      end_holes_size(0),
-      young_object_size(0),
-      survived_young_object_size(0),
-      incremental_marking_bytes(0),
-      incremental_marking_duration(0.0) {
-  for (int i = 0; i < Scope::NUMBER_OF_SCOPES; i++) {
-    scopes[i] = 0;
-  }
-}
+      collector_reason(collector_reason) {}
 
-const char* GCTracer::Event::TypeName(bool short_name) const {
+const char* ToString(GCTracer::Event::Type type, bool short_name) {
   switch (type) {
-    case SCAVENGER:
+    case GCTracer::Event::Type::SCAVENGER:
       return (short_name) ? "s" : "Scavenge";
-    case MARK_COMPACTOR:
-    case INCREMENTAL_MARK_COMPACTOR:
+    case GCTracer::Event::Type::MARK_COMPACTOR:
+    case GCTracer::Event::Type::INCREMENTAL_MARK_COMPACTOR:
       return (short_name) ? "mc" : "Mark-Compact";
-    case MINOR_MARK_COMPACTOR:
-    case INCREMENTAL_MINOR_MARK_COMPACTOR:
-      return (short_name) ? "mmc" : "Minor Mark-Compact";
-    case START:
+    case GCTracer::Event::Type::MINOR_MARK_SWEEPER:
+    case GCTracer::Event::Type::INCREMENTAL_MINOR_MARK_SWEEPER:
+      return (short_name) ? "mms" : "Minor Mark-Sweep";
+    case GCTracer::Event::Type::START:
       return (short_name) ? "st" : "Start";
   }
-  return "Unknown Event Type";
 }
 
-GCTracer::RecordGCPhasesInfo::RecordGCPhasesInfo(Heap* heap,
-                                                 GarbageCollector collector) {
+GCTracer::RecordGCPhasesInfo::RecordGCPhasesInfo(
+    Heap* heap, GarbageCollector collector, GarbageCollectionReason reason) {
   if (Heap::IsYoungGenerationCollector(collector)) {
     type_timer_ = nullptr;
     type_priority_timer_ = nullptr;
-    if (!v8_flags.minor_mc) {
+    if (!v8_flags.minor_ms) {
       mode_ = Mode::Scavenger;
       trace_event_name_ = "V8.GCScavenger";
     } else {
       mode_ = Mode::None;
-      trace_event_name_ = "V8.GCMinorMC";
+      trace_event_name_ = "V8.GCMinorMS";
     }
   } else {
     DCHECK_EQ(GarbageCollector::MARK_COMPACTOR, collector);
     Counters* counters = heap->isolate()->counters();
     const bool in_background = heap->isolate()->IsIsolateInBackground();
-    if (heap->incremental_marking()->IsStopped()) {
-      mode_ = Mode::None;
-      type_timer_ = counters->gc_compactor();
-      type_priority_timer_ = in_background
-                                 ? counters->gc_compactor_background()
-                                 : counters->gc_compactor_foreground();
-      trace_event_name_ = "V8.GCCompactor";
-    } else if (heap->ShouldReduceMemory()) {
-      mode_ = Mode::None;
-      type_timer_ = counters->gc_finalize_reduce_memory();
-      type_priority_timer_ =
-          in_background ? counters->gc_finalize_reduce_memory_background()
-                        : counters->gc_finalize_reduce_memory_foreground();
-      trace_event_name_ = "V8.GCFinalizeMCReduceMemory";
-    } else {
-      if (heap->incremental_marking()->IsMarking() &&
-          heap->incremental_marking()
-              ->local_marking_worklists()
-              ->IsPerContextMode()) {
-        mode_ = Mode::None;
-        type_timer_ = counters->gc_finalize_measure_memory();
+    const bool is_incremental = !heap->incremental_marking()->IsStopped();
+    mode_ = Mode::None;
+    // The following block selects histogram counters to emit. The trace event
+    // name should be changed when metrics are updated.
+    //
+    // Memory reducing GCs take priority over memory measurement GCs. They can
+    // happen at the same time when measuring memory is folded into a memory
+    // reducing GC.
+    if (is_incremental) {
+      if (heap->ShouldReduceMemory()) {
+        type_timer_ = counters->gc_finalize_incremental_memory_reducing();
+        type_priority_timer_ =
+            in_background
+                ? counters->gc_finalize_incremental_memory_reducing_background()
+                : counters
+                      ->gc_finalize_incremental_memory_reducing_foreground();
+        trace_event_name_ = "V8.GCFinalizeMCReduceMemory";
+      } else if (reason == GarbageCollectionReason::kMeasureMemory) {
+        type_timer_ = counters->gc_finalize_incremental_memory_measure();
+        type_priority_timer_ =
+            in_background
+                ? counters->gc_finalize_incremental_memory_measure_background()
+                : counters->gc_finalize_incremental_memory_measure_foreground();
         trace_event_name_ = "V8.GCFinalizeMCMeasureMemory";
       } else {
-        mode_ = Mode::Finalize;
-        type_timer_ = counters->gc_finalize();
+        type_timer_ = counters->gc_finalize_incremental_regular();
+        type_priority_timer_ =
+            in_background
+                ? counters->gc_finalize_incremental_regular_background()
+                : counters->gc_finalize_incremental_regular_foreground();
         trace_event_name_ = "V8.GCFinalizeMC";
+        mode_ = Mode::Finalize;
+      }
+    } else {
+      trace_event_name_ = "V8.GCCompactor";
+      if (heap->ShouldReduceMemory()) {
+        type_timer_ = counters->gc_finalize_non_incremental_memory_reducing();
+        type_priority_timer_ =
+            in_background
+                ? counters
+                      ->gc_finalize_non_incremental_memory_reducing_background()
+                : counters
+                      ->gc_finalize_non_incremental_memory_reducing_foreground();
+      } else if (reason == GarbageCollectionReason::kMeasureMemory) {
+        type_timer_ = counters->gc_finalize_non_incremental_memory_measure();
+        type_priority_timer_ =
+            in_background
+                ? counters
+                      ->gc_finalize_non_incremental_memory_measure_background()
+                : counters
+                      ->gc_finalize_non_incremental_memory_measure_foreground();
+      } else {
+        type_timer_ = counters->gc_finalize_non_incremental_regular();
+        type_priority_timer_ =
+            in_background
+                ? counters->gc_finalize_non_incremental_regular_background()
+                : counters->gc_finalize_non_incremental_regular_foreground();
       }
-      type_priority_timer_ = in_background ? counters->gc_finalize_background()
-                                           : counters->gc_finalize_foreground();
     }
   }
 }
 
-GCTracer::GCTracer(Heap* heap)
+GCTracer::GCTracer(Heap* heap, GarbageCollectionReason initial_gc_reason)
     : heap_(heap),
-      current_(Event::START, Event::State::NOT_RUNNING,
-               GarbageCollectionReason::kUnknown, nullptr),
+      current_(Event::Type::START, Event::State::NOT_RUNNING, initial_gc_reason,
+               nullptr),
       previous_(current_),
-      incremental_marking_bytes_(0),
-      incremental_marking_duration_(0.0),
-      incremental_marking_start_time_(0.0),
-      recorded_incremental_marking_speed_(0.0),
-      allocation_time_ms_(0.0),
-      new_space_allocation_counter_bytes_(0),
-      old_generation_allocation_counter_bytes_(0),
-      embedder_allocation_counter_bytes_(0),
-      allocation_duration_since_gc_(0.0),
-      new_space_allocation_in_bytes_since_gc_(0),
-      old_generation_allocation_in_bytes_since_gc_(0),
-      embedder_allocation_in_bytes_since_gc_(0),
-      combined_mark_compact_speed_cache_(0.0),
-      start_counter_(0),
-      average_mutator_duration_(0),
-      average_mark_compact_duration_(0),
-      current_mark_compact_mutator_utilization_(1.0),
-      previous_mark_compact_end_time_(0) {
+      previous_mark_compact_end_time_(base::TimeTicks::Now()) {
   // All accesses to incremental_marking_scope assume that incremental marking
   // scopes come first.
   static_assert(0 == Scope::FIRST_INCREMENTAL_SCOPE);
   // We assume that MC_INCREMENTAL is the first scope so that we can properly
   // map it to RuntimeCallStats.
   static_assert(0 == Scope::MC_INCREMENTAL);
-  current_.end_time = MonotonicallyIncreasingTimeInMs();
-  for (int i = 0; i < Scope::NUMBER_OF_SCOPES; i++) {
-    background_counter_[i].total_duration_ms = 0;
-  }
-  // Check that the trace event names used in metrics code coincide with the
-  // names of the respective counters, when applicable.
-  DCHECK_EQ(0, strcmp(heap->isolate()->counters()->gc_compactor()->name(),
-                      "V8.GCCompactor"));
-  DCHECK_EQ(
-      0,
-      strcmp(heap->isolate()->counters()->gc_finalize_reduce_memory()->name(),
-             "V8.GCFinalizeMCReduceMemory"));
-  DCHECK_EQ(
-      0,
-      strcmp(heap->isolate()->counters()->gc_finalize_measure_memory()->name(),
-             "V8.GCFinalizeMCMeasureMemory"));
-  DCHECK_EQ(0, strcmp(heap->isolate()->counters()->gc_finalize()->name(),
-                      "V8.GCFinalizeMC"));
+  // Starting a new cycle will make the current event the previous event.
+  // Setting the current end time here allows us to refer back to a previous
+  // event's end time to compute time spent in mutator.
+  current_.end_time = previous_mark_compact_end_time_;
 }
 
 void GCTracer::ResetForTesting() {
-  current_ = Event(Event::START, Event::State::NOT_RUNNING,
-                   GarbageCollectionReason::kTesting, nullptr);
-  current_.end_time = MonotonicallyIncreasingTimeInMs();
-  previous_ = current_;
-  start_of_observable_pause_ = 0.0;
-  notified_full_sweeping_completed_ = false;
-  notified_full_cppgc_completed_ = false;
-  notified_young_sweeping_completed_ = false;
-  notified_young_cppgc_completed_ = false;
-  notified_young_cppgc_running_ = false;
-  young_gc_while_full_gc_ = false;
-  ResetIncrementalMarkingCounters();
-  allocation_time_ms_ = 0.0;
-  new_space_allocation_counter_bytes_ = 0.0;
-  old_generation_allocation_counter_bytes_ = 0.0;
-  allocation_duration_since_gc_ = 0.0;
-  new_space_allocation_in_bytes_since_gc_ = 0.0;
-  old_generation_allocation_in_bytes_since_gc_ = 0.0;
-  combined_mark_compact_speed_cache_ = 0.0;
-  recorded_minor_gcs_total_.Reset();
-  recorded_minor_gcs_survived_.Reset();
-  recorded_compactions_.Reset();
-  recorded_mark_compacts_.Reset();
-  recorded_incremental_mark_compacts_.Reset();
-  recorded_new_generation_allocations_.Reset();
-  recorded_old_generation_allocations_.Reset();
-  recorded_embedder_generation_allocations_.Reset();
-  recorded_survival_ratios_.Reset();
-  start_counter_ = 0;
-  average_mutator_duration_ = 0;
-  average_mark_compact_duration_ = 0;
-  current_mark_compact_mutator_utilization_ = 1.0;
-  previous_mark_compact_end_time_ = 0;
-  base::MutexGuard guard(&background_counter_mutex_);
-  for (int i = 0; i < Scope::NUMBER_OF_SCOPES; i++) {
-    background_counter_[i].total_duration_ms = 0;
-  }
+  this->~GCTracer();
+  new (this) GCTracer(heap_, GarbageCollectionReason::kTesting);
 }
 
-void GCTracer::StartObservablePause() {
-  DCHECK_EQ(0, start_counter_);
-  start_counter_++;
-
+void GCTracer::StartObservablePause(base::TimeTicks time) {
   DCHECK(!IsInObservablePause());
-  start_of_observable_pause_ = MonotonicallyIncreasingTimeInMs();
+  start_of_observable_pause_.emplace(time);
 }
 
 void GCTracer::UpdateCurrentEvent(GarbageCollectionReason gc_reason,
                                   const char* collector_reason) {
   // For incremental marking, the event has already been created and we just
   // need to update a few fields.
-  DCHECK_EQ(Event::INCREMENTAL_MARK_COMPACTOR, current_.type);
+  DCHECK(current_.type == Event::Type::INCREMENTAL_MARK_COMPACTOR ||
+         current_.type == Event::Type::INCREMENTAL_MINOR_MARK_SWEEPER);
   DCHECK_EQ(Event::State::ATOMIC, current_.state);
   DCHECK(IsInObservablePause());
   current_.gc_reason = gc_reason;
@@ -244,7 +210,7 @@ void GCTracer::UpdateCurrentEvent(GarbageCollectionReason gc_reason,
   // TODO(chromium:1154636): The start_time of the current event contains
   // currently the start time of the observable pause. This should be
   // reconsidered.
-  current_.start_time = start_of_observable_pause_;
+  current_.start_time = start_of_observable_pause_.value();
   current_.reduce_memory = heap_->ShouldReduceMemory();
 }
 
@@ -258,25 +224,32 @@ void GCTracer::StartCycle(GarbageCollector collector,
   DCHECK(!young_gc_while_full_gc_);
 
   young_gc_while_full_gc_ = current_.state != Event::State::NOT_RUNNING;
+  if (young_gc_while_full_gc_) {
+    // The cases for interruption are: Scavenger, MinorMS interrupting sweeping.
+    // In both cases we are fine with fetching background counters now and
+    // fixing them up later in StopAtomicPause().
+    FetchBackgroundCounters();
+  }
 
   DCHECK_IMPLIES(young_gc_while_full_gc_,
-                 Heap::IsYoungGenerationCollector(collector) &&
-                     !Event::IsYoungGenerationEvent(current_.type));
+                 Heap::IsYoungGenerationCollector(collector));
+  DCHECK_IMPLIES(young_gc_while_full_gc_,
+                 !Event::IsYoungGenerationEvent(current_.type));
 
   Event::Type type;
   switch (collector) {
     case GarbageCollector::SCAVENGER:
-      type = Event::SCAVENGER;
+      type = Event::Type::SCAVENGER;
       break;
-    case GarbageCollector::MINOR_MARK_COMPACTOR:
+    case GarbageCollector::MINOR_MARK_SWEEPER:
       type = marking == MarkingType::kIncremental
-                 ? Event::INCREMENTAL_MINOR_MARK_COMPACTOR
-                 : Event::MINOR_MARK_COMPACTOR;
+                 ? Event::Type::INCREMENTAL_MINOR_MARK_SWEEPER
+                 : Event::Type::MINOR_MARK_SWEEPER;
       break;
     case GarbageCollector::MARK_COMPACTOR:
       type = marking == MarkingType::kIncremental
-                 ? Event::INCREMENTAL_MARK_COMPACTOR
-                 : Event::MARK_COMPACTOR;
+                 ? Event::Type::INCREMENTAL_MARK_COMPACTOR
+                 : Event::Type::MARK_COMPACTOR;
       break;
   }
 
@@ -293,14 +266,14 @@ void GCTracer::StartCycle(GarbageCollector collector,
       // TODO(chromium:1154636): The start_time of the current event contains
       // currently the start time of the observable pause. This should be
       // reconsidered.
-      current_.start_time = start_of_observable_pause_;
+      current_.start_time = start_of_observable_pause_.value();
       current_.reduce_memory = heap_->ShouldReduceMemory();
       break;
     case MarkingType::kIncremental:
       // The current event will be updated later.
       DCHECK_IMPLIES(Heap::IsYoungGenerationCollector(collector),
-                     (v8_flags.minor_mc &&
-                      collector == GarbageCollector::MINOR_MARK_COMPACTOR));
+                     (v8_flags.minor_ms &&
+                      collector == GarbageCollector::MINOR_MARK_SWEEPER));
       DCHECK(!IsInObservablePause());
       break;
   }
@@ -331,14 +304,6 @@ void GCTracer::StartInSafepoint() {
   current_.young_object_size = new_space_size + new_lo_space_size;
 }
 
-void GCTracer::ResetIncrementalMarkingCounters() {
-  incremental_marking_bytes_ = 0;
-  incremental_marking_duration_ = 0;
-  for (int i = 0; i < Scope::NUMBER_OF_INCREMENTAL_SCOPES; i++) {
-    incremental_scopes_[i].ResetCurrentCycle();
-  }
-}
-
 void GCTracer::StopInSafepoint() {
   current_.end_object_size = heap_->SizeOfObjects();
   current_.end_memory_size = heap_->memory_allocator()->Size();
@@ -346,51 +311,82 @@ void GCTracer::StopInSafepoint() {
   current_.survived_young_object_size = heap_->SurvivedYoungObjectSize();
 }
 
-void GCTracer::StopObservablePause() {
-  start_counter_--;
-  DCHECK_EQ(0, start_counter_);
-
+void GCTracer::StopObservablePause(GarbageCollector collector,
+                                   base::TimeTicks time) {
+  DCHECK(IsConsistentWithCollector(collector));
   DCHECK(IsInObservablePause());
-  start_of_observable_pause_ = 0.0;
+  start_of_observable_pause_.reset();
 
   // TODO(chromium:1154636): The end_time of the current event contains
   // currently the end time of the observable pause. This should be
   // reconsidered.
-  current_.end_time = MonotonicallyIncreasingTimeInMs();
-}
-
-void GCTracer::UpdateStatistics(GarbageCollector collector) {
-  const bool is_young = Heap::IsYoungGenerationCollector(collector);
-  DCHECK(IsConsistentWithCollector(collector));
-
+  current_.end_time = time;
   AddAllocation(current_.end_time);
 
-  double duration = current_.end_time - current_.start_time;
-  int64_t duration_us =
-      static_cast<int64_t>(duration * base::Time::kMicrosecondsPerMillisecond);
-  auto* long_task_stats = heap_->isolate()->GetCurrentLongTaskStats();
+  FetchBackgroundCounters();
 
+  const base::TimeDelta duration = current_.end_time - current_.start_time;
+  auto* long_task_stats = heap_->isolate()->GetCurrentLongTaskStats();
+  const bool is_young = Heap::IsYoungGenerationCollector(collector);
   if (is_young) {
     recorded_minor_gcs_total_.Push(
-        MakeBytesAndDuration(current_.young_object_size, duration));
+        BytesAndDuration(current_.young_object_size, duration));
     recorded_minor_gcs_survived_.Push(
-        MakeBytesAndDuration(current_.survived_young_object_size, duration));
-    long_task_stats->gc_young_wall_clock_duration_us += duration_us;
+        BytesAndDuration(current_.survived_young_object_size, duration));
+    long_task_stats->gc_young_wall_clock_duration_us +=
+        duration.InMicroseconds();
   } else {
-    if (current_.type == Event::INCREMENTAL_MARK_COMPACTOR) {
+    DCHECK_EQ(0u, current_.incremental_marking_bytes);
+    DCHECK(current_.incremental_marking_duration.IsZero());
+    if (current_.type == Event::Type::INCREMENTAL_MARK_COMPACTOR) {
       RecordIncrementalMarkingSpeed(incremental_marking_bytes_,
                                     incremental_marking_duration_);
       recorded_incremental_mark_compacts_.Push(
-          MakeBytesAndDuration(current_.end_object_size, duration));
+          BytesAndDuration(current_.end_object_size, duration));
+      std::swap(current_.incremental_marking_bytes, incremental_marking_bytes_);
+      std::swap(current_.incremental_marking_duration,
+                incremental_marking_duration_);
+      for (int i = 0; i < Scope::NUMBER_OF_INCREMENTAL_SCOPES; i++) {
+        current_.incremental_scopes[i] = incremental_scopes_[i];
+        current_.scopes[i] = incremental_scopes_[i].duration;
+        new (&incremental_scopes_[i]) IncrementalInfos;
+      }
     } else {
       recorded_mark_compacts_.Push(
-          MakeBytesAndDuration(current_.end_object_size, duration));
+          BytesAndDuration(current_.end_object_size, duration));
+      DCHECK_EQ(0u, incremental_marking_bytes_);
+      DCHECK(incremental_marking_duration_.IsZero());
     }
-    RecordMutatorUtilization(current_.end_time,
-                             duration + incremental_marking_duration_);
     RecordGCSumCounters();
     combined_mark_compact_speed_cache_ = 0.0;
-    long_task_stats->gc_full_atomic_wall_clock_duration_us += duration_us;
+    long_task_stats->gc_full_atomic_wall_clock_duration_us +=
+        duration.InMicroseconds();
+    if (v8_flags.memory_balancer) {
+      size_t live_memory = current_.end_object_size;
+      double major_gc_bytes = current_.start_object_size +
+                              heap_->AllocatedExternalMemorySinceMarkCompact() +
+                              current_.incremental_marking_bytes;
+      const base::TimeDelta blocked_time_taken =
+          duration + current_.incremental_marking_duration;
+      const base::TimeDelta major_gc_duration =
+          blocked_time_taken + concurrent_gc_time_;
+      concurrent_gc_time_ = base::TimeDelta();
+      // Incremental gc may cause the difference to decrease, so we need to max.
+      double major_allocation_bytes = std::max<int64_t>(
+          0, current_.start_object_size - previous_.end_object_size +
+                 heap_->AllocatedExternalMemorySinceMarkCompact());
+      const base::TimeDelta major_allocation_duration =
+          (current_.end_time - previous_mark_compact_end_time_) -
+          blocked_time_taken;
+      CHECK_GT(major_allocation_duration, base::TimeDelta());
+      heap_->mb_->TracerUpdate(live_memory, major_allocation_bytes,
+                               major_allocation_duration.InMillisecondsF(),
+                               major_gc_bytes,
+                               major_gc_duration.InMillisecondsF());
+    }
+
+    RecordMutatorUtilization(current_.end_time,
+                             duration + incremental_marking_duration_);
   }
 
   heap_->UpdateTotalGCTime(duration);
@@ -409,7 +405,7 @@ void GCTracer::UpdateStatistics(GarbageCollector collector) {
 
   if (V8_UNLIKELY(TracingFlags::gc.load(std::memory_order_relaxed) &
                   v8::tracing::TracingCategoryObserver::ENABLED_BY_TRACING)) {
-    TRACE_EVENT0(TRACE_GC_CATEGORIES, "V8.GC_HEAP_DUMP_STATISTICS");
+    TRACE_GC_NOTE("V8.GC_HEAP_DUMP_STATISTICS");
     std::stringstream heap_stats;
     heap_->DumpJSONHeapStatistics(heap_stats);
 
@@ -419,31 +415,6 @@ void GCTracer::UpdateStatistics(GarbageCollector collector) {
   }
 }
 
-void GCTracer::FinalizeCurrentEvent() {
-  const bool is_young = Event::IsYoungGenerationEvent(current_.type);
-
-  if (is_young) {
-    FetchBackgroundMinorGCCounters();
-  } else {
-    if (current_.type == Event::INCREMENTAL_MARK_COMPACTOR) {
-      current_.incremental_marking_bytes = incremental_marking_bytes_;
-      current_.incremental_marking_duration = incremental_marking_duration_;
-      for (int i = 0; i < Scope::NUMBER_OF_INCREMENTAL_SCOPES; i++) {
-        current_.incremental_scopes[i] = incremental_scopes_[i];
-        current_.scopes[i] = incremental_scopes_[i].duration;
-      }
-      ResetIncrementalMarkingCounters();
-    } else {
-      DCHECK_EQ(0u, incremental_marking_bytes_);
-      DCHECK_EQ(0.0, incremental_marking_duration_);
-      DCHECK_EQ(0u, current_.incremental_marking_bytes);
-      DCHECK_EQ(0.0, current_.incremental_marking_duration);
-    }
-    FetchBackgroundMarkCompactCounters();
-  }
-  FetchBackgroundGeneralCounters();
-}
-
 void GCTracer::StopAtomicPause() {
   DCHECK_EQ(Event::State::ATOMIC, current_.state);
   current_.state = Event::State::SWEEPING;
@@ -454,7 +425,8 @@ void GCTracer::StopCycle(GarbageCollector collector) {
   current_.state = Event::State::NOT_RUNNING;
 
   DCHECK(IsConsistentWithCollector(collector));
-  FinalizeCurrentEvent();
+
+  FetchBackgroundCounters();
 
   if (Heap::IsYoungGenerationCollector(collector)) {
     ReportYoungCycleToRecorder();
@@ -497,7 +469,8 @@ void GCTracer::StopFullCycleIfNeeded() {
 void GCTracer::StopYoungCycleIfNeeded() {
   DCHECK(Event::IsYoungGenerationEvent(current_.type));
   if (current_.state != Event::State::SWEEPING) return;
-  if (current_.type == Event::MINOR_MARK_COMPACTOR &&
+  if ((current_.type == Event::Type::MINOR_MARK_SWEEPER ||
+       current_.type == Event::Type::INCREMENTAL_MINOR_MARK_SWEEPER) &&
       !notified_young_sweeping_completed_)
     return;
   // Check if young cppgc was scheduled but hasn't completed yet.
@@ -505,9 +478,9 @@ void GCTracer::StopYoungCycleIfNeeded() {
       !notified_young_cppgc_completed_)
     return;
   bool was_young_gc_while_full_gc_ = young_gc_while_full_gc_;
-  StopCycle(current_.type == Event::SCAVENGER
+  StopCycle(current_.type == Event::Type::SCAVENGER
                 ? GarbageCollector::SCAVENGER
-                : GarbageCollector::MINOR_MARK_COMPACTOR);
+                : GarbageCollector::MINOR_MARK_SWEEPER);
   notified_young_sweeping_completed_ = false;
   notified_young_cppgc_running_ = false;
   notified_young_cppgc_completed_ = false;
@@ -560,8 +533,8 @@ void GCTracer::NotifyYoungSweepingCompleted() {
   if (v8_flags.verify_heap) {
     // If heap verification is enabled, sweeping finalization can also be
     // triggered from inside a full GC cycle's atomic pause.
-    DCHECK(current_.type == Event::MINOR_MARK_COMPACTOR ||
-           current_.type == Event::INCREMENTAL_MINOR_MARK_COMPACTOR);
+    DCHECK(current_.type == Event::Type::MINOR_MARK_SWEEPER ||
+           current_.type == Event::Type::INCREMENTAL_MINOR_MARK_SWEEPER);
     DCHECK(current_.state == Event::State::SWEEPING ||
            current_.state == Event::State::ATOMIC);
   } else {
@@ -583,8 +556,8 @@ void GCTracer::NotifyFullCppGCCompleted() {
   DCHECK(metric_recorder->FullGCMetricsReportPending());
   DCHECK(!notified_full_cppgc_completed_);
   notified_full_cppgc_completed_ = true;
-  // Cppgc sweeping may finalize during MinorMC sweeping. In that case, delay
-  // stopping the cycle until the nested MinorMC cycle is stopped.
+  // Cppgc sweeping may finalize during MinorMS sweeping. In that case, delay
+  // stopping the cycle until the nested MinorMS cycle is stopped.
   if (Event::IsYoungGenerationEvent(current_.type)) {
     DCHECK(young_gc_while_full_gc_);
     return;
@@ -611,13 +584,13 @@ void GCTracer::NotifyYoungCppGCRunning() {
   notified_young_cppgc_running_ = true;
 }
 
-void GCTracer::SampleAllocation(double current_ms,
+void GCTracer::SampleAllocation(base::TimeTicks current,
                                 size_t new_space_counter_bytes,
                                 size_t old_generation_counter_bytes,
                                 size_t embedder_counter_bytes) {
-  if (allocation_time_ms_ == 0) {
+  if (!allocation_time_.has_value()) {
     // It is the first sample.
-    allocation_time_ms_ = current_ms;
+    allocation_time_.emplace(current);
     new_space_allocation_counter_bytes_ = new_space_counter_bytes;
     old_generation_allocation_counter_bytes_ = old_generation_counter_bytes;
     embedder_allocation_counter_bytes_ = embedder_counter_bytes;
@@ -631,29 +604,58 @@ void GCTracer::SampleAllocation(double current_ms,
       old_generation_counter_bytes - old_generation_allocation_counter_bytes_;
   size_t embedder_allocated_bytes =
       embedder_counter_bytes - embedder_allocation_counter_bytes_;
-  double duration = current_ms - allocation_time_ms_;
-  allocation_time_ms_ = current_ms;
+  const base::TimeDelta duration = current - allocation_time_.value();
+  allocation_time_ = current;
   new_space_allocation_counter_bytes_ = new_space_counter_bytes;
   old_generation_allocation_counter_bytes_ = old_generation_counter_bytes;
   embedder_allocation_counter_bytes_ = embedder_counter_bytes;
-  allocation_duration_since_gc_ += duration;
+  allocation_duration_since_gc_ += duration.InMillisecondsF();
   new_space_allocation_in_bytes_since_gc_ += new_space_allocated_bytes;
   old_generation_allocation_in_bytes_since_gc_ +=
       old_generation_allocated_bytes;
   embedder_allocation_in_bytes_since_gc_ += embedder_allocated_bytes;
 }
 
-void GCTracer::AddAllocation(double current_ms) {
-  allocation_time_ms_ = current_ms;
+void GCTracer::NotifyMarkingStart() {
+  const auto marking_start = base::TimeTicks::Now();
+
+  uint16_t result = 1;
+  if (last_marking_start_time_.has_value()) {
+    const double diff_in_seconds = std::round(
+        (marking_start - last_marking_start_time_.value()).InSecondsF());
+    if (diff_in_seconds > UINT16_MAX) {
+      result = UINT16_MAX;
+    } else if (diff_in_seconds >= 1) {
+      result = static_cast<uint16_t>(diff_in_seconds);
+    }
+  }
+  DCHECK_GT(result, 0);
+  DCHECK_LE(result, UINT16_MAX);
+
+  code_flushing_increase_s_ = result;
+  last_marking_start_time_ = marking_start;
+
+  if (V8_UNLIKELY(v8_flags.trace_flush_code)) {
+    PrintIsolate(heap_->isolate(), "code flushing time: %d second(s)\n",
+                 code_flushing_increase_s_);
+  }
+}
+
+uint16_t GCTracer::CodeFlushingIncrease() const {
+  return code_flushing_increase_s_;
+}
+
+void GCTracer::AddAllocation(base::TimeTicks current) {
+  allocation_time_ = current;
   if (allocation_duration_since_gc_ > 0) {
-    recorded_new_generation_allocations_.Push(
-        MakeBytesAndDuration(new_space_allocation_in_bytes_since_gc_,
-                             allocation_duration_since_gc_));
-    recorded_old_generation_allocations_.Push(
-        MakeBytesAndDuration(old_generation_allocation_in_bytes_since_gc_,
-                             allocation_duration_since_gc_));
-    recorded_embedder_generation_allocations_.Push(MakeBytesAndDuration(
-        embedder_allocation_in_bytes_since_gc_, allocation_duration_since_gc_));
+    const auto duration_since_gc =
+        base::TimeDelta::FromMillisecondsD(allocation_duration_since_gc_);
+    recorded_new_generation_allocations_.Push(BytesAndDuration(
+        new_space_allocation_in_bytes_since_gc_, duration_since_gc));
+    recorded_old_generation_allocations_.Push(BytesAndDuration(
+        old_generation_allocation_in_bytes_since_gc_, duration_since_gc));
+    recorded_embedder_generation_allocations_.Push(BytesAndDuration(
+        embedder_allocation_in_bytes_since_gc_, duration_since_gc));
   }
   allocation_duration_since_gc_ = 0;
   new_space_allocation_in_bytes_since_gc_ = 0;
@@ -663,8 +665,8 @@ void GCTracer::AddAllocation(double current_ms) {
 
 void GCTracer::AddCompactionEvent(double duration,
                                   size_t live_bytes_compacted) {
-  recorded_compactions_.Push(
-      MakeBytesAndDuration(live_bytes_compacted, duration));
+  recorded_compactions_.Push(BytesAndDuration(
+      live_bytes_compacted, base::TimeDelta::FromMillisecondsD(duration)));
 }
 
 void GCTracer::AddSurvivalRatio(double promotion_ratio) {
@@ -674,7 +676,8 @@ void GCTracer::AddSurvivalRatio(double promotion_ratio) {
 void GCTracer::AddIncrementalMarkingStep(double duration, size_t bytes) {
   if (bytes > 0) {
     incremental_marking_bytes_ += bytes;
-    incremental_marking_duration_ += duration;
+    incremental_marking_duration_ +=
+        base::TimeDelta::FromMillisecondsD(duration);
   }
   ReportIncrementalMarkingStepToRecorder(duration);
 }
@@ -703,19 +706,20 @@ void GCTracer::Output(const char* format, ...) const {
 }
 
 void GCTracer::Print() const {
-  double duration = current_.end_time - current_.start_time;
+  const base::TimeDelta duration = current_.end_time - current_.start_time;
   const size_t kIncrementalStatsSize = 128;
   char incremental_buffer[kIncrementalStatsSize] = {0};
 
-  if (current_.type == Event::INCREMENTAL_MARK_COMPACTOR) {
+  if (current_.type == Event::Type::INCREMENTAL_MARK_COMPACTOR) {
     base::OS::SNPrintF(
         incremental_buffer, kIncrementalStatsSize,
         " (+ %.1f ms in %d steps since start of marking, "
         "biggest step %.1f ms, walltime since start of marking %.f ms)",
         current_scope(Scope::MC_INCREMENTAL),
         incremental_scope(Scope::MC_INCREMENTAL).steps,
-        incremental_scope(Scope::MC_INCREMENTAL).longest_step,
-        current_.end_time - incremental_marking_start_time_);
+        incremental_scope(Scope::MC_INCREMENTAL).longest_step.InMillisecondsF(),
+        (current_.end_time - incremental_marking_start_time_)
+            .InMillisecondsF());
   }
 
   const double total_external_time =
@@ -734,37 +738,36 @@ void GCTracer::Print() const {
       "%.2f / %.2f ms %s (average mu = %.3f, current mu = %.3f) %s; %s\n",
       base::OS::GetCurrentProcessId(),
       reinterpret_cast<void*>(heap_->isolate()),
-      heap_->isolate()->time_millis_since_init(), current_.TypeName(false),
-      current_.reduce_memory ? " (reduce)" : "",
+      heap_->isolate()->time_millis_since_init(),
+      ToString(current_.type, false), current_.reduce_memory ? " (reduce)" : "",
       static_cast<double>(current_.start_object_size) / MB,
       static_cast<double>(current_.start_memory_size) / MB,
       static_cast<double>(current_.end_object_size) / MB,
-      static_cast<double>(current_.end_memory_size) / MB, duration,
-      total_external_time, incremental_buffer,
+      static_cast<double>(current_.end_memory_size) / MB,
+      duration.InMillisecondsF(), total_external_time, incremental_buffer,
       AverageMarkCompactMutatorUtilization(),
-      CurrentMarkCompactMutatorUtilization(),
-      Heap::GarbageCollectionReasonToString(current_.gc_reason),
+      CurrentMarkCompactMutatorUtilization(), ToString(current_.gc_reason),
       current_.collector_reason != nullptr ? current_.collector_reason : "");
 }
 
 void GCTracer::PrintNVP() const {
-  double duration = current_.end_time - current_.start_time;
-  double spent_in_mutator = current_.start_time - previous_.end_time;
+  const base::TimeDelta duration = current_.end_time - current_.start_time;
+  const base::TimeDelta spent_in_mutator =
+      current_.start_time - previous_.end_time;
   size_t allocated_since_last_gc =
       current_.start_object_size - previous_.end_object_size;
 
-  double incremental_walltime_duration = 0;
-
-  if (current_.type == Event::INCREMENTAL_MARK_COMPACTOR) {
+  base::TimeDelta incremental_walltime_duration;
+  if (current_.type == Event::Type::INCREMENTAL_MARK_COMPACTOR) {
     incremental_walltime_duration =
         current_.end_time - incremental_marking_start_time_;
   }
 
   // Avoid data races when printing the background scopes.
-  base::MutexGuard guard(&background_counter_mutex_);
+  base::MutexGuard guard(&background_scopes_mutex_);
 
   switch (current_.type) {
-    case Event::SCAVENGER:
+    case Event::Type::SCAVENGER:
       heap_->isolate()->PrintWithTimestamp(
           "pause=%.1f "
           "mutator=%.1f "
@@ -810,8 +813,9 @@ void GCTracer::PrintNVP() const {
           "new_space_survive_rate_=%.1f%% "
           "new_space_allocation_throughput=%.1f "
           "unmapper_chunks=%d\n",
-          duration, spent_in_mutator, current_.TypeName(true),
-          current_.reduce_memory, current_.scopes[Scope::TIME_TO_SAFEPOINT],
+          duration.InMillisecondsF(), spent_in_mutator.InMillisecondsF(),
+          ToString(current_.type, true), current_.reduce_memory,
+          current_.scopes[Scope::TIME_TO_SAFEPOINT].InMillisecondsF(),
           current_scope(Scope::HEAP_PROLOGUE),
           current_scope(Scope::HEAP_EPILOGUE),
           current_scope(Scope::HEAP_EPILOGUE_REDUCE_NEW_SPACE),
@@ -846,20 +850,22 @@ void GCTracer::PrintNVP() const {
           NewSpaceAllocationThroughputInBytesPerMillisecond(),
           heap_->memory_allocator()->unmapper()->NumberOfChunks());
       break;
-    case Event::MINOR_MARK_COMPACTOR:
+    case Event::Type::MINOR_MARK_SWEEPER:
       heap_->isolate()->PrintWithTimestamp(
           "pause=%.1f "
           "mutator=%.1f "
           "gc=%s "
           "reduce_memory=%d "
-          "minor_mc=%.2f "
+          "minor_ms=%.2f "
           "time_to_safepoint=%.2f "
           "mark=%.2f "
-          "mark.incremental_roots=%.2f "
+          "mark.incremental_seed=%.2f "
           "mark.finish_incremental=%.2f "
           "mark.seed=%.2f "
+          "mark.traced_handles=%.2f "
           "mark.closure_parallel=%.2f "
           "mark.closure=%.2f "
+          "mark.conservative_stack=%.2f "
           "clear=%.2f "
           "clear.string_forwarding_table=%.2f "
           "clear.string_table=%.2f "
@@ -874,12 +880,13 @@ void GCTracer::PrintNVP() const {
           "sweep.array_buffers=%.2f "
           "finish=%.2f "
           "finish.ensure_capacity=%.2f "
+          "finish.sweep_array_buffers=%.2f "
           "background.mark=%.2f "
           "background.sweep=%.2f "
           "background.sweep.array_buffers=%.2f "
-          "background.evacuate.copy=%.2f "
           "background.unmapper=%.2f "
           "unmapper=%.2f "
+          "conservative_stack_scanning=%.2f "
           "total_size_before=%zu "
           "total_size_after=%zu "
           "holes_size_before=%zu "
@@ -895,38 +902,41 @@ void GCTracer::PrintNVP() const {
           "promotion_rate=%.1f%% "
           "new_space_survive_rate_=%.1f%% "
           "new_space_allocation_throughput=%.1f\n",
-          duration, spent_in_mutator, "mmc", current_.reduce_memory,
-          current_scope(Scope::MINOR_MC),
+          duration.InMillisecondsF(), spent_in_mutator.InMillisecondsF(), "mms",
+          current_.reduce_memory, current_scope(Scope::MINOR_MS),
           current_scope(Scope::TIME_TO_SAFEPOINT),
-          current_scope(Scope::MINOR_MC_MARK),
-          current_scope(Scope::MINOR_MC_MARK_ROOTS),
-          current_scope(Scope::MINOR_MC_MARK_FINISH_INCREMENTAL),
-          current_scope(Scope::MINOR_MC_MARK_SEED),
-          current_scope(Scope::MINOR_MC_MARK_CLOSURE_PARALLEL),
-          current_scope(Scope::MINOR_MC_MARK_CLOSURE),
-          current_scope(Scope::MINOR_MC_CLEAR),
-          current_scope(Scope::MINOR_MC_CLEAR_STRING_FORWARDING_TABLE),
-          current_scope(Scope::MINOR_MC_CLEAR_STRING_TABLE),
-          current_scope(Scope::MINOR_MC_CLEAR_WEAK_GLOBAL_HANDLES),
-          current_scope(Scope::MINOR_MC_COMPLETE_SWEEP_ARRAY_BUFFERS),
-          current_scope(Scope::MINOR_MC_COMPLETE_SWEEPING),
-          current_scope(Scope::MINOR_MC_SWEEP),
-          current_scope(Scope::MINOR_MC_SWEEP_NEW),
-          current_scope(Scope::MINOR_MC_SWEEP_NEW_LO),
-          current_scope(Scope::MINOR_MC_SWEEP_UPDATE_STRING_TABLE),
-          current_scope(Scope::MINOR_MC_SWEEP_START_JOBS),
+          current_scope(Scope::MINOR_MS_MARK),
+          current_scope(Scope::MINOR_MS_MARK_INCREMENTAL_SEED),
+          current_scope(Scope::MINOR_MS_MARK_FINISH_INCREMENTAL),
+          current_scope(Scope::MINOR_MS_MARK_SEED),
+          current_scope(Scope::MINOR_MS_MARK_TRACED_HANDLES),
+          current_scope(Scope::MINOR_MS_MARK_CLOSURE_PARALLEL),
+          current_scope(Scope::MINOR_MS_MARK_CLOSURE),
+          current_scope(Scope::MINOR_MS_MARK_CONSERVATIVE_STACK),
+          current_scope(Scope::MINOR_MS_CLEAR),
+          current_scope(Scope::MINOR_MS_CLEAR_STRING_FORWARDING_TABLE),
+          current_scope(Scope::MINOR_MS_CLEAR_STRING_TABLE),
+          current_scope(Scope::MINOR_MS_CLEAR_WEAK_GLOBAL_HANDLES),
+          current_scope(Scope::MINOR_MS_COMPLETE_SWEEP_ARRAY_BUFFERS),
+          current_scope(Scope::MINOR_MS_COMPLETE_SWEEPING),
+          current_scope(Scope::MINOR_MS_SWEEP),
+          current_scope(Scope::MINOR_MS_SWEEP_NEW),
+          current_scope(Scope::MINOR_MS_SWEEP_NEW_LO),
+          current_scope(Scope::MINOR_MS_SWEEP_UPDATE_STRING_TABLE),
+          current_scope(Scope::MINOR_MS_SWEEP_START_JOBS),
           current_scope(Scope::YOUNG_ARRAY_BUFFER_SWEEP),
-          current_scope(Scope::MINOR_MC_FINISH),
-          current_scope(Scope::MINOR_MC_FINISH_ENSURE_CAPACITY),
-          current_scope(Scope::MINOR_MC_BACKGROUND_MARKING),
-          current_scope(Scope::MINOR_MC_BACKGROUND_SWEEPING),
+          current_scope(Scope::MINOR_MS_FINISH),
+          current_scope(Scope::MINOR_MS_FINISH_ENSURE_CAPACITY),
+          current_scope(Scope::MINOR_MS_FINISH_SWEEP_ARRAY_BUFFERS),
+          current_scope(Scope::MINOR_MS_BACKGROUND_MARKING),
+          current_scope(Scope::MINOR_MS_BACKGROUND_SWEEPING),
           current_scope(Scope::BACKGROUND_YOUNG_ARRAY_BUFFER_SWEEP),
-          current_scope(Scope::MINOR_MC_BACKGROUND_EVACUATE_COPY),
           current_scope(Scope::BACKGROUND_UNMAPPER),
-          current_scope(Scope::UNMAPPER), current_.start_object_size,
-          current_.end_object_size, current_.start_holes_size,
-          current_.end_holes_size, allocated_since_last_gc,
-          heap_->promoted_objects_size(),
+          current_scope(Scope::UNMAPPER),
+          current_scope(Scope::CONSERVATIVE_STACK_SCANNING),
+          current_.start_object_size, current_.end_object_size,
+          current_.start_holes_size, current_.end_holes_size,
+          allocated_since_last_gc, heap_->promoted_objects_size(),
           heap_->new_space_surviving_object_size(),
           heap_->nodes_died_in_new_space_, heap_->nodes_copied_in_new_space_,
           heap_->nodes_promoted_, heap_->promotion_ratio_,
@@ -934,8 +944,8 @@ void GCTracer::PrintNVP() const {
           heap_->new_space_surviving_rate_,
           NewSpaceAllocationThroughputInBytesPerMillisecond());
       break;
-    case Event::MARK_COMPACTOR:
-    case Event::INCREMENTAL_MARK_COMPACTOR:
+    case Event::Type::MARK_COMPACTOR:
+    case Event::Type::INCREMENTAL_MARK_COMPACTOR:
       heap_->isolate()->PrintWithTimestamp(
           "pause=%.1f "
           "mutator=%.1f "
@@ -992,6 +1002,7 @@ void GCTracer::PrintNVP() const {
           "sweep.new=%.1f "
           "sweep.new_lo=%.1f "
           "sweep.old=%.1f "
+          "sweep.start_jobs=%.1f "
           "incremental=%.1f "
           "incremental.finalize=%.1f "
           "incremental.finalize.external.prologue=%.1f "
@@ -1012,6 +1023,7 @@ void GCTracer::PrintNVP() const {
           "background.evacuate.update_pointers=%.1f "
           "background.unmapper=%.1f "
           "unmapper=%.1f "
+          "conservative_stack_scanning=%.2f "
           "total_size_before=%zu "
           "total_size_after=%zu "
           "holes_size_before=%zu "
@@ -1029,8 +1041,9 @@ void GCTracer::PrintNVP() const {
           "new_space_allocation_throughput=%.1f "
           "unmapper_chunks=%d "
           "compaction_speed=%.f\n",
-          duration, spent_in_mutator, current_.TypeName(true),
-          current_.reduce_memory, current_scope(Scope::TIME_TO_SAFEPOINT),
+          duration.InMillisecondsF(), spent_in_mutator.InMillisecondsF(),
+          ToString(current_.type, true), current_.reduce_memory,
+          current_scope(Scope::TIME_TO_SAFEPOINT),
           current_scope(Scope::HEAP_PROLOGUE),
           current_scope(Scope::HEAP_EMBEDDER_TRACING_EPILOGUE),
           current_scope(Scope::HEAP_EPILOGUE),
@@ -1079,6 +1092,7 @@ void GCTracer::PrintNVP() const {
           current_scope(Scope::MC_SWEEP_NEW),
           current_scope(Scope::MC_SWEEP_NEW_LO),
           current_scope(Scope::MC_SWEEP_OLD),
+          current_scope(Scope::MC_SWEEP_START_JOBS),
           current_scope(Scope::MC_INCREMENTAL),
           current_scope(Scope::MC_INCREMENTAL_FINALIZE),
           current_scope(Scope::MC_INCREMENTAL_EXTERNAL_PROLOGUE),
@@ -1089,20 +1103,22 @@ void GCTracer::PrintNVP() const {
           current_scope(Scope::MC_INCREMENTAL_EMBEDDER_PROLOGUE),
           current_scope(Scope::MC_INCREMENTAL_EMBEDDER_TRACING),
           incremental_scope(Scope::MC_INCREMENTAL_EMBEDDER_TRACING)
-              .longest_step,
-          incremental_scope(Scope::MC_INCREMENTAL).longest_step,
+              .longest_step.InMillisecondsF(),
+          incremental_scope(Scope::MC_INCREMENTAL)
+              .longest_step.InMillisecondsF(),
           incremental_scope(Scope::MC_INCREMENTAL).steps,
           IncrementalMarkingSpeedInBytesPerMillisecond(),
-          incremental_walltime_duration,
+          incremental_walltime_duration.InMillisecondsF(),
           current_scope(Scope::MC_BACKGROUND_MARKING),
           current_scope(Scope::MC_BACKGROUND_SWEEPING),
           current_scope(Scope::MC_BACKGROUND_EVACUATE_COPY),
           current_scope(Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS),
           current_scope(Scope::BACKGROUND_UNMAPPER),
-          current_scope(Scope::UNMAPPER), current_.start_object_size,
-          current_.end_object_size, current_.start_holes_size,
-          current_.end_holes_size, allocated_since_last_gc,
-          heap_->promoted_objects_size(),
+          current_scope(Scope::UNMAPPER),
+          current_scope(Scope::CONSERVATIVE_STACK_SCANNING),
+          current_.start_object_size, current_.end_object_size,
+          current_.start_holes_size, current_.end_holes_size,
+          allocated_since_last_gc, heap_->promoted_objects_size(),
           heap_->new_space_surviving_object_size(),
           heap_->nodes_died_in_new_space_, heap_->nodes_copied_in_new_space_,
           heap_->nodes_promoted_, heap_->promotion_ratio_,
@@ -1112,40 +1128,18 @@ void GCTracer::PrintNVP() const {
           heap_->memory_allocator()->unmapper()->NumberOfChunks(),
           CompactionSpeedInBytesPerMillisecond());
       break;
-    case Event::START:
+    case Event::Type::START:
       break;
     default:
       UNREACHABLE();
   }
 }
 
-double GCTracer::AverageSpeed(const base::RingBuffer<BytesAndDuration>& buffer,
-                              const BytesAndDuration& initial, double time_ms) {
-  BytesAndDuration sum = buffer.Sum(
-      [time_ms](BytesAndDuration a, BytesAndDuration b) {
-        if (time_ms != 0 && a.second >= time_ms) return a;
-        return std::make_pair(a.first + b.first, a.second + b.second);
-      },
-      initial);
-  uint64_t bytes = sum.first;
-  double durations = sum.second;
-  if (durations == 0.0) return 0;
-  double speed = bytes / durations;
-  const int max_speed = 1024 * MB;
-  const int min_speed = 1;
-  if (speed >= max_speed) return max_speed;
-  if (speed <= min_speed) return min_speed;
-  return speed;
-}
-
-double GCTracer::AverageSpeed(
-    const base::RingBuffer<BytesAndDuration>& buffer) {
-  return AverageSpeed(buffer, MakeBytesAndDuration(0, 0), 0);
-}
-
-void GCTracer::RecordIncrementalMarkingSpeed(size_t bytes, double duration) {
-  if (duration == 0 || bytes == 0) return;
-  double current_speed = bytes / duration;
+void GCTracer::RecordIncrementalMarkingSpeed(size_t bytes,
+                                             base::TimeDelta duration) {
+  if (duration.IsZero() || bytes == 0) return;
+  double current_speed =
+      static_cast<double>(bytes) / duration.InMillisecondsF();
   if (recorded_incremental_marking_speed_ == 0) {
     recorded_incremental_marking_speed_ = current_speed;
   } else {
@@ -1154,16 +1148,18 @@ void GCTracer::RecordIncrementalMarkingSpeed(size_t bytes, double duration) {
   }
 }
 
-void GCTracer::RecordTimeToIncrementalMarkingTask(double time_to_task) {
-  if (average_time_to_incremental_marking_task_ == 0.0) {
-    average_time_to_incremental_marking_task_ = time_to_task;
+void GCTracer::RecordTimeToIncrementalMarkingTask(
+    base::TimeDelta time_to_task) {
+  if (!average_time_to_incremental_marking_task_.has_value()) {
+    average_time_to_incremental_marking_task_.emplace(time_to_task);
   } else {
     average_time_to_incremental_marking_task_ =
-        (average_time_to_incremental_marking_task_ + time_to_task) / 2;
+        (average_time_to_incremental_marking_task_.value() + time_to_task) / 2;
   }
 }
 
-double GCTracer::AverageTimeToIncrementalMarkingTask() const {
+base::Optional<base::TimeDelta> GCTracer::AverageTimeToIncrementalMarkingTask()
+    const {
   return average_time_to_incremental_marking_task_;
 }
 
@@ -1177,30 +1173,30 @@ void GCTracer::RecordEmbedderSpeed(size_t bytes, double duration) {
   }
 }
 
-void GCTracer::RecordMutatorUtilization(double mark_compact_end_time,
-                                        double mark_compact_duration) {
-  if (previous_mark_compact_end_time_ == 0) {
-    // The first event only contributes to previous_mark_compact_end_time_,
-    // because we cannot compute the mutator duration.
-    previous_mark_compact_end_time_ = mark_compact_end_time;
+void GCTracer::RecordMutatorUtilization(base::TimeTicks mark_compact_end_time,
+                                        base::TimeDelta mark_compact_duration) {
+  const base::TimeDelta total_duration =
+      mark_compact_end_time - previous_mark_compact_end_time_;
+  DCHECK_GE(total_duration, base::TimeDelta());
+  const base::TimeDelta mutator_duration =
+      total_duration - mark_compact_duration;
+  DCHECK_GE(mutator_duration, base::TimeDelta());
+  if (average_mark_compact_duration_ == 0 && average_mutator_duration_ == 0) {
+    // This is the first event with mutator and mark-compact durations.
+    average_mark_compact_duration_ = mark_compact_duration.InMillisecondsF();
+    average_mutator_duration_ = mutator_duration.InMillisecondsF();
   } else {
-    double total_duration =
-        mark_compact_end_time - previous_mark_compact_end_time_;
-    double mutator_duration = total_duration - mark_compact_duration;
-    if (average_mark_compact_duration_ == 0 && average_mutator_duration_ == 0) {
-      // This is the first event with mutator and mark-compact durations.
-      average_mark_compact_duration_ = mark_compact_duration;
-      average_mutator_duration_ = mutator_duration;
-    } else {
-      average_mark_compact_duration_ =
-          (average_mark_compact_duration_ + mark_compact_duration) / 2;
-      average_mutator_duration_ =
-          (average_mutator_duration_ + mutator_duration) / 2;
-    }
-    current_mark_compact_mutator_utilization_ =
-        total_duration ? mutator_duration / total_duration : 0;
-    previous_mark_compact_end_time_ = mark_compact_end_time;
+    average_mark_compact_duration_ = (average_mark_compact_duration_ +
+                                      mark_compact_duration.InMillisecondsF()) /
+                                     2;
+    average_mutator_duration_ =
+        (average_mutator_duration_ + mutator_duration.InMillisecondsF()) / 2;
   }
+  current_mark_compact_mutator_utilization_ =
+      !total_duration.IsZero() ? mutator_duration.InMillisecondsF() /
+                                     total_duration.InMillisecondsF()
+                               : 0;
+  previous_mark_compact_end_time_ = mark_compact_end_time;
 }
 
 double GCTracer::AverageMarkCompactMutatorUtilization() const {
@@ -1218,8 +1214,9 @@ double GCTracer::IncrementalMarkingSpeedInBytesPerMillisecond() const {
   if (recorded_incremental_marking_speed_ != 0) {
     return recorded_incremental_marking_speed_;
   }
-  if (incremental_marking_duration_ != 0.0) {
-    return incremental_marking_bytes_ / incremental_marking_duration_;
+  if (!incremental_marking_duration_.IsZero()) {
+    return incremental_marking_bytes_ /
+           incremental_marking_duration_.InMillisecondsF();
   }
   return kConservativeSpeedInBytesPerMillisecond;
 }
@@ -1233,22 +1230,22 @@ double GCTracer::EmbedderSpeedInBytesPerMillisecond() const {
 double GCTracer::ScavengeSpeedInBytesPerMillisecond(
     ScavengeSpeedMode mode) const {
   if (mode == kForAllObjects) {
-    return AverageSpeed(recorded_minor_gcs_total_);
+    return BoundedAverageSpeed(recorded_minor_gcs_total_);
   } else {
-    return AverageSpeed(recorded_minor_gcs_survived_);
+    return BoundedAverageSpeed(recorded_minor_gcs_survived_);
   }
 }
 
 double GCTracer::CompactionSpeedInBytesPerMillisecond() const {
-  return AverageSpeed(recorded_compactions_);
+  return BoundedAverageSpeed(recorded_compactions_);
 }
 
 double GCTracer::MarkCompactSpeedInBytesPerMillisecond() const {
-  return AverageSpeed(recorded_mark_compacts_);
+  return BoundedAverageSpeed(recorded_mark_compacts_);
 }
 
 double GCTracer::FinalIncrementalMarkCompactSpeedInBytesPerMillisecond() const {
-  return AverageSpeed(recorded_incremental_mark_compacts_);
+  return BoundedAverageSpeed(recorded_incremental_mark_compacts_);
 }
 
 double GCTracer::CombinedMarkCompactSpeedInBytesPerMillisecond() {
@@ -1286,162 +1283,167 @@ double GCTracer::CombineSpeedsInBytesPerMillisecond(double default_speed,
 }
 
 double GCTracer::NewSpaceAllocationThroughputInBytesPerMillisecond(
-    double time_ms) const {
-  size_t bytes = new_space_allocation_in_bytes_since_gc_;
-  double durations = allocation_duration_since_gc_;
-  return AverageSpeed(recorded_new_generation_allocations_,
-                      MakeBytesAndDuration(bytes, durations), time_ms);
+    base::Optional<base::TimeDelta> selected_duration) const {
+  return BoundedAverageSpeed(
+      recorded_new_generation_allocations_,
+      BytesAndDuration(
+          new_space_allocation_in_bytes_since_gc_,
+          base::TimeDelta::FromMillisecondsD(allocation_duration_since_gc_)),
+      selected_duration);
 }
 
 double GCTracer::OldGenerationAllocationThroughputInBytesPerMillisecond(
-    double time_ms) const {
-  size_t bytes = old_generation_allocation_in_bytes_since_gc_;
-  double durations = allocation_duration_since_gc_;
-  return AverageSpeed(recorded_old_generation_allocations_,
-                      MakeBytesAndDuration(bytes, durations), time_ms);
+    base::Optional<base::TimeDelta> selected_duration) const {
+  return BoundedAverageSpeed(
+      recorded_old_generation_allocations_,
+      BytesAndDuration(
+          old_generation_allocation_in_bytes_since_gc_,
+          base::TimeDelta::FromMillisecondsD(allocation_duration_since_gc_)),
+      selected_duration);
 }
 
 double GCTracer::EmbedderAllocationThroughputInBytesPerMillisecond(
-    double time_ms) const {
-  size_t bytes = embedder_allocation_in_bytes_since_gc_;
-  double durations = allocation_duration_since_gc_;
-  return AverageSpeed(recorded_embedder_generation_allocations_,
-                      MakeBytesAndDuration(bytes, durations), time_ms);
+    base::Optional<base::TimeDelta> selected_duration) const {
+  return BoundedAverageSpeed(
+      recorded_embedder_generation_allocations_,
+      BytesAndDuration(
+          embedder_allocation_in_bytes_since_gc_,
+          base::TimeDelta::FromMillisecondsD(allocation_duration_since_gc_)),
+      selected_duration);
 }
 
 double GCTracer::AllocationThroughputInBytesPerMillisecond(
-    double time_ms) const {
-  return NewSpaceAllocationThroughputInBytesPerMillisecond(time_ms) +
-         OldGenerationAllocationThroughputInBytesPerMillisecond(time_ms);
+    base::Optional<base::TimeDelta> selected_duration) const {
+  return NewSpaceAllocationThroughputInBytesPerMillisecond(selected_duration) +
+         OldGenerationAllocationThroughputInBytesPerMillisecond(
+             selected_duration);
 }
 
 double GCTracer::CurrentAllocationThroughputInBytesPerMillisecond() const {
-  return AllocationThroughputInBytesPerMillisecond(kThroughputTimeFrameMs);
+  return AllocationThroughputInBytesPerMillisecond(kThroughputTimeFrame);
 }
 
 double GCTracer::CurrentOldGenerationAllocationThroughputInBytesPerMillisecond()
     const {
   return OldGenerationAllocationThroughputInBytesPerMillisecond(
-      kThroughputTimeFrameMs);
+      kThroughputTimeFrame);
 }
 
 double GCTracer::CurrentEmbedderAllocationThroughputInBytesPerMillisecond()
     const {
   return EmbedderAllocationThroughputInBytesPerMillisecond(
-      kThroughputTimeFrameMs);
+      kThroughputTimeFrame);
 }
 
 double GCTracer::AverageSurvivalRatio() const {
-  if (recorded_survival_ratios_.Count() == 0) return 0.0;
-  double sum = recorded_survival_ratios_.Sum(
+  if (recorded_survival_ratios_.Empty()) return 0.0;
+  double sum = recorded_survival_ratios_.Reduce(
       [](double a, double b) { return a + b; }, 0.0);
-  return sum / recorded_survival_ratios_.Count();
+  return sum / recorded_survival_ratios_.Size();
 }
 
 bool GCTracer::SurvivalEventsRecorded() const {
-  return recorded_survival_ratios_.Count() > 0;
+  return !recorded_survival_ratios_.Empty();
 }
 
-void GCTracer::ResetSurvivalEvents() { recorded_survival_ratios_.Reset(); }
+void GCTracer::ResetSurvivalEvents() { recorded_survival_ratios_.Clear(); }
 
 void GCTracer::NotifyIncrementalMarkingStart() {
-  incremental_marking_start_time_ = MonotonicallyIncreasingTimeInMs();
+  incremental_marking_start_time_ = base::TimeTicks::Now();
 }
 
-void GCTracer::FetchBackgroundMarkCompactCounters() {
-  FetchBackgroundCounters(Scope::FIRST_MC_BACKGROUND_SCOPE,
-                          Scope::LAST_MC_BACKGROUND_SCOPE);
+void GCTracer::FetchBackgroundCounters() {
+  base::MutexGuard guard(&background_scopes_mutex_);
+  for (int i = Scope::FIRST_BACKGROUND_SCOPE; i <= Scope::LAST_BACKGROUND_SCOPE;
+       i++) {
+    current_.scopes[i] += background_scopes_[i];
+    background_scopes_[i] = base::TimeDelta();
+  }
 }
 
-void GCTracer::FetchBackgroundMinorGCCounters() {
-  FetchBackgroundCounters(Scope::FIRST_MINOR_GC_BACKGROUND_SCOPE,
-                          Scope::LAST_MINOR_GC_BACKGROUND_SCOPE);
-}
+namespace {
 
-void GCTracer::FetchBackgroundGeneralCounters() {
-  FetchBackgroundCounters(Scope::FIRST_GENERAL_BACKGROUND_SCOPE,
-                          Scope::LAST_GENERAL_BACKGROUND_SCOPE);
+V8_INLINE int TruncateToMs(base::TimeDelta delta) {
+  return static_cast<int>(delta.InMilliseconds());
 }
 
-void GCTracer::FetchBackgroundCounters(int first_scope, int last_scope) {
-  base::MutexGuard guard(&background_counter_mutex_);
-  for (int i = first_scope; i <= last_scope; i++) {
-    current_.scopes[i] += background_counter_[i].total_duration_ms;
-    background_counter_[i].total_duration_ms = 0;
-  }
-}
+}  // namespace
 
 void GCTracer::RecordGCPhasesHistograms(RecordGCPhasesInfo::Mode mode) {
   Counters* counters = heap_->isolate()->counters();
   if (mode == RecordGCPhasesInfo::Mode::Finalize) {
     DCHECK_EQ(Scope::FIRST_TOP_MC_SCOPE, Scope::MC_CLEAR);
     counters->gc_finalize_clear()->AddSample(
-        static_cast<int>(current_.scopes[Scope::MC_CLEAR]));
+        TruncateToMs(current_.scopes[Scope::MC_CLEAR]));
     counters->gc_finalize_epilogue()->AddSample(
-        static_cast<int>(current_.scopes[Scope::MC_EPILOGUE]));
+        TruncateToMs(current_.scopes[Scope::MC_EPILOGUE]));
     counters->gc_finalize_evacuate()->AddSample(
-        static_cast<int>(current_.scopes[Scope::MC_EVACUATE]));
+        TruncateToMs(current_.scopes[Scope::MC_EVACUATE]));
     counters->gc_finalize_finish()->AddSample(
-        static_cast<int>(current_.scopes[Scope::MC_FINISH]));
+        TruncateToMs(current_.scopes[Scope::MC_FINISH]));
     counters->gc_finalize_mark()->AddSample(
-        static_cast<int>(current_.scopes[Scope::MC_MARK]));
+        TruncateToMs(current_.scopes[Scope::MC_MARK]));
     counters->gc_finalize_prologue()->AddSample(
-        static_cast<int>(current_.scopes[Scope::MC_PROLOGUE]));
+        TruncateToMs(current_.scopes[Scope::MC_PROLOGUE]));
     counters->gc_finalize_sweep()->AddSample(
-        static_cast<int>(current_.scopes[Scope::MC_SWEEP]));
-    if (incremental_marking_duration_ > 0) {
+        TruncateToMs(current_.scopes[Scope::MC_SWEEP]));
+    if (!incremental_marking_duration_.IsZero()) {
       heap_->isolate()->counters()->incremental_marking_sum()->AddSample(
-          static_cast<int>(incremental_marking_duration_));
+          TruncateToMs(incremental_marking_duration_));
     }
-    const double overall_marking_time =
+    const base::TimeDelta overall_marking_time =
         incremental_marking_duration_ + current_.scopes[Scope::MC_MARK];
     heap_->isolate()->counters()->gc_marking_sum()->AddSample(
-        static_cast<int>(overall_marking_time));
+        TruncateToMs(overall_marking_time));
 
     DCHECK_EQ(Scope::LAST_TOP_MC_SCOPE, Scope::MC_SWEEP);
   } else if (mode == RecordGCPhasesInfo::Mode::Scavenger) {
     counters->gc_scavenger_scavenge_main()->AddSample(
-        static_cast<int>(current_.scopes[Scope::SCAVENGER_SCAVENGE_PARALLEL]));
+        TruncateToMs(current_.scopes[Scope::SCAVENGER_SCAVENGE_PARALLEL]));
     counters->gc_scavenger_scavenge_roots()->AddSample(
-        static_cast<int>(current_.scopes[Scope::SCAVENGER_SCAVENGE_ROOTS]));
+        TruncateToMs(current_.scopes[Scope::SCAVENGER_SCAVENGE_ROOTS]));
   }
 }
 
 void GCTracer::RecordGCSumCounters() {
-  base::MutexGuard guard(&background_counter_mutex_);
-
-  const double atomic_pause_duration = current_.scopes[Scope::MARK_COMPACTOR];
-  const double incremental_marking =
+  const base::TimeDelta atomic_pause_duration =
+      current_.scopes[Scope::MARK_COMPACTOR];
+  const base::TimeDelta incremental_marking =
       incremental_scopes_[Scope::MC_INCREMENTAL_LAYOUT_CHANGE].duration +
       incremental_scopes_[Scope::MC_INCREMENTAL_START].duration +
       incremental_marking_duration_ +
       incremental_scopes_[Scope::MC_INCREMENTAL_FINALIZE].duration;
-  const double incremental_sweeping =
+  const base::TimeDelta incremental_sweeping =
       incremental_scopes_[Scope::MC_INCREMENTAL_SWEEPING].duration;
-  const double overall_duration =
+  const base::TimeDelta overall_duration =
       atomic_pause_duration + incremental_marking + incremental_sweeping;
-  const double background_duration =
-      background_counter_[Scope::MC_BACKGROUND_EVACUATE_COPY]
-          .total_duration_ms +
-      background_counter_[Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS]
-          .total_duration_ms +
-      background_counter_[Scope::MC_BACKGROUND_MARKING].total_duration_ms +
-      background_counter_[Scope::MC_BACKGROUND_SWEEPING].total_duration_ms;
-  const double atomic_marking_duration =
+  const base::TimeDelta atomic_marking_duration =
       current_.scopes[Scope::MC_PROLOGUE] + current_.scopes[Scope::MC_MARK];
-  const double marking_duration = atomic_marking_duration + incremental_marking;
-  const double marking_background_duration =
-      background_counter_[Scope::MC_BACKGROUND_MARKING].total_duration_ms;
+  const base::TimeDelta marking_duration =
+      atomic_marking_duration + incremental_marking;
+  base::TimeDelta background_duration;
+  base::TimeDelta marking_background_duration;
+  {
+    base::MutexGuard guard(&background_scopes_mutex_);
+    background_duration =
+        background_scopes_[Scope::MC_BACKGROUND_EVACUATE_COPY] +
+        background_scopes_[Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS] +
+        background_scopes_[Scope::MC_BACKGROUND_MARKING] +
+        background_scopes_[Scope::MC_BACKGROUND_SWEEPING];
+    marking_background_duration =
+        background_scopes_[Scope::MC_BACKGROUND_MARKING];
+  }
+  concurrent_gc_time_ += background_duration;
 
   // Emit trace event counters.
-  TRACE_EVENT_INSTANT2(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-                       "V8.GCMarkCompactorSummary", TRACE_EVENT_SCOPE_THREAD,
-                       "duration", overall_duration, "background_duration",
-                       background_duration);
-  TRACE_EVENT_INSTANT2(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-                       "V8.GCMarkCompactorMarkingSummary",
-                       TRACE_EVENT_SCOPE_THREAD, "duration", marking_duration,
-                       "background_duration", marking_background_duration);
+  TRACE_EVENT_INSTANT2(
+      TRACE_DISABLED_BY_DEFAULT("v8.gc"), "V8.GCMarkCompactorSummary",
+      TRACE_EVENT_SCOPE_THREAD, "duration", overall_duration.InMillisecondsF(),
+      "background_duration", background_duration.InMillisecondsF());
+  TRACE_EVENT_INSTANT2(
+      TRACE_DISABLED_BY_DEFAULT("v8.gc"), "V8.GCMarkCompactorMarkingSummary",
+      TRACE_EVENT_SCOPE_THREAD, "duration", marking_duration.InMillisecondsF(),
+      "background_duration", marking_background_duration.InMillisecondsF());
 }
 
 namespace {
@@ -1573,86 +1575,79 @@ void GCTracer::ReportFullCycleToRecorder() {
   }
 
   // Unified heap statistics:
-  const double atomic_pause_duration = current_.scopes[Scope::MARK_COMPACTOR];
-  const double incremental_marking =
+  const base::TimeDelta atomic_pause_duration =
+      current_.scopes[Scope::MARK_COMPACTOR];
+  const base::TimeDelta incremental_marking =
       current_.incremental_scopes[Scope::MC_INCREMENTAL_LAYOUT_CHANGE]
           .duration +
       current_.incremental_scopes[Scope::MC_INCREMENTAL_START].duration +
       current_.incremental_marking_duration +
       current_.incremental_scopes[Scope::MC_INCREMENTAL_FINALIZE].duration;
-  const double incremental_sweeping =
+  const base::TimeDelta incremental_sweeping =
       current_.incremental_scopes[Scope::MC_INCREMENTAL_SWEEPING].duration;
-  const double overall_duration =
+  const base::TimeDelta overall_duration =
       atomic_pause_duration + incremental_marking + incremental_sweeping;
-  const double marking_background_duration =
+  const base::TimeDelta marking_background_duration =
       current_.scopes[Scope::MC_BACKGROUND_MARKING];
-  const double sweeping_background_duration =
+  const base::TimeDelta sweeping_background_duration =
       current_.scopes[Scope::MC_BACKGROUND_SWEEPING];
-  const double compact_background_duration =
+  const base::TimeDelta compact_background_duration =
       current_.scopes[Scope::MC_BACKGROUND_EVACUATE_COPY] +
       current_.scopes[Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS];
-  const double background_duration = marking_background_duration +
-                                     sweeping_background_duration +
-                                     compact_background_duration;
-  const double atomic_marking_duration =
+  const base::TimeDelta background_duration = marking_background_duration +
+                                              sweeping_background_duration +
+                                              compact_background_duration;
+  const base::TimeDelta atomic_marking_duration =
       current_.scopes[Scope::MC_PROLOGUE] + current_.scopes[Scope::MC_MARK];
-  const double marking_duration = atomic_marking_duration + incremental_marking;
-  const double weak_duration = current_.scopes[Scope::MC_CLEAR];
-  const double compact_duration = current_.scopes[Scope::MC_EVACUATE] +
-                                  current_.scopes[Scope::MC_FINISH] +
-                                  current_.scopes[Scope::MC_EPILOGUE];
-  const double atomic_sweeping_duration = current_.scopes[Scope::MC_SWEEP];
-  const double sweeping_duration =
+  const base::TimeDelta marking_duration =
+      atomic_marking_duration + incremental_marking;
+  const base::TimeDelta weak_duration = current_.scopes[Scope::MC_CLEAR];
+  const base::TimeDelta compact_duration = current_.scopes[Scope::MC_EVACUATE] +
+                                           current_.scopes[Scope::MC_FINISH] +
+                                           current_.scopes[Scope::MC_EPILOGUE];
+  const base::TimeDelta atomic_sweeping_duration =
+      current_.scopes[Scope::MC_SWEEP];
+  const base::TimeDelta sweeping_duration =
       atomic_sweeping_duration + incremental_sweeping;
 
   event.main_thread_atomic.total_wall_clock_duration_in_us =
-      static_cast<int64_t>(atomic_pause_duration *
-                           base::Time::kMicrosecondsPerMillisecond);
-  event.main_thread.total_wall_clock_duration_in_us = static_cast<int64_t>(
-      overall_duration * base::Time::kMicrosecondsPerMillisecond);
+      atomic_pause_duration.InMicroseconds();
+  event.main_thread.total_wall_clock_duration_in_us =
+      overall_duration.InMicroseconds();
   event.total.total_wall_clock_duration_in_us =
-      static_cast<int64_t>((overall_duration + background_duration) *
-                           base::Time::kMicrosecondsPerMillisecond);
+      (overall_duration + background_duration).InMicroseconds();
   event.main_thread_atomic.mark_wall_clock_duration_in_us =
-      static_cast<int64_t>(atomic_marking_duration *
-                           base::Time::kMicrosecondsPerMillisecond);
-  event.main_thread.mark_wall_clock_duration_in_us = static_cast<int64_t>(
-      marking_duration * base::Time::kMicrosecondsPerMillisecond);
+      atomic_marking_duration.InMicroseconds();
+  event.main_thread.mark_wall_clock_duration_in_us =
+      marking_duration.InMicroseconds();
   event.total.mark_wall_clock_duration_in_us =
-      static_cast<int64_t>((marking_duration + marking_background_duration) *
-                           base::Time::kMicrosecondsPerMillisecond);
+      (marking_duration + marking_background_duration).InMicroseconds();
   event.main_thread_atomic.weak_wall_clock_duration_in_us =
       event.main_thread.weak_wall_clock_duration_in_us =
-          event.total.weak_wall_clock_duration_in_us = static_cast<int64_t>(
-              weak_duration * base::Time::kMicrosecondsPerMillisecond);
+          event.total.weak_wall_clock_duration_in_us =
+              weak_duration.InMicroseconds();
   event.main_thread_atomic.compact_wall_clock_duration_in_us =
       event.main_thread.compact_wall_clock_duration_in_us =
-          static_cast<int64_t>(compact_duration *
-                               base::Time::kMicrosecondsPerMillisecond);
+          compact_duration.InMicroseconds();
   event.total.compact_wall_clock_duration_in_us =
-      static_cast<int64_t>((compact_duration + compact_background_duration) *
-                           base::Time::kMicrosecondsPerMillisecond);
+      (compact_duration + compact_background_duration).InMicroseconds();
   event.main_thread_atomic.sweep_wall_clock_duration_in_us =
-      static_cast<int64_t>(atomic_sweeping_duration *
-                           base::Time::kMicrosecondsPerMillisecond);
-  event.main_thread.sweep_wall_clock_duration_in_us = static_cast<int64_t>(
-      sweeping_duration * base::Time::kMicrosecondsPerMillisecond);
+      atomic_sweeping_duration.InMicroseconds();
+  event.main_thread.sweep_wall_clock_duration_in_us =
+      sweeping_duration.InMicroseconds();
   event.total.sweep_wall_clock_duration_in_us =
-      static_cast<int64_t>((sweeping_duration + sweeping_background_duration) *
-                           base::Time::kMicrosecondsPerMillisecond);
-  if (current_.type == Event::INCREMENTAL_MARK_COMPACTOR) {
+      (sweeping_duration + sweeping_background_duration).InMicroseconds();
+  if (current_.type == Event::Type::INCREMENTAL_MARK_COMPACTOR) {
     event.main_thread_incremental.mark_wall_clock_duration_in_us =
-        static_cast<int64_t>(incremental_marking *
-                             base::Time::kMicrosecondsPerMillisecond);
+        incremental_marking.InMicroseconds();
   } else {
-    DCHECK_EQ(0, incremental_marking);
+    DCHECK(incremental_marking.IsZero());
     event.main_thread_incremental.mark_wall_clock_duration_in_us = -1;
   }
   // TODO(chromium:1154636): We always report the value of incremental sweeping,
   // even if it is zero.
   event.main_thread_incremental.sweep_wall_clock_duration_in_us =
-      static_cast<int64_t>(incremental_sweeping *
-                           base::Time::kMicrosecondsPerMillisecond);
+      incremental_sweeping.InMicroseconds();
 
   // TODO(chromium:1154636): Populate the following:
   // - event.objects
@@ -1752,25 +1747,22 @@ void GCTracer::ReportYoungCycleToRecorder() {
 #endif  // defined(CPPGC_YOUNG_GENERATION)
 
   // Total:
-  const double total_wall_clock_duration_in_us =
-      (current_.scopes[Scope::SCAVENGER] +
-       current_.scopes[Scope::MINOR_MARK_COMPACTOR] +
-       current_.scopes[Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL] +
-       current_.scopes[Scope::MINOR_MC_BACKGROUND_EVACUATE_COPY] +
-       current_.scopes[Scope::MINOR_MC_BACKGROUND_MARKING]) *
-      base::Time::kMicrosecondsPerMillisecond;
+  const base::TimeDelta total_wall_clock_duration =
+      current_.scopes[Scope::SCAVENGER] +
+      current_.scopes[Scope::MINOR_MARK_SWEEPER] +
+      current_.scopes[Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL] +
+      current_.scopes[Scope::MINOR_MS_BACKGROUND_MARKING];
   // TODO(chromium:1154636): Consider adding BACKGROUND_YOUNG_ARRAY_BUFFER_SWEEP
-  // (both for the case of the scavenger and the minor mark-compactor), and
-  // BACKGROUND_UNMAPPER (for the case of the minor mark-compactor).
+  // (both for the case of the scavenger and the minor mark-sweeper), and
+  // BACKGROUND_UNMAPPER (for the case of the minor mark-sweeper).
   event.total_wall_clock_duration_in_us =
-      static_cast<int64_t>(total_wall_clock_duration_in_us);
+      total_wall_clock_duration.InMicroseconds();
   // MainThread:
-  const double main_thread_wall_clock_duration_in_us =
-      (current_.scopes[Scope::SCAVENGER] +
-       current_.scopes[Scope::MINOR_MARK_COMPACTOR]) *
-      base::Time::kMicrosecondsPerMillisecond;
+  const base::TimeDelta main_thread_wall_clock_duration =
+      current_.scopes[Scope::SCAVENGER] +
+      current_.scopes[Scope::MINOR_MARK_SWEEPER];
   event.main_thread_wall_clock_duration_in_us =
-      static_cast<int64_t>(main_thread_wall_clock_duration_in_us);
+      main_thread_wall_clock_duration.InMicroseconds();
   // Collection Rate:
   if (current_.young_object_size == 0) {
     event.collection_rate_in_percent = 0;
@@ -1780,25 +1772,19 @@ void GCTracer::ReportYoungCycleToRecorder() {
         current_.young_object_size;
   }
   // Efficiency:
-  auto freed_bytes =
-      current_.young_object_size - current_.survived_young_object_size;
-  if (freed_bytes == 0) {
-    event.efficiency_in_bytes_per_us = 0;
-    event.main_thread_efficiency_in_bytes_per_us = 0;
-  } else {
-    // Here, main_thread_wall_clock_duration_in_us or even
-    // total_wall_clock_duration_in_us can be zero if the clock resolution is
-    // not small enough and the entire GC was very short, so the timed value
-    // was zero. This appears to happen on Windows, see crbug.com/1338256 and
-    // crbug.com/1339180, related to the same issue in cppgc. In this case, we
-    // are only here if the number of freed bytes is nonzero and the division
-    // below produces an infinite value.
-    event.efficiency_in_bytes_per_us =
-        freed_bytes / total_wall_clock_duration_in_us;
-    event.main_thread_efficiency_in_bytes_per_us =
-        freed_bytes / main_thread_wall_clock_duration_in_us;
-  }
-
+  //
+  // It's possible that time durations are rounded/clamped to zero, in which
+  // case we report infinity efficiency.
+  const double freed_bytes = static_cast<double>(
+      current_.young_object_size - current_.survived_young_object_size);
+  event.efficiency_in_bytes_per_us =
+      total_wall_clock_duration.IsZero()
+          ? std::numeric_limits<double>::infinity()
+          : freed_bytes / total_wall_clock_duration.InMicroseconds();
+  event.main_thread_efficiency_in_bytes_per_us =
+      main_thread_wall_clock_duration.IsZero()
+          ? std::numeric_limits<double>::infinity()
+          : freed_bytes / main_thread_wall_clock_duration.InMicroseconds();
   recorder->AddMainThreadEvent(event, GetContextId(heap_->isolate()));
 }
 
@@ -1809,13 +1795,44 @@ GarbageCollector GCTracer::GetCurrentCollector() const {
     case Event::Type::MARK_COMPACTOR:
     case Event::Type::INCREMENTAL_MARK_COMPACTOR:
       return GarbageCollector::MARK_COMPACTOR;
-    case Event::Type::MINOR_MARK_COMPACTOR:
-    case Event::Type::INCREMENTAL_MINOR_MARK_COMPACTOR:
-      return GarbageCollector::MINOR_MARK_COMPACTOR;
+    case Event::Type::MINOR_MARK_SWEEPER:
+    case Event::Type::INCREMENTAL_MINOR_MARK_SWEEPER:
+      return GarbageCollector::MINOR_MARK_SWEEPER;
     case Event::Type::START:
       UNREACHABLE();
   }
 }
 
+#ifdef DEBUG
+bool GCTracer::IsInObservablePause() const {
+  return start_of_observable_pause_.has_value();
+}
+
+bool GCTracer::IsInAtomicPause() const {
+  return current_.state == Event::State::ATOMIC;
+}
+
+bool GCTracer::IsConsistentWithCollector(GarbageCollector collector) const {
+  switch (collector) {
+    case GarbageCollector::SCAVENGER:
+      return current_.type == Event::Type::SCAVENGER;
+    case GarbageCollector::MARK_COMPACTOR:
+      return current_.type == Event::Type::MARK_COMPACTOR ||
+             current_.type == Event::Type::INCREMENTAL_MARK_COMPACTOR;
+    case GarbageCollector::MINOR_MARK_SWEEPER:
+      return current_.type == Event::Type::MINOR_MARK_SWEEPER ||
+             current_.type == Event::Type::INCREMENTAL_MINOR_MARK_SWEEPER;
+  }
+}
+
+bool GCTracer::IsSweepingInProgress() const {
+  return (current_.type == Event::Type::MARK_COMPACTOR ||
+          current_.type == Event::Type::INCREMENTAL_MARK_COMPACTOR ||
+          current_.type == Event::Type::MINOR_MARK_SWEEPER ||
+          current_.type == Event::Type::INCREMENTAL_MINOR_MARK_SWEEPER) &&
+         current_.state == Event::State::SWEEPING;
+}
+#endif
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/gc-tracer.h b/deps/v8/src/heap/gc-tracer.h
index e6d34cb367d54f..56644c212169ec 100644
--- a/deps/v8/src/heap/gc-tracer.h
+++ b/deps/v8/src/heap/gc-tracer.h
@@ -11,6 +11,7 @@
 #include "src/base/optional.h"
 #include "src/base/ring-buffer.h"
 #include "src/common/globals.h"
+#include "src/heap/base/bytes.h"
 #include "src/init/heap-symbols.h"
 #include "src/logging/counters.h"
 #include "testing/gtest/include/gtest/gtest_prod.h"  // nogncheck
@@ -18,12 +19,6 @@
 namespace v8 {
 namespace internal {
 
-using BytesAndDuration = std::pair<uint64_t, double>;
-
-inline BytesAndDuration MakeBytesAndDuration(uint64_t bytes, double duration) {
-  return std::make_pair(bytes, duration);
-}
-
 enum ScavengeSpeedMode { kForAllObjects, kForSurvivedObjects };
 
 #define TRACE_GC_CATEGORIES \
@@ -40,12 +35,40 @@ enum ScavengeSpeedMode { kForAllObjects, kForSurvivedObjects };
   TRACE_EVENT0(TRACE_GC_CATEGORIES,                                   \
                GCTracer::Scope::Name(GCTracer::Scope::ScopeId(scope_id)))
 
+#define TRACE_GC_ARG1(tracer, scope_id, arg0_name, arg0_value)            \
+  DCHECK_NE(GCTracer::Scope::MC_SWEEP, scope_id);                         \
+  DCHECK_NE(GCTracer::Scope::MC_BACKGROUND_SWEEPING, scope_id);           \
+  GCTracer::Scope UNIQUE_IDENTIFIER(gc_tracer_scope)(                     \
+      tracer, GCTracer::Scope::ScopeId(scope_id), ThreadKind::kMain);     \
+  TRACE_EVENT1(TRACE_GC_CATEGORIES,                                       \
+               GCTracer::Scope::Name(GCTracer::Scope::ScopeId(scope_id)), \
+               arg0_name, arg0_value)
+
+#define TRACE_GC_WITH_FLOW(tracer, scope_id, bind_id, flow_flags)         \
+  DCHECK_NE(GCTracer::Scope::MC_SWEEP, scope_id);                         \
+  DCHECK_NE(GCTracer::Scope::MC_BACKGROUND_SWEEPING, scope_id);           \
+  GCTracer::Scope UNIQUE_IDENTIFIER(gc_tracer_scope)(                     \
+      tracer, GCTracer::Scope::ScopeId(scope_id), ThreadKind::kMain);     \
+  TRACE_EVENT_WITH_FLOW0(                                                 \
+      TRACE_GC_CATEGORIES,                                                \
+      GCTracer::Scope::Name(GCTracer::Scope::ScopeId(scope_id)), bind_id, \
+      flow_flags)
+
 #define TRACE_GC1(tracer, scope_id, thread_kind)                \
   GCTracer::Scope UNIQUE_IDENTIFIER(gc_tracer_scope)(           \
       tracer, GCTracer::Scope::ScopeId(scope_id), thread_kind); \
   TRACE_EVENT0(TRACE_GC_CATEGORIES,                             \
                GCTracer::Scope::Name(GCTracer::Scope::ScopeId(scope_id)))
 
+#define TRACE_GC1_WITH_FLOW(tracer, scope_id, thread_kind, bind_id,       \
+                            flow_flags)                                   \
+  GCTracer::Scope UNIQUE_IDENTIFIER(gc_tracer_scope)(                     \
+      tracer, GCTracer::Scope::ScopeId(scope_id), thread_kind);           \
+  TRACE_EVENT_WITH_FLOW0(                                                 \
+      TRACE_GC_CATEGORIES,                                                \
+      GCTracer::Scope::Name(GCTracer::Scope::ScopeId(scope_id)), bind_id, \
+      flow_flags)
+
 #define TRACE_GC_EPOCH(tracer, scope_id, thread_kind)                     \
   GCTracer::Scope UNIQUE_IDENTIFIER(gc_tracer_scope)(                     \
       tracer, GCTracer::Scope::ScopeId(scope_id), thread_kind);           \
@@ -53,23 +76,37 @@ enum ScavengeSpeedMode { kForAllObjects, kForSurvivedObjects };
                GCTracer::Scope::Name(GCTracer::Scope::ScopeId(scope_id)), \
                "epoch", tracer->CurrentEpoch(scope_id))
 
+#define TRACE_GC_EPOCH_WITH_FLOW(tracer, scope_id, thread_kind, bind_id,  \
+                                 flow_flags)                              \
+  GCTracer::Scope UNIQUE_IDENTIFIER(gc_tracer_scope)(                     \
+      tracer, GCTracer::Scope::ScopeId(scope_id), thread_kind);           \
+  TRACE_EVENT_WITH_FLOW1(                                                 \
+      TRACE_GC_CATEGORIES,                                                \
+      GCTracer::Scope::Name(GCTracer::Scope::ScopeId(scope_id)), bind_id, \
+      flow_flags, "epoch", tracer->CurrentEpoch(scope_id))
+
+#define TRACE_GC_NOTE(note)                  \
+  do {                                       \
+    TRACE_EVENT0(TRACE_GC_CATEGORIES, note); \
+  } while (0)
+
+#define TRACE_GC_NOTE_WITH_FLOW(note, bind_id, flow_flags)                  \
+  do {                                                                      \
+    TRACE_EVENT_WITH_FLOW0(TRACE_GC_CATEGORIES, note, bind_id, flow_flags); \
+  } while (0)
+
 using CollectionEpoch = uint32_t;
 
 // GCTracer collects and prints ONE line after each garbage collector
 // invocation IFF --trace_gc is used.
 class V8_EXPORT_PRIVATE GCTracer {
  public:
-  GCTracer(const GCTracer&) = delete;
-  GCTracer& operator=(const GCTracer&) = delete;
+  struct IncrementalInfos final {
+    constexpr V8_INLINE IncrementalInfos& operator+=(base::TimeDelta delta);
 
-  struct IncrementalMarkingInfos {
-    V8_INLINE IncrementalMarkingInfos();
-    V8_INLINE void Update(double delta);
-    V8_INLINE void ResetCurrentCycle();
-
-    double duration;      // in ms
-    double longest_step;  // in ms
-    int steps;
+    base::TimeDelta duration;
+    base::TimeDelta longest_step;
+    int steps = 0;
   };
 
   class V8_EXPORT_PRIVATE V8_NODISCARD Scope {
@@ -85,16 +122,10 @@ class V8_EXPORT_PRIVATE GCTracer {
       FIRST_SCOPE = MC_INCREMENTAL,
       NUMBER_OF_INCREMENTAL_SCOPES =
           LAST_INCREMENTAL_SCOPE - FIRST_INCREMENTAL_SCOPE + 1,
-      FIRST_GENERAL_BACKGROUND_SCOPE = BACKGROUND_YOUNG_ARRAY_BUFFER_SWEEP,
-      LAST_GENERAL_BACKGROUND_SCOPE = BACKGROUND_SAFEPOINT,
-      FIRST_MC_BACKGROUND_SCOPE = MC_BACKGROUND_EVACUATE_COPY,
-      LAST_MC_BACKGROUND_SCOPE = MC_BACKGROUND_SWEEPING,
       FIRST_TOP_MC_SCOPE = MC_CLEAR,
       LAST_TOP_MC_SCOPE = MC_SWEEP,
-      FIRST_MINOR_GC_BACKGROUND_SCOPE = MINOR_MC_BACKGROUND_EVACUATE_COPY,
-      LAST_MINOR_GC_BACKGROUND_SCOPE = SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL,
-      FIRST_BACKGROUND_SCOPE = FIRST_GENERAL_BACKGROUND_SCOPE,
-      LAST_BACKGROUND_SCOPE = LAST_MINOR_GC_BACKGROUND_SCOPE
+      FIRST_BACKGROUND_SCOPE = BACKGROUND_YOUNG_ARRAY_BUFFER_SWEEP,
+      LAST_BACKGROUND_SCOPE = SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL
     };
 
     V8_INLINE Scope(GCTracer* tracer, ScopeId scope, ThreadKind thread_kind);
@@ -109,7 +140,7 @@ class V8_EXPORT_PRIVATE GCTracer {
     GCTracer* const tracer_;
     const ScopeId scope_;
     const ThreadKind thread_kind_;
-    const double start_time_;
+    const base::TimeTicks start_time_;
 #ifdef V8_RUNTIME_CALL_STATS
     RuntimeCallTimer timer_;
     RuntimeCallStats* runtime_stats_ = nullptr;
@@ -119,12 +150,12 @@ class V8_EXPORT_PRIVATE GCTracer {
 
   class Event {
    public:
-    enum Type {
+    enum class Type {
       SCAVENGER = 0,
       MARK_COMPACTOR = 1,
       INCREMENTAL_MARK_COMPACTOR = 2,
-      MINOR_MARK_COMPACTOR = 3,
-      INCREMENTAL_MINOR_MARK_COMPACTOR = 4,
+      MINOR_MARK_SWEEPER = 3,
+      INCREMENTAL_MINOR_MARK_SWEEPER = 4,
       START = 5,
     };
 
@@ -141,9 +172,6 @@ class V8_EXPORT_PRIVATE GCTracer {
     Event(Type type, State state, GarbageCollectionReason gc_reason,
           const char* collector_reason);
 
-    // Returns a string describing the event type.
-    const char* TypeName(bool short_name) const;
-
     // Type of the event.
     Type type;
 
@@ -154,70 +182,65 @@ class V8_EXPORT_PRIVATE GCTracer {
     const char* collector_reason;
 
     // Timestamp set in the constructor.
-    double start_time;
+    base::TimeTicks start_time;
 
     // Timestamp set in the destructor.
-    double end_time;
+    base::TimeTicks end_time;
 
     // Memory reduction flag set.
-    bool reduce_memory;
+    bool reduce_memory = false;
 
     // Size of objects in heap set in constructor.
-    size_t start_object_size;
+    size_t start_object_size = 0;
 
     // Size of objects in heap set in destructor.
-    size_t end_object_size;
+    size_t end_object_size = 0;
 
     // Size of memory allocated from OS set in constructor.
-    size_t start_memory_size;
+    size_t start_memory_size = 0;
 
     // Size of memory allocated from OS set in destructor.
-    size_t end_memory_size;
+    size_t end_memory_size = 0;
 
     // Total amount of space either wasted or contained in one of free lists
     // before the current GC.
-    size_t start_holes_size;
+    size_t start_holes_size = 0;
 
     // Total amount of space either wasted or contained in one of free lists
     // after the current GC.
-    size_t end_holes_size;
+    size_t end_holes_size = 0;
 
     // Size of young objects in constructor.
-    size_t young_object_size;
+    size_t young_object_size = 0;
 
     // Size of survived young objects in destructor.
-    size_t survived_young_object_size;
+    size_t survived_young_object_size = 0;
 
     // Bytes marked incrementally for INCREMENTAL_MARK_COMPACTOR
-    size_t incremental_marking_bytes;
+    size_t incremental_marking_bytes = 0;
 
     // Duration (in ms) of incremental marking steps for
     // INCREMENTAL_MARK_COMPACTOR.
-    double incremental_marking_duration;
+    base::TimeDelta incremental_marking_duration;
 
-    // Amounts of time (in ms) spent in different scopes during GC.
-    double scopes[Scope::NUMBER_OF_SCOPES];
+    // Amounts of time spent in different scopes during GC.
+    base::TimeDelta scopes[Scope::NUMBER_OF_SCOPES];
 
     // Holds details for incremental marking scopes.
-    IncrementalMarkingInfos
-        incremental_scopes[Scope::NUMBER_OF_INCREMENTAL_SCOPES];
+    IncrementalInfos incremental_scopes[Scope::NUMBER_OF_INCREMENTAL_SCOPES];
   };
 
-  class RecordGCPhasesInfo {
+  class RecordGCPhasesInfo final {
    public:
-    RecordGCPhasesInfo(Heap* heap, GarbageCollector collector);
+    RecordGCPhasesInfo(Heap* heap, GarbageCollector collector,
+                       GarbageCollectionReason reason);
 
     enum class Mode { None, Scavenger, Finalize };
 
     Mode mode() const { return mode_; }
     const char* trace_event_name() const { return trace_event_name_; }
 
-    // The timer used for a given GC type:
-    // - GCScavenger: young generation GC
-    // - GCCompactor: full GC
-    // - GCFinalizeMC: finalization of incremental full GC
-    // - GCFinalizeMCReduceMemory: finalization of incremental full GC with
-    //   memory reduction.
+    // The timers are based on Gc types and the kinds of GC being invoked.
     TimedHistogram* type_timer() const { return type_timer_; }
     TimedHistogram* type_priority_timer() const { return type_priority_timer_; }
 
@@ -228,7 +251,8 @@ class V8_EXPORT_PRIVATE GCTracer {
     TimedHistogram* type_priority_timer_;
   };
 
-  static const int kThroughputTimeFrameMs = 5000;
+  static constexpr base::TimeDelta kThroughputTimeFrame =
+      base::TimeDelta::FromSeconds(5);
   static constexpr double kConservativeSpeedInBytesPerMillisecond = 128 * KB;
 
   static double CombineSpeedsInBytesPerMillisecond(double default_speed,
@@ -238,21 +262,22 @@ class V8_EXPORT_PRIVATE GCTracer {
   V8_INLINE static RuntimeCallCounterId RCSCounterFromScope(Scope::ScopeId id);
 #endif  // defined(V8_RUNTIME_CALL_STATS)
 
-  explicit GCTracer(Heap* heap);
+  explicit GCTracer(Heap* heap, GarbageCollectionReason initial_gc_reason =
+                                    GarbageCollectionReason::kUnknown);
+
+  GCTracer(const GCTracer&) = delete;
+  GCTracer& operator=(const GCTracer&) = delete;
 
   V8_INLINE CollectionEpoch CurrentEpoch(Scope::ScopeId id) const;
 
   // Start and stop an observable pause.
-  void StartObservablePause();
-  void StopObservablePause();
+  void StartObservablePause(base::TimeTicks time);
+  void StopObservablePause(GarbageCollector collector, base::TimeTicks time);
 
   // Update the current event if it precedes the start of the observable pause.
   void UpdateCurrentEvent(GarbageCollectionReason gc_reason,
                           const char* collector_reason);
 
-  void UpdateStatistics(GarbageCollector collector);
-  void FinalizeCurrentEvent();
-
   enum class MarkingType { kAtomic, kIncremental };
 
   // Start and stop a GC cycle (collecting data and reporting results).
@@ -276,24 +301,24 @@ class V8_EXPORT_PRIVATE GCTracer {
   void NotifyYoungCppGCCompleted();
 
 #ifdef DEBUG
-  V8_INLINE bool IsInObservablePause() const;
-  V8_INLINE bool IsInAtomicPause() const;
+  bool IsInObservablePause() const;
+  bool IsInAtomicPause() const;
 
   // Checks if the current event is consistent with a collector.
-  V8_INLINE bool IsConsistentWithCollector(GarbageCollector collector) const;
+  bool IsConsistentWithCollector(GarbageCollector collector) const;
 
   // Checks if the current event corresponds to a full GC cycle whose sweeping
   // has not finalized yet.
-  V8_INLINE bool IsSweepingInProgress() const;
+  bool IsSweepingInProgress() const;
 #endif
 
   // Sample and accumulate bytes allocated since the last GC.
-  void SampleAllocation(double current_ms, size_t new_space_counter_bytes,
+  void SampleAllocation(base::TimeTicks current, size_t new_space_counter_bytes,
                         size_t old_generation_counter_bytes,
                         size_t embedder_counter_bytes);
 
   // Log the accumulated new space allocation bytes.
-  void AddAllocation(double current_ms);
+  void AddAllocation(base::TimeTicks current);
 
   void AddCompactionEvent(double duration, size_t live_bytes_compacted);
 
@@ -338,24 +363,25 @@ class V8_EXPORT_PRIVATE GCTracer {
   // Allocation throughput in the new space in bytes/millisecond.
   // Returns 0 if no allocation events have been recorded.
   double NewSpaceAllocationThroughputInBytesPerMillisecond(
-      double time_ms = 0) const;
+      base::Optional<base::TimeDelta> selected_duration = base::nullopt) const;
 
   // Allocation throughput in the old generation in bytes/millisecond in the
   // last time_ms milliseconds.
   // Returns 0 if no allocation events have been recorded.
   double OldGenerationAllocationThroughputInBytesPerMillisecond(
-      double time_ms = 0) const;
+      base::Optional<base::TimeDelta> selected_duration = base::nullopt) const;
 
   // Allocation throughput in the embedder in bytes/millisecond in the
   // last time_ms milliseconds.
   // Returns 0 if no allocation events have been recorded.
   double EmbedderAllocationThroughputInBytesPerMillisecond(
-      double time_ms = 0) const;
+      base::Optional<base::TimeDelta> selected_duration = base::nullopt) const;
 
   // Allocation throughput in heap in bytes/millisecond in the last time_ms
   // milliseconds.
   // Returns 0 if no allocation events have been recorded.
-  double AllocationThroughputInBytesPerMillisecond(double time_ms) const;
+  double AllocationThroughputInBytesPerMillisecond(
+      base::Optional<base::TimeDelta> selected_duration) const;
 
   // Allocation throughput in heap in bytes/milliseconds in the last
   // kThroughputTimeFrameMs seconds.
@@ -385,12 +411,19 @@ class V8_EXPORT_PRIVATE GCTracer {
 
   void NotifyIncrementalMarkingStart();
 
+  // Invoked when starting marking - either incremental or as part of the atomic
+  // pause. Used for computing/updating code flushing increase.
+  void NotifyMarkingStart();
+
+  // Returns the current cycle's code flushing increase in seconds.
+  uint16_t CodeFlushingIncrease() const;
+
   // Returns average mutator utilization with respect to mark-compact
   // garbage collections. This ignores scavenger.
   double AverageMarkCompactMutatorUtilization() const;
   double CurrentMarkCompactMutatorUtilization() const;
 
-  V8_INLINE void AddScopeSample(Scope::ScopeId id, double duration);
+  V8_INLINE void AddScopeSample(Scope::ScopeId id, base::TimeDelta duration);
 
   void RecordGCPhasesHistograms(RecordGCPhasesInfo::Mode mode);
 
@@ -398,37 +431,17 @@ class V8_EXPORT_PRIVATE GCTracer {
 
   // Returns the average time between scheduling and invocation of an
   // incremental marking task.
-  double AverageTimeToIncrementalMarkingTask() const;
-  void RecordTimeToIncrementalMarkingTask(double time_to_task);
+  base::Optional<base::TimeDelta> AverageTimeToIncrementalMarkingTask() const;
+  void RecordTimeToIncrementalMarkingTask(base::TimeDelta time_to_task);
 
 #ifdef V8_RUNTIME_CALL_STATS
   V8_INLINE WorkerThreadRuntimeCallStats* worker_thread_runtime_call_stats();
 #endif  // defined(V8_RUNTIME_CALL_STATS)
 
-  bool IsCurrentGCDueToAllocationFailure() const {
-    return current_.gc_reason == GarbageCollectionReason::kAllocationFailure;
-  }
-
   GarbageCollector GetCurrentCollector() const;
 
  private:
-  FRIEND_TEST(GCTracer, AverageSpeed);
-  FRIEND_TEST(GCTracerTest, AllocationThroughput);
-  FRIEND_TEST(GCTracerTest, BackgroundScavengerScope);
-  FRIEND_TEST(GCTracerTest, BackgroundMinorMCScope);
-  FRIEND_TEST(GCTracerTest, BackgroundMajorMCScope);
-  FRIEND_TEST(GCTracerTest, EmbedderAllocationThroughput);
-  FRIEND_TEST(GCTracerTest, MultithreadedBackgroundScope);
-  FRIEND_TEST(GCTracerTest, NewSpaceAllocationThroughput);
-  FRIEND_TEST(GCTracerTest, PerGenerationAllocationThroughput);
-  FRIEND_TEST(GCTracerTest, PerGenerationAllocationThroughputWithProvidedTime);
-  FRIEND_TEST(GCTracerTest, RegularScope);
-  FRIEND_TEST(GCTracerTest, IncrementalMarkingDetails);
-  FRIEND_TEST(GCTracerTest, IncrementalScope);
-  FRIEND_TEST(GCTracerTest, IncrementalMarkingSpeed);
-  FRIEND_TEST(GCTracerTest, MutatorUtilization);
-  FRIEND_TEST(GCTracerTest, RecordMarkCompactHistograms);
-  FRIEND_TEST(GCTracerTest, RecordScavengerHistograms);
+  using BytesAndDurationBuffer = ::heap::base::BytesAndDurationBuffer;
 
   struct BackgroundCounter {
     double total_duration_ms;
@@ -436,37 +449,25 @@ class V8_EXPORT_PRIVATE GCTracer {
 
   void StopCycle(GarbageCollector collector);
 
-  // Statistics for incremental and background scopes are kept out of the
-  // current event and only copied there by FinalizeCurrentEvent, at StopCycle.
-  // This method can be used to access scopes correctly, before this happens.
-  // Note: when accessing a background scope via this method, the caller is
-  // responsible for avoiding data races, e.g., by acquiring
-  // background_counter_mutex_.
-  V8_INLINE constexpr double current_scope(Scope::ScopeId id) const;
+  // Statistics for background scopes are kept out of the current event and only
+  // copied there via FetchBackgroundCounters(). This method here is thread-safe
+  // but may return out-of-date numbers as it only considers data from the
+  // current Event.
+  V8_INLINE double current_scope(Scope::ScopeId id) const;
 
-  V8_INLINE constexpr const IncrementalMarkingInfos& incremental_scope(
+  V8_INLINE constexpr const IncrementalInfos& incremental_scope(
       Scope::ScopeId id) const;
 
-  // Returns the average speed of the events in the buffer.
-  // If the buffer is empty, the result is 0.
-  // Otherwise, the result is between 1 byte/ms and 1 GB/ms.
-  static double AverageSpeed(const base::RingBuffer<BytesAndDuration>& buffer);
-  static double AverageSpeed(const base::RingBuffer<BytesAndDuration>& buffer,
-                             const BytesAndDuration& initial, double time_ms);
-
   void ResetForTesting();
-  void ResetIncrementalMarkingCounters();
-  void RecordIncrementalMarkingSpeed(size_t bytes, double duration);
-  void RecordMutatorUtilization(double mark_compactor_end_time,
-                                double mark_compactor_duration);
+  void RecordIncrementalMarkingSpeed(size_t bytes, base::TimeDelta duration);
+  void RecordMutatorUtilization(base::TimeTicks mark_compactor_end_time,
+                                base::TimeDelta mark_compactor_duration);
 
   // Update counters for an entire full GC cycle. Exact accounting of events
   // within a GC is not necessary which is why the recording takes place at the
   // end of the atomic pause.
   void RecordGCSumCounters();
 
-  V8_INLINE double MonotonicallyIncreasingTimeInMs();
-
   // Print one detailed trace line in name=value format.
   // TODO(ernstm): Move to Heap.
   void PrintNVP() const;
@@ -479,10 +480,7 @@ class V8_EXPORT_PRIVATE GCTracer {
   // it can be included in later crash dumps.
   void PRINTF_FORMAT(2, 3) Output(const char* format, ...) const;
 
-  void FetchBackgroundCounters(int first_scope, int last_scope);
-  void FetchBackgroundMinorGCCounters();
-  void FetchBackgroundMarkCompactCounters();
-  void FetchBackgroundGeneralCounters();
+  void FetchBackgroundCounters();
 
   void ReportFullCycleToRecorder();
   void ReportIncrementalMarkingStepToRecorder(double v8_duration);
@@ -499,8 +497,8 @@ class V8_EXPORT_PRIVATE GCTracer {
   // Previous tracer event.
   Event previous_;
 
-  // The starting time of the observable pause or 0.0 if we're not inside it.
-  double start_of_observable_pause_ = 0.0;
+  // The starting time of the observable pause if set.
+  base::Optional<base::TimeTicks> start_of_observable_pause_;
 
   // We need two epochs, since there can be scavenges during incremental
   // marking.
@@ -509,56 +507,58 @@ class V8_EXPORT_PRIVATE GCTracer {
 
   // Size of incremental marking steps (in bytes) accumulated since the end of
   // the last mark compact GC.
-  size_t incremental_marking_bytes_;
+  size_t incremental_marking_bytes_ = 0;
 
-  // Duration (in ms) of incremental marking steps since the end of the last
+  // Duration of incremental marking steps since the end of the last
   // mark-compact event.
-  double incremental_marking_duration_;
+  base::TimeDelta incremental_marking_duration_;
 
-  double incremental_marking_start_time_;
+  base::TimeTicks incremental_marking_start_time_;
 
-  double recorded_incremental_marking_speed_;
+  double recorded_incremental_marking_speed_ = 0.0;
 
-  double average_time_to_incremental_marking_task_ = 0.0;
+  base::Optional<base::TimeDelta> average_time_to_incremental_marking_task_;
 
   double recorded_embedder_speed_ = 0.0;
 
+  base::Optional<base::TimeTicks> last_marking_start_time_;
+  uint16_t code_flushing_increase_s_ = 0;
+
   // Incremental scopes carry more information than just the duration. The infos
   // here are merged back upon starting/stopping the GC tracer.
-  IncrementalMarkingInfos
-      incremental_scopes_[Scope::NUMBER_OF_INCREMENTAL_SCOPES];
+  IncrementalInfos incremental_scopes_[Scope::NUMBER_OF_INCREMENTAL_SCOPES];
 
   // Timestamp and allocation counter at the last sampled allocation event.
-  double allocation_time_ms_;
-  size_t new_space_allocation_counter_bytes_;
-  size_t old_generation_allocation_counter_bytes_;
-  size_t embedder_allocation_counter_bytes_;
+  base::Optional<base::TimeTicks> allocation_time_;
+  size_t new_space_allocation_counter_bytes_ = 0;
+  size_t old_generation_allocation_counter_bytes_ = 0;
+  size_t embedder_allocation_counter_bytes_ = 0;
 
   // Accumulated duration (in ms) and allocated bytes since the last GC.
-  double allocation_duration_since_gc_;
-  size_t new_space_allocation_in_bytes_since_gc_;
-  size_t old_generation_allocation_in_bytes_since_gc_;
-  size_t embedder_allocation_in_bytes_since_gc_;
-
-  double combined_mark_compact_speed_cache_;
+  double allocation_duration_since_gc_ = 0.0;
+  size_t new_space_allocation_in_bytes_since_gc_ = 0;
+  size_t old_generation_allocation_in_bytes_since_gc_ = 0;
+  size_t embedder_allocation_in_bytes_since_gc_ = 0;
 
-  // Counts how many tracers were started without stopping.
-  int start_counter_;
+  double combined_mark_compact_speed_cache_ = 0.0;
 
   // Used for computing average mutator utilization.
-  double average_mutator_duration_;
-  double average_mark_compact_duration_;
-  double current_mark_compact_mutator_utilization_;
-  double previous_mark_compact_end_time_;
-
-  base::RingBuffer<BytesAndDuration> recorded_minor_gcs_total_;
-  base::RingBuffer<BytesAndDuration> recorded_minor_gcs_survived_;
-  base::RingBuffer<BytesAndDuration> recorded_compactions_;
-  base::RingBuffer<BytesAndDuration> recorded_incremental_mark_compacts_;
-  base::RingBuffer<BytesAndDuration> recorded_mark_compacts_;
-  base::RingBuffer<BytesAndDuration> recorded_new_generation_allocations_;
-  base::RingBuffer<BytesAndDuration> recorded_old_generation_allocations_;
-  base::RingBuffer<BytesAndDuration> recorded_embedder_generation_allocations_;
+  double average_mutator_duration_ = 0.0;
+  double average_mark_compact_duration_ = 0.0;
+  double current_mark_compact_mutator_utilization_ = 1.0;
+
+  // The end of the last mark-compact GC. Is set to isolate/heap setup time
+  // before the first one.
+  base::TimeTicks previous_mark_compact_end_time_;
+
+  BytesAndDurationBuffer recorded_minor_gcs_total_;
+  BytesAndDurationBuffer recorded_minor_gcs_survived_;
+  BytesAndDurationBuffer recorded_compactions_;
+  BytesAndDurationBuffer recorded_incremental_mark_compacts_;
+  BytesAndDurationBuffer recorded_mark_compacts_;
+  BytesAndDurationBuffer recorded_new_generation_allocations_;
+  BytesAndDurationBuffer recorded_old_generation_allocations_;
+  BytesAndDurationBuffer recorded_embedder_generation_allocations_;
   base::RingBuffer<double> recorded_survival_ratios_;
 
   // A full GC cycle stops only when both v8 and cppgc (if available) GCs have
@@ -584,10 +584,31 @@ class V8_EXPORT_PRIVATE GCTracer {
   v8::metrics::GarbageCollectionFullMainThreadBatchedIncrementalSweep
       incremental_sweep_batched_events_;
 
-  mutable base::Mutex background_counter_mutex_;
-  BackgroundCounter background_counter_[Scope::NUMBER_OF_SCOPES];
+  mutable base::Mutex background_scopes_mutex_;
+  base::TimeDelta background_scopes_[Scope::NUMBER_OF_SCOPES];
+
+  base::TimeDelta concurrent_gc_time_;
+
+  FRIEND_TEST(GCTracerTest, AllocationThroughput);
+  FRIEND_TEST(GCTracerTest, BackgroundScavengerScope);
+  FRIEND_TEST(GCTracerTest, BackgroundMinorMSScope);
+  FRIEND_TEST(GCTracerTest, BackgroundMajorMCScope);
+  FRIEND_TEST(GCTracerTest, EmbedderAllocationThroughput);
+  FRIEND_TEST(GCTracerTest, MultithreadedBackgroundScope);
+  FRIEND_TEST(GCTracerTest, NewSpaceAllocationThroughput);
+  FRIEND_TEST(GCTracerTest, PerGenerationAllocationThroughput);
+  FRIEND_TEST(GCTracerTest, PerGenerationAllocationThroughputWithProvidedTime);
+  FRIEND_TEST(GCTracerTest, RegularScope);
+  FRIEND_TEST(GCTracerTest, IncrementalMarkingDetails);
+  FRIEND_TEST(GCTracerTest, IncrementalScope);
+  FRIEND_TEST(GCTracerTest, IncrementalMarkingSpeed);
+  FRIEND_TEST(GCTracerTest, MutatorUtilization);
+  FRIEND_TEST(GCTracerTest, RecordMarkCompactHistograms);
+  FRIEND_TEST(GCTracerTest, RecordScavengerHistograms);
 };
 
+const char* ToString(GCTracer::Event::Type type, bool short_name);
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/heap-allocator-inl.h b/deps/v8/src/heap/heap-allocator-inl.h
index ad49b902a2dcf0..139844a832adb3 100644
--- a/deps/v8/src/heap/heap-allocator-inl.h
+++ b/deps/v8/src/heap/heap-allocator-inl.h
@@ -14,6 +14,7 @@
 #include "src/heap/paged-spaces.h"
 #include "src/heap/read-only-spaces.h"
 #include "src/heap/third-party/heap-api.h"
+#include "src/heap/zapping.h"
 
 namespace v8 {
 namespace internal {
@@ -85,7 +86,7 @@ V8_WARN_UNUSED_RESULT V8_INLINE AllocationResult HeapAllocator::AllocateRaw(
   const bool large_object =
       static_cast<size_t>(size_in_bytes) > large_object_threshold;
 
-  HeapObject object;
+  Tagged<HeapObject> object;
   AllocationResult allocation;
 
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
@@ -105,12 +106,15 @@ V8_WARN_UNUSED_RESULT V8_INLINE AllocationResult HeapAllocator::AllocateRaw(
           allocation =
               old_space()->AllocateRaw(size_in_bytes, alignment, origin);
           break;
-        case AllocationType::kCode:
+        case AllocationType::kCode: {
           DCHECK_EQ(alignment, AllocationAlignment::kTaggedAligned);
           DCHECK(AllowCodeAllocation::IsAllowed());
+          CodePageHeaderModificationScope header_modification_scope(
+              "Code allocation needs header access.");
           allocation = code_space()->AllocateRaw(
               size_in_bytes, AllocationAlignment::kTaggedAligned);
           break;
+        }
         case AllocationType::kReadOnly:
           DCHECK(read_only_space()->writable());
           DCHECK_EQ(AllocationOrigin::kRuntime, origin);
@@ -126,17 +130,9 @@ V8_WARN_UNUSED_RESULT V8_INLINE AllocationResult HeapAllocator::AllocateRaw(
   }
 
   if (allocation.To(&object)) {
-    if (AllocationType::kCode == type && !V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
-      // Unprotect the memory chunk of the object if it was not unprotected
-      // already.
-      heap_->UnprotectAndRegisterMemoryChunk(
-          object, UnprotectMemoryOrigin::kMainThread);
-      heap_->ZapCodeObject(object.address(), size_in_bytes);
-      if (!large_object) {
-        MemoryChunk::FromHeapObject(object)
-            ->GetCodeObjectRegistry()
-            ->RegisterNewlyAllocatedCodeObject(object.address());
-      }
+    if (heap::ShouldZapGarbage() && AllocationType::kCode == type &&
+        !V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
+      heap::ZapCodeBlock(object.address(), size_in_bytes);
     }
 
     for (auto& tracker : heap_->allocation_trackers_) {
@@ -199,11 +195,12 @@ AllocationResult HeapAllocator::AllocateRawData(int size_in_bytes,
 }
 
 template <HeapAllocator::AllocationRetryMode mode>
-V8_WARN_UNUSED_RESULT V8_INLINE HeapObject HeapAllocator::AllocateRawWith(
-    int size, AllocationType allocation, AllocationOrigin origin,
-    AllocationAlignment alignment) {
+V8_WARN_UNUSED_RESULT V8_INLINE Tagged<HeapObject>
+HeapAllocator::AllocateRawWith(int size, AllocationType allocation,
+                               AllocationOrigin origin,
+                               AllocationAlignment alignment) {
   AllocationResult result;
-  HeapObject object;
+  Tagged<HeapObject> object;
   size = ALIGN_TO_ALLOCATION_ALIGNMENT(size);
   if (allocation == AllocationType::kYoung) {
     result = AllocateRaw<AllocationType::kYoung>(size, origin, alignment);
diff --git a/deps/v8/src/heap/heap-allocator.h b/deps/v8/src/heap/heap-allocator.h
index ec85af38adaa4d..568ce0f0abe0b5 100644
--- a/deps/v8/src/heap/heap-allocator.h
+++ b/deps/v8/src/heap/heap-allocator.h
@@ -60,10 +60,10 @@ class V8_EXPORT_PRIVATE HeapAllocator final {
 
   // Supports all `AllocationType` types and allows specifying retry handling.
   template <AllocationRetryMode mode>
-  V8_WARN_UNUSED_RESULT V8_INLINE HeapObject
-  AllocateRawWith(int size, AllocationType allocation,
-                  AllocationOrigin origin = AllocationOrigin::kRuntime,
-                  AllocationAlignment alignment = kTaggedAligned);
+  V8_WARN_UNUSED_RESULT V8_INLINE Tagged<HeapObject> AllocateRawWith(
+      int size, AllocationType allocation,
+      AllocationOrigin origin = AllocationOrigin::kRuntime,
+      AllocationAlignment alignment = kTaggedAligned);
 
   V8_INLINE bool CanAllocateInReadOnlySpace() const;
 
diff --git a/deps/v8/src/heap/heap-inl.h b/deps/v8/src/heap/heap-inl.h
index 28ca220af12fa6..294b9a9f4d0710 100644
--- a/deps/v8/src/heap/heap-inl.h
+++ b/deps/v8/src/heap/heap-inl.h
@@ -18,7 +18,6 @@
 #include "src/common/code-memory-access-inl.h"
 #include "src/execution/isolate-data.h"
 #include "src/execution/isolate.h"
-#include "src/heap/code-object-registry.h"
 #include "src/heap/concurrent-allocator-inl.h"
 #include "src/heap/concurrent-allocator.h"
 #include "src/heap/heap-allocator-inl.h"
@@ -58,14 +57,14 @@ namespace v8 {
 namespace internal {
 
 template <typename T>
-T ForwardingAddress(T heap_obj) {
-  MapWord map_word = heap_obj.map_word(kRelaxedLoad);
+Tagged<T> ForwardingAddress(Tagged<T> heap_obj) {
+  MapWord map_word = heap_obj->map_word(kRelaxedLoad);
 
   if (map_word.IsForwardingAddress()) {
-    return T::cast(map_word.ToForwardingAddress(heap_obj));
+    return Tagged<T>::cast(map_word.ToForwardingAddress(heap_obj));
   } else if (Heap::InFromPage(heap_obj)) {
-    DCHECK(!v8_flags.minor_mc);
-    return T();
+    DCHECK(!v8_flags.minor_ms);
+    return Tagged<T>();
   } else {
     return heap_obj;
   }
@@ -118,16 +117,17 @@ int64_t Heap::update_external_memory(int64_t delta) {
 
 RootsTable& Heap::roots_table() { return isolate()->roots_table(); }
 
-#define ROOT_ACCESSOR(Type, name, CamelName)                           \
-  Type Heap::name() {                                                  \
-    return Type::cast(Object(roots_table()[RootIndex::k##CamelName])); \
+#define ROOT_ACCESSOR(Type, name, CamelName)                     \
+  Tagged<Type> Heap::name() {                                    \
+    return Tagged<Type>::cast(                                   \
+        Tagged<Object>(roots_table()[RootIndex::k##CamelName])); \
   }
 MUTABLE_ROOT_LIST(ROOT_ACCESSOR)
 #undef ROOT_ACCESSOR
 
-FixedArray Heap::single_character_string_table() {
-  return FixedArray::cast(
-      Object(roots_table()[RootIndex::kSingleCharacterStringTable]));
+Tagged<FixedArray> Heap::single_character_string_table() {
+  return Tagged<FixedArray>::cast(
+      Tagged<Object>(roots_table()[RootIndex::kSingleCharacterStringTable]));
 }
 
 #define STATIC_ROOTS_FAILED_MSG                                            \
@@ -149,13 +149,19 @@ FixedArray Heap::single_character_string_table() {
 #endif
 
 #define ROOT_ACCESSOR(type, name, CamelName)                                   \
-  void Heap::set_##name(type value) {                                          \
+  void Heap::set_##name(Tagged<type> value) {                                  \
     /* The deserializer makes use of the fact that these common roots are */   \
     /* never in new space and never on a page that is being compacted.    */   \
     DCHECK_IMPLIES(deserialization_complete(),                                 \
                    !RootsTable::IsImmortalImmovable(RootIndex::k##CamelName)); \
-    DCHECK_IMPLIES(RootsTable::IsImmortalImmovable(RootIndex::k##CamelName),   \
-                   IsImmovable(HeapObject::cast(value)));                      \
+    if constexpr (RootsTable::IsImmortalImmovable(RootIndex::k##CamelName)) {  \
+      /* Cast via object to avoid compile errors when trying to cast a Smi */  \
+      /* to HeapObject (these Smis will anyway be excluded by */               \
+      /* RootsTable::IsImmortalImmovable but this isn't enough for the*/       \
+      /* compiler, even with `if constexpr`)*/                                 \
+      DCHECK(                                                                  \
+          IsImmovable(Tagged<HeapObject>::cast(Tagged<Object>::cast(value)))); \
+    }                                                                          \
     DCHECK_STATIC_ROOT(value, CamelName);                                      \
     roots_table()[RootIndex::k##CamelName] = value.ptr();                      \
   }
@@ -164,20 +170,20 @@ ROOT_LIST(ROOT_ACCESSOR)
 #undef CHECK_STATIC_ROOT
 #undef STATIC_ROOTS_FAILED_MSG
 
-void Heap::SetRootMaterializedObjects(FixedArray objects) {
+void Heap::SetRootMaterializedObjects(Tagged<FixedArray> objects) {
   roots_table()[RootIndex::kMaterializedObjects] = objects.ptr();
 }
 
-void Heap::SetRootScriptList(Object value) {
+void Heap::SetRootScriptList(Tagged<Object> value) {
   roots_table()[RootIndex::kScriptList] = value.ptr();
 }
 
-void Heap::SetMessageListeners(TemplateList value) {
+void Heap::SetMessageListeners(Tagged<ArrayList> value) {
   roots_table()[RootIndex::kMessageListeners] = value.ptr();
 }
 
-void Heap::SetFunctionsMarkedForManualOptimization(Object hash_table) {
-  DCHECK(hash_table.IsObjectHashTable() || hash_table.IsUndefined(isolate()));
+void Heap::SetFunctionsMarkedForManualOptimization(Tagged<Object> hash_table) {
+  DCHECK(IsObjectHashTable(hash_table) || IsUndefined(hash_table, isolate()));
   roots_table()[RootIndex::kFunctionsMarkedForManualOptimization] =
       hash_table.ptr();
 }
@@ -243,43 +249,43 @@ Address Heap::AllocateRawOrFail(int size, AllocationType allocation,
       .address();
 }
 
-void Heap::RegisterExternalString(String string) {
-  DCHECK(string.IsExternalString());
-  DCHECK(!string.IsThinString());
+void Heap::RegisterExternalString(Tagged<String> string) {
+  DCHECK(IsExternalString(string));
+  DCHECK(!IsThinString(string));
   external_string_table_.AddString(string);
 }
 
-void Heap::FinalizeExternalString(String string) {
-  DCHECK(string.IsExternalString());
-  ExternalString ext_string = ExternalString::cast(string);
+void Heap::FinalizeExternalString(Tagged<String> string) {
+  DCHECK(IsExternalString(string));
+  Tagged<ExternalString> ext_string = Tagged<ExternalString>::cast(string);
 
   if (!v8_flags.enable_third_party_heap) {
     Page* page = Page::FromHeapObject(string);
     page->DecrementExternalBackingStoreBytes(
         ExternalBackingStoreType::kExternalString,
-        ext_string.ExternalPayloadSize());
+        ext_string->ExternalPayloadSize());
   }
 
-  ext_string.DisposeResource(isolate());
+  ext_string->DisposeResource(isolate());
 }
 
 Address Heap::NewSpaceTop() {
   return new_space_ ? new_space_->top() : kNullAddress;
 }
 
-bool Heap::InYoungGeneration(Object object) {
+bool Heap::InYoungGeneration(Tagged<Object> object) {
   DCHECK(!HasWeakHeapObjectTag(object));
-  return object.IsHeapObject() && InYoungGeneration(HeapObject::cast(object));
+  return IsHeapObject(object) && InYoungGeneration(HeapObject::cast(object));
 }
 
 // static
 bool Heap::InYoungGeneration(MaybeObject object) {
-  HeapObject heap_object;
-  return object->GetHeapObject(&heap_object) && InYoungGeneration(heap_object);
+  Tagged<HeapObject> heap_object;
+  return object.GetHeapObject(&heap_object) && InYoungGeneration(heap_object);
 }
 
 // static
-bool Heap::InYoungGeneration(HeapObject heap_object) {
+bool Heap::InYoungGeneration(Tagged<HeapObject> heap_object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return false;
   bool result =
       BasicMemoryChunk::FromHeapObject(heap_object)->InYoungGeneration();
@@ -298,46 +304,46 @@ bool Heap::InYoungGeneration(HeapObject heap_object) {
 
 // static
 bool Heap::InWritableSharedSpace(MaybeObject object) {
-  HeapObject heap_object;
-  return object->GetHeapObject(&heap_object) &&
+  Tagged<HeapObject> heap_object;
+  return object.GetHeapObject(&heap_object) &&
          heap_object.InWritableSharedSpace();
 }
 
 // static
-bool Heap::InFromPage(Object object) {
+bool Heap::InFromPage(Tagged<Object> object) {
   DCHECK(!HasWeakHeapObjectTag(object));
-  return object.IsHeapObject() && InFromPage(HeapObject::cast(object));
+  return IsHeapObject(object) && InFromPage(HeapObject::cast(object));
 }
 
 // static
 bool Heap::InFromPage(MaybeObject object) {
-  HeapObject heap_object;
-  return object->GetHeapObject(&heap_object) && InFromPage(heap_object);
+  Tagged<HeapObject> heap_object;
+  return object.GetHeapObject(&heap_object) && InFromPage(heap_object);
 }
 
 // static
-bool Heap::InFromPage(HeapObject heap_object) {
+bool Heap::InFromPage(Tagged<HeapObject> heap_object) {
   return BasicMemoryChunk::FromHeapObject(heap_object)->IsFromPage();
 }
 
 // static
-bool Heap::InToPage(Object object) {
+bool Heap::InToPage(Tagged<Object> object) {
   DCHECK(!HasWeakHeapObjectTag(object));
-  return object.IsHeapObject() && InToPage(HeapObject::cast(object));
+  return IsHeapObject(object) && InToPage(HeapObject::cast(object));
 }
 
 // static
 bool Heap::InToPage(MaybeObject object) {
-  HeapObject heap_object;
-  return object->GetHeapObject(&heap_object) && InToPage(heap_object);
+  Tagged<HeapObject> heap_object;
+  return object.GetHeapObject(&heap_object) && InToPage(heap_object);
 }
 
 // static
-bool Heap::InToPage(HeapObject heap_object) {
+bool Heap::InToPage(Tagged<HeapObject> heap_object) {
   return BasicMemoryChunk::FromHeapObject(heap_object)->IsToPage();
 }
 
-bool Heap::InOldSpace(Object object) {
+bool Heap::InOldSpace(Tagged<Object> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
     return object.IsHeapObject() &&
            third_party_heap::Heap::InOldSpace(object.ptr());
@@ -346,7 +352,7 @@ bool Heap::InOldSpace(Object object) {
 }
 
 // static
-Heap* Heap::FromWritableHeapObject(HeapObject obj) {
+Heap* Heap::FromWritableHeapObject(Tagged<HeapObject> obj) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
     return Heap::GetIsolateFromWritableObject(obj)->heap();
   }
@@ -365,7 +371,7 @@ void Heap::CopyBlock(Address dst, Address src, int byte_size) {
   CopyTagged(dst, src, static_cast<size_t>(byte_size / kTaggedSize));
 }
 
-bool Heap::IsPendingAllocationInternal(HeapObject object) {
+bool Heap::IsPendingAllocationInternal(Tagged<HeapObject> object) {
   DCHECK(deserialization_complete());
 
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
@@ -422,7 +428,7 @@ bool Heap::IsPendingAllocationInternal(HeapObject object) {
   UNREACHABLE();
 }
 
-bool Heap::IsPendingAllocation(HeapObject object) {
+bool Heap::IsPendingAllocation(Tagged<HeapObject> object) {
   bool result = IsPendingAllocationInternal(object);
   if (v8_flags.trace_pending_allocations && result) {
     StdoutStream{} << "Pending allocation: " << std::hex << "0x" << object.ptr()
@@ -431,12 +437,21 @@ bool Heap::IsPendingAllocation(HeapObject object) {
   return result;
 }
 
-bool Heap::IsPendingAllocation(Object object) {
-  return object.IsHeapObject() && IsPendingAllocation(HeapObject::cast(object));
+bool Heap::IsPendingAllocation(Tagged<Object> object) {
+  return IsHeapObject(object) && IsPendingAllocation(HeapObject::cast(object));
 }
 
-void Heap::ExternalStringTable::AddString(String string) {
-  DCHECK(string.IsExternalString());
+void Heap::ExternalStringTable::AddString(Tagged<String> string) {
+  base::Optional<base::MutexGuard> guard;
+
+  // With --shared-string-table client isolates may insert into the main
+  // isolate's table concurrently.
+  if (v8_flags.shared_string_table &&
+      heap_->isolate()->is_shared_space_isolate()) {
+    guard.emplace(&mutex_);
+  }
+
+  DCHECK(IsExternalString(string));
   DCHECK(!Contains(string));
 
   if (InYoungGeneration(string)) {
@@ -446,15 +461,15 @@ void Heap::ExternalStringTable::AddString(String string) {
   }
 }
 
-Oddball Heap::ToBoolean(bool condition) {
+Tagged<Boolean> Heap::ToBoolean(bool condition) {
   ReadOnlyRoots roots(this);
-  return condition ? roots.true_value() : roots.false_value();
+  return roots.boolean_value(condition);
 }
 
 int Heap::NextScriptId() {
   FullObjectSlot last_script_id_slot(&roots_table()[RootIndex::kLastScriptId]);
-  Smi last_id = Smi::cast(last_script_id_slot.Relaxed_Load());
-  Smi new_id, last_id_before_cas;
+  Tagged<Smi> last_id = Smi::cast(last_script_id_slot.Relaxed_Load());
+  Tagged<Smi> new_id, last_id_before_cas;
   do {
     if (last_id.value() == Smi::kMaxValue) {
       static_assert(v8::UnboundScript::kNoScriptId == 0);
@@ -519,7 +534,7 @@ void Heap::DecrementExternalBackingStoreBytes(ExternalBackingStoreType type,
 }
 
 bool Heap::HasDirtyJSFinalizationRegistries() {
-  return !dirty_js_finalization_registries_list().IsUndefined(isolate());
+  return !IsUndefined(dirty_js_finalization_registries_list(), isolate());
 }
 
 AlwaysAllocateScope::AlwaysAllocateScope(Heap* heap) : heap_(heap) {
@@ -533,89 +548,10 @@ AlwaysAllocateScope::~AlwaysAllocateScope() {
 AlwaysAllocateScopeForTesting::AlwaysAllocateScopeForTesting(Heap* heap)
     : scope_(heap) {}
 
-CodeSpaceMemoryModificationScope::CodeSpaceMemoryModificationScope(Heap* heap)
-    :
-#if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
-      rwx_write_scope_("A part of CodeSpaceMemoryModificationScope"),
-#endif
-      heap_(heap) {
-  DCHECK_EQ(ThreadId::Current(), heap_->isolate()->thread_id());
-  heap_->safepoint()->AssertActive();
-  if (heap_->write_protect_code_memory()) {
-    heap_->increment_code_space_memory_modification_scope_depth();
-    heap_->code_space()->SetCodeModificationPermissions();
-    LargePage* page = heap_->code_lo_space()->first_page();
-    while (page != nullptr) {
-      DCHECK(page->IsFlagSet(MemoryChunk::IS_EXECUTABLE));
-      DCHECK(heap_->memory_allocator()->IsMemoryChunkExecutable(page));
-      page->SetCodeModificationPermissions();
-      page = page->next_page();
-    }
-  }
-}
-
-void Heap::IncrementCodePageCollectionMemoryModificationScopeDepth() {
-  LocalHeap* local_heap = isolate()->CurrentLocalHeap();
-  local_heap->code_page_collection_memory_modification_scope_depth_++;
-
-#if DEBUG
-  // Maximum number of nested scopes.
-  static constexpr int kMaxCodePageCollectionMemoryModificationScopeDepth = 2;
-  DCHECK_LE(local_heap->code_page_collection_memory_modification_scope_depth_,
-            kMaxCodePageCollectionMemoryModificationScopeDepth);
-#endif
-}
-
-bool Heap::DecrementCodePageCollectionMemoryModificationScopeDepth() {
-  LocalHeap* local_heap = isolate()->CurrentLocalHeap();
-  local_heap->code_page_collection_memory_modification_scope_depth_--;
-  return local_heap->code_page_collection_memory_modification_scope_depth_ == 0;
-}
-
-uintptr_t Heap::code_page_collection_memory_modification_scope_depth() {
-  LocalHeap* local_heap = isolate()->CurrentLocalHeap();
-  return local_heap->code_page_collection_memory_modification_scope_depth_;
-}
-
 PagedNewSpace* Heap::paged_new_space() const {
   return PagedNewSpace::From(new_space());
 }
 
-CodeSpaceMemoryModificationScope::~CodeSpaceMemoryModificationScope() {
-  if (heap_->write_protect_code_memory()) {
-    heap_->decrement_code_space_memory_modification_scope_depth();
-    heap_->code_space()->SetDefaultCodePermissions();
-    LargePage* page = heap_->code_lo_space()->first_page();
-    while (page != nullptr) {
-      DCHECK(page->IsFlagSet(MemoryChunk::IS_EXECUTABLE));
-      DCHECK(heap_->memory_allocator()->IsMemoryChunkExecutable(page));
-      page->SetDefaultCodePermissions();
-      page = page->next_page();
-    }
-  }
-}
-
-CodePageCollectionMemoryModificationScope::
-    CodePageCollectionMemoryModificationScope(Heap* heap)
-    :
-#if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
-      rwx_write_scope_("A part of CodePageCollectionMemoryModificationScope"),
-#endif
-      heap_(heap) {
-  if (heap_->write_protect_code_memory()) {
-    heap_->IncrementCodePageCollectionMemoryModificationScopeDepth();
-  }
-}
-
-CodePageCollectionMemoryModificationScope::
-    ~CodePageCollectionMemoryModificationScope() {
-  if (heap_->write_protect_code_memory()) {
-    if (heap_->DecrementCodePageCollectionMemoryModificationScopeDepth()) {
-      heap_->ProtectUnprotectedMemoryChunks();
-    }
-  }
-}
-
 #ifdef V8_ENABLE_THIRD_PARTY_HEAP
 CodePageMemoryModificationScope::CodePageMemoryModificationScope(
     InstructionStream code)
@@ -628,30 +564,36 @@ CodePageMemoryModificationScope::CodePageMemoryModificationScope(
 }
 #else
 CodePageMemoryModificationScope::CodePageMemoryModificationScope(
-    InstructionStream code)
+    Tagged<InstructionStream> code)
     : CodePageMemoryModificationScope(BasicMemoryChunk::FromHeapObject(code)) {}
 #endif
 
+#if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
+CodePageMemoryModificationScope::CodePageMemoryModificationScope(
+    BasicMemoryChunk* chunk) {
+  if (chunk->IsFlagSet(BasicMemoryChunk::IS_EXECUTABLE)) {
+    rwx_write_scope_.emplace("A part of CodePageMemoryModificationScope");
+  }
+}
+#else
 CodePageMemoryModificationScope::CodePageMemoryModificationScope(
     BasicMemoryChunk* chunk)
-    :
-#if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
-      rwx_write_scope_("A part of CodePageMemoryModificationScope"),
-#endif
-      chunk_(chunk),
-      scope_active_(chunk_->heap()->write_protect_code_memory() &&
-                    chunk_->IsFlagSet(MemoryChunk::IS_EXECUTABLE)) {
+    : chunk_(chunk),
+      scope_active_(chunk_->IsFlagSet(BasicMemoryChunk::IS_EXECUTABLE) &&
+                    chunk_->heap()->write_protect_code_memory()) {
   if (scope_active_) {
-    DCHECK(chunk_->owner()->identity() == CODE_SPACE ||
-           (chunk_->owner()->identity() == CODE_LO_SPACE));
-    MemoryChunk::cast(chunk_)->SetCodeModificationPermissions();
+    DCHECK(IsAnyCodeSpace(chunk_->owner()->identity()));
+    guard_.emplace(MemoryChunk::cast(chunk_)->SetCodeModificationPermissions());
   }
 }
+#endif
 
 CodePageMemoryModificationScope::~CodePageMemoryModificationScope() {
+#if !V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT && !V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
   if (scope_active_) {
     MemoryChunk::cast(chunk_)->SetDefaultCodePermissions();
   }
+#endif
 }
 
 IgnoreLocalGCRequests::IgnoreLocalGCRequests(Heap* heap) : heap_(heap) {
diff --git a/deps/v8/src/heap/heap-layout-tracer.cc b/deps/v8/src/heap/heap-layout-tracer.cc
index 8251759da4d59d..4e3be7cc3708d4 100644
--- a/deps/v8/src/heap/heap-layout-tracer.cc
+++ b/deps/v8/src/heap/heap-layout-tracer.cc
@@ -14,6 +14,24 @@
 namespace v8 {
 namespace internal {
 
+namespace {
+
+constexpr const char* TypeToCollectorName(v8::GCType gc_type) {
+  switch (gc_type) {
+    case kGCTypeScavenge:
+      return "Scavenger";
+    case kGCTypeMarkSweepCompact:
+      return "Mark-Compact";
+    case kGCTypeMinorMarkSweep:
+      return "Minor Mark-Sweep";
+    default:
+      break;
+  }
+  return "Unknown collector";
+}
+
+}  // namespace
+
 // static
 void HeapLayoutTracer::GCProloguePrintHeapLayout(v8::Isolate* isolate,
                                                  v8::GCType gc_type,
@@ -22,7 +40,7 @@ void HeapLayoutTracer::GCProloguePrintHeapLayout(v8::Isolate* isolate,
   Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap();
   // gc_count_ will increase after this callback, manually add 1.
   PrintF("Before GC:%d,", heap->gc_count() + 1);
-  PrintF("collector_name:%s\n", Heap::CollectorName(gc_type));
+  PrintF("collector_name:%s\n", TypeToCollectorName(gc_type));
   PrintHeapLayout(std::cout, heap);
 }
 
@@ -33,7 +51,7 @@ void HeapLayoutTracer::GCEpiloguePrintHeapLayout(v8::Isolate* isolate,
                                                  void* data) {
   Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap();
   PrintF("After GC:%d,", heap->gc_count());
-  PrintF("collector_name:%s\n", Heap::CollectorName(gc_type));
+  PrintF("collector_name:%s\n", TypeToCollectorName(gc_type));
   PrintHeapLayout(std::cout, heap);
 }
 
@@ -50,7 +68,7 @@ void HeapLayoutTracer::PrintBasicMemoryChunk(std::ostream& os,
 
 // static
 void HeapLayoutTracer::PrintHeapLayout(std::ostream& os, Heap* heap) {
-  if (v8_flags.minor_mc) {
+  if (v8_flags.minor_ms) {
     for (const Page* page : *heap->paged_new_space()) {
       PrintBasicMemoryChunk(os, *page, "new_space");
     }
@@ -69,7 +87,7 @@ void HeapLayoutTracer::PrintHeapLayout(std::ostream& os, Heap* heap) {
   OldGenerationMemoryChunkIterator it(heap);
   MemoryChunk* chunk;
   while ((chunk = it.next()) != nullptr) {
-    PrintBasicMemoryChunk(os, *chunk, chunk->owner()->name());
+    PrintBasicMemoryChunk(os, *chunk, ToString(chunk->owner()->identity()));
   }
 
   for (ReadOnlyPage* page : heap->read_only_space()->pages()) {
diff --git a/deps/v8/src/heap/heap-verifier.cc b/deps/v8/src/heap/heap-verifier.cc
index b550d621e771f0..78834f07593739 100644
--- a/deps/v8/src/heap/heap-verifier.cc
+++ b/deps/v8/src/heap/heap-verifier.cc
@@ -12,9 +12,11 @@
 #include "src/heap/array-buffer-sweeper.h"
 #include "src/heap/basic-memory-chunk.h"
 #include "src/heap/combined-heap.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/heap-write-barrier-inl.h"
 #include "src/heap/heap.h"
 #include "src/heap/large-spaces.h"
+#include "src/heap/memory-chunk-layout.h"
 #include "src/heap/new-spaces.h"
 #include "src/heap/objects-visiting-inl.h"
 #include "src/heap/paged-spaces.h"
@@ -33,7 +35,8 @@ namespace v8 {
 namespace internal {
 
 namespace {
-thread_local HeapObject pending_layout_change_object = HeapObject();
+thread_local Tagged<HeapObject> pending_layout_change_object =
+    Tagged<HeapObject>();
 }  // namespace
 
 // Verify that all objects are Smis.
@@ -42,7 +45,7 @@ class VerifySmisVisitor final : public RootVisitor {
   void VisitRootPointers(Root root, const char* description,
                          FullObjectSlot start, FullObjectSlot end) override {
     for (FullObjectSlot current = start; current < end; ++current) {
-      CHECK((*current).IsSmi());
+      CHECK(IsSmi(*current));
     }
   }
 };
@@ -58,53 +61,57 @@ class VerifyPointersVisitor : public ObjectVisitorWithCageBases,
   V8_INLINE explicit VerifyPointersVisitor(Heap* heap)
       : ObjectVisitorWithCageBases(heap), heap_(heap) {}
 
-  void VisitPointers(HeapObject host, ObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                      ObjectSlot end) override;
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) override;
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override;
-  void VisitCodeTarget(RelocInfo* rinfo) override;
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override;
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override;
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override;
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override;
 
   void VisitRootPointers(Root root, const char* description,
                          FullObjectSlot start, FullObjectSlot end) override;
   void VisitRootPointers(Root root, const char* description,
                          OffHeapObjectSlot start,
                          OffHeapObjectSlot end) override;
-  void VisitMapPointer(HeapObject host) override;
+  void VisitMapPointer(Tagged<HeapObject> host) override;
 
  protected:
-  V8_INLINE void VerifyHeapObjectImpl(HeapObject heap_object);
-  V8_INLINE void VerifyCodeObjectImpl(HeapObject heap_object);
+  V8_INLINE void VerifyHeapObjectImpl(Tagged<HeapObject> heap_object);
+  V8_INLINE void VerifyCodeObjectImpl(Tagged<HeapObject> heap_object);
 
   template <typename TSlot>
   V8_INLINE void VerifyPointersImpl(TSlot start, TSlot end);
 
-  virtual void VerifyPointers(HeapObject host, MaybeObjectSlot start,
+  virtual void VerifyPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                               MaybeObjectSlot end);
 
   Heap* heap_;
 };
 
-void VerifyPointersVisitor::VisitPointers(HeapObject host, ObjectSlot start,
-                                          ObjectSlot end) {
+void VerifyPointersVisitor::VisitPointers(Tagged<HeapObject> host,
+                                          ObjectSlot start, ObjectSlot end) {
   VerifyPointers(host, MaybeObjectSlot(start), MaybeObjectSlot(end));
 }
 
-void VerifyPointersVisitor::VisitPointers(HeapObject host,
+void VerifyPointersVisitor::VisitPointers(Tagged<HeapObject> host,
                                           MaybeObjectSlot start,
                                           MaybeObjectSlot end) {
   VerifyPointers(host, start, end);
 }
 
-void VerifyPointersVisitor::VisitCodePointer(Code host, CodeObjectSlot slot) {
+void VerifyPointersVisitor::VisitInstructionStreamPointer(
+    Tagged<Code> host, InstructionStreamSlot slot) {
   Object maybe_code = slot.load(code_cage_base());
-  HeapObject code;
+  Tagged<HeapObject> code;
   // The slot might contain smi during Code creation.
   if (maybe_code.GetHeapObject(&code)) {
     VerifyCodeObjectImpl(code);
   } else {
-    CHECK(maybe_code.IsSmi());
+    CHECK(IsSmi(maybe_code));
   }
 }
 
@@ -122,19 +129,21 @@ void VerifyPointersVisitor::VisitRootPointers(Root root,
   VerifyPointersImpl(start, end);
 }
 
-void VerifyPointersVisitor::VisitMapPointer(HeapObject host) {
-  VerifyHeapObjectImpl(host.map(cage_base()));
+void VerifyPointersVisitor::VisitMapPointer(Tagged<HeapObject> host) {
+  VerifyHeapObjectImpl(host->map(cage_base()));
 }
 
-void VerifyPointersVisitor::VerifyHeapObjectImpl(HeapObject heap_object) {
+void VerifyPointersVisitor::VerifyHeapObjectImpl(
+    Tagged<HeapObject> heap_object) {
   CHECK(IsValidHeapObject(heap_, heap_object));
-  CHECK(heap_object.map(cage_base()).IsMap());
+  CHECK(IsMap(heap_object->map(cage_base())));
 }
 
-void VerifyPointersVisitor::VerifyCodeObjectImpl(HeapObject heap_object) {
+void VerifyPointersVisitor::VerifyCodeObjectImpl(
+    Tagged<HeapObject> heap_object) {
   CHECK(IsValidCodeObject(heap_, heap_object));
-  CHECK(heap_object.map(cage_base()).IsMap());
-  CHECK(heap_object.map(cage_base()).instance_type() ==
+  CHECK(IsMap(heap_object->map(cage_base())));
+  CHECK(heap_object->map(cage_base())->instance_type() ==
         INSTRUCTION_STREAM_TYPE);
 }
 
@@ -142,34 +151,36 @@ template <typename TSlot>
 void VerifyPointersVisitor::VerifyPointersImpl(TSlot start, TSlot end) {
   for (TSlot slot = start; slot < end; ++slot) {
     typename TSlot::TObject object = slot.load(cage_base());
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
     if (object.GetHeapObject(&heap_object)) {
       VerifyHeapObjectImpl(heap_object);
     } else {
-      CHECK(object.IsSmi() || object.IsCleared() ||
+      CHECK(IsSmi(object) || object.IsCleared() ||
             MapWord::IsPacked(object.ptr()));
     }
   }
 }
 
-void VerifyPointersVisitor::VerifyPointers(HeapObject host,
+void VerifyPointersVisitor::VerifyPointers(Tagged<HeapObject> host,
                                            MaybeObjectSlot start,
                                            MaybeObjectSlot end) {
   // If this DCHECK fires then you probably added a pointer field
   // to one of objects in DATA_ONLY_VISITOR_ID_LIST. You can fix
   // this by moving that object to POINTER_VISITOR_ID_LIST.
   DCHECK_EQ(ObjectFields::kMaybePointers,
-            Map::ObjectFieldsFrom(host.map(cage_base()).visitor_id()));
+            Map::ObjectFieldsFrom(host->map(cage_base())->visitor_id()));
   VerifyPointersImpl(start, end);
 }
 
-void VerifyPointersVisitor::VisitCodeTarget(RelocInfo* rinfo) {
-  InstructionStream target =
+void VerifyPointersVisitor::VisitCodeTarget(Tagged<InstructionStream> host,
+                                            RelocInfo* rinfo) {
+  Tagged<InstructionStream> target =
       InstructionStream::FromTargetAddress(rinfo->target_address());
   VerifyHeapObjectImpl(target);
 }
 
-void VerifyPointersVisitor::VisitEmbeddedPointer(RelocInfo* rinfo) {
+void VerifyPointersVisitor::VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                                                 RelocInfo* rinfo) {
   VerifyHeapObjectImpl(rinfo->target_object(cage_base()));
 }
 
@@ -179,16 +190,16 @@ class VerifyReadOnlyPointersVisitor : public VerifyPointersVisitor {
       : VerifyPointersVisitor(heap) {}
 
  protected:
-  void VerifyPointers(HeapObject host, MaybeObjectSlot start,
+  void VerifyPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                       MaybeObjectSlot end) override {
     if (!host.is_null()) {
-      CHECK(ReadOnlyHeap::Contains(host.map()));
+      CHECK(ReadOnlyHeap::Contains(host->map()));
     }
     VerifyPointersVisitor::VerifyPointers(host, start, end);
 
     for (MaybeObjectSlot current = start; current < end; ++current) {
-      HeapObject heap_object;
-      if ((*current)->GetHeapObject(&heap_object)) {
+      Tagged<HeapObject> heap_object;
+      if ((*current).GetHeapObject(&heap_object)) {
         CHECK(ReadOnlyHeap::Contains(heap_object));
       }
     }
@@ -206,17 +217,17 @@ class VerifySharedHeapObjectVisitor : public VerifyPointersVisitor {
   }
 
  protected:
-  void VerifyPointers(HeapObject host, MaybeObjectSlot start,
+  void VerifyPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                       MaybeObjectSlot end) override {
     if (!host.is_null()) {
-      Map map = host.map();
+      Map map = host->map();
       CHECK(ReadOnlyHeap::Contains(map) || shared_space_->Contains(map));
     }
     VerifyPointersVisitor::VerifyPointers(host, start, end);
 
     for (MaybeObjectSlot current = start; current < end; ++current) {
-      HeapObject heap_object;
-      if ((*current)->GetHeapObject(&heap_object)) {
+      Tagged<HeapObject> heap_object;
+      if ((*current).GetHeapObject(&heap_object)) {
         CHECK(ReadOnlyHeap::Contains(heap_object) ||
               shared_space_->Contains(heap_object) ||
               shared_lo_space_->Contains(heap_object));
@@ -244,13 +255,12 @@ class HeapVerification final : public SpaceVerificationVisitor {
   void VerifyPage(const BasicMemoryChunk* chunk) final;
   void VerifyPageDone(const BasicMemoryChunk* chunk) final;
 
-  void VerifyObject(HeapObject object) final;
-  void VerifyObjectMap(HeapObject object);
-  void VerifyOutgoingPointers(HeapObject object);
-  // Verifies OLD_TO_NEW and OLD_TO_SHARED remembered sets for this object.
-  void VerifyRememberedSetFor(HeapObject object);
-
-  void VerifyInvalidatedObjectSize();
+  void VerifyObject(Tagged<HeapObject> object) final;
+  void VerifyObjectMap(Tagged<HeapObject> object);
+  void VerifyOutgoingPointers(Tagged<HeapObject> object);
+  // Verifies OLD_TO_NEW, OLD_TO_NEW_BACKGROUND and OLD_TO_SHARED remembered
+  // sets for this object.
+  void VerifyRememberedSetFor(Tagged<HeapObject> object);
 
   ReadOnlySpace* read_only_space() const { return heap_->read_only_space(); }
   NewSpace* new_space() const { return heap_->new_space(); }
@@ -282,7 +292,6 @@ class HeapVerification final : public SpaceVerificationVisitor {
 void HeapVerification::Verify() {
   CHECK(heap()->HasBeenSetUp());
   AllowGarbageCollection allow_gc;
-  IgnoreLocalGCRequests ignore_gc_requests(heap());
   SafepointKind safepoint_kind = isolate()->is_shared_space_isolate()
                                      ? SafepointKind::kGlobal
                                      : SafepointKind::kIsolate;
@@ -300,11 +309,11 @@ void HeapVerification::Verify() {
   if (!isolate()->context().is_null() &&
       !isolate()->raw_native_context().is_null()) {
     Object normalized_map_cache =
-        isolate()->raw_native_context().normalized_map_cache();
+        isolate()->raw_native_context()->normalized_map_cache();
 
-    if (normalized_map_cache.IsNormalizedMapCache()) {
+    if (IsNormalizedMapCache(normalized_map_cache)) {
       NormalizedMapCache::cast(normalized_map_cache)
-          .NormalizedMapCacheVerify(isolate());
+          ->NormalizedMapCacheVerify(isolate());
     }
   }
 
@@ -330,8 +339,6 @@ void HeapVerification::Verify() {
 
   isolate()->string_table()->VerifyIfOwnedBy(isolate());
 
-  VerifyInvalidatedObjectSize();
-
 #if DEBUG
   heap()->VerifyCommittedPhysicalMemory();
 #endif  // DEBUG
@@ -347,7 +354,6 @@ void HeapVerification::VerifySpace(BaseSpace* space) {
 void HeapVerification::VerifyPage(const BasicMemoryChunk* chunk) {
   CHECK(!current_chunk_.has_value());
   CHECK(!chunk->IsFlagSet(Page::PAGE_NEW_OLD_PROMOTION));
-  CHECK(!chunk->IsFlagSet(Page::PAGE_NEW_NEW_PROMOTION));
   if (V8_SHARED_RO_HEAP_BOOL && chunk->InReadOnlySpace()) {
     CHECK_NULL(chunk->owner());
   } else {
@@ -362,82 +368,63 @@ void HeapVerification::VerifyPageDone(const BasicMemoryChunk* chunk) {
   current_chunk_.reset();
 }
 
-void HeapVerification::VerifyObject(HeapObject object) {
+void HeapVerification::VerifyObject(Tagged<HeapObject> object) {
   CHECK_EQ(BasicMemoryChunk::FromHeapObject(object), *current_chunk_);
 
   // Verify object map.
   VerifyObjectMap(object);
 
   // The object itself should look OK.
-  object.ObjectVerify(isolate_);
+  Object::ObjectVerify(object, isolate_);
 
   // Verify outgoing references.
   VerifyOutgoingPointers(object);
 
   // Verify remembered set.
-  VerifyRememberedSetFor(object);
+  if (!heap_->incremental_marking()->IsMinorMarking()) {
+    // Minor incremental marking "steals" the remembered sets from pages.
+    VerifyRememberedSetFor(object);
+  }
 }
 
-void HeapVerification::VerifyOutgoingPointers(HeapObject object) {
+void HeapVerification::VerifyOutgoingPointers(Tagged<HeapObject> object) {
   switch (current_space_identity()) {
     case RO_SPACE: {
       VerifyReadOnlyPointersVisitor visitor(heap());
-      object.Iterate(cage_base_, &visitor);
+      object->Iterate(cage_base_, &visitor);
       break;
     }
 
     case SHARED_SPACE:
     case SHARED_LO_SPACE: {
       VerifySharedHeapObjectVisitor visitor(heap());
-      object.Iterate(cage_base_, &visitor);
+      object->Iterate(cage_base_, &visitor);
       break;
     }
 
     default: {
       VerifyPointersVisitor visitor(heap());
-      object.Iterate(cage_base_, &visitor);
+      object->Iterate(cage_base_, &visitor);
       break;
     }
   }
 }
 
-void HeapVerification::VerifyObjectMap(HeapObject object) {
+void HeapVerification::VerifyObjectMap(Tagged<HeapObject> object) {
   // The first word should be a map, and we expect all map pointers to be
   // in map space or read-only space.
-  Map map = object.map(cage_base_);
-  CHECK(map.IsMap(cage_base_));
+  Map map = object->map(cage_base_);
+  CHECK(IsMap(map, cage_base_));
   CHECK(ReadOnlyHeap::Contains(map) || old_space()->Contains(map) ||
         (shared_space() && shared_space()->Contains(map)));
 
   if (Heap::InYoungGeneration(object)) {
     // The object should not be code or a map.
-    CHECK(!object.IsMap(cage_base_));
-    CHECK(!object.IsAbstractCode(cage_base_));
+    CHECK(!IsMap(object, cage_base_));
+    CHECK(!IsAbstractCode(object, cage_base_));
   } else if (current_space_identity() == RO_SPACE) {
-    CHECK(!object.IsExternalString());
-    CHECK(!object.IsJSArrayBuffer());
-  }
-}
-
-namespace {
-void VerifyInvalidatedSlots(InvalidatedSlots* invalidated_slots) {
-  if (!invalidated_slots) return;
-  for (std::pair<HeapObject, int> object_and_size : *invalidated_slots) {
-    HeapObject object = object_and_size.first;
-    int size = object_and_size.second;
-    CHECK_EQ(object.Size(), size);
-  }
-}
-}  // namespace
-
-void HeapVerification::VerifyInvalidatedObjectSize() {
-  OldGenerationMemoryChunkIterator chunk_iterator(heap());
-  MemoryChunk* chunk;
-
-  while ((chunk = chunk_iterator.next()) != nullptr) {
-    VerifyInvalidatedSlots(chunk->invalidated_slots<OLD_TO_NEW>());
-    VerifyInvalidatedSlots(chunk->invalidated_slots<OLD_TO_OLD>());
-    VerifyInvalidatedSlots(chunk->invalidated_slots<OLD_TO_SHARED>());
+    CHECK(!IsExternalString(object));
+    CHECK(!IsJSArrayBuffer(object));
   }
 }
 
@@ -452,9 +439,10 @@ class SlotVerifyingVisitor : public ObjectVisitorWithCageBases {
                        std::set<std::pair<SlotType, Address>>* typed)
       : ObjectVisitorWithCageBases(isolate), untyped_(untyped), typed_(typed) {}
 
-  virtual bool ShouldHaveBeenRecorded(HeapObject host, MaybeObject target) = 0;
+  virtual bool ShouldHaveBeenRecorded(Tagged<HeapObject> host,
+                                      MaybeObject target) = 0;
 
-  void VisitPointers(HeapObject host, ObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                      ObjectSlot end) override {
 #ifdef DEBUG
     for (ObjectSlot slot = start; slot < end; ++slot) {
@@ -465,7 +453,7 @@ class SlotVerifyingVisitor : public ObjectVisitorWithCageBases {
     VisitPointers(host, MaybeObjectSlot(start), MaybeObjectSlot(end));
   }
 
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) final {
     for (MaybeObjectSlot slot = start; slot < end; ++slot) {
       if (ShouldHaveBeenRecorded(host, slot.load(cage_base()))) {
@@ -474,18 +462,19 @@ class SlotVerifyingVisitor : public ObjectVisitorWithCageBases {
     }
   }
 
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
     if (ShouldHaveBeenRecorded(
             host, MaybeObject::FromObject(slot.load(code_cage_base())))) {
       CHECK_GT(untyped_->count(slot.address()), 0);
     }
   }
 
-  void VisitCodeTarget(RelocInfo* rinfo) override {
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
     Object target =
         InstructionStream::FromTargetAddress(rinfo->target_address());
-    if (ShouldHaveBeenRecorded(rinfo->instruction_stream(),
-                               MaybeObject::FromObject(target))) {
+    if (ShouldHaveBeenRecorded(host, MaybeObject::FromObject(target))) {
       CHECK(InTypedSet(SlotType::kCodeEntry, rinfo->pc()) ||
             (rinfo->IsInConstantPool() &&
              InTypedSet(SlotType::kConstPoolCodeEntry,
@@ -493,10 +482,10 @@ class SlotVerifyingVisitor : public ObjectVisitorWithCageBases {
     }
   }
 
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override {
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
     Object target = rinfo->target_object(cage_base());
-    if (ShouldHaveBeenRecorded(rinfo->instruction_stream(),
-                               MaybeObject::FromObject(target))) {
+    if (ShouldHaveBeenRecorded(host, MaybeObject::FromObject(target))) {
       CHECK(InTypedSet(SlotType::kEmbeddedObjectFull, rinfo->pc()) ||
             InTypedSet(SlotType::kEmbeddedObjectCompressed, rinfo->pc()) ||
             (rinfo->IsInConstantPool() &&
@@ -523,23 +512,25 @@ class SlotVerifyingVisitor : public ObjectVisitorWithCageBases {
 
 class OldToNewSlotVerifyingVisitor : public SlotVerifyingVisitor {
  public:
-  OldToNewSlotVerifyingVisitor(Isolate* isolate, std::set<Address>* untyped,
-                               std::set<std::pair<SlotType, Address>>* typed,
-                               EphemeronRememberedSet* ephemeron_remembered_set)
+  OldToNewSlotVerifyingVisitor(
+      Isolate* isolate, std::set<Address>* untyped,
+      std::set<std::pair<SlotType, Address>>* typed,
+      EphemeronRememberedSet::TableMap* ephemeron_remembered_set)
       : SlotVerifyingVisitor(isolate, untyped, typed),
         ephemeron_remembered_set_(ephemeron_remembered_set) {}
 
-  bool ShouldHaveBeenRecorded(HeapObject host, MaybeObject target) override {
+  bool ShouldHaveBeenRecorded(Tagged<HeapObject> host,
+                              MaybeObject target) override {
     DCHECK_IMPLIES(target->IsStrongOrWeak() && Heap::InYoungGeneration(target),
                    Heap::InToPage(target));
     return target->IsStrongOrWeak() && Heap::InYoungGeneration(target) &&
            !Heap::InYoungGeneration(host);
   }
 
-  void VisitEphemeron(HeapObject host, int index, ObjectSlot key,
+  void VisitEphemeron(Tagged<HeapObject> host, int index, ObjectSlot key,
                       ObjectSlot target) override {
     VisitPointer(host, target);
-    if (v8_flags.minor_mc) return;
+    if (v8_flags.minor_ms) return;
     // Keys are handled separately and should never appear in this set.
     CHECK(!InUntypedSet(key));
     Object k = *key;
@@ -555,7 +546,7 @@ class OldToNewSlotVerifyingVisitor : public SlotVerifyingVisitor {
   }
 
  private:
-  EphemeronRememberedSet* ephemeron_remembered_set_;
+  EphemeronRememberedSet::TableMap* ephemeron_remembered_set_;
 };
 
 class OldToSharedSlotVerifyingVisitor : public SlotVerifyingVisitor {
@@ -564,7 +555,8 @@ class OldToSharedSlotVerifyingVisitor : public SlotVerifyingVisitor {
                                   std::set<std::pair<SlotType, Address>>* typed)
       : SlotVerifyingVisitor(isolate, untyped, typed) {}
 
-  bool ShouldHaveBeenRecorded(HeapObject host, MaybeObject target) override {
+  bool ShouldHaveBeenRecorded(Tagged<HeapObject> host,
+                              MaybeObject target) override {
     return target->IsStrongOrWeak() && Heap::InWritableSharedSpace(target) &&
            !Heap::InYoungGeneration(host) && !host.InWritableSharedSpace();
   }
@@ -595,46 +587,53 @@ void CollectSlots(MemoryChunk* chunk, Address start, Address end,
 // Helper class for collecting slot addresses.
 class SlotCollectingVisitor final : public ObjectVisitor {
  public:
-  void VisitPointers(HeapObject host, ObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                      ObjectSlot end) override {
     VisitPointers(host, MaybeObjectSlot(start), MaybeObjectSlot(end));
   }
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) final {
     for (MaybeObjectSlot p = start; p < end; ++p) {
       slots_.push_back(p);
     }
   }
 
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
     CHECK(V8_EXTERNAL_CODE_SPACE_BOOL);
 #ifdef V8_EXTERNAL_CODE_SPACE
     code_slots_.push_back(slot);
 #endif
   }
 
-  void VisitCodeTarget(RelocInfo* rinfo) final { UNREACHABLE(); }
+  void VisitCodeTarget(Tagged<InstructionStream> host, RelocInfo* rinfo) final {
+    UNREACHABLE();
+  }
 
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override { UNREACHABLE(); }
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
+    UNREACHABLE();
+  }
 
-  void VisitMapPointer(HeapObject object) override {}  // do nothing by default
+  void VisitMapPointer(Tagged<HeapObject> object) override {
+  }  // do nothing by default
 
   int number_of_slots() { return static_cast<int>(slots_.size()); }
 
   MaybeObjectSlot slot(int i) { return slots_[i]; }
 #ifdef V8_EXTERNAL_CODE_SPACE
-  CodeObjectSlot code_slot(int i) { return code_slots_[i]; }
+  InstructionStreamSlot code_slot(int i) { return code_slots_[i]; }
   int number_of_code_slots() { return static_cast<int>(code_slots_.size()); }
 #endif
 
  private:
   std::vector<MaybeObjectSlot> slots_;
 #ifdef V8_EXTERNAL_CODE_SPACE
-  std::vector<CodeObjectSlot> code_slots_;
+  std::vector<InstructionStreamSlot> code_slots_;
 #endif
 };
 
-void HeapVerification::VerifyRememberedSetFor(HeapObject object) {
+void HeapVerification::VerifyRememberedSetFor(Tagged<HeapObject> object) {
   if (current_space_identity() == RO_SPACE ||
       v8_flags.verify_heap_skip_remembered_set) {
     return;
@@ -643,15 +642,18 @@ void HeapVerification::VerifyRememberedSetFor(HeapObject object) {
   MemoryChunk* chunk = MemoryChunk::FromHeapObject(object);
 
   Address start = object.address();
-  Address end = start + object.Size(cage_base_);
+  Address end = start + object->Size(cage_base_);
 
   std::set<Address> old_to_new;
   std::set<std::pair<SlotType, Address>> typed_old_to_new;
   CollectSlots<OLD_TO_NEW>(chunk, start, end, &old_to_new, &typed_old_to_new);
+  CollectSlots<OLD_TO_NEW_BACKGROUND>(chunk, start, end, &old_to_new,
+                                      &typed_old_to_new);
+
   OldToNewSlotVerifyingVisitor old_to_new_visitor(
       isolate(), &old_to_new, &typed_old_to_new,
-      &heap()->ephemeron_remembered_set_);
-  object.IterateBody(cage_base_, &old_to_new_visitor);
+      heap()->ephemeron_remembered_set()->tables());
+  object->IterateBody(cage_base_, &old_to_new_visitor);
 
   std::set<Address> old_to_shared;
   std::set<std::pair<SlotType, Address>> typed_old_to_shared;
@@ -659,7 +661,7 @@ void HeapVerification::VerifyRememberedSetFor(HeapObject object) {
                               &typed_old_to_shared);
   OldToSharedSlotVerifyingVisitor old_to_shared_visitor(
       isolate(), &old_to_shared, &typed_old_to_shared);
-  object.IterateBody(cage_base_, &old_to_shared_visitor);
+  object->IterateBody(cage_base_, &old_to_shared_visitor);
 
   if (object.InWritableSharedSpace()) {
     CHECK_NULL(chunk->slot_set<OLD_TO_SHARED>());
@@ -667,12 +669,18 @@ void HeapVerification::VerifyRememberedSetFor(HeapObject object) {
 
     CHECK_NULL(chunk->slot_set<OLD_TO_NEW>());
     CHECK_NULL(chunk->typed_slot_set<OLD_TO_NEW>());
+
+    CHECK_NULL(chunk->slot_set<OLD_TO_NEW_BACKGROUND>());
+    CHECK_NULL(chunk->typed_slot_set<OLD_TO_NEW_BACKGROUND>());
   }
 
   if (Heap::InYoungGeneration(object)) {
     CHECK_NULL(chunk->slot_set<OLD_TO_NEW>());
     CHECK_NULL(chunk->typed_slot_set<OLD_TO_NEW>());
 
+    CHECK_NULL(chunk->slot_set<OLD_TO_NEW_BACKGROUND>());
+    CHECK_NULL(chunk->typed_slot_set<OLD_TO_NEW_BACKGROUND>());
+
     CHECK_NULL(chunk->slot_set<OLD_TO_OLD>());
     CHECK_NULL(chunk->typed_slot_set<OLD_TO_OLD>());
 
@@ -686,6 +694,7 @@ void HeapVerification::VerifyRememberedSetFor(HeapObject object) {
 
 // static
 void HeapVerifier::VerifyHeap(Heap* heap) {
+  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"), "V8.HeapVerification");
   HeapVerification verifier(heap);
   verifier.Verify();
 }
@@ -697,13 +706,13 @@ void HeapVerifier::VerifyReadOnlyHeap(Heap* heap) {
 }
 
 // static
-void HeapVerifier::VerifyObjectLayoutChangeIsAllowed(Heap* heap,
-                                                     HeapObject object) {
+void HeapVerifier::VerifyObjectLayoutChangeIsAllowed(
+    Heap* heap, Tagged<HeapObject> object) {
   if (object.InWritableSharedSpace()) {
     // Out of objects in the shared heap, only strings can change layout.
-    DCHECK(object.IsString());
+    DCHECK(IsString(object));
     // Shared strings only change layout under GC, never concurrently.
-    if (object.IsShared()) {
+    if (IsShared(object)) {
       Isolate* isolate = heap->isolate();
       Isolate* shared_space_isolate = isolate->is_shared_space_isolate()
                                           ? isolate
@@ -716,15 +725,17 @@ void HeapVerifier::VerifyObjectLayoutChangeIsAllowed(Heap* heap,
 }
 
 // static
-void HeapVerifier::SetPendingLayoutChangeObject(Heap* heap, HeapObject object) {
+void HeapVerifier::SetPendingLayoutChangeObject(Heap* heap,
+                                                Tagged<HeapObject> object) {
   VerifyObjectLayoutChangeIsAllowed(heap, object);
   DCHECK(pending_layout_change_object.is_null());
   pending_layout_change_object = object;
 }
 
 // static
-void HeapVerifier::VerifyObjectLayoutChange(Heap* heap, HeapObject object,
-                                            Map new_map) {
+void HeapVerifier::VerifyObjectLayoutChange(Heap* heap,
+                                            Tagged<HeapObject> object,
+                                            Tagged<Map> new_map) {
   // Object layout changes are currently not supported on background threads.
   DCHECK_NULL(LocalHeap::Current());
 
@@ -747,25 +758,27 @@ void HeapVerifier::VerifyObjectLayoutChange(Heap* heap, HeapObject object,
 }
 
 // static
-void HeapVerifier::VerifySafeMapTransition(Heap* heap, HeapObject object,
-                                           Map new_map) {
+void HeapVerifier::VerifySafeMapTransition(Heap* heap,
+                                           Tagged<HeapObject> object,
+                                           Tagged<Map> new_map) {
   PtrComprCageBase cage_base(heap->isolate());
 
-  if (object.IsJSObject(cage_base)) {
+  if (IsJSObject(object, cage_base)) {
     // Without double unboxing all in-object fields of a JSObject are tagged.
     return;
   }
 
-  if (object.IsString(cage_base) &&
-      new_map == ReadOnlyRoots(heap).thin_string_map()) {
+  if (IsString(object, cage_base) &&
+      (new_map == ReadOnlyRoots(heap).thin_two_byte_string_map() ||
+       new_map == ReadOnlyRoots(heap).thin_one_byte_string_map())) {
     // When transitioning a string to ThinString,
     // Heap::NotifyObjectLayoutChange doesn't need to be invoked because only
     // tagged fields are introduced.
     return;
   }
 
-  if (v8_flags.shared_string_table && object.IsString(cage_base) &&
-      InstanceTypeChecker::IsInternalizedString(new_map.instance_type())) {
+  if (v8_flags.shared_string_table && IsString(object, cage_base) &&
+      InstanceTypeChecker::IsInternalizedString(new_map->instance_type())) {
     // In-place internalization does not change a string's fields.
     //
     // When sharing the string table, the setting and re-setting of maps below
@@ -776,14 +789,14 @@ void HeapVerifier::VerifySafeMapTransition(Heap* heap, HeapObject object,
 
   // Check that the set of slots before and after the transition match.
   SlotCollectingVisitor old_visitor;
-  object.IterateFast(cage_base, &old_visitor);
-  MapWord old_map_word = object.map_word(cage_base, kRelaxedLoad);
+  object->IterateFast(cage_base, &old_visitor);
+  MapWord old_map_word = object->map_word(cage_base, kRelaxedLoad);
   // Temporarily set the new map to iterate new slots.
-  object.set_map_word(new_map, kRelaxedStore);
+  object->set_map_word(new_map, kRelaxedStore);
   SlotCollectingVisitor new_visitor;
-  object.IterateFast(cage_base, &new_visitor);
+  object->IterateFast(cage_base, &new_visitor);
   // Restore the old map.
-  object.set_map_word(old_map_word.ToMap(), kRelaxedStore);
+  object->set_map_word(old_map_word.ToMap(), kRelaxedStore);
   DCHECK_EQ(new_visitor.number_of_slots(), old_visitor.number_of_slots());
   for (int i = 0; i < new_visitor.number_of_slots(); i++) {
     DCHECK_EQ(new_visitor.slot(i), old_visitor.slot(i));
diff --git a/deps/v8/src/heap/heap-verifier.h b/deps/v8/src/heap/heap-verifier.h
index d64c6f9c3ff524..08ebfc9ddf3814 100644
--- a/deps/v8/src/heap/heap-verifier.h
+++ b/deps/v8/src/heap/heap-verifier.h
@@ -23,7 +23,7 @@ class SpaceVerificationVisitor {
   virtual ~SpaceVerificationVisitor() = default;
 
   // This method will be invoked for every object in the space.
-  virtual void VerifyObject(HeapObject object) = 0;
+  virtual void VerifyObject(Tagged<HeapObject> object) = 0;
 
   // This method will be invoked for each page in the space before verifying an
   // object on it.
@@ -41,26 +41,26 @@ class HeapVerifier final {
 
   // Verify the read-only heap after all read-only heap objects have been
   // created.
-  static void VerifyReadOnlyHeap(Heap* heap);
+  V8_EXPORT_PRIVATE static void VerifyReadOnlyHeap(Heap* heap);
 
   // Checks that this is a safe map transition.
-  V8_EXPORT_PRIVATE static void VerifySafeMapTransition(Heap* heap,
-                                                        HeapObject object,
-                                                        Map new_map);
+  V8_EXPORT_PRIVATE static void VerifySafeMapTransition(
+      Heap* heap, Tagged<HeapObject> object, Tagged<Map> new_map);
 
   // This function checks that either
   // - the map transition is safe,
   // - or it was communicated to GC using NotifyObjectLayoutChange.
-  V8_EXPORT_PRIVATE static void VerifyObjectLayoutChange(Heap* heap,
-                                                         HeapObject object,
-                                                         Map new_map);
+  V8_EXPORT_PRIVATE static void VerifyObjectLayoutChange(
+      Heap* heap, Tagged<HeapObject> object, Tagged<Map> new_map);
 
   // Verifies that that the object is allowed to change layout. Checks that if
   // the object is in shared space, it must be a string as no other objects in
   // shared space change layouts.
-  static void VerifyObjectLayoutChangeIsAllowed(Heap* heap, HeapObject object);
+  static void VerifyObjectLayoutChangeIsAllowed(Heap* heap,
+                                                Tagged<HeapObject> object);
 
-  static void SetPendingLayoutChangeObject(Heap* heap, HeapObject object);
+  static void SetPendingLayoutChangeObject(Heap* heap,
+                                           Tagged<HeapObject> object);
 
 #else
   static void VerifyHeap(Heap* heap) {}
diff --git a/deps/v8/src/heap/heap-write-barrier-inl.h b/deps/v8/src/heap/heap-write-barrier-inl.h
index dd850bbf0132ec..eab81cdab6458b 100644
--- a/deps/v8/src/heap/heap-write-barrier-inl.h
+++ b/deps/v8/src/heap/heap-write-barrier-inl.h
@@ -17,6 +17,7 @@
 #include "src/objects/compressed-slots-inl.h"
 #include "src/objects/fixed-array.h"
 #include "src/objects/heap-object.h"
+#include "src/objects/instruction-stream.h"
 #include "src/objects/maybe-object-inl.h"
 #include "src/objects/slots-inl.h"
 
@@ -24,19 +25,20 @@ namespace v8 {
 namespace internal {
 
 // Defined in heap.cc.
-V8_EXPORT_PRIVATE bool Heap_PageFlagsAreConsistent(HeapObject object);
+V8_EXPORT_PRIVATE bool Heap_PageFlagsAreConsistent(Tagged<HeapObject> object);
 V8_EXPORT_PRIVATE void Heap_CombinedGenerationalAndSharedBarrierSlow(
-    HeapObject object, Address slot, HeapObject value);
+    Tagged<HeapObject> object, Address slot, Tagged<HeapObject> value);
 V8_EXPORT_PRIVATE void Heap_CombinedGenerationalAndSharedEphemeronBarrierSlow(
-    EphemeronHashTable table, Address slot, HeapObject value);
+    Tagged<EphemeronHashTable> table, Address slot, Tagged<HeapObject> value);
 
-V8_EXPORT_PRIVATE void Heap_GenerationalBarrierForCodeSlow(RelocInfo* rinfo,
-                                                           HeapObject object);
+V8_EXPORT_PRIVATE void Heap_GenerationalBarrierForCodeSlow(
+    Tagged<InstructionStream> host, RelocInfo* rinfo,
+    Tagged<HeapObject> object);
 
 V8_EXPORT_PRIVATE void Heap_GenerationalEphemeronKeyBarrierSlow(
-    Heap* heap, HeapObject table, Address slot);
+    Heap* heap, Tagged<HeapObject> table, Address slot);
 
-inline bool IsCodeSpaceObject(HeapObject object);
+inline bool IsCodeSpaceObject(Tagged<HeapObject> object);
 
 // Do not use these internal details anywhere outside of this file. These
 // internals are only intended to shortcut write barrier checks.
@@ -50,10 +52,10 @@ struct MemoryChunk {
   static constexpr uintptr_t kToPageBit = uintptr_t{1} << 4;
   static constexpr uintptr_t kMarkingBit = uintptr_t{1} << 5;
   static constexpr uintptr_t kReadOnlySpaceBit = uintptr_t{1} << 6;
-  static constexpr uintptr_t kIsExecutableBit = uintptr_t{1} << 21;
+  static constexpr uintptr_t kIsExecutableBit = uintptr_t{1} << 19;
 
   V8_INLINE static heap_internals::MemoryChunk* FromHeapObject(
-      HeapObject object) {
+      Tagged<HeapObject> object) {
     DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
     return reinterpret_cast<MemoryChunk*>(object.ptr() & ~kPageAlignmentMask);
   }
@@ -97,8 +99,9 @@ struct MemoryChunk {
   V8_INLINE bool InCodeSpace() const { return GetFlags() & kIsExecutableBit; }
 };
 
-inline void CombinedWriteBarrierInternal(HeapObject host, HeapObjectSlot slot,
-                                         HeapObject value,
+inline void CombinedWriteBarrierInternal(Tagged<HeapObject> host,
+                                         HeapObjectSlot slot,
+                                         Tagged<HeapObject> value,
                                          WriteBarrierMode mode) {
   DCHECK_EQ(mode, UPDATE_WRITE_BARRIER);
 
@@ -131,28 +134,37 @@ inline void CombinedWriteBarrierInternal(HeapObject host, HeapObjectSlot slot,
 
 }  // namespace heap_internals
 
-inline void WriteBarrierForCode(InstructionStream host, RelocInfo* rinfo,
-                                Object value, WriteBarrierMode mode) {
+inline void WriteBarrierForCode(Tagged<InstructionStream> host,
+                                RelocInfo* rinfo, Tagged<Object> value,
+                                WriteBarrierMode mode) {
   DCHECK(!HasWeakHeapObjectTag(value));
   if (!value.IsHeapObject()) return;
-  WriteBarrierForCode(host, rinfo, HeapObject::cast(value));
+  WriteBarrierForCode(host, rinfo, HeapObject::cast(value), mode);
 }
 
-inline void WriteBarrierForCode(InstructionStream host, RelocInfo* rinfo,
-                                HeapObject value, WriteBarrierMode mode) {
+inline void WriteBarrierForCode(Tagged<InstructionStream> host,
+                                RelocInfo* rinfo, Tagged<HeapObject> value,
+                                WriteBarrierMode mode) {
   if (mode == SKIP_WRITE_BARRIER) {
     SLOW_DCHECK(!WriteBarrier::IsRequired(host, value));
     return;
   }
 
+  // Used during InstructionStream initialization where we update the write
+  // barriers together separate from the field writes.
+  if (mode == UNSAFE_SKIP_WRITE_BARRIER) {
+    DCHECK(!DisallowGarbageCollection::IsAllowed());
+    return;
+  }
+
   DCHECK_EQ(mode, UPDATE_WRITE_BARRIER);
-  GenerationalBarrierForCode(rinfo, value);
+  GenerationalBarrierForCode(host, rinfo, value);
   WriteBarrier::Shared(host, rinfo, value);
   WriteBarrier::Marking(host, rinfo, value);
 }
 
-inline void CombinedWriteBarrier(HeapObject host, ObjectSlot slot, Object value,
-                                 WriteBarrierMode mode) {
+inline void CombinedWriteBarrier(Tagged<HeapObject> host, ObjectSlot slot,
+                                 Tagged<Object> value, WriteBarrierMode mode) {
   if (mode == SKIP_WRITE_BARRIER) {
     SLOW_DCHECK(!WriteBarrier::IsRequired(host, value));
     return;
@@ -163,21 +175,21 @@ inline void CombinedWriteBarrier(HeapObject host, ObjectSlot slot, Object value,
                                                HeapObject::cast(value), mode);
 }
 
-inline void CombinedWriteBarrier(HeapObject host, MaybeObjectSlot slot,
+inline void CombinedWriteBarrier(Tagged<HeapObject> host, MaybeObjectSlot slot,
                                  MaybeObject value, WriteBarrierMode mode) {
   if (mode == SKIP_WRITE_BARRIER) {
     SLOW_DCHECK(!WriteBarrier::IsRequired(host, value));
     return;
   }
 
-  HeapObject value_object;
-  if (!value->GetHeapObject(&value_object)) return;
+  Tagged<HeapObject> value_object;
+  if (!value.GetHeapObject(&value_object)) return;
   heap_internals::CombinedWriteBarrierInternal(host, HeapObjectSlot(slot),
                                                value_object, mode);
 }
 
-inline void CombinedEphemeronWriteBarrier(EphemeronHashTable host,
-                                          ObjectSlot slot, Object value,
+inline void CombinedEphemeronWriteBarrier(Tagged<EphemeronHashTable> host,
+                                          ObjectSlot slot, Tagged<Object> value,
                                           WriteBarrierMode mode) {
   if (mode == SKIP_WRITE_BARRIER) {
     SLOW_DCHECK(!WriteBarrier::IsRequired(host, value));
@@ -190,7 +202,7 @@ inline void CombinedEphemeronWriteBarrier(EphemeronHashTable host,
   heap_internals::MemoryChunk* host_chunk =
       heap_internals::MemoryChunk::FromHeapObject(host);
 
-  HeapObject heap_object_value = HeapObject::cast(value);
+  Tagged<HeapObject> heap_object_value = HeapObject::cast(value);
   heap_internals::MemoryChunk* value_chunk =
       heap_internals::MemoryChunk::FromHeapObject(heap_object_value);
 
@@ -214,16 +226,39 @@ inline void CombinedEphemeronWriteBarrier(EphemeronHashTable host,
   }
 }
 
-inline void GenerationalBarrierForCode(RelocInfo* rinfo, HeapObject object) {
+inline void IndirectPointerWriteBarrier(Tagged<HeapObject> host,
+                                        IndirectPointerSlot slot,
+                                        Tagged<HeapObject> value,
+                                        WriteBarrierMode mode) {
+  // Indirect pointers are only used when the sandbox is enabled.
+  DCHECK(V8_CODE_POINTER_SANDBOXING_BOOL);
+
+  if (mode == SKIP_WRITE_BARRIER) {
+    SLOW_DCHECK(!WriteBarrier::IsRequired(host, value));
+    return;
+  }
+
+  // Objects referenced via indirect pointers are currently never allocated in
+  // the young generation or the shared heap. If they ever are, then some of
+  // these write barriers need to be adjusted.
+  DCHECK(!heap_internals::MemoryChunk::FromHeapObject(value)
+              ->IsYoungOrSharedChunk());
+
+  WriteBarrier::Marking(host, slot);
+}
+
+inline void GenerationalBarrierForCode(Tagged<InstructionStream> host,
+                                       RelocInfo* rinfo,
+                                       Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return;
   heap_internals::MemoryChunk* object_chunk =
       heap_internals::MemoryChunk::FromHeapObject(object);
   if (!object_chunk->InYoungGeneration()) return;
-  Heap_GenerationalBarrierForCodeSlow(rinfo, object);
+  Heap_GenerationalBarrierForCodeSlow(host, rinfo, object);
 }
 
 inline WriteBarrierMode GetWriteBarrierModeForObject(
-    HeapObject object, const DisallowGarbageCollection* promise) {
+    Tagged<HeapObject> object, const DisallowGarbageCollection* promise) {
   if (v8_flags.disable_write_barriers) return SKIP_WRITE_BARRIER;
   DCHECK(Heap_PageFlagsAreConsistent(object));
   heap_internals::MemoryChunk* chunk =
@@ -233,7 +268,7 @@ inline WriteBarrierMode GetWriteBarrierModeForObject(
   return UPDATE_WRITE_BARRIER;
 }
 
-inline bool ObjectInYoungGeneration(Object object) {
+inline bool ObjectInYoungGeneration(Tagged<Object> object) {
   // TODO(rong): Fix caller of this function when we deploy
   // v8_use_third_party_heap.
   if (v8_flags.single_generation) return false;
@@ -242,30 +277,31 @@ inline bool ObjectInYoungGeneration(Object object) {
       ->InYoungGeneration();
 }
 
-inline bool IsReadOnlyHeapObject(HeapObject object) {
+inline bool IsReadOnlyHeapObject(Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return ReadOnlyHeap::Contains(object);
   heap_internals::MemoryChunk* chunk =
       heap_internals::MemoryChunk::FromHeapObject(object);
   return chunk->InReadOnlySpace();
 }
 
-inline bool IsCodeSpaceObject(HeapObject object) {
+inline bool IsCodeSpaceObject(Tagged<HeapObject> object) {
   heap_internals::MemoryChunk* chunk =
       heap_internals::MemoryChunk::FromHeapObject(object);
   return chunk->InCodeSpace();
 }
 
-bool WriteBarrier::IsMarking(HeapObject object) {
+bool WriteBarrier::IsMarking(Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return false;
   heap_internals::MemoryChunk* chunk =
       heap_internals::MemoryChunk::FromHeapObject(object);
   return chunk->IsMarking();
 }
 
-void WriteBarrier::Marking(HeapObject host, ObjectSlot slot, Object value) {
+void WriteBarrier::Marking(Tagged<HeapObject> host, ObjectSlot slot,
+                           Tagged<Object> value) {
   DCHECK(!HasWeakHeapObjectTag(value));
   if (!value.IsHeapObject()) return;
-  HeapObject value_heap_object = HeapObject::cast(value);
+  Tagged<HeapObject> value_heap_object = HeapObject::cast(value);
   // Currently this marking barrier is never used for InstructionStream values.
   // If this ever changes then the CodePageHeaderModificationScope might be
   // required here.
@@ -273,10 +309,10 @@ void WriteBarrier::Marking(HeapObject host, ObjectSlot slot, Object value) {
   Marking(host, HeapObjectSlot(slot), value_heap_object);
 }
 
-void WriteBarrier::Marking(HeapObject host, MaybeObjectSlot slot,
+void WriteBarrier::Marking(Tagged<HeapObject> host, MaybeObjectSlot slot,
                            MaybeObject value) {
-  HeapObject value_heap_object;
-  if (!value->GetHeapObject(&value_heap_object)) return;
+  Tagged<HeapObject> value_heap_object;
+  if (!value.GetHeapObject(&value_heap_object)) return;
   // This barrier is called from generated code and from C++ code.
   // There must be no stores of InstructionStream values from generated code and
   // all stores of InstructionStream values in C++ must be handled by
@@ -285,56 +321,62 @@ void WriteBarrier::Marking(HeapObject host, MaybeObjectSlot slot,
   Marking(host, HeapObjectSlot(slot), value_heap_object);
 }
 
-void WriteBarrier::Marking(HeapObject host, HeapObjectSlot slot,
-                           HeapObject value) {
+void WriteBarrier::Marking(Tagged<HeapObject> host, HeapObjectSlot slot,
+                           Tagged<HeapObject> value) {
   if (!IsMarking(host)) return;
   MarkingSlow(host, slot, value);
 }
 
-void WriteBarrier::Marking(InstructionStream host, RelocInfo* reloc_info,
-                           HeapObject value) {
+void WriteBarrier::Marking(Tagged<InstructionStream> host,
+                           RelocInfo* reloc_info, Tagged<HeapObject> value) {
   if (!IsMarking(host)) return;
   MarkingSlow(host, reloc_info, value);
 }
 
-void WriteBarrier::Shared(InstructionStream host, RelocInfo* reloc_info,
-                          HeapObject value) {
+void WriteBarrier::Shared(Tagged<InstructionStream> host, RelocInfo* reloc_info,
+                          Tagged<HeapObject> value) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return;
 
   heap_internals::MemoryChunk* value_chunk =
       heap_internals::MemoryChunk::FromHeapObject(value);
   if (!value_chunk->InWritableSharedSpace()) return;
 
-  SharedSlow(reloc_info, value);
+  SharedSlow(host, reloc_info, value);
 }
 
-void WriteBarrier::Marking(JSArrayBuffer host,
+void WriteBarrier::Marking(Tagged<JSArrayBuffer> host,
                            ArrayBufferExtension* extension) {
   if (!extension || !IsMarking(host)) return;
   MarkingSlow(host, extension);
 }
 
-void WriteBarrier::Marking(DescriptorArray descriptor_array,
+void WriteBarrier::Marking(Tagged<DescriptorArray> descriptor_array,
                            int number_of_own_descriptors) {
   if (!IsMarking(descriptor_array)) return;
   MarkingSlow(descriptor_array, number_of_own_descriptors);
 }
 
+void WriteBarrier::Marking(Tagged<HeapObject> host, IndirectPointerSlot slot) {
+  if (!IsMarking(host)) return;
+  MarkingSlow(host, slot);
+}
+
 // static
-void WriteBarrier::MarkingFromGlobalHandle(Object value) {
+void WriteBarrier::MarkingFromGlobalHandle(Tagged<Object> value) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return;
   if (!value.IsHeapObject()) return;
   MarkingSlowFromGlobalHandle(HeapObject::cast(value));
 }
 
 // static
-void WriteBarrier::CombinedBarrierFromInternalFields(JSObject host,
+void WriteBarrier::CombinedBarrierFromInternalFields(Tagged<JSObject> host,
                                                      void* value) {
   CombinedBarrierFromInternalFields(host, 1, &value);
 }
 
 // static
-void WriteBarrier::CombinedBarrierFromInternalFields(JSObject host, size_t argc,
+void WriteBarrier::CombinedBarrierFromInternalFields(Tagged<JSObject> host,
+                                                     size_t argc,
                                                      void** values) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return;
   if (V8_LIKELY(!IsMarking(host))) {
@@ -343,7 +385,7 @@ void WriteBarrier::CombinedBarrierFromInternalFields(JSObject host, size_t argc,
   }
   MarkingBarrier* marking_barrier = CurrentMarkingBarrier(host);
   if (marking_barrier->is_minor()) {
-    // TODO(v8:13012): We do not currently mark Oilpan objects while MinorMC is
+    // TODO(v8:13012): We do not currently mark Oilpan objects while MinorMS is
     // active. Once Oilpan uses a generational GC with incremental marking and
     // unified heap, this barrier will be needed again.
     return;
@@ -352,13 +394,13 @@ void WriteBarrier::CombinedBarrierFromInternalFields(JSObject host, size_t argc,
 }
 
 // static
-void WriteBarrier::GenerationalBarrierFromInternalFields(JSObject host,
+void WriteBarrier::GenerationalBarrierFromInternalFields(Tagged<JSObject> host,
                                                          void* value) {
   GenerationalBarrierFromInternalFields(host, 1, &value);
 }
 
 // static
-void WriteBarrier::GenerationalBarrierFromInternalFields(JSObject host,
+void WriteBarrier::GenerationalBarrierFromInternalFields(Tagged<JSObject> host,
                                                          size_t argc,
                                                          void** values) {
   auto* memory_chunk = MemoryChunk::FromHeapObject(host);
@@ -375,11 +417,11 @@ void WriteBarrier::GenerationalBarrierFromInternalFields(JSObject host,
 #ifdef ENABLE_SLOW_DCHECKS
 // static
 template <typename T>
-bool WriteBarrier::IsRequired(HeapObject host, T value) {
+bool WriteBarrier::IsRequired(Tagged<HeapObject> host, T value) {
   if (BasicMemoryChunk::FromHeapObject(host)->InYoungGeneration()) return false;
-  if (value.IsSmi()) return false;
+  if (IsSmi(value)) return false;
   if (value.IsCleared()) return false;
-  HeapObject target = value.GetHeapObject();
+  Tagged<HeapObject> target = value.GetHeapObject();
   if (ReadOnlyHeap::Contains(target)) return false;
   return !IsImmortalImmovableHeapObject(target);
 }
diff --git a/deps/v8/src/heap/heap-write-barrier.cc b/deps/v8/src/heap/heap-write-barrier.cc
index b730ce261ed09b..e7239e957f80b9 100644
--- a/deps/v8/src/heap/heap-write-barrier.cc
+++ b/deps/v8/src/heap/heap-write-barrier.cc
@@ -21,7 +21,7 @@ thread_local MarkingBarrier* current_marking_barrier = nullptr;
 }  // namespace
 
 MarkingBarrier* WriteBarrier::CurrentMarkingBarrier(
-    HeapObject verification_candidate) {
+    Tagged<HeapObject> verification_candidate) {
   MarkingBarrier* marking_barrier = current_marking_barrier;
   DCHECK_NOT_NULL(marking_barrier);
 #if DEBUG
@@ -43,54 +43,63 @@ MarkingBarrier* WriteBarrier::SetForThread(MarkingBarrier* marking_barrier) {
   return existing;
 }
 
-void WriteBarrier::MarkingSlow(HeapObject host, HeapObjectSlot slot,
-                               HeapObject value) {
+void WriteBarrier::MarkingSlow(Tagged<HeapObject> host, HeapObjectSlot slot,
+                               Tagged<HeapObject> value) {
   MarkingBarrier* marking_barrier = CurrentMarkingBarrier(host);
   marking_barrier->Write(host, slot, value);
 }
 
 // static
-void WriteBarrier::MarkingSlowFromGlobalHandle(HeapObject value) {
+void WriteBarrier::MarkingSlowFromGlobalHandle(Tagged<HeapObject> value) {
   MarkingBarrier* marking_barrier = CurrentMarkingBarrier(value);
   marking_barrier->WriteWithoutHost(value);
 }
 
 // static
-void WriteBarrier::MarkingSlowFromInternalFields(Heap* heap, JSObject host) {
+void WriteBarrier::MarkingSlowFromInternalFields(Heap* heap,
+                                                 Tagged<JSObject> host) {
   if (auto* cpp_heap = heap->cpp_heap()) {
     CppHeap::From(cpp_heap)->WriteBarrier(host);
   }
 }
 
-void WriteBarrier::MarkingSlow(InstructionStream host, RelocInfo* reloc_info,
-                               HeapObject value) {
+void WriteBarrier::MarkingSlow(Tagged<InstructionStream> host,
+                               RelocInfo* reloc_info,
+                               Tagged<HeapObject> value) {
   MarkingBarrier* marking_barrier = CurrentMarkingBarrier(host);
   marking_barrier->Write(host, reloc_info, value);
 }
 
-void WriteBarrier::SharedSlow(RelocInfo* reloc_info, HeapObject value) {
+void WriteBarrier::SharedSlow(Tagged<InstructionStream> host,
+                              RelocInfo* reloc_info, Tagged<HeapObject> value) {
   MarkCompactCollector::RecordRelocSlotInfo info =
-      MarkCompactCollector::ProcessRelocInfo(reloc_info, value);
+      MarkCompactCollector::ProcessRelocInfo(host, reloc_info, value);
 
   base::MutexGuard write_scope(info.memory_chunk->mutex());
   RememberedSet<OLD_TO_SHARED>::InsertTyped(info.memory_chunk, info.slot_type,
                                             info.offset);
 }
 
-void WriteBarrier::MarkingSlow(JSArrayBuffer host,
+void WriteBarrier::MarkingSlow(Tagged<JSArrayBuffer> host,
                                ArrayBufferExtension* extension) {
   MarkingBarrier* marking_barrier = CurrentMarkingBarrier(host);
   marking_barrier->Write(host, extension);
 }
 
-void WriteBarrier::MarkingSlow(DescriptorArray descriptor_array,
+void WriteBarrier::MarkingSlow(Tagged<DescriptorArray> descriptor_array,
                                int number_of_own_descriptors) {
   MarkingBarrier* marking_barrier = CurrentMarkingBarrier(descriptor_array);
   marking_barrier->Write(descriptor_array, number_of_own_descriptors);
 }
 
+void WriteBarrier::MarkingSlow(Tagged<HeapObject> host,
+                               IndirectPointerSlot slot) {
+  MarkingBarrier* marking_barrier = CurrentMarkingBarrier(host);
+  marking_barrier->Write(host, slot);
+}
+
 int WriteBarrier::MarkingFromCode(Address raw_host, Address raw_slot) {
-  HeapObject host = HeapObject::cast(Object(raw_host));
+  Tagged<HeapObject> host = HeapObject::cast(Object(raw_host));
   MaybeObjectSlot slot(raw_slot);
   Address value = (*slot).ptr();
 
@@ -121,8 +130,31 @@ int WriteBarrier::MarkingFromCode(Address raw_host, Address raw_slot) {
   return 0;
 }
 
+int WriteBarrier::IndirectPointerMarkingFromCode(Address raw_host,
+                                                 Address raw_slot) {
+  Tagged<HeapObject> host = HeapObject::cast(Object(raw_host));
+  IndirectPointerSlot slot(raw_slot);
+
+#if DEBUG
+  Heap* heap = MemoryChunk::FromHeapObject(host)->heap();
+  DCHECK(heap->incremental_marking()->IsMarking());
+
+  // We will only reach local objects here while incremental marking in the
+  // current isolate is enabled. However, we might still reach objects in the
+  // shared space but only from the shared space isolate (= the main isolate).
+  MarkingBarrier* barrier = CurrentMarkingBarrier(host);
+  DCHECK_IMPLIES(host.InWritableSharedSpace(),
+                 barrier->heap()->isolate()->is_shared_space_isolate());
+  barrier->AssertMarkingIsActivated();
+#endif  // DEBUG
+
+  WriteBarrier::Marking(host, slot);
+  // Called by WriteBarrierCodeStubAssembler, which doesn't accept void type
+  return 0;
+}
+
 int WriteBarrier::SharedMarkingFromCode(Address raw_host, Address raw_slot) {
-  HeapObject host = HeapObject::cast(Object(raw_host));
+  Tagged<HeapObject> host = HeapObject::cast(Object(raw_host));
   MaybeObjectSlot slot(raw_slot);
   Address raw_value = (*slot).ptr();
   MaybeObject value(raw_value);
@@ -131,7 +163,7 @@ int WriteBarrier::SharedMarkingFromCode(Address raw_host, Address raw_slot) {
 
 #if DEBUG
   Heap* heap = MemoryChunk::FromHeapObject(host)->heap();
-  DCHECK(heap->incremental_marking()->IsMarking());
+  DCHECK(heap->incremental_marking()->IsMajorMarking());
   Isolate* isolate = heap->isolate();
   DCHECK(isolate->is_shared_space_isolate());
 
@@ -149,7 +181,7 @@ int WriteBarrier::SharedMarkingFromCode(Address raw_host, Address raw_slot) {
 }
 
 int WriteBarrier::SharedFromCode(Address raw_host, Address raw_slot) {
-  HeapObject host = HeapObject::cast(Object(raw_host));
+  Tagged<HeapObject> host = HeapObject::cast(Object(raw_host));
 
   if (!host.InWritableSharedSpace()) {
     Heap::SharedHeapBarrierSlow(host, raw_slot);
@@ -160,7 +192,7 @@ int WriteBarrier::SharedFromCode(Address raw_host, Address raw_slot) {
 }
 
 #ifdef ENABLE_SLOW_DCHECKS
-bool WriteBarrier::IsImmortalImmovableHeapObject(HeapObject object) {
+bool WriteBarrier::IsImmortalImmovableHeapObject(Tagged<HeapObject> object) {
   BasicMemoryChunk* basic_chunk = BasicMemoryChunk::FromHeapObject(object);
   // All objects in readonly space are immortal and immovable.
   return basic_chunk->InReadOnlySpace();
diff --git a/deps/v8/src/heap/heap-write-barrier.h b/deps/v8/src/heap/heap-write-barrier.h
index f44af9a9f174fa..b72af20dd82ccb 100644
--- a/deps/v8/src/heap/heap-write-barrier.h
+++ b/deps/v8/src/heap/heap-write-barrier.h
@@ -29,82 +29,98 @@ class RelocInfo;
 // object-macros.h.
 
 // Combined write barriers.
-void WriteBarrierForCode(InstructionStream host, RelocInfo* rinfo, Object value,
+void WriteBarrierForCode(Tagged<InstructionStream> host, RelocInfo* rinfo,
+                         Tagged<Object> value,
                          WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-void WriteBarrierForCode(InstructionStream host, RelocInfo* rinfo,
-                         HeapObject value,
+void WriteBarrierForCode(Tagged<InstructionStream> host, RelocInfo* rinfo,
+                         Tagged<HeapObject> value,
                          WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
-void CombinedWriteBarrier(HeapObject object, ObjectSlot slot, Object value,
-                          WriteBarrierMode mode);
-void CombinedWriteBarrier(HeapObject object, MaybeObjectSlot slot,
+void CombinedWriteBarrier(Tagged<HeapObject> object, ObjectSlot slot,
+                          Tagged<Object> value, WriteBarrierMode mode);
+void CombinedWriteBarrier(Tagged<HeapObject> object, MaybeObjectSlot slot,
                           MaybeObject value, WriteBarrierMode mode);
 
-void CombinedEphemeronWriteBarrier(EphemeronHashTable object, ObjectSlot slot,
-                                   Object value, WriteBarrierMode mode);
+void CombinedEphemeronWriteBarrier(Tagged<EphemeronHashTable> object,
+                                   ObjectSlot slot, Tagged<Object> value,
+                                   WriteBarrierMode mode);
+void IndirectPointerWriteBarrier(Tagged<HeapObject> host,
+                                 IndirectPointerSlot slot,
+                                 Tagged<HeapObject> value,
+                                 WriteBarrierMode mode);
 
 // Generational write barrier.
-void GenerationalBarrierForCode(RelocInfo* rinfo, HeapObject object);
+void GenerationalBarrierForCode(Tagged<InstructionStream> host,
+                                RelocInfo* rinfo, Tagged<HeapObject> object);
 
-inline bool IsReadOnlyHeapObject(HeapObject object);
+inline bool IsReadOnlyHeapObject(Tagged<HeapObject> object);
 
 class V8_EXPORT_PRIVATE WriteBarrier {
  public:
-  static inline void Marking(HeapObject host, ObjectSlot, Object value);
-  static inline void Marking(HeapObject host, HeapObjectSlot, HeapObject value);
-  static inline void Marking(HeapObject host, MaybeObjectSlot,
+  static inline void Marking(Tagged<HeapObject> host, ObjectSlot,
+                             Tagged<Object> value);
+  static inline void Marking(Tagged<HeapObject> host, HeapObjectSlot,
+                             Tagged<HeapObject> value);
+  static inline void Marking(Tagged<HeapObject> host, MaybeObjectSlot,
                              MaybeObject value);
-  static inline void Marking(InstructionStream host, RelocInfo*,
-                             HeapObject value);
-  static inline void Marking(JSArrayBuffer host, ArrayBufferExtension*);
-  static inline void Marking(DescriptorArray, int number_of_own_descriptors);
+  static inline void Marking(Tagged<InstructionStream> host, RelocInfo*,
+                             Tagged<HeapObject> value);
+  static inline void Marking(Tagged<JSArrayBuffer> host, ArrayBufferExtension*);
+  static inline void Marking(Tagged<DescriptorArray>,
+                             int number_of_own_descriptors);
+  static inline void Marking(Tagged<HeapObject> host, IndirectPointerSlot slot);
 
-  static inline void Shared(InstructionStream host, RelocInfo*,
-                            HeapObject value);
+  static inline void Shared(Tagged<InstructionStream> host, RelocInfo*,
+                            Tagged<HeapObject> value);
 
   // It is invoked from generated code and has to take raw addresses.
   static int MarkingFromCode(Address raw_host, Address raw_slot);
+  static int IndirectPointerMarkingFromCode(Address raw_host, Address raw_slot);
   static int SharedMarkingFromCode(Address raw_host, Address raw_slot);
   static int SharedFromCode(Address raw_host, Address raw_slot);
 
   // Invoked from global handles where no host object is available.
-  static inline void MarkingFromGlobalHandle(Object value);
+  static inline void MarkingFromGlobalHandle(Tagged<Object> value);
 
-  static inline void CombinedBarrierFromInternalFields(JSObject host,
+  static inline void CombinedBarrierFromInternalFields(Tagged<JSObject> host,
                                                        void* value);
-  static inline void CombinedBarrierFromInternalFields(JSObject host,
+  static inline void CombinedBarrierFromInternalFields(Tagged<JSObject> host,
                                                        size_t argc,
                                                        void** values);
 
   static MarkingBarrier* SetForThread(MarkingBarrier*);
 
   static MarkingBarrier* CurrentMarkingBarrier(
-      HeapObject verification_candidate);
+      Tagged<HeapObject> verification_candidate);
 
 #ifdef ENABLE_SLOW_DCHECKS
   template <typename T>
-  static inline bool IsRequired(HeapObject host, T value);
-  static bool IsImmortalImmovableHeapObject(HeapObject object);
+  static inline bool IsRequired(Tagged<HeapObject> host, T value);
+  static bool IsImmortalImmovableHeapObject(Tagged<HeapObject> object);
 #endif
 
-  static void MarkingSlow(HeapObject host, HeapObjectSlot, HeapObject value);
+  static void MarkingSlow(Tagged<HeapObject> host, HeapObjectSlot,
+                          Tagged<HeapObject> value);
 
  private:
-  static inline bool IsMarking(HeapObject object);
-
-  static void MarkingSlow(InstructionStream host, RelocInfo*, HeapObject value);
-  static void MarkingSlow(JSArrayBuffer host, ArrayBufferExtension*);
-  static void MarkingSlow(DescriptorArray, int number_of_own_descriptors);
-  static void MarkingSlowFromGlobalHandle(HeapObject value);
-  static void MarkingSlowFromInternalFields(Heap* heap, JSObject host);
-
-  static inline void GenerationalBarrierFromInternalFields(JSObject host,
-                                                           void* value);
-  static inline void GenerationalBarrierFromInternalFields(JSObject host,
-                                                           size_t argc,
-                                                           void** values);
-
-  static void SharedSlow(RelocInfo*, HeapObject value);
+  static inline bool IsMarking(Tagged<HeapObject> object);
+
+  static void MarkingSlow(Tagged<InstructionStream> host, RelocInfo*,
+                          Tagged<HeapObject> value);
+  static void MarkingSlow(Tagged<JSArrayBuffer> host, ArrayBufferExtension*);
+  static void MarkingSlow(Tagged<DescriptorArray>,
+                          int number_of_own_descriptors);
+  static void MarkingSlow(Tagged<HeapObject> host, IndirectPointerSlot slot);
+  static void MarkingSlowFromGlobalHandle(Tagged<HeapObject> value);
+  static void MarkingSlowFromInternalFields(Heap* heap, Tagged<JSObject> host);
+
+  static inline void GenerationalBarrierFromInternalFields(
+      Tagged<JSObject> host, void* value);
+  static inline void GenerationalBarrierFromInternalFields(
+      Tagged<JSObject> host, size_t argc, void** values);
+
+  static void SharedSlow(Tagged<InstructionStream> host, RelocInfo*,
+                         Tagged<HeapObject> value);
 
   friend class Heap;
 };
diff --git a/deps/v8/src/heap/heap.cc b/deps/v8/src/heap/heap.cc
index 90aa3360b4baa7..9504f0fb26702d 100644
--- a/deps/v8/src/heap/heap.cc
+++ b/deps/v8/src/heap/heap.cc
@@ -18,6 +18,7 @@
 #include "src/base/logging.h"
 #include "src/base/macros.h"
 #include "src/base/once.h"
+#include "src/base/optional.h"
 #include "src/base/platform/memory.h"
 #include "src/base/platform/mutex.h"
 #include "src/base/utils/random-number-generator.h"
@@ -42,7 +43,6 @@
 #include "src/heap/base/stack.h"
 #include "src/heap/base/worklist.h"
 #include "src/heap/basic-memory-chunk.h"
-#include "src/heap/code-object-registry.h"
 #include "src/heap/code-range.h"
 #include "src/heap/code-stats.h"
 #include "src/heap/collection-barrier.h"
@@ -50,8 +50,10 @@
 #include "src/heap/concurrent-allocator.h"
 #include "src/heap/concurrent-marking.h"
 #include "src/heap/cppgc-js/cpp-heap.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/evacuation-verifier-inl.h"
 #include "src/heap/finalization-registry-cleanup-task.h"
+#include "src/heap/gc-callbacks.h"
 #include "src/heap/gc-idle-time-handler.h"
 #include "src/heap/gc-tracer-inl.h"
 #include "src/heap/gc-tracer.h"
@@ -69,11 +71,13 @@
 #include "src/heap/marking-barrier.h"
 #include "src/heap/marking-state-inl.h"
 #include "src/heap/marking-state.h"
+#include "src/heap/memory-balancer.h"
 #include "src/heap/memory-chunk-inl.h"
 #include "src/heap/memory-chunk-layout.h"
 #include "src/heap/memory-measurement.h"
 #include "src/heap/memory-reducer.h"
 #include "src/heap/minor-gc-job.h"
+#include "src/heap/minor-mark-sweep.h"
 #include "src/heap/new-spaces.h"
 #include "src/heap/object-lock.h"
 #include "src/heap/object-stats.h"
@@ -88,6 +92,7 @@
 #include "src/heap/scavenger-inl.h"
 #include "src/heap/stress-scavenge-observer.h"
 #include "src/heap/sweeper.h"
+#include "src/heap/zapping.h"
 #include "src/init/bootstrapper.h"
 #include "src/init/v8.h"
 #include "src/interpreter/interpreter.h"
@@ -127,15 +132,8 @@
 namespace v8 {
 namespace internal {
 
-CodePageCollectionMemoryModificationScopeForTesting::
-    CodePageCollectionMemoryModificationScopeForTesting(Heap* heap)
-    : CodePageCollectionMemoryModificationScope(heap) {}
-
-CodePageCollectionMemoryModificationScopeForTesting::
-    ~CodePageCollectionMemoryModificationScopeForTesting() = default;
-
 #ifdef V8_ENABLE_THIRD_PARTY_HEAP
-Isolate* Heap::GetIsolateFromWritableObject(HeapObject object) {
+Isolate* Heap::GetIsolateFromWritableObject(Tagged<HeapObject> object) {
   return reinterpret_cast<Isolate*>(
       third_party_heap::Heap::GetIsolate(object.address()));
 }
@@ -143,23 +141,25 @@ Isolate* Heap::GetIsolateFromWritableObject(HeapObject object) {
 
 // These are outside the Heap class so they can be forward-declared
 // in heap-write-barrier-inl.h.
-bool Heap_PageFlagsAreConsistent(HeapObject object) {
+bool Heap_PageFlagsAreConsistent(Tagged<HeapObject> object) {
   return Heap::PageFlagsAreConsistent(object);
 }
 
-void Heap_CombinedGenerationalAndSharedBarrierSlow(HeapObject object,
+void Heap_CombinedGenerationalAndSharedBarrierSlow(Tagged<HeapObject> object,
                                                    Address slot,
-                                                   HeapObject value) {
+                                                   Tagged<HeapObject> value) {
   Heap::CombinedGenerationalAndSharedBarrierSlow(object, slot, value);
 }
 
 void Heap_CombinedGenerationalAndSharedEphemeronBarrierSlow(
-    EphemeronHashTable table, Address slot, HeapObject value) {
+    Tagged<EphemeronHashTable> table, Address slot, Tagged<HeapObject> value) {
   Heap::CombinedGenerationalAndSharedEphemeronBarrierSlow(table, slot, value);
 }
 
-void Heap_GenerationalBarrierForCodeSlow(RelocInfo* rinfo, HeapObject object) {
-  Heap::GenerationalBarrierForCodeSlow(rinfo, object);
+void Heap_GenerationalBarrierForCodeSlow(Tagged<InstructionStream> host,
+                                         RelocInfo* rinfo,
+                                         Tagged<HeapObject> object) {
+  Heap::GenerationalBarrierForCodeSlow(host, rinfo, object);
 }
 
 void Heap::SetConstructStubCreateDeoptPCOffset(int pc_offset) {
@@ -177,12 +177,12 @@ void Heap::SetInterpreterEntryReturnPCOffset(int pc_offset) {
   set_interpreter_entry_return_pc_offset(Smi::FromInt(pc_offset));
 }
 
-void Heap::SetSerializedObjects(FixedArray objects) {
+void Heap::SetSerializedObjects(Tagged<FixedArray> objects) {
   DCHECK(isolate()->serializer_enabled());
   set_serialized_objects(objects);
 }
 
-void Heap::SetSerializedGlobalProxySizes(FixedArray sizes) {
+void Heap::SetSerializedGlobalProxySizes(Tagged<FixedArray> sizes) {
   DCHECK(isolate()->serializer_enabled());
   set_serialized_global_proxy_sizes(sizes);
 }
@@ -191,19 +191,16 @@ void Heap::SetBasicBlockProfilingData(Handle<ArrayList> list) {
   set_basic_block_profiling_data(*list);
 }
 
-class ScheduleMinorGCTaskObserver : public AllocationObserver {
+class ScheduleMinorGCTaskObserver final : public AllocationObserver {
  public:
   explicit ScheduleMinorGCTaskObserver(Heap* heap)
       : AllocationObserver(kNotUsingFixedStepSize), heap_(heap) {
     // Register GC callback for all atomic pause types.
     heap_->main_thread_local_heap()->AddGCEpilogueCallback(
-        &GCEpilogueCallback, this,
-        static_cast<GCType>(GCType::kGCTypeScavenge |
-                            GCType::kGCTypeMinorMarkCompact |
-                            GCType::kGCTypeMarkSweepCompact));
+        &GCEpilogueCallback, this, GCCallbacksInSafepoint::GCType::kLocal);
     AddToNewSpace();
   }
-  ~ScheduleMinorGCTaskObserver() override {
+  ~ScheduleMinorGCTaskObserver() final {
     RemoveFromNewSpace();
     heap_->main_thread_local_heap()->RemoveGCEpilogueCallback(
         &GCEpilogueCallback, this);
@@ -221,7 +218,7 @@ class ScheduleMinorGCTaskObserver : public AllocationObserver {
   }
 
   void Step(int, Address, size_t) final {
-    StepImpl();
+    heap_->ScheduleMinorGCTaskIfNeeded();
     // Remove this observer. It will be re-added after a GC.
     DCHECK(was_added_to_space_);
     heap_->new_space()->RemoveAllocationObserver(this);
@@ -229,8 +226,7 @@ class ScheduleMinorGCTaskObserver : public AllocationObserver {
   }
 
  protected:
-  static void GCEpilogueCallback(LocalIsolate*, GCType, GCCallbackFlags,
-                                 void* observer) {
+  static void GCEpilogueCallback(void* observer) {
     reinterpret_cast<ScheduleMinorGCTaskObserver*>(observer)
         ->RemoveFromNewSpace();
     reinterpret_cast<ScheduleMinorGCTaskObserver*>(observer)->AddToNewSpace();
@@ -238,6 +234,8 @@ class ScheduleMinorGCTaskObserver : public AllocationObserver {
 
   void AddToNewSpace() {
     DCHECK(!was_added_to_space_);
+    DCHECK_IMPLIES(v8_flags.minor_ms,
+                   heap_->new_space()->top() == kNullAddress);
     heap_->new_space()->AddAllocationObserver(this);
     was_added_to_space_ = true;
   }
@@ -248,32 +246,10 @@ class ScheduleMinorGCTaskObserver : public AllocationObserver {
     was_added_to_space_ = false;
   }
 
-  virtual void StepImpl() { heap_->ScheduleMinorGCTaskIfNeeded(); }
   Heap* heap_;
   bool was_added_to_space_ = false;
 };
 
-class MinorMCIncrementalMarkingTaskObserver final
-    : public ScheduleMinorGCTaskObserver {
- public:
-  explicit MinorMCIncrementalMarkingTaskObserver(Heap* heap)
-      : ScheduleMinorGCTaskObserver(heap) {}
-
- protected:
-  void StepImpl() final {
-    if (v8_flags.concurrent_minor_mc_marking) {
-      if (heap_->incremental_marking()->IsMinorMarking()) {
-        heap_->concurrent_marking()->RescheduleJobIfNeeded(
-            GarbageCollector::MINOR_MARK_COMPACTOR);
-      }
-    }
-
-    heap_->StartMinorMCIncrementalMarkingIfNeeded();
-
-    ScheduleMinorGCTaskObserver::StepImpl();
-  }
-};
-
 Heap::Heap()
     : isolate_(isolate()),
       heap_allocator_(this),
@@ -283,10 +259,8 @@ Heap::Heap()
       allocation_type_for_in_place_internalizable_strings_(
           isolate()->OwnsStringTables() ? AllocationType::kOld
                                         : AllocationType::kSharedOld),
-      collection_barrier_(new CollectionBarrier(this)),
       marking_state_(isolate_),
       non_atomic_marking_state_(isolate_),
-      atomic_marking_state_(isolate_),
       pretenuring_handler_(this) {
   // Ensure old_generation_size_ is a multiple of kPageSize.
   DCHECK_EQ(0, max_old_generation_size() & (Page::kPageSize - 1));
@@ -294,9 +268,6 @@ Heap::Heap()
   max_regular_code_object_size_ = MemoryChunkLayout::MaxRegularCodeObjectSize();
 
   set_native_contexts_list(Smi::zero());
-  set_allocation_sites_list(Smi::zero());
-  set_dirty_js_finalization_registries_list(Smi::zero());
-  set_dirty_js_finalization_registries_list_tail(Smi::zero());
 
   // Put a dummy entry in the remembered pages so we can find the list the
   // minidump even if there are no real unmapped pages.
@@ -307,20 +278,25 @@ Heap::~Heap() = default;
 
 size_t Heap::MaxReserved() const {
   const size_t kMaxNewLargeObjectSpaceSize = max_semi_space_size_;
-  return static_cast<size_t>(2 * max_semi_space_size_ +
-                             kMaxNewLargeObjectSpaceSize +
-                             max_old_generation_size());
+  return static_cast<size_t>(
+      (v8_flags.minor_ms ? 1 : 2) * max_semi_space_size_ +
+      kMaxNewLargeObjectSpaceSize + max_old_generation_size());
 }
 
 size_t Heap::YoungGenerationSizeFromOldGenerationSize(size_t old_generation) {
   // Compute the semi space size and cap it.
-  size_t ratio = old_generation <= kOldGenerationLowMemory
-                     ? kOldGenerationToSemiSpaceRatioLowMemory
-                     : kOldGenerationToSemiSpaceRatio;
-  size_t semi_space = old_generation / ratio;
-  semi_space = std::min({semi_space, kMaxSemiSpaceSize});
-  semi_space = std::max({semi_space, kMinSemiSpaceSize});
-  semi_space = RoundUp(semi_space, Page::kPageSize);
+  bool is_low_memory = old_generation <= kOldGenerationLowMemory;
+  size_t semi_space;
+  if (v8_flags.minor_ms && !is_low_memory) {
+    semi_space = DefaultMaxSemiSpaceSize();
+  } else {
+    size_t ratio = is_low_memory ? OldGenerationToSemiSpaceRatioLowMemory()
+                                 : OldGenerationToSemiSpaceRatio();
+    semi_space = old_generation / ratio;
+    semi_space = std::min({semi_space, DefaultMaxSemiSpaceSize()});
+    semi_space = std::max({semi_space, DefaultMinSemiSpaceSize()});
+    semi_space = RoundUp(semi_space, Page::kPageSize);
+  }
   return YoungGenerationSizeFromSemiSpaceSize(semi_space);
 }
 
@@ -366,7 +342,7 @@ void Heap::GenerationSizesFromHeapSize(size_t heap_size,
 }
 
 size_t Heap::MinYoungGenerationSize() {
-  return YoungGenerationSizeFromSemiSpaceSize(kMinSemiSpaceSize);
+  return YoungGenerationSizeFromSemiSpaceSize(DefaultMinSemiSpaceSize());
 }
 
 size_t Heap::MinOldGenerationSize() {
@@ -379,7 +355,7 @@ size_t Heap::AllocatorLimitOnMaxOldGenerationSize() {
 #ifdef V8_COMPRESS_POINTERS
   // Isolate and the young generation are also allocated on the heap.
   return kPtrComprCageReservationSize -
-         YoungGenerationSizeFromSemiSpaceSize(kMaxSemiSpaceSize) -
+         YoungGenerationSizeFromSemiSpaceSize(DefaultMaxSemiSpaceSize()) -
          RoundUp(sizeof(Isolate), size_t{1} << kPageSizeBits);
 #else
   return std::numeric_limits<size_t>::max();
@@ -388,25 +364,31 @@ size_t Heap::AllocatorLimitOnMaxOldGenerationSize() {
 
 size_t Heap::MaxOldGenerationSize(uint64_t physical_memory) {
   size_t max_size = V8HeapTrait::kMaxSize;
-  // Finch experiment: Increase the heap size from 2GB to 4GB for 64-bit
-  // systems with physical memory bigger than 16GB. The physical memory
-  // is rounded up to GB.
+  // Increase the heap size from 2GB to 4GB for 64-bit systems with physical
+  // memory at least 16GB. The theshold is set to 15GB to accomodate for some
+  // memory being reserved by the hardware.
   constexpr bool x64_bit = Heap::kHeapLimitMultiplier >= 2;
   if (v8_flags.huge_max_old_generation_size && x64_bit &&
-      (physical_memory + 512 * MB) / GB >= 16) {
-    DCHECK_EQ(max_size / GB, 2);
+      (physical_memory / GB) >= 15) {
+    DCHECK_EQ(max_size / GB, 2u);
     max_size *= 2;
   }
   return std::min(max_size, AllocatorLimitOnMaxOldGenerationSize());
 }
 
+namespace {
+int NumberOfSemiSpaces() { return v8_flags.minor_ms ? 1 : 2; }
+}  // namespace
+
 size_t Heap::YoungGenerationSizeFromSemiSpaceSize(size_t semi_space_size) {
-  return semi_space_size * (2 + kNewLargeObjectSpaceToSemiSpaceRatio);
+  return semi_space_size *
+         (NumberOfSemiSpaces() + kNewLargeObjectSpaceToSemiSpaceRatio);
 }
 
 size_t Heap::SemiSpaceSizeFromYoungGenerationSize(
     size_t young_generation_size) {
-  return young_generation_size / (2 + kNewLargeObjectSpaceToSemiSpaceRatio);
+  return young_generation_size /
+         (NumberOfSemiSpaces() + kNewLargeObjectSpaceToSemiSpaceRatio);
 }
 
 size_t Heap::Capacity() {
@@ -504,31 +486,24 @@ size_t Heap::Available() {
 bool Heap::CanExpandOldGeneration(size_t size) const {
   if (force_oom_ || force_gc_on_next_allocation_) return false;
   if (OldGenerationCapacity() + size > max_old_generation_size()) return false;
-  // The OldGenerationCapacity does not account compaction spaces used
-  // during evacuation. Ensure that expanding the old generation does push
-  // the total allocated memory size over the maximum heap size.
+  // Stay below `MaxReserved()` such that it is more likely that committing the
+  // second semi space at the beginning of a GC succeeds.
   return memory_allocator()->Size() + size <= MaxReserved();
 }
 
+bool Heap::IsOldGenerationExpansionAllowed(
+    size_t size, const base::MutexGuard& expansion_mutex_guard) const {
+  return OldGenerationCapacity() + size <= max_old_generation_size();
+}
+
 namespace {
 bool IsIsolateDeserializationActive(LocalHeap* local_heap) {
   return local_heap && !local_heap->heap()->deserialization_complete();
 }
 }  // anonymous namespace
 
-bool Heap::CanExpandOldGenerationBackground(LocalHeap* local_heap,
-                                            size_t size) {
-  if (force_oom_) return false;
-
-  // When the heap is tearing down, then GC requests from background threads
-  // are not served and the threads are allowed to expand the heap to avoid OOM.
-  return gc_state() == TEAR_DOWN || IsMainThreadParked(local_heap) ||
-         IsIsolateDeserializationActive(local_heap) ||
-         memory_allocator()->Size() + size <= MaxReserved();
-}
-
 bool Heap::CanPromoteYoungAndExpandOldGeneration(size_t size) const {
-  size_t new_space_capacity = NewSpaceCapacity();
+  size_t new_space_capacity = NewSpaceTargetCapacity();
   size_t new_lo_space_capacity = new_lo_space_ ? new_lo_space_->Size() : 0;
 
   // Over-estimate the new space size using capacity to allow some slack.
@@ -541,13 +516,18 @@ bool Heap::HasBeenSetUp() const {
   return old_space_ != nullptr;
 }
 
+bool Heap::ShouldUseBackgroundThreads() const {
+  return !v8_flags.single_threaded_gc_in_background ||
+         !isolate()->IsIsolateInBackground();
+}
+
 GarbageCollector Heap::SelectGarbageCollector(AllocationSpace space,
                                               GarbageCollectionReason gc_reason,
                                               const char** reason) const {
-  if (gc_reason == GarbageCollectionReason::kFinalizeMinorMC) {
+  if (gc_reason == GarbageCollectionReason::kFinalizeConcurrentMinorMS) {
     DCHECK(new_space());
-    *reason = "finalize MinorMC";
-    return GarbageCollector::MINOR_MARK_COMPACTOR;
+    *reason = "Concurrent MinorMS needs finalization";
+    return GarbageCollector::MINOR_MARK_SWEEPER;
   }
 
   // Is global GC requested?
@@ -599,6 +579,48 @@ bool Heap::IsGCWithStack() const {
          cppgc::EmbedderStackState::kMayContainHeapPointers;
 }
 
+bool Heap::CanShortcutStringsDuringGC(GarbageCollector collector) const {
+  if (!v8_flags.shortcut_strings_with_stack && IsGCWithStack()) return false;
+
+  switch (collector) {
+    case GarbageCollector::MINOR_MARK_SWEEPER:
+      if (!v8_flags.minor_ms_shortcut_strings) return false;
+
+      DCHECK(!incremental_marking()->IsMajorMarking());
+
+      // Minor MS cannot short cut strings during concurrent marking.
+      if (incremental_marking()->IsMinorMarking()) return false;
+
+      // Minor MS uses static roots to check for strings to shortcut.
+      if (!V8_STATIC_ROOTS_BOOL) return false;
+
+      break;
+    case GarbageCollector::SCAVENGER:
+      // Scavenger cannot short cut strings during incremental marking.
+      if (incremental_marking()->IsMajorMarking()) return false;
+
+      if (isolate()->has_shared_space() &&
+          !isolate()->is_shared_space_isolate() &&
+          isolate()
+              ->shared_space_isolate()
+              ->heap()
+              ->incremental_marking()
+              ->IsMarking()) {
+        DCHECK(isolate()
+                   ->shared_space_isolate()
+                   ->heap()
+                   ->incremental_marking()
+                   ->IsMajorMarking());
+        return false;
+      }
+      break;
+    default:
+      UNREACHABLE();
+  }
+
+  return true;
+}
+
 void Heap::PrintShortHeapStatistics() {
   if (!v8_flags.trace_gc_verbose) return;
   PrintIsolate(isolate_,
@@ -614,9 +636,10 @@ void Heap::PrintShortHeapStatistics() {
                read_only_space_->CommittedMemory() / KB);
   PrintIsolate(isolate_,
                "New space,              used: %6zu KB"
-               ", available: %6zu KB"
+               ", available: %6zu KB%s"
                ", committed: %6zu KB\n",
                NewSpaceSize() / KB, new_space_->Available() / KB,
+               (v8_flags.minor_ms && minor_sweeping_in_progress()) ? "*" : "",
                new_space_->CommittedMemory() / KB);
   PrintIsolate(isolate_,
                "New large object space, used: %6zu KB"
@@ -627,15 +650,17 @@ void Heap::PrintShortHeapStatistics() {
                new_lo_space_->CommittedMemory() / KB);
   PrintIsolate(isolate_,
                "Old space,              used: %6zu KB"
-               ", available: %6zu KB"
+               ", available: %6zu KB%s"
                ", committed: %6zu KB\n",
                old_space_->SizeOfObjects() / KB, old_space_->Available() / KB,
+               sweeping_in_progress() ? "*" : "",
                old_space_->CommittedMemory() / KB);
   PrintIsolate(isolate_,
                "Code space,             used: %6zu KB"
-               ", available: %6zu KB"
+               ", available: %6zu KB%s"
                ", committed: %6zu KB\n",
                code_space_->SizeOfObjects() / KB, code_space_->Available() / KB,
+               major_sweeping_in_progress() ? "*" : "",
                code_space_->CommittedMemory() / KB);
   PrintIsolate(isolate_,
                "Large object space,     used: %6zu KB"
@@ -653,10 +678,10 @@ void Heap::PrintShortHeapStatistics() {
   ReadOnlySpace* const ro_space = read_only_space_;
   PrintIsolate(isolate_,
                "All spaces,             used: %6zu KB"
-               ", available: %6zu KB"
+               ", available: %6zu KB%s"
                ", committed: %6zu KB\n",
                (this->SizeOfObjects() + ro_space->Size()) / KB,
-               (this->Available()) / KB,
+               (this->Available()) / KB, sweeping_in_progress() ? "*" : "",
                (this->CommittedMemory() + ro_space->CommittedMemory()) / KB);
   PrintIsolate(isolate_,
                "Unmapper buffering %zu chunks of committed: %6zu KB\n",
@@ -669,7 +694,12 @@ void Heap::PrintShortHeapStatistics() {
   PrintIsolate(isolate_, "External memory global %zu KB\n",
                external_memory_callback_() / KB);
   PrintIsolate(isolate_, "Total time spent in GC  : %.1f ms\n",
-               total_gc_time_ms_);
+               total_gc_time_ms_.InMillisecondsF());
+  if (sweeping_in_progress()) {
+    PrintIsolate(isolate_,
+                 "(*) Sweeping is still in progress, making available sizes "
+                 "inaccurate.\n");
+  }
 }
 
 void Heap::PrintFreeListsStats() {
@@ -764,7 +794,7 @@ void Heap::DumpJSONHeapStatistics(std::stringstream& stream) {
     std::stringstream stream;
     stream << DICT(
       MEMBER("name")
-        << QUOTE(BaseSpace::GetSpaceName(
+        << QUOTE(ToString(
               static_cast<AllocationSpace>(space_index)))
         << ","
       MEMBER("size") << space_stats.space_size() << ","
@@ -876,7 +906,7 @@ class Heap::AllocationTrackerForDebugging final
   void UpdateObjectSizeEvent(Address, int) final {}
 
  private:
-  void UpdateAllocationsHash(HeapObject object) {
+  void UpdateAllocationsHash(Tagged<HeapObject> object) {
     Address object_address = object.address();
     MemoryChunk* memory_chunk = MemoryChunk::FromAddress(object_address);
     AllocationSpace allocation_space = memory_chunk->owner_identity();
@@ -952,13 +982,13 @@ void Heap::AddRetainingPathTarget(Handle<HeapObject> object,
   }
 }
 
-bool Heap::IsRetainingPathTarget(HeapObject object,
+bool Heap::IsRetainingPathTarget(Tagged<HeapObject> object,
                                  RetainingPathOption* option) {
-  WeakArrayList targets = retaining_path_targets();
-  int length = targets.length();
+  Tagged<WeakArrayList> targets = retaining_path_targets();
+  int length = targets->length();
   MaybeObject object_to_check = HeapObjectReference::Weak(object);
   for (int i = 0; i < length; i++) {
-    MaybeObject target = targets.Get(i);
+    MaybeObject target = targets->Get(i);
     DCHECK(target->IsWeakOrCleared());
     if (target == object_to_check) {
       DCHECK(retaining_path_target_option_.count(i));
@@ -969,13 +999,14 @@ bool Heap::IsRetainingPathTarget(HeapObject object,
   return false;
 }
 
-void Heap::PrintRetainingPath(HeapObject target, RetainingPathOption option) {
+void Heap::PrintRetainingPath(Tagged<HeapObject> target,
+                              RetainingPathOption option) {
   PrintF("\n\n\n");
   PrintF("#################################################\n");
   PrintF("Retaining path for %p:\n", reinterpret_cast<void*>(target.ptr()));
-  HeapObject object = target;
-  std::vector<std::pair<HeapObject, bool>> retaining_path;
-  Root root = Root::kUnknown;
+  Tagged<HeapObject> object = target;
+  std::vector<std::pair<Tagged<HeapObject>, bool>> retaining_path;
+  base::Optional<Root> root;
   bool ephemeron = false;
   while (true) {
     retaining_path.push_back(std::make_pair(object, ephemeron));
@@ -988,51 +1019,52 @@ void Heap::PrintRetainingPath(HeapObject target, RetainingPathOption option) {
       ephemeron = false;
     } else {
       if (retaining_root_.count(object)) {
-        root = retaining_root_[object];
+        root.emplace(retaining_root_[object]);
       }
       break;
     }
   }
   int distance = static_cast<int>(retaining_path.size());
   for (auto node : retaining_path) {
-    HeapObject node_object = node.first;
+    Tagged<HeapObject> node_object = node.first;
     bool node_ephemeron = node.second;
     PrintF("\n");
     PrintF("^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n");
     PrintF("Distance from root %d%s: ", distance,
            node_ephemeron ? " (ephemeron)" : "");
-    node_object.ShortPrint();
+    ShortPrint(*node_object);
     PrintF("\n");
 #ifdef OBJECT_PRINT
-    node_object.Print();
+    i::Print(*node_object);
     PrintF("\n");
 #endif
     --distance;
   }
   PrintF("\n");
   PrintF("^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n");
-  PrintF("Root: %s\n", RootVisitor::RootName(root));
+  PrintF("Root: %s\n",
+         root.has_value() ? RootVisitor::RootName(root.value()) : "Unknown");
   PrintF("-------------------------------------------------\n");
 }
 
 void UpdateRetainersMapAfterScavenge(UnorderedHeapObjectMap<HeapObject>* map) {
   // This is only used for Scavenger.
-  DCHECK(!v8_flags.minor_mc);
+  DCHECK(!v8_flags.minor_ms);
 
   UnorderedHeapObjectMap<HeapObject> updated_map;
 
   for (auto pair : *map) {
-    HeapObject object = pair.first;
-    HeapObject retainer = pair.second;
+    Tagged<HeapObject> object = pair.first;
+    Tagged<HeapObject> retainer = pair.second;
 
     if (Heap::InFromPage(object)) {
-      MapWord map_word = object.map_word(kRelaxedLoad);
+      MapWord map_word = object->map_word(kRelaxedLoad);
       if (!map_word.IsForwardingAddress()) continue;
       object = map_word.ToForwardingAddress(object);
     }
 
     if (Heap::InFromPage(retainer)) {
-      MapWord map_word = retainer.map_word(kRelaxedLoad);
+      MapWord map_word = retainer->map_word(kRelaxedLoad);
       if (!map_word.IsForwardingAddress()) continue;
       retainer = map_word.ToForwardingAddress(retainer);
     }
@@ -1045,9 +1077,10 @@ void UpdateRetainersMapAfterScavenge(UnorderedHeapObjectMap<HeapObject>* map) {
 
 void Heap::UpdateRetainersAfterScavenge() {
   if (!incremental_marking()->IsMarking()) return;
+  DCHECK(incremental_marking()->IsMajorMarking());
 
   // This is only used for Scavenger.
-  DCHECK(!v8_flags.minor_mc);
+  DCHECK(!v8_flags.minor_ms);
 
   UpdateRetainersMapAfterScavenge(&retainer_);
   UpdateRetainersMapAfterScavenge(&ephemeron_retainer_);
@@ -1055,10 +1088,10 @@ void Heap::UpdateRetainersAfterScavenge() {
   UnorderedHeapObjectMap<Root> updated_retaining_root;
 
   for (auto pair : retaining_root_) {
-    HeapObject object = pair.first;
+    Tagged<HeapObject> object = pair.first;
 
     if (Heap::InFromPage(object)) {
-      MapWord map_word = object.map_word(kRelaxedLoad);
+      MapWord map_word = object->map_word(kRelaxedLoad);
       if (!map_word.IsForwardingAddress()) continue;
       object = map_word.ToForwardingAddress(object);
     }
@@ -1069,7 +1102,7 @@ void Heap::UpdateRetainersAfterScavenge() {
   retaining_root_ = std::move(updated_retaining_root);
 }
 
-void Heap::AddRetainer(HeapObject retainer, HeapObject object) {
+void Heap::AddRetainer(Tagged<HeapObject> retainer, Tagged<HeapObject> object) {
   if (retainer_.count(object)) return;
   retainer_[object] = retainer;
   RetainingPathOption option = RetainingPathOption::kDefault;
@@ -1083,7 +1116,8 @@ void Heap::AddRetainer(HeapObject retainer, HeapObject object) {
   }
 }
 
-void Heap::AddEphemeronRetainer(HeapObject retainer, HeapObject object) {
+void Heap::AddEphemeronRetainer(Tagged<HeapObject> retainer,
+                                Tagged<HeapObject> object) {
   if (ephemeron_retainer_.count(object)) return;
   ephemeron_retainer_[object] = retainer;
   RetainingPathOption option = RetainingPathOption::kDefault;
@@ -1096,7 +1130,7 @@ void Heap::AddEphemeronRetainer(HeapObject retainer, HeapObject object) {
   }
 }
 
-void Heap::AddRetainingRoot(Root root, HeapObject object) {
+void Heap::AddRetainingRoot(Root root, Tagged<HeapObject> object) {
   if (retaining_root_.count(object)) return;
   retaining_root_[object] = root;
   RetainingPathOption option = RetainingPathOption::kDefault;
@@ -1115,7 +1149,7 @@ void Heap::GarbageCollectionPrologue(
   TRACE_GC(tracer(), GCTracer::Scope::HEAP_PROLOGUE);
 
   is_current_gc_forced_ = gc_callback_flags & v8::kGCCallbackFlagForced ||
-                          current_gc_flags_ & kForcedGC ||
+                          current_gc_flags_ & GCFlag::kForced ||
                           force_gc_on_next_allocation_;
   is_current_gc_for_heap_profiler_ =
       gc_reason == GarbageCollectionReason::kHeapProfiler;
@@ -1129,7 +1163,11 @@ void Heap::GarbageCollectionPrologue(
   // evacuation of a non-full new space (or if we are on the last page) there
   // may be uninitialized memory behind top. We fill the remainder of the page
   // with a filler.
-  if (new_space()) new_space()->MakeLinearAllocationAreaIterable();
+  if (new_space()) {
+    new_space()->MakeLinearAllocationAreaIterable();
+    DCHECK_NOT_NULL(minor_gc_job());
+    minor_gc_job()->CancelTaskIfScheduled();
+  }
 
   // Reset GC statistics.
   promoted_objects_size_ = 0;
@@ -1148,11 +1186,6 @@ void Heap::GarbageCollectionPrologue(
   if (v8_flags.gc_verbose) Print();
 #endif  // DEBUG
 
-  if (new_space_ && new_space_->IsAtMaximumCapacity()) {
-    maximum_size_minor_gcs_++;
-  } else {
-    maximum_size_minor_gcs_ = 0;
-  }
   memory_allocator()->unmapper()->PrepareForGC();
 }
 
@@ -1163,7 +1196,7 @@ void Heap::GarbageCollectionPrologueInSafepoint() {
   DCHECK_EQ(ResizeNewSpaceMode::kNone, resize_new_space_mode_);
   if (new_space_) {
     UpdateNewSpaceAllocationCounter();
-    if (!v8_flags.minor_mc) {
+    if (!v8_flags.minor_ms) {
       resize_new_space_mode_ = ShouldResizeNewSpace();
       // Pretenuring heuristics require that new space grows before pretenuring
       // feedback is processed.
@@ -1248,13 +1281,15 @@ void Heap::DeoptMarkedAllocationSites() {
   // TODO(hpayer): If iterating over the allocation sites list becomes a
   // performance issue, use a cache data structure in heap instead.
 
-  ForeachAllocationSite(allocation_sites_list(), [this](AllocationSite site) {
-    if (site.deopt_dependent_code()) {
-      DependentCode::MarkCodeForDeoptimization(
-          isolate_, site, DependentCode::kAllocationSiteTenuringChangedGroup);
-      site.set_deopt_dependent_code(false);
-    }
-  });
+  ForeachAllocationSite(
+      allocation_sites_list(), [this](Tagged<AllocationSite> site) {
+        if (site->deopt_dependent_code()) {
+          DependentCode::MarkCodeForDeoptimization(
+              isolate_, site,
+              DependentCode::kAllocationSiteTenuringChangedGroup);
+          site->set_deopt_dependent_code(false);
+        }
+      });
 
   Deoptimizer::DeoptimizeMarkedCode(isolate_);
 }
@@ -1265,8 +1300,8 @@ static GCType GetGCTypeFromGarbageCollector(GarbageCollector collector) {
       return kGCTypeMarkSweepCompact;
     case GarbageCollector::SCAVENGER:
       return kGCTypeScavenge;
-    case GarbageCollector::MINOR_MARK_COMPACTOR:
-      return kGCTypeMinorMarkCompact;
+    case GarbageCollector::MINOR_MARK_SWEEPER:
+      return kGCTypeMinorMarkSweep;
     default:
       UNREACHABLE();
   }
@@ -1287,21 +1322,20 @@ void Heap::GarbageCollectionEpilogueInSafepoint(GarbageCollector collector) {
   {
     // Allows handle derefs for all threads/isolates from this thread.
     AllowHandleDereferenceAllThreads allow_all_handle_derefs;
-    safepoint()->IterateLocalHeaps([this, collector](LocalHeap* local_heap) {
+    safepoint()->IterateLocalHeaps([](LocalHeap* local_heap) {
       local_heap->InvokeGCEpilogueCallbacksInSafepoint(
-          GetGCTypeFromGarbageCollector(collector), current_gc_callback_flags_);
+          GCCallbacksInSafepoint::GCType::kLocal);
     });
 
-    if (isolate()->is_shared_space_isolate()) {
-      isolate()->global_safepoint()->IterateClientIsolates(
-          [this, collector](Isolate* client) {
-            client->heap()->safepoint()->IterateLocalHeaps(
-                [this, collector](LocalHeap* local_heap) {
-                  local_heap->InvokeGCEpilogueCallbacksInSafepoint(
-                      GetGCTypeFromGarbageCollector(collector),
-                      current_gc_callback_flags_);
-                });
-          });
+    if (collector == GarbageCollector::MARK_COMPACTOR &&
+        isolate()->is_shared_space_isolate()) {
+      isolate()->global_safepoint()->IterateClientIsolates([](Isolate* client) {
+        client->heap()->safepoint()->IterateLocalHeaps(
+            [](LocalHeap* local_heap) {
+              local_heap->InvokeGCEpilogueCallbacksInSafepoint(
+                  GCCallbacksInSafepoint::GCType::kShared);
+            });
+      });
     }
   }
 
@@ -1335,24 +1369,15 @@ void Heap::GarbageCollectionEpilogueInSafepoint(GarbageCollector collector) {
 #undef UPDATE_COUNTERS_AND_FRAGMENTATION_FOR_SPACE
 
 #ifdef DEBUG
-  // Old-to-new slot sets must be empty after each collection.
-  for (SpaceIterator it(this); it.HasNext();) {
-    Space* space = it.Next();
-
-    for (MemoryChunk* chunk = space->first_page(); chunk != space->last_page();
-         chunk = chunk->list_node().next())
-      DCHECK_NULL(chunk->invalidated_slots<OLD_TO_NEW>());
-  }
-
   if (v8_flags.print_global_handles) isolate_->global_handles()->Print();
   if (v8_flags.print_handles) PrintHandles();
   if (v8_flags.check_handle_count) CheckHandleCount();
 #endif
 
-  if (new_space() && !v8_flags.minor_mc) {
+  if (new_space() && !v8_flags.minor_ms) {
     SemiSpaceNewSpace* semi_space_new_space =
         SemiSpaceNewSpace::From(new_space());
-    if (Heap::ShouldZapGarbage() || v8_flags.clear_free_memory) {
+    if (heap::ShouldZapGarbage() || v8_flags.clear_free_memory) {
       semi_space_new_space->ZapUnusedMemory();
     }
 
@@ -1438,52 +1463,65 @@ bool GCCallbacksScope::CheckReenter() const {
 
 void Heap::HandleGCRequest() {
   if (IsStressingScavenge() && stress_scavenge_observer_->HasRequestedGC()) {
-    CollectAllGarbage(NEW_SPACE, GarbageCollectionReason::kTesting);
+    CollectGarbage(NEW_SPACE, GarbageCollectionReason::kTesting);
     stress_scavenge_observer_->RequestedGCDone();
   } else if (HighMemoryPressure()) {
     CheckMemoryPressure();
   } else if (CollectionRequested()) {
     CheckCollectionRequested();
-  } else if (incremental_marking()->CollectionRequested()) {
+  } else if (incremental_marking()->MajorCollectionRequested()) {
     CollectAllGarbage(current_gc_flags_,
                       GarbageCollectionReason::kFinalizeMarkingViaStackGuard,
                       current_gc_callback_flags_);
+  } else if (incremental_marking()->MinorCollectionRequested()) {
+    CollectGarbage(NEW_SPACE,
+                   GarbageCollectionReason::kFinalizeConcurrentMinorMS);
   }
 }
 
 void Heap::ScheduleMinorGCTaskIfNeeded() {
   DCHECK_NOT_NULL(minor_gc_job_);
-  minor_gc_job_->ScheduleTaskIfNeeded(this);
+  minor_gc_job_->ScheduleTask();
 }
 
-void Heap::StartMinorMCIncrementalMarkingIfNeeded() {
-  if (v8_flags.concurrent_minor_mc_marking && !IsTearingDown() &&
-      !incremental_marking()->IsMarking() &&
-      incremental_marking()->CanBeStarted() && V8_LIKELY(!v8_flags.gc_global) &&
-      (new_space()->Size() >=
-       MinorGCJob::YoungGenerationTaskTriggerSize(this))) {
-    StartIncrementalMarking(Heap::kNoGCFlags, GarbageCollectionReason::kTask,
+namespace {
+size_t MinorMSConcurrentMarkingTrigger(Heap* heap) {
+  return heap->new_space()->TotalCapacity() *
+         v8_flags.minor_ms_concurrent_marking_trigger / 100;
+}
+}  // namespace
+
+void Heap::StartMinorMSIncrementalMarkingIfNeeded() {
+  DCHECK(!incremental_marking()->IsMarking());
+  if (v8_flags.concurrent_minor_ms_marking && !IsTearingDown() &&
+      !ShouldOptimizeForLoadTime() && incremental_marking()->CanBeStarted() &&
+      V8_LIKELY(!v8_flags.gc_global) &&
+      (new_space()->TotalCapacity() >=
+       v8_flags.minor_ms_min_new_space_capacity_for_concurrent_marking_mb *
+           MB) &&
+      new_space()->Size() >= MinorMSConcurrentMarkingTrigger(this)) {
+    StartIncrementalMarking(GCFlag::kNoFlags, GarbageCollectionReason::kTask,
                             kNoGCCallbackFlags,
-                            GarbageCollector::MINOR_MARK_COMPACTOR);
+                            GarbageCollector::MINOR_MARK_SWEEPER);
+    // Schedule a task for finalizing the GC if needed.
+    ScheduleMinorGCTaskIfNeeded();
   }
 }
 
-void Heap::CollectAllGarbage(int flags, GarbageCollectionReason gc_reason,
+void Heap::CollectAllGarbage(GCFlags gc_flags,
+                             GarbageCollectionReason gc_reason,
                              const v8::GCCallbackFlags gc_callback_flags) {
-  // Since we are ignoring the return value, the exact choice of space does
-  // not matter, so long as we do not specify NEW_SPACE, which would not
-  // cause a full GC.
-  set_current_gc_flags(flags);
+  current_gc_flags_ = gc_flags;
   CollectGarbage(OLD_SPACE, gc_reason, gc_callback_flags);
-  set_current_gc_flags(kNoGCFlags);
+  current_gc_flags_ = GCFlag::kNoFlags;
 }
 
 namespace {
 
-intptr_t CompareWords(int size, HeapObject a, HeapObject b) {
+intptr_t CompareWords(int size, Tagged<HeapObject> a, Tagged<HeapObject> b) {
   int slots = size / kTaggedSize;
-  DCHECK_EQ(a.Size(), size);
-  DCHECK_EQ(b.Size(), size);
+  DCHECK_EQ(a->Size(), size);
+  DCHECK_EQ(b->Size(), size);
   Tagged_t* slot_a = reinterpret_cast<Tagged_t*>(a.address());
   Tagged_t* slot_b = reinterpret_cast<Tagged_t*>(b.address());
   for (int i = 0; i < slots; i++) {
@@ -1499,14 +1537,15 @@ intptr_t CompareWords(int size, HeapObject a, HeapObject b) {
 void ReportDuplicates(int size, std::vector<HeapObject>* objects) {
   if (objects->size() == 0) return;
 
-  sort(objects->begin(), objects->end(), [size](HeapObject a, HeapObject b) {
-    intptr_t c = CompareWords(size, a, b);
-    if (c != 0) return c < 0;
-    return a < b;
-  });
+  sort(objects->begin(), objects->end(),
+       [size](Tagged<HeapObject> a, Tagged<HeapObject> b) {
+         intptr_t c = CompareWords(size, a, b);
+         if (c != 0) return c < 0;
+         return a < b;
+       });
 
   std::vector<std::pair<int, HeapObject>> duplicates;
-  HeapObject current = (*objects)[0];
+  Tagged<HeapObject> current = (*objects)[0];
   int count = 1;
   for (size_t i = 1; i < objects->size(); i++) {
     if (CompareWords(size, current, (*objects)[i]) == 0) {
@@ -1532,24 +1571,33 @@ void ReportDuplicates(int size, std::vector<HeapObject>* objects) {
     PrintF("%d duplicates of size %d each (%dKB)\n", it->first, size,
            duplicate_bytes / KB);
     PrintF("Sample object: ");
-    it->second.Print();
+    Print(it->second);
     PrintF("============================\n");
   }
 }
 }  // anonymous namespace
 
 void Heap::CollectAllAvailableGarbage(GarbageCollectionReason gc_reason) {
-  // Since we are ignoring the return value, the exact choice of space does
-  // not matter, so long as we do not specify NEW_SPACE, which would not
-  // cause a full GC.
-  // Major GC would invoke weak handle callbacks on weakly reachable
-  // handles, but won't collect weakly reachable objects until next
-  // major GC.  Therefore if we collect aggressively and weak handle callback
-  // has been invoked, we rerun major GC to release objects which become
-  // garbage.
-  // Note: as weak callbacks can execute arbitrary code, we cannot
-  // hope that eventually there will be no weak callbacks invocations.
-  // Therefore stop recollecting after several attempts.
+  // Min and max number of attempts for GC. The method will continue with more
+  // GCs until the root set is stable.
+  static constexpr int kMaxNumberOfAttempts = 7;
+  static constexpr int kMinNumberOfAttempts = 2;
+
+  // Returns the number of roots. We assume stack layout is stable but global
+  // roots could change between GCs due to finalizers and weak callbacks.
+  const auto num_roots = [this]() {
+    size_t js_roots = 0;
+    js_roots += isolate()->global_handles()->handles_count();
+    js_roots += isolate()->eternal_handles()->handles_count();
+    size_t cpp_roots = 0;
+    if (auto* cpp_heap = CppHeap::From(cpp_heap_)) {
+      cpp_roots += cpp_heap->GetStrongPersistentRegion().NodesInUse();
+      cpp_roots +=
+          cpp_heap->GetStrongCrossThreadPersistentRegion().NodesInUse();
+    }
+    return js_roots + cpp_roots;
+  };
+
   if (gc_reason == GarbageCollectionReason::kLastResort) {
     InvokeNearHeapLimitCallback();
   }
@@ -1560,20 +1608,20 @@ void Heap::CollectAllAvailableGarbage(GarbageCollectionReason gc_reason) {
   isolate()->ClearSerializerData();
   isolate()->compilation_cache()->Clear();
 
-  set_current_gc_flags(
-      kReduceMemoryFootprintMask |
-      (gc_reason == GarbageCollectionReason::kLowMemoryNotification ? kForcedGC
-                                                                    : 0));
-  constexpr int kMaxNumberOfAttempts = 7;
-  constexpr int kMinNumberOfAttempts = 2;
+  current_gc_flags_ =
+      GCFlag::kReduceMemoryFootprint |
+      (gc_reason == GarbageCollectionReason::kLowMemoryNotification
+           ? GCFlag::kForced
+           : GCFlag::kNoFlags);
   for (int attempt = 0; attempt < kMaxNumberOfAttempts; attempt++) {
+    const size_t roots_before = num_roots();
     CollectGarbage(OLD_SPACE, gc_reason, kNoGCCallbackFlags);
-    if ((isolate()->global_handles()->last_gc_custom_callbacks() == 0) &&
-        (attempt + 1 >= kMinNumberOfAttempts)) {
+    if ((roots_before == num_roots()) &&
+        ((attempt + 1) >= kMinNumberOfAttempts)) {
       break;
     }
   }
-  set_current_gc_flags(kNoGCFlags);
+  current_gc_flags_ = GCFlag::kNoFlags;
 
   EagerlyFreeExternalMemory();
 
@@ -1583,14 +1631,16 @@ void Heap::CollectAllAvailableGarbage(GarbageCollectionReason gc_reason) {
     for (PagedSpace* space = spaces.Next(); space != nullptr;
          space = spaces.Next()) {
       PagedSpaceObjectIterator it(this, space);
-      for (HeapObject obj = it.Next(); !obj.is_null(); obj = it.Next()) {
-        objects_by_size[obj.Size()].push_back(obj);
+      for (Tagged<HeapObject> obj = it.Next(); !obj.is_null();
+           obj = it.Next()) {
+        objects_by_size[obj->Size()].push_back(obj);
       }
     }
     {
       LargeObjectSpaceObjectIterator it(lo_space());
-      for (HeapObject obj = it.Next(); !obj.is_null(); obj = it.Next()) {
-        objects_by_size[obj.Size()].push_back(obj);
+      for (Tagged<HeapObject> obj = it.Next(); !obj.is_null();
+           obj = it.Next()) {
+        objects_by_size[obj->Size()].push_back(obj);
       }
     }
     for (auto it = objects_by_size.rbegin(); it != objects_by_size.rend();
@@ -1600,13 +1650,13 @@ void Heap::CollectAllAvailableGarbage(GarbageCollectionReason gc_reason) {
   }
 }
 
-void Heap::PreciseCollectAllGarbage(int flags,
+void Heap::PreciseCollectAllGarbage(GCFlags gc_flags,
                                     GarbageCollectionReason gc_reason,
                                     const GCCallbackFlags gc_callback_flags) {
   if (!incremental_marking()->IsStopped()) {
     FinalizeIncrementalMarkingAtomically(gc_reason);
   }
-  CollectAllGarbage(flags, gc_reason, gc_callback_flags);
+  CollectAllGarbage(gc_flags, gc_reason, gc_callback_flags);
 }
 
 void Heap::ReportExternalMemoryPressure() {
@@ -1623,7 +1673,7 @@ void Heap::ReportExternalMemoryPressure() {
       static_cast<int>((limit - baseline) / MB));
   if (current > baseline + external_memory_hard_limit()) {
     CollectAllGarbage(
-        kReduceMemoryFootprintMask,
+        GCFlag::kReduceMemoryFootprint,
         GarbageCollectionReason::kExternalMemoryPressure,
         static_cast<GCCallbackFlags>(kGCCallbackFlagCollectAllAvailableGarbage |
                                      kGCCallbackFlagsForExternalMemory));
@@ -1635,7 +1685,7 @@ void Heap::ReportExternalMemoryPressure() {
                               GarbageCollectionReason::kExternalMemoryPressure,
                               kGCCallbackFlagsForExternalMemory);
     } else {
-      CollectAllGarbage(i::Heap::kNoGCFlags,
+      CollectAllGarbage(i::GCFlag::kNoFlags,
                         GarbageCollectionReason::kExternalMemoryPressure,
                         kGCCallbackFlagsForExternalMemory);
     }
@@ -1666,8 +1716,8 @@ namespace {
 
 template <typename Callback>
 void InvokeExternalCallbacks(Isolate* isolate, Callback callback) {
+  DCHECK(!AllowJavascriptExecution::IsAllowed(isolate));
   AllowGarbageCollection allow_gc;
-  AllowJavascriptExecution allow_js(isolate);
   // Temporary override any embedder stack state as callbacks may create
   // their own state on the stack and recursively trigger GC.
   EmbedderStackStateScope embedder_scope(
@@ -1678,7 +1728,37 @@ void InvokeExternalCallbacks(Isolate* isolate, Callback callback) {
   callback();
 }
 
-}  // namespace
+size_t GlobalMemorySizeFromV8Size(size_t v8_size) {
+  const size_t kGlobalMemoryToV8Ratio = 2;
+  return std::min(static_cast<uint64_t>(std::numeric_limits<size_t>::max()),
+                  static_cast<uint64_t>(v8_size) * kGlobalMemoryToV8Ratio);
+}
+
+}  // anonymous namespace
+
+void Heap::SetOldGenerationAndGlobalMaximumSize(
+    size_t max_old_generation_size) {
+  max_old_generation_size_.store(max_old_generation_size,
+                                 std::memory_order_relaxed);
+  max_global_memory_size_ = GlobalMemorySizeFromV8Size(max_old_generation_size);
+}
+
+void Heap::SetOldGenerationAndGlobalAllocationLimit(
+    size_t new_old_generation_allocation_limit,
+    size_t new_global_allocation_limit) {
+  CHECK_GE(new_global_allocation_limit, new_old_generation_allocation_limit);
+  old_generation_allocation_limit_.store(new_old_generation_allocation_limit,
+                                         std::memory_order_relaxed);
+  global_allocation_limit_ = new_global_allocation_limit;
+  old_generation_allocation_limit_configured_ = true;
+}
+
+void Heap::ResetOldGenerationAndGlobalAllocationLimit() {
+  SetOldGenerationAndGlobalAllocationLimit(
+      initial_old_generation_size_,
+      GlobalMemorySizeFromV8Size(initial_old_generation_size_));
+  old_generation_allocation_limit_configured_ = false;
+}
 
 void Heap::CollectGarbage(AllocationSpace space,
                           GarbageCollectionReason gc_reason,
@@ -1703,6 +1783,9 @@ void Heap::CollectGarbage(AllocationSpace space,
   // collection is triggered. Note that these callbacks may trigger another
   // garbage collection since they may allocate.
 
+  // JS execution is not allowed in any of the callbacks.
+  DisallowJavascriptExecution no_js(isolate());
+
   DCHECK(AllowGarbageCollection::IsAllowed());
 
   const char* collector_reason = nullptr;
@@ -1712,7 +1795,8 @@ void Heap::CollectGarbage(AllocationSpace space,
 
   if (collector == GarbageCollector::MARK_COMPACTOR &&
       incremental_marking()->IsMinorMarking()) {
-    CollectGarbage(NEW_SPACE, GarbageCollectionReason::kFinalizeMinorMC);
+    CollectGarbage(NEW_SPACE,
+                   GarbageCollectionReason::kFinalizeConcurrentMinorMS);
   }
 
   const GCType gc_type = GetGCTypeFromGarbageCollector(collector);
@@ -1731,33 +1815,32 @@ void Heap::CollectGarbage(AllocationSpace space,
   });
 
   // The main garbage collection phase.
-  DisallowGarbageCollection no_gc_during_gc;
-
-  if (force_shared_gc_with_empty_stack_for_testing_) {
-    embedder_stack_state_ = StackState::kNoHeapPointers;
-  }
-
-  size_t committed_memory_before = collector == GarbageCollector::MARK_COMPACTOR
-                                       ? CommittedOldGenerationMemory()
-                                       : 0;
-  {
-    tracer()->StartObservablePause();
+  //
+  // We need a stack marker at the top of all entry points to allow
+  // deterministic passes over the stack. E.g., a verifier that should only
+  // find a subset of references of the marker.
+  //
+  // TODO(chromium:1056170): Consider adding a component that keeps track
+  // of relevant GC stack regions where interesting pointers can be found.
+  stack().SetMarkerIfNeededAndCallback([this, collector, gc_reason,
+                                        collector_reason, gc_callback_flags]() {
+    DisallowGarbageCollection no_gc_during_gc;
+
+    size_t committed_memory_before =
+        collector == GarbageCollector::MARK_COMPACTOR
+            ? CommittedOldGenerationMemory()
+            : 0;
+
+    tracer()->StartObservablePause(base::TimeTicks::Now());
     VMState<GC> state(isolate());
     DevToolsTraceEventScope devtools_trace_event_scope(
         this, IsYoungGenerationCollector(collector) ? "MinorGC" : "MajorGC",
-        GarbageCollectionReasonToString(gc_reason));
-
-    // We need a stack marker at the top of all entry points to allow
-    // deterministic passes over the stack. E.g., a verifier that should only
-    // find a subset of references of the marker.
-    //
-    // TODO(chromium:1056170): Consider adding a component that keeps track
-    // of relevant GC stack regions where interesting pointers can be found.
-    stack().SetMarkerToCurrentStackPosition();
+        ToString(gc_reason));
 
     GarbageCollectionPrologue(gc_reason, gc_callback_flags);
     {
-      GCTracer::RecordGCPhasesInfo record_gc_phases_info(this, collector);
+      GCTracer::RecordGCPhasesInfo record_gc_phases_info(this, collector,
+                                                         gc_reason);
       base::Optional<TimedHistogramScope> histogram_timer_scope;
       base::Optional<OptionalTimedHistogramScope>
           histogram_timer_priority_scope;
@@ -1767,12 +1850,9 @@ void Heap::CollectGarbage(AllocationSpace space,
                                       isolate_);
       }
       if (record_gc_phases_info.type_priority_timer()) {
-        OptionalTimedHistogramScopeMode mode =
-            isolate_->IsMemorySavingsModeActive()
-                ? OptionalTimedHistogramScopeMode::DONT_TAKE_TIME
-                : OptionalTimedHistogramScopeMode::TAKE_TIME;
         histogram_timer_priority_scope.emplace(
-            record_gc_phases_info.type_priority_timer(), isolate_, mode);
+            record_gc_phases_info.type_priority_timer(), isolate_,
+            OptionalTimedHistogramScopeMode::TAKE_TIME);
       }
 
       if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
@@ -1805,15 +1885,14 @@ void Heap::CollectGarbage(AllocationSpace space,
       if (initial_max_old_generation_size_ < max_old_generation_size() &&
           OldGenerationSizeOfObjects() <
               initial_max_old_generation_size_threshold_) {
-        set_max_old_generation_size(initial_max_old_generation_size_);
+        SetOldGenerationAndGlobalMaximumSize(initial_max_old_generation_size_);
       }
     }
 
     tracer()->StopAtomicPause();
-    tracer()->StopObservablePause();
-    tracer()->UpdateStatistics(collector);
+    tracer()->StopObservablePause(collector, base::TimeTicks::Now());
     // Young generation cycles finish atomically. It is important that
-    // StopObservablePause, UpdateStatistics and StopCycle are called in this
+    // StopObservablePause, and StopCycle are called in this
     // order; the latter may replace the current event with that of an
     // interrupted full cycle.
     if (IsYoungGenerationCollector(collector)) {
@@ -1821,7 +1900,7 @@ void Heap::CollectGarbage(AllocationSpace space,
     } else {
       tracer()->StopFullCycleIfNeeded();
     }
-  }
+  });
 
   // Epilogue callbacks. These callbacks may trigger GC themselves and thus
   // cannot be related exactly to garbage collection cycles.
@@ -1845,7 +1924,7 @@ void Heap::CollectGarbage(AllocationSpace space,
   // Start incremental marking for the next cycle. We do this only for scavenger
   // to avoid a loop where mark-compact causes another mark-compact.
   if (collector == GarbageCollector::SCAVENGER) {
-    DCHECK(!v8_flags.minor_mc);
+    DCHECK(!v8_flags.minor_ms);
     StartIncrementalMarkingIfAllocationLimitIsReached(
         GCFlagsForIncrementalMarking(),
         kGCCallbackScheduleIdleGarbageCollection);
@@ -1859,25 +1938,24 @@ void Heap::CollectGarbage(AllocationSpace space,
   }
 }
 
-int Heap::NotifyContextDisposed(bool dependant_context) {
-  if (!dependant_context) {
+int Heap::NotifyContextDisposed(bool has_dependent_context) {
+  if (!has_dependent_context) {
     tracer()->ResetSurvivalEvents();
-    old_generation_size_configured_ = false;
-    set_old_generation_allocation_limit(initial_old_generation_size_);
-    if (memory_reducer_ != nullptr) {
+    ResetOldGenerationAndGlobalAllocationLimit();
+    if (memory_reducer_) {
       memory_reducer_->NotifyPossibleGarbage();
     }
   }
   isolate()->AbortConcurrentOptimization(BlockingBehavior::kDontBlock);
   if (!isolate()->context().is_null()) {
     RemoveDirtyFinalizationRegistriesOnContext(isolate()->raw_native_context());
-    isolate()->raw_native_context().set_retained_maps(
+    isolate()->raw_native_context()->set_retained_maps(
         ReadOnlyRoots(this).empty_weak_array_list());
   }
   return ++contexts_disposed_;
 }
 
-void Heap::StartIncrementalMarking(int gc_flags,
+void Heap::StartIncrementalMarking(GCFlags gc_flags,
                                    GarbageCollectionReason gc_reason,
                                    GCCallbackFlags gc_callback_flags,
                                    GarbageCollector collector) {
@@ -1886,10 +1964,7 @@ void Heap::StartIncrementalMarking(int gc_flags,
   // Delay incremental marking start while concurrent sweeping still has work.
   // This helps avoid large CompleteSweep blocks on the main thread when major
   // incremental marking should be scheduled following a minor GC.
-  if (sweeper()->AreSweeperTasksRunning() &&
-      (!sweeper()->IsSweepingDoneForSpace(NEW_SPACE) ||
-       sweeper()->IsIteratingPromotedPages()))
-    return;
+  if (sweeper()->AreMinorSweeperTasksRunning()) return;
 
   if (IsYoungGenerationCollector(collector)) {
     CompleteSweepingYoung();
@@ -1903,8 +1978,6 @@ void Heap::StartIncrementalMarking(int gc_flags,
 
   {
     AllowGarbageCollection allow_shared_gc;
-    IgnoreLocalGCRequests ignore_gc_requests(this);
-
     SafepointKind safepoint_kind = isolate()->is_shared_space_isolate()
                                        ? SafepointKind::kGlobal
                                        : SafepointKind::kIsolate;
@@ -1915,30 +1988,38 @@ void Heap::StartIncrementalMarking(int gc_flags,
   VerifyCountersAfterSweeping();
 #endif
 
+  std::vector<Isolate*> paused_clients;
+
   if (isolate()->is_shared_space_isolate()) {
-    isolate()->global_safepoint()->IterateClientIsolates([](Isolate* client) {
-      if (v8_flags.concurrent_marking) {
-        client->heap()->concurrent_marking()->Pause();
-      }
-    });
+    isolate()->global_safepoint()->IterateClientIsolates(
+        [collector, &paused_clients](Isolate* client) {
+          if (v8_flags.concurrent_marking &&
+              client->heap()->concurrent_marking()->Pause()) {
+            paused_clients.push_back(client);
+          }
+
+          if (collector == GarbageCollector::MARK_COMPACTOR) {
+            Sweeper* const client_sweeper = client->heap()->sweeper();
+            client_sweeper->ContributeAndWaitForPromotedPagesIteration();
+          }
+        });
   }
 
   // Now that sweeping is completed, we can start the next full GC cycle.
   tracer()->StartCycle(collector, gc_reason, nullptr,
                        GCTracer::MarkingType::kIncremental);
 
-  set_current_gc_flags(gc_flags);
+  current_gc_flags_ = gc_flags;
   current_gc_callback_flags_ = gc_callback_flags;
 
   incremental_marking()->Start(collector, gc_reason);
 
   if (isolate()->is_shared_space_isolate()) {
-    isolate()->global_safepoint()->IterateClientIsolates([](Isolate* client) {
-      if (v8_flags.concurrent_marking &&
-          client->heap()->incremental_marking()->IsMarking()) {
-        client->heap()->concurrent_marking()->Resume();
-      }
-    });
+    for (Isolate* client : paused_clients) {
+      client->heap()->concurrent_marking()->Resume();
+    }
+  } else {
+    DCHECK(paused_clients.empty());
   }
 }
 
@@ -1950,8 +2031,8 @@ void CompleteArrayBufferSweeping(Heap* heap) {
     GCTracer::Scope::ScopeId scope_id;
 
     switch (tracer->GetCurrentCollector()) {
-      case GarbageCollector::MINOR_MARK_COMPACTOR:
-        scope_id = GCTracer::Scope::MINOR_MC_COMPLETE_SWEEP_ARRAY_BUFFERS;
+      case GarbageCollector::MINOR_MARK_SWEEPER:
+        scope_id = GCTracer::Scope::MINOR_MS_COMPLETE_SWEEP_ARRAY_BUFFERS;
         break;
       case GarbageCollector::SCAVENGER:
         scope_id = GCTracer::Scope::SCAVENGER_COMPLETE_SWEEP_ARRAY_BUFFERS;
@@ -1960,7 +2041,10 @@ void CompleteArrayBufferSweeping(Heap* heap) {
         scope_id = GCTracer::Scope::MC_COMPLETE_SWEEP_ARRAY_BUFFERS;
     }
 
-    TRACE_GC_EPOCH(tracer, scope_id, ThreadKind::kMain);
+    TRACE_GC_EPOCH_WITH_FLOW(
+        tracer, scope_id, ThreadKind::kMain,
+        array_buffer_sweeper->GetTraceIdForFlowEvent(scope_id),
+        TRACE_EVENT_FLAG_FLOW_IN);
     array_buffer_sweeper->EnsureFinished();
   }
 }
@@ -1975,8 +2059,13 @@ void Heap::CompleteSweepingFull() {
   DCHECK(!tracer()->IsSweepingInProgress());
 }
 
+void Heap::StartIncrementalMarkingOnInterrupt() {
+  StartIncrementalMarkingIfAllocationLimitIsReached(
+      GCFlagsForIncrementalMarking(), kGCCallbackScheduleIdleGarbageCollection);
+}
+
 void Heap::StartIncrementalMarkingIfAllocationLimitIsReached(
-    int gc_flags, const GCCallbackFlags gc_callback_flags) {
+    GCFlags gc_flags, const GCCallbackFlags gc_callback_flags) {
   if (v8_flags.separate_gc_phases && gc_callbacks_depth_ > 0) {
     // Do not start incremental marking while invoking GC callbacks.
     // Heap::CollectGarbage already decided which GC is going to be invoked. In
@@ -1989,13 +2078,15 @@ void Heap::StartIncrementalMarkingIfAllocationLimitIsReached(
       case IncrementalMarkingLimit::kHardLimit:
         StartIncrementalMarking(
             gc_flags,
-            OldGenerationSpaceAvailable() <= NewSpaceCapacity()
+            OldGenerationSpaceAvailable() <= NewSpaceTargetCapacity()
                 ? GarbageCollectionReason::kAllocationLimit
                 : GarbageCollectionReason::kGlobalAllocationLimit,
             gc_callback_flags);
         break;
       case IncrementalMarkingLimit::kSoftLimit:
-        incremental_marking()->incremental_marking_job()->ScheduleTask();
+        if (auto* job = incremental_marking()->incremental_marking_job()) {
+          job->ScheduleTask();
+        }
         break;
       case IncrementalMarkingLimit::kFallbackForEmbedderLimit:
         // This is a fallback case where no appropriate limits have been
@@ -2011,6 +2102,8 @@ void Heap::StartIncrementalMarkingIfAllocationLimitIsReached(
 }
 
 void Heap::StartIncrementalMarkingIfAllocationLimitIsReachedBackground() {
+  // TODO(v8:13012): Consider finalizing minor incremental marking when we need
+  // to start a full GC.
   if (incremental_marking()->IsMarking() ||
       !incremental_marking()->CanBeStarted()) {
     return;
@@ -2018,23 +2111,32 @@ void Heap::StartIncrementalMarkingIfAllocationLimitIsReachedBackground() {
 
   const size_t old_generation_space_available = OldGenerationSpaceAvailable();
 
-  if (old_generation_space_available < NewSpaceCapacity()) {
-    incremental_marking()->incremental_marking_job()->ScheduleTask();
+  if (old_generation_space_available < NewSpaceTargetCapacity()) {
+    if (auto* job = incremental_marking()->incremental_marking_job()) {
+      job->ScheduleTask();
+    }
+    if (old_generation_space_available == 0) {
+      // Fulfil the role of IncrementalMarkingLimitReached() == kHardLimit and
+      // try to start incremental marking ASAP.
+      // TODO(dinfuehr): Unify this logic with the main thread
+      // IncrementalMarkingLimitReached() call.
+      isolate()->stack_guard()->RequestStartIncrementalMarking();
+    }
   }
 }
 
-void Heap::MoveRange(HeapObject dst_object, const ObjectSlot dst_slot,
+void Heap::MoveRange(Tagged<HeapObject> dst_object, const ObjectSlot dst_slot,
                      const ObjectSlot src_slot, int len,
                      WriteBarrierMode mode) {
   DCHECK_NE(len, 0);
-  DCHECK_NE(dst_object.map(), ReadOnlyRoots(this).fixed_cow_array_map());
+  DCHECK_NE(dst_object->map(), ReadOnlyRoots(this).fixed_cow_array_map());
   const ObjectSlot dst_end(dst_slot + len);
   // Ensure no range overflow.
   DCHECK(dst_slot < dst_end);
   DCHECK(src_slot < src_slot + len);
 
   if ((v8_flags.concurrent_marking && incremental_marking()->IsMarking()) ||
-      (v8_flags.minor_mc && sweeper()->IsIteratingPromotedPages())) {
+      (v8_flags.minor_ms && sweeper()->IsIteratingPromotedPages())) {
     if (dst_slot < src_slot) {
       // Copy tagged values forward using relaxed load/stores that do not
       // involve value decompression.
@@ -2066,27 +2168,27 @@ void Heap::MoveRange(HeapObject dst_object, const ObjectSlot dst_slot,
 }
 
 // Instantiate Heap::CopyRange() for ObjectSlot and MaybeObjectSlot.
-template void Heap::CopyRange<ObjectSlot>(HeapObject dst_object,
+template void Heap::CopyRange<ObjectSlot>(Tagged<HeapObject> dst_object,
                                           ObjectSlot dst_slot,
                                           ObjectSlot src_slot, int len,
                                           WriteBarrierMode mode);
-template void Heap::CopyRange<MaybeObjectSlot>(HeapObject dst_object,
+template void Heap::CopyRange<MaybeObjectSlot>(Tagged<HeapObject> dst_object,
                                                MaybeObjectSlot dst_slot,
                                                MaybeObjectSlot src_slot,
                                                int len, WriteBarrierMode mode);
 
 template <typename TSlot>
-void Heap::CopyRange(HeapObject dst_object, const TSlot dst_slot,
+void Heap::CopyRange(Tagged<HeapObject> dst_object, const TSlot dst_slot,
                      const TSlot src_slot, int len, WriteBarrierMode mode) {
   DCHECK_NE(len, 0);
 
-  DCHECK_NE(dst_object.map(), ReadOnlyRoots(this).fixed_cow_array_map());
+  DCHECK_NE(dst_object->map(), ReadOnlyRoots(this).fixed_cow_array_map());
   const TSlot dst_end(dst_slot + len);
   // Ensure ranges do not overlap.
   DCHECK(dst_end <= src_slot || (src_slot + len) <= dst_slot);
 
   if ((v8_flags.concurrent_marking && incremental_marking()->IsMarking()) ||
-      (v8_flags.minor_mc && sweeper()->IsIteratingPromotedPages())) {
+      (v8_flags.minor_ms && sweeper()->IsIteratingPromotedPages())) {
     // Copy tagged values using relaxed load/stores that do not involve value
     // decompression.
     const AtomicSlot atomic_dst_end(dst_end);
@@ -2176,8 +2278,8 @@ GCTracer::Scope::ScopeId CollectorScopeId(GarbageCollector collector) {
   switch (collector) {
     case GarbageCollector::MARK_COMPACTOR:
       return GCTracer::Scope::ScopeId::MARK_COMPACTOR;
-    case GarbageCollector::MINOR_MARK_COMPACTOR:
-      return GCTracer::Scope::ScopeId::MINOR_MARK_COMPACTOR;
+    case GarbageCollector::MINOR_MARK_SWEEPER:
+      return GCTracer::Scope::ScopeId::MINOR_MARK_SWEEPER;
     case GarbageCollector::SCAVENGER:
       return GCTracer::Scope::ScopeId::SCAVENGER;
   }
@@ -2201,8 +2303,6 @@ void ClearStubCaches(Isolate* isolate) {
 void Heap::PerformGarbageCollection(GarbageCollector collector,
                                     GarbageCollectionReason gc_reason,
                                     const char* collector_reason) {
-  DisallowJavascriptExecution no_js(isolate());
-
   if (IsYoungGenerationCollector(collector)) {
     CompleteSweepingYoung();
     if (v8_flags.verify_heap) {
@@ -2222,7 +2322,6 @@ void Heap::PerformGarbageCollection(GarbageCollector collector,
   base::Optional<SafepointScope> safepoint_scope;
   {
     AllowGarbageCollection allow_shared_gc;
-    IgnoreLocalGCRequests ignore_gc_requests(this);
 
     SafepointKind safepoint_kind = isolate()->is_shared_space_isolate()
                                        ? SafepointKind::kGlobal
@@ -2237,8 +2336,10 @@ void Heap::PerformGarbageCollection(GarbageCollector collector,
   }
 
   tracer()->StartAtomicPause();
-  if (!Heap::IsYoungGenerationCollector(collector) &&
+  if ((!Heap::IsYoungGenerationCollector(collector) || v8_flags.minor_ms) &&
       incremental_marking_->IsMarking()) {
+    DCHECK_IMPLIES(Heap::IsYoungGenerationCollector(collector),
+                   incremental_marking_->IsMinorMarking());
     tracer()->UpdateCurrentEvent(gc_reason, collector_reason);
   }
 
@@ -2249,13 +2350,16 @@ void Heap::PerformGarbageCollection(GarbageCollector collector,
 
   HeapVerifier::VerifyHeapIfEnabled(this);
 
+  std::vector<Isolate*> paused_clients;
+
   if (isolate()->is_shared_space_isolate()) {
     isolate()->global_safepoint()->IterateClientIsolates(
-        [collector](Isolate* client) {
+        [collector, &paused_clients](Isolate* client) {
           CHECK(client->heap()->deserialization_complete());
 
-          if (v8_flags.concurrent_marking) {
-            client->heap()->concurrent_marking()->Pause();
+          if (v8_flags.concurrent_marking &&
+              client->heap()->concurrent_marking()->Pause()) {
+            paused_clients.push_back(client);
           }
 
           if (collector == GarbageCollector::MARK_COMPACTOR) {
@@ -2279,19 +2383,21 @@ void Heap::PerformGarbageCollection(GarbageCollector collector,
   // capacity is set in the epilogue.
   PauseAllocationObserversScope pause_observers(this);
 
+  size_t new_space_capacity_before_gc = NewSpaceTargetCapacity();
+
   if (collector == GarbageCollector::MARK_COMPACTOR) {
     MarkCompact();
-  } else if (collector == GarbageCollector::MINOR_MARK_COMPACTOR) {
-    MinorMarkCompact();
+  } else if (collector == GarbageCollector::MINOR_MARK_SWEEPER) {
+    MinorMarkSweep();
   } else {
     DCHECK_EQ(GarbageCollector::SCAVENGER, collector);
     Scavenge();
   }
 
-  pretenuring_handler_.ProcessPretenuringFeedback();
+  pretenuring_handler_.ProcessPretenuringFeedback(new_space_capacity_before_gc);
 
   UpdateSurvivalStatistics(static_cast<int>(start_young_generation_size));
-  ConfigureInitialOldGenerationSize();
+  ShrinkOldGenerationAllocationLimitIfNotConfigured();
 
   if (collector == GarbageCollector::SCAVENGER) {
     // Objects that died in the new space might have been accounted
@@ -2307,27 +2413,36 @@ void Heap::PerformGarbageCollection(GarbageCollector collector,
   // Update relocatables.
   Relocatable::PostGarbageCollectionProcessing(isolate_);
 
+  if (isolate_->is_shared_space_isolate()) {
+    // Allows handle derefs for all threads/isolates from this thread.
+    AllowHandleDereferenceAllThreads allow_all_handle_derefs;
+    isolate()->global_safepoint()->IterateClientIsolates([](Isolate* client) {
+      Relocatable::PostGarbageCollectionProcessing(client);
+    });
+  }
+
   // First round weak callbacks are not supposed to allocate and trigger
   // nested GCs.
   isolate_->global_handles()->InvokeFirstPassWeakCallbacks();
 
   if (cpp_heap() && (collector == GarbageCollector::MARK_COMPACTOR ||
-                     collector == GarbageCollector::MINOR_MARK_COMPACTOR)) {
+                     collector == GarbageCollector::MINOR_MARK_SWEEPER)) {
     // TraceEpilogue may trigger operations that invalidate global handles. It
     // has to be called *after* all other operations that potentially touch
     // and reset global handles. It is also still part of the main garbage
     // collection pause and thus needs to be called *before* any operation
-    // that can potentially trigger recursive garbage
+    // that can potentially trigger recursive garbage collections.
     TRACE_GC(tracer(), GCTracer::Scope::HEAP_EMBEDDER_TRACING_EPILOGUE);
-    // Resetting to state unknown as there may be follow up garbage
-    // collections triggered from callbacks that have a different stack state.
-    embedder_stack_state_ = cppgc::EmbedderStackState::kMayContainHeapPointers;
     CppHeap::From(cpp_heap())->TraceEpilogue();
   }
 
   RecomputeLimits(collector);
 
   if (collector == GarbageCollector::MARK_COMPACTOR) {
+    // After every full GC the old generation allocation limit should be
+    // configured.
+    DCHECK(old_generation_allocation_limit_configured_);
+
     ClearStubCaches(isolate());
   }
 
@@ -2340,12 +2455,13 @@ void Heap::PerformGarbageCollection(GarbageCollector collector,
   if (isolate()->is_shared_space_isolate()) {
     isolate()->global_safepoint()->IterateClientIsolates([](Isolate* client) {
       HeapVerifier::VerifyHeapIfEnabled(client->heap());
-
-      if (v8_flags.concurrent_marking &&
-          client->heap()->incremental_marking()->IsMarking()) {
-        client->heap()->concurrent_marking()->Resume();
-      }
     });
+
+    for (Isolate* client : paused_clients) {
+      client->heap()->concurrent_marking()->Resume();
+    }
+  } else {
+    DCHECK(paused_clients.empty());
   }
 }
 
@@ -2392,8 +2508,8 @@ void Heap::CompleteSweepingYoung() {
   // generation GC.
   FinishSweepingIfOutOfWork();
 
-  if (v8_flags.minor_mc && sweeping_in_progress()) {
-    PauseSweepingAndEnsureYoungSweepingCompleted();
+  if (v8_flags.minor_ms) {
+    EnsureYoungSweepingCompleted();
   }
 
 #if defined(CPPGC_YOUNG_GENERATION)
@@ -2406,7 +2522,7 @@ void Heap::CompleteSweepingYoung() {
 #endif  // defined(CPPGC_YOUNG_GENERATION)
 }
 
-void Heap::EnsureSweepingCompletedForObject(HeapObject object) {
+void Heap::EnsureSweepingCompletedForObject(Tagged<HeapObject> object) {
   if (!sweeping_in_progress()) return;
 
   BasicMemoryChunk* basic_chunk = BasicMemoryChunk::FromHeapObject(object);
@@ -2425,7 +2541,7 @@ void Heap::EnsureSweepingCompletedForObject(HeapObject object) {
 void Heap::RecomputeLimits(GarbageCollector collector) {
   if (!((collector == GarbageCollector::MARK_COMPACTOR) ||
         (HasLowYoungGenerationAllocationRate() &&
-         old_generation_size_configured_))) {
+         old_generation_allocation_limit_configured_))) {
     return;
   }
 
@@ -2448,44 +2564,56 @@ void Heap::RecomputeLimits(GarbageCollector collector) {
   global_growing_factor = std::max(v8_growing_factor, embedder_growing_factor);
 
   size_t old_gen_size = OldGenerationSizeOfObjects();
-  size_t new_space_capacity = NewSpaceCapacity();
+  size_t new_space_capacity = NewSpaceTargetCapacity();
   HeapGrowingMode mode = CurrentHeapGrowingMode();
 
   if (collector == GarbageCollector::MARK_COMPACTOR) {
     external_memory_.ResetAfterGC();
 
-    set_old_generation_allocation_limit(
+    size_t new_old_generation_allocation_limit =
         MemoryController<V8HeapTrait>::CalculateAllocationLimit(
             this, old_gen_size, min_old_generation_size_,
             max_old_generation_size(), new_space_capacity, v8_growing_factor,
-            mode));
+            mode);
     DCHECK_GT(global_growing_factor, 0);
-    global_allocation_limit_ =
+    size_t new_global_allocation_limit =
         MemoryController<GlobalMemoryTrait>::CalculateAllocationLimit(
             this, GlobalSizeOfObjects(), min_global_memory_size_,
             max_global_memory_size_, new_space_capacity, global_growing_factor,
             mode);
+    SetOldGenerationAndGlobalAllocationLimit(
+        new_old_generation_allocation_limit, new_global_allocation_limit);
     CheckIneffectiveMarkCompact(
         old_gen_size, tracer()->AverageMarkCompactMutatorUtilization());
   } else if (HasLowYoungGenerationAllocationRate() &&
-             old_generation_size_configured_) {
-    size_t new_old_generation_limit =
+             old_generation_allocation_limit_configured_) {
+    size_t new_old_generation_allocation_limit =
         MemoryController<V8HeapTrait>::CalculateAllocationLimit(
             this, old_gen_size, min_old_generation_size_,
             max_old_generation_size(), new_space_capacity, v8_growing_factor,
             mode);
-    if (new_old_generation_limit < old_generation_allocation_limit()) {
-      set_old_generation_allocation_limit(new_old_generation_limit);
-    }
+    new_old_generation_allocation_limit = std::min(
+        new_old_generation_allocation_limit, old_generation_allocation_limit());
     DCHECK_GT(global_growing_factor, 0);
-    size_t new_global_limit =
+    size_t new_global_allocation_limit =
         MemoryController<GlobalMemoryTrait>::CalculateAllocationLimit(
             this, GlobalSizeOfObjects(), min_global_memory_size_,
             max_global_memory_size_, new_space_capacity, global_growing_factor,
             mode);
-    if (new_global_limit < global_allocation_limit_) {
-      global_allocation_limit_ = new_global_limit;
-    }
+    new_global_allocation_limit =
+        std::min(new_global_allocation_limit, global_allocation_limit_);
+    SetOldGenerationAndGlobalAllocationLimit(
+        new_old_generation_allocation_limit, new_global_allocation_limit);
+  }
+
+  CHECK_EQ(max_global_memory_size_,
+           GlobalMemorySizeFromV8Size(max_old_generation_size_));
+  CHECK_GE(global_allocation_limit_, old_generation_allocation_limit_);
+
+  if (v8_flags.memory_balancer) {
+    mb_->UpdateExternalAllocationLimit(global_allocation_limit_ -
+                                       old_generation_allocation_limit_);
+    mb_->NotifyGC();
   }
 }
 
@@ -2519,7 +2647,8 @@ void Heap::MarkCompact() {
   SetGCState(MARK_COMPACT);
 
   PROFILE(isolate_, CodeMovingGCEvent());
-  CodeSpaceMemoryModificationScope code_modification(this);
+  CodePageHeaderModificationScope code_modification(
+      "MarkCompact needs to access the marking bitmap in the page header");
 
   UpdateOldGenerationAllocationCounter();
   uint64_t size_of_objects_before_gc = SizeOfObjects();
@@ -2538,7 +2667,6 @@ void Heap::MarkCompact() {
   if (v8_flags.allocation_site_pretenuring) {
     EvaluateOldSpaceLocalPretenuring(size_of_objects_before_gc);
   }
-  old_generation_size_configured_ = true;
   // This should be updated before PostGarbageCollectionProcessing, which
   // can cause another GC. Take into account the objects promoted during
   // GC.
@@ -2548,18 +2676,18 @@ void Heap::MarkCompact() {
   global_memory_at_last_gc_ = GlobalSizeOfObjects();
 }
 
-void Heap::MinorMarkCompact() {
-  DCHECK(v8_flags.minor_mc);
+void Heap::MinorMarkSweep() {
+  DCHECK(v8_flags.minor_ms);
   CHECK_EQ(NOT_IN_GC, gc_state());
   DCHECK(new_space());
   DCHECK(!incremental_marking()->IsMajorMarking());
 
-  TRACE_GC(tracer(), GCTracer::Scope::MINOR_MC);
+  TRACE_GC(tracer(), GCTracer::Scope::MINOR_MS);
 
   AlwaysAllocateScope always_allocate(this);
 
-  SetGCState(MINOR_MARK_COMPACT);
-  minor_mark_compact_collector_->CollectGarbage();
+  SetGCState(MINOR_MARK_SWEEP);
+  minor_mark_sweep_collector_->CollectGarbage();
   SetGCState(NOT_IN_GC);
 }
 
@@ -2625,43 +2753,7 @@ void Heap::Scavenge() {
   SetGCState(NOT_IN_GC);
 }
 
-void Heap::UnprotectAndRegisterMemoryChunk(MemoryChunk* chunk,
-                                           UnprotectMemoryOrigin origin) {
-  if (!write_protect_code_memory()) return;
-
-  // No need to register any unprotected chunks during a GC. This also avoids
-  // the use of CurrentLocalHeap() on GC workers, which don't have a LocalHeap.
-  if (code_space_memory_modification_scope_depth_ > 0) return;
-
-  LocalHeap* local_heap = isolate()->CurrentLocalHeap();
-  DCHECK_GT(local_heap->code_page_collection_memory_modification_scope_depth_,
-            0);
-  if (local_heap->unprotected_memory_chunks_.insert(chunk).second) {
-    chunk->SetCodeModificationPermissions();
-  }
-}
-
-void Heap::UnregisterUnprotectedMemoryChunk(MemoryChunk* chunk) {
-  safepoint()->IterateLocalHeaps([chunk](LocalHeap* local_heap) {
-    local_heap->unprotected_memory_chunks_.erase(chunk);
-  });
-}
-
-void Heap::UnprotectAndRegisterMemoryChunk(HeapObject object,
-                                           UnprotectMemoryOrigin origin) {
-  UnprotectAndRegisterMemoryChunk(MemoryChunk::FromHeapObject(object), origin);
-}
-
-void Heap::ProtectUnprotectedMemoryChunks() {
-  LocalHeap* local_heap = isolate()->CurrentLocalHeap();
-  for (MemoryChunk* chunk : local_heap->unprotected_memory_chunks_) {
-    DCHECK(memory_allocator()->IsMemoryChunkExecutable(chunk));
-    chunk->SetDefaultCodePermissions();
-  }
-  local_heap->unprotected_memory_chunks_.clear();
-}
-
-bool Heap::ExternalStringTable::Contains(String string) {
+bool Heap::ExternalStringTable::Contains(Tagged<String> string) {
   for (size_t i = 0; i < young_strings_.size(); ++i) {
     if (young_strings_[i] == string) return true;
   }
@@ -2671,9 +2763,9 @@ bool Heap::ExternalStringTable::Contains(String string) {
   return false;
 }
 
-void Heap::UpdateExternalString(String string, size_t old_payload,
+void Heap::UpdateExternalString(Tagged<String> string, size_t old_payload,
                                 size_t new_payload) {
-  DCHECK(string.IsExternalString());
+  DCHECK(IsExternalString(string));
   if (v8_flags.enable_third_party_heap) return;
 
   Page* page = Page::FromHeapObject(string);
@@ -2687,66 +2779,68 @@ void Heap::UpdateExternalString(String string, size_t old_payload,
   }
 }
 
-String Heap::UpdateYoungReferenceInExternalStringTableEntry(Heap* heap,
-                                                            FullObjectSlot p) {
+Tagged<String> Heap::UpdateYoungReferenceInExternalStringTableEntry(
+    Heap* heap, FullObjectSlot p) {
   // This is only used for Scavenger.
-  DCHECK(!v8_flags.minor_mc);
+  DCHECK(!v8_flags.minor_ms);
 
   PtrComprCageBase cage_base(heap->isolate());
-  HeapObject obj = HeapObject::cast(*p);
-  MapWord first_word = obj.map_word(cage_base, kRelaxedLoad);
+  Tagged<HeapObject> obj = HeapObject::cast(*p);
+  MapWord first_word = obj->map_word(cage_base, kRelaxedLoad);
 
-  String new_string;
+  Tagged<String> new_string;
 
   if (InFromPage(obj)) {
     if (!first_word.IsForwardingAddress()) {
       // Unreachable external string can be finalized.
-      String string = String::cast(obj);
-      if (!string.IsExternalString(cage_base)) {
+      Tagged<String> string = Tagged<String>::cast(obj);
+      if (!IsExternalString(string, cage_base)) {
         // Original external string has been internalized.
-        DCHECK(string.IsThinString(cage_base));
-        return String();
+        DCHECK(IsThinString(string, cage_base));
+        return Tagged<String>();
       }
       heap->FinalizeExternalString(string);
-      return String();
+      return Tagged<String>();
     }
-    new_string = String::cast(first_word.ToForwardingAddress(obj));
+    new_string = Tagged<String>::cast(first_word.ToForwardingAddress(obj));
   } else {
-    new_string = String::cast(obj);
+    new_string = Tagged<String>::cast(obj);
   }
 
   // String is still reachable.
-  if (new_string.IsThinString(cage_base)) {
+  if (IsThinString(new_string, cage_base)) {
     // Filtering Thin strings out of the external string table.
-    return String();
-  } else if (new_string.IsExternalString(cage_base)) {
+    return Tagged<String>();
+  } else if (IsExternalString(new_string, cage_base)) {
     MemoryChunk::MoveExternalBackingStoreBytes(
         ExternalBackingStoreType::kExternalString,
         Page::FromAddress((*p).ptr()), Page::FromHeapObject(new_string),
-        ExternalString::cast(new_string).ExternalPayloadSize());
+        ExternalString::cast(new_string)->ExternalPayloadSize());
     return new_string;
   }
 
   // Internalization can replace external strings with non-external strings.
-  return new_string.IsExternalString(cage_base) ? new_string : String();
+  return IsExternalString(new_string, cage_base) ? new_string
+                                                 : Tagged<String>();
 }
 
 void Heap::ExternalStringTable::VerifyYoung() {
 #ifdef DEBUG
-  std::set<String> visited_map;
+  std::set<Tagged<String>> visited_map;
   std::map<MemoryChunk*, size_t> size_map;
   ExternalBackingStoreType type = ExternalBackingStoreType::kExternalString;
   for (size_t i = 0; i < young_strings_.size(); ++i) {
-    String obj = String::cast(young_strings_[i]);
+    Tagged<String> obj =
+        Tagged<String>::cast(Tagged<Object>(young_strings_[i]));
     MemoryChunk* mc = MemoryChunk::FromHeapObject(obj);
     DCHECK(mc->InYoungGeneration());
     DCHECK(heap_->InYoungGeneration(obj));
-    DCHECK(!obj.IsTheHole(heap_->isolate()));
-    DCHECK(obj.IsExternalString());
+    DCHECK(!IsTheHole(obj, heap_->isolate()));
+    DCHECK(IsExternalString(obj));
     // Note: we can have repeated elements in the table.
     DCHECK_EQ(0, visited_map.count(obj));
     visited_map.insert(obj);
-    size_map[mc] += ExternalString::cast(obj).ExternalPayloadSize();
+    size_map[mc] += Tagged<ExternalString>::cast(obj)->ExternalPayloadSize();
   }
   for (std::map<MemoryChunk*, size_t>::iterator it = size_map.begin();
        it != size_map.end(); it++)
@@ -2756,21 +2850,21 @@ void Heap::ExternalStringTable::VerifyYoung() {
 
 void Heap::ExternalStringTable::Verify() {
 #ifdef DEBUG
-  std::set<String> visited_map;
+  std::set<Tagged<String>> visited_map;
   std::map<MemoryChunk*, size_t> size_map;
   ExternalBackingStoreType type = ExternalBackingStoreType::kExternalString;
   VerifyYoung();
   for (size_t i = 0; i < old_strings_.size(); ++i) {
-    String obj = String::cast(old_strings_[i]);
+    Tagged<String> obj = Tagged<String>::cast(Tagged<Object>(old_strings_[i]));
     MemoryChunk* mc = MemoryChunk::FromHeapObject(obj);
     DCHECK(!mc->InYoungGeneration());
     DCHECK(!heap_->InYoungGeneration(obj));
-    DCHECK(!obj.IsTheHole(heap_->isolate()));
-    DCHECK(obj.IsExternalString());
+    DCHECK(!IsTheHole(obj, heap_->isolate()));
+    DCHECK(IsExternalString(obj));
     // Note: we can have repeated elements in the table.
     DCHECK_EQ(0, visited_map.count(obj));
     visited_map.insert(obj);
-    size_map[mc] += ExternalString::cast(obj).ExternalPayloadSize();
+    size_map[mc] += Tagged<ExternalString>::cast(obj)->ExternalPayloadSize();
   }
   for (std::map<MemoryChunk*, size_t>::iterator it = size_map.begin();
        it != size_map.end(); it++)
@@ -2787,11 +2881,11 @@ void Heap::ExternalStringTable::UpdateYoungReferences(
   FullObjectSlot last = start;
 
   for (FullObjectSlot p = start; p < end; ++p) {
-    String target = updater_func(heap_, p);
+    Tagged<String> target = updater_func(heap_, p);
 
     if (target.is_null()) continue;
 
-    DCHECK(target.IsExternalString());
+    DCHECK(IsExternalString(target));
 
     if (InYoungGeneration(target)) {
       // String is still in new space. Update the table entry.
@@ -2865,24 +2959,25 @@ void Heap::ProcessAllWeakReferences(WeakObjectRetainer* retainer) {
 }
 
 void Heap::ProcessNativeContexts(WeakObjectRetainer* retainer) {
-  Object head = VisitWeakList<Context>(this, native_contexts_list(), retainer);
+  Tagged<Object> head =
+      VisitWeakList<Context>(this, native_contexts_list(), retainer);
   // Update the head of the list of contexts.
   set_native_contexts_list(head);
 }
 
 void Heap::ProcessAllocationSites(WeakObjectRetainer* retainer) {
-  Object allocation_site_obj =
+  Tagged<Object> allocation_site_obj =
       VisitWeakList<AllocationSite>(this, allocation_sites_list(), retainer);
   set_allocation_sites_list(allocation_site_obj);
 }
 
 void Heap::ProcessDirtyJSFinalizationRegistries(WeakObjectRetainer* retainer) {
-  Object head = VisitWeakList<JSFinalizationRegistry>(
+  Tagged<Object> head = VisitWeakList<JSFinalizationRegistry>(
       this, dirty_js_finalization_registries_list(), retainer);
   set_dirty_js_finalization_registries_list(head);
   // If the list is empty, set the tail to undefined. Otherwise the tail is set
   // by WeakListVisitor<JSFinalizationRegistry>::VisitLiveObject.
-  if (head.IsUndefined(isolate())) {
+  if (IsUndefined(head, isolate())) {
     set_dirty_js_finalization_registries_list_tail(head);
   }
 }
@@ -2897,19 +2992,21 @@ void Heap::ProcessWeakListRoots(WeakObjectRetainer* retainer) {
 }
 
 void Heap::ForeachAllocationSite(
-    Object list, const std::function<void(AllocationSite)>& visitor) {
+    Tagged<Object> list,
+    const std::function<void(Tagged<AllocationSite>)>& visitor) {
   DisallowGarbageCollection no_gc;
-  Object current = list;
-  while (current.IsAllocationSite()) {
-    AllocationSite site = AllocationSite::cast(current);
+  Tagged<Object> current = list;
+  while (IsAllocationSite(current)) {
+    Tagged<AllocationSite> site = Tagged<AllocationSite>::cast(current);
     visitor(site);
-    Object current_nested = site.nested_site();
-    while (current_nested.IsAllocationSite()) {
-      AllocationSite nested_site = AllocationSite::cast(current_nested);
+    Tagged<Object> current_nested = site->nested_site();
+    while (IsAllocationSite(current_nested)) {
+      Tagged<AllocationSite> nested_site =
+          Tagged<AllocationSite>::cast(current_nested);
       visitor(nested_site);
-      current_nested = nested_site.nested_site();
+      current_nested = nested_site->nested_site();
     }
-    current = site.weak_next();
+    current = site->weak_next();
   }
 }
 
@@ -2917,17 +3014,17 @@ void Heap::ResetAllAllocationSitesDependentCode(AllocationType allocation) {
   DisallowGarbageCollection no_gc_scope;
   bool marked = false;
 
-  ForeachAllocationSite(allocation_sites_list(),
-                        [&marked, allocation, this](AllocationSite site) {
-                          if (site.GetAllocationType() == allocation) {
-                            site.ResetPretenureDecision();
-                            site.set_deopt_dependent_code(true);
-                            marked = true;
-                            pretenuring_handler_
-                                .RemoveAllocationSitePretenuringFeedback(site);
-                            return;
-                          }
-                        });
+  ForeachAllocationSite(
+      allocation_sites_list(),
+      [&marked, allocation, this](Tagged<AllocationSite> site) {
+        if (site->GetAllocationType() == allocation) {
+          site->ResetPretenureDecision();
+          site->set_deopt_dependent_code(true);
+          marked = true;
+          pretenuring_handler_.RemoveAllocationSitePretenuringFeedback(site);
+          return;
+        }
+      });
   if (marked) isolate_->stack_guard()->RequestDeoptMarkedAllocationSites();
 }
 
@@ -2965,7 +3062,7 @@ void Heap::VisitExternalResources(v8::ExternalResourceVisitor* visitor) {
     void VisitRootPointers(Root root, const char* description,
                            FullObjectSlot start, FullObjectSlot end) override {
       for (FullObjectSlot p = start; p < end; ++p) {
-        DCHECK((*p).IsExternalString());
+        DCHECK(IsExternalString(*p));
         visitor_->VisitExternalString(
             Utils::ToLocal(Handle<String>(String::cast(*p), isolate_)));
       }
@@ -3022,24 +3119,31 @@ size_t Heap::GetCodeRangeReservedAreaSize() {
   return CodeRange::GetWritableReservedAreaSize();
 }
 
-HeapObject Heap::PrecedeWithFiller(HeapObject object, int filler_size) {
+Tagged<HeapObject> Heap::PrecedeWithFiller(Tagged<HeapObject> object,
+                                           int filler_size) {
   CreateFillerObjectAt(object.address(), filler_size);
   return HeapObject::FromAddress(object.address() + filler_size);
 }
 
-HeapObject Heap::AlignWithFiller(HeapObject object, int object_size,
-                                 int allocation_size,
-                                 AllocationAlignment alignment) {
+Tagged<HeapObject> Heap::PrecedeWithFillerBackground(Tagged<HeapObject> object,
+                                                     int filler_size) {
+  CreateFillerObjectAtBackground(object.address(), filler_size);
+  return HeapObject::FromAddress(object.address() + filler_size);
+}
+
+Tagged<HeapObject> Heap::AlignWithFillerBackground(
+    Tagged<HeapObject> object, int object_size, int allocation_size,
+    AllocationAlignment alignment) {
   const int filler_size = allocation_size - object_size;
   DCHECK_LT(0, filler_size);
   const int pre_filler = GetFillToAlign(object.address(), alignment);
   if (pre_filler) {
-    object = PrecedeWithFiller(object, pre_filler);
+    object = PrecedeWithFillerBackground(object, pre_filler);
   }
   DCHECK_LE(0, filler_size - pre_filler);
   const int post_filler = filler_size - pre_filler;
   if (post_filler) {
-    CreateFillerObjectAt(object.address() + object_size, post_filler);
+    CreateFillerObjectAtBackground(object.address() + object_size, post_filler);
   }
   return object;
 }
@@ -3049,7 +3153,7 @@ void* Heap::AllocateExternalBackingStore(
   if (!always_allocate() && new_space()) {
     size_t new_space_backing_store_bytes =
         new_space()->ExternalBackingStoreOverallBytes();
-    if (new_space_backing_store_bytes >= 2 * kMaxSemiSpaceSize &&
+    if (new_space_backing_store_bytes >= 2 * DefaultMaxSemiSpaceSize() &&
         new_space_backing_store_bytes >= byte_length) {
       // Performing a young generation GC amortizes over the allocated backing
       // store bytes and may free enough external bytes for this allocation.
@@ -3072,37 +3176,41 @@ void* Heap::AllocateExternalBackingStore(
   return allocate(byte_length);
 }
 
-void Heap::ConfigureInitialOldGenerationSize() {
-  if (!old_generation_size_configured_ && tracer()->SurvivalEventsRecorded()) {
+// When old generation allocation limit is not configured (before the first full
+// GC), this method shrinks the initial very large old generation size. This
+// method can only shrink allocation limits but not increase it again.
+void Heap::ShrinkOldGenerationAllocationLimitIfNotConfigured() {
+  if (!old_generation_allocation_limit_configured_ &&
+      tracer()->SurvivalEventsRecorded()) {
     const size_t minimum_growing_step =
         MemoryController<V8HeapTrait>::MinimumAllocationLimitGrowingStep(
             CurrentHeapGrowingMode());
-    const size_t new_old_generation_allocation_limit =
+    size_t new_old_generation_allocation_limit =
         std::max(OldGenerationSizeOfObjects() + minimum_growing_step,
                  static_cast<size_t>(
                      static_cast<double>(old_generation_allocation_limit()) *
                      (tracer()->AverageSurvivalRatio() / 100)));
-    if (new_old_generation_allocation_limit <
-        old_generation_allocation_limit()) {
-      set_old_generation_allocation_limit(new_old_generation_allocation_limit);
-    } else {
-      old_generation_size_configured_ = true;
-    }
-    const size_t new_global_memory_limit = std::max(
+    new_old_generation_allocation_limit = std::min(
+        new_old_generation_allocation_limit, old_generation_allocation_limit());
+    size_t new_global_allocation_limit = std::max(
         GlobalSizeOfObjects() + minimum_growing_step,
         static_cast<size_t>(static_cast<double>(global_allocation_limit_) *
                             (tracer()->AverageSurvivalRatio() / 100)));
-    if (new_global_memory_limit < global_allocation_limit_) {
-      global_allocation_limit_ = new_global_memory_limit;
-    }
+    new_global_allocation_limit =
+        std::min(new_global_allocation_limit, global_allocation_limit_);
+    SetOldGenerationAndGlobalAllocationLimit(
+        new_old_generation_allocation_limit, new_global_allocation_limit);
+    // We need to update limits but still remain in the "not configured" state.
+    // The first full GC will configure the heap.
+    old_generation_allocation_limit_configured_ = false;
   }
 }
 
 void Heap::FlushNumberStringCache() {
   // Flush the number to string cache.
-  int len = number_string_cache().length();
+  int len = number_string_cache()->length();
   for (int i = 0; i < len; i++) {
-    number_string_cache().set_undefined(i);
+    number_string_cache()->set_undefined(i);
   }
 }
 
@@ -3115,29 +3223,33 @@ void CreateFillerObjectAtImpl(Heap* heap, Address addr, int size,
                  IsAligned(addr, kObjectAlignment8GbHeap));
   DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
                  IsAligned(size, kObjectAlignment8GbHeap));
+
+  CodePageMemoryModificationScope memory_modification_scope(
+      BasicMemoryChunk::FromAddress(addr));
+
   // TODO(v8:13070): Filler sizes are irrelevant for 8GB+ heaps. Adding them
   // should be avoided in this mode.
-  HeapObject filler = HeapObject::FromAddress(addr);
+  Tagged<HeapObject> filler = HeapObject::FromAddress(addr);
   ReadOnlyRoots roots(heap);
   if (size == kTaggedSize) {
-    filler.set_map_after_allocation(roots.unchecked_one_pointer_filler_map(),
-                                    SKIP_WRITE_BARRIER);
+    filler->set_map_after_allocation(roots.unchecked_one_pointer_filler_map(),
+                                     SKIP_WRITE_BARRIER);
     // Ensure the filler map is properly initialized.
-    DCHECK(filler.map(heap->isolate()).IsMap());
+    DCHECK(IsMap(filler->map(heap->isolate())));
   } else if (size == 2 * kTaggedSize) {
-    filler.set_map_after_allocation(roots.unchecked_two_pointer_filler_map(),
-                                    SKIP_WRITE_BARRIER);
+    filler->set_map_after_allocation(roots.unchecked_two_pointer_filler_map(),
+                                     SKIP_WRITE_BARRIER);
     if (clear_memory_mode == ClearFreedMemoryMode::kClearFreedMemory) {
       AtomicSlot slot(ObjectSlot(addr) + 1);
       *slot = static_cast<Tagged_t>(kClearedFreeMemoryValue);
     }
     // Ensure the filler map is properly initialized.
-    DCHECK(filler.map(heap->isolate()).IsMap());
+    DCHECK(IsMap(filler->map(heap->isolate())));
   } else {
     DCHECK_GT(size, 2 * kTaggedSize);
-    filler.set_map_after_allocation(roots.unchecked_free_space_map(),
-                                    SKIP_WRITE_BARRIER);
-    FreeSpace::cast(filler).set_size(size, kRelaxedStore);
+    filler->set_map_after_allocation(roots.unchecked_free_space_map(),
+                                     SKIP_WRITE_BARRIER);
+    FreeSpace::cast(filler)->set_size(size, kRelaxedStore);
     if (clear_memory_mode == ClearFreedMemoryMode::kClearFreedMemory) {
       MemsetTagged(ObjectSlot(addr) + 2, Object(kClearedFreeMemoryValue),
                    (size / kTaggedSize) - 2);
@@ -3147,7 +3259,7 @@ void CreateFillerObjectAtImpl(Heap* heap, Address addr, int size,
     // map is initialized. In this case we cannot access the map yet, as it
     // might be null, or not set up properly yet.
     DCHECK_IMPLIES(roots.is_initialized(RootIndex::kFreeSpaceMap),
-                   filler.map(heap->isolate()).IsMap());
+                   IsMap(filler->map(heap->isolate())));
   }
 }
 
@@ -3208,7 +3320,7 @@ void Heap::CreateFillerObjectAtRaw(
   }
 }
 
-bool Heap::CanMoveObjectStart(HeapObject object) {
+bool Heap::CanMoveObjectStart(Tagged<HeapObject> object) {
   if (!v8_flags.move_object_start) return false;
 
   // Sampling heap profiler may have a reference to the object.
@@ -3236,7 +3348,7 @@ bool Heap::CanMoveObjectStart(HeapObject object) {
   return true;
 }
 
-bool Heap::IsImmovable(HeapObject object) {
+bool Heap::IsImmovable(Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL)
     return third_party_heap::Heap::IsImmovable(object);
 
@@ -3244,7 +3356,7 @@ bool Heap::IsImmovable(HeapObject object) {
   return chunk->NeverEvacuate() || IsLargeObject(object);
 }
 
-bool Heap::IsLargeObject(HeapObject object) {
+bool Heap::IsLargeObject(Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL)
     return third_party_heap::Heap::InLargeObjectSpace(object.address()) ||
            third_party_heap::Heap::InSpace(object.address(), CODE_LO_SPACE);
@@ -3256,7 +3368,7 @@ namespace {
 
 class LeftTrimmerVerifierRootVisitor : public RootVisitor {
  public:
-  explicit LeftTrimmerVerifierRootVisitor(FixedArrayBase to_check)
+  explicit LeftTrimmerVerifierRootVisitor(Tagged<FixedArrayBase> to_check)
       : to_check_(to_check) {}
 
   LeftTrimmerVerifierRootVisitor(const LeftTrimmerVerifierRootVisitor&) =
@@ -3284,49 +3396,51 @@ class LeftTrimmerVerifierRootVisitor : public RootVisitor {
   }
 
  private:
-  FixedArrayBase to_check_;
+  Tagged<FixedArrayBase> to_check_;
 };
 }  // namespace
 #endif  // ENABLE_SLOW_DCHECKS
 
 namespace {
-bool MayContainRecordedSlots(HeapObject object) {
+bool MayContainRecordedSlots(Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return false;
   // New space object do not have recorded slots.
   if (BasicMemoryChunk::FromHeapObject(object)->InYoungGeneration())
     return false;
   // Allowlist objects that definitely do not have pointers.
-  if (object.IsByteArray() || object.IsFixedDoubleArray()) return false;
+  if (IsByteArray(object) || IsFixedDoubleArray(object)) return false;
   // Conservatively return true for other objects.
   return true;
 }
 }  // namespace
 
-void Heap::OnMoveEvent(HeapObject source, HeapObject target,
+void Heap::OnMoveEvent(Tagged<HeapObject> source, Tagged<HeapObject> target,
                        int size_in_bytes) {
   HeapProfiler* heap_profiler = isolate_->heap_profiler();
   if (heap_profiler->is_tracking_object_moves()) {
     heap_profiler->ObjectMoveEvent(source.address(), target.address(),
-                                   size_in_bytes);
+                                   size_in_bytes, /*is_embedder_object=*/false);
   }
   for (auto& tracker : allocation_trackers_) {
     tracker->MoveEvent(source.address(), target.address(), size_in_bytes);
   }
-  if (target.IsSharedFunctionInfo()) {
+  if (IsSharedFunctionInfo(target, isolate_)) {
     LOG_CODE_EVENT(isolate_, SharedFunctionInfoMoveEvent(source.address(),
                                                          target.address()));
-  } else if (target.IsNativeContext()) {
+  } else if (IsNativeContext(target, isolate_)) {
     if (isolate_->current_embedder_state() != nullptr) {
       isolate_->current_embedder_state()->OnMoveEvent(source.address(),
                                                       target.address());
     }
     PROFILE(isolate_,
             NativeContextMoveEvent(source.address(), target.address()));
+  } else if (IsMap(target, isolate_)) {
+    LOG(isolate_, MapMoveEvent(Map::cast(source), Map::cast(target)));
   }
 }
 
-FixedArrayBase Heap::LeftTrimFixedArray(FixedArrayBase object,
-                                        int elements_to_trim) {
+Tagged<FixedArrayBase> Heap::LeftTrimFixedArray(Tagged<FixedArrayBase> object,
+                                                int elements_to_trim) {
   if (elements_to_trim == 0) {
     // This simplifies reasoning in the rest of the function.
     return object;
@@ -3335,37 +3449,28 @@ FixedArrayBase Heap::LeftTrimFixedArray(FixedArrayBase object,
   DCHECK(CanMoveObjectStart(object));
   // Add custom visitor to concurrent marker if new left-trimmable type
   // is added.
-  DCHECK(object.IsFixedArray() || object.IsFixedDoubleArray());
-  const int element_size = object.IsFixedArray() ? kTaggedSize : kDoubleSize;
+  DCHECK(IsFixedArray(object) || IsFixedDoubleArray(object));
+  const int element_size = IsFixedArray(object) ? kTaggedSize : kDoubleSize;
   const int bytes_to_trim = elements_to_trim * element_size;
-  Map map = object.map();
+  Tagged<Map> map = object->map();
 
   // For now this trick is only applied to fixed arrays which may be in new
   // space or old space. In a large object space the object's start must
   // coincide with chunk and thus the trick is just not applicable.
   DCHECK(!IsLargeObject(object));
-  DCHECK(object.map() != ReadOnlyRoots(this).fixed_cow_array_map());
+  DCHECK(object->map() != ReadOnlyRoots(this).fixed_cow_array_map());
 
   static_assert(FixedArrayBase::kMapOffset == 0);
   static_assert(FixedArrayBase::kLengthOffset == kTaggedSize);
   static_assert(FixedArrayBase::kHeaderSize == 2 * kTaggedSize);
 
-  const int len = object.length();
+  const int len = object->length();
   DCHECK(elements_to_trim <= len);
 
   // Calculate location of new array start.
   Address old_start = object.address();
   Address new_start = old_start + bytes_to_trim;
 
-#ifdef DEBUG
-  if (MayContainRecordedSlots(object)) {
-    MemoryChunk* chunk = MemoryChunk::FromHeapObject(object);
-    DCHECK(!chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_NEW>(object));
-    DCHECK(!chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_OLD>(object));
-    DCHECK(!chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_SHARED>(object));
-  }
-#endif
-
   // Technically in new space this write might be omitted (except for
   // debug mode which iterates through the heap), but to play safer
   // we still do it.
@@ -3383,12 +3488,12 @@ FixedArrayBase Heap::LeftTrimFixedArray(FixedArrayBase object,
   RELAXED_WRITE_FIELD(object, bytes_to_trim + kTaggedSize,
                       Smi::FromInt(len - elements_to_trim));
 
-  FixedArrayBase new_object =
-      FixedArrayBase::cast(HeapObject::FromAddress(new_start));
+  Tagged<FixedArrayBase> new_object =
+      Tagged<FixedArrayBase>::cast(HeapObject::FromAddress(new_start));
 
   if (isolate()->log_object_relocation()) {
     // Notify the heap profiler of change in object layout.
-    OnMoveEvent(object, new_object, new_object.Size());
+    OnMoveEvent(object, new_object, new_object->Size());
   }
 
 #ifdef ENABLE_SLOW_DCHECKS
@@ -3399,7 +3504,6 @@ FixedArrayBase Heap::LeftTrimFixedArray(FixedArrayBase object,
 
     {
       AllowGarbageCollection allow_gc;
-      IgnoreLocalGCRequests ignore_gc_requests(this);
       safepoint_scope.emplace(this);
     }
 
@@ -3414,21 +3518,22 @@ FixedArrayBase Heap::LeftTrimFixedArray(FixedArrayBase object,
   return new_object;
 }
 
-void Heap::RightTrimFixedArray(FixedArrayBase object, int elements_to_trim) {
-  const int len = object.length();
+void Heap::RightTrimFixedArray(Tagged<FixedArrayBase> object,
+                               int elements_to_trim) {
+  const int len = object->length();
   DCHECK_LE(elements_to_trim, len);
   DCHECK_GE(elements_to_trim, 0);
 
   int bytes_to_trim;
-  if (object.IsByteArray()) {
+  if (IsByteArray(object)) {
     int new_size = ByteArray::SizeFor(len - elements_to_trim);
     bytes_to_trim = ByteArray::SizeFor(len) - new_size;
     DCHECK_GE(bytes_to_trim, 0);
-  } else if (object.IsFixedArray()) {
+  } else if (IsFixedArray(object)) {
     CHECK_NE(elements_to_trim, len);
     bytes_to_trim = elements_to_trim * kTaggedSize;
   } else {
-    DCHECK(object.IsFixedDoubleArray());
+    DCHECK(IsFixedDoubleArray(object));
     CHECK_NE(elements_to_trim, len);
     bytes_to_trim = elements_to_trim * kDoubleSize;
   }
@@ -3436,7 +3541,7 @@ void Heap::RightTrimFixedArray(FixedArrayBase object, int elements_to_trim) {
   CreateFillerForArray<FixedArrayBase>(object, elements_to_trim, bytes_to_trim);
 }
 
-void Heap::RightTrimWeakFixedArray(WeakFixedArray object,
+void Heap::RightTrimWeakFixedArray(Tagged<WeakFixedArray> object,
                                    int elements_to_trim) {
   // This function is safe to use only at the end of the mark compact
   // collection: When marking, we record the weak slots, and shrinking
@@ -3447,13 +3552,13 @@ void Heap::RightTrimWeakFixedArray(WeakFixedArray object,
 }
 
 template <typename T>
-void Heap::CreateFillerForArray(T object, int elements_to_trim,
+void Heap::CreateFillerForArray(Tagged<T> object, int elements_to_trim,
                                 int bytes_to_trim) {
-  DCHECK(object.IsFixedArrayBase() || object.IsByteArray() ||
-         object.IsWeakFixedArray());
+  DCHECK(IsFixedArrayBase(object) || IsByteArray(object) ||
+         IsWeakFixedArray(object));
 
   // For now this trick is only applied to objects in new and paged space.
-  DCHECK(object.map() != ReadOnlyRoots(this).fixed_cow_array_map());
+  DCHECK(object->map() != ReadOnlyRoots(this).fixed_cow_array_map());
 
   if (bytes_to_trim == 0) {
     DCHECK_EQ(elements_to_trim, 0);
@@ -3462,19 +3567,10 @@ void Heap::CreateFillerForArray(T object, int elements_to_trim,
   }
 
   // Calculate location of new array end.
-  int old_size = object.Size();
+  int old_size = object->Size();
   Address old_end = object.address() + old_size;
   Address new_end = old_end - bytes_to_trim;
 
-#ifdef DEBUG
-  if (MayContainRecordedSlots(object)) {
-    MemoryChunk* chunk = MemoryChunk::FromHeapObject(object);
-    DCHECK(!chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_NEW>(object));
-    DCHECK(!chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_SHARED>(object));
-    DCHECK(!chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_OLD>(object));
-  }
-#endif
-
   bool clear_slots = MayContainRecordedSlots(object);
 
   // Technically in new space this write might be omitted (except for
@@ -3485,15 +3581,15 @@ void Heap::CreateFillerForArray(T object, int elements_to_trim,
     NotifyObjectSizeChange(
         object, old_size, old_size - bytes_to_trim,
         clear_slots ? ClearRecordedSlots::kYes : ClearRecordedSlots::kNo);
-    HeapObject filler = HeapObject::FromAddress(new_end);
+    Tagged<HeapObject> filler = HeapObject::FromAddress(new_end);
     // Clear the mark bits of the black area that belongs now to the filler.
     // This is an optimization. The sweeper will release black fillers anyway.
     if (incremental_marking()->black_allocation() &&
-        marking_state()->IsBlackOrGrey(filler)) {
+        marking_state()->IsMarked(filler)) {
       Page* page = Page::FromAddress(new_end);
-      marking_state()->bitmap(page)->ClearRange(
-          page->AddressToMarkbitIndex(new_end),
-          page->AddressToMarkbitIndex(new_end + bytes_to_trim));
+      page->marking_bitmap()->ClearRange<AccessMode::ATOMIC>(
+          MarkingBitmap::AddressToIndex(new_end),
+          MarkingBitmap::LimitAddressToIndex(new_end + bytes_to_trim));
     }
   } else if (clear_slots) {
     // Large objects are not swept, so it is not necessary to clear the
@@ -3505,12 +3601,12 @@ void Heap::CreateFillerForArray(T object, int elements_to_trim,
   // Initialize header of the trimmed array. We are storing the new length
   // using release store after creating a filler for the left-over space to
   // avoid races with the sweeper thread.
-  object.set_length(object.length() - elements_to_trim, kReleaseStore);
+  object->set_length(object->length() - elements_to_trim, kReleaseStore);
 
   // Notify the heap object allocation tracker of change in object layout. The
   // array may not be moved during GC, and size has to be adjusted nevertheless.
   for (auto& tracker : allocation_trackers_) {
-    tracker->UpdateObjectSizeEvent(object.address(), object.Size());
+    tracker->UpdateObjectSizeEvent(object.address(), object->Size());
   }
 }
 
@@ -3726,16 +3822,40 @@ bool Heap::HasHighFragmentation() {
 bool Heap::ShouldOptimizeForMemoryUsage() {
   const size_t kOldGenerationSlack = max_old_generation_size() / 8;
   return v8_flags.optimize_for_size || isolate()->IsIsolateInBackground() ||
-         isolate()->IsMemorySavingsModeActive() || HighMemoryPressure() ||
-         !CanExpandOldGeneration(kOldGenerationSlack);
+         HighMemoryPressure() || !CanExpandOldGeneration(kOldGenerationSlack);
 }
 
+class ActivateMemoryReducerTask : public CancelableTask {
+ public:
+  explicit ActivateMemoryReducerTask(Heap* heap)
+      : CancelableTask(heap->isolate()), heap_(heap) {}
+
+  ~ActivateMemoryReducerTask() override = default;
+  ActivateMemoryReducerTask(const ActivateMemoryReducerTask&) = delete;
+  ActivateMemoryReducerTask& operator=(const ActivateMemoryReducerTask&) =
+      delete;
+
+ private:
+  // v8::internal::CancelableTask overrides.
+  void RunInternal() override {
+    heap_->ActivateMemoryReducerIfNeededOnMainThread();
+  }
+
+  Heap* heap_;
+};
+
 void Heap::ActivateMemoryReducerIfNeeded() {
+  if (memory_reducer_ == nullptr) return;
+  // This method may be called from any thread. Post a task to run it on the
+  // isolate's main thread to avoid synchronization.
+  task_runner_->PostTask(std::make_unique<ActivateMemoryReducerTask>(this));
+}
+
+void Heap::ActivateMemoryReducerIfNeededOnMainThread() {
   // Activate memory reducer when switching to background if
   // - there was no mark compact since the start.
   // - the committed memory can be potentially reduced.
   // 2 pages for the old, code, and map space + 1 page for new space.
-  if (memory_reducer_ == nullptr) return;
   const int kMinCommittedMemory = 7 * Page::kPageSize;
   if (ms_count_ == 0 && CommittedMemory() > kMinCommittedMemory &&
       isolate()->IsIsolateInBackground()) {
@@ -3774,8 +3894,8 @@ void Heap::ExpandNewSpaceSize() {
 }
 
 void Heap::ReduceNewSpaceSize() {
-  // MinorMC shrinks new space as part of sweeping.
-  if (!v8_flags.minor_mc) {
+  // MinorMS shrinks new space as part of sweeping.
+  if (!v8_flags.minor_ms) {
     SemiSpaceNewSpace::From(new_space())->Shrink();
   } else {
     paged_new_space()->FinishShrinking();
@@ -3789,11 +3909,8 @@ size_t Heap::NewSpaceCapacity() const {
   return new_space() ? new_space()->Capacity() : 0;
 }
 
-void Heap::FinalizeIncrementalMarkingIfComplete(
-    GarbageCollectionReason gc_reason) {
-  if (incremental_marking()->IsMajorMarkingComplete()) {
-    CollectAllGarbage(current_gc_flags_, gc_reason, current_gc_callback_flags_);
-  }
+size_t Heap::NewSpaceTargetCapacity() const {
+  return new_space() ? new_space()->TotalCapacity() : 0;
 }
 
 void Heap::FinalizeIncrementalMarkingAtomically(
@@ -3821,26 +3938,41 @@ thread_local Address pending_layout_change_object_address = kNullAddress;
 }  // namespace
 
 void Heap::NotifyObjectLayoutChange(
-    HeapObject object, const DisallowGarbageCollection&,
+    Tagged<HeapObject> object, const DisallowGarbageCollection&,
     InvalidateRecordedSlots invalidate_recorded_slots, int new_size) {
   if (invalidate_recorded_slots == InvalidateRecordedSlots::kYes) {
     const bool may_contain_recorded_slots = MayContainRecordedSlots(object);
+    MemoryChunk* const chunk = MemoryChunk::FromHeapObject(object);
+    // Do not remove the recorded slot in the map word as this one can never be
+    // invalidated.
+    const Address clear_range_start = object.address() + kTaggedSize;
+    // Only slots in the range of the new object size (which is potentially
+    // smaller than the original one) can be invalidated. Clearing of recorded
+    // slots up to the original object size even conflicts with concurrent
+    // sweeping.
+    const Address clear_range_end = object.address() + new_size;
 
     if (incremental_marking()->IsMarking()) {
       ExclusiveObjectLock::Lock(object);
       DCHECK_EQ(pending_layout_change_object_address, kNullAddress);
       pending_layout_change_object_address = object.address();
       if (may_contain_recorded_slots && incremental_marking()->IsCompacting()) {
-        MemoryChunk::FromHeapObject(object)
-            ->RegisterObjectWithInvalidatedSlots<OLD_TO_OLD>(object, new_size);
+        RememberedSet<OLD_TO_OLD>::RemoveRange(
+            chunk, clear_range_start, clear_range_end,
+            SlotSet::EmptyBucketMode::KEEP_EMPTY_BUCKETS);
       }
     }
 
     if (may_contain_recorded_slots) {
-      MemoryChunk::FromHeapObject(object)
-          ->RegisterObjectWithInvalidatedSlots<OLD_TO_NEW>(object, new_size);
-      MemoryChunk::FromHeapObject(object)
-          ->RegisterObjectWithInvalidatedSlots<OLD_TO_SHARED>(object, new_size);
+      RememberedSet<OLD_TO_NEW>::RemoveRange(
+          chunk, clear_range_start, clear_range_end,
+          SlotSet::EmptyBucketMode::KEEP_EMPTY_BUCKETS);
+      RememberedSet<OLD_TO_NEW_BACKGROUND>::RemoveRange(
+          chunk, clear_range_start, clear_range_end,
+          SlotSet::EmptyBucketMode::KEEP_EMPTY_BUCKETS);
+      RememberedSet<OLD_TO_SHARED>::RemoveRange(
+          chunk, clear_range_start, clear_range_end,
+          SlotSet::EmptyBucketMode::KEEP_EMPTY_BUCKETS);
     }
   }
 #ifdef VERIFY_HEAP
@@ -3851,7 +3983,7 @@ void Heap::NotifyObjectLayoutChange(
 }
 
 // static
-void Heap::NotifyObjectLayoutChangeDone(HeapObject object) {
+void Heap::NotifyObjectLayoutChangeDone(Tagged<HeapObject> object) {
   if (pending_layout_change_object_address != kNullAddress) {
     DCHECK_EQ(pending_layout_change_object_address, object.address());
     ExclusiveObjectLock::Unlock(object);
@@ -3859,10 +3991,9 @@ void Heap::NotifyObjectLayoutChangeDone(HeapObject object) {
   }
 }
 
-void Heap::NotifyObjectSizeChange(
-    HeapObject object, int old_size, int new_size,
-    ClearRecordedSlots clear_recorded_slots,
-    enum UpdateInvalidatedObjectSize update_invalidated_object_size) {
+void Heap::NotifyObjectSizeChange(Tagged<HeapObject> object, int old_size,
+                                  int new_size,
+                                  ClearRecordedSlots clear_recorded_slots) {
   old_size = ALIGN_TO_ALLOCATION_ALIGNMENT(old_size);
   new_size = ALIGN_TO_ALLOCATION_ALIGNMENT(new_size);
   DCHECK_LE(new_size, old_size);
@@ -3873,28 +4004,6 @@ void Heap::NotifyObjectSizeChange(
 
   DCHECK_IMPLIES(!is_main_thread,
                  clear_recorded_slots == ClearRecordedSlots::kNo);
-  DCHECK_IMPLIES(!is_main_thread, update_invalidated_object_size ==
-                                      UpdateInvalidatedObjectSize::kNo);
-
-  if (update_invalidated_object_size == UpdateInvalidatedObjectSize::kYes) {
-    UpdateInvalidatedObjectSize(object, new_size);
-  } else {
-    DCHECK_EQ(update_invalidated_object_size, UpdateInvalidatedObjectSize::kNo);
-
-#if DEBUG
-    if (is_main_thread) {
-      // When running on the main thread we can actually DCHECK that this object
-      // wasn't recorded in the invalidated_slots map yet.
-      MemoryChunk* chunk = MemoryChunk::FromHeapObject(object);
-      DCHECK(!chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_NEW>(object));
-      DCHECK(
-          !chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_SHARED>(object));
-      DCHECK_IMPLIES(
-          incremental_marking()->IsCompacting(),
-          !chunk->RegisteredObjectWithInvalidatedSlots<OLD_TO_OLD>(object));
-    }
-#endif
-  }
 
   const auto verify_no_slots_recorded =
       is_main_thread ? VerifyNoSlotsRecorded::kYes : VerifyNoSlotsRecorded::kNo;
@@ -3907,25 +4016,6 @@ void Heap::NotifyObjectSizeChange(
                           clear_recorded_slots, verify_no_slots_recorded);
 }
 
-void Heap::UpdateInvalidatedObjectSize(HeapObject object, int new_size) {
-  if (!MayContainRecordedSlots(object)) return;
-
-  // Updating invalidated_slots is unsynchronized and thus needs to happen on
-  // the main thread.
-  DCHECK_NULL(LocalHeap::Current());
-  DCHECK_EQ(isolate()->thread_id(), ThreadId::Current());
-
-  if (incremental_marking()->IsCompacting() || gc_state() == MARK_COMPACT) {
-    MemoryChunk::FromHeapObject(object)
-        ->UpdateInvalidatedObjectSize<OLD_TO_OLD>(object, new_size);
-  }
-
-  MemoryChunk::FromHeapObject(object)->UpdateInvalidatedObjectSize<OLD_TO_NEW>(
-      object, new_size);
-  MemoryChunk::FromHeapObject(object)
-      ->UpdateInvalidatedObjectSize<OLD_TO_SHARED>(object, new_size);
-}
-
 GCIdleTimeHeapState Heap::ComputeHeapState() {
   GCIdleTimeHeapState heap_state;
   heap_state.size_of_objects = static_cast<size_t>(SizeOfObjects());
@@ -4012,9 +4102,9 @@ bool Heap::IdleNotification(double deadline_in_seconds) {
   double start_ms = MonotonicallyIncreasingTimeInMs();
   double idle_time_in_ms = deadline_in_ms - start_ms;
 
-  tracer()->SampleAllocation(start_ms, NewSpaceAllocationCounter(),
-                             OldGenerationAllocationCounter(),
-                             EmbedderAllocationCounter());
+  tracer()->SampleAllocation(
+      base::TimeTicks::Now(), NewSpaceAllocationCounter(),
+      OldGenerationAllocationCounter(), EmbedderAllocationCounter());
 
   GCIdleTimeHeapState heap_state = ComputeHeapState();
   GCIdleTimeAction action =
@@ -4057,7 +4147,7 @@ void Heap::CheckMemoryPressure() {
   } else if (memory_pressure_level == MemoryPressureLevel::kModerate) {
     if (v8_flags.incremental_marking && incremental_marking()->IsStopped()) {
       TRACE_EVENT0("devtools.timeline,v8", "V8.CheckMemoryPressure");
-      StartIncrementalMarking(kReduceMemoryFootprintMask,
+      StartIncrementalMarking(GCFlag::kReduceMemoryFootprint,
                               GarbageCollectionReason::kMemoryPressure);
     }
   }
@@ -4070,7 +4160,7 @@ void Heap::CollectGarbageOnMemoryPressure() {
   const double kMaxMemoryPressurePauseMs = 100;
 
   double start = MonotonicallyIncreasingTimeInMs();
-  CollectAllGarbage(kReduceMemoryFootprintMask,
+  CollectAllGarbage(GCFlag::kReduceMemoryFootprint,
                     GarbageCollectionReason::kMemoryPressure,
                     kGCCallbackFlagCollectAllAvailableGarbage);
   EagerlyFreeExternalMemory();
@@ -4087,12 +4177,12 @@ void Heap::CollectGarbageOnMemoryPressure() {
     // If we spent less than half of the time budget, then perform full GC
     // Otherwise, start incremental marking.
     if (end - start < kMaxMemoryPressurePauseMs / 2) {
-      CollectAllGarbage(kReduceMemoryFootprintMask,
+      CollectAllGarbage(GCFlag::kReduceMemoryFootprint,
                         GarbageCollectionReason::kMemoryPressure,
                         kGCCallbackFlagCollectAllAvailableGarbage);
     } else {
       if (v8_flags.incremental_marking && incremental_marking()->IsStopped()) {
-        StartIncrementalMarking(kReduceMemoryFootprintMask,
+        StartIncrementalMarking(GCFlag::kReduceMemoryFootprint,
                                 GarbageCollectionReason::kMemoryPressure);
       }
     }
@@ -4114,9 +4204,8 @@ void Heap::MemoryPressureNotification(MemoryPressureLevel level,
     } else {
       ExecutionAccess access(isolate());
       isolate()->stack_guard()->RequestGC();
-      auto taskrunner = V8::GetCurrentPlatform()->GetForegroundTaskRunner(
-          reinterpret_cast<v8::Isolate*>(isolate()));
-      taskrunner->PostTask(std::make_unique<MemoryPressureInterruptTask>(this));
+      task_runner_->PostTask(
+          std::make_unique<MemoryPressureInterruptTask>(this));
     }
   }
 }
@@ -4150,13 +4239,13 @@ void Heap::RemoveNearHeapLimitCallback(v8::NearHeapLimitCallback callback,
   UNREACHABLE();
 }
 
-void Heap::AppendArrayBufferExtension(JSArrayBuffer object,
+void Heap::AppendArrayBufferExtension(Tagged<JSArrayBuffer> object,
                                       ArrayBufferExtension* extension) {
   // ArrayBufferSweeper is managing all counters and updating Heap counters.
   array_buffer_sweeper_->Append(object, extension);
 }
 
-void Heap::DetachArrayBufferExtension(JSArrayBuffer object,
+void Heap::DetachArrayBufferExtension(Tagged<JSArrayBuffer> object,
                                       ArrayBufferExtension* extension) {
   // ArrayBufferSweeper is managing all counters and updating Heap counters.
   return array_buffer_sweeper_->Detach(object, extension);
@@ -4179,7 +4268,7 @@ bool Heap::InvokeNearHeapLimitCallback() {
     size_t heap_limit = callback(data, max_old_generation_size(),
                                  initial_max_old_generation_size_);
     if (heap_limit > max_old_generation_size()) {
-      set_max_old_generation_size(
+      SetOldGenerationAndGlobalMaximumSize(
           std::min(heap_limit, AllocatorLimitOnMaxOldGenerationSize()));
       return true;
     }
@@ -4193,8 +4282,7 @@ bool Heap::MeasureMemory(std::unique_ptr<v8::MeasureMemoryDelegate> delegate,
   std::vector<Handle<NativeContext>> contexts = FindAllNativeContexts();
   std::vector<Handle<NativeContext>> to_measure;
   for (auto& current : contexts) {
-    if (delegate->ShouldMeasure(
-            v8::Utils::ToLocal(Handle<Context>::cast(current)))) {
+    if (delegate->ShouldMeasure(v8::Utils::ToLocal(current))) {
       to_measure.push_back(current);
     }
   }
@@ -4211,7 +4299,6 @@ std::unique_ptr<v8::MeasureMemoryDelegate> Heap::MeasureMemoryDelegate(
 
 void Heap::CollectCodeStatistics() {
   TRACE_EVENT0("v8", "Heap::CollectCodeStatistics");
-  IgnoreLocalGCRequests ignore_gc_requests(this);
   IsolateSafepointScope safepoint_scope(this);
   MakeHeapIterable();
   CodeStatistics::ResetCodeAndMetadataStatistics(isolate());
@@ -4241,69 +4328,7 @@ void Heap::ReportCodeStatistics(const char* title) {
 
 #endif  // DEBUG
 
-const char* Heap::GarbageCollectionReasonToString(
-    GarbageCollectionReason gc_reason) {
-  switch (gc_reason) {
-    case GarbageCollectionReason::kAllocationFailure:
-      return "allocation failure";
-    case GarbageCollectionReason::kAllocationLimit:
-      return "allocation limit";
-    case GarbageCollectionReason::kContextDisposal:
-      return "context disposal";
-    case GarbageCollectionReason::kCountersExtension:
-      return "counters extension";
-    case GarbageCollectionReason::kDebugger:
-      return "debugger";
-    case GarbageCollectionReason::kDeserializer:
-      return "deserialize";
-    case GarbageCollectionReason::kExternalMemoryPressure:
-      return "external memory pressure";
-    case GarbageCollectionReason::kFinalizeMarkingViaStackGuard:
-      return "finalize incremental marking via stack guard";
-    case GarbageCollectionReason::kFinalizeMarkingViaTask:
-      return "finalize incremental marking via task";
-    case GarbageCollectionReason::kFullHashtable:
-      return "full hash-table";
-    case GarbageCollectionReason::kHeapProfiler:
-      return "heap profiler";
-    case GarbageCollectionReason::kTask:
-      return "task";
-    case GarbageCollectionReason::kLastResort:
-      return "last resort";
-    case GarbageCollectionReason::kLowMemoryNotification:
-      return "low memory notification";
-    case GarbageCollectionReason::kMakeHeapIterable:
-      return "make heap iterable";
-    case GarbageCollectionReason::kMemoryPressure:
-      return "memory pressure";
-    case GarbageCollectionReason::kMemoryReducer:
-      return "memory reducer";
-    case GarbageCollectionReason::kRuntime:
-      return "runtime";
-    case GarbageCollectionReason::kSamplingProfiler:
-      return "sampling profiler";
-    case GarbageCollectionReason::kSnapshotCreator:
-      return "snapshot creator";
-    case GarbageCollectionReason::kTesting:
-      return "testing";
-    case GarbageCollectionReason::kExternalFinalize:
-      return "external finalize";
-    case GarbageCollectionReason::kGlobalAllocationLimit:
-      return "global allocation limit";
-    case GarbageCollectionReason::kMeasureMemory:
-      return "measure memory";
-    case GarbageCollectionReason::kUnknown:
-      return "unknown";
-    case GarbageCollectionReason::kBackgroundAllocationFailure:
-      return "background allocation failure";
-    case GarbageCollectionReason::kFinalizeMinorMC:
-      return "finalize MinorMC";
-    case GarbageCollectionReason::kCppHeapAllocationFailure:
-      return "CppHeap allocation failure";
-  }
-}
-
-bool Heap::Contains(HeapObject value) const {
+bool Heap::Contains(Tagged<HeapObject> value) const {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
     return true;
   }
@@ -4324,19 +4349,20 @@ bool Heap::Contains(HeapObject value) const {
          (shared_lo_space_ && shared_lo_space_->Contains(value));
 }
 
-bool Heap::ContainsCode(HeapObject value) const {
+bool Heap::ContainsCode(Tagged<HeapObject> value) const {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
     return true;
   }
   // TODO(v8:11880): support external code space.
-  if (memory_allocator()->IsOutsideAllocatedSpace(value.address())) {
+  if (memory_allocator()->IsOutsideAllocatedSpace(value.address(),
+                                                  EXECUTABLE)) {
     return false;
   }
   return HasBeenSetUp() &&
          (code_space_->Contains(value) || code_lo_space_->Contains(value));
 }
 
-bool Heap::SharedHeapContains(HeapObject value) const {
+bool Heap::SharedHeapContains(Tagged<HeapObject> value) const {
   if (shared_allocation_space_) {
     if (shared_allocation_space_->Contains(value)) return true;
     if (shared_lo_allocation_space_->Contains(value)) return true;
@@ -4345,19 +4371,21 @@ bool Heap::SharedHeapContains(HeapObject value) const {
   return false;
 }
 
-bool Heap::MustBeInSharedOldSpace(HeapObject value) {
+bool Heap::MustBeInSharedOldSpace(Tagged<HeapObject> value) {
   if (isolate()->OwnsStringTables()) return false;
   if (ReadOnlyHeap::Contains(value)) return false;
   if (Heap::InYoungGeneration(value)) return false;
-  if (value.IsExternalString()) return false;
-  if (value.IsInternalizedString()) return true;
+  if (IsExternalString(value)) return false;
+  if (IsInternalizedString(value)) return true;
   return false;
 }
 
-bool Heap::InSpace(HeapObject value, AllocationSpace space) const {
+bool Heap::InSpace(Tagged<HeapObject> value, AllocationSpace space) const {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL)
     return third_party_heap::Heap::InSpace(value.address(), space);
-  if (memory_allocator()->IsOutsideAllocatedSpace(value.address())) {
+  if (memory_allocator()->IsOutsideAllocatedSpace(
+          value.address(),
+          IsAnyCodeSpace(space) ? EXECUTABLE : NOT_EXECUTABLE)) {
     return false;
   }
   if (!HasBeenSetUp()) return false;
@@ -4386,7 +4414,8 @@ bool Heap::InSpace(HeapObject value, AllocationSpace space) const {
 }
 
 bool Heap::InSpaceSlow(Address addr, AllocationSpace space) const {
-  if (memory_allocator()->IsOutsideAllocatedSpace(addr)) {
+  if (memory_allocator()->IsOutsideAllocatedSpace(
+          addr, IsAnyCodeSpace(space) ? EXECUTABLE : NOT_EXECUTABLE)) {
     return false;
   }
   if (!HasBeenSetUp()) return false;
@@ -4442,7 +4471,7 @@ void Heap::VerifyCountersAfterSweeping() {
 }
 
 void Heap::VerifyCountersBeforeConcurrentSweeping(GarbageCollector collector) {
-  if (v8_flags.minor_mc && new_space()) {
+  if (v8_flags.minor_ms && new_space()) {
     PagedSpaceBase* space = paged_new_space()->paged_space();
     space->RefillFreeList();
     space->VerifyCountersBeforeConcurrentSweeping();
@@ -4465,31 +4494,12 @@ void Heap::VerifyCommittedPhysicalMemory() {
        space = spaces.Next()) {
     space->VerifyCommittedPhysicalMemory();
   }
-  if (v8_flags.minor_mc && new_space()) {
+  if (v8_flags.minor_ms && new_space()) {
     paged_new_space()->paged_space()->VerifyCommittedPhysicalMemory();
   }
 }
 #endif  // DEBUG
 
-void Heap::ZapCodeObject(Address start_address, int size_in_bytes) {
-#ifdef DEBUG
-  DCHECK(IsAligned(start_address, kIntSize));
-  for (int i = 0; i < size_in_bytes / kIntSize; i++) {
-    Memory<int>(start_address + i * kIntSize) = kCodeZapValue;
-  }
-#endif
-}
-
-void Heap::RegisterCodeObject(Handle<Code> code) {
-  InstructionStream istream = code->instruction_stream();
-  Address addr = istream.address();
-  if (!V8_ENABLE_THIRD_PARTY_HEAP_BOOL && code_space()->Contains(addr)) {
-    MemoryChunk::FromHeapObject(istream)
-        ->GetCodeObjectRegistry()
-        ->RegisterNewlyAllocatedCodeObject(addr);
-  }
-}
-
 void Heap::IterateWeakRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
   DCHECK(!options.contains(SkipRoot::kWeak));
 
@@ -4564,30 +4574,30 @@ class ClearStaleLeftTrimmedHandlesVisitor : public RootVisitor {
 
  private:
   inline void FixHandle(FullObjectSlot p) {
-    if (!(*p).IsHeapObject()) return;
-    HeapObject current = HeapObject::cast(*p);
-    if (!current.map_word(cage_base(), kRelaxedLoad).IsForwardingAddress() &&
-        current.IsFreeSpaceOrFiller(cage_base())) {
+    if (!IsHeapObject(*p)) return;
+    Tagged<HeapObject> current = HeapObject::cast(*p);
+    if (!current->map_word(cage_base(), kRelaxedLoad).IsForwardingAddress() &&
+        IsFreeSpaceOrFiller(current, cage_base())) {
 #ifdef DEBUG
       // We need to find a FixedArrayBase map after walking the fillers.
       while (
-          !current.map_word(cage_base(), kRelaxedLoad).IsForwardingAddress() &&
-          current.IsFreeSpaceOrFiller(cage_base())) {
+          !current->map_word(cage_base(), kRelaxedLoad).IsForwardingAddress() &&
+          IsFreeSpaceOrFiller(current, cage_base())) {
         Address next = current.ptr();
-        if (current.map(cage_base()) ==
+        if (current->map(cage_base()) ==
             ReadOnlyRoots(heap_).one_pointer_filler_map()) {
           next += kTaggedSize;
-        } else if (current.map(cage_base()) ==
+        } else if (current->map(cage_base()) ==
                    ReadOnlyRoots(heap_).two_pointer_filler_map()) {
           next += 2 * kTaggedSize;
         } else {
-          next += current.Size();
+          next += current->Size();
         }
         current = HeapObject::cast(Object(next));
       }
       DCHECK(
-          current.map_word(cage_base(), kRelaxedLoad).IsForwardingAddress() ||
-          current.IsFixedArrayBase(cage_base()));
+          current->map_word(cage_base(), kRelaxedLoad).IsForwardingAddress() ||
+          IsFixedArrayBase(current, cage_base()));
 #endif  // DEBUG
       p.store(Smi::zero());
     }
@@ -4600,7 +4610,8 @@ class ClearStaleLeftTrimmedHandlesVisitor : public RootVisitor {
 #endif  // V8_COMPRESS_POINTERS
 };
 
-void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
+void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options,
+                        IterateRootsMode roots_mode) {
   v->VisitRootPointers(Root::kStrongRootList, nullptr,
                        roots_table().strong_roots_begin(),
                        roots_table().strong_roots_end());
@@ -4616,7 +4627,13 @@ void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
   isolate_->compilation_cache()->Iterate(v);
   v->Synchronize(VisitorSynchronization::kCompilationCache);
 
-  if (!options.contains(SkipRoot::kOldGeneration)) {
+  const bool skip_iterate_builtins =
+      options.contains(SkipRoot::kOldGeneration) ||
+      (Builtins::kCodeObjectsAreInROSpace &&
+       options.contains(SkipRoot::kReadOnlyBuiltins) &&
+       // Prior to ReadOnlyPromotion, builtins may be on the mutable heap.
+       !isolate_->serializer_enabled());
+  if (!skip_iterate_builtins) {
     IterateBuiltins(v);
     v->Synchronize(VisitorSynchronization::kBuiltins);
   }
@@ -4641,6 +4658,14 @@ void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
   // above is that non-transient heap state is always visited, transient heap
   // state is visited only when not serializing.
   if (!options.contains(SkipRoot::kUnserializable)) {
+    if (!options.contains(SkipRoot::kTracedHandles)) {
+      if (options.contains(SkipRoot::kOldGeneration)) {
+        isolate_->traced_handles()->IterateYoungRoots(v);
+      } else {
+        isolate_->traced_handles()->Iterate(v);
+      }
+    }
+
     if (!options.contains(SkipRoot::kGlobalHandles)) {
       if (options.contains(SkipRoot::kWeak)) {
         if (options.contains(SkipRoot::kOldGeneration)) {
@@ -4652,15 +4677,11 @@ void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
           isolate_->global_handles()->IterateStrongRoots(v);
         }
       } else {
-        // Do not skip weak handles.
         if (options.contains(SkipRoot::kOldGeneration)) {
-          // Skip handles that are old.
-          isolate_->global_handles()->IterateAllYoungRoots(v);
-          isolate_->traced_handles()->IterateYoung(v);
+          UNREACHABLE();
         } else {
           // Do not skip any handles.
           isolate_->global_handles()->IterateAllRoots(v);
-          isolate_->traced_handles()->Iterate(v);
         }
       }
     }
@@ -4669,10 +4690,7 @@ void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
     if (!options.contains(SkipRoot::kStack)) {
       IterateStackRoots(v);
       if (!options.contains(SkipRoot::kConservativeStack)) {
-        ScanStackMode stack_mode = options.contains(SkipRoot::kTopOfStack)
-                                       ? ScanStackMode::kFromMarker
-                                       : ScanStackMode::kComplete;
-        IterateConservativeStackRoots(v, stack_mode);
+        IterateConservativeStackRoots(v, roots_mode);
       }
       v->Synchronize(VisitorSynchronization::kStackRoots);
     }
@@ -4683,16 +4701,12 @@ void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
       // objects. The GC would crash on such stale references.
       ClearStaleLeftTrimmedHandlesVisitor left_trim_visitor(this);
       isolate_->handle_scope_implementer()->Iterate(&left_trim_visitor);
-
       isolate_->handle_scope_implementer()->Iterate(v);
     }
-
     // Iterate local handles for all local heaps.
     safepoint_->Iterate(v);
-
     // Iterates all persistent handles.
     isolate_->persistent_handles_list()->Iterate(v, isolate_);
-
     v->Synchronize(VisitorSynchronization::kHandleScope);
 
     if (options.contains(SkipRoot::kOldGeneration)) {
@@ -4712,6 +4726,7 @@ void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
         microtask_queue = microtask_queue->next();
       } while (microtask_queue != default_microtask_queue);
     }
+    v->Synchronize(VisitorSynchronization::kMicroTasks);
 
     // Iterate over other strong roots (currently only identity maps and
     // deoptimization entries).
@@ -4746,74 +4761,20 @@ void Heap::IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options) {
   }
 }
 
-class ClientRootVisitor : public RootVisitor {
- public:
-  explicit ClientRootVisitor(RootVisitor* actual_visitor)
-      : actual_visitor_(actual_visitor) {}
-
-  void VisitRootPointers(Root root, const char* description,
-                         FullObjectSlot start, FullObjectSlot end) final {
-    for (FullObjectSlot p = start; p < end; ++p) {
-      MaybeForwardSlot(root, description, p);
-    }
-  }
-
-  void VisitRootPointers(Root root, const char* description,
-                         OffHeapObjectSlot start, OffHeapObjectSlot end) final {
-    actual_visitor_->VisitRootPointers(root, description, start, end);
-  }
-
-  void VisitRunningCode(FullObjectSlot code_slot,
-                        FullObjectSlot maybe_istream_slot) final {
-#if DEBUG
-    DCHECK(!HeapObject::cast(*code_slot).InWritableSharedSpace());
-    Object maybe_istream = *maybe_istream_slot;
-    DCHECK(maybe_istream == Smi::zero() ||
-           !HeapObject::cast(maybe_istream).InWritableSharedSpace());
-#endif
-  }
-
-  void Synchronize(VisitorSynchronization::SyncTag tag) final {
-    actual_visitor_->Synchronize(tag);
-  }
-
- private:
-  void MaybeForwardSlot(Root root, const char* description,
-                        FullObjectSlot slot) {
-    Object object = *slot;
-    if (!object.IsHeapObject()) return;
-    HeapObject heap_object = HeapObject::cast(object);
-    if (heap_object.InWritableSharedSpace()) {
-      actual_visitor_->VisitRootPointer(root, description, slot);
-    }
-  }
-
-  RootVisitor* const actual_visitor_;
-};
-
 void Heap::IterateRootsIncludingClients(RootVisitor* v,
                                         base::EnumSet<SkipRoot> options) {
-  IterateRoots(v, options);
+  IterateRoots(v, options, IterateRootsMode::kMainIsolate);
 
   if (isolate()->is_shared_space_isolate()) {
-    ClientRootVisitor client_root_visitor(v);
-    // TODO(v8:13257): We cannot run CSS on client isolates now, as the
-    // stack markers will not be correct.
-    options.Add(SkipRoot::kConservativeStack);
+    ClientRootVisitor<> client_root_visitor(v);
     isolate()->global_safepoint()->IterateClientIsolates(
         [v = &client_root_visitor, options](Isolate* client) {
-          client->heap()->IterateRoots(v, options);
+          client->heap()->IterateRoots(v, options,
+                                       IterateRootsMode::kClientIsolate);
         });
   }
 }
 
-void Heap::IterateConservativeStackRootsIncludingClients(
-    RootVisitor* v, ScanStackMode stack_mode) {
-  IterateConservativeStackRoots(v, stack_mode);
-
-  // TODO(v8:13257): Iterate over client isolates for CSS once supported.
-}
-
 void Heap::IterateWeakGlobalHandles(RootVisitor* v) {
   isolate_->global_handles()->IterateWeakRoots(v);
   isolate_->traced_handles()->Iterate(v);
@@ -4840,31 +4801,73 @@ void Heap::IterateBuiltins(RootVisitor* v) {
 void Heap::IterateStackRoots(RootVisitor* v) { isolate_->Iterate(v); }
 
 void Heap::IterateConservativeStackRoots(RootVisitor* v,
-                                         ScanStackMode stack_mode) {
+                                         IterateRootsMode roots_mode) {
 #ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
   if (!IsGCWithStack()) return;
 
-  ConservativeStackVisitor stack_visitor(isolate_, v);
-  if (stack_mode == ScanStackMode::kComplete) {
-    stack().IteratePointers(&stack_visitor);
-  } else {
-    stack().IteratePointersUntilMarker(&stack_visitor);
-  }
+  TRACE_GC(tracer(), GCTracer::Scope::CONSERVATIVE_STACK_SCANNING);
+
+  // In case of a shared GC, we're interested in the main isolate for CSS.
+  Isolate* main_isolate = roots_mode == IterateRootsMode::kClientIsolate
+                              ? isolate()->shared_space_isolate()
+                              : isolate();
+
+  ConservativeStackVisitor stack_visitor(main_isolate, v);
+  stack().IteratePointersUntilMarker(&stack_visitor);
 #endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
 }
 
-namespace {
-size_t GlobalMemorySizeFromV8Size(size_t v8_size) {
-  const size_t kGlobalMemoryToV8Ratio = 2;
-  return std::min(static_cast<uint64_t>(std::numeric_limits<size_t>::max()),
-                  static_cast<uint64_t>(v8_size) * kGlobalMemoryToV8Ratio);
+// static
+size_t Heap::DefaultMinSemiSpaceSize() {
+#if ENABLE_HUGEPAGE
+  static constexpr size_t kMinSemiSpaceSize =
+      kHugePageSize * kPointerMultiplier;
+#else
+  static constexpr size_t kMinSemiSpaceSize = 512 * KB * kPointerMultiplier;
+#endif
+  static_assert(kMinSemiSpaceSize % (1 << kPageSizeBits) == 0);
+
+  return kMinSemiSpaceSize;
+}
+
+// static
+size_t Heap::DefaultMaxSemiSpaceSize() {
+#if ENABLE_HUGEPAGE
+  static constexpr size_t kMaxSemiSpaceCapacityBaseUnit =
+      kHugePageSize * 2 * kPointerMultiplier;
+#else
+  static constexpr size_t kMaxSemiSpaceCapacityBaseUnit =
+      MB * kPointerMultiplier;
+#endif
+  static_assert(kMaxSemiSpaceCapacityBaseUnit % (1 << kPageSizeBits) == 0);
+
+  size_t max_semi_space_size =
+      (v8_flags.minor_ms ? v8_flags.minor_ms_max_new_space_capacity_mb
+                         : v8_flags.scavenger_max_new_space_capacity_mb) *
+      kMaxSemiSpaceCapacityBaseUnit;
+  DCHECK_EQ(0, max_semi_space_size % (1 << kPageSizeBits));
+  return max_semi_space_size;
+}
+
+// static
+size_t Heap::OldGenerationToSemiSpaceRatio() {
+  DCHECK(!v8_flags.minor_ms);
+  static constexpr size_t kOldGenerationToSemiSpaceRatio =
+      128 * kHeapLimitMultiplier / kPointerMultiplier;
+  return kOldGenerationToSemiSpaceRatio;
+}
+
+// static
+size_t Heap::OldGenerationToSemiSpaceRatioLowMemory() {
+  static constexpr size_t kOldGenerationToSemiSpaceRatioLowMemory =
+      256 * kHeapLimitMultiplier / kPointerMultiplier;
+  return kOldGenerationToSemiSpaceRatioLowMemory / (v8_flags.minor_ms ? 2 : 1);
 }
-}  // anonymous namespace
 
 void Heap::ConfigureHeap(const v8::ResourceConstraints& constraints) {
   // Initialize max_semi_space_size_.
   {
-    max_semi_space_size_ = 8 * (kSystemPointerSize / 4) * MB;
+    max_semi_space_size_ = DefaultMaxSemiSpaceSize();
     if (constraints.max_young_generation_size_in_bytes() > 0) {
       max_semi_space_size_ = SemiSpaceSizeFromYoungGenerationSize(
           constraints.max_young_generation_size_in_bytes());
@@ -4888,22 +4891,19 @@ void Heap::ConfigureHeap(const v8::ResourceConstraints& constraints) {
       max_semi_space_size_ =
           SemiSpaceSizeFromYoungGenerationSize(young_generation_size);
     }
-    if (v8_flags.minor_mc) {
-      // The conditions above this one assume a new space implementation
-      // consisting of two equally sized semi spaces. If MinorMC is used, new
-      // space contains only a single space. Thus max size can be doubled
-      // without regressing memory.
-      max_semi_space_size_ *= 2;
-    }
     if (v8_flags.stress_compaction) {
       // This will cause more frequent GCs when stressing.
       max_semi_space_size_ = MB;
     }
-    // TODO(dinfuehr): Rounding to a power of 2 is not longer needed. Remove it.
+    if (!v8_flags.minor_ms) {
+      // TODO(dinfuehr): Rounding to a power of 2 is technically no longer
+      // needed but yields best performance on Pixel2.
+      max_semi_space_size_ =
+          static_cast<size_t>(base::bits::RoundUpToPowerOfTwo64(
+              static_cast<uint64_t>(max_semi_space_size_)));
+    }
     max_semi_space_size_ =
-        static_cast<size_t>(base::bits::RoundUpToPowerOfTwo64(
-            static_cast<uint64_t>(max_semi_space_size_)));
-    max_semi_space_size_ = std::max({max_semi_space_size_, kMinSemiSpaceSize});
+        std::max(max_semi_space_size_, DefaultMinSemiSpaceSize());
     max_semi_space_size_ = RoundDown<Page::kPageSize>(max_semi_space_size_);
   }
 
@@ -4931,9 +4931,7 @@ void Heap::ConfigureHeap(const v8::ResourceConstraints& constraints) {
     max_old_generation_size =
         RoundDown<Page::kPageSize>(max_old_generation_size);
 
-    max_global_memory_size_ =
-        GlobalMemorySizeFromV8Size(max_old_generation_size);
-    set_max_old_generation_size(max_old_generation_size);
+    SetOldGenerationAndGlobalMaximumSize(max_old_generation_size);
   }
 
   CHECK_IMPLIES(
@@ -4942,8 +4940,8 @@ void Heap::ConfigureHeap(const v8::ResourceConstraints& constraints) {
 
   // Initialize initial_semispace_size_.
   {
-    initial_semispace_size_ = kMinSemiSpaceSize;
-    if (max_semi_space_size_ == kMaxSemiSpaceSize) {
+    initial_semispace_size_ = DefaultMinSemiSpaceSize();
+    if (max_semi_space_size_ == DefaultMaxSemiSpaceSize()) {
       // Start with at least 1*MB semi-space on machines with a lot of memory.
       initial_semispace_size_ =
           std::max(initial_semispace_size_, static_cast<size_t>(1 * MB));
@@ -4980,7 +4978,7 @@ void Heap::ConfigureHeap(const v8::ResourceConstraints& constraints) {
     if (constraints.initial_old_generation_size_in_bytes() > 0) {
       initial_old_generation_size_ =
           constraints.initial_old_generation_size_in_bytes();
-      old_generation_size_configured_ = true;
+      old_generation_allocation_limit_configured_ = true;
     }
     if (v8_flags.initial_heap_size > 0) {
       size_t initial_heap_size =
@@ -4991,12 +4989,12 @@ void Heap::ConfigureHeap(const v8::ResourceConstraints& constraints) {
           initial_heap_size > young_generation_size
               ? initial_heap_size - young_generation_size
               : 0;
-      old_generation_size_configured_ = true;
+      old_generation_allocation_limit_configured_ = true;
     }
     if (v8_flags.initial_old_space_size > 0) {
       initial_old_generation_size_ =
           static_cast<size_t>(v8_flags.initial_old_space_size) * MB;
-      old_generation_size_configured_ = true;
+      old_generation_allocation_limit_configured_ = true;
     }
     initial_old_generation_size_ =
         std::min(initial_old_generation_size_, max_old_generation_size() / 2);
@@ -5004,7 +5002,7 @@ void Heap::ConfigureHeap(const v8::ResourceConstraints& constraints) {
         RoundDown<Page::kPageSize>(initial_old_generation_size_);
   }
 
-  if (old_generation_size_configured_) {
+  if (old_generation_allocation_limit_configured_) {
     // If the embedder pre-configures the initial old generation size,
     // then allow V8 to skip full GCs below that threshold.
     min_old_generation_size_ = initial_old_generation_size_;
@@ -5016,10 +5014,8 @@ void Heap::ConfigureHeap(const v8::ResourceConstraints& constraints) {
     v8_flags.semi_space_growth_factor = 2;
   }
 
-  set_old_generation_allocation_limit(initial_old_generation_size_);
-  global_allocation_limit_ =
-      GlobalMemorySizeFromV8Size(old_generation_allocation_limit());
   initial_max_old_generation_size_ = max_old_generation_size();
+  ResetOldGenerationAndGlobalAllocationLimit();
 
   // We rely on being able to allocate new arrays in paged spaces.
   DCHECK(kMaxRegularHeapObjectSize >=
@@ -5084,12 +5080,12 @@ void Heap::RecordStats(HeapStats* stats, bool take_snapshot) {
   *stats->malloced_peak_memory = isolate_->allocator()->GetMaxMemoryUsage();
   if (take_snapshot) {
     HeapObjectIterator iterator(this);
-    for (HeapObject obj = iterator.Next(); !obj.is_null();
+    for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
          obj = iterator.Next()) {
-      InstanceType type = obj.map().instance_type();
+      InstanceType type = obj->map()->instance_type();
       DCHECK(0 <= type && type <= LAST_TYPE);
       stats->objects_per_type[type]++;
-      stats->size_per_type[type] += obj.Size();
+      stats->size_per_type[type] += obj->Size();
     }
   }
   if (stats->last_few_messages != nullptr)
@@ -5220,7 +5216,15 @@ bool Heap::IsMainThreadParked(LocalHeap* local_heap) {
 }
 
 bool Heap::IsMajorMarkingComplete(LocalHeap* local_heap) {
+  // Only check this on the main thread.
   if (!local_heap || !local_heap->is_main_thread()) return false;
+
+  // But also ignore main threads of client isolates.
+  if (local_heap->heap() != this) {
+    DCHECK(isolate()->is_shared_space_isolate());
+    return false;
+  }
+
   return incremental_marking()->IsMajorMarkingComplete();
 }
 
@@ -5334,10 +5338,11 @@ Heap::IncrementalMarkingLimit Heap::IncrementalMarkingLimitReached() {
   const base::Optional<size_t> global_memory_available =
       GlobalMemoryAvailable();
 
-  if (old_generation_space_available > NewSpaceCapacity() &&
+  if (old_generation_space_available > NewSpaceTargetCapacity() &&
       (!global_memory_available ||
-       global_memory_available > NewSpaceCapacity())) {
-    if (cpp_heap() && !old_generation_size_configured_ && gc_count_ == 0) {
+       global_memory_available > NewSpaceTargetCapacity())) {
+    if (cpp_heap() && !old_generation_allocation_limit_configured_ &&
+        gc_count_ == 0) {
       // At this point the embedder memory is above the activation
       // threshold. No GC happened so far and it's thus unlikely to get a
       // configured heap any time soon. Start a memory reducer in this case
@@ -5431,6 +5436,11 @@ void Heap::SetUp(LocalHeap* main_thread_local_heap) {
     code_page_allocator = isolate_->page_allocator();
   }
 
+  task_runner_ = V8::GetCurrentPlatform()->GetForegroundTaskRunner(
+      reinterpret_cast<v8::Isolate*>(isolate()));
+
+  collection_barrier_.reset(new CollectionBarrier(this, this->task_runner_));
+
   // Set up memory allocator.
   memory_allocator_.reset(
       new MemoryAllocator(isolate_, code_page_allocator, MaxReserved()));
@@ -5440,7 +5450,8 @@ void Heap::SetUp(LocalHeap* main_thread_local_heap) {
   mark_compact_collector_.reset(new MarkCompactCollector(this));
 
   scavenger_collector_.reset(new ScavengerCollector(this));
-  minor_mark_compact_collector_.reset(new MinorMarkCompactCollector(this));
+  minor_mark_sweep_collector_.reset(new MinorMarkSweepCollector(this));
+  ephemeron_remembered_set_.reset(new EphemeronRememberedSet());
 
   incremental_marking_.reset(
       new IncrementalMarking(this, mark_compact_collector_->weak_objects()));
@@ -5457,13 +5468,16 @@ void Heap::SetUp(LocalHeap* main_thread_local_heap) {
     v8::GCType gc_type = kGCTypeMarkSweepCompact;
     if (V8_UNLIKELY(!v8_flags.trace_gc_heap_layout_ignore_minor_gc)) {
       gc_type = static_cast<v8::GCType>(gc_type | kGCTypeScavenge |
-                                        kGCTypeMinorMarkCompact);
+                                        kGCTypeMinorMarkSweep);
     }
     AddGCPrologueCallback(HeapLayoutTracer::GCProloguePrintHeapLayout, gc_type,
                           nullptr);
     AddGCEpilogueCallback(HeapLayoutTracer::GCEpiloguePrintHeapLayout, gc_type,
                           nullptr);
   }
+  if (v8_flags.memory_balancer) {
+    mb_.reset(new MemoryBalancer(this));
+  }
 }
 
 void Heap::SetUpFromReadOnlyHeap(ReadOnlyHeap* ro_heap) {
@@ -5506,12 +5520,18 @@ class StressConcurrentAllocationObserver : public AllocationObserver {
   Heap* heap_;
 };
 
+namespace {
+
+size_t ReturnNull() { return 0; }
+
+}  // namespace
+
 void Heap::SetUpSpaces(LinearAllocationArea& new_allocation_info,
                        LinearAllocationArea& old_allocation_info) {
   // Ensure SetUpFromReadOnlySpace has been ran.
   DCHECK_NOT_NULL(read_only_space_);
   if (!v8_flags.single_generation) {
-    if (v8_flags.minor_mc) {
+    if (v8_flags.minor_ms) {
       space_[NEW_SPACE] = std::make_unique<PagedNewSpace>(
           this, initial_semispace_size_, max_semi_space_size_,
           new_allocation_info);
@@ -5574,29 +5594,12 @@ void Heap::SetUpSpaces(LinearAllocationArea& new_allocation_info,
   LOG(isolate_, IntPtrTEvent("heap-capacity", Capacity()));
   LOG(isolate_, IntPtrTEvent("heap-available", Available()));
 
-  mark_compact_collector()->SetUp();
-  if (minor_mark_compact_collector_) {
-    minor_mark_compact_collector_->SetUp();
-  }
-
   if (new_space()) {
-    minor_gc_job_.reset(new MinorGCJob());
-    if (v8_flags.concurrent_minor_mc_marking) {
-      // TODO(v8:13012): Atomic MinorMC should not use ScavengeJob. Instead, we
-      // should schedule MinorMC tasks at a soft limit, which are used by atomic
-      // MinorMC, and to finalize concurrent MinorMC. The condition
-      // v8_flags.concurrent_minor_mc_marking can then be changed to
-      // v8_flags.minor_mc (here and at the RemoveAllocationObserver call site).
-      minor_gc_task_observer_.reset(
-          new MinorMCIncrementalMarkingTaskObserver(this));
-    } else {
-      // ScavengeJob is used by atomic MinorMC and Scavenger.
-      minor_gc_task_observer_.reset(new ScheduleMinorGCTaskObserver(this));
-    }
+    minor_gc_job_.reset(new MinorGCJob(this));
+    minor_gc_task_observer_.reset(new ScheduleMinorGCTaskObserver(this));
   }
 
-  SetGetExternallyAllocatedMemoryInBytesCallback(
-      DefaultGetExternallyAllocatedMemoryInBytesCallback);
+  SetGetExternallyAllocatedMemoryInBytesCallback(ReturnNull);
 
   if (v8_flags.stress_marking > 0) {
     stress_marking_percentage_ = NextStressMarkingLimit();
@@ -5639,8 +5642,12 @@ void Heap::InitializeHashSeed() {
   } else {
     new_hash_seed = static_cast<uint64_t>(v8_flags.hash_seed);
   }
-  ReadOnlyRoots(this).hash_seed().copy_in(
-      0, reinterpret_cast<byte*>(&new_hash_seed), kInt64Size);
+  ReadOnlyRoots(this).hash_seed()->copy_in(
+      0, reinterpret_cast<uint8_t*>(&new_hash_seed), kInt64Size);
+}
+
+std::shared_ptr<v8::TaskRunner> Heap::GetForegroundTaskRunner() const {
+  return task_runner_;
 }
 
 // static
@@ -5683,13 +5690,14 @@ void Heap::WeakenDescriptorArrays(
 
   // No GC is running, weaken the arrays right away.
   DisallowGarbageCollection no_gc;
-  Map descriptor_array_map = ReadOnlyRoots(isolate()).descriptor_array_map();
+  Tagged<Map> descriptor_array_map =
+      ReadOnlyRoots(isolate()).descriptor_array_map();
   for (auto it = strong_descriptor_arrays.begin();
        it != strong_descriptor_arrays.end(); ++it) {
-    DescriptorArray array = it.raw();
-    DCHECK(array.IsStrongDescriptorArray());
-    array.set_map_safe_transition_no_write_barrier(descriptor_array_map);
-    DCHECK_EQ(array.raw_gc_state(kRelaxedLoad), 0);
+    Tagged<DescriptorArray> array = it.raw();
+    DCHECK(IsStrongDescriptorArray(array));
+    array->set_map_safe_transition_no_write_barrier(descriptor_array_map);
+    DCHECK_EQ(array->raw_gc_state(kRelaxedLoad), 0);
   }
 }
 
@@ -5733,14 +5741,9 @@ void Heap::NotifyBootstrapComplete() {
 
 void Heap::NotifyOldGenerationExpansion(AllocationSpace space,
                                         MemoryChunk* chunk) {
-  // Pages created during bootstrapping may contain immortal immovable objects.
-  if (!deserialization_complete()) {
-    DCHECK_NE(NEW_SPACE, chunk->owner()->identity());
-    chunk->MarkNeverEvacuate();
-  }
-  if (space == CODE_SPACE || space == CODE_LO_SPACE) {
-    isolate()->AddCodeMemoryChunk(chunk);
-  }
+  // Do the same thing we would have done for background expansion.
+  NotifyOldGenerationExpansionBackground(space, chunk);
+
   const size_t kMemoryReducerActivationThreshold = 1 * MB;
   if (memory_reducer() != nullptr && old_generation_capacity_after_bootstrap_ &&
       ms_count_ == 0 &&
@@ -5751,6 +5754,18 @@ void Heap::NotifyOldGenerationExpansion(AllocationSpace space,
   }
 }
 
+void Heap::NotifyOldGenerationExpansionBackground(AllocationSpace space,
+                                                  MemoryChunk* chunk) {
+  // Pages created during bootstrapping may contain immortal immovable objects.
+  if (!deserialization_complete()) {
+    DCHECK_NE(NEW_SPACE, chunk->owner()->identity());
+    chunk->MarkNeverEvacuate();
+  }
+  if (IsAnyCodeSpace(space)) {
+    isolate()->AddCodeMemoryChunk(chunk);
+  }
+}
+
 void Heap::SetEmbedderRootsHandler(EmbedderRootsHandler* handler) {
   embedder_roots_handler_ = handler;
 }
@@ -5776,12 +5791,7 @@ const cppgc::EmbedderStackState* Heap::overriden_stack_state() const {
 }
 
 void Heap::SetStackStart(void* stack_start) {
-#if V8_ENABLE_WEBASSEMBLY
-  stack().SetStackStart(stack_start,
-                        v8_flags.experimental_wasm_stack_switching);
-#else
-  stack().SetStackStart(stack_start, false);
-#endif  // V8_ENABLE_WEBASSEMBLY
+  stack().SetStackStart(stack_start);
 }
 
 ::heap::base::Stack& Heap::stack() { return isolate_->stack(); }
@@ -5812,13 +5822,6 @@ void Heap::StartTearDown() {
   FreeMainThreadSharedLinearAllocationAreas();
 }
 
-void Heap::ForceSharedGCWithEmptyStackForTesting() {
-  // No mutex or atomics as this variable is always set from only a single
-  // thread before invoking a shared GC. The shared GC then resets the flag
-  // while the initiating thread is guaranteed to wait on a condition variable.
-  force_shared_gc_with_empty_stack_for_testing_ = true;
-}
-
 void Heap::TearDownWithSharedHeap() {
   DCHECK_EQ(gc_state(), TEAR_DOWN);
 
@@ -5844,7 +5847,6 @@ void Heap::TearDown() {
   // Assert that there are no background threads left and no executable memory
   // chunks are unprotected.
   safepoint()->AssertMainThreadIsOnlyThread();
-  DCHECK(main_thread_local_heap()->unprotected_memory_chunks_.empty());
 
   DCHECK(concurrent_marking()->IsStopped());
 
@@ -5883,9 +5885,9 @@ void Heap::TearDown() {
     mark_compact_collector_.reset();
   }
 
-  if (minor_mark_compact_collector_) {
-    minor_mark_compact_collector_->TearDown();
-    minor_mark_compact_collector_.reset();
+  if (minor_mark_sweep_collector_) {
+    minor_mark_sweep_collector_->TearDown();
+    minor_mark_sweep_collector_.reset();
   }
 
   sweeper_->TearDown();
@@ -5899,6 +5901,7 @@ void Heap::TearDown() {
   gc_idle_time_handler_.reset();
   memory_measurement_.reset();
   allocation_tracker_for_debugging_.reset();
+  ephemeron_remembered_set_.reset();
 
   if (memory_reducer_ != nullptr) {
     memory_reducer_->TearDown();
@@ -6004,10 +6007,11 @@ void Heap::CompactWeakArrayLists() {
   std::vector<Handle<PrototypeInfo>> prototype_infos;
   {
     HeapObjectIterator iterator(this);
-    for (HeapObject o = iterator.Next(); !o.is_null(); o = iterator.Next()) {
-      if (o.IsPrototypeInfo()) {
-        PrototypeInfo prototype_info = PrototypeInfo::cast(o);
-        if (prototype_info.prototype_users().IsWeakArrayList()) {
+    for (Tagged<HeapObject> o = iterator.Next(); !o.is_null();
+         o = iterator.Next()) {
+      if (IsPrototypeInfo(*o)) {
+        Tagged<PrototypeInfo> prototype_info = Tagged<PrototypeInfo>::cast(o);
+        if (IsWeakArrayList(prototype_info->prototype_users())) {
           prototype_infos.emplace_back(handle(prototype_info, isolate()));
         }
       }
@@ -6018,7 +6022,7 @@ void Heap::CompactWeakArrayLists() {
         WeakArrayList::cast(prototype_info->prototype_users()), isolate());
     DCHECK(InOldSpace(*array) ||
            *array == ReadOnlyRoots(this).empty_weak_array_list());
-    WeakArrayList new_array = PrototypeUsers::Compact(
+    Tagged<WeakArrayList> new_array = PrototypeUsers::Compact(
         array, this, JSObject::PrototypeRegistryCompactionCallback,
         AllocationType::kOld);
     prototype_info->set_prototype_users(new_array);
@@ -6032,7 +6036,9 @@ void Heap::CompactWeakArrayLists() {
 }
 
 void Heap::AddRetainedMap(Handle<NativeContext> context, Handle<Map> map) {
-  if (map->is_in_retained_map_list() || map->InWritableSharedSpace()) {
+  DCHECK(!map->InAnySharedSpace());
+
+  if (map->is_in_retained_map_list()) {
     return;
   }
 
@@ -6041,41 +6047,40 @@ void Heap::AddRetainedMap(Handle<NativeContext> context, Handle<Map> map) {
   if (array->IsFull()) {
     CompactRetainedMaps(*array);
   }
-  array = WeakArrayList::AddToEnd(
-      isolate(), array, MaybeObjectHandle::Weak(map),
-      MaybeObjectHandle(Smi::FromInt(v8_flags.retain_maps_for_n_gc),
-                        isolate()));
+  array =
+      WeakArrayList::AddToEnd(isolate(), array, MaybeObjectHandle::Weak(map),
+                              Smi::FromInt(v8_flags.retain_maps_for_n_gc));
   if (*array != context->retained_maps()) {
     context->set_retained_maps(*array);
   }
   map->set_is_in_retained_map_list(true);
 }
 
-void Heap::CompactRetainedMaps(WeakArrayList retained_maps) {
-  int length = retained_maps.length();
+void Heap::CompactRetainedMaps(Tagged<WeakArrayList> retained_maps) {
+  int length = retained_maps->length();
   int new_length = 0;
   // This loop compacts the array by removing cleared weak cells.
   for (int i = 0; i < length; i += 2) {
-    MaybeObject maybe_object = retained_maps.Get(i);
+    MaybeObject maybe_object = retained_maps->Get(i);
     if (maybe_object->IsCleared()) {
       continue;
     }
 
     DCHECK(maybe_object->IsWeak());
 
-    MaybeObject age = retained_maps.Get(i + 1);
-    DCHECK(age->IsSmi());
+    MaybeObject age = retained_maps->Get(i + 1);
+    DCHECK(IsSmi(age));
     if (i != new_length) {
-      retained_maps.Set(new_length, maybe_object);
-      retained_maps.Set(new_length + 1, age);
+      retained_maps->Set(new_length, maybe_object);
+      retained_maps->Set(new_length + 1, age);
     }
     new_length += 2;
   }
-  HeapObject undefined = ReadOnlyRoots(this).undefined_value();
+  Tagged<HeapObject> undefined = ReadOnlyRoots(this).undefined_value();
   for (int i = new_length; i < length; i++) {
-    retained_maps.Set(i, HeapObjectReference::Strong(undefined));
+    retained_maps->Set(i, HeapObjectReference::Strong(undefined));
   }
-  if (new_length != length) retained_maps.set_length(new_length);
+  if (new_length != length) retained_maps->set_length(new_length);
 }
 
 void Heap::FatalProcessOutOfMemory(const char* location) {
@@ -6122,7 +6127,7 @@ void Heap::CheckHandleCount() {
   isolate_->handle_scope_implementer()->Iterate(&v);
 }
 
-void Heap::ClearRecordedSlot(HeapObject object, ObjectSlot slot) {
+void Heap::ClearRecordedSlot(Tagged<HeapObject> object, ObjectSlot slot) {
 #ifndef V8_DISABLE_WRITE_BARRIERS
   DCHECK(!IsLargeObject(object));
   Page* page = Page::FromAddress(slot.address());
@@ -6138,6 +6143,7 @@ void Heap::ClearRecordedSlot(HeapObject object, ObjectSlot slot) {
       // No need to update old-to-old here since that remembered set is gone
       // after a full GC and not re-recorded until sweeping is finished.
       RememberedSet<OLD_TO_NEW>::Remove(page, slot.address());
+      RememberedSet<OLD_TO_NEW_BACKGROUND>::Remove(page, slot.address());
       RememberedSet<OLD_TO_SHARED>::Remove(page, slot.address());
     }
   }
@@ -6146,29 +6152,19 @@ void Heap::ClearRecordedSlot(HeapObject object, ObjectSlot slot) {
 
 // static
 int Heap::InsertIntoRememberedSetFromCode(MemoryChunk* chunk, Address slot) {
+  // This is called during runtime by a builtin, therefore it is run in the main
+  // thread.
+  DCHECK_NULL(LocalHeap::Current());
   RememberedSet<OLD_TO_NEW>::Insert<AccessMode::NON_ATOMIC>(chunk, slot);
   return 0;
 }
 
 #ifdef DEBUG
-void Heap::VerifyClearedSlot(HeapObject object, ObjectSlot slot) {
-#ifndef V8_DISABLE_WRITE_BARRIERS
-  DCHECK(!IsLargeObject(object));
-  if (InYoungGeneration(object)) return;
-  Page* page = Page::FromAddress(slot.address());
-  DCHECK_EQ(page->owner_identity(), OLD_SPACE);
-  // Slots are filtered with invalidated slots.
-  CHECK_IMPLIES(RememberedSet<OLD_TO_NEW>::Contains(page, slot.address()),
-                page->RegisteredObjectWithInvalidatedSlots<OLD_TO_NEW>(object));
-  CHECK_IMPLIES(RememberedSet<OLD_TO_OLD>::Contains(page, slot.address()),
-                page->RegisteredObjectWithInvalidatedSlots<OLD_TO_OLD>(object));
-#endif
-}
-
 void Heap::VerifySlotRangeHasNoRecordedSlots(Address start, Address end) {
 #ifndef V8_DISABLE_WRITE_BARRIERS
   Page* page = Page::FromAddress(start);
   RememberedSet<OLD_TO_NEW>::CheckNoneInRange(page, start, end);
+  RememberedSet<OLD_TO_NEW_BACKGROUND>::CheckNoneInRange(page, start, end);
   RememberedSet<OLD_TO_SHARED>::CheckNoneInRange(page, start, end);
 #endif
 }
@@ -6187,6 +6183,8 @@ void Heap::ClearRecordedSlotRange(Address start, Address end) {
     if (!page->SweepingDone()) {
       RememberedSet<OLD_TO_NEW>::RemoveRange(page, start, end,
                                              SlotSet::KEEP_EMPTY_BUCKETS);
+      RememberedSet<OLD_TO_NEW_BACKGROUND>::RemoveRange(
+          page, start, end, SlotSet::KEEP_EMPTY_BUCKETS);
       RememberedSet<OLD_TO_SHARED>::RemoveRange(page, start, end,
                                                 SlotSet::KEEP_EMPTY_BUCKETS);
     }
@@ -6206,7 +6204,7 @@ PagedSpace* PagedSpaceIterator::Next() {
 class HeapObjectsFilter {
  public:
   virtual ~HeapObjectsFilter() = default;
-  virtual bool SkipObject(HeapObject object) = 0;
+  virtual bool SkipObject(Tagged<HeapObject> object) = 0;
 };
 
 class UnreachableObjectsFilter : public HeapObjectsFilter {
@@ -6215,69 +6213,69 @@ class UnreachableObjectsFilter : public HeapObjectsFilter {
     MarkReachableObjects();
   }
 
-  ~UnreachableObjectsFilter() override {
-    for (auto it : reachable_) {
-      delete it.second;
-      it.second = nullptr;
-    }
-  }
+  ~UnreachableObjectsFilter() override = default;
 
-  bool SkipObject(HeapObject object) override {
-    if (object.IsFreeSpaceOrFiller()) return true;
-    Address chunk = object.ptr() & ~kLogicalChunkAlignmentMask;
+  bool SkipObject(Tagged<HeapObject> object) override {
+    // Space object iterators should skip free space or filler objects.
+    DCHECK(!IsFreeSpaceOrFiller(object));
+    // If the bucket corresponding to the object's chunk does not exist, or the
+    // object is not found in the bucket, return true.
+    BasicMemoryChunk* chunk = BasicMemoryChunk::FromHeapObject(object);
     if (reachable_.count(chunk) == 0) return true;
     return reachable_[chunk]->count(object) == 0;
   }
 
  private:
-  bool MarkAsReachable(HeapObject object) {
-    Address chunk = object.ptr() & ~kLogicalChunkAlignmentMask;
+  using BucketType = std::unordered_set<HeapObject, Object::Hasher>;
+
+  bool MarkAsReachable(Tagged<HeapObject> object) {
+    // If the bucket corresponding to the object's chunk does not exist, then
+    // create an empty bucket.
+    BasicMemoryChunk* chunk = BasicMemoryChunk::FromHeapObject(object);
     if (reachable_.count(chunk) == 0) {
-      reachable_[chunk] = new std::unordered_set<HeapObject, Object::Hasher>();
+      reachable_[chunk] = std::make_unique<BucketType>();
     }
+    // Insert the object if not present; return whether it was indeed inserted.
     if (reachable_[chunk]->count(object)) return false;
     reachable_[chunk]->insert(object);
     return true;
   }
 
-  static constexpr intptr_t kLogicalChunkAlignment =
-      (static_cast<uintptr_t>(1) << kPageSizeBits);
-
-  static constexpr intptr_t kLogicalChunkAlignmentMask =
-      kLogicalChunkAlignment - 1;
-
   class MarkingVisitor : public ObjectVisitorWithCageBases, public RootVisitor {
    public:
     explicit MarkingVisitor(UnreachableObjectsFilter* filter)
         : ObjectVisitorWithCageBases(filter->heap_), filter_(filter) {}
 
-    void VisitMapPointer(HeapObject object) override {
-      MarkHeapObject(Map::unchecked_cast(object.map(cage_base())));
+    void VisitMapPointer(Tagged<HeapObject> object) override {
+      MarkHeapObject(Map::unchecked_cast(object->map(cage_base())));
     }
-    void VisitPointers(HeapObject host, ObjectSlot start,
+    void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                        ObjectSlot end) override {
       MarkPointers(MaybeObjectSlot(start), MaybeObjectSlot(end));
     }
 
-    void VisitPointers(HeapObject host, MaybeObjectSlot start,
+    void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                        MaybeObjectSlot end) final {
       MarkPointers(start, end);
     }
 
-    void VisitCodePointer(Code host, CodeObjectSlot slot) override {
-      Object maybe_code = slot.load(code_cage_base());
-      HeapObject heap_object;
+    void VisitInstructionStreamPointer(Tagged<Code> host,
+                                       InstructionStreamSlot slot) override {
+      Tagged<Object> maybe_code = slot.load(code_cage_base());
+      Tagged<HeapObject> heap_object;
       if (maybe_code.GetHeapObject(&heap_object)) {
         MarkHeapObject(heap_object);
       }
     }
 
-    void VisitCodeTarget(RelocInfo* rinfo) final {
-      InstructionStream target =
+    void VisitCodeTarget(Tagged<InstructionStream> host,
+                         RelocInfo* rinfo) final {
+      Tagged<InstructionStream> target =
           InstructionStream::FromTargetAddress(rinfo->target_address());
       MarkHeapObject(target);
     }
-    void VisitEmbeddedPointer(RelocInfo* rinfo) final {
+    void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                              RelocInfo* rinfo) final {
       MarkHeapObject(rinfo->target_object(cage_base()));
     }
 
@@ -6293,9 +6291,9 @@ class UnreachableObjectsFilter : public HeapObjectsFilter {
 
     void TransitiveClosure() {
       while (!marking_stack_.empty()) {
-        HeapObject obj = marking_stack_.back();
+        Tagged<HeapObject> obj = marking_stack_.back();
         marking_stack_.pop_back();
-        obj.Iterate(cage_base(), this);
+        obj->Iterate(cage_base(), this);
       }
     }
 
@@ -6309,125 +6307,119 @@ class UnreachableObjectsFilter : public HeapObjectsFilter {
       // Treat weak references as strong.
       for (TSlot p = start; p < end; ++p) {
         typename TSlot::TObject object = p.load(cage_base());
-        HeapObject heap_object;
+        Tagged<HeapObject> heap_object;
         if (object.GetHeapObject(&heap_object)) {
           MarkHeapObject(heap_object);
         }
       }
     }
 
-    V8_INLINE void MarkHeapObject(HeapObject heap_object) {
+    V8_INLINE void MarkHeapObject(Tagged<HeapObject> heap_object) {
       if (filter_->MarkAsReachable(heap_object)) {
         marking_stack_.push_back(heap_object);
       }
     }
 
     UnreachableObjectsFilter* filter_;
-    std::vector<HeapObject> marking_stack_;
+    std::vector<Tagged<HeapObject>> marking_stack_;
   };
 
   friend class MarkingVisitor;
 
   void MarkReachableObjects() {
     MarkingVisitor visitor(this);
-    heap_->IterateRoots(&visitor, {});
+    heap_->stack().SetMarkerIfNeededAndCallback(
+        [this, &visitor]() { heap_->IterateRoots(&visitor, {}); });
     visitor.TransitiveClosure();
   }
 
   Heap* heap_;
   DISALLOW_GARBAGE_COLLECTION(no_gc_)
-  std::unordered_map<Address, std::unordered_set<HeapObject, Object::Hasher>*>
+  std::unordered_map<BasicMemoryChunk*, std::unique_ptr<BucketType>,
+                     base::hash<BasicMemoryChunk*>>
       reachable_;
 };
 
 HeapObjectIterator::HeapObjectIterator(
     Heap* heap, HeapObjectIterator::HeapObjectsFiltering filtering)
+    : HeapObjectIterator(
+          heap,
+          new SafepointScope(heap->isolate(),
+                             heap->isolate()->is_shared_space_isolate()
+                                 ? SafepointKind::kGlobal
+                                 : SafepointKind::kIsolate),
+          filtering) {}
+
+HeapObjectIterator::HeapObjectIterator(Heap* heap,
+                                       const SafepointScope& safepoint_scope,
+                                       HeapObjectsFiltering filtering)
+    : HeapObjectIterator(heap, nullptr, filtering) {}
+
+HeapObjectIterator::HeapObjectIterator(
+    Heap* heap, SafepointScope* safepoint_scope_or_nullptr,
+    HeapObjectsFiltering filtering)
     : heap_(heap),
-      safepoint_scope_(std::make_unique<SafepointScope>(
-          heap->isolate(), heap->isolate()->is_shared_space_isolate()
-                               ? SafepointKind::kGlobal
-                               : SafepointKind::kIsolate)),
-      filtering_(filtering),
-      filter_(nullptr),
-      space_iterator_(nullptr),
-      object_iterator_(nullptr) {
+      safepoint_scope_(safepoint_scope_or_nullptr),
+      space_iterator_(heap_) {
   heap_->MakeHeapIterable();
-  // Start the iteration.
-  space_iterator_ = new SpaceIterator(heap_);
-  switch (filtering_) {
+  switch (filtering) {
     case kFilterUnreachable:
-      filter_ = new UnreachableObjectsFilter(heap_);
+      filter_ = std::make_unique<UnreachableObjectsFilter>(heap_);
       break;
     default:
       break;
   }
-  CHECK(space_iterator_->HasNext());
-  object_iterator_ = space_iterator_->Next()->GetObjectIterator(heap_);
+  // Start the iteration.
+  CHECK(space_iterator_.HasNext());
+  object_iterator_ = space_iterator_.Next()->GetObjectIterator(heap_);
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) heap_->tp_heap_->ResetIterator();
 }
 
-HeapObjectIterator::~HeapObjectIterator() {
-#ifdef DEBUG
-  // Assert that in filtering mode we have iterated through all
-  // objects. Otherwise, heap will be left in an inconsistent state.
-  if (!V8_ENABLE_THIRD_PARTY_HEAP_BOOL && filtering_ != kNoFiltering) {
-    DCHECK_NULL(object_iterator_);
-  }
-#endif
-  delete space_iterator_;
-  delete filter_;
-}
+HeapObjectIterator::~HeapObjectIterator() = default;
 
-HeapObject HeapObjectIterator::Next() {
-  if (filter_ == nullptr) return NextObject();
+Tagged<HeapObject> HeapObjectIterator::Next() {
+  if (!filter_) return NextObject();
 
-  HeapObject obj = NextObject();
-  while (!obj.is_null() && (filter_->SkipObject(obj))) obj = NextObject();
+  Tagged<HeapObject> obj = NextObject();
+  while (!obj.is_null() && filter_->SkipObject(obj)) obj = NextObject();
   return obj;
 }
 
-HeapObject HeapObjectIterator::NextObject() {
+Tagged<HeapObject> HeapObjectIterator::NextObject() {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) return heap_->tp_heap_->NextObject();
   // No iterator means we are done.
-  if (object_iterator_.get() == nullptr) return HeapObject();
+  if (!object_iterator_) return Tagged<HeapObject>();
 
-  HeapObject obj = object_iterator_.get()->Next();
-  if (!obj.is_null()) {
-    // If the current iterator has more objects we are fine.
-    return obj;
-  } else {
-    // Go though the spaces looking for one that has objects.
-    while (space_iterator_->HasNext()) {
-      object_iterator_ = space_iterator_->Next()->GetObjectIterator(heap_);
-      obj = object_iterator_.get()->Next();
-      if (!obj.is_null()) {
-        return obj;
-      }
-    }
+  Tagged<HeapObject> obj = object_iterator_->Next();
+  // If the current iterator has more objects we are fine.
+  if (!obj.is_null()) return obj;
+  // Go though the spaces looking for one that has objects.
+  while (space_iterator_.HasNext()) {
+    object_iterator_ = space_iterator_.Next()->GetObjectIterator(heap_);
+    obj = object_iterator_->Next();
+    if (!obj.is_null()) return obj;
   }
   // Done with the last space.
-  object_iterator_.reset(nullptr);
-  return HeapObject();
+  object_iterator_.reset();
+  return Tagged<HeapObject>();
 }
 
-void Heap::UpdateTotalGCTime(double duration) {
-  if (v8_flags.trace_gc_verbose) {
-    total_gc_time_ms_ += duration;
-  }
+void Heap::UpdateTotalGCTime(base::TimeDelta duration) {
+  total_gc_time_ms_ += duration;
 }
 
 void Heap::ExternalStringTable::CleanUpYoung() {
   int last = 0;
   Isolate* isolate = heap_->isolate();
   for (size_t i = 0; i < young_strings_.size(); ++i) {
-    Object o = young_strings_[i];
-    if (o.IsTheHole(isolate)) {
+    Tagged<Object> o = young_strings_[i];
+    if (IsTheHole(o, isolate)) {
       continue;
     }
     // The real external string is already in one of these vectors and was or
     // will be processed. Re-processing it will add a duplicate to the vector.
-    if (o.IsThinString()) continue;
-    DCHECK(o.IsExternalString());
+    if (IsThinString(o)) continue;
+    DCHECK(IsExternalString(o));
     if (InYoungGeneration(o)) {
       young_strings_[last++] = o;
     } else {
@@ -6442,14 +6434,14 @@ void Heap::ExternalStringTable::CleanUpAll() {
   int last = 0;
   Isolate* isolate = heap_->isolate();
   for (size_t i = 0; i < old_strings_.size(); ++i) {
-    Object o = old_strings_[i];
-    if (o.IsTheHole(isolate)) {
+    Tagged<Object> o = old_strings_[i];
+    if (IsTheHole(o, isolate)) {
       continue;
     }
     // The real external string is already in one of these vectors and was or
     // will be processed. Re-processing it will add a duplicate to the vector.
-    if (o.IsThinString()) continue;
-    DCHECK(o.IsExternalString());
+    if (IsThinString(o)) continue;
+    DCHECK(IsExternalString(o));
     DCHECK(!InYoungGeneration(o));
     old_strings_[last++] = o;
   }
@@ -6461,16 +6453,16 @@ void Heap::ExternalStringTable::CleanUpAll() {
 
 void Heap::ExternalStringTable::TearDown() {
   for (size_t i = 0; i < young_strings_.size(); ++i) {
-    Object o = young_strings_[i];
+    Tagged<Object> o = young_strings_[i];
     // Dont finalize thin strings.
-    if (o.IsThinString()) continue;
+    if (IsThinString(o)) continue;
     heap_->FinalizeExternalString(ExternalString::cast(o));
   }
   young_strings_.clear();
   for (size_t i = 0; i < old_strings_.size(); ++i) {
-    Object o = old_strings_[i];
+    Tagged<Object> o = old_strings_[i];
     // Dont finalize thin strings.
-    if (o.IsThinString()) continue;
+    if (IsThinString(o)) continue;
     heap_->FinalizeExternalString(ExternalString::cast(o));
   }
   old_strings_.clear();
@@ -6499,6 +6491,10 @@ size_t Heap::OldArrayBufferBytes() {
 StrongRootsEntry* Heap::RegisterStrongRoots(const char* label,
                                             FullObjectSlot start,
                                             FullObjectSlot end) {
+  // We're either on the main thread, or in a background thread with an active
+  // local heap.
+  DCHECK(isolate()->CurrentLocalHeap()->IsRunning());
+
   base::MutexGuard guard(&strong_roots_mutex_);
 
   StrongRootsEntry* entry = new StrongRootsEntry(label);
@@ -6523,6 +6519,10 @@ void Heap::UpdateStrongRoots(StrongRootsEntry* entry, FullObjectSlot start,
 }
 
 void Heap::UnregisterStrongRoots(StrongRootsEntry* entry) {
+  // We're either on the main thread, or in a background thread with an active
+  // local heap.
+  DCHECK(isolate()->CurrentLocalHeap()->IsRunning());
+
   base::MutexGuard guard(&strong_roots_mutex_);
 
   StrongRootsEntry* prev = entry->prev;
@@ -6539,11 +6539,11 @@ void Heap::UnregisterStrongRoots(StrongRootsEntry* entry) {
   delete entry;
 }
 
-void Heap::SetBuiltinsConstantsTable(FixedArray cache) {
+void Heap::SetBuiltinsConstantsTable(Tagged<FixedArray> cache) {
   set_builtins_constants_table(cache);
 }
 
-void Heap::SetDetachedContexts(WeakArrayList detached_contexts) {
+void Heap::SetDetachedContexts(Tagged<WeakArrayList> detached_contexts) {
   set_detached_contexts(detached_contexts);
 }
 
@@ -6553,34 +6553,33 @@ void Heap::PostFinalizationRegistryCleanupTaskIfNeeded() {
       is_finalization_registry_cleanup_task_posted_) {
     return;
   }
-  auto taskrunner = V8::GetCurrentPlatform()->GetForegroundTaskRunner(
-      reinterpret_cast<v8::Isolate*>(isolate()));
   auto task = std::make_unique<FinalizationRegistryCleanupTask>(this);
-  taskrunner->PostNonNestableTask(std::move(task));
+  task_runner_->PostNonNestableTask(std::move(task));
   is_finalization_registry_cleanup_task_posted_ = true;
 }
 
 void Heap::EnqueueDirtyJSFinalizationRegistry(
-    JSFinalizationRegistry finalization_registry,
-    std::function<void(HeapObject object, ObjectSlot slot, Object target)>
+    Tagged<JSFinalizationRegistry> finalization_registry,
+    std::function<void(Tagged<HeapObject> object, ObjectSlot slot,
+                       Tagged<Object> target)>
         gc_notify_updated_slot) {
   // Add a FinalizationRegistry to the tail of the dirty list.
   DCHECK(!HasDirtyJSFinalizationRegistries() ||
-         dirty_js_finalization_registries_list().IsJSFinalizationRegistry());
-  DCHECK(finalization_registry.next_dirty().IsUndefined(isolate()));
-  DCHECK(!finalization_registry.scheduled_for_cleanup());
-  finalization_registry.set_scheduled_for_cleanup(true);
-  if (dirty_js_finalization_registries_list_tail().IsUndefined(isolate())) {
-    DCHECK(dirty_js_finalization_registries_list().IsUndefined(isolate()));
+         IsJSFinalizationRegistry(dirty_js_finalization_registries_list()));
+  DCHECK(IsUndefined(finalization_registry->next_dirty(), isolate()));
+  DCHECK(!finalization_registry->scheduled_for_cleanup());
+  finalization_registry->set_scheduled_for_cleanup(true);
+  if (IsUndefined(dirty_js_finalization_registries_list_tail(), isolate())) {
+    DCHECK(IsUndefined(dirty_js_finalization_registries_list(), isolate()));
     set_dirty_js_finalization_registries_list(finalization_registry);
     // dirty_js_finalization_registries_list_ is rescanned by
     // ProcessWeakListRoots.
   } else {
-    JSFinalizationRegistry tail = JSFinalizationRegistry::cast(
+    Tagged<JSFinalizationRegistry> tail = Tagged<JSFinalizationRegistry>::cast(
         dirty_js_finalization_registries_list_tail());
-    tail.set_next_dirty(finalization_registry);
+    tail->set_next_dirty(finalization_registry);
     gc_notify_updated_slot(
-        tail, tail.RawField(JSFinalizationRegistry::kNextDirtyOffset),
+        tail, tail->RawField(JSFinalizationRegistry::kNextDirtyOffset),
         finalization_registry);
   }
   set_dirty_js_finalization_registries_list_tail(finalization_registry);
@@ -6605,40 +6604,41 @@ MaybeHandle<JSFinalizationRegistry> Heap::DequeueDirtyJSFinalizationRegistry() {
   return {};
 }
 
-void Heap::RemoveDirtyFinalizationRegistriesOnContext(NativeContext context) {
+void Heap::RemoveDirtyFinalizationRegistriesOnContext(
+    Tagged<NativeContext> context) {
   DisallowGarbageCollection no_gc;
 
   Isolate* isolate = this->isolate();
-  Object prev = ReadOnlyRoots(isolate).undefined_value();
-  Object current = dirty_js_finalization_registries_list();
-  while (!current.IsUndefined(isolate)) {
-    JSFinalizationRegistry finalization_registry =
-        JSFinalizationRegistry::cast(current);
-    if (finalization_registry.native_context() == context) {
-      if (prev.IsUndefined(isolate)) {
+  Tagged<Object> prev = ReadOnlyRoots(isolate).undefined_value();
+  Tagged<Object> current = dirty_js_finalization_registries_list();
+  while (!IsUndefined(current, isolate)) {
+    Tagged<JSFinalizationRegistry> finalization_registry =
+        Tagged<JSFinalizationRegistry>::cast(current);
+    if (finalization_registry->native_context() == context) {
+      if (IsUndefined(prev, isolate)) {
         set_dirty_js_finalization_registries_list(
-            finalization_registry.next_dirty());
+            finalization_registry->next_dirty());
       } else {
-        JSFinalizationRegistry::cast(prev).set_next_dirty(
-            finalization_registry.next_dirty());
+        Tagged<JSFinalizationRegistry>::cast(prev)->set_next_dirty(
+            finalization_registry->next_dirty());
       }
-      finalization_registry.set_scheduled_for_cleanup(false);
-      current = finalization_registry.next_dirty();
-      finalization_registry.set_next_dirty(
+      finalization_registry->set_scheduled_for_cleanup(false);
+      current = finalization_registry->next_dirty();
+      finalization_registry->set_next_dirty(
           ReadOnlyRoots(isolate).undefined_value());
     } else {
       prev = current;
-      current = finalization_registry.next_dirty();
+      current = finalization_registry->next_dirty();
     }
   }
   set_dirty_js_finalization_registries_list_tail(prev);
 }
 
 void Heap::KeepDuringJob(Handle<HeapObject> target) {
-  DCHECK(weak_refs_keep_during_job().IsUndefined() ||
-         weak_refs_keep_during_job().IsOrderedHashSet());
+  DCHECK(IsUndefined(weak_refs_keep_during_job()) ||
+         IsOrderedHashSet(weak_refs_keep_during_job()));
   Handle<OrderedHashSet> table;
-  if (weak_refs_keep_during_job().IsUndefined(isolate())) {
+  if (IsUndefined(weak_refs_keep_during_job(), isolate())) {
     table = isolate()->factory()->NewOrderedHashSet();
   } else {
     table =
@@ -6694,43 +6694,44 @@ bool Heap::GetObjectTypeName(size_t index, const char** object_type,
 
 size_t Heap::NumberOfNativeContexts() {
   int result = 0;
-  Object context = native_contexts_list();
-  while (!context.IsUndefined(isolate())) {
+  Tagged<Object> context = native_contexts_list();
+  while (!IsUndefined(context, isolate())) {
     ++result;
-    Context native_context = Context::cast(context);
-    context = native_context.next_context_link();
+    Tagged<Context> native_context = Tagged<Context>::cast(context);
+    context = native_context->next_context_link();
   }
   return result;
 }
 
 std::vector<Handle<NativeContext>> Heap::FindAllNativeContexts() {
   std::vector<Handle<NativeContext>> result;
-  Object context = native_contexts_list();
-  while (!context.IsUndefined(isolate())) {
-    NativeContext native_context = NativeContext::cast(context);
+  Tagged<Object> context = native_contexts_list();
+  while (!IsUndefined(context, isolate())) {
+    Tagged<NativeContext> native_context = Tagged<NativeContext>::cast(context);
     result.push_back(handle(native_context, isolate()));
-    context = native_context.next_context_link();
+    context = native_context->next_context_link();
   }
   return result;
 }
 
 std::vector<WeakArrayList> Heap::FindAllRetainedMaps() {
   std::vector<WeakArrayList> result;
-  Object context = native_contexts_list();
-  while (!context.IsUndefined(isolate())) {
-    NativeContext native_context = NativeContext::cast(context);
-    result.push_back(WeakArrayList::cast(native_context.retained_maps()));
-    context = native_context.next_context_link();
+  Tagged<Object> context = native_contexts_list();
+  while (!IsUndefined(context, isolate())) {
+    Tagged<NativeContext> native_context = Tagged<NativeContext>::cast(context);
+    result.push_back(WeakArrayList::cast(native_context->retained_maps()));
+    context = native_context->next_context_link();
   }
   return result;
 }
 
 size_t Heap::NumberOfDetachedContexts() {
   // The detached_contexts() array has two entries per detached context.
-  return detached_contexts().length() / 2;
+  return detached_contexts()->length() / 2;
 }
 
-bool Heap::AllowedToBeMigrated(Map map, HeapObject obj, AllocationSpace dst) {
+bool Heap::AllowedToBeMigrated(Tagged<Map> map, Tagged<HeapObject> obj,
+                               AllocationSpace dst) {
   // Object migration is governed by the following rules:
   //
   // 1) Objects in new-space can be migrated to the old space
@@ -6744,7 +6745,7 @@ bool Heap::AllowedToBeMigrated(Map map, HeapObject obj, AllocationSpace dst) {
   // Since this function is used for debugging only, we do not place
   // asserts here, but check everything explicitly.
   if (map == ReadOnlyRoots(this).one_pointer_filler_map()) return false;
-  InstanceType type = map.instance_type();
+  InstanceType type = map->instance_type();
   MemoryChunk* chunk = MemoryChunk::FromHeapObject(obj);
   AllocationSpace src = chunk->owner_identity();
   switch (src) {
@@ -6780,39 +6781,39 @@ void Heap::CreateObjectStats() {
   }
 }
 
-Map Heap::GcSafeMapOfHeapObject(HeapObject object) {
+Tagged<Map> Heap::GcSafeMapOfHeapObject(Tagged<HeapObject> object) {
   PtrComprCageBase cage_base(isolate());
-  MapWord map_word = object.map_word(cage_base, kRelaxedLoad);
+  MapWord map_word = object->map_word(cage_base, kRelaxedLoad);
   if (map_word.IsForwardingAddress()) {
-    return map_word.ToForwardingAddress(object).map(cage_base);
+    return map_word.ToForwardingAddress(object)->map(cage_base);
   }
   return map_word.ToMap();
 }
 
-GcSafeCode Heap::GcSafeGetCodeFromInstructionStream(
-    HeapObject instruction_stream, Address inner_pointer) {
-  InstructionStream istream =
+Tagged<GcSafeCode> Heap::GcSafeGetCodeFromInstructionStream(
+    Tagged<HeapObject> instruction_stream, Address inner_pointer) {
+  Tagged<InstructionStream> istream =
       InstructionStream::unchecked_cast(instruction_stream);
   DCHECK(!istream.is_null());
   DCHECK(GcSafeInstructionStreamContains(istream, inner_pointer));
-  return GcSafeCode::unchecked_cast(istream.raw_code(kAcquireLoad));
+  return GcSafeCode::unchecked_cast(istream->raw_code(kAcquireLoad));
 }
 
-bool Heap::GcSafeInstructionStreamContains(InstructionStream istream,
+bool Heap::GcSafeInstructionStreamContains(Tagged<InstructionStream> istream,
                                            Address addr) {
-  Map map = GcSafeMapOfHeapObject(istream);
+  Tagged<Map> map = GcSafeMapOfHeapObject(istream);
   DCHECK_EQ(map, ReadOnlyRoots(this).instruction_stream_map());
 
   Builtin builtin_lookup_result =
       OffHeapInstructionStream::TryLookupCode(isolate(), addr);
   if (Builtins::IsBuiltinId(builtin_lookup_result)) {
     // Builtins don't have InstructionStream objects.
-    DCHECK(!Builtins::IsBuiltinId(istream.code(kAcquireLoad).builtin_id()));
+    DCHECK(!Builtins::IsBuiltinId(istream->code(kAcquireLoad)->builtin_id()));
     return false;
   }
 
   Address start = istream.address();
-  Address end = start + istream.SizeFromMap(map);
+  Address end = start + istream->SizeFromMap(map);
   return start <= addr && addr < end;
 }
 
@@ -6823,21 +6824,10 @@ Heap::GcSafeTryFindInstructionStreamForInnerPointer(Address inner_pointer) {
     return InstructionStream::unchecked_cast(HeapObject::FromAddress(start));
   }
 
-  // Check if the inner pointer points into a large object chunk.
-  LargePage* large_page = code_lo_space()->FindPage(inner_pointer);
-  if (large_page != nullptr) {
-    return InstructionStream::unchecked_cast(large_page->GetObject());
-  }
-
-  if (V8_LIKELY(code_space()->Contains(inner_pointer))) {
-    // Iterate through the page until we reach the end or find an object
-    // starting after the inner pointer.
-    Page* page = Page::FromAddress(inner_pointer);
-
-    Address start =
-        page->GetCodeObjectRegistry()->GetCodeObjectStartFromInnerAddress(
-            inner_pointer);
-    return InstructionStream::unchecked_cast(HeapObject::FromAddress(start));
+  base::Optional<Address> start =
+      ThreadIsolation::StartOfJitAllocationAt(inner_pointer);
+  if (start.has_value()) {
+    return InstructionStream::unchecked_cast(HeapObject::FromAddress(*start));
   }
 
   return {};
@@ -6858,11 +6848,11 @@ base::Optional<GcSafeCode> Heap::GcSafeTryFindCodeForInnerPointer(
   return GcSafeGetCodeFromInstructionStream(*maybe_istream, inner_pointer);
 }
 
-Code Heap::FindCodeForInnerPointer(Address inner_pointer) {
-  return GcSafeFindCodeForInnerPointer(inner_pointer).UnsafeCastToCode();
+Tagged<Code> Heap::FindCodeForInnerPointer(Address inner_pointer) {
+  return GcSafeFindCodeForInnerPointer(inner_pointer)->UnsafeCastToCode();
 }
 
-GcSafeCode Heap::GcSafeFindCodeForInnerPointer(Address inner_pointer) {
+Tagged<GcSafeCode> Heap::GcSafeFindCodeForInnerPointer(Address inner_pointer) {
   base::Optional<GcSafeCode> maybe_code =
       GcSafeTryFindCodeForInnerPointer(inner_pointer);
   // Callers expect that the code object is found.
@@ -6884,24 +6874,23 @@ base::Optional<Code> Heap::TryFindCodeForInnerPointerForPrinting(
   return {};
 }
 
-void Heap::CombinedGenerationalAndSharedBarrierSlow(HeapObject object,
+void Heap::CombinedGenerationalAndSharedBarrierSlow(Tagged<HeapObject> object,
                                                     Address slot,
-                                                    HeapObject value) {
+                                                    Tagged<HeapObject> value) {
   MemoryChunk* value_chunk = MemoryChunk::FromHeapObject(value);
 
   if (value_chunk->InYoungGeneration()) {
-    DCHECK_NULL(LocalHeap::Current());
     Heap::GenerationalBarrierSlow(object, slot, value);
 
   } else {
     DCHECK(value_chunk->InWritableSharedSpace());
-    DCHECK(!object.InWritableSharedSpace());
+    DCHECK(!object->InWritableSharedSpace());
     Heap::SharedHeapBarrierSlow(object, slot);
   }
 }
 
 void Heap::CombinedGenerationalAndSharedEphemeronBarrierSlow(
-    EphemeronHashTable table, Address slot, HeapObject value) {
+    Tagged<EphemeronHashTable> table, Address slot, Tagged<HeapObject> value) {
   MemoryChunk* value_chunk = MemoryChunk::FromHeapObject(value);
 
   if (value_chunk->InYoungGeneration()) {
@@ -6910,44 +6899,38 @@ void Heap::CombinedGenerationalAndSharedEphemeronBarrierSlow(
 
   } else {
     DCHECK(value_chunk->InWritableSharedSpace());
-    DCHECK(!table.InWritableSharedSpace());
+    DCHECK(!table->InWritableSharedSpace());
     Heap::SharedHeapBarrierSlow(table, slot);
   }
 }
 
-void Heap::GenerationalBarrierSlow(HeapObject object, Address slot,
-                                   HeapObject value) {
+void Heap::GenerationalBarrierSlow(Tagged<HeapObject> object, Address slot,
+                                   Tagged<HeapObject> value) {
   MemoryChunk* chunk = MemoryChunk::FromHeapObject(object);
-  RememberedSet<OLD_TO_NEW>::Insert<AccessMode::NON_ATOMIC>(chunk, slot);
+  if (LocalHeap::Current() == nullptr) {
+    RememberedSet<OLD_TO_NEW>::Insert<AccessMode::NON_ATOMIC>(chunk, slot);
+  } else {
+    RememberedSet<OLD_TO_NEW_BACKGROUND>::Insert<AccessMode::ATOMIC>(chunk,
+                                                                     slot);
+  }
 }
 
-void Heap::SharedHeapBarrierSlow(HeapObject object, Address slot) {
+void Heap::SharedHeapBarrierSlow(Tagged<HeapObject> object, Address slot) {
   MemoryChunk* chunk = MemoryChunk::FromHeapObject(object);
   DCHECK(!chunk->InWritableSharedSpace());
   RememberedSet<OLD_TO_SHARED>::Insert<AccessMode::ATOMIC>(chunk, slot);
 }
 
-void Heap::RecordEphemeronKeyWrite(EphemeronHashTable table, Address slot) {
-  DCHECK(ObjectInYoungGeneration(HeapObjectSlot(slot).ToHeapObject()));
-  if (v8_flags.minor_mc) {
-    // Minor MC lacks support for specialized generational ephemeron barriers.
-    // The regular write barrier works as well but keeps more memory alive.
-    // TODO(v8:12612): Add support to MinorMC.
-    MemoryChunk* chunk = MemoryChunk::FromHeapObject(table);
-    RememberedSet<OLD_TO_NEW>::Insert<AccessMode::NON_ATOMIC>(chunk, slot);
-  } else {
-    int slot_index = EphemeronHashTable::SlotToIndex(table.address(), slot);
-    InternalIndex entry = EphemeronHashTable::IndexToEntry(slot_index);
-    auto it =
-        ephemeron_remembered_set_.insert({table, std::unordered_set<int>()});
-    it.first->second.insert(entry.as_int());
-  }
+void Heap::RecordEphemeronKeyWrite(Tagged<EphemeronHashTable> table,
+                                   Address slot) {
+  ephemeron_remembered_set_->RecordEphemeronKeyWrite(table, slot);
 }
 
 void Heap::EphemeronKeyWriteBarrierFromCode(Address raw_object,
                                             Address key_slot_address,
                                             Isolate* isolate) {
-  EphemeronHashTable table = EphemeronHashTable::cast(Object(raw_object));
+  Tagged<EphemeronHashTable> table =
+      Tagged<EphemeronHashTable>::cast(Tagged<Object>(raw_object));
   ObjectSlot key_slot(key_slot_address);
   CombinedEphemeronWriteBarrier(table, key_slot, *key_slot,
                                 UPDATE_WRITE_BARRIER);
@@ -6960,8 +6943,9 @@ enum RangeWriteBarrierMode {
 };
 
 template <int kModeMask, typename TSlot>
-void Heap::WriteBarrierForRangeImpl(MemoryChunk* source_page, HeapObject object,
-                                    TSlot start_slot, TSlot end_slot) {
+void Heap::WriteBarrierForRangeImpl(MemoryChunk* source_page,
+                                    Tagged<HeapObject> object, TSlot start_slot,
+                                    TSlot end_slot) {
   // At least one of generational or marking write barrier should be requested.
   static_assert(kModeMask & (kDoGenerationalOrShared | kDoMarking));
   // kDoEvacuationSlotRecording implies kDoMarking.
@@ -6978,7 +6962,7 @@ void Heap::WriteBarrierForRangeImpl(MemoryChunk* source_page, HeapObject object,
 
   for (TSlot slot = start_slot; slot < end_slot; ++slot) {
     typename TSlot::TObject value = *slot;
-    HeapObject value_heap_object;
+    Tagged<HeapObject> value_heap_object;
     if (!value.GetHeapObject(&value_heap_object)) continue;
 
     if (kModeMask & kDoGenerationalOrShared) {
@@ -7002,20 +6986,22 @@ void Heap::WriteBarrierForRangeImpl(MemoryChunk* source_page, HeapObject object,
 }
 
 // Instantiate Heap::WriteBarrierForRange() for ObjectSlot and MaybeObjectSlot.
-template void Heap::WriteBarrierForRange<ObjectSlot>(HeapObject object,
+template void Heap::WriteBarrierForRange<ObjectSlot>(Tagged<HeapObject> object,
                                                      ObjectSlot start_slot,
                                                      ObjectSlot end_slot);
 template void Heap::WriteBarrierForRange<MaybeObjectSlot>(
-    HeapObject object, MaybeObjectSlot start_slot, MaybeObjectSlot end_slot);
+    Tagged<HeapObject> object, MaybeObjectSlot start_slot,
+    MaybeObjectSlot end_slot);
 
 template <typename TSlot>
-void Heap::WriteBarrierForRange(HeapObject object, TSlot start_slot,
+void Heap::WriteBarrierForRange(Tagged<HeapObject> object, TSlot start_slot,
                                 TSlot end_slot) {
   if (v8_flags.disable_write_barriers) return;
   MemoryChunk* source_page = MemoryChunk::FromHeapObject(object);
   base::Flags<RangeWriteBarrierMode> mode;
 
-  if (!source_page->InYoungGeneration()) {
+  if (!source_page->InYoungGeneration() &&
+      !source_page->InWritableSharedSpace()) {
     mode |= kDoGenerationalOrShared;
   }
 
@@ -7060,16 +7046,19 @@ void Heap::WriteBarrierForRange(HeapObject object, TSlot start_slot,
   }
 }
 
-void Heap::GenerationalBarrierForCodeSlow(RelocInfo* rinfo, HeapObject object) {
+void Heap::GenerationalBarrierForCodeSlow(Tagged<InstructionStream> host,
+                                          RelocInfo* rinfo,
+                                          Tagged<HeapObject> object) {
   DCHECK(InYoungGeneration(object));
   const MarkCompactCollector::RecordRelocSlotInfo info =
-      MarkCompactCollector::ProcessRelocInfo(rinfo, object);
+      MarkCompactCollector::ProcessRelocInfo(host, rinfo, object);
 
+  base::MutexGuard write_scope(info.memory_chunk->mutex());
   RememberedSet<OLD_TO_NEW>::InsertTyped(info.memory_chunk, info.slot_type,
                                          info.offset);
 }
 
-bool Heap::PageFlagsAreConsistent(HeapObject object) {
+bool Heap::PageFlagsAreConsistent(Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
     return true;
   }
@@ -7174,8 +7163,8 @@ void Heap::set_allocation_timeout(int allocation_timeout) {
 #endif  // V8_ENABLE_ALLOCATION_TIMEOUT
 
 void Heap::FinishSweepingIfOutOfWork() {
-  if (sweeper()->sweeping_in_progress() && v8_flags.concurrent_sweeping &&
-      !sweeper()->AreSweeperTasksRunning()) {
+  if (sweeper()->major_sweeping_in_progress() && v8_flags.concurrent_sweeping &&
+      !sweeper()->AreMajorSweeperTasksRunning()) {
     // At this point we know that all concurrent sweeping tasks have run
     // out of work and quit: all pages are swept. The main thread still needs
     // to complete sweeping though.
@@ -7192,20 +7181,23 @@ void Heap::EnsureSweepingCompleted(SweepingForcedFinalizationMode mode) {
   CompleteArrayBufferSweeping(this);
 
   if (sweeper()->sweeping_in_progress()) {
-    // Get the scope id before finishing sweeping since it will be reset
-    // afterwards.
-    const auto new_space_sweeping_scope_id =
-        sweeper()->GetTracingScopeForCompleteYoungSweep();
-
-    sweeper()->EnsureCompleted();
-
-    if (v8_flags.minor_mc && new_space()) {
-      TRACE_GC_EPOCH(tracer(), new_space_sweeping_scope_id, ThreadKind::kMain);
+    bool was_minor_sweeping_in_progress = minor_sweeping_in_progress();
+    sweeper()->EnsureMajorCompleted();
+
+    if (v8_flags.minor_ms && new_space() && was_minor_sweeping_in_progress) {
+      TRACE_GC_EPOCH_WITH_FLOW(
+          tracer(), GCTracer::Scope::MINOR_MS_COMPLETE_SWEEPING,
+          ThreadKind::kMain,
+          sweeper_->GetTraceIdForFlowEvent(
+              GCTracer::Scope::MINOR_MS_COMPLETE_SWEEPING),
+          TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
       paged_new_space()->paged_space()->RefillFreeList();
     }
 
-    TRACE_GC_EPOCH(tracer(), GCTracer::Scope::MC_COMPLETE_SWEEPING,
-                   ThreadKind::kMain);
+    TRACE_GC_EPOCH_WITH_FLOW(
+        tracer(), GCTracer::Scope::MC_COMPLETE_SWEEPING, ThreadKind::kMain,
+        sweeper_->GetTraceIdForFlowEvent(GCTracer::Scope::MC_COMPLETE_SWEEPING),
+        TRACE_EVENT_FLAG_FLOW_IN);
     old_space()->RefillFreeList();
     {
       CodePageHeaderModificationScope rwx_write_scope(
@@ -7221,7 +7213,7 @@ void Heap::EnsureSweepingCompleted(SweepingForcedFinalizationMode mode) {
 
 #ifdef VERIFY_HEAP
     if (v8_flags.verify_heap) {
-      FullEvacuationVerifier verifier(this);
+      EvacuationVerifier verifier(this);
       verifier.Run();
     }
 #endif
@@ -7239,26 +7231,24 @@ void Heap::EnsureSweepingCompleted(SweepingForcedFinalizationMode mode) {
       !tracer()->IsSweepingInProgress());
 }
 
-void Heap::PauseSweepingAndEnsureYoungSweepingCompleted() {
-  if (!sweeper()->sweeping_in_progress()) return;
-  TRACE_GC_EPOCH(tracer(), sweeper()->GetTracingScopeForCompleteYoungSweep(),
-                 ThreadKind::kMain);
+void Heap::EnsureYoungSweepingCompleted() {
+  if (!sweeper()->minor_sweeping_in_progress()) return;
+
+  TRACE_GC_EPOCH_WITH_FLOW(
+      tracer(), GCTracer::Scope::MINOR_MS_COMPLETE_SWEEPING, ThreadKind::kMain,
+      sweeper_->GetTraceIdForFlowEvent(
+          GCTracer::Scope::MINOR_MS_COMPLETE_SWEEPING),
+      TRACE_EVENT_FLAG_FLOW_IN);
 
-  sweeper()->PauseAndEnsureNewSpaceCompleted();
+  sweeper()->EnsureMinorCompleted();
   paged_new_space()->paged_space()->RefillFreeList();
+  old_space()->RefillFreeList();
 
   tracer()->NotifyYoungSweepingCompleted();
-
-#ifdef VERIFY_HEAP
-  if (v8_flags.verify_heap) {
-    YoungGenerationEvacuationVerifier verifier(this);
-    verifier.Run();
-  }
-#endif
 }
 
 void Heap::DrainSweepingWorklistForSpace(AllocationSpace space) {
-  if (!sweeper()->sweeping_in_progress()) return;
+  if (!sweeper()->sweeping_in_progress_for_space(space)) return;
   sweeper()->DrainSweepingWorklistForSpace(space);
 }
 
@@ -7291,5 +7281,69 @@ CppClassNamesAsHeapObjectNameScope::CppClassNamesAsHeapObjectNameScope(
 CppClassNamesAsHeapObjectNameScope::~CppClassNamesAsHeapObjectNameScope() =
     default;
 
+#if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
+
+CodePageMemoryModificationScopeForDebugging::
+    CodePageMemoryModificationScopeForDebugging(Heap* heap,
+                                                VirtualMemory* reservation,
+                                                base::AddressRegion region)
+    : rwx_write_scope_("Write access for zapping.") {
+#if !defined(DEBUG) && !defined(VERIFY_HEAP)
+  UNREACHABLE();
+#endif
+}
+
+CodePageMemoryModificationScopeForDebugging::
+    CodePageMemoryModificationScopeForDebugging(BasicMemoryChunk* chunk)
+    : rwx_write_scope_("Write access for zapping.") {
+#if !defined(DEBUG) && !defined(VERIFY_HEAP)
+  UNREACHABLE();
+#endif
+}
+
+CodePageMemoryModificationScopeForDebugging::
+    ~CodePageMemoryModificationScopeForDebugging() {}
+
+#else  // V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT ||
+       // V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
+
+CodePageMemoryModificationScopeForDebugging::
+    CodePageMemoryModificationScopeForDebugging(Heap* heap,
+                                                VirtualMemory* reservation,
+                                                base::AddressRegion region) {
+#if !defined(DEBUG) && !defined(VERIFY_HEAP)
+  UNREACHABLE();
+#else
+  if (heap->write_protect_code_memory()) {
+    reservation_ = reservation;
+    region_.emplace(region);
+    CHECK(reservation_->SetPermissions(
+        region_->begin(), region_->size(),
+        MemoryChunk::GetCodeModificationPermission()));
+  }
+#endif
+}
+
+CodePageMemoryModificationScopeForDebugging::
+    CodePageMemoryModificationScopeForDebugging(BasicMemoryChunk* chunk)
+    : memory_modification_scope_(chunk) {
+#if !defined(DEBUG) && !defined(VERIFY_HEAP)
+  UNREACHABLE();
+#endif
+}
+
+CodePageMemoryModificationScopeForDebugging::
+    ~CodePageMemoryModificationScopeForDebugging() {
+  if (reservation_) {
+    DCHECK(region_.has_value());
+    CHECK(reservation_->SetPermissions(
+        region_->begin(), region_->size(),
+        v8_flags.jitless ? PageAllocator::Permission::kRead
+                         : PageAllocator::Permission::kReadExecute));
+  }
+}
+
+#endif
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/heap.h b/deps/v8/src/heap/heap.h
index f4b7d40362473d..7da06e6048ee59 100644
--- a/deps/v8/src/heap/heap.h
+++ b/deps/v8/src/heap/heap.h
@@ -31,6 +31,7 @@
 #include "src/heap/gc-callbacks.h"
 #include "src/heap/heap-allocator.h"
 #include "src/heap/marking-state.h"
+#include "src/heap/minor-gc-job.h"
 #include "src/heap/pretenuring-handler.h"
 #include "src/heap/sweeper.h"
 #include "src/init/heap-symbols.h"
@@ -43,23 +44,19 @@
 #include "src/objects/smi.h"
 #include "src/objects/visitors.h"
 #include "src/roots/roots.h"
+#include "src/sandbox/code-pointer-table.h"
+#include "src/sandbox/external-pointer-table.h"
 #include "src/utils/allocation.h"
 #include "testing/gtest/include/gtest/gtest_prod.h"  // nogncheck
 
-namespace cppgc {
-namespace internal {
-
+namespace cppgc::internal {
 enum class HeapObjectNameForUnnamedObject : uint8_t;
 class ClassNameAsHeapObjectNameScope;
+}  // namespace cppgc::internal
 
-}  // namespace internal
-}  // namespace cppgc
-
-namespace heap {
-namespace base {
+namespace heap::base {
 class Stack;
-}  // namespace base
-}  // namespace heap
+}  // namespace heap::base
 
 namespace v8 {
 
@@ -70,7 +67,6 @@ using OutOfMemoryCallback = void (*)(void* data);
 namespace internal {
 
 namespace heap {
-
 class HeapTester;
 class TestMemoryAllocatorScope;
 }  // namespace heap
@@ -80,40 +76,39 @@ class Heap;
 class Impl;
 }  // namespace third_party_heap
 
-class IncrementalMarking;
-class BackingStore;
-class JSArrayBuffer;
-class JSPromise;
-class NativeContext;
-
-using v8::MemoryPressureLevel;
-
 class ArrayBufferCollector;
 class ArrayBufferSweeper;
+class BackingStore;
 class BasicMemoryChunk;
+class Boolean;
 class CodeLargeObjectSpace;
 class CodeRange;
 class CollectionBarrier;
 class ConcurrentAllocator;
 class ConcurrentMarking;
 class CppHeap;
+class EphemeronRememberedSet;
 class GCIdleTimeHandler;
 class GCIdleTimeHeapState;
 class GCTracer;
+class IncrementalMarking;
 class IsolateSafepoint;
 class HeapObjectAllocationTracker;
 class HeapObjectsFilter;
 class HeapStats;
 class Isolate;
+class JSArrayBuffer;
 class JSFinalizationRegistry;
+class JSPromise;
 class LinearAllocationArea;
 class LocalHeap;
 class MemoryAllocator;
+class MemoryBalancer;
 class MemoryChunk;
 class MemoryMeasurement;
 class MemoryReducer;
-class MinorGCJob;
-class MinorMarkCompactCollector;
+class MinorMarkSweepCollector;
+class NativeContext;
 class NopRwxMemoryWriteScope;
 class ObjectIterator;
 class ObjectStats;
@@ -134,49 +129,27 @@ class StressScavengeObserver;
 class TimedHistogram;
 class WeakObjectRetainer;
 
-enum ArrayStorageAllocationMode {
-  DONT_INITIALIZE_ARRAY_ELEMENTS,
-  INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE
-};
-
 enum class ClearRecordedSlots { kYes, kNo };
 
-enum class UpdateInvalidatedObjectSize { kYes, kNo };
-
 enum class InvalidateRecordedSlots { kYes, kNo };
 
 enum class ClearFreedMemoryMode { kClearFreedMemory, kDontClearFreedMemory };
 
 enum class RetainingPathOption { kDefault, kTrackEphemeronPath };
 
-enum class YoungGenerationHandling {
-  kRegularScavenge = 0,
-  kFastPromotionDuringScavenge = 1,
-  // Histogram::InspectConstructionArguments in chromium requires us to have at
-  // least three buckets.
-  kUnusedBucket = 2,
-  // If you add new items here, then update the young_generation_handling in
-  // counters.h.
-  // Also update src/tools/metrics/histograms/histograms.xml in chromium.
-};
-
 enum class GCIdleTimeAction : uint8_t;
 
 enum class SkipRoot {
   kExternalStringTable,
   kGlobalHandles,
+  kTracedHandles,
   kOldGeneration,
   kStack,
   kMainThreadHandles,
   kUnserializable,
   kWeak,
   kConservativeStack,
-  kTopOfStack,
-};
-
-enum UnprotectMemoryOrigin {
-  kMainThread,
-  kMaybeOffMainThread,
+  kReadOnlyBuiltins,
 };
 
 class StrongRootsEntry final {
@@ -207,30 +180,32 @@ struct CommentStatistic {
 };
 #endif
 
-using EphemeronRememberedSet =
-    std::unordered_map<EphemeronHashTable, std::unordered_set<int>,
-                       Object::Hasher>;
-
 // An alias for std::unordered_map<HeapObject, T> which also sets proper
 // Hash and KeyEqual functions.
 template <typename T>
 using UnorderedHeapObjectMap =
     std::unordered_map<HeapObject, T, Object::Hasher, Object::KeyEqualSafe>;
 
-class Heap {
- public:
-  // Stores ephemeron entries where the EphemeronHashTable is in old-space,
-  // and the key of the entry is in new-space. Such keys do not appear in the
-  // usual OLD_TO_NEW remembered set.
-  EphemeronRememberedSet ephemeron_remembered_set_;
+enum class GCFlag : uint8_t {
+  kNoFlags = 0,
+  kReduceMemoryFootprint = 1 << 0,
+  // GCs that are forced, either through testing configurations (requiring
+  // --expose-gc) or through DevTools (using LowMemoryNotification).
+  kForced = 1 << 1,
+};
+
+using GCFlags = base::Flags<GCFlag, uint8_t>;
+DEFINE_OPERATORS_FOR_FLAGS(GCFlags)
 
+class Heap final {
+ public:
   enum class HeapGrowingMode { kSlow, kConservative, kMinimal, kDefault };
 
   enum HeapState {
     NOT_IN_GC,
     SCAVENGE,
     MARK_COMPACT,
-    MINOR_MARK_COMPACT,
+    MINOR_MARK_SWEEP,
     TEAR_DOWN
   };
 
@@ -333,53 +308,21 @@ class Heap {
 
   // These constants control heap configuration based on the physical memory.
   static constexpr size_t kPhysicalMemoryToOldGenerationRatio = 4;
-  // Young generation size is the same for compressed heaps and 32-bit heaps.
-  static constexpr size_t kOldGenerationToSemiSpaceRatio =
-      128 * kHeapLimitMultiplier / kPointerMultiplier;
-  static constexpr size_t kOldGenerationToSemiSpaceRatioLowMemory =
-      256 * kHeapLimitMultiplier / kPointerMultiplier;
   static constexpr size_t kOldGenerationLowMemory =
       128 * MB * kHeapLimitMultiplier;
   static constexpr size_t kNewLargeObjectSpaceToSemiSpaceRatio = 1;
-#if ENABLE_HUGEPAGE
-  static constexpr size_t kMinSemiSpaceSize =
-      kHugePageSize * kPointerMultiplier;
-  static constexpr size_t kMaxSemiSpaceSize =
-      kHugePageSize * 16 * kPointerMultiplier;
-#else
-  static constexpr size_t kMinSemiSpaceSize = 512 * KB * kPointerMultiplier;
-  static constexpr size_t kMaxSemiSpaceSize = 8192 * KB * kPointerMultiplier;
-#endif
-
-  static_assert(kMinSemiSpaceSize % (1 << kPageSizeBits) == 0);
-  static_assert(kMaxSemiSpaceSize % (1 << kPageSizeBits) == 0);
 
   static const int kTraceRingBufferSize = 512;
   static const int kStacktraceBufferSize = 512;
 
-  static const int kNoGCFlags = 0;
-  static const int kReduceMemoryFootprintMask = 1;
-  // GCs that are forced, either through testing configurations (requiring
-  // --expose-gc) or through DevTools (using LowMemoryNotification).
-  static const int kForcedGC = 2;
-
   // The minimum size of a HeapObject on the heap.
   static const int kMinObjectSizeInTaggedWords = 2;
 
-  static const int kMinPromotedPercentForFastPromotionMode = 90;
-
-  static_assert(static_cast<int>(RootIndex::kUndefinedValue) ==
-                Internals::kUndefinedValueRootIndex);
-  static_assert(static_cast<int>(RootIndex::kTheHoleValue) ==
-                Internals::kTheHoleValueRootIndex);
-  static_assert(static_cast<int>(RootIndex::kNullValue) ==
-                Internals::kNullValueRootIndex);
-  static_assert(static_cast<int>(RootIndex::kTrueValue) ==
-                Internals::kTrueValueRootIndex);
-  static_assert(static_cast<int>(RootIndex::kFalseValue) ==
-                Internals::kFalseValueRootIndex);
-  static_assert(static_cast<int>(RootIndex::kempty_string) ==
-                Internals::kEmptyStringRootIndex);
+  static size_t DefaultMinSemiSpaceSize();
+  V8_EXPORT_PRIVATE static size_t DefaultMaxSemiSpaceSize();
+  // Young generation size is the same for compressed heaps and 32-bit heaps.
+  static size_t OldGenerationToSemiSpaceRatio();
+  static size_t OldGenerationToSemiSpaceRatioLowMemory();
 
   // Calculates the maximum amount of filler that could be required by the
   // given alignment.
@@ -394,68 +337,26 @@ class Heap {
   // writable and reserved to contain unwind information.
   static size_t GetCodeRangeReservedAreaSize();
 
-  [[noreturn]] void FatalProcessOutOfMemory(const char* location);
+  [[noreturn]] V8_EXPORT_PRIVATE void FatalProcessOutOfMemory(
+      const char* location);
 
   // Checks whether the space is valid.
   static bool IsValidAllocationSpace(AllocationSpace space);
 
-  // Zapping is needed for verify heap, and always done in debug builds.
-  static inline bool ShouldZapGarbage() {
-#ifdef DEBUG
-    return true;
-#else
-#ifdef VERIFY_HEAP
-    return v8_flags.verify_heap;
-#else
-    return false;
-#endif
-#endif
-  }
-
   // Helper function to get the bytecode flushing mode based on the flags. This
   // is required because it is not safe to access flags in concurrent marker.
   static inline base::EnumSet<CodeFlushMode> GetCodeFlushMode(Isolate* isolate);
 
-  static uintptr_t ZapValue() {
-    return v8_flags.clear_free_memory ? kClearedFreeMemoryValue : kZapValue;
-  }
-
   static inline bool IsYoungGenerationCollector(GarbageCollector collector) {
     return collector == GarbageCollector::SCAVENGER ||
-           collector == GarbageCollector::MINOR_MARK_COMPACTOR;
+           collector == GarbageCollector::MINOR_MARK_SWEEPER;
   }
 
   static inline GarbageCollector YoungGenerationCollector() {
-    return (v8_flags.minor_mc) ? GarbageCollector::MINOR_MARK_COMPACTOR
+    return (v8_flags.minor_ms) ? GarbageCollector::MINOR_MARK_SWEEPER
                                : GarbageCollector::SCAVENGER;
   }
 
-  static inline const char* CollectorName(GarbageCollector collector) {
-    switch (collector) {
-      case GarbageCollector::SCAVENGER:
-        return "Scavenger";
-      case GarbageCollector::MARK_COMPACTOR:
-        return "Mark-Compact";
-      case GarbageCollector::MINOR_MARK_COMPACTOR:
-        return "Minor Mark-Compact";
-    }
-    return "Unknown collector";
-  }
-
-  static inline const char* CollectorName(v8::GCType gc_type) {
-    switch (gc_type) {
-      case kGCTypeScavenge:
-        return "Scavenger";
-      case kGCTypeMarkSweepCompact:
-        return "Mark-Compact";
-      case kGCTypeMinorMarkCompact:
-        return "Minor Mark-Compact";
-      default:
-        break;
-    }
-    return "Unknown collector";
-  }
-
   // Copy block of memory from src to dst. Size of block should be aligned
   // by pointer size.
   static inline void CopyBlock(Address dst, Address src, int byte_size);
@@ -463,30 +364,35 @@ class Heap {
   // Executes generational and/or marking write barrier for a [start, end) range
   // of non-weak slots inside |object|.
   template <typename TSlot>
-  V8_EXPORT_PRIVATE void WriteBarrierForRange(HeapObject object, TSlot start,
-                                              TSlot end);
+  V8_EXPORT_PRIVATE void WriteBarrierForRange(Tagged<HeapObject> object,
+                                              TSlot start, TSlot end);
 
   // Implements slow path of both generational & shared heap barrier.
   V8_EXPORT_PRIVATE static void CombinedGenerationalAndSharedBarrierSlow(
-      HeapObject object, Address slot, HeapObject value);
+      Tagged<HeapObject> object, Address slot, Tagged<HeapObject> value);
   V8_EXPORT_PRIVATE static void
-  CombinedGenerationalAndSharedEphemeronBarrierSlow(EphemeronHashTable table,
-                                                    Address slot,
-                                                    HeapObject value);
+  CombinedGenerationalAndSharedEphemeronBarrierSlow(
+      Tagged<EphemeronHashTable> table, Address slot, Tagged<HeapObject> value);
 
-  V8_EXPORT_PRIVATE static void GenerationalBarrierSlow(HeapObject object,
-                                                        Address slot,
-                                                        HeapObject value);
+  V8_EXPORT_PRIVATE static void GenerationalBarrierSlow(
+      Tagged<HeapObject> object, Address slot, Tagged<HeapObject> value);
 
-  V8_EXPORT_PRIVATE static void SharedHeapBarrierSlow(HeapObject object,
+  V8_EXPORT_PRIVATE static void SharedHeapBarrierSlow(Tagged<HeapObject> object,
                                                       Address slot);
+  V8_EXPORT_PRIVATE static void GenerationalBarrierForCodeSlow(
+      Tagged<InstructionStream> host, RelocInfo* rinfo,
+      Tagged<HeapObject> value);
+  V8_EXPORT_PRIVATE static bool PageFlagsAreConsistent(
+      Tagged<HeapObject> object);
+
   V8_EXPORT_PRIVATE inline void RecordEphemeronKeyWrite(
-      EphemeronHashTable table, Address key_slot);
+      Tagged<EphemeronHashTable> table, Address key_slot);
   V8_EXPORT_PRIVATE static void EphemeronKeyWriteBarrierFromCode(
       Address raw_object, Address address, Isolate* isolate);
-  V8_EXPORT_PRIVATE static void GenerationalBarrierForCodeSlow(
-      RelocInfo* rinfo, HeapObject value);
-  V8_EXPORT_PRIVATE static bool PageFlagsAreConsistent(HeapObject object);
+
+  EphemeronRememberedSet* ephemeron_remembered_set() {
+    return ephemeron_remembered_set_.get();
+  }
 
   // Notifies the heap that is ok to start marking or other activities that
   // should not happen during deserialization.
@@ -501,6 +407,8 @@ class Heap {
   void NotifyBootstrapComplete();
 
   void NotifyOldGenerationExpansion(AllocationSpace space, MemoryChunk* chunk);
+  void NotifyOldGenerationExpansionBackground(AllocationSpace space,
+                                              MemoryChunk* chunk);
 
   inline Address* NewSpaceAllocationTopAddress();
   inline Address* NewSpaceAllocationLimitAddress();
@@ -509,18 +417,19 @@ class Heap {
 
   size_t NewSpaceSize();
   size_t NewSpaceCapacity() const;
+  size_t NewSpaceTargetCapacity() const;
 
   // Move len non-weak tagged elements from src_slot to dst_slot of dst_object.
   // The source and destination memory ranges can overlap.
-  V8_EXPORT_PRIVATE void MoveRange(HeapObject dst_object, ObjectSlot dst_slot,
-                                   ObjectSlot src_slot, int len,
-                                   WriteBarrierMode mode);
+  V8_EXPORT_PRIVATE void MoveRange(Tagged<HeapObject> dst_object,
+                                   ObjectSlot dst_slot, ObjectSlot src_slot,
+                                   int len, WriteBarrierMode mode);
 
   // Copy len non-weak tagged elements from src_slot to dst_slot of dst_object.
   // The source and destination memory ranges must not overlap.
   template <typename TSlot>
-  void CopyRange(HeapObject dst_object, TSlot dst_slot, TSlot src_slot, int len,
-                 WriteBarrierMode mode);
+  void CopyRange(Tagged<HeapObject> dst_object, TSlot dst_slot, TSlot src_slot,
+                 int len, WriteBarrierMode mode);
 
   // Initialize a filler object to keep the ability to iterate over the heap
   // when introducing gaps within pages. This method will verify that no slots
@@ -541,53 +450,57 @@ class Heap {
   void CreateFillerObjectAtSweeper(Address addr, int size);
 
   template <typename T>
-  void CreateFillerForArray(T object, int elements_to_trim, int bytes_to_trim);
+  void CreateFillerForArray(Tagged<T> object, int elements_to_trim,
+                            int bytes_to_trim);
 
-  bool CanMoveObjectStart(HeapObject object);
+  bool CanMoveObjectStart(Tagged<HeapObject> object);
 
-  bool IsImmovable(HeapObject object);
+  bool IsImmovable(Tagged<HeapObject> object);
 
-  V8_EXPORT_PRIVATE static bool IsLargeObject(HeapObject object);
+  V8_EXPORT_PRIVATE static bool IsLargeObject(Tagged<HeapObject> object);
 
   // Trim the given array from the left. Note that this relocates the object
   // start and hence is only valid if there is only a single reference to it.
-  V8_EXPORT_PRIVATE FixedArrayBase LeftTrimFixedArray(FixedArrayBase obj,
-                                                      int elements_to_trim);
+  V8_EXPORT_PRIVATE Tagged<FixedArrayBase> LeftTrimFixedArray(
+      Tagged<FixedArrayBase> obj, int elements_to_trim);
 
   // Trim the given array from the right.
-  V8_EXPORT_PRIVATE void RightTrimFixedArray(FixedArrayBase obj,
+  V8_EXPORT_PRIVATE void RightTrimFixedArray(Tagged<FixedArrayBase> obj,
                                              int elements_to_trim);
-  void RightTrimWeakFixedArray(WeakFixedArray obj, int elements_to_trim);
+  void RightTrimWeakFixedArray(Tagged<WeakFixedArray> obj,
+                               int elements_to_trim);
 
   // Converts the given boolean condition to JavaScript boolean value.
-  inline Oddball ToBoolean(bool condition);
+  inline Tagged<Boolean> ToBoolean(bool condition);
 
-  // Notify the heap that a context has been disposed.
-  V8_EXPORT_PRIVATE int NotifyContextDisposed(bool dependant_context);
+  // Notify the heap that a context has been disposed. `has_dependent_context`
+  // implies that a top-level context (no dependent contexts) has been disposed.
+  V8_EXPORT_PRIVATE int NotifyContextDisposed(bool has_dependent_context);
 
-  void set_native_contexts_list(Object object) {
+  void set_native_contexts_list(Tagged<Object> object) {
     native_contexts_list_.store(object.ptr(), std::memory_order_release);
   }
 
-  Object native_contexts_list() const {
-    return Object(native_contexts_list_.load(std::memory_order_acquire));
+  Tagged<Object> native_contexts_list() const {
+    return Tagged<Object>(
+        native_contexts_list_.load(std::memory_order_acquire));
   }
 
-  void set_allocation_sites_list(Object object) {
+  void set_allocation_sites_list(Tagged<Object> object) {
     allocation_sites_list_ = object;
   }
-  Object allocation_sites_list() { return allocation_sites_list_; }
+  Tagged<Object> allocation_sites_list() { return allocation_sites_list_; }
 
-  void set_dirty_js_finalization_registries_list(Object object) {
+  void set_dirty_js_finalization_registries_list(Tagged<Object> object) {
     dirty_js_finalization_registries_list_ = object;
   }
-  Object dirty_js_finalization_registries_list() {
+  Tagged<Object> dirty_js_finalization_registries_list() {
     return dirty_js_finalization_registries_list_;
   }
-  void set_dirty_js_finalization_registries_list_tail(Object object) {
+  void set_dirty_js_finalization_registries_list_tail(Tagged<Object> object) {
     dirty_js_finalization_registries_list_tail_ = object;
   }
-  Object dirty_js_finalization_registries_list_tail() {
+  Tagged<Object> dirty_js_finalization_registries_list_tail() {
     return dirty_js_finalization_registries_list_tail_;
   }
 
@@ -599,14 +512,16 @@ class Heap {
   // Traverse all the allocation_sites [nested_site and weak_next] in the list
   // and foreach call the visitor
   void ForeachAllocationSite(
-      Object list, const std::function<void(AllocationSite)>& visitor);
+      Tagged<Object> list,
+      const std::function<void(Tagged<AllocationSite>)>& visitor);
 
   // Number of mark-sweeps.
   int ms_count() const { return ms_count_; }
 
   // Checks whether the given object is allowed to be migrated from it's
   // current space into the given destination space. Used for debugging.
-  bool AllowedToBeMigrated(Map map, HeapObject object, AllocationSpace dest);
+  bool AllowedToBeMigrated(Tagged<Map> map, Tagged<HeapObject> object,
+                           AllocationSpace dest);
 
   void CheckHandleCount();
 
@@ -636,29 +551,6 @@ class Heap {
     return write_protect_code_memory_;
   }
 
-  uintptr_t code_space_memory_modification_scope_depth() {
-    return code_space_memory_modification_scope_depth_;
-  }
-
-  void increment_code_space_memory_modification_scope_depth() {
-    code_space_memory_modification_scope_depth_++;
-  }
-
-  void decrement_code_space_memory_modification_scope_depth() {
-    code_space_memory_modification_scope_depth_--;
-  }
-
-  void UnprotectAndRegisterMemoryChunk(MemoryChunk* chunk,
-                                       UnprotectMemoryOrigin origin);
-  V8_EXPORT_PRIVATE void UnprotectAndRegisterMemoryChunk(
-      HeapObject object, UnprotectMemoryOrigin origin);
-  void UnregisterUnprotectedMemoryChunk(MemoryChunk* chunk);
-  V8_EXPORT_PRIVATE void ProtectUnprotectedMemoryChunks();
-
-  inline void IncrementCodePageCollectionMemoryModificationScopeDepth();
-  inline bool DecrementCodePageCollectionMemoryModificationScopeDepth();
-  inline uintptr_t code_page_collection_memory_modification_scope_depth();
-
   inline HeapState gc_state() const {
     return gc_state_.load(std::memory_order_relaxed);
   }
@@ -680,6 +572,8 @@ class Heap {
   bool IsGCWithStack() const;
   V8_EXPORT_PRIVATE void ForceSharedGCWithEmptyStackForTesting();
 
+  bool CanShortcutStringsDuringGC(GarbageCollector collector) const;
+
   // Performs GC after background allocation failure.
   void CollectGarbageForBackground(LocalHeap* local_heap);
 
@@ -694,8 +588,8 @@ class Heap {
   bool IdleNotification(double deadline_in_seconds);
   bool IdleNotification(int idle_time_in_ms);
 
-  V8_EXPORT_PRIVATE void MemoryPressureNotification(MemoryPressureLevel level,
-                                                    bool is_isolate_locked);
+  V8_EXPORT_PRIVATE void MemoryPressureNotification(
+      v8::MemoryPressureLevel level, bool is_isolate_locked);
   void CheckMemoryPressure();
 
   V8_EXPORT_PRIVATE void AddNearHeapLimitCallback(v8::NearHeapLimitCallback,
@@ -705,9 +599,9 @@ class Heap {
   V8_EXPORT_PRIVATE void AutomaticallyRestoreInitialHeapLimit(
       double threshold_percent);
 
-  void AppendArrayBufferExtension(JSArrayBuffer object,
+  void AppendArrayBufferExtension(Tagged<JSArrayBuffer> object,
                                   ArrayBufferExtension* extension);
-  void DetachArrayBufferExtension(JSArrayBuffer object,
+  void DetachArrayBufferExtension(Tagged<JSArrayBuffer> object,
                                   ArrayBufferExtension* extension);
 
   IsolateSafepoint* safepoint() { return safepoint_.get(); }
@@ -735,8 +629,8 @@ class Heap {
   inline int NextDebuggingId();
   inline int GetNextTemplateSerialNumber();
 
-  void SetSerializedObjects(FixedArray objects);
-  void SetSerializedGlobalProxySizes(FixedArray sizes);
+  void SetSerializedObjects(Tagged<FixedArray> objects);
+  void SetSerializedGlobalProxySizes(Tagged<FixedArray> sizes);
 
   void SetBasicBlockProfilingData(Handle<ArrayList> list);
 
@@ -762,7 +656,8 @@ class Heap {
                                         Handle<Map> map);
 
   // This event is triggered after object is moved to a new place.
-  void OnMoveEvent(HeapObject source, HeapObject target, int size_in_bytes);
+  void OnMoveEvent(Tagged<HeapObject> source, Tagged<HeapObject> target,
+                   int size_in_bytes);
 
   bool deserialization_complete() const { return deserialization_complete_; }
 
@@ -780,7 +675,7 @@ class Heap {
 
   bool HighMemoryPressure() {
     return memory_pressure_level_.load(std::memory_order_relaxed) !=
-           MemoryPressureLevel::kNone;
+           v8::MemoryPressureLevel::kNone;
   }
 
   bool CollectionRequested();
@@ -790,7 +685,7 @@ class Heap {
   void RestoreHeapLimit(size_t heap_limit) {
     // Do not set the limit lower than the live size + some slack.
     size_t min_limit = SizeOfObjects() + SizeOfObjects() / 4;
-    set_max_old_generation_size(
+    SetOldGenerationAndGlobalMaximumSize(
         std::min(max_old_generation_size(), std::max(heap_limit, min_limit)));
   }
 
@@ -875,6 +770,19 @@ class Heap {
   inline PagedSpace* paged_space(int idx) const;
   inline Space* space(int idx) const;
 
+#ifdef V8_COMPRESS_POINTERS
+  ExternalPointerTable::Space* external_pointer_space() {
+    return &external_pointer_space_;
+  }
+  ExternalPointerTable::Space* read_only_external_pointer_space() {
+    return &read_only_external_pointer_space_;
+  }
+#endif  // V8_COMPRESS_POINTERS
+
+#ifdef V8_CODE_POINTER_SANDBOXING
+  CodePointerTable::Space* code_pointer_space() { return &code_pointer_space_; }
+#endif  // V8_CODE_POINTER_SANDBOXING
+
   // ===========================================================================
   // Getters to other components. ==============================================
   // ===========================================================================
@@ -898,8 +806,8 @@ class Heap {
     return mark_compact_collector_.get();
   }
 
-  MinorMarkCompactCollector* minor_mark_compact_collector() {
-    return minor_mark_compact_collector_.get();
+  MinorMarkSweepCollector* minor_mark_sweep_collector() {
+    return minor_mark_sweep_collector_.get();
   }
 
   Sweeper* sweeper() { return sweeper_.get(); }
@@ -935,17 +843,18 @@ class Heap {
   V8_INLINE RootsTable& roots_table();
 
 // Heap root getters.
-#define ROOT_ACCESSOR(type, name, CamelName) inline type name();
+#define ROOT_ACCESSOR(type, name, CamelName) inline Tagged<type> name();
   MUTABLE_ROOT_LIST(ROOT_ACCESSOR)
 #undef ROOT_ACCESSOR
 
-  V8_INLINE FixedArray single_character_string_table();
+  V8_INLINE Tagged<FixedArray> single_character_string_table();
 
-  V8_INLINE void SetRootMaterializedObjects(FixedArray objects);
-  V8_INLINE void SetRootScriptList(Object value);
-  V8_INLINE void SetRootNoScriptSharedFunctionInfos(Object value);
-  V8_INLINE void SetMessageListeners(TemplateList value);
-  V8_INLINE void SetFunctionsMarkedForManualOptimization(Object bytecode);
+  V8_INLINE void SetRootMaterializedObjects(Tagged<FixedArray> objects);
+  V8_INLINE void SetRootScriptList(Tagged<Object> value);
+  V8_INLINE void SetRootNoScriptSharedFunctionInfos(Tagged<Object> value);
+  V8_INLINE void SetMessageListeners(Tagged<ArrayList> value);
+  V8_INLINE void SetFunctionsMarkedForManualOptimization(
+      Tagged<Object> bytecode);
 
   StrongRootsEntry* RegisterStrongRoots(const char* label, FullObjectSlot start,
                                         FullObjectSlot end);
@@ -953,12 +862,13 @@ class Heap {
   void UpdateStrongRoots(StrongRootsEntry* entry, FullObjectSlot start,
                          FullObjectSlot end);
 
-  void SetBuiltinsConstantsTable(FixedArray cache);
-  void SetDetachedContexts(WeakArrayList detached_contexts);
+  void SetBuiltinsConstantsTable(Tagged<FixedArray> cache);
+  void SetDetachedContexts(Tagged<WeakArrayList> detached_contexts);
 
   void EnqueueDirtyJSFinalizationRegistry(
-      JSFinalizationRegistry finalization_registry,
-      std::function<void(HeapObject object, ObjectSlot slot, Object target)>
+      Tagged<JSFinalizationRegistry> finalization_registry,
+      std::function<void(Tagged<HeapObject> object, ObjectSlot slot,
+                         Tagged<Object> target)>
           gc_notify_updated_slot);
 
   MaybeHandle<JSFinalizationRegistry> DequeueDirtyJSFinalizationRegistry();
@@ -967,7 +877,8 @@ class Heap {
   // FinalizationRegistries with {context} from the dirty list when the context
   // e.g. navigates away or is detached. If the dirty list is empty afterwards,
   // the cleanup task is aborted if needed.
-  void RemoveDirtyFinalizationRegistriesOnContext(NativeContext context);
+  void RemoveDirtyFinalizationRegistriesOnContext(
+      Tagged<NativeContext> context);
 
   inline bool HasDirtyJSFinalizationRegistries();
 
@@ -1005,10 +916,11 @@ class Heap {
 
   // Performs a full garbage collection.
   V8_EXPORT_PRIVATE void CollectAllGarbage(
-      int flags, GarbageCollectionReason gc_reason,
+      GCFlags gc_flags, GarbageCollectionReason gc_reason,
       const GCCallbackFlags gc_callback_flags = kNoGCCallbackFlags);
 
-  // Last hope GC, should try to squeeze as much as possible.
+  // Last hope garbage collection. Will try to free as much memory as possible
+  // with multiple rounds of garbage collection.
   V8_EXPORT_PRIVATE void CollectAllAvailableGarbage(
       GarbageCollectionReason gc_reason);
 
@@ -1016,7 +928,7 @@ class Heap {
   // incremental marking before performing an atomic garbage collection.
   // Only use if absolutely necessary or in tests to avoid floating garbage!
   V8_EXPORT_PRIVATE void PreciseCollectAllGarbage(
-      int flags, GarbageCollectionReason gc_reason,
+      GCFlags gc_flags, GarbageCollectionReason gc_reason,
       const GCCallbackFlags gc_callback_flags = kNoGCCallbackFlags);
 
   // Performs garbage collection operation for the shared heap.
@@ -1048,13 +960,19 @@ class Heap {
   // Iterators. ================================================================
   // ===========================================================================
 
+  // In the case of shared GC, kMainIsolate is used for the main isolate and
+  // kClientIsolate for the (other) client isolates.
+  enum class IterateRootsMode { kMainIsolate, kClientIsolate };
+
   // None of these methods iterate over the read-only roots. To do this use
   // ReadOnlyRoots::Iterate. Read-only root iteration is not necessary for
   // garbage collection and is usually only performed as part of
   // (de)serialization or heap verification.
 
   // Iterates over the strong roots and the weak roots.
-  void IterateRoots(RootVisitor* v, base::EnumSet<SkipRoot> options);
+  void IterateRoots(
+      RootVisitor* v, base::EnumSet<SkipRoot> options,
+      IterateRootsMode roots_mode = IterateRootsMode::kMainIsolate);
   void IterateRootsIncludingClients(RootVisitor* v,
                                     base::EnumSet<SkipRoot> options);
 
@@ -1068,10 +986,9 @@ class Heap {
 
   void IterateStackRoots(RootVisitor* v);
 
-  enum class ScanStackMode { kFromMarker, kComplete };
-  void IterateConservativeStackRoots(RootVisitor* v, ScanStackMode stack_mode);
-  void IterateConservativeStackRootsIncludingClients(RootVisitor* v,
-                                                     ScanStackMode stack_mode);
+  void IterateConservativeStackRoots(
+      RootVisitor* v,
+      IterateRootsMode roots_mode = IterateRootsMode::kMainIsolate);
 
   // ===========================================================================
   // Remembered set API. =======================================================
@@ -1081,12 +998,11 @@ class Heap {
   uint8_t* IsMarkingFlagAddress();
   uint8_t* IsMinorMarkingFlagAddress();
 
-  void ClearRecordedSlot(HeapObject object, ObjectSlot slot);
+  void ClearRecordedSlot(Tagged<HeapObject> object, ObjectSlot slot);
   void ClearRecordedSlotRange(Address start, Address end);
   static int InsertIntoRememberedSetFromCode(MemoryChunk* chunk, Address slot);
 
 #ifdef DEBUG
-  void VerifyClearedSlot(HeapObject object, ObjectSlot slot);
   void VerifySlotRangeHasNoRecordedSlots(Address start, Address end);
 #endif
 
@@ -1094,24 +1010,25 @@ class Heap {
   // Incremental marking API. ==================================================
   // ===========================================================================
 
-  int GCFlagsForIncrementalMarking() {
-    return ShouldOptimizeForMemoryUsage() ? kReduceMemoryFootprintMask
-                                          : kNoGCFlags;
+  GCFlags GCFlagsForIncrementalMarking() {
+    return ShouldOptimizeForMemoryUsage() ? GCFlag::kReduceMemoryFootprint
+                                          : GCFlag::kNoFlags;
   }
 
   // Starts incremental marking assuming incremental marking is currently
   // stopped.
   V8_EXPORT_PRIVATE void StartIncrementalMarking(
-      int gc_flags, GarbageCollectionReason gc_reason,
+      GCFlags gc_flags, GarbageCollectionReason gc_reason,
       GCCallbackFlags gc_callback_flags = GCCallbackFlags::kNoGCCallbackFlags,
       GarbageCollector collector = GarbageCollector::MARK_COMPACTOR);
 
+  V8_EXPORT_PRIVATE void StartIncrementalMarkingOnInterrupt();
+
   V8_EXPORT_PRIVATE void StartIncrementalMarkingIfAllocationLimitIsReached(
-      int gc_flags,
+      GCFlags gc_flags,
       GCCallbackFlags gc_callback_flags = GCCallbackFlags::kNoGCCallbackFlags);
   void StartIncrementalMarkingIfAllocationLimitIsReachedBackground();
 
-  void FinalizeIncrementalMarkingIfComplete(GarbageCollectionReason gc_reason);
   // Synchronously finalizes incremental marking.
   V8_EXPORT_PRIVATE void FinalizeIncrementalMarkingAtomically(
       GarbageCollectionReason gc_reason);
@@ -1120,7 +1037,7 @@ class Heap {
   void CompleteSweepingYoung();
 
   // Ensures that sweeping is finished for that object's page.
-  void EnsureSweepingCompletedForObject(HeapObject object);
+  void EnsureSweepingCompletedForObject(Tagged<HeapObject> object);
 
   IncrementalMarking* incremental_marking() const {
     return incremental_marking_.get();
@@ -1140,18 +1057,16 @@ class Heap {
   // InvalidateRecordedSlots::kNo if this is not necessary or to perform this
   // manually.
   void NotifyObjectLayoutChange(
-      HeapObject object, const DisallowGarbageCollection&,
+      Tagged<HeapObject> object, const DisallowGarbageCollection&,
       InvalidateRecordedSlots invalidate_recorded_slots, int new_size = 0);
-  V8_EXPORT_PRIVATE static void NotifyObjectLayoutChangeDone(HeapObject object);
+  V8_EXPORT_PRIVATE static void NotifyObjectLayoutChangeDone(
+      Tagged<HeapObject> object);
 
   // The runtime uses this function to inform the GC of object size changes. The
   // GC will fill this area with a filler object and might clear recorded slots
   // in that area.
-  void NotifyObjectSizeChange(
-      HeapObject, int old_size, int new_size,
-      ClearRecordedSlots clear_recorded_slots,
-      UpdateInvalidatedObjectSize update_invalidated_object_size =
-          UpdateInvalidatedObjectSize::kYes);
+  void NotifyObjectSizeChange(Tagged<HeapObject>, int old_size, int new_size,
+                              ClearRecordedSlots clear_recorded_slots);
 
   // ===========================================================================
   // Deoptimization support API. ===============================================
@@ -1193,18 +1108,19 @@ class Heap {
   // ===========================================================================
 
   // Registers an external string.
-  inline void RegisterExternalString(String string);
+  inline void RegisterExternalString(Tagged<String> string);
 
   // Called when a string's resource is changed. The size of the payload is sent
   // as argument of the method.
-  V8_EXPORT_PRIVATE void UpdateExternalString(String string, size_t old_payload,
+  V8_EXPORT_PRIVATE void UpdateExternalString(Tagged<String> string,
+                                              size_t old_payload,
                                               size_t new_payload);
 
   // Finalizes an external string by deleting the associated external
   // data and clearing the resource pointer.
-  inline void FinalizeExternalString(String string);
+  inline void FinalizeExternalString(Tagged<String> string);
 
-  static String UpdateYoungReferenceInExternalStringTableEntry(
+  static Tagged<String> UpdateYoungReferenceInExternalStringTableEntry(
       Heap* heap, FullObjectSlot pointer);
 
   // ===========================================================================
@@ -1212,26 +1128,26 @@ class Heap {
   // ===========================================================================
 
   // Returns whether the object resides in new space.
-  static inline bool InYoungGeneration(Object object);
+  static inline bool InYoungGeneration(Tagged<Object> object);
   static inline bool InYoungGeneration(MaybeObject object);
-  static inline bool InYoungGeneration(HeapObject heap_object);
-  static inline bool InFromPage(Object object);
+  static inline bool InYoungGeneration(Tagged<HeapObject> heap_object);
+  static inline bool InFromPage(Tagged<Object> object);
   static inline bool InFromPage(MaybeObject object);
-  static inline bool InFromPage(HeapObject heap_object);
-  static inline bool InToPage(Object object);
+  static inline bool InFromPage(Tagged<HeapObject> heap_object);
+  static inline bool InToPage(Tagged<Object> object);
   static inline bool InToPage(MaybeObject object);
-  static inline bool InToPage(HeapObject heap_object);
+  static inline bool InToPage(Tagged<HeapObject> heap_object);
 
   // Returns whether the object resides in old space.
-  inline bool InOldSpace(Object object);
+  inline bool InOldSpace(Tagged<Object> object);
 
   // Checks whether an address/object is in the non-read-only heap (including
   // auxiliary area and unused area). Use IsValidHeapObject if checking both
   // heaps is required.
-  V8_EXPORT_PRIVATE bool Contains(HeapObject value) const;
+  V8_EXPORT_PRIVATE bool Contains(Tagged<HeapObject> value) const;
   // Same as above, but checks whether the object resides in any of the code
   // spaces.
-  V8_EXPORT_PRIVATE bool ContainsCode(HeapObject value) const;
+  V8_EXPORT_PRIVATE bool ContainsCode(Tagged<HeapObject> value) const;
 
   // Checks whether object resides in the non-read-only shared heap.
   static inline bool InWritableSharedSpace(MaybeObject object);
@@ -1239,20 +1155,21 @@ class Heap {
   // Checks whether an address/object is in the non-read-only heap (including
   // auxiliary area and unused area). Use IsValidHeapObject if checking both
   // heaps is required.
-  V8_EXPORT_PRIVATE bool SharedHeapContains(HeapObject value) const;
+  V8_EXPORT_PRIVATE bool SharedHeapContains(Tagged<HeapObject> value) const;
 
   // Returns whether the object must be in the shared old space.
-  V8_EXPORT_PRIVATE bool MustBeInSharedOldSpace(HeapObject value);
+  V8_EXPORT_PRIVATE bool MustBeInSharedOldSpace(Tagged<HeapObject> value);
 
   // Checks whether an address/object in a space.
   // Currently used by tests, serialization and heap verification only.
-  V8_EXPORT_PRIVATE bool InSpace(HeapObject value, AllocationSpace space) const;
+  V8_EXPORT_PRIVATE bool InSpace(Tagged<HeapObject> value,
+                                 AllocationSpace space) const;
 
   // Slow methods that can be used for verification as they can also be used
   // with off-heap Addresses.
   V8_EXPORT_PRIVATE bool InSpaceSlow(Address addr, AllocationSpace space) const;
 
-  static inline Heap* FromWritableHeapObject(HeapObject obj);
+  static inline Heap* FromWritableHeapObject(Tagged<HeapObject> obj);
 
   // ===========================================================================
   // Object statistics tracking. ===============================================
@@ -1323,6 +1240,8 @@ class Heap {
   // Returns the capacity of the old generation.
   V8_EXPORT_PRIVATE size_t OldGenerationCapacity() const;
 
+  base::Mutex* heap_expansion_mutex() { return &heap_expansion_mutex_; }
+
   // Returns the amount of memory currently held alive by the unmapper.
   size_t CommittedMemoryOfUnmapper();
 
@@ -1484,15 +1403,21 @@ class Heap {
   // ===========================================================================
 
   // Creates a filler object and returns a heap object immediately after it.
-  V8_EXPORT_PRIVATE HeapObject PrecedeWithFiller(HeapObject object,
-                                                 int filler_size);
+  V8_EXPORT_PRIVATE Tagged<HeapObject> PrecedeWithFiller(
+      Tagged<HeapObject> object, int filler_size);
+
+  // Creates a filler object and returns a heap object immediately after it.
+  // Unlike `PrecedeWithFiller` this method will not perform slot verification
+  // since this would race on background threads.
+  V8_EXPORT_PRIVATE Tagged<HeapObject> PrecedeWithFillerBackground(
+      Tagged<HeapObject> object, int filler_size);
 
   // Creates a filler object if needed for alignment and returns a heap object
   // immediately after it. If any space is left after the returned object,
   // another filler object is created so the over allocated memory is iterable.
-  V8_WARN_UNUSED_RESULT HeapObject
-  AlignWithFiller(HeapObject object, int object_size, int allocation_size,
-                  AllocationAlignment alignment);
+  V8_WARN_UNUSED_RESULT Tagged<HeapObject> AlignWithFillerBackground(
+      Tagged<HeapObject> object, int object_size, int allocation_size,
+      AllocationAlignment alignment);
 
   // Allocate an external backing store with the given allocation callback.
   // If the callback fails (indicated by a nullptr result) then this function
@@ -1521,8 +1446,8 @@ class Heap {
   // Check if the given object was recently allocated and its fields may appear
   // as uninitialized to background threads.
   // This predicate may be invoked from a background thread.
-  inline bool IsPendingAllocation(HeapObject object);
-  inline bool IsPendingAllocation(Object object);
+  inline bool IsPendingAllocation(Tagged<HeapObject> object);
+  inline bool IsPendingAllocation(Tagged<Object> object);
 
   // Notifies that all previously allocated objects are properly initialized
   // and ensures that IsPendingAllocation returns false for them. This function
@@ -1556,9 +1481,9 @@ class Heap {
   // ===========================================================================
 
   // Searches for a Code object by the given interior pointer.
-  V8_EXPORT_PRIVATE Code FindCodeForInnerPointer(Address inner_pointer);
+  V8_EXPORT_PRIVATE Tagged<Code> FindCodeForInnerPointer(Address inner_pointer);
   // Use the GcSafe family of functions if called while GC is in progress.
-  GcSafeCode GcSafeFindCodeForInnerPointer(Address inner_pointer);
+  Tagged<GcSafeCode> GcSafeFindCodeForInnerPointer(Address inner_pointer);
   base::Optional<GcSafeCode> GcSafeTryFindCodeForInnerPointer(
       Address inner_pointer);
   base::Optional<InstructionStream>
@@ -1569,15 +1494,22 @@ class Heap {
 
   // Returns true if {addr} is contained within {instruction_stream} and false
   // otherwise. Mostly useful for debugging.
-  bool GcSafeInstructionStreamContains(InstructionStream instruction_stream,
-                                       Address addr);
+  bool GcSafeInstructionStreamContains(
+      Tagged<InstructionStream> instruction_stream, Address addr);
 
   // ===========================================================================
   // Sweeping. =================================================================
   // ===========================================================================
 
-  bool sweeping_in_progress() const {
-    return sweeper_ && sweeper_->sweeping_in_progress();
+  bool sweeping_in_progress() const { return sweeper_->sweeping_in_progress(); }
+  bool sweeping_in_progress_for_space(AllocationSpace space) const {
+    return sweeper_->sweeping_in_progress_for_space(space);
+  }
+  bool minor_sweeping_in_progress() const {
+    return sweeper_->minor_sweeping_in_progress();
+  }
+  bool major_sweeping_in_progress() const {
+    return sweeper_->major_sweeping_in_progress();
   }
 
   void FinishSweepingIfOutOfWork();
@@ -1589,7 +1521,7 @@ class Heap {
   // Note: Can only be called safely from main thread.
   V8_EXPORT_PRIVATE void EnsureSweepingCompleted(
       SweepingForcedFinalizationMode mode);
-  void PauseSweepingAndEnsureYoungSweepingCompleted();
+  void EnsureYoungSweepingCompleted();
 
   void DrainSweepingWorklistForSpace(AllocationSpace space);
 
@@ -1628,26 +1560,29 @@ class Heap {
     return result;
   }
 
-  void RegisterCodeObject(Handle<Code> code);
-
-  static const char* GarbageCollectionReasonToString(
-      GarbageCollectionReason gc_reason);
-
   // Calculates the nof entries for the full sized number to string cache.
   inline int MaxNumberToStringCacheSize() const;
 
-  static Isolate* GetIsolateFromWritableObject(HeapObject object);
+  static Isolate* GetIsolateFromWritableObject(Tagged<HeapObject> object);
 
   // Ensure that we have swept all spaces in such a way that we can iterate
   // over all objects.
   V8_EXPORT_PRIVATE void MakeHeapIterable();
 
+  // Free all LABs in the heap.
+  V8_EXPORT_PRIVATE void FreeLinearAllocationAreas();
+
   V8_EXPORT_PRIVATE bool CanPromoteYoungAndExpandOldGeneration(
       size_t size) const;
   V8_EXPORT_PRIVATE bool CanExpandOldGeneration(size_t size) const;
 
-  inline bool ShouldReduceMemory() const {
-    return (current_gc_flags_ & kReduceMemoryFootprintMask) != 0;
+  // Checks whether OldGenerationCapacity() can be expanded by `size` bytes and
+  // still fits into `max_old_generation_size_`.
+  V8_EXPORT_PRIVATE bool IsOldGenerationExpansionAllowed(
+      size_t size, const base::MutexGuard& expansion_mutex_witness) const;
+
+  bool ShouldReduceMemory() const {
+    return current_gc_flags_ & GCFlag::kReduceMemoryFootprint;
   }
 
   MarkingState* marking_state() { return &marking_state_; }
@@ -1656,17 +1591,22 @@ class Heap {
     return &non_atomic_marking_state_;
   }
 
-  AtomicMarkingState* atomic_marking_state() { return &atomic_marking_state_; }
-
   PretenuringHandler* pretenuring_handler() { return &pretenuring_handler_; }
 
   bool IsInlineAllocationEnabled() const { return inline_allocation_enabled_; }
 
+  // Returns the amount of external memory registered since last global gc.
+  V8_EXPORT_PRIVATE uint64_t AllocatedExternalMemorySinceMarkCompact() const;
+
+  std::shared_ptr<v8::TaskRunner> GetForegroundTaskRunner() const;
+
+  bool ShouldUseBackgroundThreads() const;
+
  private:
   class AllocationTrackerForDebugging;
 
-  using ExternalStringTableUpdaterCallback = String (*)(Heap* heap,
-                                                        FullObjectSlot pointer);
+  using ExternalStringTableUpdaterCallback =
+      Tagged<String> (*)(Heap* heap, FullObjectSlot pointer);
 
   // External strings table is a place where all external strings are
   // registered.  We need to keep track of such strings to properly
@@ -1678,8 +1618,8 @@ class Heap {
     ExternalStringTable& operator=(const ExternalStringTable&) = delete;
 
     // Registers an external string.
-    inline void AddString(String string);
-    bool Contains(String string);
+    inline void AddString(Tagged<String> string);
+    bool Contains(Tagged<String> string);
 
     void IterateAll(RootVisitor* v);
     void IterateYoung(RootVisitor* v);
@@ -1708,8 +1648,10 @@ class Heap {
 
     // To speed up scavenge collections young string are kept separate from old
     // strings.
-    std::vector<Object> young_strings_;
-    std::vector<Object> old_strings_;
+    std::vector<TaggedBase> young_strings_;
+    std::vector<TaggedBase> old_strings_;
+    // Used to protect access with --shared-string-table.
+    base::Mutex mutex_;
   };
 
   static const int kInitialEvalCacheSize = 64;
@@ -1734,16 +1676,11 @@ class Heap {
            AllocationType::kOld == allocation;
   }
 
-  static size_t DefaultGetExternallyAllocatedMemoryInBytesCallback() {
-    return 0;
-  }
-
-#define ROOT_ACCESSOR(type, name, CamelName) inline void set_##name(type value);
+#define ROOT_ACCESSOR(type, name, CamelName) \
+  inline void set_##name(Tagged<type> value);
   ROOT_LIST(ROOT_ACCESSOR)
 #undef ROOT_ACCESSOR
 
-  void set_current_gc_flags(int flags) { current_gc_flags_ = flags; }
-
   int NumberOfScavengeTasks();
 
   // Checks whether a global GC is necessary
@@ -1751,9 +1688,6 @@ class Heap {
                                           GarbageCollectionReason gc_reason,
                                           const char** reason) const;
 
-  // Free all LABs in the heap.
-  void FreeLinearAllocationAreas();
-
   // Frees all LABs owned by the main thread.
   void FreeMainThreadLinearAllocationAreas();
 
@@ -1775,23 +1709,17 @@ class Heap {
                                 GarbageCollectionReason gc_reason,
                                 const char* collector_reason);
 
-  inline void UpdateOldSpaceLimits();
-
+  // For static-roots builds, pads the object to the required size.
+  void StaticRootsEnsureAllocatedSize(Handle<HeapObject> obj, int required);
   bool CreateEarlyReadOnlyMaps();
   bool CreateImportantReadOnlyObjects();
-  bool CreateLateReadOnlyMaps();
+  bool CreateLateReadOnlyNonJSReceiverMaps();
+  bool CreateLateReadOnlyJSReceiverMaps();
   bool CreateReadOnlyObjects();
 
   void CreateInternalAccessorInfoObjects();
   void CreateInitialMutableObjects();
 
-  // Zaps the memory of a code object.
-  V8_EXPORT_PRIVATE void ZapCodeObject(Address start_address,
-                                       int size_in_bytes);
-
-  // Updates invalidated object size in all remembered sets.
-  void UpdateInvalidatedObjectSize(HeapObject object, int new_size);
-
   enum class VerifyNoSlotsRecorded { kYes, kNo };
 
   // Creates a filler object in the specified memory area. This method is the
@@ -1804,8 +1732,8 @@ class Heap {
   // Range write barrier implementation.
   template <int kModeMask, typename TSlot>
   V8_INLINE void WriteBarrierForRangeImpl(MemoryChunk* source_page,
-                                          HeapObject object, TSlot start_slot,
-                                          TSlot end_slot);
+                                          Tagged<HeapObject> object,
+                                          TSlot start_slot, TSlot end_slot);
 
   // Deopts all code that contains allocation instruction which are tenured or
   // not tenured. Moreover it clears the pretenuring allocation site statistics.
@@ -1822,7 +1750,9 @@ class Heap {
   // Flush the number to string cache.
   void FlushNumberStringCache();
 
-  void ConfigureInitialOldGenerationSize();
+  void ActivateMemoryReducerIfNeededOnMainThread();
+
+  void ShrinkOldGenerationAllocationLimitIfNotConfigured();
 
   double ComputeMutatorUtilization(const char* tag, double mutator_speed,
                                    double gc_speed);
@@ -1853,7 +1783,7 @@ class Heap {
   void AddToRingBuffer(const char* string);
   void GetFromRingBuffer(char* buffer);
 
-  void CompactRetainedMaps(WeakArrayList retained_maps);
+  void CompactRetainedMaps(Tagged<WeakArrayList> retained_maps);
 
   void CollectGarbageOnMemoryPressure();
 
@@ -1866,11 +1796,11 @@ class Heap {
 
   // Casts a heap object to an InstructionStream, DCHECKs that the
   // inner_pointer is within the object, and returns the attached Code object.
-  GcSafeCode GcSafeGetCodeFromInstructionStream(HeapObject instruction_stream,
-                                                Address inner_pointer);
+  Tagged<GcSafeCode> GcSafeGetCodeFromInstructionStream(
+      Tagged<HeapObject> instruction_stream, Address inner_pointer);
   // Returns the map of a HeapObject. Can be used during garbage collection,
   // i.e. it supports a forwarded map.
-  Map GcSafeMapOfHeapObject(HeapObject object);
+  Tagged<Map> GcSafeMapOfHeapObject(Tagged<HeapObject> object);
 
   // ===========================================================================
   // Actual GC. ================================================================
@@ -1887,7 +1817,7 @@ class Heap {
   // Performs a major collection in the whole heap.
   void MarkCompact();
   // Performs a minor collection of just the young generation.
-  void MinorMarkCompact();
+  void MinorMarkSweep();
 
   // Code to be run before and after mark-compact.
   void MarkCompactPrologue();
@@ -1920,12 +1850,7 @@ class Heap {
     return old_generation_allocation_limit() - static_cast<size_t>(bytes);
   }
 
-  void UpdateTotalGCTime(double duration);
-
-  bool MaximumSizeMinorGC() const { return maximum_size_minor_gcs_ > 0; }
-  bool IsFirstMaximumSizeMinorGC() const {
-    return maximum_size_minor_gcs_ == 1;
-  }
+  void UpdateTotalGCTime(base::TimeDelta duration);
 
   bool IsIneffectiveMarkCompact(size_t old_generation_size,
                                 double mutator_utilization);
@@ -1950,30 +1875,32 @@ class Heap {
   // v8 browsing benchmarks.
   static const int kMaxLoadTimeMs = 7000;
 
-  bool ShouldOptimizeForLoadTime();
+  V8_EXPORT_PRIVATE bool ShouldOptimizeForLoadTime();
 
   size_t old_generation_allocation_limit() const {
     return old_generation_allocation_limit_.load(std::memory_order_relaxed);
   }
 
-  void set_old_generation_allocation_limit(size_t newlimit) {
-    old_generation_allocation_limit_.store(newlimit, std::memory_order_relaxed);
-  }
-
   size_t global_allocation_limit() const { return global_allocation_limit_; }
 
   size_t max_old_generation_size() const {
     return max_old_generation_size_.load(std::memory_order_relaxed);
   }
 
-  void set_max_old_generation_size(size_t value) {
-    max_old_generation_size_.store(value, std::memory_order_relaxed);
-  }
+  size_t min_old_generation_size() const { return min_old_generation_size_; }
 
-  bool always_allocate() { return always_allocate_scope_count_ != 0; }
+  // Sets max_old_generation_size_ and computes the new global heap limit from
+  // it.
+  void SetOldGenerationAndGlobalMaximumSize(size_t max_old_generation_size);
+
+  // Sets allocation limits for both old generation and the global heap.
+  void SetOldGenerationAndGlobalAllocationLimit(
+      size_t new_old_generation_allocation_limit,
+      size_t new_global_allocation_limit);
 
-  V8_EXPORT_PRIVATE bool CanExpandOldGenerationBackground(LocalHeap* local_heap,
-                                                          size_t size);
+  void ResetOldGenerationAndGlobalAllocationLimit();
+
+  bool always_allocate() { return always_allocate_scope_count_ != 0; }
 
   bool ShouldExpandOldGenerationOnSlowAllocation(LocalHeap* local_heap,
                                                  AllocationOrigin origin);
@@ -2004,8 +1931,10 @@ class Heap {
   // ===========================================================================
 
   void ScheduleMinorGCTaskIfNeeded();
-  void StartMinorMCIncrementalMarkingIfNeeded();
-  bool MinorMCSizeTaskTriggerReached() const;
+  V8_EXPORT_PRIVATE void StartMinorMSIncrementalMarkingIfNeeded();
+  bool MinorMSSizeTaskTriggerReached() const;
+
+  MinorGCJob* minor_gc_job() { return minor_gc_job_.get(); }
 
   // ===========================================================================
   // Allocation methods. =======================================================
@@ -2033,10 +1962,10 @@ class Heap {
   // otherwise it falls back to a slower path indicated by the mode.
   enum AllocationRetryMode { kLightRetry, kRetryOrFail };
   template <AllocationRetryMode mode>
-  V8_WARN_UNUSED_RESULT V8_INLINE HeapObject
-  AllocateRawWith(int size, AllocationType allocation,
-                  AllocationOrigin origin = AllocationOrigin::kRuntime,
-                  AllocationAlignment alignment = kTaggedAligned);
+  V8_WARN_UNUSED_RESULT V8_INLINE Tagged<HeapObject> AllocateRawWith(
+      int size, AllocationType allocation,
+      AllocationOrigin origin = AllocationOrigin::kRuntime,
+      AllocationAlignment alignment = kTaggedAligned);
 
   // Call AllocateRawWith with kRetryOrFail. Matches the method in LocalHeap.
   V8_WARN_UNUSED_RESULT inline Address AllocateRawOrFail(
@@ -2052,7 +1981,7 @@ class Heap {
   V8_WARN_UNUSED_RESULT AllocationResult
   AllocatePartialMap(InstanceType instance_type, int instance_size);
 
-  void FinalizePartialMap(Map map);
+  void FinalizePartialMap(Tagged<Map> map);
 
   void set_force_oom(bool value) { force_oom_ = value; }
   void set_force_gc_on_next_allocation() {
@@ -2060,19 +1989,22 @@ class Heap {
   }
 
   // Helper for IsPendingAllocation.
-  inline bool IsPendingAllocationInternal(HeapObject object);
+  inline bool IsPendingAllocationInternal(Tagged<HeapObject> object);
 
   // ===========================================================================
   // Retaining path tracing ====================================================
   // ===========================================================================
 
-  void AddRetainer(HeapObject retainer, HeapObject object);
-  void AddEphemeronRetainer(HeapObject retainer, HeapObject object);
-  void AddRetainingRoot(Root root, HeapObject object);
+  void AddRetainer(Tagged<HeapObject> retainer, Tagged<HeapObject> object);
+  void AddEphemeronRetainer(Tagged<HeapObject> retainer,
+                            Tagged<HeapObject> object);
+  void AddRetainingRoot(Root root, Tagged<HeapObject> object);
   // Returns true if the given object is a target of retaining path tracking.
   // Stores the option corresponding to the object in the provided *option.
-  bool IsRetainingPathTarget(HeapObject object, RetainingPathOption* option);
-  void PrintRetainingPath(HeapObject object, RetainingPathOption option);
+  bool IsRetainingPathTarget(Tagged<HeapObject> object,
+                             RetainingPathOption* option);
+  void PrintRetainingPath(Tagged<HeapObject> object,
+                          RetainingPathOption option);
   void UpdateRetainersAfterScavenge();
 
 #ifdef DEBUG
@@ -2119,7 +2051,17 @@ class Heap {
   size_t initial_max_old_generation_size_ = 0;
   size_t initial_max_old_generation_size_threshold_ = 0;
   size_t initial_old_generation_size_ = 0;
-  bool old_generation_size_configured_ = false;
+
+  // Before the first full GC the old generation allocation limit is considered
+  // to be *not* configured (unless initial limits were provided by the
+  // embedder). In this mode V8 starts with a very large old generation
+  // allocation limit initially. Minor GCs may then shrink this initial limit
+  // down until the first full GC computes a proper old generation allocation
+  // limit in Heap::RecomputeLimits. The old generation allocation limit is then
+  // considered to be configured for all subsequent GCs. After the first full GC
+  // this field is only ever reset for top context disposals.
+  bool old_generation_allocation_limit_configured_ = false;
+
   size_t maximum_committed_ = 0;
   size_t old_generation_capacity_after_bootstrap_ = 0;
 
@@ -2138,7 +2080,7 @@ class Heap {
 
   // Stores the memory pressure level that set by MemoryPressureNotification
   // and reset by a mark-compact garbage collection.
-  std::atomic<MemoryPressureLevel> memory_pressure_level_;
+  std::atomic<v8::MemoryPressureLevel> memory_pressure_level_;
 
   std::vector<std::pair<v8::NearHeapLimitCallback, void*>>
       near_heap_limit_callbacks_;
@@ -2168,20 +2110,27 @@ class Heap {
   // Map from the space id to the space.
   std::unique_ptr<Space> space_[LAST_SPACE + 1];
 
+#ifdef V8_COMPRESS_POINTERS
+  // The space in the ExternalPointerTable containing entries owned by objects
+  // in this heap.
+  ExternalPointerTable::Space external_pointer_space_;
+  // Likewise but for slots in host objects in ReadOnlySpace.
+  ExternalPointerTable::Space read_only_external_pointer_space_;
+#endif  // V8_COMPRESS_POINTERS
+
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // The space in the process-wide code pointer table managed by this heap.
+  CodePointerTable::Space code_pointer_space_;
+#endif  // V8_CODE_POINTER_SANDBOXING
+
   LocalHeap* main_thread_local_heap_ = nullptr;
 
   // Determines whether code space is write-protected. This is essentially a
   // race-free copy of the {v8_flags.write_protect_code_memory} flag.
   bool write_protect_code_memory_ = false;
 
-  // Holds the number of open CodeSpaceMemoryModificationScopes.
-  uintptr_t code_space_memory_modification_scope_depth_ = 0;
-
   std::atomic<HeapState> gc_state_{NOT_IN_GC};
 
-  // Returns the amount of external memory registered since last global gc.
-  V8_EXPORT_PRIVATE uint64_t AllocatedExternalMemorySinceMarkCompact() const;
-
   // Starts marking when stress_marking_percentage_% of the marking start limit
   // is reached.
   int stress_marking_percentage_ = 0;
@@ -2222,13 +2171,13 @@ class Heap {
   // {native_contexts_list_} is an Address instead of an Object to allow the use
   // of atomic accessors.
   std::atomic<Address> native_contexts_list_;
-  Object allocation_sites_list_;
-  Object dirty_js_finalization_registries_list_;
+  Tagged<Object> allocation_sites_list_ = Smi::zero();
+  Tagged<Object> dirty_js_finalization_registries_list_ = Smi::zero();
   // Weak list tails.
-  Object dirty_js_finalization_registries_list_tail_;
+  Tagged<Object> dirty_js_finalization_registries_list_tail_ = Smi::zero();
 
-  GCCallbacks<v8::Isolate, AllowGarbageCollection> gc_prologue_callbacks_;
-  GCCallbacks<v8::Isolate, AllowGarbageCollection> gc_epilogue_callbacks_;
+  GCCallbacks gc_prologue_callbacks_;
+  GCCallbacks gc_epilogue_callbacks_;
 
   GetExternallyAllocatedMemoryInBytesCallback external_memory_callback_;
 
@@ -2244,14 +2193,8 @@ class Heap {
   int nodes_copied_in_new_space_ = 0;
   int nodes_promoted_ = 0;
 
-  // This is the pretenuring trigger for allocation sites that are in maybe
-  // tenure state. When we switched to the maximum new space size we deoptimize
-  // the code that belongs to the allocation site and derive the lifetime
-  // of the allocation site.
-  unsigned int maximum_size_minor_gcs_ = 0;
-
   // Total time spent in GC.
-  double total_gc_time_ms_ = 0.0;
+  base::TimeDelta total_gc_time_ms_;
 
   // Last time a garbage collection happened.
   double last_gc_time_ = 0.0;
@@ -2259,7 +2202,7 @@ class Heap {
   std::unique_ptr<GCTracer> tracer_;
   std::unique_ptr<Sweeper> sweeper_;
   std::unique_ptr<MarkCompactCollector> mark_compact_collector_;
-  std::unique_ptr<MinorMarkCompactCollector> minor_mark_compact_collector_;
+  std::unique_ptr<MinorMarkSweepCollector> minor_mark_sweep_collector_;
   std::unique_ptr<ScavengerCollector> scavenger_collector_;
   std::unique_ptr<ArrayBufferSweeper> array_buffer_sweeper_;
 
@@ -2276,6 +2219,9 @@ class Heap {
   std::unique_ptr<AllocationObserver> stress_concurrent_allocation_observer_;
   std::unique_ptr<AllocationTrackerForDebugging>
       allocation_tracker_for_debugging_;
+  std::unique_ptr<EphemeronRememberedSet> ephemeron_remembered_set_;
+
+  std::shared_ptr<v8::TaskRunner> task_runner_;
 
   // This object controls virtual space reserved for code on the V8 heap. This
   // is only valid for 64-bit architectures where kRequiresCodeRange.
@@ -2288,10 +2234,9 @@ class Heap {
   std::unique_ptr<CodeRange> code_range_;
 #endif
 
-  // The embedder owns the C++ heap.
-  v8::CppHeap* cpp_heap_ = nullptr;
-
-  EmbedderRootsHandler* embedder_roots_handler_ = nullptr;
+  v8::CppHeap* cpp_heap_ = nullptr;  // Owned by the embedder.
+  EmbedderRootsHandler* embedder_roots_handler_ =
+      nullptr;  // Owned by the embedder.
 
   cppgc::EmbedderStackState embedder_stack_state_ =
       cppgc::EmbedderStackState::kMayContainHeapPointers;
@@ -2299,6 +2244,8 @@ class Heap {
   StrongRootsEntry* strong_roots_head_ = nullptr;
   base::Mutex strong_roots_mutex_;
 
+  base::Mutex heap_expansion_mutex_;
+
   bool need_to_remove_stress_concurrent_allocation_observer_ = false;
 
   // This counter is increased before each GC and never reset.
@@ -2330,8 +2277,7 @@ class Heap {
   bool configured_ = false;
 
   // Currently set GC flags that are respected by all GC components.
-  int current_gc_flags_ = Heap::kNoGCFlags;
-
+  GCFlags current_gc_flags_ = GCFlag::kNoFlags;
   // Currently set GC callback flags that are used to pass information between
   // the embedder and V8's GC.
   GCCallbackFlags current_gc_callback_flags_ =
@@ -2368,7 +2314,6 @@ class Heap {
   bool force_oom_ = false;
   bool force_gc_on_next_allocation_ = false;
   bool delay_sweeper_tasks_for_testing_ = false;
-  bool force_shared_gc_with_empty_stack_for_testing_ = false;
 
   UnorderedHeapObjectMap<HeapObject> retainer_;
   UnorderedHeapObjectMap<Root> retaining_root_;
@@ -2387,18 +2332,19 @@ class Heap {
 
   MarkingState marking_state_;
   NonAtomicMarkingState non_atomic_marking_state_;
-  AtomicMarkingState atomic_marking_state_;
 
   PretenuringHandler pretenuring_handler_;
 
-  // This field is used only when not running with MinorMC.
+  // This field is used only when not running with MinorMS.
   ResizeNewSpaceMode resize_new_space_mode_ = ResizeNewSpaceMode::kNone;
 
+  std::unique_ptr<MemoryBalancer> mb_;
+
   // Classes in "heap" can be friends.
+  friend class ActivateMemoryReducerTask;
   friend class AlwaysAllocateScope;
   friend class ArrayBufferCollector;
   friend class ArrayBufferSweeper;
-  friend class CollectorBase;
   friend class ConcurrentAllocator;
   friend class ConcurrentMarking;
   friend class ConservativeTracedHandlesMarkingVisitor;
@@ -2417,18 +2363,19 @@ class Heap {
   friend class LocalHeap;
   friend class MarkingBarrier;
   friend class OldLargeObjectSpace;
-  template <typename ConcreteVisitor, typename MarkingState>
+  template <typename ConcreteVisitor>
   friend class MarkingVisitorBase;
   friend class MarkCompactCollector;
-  friend class MarkCompactCollectorBase;
+  friend class MinorGCJob;
   friend class MinorGCTaskObserver;
-  friend class MinorMarkCompactCollector;
-  friend class MinorMCIncrementalMarkingTaskObserver;
+  friend class MinorMarkSweepCollector;
+  friend class MinorMSIncrementalMarkingTaskObserver;
   friend class NewLargeObjectSpace;
   friend class NewSpace;
   friend class ObjectStatsCollector;
   friend class Page;
   friend class PagedSpaceBase;
+  friend class PagedSpaceForNewSpace;
   friend class PauseAllocationObserversScope;
   friend class PretenuringHandler;
   friend class ReadOnlyRoots;
@@ -2456,6 +2403,8 @@ class Heap {
 
   // Used in cctest.
   friend class heap::HeapTester;
+
+  friend class MemoryBalancer;
 };
 
 class HeapStats {
@@ -2506,6 +2455,8 @@ class V8_NODISCARD AlwaysAllocateScope {
   friend class Heap;
   friend class HeapAllocator;
   friend class Isolate;
+  // TODO(1445003): Remove this after investigating the crash.
+  friend class GlobalBackingStoreRegistry;
 
   explicit inline AlwaysAllocateScope(Heap* heap);
   Heap* heap_;
@@ -2530,45 +2481,6 @@ class V8_NODISCARD AlwaysAllocateScopeForTesting {
   AlwaysAllocateScope scope_;
 };
 
-// The CodeSpaceMemoryModificationScope can only be used by the main thread.
-class V8_NODISCARD CodeSpaceMemoryModificationScope {
- public:
-  explicit inline CodeSpaceMemoryModificationScope(Heap* heap);
-  inline ~CodeSpaceMemoryModificationScope();
-
- private:
-#if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
-  V8_NO_UNIQUE_ADDRESS RwxMemoryWriteScope rwx_write_scope_;
-#endif
-  Heap* heap_;
-};
-
-// The CodePageCollectionMemoryModificationScope can be used by any thread. It
-// will not be enabled if a CodeSpaceMemoryModificationScope is already active.
-class V8_NODISCARD CodePageCollectionMemoryModificationScope {
- public:
-  explicit inline CodePageCollectionMemoryModificationScope(Heap* heap);
-  inline ~CodePageCollectionMemoryModificationScope();
-
- private:
-#if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
-  V8_NO_UNIQUE_ADDRESS RwxMemoryWriteScope rwx_write_scope_;
-#endif
-  Heap* heap_;
-};
-
-// Same as the CodePageCollectionMemoryModificationScope but without inlining
-// the code. This is a workaround for component build issue (crbug/1316800),
-// when a thread_local value can't be properly exported.
-class V8_EXPORT_PRIVATE V8_NODISCARD
-    CodePageCollectionMemoryModificationScopeForTesting
-    : public CodePageCollectionMemoryModificationScope {
- public:
-  V8_NOINLINE explicit CodePageCollectionMemoryModificationScopeForTesting(
-      Heap* heap);
-  V8_NOINLINE ~CodePageCollectionMemoryModificationScopeForTesting();
-};
-
 // The CodePageHeaderModificationScope enables write access to Code
 // space page headers. On most of the configurations it's a no-op because
 // Code space page headers are configured as writable and
@@ -2597,21 +2509,44 @@ using CodePageHeaderModificationScope = NopRwxMemoryWriteScope;
 class V8_NODISCARD CodePageMemoryModificationScope {
  public:
   explicit inline CodePageMemoryModificationScope(BasicMemoryChunk* chunk);
-  explicit inline CodePageMemoryModificationScope(InstructionStream object);
+  explicit inline CodePageMemoryModificationScope(
+      Tagged<InstructionStream> object);
   inline ~CodePageMemoryModificationScope();
 
  private:
 #if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
-  V8_NO_UNIQUE_ADDRESS RwxMemoryWriteScope rwx_write_scope_;
-#endif
+  base::Optional<RwxMemoryWriteScope> rwx_write_scope_;
+#else
   BasicMemoryChunk* chunk_;
   bool scope_active_;
+  base::Optional<base::MutexGuard> guard_;
+#endif
 
   // Disallow any GCs inside this scope, as a relocation of the underlying
   // object would change the {MemoryChunk} that this scope targets.
   DISALLOW_GARBAGE_COLLECTION(no_heap_allocation_)
 };
 
+class CodePageMemoryModificationScopeForDebugging {
+ public:
+  // When we zap newly allocated MemoryChunks, the chunk is not initialized yet
+  // and we can't use the regular CodePageMemoryModificationScope since it will
+  // access the page header. Hence, use the VirtualMemory for tracking instead.
+  explicit CodePageMemoryModificationScopeForDebugging(
+      Heap* heap, VirtualMemory* reservation, base::AddressRegion region);
+  explicit CodePageMemoryModificationScopeForDebugging(BasicMemoryChunk* chunk);
+  ~CodePageMemoryModificationScopeForDebugging();
+
+ private:
+#if V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT || V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
+  RwxMemoryWriteScope rwx_write_scope_;
+#else
+  VirtualMemory* reservation_ = nullptr;
+  base::Optional<base::AddressRegion> region_;
+  base::Optional<CodePageMemoryModificationScope> memory_modification_scope_;
+#endif
+};
+
 class V8_NODISCARD IgnoreLocalGCRequests {
  public:
   explicit inline IgnoreLocalGCRequests(Heap* heap);
@@ -2643,10 +2578,7 @@ class V8_EXPORT_PRIVATE PagedSpaceIterator {
 // an embedded DisallowGarbageCollection instance).
 //
 // HeapObjectIterator can skip free list nodes (that is, de-allocated heap
-// objects that still remain in the heap). As implementation of free nodes
-// filtering uses GC marks, it can't be used during MS/MC GC phases. Also, it is
-// forbidden to interrupt iteration in this mode, as this will leave heap
-// objects marked (and thus, unusable).
+// objects that still remain in the heap).
 //
 // See ReadOnlyHeapObjectIterator if you need to iterate over read-only space
 // objects, or CombinedHeapObjectIterator if you need to iterate over both
@@ -2657,23 +2589,31 @@ class V8_EXPORT_PRIVATE HeapObjectIterator {
 
   explicit HeapObjectIterator(Heap* heap,
                               HeapObjectsFiltering filtering = kNoFiltering);
+  // .. when already in a SafepointScope:
+  HeapObjectIterator(Heap* heap, const SafepointScope& safepoint_scope,
+                     HeapObjectsFiltering filtering = kNoFiltering);
   ~HeapObjectIterator();
 
-  HeapObject Next();
+  Tagged<HeapObject> Next();
 
  private:
-  HeapObject NextObject();
+  HeapObjectIterator(Heap* heap, SafepointScope* safepoint_scope_or_nullptr,
+                     HeapObjectsFiltering filtering);
+
+  Tagged<HeapObject> NextObject();
 
   Heap* heap_;
-  std::unique_ptr<SafepointScope> safepoint_scope_;
-  HeapObjectsFiltering filtering_;
-  HeapObjectsFilter* filter_;
+  DISALLOW_GARBAGE_COLLECTION(no_heap_allocation_)
+
+  // The safepoint scope pointer is null if a scope already existed when the
+  // iterator was created (i.e. when using the constructor that passes a
+  // safepoint_scope reference).
+  std::unique_ptr<SafepointScope> safepoint_scope_;  // nullable
+  std::unique_ptr<HeapObjectsFilter> filter_;
   // Space iterator for iterating all the spaces.
-  SpaceIterator* space_iterator_;
+  SpaceIterator space_iterator_;
   // Object iterator for the space currently being iterated.
   std::unique_ptr<ObjectIterator> object_iterator_;
-
-  DISALLOW_GARBAGE_COLLECTION(no_heap_allocation_)
 };
 
 // Abstract base class for checking whether a weak object should be retained.
@@ -2684,7 +2624,7 @@ class WeakObjectRetainer {
   // Return whether this object should be retained. If nullptr is returned the
   // object has no references. Otherwise the address of the retained object
   // should be returned as in some GC situations the object has been moved.
-  virtual Object RetainAs(Object object) = 0;
+  virtual Tagged<Object> RetainAs(Tagged<Object> object) = 0;
 };
 
 // -----------------------------------------------------------------------------
@@ -2781,4 +2721,12 @@ class V8_NODISCARD CppClassNamesAsHeapObjectNameScope final {
 }  // namespace internal
 }  // namespace v8
 
+// Opt out from libc++ backing sanitization, since root iteration walks up to
+// the capacity.
+#ifdef _LIBCPP_HAS_ASAN_CONTAINER_ANNOTATIONS_FOR_ALL_ALLOCATORS
+template <>
+struct ::std::__asan_annotate_container_with_allocator<
+    v8::internal::StrongRootBlockAllocator> : ::std::false_type {};
+#endif  // _LIBCPP_HAS_ASAN_CONTAINER_ANNOTATIONS_FOR_ALL_ALLOCATORS
+
 #endif  // V8_HEAP_HEAP_H_
diff --git a/deps/v8/src/heap/incremental-marking-inl.h b/deps/v8/src/heap/incremental-marking-inl.h
index c6bb1893725905..596d881307b4e1 100644
--- a/deps/v8/src/heap/incremental-marking-inl.h
+++ b/deps/v8/src/heap/incremental-marking-inl.h
@@ -15,30 +15,22 @@
 namespace v8 {
 namespace internal {
 
-void IncrementalMarking::TransferColor(HeapObject from, HeapObject to) {
-  if (atomic_marking_state()->IsMarked(to)) {
+void IncrementalMarking::TransferColor(Tagged<HeapObject> from,
+                                       Tagged<HeapObject> to) {
+  if (marking_state()->IsMarked(to)) {
     DCHECK(black_allocation());
     return;
   }
-
-  DCHECK(atomic_marking_state()->IsUnmarked(to));
-  if (atomic_marking_state()->IsGrey(from)) {
-    bool success = atomic_marking_state()->TryMark(to);
-    DCHECK(success);
-    USE(success);
-  } else if (atomic_marking_state()->IsMarked(from)) {
-    bool success = atomic_marking_state()->TryMark(to);
-    DCHECK(success);
-    USE(success);
-    success = atomic_marking_state()->GreyToBlack(to);
+  DCHECK(marking_state()->IsUnmarked(to));
+  if (marking_state()->IsMarked(from)) {
+    bool success = marking_state()->TryMark(to);
     DCHECK(success);
     USE(success);
-    if (!to.IsDescriptorArray() ||
+    if (!IsDescriptorArray(to) ||
         (DescriptorArrayMarkingState::Marked::decode(
-             DescriptorArray::cast(to).raw_gc_state(kRelaxedLoad)) != 0)) {
-      atomic_marking_state()->IncrementLiveBytes(
-          MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(to)),
-          ALIGN_TO_ALLOCATION_ALIGNMENT(to.Size()));
+             DescriptorArray::cast(to)->raw_gc_state(kRelaxedLoad)) != 0)) {
+      MemoryChunk::FromHeapObject(to)->IncrementLiveBytesAtomically(
+          ALIGN_TO_ALLOCATION_ALIGNMENT(to->Size()));
     }
   }
 }
diff --git a/deps/v8/src/heap/incremental-marking-job.cc b/deps/v8/src/heap/incremental-marking-job.cc
index 82cc8fb0c2693b..0b0b5de2013b54 100644
--- a/deps/v8/src/heap/incremental-marking-job.cc
+++ b/deps/v8/src/heap/incremental-marking-job.cc
@@ -8,16 +8,21 @@
 #include "src/base/platform/time.h"
 #include "src/execution/isolate.h"
 #include "src/execution/vm-state-inl.h"
+#include "src/flags/flags.h"
+#include "src/heap/base/incremental-marking-schedule.h"
+#include "src/heap/cppgc-js/cpp-heap.h"
+#include "src/heap/cppgc/marker.h"
 #include "src/heap/gc-tracer.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap.h"
 #include "src/heap/incremental-marking.h"
+#include "src/heap/minor-gc-job.h"
 #include "src/init/v8.h"
+#include "src/tasks/cancelable-task.h"
 
-namespace v8 {
-namespace internal {
+namespace v8::internal {
 
-class IncrementalMarkingJob::Task : public CancelableTask {
+class IncrementalMarkingJob::Task final : public CancelableTask {
  public:
   Task(Isolate* isolate, IncrementalMarkingJob* job, StackState stack_state)
       : CancelableTask(isolate),
@@ -36,45 +41,71 @@ class IncrementalMarkingJob::Task : public CancelableTask {
   const StackState stack_state_;
 };
 
-void IncrementalMarkingJob::ScheduleTask() {
+IncrementalMarkingJob::IncrementalMarkingJob(Heap* heap)
+    : heap_(heap), foreground_task_runner_(heap->GetForegroundTaskRunner()) {
+  CHECK(v8_flags.incremental_marking_task);
+}
+
+void IncrementalMarkingJob::ScheduleTask(TaskType task_type) {
   base::MutexGuard guard(&mutex_);
 
-  if (is_task_pending_ || heap_->IsTearingDown() ||
-      !v8_flags.incremental_marking_task) {
+  if (pending_task_.has_value() || heap_->IsTearingDown()) {
     return;
   }
 
-  v8::Isolate* isolate = reinterpret_cast<v8::Isolate*>(heap_->isolate());
-  is_task_pending_ = true;
-  auto taskrunner = V8::GetCurrentPlatform()->GetForegroundTaskRunner(isolate);
-
-  const auto stack_state = taskrunner->NonNestableTasksEnabled()
-                               ? StackState::kNoHeapPointers
-                               : StackState::kMayContainHeapPointers;
-
-  auto task = std::make_unique<Task>(heap_->isolate(), this, stack_state);
-
-  scheduled_time_ = heap_->MonotonicallyIncreasingTimeInMs();
-
-  if (taskrunner->NonNestableTasksEnabled()) {
-    taskrunner->PostNonNestableTask(std::move(task));
+  const bool non_nestable_tasks_enabled =
+      foreground_task_runner_->NonNestableTasksEnabled();
+  auto task = std::make_unique<Task>(heap_->isolate(), this,
+                                     non_nestable_tasks_enabled
+                                         ? StackState::kNoHeapPointers
+                                         : StackState::kMayContainHeapPointers);
+  if (non_nestable_tasks_enabled) {
+    if (task_type == TaskType::kNormal) {
+      foreground_task_runner_->PostNonNestableTask(std::move(task));
+    } else {
+      foreground_task_runner_->PostNonNestableDelayedTask(
+          std::move(task), v8::base::TimeDelta::FromMilliseconds(
+                               v8_flags.incremental_marking_task_delay_ms)
+                               .InSecondsF());
+    }
   } else {
-    taskrunner->PostTask(std::move(task));
+    if (task_type == TaskType::kNormal) {
+      foreground_task_runner_->PostTask(std::move(task));
+    } else {
+      foreground_task_runner_->PostDelayedTask(
+          std::move(task), v8::base::TimeDelta::FromMilliseconds(
+                               v8_flags.incremental_marking_task_delay_ms)
+                               .InSecondsF());
+    }
+  }
+
+  pending_task_.emplace(task_type);
+  scheduled_time_ = v8::base::TimeTicks::Now();
+  if (V8_UNLIKELY(v8_flags.trace_incremental_marking)) {
+    heap_->isolate()->PrintWithTimestamp(
+        "[IncrementalMarking] Job: Schedule (%s)\n", ToString(task_type));
   }
 }
 
 void IncrementalMarkingJob::Task::RunInternal() {
   VMState<GC> state(isolate());
-  TRACE_EVENT_CALL_STATS_SCOPED(isolate(), "v8", "V8.Task");
+  TRACE_EVENT_CALL_STATS_SCOPED(isolate(), "v8",
+                                "V8.IncrementalMarkingJob.Task");
+
+  isolate()->stack_guard()->ClearStartIncrementalMarking();
 
   Heap* heap = isolate()->heap();
+
+  {
+    base::MutexGuard guard(&job_->mutex_);
+    heap->tracer()->RecordTimeToIncrementalMarkingTask(
+        v8::base::TimeTicks::Now() - job_->scheduled_time_);
+    job_->scheduled_time_ = v8::base::TimeTicks();
+  }
+
   EmbedderStackStateScope scope(
       heap, EmbedderStackStateScope::kImplicitThroughTask, stack_state_);
 
-  heap->tracer()->RecordTimeToIncrementalMarkingTask(
-      heap->MonotonicallyIncreasingTimeInMs() - job_->scheduled_time_);
-  job_->scheduled_time_ = 0.0;
-
   IncrementalMarking* incremental_marking = heap->incremental_marking();
   if (incremental_marking->IsStopped()) {
     if (heap->IncrementalMarkingLimitReached() !=
@@ -82,38 +113,66 @@ void IncrementalMarkingJob::Task::RunInternal() {
       heap->StartIncrementalMarking(heap->GCFlagsForIncrementalMarking(),
                                     GarbageCollectionReason::kTask,
                                     kGCCallbackScheduleIdleGarbageCollection);
+    } else if (v8_flags.minor_ms && v8_flags.concurrent_minor_ms_marking) {
+      heap->StartMinorMSIncrementalMarkingIfNeeded();
     }
   }
 
-  // Clear this flag after StartIncrementalMarking call to avoid
-  // scheduling a new task when starting incremental marking.
+  // Clear this flag after StartIncrementalMarking() call to avoid scheduling a
+  // new task when starting incremental marking from a task.
   {
     base::MutexGuard guard(&job_->mutex_);
-    job_->is_task_pending_ = false;
+    if (V8_UNLIKELY(v8_flags.trace_incremental_marking)) {
+      job_->heap_->isolate()->PrintWithTimestamp(
+          "[IncrementalMarking] Job: Run (%s)\n",
+          ToString(job_->pending_task_.value()));
+    }
+    job_->pending_task_.reset();
   }
 
   if (incremental_marking->IsMajorMarking()) {
-    // All objects are initialized at that point.
-    heap->new_space()->MarkLabStartInitialized();
-    heap->new_lo_space()->ResetPendingObject();
-
     heap->incremental_marking()->AdvanceAndFinalizeIfComplete();
-
     if (incremental_marking->IsMajorMarking()) {
-      // TODO(v8:12775): It is quite suprising that we schedule the task
-      // immediately here. This was introduced since delayed task were
-      // unreliable at some point. Investigate whether this is still the case
-      // and whether this could be improved.
-      job_->ScheduleTask();
+      TaskType task_type;
+      if (v8_flags.incremental_marking_task_delay_ms > 0) {
+        task_type = heap->incremental_marking()->IsAheadOfSchedule()
+                        ? TaskType::kPending
+                        : TaskType::kNormal;
+      } else {
+        task_type = TaskType::kNormal;
+        if (V8_UNLIKELY(v8_flags.trace_incremental_marking)) {
+          isolate()->PrintWithTimestamp(
+              "[IncrementalMarking] Using regular task based on flags\n");
+        }
+      }
+      job_->ScheduleTask(task_type);
     }
   }
 }
 
-double IncrementalMarkingJob::CurrentTimeToTask() const {
-  if (scheduled_time_ == 0.0) return 0.0;
+base::Optional<base::TimeDelta> IncrementalMarkingJob::CurrentTimeToTask()
+    const {
+  base::Optional<base::TimeDelta> current_time_to_task;
+  if (pending_task_.has_value()) {
+    const auto now = base::TimeTicks::Now();
+    if (pending_task_.value() == TaskType::kNormal) {
+      DCHECK_GE(now, scheduled_time_);
+      current_time_to_task.emplace(now - scheduled_time_);
+    } else {
+      const auto delta = (now - scheduled_time_) -
+                         base::TimeDelta::FromMilliseconds(
+                             v8_flags.incremental_marking_task_delay_ms);
+      if (delta > base::TimeDelta::FromMilliseconds(0)) {
+        current_time_to_task.emplace(delta);
+      }
+    }
+  }
+  return current_time_to_task;
+}
 
-  return heap_->MonotonicallyIncreasingTimeInMs() - scheduled_time_;
+base::Optional<v8::base::TimeDelta> IncrementalMarkingJob::AverageTimeToTask()
+    const {
+  return heap_->tracer()->AverageTimeToIncrementalMarkingTask();
 }
 
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal
diff --git a/deps/v8/src/heap/incremental-marking-job.h b/deps/v8/src/heap/incremental-marking-job.h
index ca590bf1140890..351e57a0e9a23e 100644
--- a/deps/v8/src/heap/incremental-marking-job.h
+++ b/deps/v8/src/heap/incremental-marking-job.h
@@ -5,34 +5,61 @@
 #ifndef V8_HEAP_INCREMENTAL_MARKING_JOB_H_
 #define V8_HEAP_INCREMENTAL_MARKING_JOB_H_
 
-#include "src/tasks/cancelable-task.h"
+#include "include/v8-platform.h"
+#include "src/base/optional.h"
+#include "src/base/platform/mutex.h"
+#include "src/base/platform/time.h"
 
-namespace v8 {
-namespace internal {
+namespace v8::internal {
 
 class Heap;
 class Isolate;
 
 // The incremental marking job uses platform tasks to perform incremental
-// marking steps. The job posts a foreground task that makes a small (~1ms)
-// step and posts another task until the marking is completed.
+// marking actions (start, step, finalize). The job posts regular foreground
+// tasks or delayed foreground tasks if marking progress allows.
 class IncrementalMarkingJob final {
  public:
-  explicit IncrementalMarkingJob(Heap* heap) V8_NOEXCEPT : heap_(heap) {}
+  enum class TaskType {
+    kNormal,
+    kPending,
+  };
 
-  void ScheduleTask();
-  double CurrentTimeToTask() const;
+  explicit IncrementalMarkingJob(Heap* heap);
+
+  IncrementalMarkingJob(const IncrementalMarkingJob&) = delete;
+  IncrementalMarkingJob& operator=(const IncrementalMarkingJob&) = delete;
+
+  // Schedules a task with a given `task_type`. Safe to be called from any
+  // thread.
+  void ScheduleTask(TaskType task_type = TaskType::kNormal);
+
+  // Returns a weighted average of time to task. For delayed tasks the time to
+  // task is only recorded after the initial delay. In case a task is currently
+  // running, it is added to the average.
+  base::Optional<v8::base::TimeDelta> AverageTimeToTask() const;
+
+  base::Optional<v8::base::TimeDelta> CurrentTimeToTask() const;
 
  private:
   class Task;
-  static constexpr double kDelayInSeconds = 10.0 / 1000.0;
 
-  Heap* heap_;
-  base::Mutex mutex_;
-  double scheduled_time_ = 0.0;
-  bool is_task_pending_ = false;
+  Heap* const heap_;
+  const std::shared_ptr<v8::TaskRunner> foreground_task_runner_;
+  mutable base::Mutex mutex_;
+  v8::base::TimeTicks scheduled_time_;
+  base::Optional<TaskType> pending_task_;
 };
-}  // namespace internal
-}  // namespace v8
+
+constexpr const char* ToString(IncrementalMarkingJob::TaskType task_type) {
+  switch (task_type) {
+    case IncrementalMarkingJob::TaskType::kNormal:
+      return "normal";
+    case IncrementalMarkingJob::TaskType::kPending:
+      return "pending";
+  }
+}
+
+}  // namespace v8::internal
 
 #endif  // V8_HEAP_INCREMENTAL_MARKING_JOB_H_
diff --git a/deps/v8/src/heap/incremental-marking.cc b/deps/v8/src/heap/incremental-marking.cc
index 7ccfc8ea0bf21e..f078f63b7a3308 100644
--- a/deps/v8/src/heap/incremental-marking.cc
+++ b/deps/v8/src/heap/incremental-marking.cc
@@ -4,25 +4,29 @@
 
 #include "src/heap/incremental-marking.h"
 
+#include <inttypes.h>
+
+#include <cmath>
+
 #include "src/base/logging.h"
-#include "src/codegen/compilation-cache.h"
+#include "src/base/platform/time.h"
 #include "src/execution/vm-state-inl.h"
+#include "src/flags/flags.h"
 #include "src/handles/global-handles.h"
+#include "src/heap/base/incremental-marking-schedule.h"
 #include "src/heap/concurrent-marking.h"
-#include "src/heap/gc-idle-time-handler.h"
 #include "src/heap/gc-tracer-inl.h"
 #include "src/heap/gc-tracer.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap.h"
-#include "src/heap/incremental-marking-inl.h"
 #include "src/heap/incremental-marking-job.h"
-#include "src/heap/mark-compact-inl.h"
 #include "src/heap/mark-compact.h"
 #include "src/heap/marking-barrier.h"
 #include "src/heap/marking-visitor-inl.h"
 #include "src/heap/marking-visitor.h"
+#include "src/heap/memory-chunk-layout.h"
 #include "src/heap/memory-chunk.h"
-#include "src/heap/object-stats.h"
+#include "src/heap/minor-mark-sweep.h"
 #include "src/heap/objects-visiting-inl.h"
 #include "src/heap/objects-visiting.h"
 #include "src/heap/safepoint.h"
@@ -30,10 +34,7 @@
 #include "src/logging/runtime-call-stats-scope.h"
 #include "src/numbers/conversions.h"
 #include "src/objects/data-handler-inl.h"
-#include "src/objects/embedder-data-array-inl.h"
-#include "src/objects/hash-table-inl.h"
 #include "src/objects/slots-inl.h"
-#include "src/objects/transitions-inl.h"
 #include "src/objects/visitors.h"
 #include "src/tracing/trace-event.h"
 #include "src/utils/utils.h"
@@ -41,8 +42,45 @@
 namespace v8 {
 namespace internal {
 
-void IncrementalMarking::Observer::Step(int bytes_allocated, Address addr,
-                                        size_t size) {
+namespace {
+
+static constexpr size_t kMajorGCYoungGenerationAllocationObserverStep = 64 * KB;
+static constexpr size_t kMajorGCOldGenerationAllocationObserverStep = 256 * KB;
+static constexpr size_t kMinorGCAllocationObserverStep = 4 * KB;
+
+static constexpr v8::base::TimeDelta kMaxStepSizeOnTask =
+    v8::base::TimeDelta::FromMilliseconds(1);
+static constexpr v8::base::TimeDelta kMaxStepSizeOnAllocation =
+    v8::base::TimeDelta::FromMilliseconds(5);
+
+#ifndef DEBUG
+static constexpr size_t kV8ActivationThreshold = 8 * MB;
+static constexpr size_t kEmbedderActivationThreshold = 8 * MB;
+#else
+static constexpr size_t kV8ActivationThreshold = 0;
+static constexpr size_t kEmbedderActivationThreshold = 0;
+#endif  // DEBUG
+
+base::TimeDelta GetMaxDuration(StepOrigin step_origin) {
+  if (v8_flags.predictable) {
+    return base::TimeDelta::Max();
+  }
+  switch (step_origin) {
+    case StepOrigin::kTask:
+      return kMaxStepSizeOnTask;
+    case StepOrigin::kV8:
+      return kMaxStepSizeOnAllocation;
+  }
+}
+
+}  // namespace
+
+IncrementalMarking::Observer::Observer(IncrementalMarking* incremental_marking,
+                                       intptr_t step_size)
+    : AllocationObserver(step_size),
+      incremental_marking_(incremental_marking) {}
+
+void IncrementalMarking::Observer::Step(int, Address, size_t) {
   Heap* heap = incremental_marking_->heap();
   VMState<GC> state(heap->isolate());
   RCS_SCOPE(heap->isolate(),
@@ -50,22 +88,37 @@ void IncrementalMarking::Observer::Step(int bytes_allocated, Address addr,
   incremental_marking_->AdvanceOnAllocation();
 }
 
+IncrementalMarking::MinorGCObserver::MinorGCObserver(
+    IncrementalMarking* incremental_marking)
+    : AllocationObserver(kMinorGCAllocationObserverStep),
+      incremental_marking_(incremental_marking) {}
+
+void IncrementalMarking::MinorGCObserver::Step(int, Address, size_t) {
+  incremental_marking_->RequestMinorGCFinalizationIfNeeded();
+}
+
 IncrementalMarking::IncrementalMarking(Heap* heap, WeakObjects* weak_objects)
     : heap_(heap),
       major_collector_(heap->mark_compact_collector()),
-      minor_collector_(heap->minor_mark_compact_collector()),
+      minor_collector_(heap->minor_mark_sweep_collector()),
       weak_objects_(weak_objects),
-      incremental_marking_job_(heap),
-      new_generation_observer_(this, kYoungGenerationAllocatedThreshold),
-      old_generation_observer_(this, kOldGenerationAllocatedThreshold),
       marking_state_(heap->marking_state()),
-      atomic_marking_state_(heap->atomic_marking_state()) {}
-
-void IncrementalMarking::MarkBlackBackground(HeapObject obj, int object_size) {
-  CHECK(atomic_marking_state()->TryMark(obj) &&
-        atomic_marking_state()->GreyToBlack(obj));
-  IncrementLiveBytesBackground(MemoryChunk::FromHeapObject(obj),
-                               static_cast<intptr_t>(object_size));
+      incremental_marking_job_(
+          v8_flags.incremental_marking_task
+              ? std::make_unique<IncrementalMarkingJob>(heap)
+              : nullptr),
+      new_generation_observer_(this,
+                               kMajorGCYoungGenerationAllocationObserverStep),
+      old_generation_observer_(this,
+                               kMajorGCOldGenerationAllocationObserverStep),
+      minor_gc_observer_(this) {}
+
+void IncrementalMarking::MarkBlackBackground(Tagged<HeapObject> obj,
+                                             int object_size) {
+  CHECK(marking_state()->TryMark(obj));
+  base::MutexGuard guard(&background_live_bytes_mutex_);
+  background_live_bytes_[MemoryChunk::FromHeapObject(obj)] +=
+      static_cast<intptr_t>(object_size);
 }
 
 bool IncrementalMarking::CanBeStarted() const {
@@ -85,9 +138,11 @@ bool IncrementalMarking::IsBelowActivationThresholds() const {
 
 void IncrementalMarking::Start(GarbageCollector garbage_collector,
                                GarbageCollectionReason gc_reason) {
+  DCHECK(CanBeStarted());
   DCHECK(!heap_->sweeping_in_progress());
+  DCHECK(IsStopped());
 
-  if (v8_flags.trace_incremental_marking) {
+  if (V8_UNLIKELY(v8_flags.trace_incremental_marking)) {
     const size_t old_generation_size_mb =
         heap()->OldGenerationSizeOfObjects() / MB;
     const size_t old_generation_limit_mb =
@@ -97,8 +152,7 @@ void IncrementalMarking::Start(GarbageCollector garbage_collector,
     isolate()->PrintWithTimestamp(
         "[IncrementalMarking] Start (%s): (size/limit/slack) v8: %zuMB / %zuMB "
         "/ %zuMB global: %zuMB / %zuMB / %zuMB\n",
-        Heap::GarbageCollectionReasonToString(gc_reason),
-        old_generation_size_mb, old_generation_limit_mb,
+        ToString(gc_reason), old_generation_size_mb, old_generation_limit_mb,
         old_generation_size_mb > old_generation_limit_mb
             ? 0
             : old_generation_limit_mb - old_generation_size_mb,
@@ -106,13 +160,8 @@ void IncrementalMarking::Start(GarbageCollector garbage_collector,
         global_size_mb > global_limit_mb ? 0
                                          : global_limit_mb - global_size_mb);
   }
-  DCHECK(v8_flags.incremental_marking);
-  DCHECK(IsStopped());
-  DCHECK_EQ(heap_->gc_state(), Heap::NOT_IN_GC);
-  DCHECK(!isolate()->serializer_enabled());
 
   Counters* counters = isolate()->counters();
-
   const bool is_major = garbage_collector == GarbageCollector::MARK_COMPACTOR;
   if (is_major) {
     // Reasons are only reported for major GCs
@@ -123,40 +172,51 @@ void IncrementalMarking::Start(GarbageCollector garbage_collector,
       is_major ? counters->gc_incremental_marking_start()
                : counters->gc_minor_incremental_marking_start());
   const auto scope_id = is_major ? GCTracer::Scope::MC_INCREMENTAL_START
-                                 : GCTracer::Scope::MINOR_MC_INCREMENTAL_START;
+                                 : GCTracer::Scope::MINOR_MS_INCREMENTAL_START;
+  DCHECK(!current_trace_id_.has_value());
+  current_trace_id_.emplace(reinterpret_cast<uint64_t>(this) ^
+                            heap_->tracer()->CurrentEpoch(scope_id));
   TRACE_EVENT2("v8",
                is_major ? "V8.GCIncrementalMarkingStart"
                         : "V8.GCMinorIncrementalMarkingStart",
                "epoch", heap_->tracer()->CurrentEpoch(scope_id), "reason",
-               Heap::GarbageCollectionReasonToString(gc_reason));
-  TRACE_GC_EPOCH(heap()->tracer(), scope_id, ThreadKind::kMain);
+               ToString(gc_reason));
+  TRACE_GC_EPOCH_WITH_FLOW(heap()->tracer(), scope_id, ThreadKind::kMain,
+                           current_trace_id_.value(),
+                           TRACE_EVENT_FLAG_FLOW_OUT);
   heap_->tracer()->NotifyIncrementalMarkingStart();
 
-  start_time_ms_ = heap()->MonotonicallyIncreasingTimeInMs();
+  start_time_ = v8::base::TimeTicks::Now();
   completion_task_scheduled_ = false;
-  completion_task_timeout_ = 0.0;
-  initial_old_generation_size_ = heap_->OldGenerationSizeOfObjects();
-  old_generation_allocation_counter_ = heap_->OldGenerationAllocationCounter();
-  bytes_marked_ = 0;
-  scheduled_bytes_to_mark_ = 0;
-  schedule_update_time_ms_ = start_time_ms_;
+  completion_task_timeout_ = v8::base::TimeTicks();
+  main_thread_marked_bytes_ = 0;
   bytes_marked_concurrently_ = 0;
 
   if (is_major) {
-    current_collector_ = CurrentCollector::kMajorMC;
     StartMarkingMajor();
     heap_->AddAllocationObserversToAllSpaces(&old_generation_observer_,
                                              &new_generation_observer_);
-    incremental_marking_job()->ScheduleTask();
+    if (incremental_marking_job()) {
+      incremental_marking_job()->ScheduleTask();
+    }
+    DCHECK_NULL(schedule_);
+    schedule_ =
+        v8_flags.incremental_marking_bailout_when_ahead_of_schedule
+            ? ::heap::base::IncrementalMarkingSchedule::
+                  CreateWithZeroMinimumMarkedBytesPerStep(v8_flags.predictable)
+            : ::heap::base::IncrementalMarkingSchedule::
+                  CreateWithDefaultMinimumMarkedBytesPerStep(
+                      v8_flags.predictable);
+    schedule_->NotifyIncrementalMarkingStart();
   } else {
-    current_collector_ = CurrentCollector::kMinorMC;
-    // Allocation observers are not currently used by MinorMC because we don't
+    // Allocation observers are not currently used by MinorMS because we don't
     // do incremental marking.
     StartMarkingMinor();
+    heap_->new_space()->AddAllocationObserver(&minor_gc_observer_);
   }
 }
 
-bool IncrementalMarking::WhiteToGreyAndPush(HeapObject obj) {
+bool IncrementalMarking::WhiteToGreyAndPush(Tagged<HeapObject> obj) {
   if (marking_state()->TryMark(obj)) {
     local_marking_worklists()->Push(obj);
     return true;
@@ -186,10 +246,10 @@ class IncrementalMarking::IncrementalMarkingRootMarkingVisitor final
 
  private:
   void MarkObjectByPointer(Root root, FullObjectSlot p) {
-    Object object = *p;
-    if (!object.IsHeapObject()) return;
+    Tagged<Object> object = *p;
+    if (!IsHeapObject(object)) return;
     DCHECK(!MapWord::IsPacked(object.ptr()));
-    HeapObject heap_object = HeapObject::cast(object);
+    Tagged<HeapObject> heap_object = HeapObject::cast(object);
 
     if (heap_object.InAnySharedSpace() || heap_object.InReadOnlySpace()) return;
 
@@ -209,59 +269,29 @@ class IncrementalMarking::IncrementalMarkingRootMarkingVisitor final
 };
 
 void IncrementalMarking::MarkRoots() {
-  IncrementalMarkingRootMarkingVisitor visitor(heap_);
   CodePageHeaderModificationScope rwx_write_scope(
       "Marking of builtins table entries require write access to Code page "
       "header");
   if (IsMajorMarking()) {
+    IncrementalMarkingRootMarkingVisitor visitor(heap_);
     heap_->IterateRoots(
         &visitor,
         base::EnumSet<SkipRoot>{SkipRoot::kStack, SkipRoot::kMainThreadHandles,
-                                SkipRoot::kWeak});
+                                SkipRoot::kTracedHandles, SkipRoot::kWeak,
+                                SkipRoot::kReadOnlyBuiltins});
   } else {
+    YoungGenerationRootMarkingVisitor root_visitor(
+        heap_->minor_mark_sweep_collector()->main_marking_visitor());
     heap_->IterateRoots(
-        &visitor, base::EnumSet<SkipRoot>{
-                      SkipRoot::kStack, SkipRoot::kMainThreadHandles,
-                      SkipRoot::kWeak, SkipRoot::kExternalStringTable,
-                      SkipRoot::kGlobalHandles, SkipRoot::kOldGeneration});
-
-    isolate()->global_handles()->IterateYoungStrongAndDependentRoots(&visitor);
-    isolate()->traced_handles()->IterateYoungRoots(&visitor);
-
-    std::vector<PageMarkingItem> marking_items;
-    RememberedSet<OLD_TO_NEW>::IterateMemoryChunks(
-        heap(), [&marking_items](MemoryChunk* chunk) {
-          if (chunk->slot_set<OLD_TO_NEW>()) {
-            marking_items.emplace_back(
-                chunk, PageMarkingItem::SlotsType::kRegularSlots);
-          } else {
-            chunk->ReleaseInvalidatedSlots<OLD_TO_NEW>();
-          }
-
-          if (chunk->typed_slot_set<OLD_TO_NEW>()) {
-            marking_items.emplace_back(chunk,
-                                       PageMarkingItem::SlotsType::kTypedSlots);
-          }
-        });
+        &root_visitor,
+        base::EnumSet<SkipRoot>{
+            SkipRoot::kStack, SkipRoot::kMainThreadHandles, SkipRoot::kWeak,
+            SkipRoot::kExternalStringTable, SkipRoot::kGlobalHandles,
+            SkipRoot::kTracedHandles, SkipRoot::kOldGeneration,
+            SkipRoot::kReadOnlyBuiltins});
 
-    std::vector<YoungGenerationMarkingTask> tasks;
-    for (size_t i = 0; i < (v8_flags.parallel_marking
-                                ? MinorMarkCompactCollector::kMaxParallelTasks
-                                : 1);
-         ++i) {
-      tasks.emplace_back(isolate(), heap(),
-                         minor_collector_->marking_worklists());
-    }
-    V8::GetCurrentPlatform()
-        ->CreateJob(v8::TaskPriority::kUserBlocking,
-                    std::make_unique<YoungGenerationMarkingJob>(
-                        isolate(), heap_, minor_collector_->marking_worklists(),
-                        std::move(marking_items),
-                        YoungMarkingJobType::kIncremental, tasks))
-        ->Join();
-    for (YoungGenerationMarkingTask& task : tasks) {
-      task.Finalize();
-    }
+    isolate()->global_handles()->IterateYoungStrongAndDependentRoots(
+        &root_visitor);
   }
 }
 
@@ -284,11 +314,17 @@ void IncrementalMarking::StartMarkingMajor() {
 
   heap_->InvokeIncrementalMarkingPrologueCallbacks();
 
+  // Free all existing LABs in the heap such that selecting evacuation
+  // candidates does not need to deal with LABs on a page. While we don't need
+  // this for correctness, we want to avoid creating additional work for
+  // evacuation.
+  heap_->FreeLinearAllocationAreas();
+
   is_compacting_ = major_collector_->StartCompaction(
       MarkCompactCollector::StartCompactionMode::kIncremental);
 
 #ifdef V8_COMPRESS_POINTERS
-  isolate()->external_pointer_table().StartCompactingIfNeeded();
+  heap_->external_pointer_space()->StartCompactingIfNeeded();
 #endif  // V8_COMPRESS_POINTERS
 
   if (heap_->cpp_heap()) {
@@ -301,17 +337,15 @@ void IncrementalMarking::StartMarkingMajor() {
   }
 
   major_collector_->StartMarking();
-  current_local_marking_worklists = major_collector_->local_marking_worklists();
+  current_local_marking_worklists_ =
+      major_collector_->local_marking_worklists();
 
-  is_marking_ = true;
+  marking_mode_ = MarkingMode::kMajorMarking;
   heap_->SetIsMarkingFlag(true);
 
-  MarkingBarrier::ActivateAll(heap(), is_compacting_,
-                              MarkingBarrierType::kMajor);
+  MarkingBarrier::ActivateAll(heap(), is_compacting_);
   isolate()->traced_handles()->SetIsMarking(true);
 
-  isolate()->compilation_cache()->MarkCompactPrologue();
-
   StartBlackAllocation();
 
   {
@@ -320,7 +354,8 @@ void IncrementalMarking::StartMarkingMajor() {
   }
 
   if (v8_flags.concurrent_marking && !heap_->IsTearingDown()) {
-    heap_->concurrent_marking()->ScheduleJob(GarbageCollector::MARK_COMPACTOR);
+    heap_->concurrent_marking()->TryScheduleJob(
+        GarbageCollector::MARK_COMPACTOR);
   }
 
   // Ready to start incremental marking.
@@ -338,7 +373,7 @@ void IncrementalMarking::StartMarkingMajor() {
 
   heap_->InvokeIncrementalMarkingEpilogueCallbacks();
 
-  if (v8_flags.minor_mc && heap_->new_space()) {
+  if (v8_flags.minor_ms && heap_->new_space()) {
     heap_->paged_new_space()->ForceAllocationSuccessUntilNextGC();
   }
 }
@@ -348,30 +383,35 @@ void IncrementalMarking::StartMarkingMinor() {
 
   if (v8_flags.trace_incremental_marking) {
     isolate()->PrintWithTimestamp(
-        "[IncrementalMarking] (MinorMC) Start marking\n");
+        "[IncrementalMarking] (MinorMS) Start marking\n");
   }
 
   minor_collector_->StartMarking();
-  current_local_marking_worklists = minor_collector_->local_marking_worklists();
+  current_local_marking_worklists_ =
+      minor_collector_->local_marking_worklists();
 
-  is_marking_ = true;
+  marking_mode_ = MarkingMode::kMinorMarking;
   heap_->SetIsMarkingFlag(true);
   heap_->SetIsMinorMarkingFlag(true);
 
-  MarkingBarrier::ActivateAll(heap(), false, MarkingBarrierType::kMinor);
+  {
+    Sweeper::PauseMajorSweepingScope pause_sweeping_scope(heap_->sweeper());
+    MarkingBarrier::ActivateYoung(heap());
+  }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_MARK_ROOTS);
+    TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MS_MARK_INCREMENTAL_SEED);
     MarkRoots();
   }
 
-  if (v8_flags.concurrent_marking && !heap_->IsTearingDown()) {
-    heap_->concurrent_marking()->ScheduleJob(
-        GarbageCollector::MINOR_MARK_COMPACTOR);
+  if (v8_flags.concurrent_minor_ms_marking && !heap_->IsTearingDown()) {
+    local_marking_worklists()->PublishWork();
+    heap_->concurrent_marking()->TryScheduleJob(
+        GarbageCollector::MINOR_MARK_SWEEPER);
   }
 
   if (v8_flags.trace_incremental_marking) {
-    isolate()->PrintWithTimestamp("[IncrementalMarking] (MinorMC) Running\n");
+    isolate()->PrintWithTimestamp("[IncrementalMarking] (MinorMS) Running\n");
   }
 
   DCHECK(!is_compacting_);
@@ -379,7 +419,7 @@ void IncrementalMarking::StartMarkingMinor() {
 
 void IncrementalMarking::StartBlackAllocation() {
   DCHECK(!black_allocation_);
-  DCHECK(IsMarking());
+  DCHECK(IsMajorMarking());
   black_allocation_ = true;
   heap()->old_space()->MarkLinearAllocationAreaBlack();
   {
@@ -404,7 +444,7 @@ void IncrementalMarking::StartBlackAllocation() {
 }
 
 void IncrementalMarking::PauseBlackAllocation() {
-  DCHECK(IsMarking());
+  DCHECK(IsMajorMarking());
   heap()->old_space()->UnmarkLinearAllocationArea();
   {
     CodePageHeaderModificationScope rwx_write_scope(
@@ -437,10 +477,12 @@ void IncrementalMarking::FinishBlackAllocation() {
   }
 }
 
-void IncrementalMarking::UpdateMarkingWorklistAfterYoungGenGC() {
-  if (!IsMarking()) return;
+void IncrementalMarking::UpdateMarkingWorklistAfterScavenge() {
+  if (!IsMajorMarking()) return;
   DCHECK(!v8_flags.separate_gc_phases);
   DCHECK(IsMajorMarking());
+  // Minor MS never runs during incremental marking.
+  DCHECK(!v8_flags.minor_ms);
 
   Map filler_map = ReadOnlyRoots(heap_).one_pointer_filler_map();
 
@@ -451,13 +493,15 @@ void IncrementalMarking::UpdateMarkingWorklistAfterYoungGenGC() {
   PtrComprCageBase cage_base(isolate());
   major_collector_->marking_worklists()->Update([this, marking_state, cage_base,
                                                  filler_map](
-                                                    HeapObject obj,
-                                                    HeapObject* out) -> bool {
-    DCHECK(obj.IsHeapObject());
+                                                    Tagged<HeapObject> obj,
+                                                    Tagged<HeapObject>* out)
+                                                    -> bool {
+    DCHECK(IsHeapObject(obj));
+    USE(marking_state);
+
     // Only pointers to from space have to be updated.
     if (Heap::InFromPage(obj)) {
-      DCHECK(!v8_flags.minor_mc);
-      MapWord map_word = obj.map_word(cage_base, kRelaxedLoad);
+      MapWord map_word = obj->map_word(cage_base, kRelaxedLoad);
       if (!map_word.IsForwardingAddress()) {
         // There may be objects on the marking deque that do not exist
         // anymore, e.g. left trimmed objects or objects from the root set
@@ -466,50 +510,36 @@ void IncrementalMarking::UpdateMarkingWorklistAfterYoungGenGC() {
         // Hence, we can discard them.
         return false;
       }
+      // Live young large objects are not relocated and directly promoted into
+      // the old generation before invoking this method. So they looke like any
+      // other pointer into the old space and we won't encounter them here in
+      // this code path.
+      DCHECK(!Heap::IsLargeObject(obj));
       HeapObject dest = map_word.ToForwardingAddress(obj);
-      USE(this);
-      DCHECK_IMPLIES(marking_state->IsUnmarked(obj), obj.IsFreeSpaceOrFiller());
+      DCHECK_IMPLIES(marking_state->IsUnmarked(obj), IsFreeSpaceOrFiller(obj));
       if (dest.InWritableSharedSpace() &&
           !isolate()->is_shared_space_isolate()) {
         // Object got promoted into the shared heap. Drop it from the client
         // heap marking worklist.
         return false;
       }
-      *out = dest;
-      return true;
-    } else if (Heap::InToPage(obj)) {
-      // The object may be on a large page or on a page that was moved in
-      // new space.
-      DCHECK(Heap::IsLargeObject(obj) || Page::FromHeapObject(obj)->IsFlagSet(
-                                             Page::PAGE_NEW_NEW_PROMOTION));
-      DCHECK_IMPLIES(v8_flags.minor_mc, !Page::FromHeapObject(obj)->IsFlagSet(
-                                            Page::PAGE_NEW_NEW_PROMOTION));
-      DCHECK_IMPLIES(
-          v8_flags.minor_mc,
-          !obj.map_word(cage_base, kRelaxedLoad).IsForwardingAddress());
-      if (marking_state->IsUnmarked(obj)) {
-        return false;
+      // For any object not a DescriptorArray, transferring the object always
+      // increments live bytes as the marked state cannot distinguish fully
+      // processed from to-be-processed. Decrement the counter for such objects
+      // here.
+      if (!IsDescriptorArray(dest)) {
+        MemoryChunk::FromHeapObject(dest)->IncrementLiveBytesAtomically(
+            -ALIGN_TO_ALLOCATION_ALIGNMENT(dest->Size()));
       }
-      // Either a large object or an object marked by the minor
-      // mark-compactor.
-      *out = obj;
+      *out = dest;
       return true;
     } else {
-      // The object may be on a page that was moved from new to old space.
-      // Only applicable during minor MC garbage collections.
-      if (!Heap::IsLargeObject(obj) &&
-          Page::FromHeapObject(obj)->IsFlagSet(Page::PAGE_NEW_OLD_PROMOTION)) {
-        if (marking_state->IsUnmarked(obj)) {
-          return false;
-        }
-        *out = obj;
-        return true;
-      }
+      DCHECK(!Heap::InToPage(obj));
       DCHECK_IMPLIES(marking_state->IsUnmarked(obj),
-                     obj.IsFreeSpaceOrFiller(cage_base));
+                     IsFreeSpaceOrFiller(obj, cage_base));
       // Skip one word filler objects that appear on the
       // stack when we perform in place array shift.
-      if (obj.map(cage_base) != filler_map) {
+      if (obj->map(cage_base) != filler_map) {
         *out = obj;
         return true;
       }
@@ -523,24 +553,26 @@ void IncrementalMarking::UpdateMarkingWorklistAfterYoungGenGC() {
 
 void IncrementalMarking::UpdateMarkedBytesAfterScavenge(
     size_t dead_bytes_in_new_space) {
-  if (!IsMarking()) return;
-  bytes_marked_ -= std::min(bytes_marked_, dead_bytes_in_new_space);
+  if (!IsMajorMarking()) return;
+  // When removing the call, adjust the marking schedule to only support
+  // monotonically increasing mutator marked bytes.
+  main_thread_marked_bytes_ -=
+      std::min(main_thread_marked_bytes_, dead_bytes_in_new_space);
 }
 
-void IncrementalMarking::EmbedderStep(double expected_duration_ms,
-                                      double* duration_ms) {
+v8::base::TimeDelta IncrementalMarking::EmbedderStep(
+    v8::base::TimeDelta expected_duration) {
   DCHECK(IsMarking());
   auto* cpp_heap = CppHeap::From(heap_->cpp_heap());
   DCHECK_NOT_NULL(cpp_heap);
   if (!cpp_heap->incremental_marking_supported()) {
-    *duration_ms = 0.0;
-    return;
+    return {};
   }
 
   TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_INCREMENTAL_EMBEDDER_TRACING);
-  const double start = heap_->MonotonicallyIncreasingTimeInMs();
-  cpp_heap->AdvanceTracing(expected_duration_ms);
-  *duration_ms = heap_->MonotonicallyIncreasingTimeInMs() - start;
+  const auto start = v8::base::TimeTicks::Now();
+  cpp_heap->AdvanceTracing(expected_duration);
+  return v8::base::TimeTicks::Now() - start;
 }
 
 bool IncrementalMarking::Stop() {
@@ -567,12 +599,20 @@ bool IncrementalMarking::Stop() {
         space->RemoveAllocationObserver(&old_generation_observer_);
       }
     }
+  } else {
+    DCHECK(IsMinorMarking());
+    heap_->new_space()->RemoveAllocationObserver(&minor_gc_observer_);
   }
 
-  collection_requested_via_stack_guard_ = false;
+  DCHECK(!major_collection_requested_via_stack_guard_ ||
+         !minor_collection_requested_via_stack_guard_);
+  major_collection_requested_via_stack_guard_ = false;
+  minor_collection_requested_via_stack_guard_ = false;
   isolate()->stack_guard()->ClearGC();
 
-  is_marking_ = false;
+  marking_mode_ = MarkingMode::kNoMarking;
+  current_local_marking_worklists_ = nullptr;
+  current_trace_id_.reset();
 
   if (isolate()->has_shared_space() && !isolate()->is_shared_space_isolate()) {
     // When disabling local incremental marking in a client isolate (= worker
@@ -597,149 +637,173 @@ bool IncrementalMarking::Stop() {
     MemoryChunk* memory_chunk = pair.first;
     intptr_t live_bytes = pair.second;
     if (live_bytes) {
-      marking_state()->IncrementLiveBytes(memory_chunk, live_bytes);
+      memory_chunk->IncrementLiveBytesAtomically(live_bytes);
     }
   }
   background_live_bytes_.clear();
-  current_collector_ = CurrentCollector::kNone;
+  schedule_.reset();
 
   return true;
 }
 
-double IncrementalMarking::CurrentTimeToMarkingTask() const {
-  const double recorded_time_to_marking_task =
-      heap_->tracer()->AverageTimeToIncrementalMarkingTask();
-  const double current_time_to_marking_task =
-      incremental_marking_job_.CurrentTimeToTask();
-  if (recorded_time_to_marking_task == 0.0) return 0.0;
-  return std::max(recorded_time_to_marking_task, current_time_to_marking_task);
+size_t IncrementalMarking::OldGenerationSizeOfObjects() const {
+  // TODO(v8:14140): This is different to Heap::OldGenerationSizeOfObjects() in
+  // that it only considers shared space for the shared space isolate. Consider
+  // adjusting the Heap version.
+  const bool is_shared_space_isolate =
+      heap_->isolate()->is_shared_space_isolate();
+  size_t total = 0;
+  PagedSpaceIterator spaces(heap_);
+  for (PagedSpace* space = spaces.Next(); space != nullptr;
+       space = spaces.Next()) {
+    if (space->identity() == SHARED_SPACE && !is_shared_space_isolate) continue;
+    total += space->SizeOfObjects();
+  }
+  total += heap_->lo_space()->SizeOfObjects();
+  total += heap_->code_lo_space()->SizeOfObjects();
+  if (heap_->shared_lo_space() && is_shared_space_isolate) {
+    total += heap_->shared_lo_space()->SizeOfObjects();
+  }
+  return total;
 }
 
 bool IncrementalMarking::ShouldWaitForTask() {
   if (!completion_task_scheduled_) {
-    incremental_marking_job_.ScheduleTask();
+    if (!incremental_marking_job()) {
+      return false;
+    }
+    incremental_marking_job()->ScheduleTask();
     completion_task_scheduled_ = true;
-  }
-
-  if (completion_task_timeout_ == 0.0) {
     if (!TryInitializeTaskTimeout()) {
       return false;
     }
   }
 
-  const double current_time = heap()->MonotonicallyIncreasingTimeInMs();
-  const bool wait_for_task = current_time < completion_task_timeout_;
-
-  if (v8_flags.trace_incremental_marking && wait_for_task) {
+  const auto now = v8::base::TimeTicks::Now();
+  const bool wait_for_task = now < completion_task_timeout_;
+  if (V8_UNLIKELY(v8_flags.trace_incremental_marking)) {
     isolate()->PrintWithTimestamp(
-        "[IncrementalMarking] Delaying GC via stack guard. time left: "
-        "%fms\n",
-        completion_task_timeout_ - current_time);
+        "[IncrementalMarking] Completion: %s GC via stack guard, time left: "
+        "%.1fms\n",
+        wait_for_task ? "Delaying" : "Not delaying",
+        (completion_task_timeout_ - now).InMillisecondsF());
   }
-
   return wait_for_task;
 }
 
 bool IncrementalMarking::TryInitializeTaskTimeout() {
+  DCHECK_NOT_NULL(incremental_marking_job());
   // Allowed overshoot percentage of incremental marking walltime.
-  constexpr double kAllowedOvershoot = 0.1;
+  constexpr double kAllowedOvershootPercentBasedOnWalltime = 0.1;
   // Minimum overshoot in ms. This is used to allow moving away from stack
   // when marking was fast.
-  constexpr double kMinOvershootMs = 50;
-
-  const double now = heap_->MonotonicallyIncreasingTimeInMs();
-  const double overshoot_ms =
-      std::max(kMinOvershootMs, (now - start_time_ms_) * kAllowedOvershoot);
-  const double time_to_marking_task = CurrentTimeToMarkingTask();
-
-  if (time_to_marking_task == 0.0 || time_to_marking_task > overshoot_ms) {
-    if (v8_flags.trace_incremental_marking) {
-      isolate()->PrintWithTimestamp(
-          "[IncrementalMarking] Not delaying marking completion. time to "
-          "task: %fms allowed overshoot: %fms\n",
-          time_to_marking_task, overshoot_ms);
-    }
-
-    return false;
-  } else {
-    completion_task_timeout_ = now + overshoot_ms;
-
-    if (v8_flags.trace_incremental_marking) {
-      isolate()->PrintWithTimestamp(
-          "[IncrementalMarking] Delaying GC via stack guard. time to task: "
-          "%fms "
-          "allowed overshoot: %fms\n",
-          time_to_marking_task, overshoot_ms);
-    }
-
-    return true;
-  }
-}
-
-void IncrementalMarking::FastForwardSchedule() {
-  DCHECK(v8_flags.fast_forward_schedule);
-
-  if (scheduled_bytes_to_mark_ < bytes_marked_) {
-    scheduled_bytes_to_mark_ = bytes_marked_;
-    if (v8_flags.trace_incremental_marking) {
-      isolate()->PrintWithTimestamp(
-          "[IncrementalMarking] Fast-forwarded schedule\n");
-    }
-  }
-}
-
-void IncrementalMarking::FastForwardScheduleIfCloseToFinalization() {
-  // Consider marking close to finalization if 75% of the initial old
-  // generation was marked.
-  if (bytes_marked_ > 3 * (initial_old_generation_size_ / 4)) {
-    FastForwardSchedule();
-  }
-}
-
-void IncrementalMarking::ScheduleBytesToMarkBasedOnTime(double time_ms) {
-  // Time interval that should be sufficient to complete incremental marking.
-  constexpr double kTargetMarkingWallTimeInMs = 500;
-  constexpr double kMinTimeBetweenScheduleInMs = 10;
-  if (schedule_update_time_ms_ + kMinTimeBetweenScheduleInMs > time_ms) return;
-  double delta_ms =
-      std::min(time_ms - schedule_update_time_ms_, kTargetMarkingWallTimeInMs);
-  schedule_update_time_ms_ = time_ms;
-
-  size_t bytes_to_mark =
-      (delta_ms / kTargetMarkingWallTimeInMs) * initial_old_generation_size_;
-  AddScheduledBytesToMark(bytes_to_mark);
-
-  if (v8_flags.trace_incremental_marking) {
+  constexpr auto kMinAllowedOvershoot =
+      v8::base::TimeDelta::FromMilliseconds(50);
+  const auto now = v8::base::TimeTicks::Now();
+  const auto allowed_overshoot = std::max(
+      kMinAllowedOvershoot, v8::base::TimeDelta::FromMillisecondsD(
+                                (now - start_time_).InMillisecondsF() *
+                                kAllowedOvershootPercentBasedOnWalltime));
+  const auto optional_avg_time_to_marking_task =
+      incremental_marking_job()->AverageTimeToTask();
+  // Only allowed to delay if the recorded average exists and is below the
+  // threshold.
+  bool delaying =
+      optional_avg_time_to_marking_task.has_value() &&
+      optional_avg_time_to_marking_task.value() <= allowed_overshoot;
+  const auto optional_time_to_current_task =
+      incremental_marking_job()->CurrentTimeToTask();
+  // Don't bother delaying if the currently scheduled task is already waiting
+  // too long.
+  delaying =
+      delaying && (!optional_time_to_current_task.has_value() ||
+                   optional_time_to_current_task.value() <= allowed_overshoot);
+  if (delaying) {
+    const auto delta =
+        !optional_time_to_current_task.has_value()
+            ? allowed_overshoot
+            : allowed_overshoot - optional_time_to_current_task.value();
+    completion_task_timeout_ = now + delta;
+  }
+  if (V8_UNLIKELY(v8_flags.trace_incremental_marking)) {
     isolate()->PrintWithTimestamp(
-        "[IncrementalMarking] Scheduled %zuKB to mark based on time delta "
-        "%.1fms\n",
-        bytes_to_mark / KB, delta_ms);
+        "[IncrementalMarking] Completion: %s GC via stack guard, "
+        "avg time to task: %.1fms, current time to task: %.1fms allowed "
+        "overshoot: %.1fms\n",
+        delaying ? "Delaying" : "Not delaying",
+        optional_avg_time_to_marking_task.has_value()
+            ? optional_avg_time_to_marking_task->InMillisecondsF()
+            : NAN,
+        optional_time_to_current_task.has_value()
+            ? optional_time_to_current_task->InMillisecondsF()
+            : NAN,
+        allowed_overshoot.InMillisecondsF());
+  }
+  return delaying;
+}
+
+size_t IncrementalMarking::GetScheduledBytes(StepOrigin step_origin) {
+  FetchBytesMarkedConcurrently();
+  // TODO(v8:14140): Consider the size including young generation here as well
+  // as the full marker marks both the young and old generations.
+  const size_t max_bytes_to_process =
+      schedule_->GetNextIncrementalStepDuration(OldGenerationSizeOfObjects());
+  if (V8_UNLIKELY(v8_flags.trace_incremental_marking)) {
+    const auto step_info = schedule_->GetCurrentStepInfo();
+    isolate()->PrintWithTimestamp(
+        "[IncrementalMarking] Schedule: %zuKB to mark, origin: %s, elapsed: "
+        "%.1f, marked: %zuKB (mutator: %zuKB, concurrent %zuKB), expected "
+        "marked: %zuKB, estimated live: %zuKB, schedule delta: %+" PRIi64
+        "KB\n",
+        max_bytes_to_process / KB, ToString(step_origin),
+        step_info.elapsed_time.InMillisecondsF(), step_info.marked_bytes() / KB,
+        step_info.mutator_marked_bytes / KB,
+        step_info.concurrent_marked_bytes / KB,
+        step_info.expected_marked_bytes / KB,
+        step_info.estimated_live_bytes / KB,
+        step_info.scheduled_delta_bytes() / KB);
   }
+  return max_bytes_to_process;
 }
 
 void IncrementalMarking::AdvanceAndFinalizeIfComplete() {
-  ScheduleBytesToMarkBasedOnTime(heap()->MonotonicallyIncreasingTimeInMs());
-  if (v8_flags.fast_forward_schedule) {
-    FastForwardScheduleIfCloseToFinalization();
+  const size_t max_bytes_to_process = GetScheduledBytes(StepOrigin::kTask);
+  Step(GetMaxDuration(StepOrigin::kTask), max_bytes_to_process,
+       StepOrigin::kTask);
+  if (IsMajorMarkingComplete()) {
+    heap()->FinalizeIncrementalMarkingAtomically(
+        GarbageCollectionReason::kFinalizeMarkingViaTask);
   }
-  Step(kStepSizeInMs, StepOrigin::kTask);
-  heap()->FinalizeIncrementalMarkingIfComplete(
-      GarbageCollectionReason::kFinalizeMarkingViaTask);
 }
 
 void IncrementalMarking::AdvanceAndFinalizeIfNecessary() {
   if (!IsMajorMarking()) return;
   DCHECK(!heap_->always_allocate());
   AdvanceOnAllocation();
-
-  if (collection_requested_via_stack_guard_) {
-    heap()->FinalizeIncrementalMarkingIfComplete(
+  if (major_collection_requested_via_stack_guard_ && IsMajorMarkingComplete()) {
+    heap()->FinalizeIncrementalMarkingAtomically(
         GarbageCollectionReason::kFinalizeMarkingViaStackGuard);
   }
 }
 
-void IncrementalMarking::AdvanceForTesting(double max_step_size_in_ms) {
-  Step(max_step_size_in_ms, StepOrigin::kV8);
+void IncrementalMarking::AdvanceForTesting(v8::base::TimeDelta max_duration,
+                                           size_t max_bytes_to_mark) {
+  Step(max_duration, max_bytes_to_mark, StepOrigin::kV8);
+}
+
+bool IncrementalMarking::IsAheadOfSchedule() const {
+  DCHECK(IsMajorMarking());
+
+  const ::heap::base::IncrementalMarkingSchedule* v8_schedule = schedule_.get();
+  if (v8_schedule->GetCurrentStepInfo().is_behind_expectation()) {
+    return false;
+  }
+  if (auto* cpp_heap = CppHeap::From(heap()->cpp_heap())) {
+    if (!cpp_heap->marker()->IsAheadOfSchedule()) {
+      return false;
+    }
+  }
+  return true;
 }
 
 void IncrementalMarking::AdvanceOnAllocation() {
@@ -747,23 +811,18 @@ void IncrementalMarking::AdvanceOnAllocation() {
   DCHECK(v8_flags.incremental_marking);
   DCHECK(IsMajorMarking());
 
-  // Code using an AlwaysAllocateScope assumes that the GC state does not
-  // change; that implies that no marking steps must be performed.
-  if (heap_->always_allocate()) {
-    return;
-  }
-
-  ScheduleBytesToMarkBasedOnAllocation();
-  Step(kMaxStepSizeInMs, StepOrigin::kV8);
+  const size_t max_bytes_to_process = GetScheduledBytes(StepOrigin::kV8);
+  Step(GetMaxDuration(StepOrigin::kV8), max_bytes_to_process, StepOrigin::kV8);
 
-  if (IsMajorMarkingComplete()) {
-    // Marking cannot be finalized here. Schedule a completion task instead.
-    if (!ShouldWaitForTask()) {
-      // When task isn't run soon enough, fall back to stack guard to force
-      // completion.
-      collection_requested_via_stack_guard_ = true;
-      isolate()->stack_guard()->RequestGC();
-    }
+  // Bail out when an AlwaysAllocateScope is active as the assumption is that
+  // there's no GC being triggered. Check this condition at last position to
+  // allow a completion task to be scheduled.
+  if (IsMajorMarkingComplete() && !ShouldWaitForTask() &&
+      !heap()->always_allocate()) {
+    // When completion task isn't run soon enough, fall back to stack guard to
+    // force completion.
+    major_collection_requested_via_stack_guard_ = true;
+    isolate()->stack_guard()->RequestGC();
   }
 }
 
@@ -778,136 +837,66 @@ bool IncrementalMarking::ShouldFinalize() const {
          (!cpp_heap || cpp_heap->ShouldFinalizeIncrementalMarking());
 }
 
-size_t IncrementalMarking::StepSizeToKeepUpWithAllocations() {
-  // Update bytes_allocated_ based on the allocation counter.
-  size_t current_counter = heap_->OldGenerationAllocationCounter();
-  size_t result = current_counter - old_generation_allocation_counter_;
-  old_generation_allocation_counter_ = current_counter;
-  return result;
-}
-
-size_t IncrementalMarking::StepSizeToMakeProgress() {
-  const size_t kTargetStepCount = 256;
-  const size_t kTargetStepCountAtOOM = 32;
-  const size_t kMaxStepSizeInByte = 256 * KB;
-  size_t oom_slack = heap()->new_space()->TotalCapacity() + 64 * MB;
-
-  if (!heap()->CanExpandOldGeneration(oom_slack)) {
-    return heap()->OldGenerationSizeOfObjects() / kTargetStepCountAtOOM;
-  }
-
-  return std::min(std::max({initial_old_generation_size_ / kTargetStepCount,
-                            IncrementalMarking::kMinStepSizeInBytes}),
-                  kMaxStepSizeInByte);
-}
-
-void IncrementalMarking::AddScheduledBytesToMark(size_t bytes_to_mark) {
-  if (scheduled_bytes_to_mark_ + bytes_to_mark < scheduled_bytes_to_mark_) {
-    // The overflow case.
-    scheduled_bytes_to_mark_ = std::numeric_limits<std::size_t>::max();
-  } else {
-    scheduled_bytes_to_mark_ += bytes_to_mark;
-  }
-}
-
-void IncrementalMarking::ScheduleBytesToMarkBasedOnAllocation() {
-  size_t progress_bytes = StepSizeToMakeProgress();
-  size_t allocation_bytes = StepSizeToKeepUpWithAllocations();
-  size_t bytes_to_mark = progress_bytes + allocation_bytes;
-  AddScheduledBytesToMark(bytes_to_mark);
-
-  if (v8_flags.trace_incremental_marking) {
-    isolate()->PrintWithTimestamp(
-        "[IncrementalMarking] Scheduled %zuKB to mark based on allocation "
-        "(progress=%zuKB, allocation=%zuKB)\n",
-        bytes_to_mark / KB, progress_bytes / KB, allocation_bytes / KB);
-  }
-}
-
 void IncrementalMarking::FetchBytesMarkedConcurrently() {
-  if (v8_flags.concurrent_marking) {
-    size_t current_bytes_marked_concurrently =
-        heap()->concurrent_marking()->TotalMarkedBytes();
-    // The concurrent_marking()->TotalMarkedBytes() is not monotonic for a
-    // short period of time when a concurrent marking task is finishing.
-    if (current_bytes_marked_concurrently > bytes_marked_concurrently_) {
-      bytes_marked_ +=
-          current_bytes_marked_concurrently - bytes_marked_concurrently_;
-      bytes_marked_concurrently_ = current_bytes_marked_concurrently;
-    }
-    if (v8_flags.trace_incremental_marking) {
-      isolate()->PrintWithTimestamp(
-          "[IncrementalMarking] Marked %zuKB on background threads\n",
-          heap_->concurrent_marking()->TotalMarkedBytes() / KB);
-    }
-  }
-}
+  if (!v8_flags.concurrent_marking) return;
 
-size_t IncrementalMarking::ComputeStepSizeInBytes(StepOrigin step_origin) {
-  FetchBytesMarkedConcurrently();
-  if (v8_flags.trace_incremental_marking) {
-    if (scheduled_bytes_to_mark_ > bytes_marked_) {
-      isolate()->PrintWithTimestamp(
-          "[IncrementalMarking] Marker is %zuKB behind schedule\n",
-          (scheduled_bytes_to_mark_ - bytes_marked_) / KB);
-    } else {
-      isolate()->PrintWithTimestamp(
-          "[IncrementalMarking] Marker is %zuKB ahead of schedule\n",
-          (bytes_marked_ - scheduled_bytes_to_mark_) / KB);
-    }
+  const size_t current_bytes_marked_concurrently =
+      heap()->concurrent_marking()->TotalMarkedBytes();
+  // The concurrent_marking()->TotalMarkedBytes() is not monotonic for a
+  // short period of time when a concurrent marking task is finishing.
+  if (current_bytes_marked_concurrently > bytes_marked_concurrently_) {
+    const size_t delta =
+        current_bytes_marked_concurrently - bytes_marked_concurrently_;
+    schedule_->AddConcurrentlyMarkedBytes(delta);
+    bytes_marked_concurrently_ = current_bytes_marked_concurrently;
   }
-  // Allow steps on allocation to get behind the schedule by small amount.
-  // This gives higher priority to steps in tasks.
-  size_t kScheduleMarginInBytes = step_origin == StepOrigin::kV8 ? 1 * MB : 0;
-  if (bytes_marked_ + kScheduleMarginInBytes > scheduled_bytes_to_mark_)
-    return 0;
-  return scheduled_bytes_to_mark_ - bytes_marked_ - kScheduleMarginInBytes;
 }
 
-void IncrementalMarking::Step(double max_step_size_in_ms,
+void IncrementalMarking::Step(v8::base::TimeDelta max_duration,
+                              size_t max_bytes_to_process,
                               StepOrigin step_origin) {
   NestedTimedHistogramScope incremental_marking_scope(
       isolate()->counters()->gc_incremental_marking());
   TRACE_EVENT1("v8", "V8.GCIncrementalMarking", "epoch",
                heap_->tracer()->CurrentEpoch(GCTracer::Scope::MC_INCREMENTAL));
-  TRACE_GC_EPOCH(heap_->tracer(), GCTracer::Scope::MC_INCREMENTAL,
-                 ThreadKind::kMain);
+  TRACE_GC_EPOCH_WITH_FLOW(
+      heap_->tracer(), GCTracer::Scope::MC_INCREMENTAL, ThreadKind::kMain,
+      current_trace_id_.value(),
+      TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
   DCHECK(IsMajorMarking());
-  double start = heap_->MonotonicallyIncreasingTimeInMs();
+  const auto start = v8::base::TimeTicks::Now();
+
+  base::Optional<SafepointScope> safepoint_scope;
+  // Conceptually an incremental marking step (even though it always runs on the
+  // main thread) may introduce a form of concurrent marking when background
+  // threads access the heap concurrently (e.g. concurrent compilation). On
+  // builds that verify concurrent heap accesses this may lead to false positive
+  // reports. We can avoid this by stopping background threads just in this
+  // configuration. This should not hide potential issues because the concurrent
+  // marker doesn't rely on correct synchronization but e.g. on black allocation
+  // and the on_hold worklist.
+#ifndef V8_ATOMIC_OBJECT_FIELD_WRITES
+  DCHECK(!v8_flags.concurrent_marking);
+  safepoint_scope.emplace(isolate(), SafepointKind::kIsolate);
+#endif
 
-  size_t bytes_to_process = 0;
   size_t v8_bytes_processed = 0;
-  double embedder_duration = 0.0;
-  double embedder_deadline = 0.0;
+  v8::base::TimeDelta embedder_duration;
+  v8::base::TimeDelta max_embedder_duration;
 
   if (v8_flags.concurrent_marking) {
     // It is safe to merge back all objects that were on hold to the shared
     // work list at Step because we are at a safepoint where all objects
-    // are properly initialized.
+    // are properly initialized. The exception is the last allocated object
+    // before invoking an AllocationObserver. This allocation had no way to
+    // escape and get marked though.
     local_marking_worklists()->MergeOnHold();
   }
-
-// Only print marking worklist in debug mode to save ~40KB of code size.
-#ifdef DEBUG
-  if (v8_flags.trace_incremental_marking && v8_flags.trace_concurrent_marking &&
-      v8_flags.trace_gc_verbose) {
-    major_collector_->marking_worklists()->Print();
+  if (step_origin == StepOrigin::kTask) {
+    // We cannot publish the pending allocations for V8 step origin because the
+    // last object was allocated before invoking the step.
+    heap()->PublishPendingAllocations();
   }
-#endif
-  if (v8_flags.trace_incremental_marking) {
-    isolate()->PrintWithTimestamp(
-        "[IncrementalMarking] Marking speed %.fKB/ms\n",
-        heap()->tracer()->IncrementalMarkingSpeedInBytesPerMillisecond());
-  }
-  // The first step after Scavenge will see many allocated bytes.
-  // Cap the step size to distribute the marking work more uniformly.
-  const double marking_speed =
-      heap()->tracer()->IncrementalMarkingSpeedInBytesPerMillisecond();
-  size_t max_step_size = GCIdleTimeHandler::EstimateMarkingStepSize(
-      max_step_size_in_ms, marking_speed);
-  bytes_to_process =
-      std::min(ComputeStepSizeInBytes(step_origin), max_step_size);
-  bytes_to_process = std::max({bytes_to_process, kMinStepSizeInBytes});
 
   // Perform a single V8 and a single embedder step. In case both have been
   // observed as empty back to back, we can finalize.
@@ -916,17 +905,20 @@ void IncrementalMarking::Step(double max_step_size_in_ms,
   // assumption is that large graphs are well connected and can mostly be
   // processed on their own. For small graphs, helping is not necessary.
   std::tie(v8_bytes_processed, std::ignore) =
-      major_collector_->ProcessMarkingWorklist(bytes_to_process);
-  if (heap_->cpp_heap()) {
-    embedder_deadline =
-        std::min(max_step_size_in_ms,
-                 static_cast<double>(bytes_to_process) / marking_speed);
-    // TODO(chromium:1056170): Replace embedder_deadline with bytes_to_process
-    // after migrating blink to the cppgc library and after v8 can directly
-    // push objects to Oilpan.
-    EmbedderStep(embedder_deadline, &embedder_duration);
+      major_collector_->ProcessMarkingWorklist(
+          max_duration, max_bytes_to_process,
+          MarkCompactCollector::MarkingWorklistProcessingMode::kDefault);
+  main_thread_marked_bytes_ += v8_bytes_processed;
+  schedule_->UpdateMutatorThreadMarkedBytes(main_thread_marked_bytes_);
+  const auto v8_time = v8::base::TimeTicks::Now() - start;
+  if (heap_->cpp_heap() && (v8_time < max_duration)) {
+    // The CppHeap only gets the remaining slice and not the exact same time.
+    // This is fine because CppHeap will schedule its own incremental steps. We
+    // want to help out here to be able to fully finalize when all worklists
+    // have been drained.
+    max_embedder_duration = max_duration - v8_time;
+    embedder_duration = EmbedderStep(max_embedder_duration);
   }
-  bytes_marked_ += v8_bytes_processed;
 
   if (v8_flags.concurrent_marking) {
     local_marking_worklists()->ShareWork();
@@ -934,22 +926,62 @@ void IncrementalMarking::Step(double max_step_size_in_ms,
         GarbageCollector::MARK_COMPACTOR);
   }
 
-  const double current_time = heap_->MonotonicallyIncreasingTimeInMs();
-  const double v8_duration = current_time - start - embedder_duration;
-  heap_->tracer()->AddIncrementalMarkingStep(v8_duration, v8_bytes_processed);
+  heap_->tracer()->AddIncrementalMarkingStep(v8_time.InMillisecondsF(),
+                                             v8_bytes_processed);
 
-  if (v8_flags.trace_incremental_marking) {
+  if (V8_UNLIKELY(v8_flags.trace_incremental_marking)) {
     isolate()->PrintWithTimestamp(
-        "[IncrementalMarking] Step %s V8: %zuKB (%zuKB), embedder: %fms "
-        "(%fms) "
-        "in %.1f\n",
-        step_origin == StepOrigin::kV8 ? "in v8" : "in task",
-        v8_bytes_processed / KB, bytes_to_process / KB, embedder_duration,
-        embedder_deadline, current_time - start);
+        "[IncrementalMarking] Step: origin: %s, V8: %zuKB (%zuKB) in %.1f, "
+        "embedder: %fms (%fms) in %.1f (%.1f), V8 marking speed: %.fMB/s\n",
+        ToString(step_origin), v8_bytes_processed / KB,
+        max_bytes_to_process / KB, v8_time.InMillisecondsF(),
+        embedder_duration.InMillisecondsF(),
+        max_embedder_duration.InMillisecondsF(),
+        (v8::base::TimeTicks::Now() - start).InMillisecondsF(),
+        max_duration.InMillisecondsF(),
+        heap()->tracer()->IncrementalMarkingSpeedInBytesPerMillisecond() *
+            1000 / MB);
+  }
+}
+
+void IncrementalMarking::RequestMinorGCFinalizationIfNeeded() {
+  DCHECK(v8_flags.concurrent_minor_ms_marking);
+  TRACE_GC_EPOCH_WITH_FLOW(
+      heap_->tracer(), GCTracer::Scope::MINOR_MS_INCREMENTAL_STEP,
+      ThreadKind::kMain, current_trace_id_.value(),
+      TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
+  // Finalize concurrent marking if markers are out of work. Since the main
+  // thread local worklist has not yet been flushed, write barrier items
+  // curerntly in the local are not accounted for in this check. This creates
+  // "slack" in the condition so that finalization is not constantly delayed due
+  // to write barriers.
+  if (!heap_->concurrent_marking()->IsWorkLeft()) {
+    minor_collection_requested_via_stack_guard_ = true;
+    isolate()->stack_guard()->RequestGC();
+  } else {
+    local_marking_worklists()->MergeOnHold();
+    local_marking_worklists()->PublishWork();
+    heap_->concurrent_marking()->RescheduleJobIfNeeded(
+        GarbageCollector::MINOR_MARK_SWEEPER);
   }
 }
 
 Isolate* IncrementalMarking::isolate() const { return heap_->isolate(); }
 
+IncrementalMarking::PauseBlackAllocationScope::PauseBlackAllocationScope(
+    IncrementalMarking* marking)
+    : marking_(marking) {
+  if (marking_->black_allocation()) {
+    paused_ = true;
+    marking_->PauseBlackAllocation();
+  }
+}
+
+IncrementalMarking::PauseBlackAllocationScope::~PauseBlackAllocationScope() {
+  if (paused_) {
+    marking_->StartBlackAllocation();
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/incremental-marking.h b/deps/v8/src/heap/incremental-marking.h
index 7563e5ce037dc5..986f7307f20ae6 100644
--- a/deps/v8/src/heap/incremental-marking.h
+++ b/deps/v8/src/heap/incremental-marking.h
@@ -5,12 +5,17 @@
 #ifndef V8_HEAP_INCREMENTAL_MARKING_H_
 #define V8_HEAP_INCREMENTAL_MARKING_H_
 
+#include <cstdint>
+
+#include "src/base/functional.h"
 #include "src/base/logging.h"
 #include "src/base/platform/mutex.h"
+#include "src/base/platform/time.h"
 #include "src/common/globals.h"
 #include "src/heap/heap.h"
 #include "src/heap/incremental-marking-job.h"
 #include "src/heap/mark-compact.h"
+#include "src/heap/memory-chunk.h"
 #include "src/tasks/cancelable-task.h"
 
 namespace v8 {
@@ -36,76 +41,68 @@ enum class StepOrigin {
   kTask
 };
 
-enum class CurrentCollector { kNone, kMinorMC, kMajorMC };
+constexpr const char* ToString(StepOrigin step_origin) {
+  switch (step_origin) {
+    case StepOrigin::kV8:
+      return "V8";
+    case StepOrigin::kTask:
+      return "task";
+  }
+}
 
 class V8_EXPORT_PRIVATE IncrementalMarking final {
  public:
-  class V8_NODISCARD PauseBlackAllocationScope {
+  class V8_NODISCARD PauseBlackAllocationScope final {
    public:
-    explicit PauseBlackAllocationScope(IncrementalMarking* marking)
-        : marking_(marking) {
-      if (marking_->black_allocation()) {
-        paused_ = true;
-        marking_->PauseBlackAllocation();
-      }
-    }
-
-    ~PauseBlackAllocationScope() {
-      if (paused_) {
-        marking_->StartBlackAllocation();
-      }
-    }
+    explicit PauseBlackAllocationScope(IncrementalMarking* marking);
+    ~PauseBlackAllocationScope();
+
+    PauseBlackAllocationScope(const PauseBlackAllocationScope&) = delete;
+    PauseBlackAllocationScope& operator=(const PauseBlackAllocationScope&) =
+        delete;
 
    private:
-    IncrementalMarking* marking_;
+    IncrementalMarking* const marking_;
     bool paused_ = false;
   };
 
-  // It's hard to know how much work the incremental marker should do to make
-  // progress in the face of the mutator creating new work for it.  We start
-  // of at a moderate rate of work and gradually increase the speed of the
-  // incremental marker until it completes.
-  // Do some marking every time this much memory has been allocated or that many
-  // heavy (color-checking) write barriers have been invoked.
-  static const size_t kYoungGenerationAllocatedThreshold = 64 * KB;
-  static const size_t kOldGenerationAllocatedThreshold = 256 * KB;
-  static const size_t kMinStepSizeInBytes = 64 * KB;
-
-  static constexpr double kStepSizeInMs = 1;
-  static constexpr double kMaxStepSizeInMs = 5;
-
-#ifndef DEBUG
-  static constexpr size_t kV8ActivationThreshold = 8 * MB;
-  static constexpr size_t kEmbedderActivationThreshold = 8 * MB;
-#else
-  static constexpr size_t kV8ActivationThreshold = 0;
-  static constexpr size_t kEmbedderActivationThreshold = 0;
-#endif
-
-  V8_INLINE void TransferColor(HeapObject from, HeapObject to);
+  V8_INLINE void TransferColor(Tagged<HeapObject> from, Tagged<HeapObject> to);
 
   IncrementalMarking(Heap* heap, WeakObjects* weak_objects);
 
+  IncrementalMarking(const IncrementalMarking&) = delete;
+  IncrementalMarking& operator=(const IncrementalMarking&) = delete;
+
+  MarkingMode marking_mode() const { return marking_mode_; }
+
+  bool IsMinorMarking() const {
+    return marking_mode_ == MarkingMode::kMinorMarking;
+  }
+  bool IsMajorMarking() const {
+    return marking_mode_ == MarkingMode::kMajorMarking;
+  }
+
   bool IsStopped() const { return !IsMarking(); }
-  bool IsMarking() const { return is_marking_; }
+  bool IsMarking() const { return marking_mode_ != MarkingMode::kNoMarking; }
   bool IsMajorMarkingComplete() const {
     return IsMajorMarking() && ShouldFinalize();
   }
 
-  bool CollectionRequested() const {
-    return collection_requested_via_stack_guard_;
+  bool MajorCollectionRequested() const {
+    return major_collection_requested_via_stack_guard_;
   }
 
-  bool ShouldFinalize() const;
+  bool MinorCollectionRequested() const {
+    return minor_collection_requested_via_stack_guard_;
+  }
 
   bool CanBeStarted() const;
-
   void Start(GarbageCollector garbage_collector,
              GarbageCollectionReason gc_reason);
   // Returns true if incremental marking was running and false otherwise.
   bool Stop();
 
-  void UpdateMarkingWorklistAfterYoungGenGC();
+  void UpdateMarkingWorklistAfterScavenge();
   void UpdateMarkedBytesAfterScavenge(size_t dead_bytes_in_new_space);
 
   // Performs incremental marking step and finalizes marking if complete.
@@ -120,155 +117,122 @@ class V8_EXPORT_PRIVATE IncrementalMarking final {
   // marking completes.
   void AdvanceOnAllocation();
 
-  void MarkBlackBackground(HeapObject obj, int object_size);
+  bool IsAheadOfSchedule() const;
 
-  bool IsCompacting() { return IsMarking() && is_compacting_; }
+  bool IsCompacting() { return IsMajorMarking() && is_compacting_; }
 
   Heap* heap() const { return heap_; }
   Isolate* isolate() const;
 
-  IncrementalMarkingJob* incremental_marking_job() {
-    return &incremental_marking_job_;
+  IncrementalMarkingJob* incremental_marking_job() const {
+    return incremental_marking_job_.get();
   }
 
   bool black_allocation() { return black_allocation_; }
 
-  MarkingWorklists::Local* local_marking_worklists() const {
-    return current_local_marking_worklists;
-  }
-
   bool IsBelowActivationThresholds() const;
 
-  void IncrementLiveBytesBackground(MemoryChunk* chunk, intptr_t by) {
-    base::MutexGuard guard(&background_live_bytes_mutex_);
-    background_live_bytes_[chunk] += by;
-  }
+  void MarkBlackBackground(Tagged<HeapObject> obj, int object_size);
 
   void MarkRootsForTesting();
 
   // Performs incremental marking step for unit tests.
-  void AdvanceForTesting(double max_step_size_in_ms);
+  void AdvanceForTesting(v8::base::TimeDelta max_duration,
+                         size_t max_bytes_to_mark = SIZE_MAX);
 
-  bool IsMinorMarking() const {
-    return IsMarking() && current_collector_ == CurrentCollector::kMinorMC;
-  }
-  bool IsMajorMarking() const {
-    return IsMarking() && current_collector_ == CurrentCollector::kMajorMC;
-  }
+  uint64_t current_trace_id() const { return current_trace_id_.value(); }
 
  private:
-  MarkingState* marking_state() { return marking_state_; }
-  AtomicMarkingState* atomic_marking_state() { return atomic_marking_state_; }
-
   class IncrementalMarkingRootMarkingVisitor;
 
-  class Observer : public AllocationObserver {
+  class Observer final : public AllocationObserver {
    public:
-    Observer(IncrementalMarking* incremental_marking, intptr_t step_size)
-        : AllocationObserver(step_size),
-          incremental_marking_(incremental_marking) {}
-
+    Observer(IncrementalMarking* incremental_marking, intptr_t step_size);
+    ~Observer() override = default;
     void Step(int bytes_allocated, Address, size_t) override;
 
    private:
-    IncrementalMarking* incremental_marking_;
+    IncrementalMarking* const incremental_marking_;
+  };
+
+  class MinorGCObserver final : public AllocationObserver {
+   public:
+    explicit MinorGCObserver(IncrementalMarking* incremental_marking);
+    ~MinorGCObserver() override = default;
+    void Step(int, Address, size_t) final;
+
+   private:
+    IncrementalMarking* const incremental_marking_;
   };
 
   void StartMarkingMajor();
   void StartMarkingMinor();
 
-  void EmbedderStep(double expected_duration_ms, double* duration_ms);
-
   void StartBlackAllocation();
   void PauseBlackAllocation();
   void FinishBlackAllocation();
 
+  void MarkRoots();
+  // Returns true if the function succeeds in transitioning the object
+  // from white to grey.
+  bool WhiteToGreyAndPush(Tagged<HeapObject> obj);
   void PublishWriteBarrierWorklists();
 
-  // Updates scheduled_bytes_to_mark_ to ensure marking progress based on
-  // time.
-  void ScheduleBytesToMarkBasedOnTime(double time_ms);
-  // Updates scheduled_bytes_to_mark_ to ensure marking progress based on
-  // allocations.
-  void ScheduleBytesToMarkBasedOnAllocation();
-  // Helper functions for ScheduleBytesToMarkBasedOnAllocation.
-  size_t StepSizeToKeepUpWithAllocations();
-  size_t StepSizeToMakeProgress();
-  void AddScheduledBytesToMark(size_t bytes_to_mark);
-
-  // Schedules more bytes to mark so that the marker is no longer ahead
-  // of schedule.
-  void FastForwardSchedule();
-  void FastForwardScheduleIfCloseToFinalization();
-
   // Fetches marked byte counters from the concurrent marker.
   void FetchBytesMarkedConcurrently();
+  size_t GetScheduledBytes(StepOrigin step_origin);
 
-  // Returns the bytes to mark in the current step based on the scheduled
-  // bytes and already marked bytes.
-  size_t ComputeStepSizeInBytes(StepOrigin step_origin);
+  bool ShouldFinalize() const;
 
   bool ShouldWaitForTask();
   bool TryInitializeTaskTimeout();
 
-  void MarkRoots();
-
-  // Performs incremental marking steps and returns before the deadline_in_ms is
-  // reached. It may return earlier if the marker is already ahead of the
-  // marking schedule, which is indicated with StepResult::kDone.
-  void AdvanceWithDeadline(StepOrigin step_origin);
+  // Returns the actual used time.
+  v8::base::TimeDelta EmbedderStep(v8::base::TimeDelta expected_duration);
+  void Step(v8::base::TimeDelta max_duration, size_t max_bytes_to_process,
+            StepOrigin step_origin);
 
-  void Step(double max_step_size_in_ms, StepOrigin step_origin);
+  size_t OldGenerationSizeOfObjects() const;
 
-  // Returns true if the function succeeds in transitioning the object
-  // from white to grey.
-  bool WhiteToGreyAndPush(HeapObject obj);
+  void RequestMinorGCFinalizationIfNeeded();
 
-  double CurrentTimeToMarkingTask() const;
+  MarkingState* marking_state() { return marking_state_; }
+  MarkingWorklists::Local* local_marking_worklists() const {
+    return current_local_marking_worklists_;
+  }
 
   Heap* const heap_;
-
-  CurrentCollector current_collector_{CurrentCollector::kNone};
-
   MarkCompactCollector* const major_collector_;
-  MinorMarkCompactCollector* const minor_collector_;
-
+  MinorMarkSweepCollector* const minor_collector_;
   WeakObjects* weak_objects_;
-
-  MarkingWorklists::Local* current_local_marking_worklists;
-
-  double start_time_ms_ = 0.0;
-  size_t initial_old_generation_size_ = 0;
-  size_t old_generation_allocation_counter_ = 0;
-  size_t bytes_marked_ = 0;
-  size_t scheduled_bytes_to_mark_ = 0;
-  double schedule_update_time_ms_ = 0.0;
+  MarkingWorklists::Local* current_local_marking_worklists_ = nullptr;
+  MarkingState* const marking_state_;
+  v8::base::TimeTicks start_time_;
+  size_t main_thread_marked_bytes_ = 0;
   // A sample of concurrent_marking()->TotalMarkedBytes() at the last
-  // incremental marking step. It is used for updating
-  // bytes_marked_ahead_of_schedule_ with contribution of concurrent marking.
+  // incremental marking step.
   size_t bytes_marked_concurrently_ = 0;
-
-  bool is_marking_ = false;
+  MarkingMode marking_mode_ = MarkingMode::kNoMarking;
 
   bool is_compacting_ = false;
   bool black_allocation_ = false;
-
   bool completion_task_scheduled_ = false;
-  double completion_task_timeout_ = 0.0;
-  bool collection_requested_via_stack_guard_ = false;
-  IncrementalMarkingJob incremental_marking_job_;
-
+  v8::base::TimeTicks completion_task_timeout_;
+  bool major_collection_requested_via_stack_guard_ = false;
+  bool minor_collection_requested_via_stack_guard_ = false;
+  std::unique_ptr<IncrementalMarkingJob> incremental_marking_job_;
   Observer new_generation_observer_;
   Observer old_generation_observer_;
-
-  MarkingState* const marking_state_;
-  AtomicMarkingState* const atomic_marking_state_;
-
+  MinorGCObserver minor_gc_observer_;
   base::Mutex background_live_bytes_mutex_;
-  std::unordered_map<MemoryChunk*, intptr_t> background_live_bytes_;
+  std::unordered_map<MemoryChunk*, intptr_t, base::hash<MemoryChunk*>>
+      background_live_bytes_;
+  std::unique_ptr<::heap::base::IncrementalMarkingSchedule> schedule_;
+  base::Optional<uint64_t> current_trace_id_;
 
-  DISALLOW_IMPLICIT_CONSTRUCTORS(IncrementalMarking);
+  friend class IncrementalMarkingJob;
 };
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/index-generator.cc b/deps/v8/src/heap/index-generator.cc
index 150e3fa1597c77..43697013506647 100644
--- a/deps/v8/src/heap/index-generator.cc
+++ b/deps/v8/src/heap/index-generator.cc
@@ -7,20 +7,17 @@
 namespace v8 {
 namespace internal {
 
-IndexGenerator::IndexGenerator(size_t size) : size_(size) {
+IndexGenerator::IndexGenerator(size_t size) : first_use_(size > 0) {
   if (size == 0) return;
   base::MutexGuard guard(&lock_);
-  pending_indices_.push(0);
-  ranges_to_split_.push({0, size_});
+  ranges_to_split_.emplace(0, size);
 }
 
 base::Optional<size_t> IndexGenerator::GetNext() {
   base::MutexGuard guard(&lock_);
-  if (!pending_indices_.empty()) {
-    // Return any pending index first.
-    auto index = pending_indices_.top();
-    pending_indices_.pop();
-    return index;
+  if (first_use_) {
+    first_use_ = false;
+    return 0;
   }
   if (ranges_to_split_.empty()) return base::nullopt;
 
@@ -32,17 +29,10 @@ base::Optional<size_t> IndexGenerator::GetNext() {
   size_t mid = range.first + size / 2;
   // Both sides of the range are added to |ranges_to_split_| so they may be
   // further split if possible.
-  if (mid - range.first > 1) ranges_to_split_.push({range.first, mid});
-  if (range.second - mid > 1) ranges_to_split_.push({mid, range.second});
+  if (mid - range.first > 1) ranges_to_split_.emplace(range.first, mid);
+  if (range.second - mid > 1) ranges_to_split_.emplace(mid, range.second);
   return mid;
 }
 
-void IndexGenerator::GiveBack(size_t index) {
-  base::MutexGuard guard(&lock_);
-  // Add |index| to pending indices so GetNext() may return it before anything
-  // else.
-  pending_indices_.push(index);
-}
-
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/index-generator.h b/deps/v8/src/heap/index-generator.h
index 0e4df1714edae3..e05fa1a2e995dc 100644
--- a/deps/v8/src/heap/index-generator.h
+++ b/deps/v8/src/heap/index-generator.h
@@ -7,7 +7,6 @@
 
 #include <cstddef>
 #include <queue>
-#include <stack>
 
 #include "src/base/macros.h"
 #include "src/base/optional.h"
@@ -25,16 +24,12 @@ class V8_EXPORT_PRIVATE IndexGenerator {
   IndexGenerator& operator=(const IndexGenerator&) = delete;
 
   base::Optional<size_t> GetNext();
-  void GiveBack(size_t index);
 
  private:
   base::Mutex lock_;
-  // Pending indices that are ready to be handed out, prioritized over
-  // |pending_ranges_| when non-empty.
-  std::stack<size_t> pending_indices_;
-  // Pending [start, end] (exclusive) ranges to split and hand out indices from.
+  bool first_use_;
+  // Pending [start, end) ranges to split and hand out indices from.
   std::queue<std::pair<size_t, size_t>> ranges_to_split_;
-  const size_t size_;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/invalidated-slots-inl.h b/deps/v8/src/heap/invalidated-slots-inl.h
deleted file mode 100644
index 9d38e5d44d3338..00000000000000
--- a/deps/v8/src/heap/invalidated-slots-inl.h
+++ /dev/null
@@ -1,114 +0,0 @@
-// Copyright 2017 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_HEAP_INVALIDATED_SLOTS_INL_H_
-#define V8_HEAP_INVALIDATED_SLOTS_INL_H_
-
-#include "src/base/logging.h"
-#include "src/heap/invalidated-slots.h"
-#include "src/heap/marking-state-inl.h"
-#include "src/heap/spaces.h"
-#include "src/objects/heap-object.h"
-#include "src/objects/objects-inl.h"
-#include "src/utils/allocation.h"
-
-namespace v8 {
-namespace internal {
-
-bool InvalidatedSlotsFilter::IsValid(Address slot) {
-#ifdef DEBUG
-  DCHECK_LT(slot, sentinel_);
-  // Slots must come in non-decreasing order.
-  DCHECK_LE(last_slot_, slot);
-  last_slot_ = slot;
-#endif
-  if (slot < current_.address) {
-    return true;
-  }
-
-  while (slot >= next_.address) {
-    NextInvalidatedObject();
-  }
-
-  int offset = static_cast<int>(slot - current_.address);
-
-  // OLD_TO_OLD can have slots in map word unlike other remembered sets.
-  DCHECK_GE(offset, 0);
-  DCHECK_IMPLIES(remembered_set_type_ != OLD_TO_OLD, offset > 0);
-
-#if DEBUG
-  if (current_.is_live) {
-    HeapObject object = HeapObject::FromAddress(current_.address);
-    DCHECK_EQ(object.Size(), current_.size);
-  }
-#endif
-
-  if (offset < current_.size) {
-    // Slots in dead invalid objects are all treated as invalid.
-    if (!current_.is_live) return false;
-
-    // Map word is always a valid tagged reference.
-    if (offset == 0) return true;
-
-    // Check whether object has a tagged field at that particular offset.
-    HeapObject invalidated_object = HeapObject::FromAddress(current_.address);
-    DCHECK_IMPLIES(marking_state_,
-                   marking_state_->IsMarked(invalidated_object));
-    DCHECK(MarkCompactCollector::IsMapOrForwarded(invalidated_object.map()));
-    return invalidated_object.IsValidSlot(invalidated_object.map(), offset);
-  }
-
-  NextInvalidatedObject();
-  return true;
-}
-
-void InvalidatedSlotsFilter::NextInvalidatedObject() {
-  current_ = next_;
-
-  if (iterator_ == iterator_end_) {
-    next_ = {sentinel_, 0, false};
-  } else {
-    HeapObject object = iterator_->first;
-    bool is_live = marking_state_ ? marking_state_->IsMarked(object) : true;
-    next_ = {object.address(), iterator_->second, is_live};
-    iterator_++;
-  }
-}
-
-void InvalidatedSlotsCleanup::Free(Address free_start, Address free_end) {
-#ifdef DEBUG
-  DCHECK_LT(free_start, free_end);
-  // Free regions should come in increasing order and do not overlap
-  DCHECK_LE(last_free_, free_start);
-  last_free_ = free_start;
-#endif
-
-  if (iterator_ == iterator_end_) return;
-
-  // Ignore invalidated objects that start before free region
-  while (invalidated_start_ < free_start) {
-    ++iterator_;
-    NextInvalidatedObject();
-  }
-
-  // Remove all invalidated objects that start within
-  // free region.
-  while (invalidated_start_ < free_end) {
-    iterator_ = invalidated_slots_->erase(iterator_);
-    NextInvalidatedObject();
-  }
-}
-
-void InvalidatedSlotsCleanup::NextInvalidatedObject() {
-  if (iterator_ != iterator_end_) {
-    invalidated_start_ = iterator_->first.address();
-  } else {
-    invalidated_start_ = sentinel_;
-  }
-}
-
-}  // namespace internal
-}  // namespace v8
-
-#endif  // V8_HEAP_INVALIDATED_SLOTS_INL_H_
diff --git a/deps/v8/src/heap/invalidated-slots.cc b/deps/v8/src/heap/invalidated-slots.cc
deleted file mode 100644
index 7fc89621205ae2..00000000000000
--- a/deps/v8/src/heap/invalidated-slots.cc
+++ /dev/null
@@ -1,94 +0,0 @@
-// Copyright 2017 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/heap/invalidated-slots.h"
-
-#include "src/base/logging.h"
-#include "src/heap/invalidated-slots-inl.h"
-#include "src/heap/memory-chunk-layout.h"
-#include "src/heap/memory-chunk.h"
-#include "src/heap/spaces.h"
-#include "src/objects/objects-inl.h"
-
-namespace v8 {
-namespace internal {
-
-InvalidatedSlotsFilter InvalidatedSlotsFilter::OldToOld(
-    MemoryChunk* chunk, LivenessCheck liveness_check) {
-  return InvalidatedSlotsFilter(chunk, chunk->invalidated_slots<OLD_TO_OLD>(),
-                                OLD_TO_OLD, liveness_check);
-}
-
-InvalidatedSlotsFilter InvalidatedSlotsFilter::OldToNew(
-    MemoryChunk* chunk, LivenessCheck liveness_check) {
-  return InvalidatedSlotsFilter(chunk, chunk->invalidated_slots<OLD_TO_NEW>(),
-                                OLD_TO_NEW, liveness_check);
-}
-
-InvalidatedSlotsFilter InvalidatedSlotsFilter::OldToShared(
-    MemoryChunk* chunk, LivenessCheck liveness_check) {
-  return InvalidatedSlotsFilter(chunk,
-                                chunk->invalidated_slots<OLD_TO_SHARED>(),
-                                OLD_TO_SHARED, liveness_check);
-}
-
-InvalidatedSlotsFilter::InvalidatedSlotsFilter(
-    MemoryChunk* chunk, InvalidatedSlots* invalidated_slots,
-    RememberedSetType remembered_set_type, LivenessCheck liveness_check)
-    : marking_state_(liveness_check == LivenessCheck::kYes
-                         ? chunk->heap()->non_atomic_marking_state()
-                         : nullptr) {
-  USE(remembered_set_type);
-  invalidated_slots = invalidated_slots ? invalidated_slots : &empty_;
-
-  iterator_ = invalidated_slots->begin();
-  iterator_end_ = invalidated_slots->end();
-  sentinel_ = chunk->area_end();
-
-  // Invoke NextInvalidatedObject twice, to initialize
-  // invalidated_start_ to the first invalidated object and
-  // next_invalidated_object_ to the second one.
-  NextInvalidatedObject();
-  NextInvalidatedObject();
-
-#ifdef DEBUG
-  last_slot_ = chunk->area_start();
-  remembered_set_type_ = remembered_set_type;
-#endif
-}
-
-InvalidatedSlotsCleanup InvalidatedSlotsCleanup::OldToNew(MemoryChunk* chunk) {
-  return InvalidatedSlotsCleanup(chunk, chunk->invalidated_slots<OLD_TO_NEW>());
-}
-
-InvalidatedSlotsCleanup InvalidatedSlotsCleanup::OldToOld(MemoryChunk* chunk) {
-  return InvalidatedSlotsCleanup(chunk, chunk->invalidated_slots<OLD_TO_OLD>());
-}
-
-InvalidatedSlotsCleanup InvalidatedSlotsCleanup::OldToShared(
-    MemoryChunk* chunk) {
-  return InvalidatedSlotsCleanup(chunk,
-                                 chunk->invalidated_slots<OLD_TO_SHARED>());
-}
-
-InvalidatedSlotsCleanup InvalidatedSlotsCleanup::NoCleanup(MemoryChunk* chunk) {
-  return InvalidatedSlotsCleanup(chunk, nullptr);
-}
-
-InvalidatedSlotsCleanup::InvalidatedSlotsCleanup(
-    MemoryChunk* chunk, InvalidatedSlots* invalidated_slots) {
-  invalidated_slots_ = invalidated_slots ? invalidated_slots : &empty_;
-  iterator_ = invalidated_slots_->begin();
-  iterator_end_ = invalidated_slots_->end();
-  sentinel_ = chunk->area_end();
-
-  NextInvalidatedObject();
-
-#ifdef DEBUG
-  last_free_ = chunk->area_start();
-#endif
-}
-
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/src/heap/invalidated-slots.h b/deps/v8/src/heap/invalidated-slots.h
deleted file mode 100644
index 1f711b7077a823..00000000000000
--- a/deps/v8/src/heap/invalidated-slots.h
+++ /dev/null
@@ -1,108 +0,0 @@
-// Copyright 2017 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_HEAP_INVALIDATED_SLOTS_H_
-#define V8_HEAP_INVALIDATED_SLOTS_H_
-
-#include <set>
-#include <stack>
-
-#include "src/base/atomic-utils.h"
-#include "src/heap/memory-chunk-layout.h"
-#include "src/objects/heap-object.h"
-#include "src/utils/allocation.h"
-#include "src/utils/utils.h"
-
-namespace v8 {
-namespace internal {
-
-// This data structure stores objects that went through object layout change
-// that potentially invalidates slots recorded concurrently. The second part
-// of each element is the size of the corresponding object before the layout
-// change.
-using InvalidatedSlots = std::map<HeapObject, int, Object::Comparer>;
-
-class NonAtomicMarkingState;
-
-// This class provides IsValid predicate that takes into account the set
-// of invalidated objects in the given memory chunk.
-// The sequence of queried slot must be non-decreasing. This allows fast
-// implementation with complexity O(m*log(m) + n), where
-// m is the number of invalidated objects in the memory chunk.
-// n is the number of IsValid queries.
-class V8_EXPORT_PRIVATE InvalidatedSlotsFilter {
- public:
-  enum class LivenessCheck {
-    kYes,
-    kNo,
-  };
-
-  static InvalidatedSlotsFilter OldToOld(MemoryChunk* chunk,
-                                         LivenessCheck liveness_check);
-  static InvalidatedSlotsFilter OldToNew(MemoryChunk* chunk,
-                                         LivenessCheck liveness_check);
-  static InvalidatedSlotsFilter OldToShared(MemoryChunk* chunk,
-                                            LivenessCheck liveness_check);
-
-  inline bool IsValid(Address slot);
-
- private:
-  struct InvalidatedObjectInfo {
-    Address address;
-    int size;
-    bool is_live;
-  };
-
-  explicit InvalidatedSlotsFilter(MemoryChunk* chunk,
-                                  InvalidatedSlots* invalidated_slots,
-                                  RememberedSetType remembered_set_type,
-                                  LivenessCheck liveness_check);
-
-  InvalidatedSlots::const_iterator iterator_;
-  InvalidatedSlots::const_iterator iterator_end_;
-  Address sentinel_;
-  InvalidatedObjectInfo current_{kNullAddress, 0, false};
-  InvalidatedObjectInfo next_{kNullAddress, 0, false};
-  NonAtomicMarkingState* const marking_state_;
-  InvalidatedSlots empty_;
-#ifdef DEBUG
-  Address last_slot_;
-  RememberedSetType remembered_set_type_;
-#endif
-
- private:
-  inline void NextInvalidatedObject();
-};
-
-class V8_EXPORT_PRIVATE InvalidatedSlotsCleanup {
- public:
-  static InvalidatedSlotsCleanup OldToNew(MemoryChunk* chunk);
-  static InvalidatedSlotsCleanup OldToOld(MemoryChunk* chunk);
-  static InvalidatedSlotsCleanup OldToShared(MemoryChunk* chunk);
-  static InvalidatedSlotsCleanup NoCleanup(MemoryChunk* chunk);
-
-  explicit InvalidatedSlotsCleanup(MemoryChunk* chunk,
-                                   InvalidatedSlots* invalidated_slots);
-
-  inline void Free(Address free_start, Address free_end);
-
- private:
-  InvalidatedSlots::iterator iterator_;
-  InvalidatedSlots::iterator iterator_end_;
-  InvalidatedSlots* invalidated_slots_;
-  InvalidatedSlots empty_;
-
-  Address sentinel_;
-  Address invalidated_start_;
-
-  inline void NextInvalidatedObject();
-#ifdef DEBUG
-  Address last_free_;
-#endif
-};
-
-}  // namespace internal
-}  // namespace v8
-
-#endif  // V8_HEAP_INVALIDATED_SLOTS_H_
diff --git a/deps/v8/src/heap/large-page.cc b/deps/v8/src/heap/large-page.cc
new file mode 100644
index 00000000000000..f4b1a0ec34fac6
--- /dev/null
+++ b/deps/v8/src/heap/large-page.cc
@@ -0,0 +1,74 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/large-page.h"
+
+#include "src/base/sanitizer/msan.h"
+#include "src/common/globals.h"
+#include "src/heap/memory-chunk.h"
+#include "src/heap/remembered-set.h"
+
+namespace v8 {
+namespace internal {
+
+class Heap;
+
+// This check is here to ensure that the lower 32 bits of any real heap object
+// can't overlap with the lower 32 bits of cleared weak reference value and
+// therefore it's enough to compare only the lower 32 bits of a MaybeObject in
+// order to figure out if it's a cleared weak reference or not.
+static_assert(kClearedWeakHeapObjectLower32 < LargePage::kHeaderSize);
+
+LargePage::LargePage(Heap* heap, BaseSpace* space, size_t chunk_size,
+                     Address area_start, Address area_end,
+                     VirtualMemory reservation, Executability executable)
+    : MemoryChunk(heap, space, chunk_size, area_start, area_end,
+                  std::move(reservation), executable, PageSize::kLarge) {
+  static_assert(LargePage::kMaxCodePageSize <= TypedSlotSet::kMaxOffset);
+
+  if (executable && chunk_size > LargePage::kMaxCodePageSize) {
+    FATAL("Code page is too large.");
+  }
+
+  SetFlag(MemoryChunk::LARGE_PAGE);
+  list_node().Initialize();
+}
+
+LargePage* LargePage::Initialize(Heap* heap, MemoryChunk* chunk,
+                                 Executability executable) {
+  if (executable && chunk->size() > LargePage::kMaxCodePageSize) {
+    static_assert(LargePage::kMaxCodePageSize <= TypedSlotSet::kMaxOffset);
+    FATAL("Code page is too large.");
+  }
+
+  MSAN_ALLOCATED_UNINITIALIZED_MEMORY(chunk->area_start(), chunk->area_size());
+
+  chunk->SetFlag(MemoryChunk::LARGE_PAGE);
+  chunk->list_node().Initialize();
+  return LargePage::cast(chunk);
+}
+
+void LargePage::ClearOutOfLiveRangeSlots(Address free_start) {
+  DCHECK_NULL(slot_set<OLD_TO_NEW>());
+  DCHECK_NULL(typed_slot_set<OLD_TO_NEW>());
+
+  DCHECK_NULL(slot_set<OLD_TO_NEW_BACKGROUND>());
+  DCHECK_NULL(typed_slot_set<OLD_TO_NEW_BACKGROUND>());
+
+  DCHECK_NULL(slot_set<OLD_TO_OLD>());
+  DCHECK_NULL(typed_slot_set<OLD_TO_OLD>());
+
+  // area_end() might not be aligned to a full bucket size with large objects.
+  // Align it to bucket size such that the following RemoveRange invocation just
+  // drops the whole bucket and the bucket is reset to nullptr.
+  Address aligned_area_end = address() + SlotSet::OffsetForBucket(buckets());
+  DCHECK_LE(area_end(), aligned_area_end);
+  RememberedSet<OLD_TO_SHARED>::RemoveRange(this, free_start, aligned_area_end,
+                                            SlotSet::FREE_EMPTY_BUCKETS);
+
+  RememberedSet<OLD_TO_SHARED>::RemoveRangeTyped(this, free_start, area_end());
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/heap/large-page.h b/deps/v8/src/heap/large-page.h
new file mode 100644
index 00000000000000..ef21dba00c79f4
--- /dev/null
+++ b/deps/v8/src/heap/large-page.h
@@ -0,0 +1,71 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_LARGE_PAGE_H_
+#define V8_HEAP_LARGE_PAGE_H_
+
+#include "src/heap/memory-chunk.h"
+
+namespace v8 {
+namespace internal {
+
+class LargePage : public MemoryChunk {
+ public:
+  // A limit to guarantee that we do not overflow typed slot offset in the old
+  // to old remembered set. Note that this limit is higher than what assembler
+  // already imposes on x64 and ia32 architectures.
+  static constexpr int kMaxCodePageSize = 512 * MB;
+
+  static LargePage* cast(MemoryChunk* chunk) {
+    DCHECK_IMPLIES(chunk, chunk->IsLargePage());
+    return static_cast<LargePage*>(chunk);
+  }
+
+  static LargePage* cast(BasicMemoryChunk* chunk) {
+    return cast(MemoryChunk::cast(chunk));
+  }
+
+  static LargePage* FromHeapObject(Tagged<HeapObject> o) {
+    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
+    return cast(MemoryChunk::FromHeapObject(o));
+  }
+
+  LargePage(Heap* heap, BaseSpace* space, size_t chunk_size, Address area_start,
+            Address area_end, VirtualMemory reservation,
+            Executability executable);
+
+  Tagged<HeapObject> GetObject() const {
+    return HeapObject::FromAddress(area_start());
+  }
+
+  LargePage* next_page() { return LargePage::cast(list_node_.next()); }
+  const LargePage* next_page() const {
+    return static_cast<const LargePage*>(list_node_.next());
+  }
+
+  void ClearOutOfLiveRangeSlots(Address free_start);
+
+ private:
+  static LargePage* Initialize(Heap* heap, MemoryChunk* chunk,
+                               Executability executable);
+
+  friend class MemoryAllocator;
+};
+
+static_assert(sizeof(LargePage) <= MemoryChunk::kHeaderSize);
+
+}  // namespace internal
+
+namespace base {
+// Define special hash function for page pointers, to be used with std data
+// structures, e.g. std::unordered_set<LargePage*, base::hash<LargePage*>
+template <>
+struct hash<i::LargePage*> : hash<i::BasicMemoryChunk*> {};
+template <>
+struct hash<const i::LargePage*> : hash<const i::BasicMemoryChunk*> {};
+}  // namespace base
+
+}  // namespace v8
+
+#endif  // V8_HEAP_LARGE_PAGE_H_
diff --git a/deps/v8/src/heap/large-spaces.cc b/deps/v8/src/heap/large-spaces.cc
index 3cbeb57f2f3e9d..c348cbe597491d 100644
--- a/deps/v8/src/heap/large-spaces.cc
+++ b/deps/v8/src/heap/large-spaces.cc
@@ -9,13 +9,16 @@
 #include "src/common/globals.h"
 #include "src/execution/isolate.h"
 #include "src/heap/combined-heap.h"
+#include "src/heap/concurrent-marking.h"
 #include "src/heap/heap-verifier.h"
 #include "src/heap/incremental-marking.h"
+#include "src/heap/large-page.h"
 #include "src/heap/list.h"
 #include "src/heap/marking-state-inl.h"
 #include "src/heap/marking.h"
 #include "src/heap/memory-allocator.h"
 #include "src/heap/memory-chunk-inl.h"
+#include "src/heap/memory-chunk-layout.h"
 #include "src/heap/remembered-set.h"
 #include "src/heap/slot-set.h"
 #include "src/heap/spaces-inl.h"
@@ -26,66 +29,6 @@
 namespace v8 {
 namespace internal {
 
-// This check is here to ensure that the lower 32 bits of any real heap object
-// can't overlap with the lower 32 bits of cleared weak reference value and
-// therefore it's enough to compare only the lower 32 bits of a MaybeObject in
-// order to figure out if it's a cleared weak reference or not.
-static_assert(kClearedWeakHeapObjectLower32 < LargePage::kHeaderSize);
-
-LargePage::LargePage(Heap* heap, BaseSpace* space, size_t chunk_size,
-                     Address area_start, Address area_end,
-                     VirtualMemory reservation, Executability executable)
-    : MemoryChunk(heap, space, chunk_size, area_start, area_end,
-                  std::move(reservation), executable, PageSize::kLarge) {
-  static_assert(LargePage::kMaxCodePageSize <= TypedSlotSet::kMaxOffset);
-
-  if (executable && chunk_size > LargePage::kMaxCodePageSize) {
-    FATAL("Code page is too large.");
-  }
-
-  SetFlag(MemoryChunk::LARGE_PAGE);
-  list_node().Initialize();
-}
-
-LargePage* LargePage::Initialize(Heap* heap, MemoryChunk* chunk,
-                                 Executability executable) {
-  if (executable && chunk->size() > LargePage::kMaxCodePageSize) {
-    static_assert(LargePage::kMaxCodePageSize <= TypedSlotSet::kMaxOffset);
-    FATAL("Code page is too large.");
-  }
-
-  MSAN_ALLOCATED_UNINITIALIZED_MEMORY(chunk->area_start(), chunk->area_size());
-
-  LargePage* page = static_cast<LargePage*>(chunk);
-  page->SetFlag(MemoryChunk::LARGE_PAGE);
-  page->list_node().Initialize();
-  return page;
-}
-
-size_t LargeObjectSpace::Available() const {
-  // We return zero here since we cannot take advantage of already allocated
-  // large object memory.
-  return 0;
-}
-
-void LargePage::ClearOutOfLiveRangeSlots(Address free_start) {
-  DCHECK_NULL(slot_set<OLD_TO_NEW>());
-  DCHECK_NULL(typed_slot_set<OLD_TO_NEW>());
-
-  DCHECK_NULL(slot_set<OLD_TO_OLD>());
-  DCHECK_NULL(typed_slot_set<OLD_TO_OLD>());
-
-  // area_end() might not be aligned to a full bucket size with large objects.
-  // Align it to bucket size such that the following RemoveRange invocation just
-  // drops the whole bucket and the bucket is reset to nullptr.
-  Address aligned_area_end = address() + SlotSet::OffsetForBucket(buckets());
-  DCHECK_LE(area_end(), aligned_area_end);
-  RememberedSet<OLD_TO_SHARED>::RemoveRange(this, free_start, aligned_area_end,
-                                            SlotSet::FREE_EMPTY_BUCKETS);
-
-  RememberedSet<OLD_TO_SHARED>::RemoveRangeTyped(this, free_start, area_end());
-}
-
 // -----------------------------------------------------------------------------
 // LargeObjectSpaceObjectIterator
 
@@ -94,24 +37,31 @@ LargeObjectSpaceObjectIterator::LargeObjectSpaceObjectIterator(
   current_ = space->first_page();
 }
 
-HeapObject LargeObjectSpaceObjectIterator::Next() {
-  if (current_ == nullptr) return HeapObject();
-
-  HeapObject object = current_->GetObject();
-  current_ = current_->next_page();
-  return object;
+Tagged<HeapObject> LargeObjectSpaceObjectIterator::Next() {
+  while (current_ != nullptr) {
+    Tagged<HeapObject> object = current_->GetObject();
+    current_ = current_->next_page();
+    if (!IsFreeSpaceOrFiller(object)) return object;
+  }
+  return Tagged<HeapObject>();
 }
 
 // -----------------------------------------------------------------------------
 // OldLargeObjectSpace
 
 LargeObjectSpace::LargeObjectSpace(Heap* heap, AllocationSpace id)
-    : Space(heap, id, new NoFreeList(), allocation_counter_),
+    : Space(heap, id, nullptr, allocation_counter_),
       size_(0),
       page_count_(0),
       objects_size_(0),
       pending_object_(0) {}
 
+size_t LargeObjectSpace::Available() const {
+  // We return zero here since we cannot take advantage of already allocated
+  // large object memory.
+  return 0;
+}
+
 void LargeObjectSpace::TearDown() {
   while (!memory_chunk_list_.Empty()) {
     LargePage* page = first_page();
@@ -147,16 +97,17 @@ AllocationResult OldLargeObjectSpace::AllocateRaw(int object_size,
   DCHECK(!v8_flags.enable_third_party_heap);
   // Check if we want to force a GC before growing the old space further.
   // If so, fail the allocation.
-  if (!heap()->CanExpandOldGeneration(object_size) ||
-      !heap()->ShouldExpandOldGenerationOnSlowAllocation(
-          heap()->main_thread_local_heap(), AllocationOrigin::kRuntime)) {
+  if (!heap()->ShouldExpandOldGenerationOnSlowAllocation(
+          heap()->main_thread_local_heap(), AllocationOrigin::kRuntime) ||
+      !heap()->CanExpandOldGeneration(object_size)) {
     return AllocationResult::Failure();
   }
 
   LargePage* page = AllocateLargePage(object_size, executable);
   if (page == nullptr) return AllocationResult::Failure();
-  page->SetOldGenerationPageFlags(heap()->incremental_marking()->IsMarking());
-  HeapObject object = page->GetObject();
+  page->SetOldGenerationPageFlags(
+      heap()->incremental_marking()->marking_mode());
+  Tagged<HeapObject> object = page->GetObject();
   UpdatePendingObject(object);
   heap()->StartIncrementalMarkingIfAllocationLimitIsReached(
       heap()->GCFlagsForIncrementalMarking(),
@@ -184,7 +135,7 @@ AllocationResult OldLargeObjectSpace::AllocateRawBackground(
   DCHECK(!v8_flags.enable_third_party_heap);
   // Check if we want to force a GC before growing the old space further.
   // If so, fail the allocation.
-  if (!heap()->CanExpandOldGenerationBackground(local_heap, object_size) ||
+  if (!heap()->CanExpandOldGeneration(object_size) ||
       !heap()->ShouldExpandOldGenerationOnSlowAllocation(
           local_heap, AllocationOrigin::kRuntime)) {
     return AllocationResult::Failure();
@@ -192,8 +143,9 @@ AllocationResult OldLargeObjectSpace::AllocateRawBackground(
 
   LargePage* page = AllocateLargePage(object_size, executable);
   if (page == nullptr) return AllocationResult::Failure();
-  page->SetOldGenerationPageFlags(heap()->incremental_marking()->IsMarking());
-  HeapObject object = page->GetObject();
+  page->SetOldGenerationPageFlags(
+      heap()->incremental_marking()->marking_mode());
+  Tagged<HeapObject> object = page->GetObject();
   heap()->StartIncrementalMarkingIfAllocationLimitIsReachedBackground();
   if (heap()->incremental_marking()->black_allocation()) {
     heap()->marking_state()->TryMarkAndAccountLiveBytes(object);
@@ -201,14 +153,19 @@ AllocationResult OldLargeObjectSpace::AllocateRawBackground(
   DCHECK_IMPLIES(heap()->incremental_marking()->black_allocation(),
                  heap()->marking_state()->IsMarked(object));
   page->InitializationMemoryFence();
-  if (identity() == CODE_LO_SPACE) {
-    heap()->isolate()->AddCodeMemoryChunk(page);
-  }
+  heap()->NotifyOldGenerationExpansionBackground(identity(), page);
   return AllocationResult::FromObject(object);
 }
 
 LargePage* LargeObjectSpace::AllocateLargePage(int object_size,
                                                Executability executable) {
+  base::MutexGuard expansion_guard(heap_->heap_expansion_mutex());
+
+  if (identity() != NEW_LO_SPACE &&
+      !heap()->IsOldGenerationExpansionAllowed(object_size, expansion_guard)) {
+    return nullptr;
+  }
+
   LargePage* page = heap()->memory_allocator()->AllocateLargePage(
       this, object_size, executable);
   if (page == nullptr) return nullptr;
@@ -219,7 +176,7 @@ LargePage* LargeObjectSpace::AllocateLargePage(int object_size,
     AddPage(page, object_size);
   }
 
-  HeapObject object = page->GetObject();
+  Tagged<HeapObject> object = page->GetObject();
 
   heap()->CreateFillerObjectAt(object.address(), object_size);
   return page;
@@ -232,34 +189,6 @@ size_t LargeObjectSpace::CommittedPhysicalMemory() const {
   return CommittedMemory();
 }
 
-LargePage* CodeLargeObjectSpace::FindPage(Address a) {
-  base::RecursiveMutexGuard guard(&allocation_mutex_);
-  const Address key = BasicMemoryChunk::FromAddress(a)->address();
-  auto it = chunk_map_.find(key);
-  if (it != chunk_map_.end()) {
-    LargePage* page = it->second;
-    CHECK(page->Contains(a));
-    return page;
-  }
-  return nullptr;
-}
-
-void CodeLargeObjectSpace::InsertChunkMapEntries(LargePage* page) {
-  for (Address current = reinterpret_cast<Address>(page);
-       current < reinterpret_cast<Address>(page) + page->size();
-       current += MemoryChunk::kPageSize) {
-    chunk_map_[current] = page;
-  }
-}
-
-void CodeLargeObjectSpace::RemoveChunkMapEntries(LargePage* page) {
-  for (Address current = page->address();
-       current < reinterpret_cast<Address>(page) + page->size();
-       current += MemoryChunk::kPageSize) {
-    chunk_map_.erase(current);
-  }
-}
-
 void OldLargeObjectSpace::PromoteNewLargeObject(LargePage* page) {
   DCHECK_EQ(page->owner_identity(), NEW_LO_SPACE);
   DCHECK(page->IsLargePage());
@@ -268,7 +197,7 @@ void OldLargeObjectSpace::PromoteNewLargeObject(LargePage* page) {
   PtrComprCageBase cage_base(heap()->isolate());
   static_cast<LargeObjectSpace*>(page->owner())->RemovePage(page);
   page->ClearFlag(MemoryChunk::FROM_PAGE);
-  AddPage(page, static_cast<size_t>(page->GetObject().Size(cage_base)));
+  AddPage(page, static_cast<size_t>(page->GetObject()->Size(cage_base)));
 }
 
 void LargeObjectSpace::AddPage(LargePage* page, size_t object_size) {
@@ -278,11 +207,13 @@ void LargeObjectSpace::AddPage(LargePage* page, size_t object_size) {
   page_count_++;
   memory_chunk_list_.PushBack(page);
   page->set_owner(this);
-  page->SetOldGenerationPageFlags(heap()->incremental_marking()->IsMarking());
-  for (size_t i = 0; i < ExternalBackingStoreType::kNumTypes; i++) {
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    IncrementExternalBackingStoreBytes(t, page->ExternalBackingStoreBytes(t));
-  }
+  page->SetOldGenerationPageFlags(
+      heap()->incremental_marking()->marking_mode());
+  ForAll<ExternalBackingStoreType>(
+      [this, page](ExternalBackingStoreType type, int index) {
+        IncrementExternalBackingStoreBytes(
+            type, page->ExternalBackingStoreBytes(type));
+      });
 }
 
 void LargeObjectSpace::RemovePage(LargePage* page) {
@@ -291,19 +222,20 @@ void LargeObjectSpace::RemovePage(LargePage* page) {
   page_count_--;
   memory_chunk_list_.Remove(page);
   page->set_owner(nullptr);
-  for (size_t i = 0; i < ExternalBackingStoreType::kNumTypes; i++) {
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    DecrementExternalBackingStoreBytes(t, page->ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, page](ExternalBackingStoreType type, int index) {
+        DecrementExternalBackingStoreBytes(
+            type, page->ExternalBackingStoreBytes(type));
+      });
 }
 
 void LargeObjectSpace::ShrinkPageToObjectSize(LargePage* page,
-                                              HeapObject object,
+                                              Tagged<HeapObject> object,
                                               size_t object_size) {
 #ifdef DEBUG
   PtrComprCageBase cage_base(heap()->isolate());
   DCHECK_EQ(object, page->GetObject());
-  DCHECK_EQ(object_size, page->GetObject().Size(cage_base));
+  DCHECK_EQ(object_size, page->GetObject()->Size(cage_base));
   DCHECK_EQ(page->executable(), NOT_EXECUTABLE);
 #endif  // DEBUG
 
@@ -334,7 +266,7 @@ void LargeObjectSpace::ShrinkPageToObjectSize(LargePage* page,
   DCHECK_EQ(object_size, page->area_size());
 }
 
-bool LargeObjectSpace::Contains(HeapObject object) const {
+bool LargeObjectSpace::Contains(Tagged<HeapObject> object) const {
   BasicMemoryChunk* chunk = BasicMemoryChunk::FromHeapObject(object);
 
   bool owned = (chunk->owner() == this);
@@ -362,11 +294,8 @@ std::unique_ptr<ObjectIterator> LargeObjectSpace::GetObjectIterator(
 // on the invariants we are checking during verification.
 void LargeObjectSpace::Verify(Isolate* isolate,
                               SpaceVerificationVisitor* visitor) const {
-  size_t external_backing_store_bytes[kNumTypes];
-
-  for (int i = 0; i < kNumTypes; i++) {
-    external_backing_store_bytes[static_cast<ExternalBackingStoreType>(i)] = 0;
-  }
+  size_t external_backing_store_bytes[static_cast<int>(
+      ExternalBackingStoreType::kNumValues)] = {0};
 
   PtrComprCageBase cage_base(isolate);
   for (const LargePage* chunk = first_page(); chunk != nullptr;
@@ -375,56 +304,62 @@ void LargeObjectSpace::Verify(Isolate* isolate,
 
     // Each chunk contains an object that starts at the large object page's
     // object area start.
-    HeapObject object = chunk->GetObject();
+    Tagged<HeapObject> object = chunk->GetObject();
     Page* page = Page::FromHeapObject(object);
     CHECK(object.address() == page->area_start());
 
     // We have only the following types in the large object space:
-    const bool is_valid_lo_space_object =                         //
-        object.IsAbstractCode(cage_base) ||                       //
-        object.IsBigInt(cage_base) ||                             //
-        object.IsByteArray(cage_base) ||                          //
-        object.IsContext(cage_base) ||                            //
-        object.IsExternalString(cage_base) ||                     //
-        object.IsFeedbackMetadata(cage_base) ||                   //
-        object.IsFeedbackVector(cage_base) ||                     //
-        object.IsFixedArray(cage_base) ||                         //
-        object.IsFixedDoubleArray(cage_base) ||                   //
-        object.IsFreeSpace(cage_base) ||                          //
-        object.IsInstructionStream(cage_base) ||                  //
-        object.IsPreparseData(cage_base) ||                       //
-        object.IsPropertyArray(cage_base) ||                      //
-        object.IsScopeInfo() ||                                   //
-        object.IsSeqString(cage_base) ||                          //
-        object.IsSloppyArgumentsElements(cage_base) ||            //
-        object.IsSwissNameDictionary() ||                         //
-        object.IsThinString(cage_base) ||                         //
-        object.IsUncompiledDataWithoutPreparseData(cage_base) ||  //
+    const bool is_valid_lo_space_object =                          //
+        IsAbstractCode(object, cage_base) ||                       //
+        IsBigInt(object, cage_base) ||                             //
+        IsByteArray(object, cage_base) ||                          //
+        IsExternalPointerArray(object, cage_base) ||               //
+        IsContext(object, cage_base) ||                            //
+        IsExternalString(object, cage_base) ||                     //
+        IsFeedbackMetadata(object, cage_base) ||                   //
+        IsFeedbackVector(object, cage_base) ||                     //
+        IsFixedArray(object, cage_base) ||                         //
+        IsFixedDoubleArray(object, cage_base) ||                   //
+        IsFreeSpace(object, cage_base) ||                          //
+        IsInstructionStream(object, cage_base) ||                  //
+        IsPreparseData(object, cage_base) ||                       //
+        IsPropertyArray(object, cage_base) ||                      //
+        IsScopeInfo(object) ||                                     //
+        IsSeqString(object, cage_base) ||                          //
+        IsSloppyArgumentsElements(object, cage_base) ||            //
+        IsSwissNameDictionary(object) ||                           //
+        IsThinString(object, cage_base) ||                         //
+        IsUncompiledDataWithoutPreparseData(object, cage_base) ||  //
 #if V8_ENABLE_WEBASSEMBLY                                         //
-        object.IsWasmArray() ||                                   //
+        IsWasmArray(object) ||                                    //
+        IsWasmStruct(object) ||                                   //
 #endif                                                            //
-        object.IsWeakArrayList(cage_base) ||                      //
-        object.IsWeakFixedArray(cage_base);
+        IsWeakArrayList(object, cage_base) ||                     //
+        IsWeakFixedArray(object, cage_base);
     if (!is_valid_lo_space_object) {
-      object.Print();
+      i::Print(object);
       FATAL("Found invalid Object (instance_type=%i) in large object space.",
-            object.map(cage_base).instance_type());
+            object->map(cage_base)->instance_type());
     }
 
     // Invoke visitor on each object.
     visitor->VerifyObject(object);
 
-    for (int i = 0; i < kNumTypes; i++) {
-      ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-      external_backing_store_bytes[t] += chunk->ExternalBackingStoreBytes(t);
-    }
+    ForAll<ExternalBackingStoreType>(
+        [chunk, &external_backing_store_bytes](ExternalBackingStoreType type,
+                                               int index) {
+          external_backing_store_bytes[index] +=
+              chunk->ExternalBackingStoreBytes(type);
+        });
 
     visitor->VerifyPageDone(chunk);
   }
-  for (int i = 0; i < kNumTypes; i++) {
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    CHECK_EQ(external_backing_store_bytes[t], ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, external_backing_store_bytes](ExternalBackingStoreType type,
+                                           int index) {
+        CHECK_EQ(external_backing_store_bytes[index],
+                 ExternalBackingStoreBytes(type));
+      });
 }
 #endif
 
@@ -432,13 +367,13 @@ void LargeObjectSpace::Verify(Isolate* isolate,
 void LargeObjectSpace::Print() {
   StdoutStream os;
   LargeObjectSpaceObjectIterator it(this);
-  for (HeapObject obj = it.Next(); !obj.is_null(); obj = it.Next()) {
-    obj.Print(os);
+  for (Tagged<HeapObject> obj = it.Next(); !obj.is_null(); obj = it.Next()) {
+    i::Print(obj, os);
   }
 }
 #endif  // DEBUG
 
-void LargeObjectSpace::UpdatePendingObject(HeapObject object) {
+void LargeObjectSpace::UpdatePendingObject(Tagged<HeapObject> object) {
   base::SharedMutexGuard<base::kExclusive> guard(&pending_allocation_mutex_);
   pending_object_.store(object.address(), std::memory_order_release);
 }
@@ -472,12 +407,13 @@ AllocationResult NewLargeObjectSpace::AllocateRaw(int object_size) {
   // The size of the first object may exceed the capacity.
   capacity_ = std::max(capacity_, SizeOfObjects());
 
-  HeapObject result = page->GetObject();
-  page->SetYoungGenerationPageFlags(heap()->incremental_marking()->IsMarking());
+  Tagged<HeapObject> result = page->GetObject();
+  page->SetYoungGenerationPageFlags(
+      heap()->incremental_marking()->marking_mode());
   page->SetFlag(MemoryChunk::TO_PAGE);
   UpdatePendingObject(result);
-  if (v8_flags.minor_mc) {
-    heap()->non_atomic_marking_state()->ClearLiveness(page);
+  if (v8_flags.minor_ms) {
+    page->ClearLiveness();
   }
   page->InitializationMemoryFence();
   DCHECK(page->IsLargePage());
@@ -500,14 +436,16 @@ void NewLargeObjectSpace::Flip() {
 }
 
 void NewLargeObjectSpace::FreeDeadObjects(
-    const std::function<bool(HeapObject)>& is_dead) {
+    const std::function<bool(Tagged<HeapObject>)>& is_dead) {
   bool is_marking = heap()->incremental_marking()->IsMarking();
+  DCHECK_IMPLIES(v8_flags.minor_ms, !is_marking);
+  DCHECK_IMPLIES(is_marking, heap()->incremental_marking()->IsMajorMarking());
   size_t surviving_object_size = 0;
   PtrComprCageBase cage_base(heap()->isolate());
   for (auto it = begin(); it != end();) {
     LargePage* page = *it;
     it++;
-    HeapObject object = page->GetObject();
+    Tagged<HeapObject> object = page->GetObject();
     if (is_dead(object)) {
       RemovePage(page);
       heap()->memory_allocator()->Free(MemoryAllocator::FreeMode::kConcurrently,
@@ -516,7 +454,7 @@ void NewLargeObjectSpace::FreeDeadObjects(
         heap()->concurrent_marking()->ClearMemoryChunkData(page);
       }
     } else {
-      surviving_object_size += static_cast<size_t>(object.Size(cage_base));
+      surviving_object_size += static_cast<size_t>(object->Size(cage_base));
     }
   }
   // Right-trimming does not update the objects_size_ counter. We are lazily
@@ -529,11 +467,12 @@ void NewLargeObjectSpace::SetCapacity(size_t capacity) {
 }
 
 CodeLargeObjectSpace::CodeLargeObjectSpace(Heap* heap)
-    : OldLargeObjectSpace(heap, CODE_LO_SPACE),
-      chunk_map_(kInitialChunkMapCapacity) {}
+    : OldLargeObjectSpace(heap, CODE_LO_SPACE) {}
 
 AllocationResult CodeLargeObjectSpace::AllocateRaw(int object_size) {
   DCHECK(!v8_flags.enable_third_party_heap);
+  CodePageHeaderModificationScope header_modification_scope(
+      "Code allocation needs header access.");
   return OldLargeObjectSpace::AllocateRaw(object_size, EXECUTABLE);
 }
 
@@ -546,11 +485,9 @@ AllocationResult CodeLargeObjectSpace::AllocateRawBackground(
 
 void CodeLargeObjectSpace::AddPage(LargePage* page, size_t object_size) {
   OldLargeObjectSpace::AddPage(page, object_size);
-  InsertChunkMapEntries(page);
 }
 
 void CodeLargeObjectSpace::RemovePage(LargePage* page) {
-  RemoveChunkMapEntries(page);
   heap()->isolate()->RemoveCodeMemoryChunk(page);
   OldLargeObjectSpace::RemovePage(page);
 }
diff --git a/deps/v8/src/heap/large-spaces.h b/deps/v8/src/heap/large-spaces.h
index 7cdd8771e528d8..de168f6866315d 100644
--- a/deps/v8/src/heap/large-spaces.h
+++ b/deps/v8/src/heap/large-spaces.h
@@ -15,6 +15,7 @@
 #include "src/common/globals.h"
 #include "src/heap/heap-verifier.h"
 #include "src/heap/heap.h"
+#include "src/heap/large-page.h"
 #include "src/heap/memory-chunk.h"
 #include "src/heap/spaces.h"
 #include "src/objects/heap-object.h"
@@ -25,40 +26,6 @@ namespace internal {
 class Isolate;
 class LocalHeap;
 
-class LargePage : public MemoryChunk {
- public:
-  // A limit to guarantee that we do not overflow typed slot offset in the old
-  // to old remembered set. Note that this limit is higher than what assembler
-  // already imposes on x64 and ia32 architectures.
-  static const int kMaxCodePageSize = 512 * MB;
-
-  LargePage(Heap* heap, BaseSpace* space, size_t chunk_size, Address area_start,
-            Address area_end, VirtualMemory reservation,
-            Executability executable);
-
-  static LargePage* FromHeapObject(HeapObject o) {
-    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
-    return static_cast<LargePage*>(MemoryChunk::FromHeapObject(o));
-  }
-
-  HeapObject GetObject() const { return HeapObject::FromAddress(area_start()); }
-
-  LargePage* next_page() { return static_cast<LargePage*>(list_node_.next()); }
-  const LargePage* next_page() const {
-    return static_cast<const LargePage*>(list_node_.next());
-  }
-
-  void ClearOutOfLiveRangeSlots(Address free_start);
-
- private:
-  static LargePage* Initialize(Heap* heap, MemoryChunk* chunk,
-                               Executability executable);
-
-  friend class MemoryAllocator;
-};
-
-static_assert(sizeof(LargePage) <= MemoryChunk::kHeaderSize);
-
 // -----------------------------------------------------------------------------
 // Large objects ( > kMaxRegularHeapObjectSize ) are allocated and managed by
 // the large object space. Large objects do not move during garbage collections.
@@ -84,11 +51,11 @@ class V8_EXPORT_PRIVATE LargeObjectSpace : public Space {
 
   int PageCount() const { return page_count_; }
 
-  void ShrinkPageToObjectSize(LargePage* page, HeapObject object,
+  void ShrinkPageToObjectSize(LargePage* page, Tagged<HeapObject> object,
                               size_t object_size);
 
   // Checks whether a heap object is in this space; O(1).
-  bool Contains(HeapObject obj) const;
+  bool Contains(Tagged<HeapObject> obj) const;
   // Checks whether an address is in the object area in this space. Iterates all
   // objects in the space. May be slow.
   bool ContainsSlow(Address addr) const;
@@ -145,7 +112,7 @@ class V8_EXPORT_PRIVATE LargeObjectSpace : public Space {
 
   LargePage* AllocateLargePage(int object_size, Executability executable);
 
-  void UpdatePendingObject(HeapObject object);
+  void UpdatePendingObject(Tagged<HeapObject> object);
 
   std::atomic<size_t> size_;  // allocated bytes
   int page_count_;       // number of chunks
@@ -209,7 +176,7 @@ class NewLargeObjectSpace : public LargeObjectSpace {
 
   void Flip();
 
-  void FreeDeadObjects(const std::function<bool(HeapObject)>& is_dead);
+  void FreeDeadObjects(const std::function<bool(Tagged<HeapObject>)>& is_dead);
 
   void SetCapacity(size_t capacity);
 
@@ -227,28 +194,16 @@ class CodeLargeObjectSpace : public OldLargeObjectSpace {
   V8_EXPORT_PRIVATE V8_WARN_UNUSED_RESULT AllocationResult
   AllocateRawBackground(LocalHeap* local_heap, int object_size);
 
-  // Finds a large object page containing the given address, returns nullptr if
-  // such a page doesn't exist.
-  LargePage* FindPage(Address a);
-
  protected:
   void AddPage(LargePage* page, size_t object_size) override;
   void RemovePage(LargePage* page) override;
-
- private:
-  static const size_t kInitialChunkMapCapacity = 1024;
-  void InsertChunkMapEntries(LargePage* page);
-  void RemoveChunkMapEntries(LargePage* page);
-
-  // Page-aligned addresses to their corresponding LargePage.
-  std::unordered_map<Address, LargePage*> chunk_map_;
 };
 
 class LargeObjectSpaceObjectIterator : public ObjectIterator {
  public:
   explicit LargeObjectSpaceObjectIterator(LargeObjectSpace* space);
 
-  HeapObject Next() override;
+  Tagged<HeapObject> Next() override;
 
  private:
   LargePage* current_;
diff --git a/deps/v8/src/heap/local-factory.cc b/deps/v8/src/heap/local-factory.cc
index 6dbf16e8e912a3..a5cf18b9dcb2c8 100644
--- a/deps/v8/src/heap/local-factory.cc
+++ b/deps/v8/src/heap/local-factory.cc
@@ -10,6 +10,8 @@
 #include "src/heap/concurrent-allocator-inl.h"
 #include "src/heap/local-factory-inl.h"
 #include "src/heap/local-heap-inl.h"
+#include "src/logging/local-logger.h"
+#include "src/logging/log.h"
 #include "src/numbers/hash-seed-inl.h"
 #include "src/objects/fixed-array.h"
 #include "src/objects/heap-object.h"
@@ -27,39 +29,45 @@ LocalFactory::LocalFactory(Isolate* isolate)
 LocalFactory::LocalFactory(Isolate* isolate) : roots_(isolate) {}
 #endif
 
-void LocalFactory::AddToScriptList(Handle<Script> shared) {
-// TODO(leszeks): Actually add the script to the main Isolate's script list,
-// in a thread-safe way.
-//
-// At the moment, we have to do one final fix-up during off-thread
-// finalization, where we add the created script to the script list, but this
-// relies on there being exactly one script created during the lifetime of
-// this LocalFactory.
-//
-// For now, prevent accidentaly creating more scripts that don't get added to
-// the script list with a simple DCHECK.
+void LocalFactory::ProcessNewScript(Handle<Script> script,
+                                    ScriptEventType script_event_type) {
+  // TODO(leszeks): Actually add the script to the main Isolate's script list,
+  // in a thread-safe way.
+  //
+  // At the moment, we have to do one final fix-up during off-thread
+  // finalization, where we add the created script to the script list, but this
+  // relies on there being exactly one script created during the lifetime of
+  // this LocalFactory.
+  //
+  // For now, prevent accidentally creating more scripts that don't get added to
+  // the script list with a simple DCHECK.
+  int script_id = script->id();
 #ifdef DEBUG
-  DCHECK(!a_script_was_added_to_the_script_list_);
-  a_script_was_added_to_the_script_list_ = true;
+  if (script_id != Script::kTemporaryScriptId) {
+    DCHECK(!a_script_was_added_to_the_script_list_);
+    a_script_was_added_to_the_script_list_ = true;
+  }
 #endif
+  LOG(isolate(), ScriptEvent(script_event_type, script_id));
 }
 
-HeapObject LocalFactory::AllocateRaw(int size, AllocationType allocation,
-                                     AllocationAlignment alignment) {
+Tagged<HeapObject> LocalFactory::AllocateRaw(int size,
+                                             AllocationType allocation,
+                                             AllocationAlignment alignment) {
   DCHECK(allocation == AllocationType::kOld ||
          allocation == AllocationType::kSharedOld);
   return HeapObject::FromAddress(isolate()->heap()->AllocateRawOrFail(
       size, allocation, AllocationOrigin::kRuntime, alignment));
 }
 
-int LocalFactory::NumberToStringCacheHash(Smi) { return 0; }
+int LocalFactory::NumberToStringCacheHash(Tagged<Smi>) { return 0; }
 
 int LocalFactory::NumberToStringCacheHash(double) { return 0; }
 
 void LocalFactory::NumberToStringCacheSet(Handle<Object>, int, Handle<String>) {
 }
 
-Handle<Object> LocalFactory::NumberToStringCacheGet(Object, int) {
+Handle<Object> LocalFactory::NumberToStringCacheGet(Tagged<Object>, int) {
   return undefined_value();
 }
 
diff --git a/deps/v8/src/heap/local-factory.h b/deps/v8/src/heap/local-factory.h
index 95f6a89bfc2b45..bda37e02d079e1 100644
--- a/deps/v8/src/heap/local-factory.h
+++ b/deps/v8/src/heap/local-factory.h
@@ -12,10 +12,6 @@
 #include "src/heap/heap.h"
 #include "src/heap/read-only-heap.h"
 #include "src/heap/spaces.h"
-#include "src/objects/heap-object.h"
-#include "src/objects/map.h"
-#include "src/objects/objects.h"
-#include "src/objects/shared-function-info.h"
 #include "src/roots/roots.h"
 
 namespace v8 {
@@ -51,19 +47,20 @@ class V8_EXPORT_PRIVATE LocalFactory : public FactoryBase<LocalFactory> {
   // it's a mutable root), but it still needs to define some cache-related
   // method that are used by FactoryBase. Those method do basically nothing in
   // the case of the LocalFactory.
-  int NumberToStringCacheHash(Smi number);
+  int NumberToStringCacheHash(Tagged<Smi> number);
   int NumberToStringCacheHash(double number);
   void NumberToStringCacheSet(Handle<Object> number, int hash,
                               Handle<String> js_string);
-  Handle<Object> NumberToStringCacheGet(Object number, int hash);
+  Handle<Object> NumberToStringCacheGet(Tagged<Object> number, int hash);
 
  private:
   friend class FactoryBase<LocalFactory>;
 
   // ------
   // Customization points for FactoryBase.
-  HeapObject AllocateRaw(int size, AllocationType allocation,
-                         AllocationAlignment alignment = kTaggedAligned);
+  Tagged<HeapObject> AllocateRaw(
+      int size, AllocationType allocation,
+      AllocationAlignment alignment = kTaggedAligned);
 
   LocalIsolate* isolate() {
     // Downcast to the privately inherited sub-class using c-style casts to
@@ -88,7 +85,8 @@ class V8_EXPORT_PRIVATE LocalFactory : public FactoryBase<LocalFactory> {
   inline AllocationType AllocationTypeForInPlaceInternalizableString();
   // ------
 
-  void AddToScriptList(Handle<Script> shared);
+  void ProcessNewScript(Handle<Script> script,
+                        ScriptEventType script_event_type);
   // ------
 
   ReadOnlyRoots roots_;
diff --git a/deps/v8/src/heap/local-heap-inl.h b/deps/v8/src/heap/local-heap-inl.h
index 401b7a4903ba2a..beb47e66d511fd 100644
--- a/deps/v8/src/heap/local-heap-inl.h
+++ b/deps/v8/src/heap/local-heap-inl.h
@@ -12,6 +12,8 @@
 #include "src/heap/concurrent-allocator-inl.h"
 #include "src/heap/heap.h"
 #include "src/heap/local-heap.h"
+#include "src/heap/parked-scope.h"
+#include "src/heap/zapping.h"
 
 namespace v8 {
 namespace internal {
@@ -37,6 +39,9 @@ AllocationResult LocalHeap::AllocateRaw(int size_in_bytes, AllocationType type,
   bool large_object = size_in_bytes > heap_->MaxRegularHeapObjectSize(type);
 
   if (type == AllocationType::kCode) {
+    CodePageHeaderModificationScope header_modification_scope(
+        "Code allocation needs header access.");
+
     AllocationResult alloc;
     if (large_object) {
       alloc =
@@ -45,11 +50,10 @@ AllocationResult LocalHeap::AllocateRaw(int size_in_bytes, AllocationType type,
       alloc =
           code_space_allocator()->AllocateRaw(size_in_bytes, alignment, origin);
     }
-    HeapObject object;
-    if (alloc.To(&object) && !V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
-      heap()->UnprotectAndRegisterMemoryChunk(
-          object, UnprotectMemoryOrigin::kMaybeOffMainThread);
-      heap()->ZapCodeObject(object.address(), size_in_bytes);
+    Tagged<HeapObject> object;
+    if (heap::ShouldZapGarbage() && alloc.To(&object) &&
+        !V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
+      heap::ZapCodeBlock(object.address(), size_in_bytes);
     }
     return alloc;
   }
@@ -72,16 +76,78 @@ AllocationResult LocalHeap::AllocateRaw(int size_in_bytes, AllocationType type,
   }
 }
 
-Address LocalHeap::AllocateRawOrFail(int object_size, AllocationType type,
-                                     AllocationOrigin origin,
-                                     AllocationAlignment alignment) {
+template <typename LocalHeap::AllocationRetryMode mode>
+Tagged<HeapObject> LocalHeap::AllocateRawWith(int object_size,
+                                              AllocationType type,
+                                              AllocationOrigin origin,
+                                              AllocationAlignment alignment) {
   object_size = ALIGN_TO_ALLOCATION_ALIGNMENT(object_size);
   DCHECK(!v8_flags.enable_third_party_heap);
   AllocationResult result = AllocateRaw(object_size, type, origin, alignment);
-  HeapObject object;
-  if (result.To(&object)) return object.address();
-  return PerformCollectionAndAllocateAgain(object_size, type, origin,
-                                           alignment);
+  Tagged<HeapObject> object;
+  if (result.To(&object)) return object;
+  result =
+      PerformCollectionAndAllocateAgain(object_size, type, origin, alignment);
+  if (result.To(&object)) return object;
+
+  switch (mode) {
+    case kRetryOrFail:
+      heap_->FatalProcessOutOfMemory("LocalHeap: allocation failed");
+    case kLightRetry:
+      return HeapObject();
+  }
+}
+
+Address LocalHeap::AllocateRawOrFail(int object_size, AllocationType type,
+                                     AllocationOrigin origin,
+                                     AllocationAlignment alignment) {
+  return AllocateRawWith<kRetryOrFail>(object_size, type, origin, alignment)
+      .address();
+}
+
+template <typename Callback>
+V8_INLINE void LocalHeap::ParkAndExecuteCallback(Callback callback) {
+  ParkedScope parked(this);
+  // Provide the parked scope as a witness, if the callback expects it.
+  if constexpr (std::is_invocable_v<Callback, const ParkedScope&>) {
+    callback(parked);
+  } else {
+    callback();
+  }
+}
+
+template <typename Callback>
+V8_INLINE void LocalHeap::BlockWhileParked(Callback callback) {
+  if (is_main_thread()) {
+    BlockMainThreadWhileParked(callback);
+  } else {
+    ParkAndExecuteCallback(callback);
+  }
+}
+
+template <typename Callback>
+V8_INLINE void LocalHeap::BlockMainThreadWhileParked(Callback callback) {
+  ExecuteWithStackMarker(
+      [this, callback]() { ParkAndExecuteCallback(callback); });
+}
+
+template <typename Callback>
+V8_INLINE void LocalHeap::ExecuteWithStackMarker(Callback callback) {
+  // Conservative stack scanning is only performed for main threads, therefore
+  // this method should only be invoked from the main thread. In this case,
+  // heap()->stack() below is the stack object of the main thread that has last
+  // entered the isolate.
+  DCHECK(is_main_thread());
+  heap()->stack().SetMarkerIfNeededAndCallback(callback);
+}
+
+template <typename Callback>
+V8_INLINE void LocalHeap::ExecuteWithStackMarkerIfNeeded(Callback callback) {
+  if (is_main_thread()) {
+    ExecuteWithStackMarker(callback);
+  } else {
+    callback();
+  }
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/local-heap.cc b/deps/v8/src/heap/local-heap.cc
index b39fbe33d35aa8..426466a48caa33 100644
--- a/deps/v8/src/heap/local-heap.cc
+++ b/deps/v8/src/heap/local-heap.cc
@@ -35,7 +35,7 @@ thread_local LocalHeap* current_local_heap = nullptr;
 LocalHeap* LocalHeap::Current() { return current_local_heap; }
 
 #ifdef DEBUG
-void LocalHeap::VerifyCurrent() {
+void LocalHeap::VerifyCurrent() const {
   LocalHeap* current = LocalHeap::Current();
 
   if (is_main_thread())
@@ -66,9 +66,7 @@ LocalHeap::LocalHeap(Heap* heap, ThreadKind kind,
       if (heap_->incremental_marking()->IsMarking()) {
         marking_barrier_->Activate(
             heap_->incremental_marking()->IsCompacting(),
-            heap_->incremental_marking()->IsMinorMarking()
-                ? MarkingBarrierType::kMinor
-                : MarkingBarrierType::kMajor);
+            heap_->incremental_marking()->marking_mode());
       }
 
       SetUpSharedMarking();
@@ -91,9 +89,6 @@ LocalHeap::~LocalHeap() {
     FreeSharedLinearAllocationArea();
 
     if (!is_main_thread()) {
-      CodePageHeaderModificationScope rwx_write_scope(
-          "Publishing of marking barrier results for Code space pages requires "
-          "write access to Code page headers");
       marking_barrier_->PublishIfNeeded();
       marking_barrier_->PublishSharedIfNeeded();
       MarkingBarrier* overwritten =
@@ -161,7 +156,7 @@ void LocalHeap::SetUpSharedMarking() {
     if (isolate->shared_space_isolate()
             ->heap()
             ->incremental_marking()
-            ->IsMarking()) {
+            ->IsMajorMarking()) {
       marking_barrier_->ActivateShared();
     }
   }
@@ -202,14 +197,14 @@ bool LocalHeap::IsHandleDereferenceAllowed() {
 }
 #endif
 
-bool LocalHeap::IsParked() {
+bool LocalHeap::IsParked() const {
 #ifdef DEBUG
   VerifyCurrent();
 #endif
   return state_.load_relaxed().IsParked();
 }
 
-bool LocalHeap::IsRunning() {
+bool LocalHeap::IsRunning() const {
 #ifdef DEBUG
   VerifyCurrent();
 #endif
@@ -365,18 +360,24 @@ void LocalHeap::SleepInSafepoint() {
 
   TRACE_GC1(heap_->tracer(), scope_id, thread_kind);
 
-  // Parking the running thread here is an optimization. We do not need to
-  // wake this thread up to reach the next safepoint.
-  ThreadState old_state = state_.SetParked();
-  CHECK(old_state.IsRunning());
-  CHECK(old_state.IsSafepointRequested());
-  CHECK_IMPLIES(old_state.IsCollectionRequested(), is_main_thread());
+  ExecuteWithStackMarkerIfNeeded([this]() {
+    // Parking the running thread here is an optimization. We do not need to
+    // wake this thread up to reach the next safepoint.
+    ThreadState old_state = state_.SetParked();
+    CHECK(old_state.IsRunning());
+    CHECK(old_state.IsSafepointRequested());
+    CHECK_IMPLIES(old_state.IsCollectionRequested(), is_main_thread());
 
-  heap_->safepoint()->WaitInSafepoint();
+    heap_->safepoint()->WaitInSafepoint();
 
-  base::Optional<IgnoreLocalGCRequests> ignore_gc_requests;
-  if (is_main_thread()) ignore_gc_requests.emplace(heap());
-  Unpark();
+    base::Optional<IgnoreLocalGCRequests> ignore_gc_requests;
+    if (is_main_thread()) ignore_gc_requests.emplace(heap());
+    Unpark();
+  });
+}
+
+bool LocalHeap::IsMainThreadOfClientIsolate() const {
+  return is_main_thread() && heap()->isolate()->has_shared_space();
 }
 
 void LocalHeap::FreeLinearAllocationArea() {
@@ -423,17 +424,20 @@ void LocalHeap::UnmarkSharedLinearAllocationArea() {
   }
 }
 
-Address LocalHeap::PerformCollectionAndAllocateAgain(
+AllocationResult LocalHeap::PerformCollectionAndAllocateAgain(
     int object_size, AllocationType type, AllocationOrigin origin,
     AllocationAlignment alignment) {
+  // All allocation tries in this method should have this flag enabled.
   CHECK(!allocation_failed_);
-  CHECK(!main_thread_parked_);
   allocation_failed_ = true;
   static const int kMaxNumberOfRetries = 3;
   int failed_allocations = 0;
   int parked_allocations = 0;
 
   for (int i = 0; i < kMaxNumberOfRetries; i++) {
+    // This flag needs to be reset for each iteration.
+    CHECK(!main_thread_parked_);
+
     if (!heap_->CollectGarbageFromAnyThread(this)) {
       main_thread_parked_ = true;
       parked_allocations++;
@@ -441,13 +445,16 @@ Address LocalHeap::PerformCollectionAndAllocateAgain(
 
     AllocationResult result = AllocateRaw(object_size, type, origin, alignment);
 
-    if (result.IsFailure()) {
-      failed_allocations++;
-    } else {
+    main_thread_parked_ = false;
+
+    if (!result.IsFailure()) {
+      CHECK(allocation_failed_);
       allocation_failed_ = false;
-      main_thread_parked_ = false;
-      return result.ToObjectChecked().address();
+      CHECK(!main_thread_parked_);
+      return result;
     }
+
+    failed_allocations++;
   }
 
   if (v8_flags.trace_gc) {
@@ -458,14 +465,16 @@ Address LocalHeap::PerformCollectionAndAllocateAgain(
         failed_allocations, parked_allocations);
   }
 
-  heap_->FatalProcessOutOfMemory("LocalHeap: allocation failed");
+  CHECK(allocation_failed_);
+  allocation_failed_ = false;
+  CHECK(!main_thread_parked_);
+  return AllocationResult::Failure();
 }
 
 void LocalHeap::AddGCEpilogueCallback(GCEpilogueCallback* callback, void* data,
-                                      GCType gc_type) {
+                                      GCCallbacksInSafepoint::GCType gc_type) {
   DCHECK(IsRunning());
-  gc_epilogue_callbacks_.Add(callback, LocalIsolate::FromHeap(this), gc_type,
-                             data);
+  gc_epilogue_callbacks_.Add(callback, data, gc_type);
 }
 
 void LocalHeap::RemoveGCEpilogueCallback(GCEpilogueCallback* callback,
@@ -474,18 +483,16 @@ void LocalHeap::RemoveGCEpilogueCallback(GCEpilogueCallback* callback,
   gc_epilogue_callbacks_.Remove(callback, data);
 }
 
-void LocalHeap::InvokeGCEpilogueCallbacksInSafepoint(GCType gc_type,
-                                                     GCCallbackFlags flags) {
-  gc_epilogue_callbacks_.Invoke(gc_type, flags);
+void LocalHeap::InvokeGCEpilogueCallbacksInSafepoint(
+    GCCallbacksInSafepoint::GCType gc_type) {
+  gc_epilogue_callbacks_.Invoke(gc_type);
 }
 
 void LocalHeap::NotifyObjectSizeChange(
-    HeapObject object, int old_size, int new_size,
-    ClearRecordedSlots clear_recorded_slots,
-    UpdateInvalidatedObjectSize update_invalidated_object_size) {
+    Tagged<HeapObject> object, int old_size, int new_size,
+    ClearRecordedSlots clear_recorded_slots) {
   heap()->NotifyObjectSizeChange(object, old_size, new_size,
-                                 clear_recorded_slots,
-                                 update_invalidated_object_size);
+                                 clear_recorded_slots);
 }
 
 void LocalHeap::WeakenDescriptorArrays(
diff --git a/deps/v8/src/heap/local-heap.h b/deps/v8/src/heap/local-heap.h
index afeaf19baacab7..1062f87b928c6c 100644
--- a/deps/v8/src/heap/local-heap.h
+++ b/deps/v8/src/heap/local-heap.h
@@ -18,6 +18,7 @@
 #include "src/handles/persistent-handles.h"
 #include "src/heap/concurrent-allocator.h"
 #include "src/heap/gc-callbacks.h"
+
 namespace v8 {
 namespace internal {
 
@@ -38,8 +39,7 @@ class Safepoint;
 //            some time or for blocking operations like locking a mutex.
 class V8_EXPORT_PRIVATE LocalHeap {
  public:
-  using GCEpilogueCallback = void(LocalIsolate*, GCType, GCCallbackFlags,
-                                  void*);
+  using GCEpilogueCallback = void(void*);
 
   explicit LocalHeap(
       Heap* heap, ThreadKind kind,
@@ -60,7 +60,7 @@ class V8_EXPORT_PRIVATE LocalHeap {
   LocalHandles* handles() { return handles_.get(); }
 
   template <typename T>
-  Handle<T> NewPersistentHandle(T object) {
+  Handle<T> NewPersistentHandle(Tagged<T> object) {
     if (!persistent_handles_) {
       EnsurePersistentHandles();
     }
@@ -72,6 +72,12 @@ class V8_EXPORT_PRIVATE LocalHeap {
     return NewPersistentHandle(*object);
   }
 
+  template <typename T>
+  Handle<T> NewPersistentHandle(T object) {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return NewPersistentHandle(Tagged<T>(object));
+  }
+
   template <typename T>
   MaybeHandle<T> NewPersistentMaybeHandle(MaybeHandle<T> maybe_handle) {
     Handle<T> handle;
@@ -91,11 +97,11 @@ class V8_EXPORT_PRIVATE LocalHeap {
   bool IsHandleDereferenceAllowed();
 #endif
 
-  bool IsParked();
-  bool IsRunning();
+  bool IsParked() const;
+  bool IsRunning() const;
 
-  Heap* heap() { return heap_; }
-  Heap* AsHeap() { return heap(); }
+  Heap* heap() const { return heap_; }
+  Heap* AsHeap() const { return heap(); }
 
   MarkingBarrier* marking_barrier() { return marking_barrier_.get(); }
   ConcurrentAllocator* old_space_allocator() {
@@ -108,10 +114,6 @@ class V8_EXPORT_PRIVATE LocalHeap {
     return shared_old_space_allocator_.get();
   }
 
-  void RegisterCodeObject(Handle<Code> code) {
-    heap()->RegisterCodeObject(code);
-  }
-
   // Mark/Unmark linear allocation areas black. Used for black allocation.
   void MarkLinearAllocationAreaBlack();
   void UnmarkLinearAllocationArea();
@@ -142,7 +144,7 @@ class V8_EXPORT_PRIVATE LocalHeap {
   static LocalHeap* Current();
 
 #ifdef DEBUG
-  void VerifyCurrent();
+  void VerifyCurrent() const;
 #endif
 
   // Allocate an uninitialized object.
@@ -151,6 +153,14 @@ class V8_EXPORT_PRIVATE LocalHeap {
       AllocationOrigin origin = AllocationOrigin::kRuntime,
       AllocationAlignment alignment = kTaggedAligned);
 
+  // Allocate an uninitialized object.
+  enum AllocationRetryMode { kLightRetry, kRetryOrFail };
+  template <AllocationRetryMode mode>
+  Tagged<HeapObject> AllocateRawWith(
+      int size_in_bytes, AllocationType allocation,
+      AllocationOrigin origin = AllocationOrigin::kRuntime,
+      AllocationAlignment alignment = kTaggedAligned);
+
   // Allocates an uninitialized object and crashes when object
   // cannot be allocated.
   V8_WARN_UNUSED_RESULT inline Address AllocateRawOrFail(
@@ -158,13 +168,12 @@ class V8_EXPORT_PRIVATE LocalHeap {
       AllocationOrigin origin = AllocationOrigin::kRuntime,
       AllocationAlignment alignment = kTaggedAligned);
 
-  void NotifyObjectSizeChange(
-      HeapObject object, int old_size, int new_size,
-      ClearRecordedSlots clear_recorded_slots,
-      UpdateInvalidatedObjectSize update_invalidated_object_size =
-          UpdateInvalidatedObjectSize::kYes);
+  void NotifyObjectSizeChange(Tagged<HeapObject> object, int old_size,
+                              int new_size,
+                              ClearRecordedSlots clear_recorded_slots);
 
   bool is_main_thread() const { return is_main_thread_; }
+  bool is_in_trampoline() const { return heap_->stack().IsMarkerSet(); }
   bool deserialization_complete() const {
     return heap_->deserialization_complete();
   }
@@ -175,10 +184,8 @@ class V8_EXPORT_PRIVATE LocalHeap {
   // resumes. The callback must not allocate or make any other calls that
   // can trigger GC.
   void AddGCEpilogueCallback(GCEpilogueCallback* callback, void* data,
-                             GCType gc_type = static_cast<v8::GCType>(
-                                 GCType::kGCTypeMarkSweepCompact |
-                                 GCType::kGCTypeScavenge |
-                                 GCType::kGCTypeMinorMarkCompact));
+                             GCCallbacksInSafepoint::GCType gc_type =
+                                 GCCallbacksInSafepoint::GCType::kAll);
   void RemoveGCEpilogueCallback(GCEpilogueCallback* callback, void* data);
 
   // Weakens StrongDescriptorArray objects into regular DescriptorArray objects.
@@ -188,6 +195,19 @@ class V8_EXPORT_PRIVATE LocalHeap {
   // Used to make SetupMainThread() available to unit tests.
   void SetUpMainThreadForTesting();
 
+  // Execute the callback while the local heap is parked. The main thread must
+  // always park via this method, not directly with `ParkedScope`. The callback
+  // is only allowed to execute blocking operations.
+  //
+  // The callback must be a callable object, expecting either no parameters or a
+  // const ParkedScope&, which serves as a witness for parking. Use the second
+  // method, if it is guaranteed that we are on the main thread, or the first
+  // one if it is uncertain.
+  template <typename Callback>
+  V8_INLINE void BlockWhileParked(Callback callback);
+  template <typename Callback>
+  V8_INLINE void BlockMainThreadWhileParked(Callback callback);
+
  private:
   using ParkedBit = base::BitField8<bool, 0, 1>;
   using SafepointRequestedBit = ParkedBit::Next<bool, 1>;
@@ -280,13 +300,20 @@ class V8_EXPORT_PRIVATE LocalHeap {
 
   // Slow path of allocation that performs GC and then retries allocation in
   // loop.
-  Address PerformCollectionAndAllocateAgain(int object_size,
-                                            AllocationType type,
-                                            AllocationOrigin origin,
-                                            AllocationAlignment alignment);
+  AllocationResult PerformCollectionAndAllocateAgain(
+      int object_size, AllocationType type, AllocationOrigin origin,
+      AllocationAlignment alignment);
+
+  bool IsMainThreadOfClientIsolate() const;
+
+  template <typename Callback>
+  V8_INLINE void ExecuteWithStackMarker(Callback callback);
+  template <typename Callback>
+  V8_INLINE void ExecuteWithStackMarkerIfNeeded(Callback callback);
 
   void Park() {
     DCHECK(AllowSafepoints::IsAllowed());
+    DCHECK_IMPLIES(IsMainThreadOfClientIsolate(), is_in_trampoline());
     ThreadState expected = ThreadState::Running();
     if (!state_.CompareExchangeWeak(expected, ThreadState::Parked())) {
       ParkSlowPath();
@@ -308,10 +335,13 @@ class V8_EXPORT_PRIVATE LocalHeap {
   void SleepInSafepoint();
   void SleepInUnpark();
 
+  template <typename Callback>
+  V8_INLINE void ParkAndExecuteCallback(Callback callback);
+
   void EnsurePersistentHandles();
 
-  void InvokeGCEpilogueCallbacksInSafepoint(GCType gc_type,
-                                            GCCallbackFlags flags);
+  void InvokeGCEpilogueCallbacksInSafepoint(
+      GCCallbacksInSafepoint::GCType gc_type);
 
   void SetUpMainThread();
   void SetUp();
@@ -328,14 +358,11 @@ class V8_EXPORT_PRIVATE LocalHeap {
   LocalHeap* prev_;
   LocalHeap* next_;
 
-  std::unordered_set<MemoryChunk*> unprotected_memory_chunks_;
-  uintptr_t code_page_collection_memory_modification_scope_depth_{0};
-
   std::unique_ptr<LocalHandles> handles_;
   std::unique_ptr<PersistentHandles> persistent_handles_;
   std::unique_ptr<MarkingBarrier> marking_barrier_;
 
-  GCCallbacks<LocalIsolate, DisallowGarbageCollection> gc_epilogue_callbacks_;
+  GCCallbacksInSafepoint gc_epilogue_callbacks_;
 
   std::unique_ptr<ConcurrentAllocator> old_space_allocator_;
   std::unique_ptr<ConcurrentAllocator> code_space_allocator_;
diff --git a/deps/v8/src/heap/mark-compact-inl.h b/deps/v8/src/heap/mark-compact-inl.h
index 13c8ccb58e5c9e..42a57030f0c446 100644
--- a/deps/v8/src/heap/mark-compact-inl.h
+++ b/deps/v8/src/heap/mark-compact-inl.h
@@ -5,61 +5,43 @@
 #ifndef V8_HEAP_MARK_COMPACT_INL_H_
 #define V8_HEAP_MARK_COMPACT_INL_H_
 
-#include "src/base/bits.h"
-#include "src/codegen/assembler-inl.h"
-#include "src/heap/heap-inl.h"
-#include "src/heap/incremental-marking.h"
-#include "src/heap/index-generator.h"
+#include "src/common/globals.h"
 #include "src/heap/mark-compact.h"
 #include "src/heap/marking-state-inl.h"
+#include "src/heap/marking-visitor-inl.h"
 #include "src/heap/marking-worklist-inl.h"
 #include "src/heap/marking-worklist.h"
 #include "src/heap/objects-visiting-inl.h"
 #include "src/heap/remembered-set-inl.h"
 #include "src/objects/js-collection-inl.h"
-#include "src/objects/js-weak-refs-inl.h"
-#include "src/objects/slots-inl.h"
 #include "src/objects/transitions.h"
+#include "src/roots/roots.h"
 
 namespace v8 {
 namespace internal {
 
-void MarkCompactCollector::MarkObject(HeapObject host, HeapObject obj) {
-  DCHECK(ReadOnlyHeap::Contains(obj) || heap()->Contains(obj));
-  if (marking_state()->TryMark(obj)) {
-    local_marking_worklists()->Push(obj);
+void MarkCompactCollector::MarkObject(Tagged<HeapObject> host,
+                                      Tagged<HeapObject> obj) {
+  DCHECK(ReadOnlyHeap::Contains(obj) || heap_->Contains(obj));
+  if (marking_state_->TryMark(obj)) {
+    local_marking_worklists_->Push(obj);
     if (V8_UNLIKELY(v8_flags.track_retaining_path)) {
       heap_->AddRetainer(host, obj);
     }
   }
 }
 
-void MarkCompactCollector::MarkRootObject(Root root, HeapObject obj) {
-  DCHECK(ReadOnlyHeap::Contains(obj) || heap()->Contains(obj));
-  if (marking_state()->TryMark(obj)) {
-    local_marking_worklists()->Push(obj);
-    if (V8_UNLIKELY(v8_flags.track_retaining_path)) {
-      heap_->AddRetainingRoot(root, obj);
-    }
-  }
-}
-
-void MinorMarkCompactCollector::MarkRootObject(HeapObject obj) {
-  if (Heap::InYoungGeneration(obj) &&
-      non_atomic_marking_state()->TryMark(obj)) {
-    local_marking_worklists_->Push(obj);
-  }
-}
-
 // static
-void MarkCompactCollector::RecordSlot(HeapObject object, ObjectSlot slot,
-                                      HeapObject target) {
+void MarkCompactCollector::RecordSlot(Tagged<HeapObject> object,
+                                      ObjectSlot slot,
+                                      Tagged<HeapObject> target) {
   RecordSlot(object, HeapObjectSlot(slot), target);
 }
 
 // static
-void MarkCompactCollector::RecordSlot(HeapObject object, HeapObjectSlot slot,
-                                      HeapObject target) {
+void MarkCompactCollector::RecordSlot(Tagged<HeapObject> object,
+                                      HeapObjectSlot slot,
+                                      Tagged<HeapObject> target) {
   MemoryChunk* source_page = MemoryChunk::FromHeapObject(object);
   if (!source_page->ShouldSkipEvacuationSlotRecording()) {
     RecordSlot(source_page, slot, target);
@@ -68,7 +50,8 @@ void MarkCompactCollector::RecordSlot(HeapObject object, HeapObjectSlot slot,
 
 // static
 void MarkCompactCollector::RecordSlot(MemoryChunk* source_page,
-                                      HeapObjectSlot slot, HeapObject target) {
+                                      HeapObjectSlot slot,
+                                      Tagged<HeapObject> target) {
   BasicMemoryChunk* target_page = BasicMemoryChunk::FromHeapObject(target);
   if (target_page->IsEvacuationCandidate()) {
     if (target_page->IsFlagSet(MemoryChunk::IS_EXECUTABLE)) {
@@ -81,190 +64,10 @@ void MarkCompactCollector::RecordSlot(MemoryChunk* source_page,
   }
 }
 
-void MarkCompactCollector::AddTransitionArray(TransitionArray array) {
+void MarkCompactCollector::AddTransitionArray(Tagged<TransitionArray> array) {
   local_weak_objects()->transition_arrays_local.Push(array);
 }
 
-bool MarkCompactCollector::ShouldMarkObject(HeapObject object) const {
-  if (object.InReadOnlySpace()) return false;
-  if (V8_LIKELY(!uses_shared_heap_)) return true;
-  if (is_shared_space_isolate_) return true;
-  return !object.InAnySharedSpace();
-}
-
-template <typename MarkingState>
-template <typename TSlot>
-void MainMarkingVisitor<MarkingState>::RecordSlot(HeapObject object, TSlot slot,
-                                                  HeapObject target) {
-  MarkCompactCollector::RecordSlot(object, slot, target);
-}
-
-template <typename MarkingState>
-void MainMarkingVisitor<MarkingState>::RecordRelocSlot(RelocInfo* rinfo,
-                                                       HeapObject target) {
-  MarkCompactCollector::RecordRelocSlot(rinfo, target);
-}
-
-template <LiveObjectIterationMode mode>
-LiveObjectRange<mode>::iterator::iterator(const MemoryChunk* chunk,
-                                          Bitmap* bitmap, Address start)
-    : chunk_(chunk),
-      one_word_filler_map_(
-          ReadOnlyRoots(chunk->heap()).one_pointer_filler_map()),
-      two_word_filler_map_(
-          ReadOnlyRoots(chunk->heap()).two_pointer_filler_map()),
-      free_space_map_(ReadOnlyRoots(chunk->heap()).free_space_map()),
-      it_(chunk, bitmap) {
-  it_.Advance(Bitmap::IndexToCell(
-      Bitmap::CellAlignIndex(chunk_->AddressToMarkbitIndex(start))));
-  if (!it_.Done()) {
-    cell_base_ = it_.CurrentCellBase();
-    current_cell_ = *it_.CurrentCell();
-    AdvanceToNextValidObject();
-  }
-}
-
-template <LiveObjectIterationMode mode>
-typename LiveObjectRange<mode>::iterator& LiveObjectRange<mode>::iterator::
-operator++() {
-  AdvanceToNextValidObject();
-  return *this;
-}
-
-template <LiveObjectIterationMode mode>
-typename LiveObjectRange<mode>::iterator LiveObjectRange<mode>::iterator::
-operator++(int) {
-  iterator retval = *this;
-  ++(*this);
-  return retval;
-}
-
-template <LiveObjectIterationMode mode>
-void LiveObjectRange<mode>::iterator::AdvanceToNextValidObject() {
-  PtrComprCageBase cage_base(chunk_->heap()->isolate());
-  while (!it_.Done()) {
-    HeapObject object;
-    int size = 0;
-    while (current_cell_ != 0) {
-      uint32_t trailing_zeros = base::bits::CountTrailingZeros(current_cell_);
-      Address addr = cell_base_ + trailing_zeros * kTaggedSize;
-
-      // Clear the first bit of the found object..
-      current_cell_ &= ~(1u << trailing_zeros);
-
-      uint32_t second_bit_index = 0;
-      if (trailing_zeros >= Bitmap::kBitIndexMask) {
-        second_bit_index = 0x1;
-        // The overlapping case; there has to exist a cell after the current
-        // cell.
-        // However, if there is a black area at the end of the page, and the
-        // last word is a one word filler, we are not allowed to advance. In
-        // that case we can return immediately.
-        if (!it_.Advance()) {
-          DCHECK(HeapObject::FromAddress(addr).map() == one_word_filler_map_);
-          current_object_ = HeapObject();
-          return;
-        }
-        cell_base_ = it_.CurrentCellBase();
-        current_cell_ = *it_.CurrentCell();
-      } else {
-        second_bit_index = 1u << (trailing_zeros + 1);
-      }
-
-      Map map;
-      if (current_cell_ & second_bit_index) {
-        // We found a black object. If the black object is within a black area,
-        // make sure that we skip all set bits in the black area until the
-        // object ends.
-        HeapObject black_object = HeapObject::FromAddress(addr);
-        map = black_object.map(cage_base, kAcquireLoad);
-        // Map might be forwarded during GC.
-        DCHECK(MarkCompactCollector::IsMapOrForwarded(map));
-        size = black_object.SizeFromMap(map);
-        int aligned_size = ALIGN_TO_ALLOCATION_ALIGNMENT(size);
-        CHECK_LE(addr + aligned_size, chunk_->area_end());
-        Address end = addr + aligned_size - kTaggedSize;
-        // One word filler objects do not borrow the second mark bit. We have
-        // to jump over the advancing and clearing part.
-        // Note that we know that we are at a one word filler when
-        // object_start + object_size - kTaggedSize == object_start.
-        if (addr != end) {
-          DCHECK_EQ(chunk_, BasicMemoryChunk::FromAddress(end));
-          uint32_t end_mark_bit_index = chunk_->AddressToMarkbitIndex(end);
-          unsigned int end_cell_index =
-              end_mark_bit_index >> Bitmap::kBitsPerCellLog2;
-          MarkBit::CellType end_index_mask =
-              1u << Bitmap::IndexInCell(end_mark_bit_index);
-          if (it_.Advance(end_cell_index)) {
-            cell_base_ = it_.CurrentCellBase();
-            current_cell_ = *it_.CurrentCell();
-          }
-
-          // Clear all bits in current_cell, including the end index.
-          current_cell_ &= ~(end_index_mask + end_index_mask - 1);
-        }
-
-        if (mode == kBlackObjects || mode == kAllLiveObjects) {
-          object = black_object;
-        }
-      } else if ((mode == kGreyObjects || mode == kAllLiveObjects)) {
-        object = HeapObject::FromAddress(addr);
-        Object map_object = object.map(cage_base, kAcquireLoad);
-        CHECK(map_object.IsMap(cage_base));
-        map = Map::cast(map_object);
-        DCHECK(map.IsMap(cage_base));
-        size = object.SizeFromMap(map);
-        CHECK_LE(addr + ALIGN_TO_ALLOCATION_ALIGNMENT(size),
-                 chunk_->area_end());
-      }
-
-      // We found a live object.
-      if (!object.is_null()) {
-        // Do not use IsFreeSpaceOrFiller() here. This may cause a data race for
-        // reading out the instance type when a new map concurrently is written
-        // into this object while iterating over the object.
-        if (map == one_word_filler_map_ || map == two_word_filler_map_ ||
-            map == free_space_map_) {
-          // There are two reasons why we can get black or grey fillers:
-          // 1) Black areas together with slack tracking may result in black one
-          // word filler objects.
-          // 2) Left trimming may leave black or grey fillers behind because we
-          // do not clear the old location of the object start.
-          // We filter these objects out in the iterator.
-          object = HeapObject();
-        } else {
-          break;
-        }
-      }
-    }
-
-    if (current_cell_ == 0) {
-      if (it_.Advance()) {
-        cell_base_ = it_.CurrentCellBase();
-        current_cell_ = *it_.CurrentCell();
-      }
-    }
-    if (!object.is_null()) {
-      current_object_ = object;
-      current_size_ = size;
-      return;
-    }
-  }
-  current_object_ = HeapObject();
-}
-
-template <LiveObjectIterationMode mode>
-typename LiveObjectRange<mode>::iterator LiveObjectRange<mode>::begin() {
-  return iterator(chunk_, bitmap_, start_);
-}
-
-template <LiveObjectIterationMode mode>
-typename LiveObjectRange<mode>::iterator LiveObjectRange<mode>::end() {
-  return iterator(chunk_, bitmap_, end_);
-}
-
-Isolate* CollectorBase::isolate() { return heap()->isolate(); }
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/mark-compact.cc b/deps/v8/src/heap/mark-compact.cc
index 19e02f1bbc2f12..189e023cc147f2 100644
--- a/deps/v8/src/heap/mark-compact.cc
+++ b/deps/v8/src/heap/mark-compact.cc
@@ -4,10 +4,13 @@
 
 #include "src/heap/mark-compact.h"
 
+#include <algorithm>
+#include <atomic>
 #include <memory>
 #include <unordered_map>
 #include <unordered_set>
 
+#include "src/base/bits.h"
 #include "src/base/logging.h"
 #include "src/base/optional.h"
 #include "src/base/platform/mutex.h"
@@ -26,8 +29,9 @@
 #include "src/handles/global-handles.h"
 #include "src/heap/array-buffer-sweeper.h"
 #include "src/heap/basic-memory-chunk.h"
-#include "src/heap/code-object-registry.h"
 #include "src/heap/concurrent-allocator.h"
+#include "src/heap/concurrent-marking.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/evacuation-allocator-inl.h"
 #include "src/heap/evacuation-verifier-inl.h"
 #include "src/heap/gc-tracer-inl.h"
@@ -35,14 +39,13 @@
 #include "src/heap/heap.h"
 #include "src/heap/incremental-marking-inl.h"
 #include "src/heap/index-generator.h"
-#include "src/heap/invalidated-slots-inl.h"
-#include "src/heap/invalidated-slots.h"
 #include "src/heap/large-spaces.h"
 #include "src/heap/mark-compact-inl.h"
+#include "src/heap/mark-sweep-utilities.h"
 #include "src/heap/marking-barrier.h"
+#include "src/heap/marking-inl.h"
 #include "src/heap/marking-state-inl.h"
 #include "src/heap/marking-visitor-inl.h"
-#include "src/heap/marking-visitor.h"
 #include "src/heap/memory-chunk-layout.h"
 #include "src/heap/memory-chunk.h"
 #include "src/heap/memory-measurement-inl.h"
@@ -50,6 +53,7 @@
 #include "src/heap/new-spaces.h"
 #include "src/heap/object-stats.h"
 #include "src/heap/objects-visiting-inl.h"
+#include "src/heap/page-inl.h"
 #include "src/heap/parallel-work-item.h"
 #include "src/heap/pretenuring-handler-inl.h"
 #include "src/heap/pretenuring-handler.h"
@@ -62,6 +66,7 @@
 #include "src/heap/sweeper.h"
 #include "src/heap/traced-handles-marking-visitor.h"
 #include "src/heap/weak-object-worklists.h"
+#include "src/heap/zapping.h"
 #include "src/init/v8.h"
 #include "src/logging/tracing-flags.h"
 #include "src/objects/embedder-data-array-inl.h"
@@ -86,10 +91,6 @@
 namespace v8 {
 namespace internal {
 
-// The following has to hold in order for {MarkingState::MarkBitFrom} to not
-// produce invalid {kImpossibleBitPattern} in the marking bitmap by overlapping.
-static_assert(Heap::kMinObjectSizeInTaggedWords >= 2);
-
 // =============================================================================
 // Verifiers
 // =============================================================================
@@ -97,130 +98,10 @@ static_assert(Heap::kMinObjectSizeInTaggedWords >= 2);
 #ifdef VERIFY_HEAP
 namespace {
 
-class MarkingVerifier : public ObjectVisitorWithCageBases, public RootVisitor {
- public:
-  virtual void Run() = 0;
-
- protected:
-  explicit MarkingVerifier(Heap* heap)
-      : ObjectVisitorWithCageBases(heap), heap_(heap) {}
-
-  virtual ConcurrentBitmap<AccessMode::NON_ATOMIC>* bitmap(
-      const MemoryChunk* chunk) = 0;
-
-  virtual void VerifyMap(Map map) = 0;
-  virtual void VerifyPointers(ObjectSlot start, ObjectSlot end) = 0;
-  virtual void VerifyPointers(MaybeObjectSlot start, MaybeObjectSlot end) = 0;
-  virtual void VerifyCodePointer(CodeObjectSlot slot) = 0;
-  virtual void VerifyRootPointers(FullObjectSlot start, FullObjectSlot end) = 0;
-
-  virtual bool IsMarked(HeapObject object) = 0;
-
-  void VisitPointers(HeapObject host, ObjectSlot start,
-                     ObjectSlot end) override {
-    VerifyPointers(start, end);
-  }
-
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
-                     MaybeObjectSlot end) override {
-    VerifyPointers(start, end);
-  }
-
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
-    VerifyCodePointer(slot);
-  }
-
-  void VisitRootPointers(Root root, const char* description,
-                         FullObjectSlot start, FullObjectSlot end) override {
-    VerifyRootPointers(start, end);
-  }
-
-  void VisitMapPointer(HeapObject object) override {
-    VerifyMap(object.map(cage_base()));
-  }
-
-  void VerifyRoots();
-  void VerifyMarkingOnPage(const Page* page, Address start, Address end);
-  void VerifyMarking(NewSpace* new_space);
-  void VerifyMarking(PagedSpaceBase* paged_space);
-  void VerifyMarking(LargeObjectSpace* lo_space);
-
-  Heap* heap_;
-};
-
-void MarkingVerifier::VerifyRoots() {
-  heap_->IterateRootsIncludingClients(
-      this, base::EnumSet<SkipRoot>{SkipRoot::kWeak, SkipRoot::kTopOfStack});
-}
-
-void MarkingVerifier::VerifyMarkingOnPage(const Page* page, Address start,
-                                          Address end) {
-  Address next_object_must_be_here_or_later = start;
-
-  for (auto object_and_size :
-       LiveObjectRange<kAllLiveObjects>(page, bitmap(page))) {
-    HeapObject object = object_and_size.first;
-    size_t size = object_and_size.second;
-    Address current = object.address();
-    if (current < start) continue;
-    if (current >= end) break;
-    CHECK(IsMarked(object));
-    CHECK(current >= next_object_must_be_here_or_later);
-    object.Iterate(cage_base(), this);
-    next_object_must_be_here_or_later = current + size;
-    // The object is either part of a black area of black allocation or a
-    // regular black object
-    CHECK(bitmap(page)->AllBitsSetInRange(
-              page->AddressToMarkbitIndex(current),
-              page->AddressToMarkbitIndex(next_object_must_be_here_or_later)) ||
-          bitmap(page)->AllBitsClearInRange(
-              page->AddressToMarkbitIndex(current + kTaggedSize * 2),
-              page->AddressToMarkbitIndex(next_object_must_be_here_or_later)));
-    current = next_object_must_be_here_or_later;
-  }
-}
-
-void MarkingVerifier::VerifyMarking(NewSpace* space) {
-  if (!space) return;
-  if (v8_flags.minor_mc) {
-    VerifyMarking(PagedNewSpace::From(space)->paged_space());
-    return;
-  }
-  Address end = space->top();
-  // The bottom position is at the start of its page. Allows us to use
-  // page->area_start() as start of range on all pages.
-  CHECK_EQ(space->first_allocatable_address(),
-           space->first_page()->area_start());
-
-  PageRange range(space->first_allocatable_address(), end);
-  for (auto it = range.begin(); it != range.end();) {
-    Page* page = *(it++);
-    Address limit = it != range.end() ? page->area_end() : end;
-    CHECK(limit == end || !page->Contains(end));
-    VerifyMarkingOnPage(page, page->area_start(), limit);
-  }
-}
-
-void MarkingVerifier::VerifyMarking(PagedSpaceBase* space) {
-  for (Page* p : *space) {
-    VerifyMarkingOnPage(p, p->area_start(), p->area_end());
-  }
-}
-
-void MarkingVerifier::VerifyMarking(LargeObjectSpace* lo_space) {
-  if (!lo_space) return;
-  LargeObjectSpaceObjectIterator it(lo_space);
-  for (HeapObject obj = it.Next(); !obj.is_null(); obj = it.Next()) {
-    if (IsMarked(obj)) {
-      obj.Iterate(cage_base(), this);
-    }
-  }
-}
-
-class FullMarkingVerifier : public MarkingVerifier {
+class FullMarkingVerifier : public MarkingVerifierBase {
  public:
   explicit FullMarkingVerifier(Heap* heap)
-      : MarkingVerifier(heap),
+      : MarkingVerifierBase(heap),
         marking_state_(heap->non_atomic_marking_state()) {}
 
   void Run() override {
@@ -236,16 +117,15 @@ class FullMarkingVerifier : public MarkingVerifier {
   }
 
  protected:
-  ConcurrentBitmap<AccessMode::NON_ATOMIC>* bitmap(
-      const MemoryChunk* chunk) override {
-    return marking_state_->bitmap(chunk);
+  const MarkingBitmap* bitmap(const MemoryChunk* chunk) override {
+    return chunk->marking_bitmap();
   }
 
-  bool IsMarked(HeapObject object) override {
+  bool IsMarked(Tagged<HeapObject> object) override {
     return marking_state_->IsMarked(object);
   }
 
-  void VerifyMap(Map map) override { VerifyHeapObjectImpl(map); }
+  void VerifyMap(Tagged<Map> map) override { VerifyHeapObjectImpl(map); }
 
   void VerifyPointers(ObjectSlot start, ObjectSlot end) override {
     VerifyPointersImpl(start, end);
@@ -255,9 +135,9 @@ class FullMarkingVerifier : public MarkingVerifier {
     VerifyPointersImpl(start, end);
   }
 
-  void VerifyCodePointer(CodeObjectSlot slot) override {
-    Object maybe_code = slot.load(code_cage_base());
-    HeapObject code;
+  void VerifyCodePointer(InstructionStreamSlot slot) override {
+    Tagged<Object> maybe_code = slot.load(code_cage_base());
+    Tagged<HeapObject> code;
     // The slot might contain smi during Code creation, so skip it.
     if (maybe_code.GetHeapObject(&code)) {
       VerifyHeapObjectImpl(code);
@@ -268,22 +148,25 @@ class FullMarkingVerifier : public MarkingVerifier {
     VerifyPointersImpl(start, end);
   }
 
-  void VisitCodeTarget(RelocInfo* rinfo) override {
-    InstructionStream target =
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
+    Tagged<InstructionStream> target =
         InstructionStream::FromTargetAddress(rinfo->target_address());
     VerifyHeapObjectImpl(target);
   }
 
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override {
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
     DCHECK(RelocInfo::IsEmbeddedObjectMode(rinfo->rmode()));
-    HeapObject target_object = rinfo->target_object(cage_base());
-    if (!rinfo->code().IsWeakObject(target_object)) {
+    Tagged<HeapObject> target_object = rinfo->target_object(cage_base());
+    Tagged<Code> code = Code::unchecked_cast(host->raw_code(kAcquireLoad));
+    if (!code->IsWeakObject(target_object)) {
       VerifyHeapObjectImpl(target_object);
     }
   }
 
  private:
-  V8_INLINE void VerifyHeapObjectImpl(HeapObject heap_object) {
+  V8_INLINE void VerifyHeapObjectImpl(Tagged<HeapObject> heap_object) {
     if (!ShouldVerifyObject(heap_object)) return;
 
     if (heap_->MustBeInSharedOldSpace(heap_object)) {
@@ -294,7 +177,7 @@ class FullMarkingVerifier : public MarkingVerifier {
           marking_state_->IsMarked(heap_object));
   }
 
-  V8_INLINE bool ShouldVerifyObject(HeapObject heap_object) {
+  V8_INLINE bool ShouldVerifyObject(Tagged<HeapObject> heap_object) {
     const bool in_shared_heap = heap_object.InWritableSharedSpace();
     return heap_->isolate()->is_shared_space_isolate() ? in_shared_heap
                                                        : !in_shared_heap;
@@ -304,7 +187,7 @@ class FullMarkingVerifier : public MarkingVerifier {
   V8_INLINE void VerifyPointersImpl(TSlot start, TSlot end) {
     for (TSlot slot = start; slot < end; ++slot) {
       typename TSlot::TObject object = slot.load(cage_base());
-      HeapObject heap_object;
+      Tagged<HeapObject> heap_object;
       if (object.GetHeapObjectIfStrong(&heap_object)) {
         VerifyHeapObjectImpl(heap_object);
       }
@@ -318,7 +201,7 @@ class FullMarkingVerifier : public MarkingVerifier {
 #endif  // VERIFY_HEAP
 
 // ==================================================================
-// CollectorBase, MinorMarkCompactCollector, MarkCompactCollector
+// MarkCompactCollector
 // ==================================================================
 
 namespace {
@@ -340,115 +223,80 @@ int NumberOfParallelCompactionTasks(Heap* heap) {
   }
   return tasks;
 }
-}  // namespace
-
-CollectorBase::CollectorBase(Heap* heap, GarbageCollector collector)
-    : heap_(heap),
-      garbage_collector_(collector),
-      marking_state_(heap_->marking_state()),
-      non_atomic_marking_state_(heap_->non_atomic_marking_state()) {
-  DCHECK_NE(GarbageCollector::SCAVENGER, garbage_collector_);
-}
-
-bool CollectorBase::IsMajorMC() {
-  return !heap_->IsYoungGenerationCollector(garbage_collector_);
-}
-
-void CollectorBase::StartSweepSpace(PagedSpace* space) {
-  DCHECK_NE(NEW_SPACE, space->identity());
-  space->ClearAllocatorState();
-
-  int will_be_swept = 0;
-  bool unused_page_present = false;
 
-  Sweeper* sweeper = heap()->sweeper();
-
-  // Loop needs to support deletion if live bytes == 0 for a page.
-  for (auto it = space->begin(); it != space->end();) {
-    Page* p = *(it++);
-    DCHECK(p->SweepingDone());
+}  // namespace
 
-    if (p->IsEvacuationCandidate()) {
-      DCHECK_NE(NEW_SPACE, space->identity());
-      // Will be processed in Evacuate.
-      continue;
-    }
+// This visitor is used for marking on the main thread. It is cheaper than
+// the concurrent marking visitor because it does not snapshot JSObjects.
+class MainMarkingVisitor final
+    : public FullMarkingVisitorBase<MainMarkingVisitor> {
+ public:
+  MainMarkingVisitor(MarkingWorklists::Local* local_marking_worklists,
+                     WeakObjects::Local* local_weak_objects, Heap* heap,
+                     unsigned mark_compact_epoch,
+                     base::EnumSet<CodeFlushMode> code_flush_mode,
+                     bool trace_embedder_fields,
+                     bool should_keep_ages_unchanged,
+                     uint16_t code_flushing_increase)
+      : FullMarkingVisitorBase<MainMarkingVisitor>(
+            local_marking_worklists, local_weak_objects, heap,
+            mark_compact_epoch, code_flush_mode, trace_embedder_fields,
+            should_keep_ages_unchanged, code_flushing_increase) {}
 
-    // One unused page is kept, all further are released before sweeping them.
-    if (non_atomic_marking_state()->live_bytes(p) == 0) {
-      if (unused_page_present) {
-        if (v8_flags.gc_verbose) {
-          PrintIsolate(isolate(), "sweeping: released page: %p",
-                       static_cast<void*>(p));
-        }
-        space->ReleasePage(p);
-        continue;
-      }
-      unused_page_present = true;
-    }
+ private:
+  // Functions required by MarkingVisitorBase.
 
-    sweeper->AddPage(space->identity(), p, Sweeper::REGULAR);
-    will_be_swept++;
+  template <typename TSlot>
+  void RecordSlot(Tagged<HeapObject> object, TSlot slot,
+                  Tagged<HeapObject> target) {
+    MarkCompactCollector::RecordSlot(object, slot, target);
   }
 
-  if (v8_flags.gc_verbose) {
-    PrintIsolate(isolate(), "sweeping: space=%s initialized_for_sweeping=%d",
-                 space->name(), will_be_swept);
+  void RecordRelocSlot(Tagged<InstructionStream> host, RelocInfo* rinfo,
+                       Tagged<HeapObject> target) {
+    MarkCompactCollector::RecordRelocSlot(host, rinfo, target);
   }
-}
 
-bool CollectorBase::IsCppHeapMarkingFinished() const {
-  const auto* cpp_heap = CppHeap::From(heap_->cpp_heap());
-  if (!cpp_heap) return true;
+  TraceRetainingPathMode retaining_path_mode() {
+    return (V8_UNLIKELY(v8_flags.track_retaining_path))
+               ? TraceRetainingPathMode::kEnabled
+               : TraceRetainingPathMode::kDisabled;
+  }
 
-  return cpp_heap->IsTracingDone() &&
-         local_marking_worklists()->IsWrapperEmpty();
-}
+  friend class MarkingVisitorBase<MainMarkingVisitor>;
+};
 
 MarkCompactCollector::MarkCompactCollector(Heap* heap)
-    : CollectorBase(heap, GarbageCollector::MARK_COMPACTOR),
+    : heap_(heap),
 #ifdef DEBUG
       state_(IDLE),
 #endif
-      uses_shared_heap_(isolate()->has_shared_space()),
-      is_shared_space_isolate_(isolate()->is_shared_space_isolate()),
+      uses_shared_heap_(heap_->isolate()->has_shared_space()),
+      is_shared_space_isolate_(heap_->isolate()->is_shared_space_isolate()),
+      marking_state_(heap_->marking_state()),
+      non_atomic_marking_state_(heap_->non_atomic_marking_state()),
       sweeper_(heap_->sweeper()) {
 }
 
 MarkCompactCollector::~MarkCompactCollector() = default;
 
-void MarkCompactCollector::SetUp() {}
-
 void MarkCompactCollector::TearDown() {
-  AbortCompaction();
-  if (heap()->incremental_marking()->IsMajorMarking()) {
-    local_marking_worklists()->Publish();
-    heap()->main_thread_local_heap()->marking_barrier()->PublishIfNeeded();
+  if (heap_->incremental_marking()->IsMajorMarking()) {
+    local_marking_worklists_->Publish();
+    heap_->main_thread_local_heap_->marking_barrier()->PublishIfNeeded();
     // Marking barriers of LocalHeaps will be published in their destructors.
-    marking_worklists()->Clear();
+    marking_worklists_.Clear();
     local_weak_objects()->Publish();
     weak_objects()->Clear();
   }
 }
 
-// static
-bool MarkCompactCollector::IsMapOrForwarded(Map map) {
-  MapWord map_word = map.map_word(kRelaxedLoad);
-
-  if (map_word.IsForwardingAddress()) {
-    // During GC we can't access forwarded maps without synchronization.
-    return true;
-  } else {
-    return map_word.ToMap().IsMap();
-  }
-}
-
 void MarkCompactCollector::AddEvacuationCandidate(Page* p) {
   DCHECK(!p->NeverEvacuate());
 
   if (v8_flags.trace_evacuation_candidates) {
     PrintIsolate(
-        isolate(),
+        heap_->isolate(),
         "Evacuation candidate: Free bytes: %6zu. Free Lists length: %4d.\n",
         p->area_size() - p->allocated_bytes(), p->FreeListsLength());
   }
@@ -461,8 +309,9 @@ static void TraceFragmentation(PagedSpace* space) {
   int number_of_pages = space->CountTotalPages();
   intptr_t reserved = (number_of_pages * space->AreaSize());
   intptr_t free = reserved - space->SizeOfObjects();
-  PrintF("[%s]: %d pages, %d (%.1f%%) free\n", space->name(), number_of_pages,
-         static_cast<int>(free), static_cast<double>(free) * 100 / reserved);
+  PrintF("[%s]: %d pages, %d (%.1f%%) free\n", ToString(space->identity()),
+         number_of_pages, static_cast<int>(free),
+         static_cast<double>(free) * 100 / reserved);
 }
 
 bool MarkCompactCollector::StartCompaction(StartCompactionMode mode) {
@@ -471,67 +320,61 @@ bool MarkCompactCollector::StartCompaction(StartCompactionMode mode) {
 
   // Bailouts for completely disabled compaction.
   if (!v8_flags.compact ||
-      (mode == StartCompactionMode::kAtomic && heap()->IsGCWithStack() &&
+      (mode == StartCompactionMode::kAtomic && heap_->IsGCWithStack() &&
        !v8_flags.compact_with_stack) ||
       (v8_flags.gc_experiment_less_compaction &&
        !heap_->ShouldReduceMemory())) {
     return false;
   }
 
-  CollectEvacuationCandidates(heap()->old_space());
+  CollectEvacuationCandidates(heap_->old_space());
 
-  if (heap()->shared_space()) {
-    CollectEvacuationCandidates(heap()->shared_space());
+  if (heap_->shared_space()) {
+    CollectEvacuationCandidates(heap_->shared_space());
   }
 
-  if (v8_flags.compact_code_space &&
-      (!heap()->IsGCWithStack() || v8_flags.compact_code_space_with_stack)) {
-    CollectEvacuationCandidates(heap()->code_space());
+  if (heap_->isolate()->AllowsCodeCompaction() &&
+      (!heap_->IsGCWithStack() || v8_flags.compact_code_space_with_stack)) {
+    CollectEvacuationCandidates(heap_->code_space());
   } else if (v8_flags.trace_fragmentation) {
-    TraceFragmentation(heap()->code_space());
+    TraceFragmentation(heap_->code_space());
   }
 
   compacting_ = !evacuation_candidates_.empty();
   return compacting_;
 }
 
-namespace {
-void VisitObjectWithEmbedderFields(JSObject object,
-                                   MarkingWorklists::Local& worklist) {
-  DCHECK(object.MayHaveEmbedderFields());
-  DCHECK(!Heap::InYoungGeneration(object));
-
-  MarkingWorklists::Local::WrapperSnapshot wrapper_snapshot;
-  const bool valid_snapshot =
-      worklist.ExtractWrapper(object.map(), object, wrapper_snapshot);
-  DCHECK(valid_snapshot);
-  USE(valid_snapshot);
-  worklist.PushExtractedWrapper(wrapper_snapshot);
-}
-}  // namespace
-
 void MarkCompactCollector::StartMarking() {
   std::vector<Address> contexts =
-      heap()->memory_measurement()->StartProcessing();
+      heap_->memory_measurement()->StartProcessing();
   if (v8_flags.stress_per_context_marking_worklist) {
     contexts.clear();
-    HandleScope handle_scope(heap()->isolate());
-    for (auto context : heap()->FindAllNativeContexts()) {
+    HandleScope handle_scope(heap_->isolate());
+    for (auto context : heap_->FindAllNativeContexts()) {
       contexts.push_back(context->ptr());
     }
   }
-  code_flush_mode_ = Heap::GetCodeFlushMode(isolate());
-  marking_worklists()->CreateContextWorklists(contexts);
-  auto* cpp_heap = CppHeap::From(heap_->cpp_heap());
+  heap_->tracer()->NotifyMarkingStart();
+  code_flush_mode_ = Heap::GetCodeFlushMode(heap_->isolate());
+  use_background_threads_in_cycle_ = heap_->ShouldUseBackgroundThreads();
+  marking_worklists_.CreateContextWorklists(contexts);
+  auto* cpp_heap = CppHeap::From(heap_->cpp_heap_);
   local_marking_worklists_ = std::make_unique<MarkingWorklists::Local>(
-      marking_worklists(),
+      &marking_worklists_,
       cpp_heap ? cpp_heap->CreateCppMarkingStateForMutatorThread()
                : MarkingWorklists::Local::kNoCppMarkingState);
   local_weak_objects_ = std::make_unique<WeakObjects::Local>(weak_objects());
-  marking_visitor_ = std::make_unique<MarkingVisitor>(
-      marking_state(), local_marking_worklists(), local_weak_objects_.get(),
-      heap_, epoch(), code_flush_mode(), heap_->cpp_heap(),
-      heap_->ShouldCurrentGCKeepAgesUnchanged());
+  marking_visitor_ = std::make_unique<MainMarkingVisitor>(
+      local_marking_worklists_.get(), local_weak_objects_.get(), heap_, epoch(),
+      code_flush_mode(), heap_->cpp_heap_,
+      heap_->ShouldCurrentGCKeepAgesUnchanged(),
+      heap_->tracer()->CodeFlushingIncrease());
+  // This method evicts SFIs with flushed bytecode from the cache before
+  // iterating the compilation cache as part of the root set. SFIs that get
+  // flushed in this GC cycle will get evicted out of the cache in the next GC
+  // cycle. The SFI will remain in the cache until then and may remain in the
+  // cache even longer in case the SFI is re-compiled.
+  heap_->isolate()->compilation_cache()->MarkCompactPrologue();
 // Marking bits are cleared by the sweeper.
 #ifdef VERIFY_HEAP
   if (v8_flags.verify_heap) {
@@ -546,10 +389,12 @@ void MarkCompactCollector::CollectGarbage() {
   DCHECK(state_ == PREPARE_GC);
 
   MarkLiveObjects();
+  // This will walk dead object graphs and so requires that all references are
+  // still intact.
+  RecordObjectStats();
   ClearNonLiveReferences();
   VerifyMarking();
-  heap()->memory_measurement()->FinishProcessing(native_context_stats_);
-  RecordObjectStats();
+  heap_->memory_measurement()->FinishProcessing(native_context_stats_);
 
   Sweep();
   Evacuate();
@@ -557,32 +402,32 @@ void MarkCompactCollector::CollectGarbage() {
 }
 
 #ifdef VERIFY_HEAP
+
 void MarkCompactCollector::VerifyMarkbitsAreClean(PagedSpaceBase* space) {
   for (Page* p : *space) {
-    CHECK(non_atomic_marking_state()->bitmap(p)->IsClean());
-    CHECK_EQ(0, non_atomic_marking_state()->live_bytes(p));
+    CHECK(p->marking_bitmap()->IsClean());
+    CHECK_EQ(0, p->live_bytes());
   }
 }
 
 void MarkCompactCollector::VerifyMarkbitsAreClean(NewSpace* space) {
   if (!space) return;
-  if (v8_flags.minor_mc) {
+  if (v8_flags.minor_ms) {
     VerifyMarkbitsAreClean(PagedNewSpace::From(space)->paged_space());
     return;
   }
   for (Page* p : PageRange(space->first_allocatable_address(), space->top())) {
-    CHECK(non_atomic_marking_state()->bitmap(p)->IsClean());
-    CHECK_EQ(0, non_atomic_marking_state()->live_bytes(p));
+    CHECK(p->marking_bitmap()->IsClean());
+    CHECK_EQ(0, p->live_bytes());
   }
 }
 
 void MarkCompactCollector::VerifyMarkbitsAreClean(LargeObjectSpace* space) {
   if (!space) return;
   LargeObjectSpaceObjectIterator it(space);
-  for (HeapObject obj = it.Next(); !obj.is_null(); obj = it.Next()) {
-    CHECK(non_atomic_marking_state()->IsUnmarked(obj));
-    CHECK_EQ(0, non_atomic_marking_state()->live_bytes(
-                    MemoryChunk::FromHeapObject(obj)));
+  for (Tagged<HeapObject> obj = it.Next(); !obj.is_null(); obj = it.Next()) {
+    CHECK(non_atomic_marking_state_->IsUnmarked(obj));
+    CHECK_EQ(0, MemoryChunk::FromHeapObject(obj)->live_bytes());
   }
 }
 
@@ -616,16 +461,16 @@ void MarkCompactCollector::ComputeEvacuationHeuristics(
   // exist enough compaction speed samples.
   const float kTargetMsPerArea = .5;
 
-  if (heap()->ShouldReduceMemory()) {
+  if (heap_->ShouldReduceMemory()) {
     *target_fragmentation_percent = kTargetFragmentationPercentForReduceMemory;
     *max_evacuated_bytes = kMaxEvacuatedBytesForReduceMemory;
-  } else if (heap()->ShouldOptimizeForMemoryUsage()) {
+  } else if (heap_->ShouldOptimizeForMemoryUsage()) {
     *target_fragmentation_percent =
         kTargetFragmentationPercentForOptimizeMemory;
     *max_evacuated_bytes = kMaxEvacuatedBytesForOptimizeMemory;
   } else {
     const double estimated_compaction_speed =
-        heap()->tracer()->CompactionSpeedInBytesPerMillisecond();
+        heap_->tracer()->CompactionSpeedInBytesPerMillisecond();
     if (estimated_compaction_speed != 0) {
       // Estimate the target fragmentation based on traced compaction speed
       // and a goal for a single page.
@@ -682,15 +527,9 @@ void MarkCompactCollector::CollectEvacuationCandidates(PagedSpace* space) {
       "Modification of Code page header flags requires write "
       "access");
 
-  DCHECK(!sweeper()->sweeping_in_progress());
-  Page* owner_of_linear_allocation_area =
-      space->top() == space->limit()
-          ? nullptr
-          : Page::FromAllocationAreaAddress(space->top());
+  DCHECK(!sweeper_->sweeping_in_progress());
   for (Page* p : *space) {
-    if (p->NeverEvacuate() || (p == owner_of_linear_allocation_area) ||
-        !p->CanAllocate())
-      continue;
+    if (p->NeverEvacuate() || !p->CanAllocate()) continue;
 
     if (p->IsPinned()) {
       DCHECK(
@@ -721,7 +560,7 @@ void MarkCompactCollector::CollectEvacuationCandidates(PagedSpace* space) {
   int candidate_count = 0;
   size_t total_live_bytes = 0;
 
-  const bool reduce_memory = heap()->ShouldReduceMemory();
+  const bool reduce_memory = heap_->ShouldReduceMemory();
   if (v8_flags.manual_evacuation_candidates_selection) {
     for (size_t i = 0; i < pages.size(); i++) {
       Page* p = pages[i].second;
@@ -733,10 +572,10 @@ void MarkCompactCollector::CollectEvacuationCandidates(PagedSpace* space) {
       }
     }
   } else if (v8_flags.stress_compaction_random) {
-    double fraction = isolate()->fuzzer_rng()->NextDouble();
+    double fraction = heap_->isolate()->fuzzer_rng()->NextDouble();
     size_t pages_to_mark_count =
         static_cast<size_t>(fraction * (pages.size() + 1));
-    for (uint64_t i : isolate()->fuzzer_rng()->NextSample(
+    for (uint64_t i : heap_->isolate()->fuzzer_rng()->NextSample(
              pages.size(), pages_to_mark_count)) {
       candidate_count++;
       total_live_bytes += pages[i].first;
@@ -772,12 +611,12 @@ void MarkCompactCollector::CollectEvacuationCandidates(PagedSpace* space) {
         total_live_bytes += live_bytes;
       }
       if (v8_flags.trace_fragmentation_verbose) {
-        PrintIsolate(isolate(),
+        PrintIsolate(heap_->isolate(),
                      "compaction-selection-page: space=%s free_bytes_page=%zu "
                      "fragmentation_limit_kb=%zu "
                      "fragmentation_limit_percent=%d sum_compaction_kb=%zu "
                      "compaction_limit_kb=%zu\n",
-                     space->name(), (area_size - live_bytes) / KB,
+                     ToString(space->identity()), (area_size - live_bytes) / KB,
                      free_bytes_threshold / KB, target_fragmentation_percent,
                      total_live_bytes / KB, max_evacuated_bytes / KB);
       }
@@ -798,67 +637,55 @@ void MarkCompactCollector::CollectEvacuationCandidates(PagedSpace* space) {
   }
 
   if (v8_flags.trace_fragmentation) {
-    PrintIsolate(isolate(),
+    PrintIsolate(heap_->isolate(),
                  "compaction-selection: space=%s reduce_memory=%d pages=%d "
                  "total_live_bytes=%zu\n",
-                 space->name(), reduce_memory, candidate_count,
+                 ToString(space->identity()), reduce_memory, candidate_count,
                  total_live_bytes / KB);
   }
 }
 
-void MarkCompactCollector::AbortCompaction() {
-  if (compacting_) {
-    CodePageHeaderModificationScope rwx_write_scope(
-        "Changing Code page flags and remembered sets require "
-        "write access "
-        "to the page header");
-    RememberedSet<OLD_TO_OLD>::ClearAll(heap());
-    RememberedSet<OLD_TO_CODE>::ClearAll(heap());
-    for (Page* p : evacuation_candidates_) {
-      p->ClearEvacuationCandidate();
-    }
-    compacting_ = false;
-    evacuation_candidates_.clear();
-  }
-  DCHECK(evacuation_candidates_.empty());
-}
-
 void MarkCompactCollector::Prepare() {
 #ifdef DEBUG
   DCHECK(state_ == IDLE);
   state_ = PREPARE_GC;
 #endif
 
-  DCHECK(!sweeper()->sweeping_in_progress());
+  DCHECK(!sweeper_->sweeping_in_progress());
+
+  // LABs do not survive a GC. Free them here before selecting evacuation
+  // candidates (freeing LABs may give memory back to the free list which does
+  // not exist for evacuation candidates anymore).
+  heap_->FreeLinearAllocationAreas();
 
   // Unmapper tasks needs to be stopped during the GC, otherwise pages queued
   // for freeing might get unmapped during the GC.
   DCHECK(!heap_->memory_allocator()->unmapper()->IsRunning());
 
-  if (!heap()->incremental_marking()->IsMarking()) {
-    if (heap()->cpp_heap()) {
-      TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_EMBEDDER_PROLOGUE);
+  DCHECK_IMPLIES(heap_->incremental_marking()->IsMarking(),
+                 heap_->incremental_marking()->IsMajorMarking());
+  if (!heap_->incremental_marking()->IsMarking()) {
+    if (heap_->cpp_heap_) {
+      TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_EMBEDDER_PROLOGUE);
       // InitializeTracing should be called before visitor initialization in
       // StartMarking.
-      CppHeap::From(heap()->cpp_heap())
+      CppHeap::From(heap_->cpp_heap_)
           ->InitializeTracing(CppHeap::CollectionType::kMajor);
     }
     StartCompaction(StartCompactionMode::kAtomic);
     StartMarking();
-    if (heap()->cpp_heap()) {
-      TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_EMBEDDER_PROLOGUE);
+    if (heap_->cpp_heap_) {
+      TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_EMBEDDER_PROLOGUE);
       // StartTracing immediately starts marking which requires V8 worklists to
       // be set up.
-      CppHeap::From(heap()->cpp_heap())->StartTracing();
+      CppHeap::From(heap_->cpp_heap_)->StartTracing();
     }
 #ifdef V8_COMPRESS_POINTERS
-    heap_->isolate()->external_pointer_table().StartCompactingIfNeeded();
+    heap_->external_pointer_space()->StartCompactingIfNeeded();
 #endif  // V8_COMPRESS_POINTERS
   }
 
-  heap_->FreeLinearAllocationAreas();
-
-  NewSpace* new_space = heap()->new_space();
+  NewSpace* new_space = heap_->new_space();
   if (new_space) {
     DCHECK_EQ(new_space->top(), new_space->original_top_acquire());
   }
@@ -867,31 +694,31 @@ void MarkCompactCollector::Prepare() {
 void MarkCompactCollector::FinishConcurrentMarking() {
   // FinishConcurrentMarking is called for both, concurrent and parallel,
   // marking. It is safe to call this function when tasks are already finished.
-  DCHECK_EQ(heap()->concurrent_marking()->garbage_collector(),
+  DCHECK_EQ(heap_->concurrent_marking()->garbage_collector(),
             GarbageCollector::MARK_COMPACTOR);
   if (v8_flags.parallel_marking || v8_flags.concurrent_marking) {
-    heap()->concurrent_marking()->Join();
-    heap()->concurrent_marking()->FlushMemoryChunkData(
-        non_atomic_marking_state());
-    heap()->concurrent_marking()->FlushNativeContexts(&native_context_stats_);
+    heap_->concurrent_marking()->Join();
+    heap_->concurrent_marking()->FlushMemoryChunkData();
+    heap_->concurrent_marking()->FlushNativeContexts(&native_context_stats_);
   }
-  if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap())) {
+  if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap_)) {
     cpp_heap->FinishConcurrentMarkingIfNeeded();
   }
 }
 
 void MarkCompactCollector::VerifyMarking() {
-  CHECK(local_marking_worklists()->IsEmpty());
+  CHECK(local_marking_worklists_->IsEmpty());
   DCHECK(heap_->incremental_marking()->IsStopped());
 #ifdef VERIFY_HEAP
   if (v8_flags.verify_heap) {
-    FullMarkingVerifier verifier(heap());
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_VERIFY);
+    FullMarkingVerifier verifier(heap_);
     verifier.Run();
-    heap()->old_space()->VerifyLiveBytes();
-    heap()->code_space()->VerifyLiveBytes();
-    if (heap()->shared_space()) heap()->shared_space()->VerifyLiveBytes();
-    if (v8_flags.minor_mc && heap()->paged_new_space())
-      heap()->paged_new_space()->paged_space()->VerifyLiveBytes();
+    heap_->old_space()->VerifyLiveBytes();
+    heap_->code_space()->VerifyLiveBytes();
+    if (heap_->shared_space()) heap_->shared_space()->VerifyLiveBytes();
+    if (v8_flags.minor_ms && heap_->paged_new_space())
+      heap_->paged_new_space()->paged_space()->VerifyLiveBytes();
   }
 #endif  // VERIFY_HEAP
 }
@@ -903,8 +730,8 @@ void ShrinkPagesToObjectSizes(Heap* heap, OldLargeObjectSpace* space) {
   PtrComprCageBase cage_base(heap->isolate());
   for (auto it = space->begin(); it != space->end();) {
     LargePage* current = *(it++);
-    HeapObject object = current->GetObject();
-    const size_t object_size = static_cast<size_t>(object.Size(cage_base));
+    Tagged<HeapObject> object = current->GetObject();
+    const size_t object_size = static_cast<size_t>(object->Size(cage_base));
     space->ShrinkPageToObjectSize(current, object, object_size);
     surviving_object_size += object_size;
   }
@@ -915,56 +742,60 @@ void ShrinkPagesToObjectSizes(Heap* heap, OldLargeObjectSpace* space) {
 
 void MarkCompactCollector::Finish() {
   {
-    TRACE_GC_EPOCH(heap()->tracer(), GCTracer::Scope::MC_SWEEP,
-                   ThreadKind::kMain);
+    TRACE_GC_EPOCH_WITH_FLOW(
+        heap_->tracer(), GCTracer::Scope::MC_SWEEP, ThreadKind::kMain,
+        sweeper_->GetTraceIdForFlowEvent(GCTracer::Scope::MC_SWEEP),
+        TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
 
-    DCHECK_IMPLIES(!v8_flags.minor_mc,
+    DCHECK_IMPLIES(!v8_flags.minor_ms,
                    empty_new_space_pages_to_be_swept_.empty());
     if (!empty_new_space_pages_to_be_swept_.empty()) {
       GCTracer::Scope sweep_scope(
-          heap()->tracer(), GCTracer::Scope::MC_SWEEP_NEW, ThreadKind::kMain);
+          heap_->tracer(), GCTracer::Scope::MC_SWEEP_NEW, ThreadKind::kMain);
       for (Page* p : empty_new_space_pages_to_be_swept_) {
-        sweeper()->SweepEmptyNewSpacePage(p);
+        // Sweeping empty pages already relinks them to the freelist.
+        sweeper_->SweepEmptyNewSpacePage(p);
       }
       empty_new_space_pages_to_be_swept_.clear();
     }
 
-    if (heap()->new_lo_space()) {
-      TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_SWEEP_NEW_LO);
-      SweepLargeSpace(heap()->new_lo_space());
+    if (heap_->new_lo_space()) {
+      TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_SWEEP_NEW_LO);
+      SweepLargeSpace(heap_->new_lo_space());
     }
 
 #ifdef DEBUG
-    heap()->VerifyCountersBeforeConcurrentSweeping(garbage_collector_);
+    heap_->VerifyCountersBeforeConcurrentSweeping(
+        GarbageCollector::MARK_COMPACTOR);
 #endif  // DEBUG
   }
 
-  if (heap()->new_space()) {
-    if (v8_flags.minor_mc) {
+  if (heap_->new_space()) {
+    if (v8_flags.minor_ms) {
       switch (resize_new_space_) {
         case ResizeNewSpaceMode::kShrink:
-          heap()->ReduceNewSpaceSize();
+          heap_->ReduceNewSpaceSize();
           break;
         case ResizeNewSpaceMode::kGrow:
-          heap()->ExpandNewSpaceSize();
+          heap_->ExpandNewSpaceSize();
           break;
         case ResizeNewSpaceMode::kNone:
           break;
       }
       resize_new_space_ = ResizeNewSpaceMode::kNone;
     }
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_EVACUATE);
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_EVACUATE_REBALANCE);
-    if (!heap()->new_space()->EnsureCurrentCapacity()) {
-      heap()->FatalProcessOutOfMemory("NewSpace::EnsureCurrentCapacity");
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_EVACUATE);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_EVACUATE_REBALANCE);
+    if (!heap_->new_space()->EnsureCurrentCapacity()) {
+      heap_->FatalProcessOutOfMemory("NewSpace::EnsureCurrentCapacity");
     }
   }
 
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_FINISH);
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_FINISH);
 
-  if (heap()->new_space()) heap()->new_space()->GarbageCollectionEpilogue();
+  if (heap_->new_space()) heap_->new_space()->GarbageCollectionEpilogue();
 
-  auto* isolate = heap()->isolate();
+  auto* isolate = heap_->isolate();
   isolate->global_handles()->ClearListOfYoungNodes();
   isolate->traced_handles()->ClearListOfYoungNodes();
 
@@ -981,7 +812,9 @@ void MarkCompactCollector::Finish() {
   local_weak_objects_.reset();
   weak_objects_.next_ephemerons.Clear();
 
-  sweeper()->StartSweeperTasks();
+  if (UseBackgroundThreadsInCycle()) {
+    sweeper_->StartMajorSweeperTasks();
+  }
 
   // Ensure unmapper tasks are stopped such that queued pages aren't freed
   // before this point. We still need all pages to be accessible for the "update
@@ -989,7 +822,7 @@ void MarkCompactCollector::Finish() {
   DCHECK(!heap_->memory_allocator()->unmapper()->IsRunning());
 
   // Shrink pages if possible after processing and filtering slots.
-  ShrinkPagesToObjectSizes(heap(), heap()->lo_space());
+  ShrinkPagesToObjectSizes(heap_, heap_->lo_space());
 
 #ifdef DEBUG
   DCHECK(state_ == SWEEP_SPACES || state_ == RELOCATE_OBJECTS);
@@ -1004,7 +837,6 @@ void MarkCompactCollector::Finish() {
 }
 
 void MarkCompactCollector::SweepArrayBufferExtensions() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_FINISH_SWEEP_ARRAY_BUFFERS);
   DCHECK_IMPLIES(heap_->new_space(), heap_->new_space()->Size() == 0);
   DCHECK_IMPLIES(heap_->new_lo_space(), heap_->new_lo_space()->Size() == 0);
   heap_->array_buffer_sweeper()->RequestSweep(
@@ -1012,6 +844,23 @@ void MarkCompactCollector::SweepArrayBufferExtensions() {
       ArrayBufferSweeper::TreatAllYoungAsPromoted::kYes);
 }
 
+void MarkCompactCollector::MarkRootObject(Root root, Tagged<HeapObject> obj) {
+  DCHECK(ReadOnlyHeap::Contains(obj) || heap_->Contains(obj));
+  if (marking_state_->TryMark(obj)) {
+    local_marking_worklists_->Push(obj);
+    if (V8_UNLIKELY(v8_flags.track_retaining_path)) {
+      heap_->AddRetainingRoot(root, obj);
+    }
+  }
+}
+
+bool MarkCompactCollector::ShouldMarkObject(Tagged<HeapObject> object) const {
+  if (object.InReadOnlySpace()) return false;
+  if (V8_LIKELY(!uses_shared_heap_)) return true;
+  if (is_shared_space_isolate_) return true;
+  return !object.InAnySharedSpace();
+}
+
 class MarkCompactCollector::RootMarkingVisitor final : public RootVisitor {
  public:
   explicit RootMarkingVisitor(MarkCompactCollector* collector)
@@ -1033,17 +882,17 @@ class MarkCompactCollector::RootMarkingVisitor final : public RootVisitor {
   // Keep this synced with RootsReferencesExtractor::VisitRunningCode.
   void VisitRunningCode(FullObjectSlot code_slot,
                         FullObjectSlot istream_or_smi_zero_slot) final {
-    Object istream_or_smi_zero = *istream_or_smi_zero_slot;
+    Tagged<Object> istream_or_smi_zero = *istream_or_smi_zero_slot;
     DCHECK(istream_or_smi_zero == Smi::zero() ||
-           istream_or_smi_zero.IsInstructionStream());
-    Code code = Code::cast(*code_slot);
-    DCHECK_EQ(code.raw_instruction_stream(
-                  PtrComprCageBase{collector_->isolate()->code_cage_base()}),
+           IsInstructionStream(istream_or_smi_zero));
+    Tagged<Code> code = Code::cast(*code_slot);
+    DCHECK_EQ(code->raw_instruction_stream(PtrComprCageBase{
+                  collector_->heap_->isolate()->code_cage_base()}),
               istream_or_smi_zero);
 
     // We must not remove deoptimization literals which may be needed in
     // order to successfully deoptimize.
-    code.IterateDeoptimizationLiterals(this);
+    code->IterateDeoptimizationLiterals(this);
 
     if (istream_or_smi_zero != Smi::zero()) {
       VisitRootPointer(Root::kStackRoots, nullptr, istream_or_smi_zero_slot);
@@ -1054,9 +903,9 @@ class MarkCompactCollector::RootMarkingVisitor final : public RootVisitor {
 
  private:
   V8_INLINE void MarkObjectByPointer(Root root, FullObjectSlot p) {
-    Object object = *p;
-    if (!object.IsHeapObject()) return;
-    HeapObject heap_object = HeapObject::cast(object);
+    Tagged<Object> object = *p;
+    if (!IsHeapObject(object)) return;
+    Tagged<HeapObject> heap_object = HeapObject::cast(object);
     if (!collector_->ShouldMarkObject(heap_object)) return;
     collector_->MarkRootObject(root, heap_object);
   }
@@ -1080,50 +929,54 @@ class MarkCompactCollector::CustomRootBodyMarkingVisitor final
     : public ObjectVisitorWithCageBases {
  public:
   explicit CustomRootBodyMarkingVisitor(MarkCompactCollector* collector)
-      : ObjectVisitorWithCageBases(collector->isolate()),
+      : ObjectVisitorWithCageBases(collector->heap_->isolate()),
         collector_(collector) {}
 
-  void VisitPointer(HeapObject host, ObjectSlot p) final {
+  void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) final {
     MarkObject(host, p.load(cage_base()));
   }
 
-  void VisitMapPointer(HeapObject host) final {
-    MarkObject(host, host.map(cage_base()));
+  void VisitMapPointer(Tagged<HeapObject> host) final {
+    MarkObject(host, host->map(cage_base()));
   }
 
-  void VisitPointers(HeapObject host, ObjectSlot start, ObjectSlot end) final {
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                     ObjectSlot end) final {
     for (ObjectSlot p = start; p < end; ++p) {
       // The map slot should be handled in VisitMapPointer.
-      DCHECK_NE(host.map_slot(), p);
+      DCHECK_NE(host->map_slot(), p);
       DCHECK(!HasWeakHeapObjectTag(p.load(cage_base())));
       MarkObject(host, p.load(cage_base()));
     }
   }
 
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
     MarkObject(host, slot.load(code_cage_base()));
   }
 
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) final {
     // At the moment, custom roots cannot contain weak pointers.
     UNREACHABLE();
   }
 
-  void VisitCodeTarget(RelocInfo* rinfo) override {
-    InstructionStream target =
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
+    Tagged<InstructionStream> target =
         InstructionStream::FromTargetAddress(rinfo->target_address());
-    MarkObject(rinfo->instruction_stream(), target);
+    MarkObject(host, target);
   }
 
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override {
-    MarkObject(rinfo->instruction_stream(), rinfo->target_object(cage_base()));
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
+    MarkObject(host, rinfo->target_object(cage_base()));
   }
 
  private:
-  V8_INLINE void MarkObject(HeapObject host, Object object) {
-    if (!object.IsHeapObject()) return;
-    HeapObject heap_object = HeapObject::cast(object);
+  V8_INLINE void MarkObject(Tagged<HeapObject> host, Tagged<Object> object) {
+    if (!IsHeapObject(object)) return;
+    Tagged<HeapObject> heap_object = HeapObject::cast(object);
     if (!collector_->ShouldMarkObject(heap_object)) return;
     collector_->MarkObject(host, heap_object);
   }
@@ -1131,115 +984,68 @@ class MarkCompactCollector::CustomRootBodyMarkingVisitor final
   MarkCompactCollector* const collector_;
 };
 
-class MarkCompactCollector::ClientCustomRootBodyMarkingVisitor final
-    : public ObjectVisitorWithCageBases {
- public:
-  explicit ClientCustomRootBodyMarkingVisitor(MarkCompactCollector* collector)
-      : ObjectVisitorWithCageBases(collector->isolate()),
-        collector_(collector) {}
-
-  void VisitPointer(HeapObject host, ObjectSlot p) final {
-    MarkObject(host, p.load(cage_base()));
-  }
-
-  void VisitMapPointer(HeapObject host) final {
-    MarkObject(host, host.map(cage_base()));
-  }
-
-  void VisitPointers(HeapObject host, ObjectSlot start, ObjectSlot end) final {
-    for (ObjectSlot p = start; p < end; ++p) {
-      // The map slot should be handled in VisitMapPointer.
-      DCHECK_NE(host.map_slot(), p);
-      DCHECK(!HasWeakHeapObjectTag(p.load(cage_base())));
-      MarkObject(host, p.load(cage_base()));
-    }
-  }
-
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
-    MarkObject(host, slot.load(code_cage_base()));
-  }
-
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
-                     MaybeObjectSlot end) final {
-    // At the moment, custom roots cannot contain weak pointers.
-    UNREACHABLE();
-  }
-
-  void VisitCodeTarget(RelocInfo* rinfo) override {
-    InstructionStream target =
-        InstructionStream::FromTargetAddress(rinfo->target_address());
-    MarkObject(rinfo->instruction_stream(), target);
-  }
-
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override {
-    MarkObject(rinfo->instruction_stream(), rinfo->target_object(cage_base()));
-  }
-
- private:
-  V8_INLINE void MarkObject(HeapObject host, Object object) {
-    if (!object.IsHeapObject()) return;
-    HeapObject heap_object = HeapObject::cast(object);
-    if (!heap_object.InWritableSharedSpace()) return;
-    collector_->MarkObject(host, heap_object);
-  }
-
-  MarkCompactCollector* const collector_;
-};
-
 class MarkCompactCollector::SharedHeapObjectVisitor final
     : public ObjectVisitorWithCageBases {
  public:
   explicit SharedHeapObjectVisitor(MarkCompactCollector* collector)
-      : ObjectVisitorWithCageBases(collector->isolate()),
+      : ObjectVisitorWithCageBases(collector->heap_->isolate()),
         collector_(collector) {}
 
-  void VisitPointer(HeapObject host, ObjectSlot p) final {
+  void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) final {
     CheckForSharedObject(host, p, p.load(cage_base()));
   }
 
-  void VisitPointer(HeapObject host, MaybeObjectSlot p) final {
+  void VisitPointer(Tagged<HeapObject> host, MaybeObjectSlot p) final {
     MaybeObject object = p.load(cage_base());
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
     if (object.GetHeapObject(&heap_object))
       CheckForSharedObject(host, ObjectSlot(p), heap_object);
   }
 
-  void VisitMapPointer(HeapObject host) final {
-    CheckForSharedObject(host, host.map_slot(), host.map(cage_base()));
+  void VisitMapPointer(Tagged<HeapObject> host) final {
+    CheckForSharedObject(host, host->map_slot(), host->map(cage_base()));
   }
 
-  void VisitPointers(HeapObject host, ObjectSlot start, ObjectSlot end) final {
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                     ObjectSlot end) final {
     for (ObjectSlot p = start; p < end; ++p) {
       // The map slot should be handled in VisitMapPointer.
-      DCHECK_NE(host.map_slot(), p);
+      DCHECK_NE(host->map_slot(), p);
       DCHECK(!HasWeakHeapObjectTag(p.load(cage_base())));
       CheckForSharedObject(host, p, p.load(cage_base()));
     }
   }
 
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
     UNREACHABLE();
   }
 
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) final {
     for (MaybeObjectSlot p = start; p < end; ++p) {
       // The map slot should be handled in VisitMapPointer.
-      DCHECK_NE(host.map_slot(), ObjectSlot(p));
+      DCHECK_NE(host->map_slot(), ObjectSlot(p));
       VisitPointer(host, p);
     }
   }
 
-  void VisitCodeTarget(RelocInfo* rinfo) override { UNREACHABLE(); }
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
+    UNREACHABLE();
+  }
 
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override { UNREACHABLE(); }
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
+    UNREACHABLE();
+  }
 
  private:
-  V8_INLINE void CheckForSharedObject(HeapObject host, ObjectSlot slot,
-                                      Object object) {
+  V8_INLINE void CheckForSharedObject(Tagged<HeapObject> host, ObjectSlot slot,
+                                      Tagged<Object> object) {
     DCHECK(!host.InAnySharedSpace());
-    if (!object.IsHeapObject()) return;
-    HeapObject heap_object = HeapObject::cast(object);
+    if (!IsHeapObject(object)) return;
+    Tagged<HeapObject> heap_object = HeapObject::cast(object);
     if (!heap_object.InWritableSharedSpace()) return;
     DCHECK(heap_object.InWritableSharedSpace());
     MemoryChunk* host_chunk = MemoryChunk::FromHeapObject(host);
@@ -1267,11 +1073,11 @@ class InternalizedStringTableCleaner final : public RootVisitor {
     DCHECK_EQ(root, Root::kStringTable);
     // Visit all HeapObject pointers in [start, end).
     auto* marking_state = heap_->marking_state();
-    Isolate* isolate = heap_->isolate();
+    Isolate* const isolate = heap_->isolate();
     for (OffHeapObjectSlot p = start; p < end; ++p) {
-      Object o = p.load(isolate);
-      if (o.IsHeapObject()) {
-        HeapObject heap_object = HeapObject::cast(o);
+      Tagged<Object> o = p.load(isolate);
+      if (IsHeapObject(o)) {
+        Tagged<HeapObject> heap_object = HeapObject::cast(o);
         DCHECK(!Heap::InYoungGeneration(heap_object));
         if (!heap_object.InReadOnlySpace() &&
             marking_state->IsUnmarked(heap_object)) {
@@ -1290,65 +1096,26 @@ class InternalizedStringTableCleaner final : public RootVisitor {
   int pointers_removed_ = 0;
 };
 
-enum class ExternalStringTableCleaningMode { kAll, kYoungOnly };
-
-template <ExternalStringTableCleaningMode mode>
-class ExternalStringTableCleaner : public RootVisitor {
- public:
-  explicit ExternalStringTableCleaner(Heap* heap) : heap_(heap) {}
-
-  void VisitRootPointers(Root root, const char* description,
-                         FullObjectSlot start, FullObjectSlot end) override {
-    // Visit all HeapObject pointers in [start, end).
-    DCHECK_EQ(static_cast<int>(root),
-              static_cast<int>(Root::kExternalStringsTable));
-    NonAtomicMarkingState* marking_state = heap_->non_atomic_marking_state();
-    Object the_hole = ReadOnlyRoots(heap_).the_hole_value();
-    for (FullObjectSlot p = start; p < end; ++p) {
-      Object o = *p;
-      if (!o.IsHeapObject()) continue;
-      HeapObject heap_object = HeapObject::cast(o);
-      // MinorMC doesn't update the young strings set and so it may contain
-      // strings that are already in old space.
-      if (!marking_state->IsUnmarked(heap_object)) continue;
-      if ((mode == ExternalStringTableCleaningMode::kYoungOnly) &&
-          !Heap::InYoungGeneration(heap_object))
-        continue;
-      if (o.IsExternalString()) {
-        heap_->FinalizeExternalString(String::cast(o));
-      } else {
-        // The original external string may have been internalized.
-        DCHECK(o.IsThinString());
-      }
-      // Set the entry to the_hole_value (as deleted).
-      p.store(the_hole);
-    }
-  }
-
- private:
-  Heap* heap_;
-};
-
 #ifdef V8_ENABLE_SANDBOX
 class MarkExternalPointerFromExternalStringTable : public RootVisitor {
  public:
   explicit MarkExternalPointerFromExternalStringTable(
-      ExternalPointerTable* shared_table)
-      : visitor(shared_table) {}
+      ExternalPointerTable* shared_table, ExternalPointerTable::Space* space)
+      : visitor(shared_table, space) {}
 
   void VisitRootPointers(Root root, const char* description,
                          FullObjectSlot start, FullObjectSlot end) override {
     // Visit all HeapObject pointers in [start, end).
     for (FullObjectSlot p = start; p < end; ++p) {
-      Object o = *p;
-      if (o.IsHeapObject()) {
-        HeapObject heap_object = HeapObject::cast(o);
-        if (heap_object.IsExternalString()) {
-          ExternalString string = ExternalString::cast(heap_object);
-          string.VisitExternalPointers(&visitor);
+      Tagged<Object> o = *p;
+      if (IsHeapObject(o)) {
+        Tagged<HeapObject> heap_object = HeapObject::cast(o);
+        if (IsExternalString(heap_object)) {
+          Tagged<ExternalString> string = ExternalString::cast(heap_object);
+          string->VisitExternalPointers(&visitor);
         } else {
           // The original external string may have been internalized.
-          DCHECK(o.IsThinString());
+          DCHECK(IsThinString(o));
         }
       }
     }
@@ -1357,31 +1124,40 @@ class MarkExternalPointerFromExternalStringTable : public RootVisitor {
  private:
   class MarkExternalPointerTableVisitor : public ObjectVisitor {
    public:
-    explicit MarkExternalPointerTableVisitor(ExternalPointerTable* table)
-        : table_(table) {}
-    void VisitExternalPointer(HeapObject host, ExternalPointerSlot slot,
+    explicit MarkExternalPointerTableVisitor(ExternalPointerTable* table,
+                                             ExternalPointerTable::Space* space)
+        : table_(table), space_(space) {}
+    void VisitExternalPointer(Tagged<HeapObject> host, ExternalPointerSlot slot,
                               ExternalPointerTag tag) override {
       DCHECK_NE(tag, kExternalPointerNullTag);
       DCHECK(IsSharedExternalPointerType(tag));
       ExternalPointerHandle handle = slot.Relaxed_LoadHandle();
-      table_->Mark(handle, slot.address());
+      table_->Mark(space_, handle, slot.address());
     }
-    void VisitPointers(HeapObject host, ObjectSlot start,
+    void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                        ObjectSlot end) override {
       UNREACHABLE();
     }
-    void VisitPointers(HeapObject host, MaybeObjectSlot start,
+    void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                        MaybeObjectSlot end) override {
       UNREACHABLE();
     }
-    void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+    void VisitInstructionStreamPointer(Tagged<Code> host,
+                                       InstructionStreamSlot slot) override {
+      UNREACHABLE();
+    }
+    void VisitCodeTarget(Tagged<InstructionStream> host,
+                         RelocInfo* rinfo) override {
+      UNREACHABLE();
+    }
+    void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                              RelocInfo* rinfo) override {
       UNREACHABLE();
     }
-    void VisitCodeTarget(RelocInfo* rinfo) override { UNREACHABLE(); }
-    void VisitEmbeddedPointer(RelocInfo* rinfo) override { UNREACHABLE(); }
 
    private:
     ExternalPointerTable* table_;
+    ExternalPointerTable::Space* space_;
   };
 
   MarkExternalPointerTableVisitor visitor;
@@ -1395,29 +1171,28 @@ class MarkCompactWeakObjectRetainer : public WeakObjectRetainer {
   explicit MarkCompactWeakObjectRetainer(MarkingState* marking_state)
       : marking_state_(marking_state) {}
 
-  Object RetainAs(Object object) override {
-    HeapObject heap_object = HeapObject::cast(object);
-    DCHECK(!marking_state_->IsGrey(heap_object));
+  Tagged<Object> RetainAs(Tagged<Object> object) override {
+    Tagged<HeapObject> heap_object = Tagged<HeapObject>::cast(object);
     if (marking_state_->IsMarked(heap_object)) {
       return object;
-    } else if (object.IsAllocationSite() &&
-               !(AllocationSite::cast(object).IsZombie())) {
+    } else if (IsAllocationSite(object) &&
+               !AllocationSite::cast(object)->IsZombie()) {
       // "dead" AllocationSites need to live long enough for a traversal of new
       // space. These sites get a one-time reprieve.
 
-      Object nested = object;
-      while (nested.IsAllocationSite()) {
-        AllocationSite current_site = AllocationSite::cast(nested);
+      Tagged<Object> nested = object;
+      while (IsAllocationSite(nested)) {
+        Tagged<AllocationSite> current_site = AllocationSite::cast(nested);
         // MarkZombie will override the nested_site, read it first before
         // marking
-        nested = current_site.nested_site();
-        current_site.MarkZombie();
+        nested = current_site->nested_site();
+        current_site->MarkZombie();
         marking_state_->TryMarkAndAccountLiveBytes(current_site);
       }
 
       return object;
     } else {
-      return Object();
+      return Smi::zero();
     }
   }
 
@@ -1428,27 +1203,27 @@ class MarkCompactWeakObjectRetainer : public WeakObjectRetainer {
 class RecordMigratedSlotVisitor : public ObjectVisitorWithCageBases {
  public:
   explicit RecordMigratedSlotVisitor(
-      Heap* heap, EphemeronRememberedSet* ephemeron_remembered_set)
+      Heap* heap, EphemeronRememberedSet::TableMap* ephemeron_remembered_set)
       : ObjectVisitorWithCageBases(heap->isolate()),
         heap_(heap),
         ephemeron_remembered_set_(ephemeron_remembered_set) {}
 
-  inline void VisitPointer(HeapObject host, ObjectSlot p) final {
+  inline void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) final {
     DCHECK(!HasWeakHeapObjectTag(p.load(cage_base())));
     RecordMigratedSlot(host, MaybeObject::FromObject(p.load(cage_base())),
                        p.address());
   }
 
-  inline void VisitMapPointer(HeapObject host) final {
-    VisitPointer(host, host.map_slot());
+  inline void VisitMapPointer(Tagged<HeapObject> host) final {
+    VisitPointer(host, host->map_slot());
   }
 
-  inline void VisitPointer(HeapObject host, MaybeObjectSlot p) final {
+  inline void VisitPointer(Tagged<HeapObject> host, MaybeObjectSlot p) final {
     DCHECK(!MapWord::IsPacked(p.Relaxed_Load(cage_base()).ptr()));
     RecordMigratedSlot(host, p.load(cage_base()), p.address());
   }
 
-  inline void VisitPointers(HeapObject host, ObjectSlot start,
+  inline void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                             ObjectSlot end) final {
     while (start < end) {
       VisitPointer(host, start);
@@ -1456,7 +1231,7 @@ class RecordMigratedSlotVisitor : public ObjectVisitorWithCageBases {
     }
   }
 
-  inline void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  inline void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                             MaybeObjectSlot end) final {
     while (start < end) {
       VisitPointer(host, start);
@@ -1464,27 +1239,20 @@ class RecordMigratedSlotVisitor : public ObjectVisitorWithCageBases {
     }
   }
 
-  inline void VisitCodePointer(Code host, CodeObjectSlot slot) final {
+  inline void VisitInstructionStreamPointer(Tagged<Code> host,
+                                            InstructionStreamSlot slot) final {
     // This code is similar to the implementation of VisitPointer() modulo
     // new kind of slot.
     DCHECK(!HasWeakHeapObjectTag(slot.load(code_cage_base())));
-    Object code = slot.load(code_cage_base());
+    Tagged<Object> code = slot.load(code_cage_base());
     RecordMigratedSlot(host, MaybeObject::FromObject(code), slot.address());
   }
 
-  inline void VisitEphemeron(HeapObject host, int index, ObjectSlot key,
+  inline void VisitEphemeron(Tagged<HeapObject> host, int index, ObjectSlot key,
                              ObjectSlot value) override {
-    DCHECK(host.IsEphemeronHashTable());
+    DCHECK(IsEphemeronHashTable(host));
     DCHECK(!Heap::InYoungGeneration(host));
 
-    if (v8_flags.minor_mc) {
-      // Minor MC lacks support for specialized generational ephemeron barriers.
-      // The regular write barrier works as well but keeps more memory alive.
-      // TODO(v8:12612): Add support to MinorMC.
-      ObjectVisitorWithCageBases::VisitEphemeron(host, index, key, value);
-      return;
-    }
-
     VisitPointer(host, value);
 
     if (ephemeron_remembered_set_ && Heap::InYoungGeneration(*key)) {
@@ -1497,41 +1265,63 @@ class RecordMigratedSlotVisitor : public ObjectVisitorWithCageBases {
     }
   }
 
-  inline void VisitCodeTarget(RelocInfo* rinfo) override {
+  inline void VisitCodeTarget(Tagged<InstructionStream> host,
+                              RelocInfo* rinfo) override {
     DCHECK(RelocInfo::IsCodeTargetMode(rinfo->rmode()));
-    InstructionStream target =
+    Tagged<InstructionStream> target =
         InstructionStream::FromTargetAddress(rinfo->target_address());
     // The target is always in old space, we don't have to record the slot in
     // the old-to-new remembered set.
     DCHECK(!Heap::InYoungGeneration(target));
     DCHECK(!target.InWritableSharedSpace());
-    heap_->mark_compact_collector()->RecordRelocSlot(rinfo, target);
+    heap_->mark_compact_collector()->RecordRelocSlot(host, rinfo, target);
   }
 
-  inline void VisitEmbeddedPointer(RelocInfo* rinfo) override {
+  inline void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                                   RelocInfo* rinfo) override {
     DCHECK(RelocInfo::IsEmbeddedObjectMode(rinfo->rmode()));
-    HeapObject object = rinfo->target_object(cage_base());
-    GenerationalBarrierForCode(rinfo, object);
-    WriteBarrier::Shared(rinfo->instruction_stream(), rinfo, object);
-    heap_->mark_compact_collector()->RecordRelocSlot(rinfo, object);
+    Tagged<HeapObject> object = rinfo->target_object(cage_base());
+    GenerationalBarrierForCode(host, rinfo, object);
+    WriteBarrier::Shared(host, rinfo, object);
+    heap_->mark_compact_collector()->RecordRelocSlot(host, rinfo, object);
   }
 
   // Entries that are skipped for recording.
-  inline void VisitExternalReference(RelocInfo* rinfo) final {}
-  inline void VisitInternalReference(RelocInfo* rinfo) final {}
-  inline void VisitExternalPointer(HeapObject host, ExternalPointerSlot slot,
+  inline void VisitExternalReference(Tagged<InstructionStream> host,
+                                     RelocInfo* rinfo) final {}
+  inline void VisitInternalReference(Tagged<InstructionStream> host,
+                                     RelocInfo* rinfo) final {}
+  inline void VisitExternalPointer(Tagged<HeapObject> host,
+                                   ExternalPointerSlot slot,
                                    ExternalPointerTag tag) final {}
 
+  inline void VisitIndirectPointer(Tagged<HeapObject> host,
+                                   IndirectPointerSlot slot,
+                                   IndirectPointerMode mode) final {}
+
+  inline void VisitIndirectPointerTableEntry(Tagged<HeapObject> host,
+                                             IndirectPointerSlot slot) final {
+#ifdef V8_CODE_POINTER_SANDBOXING
+    // When an object owning an indirect pointer table entry is relocated, it
+    // needs to update the entry to point to its new location. Currently, only
+    // Code objects are referenced through indirect pointers, and they use the
+    // code pointer table.
+    DCHECK(IsCode(host));
+    static_assert(kAllIndirectPointerObjectsAreCode);
+    IndirectPointerHandle handle = slot.Relaxed_LoadHandle();
+    GetProcessWideCodePointerTable()->SetCodeObject(handle, host.ptr());
+#else
+    UNREACHABLE();
+#endif
+  }
+
  protected:
-  inline void RecordMigratedSlot(HeapObject host, MaybeObject value,
+  inline void RecordMigratedSlot(Tagged<HeapObject> host, MaybeObject value,
                                  Address slot) {
     if (value->IsStrongOrWeak()) {
       BasicMemoryChunk* p = BasicMemoryChunk::FromAddress(value.ptr());
       if (p->InYoungGeneration()) {
-        DCHECK_IMPLIES(p->IsToPage(),
-                       v8_flags.minor_mc ||
-                           p->IsFlagSet(Page::PAGE_NEW_NEW_PROMOTION) ||
-                           p->IsLargePage());
+        DCHECK_IMPLIES(p->IsToPage(), v8_flags.minor_ms || p->IsLargePage());
 
         MemoryChunk* chunk = MemoryChunk::FromHeapObject(host);
         DCHECK(chunk->SweepingDone());
@@ -1552,7 +1342,7 @@ class RecordMigratedSlotVisitor : public ObjectVisitorWithCageBases {
   }
 
   Heap* const heap_;
-  EphemeronRememberedSet* ephemeron_remembered_set_;
+  EphemeronRememberedSet::TableMap* ephemeron_remembered_set_;
 };
 
 class MigrationObserver {
@@ -1560,8 +1350,8 @@ class MigrationObserver {
   explicit MigrationObserver(Heap* heap) : heap_(heap) {}
 
   virtual ~MigrationObserver() = default;
-  virtual void Move(AllocationSpace dest, HeapObject src, HeapObject dst,
-                    int size) = 0;
+  virtual void Move(AllocationSpace dest, Tagged<HeapObject> src,
+                    Tagged<HeapObject> dst, int size) = 0;
 
  protected:
   Heap* heap_;
@@ -1571,15 +1361,15 @@ class ProfilingMigrationObserver final : public MigrationObserver {
  public:
   explicit ProfilingMigrationObserver(Heap* heap) : MigrationObserver(heap) {}
 
-  inline void Move(AllocationSpace dest, HeapObject src, HeapObject dst,
-                   int size) final {
+  inline void Move(AllocationSpace dest, Tagged<HeapObject> src,
+                   Tagged<HeapObject> dst, int size) final {
     // Note this method is called in a concurrent setting. The current object
     // (src and dst) is somewhat safe to access without precautions, but other
     // objects may be subject to concurrent modification.
     if (dest == CODE_SPACE) {
       PROFILE(heap_->isolate(), CodeMoveEvent(InstructionStream::cast(src),
                                               InstructionStream::cast(dst)));
-    } else if (dest == OLD_SPACE && dst.IsBytecodeArray()) {
+    } else if (dest == OLD_SPACE && IsBytecodeArray(dst)) {
       PROFILE(heap_->isolate(), BytecodeMoveEvent(BytecodeArray::cast(src),
                                                   BytecodeArray::cast(dst)));
     }
@@ -1590,7 +1380,7 @@ class ProfilingMigrationObserver final : public MigrationObserver {
 class HeapObjectVisitor {
  public:
   virtual ~HeapObjectVisitor() = default;
-  virtual bool Visit(HeapObject object, int size) = 0;
+  virtual bool Visit(Tagged<HeapObject> object, int size) = 0;
 };
 
 class EvacuateVisitorBase : public HeapObjectVisitor {
@@ -1635,53 +1425,68 @@ class EvacuateVisitorBase : public HeapObjectVisitor {
 #endif  // V8_COMPRESS_POINTERS
   }
 
-  using MigrateFunction = void (*)(EvacuateVisitorBase* base, HeapObject dst,
-                                   HeapObject src, int size,
+  using MigrateFunction = void (*)(EvacuateVisitorBase* base,
+                                   Tagged<HeapObject> dst,
+                                   Tagged<HeapObject> src, int size,
                                    AllocationSpace dest);
 
   template <MigrationMode mode>
-  static void RawMigrateObject(EvacuateVisitorBase* base, HeapObject dst,
-                               HeapObject src, int size, AllocationSpace dest) {
+  static void RawMigrateObject(EvacuateVisitorBase* base,
+                               Tagged<HeapObject> dst, Tagged<HeapObject> src,
+                               int size, AllocationSpace dest) {
     Address dst_addr = dst.address();
     Address src_addr = src.address();
     PtrComprCageBase cage_base = base->cage_base();
-    DCHECK(base->heap_->AllowedToBeMigrated(src.map(cage_base), src, dest));
+    DCHECK(base->heap_->AllowedToBeMigrated(src->map(cage_base), src, dest));
     DCHECK_NE(dest, LO_SPACE);
     DCHECK_NE(dest, CODE_LO_SPACE);
     if (dest == OLD_SPACE) {
       DCHECK_OBJECT_SIZE(size);
       DCHECK(IsAligned(size, kTaggedSize));
       base->heap_->CopyBlock(dst_addr, src_addr, size);
-      if (mode != MigrationMode::kFast)
+      if (mode != MigrationMode::kFast) {
         base->ExecuteMigrationObservers(dest, src, dst, size);
+      }
       // In case the object's map gets relocated during GC we load the old map
       // here. This is fine since they store the same content.
-      dst.IterateFast(dst.map(cage_base), size, base->record_visitor_);
+      dst->IterateFast(dst->map(cage_base), size, base->record_visitor_);
     } else if (dest == SHARED_SPACE) {
       DCHECK_OBJECT_SIZE(size);
       DCHECK(IsAligned(size, kTaggedSize));
       base->heap_->CopyBlock(dst_addr, src_addr, size);
-      if (mode != MigrationMode::kFast)
+      if (mode != MigrationMode::kFast) {
         base->ExecuteMigrationObservers(dest, src, dst, size);
-      dst.IterateFast(dst.map(cage_base), size, base->record_visitor_);
+      }
+      dst->IterateFast(dst->map(cage_base), size, base->record_visitor_);
     } else if (dest == CODE_SPACE) {
-      DCHECK_CODEOBJECT_SIZE(size, base->heap_->code_space());
-      base->heap_->CopyBlock(dst_addr, src_addr, size);
-      InstructionStream istream = InstructionStream::cast(dst);
-      istream.Relocate(dst_addr - src_addr);
-      if (mode != MigrationMode::kFast)
+      DCHECK_CODEOBJECT_SIZE(size);
+      {
+        ThreadIsolation::WritableJitAllocation writable_allocation =
+            ThreadIsolation::RegisterInstructionStreamAllocation(dst_addr,
+                                                                 size);
+        base->heap_->CopyBlock(dst_addr, src_addr, size);
+        Tagged<InstructionStream> istream = InstructionStream::cast(dst);
+        istream->Relocate(dst_addr - src_addr);
+      }
+      if (mode != MigrationMode::kFast) {
         base->ExecuteMigrationObservers(dest, src, dst, size);
+      }
       // In case the object's map gets relocated during GC we load the old map
       // here. This is fine since they store the same content.
-      dst.IterateFast(dst.map(cage_base), size, base->record_visitor_);
+      dst->IterateFast(dst->map(cage_base), size, base->record_visitor_);
     } else {
       DCHECK_OBJECT_SIZE(size);
       DCHECK(dest == NEW_SPACE);
       base->heap_->CopyBlock(dst_addr, src_addr, size);
-      if (mode != MigrationMode::kFast)
+      if (mode != MigrationMode::kFast) {
         base->ExecuteMigrationObservers(dest, src, dst, size);
+      }
+    }
+    base::Optional<CodePageMemoryModificationScope> memory_modification_scope;
+    if (dest == CODE_SPACE) {
+      memory_modification_scope.emplace(InstructionStream::cast(src));
     }
-    src.set_map_word_forwarded(dst, kRelaxedStore);
+    src->set_map_word_forwarded(dst, kRelaxedStore);
   }
 
   EvacuateVisitorBase(Heap* heap, EvacuationAllocator* local_allocator,
@@ -1699,8 +1504,9 @@ class EvacuateVisitorBase : public HeapObjectVisitor {
 #endif  // DEBUG
   }
 
-  inline bool TryEvacuateObject(AllocationSpace target_space, HeapObject object,
-                                int size, HeapObject* target_object) {
+  inline bool TryEvacuateObject(AllocationSpace target_space,
+                                Tagged<HeapObject> object, int size,
+                                Tagged<HeapObject>* target_object) {
 #if DEBUG
     DCHECK_LE(abort_evacuation_at_address_,
               MemoryChunk::FromHeapObject(object)->area_end());
@@ -1712,7 +1518,7 @@ class EvacuateVisitorBase : public HeapObjectVisitor {
     }
 #endif  // DEBUG
 
-    Map map = object.map(cage_base());
+    Tagged<Map> map = object->map(cage_base());
     AllocationAlignment alignment = HeapObject::RequiredAlignment(map);
     AllocationResult allocation;
     if (target_space == OLD_SPACE && ShouldPromoteIntoSharedHeap(map)) {
@@ -1730,33 +1536,29 @@ class EvacuateVisitorBase : public HeapObjectVisitor {
     }
     if (allocation.To(target_object)) {
       MigrateObject(*target_object, object, size, target_space);
-      if (target_space == CODE_SPACE) {
-        MemoryChunk::FromHeapObject(*target_object)
-            ->GetCodeObjectRegistry()
-            ->RegisterNewlyAllocatedCodeObject((*target_object).address());
-      }
       return true;
     }
     return false;
   }
 
-  inline bool ShouldPromoteIntoSharedHeap(Map map) {
+  inline bool ShouldPromoteIntoSharedHeap(Tagged<Map> map) {
     if (shared_string_table_) {
       return String::IsInPlaceInternalizableExcludingExternal(
-          map.instance_type());
+          map->instance_type());
     }
     return false;
   }
 
-  inline void ExecuteMigrationObservers(AllocationSpace dest, HeapObject src,
-                                        HeapObject dst, int size) {
+  inline void ExecuteMigrationObservers(AllocationSpace dest,
+                                        Tagged<HeapObject> src,
+                                        Tagged<HeapObject> dst, int size) {
     for (MigrationObserver* obs : observers_) {
       obs->Move(dest, src, dst, size);
     }
   }
 
-  inline void MigrateObject(HeapObject dst, HeapObject src, int size,
-                            AllocationSpace dest) {
+  inline void MigrateObject(Tagged<HeapObject> dst, Tagged<HeapObject> src,
+                            int size, AllocationSpace dest) {
     migration_function_(this, dst, src, size, dest);
   }
 
@@ -1789,13 +1591,16 @@ class EvacuateNewSpaceVisitor final : public EvacuateVisitorBase {
         local_pretenuring_feedback_(local_pretenuring_feedback),
         is_incremental_marking_(heap->incremental_marking()->IsMarking()),
         shortcut_strings_(!heap_->IsGCWithStack() ||
-                          v8_flags.shortcut_strings_with_stack) {}
+                          v8_flags.shortcut_strings_with_stack) {
+    DCHECK_IMPLIES(is_incremental_marking_,
+                   heap->incremental_marking()->IsMajorMarking());
+  }
 
-  inline bool Visit(HeapObject object, int size) override {
+  inline bool Visit(Tagged<HeapObject> object, int size) override {
     if (TryEvacuateWithoutCopy(object)) return true;
-    HeapObject target_object;
+    Tagged<HeapObject> target_object;
 
-    pretenuring_handler_->UpdateAllocationSite(object.map(), object,
+    pretenuring_handler_->UpdateAllocationSite(object->map(), object,
                                                local_pretenuring_feedback_);
 
     if (!TryEvacuateObject(OLD_SPACE, object, size, &target_object)) {
@@ -1811,18 +1616,18 @@ class EvacuateNewSpaceVisitor final : public EvacuateVisitorBase {
   intptr_t semispace_copied_size() { return semispace_copied_size_; }
 
  private:
-  inline bool TryEvacuateWithoutCopy(HeapObject object) {
+  inline bool TryEvacuateWithoutCopy(Tagged<HeapObject> object) {
     DCHECK(!is_incremental_marking_);
 
     if (!shortcut_strings_) return false;
 
-    Map map = object.map();
+    Tagged<Map> map = object->map();
 
     // Some objects can be evacuated without creating a copy.
-    if (map.visitor_id() == kVisitThinString) {
-      HeapObject actual = ThinString::cast(object).unchecked_actual();
+    if (map->visitor_id() == kVisitThinString) {
+      Tagged<HeapObject> actual = ThinString::cast(object)->unchecked_actual();
       if (MarkCompactCollector::IsOnEvacuationCandidate(actual)) return false;
-      object.set_map_word_forwarded(actual, kRelaxedStore);
+      object->set_map_word_forwarded(actual, kRelaxedStore);
       return true;
     }
     // TODO(mlippautz): Handle ConsString.
@@ -1830,10 +1635,11 @@ class EvacuateNewSpaceVisitor final : public EvacuateVisitorBase {
     return false;
   }
 
-  inline AllocationSpace AllocateTargetObject(HeapObject old_object, int size,
+  inline AllocationSpace AllocateTargetObject(Tagged<HeapObject> old_object,
+                                              int size,
                                               HeapObject* target_object) {
     AllocationAlignment alignment =
-        HeapObject::RequiredAlignment(old_object.map());
+        HeapObject::RequiredAlignment(old_object->map());
     AllocationSpace space_allocated_in = NEW_SPACE;
     AllocationResult allocation = local_allocator_->Allocate(
         NEW_SPACE, size, AllocationOrigin::kGC, alignment);
@@ -1867,10 +1673,9 @@ class EvacuateNewSpaceVisitor final : public EvacuateVisitorBase {
   const bool shortcut_strings_;
 };
 
-template <PageEvacuationMode mode>
-class EvacuateNewSpacePageVisitor final : public HeapObjectVisitor {
+class EvacuateNewToOldSpacePageVisitor final : public HeapObjectVisitor {
  public:
-  explicit EvacuateNewSpacePageVisitor(
+  explicit EvacuateNewToOldSpacePageVisitor(
       Heap* heap, RecordMigratedSlotVisitor* record_visitor,
       PretenuringHandler::PretenuringFeedbackMap* local_pretenuring_feedback)
       : heap_(heap),
@@ -1880,32 +1685,17 @@ class EvacuateNewSpacePageVisitor final : public HeapObjectVisitor {
         local_pretenuring_feedback_(local_pretenuring_feedback) {}
 
   static void Move(Page* page) {
-    switch (mode) {
-      case NEW_TO_NEW:
-        DCHECK(!v8_flags.minor_mc);
-        page->heap()->new_space()->PromotePageInNewSpace(page);
-        break;
-      case NEW_TO_OLD: {
-        page->heap()->new_space()->PromotePageToOldSpace(page);
-        break;
-      }
-    }
+    page->heap()->new_space()->PromotePageToOldSpace(page);
   }
 
-  inline bool Visit(HeapObject object, int size) override {
-    if (mode == NEW_TO_NEW) {
-      DCHECK(!v8_flags.minor_mc);
-      pretenuring_handler_->UpdateAllocationSite(object.map(), object,
+  inline bool Visit(Tagged<HeapObject> object, int size) override {
+    if (v8_flags.minor_ms) {
+      pretenuring_handler_->UpdateAllocationSite(object->map(), object,
                                                  local_pretenuring_feedback_);
-    } else if (mode == NEW_TO_OLD) {
-      if (v8_flags.minor_mc) {
-        pretenuring_handler_->UpdateAllocationSite(object.map(), object,
-                                                   local_pretenuring_feedback_);
-      }
-      DCHECK(!IsCodeSpaceObject(object));
-      PtrComprCageBase cage_base = GetPtrComprCageBase(object);
-      object.IterateFast(cage_base, record_visitor_);
     }
+    DCHECK(!IsCodeSpaceObject(object));
+    PtrComprCageBase cage_base = GetPtrComprCageBase(object);
+    object->IterateFast(cage_base, record_visitor_);
     return true;
   }
 
@@ -1928,11 +1718,11 @@ class EvacuateOldSpaceVisitor final : public EvacuateVisitorBase {
       : EvacuateVisitorBase(heap, local_allocator, shared_old_allocator,
                             record_visitor) {}
 
-  inline bool Visit(HeapObject object, int size) override {
-    HeapObject target_object;
+  inline bool Visit(Tagged<HeapObject> object, int size) override {
+    Tagged<HeapObject> target_object;
     if (TryEvacuateObject(Page::FromHeapObject(object)->owner_identity(),
                           object, size, &target_object)) {
-      DCHECK(object.map_word(heap_->isolate(), kRelaxedLoad)
+      DCHECK(object->map_word(heap_->isolate(), kRelaxedLoad)
                  .IsForwardingAddress());
       return true;
     }
@@ -1943,85 +1733,85 @@ class EvacuateOldSpaceVisitor final : public EvacuateVisitorBase {
 class EvacuateRecordOnlyVisitor final : public HeapObjectVisitor {
  public:
   explicit EvacuateRecordOnlyVisitor(Heap* heap)
-      : heap_(heap)
-#ifdef V8_COMPRESS_POINTERS
-        ,
-        cage_base_(heap->isolate())
-#endif  // V8_COMPRESS_POINTERS
-  {
-  }
-
-  // The pointer compression cage base value used for decompression of all
-  // tagged values except references to InstructionStream objects.
-  V8_INLINE PtrComprCageBase cage_base() const {
-#ifdef V8_COMPRESS_POINTERS
-    return cage_base_;
-#else
-    return PtrComprCageBase{};
-#endif  // V8_COMPRESS_POINTERS
-  }
+      : heap_(heap), cage_base_(heap->isolate()) {}
 
-  inline bool Visit(HeapObject object, int size) override {
-    RecordMigratedSlotVisitor visitor(heap_, &heap_->ephemeron_remembered_set_);
-    Map map = object.map(cage_base());
+  bool Visit(Tagged<HeapObject> object, int size) override {
+    RecordMigratedSlotVisitor visitor(
+        heap_, heap_->ephemeron_remembered_set()->tables());
+    Tagged<Map> map = object->map(cage_base_);
     // Instead of calling object.IterateFast(cage_base(), &visitor) here
     // we can shortcut and use the precomputed size value passed to the visitor.
-    DCHECK_EQ(object.SizeFromMap(map), size);
-    object.IterateFast(map, size, &visitor);
+    DCHECK_EQ(object->SizeFromMap(map), size);
+    live_object_size_ += ALIGN_TO_ALLOCATION_ALIGNMENT(size);
+    object->IterateFast(map, size, &visitor);
     return true;
   }
 
+  size_t live_object_size() const { return live_object_size_; }
+
  private:
   Heap* heap_;
-#ifdef V8_COMPRESS_POINTERS
   const PtrComprCageBase cage_base_;
-#endif  // V8_COMPRESS_POINTERS
+  size_t live_object_size_ = 0;
 };
 
 // static
 bool MarkCompactCollector::IsUnmarkedHeapObject(Heap* heap, FullObjectSlot p) {
-  Object o = *p;
-  if (!o.IsHeapObject()) return false;
-  HeapObject heap_object = HeapObject::cast(o);
+  Tagged<Object> o = *p;
+  if (!IsHeapObject(o)) return false;
+  Tagged<HeapObject> heap_object = HeapObject::cast(o);
   if (heap_object.InReadOnlySpace()) return false;
   MarkCompactCollector* collector = heap->mark_compact_collector();
   if (V8_UNLIKELY(collector->uses_shared_heap_) &&
       !collector->is_shared_space_isolate_) {
     if (heap_object.InWritableSharedSpace()) return false;
   }
-  return collector->non_atomic_marking_state()->IsUnmarked(heap_object);
+  return collector->non_atomic_marking_state_->IsUnmarked(heap_object);
 }
 
 // static
 bool MarkCompactCollector::IsUnmarkedSharedHeapObject(Heap* heap,
                                                       FullObjectSlot p) {
-  Object o = *p;
-  if (!o.IsHeapObject()) return false;
-  HeapObject heap_object = HeapObject::cast(o);
+  Tagged<Object> o = *p;
+  if (!IsHeapObject(o)) return false;
+  Tagged<HeapObject> heap_object = HeapObject::cast(o);
   Isolate* shared_space_isolate = heap->isolate()->shared_space_isolate();
   MarkCompactCollector* collector =
       shared_space_isolate->heap()->mark_compact_collector();
   if (!heap_object.InWritableSharedSpace()) return false;
-  return collector->non_atomic_marking_state()->IsUnmarked(heap_object);
+  return collector->non_atomic_marking_state_->IsUnmarked(heap_object);
 }
 
 void MarkCompactCollector::MarkRoots(RootVisitor* root_visitor) {
+  Isolate* const isolate = heap_->isolate();
+
   // Mark the heap roots including global variables, stack variables,
   // etc., and all objects reachable from them.
-  heap()->IterateRootsIncludingClients(
+  heap_->IterateRoots(
       root_visitor,
-      base::EnumSet<SkipRoot>{SkipRoot::kWeak, SkipRoot::kConservativeStack});
+      base::EnumSet<SkipRoot>{SkipRoot::kWeak, SkipRoot::kTracedHandles,
+                              SkipRoot::kConservativeStack,
+                              SkipRoot::kReadOnlyBuiltins});
 
-  MarkWaiterQueueNode(isolate());
+  MarkWaiterQueueNode(isolate);
 
   // Custom marking for top optimized frame.
   CustomRootBodyMarkingVisitor custom_root_body_visitor(this);
-  ProcessTopOptimizedFrame(&custom_root_body_visitor, isolate());
-
-  if (isolate()->is_shared_space_isolate()) {
-    ClientCustomRootBodyMarkingVisitor client_custom_root_body_visitor(this);
-    isolate()->global_safepoint()->IterateClientIsolates(
-        [this, &client_custom_root_body_visitor](Isolate* client) {
+  ProcessTopOptimizedFrame(&custom_root_body_visitor, isolate);
+
+  if (isolate->is_shared_space_isolate()) {
+    ClientRootVisitor<> client_root_visitor(root_visitor);
+    ClientObjectVisitor<> client_custom_root_body_visitor(
+        &custom_root_body_visitor);
+
+    isolate->global_safepoint()->IterateClientIsolates(
+        [this, &client_root_visitor,
+         &client_custom_root_body_visitor](Isolate* client) {
+          client->heap()->IterateRoots(
+              &client_root_visitor,
+              base::EnumSet<SkipRoot>{SkipRoot::kWeak,
+                                      SkipRoot::kConservativeStack,
+                                      SkipRoot::kReadOnlyBuiltins});
           ProcessTopOptimizedFrame(&client_custom_root_body_visitor, client);
         });
   }
@@ -2029,14 +1819,27 @@ void MarkCompactCollector::MarkRoots(RootVisitor* root_visitor) {
 
 void MarkCompactCollector::MarkRootsFromConservativeStack(
     RootVisitor* root_visitor) {
-  heap()->IterateConservativeStackRootsIncludingClients(
-      root_visitor, Heap::ScanStackMode::kComplete);
+  heap_->IterateConservativeStackRoots(root_visitor,
+                                       Heap::IterateRootsMode::kMainIsolate);
+
+  Isolate* const isolate = heap_->isolate();
+  if (isolate->is_shared_space_isolate()) {
+    ClientRootVisitor<> client_root_visitor(root_visitor);
+    // For client isolates, use the stack marker to conservatively scan the
+    // stack.
+    isolate->global_safepoint()->IterateClientIsolates(
+        [v = &client_root_visitor](Isolate* client) {
+          client->heap()->IterateConservativeStackRoots(
+              v, Heap::IterateRootsMode::kClientIsolate);
+        });
+  }
 }
 
 void MarkCompactCollector::MarkObjectsFromClientHeaps() {
-  if (!isolate()->is_shared_space_isolate()) return;
+  Isolate* const isolate = heap_->isolate();
+  if (!isolate->is_shared_space_isolate()) return;
 
-  isolate()->global_safepoint()->IterateClientIsolates(
+  isolate->global_safepoint()->IterateClientIsolates(
       [collector = this](Isolate* client) {
         collector->MarkObjectsFromClientHeap(client);
       });
@@ -2053,24 +1856,27 @@ void MarkCompactCollector::MarkObjectsFromClientHeap(Isolate* client) {
   PtrComprCageBase cage_base(client);
   Heap* heap = client->heap();
 
-  // Ensure new space is iterable.
-  heap->MakeHeapIterable();
+  // Finish sweeping for new space in order to iterate objects in it.
+  heap->sweeper()->FinishMinorJobs();
+  // Finish sweeping for old generation in order to iterate OLD_TO_SHARED.
+  heap->sweeper()->FinishMajorJobs();
 
-  if (heap->new_space()) {
-    std::unique_ptr<ObjectIterator> iterator =
-        heap->new_space()->GetObjectIterator(heap);
-    for (HeapObject obj = iterator->Next(); !obj.is_null();
-         obj = iterator->Next()) {
-      obj.IterateFast(cage_base, &visitor);
+  if (auto* new_space = heap->new_space()) {
+    new_space->MakeLinearAllocationAreaIterable();
+
+    for (Page* page : *new_space) {
+      for (Tagged<HeapObject> obj : HeapObjectRange(page)) {
+        obj->IterateFast(cage_base, &visitor);
+      }
     }
   }
 
   if (heap->new_lo_space()) {
     std::unique_ptr<ObjectIterator> iterator =
         heap->new_lo_space()->GetObjectIterator(heap);
-    for (HeapObject obj = iterator->Next(); !obj.is_null();
+    for (Tagged<HeapObject> obj = iterator->Next(); !obj.is_null();
          obj = iterator->Next()) {
-      obj.IterateFast(cage_base, &visitor);
+      obj->IterateFast(cage_base, &visitor);
     }
   }
 
@@ -2083,14 +1889,11 @@ void MarkCompactCollector::MarkObjectsFromClientHeap(Isolate* client) {
 
   for (MemoryChunk* chunk = chunk_iterator.next(); chunk;
        chunk = chunk_iterator.next()) {
-    InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToShared(
-        chunk, InvalidatedSlotsFilter::LivenessCheck::kNo);
-    RememberedSet<OLD_TO_SHARED>::Iterate(
+    const auto slot_count = RememberedSet<OLD_TO_SHARED>::Iterate(
         chunk,
-        [collector = this, cage_base, &filter](MaybeObjectSlot slot) {
-          if (!filter.IsValid(slot.address())) return REMOVE_SLOT;
+        [collector = this, cage_base](MaybeObjectSlot slot) {
           MaybeObject obj = slot.Relaxed_Load(cage_base);
-          HeapObject heap_object;
+          Tagged<HeapObject> heap_object;
 
           if (obj.GetHeapObject(&heap_object) &&
               heap_object.InWritableSharedSpace()) {
@@ -2101,11 +1904,13 @@ void MarkCompactCollector::MarkObjectsFromClientHeap(Isolate* client) {
           }
         },
         SlotSet::FREE_EMPTY_BUCKETS);
-    chunk->ReleaseInvalidatedSlots<OLD_TO_SHARED>();
+    if (slot_count == 0) {
+      chunk->ReleaseSlotSet(OLD_TO_SHARED);
+    }
 
-    RememberedSet<OLD_TO_SHARED>::IterateTyped(
+    const auto typed_slot_count = RememberedSet<OLD_TO_SHARED>::IterateTyped(
         chunk, [collector = this, heap](SlotType slot_type, Address slot) {
-          HeapObject heap_object =
+          Tagged<HeapObject> heap_object =
               UpdateTypedSlotHelper::GetTargetObject(heap, slot_type, slot);
           if (heap_object.InWritableSharedSpace()) {
             collector->MarkRootObject(Root::kClientHeap, heap_object);
@@ -2114,6 +1919,9 @@ void MarkCompactCollector::MarkObjectsFromClientHeap(Isolate* client) {
             return REMOVE_SLOT;
           }
         });
+    if (typed_slot_count == 0) {
+      chunk->ReleaseTypedSlotSet(OLD_TO_SHARED);
+    }
   }
 
   MarkWaiterQueueNode(client);
@@ -2124,8 +1932,10 @@ void MarkCompactCollector::MarkObjectsFromClientHeap(Isolate* client) {
   // All ExternalString resources are stored in the shared external pointer
   // table. Mark entries from client heaps.
   ExternalPointerTable& shared_table = client->shared_external_pointer_table();
+  ExternalPointerTable::Space* shared_space =
+      client->shared_external_pointer_space();
   MarkExternalPointerFromExternalStringTable external_string_visitor(
-      &shared_table);
+      &shared_table, shared_space);
   heap->external_string_table_.IterateAll(&external_string_visitor);
 #endif  // V8_ENABLE_SANDBOX
 }
@@ -2142,7 +1952,8 @@ void MarkCompactCollector::MarkWaiterQueueNode(Isolate* isolate) {
   ExternalPointerHandle handle =
       base::AsAtomic32::Relaxed_Load(handle_location);
   if (handle) {
-    shared_table.Mark(handle, reinterpret_cast<Address>(handle_location));
+    shared_table.Mark(isolate->shared_external_pointer_space(), handle,
+                      reinterpret_cast<Address>(handle_location));
   }
 #endif  // V8_COMPRESS_POINTERS
 }
@@ -2166,10 +1977,10 @@ bool MarkCompactCollector::MarkTransitiveClosureUntilFixpoint() {
     DCHECK(
         local_weak_objects()->current_ephemerons_local.IsLocalAndGlobalEmpty());
     weak_objects_.current_ephemerons.Merge(weak_objects_.next_ephemerons);
-    heap()->concurrent_marking()->set_another_ephemeron_iteration(false);
+    heap_->concurrent_marking()->set_another_ephemeron_iteration(false);
 
     {
-      TRACE_GC(heap()->tracer(),
+      TRACE_GC(heap_->tracer(),
                GCTracer::Scope::MC_MARK_WEAK_CLOSURE_EPHEMERON_MARKING);
       another_ephemeron_iteration_main_thread = ProcessEphemerons();
     }
@@ -2181,9 +1992,9 @@ bool MarkCompactCollector::MarkTransitiveClosureUntilFixpoint() {
 
     ++iterations;
   } while (another_ephemeron_iteration_main_thread ||
-           heap()->concurrent_marking()->another_ephemeron_iteration() ||
-           !local_marking_worklists()->IsEmpty() ||
-           !IsCppHeapMarkingFinished());
+           heap_->concurrent_marking()->another_ephemeron_iteration() ||
+           !local_marking_worklists_->IsEmpty() ||
+           !IsCppHeapMarkingFinished(heap_, local_marking_worklists_.get()));
 
   return true;
 }
@@ -2203,7 +2014,9 @@ bool MarkCompactCollector::ProcessEphemerons() {
   // Drain marking worklist and push discovered ephemerons into
   // discovered_ephemerons.
   size_t objects_processed;
-  std::tie(std::ignore, objects_processed) = ProcessMarkingWorklist(0);
+  std::tie(std::ignore, objects_processed) =
+      ProcessMarkingWorklist(v8::base::TimeDelta::Max(), SIZE_MAX,
+                             MarkingWorklistProcessingMode::kDefault);
 
   // As soon as a single object was processed and potentially marked another
   // object we need another iteration. Otherwise we might miss to apply
@@ -2227,10 +2040,10 @@ bool MarkCompactCollector::ProcessEphemerons() {
 }
 
 void MarkCompactCollector::MarkTransitiveClosureLinear() {
-  TRACE_GC(heap()->tracer(),
+  TRACE_GC(heap_->tracer(),
            GCTracer::Scope::MC_MARK_WEAK_CLOSURE_EPHEMERON_LINEAR);
   // This phase doesn't support parallel marking.
-  DCHECK(heap()->concurrent_marking()->IsStopped());
+  DCHECK(heap_->concurrent_marking()->IsStopped());
   std::unordered_multimap<HeapObject, HeapObject, Object::Hasher> key_to_values;
   Ephemeron ephemeron;
 
@@ -2240,7 +2053,7 @@ void MarkCompactCollector::MarkTransitiveClosureLinear() {
   while (local_weak_objects()->current_ephemerons_local.Pop(&ephemeron)) {
     ProcessEphemeron(ephemeron.key, ephemeron.value);
 
-    if (non_atomic_marking_state()->IsUnmarked(ephemeron.value)) {
+    if (non_atomic_marking_state_->IsUnmarked(ephemeron.value)) {
       key_to_values.insert(std::make_pair(ephemeron.key, ephemeron.value));
     }
   }
@@ -2255,18 +2068,19 @@ void MarkCompactCollector::MarkTransitiveClosureLinear() {
     ephemeron_marking_.newly_discovered_limit = key_to_values.size();
 
     {
-      TRACE_GC(heap()->tracer(),
+      TRACE_GC(heap_->tracer(),
                GCTracer::Scope::MC_MARK_WEAK_CLOSURE_EPHEMERON_MARKING);
       // Drain marking worklist and push all discovered objects into
       // newly_discovered.
       ProcessMarkingWorklist(
-          0, MarkingWorklistProcessingMode::kTrackNewlyDiscoveredObjects);
+          v8::base::TimeDelta::Max(), SIZE_MAX,
+          MarkingWorklistProcessingMode::kTrackNewlyDiscoveredObjects);
     }
 
     while (local_weak_objects()->discovered_ephemerons_local.Pop(&ephemeron)) {
       ProcessEphemeron(ephemeron.key, ephemeron.value);
 
-      if (non_atomic_marking_state()->IsUnmarked(ephemeron.value)) {
+      if (non_atomic_marking_state_->IsUnmarked(ephemeron.value)) {
         key_to_values.insert(std::make_pair(ephemeron.key, ephemeron.value));
       }
     }
@@ -2276,9 +2090,9 @@ void MarkCompactCollector::MarkTransitiveClosureLinear() {
       // next_ephemerons.
       local_weak_objects()->next_ephemerons_local.Publish();
       weak_objects_.next_ephemerons.Iterate([&](Ephemeron ephemeron) {
-        if (non_atomic_marking_state()->IsBlackOrGrey(ephemeron.key) &&
-            non_atomic_marking_state()->TryMark(ephemeron.value)) {
-          local_marking_worklists()->Push(ephemeron.value);
+        if (non_atomic_marking_state_->IsMarked(ephemeron.key) &&
+            non_atomic_marking_state_->TryMark(ephemeron.value)) {
+          local_marking_worklists_->Push(ephemeron.value);
         }
       });
 
@@ -2286,10 +2100,10 @@ void MarkCompactCollector::MarkTransitiveClosureLinear() {
       // This is the good case: newly_discovered stores all discovered
       // objects. Now use key_to_values to see if discovered objects keep more
       // objects alive due to ephemeron semantics.
-      for (HeapObject object : ephemeron_marking_.newly_discovered) {
+      for (Tagged<HeapObject> object : ephemeron_marking_.newly_discovered) {
         auto range = key_to_values.equal_range(object);
         for (auto it = range.first; it != range.second; ++it) {
-          HeapObject value = it->second;
+          Tagged<HeapObject> value = it->second;
           MarkObject(object, value);
         }
       }
@@ -2300,7 +2114,8 @@ void MarkCompactCollector::MarkTransitiveClosureLinear() {
     // is necessary.
 
     work_to_do =
-        !local_marking_worklists()->IsEmpty() || !IsCppHeapMarkingFinished();
+        !local_marking_worklists_->IsEmpty() ||
+        !IsCppHeapMarkingFinished(heap_, local_marking_worklists_.get());
     CHECK(local_weak_objects()
               ->discovered_ephemerons_local.IsLocalAndGlobalEmpty());
   }
@@ -2308,7 +2123,7 @@ void MarkCompactCollector::MarkTransitiveClosureLinear() {
   ResetNewlyDiscovered();
   ephemeron_marking_.newly_discovered.shrink_to_fit();
 
-  CHECK(local_marking_worklists()->IsEmpty());
+  CHECK(local_marking_worklists_->IsEmpty());
 
   CHECK(weak_objects_.current_ephemerons.IsEmpty());
   CHECK(weak_objects_.discovered_ephemerons.IsEmpty());
@@ -2319,85 +2134,83 @@ void MarkCompactCollector::MarkTransitiveClosureLinear() {
 }
 
 void MarkCompactCollector::PerformWrapperTracing() {
-  auto* cpp_heap = CppHeap::From(heap_->cpp_heap());
+  auto* cpp_heap = CppHeap::From(heap_->cpp_heap_);
   if (!cpp_heap) return;
 
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_EMBEDDER_TRACING);
-  cpp_heap->AdvanceTracing(std::numeric_limits<double>::infinity());
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_EMBEDDER_TRACING);
+  cpp_heap->AdvanceTracing(v8::base::TimeDelta::Max());
 }
 
-std::pair<size_t, size_t> MarkCompactCollector::ProcessMarkingWorklist(
-    size_t bytes_to_process) {
-  return ProcessMarkingWorklist(bytes_to_process,
-                                MarkingWorklistProcessingMode::kDefault);
-}
+namespace {
+
+constexpr size_t kDeadlineCheckInterval = 128u;
+
+}  // namespace
 
 std::pair<size_t, size_t> MarkCompactCollector::ProcessMarkingWorklist(
-    size_t bytes_to_process, MarkingWorklistProcessingMode mode) {
-  HeapObject object;
+    v8::base::TimeDelta max_duration, size_t max_bytes_to_process,
+    MarkingWorklistProcessingMode mode) {
+  Tagged<HeapObject> object;
   size_t bytes_processed = 0;
   size_t objects_processed = 0;
-  bool is_per_context_mode = local_marking_worklists()->IsPerContextMode();
-  Isolate* isolate = heap()->isolate();
+  bool is_per_context_mode = local_marking_worklists_->IsPerContextMode();
+  Isolate* const isolate = heap_->isolate();
+  const auto start = v8::base::TimeTicks::Now();
   PtrComprCageBase cage_base(isolate);
   CodePageHeaderModificationScope rwx_write_scope(
       "Marking of InstructionStream objects require write access to "
       "Code page headers");
-  if (parallel_marking_)
+  if (parallel_marking_ && UseBackgroundThreadsInCycle()) {
     heap_->concurrent_marking()->RescheduleJobIfNeeded(
         GarbageCollector::MARK_COMPACTOR, TaskPriority::kUserBlocking);
+  }
 
-  while (local_marking_worklists()->Pop(&object) ||
-         local_marking_worklists()->PopOnHold(&object)) {
-    // Left trimming may result in grey or black filler objects on the marking
-    // worklist. Ignore these objects.
-    if (object.IsFreeSpaceOrFiller(cage_base)) {
-      // Due to copying mark bits and the fact that grey and black have their
-      // first bit set, one word fillers are always black.
-      DCHECK_IMPLIES(object.map(cage_base) ==
-                         ReadOnlyRoots(isolate).one_pointer_filler_map(),
-                     marking_state()->IsMarked(object));
-      // Other fillers may be black or grey depending on the color of the object
-      // that was trimmed.
-      DCHECK_IMPLIES(object.map(cage_base) !=
-                         ReadOnlyRoots(isolate).one_pointer_filler_map(),
-                     marking_state()->IsBlackOrGrey(object));
-      continue;
-    }
-    DCHECK(object.IsHeapObject());
-    DCHECK(heap()->Contains(object));
-    DCHECK(!(marking_state()->IsUnmarked(object)));
+  while (local_marking_worklists_->Pop(&object) ||
+         local_marking_worklists_->PopOnHold(&object)) {
+    // The marking worklist should never contain filler objects.
+    CHECK(!IsFreeSpaceOrFiller(object, cage_base));
+    DCHECK(IsHeapObject(object));
+    DCHECK(!object.InReadOnlySpace());
+    DCHECK_EQ(GetIsolateFromWritableObject(object), isolate);
+    DCHECK(heap_->Contains(object));
+    DCHECK(!(marking_state_->IsUnmarked(object)));
     if (mode == MarkCompactCollector::MarkingWorklistProcessingMode::
                     kTrackNewlyDiscoveredObjects) {
       AddNewlyDiscovered(object);
     }
-    Map map = object.map(cage_base);
+    Tagged<Map> map = object->map(cage_base);
     if (is_per_context_mode) {
       Address context;
       if (native_context_inferrer_.Infer(isolate, map, object, &context)) {
-        local_marking_worklists()->SwitchToContext(context);
+        local_marking_worklists_->SwitchToContext(context);
       }
     }
     const auto visited_size = marking_visitor_->Visit(map, object);
     if (visited_size) {
-      marking_state_->IncrementLiveBytes(
-          MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(object)),
+      MemoryChunk::FromHeapObject(object)->IncrementLiveBytesAtomically(
           ALIGN_TO_ALLOCATION_ALIGNMENT(visited_size));
     }
     if (is_per_context_mode) {
-      native_context_stats_.IncrementSize(local_marking_worklists()->Context(),
+      native_context_stats_.IncrementSize(local_marking_worklists_->Context(),
                                           map, object, visited_size);
     }
     bytes_processed += visited_size;
     objects_processed++;
-    if (bytes_to_process && bytes_processed >= bytes_to_process) {
+    static_assert(base::bits::IsPowerOfTwo(kDeadlineCheckInterval),
+                  "kDeadlineCheckInterval must be power of 2");
+    if ((objects_processed & kDeadlineCheckInterval) == 0 &&
+        ((v8::base::TimeTicks::Now() - start) > max_duration)) {
+      break;
+    }
+    if (bytes_processed >= max_bytes_to_process) {
       break;
     }
   }
   return std::make_pair(bytes_processed, objects_processed);
 }
 
-bool MarkCompactCollector::ProcessEphemeron(HeapObject key, HeapObject value) {
+bool MarkCompactCollector::ProcessEphemeron(Tagged<HeapObject> key,
+                                            Tagged<HeapObject> value) {
   // Objects in the shared heap are prohibited from being used as keys in
   // WeakMaps and WeakSets and therefore cannot be ephemeron keys, because that
   // would enable thread local -> shared heap edges.
@@ -2407,13 +2220,13 @@ bool MarkCompactCollector::ProcessEphemeron(HeapObject key, HeapObject value) {
   // strings from the younger generation into the shared heap. This
   // ShouldMarkObject call catches those cases.
   if (!ShouldMarkObject(value)) return false;
-  if (marking_state()->IsBlackOrGrey(key)) {
-    if (marking_state()->TryMark(value)) {
-      local_marking_worklists()->Push(value);
+  if (marking_state_->IsMarked(key)) {
+    if (marking_state_->TryMark(value)) {
+      local_marking_worklists_->Push(value);
       return true;
     }
 
-  } else if (marking_state()->IsUnmarked(value)) {
+  } else if (marking_state_->IsUnmarked(value)) {
     local_weak_objects()->next_ephemerons_local.Push(Ephemeron{key, value});
   }
   return false;
@@ -2453,13 +2266,13 @@ void MarkCompactCollector::ProcessTopOptimizedFrame(ObjectVisitor* visitor,
        it.Advance()) {
     if (it.frame()->is_unoptimized()) return;
     if (it.frame()->is_optimized()) {
-      GcSafeCode lookup_result = it.frame()->GcSafeLookupCode();
-      if (!lookup_result.has_instruction_stream()) return;
-      if (!lookup_result.CanDeoptAt(isolate, it.frame()->pc())) {
-        InstructionStream istream = InstructionStream::unchecked_cast(
-            lookup_result.raw_instruction_stream());
+      Tagged<GcSafeCode> lookup_result = it.frame()->GcSafeLookupCode();
+      if (!lookup_result->has_instruction_stream()) return;
+      if (!lookup_result->CanDeoptAt(isolate, it.frame()->pc())) {
+        Tagged<InstructionStream> istream = InstructionStream::unchecked_cast(
+            lookup_result->raw_instruction_stream());
         PtrComprCageBase cage_base(isolate);
-        InstructionStream::BodyDescriptor::IterateBody(istream.map(cage_base),
+        InstructionStream::BodyDescriptor::IterateBody(istream->map(cage_base),
                                                        istream, visitor);
       }
       return;
@@ -2470,39 +2283,39 @@ void MarkCompactCollector::ProcessTopOptimizedFrame(ObjectVisitor* visitor,
 void MarkCompactCollector::RecordObjectStats() {
   if (V8_LIKELY(!TracingFlags::is_gc_stats_enabled())) return;
   // Cannot run during bootstrapping due to incomplete objects.
-  if (isolate()->bootstrapper()->IsActive()) return;
+  if (heap_->isolate()->bootstrapper()->IsActive()) return;
   TRACE_EVENT0(TRACE_GC_CATEGORIES, "V8.GC_OBJECT_DUMP_STATISTICS");
-  heap()->CreateObjectStats();
-  ObjectStatsCollector collector(heap(), heap()->live_object_stats_.get(),
-                                 heap()->dead_object_stats_.get());
+  heap_->CreateObjectStats();
+  ObjectStatsCollector collector(heap_, heap_->live_object_stats_.get(),
+                                 heap_->dead_object_stats_.get());
   collector.Collect();
   if (V8_UNLIKELY(TracingFlags::gc_stats.load(std::memory_order_relaxed) &
                   v8::tracing::TracingCategoryObserver::ENABLED_BY_TRACING)) {
     std::stringstream live, dead;
-    heap()->live_object_stats_->Dump(live);
-    heap()->dead_object_stats_->Dump(dead);
+    heap_->live_object_stats_->Dump(live);
+    heap_->dead_object_stats_->Dump(dead);
     TRACE_EVENT_INSTANT2(TRACE_DISABLED_BY_DEFAULT("v8.gc_stats"),
                          "V8.GC_Objects_Stats", TRACE_EVENT_SCOPE_THREAD,
                          "live", TRACE_STR_COPY(live.str().c_str()), "dead",
                          TRACE_STR_COPY(dead.str().c_str()));
   }
   if (v8_flags.trace_gc_object_stats) {
-    heap()->live_object_stats_->PrintJSON("live");
-    heap()->dead_object_stats_->PrintJSON("dead");
+    heap_->live_object_stats_->PrintJSON("live");
+    heap_->dead_object_stats_->PrintJSON("dead");
   }
-  heap()->live_object_stats_->CheckpointObjectStats();
-  heap()->dead_object_stats_->ClearObjectStats();
+  heap_->live_object_stats_->CheckpointObjectStats();
+  heap_->dead_object_stats_->ClearObjectStats();
 }
 
 namespace {
 
-bool ShouldRetainMap(MarkingState* marking_state, Map map, int age) {
+bool ShouldRetainMap(MarkingState* marking_state, Tagged<Map> map, int age) {
   if (age == 0) {
     // The map has aged. Do not retain this map.
     return false;
   }
-  Object constructor = map.GetConstructor();
-  if (!constructor.IsHeapObject() ||
+  Tagged<Object> constructor = map->GetConstructor();
+  if (!IsHeapObject(constructor) ||
       (!HeapObject::cast(constructor).InReadOnlySpace() &&
        marking_state->IsUnmarked(HeapObject::cast(constructor)))) {
     // The constructor is dead, no new objects with this map can
@@ -2519,32 +2332,32 @@ void MarkCompactCollector::RetainMaps() {
   // memory cost, hence disable it when trying to reduce memory footprint more
   // aggressively.
   const bool should_retain_maps =
-      !heap()->ShouldReduceMemory() && v8_flags.retain_maps_for_n_gc != 0;
-
-  for (WeakArrayList retained_maps : heap()->FindAllRetainedMaps()) {
-    DCHECK_EQ(0, retained_maps.length() % 2);
-    for (int i = 0; i < retained_maps.length(); i += 2) {
-      MaybeObject value = retained_maps.Get(i);
-      HeapObject map_heap_object;
-      if (!value->GetHeapObjectIfWeak(&map_heap_object)) {
+      !heap_->ShouldReduceMemory() && v8_flags.retain_maps_for_n_gc != 0;
+
+  for (Tagged<WeakArrayList> retained_maps : heap_->FindAllRetainedMaps()) {
+    DCHECK_EQ(0, retained_maps->length() % 2);
+    for (int i = 0; i < retained_maps->length(); i += 2) {
+      MaybeObject value = retained_maps->Get(i);
+      Tagged<HeapObject> map_heap_object;
+      if (!value.GetHeapObjectIfWeak(&map_heap_object)) {
         continue;
       }
-      int age = retained_maps.Get(i + 1).ToSmi().value();
+      int age = retained_maps->Get(i + 1).ToSmi().value();
       int new_age;
-      Map map = Map::cast(map_heap_object);
-      if (should_retain_maps && marking_state()->IsUnmarked(map)) {
-        if (ShouldRetainMap(marking_state(), map, age)) {
-          if (marking_state()->TryMark(map)) {
-            local_marking_worklists()->Push(map);
+      Tagged<Map> map = Map::cast(map_heap_object);
+      if (should_retain_maps && marking_state_->IsUnmarked(map)) {
+        if (ShouldRetainMap(marking_state_, map, age)) {
+          if (marking_state_->TryMark(map)) {
+            local_marking_worklists_->Push(map);
           }
           if (V8_UNLIKELY(v8_flags.track_retaining_path)) {
             heap_->AddRetainingRoot(Root::kRetainMaps, map);
           }
         }
-        Object prototype = map.prototype();
-        if (age > 0 && prototype.IsHeapObject() &&
+        Tagged<Object> prototype = map->prototype();
+        if (age > 0 && IsHeapObject(prototype) &&
             (!HeapObject::cast(prototype).InReadOnlySpace() &&
-             marking_state()->IsUnmarked(HeapObject::cast(prototype)))) {
+             marking_state_->IsUnmarked(HeapObject::cast(prototype)))) {
           // The prototype is not marked, age the map.
           new_age = age - 1;
         } else {
@@ -2557,23 +2370,26 @@ void MarkCompactCollector::RetainMaps() {
       }
       // Compact the array and update the age.
       if (new_age != age) {
-        retained_maps.Set(i + 1, MaybeObject::FromSmi(Smi::FromInt(new_age)));
+        retained_maps->Set(i + 1, MaybeObject::FromSmi(Smi::FromInt(new_age)));
       }
     }
   }
 }
 
 void MarkCompactCollector::MarkLiveObjects() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK);
+  TRACE_GC_ARG1(heap_->tracer(), GCTracer::Scope::MC_MARK,
+                "UseBackgroundThreads", UseBackgroundThreadsInCycle());
 
   const bool was_marked_incrementally =
       !heap_->incremental_marking()->IsStopped();
   if (was_marked_incrementally) {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_FINISH_INCREMENTAL);
     auto* incremental_marking = heap_->incremental_marking();
+    TRACE_GC_WITH_FLOW(
+        heap_->tracer(), GCTracer::Scope::MC_MARK_FINISH_INCREMENTAL,
+        incremental_marking->current_trace_id(), TRACE_EVENT_FLAG_FLOW_IN);
     DCHECK(incremental_marking->IsMajorMarking());
     incremental_marking->Stop();
-    MarkingBarrier::PublishAll(heap());
+    MarkingBarrier::PublishAll(heap_);
   }
 
 #ifdef DEBUG
@@ -2581,59 +2397,62 @@ void MarkCompactCollector::MarkLiveObjects() {
   state_ = MARK_LIVE_OBJECTS;
 #endif
 
-  if (heap_->cpp_heap()) {
-    CppHeap::From(heap_->cpp_heap())
+  if (heap_->cpp_heap_) {
+    CppHeap::From(heap_->cpp_heap_)
         ->EnterFinalPause(heap_->embedder_stack_state_);
   }
 
   RootMarkingVisitor root_visitor(this);
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_ROOTS);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_ROOTS);
     MarkRoots(&root_visitor);
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_CLIENT_HEAPS);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_CLIENT_HEAPS);
     MarkObjectsFromClientHeaps();
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_RETAIN_MAPS);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_RETAIN_MAPS);
     RetainMaps();
   }
 
-  if (v8_flags.parallel_marking) {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_FULL_CLOSURE_PARALLEL);
+  if (v8_flags.parallel_marking && UseBackgroundThreadsInCycle()) {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_FULL_CLOSURE_PARALLEL);
     parallel_marking_ = true;
     heap_->concurrent_marking()->RescheduleJobIfNeeded(
         GarbageCollector::MARK_COMPACTOR, TaskPriority::kUserBlocking);
     MarkTransitiveClosure();
     {
-      TRACE_GC(heap()->tracer(),
+      TRACE_GC(heap_->tracer(),
                GCTracer::Scope::MC_MARK_FULL_CLOSURE_PARALLEL_JOIN);
       FinishConcurrentMarking();
     }
     parallel_marking_ = false;
+  } else {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_FULL_CLOSURE_SERIAL);
+    MarkTransitiveClosure();
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_ROOTS);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_ROOTS);
     MarkRootsFromConservativeStack(&root_visitor);
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_MARK_FULL_CLOSURE);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_MARK_FULL_CLOSURE);
     // Complete the transitive closure single-threaded to avoid races with
     // multiple threads when processing weak maps and embedder heaps.
-    CHECK(heap()->concurrent_marking()->IsStopped());
+    CHECK(heap_->concurrent_marking()->IsStopped());
     MarkTransitiveClosure();
-    CHECK(local_marking_worklists()->IsEmpty());
+    CHECK(local_marking_worklists_->IsEmpty());
     CHECK(
         local_weak_objects()->current_ephemerons_local.IsLocalAndGlobalEmpty());
     CHECK(local_weak_objects()
               ->discovered_ephemerons_local.IsLocalAndGlobalEmpty());
-    CHECK(IsCppHeapMarkingFinished());
+    CHECK(IsCppHeapMarkingFinished(heap_, local_marking_worklists_.get()));
     VerifyEphemeronMarking();
   }
 
@@ -2641,8 +2460,8 @@ void MarkCompactCollector::MarkLiveObjects() {
     // Disable the marking barrier after concurrent/parallel marking has
     // finished as it will reset page flags that share the same bitmap as
     // the evacuation candidate bit.
-    MarkingBarrier::DeactivateAll(heap());
-    heap()->isolate()->traced_handles()->SetIsMarking(false);
+    MarkingBarrier::DeactivateAll(heap_);
+    heap_->isolate()->traced_handles()->SetIsMarking(false);
   }
 
   epoch_++;
@@ -2658,7 +2477,8 @@ class ParallelClearingJob final : public v8::JobTask {
     virtual void Run(JobDelegate* delegate) = 0;
   };
 
-  ParallelClearingJob() = default;
+  explicit ParallelClearingJob(MarkCompactCollector* collector)
+      : collector_(collector) {}
   ~ParallelClearingJob() override = default;
   ParallelClearingJob(const ParallelClearingJob&) = delete;
   ParallelClearingJob& operator=(const ParallelClearingJob&) = delete;
@@ -2676,6 +2496,10 @@ class ParallelClearingJob final : public v8::JobTask {
 
   size_t GetMaxConcurrency(size_t worker_count) const override {
     base::MutexGuard guard(&items_mutex_);
+    if (!v8_flags.parallel_weak_ref_clearing ||
+        !collector_->UseBackgroundThreadsInCycle()) {
+      return std::min<size_t>(items_.size(), 1);
+    }
     return items_.size();
   }
 
@@ -2684,20 +2508,26 @@ class ParallelClearingJob final : public v8::JobTask {
   }
 
  private:
+  MarkCompactCollector* collector_;
   mutable base::Mutex items_mutex_;
   std::vector<std::unique_ptr<ClearingItem>> items_;
 };
 
 class ClearStringTableJobItem final : public ParallelClearingJob::ClearingItem {
  public:
-  explicit ClearStringTableJobItem(Isolate* isolate) : isolate_(isolate) {}
+  explicit ClearStringTableJobItem(Isolate* isolate)
+      : isolate_(isolate),
+        trace_id_(reinterpret_cast<uint64_t>(this) ^
+                  isolate->heap()->tracer()->CurrentEpoch(
+                      GCTracer::Scope::MC_CLEAR_STRING_TABLE)) {}
 
   void Run(JobDelegate* delegate) final {
     if (isolate_->OwnsStringTables()) {
-      TRACE_GC1(isolate_->heap()->tracer(),
-                GCTracer::Scope::MC_CLEAR_STRING_TABLE,
-                delegate->IsJoiningThread() ? ThreadKind::kMain
-                                            : ThreadKind::kBackground);
+      TRACE_GC1_WITH_FLOW(isolate_->heap()->tracer(),
+                          GCTracer::Scope::MC_CLEAR_STRING_TABLE,
+                          delegate->IsJoiningThread() ? ThreadKind::kMain
+                                                      : ThreadKind::kBackground,
+                          trace_id_, TRACE_EVENT_FLAG_FLOW_IN);
       // Prune the string table removing all strings only pointed to by the
       // string table.  Cannot use string_table() here because the string
       // table is marked.
@@ -2710,16 +2540,20 @@ class ClearStringTableJobItem final : public ParallelClearingJob::ClearingItem {
     }
   }
 
+  uint64_t trace_id() const { return trace_id_; }
+
  private:
   Isolate* const isolate_;
+  const uint64_t trace_id_;
 };
 
-class StringForwardingTableCleaner final {
+class FullStringForwardingTableCleaner final
+    : public StringForwardingTableCleanerBase {
  public:
-  explicit StringForwardingTableCleaner(Heap* heap)
-      : heap_(heap),
-        isolate_(heap_->isolate()),
-        marking_state_(heap_->non_atomic_marking_state()) {}
+  explicit FullStringForwardingTableCleaner(Heap* heap)
+      : StringForwardingTableCleanerBase(heap), heap_(heap) {
+    USE(heap_);
+  }
 
   // Transition all strings in the forwarding table to
   // ThinStrings/ExternalStrings and clear the table afterwards.
@@ -2753,30 +2587,17 @@ class StringForwardingTableCleaner final {
         });
   }
 
-  // For Minor MC we don't mark forward objects, because they are always
-  // in old generation (and thus considered live).
-  // We only need to delete non-live young objects.
-  void ProcessYoungObjects() {
-    DCHECK(v8_flags.always_use_string_forwarding_table);
-    StringForwardingTable* forwarding_table =
-        isolate_->string_forwarding_table();
-    forwarding_table->IterateElements(
-        [&](StringForwardingTable::Record* record) {
-          ClearNonLiveYoungObjects(record);
-        });
-  }
-
  private:
   void MarkForwardObject(StringForwardingTable::Record* record) {
-    Object original = record->OriginalStringObject(isolate_);
-    if (!original.IsHeapObject()) {
+    Tagged<Object> original = record->OriginalStringObject(isolate_);
+    if (!IsHeapObject(original)) {
       DCHECK_EQ(original, StringForwardingTable::deleted_element());
       return;
     }
-    String original_string = String::cast(original);
+    Tagged<String> original_string = String::cast(original);
     if (marking_state_->IsMarked(original_string)) {
-      Object forward = record->ForwardStringObjectOrHash(isolate_);
-      if (!forward.IsHeapObject() ||
+      Tagged<Object> forward = record->ForwardStringObjectOrHash(isolate_);
+      if (!IsHeapObject(forward) ||
           HeapObject::cast(forward).InReadOnlySpace()) {
         return;
       }
@@ -2787,43 +2608,29 @@ class StringForwardingTableCleaner final {
     }
   }
 
-  void ClearNonLiveYoungObjects(StringForwardingTable::Record* record) {
-    Object original = record->OriginalStringObject(isolate_);
-    if (!original.IsHeapObject()) {
-      DCHECK_EQ(original, StringForwardingTable::deleted_element());
-      return;
-    }
-    String original_string = String::cast(original);
-    if (!Heap::InYoungGeneration(original_string)) return;
-    if (!marking_state_->IsMarked(original_string)) {
-      DisposeExternalResource(record);
-      record->set_original_string(StringForwardingTable::deleted_element());
-    }
-  }
-
   void TransitionStrings(StringForwardingTable::Record* record) {
-    Object original = record->OriginalStringObject(isolate_);
-    if (!original.IsHeapObject()) {
+    Tagged<Object> original = record->OriginalStringObject(isolate_);
+    if (!IsHeapObject(original)) {
       DCHECK_EQ(original, StringForwardingTable::deleted_element());
       return;
     }
     if (marking_state_->IsMarked(HeapObject::cast(original))) {
-      String original_string = String::cast(original);
-      if (original_string.IsThinString()) {
-        original_string = ThinString::cast(original_string).actual();
+      Tagged<String> original_string = String::cast(original);
+      if (IsThinString(original_string)) {
+        original_string = ThinString::cast(original_string)->actual();
       }
       TryExternalize(original_string, record);
       TryInternalize(original_string, record);
-      original_string.set_raw_hash_field(record->raw_hash(isolate_));
+      original_string->set_raw_hash_field(record->raw_hash(isolate_));
     } else {
       DisposeExternalResource(record);
     }
   }
 
-  void TryExternalize(String original_string,
+  void TryExternalize(Tagged<String> original_string,
                       StringForwardingTable::Record* record) {
     // If the string is already external, dispose the resource.
-    if (original_string.IsExternalString()) {
+    if (IsExternalString(original_string)) {
       record->DisposeUnusedExternalResource(original_string);
       return;
     }
@@ -2834,25 +2641,25 @@ class StringForwardingTableCleaner final {
     if (external_resource == nullptr) return;
 
     if (is_one_byte) {
-      original_string.MakeExternalDuringGC(
+      original_string->MakeExternalDuringGC(
           isolate_,
           reinterpret_cast<v8::String::ExternalOneByteStringResource*>(
               external_resource));
     } else {
-      original_string.MakeExternalDuringGC(
+      original_string->MakeExternalDuringGC(
           isolate_, reinterpret_cast<v8::String::ExternalStringResource*>(
                         external_resource));
     }
   }
 
-  void TryInternalize(String original_string,
+  void TryInternalize(Tagged<String> original_string,
                       StringForwardingTable::Record* record) {
-    if (original_string.IsInternalizedString()) return;
-    Object forward = record->ForwardStringObjectOrHash(isolate_);
-    if (!forward.IsHeapObject()) {
+    if (IsInternalizedString(original_string)) return;
+    Tagged<Object> forward = record->ForwardStringObjectOrHash(isolate_);
+    if (!IsHeapObject(forward)) {
       return;
     }
-    String forward_string = String::cast(forward);
+    Tagged<String> forward_string = String::cast(forward);
 
     // Mark the forwarded string to keep it alive.
     if (!forward_string.InReadOnlySpace()) {
@@ -2860,41 +2667,26 @@ class StringForwardingTableCleaner final {
     }
     // Transition the original string to a ThinString and override the
     // forwarding index with the correct hash.
-    original_string.MakeThin(isolate_, forward_string);
+    original_string->MakeThin(isolate_, forward_string);
     // Record the slot in the old-to-old remembered set. This is
     // required as the internalized string could be relocated during
     // compaction.
     ObjectSlot slot =
-        ThinString::cast(original_string).RawField(ThinString::kActualOffset);
+        ThinString::cast(original_string)->RawField(ThinString::kActualOffset);
     MarkCompactCollector::RecordSlot(original_string, slot, forward_string);
   }
 
-  // Dispose external resource, if it wasn't disposed already.
-  // We can have multiple entries of the same external resource in the string
-  // forwarding table (i.e. concurrent externalization of a string with the same
-  // resource), therefore we keep track of already disposed resources to not
-  // dispose a resource more than once.
-  void DisposeExternalResource(StringForwardingTable::Record* record) {
-    Address resource = record->ExternalResourceAddress();
-    if (resource != kNullAddress && disposed_resources_.count(resource) == 0) {
-      record->DisposeExternalResource();
-      disposed_resources_.insert(resource);
-    }
-  }
-
   Heap* const heap_;
-  Isolate* const isolate_;
-  NonAtomicMarkingState* const marking_state_;
-  std::unordered_set<Address> disposed_resources_;
 };
 
 }  // namespace
 
 void MarkCompactCollector::ClearNonLiveReferences() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR);
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR);
 
-  if (isolate()->OwnsStringTables()) {
-    TRACE_GC(heap()->tracer(),
+  Isolate* const isolate = heap_->isolate();
+  if (isolate->OwnsStringTables()) {
+    TRACE_GC(heap_->tracer(),
              GCTracer::Scope::MC_CLEAR_STRING_FORWARDING_TABLE);
     // Clear string forwarding table. Live strings are transitioned to
     // ThinStrings/ExternalStrings in the cleanup process, if this is a GC
@@ -2902,7 +2694,7 @@ void MarkCompactCollector::ClearNonLiveReferences() {
     // Clearing the string forwarding table must happen before clearing the
     // string table, as entries in the forwarding table can keep internalized
     // strings alive.
-    StringForwardingTableCleaner forwarding_table_cleaner(heap());
+    FullStringForwardingTableCleaner forwarding_table_cleaner(heap_);
     if (!heap_->IsGCWithStack() ||
         v8_flags.transition_strings_during_gc_with_stack) {
       forwarding_table_cleaner.TransitionStrings();
@@ -2911,30 +2703,38 @@ void MarkCompactCollector::ClearNonLiveReferences() {
     }
   }
 
-  auto clearing_job = std::make_unique<ParallelClearingJob>();
-  clearing_job->Add(std::make_unique<ClearStringTableJobItem>(isolate()));
-  auto clearing_job_handle = V8::GetCurrentPlatform()->PostJob(
+  auto clearing_job = std::make_unique<ParallelClearingJob>(this);
+  auto clear_string_table_job_item =
+      std::make_unique<ClearStringTableJobItem>(isolate);
+  const uint64_t trace_id = clear_string_table_job_item->trace_id();
+  clearing_job->Add(std::move(clear_string_table_job_item));
+  TRACE_GC_NOTE_WITH_FLOW("ClearStringTableJob started", trace_id,
+                          TRACE_EVENT_FLAG_FLOW_OUT);
+  auto clearing_job_handle = V8::GetCurrentPlatform()->CreateJob(
       TaskPriority::kUserBlocking, std::move(clearing_job));
+  if (v8_flags.parallel_weak_ref_clearing && UseBackgroundThreadsInCycle()) {
+    clearing_job_handle->NotifyConcurrencyIncrease();
+  }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_EXTERNAL_STRING_TABLE);
-    ExternalStringTableCleaner<ExternalStringTableCleaningMode::kAll>
-        external_visitor(heap());
-    heap()->external_string_table_.IterateAll(&external_visitor);
-    heap()->external_string_table_.CleanUpAll();
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_EXTERNAL_STRING_TABLE);
+    ExternalStringTableCleanerVisitor<ExternalStringTableCleaningMode::kAll>
+        external_visitor(heap_);
+    heap_->external_string_table_.IterateAll(&external_visitor);
+    heap_->external_string_table_.CleanUpAll();
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_GLOBAL_HANDLES);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_GLOBAL_HANDLES);
     // We depend on `IterateWeakRootsForPhantomHandles()` being called before
     // `ProcessOldCodeCandidates()` in order to identify flushed bytecode in the
     // CPU profiler.
-    isolate()->global_handles()->IterateWeakRootsForPhantomHandles(
+    isolate->global_handles()->IterateWeakRootsForPhantomHandles(
         &IsUnmarkedHeapObject);
-    isolate()->traced_handles()->ResetDeadNodes(&IsUnmarkedHeapObject);
+    isolate->traced_handles()->ResetDeadNodes(&IsUnmarkedHeapObject);
 
-    if (isolate()->is_shared_space_isolate()) {
-      isolate()->global_safepoint()->IterateClientIsolates([](Isolate* client) {
+    if (isolate->is_shared_space_isolate()) {
+      isolate->global_safepoint()->IterateClientIsolates([](Isolate* client) {
         client->global_handles()->IterateWeakRootsForPhantomHandles(
             &IsUnmarkedSharedHeapObject);
         // No need to reset traced handles since they are always strong.
@@ -2943,7 +2743,7 @@ void MarkCompactCollector::ClearNonLiveReferences() {
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_FLUSHABLE_BYTECODE);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_FLUSHABLE_BYTECODE);
     // `ProcessFlushedBaselineCandidates()` must be called after
     // `ProcessOldCodeCandidates()` so that we correctly set the code object on
     // the JSFunction after flushing.
@@ -2952,19 +2752,19 @@ void MarkCompactCollector::ClearNonLiveReferences() {
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_FLUSHED_JS_FUNCTIONS);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_FLUSHED_JS_FUNCTIONS);
     ClearFlushedJsFunctions();
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_LISTS);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_LISTS);
     // Process the weak references.
-    MarkCompactWeakObjectRetainer mark_compact_object_retainer(marking_state());
-    heap()->ProcessAllWeakReferences(&mark_compact_object_retainer);
+    MarkCompactWeakObjectRetainer mark_compact_object_retainer(marking_state_);
+    heap_->ProcessAllWeakReferences(&mark_compact_object_retainer);
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_MAPS);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_MAPS);
     // ClearFullMapTransitions must be called before weak references are
     // cleared.
     ClearFullMapTransitions();
@@ -2973,32 +2773,45 @@ void MarkCompactCollector::ClearNonLiveReferences() {
     WeakenStrongDescriptorArrays();
   }
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_REFERENCES);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_REFERENCES);
     ClearWeakReferences();
     ClearWeakCollections();
     ClearJSWeakRefs();
   }
 
-  PROFILE(heap()->isolate(), WeakCodeClearEvent());
+  PROFILE(heap_->isolate(), WeakCodeClearEvent());
 
   MarkDependentCodeForDeoptimization();
 
 #ifdef V8_ENABLE_SANDBOX
   {
-    TRACE_GC(heap()->tracer(),
-             GCTracer::Scope::MC_SWEEP_EXTERNAL_POINTER_TABLE);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_SWEEP_EXTERNAL_POINTER_TABLE);
     // External pointer table sweeping needs to happen before evacuating live
     // objects as it may perform table compaction, which requires objects to
     // still be at the same location as during marking.
-    isolate()->external_pointer_table().SweepAndCompact(isolate());
-    if (isolate()->owns_shareable_data()) {
-      isolate()->shared_external_pointer_table().SweepAndCompact(isolate());
+    //
+    // Note we explicitly do NOT run SweepAndCompact on
+    // read_only_external_pointer_space since these entries are all immortal by
+    // definition.
+    isolate->external_pointer_table().SweepAndCompact(
+        isolate->heap()->external_pointer_space(), isolate->counters());
+    if (isolate->owns_shareable_data()) {
+      isolate->shared_external_pointer_table().SweepAndCompact(
+          isolate->shared_external_pointer_space(), isolate->counters());
     }
   }
 #endif  // V8_ENABLE_SANDBOX
 
+#ifdef V8_CODE_POINTER_SANDBOXING
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_JOIN_JOB);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_SWEEP_CODE_POINTER_TABLE);
+    GetProcessWideCodePointerTable()->Sweep(heap_->code_pointer_space(),
+                                            isolate->counters());
+  }
+#endif  // V8_CODE_POINTER_SANDBOXING
+
+  {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_JOIN_JOB);
     clearing_job_handle->Join();
   }
 
@@ -3013,65 +2826,67 @@ void MarkCompactCollector::ClearNonLiveReferences() {
 }
 
 void MarkCompactCollector::MarkDependentCodeForDeoptimization() {
-  std::pair<HeapObject, Code> weak_object_in_code;
+  HeapObjectAndCode weak_object_in_code;
   while (local_weak_objects()->weak_objects_in_code_local.Pop(
       &weak_object_in_code)) {
-    HeapObject object = weak_object_in_code.first;
-    Code code = weak_object_in_code.second;
-    if (!non_atomic_marking_state()->IsBlackOrGrey(object) &&
-        !code.embedded_objects_cleared()) {
-      if (!code.marked_for_deoptimization()) {
-        code.SetMarkedForDeoptimization(isolate(), "weak objects");
+    Tagged<HeapObject> object = weak_object_in_code.first;
+    Tagged<Code> code = weak_object_in_code.second;
+    if (!non_atomic_marking_state_->IsMarked(object) &&
+        !code->embedded_objects_cleared()) {
+      if (!code->marked_for_deoptimization()) {
+        code->SetMarkedForDeoptimization(heap_->isolate(), "weak objects");
         have_code_to_deoptimize_ = true;
       }
-      code.ClearEmbeddedObjects(heap_);
-      DCHECK(code.embedded_objects_cleared());
+      code->ClearEmbeddedObjects(heap_);
+      DCHECK(code->embedded_objects_cleared());
     }
   }
 }
 
-void MarkCompactCollector::ClearPotentialSimpleMapTransition(Map dead_target) {
-  DCHECK(non_atomic_marking_state()->IsUnmarked(dead_target));
-  Object potential_parent = dead_target.constructor_or_back_pointer();
-  if (potential_parent.IsMap()) {
-    Map parent = Map::cast(potential_parent);
+void MarkCompactCollector::ClearPotentialSimpleMapTransition(
+    Tagged<Map> dead_target) {
+  DCHECK(non_atomic_marking_state_->IsUnmarked(dead_target));
+  Tagged<Object> potential_parent = dead_target->constructor_or_back_pointer();
+  if (IsMap(potential_parent)) {
+    Tagged<Map> parent = Map::cast(potential_parent);
     DisallowGarbageCollection no_gc_obviously;
-    if (non_atomic_marking_state()->IsBlackOrGrey(parent) &&
-        TransitionsAccessor(isolate(), parent)
+    if (non_atomic_marking_state_->IsMarked(parent) &&
+        TransitionsAccessor(heap_->isolate(), parent)
             .HasSimpleTransitionTo(dead_target)) {
       ClearPotentialSimpleMapTransition(parent, dead_target);
     }
   }
 }
 
-void MarkCompactCollector::ClearPotentialSimpleMapTransition(Map map,
-                                                             Map dead_target) {
-  DCHECK(!map.is_prototype_map());
-  DCHECK(!dead_target.is_prototype_map());
-  DCHECK_EQ(map.raw_transitions(), HeapObjectReference::Weak(dead_target));
+void MarkCompactCollector::ClearPotentialSimpleMapTransition(
+    Tagged<Map> map, Tagged<Map> dead_target) {
+  DCHECK(!map->is_prototype_map());
+  DCHECK(!dead_target->is_prototype_map());
+  DCHECK_EQ(map->raw_transitions(), HeapObjectReference::Weak(dead_target));
   // Take ownership of the descriptor array.
-  int number_of_own_descriptors = map.NumberOfOwnDescriptors();
-  DescriptorArray descriptors = map.instance_descriptors(isolate());
-  if (descriptors == dead_target.instance_descriptors(isolate()) &&
+  int number_of_own_descriptors = map->NumberOfOwnDescriptors();
+  Tagged<DescriptorArray> descriptors =
+      map->instance_descriptors(heap_->isolate());
+  if (descriptors == dead_target->instance_descriptors(heap_->isolate()) &&
       number_of_own_descriptors > 0) {
     TrimDescriptorArray(map, descriptors);
-    DCHECK(descriptors.number_of_descriptors() == number_of_own_descriptors);
+    DCHECK(descriptors->number_of_descriptors() == number_of_own_descriptors);
   }
 }
 
 void MarkCompactCollector::FlushBytecodeFromSFI(
-    SharedFunctionInfo shared_info) {
-  DCHECK(shared_info.HasBytecodeArray());
+    Tagged<SharedFunctionInfo> shared_info) {
+  DCHECK(shared_info->HasBytecodeArray());
 
   // Retain objects required for uncompiled data.
-  String inferred_name = shared_info.inferred_name();
-  int start_position = shared_info.StartPosition();
-  int end_position = shared_info.EndPosition();
+  Tagged<String> inferred_name = shared_info->inferred_name();
+  int start_position = shared_info->StartPosition();
+  int end_position = shared_info->EndPosition();
 
-  shared_info.DiscardCompiledMetadata(
-      isolate(), [](HeapObject object, ObjectSlot slot, HeapObject target) {
-        RecordSlot(object, slot, target);
-      });
+  shared_info->DiscardCompiledMetadata(
+      heap_->isolate(),
+      [](Tagged<HeapObject> object, ObjectSlot slot,
+         Tagged<HeapObject> target) { RecordSlot(object, slot, target); });
 
   // The size of the bytecode array should always be larger than an
   // UncompiledData object.
@@ -3079,15 +2894,19 @@ void MarkCompactCollector::FlushBytecodeFromSFI(
                 UncompiledDataWithoutPreparseData::kSize);
 
   // Replace bytecode array with an uncompiled data array.
-  HeapObject compiled_data = shared_info.GetBytecodeArray(isolate());
+  Tagged<HeapObject> compiled_data =
+      shared_info->GetBytecodeArray(heap_->isolate());
   Address compiled_data_start = compiled_data.address();
-  int compiled_data_size = ALIGN_TO_ALLOCATION_ALIGNMENT(compiled_data.Size());
+  int compiled_data_size = ALIGN_TO_ALLOCATION_ALIGNMENT(compiled_data->Size());
   MemoryChunk* chunk = MemoryChunk::FromAddress(compiled_data_start);
 
   // Clear any recorded slots for the compiled data as being invalid.
   RememberedSet<OLD_TO_NEW>::RemoveRange(
       chunk, compiled_data_start, compiled_data_start + compiled_data_size,
       SlotSet::FREE_EMPTY_BUCKETS);
+  RememberedSet<OLD_TO_NEW_BACKGROUND>::RemoveRange(
+      chunk, compiled_data_start, compiled_data_start + compiled_data_size,
+      SlotSet::FREE_EMPTY_BUCKETS);
   RememberedSet<OLD_TO_SHARED>::RemoveRange(
       chunk, compiled_data_start, compiled_data_start + compiled_data_size,
       SlotSet::FREE_EMPTY_BUCKETS);
@@ -3097,178 +2916,220 @@ void MarkCompactCollector::FlushBytecodeFromSFI(
 
   // Swap the map, using set_map_after_allocation to avoid verify heap checks
   // which are not necessary since we are doing this during the GC atomic pause.
-  compiled_data.set_map_after_allocation(
-      ReadOnlyRoots(heap()).uncompiled_data_without_preparse_data_map(),
+  compiled_data->set_map_after_allocation(
+      ReadOnlyRoots(heap_).uncompiled_data_without_preparse_data_map(),
       SKIP_WRITE_BARRIER);
 
   // Create a filler object for any left over space in the bytecode array.
-  if (!heap()->IsLargeObject(compiled_data)) {
+  if (!heap_->IsLargeObject(compiled_data)) {
     const int aligned_filler_offset =
         ALIGN_TO_ALLOCATION_ALIGNMENT(UncompiledDataWithoutPreparseData::kSize);
-    heap()->CreateFillerObjectAt(
-        compiled_data.address() + aligned_filler_offset,
-        compiled_data_size - aligned_filler_offset);
+    heap_->CreateFillerObjectAt(compiled_data.address() + aligned_filler_offset,
+                                compiled_data_size - aligned_filler_offset);
   }
 
   // Initialize the uncompiled data.
-  UncompiledData uncompiled_data = UncompiledData::cast(compiled_data);
-  uncompiled_data.InitAfterBytecodeFlush(
+  Tagged<UncompiledData> uncompiled_data = UncompiledData::cast(compiled_data);
+  uncompiled_data->InitAfterBytecodeFlush(
       inferred_name, start_position, end_position,
-      [](HeapObject object, ObjectSlot slot, HeapObject target) {
-        RecordSlot(object, slot, target);
-      });
+      [](Tagged<HeapObject> object, ObjectSlot slot,
+         Tagged<HeapObject> target) { RecordSlot(object, slot, target); });
 
   // Mark the uncompiled data as black, and ensure all fields have already been
   // marked.
   DCHECK(!ShouldMarkObject(inferred_name) ||
-         marking_state()->IsBlackOrGrey(inferred_name));
-  marking_state()->TryMarkAndAccountLiveBytes(uncompiled_data);
+         marking_state_->IsMarked(inferred_name));
+  marking_state_->TryMarkAndAccountLiveBytes(uncompiled_data);
 
   // Use the raw function data setter to avoid validity checks, since we're
   // performing the unusual task of decompiling.
-  shared_info.set_function_data(uncompiled_data, kReleaseStore);
-  DCHECK(!shared_info.is_compiled());
+  shared_info->set_function_data(uncompiled_data, kReleaseStore);
+  DCHECK(!shared_info->is_compiled());
 }
 
 void MarkCompactCollector::ProcessOldCodeCandidates() {
   DCHECK(v8_flags.flush_bytecode || v8_flags.flush_baseline_code ||
          weak_objects_.code_flushing_candidates.IsEmpty());
-  SharedFunctionInfo flushing_candidate;
+  Tagged<SharedFunctionInfo> flushing_candidate;
+  int number_of_flushed_sfis = 0;
   while (local_weak_objects()->code_flushing_candidates_local.Pop(
       &flushing_candidate)) {
-    Code baseline_code;
-    InstructionStream baseline_istream;
-    HeapObject baseline_bytecode_or_interpreter_data;
-    if (v8_flags.flush_baseline_code && flushing_candidate.HasBaselineCode()) {
-      baseline_code =
-          Code::cast(flushing_candidate.function_data(kAcquireLoad));
-      // Safe to do a relaxed load here since the Code was
-      // acquire-loaded.
-      baseline_istream = FromCode(baseline_code, isolate(), kRelaxedLoad);
-      baseline_bytecode_or_interpreter_data =
-          baseline_code.bytecode_or_interpreter_data();
-    }
-    // During flushing a BytecodeArray is transformed into an UncompiledData in
-    // place. Seeing an UncompiledData here implies that another
-    // SharedFunctionInfo had a reference to the same BytecodeArray and flushed
-    // it before processing this candidate. This can happen when using
-    // CloneSharedFunctionInfo().
-    bool bytecode_already_decompiled =
-        flushing_candidate.function_data(isolate(), kAcquireLoad)
-            .IsUncompiledData(isolate()) ||
-        (!baseline_istream.is_null() &&
-         baseline_bytecode_or_interpreter_data.IsUncompiledData(isolate()));
-    bool is_bytecode_live = !bytecode_already_decompiled &&
-                            non_atomic_marking_state()->IsBlackOrGrey(
-                                flushing_candidate.GetBytecodeArray(isolate()));
-    if (!baseline_istream.is_null()) {
-      if (non_atomic_marking_state()->IsBlackOrGrey(baseline_istream)) {
-        // Currently baseline code holds bytecode array strongly and it is
-        // always ensured that bytecode is live if baseline code is live. Hence
-        // baseline code can safely load bytecode array without any additional
-        // checks. In future if this changes we need to update these checks to
-        // flush code if the bytecode is not live and also update baseline code
-        // to bailout if there is no bytecode.
-        DCHECK(is_bytecode_live);
-
-        // Regardless of whether the Code is a Code or
-        // the InstructionStream itself, if the InstructionStream is live then
-        // the Code has to be live and will have been marked via
-        // the owning JSFunction.
-        DCHECK(non_atomic_marking_state()->IsBlackOrGrey(baseline_code));
-      } else if (is_bytecode_live || bytecode_already_decompiled) {
-        // Reset the function_data field to the BytecodeArray, InterpreterData,
-        // or UncompiledData found on the baseline code. We can skip this step
-        // if the BytecodeArray is not live and not already decompiled, because
-        // FlushBytecodeFromSFI below will set the function_data field.
-        flushing_candidate.set_function_data(
-            baseline_bytecode_or_interpreter_data, kReleaseStore);
-      }
+    bool is_bytecode_live;
+    if (v8_flags.flush_baseline_code && flushing_candidate->HasBaselineCode()) {
+      is_bytecode_live = ProcessOldBaselineSFI(flushing_candidate);
+    } else {
+      is_bytecode_live = ProcessOldBytecodeSFI(flushing_candidate);
     }
 
-    if (!is_bytecode_live) {
-      // If baseline code flushing is disabled we should only flush bytecode
-      // from functions that don't have baseline data.
-      DCHECK(v8_flags.flush_baseline_code ||
-             !flushing_candidate.HasBaselineCode());
-
-      if (bytecode_already_decompiled) {
-        flushing_candidate.DiscardCompiledMetadata(
-            isolate(),
-            [](HeapObject object, ObjectSlot slot, HeapObject target) {
-              RecordSlot(object, slot, target);
-            });
-      } else {
-        // If the BytecodeArray is dead, flush it, which will replace the field
-        // with an uncompiled data object.
-        FlushBytecodeFromSFI(flushing_candidate);
-      }
-    }
+    if (!is_bytecode_live) number_of_flushed_sfis++;
 
     // Now record the slot, which has either been updated to an uncompiled data,
     // Baseline code or BytecodeArray which is still alive.
     ObjectSlot slot =
-        flushing_candidate.RawField(SharedFunctionInfo::kFunctionDataOffset);
+        flushing_candidate->RawField(SharedFunctionInfo::kFunctionDataOffset);
     RecordSlot(flushing_candidate, slot, HeapObject::cast(*slot));
   }
+
+  if (v8_flags.trace_flush_code) {
+    PrintIsolate(heap_->isolate(), "%d flushed SharedFunctionInfo(s)\n",
+                 number_of_flushed_sfis);
+  }
+}
+
+bool MarkCompactCollector::ProcessOldBytecodeSFI(
+    Tagged<SharedFunctionInfo> flushing_candidate) {
+  // During flushing a BytecodeArray is transformed into an UncompiledData
+  // in place. Seeing an UncompiledData here implies that another
+  // SharedFunctionInfo had a reference to the same BytecodeArray and
+  // flushed it before processing this candidate. This can happen when using
+  // CloneSharedFunctionInfo().
+  Isolate* const isolate = heap_->isolate();
+  const bool bytecode_already_decompiled = IsUncompiledData(
+      flushing_candidate->function_data(isolate, kAcquireLoad), isolate);
+  const bool is_bytecode_live =
+      !bytecode_already_decompiled &&
+      non_atomic_marking_state_->IsMarked(
+          flushing_candidate->GetBytecodeArray(isolate));
+
+  if (!is_bytecode_live) {
+    FlushSFI(flushing_candidate, bytecode_already_decompiled);
+  }
+  return is_bytecode_live;
+}
+
+bool MarkCompactCollector::ProcessOldBaselineSFI(
+    Tagged<SharedFunctionInfo> flushing_candidate) {
+  Tagged<Code> baseline_code =
+      Code::cast(flushing_candidate->function_data(kAcquireLoad));
+  // Safe to do a relaxed load here since the Code was acquire-loaded.
+  Tagged<InstructionStream> baseline_istream =
+      baseline_code->instruction_stream(baseline_code->code_cage_base(),
+                                        kRelaxedLoad);
+  Tagged<HeapObject> baseline_bytecode_or_interpreter_data =
+      baseline_code->bytecode_or_interpreter_data();
+
+  // During flushing a BytecodeArray is transformed into an UncompiledData
+  // in place. Seeing an UncompiledData here implies that another
+  // SharedFunctionInfo had a reference to the same BytecodeArray and
+  // flushed it before processing this candidate. This can happen when using
+  // CloneSharedFunctionInfo().
+  const bool bytecode_already_decompiled =
+      IsUncompiledData(baseline_bytecode_or_interpreter_data, heap_->isolate());
+  const bool is_bytecode_live =
+      !bytecode_already_decompiled &&
+      non_atomic_marking_state_->IsMarked(
+          flushing_candidate->GetBytecodeArray(heap_->isolate()));
+
+  if (non_atomic_marking_state_->IsMarked(baseline_istream)) {
+    // Currently baseline code holds bytecode array strongly and it is
+    // always ensured that bytecode is live if baseline code is live. Hence
+    // baseline code can safely load bytecode array without any additional
+    // checks. In future if this changes we need to update these checks to
+    // flush code if the bytecode is not live and also update baseline code
+    // to bailout if there is no bytecode.
+    DCHECK(is_bytecode_live);
+
+    // Regardless of whether the Code is a Code or
+    // the InstructionStream itself, if the InstructionStream is live then
+    // the Code has to be live and will have been marked via
+    // the owning JSFunction.
+    DCHECK(non_atomic_marking_state_->IsMarked(baseline_code));
+  } else if (is_bytecode_live || bytecode_already_decompiled) {
+    // Reset the function_data field to the BytecodeArray, InterpreterData,
+    // or UncompiledData found on the baseline code. We can skip this step
+    // if the BytecodeArray is not live and not already decompiled, because
+    // FlushBytecodeFromSFI below will set the function_data field.
+    flushing_candidate->set_function_data(baseline_bytecode_or_interpreter_data,
+                                          kReleaseStore);
+  }
+
+  if (!is_bytecode_live) {
+    FlushSFI(flushing_candidate, bytecode_already_decompiled);
+  }
+  return is_bytecode_live;
+}
+
+void MarkCompactCollector::FlushSFI(Tagged<SharedFunctionInfo> sfi,
+                                    bool bytecode_already_decompiled) {
+  // If baseline code flushing is disabled we should only flush bytecode
+  // from functions that don't have baseline data.
+  DCHECK(v8_flags.flush_baseline_code || !sfi->HasBaselineCode());
+
+  if (bytecode_already_decompiled) {
+    sfi->DiscardCompiledMetadata(
+        heap_->isolate(),
+        [](Tagged<HeapObject> object, ObjectSlot slot,
+           Tagged<HeapObject> target) { RecordSlot(object, slot, target); });
+  } else {
+    // If the BytecodeArray is dead, flush it, which will replace the field
+    // with an uncompiled data object.
+    FlushBytecodeFromSFI(sfi);
+  }
 }
 
 void MarkCompactCollector::ClearFlushedJsFunctions() {
   DCHECK(v8_flags.flush_bytecode ||
          weak_objects_.flushed_js_functions.IsEmpty());
-  JSFunction flushed_js_function;
+  Tagged<JSFunction> flushed_js_function;
   while (local_weak_objects()->flushed_js_functions_local.Pop(
       &flushed_js_function)) {
-    auto gc_notify_updated_slot = [](HeapObject object, ObjectSlot slot,
-                                     Object target) {
+    auto gc_notify_updated_slot = [](Tagged<HeapObject> object, ObjectSlot slot,
+                                     Tagged<Object> target) {
       RecordSlot(object, slot, HeapObject::cast(target));
     };
-    flushed_js_function.ResetIfCodeFlushed(gc_notify_updated_slot);
+    flushed_js_function->ResetIfCodeFlushed(gc_notify_updated_slot);
   }
 }
 
 void MarkCompactCollector::ProcessFlushedBaselineCandidates() {
   DCHECK(v8_flags.flush_baseline_code ||
          weak_objects_.baseline_flushing_candidates.IsEmpty());
-  JSFunction flushed_js_function;
+  Tagged<JSFunction> flushed_js_function;
   while (local_weak_objects()->baseline_flushing_candidates_local.Pop(
       &flushed_js_function)) {
-    auto gc_notify_updated_slot = [](HeapObject object, ObjectSlot slot,
-                                     Object target) {
+    auto gc_notify_updated_slot = [](Tagged<HeapObject> object, ObjectSlot slot,
+                                     Tagged<Object> target) {
       RecordSlot(object, slot, HeapObject::cast(target));
     };
-    flushed_js_function.ResetIfCodeFlushed(gc_notify_updated_slot);
+    flushed_js_function->ResetIfCodeFlushed(gc_notify_updated_slot);
 
+#ifndef V8_CODE_POINTER_SANDBOXING
     // Record the code slot that has been updated either to CompileLazy,
     // InterpreterEntryTrampoline or baseline code.
-    ObjectSlot slot = flushed_js_function.RawField(JSFunction::kCodeOffset);
+    // This is only necessary when the sandbox is not enabled. If it is, the
+    // Code objects are referenced through a pointer table indirection and so
+    // remembered slots are not necessary as the Code object will update its
+    // entry in the pointer table when it is relocated.
+    ObjectSlot slot = flushed_js_function->RawField(JSFunction::kCodeOffset);
     RecordSlot(flushed_js_function, slot, HeapObject::cast(*slot));
+#endif
   }
 }
 
 void MarkCompactCollector::ClearFullMapTransitions() {
-  TransitionArray array;
+  Tagged<TransitionArray> array;
+  Isolate* const isolate = heap_->isolate();
   while (local_weak_objects()->transition_arrays_local.Pop(&array)) {
-    int num_transitions = array.number_of_entries();
+    int num_transitions = array->number_of_entries();
     if (num_transitions > 0) {
-      Map map;
+      Tagged<Map> map;
       // The array might contain "undefined" elements because it's not yet
       // filled. Allow it.
-      if (array.GetTargetIfExists(0, isolate(), &map)) {
+      if (array->GetTargetIfExists(0, isolate, &map)) {
         DCHECK(!map.is_null());  // Weak pointers aren't cleared yet.
-        Object constructor_or_back_pointer = map.constructor_or_back_pointer();
-        if (constructor_or_back_pointer.IsSmi()) {
-          DCHECK(isolate()->has_active_deserializer());
+        Tagged<Object> constructor_or_back_pointer =
+            map->constructor_or_back_pointer();
+        if (IsSmi(constructor_or_back_pointer)) {
+          DCHECK(isolate->has_active_deserializer());
           DCHECK_EQ(constructor_or_back_pointer,
                     Smi::uninitialized_deserialization_value());
           continue;
         }
-        Map parent = Map::cast(map.constructor_or_back_pointer());
-        bool parent_is_alive =
-            non_atomic_marking_state()->IsBlackOrGrey(parent);
-        DescriptorArray descriptors =
-            parent_is_alive ? parent.instance_descriptors(isolate())
-                            : DescriptorArray();
+        Tagged<Map> parent = Map::cast(map->constructor_or_back_pointer());
+        bool parent_is_alive = non_atomic_marking_state_->IsMarked(parent);
+        Tagged<DescriptorArray> descriptors =
+            parent_is_alive ? parent->instance_descriptors(isolate)
+                            : Tagged<DescriptorArray>();
         bool descriptors_owner_died =
             CompactTransitionArray(parent, array, descriptors);
         if (descriptors_owner_died) {
@@ -3282,28 +3143,28 @@ void MarkCompactCollector::ClearFullMapTransitions() {
 // Returns false if no maps have died, or if the transition array is
 // still being deserialized.
 bool MarkCompactCollector::TransitionArrayNeedsCompaction(
-    TransitionArray transitions, int num_transitions) {
+    Tagged<TransitionArray> transitions, int num_transitions) {
   for (int i = 0; i < num_transitions; ++i) {
-    MaybeObject raw_target = transitions.GetRawTarget(i);
+    MaybeObject raw_target = transitions->GetRawTarget(i);
     if (raw_target.IsSmi()) {
       // This target is still being deserialized,
-      DCHECK(isolate()->has_active_deserializer());
+      DCHECK(heap_->isolate()->has_active_deserializer());
       DCHECK_EQ(raw_target.ToSmi(), Smi::uninitialized_deserialization_value());
 #ifdef DEBUG
       // Targets can only be dead iff this array is fully deserialized.
       for (int j = 0; j < num_transitions; ++j) {
         DCHECK_IMPLIES(
-            !transitions.GetRawTarget(j).IsSmi(),
-            !non_atomic_marking_state()->IsUnmarked(transitions.GetTarget(j)));
+            !transitions->GetRawTarget(j).IsSmi(),
+            !non_atomic_marking_state_->IsUnmarked(transitions->GetTarget(j)));
       }
 #endif
       return false;
-    } else if (non_atomic_marking_state()->IsUnmarked(
+    } else if (non_atomic_marking_state_->IsUnmarked(
                    TransitionsAccessor::GetTargetFromRaw(raw_target))) {
 #ifdef DEBUG
       // Targets can only be dead iff this array is fully deserialized.
       for (int j = 0; j < num_transitions; ++j) {
-        DCHECK(!transitions.GetRawTarget(j).IsSmi());
+        DCHECK(!transitions->GetRawTarget(j).IsSmi());
       }
 #endif
       return true;
@@ -3312,11 +3173,11 @@ bool MarkCompactCollector::TransitionArrayNeedsCompaction(
   return false;
 }
 
-bool MarkCompactCollector::CompactTransitionArray(Map map,
-                                                  TransitionArray transitions,
-                                                  DescriptorArray descriptors) {
-  DCHECK(!map.is_prototype_map());
-  int num_transitions = transitions.number_of_entries();
+bool MarkCompactCollector::CompactTransitionArray(
+    Tagged<Map> map, Tagged<TransitionArray> transitions,
+    Tagged<DescriptorArray> descriptors) {
+  DCHECK(!map->is_prototype_map());
+  int num_transitions = transitions->number_of_entries();
   if (!TransitionArrayNeedsCompaction(transitions, num_transitions)) {
     return false;
   }
@@ -3324,25 +3185,25 @@ bool MarkCompactCollector::CompactTransitionArray(Map map,
   int transition_index = 0;
   // Compact all live transitions to the left.
   for (int i = 0; i < num_transitions; ++i) {
-    Map target = transitions.GetTarget(i);
-    DCHECK_EQ(target.constructor_or_back_pointer(), map);
-    if (non_atomic_marking_state()->IsUnmarked(target)) {
+    Tagged<Map> target = transitions->GetTarget(i);
+    DCHECK_EQ(target->constructor_or_back_pointer(), map);
+    if (non_atomic_marking_state_->IsUnmarked(target)) {
       if (!descriptors.is_null() &&
-          target.instance_descriptors(isolate()) == descriptors) {
-        DCHECK(!target.is_prototype_map());
+          target->instance_descriptors(heap_->isolate()) == descriptors) {
+        DCHECK(!target->is_prototype_map());
         descriptors_owner_died = true;
       }
     } else {
       if (i != transition_index) {
-        Name key = transitions.GetKey(i);
-        transitions.SetKey(transition_index, key);
-        HeapObjectSlot key_slot = transitions.GetKeySlot(transition_index);
+        Tagged<Name> key = transitions->GetKey(i);
+        transitions->SetKey(transition_index, key);
+        HeapObjectSlot key_slot = transitions->GetKeySlot(transition_index);
         RecordSlot(transitions, key_slot, key);
-        MaybeObject raw_target = transitions.GetRawTarget(i);
-        transitions.SetRawTarget(transition_index, raw_target);
+        MaybeObject raw_target = transitions->GetRawTarget(i);
+        transitions->SetRawTarget(transition_index, raw_target);
         HeapObjectSlot target_slot =
-            transitions.GetTargetSlot(transition_index);
-        RecordSlot(transitions, target_slot, raw_target->GetHeapObject());
+            transitions->GetTargetSlot(transition_index);
+        RecordSlot(transitions, target_slot, raw_target.GetHeapObject());
       }
       transition_index++;
     }
@@ -3356,26 +3217,28 @@ bool MarkCompactCollector::CompactTransitionArray(Map map,
   // such that number_of_transitions() == 0. If this assumption changes,
   // TransitionArray::Insert() will need to deal with the case that a transition
   // array disappeared during GC.
-  int trim = transitions.Capacity() - transition_index;
+  int trim = transitions->Capacity() - transition_index;
   if (trim > 0) {
     heap_->RightTrimWeakFixedArray(transitions,
                                    trim * TransitionArray::kEntrySize);
-    transitions.SetNumberOfTransitions(transition_index);
+    transitions->SetNumberOfTransitions(transition_index);
   }
   return descriptors_owner_died;
 }
 
-void MarkCompactCollector::RightTrimDescriptorArray(DescriptorArray array,
-                                                    int descriptors_to_trim) {
-  int old_nof_all_descriptors = array.number_of_all_descriptors();
+void MarkCompactCollector::RightTrimDescriptorArray(
+    Tagged<DescriptorArray> array, int descriptors_to_trim) {
+  int old_nof_all_descriptors = array->number_of_all_descriptors();
   int new_nof_all_descriptors = old_nof_all_descriptors - descriptors_to_trim;
   DCHECK_LT(0, descriptors_to_trim);
   DCHECK_LE(0, new_nof_all_descriptors);
-  Address start = array.GetDescriptorSlot(new_nof_all_descriptors).address();
-  Address end = array.GetDescriptorSlot(old_nof_all_descriptors).address();
+  Address start = array->GetDescriptorSlot(new_nof_all_descriptors).address();
+  Address end = array->GetDescriptorSlot(old_nof_all_descriptors).address();
   MemoryChunk* chunk = MemoryChunk::FromHeapObject(array);
   RememberedSet<OLD_TO_NEW>::RemoveRange(chunk, start, end,
                                          SlotSet::FREE_EMPTY_BUCKETS);
+  RememberedSet<OLD_TO_NEW_BACKGROUND>::RemoveRange(
+      chunk, start, end, SlotSet::FREE_EMPTY_BUCKETS);
   RememberedSet<OLD_TO_SHARED>::RemoveRange(chunk, start, end,
                                             SlotSet::FREE_EMPTY_BUCKETS);
   RememberedSet<OLD_TO_OLD>::RemoveRange(chunk, start, end,
@@ -3384,108 +3247,109 @@ void MarkCompactCollector::RightTrimDescriptorArray(DescriptorArray array,
     Address aligned_start = ALIGN_TO_ALLOCATION_ALIGNMENT(start);
     Address aligned_end = ALIGN_TO_ALLOCATION_ALIGNMENT(end);
     if (aligned_start < aligned_end) {
-      heap()->CreateFillerObjectAt(
+      heap_->CreateFillerObjectAt(
           aligned_start, static_cast<int>(aligned_end - aligned_start));
     }
-    if (Heap::ShouldZapGarbage()) {
+    if (heap::ShouldZapGarbage()) {
       Address zap_end = std::min(aligned_start, end);
       MemsetTagged(ObjectSlot(start), Object(static_cast<Address>(kZapValue)),
                    (zap_end - start) >> kTaggedSizeLog2);
     }
   } else {
-    heap()->CreateFillerObjectAt(start, static_cast<int>(end - start));
+    heap_->CreateFillerObjectAt(start, static_cast<int>(end - start));
   }
-  array.set_number_of_all_descriptors(new_nof_all_descriptors);
+  array->set_number_of_all_descriptors(new_nof_all_descriptors);
 }
 
 void MarkCompactCollector::RecordStrongDescriptorArraysForWeakening(
     GlobalHandleVector<DescriptorArray> strong_descriptor_arrays) {
-  DCHECK(heap()->incremental_marking()->IsMajorMarking());
+  DCHECK(heap_->incremental_marking()->IsMajorMarking());
   base::MutexGuard guard(&strong_descriptor_arrays_mutex_);
   strong_descriptor_arrays_.push_back(std::move(strong_descriptor_arrays));
 }
 
 void MarkCompactCollector::WeakenStrongDescriptorArrays() {
-  Map descriptor_array_map = ReadOnlyRoots(isolate()).descriptor_array_map();
+  Tagged<Map> descriptor_array_map =
+      ReadOnlyRoots(heap_->isolate()).descriptor_array_map();
   for (auto vec : strong_descriptor_arrays_) {
     for (auto it = vec.begin(); it != vec.end(); ++it) {
-      DescriptorArray raw = it.raw();
-      DCHECK(raw.IsStrongDescriptorArray());
-      raw.set_map_safe_transition_no_write_barrier(descriptor_array_map);
-      DCHECK_EQ(raw.raw_gc_state(kRelaxedLoad), 0);
+      Tagged<DescriptorArray> raw = it.raw();
+      DCHECK(IsStrongDescriptorArray(raw));
+      raw->set_map_safe_transition_no_write_barrier(descriptor_array_map);
+      DCHECK_EQ(raw->raw_gc_state(kRelaxedLoad), 0);
     }
   }
   strong_descriptor_arrays_.clear();
 }
 
-void MarkCompactCollector::TrimDescriptorArray(Map map,
-                                               DescriptorArray descriptors) {
-  int number_of_own_descriptors = map.NumberOfOwnDescriptors();
+void MarkCompactCollector::TrimDescriptorArray(
+    Tagged<Map> map, Tagged<DescriptorArray> descriptors) {
+  int number_of_own_descriptors = map->NumberOfOwnDescriptors();
   if (number_of_own_descriptors == 0) {
     DCHECK(descriptors == ReadOnlyRoots(heap_).empty_descriptor_array());
     return;
   }
   int to_trim =
-      descriptors.number_of_all_descriptors() - number_of_own_descriptors;
+      descriptors->number_of_all_descriptors() - number_of_own_descriptors;
   if (to_trim > 0) {
-    descriptors.set_number_of_descriptors(number_of_own_descriptors);
+    descriptors->set_number_of_descriptors(number_of_own_descriptors);
     RightTrimDescriptorArray(descriptors, to_trim);
 
     TrimEnumCache(map, descriptors);
-    descriptors.Sort();
+    descriptors->Sort();
   }
-  DCHECK(descriptors.number_of_descriptors() == number_of_own_descriptors);
-  map.set_owns_descriptors(true);
+  DCHECK(descriptors->number_of_descriptors() == number_of_own_descriptors);
+  map->set_owns_descriptors(true);
 }
 
-void MarkCompactCollector::TrimEnumCache(Map map, DescriptorArray descriptors) {
-  int live_enum = map.EnumLength();
+void MarkCompactCollector::TrimEnumCache(Tagged<Map> map,
+                                         Tagged<DescriptorArray> descriptors) {
+  int live_enum = map->EnumLength();
   if (live_enum == kInvalidEnumCacheSentinel) {
-    live_enum = map.NumberOfEnumerableProperties();
+    live_enum = map->NumberOfEnumerableProperties();
   }
-  if (live_enum == 0) return descriptors.ClearEnumCache();
-  EnumCache enum_cache = descriptors.enum_cache();
+  if (live_enum == 0) return descriptors->ClearEnumCache();
+  Tagged<EnumCache> enum_cache = descriptors->enum_cache();
 
-  FixedArray keys = enum_cache.keys();
-  int to_trim = keys.length() - live_enum;
+  Tagged<FixedArray> keys = enum_cache->keys();
+  int to_trim = keys->length() - live_enum;
   if (to_trim <= 0) return;
   heap_->RightTrimFixedArray(keys, to_trim);
 
-  FixedArray indices = enum_cache.indices();
-  to_trim = indices.length() - live_enum;
+  Tagged<FixedArray> indices = enum_cache->indices();
+  to_trim = indices->length() - live_enum;
   if (to_trim <= 0) return;
   heap_->RightTrimFixedArray(indices, to_trim);
 }
 
 void MarkCompactCollector::ClearWeakCollections() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_COLLECTIONS);
-  EphemeronHashTable table;
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_COLLECTIONS);
+  Tagged<EphemeronHashTable> table;
   while (local_weak_objects()->ephemeron_hash_tables_local.Pop(&table)) {
-    for (InternalIndex i : table.IterateEntries()) {
-      HeapObject key = HeapObject::cast(table.KeyAt(i));
+    for (InternalIndex i : table->IterateEntries()) {
+      Tagged<HeapObject> key = HeapObject::cast(table->KeyAt(i));
 #ifdef VERIFY_HEAP
       if (v8_flags.verify_heap) {
-        Object value = table.ValueAt(i);
-        if (value.IsHeapObject()) {
-          HeapObject heap_object = HeapObject::cast(value);
-          CHECK_IMPLIES(
-              !ShouldMarkObject(key) ||
-                  non_atomic_marking_state()->IsBlackOrGrey(key),
-              !ShouldMarkObject(heap_object) ||
-                  non_atomic_marking_state()->IsBlackOrGrey(heap_object));
+        Tagged<Object> value = table->ValueAt(i);
+        if (IsHeapObject(value)) {
+          Tagged<HeapObject> heap_object = HeapObject::cast(value);
+          CHECK_IMPLIES(!ShouldMarkObject(key) ||
+                            non_atomic_marking_state_->IsMarked(key),
+                        !ShouldMarkObject(heap_object) ||
+                            non_atomic_marking_state_->IsMarked(heap_object));
         }
       }
 #endif  // VERIFY_HEAP
       if (!ShouldMarkObject(key)) continue;
-      if (!non_atomic_marking_state()->IsBlackOrGrey(key)) {
-        table.RemoveEntry(i);
+      if (!non_atomic_marking_state_->IsMarked(key)) {
+        table->RemoveEntry(i);
       }
     }
   }
-  for (auto it = heap_->ephemeron_remembered_set_.begin();
-       it != heap_->ephemeron_remembered_set_.end();) {
-    if (!non_atomic_marking_state()->IsBlackOrGrey(it->first)) {
-      it = heap_->ephemeron_remembered_set_.erase(it);
+  auto* table_map = heap_->ephemeron_remembered_set()->tables();
+  for (auto it = table_map->begin(); it != table_map->end();) {
+    if (!non_atomic_marking_state_->IsMarked(it->first)) {
+      it = table_map->erase(it);
     } else {
       ++it;
     }
@@ -3493,23 +3357,23 @@ void MarkCompactCollector::ClearWeakCollections() {
 }
 
 void MarkCompactCollector::ClearWeakReferences() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_REFERENCES);
-  std::pair<HeapObject, HeapObjectSlot> slot;
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_CLEAR_WEAK_REFERENCES);
+  HeapObjectAndSlot slot;
   HeapObjectReference cleared_weak_ref =
-      HeapObjectReference::ClearedValue(isolate());
+      HeapObjectReference::ClearedValue(heap_->isolate());
   while (local_weak_objects()->weak_references_local.Pop(&slot)) {
-    HeapObject value;
+    Tagged<HeapObject> value;
     // The slot could have been overwritten, so we have to treat it
     // as MaybeObjectSlot.
     MaybeObjectSlot location(slot.second);
-    if ((*location)->GetHeapObjectIfWeak(&value)) {
-      DCHECK(!value.IsCell());
+    if ((*location).GetHeapObjectIfWeak(&value)) {
+      DCHECK(!IsCell(value));
       if (value.InReadOnlySpace() ||
-          non_atomic_marking_state()->IsBlackOrGrey(value)) {
+          non_atomic_marking_state_->IsMarked(value)) {
         // The value of the weak reference is alive.
         RecordSlot(slot.first, HeapObjectSlot(location), value);
       } else {
-        if (value.IsMap()) {
+        if (IsMap(value)) {
           // The map is non-live.
           ClearPotentialSimpleMapTransition(Map::cast(value));
         }
@@ -3520,71 +3384,72 @@ void MarkCompactCollector::ClearWeakReferences() {
 }
 
 void MarkCompactCollector::ClearJSWeakRefs() {
-  JSWeakRef weak_ref;
+  Tagged<JSWeakRef> weak_ref;
+  Isolate* const isolate = heap_->isolate();
   while (local_weak_objects()->js_weak_refs_local.Pop(&weak_ref)) {
-    HeapObject target = HeapObject::cast(weak_ref.target());
+    Tagged<HeapObject> target = HeapObject::cast(weak_ref->target());
     if (!target.InReadOnlySpace() &&
-        !non_atomic_marking_state()->IsBlackOrGrey(target)) {
-      weak_ref.set_target(ReadOnlyRoots(isolate()).undefined_value());
+        !non_atomic_marking_state_->IsMarked(target)) {
+      weak_ref->set_target(ReadOnlyRoots(isolate).undefined_value());
     } else {
       // The value of the JSWeakRef is alive.
-      ObjectSlot slot = weak_ref.RawField(JSWeakRef::kTargetOffset);
+      ObjectSlot slot = weak_ref->RawField(JSWeakRef::kTargetOffset);
       RecordSlot(weak_ref, slot, target);
     }
   }
-  WeakCell weak_cell;
+  Tagged<WeakCell> weak_cell;
   while (local_weak_objects()->weak_cells_local.Pop(&weak_cell)) {
-    auto gc_notify_updated_slot = [](HeapObject object, ObjectSlot slot,
-                                     Object target) {
-      if (target.IsHeapObject()) {
+    auto gc_notify_updated_slot = [](Tagged<HeapObject> object, ObjectSlot slot,
+                                     Tagged<Object> target) {
+      if (IsHeapObject(target)) {
         RecordSlot(object, slot, HeapObject::cast(target));
       }
     };
-    HeapObject target = HeapObject::cast(weak_cell.target());
+    Tagged<HeapObject> target = HeapObject::cast(weak_cell->target());
     if (!target.InReadOnlySpace() &&
-        !non_atomic_marking_state()->IsBlackOrGrey(target)) {
-      DCHECK(target.CanBeHeldWeakly());
+        !non_atomic_marking_state_->IsMarked(target)) {
+      DCHECK(Object::CanBeHeldWeakly(target));
       // The value of the WeakCell is dead.
-      JSFinalizationRegistry finalization_registry =
-          JSFinalizationRegistry::cast(weak_cell.finalization_registry());
-      if (!finalization_registry.scheduled_for_cleanup()) {
-        heap()->EnqueueDirtyJSFinalizationRegistry(finalization_registry,
-                                                   gc_notify_updated_slot);
+      Tagged<JSFinalizationRegistry> finalization_registry =
+          JSFinalizationRegistry::cast(weak_cell->finalization_registry());
+      if (!finalization_registry->scheduled_for_cleanup()) {
+        heap_->EnqueueDirtyJSFinalizationRegistry(finalization_registry,
+                                                  gc_notify_updated_slot);
       }
       // We're modifying the pointers in WeakCell and JSFinalizationRegistry
       // during GC; thus we need to record the slots it writes. The normal write
       // barrier is not enough, since it's disabled before GC.
-      weak_cell.Nullify(isolate(), gc_notify_updated_slot);
-      DCHECK(finalization_registry.NeedsCleanup());
-      DCHECK(finalization_registry.scheduled_for_cleanup());
+      weak_cell->Nullify(isolate, gc_notify_updated_slot);
+      DCHECK(finalization_registry->NeedsCleanup());
+      DCHECK(finalization_registry->scheduled_for_cleanup());
     } else {
       // The value of the WeakCell is alive.
-      ObjectSlot slot = weak_cell.RawField(WeakCell::kTargetOffset);
+      ObjectSlot slot = weak_cell->RawField(WeakCell::kTargetOffset);
       RecordSlot(weak_cell, slot, HeapObject::cast(*slot));
     }
 
-    HeapObject unregister_token = weak_cell.unregister_token();
+    Tagged<HeapObject> unregister_token = weak_cell->unregister_token();
     if (!unregister_token.InReadOnlySpace() &&
-        !non_atomic_marking_state()->IsBlackOrGrey(unregister_token)) {
-      DCHECK(unregister_token.CanBeHeldWeakly());
+        !non_atomic_marking_state_->IsMarked(unregister_token)) {
+      DCHECK(Object::CanBeHeldWeakly(unregister_token));
       // The unregister token is dead. Remove any corresponding entries in the
       // key map. Multiple WeakCell with the same token will have all their
       // unregister_token field set to undefined when processing the first
       // WeakCell. Like above, we're modifying pointers during GC, so record the
       // slots.
-      JSFinalizationRegistry finalization_registry =
-          JSFinalizationRegistry::cast(weak_cell.finalization_registry());
-      finalization_registry.RemoveUnregisterToken(
-          unregister_token, isolate(),
+      Tagged<JSFinalizationRegistry> finalization_registry =
+          JSFinalizationRegistry::cast(weak_cell->finalization_registry());
+      finalization_registry->RemoveUnregisterToken(
+          unregister_token, isolate,
           JSFinalizationRegistry::kKeepMatchedCellsInRegistry,
           gc_notify_updated_slot);
     } else {
       // The unregister_token is alive.
-      ObjectSlot slot = weak_cell.RawField(WeakCell::kUnregisterTokenOffset);
+      ObjectSlot slot = weak_cell->RawField(WeakCell::kUnregisterTokenOffset);
       RecordSlot(weak_cell, slot, HeapObject::cast(*slot));
     }
   }
-  heap()->PostFinalizationRegistryCleanupTaskIfNeeded();
+  heap_->PostFinalizationRegistryCleanupTaskIfNeeded();
 }
 
 bool MarkCompactCollector::IsOnEvacuationCandidate(MaybeObject obj) {
@@ -3592,10 +3457,10 @@ bool MarkCompactCollector::IsOnEvacuationCandidate(MaybeObject obj) {
 }
 
 // static
-bool MarkCompactCollector::ShouldRecordRelocSlot(RelocInfo* rinfo,
-                                                 HeapObject target) {
-  MemoryChunk* source_chunk =
-      MemoryChunk::FromHeapObject(rinfo->instruction_stream());
+bool MarkCompactCollector::ShouldRecordRelocSlot(Tagged<InstructionStream> host,
+                                                 RelocInfo* rinfo,
+                                                 Tagged<HeapObject> target) {
+  MemoryChunk* source_chunk = MemoryChunk::FromHeapObject(host);
   BasicMemoryChunk* target_chunk = BasicMemoryChunk::FromHeapObject(target);
   return target_chunk->IsEvacuationCandidate() &&
          !source_chunk->ShouldSkipEvacuationSlotRecording();
@@ -3603,7 +3468,9 @@ bool MarkCompactCollector::ShouldRecordRelocSlot(RelocInfo* rinfo,
 
 // static
 MarkCompactCollector::RecordRelocSlotInfo
-MarkCompactCollector::ProcessRelocInfo(RelocInfo* rinfo, HeapObject target) {
+MarkCompactCollector::ProcessRelocInfo(Tagged<InstructionStream> host,
+                                       RelocInfo* rinfo,
+                                       Tagged<HeapObject> target) {
   RecordRelocSlotInfo result;
   const RelocInfo::Mode rmode = rinfo->rmode();
   Address addr;
@@ -3633,8 +3500,7 @@ MarkCompactCollector::ProcessRelocInfo(RelocInfo* rinfo, HeapObject target) {
     }
   }
 
-  MemoryChunk* const source_chunk =
-      MemoryChunk::FromHeapObject(rinfo->instruction_stream());
+  MemoryChunk* const source_chunk = MemoryChunk::FromHeapObject(host);
   const uintptr_t offset = addr - source_chunk->address();
   DCHECK_LT(offset, static_cast<uintptr_t>(TypedSlotSet::kMaxOffset));
   result.memory_chunk = source_chunk;
@@ -3645,10 +3511,11 @@ MarkCompactCollector::ProcessRelocInfo(RelocInfo* rinfo, HeapObject target) {
 }
 
 // static
-void MarkCompactCollector::RecordRelocSlot(RelocInfo* rinfo,
-                                           HeapObject target) {
-  if (!ShouldRecordRelocSlot(rinfo, target)) return;
-  RecordRelocSlotInfo info = ProcessRelocInfo(rinfo, target);
+void MarkCompactCollector::RecordRelocSlot(Tagged<InstructionStream> host,
+                                           RelocInfo* rinfo,
+                                           Tagged<HeapObject> target) {
+  if (!ShouldRecordRelocSlot(host, rinfo, target)) return;
+  RecordRelocSlotInfo info = ProcessRelocInfo(host, rinfo, target);
 
   // Access to TypeSlots need to be protected, since LocalHeaps might
   // publish code in the background thread.
@@ -3665,49 +3532,51 @@ namespace {
 // Missing specialization MakeSlotValue<FullObjectSlot, WEAK>() will turn
 // attempt to store a weak reference to strong-only slot to a compilation error.
 template <typename TSlot, HeapObjectReferenceType reference_type>
-typename TSlot::TObject MakeSlotValue(HeapObject heap_object);
+typename TSlot::TObject MakeSlotValue(Tagged<HeapObject> heap_object);
 
 template <>
-Object MakeSlotValue<ObjectSlot, HeapObjectReferenceType::STRONG>(
-    HeapObject heap_object) {
+Tagged<Object> MakeSlotValue<ObjectSlot, HeapObjectReferenceType::STRONG>(
+    Tagged<HeapObject> heap_object) {
   return heap_object;
 }
 
 template <>
 MaybeObject MakeSlotValue<MaybeObjectSlot, HeapObjectReferenceType::STRONG>(
-    HeapObject heap_object) {
+    Tagged<HeapObject> heap_object) {
   return HeapObjectReference::Strong(heap_object);
 }
 
 template <>
 MaybeObject MakeSlotValue<MaybeObjectSlot, HeapObjectReferenceType::WEAK>(
-    HeapObject heap_object) {
+    Tagged<HeapObject> heap_object) {
   return HeapObjectReference::Weak(heap_object);
 }
 
 template <>
-Object MakeSlotValue<OffHeapObjectSlot, HeapObjectReferenceType::STRONG>(
-    HeapObject heap_object) {
+Tagged<Object>
+MakeSlotValue<OffHeapObjectSlot, HeapObjectReferenceType::STRONG>(
+    Tagged<HeapObject> heap_object) {
   return heap_object;
 }
 
 #ifdef V8_COMPRESS_POINTERS
 template <>
-Object MakeSlotValue<FullObjectSlot, HeapObjectReferenceType::STRONG>(
-    HeapObject heap_object) {
+Tagged<Object> MakeSlotValue<FullObjectSlot, HeapObjectReferenceType::STRONG>(
+    Tagged<HeapObject> heap_object) {
   return heap_object;
 }
 
 template <>
 MaybeObject MakeSlotValue<FullMaybeObjectSlot, HeapObjectReferenceType::STRONG>(
-    HeapObject heap_object) {
+    Tagged<HeapObject> heap_object) {
   return HeapObjectReference::Strong(heap_object);
 }
 
 #ifdef V8_EXTERNAL_CODE_SPACE
 template <>
-Object MakeSlotValue<CodeObjectSlot, HeapObjectReferenceType::STRONG>(
-    HeapObject heap_object) {
+Tagged<Object>
+MakeSlotValue<InstructionStreamSlot, HeapObjectReferenceType::STRONG>(
+    Tagged<HeapObject> heap_object) {
   return heap_object;
 }
 #endif  // V8_EXTERNAL_CODE_SPACE
@@ -3721,18 +3590,18 @@ template <AccessMode access_mode, HeapObjectReferenceType reference_type,
           typename TSlot>
 static inline void UpdateSlot(PtrComprCageBase cage_base, TSlot slot,
                               typename TSlot::TObject old,
-                              HeapObject heap_obj) {
+                              Tagged<HeapObject> heap_obj) {
   static_assert(std::is_same<TSlot, FullObjectSlot>::value ||
                     std::is_same<TSlot, ObjectSlot>::value ||
                     std::is_same<TSlot, FullMaybeObjectSlot>::value ||
                     std::is_same<TSlot, MaybeObjectSlot>::value ||
                     std::is_same<TSlot, OffHeapObjectSlot>::value ||
-                    std::is_same<TSlot, CodeObjectSlot>::value,
+                    std::is_same<TSlot, InstructionStreamSlot>::value,
                 "Only [Full|OffHeap]ObjectSlot, [Full]MaybeObjectSlot "
-                "or CodeObjectSlot are expected here");
-  MapWord map_word = heap_obj.map_word(cage_base, kRelaxedLoad);
+                "or InstructionStreamSlot are expected here");
+  MapWord map_word = heap_obj->map_word(cage_base, kRelaxedLoad);
   if (map_word.IsForwardingAddress()) {
-    DCHECK_IMPLIES((!v8_flags.minor_mc && !Heap::InFromPage(heap_obj)),
+    DCHECK_IMPLIES((!v8_flags.minor_ms && !Heap::InFromPage(heap_obj)),
                    MarkCompactCollector::IsOnEvacuationCandidate(heap_obj) ||
                        Page::FromHeapObject(heap_obj)->IsFlagSet(
                            Page::COMPACTION_WAS_ABORTED));
@@ -3749,18 +3618,18 @@ static inline void UpdateSlot(PtrComprCageBase cage_base, TSlot slot,
     DCHECK(!Heap::InFromPage(target));
     DCHECK(!MarkCompactCollector::IsOnEvacuationCandidate(target));
   } else {
-    DCHECK(MarkCompactCollector::IsMapOrForwarded(map_word.ToMap()));
+    DCHECK(MapWord::IsMapOrForwarded(map_word.ToMap()));
   }
 }
 
 template <AccessMode access_mode, typename TSlot>
 static inline void UpdateSlot(PtrComprCageBase cage_base, TSlot slot) {
   typename TSlot::TObject obj = slot.Relaxed_Load(cage_base);
-  HeapObject heap_obj;
-  if (TSlot::kCanBeWeak && obj->GetHeapObjectIfWeak(&heap_obj)) {
+  Tagged<HeapObject> heap_obj;
+  if (TSlot::kCanBeWeak && obj.GetHeapObjectIfWeak(&heap_obj)) {
     UpdateSlot<access_mode, HeapObjectReferenceType::WEAK>(cage_base, slot, obj,
                                                            heap_obj);
-  } else if (obj->GetHeapObjectIfStrong(&heap_obj)) {
+  } else if (obj.GetHeapObjectIfStrong(&heap_obj)) {
     UpdateSlot<access_mode, HeapObjectReferenceType::STRONG>(cage_base, slot,
                                                              obj, heap_obj);
   }
@@ -3769,7 +3638,7 @@ static inline void UpdateSlot(PtrComprCageBase cage_base, TSlot slot) {
 static inline SlotCallbackResult UpdateOldToSharedSlot(
     PtrComprCageBase cage_base, MaybeObjectSlot slot) {
   MaybeObject obj = slot.Relaxed_Load(cage_base);
-  HeapObject heap_obj;
+  Tagged<HeapObject> heap_obj;
 
   if (obj.GetHeapObject(&heap_obj)) {
     if (obj.IsWeak()) {
@@ -3790,7 +3659,7 @@ template <AccessMode access_mode, typename TSlot>
 static inline void UpdateStrongSlot(PtrComprCageBase cage_base, TSlot slot) {
   typename TSlot::TObject obj = slot.Relaxed_Load(cage_base);
   DCHECK(!HAS_WEAK_HEAP_OBJECT_TAG(obj.ptr()));
-  HeapObject heap_obj;
+  Tagged<HeapObject> heap_obj;
   if (obj.GetHeapObject(&heap_obj)) {
     UpdateSlot<access_mode, HeapObjectReferenceType::STRONG>(cage_base, slot,
                                                              obj, heap_obj);
@@ -3801,7 +3670,7 @@ static inline SlotCallbackResult UpdateStrongOldToSharedSlot(
     PtrComprCageBase cage_base, FullMaybeObjectSlot slot) {
   MaybeObject obj = slot.Relaxed_Load(cage_base);
   DCHECK(!HAS_WEAK_HEAP_OBJECT_TAG(obj.ptr()));
-  HeapObject heap_obj;
+  Tagged<HeapObject> heap_obj;
   if (obj.GetHeapObject(&heap_obj)) {
     UpdateSlot<AccessMode::NON_ATOMIC, HeapObjectReferenceType::STRONG>(
         cage_base, slot, obj, heap_obj);
@@ -3812,23 +3681,23 @@ static inline SlotCallbackResult UpdateStrongOldToSharedSlot(
 }
 
 template <AccessMode access_mode>
-static inline void UpdateStrongCodeSlot(HeapObject host,
+static inline void UpdateStrongCodeSlot(Tagged<HeapObject> host,
                                         PtrComprCageBase cage_base,
                                         PtrComprCageBase code_cage_base,
-                                        CodeObjectSlot slot) {
-  Object obj = slot.Relaxed_Load(code_cage_base);
+                                        InstructionStreamSlot slot) {
+  Tagged<Object> obj = slot.Relaxed_Load(code_cage_base);
   DCHECK(!HAS_WEAK_HEAP_OBJECT_TAG(obj.ptr()));
-  HeapObject heap_obj;
+  Tagged<HeapObject> heap_obj;
   if (obj.GetHeapObject(&heap_obj)) {
     UpdateSlot<access_mode, HeapObjectReferenceType::STRONG>(cage_base, slot,
                                                              obj, heap_obj);
 
-    Code code = Code::cast(HeapObject::FromAddress(
+    Tagged<Code> code = Code::cast(HeapObject::FromAddress(
         slot.address() - Code::kInstructionStreamOffset));
-    InstructionStream instruction_stream =
-        code.instruction_stream(code_cage_base);
+    Tagged<InstructionStream> instruction_stream =
+        code->instruction_stream(code_cage_base);
     Isolate* isolate_for_sandbox = GetIsolateForSandbox(host);
-    code.UpdateCodeEntryPoint(isolate_for_sandbox, instruction_stream);
+    code->UpdateInstructionStart(isolate_for_sandbox, instruction_stream);
   }
 }
 
@@ -3842,29 +3711,30 @@ class PointersUpdatingVisitor final : public ObjectVisitorWithCageBases,
   explicit PointersUpdatingVisitor(Heap* heap)
       : ObjectVisitorWithCageBases(heap) {}
 
-  void VisitPointer(HeapObject host, ObjectSlot p) override {
+  void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) override {
     UpdateStrongSlotInternal(cage_base(), p);
   }
 
-  void VisitPointer(HeapObject host, MaybeObjectSlot p) override {
+  void VisitPointer(Tagged<HeapObject> host, MaybeObjectSlot p) override {
     UpdateSlotInternal(cage_base(), p);
   }
 
-  void VisitPointers(HeapObject host, ObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                      ObjectSlot end) override {
     for (ObjectSlot p = start; p < end; ++p) {
       UpdateStrongSlotInternal(cage_base(), p);
     }
   }
 
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) final {
     for (MaybeObjectSlot p = start; p < end; ++p) {
       UpdateSlotInternal(cage_base(), p);
     }
   }
 
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
     UpdateStrongCodeSlot<AccessMode::NON_ATOMIC>(host, cage_base(),
                                                  code_cage_base(), slot);
   }
@@ -3890,12 +3760,14 @@ class PointersUpdatingVisitor final : public ObjectVisitorWithCageBases,
     }
   }
 
-  void VisitCodeTarget(RelocInfo* rinfo) override {
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
     // This visitor nevers visits code objects.
     UNREACHABLE();
   }
 
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override {
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
     // This visitor nevers visits code objects.
     UNREACHABLE();
   }
@@ -3927,44 +3799,45 @@ class PointersUpdatingVisitor final : public ObjectVisitorWithCageBases,
   }
 };
 
-static String UpdateReferenceInExternalStringTableEntry(Heap* heap,
-                                                        FullObjectSlot p) {
-  HeapObject old_string = HeapObject::cast(*p);
-  MapWord map_word = old_string.map_word(kRelaxedLoad);
+static Tagged<String> UpdateReferenceInExternalStringTableEntry(
+    Heap* heap, FullObjectSlot p) {
+  Tagged<HeapObject> old_string = Tagged<HeapObject>::cast(*p);
+  MapWord map_word = old_string->map_word(kRelaxedLoad);
 
   if (map_word.IsForwardingAddress()) {
-    String new_string = String::cast(map_word.ToForwardingAddress(old_string));
+    Tagged<String> new_string =
+        Tagged<String>::cast(map_word.ToForwardingAddress(old_string));
 
-    if (new_string.IsExternalString()) {
+    if (IsExternalString(new_string)) {
       MemoryChunk::MoveExternalBackingStoreBytes(
           ExternalBackingStoreType::kExternalString,
           Page::FromAddress((*p).ptr()), Page::FromHeapObject(new_string),
-          ExternalString::cast(new_string).ExternalPayloadSize());
+          ExternalString::cast(new_string)->ExternalPayloadSize());
     }
     return new_string;
   }
 
-  return String::cast(*p);
+  return Tagged<String>::cast(*p);
 }
 
 void MarkCompactCollector::EvacuatePrologue() {
   // New space.
-  NewSpace* new_space = heap()->new_space();
+  NewSpace* new_space = heap_->new_space();
 
   if (new_space) {
     // Append the list of new space pages to be processed.
     for (Page* p : *new_space) {
-      if (non_atomic_marking_state()->live_bytes(p) > 0) {
+      if (p->live_bytes() > 0) {
         new_space_evacuation_pages_.push_back(p);
       }
     }
-    if (!v8_flags.minor_mc)
+    if (!v8_flags.minor_ms)
       SemiSpaceNewSpace::From(new_space)->EvacuatePrologue();
   }
 
-  if (heap()->new_lo_space()) {
-    heap()->new_lo_space()->Flip();
-    heap()->new_lo_space()->ResetPendingObject();
+  if (heap_->new_lo_space()) {
+    heap_->new_lo_space()->Flip();
+    heap_->new_lo_space()->ResetPendingObject();
   }
 
   // Old space.
@@ -3974,67 +3847,20 @@ void MarkCompactCollector::EvacuatePrologue() {
   DCHECK(evacuation_candidates_.empty());
 }
 
-#if DEBUG
-namespace {
-
-void VerifyRememberedSetsAfterEvacuation(Heap* heap,
-                                         GarbageCollector collector) {
-  // Old-to-old slot sets must be empty after evacuation.
-  bool new_space_is_empty =
-      !heap->new_space() || heap->new_space()->Size() == 0;
-  DCHECK_IMPLIES(collector == GarbageCollector::MARK_COMPACTOR,
-                 new_space_is_empty);
-
-  MemoryChunkIterator chunk_iterator(heap);
-
-  while (chunk_iterator.HasNext()) {
-    MemoryChunk* chunk = chunk_iterator.Next();
-
-    // Old-to-old slot sets must be empty after evacuation.
-    DCHECK_NULL((chunk->slot_set<OLD_TO_OLD, AccessMode::ATOMIC>()));
-    DCHECK_NULL((chunk->typed_slot_set<OLD_TO_OLD, AccessMode::ATOMIC>()));
-
-    if (new_space_is_empty && (collector == GarbageCollector::MARK_COMPACTOR)) {
-      // Old-to-new slot sets must be empty after evacuation.
-      DCHECK_NULL((chunk->slot_set<OLD_TO_NEW, AccessMode::ATOMIC>()));
-      DCHECK_NULL((chunk->typed_slot_set<OLD_TO_NEW, AccessMode::ATOMIC>()));
-    }
-
-    // Old-to-shared slots may survive GC but there should never be any slots in
-    // new or shared spaces.
-    AllocationSpace id = chunk->owner_identity();
-    if (id == SHARED_SPACE || id == SHARED_LO_SPACE || id == NEW_SPACE ||
-        id == NEW_LO_SPACE) {
-      DCHECK_NULL((chunk->slot_set<OLD_TO_SHARED, AccessMode::ATOMIC>()));
-      DCHECK_NULL((chunk->typed_slot_set<OLD_TO_SHARED, AccessMode::ATOMIC>()));
-    }
-
-    // GCs need to filter invalidated slots.
-    DCHECK_NULL(chunk->invalidated_slots<OLD_TO_OLD>());
-    DCHECK_NULL(chunk->invalidated_slots<OLD_TO_NEW>());
-    if (collector == GarbageCollector::MARK_COMPACTOR) {
-      DCHECK_NULL(chunk->invalidated_slots<OLD_TO_SHARED>());
-    }
-  }
-}
-
-}  // namespace
-#endif  // DEBUG
-
 void MarkCompactCollector::EvacuateEpilogue() {
   aborted_evacuation_candidates_due_to_oom_.clear();
   aborted_evacuation_candidates_due_to_flags_.clear();
 
   // New space.
-  if (heap()->new_space()) {
-    DCHECK_EQ(0, heap()->new_space()->Size());
+  if (heap_->new_space()) {
+    DCHECK_EQ(0, heap_->new_space()->Size());
   }
 
   // Old generation. Deallocate evacuated candidate pages.
   ReleaseEvacuationCandidates();
 
 #ifdef DEBUG
-  VerifyRememberedSetsAfterEvacuation(heap(), GarbageCollector::MARK_COMPACTOR);
+  VerifyRememberedSetsAfterEvacuation(heap_, GarbageCollector::MARK_COMPACTOR);
 #endif  // DEBUG
 }
 
@@ -4050,13 +3876,12 @@ ConcurrentAllocator* CreateSharedOldAllocator(Heap* heap) {
 }
 }  // namespace
 
-class Evacuator : public Malloced {
+class Evacuator final : public Malloced {
  public:
   enum EvacuationMode {
     kObjectsNewToOld,
     kPageNewToOld,
     kObjectsOldToOld,
-    kPageNewToNew,
   };
 
   static const char* EvacuationModeName(EvacuationMode mode) {
@@ -4067,8 +3892,6 @@ class Evacuator : public Malloced {
         return "page-new-to-old";
       case kObjectsOldToOld:
         return "objects-old-to-old";
-      case kPageNewToNew:
-        return "page-new-to-new";
     }
   }
 
@@ -4076,8 +3899,6 @@ class Evacuator : public Malloced {
     // Note: The order of checks is important in this function.
     if (chunk->IsFlagSet(MemoryChunk::PAGE_NEW_OLD_PROMOTION))
       return kPageNewToOld;
-    if (chunk->IsFlagSet(MemoryChunk::PAGE_NEW_NEW_PROMOTION))
-      return kPageNewToNew;
     if (chunk->InYoungGeneration()) return kObjectsNewToOld;
     return kObjectsOldToOld;
   }
@@ -4093,8 +3914,6 @@ class Evacuator : public Malloced {
         new_space_visitor_(heap_, &local_allocator_,
                            shared_old_allocator_.get(), &record_visitor_,
                            &local_pretenuring_feedback_),
-        new_to_new_page_visitor_(heap_, &record_visitor_,
-                                 &local_pretenuring_feedback_),
         new_to_old_page_visitor_(heap_, &record_visitor_,
                                  &local_pretenuring_feedback_),
 
@@ -4103,8 +3922,6 @@ class Evacuator : public Malloced {
         duration_(0.0),
         bytes_compacted_(0) {}
 
-  virtual ~Evacuator() = default;
-
   void EvacuatePage(MemoryChunk* chunk);
 
   void AddObserver(MigrationObserver* observer) {
@@ -4116,9 +3933,9 @@ class Evacuator : public Malloced {
   // to be called from the main thread.
   void Finalize();
 
- protected:
+ private:
   // |saved_live_bytes| returns the live bytes of the page that was processed.
-  bool RawEvacuatePage(MemoryChunk* chunk, intptr_t* saved_live_bytes);
+  bool RawEvacuatePage(MemoryChunk* chunk);
 
   inline Heap* heap() { return heap_; }
 
@@ -4137,15 +3954,12 @@ class Evacuator : public Malloced {
   // Allocator for the shared heap.
   std::unique_ptr<ConcurrentAllocator> shared_old_allocator_;
 
-  EphemeronRememberedSet ephemeron_remembered_set_;
+  EphemeronRememberedSet::TableMap ephemeron_remembered_set_;
   RecordMigratedSlotVisitor record_visitor_;
 
   // Visitors for the corresponding spaces.
   EvacuateNewSpaceVisitor new_space_visitor_;
-  EvacuateNewSpacePageVisitor<PageEvacuationMode::NEW_TO_NEW>
-      new_to_new_page_visitor_;
-  EvacuateNewSpacePageVisitor<PageEvacuationMode::NEW_TO_OLD>
-      new_to_old_page_visitor_;
+  EvacuateNewToOldSpacePageVisitor new_to_old_page_visitor_;
   EvacuateOldSpaceVisitor old_space_visitor_;
 
   // Book keeping info.
@@ -4156,26 +3970,25 @@ class Evacuator : public Malloced {
 void Evacuator::EvacuatePage(MemoryChunk* chunk) {
   TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"), "Evacuator::EvacuatePage");
   DCHECK(chunk->SweepingDone());
-  intptr_t saved_live_bytes = 0;
+  intptr_t saved_live_bytes = chunk->live_bytes();
   double evacuation_time = 0.0;
   bool success = false;
   {
-    AlwaysAllocateScope always_allocate(heap());
+    AlwaysAllocateScope always_allocate(heap_);
     TimedScope timed_scope(&evacuation_time);
-    success = RawEvacuatePage(chunk, &saved_live_bytes);
+    success = RawEvacuatePage(chunk);
   }
   ReportCompactionProgress(evacuation_time, saved_live_bytes);
   if (v8_flags.trace_evacuation) {
-    PrintIsolate(heap()->isolate(),
+    PrintIsolate(heap_->isolate(),
                  "evacuation[%p]: page=%p new_space=%d "
                  "page_evacuation=%d executable=%d can_promote=%d "
                  "live_bytes=%" V8PRIdPTR " time=%f success=%d\n",
                  static_cast<void*>(this), static_cast<void*>(chunk),
                  chunk->InNewSpace(),
-                 chunk->IsFlagSet(Page::PAGE_NEW_OLD_PROMOTION) ||
-                     chunk->IsFlagSet(Page::PAGE_NEW_NEW_PROMOTION),
+                 chunk->IsFlagSet(Page::PAGE_NEW_OLD_PROMOTION),
                  chunk->IsFlagSet(MemoryChunk::IS_EXECUTABLE),
-                 heap()->new_space()->IsPromotionCandidate(chunk),
+                 heap_->new_space()->IsPromotionCandidate(chunk),
                  saved_live_bytes, evacuation_time, success);
   }
 }
@@ -4183,25 +3996,22 @@ void Evacuator::EvacuatePage(MemoryChunk* chunk) {
 void Evacuator::Finalize() {
   local_allocator_.Finalize();
   if (shared_old_allocator_) shared_old_allocator_->FreeLinearAllocationArea();
-  heap()->tracer()->AddCompactionEvent(duration_, bytes_compacted_);
-  heap()->IncrementPromotedObjectsSize(new_space_visitor_.promoted_size() +
-                                       new_to_old_page_visitor_.moved_bytes());
-  heap()->IncrementNewSpaceSurvivingObjectSize(
-      new_space_visitor_.semispace_copied_size() +
-      new_to_new_page_visitor_.moved_bytes());
-  heap()->IncrementYoungSurvivorsCounter(
+  heap_->tracer()->AddCompactionEvent(duration_, bytes_compacted_);
+  heap_->IncrementPromotedObjectsSize(new_space_visitor_.promoted_size() +
+                                      new_to_old_page_visitor_.moved_bytes());
+  heap_->IncrementNewSpaceSurvivingObjectSize(
+      new_space_visitor_.semispace_copied_size());
+  heap_->IncrementYoungSurvivorsCounter(
       new_space_visitor_.promoted_size() +
       new_space_visitor_.semispace_copied_size() +
-      new_to_old_page_visitor_.moved_bytes() +
-      new_to_new_page_visitor_.moved_bytes());
-  heap()->pretenuring_handler()->MergeAllocationSitePretenuringFeedback(
+      new_to_old_page_visitor_.moved_bytes());
+  heap_->pretenuring_handler()->MergeAllocationSitePretenuringFeedback(
       local_pretenuring_feedback_);
 
-  DCHECK_IMPLIES(v8_flags.minor_mc, ephemeron_remembered_set_.empty());
+  auto* table_map = heap_->ephemeron_remembered_set()->tables();
   for (auto it = ephemeron_remembered_set_.begin();
        it != ephemeron_remembered_set_.end(); ++it) {
-    auto insert_result =
-        heap()->ephemeron_remembered_set_.insert({it->first, it->second});
+    auto insert_result = table_map->insert({it->first, it->second});
     if (!insert_result.second) {
       // Insertion didn't happen, there was already an item.
       auto set = insert_result.first->second;
@@ -4212,59 +4022,95 @@ void Evacuator::Finalize() {
   }
 }
 
-bool Evacuator::RawEvacuatePage(MemoryChunk* chunk, intptr_t* live_bytes) {
+class LiveObjectVisitor final : AllStatic {
+ public:
+  // Visits marked objects using `bool Visitor::Visit(HeapObject object, size_t
+  // size)` as long as the return value is true.
+  //
+  // Returns whether all objects were successfully visited. Upon returning
+  // false, also sets `failed_object` to the object for which the visitor
+  // returned false.
+  template <class Visitor>
+  static bool VisitMarkedObjects(Page* page, Visitor* visitor,
+                                 Tagged<HeapObject>* failed_object);
+
+  // Visits marked objects using `bool Visitor::Visit(HeapObject object, size_t
+  // size)` as long as the return value is true. Assumes that the return value
+  // is always true (success).
+  template <class Visitor>
+  static void VisitMarkedObjectsNoFail(Page* page, Visitor* visitor);
+};
+
+template <class Visitor>
+bool LiveObjectVisitor::VisitMarkedObjects(Page* page, Visitor* visitor,
+                                           Tagged<HeapObject>* failed_object) {
+  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
+               "LiveObjectVisitor::VisitMarkedObjects");
+  for (auto [object, size] : LiveObjectRange(page)) {
+    if (!visitor->Visit(object, size)) {
+      *failed_object = object;
+      return false;
+    }
+  }
+  return true;
+}
+
+template <class Visitor>
+void LiveObjectVisitor::VisitMarkedObjectsNoFail(Page* page, Visitor* visitor) {
+  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
+               "LiveObjectVisitor::VisitMarkedObjectsNoFail");
+  for (auto [object, size] : LiveObjectRange(page)) {
+    const bool success = visitor->Visit(object, size);
+    USE(success);
+    DCHECK(success);
+  }
+}
+
+bool Evacuator::RawEvacuatePage(MemoryChunk* chunk) {
   const EvacuationMode evacuation_mode = ComputeEvacuationMode(chunk);
-  NonAtomicMarkingState* marking_state = heap_->non_atomic_marking_state();
-  *live_bytes = marking_state->live_bytes(chunk);
   TRACE_EVENT2(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
                "FullEvacuator::RawEvacuatePage", "evacuation_mode",
-               EvacuationModeName(evacuation_mode), "live_bytes", *live_bytes);
-  HeapObject failed_object;
+               EvacuationModeName(evacuation_mode), "live_bytes",
+               chunk->live_bytes());
   switch (evacuation_mode) {
     case kObjectsNewToOld:
 #if DEBUG
       new_space_visitor_.DisableAbortEvacuationAtAddress(chunk);
 #endif  // DEBUG
-      LiveObjectVisitor::VisitBlackObjectsNoFail(chunk, marking_state,
-                                                 &new_space_visitor_);
-      marking_state->ClearLiveness(chunk);
+      LiveObjectVisitor::VisitMarkedObjectsNoFail(Page::cast(chunk),
+                                                  &new_space_visitor_);
+      chunk->ClearLiveness();
       break;
     case kPageNewToOld:
-      LiveObjectVisitor::VisitBlackObjectsNoFail(chunk, marking_state,
-                                                 &new_to_old_page_visitor_);
-      new_to_old_page_visitor_.account_moved_bytes(
-          marking_state->live_bytes(chunk));
-      break;
-    case kPageNewToNew:
-      DCHECK(!v8_flags.minor_mc);
-      LiveObjectVisitor::VisitBlackObjectsNoFail(chunk, marking_state,
-                                                 &new_to_new_page_visitor_);
-      new_to_new_page_visitor_.account_moved_bytes(
-          marking_state->live_bytes(chunk));
+      if (chunk->IsLargePage()) {
+        auto object = LargePage::cast(chunk)->GetObject();
+        bool success = new_to_old_page_visitor_.Visit(object, object->Size());
+        USE(success);
+        DCHECK(success);
+      } else {
+        LiveObjectVisitor::VisitMarkedObjectsNoFail(Page::cast(chunk),
+                                                    &new_to_old_page_visitor_);
+      }
+      new_to_old_page_visitor_.account_moved_bytes(chunk->live_bytes());
       break;
     case kObjectsOldToOld: {
-      RwxMemoryWriteScope rwx_write_scope(
+      CodePageHeaderModificationScope rwx_write_scope(
           "Evacuation of objects in Code space requires write "
-          "access for the "
-          "current worker thread.");
+          "access for the current worker thread.");
 #if DEBUG
       old_space_visitor_.SetUpAbortEvacuationAtAddress(chunk);
 #endif  // DEBUG
-      const bool success = LiveObjectVisitor::VisitBlackObjects(
-          chunk, marking_state, &old_space_visitor_, &failed_object);
-      if (success) {
-        marking_state->ClearLiveness(chunk);
+      Tagged<HeapObject> failed_object;
+      if (LiveObjectVisitor::VisitMarkedObjects(
+              Page::cast(chunk), &old_space_visitor_, &failed_object)) {
+        chunk->ClearLiveness();
       } else {
-        if (v8_flags.crash_on_aborted_evacuation) {
-          heap_->FatalProcessOutOfMemory("FullEvacuator::RawEvacuatePage");
-        } else {
-          // Aborted compaction page. Actual processing happens on the main
-          // thread for simplicity reasons.
-          heap_->mark_compact_collector()
-              ->ReportAbortedEvacuationCandidateDueToOOM(
-                  failed_object.address(), static_cast<Page*>(chunk));
-          return false;
-        }
+        // Aborted compaction page. Actual processing happens on the main
+        // thread for simplicity reasons.
+        heap_->mark_compact_collector()
+            ->ReportAbortedEvacuationCandidateDueToOOM(
+                failed_object.address(), static_cast<Page*>(chunk));
+        return false;
       }
       break;
     }
@@ -4276,23 +4122,28 @@ bool Evacuator::RawEvacuatePage(MemoryChunk* chunk, intptr_t* live_bytes) {
 class PageEvacuationJob : public v8::JobTask {
  public:
   PageEvacuationJob(
-      Isolate* isolate, std::vector<std::unique_ptr<Evacuator>>* evacuators,
+      Isolate* isolate, MarkCompactCollector* collector,
+      std::vector<std::unique_ptr<Evacuator>>* evacuators,
       std::vector<std::pair<ParallelWorkItem, MemoryChunk*>> evacuation_items)
-      : evacuators_(evacuators),
+      : collector_(collector),
+        evacuators_(evacuators),
         evacuation_items_(std::move(evacuation_items)),
         remaining_evacuation_items_(evacuation_items_.size()),
         generator_(evacuation_items_.size()),
-        tracer_(isolate->heap()->tracer()) {}
+        tracer_(isolate->heap()->tracer()),
+        trace_id_(reinterpret_cast<uint64_t>(this) ^
+                  tracer_->CurrentEpoch(GCTracer::Scope::MC_EVACUATE)) {}
 
   void Run(JobDelegate* delegate) override {
-    RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
     Evacuator* evacuator = (*evacuators_)[delegate->GetTaskId()].get();
     if (delegate->IsJoiningThread()) {
-      TRACE_GC(tracer_, GCTracer::Scope::MC_EVACUATE_COPY_PARALLEL);
+      TRACE_GC_WITH_FLOW(tracer_, GCTracer::Scope::MC_EVACUATE_COPY_PARALLEL,
+                         trace_id_, TRACE_EVENT_FLAG_FLOW_IN);
       ProcessItems(delegate, evacuator);
     } else {
-      TRACE_GC_EPOCH(tracer_, GCTracer::Scope::MC_BACKGROUND_EVACUATE_COPY,
-                     ThreadKind::kBackground);
+      TRACE_GC_EPOCH_WITH_FLOW(
+          tracer_, GCTracer::Scope::MC_BACKGROUND_EVACUATE_COPY,
+          ThreadKind::kBackground, trace_id_, TRACE_EVENT_FLAG_FLOW_IN);
       ProcessItems(delegate, evacuator);
     }
   }
@@ -4317,26 +4168,34 @@ class PageEvacuationJob : public v8::JobTask {
     const size_t kItemsPerWorker = std::max(1, MB / Page::kPageSize);
     // Ceiling division to ensure enough workers for all
     // |remaining_evacuation_items_|
-    const size_t wanted_num_workers =
+    size_t wanted_num_workers =
         (remaining_evacuation_items_.load(std::memory_order_relaxed) +
          kItemsPerWorker - 1) /
         kItemsPerWorker;
-    return std::min<size_t>(wanted_num_workers, evacuators_->size());
+    wanted_num_workers =
+        std::min<size_t>(wanted_num_workers, evacuators_->size());
+    if (!collector_->UseBackgroundThreadsInCycle()) {
+      return std::min<size_t>(wanted_num_workers, 1);
+    }
+    return wanted_num_workers;
   }
 
+  uint64_t trace_id() const { return trace_id_; }
+
  private:
+  MarkCompactCollector* collector_;
   std::vector<std::unique_ptr<Evacuator>>* evacuators_;
   std::vector<std::pair<ParallelWorkItem, MemoryChunk*>> evacuation_items_;
   std::atomic<size_t> remaining_evacuation_items_{0};
   IndexGenerator generator_;
 
   GCTracer* tracer_;
+  const uint64_t trace_id_;
 };
 
 namespace {
-template <class Evacuator>
 size_t CreateAndExecuteEvacuationTasks(
-    Heap* heap,
+    Heap* heap, MarkCompactCollector* collector,
     std::vector<std::pair<ParallelWorkItem, MemoryChunk*>> evacuation_items) {
   base::Optional<ProfilingMigrationObserver> profiling_observer;
   if (heap->isolate()->log_object_relocation()) {
@@ -4351,11 +4210,14 @@ size_t CreateAndExecuteEvacuationTasks(
     }
     evacuators.push_back(std::move(evacuator));
   }
+  auto page_evacuation_job = std::make_unique<PageEvacuationJob>(
+      heap->isolate(), collector, &evacuators, std::move(evacuation_items));
+  TRACE_GC_NOTE_WITH_FLOW("PageEvacuationJob started",
+                          page_evacuation_job->trace_id(),
+                          TRACE_EVENT_FLAG_FLOW_OUT);
   V8::GetCurrentPlatform()
-      ->CreateJob(
-          v8::TaskPriority::kUserBlocking,
-          std::make_unique<PageEvacuationJob>(heap->isolate(), &evacuators,
-                                              std::move(evacuation_items)))
+      ->CreateJob(v8::TaskPriority::kUserBlocking,
+                  std::move(page_evacuation_job))
       ->Join();
   for (auto& evacuator : evacuators) {
     evacuator->Finalize();
@@ -4363,6 +4225,8 @@ size_t CreateAndExecuteEvacuationTasks(
   return wanted_num_tasks;
 }
 
+enum class MemoryReductionMode { kNone, kShouldReduceMemory };
+
 // NewSpacePages with more live bytes than this threshold qualify for fast
 // evacuation.
 intptr_t NewSpacePageEvacuationThreshold() {
@@ -4370,20 +4234,24 @@ intptr_t NewSpacePageEvacuationThreshold() {
          MemoryChunkLayout::AllocatableMemoryInDataPage() / 100;
 }
 
-bool ShouldMovePage(Page* p, intptr_t live_bytes, intptr_t wasted_bytes,
-                    MemoryReductionMode memory_reduction_mode,
-                    AlwaysPromoteYoung always_promote_young,
-                    PromoteUnusablePages promote_unusable_pages) {
+bool ShouldMovePage(Page* p, intptr_t live_bytes,
+                    MemoryReductionMode memory_reduction_mode) {
   Heap* heap = p->heap();
-  return v8_flags.page_promotion &&
-         (memory_reduction_mode == MemoryReductionMode::kNone) &&
-         !p->NeverEvacuate() &&
-         ((live_bytes + wasted_bytes > NewSpacePageEvacuationThreshold()) ||
-          (promote_unusable_pages == PromoteUnusablePages::kYes &&
-           !p->WasUsedForAllocation())) &&
-         (always_promote_young == AlwaysPromoteYoung::kYes ||
-          heap->new_space()->IsPromotionCandidate(p)) &&
-         heap->CanExpandOldGeneration(live_bytes);
+  DCHECK(!p->NeverEvacuate());
+  const bool should_move_page =
+      v8_flags.page_promotion &&
+      (memory_reduction_mode == MemoryReductionMode::kNone) &&
+      (live_bytes > NewSpacePageEvacuationThreshold()) &&
+      heap->CanExpandOldGeneration(live_bytes);
+  if (v8_flags.trace_page_promotions) {
+    PrintIsolate(heap->isolate(),
+                 "[Page Promotion] %p: collector=mc, should move: %d"
+                 ", live bytes = %zu, promotion threshold = %zu"
+                 ", allocated labs size = %zu\n",
+                 p, should_move_page, live_bytes,
+                 NewSpacePageEvacuationThreshold(), p->AllocatedLabSize());
+  }
+  return should_move_page;
 }
 
 void TraceEvacuation(Isolate* isolate, size_t pages_count,
@@ -4412,29 +4280,27 @@ void MarkCompactCollector::EvacuatePagesInParallel() {
   // Evacuation of new space pages cannot be aborted, so it needs to run
   // before old space evacuation.
   bool force_page_promotion =
-      heap()->IsGCWithStack() && !v8_flags.compact_with_stack;
+      heap_->IsGCWithStack() && !v8_flags.compact_with_stack;
   for (Page* page : new_space_evacuation_pages_) {
-    intptr_t live_bytes_on_page = non_atomic_marking_state()->live_bytes(page);
+    intptr_t live_bytes_on_page = page->live_bytes();
     DCHECK_LT(0, live_bytes_on_page);
     live_bytes += live_bytes_on_page;
     MemoryReductionMode memory_reduction_mode =
-        heap()->ShouldReduceMemory() ? MemoryReductionMode::kShouldReduceMemory
-                                     : MemoryReductionMode::kNone;
-    if (ShouldMovePage(page, live_bytes_on_page, 0, memory_reduction_mode,
-                       AlwaysPromoteYoung::kYes, PromoteUnusablePages::kNo) ||
+        heap_->ShouldReduceMemory() ? MemoryReductionMode::kShouldReduceMemory
+                                    : MemoryReductionMode::kNone;
+    if (ShouldMovePage(page, live_bytes_on_page, memory_reduction_mode) ||
         force_page_promotion) {
-      EvacuateNewSpacePageVisitor<NEW_TO_OLD>::Move(page);
+      EvacuateNewToOldSpacePageVisitor::Move(page);
       page->SetFlag(Page::PAGE_NEW_OLD_PROMOTION);
-      DCHECK_EQ(heap()->old_space(), page->owner());
+      DCHECK_EQ(heap_->old_space(), page->owner());
       // The move added page->allocated_bytes to the old space, but we are
       // going to sweep the page and add page->live_byte_count.
-      heap()->old_space()->DecreaseAllocatedBytes(page->allocated_bytes(),
-                                                  page);
+      heap_->old_space()->DecreaseAllocatedBytes(page->allocated_bytes(), page);
     }
     evacuation_items.emplace_back(ParallelWorkItem{}, page);
   }
 
-  if (heap()->IsGCWithStack()) {
+  if (heap_->IsGCWithStack()) {
     if (!v8_flags.compact_with_stack ||
         !v8_flags.compact_code_space_with_stack) {
       for (Page* page : old_space_evacuation_pages_) {
@@ -4454,7 +4320,7 @@ void MarkCompactCollector::EvacuatePagesInParallel() {
     for (Page* page : old_space_evacuation_pages_) {
       if (page->IsFlagSet(Page::COMPACTION_WAS_ABORTED)) continue;
 
-      if (isolate()->fuzzer_rng()->NextDouble() < kFraction) {
+      if (heap_->isolate()->fuzzer_rng()->NextDouble() < kFraction) {
         ReportAbortedEvacuationCandidateDueToFlags(page->area_start(), page);
       }
     }
@@ -4463,19 +4329,17 @@ void MarkCompactCollector::EvacuatePagesInParallel() {
   for (Page* page : old_space_evacuation_pages_) {
     if (page->IsFlagSet(Page::COMPACTION_WAS_ABORTED)) continue;
 
-    live_bytes += non_atomic_marking_state()->live_bytes(page);
+    live_bytes += page->live_bytes();
     evacuation_items.emplace_back(ParallelWorkItem{}, page);
   }
 
   // Promote young generation large objects.
-  if (auto* new_lo_space = heap()->new_lo_space()) {
-    auto* marking_state = heap()->non_atomic_marking_state();
+  if (auto* new_lo_space = heap_->new_lo_space()) {
     for (auto it = new_lo_space->begin(); it != new_lo_space->end();) {
       LargePage* current = *(it++);
-      HeapObject object = current->GetObject();
-      DCHECK(!marking_state->IsGrey(object));
-      if (marking_state->IsMarked(object)) {
-        heap()->lo_space()->PromoteNewLargeObject(current);
+      Tagged<HeapObject> object = current->GetObject();
+      if (marking_state_->IsMarked(object)) {
+        heap_->lo_space()->PromoteNewLargeObject(current);
         current->SetFlag(Page::PAGE_NEW_OLD_PROMOTION);
         promoted_large_pages_.push_back(current);
         evacuation_items.emplace_back(ParallelWorkItem{}, current);
@@ -4491,24 +4355,24 @@ void MarkCompactCollector::EvacuatePagesInParallel() {
                  "MarkCompactCollector::EvacuatePagesInParallel", "pages",
                  evacuation_items.size());
 
-    wanted_num_tasks = CreateAndExecuteEvacuationTasks<Evacuator>(
-        heap(), std::move(evacuation_items));
+    wanted_num_tasks = CreateAndExecuteEvacuationTasks(
+        heap_, this, std::move(evacuation_items));
   }
 
   const size_t aborted_pages = PostProcessAbortedEvacuationCandidates();
 
   if (v8_flags.trace_evacuation) {
-    TraceEvacuation(isolate(), pages_count, wanted_num_tasks, live_bytes,
+    TraceEvacuation(heap_->isolate(), pages_count, wanted_num_tasks, live_bytes,
                     aborted_pages);
   }
 }
 
 class EvacuationWeakObjectRetainer : public WeakObjectRetainer {
  public:
-  Object RetainAs(Object object) override {
+  Tagged<Object> RetainAs(Tagged<Object> object) override {
     if (object.IsHeapObject()) {
-      HeapObject heap_object = HeapObject::cast(object);
-      MapWord map_word = heap_object.map_word(kRelaxedLoad);
+      Tagged<HeapObject> heap_object = Tagged<HeapObject>::cast(object);
+      MapWord map_word = heap_object->map_word(kRelaxedLoad);
       if (map_word.IsForwardingAddress()) {
         return map_word.ToForwardingAddress(heap_object);
       }
@@ -4517,96 +4381,40 @@ class EvacuationWeakObjectRetainer : public WeakObjectRetainer {
   }
 };
 
-template <class Visitor, typename MarkingState>
-bool LiveObjectVisitor::VisitBlackObjects(MemoryChunk* chunk,
-                                          MarkingState* marking_state,
-                                          Visitor* visitor,
-                                          HeapObject* failed_object) {
-  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-               "LiveObjectVisitor::VisitBlackObjects");
-  for (auto object_and_size :
-       LiveObjectRange<kBlackObjects>(chunk, marking_state->bitmap(chunk))) {
-    HeapObject const object = object_and_size.first;
-    if (!visitor->Visit(object, object_and_size.second)) {
-      *failed_object = object;
-      return false;
-    }
-  }
-  return true;
-}
-
-template <class Visitor, typename MarkingState>
-void LiveObjectVisitor::VisitBlackObjectsNoFail(MemoryChunk* chunk,
-                                                MarkingState* marking_state,
-                                                Visitor* visitor) {
-  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-               "LiveObjectVisitor::VisitBlackObjectsNoFail");
-  if (chunk->IsLargePage()) {
-    HeapObject object = reinterpret_cast<LargePage*>(chunk)->GetObject();
-    if (marking_state->IsMarked(object)) {
-      const bool success = visitor->Visit(object, object.Size());
-      USE(success);
-      DCHECK(success);
-    }
-  } else {
-    for (auto object_and_size :
-         LiveObjectRange<kBlackObjects>(chunk, marking_state->bitmap(chunk))) {
-      HeapObject const object = object_and_size.first;
-      DCHECK(marking_state->IsMarked(object));
-      const bool success = visitor->Visit(object, object_and_size.second);
-      USE(success);
-      DCHECK(success);
-    }
-  }
-}
-
-template <typename MarkingState>
-void LiveObjectVisitor::RecomputeLiveBytes(MemoryChunk* chunk,
-                                           MarkingState* marking_state) {
-  int new_live_size = 0;
-  for (auto object_and_size :
-       LiveObjectRange<kAllLiveObjects>(chunk, marking_state->bitmap(chunk))) {
-    new_live_size += ALIGN_TO_ALLOCATION_ALIGNMENT(object_and_size.second);
-  }
-  marking_state->SetLiveBytes(chunk, new_live_size);
-}
-
 void MarkCompactCollector::Evacuate() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_EVACUATE);
-  base::MutexGuard guard(heap()->relocation_mutex());
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_EVACUATE);
+  base::MutexGuard guard(heap_->relocation_mutex());
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_EVACUATE_PROLOGUE);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_EVACUATE_PROLOGUE);
     EvacuatePrologue();
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_EVACUATE_COPY);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_EVACUATE_COPY);
     EvacuatePagesInParallel();
   }
 
   UpdatePointersAfterEvacuation();
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_EVACUATE_CLEAN_UP);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_EVACUATE_CLEAN_UP);
 
     for (Page* p : new_space_evacuation_pages_) {
-      // Full GCs don't promote pages within new space.
-      DCHECK(!p->IsFlagSet(Page::PAGE_NEW_NEW_PROMOTION));
       if (p->IsFlagSet(Page::PAGE_NEW_OLD_PROMOTION)) {
         p->ClearFlag(Page::PAGE_NEW_OLD_PROMOTION);
         DCHECK_EQ(OLD_SPACE, p->owner_identity());
-        sweeper()->AddPage(OLD_SPACE, p, Sweeper::REGULAR);
-      } else if (v8_flags.minor_mc) {
+        sweeper_->AddPage(OLD_SPACE, p);
+      } else if (v8_flags.minor_ms) {
         // Sweep non-promoted pages to add them back to the free list.
         DCHECK_EQ(NEW_SPACE, p->owner_identity());
-        DCHECK_EQ(0, non_atomic_marking_state()->live_bytes(p));
+        DCHECK_EQ(0, p->live_bytes());
         DCHECK(p->SweepingDone());
-        PagedNewSpace* space = heap()->paged_new_space();
+        PagedNewSpace* space = heap_->paged_new_space();
         if (space->ShouldReleaseEmptyPage()) {
           space->ReleasePage(p);
         } else {
-          sweeper()->SweepEmptyNewSpacePage(p);
+          sweeper_->SweepEmptyNewSpacePage(p);
         }
       }
     }
@@ -4615,29 +4423,29 @@ void MarkCompactCollector::Evacuate() {
     for (LargePage* p : promoted_large_pages_) {
       DCHECK(p->IsFlagSet(Page::PAGE_NEW_OLD_PROMOTION));
       p->ClearFlag(Page::PAGE_NEW_OLD_PROMOTION);
-      HeapObject object = p->GetObject();
-      Marking::MarkWhite(non_atomic_marking_state()->MarkBitFrom(object));
+      Tagged<HeapObject> object = p->GetObject();
+      MarkBit::From(object).Clear();
       p->ProgressBar().ResetIfEnabled();
-      non_atomic_marking_state()->SetLiveBytes(p, 0);
+      p->SetLiveBytes(0);
     }
     promoted_large_pages_.clear();
 
     for (Page* p : old_space_evacuation_pages_) {
       if (p->IsFlagSet(Page::COMPACTION_WAS_ABORTED)) {
-        sweeper()->AddPage(p->owner_identity(), p, Sweeper::REGULAR);
+        sweeper_->AddPage(p->owner_identity(), p);
         p->ClearFlag(Page::COMPACTION_WAS_ABORTED);
       }
     }
   }
 
   {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_EVACUATE_EPILOGUE);
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_EVACUATE_EPILOGUE);
     EvacuateEpilogue();
   }
 
 #ifdef VERIFY_HEAP
-  if (v8_flags.verify_heap && !sweeper()->sweeping_in_progress()) {
-    FullEvacuationVerifier verifier(heap());
+  if (v8_flags.verify_heap && !sweeper_->sweeping_in_progress()) {
+    EvacuationVerifier verifier(heap_);
     verifier.Run();
   }
 #endif  // VERIFY_HEAP
@@ -4652,22 +4460,26 @@ class UpdatingItem : public ParallelWorkItem {
 class PointersUpdatingJob : public v8::JobTask {
  public:
   explicit PointersUpdatingJob(
-      Isolate* isolate,
+      Isolate* isolate, MarkCompactCollector* collector,
       std::vector<std::unique_ptr<UpdatingItem>> updating_items)
-      : updating_items_(std::move(updating_items)),
+      : collector_(collector),
+        updating_items_(std::move(updating_items)),
         remaining_updating_items_(updating_items_.size()),
         generator_(updating_items_.size()),
-        tracer_(isolate->heap()->tracer()) {}
+        tracer_(isolate->heap()->tracer()),
+        trace_id_(reinterpret_cast<uint64_t>(this) ^
+                  tracer_->CurrentEpoch(GCTracer::Scope::MC_EVACUATE)) {}
 
   void Run(JobDelegate* delegate) override {
-    RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
     if (delegate->IsJoiningThread()) {
-      TRACE_GC(tracer_, GCTracer::Scope::MC_EVACUATE_UPDATE_POINTERS_PARALLEL);
+      TRACE_GC_WITH_FLOW(tracer_,
+                         GCTracer::Scope::MC_EVACUATE_UPDATE_POINTERS_PARALLEL,
+                         trace_id_, TRACE_EVENT_FLAG_FLOW_IN);
       UpdatePointers(delegate);
     } else {
-      TRACE_GC_EPOCH(tracer_,
-                     GCTracer::Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS,
-                     ThreadKind::kBackground);
+      TRACE_GC_EPOCH_WITH_FLOW(
+          tracer_, GCTracer::Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS,
+          ThreadKind::kBackground, trace_id_, TRACE_EVENT_FLAG_FLOW_IN);
       UpdatePointers(delegate);
     }
   }
@@ -4690,74 +4502,26 @@ class PointersUpdatingJob : public v8::JobTask {
 
   size_t GetMaxConcurrency(size_t worker_count) const override {
     size_t items = remaining_updating_items_.load(std::memory_order_relaxed);
-    if (!v8_flags.parallel_pointer_update) return items > 0;
+    if (!v8_flags.parallel_pointer_update ||
+        !collector_->UseBackgroundThreadsInCycle()) {
+      return std::min<size_t>(items, 1);
+    }
     const size_t kMaxPointerUpdateTasks = 8;
     size_t max_concurrency = std::min<size_t>(kMaxPointerUpdateTasks, items);
     DCHECK_IMPLIES(items > 0, max_concurrency > 0);
     return max_concurrency;
   }
 
+  uint64_t trace_id() const { return trace_id_; }
+
  private:
+  MarkCompactCollector* collector_;
   std::vector<std::unique_ptr<UpdatingItem>> updating_items_;
   std::atomic<size_t> remaining_updating_items_{0};
   IndexGenerator generator_;
 
   GCTracer* tracer_;
-};
-
-template <typename MarkingState>
-class ToSpaceUpdatingItem : public UpdatingItem {
- public:
-  explicit ToSpaceUpdatingItem(Heap* heap, MemoryChunk* chunk, Address start,
-                               Address end, MarkingState* marking_state)
-      : heap_(heap),
-        chunk_(chunk),
-        start_(start),
-        end_(end),
-        marking_state_(marking_state) {}
-  ~ToSpaceUpdatingItem() override = default;
-
-  void Process() override {
-    if (chunk_->IsFlagSet(Page::PAGE_NEW_NEW_PROMOTION)) {
-      // New->new promoted pages contain garbage so they require iteration using
-      // markbits.
-      ProcessVisitLive();
-    } else {
-      ProcessVisitAll();
-    }
-  }
-
- private:
-  void ProcessVisitAll() {
-    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-                 "ToSpaceUpdatingItem::ProcessVisitAll");
-    PointersUpdatingVisitor visitor(heap_);
-    for (Address cur = start_; cur < end_;) {
-      HeapObject object = HeapObject::FromAddress(cur);
-      Map map = object.map(visitor.cage_base());
-      int size = object.SizeFromMap(map);
-      object.IterateBodyFast(map, size, &visitor);
-      cur += size;
-    }
-  }
-
-  void ProcessVisitLive() {
-    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-                 "ToSpaceUpdatingItem::ProcessVisitLive");
-    // For young generation evacuations we want to visit grey objects, for
-    // full MC, we need to visit black objects.
-    PointersUpdatingVisitor visitor(heap_);
-    for (auto object_and_size : LiveObjectRange<kAllLiveObjects>(
-             chunk_, marking_state_->bitmap(chunk_))) {
-      object_and_size.first.IterateBodyFast(visitor.cage_base(), &visitor);
-    }
-  }
-
-  Heap* heap_;
-  MemoryChunk* chunk_;
-  Address start_;
-  Address end_;
-  MarkingState* marking_state_;
+  const uint64_t trace_id_;
 };
 
 namespace {
@@ -4784,7 +4548,7 @@ class RememberedSetUpdatingItem : public UpdatingItem {
   template <typename TSlot>
   inline void CheckSlotForOldToSharedUntyped(PtrComprCageBase cage_base,
                                              MemoryChunk* chunk, TSlot slot) {
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
 
     if (!slot.load(cage_base).GetHeapObject(&heap_object)) {
       return;
@@ -4798,7 +4562,7 @@ class RememberedSetUpdatingItem : public UpdatingItem {
 
   inline void CheckSlotForOldToSharedTyped(MemoryChunk* chunk,
                                            SlotType slot_type, Address addr) {
-    HeapObject heap_object =
+    Tagged<HeapObject> heap_object =
         UpdateTypedSlotHelper::GetTargetObject(chunk->heap(), slot_type, addr);
 
 #if DEBUG
@@ -4824,17 +4588,17 @@ class RememberedSetUpdatingItem : public UpdatingItem {
         std::is_same<TSlot, FullMaybeObjectSlot>::value ||
             std::is_same<TSlot, MaybeObjectSlot>::value,
         "Only FullMaybeObjectSlot and MaybeObjectSlot are expected here");
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
     if (!(*slot).GetHeapObject(&heap_object)) return;
     if (!Heap::InYoungGeneration(heap_object)) return;
 
-    if (v8_flags.minor_mc && !Heap::IsLargeObject(heap_object)) {
+    if (v8_flags.minor_ms && !Heap::IsLargeObject(heap_object)) {
       DCHECK(Heap::InToPage(heap_object));
     } else {
       DCHECK(Heap::InFromPage(heap_object));
     }
 
-    MapWord map_word = heap_object.map_word(kRelaxedLoad);
+    MapWord map_word = heap_object->map_word(kRelaxedLoad);
     if (map_word.IsForwardingAddress()) {
       using THeapObjectSlot = typename TSlot::THeapObjectSlot;
       HeapObjectReference::Update(THeapObjectSlot(slot),
@@ -4847,27 +4611,22 @@ class RememberedSetUpdatingItem : public UpdatingItem {
   }
 
   void UpdateUntypedPointers() {
-    UpdateUntypedOldToNewPointers();
+    UpdateUntypedOldToNewPointers<OLD_TO_NEW>();
+    UpdateUntypedOldToNewPointers<OLD_TO_NEW_BACKGROUND>();
     UpdateUntypedOldToOldPointers();
     UpdateUntypedOldToCodePointers();
-    UpdateUntypedOldToSharedPointers();
   }
 
+  template <RememberedSetType old_to_new_type>
   void UpdateUntypedOldToNewPointers() {
-    if (chunk_->slot_set<OLD_TO_NEW, AccessMode::NON_ATOMIC>()) {
+    if (chunk_->slot_set<old_to_new_type, AccessMode::NON_ATOMIC>()) {
       const PtrComprCageBase cage_base = heap_->isolate();
       // Marking bits are cleared already when the page is already swept. This
       // is fine since in that case the sweeper has already removed dead invalid
       // objects as well.
-      InvalidatedSlotsFilter::LivenessCheck liveness_check =
-          !chunk_->SweepingDone() ? InvalidatedSlotsFilter::LivenessCheck::kYes
-                                  : InvalidatedSlotsFilter::LivenessCheck::kNo;
-      InvalidatedSlotsFilter filter =
-          InvalidatedSlotsFilter::OldToNew(chunk_, liveness_check);
-      RememberedSet<OLD_TO_NEW>::Iterate(
+      RememberedSet<old_to_new_type>::Iterate(
           chunk_,
-          [this, &filter, cage_base](MaybeObjectSlot slot) {
-            if (!filter.IsValid(slot.address())) return REMOVE_SLOT;
+          [this, cage_base](MaybeObjectSlot slot) {
             CheckAndUpdateOldToNewSlot(slot);
             // A new space string might have been promoted into the shared heap
             // during GC.
@@ -4881,40 +4640,29 @@ class RememberedSetUpdatingItem : public UpdatingItem {
           SlotSet::KEEP_EMPTY_BUCKETS);
     }
 
-    // The invalidated slots are not needed after old-to-new slots were
-    // processed.
-    chunk_->ReleaseInvalidatedSlots<OLD_TO_NEW>();
-    // Full GCs will empty new space, so OLD_TO_NEW is empty.
-    chunk_->ReleaseSlotSet<OLD_TO_NEW>();
+    // Full GCs will empty new space, so [old_to_new_type] is empty.
+    chunk_->ReleaseSlotSet(old_to_new_type);
   }
 
   void UpdateUntypedOldToOldPointers() {
     if (chunk_->slot_set<OLD_TO_OLD, AccessMode::NON_ATOMIC>()) {
       const PtrComprCageBase cage_base = heap_->isolate();
-      InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToOld(
-          chunk_, InvalidatedSlotsFilter::LivenessCheck::kNo);
       RememberedSet<OLD_TO_OLD>::Iterate(
           chunk_,
-          [this, &filter, cage_base](MaybeObjectSlot slot) {
-            if (filter.IsValid(slot.address())) {
-              UpdateSlot<AccessMode::NON_ATOMIC>(cage_base, slot);
-              // A string might have been promoted into the shared heap during
-              // GC.
-              if (record_old_to_shared_slots_) {
-                CheckSlotForOldToSharedUntyped(cage_base, chunk_, slot);
-              }
+          [this, cage_base](MaybeObjectSlot slot) {
+            UpdateSlot<AccessMode::NON_ATOMIC>(cage_base, slot);
+            // A string might have been promoted into the shared heap during
+            // GC.
+            if (record_old_to_shared_slots_) {
+              CheckSlotForOldToSharedUntyped(cage_base, chunk_, slot);
             }
             // Always keep slot since all slots are dropped at once after
             // iteration.
             return KEEP_SLOT;
           },
           SlotSet::KEEP_EMPTY_BUCKETS);
-      chunk_->ReleaseSlotSet<OLD_TO_OLD>();
+      chunk_->ReleaseSlotSet(OLD_TO_OLD);
     }
-
-    // The invalidated slots are not needed after old-to-old slots were
-    // processed.
-    chunk_->ReleaseInvalidatedSlots<OLD_TO_OLD>();
   }
 
   void UpdateUntypedOldToCodePointers() {
@@ -4928,42 +4676,19 @@ class RememberedSetUpdatingItem : public UpdatingItem {
       RememberedSet<OLD_TO_CODE>::Iterate(
           chunk_,
           [=](MaybeObjectSlot slot) {
-            HeapObject host = HeapObject::FromAddress(
+            Tagged<HeapObject> host = HeapObject::FromAddress(
                 slot.address() - Code::kInstructionStreamOffset);
-            DCHECK(host.IsCode(cage_base));
+            DCHECK(IsCode(host, cage_base));
             UpdateStrongCodeSlot<AccessMode::NON_ATOMIC>(
                 host, cage_base, code_cage_base,
-                CodeObjectSlot(slot.address()));
+                InstructionStreamSlot(slot.address()));
             // Always keep slot since all slots are dropped at once after
             // iteration.
             return KEEP_SLOT;
           },
           SlotSet::FREE_EMPTY_BUCKETS);
-      chunk_->ReleaseSlotSet<OLD_TO_CODE>();
-    }
-
-    // The invalidated slots are not needed after old-to-code slots were
-    // processed, but since there are no invalidated OLD_TO_CODE slots,
-    // there's nothing to clear.
-    DCHECK_NULL(chunk_->invalidated_slots<OLD_TO_CODE>());
-  }
-
-  void UpdateUntypedOldToSharedPointers() {
-    if (chunk_->slot_set<OLD_TO_SHARED, AccessMode::NON_ATOMIC>()) {
-      // Client GCs need to remove invalidated OLD_TO_SHARED slots.
-      InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToShared(
-          chunk_, InvalidatedSlotsFilter::LivenessCheck::kNo);
-      RememberedSet<OLD_TO_SHARED>::Iterate(
-          chunk_,
-          [&filter](MaybeObjectSlot slot) {
-            return filter.IsValid(slot.address()) ? KEEP_SLOT : REMOVE_SLOT;
-          },
-          SlotSet::FREE_EMPTY_BUCKETS);
+      chunk_->ReleaseSlotSet(OLD_TO_CODE);
     }
-
-    // The invalidated slots are not needed after old-to-shared slots were
-    // processed.
-    chunk_->ReleaseInvalidatedSlots<OLD_TO_SHARED>();
   }
 
   void UpdateTypedPointers() {
@@ -4994,7 +4719,9 @@ class RememberedSetUpdatingItem : public UpdatingItem {
           return KEEP_SLOT;
         });
     // Full GCs will empty new space, so OLD_TO_NEW is empty.
-    chunk_->ReleaseTypedSlotSet<OLD_TO_NEW>();
+    chunk_->ReleaseTypedSlotSet(OLD_TO_NEW);
+    // OLD_TO_NEW_BACKGROUND typed slots set should always be empty.
+    DCHECK_NULL(chunk_->typed_slot_set<OLD_TO_NEW_BACKGROUND>());
   }
 
   void UpdateTypedOldToOldPointers() {
@@ -5018,7 +4745,7 @@ class RememberedSetUpdatingItem : public UpdatingItem {
           }
           return result;
         });
-    chunk_->ReleaseTypedSlotSet<OLD_TO_OLD>();
+    chunk_->ReleaseTypedSlotSet(OLD_TO_OLD);
   }
 
   Heap* heap_;
@@ -5038,7 +4765,7 @@ void CollectRememberedSetUpdatingItems(
     // No need to update pointers on evacuation candidates. Evacuated pages will
     // be released after this phase.
     if (chunk->IsEvacuationCandidate()) continue;
-    if (chunk->HasRecordedSlots()) {
+    if (chunk->ContainsAnySlots()) {
       items->emplace_back(
           std::make_unique<RememberedSetUpdatingItem>(space->heap(), chunk));
     }
@@ -5058,24 +4785,24 @@ class EphemeronTableUpdatingItem : public UpdatingItem {
                  "EphemeronTableUpdatingItem::Process");
     PtrComprCageBase cage_base(heap_->isolate());
 
-    for (auto it = heap_->ephemeron_remembered_set_.begin();
-         it != heap_->ephemeron_remembered_set_.end();) {
-      EphemeronHashTable table = it->first;
+    auto* table_map = heap_->ephemeron_remembered_set()->tables();
+    for (auto it = table_map->begin(); it != table_map->end();) {
+      Tagged<EphemeronHashTable> table = it->first;
       auto& indices = it->second;
-      if (table.map_word(cage_base, kRelaxedLoad).IsForwardingAddress()) {
+      if (table->map_word(cage_base, kRelaxedLoad).IsForwardingAddress()) {
         // The table has moved, and RecordMigratedSlotVisitor::VisitEphemeron
         // inserts entries for the moved table into ephemeron_remembered_set_.
-        it = heap_->ephemeron_remembered_set_.erase(it);
+        it = table_map->erase(it);
         continue;
       }
-      DCHECK(table.map(cage_base).IsMap(cage_base));
-      DCHECK(table.IsEphemeronHashTable(cage_base));
+      DCHECK(IsMap(table->map(cage_base), cage_base));
+      DCHECK(IsEphemeronHashTable(table, cage_base));
       for (auto iti = indices.begin(); iti != indices.end();) {
         // EphemeronHashTable keys must be heap objects.
-        HeapObjectSlot key_slot(table.RawFieldOfElementAt(
+        HeapObjectSlot key_slot(table->RawFieldOfElementAt(
             EphemeronHashTable::EntryToIndex(InternalIndex(*iti))));
-        HeapObject key = key_slot.ToHeapObject();
-        MapWord map_word = key.map_word(cage_base, kRelaxedLoad);
+        Tagged<HeapObject> key = key_slot.ToHeapObject();
+        MapWord map_word = key->map_word(cage_base, kRelaxedLoad);
         if (map_word.IsForwardingAddress()) {
           key = map_word.ToForwardingAddress(key);
           key_slot.StoreHeapObject(key);
@@ -5087,7 +4814,7 @@ class EphemeronTableUpdatingItem : public UpdatingItem {
         }
       }
       if (indices.size() == 0) {
-        it = heap_->ephemeron_remembered_set_.erase(it);
+        it = table_map->erase(it);
       } else {
         ++it;
       }
@@ -5099,60 +4826,64 @@ class EphemeronTableUpdatingItem : public UpdatingItem {
 };
 
 void MarkCompactCollector::UpdatePointersAfterEvacuation() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MC_EVACUATE_UPDATE_POINTERS);
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MC_EVACUATE_UPDATE_POINTERS);
 
   {
-    TRACE_GC(heap()->tracer(),
+    TRACE_GC(heap_->tracer(),
              GCTracer::Scope::MC_EVACUATE_UPDATE_POINTERS_TO_NEW_ROOTS);
     // The external string table is updated at the end.
-    PointersUpdatingVisitor updating_visitor(heap());
+    PointersUpdatingVisitor updating_visitor(heap_);
     heap_->IterateRootsIncludingClients(
         &updating_visitor,
         base::EnumSet<SkipRoot>{SkipRoot::kExternalStringTable,
-                                SkipRoot::kConservativeStack});
+                                SkipRoot::kConservativeStack,
+                                SkipRoot::kReadOnlyBuiltins});
   }
 
   {
-    TRACE_GC(heap()->tracer(),
+    TRACE_GC(heap_->tracer(),
              GCTracer::Scope::MC_EVACUATE_UPDATE_POINTERS_CLIENT_HEAPS);
     UpdatePointersInClientHeaps();
   }
 
   {
-    TRACE_GC(heap()->tracer(),
+    TRACE_GC(heap_->tracer(),
              GCTracer::Scope::MC_EVACUATE_UPDATE_POINTERS_SLOTS_MAIN);
     std::vector<std::unique_ptr<UpdatingItem>> updating_items;
 
-    CollectRememberedSetUpdatingItems(&updating_items, heap()->old_space());
-    CollectRememberedSetUpdatingItems(&updating_items, heap()->code_space());
-    if (heap()->shared_space()) {
-      CollectRememberedSetUpdatingItems(&updating_items,
-                                        heap()->shared_space());
+    CollectRememberedSetUpdatingItems(&updating_items, heap_->old_space());
+    CollectRememberedSetUpdatingItems(&updating_items, heap_->code_space());
+    if (heap_->shared_space()) {
+      CollectRememberedSetUpdatingItems(&updating_items, heap_->shared_space());
     }
-    CollectRememberedSetUpdatingItems(&updating_items, heap()->lo_space());
-    CollectRememberedSetUpdatingItems(&updating_items, heap()->code_lo_space());
-    if (heap()->shared_lo_space()) {
+    CollectRememberedSetUpdatingItems(&updating_items, heap_->lo_space());
+    CollectRememberedSetUpdatingItems(&updating_items, heap_->code_lo_space());
+    if (heap_->shared_lo_space()) {
       CollectRememberedSetUpdatingItems(&updating_items,
-                                        heap()->shared_lo_space());
+                                        heap_->shared_lo_space());
     }
 
     // Iterating to space may require a valid body descriptor for e.g.
     // WasmStruct which races with updating a slot in Map. Since to space is
     // empty after a full GC, such races can't happen.
-    DCHECK_IMPLIES(heap()->new_space(), heap()->new_space()->Size() == 0);
+    DCHECK_IMPLIES(heap_->new_space(), heap_->new_space()->Size() == 0);
 
     updating_items.push_back(
-        std::make_unique<EphemeronTableUpdatingItem>(heap()));
+        std::make_unique<EphemeronTableUpdatingItem>(heap_));
 
+    auto pointers_updating_job = std::make_unique<PointersUpdatingJob>(
+        heap_->isolate(), this, std::move(updating_items));
+    TRACE_GC_NOTE_WITH_FLOW("PointersUpdatingJob started",
+                            pointers_updating_job->trace_id(),
+                            TRACE_EVENT_FLAG_FLOW_OUT);
     V8::GetCurrentPlatform()
         ->CreateJob(v8::TaskPriority::kUserBlocking,
-                    std::make_unique<PointersUpdatingJob>(
-                        isolate(), std::move(updating_items)))
+                    std::move(pointers_updating_job))
         ->Join();
   }
 
   {
-    TRACE_GC(heap()->tracer(),
+    TRACE_GC(heap_->tracer(),
              GCTracer::Scope::MC_EVACUATE_UPDATE_POINTERS_WEAK);
     // Update pointers from external string table.
     heap_->UpdateReferencesInExternalStringTable(
@@ -5162,20 +4893,27 @@ void MarkCompactCollector::UpdatePointersAfterEvacuation() {
     // When GC was performed without a stack, the table was cleared and this
     // does nothing. In the case this was a GC with stack, we need to update
     // the entries for evacuated objects.
-    isolate()->string_forwarding_table()->UpdateAfterFullEvacuation();
+    // All entries are objects in shared space (unless
+    // --always-use-forwarding-table), so we only need to update pointers during
+    // a shared GC.
+    if (heap_->isolate()->OwnsStringTables() ||
+        V8_UNLIKELY(v8_flags.always_use_string_forwarding_table)) {
+      heap_->isolate()->string_forwarding_table()->UpdateAfterFullEvacuation();
+    }
 
     EvacuationWeakObjectRetainer evacuation_object_retainer;
-    heap()->ProcessWeakListRoots(&evacuation_object_retainer);
+    heap_->ProcessWeakListRoots(&evacuation_object_retainer);
   }
 
   // Flush the inner_pointer_to_code_cache which may now have stale contents.
-  isolate()->inner_pointer_to_code_cache()->Flush();
+  heap_->isolate()->inner_pointer_to_code_cache()->Flush();
 }
 
 void MarkCompactCollector::UpdatePointersInClientHeaps() {
-  if (!isolate()->is_shared_space_isolate()) return;
+  Isolate* const isolate = heap_->isolate();
+  if (!isolate->is_shared_space_isolate()) return;
 
-  isolate()->global_safepoint()->IterateClientIsolates(
+  isolate->global_safepoint()->IterateClientIsolates(
       [this](Isolate* client) { UpdatePointersInClientHeap(client); });
 }
 
@@ -5187,17 +4925,17 @@ void MarkCompactCollector::UpdatePointersInClientHeap(Isolate* client) {
     MemoryChunk* chunk = chunk_iterator.Next();
     CodePageMemoryModificationScope unprotect_code_page(chunk);
 
-    DCHECK_NULL(chunk->invalidated_slots<OLD_TO_SHARED>());
-    RememberedSet<OLD_TO_SHARED>::Iterate(
+    const auto slot_count = RememberedSet<OLD_TO_SHARED>::Iterate(
         chunk,
         [cage_base](MaybeObjectSlot slot) {
           return UpdateOldToSharedSlot(cage_base, slot);
         },
         SlotSet::FREE_EMPTY_BUCKETS);
 
-    if (chunk->InYoungGeneration()) chunk->ReleaseSlotSet<OLD_TO_SHARED>();
+    if (slot_count == 0 || chunk->InYoungGeneration())
+      chunk->ReleaseSlotSet(OLD_TO_SHARED);
 
-    RememberedSet<OLD_TO_SHARED>::IterateTyped(
+    const auto typed_slot_count = RememberedSet<OLD_TO_SHARED>::IterateTyped(
         chunk, [this](SlotType slot_type, Address slot) {
           // Using UpdateStrongSlot is OK here, because there are no weak
           // typed slots.
@@ -5207,7 +4945,8 @@ void MarkCompactCollector::UpdatePointersInClientHeap(Isolate* client) {
                 return UpdateStrongOldToSharedSlot(cage_base, slot);
               });
         });
-    if (chunk->InYoungGeneration()) chunk->ReleaseTypedSlotSet<OLD_TO_SHARED>();
+    if (typed_slot_count == 0 || chunk->InYoungGeneration())
+      chunk->ReleaseTypedSlotSet(OLD_TO_SHARED);
   }
 }
 
@@ -5232,14 +4971,13 @@ namespace {
 void ReRecordPage(Heap* heap, Address failed_start, Page* page) {
   DCHECK(page->IsFlagSet(Page::COMPACTION_WAS_ABORTED));
 
-  NonAtomicMarkingState* marking_state = heap->non_atomic_marking_state();
   // Aborted compaction page. We have to record slots here, since we
   // might not have recorded them in first place.
 
   // Remove mark bits in evacuated area.
-  marking_state->bitmap(page)->ClearRange(
-      page->AddressToMarkbitIndex(page->area_start()),
-      page->AddressToMarkbitIndex(failed_start));
+  page->marking_bitmap()->ClearRange<AccessMode::NON_ATOMIC>(
+      MarkingBitmap::AddressToIndex(page->area_start()),
+      MarkingBitmap::LimitAddressToIndex(failed_start));
 
   // Remove outdated slots.
   RememberedSet<OLD_TO_NEW>::RemoveRange(page, page->address(), failed_start,
@@ -5247,46 +4985,35 @@ void ReRecordPage(Heap* heap, Address failed_start, Page* page) {
   RememberedSet<OLD_TO_NEW>::RemoveRangeTyped(page, page->address(),
                                               failed_start);
 
+  RememberedSet<OLD_TO_NEW_BACKGROUND>::RemoveRange(
+      page, page->address(), failed_start, SlotSet::FREE_EMPTY_BUCKETS);
+  DCHECK_NULL(page->typed_slot_set<OLD_TO_NEW_BACKGROUND>());
+
   RememberedSet<OLD_TO_SHARED>::RemoveRange(page, page->address(), failed_start,
                                             SlotSet::FREE_EMPTY_BUCKETS);
   RememberedSet<OLD_TO_SHARED>::RemoveRangeTyped(page, page->address(),
                                                  failed_start);
 
-  // Remove invalidated slots.
-  if (failed_start > page->area_start()) {
-    InvalidatedSlotsCleanup old_to_new_cleanup =
-        InvalidatedSlotsCleanup::OldToNew(page);
-    old_to_new_cleanup.Free(page->area_start(), failed_start);
-
-    InvalidatedSlotsCleanup old_to_shared_cleanup =
-        InvalidatedSlotsCleanup::OldToShared(page);
-    old_to_shared_cleanup.Free(page->area_start(), failed_start);
-  }
-
-  // Recompute live bytes.
-  LiveObjectVisitor::RecomputeLiveBytes(page, marking_state);
-  // Re-record slots.
-  EvacuateRecordOnlyVisitor record_visitor(heap);
-  LiveObjectVisitor::VisitBlackObjectsNoFail(page, marking_state,
-                                             &record_visitor);
+  // Re-record slots and recompute live bytes.
+  EvacuateRecordOnlyVisitor visitor(heap);
+  LiveObjectVisitor::VisitMarkedObjectsNoFail(page, &visitor);
+  page->SetLiveBytes(visitor.live_object_size());
   // Array buffers will be processed during pointer updating.
 }
 
 }  // namespace
 
 size_t MarkCompactCollector::PostProcessAbortedEvacuationCandidates() {
-  CHECK_IMPLIES(v8_flags.crash_on_aborted_evacuation,
-                aborted_evacuation_candidates_due_to_oom_.empty());
   for (auto start_and_page : aborted_evacuation_candidates_due_to_oom_) {
     Page* page = start_and_page.second;
     DCHECK(!page->IsFlagSet(Page::COMPACTION_WAS_ABORTED));
     page->SetFlag(Page::COMPACTION_WAS_ABORTED);
   }
   for (auto start_and_page : aborted_evacuation_candidates_due_to_oom_) {
-    ReRecordPage(heap(), start_and_page.first, start_and_page.second);
+    ReRecordPage(heap_, start_and_page.first, start_and_page.second);
   }
   for (auto start_and_page : aborted_evacuation_candidates_due_to_flags_) {
-    ReRecordPage(heap(), start_and_page.first, start_and_page.second);
+    ReRecordPage(heap_, start_and_page.first, start_and_page.second);
   }
   const size_t aborted_pages =
       aborted_evacuation_candidates_due_to_oom_.size() +
@@ -5314,7 +5041,7 @@ void MarkCompactCollector::ReleaseEvacuationCandidates() {
   for (Page* p : old_space_evacuation_pages_) {
     if (!p->IsEvacuationCandidate()) continue;
     PagedSpace* space = static_cast<PagedSpace*>(p->owner());
-    non_atomic_marking_state()->SetLiveBytes(p, 0);
+    p->SetLiveBytes(0);
     CHECK(p->SweepingDone());
     space->ReleasePage(p);
   }
@@ -5323,13 +5050,13 @@ void MarkCompactCollector::ReleaseEvacuationCandidates() {
 }
 
 void MarkCompactCollector::StartSweepNewSpace() {
-  PagedSpaceForNewSpace* paged_space = heap()->paged_new_space()->paged_space();
+  PagedSpaceForNewSpace* paged_space = heap_->paged_new_space()->paged_space();
   paged_space->ClearAllocatorState();
 
   int will_be_swept = 0;
 
   DCHECK_EQ(Heap::ResizeNewSpaceMode::kNone, resize_new_space_);
-  resize_new_space_ = heap()->ShouldResizeNewSpace();
+  resize_new_space_ = heap_->ShouldResizeNewSpace();
   if (resize_new_space_ == Heap::ResizeNewSpaceMode::kShrink) {
     paged_space->StartShrinking();
   }
@@ -5339,7 +5066,7 @@ void MarkCompactCollector::StartSweepNewSpace() {
     Page* p = *(it++);
     DCHECK(p->SweepingDone());
 
-    if (non_atomic_marking_state()->live_bytes(p) > 0) {
+    if (p->live_bytes() > 0) {
       // Non-empty pages will be evacuated/promoted.
       continue;
     }
@@ -5353,967 +5080,128 @@ void MarkCompactCollector::StartSweepNewSpace() {
   }
 
   if (v8_flags.gc_verbose) {
-    PrintIsolate(isolate(), "sweeping: space=%s initialized_for_sweeping=%d",
-                 paged_space->name(), will_be_swept);
+    PrintIsolate(heap_->isolate(),
+                 "sweeping: space=%s initialized_for_sweeping=%d",
+                 ToString(paged_space->identity()), will_be_swept);
+  }
+}
+
+void MarkCompactCollector::StartSweepSpace(PagedSpace* space) {
+  DCHECK_NE(NEW_SPACE, space->identity());
+  space->ClearAllocatorState();
+
+  int will_be_swept = 0;
+  bool unused_page_present = false;
+
+  Sweeper* sweeper = heap_->sweeper();
+
+  // Loop needs to support deletion if live bytes == 0 for a page.
+  for (auto it = space->begin(); it != space->end();) {
+    Page* p = *(it++);
+    DCHECK(p->SweepingDone());
+
+    if (p->IsEvacuationCandidate()) {
+      DCHECK_NE(NEW_SPACE, space->identity());
+      // Will be processed in Evacuate.
+      continue;
+    }
+
+    // One unused page is kept, all further are released before sweeping them.
+    if (p->live_bytes() == 0) {
+      if (unused_page_present) {
+        if (v8_flags.gc_verbose) {
+          PrintIsolate(heap_->isolate(), "sweeping: released page: %p",
+                       static_cast<void*>(p));
+        }
+        space->ReleasePage(p);
+        continue;
+      }
+      unused_page_present = true;
+    }
+
+    sweeper->AddPage(space->identity(), p);
+    will_be_swept++;
+  }
+
+  if (v8_flags.gc_verbose) {
+    PrintIsolate(heap_->isolate(),
+                 "sweeping: space=%s initialized_for_sweeping=%d",
+                 ToString(space->identity()), will_be_swept);
   }
 }
 
 void MarkCompactCollector::SweepLargeSpace(LargeObjectSpace* space) {
-  auto* marking_state = heap()->non_atomic_marking_state();
-  PtrComprCageBase cage_base(heap()->isolate());
+  PtrComprCageBase cage_base(heap_->isolate());
   size_t surviving_object_size = 0;
   for (auto it = space->begin(); it != space->end();) {
     LargePage* current = *(it++);
-    HeapObject object = current->GetObject();
-    DCHECK(!marking_state->IsGrey(object));
-    if (!marking_state->IsMarked(object)) {
+    Tagged<HeapObject> object = current->GetObject();
+    if (!marking_state_->IsMarked(object)) {
       // Object is dead and page can be released.
       space->RemovePage(current);
-      heap()->memory_allocator()->Free(MemoryAllocator::FreeMode::kConcurrently,
-                                       current);
+      heap_->memory_allocator()->Free(MemoryAllocator::FreeMode::kConcurrently,
+                                      current);
 
       continue;
     }
-    Marking::MarkWhite(non_atomic_marking_state()->MarkBitFrom(object));
+    MarkBit::From(object).Clear();
     current->ProgressBar().ResetIfEnabled();
-    non_atomic_marking_state()->SetLiveBytes(current, 0);
-    surviving_object_size += static_cast<size_t>(object.Size(cage_base));
+    current->SetLiveBytes(0);
+    surviving_object_size += static_cast<size_t>(object->Size(cage_base));
   }
   space->set_objects_size(surviving_object_size);
 }
 
 void MarkCompactCollector::Sweep() {
-  DCHECK(!sweeper()->sweeping_in_progress());
-  TRACE_GC_EPOCH(heap()->tracer(), GCTracer::Scope::MC_SWEEP,
-                 ThreadKind::kMain);
+  DCHECK(!sweeper_->sweeping_in_progress());
+  sweeper_->InitializeMajorSweeping();
+
+  TRACE_GC_EPOCH_WITH_FLOW(
+      heap_->tracer(), GCTracer::Scope::MC_SWEEP, ThreadKind::kMain,
+      sweeper_->GetTraceIdForFlowEvent(GCTracer::Scope::MC_SWEEP),
+      TRACE_EVENT_FLAG_FLOW_OUT);
 #ifdef DEBUG
   state_ = SWEEP_SPACES;
 #endif
 
   {
-    GCTracer::Scope sweep_scope(heap()->tracer(), GCTracer::Scope::MC_SWEEP_LO,
+    GCTracer::Scope sweep_scope(heap_->tracer(), GCTracer::Scope::MC_SWEEP_LO,
                                 ThreadKind::kMain);
-    SweepLargeSpace(heap()->lo_space());
+    SweepLargeSpace(heap_->lo_space());
   }
   {
     GCTracer::Scope sweep_scope(
-        heap()->tracer(), GCTracer::Scope::MC_SWEEP_CODE_LO, ThreadKind::kMain);
-    SweepLargeSpace(heap()->code_lo_space());
+        heap_->tracer(), GCTracer::Scope::MC_SWEEP_CODE_LO, ThreadKind::kMain);
+    SweepLargeSpace(heap_->code_lo_space());
   }
-  if (heap()->shared_space()) {
-    GCTracer::Scope sweep_scope(heap()->tracer(),
+  if (heap_->shared_space()) {
+    GCTracer::Scope sweep_scope(heap_->tracer(),
                                 GCTracer::Scope::MC_SWEEP_SHARED_LO,
                                 ThreadKind::kMain);
-    SweepLargeSpace(heap()->shared_lo_space());
+    SweepLargeSpace(heap_->shared_lo_space());
   }
   {
-    GCTracer::Scope sweep_scope(heap()->tracer(), GCTracer::Scope::MC_SWEEP_OLD,
+    GCTracer::Scope sweep_scope(heap_->tracer(), GCTracer::Scope::MC_SWEEP_OLD,
                                 ThreadKind::kMain);
-    StartSweepSpace(heap()->old_space());
+    StartSweepSpace(heap_->old_space());
   }
   {
-    GCTracer::Scope sweep_scope(
-        heap()->tracer(), GCTracer::Scope::MC_SWEEP_CODE, ThreadKind::kMain);
-    StartSweepSpace(heap()->code_space());
+    GCTracer::Scope sweep_scope(heap_->tracer(), GCTracer::Scope::MC_SWEEP_CODE,
+                                ThreadKind::kMain);
+    StartSweepSpace(heap_->code_space());
   }
-  if (heap()->shared_space()) {
+  if (heap_->shared_space()) {
     GCTracer::Scope sweep_scope(
-        heap()->tracer(), GCTracer::Scope::MC_SWEEP_SHARED, ThreadKind::kMain);
-    StartSweepSpace(heap()->shared_space());
+        heap_->tracer(), GCTracer::Scope::MC_SWEEP_SHARED, ThreadKind::kMain);
+    StartSweepSpace(heap_->shared_space());
   }
-  if (v8_flags.minor_mc && heap()->new_space()) {
-    GCTracer::Scope sweep_scope(heap()->tracer(), GCTracer::Scope::MC_SWEEP_NEW,
+  if (v8_flags.minor_ms && heap_->new_space()) {
+    GCTracer::Scope sweep_scope(heap_->tracer(), GCTracer::Scope::MC_SWEEP_NEW,
                                 ThreadKind::kMain);
     StartSweepNewSpace();
   }
 
-  sweeper()->StartSweeping(garbage_collector_);
-}
-
-namespace {
-
-#ifdef VERIFY_HEAP
-
-class YoungGenerationMarkingVerifier : public MarkingVerifier {
- public:
-  explicit YoungGenerationMarkingVerifier(Heap* heap)
-      : MarkingVerifier(heap),
-        marking_state_(heap->non_atomic_marking_state()) {}
-
-  ConcurrentBitmap<AccessMode::NON_ATOMIC>* bitmap(
-      const MemoryChunk* chunk) override {
-    return marking_state_->bitmap(chunk);
-  }
-
-  bool IsMarked(HeapObject object) override {
-    return marking_state_->IsMarked(object);
-  }
-
-  void Run() override {
-    VerifyRoots();
-    VerifyMarking(heap_->new_space());
-  }
-
-  GarbageCollector collector() const override {
-    return GarbageCollector::MINOR_MARK_COMPACTOR;
-  }
-
- protected:
-  void VerifyMap(Map map) override { VerifyHeapObjectImpl(map); }
-
-  void VerifyPointers(ObjectSlot start, ObjectSlot end) override {
-    VerifyPointersImpl(start, end);
-  }
-
-  void VerifyPointers(MaybeObjectSlot start, MaybeObjectSlot end) override {
-    VerifyPointersImpl(start, end);
-  }
-  void VerifyCodePointer(CodeObjectSlot slot) override {
-    // Code slots never appear in new space because
-    // Code objects, the only object that can contain code pointers, are
-    // always allocated in the old space.
-    UNREACHABLE();
-  }
-
-  void VisitCodeTarget(RelocInfo* rinfo) override {
-    InstructionStream target =
-        InstructionStream::FromTargetAddress(rinfo->target_address());
-    VerifyHeapObjectImpl(target);
-  }
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override {
-    VerifyHeapObjectImpl(rinfo->target_object(cage_base()));
-  }
-  void VerifyRootPointers(FullObjectSlot start, FullObjectSlot end) override {
-    VerifyPointersImpl(start, end);
-  }
-
- private:
-  V8_INLINE void VerifyHeapObjectImpl(HeapObject heap_object) {
-    CHECK_IMPLIES(Heap::InYoungGeneration(heap_object), IsMarked(heap_object));
-  }
-
-  template <typename TSlot>
-  V8_INLINE void VerifyPointersImpl(TSlot start, TSlot end) {
-    PtrComprCageBase cage_base =
-        GetPtrComprCageBaseFromOnHeapAddress(start.address());
-    for (TSlot slot = start; slot < end; ++slot) {
-      typename TSlot::TObject object = slot.load(cage_base);
-      HeapObject heap_object;
-      // Minor MC treats weak references as strong.
-      if (object.GetHeapObject(&heap_object)) {
-        VerifyHeapObjectImpl(heap_object);
-      }
-    }
-  }
-
-  NonAtomicMarkingState* const marking_state_;
-};
-
-#endif  // VERIFY_HEAP
-
-bool IsUnmarkedObjectForYoungGeneration(Heap* heap, FullObjectSlot p) {
-  DCHECK_IMPLIES(Heap::InYoungGeneration(*p), Heap::InToPage(*p));
-  return Heap::InYoungGeneration(*p) &&
-         !heap->non_atomic_marking_state()->IsMarked(HeapObject::cast(*p));
-}
-
-}  // namespace
-
-YoungGenerationMainMarkingVisitor::YoungGenerationMainMarkingVisitor(
-    Isolate* isolate, MarkingState* marking_state,
-    MarkingWorklists::Local* worklists_local)
-    : YoungGenerationMarkingVisitorBase<YoungGenerationMainMarkingVisitor,
-                                        MarkingState>(isolate, worklists_local),
-      marking_state_(marking_state) {}
-
-bool YoungGenerationMainMarkingVisitor::ShouldVisit(HeapObject object) {
-  CHECK(marking_state_->GreyToBlack(object));
-  return true;
-}
-
-MinorMarkCompactCollector::~MinorMarkCompactCollector() = default;
-
-void MinorMarkCompactCollector::SetUp() {}
-
-void MinorMarkCompactCollector::TearDown() {
-  if (heap()->incremental_marking()->IsMinorMarking()) {
-    local_marking_worklists()->Publish();
-    heap()->main_thread_local_heap()->marking_barrier()->PublishIfNeeded();
-    // Marking barriers of LocalHeaps will be published in their destructors.
-    marking_worklists()->Clear();
-  }
-}
-
-void MinorMarkCompactCollector::FinishConcurrentMarking() {
-  if (v8_flags.concurrent_minor_mc_marking) {
-    DCHECK_EQ(heap()->concurrent_marking()->garbage_collector(),
-              GarbageCollector::MINOR_MARK_COMPACTOR);
-    heap()->concurrent_marking()->Cancel();
-    heap()->concurrent_marking()->FlushMemoryChunkData(
-        non_atomic_marking_state());
-  }
-  if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap())) {
-    cpp_heap->FinishConcurrentMarkingIfNeeded();
-  }
-}
-
-// static
-constexpr size_t MinorMarkCompactCollector::kMaxParallelTasks;
-
-MinorMarkCompactCollector::MinorMarkCompactCollector(Heap* heap)
-    : CollectorBase(heap, GarbageCollector::MINOR_MARK_COMPACTOR),
-      sweeper_(heap_->sweeper()) {}
-
-std::pair<size_t, size_t> MinorMarkCompactCollector::ProcessMarkingWorklist(
-    size_t bytes_to_process) {
-  // TODO(v8:13012): Implement this later. It should be similar to
-  // MinorMarkCompactCollector::DrainMarkingWorklist.
-  UNREACHABLE();
-}
-
-void MinorMarkCompactCollector::PerformWrapperTracing() {
-  auto* cpp_heap = CppHeap::From(heap_->cpp_heap());
-  if (!cpp_heap) return;
-
-  DCHECK(CppHeap::From(heap_->cpp_heap())->generational_gc_supported());
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_MARK_EMBEDDER_TRACING);
-  cpp_heap->AdvanceTracing(std::numeric_limits<double>::infinity());
-}
-
-class MinorMarkCompactCollector::RootMarkingVisitor : public RootVisitor {
- public:
-  explicit RootMarkingVisitor(MinorMarkCompactCollector* collector)
-      : collector_(collector) {}
-
-  void VisitRootPointer(Root root, const char* description,
-                        FullObjectSlot p) final {
-    MarkObjectByPointer(p);
-  }
-
-  void VisitRootPointers(Root root, const char* description,
-                         FullObjectSlot start, FullObjectSlot end) final {
-    for (FullObjectSlot p = start; p < end; ++p) {
-      DCHECK(!MapWord::IsPacked((*p).ptr()));
-      MarkObjectByPointer(p);
-    }
-  }
-
-  GarbageCollector collector() const override {
-    return GarbageCollector::MINOR_MARK_COMPACTOR;
-  }
-
- private:
-  V8_INLINE void MarkObjectByPointer(FullObjectSlot p) {
-    if (!(*p).IsHeapObject()) return;
-    collector_->MarkRootObject(HeapObject::cast(*p));
-  }
-  MinorMarkCompactCollector* const collector_;
-};
-
-void MinorMarkCompactCollector::StartMarking() {
-#ifdef VERIFY_HEAP
-  if (v8_flags.verify_heap) {
-    for (Page* page : *heap()->new_space()) {
-      CHECK(page->marking_bitmap<AccessMode::NON_ATOMIC>()->IsClean());
-    }
-  }
-#endif  // VERIFY_HEAP
-
-  auto* cpp_heap = CppHeap::From(heap_->cpp_heap());
-  if (cpp_heap && cpp_heap->generational_gc_supported()) {
-    TRACE_GC(heap()->tracer(),
-             GCTracer::Scope::MINOR_MC_MARK_EMBEDDER_PROLOGUE);
-    // InitializeTracing should be called before visitor initialization in
-    // StartMarking.
-    cpp_heap->InitializeTracing(CppHeap::CollectionType::kMinor);
-  }
-  local_marking_worklists_ = std::make_unique<MarkingWorklists::Local>(
-      marking_worklists(),
-      cpp_heap ? cpp_heap->CreateCppMarkingStateForMutatorThread()
-               : MarkingWorklists::Local::kNoCppMarkingState);
-  main_marking_visitor_ = std::make_unique<YoungGenerationMainMarkingVisitor>(
-      heap()->isolate(), marking_state(), local_marking_worklists());
-  if (cpp_heap && cpp_heap->generational_gc_supported()) {
-    TRACE_GC(heap()->tracer(),
-             GCTracer::Scope::MINOR_MC_MARK_EMBEDDER_PROLOGUE);
-    // StartTracing immediately starts marking which requires V8 worklists to
-    // be set up.
-    cpp_heap->StartTracing();
-  }
-}
-
-void MinorMarkCompactCollector::Finish() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_FINISH);
-
-  {
-    TRACE_GC(heap()->tracer(),
-             GCTracer::Scope::MINOR_MC_FINISH_ENSURE_CAPACITY);
-    switch (resize_new_space_) {
-      case ResizeNewSpaceMode::kShrink:
-        heap()->ReduceNewSpaceSize();
-        break;
-      case ResizeNewSpaceMode::kGrow:
-        heap()->ExpandNewSpaceSize();
-        break;
-      case ResizeNewSpaceMode::kNone:
-        break;
-    }
-    resize_new_space_ = ResizeNewSpaceMode::kNone;
-
-    if (!heap()->new_space()->EnsureCurrentCapacity()) {
-      heap()->FatalProcessOutOfMemory("NewSpace::EnsureCurrentCapacity");
-    }
-  }
-
-  heap()->new_space()->GarbageCollectionEpilogue();
-
-  main_marking_visitor_->Finalize();
-
-  local_marking_worklists_.reset();
-  main_marking_visitor_.reset();
-}
-
-void MinorMarkCompactCollector::CollectGarbage() {
-  DCHECK(!heap()->mark_compact_collector()->in_use());
-  DCHECK_NOT_NULL(heap()->new_space());
-  // Minor MC does not support processing the ephemeron remembered set.
-  DCHECK(heap()->ephemeron_remembered_set_.empty());
-  DCHECK(!heap()->array_buffer_sweeper()->sweeping_in_progress());
-  DCHECK(!sweeper()->AreSweeperTasksRunning());
-  DCHECK(sweeper()->IsSweepingDoneForSpace(NEW_SPACE));
-
-  heap()->new_space()->FreeLinearAllocationArea();
-
-  MarkLiveObjects();
-  ClearNonLiveReferences();
-#ifdef VERIFY_HEAP
-  if (v8_flags.verify_heap) {
-    YoungGenerationMarkingVerifier verifier(heap());
-    verifier.Run();
-  }
-#endif  // VERIFY_HEAP
-
-  Sweep();
-  Finish();
-
-#ifdef VERIFY_HEAP
-  // If concurrent sweeping is active, evacuation will be verified once sweeping
-  // is done using the FullEvacuationVerifier.
-  if (v8_flags.verify_heap && !sweeper()->sweeping_in_progress()) {
-    YoungGenerationEvacuationVerifier verifier(heap());
-    verifier.Run();
-  }
-#endif  // VERIFY_HEAP
-
-  auto* isolate = heap()->isolate();
-  isolate->global_handles()->UpdateListOfYoungNodes();
-  isolate->traced_handles()->UpdateListOfYoungNodes();
-}
-
-void MinorMarkCompactCollector::MakeIterable(
-    Page* p, FreeSpaceTreatmentMode free_space_mode) {
-  CHECK(!p->IsLargePage());
-  // We have to clear the full collectors markbits for the areas that we
-  // remove here.
-  Address free_start = p->area_start();
-
-  for (auto object_and_size :
-       LiveObjectRange<kBlackObjects>(p, marking_state()->bitmap(p))) {
-    HeapObject const object = object_and_size.first;
-    DCHECK(non_atomic_marking_state()->IsMarked(object));
-    Address free_end = object.address();
-    if (free_end != free_start) {
-      CHECK_GT(free_end, free_start);
-      size_t size = static_cast<size_t>(free_end - free_start);
-      DCHECK(heap_->non_atomic_marking_state()->bitmap(p)->AllBitsClearInRange(
-          p->AddressToMarkbitIndex(free_start),
-          p->AddressToMarkbitIndex(free_end)));
-      if (free_space_mode == FreeSpaceTreatmentMode::kZapFreeSpace) {
-        ZapCode(free_start, size);
-      }
-      p->heap()->CreateFillerObjectAt(free_start, static_cast<int>(size));
-    }
-    PtrComprCageBase cage_base(p->heap()->isolate());
-    Map map = object.map(cage_base, kAcquireLoad);
-    int size = object.SizeFromMap(map);
-    free_start = free_end + size;
-  }
-
-  if (free_start != p->area_end()) {
-    CHECK_GT(p->area_end(), free_start);
-    size_t size = static_cast<size_t>(p->area_end() - free_start);
-    DCHECK(heap_->non_atomic_marking_state()->bitmap(p)->AllBitsClearInRange(
-        p->AddressToMarkbitIndex(free_start),
-        p->AddressToMarkbitIndex(p->area_end())));
-    if (free_space_mode == FreeSpaceTreatmentMode::kZapFreeSpace) {
-      ZapCode(free_start, size);
-    }
-    p->heap()->CreateFillerObjectAt(free_start, static_cast<int>(size));
-  }
-}
-
-void MinorMarkCompactCollector::ClearNonLiveReferences() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_CLEAR);
-
-  if (V8_UNLIKELY(v8_flags.always_use_string_forwarding_table)) {
-    TRACE_GC(heap()->tracer(),
-             GCTracer::Scope::MINOR_MC_CLEAR_STRING_FORWARDING_TABLE);
-    // Clear non-live objects in the string fowarding table.
-    StringForwardingTableCleaner forwarding_table_cleaner(heap());
-    forwarding_table_cleaner.ProcessYoungObjects();
-  }
-
-  Heap::ExternalStringTable& external_string_table =
-      heap()->external_string_table_;
-  if (external_string_table.HasYoung()) {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_CLEAR_STRING_TABLE);
-    // Internalized strings are always stored in old space, so there is no
-    // need to clean them here.
-    ExternalStringTableCleaner<ExternalStringTableCleaningMode::kYoungOnly>
-        external_visitor(heap());
-    external_string_table.IterateYoung(&external_visitor);
-    external_string_table.CleanUpYoung();
-  }
-
-  if (isolate()->global_handles()->HasYoung() ||
-      isolate()->traced_handles()->HasYoung()) {
-    TRACE_GC(heap()->tracer(),
-             GCTracer::Scope::MINOR_MC_CLEAR_WEAK_GLOBAL_HANDLES);
-    isolate()->global_handles()->ProcessWeakYoungObjects(
-        nullptr, &IsUnmarkedObjectForYoungGeneration);
-    if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap());
-        cpp_heap && cpp_heap->generational_gc_supported()) {
-      isolate()->traced_handles()->ResetYoungDeadNodes(
-          &IsUnmarkedObjectForYoungGeneration);
-    } else {
-      isolate()->traced_handles()->ProcessYoungObjects(
-          nullptr, &IsUnmarkedObjectForYoungGeneration);
-    }
-  }
-}
-
-class PageMarkingItem;
-
-YoungGenerationMarkingTask::YoungGenerationMarkingTask(
-    Isolate* isolate, Heap* heap, MarkingWorklists* global_worklists)
-    : marking_worklists_local_(std::make_unique<MarkingWorklists::Local>(
-          global_worklists,
-          heap->cpp_heap()
-              ? CppHeap::From(heap->cpp_heap())->CreateCppMarkingState()
-              : MarkingWorklists::Local::kNoCppMarkingState)),
-      marking_state_(heap->marking_state()),
-      visitor_(isolate, marking_state_, marking_worklists_local()) {}
-
-void YoungGenerationMarkingTask::MarkYoungObject(HeapObject heap_object) {
-  if (marking_state_->TryMark(heap_object)) {
-    const auto visited_size = visitor_.Visit(heap_object);
-    if (visited_size) {
-      live_bytes_[MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(
-          heap_object))] += ALIGN_TO_ALLOCATION_ALIGNMENT(visited_size);
-    }
-    // Objects transition to black when visited.
-    DCHECK(marking_state_->IsMarked(heap_object));
-  }
-}
-
-void YoungGenerationMarkingTask::DrainMarkingWorklist() {
-  HeapObject heap_object;
-  while (marking_worklists_local_->Pop(&heap_object) ||
-         marking_worklists_local_->PopOnHold(&heap_object)) {
-    const auto visited_size = visitor_.Visit(heap_object);
-    if (visited_size) {
-      live_bytes_[MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(
-          heap_object))] += ALIGN_TO_ALLOCATION_ALIGNMENT(visited_size);
-    }
-  }
-  // Publish wrapper objects to the cppgc marking state, if registered.
-  marking_worklists_local_->PublishWrapper();
-}
-
-void YoungGenerationMarkingTask::PublishMarkingWorklist() {
-  marking_worklists_local_->Publish();
-}
-
-void YoungGenerationMarkingTask::Finalize() {
-  visitor_.Finalize();
-  for (auto& pair : live_bytes_) {
-    marking_state_->IncrementLiveBytes(pair.first, pair.second);
-  }
-}
-
-void PageMarkingItem::Process(YoungGenerationMarkingTask* task) {
-  base::MutexGuard guard(chunk_->mutex());
-  CodePageMemoryModificationScope memory_modification_scope(chunk_);
-  if (slots_type_ == SlotsType::kRegularSlots) {
-    MarkUntypedPointers(task);
-  } else {
-    MarkTypedPointers(task);
-  }
-}
-
-void PageMarkingItem::MarkUntypedPointers(YoungGenerationMarkingTask* task) {
-  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-               "PageMarkingItem::MarkUntypedPointers");
-  InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToNew(
-      chunk_, InvalidatedSlotsFilter::LivenessCheck::kNo);
-  RememberedSet<OLD_TO_NEW>::Iterate(
-      chunk_,
-      [this, task, &filter](MaybeObjectSlot slot) {
-        if (!filter.IsValid(slot.address())) return REMOVE_SLOT;
-        return CheckAndMarkObject(task, slot);
-      },
-      SlotSet::FREE_EMPTY_BUCKETS);
-  // The invalidated slots are not needed after old-to-new slots were
-  // processed.
-  chunk_->ReleaseInvalidatedSlots<OLD_TO_NEW>();
-}
-
-void PageMarkingItem::MarkTypedPointers(YoungGenerationMarkingTask* task) {
-  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
-               "PageMarkingItem::MarkTypedPointers");
-  RememberedSet<OLD_TO_NEW>::IterateTyped(
-      chunk_, [this, task](SlotType slot_type, Address slot) {
-        return UpdateTypedSlotHelper::UpdateTypedSlot(
-            heap(), slot_type, slot, [this, task](FullMaybeObjectSlot slot) {
-              return CheckAndMarkObject(task, slot);
-            });
-      });
-}
-
-template <typename TSlot>
-V8_INLINE SlotCallbackResult PageMarkingItem::CheckAndMarkObject(
-    YoungGenerationMarkingTask* task, TSlot slot) {
-  static_assert(
-      std::is_same<TSlot, FullMaybeObjectSlot>::value ||
-          std::is_same<TSlot, MaybeObjectSlot>::value,
-      "Only FullMaybeObjectSlot and MaybeObjectSlot are expected here");
-  MaybeObject object = *slot;
-  HeapObject heap_object;
-  if (object.GetHeapObject(&heap_object) &&
-      Heap::InYoungGeneration(heap_object)) {
-    task->MarkYoungObject(heap_object);
-    return KEEP_SLOT;
-  }
-  return REMOVE_SLOT;
-}
-
-void YoungGenerationMarkingJob::Run(JobDelegate* delegate) {
-  if (delegate->IsJoiningThread()) {
-    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MC_MARK_PARALLEL);
-    ProcessItems(delegate);
-  } else {
-    TRACE_GC_EPOCH(heap_->tracer(),
-                   GCTracer::Scope::MINOR_MC_BACKGROUND_MARKING,
-                   ThreadKind::kBackground);
-    ProcessItems(delegate);
-  }
-}
-
-size_t YoungGenerationMarkingJob::GetMaxConcurrency(size_t worker_count) const {
-  // Pages are not private to markers but we can still use them to estimate
-  // the amount of marking that is required.
-  const int kPagesPerTask = 2;
-  size_t items = remaining_marking_items_.load(std::memory_order_relaxed);
-  size_t num_tasks;
-  if (ShouldDrainMarkingWorklist()) {
-    num_tasks = std::max(
-        (items + 1) / kPagesPerTask,
-        global_worklists_->shared()->Size() +
-            global_worklists_->on_hold()
-                ->Size());  // TODO(v8:13012): If this is used with concurrent
-                            // marking, we need to remove on_hold() here.
-  } else {
-    num_tasks = (items + 1) / kPagesPerTask;
-  }
-
-  if (!v8_flags.parallel_marking) {
-    num_tasks = std::min<size_t>(1, num_tasks);
-  }
-  return std::min<size_t>(num_tasks,
-                          MinorMarkCompactCollector::kMaxParallelTasks);
-}
-
-void YoungGenerationMarkingJob::ProcessItems(JobDelegate* delegate) {
-  double marking_time = 0.0;
-  {
-    TimedScope scope(&marking_time);
-    const int task_id = delegate->GetTaskId();
-    DCHECK_LT(task_id, tasks_.size());
-    YoungGenerationMarkingTask& task = tasks_[task_id];
-    ProcessMarkingItems(&task);
-    if (ShouldDrainMarkingWorklist()) {
-      task.DrainMarkingWorklist();
-    } else {
-      task.PublishMarkingWorklist();
-    }
-  }
-  if (v8_flags.trace_minor_mc_parallel_marking) {
-    PrintIsolate(isolate_, "marking[%p]: time=%f\n", static_cast<void*>(this),
-                 marking_time);
-  }
-}
-
-void YoungGenerationMarkingJob::ProcessMarkingItems(
-    YoungGenerationMarkingTask* task) {
-  // TODO(v8:13012): YoungGenerationMarkingJob is generally used to compute the
-  // transitive closure. In the context of concurrent MinorMC, it currently only
-  // seeds the worklists from the old-to-new remembered set, but does not empty
-  // them (this is done concurrently). The class should be refactored to make
-  // this clearer.
-  while (remaining_marking_items_.load(std::memory_order_relaxed) > 0) {
-    base::Optional<size_t> index = generator_.GetNext();
-    if (!index) return;
-    for (size_t i = *index; i < marking_items_.size(); ++i) {
-      auto& work_item = marking_items_[i];
-      if (!work_item.TryAcquire()) break;
-      work_item.Process(task);
-      if (ShouldDrainMarkingWorklist()) {
-        task->DrainMarkingWorklist();
-      }
-      if (remaining_marking_items_.fetch_sub(1, std::memory_order_relaxed) <=
-          1) {
-        return;
-      }
-    }
-  }
-}
-
-void MinorMarkCompactCollector::MarkLiveObjectsInParallel(
-    RootMarkingVisitor* root_visitor, bool was_marked_incrementally) {
-  std::vector<PageMarkingItem> marking_items;
-
-  // Seed the root set (roots + old->new set).
-  {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_MARK_SEED);
-    isolate()->traced_handles()->ComputeWeaknessForYoungObjects(
-        &JSObject::IsUnmodifiedApiObject);
-    // MinorMC treats all weak roots except for global handles as strong.
-    // That is why we don't set skip_weak = true here and instead visit
-    // global handles separately.
-    heap()->IterateRoots(root_visitor,
-                         base::EnumSet<SkipRoot>{SkipRoot::kExternalStringTable,
-                                                 SkipRoot::kGlobalHandles,
-                                                 SkipRoot::kOldGeneration});
-    isolate()->global_handles()->IterateYoungStrongAndDependentRoots(
-        root_visitor);
-    if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap());
-        cpp_heap && cpp_heap->generational_gc_supported()) {
-      // Visit the Oilpan-to-V8 remembered set.
-      isolate()->traced_handles()->IterateAndMarkYoungRootsWithOldHosts(
-          root_visitor);
-      // Visit the V8-to-Oilpan remembered set.
-      cpp_heap->VisitCrossHeapRememberedSetIfNeeded([this](JSObject obj) {
-        VisitObjectWithEmbedderFields(obj, *local_marking_worklists());
-      });
-    } else {
-      // Otherwise, visit all young roots.
-      isolate()->traced_handles()->IterateYoungRoots(root_visitor);
-    }
-
-    if (!was_marked_incrementally) {
-      // Create items for each page.
-      RememberedSet<OLD_TO_NEW>::IterateMemoryChunks(
-          heap(), [&marking_items](MemoryChunk* chunk) {
-            if (chunk->slot_set<OLD_TO_NEW>()) {
-              marking_items.emplace_back(
-                  chunk, PageMarkingItem::SlotsType::kRegularSlots);
-            } else {
-              chunk->ReleaseInvalidatedSlots<OLD_TO_NEW>();
-            }
-
-            if (chunk->typed_slot_set<OLD_TO_NEW>()) {
-              marking_items.emplace_back(
-                  chunk, PageMarkingItem::SlotsType::kTypedSlots);
-            }
-          });
-    }
-  }
-
-  // Add tasks and run in parallel.
-  {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_MARK_CLOSURE_PARALLEL);
-
-    // CppGC starts parallel marking tasks that will trace TracedReferences.
-    if (heap_->cpp_heap()) {
-      CppHeap::From(heap_->cpp_heap())
-          ->EnterFinalPause(heap_->embedder_stack_state_);
-    }
-
-    // The main thread might hold local items, while GlobalPoolSize() ==
-    // 0. Flush to ensure these items are visible globally and picked up
-    // by the job.
-    local_marking_worklists_->Publish();
-
-    std::vector<YoungGenerationMarkingTask> tasks;
-    for (size_t i = 0; i < (v8_flags.parallel_marking ? kMaxParallelTasks : 1);
-         ++i) {
-      tasks.emplace_back(isolate(), heap(), marking_worklists());
-    }
-    V8::GetCurrentPlatform()
-        ->CreateJob(
-            v8::TaskPriority::kUserBlocking,
-            std::make_unique<YoungGenerationMarkingJob>(
-                isolate(), heap(), marking_worklists(),
-                std::move(marking_items), YoungMarkingJobType::kAtomic, tasks))
-        ->Join();
-    for (YoungGenerationMarkingTask& task : tasks) {
-      task.Finalize();
-    }
-    // If unified young generation is in progress, the parallel marker may add
-    // more entries into local_marking_worklists_.
-    DCHECK_IMPLIES(!v8_flags.cppgc_young_generation,
-                   local_marking_worklists_->IsEmpty());
-  }
-}
-
-void MinorMarkCompactCollector::MarkLiveObjects() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_MARK);
-
-  const bool was_marked_incrementally =
-      !heap_->incremental_marking()->IsStopped();
-  if (!was_marked_incrementally) {
-    StartMarking();
-  } else {
-    TRACE_GC(heap()->tracer(),
-             GCTracer::Scope::MINOR_MC_MARK_FINISH_INCREMENTAL);
-    auto* incremental_marking = heap_->incremental_marking();
-    DCHECK(incremental_marking->IsMinorMarking());
-    incremental_marking->Stop();
-    MarkingBarrier::PublishAll(heap());
-    // TODO(v8:13012): TRACE_GC with MINOR_MC_MARK_FULL_CLOSURE_PARALLEL_JOIN.
-    // TODO(v8:13012): Instead of finishing concurrent marking here, we could
-    // continue running it to replace parallel marking.
-    FinishConcurrentMarking();
-  }
-
-  DCHECK_NOT_NULL(local_marking_worklists_);
-  DCHECK_NOT_NULL(main_marking_visitor_);
-
-  RootMarkingVisitor root_visitor(this);
-
-  MarkLiveObjectsInParallel(&root_visitor, was_marked_incrementally);
-
-  {
-    // Finish marking the transitive closure on the main thread.
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_MARK_CLOSURE);
-    if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap())) {
-      cpp_heap->FinishConcurrentMarkingIfNeeded();
-    }
-    DrainMarkingWorklist();
-  }
-
-  if (was_marked_incrementally) {
-    MarkingBarrier::DeactivateAll(heap());
-  }
-
-  if (v8_flags.minor_mc_trace_fragmentation) {
-    TraceFragmentation();
-  }
-}
-
-void MinorMarkCompactCollector::DrainMarkingWorklist() {
-  PtrComprCageBase cage_base(isolate());
-  do {
-    PerformWrapperTracing();
-
-    HeapObject heap_object;
-    while (local_marking_worklists_->Pop(&heap_object)) {
-      DCHECK(!heap_object.IsFreeSpaceOrFiller(cage_base));
-      DCHECK(heap_object.IsHeapObject());
-      DCHECK(heap()->Contains(heap_object));
-      DCHECK(!non_atomic_marking_state()->IsUnmarked(heap_object));
-      const auto visited_size = main_marking_visitor_->Visit(heap_object);
-      if (visited_size) {
-        marking_state_->IncrementLiveBytes(
-            MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(heap_object)),
-            visited_size);
-      }
-    }
-  } while (!IsCppHeapMarkingFinished());
-  DCHECK(local_marking_worklists_->IsEmpty());
-}
-
-void MinorMarkCompactCollector::TraceFragmentation() {
-  NewSpace* new_space = heap()->new_space();
-  PtrComprCageBase cage_base(isolate());
-  const std::array<size_t, 4> free_size_class_limits = {0, 1024, 2048, 4096};
-  size_t free_bytes_of_class[free_size_class_limits.size()] = {0};
-  size_t live_bytes = 0;
-  size_t allocatable_bytes = 0;
-  for (Page* p :
-       PageRange(new_space->first_allocatable_address(), new_space->top())) {
-    Address free_start = p->area_start();
-    for (auto object_and_size : LiveObjectRange<kBlackObjects>(
-             p, non_atomic_marking_state()->bitmap(p))) {
-      HeapObject const object = object_and_size.first;
-      Address free_end = object.address();
-      if (free_end != free_start) {
-        size_t free_bytes = free_end - free_start;
-        int free_bytes_index = 0;
-        for (auto free_size_class_limit : free_size_class_limits) {
-          if (free_bytes >= free_size_class_limit) {
-            free_bytes_of_class[free_bytes_index] += free_bytes;
-          }
-          free_bytes_index++;
-        }
-      }
-      Map map = object.map(cage_base, kAcquireLoad);
-      int size = object.SizeFromMap(map);
-      live_bytes += size;
-      free_start = free_end + size;
-    }
-    size_t area_end =
-        p->Contains(new_space->top()) ? new_space->top() : p->area_end();
-    if (free_start != area_end) {
-      size_t free_bytes = area_end - free_start;
-      int free_bytes_index = 0;
-      for (auto free_size_class_limit : free_size_class_limits) {
-        if (free_bytes >= free_size_class_limit) {
-          free_bytes_of_class[free_bytes_index] += free_bytes;
-        }
-        free_bytes_index++;
-      }
-    }
-    allocatable_bytes += area_end - p->area_start();
-    CHECK_EQ(allocatable_bytes, live_bytes + free_bytes_of_class[0]);
-  }
-  PrintIsolate(isolate(),
-               "Minor Mark-Compact Fragmentation: allocatable_bytes=%zu "
-               "live_bytes=%zu "
-               "free_bytes=%zu free_bytes_1K=%zu free_bytes_2K=%zu "
-               "free_bytes_4K=%zu\n",
-               allocatable_bytes, live_bytes, free_bytes_of_class[0],
-               free_bytes_of_class[1], free_bytes_of_class[2],
-               free_bytes_of_class[3]);
-}
-
-bool MinorMarkCompactCollector::StartSweepNewSpace() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_SWEEP_NEW);
-  PagedSpaceForNewSpace* paged_space = heap()->paged_new_space()->paged_space();
-  paged_space->ClearAllocatorState();
-
-  int will_be_swept = 0;
-  bool has_promoted_pages = false;
-
-  DCHECK_EQ(Heap::ResizeNewSpaceMode::kNone, resize_new_space_);
-  resize_new_space_ = heap()->ShouldResizeNewSpace();
-  if (resize_new_space_ == Heap::ResizeNewSpaceMode::kShrink) {
-    paged_space->StartShrinking();
-  }
-
-  for (auto it = paged_space->begin(); it != paged_space->end();) {
-    Page* p = *(it++);
-    DCHECK(p->SweepingDone());
-
-    intptr_t live_bytes_on_page = non_atomic_marking_state()->live_bytes(p);
-    if (live_bytes_on_page == 0) {
-      if (paged_space->ShouldReleaseEmptyPage()) {
-        paged_space->ReleasePage(p);
-      } else {
-        sweeper()->SweepEmptyNewSpacePage(p);
-      }
-      continue;
-    }
-
-    if (ShouldMovePage(p, live_bytes_on_page, p->wasted_memory(),
-                       MemoryReductionMode::kNone, AlwaysPromoteYoung::kNo,
-                       heap()->tracer()->IsCurrentGCDueToAllocationFailure()
-                           ? PromoteUnusablePages::kYes
-                           : PromoteUnusablePages::kNo)) {
-      EvacuateNewSpacePageVisitor<NEW_TO_OLD>::Move(p);
-      has_promoted_pages = true;
-      sweeper()->AddPromotedPageForIteration(p);
-    } else {
-      // Page is not promoted. Sweep it instead.
-      sweeper()->AddNewSpacePage(p);
-      will_be_swept++;
-    }
-  }
-
-  if (v8_flags.gc_verbose) {
-    PrintIsolate(isolate(), "sweeping: space=%s initialized_for_sweeping=%d",
-                 paged_space->name(), will_be_swept);
-  }
-
-  return has_promoted_pages;
-}
-
-bool MinorMarkCompactCollector::SweepNewLargeSpace() {
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_SWEEP_NEW_LO);
-  NewLargeObjectSpace* new_lo_space = heap()->new_lo_space();
-  DCHECK_NOT_NULL(new_lo_space);
-
-  heap()->new_lo_space()->ResetPendingObject();
-
-  bool has_promoted_pages = false;
-
-  auto* marking_state = heap()->non_atomic_marking_state();
-  OldLargeObjectSpace* old_lo_space = heap()->lo_space();
-
-  for (auto it = new_lo_space->begin(); it != new_lo_space->end();) {
-    LargePage* current = *it;
-    it++;
-    HeapObject object = current->GetObject();
-    DCHECK(!marking_state->IsGrey(object));
-    if (!marking_state->IsMarked(object)) {
-      // Object is dead and page can be released.
-      new_lo_space->RemovePage(current);
-      heap()->memory_allocator()->Free(MemoryAllocator::FreeMode::kConcurrently,
-                                       current);
-      continue;
-    }
-    current->ClearFlag(MemoryChunk::TO_PAGE);
-    current->SetFlag(MemoryChunk::FROM_PAGE);
-    current->ProgressBar().ResetIfEnabled();
-    old_lo_space->PromoteNewLargeObject(current);
-    has_promoted_pages = true;
-    sweeper()->AddPromotedPageForIteration(current);
-  }
-  new_lo_space->set_objects_size(0);
-
-  return has_promoted_pages;
-}
-
-void MinorMarkCompactCollector::Sweep() {
-  DCHECK(!sweeper()->AreSweeperTasksRunning());
-  TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_SWEEP);
-
-  bool has_promoted_pages = false;
-  if (StartSweepNewSpace()) has_promoted_pages = true;
-  if (SweepNewLargeSpace()) has_promoted_pages = true;
-
-  if (v8_flags.verify_heap && has_promoted_pages) {
-    // Update the external string table in preparation for heap verification.
-    // Otherwise, updating the table will happen during the next full GC.
-    TRACE_GC(heap()->tracer(),
-             GCTracer::Scope::MINOR_MC_SWEEP_UPDATE_STRING_TABLE);
-    heap()->UpdateYoungReferencesInExternalStringTable([](Heap* heap,
-                                                          FullObjectSlot p) {
-      DCHECK(
-          !HeapObject::cast(*p).map_word(kRelaxedLoad).IsForwardingAddress());
-      return String::cast(*p);
-    });
-  }
-
-  sweeper_->StartSweeping(GarbageCollector::MINOR_MARK_COMPACTOR);
-
-#ifdef DEBUG
-  VerifyRememberedSetsAfterEvacuation(heap(),
-                                      GarbageCollector::MINOR_MARK_COMPACTOR);
-  heap()->VerifyCountersBeforeConcurrentSweeping(
-      GarbageCollector::MINOR_MARK_COMPACTOR);
-#endif
-
-  {
-    TRACE_GC(heap()->tracer(), GCTracer::Scope::MINOR_MC_SWEEP_START_JOBS);
-    sweeper()->StartSweeperTasks();
-    DCHECK_EQ(0, heap_->new_lo_space()->Size());
-    heap_->array_buffer_sweeper()->RequestSweep(
-        ArrayBufferSweeper::SweepingType::kYoung,
-        (heap_->new_space()->Size() == 0)
-            ? ArrayBufferSweeper::TreatAllYoungAsPromoted::kYes
-            : ArrayBufferSweeper::TreatAllYoungAsPromoted::kNo);
-  }
+  sweeper_->StartMajorSweeping();
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/mark-compact.h b/deps/v8/src/heap/mark-compact.h
index 556ce4f5b50dae..ceeb596edac85e 100644
--- a/deps/v8/src/heap/mark-compact.h
+++ b/deps/v8/src/heap/mark-compact.h
@@ -5,20 +5,15 @@
 #ifndef V8_HEAP_MARK_COMPACT_H_
 #define V8_HEAP_MARK_COMPACT_H_
 
-#include <atomic>
 #include <vector>
 
 #include "include/v8-internal.h"
 #include "src/common/globals.h"
-#include "src/heap/base/worklist.h"
-#include "src/heap/concurrent-marking.h"
-#include "src/heap/index-generator.h"
 #include "src/heap/marking-state.h"
 #include "src/heap/marking-visitor.h"
 #include "src/heap/marking-worklist.h"
 #include "src/heap/marking.h"
 #include "src/heap/memory-measurement.h"
-#include "src/heap/parallel-work-item.h"
 #include "src/heap/spaces.h"
 #include "src/heap/sweeper.h"
 
@@ -26,294 +21,16 @@ namespace v8 {
 namespace internal {
 
 // Forward declarations.
-class EvacuationJobTraits;
 class HeapObjectVisitor;
-class ItemParallelJob;
 class LargeObjectSpace;
 class LargePage;
-class MigrationObserver;
-class PagedNewSpace;
-class ReadOnlySpace;
+class MainMarkingVisitor;
 class RecordMigratedSlotVisitor;
-class UpdatingItem;
-class YoungGenerationMarkingTask;
-
-class MarkBitCellIterator {
- public:
-  MarkBitCellIterator(const MemoryChunk* chunk, Bitmap* bitmap)
-      : chunk_(chunk) {
-    last_cell_index_ =
-        Bitmap::IndexToCell(chunk_->AddressToMarkbitIndex(chunk_->area_end()));
-    cell_base_ = chunk_->address();
-    cell_index_ =
-        Bitmap::IndexToCell(chunk_->AddressToMarkbitIndex(cell_base_));
-    cells_ = bitmap->cells();
-  }
-
-  inline bool Done() { return cell_index_ >= last_cell_index_; }
-
-  inline bool HasNext() { return cell_index_ < last_cell_index_ - 1; }
-
-  inline MarkBit::CellType* CurrentCell() {
-    DCHECK_EQ(cell_index_, Bitmap::IndexToCell(Bitmap::CellAlignIndex(
-                               chunk_->AddressToMarkbitIndex(cell_base_))));
-    return &cells_[cell_index_];
-  }
-
-  inline Address CurrentCellBase() {
-    DCHECK_EQ(cell_index_, Bitmap::IndexToCell(Bitmap::CellAlignIndex(
-                               chunk_->AddressToMarkbitIndex(cell_base_))));
-    return cell_base_;
-  }
-
-  V8_WARN_UNUSED_RESULT inline bool Advance() {
-    cell_base_ += Bitmap::kBitsPerCell * kTaggedSize;
-    return ++cell_index_ != last_cell_index_;
-  }
-
-  inline bool Advance(unsigned int new_cell_index) {
-    if (new_cell_index != cell_index_) {
-      DCHECK_GT(new_cell_index, cell_index_);
-      DCHECK_LE(new_cell_index, last_cell_index_);
-      unsigned int diff = new_cell_index - cell_index_;
-      cell_index_ = new_cell_index;
-      cell_base_ += diff * (Bitmap::kBitsPerCell * kTaggedSize);
-      return true;
-    }
-    return false;
-  }
-
-  // Return the next mark bit cell. If there is no next it returns 0;
-  inline MarkBit::CellType PeekNext() {
-    if (HasNext()) {
-      return cells_[cell_index_ + 1];
-    }
-    return 0;
-  }
-
- private:
-  const MemoryChunk* chunk_;
-  MarkBit::CellType* cells_;
-  unsigned int last_cell_index_;
-  unsigned int cell_index_;
-  Address cell_base_;
-};
-
-enum LiveObjectIterationMode { kBlackObjects, kGreyObjects, kAllLiveObjects };
-
-template <LiveObjectIterationMode mode>
-class LiveObjectRange {
- public:
-  class iterator {
-   public:
-    using value_type = std::pair<HeapObject, int /* size */>;
-    using pointer = const value_type*;
-    using reference = const value_type&;
-    using iterator_category = std::forward_iterator_tag;
-
-    inline iterator(const MemoryChunk* chunk, Bitmap* bitmap, Address start);
-
-    inline iterator& operator++();
-    inline iterator operator++(int);
-
-    bool operator==(iterator other) const {
-      return current_object_ == other.current_object_;
-    }
-
-    bool operator!=(iterator other) const { return !(*this == other); }
-
-    value_type operator*() {
-      return std::make_pair(current_object_, current_size_);
-    }
-
-   private:
-    inline void AdvanceToNextValidObject();
-
-    const MemoryChunk* const chunk_;
-    Map const one_word_filler_map_;
-    Map const two_word_filler_map_;
-    Map const free_space_map_;
-    MarkBitCellIterator it_;
-    Address cell_base_;
-    MarkBit::CellType current_cell_;
-    HeapObject current_object_;
-    int current_size_;
-  };
-
-  LiveObjectRange(const MemoryChunk* chunk, Bitmap* bitmap)
-      : chunk_(chunk),
-        bitmap_(bitmap),
-        start_(chunk_->area_start()),
-        end_(chunk->area_end()) {
-    DCHECK(!chunk->IsLargePage());
-  }
-
-  inline iterator begin();
-  inline iterator end();
-
- private:
-  const MemoryChunk* const chunk_;
-  Bitmap* bitmap_;
-  Address start_;
-  Address end_;
-};
-
-class LiveObjectVisitor : AllStatic {
- public:
-  // Visits black objects on a MemoryChunk until the Visitor returns |false| for
-  // an object.
-  template <class Visitor, typename MarkingState>
-  static bool VisitBlackObjects(MemoryChunk* chunk, MarkingState* state,
-                                Visitor* visitor, HeapObject* failed_object);
-
-  // Visits black objects on a MemoryChunk. The visitor is not allowed to fail
-  // visitation for an object.
-  template <class Visitor, typename MarkingState>
-  static void VisitBlackObjectsNoFail(MemoryChunk* chunk, MarkingState* state,
-                                      Visitor* visitor);
-
-  template <typename MarkingState>
-  static void RecomputeLiveBytes(MemoryChunk* chunk, MarkingState* state);
-};
-
-enum class AlwaysPromoteYoung { kYes, kNo };
-enum class PromoteUnusablePages { kYes, kNo };
-enum class MemoryReductionMode { kNone, kShouldReduceMemory };
-enum PageEvacuationMode { NEW_TO_NEW, NEW_TO_OLD };
-enum class RememberedSetUpdatingMode { ALL, OLD_TO_NEW_ONLY };
-
-// This visitor is used for marking on the main thread. It is cheaper than
-// the concurrent marking visitor because it does not snapshot JSObjects.
-template <typename MarkingState>
-class MainMarkingVisitor final
-    : public MarkingVisitorBase<MainMarkingVisitor<MarkingState>,
-                                MarkingState> {
- public:
-  MainMarkingVisitor(MarkingState* marking_state,
-                     MarkingWorklists::Local* local_marking_worklists,
-                     WeakObjects::Local* local_weak_objects, Heap* heap,
-                     unsigned mark_compact_epoch,
-                     base::EnumSet<CodeFlushMode> code_flush_mode,
-                     bool trace_embedder_fields,
-                     bool should_keep_ages_unchanged)
-      : MarkingVisitorBase<MainMarkingVisitor<MarkingState>, MarkingState>(
-            local_marking_worklists, local_weak_objects, heap,
-            mark_compact_epoch, code_flush_mode, trace_embedder_fields,
-            should_keep_ages_unchanged),
-        marking_state_(marking_state) {}
-
-  bool ShouldVisit(HeapObject object) {
-    CHECK(marking_state_->GreyToBlack(object));
-    return true;
-  }
-
- private:
-  // Functions required by MarkingVisitorBase.
-
-  template <typename TSlot>
-  void RecordSlot(HeapObject object, TSlot slot, HeapObject target);
-
-  void RecordRelocSlot(RelocInfo* rinfo, HeapObject target);
-
-  MarkingState* marking_state() { return marking_state_; }
-
-  TraceRetainingPathMode retaining_path_mode() {
-    return (V8_UNLIKELY(v8_flags.track_retaining_path))
-               ? TraceRetainingPathMode::kEnabled
-               : TraceRetainingPathMode::kDisabled;
-  }
-
-  MarkingState* const marking_state_;
-
-  friend class MarkingVisitorBase<MainMarkingVisitor<MarkingState>,
-                                  MarkingState>;
-};
-
-class YoungGenerationMainMarkingVisitor final
-    : public YoungGenerationMarkingVisitorBase<
-          YoungGenerationMainMarkingVisitor, MarkingState> {
- public:
-  YoungGenerationMainMarkingVisitor(Isolate* isolate,
-                                    MarkingState* marking_state,
-                                    MarkingWorklists::Local* worklists_local);
-
-  bool ShouldVisit(HeapObject object);
-
- private:
-  MarkingState* marking_state() { return marking_state_; }
-  MarkingState* const marking_state_;
-
-  friend class YoungGenerationMarkingVisitorBase<
-      YoungGenerationMainMarkingVisitor, MarkingState>;
-};
-
-class CollectorBase {
- public:
-  GarbageCollector garbage_collector() { return garbage_collector_; }
-
-  virtual void SetUp() {}
-  virtual void TearDown() {}
-  virtual void CollectGarbage() = 0;
-  virtual void Prepare() = 0;
-  virtual void StartMarking() = 0;
-
-  MarkingWorklists* marking_worklists() { return &marking_worklists_; }
-
-  MarkingWorklists::Local* local_marking_worklists() const {
-    return local_marking_worklists_.get();
-  }
-
-  // Drains the main thread marking worklist until the specified number of
-  // bytes are processed. If the number of bytes is zero, then the worklist
-  // is drained until it is empty.
-  virtual std::pair<size_t, size_t> ProcessMarkingWorklist(
-      size_t bytes_to_process) = 0;
-
-  virtual void Finish() = 0;
-
-  bool IsMajorMC();
-
- private:
-  std::vector<Page*> new_space_evacuation_pages_;
-
- protected:
-  using ResizeNewSpaceMode = Heap::ResizeNewSpaceMode;
-
-  inline Heap* heap() const { return heap_; }
-  inline Isolate* isolate();
-
-  MarkingState* marking_state() { return marking_state_; }
-
-  NonAtomicMarkingState* non_atomic_marking_state() {
-    return non_atomic_marking_state_;
-  }
-
-  void StartSweepSpace(PagedSpace* space);
-
-  bool IsCppHeapMarkingFinished() const;
-
-  Heap* heap_;
-  GarbageCollector garbage_collector_;
-  MarkingWorklists marking_worklists_;
-
-  std::unique_ptr<MarkingWorklists::Local> local_marking_worklists_;
-
-  MarkingState* const marking_state_;
-  NonAtomicMarkingState* const non_atomic_marking_state_;
-
-  ResizeNewSpaceMode resize_new_space_ = ResizeNewSpaceMode::kNone;
-
-  explicit CollectorBase(Heap* heap, GarbageCollector collector);
-  virtual ~CollectorBase() = default;
-};
 
 // Collector for young and old generation.
-class MarkCompactCollector final : public CollectorBase {
+class MarkCompactCollector final {
  public:
-  using MarkingVisitor = MainMarkingVisitor<MarkingState>;
-
   class CustomRootBodyMarkingVisitor;
-  class ClientCustomRootBodyMarkingVisitor;
   class SharedHeapObjectVisitor;
   class RootMarkingVisitor;
 
@@ -327,26 +44,19 @@ class MarkCompactCollector final : public CollectorBase {
     kTrackNewlyDiscoveredObjects
   };
 
-  static MarkCompactCollector* From(CollectorBase* collector) {
-    return static_cast<MarkCompactCollector*>(collector);
-  }
-
   // Callback function for telling whether the object *p is an unmarked
   // heap object.
   static bool IsUnmarkedHeapObject(Heap* heap, FullObjectSlot p);
   static bool IsUnmarkedSharedHeapObject(Heap* heap, FullObjectSlot p);
 
   std::pair<size_t, size_t> ProcessMarkingWorklist(
-      size_t bytes_to_process) final;
-
-  std::pair<size_t, size_t> ProcessMarkingWorklist(
-      size_t bytes_to_process, MarkingWorklistProcessingMode mode);
+      v8::base::TimeDelta max_duration, size_t max_bytes_to_process,
+      MarkingWorklistProcessingMode mode);
 
-  void SetUp() final;
-  void TearDown() final;
+  void TearDown();
 
   // Performs a global garbage collection.
-  void CollectGarbage() final;
+  void CollectGarbage();
 
   void CollectEvacuationCandidates(PagedSpace* space);
 
@@ -354,7 +64,7 @@ class MarkCompactCollector final : public CollectorBase {
 
   // Prepares for GC by resetting relocation info in old and map spaces and
   // choosing spaces to compact.
-  void Prepare() final;
+  void Prepare();
 
   // Stop concurrent marking (either by preempting it right away or waiting for
   // it to complete as requested by |stop_request|).
@@ -363,11 +73,9 @@ class MarkCompactCollector final : public CollectorBase {
   // Returns whether compaction is running.
   bool StartCompaction(StartCompactionMode mode);
 
-  void AbortCompaction();
-
-  void StartMarking() final;
+  void StartMarking();
 
-  static inline bool IsOnEvacuationCandidate(Object obj) {
+  static inline bool IsOnEvacuationCandidate(Tagged<Object> obj) {
     return Page::FromAddress(obj.ptr())->IsEvacuationCandidate();
   }
 
@@ -379,23 +87,27 @@ class MarkCompactCollector final : public CollectorBase {
     uint32_t offset;
   };
 
-  static V8_EXPORT_PRIVATE bool IsMapOrForwarded(Map map);
-
-  static bool ShouldRecordRelocSlot(RelocInfo* rinfo, HeapObject target);
-  static RecordRelocSlotInfo ProcessRelocInfo(RelocInfo* rinfo,
-                                              HeapObject target);
-
-  static void RecordRelocSlot(RelocInfo* rinfo, HeapObject target);
-  V8_INLINE static void RecordSlot(HeapObject object, ObjectSlot slot,
-                                   HeapObject target);
-  V8_INLINE static void RecordSlot(HeapObject object, HeapObjectSlot slot,
-                                   HeapObject target);
+  static bool ShouldRecordRelocSlot(Tagged<InstructionStream> host,
+                                    RelocInfo* rinfo,
+                                    Tagged<HeapObject> target);
+  static RecordRelocSlotInfo ProcessRelocInfo(Tagged<InstructionStream> host,
+                                              RelocInfo* rinfo,
+                                              Tagged<HeapObject> target);
+
+  static void RecordRelocSlot(Tagged<InstructionStream> host, RelocInfo* rinfo,
+                              Tagged<HeapObject> target);
+  V8_INLINE static void RecordSlot(Tagged<HeapObject> object, ObjectSlot slot,
+                                   Tagged<HeapObject> target);
+  V8_INLINE static void RecordSlot(Tagged<HeapObject> object,
+                                   HeapObjectSlot slot,
+                                   Tagged<HeapObject> target);
   V8_INLINE static void RecordSlot(MemoryChunk* source_page,
-                                   HeapObjectSlot slot, HeapObject target);
+                                   HeapObjectSlot slot,
+                                   Tagged<HeapObject> target);
 
   bool is_compacting() const { return compacting_; }
 
-  inline void AddTransitionArray(TransitionArray array);
+  V8_INLINE void AddTransitionArray(Tagged<TransitionArray> array);
 
   void RecordStrongDescriptorArraysForWeakening(
       GlobalHandleVector<DescriptorArray> strong_descriptor_arrays);
@@ -420,10 +132,16 @@ class MarkCompactCollector final : public CollectorBase {
     return code_flush_mode_;
   }
 
+  MarkingWorklists* marking_worklists() { return &marking_worklists_; }
+
+  MarkingWorklists::Local* local_marking_worklists() const {
+    return local_marking_worklists_.get();
+  }
+
   WeakObjects* weak_objects() { return &weak_objects_; }
   WeakObjects::Local* local_weak_objects() { return local_weak_objects_.get(); }
 
-  void AddNewlyDiscovered(HeapObject object) {
+  void AddNewlyDiscovered(Tagged<HeapObject> object) {
     if (ephemeron_marking_.newly_discovered_overflowed) return;
 
     if (ephemeron_marking_.newly_discovered.size() <
@@ -439,11 +157,15 @@ class MarkCompactCollector final : public CollectorBase {
     ephemeron_marking_.newly_discovered.clear();
   }
 
+  bool UseBackgroundThreadsInCycle() {
+    return use_background_threads_in_cycle_;
+  }
+
   explicit MarkCompactCollector(Heap* heap);
-  ~MarkCompactCollector() final;
+  ~MarkCompactCollector();
 
  private:
-  Sweeper* sweeper() { return sweeper_; }
+  using ResizeNewSpaceMode = Heap::ResizeNewSpaceMode;
 
   void ComputeEvacuationHeuristics(size_t area_size,
                                    int* target_fragmentation_percent,
@@ -452,7 +174,7 @@ class MarkCompactCollector final : public CollectorBase {
   void RecordObjectStats();
 
   // Finishes GC, performs heap verification if enabled.
-  void Finish() final;
+  void Finish();
 
   // Free unmarked ArrayBufferExtensions.
   void SweepArrayBufferExtensions();
@@ -461,11 +183,11 @@ class MarkCompactCollector final : public CollectorBase {
 
   // Marks the object grey and adds it to the marking work list.
   // This is for non-incremental marking only.
-  V8_INLINE void MarkObject(HeapObject host, HeapObject obj);
+  V8_INLINE void MarkObject(Tagged<HeapObject> host, Tagged<HeapObject> obj);
 
   // Marks the object grey and adds it to the marking work list.
   // This is for non-incremental marking only.
-  V8_INLINE void MarkRootObject(Root root, HeapObject obj);
+  V8_INLINE void MarkRootObject(Root root, Tagged<HeapObject> obj);
 
   // Mark the heap roots and all objects reachable from them.
   void MarkRoots(RootVisitor* root_visitor);
@@ -497,7 +219,7 @@ class MarkCompactCollector final : public CollectorBase {
 
   // Implements ephemeron semantics: Marks value if key is already reachable.
   // Returns true if value was actually marked.
-  bool ProcessEphemeron(HeapObject key, HeapObject value);
+  bool ProcessEphemeron(Tagged<HeapObject> key, Tagged<HeapObject> value);
 
   // Marks the transitive closure by draining the marking worklist iteratively,
   // applying ephemerons semantics and invoking embedder tracing until a
@@ -528,15 +250,22 @@ class MarkCompactCollector final : public CollectorBase {
   // Checks if the given weak cell is a simple transition from the parent map
   // of the given dead target. If so it clears the transition and trims
   // the descriptor array of the parent if needed.
-  void ClearPotentialSimpleMapTransition(Map dead_target);
-  void ClearPotentialSimpleMapTransition(Map map, Map dead_target);
+  void ClearPotentialSimpleMapTransition(Tagged<Map> dead_target);
+  void ClearPotentialSimpleMapTransition(Tagged<Map> map,
+                                         Tagged<Map> dead_target);
 
   // Flushes a weakly held bytecode array from a shared function info.
-  void FlushBytecodeFromSFI(SharedFunctionInfo shared_info);
+  void FlushBytecodeFromSFI(Tagged<SharedFunctionInfo> shared_info);
 
   // Clears bytecode arrays / baseline code that have not been executed for
   // multiple collections.
   void ProcessOldCodeCandidates();
+
+  bool ProcessOldBytecodeSFI(Tagged<SharedFunctionInfo> flushing_candidate);
+  bool ProcessOldBaselineSFI(Tagged<SharedFunctionInfo> flushing_candidate);
+  void FlushSFI(Tagged<SharedFunctionInfo> sfi,
+                bool bytecode_already_decompiled);
+
   void ProcessFlushedBaselineCandidates();
 
   // Resets any JSFunctions which have had their bytecode flushed.
@@ -545,11 +274,13 @@ class MarkCompactCollector final : public CollectorBase {
   // Compact every array in the global list of transition arrays and
   // trim the corresponding descriptor array if a transition target is non-live.
   void ClearFullMapTransitions();
-  void TrimDescriptorArray(Map map, DescriptorArray descriptors);
-  void TrimEnumCache(Map map, DescriptorArray descriptors);
-  bool CompactTransitionArray(Map map, TransitionArray transitions,
-                              DescriptorArray descriptors);
-  bool TransitionArrayNeedsCompaction(TransitionArray transitions,
+  void TrimDescriptorArray(Tagged<Map> map,
+                           Tagged<DescriptorArray> descriptors);
+  void TrimEnumCache(Tagged<Map> map, Tagged<DescriptorArray> descriptors);
+  bool CompactTransitionArray(Tagged<Map> map,
+                              Tagged<TransitionArray> transitions,
+                              Tagged<DescriptorArray> descriptors);
+  bool TransitionArrayNeedsCompaction(Tagged<TransitionArray> transitions,
                                       int num_transitions);
   void WeakenStrongDescriptorArrays();
 
@@ -571,6 +302,7 @@ class MarkCompactCollector final : public CollectorBase {
   // Starts sweeping of spaces by contributing on the main thread and setting
   // up other pages for sweeping. Does not start sweeper tasks.
   void Sweep();
+  void StartSweepSpace(PagedSpace* space);
 
   void EvacuatePrologue();
   void EvacuateEpilogue();
@@ -590,13 +322,16 @@ class MarkCompactCollector final : public CollectorBase {
 
   int NumberOfParallelEphemeronVisitingTasks(size_t elements);
 
-  void RightTrimDescriptorArray(DescriptorArray array, int descriptors_to_trim);
+  void RightTrimDescriptorArray(Tagged<DescriptorArray> array,
+                                int descriptors_to_trim);
 
-  V8_INLINE bool ShouldMarkObject(HeapObject) const;
+  V8_INLINE bool ShouldMarkObject(Tagged<HeapObject>) const;
 
   void StartSweepNewSpace();
   void SweepLargeSpace(LargeObjectSpace* space);
 
+  Heap* const heap_;
+
   base::Mutex mutex_;
   base::Semaphore page_parallel_job_semaphore_{0};
 
@@ -623,10 +358,13 @@ class MarkCompactCollector final : public CollectorBase {
   bool have_code_to_deoptimize_ = false;
   bool parallel_marking_ = false;
 
+  MarkingWorklists marking_worklists_;
+  std::unique_ptr<MarkingWorklists::Local> local_marking_worklists_;
+
   WeakObjects weak_objects_;
   EphemeronMarking ephemeron_marking_;
 
-  std::unique_ptr<MarkingVisitor> marking_visitor_;
+  std::unique_ptr<MainMarkingVisitor> marking_visitor_;
   std::unique_ptr<WeakObjects::Local> local_weak_objects_;
   NativeContextInferrer native_context_inferrer_;
   NativeContextStats native_context_stats_;
@@ -645,6 +383,8 @@ class MarkCompactCollector final : public CollectorBase {
       aborted_evacuation_candidates_due_to_flags_;
   std::vector<LargePage*> promoted_large_pages_;
 
+  MarkingState* const marking_state_;
+  NonAtomicMarkingState* const non_atomic_marking_state_;
   Sweeper* const sweeper_;
 
   // Counts the number of major mark-compact collections. The counter is
@@ -654,6 +394,8 @@ class MarkCompactCollector final : public CollectorBase {
   //   around.
   unsigned epoch_ = 0;
 
+  ResizeNewSpaceMode resize_new_space_ = ResizeNewSpaceMode::kNone;
+
   // Bytecode flushing is disabled when the code coverage mode is changed. Since
   // that can happen while a GC is happening and we need the
   // code_flush_mode_ to remain the same through out a GC, we record this at
@@ -662,158 +404,12 @@ class MarkCompactCollector final : public CollectorBase {
 
   std::vector<Page*> empty_new_space_pages_to_be_swept_;
 
+  bool use_background_threads_in_cycle_ = false;
+
   friend class Evacuator;
   friend class RecordMigratedSlotVisitor;
 };
 
-// Collector for young-generation only.
-class MinorMarkCompactCollector final : public CollectorBase {
- public:
-  static constexpr size_t kMaxParallelTasks = 8;
-
-  static MinorMarkCompactCollector* From(CollectorBase* collector) {
-    return static_cast<MinorMarkCompactCollector*>(collector);
-  }
-
-  explicit MinorMarkCompactCollector(Heap* heap);
-  ~MinorMarkCompactCollector() final;
-
-  std::pair<size_t, size_t> ProcessMarkingWorklist(
-      size_t bytes_to_process) final;
-
-  void SetUp() final;
-  void TearDown() final;
-  void CollectGarbage() final;
-  void Prepare() final {}
-  void StartMarking() final;
-
-  void MakeIterable(Page* page, FreeSpaceTreatmentMode free_space_mode);
-
-  void Finish() final;
-
-  // Perform Wrapper Tracing if in use.
-  void PerformWrapperTracing();
-
- private:
-  class RootMarkingVisitor;
-
-  static const int kNumMarkers = 8;
-  static const int kMainMarker = 0;
-
-  Sweeper* sweeper() { return sweeper_; }
-
-  void MarkLiveObjects();
-  void MarkLiveObjectsInParallel(RootMarkingVisitor* root_visitor,
-                                 bool was_marked_incrementally);
-  V8_INLINE void MarkRootObject(HeapObject obj);
-  void DrainMarkingWorklist();
-  void TraceFragmentation();
-  void ClearNonLiveReferences();
-
-  void Sweep();
-
-  void FinishConcurrentMarking();
-
-  // 'StartSweepNewSpace' and 'SweepNewLargeSpace' return true if any pages were
-  // promoted.
-  bool StartSweepNewSpace();
-  bool SweepNewLargeSpace();
-
-  std::unique_ptr<YoungGenerationMainMarkingVisitor> main_marking_visitor_;
-
-  Sweeper* const sweeper_;
-
-  friend class YoungGenerationMarkingTask;
-  friend class YoungGenerationMarkingJob;
-  friend class YoungGenerationMainMarkingVisitor;
-};
-
-class PageMarkingItem : public ParallelWorkItem {
- public:
-  enum class SlotsType { kRegularSlots, kTypedSlots };
-
-  PageMarkingItem(MemoryChunk* chunk, SlotsType slots_type)
-      : chunk_(chunk), slots_type_(slots_type) {}
-  ~PageMarkingItem() = default;
-
-  void Process(YoungGenerationMarkingTask* task);
-
- private:
-  inline Heap* heap() { return chunk_->heap(); }
-
-  void MarkUntypedPointers(YoungGenerationMarkingTask* task);
-  void MarkTypedPointers(YoungGenerationMarkingTask* task);
-  template <typename TSlot>
-  V8_INLINE SlotCallbackResult
-  CheckAndMarkObject(YoungGenerationMarkingTask* task, TSlot slot);
-
-  MemoryChunk* chunk_;
-  const SlotsType slots_type_;
-};
-
-enum class YoungMarkingJobType { kAtomic, kIncremental };
-
-class YoungGenerationMarkingJob : public v8::JobTask {
- public:
-  YoungGenerationMarkingJob(Isolate* isolate, Heap* heap,
-                            MarkingWorklists* global_worklists,
-                            std::vector<PageMarkingItem> marking_items,
-                            YoungMarkingJobType young_marking_job_type,
-                            std::vector<YoungGenerationMarkingTask>& tasks)
-      : isolate_(isolate),
-        heap_(heap),
-        global_worklists_(global_worklists),
-        marking_items_(std::move(marking_items)),
-        remaining_marking_items_(marking_items_.size()),
-        generator_(marking_items_.size()),
-        young_marking_job_type_(young_marking_job_type),
-        tasks_(tasks) {}
-
-  void Run(JobDelegate* delegate) override;
-  size_t GetMaxConcurrency(size_t worker_count) const override;
-
-  bool ShouldDrainMarkingWorklist() const {
-    return young_marking_job_type_ == YoungMarkingJobType::kAtomic;
-  }
-
- private:
-  void ProcessItems(JobDelegate* delegate);
-  void ProcessMarkingItems(YoungGenerationMarkingTask* task);
-
-  Isolate* isolate_;
-  Heap* heap_;
-  MarkingWorklists* global_worklists_;
-  std::vector<PageMarkingItem> marking_items_;
-  std::atomic_size_t remaining_marking_items_{0};
-  IndexGenerator generator_;
-  YoungMarkingJobType young_marking_job_type_;
-  std::vector<YoungGenerationMarkingTask>& tasks_;
-};
-
-class YoungGenerationMarkingTask final {
- public:
-  YoungGenerationMarkingTask(Isolate* isolate, Heap* heap,
-                             MarkingWorklists* global_worklists);
-
-  void MarkYoungObject(HeapObject heap_object);
-
-  void DrainMarkingWorklist();
-
-  void PublishMarkingWorklist();
-
-  MarkingWorklists::Local* marking_worklists_local() {
-    return marking_worklists_local_.get();
-  }
-
-  void Finalize();
-
- private:
-  std::unique_ptr<MarkingWorklists::Local> marking_worklists_local_;
-  MarkingState* marking_state_;
-  YoungGenerationMainMarkingVisitor visitor_;
-  std::unordered_map<MemoryChunk*, size_t, MemoryChunk::Hasher> live_bytes_;
-};
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/mark-sweep-utilities.cc b/deps/v8/src/heap/mark-sweep-utilities.cc
new file mode 100644
index 00000000000000..4ada3534fc0078
--- /dev/null
+++ b/deps/v8/src/heap/mark-sweep-utilities.cc
@@ -0,0 +1,193 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/mark-sweep-utilities.h"
+
+#include "src/common/globals.h"
+#include "src/heap/cppgc-js/cpp-heap.h"
+#include "src/heap/large-spaces.h"
+#include "src/heap/marking-worklist.h"
+#include "src/heap/new-spaces.h"
+#include "src/objects/objects-inl.h"
+#include "src/objects/string-forwarding-table-inl.h"
+#include "src/objects/visitors-inl.h"
+
+namespace v8 {
+namespace internal {
+
+// The following has to hold in order for {MarkingState::MarkBitFrom} to not
+// produce invalid {kImpossibleBitPattern} in the marking bitmap by overlapping.
+static_assert(Heap::kMinObjectSizeInTaggedWords >= 2);
+
+#ifdef VERIFY_HEAP
+MarkingVerifierBase::MarkingVerifierBase(Heap* heap)
+    : ObjectVisitorWithCageBases(heap), heap_(heap) {}
+
+void MarkingVerifierBase::VisitMapPointer(Tagged<HeapObject> object) {
+  VerifyMap(object->map(cage_base()));
+}
+
+void MarkingVerifierBase::VerifyRoots() {
+  heap_->IterateRootsIncludingClients(this,
+                                      base::EnumSet<SkipRoot>{SkipRoot::kWeak});
+}
+
+void MarkingVerifierBase::VerifyMarkingOnPage(const Page* page, Address start,
+                                              Address end) {
+  Address next_object_must_be_here_or_later = start;
+
+  for (auto [object, size] : LiveObjectRange(page)) {
+    Address current = object.address();
+    if (current < start) continue;
+    if (current >= end) break;
+    CHECK(IsMarked(object));
+    CHECK(current >= next_object_must_be_here_or_later);
+    object.Iterate(cage_base(), this);
+    next_object_must_be_here_or_later = current + size;
+    // The object is either part of a black area of black allocation or a
+    // regular black object
+    CHECK(bitmap(page)->AllBitsSetInRange(
+              MarkingBitmap::AddressToIndex(current),
+              MarkingBitmap::LimitAddressToIndex(
+                  next_object_must_be_here_or_later)) ||
+          bitmap(page)->AllBitsClearInRange(
+              MarkingBitmap::AddressToIndex(current) + 1,
+              MarkingBitmap::LimitAddressToIndex(
+                  next_object_must_be_here_or_later)));
+    current = next_object_must_be_here_or_later;
+  }
+}
+
+void MarkingVerifierBase::VerifyMarking(NewSpace* space) {
+  if (!space) return;
+  if (v8_flags.minor_ms) {
+    VerifyMarking(PagedNewSpace::From(space)->paged_space());
+    return;
+  }
+  Address end = space->top();
+  // The bottom position is at the start of its page. Allows us to use
+  // page->area_start() as start of range on all pages.
+  CHECK_EQ(space->first_allocatable_address(),
+           space->first_page()->area_start());
+
+  PageRange range(space->first_allocatable_address(), end);
+  for (auto it = range.begin(); it != range.end();) {
+    Page* page = *(it++);
+    Address limit = it != range.end() ? page->area_end() : end;
+    CHECK(limit == end || !page->Contains(end));
+    VerifyMarkingOnPage(page, page->area_start(), limit);
+  }
+}
+
+void MarkingVerifierBase::VerifyMarking(PagedSpaceBase* space) {
+  for (Page* p : *space) {
+    VerifyMarkingOnPage(p, p->area_start(), p->area_end());
+  }
+}
+
+void MarkingVerifierBase::VerifyMarking(LargeObjectSpace* lo_space) {
+  if (!lo_space) return;
+  LargeObjectSpaceObjectIterator it(lo_space);
+  for (Tagged<HeapObject> obj = it.Next(); !obj.is_null(); obj = it.Next()) {
+    if (IsMarked(obj)) {
+      obj->Iterate(cage_base(), this);
+    }
+  }
+}
+#endif  // VERIFY_HEAP
+
+template <ExternalStringTableCleaningMode mode>
+void ExternalStringTableCleanerVisitor<mode>::VisitRootPointers(
+    Root root, const char* description, FullObjectSlot start,
+    FullObjectSlot end) {
+  // Visit all HeapObject pointers in [start, end).
+  DCHECK_EQ(static_cast<int>(root),
+            static_cast<int>(Root::kExternalStringsTable));
+  NonAtomicMarkingState* marking_state = heap_->non_atomic_marking_state();
+  Tagged<Object> the_hole = ReadOnlyRoots(heap_).the_hole_value();
+  for (FullObjectSlot p = start; p < end; ++p) {
+    Tagged<Object> o = *p;
+    if (!IsHeapObject(o)) continue;
+    Tagged<HeapObject> heap_object = HeapObject::cast(o);
+    // MinorMS doesn't update the young strings set and so it may contain
+    // strings that are already in old space.
+    if (!marking_state->IsUnmarked(heap_object)) continue;
+    if ((mode == ExternalStringTableCleaningMode::kYoungOnly) &&
+        !Heap::InYoungGeneration(heap_object))
+      continue;
+    if (IsExternalString(o)) {
+      heap_->FinalizeExternalString(String::cast(o));
+    } else {
+      // The original external string may have been internalized.
+      DCHECK(IsThinString(o));
+    }
+    // Set the entry to the_hole_value (as deleted).
+    p.store(the_hole);
+  }
+}
+
+StringForwardingTableCleanerBase::StringForwardingTableCleanerBase(Heap* heap)
+    : isolate_(heap->isolate()),
+      marking_state_(heap->non_atomic_marking_state()) {}
+
+void StringForwardingTableCleanerBase::DisposeExternalResource(
+    StringForwardingTable::Record* record) {
+  Address resource = record->ExternalResourceAddress();
+  if (resource != kNullAddress && disposed_resources_.count(resource) == 0) {
+    record->DisposeExternalResource();
+    disposed_resources_.insert(resource);
+  }
+}
+
+bool IsCppHeapMarkingFinished(
+    Heap* heap, MarkingWorklists::Local* local_marking_worklists) {
+  const auto* cpp_heap = CppHeap::From(heap->cpp_heap());
+  if (!cpp_heap) return true;
+
+  return cpp_heap->IsTracingDone() && local_marking_worklists->IsWrapperEmpty();
+}
+
+#if DEBUG
+void VerifyRememberedSetsAfterEvacuation(Heap* heap,
+                                         GarbageCollector garbage_collector) {
+  // Old-to-old slot sets must be empty after evacuation.
+  bool new_space_is_empty =
+      !heap->new_space() || heap->new_space()->Size() == 0;
+  DCHECK_IMPLIES(garbage_collector == GarbageCollector::MARK_COMPACTOR,
+                 new_space_is_empty);
+
+  MemoryChunkIterator chunk_iterator(heap);
+
+  while (chunk_iterator.HasNext()) {
+    MemoryChunk* chunk = chunk_iterator.Next();
+
+    // Old-to-old slot sets must be empty after evacuation.
+    DCHECK_NULL((chunk->slot_set<OLD_TO_OLD, AccessMode::ATOMIC>()));
+    DCHECK_NULL((chunk->typed_slot_set<OLD_TO_OLD, AccessMode::ATOMIC>()));
+
+    if (new_space_is_empty &&
+        (garbage_collector == GarbageCollector::MARK_COMPACTOR)) {
+      // Old-to-new slot sets must be empty after evacuation.
+      DCHECK_NULL((chunk->slot_set<OLD_TO_NEW, AccessMode::ATOMIC>()));
+      DCHECK_NULL((chunk->typed_slot_set<OLD_TO_NEW, AccessMode::ATOMIC>()));
+      DCHECK_NULL(
+          (chunk->slot_set<OLD_TO_NEW_BACKGROUND, AccessMode::ATOMIC>()));
+      DCHECK_NULL(
+          (chunk->typed_slot_set<OLD_TO_NEW_BACKGROUND, AccessMode::ATOMIC>()));
+    }
+
+    // Old-to-shared slots may survive GC but there should never be any slots in
+    // new or shared spaces.
+    AllocationSpace id = chunk->owner_identity();
+    if (id == SHARED_SPACE || id == SHARED_LO_SPACE || id == NEW_SPACE ||
+        id == NEW_LO_SPACE) {
+      DCHECK_NULL((chunk->slot_set<OLD_TO_SHARED, AccessMode::ATOMIC>()));
+      DCHECK_NULL((chunk->typed_slot_set<OLD_TO_SHARED, AccessMode::ATOMIC>()));
+    }
+  }
+}
+#endif  // DEBUG
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/heap/mark-sweep-utilities.h b/deps/v8/src/heap/mark-sweep-utilities.h
new file mode 100644
index 00000000000000..bdbb6762ab11c5
--- /dev/null
+++ b/deps/v8/src/heap/mark-sweep-utilities.h
@@ -0,0 +1,118 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_MARK_SWEEP_UTILITIES_H_
+#define V8_HEAP_MARK_SWEEP_UTILITIES_H_
+
+#include <memory>
+#include <vector>
+
+#include "src/common/globals.h"
+#include "src/heap/heap.h"
+#include "src/heap/marking-state.h"
+#include "src/heap/marking-worklist.h"
+#include "src/heap/spaces.h"
+#include "src/objects/string-forwarding-table.h"
+#include "src/objects/visitors.h"
+
+namespace v8 {
+namespace internal {
+
+#ifdef VERIFY_HEAP
+class MarkingVerifierBase : public ObjectVisitorWithCageBases,
+                            public RootVisitor {
+ public:
+  virtual void Run() = 0;
+
+ protected:
+  explicit MarkingVerifierBase(Heap* heap);
+
+  virtual const MarkingBitmap* bitmap(const MemoryChunk* chunk) = 0;
+
+  virtual void VerifyMap(Tagged<Map> map) = 0;
+  virtual void VerifyPointers(ObjectSlot start, ObjectSlot end) = 0;
+  virtual void VerifyPointers(MaybeObjectSlot start, MaybeObjectSlot end) = 0;
+  virtual void VerifyCodePointer(InstructionStreamSlot slot) = 0;
+  virtual void VerifyRootPointers(FullObjectSlot start, FullObjectSlot end) = 0;
+
+  virtual bool IsMarked(Tagged<HeapObject> object) = 0;
+
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                     ObjectSlot end) override {
+    VerifyPointers(start, end);
+  }
+
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
+                     MaybeObjectSlot end) override {
+    VerifyPointers(start, end);
+  }
+
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
+    VerifyCodePointer(slot);
+  }
+
+  void VisitRootPointers(Root root, const char* description,
+                         FullObjectSlot start, FullObjectSlot end) override {
+    VerifyRootPointers(start, end);
+  }
+
+  void VisitMapPointer(Tagged<HeapObject> object) override;
+
+  void VerifyRoots();
+  void VerifyMarkingOnPage(const Page* page, Address start, Address end);
+  void VerifyMarking(NewSpace* new_space);
+  void VerifyMarking(PagedSpaceBase* paged_space);
+  void VerifyMarking(LargeObjectSpace* lo_space);
+
+  Heap* heap_;
+};
+#endif  // VERIFY_HEAP
+
+enum class ExternalStringTableCleaningMode { kAll, kYoungOnly };
+template <ExternalStringTableCleaningMode mode>
+class ExternalStringTableCleanerVisitor final : public RootVisitor {
+ public:
+  explicit ExternalStringTableCleanerVisitor(Heap* heap) : heap_(heap) {}
+
+  void VisitRootPointers(Root root, const char* description,
+                         FullObjectSlot start, FullObjectSlot end) final;
+
+ private:
+  Heap* heap_;
+};
+
+class StringForwardingTableCleanerBase {
+ protected:
+  explicit StringForwardingTableCleanerBase(Heap* heap);
+
+  // Dispose external resource, if it wasn't disposed already.
+  // We can have multiple entries of the same external resource in the string
+  // forwarding table (i.e. concurrent externalization of a string with the
+  // same resource), therefore we keep track of already disposed resources to
+  // not dispose a resource more than once.
+  void DisposeExternalResource(StringForwardingTable::Record* record);
+
+  Isolate* const isolate_;
+  NonAtomicMarkingState* const marking_state_;
+  std::unordered_set<Address> disposed_resources_;
+};
+
+bool IsCppHeapMarkingFinished(Heap* heap,
+                              MarkingWorklists::Local* local_marking_worklists);
+
+#if DEBUG
+void VerifyRememberedSetsAfterEvacuation(Heap* heap,
+                                         GarbageCollector garbage_collector);
+#endif  // DEBUG
+
+template class ExternalStringTableCleanerVisitor<
+    ExternalStringTableCleaningMode::kAll>;
+template class ExternalStringTableCleanerVisitor<
+    ExternalStringTableCleaningMode::kYoungOnly>;
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_MARK_SWEEP_UTILITIES_H_
diff --git a/deps/v8/src/heap/marking-barrier-inl.h b/deps/v8/src/heap/marking-barrier-inl.h
index 320949eb5b474c..1db1a1c0e9ce7c 100644
--- a/deps/v8/src/heap/marking-barrier-inl.h
+++ b/deps/v8/src/heap/marking-barrier-inl.h
@@ -13,23 +13,13 @@
 namespace v8 {
 namespace internal {
 
-void MarkingBarrier::MarkValue(HeapObject host, HeapObject value) {
+void MarkingBarrier::MarkValue(Tagged<HeapObject> host,
+                               Tagged<HeapObject> value) {
   if (value.InReadOnlySpace()) return;
 
   DCHECK(IsCurrentMarkingBarrier(host));
   DCHECK(is_activated_ || shared_heap_worklist_.has_value());
 
-  DCHECK_IMPLIES(!value.InWritableSharedSpace() || is_shared_space_isolate_,
-                 !marking_state_.IsImpossible(value));
-
-  // Host may have an impossible markbit pattern if manual allocation folding
-  // is performed and host happens to be the last word of an allocated region.
-  // In that case host has only one markbit and the second markbit belongs to
-  // another object. We can detect that case by checking if value is a one word
-  // filler map.
-  DCHECK(!marking_state_.IsImpossible(host) ||
-         value == ReadOnlyRoots(heap_->isolate()).one_pointer_filler_map());
-
   // When shared heap isn't enabled all objects are local, we can just run the
   // local marking barrier. Also from the point-of-view of the shared space
   // isolate (= main isolate) also shared objects are considered local.
@@ -56,7 +46,7 @@ void MarkingBarrier::MarkValue(HeapObject host, HeapObject value) {
   MarkValueLocal(value);
 }
 
-void MarkingBarrier::MarkValueShared(HeapObject value) {
+void MarkingBarrier::MarkValueShared(Tagged<HeapObject> value) {
   // Value is either in read-only space or shared heap.
   DCHECK(value.InAnySharedSpace());
 
@@ -70,11 +60,14 @@ void MarkingBarrier::MarkValueShared(HeapObject value) {
   }
 }
 
-void MarkingBarrier::MarkValueLocal(HeapObject value) {
+void MarkingBarrier::MarkValueLocal(Tagged<HeapObject> value) {
   DCHECK(!value.InReadOnlySpace());
   if (is_minor()) {
     // We do not need to insert into RememberedSet<OLD_TO_NEW> here because the
     // C++ marking barrier already does this for us.
+    // TODO(v8:13012): Consider updating C++ barriers to respect
+    // POINTERS_TO_HERE_ARE_INTERESTING and POINTERS_FROM_HERE_ARE_INTERESTING
+    // page flags and make the following branch a DCHECK.
     if (Heap::InYoungGeneration(value)) {
       WhiteToGreyAndPush(value);  // NEW->NEW
     }
@@ -88,14 +81,15 @@ void MarkingBarrier::MarkValueLocal(HeapObject value) {
 }
 
 template <typename TSlot>
-inline void MarkingBarrier::MarkRange(HeapObject host, TSlot start, TSlot end) {
+inline void MarkingBarrier::MarkRange(Tagged<HeapObject> host, TSlot start,
+                                      TSlot end) {
   auto* isolate = heap_->isolate();
   const bool record_slots =
       IsCompacting(host) &&
       !MemoryChunk::FromHeapObject(host)->ShouldSkipEvacuationSlotRecording();
   for (TSlot slot = start; slot < end; ++slot) {
     typename TSlot::TObject object = slot.Relaxed_Load();
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
     // Mark both, weak and strong edges.
     if (object.GetHeapObject(isolate, &heap_object)) {
       MarkValue(host, heap_object);
@@ -106,7 +100,7 @@ inline void MarkingBarrier::MarkRange(HeapObject host, TSlot start, TSlot end) {
   }
 }
 
-bool MarkingBarrier::IsCompacting(HeapObject object) const {
+bool MarkingBarrier::IsCompacting(Tagged<HeapObject> object) const {
   if (is_compacting_) {
     DCHECK(is_major());
     return true;
@@ -115,7 +109,7 @@ bool MarkingBarrier::IsCompacting(HeapObject object) const {
   return shared_heap_worklist_.has_value() && object.InWritableSharedSpace();
 }
 
-bool MarkingBarrier::WhiteToGreyAndPush(HeapObject obj) {
+bool MarkingBarrier::WhiteToGreyAndPush(Tagged<HeapObject> obj) {
   if (marking_state_.TryMark(obj)) {
     current_worklist_->Push(obj);
     return true;
diff --git a/deps/v8/src/heap/marking-barrier.cc b/deps/v8/src/heap/marking-barrier.cc
index 66ab72a6697590..b634d90489e50c 100644
--- a/deps/v8/src/heap/marking-barrier.cc
+++ b/deps/v8/src/heap/marking-barrier.cc
@@ -4,6 +4,8 @@
 
 #include "src/heap/marking-barrier.h"
 
+#include <memory>
+
 #include "src/base/logging.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap-write-barrier.h"
@@ -15,6 +17,8 @@
 #include "src/heap/marking-barrier-inl.h"
 #include "src/heap/marking-worklist-inl.h"
 #include "src/heap/marking-worklist.h"
+#include "src/heap/memory-chunk.h"
+#include "src/heap/minor-mark-sweep.h"
 #include "src/heap/safepoint.h"
 #include "src/objects/heap-object.h"
 #include "src/objects/js-array-buffer.h"
@@ -26,10 +30,8 @@ namespace internal {
 MarkingBarrier::MarkingBarrier(LocalHeap* local_heap)
     : heap_(local_heap->heap()),
       major_collector_(heap_->mark_compact_collector()),
-      minor_collector_(heap_->minor_mark_compact_collector()),
+      minor_collector_(heap_->minor_mark_sweep_collector()),
       incremental_marking_(heap_->incremental_marking()),
-      major_worklist_(*major_collector_->marking_worklists()->shared()),
-      minor_worklist_(*minor_collector_->marking_worklists()->shared()),
       marking_state_(isolate()),
       is_main_thread_barrier_(local_heap->is_main_thread()),
       uses_shared_heap_(isolate()->has_shared_space()),
@@ -37,11 +39,16 @@ MarkingBarrier::MarkingBarrier(LocalHeap* local_heap)
 
 MarkingBarrier::~MarkingBarrier() { DCHECK(typed_slots_map_.empty()); }
 
-void MarkingBarrier::Write(HeapObject host, HeapObjectSlot slot,
-                           HeapObject value) {
+void MarkingBarrier::Write(Tagged<HeapObject> host, HeapObjectSlot slot,
+                           Tagged<HeapObject> value) {
   DCHECK(IsCurrentMarkingBarrier(host));
   DCHECK(is_activated_ || shared_heap_worklist_.has_value());
   DCHECK(MemoryChunk::FromHeapObject(host)->IsMarking());
+
+  if ((is_major() || Heap::InYoungGeneration(host)) &&
+      !marking_state_.IsMarked(host))
+    return;
+
   MarkValue(host, value);
 
   if (slot.address() && IsCompacting(host)) {
@@ -49,7 +56,34 @@ void MarkingBarrier::Write(HeapObject host, HeapObjectSlot slot,
   }
 }
 
-void MarkingBarrier::WriteWithoutHost(HeapObject value) {
+void MarkingBarrier::Write(Tagged<HeapObject> host, IndirectPointerSlot slot) {
+  DCHECK(IsCurrentMarkingBarrier(host));
+  DCHECK(is_activated_ || shared_heap_worklist_.has_value());
+  DCHECK(MemoryChunk::FromHeapObject(host)->IsMarking());
+
+  if (!marking_state_.IsMarked(host)) return;
+
+  // An indirect pointer slot can only contain a Smi if it is uninitialized (in
+  // which case the vaue will be Smi::zero()). However, at this point the slot
+  // must have been initialized because it was just written to.
+  Tagged<HeapObject> value = HeapObject::cast(slot.load());
+  MarkValue(host, value);
+
+  // We don't emit generational- and shared write barriers for indirect
+  // pointers as objects referenced through them are currently never allocated
+  // in the young generation or the shared (writable) heap. If this ever
+  // changes (in which case, this DCHECK here would fail), we would need to
+  // update the code for these barriers and make the remembered sets aware of
+  // pointer table entries.
+  DCHECK(!Heap::InYoungGeneration(value));
+  DCHECK(!value.InWritableSharedSpace());
+
+  // We never need to record indirect pointer slots (i.e. references through a
+  // pointer table) since the referenced object owns its table entry and will
+  // take care of updating the pointer to itself if it is relocated.
+}
+
+void MarkingBarrier::WriteWithoutHost(Tagged<HeapObject> value) {
   DCHECK(is_main_thread_barrier_);
   DCHECK(is_activated_);
 
@@ -65,31 +99,40 @@ void MarkingBarrier::WriteWithoutHost(HeapObject value) {
   MarkValueLocal(value);
 }
 
-void MarkingBarrier::Write(InstructionStream host, RelocInfo* reloc_info,
-                           HeapObject value) {
+void MarkingBarrier::Write(Tagged<InstructionStream> host,
+                           RelocInfo* reloc_info, Tagged<HeapObject> value) {
   DCHECK(IsCurrentMarkingBarrier(host));
   DCHECK(!host.InWritableSharedSpace());
   DCHECK(is_activated_ || shared_heap_worklist_.has_value());
   DCHECK(MemoryChunk::FromHeapObject(host)->IsMarking());
+
+  if (!marking_state_.IsMarked(host) &&
+      (is_major() || Heap::InYoungGeneration(host)))
+    return;
+
   MarkValue(host, value);
   if (is_compacting_) {
     DCHECK(is_major());
     if (is_main_thread_barrier_) {
       // An optimization to avoid allocating additional typed slots for the
       // main thread.
-      major_collector_->RecordRelocSlot(reloc_info, value);
+      major_collector_->RecordRelocSlot(host, reloc_info, value);
     } else {
-      RecordRelocSlot(reloc_info, value);
+      RecordRelocSlot(host, reloc_info, value);
     }
   }
 }
 
-void MarkingBarrier::Write(JSArrayBuffer host,
+void MarkingBarrier::Write(Tagged<JSArrayBuffer> host,
                            ArrayBufferExtension* extension) {
   DCHECK(IsCurrentMarkingBarrier(host));
   DCHECK(!host.InWritableSharedSpace());
   DCHECK(MemoryChunk::FromHeapObject(host)->IsMarking());
 
+  if (!marking_state_.IsMarked(host) &&
+      (is_major() || Heap::InYoungGeneration(host)))
+    return;
+
   if (is_minor()) {
     if (Heap::InYoungGeneration(host)) {
       extension->YoungMark();
@@ -99,14 +142,14 @@ void MarkingBarrier::Write(JSArrayBuffer host,
   }
 }
 
-void MarkingBarrier::Write(DescriptorArray descriptor_array,
+void MarkingBarrier::Write(Tagged<DescriptorArray> descriptor_array,
                            int number_of_own_descriptors) {
   DCHECK(IsCurrentMarkingBarrier(descriptor_array));
-  DCHECK(IsReadOnlyHeapObject(descriptor_array.map()));
+  DCHECK(IsReadOnlyHeapObject(descriptor_array->map()));
   DCHECK(MemoryChunk::FromHeapObject(descriptor_array)->IsMarking());
 
   // Only major GC uses custom liveness.
-  if (is_minor() || descriptor_array.IsStrongDescriptorArray()) {
+  if (is_minor() || IsStrongDescriptorArray(descriptor_array)) {
     MarkValueLocal(descriptor_array);
     return;
   }
@@ -124,7 +167,7 @@ void MarkingBarrier::Write(DescriptorArray descriptor_array,
     worklist = &*shared_heap_worklist_;
   } else {
     gc_epoch = major_collector_->epoch();
-    worklist = current_worklist_;
+    worklist = current_worklist_.get();
   }
 
   // The DescriptorArray needs to be marked black here to ensure that slots
@@ -133,10 +176,7 @@ void MarkingBarrier::Write(DescriptorArray descriptor_array,
   // marking visitor does not re-process any already marked descriptors. If we
   // don't mark it black here, the Scavenger may promote a DescriptorArray and
   // any already marked descriptors will not have any slots recorded.
-  if (!marking_state_.IsMarked(descriptor_array)) {
-    marking_state_.TryMark(descriptor_array);
-    marking_state_.GreyToBlack(descriptor_array);
-  }
+  marking_state_.TryMark(descriptor_array);
 
   // `TryUpdateIndicesToMark()` acts as a barrier that publishes the slots'
   // values corresponding to `number_of_own_descriptors`.
@@ -146,12 +186,14 @@ void MarkingBarrier::Write(DescriptorArray descriptor_array,
   }
 }
 
-void MarkingBarrier::RecordRelocSlot(RelocInfo* rinfo, HeapObject target) {
-  DCHECK(IsCurrentMarkingBarrier(rinfo->instruction_stream()));
-  if (!MarkCompactCollector::ShouldRecordRelocSlot(rinfo, target)) return;
+void MarkingBarrier::RecordRelocSlot(Tagged<InstructionStream> host,
+                                     RelocInfo* rinfo,
+                                     Tagged<HeapObject> target) {
+  DCHECK(IsCurrentMarkingBarrier(host));
+  if (!MarkCompactCollector::ShouldRecordRelocSlot(host, rinfo, target)) return;
 
   MarkCompactCollector::RecordRelocSlotInfo info =
-      MarkCompactCollector::ProcessRelocInfo(rinfo, target);
+      MarkCompactCollector::ProcessRelocInfo(host, rinfo, target);
 
   auto& typed_slots = typed_slots_map_[info.memory_chunk];
   if (!typed_slots) {
@@ -161,103 +203,107 @@ void MarkingBarrier::RecordRelocSlot(RelocInfo* rinfo, HeapObject target) {
 }
 
 namespace {
-void ActivateSpace(PagedSpace* space) {
+void ActivateSpace(PagedSpace* space, MarkingMode marking_mode) {
   for (Page* p : *space) {
-    p->SetOldGenerationPageFlags(true);
+    p->SetOldGenerationPageFlags(marking_mode);
   }
 }
 
-void ActivateSpace(NewSpace* space) {
+void ActivateSpace(NewSpace* space, MarkingMode marking_mode) {
   for (Page* p : *space) {
-    p->SetYoungGenerationPageFlags(true);
+    p->SetYoungGenerationPageFlags(marking_mode);
   }
 }
 
-void ActivateSpaces(Heap* heap) {
-  ActivateSpace(heap->old_space());
-  {
-    CodePageHeaderModificationScope rwx_write_scope(
-        "Modification of InstructionStream page header flags requires write "
-        "access");
-    ActivateSpace(heap->code_space());
-  }
-  ActivateSpace(heap->new_space());
-  if (heap->shared_space()) {
-    ActivateSpace(heap->shared_space());
+void ActivateSpaces(Heap* heap, MarkingMode marking_mode) {
+  ActivateSpace(heap->old_space(), marking_mode);
+  for (LargePage* p : *heap->lo_space()) {
+    p->SetOldGenerationPageFlags(marking_mode);
   }
 
+  ActivateSpace(heap->new_space(), marking_mode);
   for (LargePage* p : *heap->new_lo_space()) {
-    p->SetYoungGenerationPageFlags(true);
+    p->SetYoungGenerationPageFlags(marking_mode);
     DCHECK(p->IsLargePage());
   }
 
-  for (LargePage* p : *heap->lo_space()) {
-    p->SetOldGenerationPageFlags(true);
-  }
-
   {
     CodePageHeaderModificationScope rwx_write_scope(
         "Modification of InstructionStream page header flags requires write "
         "access");
+    ActivateSpace(heap->code_space(), marking_mode);
     for (LargePage* p : *heap->code_lo_space()) {
-      p->SetOldGenerationPageFlags(true);
+      p->SetOldGenerationPageFlags(marking_mode);
     }
   }
 
-  if (heap->shared_lo_space()) {
-    for (LargePage* p : *heap->shared_lo_space()) {
-      p->SetOldGenerationPageFlags(true);
+  if (marking_mode == MarkingMode::kMajorMarking) {
+    if (heap->shared_space()) {
+      ActivateSpace(heap->shared_space(), MarkingMode::kMajorMarking);
+    }
+    if (heap->shared_lo_space()) {
+      for (LargePage* p : *heap->shared_lo_space()) {
+        p->SetOldGenerationPageFlags(MarkingMode::kMajorMarking);
+      }
     }
   }
 }
 
 void DeactivateSpace(PagedSpace* space) {
   for (Page* p : *space) {
-    p->SetOldGenerationPageFlags(false);
+    p->SetOldGenerationPageFlags(MarkingMode::kNoMarking);
   }
 }
 
 void DeactivateSpace(NewSpace* space) {
   for (Page* p : *space) {
-    p->SetYoungGenerationPageFlags(false);
+    p->SetYoungGenerationPageFlags(MarkingMode::kNoMarking);
   }
 }
 
-void DeactivateSpaces(Heap* heap) {
+void DeactivateSpaces(Heap* heap, MarkingMode marking_mode) {
   DeactivateSpace(heap->old_space());
-  DeactivateSpace(heap->code_space());
-  DeactivateSpace(heap->new_space());
-  if (heap->shared_space()) {
-    DeactivateSpace(heap->shared_space());
+  for (LargePage* p : *heap->lo_space()) {
+    p->SetOldGenerationPageFlags(MarkingMode::kNoMarking);
   }
+
+  DeactivateSpace(heap->new_space());
   for (LargePage* p : *heap->new_lo_space()) {
-    p->SetYoungGenerationPageFlags(false);
+    p->SetYoungGenerationPageFlags(MarkingMode::kNoMarking);
     DCHECK(p->IsLargePage());
   }
-  for (LargePage* p : *heap->lo_space()) {
-    p->SetOldGenerationPageFlags(false);
-  }
-  for (LargePage* p : *heap->code_lo_space()) {
-    p->SetOldGenerationPageFlags(false);
+
+  {
+    CodePageHeaderModificationScope rwx_write_scope(
+        "Modification of InstructionStream page header flags requires write "
+        "access");
+    DeactivateSpace(heap->code_space());
+    for (LargePage* p : *heap->code_lo_space()) {
+      p->SetOldGenerationPageFlags(MarkingMode::kNoMarking);
+    }
   }
-  if (heap->shared_lo_space()) {
-    for (LargePage* p : *heap->shared_lo_space()) {
-      p->SetOldGenerationPageFlags(false);
+
+  if (marking_mode == MarkingMode::kMajorMarking) {
+    if (heap->shared_space()) {
+      DeactivateSpace(heap->shared_space());
+    }
+    if (heap->shared_lo_space()) {
+      for (LargePage* p : *heap->shared_lo_space()) {
+        p->SetOldGenerationPageFlags(MarkingMode::kNoMarking);
+      }
     }
   }
 }
 }  // namespace
 
 // static
-void MarkingBarrier::ActivateAll(Heap* heap, bool is_compacting,
-                                 MarkingBarrierType marking_barrier_type) {
-  ActivateSpaces(heap);
+void MarkingBarrier::ActivateAll(Heap* heap, bool is_compacting) {
+  ActivateSpaces(heap, MarkingMode::kMajorMarking);
 
-  heap->safepoint()->IterateLocalHeaps(
-      [is_compacting, marking_barrier_type](LocalHeap* local_heap) {
-        local_heap->marking_barrier()->Activate(is_compacting,
-                                                marking_barrier_type);
-      });
+  heap->safepoint()->IterateLocalHeaps([is_compacting](LocalHeap* local_heap) {
+    local_heap->marking_barrier()->Activate(is_compacting,
+                                            MarkingMode::kMajorMarking);
+  });
 
   if (heap->isolate()->is_shared_space_isolate()) {
     heap->isolate()
@@ -275,14 +321,22 @@ void MarkingBarrier::ActivateAll(Heap* heap, bool is_compacting,
   }
 }
 
-void MarkingBarrier::Activate(bool is_compacting,
-                              MarkingBarrierType marking_barrier_type) {
+// static
+void MarkingBarrier::ActivateYoung(Heap* heap) {
+  ActivateSpaces(heap, MarkingMode::kMinorMarking);
+
+  heap->safepoint()->IterateLocalHeaps([](LocalHeap* local_heap) {
+    local_heap->marking_barrier()->Activate(false, MarkingMode::kMinorMarking);
+  });
+}
+
+void MarkingBarrier::Activate(bool is_compacting, MarkingMode marking_mode) {
   DCHECK(!is_activated_);
-  DCHECK(major_worklist_.IsLocalEmpty());
-  DCHECK(minor_worklist_.IsLocalEmpty());
   is_compacting_ = is_compacting;
-  marking_barrier_type_ = marking_barrier_type;
-  current_worklist_ = is_minor() ? &minor_worklist_ : &major_worklist_;
+  marking_mode_ = marking_mode;
+  current_worklist_ = std::make_unique<MarkingWorklist::Local>(
+      is_minor() ? *minor_collector_->marking_worklists()->shared()
+                 : *major_collector_->marking_worklists()->shared());
   is_activated_ = true;
 }
 
@@ -297,7 +351,7 @@ void MarkingBarrier::ActivateShared() {
 
 // static
 void MarkingBarrier::DeactivateAll(Heap* heap) {
-  DeactivateSpaces(heap);
+  DeactivateSpaces(heap, MarkingMode::kMajorMarking);
 
   heap->safepoint()->IterateLocalHeaps([](LocalHeap* local_heap) {
     local_heap->marking_barrier()->Deactivate();
@@ -322,11 +376,23 @@ void MarkingBarrier::DeactivateAll(Heap* heap) {
   }
 }
 
+// static
+void MarkingBarrier::DeactivateYoung(Heap* heap) {
+  DeactivateSpaces(heap, MarkingMode::kMinorMarking);
+
+  heap->safepoint()->IterateLocalHeaps([](LocalHeap* local_heap) {
+    local_heap->marking_barrier()->Deactivate();
+  });
+}
+
 void MarkingBarrier::Deactivate() {
+  DCHECK(is_activated_);
   is_activated_ = false;
   is_compacting_ = false;
+  marking_mode_ = MarkingMode::kNoMarking;
   DCHECK(typed_slots_map_.empty());
   DCHECK(current_worklist_->IsLocalEmpty());
+  current_worklist_.reset();
 }
 
 void MarkingBarrier::DeactivateShared() {
@@ -353,22 +419,21 @@ void MarkingBarrier::PublishAll(Heap* heap) {
   }
 }
 
+// static
+void MarkingBarrier::PublishYoung(Heap* heap) {
+  heap->safepoint()->IterateLocalHeaps([](LocalHeap* local_heap) {
+    local_heap->marking_barrier()->PublishIfNeeded();
+  });
+}
+
 void MarkingBarrier::PublishIfNeeded() {
   if (is_activated_) {
     current_worklist_->Publish();
-    base::Optional<CodePageHeaderModificationScope> optional_rwx_write_scope;
-    if (!typed_slots_map_.empty()) {
-      optional_rwx_write_scope.emplace(
-          "Merging typed slots may require allocating a new typed slot set.");
-    }
     for (auto& it : typed_slots_map_) {
       MemoryChunk* memory_chunk = it.first;
       // Access to TypeSlots need to be protected, since LocalHeaps might
       // publish code in the background thread.
-      base::Optional<base::MutexGuard> opt_guard;
-      if (v8_flags.concurrent_sparkplug) {
-        opt_guard.emplace(memory_chunk->mutex());
-      }
+      base::MutexGuard guard(memory_chunk->mutex());
       std::unique_ptr<TypedSlots>& typed_slots = it.second;
       RememberedSet<OLD_TO_OLD>::MergeTyped(memory_chunk,
                                             std::move(typed_slots));
@@ -384,7 +449,7 @@ void MarkingBarrier::PublishSharedIfNeeded() {
 }
 
 bool MarkingBarrier::IsCurrentMarkingBarrier(
-    HeapObject verification_candidate) {
+    Tagged<HeapObject> verification_candidate) {
   return WriteBarrier::CurrentMarkingBarrier(verification_candidate) == this;
 }
 
diff --git a/deps/v8/src/heap/marking-barrier.h b/deps/v8/src/heap/marking-barrier.h
index 382267edf6be61..959c794667d40f 100644
--- a/deps/v8/src/heap/marking-barrier.h
+++ b/deps/v8/src/heap/marking-barrier.h
@@ -6,9 +6,11 @@
 #define V8_HEAP_MARKING_BARRIER_H_
 
 #include "include/v8-internal.h"
+#include "src/base/functional.h"
 #include "src/common/globals.h"
 #include "src/heap/mark-compact.h"
 #include "src/heap/marking-worklist.h"
+#include "src/heap/memory-chunk.h"
 
 namespace v8 {
 namespace internal {
@@ -19,14 +21,12 @@ class LocalHeap;
 class PagedSpace;
 class NewSpace;
 
-enum class MarkingBarrierType { kMinor, kMajor };
-
 class MarkingBarrier {
  public:
   explicit MarkingBarrier(LocalHeap*);
   ~MarkingBarrier();
 
-  void Activate(bool is_compacting, MarkingBarrierType marking_barrier_type);
+  void Activate(bool is_compacting, MarkingMode marking_mode);
   void Deactivate();
   void PublishIfNeeded();
 
@@ -34,24 +34,27 @@ class MarkingBarrier {
   void DeactivateShared();
   void PublishSharedIfNeeded();
 
-  static void ActivateAll(Heap* heap, bool is_compacting,
-                          MarkingBarrierType marking_barrier_type);
+  static void ActivateAll(Heap* heap, bool is_compacting);
   static void DeactivateAll(Heap* heap);
   V8_EXPORT_PRIVATE static void PublishAll(Heap* heap);
 
-  void Write(HeapObject host, HeapObjectSlot, HeapObject value);
-  void Write(InstructionStream host, RelocInfo*, HeapObject value);
-  void Write(JSArrayBuffer host, ArrayBufferExtension*);
-  void Write(DescriptorArray, int number_of_own_descriptors);
+  static void ActivateYoung(Heap* heap);
+  static void DeactivateYoung(Heap* heap);
+  V8_EXPORT_PRIVATE static void PublishYoung(Heap* heap);
+
+  void Write(Tagged<HeapObject> host, HeapObjectSlot, Tagged<HeapObject> value);
+  void Write(Tagged<HeapObject> host, IndirectPointerSlot slot);
+  void Write(Tagged<InstructionStream> host, RelocInfo*,
+             Tagged<HeapObject> value);
+  void Write(Tagged<JSArrayBuffer> host, ArrayBufferExtension*);
+  void Write(Tagged<DescriptorArray>, int number_of_own_descriptors);
   // Only usable when there's no valid JS host object for this write, e.g., when
   // value is held alive from a global handle.
-  void WriteWithoutHost(HeapObject value);
+  void WriteWithoutHost(Tagged<HeapObject> value);
 
-  inline void MarkValue(HeapObject host, HeapObject value);
+  inline void MarkValue(Tagged<HeapObject> host, Tagged<HeapObject> value);
 
-  bool is_minor() const {
-    return marking_barrier_type_ == MarkingBarrierType::kMinor;
-  }
+  bool is_minor() const { return marking_mode_ == MarkingMode::kMinorMarking; }
 
   Heap* heap() const { return heap_; }
 
@@ -61,44 +64,41 @@ class MarkingBarrier {
 #endif  // DEBUG
 
  private:
-  inline void MarkValueShared(HeapObject value);
-  inline void MarkValueLocal(HeapObject value);
+  inline void MarkValueShared(Tagged<HeapObject> value);
+  inline void MarkValueLocal(Tagged<HeapObject> value);
 
-  inline bool WhiteToGreyAndPush(HeapObject value);
+  inline bool WhiteToGreyAndPush(Tagged<HeapObject> value);
 
-  void RecordRelocSlot(RelocInfo* rinfo, HeapObject target);
+  void RecordRelocSlot(Tagged<InstructionStream> host, RelocInfo* rinfo,
+                       Tagged<HeapObject> target);
 
-  bool IsCurrentMarkingBarrier(HeapObject verification_candidate);
+  bool IsCurrentMarkingBarrier(Tagged<HeapObject> verification_candidate);
 
   template <typename TSlot>
-  inline void MarkRange(HeapObject value, TSlot start, TSlot end);
+  inline void MarkRange(Tagged<HeapObject> value, TSlot start, TSlot end);
 
-  inline bool IsCompacting(HeapObject object) const;
+  inline bool IsCompacting(Tagged<HeapObject> object) const;
 
-  bool is_major() const {
-    return marking_barrier_type_ == MarkingBarrierType::kMajor;
-  }
+  bool is_major() const { return marking_mode_ == MarkingMode::kMajorMarking; }
 
   Isolate* isolate() const;
 
   Heap* heap_;
   MarkCompactCollector* major_collector_;
-  MinorMarkCompactCollector* minor_collector_;
+  MinorMarkSweepCollector* minor_collector_;
   IncrementalMarking* incremental_marking_;
-  MarkingWorklist::Local major_worklist_;
-  MarkingWorklist::Local minor_worklist_;
-  MarkingWorklist::Local* current_worklist_;
+  std::unique_ptr<MarkingWorklist::Local> current_worklist_;
   base::Optional<MarkingWorklist::Local> shared_heap_worklist_;
   MarkingState marking_state_;
   std::unordered_map<MemoryChunk*, std::unique_ptr<TypedSlots>,
-                     MemoryChunk::Hasher>
+                     base::hash<MemoryChunk*>>
       typed_slots_map_;
   bool is_compacting_ = false;
   bool is_activated_ = false;
   const bool is_main_thread_barrier_;
   const bool uses_shared_heap_;
   const bool is_shared_space_isolate_;
-  MarkingBarrierType marking_barrier_type_ = MarkingBarrierType::kMajor;
+  MarkingMode marking_mode_ = MarkingMode::kNoMarking;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/marking-inl.h b/deps/v8/src/heap/marking-inl.h
new file mode 100644
index 00000000000000..528c1479d4cc63
--- /dev/null
+++ b/deps/v8/src/heap/marking-inl.h
@@ -0,0 +1,352 @@
+// Copyright 2012 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_MARKING_INL_H_
+#define V8_HEAP_MARKING_INL_H_
+
+#include "src/base/build_config.h"
+#include "src/base/macros.h"
+#include "src/heap/basic-memory-chunk.h"
+#include "src/heap/heap-inl.h"
+#include "src/heap/marking.h"
+#include "src/heap/memory-chunk-layout.h"
+#include "src/heap/spaces.h"
+#include "src/objects/instance-type-inl.h"
+
+namespace v8::internal {
+
+template <>
+inline void MarkingBitmap::SetBitsInCell<AccessMode::NON_ATOMIC>(
+    uint32_t cell_index, MarkBit::CellType mask) {
+  cells()[cell_index] |= mask;
+}
+
+template <>
+inline void MarkingBitmap::SetBitsInCell<AccessMode::ATOMIC>(
+    uint32_t cell_index, MarkBit::CellType mask) {
+  base::AsAtomicWord::SetBits(cells() + cell_index, mask, mask);
+}
+
+template <>
+inline void MarkingBitmap::ClearBitsInCell<AccessMode::NON_ATOMIC>(
+    uint32_t cell_index, MarkBit::CellType mask) {
+  cells()[cell_index] &= ~mask;
+}
+
+template <>
+inline void MarkingBitmap::ClearBitsInCell<AccessMode::ATOMIC>(
+    uint32_t cell_index, MarkBit::CellType mask) {
+  base::AsAtomicWord::SetBits(cells() + cell_index,
+                              static_cast<MarkBit::CellType>(0u), mask);
+}
+
+template <>
+inline void MarkingBitmap::ClearCellRangeRelaxed<AccessMode::ATOMIC>(
+    uint32_t start_cell_index, uint32_t end_cell_index) {
+  base::AtomicWord* cell_base = reinterpret_cast<base::AtomicWord*>(cells());
+  for (uint32_t i = start_cell_index; i < end_cell_index; i++) {
+    base::Relaxed_Store(cell_base + i, 0);
+  }
+}
+
+template <>
+inline void MarkingBitmap::ClearCellRangeRelaxed<AccessMode::NON_ATOMIC>(
+    uint32_t start_cell_index, uint32_t end_cell_index) {
+  for (uint32_t i = start_cell_index; i < end_cell_index; i++) {
+    cells()[i] = 0;
+  }
+}
+
+template <>
+inline void MarkingBitmap::SetCellRangeRelaxed<AccessMode::ATOMIC>(
+    uint32_t start_cell_index, uint32_t end_cell_index) {
+  base::AtomicWord* cell_base = reinterpret_cast<base::AtomicWord*>(cells());
+  for (uint32_t i = start_cell_index; i < end_cell_index; i++) {
+    base::Relaxed_Store(cell_base + i,
+                        std::numeric_limits<MarkBit::CellType>::max());
+  }
+}
+
+template <>
+inline void MarkingBitmap::SetCellRangeRelaxed<AccessMode::NON_ATOMIC>(
+    uint32_t start_cell_index, uint32_t end_cell_index) {
+  for (uint32_t i = start_cell_index; i < end_cell_index; i++) {
+    cells()[i] = std::numeric_limits<MarkBit::CellType>::max();
+  }
+}
+
+template <AccessMode mode>
+void MarkingBitmap::Clear() {
+  ClearCellRangeRelaxed<mode>(0, kCellsCount);
+  if constexpr (mode == AccessMode::ATOMIC) {
+    // This fence prevents re-ordering of publishing stores with the mark-bit
+    // setting stores.
+    base::SeqCst_MemoryFence();
+  }
+}
+
+template <AccessMode mode>
+inline void MarkingBitmap::SetRange(MarkBitIndex start_index,
+                                    MarkBitIndex end_index) {
+  if (start_index >= end_index) return;
+  end_index--;
+
+  const CellIndex start_cell_index = IndexToCell(start_index);
+  const MarkBit::CellType start_index_mask = IndexInCellMask(start_index);
+  const CellIndex end_cell_index = IndexToCell(end_index);
+  const MarkBit::CellType end_index_mask = IndexInCellMask(end_index);
+
+  if (start_cell_index != end_cell_index) {
+    // Firstly, fill all bits from the start address to the end of the first
+    // cell with 1s.
+    SetBitsInCell<mode>(start_cell_index, ~(start_index_mask - 1));
+    // Then fill all in between cells with 1s.
+    SetCellRangeRelaxed<mode>(start_cell_index + 1, end_cell_index);
+    // Finally, fill all bits until the end address in the last cell with 1s.
+    SetBitsInCell<mode>(end_cell_index, end_index_mask | (end_index_mask - 1));
+  } else {
+    SetBitsInCell<mode>(start_cell_index,
+                        end_index_mask | (end_index_mask - start_index_mask));
+  }
+  if (mode == AccessMode::ATOMIC) {
+    // This fence prevents re-ordering of publishing stores with the mark-bit
+    // setting stores.
+    base::SeqCst_MemoryFence();
+  }
+}
+
+template <AccessMode mode>
+inline void MarkingBitmap::ClearRange(MarkBitIndex start_index,
+                                      MarkBitIndex end_index) {
+  if (start_index >= end_index) return;
+  end_index--;
+
+  const CellIndex start_cell_index = IndexToCell(start_index);
+  const MarkBit::CellType start_index_mask = IndexInCellMask(start_index);
+  const CellIndex end_cell_index = IndexToCell(end_index);
+  const MarkBit::CellType end_index_mask = IndexInCellMask(end_index);
+
+  if (start_cell_index != end_cell_index) {
+    // Firstly, fill all bits from the start address to the end of the first
+    // cell with 0s.
+    ClearBitsInCell<mode>(start_cell_index, ~(start_index_mask - 1));
+    // Then fill all in between cells with 0s.
+    ClearCellRangeRelaxed<mode>(start_cell_index + 1, end_cell_index);
+    // Finally, set all bits until the end address in the last cell with 0s.
+    ClearBitsInCell<mode>(end_cell_index,
+                          end_index_mask | (end_index_mask - 1));
+  } else {
+    ClearBitsInCell<mode>(start_cell_index,
+                          end_index_mask | (end_index_mask - start_index_mask));
+  }
+  if (mode == AccessMode::ATOMIC) {
+    // This fence prevents re-ordering of publishing stores with the mark-bit
+    // clearing stores.
+    base::SeqCst_MemoryFence();
+  }
+}
+
+// static
+MarkingBitmap* MarkingBitmap::FromAddress(Address address) {
+  Address page_address = address & ~kPageAlignmentMask;
+  return Cast(page_address + MemoryChunkLayout::kMarkingBitmapOffset);
+}
+
+// static
+MarkBit MarkingBitmap::MarkBitFromAddress(Address address) {
+  const auto index = AddressToIndex(address);
+  const auto mask = IndexInCellMask(index);
+  MarkBit::CellType* cell = FromAddress(address)->cells() + IndexToCell(index);
+  return MarkBit(cell, mask);
+}
+
+// static
+constexpr MarkingBitmap::MarkBitIndex MarkingBitmap::LimitAddressToIndex(
+    Address address) {
+  if (IsAligned(address, BasicMemoryChunk::kAlignment)) return kLength;
+  return AddressToIndex(address);
+}
+
+// static
+inline Address MarkingBitmap::FindPreviousValidObject(const Page* page,
+                                                      Address maybe_inner_ptr) {
+  DCHECK(page->Contains(maybe_inner_ptr));
+  const auto* bitmap = page->marking_bitmap();
+  const MarkBit::CellType* cells = bitmap->cells();
+
+  // The first actual bit of the bitmap, corresponding to page->area_start(),
+  // is at start_index which is somewhere in (not necessarily at the start of)
+  // start_cell_index.
+  const auto start_index = MarkingBitmap::AddressToIndex(page->area_start());
+  const auto start_cell_index = MarkingBitmap::IndexToCell(start_index);
+  // We assume that all markbits before start_index are clear:
+  // SLOW_DCHECK(bitmap->AllBitsClearInRange(0, start_index));
+  // This has already been checked for the entire bitmap before starting marking
+  // by MarkCompactCollector::VerifyMarkbitsAreClean.
+
+  const auto index = MarkingBitmap::AddressToIndex(maybe_inner_ptr);
+  auto cell_index = MarkingBitmap::IndexToCell(index);
+  const auto index_in_cell = MarkingBitmap::IndexInCell(index);
+  DCHECK_GT(MarkingBitmap::kBitsPerCell, index_in_cell);
+  auto cell = cells[cell_index];
+
+  // Clear the bits corresponding to higher addresses in the cell.
+  cell &= ((~static_cast<MarkBit::CellType>(0)) >>
+           (MarkingBitmap::kBitsPerCell - index_in_cell - 1));
+
+  // Traverse the bitmap backwards, until we find a markbit that is set and
+  // whose previous markbit (if it exists) is unset.
+  // First, iterate backwards to find a cell with any set markbit.
+  while (cell == 0 && cell_index > start_cell_index) cell = cells[--cell_index];
+  if (cell == 0) {
+    DCHECK_EQ(start_cell_index, cell_index);
+    // We have reached the start of the page.
+    return page->area_start();
+  }
+
+  // We have found such a cell.
+  const auto leading_zeros = base::bits::CountLeadingZeros(cell);
+  const auto leftmost_ones =
+      base::bits::CountLeadingZeros(~(cell << leading_zeros));
+  const auto index_of_last_leftmost_one =
+      MarkingBitmap::kBitsPerCell - leading_zeros - leftmost_ones;
+
+  // If the leftmost sequence of set bits does not reach the start of the cell,
+  // we found it.
+  if (index_of_last_leftmost_one > 0) {
+    return page->address() + MarkingBitmap::IndexToAddressOffset(
+                                 cell_index * MarkingBitmap::kBitsPerCell +
+                                 index_of_last_leftmost_one);
+  }
+
+  // The leftmost sequence of set bits reaches the start of the cell. We must
+  // keep traversing backwards until we find the first unset markbit.
+  if (cell_index == start_cell_index) {
+    // We have reached the start of the page.
+    return page->area_start();
+  }
+
+  // Iterate backwards to find a cell with any unset markbit.
+  do {
+    cell = cells[--cell_index];
+  } while (~cell == 0 && cell_index > start_cell_index);
+  if (~cell == 0) {
+    DCHECK_EQ(start_cell_index, cell_index);
+    // We have reached the start of the page.
+    return page->area_start();
+  }
+
+  // We have found such a cell.
+  const auto leading_ones = base::bits::CountLeadingZeros(~cell);
+  const auto index_of_last_leading_one =
+      MarkingBitmap::kBitsPerCell - leading_ones;
+  DCHECK_LT(0, index_of_last_leading_one);
+  return page->address() + MarkingBitmap::IndexToAddressOffset(
+                               cell_index * MarkingBitmap::kBitsPerCell +
+                               index_of_last_leading_one);
+}
+
+// static
+MarkBit MarkBit::From(Address address) {
+  return MarkingBitmap::MarkBitFromAddress(address);
+}
+
+// static
+MarkBit MarkBit::From(Tagged<HeapObject> heap_object) {
+  return MarkingBitmap::MarkBitFromAddress(heap_object.ptr());
+}
+
+LiveObjectRange::iterator::iterator() : cage_base_(kNullAddress) {}
+
+LiveObjectRange::iterator::iterator(const Page* page)
+    : page_(page),
+      cells_(page->marking_bitmap()->cells()),
+      cage_base_(page->heap()->isolate()),
+      current_cell_index_(MarkingBitmap::IndexToCell(
+          MarkingBitmap::AddressToIndex(page->area_start()))),
+      current_cell_(cells_[current_cell_index_]) {
+  AdvanceToNextValidObject();
+}
+
+LiveObjectRange::iterator& LiveObjectRange::iterator::operator++() {
+  AdvanceToNextValidObject();
+  return *this;
+}
+
+LiveObjectRange::iterator LiveObjectRange::iterator::operator++(int) {
+  iterator retval = *this;
+  ++(*this);
+  return retval;
+}
+
+void LiveObjectRange::iterator::AdvanceToNextValidObject() {
+  // If we found a regular object we are done. In case of free space, we
+  // need to continue.
+  //
+  // Reading the instance type of the map is safe here even in the presence
+  // of the mutator writing a new Map because Map objects are published with
+  // release stores (or are otherwise read-only) and the map is retrieved  in
+  // `AdvanceToNextMarkedObject()` using an acquire load.
+  while (AdvanceToNextMarkedObject() &&
+         InstanceTypeChecker::IsFreeSpaceOrFiller(current_map_)) {
+  }
+}
+
+bool LiveObjectRange::iterator::AdvanceToNextMarkedObject() {
+  // The following block moves the iterator to the next cell from the current
+  // object. This means skipping all possibly set mark bits (in case of black
+  // allocation).
+  if (!current_object_.is_null()) {
+    // Compute an end address that is inclusive. This allows clearing the cell
+    // up and including the end address. This works for one word fillers as
+    // well as other objects.
+    Address next_object = current_object_.address() + current_size_;
+    current_object_ = HeapObject();
+    if (IsAligned(next_object, BasicMemoryChunk::kAlignment)) {
+      return false;
+    }
+    // Area end may not be exactly aligned to kAlignment. We don't need to bail
+    // out for area_end() though as we are guaranteed to have a bit for the
+    // whole page.
+    DCHECK_LE(next_object, page_->area_end());
+    // Move to the corresponding cell of the end index.
+    const auto next_markbit_index = MarkingBitmap::AddressToIndex(next_object);
+    DCHECK_GE(MarkingBitmap::IndexToCell(next_markbit_index),
+              current_cell_index_);
+    current_cell_index_ = MarkingBitmap::IndexToCell(next_markbit_index);
+    DCHECK_LT(current_cell_index_, MarkingBitmap::kCellsCount);
+    // Mask out lower addresses in the cell.
+    const MarkBit::CellType mask =
+        MarkingBitmap::IndexInCellMask(next_markbit_index);
+    current_cell_ = cells_[current_cell_index_] & ~(mask - 1);
+  }
+  // The next block finds any marked object starting from the current cell.
+  while (true) {
+    if (current_cell_) {
+      const auto trailing_zeros = base::bits::CountTrailingZeros(current_cell_);
+      Address current_cell_base =
+          page_->address() + MarkingBitmap::CellToBase(current_cell_index_);
+      Address object_address = current_cell_base + trailing_zeros * kTaggedSize;
+      // The object may be a filler which we want to skip.
+      current_object_ = HeapObject::FromAddress(object_address);
+      current_map_ = current_object_->map(cage_base_, kAcquireLoad);
+      DCHECK(MapWord::IsMapOrForwarded(current_map_));
+      current_size_ = ALIGN_TO_ALLOCATION_ALIGNMENT(
+          current_object_->SizeFromMap(current_map_));
+      CHECK(page_->ContainsLimit(object_address + current_size_));
+      return true;
+    }
+    if (++current_cell_index_ >= MarkingBitmap::kCellsCount) break;
+    current_cell_ = cells_[current_cell_index_];
+  }
+  return false;
+}
+
+LiveObjectRange::iterator LiveObjectRange::begin() { return iterator(page_); }
+
+LiveObjectRange::iterator LiveObjectRange::end() { return iterator(); }
+
+}  // namespace v8::internal
+
+#endif  // V8_HEAP_MARKING_INL_H_
diff --git a/deps/v8/src/heap/marking-state-inl.h b/deps/v8/src/heap/marking-state-inl.h
index c22795234d1739..e97d81081857d2 100644
--- a/deps/v8/src/heap/marking-state-inl.h
+++ b/deps/v8/src/heap/marking-state-inl.h
@@ -5,138 +5,42 @@
 #ifndef V8_HEAP_MARKING_STATE_INL_H_
 #define V8_HEAP_MARKING_STATE_INL_H_
 
+#include "src/heap/marking-inl.h"
 #include "src/heap/marking-state.h"
 #include "src/heap/memory-chunk.h"
 
 namespace v8 {
 namespace internal {
 
-template <typename ConcreteState, AccessMode access_mode>
-MarkBit MarkingStateBase<ConcreteState, access_mode>::MarkBitFrom(
-    const HeapObject obj) const {
-  return MarkBitFrom(BasicMemoryChunk::FromHeapObject(obj), obj.ptr());
-}
-
-template <typename ConcreteState, AccessMode access_mode>
-MarkBit MarkingStateBase<ConcreteState, access_mode>::MarkBitFrom(
-    const BasicMemoryChunk* p, Address addr) const {
-  return static_cast<const ConcreteState*>(this)->bitmap(p)->MarkBitFromIndex(
-      p->AddressToMarkbitIndex(addr));
-}
-
-template <typename ConcreteState, AccessMode access_mode>
-bool MarkingStateBase<ConcreteState, access_mode>::IsImpossible(
-    const HeapObject obj) const {
-  return Marking::IsImpossible<access_mode>(MarkBitFrom(obj));
-}
-
 template <typename ConcreteState, AccessMode access_mode>
 bool MarkingStateBase<ConcreteState, access_mode>::IsMarked(
-    const HeapObject obj) const {
-  return Marking::IsBlack<access_mode>(MarkBitFrom(obj));
+    const Tagged<HeapObject> obj) const {
+  return MarkBit::From(obj).template Get<access_mode>();
 }
 
 template <typename ConcreteState, AccessMode access_mode>
 bool MarkingStateBase<ConcreteState, access_mode>::IsUnmarked(
-    const HeapObject obj) const {
-  return Marking::IsWhite<access_mode>(MarkBitFrom(obj));
+    const Tagged<HeapObject> obj) const {
+  return !IsMarked(obj);
 }
 
 template <typename ConcreteState, AccessMode access_mode>
-bool MarkingStateBase<ConcreteState, access_mode>::IsGrey(
-    const HeapObject obj) const {
-  return Marking::IsGrey<access_mode>(MarkBitFrom(obj));
-}
-
-template <typename ConcreteState, AccessMode access_mode>
-bool MarkingStateBase<ConcreteState, access_mode>::IsBlackOrGrey(
-    const HeapObject obj) const {
-  return Marking::IsBlackOrGrey<access_mode>(MarkBitFrom(obj));
-}
-
-template <typename ConcreteState, AccessMode access_mode>
-bool MarkingStateBase<ConcreteState, access_mode>::TryMark(HeapObject obj) {
-  return Marking::WhiteToGrey<access_mode>(MarkBitFrom(obj));
+bool MarkingStateBase<ConcreteState, access_mode>::TryMark(
+    Tagged<HeapObject> obj) {
+  return MarkBit::From(obj).template Set<access_mode>();
 }
 
 template <typename ConcreteState, AccessMode access_mode>
 bool MarkingStateBase<ConcreteState, access_mode>::TryMarkAndAccountLiveBytes(
-    HeapObject obj) {
-  if (TryMark(obj) && GreyToBlack(obj)) {
-    static_cast<ConcreteState*>(this)->IncrementLiveBytes(
-        MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(obj)),
-        ALIGN_TO_ALLOCATION_ALIGNMENT(obj.Size(cage_base())));
+    Tagged<HeapObject> obj) {
+  if (TryMark(obj)) {
+    MemoryChunk::FromHeapObject(obj)->IncrementLiveBytesAtomically(
+        ALIGN_TO_ALLOCATION_ALIGNMENT(obj->Size(cage_base())));
     return true;
   }
   return false;
 }
 
-template <typename ConcreteState, AccessMode access_mode>
-bool MarkingStateBase<ConcreteState, access_mode>::GreyToBlack(HeapObject obj) {
-  return Marking::GreyToBlack<access_mode>(MarkBitFrom(obj));
-}
-
-template <typename ConcreteState, AccessMode access_mode>
-void MarkingStateBase<ConcreteState, access_mode>::ClearLiveness(
-    MemoryChunk* chunk) {
-  static_cast<ConcreteState*>(this)->bitmap(chunk)->Clear();
-  static_cast<ConcreteState*>(this)->SetLiveBytes(chunk, 0);
-}
-
-ConcurrentBitmap<AccessMode::ATOMIC>* MarkingState::bitmap(
-    const BasicMemoryChunk* chunk) const {
-  return chunk->marking_bitmap<AccessMode::ATOMIC>();
-}
-
-void MarkingState::IncrementLiveBytes(MemoryChunk* chunk, intptr_t by) {
-  DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
-                 IsAligned(by, kObjectAlignment8GbHeap));
-  chunk->live_byte_count_.fetch_add(by, std::memory_order_relaxed);
-}
-
-intptr_t MarkingState::live_bytes(const MemoryChunk* chunk) const {
-  return chunk->live_byte_count_.load(std::memory_order_relaxed);
-}
-
-void MarkingState::SetLiveBytes(MemoryChunk* chunk, intptr_t value) {
-  DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
-                 IsAligned(value, kObjectAlignment8GbHeap));
-  chunk->live_byte_count_.store(value, std::memory_order_relaxed);
-}
-
-ConcurrentBitmap<AccessMode::NON_ATOMIC>* NonAtomicMarkingState::bitmap(
-    const BasicMemoryChunk* chunk) const {
-  return chunk->marking_bitmap<AccessMode::NON_ATOMIC>();
-}
-
-void NonAtomicMarkingState::IncrementLiveBytes(MemoryChunk* chunk,
-                                               intptr_t by) {
-  DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
-                 IsAligned(by, kObjectAlignment8GbHeap));
-  chunk->live_byte_count_.fetch_add(by, std::memory_order_relaxed);
-}
-
-intptr_t NonAtomicMarkingState::live_bytes(const MemoryChunk* chunk) const {
-  return chunk->live_byte_count_.load(std::memory_order_relaxed);
-}
-
-void NonAtomicMarkingState::SetLiveBytes(MemoryChunk* chunk, intptr_t value) {
-  DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
-                 IsAligned(value, kObjectAlignment8GbHeap));
-  chunk->live_byte_count_.store(value, std::memory_order_relaxed);
-}
-
-ConcurrentBitmap<AccessMode::ATOMIC>* AtomicMarkingState::bitmap(
-    const BasicMemoryChunk* chunk) const {
-  return chunk->marking_bitmap<AccessMode::ATOMIC>();
-}
-
-void AtomicMarkingState::IncrementLiveBytes(MemoryChunk* chunk, intptr_t by) {
-  DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
-                 IsAligned(by, kObjectAlignment8GbHeap));
-  chunk->live_byte_count_.fetch_add(by);
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/marking-state.h b/deps/v8/src/heap/marking-state.h
index aefd341dfd3d94..2efeaeb5fd5bd1 100644
--- a/deps/v8/src/heap/marking-state.h
+++ b/deps/v8/src/heap/marking-state.h
@@ -18,11 +18,6 @@ class MemoryChunk;
 template <typename ConcreteState, AccessMode access_mode>
 class MarkingStateBase {
  public:
-  // Declares that this marking state is not collecting retainers, so the
-  // marking visitor may update the heap state to store information about
-  // progress, and may avoid fully visiting an object if it is safe to do so.
-  static constexpr bool kCollectRetainers = false;
-
   explicit MarkingStateBase(PtrComprCageBase cage_base)
 #if V8_COMPRESS_POINTERS
       : cage_base_(cage_base)
@@ -40,33 +35,12 @@ class MarkingStateBase {
 #endif  // V8_COMPRESS_POINTERS
   }
 
-  V8_INLINE MarkBit MarkBitFrom(const HeapObject obj) const;
-
-  // {addr} may be tagged or aligned.
-  V8_INLINE MarkBit MarkBitFrom(const BasicMemoryChunk* p, Address addr) const;
-
-  V8_INLINE bool IsImpossible(const HeapObject obj) const;
-  V8_INLINE bool IsGrey(const HeapObject obj) const;
-  V8_INLINE bool IsBlackOrGrey(const HeapObject obj) const;
-  V8_INLINE bool GreyToBlack(HeapObject obj);
-
-  V8_INLINE bool TryMark(HeapObject obj);
+  V8_INLINE bool TryMark(Tagged<HeapObject> obj);
   // Helper method for fully marking an object and accounting its live bytes.
   // Should be used to mark individual objects in one-off cases.
-  V8_INLINE bool TryMarkAndAccountLiveBytes(HeapObject obj);
-  V8_INLINE bool IsMarked(const HeapObject obj) const;
-  V8_INLINE bool IsUnmarked(const HeapObject obj) const;
-
-  V8_INLINE void ClearLiveness(MemoryChunk* chunk);
-
-  void AddStrongReferenceForReferenceSummarizer(HeapObject host,
-                                                HeapObject obj) {
-    // This is not a reference summarizer, so there is nothing to do here.
-  }
-
-  void AddWeakReferenceForReferenceSummarizer(HeapObject host, HeapObject obj) {
-    // This is not a reference summarizer, so there is nothing to do here.
-  }
+  V8_INLINE bool TryMarkAndAccountLiveBytes(Tagged<HeapObject> obj);
+  V8_INLINE bool IsMarked(const Tagged<HeapObject> obj) const;
+  V8_INLINE bool IsUnmarked(const Tagged<HeapObject> obj) const;
 
  private:
 #if V8_COMPRESS_POINTERS
@@ -80,17 +54,6 @@ class MarkingState final
  public:
   explicit MarkingState(PtrComprCageBase cage_base)
       : MarkingStateBase(cage_base) {}
-
-  V8_INLINE ConcurrentBitmap<AccessMode::ATOMIC>* bitmap(
-      const BasicMemoryChunk* chunk) const;
-
-  // Concurrent marking uses local live bytes so we may do these accesses
-  // non-atomically.
-  V8_INLINE void IncrementLiveBytes(MemoryChunk* chunk, intptr_t by);
-
-  V8_INLINE intptr_t live_bytes(const MemoryChunk* chunk) const;
-
-  V8_INLINE void SetLiveBytes(MemoryChunk* chunk, intptr_t value);
 };
 
 class NonAtomicMarkingState final
@@ -98,29 +61,6 @@ class NonAtomicMarkingState final
  public:
   explicit NonAtomicMarkingState(PtrComprCageBase cage_base)
       : MarkingStateBase(cage_base) {}
-
-  V8_INLINE ConcurrentBitmap<AccessMode::NON_ATOMIC>* bitmap(
-      const BasicMemoryChunk* chunk) const;
-
-  V8_INLINE void IncrementLiveBytes(MemoryChunk* chunk, intptr_t by);
-
-  V8_INLINE intptr_t live_bytes(const MemoryChunk* chunk) const;
-
-  V8_INLINE void SetLiveBytes(MemoryChunk* chunk, intptr_t value);
-};
-
-// This is used by Scavenger and Evacuator in TransferColor.
-// Live byte increments have to be atomic.
-class AtomicMarkingState final
-    : public MarkingStateBase<AtomicMarkingState, AccessMode::ATOMIC> {
- public:
-  explicit AtomicMarkingState(PtrComprCageBase cage_base)
-      : MarkingStateBase(cage_base) {}
-
-  V8_INLINE ConcurrentBitmap<AccessMode::ATOMIC>* bitmap(
-      const BasicMemoryChunk* chunk) const;
-
-  V8_INLINE void IncrementLiveBytes(MemoryChunk* chunk, intptr_t by);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/marking-visitor-inl.h b/deps/v8/src/heap/marking-visitor-inl.h
index 9e873e34ca4700..6fef91dbb67936 100644
--- a/deps/v8/src/heap/marking-visitor-inl.h
+++ b/deps/v8/src/heap/marking-visitor-inl.h
@@ -6,6 +6,7 @@
 #define V8_HEAP_MARKING_VISITOR_INL_H_
 
 #include "src/common/globals.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/marking-state-inl.h"
 #include "src/heap/marking-visitor.h"
 #include "src/heap/marking-worklist-inl.h"
@@ -15,6 +16,7 @@
 #include "src/heap/progress-bar.h"
 #include "src/heap/spaces.h"
 #include "src/objects/descriptor-array.h"
+#include "src/objects/object-macros.h"
 #include "src/objects/objects.h"
 #include "src/objects/property-details.h"
 #include "src/objects/smi.h"
@@ -28,13 +30,13 @@ namespace internal {
 // Visiting strong and weak pointers =========================================
 // ===========================================================================
 
-template <typename ConcreteVisitor, typename MarkingState>
-void MarkingVisitorBase<ConcreteVisitor, MarkingState>::MarkObject(
-    HeapObject host, HeapObject object) {
+template <typename ConcreteVisitor>
+void MarkingVisitorBase<ConcreteVisitor>::MarkObject(
+    Tagged<HeapObject> host, Tagged<HeapObject> object) {
   DCHECK(ReadOnlyHeap::Contains(object) || heap_->Contains(object));
   SynchronizePageAccess(object);
-  AddStrongReferenceForReferenceSummarizer(host, object);
-  if (concrete_visitor()->marking_state()->TryMark(object)) {
+  concrete_visitor()->AddStrongReferenceForReferenceSummarizer(host, object);
+  if (concrete_visitor()->TryMark(object)) {
     local_marking_worklists_->Push(object);
     if (V8_UNLIKELY(concrete_visitor()->retaining_path_mode() ==
                     TraceRetainingPathMode::kEnabled)) {
@@ -44,11 +46,12 @@ void MarkingVisitorBase<ConcreteVisitor, MarkingState>::MarkObject(
 }
 
 // class template arguments
-template <typename ConcreteVisitor, typename MarkingState>
+template <typename ConcreteVisitor>
 // method template arguments
 template <typename THeapObjectSlot>
-void MarkingVisitorBase<ConcreteVisitor, MarkingState>::ProcessStrongHeapObject(
-    HeapObject host, THeapObjectSlot slot, HeapObject heap_object) {
+void MarkingVisitorBase<ConcreteVisitor>::ProcessStrongHeapObject(
+    Tagged<HeapObject> host, THeapObjectSlot slot,
+    Tagged<HeapObject> heap_object) {
   SynchronizePageAccess(heap_object);
   if (!ShouldMarkObject(heap_object)) return;
   MarkObject(host, heap_object);
@@ -56,14 +59,15 @@ void MarkingVisitorBase<ConcreteVisitor, MarkingState>::ProcessStrongHeapObject(
 }
 
 // class template arguments
-template <typename ConcreteVisitor, typename MarkingState>
+template <typename ConcreteVisitor>
 // method template arguments
 template <typename THeapObjectSlot>
-void MarkingVisitorBase<ConcreteVisitor, MarkingState>::ProcessWeakHeapObject(
-    HeapObject host, THeapObjectSlot slot, HeapObject heap_object) {
+void MarkingVisitorBase<ConcreteVisitor>::ProcessWeakHeapObject(
+    Tagged<HeapObject> host, THeapObjectSlot slot,
+    Tagged<HeapObject> heap_object) {
   SynchronizePageAccess(heap_object);
   if (!ShouldMarkObject(heap_object)) return;
-  if (concrete_visitor()->marking_state()->IsBlackOrGrey(heap_object)) {
+  if (concrete_visitor()->IsMarked(heap_object)) {
     // Weak references with live values are directly processed here to
     // reduce the processing time of weak cells during the main GC
     // pause.
@@ -73,22 +77,22 @@ void MarkingVisitorBase<ConcreteVisitor, MarkingState>::ProcessWeakHeapObject(
     // the reference when we know the liveness of the whole transitive
     // closure.
     local_weak_objects_->weak_references_local.Push(std::make_pair(host, slot));
-    AddWeakReferenceForReferenceSummarizer(host, heap_object);
+    concrete_visitor()->AddWeakReferenceForReferenceSummarizer(host,
+                                                               heap_object);
   }
 }
 
 // class template arguments
-template <typename ConcreteVisitor, typename MarkingState>
+template <typename ConcreteVisitor>
 // method template arguments
 template <typename TSlot>
-V8_INLINE void
-MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitPointersImpl(
-    HeapObject host, TSlot start, TSlot end) {
+V8_INLINE void MarkingVisitorBase<ConcreteVisitor>::VisitPointersImpl(
+    Tagged<HeapObject> host, TSlot start, TSlot end) {
   using THeapObjectSlot = typename TSlot::THeapObjectSlot;
   for (TSlot slot = start; slot < end; ++slot) {
     typename TSlot::TObject object =
         slot.Relaxed_Load(ObjectVisitorWithCageBases::cage_base());
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
     if (object.GetHeapObjectIfStrong(&heap_object)) {
       // If the reference changes concurrently from strong to weak, the write
       // barrier will treat the weak reference as strong, so we won't miss the
@@ -100,13 +104,13 @@ MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitPointersImpl(
   }
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
+template <typename ConcreteVisitor>
 V8_INLINE void
-MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitCodePointerImpl(
-    Code host, CodeObjectSlot slot) {
-  Object object =
+MarkingVisitorBase<ConcreteVisitor>::VisitInstructionStreamPointerImpl(
+    Tagged<Code> host, InstructionStreamSlot slot) {
+  Tagged<Object> object =
       slot.Relaxed_Load(ObjectVisitorWithCageBases::code_cage_base());
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
   if (object.GetHeapObjectIfStrong(&heap_object)) {
     // If the reference changes concurrently from strong to weak, the write
     // barrier will treat the weak reference as strong, so we won't miss the
@@ -115,111 +119,161 @@ MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitCodePointerImpl(
   }
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-void MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitEmbeddedPointer(
-    RelocInfo* rinfo) {
+template <typename ConcreteVisitor>
+void MarkingVisitorBase<ConcreteVisitor>::VisitEmbeddedPointer(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
   DCHECK(RelocInfo::IsEmbeddedObjectMode(rinfo->rmode()));
-  HeapObject object =
+  Tagged<HeapObject> object =
       rinfo->target_object(ObjectVisitorWithCageBases::cage_base());
   if (!ShouldMarkObject(object)) return;
 
-  if (!concrete_visitor()->marking_state()->IsBlackOrGrey(object)) {
-    if (rinfo->code().IsWeakObject(object)) {
+  if (!concrete_visitor()->IsMarked(object)) {
+    Tagged<Code> code = Code::unchecked_cast(host->raw_code(kAcquireLoad));
+    if (code->IsWeakObject(object)) {
       local_weak_objects_->weak_objects_in_code_local.Push(
-          std::make_pair(object, rinfo->code()));
-      AddWeakReferenceForReferenceSummarizer(rinfo->instruction_stream(),
-                                             object);
+          std::make_pair(object, code));
+      concrete_visitor()->AddWeakReferenceForReferenceSummarizer(host, object);
     } else {
-      MarkObject(rinfo->instruction_stream(), object);
+      MarkObject(host, object);
     }
   }
-  concrete_visitor()->RecordRelocSlot(rinfo, object);
+  concrete_visitor()->RecordRelocSlot(host, rinfo, object);
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-void MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitCodeTarget(
-    RelocInfo* rinfo) {
+template <typename ConcreteVisitor>
+void MarkingVisitorBase<ConcreteVisitor>::VisitCodeTarget(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
   DCHECK(RelocInfo::IsCodeTargetMode(rinfo->rmode()));
-  InstructionStream target =
+  Tagged<InstructionStream> target =
       InstructionStream::FromTargetAddress(rinfo->target_address());
 
   if (!ShouldMarkObject(target)) return;
-  MarkObject(rinfo->instruction_stream(), target);
-  concrete_visitor()->RecordRelocSlot(rinfo, target);
+  MarkObject(host, target);
+  concrete_visitor()->RecordRelocSlot(host, rinfo, target);
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-void MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitExternalPointer(
-    HeapObject host, ExternalPointerSlot slot, ExternalPointerTag tag) {
+template <typename ConcreteVisitor>
+void MarkingVisitorBase<ConcreteVisitor>::VisitExternalPointer(
+    Tagged<HeapObject> host, ExternalPointerSlot slot, ExternalPointerTag tag) {
 #ifdef V8_ENABLE_SANDBOX
   DCHECK_NE(tag, kExternalPointerNullTag);
   ExternalPointerHandle handle = slot.Relaxed_LoadHandle();
   ExternalPointerTable* table = IsSharedExternalPointerType(tag)
                                     ? shared_external_pointer_table_
                                     : external_pointer_table_;
-  table->Mark(handle, slot.address());
+  ExternalPointerTable::Space* space = IsSharedExternalPointerType(tag)
+                                           ? shared_external_pointer_space_
+                                           : heap_->external_pointer_space();
+  table->Mark(space, handle, slot.address());
 #endif  // V8_ENABLE_SANDBOX
 }
 
+template <typename ConcreteVisitor>
+void MarkingVisitorBase<ConcreteVisitor>::VisitIndirectPointer(
+    Tagged<HeapObject> host, IndirectPointerSlot slot,
+    IndirectPointerMode mode) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  if (mode == IndirectPointerMode::kStrong) {
+    // Load the referenced object (if the slot is initialized) and mark it as
+    // alive if necessary. Indirect pointers never have to be added to a
+    // remembered set because the referenced object will update the pointer
+    // table entry when it is relocated.
+    Tagged<Object> value = slot.Relaxed_Load();
+    if (IsHeapObject(value)) {
+      Tagged<HeapObject> obj = HeapObject::cast(value);
+      SynchronizePageAccess(obj);
+      if (ShouldMarkObject(obj)) {
+        MarkObject(host, obj);
+      }
+    }
+  }
+#else
+  UNREACHABLE();
+#endif
+}
+
+template <typename ConcreteVisitor>
+void MarkingVisitorBase<ConcreteVisitor>::VisitIndirectPointerTableEntry(
+    Tagged<HeapObject> host, IndirectPointerSlot slot) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  static_assert(kAllIndirectPointerObjectsAreCode);
+  CodePointerTable* table = GetProcessWideCodePointerTable();
+  CodePointerTable::Space* space = heap_->code_pointer_space();
+  IndirectPointerHandle handle = slot.Relaxed_LoadHandle();
+  table->Mark(space, handle);
+#else
+  UNREACHABLE();
+#endif
+}
+
 // ===========================================================================
 // Object participating in bytecode flushing =================================
 // ===========================================================================
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitBytecodeArray(
-    Map map, BytecodeArray object) {
-  if (!concrete_visitor()->ShouldVisit(object)) return 0;
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitBytecodeArray(
+    Tagged<Map> map, Tagged<BytecodeArray> object) {
   int size = BytecodeArray::BodyDescriptor::SizeOf(map, object);
   this->VisitMapPointer(object);
   BytecodeArray::BodyDescriptor::IterateBody(map, object, size, this);
-  if (!should_keep_ages_unchanged_) {
-    object.MakeOlder();
-  }
   return size;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitJSFunction(
-    Map map, JSFunction js_function) {
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitJSFunction(
+    Tagged<Map> map, Tagged<JSFunction> js_function) {
   int size = concrete_visitor()->VisitJSObjectSubclass(map, js_function);
-  if (js_function.ShouldFlushBaselineCode(code_flush_mode_)) {
+  if (ShouldFlushBaselineCode(js_function)) {
     DCHECK(IsBaselineCodeFlushingEnabled(code_flush_mode_));
     local_weak_objects_->baseline_flushing_candidates_local.Push(js_function);
   } else {
-    VisitPointer(js_function, js_function.RawField(JSFunction::kCodeOffset));
+#ifdef V8_CODE_POINTER_SANDBOXING
+    VisitIndirectPointer(
+        js_function,
+        js_function->RawIndirectPointerField(JSFunction::kCodeOffset),
+        IndirectPointerMode::kStrong);
+#else
+    VisitPointer(js_function, js_function->RawField(JSFunction::kCodeOffset));
+#endif  // V8_CODE_POINTER_SANDBOXING
     // TODO(mythria): Consider updating the check for ShouldFlushBaselineCode to
     // also include cases where there is old bytecode even when there is no
     // baseline code and remove this check here.
     if (IsByteCodeFlushingEnabled(code_flush_mode_) &&
-        js_function.NeedsResetDueToFlushedBytecode()) {
+        js_function->NeedsResetDueToFlushedBytecode()) {
       local_weak_objects_->flushed_js_functions_local.Push(js_function);
     }
   }
   return size;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitSharedFunctionInfo(
-    Map map, SharedFunctionInfo shared_info) {
-  if (!concrete_visitor()->ShouldVisit(shared_info)) return 0;
-
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitSharedFunctionInfo(
+    Tagged<Map> map, Tagged<SharedFunctionInfo> shared_info) {
   int size = SharedFunctionInfo::BodyDescriptor::SizeOf(map, shared_info);
   this->VisitMapPointer(shared_info);
   SharedFunctionInfo::BodyDescriptor::IterateBody(map, shared_info, size, this);
 
-  if (!shared_info.ShouldFlushCode(code_flush_mode_)) {
+  const bool can_flush_bytecode = HasBytecodeArrayForFlushing(shared_info);
+
+  // We found a BytecodeArray that can be flushed. Increment the age of the SFI.
+  if (can_flush_bytecode && !should_keep_ages_unchanged_) {
+    MakeOlder(shared_info);
+  }
+
+  if (!can_flush_bytecode || !ShouldFlushCode(shared_info)) {
     // If the SharedFunctionInfo doesn't have old bytecode visit the function
     // data strongly.
-    VisitPointer(shared_info,
-                 shared_info.RawField(SharedFunctionInfo::kFunctionDataOffset));
+    VisitPointer(shared_info, shared_info->RawField(
+                                  SharedFunctionInfo::kFunctionDataOffset));
   } else if (!IsByteCodeFlushingEnabled(code_flush_mode_)) {
     // If bytecode flushing is disabled but baseline code flushing is enabled
     // then we have to visit the bytecode but not the baseline code.
     DCHECK(IsBaselineCodeFlushingEnabled(code_flush_mode_));
-    Code baseline_code = Code::cast(shared_info.function_data(kAcquireLoad));
+    Tagged<Code> baseline_code =
+        Code::cast(shared_info->function_data(kAcquireLoad));
     // Visit the bytecode hanging off baseline code.
     VisitPointer(baseline_code,
-                 baseline_code.RawField(
+                 baseline_code->RawField(
                      Code::kDeoptimizationDataOrInterpreterDataOffset));
     local_weak_objects_->code_flushing_candidates_local.Push(shared_info);
   } else {
@@ -230,18 +284,126 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitSharedFunctionInfo(
   return size;
 }
 
+template <typename ConcreteVisitor>
+bool MarkingVisitorBase<ConcreteVisitor>::HasBytecodeArrayForFlushing(
+    Tagged<SharedFunctionInfo> sfi) const {
+  if (IsFlushingDisabled(code_flush_mode_)) return false;
+
+  // TODO(rmcilroy): Enable bytecode flushing for resumable functions.
+  if (IsResumableFunction(sfi->kind()) || !sfi->allows_lazy_compilation()) {
+    return false;
+  }
+
+  // Get a snapshot of the function data field, and if it is a bytecode array,
+  // check if it is old. Note, this is done this way since this function can be
+  // called by the concurrent marker.
+  Tagged<Object> data = sfi->function_data(kAcquireLoad);
+  if (IsCode(data)) {
+    Tagged<Code> baseline_code = Code::cast(data);
+    DCHECK_EQ(baseline_code->kind(), CodeKind::BASELINE);
+    // If baseline code flushing isn't enabled and we have baseline data on SFI
+    // we cannot flush baseline / bytecode.
+    if (!IsBaselineCodeFlushingEnabled(code_flush_mode_)) return false;
+    data = baseline_code->bytecode_or_interpreter_data();
+  } else if (!IsByteCodeFlushingEnabled(code_flush_mode_)) {
+    // If bytecode flushing isn't enabled and there is no baseline code there is
+    // nothing to flush.
+    return false;
+  }
+
+  return IsBytecodeArray(data);
+}
+
+template <typename ConcreteVisitor>
+bool MarkingVisitorBase<ConcreteVisitor>::ShouldFlushCode(
+    Tagged<SharedFunctionInfo> sfi) const {
+  return IsStressFlushingEnabled(code_flush_mode_) || IsOld(sfi);
+}
+
+template <typename ConcreteVisitor>
+bool MarkingVisitorBase<ConcreteVisitor>::IsOld(
+    Tagged<SharedFunctionInfo> sfi) const {
+  if (v8_flags.flush_code_based_on_time) {
+    return sfi->age() >= v8_flags.bytecode_old_time;
+  } else if (v8_flags.flush_code_based_on_tab_visibility) {
+    return isolate_in_background_ ||
+           V8_UNLIKELY(sfi->age() == SharedFunctionInfo::kMaxAge);
+  } else {
+    return sfi->age() >= v8_flags.bytecode_old_age;
+  }
+}
+
+template <typename ConcreteVisitor>
+void MarkingVisitorBase<ConcreteVisitor>::MakeOlder(
+    Tagged<SharedFunctionInfo> sfi) const {
+  if (v8_flags.flush_code_based_on_time) {
+    DCHECK_NE(code_flushing_increase_, 0);
+    uint16_t current_age;
+    uint16_t updated_age;
+
+    do {
+      current_age = sfi->age();
+      // When the age is 0, it was reset by the function prologue in
+      // Ignition/Sparkplug. But that might have been some time after the last
+      // full GC. So in this case we don't increment the value like we normally
+      // would but just set the age to 1. All non-0 values can be incremented as
+      // expected (we add the number of seconds since the last GC) as they were
+      // definitely last executed before the last full GC.
+      updated_age = current_age == 0
+                        ? 1
+                        : SaturateAdd(current_age, code_flushing_increase_);
+    } while (sfi->CompareExchangeAge(current_age, updated_age) != current_age);
+  } else if (v8_flags.flush_code_based_on_tab_visibility) {
+    // No need to increment age.
+  } else {
+    uint16_t age = sfi->age();
+    if (age < v8_flags.bytecode_old_age) {
+      sfi->CompareExchangeAge(age, age + 1);
+    }
+    DCHECK_LE(sfi->age(), v8_flags.bytecode_old_age);
+  }
+}
+
+template <typename ConcreteVisitor>
+bool MarkingVisitorBase<ConcreteVisitor>::ShouldFlushBaselineCode(
+    Tagged<JSFunction> js_function) const {
+  if (!IsBaselineCodeFlushingEnabled(code_flush_mode_)) return false;
+  // Do a raw read for shared and code fields here since this function may be
+  // called on a concurrent thread. JSFunction itself should be fully
+  // initialized here but the SharedFunctionInfo, InstructionStream objects may
+  // not be initialized. We read using acquire loads to defend against that.
+  Tagged<Object> maybe_shared =
+      ACQUIRE_READ_FIELD(js_function, JSFunction::kSharedFunctionInfoOffset);
+  if (!IsSharedFunctionInfo(maybe_shared)) return false;
+
+  // See crbug.com/v8/11972 for more details on acquire / release semantics for
+  // code field. We don't use release stores when copying code pointers from
+  // SFI / FV to JSFunction but it is safe in practice.
+  Tagged<Object> maybe_code = js_function->raw_code(kAcquireLoad);
+
+#ifdef THREAD_SANITIZER
+  // This is needed because TSAN does not process the memory fence
+  // emitted after page initialization.
+  BasicMemoryChunk::FromAddress(maybe_code.ptr())->SynchronizedHeapLoad();
+#endif
+  if (!IsCode(maybe_code)) return false;
+  Tagged<Code> code = Code::cast(maybe_code);
+  if (code->kind() != CodeKind::BASELINE) return false;
+
+  Tagged<SharedFunctionInfo> shared = SharedFunctionInfo::cast(maybe_shared);
+  return HasBytecodeArrayForFlushing(shared) && ShouldFlushCode(shared);
+}
+
 // ===========================================================================
 // Fixed arrays that need incremental processing and can be left-trimmed =====
 // ===========================================================================
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    VisitFixedArrayWithProgressBar(Map map, FixedArray object,
-                                   ProgressBar& progress_bar) {
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitFixedArrayWithProgressBar(
+    Tagged<Map> map, Tagged<FixedArray> object, ProgressBar& progress_bar) {
   const int kProgressBarScanningChunk = kMaxRegularHeapObjectSize;
   static_assert(kMaxRegularHeapObjectSize % kTaggedSize == 0);
-  DCHECK(concrete_visitor()->marking_state()->IsBlackOrGrey(object));
-  concrete_visitor()->marking_state()->GreyToBlack(object);
+  DCHECK(concrete_visitor()->IsMarked(object));
   int size = FixedArray::BodyDescriptor::SizeOf(map, object);
   size_t current_progress_bar = progress_bar.Value();
   int start = static_cast<int>(current_progress_bar);
@@ -251,7 +413,7 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::
   }
   int end = std::min(size, start + kProgressBarScanningChunk);
   if (start < end) {
-    VisitPointers(object, object.RawField(start), object.RawField(end));
+    VisitPointers(object, object->RawField(start), object->RawField(end));
     bool success = progress_bar.TrySetNewValue(current_progress_bar, end);
     CHECK(success);
     if (end < size) {
@@ -264,23 +426,23 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::
   return end - start;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitFixedArrayRegularly(
-    Map map, FixedArray object) {
-  if (!concrete_visitor()->ShouldVisit(object)) return 0;
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitFixedArrayRegularly(
+    Tagged<Map> map, Tagged<FixedArray> object) {
   int size = FixedArray::BodyDescriptor::SizeOf(map, object);
-  concrete_visitor()->VisitMapPointerIfNeeded(object);
+  concrete_visitor()
+      ->template VisitMapPointerIfNeeded<VisitorId::kVisitFixedArray>(object);
   FixedArray::BodyDescriptor::IterateBody(map, object, size,
                                           concrete_visitor());
   return size;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitFixedArray(
-    Map map, FixedArray object) {
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitFixedArray(
+    Tagged<Map> map, Tagged<FixedArray> object) {
   ProgressBar& progress_bar =
       MemoryChunk::FromHeapObject(object)->ProgressBar();
-  return CanUpdateValuesInHeap() && progress_bar.IsEnabled()
+  return concrete_visitor()->CanUpdateValuesInHeap() && progress_bar.IsEnabled()
              ? VisitFixedArrayWithProgressBar(map, object, progress_bar)
              : VisitFixedArrayRegularly(map, object);
 }
@@ -289,17 +451,19 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitFixedArray(
 // Objects participating in embedder tracing =================================
 // ===========================================================================
 
-template <typename ConcreteVisitor, typename MarkingState>
+template <typename ConcreteVisitor>
 template <typename T>
-inline int MarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    VisitEmbedderTracingSubClassNoEmbedderTracing(Map map, T object) {
+inline int MarkingVisitorBase<ConcreteVisitor>::
+    VisitEmbedderTracingSubClassNoEmbedderTracing(Tagged<Map> map,
+                                                  Tagged<T> object) {
   return concrete_visitor()->VisitJSObjectSubclass(map, object);
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
+template <typename ConcreteVisitor>
 template <typename T>
-inline int MarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    VisitEmbedderTracingSubClassWithEmbedderTracing(Map map, T object) {
+inline int MarkingVisitorBase<ConcreteVisitor>::
+    VisitEmbedderTracingSubClassWithEmbedderTracing(Tagged<Map> map,
+                                                    Tagged<T> object) {
   const bool requires_snapshot =
       local_marking_worklists_->SupportsExtractWrapper();
   MarkingWorklists::Local::WrapperSnapshot wrapper_snapshot;
@@ -313,41 +477,39 @@ inline int MarkingVisitorBase<ConcreteVisitor, MarkingState>::
   return size;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
+template <typename ConcreteVisitor>
 template <typename T>
-int MarkingVisitorBase<ConcreteVisitor,
-                       MarkingState>::VisitEmbedderTracingSubclass(Map map,
-                                                                   T object) {
-  DCHECK(object.MayHaveEmbedderFields());
+int MarkingVisitorBase<ConcreteVisitor>::VisitEmbedderTracingSubclass(
+    Tagged<Map> map, Tagged<T> object) {
+  DCHECK(object->MayHaveEmbedderFields());
   if (V8_LIKELY(trace_embedder_fields_)) {
     return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
   }
   return VisitEmbedderTracingSubClassNoEmbedderTracing(map, object);
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitJSApiObject(
-    Map map, JSObject object) {
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitJSApiObject(
+    Tagged<Map> map, Tagged<JSObject> object) {
   return VisitEmbedderTracingSubclass(map, object);
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitJSArrayBuffer(
-    Map map, JSArrayBuffer object) {
-  object.MarkExtension();
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitJSArrayBuffer(
+    Tagged<Map> map, Tagged<JSArrayBuffer> object) {
+  object->MarkExtension();
   return VisitEmbedderTracingSubclass(map, object);
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    VisitJSDataViewOrRabGsabDataView(Map map,
-                                     JSDataViewOrRabGsabDataView object) {
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitJSDataViewOrRabGsabDataView(
+    Tagged<Map> map, Tagged<JSDataViewOrRabGsabDataView> object) {
   return VisitEmbedderTracingSubclass(map, object);
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitJSTypedArray(
-    Map map, JSTypedArray object) {
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitJSTypedArray(
+    Tagged<Map> map, Tagged<JSTypedArray> object) {
   return VisitEmbedderTracingSubclass(map, object);
 }
 
@@ -355,107 +517,105 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitJSTypedArray(
 // Weak JavaScript objects ===================================================
 // ===========================================================================
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitEphemeronHashTable(
-    Map map, EphemeronHashTable table) {
-  if (!concrete_visitor()->ShouldVisit(table)) return 0;
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitEphemeronHashTable(
+    Tagged<Map> map, Tagged<EphemeronHashTable> table) {
   local_weak_objects_->ephemeron_hash_tables_local.Push(table);
 
-  for (InternalIndex i : table.IterateEntries()) {
+  for (InternalIndex i : table->IterateEntries()) {
     ObjectSlot key_slot =
-        table.RawFieldOfElementAt(EphemeronHashTable::EntryToIndex(i));
-    HeapObject key = HeapObject::cast(table.KeyAt(i));
+        table->RawFieldOfElementAt(EphemeronHashTable::EntryToIndex(i));
+    Tagged<HeapObject> key = HeapObject::cast(table->KeyAt(i));
 
     SynchronizePageAccess(key);
     concrete_visitor()->RecordSlot(table, key_slot, key);
-    AddWeakReferenceForReferenceSummarizer(table, key);
+    concrete_visitor()->AddWeakReferenceForReferenceSummarizer(table, key);
 
     ObjectSlot value_slot =
-        table.RawFieldOfElementAt(EphemeronHashTable::EntryToValueIndex(i));
+        table->RawFieldOfElementAt(EphemeronHashTable::EntryToValueIndex(i));
 
     // Objects in the shared heap are prohibited from being used as keys in
     // WeakMaps and WeakSets and therefore cannot be ephemeron keys. See also
     // MarkCompactCollector::ProcessEphemeron.
     DCHECK(!key.InWritableSharedSpace());
-    if (key.InReadOnlySpace() ||
-        concrete_visitor()->marking_state()->IsBlackOrGrey(key)) {
+    if (key.InReadOnlySpace() || concrete_visitor()->IsMarked(key)) {
       VisitPointer(table, value_slot);
     } else {
-      Object value_obj = table.ValueAt(i);
+      Tagged<Object> value_obj = table->ValueAt(i);
 
-      if (value_obj.IsHeapObject()) {
-        HeapObject value = HeapObject::cast(value_obj);
+      if (IsHeapObject(value_obj)) {
+        Tagged<HeapObject> value = HeapObject::cast(value_obj);
         SynchronizePageAccess(value);
         concrete_visitor()->RecordSlot(table, value_slot, value);
-        AddWeakReferenceForReferenceSummarizer(table, value);
+        concrete_visitor()->AddWeakReferenceForReferenceSummarizer(table,
+                                                                   value);
 
         if (!ShouldMarkObject(value)) continue;
 
         // Revisit ephemerons with both key and value unreachable at end
         // of concurrent marking cycle.
-        if (concrete_visitor()->marking_state()->IsUnmarked(value)) {
+        if (concrete_visitor()->IsUnmarked(value)) {
           local_weak_objects_->discovered_ephemerons_local.Push(
               Ephemeron{key, value});
         }
       }
     }
   }
-  return table.SizeFromMap(map);
+  return table->SizeFromMap(map);
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitJSWeakRef(
-    Map map, JSWeakRef weak_ref) {
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitJSWeakRef(
+    Tagged<Map> map, Tagged<JSWeakRef> weak_ref) {
   int size = concrete_visitor()->VisitJSObjectSubclass(map, weak_ref);
   if (size == 0) return 0;
-  if (weak_ref.target().IsHeapObject()) {
-    HeapObject target = HeapObject::cast(weak_ref.target());
+  if (IsHeapObject(weak_ref->target())) {
+    Tagged<HeapObject> target = HeapObject::cast(weak_ref->target());
     SynchronizePageAccess(target);
-    if (target.InReadOnlySpace() ||
-        concrete_visitor()->marking_state()->IsBlackOrGrey(target)) {
+    if (target.InReadOnlySpace() || concrete_visitor()->IsMarked(target)) {
       // Record the slot inside the JSWeakRef, since the
       // VisitJSObjectSubclass above didn't visit it.
-      ObjectSlot slot = weak_ref.RawField(JSWeakRef::kTargetOffset);
+      ObjectSlot slot = weak_ref->RawField(JSWeakRef::kTargetOffset);
       concrete_visitor()->RecordSlot(weak_ref, slot, target);
     } else {
       // JSWeakRef points to a potentially dead object. We have to process
       // them when we know the liveness of the whole transitive closure.
       local_weak_objects_->js_weak_refs_local.Push(weak_ref);
-      AddWeakReferenceForReferenceSummarizer(weak_ref, target);
+      concrete_visitor()->AddWeakReferenceForReferenceSummarizer(weak_ref,
+                                                                 target);
     }
   }
   return size;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitWeakCell(
-    Map map, WeakCell weak_cell) {
-  if (!concrete_visitor()->ShouldVisit(weak_cell)) return 0;
-
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitWeakCell(
+    Tagged<Map> map, Tagged<WeakCell> weak_cell) {
   int size = WeakCell::BodyDescriptor::SizeOf(map, weak_cell);
   this->VisitMapPointer(weak_cell);
   WeakCell::BodyDescriptor::IterateBody(map, weak_cell, size, this);
-  HeapObject target = weak_cell.relaxed_target();
-  HeapObject unregister_token = weak_cell.relaxed_unregister_token();
+  Tagged<HeapObject> target = weak_cell->relaxed_target();
+  Tagged<HeapObject> unregister_token = weak_cell->relaxed_unregister_token();
   SynchronizePageAccess(target);
   SynchronizePageAccess(unregister_token);
-  if ((target.InReadOnlySpace() ||
-       concrete_visitor()->marking_state()->IsBlackOrGrey(target)) &&
+  if ((target.InReadOnlySpace() || concrete_visitor()->IsMarked(target)) &&
       (unregister_token.InReadOnlySpace() ||
-       concrete_visitor()->marking_state()->IsBlackOrGrey(unregister_token))) {
+       concrete_visitor()->IsMarked(unregister_token))) {
     // Record the slots inside the WeakCell, since the IterateBody above
     // didn't visit it.
-    ObjectSlot slot = weak_cell.RawField(WeakCell::kTargetOffset);
+    ObjectSlot slot = weak_cell->RawField(WeakCell::kTargetOffset);
     concrete_visitor()->RecordSlot(weak_cell, slot, target);
-    slot = weak_cell.RawField(WeakCell::kUnregisterTokenOffset);
+    slot = weak_cell->RawField(WeakCell::kUnregisterTokenOffset);
     concrete_visitor()->RecordSlot(weak_cell, slot, unregister_token);
   } else {
     // WeakCell points to a potentially dead object or a dead unregister
     // token. We have to process them when we know the liveness of the whole
     // transitive closure.
     local_weak_objects_->weak_cells_local.Push(weak_cell);
-    AddWeakReferenceForReferenceSummarizer(weak_cell, target);
-    AddWeakReferenceForReferenceSummarizer(weak_cell, unregister_token);
+    concrete_visitor()->AddWeakReferenceForReferenceSummarizer(weak_cell,
+                                                               target);
+    concrete_visitor()->AddWeakReferenceForReferenceSummarizer(
+        weak_cell, unregister_token);
   }
   return size;
 }
@@ -464,23 +624,23 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitWeakCell(
 // Custom weakness in descriptor arrays and transition arrays ================
 // ===========================================================================
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    VisitDescriptorArrayStrongly(Map map, DescriptorArray array) {
-  concrete_visitor()->ShouldVisit(array);
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitDescriptorArrayStrongly(
+    Tagged<Map> map, Tagged<DescriptorArray> array) {
   this->VisitMapPointer(array);
   int size = DescriptorArray::BodyDescriptor::SizeOf(map, array);
-  VisitPointers(array, array.GetFirstPointerSlot(), array.GetDescriptorSlot(0));
-  VisitPointers(
-      array, MaybeObjectSlot(array.GetDescriptorSlot(0)),
-      MaybeObjectSlot(array.GetDescriptorSlot(array.number_of_descriptors())));
+  VisitPointers(array, array->GetFirstPointerSlot(),
+                array->GetDescriptorSlot(0));
+  VisitPointers(array, MaybeObjectSlot(array->GetDescriptorSlot(0)),
+                MaybeObjectSlot(
+                    array->GetDescriptorSlot(array->number_of_descriptors())));
   return size;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitDescriptorArray(
-    Map map, DescriptorArray array) {
-  if (!CanUpdateValuesInHeap()) {
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitDescriptorArray(
+    Tagged<Map> map, Tagged<DescriptorArray> array) {
+  if (!concrete_visitor()->CanUpdateValuesInHeap()) {
     // If we cannot update the values in the heap, we just treat the array
     // strongly.
     return VisitDescriptorArrayStrongly(map, array);
@@ -490,31 +650,33 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitDescriptorArray(
   // transition in that the array is re-added to the worklist and thus there's
   // many invocations of this transition. All cases (roots, marking via map,
   // write barrier) are handled here as they all update the state accordingly.
-  concrete_visitor()->marking_state()->GreyToBlack(array);
   const auto [start, end] =
       DescriptorArrayMarkingState::AcquireDescriptorRangeToMark(
           mark_compact_epoch_, array);
   if (start != end) {
     DCHECK_LT(start, end);
-    VisitPointers(array, MaybeObjectSlot(array.GetDescriptorSlot(start)),
-                  MaybeObjectSlot(array.GetDescriptorSlot(end)));
+    VisitPointers(array, MaybeObjectSlot(array->GetDescriptorSlot(start)),
+                  MaybeObjectSlot(array->GetDescriptorSlot(end)));
     if (start == 0) {
       // We are processing the object the first time. Visit the header and
       // return a size for accounting.
       int size = DescriptorArray::BodyDescriptor::SizeOf(map, array);
-      VisitPointers(array, array.GetFirstPointerSlot(),
-                    array.GetDescriptorSlot(0));
-      concrete_visitor()->VisitMapPointerIfNeeded(array);
+      VisitPointers(array, array->GetFirstPointerSlot(),
+                    array->GetDescriptorSlot(0));
+      concrete_visitor()
+          ->template VisitMapPointerIfNeeded<VisitorId::kVisitDescriptorArray>(
+              array);
       return size;
     }
   }
   return 0;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-void MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitDescriptorsForMap(
-    Map map) {
-  if (!CanUpdateValuesInHeap() || !map.CanTransition()) return;
+template <typename ConcreteVisitor>
+void MarkingVisitorBase<ConcreteVisitor>::VisitDescriptorsForMap(
+    Tagged<Map> map) {
+  if (!concrete_visitor()->CanUpdateValuesInHeap() || !map->CanTransition())
+    return;
 
   // Maps that can transition share their descriptor arrays and require
   // special visiting logic to avoid memory leaks.
@@ -523,27 +685,30 @@ void MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitDescriptorsForMap(
   // non-empty descriptor array is marked, its header is also visited. The
   // slot holding the descriptor array will be implicitly recorded when the
   // pointer fields of this map are visited.
-  Object maybe_descriptors =
+  Tagged<Object> maybe_descriptors =
       TaggedField<Object, Map::kInstanceDescriptorsOffset>::Acquire_Load(
           heap_->isolate(), map);
 
   // If the descriptors are a Smi, then this Map is in the process of being
   // deserialized, and doesn't yet have an initialized descriptor field.
-  if (maybe_descriptors.IsSmi()) {
+  if (IsSmi(maybe_descriptors)) {
     DCHECK_EQ(maybe_descriptors, Smi::uninitialized_deserialization_value());
     return;
   }
 
-  DescriptorArray descriptors = DescriptorArray::cast(maybe_descriptors);
+  Tagged<DescriptorArray> descriptors =
+      DescriptorArray::cast(maybe_descriptors);
+  // Synchronize reading of page flags for tsan.
+  SynchronizePageAccess(descriptors);
   // Normal processing of descriptor arrays through the pointers iteration that
   // follows this call:
   // - Array in read only space;
   // - StrongDescriptor array;
-  if (descriptors.InReadOnlySpace() || descriptors.IsStrongDescriptorArray()) {
+  if (descriptors.InReadOnlySpace() || IsStrongDescriptorArray(descriptors)) {
     return;
   }
 
-  const int number_of_own_descriptors = map.NumberOfOwnDescriptors();
+  const int number_of_own_descriptors = map->NumberOfOwnDescriptors();
   if (number_of_own_descriptors) {
     // It is possible that the concurrent marker observes the
     // number_of_own_descriptors out of sync with the descriptors. In that
@@ -552,8 +717,8 @@ void MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitDescriptorsForMap(
     // just should avoid crashing in that case. That's why we need the
     // std::min<int>() below.
     const auto descriptors_to_mark = std::min<int>(
-        number_of_own_descriptors, descriptors.number_of_descriptors());
-    concrete_visitor()->marking_state()->TryMark(descriptors);
+        number_of_own_descriptors, descriptors->number_of_descriptors());
+    concrete_visitor()->TryMark(descriptors);
     if (DescriptorArrayMarkingState::TryUpdateIndicesToMark(
             mark_compact_epoch_, descriptors, descriptors_to_mark)) {
       local_marking_worklists_->Push(descriptors);
@@ -561,10 +726,9 @@ void MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitDescriptorsForMap(
   }
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitMap(Map meta_map,
-                                                                Map map) {
-  if (!concrete_visitor()->ShouldVisit(map)) return 0;
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitMap(Tagged<Map> meta_map,
+                                                  Tagged<Map> map) {
   int size = Map::BodyDescriptor::SizeOf(meta_map, map);
   VisitDescriptorsForMap(map);
 
@@ -575,10 +739,9 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitMap(Map meta_map,
   return size;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitTransitionArray(
-    Map map, TransitionArray array) {
-  if (!concrete_visitor()->ShouldVisit(array)) return 0;
+template <typename ConcreteVisitor>
+int MarkingVisitorBase<ConcreteVisitor>::VisitTransitionArray(
+    Tagged<Map> map, Tagged<TransitionArray> array) {
   this->VisitMapPointer(array);
   int size = TransitionArray::BodyDescriptor::SizeOf(map, array);
   TransitionArray::BodyDescriptor::IterateBody(map, array, size, this);
@@ -586,123 +749,6 @@ int MarkingVisitorBase<ConcreteVisitor, MarkingState>::VisitTransitionArray(
   return size;
 }
 
-template <typename ConcreteVisitor, typename MarkingState>
-YoungGenerationMarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    YoungGenerationMarkingVisitorBase(Isolate* isolate,
-                                      MarkingWorklists::Local* worklists_local)
-    : NewSpaceVisitor<ConcreteVisitor>(isolate),
-      worklists_local_(worklists_local),
-      pretenuring_handler_(isolate->heap()->pretenuring_handler()),
-      local_pretenuring_feedback_(
-          PretenuringHandler::kInitialFeedbackCapacity) {}
-
-template <typename ConcreteVisitor, typename MarkingState>
-template <typename T>
-int YoungGenerationMarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    VisitEmbedderTracingSubClassWithEmbedderTracing(Map map, T object) {
-  const int size = concrete_visitor()->VisitJSObjectSubclass(map, object);
-  if (!worklists_local_->SupportsExtractWrapper()) return size;
-  MarkingWorklists::Local::WrapperSnapshot wrapper_snapshot;
-  const bool valid_snapshot =
-      worklists_local_->ExtractWrapper(map, object, wrapper_snapshot);
-  if (size && valid_snapshot) {
-    // Success: The object needs to be processed for embedder references.
-    worklists_local_->PushExtractedWrapper(wrapper_snapshot);
-  }
-  return size;
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-int YoungGenerationMarkingVisitorBase<
-    ConcreteVisitor, MarkingState>::VisitJSArrayBuffer(Map map,
-                                                       JSArrayBuffer object) {
-  object.YoungMarkExtension();
-  return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-int YoungGenerationMarkingVisitorBase<
-    ConcreteVisitor, MarkingState>::VisitJSApiObject(Map map, JSObject object) {
-  return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-int YoungGenerationMarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    VisitJSDataViewOrRabGsabDataView(Map map,
-                                     JSDataViewOrRabGsabDataView object) {
-  return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-int YoungGenerationMarkingVisitorBase<
-    ConcreteVisitor, MarkingState>::VisitJSTypedArray(Map map,
-                                                      JSTypedArray object) {
-  return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-int YoungGenerationMarkingVisitorBase<
-    ConcreteVisitor, MarkingState>::VisitJSObject(Map map, JSObject object) {
-  int result = NewSpaceVisitor<ConcreteVisitor>::VisitJSObject(map, object);
-  DCHECK_LT(0, result);
-  pretenuring_handler_->UpdateAllocationSite(map, object,
-                                             &local_pretenuring_feedback_);
-  return result;
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-int YoungGenerationMarkingVisitorBase<
-    ConcreteVisitor, MarkingState>::VisitJSObjectFast(Map map,
-                                                      JSObject object) {
-  int result = NewSpaceVisitor<ConcreteVisitor>::VisitJSObjectFast(map, object);
-  DCHECK_LT(0, result);
-  pretenuring_handler_->UpdateAllocationSite(map, object,
-                                             &local_pretenuring_feedback_);
-  return result;
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-template <typename T, typename TBodyDescriptor>
-int YoungGenerationMarkingVisitorBase<
-    ConcreteVisitor, MarkingState>::VisitJSObjectSubclass(Map map, T object) {
-  int result = NewSpaceVisitor<ConcreteVisitor>::template VisitJSObjectSubclass<
-      T, TBodyDescriptor>(map, object);
-  DCHECK_LT(0, result);
-  pretenuring_handler_->UpdateAllocationSite(map, object,
-                                             &local_pretenuring_feedback_);
-  return result;
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-void YoungGenerationMarkingVisitorBase<ConcreteVisitor,
-                                       MarkingState>::Finalize() {
-  pretenuring_handler_->MergeAllocationSitePretenuringFeedback(
-      local_pretenuring_feedback_);
-  local_pretenuring_feedback_.clear();
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-void YoungGenerationMarkingVisitorBase<ConcreteVisitor, MarkingState>::
-    MarkObjectViaMarkingWorklist(HeapObject object) {
-  if (concrete_visitor()->marking_state()->TryMark(object)) {
-    worklists_local_->Push(object);
-  }
-}
-
-template <typename ConcreteVisitor, typename MarkingState>
-template <typename TSlot>
-void YoungGenerationMarkingVisitorBase<
-    ConcreteVisitor, MarkingState>::VisitPointerImpl(HeapObject host,
-                                                     TSlot slot) {
-  typename TSlot::TObject target =
-      slot.Relaxed_Load(ObjectVisitorWithCageBases::cage_base());
-  if (Heap::InYoungGeneration(target)) {
-    // Treat weak references as strong.
-    HeapObject target_object = target.GetHeapObject();
-    MarkObjectViaMarkingWorklist(target_object);
-  }
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/marking-visitor.h b/deps/v8/src/heap/marking-visitor.h
index f2c069e5a61d29..7cead5f2830f04 100644
--- a/deps/v8/src/heap/marking-visitor.h
+++ b/deps/v8/src/heap/marking-visitor.h
@@ -7,6 +7,7 @@
 
 #include "src/common/globals.h"
 #include "src/execution/isolate.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/marking-state.h"
 #include "src/heap/marking-worklist.h"
 #include "src/heap/objects-visiting.h"
@@ -24,27 +25,36 @@ struct EphemeronMarking {
   size_t newly_discovered_limit;
 };
 
-// The base class for all marking visitors. It implements marking logic with
-// support of bytecode flushing, embedder tracing, weak and references.
+// The base class for all marking visitors (main and concurrent marking) but
+// also for e.g. the reference summarizer. It implements marking logic with
+// support for bytecode flushing, embedder tracing and weak references.
 //
-// Derived classes are expected to provide the following:
-// - ConcreteVisitor::marking_state method,
-// - ConcreteVisitor::retaining_path_mode method,
-// - ConcreteVisitor::RecordSlot method,
-// - ConcreteVisitor::RecordRelocSlot method,
-// These methods capture the difference between the concurrent and main thread
-// marking visitors. For example, the concurrent visitor has to use the
-// snapshotting protocol to visit JSObject and left-trimmable FixedArrays.
-template <typename ConcreteVisitor, typename MarkingState>
-class MarkingVisitorBase : public HeapVisitor<int, ConcreteVisitor> {
+// Derived classes are expected to provide the following methods:
+// - CanUpdateValuesInHeap
+// - AddStrongReferenceForReferenceSummarizer
+// - AddWeakReferenceForReferenceSummarizer
+// - TryMark
+// - IsMarked
+// - retaining_path_mode
+// - RecordSlot
+// - RecordRelocSlot
+//
+// These methods capture the difference between the different visitor
+// implementations. For example, the concurrent visitor has to use the locking
+// for string types that can be transitioned to other types on the main thread
+// concurrently. On the other hand, the reference summarizer is not supposed to
+// write into heap objects.
+template <typename ConcreteVisitor>
+class MarkingVisitorBase : public ConcurrentHeapVisitor<int, ConcreteVisitor> {
  public:
   MarkingVisitorBase(MarkingWorklists::Local* local_marking_worklists,
                      WeakObjects::Local* local_weak_objects, Heap* heap,
                      unsigned mark_compact_epoch,
                      base::EnumSet<CodeFlushMode> code_flush_mode,
                      bool trace_embedder_fields,
-                     bool should_keep_ages_unchanged)
-      : HeapVisitor<int, ConcreteVisitor>(heap),
+                     bool should_keep_ages_unchanged,
+                     uint16_t code_flushing_increase)
+      : ConcurrentHeapVisitor<int, ConcreteVisitor>(heap->isolate()),
         local_marking_worklists_(local_marking_worklists),
         local_weak_objects_(local_weak_objects),
         heap_(heap),
@@ -52,66 +62,89 @@ class MarkingVisitorBase : public HeapVisitor<int, ConcreteVisitor> {
         code_flush_mode_(code_flush_mode),
         trace_embedder_fields_(trace_embedder_fields),
         should_keep_ages_unchanged_(should_keep_ages_unchanged),
-        should_mark_shared_heap_(heap->isolate()->is_shared_space_isolate())
+        should_mark_shared_heap_(heap->isolate()->is_shared_space_isolate()),
+        code_flushing_increase_(code_flushing_increase),
+        isolate_in_background_(heap->isolate()->IsIsolateInBackground())
 #ifdef V8_ENABLE_SANDBOX
         ,
         external_pointer_table_(&heap->isolate()->external_pointer_table()),
         shared_external_pointer_table_(
-            &heap->isolate()->shared_external_pointer_table())
+            &heap->isolate()->shared_external_pointer_table()),
+        shared_external_pointer_space_(
+            heap->isolate()->shared_external_pointer_space())
 #endif  // V8_ENABLE_SANDBOX
   {
   }
 
-  V8_INLINE int VisitBytecodeArray(Map map, BytecodeArray object);
-  V8_INLINE int VisitDescriptorArrayStrongly(Map map, DescriptorArray object);
-  V8_INLINE int VisitDescriptorArray(Map map, DescriptorArray object);
-  V8_INLINE int VisitEphemeronHashTable(Map map, EphemeronHashTable object);
-  V8_INLINE int VisitFixedArray(Map map, FixedArray object);
-  V8_INLINE int VisitJSApiObject(Map map, JSObject object);
-  V8_INLINE int VisitJSArrayBuffer(Map map, JSArrayBuffer object);
+  V8_INLINE int VisitBytecodeArray(Tagged<Map> map,
+                                   Tagged<BytecodeArray> object);
+  V8_INLINE int VisitDescriptorArrayStrongly(Tagged<Map> map,
+                                             Tagged<DescriptorArray> object);
+  V8_INLINE int VisitDescriptorArray(Tagged<Map> map,
+                                     Tagged<DescriptorArray> object);
+  V8_INLINE int VisitEphemeronHashTable(Tagged<Map> map,
+                                        Tagged<EphemeronHashTable> object);
+  V8_INLINE int VisitFixedArray(Tagged<Map> map, Tagged<FixedArray> object);
+  V8_INLINE int VisitJSApiObject(Tagged<Map> map, Tagged<JSObject> object);
+  V8_INLINE int VisitJSArrayBuffer(Tagged<Map> map,
+                                   Tagged<JSArrayBuffer> object);
   V8_INLINE int VisitJSDataViewOrRabGsabDataView(
-      Map map, JSDataViewOrRabGsabDataView object);
-  V8_INLINE int VisitJSFunction(Map map, JSFunction object);
-  V8_INLINE int VisitJSTypedArray(Map map, JSTypedArray object);
-  V8_INLINE int VisitJSWeakRef(Map map, JSWeakRef object);
-  V8_INLINE int VisitMap(Map map, Map object);
-  V8_INLINE int VisitSharedFunctionInfo(Map map, SharedFunctionInfo object);
-  V8_INLINE int VisitTransitionArray(Map map, TransitionArray object);
-  V8_INLINE int VisitWeakCell(Map map, WeakCell object);
+      Tagged<Map> map, Tagged<JSDataViewOrRabGsabDataView> object);
+  V8_INLINE int VisitJSFunction(Tagged<Map> map, Tagged<JSFunction> object);
+  V8_INLINE int VisitJSTypedArray(Tagged<Map> map, Tagged<JSTypedArray> object);
+  V8_INLINE int VisitJSWeakRef(Tagged<Map> map, Tagged<JSWeakRef> object);
+  V8_INLINE int VisitMap(Tagged<Map> map, Tagged<Map> object);
+  V8_INLINE int VisitSharedFunctionInfo(Tagged<Map> map,
+                                        Tagged<SharedFunctionInfo> object);
+  V8_INLINE int VisitTransitionArray(Tagged<Map> map,
+                                     Tagged<TransitionArray> object);
+  V8_INLINE int VisitWeakCell(Tagged<Map> map, Tagged<WeakCell> object);
 
   // ObjectVisitor overrides.
-  void VisitMapPointer(HeapObject host) final {
-    Map map = host.map(ObjectVisitorWithCageBases::cage_base());
-    ProcessStrongHeapObject(host, host.map_slot(), map);
+  void VisitMapPointer(Tagged<HeapObject> host) final {
+    Tagged<Map> map = host->map(ObjectVisitorWithCageBases::cage_base());
+    ProcessStrongHeapObject(host, host->map_slot(), map);
   }
-  V8_INLINE void VisitPointer(HeapObject host, ObjectSlot p) final {
+  V8_INLINE void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) final {
     VisitPointersImpl(host, p, p + 1);
   }
-  V8_INLINE void VisitPointer(HeapObject host, MaybeObjectSlot p) final {
+  V8_INLINE void VisitPointer(Tagged<HeapObject> host,
+                              MaybeObjectSlot p) final {
     VisitPointersImpl(host, p, p + 1);
   }
-  V8_INLINE void VisitPointers(HeapObject host, ObjectSlot start,
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                                ObjectSlot end) final {
     VisitPointersImpl(host, start, end);
   }
-  V8_INLINE void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                                MaybeObjectSlot end) final {
     VisitPointersImpl(host, start, end);
   }
-  V8_INLINE void VisitCodePointer(Code host, CodeObjectSlot slot) final {
-    VisitCodePointerImpl(host, slot);
+  V8_INLINE void VisitInstructionStreamPointer(
+      Tagged<Code> host, InstructionStreamSlot slot) final {
+    VisitInstructionStreamPointerImpl(host, slot);
   }
-  V8_INLINE void VisitEmbeddedPointer(RelocInfo* rinfo) final;
-  V8_INLINE void VisitCodeTarget(RelocInfo* rinfo) final;
-  void VisitCustomWeakPointers(HeapObject host, ObjectSlot start,
+  V8_INLINE void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                                      RelocInfo* rinfo) final;
+  V8_INLINE void VisitCodeTarget(Tagged<InstructionStream> host,
+                                 RelocInfo* rinfo) final;
+  void VisitCustomWeakPointers(Tagged<HeapObject> host, ObjectSlot start,
                                ObjectSlot end) final {
     // Weak list pointers should be ignored during marking. The lists are
     // reconstructed after GC.
   }
 
-  V8_INLINE void VisitExternalPointer(HeapObject host, ExternalPointerSlot slot,
+  V8_INLINE void VisitExternalPointer(Tagged<HeapObject> host,
+                                      ExternalPointerSlot slot,
                                       ExternalPointerTag tag) final;
-  void SynchronizePageAccess(HeapObject heap_object) {
+  V8_INLINE void VisitIndirectPointer(Tagged<HeapObject> host,
+                                      IndirectPointerSlot slot,
+                                      IndirectPointerMode mode) final;
+
+  void VisitIndirectPointerTableEntry(Tagged<HeapObject> host,
+                                      IndirectPointerSlot slot) final;
+
+  void SynchronizePageAccess(Tagged<HeapObject> heap_object) {
 #ifdef THREAD_SANITIZER
     // This is needed because TSAN does not process the memory fence
     // emitted after page initialization.
@@ -119,65 +152,70 @@ class MarkingVisitorBase : public HeapVisitor<int, ConcreteVisitor> {
 #endif
   }
 
-  bool ShouldMarkObject(HeapObject object) const {
+  bool ShouldMarkObject(Tagged<HeapObject> object) const {
     if (object.InReadOnlySpace()) return false;
     if (should_mark_shared_heap_) return true;
     return !object.InAnySharedSpace();
   }
 
   // Marks the object grey and pushes it on the marking work list.
-  V8_INLINE void MarkObject(HeapObject host, HeapObject obj);
+  V8_INLINE void MarkObject(Tagged<HeapObject> host, Tagged<HeapObject> obj);
 
- protected:
-  ConcreteVisitor* concrete_visitor() {
-    return static_cast<ConcreteVisitor*>(this);
+  V8_INLINE static constexpr bool ShouldVisitReadOnlyMapPointer() {
+    return false;
+  }
+
+  // Convenience method.
+  bool IsUnmarked(Tagged<HeapObject> obj) const {
+    return !concrete_visitor()->IsMarked(obj);
   }
+
+ protected:
+  using ConcurrentHeapVisitor<int, ConcreteVisitor>::concrete_visitor;
+
   template <typename THeapObjectSlot>
-  void ProcessStrongHeapObject(HeapObject host, THeapObjectSlot slot,
-                               HeapObject heap_object);
+  void ProcessStrongHeapObject(Tagged<HeapObject> host, THeapObjectSlot slot,
+                               Tagged<HeapObject> heap_object);
   template <typename THeapObjectSlot>
-  void ProcessWeakHeapObject(HeapObject host, THeapObjectSlot slot,
-                             HeapObject heap_object);
+  void ProcessWeakHeapObject(Tagged<HeapObject> host, THeapObjectSlot slot,
+                             Tagged<HeapObject> heap_object);
 
   template <typename TSlot>
-  V8_INLINE void VisitPointerImpl(HeapObject host, TSlot p);
+  V8_INLINE void VisitPointerImpl(Tagged<HeapObject> host, TSlot p);
 
   template <typename TSlot>
-  V8_INLINE void VisitPointersImpl(HeapObject host, TSlot start, TSlot end);
+  V8_INLINE void VisitPointersImpl(Tagged<HeapObject> host, TSlot start,
+                                   TSlot end);
 
   // Similar to VisitPointersImpl() but using code cage base for loading from
   // the slot.
-  V8_INLINE void VisitCodePointerImpl(Code host, CodeObjectSlot slot);
+  V8_INLINE void VisitInstructionStreamPointerImpl(Tagged<Code> host,
+                                                   InstructionStreamSlot slot);
 
-  V8_INLINE void VisitDescriptorsForMap(Map map);
+  V8_INLINE void VisitDescriptorsForMap(Tagged<Map> map);
 
   template <typename T>
-  int VisitEmbedderTracingSubclass(Map map, T object);
+  int VisitEmbedderTracingSubclass(Tagged<Map> map, Tagged<T> object);
   template <typename T>
-  int VisitEmbedderTracingSubClassWithEmbedderTracing(Map map, T object);
+  int VisitEmbedderTracingSubClassWithEmbedderTracing(Tagged<Map> map,
+                                                      Tagged<T> object);
   template <typename T>
-  int VisitEmbedderTracingSubClassNoEmbedderTracing(Map map, T object);
+  int VisitEmbedderTracingSubClassNoEmbedderTracing(Tagged<Map> map,
+                                                    Tagged<T> object);
 
-  V8_INLINE int VisitFixedArrayWithProgressBar(Map map, FixedArray object,
+  V8_INLINE int VisitFixedArrayWithProgressBar(Tagged<Map> map,
+                                               Tagged<FixedArray> object,
                                                ProgressBar& progress_bar);
-  V8_INLINE int VisitFixedArrayRegularly(Map map, FixedArray object);
+  V8_INLINE int VisitFixedArrayRegularly(Tagged<Map> map,
+                                         Tagged<FixedArray> object);
 
-  V8_INLINE void AddStrongReferenceForReferenceSummarizer(HeapObject host,
-                                                          HeapObject obj) {
-    concrete_visitor()
-        ->marking_state()
-        ->AddStrongReferenceForReferenceSummarizer(host, obj);
-  }
-
-  V8_INLINE void AddWeakReferenceForReferenceSummarizer(HeapObject host,
-                                                        HeapObject obj) {
-    concrete_visitor()->marking_state()->AddWeakReferenceForReferenceSummarizer(
-        host, obj);
-  }
+  // Methods needed for supporting code flushing.
+  bool ShouldFlushCode(Tagged<SharedFunctionInfo> sfi) const;
+  bool ShouldFlushBaselineCode(Tagged<JSFunction> js_function) const;
 
-  constexpr bool CanUpdateValuesInHeap() {
-    return !MarkingState::kCollectRetainers;
-  }
+  bool HasBytecodeArrayForFlushing(Tagged<SharedFunctionInfo> sfi) const;
+  bool IsOld(Tagged<SharedFunctionInfo> sfi) const;
+  void MakeOlder(Tagged<SharedFunctionInfo> sfi) const;
 
   MarkingWorklists::Local* const local_marking_worklists_;
   WeakObjects::Local* const local_weak_objects_;
@@ -187,96 +225,47 @@ class MarkingVisitorBase : public HeapVisitor<int, ConcreteVisitor> {
   const bool trace_embedder_fields_;
   const bool should_keep_ages_unchanged_;
   const bool should_mark_shared_heap_;
+  const uint16_t code_flushing_increase_;
+  const bool isolate_in_background_;
 #ifdef V8_ENABLE_SANDBOX
   ExternalPointerTable* const external_pointer_table_;
   ExternalPointerTable* const shared_external_pointer_table_;
+  ExternalPointerTable::Space* const shared_external_pointer_space_;
 #endif  // V8_ENABLE_SANDBOX
 };
 
-template <typename ConcreteVisitor, typename MarkingState>
-class YoungGenerationMarkingVisitorBase
-    : public NewSpaceVisitor<ConcreteVisitor> {
+// This is the common base class for main and concurrent full marking visitors.
+// Derived class are expected to provide the same methods as for
+// MarkingVisitorBase except for those defined in this class.
+template <typename ConcreteVisitor>
+class FullMarkingVisitorBase : public MarkingVisitorBase<ConcreteVisitor> {
  public:
-  YoungGenerationMarkingVisitorBase(Isolate* isolate,
-                                    MarkingWorklists::Local* worklists_local);
-
-  ~YoungGenerationMarkingVisitorBase() override {
-    DCHECK(local_pretenuring_feedback_.empty());
-  }
-
-  V8_INLINE void VisitPointers(HeapObject host, ObjectSlot start,
-                               ObjectSlot end) final {
-    VisitPointersImpl(host, start, end);
+  FullMarkingVisitorBase(MarkingWorklists::Local* local_marking_worklists,
+                         WeakObjects::Local* local_weak_objects, Heap* heap,
+                         unsigned mark_compact_epoch,
+                         base::EnumSet<CodeFlushMode> code_flush_mode,
+                         bool trace_embedder_fields,
+                         bool should_keep_ages_unchanged,
+                         uint16_t code_flushing_increase)
+      : MarkingVisitorBase<ConcreteVisitor>(
+            local_marking_worklists, local_weak_objects, heap,
+            mark_compact_epoch, code_flush_mode, trace_embedder_fields,
+            should_keep_ages_unchanged, code_flushing_increase) {}
+
+  V8_INLINE void AddStrongReferenceForReferenceSummarizer(
+      Tagged<HeapObject> host, Tagged<HeapObject> obj) {}
+
+  V8_INLINE void AddWeakReferenceForReferenceSummarizer(
+      Tagged<HeapObject> host, Tagged<HeapObject> obj) {}
+
+  constexpr bool CanUpdateValuesInHeap() { return true; }
+
+  bool TryMark(Tagged<HeapObject> obj) {
+    return MarkBit::From(obj).Set<AccessMode::ATOMIC>();
   }
-
-  V8_INLINE void VisitPointers(HeapObject host, MaybeObjectSlot start,
-                               MaybeObjectSlot end) final {
-    VisitPointersImpl(host, start, end);
+  bool IsMarked(Tagged<HeapObject> obj) const {
+    return MarkBit::From(obj).Get<AccessMode::ATOMIC>();
   }
-
-  V8_INLINE void VisitCodePointer(Code host, CodeObjectSlot slot) override {
-    CHECK(V8_EXTERNAL_CODE_SPACE_BOOL);
-    // InstructionStream slots never appear in new space because
-    // Code objects, the only object that can contain code pointers, are
-    // always allocated in the old space.
-    UNREACHABLE();
-  }
-
-  V8_INLINE void VisitPointer(HeapObject host, ObjectSlot slot) final {
-    VisitPointerImpl(host, slot);
-  }
-
-  V8_INLINE void VisitPointer(HeapObject host, MaybeObjectSlot slot) final {
-    VisitPointerImpl(host, slot);
-  }
-
-  V8_INLINE void VisitCodeTarget(RelocInfo* rinfo) final {
-    // Code objects are not expected in new space.
-    UNREACHABLE();
-  }
-
-  V8_INLINE void VisitEmbeddedPointer(RelocInfo* rinfo) final {
-    // Code objects are not expected in new space.
-    UNREACHABLE();
-  }
-
-  V8_INLINE int VisitJSApiObject(Map map, JSObject object);
-  V8_INLINE int VisitJSArrayBuffer(Map map, JSArrayBuffer object);
-  V8_INLINE int VisitJSDataViewOrRabGsabDataView(
-      Map map, JSDataViewOrRabGsabDataView object);
-  V8_INLINE int VisitJSTypedArray(Map map, JSTypedArray object);
-
-  V8_INLINE int VisitJSObject(Map map, JSObject object);
-  V8_INLINE int VisitJSObjectFast(Map map, JSObject object);
-  template <typename T, typename TBodyDescriptor = typename T::BodyDescriptor>
-  V8_INLINE int VisitJSObjectSubclass(Map map, T object);
-
-  V8_INLINE void Finalize();
-
- protected:
-  ConcreteVisitor* concrete_visitor() {
-    return static_cast<ConcreteVisitor*>(this);
-  }
-
-  template <typename T>
-  int VisitEmbedderTracingSubClassWithEmbedderTracing(Map map, T object);
-
-  inline void MarkObjectViaMarkingWorklist(HeapObject object);
-
- private:
-  template <typename TSlot>
-  V8_INLINE void VisitPointersImpl(HeapObject host, TSlot start, TSlot end) {
-    for (TSlot slot = start; slot < end; ++slot) {
-      VisitPointer(host, slot);
-    }
-  }
-
-  template <typename TSlot>
-  void VisitPointerImpl(HeapObject host, TSlot slot);
-
-  MarkingWorklists::Local* worklists_local_;
-  PretenuringHandler* const pretenuring_handler_;
-  PretenuringHandler::PretenuringFeedbackMap local_pretenuring_feedback_;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/marking-worklist-inl.h b/deps/v8/src/heap/marking-worklist-inl.h
index b34f83ec500251..b8093d6d3711f1 100644
--- a/deps/v8/src/heap/marking-worklist-inl.h
+++ b/deps/v8/src/heap/marking-worklist-inl.h
@@ -24,9 +24,11 @@ void MarkingWorklists::Update(Callback callback) {
   }
 }
 
-void MarkingWorklists::Local::Push(HeapObject object) { active_->Push(object); }
+void MarkingWorklists::Local::Push(Tagged<HeapObject> object) {
+  active_->Push(object);
+}
 
-bool MarkingWorklists::Local::Pop(HeapObject* object) {
+bool MarkingWorklists::Local::Pop(Tagged<HeapObject>* object) {
   if (active_->Pop(object)) return true;
   if (!is_per_context_mode_) return false;
   // The active worklist is empty. Find any other non-empty worklist and
@@ -34,11 +36,11 @@ bool MarkingWorklists::Local::Pop(HeapObject* object) {
   return PopContext(object);
 }
 
-void MarkingWorklists::Local::PushOnHold(HeapObject object) {
+void MarkingWorklists::Local::PushOnHold(Tagged<HeapObject> object) {
   on_hold_.Push(object);
 }
 
-bool MarkingWorklists::Local::PopOnHold(HeapObject* object) {
+bool MarkingWorklists::Local::PopOnHold(Tagged<HeapObject>* object) {
   return on_hold_.Pop(object);
 }
 
@@ -46,7 +48,8 @@ bool MarkingWorklists::Local::SupportsExtractWrapper() {
   return cpp_marking_state_.get();
 }
 
-bool MarkingWorklists::Local::ExtractWrapper(Map map, JSObject object,
+bool MarkingWorklists::Local::ExtractWrapper(Tagged<Map> map,
+                                             Tagged<JSObject> object,
                                              WrapperSnapshot& snapshot) {
   DCHECK_NOT_NULL(cpp_marking_state_);
   return cpp_marking_state_->ExtractEmbedderDataSnapshot(map, object, snapshot);
diff --git a/deps/v8/src/heap/marking-worklist.cc b/deps/v8/src/heap/marking-worklist.cc
index a035155b4a5cb6..aa0208e7f0a750 100644
--- a/deps/v8/src/heap/marking-worklist.cc
+++ b/deps/v8/src/heap/marking-worklist.cc
@@ -55,9 +55,9 @@ void MarkingWorklists::PrintWorklist(const char* worklist_name,
 #ifdef DEBUG
   std::map<InstanceType, int> count;
   int total_count = 0;
-  worklist->Iterate([&count, &total_count](HeapObject obj) {
+  worklist->Iterate([&count, &total_count](Tagged<HeapObject> obj) {
     ++total_count;
-    count[obj.map().instance_type()]++;
+    count[obj->map()->instance_type()]++;
   });
   std::vector<std::pair<int, InstanceType>> rank;
   rank.reserve(count.size());
@@ -164,9 +164,14 @@ void MarkingWorklists::Local::ShareWork() {
   }
 }
 
+void MarkingWorklists::Local::PublishWork() {
+  DCHECK(!is_per_context_mode_);
+  shared_.Publish();
+}
+
 void MarkingWorklists::Local::MergeOnHold() { shared_.Merge(on_hold_); }
 
-bool MarkingWorklists::Local::PopContext(HeapObject* object) {
+bool MarkingWorklists::Local::PopContext(Tagged<HeapObject>* object) {
   DCHECK(is_per_context_mode_);
   // As an optimization we first check only the local segments to avoid locks.
   for (auto& cw : worklist_by_context_) {
diff --git a/deps/v8/src/heap/marking-worklist.h b/deps/v8/src/heap/marking-worklist.h
index 9a37372c21b44b..d550de2e4fe28a 100644
--- a/deps/v8/src/heap/marking-worklist.h
+++ b/deps/v8/src/heap/marking-worklist.h
@@ -24,7 +24,7 @@ class JSObject;
 // The index of the main thread task used by concurrent/parallel GC.
 const int kMainThreadTask = 0;
 
-using MarkingWorklist = ::heap::base::Worklist<HeapObject, 64>;
+using MarkingWorklist = ::heap::base::Worklist<Tagged<HeapObject>, 64>;
 
 // We piggyback on marking to compute object sizes per native context that is
 // needed for the new memory measurement API. The algorithm works as follows:
@@ -102,6 +102,7 @@ class V8_EXPORT_PRIVATE MarkingWorklists final {
   // This should be invoked at the end of marking. All worklists must be
   // empty at that point.
   void ReleaseContextWorklists();
+  bool IsUsingContextWorklists() const { return !context_worklists_.empty(); }
 
   void Clear();
   void Print();
@@ -148,14 +149,14 @@ class V8_EXPORT_PRIVATE MarkingWorklists::Local final {
   // Local worklists implicitly check for emptiness on destruction.
   ~Local() = default;
 
-  inline void Push(HeapObject object);
-  inline bool Pop(HeapObject* object);
+  inline void Push(Tagged<HeapObject> object);
+  inline bool Pop(Tagged<HeapObject>* object);
 
-  inline void PushOnHold(HeapObject object);
-  inline bool PopOnHold(HeapObject* object);
+  inline void PushOnHold(Tagged<HeapObject> object);
+  inline bool PopOnHold(Tagged<HeapObject>* object);
 
   using WrapperSnapshot = CppMarkingState::EmbedderDataSnapshot;
-  inline bool ExtractWrapper(Map map, JSObject object,
+  inline bool ExtractWrapper(Tagged<Map> map, Tagged<JSObject> object,
                              WrapperSnapshot& snapshot);
   inline void PushExtractedWrapper(const WrapperSnapshot& snapshot);
   inline bool SupportsExtractWrapper();
@@ -167,6 +168,9 @@ class V8_EXPORT_PRIVATE MarkingWorklists::Local final {
   // empty. In the per-context marking mode it also publishes the shared
   // worklist.
   void ShareWork();
+  // Publishes the local active marking worklist. Assume per-context marking
+  // mode is not used.
+  void PublishWork();
   // Merges the on-hold worklist to the shared worklist.
   void MergeOnHold();
 
@@ -189,7 +193,7 @@ class V8_EXPORT_PRIVATE MarkingWorklists::Local final {
   inline void SwitchToContextImpl(Address context,
                                   MarkingWorklist::Local* worklist);
 
-  bool PopContext(HeapObject* object);
+  bool PopContext(Tagged<HeapObject>* object);
   Address SwitchToContextSlow(Address context);
 
   // Points to either `shared_`, `other_` or to a per-context worklist.
diff --git a/deps/v8/src/heap/marking.cc b/deps/v8/src/heap/marking.cc
index af76bbb12eceaf..87a566bc095325 100644
--- a/deps/v8/src/heap/marking.cc
+++ b/deps/v8/src/heap/marking.cc
@@ -2,24 +2,25 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include "src/heap/marking.h"
+#include "src/heap/marking-inl.h"
 
 namespace v8 {
 namespace internal {
 
-const size_t Bitmap::kSize = Bitmap::CellsCount() * Bitmap::kBytesPerCell;
+namespace {
+constexpr MarkBit::CellType kAllBitsSetInCellValue =
+    std::numeric_limits<MarkBit::CellType>::max();
+}
 
-template <>
-bool ConcurrentBitmap<AccessMode::NON_ATOMIC>::AllBitsSetInRange(
-    uint32_t start_index, uint32_t end_index) {
+bool MarkingBitmap::AllBitsSetInRange(MarkBitIndex start_index,
+                                      MarkBitIndex end_index) const {
   if (start_index >= end_index) return false;
   end_index--;
 
-  unsigned int start_cell_index = start_index >> Bitmap::kBitsPerCellLog2;
-  MarkBit::CellType start_index_mask = 1u << Bitmap::IndexInCell(start_index);
-
-  unsigned int end_cell_index = end_index >> Bitmap::kBitsPerCellLog2;
-  MarkBit::CellType end_index_mask = 1u << Bitmap::IndexInCell(end_index);
+  const CellIndex start_cell_index = IndexToCell(start_index);
+  MarkBit::CellType start_index_mask = IndexInCellMask(start_index);
+  const CellIndex end_cell_index = IndexToCell(end_index);
+  MarkBit::CellType end_index_mask = IndexInCellMask(end_index);
 
   MarkBit::CellType matching_mask;
   if (start_cell_index != end_cell_index) {
@@ -28,7 +29,7 @@ bool ConcurrentBitmap<AccessMode::NON_ATOMIC>::AllBitsSetInRange(
       return false;
     }
     for (unsigned int i = start_cell_index + 1; i < end_cell_index; i++) {
-      if (cells()[i] != ~0u) return false;
+      if (cells()[i] != kAllBitsSetInCellValue) return false;
     }
     matching_mask = end_index_mask | (end_index_mask - 1);
     return ((cells()[end_cell_index] & matching_mask) == matching_mask);
@@ -38,23 +39,21 @@ bool ConcurrentBitmap<AccessMode::NON_ATOMIC>::AllBitsSetInRange(
   }
 }
 
-template <>
-bool ConcurrentBitmap<AccessMode::NON_ATOMIC>::AllBitsClearInRange(
-    uint32_t start_index, uint32_t end_index) {
+bool MarkingBitmap::AllBitsClearInRange(MarkBitIndex start_index,
+                                        MarkBitIndex end_index) const {
   if (start_index >= end_index) return true;
   end_index--;
 
-  unsigned int start_cell_index = start_index >> Bitmap::kBitsPerCellLog2;
-  MarkBit::CellType start_index_mask = 1u << Bitmap::IndexInCell(start_index);
-
-  unsigned int end_cell_index = end_index >> Bitmap::kBitsPerCellLog2;
-  MarkBit::CellType end_index_mask = 1u << Bitmap::IndexInCell(end_index);
+  const CellIndex start_cell_index = IndexToCell(start_index);
+  MarkBit::CellType start_index_mask = IndexInCellMask(start_index);
+  const CellIndex end_cell_index = IndexToCell(end_index);
+  MarkBit::CellType end_index_mask = IndexInCellMask(end_index);
 
   MarkBit::CellType matching_mask;
   if (start_cell_index != end_cell_index) {
     matching_mask = ~(start_index_mask - 1);
     if ((cells()[start_cell_index] & matching_mask)) return false;
-    for (unsigned int i = start_cell_index + 1; i < end_cell_index; i++) {
+    for (size_t i = start_cell_index + 1; i < end_cell_index; i++) {
       if (cells()[i]) return false;
     }
     matching_mask = end_index_mask | (end_index_mask - 1);
@@ -67,19 +66,19 @@ bool ConcurrentBitmap<AccessMode::NON_ATOMIC>::AllBitsClearInRange(
 
 namespace {
 
-void PrintWord(uint32_t word, uint32_t himask = 0) {
-  for (uint32_t mask = 1; mask != 0; mask <<= 1) {
+void PrintWord(MarkBit::CellType word, MarkBit::CellType himask = 0) {
+  for (MarkBit::CellType mask = 1; mask != 0; mask <<= 1) {
     if ((mask & himask) != 0) PrintF("[");
     PrintF((mask & word) ? "1" : "0");
     if ((mask & himask) != 0) PrintF("]");
   }
 }
 
-class CellPrinter {
+class CellPrinter final {
  public:
-  CellPrinter() : seq_start(0), seq_type(0), seq_length(0) {}
+  CellPrinter() = default;
 
-  void Print(size_t pos, uint32_t cell) {
+  void Print(size_t pos, MarkBit::CellType cell) {
     if (cell == seq_type) {
       seq_length++;
       return;
@@ -102,34 +101,34 @@ class CellPrinter {
   void Flush() {
     if (seq_length > 0) {
       PrintF("%zu: %dx%zu\n", seq_start, seq_type == 0 ? 0 : 1,
-             seq_length * Bitmap::kBitsPerCell);
+             seq_length * MarkingBitmap::kBitsPerCell);
       seq_length = 0;
     }
   }
 
-  static bool IsSeq(uint32_t cell) { return cell == 0 || cell == 0xFFFFFFFF; }
+  static bool IsSeq(MarkBit::CellType cell) {
+    return cell == 0 || cell == kAllBitsSetInCellValue;
+  }
 
  private:
-  size_t seq_start;
-  uint32_t seq_type;
-  size_t seq_length;
+  size_t seq_start = 0;
+  MarkBit::CellType seq_type = 0;
+  size_t seq_length = 0;
 };
 
 }  // anonymous namespace
 
-template <>
-void ConcurrentBitmap<AccessMode::NON_ATOMIC>::Print() {
+void MarkingBitmap::Print() const {
   CellPrinter printer;
-  for (size_t i = 0; i < CellsCount(); i++) {
+  for (size_t i = 0; i < kCellsCount; i++) {
     printer.Print(i, cells()[i]);
   }
   printer.Flush();
   PrintF("\n");
 }
 
-template <>
-bool ConcurrentBitmap<AccessMode::NON_ATOMIC>::IsClean() {
-  for (size_t i = 0; i < CellsCount(); i++) {
+bool MarkingBitmap::IsClean() const {
+  for (size_t i = 0; i < kCellsCount; i++) {
     if (cells()[i] != 0) {
       return false;
     }
@@ -137,5 +136,15 @@ bool ConcurrentBitmap<AccessMode::NON_ATOMIC>::IsClean() {
   return true;
 }
 
+// static
+MarkBit MarkBit::FromForTesting(Address address) {
+  return MarkingBitmap::MarkBitFromAddress(address);
+}
+
+// static
+MarkBit MarkBit::FromForTesting(Tagged<HeapObject> heap_object) {
+  return MarkingBitmap::MarkBitFromAddress(heap_object.ptr());
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/marking.h b/deps/v8/src/heap/marking.h
index faaf6554fe3d1b..e3c66972777059 100644
--- a/deps/v8/src/heap/marking.h
+++ b/deps/v8/src/heap/marking.h
@@ -5,34 +5,30 @@
 #ifndef V8_HEAP_MARKING_H_
 #define V8_HEAP_MARKING_H_
 
+#include <cstdint>
+
 #include "src/base/atomic-utils.h"
+#include "src/common/globals.h"
+#include "src/objects/heap-object.h"
+#include "src/objects/map.h"
 #include "src/utils/utils.h"
 
-namespace v8 {
-namespace internal {
+namespace v8::internal {
 
-class MarkBit {
- public:
-  using CellType = uint32_t;
-  static_assert(sizeof(CellType) == sizeof(base::Atomic32));
+class Page;
 
-  inline MarkBit(CellType* cell, CellType mask) : cell_(cell), mask_(mask) {}
+class MarkBit final {
+ public:
+  using CellType = uintptr_t;
+  static_assert(sizeof(CellType) == sizeof(base::AtomicWord));
 
-#ifdef DEBUG
-  bool operator==(const MarkBit& other) {
-    return cell_ == other.cell_ && mask_ == other.mask_;
-  }
-#endif
+  V8_ALLOW_UNUSED static inline MarkBit From(Address);
+  V8_ALLOW_UNUSED static inline MarkBit From(Tagged<HeapObject>);
 
- private:
-  inline MarkBit Next() {
-    CellType new_mask = mask_ << 1;
-    if (new_mask == 0) {
-      return MarkBit(cell_ + 1, 1);
-    } else {
-      return MarkBit(cell_, new_mask);
-    }
-  }
+  // These methods are meant to be used from the debugger and therefore
+  // intentionally not inlined such that they are always available.
+  V8_ALLOW_UNUSED static MarkBit FromForTesting(Address);
+  V8_ALLOW_UNUSED static MarkBit FromForTesting(Tagged<HeapObject>);
 
   // The function returns true if it succeeded to
   // transition the bit from 0 to 1.
@@ -43,16 +39,22 @@ class MarkBit {
   inline bool Get();
 
   // The function returns true if it succeeded to
-  // transition the bit from 1 to 0.
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
+  // transition the bit from 1 to 0. Only works in non-atomic contexts.
   inline bool Clear();
 
-  CellType* cell_;
-  CellType mask_;
+#ifdef DEBUG
+  bool operator==(const MarkBit& other) {
+    return cell_ == other.cell_ && mask_ == other.mask_;
+  }
+#endif
 
-  friend class IncrementalMarking;
-  friend class ConcurrentMarkingMarkbits;
-  friend class Marking;
+ private:
+  inline MarkBit(CellType* cell, CellType mask) : cell_(cell), mask_(mask) {}
+
+  CellType* const cell_;
+  const CellType mask_;
+
+  friend class MarkingBitmap;
 };
 
 template <>
@@ -65,7 +67,7 @@ inline bool MarkBit::Set<AccessMode::NON_ATOMIC>() {
 
 template <>
 inline bool MarkBit::Set<AccessMode::ATOMIC>() {
-  return base::AsAtomic32::SetBits(cell_, mask_, mask_);
+  return base::AsAtomicWord::SetBits(cell_, mask_, mask_);
 }
 
 template <>
@@ -75,365 +77,204 @@ inline bool MarkBit::Get<AccessMode::NON_ATOMIC>() {
 
 template <>
 inline bool MarkBit::Get<AccessMode::ATOMIC>() {
-  return (base::AsAtomic32::Acquire_Load(cell_) & mask_) != 0;
+  return (base::AsAtomicWord::Acquire_Load(cell_) & mask_) != 0;
 }
 
-template <>
-inline bool MarkBit::Clear<AccessMode::NON_ATOMIC>() {
+inline bool MarkBit::Clear() {
   CellType old_value = *cell_;
   *cell_ = old_value & ~mask_;
   return (old_value & mask_) == mask_;
 }
 
-template <>
-inline bool MarkBit::Clear<AccessMode::ATOMIC>() {
-  return base::AsAtomic32::SetBits(cell_, 0u, mask_);
-}
-
 // Bitmap is a sequence of cells each containing fixed number of bits.
-class V8_EXPORT_PRIVATE Bitmap {
+class V8_EXPORT_PRIVATE MarkingBitmap final {
  public:
-  static const uint32_t kBitsPerCell = 32;
-  static const uint32_t kBitsPerCellLog2 = 5;
-  static const uint32_t kBitIndexMask = kBitsPerCell - 1;
-  static const uint32_t kBytesPerCell = kBitsPerCell / kBitsPerByte;
-  static const uint32_t kBytesPerCellLog2 = kBitsPerCellLog2 - kBitsPerByteLog2;
-
-  // The length is the number of bits in this bitmap. (+1) accounts for
-  // the case where the markbits are queried for a one-word filler at the
-  // end of the page.
-  static const size_t kLength = ((1 << kPageSizeBits) >> kTaggedSizeLog2) + 1;
+  using CellType = MarkBit::CellType;
+  using CellIndex = uint32_t;
+  using MarkBitIndex = uint32_t;
+
+  static constexpr uint32_t kBitsPerCell = sizeof(CellType) * kBitsPerByte;
+  static constexpr uint32_t kBitsPerCellLog2 =
+      base::bits::CountTrailingZeros(kBitsPerCell);
+  static constexpr uint32_t kBitIndexMask = kBitsPerCell - 1;
+  static constexpr uint32_t kBytesPerCell = kBitsPerCell / kBitsPerByte;
+  static constexpr uint32_t kBytesPerCellLog2 =
+      kBitsPerCellLog2 - kBitsPerByteLog2;
+
+  // The length is the number of bits in this bitmap.
+  static constexpr size_t kLength = ((1 << kPageSizeBits) >> kTaggedSizeLog2);
+
+  static constexpr size_t kCellsCount =
+      (kLength + kBitsPerCell - 1) >> kBitsPerCellLog2;
+
   // The size of the bitmap in bytes is CellsCount() * kBytesPerCell.
-  static const size_t kSize;
+  static constexpr size_t kSize = kCellsCount * kBytesPerCell;
 
-  static constexpr size_t CellsForLength(int length) {
-    return (length + kBitsPerCell - 1) >> kBitsPerCellLog2;
+  V8_INLINE static constexpr MarkBitIndex AddressToIndex(Address address) {
+    return (address & kPageAlignmentMask) >> kTaggedSizeLog2;
   }
 
-  static constexpr size_t CellsCount() { return CellsForLength(kLength); }
+  V8_INLINE static constexpr MarkBitIndex LimitAddressToIndex(Address address);
 
-  V8_INLINE static uint32_t IndexToCell(uint32_t index) {
+  V8_INLINE static constexpr CellIndex IndexToCell(MarkBitIndex index) {
     return index >> kBitsPerCellLog2;
   }
 
-  V8_INLINE static uint32_t IndexInCell(uint32_t index) {
-    return index & kBitIndexMask;
+  V8_INLINE static constexpr Address IndexToAddressOffset(MarkBitIndex index) {
+    return index << kTaggedSizeLog2;
   }
 
-  // Retrieves the cell containing the provided markbit index.
-  V8_INLINE static uint32_t CellAlignIndex(uint32_t index) {
-    return index & ~kBitIndexMask;
+  V8_INLINE static constexpr Address CellToBase(CellIndex cell_index) {
+    return IndexToAddressOffset(cell_index << kBitsPerCellLog2);
   }
 
-  V8_INLINE MarkBit::CellType* cells() {
-    return reinterpret_cast<MarkBit::CellType*>(this);
+  V8_INLINE static constexpr uint32_t IndexInCell(MarkBitIndex index) {
+    return index & kBitIndexMask;
   }
 
-  V8_INLINE const MarkBit::CellType* cells() const {
-    return reinterpret_cast<const MarkBit::CellType*>(this);
+  V8_INLINE static constexpr CellType IndexInCellMask(MarkBitIndex index) {
+    return static_cast<CellType>(1u) << IndexInCell(index);
   }
 
-  V8_INLINE static Bitmap* FromAddress(Address addr) {
-    return reinterpret_cast<Bitmap*>(addr);
+  // Retrieves the cell containing the provided markbit index.
+  V8_INLINE static constexpr uint32_t CellAlignIndex(uint32_t index) {
+    return index & ~kBitIndexMask;
   }
 
-  inline MarkBit MarkBitFromIndex(uint32_t index) {
-    MarkBit::CellType mask = 1u << IndexInCell(index);
-    MarkBit::CellType* cell = this->cells() + (index >> kBitsPerCellLog2);
-    return MarkBit(cell, mask);
+  V8_INLINE static MarkingBitmap* Cast(Address addr) {
+    return reinterpret_cast<MarkingBitmap*>(addr);
   }
-};
 
-template <AccessMode mode>
-class ConcurrentBitmap : public Bitmap {
- public:
-  void Clear();
+  // Gets the MarkBit for an `address` which may be unaligned (include the tag
+  // bit).
+  V8_INLINE static MarkBit MarkBitFromAddress(Address address);
 
-  void MarkAllBits();
+  MarkingBitmap() = default;
+  MarkingBitmap(const MarkingBitmap&) = delete;
+  MarkingBitmap& operator=(const MarkingBitmap&) = delete;
 
-  // Clears bits in the given cell. The mask specifies bits to clear: if a
-  // bit is set in the mask then the corresponding bit is cleared in the cell.
-  void ClearBitsInCell(uint32_t cell_index, uint32_t mask);
+  V8_INLINE CellType* cells() { return cells_; }
+  V8_INLINE const CellType* cells() const { return cells_; }
 
-  // Sets bits in the given cell. The mask specifies bits to set: if a
-  // bit is set in the mask then the corresponding bit is set in the cell.
-  void SetBitsInCell(uint32_t cell_index, uint32_t mask);
+  // Returns true if all bits in the range [start_index, end_index) are cleared.
+  bool AllBitsClearInRange(MarkBitIndex start_index,
+                           MarkBitIndex end_index) const;
+
+  // Returns true if all bits in the range [start_index, end_index) are set.
+  bool AllBitsSetInRange(MarkBitIndex start_index,
+                         MarkBitIndex end_index) const;
+
+  template <AccessMode mode>
+  inline void Clear();
 
   // Sets all bits in the range [start_index, end_index). If the access is
   // atomic, the cells at the boundary of the range are updated with atomic
   // compare and swap operation. The inner cells are updated with relaxed write.
-  void SetRange(uint32_t start_index, uint32_t end_index);
+  template <AccessMode mode>
+  inline void SetRange(MarkBitIndex start_index, MarkBitIndex end_index);
 
   // Clears all bits in the range [start_index, end_index). If the access is
   // atomic, the cells at the boundary of the range are updated with atomic
   // compare and swap operation. The inner cells are updated with relaxed write.
-  void ClearRange(uint32_t start_index, uint32_t end_index);
-
-  // The following methods are *not* safe to use in a concurrent context so they
-  // are not implemented for `AccessMode::ATOMIC`.
+  template <AccessMode mode>
+  inline void ClearRange(MarkBitIndex start_index, MarkBitIndex end_index);
 
-  // Returns true if all bits in the range [start_index, end_index) are set.
-  bool AllBitsSetInRange(uint32_t start_index, uint32_t end_index);
+  // Returns true if all bits are cleared.
+  bool IsClean() const;
 
-  // Returns true if all bits in the range [start_index, end_index) are cleared.
-  bool AllBitsClearInRange(uint32_t start_index, uint32_t end_index);
+  // Not safe in a concurrent context.
+  void Print() const;
 
-  void Print();
+  V8_INLINE MarkBit MarkBitFromIndexForTesting(uint32_t index) {
+    const auto mask = IndexInCellMask(index);
+    MarkBit::CellType* cell = cells() + IndexToCell(index);
+    return MarkBit(cell, mask);
+  }
 
-  bool IsClean();
+  // This method provides a basis for inner-pointer resolution. It expects a
+  // page and a maybe_inner_ptr that is contained in that page. It returns the
+  // highest address in the page that is not larger than maybe_inner_ptr, has
+  // its markbit set, and whose previous address (if it exists) does not have
+  // its markbit set. If no such address exists, it returns the page area start.
+  // If the page is iterable, the returned address is guaranteed to be the start
+  // of a valid object in the page.
+  static inline Address FindPreviousValidObject(const Page* page,
+                                                Address maybe_inner_ptr);
 
  private:
-  // Clear all bits in the cell range [start_cell_index, end_cell_index). If the
-  // access is atomic then *still* use a relaxed memory ordering.
-  void ClearCellRangeRelaxed(uint32_t start_cell_index,
-                             uint32_t end_cell_index);
+  V8_INLINE static MarkingBitmap* FromAddress(Address address);
+
+  // Sets bits in the given cell. The mask specifies bits to set: if a
+  // bit is set in the mask then the corresponding bit is set in the cell.
+  template <AccessMode mode>
+  inline void SetBitsInCell(uint32_t cell_index, MarkBit::CellType mask);
+
+  // Clears bits in the given cell. The mask specifies bits to clear: if a
+  // bit is set in the mask then the corresponding bit is cleared in the cell.
+  template <AccessMode mode>
+  inline void ClearBitsInCell(uint32_t cell_index, MarkBit::CellType mask);
 
   // Set all bits in the cell range [start_cell_index, end_cell_index). If the
   // access is atomic then *still* use a relaxed memory ordering.
+  template <AccessMode mode>
   void SetCellRangeRelaxed(uint32_t start_cell_index, uint32_t end_cell_index);
-};
-
-template <>
-inline void ConcurrentBitmap<AccessMode::ATOMIC>::ClearCellRangeRelaxed(
-    uint32_t start_cell_index, uint32_t end_cell_index) {
-  base::Atomic32* cell_base = reinterpret_cast<base::Atomic32*>(cells());
-  for (uint32_t i = start_cell_index; i < end_cell_index; i++) {
-    base::Relaxed_Store(cell_base + i, 0);
-  }
-}
-
-template <>
-inline void ConcurrentBitmap<AccessMode::NON_ATOMIC>::ClearCellRangeRelaxed(
-    uint32_t start_cell_index, uint32_t end_cell_index) {
-  for (uint32_t i = start_cell_index; i < end_cell_index; i++) {
-    cells()[i] = 0;
-  }
-}
 
-template <>
-inline void ConcurrentBitmap<AccessMode::ATOMIC>::SetCellRangeRelaxed(
-    uint32_t start_cell_index, uint32_t end_cell_index) {
-  base::Atomic32* cell_base = reinterpret_cast<base::Atomic32*>(cells());
-  for (uint32_t i = start_cell_index; i < end_cell_index; i++) {
-    base::Relaxed_Store(cell_base + i, 0xffffffff);
-  }
-}
-
-template <>
-inline void ConcurrentBitmap<AccessMode::NON_ATOMIC>::SetCellRangeRelaxed(
-    uint32_t start_cell_index, uint32_t end_cell_index) {
-  for (uint32_t i = start_cell_index; i < end_cell_index; i++) {
-    cells()[i] = 0xffffffff;
-  }
-}
-
-template <AccessMode mode>
-inline void ConcurrentBitmap<mode>::Clear() {
-  ClearCellRangeRelaxed(0, CellsCount());
-  if (mode == AccessMode::ATOMIC) {
-    // This fence prevents re-ordering of publishing stores with the mark-bit
-    // setting stores.
-    base::SeqCst_MemoryFence();
-  }
-}
-
-template <AccessMode mode>
-inline void ConcurrentBitmap<mode>::MarkAllBits() {
-  SetCellRangeRelaxed(0, CellsCount());
-  if (mode == AccessMode::ATOMIC) {
-    // This fence prevents re-ordering of publishing stores with the mark-bit
-    // setting stores.
-    base::SeqCst_MemoryFence();
-  }
-}
-
-template <>
-inline void ConcurrentBitmap<AccessMode::NON_ATOMIC>::SetBitsInCell(
-    uint32_t cell_index, uint32_t mask) {
-  cells()[cell_index] |= mask;
-}
-
-template <>
-inline void ConcurrentBitmap<AccessMode::ATOMIC>::SetBitsInCell(
-    uint32_t cell_index, uint32_t mask) {
-  base::AsAtomic32::SetBits(cells() + cell_index, mask, mask);
-}
-
-template <>
-inline void ConcurrentBitmap<AccessMode::NON_ATOMIC>::ClearBitsInCell(
-    uint32_t cell_index, uint32_t mask) {
-  cells()[cell_index] &= ~mask;
-}
-
-template <>
-inline void ConcurrentBitmap<AccessMode::ATOMIC>::ClearBitsInCell(
-    uint32_t cell_index, uint32_t mask) {
-  base::AsAtomic32::SetBits(cells() + cell_index, 0u, mask);
-}
-
-template <AccessMode mode>
-void ConcurrentBitmap<mode>::SetRange(uint32_t start_index,
-                                      uint32_t end_index) {
-  if (start_index >= end_index) return;
-  end_index--;
-
-  unsigned int start_cell_index = start_index >> Bitmap::kBitsPerCellLog2;
-  MarkBit::CellType start_index_mask = 1u << Bitmap::IndexInCell(start_index);
-
-  unsigned int end_cell_index = end_index >> Bitmap::kBitsPerCellLog2;
-  MarkBit::CellType end_index_mask = 1u << Bitmap::IndexInCell(end_index);
-
-  if (start_cell_index != end_cell_index) {
-    // Firstly, fill all bits from the start address to the end of the first
-    // cell with 1s.
-    SetBitsInCell(start_cell_index, ~(start_index_mask - 1));
-    // Then fill all in between cells with 1s.
-    SetCellRangeRelaxed(start_cell_index + 1, end_cell_index);
-    // Finally, fill all bits until the end address in the last cell with 1s.
-    SetBitsInCell(end_cell_index, end_index_mask | (end_index_mask - 1));
-  } else {
-    SetBitsInCell(start_cell_index,
-                  end_index_mask | (end_index_mask - start_index_mask));
-  }
-  if (mode == AccessMode::ATOMIC) {
-    // This fence prevents re-ordering of publishing stores with the mark-bit
-    // setting stores.
-    base::SeqCst_MemoryFence();
-  }
-}
-
-template <AccessMode mode>
-void ConcurrentBitmap<mode>::ClearRange(uint32_t start_index,
-                                        uint32_t end_index) {
-  if (start_index >= end_index) return;
-  end_index--;
-
-  unsigned int start_cell_index = start_index >> Bitmap::kBitsPerCellLog2;
-  MarkBit::CellType start_index_mask = 1u << Bitmap::IndexInCell(start_index);
-
-  unsigned int end_cell_index = end_index >> Bitmap::kBitsPerCellLog2;
-  MarkBit::CellType end_index_mask = 1u << Bitmap::IndexInCell(end_index);
-
-  if (start_cell_index != end_cell_index) {
-    // Firstly, fill all bits from the start address to the end of the first
-    // cell with 0s.
-    ClearBitsInCell(start_cell_index, ~(start_index_mask - 1));
-    // Then fill all in between cells with 0s.
-    ClearCellRangeRelaxed(start_cell_index + 1, end_cell_index);
-    // Finally, set all bits until the end address in the last cell with 0s.
-    ClearBitsInCell(end_cell_index, end_index_mask | (end_index_mask - 1));
-  } else {
-    ClearBitsInCell(start_cell_index,
-                    end_index_mask | (end_index_mask - start_index_mask));
-  }
-  if (mode == AccessMode::ATOMIC) {
-    // This fence prevents re-ordering of publishing stores with the mark-bit
-    // clearing stores.
-    base::SeqCst_MemoryFence();
-  }
-}
-
-template <>
-V8_EXPORT_PRIVATE bool
-ConcurrentBitmap<AccessMode::NON_ATOMIC>::AllBitsSetInRange(
-    uint32_t start_index, uint32_t end_index);
-
-template <>
-V8_EXPORT_PRIVATE bool
-ConcurrentBitmap<AccessMode::NON_ATOMIC>::AllBitsClearInRange(
-    uint32_t start_index, uint32_t end_index);
-
-template <>
-void ConcurrentBitmap<AccessMode::NON_ATOMIC>::Print();
+  template <AccessMode mode>
+  // Clear all bits in the cell range [start_cell_index, end_cell_index). If the
+  // access is atomic then *still* use a relaxed memory ordering.
+  inline void ClearCellRangeRelaxed(uint32_t start_cell_index,
+                                    uint32_t end_cell_index);
 
-template <>
-V8_EXPORT_PRIVATE bool ConcurrentBitmap<AccessMode::NON_ATOMIC>::IsClean();
+  CellType cells_[kCellsCount] = {0};
+};
 
-class Marking : public AllStatic {
+class LiveObjectRange final {
  public:
-  // TODO(hpayer): The current mark bit operations use as default NON_ATOMIC
-  // mode for access. We should remove the default value or switch it with
-  // ATOMIC as soon we add concurrency.
+  class iterator final {
+   public:
+    using value_type = std::pair<HeapObject, int /* size */>;
+    using pointer = const value_type*;
+    using reference = const value_type&;
+    using iterator_category = std::forward_iterator_tag;
 
-  // Impossible markbits: 01
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static bool IsImpossible(MarkBit mark_bit) {
-    if (mode == AccessMode::NON_ATOMIC) {
-      return !mark_bit.Get<mode>() && mark_bit.Next().Get<mode>();
-    }
-    // If we are in concurrent mode we can only tell if an object has the
-    // impossible bit pattern if we read the first bit again after reading
-    // the first and the second bit. If the first bit is till zero and the
-    // second bit is one then the object has the impossible bit pattern.
-    bool is_impossible = !mark_bit.Get<mode>() && mark_bit.Next().Get<mode>();
-    if (is_impossible) {
-      return !mark_bit.Get<mode>();
-    }
-    return false;
-  }
-
-  // Black markbits: 11
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static bool IsBlack(MarkBit mark_bit) {
-    return mark_bit.Get<mode>() && mark_bit.Next().Get<mode>();
-  }
-
-  // White markbits: 00 - this is required by the mark bit clearer.
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static bool IsWhite(MarkBit mark_bit) {
-    DCHECK(!IsImpossible<mode>(mark_bit));
-    return !mark_bit.Get<mode>();
-  }
+    inline iterator();
+    explicit inline iterator(const Page* page);
 
-  // Grey markbits: 10
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static bool IsGrey(MarkBit mark_bit) {
-    return mark_bit.Get<mode>() && !mark_bit.Next().Get<mode>();
-  }
+    inline iterator& operator++();
+    inline iterator operator++(int);
 
-  // IsBlackOrGrey assumes that the first bit is set for black or grey
-  // objects.
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static bool IsBlackOrGrey(MarkBit mark_bit) {
-    return mark_bit.Get<mode>();
-  }
+    bool operator==(iterator other) const {
+      return current_object_ == other.current_object_;
+    }
+    bool operator!=(iterator other) const { return !(*this == other); }
 
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static void MarkWhite(MarkBit markbit) {
-    static_assert(mode == AccessMode::NON_ATOMIC);
-    markbit.Clear<mode>();
-    markbit.Next().Clear<mode>();
-  }
+    value_type operator*() {
+      return std::make_pair(current_object_, current_size_);
+    }
 
-  // Warning: this method is not safe in general in concurrent scenarios.
-  // If you know that nobody else will change the bits on the given location
-  // then you may use it.
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static void MarkBlack(MarkBit markbit) {
-    markbit.Set<mode>();
-    markbit.Next().Set<mode>();
-  }
+   private:
+    inline bool AdvanceToNextMarkedObject();
+    inline void AdvanceToNextValidObject();
 
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static bool WhiteToGrey(MarkBit markbit) {
-    return markbit.Set<mode>();
-  }
+    const Page* const page_ = nullptr;
+    const MarkBit::CellType* const cells_ = nullptr;
+    const PtrComprCageBase cage_base_;
+    MarkingBitmap::CellIndex current_cell_index_ = 0;
+    MarkingBitmap::CellType current_cell_ = 0;
+    HeapObject current_object_;
+    Map current_map_;
+    int current_size_ = 0;
+  };
 
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static bool WhiteToBlack(MarkBit markbit) {
-    return markbit.Set<mode>() && markbit.Next().Set<mode>();
-  }
+  explicit LiveObjectRange(const Page* page) : page_(page) {}
 
-  template <AccessMode mode = AccessMode::NON_ATOMIC>
-  V8_INLINE static bool GreyToBlack(MarkBit markbit) {
-    return markbit.Get<mode>() && markbit.Next().Set<mode>();
-  }
+  inline iterator begin();
+  inline iterator end();
 
  private:
-  DISALLOW_IMPLICIT_CONSTRUCTORS(Marking);
+  const Page* const page_;
 };
 
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal
 
 #endif  // V8_HEAP_MARKING_H_
diff --git a/deps/v8/src/heap/memory-allocator.cc b/deps/v8/src/heap/memory-allocator.cc
index 69284078b07d8c..e2da11ccac96b9 100644
--- a/deps/v8/src/heap/memory-allocator.cc
+++ b/deps/v8/src/heap/memory-allocator.cc
@@ -17,6 +17,7 @@
 #include "src/heap/heap.h"
 #include "src/heap/memory-chunk.h"
 #include "src/heap/read-only-spaces.h"
+#include "src/heap/zapping.h"
 #include "src/logging/log.h"
 #include "src/utils/allocation.h"
 
@@ -37,10 +38,6 @@ MemoryAllocator::MemoryAllocator(Isolate* isolate,
       data_page_allocator_(isolate->page_allocator()),
       code_page_allocator_(code_page_allocator),
       capacity_(RoundUp(capacity, Page::kPageSize)),
-      size_(0),
-      size_executable_(0),
-      lowest_ever_allocated_(static_cast<Address>(-1ll)),
-      highest_ever_allocated_(kNullAddress),
       unmapper_(isolate->heap(), this) {
   DCHECK_NOT_NULL(code_page_allocator);
 }
@@ -65,19 +62,25 @@ void MemoryAllocator::TearDown() {
 class MemoryAllocator::Unmapper::UnmapFreeMemoryJob : public JobTask {
  public:
   explicit UnmapFreeMemoryJob(Isolate* isolate, Unmapper* unmapper)
-      : unmapper_(unmapper), tracer_(isolate->heap()->tracer()) {}
+      : unmapper_(unmapper),
+        tracer_(isolate->heap()->tracer()),
+        trace_id_(reinterpret_cast<uint64_t>(this) ^
+                  tracer_->CurrentEpoch(GCTracer::Scope::BACKGROUND_UNMAPPER)) {
+  }
 
   UnmapFreeMemoryJob(const UnmapFreeMemoryJob&) = delete;
   UnmapFreeMemoryJob& operator=(const UnmapFreeMemoryJob&) = delete;
 
   void Run(JobDelegate* delegate) override {
     if (delegate->IsJoiningThread()) {
-      TRACE_GC(tracer_, GCTracer::Scope::UNMAPPER);
+      TRACE_GC_WITH_FLOW(tracer_, GCTracer::Scope::UNMAPPER, trace_id_,
+                         TRACE_EVENT_FLAG_FLOW_IN);
       RunImpl(delegate);
 
     } else {
-      TRACE_GC1(tracer_, GCTracer::Scope::BACKGROUND_UNMAPPER,
-                ThreadKind::kBackground);
+      TRACE_GC1_WITH_FLOW(tracer_, GCTracer::Scope::BACKGROUND_UNMAPPER,
+                          ThreadKind::kBackground, trace_id_,
+                          TRACE_EVENT_FLAG_FLOW_IN);
       RunImpl(delegate);
     }
   }
@@ -91,6 +94,8 @@ class MemoryAllocator::Unmapper::UnmapFreeMemoryJob : public JobTask {
                 kTaskPerChunk);
   }
 
+  uint64_t trace_id() const { return trace_id_; }
+
  private:
   void RunImpl(JobDelegate* delegate) {
     unmapper_->PerformFreeMemoryOnQueuedChunks(FreeMode::kUncommitPooled,
@@ -101,6 +106,7 @@ class MemoryAllocator::Unmapper::UnmapFreeMemoryJob : public JobTask {
   }
   Unmapper* const unmapper_;
   GCTracer* const tracer_;
+  const uint64_t trace_id_;
 };
 
 void MemoryAllocator::Unmapper::FreeQueuedChunks() {
@@ -110,9 +116,11 @@ void MemoryAllocator::Unmapper::FreeQueuedChunks() {
     if (job_handle_ && job_handle_->IsValid()) {
       job_handle_->NotifyConcurrencyIncrease();
     } else {
+      auto job = std::make_unique<UnmapFreeMemoryJob>(heap_->isolate(), this);
+      TRACE_GC_NOTE_WITH_FLOW("MemoryAllocator::Unmapper started",
+                              job->trace_id(), TRACE_EVENT_FLAG_FLOW_OUT);
       job_handle_ = V8::GetCurrentPlatform()->PostJob(
-          TaskPriority::kUserVisible,
-          std::make_unique<UnmapFreeMemoryJob>(heap_->isolate(), this));
+          TaskPriority::kUserVisible, std::move(job));
       if (v8_flags.trace_unmapper) {
         PrintIsolate(heap_->isolate(), "Unmapper::FreeQueuedChunks: new Job\n");
       }
@@ -221,13 +229,14 @@ bool MemoryAllocator::Unmapper::IsRunning() const {
   return job_handle_ && job_handle_->IsValid();
 }
 
-bool MemoryAllocator::CommitMemory(VirtualMemory* reservation) {
+bool MemoryAllocator::CommitMemory(VirtualMemory* reservation,
+                                   Executability executable) {
   Address base = reservation->address();
   size_t size = reservation->size();
   if (!reservation->SetPermissions(base, size, PageAllocator::kReadWrite)) {
     return false;
   }
-  UpdateAllocatedSpaceLimits(base, base + size);
+  UpdateAllocatedSpaceLimits(base, base + size, executable);
   return true;
 }
 
@@ -273,7 +282,7 @@ Address MemoryAllocator::AllocateAlignedMemory(
   if (executable == EXECUTABLE) {
     if (!SetPermissionsOnExecutableMemoryChunk(&reservation, base, area_size,
                                                chunk_size)) {
-      return HandleAllocationFailure(executable);
+      return HandleAllocationFailure(EXECUTABLE);
     }
   } else {
     // No guard page between page header and object area. This allows us to make
@@ -284,9 +293,9 @@ Address MemoryAllocator::AllocateAlignedMemory(
 
     if (reservation.SetPermissions(base, commit_size,
                                    PageAllocator::kReadWrite)) {
-      UpdateAllocatedSpaceLimits(base, base + commit_size);
+      UpdateAllocatedSpaceLimits(base, base + commit_size, NOT_EXECUTABLE);
     } else {
-      return HandleAllocationFailure(executable);
+      return HandleAllocationFailure(NOT_EXECUTABLE);
     }
   }
 
@@ -379,18 +388,25 @@ MemoryAllocator::AllocateUninitializedChunkAt(BaseSpace* space,
     size_executable_ += reservation.size();
   }
 
-  if (Heap::ShouldZapGarbage()) {
+  if (heap::ShouldZapGarbage()) {
     if (executable == EXECUTABLE) {
       // Page header and object area is split by guard page. Zap page header
       // first.
-      ZapBlock(base, MemoryChunkLayout::CodePageGuardStartOffset(), kZapValue);
+      heap::ZapBlock(base, MemoryChunkLayout::CodePageGuardStartOffset(),
+                     kZapValue);
       // Now zap object area.
-      ZapBlock(base + MemoryChunkLayout::ObjectStartOffsetInCodePage(),
-               area_size, kZapValue);
+      Address code_start =
+          base + MemoryChunkLayout::ObjectPageOffsetInCodePage();
+      CodePageMemoryModificationScopeForDebugging memory_write_scope(
+          isolate_->heap(), &reservation,
+          base::AddressRegion(code_start,
+                              RoundUp(area_size, GetCommitPageSize())));
+      heap::ZapBlock(base + MemoryChunkLayout::ObjectPageOffsetInCodePage(),
+                     area_size, kZapValue);
     } else {
       DCHECK_EQ(executable, NOT_EXECUTABLE);
       // Zap both page header and object area at once. No guard page in-between.
-      ZapBlock(
+      heap::ZapBlock(
           base,
           MemoryChunkLayout::ObjectStartOffsetInMemoryChunk(space->identity()) +
               area_size,
@@ -466,8 +482,13 @@ void MemoryAllocator::UnregisterBasicMemoryChunk(BasicMemoryChunk* chunk,
 #ifdef DEBUG
     UnregisterExecutableMemoryChunk(static_cast<MemoryChunk*>(chunk));
 #endif  // DEBUG
-    chunk->heap()->UnregisterUnprotectedMemoryChunk(
-        static_cast<MemoryChunk*>(chunk));
+
+    Address executable_page_start =
+        chunk->address() + MemoryChunkLayout::ObjectPageOffsetInCodePage();
+    size_t aligned_area_size =
+        RoundUp(chunk->area_end() - executable_page_start, GetCommitPageSize());
+    ThreadIsolation::UnregisterJitPage(executable_page_start,
+                                       aligned_area_size);
   }
   chunk->SetFlag(MemoryChunk::UNREGISTERED);
 }
@@ -532,10 +553,11 @@ void MemoryAllocator::PerformFreeMemory(MemoryChunk* chunk) {
 }
 
 void MemoryAllocator::Free(MemoryAllocator::FreeMode mode, MemoryChunk* chunk) {
-  if (chunk->IsLargePage())
-    RecordLargePageDestroyed(*static_cast<LargePage*>(chunk));
-  else
-    RecordNormalPageDestroyed(*static_cast<Page*>(chunk));
+  if (chunk->IsLargePage()) {
+    RecordLargePageDestroyed(*LargePage::cast(chunk));
+  } else {
+    RecordNormalPageDestroyed(*Page::cast(chunk));
+  }
   switch (mode) {
     case FreeMode::kImmediately:
       PreFreeMemory(chunk);
@@ -647,9 +669,9 @@ MemoryAllocator::AllocateUninitializedPageFromPool(Space* space) {
   // Pooled pages are always regular data pages.
   DCHECK_NE(CODE_SPACE, space->identity());
   VirtualMemory reservation(data_page_allocator(), start, size);
-  if (!CommitMemory(&reservation)) return {};
-  if (Heap::ShouldZapGarbage()) {
-    ZapBlock(start, size, kZapValue);
+  if (!CommitMemory(&reservation, NOT_EXECUTABLE)) return {};
+  if (heap::ShouldZapGarbage()) {
+    heap::ZapBlock(start, size, kZapValue);
   }
 
   size_ += size;
@@ -658,14 +680,6 @@ MemoryAllocator::AllocateUninitializedPageFromPool(Space* space) {
   };
 }
 
-void MemoryAllocator::ZapBlock(Address start, size_t size,
-                               uintptr_t zap_value) {
-  DCHECK(IsAligned(start, kTaggedSize));
-  DCHECK(IsAligned(size, kTaggedSize));
-  MemsetTagged(ObjectSlot(start), Object(static_cast<Address>(zap_value)),
-               size >> kTaggedSizeLog2);
-}
-
 void MemoryAllocator::InitializeOncePerProcess() {
   commit_page_size_ = v8_flags.v8_os_page_size > 0
                           ? v8_flags.v8_os_page_size * KB
@@ -718,6 +732,8 @@ bool MemoryAllocator::SetPermissionsOnExecutableMemoryChunk(VirtualMemory* vm,
 
   bool jitless = isolate_->jitless();
 
+  ThreadIsolation::RegisterJitPage(code_area, aligned_area_size);
+
   if (V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT && !jitless) {
     DCHECK(isolate_->RequiresCodeRange());
     // Commit the header, from start to pre-code guard page.
@@ -732,7 +748,8 @@ bool MemoryAllocator::SetPermissionsOnExecutableMemoryChunk(VirtualMemory* vm,
                               PageAllocator::kReadWriteExecute)) {
           // Create the post-code guard page.
           if (vm->DiscardSystemPages(post_guard_page, page_size)) {
-            UpdateAllocatedSpaceLimits(start, code_area + aligned_area_size);
+            UpdateAllocatedSpaceLimits(start, code_area + aligned_area_size,
+                                       EXECUTABLE);
             return true;
           }
 
@@ -751,17 +768,12 @@ bool MemoryAllocator::SetPermissionsOnExecutableMemoryChunk(VirtualMemory* vm,
                              PageAllocator::kNoAccess)) {
         // Commit the executable code body.
         bool set_permission_successed = false;
-#if V8_HEAP_USE_PKU_JIT_WRITE_PROTECT
-        if (!jitless && RwxMemoryWriteScope::IsSupported()) {
-          base::AddressRegion region(code_area, aligned_area_size);
+        if (ThreadIsolation::Enabled()) {
+          DCHECK(!jitless);
           set_permission_successed =
-              base::MemoryProtectionKey::SetPermissionsAndKey(
-                  code_page_allocator_, region,
-                  PageAllocator::kReadWriteExecute,
-                  RwxMemoryWriteScope::memory_protection_key());
-        } else
-#endif
-        {
+              ThreadIsolation::MakeExecutable(code_area, aligned_area_size);
+
+        } else {
           set_permission_successed = vm->SetPermissions(
               code_area, aligned_area_size,
               jitless ? PageAllocator::kReadWrite
@@ -771,7 +783,8 @@ bool MemoryAllocator::SetPermissionsOnExecutableMemoryChunk(VirtualMemory* vm,
           // Create the post-code guard page.
           if (vm->SetPermissions(post_guard_page, page_size,
                                  PageAllocator::kNoAccess)) {
-            UpdateAllocatedSpaceLimits(start, code_area + aligned_area_size);
+            UpdateAllocatedSpaceLimits(start, code_area + aligned_area_size,
+                                       EXECUTABLE);
             return true;
           }
 
@@ -783,23 +796,31 @@ bool MemoryAllocator::SetPermissionsOnExecutableMemoryChunk(VirtualMemory* vm,
                                PageAllocator::kNoAccess));
     }
   }
+
+  ThreadIsolation::UnregisterJitPage(code_area, aligned_area_size);
   return false;
 }
 
-// static
-const MemoryChunk* MemoryAllocator::LookupChunkContainingAddress(
-    const NormalPagesSet& normal_pages, const LargePagesSet& large_pages,
-    Address addr) {
+#if defined(V8_ENABLE_CONSERVATIVE_STACK_SCANNING) || defined(DEBUG)
+
+const BasicMemoryChunk* MemoryAllocator::LookupChunkContainingAddress(
+    Address addr) const {
+  // All threads should be either parked or in a safepoint whenever this method
+  // is called, thus pages cannot be allocated or freed at the same time and a
+  // mutex is not required here.
+  // As the address may not correspond to a valid heap object, the chunk we
+  // obtain below is not necessarily a valid chunk.
   BasicMemoryChunk* chunk = BasicMemoryChunk::FromAddress(addr);
-  if (auto it = normal_pages.find(static_cast<Page*>(chunk));
-      it != normal_pages.end()) {
+  // Check if it corresponds to a known normal or large page.
+  if (auto it = normal_pages_.find(chunk); it != normal_pages_.end()) {
     // The chunk is a normal page.
-    DCHECK_LE(chunk->address(), addr);
-    if (chunk->Contains(addr)) return *it;
-  } else if (auto it = large_pages.upper_bound(static_cast<LargePage*>(chunk));
-             it != large_pages.begin()) {
+    auto* normal_page = Page::cast(chunk);
+    DCHECK_LE(normal_page->address(), addr);
+    if (normal_page->Contains(addr)) return normal_page;
+  } else if (auto it = large_pages_.upper_bound(chunk);
+             it != large_pages_.begin()) {
     // The chunk could be inside a large page.
-    DCHECK_IMPLIES(it != large_pages.end(), addr < (*it)->address());
+    DCHECK_IMPLIES(it != large_pages_.end(), addr < (*it)->address());
     auto* large_page = *std::next(it, -1);
     DCHECK_NOT_NULL(large_page);
     DCHECK_LE(large_page->address(), addr);
@@ -809,44 +830,42 @@ const MemoryChunk* MemoryAllocator::LookupChunkContainingAddress(
   return nullptr;
 }
 
-const MemoryChunk* MemoryAllocator::LookupChunkContainingAddress(
-    Address addr) const {
-  // All threads should be either parked or in a safepoint whenever this method
-  // is called, thus pages cannot be allocated or freed at the same time and a
-  // mutex is not required here,
-  return LookupChunkContainingAddress(normal_pages_, large_pages_, addr);
-}
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING || DEBUG
 
 void MemoryAllocator::RecordNormalPageCreated(const Page& page) {
+#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
   base::MutexGuard guard(&pages_mutex_);
   auto result = normal_pages_.insert(&page);
   USE(result);
   DCHECK(result.second);
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
 }
 
 void MemoryAllocator::RecordNormalPageDestroyed(const Page& page) {
+#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
   base::MutexGuard guard(&pages_mutex_);
-  DCHECK_IMPLIES(v8_flags.minor_mc && isolate_->heap()->sweeping_in_progress(),
-                 isolate_->heap()->tracer()->IsInAtomicPause());
   auto size = normal_pages_.erase(&page);
   USE(size);
   DCHECK_EQ(1u, size);
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
 }
 
 void MemoryAllocator::RecordLargePageCreated(const LargePage& page) {
+#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
   base::MutexGuard guard(&pages_mutex_);
   auto result = large_pages_.insert(&page);
   USE(result);
   DCHECK(result.second);
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
 }
 
 void MemoryAllocator::RecordLargePageDestroyed(const LargePage& page) {
+#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
   base::MutexGuard guard(&pages_mutex_);
-  DCHECK_IMPLIES(v8_flags.minor_mc && isolate_->heap()->sweeping_in_progress(),
-                 isolate_->heap()->tracer()->IsInAtomicPause());
   auto size = large_pages_.erase(&page);
   USE(size);
   DCHECK_EQ(1u, size);
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/memory-allocator.h b/deps/v8/src/heap/memory-allocator.h
index f831cc77d3880e..266836c3de1b44 100644
--- a/deps/v8/src/heap/memory-allocator.h
+++ b/deps/v8/src/heap/memory-allocator.h
@@ -14,6 +14,7 @@
 #include "include/v8-platform.h"
 #include "src/base/bounded-page-allocator.h"
 #include "src/base/export-template.h"
+#include "src/base/functional.h"
 #include "src/base/macros.h"
 #include "src/base/platform/mutex.h"
 #include "src/base/platform/semaphore.h"
@@ -42,9 +43,6 @@ class ReadOnlyPage;
 // pages for large object space.
 class MemoryAllocator {
  public:
-  using NormalPagesSet = std::unordered_set<const Page*>;
-  using LargePagesSet = std::set<const LargePage*>;
-
   // Unmapper takes care of concurrently unmapping and uncommitting memory
   // chunks.
   class Unmapper {
@@ -224,10 +222,24 @@ class MemoryAllocator {
   }
 
   // Returns an indication of whether a pointer is in a space that has
-  // been allocated by this MemoryAllocator.
+  // been allocated by this MemoryAllocator. It is conservative, allowing
+  // false negatives (i.e., if a pointer is outside the allocated space, it may
+  // return false) but not false positives (i.e., if a pointer is inside the
+  // allocated space, it will definitely return false).
   V8_INLINE bool IsOutsideAllocatedSpace(Address address) const {
-    return address < lowest_ever_allocated_ ||
-           address >= highest_ever_allocated_;
+    return IsOutsideAllocatedSpace(address, NOT_EXECUTABLE) &&
+           IsOutsideAllocatedSpace(address, EXECUTABLE);
+  }
+  V8_INLINE bool IsOutsideAllocatedSpace(Address address,
+                                         Executability executable) const {
+    switch (executable) {
+      case NOT_EXECUTABLE:
+        return address < lowest_not_executable_ever_allocated_ ||
+               address >= highest_not_executable_ever_allocated_;
+      case EXECUTABLE:
+        return address < lowest_executable_ever_allocated_ ||
+               address >= highest_executable_ever_allocated_;
+    }
   }
 
   // Partially release |bytes_to_free| bytes starting at |start_free|. Note that
@@ -246,10 +258,6 @@ class MemoryAllocator {
   }
 #endif  // DEBUG
 
-  // Zaps a contiguous block of memory [start..(start+size)[ with
-  // a given zap value.
-  void ZapBlock(Address start, size_t size, uintptr_t zap_value);
-
   // Page allocator instance for allocating non-executable pages.
   // Guaranteed to be a valid pointer.
   v8::PageAllocator* data_page_allocator() { return data_page_allocator_; }
@@ -271,13 +279,12 @@ class MemoryAllocator {
 
   Address HandleAllocationFailure(Executability executable);
 
+#if defined(V8_ENABLE_CONSERVATIVE_STACK_SCANNING) || defined(DEBUG)
   // Return the normal or large page that contains this address, if it is owned
   // by this heap, otherwise a nullptr.
-  V8_EXPORT_PRIVATE static const MemoryChunk* LookupChunkContainingAddress(
-      const NormalPagesSet& normal_pages, const LargePagesSet& large_page,
-      Address addr);
-  V8_EXPORT_PRIVATE const MemoryChunk* LookupChunkContainingAddress(
+  V8_EXPORT_PRIVATE const BasicMemoryChunk* LookupChunkContainingAddress(
       Address addr) const;
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING || DEBUG
 
   // Insert and remove normal and large pages that are owned by this heap.
   void RecordNormalPageCreated(const Page& page);
@@ -285,19 +292,6 @@ class MemoryAllocator {
   void RecordLargePageCreated(const LargePage& page);
   void RecordLargePageDestroyed(const LargePage& page);
 
-  std::pair<const NormalPagesSet, const LargePagesSet> SnapshotPageSetsUnsafe()
-      const {
-    return std::make_pair(normal_pages_, large_pages_);
-  }
-
-  std::pair<const NormalPagesSet, const LargePagesSet> SnapshotPageSetsSafe()
-      const {
-    // For shared heap, this method may be called by client isolates thus
-    // requiring a mutex.
-    base::MutexGuard guard(&pages_mutex_);
-    return SnapshotPageSetsUnsafe();
-  }
-
  private:
   // Used to store all data about MemoryChunk allocation, e.g. in
   // AllocateUninitializedChunk.
@@ -336,7 +330,7 @@ class MemoryAllocator {
 
   // Commit memory region owned by given reservation object.  Returns true if
   // it succeeded and false otherwise.
-  bool CommitMemory(VirtualMemory* reservation);
+  bool CommitMemory(VirtualMemory* reservation, Executability executable);
 
   // Sets memory permissions on executable memory chunks. This entails page
   // header (RW), guard pages (no access) and the object area (code modification
@@ -376,17 +370,40 @@ class MemoryAllocator {
   Page* InitializePagesInChunk(int chunk_id, int pages_in_chunk,
                                PagedSpace* space);
 
-  void UpdateAllocatedSpaceLimits(Address low, Address high) {
+  void UpdateAllocatedSpaceLimits(Address low, Address high,
+                                  Executability executable) {
     // The use of atomic primitives does not guarantee correctness (wrt.
     // desired semantics) by default. The loop here ensures that we update the
     // values only if they did not change in between.
-    Address ptr = lowest_ever_allocated_.load(std::memory_order_relaxed);
-    while ((low < ptr) && !lowest_ever_allocated_.compare_exchange_weak(
-                              ptr, low, std::memory_order_acq_rel)) {
-    }
-    ptr = highest_ever_allocated_.load(std::memory_order_relaxed);
-    while ((high > ptr) && !highest_ever_allocated_.compare_exchange_weak(
-                               ptr, high, std::memory_order_acq_rel)) {
+    Address ptr;
+    switch (executable) {
+      case NOT_EXECUTABLE:
+        ptr = lowest_not_executable_ever_allocated_.load(
+            std::memory_order_relaxed);
+        while ((low < ptr) &&
+               !lowest_not_executable_ever_allocated_.compare_exchange_weak(
+                   ptr, low, std::memory_order_acq_rel)) {
+        }
+        ptr = highest_not_executable_ever_allocated_.load(
+            std::memory_order_relaxed);
+        while ((high > ptr) &&
+               !highest_not_executable_ever_allocated_.compare_exchange_weak(
+                   ptr, high, std::memory_order_acq_rel)) {
+        }
+        break;
+      case EXECUTABLE:
+        ptr = lowest_executable_ever_allocated_.load(std::memory_order_relaxed);
+        while ((low < ptr) &&
+               !lowest_executable_ever_allocated_.compare_exchange_weak(
+                   ptr, low, std::memory_order_acq_rel)) {
+        }
+        ptr =
+            highest_executable_ever_allocated_.load(std::memory_order_relaxed);
+        while ((high > ptr) &&
+               !highest_executable_ever_allocated_.compare_exchange_weak(
+                   ptr, high, std::memory_order_acq_rel)) {
+        }
+        break;
     }
   }
 
@@ -433,17 +450,23 @@ class MemoryAllocator {
   size_t capacity_;
 
   // Allocated space size in bytes.
-  std::atomic<size_t> size_;
+  std::atomic<size_t> size_ = 0;
   // Allocated executable space size in bytes.
-  std::atomic<size_t> size_executable_;
+  std::atomic<size_t> size_executable_ = 0;
 
   // We keep the lowest and highest addresses allocated as a quick way
   // of determining that pointers are outside the heap. The estimate is
   // conservative, i.e. not all addresses in 'allocated' space are allocated
   // to our heap. The range is [lowest, highest[, inclusive on the low end
-  // and exclusive on the high end.
-  std::atomic<Address> lowest_ever_allocated_;
-  std::atomic<Address> highest_ever_allocated_;
+  // and exclusive on the high end. Addresses are distinguished between
+  // executable and not-executable, as they may generally be placed in distinct
+  // areas of the heap.
+  std::atomic<Address> lowest_not_executable_ever_allocated_{
+      static_cast<Address>(-1ll)};
+  std::atomic<Address> highest_not_executable_ever_allocated_{kNullAddress};
+  std::atomic<Address> lowest_executable_ever_allocated_{
+      static_cast<Address>(-1ll)};
+  std::atomic<Address> highest_executable_ever_allocated_{kNullAddress};
 
   base::Optional<VirtualMemory> reserved_chunk_at_virtual_memory_limit_;
   Unmapper unmapper_;
@@ -451,15 +474,23 @@ class MemoryAllocator {
 #ifdef DEBUG
   // Data structure to remember allocated executable memory chunks.
   // This data structure is used only in DCHECKs.
-  std::unordered_set<MemoryChunk*> executable_memory_;
+  std::unordered_set<MemoryChunk*, base::hash<MemoryChunk*>> executable_memory_;
   base::Mutex executable_memory_mutex_;
 #endif  // DEBUG
 
+#if defined(V8_ENABLE_CONSERVATIVE_STACK_SCANNING) || defined(DEBUG)
   // Allocated normal and large pages are stored here, to be used during
-  // conservative stack scanning.
-  NormalPagesSet normal_pages_;
-  LargePagesSet large_pages_;
+  // conservative stack scanning. The normal page set is guaranteed to contain
+  // Page*, and the large page set is guaranteed to contain LargePage*. We will
+  // be looking up BasicMemoryChunk*, however, and we want to avoid pointer
+  // casts that are technically undefined behaviour.
+  std::unordered_set<const BasicMemoryChunk*,
+                     base::hash<const BasicMemoryChunk*>>
+      normal_pages_;
+  std::set<const BasicMemoryChunk*> large_pages_;
+
   mutable base::Mutex pages_mutex_;
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING || DEBUG
 
   V8_EXPORT_PRIVATE static size_t commit_page_size_;
   V8_EXPORT_PRIVATE static size_t commit_page_size_bits_;
diff --git a/deps/v8/src/heap/memory-balancer.cc b/deps/v8/src/heap/memory-balancer.cc
new file mode 100644
index 00000000000000..74e9dc9e703cfd
--- /dev/null
+++ b/deps/v8/src/heap/memory-balancer.cc
@@ -0,0 +1,119 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/memory-balancer.h"
+
+#include "src/heap/heap-inl.h"
+#include "src/heap/heap.h"
+
+namespace v8 {
+namespace internal {
+
+void MemoryBalancer::RefreshLimit() {
+  DCHECK(v8_flags.memory_balancer);
+  if (major_allocation_rate_ && major_gc_speed_) {
+    size_t new_limit =
+        live_memory_after_gc_ +
+        sqrt(live_memory_after_gc_ * (major_allocation_rate_.value().rate()) /
+             (major_gc_speed_.value().rate()) /
+             v8_flags.memory_balancer_c_value);
+    UpdateHeapLimit(new_limit);
+  }
+}
+
+// 2 MB of extra space.
+// This allows the heap size to not decay to CurrentSizeOfObject()
+// and prevents GC from triggering if, after a long period of idleness,
+// a small allocation appears.
+constexpr size_t kMinHeapExtraSpace = 2 * MB;
+
+void MemoryBalancer::UpdateHeapLimit(size_t computed_limit) {
+  size_t new_limit =
+      std::max<size_t>(live_memory_after_gc_ + kMinHeapExtraSpace,
+                       computed_limit) +
+      heap_->NewSpaceCapacity();
+  new_limit = std::min<size_t>(new_limit, heap_->max_old_generation_size());
+  new_limit = std::max<size_t>(new_limit, heap_->min_old_generation_size());
+  heap_->SetOldGenerationAndGlobalAllocationLimit(
+      new_limit, new_limit + external_allocation_limit_);
+}
+
+void MemoryBalancer::PostHeartbeatTask() {
+  heap_->GetForegroundTaskRunner()->PostDelayedTask(
+      std::make_unique<HeartbeatTask>(heap_->isolate(), this), 1);
+}
+
+void MemoryBalancer::UpdateLiveMemory(size_t live_memory) {
+  live_memory_after_gc_ = live_memory;
+}
+
+void MemoryBalancer::UpdateMajorGC(double major_gc_bytes,
+                                   double major_gc_duration) {
+  major_gc_duration *= kSecondsToNanoseconds;
+  if (!major_gc_speed_) {
+    major_gc_speed_ =
+        SmoothedBytesAndDuration{major_gc_bytes, major_gc_duration};
+  } else {
+    major_gc_speed_->Update(major_gc_bytes, major_gc_duration,
+                            kMajorGCDecayRate);
+  }
+}
+
+void MemoryBalancer::UpdateMajorAllocation(double major_allocation_bytes,
+                                           double major_allocation_duration) {
+  major_allocation_duration *= kSecondsToNanoseconds;
+  if (!major_allocation_rate_) {
+    major_allocation_rate_ = SmoothedBytesAndDuration{
+        major_allocation_bytes, major_allocation_duration};
+  } else {
+    major_allocation_rate_->Update(major_allocation_bytes,
+                                   major_allocation_duration,
+                                   kMajorAllocationDecayRate);
+  }
+}
+
+void MemoryBalancer::NotifyGC() {
+  last_measured_memory_ = heap_->OldGenerationSizeOfObjects();
+  last_measured_at_ =
+      heap_->MonotonicallyIncreasingTimeInMs() * kMillisecondsToNanoseconds;
+  RefreshLimit();
+  if (!heartbeat_task_started_) {
+    heartbeat_task_started_ = true;
+    PostHeartbeatTask();
+  }
+}
+
+void MemoryBalancer::TracerUpdate(size_t live_memory,
+                                  double major_allocation_bytes,
+                                  double major_allocation_duration,
+                                  double major_gc_bytes,
+                                  double major_gc_duration) {
+  UpdateLiveMemory(live_memory);
+  UpdateMajorAllocation(major_allocation_bytes, major_allocation_duration);
+  UpdateMajorGC(major_gc_bytes, major_gc_duration);
+}
+
+void MemoryBalancer::HeartbeatUpdate() {
+  auto time = heap_->MonotonicallyIncreasingTimeInMs() *
+              MemoryBalancer::kMillisecondsToNanoseconds;
+  auto memory = heap_->OldGenerationSizeOfObjects() +
+                heap_->AllocatedExternalMemorySinceMarkCompact();
+  if (last_measured_memory_ && last_measured_at_) {
+    UpdateMajorAllocation(
+        std::max<double>(0, memory - last_measured_memory_.value()),
+        time - last_measured_at_.value());
+  }
+  last_measured_memory_ = memory;
+  last_measured_at_ = time;
+  RefreshLimit();
+  PostHeartbeatTask();
+}
+
+HeartbeatTask::HeartbeatTask(Isolate* isolate, MemoryBalancer* mb)
+    : CancelableTask(isolate), mb_(mb) {}
+
+void HeartbeatTask::RunInternal() { mb_->HeartbeatUpdate(); }
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/heap/memory-balancer.h b/deps/v8/src/heap/memory-balancer.h
new file mode 100644
index 00000000000000..47147809205392
--- /dev/null
+++ b/deps/v8/src/heap/memory-balancer.h
@@ -0,0 +1,112 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_MEMORY_BALANCER_H_
+#define V8_HEAP_MEMORY_BALANCER_H_
+
+#include "src/tasks/cancelable-task.h"
+
+namespace v8 {
+namespace internal {
+
+class Heap;
+
+// The class that implements memory balancing.
+// Listen to allocation/garbage collection events
+// and smooth them using an exponentially weighted moving average (EWMA).
+// Spawn a heartbeat task that monitors allocation rate.
+// Calculate heap limit and update it accordingly.
+class MemoryBalancer {
+ public:
+  constexpr static int kSecondsToNanoseconds = 1e9;
+  constexpr static int kMillisecondsToNanoseconds = 1e6;
+
+  explicit MemoryBalancer(Heap* heap) : heap_(heap) {}
+
+  void TracerUpdate(size_t live_memory, double major_allocation_bytes,
+                    double major_allocation_duration, double major_gc_bytes,
+                    double major_gc_duration);
+
+  void HeartbeatUpdate();
+
+  void UpdateExternalAllocationLimit(size_t external_allocation_limit) {
+    external_allocation_limit_ = external_allocation_limit;
+  }
+
+  void NotifyGC();
+
+ private:
+  struct SmoothedBytesAndDuration {
+    void Update(double bytes, double duration, double decay_rate) {
+      this->bytes = this->bytes * decay_rate + bytes * (1 - decay_rate);
+      this->duration =
+          this->duration * decay_rate + duration * (1 - decay_rate);
+    }
+    // Return memory (in bytes) over time (in nanoseconds).
+    double rate() const { return bytes / duration; }
+
+    double bytes;
+    double duration;
+  };
+
+  static constexpr double kMajorAllocationDecayRate = 0.95;
+  static constexpr double kMajorGCDecayRate = 0.5;
+
+  void RefreshLimit();
+  void PostHeartbeatTask();
+  // Also touch global allocation limit
+  void UpdateHeapLimit(size_t new_limit);
+
+  void UpdateLiveMemory(size_t live_memory);
+  void UpdateMajorAllocation(double major_allocation_bytes,
+                             double major_allocation_duration);
+  void UpdateMajorGC(double major_gc_bytes, double major_gc_duration);
+
+  Heap* heap_;
+
+  // Live memory estimate of the heap, obtained at the last major garbage
+  // collection.
+  size_t live_memory_after_gc_ = 0;
+
+  // We want to set the old_generation_allocation_limit our way,
+  // but when we do so we are taking memory from the external heap,
+  // because the global allocation limit is shared between old generation and
+  // external heap. We thus calculate the external heap limit and keep it
+  // unchanged, by 'patching' the global_allocation_limit_.
+  // A more principled solution is to also manage the external heapusing
+  // membalancer. We can also replace global_allocation_limit_ in heap.cc with
+  // external_allocation_limit_. Then we can recover global_allocation_limit_
+  // via old_generation_allocation_limit_ + external_allocation_limit_.
+  size_t external_allocation_limit_ = 0;
+
+  // Our estimate of major allocation rate and major GC speed.
+  base::Optional<SmoothedBytesAndDuration> major_allocation_rate_;
+  base::Optional<SmoothedBytesAndDuration> major_gc_speed_;
+
+  // HeartbeatTask uses the diff between last observed time/memory and
+  // current time/memory to calculate the allocation rate.
+  base::Optional<double> last_measured_memory_ = 0;
+  base::Optional<size_t> last_measured_at_ = 0;
+  bool heartbeat_task_started_ = false;
+};
+
+class HeartbeatTask : public CancelableTask {
+ public:
+  explicit HeartbeatTask(Isolate* isolate, MemoryBalancer* mb);
+
+  ~HeartbeatTask() override = default;
+  HeartbeatTask(const HeartbeatTask&) = delete;
+  HeartbeatTask& operator=(const HeartbeatTask&) = delete;
+
+ private:
+  // v8::internal::CancelableTask overrides.
+  void RunInternal() override;
+
+  MemoryBalancer* mb_;
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_MEMORY_BALANCER_H_
diff --git a/deps/v8/src/heap/memory-chunk-inl.h b/deps/v8/src/heap/memory-chunk-inl.h
index 045de5ea377b84..7795c76e91ff84 100644
--- a/deps/v8/src/heap/memory-chunk-inl.h
+++ b/deps/v8/src/heap/memory-chunk-inl.h
@@ -14,7 +14,8 @@ namespace internal {
 void MemoryChunk::IncrementExternalBackingStoreBytes(
     ExternalBackingStoreType type, size_t amount) {
 #ifndef V8_ENABLE_THIRD_PARTY_HEAP
-  base::CheckedIncrement(&external_backing_store_bytes_[type], amount);
+  base::CheckedIncrement(&external_backing_store_bytes_[static_cast<int>(type)],
+                         amount);
   owner()->IncrementExternalBackingStoreBytes(type, amount);
 #endif
 }
@@ -22,7 +23,8 @@ void MemoryChunk::IncrementExternalBackingStoreBytes(
 void MemoryChunk::DecrementExternalBackingStoreBytes(
     ExternalBackingStoreType type, size_t amount) {
 #ifndef V8_ENABLE_THIRD_PARTY_HEAP
-  base::CheckedDecrement(&external_backing_store_bytes_[type], amount);
+  base::CheckedDecrement(&external_backing_store_bytes_[static_cast<int>(type)],
+                         amount);
   owner()->DecrementExternalBackingStoreBytes(type, amount);
 #endif
 }
@@ -33,8 +35,10 @@ void MemoryChunk::MoveExternalBackingStoreBytes(ExternalBackingStoreType type,
                                                 size_t amount) {
   DCHECK_NOT_NULL(from->owner());
   DCHECK_NOT_NULL(to->owner());
-  base::CheckedDecrement(&(from->external_backing_store_bytes_[type]), amount);
-  base::CheckedIncrement(&(to->external_backing_store_bytes_[type]), amount);
+  base::CheckedDecrement(
+      &(from->external_backing_store_bytes_[static_cast<int>(type)]), amount);
+  base::CheckedIncrement(
+      &(to->external_backing_store_bytes_[static_cast<int>(type)]), amount);
   Space::MoveExternalBackingStoreBytes(type, from->owner(), to->owner(),
                                        amount);
 }
diff --git a/deps/v8/src/heap/memory-chunk-layout.cc b/deps/v8/src/heap/memory-chunk-layout.cc
index 1fb265f39fbddf..7b9ab99f9c9a69 100644
--- a/deps/v8/src/heap/memory-chunk-layout.cc
+++ b/deps/v8/src/heap/memory-chunk-layout.cc
@@ -8,6 +8,7 @@
 #include "src/heap/marking.h"
 #include "src/heap/memory-allocator.h"
 #include "src/heap/memory-chunk.h"
+#include "src/objects/instruction-stream.h"
 
 namespace v8 {
 namespace internal {
@@ -15,7 +16,7 @@ namespace internal {
 size_t MemoryChunkLayout::CodePageGuardStartOffset() {
   // We are guarding code pages: the first OS page after the header
   // will be protected as non-writable.
-  return ::RoundUp(MemoryChunk::kHeaderSize + Bitmap::kSize,
+  return ::RoundUp(MemoryChunk::kHeaderSize,
                    MemoryAllocator::GetCommitPageSize());
 }
 
@@ -48,7 +49,7 @@ size_t MemoryChunkLayout::AllocatableMemoryInCodePage() {
 }
 
 intptr_t MemoryChunkLayout::ObjectStartOffsetInDataPage() {
-  return RoundUp(MemoryChunk::kHeaderSize + Bitmap::kSize,
+  return RoundUp(MemoryChunk::kHeaderSize,
                  ALIGN_TO_ALLOCATION_ALIGNMENT(kDoubleSize));
 }
 
@@ -59,7 +60,7 @@ intptr_t MemoryChunkLayout::ObjectStartOffsetInReadOnlyPage() {
 
 size_t MemoryChunkLayout::ObjectStartOffsetInMemoryChunk(
     AllocationSpace space) {
-  if (space == CODE_SPACE || space == CODE_LO_SPACE) {
+  if (IsAnyCodeSpace(space)) {
     return ObjectStartOffsetInCodePage();
   }
   if (space == RO_SPACE) {
diff --git a/deps/v8/src/heap/memory-chunk-layout.h b/deps/v8/src/heap/memory-chunk-layout.h
index 05a44d6291c4b0..78d39dce8439db 100644
--- a/deps/v8/src/heap/memory-chunk-layout.h
+++ b/deps/v8/src/heap/memory-chunk-layout.h
@@ -9,14 +9,14 @@
 #include "src/common/globals.h"
 #include "src/heap/base/active-system-pages.h"
 #include "src/heap/list.h"
+#include "src/heap/marking.h"
 #include "src/heap/progress-bar.h"
 #include "src/heap/slot-set.h"
 
 namespace v8 {
 namespace internal {
 
-class Bitmap;
-class CodeObjectRegistry;
+class MarkingBitmap;
 class FreeListCategory;
 class Heap;
 class TypedSlotsSet;
@@ -24,6 +24,7 @@ class SlotSet;
 
 enum RememberedSetType {
   OLD_TO_NEW,
+  OLD_TO_NEW_BACKGROUND,
   OLD_TO_OLD,
   OLD_TO_SHARED,
   OLD_TO_CODE,
@@ -35,7 +36,8 @@ using ActiveSystemPages = ::heap::base::ActiveSystemPages;
 class V8_EXPORT_PRIVATE MemoryChunkLayout {
  public:
   static constexpr int kNumSets = NUMBER_OF_REMEMBERED_SET_TYPES;
-  static constexpr int kNumTypes = ExternalBackingStoreType::kNumTypes;
+  static constexpr int kNumTypes =
+      static_cast<int>(ExternalBackingStoreType::kNumValues);
   static constexpr int kMemoryChunkAlignment = sizeof(size_t);
 #define FIELD(Type, Name) \
   k##Name##Offset, k##Name##End = k##Name##Offset + sizeof(Type) - 1
@@ -53,34 +55,34 @@ class V8_EXPORT_PRIVATE MemoryChunkLayout {
     FIELD(VirtualMemory, Reservation),
     // MemoryChunk fields:
     FIELD(SlotSet* [kNumSets], SlotSet),
+    FIELD(TypedSlotsSet* [kNumSets], TypedSlotSet),
     FIELD(ProgressBar, ProgressBar),
     FIELD(std::atomic<intptr_t>, LiveByteCount),
-    FIELD(TypedSlotsSet* [kNumSets], TypedSlotSet),
-    FIELD(void* [kNumSets], InvalidatedSlots),
     FIELD(base::Mutex*, Mutex),
     FIELD(base::SharedMutex*, SharedMutex),
-    FIELD(std::atomic<intptr_t>, ConcurrentSweeping),
     FIELD(base::Mutex*, PageProtectionChangeMutex),
-    FIELD(uintptr_t, WriteUnprotectCounter),
+    FIELD(std::atomic<intptr_t>, ConcurrentSweeping),
     FIELD(std::atomic<size_t>[kNumTypes], ExternalBackingStoreBytes),
     FIELD(heap::ListNode<MemoryChunk>, ListNode),
     FIELD(FreeListCategory**, Categories),
-    FIELD(CodeObjectRegistry*, CodeObjectRegistry),
     FIELD(PossiblyEmptyBuckets, PossiblyEmptyBuckets),
     FIELD(ActiveSystemPages*, ActiveSystemPages),
-    FIELD(size_t, WasUsedForAllocation),
-    kMarkingBitmapOffset,
+    FIELD(size_t, AllocatedLabSize),
+    FIELD(size_t, AgeInNewSpace),
+    FIELD(MarkingBitmap, MarkingBitmap),
+    kEndOfMarkingBitmap,
     kMemoryChunkHeaderSize =
-        kMarkingBitmapOffset +
-        ((kMarkingBitmapOffset % kMemoryChunkAlignment) == 0
+        kEndOfMarkingBitmap +
+        ((kEndOfMarkingBitmap % kMemoryChunkAlignment) == 0
              ? 0
              : kMemoryChunkAlignment -
-                   (kMarkingBitmapOffset % kMemoryChunkAlignment)),
+                   (kEndOfMarkingBitmap % kMemoryChunkAlignment)),
     kMemoryChunkHeaderStart = kSlotSetOffset,
     kBasicMemoryChunkHeaderSize = kMemoryChunkHeaderStart,
     kBasicMemoryChunkHeaderStart = 0,
   };
 #undef FIELD
+
   static size_t CodePageGuardStartOffset();
   static size_t CodePageGuardSize();
   // Code pages have padding on the first page for code alignment, so the
diff --git a/deps/v8/src/heap/memory-chunk.cc b/deps/v8/src/heap/memory-chunk.cc
index 7277852deb2ba1..5c5c6c77c06f8b 100644
--- a/deps/v8/src/heap/memory-chunk.cc
+++ b/deps/v8/src/heap/memory-chunk.cc
@@ -9,7 +9,7 @@
 #include "src/base/platform/platform.h"
 #include "src/common/globals.h"
 #include "src/heap/basic-memory-chunk.h"
-#include "src/heap/code-object-registry.h"
+#include "src/heap/incremental-marking.h"
 #include "src/heap/marking-state-inl.h"
 #include "src/heap/memory-allocator.h"
 #include "src/heap/memory-chunk-inl.h"
@@ -50,25 +50,14 @@ void MemoryChunk::DecrementWriteUnprotectCounterAndMaybeSetPermissions(
   DCHECK(permission == PageAllocator::kRead ||
          permission == PageAllocator::kReadExecute);
   DCHECK(IsFlagSet(MemoryChunk::IS_EXECUTABLE));
-  DCHECK(owner_identity() == CODE_SPACE || owner_identity() == CODE_LO_SPACE);
-  // Decrementing the write_unprotect_counter_ and changing the page
-  // protection mode has to be atomic.
-  base::MutexGuard guard(page_protection_change_mutex_);
-  if (write_unprotect_counter_ == 0) {
-    // This is a corner case that may happen when we have a
-    // CodeSpaceMemoryModificationScope open and this page was newly
-    // added.
-    return;
-  }
-  write_unprotect_counter_--;
-  if (write_unprotect_counter_ == 0) {
-    Address protect_start =
-        address() + MemoryChunkLayout::ObjectStartOffsetInCodePage();
-    size_t page_size = MemoryAllocator::GetCommitPageSize();
-    DCHECK(IsAligned(protect_start, page_size));
-    size_t protect_size = RoundUp(area_size(), page_size);
-    CHECK(reservation_.SetPermissions(protect_start, protect_size, permission));
-  }
+  DCHECK(IsAnyCodeSpace(owner_identity()));
+  page_protection_change_mutex_->AssertHeld();
+  Address protect_start =
+      address() + MemoryChunkLayout::ObjectPageOffsetInCodePage();
+  size_t page_size = MemoryAllocator::GetCommitPageSize();
+  DCHECK(IsAligned(protect_start, page_size));
+  size_t protect_size = RoundUp(area_size(), page_size);
+  CHECK(reservation_.SetPermissions(protect_start, protect_size, permission));
 }
 
 void MemoryChunk::SetReadable() {
@@ -81,27 +70,27 @@ void MemoryChunk::SetReadAndExecutable() {
       PageAllocator::kReadExecute);
 }
 
-void MemoryChunk::SetCodeModificationPermissions() {
+base::MutexGuard MemoryChunk::SetCodeModificationPermissions() {
   DCHECK(!V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT);
   DCHECK(IsFlagSet(MemoryChunk::IS_EXECUTABLE));
-  DCHECK(owner_identity() == CODE_SPACE || owner_identity() == CODE_LO_SPACE);
+  DCHECK(IsAnyCodeSpace(owner_identity()));
   // Incrementing the write_unprotect_counter_ and changing the page
   // protection mode has to be atomic.
   base::MutexGuard guard(page_protection_change_mutex_);
-  write_unprotect_counter_++;
-  if (write_unprotect_counter_ == 1) {
-    Address unprotect_start =
-        address() + MemoryChunkLayout::ObjectStartOffsetInCodePage();
-    size_t page_size = MemoryAllocator::GetCommitPageSize();
-    DCHECK(IsAligned(unprotect_start, page_size));
-    size_t unprotect_size = RoundUp(area_size(), page_size);
-    // We may use RWX pages to write code. Some CPUs have optimisations to push
-    // updates to code to the icache through a fast path, and they may filter
-    // updates based on the written memory being executable.
-    CHECK(reservation_.SetPermissions(
-        unprotect_start, unprotect_size,
-        MemoryChunk::GetCodeModificationPermission()));
-  }
+
+  Address unprotect_start =
+      address() + MemoryChunkLayout::ObjectPageOffsetInCodePage();
+  size_t page_size = MemoryAllocator::GetCommitPageSize();
+  DCHECK(IsAligned(unprotect_start, page_size));
+  size_t unprotect_size = RoundUp(area_size(), page_size);
+  // We may use RWX pages to write code. Some CPUs have optimisations to push
+  // updates to code to the icache through a fast path, and they may filter
+  // updates based on the written memory being executable.
+  CHECK(reservation_.SetPermissions(
+      unprotect_start, unprotect_size,
+      MemoryChunk::GetCodeModificationPermission()));
+
+  return guard;
 }
 
 void MemoryChunk::SetDefaultCodePermissions() {
@@ -112,76 +101,21 @@ void MemoryChunk::SetDefaultCodePermissions() {
   }
 }
 
-namespace {
-
-PageAllocator::Permission DefaultWritableCodePermissions() {
-  DCHECK(!V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT);
-  // On MacOS on ARM64 RWX permissions are allowed to be set only when
-  // fast W^X is enabled (see V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT).
-  return V8_HAS_PTHREAD_JIT_WRITE_PROTECT || v8_flags.jitless
-             ? PageAllocator::kReadWrite
-             : PageAllocator::kReadWriteExecute;
-}
-
-}  // namespace
-
 MemoryChunk::MemoryChunk(Heap* heap, BaseSpace* space, size_t chunk_size,
                          Address area_start, Address area_end,
                          VirtualMemory reservation, Executability executable,
                          PageSize page_size)
     : BasicMemoryChunk(heap, space, chunk_size, area_start, area_end,
-                       std::move(reservation)) {
-  base::AsAtomicPointer::Release_Store(&slot_set_[OLD_TO_NEW], nullptr);
-  base::AsAtomicPointer::Release_Store(&slot_set_[OLD_TO_OLD], nullptr);
-  base::AsAtomicPointer::Release_Store(&slot_set_[OLD_TO_SHARED], nullptr);
-  base::AsAtomicPointer::Release_Store(&slot_set_[OLD_TO_CODE], nullptr);
-  base::AsAtomicPointer::Release_Store(&typed_slot_set_[OLD_TO_NEW], nullptr);
-  base::AsAtomicPointer::Release_Store(&typed_slot_set_[OLD_TO_OLD], nullptr);
-  base::AsAtomicPointer::Release_Store(&typed_slot_set_[OLD_TO_SHARED],
-                                       nullptr);
-  invalidated_slots_[OLD_TO_NEW] = nullptr;
-  invalidated_slots_[OLD_TO_OLD] = nullptr;
-  invalidated_slots_[OLD_TO_CODE] = nullptr;
-  invalidated_slots_[OLD_TO_SHARED] = nullptr;
-  progress_bar_.Initialize();
-  set_concurrent_sweeping_state(ConcurrentSweepingState::kDone);
-  page_protection_change_mutex_ = new base::Mutex();
-  write_unprotect_counter_ = 0;
-  mutex_ = new base::Mutex();
-  shared_mutex_ = new base::SharedMutex();
-
-  external_backing_store_bytes_[ExternalBackingStoreType::kArrayBuffer] = 0;
-  external_backing_store_bytes_[ExternalBackingStoreType::kExternalString] = 0;
-
-  categories_ = nullptr;
-
-  heap->non_atomic_marking_state()->SetLiveBytes(this, 0);
+                       std::move(reservation)),
+      mutex_(new base::Mutex()),
+      shared_mutex_(new base::SharedMutex()),
+      page_protection_change_mutex_(new base::Mutex()) {
+  DCHECK_NE(space->identity(), RO_SPACE);
+
   if (executable == EXECUTABLE) {
     SetFlag(IS_EXECUTABLE);
-    if (heap->write_protect_code_memory()) {
-      write_unprotect_counter_ =
-          heap->code_space_memory_modification_scope_depth();
-    } else if (!V8_HEAP_USE_PTHREAD_JIT_WRITE_PROTECT) {
-      size_t page_size = MemoryAllocator::GetCommitPageSize();
-      // On executable chunks, area_start_ points past padding used for code
-      // alignment.
-      Address start_before_padding =
-          address() + MemoryChunkLayout::ObjectPageOffsetInCodePage();
-      DCHECK(IsAligned(start_before_padding, page_size));
-      size_t area_size = RoundUp(area_end_ - start_before_padding, page_size);
-      CHECK(reservation_.SetPermissions(start_before_padding, area_size,
-                                        DefaultWritableCodePermissions()));
-    }
-  }
-
-  if (owner()->identity() == CODE_SPACE) {
-    code_object_registry_ = new CodeObjectRegistry();
-  } else {
-    code_object_registry_ = nullptr;
   }
 
-  possibly_empty_buckets_.Initialize();
-
   if (page_size == PageSize::kRegular) {
     active_system_pages_ = new ActiveSystemPages;
     active_system_pages_->Init(MemoryChunkLayout::kMemoryChunkHeaderSize,
@@ -208,29 +142,32 @@ size_t MemoryChunk::CommittedPhysicalMemory() const {
   return active_system_pages_->Size(MemoryAllocator::GetCommitPageSizeBits());
 }
 
-void MemoryChunk::SetOldGenerationPageFlags(bool is_marking) {
-  if (is_marking) {
+void MemoryChunk::SetOldGenerationPageFlags(MarkingMode marking_mode) {
+  if (marking_mode == MarkingMode::kMajorMarking) {
     SetFlag(MemoryChunk::POINTERS_TO_HERE_ARE_INTERESTING);
     SetFlag(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING);
     SetFlag(MemoryChunk::INCREMENTAL_MARKING);
+  } else if (owner_identity() == SHARED_SPACE ||
+             owner_identity() == SHARED_LO_SPACE) {
+    // We need to track pointers into the SHARED_SPACE for OLD_TO_SHARED.
+    SetFlag(MemoryChunk::POINTERS_TO_HERE_ARE_INTERESTING);
+    // No need to track OLD_TO_NEW or OLD_TO_SHARED within the shared space.
+    ClearFlag(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING);
+    ClearFlag(MemoryChunk::INCREMENTAL_MARKING);
   } else {
-    if (owner_identity() == SHARED_SPACE ||
-        owner_identity() == SHARED_LO_SPACE) {
-      // We need to track pointers into the SHARED_SPACE for OLD_TO_SHARED.
-      SetFlag(MemoryChunk::POINTERS_TO_HERE_ARE_INTERESTING);
-      // No need to track OLD_TO_NEW or OLD_TO_SHARED within the shared space.
-      ClearFlag(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING);
+    ClearFlag(MemoryChunk::POINTERS_TO_HERE_ARE_INTERESTING);
+    SetFlag(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING);
+    if (marking_mode == MarkingMode::kMinorMarking) {
+      SetFlag(MemoryChunk::INCREMENTAL_MARKING);
     } else {
-      ClearFlag(MemoryChunk::POINTERS_TO_HERE_ARE_INTERESTING);
-      SetFlag(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING);
+      ClearFlags(MemoryChunk::INCREMENTAL_MARKING);
     }
-    ClearFlag(MemoryChunk::INCREMENTAL_MARKING);
   }
 }
 
-void MemoryChunk::SetYoungGenerationPageFlags(bool is_marking) {
+void MemoryChunk::SetYoungGenerationPageFlags(MarkingMode marking_mode) {
   SetFlag(MemoryChunk::POINTERS_TO_HERE_ARE_INTERESTING);
-  if (is_marking) {
+  if (marking_mode != MarkingMode::kNoMarking) {
     SetFlag(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING);
     SetFlag(MemoryChunk::INCREMENTAL_MARKING);
   } else {
@@ -255,10 +192,6 @@ void MemoryChunk::ReleaseAllocatedMemoryNeededForWritableChunk() {
     delete page_protection_change_mutex_;
     page_protection_change_mutex_ = nullptr;
   }
-  if (code_object_registry_ != nullptr) {
-    delete code_object_registry_;
-    code_object_registry_ = nullptr;
-  }
 
   if (active_system_pages_ != nullptr) {
     delete active_system_pages_;
@@ -266,16 +199,14 @@ void MemoryChunk::ReleaseAllocatedMemoryNeededForWritableChunk() {
   }
 
   possibly_empty_buckets_.Release();
-  ReleaseSlotSet<OLD_TO_NEW>();
-  ReleaseSlotSet<OLD_TO_OLD>();
-  ReleaseSlotSet<OLD_TO_CODE>();
-  ReleaseSlotSet<OLD_TO_SHARED>();
-  ReleaseTypedSlotSet<OLD_TO_NEW>();
-  ReleaseTypedSlotSet<OLD_TO_OLD>();
-  ReleaseTypedSlotSet<OLD_TO_SHARED>();
-  ReleaseInvalidatedSlots<OLD_TO_NEW>();
-  ReleaseInvalidatedSlots<OLD_TO_OLD>();
-  ReleaseInvalidatedSlots<OLD_TO_SHARED>();
+  ReleaseSlotSet(OLD_TO_NEW);
+  ReleaseSlotSet(OLD_TO_NEW_BACKGROUND);
+  ReleaseSlotSet(OLD_TO_OLD);
+  ReleaseSlotSet(OLD_TO_CODE);
+  ReleaseSlotSet(OLD_TO_SHARED);
+  ReleaseTypedSlotSet(OLD_TO_NEW);
+  ReleaseTypedSlotSet(OLD_TO_OLD);
+  ReleaseTypedSlotSet(OLD_TO_SHARED);
 
   if (!IsLargePage()) {
     Page* page = static_cast<Page*>(this);
@@ -287,56 +218,31 @@ void MemoryChunk::ReleaseAllAllocatedMemory() {
   ReleaseAllocatedMemoryNeededForWritableChunk();
 }
 
-template V8_EXPORT_PRIVATE SlotSet* MemoryChunk::AllocateSlotSet<OLD_TO_NEW>();
-template V8_EXPORT_PRIVATE SlotSet* MemoryChunk::AllocateSlotSet<OLD_TO_OLD>();
-template V8_EXPORT_PRIVATE SlotSet*
-MemoryChunk::AllocateSlotSet<OLD_TO_SHARED>();
-template V8_EXPORT_PRIVATE SlotSet* MemoryChunk::AllocateSlotSet<OLD_TO_CODE>();
-
-template <RememberedSetType type>
-SlotSet* MemoryChunk::AllocateSlotSet() {
-  return AllocateSlotSet(&slot_set_[type]);
-}
-
-SlotSet* MemoryChunk::AllocateSlotSet(SlotSet** slot_set) {
+SlotSet* MemoryChunk::AllocateSlotSet(RememberedSetType type) {
   SlotSet* new_slot_set = SlotSet::Allocate(buckets());
   SlotSet* old_slot_set = base::AsAtomicPointer::AcquireRelease_CompareAndSwap(
-      slot_set, nullptr, new_slot_set);
-  if (old_slot_set != nullptr) {
+      &slot_set_[type], nullptr, new_slot_set);
+  if (old_slot_set) {
     SlotSet::Delete(new_slot_set, buckets());
     new_slot_set = old_slot_set;
   }
-  DCHECK(new_slot_set);
+  DCHECK_NOT_NULL(new_slot_set);
   return new_slot_set;
 }
 
-template void MemoryChunk::ReleaseSlotSet<OLD_TO_NEW>();
-template void MemoryChunk::ReleaseSlotSet<OLD_TO_OLD>();
-template void MemoryChunk::ReleaseSlotSet<OLD_TO_SHARED>();
-template void MemoryChunk::ReleaseSlotSet<OLD_TO_CODE>();
-
-template <RememberedSetType type>
-void MemoryChunk::ReleaseSlotSet() {
-  ReleaseSlotSet(&slot_set_[type]);
-}
-
-void MemoryChunk::ReleaseSlotSet(SlotSet** slot_set) {
-  if (*slot_set) {
-    SlotSet::Delete(*slot_set, buckets());
-    *slot_set = nullptr;
+void MemoryChunk::ReleaseSlotSet(RememberedSetType type) {
+  SlotSet* slot_set = slot_set_[type];
+  if (slot_set) {
+    slot_set_[type] = nullptr;
+    SlotSet::Delete(slot_set, buckets());
   }
 }
 
-template TypedSlotSet* MemoryChunk::AllocateTypedSlotSet<OLD_TO_NEW>();
-template TypedSlotSet* MemoryChunk::AllocateTypedSlotSet<OLD_TO_OLD>();
-template TypedSlotSet* MemoryChunk::AllocateTypedSlotSet<OLD_TO_SHARED>();
-
-template <RememberedSetType type>
-TypedSlotSet* MemoryChunk::AllocateTypedSlotSet() {
+TypedSlotSet* MemoryChunk::AllocateTypedSlotSet(RememberedSetType type) {
   TypedSlotSet* typed_slot_set = new TypedSlotSet(address());
   TypedSlotSet* old_value = base::AsAtomicPointer::Release_CompareAndSwap(
       &typed_slot_set_[type], nullptr, typed_slot_set);
-  if (old_value != nullptr) {
+  if (old_value) {
     delete typed_slot_set;
     typed_slot_set = old_value;
   }
@@ -344,12 +250,7 @@ TypedSlotSet* MemoryChunk::AllocateTypedSlotSet() {
   return typed_slot_set;
 }
 
-template void MemoryChunk::ReleaseTypedSlotSet<OLD_TO_NEW>();
-template void MemoryChunk::ReleaseTypedSlotSet<OLD_TO_OLD>();
-template void MemoryChunk::ReleaseTypedSlotSet<OLD_TO_SHARED>();
-
-template <RememberedSetType type>
-void MemoryChunk::ReleaseTypedSlotSet() {
+void MemoryChunk::ReleaseTypedSlotSet(RememberedSetType type) {
   TypedSlotSet* typed_slot_set = typed_slot_set_[type];
   if (typed_slot_set) {
     typed_slot_set_[type] = nullptr;
@@ -357,132 +258,18 @@ void MemoryChunk::ReleaseTypedSlotSet() {
   }
 }
 
-template InvalidatedSlots* MemoryChunk::AllocateInvalidatedSlots<OLD_TO_NEW>();
-template InvalidatedSlots* MemoryChunk::AllocateInvalidatedSlots<OLD_TO_OLD>();
-
-template <RememberedSetType type>
-InvalidatedSlots* MemoryChunk::AllocateInvalidatedSlots() {
-  DCHECK_NULL(invalidated_slots_[type]);
-  invalidated_slots_[type] = new InvalidatedSlots();
-  return invalidated_slots_[type];
-}
-
-template void MemoryChunk::ReleaseInvalidatedSlots<OLD_TO_NEW>();
-template void MemoryChunk::ReleaseInvalidatedSlots<OLD_TO_OLD>();
-template void MemoryChunk::ReleaseInvalidatedSlots<OLD_TO_SHARED>();
-
-template <RememberedSetType type>
-void MemoryChunk::ReleaseInvalidatedSlots() {
-  if (invalidated_slots_[type]) {
-    delete invalidated_slots_[type];
-    invalidated_slots_[type] = nullptr;
-  }
-}
-
-template V8_EXPORT_PRIVATE void
-MemoryChunk::RegisterObjectWithInvalidatedSlots<OLD_TO_NEW>(HeapObject object,
-                                                            int new_size);
-template V8_EXPORT_PRIVATE void
-MemoryChunk::RegisterObjectWithInvalidatedSlots<OLD_TO_OLD>(HeapObject object,
-                                                            int new_size);
-template V8_EXPORT_PRIVATE void MemoryChunk::RegisterObjectWithInvalidatedSlots<
-    OLD_TO_SHARED>(HeapObject object, int new_size);
-
-template <RememberedSetType type>
-void MemoryChunk::RegisterObjectWithInvalidatedSlots(HeapObject object,
-                                                     int new_size) {
-  // ByteArray and FixedArray are still invalidated in tests.
-  DCHECK(object.IsString() || object.IsByteArray() || object.IsFixedArray());
-  DCHECK(!object.InWritableSharedSpace());
-  bool skip_slot_recording;
-
-  switch (type) {
-    case OLD_TO_NEW:
-      skip_slot_recording = InYoungGeneration();
-      break;
-
-    case OLD_TO_OLD:
-      skip_slot_recording = ShouldSkipEvacuationSlotRecording();
-      break;
-
-    case OLD_TO_SHARED:
-      skip_slot_recording = InYoungGeneration();
-      break;
-
-    default:
-      UNREACHABLE();
-  }
-
-  if (skip_slot_recording) {
-    return;
-  }
-
-  if (invalidated_slots<type>() == nullptr) {
-    AllocateInvalidatedSlots<type>();
-  }
-
-  DCHECK_GT(new_size, 0);
-  InvalidatedSlots& invalidated_slots = *this->invalidated_slots<type>();
-  DCHECK_IMPLIES(invalidated_slots.count(object) > 0,
-                 new_size <= invalidated_slots[object]);
-  invalidated_slots.insert_or_assign(object, new_size);
-}
-
-template V8_EXPORT_PRIVATE void
-MemoryChunk::UpdateInvalidatedObjectSize<OLD_TO_NEW>(HeapObject object,
-                                                     int new_size);
-template V8_EXPORT_PRIVATE void
-MemoryChunk::UpdateInvalidatedObjectSize<OLD_TO_OLD>(HeapObject object,
-                                                     int new_size);
-template V8_EXPORT_PRIVATE void
-MemoryChunk::UpdateInvalidatedObjectSize<OLD_TO_SHARED>(HeapObject object,
-                                                        int new_size);
-
-template <RememberedSetType type>
-void MemoryChunk::UpdateInvalidatedObjectSize(HeapObject object, int new_size) {
-  DCHECK(!object.InWritableSharedSpace());
-  DCHECK_GT(new_size, 0);
-
-  if (invalidated_slots<type>() == nullptr) return;
-
-  InvalidatedSlots& invalidated_slots = *this->invalidated_slots<type>();
-  if (invalidated_slots.count(object) > 0) {
-    DCHECK_LE(new_size, invalidated_slots[object]);
-    DCHECK_NE(0, invalidated_slots[object]);
-    invalidated_slots.insert_or_assign(object, new_size);
-  }
-}
-
-template bool MemoryChunk::RegisteredObjectWithInvalidatedSlots<OLD_TO_NEW>(
-    HeapObject object);
-template bool MemoryChunk::RegisteredObjectWithInvalidatedSlots<OLD_TO_OLD>(
-    HeapObject object);
-template bool MemoryChunk::RegisteredObjectWithInvalidatedSlots<OLD_TO_SHARED>(
-    HeapObject object);
-
-template <RememberedSetType type>
-bool MemoryChunk::RegisteredObjectWithInvalidatedSlots(HeapObject object) {
-  if (invalidated_slots<type>() == nullptr) {
-    return false;
-  }
-  return invalidated_slots<type>()->find(object) !=
-         invalidated_slots<type>()->end();
-}
-
-bool MemoryChunk::HasRecordedSlots() const {
+bool MemoryChunk::ContainsAnySlots() const {
   for (int rs_type = 0; rs_type < NUMBER_OF_REMEMBERED_SET_TYPES; rs_type++) {
-    if (slot_set_[rs_type] || typed_slot_set_[rs_type] ||
-        invalidated_slots_[rs_type]) {
+    if (slot_set_[rs_type] || typed_slot_set_[rs_type]) {
       return true;
     }
   }
-
   return false;
 }
 
-bool MemoryChunk::HasRecordedOldToNewSlots() const {
-  return slot_set_[OLD_TO_NEW] || typed_slot_set_[OLD_TO_NEW] ||
-         invalidated_slots_[OLD_TO_NEW];
+void MemoryChunk::ClearLiveness() {
+  marking_bitmap()->Clear<AccessMode::NON_ATOMIC>();
+  SetLiveBytes(0);
 }
 
 #ifdef DEBUG
@@ -498,9 +285,6 @@ void MemoryChunk::ValidateOffsets(MemoryChunk* chunk) {
   DCHECK_EQ(
       reinterpret_cast<Address>(&chunk->typed_slot_set_) - chunk->address(),
       MemoryChunkLayout::kTypedSlotSetOffset);
-  DCHECK_EQ(
-      reinterpret_cast<Address>(&chunk->invalidated_slots_) - chunk->address(),
-      MemoryChunkLayout::kInvalidatedSlotsOffset);
   DCHECK_EQ(reinterpret_cast<Address>(&chunk->mutex_) - chunk->address(),
             MemoryChunkLayout::kMutexOffset);
   DCHECK_EQ(reinterpret_cast<Address>(&chunk->shared_mutex_) - chunk->address(),
@@ -511,9 +295,6 @@ void MemoryChunk::ValidateOffsets(MemoryChunk* chunk) {
   DCHECK_EQ(reinterpret_cast<Address>(&chunk->page_protection_change_mutex_) -
                 chunk->address(),
             MemoryChunkLayout::kPageProtectionChangeMutexOffset);
-  DCHECK_EQ(reinterpret_cast<Address>(&chunk->write_unprotect_counter_) -
-                chunk->address(),
-            MemoryChunkLayout::kWriteUnprotectCounterOffset);
   DCHECK_EQ(reinterpret_cast<Address>(&chunk->external_backing_store_bytes_) -
                 chunk->address(),
             MemoryChunkLayout::kExternalBackingStoreBytesOffset);
@@ -521,18 +302,18 @@ void MemoryChunk::ValidateOffsets(MemoryChunk* chunk) {
             MemoryChunkLayout::kListNodeOffset);
   DCHECK_EQ(reinterpret_cast<Address>(&chunk->categories_) - chunk->address(),
             MemoryChunkLayout::kCategoriesOffset);
-  DCHECK_EQ(reinterpret_cast<Address>(&chunk->code_object_registry_) -
-                chunk->address(),
-            MemoryChunkLayout::kCodeObjectRegistryOffset);
   DCHECK_EQ(reinterpret_cast<Address>(&chunk->possibly_empty_buckets_) -
                 chunk->address(),
             MemoryChunkLayout::kPossiblyEmptyBucketsOffset);
   DCHECK_EQ(reinterpret_cast<Address>(&chunk->active_system_pages_) -
                 chunk->address(),
             MemoryChunkLayout::kActiveSystemPagesOffset);
-  DCHECK_EQ(reinterpret_cast<Address>(&chunk->was_used_for_allocation_) -
-                chunk->address(),
-            MemoryChunkLayout::kWasUsedForAllocationOffset);
+  DCHECK_EQ(
+      reinterpret_cast<Address>(&chunk->allocated_lab_size_) - chunk->address(),
+      MemoryChunkLayout::kAllocatedLabSizeOffset);
+  DCHECK_EQ(
+      reinterpret_cast<Address>(&chunk->age_in_new_space_) - chunk->address(),
+      MemoryChunkLayout::kAgeInNewSpaceOffset);
 }
 #endif
 
diff --git a/deps/v8/src/heap/memory-chunk.h b/deps/v8/src/heap/memory-chunk.h
index 1061e5792c02c2..ea57a08ddd080c 100644
--- a/deps/v8/src/heap/memory-chunk.h
+++ b/deps/v8/src/heap/memory-chunk.h
@@ -12,7 +12,6 @@
 #include "src/common/globals.h"
 #include "src/heap/base/active-system-pages.h"
 #include "src/heap/basic-memory-chunk.h"
-#include "src/heap/invalidated-slots.h"
 #include "src/heap/list.h"
 #include "src/heap/marking.h"
 #include "src/heap/memory-chunk-layout.h"
@@ -21,10 +20,11 @@
 namespace v8 {
 namespace internal {
 
-class CodeObjectRegistry;
 class FreeListCategory;
 class Space;
 
+enum class MarkingMode { kNoMarking, kMinorMarking, kMajorMarking };
+
 // MemoryChunk represents a memory region owned by a specific space.
 // It is divided into the header and the body. Chunk start is always
 // 1MB aligned. Start of the body is aligned so it can accommodate
@@ -60,12 +60,12 @@ class MemoryChunk : public BasicMemoryChunk {
   }
 
   // Only works if the object is in the first kPageSize of the MemoryChunk.
-  static MemoryChunk* FromHeapObject(HeapObject o) {
+  static MemoryChunk* FromHeapObject(Tagged<HeapObject> o) {
     return cast(BasicMemoryChunk::FromHeapObject(o));
   }
 
   static MemoryChunk* cast(BasicMemoryChunk* chunk) {
-    SLOW_DCHECK(!chunk->InReadOnlySpace());
+    SLOW_DCHECK(!chunk || !chunk->InReadOnlySpace());
     return static_cast<MemoryChunk*>(chunk);
   }
 
@@ -76,8 +76,8 @@ class MemoryChunk : public BasicMemoryChunk {
 
   size_t buckets() const { return SlotSet::BucketsForSize(size()); }
 
-  void SetOldGenerationPageFlags(bool is_marking);
-  void SetYoungGenerationPageFlags(bool is_marking);
+  void SetOldGenerationPageFlags(MarkingMode marking_mode);
+  void SetYoungGenerationPageFlags(MarkingMode marking_mode);
 
   static inline void MoveExternalBackingStoreBytes(
       ExternalBackingStoreType type, MemoryChunk* from, MemoryChunk* to,
@@ -100,61 +100,64 @@ class MemoryChunk : public BasicMemoryChunk {
     return concurrent_sweeping_ == ConcurrentSweepingState::kDone;
   }
 
-  template <RememberedSetType type>
-  bool ContainsSlots() {
-    return slot_set<type>() != nullptr || typed_slot_set<type>() != nullptr ||
-           invalidated_slots<type>() != nullptr;
-  }
-
   template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
   SlotSet* slot_set() {
-    if (access_mode == AccessMode::ATOMIC)
+    if constexpr (access_mode == AccessMode::ATOMIC)
       return base::AsAtomicPointer::Acquire_Load(&slot_set_[type]);
     return slot_set_[type];
   }
 
+  template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
+  const SlotSet* slot_set() const {
+    return const_cast<MemoryChunk*>(this)->slot_set<type, access_mode>();
+  }
+
   template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
   TypedSlotSet* typed_slot_set() {
-    if (access_mode == AccessMode::ATOMIC)
+    if constexpr (access_mode == AccessMode::ATOMIC)
       return base::AsAtomicPointer::Acquire_Load(&typed_slot_set_[type]);
     return typed_slot_set_[type];
   }
 
-  template <RememberedSetType type>
-  V8_EXPORT_PRIVATE SlotSet* AllocateSlotSet();
-  SlotSet* AllocateSweepingSlotSet();
-  SlotSet* AllocateSlotSet(SlotSet** slot_set);
+  template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
+  const TypedSlotSet* typed_slot_set() const {
+    return const_cast<MemoryChunk*>(this)->typed_slot_set<type, access_mode>();
+  }
 
-  // Not safe to be called concurrently.
   template <RememberedSetType type>
-  void ReleaseSlotSet();
-  void ReleaseSlotSet(SlotSet** slot_set);
+  bool ContainsSlots() const {
+    return slot_set<type>() != nullptr || typed_slot_set<type>() != nullptr;
+  }
+  bool ContainsAnySlots() const;
 
-  template <RememberedSetType type>
-  TypedSlotSet* AllocateTypedSlotSet();
+  V8_EXPORT_PRIVATE SlotSet* AllocateSlotSet(RememberedSetType type);
   // Not safe to be called concurrently.
-  template <RememberedSetType type>
-  void ReleaseTypedSlotSet();
+  void ReleaseSlotSet(RememberedSetType type);
+  TypedSlotSet* AllocateTypedSlotSet(RememberedSetType type);
+  // Not safe to be called concurrently.
+  void ReleaseTypedSlotSet(RememberedSetType type);
 
   template <RememberedSetType type>
-  InvalidatedSlots* AllocateInvalidatedSlots();
-  template <RememberedSetType type>
-  void ReleaseInvalidatedSlots();
-  template <RememberedSetType type>
-  V8_EXPORT_PRIVATE void RegisterObjectWithInvalidatedSlots(HeapObject object,
-                                                            int new_size);
-  template <RememberedSetType type>
-  V8_EXPORT_PRIVATE void UpdateInvalidatedObjectSize(HeapObject object,
-                                                     int new_size);
-  template <RememberedSetType type>
-  bool RegisteredObjectWithInvalidatedSlots(HeapObject object);
-  template <RememberedSetType type>
-  InvalidatedSlots* invalidated_slots() {
-    return invalidated_slots_[type];
+  SlotSet* ExtractSlotSet() {
+    SlotSet* slot_set = slot_set_[type];
+    // Conditionally reset to nullptr (instead of e.g. using std::exchange) to
+    // avoid data races when transitioning from nullptr to nullptr.
+    if (slot_set) {
+      slot_set_[type] = nullptr;
+    }
+    return slot_set;
   }
 
-  bool HasRecordedSlots() const;
-  bool HasRecordedOldToNewSlots() const;
+  template <RememberedSetType type>
+  TypedSlotSet* ExtractTypedSlotSet() {
+    TypedSlotSet* typed_slot_set = typed_slot_set_[type];
+    // Conditionally reset to nullptr (instead of e.g. using std::exchange) to
+    // avoid data races when transitioning from nullptr to nullptr.
+    if (typed_slot_set) {
+      typed_slot_set_[type] = nullptr;
+    }
+    return typed_slot_set;
+  }
 
   int FreeListsLength();
 
@@ -173,7 +176,7 @@ class MemoryChunk : public BasicMemoryChunk {
                                                  size_t amount);
 
   size_t ExternalBackingStoreBytes(ExternalBackingStoreType type) const {
-    return external_backing_store_bytes_[type];
+    return external_backing_store_bytes_[static_cast<int>(type)];
   }
 
   Space* owner() const {
@@ -200,14 +203,17 @@ class MemoryChunk : public BasicMemoryChunk {
   V8_EXPORT_PRIVATE void SetReadable();
   V8_EXPORT_PRIVATE void SetReadAndExecutable();
 
-  V8_EXPORT_PRIVATE void SetCodeModificationPermissions();
+  // Used by the mprotect version of CodePageMemoryModificationScope to toggle
+  // the writable permission bit of the MemoryChunk.
+  // The returned MutexGuard protects the page from concurrent access. The
+  // caller needs to call SetDefaultCodePermissions before releasing the
+  // MutexGuard.
+  V8_EXPORT_PRIVATE base::MutexGuard SetCodeModificationPermissions();
   V8_EXPORT_PRIVATE void SetDefaultCodePermissions();
 
   heap::ListNode<MemoryChunk>& list_node() { return list_node_; }
   const heap::ListNode<MemoryChunk>& list_node() const { return list_node_; }
 
-  CodeObjectRegistry* GetCodeObjectRegistry() { return code_object_registry_; }
-
   PossiblyEmptyBuckets* possibly_empty_buckets() {
     return &possibly_empty_buckets_;
   }
@@ -216,9 +222,49 @@ class MemoryChunk : public BasicMemoryChunk {
   // read-only space chunks.
   void ReleaseAllocatedMemoryNeededForWritableChunk();
 
-  void MarkWasUsedForAllocation() { was_used_for_allocation_ = true; }
-  void ClearWasUsedForAllocation() { was_used_for_allocation_ = false; }
-  bool WasUsedForAllocation() const { return was_used_for_allocation_; }
+  void IncreaseAllocatedLabSize(size_t bytes) { allocated_lab_size_ += bytes; }
+  void DecreaseAllocatedLabSize(size_t bytes) {
+    DCHECK_GE(allocated_lab_size_, bytes);
+    allocated_lab_size_ -= bytes;
+  }
+  size_t AllocatedLabSize() const { return allocated_lab_size_; }
+
+  void IncrementAgeInNewSpace() { age_in_new_space_++; }
+  void ResetAgeInNewSpace() { age_in_new_space_ = 0; }
+  size_t AgeInNewSpace() const { return age_in_new_space_; }
+
+  void ResetAllocationStatistics() {
+    BasicMemoryChunk::ResetAllocationStatistics();
+    allocated_lab_size_ = 0;
+  }
+
+  MarkingBitmap* marking_bitmap() {
+    DCHECK(!InReadOnlySpace());
+    return &marking_bitmap_;
+  }
+
+  const MarkingBitmap* marking_bitmap() const {
+    DCHECK(!InReadOnlySpace());
+    return &marking_bitmap_;
+  }
+
+  size_t live_bytes() const {
+    return live_byte_count_.load(std::memory_order_relaxed);
+  }
+
+  void SetLiveBytes(size_t value) {
+    DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
+                   IsAligned(value, kObjectAlignment8GbHeap));
+    live_byte_count_.store(value, std::memory_order_relaxed);
+  }
+
+  void IncrementLiveBytesAtomically(intptr_t diff) {
+    DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
+                   IsAligned(diff, kObjectAlignment8GbHeap));
+    live_byte_count_.fetch_add(diff, std::memory_order_relaxed);
+  }
+
+  void ClearLiveness();
 
  protected:
   // Release all memory allocated by the chunk. Should be called when memory
@@ -243,59 +289,60 @@ class MemoryChunk : public BasicMemoryChunk {
     slot_set_[type] = slot_set;
   }
 
+  template <RememberedSetType type, AccessMode access_mode = AccessMode::ATOMIC>
+  void set_typed_slot_set(TypedSlotSet* typed_slot_set) {
+    if (access_mode == AccessMode::ATOMIC) {
+      base::AsAtomicPointer::Release_Store(&typed_slot_set_[type],
+                                           typed_slot_set);
+      return;
+    }
+    typed_slot_set_[type] = typed_slot_set;
+  }
+
+  // A single slot set for small pages (of size kPageSize) or an array of slot
+  // set for large pages. In the latter case the number of entries in the array
+  // is ceil(size() / kPageSize).
+  SlotSet* slot_set_[NUMBER_OF_REMEMBERED_SET_TYPES] = {nullptr};
   // A single slot set for small pages (of size kPageSize) or an array of slot
   // set for large pages. In the latter case the number of entries in the array
   // is ceil(size() / kPageSize).
-  SlotSet* slot_set_[NUMBER_OF_REMEMBERED_SET_TYPES];
+  TypedSlotSet* typed_slot_set_[NUMBER_OF_REMEMBERED_SET_TYPES] = {nullptr};
 
   // Used by the marker to keep track of the scanning progress in large objects
   // that have a progress bar and are scanned in increments.
   class ProgressBar progress_bar_;
 
   // Count of bytes marked black on page.
-  std::atomic<intptr_t> live_byte_count_;
-
-  // A single slot set for small pages (of size kPageSize) or an array of slot
-  // set for large pages. In the latter case the number of entries in the array
-  // is ceil(size() / kPageSize).
-  TypedSlotSet* typed_slot_set_[NUMBER_OF_REMEMBERED_SET_TYPES];
-  InvalidatedSlots* invalidated_slots_[NUMBER_OF_REMEMBERED_SET_TYPES];
+  std::atomic<intptr_t> live_byte_count_{0};
 
   base::Mutex* mutex_;
   base::SharedMutex* shared_mutex_;
-
-  std::atomic<ConcurrentSweepingState> concurrent_sweeping_;
-
   base::Mutex* page_protection_change_mutex_;
 
-  // This field is only relevant for code pages. It depicts the number of
-  // times a component requested this page to be read+writeable. The
-  // counter is decremented when a component resets to read+executable.
-  // If Value() == 0 => The memory is read and executable.
-  // If Value() >= 1 => The Memory is read and writable (and maybe executable).
-  // All executable MemoryChunks are allocated rw based on the assumption that
-  // they will be used immediately for an allocation. They are initialized
-  // with the number of open CodeSpaceMemoryModificationScopes. The caller
-  // that triggers the page allocation is responsible for decrementing the
-  // counter.
-  uintptr_t write_unprotect_counter_;
+  std::atomic<ConcurrentSweepingState> concurrent_sweeping_{
+      ConcurrentSweepingState::kDone};
 
   // Tracks off-heap memory used by this memory chunk.
-  std::atomic<size_t> external_backing_store_bytes_[kNumTypes];
+  std::atomic<size_t> external_backing_store_bytes_[static_cast<int>(
+      ExternalBackingStoreType::kNumValues)] = {0};
 
   heap::ListNode<MemoryChunk> list_node_;
 
-  FreeListCategory** categories_;
-
-  CodeObjectRegistry* code_object_registry_;
+  FreeListCategory** categories_ = nullptr;
 
   PossiblyEmptyBuckets possibly_empty_buckets_;
 
   ActiveSystemPages* active_system_pages_;
 
-  // Marks a chunk that was used for allocation since it was last swept. Used
+  // Counts overall allocated LAB size on the page since the last GC. Used
   // only for new space pages.
-  size_t was_used_for_allocation_ = false;
+  size_t allocated_lab_size_ = 0;
+
+  // Counts the number of young gen GCs that a page survived in new space. This
+  // counter is reset to 0 whenever the page is empty.
+  size_t age_in_new_space_ = 0;
+
+  MarkingBitmap marking_bitmap_;
 
  private:
   friend class ConcurrentMarkingState;
@@ -307,9 +354,20 @@ class MemoryChunk : public BasicMemoryChunk {
   friend class PagedSpace;
   template <RememberedSetType>
   friend class RememberedSet;
+  friend class YoungGenerationMarkingState;
 };
 
 }  // namespace internal
+
+namespace base {
+// Define special hash function for chunk pointers, to be used with std data
+// structures, e.g. std::unordered_set<MemoryChunk*, base::hash<MemoryChunk*>
+template <>
+struct hash<i::MemoryChunk*> : hash<i::BasicMemoryChunk*> {};
+template <>
+struct hash<const i::MemoryChunk*> : hash<const i::BasicMemoryChunk*> {};
+}  // namespace base
+
 }  // namespace v8
 
 #endif  // V8_HEAP_MEMORY_CHUNK_H_
diff --git a/deps/v8/src/heap/memory-measurement-inl.h b/deps/v8/src/heap/memory-measurement-inl.h
index 6924bbf1b1e900..0810ab40b578ba 100644
--- a/deps/v8/src/heap/memory-measurement-inl.h
+++ b/deps/v8/src/heap/memory-measurement-inl.h
@@ -16,9 +16,10 @@
 namespace v8 {
 namespace internal {
 
-bool NativeContextInferrer::Infer(Isolate* isolate, Map map, HeapObject object,
+bool NativeContextInferrer::Infer(Isolate* isolate, Tagged<Map> map,
+                                  Tagged<HeapObject> object,
                                   Address* native_context) {
-  switch (map.visitor_id()) {
+  switch (map->visitor_id()) {
     case kVisitContext:
       return InferForContext(isolate, Context::cast(object), native_context);
     case kVisitNativeContext:
@@ -41,14 +42,15 @@ bool NativeContextInferrer::Infer(Isolate* isolate, Map map, HeapObject object,
   }
 }
 
-V8_INLINE bool NativeContextStats::HasExternalBytes(Map map) {
-  InstanceType instance_type = map.instance_type();
+V8_INLINE bool NativeContextStats::HasExternalBytes(Tagged<Map> map) {
+  InstanceType instance_type = map->instance_type();
   return (instance_type == JS_ARRAY_BUFFER_TYPE ||
           InstanceTypeChecker::IsExternalString(instance_type));
 }
 
-V8_INLINE void NativeContextStats::IncrementSize(Address context, Map map,
-                                                 HeapObject object,
+V8_INLINE void NativeContextStats::IncrementSize(Address context,
+                                                 Tagged<Map> map,
+                                                 Tagged<HeapObject> object,
                                                  size_t size) {
   size_by_context_[context] += size;
   if (HasExternalBytes(map)) {
diff --git a/deps/v8/src/heap/memory-measurement.cc b/deps/v8/src/heap/memory-measurement.cc
index 6a764cb8f5f23c..5fcec4bc783e21 100644
--- a/deps/v8/src/heap/memory-measurement.cc
+++ b/deps/v8/src/heap/memory-measurement.cc
@@ -17,6 +17,11 @@
 #include "src/objects/smi.h"
 #include "src/tasks/task-utils.h"
 
+#if V8_ENABLE_WEBASSEMBLY
+#include "src/wasm/wasm-code-manager.h"
+#include "src/wasm/wasm-engine.h"
+#endif
+
 namespace v8 {
 namespace internal {
 
@@ -40,6 +45,15 @@ class MemoryMeasurementResultBuilder {
     detailed_ = true;
     other_.push_back(NewResult(estimate, lower_bound, upper_bound));
   }
+  void AddWasm(size_t code, size_t metadata) {
+    Handle<JSObject> wasm = NewJSObject();
+    AddProperty(wasm, factory_->NewStringFromAsciiChecked("code"),
+                NewNumber(code));
+    AddProperty(wasm, factory_->NewStringFromAsciiChecked("metadata"),
+                NewNumber(metadata));
+    AddProperty(result_, factory_->NewStringFromAsciiChecked("WebAssembly"),
+                wasm);
+  }
   Handle<JSObject> Build() {
     if (detailed_) {
       int length = static_cast<int>(other_.size());
@@ -98,10 +112,7 @@ class V8_EXPORT_PRIVATE MeasureMemoryDelegate
 
   // v8::MeasureMemoryDelegate overrides:
   bool ShouldMeasure(v8::Local<v8::Context> context) override;
-  void MeasurementComplete(
-      const std::vector<std::pair<v8::Local<v8::Context>, size_t>>&
-          context_sizes_in_bytes,
-      size_t unattributed_size_in_bytes) override;
+  void MeasurementComplete(Result result) override;
 
  private:
   Isolate* isolate_;
@@ -130,16 +141,16 @@ bool MeasureMemoryDelegate::ShouldMeasure(v8::Local<v8::Context> context) {
   return context_->security_token() == native_context->security_token();
 }
 
-void MeasureMemoryDelegate::MeasurementComplete(
-    const std::vector<std::pair<v8::Local<v8::Context>, size_t>>&
-        context_sizes_in_bytes,
-    size_t shared_size) {
+void MeasureMemoryDelegate::MeasurementComplete(Result result) {
+  size_t shared_size = result.unattributed_size_in_bytes;
+  size_t wasm_code = result.wasm_code_size_in_bytes;
+  size_t wasm_metadata = result.wasm_metadata_size_in_bytes;
   v8::Local<v8::Context> v8_context =
       Utils::Convert<HeapObject, v8::Context>(context_);
   v8::Context::Scope scope(v8_context);
   size_t total_size = 0;
   size_t current_size = 0;
-  for (const auto& context_and_size : context_sizes_in_bytes) {
+  for (const auto& context_and_size : result.context_sizes_in_bytes) {
     total_size += context_and_size.second;
     if (*Utils::OpenHandle(*context_and_size.first) == *context_) {
       current_size = context_and_size.second;
@@ -147,11 +158,14 @@ void MeasureMemoryDelegate::MeasurementComplete(
   }
   MemoryMeasurementResultBuilder result_builder(isolate_, isolate_->factory());
   result_builder.AddTotal(total_size, total_size, total_size + shared_size);
+  if (wasm_code > 0 || wasm_metadata > 0) {
+    result_builder.AddWasm(wasm_code, wasm_metadata);
+  }
 
   if (mode_ == v8::MeasureMemoryMode::kDetailed) {
     result_builder.AddCurrent(current_size, current_size,
                               current_size + shared_size);
-    for (const auto& context_and_size : context_sizes_in_bytes) {
+    for (const auto& context_and_size : result.context_sizes_in_bytes) {
       if (*Utils::OpenHandle(*context_and_size.first) != *context_) {
         size_t other_size = context_and_size.second;
         result_builder.AddOther(other_size, other_size,
@@ -160,12 +174,14 @@ void MeasureMemoryDelegate::MeasurementComplete(
     }
   }
 
-  Handle<JSObject> result = result_builder.Build();
-  JSPromise::Resolve(promise_, result).ToHandleChecked();
+  Handle<JSObject> jsresult = result_builder.Build();
+  JSPromise::Resolve(promise_, jsresult).ToHandleChecked();
 }
 
 MemoryMeasurement::MemoryMeasurement(Isolate* isolate)
-    : isolate_(isolate), random_number_generator_() {
+    : isolate_(isolate),
+      task_runner_(isolate->heap()->GetForegroundTaskRunner()),
+      random_number_generator_() {
   if (v8_flags.random_seed) {
     random_number_generator_.SetSeed(v8_flags.random_seed);
   }
@@ -183,11 +199,13 @@ bool MemoryMeasurement::EnqueueRequest(
   }
   Handle<WeakFixedArray> global_weak_contexts =
       isolate_->global_handles()->Create(*weak_contexts);
-  Request request = {std::move(delegate),
-                     global_weak_contexts,
-                     std::vector<size_t>(length),
-                     0u,
-                     {}};
+  Request request = {std::move(delegate),          // delegate
+                     global_weak_contexts,         // contexts
+                     std::vector<size_t>(length),  // sizes
+                     0u,                           // shared
+                     0u,                           // wasm_code
+                     0u,                           // wasm_metadata
+                     {}};                          // timer
   request.timer.Start();
   received_.push_back(std::move(request));
   ScheduleGCTask(execution);
@@ -202,7 +220,7 @@ std::vector<Address> MemoryMeasurement::StartProcessing() {
   for (const auto& request : processing_) {
     Handle<WeakFixedArray> contexts = request.contexts;
     for (int i = 0; i < contexts->length(); i++) {
-      HeapObject context;
+      Tagged<HeapObject> context;
       if (contexts->Get(i).GetHeapObject(&context)) {
         unique_contexts.insert(context.ptr());
       }
@@ -214,17 +232,28 @@ std::vector<Address> MemoryMeasurement::StartProcessing() {
 void MemoryMeasurement::FinishProcessing(const NativeContextStats& stats) {
   if (processing_.empty()) return;
 
+  size_t shared = stats.Get(MarkingWorklists::kSharedContext);
+#if V8_ENABLE_WEBASSEMBLY
+  size_t wasm_code = wasm::GetWasmCodeManager()->committed_code_space();
+  size_t wasm_metadata =
+      wasm::GetWasmEngine()->EstimateCurrentMemoryConsumption();
+#endif
+
   while (!processing_.empty()) {
     Request request = std::move(processing_.front());
     processing_.pop_front();
     for (int i = 0; i < static_cast<int>(request.sizes.size()); i++) {
-      HeapObject context;
+      Tagged<HeapObject> context;
       if (!request.contexts->Get(i).GetHeapObject(&context)) {
         continue;
       }
       request.sizes[i] = stats.Get(context.ptr());
     }
-    request.shared = stats.Get(MarkingWorklists::kSharedContext);
+    request.shared = shared;
+#if V8_ENABLE_WEBASSEMBLY
+    request.wasm_code = wasm_code;
+    request.wasm_metadata = wasm_metadata;
+#endif
     done_.push_back(std::move(request));
   }
   ScheduleReportingTask();
@@ -233,9 +262,7 @@ void MemoryMeasurement::FinishProcessing(const NativeContextStats& stats) {
 void MemoryMeasurement::ScheduleReportingTask() {
   if (reporting_task_pending_) return;
   reporting_task_pending_ = true;
-  auto taskrunner = V8::GetCurrentPlatform()->GetForegroundTaskRunner(
-      reinterpret_cast<v8::Isolate*>(isolate_));
-  taskrunner->PostTask(MakeCancelableTask(isolate_, [this] {
+  task_runner_->PostTask(MakeCancelableTask(isolate_, [this] {
     reporting_task_pending_ = false;
     ReportResults();
   }));
@@ -273,15 +300,13 @@ void MemoryMeasurement::ScheduleGCTask(v8::MeasureMemoryExecution execution) {
   if (execution == v8::MeasureMemoryExecution::kLazy) return;
   if (IsGCTaskPending(execution)) return;
   SetGCTaskPending(execution);
-  auto taskrunner = V8::GetCurrentPlatform()->GetForegroundTaskRunner(
-      reinterpret_cast<v8::Isolate*>(isolate_));
   auto task = MakeCancelableTask(isolate_, [this, execution] {
     SetGCTaskDone(execution);
     if (received_.empty()) return;
     Heap* heap = isolate_->heap();
     if (v8_flags.incremental_marking) {
       if (heap->incremental_marking()->IsStopped()) {
-        heap->StartIncrementalMarking(Heap::kNoGCFlags,
+        heap->StartIncrementalMarking(GCFlag::kNoFlags,
                                       GarbageCollectionReason::kMeasureMemory);
       } else {
         if (execution == v8::MeasureMemoryExecution::kEager) {
@@ -295,9 +320,9 @@ void MemoryMeasurement::ScheduleGCTask(v8::MeasureMemoryExecution execution) {
     }
   });
   if (execution == v8::MeasureMemoryExecution::kEager) {
-    taskrunner->PostTask(std::move(task));
+    task_runner_->PostTask(std::move(task));
   } else {
-    taskrunner->PostDelayedTask(std::move(task), NextGCTaskDelayInSeconds());
+    task_runner_->PostDelayedTask(std::move(task), NextGCTaskDelayInSeconds());
   }
 }
 
@@ -315,7 +340,7 @@ void MemoryMeasurement::ReportResults() {
     DCHECK_EQ(request.sizes.size(),
               static_cast<size_t>(request.contexts->length()));
     for (int i = 0; i < request.contexts->length(); i++) {
-      HeapObject raw_context;
+      Tagged<HeapObject> raw_context;
       if (!request.contexts->Get(i).GetHeapObject(&raw_context)) {
         continue;
       }
@@ -323,7 +348,12 @@ void MemoryMeasurement::ReportResults() {
           handle(raw_context, isolate_));
       sizes.push_back(std::make_pair(context, request.sizes[i]));
     }
+    START_ALLOW_USE_DEPRECATED()
+    // Temporarily call both old and new callbacks.
     request.delegate->MeasurementComplete(sizes, request.shared);
+    END_ALLOW_USE_DEPRECATED()
+    request.delegate->MeasurementComplete(
+        {sizes, request.shared, request.wasm_code, request.wasm_metadata});
     isolate_->counters()->measure_memory_delay_ms()->AddSample(
         static_cast<int>(request.timer.Elapsed().InMilliseconds()));
   }
@@ -336,14 +366,15 @@ std::unique_ptr<v8::MeasureMemoryDelegate> MemoryMeasurement::DefaultDelegate(
                                                  mode);
 }
 
-bool NativeContextInferrer::InferForContext(Isolate* isolate, Context context,
+bool NativeContextInferrer::InferForContext(Isolate* isolate,
+                                            Tagged<Context> context,
                                             Address* native_context) {
   PtrComprCageBase cage_base(isolate);
-  Map context_map = context.map(cage_base, kAcquireLoad);
-  Object maybe_native_context =
+  Tagged<Map> context_map = context->map(cage_base, kAcquireLoad);
+  Tagged<Object> maybe_native_context =
       TaggedField<Object, Map::kConstructorOrBackPointerOrNativeContextOffset>::
           Acquire_Load(cage_base, context_map);
-  if (maybe_native_context.IsNativeContext(cage_base)) {
+  if (IsNativeContext(maybe_native_context, cage_base)) {
     *native_context = maybe_native_context.ptr();
     return true;
   }
@@ -351,38 +382,38 @@ bool NativeContextInferrer::InferForContext(Isolate* isolate, Context context,
 }
 
 bool NativeContextInferrer::InferForJSFunction(Isolate* isolate,
-                                               JSFunction function,
+                                               Tagged<JSFunction> function,
                                                Address* native_context) {
-  Object maybe_context =
+  Tagged<Object> maybe_context =
       TaggedField<Object, JSFunction::kContextOffset>::Acquire_Load(isolate,
                                                                     function);
   // The context may be a smi during deserialization.
-  if (maybe_context.IsSmi()) {
+  if (IsSmi(maybe_context)) {
     DCHECK_EQ(maybe_context, Smi::uninitialized_deserialization_value());
     return false;
   }
-  if (!maybe_context.IsContext()) {
+  if (!IsContext(maybe_context)) {
     // The function does not have a context.
     return false;
   }
   return InferForContext(isolate, Context::cast(maybe_context), native_context);
 }
 
-bool NativeContextInferrer::InferForJSObject(Isolate* isolate, Map map,
-                                             JSObject object,
+bool NativeContextInferrer::InferForJSObject(Isolate* isolate, Tagged<Map> map,
+                                             Tagged<JSObject> object,
                                              Address* native_context) {
-  if (map.instance_type() == JS_GLOBAL_OBJECT_TYPE) {
-    Object maybe_context =
-        JSGlobalObject::cast(object).native_context_unchecked(isolate);
-    if (maybe_context.IsNativeContext()) {
+  if (map->instance_type() == JS_GLOBAL_OBJECT_TYPE) {
+    Tagged<Object> maybe_context =
+        JSGlobalObject::cast(object)->native_context_unchecked(isolate);
+    if (IsNativeContext(maybe_context)) {
       *native_context = maybe_context.ptr();
       return true;
     }
   }
   // The maximum number of steps to perform when looking for the context.
   const int kMaxSteps = 3;
-  Object maybe_constructor = map.TryGetConstructor(isolate, kMaxSteps);
-  if (maybe_constructor.IsJSFunction()) {
+  Tagged<Object> maybe_constructor = map->TryGetConstructor(isolate, kMaxSteps);
+  if (IsJSFunction(maybe_constructor)) {
     return InferForJSFunction(isolate, JSFunction::cast(maybe_constructor),
                               native_context);
   }
@@ -397,15 +428,15 @@ void NativeContextStats::Merge(const NativeContextStats& other) {
   }
 }
 
-void NativeContextStats::IncrementExternalSize(Address context, Map map,
-                                               HeapObject object) {
-  InstanceType instance_type = map.instance_type();
+void NativeContextStats::IncrementExternalSize(Address context, Tagged<Map> map,
+                                               Tagged<HeapObject> object) {
+  InstanceType instance_type = map->instance_type();
   size_t external_size = 0;
   if (instance_type == JS_ARRAY_BUFFER_TYPE) {
-    external_size = JSArrayBuffer::cast(object).GetByteLength();
+    external_size = JSArrayBuffer::cast(object)->GetByteLength();
   } else {
     DCHECK(InstanceTypeChecker::IsExternalString(instance_type));
-    external_size = ExternalString::cast(object).ExternalPayloadSize();
+    external_size = ExternalString::cast(object)->ExternalPayloadSize();
   }
   size_by_context_[context] += external_size;
 }
diff --git a/deps/v8/src/heap/memory-measurement.h b/deps/v8/src/heap/memory-measurement.h
index 2b5377943c4f17..9a01fafe9b566f 100644
--- a/deps/v8/src/heap/memory-measurement.h
+++ b/deps/v8/src/heap/memory-measurement.h
@@ -43,6 +43,8 @@ class MemoryMeasurement {
     Handle<WeakFixedArray> contexts;
     std::vector<size_t> sizes;
     size_t shared;
+    size_t wasm_code;
+    size_t wasm_metadata;
     base::ElapsedTimer timer;
   };
   void ScheduleReportingTask();
@@ -57,6 +59,7 @@ class MemoryMeasurement {
   std::list<Request> processing_;
   std::list<Request> done_;
   Isolate* isolate_;
+  std::shared_ptr<v8::TaskRunner> task_runner_;
   bool reporting_task_pending_ = false;
   bool delayed_gc_task_pending_ = false;
   bool eager_gc_task_pending_ = false;
@@ -70,23 +73,23 @@ class V8_EXPORT_PRIVATE NativeContextInferrer {
   // It should be initialized to the context that will be used for the object
   // if the inference is not successful. The function performs more work if the
   // context is the shared context.
-  V8_INLINE bool Infer(Isolate* isolate, Map map, HeapObject object,
-                       Address* native_context);
+  V8_INLINE bool Infer(Isolate* isolate, Tagged<Map> map,
+                       Tagged<HeapObject> object, Address* native_context);
 
  private:
-  bool InferForContext(Isolate* isolate, Context context,
+  bool InferForContext(Isolate* isolate, Tagged<Context> context,
                        Address* native_context);
-  bool InferForJSFunction(Isolate* isolate, JSFunction function,
+  bool InferForJSFunction(Isolate* isolate, Tagged<JSFunction> function,
                           Address* native_context);
-  bool InferForJSObject(Isolate* isolate, Map map, JSObject object,
-                        Address* native_context);
+  bool InferForJSObject(Isolate* isolate, Tagged<Map> map,
+                        Tagged<JSObject> object, Address* native_context);
 };
 
 // Maintains mapping from native contexts to their sizes.
 class V8_EXPORT_PRIVATE NativeContextStats {
  public:
-  V8_INLINE void IncrementSize(Address context, Map map, HeapObject object,
-                               size_t size);
+  V8_INLINE void IncrementSize(Address context, Tagged<Map> map,
+                               Tagged<HeapObject> object, size_t size);
 
   size_t Get(Address context) const {
     const auto it = size_by_context_.find(context);
@@ -96,9 +99,12 @@ class V8_EXPORT_PRIVATE NativeContextStats {
   void Clear();
   void Merge(const NativeContextStats& other);
 
+  bool Empty() const { return size_by_context_.empty(); }
+
  private:
-  V8_INLINE bool HasExternalBytes(Map map);
-  void IncrementExternalSize(Address context, Map map, HeapObject object);
+  V8_INLINE bool HasExternalBytes(Tagged<Map> map);
+  void IncrementExternalSize(Address context, Tagged<Map> map,
+                             Tagged<HeapObject> object);
   std::unordered_map<Address, size_t> size_by_context_;
 };
 
diff --git a/deps/v8/src/heap/memory-reducer.cc b/deps/v8/src/heap/memory-reducer.cc
index 816a2d2f5c2fb2..1b065c1cbec7d6 100644
--- a/deps/v8/src/heap/memory-reducer.cc
+++ b/deps/v8/src/heap/memory-reducer.cc
@@ -17,14 +17,12 @@ namespace internal {
 const int MemoryReducer::kLongDelayMs = 8000;
 const int MemoryReducer::kShortDelayMs = 500;
 const int MemoryReducer::kWatchdogDelayMs = 100000;
-const int MemoryReducer::kMaxNumberOfGCs = 3;
 const double MemoryReducer::kCommittedMemoryFactor = 1.1;
 const size_t MemoryReducer::kCommittedMemoryDelta = 10 * MB;
 
 MemoryReducer::MemoryReducer(Heap* heap)
     : heap_(heap),
-      taskrunner_(V8::GetCurrentPlatform()->GetForegroundTaskRunner(
-          reinterpret_cast<v8::Isolate*>(heap->isolate()))),
+      taskrunner_(heap->GetForegroundTaskRunner()),
       state_(State::CreateUninitialized()),
       js_calls_counter_(0),
       js_calls_sample_time_ms_(0.0) {
@@ -40,12 +38,13 @@ MemoryReducer::TimerTask::TimerTask(MemoryReducer* memory_reducer)
 void MemoryReducer::TimerTask::RunInternal() {
   Heap* heap = memory_reducer_->heap();
   const double time_ms = heap->MonotonicallyIncreasingTimeInMs();
-  heap->tracer()->SampleAllocation(time_ms, heap->NewSpaceAllocationCounter(),
+  heap->tracer()->SampleAllocation(base::TimeTicks::Now(),
+                                   heap->NewSpaceAllocationCounter(),
                                    heap->OldGenerationAllocationCounter(),
                                    heap->EmbedderAllocationCounter());
   const bool low_allocation_rate = heap->HasLowAllocationRate();
   const bool optimize_for_memory = heap->ShouldOptimizeForMemoryUsage();
-  if (v8_flags.trace_gc_verbose) {
+  if (v8_flags.trace_memory_reducer) {
     heap->isolate()->PrintWithTimestamp(
         "Memory reducer: %s, %s\n",
         low_allocation_rate ? "low alloc" : "high alloc",
@@ -74,24 +73,17 @@ void MemoryReducer::NotifyTimer(const Event& event) {
   if (state_.id() == kRun) {
     DCHECK(heap()->incremental_marking()->IsStopped());
     DCHECK(v8_flags.incremental_marking);
-    if (v8_flags.trace_gc_verbose) {
+    if (v8_flags.trace_memory_reducer) {
       heap()->isolate()->PrintWithTimestamp("Memory reducer: started GC #%d\n",
                                             state_.started_gcs());
     }
-    heap()->StartIncrementalMarking(Heap::kReduceMemoryFootprintMask,
+    heap()->StartIncrementalMarking(GCFlag::kReduceMemoryFootprint,
                                     GarbageCollectionReason::kMemoryReducer,
                                     kGCCallbackFlagCollectAllExternalMemory);
   } else if (state_.id() == kWait) {
-    if (!heap()->incremental_marking()->IsStopped() &&
-        heap()->ShouldOptimizeForMemoryUsage()) {
-      // Make progress with pending incremental marking if memory usage has
-      // higher priority than latency. This is important for background tabs
-      // that do not send idle notifications.
-      heap()->incremental_marking()->AdvanceAndFinalizeIfComplete();
-    }
     // Re-schedule the timer.
     ScheduleTimer(state_.next_gc_start_ms() - event.time_ms);
-    if (v8_flags.trace_gc_verbose) {
+    if (v8_flags.trace_memory_reducer) {
       heap()->isolate()->PrintWithTimestamp(
           "Memory reducer: waiting for %.f ms\n",
           state_.next_gc_start_ms() - event.time_ms);
@@ -114,19 +106,16 @@ void MemoryReducer::NotifyMarkCompact(size_t committed_memory_before) {
           heap()->HasHighFragmentation(),
       false,
       false};
-  const Id old_action = state_.id();
-  int old_started_gcs = state_.started_gcs();
+  const State old_state = state_;
   state_ = Step(state_, event);
-  if (old_action != kWait && state_.id() == kWait) {
+  if (old_state.id() != kWait && state_.id() == kWait) {
     // If we are transitioning to the WAIT state, start the timer.
     ScheduleTimer(state_.next_gc_start_ms() - event.time_ms);
   }
-  if (old_action == kRun) {
-    if (v8_flags.trace_gc_verbose) {
-      heap()->isolate()->PrintWithTimestamp(
-          "Memory reducer: finished GC #%d (%s)\n", old_started_gcs,
-          state_.id() == kWait ? "will do more" : "done");
-    }
+  if (old_state.id() == kRun && v8_flags.trace_memory_reducer) {
+    heap()->isolate()->PrintWithTimestamp(
+        "Memory reducer: finished GC #%d (%s)\n", old_state.started_gcs(),
+        state_.id() == kWait ? "will do more" : "done");
   }
 }
 
@@ -158,10 +147,8 @@ MemoryReducer::State MemoryReducer::Step(const State& state,
   DCHECK(v8_flags.incremental_marking);
 
   switch (state.id()) {
+    case kUninit:
     case kDone:
-      CHECK_IMPLIES(
-          v8_flags.memory_reducer_single_gc,
-          state.started_gcs() == 0 || state.started_gcs() == kMaxNumberOfGCs);
       if (event.type == kTimer) {
         return state;
       } else if (event.type == kMarkCompact) {
@@ -182,13 +169,12 @@ MemoryReducer::State MemoryReducer::Step(const State& state,
             state.last_gc_time_ms());
       }
     case kWait:
-      CHECK_IMPLIES(v8_flags.memory_reducer_single_gc,
-                    state.started_gcs() == 0);
+      CHECK_LE(state.started_gcs(), MaxNumberOfGCs());
       switch (event.type) {
         case kPossibleGarbage:
           return state;
         case kTimer:
-          if (state.started_gcs() >= kMaxNumberOfGCs) {
+          if (state.started_gcs() >= MaxNumberOfGCs()) {
             return State::CreateDone(state.last_gc_time_ms(),
                                      event.committed_memory);
           } else if (event.can_start_incremental_gc &&
@@ -209,11 +195,9 @@ MemoryReducer::State MemoryReducer::Step(const State& state,
                                    event.time_ms + kLongDelayMs, event.time_ms);
       }
     case kRun:
-      CHECK_IMPLIES(v8_flags.memory_reducer_single_gc,
-                    state.started_gcs() == 1);
+      CHECK_LE(state.started_gcs(), MaxNumberOfGCs());
       if (event.type == kMarkCompact) {
-        if (!v8_flags.memory_reducer_single_gc &&
-            state.started_gcs() < kMaxNumberOfGCs &&
+        if (state.started_gcs() < MaxNumberOfGCs() &&
             (event.next_gc_likely_to_collect_more ||
              state.started_gcs() == 1)) {
           return State::CreateWait(state.started_gcs(),
@@ -240,5 +224,12 @@ void MemoryReducer::ScheduleTimer(double delay_ms) {
 
 void MemoryReducer::TearDown() { state_ = State::CreateUninitialized(); }
 
+// static
+int MemoryReducer::MaxNumberOfGCs() {
+  if (v8_flags.memory_reducer_single_gc) return 1;
+  DCHECK_GT(v8_flags.memory_reducer_gc_count, 0);
+  return v8_flags.memory_reducer_gc_count;
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/memory-reducer.h b/deps/v8/src/heap/memory-reducer.h
index 1f1f9cef1520c2..adbfbf1bac36ad 100644
--- a/deps/v8/src/heap/memory-reducer.h
+++ b/deps/v8/src/heap/memory-reducer.h
@@ -86,14 +86,14 @@ class Heap;
 // long_delay_ms, short_delay_ms, and watchdog_delay_ms are constants.
 class V8_EXPORT_PRIVATE MemoryReducer {
  public:
-  enum Id { kDone, kWait, kRun };
+  enum Id { kUninit, kDone, kWait, kRun };
 
   class State {
    public:
-    static State CreateUninitialized() { return {kDone, 0, 0, 0, 0}; }
+    static State CreateUninitialized() { return {kUninit, 0, 0, 0, 0}; }
 
     static State CreateDone(double last_gc_time_ms, size_t committed_memory) {
-      return {kDone, kMaxNumberOfGCs, 0, last_gc_time_ms, committed_memory};
+      return {kDone, 0, 0, last_gc_time_ms, committed_memory};
     }
 
     static State CreateWait(int started_gcs, double next_gc_time_ms,
@@ -108,7 +108,7 @@ class V8_EXPORT_PRIVATE MemoryReducer {
     Id id() const { return id_; }
 
     int started_gcs() const {
-      DCHECK(id() == kWait || id() == kRun || id() == kDone);
+      DCHECK(id() == kWait || id() == kRun);
       return started_gcs_;
     }
 
@@ -118,12 +118,12 @@ class V8_EXPORT_PRIVATE MemoryReducer {
     }
 
     double last_gc_time_ms() const {
-      DCHECK(id() == kWait || id() == kDone);
+      DCHECK(id() == kWait || id() == kDone || id() == kUninit);
       return last_gc_time_ms_;
     }
 
     size_t committed_memory_at_last_run() const {
-      DCHECK_EQ(id(), kDone);
+      DCHECK(id() == kUninit || id() == kDone);
       return committed_memory_at_last_run_;
     }
 
@@ -169,7 +169,6 @@ class V8_EXPORT_PRIVATE MemoryReducer {
   static const int kLongDelayMs;
   static const int kShortDelayMs;
   static const int kWatchdogDelayMs;
-  static const int kMaxNumberOfGCs;
   // The committed memory has to increase by at least this factor since the
   // last run in order to trigger a new run after mark-compact.
   static const double kCommittedMemoryFactor;
@@ -179,9 +178,9 @@ class V8_EXPORT_PRIVATE MemoryReducer {
 
   Heap* heap() { return heap_; }
 
-  bool ShouldGrowHeapSlowly() {
-    return state_.id() == kDone && state_.started_gcs() > 0;
-  }
+  bool ShouldGrowHeapSlowly() { return state_.id() == kDone; }
+
+  static int MaxNumberOfGCs();
 
  private:
   class TimerTask : public v8::internal::CancelableTask {
diff --git a/deps/v8/src/heap/minor-gc-job.cc b/deps/v8/src/heap/minor-gc-job.cc
index 36e2af56ef0e41..3324a086f5c128 100644
--- a/deps/v8/src/heap/minor-gc-job.cc
+++ b/deps/v8/src/heap/minor-gc-job.cc
@@ -4,6 +4,8 @@
 
 #include "src/heap/minor-gc-job.h"
 
+#include <memory>
+
 #include "src/base/platform/time.h"
 #include "src/execution/isolate.h"
 #include "src/execution/vm-state-inl.h"
@@ -11,6 +13,7 @@
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap.h"
 #include "src/init/v8.h"
+#include "src/tasks/cancelable-task.h"
 
 namespace v8 {
 namespace internal {
@@ -39,35 +42,60 @@ bool MinorGCJob::YoungGenerationSizeTaskTriggerReached(Heap* heap) {
   return heap->new_space()->Size() >= YoungGenerationTaskTriggerSize(heap);
 }
 
-void MinorGCJob::ScheduleTaskIfNeeded(Heap* heap) {
+void MinorGCJob::ScheduleTask() {
   if (!v8_flags.minor_gc_task) return;
-  if (task_pending_) return;
-  if (heap->IsTearingDown()) return;
-  if (!YoungGenerationSizeTaskTriggerReached(heap)) return;
-  v8::Isolate* isolate = reinterpret_cast<v8::Isolate*>(heap->isolate());
-  auto taskrunner = V8::GetCurrentPlatform()->GetForegroundTaskRunner(isolate);
+  if (current_task_id_ != CancelableTaskManager::kInvalidTaskId) return;
+  if (heap_->IsTearingDown()) return;
+  // A task should be scheduled when young generation size reaches the task
+  // trigger, but may also occur before the trigger is reached. For example,
+  // this method is called from the allocation observer for new space. The
+  // observer step size is detemine based on the current task trigger. However,
+  // due to refining allocated bytes after sweeping (allocated bytes after
+  // sweeping may be less than live bytes during marking), new space size may
+  // decrease while the observer step size remains the same.
+  if (v8_flags.minor_ms && heap_->ShouldOptimizeForLoadTime()) {
+    task_requested_ = true;
+    return;
+  }
+  task_requested_ = false;
+  std::shared_ptr<v8::TaskRunner> taskrunner = heap_->GetForegroundTaskRunner();
   if (taskrunner->NonNestableTasksEnabled()) {
-    taskrunner->PostNonNestableTask(
-        std::make_unique<Task>(heap->isolate(), this));
-    task_pending_ = true;
+    std::unique_ptr<Task> task = std::make_unique<Task>(heap_->isolate(), this);
+    current_task_id_ = task->id();
+    taskrunner->PostNonNestableTask(std::move(task));
   }
 }
 
+void MinorGCJob::SchedulePreviouslyRequestedTask() {
+  if (!task_requested_) return;
+  ScheduleTask();
+}
+
+void MinorGCJob::CancelTaskIfScheduled() {
+  if (current_task_id_ == CancelableTaskManager::kInvalidTaskId) return;
+  // The task may have ran and bailed out already if major incremental marking
+  // was running, in which `TryAbort` will return `kTaskRemoved`.
+  heap_->isolate()->cancelable_task_manager()->TryAbort(current_task_id_);
+  current_task_id_ = CancelableTaskManager::kInvalidTaskId;
+}
+
 void MinorGCJob::Task::RunInternal() {
   VMState<GC> state(isolate());
-  TRACE_EVENT_CALL_STATS_SCOPED(isolate(), "v8", "V8.Task");
+  TRACE_EVENT_CALL_STATS_SCOPED(isolate(), "v8", "V8.MinorGCJob.Task");
 
-  job_->task_pending_ = false;
+  DCHECK_EQ(job_->current_task_id_, id());
+  job_->current_task_id_ = CancelableTaskManager::kInvalidTaskId;
 
-  if (v8_flags.minor_mc &&
+  Heap* heap = isolate()->heap();
+  DCHECK_IMPLIES(v8_flags.minor_ms, !heap->ShouldOptimizeForLoadTime());
+
+  if (v8_flags.minor_ms &&
       isolate()->heap()->incremental_marking()->IsMajorMarking()) {
-    // Don't trigger a MinorMC cycle while major incremental marking is active.
+    // Don't trigger a MinorMS cycle while major incremental marking is active.
     return;
   }
-  if (!MinorGCJob::YoungGenerationSizeTaskTriggerReached(isolate()->heap()))
-    return;
 
-  isolate()->heap()->CollectGarbage(NEW_SPACE, GarbageCollectionReason::kTask);
+  heap->CollectGarbage(NEW_SPACE, GarbageCollectionReason::kTask);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/minor-gc-job.h b/deps/v8/src/heap/minor-gc-job.h
index a3aa8b6dcfb65d..2d827c9413bfd5 100644
--- a/deps/v8/src/heap/minor-gc-job.h
+++ b/deps/v8/src/heap/minor-gc-job.h
@@ -18,9 +18,12 @@ class Isolate;
 // Scavenge garbage collection. The job posts a foreground task.
 class MinorGCJob {
  public:
-  MinorGCJob() V8_NOEXCEPT = default;
+  explicit MinorGCJob(Heap* heap) V8_NOEXCEPT : heap_(heap) {}
 
-  void ScheduleTaskIfNeeded(Heap* heap);
+  void ScheduleTask();
+  void SchedulePreviouslyRequestedTask();
+
+  void CancelTaskIfScheduled();
 
   static size_t YoungGenerationTaskTriggerSize(Heap* heap);
 
@@ -29,7 +32,10 @@ class MinorGCJob {
 
   static bool YoungGenerationSizeTaskTriggerReached(Heap* heap);
 
-  bool task_pending_ = false;
+  Heap* const heap_;
+  CancelableTaskManager::Id current_task_id_ =
+      CancelableTaskManager::kInvalidTaskId;
+  bool task_requested_ = false;
 };
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/minor-mark-sweep-inl.h b/deps/v8/src/heap/minor-mark-sweep-inl.h
new file mode 100644
index 00000000000000..e8d71c1d02b083
--- /dev/null
+++ b/deps/v8/src/heap/minor-mark-sweep-inl.h
@@ -0,0 +1,217 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_MINOR_MARK_SWEEP_INL_H_
+#define V8_HEAP_MINOR_MARK_SWEEP_INL_H_
+
+#include <atomic>
+
+#include "src/base/build_config.h"
+#include "src/common/globals.h"
+#include "src/heap/memory-chunk.h"
+#include "src/heap/minor-mark-sweep.h"
+#include "src/heap/remembered-set-inl.h"
+#include "src/heap/young-generation-marking-visitor-inl.h"
+#include "src/objects/heap-object.h"
+#include "src/objects/map.h"
+#include "src/objects/string.h"
+#include "src/roots/static-roots.h"
+
+namespace v8 {
+namespace internal {
+
+void YoungGenerationRootMarkingVisitor::VisitRootPointer(
+    Root root, const char* description, FullObjectSlot p) {
+  VisitPointersImpl(root, p, p + 1);
+}
+
+void YoungGenerationRootMarkingVisitor::VisitRootPointers(
+    Root root, const char* description, FullObjectSlot start,
+    FullObjectSlot end) {
+  VisitPointersImpl(root, start, end);
+}
+
+template <typename TSlot>
+void YoungGenerationRootMarkingVisitor::VisitPointersImpl(Root root,
+                                                          TSlot start,
+                                                          TSlot end) {
+  if (root == Root::kStackRoots) {
+    for (TSlot slot = start; slot < end; ++slot) {
+      main_marking_visitor_->VisitObjectViaSlot<
+          YoungGenerationMainMarkingVisitor::ObjectVisitationMode::
+              kPushToWorklist,
+          YoungGenerationMainMarkingVisitor::SlotTreatmentMode::kReadOnly>(
+          slot);
+    }
+  } else {
+    for (TSlot slot = start; slot < end; ++slot) {
+      main_marking_visitor_->VisitObjectViaSlot<
+          YoungGenerationMainMarkingVisitor::ObjectVisitationMode::
+              kPushToWorklist,
+          YoungGenerationMainMarkingVisitor::SlotTreatmentMode::kReadWrite>(
+          slot);
+    }
+  }
+}
+
+template <typename Visitor>
+bool YoungGenerationRememberedSetsMarkingWorklist::ProcessNextItem(
+    Visitor* visitor, base::Optional<size_t>& index) {
+  if (remaining_remembered_sets_marking_items_.load(
+          std::memory_order_relaxed) == 0) {
+    return false;
+  }
+  while (true) {
+    if (index && (index < remembered_sets_marking_items_.size())) {
+      auto& work_item = remembered_sets_marking_items_[*index];
+      if (work_item.TryAcquire()) {
+        remaining_remembered_sets_marking_items_.fetch_sub(
+            1, std::memory_order_relaxed);
+        work_item.Process(visitor);
+        (*index)++;
+        return true;
+      }
+    }
+    index = remembered_sets_marking_index_generator_.GetNext();
+    if (!index) return false;
+  }
+}
+
+template <typename Visitor>
+void YoungGenerationRememberedSetsMarkingWorklist::MarkingItem::Process(
+    Visitor* visitor) {
+  CodePageHeaderModificationScope header_modification_scope(
+      "Marking modifies the remembered sets in the page header");
+  if (slots_type_ == SlotsType::kRegularSlots) {
+    MarkUntypedPointers(visitor);
+  } else {
+    MarkTypedPointers(visitor);
+  }
+}
+
+void YoungGenerationRememberedSetsMarkingWorklist::MarkingItem::
+    CheckOldToNewSlotForSharedUntyped(MemoryChunk* chunk, Address slot_address,
+                                      MaybeObject object) {
+  Tagged<HeapObject> heap_object;
+  if (!object.GetHeapObject(&heap_object)) return;
+#ifdef THREAD_SANITIZER
+  BasicMemoryChunk::FromHeapObject(heap_object)->SynchronizedHeapLoad();
+#endif  // THREAD_SANITIZER
+  if (heap_object.InWritableSharedSpace()) {
+    RememberedSet<OLD_TO_SHARED>::Insert<AccessMode::ATOMIC>(chunk,
+                                                             slot_address);
+  }
+}
+
+void YoungGenerationRememberedSetsMarkingWorklist::MarkingItem::
+    CheckOldToNewSlotForSharedTyped(MemoryChunk* chunk, SlotType slot_type,
+                                    Address slot_address,
+                                    MaybeObject new_target) {
+  Tagged<HeapObject> heap_object;
+  if (!new_target.GetHeapObject(&heap_object)) return;
+#ifdef THREAD_SANITIZER
+  BasicMemoryChunk::FromHeapObject(heap_object)->SynchronizedHeapLoad();
+#endif  // THREAD_SANITIZER
+  if (heap_object.InWritableSharedSpace()) {
+    const uintptr_t offset = slot_address - chunk->address();
+    DCHECK_LT(offset, static_cast<uintptr_t>(TypedSlotSet::kMaxOffset));
+    RememberedSet<OLD_TO_SHARED>::InsertTyped(chunk, slot_type,
+                                              static_cast<uint32_t>(offset));
+  }
+}
+
+template <typename Visitor>
+void YoungGenerationRememberedSetsMarkingWorklist::MarkingItem::
+    MarkUntypedPointers(Visitor* visitor) {
+  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
+               "MarkingItem::MarkUntypedPointers");
+  const bool record_old_to_shared_slots =
+      chunk_->heap()->isolate()->has_shared_space();
+  auto callback = [this, visitor,
+                   record_old_to_shared_slots](MaybeObjectSlot slot) {
+    SlotCallbackResult result = CheckAndMarkObject(visitor, slot);
+    if (result == REMOVE_SLOT && record_old_to_shared_slots) {
+      MaybeObject object;
+      if constexpr (Visitor::EnableConcurrentVisitation()) {
+        object = slot.Relaxed_Load(visitor->cage_base());
+      } else {
+        object = *slot;
+      }
+      CheckOldToNewSlotForSharedUntyped(chunk_, slot.address(), object);
+    }
+    return result;
+  };
+  if (slot_set_) {
+    const auto slot_count =
+        RememberedSet<OLD_TO_NEW>::template Iterate<AccessMode::NON_ATOMIC>(
+            slot_set_, chunk_, callback, SlotSet::FREE_EMPTY_BUCKETS);
+    if (slot_count == 0) {
+      SlotSet::Delete(slot_set_, chunk_->buckets());
+      slot_set_ = nullptr;
+    }
+  }
+  if (background_slot_set_) {
+    const auto slot_count =
+        RememberedSet<OLD_TO_NEW_BACKGROUND>::template Iterate<
+            AccessMode::NON_ATOMIC>(background_slot_set_, chunk_, callback,
+                                    SlotSet::FREE_EMPTY_BUCKETS);
+    if (slot_count == 0) {
+      SlotSet::Delete(background_slot_set_, chunk_->buckets());
+      background_slot_set_ = nullptr;
+    }
+  }
+}
+
+template <typename Visitor>
+void YoungGenerationRememberedSetsMarkingWorklist::MarkingItem::
+    MarkTypedPointers(Visitor* visitor) {
+  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.gc"),
+               "MarkingItem::MarkTypedPointers");
+  const bool record_old_to_shared_slots =
+      chunk_->heap()->isolate()->has_shared_space();
+  DCHECK_NULL(background_slot_set_);
+  DCHECK_NOT_NULL(typed_slot_set_);
+  const auto slot_count = RememberedSet<OLD_TO_NEW>::IterateTyped(
+      typed_slot_set_, [this, visitor, record_old_to_shared_slots](
+                           SlotType slot_type, Address slot_address) {
+        return UpdateTypedSlotHelper::UpdateTypedSlot(
+            heap(), slot_type, slot_address,
+            [this, visitor, record_old_to_shared_slots, slot_address,
+             slot_type](FullMaybeObjectSlot slot) {
+              SlotCallbackResult result = CheckAndMarkObject(visitor, slot);
+              if (result == REMOVE_SLOT && record_old_to_shared_slots) {
+                MaybeObject object;
+                if constexpr (Visitor::EnableConcurrentVisitation()) {
+                  object = slot.Relaxed_Load(visitor->cage_base());
+                } else {
+                  object = *slot;
+                }
+                CheckOldToNewSlotForSharedTyped(chunk_, slot_type, slot_address,
+                                                object);
+              }
+              return result;
+            });
+      });
+  if (slot_count == 0) {
+    delete typed_slot_set_;
+    typed_slot_set_ = nullptr;
+  }
+}
+
+template <typename Visitor, typename TSlot>
+V8_INLINE SlotCallbackResult
+YoungGenerationRememberedSetsMarkingWorklist::MarkingItem::CheckAndMarkObject(
+    Visitor* visitor, TSlot slot) {
+  static_assert(
+      std::is_same<TSlot, FullMaybeObjectSlot>::value ||
+          std::is_same<TSlot, MaybeObjectSlot>::value,
+      "Only FullMaybeObjectSlot and MaybeObjectSlot are expected here");
+  return visitor->VisitObjectViaSlotInRememberedSet(slot) ? KEEP_SLOT
+                                                          : REMOVE_SLOT;
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_MINOR_MARK_SWEEP_INL_H_
diff --git a/deps/v8/src/heap/minor-mark-sweep.cc b/deps/v8/src/heap/minor-mark-sweep.cc
new file mode 100644
index 00000000000000..0060edf396bbd9
--- /dev/null
+++ b/deps/v8/src/heap/minor-mark-sweep.cc
@@ -0,0 +1,922 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/minor-mark-sweep.h"
+
+#include <algorithm>
+#include <atomic>
+#include <memory>
+#include <unordered_set>
+#include <vector>
+
+#include "src/base/logging.h"
+#include "src/codegen/assembler-inl.h"
+#include "src/codegen/compilation-cache.h"
+#include "src/common/globals.h"
+#include "src/deoptimizer/deoptimizer.h"
+#include "src/flags/flags.h"
+#include "src/handles/global-handles.h"
+#include "src/heap/array-buffer-sweeper.h"
+#include "src/heap/concurrent-marking.h"
+#include "src/heap/ephemeron-remembered-set.h"
+#include "src/heap/gc-tracer-inl.h"
+#include "src/heap/gc-tracer.h"
+#include "src/heap/heap.h"
+#include "src/heap/large-spaces.h"
+#include "src/heap/mark-sweep-utilities.h"
+#include "src/heap/marking-barrier.h"
+#include "src/heap/marking-visitor-inl.h"
+#include "src/heap/marking-visitor.h"
+#include "src/heap/marking-worklist-inl.h"
+#include "src/heap/marking-worklist.h"
+#include "src/heap/memory-chunk-layout.h"
+#include "src/heap/memory-chunk.h"
+#include "src/heap/minor-mark-sweep-inl.h"
+#include "src/heap/new-spaces.h"
+#include "src/heap/object-stats.h"
+#include "src/heap/pretenuring-handler.h"
+#include "src/heap/read-only-heap.h"
+#include "src/heap/read-only-spaces.h"
+#include "src/heap/remembered-set.h"
+#include "src/heap/safepoint.h"
+#include "src/heap/slot-set.h"
+#include "src/heap/sweeper.h"
+#include "src/heap/traced-handles-marking-visitor.h"
+#include "src/heap/weak-object-worklists.h"
+#include "src/init/v8.h"
+#include "src/objects/js-collection-inl.h"
+#include "src/objects/objects.h"
+#include "src/objects/string-forwarding-table-inl.h"
+#include "src/objects/visitors.h"
+#include "src/snapshot/shared-heap-serializer.h"
+#include "src/tasks/cancelable-task.h"
+#include "src/utils/utils-inl.h"
+
+namespace v8 {
+namespace internal {
+
+// ==================================================================
+// Verifiers
+// ==================================================================
+
+#ifdef VERIFY_HEAP
+namespace {
+
+class YoungGenerationMarkingVerifier : public MarkingVerifierBase {
+ public:
+  explicit YoungGenerationMarkingVerifier(Heap* heap)
+      : MarkingVerifierBase(heap),
+        marking_state_(heap->non_atomic_marking_state()) {}
+
+  const MarkingBitmap* bitmap(const MemoryChunk* chunk) override {
+    return chunk->marking_bitmap();
+  }
+
+  bool IsMarked(Tagged<HeapObject> object) override {
+    return marking_state_->IsMarked(object);
+  }
+
+  void Run() override {
+    VerifyRoots();
+    VerifyMarking(heap_->new_space());
+  }
+
+  GarbageCollector collector() const override {
+    return GarbageCollector::MINOR_MARK_SWEEPER;
+  }
+
+ protected:
+  void VerifyMap(Tagged<Map> map) override { VerifyHeapObjectImpl(map); }
+
+  void VerifyPointers(ObjectSlot start, ObjectSlot end) override {
+    VerifyPointersImpl(start, end);
+  }
+
+  void VerifyPointers(MaybeObjectSlot start, MaybeObjectSlot end) override {
+    VerifyPointersImpl(start, end);
+  }
+  void VerifyCodePointer(InstructionStreamSlot slot) override {
+    // Code slots never appear in new space because
+    // Code objects, the only object that can contain code pointers, are
+    // always allocated in the old space.
+    UNREACHABLE();
+  }
+
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
+    Tagged<InstructionStream> target =
+        InstructionStream::FromTargetAddress(rinfo->target_address());
+    VerifyHeapObjectImpl(target);
+  }
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
+    VerifyHeapObjectImpl(rinfo->target_object(cage_base()));
+  }
+  void VerifyRootPointers(FullObjectSlot start, FullObjectSlot end) override {
+    VerifyPointersImpl(start, end);
+  }
+
+ private:
+  V8_INLINE void VerifyHeapObjectImpl(Tagged<HeapObject> heap_object) {
+    CHECK_IMPLIES(Heap::InYoungGeneration(heap_object), IsMarked(heap_object));
+  }
+
+  template <typename TSlot>
+  V8_INLINE void VerifyPointersImpl(TSlot start, TSlot end) {
+    PtrComprCageBase cage_base =
+        GetPtrComprCageBaseFromOnHeapAddress(start.address());
+    for (TSlot slot = start; slot < end; ++slot) {
+      typename TSlot::TObject object = slot.load(cage_base);
+      Tagged<HeapObject> heap_object;
+      // Minor MS treats weak references as strong.
+      if (object.GetHeapObject(&heap_object)) {
+        VerifyHeapObjectImpl(heap_object);
+      }
+    }
+  }
+
+  NonAtomicMarkingState* const marking_state_;
+};
+
+}  // namespace
+#endif  // VERIFY_HEAP
+
+// =============================================================================
+// MinorMarkSweepCollector
+// =============================================================================
+
+namespace {
+int EstimateMaxNumberOfRemeberedSets(Heap* heap) {
+  return 2 * (heap->old_space()->CountTotalPages() +
+              heap->lo_space()->PageCount()) +
+         3 * (heap->code_space()->CountTotalPages() +
+              heap->code_lo_space()->PageCount());
+}
+}  // namespace
+
+// static
+std::vector<YoungGenerationRememberedSetsMarkingWorklist::MarkingItem>
+YoungGenerationRememberedSetsMarkingWorklist::CollectItems(Heap* heap) {
+  std::vector<MarkingItem> items;
+  int max_remembered_set_count = EstimateMaxNumberOfRemeberedSets(heap);
+  items.reserve(max_remembered_set_count);
+  CodePageHeaderModificationScope rwx_write_scope(
+      "Extracting of slot sets requires write access to Code page "
+      "header");
+  OldGenerationMemoryChunkIterator::ForAll(heap, [&items](MemoryChunk* chunk) {
+    SlotSet* slot_set = chunk->ExtractSlotSet<OLD_TO_NEW>();
+    SlotSet* background_slot_set =
+        chunk->ExtractSlotSet<OLD_TO_NEW_BACKGROUND>();
+    if (slot_set || background_slot_set) {
+      items.emplace_back(chunk, MarkingItem::SlotsType::kRegularSlots, slot_set,
+                         background_slot_set);
+    }
+    if (TypedSlotSet* typed_slot_set =
+            chunk->ExtractTypedSlotSet<OLD_TO_NEW>()) {
+      DCHECK(IsAnyCodeSpace(chunk->owner_identity()));
+      items.emplace_back(chunk, MarkingItem::SlotsType::kTypedSlots,
+                         typed_slot_set);
+    }
+  });
+  DCHECK_LE(items.size(), max_remembered_set_count);
+  return items;
+}
+
+void YoungGenerationRememberedSetsMarkingWorklist::MarkingItem::
+    MergeAndDeleteRememberedSets() {
+  DCHECK(IsAcquired());
+  if (slots_type_ == SlotsType::kRegularSlots) {
+    if (slot_set_)
+      RememberedSet<OLD_TO_NEW>::MergeAndDelete(chunk_, std::move(*slot_set_));
+    if (background_slot_set_)
+      RememberedSet<OLD_TO_NEW_BACKGROUND>::MergeAndDelete(
+          chunk_, std::move(*background_slot_set_));
+  } else {
+    DCHECK_EQ(slots_type_, SlotsType::kTypedSlots);
+    DCHECK_NULL(background_slot_set_);
+    if (typed_slot_set_)
+      RememberedSet<OLD_TO_NEW>::MergeAndDeleteTyped(
+          chunk_, std::move(*typed_slot_set_));
+  }
+}
+
+void YoungGenerationRememberedSetsMarkingWorklist::MarkingItem::
+    DeleteSetsOnTearDown() {
+  if (slots_type_ == SlotsType::kRegularSlots) {
+    if (slot_set_) SlotSet::Delete(slot_set_, chunk_->buckets());
+    if (background_slot_set_)
+      SlotSet::Delete(background_slot_set_, chunk_->buckets());
+
+  } else {
+    DCHECK_EQ(slots_type_, SlotsType::kTypedSlots);
+    DCHECK_NULL(background_slot_set_);
+    if (typed_slot_set_) delete typed_slot_set_;
+  }
+}
+
+YoungGenerationRememberedSetsMarkingWorklist::
+    YoungGenerationRememberedSetsMarkingWorklist(Heap* heap)
+    : remembered_sets_marking_items_(CollectItems(heap)),
+      remaining_remembered_sets_marking_items_(
+          remembered_sets_marking_items_.size()),
+      remembered_sets_marking_index_generator_(
+          remembered_sets_marking_items_.size()) {}
+
+YoungGenerationRememberedSetsMarkingWorklist::
+    ~YoungGenerationRememberedSetsMarkingWorklist() {
+  CodePageHeaderModificationScope rwx_write_scope(
+      "Merging slot sets back to pages requires write access to Code page "
+      "header");
+  for (MarkingItem item : remembered_sets_marking_items_) {
+    item.MergeAndDeleteRememberedSets();
+  }
+}
+
+void YoungGenerationRememberedSetsMarkingWorklist::TearDown() {
+  for (MarkingItem& item : remembered_sets_marking_items_) {
+    item.DeleteSetsOnTearDown();
+  }
+  remembered_sets_marking_items_.clear();
+  remaining_remembered_sets_marking_items_.store(0, std::memory_order_relaxed);
+}
+
+YoungGenerationRootMarkingVisitor::YoungGenerationRootMarkingVisitor(
+    YoungGenerationMainMarkingVisitor* main_marking_visitor)
+    : main_marking_visitor_(main_marking_visitor) {}
+
+YoungGenerationRootMarkingVisitor::~YoungGenerationRootMarkingVisitor() =
+    default;
+
+// static
+constexpr size_t MinorMarkSweepCollector::kMaxParallelTasks;
+
+MinorMarkSweepCollector::MinorMarkSweepCollector(Heap* heap)
+    : heap_(heap),
+      marking_state_(heap_->marking_state()),
+      non_atomic_marking_state_(heap_->non_atomic_marking_state()),
+      sweeper_(heap_->sweeper()) {}
+
+void MinorMarkSweepCollector::PerformWrapperTracing() {
+  auto* cpp_heap = CppHeap::From(heap_->cpp_heap_);
+  if (!cpp_heap) return;
+
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_EMBEDDER_TRACING);
+  local_marking_worklists()->PublishWrapper();
+  cpp_heap->AdvanceTracing(v8::base::TimeDelta::Max());
+}
+
+MinorMarkSweepCollector::~MinorMarkSweepCollector() = default;
+
+void MinorMarkSweepCollector::TearDown() {
+  if (heap_->incremental_marking()->IsMinorMarking()) {
+    DCHECK(heap_->concurrent_marking()->IsStopped());
+    remembered_sets_marking_handler_->TearDown();
+    main_marking_visitor_->PublishWorklists();
+    heap_->main_thread_local_heap_->marking_barrier()->PublishIfNeeded();
+    // Marking barriers of LocalHeaps will be published in their destructors.
+    marking_worklists_->Clear();
+    ephemeron_table_list_->Clear();
+  }
+}
+
+void MinorMarkSweepCollector::FinishConcurrentMarking() {
+  if (v8_flags.concurrent_minor_ms_marking || v8_flags.parallel_marking) {
+    DCHECK_IMPLIES(!heap_->concurrent_marking()->IsStopped(),
+                   heap_->concurrent_marking()->garbage_collector() ==
+                       GarbageCollector::MINOR_MARK_SWEEPER);
+    heap_->concurrent_marking()->Join();
+    heap_->concurrent_marking()->FlushPretenuringFeedback();
+  }
+  if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap_)) {
+    cpp_heap->FinishConcurrentMarkingIfNeeded();
+  }
+}
+
+void MinorMarkSweepCollector::StartMarking() {
+#ifdef VERIFY_HEAP
+  if (v8_flags.verify_heap) {
+    for (Page* page : *heap_->new_space()) {
+      CHECK(page->marking_bitmap()->IsClean());
+    }
+  }
+#endif  // VERIFY_HEAP
+
+  auto* cpp_heap = CppHeap::From(heap_->cpp_heap_);
+  if (cpp_heap && cpp_heap->generational_gc_supported()) {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_EMBEDDER_PROLOGUE);
+    // InitializeTracing should be called before visitor initialization in
+    // StartMarking.
+    cpp_heap->InitializeTracing(CppHeap::CollectionType::kMinor);
+  }
+  DCHECK_NULL(ephemeron_table_list_);
+  ephemeron_table_list_ = std::make_unique<EphemeronRememberedSet::TableList>();
+  DCHECK_NULL(marking_worklists_);
+  marking_worklists_ = std::make_unique<MarkingWorklists>();
+  DCHECK_NULL(main_marking_visitor_);
+  DCHECK_NULL(pretenuring_feedback_);
+  pretenuring_feedback_ =
+      std::make_unique<PretenuringHandler::PretenuringFeedbackMap>(
+          PretenuringHandler::kInitialFeedbackCapacity);
+  main_marking_visitor_ = std::make_unique<YoungGenerationMainMarkingVisitor>(
+      heap_, pretenuring_feedback_.get());
+  DCHECK_NULL(remembered_sets_marking_handler_);
+  remembered_sets_marking_handler_ =
+      std::make_unique<YoungGenerationRememberedSetsMarkingWorklist>(heap_);
+  if (cpp_heap && cpp_heap->generational_gc_supported()) {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_EMBEDDER_PROLOGUE);
+    // StartTracing immediately starts marking which requires V8 worklists to
+    // be set up.
+    cpp_heap->StartTracing();
+  }
+}
+
+void MinorMarkSweepCollector::Finish() {
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_FINISH);
+
+  {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_FINISH_ENSURE_CAPACITY);
+    switch (resize_new_space_) {
+      case ResizeNewSpaceMode::kShrink:
+        heap_->ReduceNewSpaceSize();
+        break;
+      case ResizeNewSpaceMode::kGrow:
+        heap_->ExpandNewSpaceSize();
+        break;
+      case ResizeNewSpaceMode::kNone:
+        break;
+    }
+    resize_new_space_ = ResizeNewSpaceMode::kNone;
+
+    if (!heap_->new_space()->EnsureCurrentCapacity()) {
+      heap_->FatalProcessOutOfMemory("NewSpace::EnsureCurrentCapacity");
+    }
+  }
+
+  heap_->new_space()->GarbageCollectionEpilogue();
+}
+
+void MinorMarkSweepCollector::CollectGarbage() {
+  DCHECK(!heap_->mark_compact_collector()->in_use());
+  DCHECK_NOT_NULL(heap_->new_space());
+  DCHECK(!heap_->array_buffer_sweeper()->sweeping_in_progress());
+  DCHECK(!sweeper()->AreMinorSweeperTasksRunning());
+  DCHECK(sweeper()->IsSweepingDoneForSpace(NEW_SPACE));
+
+  heap_->new_space()->FreeLinearAllocationArea();
+  heap_->new_lo_space()->ResetPendingObject();
+
+  is_in_atomic_pause_.store(true, std::memory_order_relaxed);
+
+  MarkLiveObjects();
+  ClearNonLiveReferences();
+#ifdef VERIFY_HEAP
+  if (v8_flags.verify_heap) {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_VERIFY);
+    YoungGenerationMarkingVerifier verifier(heap_);
+    verifier.Run();
+  }
+#endif  // VERIFY_HEAP
+
+  Sweep();
+  Finish();
+
+  auto* isolate = heap_->isolate();
+  isolate->global_handles()->UpdateListOfYoungNodes();
+  isolate->traced_handles()->UpdateListOfYoungNodes();
+
+  is_in_atomic_pause_.store(false, std::memory_order_relaxed);
+}
+
+namespace {
+
+class YoungStringForwardingTableCleaner final
+    : public StringForwardingTableCleanerBase {
+ public:
+  explicit YoungStringForwardingTableCleaner(Heap* heap)
+      : StringForwardingTableCleanerBase(heap) {}
+
+  // For Minor MS we don't mark forward objects, because they are always
+  // in old generation (and thus considered live).
+  // We only need to delete non-live young objects.
+  void ProcessYoungObjects() {
+    DCHECK(v8_flags.always_use_string_forwarding_table);
+    StringForwardingTable* forwarding_table =
+        isolate_->string_forwarding_table();
+    forwarding_table->IterateElements(
+        [&](StringForwardingTable::Record* record) {
+          ClearNonLiveYoungObjects(record);
+        });
+  }
+
+ private:
+  void ClearNonLiveYoungObjects(StringForwardingTable::Record* record) {
+    Tagged<Object> original = record->OriginalStringObject(isolate_);
+    if (!IsHeapObject(original)) {
+      DCHECK_EQ(original, StringForwardingTable::deleted_element());
+      return;
+    }
+    Tagged<String> original_string = String::cast(original);
+    if (!Heap::InYoungGeneration(original_string)) return;
+    if (!marking_state_->IsMarked(original_string)) {
+      DisposeExternalResource(record);
+      record->set_original_string(StringForwardingTable::deleted_element());
+    }
+  }
+};
+
+bool IsUnmarkedObjectInYoungGeneration(Heap* heap, FullObjectSlot p) {
+  DCHECK_IMPLIES(Heap::InYoungGeneration(*p), Heap::InToPage(*p));
+  return Heap::InYoungGeneration(*p) &&
+         !heap->non_atomic_marking_state()->IsMarked(HeapObject::cast(*p));
+}
+
+}  // namespace
+
+void MinorMarkSweepCollector::ClearNonLiveReferences() {
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_CLEAR);
+
+  if (V8_UNLIKELY(v8_flags.always_use_string_forwarding_table)) {
+    TRACE_GC(heap_->tracer(),
+             GCTracer::Scope::MINOR_MS_CLEAR_STRING_FORWARDING_TABLE);
+    // Clear non-live objects in the string fowarding table.
+    YoungStringForwardingTableCleaner forwarding_table_cleaner(heap_);
+    forwarding_table_cleaner.ProcessYoungObjects();
+  }
+
+  Heap::ExternalStringTable& external_string_table =
+      heap_->external_string_table_;
+  if (external_string_table.HasYoung()) {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_CLEAR_STRING_TABLE);
+    // Internalized strings are always stored in old space, so there is no
+    // need to clean them here.
+    ExternalStringTableCleanerVisitor<
+        ExternalStringTableCleaningMode::kYoungOnly>
+        external_visitor(heap_);
+    external_string_table.IterateYoung(&external_visitor);
+    external_string_table.CleanUpYoung();
+  }
+
+  Isolate* isolate = heap_->isolate();
+  if (isolate->global_handles()->HasYoung() ||
+      isolate->traced_handles()->HasYoung()) {
+    TRACE_GC(heap_->tracer(),
+             GCTracer::Scope::MINOR_MS_CLEAR_WEAK_GLOBAL_HANDLES);
+    isolate->global_handles()->ProcessWeakYoungObjects(
+        nullptr, &IsUnmarkedObjectInYoungGeneration);
+    if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap_);
+        cpp_heap && cpp_heap->generational_gc_supported()) {
+      isolate->traced_handles()->ResetYoungDeadNodes(
+          &IsUnmarkedObjectInYoungGeneration);
+    } else {
+      isolate->traced_handles()->ProcessYoungObjects(
+          nullptr, &IsUnmarkedObjectInYoungGeneration);
+    }
+  }
+
+  // Clear ephemeron entries from EphemeronHashTables in the young generation
+  // whenever the entry has a dead young generation key.
+  //
+  // Worklist is collected during marking.
+  {
+    DCHECK_NOT_NULL(ephemeron_table_list_);
+    EphemeronRememberedSet::TableList::Local local_ephemeron_table_list(
+        *ephemeron_table_list_);
+    Tagged<EphemeronHashTable> table;
+    while (local_ephemeron_table_list.Pop(&table)) {
+      for (InternalIndex i : table->IterateEntries()) {
+        // Keys in EphemeronHashTables must be heap objects.
+        HeapObjectSlot key_slot(
+            table->RawFieldOfElementAt(EphemeronHashTable::EntryToIndex(i)));
+        Tagged<HeapObject> key = key_slot.ToHeapObject();
+        if (Heap::InYoungGeneration(key) &&
+            non_atomic_marking_state_->IsUnmarked(key)) {
+          table->RemoveEntry(i);
+        }
+      }
+    }
+  }
+  ephemeron_table_list_.reset();
+
+  // Clear ephemeron entries from EphemeronHashTables in the old generation
+  // whenever the entry has a dead young generation key.
+  //
+  // Does not need to be iterated as roots but is maintained in the GC to avoid
+  // treating keys as strong. The set is populated from the write barrier and
+  // the sweeper during promoted pages iteration.
+  auto* table_map = heap_->ephemeron_remembered_set()->tables();
+  for (auto it = table_map->begin(); it != table_map->end();) {
+    Tagged<EphemeronHashTable> table = it->first;
+    auto& indices = it->second;
+    for (auto iti = indices.begin(); iti != indices.end();) {
+      // Keys in EphemeronHashTables must be heap objects.
+      HeapObjectSlot key_slot(table->RawFieldOfElementAt(
+          EphemeronHashTable::EntryToIndex(InternalIndex(*iti))));
+      Tagged<HeapObject> key = key_slot.ToHeapObject();
+      // There may be old generation entries left in the remembered set as
+      // MinorMS only promotes pages after clearing non-live references.
+      if (!Heap::InYoungGeneration(key)) {
+        iti = indices.erase(iti);
+      } else if (non_atomic_marking_state_->IsUnmarked(key)) {
+        table->RemoveEntry(InternalIndex(*iti));
+        iti = indices.erase(iti);
+      } else {
+        ++iti;
+      }
+    }
+
+    if (indices.size() == 0) {
+      it = table_map->erase(it);
+    } else {
+      ++it;
+    }
+  }
+}
+
+namespace {
+void VisitObjectWithEmbedderFields(Tagged<JSObject> object,
+                                   MarkingWorklists::Local& worklist) {
+  DCHECK(object->MayHaveEmbedderFields());
+  DCHECK(!Heap::InYoungGeneration(object));
+
+  MarkingWorklists::Local::WrapperSnapshot wrapper_snapshot;
+  const bool valid_snapshot =
+      worklist.ExtractWrapper(object->map(), object, wrapper_snapshot);
+  DCHECK(valid_snapshot);
+  USE(valid_snapshot);
+  worklist.PushExtractedWrapper(wrapper_snapshot);
+}
+}  // namespace
+
+void MinorMarkSweepCollector::MarkRootsFromTracedHandles(
+    YoungGenerationRootMarkingVisitor& root_visitor) {
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_TRACED_HANDLES);
+  if (auto* cpp_heap = CppHeap::From(heap_->cpp_heap_);
+      cpp_heap && cpp_heap->generational_gc_supported()) {
+    // Visit the Oilpan-to-V8 remembered set.
+    heap_->isolate()->traced_handles()->IterateAndMarkYoungRootsWithOldHosts(
+        &root_visitor);
+    // Visit the V8-to-Oilpan remembered set.
+    cpp_heap->VisitCrossHeapRememberedSetIfNeeded([this](Tagged<JSObject> obj) {
+      VisitObjectWithEmbedderFields(obj, *local_marking_worklists());
+    });
+  } else {
+    // Otherwise, visit all young roots.
+    heap_->isolate()->traced_handles()->IterateYoungRoots(&root_visitor);
+  }
+}
+
+void MinorMarkSweepCollector::MarkRoots(
+    YoungGenerationRootMarkingVisitor& root_visitor,
+    bool was_marked_incrementally) {
+  Isolate* isolate = heap_->isolate();
+
+  // Seed the root set.
+  {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_SEED);
+    isolate->traced_handles()->ComputeWeaknessForYoungObjects(
+        &JSObject::IsUnmodifiedApiObject);
+    // MinorMS treats all weak roots except for global handles as strong.
+    // That is why we don't set skip_weak = true here and instead visit
+    // global handles separately.
+    heap_->IterateRoots(
+        &root_visitor,
+        base::EnumSet<SkipRoot>{
+            SkipRoot::kExternalStringTable, SkipRoot::kGlobalHandles,
+            SkipRoot::kTracedHandles, SkipRoot::kOldGeneration,
+            SkipRoot::kReadOnlyBuiltins, SkipRoot::kConservativeStack});
+    isolate->global_handles()->IterateYoungStrongAndDependentRoots(
+        &root_visitor);
+    MarkRootsFromTracedHandles(root_visitor);
+  }
+}
+
+void MinorMarkSweepCollector::MarkRootsFromConservativeStack(
+    YoungGenerationRootMarkingVisitor& root_visitor) {
+  heap_->IterateConservativeStackRoots(&root_visitor,
+                                       Heap::IterateRootsMode::kMainIsolate);
+}
+
+void MinorMarkSweepCollector::MarkLiveObjects() {
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK);
+
+  const bool was_marked_incrementally =
+      !heap_->incremental_marking()->IsStopped();
+  if (!was_marked_incrementally) {
+    StartMarking();
+  } else {
+    auto* incremental_marking = heap_->incremental_marking();
+    TRACE_GC_WITH_FLOW(
+        heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_FINISH_INCREMENTAL,
+        incremental_marking->current_trace_id(), TRACE_EVENT_FLAG_FLOW_IN);
+    DCHECK(incremental_marking->IsMinorMarking());
+    DCHECK(v8_flags.concurrent_minor_ms_marking);
+    incremental_marking->Stop();
+    MarkingBarrier::PublishYoung(heap_);
+  }
+
+  DCHECK_NOT_NULL(marking_worklists_);
+  DCHECK_NOT_NULL(main_marking_visitor_);
+
+  YoungGenerationRootMarkingVisitor root_visitor(main_marking_visitor_.get());
+
+  MarkRoots(root_visitor, was_marked_incrementally);
+
+  // CppGC starts parallel marking tasks that will trace TracedReferences.
+  if (heap_->cpp_heap_) {
+    CppHeap::From(heap_->cpp_heap_)
+        ->EnterFinalPause(heap_->embedder_stack_state_);
+  }
+
+  {
+    // Mark the transitive closure in parallel.
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_CLOSURE_PARALLEL);
+    local_marking_worklists()->Publish();
+    if (v8_flags.parallel_marking) {
+      heap_->concurrent_marking()->RescheduleJobIfNeeded(
+          GarbageCollector::MINOR_MARK_SWEEPER, TaskPriority::kUserBlocking);
+    }
+    DrainMarkingWorklist();
+    FinishConcurrentMarking();
+  }
+
+  {
+    TRACE_GC(heap_->tracer(),
+             GCTracer::Scope::MINOR_MS_MARK_CONSERVATIVE_STACK);
+    MarkRootsFromConservativeStack(root_visitor);
+  }
+
+  {
+    TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_MARK_CLOSURE);
+    DrainMarkingWorklist();
+  }
+  CHECK(local_marking_worklists()->IsEmpty());
+
+  if (was_marked_incrementally) {
+    // Disable the marking barrier after concurrent/parallel marking has
+    // finished as it will reset page flags.
+    Sweeper::PauseMajorSweepingScope pause_sweeping_scope(heap_->sweeper());
+    MarkingBarrier::DeactivateYoung(heap_);
+  }
+
+  main_marking_visitor_.reset();
+  marking_worklists_.reset();
+  remembered_sets_marking_handler_.reset();
+
+  PretenuringHandler* pretenuring_handler = heap_->pretenuring_handler();
+  pretenuring_handler->MergeAllocationSitePretenuringFeedback(
+      *pretenuring_feedback_);
+  pretenuring_feedback_.reset();
+
+  if (v8_flags.minor_ms_trace_fragmentation) {
+    TraceFragmentation();
+  }
+}
+
+void MinorMarkSweepCollector::DrainMarkingWorklist() {
+  PtrComprCageBase cage_base(heap_->isolate());
+  YoungGenerationRememberedSetsMarkingWorklist::Local remembered_sets(
+      remembered_sets_marking_handler_.get());
+  auto* marking_worklists_local = local_marking_worklists();
+  do {
+    marking_worklists_local->MergeOnHold();
+
+    PerformWrapperTracing();
+
+    Tagged<HeapObject> heap_object;
+    while (marking_worklists_local->Pop(&heap_object)) {
+      DCHECK(!IsFreeSpaceOrFiller(heap_object, cage_base));
+      DCHECK(IsHeapObject(heap_object));
+      DCHECK(heap_->Contains(heap_object));
+      DCHECK(!marking_state_->IsUnmarked(heap_object));
+      // Maps won't change in the atomic pause, so the map can be read without
+      // atomics.
+      Tagged<Map> map = Map::cast(*heap_object->map_slot());
+      const auto visited_size = main_marking_visitor_->Visit(map, heap_object);
+      if (visited_size) {
+        main_marking_visitor_->IncrementLiveBytesCached(
+            MemoryChunk::FromHeapObject(heap_object),
+            ALIGN_TO_ALLOCATION_ALIGNMENT(visited_size));
+      }
+    }
+  } while (remembered_sets.ProcessNextItem(main_marking_visitor_.get()) ||
+           !IsCppHeapMarkingFinished(heap_, marking_worklists_local));
+}
+
+void MinorMarkSweepCollector::TraceFragmentation() {
+  NewSpace* new_space = heap_->new_space();
+  PtrComprCageBase cage_base(heap_->isolate());
+  const std::array<size_t, 4> free_size_class_limits = {0, 1024, 2048, 4096};
+  size_t free_bytes_of_class[free_size_class_limits.size()] = {0};
+  size_t live_bytes = 0;
+  size_t allocatable_bytes = 0;
+  for (Page* p :
+       PageRange(new_space->first_allocatable_address(), new_space->top())) {
+    Address free_start = p->area_start();
+    for (auto [object, size] : LiveObjectRange(p)) {
+      Address free_end = object.address();
+      if (free_end != free_start) {
+        size_t free_bytes = free_end - free_start;
+        int free_bytes_index = 0;
+        for (auto free_size_class_limit : free_size_class_limits) {
+          if (free_bytes >= free_size_class_limit) {
+            free_bytes_of_class[free_bytes_index] += free_bytes;
+          }
+          free_bytes_index++;
+        }
+      }
+      live_bytes += size;
+      free_start = free_end + size;
+    }
+    size_t area_end =
+        p->Contains(new_space->top()) ? new_space->top() : p->area_end();
+    if (free_start != area_end) {
+      size_t free_bytes = area_end - free_start;
+      int free_bytes_index = 0;
+      for (auto free_size_class_limit : free_size_class_limits) {
+        if (free_bytes >= free_size_class_limit) {
+          free_bytes_of_class[free_bytes_index] += free_bytes;
+        }
+        free_bytes_index++;
+      }
+    }
+    allocatable_bytes += area_end - p->area_start();
+    CHECK_EQ(allocatable_bytes, live_bytes + free_bytes_of_class[0]);
+  }
+  PrintIsolate(heap_->isolate(),
+               "Minor Mark-Sweep Fragmentation: allocatable_bytes=%zu "
+               "live_bytes=%zu "
+               "free_bytes=%zu free_bytes_1K=%zu free_bytes_2K=%zu "
+               "free_bytes_4K=%zu\n",
+               allocatable_bytes, live_bytes, free_bytes_of_class[0],
+               free_bytes_of_class[1], free_bytes_of_class[2],
+               free_bytes_of_class[3]);
+}
+
+namespace {
+
+// NewSpacePages with more live bytes than this threshold qualify for fast
+// evacuation.
+intptr_t NewSpacePageEvacuationThreshold() {
+  return v8_flags.minor_ms_page_promotion_threshold *
+         MemoryChunkLayout::AllocatableMemoryInDataPage() / 100;
+}
+
+bool ShouldMovePage(Page* p, intptr_t live_bytes, intptr_t wasted_bytes) {
+  DCHECK(v8_flags.page_promotion);
+  Heap* heap = p->heap();
+  DCHECK(!p->NeverEvacuate());
+  const bool should_move_page =
+      ((live_bytes + wasted_bytes) > NewSpacePageEvacuationThreshold() ||
+       (p->AllocatedLabSize() == 0)) &&
+      (heap->new_space()->IsPromotionCandidate(p)) &&
+      heap->CanExpandOldGeneration(live_bytes);
+  if (v8_flags.trace_page_promotions) {
+    PrintIsolate(
+        heap->isolate(),
+        "[Page Promotion] %p: collector=mms, should move: %d"
+        ", live bytes = %zu, wasted bytes = %zu, promotion threshold = %zu"
+        ", allocated labs size = %zu\n",
+        p, should_move_page, live_bytes, wasted_bytes,
+        NewSpacePageEvacuationThreshold(), p->AllocatedLabSize());
+  }
+  if (!should_move_page &&
+      (p->AgeInNewSpace() == v8_flags.minor_ms_max_page_age)) {
+    // Don't allocate on old pages so that recently allocated objects on the
+    // page get a chance to die young. The page will be force promoted on the
+    // next GC because `AllocatedLabSize` will be 0.
+    p->SetFlag(Page::NEVER_ALLOCATE_ON_PAGE);
+  }
+  return should_move_page;
+}
+
+}  // namespace
+
+bool MinorMarkSweepCollector::StartSweepNewSpace() {
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_SWEEP_NEW);
+  PagedSpaceForNewSpace* paged_space = heap_->paged_new_space()->paged_space();
+  paged_space->ClearAllocatorState();
+
+  int will_be_swept = 0;
+  bool has_promoted_pages = false;
+
+  DCHECK_EQ(Heap::ResizeNewSpaceMode::kNone, resize_new_space_);
+  resize_new_space_ = heap_->ShouldResizeNewSpace();
+  if (resize_new_space_ == Heap::ResizeNewSpaceMode::kShrink) {
+    paged_space->StartShrinking();
+  }
+
+  for (auto it = paged_space->begin(); it != paged_space->end();) {
+    Page* p = *(it++);
+    DCHECK(p->SweepingDone());
+
+    intptr_t live_bytes_on_page = p->live_bytes();
+    if (live_bytes_on_page == 0) {
+      if (paged_space->ShouldReleaseEmptyPage()) {
+        paged_space->ReleasePage(p);
+      } else {
+        sweeper()->SweepEmptyNewSpacePage(p);
+      }
+      continue;
+    }
+
+    if (ShouldMovePage(p, live_bytes_on_page, p->wasted_memory())) {
+      heap_->new_space()->PromotePageToOldSpace(p);
+      has_promoted_pages = true;
+      sweeper()->AddPromotedPage(p);
+    } else {
+      // Page is not promoted. Sweep it instead.
+      sweeper()->AddNewSpacePage(p);
+      will_be_swept++;
+    }
+  }
+
+  if (v8_flags.gc_verbose) {
+    PrintIsolate(heap_->isolate(),
+                 "sweeping: space=%s initialized_for_sweeping=%d",
+                 ToString(paged_space->identity()), will_be_swept);
+  }
+
+  return has_promoted_pages;
+}
+
+bool MinorMarkSweepCollector::SweepNewLargeSpace() {
+  TRACE_GC(heap_->tracer(), GCTracer::Scope::MINOR_MS_SWEEP_NEW_LO);
+  NewLargeObjectSpace* new_lo_space = heap_->new_lo_space();
+  DCHECK_NOT_NULL(new_lo_space);
+  DCHECK_EQ(kNullAddress, heap_->new_lo_space()->pending_object());
+
+  bool has_promoted_pages = false;
+
+  OldLargeObjectSpace* old_lo_space = heap_->lo_space();
+
+  for (auto it = new_lo_space->begin(); it != new_lo_space->end();) {
+    LargePage* current = *it;
+    it++;
+    Tagged<HeapObject> object = current->GetObject();
+    if (!non_atomic_marking_state_->IsMarked(object)) {
+      // Object is dead and page can be released.
+      new_lo_space->RemovePage(current);
+      heap_->memory_allocator()->Free(MemoryAllocator::FreeMode::kConcurrently,
+                                      current);
+      continue;
+    }
+    current->ClearFlag(MemoryChunk::TO_PAGE);
+    current->SetFlag(MemoryChunk::FROM_PAGE);
+    current->ProgressBar().ResetIfEnabled();
+    old_lo_space->PromoteNewLargeObject(current);
+    has_promoted_pages = true;
+    sweeper()->AddPromotedPage(current);
+  }
+  new_lo_space->set_objects_size(0);
+
+  return has_promoted_pages;
+}
+
+void MinorMarkSweepCollector::Sweep() {
+  DCHECK(!sweeper()->AreMinorSweeperTasksRunning());
+  sweeper_->InitializeMinorSweeping();
+
+  TRACE_GC_WITH_FLOW(
+      heap_->tracer(), GCTracer::Scope::MINOR_MS_SWEEP,
+      sweeper_->GetTraceIdForFlowEvent(GCTracer::Scope::MINOR_MS_SWEEP),
+      TRACE_EVENT_FLAG_FLOW_OUT);
+
+  bool has_promoted_pages = false;
+  if (StartSweepNewSpace()) has_promoted_pages = true;
+  if (SweepNewLargeSpace()) has_promoted_pages = true;
+
+  if (v8_flags.verify_heap && has_promoted_pages) {
+    // Update the external string table in preparation for heap verification.
+    // Otherwise, updating the table will happen during the next full GC.
+    TRACE_GC(heap_->tracer(),
+             GCTracer::Scope::MINOR_MS_SWEEP_UPDATE_STRING_TABLE);
+    heap_->UpdateYoungReferencesInExternalStringTable(
+        [](Heap* heap, FullObjectSlot p) {
+          DCHECK(!Tagged<HeapObject>::cast(*p)
+                      ->map_word(kRelaxedLoad)
+                      .IsForwardingAddress());
+          return Tagged<String>::cast(*p);
+        });
+  }
+
+  sweeper_->StartMinorSweeping();
+
+#ifdef DEBUG
+  VerifyRememberedSetsAfterEvacuation(heap_,
+                                      GarbageCollector::MINOR_MARK_SWEEPER);
+  heap_->VerifyCountersBeforeConcurrentSweeping(
+      GarbageCollector::MINOR_MARK_SWEEPER);
+#endif
+
+  sweeper()->StartMinorSweeperTasks();
+  DCHECK_EQ(0, heap_->new_lo_space()->Size());
+  heap_->array_buffer_sweeper()->RequestSweep(
+      ArrayBufferSweeper::SweepingType::kYoung,
+      (heap_->new_space()->Size() == 0)
+          ? ArrayBufferSweeper::TreatAllYoungAsPromoted::kYes
+          : ArrayBufferSweeper::TreatAllYoungAsPromoted::kNo);
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/heap/minor-mark-sweep.h b/deps/v8/src/heap/minor-mark-sweep.h
new file mode 100644
index 00000000000000..0b340cb07c8b72
--- /dev/null
+++ b/deps/v8/src/heap/minor-mark-sweep.h
@@ -0,0 +1,238 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_MINOR_MARK_SWEEP_H_
+#define V8_HEAP_MINOR_MARK_SWEEP_H_
+
+#include <atomic>
+#include <memory>
+#include <vector>
+
+#include "src/common/globals.h"
+#include "src/heap/heap.h"
+#include "src/heap/index-generator.h"
+#include "src/heap/marking-state.h"
+#include "src/heap/marking-worklist.h"
+#include "src/heap/parallel-work-item.h"
+#include "src/heap/pretenuring-handler.h"
+#include "src/heap/slot-set.h"
+#include "src/heap/sweeper.h"
+#include "src/heap/young-generation-marking-visitor.h"
+
+namespace v8 {
+namespace internal {
+
+using YoungGenerationMainMarkingVisitor = YoungGenerationMarkingVisitor<
+    YoungGenerationMarkingVisitationMode::kParallel>;
+
+class YoungGenerationRememberedSetsMarkingWorklist {
+ private:
+  class MarkingItem;
+
+ public:
+  class Local {
+   public:
+    explicit Local(YoungGenerationRememberedSetsMarkingWorklist* handler)
+        : handler_(handler) {}
+
+    template <typename Visitor>
+    bool ProcessNextItem(Visitor* visitor) {
+      return handler_->ProcessNextItem(visitor, index_);
+    }
+
+   private:
+    YoungGenerationRememberedSetsMarkingWorklist* const handler_;
+    base::Optional<size_t> index_;
+  };
+
+  static std::vector<MarkingItem> CollectItems(Heap* heap);
+
+  explicit YoungGenerationRememberedSetsMarkingWorklist(Heap* heap);
+  ~YoungGenerationRememberedSetsMarkingWorklist();
+
+  size_t RemainingRememberedSetsMarkingIteams() const {
+    return remaining_remembered_sets_marking_items_.load(
+        std::memory_order_relaxed);
+  }
+
+  void TearDown();
+
+ private:
+  class MarkingItem : public ParallelWorkItem {
+   public:
+    enum class SlotsType { kRegularSlots, kTypedSlots };
+
+    MarkingItem(MemoryChunk* chunk, SlotsType slots_type, SlotSet* slot_set,
+                SlotSet* background_slot_set)
+        : chunk_(chunk),
+          slots_type_(slots_type),
+          slot_set_(slot_set),
+          background_slot_set_(background_slot_set) {}
+    MarkingItem(MemoryChunk* chunk, SlotsType slots_type,
+                TypedSlotSet* typed_slot_set)
+        : chunk_(chunk),
+          slots_type_(slots_type),
+          typed_slot_set_(typed_slot_set) {}
+    ~MarkingItem() = default;
+
+    template <typename Visitor>
+    void Process(Visitor* visitor);
+    void MergeAndDeleteRememberedSets();
+
+    void DeleteSetsOnTearDown();
+
+   private:
+    inline Heap* heap() { return chunk_->heap(); }
+
+    template <typename Visitor>
+    void MarkUntypedPointers(Visitor* visitor);
+    template <typename Visitor>
+    void MarkTypedPointers(Visitor* visitor);
+    template <typename Visitor, typename TSlot>
+    V8_INLINE SlotCallbackResult CheckAndMarkObject(Visitor* visitor,
+                                                    TSlot slot);
+
+    V8_INLINE void CheckOldToNewSlotForSharedUntyped(MemoryChunk* chunk,
+                                                     Address slot_address,
+                                                     MaybeObject object);
+    V8_INLINE void CheckOldToNewSlotForSharedTyped(MemoryChunk* chunk,
+                                                   SlotType slot_type,
+                                                   Address slot_address,
+                                                   MaybeObject new_target);
+
+    MemoryChunk* const chunk_;
+    const SlotsType slots_type_;
+    union {
+      SlotSet* slot_set_;
+      TypedSlotSet* typed_slot_set_;
+    };
+    SlotSet* background_slot_set_ = nullptr;
+  };
+
+  template <typename Visitor>
+  bool ProcessNextItem(Visitor* visitor, base::Optional<size_t>& index);
+
+  std::vector<MarkingItem> remembered_sets_marking_items_;
+  std::atomic_size_t remaining_remembered_sets_marking_items_;
+  IndexGenerator remembered_sets_marking_index_generator_;
+};
+
+class YoungGenerationRootMarkingVisitor final : public RootVisitor {
+ public:
+  explicit YoungGenerationRootMarkingVisitor(
+      YoungGenerationMainMarkingVisitor* main_marking_visitor);
+  ~YoungGenerationRootMarkingVisitor();
+
+  V8_INLINE void VisitRootPointer(Root root, const char* description,
+                                  FullObjectSlot p) final;
+
+  V8_INLINE void VisitRootPointers(Root root, const char* description,
+                                   FullObjectSlot start,
+                                   FullObjectSlot end) final;
+
+  GarbageCollector collector() const override {
+    return GarbageCollector::MINOR_MARK_SWEEPER;
+  }
+
+ private:
+  template <typename TSlot>
+  void VisitPointersImpl(Root root, TSlot start, TSlot end);
+
+  YoungGenerationMainMarkingVisitor* const main_marking_visitor_;
+};
+
+// Collector for young-generation only.
+class MinorMarkSweepCollector final {
+ public:
+  static constexpr size_t kMaxParallelTasks = 8;
+
+  explicit MinorMarkSweepCollector(Heap* heap);
+  ~MinorMarkSweepCollector();
+
+  void TearDown();
+  void CollectGarbage();
+  void StartMarking();
+
+  EphemeronRememberedSet::TableList* ephemeron_table_list() const {
+    return ephemeron_table_list_.get();
+  }
+
+  MarkingWorklists* marking_worklists() { return marking_worklists_.get(); }
+
+  MarkingWorklists::Local* local_marking_worklists() {
+    return &main_marking_visitor_->marking_worklists_local();
+  }
+
+  YoungGenerationRememberedSetsMarkingWorklist*
+  remembered_sets_marking_handler() {
+    DCHECK_NOT_NULL(remembered_sets_marking_handler_);
+    return remembered_sets_marking_handler_.get();
+  }
+
+  YoungGenerationMainMarkingVisitor* main_marking_visitor() {
+    return main_marking_visitor_.get();
+  }
+
+  bool is_in_atomic_pause() const {
+    return is_in_atomic_pause_.load(std::memory_order_relaxed);
+  }
+
+ private:
+  using ResizeNewSpaceMode = Heap::ResizeNewSpaceMode;
+
+  class RootMarkingVisitor;
+
+  Sweeper* sweeper() { return sweeper_; }
+
+  void MarkLiveObjects();
+  void MarkRoots(YoungGenerationRootMarkingVisitor& root_visitor,
+                 bool was_marked_incrementally);
+  void DrainMarkingWorklist();
+  void MarkRootsFromTracedHandles(
+      YoungGenerationRootMarkingVisitor& root_visitor);
+  void MarkRootsFromConservativeStack(
+      YoungGenerationRootMarkingVisitor& root_visitor);
+
+  void TraceFragmentation();
+  void ClearNonLiveReferences();
+  void FinishConcurrentMarking();
+  // Perform Wrapper Tracing if in use.
+  void PerformWrapperTracing();
+
+  void Sweep();
+  // 'StartSweepNewSpace' and 'SweepNewLargeSpace' return true if any pages were
+  // promoted.
+  bool StartSweepNewSpace();
+  bool SweepNewLargeSpace();
+
+  void Finish();
+
+  Heap* const heap_;
+
+  std::unique_ptr<MarkingWorklists> marking_worklists_;
+
+  std::unique_ptr<EphemeronRememberedSet::TableList> ephemeron_table_list_;
+  std::unique_ptr<YoungGenerationMainMarkingVisitor> main_marking_visitor_;
+
+  MarkingState* const marking_state_;
+  NonAtomicMarkingState* const non_atomic_marking_state_;
+  Sweeper* const sweeper_;
+
+  std::unique_ptr<PretenuringHandler::PretenuringFeedbackMap>
+      pretenuring_feedback_;
+
+  std::unique_ptr<YoungGenerationRememberedSetsMarkingWorklist>
+      remembered_sets_marking_handler_;
+
+  ResizeNewSpaceMode resize_new_space_ = ResizeNewSpaceMode::kNone;
+
+  std::atomic<bool> is_in_atomic_pause_{false};
+
+  friend class IncrementalMarking;
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_MINOR_MARK_SWEEP_H_
diff --git a/deps/v8/src/heap/new-spaces-inl.h b/deps/v8/src/heap/new-spaces-inl.h
index 63969f86fed706..00ccc934790485 100644
--- a/deps/v8/src/heap/new-spaces-inl.h
+++ b/deps/v8/src/heap/new-spaces-inl.h
@@ -13,6 +13,7 @@
 #include "src/heap/spaces-inl.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/tagged-impl.h"
+#include "src/objects/tagged.h"
 
 namespace v8 {
 namespace internal {
@@ -20,15 +21,21 @@ namespace internal {
 // -----------------------------------------------------------------------------
 // SemiSpace
 
-bool SemiSpace::Contains(HeapObject o) const {
+bool SemiSpace::Contains(Tagged<HeapObject> o) const {
   BasicMemoryChunk* memory_chunk = BasicMemoryChunk::FromHeapObject(o);
   if (memory_chunk->IsLargePage()) return false;
   return id_ == kToSpace ? memory_chunk->IsToPage()
                          : memory_chunk->IsFromPage();
 }
 
-bool SemiSpace::Contains(Object o) const {
-  return o.IsHeapObject() && Contains(HeapObject::cast(o));
+bool SemiSpace::Contains(Tagged<Object> o) const {
+  return IsHeapObject(o) && Contains(HeapObject::cast(o));
+}
+
+template <typename T>
+inline bool SemiSpace::Contains(Tagged<T> o) const {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return Contains(*o);
 }
 
 bool SemiSpace::ContainsSlow(Address a) const {
@@ -41,11 +48,11 @@ bool SemiSpace::ContainsSlow(Address a) const {
 // --------------------------------------------------------------------------
 // NewSpace
 
-bool NewSpace::Contains(Object o) const {
-  return o.IsHeapObject() && Contains(HeapObject::cast(o));
+bool NewSpace::Contains(Tagged<Object> o) const {
+  return IsHeapObject(o) && Contains(HeapObject::cast(o));
 }
 
-bool NewSpace::Contains(HeapObject o) const {
+bool NewSpace::Contains(Tagged<HeapObject> o) const {
   return BasicMemoryChunk::FromHeapObject(o)->InNewSpace();
 }
 
@@ -106,14 +113,26 @@ V8_INLINE bool SemiSpaceNewSpace::EnsureAllocation(
 V8_INLINE bool PagedSpaceForNewSpace::EnsureAllocation(
     int size_in_bytes, AllocationAlignment alignment, AllocationOrigin origin,
     int* out_max_aligned_size) {
+  if (last_lab_page_) {
+    last_lab_page_->DecreaseAllocatedLabSize(limit() - top());
+    SetLimit(top());
+    // No need to write a filler to the remaining lab because it will either be
+    // reallocated if the lab can be extended or freed otherwise.
+  }
+
   if (!PagedSpaceBase::EnsureAllocation(size_in_bytes, alignment, origin,
                                         out_max_aligned_size)) {
     if (!AddPageBeyondCapacity(size_in_bytes, origin)) {
-      return false;
+      if (!WaitForSweepingForAllocation(size_in_bytes, origin)) {
+        return false;
+      }
     }
   }
 
-  allocated_linear_areas_ += limit() - top();
+  last_lab_page_ = Page::FromAllocationAreaAddress(top());
+  DCHECK_NOT_NULL(last_lab_page_);
+  last_lab_page_->IncreaseAllocatedLabSize(limit() - top());
+
   return true;
 }
 
@@ -123,17 +142,17 @@ V8_INLINE bool PagedSpaceForNewSpace::EnsureAllocation(
 SemiSpaceObjectIterator::SemiSpaceObjectIterator(const SemiSpaceNewSpace* space)
     : current_(space->first_allocatable_address()) {}
 
-HeapObject SemiSpaceObjectIterator::Next() {
+Tagged<HeapObject> SemiSpaceObjectIterator::Next() {
   while (true) {
     if (Page::IsAlignedToPageSize(current_)) {
       Page* page = Page::FromAllocationAreaAddress(current_);
       page = page->next_page();
-      if (page == nullptr) return HeapObject();
+      if (page == nullptr) return Tagged<HeapObject>();
       current_ = page->area_start();
     }
-    HeapObject object = HeapObject::FromAddress(current_);
-    current_ += ALIGN_TO_ALLOCATION_ALIGNMENT(object.Size());
-    if (!object.IsFreeSpaceOrFiller()) return object;
+    Tagged<HeapObject> object = HeapObject::FromAddress(current_);
+    current_ += ALIGN_TO_ALLOCATION_ALIGNMENT(object->Size());
+    if (!IsFreeSpaceOrFiller(object)) return object;
   }
 }
 
diff --git a/deps/v8/src/heap/new-spaces.cc b/deps/v8/src/heap/new-spaces.cc
index 8358f3d3f96c0b..e4a4b46d6322e0 100644
--- a/deps/v8/src/heap/new-spaces.cc
+++ b/deps/v8/src/heap/new-spaces.cc
@@ -4,9 +4,13 @@
 
 #include "src/heap/new-spaces.h"
 
+#include <atomic>
+
 #include "src/common/globals.h"
 #include "src/heap/allocation-observer.h"
 #include "src/heap/array-buffer-sweeper.h"
+#include "src/heap/concurrent-marking.h"
+#include "src/heap/free-list-inl.h"
 #include "src/heap/gc-tracer-inl.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap-verifier.h"
@@ -15,10 +19,12 @@
 #include "src/heap/marking-state-inl.h"
 #include "src/heap/marking-state.h"
 #include "src/heap/memory-allocator.h"
+#include "src/heap/page-inl.h"
 #include "src/heap/paged-spaces.h"
 #include "src/heap/safepoint.h"
 #include "src/heap/spaces-inl.h"
 #include "src/heap/spaces.h"
+#include "src/heap/zapping.h"
 
 namespace v8 {
 namespace internal {
@@ -27,10 +33,11 @@ Page* SemiSpace::InitializePage(MemoryChunk* chunk) {
   bool in_to_space = (id() != kFromSpace);
   chunk->SetFlag(in_to_space ? MemoryChunk::TO_PAGE : MemoryChunk::FROM_PAGE);
   Page* page = static_cast<Page*>(chunk);
-  page->SetYoungGenerationPageFlags(heap()->incremental_marking()->IsMarking());
+  page->SetYoungGenerationPageFlags(
+      heap()->incremental_marking()->marking_mode());
   page->list_node().Initialize();
-  if (v8_flags.minor_mc) {
-    heap()->non_atomic_marking_state()->ClearLiveness(page);
+  if (v8_flags.minor_ms) {
+    page->ClearLiveness();
   }
   page->InitializationMemoryFence();
   return page;
@@ -58,8 +65,6 @@ bool SemiSpace::EnsureCurrentCapacity() {
     while (current_page) {
       DCHECK_EQ(actual_pages, expected_pages);
       MemoryChunk* next_current = current_page->list_node().next();
-      // Promoted pages contain live objects and should not be discarded.
-      DCHECK(!current_page->IsFlagSet(Page::PAGE_NEW_NEW_PROMOTION));
       // `current_page_` contains the current allocation area. Thus, we should
       // never free the `current_page_`. Furthermore, live objects generally
       // reside before the current allocation area, so `current_page_` also
@@ -77,7 +82,6 @@ bool SemiSpace::EnsureCurrentCapacity() {
     }
 
     // Add more pages if we have less than expected_pages.
-    NonAtomicMarkingState* marking_state = heap()->non_atomic_marking_state();
     while (actual_pages < expected_pages) {
       actual_pages++;
       current_page = heap()->memory_allocator()->AllocatePage(
@@ -87,7 +91,7 @@ bool SemiSpace::EnsureCurrentCapacity() {
       AccountCommitted(Page::kPageSize);
       IncrementCommittedPhysicalMemory(current_page->CommittedPhysicalMemory());
       memory_chunk_list_.PushBack(current_page);
-      marking_state->ClearLiveness(current_page);
+      current_page->ClearLiveness();
       current_page->SetFlags(first_page()->GetFlags());
       heap()->CreateFillerObjectAt(current_page->area_start(),
                                    static_cast<int>(current_page->area_size()));
@@ -183,7 +187,6 @@ bool SemiSpace::GrowTo(size_t new_capacity) {
   DCHECK(IsAligned(delta, AllocatePageSize()));
   const int delta_pages = static_cast<int>(delta / Page::kPageSize);
   DCHECK(last_page());
-  NonAtomicMarkingState* marking_state = heap()->non_atomic_marking_state();
   for (int pages_added = 0; pages_added < delta_pages; pages_added++) {
     Page* new_page = heap()->memory_allocator()->AllocatePage(
         MemoryAllocator::AllocationMode::kUsePool, this, NOT_EXECUTABLE);
@@ -192,7 +195,7 @@ bool SemiSpace::GrowTo(size_t new_capacity) {
       return false;
     }
     memory_chunk_list_.PushBack(new_page);
-    marking_state->ClearLiveness(new_page);
+    new_page->ClearLiveness();
     IncrementCommittedPhysicalMemory(new_page->CommittedPhysicalMemory());
     // Duplicate the flags that was set on the old page.
     new_page->SetFlags(last_page()->GetFlags(), Page::kCopyOnFlipFlagsMask);
@@ -264,10 +267,11 @@ void SemiSpace::RemovePage(Page* page) {
   memory_chunk_list_.Remove(page);
   AccountUncommitted(Page::kPageSize);
   DecrementCommittedPhysicalMemory(page->CommittedPhysicalMemory());
-  for (size_t i = 0; i < ExternalBackingStoreType::kNumTypes; i++) {
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    DecrementExternalBackingStoreBytes(t, page->ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, page](ExternalBackingStoreType type, int index) {
+        DecrementExternalBackingStoreBytes(
+            type, page->ExternalBackingStoreBytes(type));
+      });
 }
 
 void SemiSpace::PrependPage(Page* page) {
@@ -277,10 +281,11 @@ void SemiSpace::PrependPage(Page* page) {
   current_capacity_ += Page::kPageSize;
   AccountCommitted(Page::kPageSize);
   IncrementCommittedPhysicalMemory(page->CommittedPhysicalMemory());
-  for (size_t i = 0; i < ExternalBackingStoreType::kNumTypes; i++) {
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    IncrementExternalBackingStoreBytes(t, page->ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, page](ExternalBackingStoreType type, int index) {
+        IncrementExternalBackingStoreBytes(
+            type, page->ExternalBackingStoreBytes(type));
+      });
 }
 
 void SemiSpace::MovePageToTheEnd(Page* page) {
@@ -304,8 +309,17 @@ void SemiSpace::Swap(SemiSpace* from, SemiSpace* to) {
   std::swap(from->age_mark_, to->age_mark_);
   std::swap(from->memory_chunk_list_, to->memory_chunk_list_);
   std::swap(from->current_page_, to->current_page_);
-  std::swap(from->external_backing_store_bytes_,
-            to->external_backing_store_bytes_);
+  ForAll<ExternalBackingStoreType>(
+      [from, to](ExternalBackingStoreType type, int index) {
+        const size_t tmp = from->external_backing_store_bytes_[index].load(
+            std::memory_order_relaxed);
+        from->external_backing_store_bytes_[index].store(
+            to->external_backing_store_bytes_[index].load(
+                std::memory_order_relaxed),
+            std::memory_order_relaxed);
+        to->external_backing_store_bytes_[index].store(
+            tmp, std::memory_order_relaxed);
+      });
   std::swap(from->committed_physical_memory_, to->committed_physical_memory_);
 
   to->FixPagesFlags(saved_to_space_flags, Page::kCopyOnFlipFlagsMask);
@@ -360,11 +374,8 @@ void SemiSpace::Print() {}
 #ifdef VERIFY_HEAP
 void SemiSpace::VerifyPageMetadata() const {
   bool is_from_space = (id_ == kFromSpace);
-  size_t external_backing_store_bytes[kNumTypes];
-
-  for (int i = 0; i < kNumTypes; i++) {
-    external_backing_store_bytes[static_cast<ExternalBackingStoreType>(i)] = 0;
-  }
+  size_t external_backing_store_bytes[static_cast<int>(
+      ExternalBackingStoreType::kNumValues)] = {0};
 
   int actual_pages = 0;
   size_t computed_committed_physical_memory = 0;
@@ -381,16 +392,19 @@ void SemiSpace::VerifyPageMetadata() const {
       // The pointers-from-here-are-interesting flag isn't updated dynamically
       // on from-space pages, so it might be out of sync with the marking state.
       if (page->heap()->incremental_marking()->IsMarking()) {
+        DCHECK(page->heap()->incremental_marking()->IsMajorMarking());
         CHECK(page->IsFlagSet(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING));
       } else {
         CHECK(
             !page->IsFlagSet(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING));
       }
     }
-    for (int i = 0; i < kNumTypes; i++) {
-      ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-      external_backing_store_bytes[t] += page->ExternalBackingStoreBytes(t);
-    }
+    ForAll<ExternalBackingStoreType>(
+        [&external_backing_store_bytes, page](ExternalBackingStoreType type,
+                                              int index) {
+          external_backing_store_bytes[index] +=
+              page->ExternalBackingStoreBytes(type);
+        });
 
     computed_committed_physical_memory += page->CommittedPhysicalMemory();
 
@@ -400,11 +414,12 @@ void SemiSpace::VerifyPageMetadata() const {
   }
   CHECK_EQ(actual_pages * size_t(Page::kPageSize), CommittedMemory());
   CHECK_EQ(computed_committed_physical_memory, CommittedPhysicalMemory());
-
-  for (int i = 0; i < kNumTypes; i++) {
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    CHECK_EQ(external_backing_store_bytes[t], ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, external_backing_store_bytes](ExternalBackingStoreType type,
+                                           int index) {
+        CHECK_EQ(external_backing_store_bytes[index],
+                 ExternalBackingStoreBytes(type));
+      });
 }
 #endif  // VERIFY_HEAP
 
@@ -433,9 +448,8 @@ void SemiSpace::AssertValidRange(Address start, Address end) {
 // NewSpace implementation
 
 NewSpace::NewSpace(Heap* heap, LinearAllocationArea& allocation_info)
-    : SpaceWithLinearArea(heap, NEW_SPACE, new NoFreeList(),
-                          allocation_counter_, allocation_info,
-                          linear_area_original_data_) {}
+    : SpaceWithLinearArea(heap, NEW_SPACE, nullptr, allocation_counter_,
+                          allocation_info, linear_area_original_data_) {}
 
 void NewSpace::MaybeFreeUnusedLab(LinearAllocationArea info) {
   if (allocation_info_.MergeIfAdjacent(info)) {
@@ -465,7 +479,6 @@ void NewSpace::VerifyTop() const {
 void NewSpace::PromotePageToOldSpace(Page* page) {
   DCHECK(!page->IsFlagSet(Page::PAGE_NEW_OLD_PROMOTION));
   DCHECK(page->InYoungGeneration());
-  page->ClearWasUsedForAllocation();
   RemovePage(page);
   Page* new_page = Page::ConvertNewToOld(page);
   DCHECK(!new_page->InYoungGeneration());
@@ -578,9 +591,8 @@ void SemiSpaceNewSpace::ResetLinearAllocationArea() {
   to_space_.Reset();
   UpdateLinearAllocationArea();
   // Clear all mark-bits in the to-space.
-  NonAtomicMarkingState* marking_state = heap()->non_atomic_marking_state();
   for (Page* p : to_space_) {
-    marking_state->ClearLiveness(p);
+    p->ClearLiveness();
     // Concurrent marking may have local live bytes for this page.
     heap()->concurrent_marking()->ClearMemoryChunkData(p);
   }
@@ -701,11 +713,8 @@ void SemiSpaceNewSpace::Verify(Isolate* isolate,
 // that it works (it depends on the invariants we are checking).
 void SemiSpaceNewSpace::VerifyObjects(Isolate* isolate,
                                       SpaceVerificationVisitor* visitor) const {
-  size_t external_space_bytes[kNumTypes];
-  for (int i = 0; i < kNumTypes; i++) {
-    external_space_bytes[static_cast<ExternalBackingStoreType>(i)] = 0;
-  }
-
+  size_t external_space_bytes[static_cast<int>(
+      ExternalBackingStoreType::kNumValues)] = {0};
   PtrComprCageBase cage_base(isolate);
   for (const Page* page = to_space_.first_page(); page;
        page = page->next_page()) {
@@ -714,19 +723,19 @@ void SemiSpaceNewSpace::VerifyObjects(Isolate* isolate,
     Address current_address = page->area_start();
 
     while (!Page::IsAlignedToPageSize(current_address)) {
-      HeapObject object = HeapObject::FromAddress(current_address);
+      Tagged<HeapObject> object = HeapObject::FromAddress(current_address);
 
       // The first word should be a map, and we expect all map pointers to
       // be in map space or read-only space.
-      int size = object.Size(cage_base);
+      int size = object->Size(cage_base);
 
       visitor->VerifyObject(object);
 
-      if (object.IsExternalString(cage_base)) {
-        ExternalString external_string = ExternalString::cast(object);
-        size_t string_size = external_string.ExternalPayloadSize();
-        external_space_bytes[ExternalBackingStoreType::kExternalString] +=
-            string_size;
+      if (IsExternalString(object, cage_base)) {
+        Tagged<ExternalString> external_string = ExternalString::cast(object);
+        size_t string_size = external_string->ExternalPayloadSize();
+        external_space_bytes[static_cast<int>(
+            ExternalBackingStoreType::kExternalString)] += string_size;
       }
 
       current_address += ALIGN_TO_ALLOCATION_ALIGNMENT(size);
@@ -735,11 +744,13 @@ void SemiSpaceNewSpace::VerifyObjects(Isolate* isolate,
     visitor->VerifyPageDone(page);
   }
 
-  for (int i = 0; i < kNumTypes; i++) {
-    if (i == ExternalBackingStoreType::kArrayBuffer) continue;
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    CHECK_EQ(external_space_bytes[t], ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, external_space_bytes](ExternalBackingStoreType type, int index) {
+        if (type == ExternalBackingStoreType::kArrayBuffer) {
+          return;
+        }
+        CHECK_EQ(external_space_bytes[index], ExternalBackingStoreBytes(type));
+      });
 
   if (!v8_flags.concurrent_array_buffer_sweeping) {
     size_t bytes = heap()->array_buffer_sweeper()->young().BytesSlow();
@@ -847,9 +858,9 @@ void SemiSpaceNewSpace::GarbageCollectionEpilogue() { set_age_mark(top()); }
 void SemiSpaceNewSpace::ZapUnusedMemory() {
   if (!IsFromSpaceCommitted()) return;
   for (Page* page : PageRange(from_space().first_page(), nullptr)) {
-    heap_->memory_allocator()->ZapBlock(
-        page->area_start(), page->HighWaterMark() - page->area_start(),
-        heap_->ZapValue());
+    heap::ZapBlock(page->area_start(),
+                   page->HighWaterMark() - page->area_start(),
+                   heap::ZapValue());
   }
 }
 
@@ -859,13 +870,6 @@ void SemiSpaceNewSpace::RemovePage(Page* page) {
   from_space().RemovePage(page);
 }
 
-void SemiSpaceNewSpace::PromotePageInNewSpace(Page* page) {
-  DCHECK(page->IsFromPage());
-  from_space_.RemovePage(page);
-  to_space_.PrependPage(page);
-  page->SetFlag(Page::PAGE_NEW_NEW_PROMOTION);
-}
-
 bool SemiSpaceNewSpace::IsPromotionCandidate(const MemoryChunk* page) const {
   return !page->Contains(age_mark());
 }
@@ -895,10 +899,6 @@ PagedSpaceForNewSpace::PagedSpaceForNewSpace(
       max_capacity_(RoundDown(max_capacity, Page::kPageSize)),
       target_capacity_(initial_capacity_) {
   DCHECK_LE(initial_capacity_, max_capacity_);
-
-  if (!PreallocatePages()) {
-    V8::FatalProcessOutOfMemory(heap->isolate(), "New space setup");
-  }
 }
 
 Page* PagedSpaceForNewSpace::InitializePage(MemoryChunk* chunk) {
@@ -910,8 +910,9 @@ Page* PagedSpaceForNewSpace::InitializePage(MemoryChunk* chunk) {
   // Make sure that categories are initialized before freeing the area.
   page->ResetAllocationStatistics();
   page->SetFlags(Page::TO_PAGE);
-  page->SetYoungGenerationPageFlags(heap()->incremental_marking()->IsMarking());
-  heap()->non_atomic_marking_state()->ClearLiveness(page);
+  page->SetYoungGenerationPageFlags(
+      heap()->incremental_marking()->marking_mode());
+  page->ClearLiveness();
   page->AllocateFreeListCategories();
   page->InitializeFreeListCategories();
   page->list_node().Initialize();
@@ -931,7 +932,6 @@ void PagedSpaceForNewSpace::Grow() {
 }
 
 bool PagedSpaceForNewSpace::StartShrinking() {
-  DCHECK_GE(current_capacity_, target_capacity_);
   DCHECK(heap()->tracer()->IsInAtomicPause());
   size_t new_target_capacity =
       RoundUp(std::max(initial_capacity_, 2 * Size()), Page::kPageSize);
@@ -948,7 +948,7 @@ void PagedSpaceForNewSpace::FinishShrinking() {
     // space could not be shrunk all the way down to `target_capacity_`, it
     // must mean that all pages contain live objects.
     for (Page* page : *this) {
-      DCHECK_NE(0, heap()->non_atomic_marking_state()->live_bytes(page));
+      DCHECK_NE(0, page->live_bytes());
     }
 #endif  // DEBUG
     target_capacity_ = current_capacity_;
@@ -956,13 +956,21 @@ void PagedSpaceForNewSpace::FinishShrinking() {
 }
 
 void PagedSpaceForNewSpace::UpdateInlineAllocationLimit() {
+  Address old_limit = limit();
   PagedSpaceBase::UpdateInlineAllocationLimit();
+  Address new_limit = limit();
+  DCHECK_LE(new_limit, old_limit);
+  if (new_limit != old_limit) {
+    Page::FromAllocationAreaAddress(top())->DecreaseAllocatedLabSize(old_limit -
+                                                                     new_limit);
+  }
 }
 
 size_t PagedSpaceForNewSpace::AddPage(Page* page) {
   current_capacity_ += Page::kPageSize;
-  DCHECK_IMPLIES(!force_allocation_success_,
-                 UsableCapacity() <= TotalCapacity());
+  DCHECK_IMPLIES(
+      !force_allocation_success_ && !heap_->ShouldOptimizeForLoadTime(),
+      UsableCapacity() <= TotalCapacity());
   return PagedSpaceBase::AddPage(page);
 }
 
@@ -975,29 +983,22 @@ void PagedSpaceForNewSpace::RemovePage(Page* page) {
 void PagedSpaceForNewSpace::ReleasePage(Page* page) {
   DCHECK_LE(Page::kPageSize, current_capacity_);
   current_capacity_ -= Page::kPageSize;
-  PagedSpaceBase::ReleasePage(page);
-}
-
-bool PagedSpaceForNewSpace::PreallocatePages() {
-  while (current_capacity_ < target_capacity_) {
-    if (!TryExpandImpl()) return false;
-  }
-  DCHECK_GE(current_capacity_, target_capacity_);
-  return true;
+  PagedSpaceBase::ReleasePageImpl(
+      page, MemoryAllocator::FreeMode::kConcurrentlyAndPool);
 }
 
-bool PagedSpaceForNewSpace::EnsureCurrentCapacity() {
-  // Verify that the free space map is already initialized. Otherwise, new free
-  // list entries will be invalid.
-  DCHECK_NE(kNullAddress,
-            heap()->isolate()->root(RootIndex::kFreeSpaceMap).ptr());
-  return PreallocatePages();
+bool PagedSpaceForNewSpace::AddFreshPage() {
+  if (current_capacity_ >= target_capacity_) return false;
+  return AllocatePage();
 }
 
 void PagedSpaceForNewSpace::FreeLinearAllocationArea() {
-  size_t remaining_allocation_area_size = limit() - top();
-  DCHECK_GE(allocated_linear_areas_, remaining_allocation_area_size);
-  allocated_linear_areas_ -= remaining_allocation_area_size;
+  if (top() == kNullAddress) {
+    DCHECK_EQ(kNullAddress, limit());
+    return;
+  }
+  Page::FromAllocationAreaAddress(top())->DecreaseAllocatedLabSize(limit() -
+                                                                   top());
   PagedSpaceBase::FreeLinearAllocationArea();
 }
 
@@ -1005,48 +1006,96 @@ bool PagedSpaceForNewSpace::ShouldReleaseEmptyPage() const {
   return current_capacity_ > target_capacity_;
 }
 
-void PagedSpaceForNewSpace::RefillFreeList() {
-  // New space is not used for concurrent allcations or allocations during
-  // evacuation.
-  DCHECK(heap_->IsMainThread() ||
-         (heap_->IsSharedMainThread() &&
-          !heap_->isolate()->is_shared_space_isolate()));
-  DCHECK(!is_compaction_space());
-
-  Sweeper* sweeper = heap()->sweeper();
-
-  Sweeper::SweptList swept_pages = sweeper->GetAllSweptPagesSafe(this);
-  if (swept_pages.empty()) return;
-
-  base::MutexGuard guard(mutex());
-  for (Page* p : swept_pages) {
-    DCHECK(!p->IsFlagSet(Page::NEVER_ALLOCATE_ON_PAGE));
-    RefineAllocatedBytesAfterSweeping(p);
-    RelinkFreeListCategories(p);
+bool PagedSpaceForNewSpace::AddPageBeyondCapacity(int size_in_bytes,
+                                                  AllocationOrigin origin) {
+  DCHECK(heap()->sweeper()->IsSweepingDoneForSpace(NEW_SPACE));
+  // Allocate another page is `force_allocation_success_` is true,
+  // `UsableCapacity()` is below `TotalCapacity()` and allocating another page
+  // won't exceed `TotalCapacity()`, or `ShouldOptimizeForLoadTime()` is true.
+  if (force_allocation_success_ ||
+      ((UsableCapacity() < TotalCapacity()) &&
+       (TotalCapacity() - UsableCapacity() >= Page::kPageSize)) ||
+      heap_->ShouldOptimizeForLoadTime()) {
+    if (!heap()->CanExpandOldGeneration(
+            Size() + heap()->new_lo_space()->Size() + Page::kPageSize)) {
+      // Assuming all of new space is alive, doing a full GC and promoting all
+      // objects should still succeed. Don't let new space grow if it means it
+      // will exceed the available size of old space.
+      return false;
+    }
+    if (!AllocatePage()) return false;
+    return TryAllocationFromFreeListMain(static_cast<size_t>(size_in_bytes),
+                                         origin);
   }
+  return false;
 }
 
-bool PagedSpaceForNewSpace::AddPageBeyondCapacity(int size_in_bytes,
-                                                  AllocationOrigin origin) {
+bool PagedSpaceForNewSpace::AllocatePage() {
+  // Verify that the free space map is already initialized. Otherwise, new free
+  // list entries will be invalid.
+  DCHECK_NE(kNullAddress,
+            heap()->isolate()->root(RootIndex::kFreeSpaceMap).ptr());
+  return TryExpandImpl(MemoryAllocator::AllocationMode::kUsePool);
+}
+
+bool PagedSpaceForNewSpace::WaitForSweepingForAllocation(
+    int size_in_bytes, AllocationOrigin origin) {
+  // This method should be called only when there are no more pages for main
+  // thread to sweep.
   DCHECK(heap()->sweeper()->IsSweepingDoneForSpace(NEW_SPACE));
-  if (!force_allocation_success_ &&
-      ((UsableCapacity() >= TotalCapacity()) ||
-       (TotalCapacity() - UsableCapacity() < Page::kPageSize)))
+  if (!v8_flags.concurrent_sweeping || !heap()->sweeping_in_progress())
     return false;
-  if (!heap()->CanExpandOldGeneration(Size() + heap()->new_lo_space()->Size() +
-                                      Page::kPageSize)) {
-    // Assuming all of new space if alive, doing a full GC and promoting all
-    // objects should still succeed. Don't let new space grow if it means it
-    // will exceed the available size of old space.
+  Sweeper* sweeper = heap()->sweeper();
+  if (!sweeper->AreMinorSweeperTasksRunning() &&
+      !sweeper->ShouldRefillFreelistForSpace(NEW_SPACE)) {
+#if DEBUG
+    for (Page* p : *this) {
+      DCHECK(p->SweepingDone());
+      p->ForAllFreeListCategories([this](FreeListCategory* category) {
+        DCHECK_IMPLIES(!category->is_empty(), category->is_linked(free_list()));
+      });
+    }
+#endif  // DEBUG
+    // All pages are already swept and relinked to the free list
     return false;
   }
-  DCHECK_IMPLIES(heap()->incremental_marking()->IsMarking(),
-                 heap()->incremental_marking()->IsMajorMarking());
-  if (!TryExpandImpl()) return false;
+  // When getting here we know that any unswept new space page is currently
+  // being handled by a concurrent sweeping thread. Rather than try to cancel
+  // tasks and restart them, we wait "per page". This should be faster.
+  for (Page* p : *this) {
+    if (!p->SweepingDone()) sweeper->WaitForPageToBeSwept(p);
+  }
+  RefillFreeList();
+  DCHECK(!sweeper->ShouldRefillFreelistForSpace(NEW_SPACE));
   return TryAllocationFromFreeListMain(static_cast<size_t>(size_in_bytes),
                                        origin);
 }
 
+bool PagedSpaceForNewSpace::IsPromotionCandidate(
+    const MemoryChunk* page) const {
+  DCHECK_EQ(this, page->owner());
+  if (page == last_lab_page_) return false;
+  return page->AllocatedLabSize() <=
+         static_cast<size_t>(
+             Page::kPageSize *
+             v8_flags.minor_ms_page_promotion_max_lab_threshold / 100);
+}
+
+#ifdef VERIFY_HEAP
+void PagedSpaceForNewSpace::Verify(Isolate* isolate,
+                                   SpaceVerificationVisitor* visitor) const {
+  PagedSpaceBase::Verify(isolate, visitor);
+
+  CHECK_EQ(current_capacity_, Page::kPageSize * CountTotalPages());
+
+  auto sum_allocated_labs = [](size_t sum, const Page* page) {
+    return sum + page->AllocatedLabSize();
+  };
+  CHECK_EQ(AllocatedSinceLastGC() + limit() - top(),
+           std::accumulate(begin(), end(), 0, sum_allocated_labs));
+}
+#endif  // VERIFY_HEAP
+
 // -----------------------------------------------------------------------------
 // PagedNewSpace implementation
 
diff --git a/deps/v8/src/heap/new-spaces.h b/deps/v8/src/heap/new-spaces.h
index c569aceb21458b..916d9238361618 100644
--- a/deps/v8/src/heap/new-spaces.h
+++ b/deps/v8/src/heap/new-spaces.h
@@ -7,6 +7,7 @@
 
 #include <atomic>
 #include <memory>
+#include <numeric>
 
 #include "src/base/logging.h"
 #include "src/base/macros.h"
@@ -18,6 +19,7 @@
 #include "src/heap/paged-spaces.h"
 #include "src/heap/spaces.h"
 #include "src/objects/heap-object.h"
+#include "v8-internal.h"
 
 namespace v8 {
 namespace internal {
@@ -42,17 +44,12 @@ class SemiSpace final : public Space {
   static void Swap(SemiSpace* from, SemiSpace* to);
 
   SemiSpace(Heap* heap, SemiSpaceId semispace)
-      : Space(heap, NEW_SPACE, new NoFreeList(), allocation_counter_),
-        current_capacity_(0),
-        target_capacity_(0),
-        maximum_capacity_(0),
-        minimum_capacity_(0),
-        age_mark_(kNullAddress),
-        id_(semispace),
-        current_page_(nullptr) {}
-
-  inline bool Contains(HeapObject o) const;
-  inline bool Contains(Object o) const;
+      : Space(heap, NEW_SPACE, nullptr, allocation_counter_), id_(semispace) {}
+
+  inline bool Contains(Tagged<HeapObject> o) const;
+  inline bool Contains(Tagged<Object> o) const;
+  template <typename T>
+  inline bool Contains(Tagged<T> o) const;
   inline bool ContainsSlow(Address a) const;
 
   void SetUp(size_t initial_capacity, size_t maximum_capacity);
@@ -142,12 +139,8 @@ class SemiSpace final : public Space {
 
   size_t Available() const final { UNREACHABLE(); }
 
-  Page* first_page() final {
-    return reinterpret_cast<Page*>(memory_chunk_list_.front());
-  }
-  Page* last_page() final {
-    return reinterpret_cast<Page*>(memory_chunk_list_.back());
-  }
+  Page* first_page() final { return Page::cast(memory_chunk_list_.front()); }
+  Page* last_page() final { return Page::cast(memory_chunk_list_.back()); }
 
   const Page* first_page() const final {
     return reinterpret_cast<const Page*>(memory_chunk_list_.front());
@@ -194,27 +187,19 @@ class SemiSpace final : public Space {
   void DecrementCommittedPhysicalMemory(size_t decrement_value);
 
   // The currently committed space capacity.
-  size_t current_capacity_;
-
+  size_t current_capacity_ = 0;
   // The targetted committed space capacity.
-  size_t target_capacity_;
-
+  size_t target_capacity_ = 0;
   // The maximum capacity that can be used by this space. A space cannot grow
   // beyond that size.
-  size_t maximum_capacity_;
-
+  size_t maximum_capacity_ = 0;
   // The minimum capacity for the space. A space cannot shrink below this size.
-  size_t minimum_capacity_;
-
+  size_t minimum_capacity_ = 0;
   // Used to govern object promotion during mark-compact collection.
-  Address age_mark_;
-
-  size_t committed_physical_memory_{0};
-
+  Address age_mark_ = kNullAddress;
+  size_t committed_physical_memory_ = 0;
   SemiSpaceId id_;
-
-  Page* current_page_;
-
+  Page* current_page_ = nullptr;
   AllocationCounter allocation_counter_;
 
   friend class SemiSpaceNewSpace;
@@ -228,7 +213,7 @@ class SemiSpaceObjectIterator : public ObjectIterator {
   // Create an iterator over the objects in the given to-space.
   inline explicit SemiSpaceObjectIterator(const SemiSpaceNewSpace* space);
 
-  inline HeapObject Next() final;
+  inline Tagged<HeapObject> Next() final;
 
  private:
   // The current iteration point.
@@ -242,8 +227,8 @@ class NewSpace : NON_EXPORTED_BASE(public SpaceWithLinearArea) {
 
   NewSpace(Heap* heap, LinearAllocationArea& allocation_info);
 
-  inline bool Contains(Object o) const;
-  inline bool Contains(HeapObject o) const;
+  inline bool Contains(Tagged<Object> o) const;
+  inline bool Contains(Tagged<HeapObject> o) const;
   virtual bool ContainsSlow(Address a) const = 0;
 
 #if DEBUG
@@ -256,21 +241,16 @@ class NewSpace : NON_EXPORTED_BASE(public SpaceWithLinearArea) {
 
   void MaybeFreeUnusedLab(LinearAllocationArea info);
 
-  bool IsAtMaximumCapacity() const {
-    return TotalCapacity() == MaximumCapacity();
-  }
-
   size_t ExternalBackingStoreOverallBytes() const {
     size_t result = 0;
-    for (int i = 0; i < ExternalBackingStoreType::kNumTypes; i++) {
-      result +=
-          ExternalBackingStoreBytes(static_cast<ExternalBackingStoreType>(i));
-    }
+    ForAll<ExternalBackingStoreType>(
+        [this, &result](ExternalBackingStoreType type, int index) {
+          result += ExternalBackingStoreBytes(type);
+        });
     return result;
   }
 
   void PromotePageToOldSpace(Page* page);
-  virtual void PromotePageInNewSpace(Page* page) = 0;
 
   virtual size_t Capacity() const = 0;
   virtual size_t TotalCapacity() const = 0;
@@ -280,8 +260,6 @@ class NewSpace : NON_EXPORTED_BASE(public SpaceWithLinearArea) {
   // Grow the capacity of the space.
   virtual void Grow() = 0;
 
-  virtual bool ShouldBePromoted(Address) const = 0;
-
   // Creates a filler object in the linear allocation area.
   virtual void MakeLinearAllocationAreaIterable() = 0;
 
@@ -330,7 +308,7 @@ class V8_EXPORT_PRIVATE SemiSpaceNewSpace final : public NewSpace {
 
  public:
   static SemiSpaceNewSpace* From(NewSpace* space) {
-    DCHECK(!v8_flags.minor_mc);
+    DCHECK(!v8_flags.minor_ms);
     return static_cast<SemiSpaceNewSpace*>(space);
   }
 
@@ -402,8 +380,6 @@ class V8_EXPORT_PRIVATE SemiSpaceNewSpace final : public NewSpace {
 
   size_t AllocatedSinceLastGC() const final;
 
-  void PromotePageInNewSpace(Page* page) final;
-
   bool EnsureCurrentCapacity() final;
 
   // Return the maximum capacity of a semispace.
@@ -492,7 +468,7 @@ class V8_EXPORT_PRIVATE SemiSpaceNewSpace final : public NewSpace {
   SemiSpace& to_space() { return to_space_; }
   const SemiSpace& to_space() const { return to_space_; }
 
-  bool ShouldBePromoted(Address address) const final;
+  bool ShouldBePromoted(Address address) const;
 
   void Prologue() final;
 
@@ -558,9 +534,7 @@ class V8_EXPORT_PRIVATE PagedSpaceForNewSpace final : public PagedSpaceBase {
   void FinishShrinking();
 
   size_t AllocatedSinceLastGC() const {
-    // allocated since last gc is compiuted as allocated linear areas minus
-    // currently remaining linear area.
-    return allocated_linear_areas_ - (limit() - top());
+    return Size() - size_at_last_gc_ - (original_limit_relaxed() - top());
   }
 
   // Return the maximum capacity of the space.
@@ -576,8 +550,9 @@ class V8_EXPORT_PRIVATE PagedSpaceForNewSpace final : public PagedSpaceBase {
 
   // Reset the allocation pointer.
   void GarbageCollectionEpilogue() {
-    allocated_linear_areas_ = 0;
+    size_at_last_gc_ = Size();
     force_allocation_success_ = false;
+    last_lab_page_ = nullptr;
   }
 
   // When inline allocation stepping is active, either because of incremental
@@ -591,13 +566,13 @@ class V8_EXPORT_PRIVATE PagedSpaceForNewSpace final : public PagedSpaceBase {
   // Returns false if this isn't possible or reasonable (i.e., there
   // are no pages, or the current page is already empty), or true
   // if successful.
-  bool AddFreshPage() { return false; }
+  bool AddFreshPage();
 
   bool EnsureAllocation(int size_in_bytes, AllocationAlignment alignment,
                         AllocationOrigin origin,
                         int* out_max_aligned_size) final;
 
-  bool EnsureCurrentCapacity();
+  bool EnsureCurrentCapacity() { return true; }
 
   Page* InitializePage(MemoryChunk* chunk) final;
 
@@ -610,41 +585,43 @@ class V8_EXPORT_PRIVATE PagedSpaceForNewSpace final : public PagedSpaceBase {
   size_t ExternalBackingStoreBytes(ExternalBackingStoreType type) const final {
     if (type == ExternalBackingStoreType::kArrayBuffer)
       return heap()->YoungArrayBufferBytes();
-    return external_backing_store_bytes_[type];
+    return external_backing_store_bytes_[static_cast<int>(type)];
   }
 
 #ifdef VERIFY_HEAP
-  void Verify(Isolate* isolate, SpaceVerificationVisitor* visitor) const final {
-    PagedSpaceBase::Verify(isolate, visitor);
-
-    DCHECK_EQ(current_capacity_, Page::kPageSize * CountTotalPages());
-  }
-#endif
+  void Verify(Isolate* isolate, SpaceVerificationVisitor* visitor) const final;
+#endif  // VERIFY_HEAP
 
   void MakeIterable() { free_list()->RepairLists(heap()); }
 
   bool ShouldReleaseEmptyPage() const;
 
-  void RefillFreeList() final;
-
   bool AddPageBeyondCapacity(int size_in_bytes, AllocationOrigin origin);
+  bool WaitForSweepingForAllocation(int size_in_bytes, AllocationOrigin origin);
 
   void ForceAllocationSuccessUntilNextGC() { force_allocation_success_ = true; }
 
+  bool IsPromotionCandidate(const MemoryChunk* page) const;
+
+  // Return the available bytes without growing.
+  size_t Available() const final {
+    return PagedSpaceBase::Available() + limit() - top();
+  }
+
  private:
   size_t UsableCapacity() const {
     DCHECK_LE(free_list_->wasted_bytes(), current_capacity_);
     return current_capacity_ - free_list_->wasted_bytes();
   }
 
-  bool PreallocatePages();
+  bool AllocatePage();
 
   const size_t initial_capacity_;
   const size_t max_capacity_;
   size_t target_capacity_ = 0;
   size_t current_capacity_ = 0;
 
-  size_t allocated_linear_areas_ = 0;
+  Page* last_lab_page_ = nullptr;
 
   bool force_allocation_success_ = false;
 };
@@ -655,7 +632,7 @@ class V8_EXPORT_PRIVATE PagedSpaceForNewSpace final : public PagedSpaceBase {
 class V8_EXPORT_PRIVATE PagedNewSpace final : public NewSpace {
  public:
   static PagedNewSpace* From(NewSpace* space) {
-    DCHECK(v8_flags.minor_mc);
+    DCHECK(v8_flags.minor_ms);
     return static_cast<PagedNewSpace*>(space);
   }
 
@@ -702,9 +679,7 @@ class V8_EXPORT_PRIVATE PagedNewSpace final : public NewSpace {
   }
 
   // Return the available bytes without growing.
-  size_t Available() const final {
-    return paged_space_.Available() + limit() - top();
-  }
+  size_t Available() const final { return paged_space_.Available(); }
 
   size_t ExternalBackingStoreBytes(ExternalBackingStoreType type) const final {
     return paged_space_.ExternalBackingStoreBytes(type);
@@ -776,14 +751,12 @@ class V8_EXPORT_PRIVATE PagedNewSpace final : public NewSpace {
     return paged_space_.GetObjectIterator(heap);
   }
 
-  bool ShouldBePromoted(Address address) const final { return true; }
-
   void GarbageCollectionEpilogue() final {
     paged_space_.GarbageCollectionEpilogue();
   }
 
   bool IsPromotionCandidate(const MemoryChunk* page) const final {
-    return true;
+    return paged_space_.IsPromotionCandidate(page);
   }
 
   bool EnsureCurrentCapacity() final {
@@ -818,8 +791,6 @@ class V8_EXPORT_PRIVATE PagedNewSpace final : public NewSpace {
                                          out_max_aligned_size);
   }
 
-  void PromotePageInNewSpace(Page* page) final { UNREACHABLE(); }
-
   void RemovePage(Page* page) final { paged_space_.RemovePage(page); }
 
   PagedSpaceForNewSpace paged_space_;
diff --git a/deps/v8/src/heap/object-lock.h b/deps/v8/src/heap/object-lock.h
index 7263e47296f6a6..4da0dd491ad878 100644
--- a/deps/v8/src/heap/object-lock.h
+++ b/deps/v8/src/heap/object-lock.h
@@ -12,20 +12,20 @@ namespace v8::internal {
 
 class ExclusiveObjectLock final {
  public:
-  static void Lock(HeapObject heap_object) {
+  static void Lock(Tagged<HeapObject> heap_object) {
     MemoryChunk::FromHeapObject(heap_object)->shared_mutex()->LockExclusive();
   }
-  static void Unlock(HeapObject heap_object) {
+  static void Unlock(Tagged<HeapObject> heap_object) {
     MemoryChunk::FromHeapObject(heap_object)->shared_mutex()->UnlockExclusive();
   }
 };
 
 class SharedObjectLock final {
  public:
-  static void Lock(HeapObject heap_object) {
+  static void Lock(Tagged<HeapObject> heap_object) {
     MemoryChunk::FromHeapObject(heap_object)->shared_mutex()->LockShared();
   }
-  static void Unlock(HeapObject heap_object) {
+  static void Unlock(Tagged<HeapObject> heap_object) {
     MemoryChunk::FromHeapObject(heap_object)->shared_mutex()->UnlockShared();
   }
 };
@@ -33,7 +33,7 @@ class SharedObjectLock final {
 template <typename LockType>
 class ObjectLockGuard final {
  public:
-  explicit ObjectLockGuard(HeapObject object) : raw_object_(object) {
+  explicit ObjectLockGuard(Tagged<HeapObject> object) : raw_object_(object) {
     LockType::Lock(object);
   }
   ~ObjectLockGuard() { LockType::Unlock(raw_object_); }
diff --git a/deps/v8/src/heap/object-stats.cc b/deps/v8/src/heap/object-stats.cc
index 7b3e5428ddb8f3..e832b381c8118d 100644
--- a/deps/v8/src/heap/object-stats.cc
+++ b/deps/v8/src/heap/object-stats.cc
@@ -49,19 +49,19 @@ class FieldStatsCollector : public ObjectVisitorWithCageBases {
         string_data_count_(string_data_count),
         raw_fields_count_(raw_fields_count) {}
 
-  void RecordStats(HeapObject host) {
+  void RecordStats(Tagged<HeapObject> host) {
     size_t old_pointer_fields_count = *tagged_fields_count_;
-    host.Iterate(cage_base(), this);
+    host->Iterate(cage_base(), this);
     size_t tagged_fields_count_in_object =
         *tagged_fields_count_ - old_pointer_fields_count;
 
-    int object_size_in_words = host.Size(cage_base()) / kTaggedSize;
+    int object_size_in_words = host->Size(cage_base()) / kTaggedSize;
     DCHECK_LE(tagged_fields_count_in_object, object_size_in_words);
     size_t raw_fields_count_in_object =
         object_size_in_words - tagged_fields_count_in_object;
 
-    if (host.IsJSObject(cage_base())) {
-      JSObjectFieldStats field_stats = GetInobjectFieldStats(host.map());
+    if (IsJSObject(host, cage_base())) {
+      JSObjectFieldStats field_stats = GetInobjectFieldStats(host->map());
       // Embedder fields are already included into pointer words.
       DCHECK_LE(field_stats.embedded_fields_count_,
                 tagged_fields_count_in_object);
@@ -73,14 +73,14 @@ class FieldStatsCollector : public ObjectVisitorWithCageBases {
       tagged_fields_count_in_object -= field_stats.smi_fields_count_;
       *tagged_fields_count_ -= field_stats.smi_fields_count_;
       *inobject_smi_fields_count_ += field_stats.smi_fields_count_;
-    } else if (host.IsHeapNumber(cage_base())) {
+    } else if (IsHeapNumber(host, cage_base())) {
       DCHECK_LE(kDoubleSize / kTaggedSize, raw_fields_count_in_object);
       raw_fields_count_in_object -= kDoubleSize / kTaggedSize;
       *boxed_double_fields_count_ += 1;
-    } else if (host.IsSeqString(cage_base())) {
-      int string_data = SeqString::cast(host).length(kAcquireLoad) *
-                        (String::cast(host).IsOneByteRepresentation() ? 1 : 2) /
-                        kTaggedSize;
+    } else if (IsSeqString(host, cage_base())) {
+      int string_data =
+          SeqString::cast(host)->length(kAcquireLoad) *
+          (String::cast(host)->IsOneByteRepresentation() ? 1 : 2) / kTaggedSize;
       DCHECK_LE(string_data, raw_fields_count_in_object);
       raw_fields_count_in_object -= string_data;
       *string_data_count_ += string_data;
@@ -88,29 +88,32 @@ class FieldStatsCollector : public ObjectVisitorWithCageBases {
     *raw_fields_count_ += raw_fields_count_in_object;
   }
 
-  void VisitPointers(HeapObject host, ObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                      ObjectSlot end) override {
     *tagged_fields_count_ += (end - start);
   }
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) override {
     *tagged_fields_count_ += (end - start);
   }
 
-  V8_INLINE void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+  V8_INLINE void VisitInstructionStreamPointer(
+      Tagged<Code> host, InstructionStreamSlot slot) override {
     *tagged_fields_count_ += 1;
   }
 
-  void VisitCodeTarget(RelocInfo* rinfo) override {
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
     // InstructionStream target is most likely encoded as a relative 32-bit
     // offset and not as a full tagged value, so there's nothing to count.
   }
 
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override {
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
     *tagged_fields_count_ += 1;
   }
 
-  void VisitMapPointer(HeapObject host) override {
+  void VisitMapPointer(Tagged<HeapObject> host) override {
     // Just do nothing, but avoid the inherited UNREACHABLE implementation.
   }
 
@@ -124,7 +127,7 @@ class FieldStatsCollector : public ObjectVisitorWithCageBases {
   std::unordered_map<Map, JSObjectFieldStats, Object::Hasher>
       field_stats_cache_;
 
-  JSObjectFieldStats GetInobjectFieldStats(Map map);
+  JSObjectFieldStats GetInobjectFieldStats(Tagged<Map> map);
 
   size_t* const tagged_fields_count_;
   size_t* const embedder_fields_count_;
@@ -135,7 +138,7 @@ class FieldStatsCollector : public ObjectVisitorWithCageBases {
 };
 
 FieldStatsCollector::JSObjectFieldStats
-FieldStatsCollector::GetInobjectFieldStats(Map map) {
+FieldStatsCollector::GetInobjectFieldStats(Tagged<Map> map) {
   auto iter = field_stats_cache_.find(map);
   if (iter != field_stats_cache_.end()) {
     return iter->second;
@@ -143,10 +146,10 @@ FieldStatsCollector::GetInobjectFieldStats(Map map) {
   // Iterate descriptor array and calculate stats.
   JSObjectFieldStats stats;
   stats.embedded_fields_count_ = JSObject::GetEmbedderFieldCount(map);
-  if (!map.is_dictionary_map()) {
-    DescriptorArray descriptors = map.instance_descriptors();
-    for (InternalIndex descriptor : map.IterateOwnDescriptors()) {
-      PropertyDetails details = descriptors.GetDetails(descriptor);
+  if (!map->is_dictionary_map()) {
+    Tagged<DescriptorArray> descriptors = map->instance_descriptors();
+    for (InternalIndex descriptor : map->IterateOwnDescriptors()) {
+      PropertyDetails details = descriptors->GetDetails(descriptor);
       if (details.location() == PropertyLocation::kField) {
         FieldIndex index = FieldIndex::ForDetails(map, details);
         // Stop on first out-of-object field.
@@ -380,7 +383,7 @@ class ObjectStatsCollectorImpl {
   void CollectGlobalStatistics();
 
   enum class CollectFieldStats { kNo, kYes };
-  void CollectStatistics(HeapObject obj, Phase phase,
+  void CollectStatistics(Tagged<HeapObject> obj, Phase phase,
                          CollectFieldStats collect_field_stats);
 
  private:
@@ -391,7 +394,8 @@ class ObjectStatsCollectorImpl {
 
   Isolate* isolate() { return heap_->isolate(); }
 
-  bool RecordVirtualObjectStats(HeapObject parent, HeapObject obj,
+  bool RecordVirtualObjectStats(Tagged<HeapObject> parent,
+                                Tagged<HeapObject> obj,
                                 ObjectStats::VirtualInstanceType type,
                                 size_t size, size_t over_allocated,
                                 CowMode check_cow_array = kCheckCow);
@@ -399,50 +403,52 @@ class ObjectStatsCollectorImpl {
                                    ObjectStats::VirtualInstanceType type,
                                    size_t size);
   // Gets size from |ob| and assumes no over allocating.
-  bool RecordSimpleVirtualObjectStats(HeapObject parent, HeapObject obj,
+  bool RecordSimpleVirtualObjectStats(Tagged<HeapObject> parent,
+                                      Tagged<HeapObject> obj,
                                       ObjectStats::VirtualInstanceType type);
   // For HashTable it is possible to compute over allocated memory.
-  template <typename Derived, typename Shape>
-  void RecordHashTableVirtualObjectStats(HeapObject parent,
-                                         HashTable<Derived, Shape> hash_table,
+  template <typename Dictionary>
+  void RecordHashTableVirtualObjectStats(Tagged<HeapObject> parent,
+                                         Tagged<Dictionary> hash_table,
                                          ObjectStats::VirtualInstanceType type);
 
-  bool SameLiveness(HeapObject obj1, HeapObject obj2);
-  bool CanRecordFixedArray(FixedArrayBase array);
-  bool IsCowArray(FixedArrayBase array);
+  bool SameLiveness(Tagged<HeapObject> obj1, Tagged<HeapObject> obj2);
+  bool CanRecordFixedArray(Tagged<FixedArrayBase> array);
+  bool IsCowArray(Tagged<FixedArrayBase> array);
 
   // Blocklist for objects that should not be recorded using
   // VirtualObjectStats and RecordSimpleVirtualObjectStats. For recording those
   // objects dispatch to the low level ObjectStats::RecordObjectStats manually.
-  bool ShouldRecordObject(HeapObject object, CowMode check_cow_array);
+  bool ShouldRecordObject(Tagged<HeapObject> object, CowMode check_cow_array);
 
   void RecordObjectStats(
-      HeapObject obj, InstanceType type, size_t size,
+      Tagged<HeapObject> obj, InstanceType type, size_t size,
       size_t over_allocated = ObjectStats::kNoOverAllocation);
 
   // Specific recursion into constant pool or embedded code objects. Records
   // FixedArrays and Tuple2.
   void RecordVirtualObjectsForConstantPoolOrEmbeddedObjects(
-      HeapObject parent, HeapObject object,
+      Tagged<HeapObject> parent, Tagged<HeapObject> object,
       ObjectStats::VirtualInstanceType type);
 
   // Details.
-  void RecordVirtualAllocationSiteDetails(AllocationSite site);
-  void RecordVirtualBytecodeArrayDetails(BytecodeArray bytecode);
-  void RecordVirtualCodeDetails(InstructionStream code);
-  void RecordVirtualContext(Context context);
-  void RecordVirtualFeedbackVectorDetails(FeedbackVector vector);
-  void RecordVirtualFixedArrayDetails(FixedArray array);
-  void RecordVirtualFunctionTemplateInfoDetails(FunctionTemplateInfo fti);
-  void RecordVirtualJSGlobalObjectDetails(JSGlobalObject object);
-  void RecordVirtualJSObjectDetails(JSObject object);
-  void RecordVirtualMapDetails(Map map);
-  void RecordVirtualScriptDetails(Script script);
-  void RecordVirtualExternalStringDetails(ExternalString script);
-  void RecordVirtualSharedFunctionInfoDetails(SharedFunctionInfo info);
+  void RecordVirtualAllocationSiteDetails(Tagged<AllocationSite> site);
+  void RecordVirtualBytecodeArrayDetails(Tagged<BytecodeArray> bytecode);
+  void RecordVirtualCodeDetails(Tagged<InstructionStream> code);
+  void RecordVirtualContext(Tagged<Context> context);
+  void RecordVirtualFeedbackVectorDetails(Tagged<FeedbackVector> vector);
+  void RecordVirtualFixedArrayDetails(Tagged<FixedArray> array);
+  void RecordVirtualFunctionTemplateInfoDetails(
+      Tagged<FunctionTemplateInfo> fti);
+  void RecordVirtualJSGlobalObjectDetails(Tagged<JSGlobalObject> object);
+  void RecordVirtualJSObjectDetails(Tagged<JSObject> object);
+  void RecordVirtualMapDetails(Tagged<Map> map);
+  void RecordVirtualScriptDetails(Tagged<Script> script);
+  void RecordVirtualExternalStringDetails(Tagged<ExternalString> script);
+  void RecordVirtualSharedFunctionInfoDetails(Tagged<SharedFunctionInfo> info);
 
   void RecordVirtualArrayBoilerplateDescription(
-      ArrayBoilerplateDescription description);
+      Tagged<ArrayBoilerplateDescription> description);
 
   PtrComprCageBase cage_base() const {
     return field_stats_collector_.cage_base();
@@ -468,10 +474,10 @@ ObjectStatsCollectorImpl::ObjectStatsCollectorImpl(Heap* heap,
           &stats->boxed_double_fields_count_, &stats->string_data_count_,
           &stats->raw_fields_count_) {}
 
-bool ObjectStatsCollectorImpl::ShouldRecordObject(HeapObject obj,
+bool ObjectStatsCollectorImpl::ShouldRecordObject(Tagged<HeapObject> obj,
                                                   CowMode check_cow_array) {
-  if (obj.IsFixedArrayExact()) {
-    FixedArray fixed_array = FixedArray::cast(obj);
+  if (IsFixedArrayExact(obj)) {
+    Tagged<FixedArray> fixed_array = FixedArray::cast(obj);
     bool cow_check = check_cow_array == kIgnoreCow || !IsCowArray(fixed_array);
     return CanRecordFixedArray(fixed_array) && cow_check;
   }
@@ -479,27 +485,29 @@ bool ObjectStatsCollectorImpl::ShouldRecordObject(HeapObject obj,
   return true;
 }
 
-template <typename Derived, typename Shape>
+template <typename Dictionary>
 void ObjectStatsCollectorImpl::RecordHashTableVirtualObjectStats(
-    HeapObject parent, HashTable<Derived, Shape> hash_table,
+    Tagged<HeapObject> parent, Tagged<Dictionary> hash_table,
     ObjectStats::VirtualInstanceType type) {
   size_t over_allocated =
-      (hash_table.Capacity() -
-       (hash_table.NumberOfElements() + hash_table.NumberOfDeletedElements())) *
-      HashTable<Derived, Shape>::kEntrySize * kTaggedSize;
-  RecordVirtualObjectStats(parent, hash_table, type, hash_table.Size(),
+      (hash_table->Capacity() - (hash_table->NumberOfElements() +
+                                 hash_table->NumberOfDeletedElements())) *
+      Dictionary::kEntrySize * kTaggedSize;
+  RecordVirtualObjectStats(parent, hash_table, type, hash_table->Size(),
                            over_allocated);
 }
 
 bool ObjectStatsCollectorImpl::RecordSimpleVirtualObjectStats(
-    HeapObject parent, HeapObject obj, ObjectStats::VirtualInstanceType type) {
-  return RecordVirtualObjectStats(parent, obj, type, obj.Size(cage_base()),
+    Tagged<HeapObject> parent, Tagged<HeapObject> obj,
+    ObjectStats::VirtualInstanceType type) {
+  return RecordVirtualObjectStats(parent, obj, type, obj->Size(cage_base()),
                                   ObjectStats::kNoOverAllocation, kCheckCow);
 }
 
 bool ObjectStatsCollectorImpl::RecordVirtualObjectStats(
-    HeapObject parent, HeapObject obj, ObjectStats::VirtualInstanceType type,
-    size_t size, size_t over_allocated, CowMode check_cow_array) {
+    Tagged<HeapObject> parent, Tagged<HeapObject> obj,
+    ObjectStats::VirtualInstanceType type, size_t size, size_t over_allocated,
+    CowMode check_cow_array) {
   CHECK_LT(over_allocated, size);
   if (!SameLiveness(parent, obj) || !ShouldRecordObject(obj, check_cow_array)) {
     return false;
@@ -522,109 +530,111 @@ void ObjectStatsCollectorImpl::RecordExternalResourceStats(
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualAllocationSiteDetails(
-    AllocationSite site) {
-  if (!site.PointsToLiteral()) return;
-  JSObject boilerplate = site.boilerplate();
-  if (boilerplate.IsJSArray()) {
+    Tagged<AllocationSite> site) {
+  if (!site->PointsToLiteral()) return;
+  Tagged<JSObject> boilerplate = site->boilerplate();
+  if (IsJSArray(boilerplate)) {
     RecordSimpleVirtualObjectStats(site, boilerplate,
                                    ObjectStats::JS_ARRAY_BOILERPLATE_TYPE);
     // Array boilerplates cannot have properties.
   } else {
     RecordVirtualObjectStats(
         site, boilerplate, ObjectStats::JS_OBJECT_BOILERPLATE_TYPE,
-        boilerplate.Size(), ObjectStats::kNoOverAllocation);
-    if (boilerplate.HasFastProperties()) {
+        boilerplate->Size(), ObjectStats::kNoOverAllocation);
+    if (boilerplate->HasFastProperties()) {
       // We'll mis-classify the empty_property_array here. Given that there is a
       // single instance, this is negligible.
-      PropertyArray properties = boilerplate.property_array();
+      Tagged<PropertyArray> properties = boilerplate->property_array();
       RecordSimpleVirtualObjectStats(
           site, properties, ObjectStats::BOILERPLATE_PROPERTY_ARRAY_TYPE);
     } else {
-      NameDictionary properties = boilerplate.property_dictionary();
+      Tagged<NameDictionary> properties = boilerplate->property_dictionary();
       RecordSimpleVirtualObjectStats(
           site, properties, ObjectStats::BOILERPLATE_PROPERTY_DICTIONARY_TYPE);
     }
   }
-  FixedArrayBase elements = boilerplate.elements();
+  Tagged<FixedArrayBase> elements = boilerplate->elements();
   RecordSimpleVirtualObjectStats(site, elements,
                                  ObjectStats::BOILERPLATE_ELEMENTS_TYPE);
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualFunctionTemplateInfoDetails(
-    FunctionTemplateInfo fti) {
+    Tagged<FunctionTemplateInfo> fti) {
   // named_property_handler and indexed_property_handler are recorded as
   // INTERCEPTOR_INFO_TYPE.
-  HeapObject call_code = fti.call_code(kAcquireLoad);
-  if (!call_code.IsUndefined(isolate())) {
+  Tagged<HeapObject> call_code = fti->call_code(kAcquireLoad);
+  if (!IsUndefined(call_code, isolate())) {
     RecordSimpleVirtualObjectStats(
         fti, CallHandlerInfo::cast(call_code),
         ObjectStats::FUNCTION_TEMPLATE_INFO_ENTRIES_TYPE);
   }
-  if (!fti.GetInstanceCallHandler().IsUndefined(isolate())) {
+  if (!IsUndefined(fti->GetInstanceCallHandler(), isolate())) {
     RecordSimpleVirtualObjectStats(
-        fti, CallHandlerInfo::cast(fti.GetInstanceCallHandler()),
+        fti, CallHandlerInfo::cast(fti->GetInstanceCallHandler()),
         ObjectStats::FUNCTION_TEMPLATE_INFO_ENTRIES_TYPE);
   }
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualJSGlobalObjectDetails(
-    JSGlobalObject object) {
+    Tagged<JSGlobalObject> object) {
   // Properties.
-  GlobalDictionary properties = object.global_dictionary(kAcquireLoad);
+  Tagged<GlobalDictionary> properties = object->global_dictionary(kAcquireLoad);
   RecordHashTableVirtualObjectStats(object, properties,
                                     ObjectStats::GLOBAL_PROPERTIES_TYPE);
   // Elements.
-  FixedArrayBase elements = object.elements();
+  Tagged<FixedArrayBase> elements = object->elements();
   RecordSimpleVirtualObjectStats(object, elements,
                                  ObjectStats::GLOBAL_ELEMENTS_TYPE);
 }
 
-void ObjectStatsCollectorImpl::RecordVirtualJSObjectDetails(JSObject object) {
+void ObjectStatsCollectorImpl::RecordVirtualJSObjectDetails(
+    Tagged<JSObject> object) {
   // JSGlobalObject is recorded separately.
-  if (object.IsJSGlobalObject()) return;
+  if (IsJSGlobalObject(object)) return;
 
   // Uncompiled JSFunction has a separate type.
-  if (object.IsJSFunction() && !JSFunction::cast(object).is_compiled()) {
+  if (IsJSFunction(object) && !JSFunction::cast(object)->is_compiled()) {
     RecordSimpleVirtualObjectStats(HeapObject(), object,
                                    ObjectStats::JS_UNCOMPILED_FUNCTION_TYPE);
   }
 
   // Properties.
-  if (object.HasFastProperties()) {
-    PropertyArray properties = object.property_array();
+  if (object->HasFastProperties()) {
+    Tagged<PropertyArray> properties = object->property_array();
     if (properties != ReadOnlyRoots(heap_).empty_property_array()) {
-      size_t over_allocated = object.map().UnusedPropertyFields() * kTaggedSize;
+      size_t over_allocated =
+          object->map()->UnusedPropertyFields() * kTaggedSize;
       RecordVirtualObjectStats(object, properties,
-                               object.map().is_prototype_map()
+                               object->map()->is_prototype_map()
                                    ? ObjectStats::PROTOTYPE_PROPERTY_ARRAY_TYPE
                                    : ObjectStats::OBJECT_PROPERTY_ARRAY_TYPE,
-                               properties.Size(), over_allocated);
+                               properties->Size(), over_allocated);
     }
   } else {
-    NameDictionary properties = object.property_dictionary();
+    Tagged<NameDictionary> properties = object->property_dictionary();
     RecordHashTableVirtualObjectStats(
         object, properties,
-        object.map().is_prototype_map()
+        object->map()->is_prototype_map()
             ? ObjectStats::PROTOTYPE_PROPERTY_DICTIONARY_TYPE
             : ObjectStats::OBJECT_PROPERTY_DICTIONARY_TYPE);
   }
 
   // Elements.
-  FixedArrayBase elements = object.elements();
-  if (object.HasDictionaryElements()) {
+  Tagged<FixedArrayBase> elements = object->elements();
+  if (object->HasDictionaryElements()) {
     RecordHashTableVirtualObjectStats(
         object, NumberDictionary::cast(elements),
-        object.IsJSArray() ? ObjectStats::ARRAY_DICTIONARY_ELEMENTS_TYPE
-                           : ObjectStats::OBJECT_DICTIONARY_ELEMENTS_TYPE);
-  } else if (object.IsJSArray()) {
+        IsJSArray(object) ? ObjectStats::ARRAY_DICTIONARY_ELEMENTS_TYPE
+                          : ObjectStats::OBJECT_DICTIONARY_ELEMENTS_TYPE);
+  } else if (IsJSArray(object)) {
     if (elements != ReadOnlyRoots(heap_).empty_fixed_array()) {
       size_t element_size =
-          (elements.Size() - FixedArrayBase::kHeaderSize) / elements.length();
-      uint32_t length = JSArray::cast(object).length().Number();
-      size_t over_allocated = (elements.length() - length) * element_size;
+          (elements->Size() - FixedArrayBase::kHeaderSize) / elements->length();
+      uint32_t length = Object::Number(JSArray::cast(object)->length());
+      size_t over_allocated = (elements->length() - length) * element_size;
       RecordVirtualObjectStats(object, elements,
                                ObjectStats::ARRAY_ELEMENTS_TYPE,
-                               elements.Size(), over_allocated);
+                               elements->Size(), over_allocated);
     }
   } else {
     RecordSimpleVirtualObjectStats(object, elements,
@@ -632,10 +642,10 @@ void ObjectStatsCollectorImpl::RecordVirtualJSObjectDetails(JSObject object) {
   }
 
   // JSCollections.
-  if (object.IsJSCollection()) {
-    Object maybe_table = JSCollection::cast(object).table();
-    if (!maybe_table.IsUndefined(isolate())) {
-      DCHECK(maybe_table.IsFixedArray(isolate()));
+  if (IsJSCollection(object)) {
+    Tagged<Object> maybe_table = JSCollection::cast(object)->table();
+    if (!IsUndefined(maybe_table, isolate())) {
+      DCHECK(IsFixedArray(maybe_table, isolate()));
       // TODO(bmeurer): Properly compute over-allocation here.
       RecordSimpleVirtualObjectStats(object, HeapObject::cast(maybe_table),
                                      ObjectStats::JS_COLLECTION_TABLE_TYPE);
@@ -647,7 +657,7 @@ static ObjectStats::VirtualInstanceType GetFeedbackSlotType(
     MaybeObject maybe_obj, FeedbackSlotKind kind, Isolate* isolate) {
   if (maybe_obj->IsCleared())
     return ObjectStats::FEEDBACK_VECTOR_SLOT_OTHER_TYPE;
-  Object obj = maybe_obj->GetHeapObjectOrSmi();
+  Tagged<Object> obj = maybe_obj.GetHeapObjectOrSmi();
   switch (kind) {
     case FeedbackSlotKind::kCall:
       if (obj == *isolate->factory()->uninitialized_symbol()) {
@@ -687,7 +697,7 @@ static ObjectStats::VirtualInstanceType GetFeedbackSlotType(
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualFeedbackVectorDetails(
-    FeedbackVector vector) {
+    Tagged<FeedbackVector> vector) {
   if (virtual_objects_.find(vector) != virtual_objects_.end()) return;
   // Manually insert the feedback vector into the virtual object list, since
   // we're logging its component parts separately.
@@ -696,31 +706,31 @@ void ObjectStatsCollectorImpl::RecordVirtualFeedbackVectorDetails(
   size_t calculated_size = 0;
 
   // Log the feedback vector's header (fixed fields).
-  size_t header_size = vector.slots_start().address() - vector.address();
+  size_t header_size = vector->slots_start().address() - vector.address();
   stats_->RecordVirtualObjectStats(ObjectStats::FEEDBACK_VECTOR_HEADER_TYPE,
                                    header_size, ObjectStats::kNoOverAllocation);
   calculated_size += header_size;
 
   // Iterate over the feedback slots and log each one.
-  if (!vector.shared_function_info().HasFeedbackMetadata()) return;
+  if (!vector->shared_function_info()->HasFeedbackMetadata()) return;
 
-  FeedbackMetadataIterator it(vector.metadata());
+  FeedbackMetadataIterator it(vector->metadata());
   while (it.HasNext()) {
     FeedbackSlot slot = it.Next();
     // Log the entry (or entries) taken up by this slot.
     size_t slot_size = it.entry_size() * kTaggedSize;
     stats_->RecordVirtualObjectStats(
-        GetFeedbackSlotType(vector.Get(slot), it.kind(), heap_->isolate()),
+        GetFeedbackSlotType(vector->Get(slot), it.kind(), heap_->isolate()),
         slot_size, ObjectStats::kNoOverAllocation);
     calculated_size += slot_size;
 
     // Log the monomorphic/polymorphic helper objects that this slot owns.
     for (int i = 0; i < it.entry_size(); i++) {
-      MaybeObject raw_object = vector.Get(slot.WithOffset(i));
-      HeapObject object;
-      if (raw_object->GetHeapObject(&object)) {
-        if (object.IsCell(cage_base()) ||
-            object.IsWeakFixedArray(cage_base())) {
+      MaybeObject raw_object = vector->Get(slot.WithOffset(i));
+      Tagged<HeapObject> object;
+      if (raw_object.GetHeapObject(&object)) {
+        if (IsCell(object, cage_base()) ||
+            IsWeakFixedArray(object, cage_base())) {
           RecordSimpleVirtualObjectStats(
               vector, object, ObjectStats::FEEDBACK_VECTOR_ENTRY_TYPE);
         }
@@ -728,23 +738,24 @@ void ObjectStatsCollectorImpl::RecordVirtualFeedbackVectorDetails(
     }
   }
 
-  CHECK_EQ(calculated_size, vector.Size());
+  CHECK_EQ(calculated_size, vector->Size());
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualFixedArrayDetails(
-    FixedArray array) {
+    Tagged<FixedArray> array) {
   if (IsCowArray(array)) {
     RecordVirtualObjectStats(HeapObject(), array, ObjectStats::COW_ARRAY_TYPE,
-                             array.Size(), ObjectStats::kNoOverAllocation,
+                             array->Size(), ObjectStats::kNoOverAllocation,
                              kIgnoreCow);
   }
 }
 
 void ObjectStatsCollectorImpl::CollectStatistics(
-    HeapObject obj, Phase phase, CollectFieldStats collect_field_stats) {
+    Tagged<HeapObject> obj, Phase phase,
+    CollectFieldStats collect_field_stats) {
   DisallowGarbageCollection no_gc;
-  Map map = obj.map(cage_base());
-  InstanceType instance_type = map.instance_type();
+  Tagged<Map> map = obj->map(cage_base());
+  InstanceType instance_type = map->instance_type();
   switch (phase) {
     case kPhase1:
       if (InstanceTypeChecker::IsFeedbackVector(instance_type)) {
@@ -787,9 +798,9 @@ void ObjectStatsCollectorImpl::CollectStatistics(
       }
       size_t over_allocated = ObjectStats::kNoOverAllocation;
       if (InstanceTypeChecker::IsJSObject(instance_type)) {
-        over_allocated = map.instance_size() - map.UsedInstanceSize();
+        over_allocated = map->instance_size() - map->UsedInstanceSize();
       }
-      RecordObjectStats(obj, instance_type, obj.Size(cage_base()),
+      RecordObjectStats(obj, instance_type, obj->Size(cage_base()),
                         over_allocated);
       if (collect_field_stats == CollectFieldStats::kYes) {
         field_stats_collector_.RecordStats(obj);
@@ -800,11 +811,11 @@ void ObjectStatsCollectorImpl::CollectStatistics(
 
 void ObjectStatsCollectorImpl::CollectGlobalStatistics() {
   // Iterate boilerplates first to disambiguate them from regular JS objects.
-  Object list = heap_->allocation_sites_list();
-  while (list.IsAllocationSite(cage_base())) {
-    AllocationSite site = AllocationSite::cast(list);
+  Tagged<Object> list = heap_->allocation_sites_list();
+  while (IsAllocationSite(list, cage_base())) {
+    Tagged<AllocationSite> site = AllocationSite::cast(list);
     RecordVirtualAllocationSiteDetails(site);
-    list = site.weak_next();
+    list = site->weak_next();
   }
 
   // FixedArray.
@@ -826,7 +837,7 @@ void ObjectStatsCollectorImpl::CollectGlobalStatistics() {
                                  ObjectStats::SCRIPT_LIST_TYPE);
 }
 
-void ObjectStatsCollectorImpl::RecordObjectStats(HeapObject obj,
+void ObjectStatsCollectorImpl::RecordObjectStats(Tagged<HeapObject> obj,
                                                  InstanceType type, size_t size,
                                                  size_t over_allocated) {
   if (virtual_objects_.find(obj) == virtual_objects_.end()) {
@@ -834,18 +845,20 @@ void ObjectStatsCollectorImpl::RecordObjectStats(HeapObject obj,
   }
 }
 
-bool ObjectStatsCollectorImpl::CanRecordFixedArray(FixedArrayBase array) {
+bool ObjectStatsCollectorImpl::CanRecordFixedArray(
+    Tagged<FixedArrayBase> array) {
   ReadOnlyRoots roots(heap_);
   return array != roots.empty_fixed_array() &&
          array != roots.empty_slow_element_dictionary() &&
          array != roots.empty_property_dictionary();
 }
 
-bool ObjectStatsCollectorImpl::IsCowArray(FixedArrayBase array) {
-  return array.map(cage_base()) == ReadOnlyRoots(heap_).fixed_cow_array_map();
+bool ObjectStatsCollectorImpl::IsCowArray(Tagged<FixedArrayBase> array) {
+  return array->map(cage_base()) == ReadOnlyRoots(heap_).fixed_cow_array_map();
 }
 
-bool ObjectStatsCollectorImpl::SameLiveness(HeapObject obj1, HeapObject obj2) {
+bool ObjectStatsCollectorImpl::SameLiveness(Tagged<HeapObject> obj1,
+                                            Tagged<HeapObject> obj2) {
   if (obj1.is_null() || obj2.is_null()) return true;
   const auto obj1_marked =
       obj1.InReadOnlySpace() || marking_state_->IsMarked(obj1);
@@ -854,64 +867,64 @@ bool ObjectStatsCollectorImpl::SameLiveness(HeapObject obj1, HeapObject obj2) {
   return obj1_marked == obj2_marked;
 }
 
-void ObjectStatsCollectorImpl::RecordVirtualMapDetails(Map map) {
+void ObjectStatsCollectorImpl::RecordVirtualMapDetails(Tagged<Map> map) {
   // TODO(mlippautz): map->dependent_code(): DEPENDENT_CODE_TYPE.
 
   // For Map we want to distinguish between various different states
   // to get a better picture of what's going on in MapSpace. This
   // method computes the virtual instance type to use for a given map,
   // using MAP_TYPE for regular maps that aren't special in any way.
-  if (map.is_prototype_map()) {
-    if (map.is_dictionary_map()) {
+  if (map->is_prototype_map()) {
+    if (map->is_dictionary_map()) {
       RecordSimpleVirtualObjectStats(
           HeapObject(), map, ObjectStats::MAP_PROTOTYPE_DICTIONARY_TYPE);
-    } else if (map.is_abandoned_prototype_map()) {
+    } else if (map->is_abandoned_prototype_map()) {
       RecordSimpleVirtualObjectStats(HeapObject(), map,
                                      ObjectStats::MAP_ABANDONED_PROTOTYPE_TYPE);
     } else {
       RecordSimpleVirtualObjectStats(HeapObject(), map,
                                      ObjectStats::MAP_PROTOTYPE_TYPE);
     }
-  } else if (map.is_deprecated()) {
+  } else if (map->is_deprecated()) {
     RecordSimpleVirtualObjectStats(HeapObject(), map,
                                    ObjectStats::MAP_DEPRECATED_TYPE);
-  } else if (map.is_dictionary_map()) {
+  } else if (map->is_dictionary_map()) {
     RecordSimpleVirtualObjectStats(HeapObject(), map,
                                    ObjectStats::MAP_DICTIONARY_TYPE);
-  } else if (map.is_stable()) {
+  } else if (map->is_stable()) {
     RecordSimpleVirtualObjectStats(HeapObject(), map,
                                    ObjectStats::MAP_STABLE_TYPE);
   } else {
     // This will be logged as MAP_TYPE in Phase2.
   }
 
-  DescriptorArray array = map.instance_descriptors(cage_base());
-  if (map.owns_descriptors() &&
+  Tagged<DescriptorArray> array = map->instance_descriptors(cage_base());
+  if (map->owns_descriptors() &&
       array != ReadOnlyRoots(heap_).empty_descriptor_array()) {
     // Generally DescriptorArrays have their own instance type already
     // (DESCRIPTOR_ARRAY_TYPE), but we'd like to be able to tell which
     // of those are for (abandoned) prototypes, and which of those are
     // owned by deprecated maps.
-    if (map.is_prototype_map()) {
+    if (map->is_prototype_map()) {
       RecordSimpleVirtualObjectStats(
           map, array, ObjectStats::PROTOTYPE_DESCRIPTOR_ARRAY_TYPE);
-    } else if (map.is_deprecated()) {
+    } else if (map->is_deprecated()) {
       RecordSimpleVirtualObjectStats(
           map, array, ObjectStats::DEPRECATED_DESCRIPTOR_ARRAY_TYPE);
     }
 
-    EnumCache enum_cache = array.enum_cache();
-    RecordSimpleVirtualObjectStats(array, enum_cache.keys(),
+    Tagged<EnumCache> enum_cache = array->enum_cache();
+    RecordSimpleVirtualObjectStats(array, enum_cache->keys(),
                                    ObjectStats::ENUM_KEYS_CACHE_TYPE);
-    RecordSimpleVirtualObjectStats(array, enum_cache.indices(),
+    RecordSimpleVirtualObjectStats(array, enum_cache->indices(),
                                    ObjectStats::ENUM_INDICES_CACHE_TYPE);
   }
 
-  if (map.is_prototype_map()) {
-    PrototypeInfo prototype_info;
-    if (map.TryGetPrototypeInfo(&prototype_info)) {
-      Object users = prototype_info.prototype_users();
-      if (users.IsWeakFixedArray(cage_base())) {
+  if (map->is_prototype_map()) {
+    Tagged<PrototypeInfo> prototype_info;
+    if (map->TryGetPrototypeInfo(&prototype_info)) {
+      Tagged<Object> users = prototype_info->prototype_users();
+      if (IsWeakFixedArray(users, cage_base())) {
         RecordSimpleVirtualObjectStats(map, WeakArrayList::cast(users),
                                        ObjectStats::PROTOTYPE_USERS_TYPE);
       }
@@ -919,76 +932,77 @@ void ObjectStatsCollectorImpl::RecordVirtualMapDetails(Map map) {
   }
 }
 
-void ObjectStatsCollectorImpl::RecordVirtualScriptDetails(Script script) {
+void ObjectStatsCollectorImpl::RecordVirtualScriptDetails(
+    Tagged<Script> script) {
   RecordSimpleVirtualObjectStats(
-      script, script.shared_function_infos(),
+      script, script->shared_function_infos(),
       ObjectStats::SCRIPT_SHARED_FUNCTION_INFOS_TYPE);
 
   // Log the size of external source code.
-  Object raw_source = script.source();
-  if (raw_source.IsExternalString(cage_base())) {
+  Tagged<Object> raw_source = script->source();
+  if (IsExternalString(raw_source, cage_base())) {
     // The contents of external strings aren't on the heap, so we have to record
     // them manually. The on-heap String object is recorded independently in
     // the normal pass.
-    ExternalString string = ExternalString::cast(raw_source);
-    Address resource = string.resource_as_address();
-    size_t off_heap_size = string.ExternalPayloadSize();
+    Tagged<ExternalString> string = ExternalString::cast(raw_source);
+    Address resource = string->resource_as_address();
+    size_t off_heap_size = string->ExternalPayloadSize();
     RecordExternalResourceStats(
         resource,
-        string.IsOneByteRepresentation()
+        string->IsOneByteRepresentation()
             ? ObjectStats::SCRIPT_SOURCE_EXTERNAL_ONE_BYTE_TYPE
             : ObjectStats::SCRIPT_SOURCE_EXTERNAL_TWO_BYTE_TYPE,
         off_heap_size);
-  } else if (raw_source.IsString(cage_base())) {
-    String source = String::cast(raw_source);
+  } else if (IsString(raw_source, cage_base())) {
+    Tagged<String> source = String::cast(raw_source);
     RecordSimpleVirtualObjectStats(
         script, source,
-        source.IsOneByteRepresentation()
+        source->IsOneByteRepresentation()
             ? ObjectStats::SCRIPT_SOURCE_NON_EXTERNAL_ONE_BYTE_TYPE
             : ObjectStats::SCRIPT_SOURCE_NON_EXTERNAL_TWO_BYTE_TYPE);
   }
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualExternalStringDetails(
-    ExternalString string) {
+    Tagged<ExternalString> string) {
   // Track the external string resource size in a separate category.
 
-  Address resource = string.resource_as_address();
-  size_t off_heap_size = string.ExternalPayloadSize();
+  Address resource = string->resource_as_address();
+  size_t off_heap_size = string->ExternalPayloadSize();
   RecordExternalResourceStats(
       resource,
-      string.IsOneByteRepresentation(cage_base())
+      string->IsOneByteRepresentation(cage_base())
           ? ObjectStats::STRING_EXTERNAL_RESOURCE_ONE_BYTE_TYPE
           : ObjectStats::STRING_EXTERNAL_RESOURCE_TWO_BYTE_TYPE,
       off_heap_size);
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualSharedFunctionInfoDetails(
-    SharedFunctionInfo info) {
+    Tagged<SharedFunctionInfo> info) {
   // Uncompiled SharedFunctionInfo gets its own category.
-  if (!info.is_compiled()) {
+  if (!info->is_compiled()) {
     RecordSimpleVirtualObjectStats(
         HeapObject(), info, ObjectStats::UNCOMPILED_SHARED_FUNCTION_INFO_TYPE);
   }
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualArrayBoilerplateDescription(
-    ArrayBoilerplateDescription description) {
+    Tagged<ArrayBoilerplateDescription> description) {
   RecordVirtualObjectsForConstantPoolOrEmbeddedObjects(
-      description, description.constant_elements(),
+      description, description->constant_elements(),
       ObjectStats::ARRAY_BOILERPLATE_DESCRIPTION_ELEMENTS_TYPE);
 }
 
 void ObjectStatsCollectorImpl::
     RecordVirtualObjectsForConstantPoolOrEmbeddedObjects(
-        HeapObject parent, HeapObject object,
+        Tagged<HeapObject> parent, Tagged<HeapObject> object,
         ObjectStats::VirtualInstanceType type) {
   if (!RecordSimpleVirtualObjectStats(parent, object, type)) return;
-  if (object.IsFixedArrayExact(cage_base())) {
-    FixedArray array = FixedArray::cast(object);
-    for (int i = 0; i < array.length(); i++) {
-      Object entry = array.get(i);
-      if (!entry.IsHeapObject()) continue;
+  if (IsFixedArrayExact(object, cage_base())) {
+    Tagged<FixedArray> array = FixedArray::cast(object);
+    for (int i = 0; i < array->length(); i++) {
+      Tagged<Object> entry = array->get(i);
+      if (!IsHeapObject(entry)) continue;
       RecordVirtualObjectsForConstantPoolOrEmbeddedObjects(
           array, HeapObject::cast(entry), type);
     }
@@ -996,26 +1010,27 @@ void ObjectStatsCollectorImpl::
 }
 
 void ObjectStatsCollectorImpl::RecordVirtualBytecodeArrayDetails(
-    BytecodeArray bytecode) {
+    Tagged<BytecodeArray> bytecode) {
   RecordSimpleVirtualObjectStats(
-      bytecode, bytecode.constant_pool(),
+      bytecode, bytecode->constant_pool(),
       ObjectStats::BYTECODE_ARRAY_CONSTANT_POOL_TYPE);
   // FixedArrays on constant pool are used for holding descriptor information.
   // They are shared with optimized code.
-  FixedArray constant_pool = FixedArray::cast(bytecode.constant_pool());
-  for (int i = 0; i < constant_pool.length(); i++) {
-    Object entry = constant_pool.get(i);
-    if (entry.IsFixedArrayExact(cage_base())) {
+  Tagged<FixedArray> constant_pool =
+      FixedArray::cast(bytecode->constant_pool());
+  for (int i = 0; i < constant_pool->length(); i++) {
+    Tagged<Object> entry = constant_pool->get(i);
+    if (IsFixedArrayExact(entry, cage_base())) {
       RecordVirtualObjectsForConstantPoolOrEmbeddedObjects(
           constant_pool, HeapObject::cast(entry),
           ObjectStats::EMBEDDED_OBJECT_TYPE);
     }
   }
   RecordSimpleVirtualObjectStats(
-      bytecode, bytecode.handler_table(),
+      bytecode, bytecode->handler_table(),
       ObjectStats::BYTECODE_ARRAY_HANDLER_TABLE_TYPE);
-  if (bytecode.HasSourcePositionTable()) {
-    RecordSimpleVirtualObjectStats(bytecode, bytecode.SourcePositionTable(),
+  if (bytecode->HasSourcePositionTable()) {
+    RecordSimpleVirtualObjectStats(bytecode, bytecode->SourcePositionTable(),
                                    ObjectStats::SOURCE_POSITION_TABLE_TYPE);
   }
 }
@@ -1036,51 +1051,52 @@ ObjectStats::VirtualInstanceType CodeKindToVirtualInstanceType(CodeKind kind) {
 }  // namespace
 
 void ObjectStatsCollectorImpl::RecordVirtualCodeDetails(
-    InstructionStream istream) {
-  Code code = istream.code(kAcquireLoad);
+    Tagged<InstructionStream> istream) {
+  Tagged<Code> code;
+  if (!istream->TryGetCode(&code, kAcquireLoad)) return;
   RecordSimpleVirtualObjectStats(HeapObject(), istream,
-                                 CodeKindToVirtualInstanceType(code.kind()));
-  RecordSimpleVirtualObjectStats(istream, code.relocation_info(),
+                                 CodeKindToVirtualInstanceType(code->kind()));
+  RecordSimpleVirtualObjectStats(istream, istream->relocation_info(),
                                  ObjectStats::RELOC_INFO_TYPE);
-  if (CodeKindIsOptimizedJSFunction(code.kind())) {
-    Object source_position_table = code.source_position_table();
-    if (source_position_table.IsHeapObject()) {
+  if (CodeKindIsOptimizedJSFunction(code->kind())) {
+    Tagged<Object> source_position_table = code->source_position_table();
+    if (IsHeapObject(source_position_table)) {
       RecordSimpleVirtualObjectStats(istream,
                                      HeapObject::cast(source_position_table),
                                      ObjectStats::SOURCE_POSITION_TABLE_TYPE);
     }
-    RecordSimpleVirtualObjectStats(istream, code.deoptimization_data(),
+    RecordSimpleVirtualObjectStats(istream, code->deoptimization_data(),
                                    ObjectStats::DEOPTIMIZATION_DATA_TYPE);
-    DeoptimizationData input_data =
-        DeoptimizationData::cast(code.deoptimization_data());
-    if (input_data.length() > 0) {
-      RecordSimpleVirtualObjectStats(code.deoptimization_data(),
-                                     input_data.LiteralArray(),
+    Tagged<DeoptimizationData> input_data =
+        DeoptimizationData::cast(code->deoptimization_data());
+    if (input_data->length() > 0) {
+      RecordSimpleVirtualObjectStats(code->deoptimization_data(),
+                                     input_data->LiteralArray(),
                                      ObjectStats::OPTIMIZED_CODE_LITERALS_TYPE);
     }
   }
   int const mode_mask = RelocInfo::EmbeddedObjectModeMask();
   for (RelocIterator it(code, mode_mask); !it.done(); it.next()) {
     DCHECK(RelocInfo::IsEmbeddedObjectMode(it.rinfo()->rmode()));
-    Object target = it.rinfo()->target_object(cage_base());
-    if (target.IsFixedArrayExact(cage_base())) {
+    Tagged<Object> target = it.rinfo()->target_object(cage_base());
+    if (IsFixedArrayExact(target, cage_base())) {
       RecordVirtualObjectsForConstantPoolOrEmbeddedObjects(
           istream, HeapObject::cast(target), ObjectStats::EMBEDDED_OBJECT_TYPE);
     }
   }
 }
 
-void ObjectStatsCollectorImpl::RecordVirtualContext(Context context) {
-  if (context.IsNativeContext()) {
-    RecordObjectStats(context, NATIVE_CONTEXT_TYPE, context.Size());
-    if (context.retained_maps().IsWeakArrayList(cage_base())) {
+void ObjectStatsCollectorImpl::RecordVirtualContext(Tagged<Context> context) {
+  if (IsNativeContext(context)) {
+    RecordObjectStats(context, NATIVE_CONTEXT_TYPE, context->Size());
+    if (IsWeakArrayList(context->retained_maps(), cage_base())) {
       RecordSimpleVirtualObjectStats(
-          context, WeakArrayList::cast(context.retained_maps()),
+          context, WeakArrayList::cast(context->retained_maps()),
           ObjectStats::RETAINED_MAPS_TYPE);
     }
 
-  } else if (context.IsFunctionContext()) {
-    RecordObjectStats(context, FUNCTION_CONTEXT_TYPE, context.Size());
+  } else if (context->IsFunctionContext()) {
+    RecordObjectStats(context, FUNCTION_CONTEXT_TYPE, context->Size());
   } else {
     RecordSimpleVirtualObjectStats(HeapObject(), context,
                                    ObjectStats::OTHER_CONTEXT_TYPE);
@@ -1097,7 +1113,7 @@ class ObjectStatsVisitor {
         marking_state_(heap->non_atomic_marking_state()),
         phase_(phase) {}
 
-  void Visit(HeapObject obj) {
+  void Visit(Tagged<HeapObject> obj) {
     if (obj.InReadOnlySpace() || marking_state_->IsMarked(obj)) {
       live_collector_->CollectStatistics(
           obj, phase_, ObjectStatsCollectorImpl::CollectFieldStats::kYes);
@@ -1121,7 +1137,7 @@ void IterateHeap(Heap* heap, ObjectStatsVisitor* visitor) {
   // the nested SafepointScope inside CombinedHeapObjectIterator.
   AllowGarbageCollection allow_gc;
   CombinedHeapObjectIterator iterator(heap);
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
     visitor->Visit(obj);
   }
diff --git a/deps/v8/src/heap/objects-visiting-inl.h b/deps/v8/src/heap/objects-visiting-inl.h
index a58dd29a92e485..87de1218134ec3 100644
--- a/deps/v8/src/heap/objects-visiting-inl.h
+++ b/deps/v8/src/heap/objects-visiting-inl.h
@@ -7,10 +7,12 @@
 
 #include "src/base/logging.h"
 #include "src/heap/mark-compact.h"
+#include "src/heap/object-lock.h"
 #include "src/heap/objects-visiting.h"
 #include "src/objects/arguments.h"
 #include "src/objects/data-handler-inl.h"
 #include "src/objects/free-space-inl.h"
+#include "src/objects/js-array-buffer-inl.h"
 #include "src/objects/js-weak-refs-inl.h"
 #include "src/objects/module-inl.h"
 #include "src/objects/objects-body-descriptors-inl.h"
@@ -29,6 +31,67 @@
 namespace v8 {
 namespace internal {
 
+template <VisitorId visitor_id>
+inline bool ContainsReadOnlyMap(PtrComprCageBase, Tagged<HeapObject>) {
+  return false;
+}
+
+// List of visitor ids that can only appear in read-only maps. Unfortunately,
+// these are generally contained in all other lists. Adding an instance type
+// here optimizes handling in visitors that do not need to Map objects with such
+// visitor ids.
+#define READ_ONLY_MAPS_VISITOR_ID_LIST(V) \
+  V(AccessorInfo)                         \
+  V(AllocationSite)                       \
+  V(BigInt)                               \
+  V(BytecodeArray)                        \
+  V(ByteArray)                            \
+  V(CallHandlerInfo)                      \
+  V(Cell)                                 \
+  V(Code)                                 \
+  V(DataHandler)                          \
+  V(DataObject)                           \
+  V(DescriptorArray)                      \
+  V(EmbedderDataArray)                    \
+  V(ExternalString)                       \
+  V(FeedbackCell)                         \
+  V(FeedbackMetadata)                     \
+  V(FeedbackVector)                       \
+  V(FixedArray)                           \
+  V(FixedDoubleArray)                     \
+  V(InstructionStream)                    \
+  V(PreparseData)                         \
+  V(PropertyArray)                        \
+  V(PropertyCell)                         \
+  V(PrototypeInfo)                        \
+  V(ScopeInfo)                            \
+  V(SeqOneByteString)                     \
+  V(SeqTwoByteString)                     \
+  V(SharedFunctionInfo)                   \
+  V(ShortcutCandidate)                    \
+  V(SlicedString)                         \
+  V(SloppyArgumentsElements)              \
+  V(Symbol)                               \
+  V(ThinString)                           \
+  V(TransitionArray)                      \
+  V(UncompiledDataWithoutPreparseData)    \
+  V(UncompiledDataWithPreparseData)       \
+  V(WeakArrayList)                        \
+  V(WeakFixedArray)
+
+#define DEFINE_READ_ONLY_MAP_SPECIALIZATION(VisitorIdType)                    \
+  template <>                                                                 \
+  inline bool ContainsReadOnlyMap<VisitorId::kVisit##VisitorIdType>(          \
+      PtrComprCageBase cage_base, Tagged<HeapObject> object) {                \
+    /* If you see this DCHECK fail we encountered a Map with a VisitorId that \
+     * should have only ever appeared in read-only space. */                  \
+    DCHECK(object->map(cage_base).InReadOnlySpace());                         \
+    return true;                                                              \
+  }
+READ_ONLY_MAPS_VISITOR_ID_LIST(DEFINE_READ_ONLY_MAP_SPECIALIZATION)
+#undef DEFINE_READ_ONLY_MAP_SPECIALIZATION
+#undef READ_ONLY_MAPS_VISITOR_ID_LIST
+
 template <typename ResultType, typename ConcreteVisitor>
 HeapVisitor<ResultType, ConcreteVisitor>::HeapVisitor(
     PtrComprCageBase cage_base, PtrComprCageBase code_cage_base)
@@ -44,20 +107,22 @@ HeapVisitor<ResultType, ConcreteVisitor>::HeapVisitor(Heap* heap)
 
 template <typename ResultType, typename ConcreteVisitor>
 template <typename T>
-T HeapVisitor<ResultType, ConcreteVisitor>::Cast(HeapObject object) {
+Tagged<T> HeapVisitor<ResultType, ConcreteVisitor>::Cast(
+    Tagged<HeapObject> object) {
   return T::cast(object);
 }
 
 template <typename ResultType, typename ConcreteVisitor>
-ResultType HeapVisitor<ResultType, ConcreteVisitor>::Visit(HeapObject object) {
-  return Visit(object.map(cage_base()), object);
+ResultType HeapVisitor<ResultType, ConcreteVisitor>::Visit(
+    Tagged<HeapObject> object) {
+  return Visit(object->map(cage_base()), object);
 }
 
 template <typename ResultType, typename ConcreteVisitor>
-ResultType HeapVisitor<ResultType, ConcreteVisitor>::Visit(Map map,
-                                                           HeapObject object) {
+ResultType HeapVisitor<ResultType, ConcreteVisitor>::Visit(
+    Tagged<Map> map, Tagged<HeapObject> object) {
   ConcreteVisitor* visitor = static_cast<ConcreteVisitor*>(this);
-  switch (map.visitor_id()) {
+  switch (map->visitor_id()) {
 #define CASE(TypeName)               \
   case kVisit##TypeName:             \
     return visitor->Visit##TypeName( \
@@ -90,10 +155,18 @@ ResultType HeapVisitor<ResultType, ConcreteVisitor>::Visit(Map map,
 }
 
 template <typename ResultType, typename ConcreteVisitor>
+template <VisitorId visitor_id>
 void HeapVisitor<ResultType, ConcreteVisitor>::VisitMapPointerIfNeeded(
-    HeapObject host) {
-  DCHECK(!host.map_word(cage_base(), kRelaxedLoad).IsForwardingAddress());
-  if constexpr (!ConcreteVisitor::ShouldVisitMapPointer()) return;
+    Tagged<HeapObject> host) {
+  DCHECK(!host->map_word(cage_base(), kRelaxedLoad).IsForwardingAddress());
+  if constexpr (!ConcreteVisitor::ShouldVisitMapPointer()) {
+    return;
+  }
+  if constexpr (!ConcreteVisitor::ShouldVisitReadOnlyMapPointer()) {
+    if (ContainsReadOnlyMap<visitor_id>(cage_base(), host)) {
+      return;
+    }
+  }
   static_cast<ConcreteVisitor*>(this)->VisitMapPointer(host);
 }
 
@@ -102,15 +175,15 @@ void HeapVisitor<ResultType, ConcreteVisitor>::VisitMapPointerIfNeeded(
   ResultType HeapVisitor<ResultType, ConcreteVisitor>::Visit##TypeName(      \
       Map map, TypeName object) {                                            \
     ConcreteVisitor* visitor = static_cast<ConcreteVisitor*>(this);          \
-    if (!visitor->ShouldVisit(object)) return ResultType();                  \
     /* If you see the following DCHECK fail, then the size computation of    \
      * BodyDescriptor doesn't match the size return via obj.Size(). This is  \
      * problematic as the GC requires those sizes to match for accounting    \
      * reasons. The fix likely involves adding a padding field in the object \
      * defintions. */                                                        \
-    DCHECK_EQ(object.SizeFromMap(map),                                       \
+    DCHECK_EQ(object->SizeFromMap(map),                                      \
               TypeName::BodyDescriptor::SizeOf(map, object));                \
-    visitor->VisitMapPointerIfNeeded(object);                                \
+    visitor->template VisitMapPointerIfNeeded<VisitorId::kVisit##TypeName>(  \
+        object);                                                             \
     const int size = TypeName::BodyDescriptor::SizeOf(map, object);          \
     TypeName::BodyDescriptor::IterateBody(map, object, size, visitor);       \
     return static_cast<ResultType>(size);                                    \
@@ -121,22 +194,22 @@ TORQUE_VISITOR_ID_LIST(VISIT)
 
 template <typename ResultType, typename ConcreteVisitor>
 ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitShortcutCandidate(
-    Map map, ConsString object) {
+    Tagged<Map> map, Tagged<ConsString> object) {
   return static_cast<ConcreteVisitor*>(this)->VisitConsString(map, object);
 }
 
 template <typename ResultType, typename ConcreteVisitor>
 ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitDataObject(
-    Map map, HeapObject object) {
+    Tagged<Map> map, Tagged<HeapObject> object) {
   ConcreteVisitor* visitor = static_cast<ConcreteVisitor*>(this);
-  if (!visitor->ShouldVisit(object)) return ResultType();
-  int size = map.instance_size();
-  visitor->VisitMapPointerIfNeeded(object);
+  int size = map->instance_size();
+  visitor->template VisitMapPointerIfNeeded<VisitorId::kVisitDataObject>(
+      object);
 #ifdef V8_ENABLE_SANDBOX
   // The following types have external pointers, which must be visited.
   // TODO(v8:10391) Consider adding custom visitor IDs for these and making
   // this block not depend on V8_ENABLE_SANDBOX.
-  if (object.IsForeign(cage_base())) {
+  if (IsForeign(object, cage_base())) {
     Foreign::BodyDescriptor::IterateBody(map, object, size, visitor);
   }
 #endif  // V8_ENABLE_SANDBOX
@@ -145,46 +218,43 @@ ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitDataObject(
 
 template <typename ResultType, typename ConcreteVisitor>
 ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitJSObjectFast(
-    Map map, JSObject object) {
+    Tagged<Map> map, Tagged<JSObject> object) {
   return VisitJSObjectSubclass<JSObject, JSObject::FastBodyDescriptor>(map,
                                                                        object);
 }
 
 template <typename ResultType, typename ConcreteVisitor>
 ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitJSApiObject(
-    Map map, JSObject object) {
+    Tagged<Map> map, Tagged<JSObject> object) {
   return VisitJSObjectSubclass<JSObject, JSObject::BodyDescriptor>(map, object);
 }
 
 template <typename ResultType, typename ConcreteVisitor>
 ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitStruct(
-    Map map, HeapObject object) {
+    Tagged<Map> map, Tagged<HeapObject> object) {
   ConcreteVisitor* visitor = static_cast<ConcreteVisitor*>(this);
-  if (!visitor->ShouldVisit(object)) return ResultType();
-  int size = map.instance_size();
-  visitor->VisitMapPointerIfNeeded(object);
+  int size = map->instance_size();
+  visitor->template VisitMapPointerIfNeeded<VisitorId::kVisitStruct>(object);
   StructBodyDescriptor::IterateBody(map, object, size, visitor);
   return static_cast<ResultType>(size);
 }
 
 template <typename ResultType, typename ConcreteVisitor>
 ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitFreeSpace(
-    Map map, FreeSpace object) {
+    Tagged<Map> map, Tagged<FreeSpace> object) {
   ConcreteVisitor* visitor = static_cast<ConcreteVisitor*>(this);
-  if (!visitor->ShouldVisit(object)) return ResultType();
-  visitor->VisitMapPointerIfNeeded(object);
-  return static_cast<ResultType>(object.size(kRelaxedLoad));
+  visitor->template VisitMapPointerIfNeeded<VisitorId::kVisitFreeSpace>(object);
+  return static_cast<ResultType>(object->size(kRelaxedLoad));
 }
 
 template <typename ResultType, typename ConcreteVisitor>
 template <typename T, typename TBodyDescriptor>
 ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitJSObjectSubclass(
-    Map map, T object) {
+    Tagged<Map> map, Tagged<T> object) {
   ConcreteVisitor* visitor = static_cast<ConcreteVisitor*>(this);
-  if (!visitor->ShouldVisit(object)) return 0;
-  visitor->VisitMapPointerIfNeeded(object);
+  visitor->template VisitMapPointerIfNeeded<VisitorId::kVisitJSObject>(object);
   const int size = TBodyDescriptor::SizeOf(map, object);
-  const int used_size = map.UsedInstanceSize();
+  const int used_size = map->UsedInstanceSize();
   DCHECK_LE(used_size, size);
   DCHECK_GE(used_size, JSObject::GetHeaderSize(map));
   // It is important to visit only the used field and ignore the slack fields
@@ -195,34 +265,90 @@ ResultType HeapVisitor<ResultType, ConcreteVisitor>::VisitJSObjectSubclass(
   return size;
 }
 
-template <typename ConcreteVisitor>
-NewSpaceVisitor<ConcreteVisitor>::NewSpaceVisitor(Isolate* isolate)
-    : HeapVisitor<int, ConcreteVisitor>(isolate) {}
+template <typename ResultType, typename ConcreteVisitor>
+ConcurrentHeapVisitor<ResultType, ConcreteVisitor>::ConcurrentHeapVisitor(
+    Isolate* isolate)
+    : HeapVisitor<ResultType, ConcreteVisitor>(isolate) {}
 
-template <typename ConcreteVisitor>
-int NewSpaceVisitor<ConcreteVisitor>::VisitNativeContext(Map map,
-                                                         NativeContext object) {
-  // There should be no native contexts in new space.
-  UNREACHABLE();
-}
+template <typename T>
+struct ConcurrentVisitorCastHelper {
+  static V8_INLINE Tagged<T> Cast(Tagged<HeapObject> object) {
+    return T::cast(object);
+  }
+};
 
-template <typename ConcreteVisitor>
-int NewSpaceVisitor<ConcreteVisitor>::VisitSharedFunctionInfo(
-    Map map, SharedFunctionInfo object) {
-  UNREACHABLE();
+#define UNCHECKED_CAST(VisitorId, TypeName)                               \
+  template <>                                                             \
+  V8_INLINE Tagged<TypeName> ConcurrentVisitorCastHelper<TypeName>::Cast( \
+      Tagged<HeapObject> object) {                                        \
+    return TypeName::unchecked_cast(object);                              \
+  }
+SAFE_STRING_TRANSITION_SOURCES(UNCHECKED_CAST)
+// Casts are also needed for unsafe ones for the initial dispatch in
+// HeapVisitor.
+UNSAFE_STRING_TRANSITION_SOURCES(UNCHECKED_CAST)
+#undef UNCHECKED_CAST
+
+template <typename ResultType, typename ConcreteVisitor>
+template <typename T>
+Tagged<T> ConcurrentHeapVisitor<ResultType, ConcreteVisitor>::Cast(
+    Tagged<HeapObject> object) {
+  if constexpr (ConcreteVisitor::EnableConcurrentVisitation()) {
+    return ConcurrentVisitorCastHelper<T>::Cast(object);
+  }
+  return T::cast(object);
 }
 
-template <typename ConcreteVisitor>
-int NewSpaceVisitor<ConcreteVisitor>::VisitBytecodeArray(Map map,
-                                                         BytecodeArray object) {
-  UNREACHABLE();
+#define VISIT_AS_LOCKED_STRING(VisitorId, TypeName)                           \
+  template <typename ResultType, typename ConcreteVisitor>                    \
+  ResultType                                                                  \
+      ConcurrentHeapVisitor<ResultType, ConcreteVisitor>::Visit##TypeName(    \
+          Tagged<Map> map, Tagged<TypeName> object) {                         \
+    if constexpr (ConcreteVisitor::EnableConcurrentVisitation()) {            \
+      return VisitStringLocked(object);                                       \
+    }                                                                         \
+    return HeapVisitor<ResultType, ConcreteVisitor>::Visit##TypeName(map,     \
+                                                                     object); \
+  }
+
+UNSAFE_STRING_TRANSITION_SOURCES(VISIT_AS_LOCKED_STRING)
+#undef VISIT_AS_LOCKED_STRING
+
+template <typename ResultType, typename ConcreteVisitor>
+template <typename T>
+ResultType
+ConcurrentHeapVisitor<ResultType, ConcreteVisitor>::VisitStringLocked(
+    Tagged<T> object) {
+  ConcreteVisitor* visitor = static_cast<ConcreteVisitor*>(this);
+  SharedObjectLockGuard guard(object);
+  // The object has been locked. At this point shared read access is
+  // guaranteed but we must re-read the map and check whether the string has
+  // transitioned.
+  Tagged<Map> map = object->map(visitor->cage_base());
+  int size;
+  switch (map->visitor_id()) {
+#define UNSAFE_STRING_TRANSITION_TARGET_CASE(VisitorIdType, TypeName)         \
+  case kVisit##VisitorIdType:                                                 \
+    visitor                                                                   \
+        ->template VisitMapPointerIfNeeded<VisitorId::kVisit##VisitorIdType>( \
+            object);                                                          \
+    size = TypeName::BodyDescriptor::SizeOf(map, object);                     \
+    TypeName::BodyDescriptor::IterateBody(                                    \
+        map, TypeName::unchecked_cast(object), size, visitor);                \
+    break;
+
+    UNSAFE_STRING_TRANSITION_TARGETS(UNSAFE_STRING_TRANSITION_TARGET_CASE)
+#undef UNSAFE_STRING_TRANSITION_TARGET_CASE
+    default:
+      UNREACHABLE();
+  }
+  return static_cast<ResultType>(size);
+  ;
 }
 
 template <typename ConcreteVisitor>
-int NewSpaceVisitor<ConcreteVisitor>::VisitWeakCell(Map map,
-                                                    WeakCell weak_cell) {
-  UNREACHABLE();
-}
+NewSpaceVisitor<ConcreteVisitor>::NewSpaceVisitor(Isolate* isolate)
+    : ConcurrentHeapVisitor<int, ConcreteVisitor>(isolate) {}
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/objects-visiting.cc b/deps/v8/src/heap/objects-visiting.cc
index 769012ead30457..08655597634994 100644
--- a/deps/v8/src/heap/objects-visiting.cc
+++ b/deps/v8/src/heap/objects-visiting.cc
@@ -25,9 +25,10 @@ template <class T>
 struct WeakListVisitor;
 
 template <class T>
-Object VisitWeakList(Heap* heap, Object list, WeakObjectRetainer* retainer) {
-  HeapObject undefined = ReadOnlyRoots(heap).undefined_value();
-  Object head = undefined;
+Tagged<Object> VisitWeakList(Heap* heap, Tagged<Object> list,
+                             WeakObjectRetainer* retainer) {
+  Tagged<HeapObject> undefined = ReadOnlyRoots(heap).undefined_value();
+  Tagged<Object> head = undefined;
   T tail;
   bool record_slots = MustRecordSlots(heap);
 
@@ -35,7 +36,7 @@ Object VisitWeakList(Heap* heap, Object list, WeakObjectRetainer* retainer) {
     // Check whether to keep the candidate in the list.
     T candidate = T::cast(list);
 
-    Object retained = retainer->RetainAs(list);
+    Tagged<Object> retained = retainer->RetainAs(list);
 
     // Move to the next element before the WeakNext is cleared.
     list = WeakListVisitor<T>::WeakNext(candidate);
@@ -49,15 +50,16 @@ Object VisitWeakList(Heap* heap, Object list, WeakObjectRetainer* retainer) {
         DCHECK(!tail.is_null());
         WeakListVisitor<T>::SetWeakNext(tail, HeapObject::cast(retained));
         if (record_slots) {
-          HeapObject slot_holder = WeakListVisitor<T>::WeakNextHolder(tail);
+          Tagged<HeapObject> slot_holder =
+              WeakListVisitor<T>::WeakNextHolder(tail);
           int slot_offset = WeakListVisitor<T>::WeakNextOffset();
-          ObjectSlot slot = slot_holder.RawField(slot_offset);
+          ObjectSlot slot = slot_holder->RawField(slot_offset);
           MarkCompactCollector::RecordSlot(slot_holder, slot,
                                            HeapObject::cast(retained));
         }
       }
       // Retained object is new tail.
-      DCHECK(!retained.IsUndefined(heap->isolate()));
+      DCHECK(!IsUndefined(retained, heap->isolate()));
       candidate = T::cast(retained);
       tail = candidate;
 
@@ -75,8 +77,8 @@ Object VisitWeakList(Heap* heap, Object list, WeakObjectRetainer* retainer) {
 }
 
 template <class T>
-static void ClearWeakList(Heap* heap, Object list) {
-  Object undefined = ReadOnlyRoots(heap).undefined_value();
+static void ClearWeakList(Heap* heap, Tagged<Object> list) {
+  Tagged<Object> undefined = ReadOnlyRoots(heap).undefined_value();
   while (list != undefined) {
     T candidate = T::cast(list);
     list = WeakListVisitor<T>::WeakNext(candidate);
@@ -86,27 +88,29 @@ static void ClearWeakList(Heap* heap, Object list) {
 
 template <>
 struct WeakListVisitor<Context> {
-  static void SetWeakNext(Context context, Object next) {
-    context.set(Context::NEXT_CONTEXT_LINK, next, UPDATE_WRITE_BARRIER);
+  static void SetWeakNext(Tagged<Context> context, Tagged<Object> next) {
+    context->set(Context::NEXT_CONTEXT_LINK, next, UPDATE_WRITE_BARRIER);
   }
 
-  static Object WeakNext(Context context) {
-    return context.next_context_link();
+  static Tagged<Object> WeakNext(Tagged<Context> context) {
+    return context->next_context_link();
   }
 
-  static HeapObject WeakNextHolder(Context context) { return context; }
+  static Tagged<HeapObject> WeakNextHolder(Tagged<Context> context) {
+    return context;
+  }
 
   static int WeakNextOffset() {
     return FixedArray::SizeFor(Context::NEXT_CONTEXT_LINK);
   }
 
-  static void VisitLiveObject(Heap* heap, Context context,
+  static void VisitLiveObject(Heap* heap, Tagged<Context> context,
                               WeakObjectRetainer* retainer) {
     if (heap->gc_state() == Heap::MARK_COMPACT) {
       // Record the slots of the weak entries in the native context.
       for (int idx = Context::FIRST_WEAK_SLOT;
            idx < Context::NATIVE_CONTEXT_SLOTS; ++idx) {
-        ObjectSlot slot = context.RawField(Context::OffsetOfElementAt(idx));
+        ObjectSlot slot = context->RawField(Context::OffsetOfElementAt(idx));
         MarkCompactCollector::RecordSlot(context, slot,
                                          HeapObject::cast(*slot));
       }
@@ -114,74 +118,83 @@ struct WeakListVisitor<Context> {
   }
 
   template <class T>
-  static void DoWeakList(Heap* heap, Context context,
+  static void DoWeakList(Heap* heap, Tagged<Context> context,
                          WeakObjectRetainer* retainer, int index) {
     // Visit the weak list, removing dead intermediate elements.
-    Object list_head = VisitWeakList<T>(heap, context.get(index), retainer);
+    Tagged<Object> list_head =
+        VisitWeakList<T>(heap, context->get(index), retainer);
 
     // Update the list head.
-    context.set(index, list_head, UPDATE_WRITE_BARRIER);
+    context->set(index, list_head, UPDATE_WRITE_BARRIER);
 
     if (MustRecordSlots(heap)) {
       // Record the updated slot if necessary.
-      ObjectSlot head_slot = context.RawField(FixedArray::SizeFor(index));
+      ObjectSlot head_slot = context->RawField(FixedArray::SizeFor(index));
       heap->mark_compact_collector()->RecordSlot(context, head_slot,
                                                  HeapObject::cast(list_head));
     }
   }
 
-  static void VisitPhantomObject(Heap* heap, Context context) {}
+  static void VisitPhantomObject(Heap* heap, Tagged<Context> context) {}
 };
 
 
 template <>
 struct WeakListVisitor<AllocationSite> {
-  static void SetWeakNext(AllocationSite obj, Object next) {
-    obj.set_weak_next(next, UPDATE_WRITE_BARRIER);
+  static void SetWeakNext(Tagged<AllocationSite> obj, Tagged<Object> next) {
+    obj->set_weak_next(next, UPDATE_WRITE_BARRIER);
   }
 
-  static Object WeakNext(AllocationSite obj) { return obj.weak_next(); }
+  static Tagged<Object> WeakNext(Tagged<AllocationSite> obj) {
+    return obj->weak_next();
+  }
 
-  static HeapObject WeakNextHolder(AllocationSite obj) { return obj; }
+  static Tagged<HeapObject> WeakNextHolder(Tagged<AllocationSite> obj) {
+    return obj;
+  }
 
   static int WeakNextOffset() { return AllocationSite::kWeakNextOffset; }
 
-  static void VisitLiveObject(Heap*, AllocationSite, WeakObjectRetainer*) {}
+  static void VisitLiveObject(Heap*, Tagged<AllocationSite>,
+                              WeakObjectRetainer*) {}
 
-  static void VisitPhantomObject(Heap*, AllocationSite) {}
+  static void VisitPhantomObject(Heap*, Tagged<AllocationSite>) {}
 };
 
 template <>
 struct WeakListVisitor<JSFinalizationRegistry> {
-  static void SetWeakNext(JSFinalizationRegistry obj, HeapObject next) {
-    obj.set_next_dirty(next, UPDATE_WRITE_BARRIER);
+  static void SetWeakNext(Tagged<JSFinalizationRegistry> obj,
+                          Tagged<HeapObject> next) {
+    obj->set_next_dirty(next, UPDATE_WRITE_BARRIER);
   }
 
-  static Object WeakNext(JSFinalizationRegistry obj) {
-    return obj.next_dirty();
+  static Tagged<Object> WeakNext(Tagged<JSFinalizationRegistry> obj) {
+    return obj->next_dirty();
   }
 
-  static HeapObject WeakNextHolder(JSFinalizationRegistry obj) { return obj; }
+  static Tagged<HeapObject> WeakNextHolder(Tagged<JSFinalizationRegistry> obj) {
+    return obj;
+  }
 
   static int WeakNextOffset() {
     return JSFinalizationRegistry::kNextDirtyOffset;
   }
 
-  static void VisitLiveObject(Heap* heap, JSFinalizationRegistry obj,
+  static void VisitLiveObject(Heap* heap, Tagged<JSFinalizationRegistry> obj,
                               WeakObjectRetainer*) {
     heap->set_dirty_js_finalization_registries_list_tail(obj);
   }
 
-  static void VisitPhantomObject(Heap*, JSFinalizationRegistry) {}
+  static void VisitPhantomObject(Heap*, Tagged<JSFinalizationRegistry>) {}
 };
 
-template Object VisitWeakList<Context>(Heap* heap, Object list,
-                                       WeakObjectRetainer* retainer);
+template Tagged<Object> VisitWeakList<Context>(Heap* heap, Tagged<Object> list,
+                                               WeakObjectRetainer* retainer);
 
-template Object VisitWeakList<AllocationSite>(Heap* heap, Object list,
-                                              WeakObjectRetainer* retainer);
+template Tagged<Object> VisitWeakList<AllocationSite>(
+    Heap* heap, Tagged<Object> list, WeakObjectRetainer* retainer);
 
-template Object VisitWeakList<JSFinalizationRegistry>(
-    Heap* heap, Object list, WeakObjectRetainer* retainer);
+template Tagged<Object> VisitWeakList<JSFinalizationRegistry>(
+    Heap* heap, Tagged<Object> list, WeakObjectRetainer* retainer);
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/objects-visiting.h b/deps/v8/src/heap/objects-visiting.h
index 8a19c05caa2d1d..a81fadb7ce946b 100644
--- a/deps/v8/src/heap/objects-visiting.h
+++ b/deps/v8/src/heap/objects-visiting.h
@@ -5,10 +5,16 @@
 #ifndef V8_HEAP_OBJECTS_VISITING_H_
 #define V8_HEAP_OBJECTS_VISITING_H_
 
+#include "src/base/logging.h"
+#include "src/objects/bytecode-array.h"
+#include "src/objects/contexts.h"
 #include "src/objects/fixed-array.h"
+#include "src/objects/js-weak-refs.h"
 #include "src/objects/map.h"
 #include "src/objects/object-list-macros.h"
 #include "src/objects/objects.h"
+#include "src/objects/shared-function-info.h"
+#include "src/objects/string.h"
 #include "src/objects/visitors.h"
 
 namespace v8 {
@@ -20,6 +26,7 @@ namespace internal {
   V(BigInt)                             \
   V(ByteArray)                          \
   V(BytecodeArray)                      \
+  V(ExternalPointerArray)               \
   V(CallHandlerInfo)                    \
   V(Cell)                               \
   V(InstructionStream)                  \
@@ -46,6 +53,7 @@ namespace internal {
   V(Map)                                \
   V(NativeContext)                      \
   V(Oddball)                            \
+  V(Hole)                               \
   V(PreparseData)                       \
   V(PromiseOnStack)                     \
   V(PropertyArray)                      \
@@ -100,54 +108,136 @@ class HeapVisitor : public ObjectVisitorWithCageBases {
   inline explicit HeapVisitor(Isolate* isolate);
   inline explicit HeapVisitor(Heap* heap);
 
-  V8_INLINE ResultType Visit(HeapObject object);
-  V8_INLINE ResultType Visit(Map map, HeapObject object);
+  V8_INLINE ResultType Visit(Tagged<HeapObject> object);
+  V8_INLINE ResultType Visit(Tagged<Map> map, Tagged<HeapObject> object);
 
  protected:
-  // A guard predicate for visiting the object.
-  // If it returns false then the default implementations of the Visit*
-  // functions bail out from iterating the object pointers.
-  V8_INLINE bool ShouldVisit(HeapObject object) { return true; }
-
-  // If this predicate return false the default implementations of Visit*
+  // If this predicate returns false the default implementations of Visit*
   // functions bail out from visiting the map pointer.
   V8_INLINE static constexpr bool ShouldVisitMapPointer() { return true; }
+  // If this predicate returns false the default implementations of Visit*
+  // functions bail out from visiting known read-only maps.
+  V8_INLINE static constexpr bool ShouldVisitReadOnlyMapPointer() {
+    return true;
+  }
 
   // Only visits the Map pointer if `ShouldVisitMapPointer()` returns true.
-  V8_INLINE void VisitMapPointerIfNeeded(HeapObject host);
+  template <VisitorId visitor_id>
+  V8_INLINE void VisitMapPointerIfNeeded(Tagged<HeapObject> host);
+
+  ConcreteVisitor* concrete_visitor() {
+    return static_cast<ConcreteVisitor*>(this);
+  }
+
+  const ConcreteVisitor* concrete_visitor() const {
+    return static_cast<const ConcreteVisitor*>(this);
+  }
 
 #define VISIT(TypeName) \
   V8_INLINE ResultType Visit##TypeName(Map map, TypeName object);
   TYPED_VISITOR_ID_LIST(VISIT)
   TORQUE_VISITOR_ID_LIST(VISIT)
 #undef VISIT
-  V8_INLINE ResultType VisitShortcutCandidate(Map map, ConsString object);
-  V8_INLINE ResultType VisitDataObject(Map map, HeapObject object);
-  V8_INLINE ResultType VisitJSObjectFast(Map map, JSObject object);
-  V8_INLINE ResultType VisitJSApiObject(Map map, JSObject object);
-  V8_INLINE ResultType VisitStruct(Map map, HeapObject object);
-  V8_INLINE ResultType VisitFreeSpace(Map map, FreeSpace object);
+  V8_INLINE ResultType VisitShortcutCandidate(Tagged<Map> map,
+                                              Tagged<ConsString> object);
+  V8_INLINE ResultType VisitDataObject(Tagged<Map> map,
+                                       Tagged<HeapObject> object);
+  V8_INLINE ResultType VisitJSObjectFast(Tagged<Map> map,
+                                         Tagged<JSObject> object);
+  V8_INLINE ResultType VisitJSApiObject(Tagged<Map> map,
+                                        Tagged<JSObject> object);
+  V8_INLINE ResultType VisitStruct(Tagged<Map> map, Tagged<HeapObject> object);
+  V8_INLINE ResultType VisitFreeSpace(Tagged<Map> map,
+                                      Tagged<FreeSpace> object);
 
   template <typename T, typename TBodyDescriptor = typename T::BodyDescriptor>
-  V8_INLINE ResultType VisitJSObjectSubclass(Map map, T object);
+  V8_INLINE ResultType VisitJSObjectSubclass(Tagged<Map> map, Tagged<T> object);
 
   template <typename T>
-  static V8_INLINE T Cast(HeapObject object);
+  static V8_INLINE Tagged<T> Cast(Tagged<HeapObject> object);
+};
+
+// These strings can be sources of safe string transitions. Transitions are safe
+// if they don't result in invalidated slots. It's safe to read the length field
+// on such strings as that's common for all.
+//
+// No special visitors are generated for such strings.
+// V(VisitorId, TypeName)
+#define SAFE_STRING_TRANSITION_SOURCES(V) \
+  V(SeqOneByteString, SeqOneByteString)   \
+  V(SeqTwoByteString, SeqTwoByteString)
+
+// These strings can be sources of unsafe string transitions.
+// V(VisitorId, TypeName)
+#define UNSAFE_STRING_TRANSITION_SOURCES(V) \
+  V(ExternalString, ExternalString)         \
+  V(ConsString, ConsString)                 \
+  V(SlicedString, SlicedString)
+
+// V(VisitorId, TypeName)
+#define UNSAFE_STRING_TRANSITION_TARGETS(V) \
+  UNSAFE_STRING_TRANSITION_SOURCES(V)       \
+  V(ShortcutCandidate, ConsString)          \
+  V(ThinString, ThinString)
+
+// A HeapVisitor that allows for concurrently tracing through objects. Tracing
+// through objects with unsafe shape changes is guarded by
+// `EnableConcurrentVisitation()` which defaults to off.
+template <typename ResultType, typename ConcreteVisitor>
+class ConcurrentHeapVisitor : public HeapVisitor<ResultType, ConcreteVisitor> {
+ public:
+  V8_INLINE explicit ConcurrentHeapVisitor(Isolate* isolate);
+
+  V8_INLINE static constexpr bool EnableConcurrentVisitation() { return false; }
+
+ protected:
+#define VISIT_AS_LOCKED_STRING(VisitorId, TypeName)     \
+  V8_INLINE ResultType Visit##TypeName(Tagged<Map> map, \
+                                       Tagged<TypeName> object);
+
+  UNSAFE_STRING_TRANSITION_SOURCES(VISIT_AS_LOCKED_STRING)
+#undef VISIT_AS_LOCKED_STRING
+
+  template <typename T>
+  static V8_INLINE Tagged<T> Cast(Tagged<HeapObject> object);
+
+ private:
+  template <typename T>
+  V8_INLINE ResultType VisitStringLocked(Tagged<T> object);
+
+  friend class HeapVisitor<ResultType, ConcreteVisitor>;
 };
 
 template <typename ConcreteVisitor>
-class NewSpaceVisitor : public HeapVisitor<int, ConcreteVisitor> {
+class NewSpaceVisitor : public ConcurrentHeapVisitor<int, ConcreteVisitor> {
  public:
   V8_INLINE explicit NewSpaceVisitor(Isolate* isolate);
 
+  // Special cases: Unreachable visitors for objects that are never found in the
+  // young generation.
+  void VisitInstructionStreamPointer(Tagged<Code>,
+                                     InstructionStreamSlot) final {
+    UNREACHABLE();
+  }
+  void VisitCodeTarget(Tagged<InstructionStream> host, RelocInfo*) final {
+    UNREACHABLE();
+  }
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host, RelocInfo*) final {
+    UNREACHABLE();
+  }
+  void VisitMapPointer(Tagged<HeapObject>) override { UNREACHABLE(); }
+
  protected:
   V8_INLINE static constexpr bool ShouldVisitMapPointer() { return false; }
 
-  // Special cases for young generation.
-  V8_INLINE int VisitNativeContext(Map map, NativeContext object);
-  V8_INLINE int VisitBytecodeArray(Map map, BytecodeArray object);
-  V8_INLINE int VisitSharedFunctionInfo(Map map, SharedFunctionInfo object);
-  V8_INLINE int VisitWeakCell(Map map, WeakCell weak_cell);
+  // Special cases: Unreachable visitors for objects that are never found in the
+  // young generation.
+  int VisitNativeContext(Tagged<Map>, Tagged<NativeContext>) { UNREACHABLE(); }
+  int VisitBytecodeArray(Tagged<Map>, Tagged<BytecodeArray>) { UNREACHABLE(); }
+  int VisitSharedFunctionInfo(Tagged<Map> map, Tagged<SharedFunctionInfo>) {
+    UNREACHABLE();
+  }
+  int VisitWeakCell(Tagged<Map>, Tagged<WeakCell>) { UNREACHABLE(); }
 
   friend class HeapVisitor<int, ConcreteVisitor>;
 };
@@ -160,7 +250,8 @@ class WeakObjectRetainer;
 // pointers. The template parameter T is a WeakListVisitor that defines how to
 // access the next-element pointers.
 template <class T>
-Object VisitWeakList(Heap* heap, Object list, WeakObjectRetainer* retainer);
+Tagged<Object> VisitWeakList(Heap* heap, Tagged<Object> list,
+                             WeakObjectRetainer* retainer);
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/page-inl.h b/deps/v8/src/heap/page-inl.h
new file mode 100644
index 00000000000000..b0994a82aaa490
--- /dev/null
+++ b/deps/v8/src/heap/page-inl.h
@@ -0,0 +1,43 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_PAGE_INL_H_
+#define V8_HEAP_PAGE_INL_H_
+
+#include "src/heap/page.h"
+#include "src/heap/paged-spaces.h"
+#include "src/heap/spaces.h"
+
+namespace v8 {
+namespace internal {
+
+template <typename Callback>
+void Page::ForAllFreeListCategories(Callback callback) {
+  for (int i = kFirstCategory; i < owner()->free_list()->number_of_categories();
+       i++) {
+    callback(categories_[i]);
+  }
+}
+
+void Page::MarkEvacuationCandidate() {
+  DCHECK(!IsFlagSet(NEVER_EVACUATE));
+  DCHECK_NULL(slot_set<OLD_TO_OLD>());
+  DCHECK_NULL(typed_slot_set<OLD_TO_OLD>());
+  SetFlag(EVACUATION_CANDIDATE);
+  reinterpret_cast<PagedSpace*>(owner())->free_list()->EvictFreeListItems(this);
+}
+
+void Page::ClearEvacuationCandidate() {
+  if (!IsFlagSet(COMPACTION_WAS_ABORTED)) {
+    DCHECK_NULL(slot_set<OLD_TO_OLD>());
+    DCHECK_NULL(typed_slot_set<OLD_TO_OLD>());
+  }
+  ClearFlag(EVACUATION_CANDIDATE);
+  InitializeFreeListCategories();
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_PAGE_INL_H_
diff --git a/deps/v8/src/heap/page.cc b/deps/v8/src/heap/page.cc
new file mode 100644
index 00000000000000..fe3e68732d5765
--- /dev/null
+++ b/deps/v8/src/heap/page.cc
@@ -0,0 +1,176 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/heap-inl.h"
+#include "src/heap/incremental-marking.h"
+#include "src/heap/page-inl.h"
+#include "src/heap/paged-spaces.h"
+
+namespace v8 {
+namespace internal {
+
+// These checks are here to ensure that the lower 32 bits of any real heap
+// object can't overlap with the lower 32 bits of cleared weak reference value
+// and therefore it's enough to compare only the lower 32 bits of a MaybeObject
+// in order to figure out if it's a cleared weak reference or not.
+static_assert(kClearedWeakHeapObjectLower32 > 0);
+static_assert(kClearedWeakHeapObjectLower32 < Page::kHeaderSize);
+
+// static
+constexpr Page::MainThreadFlags Page::kCopyOnFlipFlagsMask;
+
+Page::Page(Heap* heap, BaseSpace* space, size_t size, Address area_start,
+           Address area_end, VirtualMemory reservation,
+           Executability executable)
+    : MemoryChunk(heap, space, size, area_start, area_end,
+                  std::move(reservation), executable, PageSize::kRegular) {}
+
+void Page::AllocateFreeListCategories() {
+  DCHECK_NULL(categories_);
+  categories_ =
+      new FreeListCategory*[owner()->free_list()->number_of_categories()]();
+  for (int i = kFirstCategory; i <= owner()->free_list()->last_category();
+       i++) {
+    DCHECK_NULL(categories_[i]);
+    categories_[i] = new FreeListCategory();
+  }
+}
+
+void Page::InitializeFreeListCategories() {
+  for (int i = kFirstCategory; i <= owner()->free_list()->last_category();
+       i++) {
+    categories_[i]->Initialize(static_cast<FreeListCategoryType>(i));
+  }
+}
+
+void Page::ReleaseFreeListCategories() {
+  if (categories_ != nullptr) {
+    for (int i = kFirstCategory; i <= owner()->free_list()->last_category();
+         i++) {
+      if (categories_[i] != nullptr) {
+        delete categories_[i];
+        categories_[i] = nullptr;
+      }
+    }
+    delete[] categories_;
+    categories_ = nullptr;
+  }
+}
+
+Page* Page::ConvertNewToOld(Page* old_page) {
+  DCHECK(old_page);
+  DCHECK(old_page->InNewSpace());
+  old_page->ResetAgeInNewSpace();
+  OldSpace* old_space = old_page->heap()->old_space();
+  old_page->set_owner(old_space);
+  old_page->ClearFlags(Page::kAllFlagsMask);
+  Page* new_page = old_space->InitializePage(old_page);
+  old_space->AddPromotedPage(new_page);
+  return new_page;
+}
+
+size_t Page::AvailableInFreeList() {
+  size_t sum = 0;
+  ForAllFreeListCategories(
+      [&sum](FreeListCategory* category) { sum += category->available(); });
+  return sum;
+}
+
+void Page::MarkNeverAllocateForTesting() {
+  DCHECK(this->owner_identity() != NEW_SPACE);
+  DCHECK(!IsFlagSet(NEVER_ALLOCATE_ON_PAGE));
+  SetFlag(NEVER_ALLOCATE_ON_PAGE);
+  SetFlag(NEVER_EVACUATE);
+  reinterpret_cast<PagedSpace*>(owner())->free_list()->EvictFreeListItems(this);
+}
+
+#ifdef DEBUG
+namespace {
+// Skips filler starting from the given filler until the end address.
+// Returns the first address after the skipped fillers.
+Address SkipFillers(PtrComprCageBase cage_base, Tagged<HeapObject> filler,
+                    Address end) {
+  Address addr = filler.address();
+  while (addr < end) {
+    filler = HeapObject::FromAddress(addr);
+    CHECK(IsFreeSpaceOrFiller(filler, cage_base));
+    addr = filler.address() + filler->Size(cage_base);
+  }
+  return addr;
+}
+}  // anonymous namespace
+#endif  // DEBUG
+
+size_t Page::ShrinkToHighWaterMark() {
+  // Shrinking only makes sense outside of the CodeRange, where we don't care
+  // about address space fragmentation.
+  VirtualMemory* reservation = reserved_memory();
+  if (!reservation->IsReserved()) return 0;
+
+  // Shrink pages to high water mark. The water mark points either to a filler
+  // or the area_end.
+  Tagged<HeapObject> filler = HeapObject::FromAddress(HighWaterMark());
+  if (filler.address() == area_end()) return 0;
+  PtrComprCageBase cage_base(heap()->isolate());
+  CHECK(IsFreeSpaceOrFiller(filler, cage_base));
+  // Ensure that no objects were allocated in [filler, area_end) region.
+  DCHECK_EQ(area_end(), SkipFillers(cage_base, filler, area_end()));
+  // Ensure that no objects will be allocated on this page.
+  DCHECK_EQ(0u, AvailableInFreeList());
+
+  // Ensure that slot sets are empty. Otherwise the buckets for the shrunk
+  // area would not be freed when deallocating this page.
+  DCHECK_NULL(slot_set<OLD_TO_NEW>());
+  DCHECK_NULL(slot_set<OLD_TO_NEW_BACKGROUND>());
+  DCHECK_NULL(slot_set<OLD_TO_OLD>());
+
+  size_t unused = RoundDown(static_cast<size_t>(area_end() - filler.address()),
+                            MemoryAllocator::GetCommitPageSize());
+  if (unused > 0) {
+    DCHECK_EQ(0u, unused % MemoryAllocator::GetCommitPageSize());
+    if (v8_flags.trace_gc_verbose) {
+      PrintIsolate(heap()->isolate(), "Shrinking page %p: end %p -> %p\n",
+                   reinterpret_cast<void*>(this),
+                   reinterpret_cast<void*>(area_end()),
+                   reinterpret_cast<void*>(area_end() - unused));
+    }
+    heap()->CreateFillerObjectAt(
+        filler.address(),
+        static_cast<int>(area_end() - filler.address() - unused));
+    heap()->memory_allocator()->PartialFreeMemory(
+        this, address() + size() - unused, unused, area_end() - unused);
+    if (filler.address() != area_end()) {
+      CHECK(IsFreeSpaceOrFiller(filler, cage_base));
+      CHECK_EQ(filler.address() + filler->Size(cage_base), area_end());
+    }
+  }
+  return unused;
+}
+
+void Page::CreateBlackArea(Address start, Address end) {
+  DCHECK_NE(NEW_SPACE, owner_identity());
+  DCHECK(heap()->incremental_marking()->black_allocation());
+  DCHECK_EQ(Page::FromAddress(start), this);
+  DCHECK_LT(start, end);
+  DCHECK_EQ(Page::FromAddress(end - 1), this);
+  marking_bitmap()->SetRange<AccessMode::ATOMIC>(
+      MarkingBitmap::AddressToIndex(start),
+      MarkingBitmap::LimitAddressToIndex(end));
+  IncrementLiveBytesAtomically(static_cast<intptr_t>(end - start));
+}
+
+void Page::DestroyBlackArea(Address start, Address end) {
+  DCHECK_NE(NEW_SPACE, owner_identity());
+  DCHECK(heap()->incremental_marking()->black_allocation());
+  DCHECK_EQ(Page::FromAddress(start), this);
+  DCHECK_LT(start, end);
+  DCHECK_EQ(Page::FromAddress(end - 1), this);
+  marking_bitmap()->ClearRange<AccessMode::ATOMIC>(
+      MarkingBitmap::AddressToIndex(start),
+      MarkingBitmap::LimitAddressToIndex(end));
+  IncrementLiveBytesAtomically(-static_cast<intptr_t>(end - start));
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/heap/page.h b/deps/v8/src/heap/page.h
new file mode 100644
index 00000000000000..aaa0ca4b61aedd
--- /dev/null
+++ b/deps/v8/src/heap/page.h
@@ -0,0 +1,157 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_PAGE_H_
+#define V8_HEAP_PAGE_H_
+
+#include "src/heap/base-space.h"
+#include "src/heap/free-list.h"
+#include "src/heap/memory-chunk.h"
+#include "src/heap/spaces.h"
+
+namespace v8 {
+namespace internal {
+
+class Heap;
+
+// -----------------------------------------------------------------------------
+// A page is a memory chunk of a size 256K. Large object pages may be larger.
+//
+// The only way to get a page pointer is by calling factory methods:
+//   Page* p = Page::FromAddress(addr); or
+//   Page* p = Page::FromAllocationAreaAddress(address);
+class Page : public MemoryChunk {
+ public:
+  // Page flags copied from from-space to to-space when flipping semispaces.
+  static constexpr MainThreadFlags kCopyOnFlipFlagsMask =
+      MainThreadFlags(MemoryChunk::POINTERS_TO_HERE_ARE_INTERESTING) |
+      MainThreadFlags(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING) |
+      MainThreadFlags(MemoryChunk::INCREMENTAL_MARKING);
+
+  Page(Heap* heap, BaseSpace* space, size_t size, Address area_start,
+       Address area_end, VirtualMemory reservation, Executability executable);
+
+  // Returns the page containing a given address. The address ranges
+  // from [page_addr .. page_addr + kPageSize]. This only works if the object
+  // is in fact in a page.
+  static Page* FromAddress(Address addr) {
+    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
+    return reinterpret_cast<Page*>(addr & ~kPageAlignmentMask);
+  }
+  static Page* FromHeapObject(Tagged<HeapObject> o) {
+    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
+    return reinterpret_cast<Page*>(o.ptr() & ~kAlignmentMask);
+  }
+
+  static Page* cast(BasicMemoryChunk* chunk) {
+    return cast(MemoryChunk::cast(chunk));
+  }
+
+  static Page* cast(MemoryChunk* chunk) {
+    DCHECK_IMPLIES(chunk, !chunk->IsLargePage());
+    return static_cast<Page*>(chunk);
+  }
+
+  // Returns the page containing the address provided. The address can
+  // potentially point righter after the page. To be also safe for tagged values
+  // we subtract a hole word. The valid address ranges from
+  // [page_addr + area_start_ .. page_addr + kPageSize + kTaggedSize].
+  static Page* FromAllocationAreaAddress(Address address) {
+    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
+    return Page::FromAddress(address - kTaggedSize);
+  }
+
+  // Checks if address1 and address2 are on the same new space page.
+  static bool OnSamePage(Address address1, Address address2) {
+    return Page::FromAddress(address1) == Page::FromAddress(address2);
+  }
+
+  // Checks whether an address is page aligned.
+  static bool IsAlignedToPageSize(Address addr) {
+    return (addr & kPageAlignmentMask) == 0;
+  }
+
+  static Page* ConvertNewToOld(Page* old_page);
+
+  V8_EXPORT_PRIVATE void MarkNeverAllocateForTesting();
+  inline void MarkEvacuationCandidate();
+  inline void ClearEvacuationCandidate();
+
+  Page* next_page() { return static_cast<Page*>(list_node_.next()); }
+  Page* prev_page() { return static_cast<Page*>(list_node_.prev()); }
+
+  const Page* next_page() const {
+    return static_cast<const Page*>(list_node_.next());
+  }
+  const Page* prev_page() const {
+    return static_cast<const Page*>(list_node_.prev());
+  }
+
+  template <typename Callback>
+  inline void ForAllFreeListCategories(Callback callback);
+
+  V8_EXPORT_PRIVATE size_t AvailableInFreeList();
+
+  size_t AvailableInFreeListFromAllocatedBytes() {
+    DCHECK_GE(area_size(), wasted_memory() + allocated_bytes());
+    return area_size() - wasted_memory() - allocated_bytes();
+  }
+
+  FreeListCategory* free_list_category(FreeListCategoryType type) {
+    return categories_[type];
+  }
+
+  V8_EXPORT_PRIVATE size_t ShrinkToHighWaterMark();
+
+  V8_EXPORT_PRIVATE void CreateBlackArea(Address start, Address end);
+  void DestroyBlackArea(Address start, Address end);
+
+  void InitializeFreeListCategories();
+  void AllocateFreeListCategories();
+  void ReleaseFreeListCategories();
+
+  ActiveSystemPages* active_system_pages() { return active_system_pages_; }
+
+  template <RememberedSetType remembered_set>
+  void ClearTypedSlotsInFreeMemory(const TypedSlotSet::FreeRangesMap& ranges) {
+    TypedSlotSet* typed_slot_set = this->typed_slot_set<remembered_set>();
+    if (typed_slot_set != nullptr) {
+      typed_slot_set->ClearInvalidSlots(ranges);
+    }
+  }
+
+  template <RememberedSetType remembered_set>
+  void AssertNoTypedSlotsInFreeMemory(
+      const TypedSlotSet::FreeRangesMap& ranges) {
+#if DEBUG
+    TypedSlotSet* typed_slot_set = this->typed_slot_set<remembered_set>();
+    if (typed_slot_set != nullptr) {
+      typed_slot_set->AssertNoInvalidSlots(ranges);
+    }
+#endif  // DEBUG
+  }
+
+ private:
+  friend class MemoryAllocator;
+};
+
+// Validate our estimates on the header size.
+static_assert(sizeof(BasicMemoryChunk) <= BasicMemoryChunk::kHeaderSize);
+static_assert(sizeof(MemoryChunk) <= MemoryChunk::kHeaderSize);
+static_assert(sizeof(Page) <= MemoryChunk::kHeaderSize);
+
+}  // namespace internal
+
+namespace base {
+// Define special hash function for page pointers, to be used with std data
+// structures, e.g. std::unordered_set<Page*, base::hash<Page*>
+template <>
+struct hash<i::Page*> : hash<i::BasicMemoryChunk*> {};
+template <>
+struct hash<const i::Page*> : hash<const i::BasicMemoryChunk*> {};
+}  // namespace base
+
+}  // namespace v8
+
+#endif  // V8_HEAP_PAGE_H_
diff --git a/deps/v8/src/heap/paged-spaces-inl.h b/deps/v8/src/heap/paged-spaces-inl.h
index 43fdc2bf5e0246..c555d84ae875d7 100644
--- a/deps/v8/src/heap/paged-spaces-inl.h
+++ b/deps/v8/src/heap/paged-spaces-inl.h
@@ -15,82 +15,61 @@
 namespace v8 {
 namespace internal {
 
-// -----------------------------------------------------------------------------
-// Heap object iterator in paged spaces.
-//
-// A PagedSpaceObjectIterator iterates objects from the bottom of the given
-// space to its top or from the bottom of the given page to its top.
-//
-// If objects are allocated in the page during iteration the iterator may
-// or may not iterate over those objects.  The caller must create a new
-// iterator in order to be sure to visit these new objects.
-class V8_EXPORT_PRIVATE PagedSpaceObjectIterator : public ObjectIterator {
- public:
-  // Creates a new object iterator in a given space.
-  PagedSpaceObjectIterator(Heap* heap, const PagedSpaceBase* space);
-  PagedSpaceObjectIterator(Heap* heap, const PagedSpaceBase* space,
-                           const Page* page);
-  PagedSpaceObjectIterator(Heap* heap, const PagedSpace* space,
-                           const Page* page, Address start_address);
-
-  // Advance to the next object, skipping free spaces and other fillers and
-  // skipping the special garbage section of which there is one per space.
-  // Returns nullptr when the iteration has ended.
-  inline HeapObject Next() override;
-
-  // The pointer compression cage base value used for decompression of all
-  // tagged values except references to InstructionStream objects.
-  PtrComprCageBase cage_base() const {
-#if V8_COMPRESS_POINTERS
-    return cage_base_;
-#else
-    return PtrComprCageBase{};
-#endif  // V8_COMPRESS_POINTERS
-  }
+HeapObjectRange::iterator::iterator() : cage_base_(kNullAddress) {}
 
- private:
-  // Fast (inlined) path of next().
-  inline HeapObject FromCurrentPage();
-
-  // Slow path of next(), goes into the next page.  Returns false if the
-  // iteration has ended.
-  bool AdvanceToNextPage();
-
-  Address cur_addr_;  // Current iteration point.
-  Address cur_end_;   // End iteration point.
-  const PagedSpaceBase* const space_;
-  ConstPageRange page_range_;
-  ConstPageRange::iterator current_page_;
-#if V8_COMPRESS_POINTERS
-  const PtrComprCageBase cage_base_;
-#endif  // V8_COMPRESS_POINTERS
-};
-
-HeapObject PagedSpaceObjectIterator::Next() {
-  do {
-    HeapObject next_obj = FromCurrentPage();
-    if (!next_obj.is_null()) return next_obj;
-  } while (AdvanceToNextPage());
-  return HeapObject();
+HeapObjectRange::iterator::iterator(const Page* page)
+    : cage_base_(page->heap()->isolate()),
+      cur_addr_(page->area_start()),
+      cur_end_(page->area_end()) {
+  AdvanceToNextObject();
+}
+
+HeapObjectRange::iterator& HeapObjectRange::iterator::operator++() {
+  DCHECK_GT(cur_size_, 0);
+  cur_addr_ += cur_size_;
+  AdvanceToNextObject();
+  return *this;
+}
+
+HeapObjectRange::iterator HeapObjectRange::iterator::operator++(int) {
+  iterator retval = *this;
+  ++(*this);
+  return retval;
 }
 
-HeapObject PagedSpaceObjectIterator::FromCurrentPage() {
+void HeapObjectRange::iterator::AdvanceToNextObject() {
+  DCHECK_NE(cur_addr_, kNullAddress);
   while (cur_addr_ != cur_end_) {
-    HeapObject obj = HeapObject::FromAddress(cur_addr_);
-    const int obj_size = ALIGN_TO_ALLOCATION_ALIGNMENT(obj.Size(cage_base()));
-    cur_addr_ += obj_size;
-    DCHECK_LE(cur_addr_, cur_end_);
-    if (!obj.IsFreeSpaceOrFiller(cage_base())) {
-      if (obj.IsInstructionStream(cage_base())) {
-        DCHECK_EQ(space_->identity(), CODE_SPACE);
-        DCHECK_CODEOBJECT_SIZE(obj_size, space_);
+    DCHECK_LT(cur_addr_, cur_end_);
+    Tagged<HeapObject> obj = HeapObject::FromAddress(cur_addr_);
+    cur_size_ = ALIGN_TO_ALLOCATION_ALIGNMENT(obj->Size(cage_base()));
+    DCHECK_LE(cur_addr_ + cur_size_, cur_end_);
+    if (IsFreeSpaceOrFiller(obj, cage_base())) {
+      cur_addr_ += cur_size_;
+    } else {
+      if (IsInstructionStream(obj, cage_base())) {
+        DCHECK_EQ(Page::FromHeapObject(obj)->owner_identity(), CODE_SPACE);
+        DCHECK_CODEOBJECT_SIZE(cur_size_);
       } else {
-        DCHECK_OBJECT_SIZE(obj_size);
+        DCHECK_OBJECT_SIZE(cur_size_);
       }
-      return obj;
+      return;
     }
   }
-  return HeapObject();
+  cur_addr_ = kNullAddress;
+}
+
+HeapObjectRange::iterator HeapObjectRange::begin() { return iterator(page_); }
+
+HeapObjectRange::iterator HeapObjectRange::end() { return iterator(); }
+
+Tagged<HeapObject> PagedSpaceObjectIterator::Next() {
+  do {
+    if (cur_ != end_) {
+      return *cur_++;
+    }
+  } while (AdvanceToNextPage());
+  return Tagged<HeapObject>();
 }
 
 bool PagedSpaceBase::Contains(Address addr) const {
@@ -100,8 +79,8 @@ bool PagedSpaceBase::Contains(Address addr) const {
   return Page::FromAddress(addr)->owner() == this;
 }
 
-bool PagedSpaceBase::Contains(Object o) const {
-  if (!o.IsHeapObject()) return false;
+bool PagedSpaceBase::Contains(Tagged<Object> o) const {
+  if (!IsHeapObject(o)) return false;
   return Page::FromAddress(o.ptr())->owner() == this;
 }
 
@@ -116,7 +95,8 @@ V8_INLINE bool PagedSpaceBase::EnsureAllocation(int size_in_bytes,
                                                 AllocationAlignment alignment,
                                                 AllocationOrigin origin,
                                                 int* out_max_aligned_size) {
-  if (!is_compaction_space()) {
+  if (!is_compaction_space() &&
+      !((identity() == NEW_SPACE) && heap_->ShouldOptimizeForLoadTime())) {
     // Start incremental marking before the actual allocation, this allows the
     // allocation function to mark the object black when incremental marking is
     // running.
@@ -124,6 +104,9 @@ V8_INLINE bool PagedSpaceBase::EnsureAllocation(int size_in_bytes,
         heap()->GCFlagsForIncrementalMarking(),
         kGCCallbackScheduleIdleGarbageCollection);
   }
+  if (identity() == NEW_SPACE && heap()->incremental_marking()->IsStopped()) {
+    heap()->StartMinorMSIncrementalMarkingIfNeeded();
+  }
 
   // We don't know exactly how much filler we need to align until space is
   // allocated, so assume the worst case.
diff --git a/deps/v8/src/heap/paged-spaces.cc b/deps/v8/src/heap/paged-spaces.cc
index d73e268b7a79a1..b3394dcec84554 100644
--- a/deps/v8/src/heap/paged-spaces.cc
+++ b/deps/v8/src/heap/paged-spaces.cc
@@ -12,8 +12,10 @@
 #include "src/common/globals.h"
 #include "src/execution/isolate.h"
 #include "src/execution/vm-state-inl.h"
+#include "src/flags/flags.h"
 #include "src/heap/allocation-observer.h"
 #include "src/heap/array-buffer-sweeper.h"
+#include "src/heap/free-list-inl.h"
 #include "src/heap/gc-tracer-inl.h"
 #include "src/heap/gc-tracer.h"
 #include "src/heap/heap.h"
@@ -22,6 +24,7 @@
 #include "src/heap/memory-allocator.h"
 #include "src/heap/memory-chunk-inl.h"
 #include "src/heap/memory-chunk-layout.h"
+#include "src/heap/page-inl.h"
 #include "src/heap/paged-spaces-inl.h"
 #include "src/heap/read-only-heap.h"
 #include "src/heap/safepoint.h"
@@ -39,70 +42,27 @@ namespace internal {
 
 PagedSpaceObjectIterator::PagedSpaceObjectIterator(Heap* heap,
                                                    const PagedSpaceBase* space)
-    : cur_addr_(kNullAddress),
-      cur_end_(kNullAddress),
-      space_(space),
+    : space_(space),
       page_range_(space->first_page(), nullptr),
-      current_page_(page_range_.begin())
-#if V8_COMPRESS_POINTERS
-      ,
-      cage_base_(heap->isolate())
-#endif  // V8_COMPRESS_POINTERS
-{
+      current_page_(page_range_.begin()) {
   heap->MakeHeapIterable();
   USE(space_);
 }
 
-PagedSpaceObjectIterator::PagedSpaceObjectIterator(Heap* heap,
-                                                   const PagedSpaceBase* space,
-                                                   const Page* page)
-    : cur_addr_(kNullAddress),
-      cur_end_(kNullAddress),
-      space_(space),
-      page_range_(page),
-      current_page_(page_range_.begin())
-#if V8_COMPRESS_POINTERS
-      ,
-      cage_base_(heap->isolate())
-#endif  // V8_COMPRESS_POINTERS
-{
-  heap->MakeHeapIterable();
-}
-
-PagedSpaceObjectIterator::PagedSpaceObjectIterator(Heap* heap,
-                                                   const PagedSpace* space,
-                                                   const Page* page,
-                                                   Address start_address)
-    : cur_addr_(start_address),
-      cur_end_(page->area_end()),
-      space_(space),
-      page_range_(page, page),
-      current_page_(page_range_.begin())
-#if V8_COMPRESS_POINTERS
-      ,
-      cage_base_(heap->isolate())
-#endif  // V8_COMPRESS_POINTERS
-{
-  heap->MakeHeapIterable();
-  DCHECK_IMPLIES(!heap->IsInlineAllocationEnabled(),
-                 !page->Contains(space->top()));
-  DCHECK(page->Contains(start_address));
-  DCHECK(page->SweepingDone());
-}
-
 // We have hit the end of the page and should advance to the next block of
 // objects.  This happens at the end of the page.
 bool PagedSpaceObjectIterator::AdvanceToNextPage() {
-  DCHECK_EQ(cur_addr_, cur_end_);
   if (current_page_ == page_range_.end()) return false;
   const Page* cur_page = *(current_page_++);
-
-  cur_addr_ = cur_page->area_start();
-  cur_end_ = cur_page->area_end();
-  DCHECK(cur_page->SweepingDone());
+  HeapObjectRange heap_objects(cur_page);
+  cur_ = heap_objects.begin();
+  end_ = heap_objects.end();
   return true;
 }
 
+// ----------------------------------------------------------------------------
+// PagedSpaceBase implementation
+
 Page* PagedSpaceBase::InitializePage(MemoryChunk* chunk) {
   Page* page = static_cast<Page*>(chunk);
   DCHECK_EQ(
@@ -110,7 +70,8 @@ Page* PagedSpaceBase::InitializePage(MemoryChunk* chunk) {
       page->area_size());
   // Make sure that categories are initialized before freeing the area.
   page->ResetAllocationStatistics();
-  page->SetOldGenerationPageFlags(heap()->incremental_marking()->IsMarking());
+  page->SetOldGenerationPageFlags(
+      heap()->incremental_marking()->marking_mode());
   page->AllocateFreeListCategories();
   page->InitializeFreeListCategories();
   page->list_node().Initialize();
@@ -120,12 +81,12 @@ Page* PagedSpaceBase::InitializePage(MemoryChunk* chunk) {
 
 PagedSpaceBase::PagedSpaceBase(
     Heap* heap, AllocationSpace space, Executability executable,
-    FreeList* free_list, AllocationCounter& allocation_counter,
-    LinearAllocationArea& allocation_info_,
+    std::unique_ptr<FreeList> free_list, AllocationCounter& allocation_counter,
+    LinearAllocationArea& allocation_info,
     LinearAreaOriginalData& linear_area_original_data,
     CompactionSpaceKind compaction_space_kind)
-    : SpaceWithLinearArea(heap, space, free_list, allocation_counter,
-                          allocation_info_, linear_area_original_data),
+    : SpaceWithLinearArea(heap, space, std::move(free_list), allocation_counter,
+                          allocation_info, linear_area_original_data),
       executable_(executable),
       compaction_space_kind_(compaction_space_kind) {
   area_size_ = MemoryChunkLayout::AllocatableMemoryInMemoryChunk(space);
@@ -243,17 +204,18 @@ bool PagedSpaceBase::ContainsSlow(Address addr) const {
 
 void PagedSpaceBase::RefineAllocatedBytesAfterSweeping(Page* page) {
   CHECK(page->SweepingDone());
-  auto marking_state = heap()->non_atomic_marking_state();
   // The live_byte on the page was accounted in the space allocated
   // bytes counter. After sweeping allocated_bytes() contains the
   // accurate live byte count on the page.
-  size_t old_counter = marking_state->live_bytes(page);
+  size_t old_counter = page->live_bytes();
   size_t new_counter = page->allocated_bytes();
   DCHECK_GE(old_counter, new_counter);
   if (old_counter > new_counter) {
-    DecreaseAllocatedBytes(old_counter - new_counter, page);
+    size_t counter_diff = old_counter - new_counter;
+    if (identity() == NEW_SPACE) size_at_last_gc_ -= counter_diff;
+    DecreaseAllocatedBytes(counter_diff, page);
   }
-  marking_state->SetLiveBytes(page, 0);
+  page->SetLiveBytes(0);
 }
 
 Page* PagedSpaceBase::RemovePageSafe(int size_in_bytes) {
@@ -264,7 +226,7 @@ Page* PagedSpaceBase::RemovePageSafe(int size_in_bytes) {
   return page;
 }
 
-size_t PagedSpaceBase::AddPage(Page* page) {
+void PagedSpaceBase::AddPageImpl(Page* page) {
   DCHECK_NOT_NULL(page);
   CHECK(page->SweepingDone());
   page->set_owner(this);
@@ -274,11 +236,16 @@ size_t PagedSpaceBase::AddPage(Page* page) {
   AccountCommitted(page->size());
   IncreaseCapacity(page->area_size());
   IncreaseAllocatedBytes(page->allocated_bytes(), page);
-  for (size_t i = 0; i < ExternalBackingStoreType::kNumTypes; i++) {
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    IncrementExternalBackingStoreBytes(t, page->ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, page](ExternalBackingStoreType type, int index) {
+        IncrementExternalBackingStoreBytes(
+            type, page->ExternalBackingStoreBytes(type));
+      });
   IncrementCommittedPhysicalMemory(page->CommittedPhysicalMemory());
+}
+
+size_t PagedSpaceBase::AddPage(Page* page) {
+  AddPageImpl(page);
   return RelinkFreeListCategories(page);
 }
 
@@ -287,23 +254,24 @@ void PagedSpaceBase::RemovePage(Page* page) {
   DCHECK_IMPLIES(identity() == NEW_SPACE, page->IsFlagSet(Page::TO_PAGE));
   memory_chunk_list_.Remove(page);
   UnlinkFreeListCategories(page);
-  if (identity() == NEW_SPACE) {
-    page->ReleaseFreeListCategories();
-  }
   // Pages are only removed from new space when they are promoted to old space
   // during a GC. This happens after sweeping as started and the allocation
   // counters have been reset.
   DCHECK_IMPLIES(identity() == NEW_SPACE,
                  heap()->gc_state() != Heap::NOT_IN_GC);
-  if (identity() != NEW_SPACE) {
+  if (identity() == NEW_SPACE) {
+    page->ReleaseFreeListCategories();
+  } else {
     DecreaseAllocatedBytes(page->allocated_bytes(), page);
+    free_list()->decrease_wasted_bytes(page->wasted_memory());
   }
   DecreaseCapacity(page->area_size());
   AccountUncommitted(page->size());
-  for (size_t i = 0; i < ExternalBackingStoreType::kNumTypes; i++) {
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    DecrementExternalBackingStoreBytes(t, page->ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, page](ExternalBackingStoreType type, int index) {
+        DecrementExternalBackingStoreBytes(
+            type, page->ExternalBackingStoreBytes(type));
+      });
   DecrementCommittedPhysicalMemory(page->CommittedPhysicalMemory());
 }
 
@@ -342,6 +310,11 @@ void PagedSpaceBase::ResetFreeList() {
 }
 
 void PagedSpaceBase::ShrinkImmortalImmovablePages() {
+  base::Optional<CodePageHeaderModificationScope> optional_scope;
+  if (identity() == CODE_SPACE) {
+    optional_scope.emplace(
+        "ShrinkImmortalImmovablePages writes to the page header.");
+  }
   DCHECK(!heap()->deserialization_complete());
   BasicMemoryChunk::UpdateHighWaterMark(allocation_info_.top());
   FreeLinearAllocationArea();
@@ -352,10 +325,20 @@ void PagedSpaceBase::ShrinkImmortalImmovablePages() {
   }
 }
 
-Page* PagedSpaceBase::TryExpandImpl() {
-  Page* page = heap()->memory_allocator()->AllocatePage(
-      MemoryAllocator::AllocationMode::kRegular, this, executable());
+Page* PagedSpaceBase::TryExpandImpl(
+    MemoryAllocator::AllocationMode allocation_mode) {
+  base::MutexGuard expansion_guard(heap_->heap_expansion_mutex());
+  const size_t accounted_size =
+      MemoryChunkLayout::AllocatableMemoryInMemoryChunk(identity());
+  if (identity() != NEW_SPACE && !is_compaction_space() &&
+      !heap()->IsOldGenerationExpansionAllowed(accounted_size,
+                                               expansion_guard)) {
+    return nullptr;
+  }
+  Page* page = heap()->memory_allocator()->AllocatePage(allocation_mode, this,
+                                                        executable());
   if (page == nullptr) return nullptr;
+  DCHECK_EQ(page->area_size(), accounted_size);
   ConcurrentAllocationMutex guard(this);
   AddPage(page);
   Free(page->area_start(), page->area_size(),
@@ -366,14 +349,20 @@ Page* PagedSpaceBase::TryExpandImpl() {
 base::Optional<std::pair<Address, size_t>> PagedSpaceBase::TryExpandBackground(
     size_t size_in_bytes) {
   DCHECK_NE(NEW_SPACE, identity());
+  base::MutexGuard expansion_guard(heap_->heap_expansion_mutex());
+  const size_t accounted_size =
+      MemoryChunkLayout::AllocatableMemoryInMemoryChunk(identity());
+  if (!heap()->IsOldGenerationExpansionAllowed(accounted_size,
+                                               expansion_guard)) {
+    return {};
+  }
   Page* page = heap()->memory_allocator()->AllocatePage(
       MemoryAllocator::AllocationMode::kRegular, this, executable());
   if (page == nullptr) return {};
+  DCHECK_EQ(page->area_size(), accounted_size);
   base::MutexGuard lock(&space_mutex_);
   AddPage(page);
-  if (identity() == CODE_SPACE || identity() == CODE_LO_SPACE) {
-    heap()->isolate()->AddCodeMemoryChunk(page);
-  }
+  heap()->NotifyOldGenerationExpansionBackground(identity(), page);
   Address object_start = page->area_start();
   CHECK_LE(size_in_bytes, page->area_size());
   Free(page->area_start() + size_in_bytes, page->area_size() - size_in_bytes,
@@ -396,10 +385,8 @@ void PagedSpaceBase::SetLinearAllocationArea(Address top, Address limit,
   SetTopAndLimit(top, limit, end);
   if (top != kNullAddress && top != limit) {
     Page* page = Page::FromAllocationAreaAddress(top);
-    if (identity() == NEW_SPACE) {
-      page->MarkWasUsedForAllocation();
-    } else if (heap()->incremental_marking()->black_allocation()) {
-      DCHECK_NE(NEW_SPACE, identity());
+    if ((identity() != NEW_SPACE) &&
+        heap()->incremental_marking()->black_allocation()) {
       page->CreateBlackArea(top, limit);
     }
   }
@@ -410,11 +397,9 @@ void PagedSpaceBase::DecreaseLimit(Address new_limit) {
   DCHECK_LE(top(), new_limit);
   DCHECK_GE(old_limit, new_limit);
   if (new_limit != old_limit) {
-    base::Optional<CodePageMemoryModificationScope> optional_scope;
-
+    base::Optional<CodePageHeaderModificationScope> optional_scope;
     if (identity() == CODE_SPACE) {
-      MemoryChunk* chunk = MemoryChunk::FromAddress(new_limit);
-      optional_scope.emplace(chunk);
+      optional_scope.emplace("DecreaseLimit writes to the page header.");
     }
 
     ConcurrentAllocationMutex guard(this);
@@ -458,15 +443,12 @@ void PagedSpaceBase::UnmarkLinearAllocationArea() {
 
 void PagedSpaceBase::MakeLinearAllocationAreaIterable() {
   Address current_top = top();
-  Address current_limit = limit();
+  Address current_limit = original_limit_relaxed();
+  DCHECK_GE(current_limit, limit());
+  // Only new space supports LAB extensions. For all other spaces,
+  // `original_limit_relaxed()` and `limit()` should be equivalent.
+  DCHECK_IMPLIES(!SupportsExtendingLAB(), current_limit == limit());
   if (current_top != kNullAddress && current_top != current_limit) {
-    base::Optional<CodePageMemoryModificationScope> optional_scope;
-
-    if (identity() == CODE_SPACE) {
-      MemoryChunk* chunk = MemoryChunk::FromAddress(current_top);
-      optional_scope.emplace(chunk);
-    }
-
     heap_->CreateFillerObjectAt(current_top,
                                 static_cast<int>(current_limit - current_top));
   }
@@ -477,15 +459,6 @@ size_t PagedSpaceBase::Available() const {
   return free_list_->Available();
 }
 
-namespace {
-
-UnprotectMemoryOrigin GetUnprotectMemoryOrigin(bool is_compaction_space) {
-  return is_compaction_space ? UnprotectMemoryOrigin::kMaybeOffMainThread
-                             : UnprotectMemoryOrigin::kMainThread;
-}
-
-}  // namespace
-
 void PagedSpaceBase::FreeLinearAllocationArea() {
   // Mark the old linear allocation area with a free space map so it can be
   // skipped when scanning the heap.
@@ -500,11 +473,10 @@ void PagedSpaceBase::FreeLinearAllocationArea() {
 
   AdvanceAllocationObservers();
 
-  base::Optional<CodePageMemoryModificationScope> optional_scope;
-
+  base::Optional<CodePageHeaderModificationScope> optional_scope;
   if (identity() == CODE_SPACE) {
-    MemoryChunk* chunk = MemoryChunk::FromAddress(allocation_info_.top());
-    optional_scope.emplace(chunk);
+    optional_scope.emplace(
+        "FreeLinearAllocationArea writes to the page header.");
   }
 
   if (identity() != NEW_SPACE && current_top != current_limit &&
@@ -516,14 +488,6 @@ void PagedSpaceBase::FreeLinearAllocationArea() {
   SetTopAndLimit(kNullAddress, kNullAddress, kNullAddress);
   DCHECK_GE(current_limit, current_top);
 
-  // The code page of the linear allocation area needs to be unprotected
-  // because we are going to write a filler into that memory area below.
-  if (identity() == CODE_SPACE) {
-    heap()->UnprotectAndRegisterMemoryChunk(
-        MemoryChunk::FromAddress(current_top),
-        GetUnprotectMemoryOrigin(is_compaction_space()));
-  }
-
   DCHECK_IMPLIES(current_limit - current_top >= 2 * kTaggedSize,
                  heap()->marking_state()->IsUnmarked(
                      HeapObject::FromAddress(current_top)));
@@ -532,8 +496,13 @@ void PagedSpaceBase::FreeLinearAllocationArea() {
 }
 
 void PagedSpaceBase::ReleasePage(Page* page) {
+  ReleasePageImpl(page, MemoryAllocator::FreeMode::kConcurrently);
+}
+
+void PagedSpaceBase::ReleasePageImpl(Page* page,
+                                     MemoryAllocator::FreeMode free_mode) {
   DCHECK(page->SweepingDone());
-  DCHECK_EQ(0, heap()->non_atomic_marking_state()->live_bytes(page));
+  DCHECK_EQ(0, page->live_bytes());
   DCHECK_EQ(page->owner(), this);
 
   DCHECK_IMPLIES(identity() == NEW_SPACE, page->IsFlagSet(Page::TO_PAGE));
@@ -553,8 +522,7 @@ void PagedSpaceBase::ReleasePage(Page* page) {
   AccountUncommitted(page->size());
   DecrementCommittedPhysicalMemory(page->CommittedPhysicalMemory());
   accounting_stats_.DecreaseCapacity(page->area_size());
-  heap()->memory_allocator()->Free(MemoryAllocator::FreeMode::kConcurrently,
-                                   page);
+  heap()->memory_allocator()->Free(free_mode, page);
 }
 
 void PagedSpaceBase::SetReadable() {
@@ -573,14 +541,6 @@ void PagedSpaceBase::SetReadAndExecutable() {
   }
 }
 
-void PagedSpaceBase::SetCodeModificationPermissions() {
-  DCHECK(identity() == CODE_SPACE);
-  for (Page* page : *this) {
-    DCHECK(heap()->memory_allocator()->IsMemoryChunkExecutable(page));
-    page->SetCodeModificationPermissions();
-  }
-}
-
 std::unique_ptr<ObjectIterator> PagedSpaceBase::GetObjectIterator(Heap* heap) {
   return std::unique_ptr<ObjectIterator>(
       new PagedSpaceObjectIterator(heap, this));
@@ -605,7 +565,7 @@ bool PagedSpaceBase::TryAllocationFromFreeListMain(size_t size_in_bytes,
   FreeLinearAllocationArea();
 
   size_t new_node_size = 0;
-  FreeSpace new_node =
+  Tagged<FreeSpace> new_node =
       free_list_->Allocate(size_in_bytes, &new_node_size, origin);
   if (new_node.is_null()) return false;
   DCHECK_GE(new_node_size, size_in_bytes);
@@ -627,10 +587,6 @@ bool PagedSpaceBase::TryAllocationFromFreeListMain(size_t size_in_bytes,
   DCHECK_LE(limit, end);
   DCHECK_LE(size_in_bytes, limit - start);
   if (limit != end) {
-    if (identity() == CODE_SPACE) {
-      heap()->UnprotectAndRegisterMemoryChunk(
-          page, GetUnprotectMemoryOrigin(is_compaction_space()));
-    }
     if (!SupportsExtendingLAB()) {
       Free(limit, end - limit, SpaceAccountingMode::kSpaceAccounted);
       end = limit;
@@ -655,7 +611,7 @@ PagedSpaceBase::TryAllocationFromFreeListBackground(size_t min_size_in_bytes,
          identity() == SHARED_SPACE);
 
   size_t new_node_size = 0;
-  FreeSpace new_node =
+  Tagged<FreeSpace> new_node =
       free_list_->Allocate(min_size_in_bytes, &new_node_size, origin);
   if (new_node.is_null()) return {};
   DCHECK_GE(new_node_size, min_size_in_bytes);
@@ -678,10 +634,6 @@ PagedSpaceBase::TryAllocationFromFreeListBackground(size_t min_size_in_bytes,
   DCHECK_LE(limit, end);
   DCHECK_LE(min_size_in_bytes, limit - start);
   if (limit != end) {
-    if (identity() == CODE_SPACE) {
-      heap()->UnprotectAndRegisterMemoryChunk(
-          page, UnprotectMemoryOrigin::kMaybeOffMainThread);
-    }
     Free(limit, end - limit, SpaceAccountingMode::kSpaceAccounted);
   }
   AddRangeToActiveSystemPages(page, start, limit);
@@ -696,64 +648,63 @@ void PagedSpaceBase::Print() {}
 #ifdef VERIFY_HEAP
 void PagedSpaceBase::Verify(Isolate* isolate,
                             SpaceVerificationVisitor* visitor) const {
+  CHECK_IMPLIES(identity() != NEW_SPACE, size_at_last_gc_ == 0);
+
   bool allocation_pointer_found_in_space =
       (allocation_info_.top() == allocation_info_.limit());
-  size_t external_space_bytes[kNumTypes];
-  size_t external_page_bytes[kNumTypes];
-
-  for (int i = 0; i < kNumTypes; i++) {
-    external_space_bytes[static_cast<ExternalBackingStoreType>(i)] = 0;
-  }
-
+  size_t external_space_bytes[static_cast<int>(
+      ExternalBackingStoreType::kNumValues)] = {0};
   PtrComprCageBase cage_base(isolate);
   for (const Page* page : *this) {
+    size_t external_page_bytes[static_cast<int>(
+        ExternalBackingStoreType::kNumValues)] = {0};
+
     CHECK_EQ(page->owner(), this);
-    CHECK_IMPLIES(identity() != NEW_SPACE, !page->WasUsedForAllocation());
+    CHECK_IMPLIES(identity() != NEW_SPACE, page->AllocatedLabSize() == 0);
     visitor->VerifyPage(page);
 
-    for (int i = 0; i < kNumTypes; i++) {
-      external_page_bytes[static_cast<ExternalBackingStoreType>(i)] = 0;
-    }
-
     if (page == Page::FromAllocationAreaAddress(allocation_info_.top())) {
       allocation_pointer_found_in_space = true;
     }
     CHECK(page->SweepingDone());
-    PagedSpaceObjectIterator it(isolate->heap(), this, page);
     Address end_of_previous_object = page->area_start();
     Address top = page->area_end();
 
-    for (HeapObject object = it.Next(); !object.is_null(); object = it.Next()) {
+    for (Tagged<HeapObject> object : HeapObjectRange(page)) {
       CHECK(end_of_previous_object <= object.address());
 
       // Invoke verification method for each object.
       visitor->VerifyObject(object);
 
       // All the interior pointers should be contained in the heap.
-      int size = object.Size(cage_base);
+      int size = object->Size(cage_base);
       CHECK(object.address() + size <= top);
       end_of_previous_object = object.address() + size;
 
-      if (object.IsExternalString(cage_base)) {
-        ExternalString external_string = ExternalString::cast(object);
-        size_t payload_size = external_string.ExternalPayloadSize();
-        external_page_bytes[ExternalBackingStoreType::kExternalString] +=
-            payload_size;
+      if (IsExternalString(object, cage_base)) {
+        Tagged<ExternalString> external_string = ExternalString::cast(object);
+        size_t payload_size = external_string->ExternalPayloadSize();
+        external_page_bytes[static_cast<int>(
+            ExternalBackingStoreType::kExternalString)] += payload_size;
       }
     }
-    for (int i = 0; i < kNumTypes; i++) {
-      ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-      CHECK_EQ(external_page_bytes[t], page->ExternalBackingStoreBytes(t));
-      external_space_bytes[t] += external_page_bytes[t];
-    }
+    ForAll<ExternalBackingStoreType>(
+        [page, external_page_bytes, &external_space_bytes](
+            ExternalBackingStoreType type, int index) {
+          CHECK_EQ(external_page_bytes[index],
+                   page->ExternalBackingStoreBytes(type));
+          external_space_bytes[index] += external_page_bytes[index];
+        });
 
     visitor->VerifyPageDone(page);
   }
-  for (int i = 0; i < kNumTypes; i++) {
-    if (i == ExternalBackingStoreType::kArrayBuffer) continue;
-    ExternalBackingStoreType t = static_cast<ExternalBackingStoreType>(i);
-    CHECK_EQ(external_space_bytes[t], ExternalBackingStoreBytes(t));
-  }
+  ForAll<ExternalBackingStoreType>(
+      [this, external_space_bytes](ExternalBackingStoreType type, int index) {
+        if (type == ExternalBackingStoreType::kArrayBuffer) {
+          return;
+        }
+        CHECK_EQ(external_space_bytes[index], ExternalBackingStoreBytes(type));
+      });
   CHECK(allocation_pointer_found_in_space);
 
   if (!v8_flags.concurrent_array_buffer_sweeping) {
@@ -762,7 +713,7 @@ void PagedSpaceBase::Verify(Isolate* isolate,
       CHECK_EQ(bytes, ExternalBackingStoreBytes(
                           ExternalBackingStoreType::kArrayBuffer));
     } else if (identity() == NEW_SPACE) {
-      DCHECK(v8_flags.minor_mc);
+      DCHECK(v8_flags.minor_ms);
       size_t bytes = heap()->array_buffer_sweeper()->young().BytesSlow();
       CHECK_EQ(bytes, ExternalBackingStoreBytes(
                           ExternalBackingStoreType::kArrayBuffer));
@@ -779,15 +730,14 @@ void PagedSpaceBase::VerifyLiveBytes() const {
   PtrComprCageBase cage_base(heap()->isolate());
   for (const Page* page : *this) {
     CHECK(page->SweepingDone());
-    PagedSpaceObjectIterator it(heap(), this, page);
     int black_size = 0;
-    for (HeapObject object = it.Next(); !object.is_null(); object = it.Next()) {
+    for (Tagged<HeapObject> object : HeapObjectRange(page)) {
       // All the interior pointers should be contained in the heap.
       if (marking_state->IsMarked(object)) {
-        black_size += object.Size(cage_base);
+        black_size += object->Size(cage_base);
       }
     }
-    CHECK_LE(black_size, marking_state->live_bytes(page));
+    CHECK_LE(black_size, page->live_bytes());
   }
 }
 #endif  // VERIFY_HEAP
@@ -800,11 +750,11 @@ void PagedSpaceBase::VerifyCountersAfterSweeping(Heap* heap) const {
   for (const Page* page : *this) {
     DCHECK(page->SweepingDone());
     total_capacity += page->area_size();
-    PagedSpaceObjectIterator it(heap, this, page);
     size_t real_allocated = 0;
-    for (HeapObject object = it.Next(); !object.is_null(); object = it.Next()) {
-      if (!object.IsFreeSpaceOrFiller()) {
-        real_allocated += ALIGN_TO_ALLOCATION_ALIGNMENT(object.Size(cage_base));
+    for (HeapObject object : HeapObjectRange(page)) {
+      if (!IsFreeSpaceOrFiller(object)) {
+        real_allocated +=
+            ALIGN_TO_ALLOCATION_ALIGNMENT(object->Size(cage_base));
       }
     }
     total_allocated += page->allocated_bytes();
@@ -820,12 +770,9 @@ void PagedSpaceBase::VerifyCountersAfterSweeping(Heap* heap) const {
 void PagedSpaceBase::VerifyCountersBeforeConcurrentSweeping() const {
   size_t total_capacity = 0;
   size_t total_allocated = 0;
-  auto marking_state = heap()->non_atomic_marking_state();
   for (const Page* page : *this) {
     size_t page_allocated =
-        page->SweepingDone()
-            ? page->allocated_bytes()
-            : static_cast<size_t>(marking_state->live_bytes(page));
+        page->SweepingDone() ? page->allocated_bytes() : page->live_bytes();
     total_capacity += page->area_size();
     total_allocated += page_allocated;
     DCHECK_EQ(page_allocated, accounting_stats_.AllocatedOnPage(page));
@@ -845,9 +792,6 @@ void PagedSpaceBase::UpdateInlineAllocationLimit() {
   DecreaseLimit(new_limit);
 }
 
-// -----------------------------------------------------------------------------
-// OldSpace implementation
-
 bool PagedSpaceBase::RefillLabMain(int size_in_bytes, AllocationOrigin origin) {
   VMState<GC> state(heap()->isolate());
   RCS_SCOPE(heap()->isolate(),
@@ -855,21 +799,13 @@ bool PagedSpaceBase::RefillLabMain(int size_in_bytes, AllocationOrigin origin) {
   return RawRefillLabMain(size_in_bytes, origin);
 }
 
-Page* CompactionSpace::TryExpandImpl() {
-  DCHECK_NE(NEW_SPACE, identity());
-  Page* page = PagedSpaceBase::TryExpandImpl();
-  new_pages_.push_back(page);
-  return page;
-}
-
-bool CompactionSpace::RefillLabMain(int size_in_bytes,
-                                    AllocationOrigin origin) {
-  return RawRefillLabMain(size_in_bytes, origin);
-}
-
 bool PagedSpaceBase::TryExpand(int size_in_bytes, AllocationOrigin origin) {
   DCHECK_NE(NEW_SPACE, identity());
-  Page* page = TryExpandImpl();
+  base::Optional<CodePageHeaderModificationScope> optional_scope;
+  if (identity() == CODE_SPACE) {
+    optional_scope.emplace("TryExpand writes to the page header.");
+  }
+  Page* page = TryExpandImpl(MemoryAllocator::AllocationMode::kRegular);
   if (!page) return false;
   if (!is_compaction_space() && identity() != NEW_SPACE) {
     heap()->NotifyOldGenerationExpansion(identity(), page);
@@ -924,8 +860,10 @@ bool PagedSpaceBase::RawRefillLabMain(int size_in_bytes,
     // may have freed some objects in the meantime.
     if (heap()->sweeper()->ShouldRefillFreelistForSpace(identity())) {
       {
-        TRACE_GC_EPOCH(heap()->tracer(), sweeping_scope_id,
-                       sweeping_scope_kind);
+        TRACE_GC_EPOCH_WITH_FLOW(
+            heap()->tracer(), sweeping_scope_id, sweeping_scope_kind,
+            heap()->sweeper()->GetTraceIdForFlowEvent(sweeping_scope_id),
+            TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
         RefillFreeList();
       }
 
@@ -982,12 +920,17 @@ bool PagedSpaceBase::ContributeToSweepingMain(
     int required_freed_bytes, int max_pages, int size_in_bytes,
     AllocationOrigin origin, GCTracer::Scope::ScopeId sweeping_scope_id,
     ThreadKind sweeping_scope_kind) {
-  if (!heap()->sweeping_in_progress()) return false;
-  if (!heap()->sweeper()->AreSweeperTasksRunning() &&
+  if (!heap()->sweeping_in_progress_for_space(identity())) return false;
+  if (!(identity() == NEW_SPACE
+            ? heap()->sweeper()->AreMinorSweeperTasksRunning()
+            : heap()->sweeper()->AreMajorSweeperTasksRunning()) &&
       heap()->sweeper()->IsSweepingDoneForSpace(identity()))
     return false;
 
-  TRACE_GC_EPOCH(heap()->tracer(), sweeping_scope_id, sweeping_scope_kind);
+  TRACE_GC_EPOCH_WITH_FLOW(
+      heap()->tracer(), sweeping_scope_id, sweeping_scope_kind,
+      heap()->sweeper()->GetTraceIdForFlowEvent(sweeping_scope_id),
+      TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
   // Cleanup invalidated old-to-new refs for compaction space in the
   // final atomic pause.
   Sweeper::SweepingMode sweeping_mode =
@@ -1036,6 +979,7 @@ size_t PagedSpaceBase::RelinkFreeListCategories(Page* page) {
     added += category->available();
     category->Relink(free_list());
   });
+  free_list()->increase_wasted_bytes(page->wasted_memory());
 
   DCHECK_IMPLIES(!page->IsFlagSet(Page::NEVER_ALLOCATE_ON_PAGE),
                  page->AvailableInFreeList() ==
@@ -1043,44 +987,100 @@ size_t PagedSpaceBase::RelinkFreeListCategories(Page* page) {
   return added;
 }
 
-void PagedSpace::RefillFreeList() {
+namespace {
+
+void DropFreeListCategories(Page* page, FreeList* free_list) {
+  size_t previously_available = 0;
+  page->ForAllFreeListCategories(
+      [free_list, &previously_available](FreeListCategory* category) {
+        previously_available += category->available();
+        category->Reset(free_list);
+      });
+  page->add_wasted_memory(previously_available);
+}
+
+}  // namespace
+
+void PagedSpaceBase::RefillFreeList() {
   // Any PagedSpace might invoke RefillFreeList.
   DCHECK(identity() == OLD_SPACE || identity() == CODE_SPACE ||
-         identity() == SHARED_SPACE);
+         identity() == SHARED_SPACE || identity() == NEW_SPACE);
+  DCHECK_IMPLIES(
+      identity() == NEW_SPACE,
+      heap_->IsMainThread() || (heap_->IsSharedMainThread() &&
+                                !heap_->isolate()->is_shared_space_isolate()));
+  DCHECK(!is_compaction_space());
+
+  for (Page* p : heap()->sweeper()->GetAllSweptPagesSafe(this)) {
+    // We regularly sweep NEVER_ALLOCATE_ON_PAGE pages. We drop the freelist
+    // entries here to make them unavailable for allocations.
+    if (p->IsFlagSet(Page::NEVER_ALLOCATE_ON_PAGE)) {
+      DropFreeListCategories(p, free_list());
+    }
 
-  Sweeper* sweeper = heap()->sweeper();
+    ConcurrentAllocationMutex guard(this);
+    DCHECK_EQ(this, p->owner());
+    RefineAllocatedBytesAfterSweeping(p);
+    RelinkFreeListCategories(p);
+  }
+}
 
-  size_t added = 0;
+// -----------------------------------------------------------------------------
+// CompactionSpace implementation
 
+Page* CompactionSpace::TryExpandImpl(
+    MemoryAllocator::AllocationMode allocation_mode) {
+  DCHECK_NE(NEW_SPACE, identity());
+  Page* page = PagedSpaceBase::TryExpandImpl(allocation_mode);
+  new_pages_.push_back(page);
+  return page;
+}
+
+void CompactionSpace::RefillFreeList() {
+  DCHECK_NE(NEW_SPACE, identity());
+
+  Sweeper* sweeper = heap()->sweeper();
+  size_t added = 0;
   Page* p = nullptr;
-  while ((p = sweeper->GetSweptPageSafe(this)) != nullptr) {
+  while ((added <= kCompactionMemoryWanted) &&
+         (p = sweeper->GetSweptPageSafe(this))) {
     // We regularly sweep NEVER_ALLOCATE_ON_PAGE pages. We drop the freelist
     // entries here to make them unavailable for allocations.
     if (p->IsFlagSet(Page::NEVER_ALLOCATE_ON_PAGE)) {
-      p->ForAllFreeListCategories(
-          [this](FreeListCategory* category) { category->Reset(free_list()); });
+      DropFreeListCategories(p, free_list());
     }
 
     // Only during compaction pages can actually change ownership. This is
     // safe because there exists no other competing action on the page links
     // during compaction.
-    if (is_compaction_space()) {
-      DCHECK_NE(this, p->owner());
-      DCHECK_NE(NEW_SPACE, identity());
-      PagedSpace* owner = reinterpret_cast<PagedSpace*>(p->owner());
-      base::MutexGuard guard(owner->mutex());
-      owner->RefineAllocatedBytesAfterSweeping(p);
-      owner->RemovePage(p);
-      added += AddPage(p);
-      added += p->wasted_memory();
-    } else {
-      base::MutexGuard guard(mutex());
-      DCHECK_EQ(this, p->owner());
-      RefineAllocatedBytesAfterSweeping(p);
-      added += RelinkFreeListCategories(p);
-      added += p->wasted_memory();
-    }
-    if (is_compaction_space() && (added > kCompactionMemoryWanted)) break;
+    DCHECK_NE(this, p->owner());
+    PagedSpace* owner = static_cast<PagedSpace*>(p->owner());
+    base::MutexGuard guard(owner->mutex());
+    owner->RefineAllocatedBytesAfterSweeping(p);
+    owner->RemovePage(p);
+    added += AddPage(p);
+    added += p->wasted_memory();
+  }
+}
+
+bool CompactionSpace::RefillLabMain(int size_in_bytes,
+                                    AllocationOrigin origin) {
+  return RawRefillLabMain(size_in_bytes, origin);
+}
+
+// -----------------------------------------------------------------------------
+// OldSpace implementation
+
+void OldSpace::AddPromotedPage(Page* page) {
+  if (v8_flags.minor_ms) {
+    // Reset the page's allocated bytes. The page will be swept and the
+    // allocated bytes will be updated to match the live bytes.
+    DCHECK_EQ(page->area_size(), page->allocated_bytes());
+    page->DecreaseAllocatedBytes(page->area_size());
+  }
+  AddPageImpl(page);
+  if (!v8_flags.minor_ms) {
+    RelinkFreeListCategories(page);
   }
 }
 
diff --git a/deps/v8/src/heap/paged-spaces.h b/deps/v8/src/heap/paged-spaces.h
index 6e961bf684451b..a7901aab66064a 100644
--- a/deps/v8/src/heap/paged-spaces.h
+++ b/deps/v8/src/heap/paged-spaces.h
@@ -35,6 +35,78 @@ class ObjectVisitor;
 class PagedSpaceBase;
 class Sweeper;
 
+class HeapObjectRange final {
+ public:
+  class iterator final {
+   public:
+    using value_type = HeapObject;
+    using pointer = const value_type*;
+    using reference = const value_type&;
+    using iterator_category = std::forward_iterator_tag;
+
+    inline iterator();
+    explicit inline iterator(const Page* page);
+
+    inline iterator& operator++();
+    inline iterator operator++(int);
+
+    bool operator==(iterator other) const {
+      return cur_addr_ == other.cur_addr_;
+    }
+    bool operator!=(iterator other) const { return !(*this == other); }
+
+    value_type operator*() { return HeapObject::FromAddress(cur_addr_); }
+
+   private:
+    inline void AdvanceToNextObject();
+
+    PtrComprCageBase cage_base() const { return cage_base_; }
+
+    PtrComprCageBase cage_base_;
+    Address cur_addr_ = kNullAddress;  // Current iteration point.
+    int cur_size_ = 0;
+    Address cur_end_ = kNullAddress;  // End iteration point.
+  };
+
+  explicit HeapObjectRange(const Page* page) : page_(page) {}
+
+  inline iterator begin();
+  inline iterator end();
+
+ private:
+  const Page* const page_;
+};
+
+// Heap object iterator in paged spaces.
+//
+// A PagedSpaceObjectIterator iterates objects from the bottom of the given
+// space to its top or from the bottom of the given page to its top.
+//
+// If objects are allocated in the page during iteration the iterator may
+// or may not iterate over those objects.  The caller must create a new
+// iterator in order to be sure to visit these new objects.
+class V8_EXPORT_PRIVATE PagedSpaceObjectIterator : public ObjectIterator {
+ public:
+  // Creates a new object iterator in a given space.
+  PagedSpaceObjectIterator(Heap* heap, const PagedSpaceBase* space);
+
+  // Advance to the next object, skipping free spaces and other fillers and
+  // skipping the special garbage section of which there is one per space.
+  // Returns nullptr when the iteration has ended.
+  inline Tagged<HeapObject> Next() override;
+
+ private:
+  // Slow path of next(), goes into the next page.  Returns false if the
+  // iteration has ended.
+  bool AdvanceToNextPage();
+
+  HeapObjectRange::iterator cur_;
+  HeapObjectRange::iterator end_;
+  const PagedSpaceBase* const space_;
+  ConstPageRange page_range_;
+  ConstPageRange::iterator current_page_;
+};
+
 class V8_EXPORT_PRIVATE PagedSpaceBase
     : NON_EXPORTED_BASE(public SpaceWithLinearArea) {
  public:
@@ -46,7 +118,8 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
   // Creates a space with an id.
   PagedSpaceBase(
       Heap* heap, AllocationSpace id, Executability executable,
-      FreeList* free_list, AllocationCounter& allocation_counter,
+      std::unique_ptr<FreeList> free_list,
+      AllocationCounter& allocation_counter,
       LinearAllocationArea& allocation_info,
       LinearAreaOriginalData& linear_area_original_data,
       CompactionSpaceKind compaction_space_kind = CompactionSpaceKind::kNone);
@@ -55,7 +128,7 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
 
   // Checks whether an object/address is in this space.
   inline bool Contains(Address a) const;
-  inline bool Contains(Object o) const;
+  inline bool Contains(Tagged<Object> o) const;
   bool ContainsSlow(Address addr) const;
 
   // Does the space need executable memory?
@@ -125,6 +198,7 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
     size_t wasted = free_list_->Free(start, size_in_bytes, kLinkCategory);
     Page* page = Page::FromAddress(start);
     accounting_stats_.DecreaseAllocatedBytes(size_in_bytes, page);
+    free_list()->increase_wasted_bytes(wasted);
     DCHECK_GE(size_in_bytes, wasted);
     return size_in_bytes - wasted;
   }
@@ -174,7 +248,6 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
 
   void SetReadable();
   void SetReadAndExecutable();
-  void SetCodeModificationPermissions();
 
   void SetDefaultCodePermissions() {
     if (v8_flags.jitless) {
@@ -225,7 +298,7 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
 
   // Refills the free list from the corresponding free list filled by the
   // sweeper.
-  virtual void RefillFreeList() = 0;
+  virtual void RefillFreeList();
 
   base::Mutex* mutex() { return &space_mutex_; }
 
@@ -279,28 +352,7 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
   base::Optional<std::pair<Address, size_t>> TryExpandBackground(
       size_t size_in_bytes);
 
- private:
-  class ConcurrentAllocationMutex {
-   public:
-    explicit ConcurrentAllocationMutex(const PagedSpaceBase* space) {
-      if (space->SupportsConcurrentAllocation()) {
-        guard_.emplace(&space->space_mutex_);
-      }
-    }
-
-    base::Optional<base::MutexGuard> guard_;
-  };
-
-  bool SupportsConcurrentAllocation() const {
-    return !is_compaction_space() && (identity() != NEW_SPACE);
-  }
-
-  // Set space linear allocation area.
-  void SetTopAndLimit(Address top, Address limit, Address end);
-  void DecreaseLimit(Address new_limit);
-  bool SupportsAllocationObserver() const override {
-    return !is_compaction_space();
-  }
+  void RefineAllocatedBytesAfterSweeping(Page* page);
 
  protected:
   // Updates the current lab limit without updating top, original_top or
@@ -309,8 +361,6 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
 
   bool SupportsExtendingLAB() const { return identity() == NEW_SPACE; }
 
-  void RefineAllocatedBytesAfterSweeping(Page* page);
-
   void UpdateInlineAllocationLimit() override;
 
   // PagedSpaces that should be included in snapshots have different, i.e.,
@@ -326,7 +376,7 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
   // Expands the space by allocating a fixed number of pages. Returns false if
   // it cannot allocate requested number of pages from OS, or if the hard heap
   // size limit has been hit.
-  virtual Page* TryExpandImpl();
+  virtual Page* TryExpandImpl(MemoryAllocator::AllocationMode allocation_mode);
 
   bool EnsureAllocation(int size_in_bytes, AllocationAlignment alignment,
                         AllocationOrigin origin,
@@ -360,6 +410,10 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
     return committed_physical_memory_.load(std::memory_order_relaxed);
   }
 
+  void ReleasePageImpl(Page* page, MemoryAllocator::FreeMode free_mode);
+
+  void AddPageImpl(Page* page);
+
   Executability executable_;
 
   CompactionSpaceKind compaction_space_kind_;
@@ -374,6 +428,32 @@ class V8_EXPORT_PRIVATE PagedSpaceBase
 
   std::atomic<size_t> committed_physical_memory_{0};
 
+  // Used for tracking bytes allocated since last gc in new space.
+  size_t size_at_last_gc_ = 0;
+
+ private:
+  class ConcurrentAllocationMutex {
+   public:
+    explicit ConcurrentAllocationMutex(const PagedSpaceBase* space) {
+      if (space->SupportsConcurrentAllocation()) {
+        guard_.emplace(&space->space_mutex_);
+      }
+    }
+
+    base::Optional<base::MutexGuard> guard_;
+  };
+
+  bool SupportsConcurrentAllocation() const {
+    return !is_compaction_space() && (identity() != NEW_SPACE);
+  }
+
+  // Set space linear allocation area.
+  void SetTopAndLimit(Address top, Address limit, Address end);
+  void DecreaseLimit(Address new_limit);
+  bool SupportsAllocationObserver() const override {
+    return !is_compaction_space();
+  }
+
   friend class IncrementalMarking;
   friend class MarkCompactCollector;
 
@@ -386,13 +466,12 @@ class V8_EXPORT_PRIVATE PagedSpace : public PagedSpaceBase {
   // Creates a space with an id.
   PagedSpace(
       Heap* heap, AllocationSpace id, Executability executable,
-      FreeList* free_list, LinearAllocationArea& allocation_info,
+      std::unique_ptr<FreeList> free_list,
+      LinearAllocationArea& allocation_info,
       CompactionSpaceKind compaction_space_kind = CompactionSpaceKind::kNone)
-      : PagedSpaceBase(heap, id, executable, free_list, allocation_counter_,
-                       allocation_info, linear_area_original_data_,
-                       compaction_space_kind) {}
-
-  void RefillFreeList() final;
+      : PagedSpaceBase(heap, id, executable, std::move(free_list),
+                       allocation_counter_, allocation_info,
+                       linear_area_original_data_, compaction_space_kind) {}
 
  private:
   AllocationCounter allocation_counter_;
@@ -413,19 +492,21 @@ class V8_EXPORT_PRIVATE CompactionSpace final : public PagedSpace {
 
   const std::vector<Page*>& GetNewPages() { return new_pages_; }
 
- private:
-  LinearAllocationArea allocation_info_;
+  void RefillFreeList() final;
 
  protected:
   V8_WARN_UNUSED_RESULT bool RefillLabMain(int size_in_bytes,
-                                           AllocationOrigin origin) override;
+                                           AllocationOrigin origin) final;
 
-  Page* TryExpandImpl() final;
+  Page* TryExpandImpl(MemoryAllocator::AllocationMode allocation_mode) final;
   // The space is temporary and not included in any snapshots.
   bool snapshotable() const final { return false; }
   // Pages that were allocated in this local space and need to be merged
   // to the main space.
   std::vector<Page*> new_pages_;
+
+ private:
+  LinearAllocationArea allocation_info_;
 };
 
 // A collection of |CompactionSpace|s used by a single compaction task.
@@ -476,10 +557,12 @@ class OldSpace final : public PagedSpace {
            MemoryChunkLayout::ObjectStartOffsetInDataPage();
   }
 
+  void AddPromotedPage(Page* page);
+
   size_t ExternalBackingStoreBytes(ExternalBackingStoreType type) const final {
     if (type == ExternalBackingStoreType::kArrayBuffer)
       return heap()->OldArrayBufferBytes();
-    return external_backing_store_bytes_[type];
+    return external_backing_store_bytes_[static_cast<int>(type)];
   }
 };
 
@@ -517,7 +600,7 @@ class SharedSpace final : public PagedSpace {
   size_t ExternalBackingStoreBytes(ExternalBackingStoreType type) const final {
     if (type == ExternalBackingStoreType::kArrayBuffer) return 0;
     DCHECK_EQ(type, ExternalBackingStoreType::kExternalString);
-    return external_backing_store_bytes_[type];
+    return external_backing_store_bytes_[static_cast<int>(type)];
   }
 
  private:
@@ -533,6 +616,16 @@ class OldGenerationMemoryChunkIterator {
   // Return nullptr when the iterator is done.
   inline MemoryChunk* next();
 
+  // Applies `callback` to all `MemoryChunk` returned by the iterator.
+  template <typename Callback>
+  static void ForAll(Heap* heap, Callback callback) {
+    OldGenerationMemoryChunkIterator it(heap);
+    MemoryChunk* chunk;
+    while ((chunk = it.next()) != nullptr) {
+      callback(chunk);
+    }
+  }
+
  private:
   enum State {
     kOldSpaceState,
diff --git a/deps/v8/src/heap/parallel-work-item.h b/deps/v8/src/heap/parallel-work-item.h
index 9f58d305196b7f..326fc7b5205e7e 100644
--- a/deps/v8/src/heap/parallel-work-item.h
+++ b/deps/v8/src/heap/parallel-work-item.h
@@ -22,6 +22,11 @@ class ParallelWorkItem {
                true, std::memory_order_relaxed) == false;
   }
 
+  bool IsAcquired() const {
+    return reinterpret_cast<const std::atomic<bool>*>(&acquire_)->load(
+        std::memory_order_relaxed);
+  }
+
  private:
   bool acquire_{false};
 };
diff --git a/deps/v8/src/heap/parked-scope-inl.h b/deps/v8/src/heap/parked-scope-inl.h
new file mode 100644
index 00000000000000..2d2fda5f00cc08
--- /dev/null
+++ b/deps/v8/src/heap/parked-scope-inl.h
@@ -0,0 +1,145 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_PARKED_SCOPE_INL_H_
+#define V8_HEAP_PARKED_SCOPE_INL_H_
+
+#include "src/base/platform/condition-variable.h"
+#include "src/base/platform/mutex.h"
+#include "src/base/platform/semaphore.h"
+#include "src/execution/local-isolate.h"
+#include "src/heap/local-heap-inl.h"
+#include "src/heap/parked-scope.h"
+
+namespace v8 {
+namespace internal {
+
+V8_INLINE ParkedMutexGuard::ParkedMutexGuard(LocalIsolate* local_isolate,
+                                             base::Mutex* mutex)
+    : ParkedMutexGuard(local_isolate->heap(), mutex) {}
+
+V8_INLINE ParkedMutexGuard::ParkedMutexGuard(LocalHeap* local_heap,
+                                             base::Mutex* mutex)
+    : mutex_(mutex) {
+  DCHECK(AllowGarbageCollection::IsAllowed());
+  if (!mutex_->TryLock()) {
+    local_heap->BlockWhileParked([this]() { mutex_->Lock(); });
+  }
+}
+
+V8_INLINE ParkedRecursiveMutexGuard::ParkedRecursiveMutexGuard(
+    LocalIsolate* local_isolate, base::RecursiveMutex* mutex)
+    : ParkedRecursiveMutexGuard(local_isolate->heap(), mutex) {}
+
+V8_INLINE ParkedRecursiveMutexGuard::ParkedRecursiveMutexGuard(
+    LocalHeap* local_heap, base::RecursiveMutex* mutex)
+    : mutex_(mutex) {
+  DCHECK(AllowGarbageCollection::IsAllowed());
+  if (!mutex_->TryLock()) {
+    local_heap->BlockWhileParked([this]() { mutex_->Lock(); });
+  }
+}
+
+template <base::MutexSharedType kIsShared, base::NullBehavior Behavior>
+V8_INLINE
+ParkedSharedMutexGuardIf<kIsShared, Behavior>::ParkedSharedMutexGuardIf(
+    LocalHeap* local_heap, base::SharedMutex* mutex, bool enable_mutex) {
+  DCHECK(AllowGarbageCollection::IsAllowed());
+  DCHECK_IMPLIES(Behavior == base::NullBehavior::kRequireNotNull,
+                 mutex != nullptr);
+  if (!enable_mutex) return;
+  mutex_ = mutex;
+
+  if (kIsShared) {
+    if (!mutex_->TryLockShared()) {
+      local_heap->BlockWhileParked([this]() { mutex_->LockShared(); });
+    }
+  } else {
+    if (!mutex_->TryLockExclusive()) {
+      local_heap->BlockWhileParked([this]() { mutex_->LockExclusive(); });
+    }
+  }
+}
+
+V8_INLINE void ParkingConditionVariable::ParkedWait(LocalIsolate* local_isolate,
+                                                    base::Mutex* mutex) {
+  ParkedWait(local_isolate->heap(), mutex);
+}
+
+V8_INLINE void ParkingConditionVariable::ParkedWait(LocalHeap* local_heap,
+                                                    base::Mutex* mutex) {
+  local_heap->BlockWhileParked(
+      [this, mutex](const ParkedScope& parked) { ParkedWait(parked, mutex); });
+}
+
+V8_INLINE bool ParkingConditionVariable::ParkedWaitFor(
+    LocalIsolate* local_isolate, base::Mutex* mutex,
+    const base::TimeDelta& rel_time) {
+  return ParkedWaitFor(local_isolate->heap(), mutex, rel_time);
+}
+
+V8_INLINE bool ParkingConditionVariable::ParkedWaitFor(
+    LocalHeap* local_heap, base::Mutex* mutex,
+    const base::TimeDelta& rel_time) {
+  bool result;
+  local_heap->BlockWhileParked(
+      [this, mutex, rel_time, &result](const ParkedScope& parked) {
+        result = ParkedWaitFor(parked, mutex, rel_time);
+      });
+  return result;
+}
+
+V8_INLINE void ParkingSemaphore::ParkedWait(LocalIsolate* local_isolate) {
+  ParkedWait(local_isolate->heap());
+}
+
+V8_INLINE void ParkingSemaphore::ParkedWait(LocalHeap* local_heap) {
+  local_heap->BlockWhileParked(
+      [this](const ParkedScope& parked) { ParkedWait(parked); });
+}
+
+V8_INLINE bool ParkingSemaphore::ParkedWaitFor(
+    LocalIsolate* local_isolate, const base::TimeDelta& rel_time) {
+  return ParkedWaitFor(local_isolate->heap(), rel_time);
+}
+
+V8_INLINE bool ParkingSemaphore::ParkedWaitFor(
+    LocalHeap* local_heap, const base::TimeDelta& rel_time) {
+  bool result;
+  local_heap->BlockWhileParked(
+      [this, rel_time, &result](const ParkedScope& parked) {
+        result = ParkedWaitFor(parked, rel_time);
+      });
+  return result;
+}
+
+V8_INLINE void ParkingThread::ParkedJoin(LocalIsolate* local_isolate) {
+  ParkedJoin(local_isolate->heap());
+}
+
+V8_INLINE void ParkingThread::ParkedJoin(LocalHeap* local_heap) {
+  local_heap->BlockWhileParked(
+      [this](const ParkedScope& parked) { ParkedJoin(parked); });
+}
+
+template <typename ThreadCollection>
+// static
+V8_INLINE void ParkingThread::ParkedJoinAll(LocalIsolate* local_isolate,
+                                            const ThreadCollection& threads) {
+  ParkedJoinAll(local_isolate->heap(), threads);
+}
+
+template <typename ThreadCollection>
+// static
+V8_INLINE void ParkingThread::ParkedJoinAll(LocalHeap* local_heap,
+                                            const ThreadCollection& threads) {
+  local_heap->BlockWhileParked([&threads](const ParkedScope& parked) {
+    ParkedJoinAll(parked, threads);
+  });
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_PARKED_SCOPE_INL_H_
diff --git a/deps/v8/src/heap/parked-scope.h b/deps/v8/src/heap/parked-scope.h
index de92c32bc9f898..9aee0cd5fda419 100644
--- a/deps/v8/src/heap/parked-scope.h
+++ b/deps/v8/src/heap/parked-scope.h
@@ -30,6 +30,18 @@ class V8_NODISCARD ParkedScope {
   LocalHeap* const local_heap_;
 };
 
+class V8_NODISCARD ParkedScopeIfOnBackground {
+ public:
+  explicit ParkedScopeIfOnBackground(LocalIsolate* local_isolate)
+      : ParkedScopeIfOnBackground(local_isolate->heap()) {}
+  explicit ParkedScopeIfOnBackground(LocalHeap* local_heap) {
+    if (!local_heap->is_main_thread()) scope_.emplace(local_heap);
+  }
+
+ private:
+  base::Optional<ParkedScope> scope_;
+};
+
 // Scope that explicitly unparks a thread, allowing access to the heap and the
 // creation of handles.
 class V8_NODISCARD UnparkedScope {
@@ -46,20 +58,26 @@ class V8_NODISCARD UnparkedScope {
   LocalHeap* const local_heap_;
 };
 
+class V8_NODISCARD UnparkedScopeIfOnBackground {
+ public:
+  explicit UnparkedScopeIfOnBackground(LocalIsolate* local_isolate)
+      : UnparkedScopeIfOnBackground(local_isolate->heap()) {}
+  explicit UnparkedScopeIfOnBackground(LocalHeap* local_heap) {
+    if (!local_heap->is_main_thread()) scope_.emplace(local_heap);
+  }
+
+ private:
+  base::Optional<UnparkedScope> scope_;
+};
+
 // Scope that automatically parks the thread while blocking on the given
 // base::Mutex.
 class V8_NODISCARD ParkedMutexGuard {
  public:
-  explicit ParkedMutexGuard(LocalIsolate* local_isolate, base::Mutex* mutex)
-      : ParkedMutexGuard(local_isolate->heap(), mutex) {}
-  explicit ParkedMutexGuard(LocalHeap* local_heap, base::Mutex* mutex)
-      : mutex_(mutex) {
-    DCHECK(AllowGarbageCollection::IsAllowed());
-    if (!mutex_->TryLock()) {
-      ParkedScope scope(local_heap);
-      mutex_->Lock();
-    }
-  }
+  explicit V8_INLINE ParkedMutexGuard(LocalIsolate* local_isolate,
+                                      base::Mutex* mutex);
+  explicit V8_INLINE ParkedMutexGuard(LocalHeap* local_heap,
+                                      base::Mutex* mutex);
 
   ParkedMutexGuard(const ParkedMutexGuard&) = delete;
   ParkedMutexGuard& operator=(const ParkedMutexGuard&) = delete;
@@ -74,21 +92,13 @@ class V8_NODISCARD ParkedMutexGuard {
 // base::RecursiveMutex.
 class V8_NODISCARD ParkedRecursiveMutexGuard {
  public:
-  explicit ParkedRecursiveMutexGuard(LocalIsolate* local_isolate,
-                                     base::RecursiveMutex* mutex)
-      : ParkedRecursiveMutexGuard(local_isolate->heap(), mutex) {}
-  explicit ParkedRecursiveMutexGuard(LocalHeap* local_heap,
-                                     base::RecursiveMutex* mutex)
-      : mutex_(mutex) {
-    DCHECK(AllowGarbageCollection::IsAllowed());
-    if (!mutex_->TryLock()) {
-      ParkedScope scope(local_heap);
-      mutex_->Lock();
-    }
-  }
-
-  ParkedRecursiveMutexGuard(const ParkedMutexGuard&) = delete;
-  ParkedRecursiveMutexGuard& operator=(const ParkedMutexGuard&) = delete;
+  V8_INLINE ParkedRecursiveMutexGuard(LocalIsolate* local_isolate,
+                                      base::RecursiveMutex* mutex);
+  V8_INLINE ParkedRecursiveMutexGuard(LocalHeap* local_heap,
+                                      base::RecursiveMutex* mutex);
+  ParkedRecursiveMutexGuard(const ParkedRecursiveMutexGuard&) = delete;
+  ParkedRecursiveMutexGuard& operator=(const ParkedRecursiveMutexGuard&) =
+      delete;
 
   ~ParkedRecursiveMutexGuard() { mutex_->Unlock(); }
 
@@ -103,26 +113,9 @@ class V8_NODISCARD ParkedSharedMutexGuardIf final {
   ParkedSharedMutexGuardIf(LocalIsolate* local_isolate,
                            base::SharedMutex* mutex, bool enable_mutex)
       : ParkedSharedMutexGuardIf(local_isolate->heap(), mutex, enable_mutex) {}
-  ParkedSharedMutexGuardIf(LocalHeap* local_heap, base::SharedMutex* mutex,
-                           bool enable_mutex) {
-    DCHECK(AllowGarbageCollection::IsAllowed());
-    DCHECK_IMPLIES(Behavior == base::NullBehavior::kRequireNotNull,
-                   mutex != nullptr);
-    if (!enable_mutex) return;
-    mutex_ = mutex;
-
-    if (kIsShared) {
-      if (!mutex_->TryLockShared()) {
-        ParkedScope scope(local_heap);
-        mutex_->LockShared();
-      }
-    } else {
-      if (!mutex_->TryLockExclusive()) {
-        ParkedScope scope(local_heap);
-        mutex_->LockExclusive();
-      }
-    }
-  }
+  V8_INLINE ParkedSharedMutexGuardIf(LocalHeap* local_heap,
+                                     base::SharedMutex* mutex,
+                                     bool enable_mutex);
   ParkedSharedMutexGuardIf(const ParkedSharedMutexGuardIf&) = delete;
   ParkedSharedMutexGuardIf& operator=(const ParkedSharedMutexGuardIf&) = delete;
 
@@ -149,27 +142,21 @@ class V8_NODISCARD ParkingConditionVariable final
   ParkingConditionVariable(const ParkingConditionVariable&) = delete;
   ParkingConditionVariable& operator=(const ParkingConditionVariable&) = delete;
 
-  void ParkedWait(LocalIsolate* local_isolate, base::Mutex* mutex) {
-    ParkedWait(local_isolate->heap(), mutex);
-  }
-  void ParkedWait(LocalHeap* local_heap, base::Mutex* mutex) {
-    ParkedScope scope(local_heap);
-    ParkedWait(scope, mutex);
-  }
+  V8_INLINE void ParkedWait(LocalIsolate* local_isolate, base::Mutex* mutex);
+  V8_INLINE void ParkedWait(LocalHeap* local_heap, base::Mutex* mutex);
+
   void ParkedWait(const ParkedScope& scope, base::Mutex* mutex) {
     USE(scope);
     Wait(mutex);
   }
 
-  bool ParkedWaitFor(LocalIsolate* local_isolate, base::Mutex* mutex,
-                     const base::TimeDelta& rel_time) V8_WARN_UNUSED_RESULT {
-    return ParkedWaitFor(local_isolate->heap(), mutex, rel_time);
-  }
-  bool ParkedWaitFor(LocalHeap* local_heap, base::Mutex* mutex,
-                     const base::TimeDelta& rel_time) V8_WARN_UNUSED_RESULT {
-    ParkedScope scope(local_heap);
-    return ParkedWaitFor(scope, mutex, rel_time);
-  }
+  V8_INLINE bool ParkedWaitFor(LocalIsolate* local_isolate, base::Mutex* mutex,
+                               const base::TimeDelta& rel_time)
+      V8_WARN_UNUSED_RESULT;
+  V8_INLINE bool ParkedWaitFor(LocalHeap* local_heap, base::Mutex* mutex,
+                               const base::TimeDelta& rel_time)
+      V8_WARN_UNUSED_RESULT;
+
   bool ParkedWaitFor(const ParkedScope& scope, base::Mutex* mutex,
                      const base::TimeDelta& rel_time) V8_WARN_UNUSED_RESULT {
     USE(scope);
@@ -189,27 +176,21 @@ class V8_NODISCARD ParkingSemaphore final : public base::Semaphore {
   ParkingSemaphore(const ParkingSemaphore&) = delete;
   ParkingSemaphore& operator=(const ParkingSemaphore&) = delete;
 
-  void ParkedWait(LocalIsolate* local_isolate) {
-    ParkedWait(local_isolate->heap());
-  }
-  void ParkedWait(LocalHeap* local_heap) {
-    ParkedScope scope(local_heap);
-    ParkedWait(scope);
-  }
+  V8_INLINE void ParkedWait(LocalIsolate* local_isolate);
+  V8_INLINE void ParkedWait(LocalHeap* local_heap);
+
   void ParkedWait(const ParkedScope& scope) {
     USE(scope);
     Wait();
   }
 
-  bool ParkedWaitFor(LocalIsolate* local_isolate,
-                     const base::TimeDelta& rel_time) V8_WARN_UNUSED_RESULT {
-    return ParkedWaitFor(local_isolate->heap(), rel_time);
-  }
-  bool ParkedWaitFor(LocalHeap* local_heap,
-                     const base::TimeDelta& rel_time) V8_WARN_UNUSED_RESULT {
-    ParkedScope scope(local_heap);
-    return ParkedWaitFor(scope, rel_time);
-  }
+  V8_INLINE bool ParkedWaitFor(LocalIsolate* local_isolate,
+                               const base::TimeDelta& rel_time)
+      V8_WARN_UNUSED_RESULT;
+  V8_INLINE bool ParkedWaitFor(LocalHeap* local_heap,
+                               const base::TimeDelta& rel_time)
+      V8_WARN_UNUSED_RESULT;
+
   bool ParkedWaitFor(const ParkedScope& scope,
                      const base::TimeDelta& rel_time) {
     USE(scope);
@@ -221,6 +202,36 @@ class V8_NODISCARD ParkingSemaphore final : public base::Semaphore {
   using base::Semaphore::WaitFor;
 };
 
+class ParkingThread : public v8::base::Thread {
+ public:
+  explicit ParkingThread(const Options& options) : v8::base::Thread(options) {}
+
+  V8_INLINE void ParkedJoin(LocalIsolate* local_isolate);
+  V8_INLINE void ParkedJoin(LocalHeap* local_heap);
+
+  void ParkedJoin(const ParkedScope& scope) {
+    USE(scope);
+    Join();
+  }
+
+  template <typename ThreadCollection>
+  static V8_INLINE void ParkedJoinAll(LocalIsolate* local_isolate,
+                                      const ThreadCollection& threads);
+  template <typename ThreadCollection>
+  static V8_INLINE void ParkedJoinAll(LocalHeap* local_heap,
+                                      const ThreadCollection& threads);
+
+  template <typename ThreadCollection>
+  static void ParkedJoinAll(const ParkedScope& scope,
+                            const ThreadCollection& threads) {
+    USE(scope);
+    for (auto& thread : threads) thread->Join();
+  }
+
+ private:
+  using v8::base::Thread::Join;
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/heap/pretenuring-handler-inl.h b/deps/v8/src/heap/pretenuring-handler-inl.h
index 45ac665404a540..5ed6522fd76366 100644
--- a/deps/v8/src/heap/pretenuring-handler-inl.h
+++ b/deps/v8/src/heap/pretenuring-handler-inl.h
@@ -17,38 +17,37 @@ namespace v8 {
 namespace internal {
 
 void PretenuringHandler::UpdateAllocationSite(
-    Map map, HeapObject object, PretenuringFeedbackMap* pretenuring_feedback) {
+    Tagged<Map> map, Tagged<HeapObject> object,
+    PretenuringFeedbackMap* pretenuring_feedback) {
   DCHECK_NE(pretenuring_feedback, &global_pretenuring_feedback_);
 #ifdef DEBUG
   BasicMemoryChunk* chunk = BasicMemoryChunk::FromHeapObject(object);
-  DCHECK_IMPLIES(chunk->IsToPage(),
-                 v8_flags.minor_mc ||
-                     chunk->IsFlagSet(MemoryChunk::PAGE_NEW_NEW_PROMOTION));
-  DCHECK_IMPLIES(!v8_flags.minor_mc && !chunk->InYoungGeneration(),
+  DCHECK_IMPLIES(chunk->IsToPage(), v8_flags.minor_ms);
+  DCHECK_IMPLIES(!v8_flags.minor_ms && !chunk->InYoungGeneration(),
                  chunk->IsFlagSet(MemoryChunk::PAGE_NEW_OLD_PROMOTION));
 #endif
   if (!v8_flags.allocation_site_pretenuring ||
-      !AllocationSite::CanTrack(map.instance_type())) {
+      !AllocationSite::CanTrack(map->instance_type())) {
     return;
   }
-  AllocationMemento memento_candidate =
+  Tagged<AllocationMemento> memento_candidate =
       FindAllocationMemento<kForGC>(map, object);
   if (memento_candidate.is_null()) return;
-  DCHECK(map.IsJSObjectMap());
+  DCHECK(IsJSObjectMap(map));
 
   // Entering cached feedback is used in the parallel case. We are not allowed
   // to dereference the allocation site and rather have to postpone all checks
   // till actually merging the data.
-  Address key = memento_candidate.GetAllocationSiteUnchecked();
+  Address key = memento_candidate->GetAllocationSiteUnchecked();
   (*pretenuring_feedback)[AllocationSite::unchecked_cast(Object(key))]++;
 }
 
 template <PretenuringHandler::FindMementoMode mode>
-AllocationMemento PretenuringHandler::FindAllocationMemento(Map map,
-                                                            HeapObject object) {
+Tagged<AllocationMemento> PretenuringHandler::FindAllocationMemento(
+    Tagged<Map> map, Tagged<HeapObject> object) {
   Address object_address = object.address();
   Address memento_address =
-      object_address + ALIGN_TO_ALLOCATION_ALIGNMENT(object.SizeFromMap(map));
+      object_address + ALIGN_TO_ALLOCATION_ALIGNMENT(object->SizeFromMap(map));
   Address last_memento_word_address = memento_address + kTaggedSize;
   // If the memento would be on another page, bail out immediately.
   if (!Page::OnSamePage(object_address, last_memento_word_address)) {
@@ -61,13 +60,13 @@ AllocationMemento PretenuringHandler::FindAllocationMemento(Map map,
   if (mode != FindMementoMode::kForGC && !object_page->SweepingDone())
     return AllocationMemento();
 
-  HeapObject candidate = HeapObject::FromAddress(memento_address);
-  ObjectSlot candidate_map_slot = candidate.map_slot();
+  Tagged<HeapObject> candidate = HeapObject::FromAddress(memento_address);
+  ObjectSlot candidate_map_slot = candidate->map_slot();
   // This fast check may peek at an uninitialized word. However, the slow check
   // below (memento_address == top) ensures that this is safe. Mark the word as
   // initialized to silence MemorySanitizer warnings.
   MSAN_MEMORY_IS_INITIALIZED(candidate_map_slot.address(), kTaggedSize);
-  if (!candidate_map_slot.contains_map_value(
+  if (!candidate_map_slot.Relaxed_ContainsMapValue(
           ReadOnlyRoots(heap_).allocation_memento_map().ptr())) {
     return AllocationMemento();
   }
@@ -86,7 +85,8 @@ AllocationMemento PretenuringHandler::FindAllocationMemento(Map map,
     }
   }
 
-  AllocationMemento memento_candidate = AllocationMemento::cast(candidate);
+  Tagged<AllocationMemento> memento_candidate =
+      AllocationMemento::cast(candidate);
 
   // Depending on what the memento is used for, we might need to perform
   // additional checks.
@@ -104,7 +104,7 @@ AllocationMemento PretenuringHandler::FindAllocationMemento(Map map,
              memento_address +
                      ALIGN_TO_ALLOCATION_ALIGNMENT(AllocationMemento::kSize) <=
                  top);
-      if ((memento_address != top) && memento_candidate.IsValid()) {
+      if ((memento_address != top) && memento_candidate->IsValid()) {
         return memento_candidate;
       }
       return AllocationMemento();
diff --git a/deps/v8/src/heap/pretenuring-handler.cc b/deps/v8/src/heap/pretenuring-handler.cc
index 3668781f9a96be..4e3ee77773bace 100644
--- a/deps/v8/src/heap/pretenuring-handler.cc
+++ b/deps/v8/src/heap/pretenuring-handler.cc
@@ -8,6 +8,7 @@
 #include "src/execution/isolate.h"
 #include "src/flags/flags.h"
 #include "src/handles/global-handles-inl.h"
+#include "src/heap/gc-tracer-inl.h"
 #include "src/heap/new-spaces.h"
 #include "src/objects/allocation-site-inl.h"
 
@@ -19,93 +20,75 @@ PretenuringHandler::PretenuringHandler(Heap* heap)
 
 PretenuringHandler::~PretenuringHandler() = default;
 
-void PretenuringHandler::MergeAllocationSitePretenuringFeedback(
-    const PretenuringFeedbackMap& local_pretenuring_feedback) {
-  PtrComprCageBase cage_base(heap_->isolate());
-  AllocationSite site;
-  for (auto& site_and_count : local_pretenuring_feedback) {
-    site = site_and_count.first;
-    MapWord map_word = site.map_word(cage_base, kRelaxedLoad);
-    if (map_word.IsForwardingAddress()) {
-      site = AllocationSite::cast(map_word.ToForwardingAddress(site));
-    }
-
-    // We have not validated the allocation site yet, since we have not
-    // dereferenced the site during collecting information.
-    // This is an inlined check of AllocationMemento::IsValid.
-    if (!site.IsAllocationSite() || site.IsZombie()) continue;
+namespace {
 
-    const int value = static_cast<int>(site_and_count.second);
-    DCHECK_LT(0, value);
-    if (site.IncrementMementoFoundCount(value)) {
-      // For sites in the global map the count is accessed through the site.
-      global_pretenuring_feedback_.insert(std::make_pair(site, 0));
-    }
-  }
-}
+static constexpr int kMinMementoCount = 100;
 
-bool PretenuringHandler::DeoptMaybeTenuredAllocationSites() const {
-  NewSpace* new_space = heap_->new_space();
-  if (heap_->tracer()->GetCurrentCollector() ==
-      GarbageCollector::MINOR_MARK_COMPACTOR) {
-    DCHECK(v8_flags.minor_mc);
-    DCHECK_NOT_NULL(new_space);
-    return heap_->IsFirstMaximumSizeMinorGC();
-  }
-  return new_space && new_space->IsAtMaximumCapacity() &&
-         !heap_->MaximumSizeMinorGC();
+double GetPretenuringRatioThreshold(size_t new_space_capacity) {
+  static constexpr double kScavengerPretenureRatio = 0.85;
+  // MinorMS allows for a much larger new space, thus we require a lower
+  // survival rate for pretenuring.
+  static constexpr double kMinorMSPretenureMaxRatio = 0.8;
+  static constexpr double kMinorMSMinCapacity = 16 * MB;
+  if (!v8_flags.minor_ms) return kScavengerPretenureRatio;
+  if (new_space_capacity <= kMinorMSMinCapacity)
+    return kMinorMSPretenureMaxRatio;
+  // When capacity is 64MB, the pretenuring ratio would be 0.2.
+  return kMinorMSPretenureMaxRatio * kMinorMSMinCapacity / new_space_capacity;
 }
 
-namespace {
-
 inline bool MakePretenureDecision(
-    AllocationSite site, AllocationSite::PretenureDecision current_decision,
-    double ratio, bool maximum_size_scavenge) {
+    Tagged<AllocationSite> site,
+    AllocationSite::PretenureDecision current_decision, double ratio,
+    bool new_space_capacity_was_above_pretenuring_threshold,
+    size_t new_space_capacity) {
   // Here we just allow state transitions from undecided or maybe tenure
   // to don't tenure, maybe tenure, or tenure.
   if ((current_decision == AllocationSite::kUndecided ||
        current_decision == AllocationSite::kMaybeTenure)) {
-    if (ratio >= AllocationSite::kPretenureRatio) {
+    if (ratio >= GetPretenuringRatioThreshold(new_space_capacity)) {
       // We just transition into tenure state when the semi-space was at
       // maximum capacity.
-      if (maximum_size_scavenge) {
-        site.set_deopt_dependent_code(true);
-        site.set_pretenure_decision(AllocationSite::kTenure);
+      if (new_space_capacity_was_above_pretenuring_threshold) {
+        site->set_deopt_dependent_code(true);
+        site->set_pretenure_decision(AllocationSite::kTenure);
         // Currently we just need to deopt when we make a state transition to
         // tenure.
         return true;
       }
-      site.set_pretenure_decision(AllocationSite::kMaybeTenure);
+      site->set_pretenure_decision(AllocationSite::kMaybeTenure);
     } else {
-      site.set_pretenure_decision(AllocationSite::kDontTenure);
+      site->set_pretenure_decision(AllocationSite::kDontTenure);
     }
   }
   return false;
 }
 
 // Clear feedback calculation fields until the next gc.
-inline void ResetPretenuringFeedback(AllocationSite site) {
-  site.set_memento_found_count(0);
-  site.set_memento_create_count(0);
+inline void ResetPretenuringFeedback(Tagged<AllocationSite> site) {
+  site->set_memento_found_count(0);
+  site->set_memento_create_count(0);
 }
 
-inline bool DigestPretenuringFeedback(Isolate* isolate, AllocationSite site,
-                                      bool maximum_size_scavenge) {
+inline bool DigestPretenuringFeedback(
+    Isolate* isolate, Tagged<AllocationSite> site,
+    bool new_space_capacity_was_above_pretenuring_threshold,
+    size_t new_space_capacity) {
   bool deopt = false;
-  int create_count = site.memento_create_count();
-  int found_count = site.memento_found_count();
-  bool minimum_mementos_created =
-      create_count >= AllocationSite::kPretenureMinimumCreated;
+  int create_count = site->memento_create_count();
+  int found_count = site->memento_found_count();
+  bool minimum_mementos_created = create_count >= kMinMementoCount;
   double ratio =
       minimum_mementos_created || v8_flags.trace_pretenuring_statistics
           ? static_cast<double>(found_count) / create_count
           : 0.0;
   AllocationSite::PretenureDecision current_decision =
-      site.pretenure_decision();
+      site->pretenure_decision();
 
   if (minimum_mementos_created) {
-    deopt = MakePretenureDecision(site, current_decision, ratio,
-                                  maximum_size_scavenge);
+    deopt = MakePretenureDecision(
+        site, current_decision, ratio,
+        new_space_capacity_was_above_pretenuring_threshold, new_space_capacity);
   }
 
   if (v8_flags.trace_pretenuring_statistics) {
@@ -113,22 +96,23 @@ inline bool DigestPretenuringFeedback(Isolate* isolate, AllocationSite site,
                  "pretenuring: AllocationSite(%p): (created, found, ratio) "
                  "(%d, %d, %f) %s => %s\n",
                  reinterpret_cast<void*>(site.ptr()), create_count, found_count,
-                 ratio, site.PretenureDecisionName(current_decision),
-                 site.PretenureDecisionName(site.pretenure_decision()));
+                 ratio, site->PretenureDecisionName(current_decision),
+                 site->PretenureDecisionName(site->pretenure_decision()));
   }
 
   ResetPretenuringFeedback(site);
   return deopt;
 }
 
-bool PretenureAllocationSiteManually(Isolate* isolate, AllocationSite site) {
+bool PretenureAllocationSiteManually(Isolate* isolate,
+                                     Tagged<AllocationSite> site) {
   AllocationSite::PretenureDecision current_decision =
-      site.pretenure_decision();
+      site->pretenure_decision();
   bool deopt = true;
   if (current_decision == AllocationSite::kUndecided ||
       current_decision == AllocationSite::kMaybeTenure) {
-    site.set_deopt_dependent_code(true);
-    site.set_pretenure_decision(AllocationSite::kTenure);
+    site->set_deopt_dependent_code(true);
+    site->set_pretenure_decision(AllocationSite::kTenure);
   } else {
     deopt = false;
   }
@@ -137,8 +121,8 @@ bool PretenureAllocationSiteManually(Isolate* isolate, AllocationSite site) {
                  "pretenuring manually requested: AllocationSite(%p): "
                  "%s => %s\n",
                  reinterpret_cast<void*>(site.ptr()),
-                 site.PretenureDecisionName(current_decision),
-                 site.PretenureDecisionName(site.pretenure_decision()));
+                 site->PretenureDecisionName(current_decision),
+                 site->PretenureDecisionName(site->pretenure_decision()));
   }
 
   ResetPretenuringFeedback(site);
@@ -147,98 +131,154 @@ bool PretenureAllocationSiteManually(Isolate* isolate, AllocationSite site) {
 
 }  // namespace
 
+// static
+int PretenuringHandler::GetMinMementoCountForTesting() {
+  return kMinMementoCount;
+}
+
+void PretenuringHandler::MergeAllocationSitePretenuringFeedback(
+    const PretenuringFeedbackMap& local_pretenuring_feedback) {
+  PtrComprCageBase cage_base(heap_->isolate());
+  Tagged<AllocationSite> site;
+  for (auto& site_and_count : local_pretenuring_feedback) {
+    site = site_and_count.first;
+    MapWord map_word = site->map_word(cage_base, kRelaxedLoad);
+    if (map_word.IsForwardingAddress()) {
+      site = AllocationSite::cast(map_word.ToForwardingAddress(site));
+    }
+
+    // We have not validated the allocation site yet, since we have not
+    // dereferenced the site during collecting information.
+    // This is an inlined check of AllocationMemento::IsValid.
+    if (!IsAllocationSite(site) || site->IsZombie()) continue;
+
+    const int value = static_cast<int>(site_and_count.second);
+    DCHECK_LT(0, value);
+    if (site->IncrementMementoFoundCount(value) >= kMinMementoCount) {
+      // For sites in the global map the count is accessed through the site.
+      global_pretenuring_feedback_.insert(std::make_pair(site, 0));
+    }
+  }
+}
+
 void PretenuringHandler::RemoveAllocationSitePretenuringFeedback(
-    AllocationSite site) {
+    Tagged<AllocationSite> site) {
   global_pretenuring_feedback_.erase(site);
 }
 
-void PretenuringHandler::ProcessPretenuringFeedback() {
+void PretenuringHandler::ProcessPretenuringFeedback(
+    size_t new_space_capacity_before_gc) {
+  // The minimum new space capacity from which allocation sites can be
+  // pretenured. A too small capacity means frequent GCs. Objects thus don't get
+  // a chance to die before being promoted, which may lead to wrong pretenuring
+  // decisions.
+  static constexpr size_t kDefaultMinNewSpaceCapacityForPretenuring =
+      8192 * KB * Heap::kPointerMultiplier;
+
+  DCHECK(heap_->tracer()->IsInAtomicPause());
+
+  if (!v8_flags.allocation_site_pretenuring) return;
+
+  const size_t min_new_space_capacity_for_pretenuring =
+      std::min(heap_->new_space()->MaximumCapacity(),
+               kDefaultMinNewSpaceCapacityForPretenuring);
+
   bool trigger_deoptimization = false;
-  if (v8_flags.allocation_site_pretenuring) {
-    int tenure_decisions = 0;
-    int dont_tenure_decisions = 0;
-    int allocation_mementos_found = 0;
-    int allocation_sites = 0;
-    int active_allocation_sites = 0;
-
-    AllocationSite site;
-
-    // Step 1: Digest feedback for recorded allocation sites.
-    bool maximum_size_scavenge = heap_->MaximumSizeMinorGC();
-    for (auto& site_and_count : global_pretenuring_feedback_) {
-      allocation_sites++;
-      site = site_and_count.first;
-      // Count is always access through the site.
-      DCHECK_EQ(0, site_and_count.second);
-      int found_count = site.memento_found_count();
-      // An entry in the storage does not imply that the count is > 0 because
-      // allocation sites might have been reset due to too many objects dying
-      // in old space.
-      if (found_count > 0) {
-        DCHECK(site.IsAllocationSite());
-        active_allocation_sites++;
-        allocation_mementos_found += found_count;
-        if (DigestPretenuringFeedback(heap_->isolate(), site,
-                                      maximum_size_scavenge)) {
-          trigger_deoptimization = true;
-        }
-        if (site.GetAllocationType() == AllocationType::kOld) {
-          tenure_decisions++;
-        } else {
-          dont_tenure_decisions++;
-        }
-      }
-    }
+  int tenure_decisions = 0;
+  int dont_tenure_decisions = 0;
+  int allocation_mementos_found = 0;
+  int allocation_sites = 0;
+  int active_allocation_sites = 0;
 
-    // Step 2: Pretenure allocation sites for manual requests.
-    if (allocation_sites_to_pretenure_) {
-      while (!allocation_sites_to_pretenure_->empty()) {
-        auto pretenure_site = allocation_sites_to_pretenure_->Pop();
-        if (PretenureAllocationSiteManually(heap_->isolate(), pretenure_site)) {
-          trigger_deoptimization = true;
-        }
+  Tagged<AllocationSite> site;
+
+  // Step 1: Digest feedback for recorded allocation sites.
+  // This is the pretenuring trigger for allocation sites that are in maybe
+  // tenure state. When we switched to a large enough new space size we
+  // deoptimize the code that belongs to the allocation site and derive the
+  // lifetime of the allocation site.
+  bool new_space_was_above_pretenuring_threshold =
+      new_space_capacity_before_gc >= min_new_space_capacity_for_pretenuring;
+
+  for (auto& site_and_count : global_pretenuring_feedback_) {
+    allocation_sites++;
+    site = site_and_count.first;
+    // Count is always access through the site.
+    DCHECK_EQ(0, site_and_count.second);
+    int found_count = site->memento_found_count();
+    // An entry in the storage does not imply that the count is > 0 because
+    // allocation sites might have been reset due to too many objects dying
+    // in old space.
+    if (found_count > 0) {
+      DCHECK(IsAllocationSite(site));
+      active_allocation_sites++;
+      allocation_mementos_found += found_count;
+      if (DigestPretenuringFeedback(heap_->isolate(), site,
+                                    new_space_was_above_pretenuring_threshold,
+                                    new_space_capacity_before_gc)) {
+        trigger_deoptimization = true;
+      }
+      if (site->GetAllocationType() == AllocationType::kOld) {
+        tenure_decisions++;
+      } else {
+        dont_tenure_decisions++;
       }
-      allocation_sites_to_pretenure_.reset();
     }
+  }
 
-    // Step 3: Deopt maybe tenured allocation sites if necessary.
-    bool deopt_maybe_tenured = DeoptMaybeTenuredAllocationSites();
-    if (deopt_maybe_tenured) {
-      heap_->ForeachAllocationSite(
-          heap_->allocation_sites_list(),
-          [&allocation_sites, &trigger_deoptimization](AllocationSite site) {
-            DCHECK(site.IsAllocationSite());
-            allocation_sites++;
-            if (site.IsMaybeTenure()) {
-              site.set_deopt_dependent_code(true);
-              trigger_deoptimization = true;
-            }
-          });
+  // Step 2: Pretenure allocation sites for manual requests.
+  if (allocation_sites_to_pretenure_) {
+    while (!allocation_sites_to_pretenure_->empty()) {
+      auto pretenure_site = allocation_sites_to_pretenure_->Pop();
+      if (PretenureAllocationSiteManually(heap_->isolate(), pretenure_site)) {
+        trigger_deoptimization = true;
+      }
     }
+    allocation_sites_to_pretenure_.reset();
+  }
 
-    if (trigger_deoptimization) {
-      heap_->isolate()->stack_guard()->RequestDeoptMarkedAllocationSites();
-    }
+  // Step 3: Deopt maybe tenured allocation sites if necessary.
+  // New space capacity was too low for pretenuring but is now above the
+  // threshold. Maybe tenured allocation sites may be pretenured on the next GC.
+  bool deopt_maybe_tenured = (heap_->NewSpaceTargetCapacity() >=
+                              min_new_space_capacity_for_pretenuring) &&
+                             !new_space_was_above_pretenuring_threshold;
+  if (deopt_maybe_tenured) {
+    heap_->ForeachAllocationSite(heap_->allocation_sites_list(),
+                                 [&allocation_sites, &trigger_deoptimization](
+                                     Tagged<AllocationSite> site) {
+                                   DCHECK(IsAllocationSite(site));
+                                   allocation_sites++;
+                                   if (site->IsMaybeTenure()) {
+                                     site->set_deopt_dependent_code(true);
+                                     trigger_deoptimization = true;
+                                   }
+                                 });
+  }
 
-    if (v8_flags.trace_pretenuring_statistics &&
-        (allocation_mementos_found > 0 || tenure_decisions > 0 ||
-         dont_tenure_decisions > 0)) {
-      PrintIsolate(heap_->isolate(),
-                   "pretenuring: deopt_maybe_tenured=%d visited_sites=%d "
-                   "active_sites=%d "
-                   "mementos=%d tenured=%d not_tenured=%d\n",
-                   deopt_maybe_tenured ? 1 : 0, allocation_sites,
-                   active_allocation_sites, allocation_mementos_found,
-                   tenure_decisions, dont_tenure_decisions);
-    }
+  if (trigger_deoptimization) {
+    heap_->isolate()->stack_guard()->RequestDeoptMarkedAllocationSites();
+  }
 
-    global_pretenuring_feedback_.clear();
-    global_pretenuring_feedback_.reserve(kInitialFeedbackCapacity);
+  if (v8_flags.trace_pretenuring_statistics &&
+      (allocation_mementos_found > 0 || tenure_decisions > 0 ||
+       dont_tenure_decisions > 0)) {
+    PrintIsolate(
+        heap_->isolate(),
+        "pretenuring: threshold=%.2f deopt_maybe_tenured=%d visited_sites=%d "
+        "active_sites=%d "
+        "mementos=%d tenured=%d not_tenured=%d\n",
+        GetPretenuringRatioThreshold(new_space_capacity_before_gc),
+        deopt_maybe_tenured ? 1 : 0, allocation_sites, active_allocation_sites,
+        allocation_mementos_found, tenure_decisions, dont_tenure_decisions);
   }
+
+  global_pretenuring_feedback_.clear();
+  global_pretenuring_feedback_.reserve(kInitialFeedbackCapacity);
 }
 
 void PretenuringHandler::PretenureAllocationSiteOnNextCollection(
-    AllocationSite site) {
+    Tagged<AllocationSite> site) {
   if (!allocation_sites_to_pretenure_) {
     allocation_sites_to_pretenure_.reset(
         new GlobalHandleVector<AllocationSite>(heap_));
diff --git a/deps/v8/src/heap/pretenuring-handler.h b/deps/v8/src/heap/pretenuring-handler.h
index 56a23da91f7abb..87a1d4d01ff7a4 100644
--- a/deps/v8/src/heap/pretenuring-handler.h
+++ b/deps/v8/src/heap/pretenuring-handler.h
@@ -20,7 +20,8 @@ class Heap;
 
 class PretenuringHandler final {
  public:
-  static const int kInitialFeedbackCapacity = 256;
+  static constexpr int kInitialFeedbackCapacity = 256;
+
   using PretenuringFeedbackMap =
       std::unordered_map<AllocationSite, size_t, Object::Hasher>;
   enum FindMementoMode { kForRuntime, kForGC };
@@ -33,7 +34,8 @@ class PretenuringHandler final {
   // If an object has an AllocationMemento trailing it, return it, otherwise
   // return a null AllocationMemento.
   template <FindMementoMode mode>
-  inline AllocationMemento FindAllocationMemento(Map map, HeapObject object);
+  inline Tagged<AllocationMemento> FindAllocationMemento(
+      Tagged<Map> map, Tagged<HeapObject> object);
 
   // ===========================================================================
   // Allocation site tracking. =================================================
@@ -42,7 +44,8 @@ class PretenuringHandler final {
   // Updates the AllocationSite of a given {object}. The entry (including the
   // count) is cached on the local pretenuring feedback.
   inline void UpdateAllocationSite(
-      Map map, HeapObject object, PretenuringFeedbackMap* pretenuring_feedback);
+      Tagged<Map> map, Tagged<HeapObject> object,
+      PretenuringFeedbackMap* pretenuring_feedback);
 
   // Merges local pretenuring feedback into the global one. Note that this
   // method needs to be called after evacuation, as allocation sites may be
@@ -54,7 +57,7 @@ class PretenuringHandler final {
   // next collection. Added allocation sites are pretenured independent of
   // their feedback.
   V8_EXPORT_PRIVATE void PretenureAllocationSiteOnNextCollection(
-      AllocationSite site);
+      Tagged<AllocationSite> site);
 
   // ===========================================================================
   // Pretenuring. ==============================================================
@@ -63,18 +66,18 @@ class PretenuringHandler final {
   // Pretenuring decisions are made based on feedback collected during new space
   // evacuation. Note that between feedback collection and calling this method
   // object in old space must not move.
-  void ProcessPretenuringFeedback();
+  void ProcessPretenuringFeedback(size_t new_space_capacity_before_gc);
 
   // Removes an entry from the global pretenuring storage.
-  void RemoveAllocationSitePretenuringFeedback(AllocationSite site);
+  void RemoveAllocationSitePretenuringFeedback(Tagged<AllocationSite> site);
 
   bool HasPretenuringFeedback() const {
     return !global_pretenuring_feedback_.empty();
   }
 
- private:
-  bool DeoptMaybeTenuredAllocationSites() const;
+  V8_EXPORT_PRIVATE static int GetMinMementoCountForTesting();
 
+ private:
   Heap* const heap_;
 
   // The feedback storage is used to store allocation sites (keys) and how often
diff --git a/deps/v8/src/heap/progress-bar.h b/deps/v8/src/heap/progress-bar.h
index b00558b684cec5..b360c36351eeee 100644
--- a/deps/v8/src/heap/progress-bar.h
+++ b/deps/v8/src/heap/progress-bar.h
@@ -25,7 +25,8 @@ namespace internal {
 // can never be disabled again.
 class ProgressBar final {
  public:
-  void Initialize() { value_ = kDisabledSentinel; }
+  ProgressBar() : value_(kDisabledSentinel) {}
+
   void Enable() { value_ = 0; }
   bool IsEnabled() const {
     return value_.load(std::memory_order_acquire) != kDisabledSentinel;
diff --git a/deps/v8/src/heap/read-only-heap-inl.h b/deps/v8/src/heap/read-only-heap-inl.h
index ad027a7a0d1b3d..81d4b73a4842ca 100644
--- a/deps/v8/src/heap/read-only-heap-inl.h
+++ b/deps/v8/src/heap/read-only-heap-inl.h
@@ -13,7 +13,7 @@ namespace v8 {
 namespace internal {
 
 // static
-ReadOnlyRoots ReadOnlyHeap::EarlyGetReadOnlyRoots(HeapObject object) {
+ReadOnlyRoots ReadOnlyHeap::EarlyGetReadOnlyRoots(Tagged<HeapObject> object) {
 #ifdef V8_SHARED_RO_HEAP
   auto* shared_ro_heap = SoleReadOnlyHeap::shared_ro_heap_;
   if (shared_ro_heap && shared_ro_heap->roots_init_complete()) {
@@ -26,7 +26,7 @@ ReadOnlyRoots ReadOnlyHeap::EarlyGetReadOnlyRoots(HeapObject object) {
 }
 
 // static
-ReadOnlyRoots ReadOnlyHeap::GetReadOnlyRoots(HeapObject object) {
+ReadOnlyRoots ReadOnlyHeap::GetReadOnlyRoots(Tagged<HeapObject> object) {
 #ifdef V8_SHARED_RO_HEAP
   auto* shared_ro_heap = SoleReadOnlyHeap::shared_ro_heap_;
   // If this check fails in code that runs during initialization use
diff --git a/deps/v8/src/heap/read-only-heap.cc b/deps/v8/src/heap/read-only-heap.cc
index 9d47c6ccf9401a..d39e5c3c711790 100644
--- a/deps/v8/src/heap/read-only-heap.cc
+++ b/deps/v8/src/heap/read-only-heap.cc
@@ -48,6 +48,12 @@ std::shared_ptr<ReadOnlyArtifacts> InitializeSharedReadOnlyArtifacts() {
 }
 }  // namespace
 
+ReadOnlyHeap::~ReadOnlyHeap() {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  GetProcessWideCodePointerTable()->TearDownSpace(&code_pointer_space_);
+#endif
+}
+
 bool ReadOnlyHeap::IsSharedMemoryAvailable() {
   static bool shared_memory_allocation_supported =
       GetPlatformPageAllocator()->CanAllocateSharedPages();
@@ -76,15 +82,22 @@ void ReadOnlyHeap::SetUp(Isolate* isolate,
       if (!artifacts) {
         artifacts = InitializeSharedReadOnlyArtifacts();
         artifacts->InitializeChecksum(read_only_snapshot_data);
-        ro_heap = CreateInitalHeapForBootstrapping(isolate, artifacts);
+        ro_heap = CreateInitialHeapForBootstrapping(isolate, artifacts);
         ro_heap->DeserializeIntoIsolate(isolate, read_only_snapshot_data,
                                         can_rehash);
+        artifacts->set_initial_next_unique_sfi_id(
+            isolate->next_unique_sfi_id());
         read_only_heap_created = true;
       } else {
         // With pointer compression, there is one ReadOnlyHeap per Isolate.
         // Without PC, there is only one shared between all Isolates.
         ro_heap = artifacts->GetReadOnlyHeapForIsolate(isolate);
         isolate->SetUpFromReadOnlyArtifacts(artifacts, ro_heap);
+#ifdef V8_COMPRESS_POINTERS
+        isolate->external_pointer_table().SetUpFromReadOnlyArtifacts(
+            isolate->heap()->read_only_external_pointer_space(),
+            artifacts.get());
+#endif  // V8_COMPRESS_POINTERS
       }
       artifacts->VerifyChecksum(read_only_snapshot_data,
                                 read_only_heap_created);
@@ -98,7 +111,7 @@ void ReadOnlyHeap::SetUp(Isolate* isolate,
       CHECK(!artifacts);
       artifacts = InitializeSharedReadOnlyArtifacts();
 
-      ro_heap = CreateInitalHeapForBootstrapping(isolate, artifacts);
+      ro_heap = CreateInitialHeapForBootstrapping(isolate, artifacts);
 
       // Ensure the first read-only page ends up first in the cage.
       ro_heap->read_only_space()->EnsurePage();
@@ -118,10 +131,24 @@ void ReadOnlyHeap::DeserializeIntoIsolate(Isolate* isolate,
                                           SnapshotData* read_only_snapshot_data,
                                           bool can_rehash) {
   DCHECK_NOT_NULL(read_only_snapshot_data);
+
   ReadOnlyDeserializer des(isolate, read_only_snapshot_data, can_rehash);
   des.DeserializeIntoIsolate();
   OnCreateRootsComplete(isolate);
+
+#ifdef V8_ENABLE_EXTENSIBLE_RO_SNAPSHOT
+  if (isolate->serializer_enabled()) {
+    // If this isolate will be serialized, leave RO space unfinalized and
+    // allocatable s.t. it can be extended (e.g. by future Context::New calls).
+    // We reach this scenario when creating custom snapshots - these initially
+    // create the isolate from the default V8 snapshot, create new customized
+    // contexts, and finally reserialize.
+  } else {
+    InitFromIsolate(isolate);
+  }
+#else
   InitFromIsolate(isolate);
+#endif  // V8_ENABLE_EXTENSIBLE_RO_SNAPSHOT
 }
 
 void ReadOnlyHeap::OnCreateRootsComplete(Isolate* isolate) {
@@ -133,19 +160,29 @@ void ReadOnlyHeap::OnCreateRootsComplete(Isolate* isolate) {
 
 void ReadOnlyHeap::OnCreateHeapObjectsComplete(Isolate* isolate) {
   DCHECK_NOT_NULL(isolate);
+
+  // InitFromIsolate mutates MemoryChunk flags which would race with any
+  // concurrently-running sweeper tasks. Ensure that sweeping has been
+  // completed, i.e. no sweeper tasks are currently running.
+  isolate->heap()->EnsureSweepingCompleted(
+      Heap::SweepingForcedFinalizationMode::kV8Only);
+
   InitFromIsolate(isolate);
+
+#ifdef VERIFY_HEAP
+  if (v8_flags.verify_heap) HeapVerifier::VerifyReadOnlyHeap(isolate->heap());
+#endif
 }
 
 // Only for compressed spaces
 ReadOnlyHeap::ReadOnlyHeap(ReadOnlyHeap* ro_heap, ReadOnlySpace* ro_space)
-    : read_only_space_(ro_space),
-      read_only_object_cache_(ro_heap->read_only_object_cache_) {
+    : read_only_space_(ro_space) {
   DCHECK(ReadOnlyHeap::IsReadOnlySpaceShared());
   DCHECK(COMPRESS_POINTERS_IN_ISOLATE_CAGE_BOOL);
 }
 
 // static
-ReadOnlyHeap* ReadOnlyHeap::CreateInitalHeapForBootstrapping(
+ReadOnlyHeap* ReadOnlyHeap::CreateInitialHeapForBootstrapping(
     Isolate* isolate, std::shared_ptr<ReadOnlyArtifacts> artifacts) {
   DCHECK(IsReadOnlySpaceShared());
 
@@ -200,6 +237,13 @@ void ReadOnlyHeap::InitFromIsolate(Isolate* isolate) {
   }
 }
 
+ReadOnlyHeap::ReadOnlyHeap(ReadOnlySpace* ro_space)
+    : read_only_space_(ro_space) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  GetProcessWideCodePointerTable()->InitializeSpace(&code_pointer_space_);
+#endif
+}
+
 void ReadOnlyHeap::OnHeapTearDown(Heap* heap) {
   read_only_space_->TearDown(heap->memory_allocator());
   delete read_only_space_;
@@ -238,7 +282,7 @@ bool ReadOnlyHeap::Contains(Address address) {
 }
 
 // static
-bool ReadOnlyHeap::Contains(HeapObject object) {
+bool ReadOnlyHeap::Contains(Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
     return third_party_heap::Heap::InReadOnlySpace(object.address());
   } else {
@@ -246,24 +290,6 @@ bool ReadOnlyHeap::Contains(HeapObject object) {
   }
 }
 
-Object* ReadOnlyHeap::ExtendReadOnlyObjectCache() {
-  read_only_object_cache_.push_back(Smi::zero());
-  return &read_only_object_cache_.back();
-}
-
-Object ReadOnlyHeap::cached_read_only_object(size_t i) const {
-  DCHECK_LE(i, read_only_object_cache_.size());
-  return read_only_object_cache_[i];
-}
-
-bool ReadOnlyHeap::read_only_object_cache_is_initialized() const {
-  return read_only_object_cache_.size() > 0;
-}
-
-size_t ReadOnlyHeap::read_only_object_cache_size() const {
-  return read_only_object_cache_.size();
-}
-
 ReadOnlyHeapObjectIterator::ReadOnlyHeapObjectIterator(
     const ReadOnlyHeap* ro_heap)
     : ReadOnlyHeapObjectIterator(ro_heap->read_only_space()) {}
@@ -271,47 +297,57 @@ ReadOnlyHeapObjectIterator::ReadOnlyHeapObjectIterator(
 ReadOnlyHeapObjectIterator::ReadOnlyHeapObjectIterator(
     const ReadOnlySpace* ro_space)
     : ro_space_(ro_space),
-      current_page_(V8_ENABLE_THIRD_PARTY_HEAP_BOOL
-                        ? std::vector<ReadOnlyPage*>::iterator()
-                        : ro_space->pages().begin()),
-      current_addr_(V8_ENABLE_THIRD_PARTY_HEAP_BOOL
-                        ? Address()
-                        : (*current_page_)->GetAreaStart()) {}
-
-HeapObject ReadOnlyHeapObjectIterator::Next() {
-  if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
-    return HeapObject();  // Unsupported
-  }
+      current_page_(ro_space->pages().begin()),
+      page_iterator_(
+          current_page_ == ro_space->pages().end() ? nullptr : *current_page_) {
+  DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
+}
+
+Tagged<HeapObject> ReadOnlyHeapObjectIterator::Next() {
+  while (current_page_ != ro_space_->pages().end()) {
+    Tagged<HeapObject> obj = page_iterator_.Next();
+    if (!obj.is_null()) return obj;
 
-  if (current_page_ == ro_space_->pages().end()) {
-    return HeapObject();
+    ++current_page_;
+    if (current_page_ == ro_space_->pages().end()) return Tagged<HeapObject>();
+    page_iterator_.Reset(*current_page_);
   }
 
-  ReadOnlyPage* current_page = *current_page_;
+  DCHECK_EQ(current_page_, ro_space_->pages().end());
+  return Tagged<HeapObject>();
+}
+
+ReadOnlyPageObjectIterator::ReadOnlyPageObjectIterator(
+    const ReadOnlyPage* page, SkipFreeSpaceOrFiller skip_free_space_or_filler)
+    : ReadOnlyPageObjectIterator(
+          page, page == nullptr ? kNullAddress : page->GetAreaStart(),
+          skip_free_space_or_filler) {}
+
+ReadOnlyPageObjectIterator::ReadOnlyPageObjectIterator(
+    const ReadOnlyPage* page, Address current_addr,
+    SkipFreeSpaceOrFiller skip_free_space_or_filler)
+    : page_(page),
+      current_addr_(current_addr),
+      skip_free_space_or_filler_(skip_free_space_or_filler) {
+  DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
+  DCHECK_GE(current_addr, page->GetAreaStart());
+  DCHECK_LT(current_addr, page->GetAreaStart() + page->area_size());
+}
+
+Tagged<HeapObject> ReadOnlyPageObjectIterator::Next() {
+  if (page_ == nullptr) return HeapObject();
+
+  Address end = page_->GetAreaStart() + page_->area_size();
   for (;;) {
-    Address end = current_page->address() + current_page->area_size() +
-                  MemoryChunkLayout::ObjectStartOffsetInMemoryChunk(RO_SPACE);
     DCHECK_LE(current_addr_, end);
-    if (current_addr_ == end) {
-      // Progress to the next page.
-      ++current_page_;
-      if (current_page_ == ro_space_->pages().end()) {
-        return HeapObject();
-      }
-      current_page = *current_page_;
-      current_addr_ = current_page->GetAreaStart();
-    }
+    if (current_addr_ == end) return HeapObject();
 
-    if (current_addr_ == ro_space_->top() &&
-        current_addr_ != ro_space_->limit()) {
-      current_addr_ = ro_space_->limit();
-      continue;
-    }
-    HeapObject object = HeapObject::FromAddress(current_addr_);
-    const int object_size = object.Size();
+    Tagged<HeapObject> object = HeapObject::FromAddress(current_addr_);
+    const int object_size = object->Size();
     current_addr_ += ALIGN_TO_ALLOCATION_ALIGNMENT(object_size);
 
-    if (object.IsFreeSpaceOrFiller()) {
+    if (skip_free_space_or_filler_ == SkipFreeSpaceOrFiller::kYes &&
+        IsFreeSpaceOrFiller(object)) {
       continue;
     }
 
@@ -320,5 +356,10 @@ HeapObject ReadOnlyHeapObjectIterator::Next() {
   }
 }
 
+void ReadOnlyPageObjectIterator::Reset(const ReadOnlyPage* page) {
+  page_ = page;
+  current_addr_ = page->GetAreaStart();
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/read-only-heap.h b/deps/v8/src/heap/read-only-heap.h
index 33a6c4a09ee6eb..0906ad8f5d09e8 100644
--- a/deps/v8/src/heap/read-only-heap.h
+++ b/deps/v8/src/heap/read-only-heap.h
@@ -14,6 +14,7 @@
 #include "src/objects/heap-object.h"
 #include "src/objects/objects.h"
 #include "src/roots/roots.h"
+#include "src/sandbox/code-pointer-table.h"
 
 namespace v8 {
 
@@ -37,7 +38,7 @@ class ReadOnlyHeap {
   static constexpr size_t kEntriesCount =
       static_cast<size_t>(RootIndex::kReadOnlyRootsCount);
 
-  virtual ~ReadOnlyHeap() = default;
+  virtual ~ReadOnlyHeap();
 
   ReadOnlyHeap(const ReadOnlyHeap&) = delete;
   ReadOnlyHeap& operator=(const ReadOnlyHeap&) = delete;
@@ -56,7 +57,7 @@ class ReadOnlyHeap {
   // have been created and will not be written to. This should only be called if
   // a deserializer was not previously provided to Setup. When V8_SHARED_RO_HEAP
   // is enabled, this releases the ReadOnlyHeap creation lock.
-  void OnCreateHeapObjectsComplete(Isolate* isolate);
+  V8_EXPORT_PRIVATE void OnCreateHeapObjectsComplete(Isolate* isolate);
   // Indicates that all objects reachable by the read only roots table have been
   // set up.
   void OnCreateRootsComplete(Isolate* isolate);
@@ -71,26 +72,22 @@ class ReadOnlyHeap {
   // Returns whether the address is within the read-only space.
   V8_EXPORT_PRIVATE static bool Contains(Address address);
   // Returns whether the object resides in the read-only space.
-  V8_EXPORT_PRIVATE static bool Contains(HeapObject object);
+  V8_EXPORT_PRIVATE static bool Contains(Tagged<HeapObject> object);
   // Gets read-only roots from an appropriate root list. Shared read only root
   // must be initialized
   V8_EXPORT_PRIVATE inline static ReadOnlyRoots GetReadOnlyRoots(
-      HeapObject object);
+      Tagged<HeapObject> object);
   // Returns the current isolates roots table during initialization as opposed
   // to the shared one in case the latter is not initialized yet.
   V8_EXPORT_PRIVATE inline static ReadOnlyRoots EarlyGetReadOnlyRoots(
-      HeapObject object);
-
-  // Extends the read-only object cache with new zero smi and returns a
-  // reference to it.
-  Object* ExtendReadOnlyObjectCache();
-  // Returns a read-only cache entry at a particular index.
-  Object cached_read_only_object(size_t i) const;
-  bool read_only_object_cache_is_initialized() const;
-  size_t read_only_object_cache_size() const;
+      Tagged<HeapObject> object);
 
   ReadOnlySpace* read_only_space() const { return read_only_space_; }
 
+#ifdef V8_CODE_POINTER_SANDBOXING
+  CodePointerTable::Space* code_pointer_space() { return &code_pointer_space_; }
+#endif
+
   // Returns whether the ReadOnlySpace will actually be shared taking into
   // account whether shared memory is available with pointer compression.
   static constexpr bool IsReadOnlySpaceShared() {
@@ -110,7 +107,7 @@ class ReadOnlyHeap {
 
   // Creates a new read-only heap and attaches it to the provided isolate. Only
   // used the first time when creating a ReadOnlyHeap for sharing.
-  static ReadOnlyHeap* CreateInitalHeapForBootstrapping(
+  static ReadOnlyHeap* CreateInitialHeapForBootstrapping(
       Isolate* isolate, std::shared_ptr<ReadOnlyArtifacts> artifacts);
   // Runs the read-only deserializer and calls InitFromIsolate to complete
   // read-only heap initialization.
@@ -125,13 +122,18 @@ class ReadOnlyHeap {
 
   bool roots_init_complete_ = false;
   ReadOnlySpace* read_only_space_ = nullptr;
-  std::vector<Object> read_only_object_cache_;
+
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // The read-only heap has its own code pointer space. Entries in this space
+  // are never deallocated.
+  CodePointerTable::Space code_pointer_space_;
+#endif  // V8_CODE_POINTER_SANDBOXING
 
   // Returns whether shared memory can be allocated and then remapped to
   // additional addresses.
   static bool IsSharedMemoryAvailable();
 
-  explicit ReadOnlyHeap(ReadOnlySpace* ro_space) : read_only_space_(ro_space) {}
+  explicit ReadOnlyHeap(ReadOnlySpace* ro_space);
   ReadOnlyHeap(ReadOnlyHeap* ro_heap, ReadOnlySpace* ro_space);
 };
 
@@ -152,18 +154,48 @@ class SoleReadOnlyHeap : public ReadOnlyHeap {
   V8_EXPORT_PRIVATE static SoleReadOnlyHeap* shared_ro_heap_;
 };
 
-// This class enables iterating over all read-only heap objects.
-class V8_EXPORT_PRIVATE ReadOnlyHeapObjectIterator {
+enum class SkipFreeSpaceOrFiller {
+  kYes,
+  kNo,
+};
+
+// This class enables iterating over all read-only heap objects on a
+// ReadOnlyPage.
+class V8_EXPORT_PRIVATE ReadOnlyPageObjectIterator final {
+ public:
+  explicit ReadOnlyPageObjectIterator(
+      const ReadOnlyPage* page,
+      SkipFreeSpaceOrFiller skip_free_space_or_filler =
+          SkipFreeSpaceOrFiller::kYes);
+  ReadOnlyPageObjectIterator(const ReadOnlyPage* page, Address current_addr,
+                             SkipFreeSpaceOrFiller skip_free_space_or_filler =
+                                 SkipFreeSpaceOrFiller::kYes);
+
+  Tagged<HeapObject> Next();
+
+ private:
+  void Reset(const ReadOnlyPage* page);
+
+  const ReadOnlyPage* page_;
+  Address current_addr_;
+  const SkipFreeSpaceOrFiller skip_free_space_or_filler_;
+
+  friend class ReadOnlyHeapObjectIterator;
+};
+
+// This class enables iterating over all read-only heap objects in the
+// ReadOnlyHeap/ReadOnlySpace.
+class V8_EXPORT_PRIVATE ReadOnlyHeapObjectIterator final {
  public:
   explicit ReadOnlyHeapObjectIterator(const ReadOnlyHeap* ro_heap);
   explicit ReadOnlyHeapObjectIterator(const ReadOnlySpace* ro_space);
 
-  HeapObject Next();
+  Tagged<HeapObject> Next();
 
  private:
   const ReadOnlySpace* const ro_space_;
   std::vector<ReadOnlyPage*>::const_iterator current_page_;
-  Address current_addr_;
+  ReadOnlyPageObjectIterator page_iterator_;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/read-only-promotion.cc b/deps/v8/src/heap/read-only-promotion.cc
new file mode 100644
index 00000000000000..c9e373d49f1b5b
--- /dev/null
+++ b/deps/v8/src/heap/read-only-promotion.cc
@@ -0,0 +1,537 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/read-only-promotion.h"
+
+#include <unordered_set>
+
+#include "src/common/assert-scope.h"
+#include "src/execution/isolate.h"
+#include "src/heap/combined-heap.h"
+#include "src/heap/heap.h"
+#include "src/objects/heap-object-inl.h"
+#include "src/sandbox/external-pointer-table.h"
+
+namespace v8 {
+namespace internal {
+namespace {
+
+// Convenience aliases:
+using HeapObjectSet =
+    std::unordered_set<HeapObject, Object::Hasher, Object::KeyEqualSafe>;
+using HeapObjectMap = std::unordered_map<Tagged<HeapObject>, Tagged<HeapObject>,
+                                         Object::Hasher, Object::KeyEqualSafe>;
+bool Contains(const HeapObjectSet& s, Tagged<HeapObject> o) {
+  return s.count(o) != 0;
+}
+bool Contains(const HeapObjectMap& s, Tagged<HeapObject> o) {
+  return s.count(o) != 0;
+}
+
+class Committee final {
+ public:
+  static std::vector<HeapObject> DeterminePromotees(
+      Isolate* isolate, const DisallowGarbageCollection& no_gc,
+      const SafepointScope& safepoint_scope) {
+    return Committee(isolate).DeterminePromotees(safepoint_scope);
+  }
+
+ private:
+  explicit Committee(Isolate* isolate) : isolate_(isolate) {}
+
+  std::vector<HeapObject> DeterminePromotees(
+      const SafepointScope& safepoint_scope) {
+    DCHECK(promo_accepted_.empty());
+    DCHECK(promo_rejected_.empty());
+
+    // We assume that a full and precise GC has reclaimed all dead objects
+    // and therefore that no filtering of unreachable objects is required here.
+    HeapObjectIterator it(isolate_->heap(), safepoint_scope);
+    for (Tagged<HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
+      DCHECK(!o.InReadOnlySpace());
+
+      // Note that cycles prevent us from promoting/rejecting each subgraph as
+      // we visit it, since locally we cannot determine whether the deferred
+      // decision on the 'cycle object' will be 'promote' or 'reject'. This
+      // could be solved if necessary (with more complex code), but for now
+      // there are no performance issues.
+      HeapObjectSet accepted_subgraph;  // Either all are accepted or none.
+      HeapObjectSet visited;            // Cycle detection.
+      if (!EvaluateSubgraph(o, &accepted_subgraph, &visited)) continue;
+      if (accepted_subgraph.empty()) continue;
+
+      if (V8_UNLIKELY(v8_flags.trace_read_only_promotion)) {
+        LogAcceptedPromotionSet(accepted_subgraph);
+      }
+      promo_accepted_.insert(accepted_subgraph.begin(),
+                             accepted_subgraph.end());
+    }
+
+    // Return promotees as a sorted list. Note that sorting uses object
+    // addresses; the list order is deterministic only if heap layout
+    // itself is deterministic (see v8_flags.predictable).
+    std::vector<HeapObject> promotees{promo_accepted_.begin(),
+                                      promo_accepted_.end()};
+    std::sort(promotees.begin(), promotees.end(), Object::Comparer());
+
+    return promotees;
+  }
+
+  // Returns `false` if the subgraph rooted at `o` is rejected.
+  // Returns `true` if it is accepted, or if we've reached a cycle and `o`
+  // will be processed further up the callchain.
+  bool EvaluateSubgraph(Tagged<HeapObject> o, HeapObjectSet* accepted_subgraph,
+                        HeapObjectSet* visited) {
+    if (o.InReadOnlySpace()) return true;
+    if (Contains(promo_rejected_, o)) return false;
+    if (Contains(promo_accepted_, o)) return true;
+    if (Contains(*visited, o)) return true;
+    visited->insert(o);
+    if (!IsPromoCandidate(isolate_, o)) {
+      const auto& [it, inserted] = promo_rejected_.insert(o);
+      if (V8_UNLIKELY(v8_flags.trace_read_only_promotion) && inserted) {
+        LogRejectedPromotionForFailedPredicate(o);
+      }
+      return false;
+    }
+    // Recurse into outgoing pointers.
+    CandidateVisitor v(this, accepted_subgraph, visited);
+    o->Iterate(isolate_, &v);
+    if (!v.all_slots_are_promo_candidates()) {
+      const auto& [it, inserted] = promo_rejected_.insert(o);
+      if (V8_UNLIKELY(v8_flags.trace_read_only_promotion) && inserted) {
+        LogRejectedPromotionForInvalidSubgraph(o,
+                                               v.first_rejected_slot_offset());
+      }
+      return false;
+    }
+
+    accepted_subgraph->insert(o);
+    return true;
+  }
+
+#define PROMO_CANDIDATE_TYPE_LIST(V) \
+  V(AccessCheckInfo)                 \
+  V(AccessorInfo)                    \
+  V(CallHandlerInfo)                 \
+  V(Code)                            \
+  V(InterceptorInfo)                 \
+  V(ScopeInfo)                       \
+  V(SharedFunctionInfo)              \
+  V(Symbol)
+  // TODO(jgruber): Don't forget to extend ReadOnlyPromotionImpl::Verify when
+  // adding new object types here.
+
+  static bool IsPromoCandidate(Isolate* isolate, Tagged<HeapObject> o) {
+    const InstanceType itype = o->map(isolate)->instance_type();
+#define V(TYPE)                                            \
+  if (InstanceTypeChecker::Is##TYPE(itype)) {              \
+    return IsPromoCandidate##TYPE(isolate, TYPE::cast(o)); \
+    /* NOLINTNEXTLINE(readability/braces) */               \
+  } else
+    PROMO_CANDIDATE_TYPE_LIST(V)
+    /* if { ... } else */ {
+      return false;
+    }
+#undef V
+    UNREACHABLE();
+  }
+#undef PROMO_CANDIDATE_TYPE_LIST
+
+#define DEF_PROMO_CANDIDATE(Type) \
+  static bool IsPromoCandidate##Type(Isolate* isolate, Type o) { return true; }
+
+  DEF_PROMO_CANDIDATE(AccessCheckInfo)
+  DEF_PROMO_CANDIDATE(AccessorInfo)
+  DEF_PROMO_CANDIDATE(CallHandlerInfo)
+  static bool IsPromoCandidateCode(Isolate* isolate, Tagged<Code> o) {
+    return Builtins::kCodeObjectsAreInROSpace && o->is_builtin();
+  }
+  DEF_PROMO_CANDIDATE(InterceptorInfo)
+  DEF_PROMO_CANDIDATE(ScopeInfo)
+  static bool IsPromoCandidateSharedFunctionInfo(Isolate* isolate,
+                                                 Tagged<SharedFunctionInfo> o) {
+    // Only internal SFIs are guaranteed to remain immutable.
+    if (o->has_script(kAcquireLoad)) return false;
+    // kIllegal is used for js_global_object_function, which is created during
+    // bootstrapping but never rooted. We currently assumed that all objects in
+    // the snapshot are live. But RO space is 1) not GC'd and 2) serialized
+    // verbatim, preserving dead objects. As a workaround, exclude this builtin
+    // id from RO allocation.
+    // TODO(jgruber): A better solution. Remove the liveness assumption (see
+    // test-heap-profiler.cc)? Overwrite dead RO objects with fillers
+    // pre-serialization? Implement a RO GC pass pre-serialization?
+    return o->HasBuiltinId() && o->builtin_id() != Builtin::kIllegal;
+  }
+  DEF_PROMO_CANDIDATE(Symbol)
+
+#undef DEF_PROMO_CANDIDATE
+
+  // Recurses into all tagged slots of an object and tracks whether predicates
+  // failed on any part of the subgraph.
+  class CandidateVisitor : public ObjectVisitor {
+   public:
+    CandidateVisitor(Committee* committee, HeapObjectSet* accepted_subgraph,
+                     HeapObjectSet* visited)
+        : committee_(committee),
+          accepted_subgraph_(accepted_subgraph),
+          visited_(visited) {}
+
+    int first_rejected_slot_offset() const {
+      return first_rejected_slot_offset_;
+    }
+    bool all_slots_are_promo_candidates() const {
+      return first_rejected_slot_offset_ == -1;
+    }
+
+    void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
+                       MaybeObjectSlot end) final {
+      if (!all_slots_are_promo_candidates()) return;
+      for (MaybeObjectSlot slot = start; slot < end; slot++) {
+        MaybeObject maybe_object = slot.load(committee_->isolate_);
+        Tagged<HeapObject> heap_object;
+        if (!maybe_object.GetHeapObject(&heap_object)) continue;
+        if (!committee_->EvaluateSubgraph(heap_object, accepted_subgraph_,
+                                          visited_)) {
+          first_rejected_slot_offset_ =
+              static_cast<int>(slot.address() - host.address());
+          DCHECK_GE(first_rejected_slot_offset_, 0);
+          return;
+        }
+      }
+    }
+    void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                       ObjectSlot end) final {
+      VisitPointers(host, MaybeObjectSlot(start), MaybeObjectSlot(end));
+    }
+    void VisitInstructionStreamPointer(Tagged<Code> host,
+                                       InstructionStreamSlot slot) final {
+      DCHECK(host->is_builtin());
+    }
+    void VisitMapPointer(Tagged<HeapObject> host) final {
+      MaybeObjectSlot slot = host->RawMaybeWeakField(HeapObject::kMapOffset);
+      VisitPointers(host, slot, slot + 1);
+    }
+
+   private:
+    Committee* const committee_;
+    HeapObjectSet* const accepted_subgraph_;
+    HeapObjectSet* const visited_;
+    int first_rejected_slot_offset_ = -1;
+  };
+
+  static void LogAcceptedPromotionSet(const HeapObjectSet& os) {
+    std::cout << "ro-promotion: accepted set {";
+    for (Tagged<HeapObject> o : os) {
+      std::cout << reinterpret_cast<void*>(o.ptr()) << ", ";
+    }
+    std::cout << "}\n";
+  }
+
+  static void LogRejectedPromotionForFailedPredicate(Tagged<HeapObject> o) {
+    std::cout << "ro-promotion: rejected due to failed predicate "
+              << reinterpret_cast<void*>(o.ptr()) << " ("
+              << o->map()->instance_type() << ")"
+              << "\n";
+  }
+
+  void LogRejectedPromotionForInvalidSubgraph(Tagged<HeapObject> o,
+                                              int first_rejected_slot_offset) {
+    std::cout << "ro-promotion: rejected due to rejected subgraph "
+              << reinterpret_cast<void*>(o.ptr()) << " ("
+              << o->map()->instance_type() << ")"
+              << " at slot offset " << first_rejected_slot_offset << " ";
+
+    MaybeObjectSlot slot = o->RawMaybeWeakField(first_rejected_slot_offset);
+    MaybeObject maybe_object = slot.load(isolate_);
+    Tagged<HeapObject> heap_object;
+    if (maybe_object.GetHeapObject(&heap_object)) {
+      std::cout << reinterpret_cast<void*>(heap_object.ptr()) << " ("
+                << heap_object->map()->instance_type() << ")"
+                << "\n";
+    } else {
+      std::cout << "<cleared weak object>\n";
+    }
+  }
+
+  Isolate* const isolate_;
+  HeapObjectSet promo_accepted_;
+  HeapObjectSet promo_rejected_;
+};
+
+class ReadOnlyPromotionImpl final : public AllStatic {
+ public:
+  static void CopyToReadOnlyHeap(Isolate* isolate,
+                                 const std::vector<HeapObject>& promotees,
+                                 HeapObjectMap* moves) {
+    ReadOnlySpace* rospace = isolate->heap()->read_only_space();
+    for (Tagged<HeapObject> src : promotees) {
+      const int size = src->Size(isolate);
+      Tagged<HeapObject> dst =
+          rospace->AllocateRaw(size, kTaggedAligned).ToObjectChecked();
+      Heap::CopyBlock(dst.address(), src.address(), size);
+      moves->emplace(src, dst);
+    }
+  }
+
+  static void UpdatePointers(Isolate* isolate,
+                             const SafepointScope& safepoint_scope,
+                             const HeapObjectMap& moves) {
+    Heap* heap = isolate->heap();
+#ifdef V8_COMPRESS_POINTERS
+    ExternalPointerTable::UnsealReadOnlySegmentScope unseal_scope(
+        &isolate->external_pointer_table());
+#endif  // V8_COMPRESS_POINTERS
+    UpdatePointersVisitor v(isolate, &moves);
+
+    // Iterate all roots.
+    EmbedderStackStateScope stack_scope(
+        isolate->heap(), EmbedderStackStateScope::kExplicitInvocation,
+        StackState::kNoHeapPointers);
+    heap->IterateRoots(&v, base::EnumSet<SkipRoot>{});
+
+    // Iterate all objects on the mutable heap.
+    // We assume that a full and precise GC has reclaimed all dead objects
+    // and therefore that no filtering of unreachable objects is required here.
+    HeapObjectIterator it(heap, safepoint_scope);
+    for (Tagged<HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
+      o->Iterate(isolate, &v);
+    }
+
+    // Iterate all objects we just copied into RO space.
+    for (auto [src, dst] : moves) {
+      dst->Iterate(isolate, &v);
+    }
+  }
+
+  static void Verify(Isolate* isolate, const SafepointScope& safepoint_scope) {
+#ifdef DEBUG
+    // Verify that certain objects were promoted as expected.
+    //
+    // Known objects.
+    Heap* heap = isolate->heap();
+    CHECK(heap->promise_all_resolve_element_shared_fun().InReadOnlySpace());
+    // TODO(jgruber): Extend here with more objects as they are added to
+    // the promotion algorithm.
+
+    // Builtin Code objects.
+    if (Builtins::kCodeObjectsAreInROSpace) {
+      Builtins* builtins = isolate->builtins();
+      for (int i = 0; i < Builtins::kBuiltinCount; i++) {
+        CHECK(builtins->code(static_cast<Builtin>(i)).InReadOnlySpace());
+      }
+    }
+#endif  // DEBUG
+  }
+
+ private:
+  class UpdatePointersVisitor final : public ObjectVisitor, public RootVisitor {
+   public:
+    UpdatePointersVisitor(Isolate* isolate, const HeapObjectMap* moves)
+        : isolate_(isolate), moves_(moves) {
+      for (auto [src, dst] : *moves_) {
+        moves_reverse_lookup_.emplace(dst, src);
+      }
+    }
+
+    // The RootVisitor interface.
+    void VisitRootPointers(Root root, const char* description,
+                           FullObjectSlot start, FullObjectSlot end) final {
+      for (FullObjectSlot slot = start; slot < end; slot++) {
+        ProcessSlot(root, slot);
+      }
+    }
+
+    // The ObjectVisitor interface.
+    void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
+                       MaybeObjectSlot end) final {
+      for (MaybeObjectSlot slot = start; slot < end; slot++) {
+        ProcessSlot(host, slot);
+      }
+    }
+    void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                       ObjectSlot end) final {
+      VisitPointers(host, MaybeObjectSlot(start), MaybeObjectSlot(end));
+    }
+    void VisitInstructionStreamPointer(Tagged<Code> host,
+                                       InstructionStreamSlot slot) final {
+      // InstructionStream objects never move to RO space.
+    }
+    void VisitMapPointer(Tagged<HeapObject> host) final {
+      ProcessSlot(host, host->RawMaybeWeakField(HeapObject::kMapOffset));
+    }
+    void VisitExternalPointer(Tagged<HeapObject> host, ExternalPointerSlot slot,
+                              ExternalPointerTag tag) final {
+#ifdef V8_ENABLE_SANDBOX
+      auto it = moves_reverse_lookup_.find(host);
+      if (it == moves_reverse_lookup_.end()) return;
+
+      // If we reach here, `host` is a moved object with external pointer slots
+      // located in RO space. To preserve the 1:1 relation between slots and
+      // table entries, allocate a new entry (in
+      // read_only_external_pointer_space) now.
+      RecordProcessedSlotIfDebug(slot.address());
+      Address slot_value = slot.load(isolate_, tag);
+      slot.init(isolate_, slot_value, tag);
+
+      if (V8_UNLIKELY(v8_flags.trace_read_only_promotion_verbose)) {
+        LogUpdatedExternalPointerTableEntry(host, slot, slot_value);
+      }
+#endif  // V8_ENABLE_SANDBOX
+    }
+    void VisitIndirectPointer(Tagged<HeapObject> host, IndirectPointerSlot slot,
+                              IndirectPointerMode mode) final {}
+    void VisitIndirectPointerTableEntry(Tagged<HeapObject> host,
+                                        IndirectPointerSlot slot) final {
+#ifdef V8_CODE_POINTER_SANDBOXING
+      // When an object owning an indirect pointer table entry is relocated, it
+      // needs to update the entry to point to its new location. Currently, only
+      // Code objects are referenced through indirect pointers, and they use the
+      // code pointer table.
+      CHECK(IsCode(host));
+
+      // Due to the way we handle baseline code during serialization (we
+      // manually skip over them), we may encounter such live Code objects in
+      // mutable space during iteration. Do a lookup to make sure we only
+      // update CPT entries for moved objects.
+      auto it = moves_reverse_lookup_.find(host);
+      if (it == moves_reverse_lookup_.end()) return;
+
+      // If we reach here, `host` is a moved Code object located in RO space.
+      CHECK(host.InReadOnlySpace());
+      RecordProcessedSlotIfDebug(slot.address());
+
+      Tagged<Code> dead_code = Code::cast(it->second);
+      CHECK(IsCode(dead_code));
+      CHECK(!dead_code.InReadOnlySpace());
+
+      IndirectPointerHandle handle = slot.Relaxed_LoadHandle();
+      CodePointerTable* cpt = GetProcessWideCodePointerTable();
+      CHECK_EQ(dead_code, Object(cpt->GetCodeObject(handle)));
+
+      // The old Code object (in mutable space) is dead. To preserve the 1:1
+      // relation between Code objects and CPT entries, overwrite it immediately
+      // with the filler object.
+      isolate_->heap()->CreateFillerObjectAt(dead_code.address(), Code::kSize);
+
+      // Update the CPT entry to point at the moved RO Code object.
+      cpt->SetCodeObject(handle, host.ptr());
+
+      if (V8_UNLIKELY(v8_flags.trace_read_only_promotion_verbose)) {
+        LogUpdatedCodePointerTableEntry(host, slot, dead_code);
+      }
+#else
+      UNREACHABLE();
+#endif
+    }
+    void VisitRootPointers(Root root, const char* description,
+                           OffHeapObjectSlot start,
+                           OffHeapObjectSlot end) override {
+      // We shouldn't have moved any string table contents (which is what
+      // OffHeapObjectSlot currently refers to).
+      for (OffHeapObjectSlot slot = start; slot < end; slot++) {
+        Object o = slot.load(isolate_);
+        if (!IsHeapObject(o)) continue;
+        CHECK(!Contains(*moves_, HeapObject::cast(o)));
+      }
+    }
+
+   private:
+    void ProcessSlot(Root root, FullObjectSlot slot) {
+      Tagged<Object> old_slot_value_obj = slot.load(isolate_);
+      if (!IsHeapObject(old_slot_value_obj)) return;
+      Tagged<HeapObject> old_slot_value = HeapObject::cast(old_slot_value_obj);
+      auto it = moves_->find(old_slot_value);
+      if (it == moves_->end()) return;
+      Tagged<HeapObject> new_slot_value = it->second;
+      slot.store(new_slot_value);
+      if (V8_UNLIKELY(v8_flags.trace_read_only_promotion_verbose)) {
+        LogUpdatedPointer(root, slot, old_slot_value, new_slot_value);
+      }
+    }
+    void ProcessSlot(Tagged<HeapObject> host, MaybeObjectSlot slot) {
+      Tagged<HeapObject> old_slot_value;
+      if (!slot.load(isolate_).GetHeapObject(&old_slot_value)) return;
+      auto it = moves_->find(old_slot_value);
+      if (it == moves_->end()) return;
+      Tagged<HeapObject> new_slot_value = it->second;
+      slot.store(MaybeObject::FromObject(new_slot_value));
+      if (V8_UNLIKELY(v8_flags.trace_read_only_promotion_verbose)) {
+        LogUpdatedPointer(host, slot, old_slot_value, new_slot_value);
+      }
+    }
+
+    void LogUpdatedPointer(Root root, FullObjectSlot slot,
+                           Tagged<HeapObject> old_slot_value,
+                           Tagged<HeapObject> new_slot_value) {
+      std::cout << "ro-promotion: updated pointer {root "
+                << static_cast<int>(root) << " slot "
+                << reinterpret_cast<void*>(slot.address()) << " from "
+                << reinterpret_cast<void*>(old_slot_value.ptr()) << " to "
+                << reinterpret_cast<void*>(new_slot_value.ptr()) << "}\n";
+    }
+    void LogUpdatedPointer(Tagged<HeapObject> host, MaybeObjectSlot slot,
+                           Tagged<HeapObject> old_slot_value,
+                           Tagged<HeapObject> new_slot_value) {
+      std::cout << "ro-promotion: updated pointer {host "
+                << reinterpret_cast<void*>(host.address()) << " slot "
+                << reinterpret_cast<void*>(slot.address()) << " from "
+                << reinterpret_cast<void*>(old_slot_value.ptr()) << " to "
+                << reinterpret_cast<void*>(new_slot_value.ptr()) << "}\n";
+    }
+    void LogUpdatedExternalPointerTableEntry(Tagged<HeapObject> host,
+                                             ExternalPointerSlot slot,
+                                             Address slot_value) {
+      std::cout << "ro-promotion: updated external pointer slot {host "
+                << reinterpret_cast<void*>(host.address()) << " slot "
+                << reinterpret_cast<void*>(slot.address()) << " slot_value "
+                << reinterpret_cast<void*>(slot_value) << "}\n";
+    }
+    void LogUpdatedCodePointerTableEntry(Tagged<HeapObject> host,
+                                         IndirectPointerSlot slot,
+                                         Tagged<Code> old_code_object) {
+      std::cout << "ro-promotion: updated code pointer table entry {host "
+                << reinterpret_cast<void*>(host.address()) << " slot "
+                << reinterpret_cast<void*>(slot.address()) << " from "
+                << reinterpret_cast<void*>(old_code_object.ptr()) << "}\n";
+    }
+
+#ifdef DEBUG
+    void RecordProcessedSlotIfDebug(Address slot_address) {
+      // If this fails, we're visiting some object multiple times by accident.
+      CHECK_EQ(processed_slots_.count(slot_address), 0);
+      processed_slots_.insert(slot_address);
+    }
+    std::unordered_set<Address> processed_slots_;  // To avoid dupe processing.
+#else
+    void RecordProcessedSlotIfDebug(Address slot_address) const {}
+#endif  // DEBUG
+
+    Isolate* const isolate_;
+    const HeapObjectMap* moves_;
+    HeapObjectMap moves_reverse_lookup_;
+  };
+};
+
+}  // namespace
+
+// static
+void ReadOnlyPromotion::Promote(Isolate* isolate,
+                                const SafepointScope& safepoint_scope,
+                                const DisallowGarbageCollection& no_gc) {
+  // Visit the mutable heap and determine the set of objects that can be
+  // promoted to RO space.
+  std::vector<HeapObject> promotees =
+      Committee::DeterminePromotees(isolate, no_gc, safepoint_scope);
+  // Physically copy promotee objects to RO space and track all object moves.
+  HeapObjectMap moves;
+  ReadOnlyPromotionImpl::CopyToReadOnlyHeap(isolate, promotees, &moves);
+  // Update all references to moved objects to point at their new location in
+  // RO space.
+  ReadOnlyPromotionImpl::UpdatePointers(isolate, safepoint_scope, moves);
+  ReadOnlyPromotionImpl::Verify(isolate, safepoint_scope);
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/heap/read-only-promotion.h b/deps/v8/src/heap/read-only-promotion.h
new file mode 100644
index 00000000000000..8956da23e6a8c1
--- /dev/null
+++ b/deps/v8/src/heap/read-only-promotion.h
@@ -0,0 +1,27 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_READ_ONLY_PROMOTION_H_
+#define V8_HEAP_READ_ONLY_PROMOTION_H_
+
+#include "src/common/assert-scope.h"
+#include "src/common/globals.h"
+
+namespace v8 {
+namespace internal {
+
+class Isolate;
+class SafepointScope;
+
+class ReadOnlyPromotion final : public AllStatic {
+ public:
+  V8_EXPORT_PRIVATE static void Promote(Isolate* isolate,
+                                        const SafepointScope& safepoint_scope,
+                                        const DisallowGarbageCollection& no_gc);
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_READ_ONLY_PROMOTION_H_
diff --git a/deps/v8/src/heap/read-only-spaces.cc b/deps/v8/src/heap/read-only-spaces.cc
index 869668245aa989..5526988963aa27 100644
--- a/deps/v8/src/heap/read-only-spaces.cc
+++ b/deps/v8/src/heap/read-only-spaces.cc
@@ -178,25 +178,7 @@ ReadOnlyHeap* PointerCompressedReadOnlyArtifacts::GetReadOnlyHeapForIsolate(
     Isolate* isolate) {
   DCHECK(ReadOnlyHeap::IsReadOnlySpaceShared());
   InitializeRootsIn(isolate);
-
-  SharedReadOnlySpace* shared_read_only_space = CreateReadOnlySpace(isolate);
-  ReadOnlyHeap* read_only_heap = new ReadOnlyHeap(shared_read_only_space);
-
-  // TODO(v8:10699): The cache should just live uncompressed in
-  // ReadOnlyArtifacts and be decompressed on the fly.
-  auto original_cache = read_only_heap_->read_only_object_cache_;
-  auto& cache = read_only_heap->read_only_object_cache_;
-  Address isolate_root = isolate->isolate_root();
-  for (Object original_object : original_cache) {
-    Address original_address = original_object.ptr();
-    Address new_address =
-        isolate_root +
-        V8HeapCompressionScheme::CompressObject(original_address);
-    Object new_object = Object(new_address);
-    cache.push_back(new_object);
-  }
-
-  return read_only_heap;
+  return new ReadOnlyHeap(CreateReadOnlySpace(isolate));
 }
 
 std::unique_ptr<::v8::PageAllocator::SharedMemoryMapping>
@@ -431,17 +413,17 @@ class ReadOnlySpaceObjectIterator : public ObjectIterator {
   // Advance to the next object, skipping free spaces and other fillers and
   // skipping the special garbage section of which there is one per space.
   // Returns a null object when the iteration has ended.
-  HeapObject Next() override {
+  Tagged<HeapObject> Next() override {
     while (cur_addr_ != cur_end_) {
       if (cur_addr_ == space_->top() && cur_addr_ != space_->limit()) {
         cur_addr_ = space_->limit();
         continue;
       }
-      HeapObject obj = HeapObject::FromAddress(cur_addr_);
-      const int obj_size = obj.Size();
+      Tagged<HeapObject> obj = HeapObject::FromAddress(cur_addr_);
+      const int obj_size = obj->Size();
       cur_addr_ += ALIGN_TO_ALLOCATION_ALIGNMENT(obj_size);
       DCHECK_LE(cur_addr_, cur_end_);
-      if (!obj.IsFreeSpaceOrFiller()) {
+      if (!IsFreeSpaceOrFiller(obj)) {
         DCHECK_OBJECT_SIZE(obj_size);
         return obj;
       }
@@ -476,13 +458,14 @@ void ReadOnlySpace::Verify(Isolate* isolate,
     Address end_of_previous_object = page->area_start();
     Address top = page->area_end();
 
-    for (HeapObject object = it.Next(); !object.is_null(); object = it.Next()) {
+    for (Tagged<HeapObject> object = it.Next(); !object.is_null();
+         object = it.Next()) {
       CHECK(end_of_previous_object <= object.address());
 
       visitor->VerifyObject(object);
 
       // All the interior pointers should be contained in the heap.
-      int size = object.Size();
+      int size = object->Size();
       CHECK(object.address() + size <= top);
       end_of_previous_object = object.address() + size;
     }
@@ -504,9 +487,10 @@ void ReadOnlySpace::VerifyCounters(Heap* heap) const {
     total_capacity += page->area_size();
     ReadOnlySpaceObjectIterator it(heap, this, page);
     size_t real_allocated = 0;
-    for (HeapObject object = it.Next(); !object.is_null(); object = it.Next()) {
-      if (!object.IsFreeSpaceOrFiller()) {
-        real_allocated += object.Size();
+    for (Tagged<HeapObject> object = it.Next(); !object.is_null();
+         object = it.Next()) {
+      if (!IsFreeSpaceOrFiller(object)) {
+        real_allocated += object->Size();
       }
     }
     total_allocated += page->allocated_bytes();
@@ -580,10 +564,9 @@ void ReadOnlySpace::EnsureSpaceForAllocation(int size_in_bytes) {
 
   top_ = chunk->area_start();
   limit_ = chunk->area_end();
-  return;
 }
 
-HeapObject ReadOnlySpace::TryAllocateLinearlyAligned(
+Tagged<HeapObject> ReadOnlySpace::TryAllocateLinearlyAligned(
     int size_in_bytes, AllocationAlignment alignment) {
   size_in_bytes = ALIGN_TO_ALLOCATION_ALIGNMENT(size_in_bytes);
   Address current_top = top_;
@@ -614,7 +597,8 @@ AllocationResult ReadOnlySpace::AllocateRawAligned(
   size_in_bytes = ALIGN_TO_ALLOCATION_ALIGNMENT(size_in_bytes);
   int allocation_size = size_in_bytes;
 
-  HeapObject object = TryAllocateLinearlyAligned(allocation_size, alignment);
+  Tagged<HeapObject> object =
+      TryAllocateLinearlyAligned(allocation_size, alignment);
   if (object.is_null()) {
     // We don't know exactly how much filler we need to align until space is
     // allocated, so assume the worst case.
@@ -637,7 +621,7 @@ AllocationResult ReadOnlySpace::AllocateRawUnaligned(int size_in_bytes) {
   Address new_top = current_top + size_in_bytes;
   DCHECK_LE(new_top, limit_);
   top_ = new_top;
-  HeapObject object = HeapObject::FromAddress(current_top);
+  Tagged<HeapObject> object = HeapObject::FromAddress(current_top);
 
   DCHECK(!object.is_null());
   MSAN_ALLOCATED_UNINITIALIZED_MEMORY(object.address(), size_in_bytes);
@@ -660,10 +644,10 @@ AllocationResult ReadOnlySpace::AllocateRaw(int size_in_bytes,
 size_t ReadOnlyPage::ShrinkToHighWaterMark() {
   // Shrink pages to high water mark. The water mark points either to a filler
   // or the area_end.
-  HeapObject filler = HeapObject::FromAddress(HighWaterMark());
+  Tagged<HeapObject> filler = HeapObject::FromAddress(HighWaterMark());
   if (filler.address() == area_end()) return 0;
-  CHECK(filler.IsFreeSpaceOrFiller());
-  DCHECK_EQ(filler.address() + filler.Size(), area_end());
+  CHECK(IsFreeSpaceOrFiller(filler));
+  DCHECK_EQ(filler.address() + filler->Size(), area_end());
 
   size_t unused = RoundDown(static_cast<size_t>(area_end() - filler.address()),
                             MemoryAllocator::GetCommitPageSize());
@@ -681,8 +665,8 @@ size_t ReadOnlyPage::ShrinkToHighWaterMark() {
     heap()->memory_allocator()->PartialFreeMemory(
         this, address() + size() - unused, unused, area_end() - unused);
     if (filler.address() != area_end()) {
-      CHECK(filler.IsFreeSpaceOrFiller());
-      CHECK_EQ(filler.address() + filler.Size(), area_end());
+      CHECK(IsFreeSpaceOrFiller(filler));
+      CHECK_EQ(filler.address() + filler->Size(), area_end());
     }
   }
   return unused;
@@ -748,44 +732,48 @@ SharedReadOnlySpace::SharedReadOnlySpace(Heap* heap,
   pages_ = artifacts->pages();
 }
 
-void ReadOnlySpace::InitFromMemoryDump(Isolate* isolate,
-                                       SnapshotByteSource* in) {
-  size_t num_pages = in->GetInt();
-  auto cage = isolate->GetPtrComprCage();
-
-  CHECK_LT(num_pages, 10);
-
-  auto first_page = cage->base() + in->GetInt();
-
-  for (size_t i = 0; i < num_pages; ++i) {
-    int size = in->GetInt();
-    ReadOnlyPage* chunk;
-    if (i == 0) {
-      chunk =
-          heap()->memory_allocator()->AllocateReadOnlyPage(this, first_page);
-      // If this fails we probably allocated r/o space too late.
-      CHECK_EQ(reinterpret_cast<void*>(first_page), chunk);
-    } else {
-      chunk = heap()->memory_allocator()->AllocateReadOnlyPage(this);
-    }
-
-    capacity_ += AreaSize();
-
-    AccountCommitted(chunk->size());
-    CHECK_NOT_NULL(chunk);
-
-    CHECK_LE(chunk->area_start() + size, chunk->area_end());
-    in->CopyRaw(reinterpret_cast<void*>(chunk->area_start()), size);
-    chunk->IncreaseAllocatedBytes(size);
-    chunk->high_water_mark_ = (chunk->area_start() - chunk->address()) + size;
+size_t ReadOnlySpace::IndexOf(const BasicMemoryChunk* chunk) const {
+  for (size_t i = 0; i < pages_.size(); i++) {
+    if (chunk == pages_[i]) return i;
+  }
+  UNREACHABLE();
+}
 
-    DCHECK_NE(chunk->allocated_bytes(), 0);
-    accounting_stats_.IncreaseCapacity(chunk->area_size());
-    accounting_stats_.IncreaseAllocatedBytes(chunk->allocated_bytes(), chunk);
-    pages_.push_back(chunk);
+size_t ReadOnlySpace::AllocateNextPage() {
+  ReadOnlyPage* page = heap_->memory_allocator()->AllocateReadOnlyPage(this);
+  capacity_ += AreaSize();
+  AccountCommitted(page->size());
+  pages_.push_back(page);
+  return pages_.size() - 1;
+}
 
-    top_ = chunk->area_start() + size;
-    limit_ = chunk->area_end();
+size_t ReadOnlySpace::AllocateNextPageAt(Address pos) {
+  ReadOnlyPage* page =
+      heap_->memory_allocator()->AllocateReadOnlyPage(this, pos);
+  // If this fails we probably allocated r/o space too late.
+  CHECK_EQ(reinterpret_cast<void*>(pos), page);
+  capacity_ += AreaSize();
+  AccountCommitted(page->size());
+  pages_.push_back(page);
+  return pages_.size() - 1;
+}
+
+void ReadOnlySpace::InitializePageForDeserialization(
+    ReadOnlyPage* page, size_t area_size_in_bytes) {
+  page->IncreaseAllocatedBytes(area_size_in_bytes);
+  limit_ = top_ = page->area_start() + area_size_in_bytes;
+  page->high_water_mark_ = top_ - page->address();
+}
+
+void ReadOnlySpace::FinalizeSpaceForDeserialization() {
+  // The ReadOnlyRoots table is now initialized. Create fillers, shrink pages,
+  // and update accounting stats.
+  for (ReadOnlyPage* page : pages_) {
+    Address top = page->address() + page->high_water_mark_;
+    heap()->CreateFillerObjectAt(top, static_cast<int>(page->area_end() - top));
+    page->ShrinkToHighWaterMark();
+    accounting_stats_.IncreaseCapacity(page->area_size());
+    accounting_stats_.IncreaseAllocatedBytes(page->allocated_bytes(), page);
   }
 }
 
diff --git a/deps/v8/src/heap/read-only-spaces.h b/deps/v8/src/heap/read-only-spaces.h
index 1f52b5fa4dd5b1..61fa11e0f92eab 100644
--- a/deps/v8/src/heap/read-only-spaces.h
+++ b/deps/v8/src/heap/read-only-spaces.h
@@ -106,6 +106,31 @@ class ReadOnlyArtifacts {
   void set_read_only_heap(std::unique_ptr<ReadOnlyHeap> read_only_heap);
   ReadOnlyHeap* read_only_heap() const { return read_only_heap_.get(); }
 
+  void set_initial_next_unique_sfi_id(uint32_t id) {
+    initial_next_unique_sfi_id_ = id;
+  }
+  uint32_t initial_next_unique_sfi_id() const {
+    return initial_next_unique_sfi_id_;
+  }
+
+  struct ExternalPointerRegistryEntry {
+    ExternalPointerRegistryEntry(ExternalPointerHandle handle, Address value,
+                                 ExternalPointerTag tag)
+        : handle(handle), value(value), tag(tag) {}
+    ExternalPointerHandle handle;
+    Address value;
+    ExternalPointerTag tag;
+  };
+  void set_external_pointer_registry(
+      std::vector<ExternalPointerRegistryEntry>&& registry) {
+    DCHECK(external_pointer_registry_.empty());
+    external_pointer_registry_ = std::move(registry);
+  }
+  const std::vector<ExternalPointerRegistryEntry>& external_pointer_registry()
+      const {
+    return external_pointer_registry_;
+  }
+
   void InitializeChecksum(SnapshotData* read_only_snapshot_data);
   void VerifyChecksum(SnapshotData* read_only_snapshot_data,
                       bool read_only_heap_created);
@@ -117,6 +142,8 @@ class ReadOnlyArtifacts {
   AllocationStats stats_;
   std::unique_ptr<SharedReadOnlySpace> shared_read_only_space_;
   std::unique_ptr<ReadOnlyHeap> read_only_heap_;
+  uint32_t initial_next_unique_sfi_id_ = 0;
+  std::vector<ExternalPointerRegistryEntry> external_pointer_registry_;
 #ifdef DEBUG
   // The checksum of the blob the read-only heap was deserialized from, if
   // any.
@@ -191,7 +218,7 @@ class ReadOnlySpace : public BaseSpace {
   bool writable() const { return !is_marked_read_only_; }
 
   bool Contains(Address a) = delete;
-  bool Contains(Object o) = delete;
+  bool Contains(Tagged<Object> o) = delete;
 
   V8_EXPORT_PRIVATE
   AllocationResult AllocateRaw(int size_in_bytes,
@@ -222,6 +249,9 @@ class ReadOnlySpace : public BaseSpace {
   Address limit() const { return limit_; }
   size_t Capacity() const { return capacity_; }
 
+  // Returns the index within pages_. The chunk must be part of this space.
+  size_t IndexOf(const BasicMemoryChunk* chunk) const;
+
   bool ContainsSlow(Address addr) const;
   V8_EXPORT_PRIVATE void ShrinkPages();
 #ifdef VERIFY_HEAP
@@ -236,8 +266,6 @@ class ReadOnlySpace : public BaseSpace {
 
   Address FirstPageAddress() const { return pages_.front()->address(); }
 
-  void InitFromMemoryDump(Isolate* isolate, SnapshotByteSource* source);
-
   // Ensure the read only space has at least one allocated page
   void EnsurePage();
 
@@ -266,9 +294,16 @@ class ReadOnlySpace : public BaseSpace {
   AllocationResult AllocateRawUnaligned(int size_in_bytes);
   AllocationResult AllocateRawAligned(int size_in_bytes,
                                       AllocationAlignment alignment);
+  Tagged<HeapObject> TryAllocateLinearlyAligned(int size_in_bytes,
+                                                AllocationAlignment alignment);
+
+  // Return the index within pages_ of the newly allocated page.
+  size_t AllocateNextPage();
+  size_t AllocateNextPageAt(Address pos);
+  void InitializePageForDeserialization(ReadOnlyPage* page,
+                                        size_t area_size_in_bytes);
+  void FinalizeSpaceForDeserialization();
 
-  HeapObject TryAllocateLinearlyAligned(int size_in_bytes,
-                                        AllocationAlignment alignment);
   void EnsureSpaceForAllocation(int size_in_bytes);
   void FreeLinearAllocationArea();
 
@@ -276,7 +311,7 @@ class ReadOnlySpace : public BaseSpace {
   const size_t area_size_;
 
   friend class Heap;
-  friend class ReadOnlySerializer;  // For Unseal.
+  friend class ReadOnlyHeapImageDeserializer;
 };
 
 class SharedReadOnlySpace : public ReadOnlySpace {
@@ -304,6 +339,16 @@ class SharedReadOnlySpace : public ReadOnlySpace {
 };
 
 }  // namespace internal
+
+namespace base {
+// Define special hash function for page pointers, to be used with std data
+// structures, e.g. std::unordered_set<ReadOnlyPage*, base::hash<ReadOnlyPage*>
+template <>
+struct hash<i::ReadOnlyPage*> : hash<i::BasicMemoryChunk*> {};
+template <>
+struct hash<const i::ReadOnlyPage*> : hash<const i::BasicMemoryChunk*> {};
+}  // namespace base
+
 }  // namespace v8
 
 #endif  // V8_HEAP_READ_ONLY_SPACES_H_
diff --git a/deps/v8/src/heap/reference-summarizer.cc b/deps/v8/src/heap/reference-summarizer.cc
index 2e8fb20a972ea2..f0913fec6cb3e5 100644
--- a/deps/v8/src/heap/reference-summarizer.cc
+++ b/deps/v8/src/heap/reference-summarizer.cc
@@ -20,11 +20,7 @@ namespace {
 // marking visitor.
 class ReferenceSummarizerMarkingState final {
  public:
-  // Declares that this marking state is collecting retainers, so the marking
-  // visitor must fully visit each object and can't update on-heap state.
-  static constexpr bool kCollectRetainers = true;
-
-  explicit ReferenceSummarizerMarkingState(HeapObject object)
+  explicit ReferenceSummarizerMarkingState(Tagged<HeapObject> object)
       : primary_object_(object),
         local_marking_worklists_(&marking_worklists_),
         local_weak_objects_(&weak_objects_) {}
@@ -47,23 +43,21 @@ class ReferenceSummarizerMarkingState final {
   }
 
   // Standard marking visitor functions:
-
-  bool GreyToBlack(HeapObject obj) { return true; }
-  bool IsBlackOrGrey(HeapObject obj) const { return false; }
-
-  bool TryMark(HeapObject obj) { return true; }
-  bool IsUnmarked(HeapObject obj) const { return true; }
+  bool TryMark(Tagged<HeapObject> obj) { return true; }
+  bool IsUnmarked(Tagged<HeapObject> obj) const { return true; }
+  bool IsMarked(Tagged<HeapObject> obj) const { return false; }
 
   // Adds a retaining relationship found by the marking visitor.
-  void AddStrongReferenceForReferenceSummarizer(HeapObject host,
-                                                HeapObject obj) {
+  void AddStrongReferenceForReferenceSummarizer(Tagged<HeapObject> host,
+                                                Tagged<HeapObject> obj) {
     AddReference(host, obj, references_.strong_references());
   }
 
   // Adds a non-retaining weak reference found by the marking visitor. The value
   // in an ephemeron hash table entry is also included here, since it is not
   // known to be strong without further information about the key.
-  void AddWeakReferenceForReferenceSummarizer(HeapObject host, HeapObject obj) {
+  void AddWeakReferenceForReferenceSummarizer(Tagged<HeapObject> host,
+                                              Tagged<HeapObject> obj) {
     AddReference(host, obj, references_.weak_references());
   }
 
@@ -75,7 +69,7 @@ class ReferenceSummarizerMarkingState final {
   WeakObjects::Local* local_weak_objects() { return &local_weak_objects_; }
 
  private:
-  void AddReference(HeapObject host, HeapObject obj,
+  void AddReference(Tagged<HeapObject> host, Tagged<HeapObject> obj,
                     ReferenceSummary::UnorderedHeapObjectSet& references) {
     // It's possible that the marking visitor handles multiple objects at once,
     // such as a Map and its DescriptorArray, but we're only interested in
@@ -93,18 +87,57 @@ class ReferenceSummarizerMarkingState final {
   WeakObjects::Local local_weak_objects_;
 };
 
+class ReferenceSummarizerMarkingVisitor
+    : public MarkingVisitorBase<ReferenceSummarizerMarkingVisitor> {
+ public:
+  ReferenceSummarizerMarkingVisitor(
+      Heap* heap, ReferenceSummarizerMarkingState* marking_state)
+      : MarkingVisitorBase(
+            marking_state->local_marking_worklists(),
+            marking_state->local_weak_objects(), heap, 0 /*mark_compact_epoch*/,
+            {} /*code_flush_mode*/, false /*embedder_tracing_enabled*/,
+            true /*should_keep_ages_unchanged*/, 0 /*code_flushing_increase*/),
+        marking_state_(marking_state) {}
+
+  template <typename TSlot>
+  void RecordSlot(Tagged<HeapObject> object, TSlot slot,
+                  Tagged<HeapObject> target) {}
+
+  void RecordRelocSlot(Tagged<InstructionStream> host, RelocInfo* rinfo,
+                       Tagged<HeapObject> target) {}
+
+  V8_INLINE void AddStrongReferenceForReferenceSummarizer(
+      Tagged<HeapObject> host, Tagged<HeapObject> obj) {
+    marking_state_->AddStrongReferenceForReferenceSummarizer(host, obj);
+  }
+
+  V8_INLINE void AddWeakReferenceForReferenceSummarizer(
+      Tagged<HeapObject> host, Tagged<HeapObject> obj) {
+    marking_state_->AddWeakReferenceForReferenceSummarizer(host, obj);
+  }
+
+  TraceRetainingPathMode retaining_path_mode() {
+    return TraceRetainingPathMode::kDisabled;
+  }
+
+  constexpr bool CanUpdateValuesInHeap() { return false; }
+
+  // Standard marking visitor functions:
+  bool TryMark(Tagged<HeapObject> obj) { return true; }
+  bool IsMarked(Tagged<HeapObject> obj) const { return false; }
+
+ private:
+  ReferenceSummarizerMarkingState* marking_state_;
+};
+
 }  // namespace
 
-ReferenceSummary ReferenceSummary::SummarizeReferencesFrom(Heap* heap,
-                                                           HeapObject obj) {
+ReferenceSummary ReferenceSummary::SummarizeReferencesFrom(
+    Heap* heap, Tagged<HeapObject> obj) {
   ReferenceSummarizerMarkingState marking_state(obj);
 
-  MainMarkingVisitor<ReferenceSummarizerMarkingState> visitor(
-      &marking_state, marking_state.local_marking_worklists(),
-      marking_state.local_weak_objects(), heap, 0 /*mark_compact_epoch*/,
-      {} /*code_flush_mode*/, false /*embedder_tracing_enabled*/,
-      true /*should_keep_ages_unchanged*/);
-  visitor.Visit(obj.map(heap->isolate()), obj);
+  ReferenceSummarizerMarkingVisitor visitor(heap, &marking_state);
+  visitor.Visit(obj->map(heap->isolate()), obj);
 
   return marking_state.DestructivelyRetrieveReferences();
 }
diff --git a/deps/v8/src/heap/reference-summarizer.h b/deps/v8/src/heap/reference-summarizer.h
index 2aa09619d161e3..6e5071b7cba7a7 100644
--- a/deps/v8/src/heap/reference-summarizer.h
+++ b/deps/v8/src/heap/reference-summarizer.h
@@ -24,7 +24,8 @@ class ReferenceSummary {
   // Produces a set of objects referred to by the object. This function uses a
   // realistic marking visitor, so its results are likely to match real GC
   // behavior. Intended only for verification.
-  static ReferenceSummary SummarizeReferencesFrom(Heap* heap, HeapObject obj);
+  static ReferenceSummary SummarizeReferencesFrom(Heap* heap,
+                                                  Tagged<HeapObject> obj);
 
   using UnorderedHeapObjectSet =
       std::unordered_set<HeapObject, Object::Hasher, Object::KeyEqualSafe>;
diff --git a/deps/v8/src/heap/remembered-set-inl.h b/deps/v8/src/heap/remembered-set-inl.h
index d30f887122181d..09f7608c7581e7 100644
--- a/deps/v8/src/heap/remembered-set-inl.h
+++ b/deps/v8/src/heap/remembered-set-inl.h
@@ -20,28 +20,25 @@ SlotCallbackResult UpdateTypedSlotHelper::UpdateTypedSlot(Heap* heap,
                                                           Callback callback) {
   switch (slot_type) {
     case SlotType::kCodeEntry: {
-      RelocInfo rinfo(addr, RelocInfo::CODE_TARGET, 0, Code(),
-                      InstructionStream());
+      RelocInfo rinfo(addr, RelocInfo::CODE_TARGET);
       return UpdateCodeTarget(&rinfo, callback);
     }
     case SlotType::kConstPoolCodeEntry: {
       return UpdateCodeEntry(addr, callback);
     }
     case SlotType::kEmbeddedObjectCompressed: {
-      RelocInfo rinfo(addr, RelocInfo::COMPRESSED_EMBEDDED_OBJECT, 0, Code(),
-                      InstructionStream());
+      RelocInfo rinfo(addr, RelocInfo::COMPRESSED_EMBEDDED_OBJECT);
       return UpdateEmbeddedPointer(heap, &rinfo, callback);
     }
     case SlotType::kEmbeddedObjectFull: {
-      RelocInfo rinfo(addr, RelocInfo::FULL_EMBEDDED_OBJECT, 0, Code(),
-                      InstructionStream());
+      RelocInfo rinfo(addr, RelocInfo::FULL_EMBEDDED_OBJECT);
       return UpdateEmbeddedPointer(heap, &rinfo, callback);
     }
     case SlotType::kConstPoolEmbeddedObjectCompressed: {
-      HeapObject old_target =
+      Tagged<HeapObject> old_target =
           HeapObject::cast(Object(V8HeapCompressionScheme::DecompressTagged(
               heap->isolate(), base::Memory<Tagged_t>(addr))));
-      HeapObject new_target = old_target;
+      Tagged<HeapObject> new_target = old_target;
       SlotCallbackResult result = callback(FullMaybeObjectSlot(&new_target));
       DCHECK(!HasWeakHeapObjectTag(new_target));
       if (new_target != old_target) {
@@ -59,26 +56,23 @@ SlotCallbackResult UpdateTypedSlotHelper::UpdateTypedSlot(Heap* heap,
   UNREACHABLE();
 }
 
-HeapObject UpdateTypedSlotHelper::GetTargetObject(Heap* heap,
-                                                  SlotType slot_type,
-                                                  Address addr) {
+Tagged<HeapObject> UpdateTypedSlotHelper::GetTargetObject(Heap* heap,
+                                                          SlotType slot_type,
+                                                          Address addr) {
   switch (slot_type) {
     case SlotType::kCodeEntry: {
-      RelocInfo rinfo(addr, RelocInfo::CODE_TARGET, 0, Code(),
-                      InstructionStream());
+      RelocInfo rinfo(addr, RelocInfo::CODE_TARGET);
       return InstructionStream::FromTargetAddress(rinfo.target_address());
     }
     case SlotType::kConstPoolCodeEntry: {
       return InstructionStream::FromEntryAddress(addr);
     }
     case SlotType::kEmbeddedObjectCompressed: {
-      RelocInfo rinfo(addr, RelocInfo::COMPRESSED_EMBEDDED_OBJECT, 0, Code(),
-                      InstructionStream());
+      RelocInfo rinfo(addr, RelocInfo::COMPRESSED_EMBEDDED_OBJECT);
       return rinfo.target_object(heap->isolate());
     }
     case SlotType::kEmbeddedObjectFull: {
-      RelocInfo rinfo(addr, RelocInfo::FULL_EMBEDDED_OBJECT, 0, Code(),
-                      InstructionStream());
+      RelocInfo rinfo(addr, RelocInfo::FULL_EMBEDDED_OBJECT);
       return rinfo.target_object(heap->isolate());
     }
     case SlotType::kConstPoolEmbeddedObjectCompressed: {
diff --git a/deps/v8/src/heap/remembered-set.h b/deps/v8/src/heap/remembered-set.h
index 1a2ebb09812a4f..30b805026fb956 100644
--- a/deps/v8/src/heap/remembered-set.h
+++ b/deps/v8/src/heap/remembered-set.h
@@ -13,6 +13,7 @@
 #include "src/common/globals.h"
 #include "src/heap/base/worklist.h"
 #include "src/heap/heap.h"
+#include "src/heap/memory-chunk-layout.h"
 #include "src/heap/memory-chunk.h"
 #include "src/heap/paged-spaces.h"
 #include "src/heap/slot-set.h"
@@ -21,8 +22,6 @@
 namespace v8 {
 namespace internal {
 
-enum RememberedSetIterationMode { SYNCHRONIZED, NON_SYNCHRONIZED };
-
 class RememberedSetOperations {
  public:
   // Given a page and a slot in that page, this function adds the slot to the
@@ -37,13 +36,13 @@ class RememberedSetOperations {
         offset);
   }
 
-  template <typename Callback>
-  static int Iterate(SlotSet* slot_set, MemoryChunk* chunk, Callback callback,
-                     SlotSet::EmptyBucketMode mode) {
+  template <AccessMode access_mode = AccessMode::ATOMIC, typename Callback>
+  static int Iterate(SlotSet* slot_set, const MemoryChunk* chunk,
+                     Callback callback, SlotSet::EmptyBucketMode mode) {
     int slots = 0;
     if (slot_set != nullptr) {
-      slots += slot_set->Iterate(chunk->address(), 0, chunk->buckets(),
-                                 callback, mode);
+      slots += slot_set->Iterate<access_mode>(chunk->address(), 0,
+                                              chunk->buckets(), callback, mode);
     }
     return slots;
   }
@@ -97,22 +96,39 @@ class RememberedSet : public AllStatic {
     DCHECK(chunk->Contains(slot_addr));
     SlotSet* slot_set = chunk->slot_set<type, access_mode>();
     if (slot_set == nullptr) {
-      slot_set = chunk->AllocateSlotSet<type>();
+      slot_set = chunk->AllocateSlotSet(type);
     }
     RememberedSetOperations::Insert<access_mode>(slot_set, chunk, slot_addr);
   }
 
   // Given a page and a slot set, this function merges the slot set to the set
   // of the page. |other_slot_set| should not be used after calling this method.
-  static void MergeAndDelete(MemoryChunk* chunk, SlotSet* other_slot_set) {
-    static_assert(type == RememberedSetType::OLD_TO_NEW);
+  static void MergeAndDelete(MemoryChunk* chunk, SlotSet&& other_slot_set) {
+    static_assert(type == RememberedSetType::OLD_TO_NEW ||
+                  type == RememberedSetType::OLD_TO_NEW_BACKGROUND);
     SlotSet* slot_set = chunk->slot_set<type, AccessMode::NON_ATOMIC>();
     if (slot_set == nullptr) {
-      chunk->set_slot_set<RememberedSetType::OLD_TO_NEW>(other_slot_set);
+      chunk->set_slot_set<type, AccessMode::NON_ATOMIC>(&other_slot_set);
+      return;
+    }
+    slot_set->Merge(&other_slot_set, chunk->buckets());
+    SlotSet::Delete(&other_slot_set, chunk->buckets());
+  }
+
+  // Given a page and a slot set, this function merges the slot set to the set
+  // of the page. |other_slot_set| should not be used after calling this method.
+  static void MergeAndDeleteTyped(MemoryChunk* chunk,
+                                  TypedSlotSet&& other_typed_slot_set) {
+    static_assert(type == RememberedSetType::OLD_TO_NEW);
+    TypedSlotSet* typed_slot_set =
+        chunk->typed_slot_set<type, AccessMode::NON_ATOMIC>();
+    if (typed_slot_set == nullptr) {
+      chunk->set_typed_slot_set<RememberedSetType::OLD_TO_NEW,
+                                AccessMode::NON_ATOMIC>(&other_typed_slot_set);
       return;
     }
-    slot_set->Merge(other_slot_set, chunk->buckets());
-    SlotSet::Delete(other_slot_set, chunk->buckets());
+    typed_slot_set->Merge(&other_typed_slot_set);
+    delete &other_typed_slot_set;
   }
 
   // Given a page and a slot in that page, this function returns true if
@@ -149,18 +165,6 @@ class RememberedSet : public AllStatic {
     RememberedSetOperations::RemoveRange(slot_set, chunk, start, end, mode);
   }
 
-  // Iterates and filters the remembered set with the given callback.
-  // The callback should take (Address slot) and return SlotCallbackResult.
-  template <typename Callback>
-  static void Iterate(Heap* heap, RememberedSetIterationMode mode,
-                      Callback callback) {
-    IterateMemoryChunks(heap, [mode, callback](MemoryChunk* chunk) {
-      if (mode == SYNCHRONIZED) chunk->mutex()->Lock();
-      Iterate(chunk, callback);
-      if (mode == SYNCHRONIZED) chunk->mutex()->Unlock();
-    });
-  }
-
   // Iterates over all memory chunks that contains non-empty slot sets.
   // The callback should take (MemoryChunk* chunk) and return void.
   template <typename Callback>
@@ -170,8 +174,7 @@ class RememberedSet : public AllStatic {
     while ((chunk = it.next()) != nullptr) {
       SlotSet* slot_set = chunk->slot_set<type>();
       TypedSlotSet* typed_slot_set = chunk->typed_slot_set<type>();
-      if (slot_set != nullptr || typed_slot_set != nullptr ||
-          chunk->invalidated_slots<type>() != nullptr) {
+      if (slot_set != nullptr || typed_slot_set != nullptr) {
         callback(chunk);
       }
     }
@@ -183,11 +186,18 @@ class RememberedSet : public AllStatic {
   //
   // Notice that |mode| can only be of FREE* or PREFREE* if there are no other
   // threads concurrently inserting slots.
-  template <typename Callback>
+  template <AccessMode access_mode = AccessMode::ATOMIC, typename Callback>
   static int Iterate(MemoryChunk* chunk, Callback callback,
                      SlotSet::EmptyBucketMode mode) {
     SlotSet* slot_set = chunk->slot_set<type>();
-    return RememberedSetOperations::Iterate(slot_set, chunk, callback, mode);
+    return Iterate<access_mode>(slot_set, chunk, callback, mode);
+  }
+
+  template <AccessMode access_mode = AccessMode::ATOMIC, typename Callback>
+  static int Iterate(SlotSet* slot_set, const MemoryChunk* chunk,
+                     Callback callback, SlotSet::EmptyBucketMode mode) {
+    return RememberedSetOperations::Iterate<access_mode>(slot_set, chunk,
+                                                         callback, mode);
   }
 
   template <typename Callback>
@@ -207,21 +217,13 @@ class RememberedSet : public AllStatic {
     return slots;
   }
 
-  static void FreeEmptyBuckets(MemoryChunk* chunk) {
-    DCHECK(type == OLD_TO_NEW);
-    SlotSet* slot_set = chunk->slot_set<type>();
-    if (slot_set != nullptr && slot_set->FreeEmptyBuckets(chunk->buckets())) {
-      chunk->ReleaseSlotSet<type>();
-    }
-  }
-
   static bool CheckPossiblyEmptyBuckets(MemoryChunk* chunk) {
-    DCHECK(type == OLD_TO_NEW);
+    DCHECK(type == OLD_TO_NEW || type == OLD_TO_NEW_BACKGROUND);
     SlotSet* slot_set = chunk->slot_set<type, AccessMode::NON_ATOMIC>();
     if (slot_set != nullptr &&
         slot_set->CheckPossiblyEmptyBuckets(chunk->buckets(),
                                             chunk->possibly_empty_buckets())) {
-      chunk->ReleaseSlotSet<type>();
+      chunk->ReleaseSlotSet(type);
       return true;
     }
 
@@ -234,7 +236,7 @@ class RememberedSet : public AllStatic {
                           uint32_t offset) {
     TypedSlotSet* slot_set = memory_chunk->typed_slot_set<type>();
     if (slot_set == nullptr) {
-      slot_set = memory_chunk->AllocateTypedSlotSet<type>();
+      slot_set = memory_chunk->AllocateTypedSlotSet(type);
     }
     slot_set->Insert(slot_type, offset);
   }
@@ -242,7 +244,9 @@ class RememberedSet : public AllStatic {
   static void MergeTyped(MemoryChunk* page, std::unique_ptr<TypedSlots> other) {
     TypedSlotSet* slot_set = page->typed_slot_set<type>();
     if (slot_set == nullptr) {
-      slot_set = page->AllocateTypedSlotSet<type>();
+      CodePageHeaderModificationScope header_modification_scope(
+          "Allocating a typed slot set requires header write permissions.");
+      slot_set = page->AllocateTypedSlotSet(type);
     }
     slot_set->Merge(other.get());
   }
@@ -261,32 +265,20 @@ class RememberedSet : public AllStatic {
     }
   }
 
-  // Iterates and filters the remembered set with the given callback.
-  // The callback should take (SlotType slot_type, Address addr) and return
-  // SlotCallbackResult.
-  template <typename Callback>
-  static void IterateTyped(Heap* heap, RememberedSetIterationMode mode,
-                           Callback callback) {
-    IterateMemoryChunks(heap, [mode, callback](MemoryChunk* chunk) {
-      if (mode == SYNCHRONIZED) chunk->mutex()->Lock();
-      IterateTyped(chunk, callback);
-      if (mode == SYNCHRONIZED) chunk->mutex()->Unlock();
-    });
-  }
-
   // Iterates and filters typed pointers in the given memory chunk with the
   // given callback. The callback should take (SlotType slot_type, Address addr)
   // and return SlotCallbackResult.
   template <typename Callback>
-  static void IterateTyped(MemoryChunk* chunk, Callback callback) {
+  static int IterateTyped(MemoryChunk* chunk, Callback callback) {
     TypedSlotSet* slot_set = chunk->typed_slot_set<type>();
-    if (slot_set != nullptr) {
-      int new_count =
-          slot_set->Iterate(callback, TypedSlotSet::KEEP_EMPTY_CHUNKS);
-      if (new_count == 0) {
-        chunk->ReleaseTypedSlotSet<type>();
-      }
-    }
+    if (!slot_set) return 0;
+    return IterateTyped(slot_set, callback);
+  }
+
+  template <typename Callback>
+  static int IterateTyped(TypedSlotSet* slot_set, Callback callback) {
+    DCHECK_NOT_NULL(slot_set);
+    return slot_set->Iterate(callback, TypedSlotSet::KEEP_EMPTY_CHUNKS);
   }
 
   // Clear all old to old slots from the remembered set.
@@ -295,10 +287,9 @@ class RememberedSet : public AllStatic {
     OldGenerationMemoryChunkIterator it(heap);
     MemoryChunk* chunk;
     while ((chunk = it.next()) != nullptr) {
-      chunk->ReleaseSlotSet<OLD_TO_OLD>();
-      chunk->ReleaseSlotSet<OLD_TO_CODE>();
-      chunk->ReleaseTypedSlotSet<OLD_TO_OLD>();
-      chunk->ReleaseInvalidatedSlots<OLD_TO_OLD>();
+      chunk->ReleaseSlotSet(OLD_TO_OLD);
+      chunk->ReleaseSlotSet(OLD_TO_CODE);
+      chunk->ReleaseTypedSlotSet(OLD_TO_OLD);
     }
   }
 };
@@ -314,8 +305,9 @@ class UpdateTypedSlotHelper {
                                             Address addr, Callback callback);
 
   // Returns the HeapObject referenced by the given typed slot entry.
-  inline static HeapObject GetTargetObject(Heap* heap, SlotType slot_type,
-                                           Address addr);
+  inline static Tagged<HeapObject> GetTargetObject(Heap* heap,
+                                                   SlotType slot_type,
+                                                   Address addr);
 
  private:
   // Updates a code entry slot using an untyped slot callback.
@@ -323,12 +315,13 @@ class UpdateTypedSlotHelper {
   template <typename Callback>
   static SlotCallbackResult UpdateCodeEntry(Address entry_address,
                                             Callback callback) {
-    InstructionStream code = InstructionStream::FromEntryAddress(entry_address);
-    InstructionStream old_code = code;
+    Tagged<InstructionStream> code =
+        InstructionStream::FromEntryAddress(entry_address);
+    Tagged<InstructionStream> old_code = code;
     SlotCallbackResult result = callback(FullMaybeObjectSlot(&code));
     DCHECK(!HasWeakHeapObjectTag(code));
     if (code != old_code) {
-      base::Memory<Address>(entry_address) = code.entry();
+      base::Memory<Address>(entry_address) = code->instruction_start();
     }
     return result;
   }
@@ -339,14 +332,14 @@ class UpdateTypedSlotHelper {
   static SlotCallbackResult UpdateCodeTarget(RelocInfo* rinfo,
                                              Callback callback) {
     DCHECK(RelocInfo::IsCodeTargetMode(rinfo->rmode()));
-    InstructionStream old_target =
+    Tagged<InstructionStream> old_target =
         InstructionStream::FromTargetAddress(rinfo->target_address());
-    InstructionStream new_target = old_target;
+    Tagged<InstructionStream> new_target = old_target;
     SlotCallbackResult result = callback(FullMaybeObjectSlot(&new_target));
     DCHECK(!HasWeakHeapObjectTag(new_target));
     if (new_target != old_target) {
       rinfo->set_target_address(
-          InstructionStream::cast(new_target).instruction_start());
+          InstructionStream::cast(new_target)->instruction_start());
     }
     return result;
   }
@@ -357,12 +350,12 @@ class UpdateTypedSlotHelper {
   static SlotCallbackResult UpdateEmbeddedPointer(Heap* heap, RelocInfo* rinfo,
                                                   Callback callback) {
     DCHECK(RelocInfo::IsEmbeddedObjectMode(rinfo->rmode()));
-    HeapObject old_target = rinfo->target_object(heap->isolate());
-    HeapObject new_target = old_target;
+    Tagged<HeapObject> old_target = rinfo->target_object(heap->isolate());
+    Tagged<HeapObject> new_target = old_target;
     SlotCallbackResult result = callback(FullMaybeObjectSlot(&new_target));
     DCHECK(!HasWeakHeapObjectTag(new_target));
     if (new_target != old_target) {
-      rinfo->set_target_object(heap, HeapObject::cast(new_target));
+      rinfo->set_target_object(HeapObject::cast(new_target));
     }
     return result;
   }
diff --git a/deps/v8/src/heap/safepoint.cc b/deps/v8/src/heap/safepoint.cc
index 6b9bf9e5c61af6..8ca6b0884571da 100644
--- a/deps/v8/src/heap/safepoint.cc
+++ b/deps/v8/src/heap/safepoint.cc
@@ -18,7 +18,7 @@
 #include "src/heap/gc-tracer.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap.h"
-#include "src/heap/local-heap.h"
+#include "src/heap/local-heap-inl.h"
 #include "src/heap/parked-scope.h"
 #include "src/logging/counters-scopes.h"
 #include "src/objects/objects.h"
@@ -72,7 +72,6 @@ class PerClientSafepointData final {
 void IsolateSafepoint::InitiateGlobalSafepointScope(
     Isolate* initiator, PerClientSafepointData* client_data) {
   shared_space_isolate()->global_safepoint()->AssertActive();
-  IgnoreLocalGCRequests ignore_gc_requests(initiator->heap());
   LockMutex(initiator->main_thread_local_heap());
   InitiateGlobalSafepointScopeRaw(initiator, client_data);
 }
@@ -113,9 +112,8 @@ void IsolateSafepoint::InitiateGlobalSafepointScopeRaw(
   if (isolate() != initiator) {
     // An isolate might be waiting in the event loop. Post a task in order to
     // wake it up.
-    V8::GetCurrentPlatform()
-        ->GetForegroundTaskRunner(reinterpret_cast<v8::Isolate*>(isolate()))
-        ->PostTask(std::make_unique<GlobalSafepointInterruptTask>(heap_));
+    isolate()->heap()->GetForegroundTaskRunner()->PostTask(
+        std::make_unique<GlobalSafepointInterruptTask>(heap_));
 
     // Request an interrupt in case of long-running code.
     isolate()->stack_guard()->RequestGlobalSafepoint();
@@ -156,8 +154,10 @@ size_t IsolateSafepoint::SetSafepointRequestedFlags(
 
 void IsolateSafepoint::LockMutex(LocalHeap* local_heap) {
   if (!local_heaps_mutex_.TryLock()) {
-    ParkedScope parked_scope(local_heap);
-    local_heaps_mutex_.Lock();
+    // Safepoints are only used for GCs, so GC requests should be ignored by
+    // default when parking for a safepoint.
+    IgnoreLocalGCRequests ignore_gc_requests(local_heap->heap());
+    local_heap->BlockWhileParked([this]() { local_heaps_mutex_.Lock(); });
   }
 }
 
@@ -344,8 +344,8 @@ void GlobalSafepoint::EnterGlobalSafepointScope(Isolate* initiator) {
 
   if (!clients_mutex_.TryLock()) {
     IgnoreLocalGCRequests ignore_gc_requests(initiator->heap());
-    ParkedScope parked_scope(initiator->main_thread_local_heap());
-    clients_mutex_.Lock();
+    initiator->main_thread_local_heap()->BlockWhileParked(
+        [this]() { clients_mutex_.Lock(); });
   }
 
   if (++active_safepoint_scopes_ > 1) return;
diff --git a/deps/v8/src/heap/scavenger-inl.h b/deps/v8/src/heap/scavenger-inl.h
index a6bce6eef11a59..8fc6ec58ad567e 100644
--- a/deps/v8/src/heap/scavenger-inl.h
+++ b/deps/v8/src/heap/scavenger-inl.h
@@ -22,13 +22,14 @@
 namespace v8 {
 namespace internal {
 
-void Scavenger::PromotionList::Local::PushRegularObject(HeapObject object,
-                                                        int size) {
+void Scavenger::PromotionList::Local::PushRegularObject(
+    Tagged<HeapObject> object, int size) {
   regular_object_promotion_list_local_.Push({object, size});
 }
 
-void Scavenger::PromotionList::Local::PushLargeObject(HeapObject object,
-                                                      Map map, int size) {
+void Scavenger::PromotionList::Local::PushLargeObject(Tagged<HeapObject> object,
+                                                      Tagged<Map> map,
+                                                      int size) {
   large_object_promotion_list_local_.Push({object, map, size});
 }
 
@@ -42,7 +43,7 @@ bool Scavenger::PromotionList::Local::Pop(struct PromotionListEntry* entry) {
   if (regular_object_promotion_list_local_.Pop(&regular_object)) {
     entry->heap_object = regular_object.first;
     entry->size = regular_object.second;
-    entry->map = entry->heap_object.map();
+    entry->map = entry->heap_object->map();
     return true;
   }
   return large_object_promotion_list_local_.Pop(entry);
@@ -81,24 +82,24 @@ void Scavenger::PageMemoryFence(MaybeObject object) {
 #ifdef THREAD_SANITIZER
   // Perform a dummy acquire load to tell TSAN that there is no data race
   // with  page initialization.
-  HeapObject heap_object;
-  if (object->GetHeapObject(&heap_object)) {
+  Tagged<HeapObject> heap_object;
+  if (object.GetHeapObject(&heap_object)) {
     BasicMemoryChunk::FromHeapObject(heap_object)->SynchronizedHeapLoad();
   }
 #endif
 }
 
-bool Scavenger::MigrateObject(Map map, HeapObject source, HeapObject target,
-                              int size,
+bool Scavenger::MigrateObject(Tagged<Map> map, Tagged<HeapObject> source,
+                              Tagged<HeapObject> target, int size,
                               PromotionHeapChoice promotion_heap_choice) {
   // Copy the content of source to target.
-  target.set_map_word(map, kRelaxedStore);
+  target->set_map_word(map, kRelaxedStore);
   heap()->CopyBlock(target.address() + kTaggedSize,
                     source.address() + kTaggedSize, size - kTaggedSize);
 
   // This release CAS is paired with the load acquire in ScavengeObject.
-  if (!source.release_compare_and_swap_map_word_forwarded(MapWord::FromMap(map),
-                                                          target)) {
+  if (!source->release_compare_and_swap_map_word_forwarded(
+          MapWord::FromMap(map), target)) {
     // Other task migrated the object.
     return false;
   }
@@ -119,8 +120,8 @@ bool Scavenger::MigrateObject(Map map, HeapObject source, HeapObject target,
 
 template <typename THeapObjectSlot>
 CopyAndForwardResult Scavenger::SemiSpaceCopyObject(
-    Map map, THeapObjectSlot slot, HeapObject object, int object_size,
-    ObjectFields object_fields) {
+    Tagged<Map> map, THeapObjectSlot slot, Tagged<HeapObject> object,
+    int object_size, ObjectFields object_fields) {
   static_assert(std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
                     std::is_same<THeapObjectSlot, HeapObjectSlot>::value,
                 "Only FullHeapObjectSlot and HeapObjectSlot are expected here");
@@ -129,14 +130,14 @@ CopyAndForwardResult Scavenger::SemiSpaceCopyObject(
   AllocationResult allocation = allocator_.Allocate(
       NEW_SPACE, object_size, AllocationOrigin::kGC, alignment);
 
-  HeapObject target;
+  Tagged<HeapObject> target;
   if (allocation.To(&target)) {
     DCHECK(heap()->marking_state()->IsUnmarked(target));
     const bool self_success =
         MigrateObject(map, object, target, object_size, kPromoteIntoLocalHeap);
     if (!self_success) {
       allocator_.FreeLast(NEW_SPACE, target, object_size);
-      MapWord map_word = object.map_word(kAcquireLoad);
+      MapWord map_word = object->map_word(kAcquireLoad);
       HeapObjectReference::Update(slot, map_word.ToForwardingAddress(object));
       DCHECK(!Heap::InFromPage(*slot));
       return Heap::InToPage(*slot)
@@ -155,8 +156,9 @@ CopyAndForwardResult Scavenger::SemiSpaceCopyObject(
 
 template <typename THeapObjectSlot,
           Scavenger::PromotionHeapChoice promotion_heap_choice>
-CopyAndForwardResult Scavenger::PromoteObject(Map map, THeapObjectSlot slot,
-                                              HeapObject object,
+CopyAndForwardResult Scavenger::PromoteObject(Tagged<Map> map,
+                                              THeapObjectSlot slot,
+                                              Tagged<HeapObject> object,
                                               int object_size,
                                               ObjectFields object_fields) {
   static_assert(std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
@@ -177,7 +179,7 @@ CopyAndForwardResult Scavenger::PromoteObject(Map map, THeapObjectSlot slot,
       break;
   }
 
-  HeapObject target;
+  Tagged<HeapObject> target;
   if (allocation.To(&target)) {
     DCHECK(heap()->non_atomic_marking_state()->IsUnmarked(target));
     const bool self_success =
@@ -192,7 +194,7 @@ CopyAndForwardResult Scavenger::PromoteObject(Map map, THeapObjectSlot slot,
           break;
       }
 
-      MapWord map_word = object.map_word(kAcquireLoad);
+      MapWord map_word = object->map_word(kAcquireLoad);
       HeapObjectReference::Update(slot, map_word.ToForwardingAddress(object));
       DCHECK(!Heap::InFromPage(*slot));
       return Heap::InToPage(*slot)
@@ -219,15 +221,15 @@ SlotCallbackResult Scavenger::RememberedSetEntryNeeded(
                                                                   : REMOVE_SLOT;
 }
 
-bool Scavenger::HandleLargeObject(Map map, HeapObject object, int object_size,
-                                  ObjectFields object_fields) {
+bool Scavenger::HandleLargeObject(Tagged<Map> map, Tagged<HeapObject> object,
+                                  int object_size, ObjectFields object_fields) {
   // TODO(hpayer): Make this check size based, i.e.
   // object_size > kMaxRegularHeapObjectSize
   if (V8_UNLIKELY(
           BasicMemoryChunk::FromHeapObject(object)->InNewLargeObjectSpace())) {
     DCHECK_EQ(NEW_LO_SPACE,
               MemoryChunk::FromHeapObject(object)->owner_identity());
-    if (object.release_compare_and_swap_map_word_forwarded(
+    if (object->release_compare_and_swap_map_word_forwarded(
             MapWord::FromMap(map), object)) {
       surviving_new_large_objects_.insert({object, map});
       promoted_size_ += object_size;
@@ -243,12 +245,12 @@ bool Scavenger::HandleLargeObject(Map map, HeapObject object, int object_size,
 template <typename THeapObjectSlot,
           Scavenger::PromotionHeapChoice promotion_heap_choice>
 SlotCallbackResult Scavenger::EvacuateObjectDefault(
-    Map map, THeapObjectSlot slot, HeapObject object, int object_size,
-    ObjectFields object_fields) {
+    Tagged<Map> map, THeapObjectSlot slot, Tagged<HeapObject> object,
+    int object_size, ObjectFields object_fields) {
   static_assert(std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
                     std::is_same<THeapObjectSlot, HeapObjectSlot>::value,
                 "Only FullHeapObjectSlot and HeapObjectSlot are expected here");
-  SLOW_DCHECK(object.SizeFromMap(map) == object_size);
+  SLOW_DCHECK(object->SizeFromMap(map) == object_size);
   CopyAndForwardResult result;
 
   if (HandleLargeObject(map, object, object_size, object_fields)) {
@@ -288,8 +290,9 @@ SlotCallbackResult Scavenger::EvacuateObjectDefault(
 }
 
 template <typename THeapObjectSlot>
-SlotCallbackResult Scavenger::EvacuateThinString(Map map, THeapObjectSlot slot,
-                                                 ThinString object,
+SlotCallbackResult Scavenger::EvacuateThinString(Tagged<Map> map,
+                                                 THeapObjectSlot slot,
+                                                 Tagged<ThinString> object,
                                                  int object_size) {
   static_assert(std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
                     std::is_same<THeapObjectSlot, HeapObjectSlot>::value,
@@ -298,7 +301,7 @@ SlotCallbackResult Scavenger::EvacuateThinString(Map map, THeapObjectSlot slot,
     // The ThinString should die after Scavenge, so avoid writing the proper
     // forwarding pointer and instead just signal the actual object as forwarded
     // reference.
-    String actual = object.actual();
+    Tagged<String> actual = object->actual();
     // ThinStrings always refer to internalized strings, which are always in old
     // space.
     DCHECK(!Heap::InYoungGeneration(actual));
@@ -307,59 +310,58 @@ SlotCallbackResult Scavenger::EvacuateThinString(Map map, THeapObjectSlot slot,
   }
 
   DCHECK_EQ(ObjectFields::kMaybePointers,
-            Map::ObjectFieldsFrom(map.visitor_id()));
+            Map::ObjectFieldsFrom(map->visitor_id()));
   return EvacuateObjectDefault(map, slot, object, object_size,
                                ObjectFields::kMaybePointers);
 }
 
 template <typename THeapObjectSlot>
-SlotCallbackResult Scavenger::EvacuateShortcutCandidate(Map map,
-                                                        THeapObjectSlot slot,
-                                                        ConsString object,
-                                                        int object_size) {
+SlotCallbackResult Scavenger::EvacuateShortcutCandidate(
+    Tagged<Map> map, THeapObjectSlot slot, Tagged<ConsString> object,
+    int object_size) {
   static_assert(std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
                     std::is_same<THeapObjectSlot, HeapObjectSlot>::value,
                 "Only FullHeapObjectSlot and HeapObjectSlot are expected here");
-  DCHECK(IsShortcutCandidate(map.instance_type()));
+  DCHECK(IsShortcutCandidate(map->instance_type()));
 
   if (shortcut_strings_ &&
-      object.unchecked_second() == ReadOnlyRoots(heap()).empty_string()) {
-    HeapObject first = HeapObject::cast(object.unchecked_first());
+      object->unchecked_second() == ReadOnlyRoots(heap()).empty_string()) {
+    Tagged<HeapObject> first = HeapObject::cast(object->unchecked_first());
 
     HeapObjectReference::Update(slot, first);
 
     if (!Heap::InYoungGeneration(first)) {
-      object.set_map_word_forwarded(first, kReleaseStore);
+      object->set_map_word_forwarded(first, kReleaseStore);
       return REMOVE_SLOT;
     }
 
-    MapWord first_word = first.map_word(kAcquireLoad);
+    MapWord first_word = first->map_word(kAcquireLoad);
     if (first_word.IsForwardingAddress()) {
-      HeapObject target = first_word.ToForwardingAddress(first);
+      Tagged<HeapObject> target = first_word.ToForwardingAddress(first);
 
       HeapObjectReference::Update(slot, target);
-      object.set_map_word_forwarded(target, kReleaseStore);
+      object->set_map_word_forwarded(target, kReleaseStore);
       return Heap::InYoungGeneration(target) ? KEEP_SLOT : REMOVE_SLOT;
     }
-    Map first_map = first_word.ToMap();
+    Tagged<Map> first_map = first_word.ToMap();
     SlotCallbackResult result = EvacuateObjectDefault(
-        first_map, slot, first, first.SizeFromMap(first_map),
-        Map::ObjectFieldsFrom(first_map.visitor_id()));
-    object.set_map_word_forwarded(slot.ToHeapObject(), kReleaseStore);
+        first_map, slot, first, first->SizeFromMap(first_map),
+        Map::ObjectFieldsFrom(first_map->visitor_id()));
+    object->set_map_word_forwarded(slot.ToHeapObject(), kReleaseStore);
     return result;
   }
   DCHECK_EQ(ObjectFields::kMaybePointers,
-            Map::ObjectFieldsFrom(map.visitor_id()));
+            Map::ObjectFieldsFrom(map->visitor_id()));
   return EvacuateObjectDefault(map, slot, object, object_size,
                                ObjectFields::kMaybePointers);
 }
 
 template <typename THeapObjectSlot>
 SlotCallbackResult Scavenger::EvacuateInPlaceInternalizableString(
-    Map map, THeapObjectSlot slot, String object, int object_size,
-    ObjectFields object_fields) {
-  DCHECK(String::IsInPlaceInternalizable(map.instance_type()));
-  DCHECK_EQ(object_fields, Map::ObjectFieldsFrom(map.visitor_id()));
+    Tagged<Map> map, THeapObjectSlot slot, Tagged<String> object,
+    int object_size, ObjectFields object_fields) {
+  DCHECK(String::IsInPlaceInternalizable(map->instance_type()));
+  DCHECK_EQ(object_fields, Map::ObjectFieldsFrom(map->visitor_id()));
   if (shared_string_table_) {
     return EvacuateObjectDefault<THeapObjectSlot, kPromoteIntoSharedHeap>(
         map, slot, object, object_size, object_fields);
@@ -368,17 +370,18 @@ SlotCallbackResult Scavenger::EvacuateInPlaceInternalizableString(
 }
 
 template <typename THeapObjectSlot>
-SlotCallbackResult Scavenger::EvacuateObject(THeapObjectSlot slot, Map map,
-                                             HeapObject source) {
+SlotCallbackResult Scavenger::EvacuateObject(THeapObjectSlot slot,
+                                             Tagged<Map> map,
+                                             Tagged<HeapObject> source) {
   static_assert(std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
                     std::is_same<THeapObjectSlot, HeapObjectSlot>::value,
                 "Only FullHeapObjectSlot and HeapObjectSlot are expected here");
   SLOW_DCHECK(Heap::InFromPage(source));
   SLOW_DCHECK(!MapWord::FromMap(map).IsForwardingAddress());
-  int size = source.SizeFromMap(map);
+  int size = source->SizeFromMap(map);
   // Cannot use ::cast() below because that would add checks in debug mode
   // that require re-reading the map.
-  VisitorId visitor_id = map.visitor_id();
+  VisitorId visitor_id = map->visitor_id();
   switch (visitor_id) {
     case kVisitThinString:
       // At the moment we don't allow weak pointers to thin strings.
@@ -392,13 +395,15 @@ SlotCallbackResult Scavenger::EvacuateObject(THeapObjectSlot slot, Map map,
           map, slot, ConsString::unchecked_cast(source), size);
     case kVisitSeqOneByteString:
     case kVisitSeqTwoByteString:
-      DCHECK(String::IsInPlaceInternalizable(map.instance_type()));
+      DCHECK(String::IsInPlaceInternalizable(map->instance_type()));
+      static_assert(Map::ObjectFieldsFrom(kVisitSeqOneByteString) ==
+                    Map::ObjectFieldsFrom(kVisitSeqTwoByteString));
       return EvacuateInPlaceInternalizableString(
           map, slot, String::unchecked_cast(source), size,
-          ObjectFields::kMaybePointers);
+          Map::ObjectFieldsFrom(kVisitSeqOneByteString));
     case kVisitDataObject:  // External strings have kVisitDataObject.
       if (String::IsInPlaceInternalizableExcludingExternal(
-              map.instance_type())) {
+              map->instance_type())) {
         return EvacuateInPlaceInternalizableString(
             map, slot, String::unchecked_cast(source), size,
             ObjectFields::kDataOnly);
@@ -412,7 +417,7 @@ SlotCallbackResult Scavenger::EvacuateObject(THeapObjectSlot slot, Map map,
 
 template <typename THeapObjectSlot>
 SlotCallbackResult Scavenger::ScavengeObject(THeapObjectSlot p,
-                                             HeapObject object) {
+                                             Tagged<HeapObject> object) {
   static_assert(std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
                     std::is_same<THeapObjectSlot, HeapObjectSlot>::value,
                 "Only FullHeapObjectSlot and HeapObjectSlot are expected here");
@@ -421,12 +426,12 @@ SlotCallbackResult Scavenger::ScavengeObject(THeapObjectSlot p,
   // Synchronized load that consumes the publishing CAS of MigrateObject. We
   // need memory ordering in order to read the page header of the forwarded
   // object (using Heap::InYoungGeneration).
-  MapWord first_word = object.map_word(kAcquireLoad);
+  MapWord first_word = object->map_word(kAcquireLoad);
 
   // If the first word is a forwarding address, the object has already been
   // copied.
   if (first_word.IsForwardingAddress()) {
-    HeapObject dest = first_word.ToForwardingAddress(object);
+    Tagged<HeapObject> dest = first_word.ToForwardingAddress(object);
     HeapObjectReference::Update(p, dest);
     DCHECK_IMPLIES(Heap::InYoungGeneration(dest),
                    Heap::InToPage(dest) || Heap::IsLargeObject(dest));
@@ -436,7 +441,7 @@ SlotCallbackResult Scavenger::ScavengeObject(THeapObjectSlot p,
     return Heap::InYoungGeneration(dest) ? KEEP_SLOT : REMOVE_SLOT;
   }
 
-  Map map = first_word.ToMap();
+  Tagged<Map> map = first_word.ToMap();
   // AllocationMementos are unrooted and shouldn't survive a scavenge
   DCHECK_NE(ReadOnlyRoots(heap()).allocation_memento_map(), map);
   // Call the slow part of scavenge object.
@@ -452,12 +457,12 @@ SlotCallbackResult Scavenger::CheckAndScavengeObject(Heap* heap, TSlot slot) {
   using THeapObjectSlot = typename TSlot::THeapObjectSlot;
   MaybeObject object = *slot;
   if (Heap::InFromPage(object)) {
-    HeapObject heap_object = object->GetHeapObject();
+    Tagged<HeapObject> heap_object = object.GetHeapObject();
 
     SlotCallbackResult result =
         ScavengeObject(THeapObjectSlot(slot), heap_object);
     DCHECK_IMPLIES(result == REMOVE_SLOT,
-                   !heap->InYoungGeneration((*slot)->GetHeapObject()));
+                   !heap->InYoungGeneration((*slot).GetHeapObject()));
     return result;
   } else if (Heap::InToPage(object)) {
     // Already updated slot. This can happen when processing of the work list
@@ -473,74 +478,43 @@ class ScavengeVisitor final : public NewSpaceVisitor<ScavengeVisitor> {
  public:
   explicit ScavengeVisitor(Scavenger* scavenger);
 
-  V8_INLINE void VisitPointers(HeapObject host, ObjectSlot start,
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                                ObjectSlot end) final;
 
-  V8_INLINE void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                                MaybeObjectSlot end) final;
-  V8_INLINE void VisitCodePointer(Code host, CodeObjectSlot slot) final;
-
-  V8_INLINE void VisitCodeTarget(RelocInfo* rinfo) final;
-  V8_INLINE void VisitEmbeddedPointer(RelocInfo* rinfo) final;
-  V8_INLINE int VisitEphemeronHashTable(Map map, EphemeronHashTable object);
-  V8_INLINE int VisitJSArrayBuffer(Map map, JSArrayBuffer object);
-  V8_INLINE int VisitJSApiObject(Map map, JSObject object);
+  V8_INLINE int VisitEphemeronHashTable(Tagged<Map> map,
+                                        Tagged<EphemeronHashTable> object);
+  V8_INLINE int VisitJSArrayBuffer(Tagged<Map> map,
+                                   Tagged<JSArrayBuffer> object);
+  V8_INLINE int VisitJSApiObject(Tagged<Map> map, Tagged<JSObject> object);
 
  private:
   template <typename TSlot>
-  V8_INLINE void VisitHeapObjectImpl(TSlot slot, HeapObject heap_object);
+  V8_INLINE void VisitHeapObjectImpl(TSlot slot,
+                                     Tagged<HeapObject> heap_object);
 
   template <typename TSlot>
-  V8_INLINE void VisitPointersImpl(HeapObject host, TSlot start, TSlot end);
+  V8_INLINE void VisitPointersImpl(Tagged<HeapObject> host, TSlot start,
+                                   TSlot end);
 
   Scavenger* const scavenger_;
 };
 
-void ScavengeVisitor::VisitPointers(HeapObject host, ObjectSlot start,
+void ScavengeVisitor::VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                                     ObjectSlot end) {
   return VisitPointersImpl(host, start, end);
 }
 
-void ScavengeVisitor::VisitPointers(HeapObject host, MaybeObjectSlot start,
+void ScavengeVisitor::VisitPointers(Tagged<HeapObject> host,
+                                    MaybeObjectSlot start,
                                     MaybeObjectSlot end) {
   return VisitPointersImpl(host, start, end);
 }
 
-void ScavengeVisitor::VisitCodePointer(Code host, CodeObjectSlot slot) {
-  CHECK(V8_EXTERNAL_CODE_SPACE_BOOL);
-  // InstructionStream slots never appear in new space because
-  // Code objects, the only object that can contain code pointers, are
-  // always allocated in the old space.
-  UNREACHABLE();
-}
-
-void ScavengeVisitor::VisitCodeTarget(RelocInfo* rinfo) {
-  InstructionStream target =
-      InstructionStream::FromTargetAddress(rinfo->target_address());
-#ifdef DEBUG
-  InstructionStream old_target = target;
-#endif
-  FullObjectSlot slot(&target);
-  VisitHeapObjectImpl(slot, target);
-  // InstructionStream objects are never in new-space, so the slot contents must
-  // not change.
-  DCHECK_EQ(old_target, target);
-}
-
-void ScavengeVisitor::VisitEmbeddedPointer(RelocInfo* rinfo) {
-  HeapObject heap_object = rinfo->target_object(cage_base());
-#ifdef DEBUG
-  HeapObject old_heap_object = heap_object;
-#endif
-  FullObjectSlot slot(&heap_object);
-  VisitHeapObjectImpl(slot, heap_object);
-  // We don't embed new-space objects into code, so the slot contents must not
-  // change.
-  DCHECK_EQ(old_heap_object, heap_object);
-}
-
 template <typename TSlot>
-void ScavengeVisitor::VisitHeapObjectImpl(TSlot slot, HeapObject heap_object) {
+void ScavengeVisitor::VisitHeapObjectImpl(TSlot slot,
+                                          Tagged<HeapObject> heap_object) {
   if (Heap::InYoungGeneration(heap_object)) {
     using THeapObjectSlot = typename TSlot::THeapObjectSlot;
     scavenger_->ScavengeObject(THeapObjectSlot(slot), heap_object);
@@ -548,11 +522,11 @@ void ScavengeVisitor::VisitHeapObjectImpl(TSlot slot, HeapObject heap_object) {
 }
 
 template <typename TSlot>
-void ScavengeVisitor::VisitPointersImpl(HeapObject host, TSlot start,
+void ScavengeVisitor::VisitPointersImpl(Tagged<HeapObject> host, TSlot start,
                                         TSlot end) {
   for (TSlot slot = start; slot < end; ++slot) {
     typename TSlot::TObject object = *slot;
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
     // Treat weak references as strong.
     if (object.GetHeapObject(&heap_object)) {
       VisitHeapObjectImpl(slot, heap_object);
@@ -560,30 +534,32 @@ void ScavengeVisitor::VisitPointersImpl(HeapObject host, TSlot start,
   }
 }
 
-int ScavengeVisitor::VisitJSArrayBuffer(Map map, JSArrayBuffer object) {
-  object.YoungMarkExtension();
+int ScavengeVisitor::VisitJSArrayBuffer(Tagged<Map> map,
+                                        Tagged<JSArrayBuffer> object) {
+  object->YoungMarkExtension();
   int size = JSArrayBuffer::BodyDescriptor::SizeOf(map, object);
   JSArrayBuffer::BodyDescriptor::IterateBody(map, object, size, this);
   return size;
 }
 
-int ScavengeVisitor::VisitJSApiObject(Map map, JSObject object) {
+int ScavengeVisitor::VisitJSApiObject(Tagged<Map> map,
+                                      Tagged<JSObject> object) {
   return VisitJSObject(map, object);
 }
 
-int ScavengeVisitor::VisitEphemeronHashTable(Map map,
-                                             EphemeronHashTable table) {
+int ScavengeVisitor::VisitEphemeronHashTable(Tagged<Map> map,
+                                             Tagged<EphemeronHashTable> table) {
   // Register table with the scavenger, so it can take care of the weak keys
   // later. This allows to only iterate the tables' values, which are treated
   // as strong independently of whether the key is live.
   scavenger_->AddEphemeronHashTable(table);
-  for (InternalIndex i : table.IterateEntries()) {
+  for (InternalIndex i : table->IterateEntries()) {
     ObjectSlot value_slot =
-        table.RawFieldOfElementAt(EphemeronHashTable::EntryToValueIndex(i));
+        table->RawFieldOfElementAt(EphemeronHashTable::EntryToValueIndex(i));
     VisitPointer(table, value_slot);
   }
 
-  return table.SizeFromMap(map);
+  return table->SizeFromMap(map);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/heap/scavenger.cc b/deps/v8/src/heap/scavenger.cc
index a96286e74ba5fc..7760a6a540e1e5 100644
--- a/deps/v8/src/heap/scavenger.cc
+++ b/deps/v8/src/heap/scavenger.cc
@@ -8,14 +8,16 @@
 #include "src/handles/global-handles.h"
 #include "src/heap/array-buffer-sweeper.h"
 #include "src/heap/concurrent-allocator.h"
+#include "src/heap/concurrent-marking.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/gc-tracer-inl.h"
 #include "src/heap/gc-tracer.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap.h"
-#include "src/heap/invalidated-slots-inl.h"
 #include "src/heap/mark-compact-inl.h"
 #include "src/heap/mark-compact.h"
 #include "src/heap/memory-chunk-inl.h"
+#include "src/heap/memory-chunk-layout.h"
 #include "src/heap/memory-chunk.h"
 #include "src/heap/objects-visiting-inl.h"
 #include "src/heap/pretenuring-handler.h"
@@ -40,51 +42,30 @@ class IterateAndScavengePromotedObjectsVisitor final : public ObjectVisitor {
                                            bool record_slots)
       : scavenger_(scavenger), record_slots_(record_slots) {}
 
-  V8_INLINE void VisitMapPointer(HeapObject host) final {
+  V8_INLINE void VisitMapPointer(Tagged<HeapObject> host) final {
     if (!record_slots_) return;
-    MapWord map_word = host.map_word(kRelaxedLoad);
+    MapWord map_word = host->map_word(kRelaxedLoad);
     if (map_word.IsForwardingAddress()) {
       // Surviving new large objects have forwarding pointers in the map word.
       DCHECK(MemoryChunk::FromHeapObject(host)->InNewLargeObjectSpace());
       return;
     }
-    HandleSlot(host, HeapObjectSlot(host.map_slot()), map_word.ToMap());
+    HandleSlot(host, HeapObjectSlot(host->map_slot()), map_word.ToMap());
   }
 
-  V8_INLINE void VisitPointers(HeapObject host, ObjectSlot start,
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                                ObjectSlot end) final {
     VisitPointersImpl(host, start, end);
   }
 
-  V8_INLINE void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                                MaybeObjectSlot end) final {
     VisitPointersImpl(host, start, end);
   }
 
-  V8_INLINE void VisitCodePointer(Code host, CodeObjectSlot slot) final {
-    CHECK(V8_EXTERNAL_CODE_SPACE_BOOL);
-    // InstructionStream slots never appear in new space because
-    // Code objects, the only object that can contain code pointers, are
-    // always allocated in the old space.
-    UNREACHABLE();
-  }
-
-  V8_INLINE void VisitCodeTarget(RelocInfo* rinfo) final {
-    InstructionStream target =
-        InstructionStream::FromTargetAddress(rinfo->target_address());
-    HandleSlot(rinfo->instruction_stream(), FullHeapObjectSlot(&target),
-               target);
-  }
-  V8_INLINE void VisitEmbeddedPointer(RelocInfo* rinfo) final {
-    PtrComprCageBase cage_base = GetPtrComprCageBase(rinfo->code());
-    HeapObject heap_object = rinfo->target_object(cage_base);
-    HandleSlot(rinfo->instruction_stream(), FullHeapObjectSlot(&heap_object),
-               heap_object);
-  }
-
-  inline void VisitEphemeron(HeapObject obj, int entry, ObjectSlot key,
+  inline void VisitEphemeron(Tagged<HeapObject> obj, int entry, ObjectSlot key,
                              ObjectSlot value) override {
-    DCHECK(Heap::IsLargeObject(obj) || obj.IsEphemeronHashTable());
+    DCHECK(Heap::IsLargeObject(obj) || IsEphemeronHashTable(obj));
     VisitPointer(obj, value);
 
     if (ObjectInYoungGeneration(*key)) {
@@ -96,15 +77,29 @@ class IterateAndScavengePromotedObjectsVisitor final : public ObjectVisitor {
     }
   }
 
+  // Special cases: Unreachable visitors for objects that are never found in the
+  // young generation and thus cannot be found when iterating promoted objects.
+  void VisitInstructionStreamPointer(Tagged<Code>,
+                                     InstructionStreamSlot) final {
+    UNREACHABLE();
+  }
+  void VisitCodeTarget(Tagged<InstructionStream>, RelocInfo*) final {
+    UNREACHABLE();
+  }
+  void VisitEmbeddedPointer(Tagged<InstructionStream>, RelocInfo*) final {
+    UNREACHABLE();
+  }
+
  private:
   template <typename TSlot>
-  V8_INLINE void VisitPointersImpl(HeapObject host, TSlot start, TSlot end) {
+  V8_INLINE void VisitPointersImpl(Tagged<HeapObject> host, TSlot start,
+                                   TSlot end) {
     using THeapObjectSlot = typename TSlot::THeapObjectSlot;
     // Treat weak references as strong.
     // TODO(marja): Proper weakness handling in the young generation.
     for (TSlot slot = start; slot < end; ++slot) {
       typename TSlot::TObject object = *slot;
-      HeapObject heap_object;
+      Tagged<HeapObject> heap_object;
       if (object.GetHeapObject(&heap_object)) {
         HandleSlot(host, THeapObjectSlot(slot), heap_object);
       }
@@ -112,8 +107,8 @@ class IterateAndScavengePromotedObjectsVisitor final : public ObjectVisitor {
   }
 
   template <typename THeapObjectSlot>
-  V8_INLINE void HandleSlot(HeapObject host, THeapObjectSlot slot,
-                            HeapObject target) {
+  V8_INLINE void HandleSlot(Tagged<HeapObject> host, THeapObjectSlot slot,
+                            Tagged<HeapObject> target) {
     static_assert(
         std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
             std::is_same<THeapObjectSlot, HeapObjectSlot>::value,
@@ -122,12 +117,12 @@ class IterateAndScavengePromotedObjectsVisitor final : public ObjectVisitor {
 
     if (Heap::InFromPage(target)) {
       SlotCallbackResult result = scavenger_->ScavengeObject(slot, target);
-      bool success = (*slot)->GetHeapObject(&target);
+      bool success = (*slot).GetHeapObject(&target);
       USE(success);
       DCHECK(success);
 
       if (result == KEEP_SLOT) {
-        SLOW_DCHECK(target.IsHeapObject());
+        SLOW_DCHECK(IsHeapObject(target));
         MemoryChunk* chunk = MemoryChunk::FromHeapObject(host);
 
         // Sweeper is stopped during scavenge, so we can directly
@@ -167,15 +162,17 @@ class IterateAndScavengePromotedObjectsVisitor final : public ObjectVisitor {
 
 namespace {
 
-V8_INLINE bool IsUnscavengedHeapObject(Heap* heap, Object object) {
-  return Heap::InFromPage(object) &&
-         !HeapObject::cast(object).map_word(kRelaxedLoad).IsForwardingAddress();
+V8_INLINE bool IsUnscavengedHeapObject(Heap* heap, Tagged<Object> object) {
+  return Heap::InFromPage(object) && !HeapObject::cast(object)
+                                          ->map_word(kRelaxedLoad)
+                                          .IsForwardingAddress();
 }
 
 // Same as IsUnscavengedHeapObject() above but specialized for HeapObjects.
-V8_INLINE bool IsUnscavengedHeapObject(Heap* heap, HeapObject heap_object) {
+V8_INLINE bool IsUnscavengedHeapObject(Heap* heap,
+                                       Tagged<HeapObject> heap_object) {
   return Heap::InFromPage(heap_object) &&
-         !heap_object.map_word(kRelaxedLoad).IsForwardingAddress();
+         !heap_object->map_word(kRelaxedLoad).IsForwardingAddress();
 }
 
 bool IsUnscavengedHeapObjectSlot(Heap* heap, FullObjectSlot p) {
@@ -196,22 +193,24 @@ ScavengerCollector::JobTask::JobTask(
       remaining_memory_chunks_(memory_chunks_.size()),
       generator_(memory_chunks_.size()),
       copied_list_(copied_list),
-      promotion_list_(promotion_list) {}
+      promotion_list_(promotion_list),
+      trace_id_(
+          reinterpret_cast<uint64_t>(this) ^
+          outer_->heap_->tracer()->CurrentEpoch(GCTracer::Scope::SCAVENGER)) {}
 
 void ScavengerCollector::JobTask::Run(JobDelegate* delegate) {
-  // The task accesses code pages and thus the permissions must be set to
-  // default state.
-  RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
   DCHECK_LT(delegate->GetTaskId(), scavengers_->size());
   Scavenger* scavenger = (*scavengers_)[delegate->GetTaskId()].get();
   if (delegate->IsJoiningThread()) {
-    // This is already traced in GCTracer::Scope::SCAVENGER_SCAVENGE_PARALLEL
-    // in ScavengerCollector::CollectGarbage.
+    TRACE_GC_WITH_FLOW(outer_->heap_->tracer(),
+                       GCTracer::Scope::SCAVENGER_SCAVENGE_PARALLEL, trace_id_,
+                       TRACE_EVENT_FLAG_FLOW_IN);
     ProcessItems(delegate, scavenger);
   } else {
-    TRACE_GC_EPOCH(outer_->heap_->tracer(),
-                   GCTracer::Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL,
-                   ThreadKind::kBackground);
+    TRACE_GC_EPOCH_WITH_FLOW(
+        outer_->heap_->tracer(),
+        GCTracer::Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL,
+        ThreadKind::kBackground, trace_id_, TRACE_EVENT_FLAG_FLOW_IN);
     ProcessItems(delegate, scavenger);
   }
 }
@@ -220,11 +219,13 @@ size_t ScavengerCollector::JobTask::GetMaxConcurrency(
     size_t worker_count) const {
   // We need to account for local segments held by worker_count in addition to
   // GlobalPoolSize() of copied_list_ and promotion_list_.
-  return std::min<size_t>(
-      scavengers_->size(),
-      std::max<size_t>(
-          remaining_memory_chunks_.load(std::memory_order_relaxed),
-          worker_count + copied_list_->Size() + promotion_list_->Size()));
+  size_t wanted_num_workers = std::max<size_t>(
+      remaining_memory_chunks_.load(std::memory_order_relaxed),
+      worker_count + copied_list_->Size() + promotion_list_->Size());
+  if (!outer_->heap_->ShouldUseBackgroundThreads()) {
+    return std::min<size_t>(wanted_num_workers, 1);
+  }
+  return std::min<size_t>(scavengers_->size(), wanted_num_workers);
 }
 
 void ScavengerCollector::JobTask::ProcessItems(JobDelegate* delegate,
@@ -282,20 +283,20 @@ class GlobalHandlesWeakRootsUpdatingVisitor final : public RootVisitor {
 
  private:
   void UpdatePointer(FullObjectSlot p) {
-    Object object = *p;
+    Tagged<Object> object = *p;
     DCHECK(!HasWeakHeapObjectTag(object));
     // The object may be in the old generation as global handles over
     // approximates the list of young nodes. This checks also bails out for
     // Smis.
     if (!Heap::InYoungGeneration(object)) return;
 
-    HeapObject heap_object = HeapObject::cast(object);
+    Tagged<HeapObject> heap_object = HeapObject::cast(object);
     // TODO(chromium:1336158): Turn the following CHECKs into DCHECKs after
     // flushing out potential issues.
     CHECK(Heap::InFromPage(heap_object));
-    MapWord first_word = heap_object.map_word(kRelaxedLoad);
+    MapWord first_word = heap_object->map_word(kRelaxedLoad);
     CHECK(first_word.IsForwardingAddress());
-    HeapObject dest = first_word.ToForwardingAddress(heap_object);
+    Tagged<HeapObject> dest = first_word.ToForwardingAddress(heap_object);
     HeapObjectReference::Update(FullHeapObjectSlot(p), dest);
     CHECK_IMPLIES(Heap::InYoungGeneration(dest),
                   Heap::InToPage(dest) || Heap::IsLargeObject(dest));
@@ -327,22 +328,9 @@ void ScavengerCollector::CollectGarbage() {
   const int num_scavenge_tasks = NumberOfScavengeTasks();
   Scavenger::CopiedList copied_list;
   Scavenger::PromotionList promotion_list;
-  EphemeronTableList ephemeron_table_list;
+  EphemeronRememberedSet::TableList ephemeron_table_list;
 
   {
-    Sweeper* sweeper = heap_->sweeper();
-
-    // Pause the concurrent sweeper.
-    Sweeper::PauseScope pause_scope(sweeper);
-    // Filter out pages from the sweeper that need to be processed for old to
-    // new slots by the Scavenger. After processing, the Scavenger adds back
-    // pages that are still unsweeped. This way the Scavenger has exclusive
-    // access to the slots of a page and can completely avoid any locks on
-    // the page itself.
-    Sweeper::FilterSweepingPagesScope filter_scope(sweeper, pause_scope);
-    filter_scope.FilterOldSpaceSweepingPages(
-        [](Page* page) { return !page->ContainsSlots<OLD_TO_NEW>(); });
-
     const bool is_logging = isolate_->log_object_relocation();
     for (int i = 0; i < num_scavenge_tasks; ++i) {
       scavengers.emplace_back(
@@ -351,9 +339,13 @@ void ScavengerCollector::CollectGarbage() {
     }
 
     std::vector<std::pair<ParallelWorkItem, MemoryChunk*>> memory_chunks;
-    RememberedSet<OLD_TO_NEW>::IterateMemoryChunks(
+    OldGenerationMemoryChunkIterator::ForAll(
         heap_, [&memory_chunks](MemoryChunk* chunk) {
-          memory_chunks.emplace_back(ParallelWorkItem{}, chunk);
+          if (chunk->slot_set<OLD_TO_NEW>() ||
+              chunk->typed_slot_set<OLD_TO_NEW>() ||
+              chunk->slot_set<OLD_TO_NEW_BACKGROUND>()) {
+            memory_chunks.emplace_back(ParallelWorkItem{}, chunk);
+          }
         });
 
     RootScavengeVisitor root_scavenge_visitor(scavengers[kMainThreadId].get());
@@ -374,7 +366,8 @@ void ScavengerCollector::CollectGarbage() {
       // global handles separately.
       base::EnumSet<SkipRoot> options(
           {SkipRoot::kExternalStringTable, SkipRoot::kGlobalHandles,
-           SkipRoot::kOldGeneration, SkipRoot::kConservativeStack});
+           SkipRoot::kTracedHandles, SkipRoot::kOldGeneration,
+           SkipRoot::kConservativeStack, SkipRoot::kReadOnlyBuiltins});
       if (V8_UNLIKELY(v8_flags.scavenge_separate_stack_scanning)) {
         options.Add(SkipRoot::kStack);
       }
@@ -386,12 +379,16 @@ void ScavengerCollector::CollectGarbage() {
     }
     {
       // Parallel phase scavenging all copied and promoted objects.
-      TRACE_GC(heap_->tracer(), GCTracer::Scope::SCAVENGER_SCAVENGE_PARALLEL);
+      TRACE_GC_ARG1(
+          heap_->tracer(), GCTracer::Scope::SCAVENGER_SCAVENGE_PARALLEL_PHASE,
+          "UseBackgroundThreads", heap_->ShouldUseBackgroundThreads());
+      auto job =
+          std::make_unique<JobTask>(this, &scavengers, std::move(memory_chunks),
+                                    &copied_list, &promotion_list);
+      TRACE_GC_NOTE_WITH_FLOW("Parallel scavenge started", job->trace_id(),
+                              TRACE_EVENT_FLAG_FLOW_OUT);
       V8::GetCurrentPlatform()
-          ->CreateJob(v8::TaskPriority::kUserBlocking,
-                      std::make_unique<JobTask>(this, &scavengers,
-                                                std::move(memory_chunks),
-                                                &copied_list, &promotion_list))
+          ->CreateJob(v8::TaskPriority::kUserBlocking, std::move(job))
           ->Join();
       DCHECK(copied_list.IsEmpty());
       DCHECK(promotion_list.IsEmpty());
@@ -436,7 +433,7 @@ void ScavengerCollector::CollectGarbage() {
     heap_->UpdateYoungReferencesInExternalStringTable(
         &Heap::UpdateYoungReferenceInExternalStringTableEntry);
 
-    heap_->incremental_marking()->UpdateMarkingWorklistAfterYoungGenGC();
+    heap_->incremental_marking()->UpdateMarkingWorklistAfterScavenge();
 
     if (V8_UNLIKELY(v8_flags.track_retaining_path)) {
       heap_->UpdateRetainersAfterScavenge();
@@ -467,7 +464,8 @@ void ScavengerCollector::CollectGarbage() {
   // Since we promote all surviving large objects immediately, all remaining
   // large objects must be dead.
   // TODO(hpayer): Don't free all as soon as we have an intermediate generation.
-  heap_->new_lo_space()->FreeDeadObjects([](HeapObject) { return true; });
+  heap_->new_lo_space()->FreeDeadObjects(
+      [](Tagged<HeapObject>) { return true; });
 
   {
     TRACE_GC(heap_->tracer(), GCTracer::Scope::SCAVENGER_FREE_REMEMBERED_SET);
@@ -478,15 +476,20 @@ void ScavengerCollector::CollectGarbage() {
       // swept.
       if (chunk->SweepingDone()) {
         RememberedSet<OLD_TO_NEW>::CheckPossiblyEmptyBuckets(chunk);
+        RememberedSet<OLD_TO_NEW_BACKGROUND>::CheckPossiblyEmptyBuckets(chunk);
       } else {
         chunk->possibly_empty_buckets()->Release();
       }
     }
 
 #ifdef DEBUG
-    RememberedSet<OLD_TO_NEW>::IterateMemoryChunks(
+    OldGenerationMemoryChunkIterator::ForAll(
         heap_, [](MemoryChunk* chunk) {
-          DCHECK(chunk->possibly_empty_buckets()->IsEmpty());
+          if (chunk->slot_set<OLD_TO_NEW>() ||
+              chunk->typed_slot_set<OLD_TO_NEW>() ||
+              chunk->slot_set<OLD_TO_NEW_BACKGROUND>()) {
+            DCHECK(chunk->possibly_empty_buckets()->IsEmpty());
+          }
         });
 #endif
   }
@@ -547,20 +550,20 @@ void ScavengerCollector::SweepArrayBufferExtensions() {
 
 void ScavengerCollector::HandleSurvivingNewLargeObjects() {
   const bool is_compacting = heap_->incremental_marking()->IsCompacting();
-  AtomicMarkingState* marking_state = heap_->atomic_marking_state();
+  MarkingState* marking_state = heap_->marking_state();
 
   for (SurvivingNewLargeObjectMapEntry update_info :
        surviving_new_large_objects_) {
-    HeapObject object = update_info.first;
-    Map map = update_info.second;
+    Tagged<HeapObject> object = update_info.first;
+    Tagged<Map> map = update_info.second;
     // Order is important here. We have to re-install the map to have access
     // to meta-data like size during page promotion.
-    object.set_map_word(map, kRelaxedStore);
+    object->set_map_word(map, kRelaxedStore);
 
     if (is_compacting && marking_state->IsMarked(object) &&
         MarkCompactCollector::IsOnEvacuationCandidate(map)) {
       RememberedSet<OLD_TO_OLD>::Insert<AccessMode::ATOMIC>(
-          MemoryChunk::FromHeapObject(object), object.map_slot().address());
+          MemoryChunk::FromHeapObject(object), object->map_slot().address());
     }
     LargePage* page = LargePage::FromHeapObject(object);
     heap_->lo_space()->PromoteNewLargeObject(page);
@@ -611,22 +614,13 @@ ConcurrentAllocator* CreateSharedOldAllocator(Heap* heap) {
   return nullptr;
 }
 
-// This returns true if the scavenger runs in a client isolate and incremental
-// marking is enabled in the shared space isolate.
-bool IsSharedIncrementalMarking(Isolate* isolate) {
-  return isolate->has_shared_space() && !isolate->is_shared_space_isolate() &&
-         isolate->shared_space_isolate()
-             ->heap()
-             ->incremental_marking()
-             ->IsMarking();
-}
-
 }  // namespace
 
 Scavenger::Scavenger(ScavengerCollector* collector, Heap* heap, bool is_logging,
                      EmptyChunksList* empty_chunks, CopiedList* copied_list,
                      PromotionList* promotion_list,
-                     EphemeronTableList* ephemeron_table_list, int task_id)
+                     EphemeronRememberedSet::TableList* ephemeron_table_list,
+                     int task_id)
     : collector_(collector),
       heap_(heap),
       empty_chunks_local_(*empty_chunks),
@@ -642,15 +636,16 @@ Scavenger::Scavenger(ScavengerCollector* collector, Heap* heap, bool is_logging,
       is_logging_(is_logging),
       is_incremental_marking_(heap->incremental_marking()->IsMarking()),
       is_compacting_(heap->incremental_marking()->IsCompacting()),
-      shared_string_table_(shared_old_allocator_.get() != nullptr),
+      shared_string_table_(shared_old_allocator_ != nullptr),
       mark_shared_heap_(heap->isolate()->is_shared_space_isolate()),
       shortcut_strings_(
-          (!heap->IsGCWithStack() || v8_flags.shortcut_strings_with_stack) &&
-          !is_incremental_marking_ &&
-          !IsSharedIncrementalMarking(heap->isolate())) {}
+          heap->CanShortcutStringsDuringGC(GarbageCollector::SCAVENGER)) {
+  DCHECK_IMPLIES(is_incremental_marking_,
+                 heap->incremental_marking()->IsMajorMarking());
+}
 
-void Scavenger::IterateAndScavengePromotedObject(HeapObject target, Map map,
-                                                 int size) {
+void Scavenger::IterateAndScavengePromotedObject(Tagged<HeapObject> target,
+                                                 Tagged<Map> map, int size) {
   // We are not collecting slots on new space objects during mutation thus we
   // have to scan for pointers to evacuation candidates when we promote
   // objects. But we should not record any slots in non-black objects. Grey
@@ -658,32 +653,24 @@ void Scavenger::IterateAndScavengePromotedObject(HeapObject target, Map map,
   // the end of collection it would be a violation of the invariant to record
   // its slots.
   const bool record_slots =
-      is_compacting_ && heap()->atomic_marking_state()->IsMarked(target);
+      is_compacting_ && heap()->marking_state()->IsMarked(target);
 
   IterateAndScavengePromotedObjectsVisitor visitor(this, record_slots);
 
   // Iterate all outgoing pointers including map word.
-  target.IterateFast(map, size, &visitor);
+  target->IterateFast(map, size, &visitor);
 
-  if (map.IsJSArrayBufferMap()) {
+  if (IsJSArrayBufferMap(map)) {
     DCHECK(!BasicMemoryChunk::FromHeapObject(target)->IsLargePage());
-    JSArrayBuffer::cast(target).YoungMarkExtensionPromoted();
+    JSArrayBuffer::cast(target)->YoungMarkExtensionPromoted();
   }
 }
 
-void Scavenger::RememberPromotedEphemeron(EphemeronHashTable table, int entry) {
+void Scavenger::RememberPromotedEphemeron(Tagged<EphemeronHashTable> table,
+                                          int index) {
   auto indices =
       ephemeron_remembered_set_.insert({table, std::unordered_set<int>()});
-  indices.first->second.insert(entry);
-}
-
-void Scavenger::AddPageToSweeperIfNecessary(MemoryChunk* page) {
-  AllocationSpace space = page->owner_identity();
-  if ((space == OLD_SPACE) && !page->SweepingDone()) {
-    heap()->sweeper()->AddPage(space, reinterpret_cast<Page*>(page),
-                               Sweeper::READD_TEMPORARY_REMOVED_PAGE,
-                               AccessMode::ATOMIC);
-  }
+  indices.first->second.insert(index);
 }
 
 void Scavenger::ScavengePage(MemoryChunk* page) {
@@ -691,17 +678,13 @@ void Scavenger::ScavengePage(MemoryChunk* page) {
   const bool record_old_to_shared_slots = heap_->isolate()->has_shared_space();
 
   if (page->slot_set<OLD_TO_NEW, AccessMode::ATOMIC>() != nullptr) {
-    InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToNew(
-        page, InvalidatedSlotsFilter::LivenessCheck::kNo);
     RememberedSet<OLD_TO_NEW>::IterateAndTrackEmptyBuckets(
         page,
-        [this, page, record_old_to_shared_slots,
-         &filter](MaybeObjectSlot slot) {
-          if (!filter.IsValid(slot.address())) return REMOVE_SLOT;
+        [this, page, record_old_to_shared_slots](MaybeObjectSlot slot) {
           SlotCallbackResult result = CheckAndScavengeObject(heap_, slot);
           // A new space string might have been promoted into the shared heap
           // during GC.
-          if (record_old_to_shared_slots) {
+          if (result == REMOVE_SLOT && record_old_to_shared_slots) {
             CheckOldToNewSlotForSharedUntyped(page, slot);
           }
           return result;
@@ -709,12 +692,6 @@ void Scavenger::ScavengePage(MemoryChunk* page) {
         &empty_chunks_local_);
   }
 
-  if (page->invalidated_slots<OLD_TO_NEW>() != nullptr) {
-    // The invalidated slots are not needed after old-to-new slots were
-    // processed.
-    page->ReleaseInvalidatedSlots<OLD_TO_NEW>();
-  }
-
   RememberedSet<OLD_TO_NEW>::IterateTyped(
       page, [this, page, record_old_to_shared_slots](SlotType slot_type,
                                                      Address slot_address) {
@@ -725,7 +702,7 @@ void Scavenger::ScavengePage(MemoryChunk* page) {
               SlotCallbackResult result = CheckAndScavengeObject(heap(), slot);
               // A new space string might have been promoted into the shared
               // heap during GC.
-              if (record_old_to_shared_slots) {
+              if (result == REMOVE_SLOT && record_old_to_shared_slots) {
                 CheckOldToNewSlotForSharedTyped(page, slot_type, slot_address,
                                                 *slot);
               }
@@ -733,7 +710,20 @@ void Scavenger::ScavengePage(MemoryChunk* page) {
             });
       });
 
-  AddPageToSweeperIfNecessary(page);
+  if (page->slot_set<OLD_TO_NEW_BACKGROUND, AccessMode::ATOMIC>() != nullptr) {
+    RememberedSet<OLD_TO_NEW_BACKGROUND>::IterateAndTrackEmptyBuckets(
+        page,
+        [this, page, record_old_to_shared_slots](MaybeObjectSlot slot) {
+          SlotCallbackResult result = CheckAndScavengeObject(heap_, slot);
+          // A new space string might have been promoted into the shared heap
+          // during GC.
+          if (result == REMOVE_SLOT && record_old_to_shared_slots) {
+            CheckOldToNewSlotForSharedUntyped(page, slot);
+          }
+          return result;
+        },
+        &empty_chunks_local_);
+  }
 }
 
 void Scavenger::Process(JobDelegate* delegate) {
@@ -757,7 +747,7 @@ void Scavenger::Process(JobDelegate* delegate) {
 
     struct PromotionListEntry entry;
     while (promotion_list_local_.Pop(&entry)) {
-      HeapObject target = entry.heap_object;
+      Tagged<HeapObject> target = entry.heap_object;
       IterateAndScavengePromotedObject(target, entry.map, entry.size);
       done = false;
       if (delegate && ((++objects % kInterruptThreshold) == 0)) {
@@ -770,7 +760,7 @@ void Scavenger::Process(JobDelegate* delegate) {
 }
 
 void ScavengerCollector::ProcessWeakReferences(
-    EphemeronTableList* ephemeron_table_list) {
+    EphemeronRememberedSet::TableList* ephemeron_table_list) {
   ClearYoungEphemerons(ephemeron_table_list);
   ClearOldEphemerons();
 }
@@ -778,17 +768,17 @@ void ScavengerCollector::ProcessWeakReferences(
 // Clear ephemeron entries from EphemeronHashTables in new-space whenever the
 // entry has a dead new-space key.
 void ScavengerCollector::ClearYoungEphemerons(
-    EphemeronTableList* ephemeron_table_list) {
-  ephemeron_table_list->Iterate([this](EphemeronHashTable table) {
-    for (InternalIndex i : table.IterateEntries()) {
+    EphemeronRememberedSet::TableList* ephemeron_table_list) {
+  ephemeron_table_list->Iterate([this](Tagged<EphemeronHashTable> table) {
+    for (InternalIndex i : table->IterateEntries()) {
       // Keys in EphemeronHashTables must be heap objects.
       HeapObjectSlot key_slot(
-          table.RawFieldOfElementAt(EphemeronHashTable::EntryToIndex(i)));
-      HeapObject key = key_slot.ToHeapObject();
+          table->RawFieldOfElementAt(EphemeronHashTable::EntryToIndex(i)));
+      Tagged<HeapObject> key = key_slot.ToHeapObject();
       if (IsUnscavengedHeapObject(heap_, key)) {
-        table.RemoveEntry(i);
+        table->RemoveEntry(i);
       } else {
-        HeapObject forwarded = ForwardingAddress(key);
+        Tagged<HeapObject> forwarded = ForwardingAddress(key);
         key_slot.StoreHeapObject(forwarded);
       }
     }
@@ -799,20 +789,20 @@ void ScavengerCollector::ClearYoungEphemerons(
 // Clear ephemeron entries from EphemeronHashTables in old-space whenever the
 // entry has a dead new-space key.
 void ScavengerCollector::ClearOldEphemerons() {
-  for (auto it = heap_->ephemeron_remembered_set_.begin();
-       it != heap_->ephemeron_remembered_set_.end();) {
-    EphemeronHashTable table = it->first;
+  auto* table_map = heap_->ephemeron_remembered_set_->tables();
+  for (auto it = table_map->begin(); it != table_map->end();) {
+    Tagged<EphemeronHashTable> table = it->first;
     auto& indices = it->second;
     for (auto iti = indices.begin(); iti != indices.end();) {
       // Keys in EphemeronHashTables must be heap objects.
-      HeapObjectSlot key_slot(table.RawFieldOfElementAt(
+      HeapObjectSlot key_slot(table->RawFieldOfElementAt(
           EphemeronHashTable::EntryToIndex(InternalIndex(*iti))));
-      HeapObject key = key_slot.ToHeapObject();
+      Tagged<HeapObject> key = key_slot.ToHeapObject();
       if (IsUnscavengedHeapObject(heap_, key)) {
-        table.RemoveEntry(InternalIndex(*iti));
+        table->RemoveEntry(InternalIndex(*iti));
         iti = indices.erase(iti);
       } else {
-        HeapObject forwarded = ForwardingAddress(key);
+        Tagged<HeapObject> forwarded = ForwardingAddress(key);
         key_slot.StoreHeapObject(forwarded);
         if (!Heap::InYoungGeneration(forwarded)) {
           iti = indices.erase(iti);
@@ -822,8 +812,8 @@ void ScavengerCollector::ClearOldEphemerons() {
       }
     }
 
-    if (indices.size() == 0) {
-      it = heap_->ephemeron_remembered_set_.erase(it);
+    if (indices.empty()) {
+      it = table_map->erase(it);
     } else {
       ++it;
     }
@@ -842,11 +832,10 @@ void Scavenger::Finalize() {
   ephemeron_table_list_local_.Publish();
   for (auto it = ephemeron_remembered_set_.begin();
        it != ephemeron_remembered_set_.end(); ++it) {
-    auto insert_result = heap()->ephemeron_remembered_set_.insert(
-        {it->first, std::unordered_set<int>()});
-    for (int entry : it->second) {
-      insert_result.first->second.insert(entry);
-    }
+    DCHECK_IMPLIES(!MemoryChunk::FromHeapObject(it->first)->IsLargePage(),
+                   !Heap::InYoungGeneration(it->first));
+    heap()->ephemeron_remembered_set()->RecordEphemeronKeyWrites(
+        it->first, std::move(it->second));
   }
 }
 
@@ -855,7 +844,7 @@ void Scavenger::Publish() {
   promotion_list_local_.Publish();
 }
 
-void Scavenger::AddEphemeronHashTable(EphemeronHashTable table) {
+void Scavenger::AddEphemeronHashTable(Tagged<EphemeronHashTable> table) {
   ephemeron_table_list_local_.Push(table);
 }
 
@@ -863,7 +852,7 @@ template <typename TSlot>
 void Scavenger::CheckOldToNewSlotForSharedUntyped(MemoryChunk* chunk,
                                                   TSlot slot) {
   MaybeObject object = *slot;
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
 
   if (object.GetHeapObject(&heap_object) &&
       heap_object.InWritableSharedSpace()) {
@@ -876,7 +865,7 @@ void Scavenger::CheckOldToNewSlotForSharedTyped(MemoryChunk* chunk,
                                                 SlotType slot_type,
                                                 Address slot_address,
                                                 MaybeObject new_target) {
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
 
   if (new_target.GetHeapObject(&heap_object) &&
       heap_object.InWritableSharedSpace()) {
@@ -906,7 +895,7 @@ void RootScavengeVisitor::VisitRootPointers(Root root, const char* description,
 }
 
 void RootScavengeVisitor::ScavengePointer(FullObjectSlot p) {
-  Object object = *p;
+  Tagged<Object> object = *p;
   DCHECK(!HasWeakHeapObjectTag(object));
   DCHECK(!MapWord::IsPacked(object.ptr()));
   if (Heap::InYoungGeneration(object)) {
diff --git a/deps/v8/src/heap/scavenger.h b/deps/v8/src/heap/scavenger.h
index 43f7660ab7ed09..80f4cbf7a4b889 100644
--- a/deps/v8/src/heap/scavenger.h
+++ b/deps/v8/src/heap/scavenger.h
@@ -7,6 +7,7 @@
 
 #include "src/base/platform/condition-variable.h"
 #include "src/heap/base/worklist.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/evacuation-allocator.h"
 #include "src/heap/index-generator.h"
 #include "src/heap/memory-chunk.h"
@@ -33,16 +34,12 @@ using SurvivingNewLargeObjectsMap =
     std::unordered_map<HeapObject, Map, Object::Hasher>;
 using SurvivingNewLargeObjectMapEntry = std::pair<HeapObject, Map>;
 
-constexpr int kEphemeronTableListSegmentSize = 128;
-using EphemeronTableList =
-    ::heap::base::Worklist<EphemeronHashTable, kEphemeronTableListSegmentSize>;
-
 class ScavengerCollector;
 
 class Scavenger {
  public:
   struct PromotionListEntry {
-    HeapObject heap_object;
+    Tagged<HeapObject> heap_object;
     Map map;
     int size;
   };
@@ -63,8 +60,9 @@ class Scavenger {
      public:
       explicit Local(PromotionList* promotion_list);
 
-      inline void PushRegularObject(HeapObject object, int size);
-      inline void PushLargeObject(HeapObject object, Map map, int size);
+      inline void PushRegularObject(Tagged<HeapObject> object, int size);
+      inline void PushLargeObject(Tagged<HeapObject> object, Tagged<Map> map,
+                                  int size);
       inline size_t LocalPushSegmentSize() const;
       inline bool Pop(struct PromotionListEntry* entry);
       inline bool IsGlobalPoolEmpty() const;
@@ -93,7 +91,8 @@ class Scavenger {
   Scavenger(ScavengerCollector* collector, Heap* heap, bool is_logging,
             EmptyChunksList* empty_chunks, CopiedList* copied_list,
             PromotionList* promotion_list,
-            EphemeronTableList* ephemeron_table_list, int task_id);
+            EphemeronRememberedSet::TableList* ephemeron_table_list,
+            int task_id);
 
   // Entry point for scavenging an old generation page. For scavenging single
   // objects see RootScavengingVisitor and ScavengeVisitor below.
@@ -107,7 +106,7 @@ class Scavenger {
   void Finalize();
   void Publish();
 
-  void AddEphemeronHashTable(EphemeronHashTable table);
+  void AddEphemeronHashTable(Tagged<EphemeronHashTable> table);
 
   size_t bytes_copied() const { return copied_size_; }
   size_t bytes_promoted() const { return promoted_size_; }
@@ -141,67 +140,71 @@ class Scavenger {
   // to be in from space.
   template <typename THeapObjectSlot>
   inline SlotCallbackResult ScavengeObject(THeapObjectSlot p,
-                                           HeapObject object);
+                                           Tagged<HeapObject> object);
 
   // Copies |source| to |target| and sets the forwarding pointer in |source|.
-  V8_INLINE bool MigrateObject(Map map, HeapObject source, HeapObject target,
-                               int size,
+  V8_INLINE bool MigrateObject(Tagged<Map> map, Tagged<HeapObject> source,
+                               Tagged<HeapObject> target, int size,
                                PromotionHeapChoice promotion_heap_choice);
 
   V8_INLINE SlotCallbackResult
   RememberedSetEntryNeeded(CopyAndForwardResult result);
 
   template <typename THeapObjectSlot>
-  V8_INLINE CopyAndForwardResult
-  SemiSpaceCopyObject(Map map, THeapObjectSlot slot, HeapObject object,
-                      int object_size, ObjectFields object_fields);
+  V8_INLINE CopyAndForwardResult SemiSpaceCopyObject(
+      Tagged<Map> map, THeapObjectSlot slot, Tagged<HeapObject> object,
+      int object_size, ObjectFields object_fields);
 
   template <typename THeapObjectSlot,
             PromotionHeapChoice promotion_heap_choice = kPromoteIntoLocalHeap>
-  V8_INLINE CopyAndForwardResult PromoteObject(Map map, THeapObjectSlot slot,
-                                               HeapObject object,
+  V8_INLINE CopyAndForwardResult PromoteObject(Tagged<Map> map,
+                                               THeapObjectSlot slot,
+                                               Tagged<HeapObject> object,
                                                int object_size,
                                                ObjectFields object_fields);
 
   template <typename THeapObjectSlot>
-  V8_INLINE SlotCallbackResult EvacuateObject(THeapObjectSlot slot, Map map,
-                                              HeapObject source);
+  V8_INLINE SlotCallbackResult EvacuateObject(THeapObjectSlot slot,
+                                              Tagged<Map> map,
+                                              Tagged<HeapObject> source);
 
-  V8_INLINE bool HandleLargeObject(Map map, HeapObject object, int object_size,
-                                   ObjectFields object_fields);
+  V8_INLINE bool HandleLargeObject(Tagged<Map> map, Tagged<HeapObject> object,
+                                   int object_size, ObjectFields object_fields);
 
   // Different cases for object evacuation.
   template <typename THeapObjectSlot,
             PromotionHeapChoice promotion_heap_choice = kPromoteIntoLocalHeap>
-  V8_INLINE SlotCallbackResult
-  EvacuateObjectDefault(Map map, THeapObjectSlot slot, HeapObject object,
-                        int object_size, ObjectFields object_fields);
+  V8_INLINE SlotCallbackResult EvacuateObjectDefault(
+      Tagged<Map> map, THeapObjectSlot slot, Tagged<HeapObject> object,
+      int object_size, ObjectFields object_fields);
 
   template <typename THeapObjectSlot>
-  inline SlotCallbackResult EvacuateThinString(Map map, THeapObjectSlot slot,
-                                               ThinString object,
+  inline SlotCallbackResult EvacuateThinString(Tagged<Map> map,
+                                               THeapObjectSlot slot,
+                                               Tagged<ThinString> object,
                                                int object_size);
 
   template <typename THeapObjectSlot>
-  inline SlotCallbackResult EvacuateShortcutCandidate(Map map,
+  inline SlotCallbackResult EvacuateShortcutCandidate(Tagged<Map> map,
                                                       THeapObjectSlot slot,
-                                                      ConsString object,
+                                                      Tagged<ConsString> object,
                                                       int object_size);
 
   template <typename THeapObjectSlot>
   inline SlotCallbackResult EvacuateInPlaceInternalizableString(
-      Map map, THeapObjectSlot slot, String string, int object_size,
-      ObjectFields object_fields);
+      Tagged<Map> map, THeapObjectSlot slot, Tagged<String> string,
+      int object_size, ObjectFields object_fields);
 
-  void IterateAndScavengePromotedObject(HeapObject target, Map map, int size);
-  void RememberPromotedEphemeron(EphemeronHashTable table, int index);
+  void IterateAndScavengePromotedObject(Tagged<HeapObject> target,
+                                        Tagged<Map> map, int size);
+  void RememberPromotedEphemeron(Tagged<EphemeronHashTable> table, int index);
 
   ScavengerCollector* const collector_;
   Heap* const heap_;
   EmptyChunksList::Local empty_chunks_local_;
   PromotionList::Local promotion_list_local_;
   CopiedList::Local copied_list_local_;
-  EphemeronTableList::Local ephemeron_table_list_local_;
+  EphemeronRememberedSet::TableList::Local ephemeron_table_list_local_;
   PretenuringHandler* const pretenuring_handler_;
   PretenuringHandler::PretenuringFeedbackMap local_pretenuring_feedback_;
   size_t copied_size_;
@@ -210,7 +213,7 @@ class Scavenger {
   std::unique_ptr<ConcurrentAllocator> shared_old_allocator_;
   SurvivingNewLargeObjectsMap surviving_new_large_objects_;
 
-  EphemeronRememberedSet ephemeron_remembered_set_;
+  EphemeronRememberedSet::TableMap ephemeron_remembered_set_;
   const bool is_logging_;
   const bool is_incremental_marking_;
   const bool is_compacting_;
@@ -262,6 +265,8 @@ class ScavengerCollector {
     void Run(JobDelegate* delegate) override;
     size_t GetMaxConcurrency(size_t worker_count) const override;
 
+    uint64_t trace_id() const { return trace_id_; }
+
    private:
     void ProcessItems(JobDelegate* delegate, Scavenger* scavenger);
     void ConcurrentScavengePages(Scavenger* scavenger);
@@ -275,6 +280,8 @@ class ScavengerCollector {
 
     Scavenger::CopiedList* copied_list_;
     Scavenger::PromotionList* promotion_list_;
+
+    const uint64_t trace_id_;
   };
 
   void MergeSurvivingNewLargeObjects(
@@ -282,8 +289,10 @@ class ScavengerCollector {
 
   int NumberOfScavengeTasks();
 
-  void ProcessWeakReferences(EphemeronTableList* ephemeron_table_list);
-  void ClearYoungEphemerons(EphemeronTableList* ephemeron_table_list);
+  void ProcessWeakReferences(
+      EphemeronRememberedSet::TableList* ephemeron_table_list);
+  void ClearYoungEphemerons(
+      EphemeronRememberedSet::TableList* ephemeron_table_list);
   void ClearOldEphemerons();
   void HandleSurvivingNewLargeObjects();
 
diff --git a/deps/v8/src/heap/setup-heap-internal.cc b/deps/v8/src/heap/setup-heap-internal.cc
index 3f217e64411e13..9f51a70c46ce84 100644
--- a/deps/v8/src/heap/setup-heap-internal.cc
+++ b/deps/v8/src/heap/setup-heap-internal.cc
@@ -2,6 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include "src/api/api-natives.h"
+#include "src/api/api.h"
 #include "src/builtins/accessors.h"
 #include "src/codegen/compilation-cache.h"
 #include "src/execution/isolate.h"
@@ -24,7 +26,9 @@
 #include "src/objects/foreign.h"
 #include "src/objects/heap-number.h"
 #include "src/objects/instance-type-inl.h"
+#include "src/objects/js-atomics-synchronization.h"
 #include "src/objects/js-generator.h"
+#include "src/objects/js-shared-array.h"
 #include "src/objects/js-weak-refs.h"
 #include "src/objects/literal-objects-inl.h"
 #include "src/objects/lookup-cache.h"
@@ -71,6 +75,8 @@ Handle<SharedFunctionInfo> CreateSharedFunctionInfo(
 #ifdef DEBUG
 bool IsMutableMap(InstanceType instance_type, ElementsKind elements_kind) {
   bool is_js_object = InstanceTypeChecker::IsJSObject(instance_type);
+  bool is_always_shared_space_js_object =
+      InstanceTypeChecker::IsAlwaysSharedSpaceJSObject(instance_type);
   bool is_wasm_object = false;
 #if V8_ENABLE_WEBASSEMBLY
   is_wasm_object =
@@ -79,10 +85,12 @@ bool IsMutableMap(InstanceType instance_type, ElementsKind elements_kind) {
   DCHECK_IMPLIES(is_js_object &&
                      !Map::CanHaveFastTransitionableElementsKind(instance_type),
                  IsDictionaryElementsKind(elements_kind) ||
-                     IsTerminalElementsKind(elements_kind));
+                     IsTerminalElementsKind(elements_kind) ||
+                     (is_always_shared_space_js_object &&
+                      elements_kind == SHARED_ARRAY_ELEMENTS));
   // JSObjects have maps with a mutable prototype_validity_cell, so they cannot
   // go in RO_SPACE. Maps for managed Wasm objects have mutable subtype lists.
-  return is_js_object || is_wasm_object;
+  return (is_js_object && !is_always_shared_space_js_object) || is_wasm_object;
 }
 #endif
 
@@ -182,10 +190,17 @@ bool Heap::CreateReadOnlyHeapObjects() {
   USE(ro_space);
 #endif
 
-  if (!CreateLateReadOnlyMaps()) return false;
+  if (!CreateLateReadOnlyNonJSReceiverMaps()) return false;
   CreateReadOnlyApiObjects();
   if (!CreateReadOnlyObjects()) return false;
 
+  // Order is important. JSReceiver maps must come after all non-JSReceiver maps
+  // in RO space with a sufficiently large gap in address. Currently there are
+  // no JSReceiver instances in RO space.
+  //
+  // See InstanceTypeChecker::kNonJsReceiverMapLimit.
+  if (!CreateLateReadOnlyJSReceiverMaps()) return false;
+
 #ifdef DEBUG
   ReadOnlyRoots roots(isolate());
   for (auto pos = RootIndex::kFirstReadOnlyRoot;
@@ -212,7 +227,7 @@ bool Heap::CreateMutableHeapObjects() {
                  message_object)
     ALLOCATE_MAP(JS_EXTERNAL_OBJECT_TYPE, JSExternalObject::kHeaderSize,
                  external)
-    external_map().set_is_extensible(false);
+    external_map()->set_is_extensible(false);
   }
 #undef ALLOCATE_MAP
 
@@ -241,16 +256,16 @@ AllocationResult Heap::AllocateMap(AllocationType allocation_type,
                                    ElementsKind elements_kind,
                                    int inobject_properties) {
   static_assert(LAST_JS_OBJECT_TYPE == LAST_TYPE);
-  HeapObject result;
+  Tagged<HeapObject> result;
   DCHECK_EQ(allocation_type, IsMutableMap(instance_type, elements_kind)
                                  ? AllocationType::kMap
                                  : AllocationType::kReadOnly);
   AllocationResult allocation = AllocateRaw(Map::kSize, allocation_type);
   if (!allocation.To(&result)) return allocation;
 
-  result.set_map_after_allocation(ReadOnlyRoots(this).meta_map(),
-                                  SKIP_WRITE_BARRIER);
-  Map map = isolate()->factory()->InitializeMap(
+  result->set_map_after_allocation(ReadOnlyRoots(this).meta_map(),
+                                   SKIP_WRITE_BARRIER);
+  Tagged<Map> map = isolate()->factory()->InitializeMap(
       Map::cast(result), instance_type, instance_size, elements_kind,
       inobject_properties, this);
 
@@ -259,71 +274,71 @@ AllocationResult Heap::AllocateMap(AllocationType allocation_type,
 
 AllocationResult Heap::AllocatePartialMap(InstanceType instance_type,
                                           int instance_size) {
-  Object result;
+  Tagged<Object> result;
   AllocationResult allocation =
       AllocateRaw(Map::kSize, AllocationType::kReadOnly);
   if (!allocation.To(&result)) return allocation;
   // Map::cast cannot be used due to uninitialized map field.
-  Map map = Map::unchecked_cast(result);
-  map.set_map_after_allocation(
+  Tagged<Map> map = Map::unchecked_cast(result);
+  map->set_map_after_allocation(
       Map::unchecked_cast(isolate()->root(RootIndex::kMetaMap)),
       SKIP_WRITE_BARRIER);
-  map.set_instance_type(instance_type);
-  map.set_instance_size(instance_size);
-  map.set_visitor_id(Map::GetVisitorId(map));
-  map.set_inobject_properties_start_or_constructor_function_index(0);
-  DCHECK(!map.IsJSObjectMap());
-  map.set_prototype_validity_cell(Smi::FromInt(Map::kPrototypeChainValid),
-                                  kRelaxedStore);
-  map.SetInObjectUnusedPropertyFields(0);
-  map.set_bit_field(0);
-  map.set_bit_field2(0);
+  map->set_instance_type(instance_type);
+  map->set_instance_size(instance_size);
+  map->set_visitor_id(Map::GetVisitorId(map));
+  map->set_inobject_properties_start_or_constructor_function_index(0);
+  DCHECK(!IsJSObjectMap(map));
+  map->set_prototype_validity_cell(Smi::FromInt(Map::kPrototypeChainValid),
+                                   kRelaxedStore);
+  map->SetInObjectUnusedPropertyFields(0);
+  map->set_bit_field(0);
+  map->set_bit_field2(0);
   int bit_field3 =
       Map::Bits3::EnumLengthBits::encode(kInvalidEnumCacheSentinel) |
       Map::Bits3::OwnsDescriptorsBit::encode(true) |
       Map::Bits3::ConstructionCounterBits::encode(Map::kNoSlackTracking);
-  map.set_bit_field3(bit_field3);
-  DCHECK(!map.is_in_retained_map_list());
-  map.clear_padding();
-  map.set_elements_kind(TERMINAL_FAST_ELEMENTS_KIND);
+  map->set_bit_field3(bit_field3);
+  DCHECK(!map->is_in_retained_map_list());
+  map->clear_padding();
+  map->set_elements_kind(TERMINAL_FAST_ELEMENTS_KIND);
   return AllocationResult::FromObject(map);
 }
 
-void Heap::FinalizePartialMap(Map map) {
+void Heap::FinalizePartialMap(Tagged<Map> map) {
   ReadOnlyRoots roots(this);
-  map.set_dependent_code(DependentCode::empty_dependent_code(roots));
-  map.set_raw_transitions(MaybeObject::FromSmi(Smi::zero()));
-  map.SetInstanceDescriptors(isolate(), roots.empty_descriptor_array(), 0);
-  map.init_prototype_and_constructor_or_back_pointer(roots);
+  map->set_dependent_code(DependentCode::empty_dependent_code(roots));
+  map->set_raw_transitions(MaybeObject::FromSmi(Smi::zero()));
+  map->SetInstanceDescriptors(isolate(), roots.empty_descriptor_array(), 0);
+  map->init_prototype_and_constructor_or_back_pointer(roots);
 }
 
 AllocationResult Heap::Allocate(Handle<Map> map,
                                 AllocationType allocation_type) {
   DCHECK(map->instance_type() != MAP_TYPE);
   int size = map->instance_size();
-  HeapObject result;
+  Tagged<HeapObject> result;
   AllocationResult allocation = AllocateRaw(size, allocation_type);
   if (!allocation.To(&result)) return allocation;
   // New space objects are allocated white.
   WriteBarrierMode write_barrier_mode =
       allocation_type == AllocationType::kYoung ? SKIP_WRITE_BARRIER
                                                 : UPDATE_WRITE_BARRIER;
-  result.set_map_after_allocation(*map, write_barrier_mode);
+  result->set_map_after_allocation(*map, write_barrier_mode);
   return AllocationResult::FromObject(result);
 }
 
 bool Heap::CreateEarlyReadOnlyMaps() {
   // Setup maps which are used often, or used in CreateImportantReadOnlyObjects.
   ReadOnlyRoots roots(this);
-  HeapObject obj;
+  Tagged<HeapObject> obj;
   {
     AllocationResult allocation = AllocatePartialMap(MAP_TYPE, Map::kSize);
     if (!allocation.To(&obj)) return false;
   }
   // Map::cast cannot be used due to uninitialized map field.
-  Map new_meta_map = Map::unchecked_cast(obj);
+  Tagged<Map> new_meta_map = Map::unchecked_cast(obj);
   set_meta_map(new_meta_map);
-  new_meta_map.set_map_after_allocation(new_meta_map);
+  new_meta_map->set_map_after_allocation(new_meta_map);
 
 #define ALLOCATE_PARTIAL_MAP(instance_type, size, field_name)                \
   {                                                                          \
@@ -347,12 +362,12 @@ bool Heap::CreateEarlyReadOnlyMaps() {
 
     ALLOCATE_PARTIAL_MAP(ODDBALL_TYPE, Oddball::kSize, undefined);
     ALLOCATE_PARTIAL_MAP(ODDBALL_TYPE, Oddball::kSize, null);
-    ALLOCATE_PARTIAL_MAP(ODDBALL_TYPE, Oddball::kSize, the_hole);
+    ALLOCATE_PARTIAL_MAP(HOLE_TYPE, Hole::kSize, hole);
 
     // Some struct maps which we need for later dependencies
     for (const StructInit& entry : kStructTable) {
       if (!is_important_struct(entry.type)) continue;
-      Map map;
+      Tagged<Map> map;
       if (!AllocatePartialMap(entry.type, entry.size).To(&map)) return false;
       roots_table()[entry.index] = map.ptr();
     }
@@ -363,8 +378,8 @@ bool Heap::CreateEarlyReadOnlyMaps() {
     AllocationResult alloc =
         AllocateRaw(FixedArray::SizeFor(0), AllocationType::kReadOnly);
     if (!alloc.To(&obj)) return false;
-    obj.set_map_after_allocation(roots.fixed_array_map(), SKIP_WRITE_BARRIER);
-    FixedArray::cast(obj).set_length(0);
+    obj->set_map_after_allocation(roots.fixed_array_map(), SKIP_WRITE_BARRIER);
+    FixedArray::cast(obj)->set_length(0);
   }
   set_empty_fixed_array(FixedArray::cast(obj));
 
@@ -372,9 +387,9 @@ bool Heap::CreateEarlyReadOnlyMaps() {
     AllocationResult alloc =
         AllocateRaw(WeakFixedArray::SizeFor(0), AllocationType::kReadOnly);
     if (!alloc.To(&obj)) return false;
-    obj.set_map_after_allocation(roots.weak_fixed_array_map(),
-                                 SKIP_WRITE_BARRIER);
-    WeakFixedArray::cast(obj).set_length(0);
+    obj->set_map_after_allocation(roots.weak_fixed_array_map(),
+                                  SKIP_WRITE_BARRIER);
+    WeakFixedArray::cast(obj)->set_length(0);
   }
   set_empty_weak_fixed_array(WeakFixedArray::cast(obj));
 
@@ -382,10 +397,10 @@ bool Heap::CreateEarlyReadOnlyMaps() {
     AllocationResult allocation = AllocateRaw(WeakArrayList::SizeForCapacity(0),
                                               AllocationType::kReadOnly);
     if (!allocation.To(&obj)) return false;
-    obj.set_map_after_allocation(roots.weak_array_list_map(),
-                                 SKIP_WRITE_BARRIER);
-    WeakArrayList::cast(obj).set_capacity(0);
-    WeakArrayList::cast(obj).set_length(0);
+    obj->set_map_after_allocation(roots.weak_array_list_map(),
+                                  SKIP_WRITE_BARRIER);
+    WeakArrayList::cast(obj)->set_capacity(0);
+    WeakArrayList::cast(obj)->set_length(0);
   }
   set_empty_weak_array_list(WeakArrayList::cast(obj));
 
@@ -394,24 +409,23 @@ bool Heap::CreateEarlyReadOnlyMaps() {
         Allocate(roots.null_map_handle(), AllocationType::kReadOnly);
     if (!allocation.To(&obj)) return false;
   }
-  set_null_value(Oddball::cast(obj));
-  Oddball::cast(obj).set_kind(Oddball::kNull);
+  set_null_value(Null::unchecked_cast(obj));
+  Oddball::cast(obj)->set_kind(Oddball::kNull);
 
   {
     AllocationResult allocation =
         Allocate(roots.undefined_map_handle(), AllocationType::kReadOnly);
     if (!allocation.To(&obj)) return false;
   }
-  set_undefined_value(Oddball::cast(obj));
-  Oddball::cast(obj).set_kind(Oddball::kUndefined);
+  set_undefined_value(Undefined::unchecked_cast(obj));
+  Oddball::cast(obj)->set_kind(Oddball::kUndefined);
   DCHECK(!InYoungGeneration(roots.undefined_value()));
   {
     AllocationResult allocation =
-        Allocate(roots.the_hole_map_handle(), AllocationType::kReadOnly);
+        Allocate(roots.hole_map_handle(), AllocationType::kReadOnly);
     if (!allocation.To(&obj)) return false;
   }
-  set_the_hole_value(Oddball::cast(obj));
-  Oddball::cast(obj).set_kind(Oddball::kTheHole);
+  set_the_hole_value(Hole::cast(obj));
 
   // Set preliminary exception sentinel value before actually initializing it.
   set_exception(roots.null_value());
@@ -423,18 +437,18 @@ bool Heap::CreateEarlyReadOnlyMaps() {
     if (!allocation.To(&obj)) return false;
   }
   set_empty_enum_cache(EnumCache::cast(obj));
-  EnumCache::cast(obj).set_keys(roots.empty_fixed_array());
-  EnumCache::cast(obj).set_indices(roots.empty_fixed_array());
+  EnumCache::cast(obj)->set_keys(roots.empty_fixed_array());
+  EnumCache::cast(obj)->set_indices(roots.empty_fixed_array());
 
   // Allocate the empty descriptor array.
   {
     int size = DescriptorArray::SizeFor(0);
     if (!AllocateRaw(size, AllocationType::kReadOnly).To(&obj)) return false;
-    obj.set_map_after_allocation(roots.descriptor_array_map(),
-                                 SKIP_WRITE_BARRIER);
-    DescriptorArray array = DescriptorArray::cast(obj);
-    array.Initialize(roots.empty_enum_cache(), roots.undefined_value(), 0, 0,
-                     DescriptorArrayMarkingState::kInitialGCState);
+    obj->set_map_after_allocation(roots.descriptor_array_map(),
+                                  SKIP_WRITE_BARRIER);
+    Tagged<DescriptorArray> array = DescriptorArray::cast(obj);
+    array->Initialize(roots.empty_enum_cache(), roots.undefined_value(), 0, 0,
+                      DescriptorArrayMarkingState::kInitialGCState);
   }
   set_empty_descriptor_array(DescriptorArray::cast(obj));
 
@@ -446,10 +460,10 @@ bool Heap::CreateEarlyReadOnlyMaps() {
   FinalizePartialMap(roots.fixed_cow_array_map());
   FinalizePartialMap(roots.descriptor_array_map());
   FinalizePartialMap(roots.undefined_map());
-  roots.undefined_map().set_is_undetectable(true);
+  roots.undefined_map()->set_is_undetectable(true);
   FinalizePartialMap(roots.null_map());
-  roots.null_map().set_is_undetectable(true);
-  FinalizePartialMap(roots.the_hole_map());
+  roots.null_map()->set_is_undetectable(true);
+  FinalizePartialMap(roots.hole_map());
   for (const StructInit& entry : kStructTable) {
     if (!is_important_struct(entry.type)) continue;
     FinalizePartialMap(Map::cast(roots.object_at(entry.index)));
@@ -472,7 +486,7 @@ bool Heap::CreateEarlyReadOnlyMaps() {
                                constructor_function_index)      \
   {                                                             \
     ALLOCATE_MAP((instance_type), (size), field_name);          \
-    roots.field_name##_map().SetConstructorFunctionIndex(       \
+    roots.field_name##_map()->SetConstructorFunctionIndex(      \
         (constructor_function_index));                          \
   }
 
@@ -503,20 +517,20 @@ bool Heap::CreateEarlyReadOnlyMaps() {
                            Context::SYMBOL_FUNCTION_INDEX)
 
     for (const StringTypeInit& entry : kStringTypeTable) {
-      Map map;
+      Tagged<Map> map;
       if (!AllocateMap(AllocationType::kReadOnly, entry.type, entry.size)
                .To(&map)) {
         return false;
       }
-      map.SetConstructorFunctionIndex(Context::STRING_FUNCTION_INDEX);
+      map->SetConstructorFunctionIndex(Context::STRING_FUNCTION_INDEX);
       // Mark cons string maps as unstable, because their objects can change
       // maps during GC.
-      if (StringShape(entry.type).IsCons()) map.mark_unstable();
+      if (StringShape(entry.type).IsCons()) map->mark_unstable();
       roots_table()[entry.index] = map.ptr();
     }
 
     ALLOCATE_VARSIZE_MAP(FIXED_DOUBLE_ARRAY_TYPE, fixed_double_array)
-    roots.fixed_double_array_map().set_elements_kind(HOLEY_DOUBLE_ELEMENTS);
+    roots.fixed_double_array_map()->set_elements_kind(HOLEY_DOUBLE_ELEMENTS);
     ALLOCATE_VARSIZE_MAP(FEEDBACK_METADATA_TYPE, feedback_metadata)
     ALLOCATE_VARSIZE_MAP(BYTE_ARRAY_TYPE, byte_array)
     ALLOCATE_VARSIZE_MAP(BYTECODE_ARRAY_TYPE, bytecode_array)
@@ -532,12 +546,12 @@ bool Heap::CreateEarlyReadOnlyMaps() {
     ALLOCATE_MAP(CELL_TYPE, Cell::kSize, cell);
     {
       // The invalid_prototype_validity_cell is needed for JSObject maps.
-      Smi value = Smi::FromInt(Map::kPrototypeChainInvalid);
+      Tagged<Smi> value = Smi::FromInt(Map::kPrototypeChainInvalid);
       AllocationResult alloc =
           AllocateRaw(Cell::kSize, AllocationType::kReadOnly);
       if (!alloc.To(&obj)) return false;
-      obj.set_map_after_allocation(roots.cell_map(), SKIP_WRITE_BARRIER);
-      Cell::cast(obj).set_value(value);
+      obj->set_map_after_allocation(roots.cell_map(), SKIP_WRITE_BARRIER);
+      Cell::cast(obj)->set_value(value);
       set_invalid_prototype_validity_cell(Cell::cast(obj));
     }
 
@@ -549,10 +563,10 @@ bool Heap::CreateEarlyReadOnlyMaps() {
     // to be marked unstable because their objects can change maps.
     ALLOCATE_MAP(FEEDBACK_CELL_TYPE, FeedbackCell::kAlignedSize,
                  no_closures_cell)
-    roots.no_closures_cell_map().mark_unstable();
+    roots.no_closures_cell_map()->mark_unstable();
     ALLOCATE_MAP(FEEDBACK_CELL_TYPE, FeedbackCell::kAlignedSize,
                  one_closure_cell)
-    roots.one_closure_cell_map().mark_unstable();
+    roots.one_closure_cell_map()->mark_unstable();
     ALLOCATE_MAP(FEEDBACK_CELL_TYPE, FeedbackCell::kAlignedSize,
                  many_closures_cell)
 
@@ -580,13 +594,13 @@ bool Heap::CreateEarlyReadOnlyMaps() {
   }
 }
 
-bool Heap::CreateLateReadOnlyMaps() {
+bool Heap::CreateLateReadOnlyNonJSReceiverMaps() {
   ReadOnlyRoots roots(this);
   {
     // Setup the struct maps.
     for (const StructInit& entry : kStructTable) {
       if (is_important_struct(entry.type)) continue;
-      Map map;
+      Tagged<Map> map;
       if (!AllocateMap(AllocationType::kReadOnly, entry.type, entry.size)
                .To(&map))
         return false;
@@ -628,8 +642,6 @@ bool Heap::CreateLateReadOnlyMaps() {
                  side_effect_call_handler_info)
     ALLOCATE_MAP(CALL_HANDLER_INFO_TYPE, CallHandlerInfo::kSize,
                  side_effect_free_call_handler_info)
-    ALLOCATE_MAP(CALL_HANDLER_INFO_TYPE, CallHandlerInfo::kSize,
-                 next_call_side_effect_free_call_handler_info)
 
     ALLOCATE_MAP(SOURCE_TEXT_MODULE_TYPE, SourceTextModule::kSize,
                  source_text_module)
@@ -655,7 +667,59 @@ bool Heap::CreateLateReadOnlyMaps() {
     IF_WASM(ALLOCATE_MAP, WASM_NULL_TYPE, kVariableSizeSentinel, wasm_null);
 
     ALLOCATE_MAP(WEAK_CELL_TYPE, WeakCell::kSize, weak_cell)
+    ALLOCATE_VARSIZE_MAP(EXTERNAL_POINTER_ARRAY_TYPE, external_pointer_array)
+  }
+
+  return true;
+}
+
+bool Heap::CreateLateReadOnlyJSReceiverMaps() {
+#define ALLOCATE_ALWAYS_SHARED_SPACE_JSOBJECT_MAP(instance_type, size, \
+                                                  field_name)          \
+  {                                                                    \
+    Map map;                                                           \
+    if (!AllocateMap(AllocationType::kReadOnly, (instance_type), size, \
+                     DICTIONARY_ELEMENTS)                              \
+             .To(&map)) {                                              \
+      return false;                                                    \
+    }                                                                  \
+    AlwaysSharedSpaceJSObject::PrepareMapNoEnumerableProperties(map);  \
+    set_##field_name##_map(map);                                       \
+  }
+
+  HandleScope late_jsreceiver_maps_handle_scope(isolate());
+  Factory* factory = isolate()->factory();
+  ReadOnlyRoots roots(this);
+
+  // Shared space object maps are immutable and can be in RO space.
+  {
+    Tagged<Map> shared_array_map;
+    if (!AllocateMap(AllocationType::kReadOnly, JS_SHARED_ARRAY_TYPE,
+                     JSSharedArray::kSize, SHARED_ARRAY_ELEMENTS,
+                     JSSharedArray::kInObjectFieldCount)
+             .To(&shared_array_map)) {
+      return false;
+    }
+    AlwaysSharedSpaceJSObject::PrepareMapNoEnumerableProperties(
+        shared_array_map);
+    Handle<DescriptorArray> descriptors =
+        factory->NewDescriptorArray(1, 0, AllocationType::kReadOnly);
+    Descriptor length_descriptor = Descriptor::DataField(
+        factory->length_string(), JSSharedArray::kLengthFieldIndex,
+        ALL_ATTRIBUTES_MASK, PropertyConstness::kConst, Representation::Smi(),
+        MaybeObjectHandle(FieldType::Any(isolate())));
+    descriptors->Set(InternalIndex(0), &length_descriptor);
+    shared_array_map->InitializeDescriptors(isolate(), *descriptors);
+    set_js_shared_array_map(shared_array_map);
   }
+
+  ALLOCATE_ALWAYS_SHARED_SPACE_JSOBJECT_MAP(
+      JS_ATOMICS_MUTEX_TYPE, JSAtomicsMutex::kHeaderSize, js_atomics_mutex)
+  ALLOCATE_ALWAYS_SHARED_SPACE_JSOBJECT_MAP(JS_ATOMICS_CONDITION_TYPE,
+                                            JSAtomicsCondition::kHeaderSize,
+                                            js_atomics_condition)
+
+#undef ALLOCATE_ALWAYS_SHARED_SPACE_JSOBJECT_MAP
 #undef ALLOCATE_PRIMITIVE_MAP
 #undef ALLOCATE_VARSIZE_MAP
 #undef ALLOCATE_MAP
@@ -663,30 +727,33 @@ bool Heap::CreateLateReadOnlyMaps() {
   return true;
 }
 
+// For static roots we need the r/o space to have identical layout on all
+// compile targets. Varying objects are padded to their biggest size.
+void Heap::StaticRootsEnsureAllocatedSize(Handle<HeapObject> obj,
+                                          int required) {
+  if (V8_STATIC_ROOTS_BOOL || V8_STATIC_ROOTS_GENERATION_BOOL) {
+    int obj_size = obj->Size();
+    if (required == obj_size) return;
+    CHECK_LT(obj_size, required);
+    int filler_size = required - obj_size;
+
+    Tagged<HeapObject> filler =
+        allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
+            filler_size, AllocationType::kReadOnly, AllocationOrigin::kRuntime,
+            AllocationAlignment::kTaggedAligned);
+    CreateFillerObjectAt(filler.address(), filler_size,
+                         ClearFreedMemoryMode::kClearFreedMemory);
+
+    CHECK_EQ(filler.address(), obj->address() + obj_size);
+    CHECK_EQ(filler.address() + filler->Size(), obj->address() + required);
+  }
+}
+
 bool Heap::CreateImportantReadOnlyObjects() {
-  // Allocate some objects early to get addreses to fit as arm64 immediates
-  HeapObject obj;
+  // Allocate some objects early to get addresses to fit as arm64 immediates.
+  Tagged<HeapObject> obj;
   ReadOnlyRoots roots(isolate());
 
-  // For static roots we need the r/o space to have identical layout on all
-  // compile targets. Varying objects are padded to their biggest size.
-  auto StaticRootsEnsureAllocatedSize = [&](HeapObject obj, int required) {
-    if (V8_STATIC_ROOTS_BOOL || v8_flags.static_roots_src) {
-      if (required == obj.Size()) return;
-      CHECK_LT(obj.Size(), required);
-      int filler_size = required - obj.Size();
-
-      HeapObject filler =
-          allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
-              filler_size, AllocationType::kReadOnly,
-              AllocationOrigin::kRuntime, AllocationAlignment::kTaggedAligned);
-      CreateFillerObjectAt(filler.address(), filler_size,
-                           ClearFreedMemoryMode::kClearFreedMemory);
-
-      CHECK_EQ(filler.address() + filler.Size(), obj.address() + required);
-    }
-  };
-
   // Bools
 
   HandleScope initial_objects_handle_scope(isolate());
@@ -695,16 +762,16 @@ bool Heap::CreateImportantReadOnlyObjects() {
         Allocate(roots.boolean_map_handle(), AllocationType::kReadOnly);
     if (!allocation.To(&obj)) return false;
   }
-  set_true_value(Oddball::cast(obj));
-  Oddball::cast(obj).set_kind(Oddball::kTrue);
+  set_true_value(True::unchecked_cast(obj));
+  Oddball::cast(obj)->set_kind(Oddball::kTrue);
 
   {
     AllocationResult allocation =
         Allocate(roots.boolean_map_handle(), AllocationType::kReadOnly);
     if (!allocation.To(&obj)) return false;
   }
-  set_false_value(Oddball::cast(obj));
-  Oddball::cast(obj).set_kind(Oddball::kFalse);
+  set_false_value(False::unchecked_cast(obj));
+  Oddball::cast(obj)->set_kind(Oddball::kFalse);
 
   // Hash seed for strings
 
@@ -742,18 +809,11 @@ bool Heap::CreateImportantReadOnlyObjects() {
           .ToHandleChecked();
   set_empty_ordered_property_dictionary(*empty_ordered_property_dictionary);
 
-  // Allocate the empty SwissNameDictionary
-  Handle<SwissNameDictionary> empty_swiss_property_dictionary =
-      factory->CreateCanonicalEmptySwissNameDictionary();
-  set_empty_swiss_property_dictionary(*empty_swiss_property_dictionary);
-  StaticRootsEnsureAllocatedSize(*empty_swiss_property_dictionary,
-                                 8 * kTaggedSize);
-
   {
     if (!AllocateRaw(ByteArray::SizeFor(0), AllocationType::kReadOnly).To(&obj))
       return false;
-    obj.set_map_after_allocation(roots.byte_array_map(), SKIP_WRITE_BARRIER);
-    ByteArray::cast(obj).set_length(0);
+    obj->set_map_after_allocation(roots.byte_array_map(), SKIP_WRITE_BARRIER);
+    ByteArray::cast(obj)->set_length(0);
     set_empty_byte_array(ByteArray::cast(obj));
   }
 
@@ -762,16 +822,16 @@ bool Heap::CreateImportantReadOnlyObjects() {
         AllocateRaw(ScopeInfo::SizeFor(ScopeInfo::kVariablePartIndex),
                     AllocationType::kReadOnly);
     if (!alloc.To(&obj)) return false;
-    obj.set_map_after_allocation(roots.scope_info_map(), SKIP_WRITE_BARRIER);
+    obj->set_map_after_allocation(roots.scope_info_map(), SKIP_WRITE_BARRIER);
     int flags = ScopeInfo::IsEmptyBit::encode(true);
     DCHECK_EQ(ScopeInfo::LanguageModeBit::decode(flags), LanguageMode::kSloppy);
     DCHECK_EQ(ScopeInfo::ReceiverVariableBits::decode(flags),
               VariableAllocationInfo::NONE);
     DCHECK_EQ(ScopeInfo::FunctionVariableBits::decode(flags),
               VariableAllocationInfo::NONE);
-    ScopeInfo::cast(obj).set_flags(flags);
-    ScopeInfo::cast(obj).set_context_local_count(0);
-    ScopeInfo::cast(obj).set_parameter_count(0);
+    ScopeInfo::cast(obj)->set_flags(flags);
+    ScopeInfo::cast(obj)->set_context_local_count(0);
+    ScopeInfo::cast(obj)->set_parameter_count(0);
   }
   set_empty_scope_info(ScopeInfo::cast(obj));
 
@@ -780,9 +840,9 @@ bool Heap::CreateImportantReadOnlyObjects() {
              .To(&obj)) {
       return false;
     }
-    obj.set_map_after_allocation(roots.property_array_map(),
-                                 SKIP_WRITE_BARRIER);
-    PropertyArray::cast(obj).initialize_length(0);
+    obj->set_map_after_allocation(roots.property_array_map(),
+                                  SKIP_WRITE_BARRIER);
+    PropertyArray::cast(obj)->initialize_length(0);
     set_empty_property_array(PropertyArray::cast(obj));
   }
 
@@ -790,7 +850,7 @@ bool Heap::CreateImportantReadOnlyObjects() {
   // The -0 value must be set before NewNumber works.
   set_minus_zero_value(
       *factory->NewHeapNumber<AllocationType::kReadOnly>(-0.0));
-  DCHECK(std::signbit(roots.minus_zero_value().Number()));
+  DCHECK(std::signbit(Object::Number(*roots.minus_zero_value())));
 
   set_nan_value(*factory->NewHeapNumber<AllocationType::kReadOnly>(
       std::numeric_limits<double>::quiet_NaN()));
@@ -816,17 +876,17 @@ bool Heap::CreateReadOnlyObjects() {
   HandleScope initial_objects_handle_scope(isolate());
   Factory* factory = isolate()->factory();
   ReadOnlyRoots roots(this);
-  HeapObject obj;
+  Tagged<HeapObject> obj;
 
   // Empty elements
   {
     AllocationResult alloc = AllocateRaw(
         ArrayList::SizeFor(ArrayList::kFirstIndex), AllocationType::kReadOnly);
     if (!alloc.To(&obj)) return false;
-    obj.set_map_after_allocation(roots.array_list_map(), SKIP_WRITE_BARRIER);
+    obj->set_map_after_allocation(roots.array_list_map(), SKIP_WRITE_BARRIER);
     // Unchecked to skip failing checks since required roots are uninitialized.
-    ArrayList::unchecked_cast(obj).set_length(ArrayList::kFirstIndex);
-    ArrayList::unchecked_cast(obj).SetLength(0);
+    ArrayList::unchecked_cast(obj)->set_length(ArrayList::kFirstIndex);
+    ArrayList::unchecked_cast(obj)->SetLength(0);
   }
   set_empty_array_list(ArrayList::unchecked_cast(obj));
 
@@ -835,12 +895,12 @@ bool Heap::CreateReadOnlyObjects() {
     AllocationResult alloc =
         AllocateRaw(FixedArray::SizeFor(1), AllocationType::kReadOnly);
     if (!alloc.To(&obj)) return false;
-    obj.set_map_after_allocation(roots.object_boilerplate_description_map(),
-                                 SKIP_WRITE_BARRIER);
+    obj->set_map_after_allocation(roots.object_boilerplate_description_map(),
+                                  SKIP_WRITE_BARRIER);
 
-    FixedArray::cast(obj).set_length(1);
-    FixedArray::cast(obj).set(ObjectBoilerplateDescription::kLiteralTypeOffset,
-                              Smi::zero());
+    FixedArray::cast(obj)->set_length(1);
+    FixedArray::cast(obj)->set(ObjectBoilerplateDescription::kLiteralTypeOffset,
+                               Smi::zero());
   }
   set_empty_object_boilerplate_description(
       ObjectBoilerplateDescription::cast(obj));
@@ -852,9 +912,9 @@ bool Heap::CreateReadOnlyObjects() {
                  AllocationType::kReadOnly);
     if (!alloc.To(&obj)) return false;
 
-    ArrayBoilerplateDescription::cast(obj).set_constant_elements(
+    ArrayBoilerplateDescription::cast(obj)->set_constant_elements(
         roots.empty_fixed_array());
-    ArrayBoilerplateDescription::cast(obj).set_elements_kind(
+    ArrayBoilerplateDescription::cast(obj)->set_elements_kind(
         ElementsKind::PACKED_SMI_ELEMENTS);
   }
   set_empty_array_boilerplate_description(
@@ -866,15 +926,22 @@ bool Heap::CreateReadOnlyObjects() {
              .To(&obj)) {
       return false;
     }
-    obj.set_map_after_allocation(roots.closure_feedback_cell_array_map(),
-                                 SKIP_WRITE_BARRIER);
-    FixedArray::cast(obj).set_length(0);
+    obj->set_map_after_allocation(roots.closure_feedback_cell_array_map(),
+                                  SKIP_WRITE_BARRIER);
+    FixedArray::cast(obj)->set_length(0);
     set_empty_closure_feedback_cell_array(ClosureFeedbackCellArray::cast(obj));
   }
 
   DCHECK(!InYoungGeneration(roots.empty_fixed_array()));
 
-  roots.bigint_map().SetConstructorFunctionIndex(
+  // Allocate the empty SwissNameDictionary
+  Handle<SwissNameDictionary> empty_swiss_property_dictionary =
+      factory->CreateCanonicalEmptySwissNameDictionary();
+  set_empty_swiss_property_dictionary(*empty_swiss_property_dictionary);
+  StaticRootsEnsureAllocatedSize(empty_swiss_property_dictionary,
+                                 8 * kTaggedSize);
+
+  roots.bigint_map()->SetConstructorFunctionIndex(
       Context::BIGINT_FUNCTION_INDEX);
 
   // Allocate and initialize table for single character one byte strings.
@@ -886,7 +953,7 @@ bool Heap::CreateReadOnlyObjects() {
     Handle<String> str =
         factory->InternalizeString(base::Vector<const uint8_t>(&code, 1));
     DCHECK(ReadOnlyHeap::Contains(*str));
-    single_character_string_table().set(i, *str);
+    single_character_string_table()->set(i, *str);
   }
 
   for (const ConstantStringInit& entry : kNotImportantConstantStringTable) {
@@ -902,11 +969,6 @@ bool Heap::CreateReadOnlyObjects() {
   Oddball::Initialize(isolate(), factory->null_value(), "null",
                       handle(Smi::zero(), isolate()), "object", Oddball::kNull);
 
-  // Initialize the_hole_value.
-  Oddball::Initialize(isolate(), factory->the_hole_value(), "hole",
-                      factory->hole_nan_value(), "undefined",
-                      Oddball::kTheHole);
-
   // Initialize the true_value.
   Oddball::Initialize(isolate(), factory->true_value(), "true",
                       handle(Smi::FromInt(1), isolate()), "boolean",
@@ -917,6 +979,12 @@ bool Heap::CreateReadOnlyObjects() {
                       handle(Smi::zero(), isolate()), "boolean",
                       Oddball::kFalse);
 
+  // Initialize the_hole_value.
+  Hole::Initialize(isolate(), factory->the_hole_value(),
+                   factory->hole_nan_value());
+
+  set_property_cell_hole_value(*factory->NewHole());
+
   set_uninitialized_value(
       *factory->NewOddball(factory->uninitialized_map(), "uninitialized",
                            handle(Smi::FromInt(-1), isolate()), "undefined",
@@ -976,6 +1044,7 @@ bool Heap::CreateReadOnlyObjects() {
 
     // Mark "Interesting Symbols" appropriately.
     to_string_tag_symbol->set_is_interesting_symbol(true);
+    to_primitive_symbol->set_is_interesting_symbol(true);
   }
 
   {
@@ -1060,6 +1129,18 @@ bool Heap::CreateReadOnlyObjects() {
       ScopeInfo::CreateForShadowRealmNativeContext(isolate());
   set_shadow_realm_scope_info(*shadow_realm_scope_info);
 
+  // EmptyExternalPointerArray:
+  {
+    if (!AllocateRaw(ExternalPointerArray::SizeFor(0),
+                     AllocationType::kReadOnly)
+             .To(&obj))
+      return false;
+    obj->set_map_after_allocation(roots.external_pointer_array_map(),
+                                  SKIP_WRITE_BARRIER);
+    ExternalPointerArray::cast(obj)->set_length(0);
+    set_empty_external_pointer_array(ExternalPointerArray::cast(obj));
+  }
+
   // Initialize the wasm null_value.
 
 #ifdef V8_ENABLE_WEBASSEMBLY
@@ -1076,37 +1157,43 @@ bool Heap::CreateReadOnlyObjects() {
   constexpr size_t kLargestPossibleOSPageSize = 64 * KB;
   static_assert(kLargestPossibleOSPageSize >= kMinimumOSPageSize);
 
-  if (V8_STATIC_ROOTS_BOOL || V8_STATIC_ROOT_GENERATION_BOOL) {
+  if (V8_STATIC_ROOTS_BOOL || V8_STATIC_ROOTS_GENERATION_BOOL) {
     // Ensure all of the following lands on the same V8 page.
     constexpr int kOffsetAfterMapWord = HeapObject::kMapOffset + kTaggedSize;
+    static_assert(kOffsetAfterMapWord % kObjectAlignment == 0);
     read_only_space_->EnsureSpaceForAllocation(
         kLargestPossibleOSPageSize + WasmNull::kSize - kOffsetAfterMapWord);
-    Address next_page =
-        RoundUp(read_only_space_->top(), kLargestPossibleOSPageSize);
-    CHECK_EQ(kOffsetAfterMapWord % kObjectAlignment, 0);
+    Address next_page = RoundUp(read_only_space_->top() + kOffsetAfterMapWord,
+                                kLargestPossibleOSPageSize);
 
     // Add some filler to end up right before an OS page boundary.
     int filler_size = static_cast<int>(next_page - read_only_space_->top() -
                                        kOffsetAfterMapWord);
-    HeapObject filler =
+    // TODO(v8:7748) Depending on where we end up this might actually not hold,
+    // in which case we would need to use a one or two-word filler.
+    CHECK(filler_size > 2 * kTaggedSize);
+    Tagged<HeapObject> filler =
         allocator()->AllocateRawWith<HeapAllocator::kRetryOrFail>(
             filler_size, AllocationType::kReadOnly, AllocationOrigin::kRuntime,
             AllocationAlignment::kTaggedAligned);
     CreateFillerObjectAt(filler.address(), filler_size,
                          ClearFreedMemoryMode::kClearFreedMemory);
+    set_wasm_null_padding(filler);
     CHECK_EQ(read_only_space_->top() + kOffsetAfterMapWord, next_page);
+  } else {
+    set_wasm_null_padding(roots.undefined_value());
   }
 
   // Finally, allocate the wasm-null object.
   {
-    HeapObject obj;
+    Tagged<HeapObject> obj;
     CHECK(AllocateRaw(WasmNull::kSize, AllocationType::kReadOnly).To(&obj));
-    obj.set_map_after_allocation(roots.wasm_null_map(), SKIP_WRITE_BARRIER);
-    MemsetUint32(
-        reinterpret_cast<uint32_t*>(obj.ptr() - kHeapObjectTag + kTaggedSize),
-        0, (WasmNull::kSize - kTaggedSize) / sizeof(uint32_t));
+    // No need to initialize the payload since it's either empty or unmapped.
+    CHECK_IMPLIES(!(V8_STATIC_ROOTS_BOOL || V8_STATIC_ROOTS_GENERATION_BOOL),
+                  WasmNull::kSize == sizeof(Tagged_t));
+    obj->set_map_after_allocation(roots.wasm_null_map(), SKIP_WRITE_BARRIER);
     set_wasm_null(WasmNull::cast(obj));
-    if (V8_STATIC_ROOTS_BOOL || V8_STATIC_ROOT_GENERATION_BOOL) {
+    if (V8_STATIC_ROOTS_BOOL || V8_STATIC_ROOTS_GENERATION_BOOL) {
       CHECK_EQ(read_only_space_->top() % kLargestPossibleOSPageSize, 0);
     }
   }
@@ -1116,10 +1203,8 @@ bool Heap::CreateReadOnlyObjects() {
 }
 
 void Heap::CreateMutableApiObjects() {
-  Isolate* isolate = this->isolate();
-  HandleScope scope(isolate);
-
-  set_message_listeners(*TemplateList::New(isolate, 2));
+  HandleScope scope(isolate());
+  set_message_listeners(*ArrayList::New(isolate(), 2));
 }
 
 void Heap::CreateReadOnlyApiObjects() {
@@ -1187,7 +1272,7 @@ void Heap::CreateInitialMutableObjects() {
 
   // Allocate the empty script.
   Handle<Script> script = factory->NewScript(factory->empty_string());
-  script->set_type(Script::TYPE_NATIVE);
+  script->set_type(Script::Type::kNative);
   // This is used for exceptions thrown with no stack frames. Such exceptions
   // can be shared everywhere.
   script->set_origin_options(ScriptOriginOptions(true, false));
@@ -1202,6 +1287,7 @@ void Heap::CreateInitialMutableObjects() {
   set_map_iterator_protector(*factory->NewProtector());
   set_no_elements_protector(*factory->NewProtector());
   set_mega_dom_protector(*factory->NewProtector());
+  set_no_profiling_protector(*factory->NewProtector());
   set_promise_hook_protector(*factory->NewProtector());
   set_promise_resolve_protector(*factory->NewProtector());
   set_promise_species_protector(*factory->NewProtector());
@@ -1210,7 +1296,7 @@ void Heap::CreateInitialMutableObjects() {
   set_set_iterator_protector(*factory->NewProtector());
   set_string_iterator_protector(*factory->NewProtector());
   set_string_length_protector(*factory->NewProtector());
-  set_number_string_prototype_no_replace_protector(*factory->NewProtector());
+  set_number_string_not_regexp_like_protector(*factory->NewProtector());
   set_typed_array_species_protector(*factory->NewProtector());
 
   set_serialized_objects(roots.empty_fixed_array());
@@ -1229,8 +1315,21 @@ void Heap::CreateInitialMutableObjects() {
   // Initialize compilation cache.
   isolate_->compilation_cache()->Clear();
 
-  // Create internal SharedFunctionInfos.
+  // Error.stack accessor callbacks:
+  {
+    Handle<FunctionTemplateInfo> function_template;
+    function_template = ApiNatives::CreateAccessorFunctionTemplateInfo(
+        isolate_, Accessors::ErrorStackGetter, 0,
+        SideEffectType::kHasSideEffect);
+    set_error_stack_getter_fun_template(*function_template);
+
+    function_template = ApiNatives::CreateAccessorFunctionTemplateInfo(
+        isolate_, Accessors::ErrorStackSetter, 1,
+        SideEffectType::kHasSideEffectToReceiver);
+    set_error_stack_setter_fun_template(*function_template);
+  }
 
+  // Create internal SharedFunctionInfos.
   // Async functions:
   {
     Handle<SharedFunctionInfo> info = CreateSharedFunctionInfo(
@@ -1380,10 +1479,10 @@ void Heap::CreateInternalAccessorInfoObjects() {
                               SetterType)                                 \
   AccessorInfo::cast(                                                     \
       Object(roots_table()[RootIndex::k##AccessorName##Accessor]))        \
-      .set_getter_side_effect_type(SideEffectType::GetterType);           \
+      ->set_getter_side_effect_type(SideEffectType::GetterType);          \
   AccessorInfo::cast(                                                     \
       Object(roots_table()[RootIndex::k##AccessorName##Accessor]))        \
-      .set_setter_side_effect_type(SideEffectType::SetterType);
+      ->set_setter_side_effect_type(SideEffectType::SetterType);
   ACCESSOR_INFO_LIST_GENERATOR(INIT_SIDE_EFFECT_FLAG, /* not used */)
 #undef INIT_SIDE_EFFECT_FLAG
 }
diff --git a/deps/v8/src/heap/slot-set.h b/deps/v8/src/heap/slot-set.h
index 7caffdeeed6616..35b23a67df5e8e 100644
--- a/deps/v8/src/heap/slot-set.h
+++ b/deps/v8/src/heap/slot-set.h
@@ -33,7 +33,7 @@ using ::heap::base::SlotCallbackResult;
 // is replaced with a pointer to a malloc-allocated bitmap.
 class PossiblyEmptyBuckets {
  public:
-  PossiblyEmptyBuckets() : bitmap_(kNullAddress) {}
+  PossiblyEmptyBuckets() = default;
   PossiblyEmptyBuckets(PossiblyEmptyBuckets&& other) V8_NOEXCEPT
       : bitmap_(other.bitmap_) {
     other.bitmap_ = kNullAddress;
@@ -44,11 +44,6 @@ class PossiblyEmptyBuckets {
   PossiblyEmptyBuckets(const PossiblyEmptyBuckets&) = delete;
   PossiblyEmptyBuckets& operator=(const PossiblyEmptyBuckets&) = delete;
 
-  void Initialize() {
-    bitmap_ = kNullAddress;
-    DCHECK(!IsAllocated());
-  }
-
   void Release() {
     if (IsAllocated()) {
       AlignedFree(BitmapArray());
@@ -81,13 +76,12 @@ class PossiblyEmptyBuckets {
     }
   }
 
-  bool IsEmpty() { return bitmap_ == kNullAddress; }
+  bool IsEmpty() const { return bitmap_ == kNullAddress; }
 
  private:
-  Address bitmap_;
-  static const Address kPointerTag = 1;
-  static const int kWordSize = sizeof(uintptr_t);
-  static const int kBitsPerWord = kWordSize * kBitsPerByte;
+  static constexpr Address kPointerTag = 1;
+  static constexpr int kWordSize = sizeof(uintptr_t);
+  static constexpr int kBitsPerWord = kWordSize * kBitsPerByte;
 
   bool IsAllocated() { return bitmap_ & kPointerTag; }
 
@@ -121,6 +115,8 @@ class PossiblyEmptyBuckets {
     return reinterpret_cast<uintptr_t*>(bitmap_ & ~kPointerTag);
   }
 
+  Address bitmap_ = kNullAddress;
+
   FRIEND_TEST(PossiblyEmptyBucketsTest, WordsForBuckets);
 };
 
@@ -138,12 +134,24 @@ class SlotSet final : public ::heap::base::BasicSlotSet<kTaggedSize> {
     return static_cast<SlotSet*>(BasicSlotSet::Allocate(buckets));
   }
 
+  template <v8::internal::AccessMode access_mode>
+  static constexpr BasicSlotSet::AccessMode ConvertAccessMode() {
+    switch (access_mode) {
+      case v8::internal::AccessMode::ATOMIC:
+        return BasicSlotSet::AccessMode::ATOMIC;
+      case v8::internal::AccessMode::NON_ATOMIC:
+        return BasicSlotSet::AccessMode::NON_ATOMIC;
+    }
+  }
+
   // Similar to BasicSlotSet::Iterate() but Callback takes the parameter of type
   // MaybeObjectSlot.
-  template <typename Callback>
+  template <
+      v8::internal::AccessMode access_mode = v8::internal::AccessMode::ATOMIC,
+      typename Callback>
   size_t Iterate(Address chunk_start, size_t start_bucket, size_t end_bucket,
                  Callback callback, EmptyBucketMode mode) {
-    return BasicSlotSet::Iterate(
+    return BasicSlotSet::Iterate<ConvertAccessMode<access_mode>()>(
         chunk_start, start_bucket, end_bucket,
         [&callback](Address slot) { return callback(MaybeObjectSlot(slot)); },
         [this, mode](size_t bucket_index) {
@@ -205,11 +213,14 @@ class SlotSet final : public ::heap::base::BasicSlotSet<kTaggedSize> {
       if (!other_bucket) continue;
       Bucket* bucket = LoadBucket<AccessMode::NON_ATOMIC>(bucket_index);
       if (bucket == nullptr) {
-        bucket = new Bucket;
-        CHECK(SwapInNewBucket<AccessMode::NON_ATOMIC>(bucket_index, bucket));
-      }
-      for (int cell_index = 0; cell_index < kCellsPerBucket; cell_index++) {
-        bucket->SetCellBits(cell_index, *other_bucket->cell(cell_index));
+        other->StoreBucket<AccessMode::NON_ATOMIC>(bucket_index, nullptr);
+        StoreBucket<AccessMode::NON_ATOMIC>(bucket_index, other_bucket);
+      } else {
+        for (int cell_index = 0; cell_index < kCellsPerBucket; cell_index++) {
+          bucket->SetCellBits<AccessMode::NON_ATOMIC>(
+              cell_index,
+              other_bucket->LoadCell<AccessMode::NON_ATOMIC>(cell_index));
+        }
       }
     }
   }
diff --git a/deps/v8/src/heap/spaces-inl.h b/deps/v8/src/heap/spaces-inl.h
index a7e830b5458ed4..2c4e9be31e7141 100644
--- a/deps/v8/src/heap/spaces-inl.h
+++ b/deps/v8/src/heap/spaces-inl.h
@@ -10,6 +10,7 @@
 #include "src/common/globals.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/incremental-marking.h"
+#include "src/heap/large-page.h"
 #include "src/heap/large-spaces.h"
 #include "src/heap/memory-chunk-inl.h"
 #include "src/heap/new-spaces.h"
@@ -54,13 +55,15 @@ ConstPageRange::ConstPageRange(Address start, Address limit)
 
 void Space::IncrementExternalBackingStoreBytes(ExternalBackingStoreType type,
                                                size_t amount) {
-  base::CheckedIncrement(&external_backing_store_bytes_[type], amount);
+  base::CheckedIncrement(&external_backing_store_bytes_[static_cast<int>(type)],
+                         amount);
   heap()->IncrementExternalBackingStoreBytes(type, amount);
 }
 
 void Space::DecrementExternalBackingStoreBytes(ExternalBackingStoreType type,
                                                size_t amount) {
-  base::CheckedDecrement(&external_backing_store_bytes_[type], amount);
+  base::CheckedDecrement(&external_backing_store_bytes_[static_cast<int>(type)],
+                         amount);
   heap()->DecrementExternalBackingStoreBytes(type, amount);
 }
 
@@ -69,34 +72,15 @@ void Space::MoveExternalBackingStoreBytes(ExternalBackingStoreType type,
                                           size_t amount) {
   if (from == to) return;
 
-  base::CheckedDecrement(&(from->external_backing_store_bytes_[type]), amount);
-  base::CheckedIncrement(&(to->external_backing_store_bytes_[type]), amount);
+  base::CheckedDecrement(
+      &(from->external_backing_store_bytes_[static_cast<int>(type)]), amount);
+  base::CheckedIncrement(
+      &(to->external_backing_store_bytes_[static_cast<int>(type)]), amount);
 }
 
-void Page::MarkNeverAllocateForTesting() {
-  DCHECK(this->owner_identity() != NEW_SPACE);
-  DCHECK(!IsFlagSet(NEVER_ALLOCATE_ON_PAGE));
-  SetFlag(NEVER_ALLOCATE_ON_PAGE);
-  SetFlag(NEVER_EVACUATE);
-  reinterpret_cast<PagedSpace*>(owner())->free_list()->EvictFreeListItems(this);
-}
-
-void Page::MarkEvacuationCandidate() {
-  DCHECK(!IsFlagSet(NEVER_EVACUATE));
-  DCHECK_NULL(slot_set<OLD_TO_OLD>());
-  DCHECK_NULL(typed_slot_set<OLD_TO_OLD>());
-  SetFlag(EVACUATION_CANDIDATE);
-  reinterpret_cast<PagedSpace*>(owner())->free_list()->EvictFreeListItems(this);
-}
-
-void Page::ClearEvacuationCandidate() {
-  if (!IsFlagSet(COMPACTION_WAS_ABORTED)) {
-    DCHECK_NULL(slot_set<OLD_TO_OLD>());
-    DCHECK_NULL(typed_slot_set<OLD_TO_OLD>());
-  }
-  ClearFlag(EVACUATION_CANDIDATE);
-  InitializeFreeListCategories();
-}
+PageRange::PageRange(Page* page) : PageRange(page, page->next_page()) {}
+ConstPageRange::ConstPageRange(const Page* page)
+    : ConstPageRange(page, page->next_page()) {}
 
 OldGenerationMemoryChunkIterator::OldGenerationMemoryChunkIterator(Heap* heap)
     : heap_(heap),
@@ -147,7 +131,7 @@ AllocationResult LocalAllocationBuffer::AllocateRawAligned(
   if (!allocation_info_.CanIncrementTop(aligned_size)) {
     return AllocationResult::Failure();
   }
-  HeapObject object =
+  Tagged<HeapObject> object =
       HeapObject::FromAddress(allocation_info_.IncrementTop(aligned_size));
   return filler_size > 0 ? AllocationResult::FromObject(
                                heap_->PrecedeWithFiller(object, filler_size))
@@ -167,7 +151,7 @@ LocalAllocationBuffer LocalAllocationBuffer::FromResult(Heap* heap,
                                                         AllocationResult result,
                                                         intptr_t size) {
   if (result.IsFailure()) return InvalidBuffer();
-  HeapObject obj;
+  Tagged<HeapObject> obj;
   bool ok = result.To(&obj);
   USE(ok);
   DCHECK(ok);
@@ -179,7 +163,8 @@ bool LocalAllocationBuffer::TryMerge(LocalAllocationBuffer* other) {
   return allocation_info_.MergeIfAdjacent(other->allocation_info_);
 }
 
-bool LocalAllocationBuffer::TryFreeLast(HeapObject object, int object_size) {
+bool LocalAllocationBuffer::TryFreeLast(Tagged<HeapObject> object,
+                                        int object_size) {
   if (IsValid()) {
     const Address object_address = object.address();
     return allocation_info_.DecrementTopIfAdjacent(object_address, object_size);
@@ -211,7 +196,7 @@ AllocationResult SpaceWithLinearArea::AllocateFastUnaligned(
   if (!allocation_info_.CanIncrementTop(size_in_bytes)) {
     return AllocationResult::Failure();
   }
-  HeapObject obj =
+  Tagged<HeapObject> obj =
       HeapObject::FromAddress(allocation_info_.IncrementTop(size_in_bytes));
 
   MSAN_ALLOCATED_UNINITIALIZED_MEMORY(obj.address(), size_in_bytes);
@@ -229,7 +214,7 @@ AllocationResult SpaceWithLinearArea::AllocateFastAligned(
   if (!allocation_info_.CanIncrementTop(aligned_size_in_bytes)) {
     return AllocationResult::Failure();
   }
-  HeapObject obj = HeapObject::FromAddress(
+  Tagged<HeapObject> obj = HeapObject::FromAddress(
       allocation_info_.IncrementTop(aligned_size_in_bytes));
   if (result_aligned_size_in_bytes)
     *result_aligned_size_in_bytes = aligned_size_in_bytes;
diff --git a/deps/v8/src/heap/spaces.cc b/deps/v8/src/heap/spaces.cc
index 822a06ec8a648a..db69be3aca60ea 100644
--- a/deps/v8/src/heap/spaces.cc
+++ b/deps/v8/src/heap/spaces.cc
@@ -17,7 +17,6 @@
 #include "src/heap/concurrent-marking.h"
 #include "src/heap/heap.h"
 #include "src/heap/incremental-marking-inl.h"
-#include "src/heap/invalidated-slots-inl.h"
 #include "src/heap/large-spaces.h"
 #include "src/heap/mark-compact.h"
 #include "src/heap/memory-chunk-layout.h"
@@ -37,185 +36,6 @@
 namespace v8 {
 namespace internal {
 
-// These checks are here to ensure that the lower 32 bits of any real heap
-// object can't overlap with the lower 32 bits of cleared weak reference value
-// and therefore it's enough to compare only the lower 32 bits of a MaybeObject
-// in order to figure out if it's a cleared weak reference or not.
-static_assert(kClearedWeakHeapObjectLower32 > 0);
-static_assert(kClearedWeakHeapObjectLower32 < Page::kHeaderSize);
-
-// static
-constexpr Page::MainThreadFlags Page::kCopyOnFlipFlagsMask;
-
-Page::Page(Heap* heap, BaseSpace* space, size_t size, Address area_start,
-           Address area_end, VirtualMemory reservation,
-           Executability executable)
-    : MemoryChunk(heap, space, size, area_start, area_end,
-                  std::move(reservation), executable, PageSize::kRegular) {}
-
-void Page::AllocateFreeListCategories() {
-  DCHECK_NULL(categories_);
-  categories_ =
-      new FreeListCategory*[owner()->free_list()->number_of_categories()]();
-  for (int i = kFirstCategory; i <= owner()->free_list()->last_category();
-       i++) {
-    DCHECK_NULL(categories_[i]);
-    categories_[i] = new FreeListCategory();
-  }
-}
-
-void Page::InitializeFreeListCategories() {
-  for (int i = kFirstCategory; i <= owner()->free_list()->last_category();
-       i++) {
-    categories_[i]->Initialize(static_cast<FreeListCategoryType>(i));
-  }
-}
-
-void Page::ReleaseFreeListCategories() {
-  if (categories_ != nullptr) {
-    for (int i = kFirstCategory; i <= owner()->free_list()->last_category();
-         i++) {
-      if (categories_[i] != nullptr) {
-        delete categories_[i];
-        categories_[i] = nullptr;
-      }
-    }
-    delete[] categories_;
-    categories_ = nullptr;
-  }
-}
-
-Page* Page::ConvertNewToOld(Page* old_page) {
-  DCHECK(old_page);
-  DCHECK(old_page->InNewSpace());
-  OldSpace* old_space = old_page->heap()->old_space();
-  old_page->set_owner(old_space);
-  old_page->ClearFlags(Page::kAllFlagsMask);
-  Page* new_page = old_space->InitializePage(old_page);
-  old_space->AddPage(new_page);
-  return new_page;
-}
-
-size_t Page::AvailableInFreeList() {
-  size_t sum = 0;
-  ForAllFreeListCategories([&sum](FreeListCategory* category) {
-    sum += category->available();
-  });
-  return sum;
-}
-
-#ifdef DEBUG
-namespace {
-// Skips filler starting from the given filler until the end address.
-// Returns the first address after the skipped fillers.
-Address SkipFillers(PtrComprCageBase cage_base, HeapObject filler,
-                    Address end) {
-  Address addr = filler.address();
-  while (addr < end) {
-    filler = HeapObject::FromAddress(addr);
-    CHECK(filler.IsFreeSpaceOrFiller(cage_base));
-    addr = filler.address() + filler.Size(cage_base);
-  }
-  return addr;
-}
-}  // anonymous namespace
-#endif  // DEBUG
-
-size_t Page::ShrinkToHighWaterMark() {
-  // Shrinking only makes sense outside of the CodeRange, where we don't care
-  // about address space fragmentation.
-  VirtualMemory* reservation = reserved_memory();
-  if (!reservation->IsReserved()) return 0;
-
-  // Shrink pages to high water mark. The water mark points either to a filler
-  // or the area_end.
-  HeapObject filler = HeapObject::FromAddress(HighWaterMark());
-  if (filler.address() == area_end()) return 0;
-  PtrComprCageBase cage_base(heap()->isolate());
-  CHECK(filler.IsFreeSpaceOrFiller(cage_base));
-  // Ensure that no objects were allocated in [filler, area_end) region.
-  DCHECK_EQ(area_end(), SkipFillers(cage_base, filler, area_end()));
-  // Ensure that no objects will be allocated on this page.
-  DCHECK_EQ(0u, AvailableInFreeList());
-
-  // Ensure that slot sets are empty. Otherwise the buckets for the shrunk
-  // area would not be freed when deallocating this page.
-  DCHECK_NULL(slot_set<OLD_TO_NEW>());
-  DCHECK_NULL(slot_set<OLD_TO_OLD>());
-
-  size_t unused = RoundDown(static_cast<size_t>(area_end() - filler.address()),
-                            MemoryAllocator::GetCommitPageSize());
-  if (unused > 0) {
-    DCHECK_EQ(0u, unused % MemoryAllocator::GetCommitPageSize());
-    if (v8_flags.trace_gc_verbose) {
-      PrintIsolate(heap()->isolate(), "Shrinking page %p: end %p -> %p\n",
-                   reinterpret_cast<void*>(this),
-                   reinterpret_cast<void*>(area_end()),
-                   reinterpret_cast<void*>(area_end() - unused));
-    }
-    heap()->CreateFillerObjectAt(
-        filler.address(),
-        static_cast<int>(area_end() - filler.address() - unused));
-    heap()->memory_allocator()->PartialFreeMemory(
-        this, address() + size() - unused, unused, area_end() - unused);
-    if (filler.address() != area_end()) {
-      CHECK(filler.IsFreeSpaceOrFiller(cage_base));
-      CHECK_EQ(filler.address() + filler.Size(cage_base), area_end());
-    }
-  }
-  return unused;
-}
-
-void Page::CreateBlackArea(Address start, Address end) {
-  DCHECK_NE(NEW_SPACE, owner_identity());
-  DCHECK(heap()->incremental_marking()->black_allocation());
-  DCHECK_EQ(Page::FromAddress(start), this);
-  DCHECK_LT(start, end);
-  DCHECK_EQ(Page::FromAddress(end - 1), this);
-  MarkingState* marking_state = heap()->marking_state();
-  marking_state->bitmap(this)->SetRange(AddressToMarkbitIndex(start),
-                                        AddressToMarkbitIndex(end));
-  marking_state->IncrementLiveBytes(this, static_cast<intptr_t>(end - start));
-}
-
-void Page::CreateBlackAreaBackground(Address start, Address end) {
-  DCHECK_NE(NEW_SPACE, owner_identity());
-  DCHECK(heap()->incremental_marking()->black_allocation());
-  DCHECK_EQ(Page::FromAddress(start), this);
-  DCHECK_LT(start, end);
-  DCHECK_EQ(Page::FromAddress(end - 1), this);
-  AtomicMarkingState* marking_state = heap()->atomic_marking_state();
-  marking_state->bitmap(this)->SetRange(AddressToMarkbitIndex(start),
-                                        AddressToMarkbitIndex(end));
-  heap()->incremental_marking()->IncrementLiveBytesBackground(
-      this, static_cast<intptr_t>(end - start));
-}
-
-void Page::DestroyBlackArea(Address start, Address end) {
-  DCHECK_NE(NEW_SPACE, owner_identity());
-  DCHECK(heap()->incremental_marking()->black_allocation());
-  DCHECK_EQ(Page::FromAddress(start), this);
-  DCHECK_LT(start, end);
-  DCHECK_EQ(Page::FromAddress(end - 1), this);
-  MarkingState* marking_state = heap()->marking_state();
-  marking_state->bitmap(this)->ClearRange(AddressToMarkbitIndex(start),
-                                          AddressToMarkbitIndex(end));
-  marking_state->IncrementLiveBytes(this, -static_cast<intptr_t>(end - start));
-}
-
-void Page::DestroyBlackAreaBackground(Address start, Address end) {
-  DCHECK_NE(NEW_SPACE, owner_identity());
-  DCHECK(heap()->incremental_marking()->black_allocation());
-  DCHECK_EQ(Page::FromAddress(start), this);
-  DCHECK_LT(start, end);
-  DCHECK_EQ(Page::FromAddress(end - 1), this);
-  AtomicMarkingState* marking_state = heap()->atomic_marking_state();
-  marking_state->bitmap(this)->ClearRange(AddressToMarkbitIndex(start),
-                                          AddressToMarkbitIndex(end));
-  heap()->incremental_marking()->IncrementLiveBytesBackground(
-      this, -static_cast<intptr_t>(end - start));
-}
-
 // -----------------------------------------------------------------------------
 // PagedSpace implementation
 
@@ -273,7 +93,7 @@ void SpaceWithLinearArea::PrintAllocationsOrigins() const {
   PrintIsolate(
       heap()->isolate(),
       "Allocations Origins for %s: GeneratedCode:%zu - Runtime:%zu - GC:%zu\n",
-      name(), allocations_origins_[0], allocations_origins_[1],
+      ToString(identity()), allocations_origins_[0], allocations_origins_[1],
       allocations_origins_[2]);
 }
 
@@ -395,11 +215,6 @@ void SpaceWithLinearArea::InvokeAllocationObservers(
               allocation_info_.limit());
 
     // Ensure that there is a valid object
-    if (identity() == CODE_SPACE) {
-      MemoryChunk* chunk = MemoryChunk::FromAddress(soon_object);
-      heap()->UnprotectAndRegisterMemoryChunk(
-          chunk, UnprotectMemoryOrigin::kMainThread);
-    }
     heap_->CreateFillerObjectAt(soon_object, static_cast<int>(size_in_bytes));
 
 #if DEBUG
diff --git a/deps/v8/src/heap/spaces.h b/deps/v8/src/heap/spaces.h
index 7929d53fc960c0..c9d8b0a3a998a5 100644
--- a/deps/v8/src/heap/spaces.h
+++ b/deps/v8/src/heap/spaces.h
@@ -20,6 +20,7 @@
 #include "src/heap/list.h"
 #include "src/heap/memory-chunk-layout.h"
 #include "src/heap/memory-chunk.h"
+#include "src/heap/page.h"
 #include "src/heap/slot-set.h"
 #include "src/objects/objects.h"
 #include "src/utils/allocation.h"
@@ -41,107 +42,46 @@ class Isolate;
 class LargeObjectSpace;
 class LargePage;
 class ObjectIterator;
-class Page;
 class PagedSpaceBase;
 class SemiSpace;
 
-// -----------------------------------------------------------------------------
-// Heap structures:
-//
-// A JS heap consists of a young generation, an old generation, and a large
-// object space. The young generation is divided into two semispaces. A
-// scavenger implements Cheney's copying algorithm. The old generation is
-// separated into a map space and an old object space. The map space contains
-// all (and only) map objects, the rest of old objects go into the old space.
-// The old generation is collected by a mark-sweep-compact collector.
-//
-// The semispaces of the young generation are contiguous.  The old and map
-// spaces consists of a list of pages. A page has a page header and an object
-// area.
-//
-// There is a separate large object space for objects larger than
-// kMaxRegularHeapObjectSize, so that they do not have to move during
-// collection. The large object space is paged. Pages in large object space
-// may be larger than the page size.
-//
-// A remembered set is used to keep track of inter-generational references.
-//
-// During scavenges and mark-sweep collections we sometimes (after a store
-// buffer overflow) iterate inter-generational pointers without decoding heap
-// object maps so if the page belongs to old space or large object space
-// it is essential to guarantee that the page does not contain any
-// garbage pointers to new space: every pointer aligned word which satisfies
-// the Heap::InNewSpace() predicate must be a pointer to a live heap object in
-// new space. Thus objects in old space and large object spaces should have a
-// special layout (e.g. no bare integer fields). This requirement does not
-// apply to map space which is iterated in a special fashion. However we still
-// require pointer fields of dead maps to be cleaned.
-//
-// To enable lazy cleaning of old space pages we can mark chunks of the page
-// as being garbage.  Garbage sections are marked with a special map.  These
-// sections are skipped when scanning the page, even if we are otherwise
-// scanning without regard for object boundaries.  Garbage sections are chained
-// together to form a free list after a GC.  Garbage sections created outside
-// of GCs by object truncation etc. may not be in the free list chain.  Very
-// small free spaces are ignored, they need only be cleaned of bogus pointers
-// into new space.
-//
-// Each page may have up to one special garbage section.  The start of this
-// section is denoted by the top field in the space.  The end of the section
-// is denoted by the limit field in the space.  This special garbage section
-// is not marked with a free space map in the data.  The point of this section
-// is to enable linear allocation without having to constantly update the byte
-// array every time the top field is updated and a new object is created.  The
-// special garbage section is not in the chain of garbage sections.
-//
-// Since the top and limit fields are in the space, not the page, only one page
-// has a special garbage section, and if the top and limit are equal then there
-// is no special garbage section.
-
 // Some assertion macros used in the debugging mode.
 
 #define DCHECK_OBJECT_SIZE(size) \
   DCHECK((0 < size) && (size <= kMaxRegularHeapObjectSize))
 
-#define DCHECK_CODEOBJECT_SIZE(size, code_space)                          \
-  DCHECK((0 < size) &&                                                    \
-         (size <= std::min(MemoryChunkLayout::MaxRegularCodeObjectSize(), \
-                           code_space->AreaSize())))
+#define DCHECK_CODEOBJECT_SIZE(size) \
+  DCHECK((0 < size) && (size <= MemoryChunkLayout::MaxRegularCodeObjectSize()))
+
+template <typename Enum, typename Callback>
+void ForAll(Callback callback) {
+  for (int i = 0; i < static_cast<int>(Enum::kNumValues); i++) {
+    callback(static_cast<Enum>(i), i);
+  }
+}
 
 // ----------------------------------------------------------------------------
 // Space is the abstract superclass for all allocation spaces that are not
 // sealed after startup (i.e. not ReadOnlySpace).
 class V8_EXPORT_PRIVATE Space : public BaseSpace {
  public:
-  Space(Heap* heap, AllocationSpace id, FreeList* free_list,
+  static inline void MoveExternalBackingStoreBytes(
+      ExternalBackingStoreType type, Space* from, Space* to, size_t amount);
+
+  Space(Heap* heap, AllocationSpace id, std::unique_ptr<FreeList> free_list,
         AllocationCounter& allocation_counter)
       : BaseSpace(heap, id),
-        free_list_(std::unique_ptr<FreeList>(free_list)),
-        allocation_counter_(allocation_counter) {
-    external_backing_store_bytes_ =
-        new std::atomic<size_t>[ExternalBackingStoreType::kNumTypes];
-    external_backing_store_bytes_[ExternalBackingStoreType::kArrayBuffer] = 0;
-    external_backing_store_bytes_[ExternalBackingStoreType::kExternalString] =
-        0;
-  }
+        free_list_(std::move(free_list)),
+        allocation_counter_(allocation_counter) {}
+
+  ~Space() override = default;
 
   Space(const Space&) = delete;
   Space& operator=(const Space&) = delete;
 
-  static inline void MoveExternalBackingStoreBytes(
-      ExternalBackingStoreType type, Space* from, Space* to, size_t amount);
-
-  ~Space() override {
-    delete[] external_backing_store_bytes_;
-    external_backing_store_bytes_ = nullptr;
-  }
-
   virtual void AddAllocationObserver(AllocationObserver* observer);
-
   virtual void RemoveAllocationObserver(AllocationObserver* observer);
-
   virtual void PauseAllocationObservers() {}
-
   virtual void ResumeAllocationObservers() {}
 
   // Returns size of objects. Can differ from the allocated size
@@ -165,14 +105,13 @@ class V8_EXPORT_PRIVATE Space : public BaseSpace {
 
   inline void IncrementExternalBackingStoreBytes(ExternalBackingStoreType type,
                                                  size_t amount);
-
   inline void DecrementExternalBackingStoreBytes(ExternalBackingStoreType type,
                                                  size_t amount);
 
   // Returns amount of off-heap memory in-use by objects in this Space.
   virtual size_t ExternalBackingStoreBytes(
       ExternalBackingStoreType type) const {
-    return external_backing_store_bytes_[type];
+    return external_backing_store_bytes_[static_cast<int>(type)];
   }
 
   virtual MemoryChunk* first_page() { return memory_chunk_list_.front(); }
@@ -205,146 +144,15 @@ class V8_EXPORT_PRIVATE Space : public BaseSpace {
  protected:
   // The List manages the pages that belong to the given space.
   heap::List<MemoryChunk> memory_chunk_list_;
-
   // Tracks off-heap memory used by this space.
-  std::atomic<size_t>* external_backing_store_bytes_;
-
+  std::atomic<size_t> external_backing_store_bytes_[static_cast<int>(
+      ExternalBackingStoreType::kNumValues)] = {0};
   std::unique_ptr<FreeList> free_list_;
-
   AllocationCounter& allocation_counter_;
 };
 
 static_assert(sizeof(std::atomic<intptr_t>) == kSystemPointerSize);
 
-// -----------------------------------------------------------------------------
-// A page is a memory chunk of a size 256K. Large object pages may be larger.
-//
-// The only way to get a page pointer is by calling factory methods:
-//   Page* p = Page::FromAddress(addr); or
-//   Page* p = Page::FromAllocationAreaAddress(address);
-class Page : public MemoryChunk {
- public:
-  // Page flags copied from from-space to to-space when flipping semispaces.
-  static constexpr MainThreadFlags kCopyOnFlipFlagsMask =
-      MainThreadFlags(MemoryChunk::POINTERS_TO_HERE_ARE_INTERESTING) |
-      MainThreadFlags(MemoryChunk::POINTERS_FROM_HERE_ARE_INTERESTING) |
-      MainThreadFlags(MemoryChunk::INCREMENTAL_MARKING);
-
-  Page(Heap* heap, BaseSpace* space, size_t size, Address area_start,
-       Address area_end, VirtualMemory reservation, Executability executable);
-
-  // Returns the page containing a given address. The address ranges
-  // from [page_addr .. page_addr + kPageSize]. This only works if the object
-  // is in fact in a page.
-  static Page* FromAddress(Address addr) {
-    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
-    return reinterpret_cast<Page*>(addr & ~kPageAlignmentMask);
-  }
-  static Page* FromHeapObject(HeapObject o) {
-    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
-    return reinterpret_cast<Page*>(o.ptr() & ~kAlignmentMask);
-  }
-
-  static Page* cast(MemoryChunk* chunk) {
-    DCHECK(!chunk->IsLargePage());
-    return static_cast<Page*>(chunk);
-  }
-
-  // Returns the page containing the address provided. The address can
-  // potentially point righter after the page. To be also safe for tagged values
-  // we subtract a hole word. The valid address ranges from
-  // [page_addr + area_start_ .. page_addr + kPageSize + kTaggedSize].
-  static Page* FromAllocationAreaAddress(Address address) {
-    DCHECK(!V8_ENABLE_THIRD_PARTY_HEAP_BOOL);
-    return Page::FromAddress(address - kTaggedSize);
-  }
-
-  // Checks if address1 and address2 are on the same new space page.
-  static bool OnSamePage(Address address1, Address address2) {
-    return Page::FromAddress(address1) == Page::FromAddress(address2);
-  }
-
-  // Checks whether an address is page aligned.
-  static bool IsAlignedToPageSize(Address addr) {
-    return (addr & kPageAlignmentMask) == 0;
-  }
-
-  static Page* ConvertNewToOld(Page* old_page);
-
-  inline void MarkNeverAllocateForTesting();
-  inline void MarkEvacuationCandidate();
-  inline void ClearEvacuationCandidate();
-
-  Page* next_page() { return static_cast<Page*>(list_node_.next()); }
-  Page* prev_page() { return static_cast<Page*>(list_node_.prev()); }
-
-  const Page* next_page() const {
-    return static_cast<const Page*>(list_node_.next());
-  }
-  const Page* prev_page() const {
-    return static_cast<const Page*>(list_node_.prev());
-  }
-
-  template <typename Callback>
-  inline void ForAllFreeListCategories(Callback callback) {
-    for (int i = kFirstCategory;
-         i < owner()->free_list()->number_of_categories(); i++) {
-      callback(categories_[i]);
-    }
-  }
-
-  V8_EXPORT_PRIVATE size_t AvailableInFreeList();
-
-  size_t AvailableInFreeListFromAllocatedBytes() {
-    DCHECK_GE(area_size(), wasted_memory() + allocated_bytes());
-    return area_size() - wasted_memory() - allocated_bytes();
-  }
-
-  FreeListCategory* free_list_category(FreeListCategoryType type) {
-    return categories_[type];
-  }
-
-  V8_EXPORT_PRIVATE size_t ShrinkToHighWaterMark();
-
-  V8_EXPORT_PRIVATE void CreateBlackArea(Address start, Address end);
-  V8_EXPORT_PRIVATE void CreateBlackAreaBackground(Address start, Address end);
-  void DestroyBlackArea(Address start, Address end);
-  void DestroyBlackAreaBackground(Address start, Address end);
-
-  void InitializeFreeListCategories();
-  void AllocateFreeListCategories();
-  void ReleaseFreeListCategories();
-
-  ActiveSystemPages* active_system_pages() { return active_system_pages_; }
-
-  template <RememberedSetType remembered_set>
-  void ClearTypedSlotsInFreeMemory(const TypedSlotSet::FreeRangesMap& ranges) {
-    TypedSlotSet* typed_slot_set = this->typed_slot_set<remembered_set>();
-    if (typed_slot_set != nullptr) {
-      typed_slot_set->ClearInvalidSlots(ranges);
-    }
-  }
-
-  template <RememberedSetType remembered_set>
-  void AssertNoTypedSlotsInFreeMemory(
-      const TypedSlotSet::FreeRangesMap& ranges) {
-#if DEBUG
-    TypedSlotSet* typed_slot_set = this->typed_slot_set<OLD_TO_OLD>();
-    if (typed_slot_set != nullptr) {
-      typed_slot_set->AssertNoInvalidSlots(ranges);
-    }
-#endif  // DEBUG
-  }
-
- private:
-  friend class MemoryAllocator;
-};
-
-// Validate our estimates on the header size.
-static_assert(sizeof(BasicMemoryChunk) <= BasicMemoryChunk::kHeaderSize);
-static_assert(sizeof(MemoryChunk) <= MemoryChunk::kHeaderSize);
-static_assert(sizeof(Page) <= MemoryChunk::kHeaderSize);
-
 // -----------------------------------------------------------------------------
 // Interface for heap object iterator to be implemented by all object space
 // object iterators.
@@ -356,7 +164,7 @@ class V8_EXPORT_PRIVATE ObjectIterator : public Malloced {
   // compiler producing warnings about undefined inlines for Next()
   // on classes inheriting from it.
   virtual ~ObjectIterator() {}
-  virtual HeapObject Next() = 0;
+  virtual Tagged<HeapObject> Next() = 0;
 };
 
 template <class PAGE_TYPE>
@@ -388,7 +196,7 @@ class PageRange {
  public:
   using iterator = PageIterator;
   PageRange(Page* begin, Page* end) : begin_(begin), end_(end) {}
-  explicit PageRange(Page* page) : PageRange(page, page->next_page()) {}
+  inline explicit PageRange(Page* page);
   inline PageRange(Address start, Address limit);
 
   iterator begin() { return iterator(begin_); }
@@ -404,8 +212,7 @@ class ConstPageRange {
   using iterator = ConstPageIterator;
   ConstPageRange(const Page* begin, const Page* end)
       : begin_(begin), end_(end) {}
-  explicit ConstPageRange(const Page* page)
-      : ConstPageRange(page, page->next_page()) {}
+  inline explicit ConstPageRange(const Page* page);
   inline ConstPageRange(Address start, Address limit);
 
   iterator begin() { return iterator(begin_); }
@@ -473,7 +280,7 @@ class LocalAllocationBuffer {
   // Returns true if the merge was successful, false otherwise.
   inline bool TryMerge(LocalAllocationBuffer* other);
 
-  inline bool TryFreeLast(HeapObject object, int object_size);
+  inline bool TryFreeLast(Tagged<HeapObject> object, int object_size);
 
   // Close a LAB, effectively invalidating it. Returns the unused area.
   V8_EXPORT_PRIVATE LinearAllocationArea CloseAndMakeIterable();
@@ -521,11 +328,12 @@ class LinearAreaOriginalData {
 
 class SpaceWithLinearArea : public Space {
  public:
-  SpaceWithLinearArea(Heap* heap, AllocationSpace id, FreeList* free_list,
+  SpaceWithLinearArea(Heap* heap, AllocationSpace id,
+                      std::unique_ptr<FreeList> free_list,
                       AllocationCounter& allocation_counter,
                       LinearAllocationArea& allocation_info,
                       LinearAreaOriginalData& linear_area_original_data)
-      : Space(heap, id, free_list, allocation_counter),
+      : Space(heap, id, std::move(free_list), allocation_counter),
         allocation_info_(allocation_info),
         linear_area_original_data_(linear_area_original_data) {}
 
diff --git a/deps/v8/src/heap/sweeper.cc b/deps/v8/src/heap/sweeper.cc
index 84c4406607eb5b..c8649bfa21a9ec 100644
--- a/deps/v8/src/heap/sweeper.cc
+++ b/deps/v8/src/heap/sweeper.cc
@@ -11,158 +11,216 @@
 
 #include "src/base/atomic-utils.h"
 #include "src/base/logging.h"
+#include "src/base/optional.h"
 #include "src/common/globals.h"
 #include "src/execution/vm-state-inl.h"
 #include "src/flags/flags.h"
 #include "src/heap/base/active-system-pages.h"
-#include "src/heap/code-object-registry.h"
+#include "src/heap/ephemeron-remembered-set.h"
 #include "src/heap/free-list-inl.h"
 #include "src/heap/gc-tracer-inl.h"
 #include "src/heap/gc-tracer.h"
-#include "src/heap/invalidated-slots-inl.h"
+#include "src/heap/heap.h"
 #include "src/heap/mark-compact-inl.h"
+#include "src/heap/mark-compact.h"
+#include "src/heap/marking-inl.h"
 #include "src/heap/marking-state.h"
 #include "src/heap/memory-allocator.h"
+#include "src/heap/memory-chunk-layout.h"
 #include "src/heap/memory-chunk.h"
 #include "src/heap/new-spaces.h"
+#include "src/heap/page-inl.h"
 #include "src/heap/paged-spaces.h"
 #include "src/heap/pretenuring-handler-inl.h"
 #include "src/heap/pretenuring-handler.h"
 #include "src/heap/remembered-set.h"
 #include "src/heap/slot-set.h"
+#include "src/heap/zapping.h"
+#include "src/objects/hash-table.h"
+#include "src/objects/instance-type.h"
 #include "src/objects/js-array-buffer-inl.h"
+#include "src/objects/map.h"
 #include "src/objects/objects-inl.h"
 
 namespace v8 {
 namespace internal {
 
-class Sweeper::ConcurrentSweeper final {
+class Sweeper::ConcurrentMajorSweeper final {
  public:
-  explicit ConcurrentSweeper(Sweeper* sweeper)
+  explicit ConcurrentMajorSweeper(Sweeper* sweeper)
       : sweeper_(sweeper), local_sweeper_(sweeper_) {}
 
   bool ConcurrentSweepSpace(AllocationSpace identity, JobDelegate* delegate) {
     DCHECK(IsValidSweepingSpace(identity));
+    DCHECK_NE(NEW_SPACE, identity);
     while (!delegate->ShouldYield()) {
       Page* page = sweeper_->GetSweepingPageSafe(identity);
       if (page == nullptr) return true;
       local_sweeper_.ParallelSweepPage(page, identity,
                                        SweepingMode::kLazyOrConcurrent);
     }
+    TRACE_GC_NOTE("Sweeper::ConcurrentMajorSweeper Preempted");
     return false;
   }
 
-  bool ConcurrentSweepForRememberedSet(JobDelegate* delegate) {
-    if (!sweeper_->should_iterate_promoted_pages_) {
-      local_sweeper_.CleanPromotedPages();
-      return true;
+  // This method is expected by `SweepingState::FinishSweeping`.
+  void Finalize() {}
+
+ private:
+  Sweeper* const sweeper_;
+  LocalSweeper local_sweeper_;
+};
+
+class Sweeper::ConcurrentMinorSweeper final {
+ public:
+  explicit ConcurrentMinorSweeper(Sweeper* sweeper)
+      : sweeper_(sweeper), local_sweeper_(sweeper_) {}
+
+  bool ConcurrentSweepSpace(JobDelegate* delegate) {
+    DCHECK(IsValidSweepingSpace(NEW_SPACE));
+    while (!delegate->ShouldYield()) {
+      Page* page = sweeper_->GetSweepingPageSafe(NEW_SPACE);
+      if (page == nullptr) return true;
+      local_sweeper_.ParallelSweepPage(page, NEW_SPACE,
+                                       SweepingMode::kLazyOrConcurrent);
     }
+    TRACE_GC_NOTE("Sweeper::ConcurrentMinorSweeper Preempted");
+    return false;
+  }
+
+  bool ConcurrentSweepPromotedPages(JobDelegate* delegate) {
     while (!delegate->ShouldYield()) {
-      MemoryChunk* chunk = sweeper_->GetPromotedPageForIterationSafe();
+      MemoryChunk* chunk = sweeper_->GetPromotedPageSafe();
       if (chunk == nullptr) return true;
-      local_sweeper_.ParallelIteratePromotedPageForRememberedSets(chunk);
+      local_sweeper_.ParallelIterateAndSweepPromotedPage(chunk);
     }
+    TRACE_GC_NOTE("Sweeper::ConcurrentMinorSweeper Preempted");
     return false;
   }
 
-  void Finalize() { local_sweeper_.Finalize(); }
-
  private:
   Sweeper* const sweeper_;
   LocalSweeper local_sweeper_;
 };
 
-class Sweeper::SweeperJob final : public JobTask {
+class Sweeper::MajorSweeperJob final : public JobTask {
+ private:
+  // Major sweeping jobs don't sweep new space.
+  static constexpr int kNumberOfMajorSweepingSpaces =
+      kNumberOfSweepingSpaces - 1;
+
  public:
-  SweeperJob(Isolate* isolate, Sweeper* sweeper)
+  static constexpr int kMaxTasks = kNumberOfMajorSweepingSpaces;
+
+  MajorSweeperJob(Isolate* isolate, Sweeper* sweeper)
       : sweeper_(sweeper),
-        concurrent_sweepers_(sweeper_->concurrent_sweepers_),
-        tracer_(isolate->heap()->tracer()) {}
+        concurrent_sweepers(
+            sweeper_->major_sweeping_state_.concurrent_sweepers()),
+        tracer_(isolate->heap()->tracer()),
+        trace_id_(reinterpret_cast<uint64_t>(this) ^
+                  tracer_->CurrentEpoch(GCTracer::Scope::MC_SWEEP)) {
+    DCHECK_LE(concurrent_sweepers.size(), kMaxTasks);
+  }
 
-  ~SweeperJob() override = default;
+  ~MajorSweeperJob() override = default;
 
-  SweeperJob(const SweeperJob&) = delete;
-  SweeperJob& operator=(const SweeperJob&) = delete;
+  MajorSweeperJob(const MajorSweeperJob&) = delete;
+  MajorSweeperJob& operator=(const MajorSweeperJob&) = delete;
 
   void Run(JobDelegate* delegate) final {
-    RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
-    DCHECK(sweeper_->current_new_space_collector_.has_value());
     RunImpl(delegate, delegate->IsJoiningThread());
   }
 
   size_t GetMaxConcurrency(size_t worker_count) const override {
-    const size_t kPagePerTask = 2;
+    static constexpr int kPagePerTask = 2;
     return std::min<size_t>(
-        concurrent_sweepers_.size(),
+        concurrent_sweepers.size(),
         worker_count +
-            (sweeper_->ConcurrentSweepingPageCount() + kPagePerTask - 1) /
+            (sweeper_->ConcurrentMajorSweepingPageCount() + kPagePerTask - 1) /
                 kPagePerTask);
   }
 
+  uint64_t trace_id() const { return trace_id_; }
+
  private:
   void RunImpl(JobDelegate* delegate, bool is_joining_thread) {
-    static_assert(NEW_SPACE == FIRST_SWEEPABLE_SPACE);
+    DCHECK(sweeper_->major_sweeping_in_progress());
     const int offset = delegate->GetTaskId();
-    DCHECK_LT(offset, concurrent_sweepers_.size());
-    ConcurrentSweeper& concurrent_sweeper = concurrent_sweepers_[offset];
-    {
-      TRACE_GC_EPOCH(
-          tracer_, sweeper_->GetTracingScope(NEW_SPACE, is_joining_thread),
-          is_joining_thread ? ThreadKind::kMain : ThreadKind::kBackground);
-      // Prioritize sweeping new space pages first. Young allocation are the
-      // most prominent, so these pages are most likely to be needed soon.
-      if (!concurrent_sweeper.ConcurrentSweepSpace(NEW_SPACE, delegate)) return;
-      if (!sweeper_->should_sweep_non_new_spaces_) {
-        // If only new space needs to be swept, iterate promoted pages and
-        // return.
-        concurrent_sweeper.ConcurrentSweepForRememberedSet(delegate);
-        return;
-      }
-    }
-    // When non-new space also require sweeping, minor sweeping (i.e. iterating
-    // of promoted pages, which will be needed for the next minor GC) and major
-    // sweeping (i.e. of non-new spaces) is interleaved within the same sweeping
-    // tasks (to balance/mitigate further old allocations needing to sweep on
-    // the main thread and minor GCs needing to iterate pages during complete
-    // sweep). Each task starts sweeping from a different space (to reduce
-    // contention), and moves on to the next space once the current space is
-    // done, until all spaces are swept.
-    if (offset > 0) {
-      if (!SweepNonNewSpaces(concurrent_sweeper, delegate, is_joining_thread,
-                             offset, kNumberOfSweepingSpaces))
-        return;
-    }
-    {
-      TRACE_GC_EPOCH(
-          tracer_, sweeper_->GetTracingScope(NEW_SPACE, is_joining_thread),
-          is_joining_thread ? ThreadKind::kMain : ThreadKind::kBackground);
-      if (!concurrent_sweeper.ConcurrentSweepForRememberedSet(delegate)) return;
-    }
-    if (!SweepNonNewSpaces(concurrent_sweeper, delegate, is_joining_thread, 1,
-                           offset == 0 ? kNumberOfSweepingSpaces : offset))
-      return;
-  }
-
-  bool SweepNonNewSpaces(ConcurrentSweeper& concurrent_sweeper,
-                         JobDelegate* delegate, bool is_joining_thread,
-                         int first_space_index, int last_space_index) {
-    DCHECK(sweeper_->should_sweep_non_new_spaces_);
-    TRACE_GC_EPOCH(
+    DCHECK_LT(offset, concurrent_sweepers.size());
+    ConcurrentMajorSweeper& concurrent_sweeper = concurrent_sweepers[offset];
+    TRACE_GC_EPOCH_WITH_FLOW(
         tracer_, sweeper_->GetTracingScope(OLD_SPACE, is_joining_thread),
-        is_joining_thread ? ThreadKind::kMain : ThreadKind::kBackground);
-    for (int i = first_space_index; i < last_space_index; i++) {
-      const AllocationSpace space_id =
-          static_cast<AllocationSpace>(FIRST_SWEEPABLE_SPACE + i);
+        is_joining_thread ? ThreadKind::kMain : ThreadKind::kBackground,
+        trace_id_, TRACE_EVENT_FLAG_FLOW_IN);
+    for (int i = 0; i < kNumberOfMajorSweepingSpaces; i++) {
+      const AllocationSpace space_id = static_cast<AllocationSpace>(
+          FIRST_SWEEPABLE_SPACE + 1 +
+          ((offset + i) % kNumberOfMajorSweepingSpaces));
+      DCHECK_LE(FIRST_SWEEPABLE_SPACE, space_id);
+      DCHECK_LE(space_id, LAST_SWEEPABLE_SPACE);
       DCHECK_NE(NEW_SPACE, space_id);
-      if (!concurrent_sweeper.ConcurrentSweepSpace(space_id, delegate))
-        return false;
+      if (!concurrent_sweeper.ConcurrentSweepSpace(space_id, delegate)) return;
     }
-    return true;
   }
 
   Sweeper* const sweeper_;
-  std::vector<ConcurrentSweeper>& concurrent_sweepers_;
+  std::vector<ConcurrentMajorSweeper>& concurrent_sweepers;
   GCTracer* const tracer_;
+  const uint64_t trace_id_;
+};
+
+class Sweeper::MinorSweeperJob final : public JobTask {
+ public:
+  static constexpr int kMaxTasks = 1;
+
+  MinorSweeperJob(Isolate* isolate, Sweeper* sweeper)
+      : sweeper_(sweeper),
+        concurrent_sweepers(
+            sweeper_->minor_sweeping_state_.concurrent_sweepers()),
+        tracer_(isolate->heap()->tracer()),
+        trace_id_(reinterpret_cast<uint64_t>(this) ^
+                  tracer_->CurrentEpoch(GCTracer::Scope::MINOR_MS_SWEEP)) {
+    DCHECK_LE(concurrent_sweepers.size(), kMaxTasks);
+  }
+
+  ~MinorSweeperJob() override = default;
+
+  MinorSweeperJob(const MinorSweeperJob&) = delete;
+  MinorSweeperJob& operator=(const MinorSweeperJob&) = delete;
+
+  void Run(JobDelegate* delegate) final {
+    RunImpl(delegate, delegate->IsJoiningThread());
+  }
+
+  size_t GetMaxConcurrency(size_t worker_count) const override {
+    static constexpr int kPagePerTask = 2;
+    return std::min<size_t>(
+        concurrent_sweepers.size(),
+        worker_count +
+            (sweeper_->ConcurrentMinorSweepingPageCount() + kPagePerTask - 1) /
+                kPagePerTask);
+  }
+
+  uint64_t trace_id() const { return trace_id_; }
+
+ private:
+  void RunImpl(JobDelegate* delegate, bool is_joining_thread) {
+    DCHECK(sweeper_->minor_sweeping_in_progress());
+    const int offset = delegate->GetTaskId();
+    DCHECK_LT(offset, concurrent_sweepers.size());
+    ConcurrentMinorSweeper& concurrent_sweeper = concurrent_sweepers[offset];
+    TRACE_GC_EPOCH_WITH_FLOW(
+        tracer_, sweeper_->GetTracingScope(NEW_SPACE, is_joining_thread),
+        is_joining_thread ? ThreadKind::kMain : ThreadKind::kBackground,
+        trace_id_, TRACE_EVENT_FLAG_FLOW_IN);
+    if (!concurrent_sweeper.ConcurrentSweepSpace(delegate)) return;
+    concurrent_sweeper.ConcurrentSweepPromotedPages(delegate);
+  }
+
+  Sweeper* const sweeper_;
+  std::vector<ConcurrentMinorSweeper>& concurrent_sweepers;
+  GCTracer* const tracer_;
+  const uint64_t trace_id_;
 };
 
 namespace {
@@ -172,19 +230,119 @@ void AssertMainThreadOrSharedMainThread(Heap* heap) {
 }
 }  // namespace
 
-void Sweeper::LocalSweeper::Finalize() {
-  AssertMainThreadOrSharedMainThread(sweeper_->heap_);
-  for (auto it : old_to_new_remembered_sets_) {
-    MemoryChunk* chunk = it.first;
-    RememberedSet<OLD_TO_NEW>::MergeAndDelete(chunk, it.second);
+template <Sweeper::SweepingScope scope>
+Sweeper::SweepingState<scope>::SweepingState(Sweeper* sweeper)
+    : sweeper_(sweeper) {}
+
+template <Sweeper::SweepingScope scope>
+Sweeper::SweepingState<scope>::~SweepingState() {
+  DCHECK(!in_progress_);
+  DCHECK(concurrent_sweepers_.empty());
+  DCHECK(!HasValidJob());
+}
+
+template <Sweeper::SweepingScope scope>
+bool Sweeper::SweepingState<scope>::HasValidJob() const {
+  return job_handle_ && job_handle_->IsValid();
+}
+
+template <Sweeper::SweepingScope scope>
+bool Sweeper::SweepingState<scope>::HasActiveJob() const {
+  return HasValidJob() && job_handle_->IsActive();
+}
+
+template <Sweeper::SweepingScope scope>
+void Sweeper::SweepingState<scope>::StopConcurrentSweeping() {
+  if (HasValidJob()) job_handle_->Cancel();
+}
+
+template <Sweeper::SweepingScope scope>
+void Sweeper::SweepingState<scope>::InitializeSweeping() {
+  DCHECK(!HasValidJob());
+  DCHECK(!in_progress_);
+  DCHECK(concurrent_sweepers_.empty());
+  should_reduce_memory_ = sweeper_->heap_->ShouldReduceMemory();
+  trace_id_ =
+      reinterpret_cast<uint64_t>(sweeper_) ^
+      sweeper_->heap_->tracer()->CurrentEpoch(
+          scope == SweepingScope::kMajor ? GCTracer::Scope::MC_SWEEP
+                                         : GCTracer::Scope::MINOR_MS_SWEEP);
+}
+
+template <Sweeper::SweepingScope scope>
+void Sweeper::SweepingState<scope>::StartSweeping() {
+  DCHECK(!HasValidJob());
+  DCHECK(!in_progress_);
+  DCHECK(concurrent_sweepers_.empty());
+  DCHECK_NE(0, trace_id_);
+  in_progress_ = true;
+}
+
+template <Sweeper::SweepingScope scope>
+void Sweeper::SweepingState<scope>::StartConcurrentSweeping() {
+  DCHECK(!HasValidJob());
+  DCHECK(in_progress_);
+  if (v8_flags.concurrent_sweeping &&
+      !sweeper_->heap_->delay_sweeper_tasks_for_testing_) {
+    auto job =
+        std::make_unique<SweeperJob>(sweeper_->heap_->isolate(), sweeper_);
+    GCTracer::Scope::ScopeId scope_id =
+        scope == SweepingScope::kMinor
+            ? GCTracer::Scope::MINOR_MS_SWEEP_START_JOBS
+            : GCTracer::Scope::MC_SWEEP_START_JOBS;
+    TRACE_GC_WITH_FLOW(sweeper_->heap_->tracer(), scope_id, job->trace_id(),
+                       TRACE_EVENT_FLAG_FLOW_OUT);
+    DCHECK_IMPLIES(v8_flags.minor_ms, concurrent_sweepers_.empty());
+    int max_concurrent_sweeper_count =
+        std::min(SweeperJob::kMaxTasks,
+                 V8::GetCurrentPlatform()->NumberOfWorkerThreads() + 1);
+    if (concurrent_sweepers_.empty()) {
+      for (int i = 0; i < max_concurrent_sweeper_count; ++i) {
+        concurrent_sweepers_.emplace_back(sweeper_);
+      }
+    }
+    DCHECK_EQ(max_concurrent_sweeper_count, concurrent_sweepers_.size());
+    job_handle_ = V8::GetCurrentPlatform()->PostJob(TaskPriority::kUserVisible,
+                                                    std::move(job));
   }
-  old_to_new_remembered_sets_.clear();
+}
+
+template <Sweeper::SweepingScope scope>
+void Sweeper::SweepingState<scope>::JoinSweeping() {
+  DCHECK(in_progress_);
+  if (HasValidJob()) job_handle_->Join();
+}
+
+template <Sweeper::SweepingScope scope>
+void Sweeper::SweepingState<scope>::FinishSweeping() {
+  DCHECK(in_progress_);
+
+  if (HasValidJob()) job_handle_->Join();
+
+  concurrent_sweepers_.clear();
+  in_progress_ = false;
+}
+
+template <Sweeper::SweepingScope scope>
+void Sweeper::SweepingState<scope>::Pause() {
+  if (!job_handle_ || !job_handle_->IsValid()) return;
+
+  DCHECK(v8_flags.concurrent_sweeping);
+  job_handle_->Cancel();
+}
+
+template <Sweeper::SweepingScope scope>
+void Sweeper::SweepingState<scope>::Resume() {
+  DCHECK(in_progress_);
+  job_handle_ = V8::GetCurrentPlatform()->PostJob(
+      TaskPriority::kUserVisible,
+      std::make_unique<SweeperJob>(sweeper_->heap_->isolate(), sweeper_));
 }
 
 void Sweeper::LocalSweeper::ContributeAndWaitForPromotedPagesIteration() {
   if (!sweeper_->sweeping_in_progress()) return;
   if (!sweeper_->IsIteratingPromotedPages()) return;
-  ParallelIteratePromotedPagesForRememberedSets();
+  ParallelIterateAndSweepPromotedPages();
   base::MutexGuard guard(
       &sweeper_->promoted_pages_iteration_notification_mutex_);
   // Check again that iteration is not yet finished.
@@ -224,174 +382,267 @@ int Sweeper::LocalSweeper::ParallelSweepPage(Page* page,
   // The Scavenger may add already swept pages back.
   if (page->SweepingDone()) return 0;
 
+  base::Optional<CodePageHeaderModificationScope> code_page_scope;
+  if (page->owner_identity() == CODE_SPACE)
+    code_page_scope.emplace("SweepPage needs to write page flags.");
+
   int max_freed = 0;
   {
     base::MutexGuard guard(page->mutex());
     DCHECK(!page->SweepingDone());
-    // If the page is a code page, the CodePageMemoryModificationScope changes
-    // the page protection mode from rx -> rw while sweeping.
-    CodePageMemoryModificationScope code_page_scope(page);
-
     DCHECK_EQ(Page::ConcurrentSweepingState::kPending,
               page->concurrent_sweeping_state());
     page->set_concurrent_sweeping_state(
         Page::ConcurrentSweepingState::kInProgress);
     const FreeSpaceTreatmentMode free_space_treatment_mode =
-        Heap::ShouldZapGarbage() ? FreeSpaceTreatmentMode::kZapFreeSpace
+        heap::ShouldZapGarbage() ? FreeSpaceTreatmentMode::kZapFreeSpace
                                  : FreeSpaceTreatmentMode::kIgnoreFreeSpace;
-    max_freed =
-        sweeper_->RawSweep(page, free_space_treatment_mode, sweeping_mode);
+    max_freed = sweeper_->RawSweep(
+        page, free_space_treatment_mode, sweeping_mode,
+        identity == NEW_SPACE
+            ? sweeper_->minor_sweeping_state_.should_reduce_memory()
+            : sweeper_->major_sweeping_state_.should_reduce_memory(),
+        false /* is_promoted_page */);
+    sweeper_->AddSweptPage(page, identity);
     DCHECK(page->SweepingDone());
   }
 
-  sweeper_->AddSweptPage(page, identity);
-
   return max_freed;
 }
 
-void Sweeper::LocalSweeper::ParallelIteratePromotedPagesForRememberedSets() {
-  if (sweeper_->should_iterate_promoted_pages_) {
-    MemoryChunk* chunk = nullptr;
-    while ((chunk = sweeper_->GetPromotedPageForIterationSafe()) != nullptr) {
-      ParallelIteratePromotedPageForRememberedSets(chunk);
-    }
-  } else {
-    CleanPromotedPages();
+void Sweeper::LocalSweeper::ParallelIterateAndSweepPromotedPages() {
+  MemoryChunk* chunk = nullptr;
+  while ((chunk = sweeper_->GetPromotedPageSafe()) != nullptr) {
+    ParallelIterateAndSweepPromotedPage(chunk);
   }
 }
 
-void Sweeper::LocalSweeper::ParallelIteratePromotedPageForRememberedSets(
-    MemoryChunk* chunk) {
-  DCHECK_NOT_NULL(chunk);
-  base::MutexGuard guard(chunk->mutex());
-  DCHECK(!chunk->SweepingDone());
-  DCHECK_EQ(Page::ConcurrentSweepingState::kPending,
-            chunk->concurrent_sweeping_state());
-  chunk->set_concurrent_sweeping_state(
-      Page::ConcurrentSweepingState::kInProgress);
-  DCHECK(sweeper_->should_iterate_promoted_pages_);
-  sweeper_->RawIteratePromotedPageForRememberedSets(
-      chunk, &old_to_new_remembered_sets_);
-  DCHECK(chunk->SweepingDone());
-  sweeper_->IncrementAndNotifyPromotedPagesIterationFinishedIfNeeded();
-}
-
-void Sweeper::LocalSweeper::CleanPromotedPages() {
-  DCHECK(!sweeper_->should_iterate_promoted_pages_);
-  std::vector<MemoryChunk*> promoted_pages =
-      sweeper_->GetAllPromotedPagesForIterationSafe();
-  if (promoted_pages.empty()) return;
-  for (MemoryChunk* chunk : promoted_pages) {
-    sweeper_->marking_state_->ClearLiveness(chunk);
-    chunk->set_concurrent_sweeping_state(Page::ConcurrentSweepingState::kDone);
+namespace {
+class PromotedPageRecordMigratedSlotVisitor final
+    : public NewSpaceVisitor<PromotedPageRecordMigratedSlotVisitor> {
+ public:
+  explicit PromotedPageRecordMigratedSlotVisitor(MemoryChunk* host_chunk)
+      : NewSpaceVisitor<PromotedPageRecordMigratedSlotVisitor>(
+            host_chunk->heap()->isolate()),
+        host_chunk_(host_chunk),
+        ephemeron_remembered_set_(
+            host_chunk->heap()->ephemeron_remembered_set()) {
+    DCHECK(host_chunk->owner_identity() == OLD_SPACE ||
+           host_chunk->owner_identity() == LO_SPACE);
   }
-  DCHECK_EQ(0u, sweeper_->iterated_promoted_pages_count_);
-  sweeper_->iterated_promoted_pages_count_ = promoted_pages.size();
-  sweeper_->NotifyPromotedPagesIterationFinished();
-}
 
-Sweeper::Sweeper(Heap* heap)
-    : heap_(heap),
-      marking_state_(heap_->non_atomic_marking_state()),
-      sweeping_in_progress_(false),
-      should_reduce_memory_(false),
-      main_thread_local_sweeper_(this) {}
+  void Process(Tagged<HeapObject> object) {
+    Tagged<Map> map = object->map(cage_base());
+    if (Map::ObjectFieldsFrom(map->visitor_id()) == ObjectFields::kDataOnly) {
+      return;
+    }
+    Visit(map, object);
+  }
 
-Sweeper::~Sweeper() {
-  DCHECK(concurrent_sweepers_.empty());
-  DCHECK(main_thread_local_sweeper_.IsEmpty());
-}
+  // TODO(v8:13883): MakeExternal() right now allows to externalize a string in
+  // the young generation (for testing) and on a promoted page that is currently
+  // being swept. If we solve the testing cases and prohobit MakeExternal() on
+  // page owned by the sweeper, this visitor can be simplified as there's no
+  // more unsafe shape changes that happen concurrently.
+  V8_INLINE static constexpr bool EnableConcurrentVisitation() { return true; }
 
-Sweeper::PauseScope::PauseScope(Sweeper* sweeper) : sweeper_(sweeper) {
-  if (!sweeper_->sweeping_in_progress()) return;
+  V8_INLINE void VisitMapPointer(Tagged<HeapObject> host) final {
+    VerifyHost(host);
+    VisitObjectImpl(host, host->map(cage_base()), host->map_slot().address());
+  }
 
-  if (sweeper_->job_handle_ && sweeper_->job_handle_->IsValid())
-    sweeper_->job_handle_->Cancel();
-}
+  V8_INLINE void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) final {
+    VisitPointersImpl(host, p, p + 1);
+  }
+  V8_INLINE void VisitPointer(Tagged<HeapObject> host,
+                              MaybeObjectSlot p) final {
+    VisitPointersImpl(host, p, p + 1);
+  }
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                               ObjectSlot end) final {
+    VisitPointersImpl(host, start, end);
+  }
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
+                               MaybeObjectSlot end) final {
+    VisitPointersImpl(host, start, end);
+  }
 
-Sweeper::PauseScope::~PauseScope() {
-  if (!sweeper_->sweeping_in_progress()) return;
+  V8_INLINE int VisitJSArrayBuffer(Tagged<Map> map,
+                                   Tagged<JSArrayBuffer> object) {
+    object->YoungMarkExtensionPromoted();
+    return NewSpaceVisitor<
+        PromotedPageRecordMigratedSlotVisitor>::VisitJSArrayBuffer(map, object);
+  }
 
-  sweeper_->StartSweeperTasks();
-}
+  V8_INLINE int VisitEphemeronHashTable(Tagged<Map> map,
+                                        Tagged<EphemeronHashTable> table) {
+    NewSpaceVisitor<PromotedPageRecordMigratedSlotVisitor>::
+        VisitMapPointerIfNeeded<VisitorId::kVisitEphemeronHashTable>(table);
+    EphemeronRememberedSet::IndicesSet indices;
+    for (InternalIndex i : table->IterateEntries()) {
+      ObjectSlot value_slot =
+          table->RawFieldOfElementAt(EphemeronHashTable::EntryToValueIndex(i));
+      VisitPointer(table, value_slot);
+      ObjectSlot key_slot =
+          table->RawFieldOfElementAt(EphemeronHashTable::EntryToIndex(i));
+      Tagged<Object> key = key_slot.Acquire_Load();
+      Tagged<HeapObject> key_object;
+      if (!key.GetHeapObject(&key_object)) continue;
+#ifdef THREAD_SANITIZER
+      BasicMemoryChunk::FromHeapObject(key_object)->SynchronizedHeapLoad();
+#endif  // THREAD_SANITIZER
+      if (Heap::InYoungGeneration(key_object)) {
+        indices.insert(i.as_int());
+      }
+    }
+    if (!indices.empty()) {
+      ephemeron_remembered_set_->RecordEphemeronKeyWrites(table,
+                                                          std::move(indices));
+    }
+    return EphemeronHashTable::BodyDescriptor::SizeOf(map, table);
+  }
 
-Sweeper::FilterSweepingPagesScope::FilterSweepingPagesScope(
-    Sweeper* sweeper, const PauseScope& pause_scope)
-    : sweeper_(sweeper),
-      sweeping_in_progress_(sweeper_->sweeping_in_progress()) {
-  // The PauseScope here only serves as a witness that concurrent sweeping has
-  // been paused.
-  USE(pause_scope);
+  // Entries that are skipped for recording.
+  void VisitExternalReference(Tagged<InstructionStream> host,
+                              RelocInfo* rinfo) final {}
+  void VisitInternalReference(Tagged<InstructionStream> host,
+                              RelocInfo* rinfo) final {}
+  void VisitExternalPointer(Tagged<HeapObject> host, ExternalPointerSlot slot,
+                            ExternalPointerTag tag) final {}
+
+  // Maps can be shared, so we need to visit them to record old to shared slots.
+  V8_INLINE static constexpr bool ShouldVisitMapPointer() { return true; }
+  V8_INLINE static constexpr bool ShouldVisitReadOnlyMapPointer() {
+    return false;
+  }
 
-  if (!sweeping_in_progress_) return;
+ private:
+  V8_INLINE void VerifyHost(Tagged<HeapObject> host) {
+    DCHECK(!host.InWritableSharedSpace());
+    DCHECK(!Heap::InYoungGeneration(host));
+    DCHECK(!MemoryChunk::FromHeapObject(host)->SweepingDone());
+    DCHECK_EQ(MemoryChunk::FromHeapObject(host), host_chunk_);
+  }
 
-  int old_space_index = GetSweepSpaceIndex(OLD_SPACE);
-  old_space_sweeping_list_ =
-      std::move(sweeper_->sweeping_list_[old_space_index]);
-  sweeper_->sweeping_list_[old_space_index].clear();
-}
+  template <typename TObject>
+  V8_INLINE void VisitObjectImpl(Tagged<HeapObject> host, TObject object,
+                                 Address slot) {
+    Tagged<HeapObject> value_heap_object;
+    if (!object.GetHeapObject(&value_heap_object)) return;
 
-Sweeper::FilterSweepingPagesScope::~FilterSweepingPagesScope() {
-  DCHECK_EQ(sweeping_in_progress_, sweeper_->sweeping_in_progress());
-  if (!sweeping_in_progress_) return;
+    BasicMemoryChunk* value_chunk =
+        BasicMemoryChunk::FromHeapObject(value_heap_object);
+#ifdef THREAD_SANITIZER
+    value_chunk->SynchronizedHeapLoad();
+#endif  // THREAD_SANITIZER
+    if (value_chunk->InYoungGeneration()) {
+      RememberedSet<OLD_TO_NEW_BACKGROUND>::Insert<AccessMode::ATOMIC>(
+          host_chunk_, slot);
+    } else if (value_chunk->InWritableSharedSpace()) {
+      RememberedSet<OLD_TO_SHARED>::Insert<AccessMode::ATOMIC>(host_chunk_,
+                                                               slot);
+    }
+  }
 
-  sweeper_->sweeping_list_[GetSweepSpaceIndex(OLD_SPACE)] =
-      std::move(old_space_sweeping_list_);
-  // old_space_sweeping_list_ does not need to be cleared as we don't use it.
-}
+  template <typename TSlot>
+  V8_INLINE void VisitPointersImpl(Tagged<HeapObject> host, TSlot start,
+                                   TSlot end) {
+    VerifyHost(host);
+    for (TSlot slot = start; slot < end; ++slot) {
+      typename TSlot::TObject target =
+          slot.Relaxed_Load(ObjectVisitorWithCageBases::cage_base());
+      VisitObjectImpl(host, target, slot.address());
+    }
+  }
 
-void Sweeper::TearDown() {
-  if (job_handle_ && job_handle_->IsValid()) job_handle_->Cancel();
-}
-
-void Sweeper::SnapshotPageSets() {
-  DCHECK(heap_->IsMainThread());
-  // No mutex needed for the main thread.
-  std::tie(snapshot_normal_pages_set_, snapshot_large_pages_set_) =
-      heap_->memory_allocator()->SnapshotPageSetsUnsafe();
-  if (heap_->isolate()->has_shared_space()) {
-    Heap* shared_heap = heap_->isolate()->shared_space_isolate()->heap();
-    if (shared_heap == heap_) {
-      // Current heap is the shared heap, thus all relevant pages have already
-      // been snapshotted and no lock is required.
-      snapshot_shared_normal_pages_set_ = snapshot_normal_pages_set_;
-      snapshot_shared_large_pages_set_ = snapshot_large_pages_set_;
+  MemoryChunk* const host_chunk_;
+  EphemeronRememberedSet* ephemeron_remembered_set_;
+};
+
+}  // namespace
+
+void Sweeper::LocalSweeper::ParallelIterateAndSweepPromotedPage(
+    MemoryChunk* chunk) {
+  DCHECK(v8_flags.minor_ms);
+  DCHECK_NOT_NULL(chunk);
+  {
+    base::MutexGuard guard(chunk->mutex());
+    DCHECK(!chunk->SweepingDone());
+    DCHECK_EQ(Page::ConcurrentSweepingState::kPending,
+              chunk->concurrent_sweeping_state());
+    chunk->set_concurrent_sweeping_state(
+        Page::ConcurrentSweepingState::kInProgress);
+    if (chunk->IsLargePage()) {
+      DCHECK_EQ(LO_SPACE, chunk->owner_identity());
+      // Iterate over the page using the live objects and free the memory before
+      // the given live object.
+      PromotedPageRecordMigratedSlotVisitor record_visitor(chunk);
+      record_visitor.Process(LargePage::cast(chunk)->GetObject());
+      chunk->ClearLiveness();
     } else {
-      std::tie(snapshot_shared_normal_pages_set_,
-               snapshot_shared_large_pages_set_) =
-          shared_heap->memory_allocator()->SnapshotPageSetsSafe();
+      const FreeSpaceTreatmentMode free_space_treatment_mode =
+          heap::ShouldZapGarbage() ? FreeSpaceTreatmentMode::kZapFreeSpace
+                                   : FreeSpaceTreatmentMode::kIgnoreFreeSpace;
+      sweeper_->RawSweep(static_cast<Page*>(chunk), free_space_treatment_mode,
+                         SweepingMode::kLazyOrConcurrent,
+                         sweeper_->minor_sweeping_state_.should_reduce_memory(),
+                         true /* is_promoted_page */);
+      sweeper_->AddSweptPage(Page::cast(chunk), OLD_SPACE);
+      DCHECK(chunk->SweepingDone());
     }
+    sweeper_->NotifyPromotedPageIterationFinished(chunk);
   }
 }
 
-void Sweeper::StartSweeping(GarbageCollector collector) {
-  DCHECK(main_thread_local_sweeper_.IsEmpty());
-  sweeping_in_progress_ = true;
-  if (collector == GarbageCollector::MARK_COMPACTOR)
-    should_sweep_non_new_spaces_ = true;
-  current_new_space_collector_ = collector;
-  should_reduce_memory_ = heap_->ShouldReduceMemory();
+Sweeper::Sweeper(Heap* heap)
+    : heap_(heap),
+      marking_state_(heap_->non_atomic_marking_state()),
+      main_thread_local_sweeper_(this) {}
+
+Sweeper::~Sweeper() = default;
+
+void Sweeper::TearDown() {
+  minor_sweeping_state_.StopConcurrentSweeping();
+  major_sweeping_state_.StopConcurrentSweeping();
+}
+
+void Sweeper::InitializeMajorSweeping() {
+  major_sweeping_state_.InitializeSweeping();
+}
+
+void Sweeper::InitializeMinorSweeping() {
+  minor_sweeping_state_.InitializeSweeping();
+}
+
+void Sweeper::StartMajorSweeping() {
+  DCHECK_EQ(GarbageCollector::MARK_COMPACTOR,
+            heap_->tracer()->GetCurrentCollector());
+  DCHECK(!minor_sweeping_in_progress());
+  major_sweeping_state_.StartSweeping();
   ForAllSweepingSpaces([this](AllocationSpace space) {
     // Sorting is done in order to make compaction more efficient: by sweeping
     // pages with the most free bytes first, we make it more likely that when
     // evacuating a page, already swept pages will have enough free bytes to
     // hold the objects to move (and therefore, we won't need to wait for more
     // pages to be swept in order to move those objects).
-    // We sort in descending order of live bytes, i.e., ascending order of free
-    // bytes, because GetSweepingPageSafe returns pages in reverse order.
+    // We sort in descending order of live bytes, i.e., ascending order of
+    // free bytes, because GetSweepingPageSafe returns pages in reverse order.
     int space_index = GetSweepSpaceIndex(space);
+    DCHECK_IMPLIES(space == NEW_SPACE, sweeping_list_[space_index].empty());
     std::sort(
         sweeping_list_[space_index].begin(), sweeping_list_[space_index].end(),
-        [marking_state = marking_state_](Page* a, Page* b) {
-          return marking_state->live_bytes(a) > marking_state->live_bytes(b);
-        });
+        [](Page* a, Page* b) { return a->live_bytes() > b->live_bytes(); });
   });
 }
 
-int Sweeper::NumberOfConcurrentSweepers() const {
-  DCHECK(v8_flags.concurrent_sweeping);
-  return std::min(Sweeper::kMaxSweeperTasks,
-                  V8::GetCurrentPlatform()->NumberOfWorkerThreads() + 1);
+void Sweeper::StartMinorSweeping() {
+  DCHECK_EQ(GarbageCollector::MINOR_MARK_SWEEPER,
+            heap_->tracer()->GetCurrentCollector());
+  minor_sweeping_state_.StartSweeping();
+  int new_space_index = GetSweepSpaceIndex(NEW_SPACE);
+  std::sort(sweeping_list_[new_space_index].begin(),
+            sweeping_list_[new_space_index].end(),
+            [](Page* a, Page* b) { return a->live_bytes() > b->live_bytes(); });
 }
 
 namespace {
@@ -405,43 +656,32 @@ bool ShouldUpdateRememberedSets(Heap* heap) {
     // Keep track of OLD_TO_SHARED slots
     return true;
   }
-  if (heap->ShouldZapGarbage()) {
+  if (heap::ShouldZapGarbage()) {
     return true;
   }
   return false;
 }
 }  // namespace
 
-void Sweeper::StartSweeperTasks() {
-  DCHECK(current_new_space_collector_.has_value());
-  DCHECK(!job_handle_ || !job_handle_->IsValid());
-  if (promoted_pages_for_iteration_count_ > 0) {
-    DCHECK(v8_flags.minor_mc);
-    DCHECK_EQ(GarbageCollector::MINOR_MARK_COMPACTOR,
-              current_new_space_collector_);
-
-    DCHECK(snapshot_normal_pages_set_.empty());
-    DCHECK(snapshot_large_pages_set_.empty());
+void Sweeper::StartMajorSweeperTasks() {
+  DCHECK_IMPLIES(v8_flags.minor_ms, GarbageCollector::MARK_COMPACTOR ==
+                                        heap_->tracer()->GetCurrentCollector());
+  DCHECK(!minor_sweeping_in_progress());
+  DCHECK(!promoted_page_iteration_in_progress_);
+  DCHECK_EQ(0, promoted_pages_for_iteration_count_);
+  major_sweeping_state_.StartConcurrentSweeping();
+}
 
-    DCHECK(!promoted_page_iteration_in_progress_);
+void Sweeper::StartMinorSweeperTasks() {
+  DCHECK(v8_flags.minor_ms);
+  DCHECK_EQ(GarbageCollector::MINOR_MARK_SWEEPER,
+            heap_->tracer()->GetCurrentCollector());
+  DCHECK(!promoted_page_iteration_in_progress_);
+  if (promoted_pages_for_iteration_count_ > 0) {
     should_iterate_promoted_pages_ = ShouldUpdateRememberedSets(heap_);
-    if (should_iterate_promoted_pages_) {
-      SnapshotPageSets();
-    }
     promoted_page_iteration_in_progress_.store(true, std::memory_order_release);
   }
-  if (v8_flags.concurrent_sweeping && sweeping_in_progress_ &&
-      !heap_->delay_sweeper_tasks_for_testing_) {
-    if (concurrent_sweepers_.empty()) {
-      for (int i = 0; i < NumberOfConcurrentSweepers(); ++i) {
-        concurrent_sweepers_.emplace_back(this);
-      }
-    }
-    DCHECK_EQ(NumberOfConcurrentSweepers(), concurrent_sweepers_.size());
-    job_handle_ = V8::GetCurrentPlatform()->PostJob(
-        TaskPriority::kUserVisible,
-        std::make_unique<SweeperJob>(heap_->isolate(), this));
-  }
+  minor_sweeping_state_.StartConcurrentSweeping();
 }
 
 Page* Sweeper::GetSweptPageSafe(PagedSpaceBase* space) {
@@ -468,71 +708,55 @@ Sweeper::SweptList Sweeper::GetAllSweptPagesSafe(PagedSpaceBase* space) {
   return list;
 }
 
-void Sweeper::FinalizeLocalSweepers() {
-  DCHECK_EQ(promoted_pages_for_iteration_count_,
-            iterated_promoted_pages_count_);
-  main_thread_local_sweeper_.Finalize();
+void Sweeper::FinishMajorJobs() {
+  if (!major_sweeping_in_progress()) return;
 
-  for (ConcurrentSweeper& concurrent_sweeper : concurrent_sweepers_) {
-    concurrent_sweeper.Finalize();
-  }
-}
-
-void Sweeper::EnsureCompleted() {
-  AssertMainThreadOrSharedMainThread(heap_);
-
-  if (!sweeping_in_progress_) return;
-
-  // If sweeping is not completed or not running at all, we try to complete it
-  // here.
-  if (should_sweep_non_new_spaces_) {
-    TRACE_GC_EPOCH(heap_->tracer(), GCTracer::Scope::MC_COMPLETE_SWEEPING,
-                   ThreadKind::kMain);
-    ForAllSweepingSpaces([this](AllocationSpace space) {
-      if (space == NEW_SPACE) return;
-      main_thread_local_sweeper_.ParallelSweepSpace(
-          space, SweepingMode::kLazyOrConcurrent, 0);
-    });
-  }
-  TRACE_GC_EPOCH(heap_->tracer(), GetTracingScopeForCompleteYoungSweep(),
-                 ThreadKind::kMain);
-  main_thread_local_sweeper_.ParallelSweepSpace(
-      NEW_SPACE, SweepingMode::kLazyOrConcurrent, 0);
-  // Array buffer sweeper may have grabbed a page for iteration to contribute.
-  // Wait until it has finished iterating.
-  main_thread_local_sweeper_.ContributeAndWaitForPromotedPagesIteration();
+  ForAllSweepingSpaces([this](AllocationSpace space) {
+    if (space == NEW_SPACE) return;
+    main_thread_local_sweeper_.ParallelSweepSpace(
+        space, SweepingMode::kLazyOrConcurrent, 0);
+  });
 
-  if (job_handle_ && job_handle_->IsValid()) job_handle_->Join();
+  // Join all concurrent tasks.
+  major_sweeping_state_.JoinSweeping();
+  // All jobs are done but we still remain in sweeping state here.
+  DCHECK(major_sweeping_in_progress());
 
   ForAllSweepingSpaces([this](AllocationSpace space) {
+    if (space == NEW_SPACE) return;
     CHECK(sweeping_list_[GetSweepSpaceIndex(space)].empty());
     DCHECK(IsSweepingDoneForSpace(space));
   });
+}
 
-  FinalizeLocalSweepers();
-  DCHECK(main_thread_local_sweeper_.IsEmpty());
+void Sweeper::EnsureMajorCompleted() {
+  AssertMainThreadOrSharedMainThread(heap_);
 
-  concurrent_sweepers_.clear();
+  // If sweeping is not completed or not running at all, we try to complete it
+  // here.
 
-  current_new_space_collector_.reset();
-  should_sweep_non_new_spaces_ = false;
-  {
-    base::MutexGuard guard(&promoted_pages_iteration_notification_mutex_);
-    DCHECK_EQ(promoted_pages_for_iteration_count_,
-              iterated_promoted_pages_count_);
-    base::AsAtomicPtr(&promoted_pages_for_iteration_count_)
-        ->store(0, std::memory_order_relaxed);
-    iterated_promoted_pages_count_ = 0;
+  if (minor_sweeping_in_progress()) {
+    TRACE_GC_EPOCH_WITH_FLOW(
+        heap_->tracer(), GCTracer::Scope::MINOR_MS_COMPLETE_SWEEPING,
+        ThreadKind::kMain,
+        GetTraceIdForFlowEvent(GCTracer::Scope::MINOR_MS_COMPLETE_SWEEPING),
+        TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
+    EnsureMinorCompleted();
   }
-  snapshot_large_pages_set_.clear();
-  snapshot_normal_pages_set_.clear();
-  sweeping_in_progress_ = false;
-}
 
-void Sweeper::PauseAndEnsureNewSpaceCompleted() {
-  AssertMainThreadOrSharedMainThread(heap_);
+  if (major_sweeping_in_progress()) {
+    TRACE_GC_EPOCH_WITH_FLOW(
+        heap_->tracer(), GCTracer::Scope::MC_COMPLETE_SWEEPING,
+        ThreadKind::kMain,
+        GetTraceIdForFlowEvent(GCTracer::Scope::MC_COMPLETE_SWEEPING),
+        TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
+    FinishMajorJobs();
+    major_sweeping_state_.FinishSweeping();
+  }
+}
 
-  if (!sweeping_in_progress_) return;
+void Sweeper::FinishMinorJobs() {
+  if (!minor_sweeping_in_progress()) return;
 
   main_thread_local_sweeper_.ParallelSweepSpace(
       NEW_SPACE, SweepingMode::kLazyOrConcurrent, 0);
@@ -540,33 +764,41 @@ void Sweeper::PauseAndEnsureNewSpaceCompleted() {
   // Wait until it has finished iterating.
   main_thread_local_sweeper_.ContributeAndWaitForPromotedPagesIteration();
 
-  if (job_handle_ && job_handle_->IsValid()) job_handle_->Cancel();
+  // Join all concurrent tasks.
+  minor_sweeping_state_.JoinSweeping();
+  // All jobs are done but we still remain in sweeping state here.
+  DCHECK(minor_sweeping_in_progress());
 
   CHECK(sweeping_list_[GetSweepSpaceIndex(NEW_SPACE)].empty());
   DCHECK(IsSweepingDoneForSpace(NEW_SPACE));
-  CHECK(sweeping_list_for_promoted_page_iteration_.empty());
-
-  FinalizeLocalSweepers();
-  DCHECK(main_thread_local_sweeper_.IsEmpty());
 
-  current_new_space_collector_.reset();
   DCHECK_EQ(promoted_pages_for_iteration_count_,
             iterated_promoted_pages_count_);
-  base::AsAtomicPtr(&promoted_pages_for_iteration_count_)
-      ->store(0, std::memory_order_relaxed);
+  CHECK(sweeping_list_for_promoted_page_iteration_.empty());
+}
+
+void Sweeper::EnsureMinorCompleted() {
+  if (!minor_sweeping_in_progress()) return;
+
+  FinishMinorJobs();
+  minor_sweeping_state_.FinishSweeping();
+
+  promoted_pages_for_iteration_count_ = 0;
   iterated_promoted_pages_count_ = 0;
-  snapshot_large_pages_set_.clear();
-  snapshot_normal_pages_set_.clear();
 }
 
 void Sweeper::DrainSweepingWorklistForSpace(AllocationSpace space) {
-  if (!sweeping_in_progress_) return;
+  if (!sweeping_in_progress_for_space(space)) return;
   main_thread_local_sweeper_.ParallelSweepSpace(
       space, SweepingMode::kLazyOrConcurrent, 0);
 }
 
-bool Sweeper::AreSweeperTasksRunning() {
-  return job_handle_ && job_handle_->IsValid() && job_handle_->IsActive();
+bool Sweeper::AreMinorSweeperTasksRunning() {
+  return minor_sweeping_state_.HasActiveJob();
+}
+
+bool Sweeper::AreMajorSweeperTasksRunning() {
+  return major_sweeping_state_.HasActiveJob();
 }
 
 namespace {
@@ -587,27 +819,26 @@ V8_INLINE void AtomicZapBlock(Address addr, size_t size_in_bytes) {
 
 V8_INLINE size_t Sweeper::FreeAndProcessFreedMemory(
     Address free_start, Address free_end, Page* page, Space* space,
-    FreeSpaceTreatmentMode free_space_treatment_mode) {
+    FreeSpaceTreatmentMode free_space_treatment_mode,
+    bool should_reduce_memory) {
   CHECK_GT(free_end, free_start);
   size_t freed_bytes = 0;
   size_t size = static_cast<size_t>(free_end - free_start);
   if (free_space_treatment_mode == FreeSpaceTreatmentMode::kZapFreeSpace) {
+    CodePageMemoryModificationScope memory_modification_scope(page);
     AtomicZapBlock(free_start, size);
   }
   page->heap()->CreateFillerObjectAtSweeper(free_start, static_cast<int>(size));
   freed_bytes = reinterpret_cast<PagedSpaceBase*>(space)->UnaccountedFree(
       free_start, size);
-  if (should_reduce_memory_) page->DiscardUnusedMemory(free_start, size);
+  if (should_reduce_memory) page->DiscardUnusedMemory(free_start, size);
 
   return freed_bytes;
 }
 
 V8_INLINE void Sweeper::CleanupRememberedSetEntriesForFreedMemory(
     Address free_start, Address free_end, Page* page, bool record_free_ranges,
-    TypedSlotSet::FreeRangesMap* free_ranges_map, SweepingMode sweeping_mode,
-    InvalidatedSlotsCleanup* invalidated_old_to_new_cleanup,
-    InvalidatedSlotsCleanup* invalidated_old_to_old_cleanup,
-    InvalidatedSlotsCleanup* invalidated_old_to_shared_cleanup) {
+    TypedSlotSet::FreeRangesMap* free_ranges_map, SweepingMode sweeping_mode) {
   DCHECK_LE(free_start, free_end);
   if (sweeping_mode == SweepingMode::kEagerDuringGC) {
     // New space and in consequence the old-to-new remembered set is always
@@ -617,6 +848,8 @@ V8_INLINE void Sweeper::CleanupRememberedSetEntriesForFreedMemory(
     // sweeper thread would race with the main thread.
     RememberedSet<OLD_TO_NEW>::RemoveRange(page, free_start, free_end,
                                            SlotSet::KEEP_EMPTY_BUCKETS);
+    RememberedSet<OLD_TO_NEW_BACKGROUND>::RemoveRange(
+        page, free_start, free_end, SlotSet::KEEP_EMPTY_BUCKETS);
 
     // While we only add old-to-old slots on live objects, we can still end up
     // with old-to-old slots in free memory with e.g. right-trimming of objects.
@@ -636,10 +869,6 @@ V8_INLINE void Sweeper::CleanupRememberedSetEntriesForFreedMemory(
         static_cast<uint32_t>(free_start - page->address()),
         static_cast<uint32_t>(free_end - page->address())));
   }
-
-  invalidated_old_to_new_cleanup->Free(free_start, free_end);
-  invalidated_old_to_old_cleanup->Free(free_start, free_end);
-  invalidated_old_to_shared_cleanup->Free(free_start, free_end);
 }
 
 void Sweeper::CleanupTypedSlotsInFreeMemory(
@@ -668,7 +897,7 @@ void Sweeper::CleanupTypedSlotsInFreeMemory(
 
 void Sweeper::ClearMarkBitsAndHandleLivenessStatistics(Page* page,
                                                        size_t live_bytes) {
-  marking_state_->bitmap(page)->Clear();
+  page->marking_bitmap()->Clear<AccessMode::NON_ATOMIC>();
   // Keep the old live bytes counter of the page until RefillFreeList, where
   // the space size is refined.
   // The allocated_bytes() counter is precisely the total size of objects.
@@ -676,28 +905,27 @@ void Sweeper::ClearMarkBitsAndHandleLivenessStatistics(Page* page,
 }
 
 int Sweeper::RawSweep(Page* p, FreeSpaceTreatmentMode free_space_treatment_mode,
-                      SweepingMode sweeping_mode) {
+                      SweepingMode sweeping_mode, bool should_reduce_memory,
+                      bool is_promoted_page) {
   Space* space = p->owner();
   DCHECK_NOT_NULL(space);
   DCHECK(space->identity() == OLD_SPACE || space->identity() == CODE_SPACE ||
          space->identity() == SHARED_SPACE ||
-         (space->identity() == NEW_SPACE && v8_flags.minor_mc));
-  DCHECK(!p->IsEvacuationCandidate() && !p->SweepingDone());
+         (space->identity() == NEW_SPACE && v8_flags.minor_ms));
+  DCHECK(!p->IsEvacuationCandidate());
+  DCHECK(!p->SweepingDone());
+  DCHECK_IMPLIES(space->identity() == NEW_SPACE || is_promoted_page,
+                 !heap_->incremental_marking()->IsMinorMarking());
+  DCHECK_IMPLIES(space->identity() != NEW_SPACE && !is_promoted_page,
+                 !heap_->incremental_marking()->IsMajorMarking());
+  DCHECK_IMPLIES(is_promoted_page, v8_flags.minor_ms);
+  DCHECK_IMPLIES(is_promoted_page, space->identity() == OLD_SPACE);
 
   // Phase 1: Prepare the page for sweeping.
-  base::Optional<CodePageMemoryModificationScope> write_scope;
-  if (space->identity() == CODE_SPACE) write_scope.emplace(p);
-
-  // Set the allocated_bytes_ counter to area_size and clear the wasted_memory_
-  // counter. The free operations below will decrease allocated_bytes_ to actual
-  // live bytes and keep track of wasted_memory_.
-  p->ResetAllocationStatistics();
-
-  CodeObjectRegistry* code_object_registry = p->GetCodeObjectRegistry();
   std::vector<Address> code_objects;
 
   base::Optional<ActiveSystemPages> active_system_pages_after_sweeping;
-  if (should_reduce_memory_) {
+  if (should_reduce_memory) {
     // Only decrement counter when we discard unused system pages.
     active_system_pages_after_sweeping = ActiveSystemPages();
     active_system_pages_after_sweeping->Init(
@@ -712,53 +940,43 @@ int Sweeper::RawSweep(Page* p, FreeSpaceTreatmentMode free_space_treatment_mode,
   size_t live_bytes = 0;
   size_t max_freed_bytes = 0;
 
-  bool record_free_ranges = p->typed_slot_set<OLD_TO_NEW>() != nullptr ||
-                            p->typed_slot_set<OLD_TO_OLD>() != nullptr ||
-                            p->typed_slot_set<OLD_TO_SHARED>() != nullptr ||
-                            DEBUG_BOOL;
-
-  // Clean invalidated slots in free memory during the final atomic pause. After
-  // resuming execution this isn't necessary, invalid slots were already removed
-  // by mark compact's update pointers phase. So there are no invalid slots left
-  // in free memory.
-  InvalidatedSlotsCleanup invalidated_old_to_new_cleanup =
-      InvalidatedSlotsCleanup::NoCleanup(p);
-  InvalidatedSlotsCleanup invalidated_old_to_old_cleanup =
-      InvalidatedSlotsCleanup::NoCleanup(p);
-  InvalidatedSlotsCleanup invalidated_old_to_shared_cleanup =
-      InvalidatedSlotsCleanup::NoCleanup(p);
-  if (sweeping_mode == SweepingMode::kEagerDuringGC) {
-    invalidated_old_to_new_cleanup = InvalidatedSlotsCleanup::OldToNew(p);
-    invalidated_old_to_old_cleanup = InvalidatedSlotsCleanup::OldToOld(p);
-    invalidated_old_to_shared_cleanup = InvalidatedSlotsCleanup::OldToShared(p);
-  }
+  // Promoted pages have no interesting remebered sets yet.
+  bool record_free_ranges =
+      (!is_promoted_page && (p->typed_slot_set<OLD_TO_NEW>() != nullptr ||
+                             p->typed_slot_set<OLD_TO_OLD>() != nullptr ||
+                             p->typed_slot_set<OLD_TO_SHARED>() != nullptr)) ||
+      DEBUG_BOOL;
 
   // The free ranges map is used for filtering typed slots.
   TypedSlotSet::FreeRangesMap free_ranges_map;
 
+  base::Optional<PromotedPageRecordMigratedSlotVisitor> promoted_object_visitor;
+  if (is_promoted_page) {
+    promoted_object_visitor.emplace(p);
+  }
+
   // Iterate over the page using the live objects and free the memory before
   // the given live object.
   Address free_start = p->area_start();
   PtrComprCageBase cage_base(heap_->isolate());
-  for (auto object_and_size :
-       LiveObjectRange<kBlackObjects>(p, marking_state_->bitmap(p))) {
-    HeapObject const object = object_and_size.first;
-    if (code_object_registry) code_objects.push_back(object.address());
+  for (auto [object, size] : LiveObjectRange(p)) {
+    if (p->IsFlagSet(MemoryChunk::Flag::IS_EXECUTABLE))
+      code_objects.push_back(object.address());
     DCHECK(marking_state_->IsMarked(object));
+    if (is_promoted_page && should_iterate_promoted_pages_) {
+      promoted_object_visitor->Process(object);
+    }
     Address free_end = object.address();
     if (free_end != free_start) {
       max_freed_bytes =
           std::max(max_freed_bytes,
                    FreeAndProcessFreedMemory(free_start, free_end, p, space,
-                                             free_space_treatment_mode));
+                                             free_space_treatment_mode,
+                                             should_reduce_memory));
       CleanupRememberedSetEntriesForFreedMemory(
           free_start, free_end, p, record_free_ranges, &free_ranges_map,
-          sweeping_mode, &invalidated_old_to_new_cleanup,
-          &invalidated_old_to_old_cleanup, &invalidated_old_to_shared_cleanup);
+          sweeping_mode);
     }
-    Map map = object.map(cage_base, kAcquireLoad);
-    DCHECK(MarkCompactCollector::IsMapOrForwarded(map));
-    int size = ALIGN_TO_ALLOCATION_ALIGNMENT(object.SizeFromMap(map));
     live_bytes += size;
     free_start = free_end + size;
 
@@ -772,14 +990,13 @@ int Sweeper::RawSweep(Page* p, FreeSpaceTreatmentMode free_space_treatment_mode,
   // If there is free memory after the last live object also free that.
   Address free_end = p->area_end();
   if (free_end != free_start) {
-    max_freed_bytes =
-        std::max(max_freed_bytes,
-                 FreeAndProcessFreedMemory(free_start, free_end, p, space,
-                                           free_space_treatment_mode));
-    CleanupRememberedSetEntriesForFreedMemory(
-        free_start, free_end, p, record_free_ranges, &free_ranges_map,
-        sweeping_mode, &invalidated_old_to_new_cleanup,
-        &invalidated_old_to_old_cleanup, &invalidated_old_to_shared_cleanup);
+    max_freed_bytes = std::max(
+        max_freed_bytes, FreeAndProcessFreedMemory(
+                             free_start, free_end, p, space,
+                             free_space_treatment_mode, should_reduce_memory));
+    CleanupRememberedSetEntriesForFreedMemory(free_start, free_end, p,
+                                              record_free_ranges,
+                                              &free_ranges_map, sweeping_mode);
   }
 
   // Phase 3: Post process the page.
@@ -793,218 +1010,14 @@ int Sweeper::RawSweep(Page* p, FreeSpaceTreatmentMode free_space_treatment_mode,
                                          *active_system_pages_after_sweeping);
   }
 
-  if (code_object_registry) {
-    code_object_registry->ReinitializeFrom(std::move(code_objects));
+  if (p->IsFlagSet(MemoryChunk::Flag::IS_EXECUTABLE)) {
+    ThreadIsolation::UnregisterInstructionStreamsInPageExcept(p, code_objects);
   }
-  p->set_concurrent_sweeping_state(Page::ConcurrentSweepingState::kDone);
 
   return static_cast<int>(
       p->owner()->free_list()->GuaranteedAllocatable(max_freed_bytes));
 }
 
-namespace {
-
-class PromotedPageRecordMigratedSlotVisitor
-    : public ObjectVisitorWithCageBases {
- public:
-  PromotedPageRecordMigratedSlotVisitor(
-      Heap* heap,
-      Sweeper::CachedOldToNewRememberedSets*
-          snapshot_old_to_new_remembered_sets,
-      const MemoryAllocator::NormalPagesSet& snapshot_normal_pages_set,
-      const MemoryAllocator::LargePagesSet& snapshot_large_pages_set,
-      const MemoryAllocator::NormalPagesSet& snapshot_shared_normal_pages_set,
-      const MemoryAllocator::LargePagesSet& snapshot_shared_large_pages_set)
-      : ObjectVisitorWithCageBases(heap->isolate()),
-        heap_(heap),
-        snapshot_old_to_new_remembered_sets_(
-            snapshot_old_to_new_remembered_sets),
-        snapshot_normal_pages_set_(snapshot_normal_pages_set),
-        snapshot_large_pages_set_(snapshot_large_pages_set),
-        snapshot_shared_normal_pages_set_(snapshot_shared_normal_pages_set),
-        snapshot_shared_large_pages_set_(snapshot_shared_large_pages_set) {}
-
-  inline void VisitPointer(HeapObject host, ObjectSlot p) final {
-    DCHECK(!HasWeakHeapObjectTag(p.Relaxed_Load(cage_base())));
-    RecordMigratedSlot(host,
-                       MaybeObject::FromObject(p.Relaxed_Load(cage_base())),
-                       p.address());
-  }
-
-  inline void VisitMapPointer(HeapObject host) final {
-    VisitPointer(host, host.map_slot());
-  }
-
-  inline void VisitPointer(HeapObject host, MaybeObjectSlot p) final {
-    DCHECK(!MapWord::IsPacked(p.Relaxed_Load(cage_base()).ptr()));
-    RecordMigratedSlot(host, p.Relaxed_Load(cage_base()), p.address());
-  }
-
-  inline void VisitPointers(HeapObject host, ObjectSlot start,
-                            ObjectSlot end) final {
-    while (start < end) {
-      VisitPointer(host, start);
-      ++start;
-    }
-  }
-
-  inline void VisitPointers(HeapObject host, MaybeObjectSlot start,
-                            MaybeObjectSlot end) final {
-    while (start < end) {
-      VisitPointer(host, start);
-      ++start;
-    }
-  }
-
-  inline void VisitCodePointer(Code host, CodeObjectSlot slot) final {
-    CHECK(V8_EXTERNAL_CODE_SPACE_BOOL);
-    // This code is similar to the implementation of VisitPointer() modulo
-    // new kind of slot.
-    DCHECK(!HasWeakHeapObjectTag(slot.Relaxed_Load(code_cage_base())));
-    Object code = slot.Relaxed_Load(code_cage_base());
-    RecordMigratedSlot(host, MaybeObject::FromObject(code), slot.address());
-  }
-
-  inline void VisitEphemeron(HeapObject host, int index, ObjectSlot key,
-                             ObjectSlot value) override {
-    DCHECK(host.IsEphemeronHashTable());
-    DCHECK(!Heap::InYoungGeneration(host));
-
-    VisitPointer(host, value);
-    VisitPointer(host, key);
-  }
-
-  void VisitCodeTarget(RelocInfo* rinfo) final { UNREACHABLE(); }
-  void VisitEmbeddedPointer(RelocInfo* rinfo) final { UNREACHABLE(); }
-
-  // Entries that are skipped for recording.
-  inline void VisitExternalReference(RelocInfo* rinfo) final {}
-  inline void VisitInternalReference(RelocInfo* rinfo) final {}
-  inline void VisitExternalPointer(HeapObject host, ExternalPointerSlot slot,
-                                   ExternalPointerTag tag) final {}
-
- protected:
-  inline void RecordMigratedSlot(HeapObject host, MaybeObject value,
-                                 Address slot) {
-    DCHECK(!host.InWritableSharedSpace());
-    DCHECK(!Heap::InYoungGeneration(host));
-    DCHECK(!MemoryChunk::FromHeapObject(host)->SweepingDone());
-    if (value->IsStrongOrWeak()) {
-      RecordOldToNewMigratedSlot(host, value, slot);
-      RecordOldToSharedMigratedSlot(host, value, slot);
-    }
-  }
-
-  inline void RecordOldToNewMigratedSlot(HeapObject host, MaybeObject value,
-                                         Address slot) {
-    const MemoryChunk* value_chunk =
-        MemoryAllocator::LookupChunkContainingAddress(
-            snapshot_normal_pages_set_, snapshot_large_pages_set_, value.ptr());
-    if (!value_chunk) return;
-#ifdef THREAD_SANITIZER
-    value_chunk->SynchronizedHeapLoad();
-#endif  // THREAD_SANITIZER
-    if (!value_chunk->InYoungGeneration()) return;
-    MemoryChunk* host_chunk = MemoryChunk::FromHeapObject(host);
-    if (snapshot_old_to_new_remembered_sets_->find(host_chunk) ==
-        snapshot_old_to_new_remembered_sets_->end()) {
-      snapshot_old_to_new_remembered_sets_->emplace(
-          host_chunk, SlotSet::Allocate(host_chunk->buckets()));
-    }
-    RememberedSetOperations::Insert<AccessMode::NON_ATOMIC>(
-        (*snapshot_old_to_new_remembered_sets_)[host_chunk], host_chunk, slot);
-  }
-
-  inline void RecordOldToSharedMigratedSlot(HeapObject host, MaybeObject value,
-                                            Address slot) {
-    const MemoryChunk* value_chunk =
-        MemoryAllocator::LookupChunkContainingAddress(
-            snapshot_shared_normal_pages_set_, snapshot_shared_large_pages_set_,
-            value.ptr());
-    if (!value_chunk) return;
-#ifdef THREAD_SANITIZER
-    value_chunk->SynchronizedHeapLoad();
-#endif  // THREAD_SANITIZER
-    if (!value_chunk->InWritableSharedSpace()) return;
-    RememberedSet<OLD_TO_SHARED>::Insert<AccessMode::ATOMIC>(
-        MemoryChunk::FromHeapObject(host), slot);
-  }
-
-  Heap* const heap_;
-  Sweeper::CachedOldToNewRememberedSets* snapshot_old_to_new_remembered_sets_;
-  const MemoryAllocator::NormalPagesSet& snapshot_normal_pages_set_;
-  const MemoryAllocator::LargePagesSet& snapshot_large_pages_set_;
-  const MemoryAllocator::NormalPagesSet& snapshot_shared_normal_pages_set_;
-  const MemoryAllocator::LargePagesSet& snapshot_shared_large_pages_set_;
-};
-
-inline void HandlePromotedObject(
-    HeapObject object, NonAtomicMarkingState* marking_state,
-    PtrComprCageBase cage_base,
-    PromotedPageRecordMigratedSlotVisitor* record_visitor) {
-  DCHECK(marking_state->IsMarked(object));
-  DCHECK(!IsCodeSpaceObject(object));
-  object.IterateFast(cage_base, record_visitor);
-  if (object.IsJSArrayBuffer()) {
-    JSArrayBuffer::cast(object).YoungMarkExtensionPromoted();
-  }
-}
-
-inline void HandleFreeSpace(Address free_start, Address free_end, Heap* heap) {
-  if (!heap->ShouldZapGarbage()) return;
-  if (free_end == free_start) return;
-  size_t size = static_cast<size_t>(free_end - free_start);
-  DCHECK(
-      heap->non_atomic_marking_state()
-          ->bitmap(Page::FromAddress(free_start))
-          ->AllBitsClearInRange(
-              Page::FromAddress(free_start)->AddressToMarkbitIndex(free_start),
-              Page::FromAddress(free_start)->AddressToMarkbitIndex(free_end)));
-  AtomicZapBlock(free_start, size);
-  heap->CreateFillerObjectAtSweeper(free_start, static_cast<int>(size));
-}
-
-}  // namespace
-
-void Sweeper::RawIteratePromotedPageForRememberedSets(
-    MemoryChunk* chunk,
-    CachedOldToNewRememberedSets* old_to_new_remembered_sets) {
-  DCHECK(v8_flags.minor_mc);
-  DCHECK(chunk->owner_identity() == OLD_SPACE ||
-         chunk->owner_identity() == LO_SPACE);
-  DCHECK(!chunk->SweepingDone());
-  DCHECK(!chunk->IsEvacuationCandidate());
-
-  // Iterate over the page using the live objects and free the memory before
-  // the given live object.
-  PtrComprCageBase cage_base(heap_->isolate());
-  PromotedPageRecordMigratedSlotVisitor record_visitor(
-      heap_, old_to_new_remembered_sets, snapshot_normal_pages_set_,
-      snapshot_large_pages_set_, snapshot_shared_normal_pages_set_,
-      snapshot_shared_large_pages_set_);
-  DCHECK(!heap_->incremental_marking()->IsMarking());
-  if (chunk->IsLargePage()) {
-    HandlePromotedObject(static_cast<LargePage*>(chunk)->GetObject(),
-                         marking_state_, cage_base, &record_visitor);
-  } else {
-    PtrComprCageBase cage_base(chunk->heap()->isolate());
-    Address free_start = chunk->area_start();
-    for (auto object_and_size :
-         LiveObjectRange<kBlackObjects>(chunk, marking_state_->bitmap(chunk))) {
-      HeapObject object = object_and_size.first;
-      HandlePromotedObject(object, marking_state_, cage_base, &record_visitor);
-      Address free_end = object.address();
-      HandleFreeSpace(free_start, free_end, heap_);
-      Map map = object.map(cage_base, kAcquireLoad);
-      int size = object.SizeFromMap(map);
-      free_start = free_end + size;
-    }
-    HandleFreeSpace(free_start, chunk->area_end(), heap_);
-  }
-  marking_state_->ClearLiveness(chunk);
-  chunk->set_concurrent_sweeping_state(Page::ConcurrentSweepingState::kDone);
-}
-
 bool Sweeper::IsIteratingPromotedPages() const {
   return promoted_page_iteration_in_progress_.load(std::memory_order_acquire);
 }
@@ -1013,10 +1026,13 @@ void Sweeper::ContributeAndWaitForPromotedPagesIteration() {
   main_thread_local_sweeper_.ContributeAndWaitForPromotedPagesIteration();
 }
 
-void Sweeper::IncrementAndNotifyPromotedPagesIterationFinishedIfNeeded() {
-  if (++iterated_promoted_pages_count_ < promoted_pages_for_iteration_count_)
-    return;
-  NotifyPromotedPagesIterationFinished();
+void Sweeper::NotifyPromotedPageIterationFinished(MemoryChunk* chunk) {
+  if (++iterated_promoted_pages_count_ == promoted_pages_for_iteration_count_) {
+    NotifyPromotedPagesIterationFinished();
+  }
+  chunk->set_concurrent_sweeping_state(Page::ConcurrentSweepingState::kDone);
+  base::MutexGuard guard(&mutex_);
+  cv_page_swept_.NotifyAll();
 }
 
 void Sweeper::NotifyPromotedPagesIterationFinished() {
@@ -1027,16 +1043,24 @@ void Sweeper::NotifyPromotedPagesIterationFinished() {
   promoted_pages_iteration_notification_variable_.NotifyAll();
 }
 
-size_t Sweeper::ConcurrentSweepingPageCount() {
-  DCHECK(sweeping_in_progress());
+size_t Sweeper::ConcurrentMinorSweepingPageCount() {
+  DCHECK(minor_sweeping_in_progress());
   base::MutexGuard guard(&mutex_);
-  base::MutexGuard promoted_pages_guard(&promoted_pages_iteration_mutex_);
   size_t promoted_pages_count =
       sweeping_list_for_promoted_page_iteration_.size();
   size_t count = should_iterate_promoted_pages_
                      ? promoted_pages_count
                      : std::min(static_cast<size_t>(1), promoted_pages_count);
+  count += sweeping_list_[GetSweepSpaceIndex(NEW_SPACE)].size();
+  return count;
+}
+
+size_t Sweeper::ConcurrentMajorSweepingPageCount() {
+  DCHECK(major_sweeping_in_progress());
+  base::MutexGuard guard(&mutex_);
+  size_t count = 0;
   for (int i = 0; i < kNumberOfSweepingSpaces; i++) {
+    if (i == GetSweepSpaceIndex(NEW_SPACE)) continue;
     count += sweeping_list_[i].size();
   }
   return count;
@@ -1060,21 +1084,32 @@ void Sweeper::EnsurePageIsSwept(Page* page) {
       // Page was successfully removed and can now be swept.
       main_thread_local_sweeper_.ParallelSweepPage(
           page, space, SweepingMode::kLazyOrConcurrent);
-    } else {
+    } else if (TryRemovePromotedPageSafe(page)) {
+      // Page was successfully removed and can now be swept.
+      main_thread_local_sweeper_.ParallelIterateAndSweepPromotedPage(page);
+    }
+    {
       // Some sweeper task already took ownership of that page, wait until
       // sweeping is finished.
-      base::MutexGuard guard(&mutex_);
-      while (!page->SweepingDone()) {
-        cv_page_swept_.Wait(&mutex_);
-      }
+      WaitForPageToBeSwept(page);
     }
   } else {
-    DCHECK(page->InNewSpace() && !v8_flags.minor_mc);
+    DCHECK(page->InNewSpace() && !v8_flags.minor_ms);
   }
 
   CHECK(page->SweepingDone());
 }
 
+void Sweeper::WaitForPageToBeSwept(Page* page) {
+  AssertMainThreadOrSharedMainThread(heap_);
+  DCHECK(sweeping_in_progress());
+
+  base::MutexGuard guard(&mutex_);
+  while (!page->SweepingDone()) {
+    cv_page_swept_.Wait(&mutex_);
+  }
+}
+
 bool Sweeper::TryRemoveSweepingPageSafe(AllocationSpace space, Page* page) {
   base::MutexGuard guard(&mutex_);
   DCHECK(IsValidSweepingSpace(space));
@@ -1091,80 +1126,76 @@ bool Sweeper::TryRemoveSweepingPageSafe(AllocationSpace space, Page* page) {
   return true;
 }
 
-void Sweeper::AddPage(AllocationSpace space, Page* page,
-                      Sweeper::AddPageMode mode, AccessMode mutex_mode) {
+bool Sweeper::TryRemovePromotedPageSafe(MemoryChunk* chunk) {
+  base::MutexGuard guard(&mutex_);
+  auto position =
+      std::find(sweeping_list_for_promoted_page_iteration_.begin(),
+                sweeping_list_for_promoted_page_iteration_.end(), chunk);
+  if (position == sweeping_list_for_promoted_page_iteration_.end())
+    return false;
+  sweeping_list_for_promoted_page_iteration_.erase(position);
+  return true;
+}
+
+void Sweeper::AddPage(AllocationSpace space, Page* page) {
   DCHECK_NE(NEW_SPACE, space);
-  AddPageImpl(space, page, mode, mutex_mode);
+  AddPageImpl(space, page);
 }
 
-void Sweeper::AddNewSpacePage(Page* page, AccessMode mutex_mode) {
+void Sweeper::AddNewSpacePage(Page* page) {
   DCHECK_EQ(NEW_SPACE, page->owner_identity());
-  size_t live_bytes = marking_state_->live_bytes(page);
+  DCHECK_LE(page->AgeInNewSpace(), v8_flags.minor_ms_max_page_age);
+  size_t live_bytes = page->live_bytes();
   heap_->IncrementNewSpaceSurvivingObjectSize(live_bytes);
   heap_->IncrementYoungSurvivorsCounter(live_bytes);
-  page->ClearWasUsedForAllocation();
-  AddPageImpl(NEW_SPACE, page, AddPageMode::REGULAR, mutex_mode);
+  AddPageImpl(NEW_SPACE, page);
+  page->IncrementAgeInNewSpace();
+}
+
+void Sweeper::AddPageImpl(AllocationSpace space, Page* page) {
+  AssertMainThreadOrSharedMainThread(heap_);
+  DCHECK(IsValidSweepingSpace(space));
+  DCHECK_IMPLIES(v8_flags.concurrent_sweeping && (space != NEW_SPACE),
+                 !major_sweeping_state_.HasValidJob());
+  DCHECK_IMPLIES(v8_flags.concurrent_sweeping,
+                 !minor_sweeping_state_.HasValidJob());
+  PrepareToBeSweptPage(space, page);
+  DCHECK_EQ(Page::ConcurrentSweepingState::kPending,
+            page->concurrent_sweeping_state());
+  sweeping_list_[GetSweepSpaceIndex(space)].push_back(page);
+  has_sweeping_work_[GetSweepSpaceIndex(space)].store(
+      true, std::memory_order_release);
 }
 
-void Sweeper::AddPromotedPageForIteration(MemoryChunk* chunk) {
-  DCHECK(heap_->IsMainThread());
+void Sweeper::AddPromotedPage(MemoryChunk* chunk) {
+  AssertMainThreadOrSharedMainThread(heap_);
   DCHECK(chunk->owner_identity() == OLD_SPACE ||
          chunk->owner_identity() == LO_SPACE);
   DCHECK_IMPLIES(v8_flags.concurrent_sweeping,
-                 !job_handle_ || !job_handle_->IsValid());
-  size_t live_bytes = marking_state_->live_bytes(chunk);
+                 !minor_sweeping_state_.HasValidJob());
+  size_t live_bytes = chunk->live_bytes();
   DCHECK_GE(chunk->area_size(), live_bytes);
   heap_->IncrementPromotedObjectsSize(live_bytes);
   heap_->IncrementYoungSurvivorsCounter(live_bytes);
-#if DEBUG
+  DCHECK_EQ(Page::ConcurrentSweepingState::kDone,
+            chunk->concurrent_sweeping_state());
   if (!chunk->IsLargePage()) {
-    static_cast<Page*>(chunk)->ForAllFreeListCategories(
-        [chunk](FreeListCategory* category) {
-          DCHECK(!category->is_linked(chunk->owner()->free_list()));
-        });
+    PrepareToBeSweptPage(chunk->owner_identity(), static_cast<Page*>(chunk));
+  } else {
+    chunk->set_concurrent_sweeping_state(
+        Page::ConcurrentSweepingState::kPending);
   }
-#endif  // DEBUG
-  DCHECK_EQ(Page::ConcurrentSweepingState::kDone,
+  DCHECK_EQ(Page::ConcurrentSweepingState::kPending,
             chunk->concurrent_sweeping_state());
-  chunk->set_concurrent_sweeping_state(Page::ConcurrentSweepingState::kPending);
   // This method is called only from the main thread while sweeping tasks have
   // not yet started, thus a mutex is not needed.
   sweeping_list_for_promoted_page_iteration_.push_back(chunk);
   promoted_pages_for_iteration_count_++;
 }
 
-void Sweeper::AddPageImpl(AllocationSpace space, Page* page,
-                          Sweeper::AddPageMode mode, AccessMode mutex_mode) {
-  base::Optional<base::MutexGuard> guard;
-  if (mutex_mode == AccessMode::ATOMIC) {
-    guard.emplace(&mutex_);
-  } else {
-    // This assert only checks that the non_atomic version is only used on the
-    // main thread. It would not catch cases where main thread add a page
-    // non-atomically while concurrent jobs are adding pages atomically.
-    AssertMainThreadOrSharedMainThread(heap_);
-  }
-  DCHECK(IsValidSweepingSpace(space));
-  DCHECK_IMPLIES(v8_flags.concurrent_sweeping,
-                 !job_handle_ || !job_handle_->IsValid());
-  if (mode == Sweeper::REGULAR) {
-    PrepareToBeSweptPage(space, page);
-  } else {
-    // Page has been temporarily removed from the sweeper. Accounting already
-    // happened when the page was initially added, so it is skipped here.
-    DCHECK_EQ(Sweeper::READD_TEMPORARY_REMOVED_PAGE, mode);
-  }
-  DCHECK_EQ(Page::ConcurrentSweepingState::kPending,
-            page->concurrent_sweeping_state());
-  sweeping_list_[GetSweepSpaceIndex(space)].push_back(page);
-  has_sweeping_work_[GetSweepSpaceIndex(space)].store(
-      true, std::memory_order_release);
-}
-
 void Sweeper::PrepareToBeSweptPage(AllocationSpace space, Page* page) {
 #ifdef DEBUG
-  DCHECK_GE(page->area_size(),
-            static_cast<size_t>(marking_state_->live_bytes(page)));
+  DCHECK_GE(page->area_size(), static_cast<size_t>(page->live_bytes()));
   DCHECK_EQ(Page::ConcurrentSweepingState::kDone,
             page->concurrent_sweeping_state());
   page->ForAllFreeListCategories([page](FreeListCategory* category) {
@@ -1174,12 +1205,17 @@ void Sweeper::PrepareToBeSweptPage(AllocationSpace space, Page* page) {
   page->set_concurrent_sweeping_state(Page::ConcurrentSweepingState::kPending);
   PagedSpaceBase* paged_space;
   if (space == NEW_SPACE) {
-    DCHECK(v8_flags.minor_mc);
+    DCHECK(v8_flags.minor_ms);
     paged_space = heap_->paged_new_space()->paged_space();
   } else {
     paged_space = heap_->paged_space(space);
   }
-  paged_space->IncreaseAllocatedBytes(marking_state_->live_bytes(page), page);
+  paged_space->IncreaseAllocatedBytes(page->live_bytes(), page);
+
+  // Set the allocated_bytes_ counter to area_size and clear the wasted_memory_
+  // counter. The free operations during sweeping will decrease allocated_bytes_
+  // to actual live bytes and keep track of wasted_memory_.
+  page->ResetAllocationStatistics();
 }
 
 Page* Sweeper::GetSweepingPageSafe(AllocationSpace space) {
@@ -1199,8 +1235,8 @@ Page* Sweeper::GetSweepingPageSafe(AllocationSpace space) {
   return page;
 }
 
-MemoryChunk* Sweeper::GetPromotedPageForIterationSafe() {
-  base::MutexGuard guard(&promoted_pages_iteration_mutex_);
+MemoryChunk* Sweeper::GetPromotedPageSafe() {
+  base::MutexGuard guard(&mutex_);
   MemoryChunk* chunk = nullptr;
   if (!sweeping_list_for_promoted_page_iteration_.empty()) {
     chunk = sweeping_list_for_promoted_page_iteration_.back();
@@ -1210,7 +1246,7 @@ MemoryChunk* Sweeper::GetPromotedPageForIterationSafe() {
 }
 
 std::vector<MemoryChunk*> Sweeper::GetAllPromotedPagesForIterationSafe() {
-  base::MutexGuard guard(&promoted_pages_iteration_mutex_);
+  base::MutexGuard guard(&mutex_);
   std::vector<MemoryChunk*> pages;
   pages.swap(sweeping_list_for_promoted_page_iteration_);
   DCHECK(sweeping_list_for_promoted_page_iteration_.empty());
@@ -1219,21 +1255,14 @@ std::vector<MemoryChunk*> Sweeper::GetAllPromotedPagesForIterationSafe() {
 
 GCTracer::Scope::ScopeId Sweeper::GetTracingScope(AllocationSpace space,
                                                   bool is_joining_thread) {
-  if (space == NEW_SPACE &&
-      current_new_space_collector_ == GarbageCollector::MINOR_MARK_COMPACTOR) {
-    return is_joining_thread ? GCTracer::Scope::MINOR_MC_SWEEP
-                             : GCTracer::Scope::MINOR_MC_BACKGROUND_SWEEPING;
+  if (space == NEW_SPACE) {
+    return is_joining_thread ? GCTracer::Scope::MINOR_MS_SWEEP
+                             : GCTracer::Scope::MINOR_MS_BACKGROUND_SWEEPING;
   }
   return is_joining_thread ? GCTracer::Scope::MC_SWEEP
                            : GCTracer::Scope::MC_BACKGROUND_SWEEPING;
 }
 
-GCTracer::Scope::ScopeId Sweeper::GetTracingScopeForCompleteYoungSweep() {
-  return current_new_space_collector_ == GarbageCollector::MINOR_MARK_COMPACTOR
-             ? GCTracer::Scope::MINOR_MC_COMPLETE_SWEEPING
-             : GCTracer::Scope::MC_COMPLETE_SWEEPING;
-}
-
 bool Sweeper::IsSweepingDoneForSpace(AllocationSpace space) const {
   return !has_sweeping_work_[GetSweepSpaceIndex(space)].load(
       std::memory_order_acquire);
@@ -1241,6 +1270,7 @@ bool Sweeper::IsSweepingDoneForSpace(AllocationSpace space) const {
 
 void Sweeper::AddSweptPage(Page* page, AllocationSpace identity) {
   base::MutexGuard guard(&mutex_);
+  page->set_concurrent_sweeping_state(Page::ConcurrentSweepingState::kDone);
   swept_list_[GetSweepSpaceIndex(identity)].push_back(page);
   has_swept_pages_[GetSweepSpaceIndex(identity)].store(
       true, std::memory_order_release);
@@ -1248,16 +1278,16 @@ void Sweeper::AddSweptPage(Page* page, AllocationSpace identity) {
 }
 
 bool Sweeper::ShouldRefillFreelistForSpace(AllocationSpace space) const {
-  DCHECK_IMPLIES(space == NEW_SPACE, v8_flags.minor_mc);
+  DCHECK_IMPLIES(space == NEW_SPACE, v8_flags.minor_ms);
   return has_swept_pages_[GetSweepSpaceIndex(space)].load(
       std::memory_order_acquire);
 }
 
 void Sweeper::SweepEmptyNewSpacePage(Page* page) {
-  DCHECK(v8_flags.minor_mc);
+  DCHECK(v8_flags.minor_ms);
   DCHECK_EQ(NEW_SPACE, page->owner_identity());
-  DCHECK_EQ(0, marking_state_->live_bytes(page));
-  DCHECK(marking_state_->bitmap(page)->IsClean());
+  DCHECK_EQ(0, page->live_bytes());
+  DCHECK(page->marking_bitmap()->IsClean());
   DCHECK(heap_->IsMainThread() ||
          (heap_->IsSharedMainThread() &&
           !heap_->isolate()->is_shared_space_isolate()));
@@ -1271,7 +1301,7 @@ void Sweeper::SweepEmptyNewSpacePage(Page* page) {
   Address start = page->area_start();
   size_t size = page->area_size();
 
-  if (Heap::ShouldZapGarbage()) {
+  if (heap::ShouldZapGarbage()) {
     static constexpr Tagged_t kZapTagged = static_cast<Tagged_t>(kZapValue);
     const size_t size_in_tagged = size / kTaggedSize;
     Tagged_t* current_addr = reinterpret_cast<Tagged_t*>(start);
@@ -1281,8 +1311,9 @@ void Sweeper::SweepEmptyNewSpacePage(Page* page) {
     }
   }
 
-  page->ClearWasUsedForAllocation();
   page->ResetAllocationStatistics();
+  page->ResetAgeInNewSpace();
+  page->ClearFlag(Page::NEVER_ALLOCATE_ON_PAGE);
   heap_->CreateFillerObjectAtSweeper(start, static_cast<int>(size));
   paged_space->UnaccountedFree(start, size);
   paged_space->IncreaseAllocatedBytes(0, page);
@@ -1301,5 +1332,26 @@ void Sweeper::SweepEmptyNewSpacePage(Page* page) {
   }
 }
 
+Sweeper::PauseMajorSweepingScope::PauseMajorSweepingScope(Sweeper* sweeper)
+    : sweeper_(sweeper),
+      resume_on_exit_(sweeper->major_sweeping_in_progress()) {
+  DCHECK(v8_flags.minor_ms);
+  DCHECK_IMPLIES(resume_on_exit_, v8_flags.concurrent_sweeping);
+  sweeper_->major_sweeping_state_.Pause();
+}
+
+Sweeper::PauseMajorSweepingScope::~PauseMajorSweepingScope() {
+  if (resume_on_exit_) {
+    sweeper_->major_sweeping_state_.Resume();
+  }
+}
+
+uint64_t Sweeper::GetTraceIdForFlowEvent(
+    GCTracer::Scope::ScopeId scope_id) const {
+  return GCTracer::Scope::NeedsYoungEpoch(scope_id)
+             ? minor_sweeping_state_.trace_id()
+             : major_sweeping_state_.trace_id();
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/sweeper.h b/deps/v8/src/heap/sweeper.h
index c2c437a9dd27f8..5100f2defa80b8 100644
--- a/deps/v8/src/heap/sweeper.h
+++ b/deps/v8/src/heap/sweeper.h
@@ -6,6 +6,7 @@
 #define V8_HEAP_SWEEPER_H_
 
 #include <map>
+#include <type_traits>
 #include <unordered_map>
 #include <unordered_set>
 #include <vector>
@@ -23,7 +24,6 @@
 namespace v8 {
 namespace internal {
 
-class InvalidatedSlotsCleanup;
 class MemoryChunk;
 class NonAtomicMarkingState;
 class Page;
@@ -35,54 +35,23 @@ enum class FreeSpaceTreatmentMode { kIgnoreFreeSpace, kZapFreeSpace };
 
 class Sweeper {
  public:
-  using SweepingList = std::vector<Page*>;
-  using SweptList = std::vector<Page*>;
-  using CachedOldToNewRememberedSets =
-      std::unordered_map<MemoryChunk*, SlotSet*>;
-
-  enum FreeListRebuildingMode { REBUILD_FREE_LIST, IGNORE_FREE_LIST };
-  enum AddPageMode { REGULAR, READD_TEMPORARY_REMOVED_PAGE };
-  enum class SweepingMode { kEagerDuringGC, kLazyOrConcurrent };
-
-  // Pauses the sweeper tasks.
-  class V8_NODISCARD PauseScope final {
+  // When the scope is entered, the concurrent sweeping tasks
+  // are preempted and are not looking at the heap objects, concurrent sweeping
+  // is resumed when the scope is exited.
+  class V8_NODISCARD PauseMajorSweepingScope {
    public:
-    explicit PauseScope(Sweeper* sweeper);
-    ~PauseScope();
+    explicit PauseMajorSweepingScope(Sweeper* sweeper);
+    ~PauseMajorSweepingScope();
 
    private:
     Sweeper* const sweeper_;
+    const bool resume_on_exit_;
   };
 
-  // Temporary filters old space sweeping lists. Requires the concurrent
-  // sweeper to be paused. Allows for pages to be added to the sweeper while
-  // in this scope. Note that the original list of sweeping pages is restored
-  // after exiting this scope.
-  class V8_NODISCARD FilterSweepingPagesScope final {
-   public:
-    FilterSweepingPagesScope(Sweeper* sweeper, const PauseScope& pause_scope);
-    ~FilterSweepingPagesScope();
-
-    template <typename Callback>
-    void FilterOldSpaceSweepingPages(Callback callback) {
-      if (!sweeping_in_progress_) return;
-
-      SweepingList* sweeper_list =
-          &sweeper_->sweeping_list_[GetSweepSpaceIndex(OLD_SPACE)];
-      // Iteration here is from most free space to least free space.
-      for (auto it = old_space_sweeping_list_.begin();
-           it != old_space_sweeping_list_.end(); it++) {
-        if (callback(*it)) {
-          sweeper_list->push_back(*it);
-        }
-      }
-    }
+  using SweepingList = std::vector<Page*>;
+  using SweptList = std::vector<Page*>;
 
-   private:
-    Sweeper* const sweeper_;
-    SweepingList old_space_sweeping_list_;
-    bool sweeping_in_progress_;
-  };
+  enum class SweepingMode { kEagerDuringGC, kLazyOrConcurrent };
 
   // LocalSweeper holds local data structures required for sweeping and is used
   // to initiate sweeping and promoted page iteration on multiple threads. Each
@@ -101,25 +70,20 @@ class Sweeper {
     explicit LocalSweeper(Sweeper* sweeper) : sweeper_(sweeper) {
       DCHECK_NOT_NULL(sweeper_);
     }
-    ~LocalSweeper() { DCHECK(IsEmpty()); }
+    ~LocalSweeper() = default;
 
     int ParallelSweepSpace(AllocationSpace identity, SweepingMode sweeping_mode,
                            int required_freed_bytes, int max_pages = 0);
     void ContributeAndWaitForPromotedPagesIteration();
-    void Finalize();
-
-    bool IsEmpty() const { return old_to_new_remembered_sets_.empty(); }
 
    private:
     int ParallelSweepPage(Page* page, AllocationSpace identity,
                           SweepingMode sweeping_mode);
 
-    void ParallelIteratePromotedPagesForRememberedSets();
-    void ParallelIteratePromotedPageForRememberedSets(MemoryChunk* chunk);
-    void CleanPromotedPages();
+    void ParallelIterateAndSweepPromotedPages();
+    void ParallelIterateAndSweepPromotedPage(MemoryChunk* chunk);
 
     Sweeper* const sweeper_;
-    CachedOldToNewRememberedSets old_to_new_remembered_sets_;
 
     friend class Sweeper;
   };
@@ -127,30 +91,58 @@ class Sweeper {
   explicit Sweeper(Heap* heap);
   ~Sweeper();
 
-  bool sweeping_in_progress() const { return sweeping_in_progress_; }
+  bool major_sweeping_in_progress() const {
+    return major_sweeping_state_.in_progress();
+  }
+  bool minor_sweeping_in_progress() const {
+    return minor_sweeping_state_.in_progress();
+  }
+  bool sweeping_in_progress() const {
+    return minor_sweeping_in_progress() || major_sweeping_in_progress();
+  }
+  bool sweeping_in_progress_for_space(AllocationSpace space) const {
+    if (space == NEW_SPACE) return minor_sweeping_in_progress();
+    return major_sweeping_in_progress();
+  }
 
   void TearDown();
 
-  void AddPage(AllocationSpace space, Page* page, AddPageMode mode,
-               AccessMode mutex_mode = AccessMode::NON_ATOMIC);
-  void AddNewSpacePage(Page* page,
-                       AccessMode mutex_mode = AccessMode::NON_ATOMIC);
-  void AddPromotedPageForIteration(MemoryChunk* chunk);
+  void AddPage(AllocationSpace space, Page* page);
+  void AddNewSpacePage(Page* page);
+  void AddPromotedPage(MemoryChunk* chunk);
 
   int ParallelSweepSpace(AllocationSpace identity, SweepingMode sweeping_mode,
                          int required_freed_bytes, int max_pages = 0);
 
   void EnsurePageIsSwept(Page* page);
+  void WaitForPageToBeSwept(Page* page);
 
   // After calling this function sweeping is considered to be in progress
   // and the main thread can sweep lazily, but the background sweeper tasks
   // are not running yet.
-  void StartSweeping(GarbageCollector collector);
-  V8_EXPORT_PRIVATE void StartSweeperTasks();
-  void EnsureCompleted();
-  void PauseAndEnsureNewSpaceCompleted();
+  void StartMajorSweeping();
+  void StartMinorSweeping();
+  void InitializeMajorSweeping();
+  void InitializeMinorSweeping();
+  V8_EXPORT_PRIVATE void StartMajorSweeperTasks();
+  V8_EXPORT_PRIVATE void StartMinorSweeperTasks();
+
+  // Finishes all major sweeping tasks/work without changing the sweeping state.
+  void FinishMajorJobs();
+  // Finishes all major sweeping tasks/work and resets sweeping state to NOT in
+  // progress.
+  void EnsureMajorCompleted();
+
+  // Finishes all minor sweeping tasks/work without changing the sweeping state.
+  void FinishMinorJobs();
+  // Finishes all minor sweeping tasks/work and resets sweeping state to NOT in
+  // progress.
+  void EnsureMinorCompleted();
+
   void DrainSweepingWorklistForSpace(AllocationSpace space);
-  bool AreSweeperTasksRunning();
+
+  bool AreMinorSweeperTasksRunning();
+  bool AreMajorSweeperTasksRunning();
 
   Page* GetSweptPageSafe(PagedSpaceBase* space);
   SweptList GetAllSweptPagesSafe(PagedSpaceBase* space);
@@ -159,7 +151,6 @@ class Sweeper {
 
   GCTracer::Scope::ScopeId GetTracingScope(AllocationSpace space,
                                            bool is_joining_thread);
-  GCTracer::Scope::ScopeId GetTracingScopeForCompleteYoungSweep();
 
   bool IsIteratingPromotedPages() const;
   void ContributeAndWaitForPromotedPagesIteration();
@@ -168,31 +159,29 @@ class Sweeper {
 
   void SweepEmptyNewSpacePage(Page* page);
 
+  uint64_t GetTraceIdForFlowEvent(GCTracer::Scope::ScopeId scope_id) const;
+
  private:
   NonAtomicMarkingState* marking_state() const { return marking_state_; }
 
   int RawSweep(Page* p, FreeSpaceTreatmentMode free_space_treatment_mode,
-               SweepingMode sweeping_mode);
+               SweepingMode sweeping_mode, bool should_reduce_memory,
+               bool is_promoted_page);
 
-  void RawIteratePromotedPageForRememberedSets(
-      MemoryChunk* chunk,
-      CachedOldToNewRememberedSets* old_to_new_remembered_sets);
+  void AddPageImpl(AllocationSpace space, Page* page);
 
-  void AddPageImpl(AllocationSpace space, Page* page, AddPageMode mode,
-                   AccessMode mutex_mode);
+  class ConcurrentMajorSweeper;
+  class ConcurrentMinorSweeper;
 
-  void FinalizeLocalSweepers();
+  class MajorSweeperJob;
+  class MinorSweeperJob;
 
-  class ConcurrentSweeper;
-  class SweeperJob;
-
-  static const int kNumberOfSweepingSpaces =
+  static constexpr int kNumberOfSweepingSpaces =
       LAST_SWEEPABLE_SPACE - FIRST_SWEEPABLE_SPACE + 1;
-  static constexpr int kMaxSweeperTasks = kNumberOfSweepingSpaces;
 
   template <typename Callback>
   void ForAllSweepingSpaces(Callback callback) const {
-    if (v8_flags.minor_mc) {
+    if (v8_flags.minor_ms) {
       callback(NEW_SPACE);
     }
     callback(OLD_SPACE);
@@ -206,16 +195,14 @@ class Sweeper {
   // the operating system.
   size_t FreeAndProcessFreedMemory(
       Address free_start, Address free_end, Page* page, Space* space,
-      FreeSpaceTreatmentMode free_space_treatment_mode);
+      FreeSpaceTreatmentMode free_space_treatment_mode,
+      bool should_reduce_memory);
 
   // Helper function for RawSweep. Handle remembered set entries in the freed
   // memory which require clearing.
   void CleanupRememberedSetEntriesForFreedMemory(
       Address free_start, Address free_end, Page* page, bool record_free_ranges,
-      TypedSlotSet::FreeRangesMap* free_ranges_map, SweepingMode sweeping_mode,
-      InvalidatedSlotsCleanup* invalidated_old_to_new_cleanup,
-      InvalidatedSlotsCleanup* invalidated_old_to_old_cleanup,
-      InvalidatedSlotsCleanup* invalidated_old_to_shared_cleanup);
+      TypedSlotSet::FreeRangesMap* free_ranges_map, SweepingMode sweeping_mode);
 
   // Helper function for RawSweep. Clears invalid typed slots in the given free
   // ranges.
@@ -238,12 +225,14 @@ class Sweeper {
     return is_done;
   }
 
-  size_t ConcurrentSweepingPageCount();
+  size_t ConcurrentMinorSweepingPageCount();
+  size_t ConcurrentMajorSweepingPageCount();
 
   Page* GetSweepingPageSafe(AllocationSpace space);
-  MemoryChunk* GetPromotedPageForIterationSafe();
+  MemoryChunk* GetPromotedPageSafe();
   std::vector<MemoryChunk*> GetAllPromotedPagesForIterationSafe();
   bool TryRemoveSweepingPageSafe(AllocationSpace space, Page* page);
+  bool TryRemovePromotedPageSafe(MemoryChunk* chunk);
 
   void PrepareToBeSweptPage(AllocationSpace space, Page* page);
 
@@ -256,34 +245,71 @@ class Sweeper {
     return space - FIRST_SWEEPABLE_SPACE;
   }
 
-  int NumberOfConcurrentSweepers() const;
-
-  void IncrementAndNotifyPromotedPagesIterationFinishedIfNeeded();
+  void NotifyPromotedPageIterationFinished(MemoryChunk* chunk);
   void NotifyPromotedPagesIterationFinished();
 
-  void SnapshotPageSets();
-
   void AddSweptPage(Page* page, AllocationSpace identity);
 
+  enum class SweepingScope { kMinor, kMajor };
+  template <SweepingScope scope>
+  class SweepingState {
+    using ConcurrentSweeper =
+        typename std::conditional<scope == SweepingScope::kMinor,
+                                  ConcurrentMinorSweeper,
+                                  ConcurrentMajorSweeper>::type;
+    using SweeperJob =
+        typename std::conditional<scope == SweepingScope::kMinor,
+                                  MinorSweeperJob, MajorSweeperJob>::type;
+
+   public:
+    explicit SweepingState(Sweeper* sweeper);
+    ~SweepingState();
+
+    void InitializeSweeping();
+    void StartSweeping();
+    void StartConcurrentSweeping();
+    void StopConcurrentSweeping();
+    void FinishSweeping();
+    void JoinSweeping();
+
+    bool HasValidJob() const;
+    bool HasActiveJob() const;
+
+    bool in_progress() const { return in_progress_; }
+    bool should_reduce_memory() const { return should_reduce_memory_; }
+    std::vector<ConcurrentSweeper>& concurrent_sweepers() {
+      return concurrent_sweepers_;
+    }
+
+    void Pause();
+    void Resume();
+
+    uint64_t trace_id() const { return trace_id_; }
+
+   private:
+    Sweeper* sweeper_;
+    // Main thread can finalize sweeping, while background threads allocation
+    // slow path checks this flag to see whether it could support concurrent
+    // sweeping.
+    std::atomic<bool> in_progress_{false};
+    std::unique_ptr<JobHandle> job_handle_;
+    std::vector<ConcurrentSweeper> concurrent_sweepers_;
+    uint64_t trace_id_;
+    bool should_reduce_memory_ = false;
+  };
+
   Heap* const heap_;
   NonAtomicMarkingState* const marking_state_;
-  std::unique_ptr<JobHandle> job_handle_;
   base::Mutex mutex_;
-  base::Mutex promoted_pages_iteration_mutex_;
   base::ConditionVariable cv_page_swept_;
   SweptList swept_list_[kNumberOfSweepingSpaces];
   SweepingList sweeping_list_[kNumberOfSweepingSpaces];
   std::atomic<bool> has_sweeping_work_[kNumberOfSweepingSpaces]{false};
   std::atomic<bool> has_swept_pages_[kNumberOfSweepingSpaces]{false};
   std::vector<MemoryChunk*> sweeping_list_for_promoted_page_iteration_;
-  std::vector<ConcurrentSweeper> concurrent_sweepers_;
-  // Main thread can finalize sweeping, while background threads allocation slow
-  // path checks this flag to see whether it could support concurrent sweeping.
-  std::atomic<bool> sweeping_in_progress_;
-  bool should_reduce_memory_;
-  bool should_sweep_non_new_spaces_ = false;
-  base::Optional<GarbageCollector> current_new_space_collector_;
   LocalSweeper main_thread_local_sweeper_;
+  SweepingState<SweepingScope::kMajor> major_sweeping_state_{this};
+  SweepingState<SweepingScope::kMinor> minor_sweeping_state_{this};
 
   // The following fields are used for maintaining an order between iterating
   // promoted pages and sweeping array buffer extensions.
@@ -291,10 +317,6 @@ class Sweeper {
   std::atomic<size_t> iterated_promoted_pages_count_{0};
   base::Mutex promoted_pages_iteration_notification_mutex_;
   base::ConditionVariable promoted_pages_iteration_notification_variable_;
-  MemoryAllocator::NormalPagesSet snapshot_normal_pages_set_;
-  MemoryAllocator::LargePagesSet snapshot_large_pages_set_;
-  MemoryAllocator::NormalPagesSet snapshot_shared_normal_pages_set_;
-  MemoryAllocator::LargePagesSet snapshot_shared_large_pages_set_;
   std::atomic<bool> promoted_page_iteration_in_progress_{false};
   bool should_iterate_promoted_pages_ = false;
 };
diff --git a/deps/v8/src/heap/third-party/heap-api-stub.cc b/deps/v8/src/heap/third-party/heap-api-stub.cc
index 9690a8ca27bdee..7b1169a950c310 100644
--- a/deps/v8/src/heap/third-party/heap-api-stub.cc
+++ b/deps/v8/src/heap/third-party/heap-api-stub.cc
@@ -9,7 +9,7 @@
 namespace v8 {
 namespace internal {
 
-Isolate* Heap::GetIsolateFromWritableObject(HeapObject object) {
+Isolate* Heap::GetIsolateFromWritableObject(Tagged<HeapObject> object) {
   return GetHeapFromWritableObject(object)->isolate();
 }
 
@@ -39,7 +39,7 @@ const base::AddressRegion& Heap::GetCodeRange() {
   return no_region;
 }
 
-bool Heap::IsPendingAllocation(HeapObject) { return false; }
+bool Heap::IsPendingAllocation(Tagged<HeapObject>) { return false; }
 
 // static
 bool Heap::InSpace(Address, AllocationSpace) { return false; }
@@ -54,17 +54,17 @@ bool Heap::InReadOnlySpace(Address) { return false; }
 bool Heap::InLargeObjectSpace(Address address) { return false; }
 
 // static
-bool Heap::IsValidHeapObject(HeapObject) { return false; }
+bool Heap::IsValidHeapObject(Tagged<HeapObject>) { return false; }
 
 // static
-bool Heap::IsImmovable(HeapObject) { return false; }
+bool Heap::IsImmovable(Tagged<HeapObject>) { return false; }
 
 // static
-bool Heap::IsValidCodeObject(HeapObject) { return false; }
+bool Heap::IsValidCodeObject(Tagged<HeapObject>) { return false; }
 
 void Heap::ResetIterator() {}
 
-HeapObject Heap::NextObject() { return HeapObject(); }
+Tagged<HeapObject> Heap::NextObject() { return HeapObject(); }
 
 bool Heap::CollectGarbage() { return false; }
 
diff --git a/deps/v8/src/heap/third-party/heap-api.h b/deps/v8/src/heap/third-party/heap-api.h
index 2a7409040bf2dc..3816defe5d0bc6 100644
--- a/deps/v8/src/heap/third-party/heap-api.h
+++ b/deps/v8/src/heap/third-party/heap-api.h
@@ -30,7 +30,7 @@ class Heap {
 
   const base::AddressRegion& GetCodeRange();
 
-  bool IsPendingAllocation(HeapObject object);
+  bool IsPendingAllocation(Tagged<HeapObject> object);
 
   static bool InSpace(Address address, AllocationSpace space);
 
@@ -40,14 +40,14 @@ class Heap {
 
   static bool InLargeObjectSpace(Address address);
 
-  static bool IsValidHeapObject(HeapObject object);
+  static bool IsValidHeapObject(Tagged<HeapObject> object);
 
-  static bool IsImmovable(HeapObject object);
+  static bool IsImmovable(Tagged<HeapObject> object);
 
-  static bool IsValidCodeObject(HeapObject object);
+  static bool IsValidCodeObject(Tagged<HeapObject> object);
 
   void ResetIterator();
-  HeapObject NextObject();
+  Tagged<HeapObject> NextObject();
 
   bool CollectGarbage();
 
diff --git a/deps/v8/src/heap/traced-handles-marking-visitor.cc b/deps/v8/src/heap/traced-handles-marking-visitor.cc
index 3e737ba729d8f5..83ad7f04328fdb 100644
--- a/deps/v8/src/heap/traced-handles-marking-visitor.cc
+++ b/deps/v8/src/heap/traced-handles-marking-visitor.cc
@@ -15,6 +15,8 @@ ConservativeTracedHandlesMarkingVisitor::
         Heap& heap, MarkingWorklists::Local& local_marking_worklist,
         cppgc::internal::CollectionType collection_type)
     : heap_(heap),
+      has_shared_space_(heap.isolate()->has_shared_space()),
+      is_shared_space_isolate_(heap.isolate()->is_shared_space_isolate()),
       marking_state_(*heap_.marking_state()),
       local_marking_worklist_(local_marking_worklist),
       traced_node_bounds_(heap.isolate()->traced_handles()->GetNodeBounds()),
@@ -36,23 +38,31 @@ void ConservativeTracedHandlesMarkingVisitor::VisitPointer(
         const_cast<Address*>(reinterpret_cast<const Address*>(address)),
         const_cast<Address*>(reinterpret_cast<const Address*>(bounds->first)),
         mark_mode_);
-    if (!object.IsHeapObject()) {
+    if (!IsHeapObject(object)) {
       // The embedder is not aware of whether numbers are materialized as heap
       // objects are just passed around as Smis. This branch also filters out
       // intentionally passed `Smi::zero()` that indicate that there's no
       // object to mark.
       return;
     }
-    HeapObject heap_object = HeapObject::cast(object);
+    Tagged<HeapObject> heap_object = HeapObject::cast(object);
     if (heap_object.InReadOnlySpace()) return;
     if (marking_state_.TryMark(heap_object)) {
       local_marking_worklist_.Push(heap_object);
     }
     if (V8_UNLIKELY(v8_flags.track_retaining_path)) {
-      heap_.AddRetainingRoot(Root::kWrapperTracing, heap_object);
+      heap_.AddRetainingRoot(Root::kTracedHandles, heap_object);
     }
   }
 }
 
+bool ConservativeTracedHandlesMarkingVisitor::ShouldMarkObject(
+    Tagged<HeapObject> object) const {
+  // Keep up-to-date with MarkCompactCollector::ShouldMarkObject.
+  if (V8_LIKELY(!has_shared_space_)) return true;
+  if (is_shared_space_isolate_) return true;
+  return !object.InAnySharedSpace();
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/heap/traced-handles-marking-visitor.h b/deps/v8/src/heap/traced-handles-marking-visitor.h
index ddcc1dcb7e84c1..174ba9150fbd88 100644
--- a/deps/v8/src/heap/traced-handles-marking-visitor.h
+++ b/deps/v8/src/heap/traced-handles-marking-visitor.h
@@ -25,9 +25,12 @@ class ConservativeTracedHandlesMarkingVisitor final
   ~ConservativeTracedHandlesMarkingVisitor() override = default;
 
   void VisitPointer(const void*) override;
+  bool ShouldMarkObject(Tagged<HeapObject> object) const;
 
  private:
   Heap& heap_;
+  const bool has_shared_space_;
+  const bool is_shared_space_isolate_;
   MarkingState& marking_state_;
   MarkingWorklists::Local& local_marking_worklist_;
   const TracedHandles::NodeBounds traced_node_bounds_;
diff --git a/deps/v8/src/heap/weak-object-worklists.cc b/deps/v8/src/heap/weak-object-worklists.cc
index ebe72bd47fdce7..a2c80c474c328e 100644
--- a/deps/v8/src/heap/weak-object-worklists.cc
+++ b/deps/v8/src/heap/weak-object-worklists.cc
@@ -46,16 +46,17 @@ void WeakObjects::Clear() {
 
 // static
 void WeakObjects::UpdateTransitionArrays(
-    WeakObjectWorklist<TransitionArray>& transition_arrays) {
+    WeakObjectWorklist<Tagged<TransitionArray>>& transition_arrays) {
   DCHECK(!ContainsYoungObjects(transition_arrays));
 }
 
 // static
 void WeakObjects::UpdateEphemeronHashTables(
-    WeakObjectWorklist<EphemeronHashTable>& ephemeron_hash_tables) {
+    WeakObjectWorklist<Tagged<EphemeronHashTable>>& ephemeron_hash_tables) {
   ephemeron_hash_tables.Update(
-      [](EphemeronHashTable slot_in, EphemeronHashTable* slot_out) -> bool {
-        EphemeronHashTable forwarded = ForwardingAddress(slot_in);
+      [](Tagged<EphemeronHashTable> slot_in,
+         Tagged<EphemeronHashTable>* slot_out) -> bool {
+        Tagged<EphemeronHashTable> forwarded = ForwardingAddress(slot_in);
 
         if (!forwarded.is_null()) {
           *slot_out = forwarded;
@@ -68,10 +69,10 @@ void WeakObjects::UpdateEphemeronHashTables(
 
 namespace {
 bool EphemeronUpdater(Ephemeron slot_in, Ephemeron* slot_out) {
-  HeapObject key = slot_in.key;
-  HeapObject value = slot_in.value;
-  HeapObject forwarded_key = ForwardingAddress(key);
-  HeapObject forwarded_value = ForwardingAddress(value);
+  Tagged<HeapObject> key = slot_in.key;
+  Tagged<HeapObject> value = slot_in.value;
+  Tagged<HeapObject> forwarded_key = ForwardingAddress(key);
+  Tagged<HeapObject> forwarded_value = ForwardingAddress(value);
 
   if (!forwarded_key.is_null() && !forwarded_value.is_null()) {
     *slot_out = Ephemeron{forwarded_key, forwarded_value};
@@ -105,8 +106,8 @@ void WeakObjects::UpdateWeakReferences(
     WeakObjectWorklist<HeapObjectAndSlot>& weak_references) {
   weak_references.Update(
       [](HeapObjectAndSlot slot_in, HeapObjectAndSlot* slot_out) -> bool {
-        HeapObject heap_obj = slot_in.first;
-        HeapObject forwarded = ForwardingAddress(heap_obj);
+        Tagged<HeapObject> heap_obj = slot_in.first;
+        Tagged<HeapObject> forwarded = ForwardingAddress(heap_obj);
 
         if (!forwarded.is_null()) {
           ptrdiff_t distance_to_slot =
@@ -126,8 +127,8 @@ void WeakObjects::UpdateWeakObjectsInCode(
     WeakObjectWorklist<HeapObjectAndCode>& weak_objects_in_code) {
   weak_objects_in_code.Update(
       [](HeapObjectAndCode slot_in, HeapObjectAndCode* slot_out) -> bool {
-        HeapObject heap_obj = slot_in.first;
-        HeapObject forwarded = ForwardingAddress(heap_obj);
+        Tagged<HeapObject> heap_obj = slot_in.first;
+        Tagged<HeapObject> forwarded = ForwardingAddress(heap_obj);
 
         if (!forwarded.is_null()) {
           slot_out->first = forwarded;
@@ -141,38 +142,39 @@ void WeakObjects::UpdateWeakObjectsInCode(
 
 // static
 void WeakObjects::UpdateJSWeakRefs(
-    WeakObjectWorklist<JSWeakRef>& js_weak_refs) {
-  js_weak_refs.Update(
-      [](JSWeakRef js_weak_ref_in, JSWeakRef* js_weak_ref_out) -> bool {
-        JSWeakRef forwarded = ForwardingAddress(js_weak_ref_in);
-
-        if (!forwarded.is_null()) {
-          *js_weak_ref_out = forwarded;
-          return true;
-        }
+    WeakObjectWorklist<Tagged<JSWeakRef>>& js_weak_refs) {
+  js_weak_refs.Update([](Tagged<JSWeakRef> js_weak_ref_in,
+                         Tagged<JSWeakRef>* js_weak_ref_out) -> bool {
+    Tagged<JSWeakRef> forwarded = ForwardingAddress(js_weak_ref_in);
+
+    if (!forwarded.is_null()) {
+      *js_weak_ref_out = forwarded;
+      return true;
+    }
 
-        return false;
-      });
+    return false;
+  });
 }
 
 // static
-void WeakObjects::UpdateWeakCells(WeakObjectWorklist<WeakCell>& weak_cells) {
+void WeakObjects::UpdateWeakCells(
+    WeakObjectWorklist<Tagged<WeakCell>>& weak_cells) {
   // TODO(syg, marja): Support WeakCells in the young generation.
   DCHECK(!ContainsYoungObjects(weak_cells));
 }
 
 // static
 void WeakObjects::UpdateCodeFlushingCandidates(
-    WeakObjectWorklist<SharedFunctionInfo>& code_flushing_candidates) {
+    WeakObjectWorklist<Tagged<SharedFunctionInfo>>& code_flushing_candidates) {
   DCHECK(!ContainsYoungObjects(code_flushing_candidates));
 }
 
 // static
 void WeakObjects::UpdateFlushedJSFunctions(
-    WeakObjectWorklist<JSFunction>& flushed_js_functions) {
+    WeakObjectWorklist<Tagged<JSFunction>>& flushed_js_functions) {
   flushed_js_functions.Update(
-      [](JSFunction slot_in, JSFunction* slot_out) -> bool {
-        JSFunction forwarded = ForwardingAddress(slot_in);
+      [](Tagged<JSFunction> slot_in, Tagged<JSFunction>* slot_out) -> bool {
+        Tagged<JSFunction> forwarded = ForwardingAddress(slot_in);
 
         if (!forwarded.is_null()) {
           *slot_out = forwarded;
@@ -185,10 +187,10 @@ void WeakObjects::UpdateFlushedJSFunctions(
 
 // static
 void WeakObjects::UpdateBaselineFlushingCandidates(
-    WeakObjectWorklist<JSFunction>& baseline_flush_candidates) {
+    WeakObjectWorklist<Tagged<JSFunction>>& baseline_flush_candidates) {
   baseline_flush_candidates.Update(
-      [](JSFunction slot_in, JSFunction* slot_out) -> bool {
-        JSFunction forwarded = ForwardingAddress(slot_in);
+      [](Tagged<JSFunction> slot_in, Tagged<JSFunction>* slot_out) -> bool {
+        Tagged<JSFunction> forwarded = ForwardingAddress(slot_in);
 
         if (!forwarded.is_null()) {
           *slot_out = forwarded;
@@ -202,9 +204,10 @@ void WeakObjects::UpdateBaselineFlushingCandidates(
 #ifdef DEBUG
 // static
 template <typename Type>
-bool WeakObjects::ContainsYoungObjects(WeakObjectWorklist<Type>& worklist) {
+bool WeakObjects::ContainsYoungObjects(
+    WeakObjectWorklist<Tagged<Type>>& worklist) {
   bool result = false;
-  worklist.Iterate([&result](Type candidate) {
+  worklist.Iterate([&result](Tagged<Type> candidate) {
     if (Heap::InYoungGeneration(candidate)) {
       result = true;
     }
diff --git a/deps/v8/src/heap/weak-object-worklists.h b/deps/v8/src/heap/weak-object-worklists.h
index a921a4150790cd..f29e2d07c12530 100644
--- a/deps/v8/src/heap/weak-object-worklists.h
+++ b/deps/v8/src/heap/weak-object-worklists.h
@@ -14,12 +14,12 @@ namespace v8 {
 namespace internal {
 
 struct Ephemeron {
-  HeapObject key;
-  HeapObject value;
+  Tagged<HeapObject> key;
+  Tagged<HeapObject> value;
 };
 
-using HeapObjectAndSlot = std::pair<HeapObject, HeapObjectSlot>;
-using HeapObjectAndCode = std::pair<HeapObject, Code>;
+using HeapObjectAndSlot = std::pair<Tagged<HeapObject>, HeapObjectSlot>;
+using HeapObjectAndCode = std::pair<Tagged<HeapObject>, Tagged<Code>>;
 class EphemeronHashTable;
 class JSFunction;
 class SharedFunctionInfo;
@@ -35,10 +35,10 @@ class TransitionArray;
 // If you add a new entry, then you also need to implement the corresponding
 // Update*() function in the cc file for updating pointers after Scavenge.
 #define WEAK_OBJECT_WORKLISTS(F)                                             \
-  F(TransitionArray, transition_arrays, TransitionArrays)                    \
+  F(Tagged<TransitionArray>, transition_arrays, TransitionArrays)            \
   /* Keep track of all EphemeronHashTables in the heap to process            \
      them in the atomic pause. */                                            \
-  F(EphemeronHashTable, ephemeron_hash_tables, EphemeronHashTables)          \
+  F(Tagged<EphemeronHashTable>, ephemeron_hash_tables, EphemeronHashTables)  \
   /* Keep track of all ephemerons for concurrent marking tasks. Only store   \
      ephemerons in these worklists if both (key, value) are unreachable at   \
      the moment.                                                             \
@@ -55,11 +55,13 @@ class TransitionArray;
      Optimize this by adding a different storage for old space. */           \
   F(HeapObjectAndSlot, weak_references, WeakReferences)                      \
   F(HeapObjectAndCode, weak_objects_in_code, WeakObjectsInCode)              \
-  F(JSWeakRef, js_weak_refs, JSWeakRefs)                                     \
-  F(WeakCell, weak_cells, WeakCells)                                         \
-  F(SharedFunctionInfo, code_flushing_candidates, CodeFlushingCandidates)    \
-  F(JSFunction, baseline_flushing_candidates, BaselineFlushingCandidates)    \
-  F(JSFunction, flushed_js_functions, FlushedJSFunctions)
+  F(Tagged<JSWeakRef>, js_weak_refs, JSWeakRefs)                             \
+  F(Tagged<WeakCell>, weak_cells, WeakCells)                                 \
+  F(Tagged<SharedFunctionInfo>, code_flushing_candidates,                    \
+    CodeFlushingCandidates)                                                  \
+  F(Tagged<JSFunction>, baseline_flushing_candidates,                        \
+    BaselineFlushingCandidates)                                              \
+  F(Tagged<JSFunction>, flushed_js_functions, FlushedJSFunctions)
 
 class WeakObjects final {
  private:
@@ -96,7 +98,7 @@ class WeakObjects final {
 
 #ifdef DEBUG
   template <typename Type>
-  static bool ContainsYoungObjects(WeakObjectWorklist<Type>& worklist);
+  static bool ContainsYoungObjects(WeakObjectWorklist<Tagged<Type>>& worklist);
 #endif
 };
 
diff --git a/deps/v8/src/heap/young-generation-marking-visitor-inl.h b/deps/v8/src/heap/young-generation-marking-visitor-inl.h
new file mode 100644
index 00000000000000..f57d3bbb92677e
--- /dev/null
+++ b/deps/v8/src/heap/young-generation-marking-visitor-inl.h
@@ -0,0 +1,291 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_YOUNG_GENERATION_MARKING_VISITOR_INL_H_
+#define V8_HEAP_YOUNG_GENERATION_MARKING_VISITOR_INL_H_
+
+#include "src/common/globals.h"
+#include "src/heap/marking-worklist-inl.h"
+#include "src/heap/memory-chunk.h"
+#include "src/heap/minor-mark-sweep.h"
+#include "src/heap/objects-visiting-inl.h"
+#include "src/heap/objects-visiting.h"
+#include "src/heap/pretenuring-handler-inl.h"
+#include "src/heap/young-generation-marking-visitor.h"
+
+namespace v8 {
+namespace internal {
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+YoungGenerationMarkingVisitor<marking_mode>::YoungGenerationMarkingVisitor(
+    Heap* heap,
+    PretenuringHandler::PretenuringFeedbackMap* local_pretenuring_feedback)
+    : Parent(heap->isolate()),
+      isolate_(heap->isolate()),
+      marking_worklists_local_(
+          heap->minor_mark_sweep_collector()->marking_worklists(),
+          heap->cpp_heap()
+              ? CppHeap::From(heap->cpp_heap())->CreateCppMarkingState()
+              : MarkingWorklists::Local::kNoCppMarkingState),
+      ephemeron_table_list_local_(
+          *heap->minor_mark_sweep_collector()->ephemeron_table_list()),
+      pretenuring_handler_(heap->pretenuring_handler()),
+      local_pretenuring_feedback_(local_pretenuring_feedback),
+      shortcut_strings_(heap->CanShortcutStringsDuringGC(
+          GarbageCollector::MINOR_MARK_SWEEPER)) {}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+YoungGenerationMarkingVisitor<marking_mode>::~YoungGenerationMarkingVisitor() {
+  PublishWorklists();
+
+  // Flush memory chunk live bytes. Atomics are used for incrementing the live
+  // bytes counter of the page, so there is no need to defer flushing to the
+  // main thread.
+  for (auto& pair : live_bytes_data_) {
+    if (pair.first) {
+      pair.first->IncrementLiveBytesAtomically(pair.second);
+    }
+  }
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+template <typename T>
+int YoungGenerationMarkingVisitor<marking_mode>::
+    VisitEmbedderTracingSubClassWithEmbedderTracing(Tagged<Map> map,
+                                                    Tagged<T> object) {
+  const int size = VisitJSObjectSubclass(map, object);
+  if (!marking_worklists_local_.SupportsExtractWrapper()) return size;
+  MarkingWorklists::Local::WrapperSnapshot wrapper_snapshot;
+  const bool valid_snapshot =
+      marking_worklists_local_.ExtractWrapper(map, object, wrapper_snapshot);
+  if (size && valid_snapshot) {
+    // Success: The object needs to be processed for embedder references.
+    marking_worklists_local_.PushExtractedWrapper(wrapper_snapshot);
+  }
+  return size;
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+int YoungGenerationMarkingVisitor<marking_mode>::VisitJSArrayBuffer(
+    Tagged<Map> map, Tagged<JSArrayBuffer> object) {
+  object->YoungMarkExtension();
+  return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+int YoungGenerationMarkingVisitor<marking_mode>::VisitJSApiObject(
+    Tagged<Map> map, Tagged<JSObject> object) {
+  return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+int YoungGenerationMarkingVisitor<marking_mode>::
+    VisitJSDataViewOrRabGsabDataView(
+        Tagged<Map> map, Tagged<JSDataViewOrRabGsabDataView> object) {
+  return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+int YoungGenerationMarkingVisitor<marking_mode>::VisitJSTypedArray(
+    Tagged<Map> map, Tagged<JSTypedArray> object) {
+  return VisitEmbedderTracingSubClassWithEmbedderTracing(map, object);
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+int YoungGenerationMarkingVisitor<marking_mode>::VisitJSObject(
+    Tagged<Map> map, Tagged<JSObject> object) {
+  int result = Parent::VisitJSObject(map, object);
+  DCHECK_LT(0, result);
+  pretenuring_handler_->UpdateAllocationSite(map, object,
+                                             local_pretenuring_feedback_);
+  return result;
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+int YoungGenerationMarkingVisitor<marking_mode>::VisitJSObjectFast(
+    Tagged<Map> map, Tagged<JSObject> object) {
+  int result = Parent::VisitJSObjectFast(map, object);
+  DCHECK_LT(0, result);
+  pretenuring_handler_->UpdateAllocationSite(map, object,
+                                             local_pretenuring_feedback_);
+  return result;
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+template <typename T, typename TBodyDescriptor>
+int YoungGenerationMarkingVisitor<marking_mode>::VisitJSObjectSubclass(
+    Tagged<Map> map, Tagged<T> object) {
+  int result =
+      Parent::template VisitJSObjectSubclass<T, TBodyDescriptor>(map, object);
+  DCHECK_LT(0, result);
+  pretenuring_handler_->UpdateAllocationSite(map, object,
+                                             local_pretenuring_feedback_);
+  return result;
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+int YoungGenerationMarkingVisitor<marking_mode>::VisitEphemeronHashTable(
+    Tagged<Map> map, Tagged<EphemeronHashTable> table) {
+  // Register table with Minor MC, so it can take care of the weak keys later.
+  // This allows to only iterate the tables' values, which are treated as strong
+  // independently of whether the key is live.
+  ephemeron_table_list_local_.Push(table);
+  for (InternalIndex i : table->IterateEntries()) {
+    ObjectSlot value_slot =
+        table->RawFieldOfElementAt(EphemeronHashTable::EntryToValueIndex(i));
+    VisitPointer(table, value_slot);
+  }
+  return EphemeronHashTable::BodyDescriptor::SizeOf(map, table);
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+template <typename TSlot>
+void YoungGenerationMarkingVisitor<marking_mode>::VisitPointersImpl(
+    Tagged<HeapObject> host, TSlot start, TSlot end) {
+  for (TSlot slot = start; slot < end; ++slot) {
+    if constexpr (marking_mode ==
+                  YoungGenerationMarkingVisitationMode::kConcurrent) {
+      VisitObjectViaSlot<ObjectVisitationMode::kPushToWorklist,
+                         SlotTreatmentMode::kReadOnly>(slot);
+    } else {
+      VisitObjectViaSlot<ObjectVisitationMode::kPushToWorklist,
+                         SlotTreatmentMode::kReadWrite>(slot);
+    }
+  }
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+template <typename TSlot>
+V8_INLINE bool
+YoungGenerationMarkingVisitor<marking_mode>::VisitObjectViaSlotInRememberedSet(
+    TSlot slot) {
+  if constexpr (marking_mode ==
+                YoungGenerationMarkingVisitationMode::kConcurrent) {
+    return VisitObjectViaSlot<ObjectVisitationMode::kPushToWorklist,
+                              SlotTreatmentMode::kReadOnly>(slot);
+  } else {
+    return VisitObjectViaSlot<ObjectVisitationMode::kVisitDirectly,
+                              SlotTreatmentMode::kReadWrite>(slot);
+  }
+}
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+template <typename YoungGenerationMarkingVisitor<
+              marking_mode>::ObjectVisitationMode visitation_mode,
+          typename YoungGenerationMarkingVisitor<
+              marking_mode>::SlotTreatmentMode slot_treatment_mode,
+          typename TSlot>
+V8_INLINE bool YoungGenerationMarkingVisitor<marking_mode>::VisitObjectViaSlot(
+    TSlot slot) {
+  typename TSlot::TObject target =
+      slot.Relaxed_Load(ObjectVisitorWithCageBases::cage_base());
+
+  Tagged<HeapObject> heap_object;
+  // Treat weak references as strong.
+  if (!target.GetHeapObject(&heap_object)) {
+    return false;
+  }
+
+#ifdef THREAD_SANITIZER
+  BasicMemoryChunk::FromHeapObject(heap_object)->SynchronizedHeapLoad();
+#endif  // THREAD_SANITIZER
+
+  if (!Heap::InYoungGeneration(heap_object)) {
+    return false;
+  }
+
+#ifdef V8_MINORMS_STRING_SHORTCUTTING
+  if (slot_treatment_mode == SlotTreatmentMode::kReadWrite &&
+      !ShortCutStrings(reinterpret_cast<HeapObjectSlot&>(slot), &heap_object)) {
+    return false;
+  }
+#endif  // V8_MINORMS_STRING_SHORTCUTTING
+
+  if (!TryMark(heap_object)) return true;
+
+  // Maps won't change in the atomic pause, so the map can be read without
+  // atomics.
+  if constexpr (visitation_mode == ObjectVisitationMode::kVisitDirectly) {
+    Tagged<Map> map = heap_object->map(isolate_);
+    const int visited_size = Parent::Visit(map, heap_object);
+    if (visited_size) {
+      IncrementLiveBytesCached(
+          MemoryChunk::cast(BasicMemoryChunk::FromHeapObject(heap_object)),
+          ALIGN_TO_ALLOCATION_ALIGNMENT(visited_size));
+    }
+    return true;
+  }
+  // Default case: Visit via worklist.
+  marking_worklists_local_.Push(heap_object);
+
+  return true;
+}
+
+#ifdef V8_MINORMS_STRING_SHORTCUTTING
+template <YoungGenerationMarkingVisitationMode marking_mode>
+V8_INLINE bool YoungGenerationMarkingVisitor<marking_mode>::ShortCutStrings(
+    HeapObjectSlot slot, HeapObject* heap_object) {
+  DCHECK_EQ(YoungGenerationMarkingVisitationMode::kParallel, marking_mode);
+  if (shortcut_strings_) {
+    DCHECK(V8_STATIC_ROOTS_BOOL);
+#if V8_STATIC_ROOTS_BOOL
+    ObjectSlot map_slot = heap_object->map_slot();
+    Address map_address = map_slot.load_map().ptr();
+    if (map_address == StaticReadOnlyRoot::kThinOneByteStringMap ||
+        map_address == StaticReadOnlyRoot::kThinTwoByteStringMap) {
+      DCHECK_EQ(heap_object->map(ObjectVisitorWithCageBases::cage_base())
+                    ->visitor_id(),
+                VisitorId::kVisitThinString);
+      *heap_object = ThinString::cast(*heap_object)->actual();
+      // ThinStrings always refer to internalized strings, which are always
+      // in old space.
+      DCHECK(!Heap::InYoungGeneration(*heap_object));
+      slot.StoreHeapObject(*heap_object);
+      return false;
+    } else if (map_address == StaticReadOnlyRoot::kConsOneByteStringMap ||
+               map_address == StaticReadOnlyRoot::kConsTwoByteStringMap) {
+      // Not all ConsString are short cut candidates.
+      const VisitorId visitor_id =
+          heap_object->map(ObjectVisitorWithCageBases::cage_base())
+              ->visitor_id();
+      if (visitor_id == VisitorId::kVisitShortcutCandidate) {
+        ConsString string = ConsString::cast(*heap_object);
+        if (static_cast<Tagged_t>(string->second().ptr()) ==
+            StaticReadOnlyRoot::kempty_string) {
+          *heap_object = string->first();
+          slot.StoreHeapObject(*heap_object);
+          if (!Heap::InYoungGeneration(*heap_object)) {
+            return false;
+          }
+        }
+      }
+    }
+#endif  // V8_STATIC_ROOTS_BOOL
+  }
+  return true;
+}
+#endif  // V8_MINORMS_STRING_SHORTCUTTING
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+V8_INLINE void
+YoungGenerationMarkingVisitor<marking_mode>::IncrementLiveBytesCached(
+    MemoryChunk* chunk, intptr_t by) {
+  DCHECK_IMPLIES(V8_COMPRESS_POINTERS_8GB_BOOL,
+                 IsAligned(by, kObjectAlignment8GbHeap));
+  const size_t hash = base::hash<MemoryChunk*>()(chunk) & kEntriesMask;
+  auto& entry = live_bytes_data_[hash];
+  if (entry.first && entry.first != chunk) {
+    entry.first->IncrementLiveBytesAtomically(entry.second);
+    entry.first = chunk;
+    entry.second = 0;
+  } else {
+    entry.first = chunk;
+  }
+  entry.second += by;
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_YOUNG_GENERATION_MARKING_VISITOR_INL_H_
diff --git a/deps/v8/src/heap/young-generation-marking-visitor.h b/deps/v8/src/heap/young-generation-marking-visitor.h
new file mode 100644
index 00000000000000..c0b1f71ccc1fd0
--- /dev/null
+++ b/deps/v8/src/heap/young-generation-marking-visitor.h
@@ -0,0 +1,136 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_YOUNG_GENERATION_MARKING_VISITOR_H_
+#define V8_HEAP_YOUNG_GENERATION_MARKING_VISITOR_H_
+
+#include <type_traits>
+
+#include "src/heap/ephemeron-remembered-set.h"
+#include "src/heap/heap.h"
+#include "src/heap/marking-worklist.h"
+#include "src/heap/objects-visiting.h"
+#include "src/heap/pretenuring-handler.h"
+
+namespace v8 {
+namespace internal {
+
+enum class YoungGenerationMarkingVisitationMode { kParallel, kConcurrent };
+
+template <YoungGenerationMarkingVisitationMode marking_mode>
+class YoungGenerationMarkingVisitor final
+    : public NewSpaceVisitor<YoungGenerationMarkingVisitor<marking_mode>> {
+ public:
+  enum class ObjectVisitationMode {
+    kVisitDirectly,
+    kPushToWorklist,
+  };
+
+  enum class SlotTreatmentMode {
+    kReadOnly,
+    kReadWrite,
+  };
+
+  YoungGenerationMarkingVisitor(
+      Heap* heap,
+      PretenuringHandler::PretenuringFeedbackMap* local_pretenuring_feedback);
+
+  ~YoungGenerationMarkingVisitor() override;
+
+  YoungGenerationMarkingVisitor(const YoungGenerationMarkingVisitor&) = delete;
+  YoungGenerationMarkingVisitor& operator=(
+      const YoungGenerationMarkingVisitor&) = delete;
+
+  static constexpr bool EnableConcurrentVisitation() {
+    return marking_mode == YoungGenerationMarkingVisitationMode::kConcurrent;
+  }
+
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                               ObjectSlot end) final {
+    VisitPointersImpl(host, start, end);
+  }
+  V8_INLINE void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
+                               MaybeObjectSlot end) final {
+    VisitPointersImpl(host, start, end);
+  }
+  V8_INLINE void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) final {
+    VisitPointersImpl(host, p, p + 1);
+  }
+  V8_INLINE void VisitPointer(Tagged<HeapObject> host,
+                              MaybeObjectSlot p) final {
+    VisitPointersImpl(host, p, p + 1);
+  }
+
+  // Visitation specializations used for unified heap young gen marking.
+  V8_INLINE int VisitJSApiObject(Tagged<Map> map, Tagged<JSObject> object);
+  V8_INLINE int VisitJSArrayBuffer(Tagged<Map> map,
+                                   Tagged<JSArrayBuffer> object);
+  V8_INLINE int VisitJSDataViewOrRabGsabDataView(
+      Tagged<Map> map, Tagged<JSDataViewOrRabGsabDataView> object);
+  V8_INLINE int VisitJSTypedArray(Tagged<Map> map, Tagged<JSTypedArray> object);
+
+  // Visitation specializations used for collecting pretenuring feedback.
+  V8_INLINE int VisitJSObject(Tagged<Map> map, Tagged<JSObject> object);
+  V8_INLINE int VisitJSObjectFast(Tagged<Map> map, Tagged<JSObject> object);
+  template <typename T, typename TBodyDescriptor = typename T::BodyDescriptor>
+  V8_INLINE int VisitJSObjectSubclass(Tagged<Map> map, Tagged<T> object);
+
+  V8_INLINE int VisitEphemeronHashTable(Tagged<Map> map,
+                                        Tagged<EphemeronHashTable> table);
+
+  template <ObjectVisitationMode visitation_mode,
+            SlotTreatmentMode slot_treatment_mode, typename TSlot>
+  V8_INLINE bool VisitObjectViaSlot(TSlot slot);
+
+  template <typename TSlot>
+  V8_INLINE bool VisitObjectViaSlotInRememberedSet(TSlot slot);
+
+  MarkingWorklists::Local& marking_worklists_local() {
+    return marking_worklists_local_;
+  }
+
+  V8_INLINE void IncrementLiveBytesCached(MemoryChunk* chunk, intptr_t by);
+
+  void PublishWorklists() {
+    marking_worklists_local_.Publish();
+    ephemeron_table_list_local_.Publish();
+  }
+
+ private:
+  using Parent = NewSpaceVisitor<YoungGenerationMarkingVisitor<marking_mode>>;
+
+  bool TryMark(Tagged<HeapObject> obj) {
+    return MarkBit::From(obj).Set<AccessMode::ATOMIC>();
+  }
+
+  template <typename TSlot>
+  V8_INLINE void VisitPointersImpl(Tagged<HeapObject> host, TSlot start,
+                                   TSlot end);
+
+#ifdef V8_MINORMS_STRING_SHORTCUTTING
+  V8_INLINE bool ShortCutStrings(HeapObjectSlot slot, HeapObject* heap_object);
+#endif  // V8_MINORMS_STRING_SHORTCUTTING
+
+  template <typename T>
+  int VisitEmbedderTracingSubClassWithEmbedderTracing(Tagged<Map> map,
+                                                      Tagged<T> object);
+
+  static constexpr size_t kNumEntries = 128;
+  static constexpr size_t kEntriesMask = kNumEntries - 1;
+  // Fixed-size hashmap that caches live bytes. Hashmap entries are evicted to
+  // the global counters on collision.
+  std::array<std::pair<MemoryChunk*, size_t>, kNumEntries> live_bytes_data_;
+
+  Isolate* const isolate_;
+  MarkingWorklists::Local marking_worklists_local_;
+  EphemeronRememberedSet::TableList::Local ephemeron_table_list_local_;
+  PretenuringHandler* const pretenuring_handler_;
+  PretenuringHandler::PretenuringFeedbackMap* const local_pretenuring_feedback_;
+  const bool shortcut_strings_;
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_HEAP_YOUNG_GENERATION_MARKING_VISITOR_H_
diff --git a/deps/v8/src/heap/zapping.cc b/deps/v8/src/heap/zapping.cc
new file mode 100644
index 00000000000000..574a58e7102a5b
--- /dev/null
+++ b/deps/v8/src/heap/zapping.cc
@@ -0,0 +1,33 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/zapping.h"
+
+#include "src/base/memory.h"
+#include "src/heap/heap.h"
+#include "src/objects/slots-inl.h"
+
+namespace v8::internal::heap {
+
+void ZapCodeBlock(Address start, int size_in_bytes) {
+#ifdef DEBUG
+  DCHECK(ShouldZapGarbage());
+  CodePageMemoryModificationScopeForDebugging code_modification_scope(
+      BasicMemoryChunk::FromAddress(start));
+  DCHECK(IsAligned(start, kIntSize));
+  for (int i = 0; i < size_in_bytes / kIntSize; i++) {
+    base::Memory<int>(start + i * kIntSize) = kCodeZapValue;
+  }
+#endif
+}
+
+void ZapBlock(Address start, size_t size, uintptr_t zap_value) {
+  DCHECK(ShouldZapGarbage());
+  DCHECK(IsAligned(start, kTaggedSize));
+  DCHECK(IsAligned(size, kTaggedSize));
+  MemsetTagged(ObjectSlot(start), Object(static_cast<Address>(zap_value)),
+               size >> kTaggedSizeLog2);
+}
+
+}  // namespace v8::internal::heap
diff --git a/deps/v8/src/heap/zapping.h b/deps/v8/src/heap/zapping.h
new file mode 100644
index 00000000000000..0b4594788341d9
--- /dev/null
+++ b/deps/v8/src/heap/zapping.h
@@ -0,0 +1,44 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_HEAP_ZAPPING_H_
+#define V8_HEAP_ZAPPING_H_
+
+#include <cstdint>
+
+#include "include/v8-internal.h"
+#include "src/base/macros.h"
+#include "src/common/globals.h"
+#include "src/flags/flags.h"
+
+namespace v8::internal::heap {
+
+// Zapping is needed for verify heap, and always done in debug builds.
+inline bool ShouldZapGarbage() {
+#ifdef DEBUG
+  return true;
+#else
+#ifdef VERIFY_HEAP
+  return v8_flags.verify_heap;
+#else
+  return false;
+#endif
+#endif
+}
+
+inline uintptr_t ZapValue() {
+  return v8_flags.clear_free_memory ? kClearedFreeMemoryValue : kZapValue;
+}
+
+// Zaps a contiguous block of regular memory [start..(start+size_in_bytes)[ with
+// a given zap value.
+void ZapBlock(Address start, size_t size_in_bytes, uintptr_t zap_value);
+
+// Zaps a contiguous block of code memory [start..(start+size_in_bytes)[ with
+// kCodeZapValue.
+V8_EXPORT_PRIVATE void ZapCodeBlock(Address start, int size_in_bytes);
+
+}  // namespace v8::internal::heap
+
+#endif  // V8_HEAP_ZAPPING_H_
diff --git a/deps/v8/src/ic/accessor-assembler.cc b/deps/v8/src/ic/accessor-assembler.cc
index 2531a3dea80878..7f83c0f6c6d726 100644
--- a/deps/v8/src/ic/accessor-assembler.cc
+++ b/deps/v8/src/ic/accessor-assembler.cc
@@ -15,6 +15,7 @@
 #include "src/ic/stub-cache.h"
 #include "src/logging/counters.h"
 #include "src/objects/cell.h"
+#include "src/objects/dictionary.h"
 #include "src/objects/feedback-vector.h"
 #include "src/objects/foreign.h"
 #include "src/objects/heap-number.h"
@@ -113,19 +114,21 @@ void AccessorAssembler::HandlePolymorphicCase(
   const int kEntrySize = 2;
 
   // Load the {feedback} array length.
-  TNode<IntPtrT> length = LoadAndUntagWeakFixedArrayLength(feedback);
-  CSA_DCHECK(this, IntPtrLessThanOrEqual(IntPtrConstant(kEntrySize), length));
+  TNode<Int32T> length =
+      Signed(LoadAndUntagWeakFixedArrayLengthAsUint32(feedback));
+  CSA_DCHECK(this, Int32LessThanOrEqual(Int32Constant(kEntrySize), length));
 
   // This is a hand-crafted loop that iterates backwards and only compares
   // against zero at the end, since we already know that we will have at least a
   // single entry in the {feedback} array anyways.
-  TVARIABLE(IntPtrT, var_index, IntPtrSub(length, IntPtrConstant(kEntrySize)));
+  TVARIABLE(Int32T, var_index, Int32Sub(length, Int32Constant(kEntrySize)));
   Label loop(this, &var_index), loop_next(this);
   Goto(&loop);
   BIND(&loop);
   {
+    TNode<IntPtrT> index = ChangePositiveInt32ToIntPtr(var_index.value());
     TNode<MaybeObject> maybe_cached_map =
-        LoadWeakFixedArrayElement(feedback, var_index.value());
+        LoadWeakFixedArrayElement(feedback, index);
     CSA_DCHECK(this,
                IsMap(GetHeapObjectAssumeWeak(weak_lookup_start_object_map)));
     GotoIfNot(TaggedEqual(maybe_cached_map, weak_lookup_start_object_map),
@@ -133,15 +136,14 @@ void AccessorAssembler::HandlePolymorphicCase(
 
     // Found, now call handler.
     TNode<MaybeObject> handler =
-        LoadWeakFixedArrayElement(feedback, var_index.value(), kTaggedSize);
+        LoadWeakFixedArrayElement(feedback, index, kTaggedSize);
     *var_handler = handler;
     Goto(if_handler);
 
     BIND(&loop_next);
-    var_index =
-        Signed(IntPtrSub(var_index.value(), IntPtrConstant(kEntrySize)));
-    Branch(IntPtrGreaterThanOrEqual(var_index.value(), IntPtrConstant(0)),
-           &loop, if_miss);
+    var_index = Int32Sub(var_index.value(), Int32Constant(kEntrySize));
+    Branch(Int32GreaterThanOrEqual(var_index.value(), Int32Constant(0)), &loop,
+           if_miss);
   }
 }
 
@@ -189,9 +191,9 @@ void AccessorAssembler::TryMegaDOMCase(TNode<Object> lookup_start_object,
 
   // TODO(gsathya): This builtin throws an exception on interface check fail but
   // we should miss to the runtime.
-  exit_point->Return(
-      CallBuiltin(Builtin::kCallFunctionTemplate_CheckCompatibleReceiver,
-                  context, getter, IntPtrConstant(1), lookup_start_object));
+  exit_point->Return(CallBuiltin(Builtin::kCallFunctionTemplate_Generic,
+                                 context, getter, Int32Constant(1),
+                                 lookup_start_object));
 }
 
 void AccessorAssembler::HandleLoadICHandlerCase(
@@ -280,10 +282,6 @@ void AccessorAssembler::HandleLoadAccessor(
   CSA_CHECK(this, IsNotCleared(maybe_context));
   TNode<HeapObject> context = GetHeapObjectAssumeWeak(maybe_context);
 
-  TNode<RawPtrT> callback = LoadCallHandlerInfoJsCallbackPtr(call_handler_info);
-  TNode<Object> data =
-      LoadObjectField(call_handler_info, CallHandlerInfo::kDataOffset);
-
   TVARIABLE(HeapObject, api_holder, CAST(p->lookup_start_object()));
   Label load(this);
   GotoIf(Word32Equal(handler_kind, LOAD_KIND(kApiGetter)), &load);
@@ -296,8 +294,9 @@ void AccessorAssembler::HandleLoadAccessor(
 
   BIND(&load);
   TNode<Int32T> argc = Int32Constant(0);
-  exit_point->Return(CallApiCallback(context, callback, argc, data,
-                                     api_holder.value(), p->receiver()));
+  exit_point->Return(CallBuiltin(Builtin::kCallApiCallbackGeneric, context,
+                                 argc, call_handler_info, api_holder.value(),
+                                 p->receiver()));
 }
 
 void AccessorAssembler::HandleLoadField(TNode<JSObject> holder,
@@ -310,44 +309,25 @@ void AccessorAssembler::HandleLoadField(TNode<JSObject> holder,
       Signed(DecodeWordFromWord32<LoadHandler::FieldIndexBits>(handler_word));
   TNode<IntPtrT> offset = IntPtrMul(index, IntPtrConstant(kTaggedSize));
 
-  Label inobject(this), out_of_object(this);
-  Branch(IsSetWord32<LoadHandler::IsInobjectBits>(handler_word), &inobject,
-         &out_of_object);
-
-  BIND(&inobject);
-  {
-    Label is_double(this);
-    GotoIf(IsSetWord32<LoadHandler::IsDoubleBits>(handler_word), &is_double);
-    exit_point->Return(LoadObjectField(holder, offset));
-
-    BIND(&is_double);
-    TNode<Object> heap_number = LoadObjectField(holder, offset);
-    // This is not an "old" Smi value from before a Smi->Double transition.
-    // Rather, it's possible that since the last update of this IC, the Double
-    // field transitioned to a Tagged field, and was then assigned a Smi.
-    GotoIf(TaggedIsSmi(heap_number), miss);
-    GotoIfNot(IsHeapNumber(CAST(heap_number)), miss);
-    *var_double_value = LoadHeapNumberValue(CAST(heap_number));
-    Goto(rebox_double);
-  }
-
-  BIND(&out_of_object);
-  {
-    Label is_double(this);
-    TNode<HeapObject> properties = LoadFastProperties(holder);
-    TNode<Object> value = LoadObjectField(properties, offset);
-    GotoIf(IsSetWord32<LoadHandler::IsDoubleBits>(handler_word), &is_double);
-    exit_point->Return(value);
-
-    BIND(&is_double);
-    // This is not an "old" Smi value from before a Smi->Double transition.
-    // Rather, it's possible that since the last update of this IC, the Double
-    // field transitioned to a Tagged field, and was then assigned a Smi.
-    GotoIf(TaggedIsSmi(value), miss);
-    GotoIfNot(IsHeapNumber(CAST(value)), miss);
-    *var_double_value = LoadHeapNumberValue(CAST(value));
-    Goto(rebox_double);
-  }
+  TNode<BoolT> is_inobject =
+      IsSetWord32<LoadHandler::IsInobjectBits>(handler_word);
+  TNode<HeapObject> property_storage = Select<HeapObject>(
+      is_inobject, [&]() { return holder; },
+      [&]() { return LoadFastProperties(holder, true); });
+
+  Label is_double(this);
+  TNode<Object> value = LoadObjectField(property_storage, offset);
+  GotoIf(IsSetWord32<LoadHandler::IsDoubleBits>(handler_word), &is_double);
+  exit_point->Return(value);
+
+  BIND(&is_double);
+  // This is not an "old" Smi value from before a Smi->Double transition.
+  // Rather, it's possible that since the last update of this IC, the Double
+  // field transitioned to a Tagged field, and was then assigned a Smi.
+  GotoIf(TaggedIsSmi(value), miss);
+  GotoIfNot(IsHeapNumber(CAST(value)), miss);
+  *var_double_value = LoadHeapNumberValue(CAST(value));
+  Goto(rebox_double);
 }
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -582,8 +562,8 @@ void AccessorAssembler::HandleLoadICSmiHandlerCase(
 
       BIND(&return_undefined);
       exit_point->Return(access_mode == LoadAccessMode::kHas
-                             ? FalseConstant()
-                             : UndefinedConstant());
+                             ? TNode<Object>(FalseConstant())
+                             : TNode<Object>(UndefinedConstant()));
     }
 
     BIND(&if_hole);
@@ -593,8 +573,8 @@ void AccessorAssembler::HandleLoadICSmiHandlerCase(
       GotoIfNot(IsSetWord32<LoadHandler::ConvertHoleBits>(handler_word), miss);
       GotoIf(IsNoElementsProtectorCellInvalid(), miss);
       exit_point->Return(access_mode == LoadAccessMode::kHas
-                             ? FalseConstant()
-                             : UndefinedConstant());
+                             ? TNode<Object>(FalseConstant())
+                             : TNode<Object>(UndefinedConstant()));
     }
 
     if (access_mode != LoadAccessMode::kHas) {
@@ -759,10 +739,7 @@ void AccessorAssembler::HandleLoadICSmiHandlerLoadNamedCase(
   }
 
   BIND(&native_data_property);
-  {
-    GotoIf(IsSideEffectFreeDebuggingActive(), &slow);
-    HandleLoadCallbackProperty(p, CAST(holder), handler_word, exit_point);
-  }
+  HandleLoadCallbackProperty(p, CAST(holder), handler_word, exit_point);
 
   BIND(&api_getter);
   {
@@ -771,7 +748,6 @@ void AccessorAssembler::HandleLoadICSmiHandlerLoadNamedCase(
       // the correct receiver checks.
       Goto(&slow);
     } else {
-      GotoIf(IsSideEffectFreeDebuggingActive(), &slow);
       HandleLoadAccessor(p, CAST(holder), handler_word, CAST(handler),
                          handler_kind, exit_point);
     }
@@ -832,7 +808,7 @@ void AccessorAssembler::HandleLoadICSmiHandlerLoadNamedCase(
         LoadObjectField(CAST(holder), PropertyCell::kValueOffset);
     TNode<Uint32T> details = Unsigned(LoadAndUntagToWord32ObjectField(
         CAST(holder), PropertyCell::kPropertyDetailsRawOffset));
-    GotoIf(IsTheHole(value), miss);
+    GotoIf(IsPropertyCellHole(value), miss);
 
     exit_point->Return(CallGetterIfAccessor(value, CAST(holder), details,
                                             p->context(), p->receiver(),
@@ -958,7 +934,7 @@ void AccessorAssembler::HandleLoadICSmiHandlerHasNamedCase(
     // Ensure the property cell doesn't contain the hole.
     TNode<Object> value =
         LoadObjectField(CAST(holder), PropertyCell::kValueOffset);
-    GotoIf(IsTheHole(value), miss);
+    GotoIf(IsPropertyCellHole(value), miss);
 
     exit_point->Return(TrueConstant());
   }
@@ -1229,7 +1205,7 @@ void AccessorAssembler::HandleStoreICSmiHandlerJSSharedStructFieldCase(
       IsSetWord32<StoreHandler::IsInobjectBits>(handler_word);
   TNode<HeapObject> property_storage = Select<HeapObject>(
       is_inobject, [&]() { return holder; },
-      [&]() { return LoadFastProperties(holder); });
+      [&]() { return LoadFastProperties(holder, true); });
 
   TNode<UintPtrT> index =
       DecodeWordFromWord32<StoreHandler::FieldIndexBits>(handler_word);
@@ -1493,23 +1469,21 @@ void AccessorAssembler::HandleStoreICTransitionMapHandlerCase(
                                     p->value(), miss, true);
 }
 
-void AccessorAssembler::UpdateMayHaveInterestingSymbol(
+void AccessorAssembler::UpdateMayHaveInterestingProperty(
     TNode<PropertyDictionary> dict, TNode<Name> name) {
-  Comment("UpdateMayHaveInterestingSymbol");
+  Comment("UpdateMayHaveInterestingProperty");
   Label done(this);
 
   if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
     // TODO(pthier): Add flags to swiss dictionaries.
     Goto(&done);
   } else {
-    GotoIfNot(IsSymbol(name), &done);
-    TNode<Uint32T> symbol_flags =
-        LoadObjectField<Uint32T>(name, Symbol::kFlagsOffset);
-    GotoIfNot(IsSetWord32<Symbol::IsInterestingSymbolBit>(symbol_flags), &done);
+    GotoIfNot(IsInterestingProperty(name), &done);
     TNode<Smi> flags = GetNameDictionaryFlags(dict);
     flags = SmiOr(
-        flags, SmiConstant(
-                   NameDictionary::MayHaveInterestingSymbolsBit::encode(true)));
+        flags,
+        SmiConstant(
+            NameDictionary::MayHaveInterestingPropertiesBit::encode(true)));
     SetNameDictionaryFlags(dict, flags);
     Goto(&done);
   }
@@ -1685,7 +1659,7 @@ void AccessorAssembler::OverwriteExistingFastDataProperty(
       } else {
         Label tagged_rep(this), double_rep(this);
         TNode<PropertyArray> properties =
-            CAST(LoadFastProperties(CAST(object)));
+            CAST(LoadFastProperties(CAST(object), true));
         Branch(
             Word32Equal(representation, Int32Constant(Representation::kDouble)),
             &double_rep, &tagged_rep);
@@ -1765,7 +1739,7 @@ void AccessorAssembler::StoreJSSharedStructField(
         Word32Equal(DecodeWord32<PropertyDetails::RepresentationField>(details),
                     Int32Constant(Representation::kTagged)));
     TNode<PropertyArray> properties =
-        CAST(LoadFastProperties(CAST(shared_struct)));
+        CAST(LoadFastProperties(CAST(shared_struct), true));
     StoreJSSharedStructPropertyArrayElement(properties, backing_store_index,
                                             shared_value.value());
     Goto(&done);
@@ -1926,8 +1900,8 @@ void AccessorAssembler::HandleStoreICProtoHandler(
       TNode<PropertyDictionary> properties =
           CAST(LoadSlowProperties(CAST(p->receiver())));
       TNode<Name> name = CAST(p->name());
-      Add<PropertyDictionary>(properties, name, p->value(), &slow);
-      UpdateMayHaveInterestingSymbol(properties, name);
+      AddToDictionary<PropertyDictionary>(properties, name, p->value(), &slow);
+      UpdateMayHaveInterestingProperty(properties, name);
       Return(p->value());
 
       BIND(&slow);
@@ -1960,11 +1934,6 @@ void AccessorAssembler::HandleStoreICProtoHandler(
           IsCleared(maybe_context), [=] { return SmiConstant(0); },
           [=] { return GetHeapObjectAssumeWeak(maybe_context); });
 
-      TNode<RawPtrT> callback =
-          LoadCallHandlerInfoJsCallbackPtr(call_handler_info);
-      TNode<Object> data =
-          LoadObjectField(call_handler_info, CallHandlerInfo::kDataOffset);
-
       TVARIABLE(Object, api_holder, p->receiver());
       Label store(this);
       GotoIf(Word32Equal(handler_kind, STORE_KIND(kApiSetter)), &store);
@@ -1977,10 +1946,10 @@ void AccessorAssembler::HandleStoreICProtoHandler(
 
       BIND(&store);
       {
-        GotoIf(IsSideEffectFreeDebuggingActive(), &if_slow);
         TNode<Int32T> argc = Int32Constant(1);
-        Return(CallApiCallback(context, callback, argc, data,
-                               api_holder.value(), p->receiver(), p->value()));
+        Return(CallBuiltin(Builtin::kCallApiCallbackGeneric, context, argc,
+                           call_handler_info, api_holder.value(), p->receiver(),
+                           p->value()));
       }
     }
 
@@ -2167,7 +2136,7 @@ void AccessorAssembler::HandleStoreFieldAndReturn(
       IsSetWord32<StoreHandler::IsInobjectBits>(handler_word);
   TNode<HeapObject> property_storage = Select<HeapObject>(
       is_inobject, [&]() { return holder; },
-      [&]() { return LoadFastProperties(holder); });
+      [&]() { return LoadFastProperties(holder, true); });
 
   TNode<UintPtrT> index =
       DecodeWordFromWord32<StoreHandler::FieldIndexBits>(handler_word);
@@ -2319,7 +2288,7 @@ void AccessorAssembler::EmitFastElementsBoundsCheck(
   Label if_array(this), length_loaded(this, &var_length);
   GotoIf(is_jsarray_condition, &if_array);
   {
-    var_length = SmiUntag(LoadFixedArrayBaseLength(elements));
+    var_length = LoadAndUntagFixedArrayBaseLength(elements);
     Goto(&length_loaded);
   }
   BIND(&if_array);
@@ -2765,8 +2734,9 @@ void AccessorAssembler::GenericPropertyLoad(
       Comment("stub cache probe for fast property load");
       TVARIABLE(MaybeObject, var_handler);
       Label found_handler(this, &var_handler), stub_cache_miss(this);
-      TryProbeStubCache(isolate()->load_stub_cache(), lookup_start_object, name,
-                        &found_handler, &var_handler, &stub_cache_miss);
+      TryProbeStubCache(isolate()->load_stub_cache(), lookup_start_object,
+                        lookup_start_object_map, name, &found_handler,
+                        &var_handler, &stub_cache_miss);
       BIND(&found_handler);
       {
         LazyLoadICParameters lazy_p(p);
@@ -2976,6 +2946,7 @@ void AccessorAssembler::TryProbeStubCacheTable(
 
 void AccessorAssembler::TryProbeStubCache(StubCache* stub_cache,
                                           TNode<Object> lookup_start_object,
+                                          TNode<Map> lookup_start_object_map,
                                           TNode<Name> name, Label* if_handler,
                                           TVariable<MaybeObject>* var_handler,
                                           Label* if_miss) {
@@ -2984,27 +2955,6 @@ void AccessorAssembler::TryProbeStubCache(StubCache* stub_cache,
   Counters* counters = isolate()->counters();
   IncrementCounter(counters->megamorphic_stub_cache_probes(), 1);
 
-  Label smi(this), non_smi(this), do_lookup(this);
-  TVARIABLE(Map, map_var);
-  Branch(TaggedIsSmi(lookup_start_object), &smi, &non_smi);
-
-  BIND(&smi);
-  {
-    // Also for smis the HeapNumberMap is used to identify number feedback.
-    map_var = HeapNumberMapConstant();
-    Goto(&do_lookup);
-  }
-
-  BIND(&non_smi);
-  {
-    map_var = LoadMap(CAST(lookup_start_object));
-    Goto(&do_lookup);
-  }
-
-  BIND(&do_lookup);
-
-  TNode<Map> lookup_start_object_map = map_var.value();
-
   // Probe the primary table.
   TNode<IntPtrT> primary_offset =
       StubCachePrimaryOffset(name, lookup_start_object_map);
@@ -3245,7 +3195,8 @@ void AccessorAssembler::LoadIC_Noninlined(const LoadICParameters* p,
     BIND(&try_megamorphic);
     {
       TryProbeStubCache(isolate()->load_stub_cache(), p->lookup_start_object(),
-                        CAST(p->name()), if_handler, var_handler, miss);
+                        lookup_start_object_map, CAST(p->name()), if_handler,
+                        var_handler, miss);
     }
 
     BIND(&try_megadom);
@@ -3377,7 +3328,7 @@ void AccessorAssembler::LoadGlobalIC_TryPropertyCellCase(
         CAST(GetHeapObjectAssumeWeak(maybe_weak_ref, try_handler));
     TNode<Object> value =
         LoadObjectField(property_cell, PropertyCell::kValueOffset);
-    GotoIf(TaggedEqual(value, TheHoleConstant()), miss);
+    GotoIf(TaggedEqual(value, PropertyCellHoleConstant()), miss);
     exit_point->Return(value);
   }
 
@@ -3437,8 +3388,9 @@ void AccessorAssembler::ScriptContextTableLookup(
       LoadContextElement(native_context, Context::SCRIPT_CONTEXT_TABLE_INDEX));
   TVARIABLE(IntPtrT, context_index, IntPtrConstant(-1));
   Label loop(this, &context_index);
-  TNode<IntPtrT> num_script_contexts = SmiUntag(CAST(LoadFixedArrayElement(
-      script_context_table, ScriptContextTable::kUsedSlotIndex)));
+  TNode<IntPtrT> num_script_contexts =
+      PositiveSmiUntag(CAST(LoadFixedArrayElement(
+          script_context_table, ScriptContextTable::kUsedSlotIndex)));
   Goto(&loop);
 
   BIND(&loop);
@@ -3716,7 +3668,8 @@ void AccessorAssembler::KeyedLoadICGeneric_StringKey(
 
     TVARIABLE(Name, var_unique);
     Label if_thinstring(this), if_unique_name(this), if_notunique(this);
-    GotoIf(InstanceTypeEqual(instance_type, THIN_STRING_TYPE), &if_thinstring);
+    static_assert(base::bits::CountPopulation(kThinStringTagBit) == 1);
+    GotoIf(IsSetWord32(instance_type, kThinStringTagBit), &if_thinstring);
 
     // Check |key| does not contain forwarding index.
     CSA_DCHECK(this,
@@ -3876,7 +3829,8 @@ void AccessorAssembler::StoreIC(const StoreICParameters* p) {
     GotoIfNot(TaggedEqual(strong_feedback, MegamorphicSymbolConstant()), &miss);
 
     TryProbeStubCache(isolate()->store_stub_cache(), p->receiver(),
-                      CAST(p->name()), &if_handler, &var_handler, &miss);
+                      receiver_map, CAST(p->name()), &if_handler, &var_handler,
+                      &miss);
   }
 
   BIND(&no_feedback);
@@ -3998,7 +3952,7 @@ void AccessorAssembler::StoreGlobalIC_PropertyCellCase(
   GotoIf(Word32Equal(type, Int32Constant(
                                static_cast<int>(PropertyCellType::kConstant))),
          &constant);
-  CSA_DCHECK(this, Word32BinaryNot(IsTheHole(cell_contents)));
+  CSA_DCHECK(this, IsNotAnyHole(cell_contents));
 
   GotoIf(Word32Equal(
              type, Int32Constant(static_cast<int>(PropertyCellType::kMutable))),
@@ -4032,7 +3986,7 @@ void AccessorAssembler::StoreGlobalIC_PropertyCellCase(
   {
     // Since |value| is never the hole, the equality check below also handles an
     // invalidated property cell correctly.
-    CSA_DCHECK(this, Word32BinaryNot(IsTheHole(value)));
+    CSA_DCHECK(this, IsNotAnyHole(value));
     GotoIfNot(TaggedEqual(cell_contents, value), miss);
     exit_point->Return(value);
   }
@@ -4636,7 +4590,7 @@ void AccessorAssembler::GenerateLookupGlobalICBaseline(TypeofMode typeof_mode) {
 }
 
 void AccessorAssembler::GenerateKeyedLoadIC() {
-  using Descriptor = LoadWithVectorDescriptor;
+  using Descriptor = KeyedLoadWithVectorDescriptor;
 
   auto receiver = Parameter<Object>(Descriptor::kReceiver);
   auto name = Parameter<Object>(Descriptor::kName);
@@ -4649,7 +4603,7 @@ void AccessorAssembler::GenerateKeyedLoadIC() {
 }
 
 void AccessorAssembler::GenerateKeyedLoadIC_Megamorphic() {
-  using Descriptor = LoadWithVectorDescriptor;
+  using Descriptor = KeyedLoadWithVectorDescriptor;
 
   auto receiver = Parameter<Object>(Descriptor::kReceiver);
   auto name = Parameter<Object>(Descriptor::kName);
@@ -4675,7 +4629,7 @@ void AccessorAssembler::GenerateKeyedLoadIC_MegamorphicStringKey() {
 }
 
 void AccessorAssembler::GenerateKeyedLoadICTrampoline() {
-  using Descriptor = LoadDescriptor;
+  using Descriptor = KeyedLoadDescriptor;
 
   auto receiver = Parameter<Object>(Descriptor::kReceiver);
   auto name = Parameter<Object>(Descriptor::kName);
@@ -4687,7 +4641,7 @@ void AccessorAssembler::GenerateKeyedLoadICTrampoline() {
 }
 
 void AccessorAssembler::GenerateKeyedLoadICBaseline() {
-  using Descriptor = LoadBaselineDescriptor;
+  using Descriptor = KeyedLoadBaselineDescriptor;
 
   auto receiver = Parameter<Object>(Descriptor::kReceiver);
   auto name = Parameter<Object>(Descriptor::kName);
@@ -4699,7 +4653,7 @@ void AccessorAssembler::GenerateKeyedLoadICBaseline() {
 }
 
 void AccessorAssembler::GenerateKeyedLoadICTrampoline_Megamorphic() {
-  using Descriptor = LoadDescriptor;
+  using Descriptor = KeyedLoadDescriptor;
 
   auto receiver = Parameter<Object>(Descriptor::kReceiver);
   auto name = Parameter<Object>(Descriptor::kName);
@@ -4993,14 +4947,42 @@ void AccessorAssembler::GenerateCloneObjectIC_Slow() {
   auto flags = Parameter<Smi>(Descriptor::kFlags);
   auto context = Parameter<Context>(Descriptor::kContext);
 
-  // The Slow case uses the same call interface as CloneObjectIC, so that it
-  // can be tail called from it. However, the feedback slot and vector are not
-  // used.
+  // The CloneObjectIC_Slow implementation uses the same call interface as
+  // CloneObjectIC, so that it can be tail called from it. However, the feedback
+  // slot and vector are not used.
+
+  // First try a fast case where we copy the properties with a CSA loop.
+  Label try_fast_case(this), call_runtime(this, Label::kDeferred);
+
+  // For SMIs and non JSObjects we use 0 in object properties.
+  TVARIABLE(IntPtrT, number_of_properties, IntPtrConstant(0));
+  GotoIf(TaggedIsSmi(source), &try_fast_case);
+  {
+    TNode<Map> source_map = LoadMap(CAST(source));
+    // We still want to stay in the semi-fast case for oddballs, strings,
+    // proxies and such. Therefore we continue here, but using 0 in object
+    // properties.
+    GotoIfNot(IsJSObjectMap(source_map), &try_fast_case);
+
+    // At this point we don't know yet if ForEachEnumerableOwnProperty can
+    // handle the source object. In case it is a dictionary mode object or has
+    // non simple properties the latter will bail to `runtime_copy`. For code
+    // compactness we don't check it here, assuming that the number of in-object
+    // properties is set to 0 (or a reasonable value).
+    number_of_properties = MapUsedInObjectProperties(source_map);
+    GotoIf(IntPtrGreaterThanOrEqual(number_of_properties.value(),
+                                    IntPtrConstant(JSObject::kMapCacheSize)),
+           &call_runtime);
+  }
+  Goto(&try_fast_case);
 
+  BIND(&try_fast_case);
   TNode<NativeContext> native_context = LoadNativeContext(context);
-  TNode<Map> initial_map = LoadObjectFunctionInitialMap(native_context);
+  TNode<Map> initial_map = LoadCachedMap(
+      native_context, number_of_properties.value(), &call_runtime);
   TNode<JSObject> result = AllocateJSObjectFromMap(initial_map);
 
+  // Handle the case where the object literal overrides the prototype.
   {
     Label did_set_proto_if_needed(this);
     TNode<BoolT> is_null_proto = SmiNotEqual(
@@ -5015,29 +4997,37 @@ void AccessorAssembler::GenerateCloneObjectIC_Slow() {
     BIND(&did_set_proto_if_needed);
   }
 
+  // Early return for when we know there are no properties.
+  ReturnIf(TaggedIsSmi(source), result);
   ReturnIf(IsNullOrUndefined(source), result);
-  source = ToObject_Inline(context, source);
 
-  Label call_runtime(this, Label::kDeferred), done(this);
+  Label runtime_copy(this, Label::kDeferred);
 
   TNode<Map> source_map = LoadMap(CAST(source));
-  GotoIfNot(IsJSObjectMap(source_map), &call_runtime);
-  GotoIfNot(IsEmptyFixedArray(LoadElements(CAST(source))), &call_runtime);
+  GotoIfNot(IsJSObjectMap(source_map), &runtime_copy);
+  // Takes care of objects with elements.
+  GotoIfNot(IsEmptyFixedArray(LoadElements(CAST(source))), &runtime_copy);
 
+  // TODO(olivf, chrome:1204540) This can still be several times slower than the
+  // Babel translation. TF uses FastGetOwnValuesOrEntries -- should we do sth
+  // similar here?
   ForEachEnumerableOwnProperty(
       context, source_map, CAST(source), kPropertyAdditionOrder,
       [=](TNode<Name> key, TNode<Object> value) {
         CreateDataProperty(context, result, key, value);
       },
-      &call_runtime);
-  Goto(&done);
+      &runtime_copy);
+  Return(result);
 
-  BIND(&call_runtime);
+  // This is the fall-back case for the above fastcase, where we allocated an
+  // object, but failed to copy the properties in CSA.
+  BIND(&runtime_copy);
   CallRuntime(Runtime::kCopyDataProperties, context, result, source);
-
-  Goto(&done);
-  BIND(&done);
   Return(result);
+
+  // Final fallback is to call into the runtime version.
+  BIND(&call_runtime);
+  Return(CallRuntime(Runtime::kCloneObjectIC_Slow, context, source, flags));
 }
 
 void AccessorAssembler::GenerateCloneObjectICBaseline() {
@@ -5061,9 +5051,9 @@ void AccessorAssembler::GenerateCloneObjectIC() {
   auto slot = Parameter<TaggedIndex>(Descriptor::kSlot);
   auto maybe_vector = Parameter<HeapObject>(Descriptor::kVector);
   auto context = Parameter<Context>(Descriptor::kContext);
-  TVARIABLE(MaybeObject, var_handler);
-  Label if_handler(this, &var_handler), miss(this, Label::kDeferred),
-      try_polymorphic(this, Label::kDeferred),
+  TVARIABLE(Map, result_map);
+  Label if_result_map(this, &result_map), if_empty_object(this),
+      miss(this, Label::kDeferred), try_polymorphic(this, Label::kDeferred),
       try_megamorphic(this, Label::kDeferred), slow(this, Label::kDeferred);
 
   TNode<Map> source_map = LoadReceiverMap(source);
@@ -5071,26 +5061,69 @@ void AccessorAssembler::GenerateCloneObjectIC() {
 
   GotoIf(IsUndefined(maybe_vector), &slow);
 
+  TNode<HeapObjectReference> feedback;
   TNode<HeapObjectReference> weak_source_map = MakeWeak(source_map);
-  TNode<HeapObjectReference> feedback =
-      TryMonomorphicCase(slot, CAST(maybe_vector), weak_source_map, &if_handler,
-                         &var_handler, &try_polymorphic);
 
-  BIND(&if_handler);
+  // Decide if monomorphic or polymorphic, then dispatch based on the handler.
   {
+    TVARIABLE(MaybeObject, var_handler);
+    Label if_handler(this, &var_handler);
+    feedback = TryMonomorphicCase(slot, CAST(maybe_vector), weak_source_map,
+                                  &if_handler, &var_handler, &try_polymorphic);
+
+    BIND(&try_polymorphic);
+    TNode<HeapObject> strong_feedback = GetHeapObjectIfStrong(feedback, &miss);
+    {
+      Comment("CloneObjectIC_try_polymorphic");
+      GotoIfNot(IsWeakFixedArrayMap(LoadMap(strong_feedback)),
+                &try_megamorphic);
+      HandlePolymorphicCase(weak_source_map, CAST(strong_feedback), &if_handler,
+                            &var_handler, &miss);
+    }
+
+    BIND(&try_megamorphic);
+    {
+      Comment("CloneObjectIC_try_megamorphic");
+      CSA_DCHECK(
+          this,
+          Word32Or(TaggedEqual(strong_feedback, UninitializedSymbolConstant()),
+                   TaggedEqual(strong_feedback, MegamorphicSymbolConstant())));
+      GotoIfNot(TaggedEqual(strong_feedback, MegamorphicSymbolConstant()),
+                &miss);
+      Goto(&slow);
+    }
+
+    BIND(&if_handler);
     Comment("CloneObjectIC_if_handler");
 
+    // When the result of cloning the object is an empty object literal we store
+    // a Smi into the feedback.
+    GotoIf(TaggedIsSmi(var_handler.value()), &if_empty_object);
+
     // Handlers for the CloneObjectIC stub are weak references to the Map of
     // a result object.
-    TNode<Map> result_map = CAST(var_handler.value());
+    result_map = CAST(GetHeapObjectAssumeWeak(var_handler.value(), &miss));
+    Goto(&if_result_map);
+  }
+
+  // Cloning with a concrete result_map.
+  {
+    BIND(&if_result_map);
+    Comment("CloneObjectIC_if_result_map");
+
+    // Next to the trivial case above the IC supports only JSObjects.
+    // TODO(olivf): To support JSObjects other than JS_OBJECT_TYPE we need to
+    // initialize the the in-object properties below in
+    // `AllocateJSObjectFromMap`.
+    CSA_DCHECK(this, InstanceTypeEqual(LoadMapInstanceType(source_map),
+                                       JS_OBJECT_TYPE));
+    CSA_DCHECK(this, IsStrong(result_map.value()));
+    CSA_DCHECK(this, InstanceTypeEqual(LoadMapInstanceType(result_map.value()),
+                                       JS_OBJECT_TYPE));
+
     TVARIABLE(HeapObject, var_properties, EmptyFixedArrayConstant());
     TVARIABLE(FixedArray, var_elements, EmptyFixedArrayConstant());
 
-    Label allocate_object(this);
-    GotoIf(IsNullOrUndefined(source), &allocate_object);
-    CSA_SLOW_DCHECK(this, IsJSObjectMap(source_map));
-    CSA_SLOW_DCHECK(this, IsJSObjectMap(result_map));
-
     // The IC fast case should only be taken if the result map a compatible
     // elements kind with the source object.
     TNode<FixedArrayBase> source_elements = LoadElements(CAST(source));
@@ -5098,6 +5131,7 @@ void AccessorAssembler::GenerateCloneObjectIC() {
     auto flag = ExtractFixedArrayFlag::kAllFixedArraysDontCopyCOW;
     var_elements = CAST(CloneFixedArray(source_elements, flag));
 
+    Label allocate_object(this);
     // Copy the PropertyArray backing store. The source PropertyArray must be
     // either an Smi, or a PropertyArray.
     // FIXME: Make a CSA macro for this
@@ -5122,29 +5156,45 @@ void AccessorAssembler::GenerateCloneObjectIC() {
 
     Goto(&allocate_object);
     BIND(&allocate_object);
+
+    // Both maps need to be in the same slack tracking state or the unused
+    // fields will be wrongly initialized.
+    static_assert(Map::kNoSlackTracking == 0);
+    CSA_DCHECK(this,
+               Word32Equal(IsSetWord32<Map::Bits3::ConstructionCounterBits>(
+                               LoadMapBitField3(source_map)),
+                           IsSetWord32<Map::Bits3::ConstructionCounterBits>(
+                               LoadMapBitField3(result_map.value()))));
     TNode<JSObject> object = UncheckedCast<JSObject>(AllocateJSObjectFromMap(
-        result_map, var_properties.value(), var_elements.value()));
-    ReturnIf(IsNullOrUndefined(source), object);
+        result_map.value(), var_properties.value(), var_elements.value(),
+        AllocationFlag::kNone,
+        SlackTrackingMode::kDontInitializeInObjectProperties));
 
     // Lastly, clone any in-object properties.
     TNode<IntPtrT> source_start =
         LoadMapInobjectPropertiesStartInWords(source_map);
-    TNode<IntPtrT> source_size = LoadMapInstanceSizeInWords(source_map);
     TNode<IntPtrT> result_start =
-        LoadMapInobjectPropertiesStartInWords(result_map);
+        LoadMapInobjectPropertiesStartInWords(result_map.value());
+    TNode<IntPtrT> result_size = LoadMapInstanceSizeInWords(result_map.value());
     TNode<IntPtrT> field_offset_difference =
         TimesTaggedSize(IntPtrSub(result_start, source_start));
+#ifdef DEBUG
+    TNode<IntPtrT> source_size = LoadMapInstanceSizeInWords(source_map);
+    CSA_DCHECK(this, IntPtrGreaterThanOrEqual(
+                         IntPtrSub(source_size, field_offset_difference),
+                         result_size));
+#endif
 
     // Just copy the fields as raw data (pretending that there are no mutable
     // HeapNumbers). This doesn't need write barriers.
     BuildFastLoop<IntPtrT>(
-        source_start, source_size,
+        result_start, result_size,
         [=](TNode<IntPtrT> field_index) {
           TNode<IntPtrT> field_offset = TimesTaggedSize(field_index);
           TNode<TaggedT> field =
               LoadObjectField<TaggedT>(CAST(source), field_offset);
           TNode<IntPtrT> result_offset =
-              IntPtrAdd(field_offset, field_offset_difference);
+              IntPtrSub(field_offset, field_offset_difference);
           StoreObjectFieldNoWriteBarrier(object, result_offset, field);
         },
         1, LoopUnrollingMode::kYes, IndexAdvanceMode::kPost);
@@ -5155,31 +5205,23 @@ void AccessorAssembler::GenerateCloneObjectIC() {
     // double fields.
     TNode<IntPtrT> start_offset = TimesTaggedSize(result_start);
     TNode<IntPtrT> end_offset =
-        IntPtrAdd(TimesTaggedSize(source_size), field_offset_difference);
+        IntPtrAdd(TimesTaggedSize(result_size), field_offset_difference);
     ConstructorBuiltinsAssembler(state()).CopyMutableHeapNumbersInObject(
         object, start_offset, end_offset);
 
     Return(object);
   }
 
-  BIND(&try_polymorphic);
-  TNode<HeapObject> strong_feedback = GetHeapObjectIfStrong(feedback, &miss);
+  // Case for when the result is the empty object literal. Can't be shared with
+  // the above since we must initialize the in-object properties.
   {
-    Comment("CloneObjectIC_try_polymorphic");
-    GotoIfNot(IsWeakFixedArrayMap(LoadMap(strong_feedback)), &try_megamorphic);
-    HandlePolymorphicCase(weak_source_map, CAST(strong_feedback), &if_handler,
-                          &var_handler, &miss);
-  }
-
-  BIND(&try_megamorphic);
-  {
-    Comment("CloneObjectIC_try_megamorphic");
-    CSA_DCHECK(
-        this,
-        Word32Or(TaggedEqual(strong_feedback, UninitializedSymbolConstant()),
-                 TaggedEqual(strong_feedback, MegamorphicSymbolConstant())));
-    GotoIfNot(TaggedEqual(strong_feedback, MegamorphicSymbolConstant()), &miss);
-    Goto(&slow);
+    BIND(&if_empty_object);
+    Comment("CloneObjectIC_if_empty_object");
+    TNode<NativeContext> native_context = LoadNativeContext(context);
+    TNode<Map> initial_map = LoadObjectFunctionInitialMap(native_context);
+    TNode<JSObject> object =
+        UncheckedCast<JSObject>(AllocateJSObjectFromMap(initial_map, {}, {}));
+    Return(object);
   }
 
   BIND(&slow);
@@ -5194,15 +5236,19 @@ void AccessorAssembler::GenerateCloneObjectIC() {
     TNode<HeapObject> map_or_result =
         CAST(CallRuntime(Runtime::kCloneObjectIC_Miss, context, source, flags,
                          slot, maybe_vector));
-    var_handler = UncheckedCast<MaybeObject>(map_or_result);
-    GotoIf(IsMap(map_or_result), &if_handler);
+    Label restart(this);
+    GotoIf(IsMap(map_or_result), &restart);
     CSA_DCHECK(this, IsJSObject(map_or_result));
     Return(map_or_result);
+
+    BIND(&restart);
+    result_map = CAST(map_or_result);
+    Goto(&if_result_map);
   }
 }
 
 void AccessorAssembler::GenerateKeyedHasIC() {
-  using Descriptor = LoadWithVectorDescriptor;
+  using Descriptor = KeyedHasICWithVectorDescriptor;
 
   auto receiver = Parameter<Object>(Descriptor::kReceiver);
   auto name = Parameter<Object>(Descriptor::kName);
@@ -5215,7 +5261,7 @@ void AccessorAssembler::GenerateKeyedHasIC() {
 }
 
 void AccessorAssembler::GenerateKeyedHasICBaseline() {
-  using Descriptor = LoadBaselineDescriptor;
+  using Descriptor = KeyedHasICBaselineDescriptor;
 
   auto receiver = Parameter<Object>(Descriptor::kReceiver);
   auto name = Parameter<Object>(Descriptor::kName);
@@ -5227,7 +5273,7 @@ void AccessorAssembler::GenerateKeyedHasICBaseline() {
 }
 
 void AccessorAssembler::GenerateKeyedHasIC_Megamorphic() {
-  using Descriptor = LoadWithVectorDescriptor;
+  using Descriptor = KeyedHasICWithVectorDescriptor;
 
   auto receiver = Parameter<Object>(Descriptor::kReceiver);
   auto name = Parameter<Object>(Descriptor::kName);
diff --git a/deps/v8/src/ic/accessor-assembler.h b/deps/v8/src/ic/accessor-assembler.h
index 367a9aff520bef..88fadf5ef237a1 100644
--- a/deps/v8/src/ic/accessor-assembler.h
+++ b/deps/v8/src/ic/accessor-assembler.h
@@ -8,6 +8,7 @@
 #include "src/base/optional.h"
 #include "src/codegen/code-stub-assembler.h"
 #include "src/compiler/code-assembler.h"
+#include "src/objects/dictionary.h"
 
 namespace v8 {
 namespace internal {
@@ -79,9 +80,18 @@ class V8_EXPORT_PRIVATE AccessorAssembler : public CodeStubAssembler {
   void GenerateStoreInArrayLiteralICBaseline();
 
   void TryProbeStubCache(StubCache* stub_cache,
-                         TNode<Object> lookup_start_object, TNode<Name> name,
+                         TNode<Object> lookup_start_object,
+                         TNode<Map> lookup_start_object_map, TNode<Name> name,
                          Label* if_handler, TVariable<MaybeObject>* var_handler,
                          Label* if_miss);
+  void TryProbeStubCache(StubCache* stub_cache,
+                         TNode<Object> lookup_start_object, TNode<Name> name,
+                         Label* if_handler, TVariable<MaybeObject>* var_handler,
+                         Label* if_miss) {
+    return TryProbeStubCache(stub_cache, lookup_start_object,
+                             LoadReceiverMap(lookup_start_object), name,
+                             if_handler, var_handler, if_miss);
+  }
 
   TNode<IntPtrT> StubCachePrimaryOffsetForTesting(TNode<Name> name,
                                                   TNode<Map> map) {
@@ -275,9 +285,9 @@ class V8_EXPORT_PRIVATE AccessorAssembler : public CodeStubAssembler {
                                              Label* miss,
                                              StoreTransitionMapFlags flags);
 
-  // Updates flags on |dict| if |name| is an interesting symbol.
-  void UpdateMayHaveInterestingSymbol(TNode<PropertyDictionary> dict,
-                                      TNode<Name> name);
+  // Updates flags on |dict| if |name| is an interesting property.
+  void UpdateMayHaveInterestingProperty(TNode<PropertyDictionary> dict,
+                                        TNode<Name> name);
 
   void JumpIfDataProperty(TNode<Uint32T> details, Label* writable,
                           Label* readonly);
diff --git a/deps/v8/src/ic/binary-op-assembler.cc b/deps/v8/src/ic/binary-op-assembler.cc
index a1dfbe49d85c82..444431074ef5c4 100644
--- a/deps/v8/src/ic/binary-op-assembler.cc
+++ b/deps/v8/src/ic/binary-op-assembler.cc
@@ -794,16 +794,21 @@ TNode<Object> BinaryOpAssembler::Generate_BitwiseBinaryOpWithOptionalFeedback(
   Label if_left_bigint(this), if_left_bigint64(this);
   Label if_left_number_right_bigint(this, Label::kDeferred);
 
+  FeedbackValues feedback =
+      slot ? FeedbackValues{&var_left_feedback, maybe_feedback_vector, slot,
+                            update_feedback_mode}
+           : FeedbackValues();
+
   TaggedToWord32OrBigIntWithFeedback(
       context(), left, &if_left_number, &var_left_word32, &if_left_bigint,
       IsBigInt64OpSupported(this, bitwise_op) ? &if_left_bigint64 : nullptr,
-      &var_left_bigint, slot ? &var_left_feedback : nullptr);
+      &var_left_bigint, feedback);
 
   BIND(&if_left_number);
+  feedback.var_feedback = slot ? &var_right_feedback : nullptr;
   TaggedToWord32OrBigIntWithFeedback(
       context(), right, &do_number_op, &var_right_word32,
-      &if_left_number_right_bigint, nullptr, nullptr,
-      slot ? &var_right_feedback : nullptr);
+      &if_left_number_right_bigint, nullptr, nullptr, feedback);
 
   BIND(&if_left_number_right_bigint);
   {
@@ -1047,9 +1052,11 @@ BinaryOpAssembler::Generate_BitwiseBinaryOpWithSmiOperandAndOptionalFeedback(
   BIND(&if_lhsisnotsmi);
   {
     TNode<HeapObject> left_pointer = CAST(left);
+    FeedbackValues feedback_values{&var_left_feedback, maybe_feedback_vector,
+                                   slot, update_feedback_mode};
     TaggedPointerToWord32OrBigIntWithFeedback(
         context(), left_pointer, &do_number_op, &var_left_word32,
-        &if_bigint_mix, nullptr, &var_left_bigint, &var_left_feedback);
+        &if_bigint_mix, nullptr, &var_left_bigint, feedback_values);
     BIND(&do_number_op);
     {
       result =
@@ -1075,8 +1082,10 @@ BinaryOpAssembler::Generate_BitwiseBinaryOpWithSmiOperandAndOptionalFeedback(
   }
 
   BIND(&done);
-  UpdateFeedback(feedback.value(), (*maybe_feedback_vector)(), *slot,
-                 update_feedback_mode);
+  if (slot) {
+    UpdateFeedback(feedback.value(), (*maybe_feedback_vector)(), *slot,
+                   update_feedback_mode);
+  }
   return result.value();
 }
 
diff --git a/deps/v8/src/ic/call-optimization.cc b/deps/v8/src/ic/call-optimization.cc
index afd4fe9ec7e4aa..d0dfc92d342013 100644
--- a/deps/v8/src/ic/call-optimization.cc
+++ b/deps/v8/src/ic/call-optimization.cc
@@ -10,9 +10,9 @@ namespace internal {
 
 template <class IsolateT>
 CallOptimization::CallOptimization(IsolateT* isolate, Handle<Object> function) {
-  if (function->IsJSFunction()) {
+  if (IsJSFunction(*function)) {
     Initialize(isolate, Handle<JSFunction>::cast(function));
-  } else if (function->IsFunctionTemplateInfo()) {
+  } else if (IsFunctionTemplateInfo(*function)) {
     Initialize(isolate, Handle<FunctionTemplateInfo>::cast(function));
   }
 }
@@ -23,19 +23,34 @@ template CallOptimization::CallOptimization(Isolate* isolate,
 template CallOptimization::CallOptimization(LocalIsolate* isolate,
                                             Handle<Object> function);
 
-Context CallOptimization::GetAccessorContext(Map holder_map) const {
+base::Optional<NativeContext> CallOptimization::GetAccessorContext(
+    Tagged<Map> holder_map) const {
   if (is_constant_call()) {
     return constant_function_->native_context();
   }
-  JSFunction constructor = JSFunction::cast(holder_map.GetConstructor());
-  return constructor.native_context();
+  Tagged<Object> maybe_constructor = holder_map->GetConstructor();
+  if (IsJSFunction(maybe_constructor)) {
+    Tagged<JSFunction> constructor = JSFunction::cast(maybe_constructor);
+    return constructor->native_context();
+  }
+  // |maybe_constructor| might theoretically be |null| for some objects but
+  // they can't be holders for lazy accessor properties.
+  CHECK(IsFunctionTemplateInfo(maybe_constructor));
+
+  // The holder is a remote object which doesn't have a creation context.
+  return {};
 }
 
-bool CallOptimization::IsCrossContextLazyAccessorPair(Context native_context,
-                                                      Map holder_map) const {
-  DCHECK(native_context.IsNativeContext());
+bool CallOptimization::IsCrossContextLazyAccessorPair(
+    Tagged<NativeContext> native_context, Tagged<Map> holder_map) const {
+  DCHECK(IsNativeContext(native_context));
   if (is_constant_call()) return false;
-  return native_context != GetAccessorContext(holder_map);
+  base::Optional<NativeContext> maybe_context = GetAccessorContext(holder_map);
+  if (!maybe_context.has_value()) {
+    // The holder is a remote object which doesn't have a creation context.
+    return true;
+  }
+  return native_context != maybe_context.value();
 }
 
 template <class IsolateT>
@@ -43,7 +58,7 @@ Handle<JSObject> CallOptimization::LookupHolderOfExpectedType(
     IsolateT* isolate, Handle<Map> object_map,
     HolderLookup* holder_lookup) const {
   DCHECK(is_simple_api_call());
-  if (!object_map->IsJSObjectMap()) {
+  if (!IsJSObjectMap(*object_map)) {
     *holder_lookup = kHolderNotFound;
     return Handle<JSObject>::null();
   }
@@ -52,8 +67,8 @@ Handle<JSObject> CallOptimization::LookupHolderOfExpectedType(
     *holder_lookup = kHolderIsReceiver;
     return Handle<JSObject>::null();
   }
-  if (object_map->IsJSGlobalProxyMap() && !object_map->prototype().IsNull()) {
-    JSObject raw_prototype = JSObject::cast(object_map->prototype());
+  if (IsJSGlobalProxyMap(*object_map) && !IsNull(object_map->prototype())) {
+    Tagged<JSObject> raw_prototype = JSObject::cast(object_map->prototype());
     Handle<JSObject> prototype(raw_prototype, isolate);
     object_map = handle(prototype->map(), isolate);
     if (expected_receiver_type_->IsTemplateFor(*object_map)) {
@@ -86,10 +101,10 @@ bool CallOptimization::IsCompatibleReceiverMap(
       if (api_holder.is_identical_to(holder)) return true;
       // Check if holder is in prototype chain of api_holder.
       {
-        JSObject object = *api_holder;
+        Tagged<JSObject> object = *api_holder;
         while (true) {
-          Object prototype = object.map().prototype();
-          if (!prototype.IsJSObject()) return false;
+          Tagged<Object> prototype = object->map()->prototype();
+          if (!IsJSObject(prototype)) return false;
           if (prototype == *holder) return true;
           object = JSObject::cast(prototype);
         }
@@ -101,12 +116,13 @@ bool CallOptimization::IsCompatibleReceiverMap(
 template <class IsolateT>
 void CallOptimization::Initialize(
     IsolateT* isolate, Handle<FunctionTemplateInfo> function_template_info) {
-  HeapObject call_code = function_template_info->call_code(kAcquireLoad);
-  if (call_code.IsUndefined(isolate)) return;
+  Tagged<HeapObject> call_code =
+      function_template_info->call_code(kAcquireLoad);
+  if (IsUndefined(call_code, isolate)) return;
   api_call_info_ = handle(CallHandlerInfo::cast(call_code), isolate);
 
-  HeapObject signature = function_template_info->signature();
-  if (!signature.IsUndefined(isolate)) {
+  Tagged<HeapObject> signature = function_template_info->signature();
+  if (!IsUndefined(signature, isolate)) {
     expected_receiver_type_ =
         handle(FunctionTemplateInfo::cast(signature), isolate);
   }
@@ -126,16 +142,16 @@ void CallOptimization::Initialize(IsolateT* isolate,
 template <class IsolateT>
 void CallOptimization::AnalyzePossibleApiFunction(IsolateT* isolate,
                                                   Handle<JSFunction> function) {
-  if (!function->shared().IsApiFunction()) return;
-  Handle<FunctionTemplateInfo> info(function->shared().get_api_func_data(),
+  if (!function->shared()->IsApiFunction()) return;
+  Handle<FunctionTemplateInfo> info(function->shared()->api_func_data(),
                                     isolate);
 
   // Require a C++ callback.
-  HeapObject call_code = info->call_code(kAcquireLoad);
-  if (call_code.IsUndefined(isolate)) return;
+  Tagged<HeapObject> call_code = info->call_code(kAcquireLoad);
+  if (IsUndefined(call_code, isolate)) return;
   api_call_info_ = handle(CallHandlerInfo::cast(call_code), isolate);
 
-  if (!info->signature().IsUndefined(isolate)) {
+  if (!IsUndefined(info->signature(), isolate)) {
     expected_receiver_type_ =
         handle(FunctionTemplateInfo::cast(info->signature()), isolate);
   }
diff --git a/deps/v8/src/ic/call-optimization.h b/deps/v8/src/ic/call-optimization.h
index ca5c8aa7ef8478..ea6d4887ee0a3a 100644
--- a/deps/v8/src/ic/call-optimization.h
+++ b/deps/v8/src/ic/call-optimization.h
@@ -17,9 +17,17 @@ class CallOptimization {
   template <class IsolateT>
   CallOptimization(IsolateT* isolate, Handle<Object> function);
 
-  Context GetAccessorContext(Map holder_map) const;
-  bool IsCrossContextLazyAccessorPair(Context native_context,
-                                      Map holder_map) const;
+  // Gets accessor context by given holder map via holder's constructor.
+  // If the holder is a remote object returns empty optional.
+  // This method must not be called for holder maps with null constructor
+  // because they can't be holders for lazy accessor pairs anyway.
+  base::Optional<NativeContext> GetAccessorContext(
+      Tagged<Map> holder_map) const;
+
+  // Return true if the accessor context for given holder doesn't match
+  // given native context of if the holder is a remote object.
+  bool IsCrossContextLazyAccessorPair(Tagged<NativeContext> native_context,
+                                      Tagged<Map> holder_map) const;
 
   bool is_constant_call() const { return !constant_function_.is_null(); }
   bool accept_any_receiver() const { return accept_any_receiver_; }
diff --git a/deps/v8/src/ic/handler-configuration-inl.h b/deps/v8/src/ic/handler-configuration-inl.h
index 679e6ea95ce161..fbdcf9f6f52389 100644
--- a/deps/v8/src/ic/handler-configuration-inl.h
+++ b/deps/v8/src/ic/handler-configuration-inl.h
@@ -25,7 +25,7 @@ OBJECT_CONSTRUCTORS_IMPL(LoadHandler, DataHandler)
 CAST_ACCESSOR(LoadHandler)
 
 // Decodes kind from Smi-handler.
-LoadHandler::Kind LoadHandler::GetHandlerKind(Smi smi_handler) {
+LoadHandler::Kind LoadHandler::GetHandlerKind(Tagged<Smi> smi_handler) {
   return KindBits::decode(smi_handler.value());
 }
 
@@ -220,7 +220,7 @@ Handle<Smi> StoreHandler::StoreProxy(Isolate* isolate) {
   return handle(StoreProxy(), isolate);
 }
 
-Smi StoreHandler::StoreProxy() {
+Tagged<Smi> StoreHandler::StoreProxy() {
   int config = KindBits::encode(Kind::kProxy);
   return Smi::FromInt(config);
 }
diff --git a/deps/v8/src/ic/handler-configuration.cc b/deps/v8/src/ic/handler-configuration.cc
index 29dd9fabf756e2..10e8bb31099d88 100644
--- a/deps/v8/src/ic/handler-configuration.cc
+++ b/deps/v8/src/ic/handler-configuration.cc
@@ -16,18 +16,18 @@ namespace internal {
 namespace {
 
 template <typename BitField>
-Handle<Smi> SetBitFieldValue(Isolate* isolate, Handle<Smi> smi_handler,
+Tagged<Smi> SetBitFieldValue(Isolate* isolate, Tagged<Smi> smi_handler,
                              typename BitField::FieldType value) {
-  int config = smi_handler->value();
+  int config = smi_handler.value();
   config = BitField::update(config, true);
-  return handle(Smi::FromInt(config), isolate);
+  return Smi::FromInt(config);
 }
 
 // TODO(ishell): Remove templatezation once we move common bits from
 // Load/StoreHandler to the base class.
 template <typename ICHandler, bool fill_handler = true>
 int InitPrototypeChecksImpl(Isolate* isolate, Handle<ICHandler> handler,
-                            Handle<Smi>* smi_handler,
+                            Tagged<Smi>* smi_handler,
                             Handle<Map> lookup_start_object_map,
                             MaybeObjectHandle data1,
                             MaybeObjectHandle maybe_data2) {
@@ -35,12 +35,12 @@ int InitPrototypeChecksImpl(Isolate* isolate, Handle<ICHandler> handler,
   // Holder-is-receiver case itself does not add entries unless there is an
   // optional data2 value provided.
 
-  DCHECK_IMPLIES(lookup_start_object_map->IsJSGlobalObjectMap(),
+  DCHECK_IMPLIES(IsJSGlobalObjectMap(*lookup_start_object_map),
                  lookup_start_object_map->is_prototype_map());
 
-  if (lookup_start_object_map->IsPrimitiveMap() ||
+  if (IsPrimitiveMap(*lookup_start_object_map) ||
       lookup_start_object_map->is_access_check_needed()) {
-    DCHECK(!lookup_start_object_map->IsJSGlobalObjectMap());
+    DCHECK(!IsJSGlobalObjectMap(*lookup_start_object_map));
     // The validity cell check for primitive and global proxy receivers does
     // not guarantee that certain native context ever had access to other
     // native context. However, a handler created for one native context could
@@ -58,7 +58,7 @@ int InitPrototypeChecksImpl(Isolate* isolate, Handle<ICHandler> handler,
     }
     data_size++;
   } else if (lookup_start_object_map->is_dictionary_map() &&
-             !lookup_start_object_map->IsJSGlobalObjectMap()) {
+             !IsJSGlobalObjectMap(*lookup_start_object_map)) {
     if (!fill_handler) {
       // Enable lookup on lookup start object.
       *smi_handler =
@@ -90,7 +90,7 @@ int InitPrototypeChecksImpl(Isolate* isolate, Handle<ICHandler> handler,
 // If the |holder| is an empty handle then the full prototype chain is
 // checked.
 template <typename ICHandler>
-int GetHandlerDataSize(Isolate* isolate, Handle<Smi>* smi_handler,
+int GetHandlerDataSize(Isolate* isolate, Tagged<Smi>* smi_handler,
                        Handle<Map> lookup_start_object_map,
                        MaybeObjectHandle data1,
                        MaybeObjectHandle maybe_data2 = MaybeObjectHandle()) {
@@ -114,7 +114,7 @@ void InitPrototypeChecks(Isolate* isolate, Handle<ICHandler> handler,
 // static
 Handle<Object> LoadHandler::LoadFromPrototype(
     Isolate* isolate, Handle<Map> lookup_start_object_map,
-    Handle<JSReceiver> holder, Handle<Smi> smi_handler,
+    Handle<JSReceiver> holder, Tagged<Smi> smi_handler,
     MaybeObjectHandle maybe_data1, MaybeObjectHandle maybe_data2) {
   MaybeObjectHandle data1;
   if (maybe_data1.is_null()) {
@@ -131,7 +131,7 @@ Handle<Object> LoadHandler::LoadFromPrototype(
 
   Handle<LoadHandler> handler = isolate->factory()->NewLoadHandler(data_size);
 
-  handler->set_smi_handler(*smi_handler);
+  handler->set_smi_handler(smi_handler);
   handler->set_validity_cell(*validity_cell);
   InitPrototypeChecks(isolate, handler, lookup_start_object_map, data1,
                       maybe_data2);
@@ -142,25 +142,26 @@ Handle<Object> LoadHandler::LoadFromPrototype(
 Handle<Object> LoadHandler::LoadFullChain(Isolate* isolate,
                                           Handle<Map> lookup_start_object_map,
                                           const MaybeObjectHandle& holder,
-                                          Handle<Smi> smi_handler) {
+                                          Handle<Smi> smi_handler_handle) {
+  Tagged<Smi> smi_handler = *smi_handler_handle;
   MaybeObjectHandle data1 = holder;
   int data_size = GetHandlerDataSize<LoadHandler>(
       isolate, &smi_handler, lookup_start_object_map, data1);
 
   Handle<Object> validity_cell = Map::GetOrCreatePrototypeChainValidityCell(
       lookup_start_object_map, isolate);
-  if (validity_cell->IsSmi()) {
+  if (IsSmi(*validity_cell)) {
     DCHECK_EQ(1, data_size);
     // Lookup on lookup start object isn't supported in case of a simple smi
     // handler.
-    if (!LookupOnLookupStartObjectBits::decode(smi_handler->value())) {
-      return smi_handler;
+    if (!LookupOnLookupStartObjectBits::decode(smi_handler.value())) {
+      return smi_handler_handle;
     }
   }
 
   Handle<LoadHandler> handler = isolate->factory()->NewLoadHandler(data_size);
 
-  handler->set_smi_handler(*smi_handler);
+  handler->set_smi_handler(smi_handler);
   handler->set_validity_cell(*validity_cell);
   InitPrototypeChecks(isolate, handler, lookup_start_object_map, data1);
   return handler;
@@ -169,7 +170,7 @@ Handle<Object> LoadHandler::LoadFullChain(Isolate* isolate,
 // static
 KeyedAccessLoadMode LoadHandler::GetKeyedAccessLoadMode(MaybeObject handler) {
   DisallowGarbageCollection no_gc;
-  if (handler->IsSmi()) {
+  if (IsSmi(handler)) {
     int const raw_handler = handler.ToSmi().value();
     Kind const kind = KindBits::decode(raw_handler);
     if ((kind == Kind::kElement || kind == Kind::kIndexedString) &&
@@ -184,7 +185,7 @@ KeyedAccessLoadMode LoadHandler::GetKeyedAccessLoadMode(MaybeObject handler) {
 KeyedAccessStoreMode StoreHandler::GetKeyedAccessStoreMode(
     MaybeObject handler) {
   DisallowGarbageCollection no_gc;
-  if (handler->IsSmi()) {
+  if (IsSmi(handler)) {
     int const raw_handler = handler.ToSmi().value();
     Kind const kind = KindBits::decode(raw_handler);
     // All the handlers except the Slow Handler that use the
@@ -228,7 +229,7 @@ MaybeObjectHandle StoreHandler::StoreOwnTransition(Isolate* isolate,
     Handle<DescriptorArray> descriptors(
         transition_map->instance_descriptors(isolate), isolate);
     PropertyDetails details = descriptors->GetDetails(descriptor);
-    if (descriptors->GetKey(descriptor).IsPrivate()) {
+    if (descriptors->GetKey(descriptor)->IsPrivate()) {
       DCHECK_EQ(DONT_ENUM, details.attributes());
     } else {
       DCHECK_EQ(NONE, details.attributes());
@@ -242,7 +243,7 @@ MaybeObjectHandle StoreHandler::StoreOwnTransition(Isolate* isolate,
 
   // StoreOwnTransition does not involve any prototype checks.
   if (is_dictionary_map) {
-    DCHECK(!transition_map->IsJSGlobalObjectMap());
+    DCHECK(!IsJSGlobalObjectMap(*transition_map));
     int config = KindBits::encode(Kind::kNormal);
     return MaybeObjectHandle(Smi::FromInt(config), isolate);
 
@@ -261,9 +262,9 @@ MaybeObjectHandle StoreHandler::StoreTransition(Isolate* isolate,
     Handle<DescriptorArray> descriptors(
         transition_map->instance_descriptors(isolate), isolate);
     // Private fields must be added via StoreOwnTransition handler.
-    DCHECK(!descriptors->GetKey(descriptor).IsPrivateName());
+    DCHECK(!descriptors->GetKey(descriptor)->IsPrivateName());
     PropertyDetails details = descriptors->GetDetails(descriptor);
-    if (descriptors->GetKey(descriptor).IsPrivate()) {
+    if (descriptors->GetKey(descriptor)->IsPrivate()) {
       DCHECK_EQ(DONT_ENUM, details.attributes());
     } else {
       DCHECK_EQ(NONE, details.attributes());
@@ -283,7 +284,7 @@ MaybeObjectHandle StoreHandler::StoreTransition(Isolate* isolate,
   }
 
   if (is_dictionary_map) {
-    DCHECK(!transition_map->IsJSGlobalObjectMap());
+    DCHECK(!IsJSGlobalObjectMap(*transition_map));
     Handle<StoreHandler> handler = isolate->factory()->NewStoreHandler(0);
     // Store normal with enabled lookup on receiver.
     int config = KindBits::encode(Kind::kNormal) |
@@ -305,7 +306,7 @@ MaybeObjectHandle StoreHandler::StoreTransition(Isolate* isolate,
 // static
 Handle<Object> StoreHandler::StoreThroughPrototype(
     Isolate* isolate, Handle<Map> receiver_map, Handle<JSReceiver> holder,
-    Handle<Smi> smi_handler, MaybeObjectHandle maybe_data1,
+    Tagged<Smi> smi_handler, MaybeObjectHandle maybe_data1,
     MaybeObjectHandle maybe_data2) {
   MaybeObjectHandle data1;
   if (maybe_data1.is_null()) {
@@ -322,7 +323,7 @@ Handle<Object> StoreHandler::StoreThroughPrototype(
 
   Handle<StoreHandler> handler = isolate->factory()->NewStoreHandler(data_size);
 
-  handler->set_smi_handler(*smi_handler);
+  handler->set_smi_handler(smi_handler);
   handler->set_validity_cell(*validity_cell);
   InitPrototypeChecks(isolate, handler, receiver_map, data1, maybe_data2);
   return handler;
@@ -340,17 +341,17 @@ Handle<Object> StoreHandler::StoreProxy(Isolate* isolate,
                                         Handle<JSReceiver> receiver) {
   Handle<Smi> smi_handler = StoreProxy(isolate);
   if (receiver.is_identical_to(proxy)) return smi_handler;
-  return StoreThroughPrototype(isolate, receiver_map, proxy, smi_handler,
+  return StoreThroughPrototype(isolate, receiver_map, proxy, *smi_handler,
                                MaybeObjectHandle::Weak(proxy));
 }
 
-bool LoadHandler::CanHandleHolderNotLookupStart(Object handler) {
-  if (handler.IsSmi()) {
+bool LoadHandler::CanHandleHolderNotLookupStart(Tagged<Object> handler) {
+  if (IsSmi(handler)) {
     auto kind = LoadHandler::KindBits::decode(handler.ToSmi().value());
     return kind == LoadHandler::Kind::kSlow ||
            kind == LoadHandler::Kind::kNonExistent;
   }
-  return handler.IsLoadHandler();
+  return IsLoadHandler(handler);
 }
 
 #if defined(OBJECT_PRINT)
@@ -519,85 +520,88 @@ void PrintSmiStoreHandler(int raw_handler, std::ostream& os) {
 }  // namespace
 
 // static
-void LoadHandler::PrintHandler(Object handler, std::ostream& os) {
+void LoadHandler::PrintHandler(Tagged<Object> handler, std::ostream& os) {
   DisallowGarbageCollection no_gc;
-  if (handler.IsSmi()) {
+  if (IsSmi(handler)) {
     int raw_handler = handler.ToSmi().value();
     os << "LoadHandler(Smi)(";
     PrintSmiLoadHandler(raw_handler, os);
     os << ")";
-  } else if (handler.IsCode()) {
+  } else if (IsCode(handler)) {
     os << "LoadHandler(Code)("
-       << Builtins::name(Code::cast(handler).builtin_id()) << ")";
-  } else if (handler.IsSymbol()) {
+       << Builtins::name(Code::cast(handler)->builtin_id()) << ")";
+  } else if (IsSymbol(handler)) {
     os << "LoadHandler(Symbol)(" << Brief(Symbol::cast(handler)) << ")";
-  } else if (handler.IsLoadHandler()) {
+  } else if (IsLoadHandler(handler)) {
     LoadHandler load_handler = LoadHandler::cast(handler);
-    int raw_handler = load_handler.smi_handler().ToSmi().value();
+    int raw_handler = Smi::cast(load_handler->smi_handler()).value();
     os << "LoadHandler(do access check on lookup start object = "
        << DoAccessCheckOnLookupStartObjectBits::decode(raw_handler)
        << ", lookup on lookup start object = "
        << LookupOnLookupStartObjectBits::decode(raw_handler) << ", ";
     PrintSmiLoadHandler(raw_handler, os);
-    if (load_handler.data_field_count() >= 1) {
+    if (load_handler->data_field_count() >= 1) {
       os << ", data1 = ";
-      load_handler.data1().ShortPrint(os);
+      ShortPrint(load_handler->data1(), os);
     }
-    if (load_handler.data_field_count() >= 2) {
+    if (load_handler->data_field_count() >= 2) {
       os << ", data2 = ";
-      load_handler.data2().ShortPrint(os);
+      ShortPrint(load_handler->data2(), os);
     }
-    if (load_handler.data_field_count() >= 3) {
+    if (load_handler->data_field_count() >= 3) {
       os << ", data3 = ";
-      load_handler.data3().ShortPrint(os);
+      ShortPrint(load_handler->data3(), os);
     }
     os << ", validity cell = ";
-    load_handler.validity_cell().ShortPrint(os);
+    ShortPrint(load_handler->validity_cell(), os);
     os << ")";
   } else {
     os << "LoadHandler(<unexpected>)(" << Brief(handler) << ")";
   }
 }
 
-void StoreHandler::PrintHandler(Object handler, std::ostream& os) {
+void StoreHandler::PrintHandler(Tagged<Object> handler, std::ostream& os) {
   DisallowGarbageCollection no_gc;
-  if (handler.IsSmi()) {
+  if (IsSmi(handler)) {
     int raw_handler = handler.ToSmi().value();
     os << "StoreHandler(Smi)(";
     PrintSmiStoreHandler(raw_handler, os);
     os << ")" << std::endl;
-  } else if (handler.IsStoreHandler()) {
+  } else if (IsStoreHandler(handler)) {
     os << "StoreHandler(";
     StoreHandler store_handler = StoreHandler::cast(handler);
-    if (store_handler.smi_handler().IsCode()) {
-      Code code = Code::cast(store_handler.smi_handler());
+    if (IsCode(store_handler->smi_handler())) {
+      Code code = Code::cast(store_handler->smi_handler());
       os << "builtin = ";
-      code.ShortPrint(os);
+      ShortPrint(code, os);
     } else {
-      int raw_handler = store_handler.smi_handler().ToSmi().value();
+      int raw_handler = Smi::cast(store_handler->smi_handler()).value();
       os << "do access check on lookup start object = "
          << DoAccessCheckOnLookupStartObjectBits::decode(raw_handler)
          << ", lookup on lookup start object = "
          << LookupOnLookupStartObjectBits::decode(raw_handler) << ", ";
       PrintSmiStoreHandler(raw_handler, os);
     }
-    if (store_handler.data_field_count() >= 1) {
+    if (store_handler->data_field_count() >= 1) {
       os << ", data1 = ";
-      store_handler.data1().ShortPrint(os);
+      ShortPrint(store_handler->data1(), os);
     }
-    if (store_handler.data_field_count() >= 2) {
+    if (store_handler->data_field_count() >= 2) {
       os << ", data2 = ";
-      store_handler.data2().ShortPrint(os);
+      ShortPrint(store_handler->data2(), os);
     }
-    if (store_handler.data_field_count() >= 3) {
+    if (store_handler->data_field_count() >= 3) {
       os << ", data3 = ";
-      store_handler.data3().ShortPrint(os);
+      ShortPrint(store_handler->data3(), os);
     }
     os << ", validity cell = ";
-    store_handler.validity_cell().ShortPrint(os);
+    ShortPrint(store_handler->validity_cell(), os);
     os << ")" << std::endl;
+  } else if (IsMap(handler)) {
+    os << "StoreHandler(field transition to " << Brief(handler) << ")"
+       << std::endl;
   } else {
-    os << "StoreHandler(<unexpected>)(" << Brief(handler) << ")";
+    os << "StoreHandler(<unexpected>)(" << Brief(handler) << ")" << std::endl;
   }
 }
 
diff --git a/deps/v8/src/ic/handler-configuration.h b/deps/v8/src/ic/handler-configuration.h
index a7bc14be0f6318..7f5b4d09aebc98 100644
--- a/deps/v8/src/ic/handler-configuration.h
+++ b/deps/v8/src/ic/handler-configuration.h
@@ -148,7 +148,7 @@ class LoadHandler final : public DataHandler {
   static_assert(ExportsIndexBits::kLastUsedBit < kSmiValueSize);
 
   // Decodes kind from Smi-handler.
-  static inline Kind GetHandlerKind(Smi smi_handler);
+  static inline Kind GetHandlerKind(Tagged<Smi> smi_handler);
 
   // Creates a Smi-handler for loading a property from a slow object.
   static inline Handle<Smi> LoadNormal(Isolate* isolate);
@@ -206,7 +206,7 @@ class LoadHandler final : public DataHandler {
   // by given Smi-handler that encoded a load from the holder.
   static Handle<Object> LoadFromPrototype(
       Isolate* isolate, Handle<Map> receiver_map, Handle<JSReceiver> holder,
-      Handle<Smi> smi_handler,
+      Tagged<Smi> smi_handler,
       MaybeObjectHandle maybe_data1 = MaybeObjectHandle(),
       MaybeObjectHandle maybe_data2 = MaybeObjectHandle());
 
@@ -230,10 +230,10 @@ class LoadHandler final : public DataHandler {
 
   // Returns true iff the handler can be used in the "holder != lookup start
   // object" case.
-  static bool CanHandleHolderNotLookupStart(Object handler);
+  static bool CanHandleHolderNotLookupStart(Tagged<Object> handler);
 
 #if defined(OBJECT_PRINT)
-  static void PrintHandler(Object handler, std::ostream& os);
+  static void PrintHandler(Tagged<Object> handler, std::ostream& os);
 #endif  // defined(OBJECT_PRINT)
 
   OBJECT_CONSTRUCTORS(LoadHandler, DataHandler);
@@ -332,7 +332,7 @@ class StoreHandler final : public DataHandler {
 
   static Handle<Object> StoreThroughPrototype(
       Isolate* isolate, Handle<Map> receiver_map, Handle<JSReceiver> holder,
-      Handle<Smi> smi_handler,
+      Tagged<Smi> smi_handler,
       MaybeObjectHandle maybe_data1 = MaybeObjectHandle(),
       MaybeObjectHandle maybe_data2 = MaybeObjectHandle());
 
@@ -371,13 +371,13 @@ class StoreHandler final : public DataHandler {
 
   // Creates a Smi-handler for storing a property on a proxy.
   static inline Handle<Smi> StoreProxy(Isolate* isolate);
-  static inline Smi StoreProxy();
+  static inline Tagged<Smi> StoreProxy();
 
   // Decodes the KeyedAccessStoreMode from a {handler}.
   static KeyedAccessStoreMode GetKeyedAccessStoreMode(MaybeObject handler);
 
 #if defined(OBJECT_PRINT)
-  static void PrintHandler(Object handler, std::ostream& os);
+  static void PrintHandler(Tagged<Object> handler, std::ostream& os);
 #endif  // defined(OBJECT_PRINT)
 
  private:
diff --git a/deps/v8/src/ic/ic-inl.h b/deps/v8/src/ic/ic-inl.h
index eb62f8972638db..45b5b7427c9002 100644
--- a/deps/v8/src/ic/ic-inl.h
+++ b/deps/v8/src/ic/ic-inl.h
@@ -17,22 +17,22 @@ namespace v8 {
 namespace internal {
 
 void IC::update_lookup_start_object_map(Handle<Object> object) {
-  if (object->IsSmi()) {
+  if (IsSmi(*object)) {
     lookup_start_object_map_ = isolate_->factory()->heap_number_map();
   } else {
     lookup_start_object_map_ =
-        handle(HeapObject::cast(*object).map(), isolate_);
+        handle(HeapObject::cast(*object)->map(), isolate_);
   }
 }
 
 bool IC::IsHandler(MaybeObject object) {
-  HeapObject heap_object;
-  return (object->IsSmi() && (object.ptr() != kNullAddress)) ||
-         (object->GetHeapObjectIfWeak(&heap_object) &&
-          (heap_object.IsMap() || heap_object.IsPropertyCell() ||
-           heap_object.IsAccessorPair())) ||
-         (object->GetHeapObjectIfStrong(&heap_object) &&
-          (heap_object.IsDataHandler() || heap_object.IsCode()));
+  Tagged<HeapObject> heap_object;
+  return (IsSmi(object) && (object.ptr() != kNullAddress)) ||
+         (object.GetHeapObjectIfWeak(&heap_object) &&
+          (IsMap(heap_object) || IsPropertyCell(heap_object) ||
+           IsAccessorPair(heap_object))) ||
+         (object.GetHeapObjectIfStrong(&heap_object) &&
+          (IsDataHandler(heap_object) || IsCode(heap_object)));
 }
 
 bool IC::vector_needs_update() {
diff --git a/deps/v8/src/ic/ic-stats.cc b/deps/v8/src/ic/ic-stats.cc
index 1f86f9724dae70..fd3c1c838e9bcf 100644
--- a/deps/v8/src/ic/ic-stats.cc
+++ b/deps/v8/src/ic/ic-stats.cc
@@ -54,16 +54,16 @@ void ICStats::Dump() {
   Reset();
 }
 
-const char* ICStats::GetOrCacheScriptName(Script script) {
+const char* ICStats::GetOrCacheScriptName(Tagged<Script> script) {
   Address script_ptr = script.ptr();
   if (script_name_map_.find(script_ptr) != script_name_map_.end()) {
     return script_name_map_[script_ptr].get();
   }
-  Object script_name_raw = script.name();
-  if (script_name_raw.IsString()) {
-    String script_name = String::cast(script_name_raw);
+  Tagged<Object> script_name_raw = script->name();
+  if (IsString(script_name_raw)) {
+    Tagged<String> script_name = String::cast(script_name_raw);
     char* c_script_name =
-        script_name.ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL)
+        script_name->ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL)
             .release();
     script_name_map_.insert(
         std::make_pair(script_ptr, std::unique_ptr<char[]>(c_script_name)));
@@ -74,14 +74,14 @@ const char* ICStats::GetOrCacheScriptName(Script script) {
   return nullptr;
 }
 
-const char* ICStats::GetOrCacheFunctionName(JSFunction function) {
+const char* ICStats::GetOrCacheFunctionName(Tagged<JSFunction> function) {
   Address function_ptr = function.ptr();
   // Lookup the function name or add a null unique_ptr if no entry exists.
   std::unique_ptr<char[]>& function_name = function_name_map_[function_ptr];
   if (!function_name) {
-    ic_infos_[pos_].is_optimized = function.HasAttachedOptimizedCode();
+    ic_infos_[pos_].is_optimized = function->HasAttachedOptimizedCode();
     // Update the map entry with the actual debug name.
-    function_name = function.shared().DebugNameCStr();
+    function_name = function->shared()->DebugNameCStr();
   }
   return function_name.get();
 }
diff --git a/deps/v8/src/ic/ic-stats.h b/deps/v8/src/ic/ic-stats.h
index fa7c7af464f413..cdabf351893e4c 100644
--- a/deps/v8/src/ic/ic-stats.h
+++ b/deps/v8/src/ic/ic-stats.h
@@ -24,6 +24,8 @@ namespace internal {
 
 class JSFunction;
 class Script;
+template <typename T>
+class Tagged;
 
 struct ICInfo {
   ICInfo();
@@ -60,8 +62,8 @@ class ICStats {
     DCHECK(pos_ >= 0 && pos_ < MAX_IC_INFO);
     return ic_infos_[pos_];
   }
-  const char* GetOrCacheScriptName(Script script);
-  const char* GetOrCacheFunctionName(JSFunction function);
+  const char* GetOrCacheScriptName(Tagged<Script> script);
+  const char* GetOrCacheFunctionName(Tagged<JSFunction> function);
   V8_INLINE static ICStats* instance() { return instance_.Pointer(); }
 
  private:
diff --git a/deps/v8/src/ic/ic.cc b/deps/v8/src/ic/ic.cc
index 9b1a82eab3f33a..98af9536effafa 100644
--- a/deps/v8/src/ic/ic.cc
+++ b/deps/v8/src/ic/ic.cc
@@ -142,7 +142,7 @@ void IC::TraceIC(const char* type, Handle<Object> name, State old_state,
   JavaScriptFrame* frame = it.frame();
 
   DisallowGarbageCollection no_gc;
-  JSFunction function = frame->function();
+  Tagged<JSFunction> function = frame->function();
 
   ICStats::instance()->Begin();
   ICInfo& ic_info = ICStats::instance()->Current();
@@ -150,16 +150,16 @@ void IC::TraceIC(const char* type, Handle<Object> name, State old_state,
   ic_info.type += type;
 
   int code_offset = 0;
-  AbstractCode code = function.abstract_code(isolate_);
-  if (function.ActiveTierIsIgnition()) {
+  Tagged<AbstractCode> code = function->abstract_code(isolate_);
+  if (function->ActiveTierIsIgnition()) {
     code_offset = InterpretedFrame::GetBytecodeOffset(frame->fp());
-  } else if (function.ActiveTierIsBaseline()) {
+  } else if (function->ActiveTierIsBaseline()) {
     // TODO(pthier): AbstractCode should fully support Baseline code.
     BaselineFrame* baseline_frame = BaselineFrame::cast(frame);
     code_offset = baseline_frame->GetBytecodeOffset();
     code = AbstractCode::cast(baseline_frame->GetBytecodeArray());
   } else {
-    code_offset = static_cast<int>(frame->pc() - function.code_entry_point());
+    code_offset = static_cast<int>(frame->pc() - function->instruction_start());
   }
   JavaScriptFrame::CollectFunctionAndOffsetForICStats(function, code,
                                                       code_offset);
@@ -209,19 +209,22 @@ static void LookupForRead(LookupIterator* it, bool is_has_property) {
       case LookupIterator::INTERCEPTOR: {
         // If there is a getter, return; otherwise loop to perform the lookup.
         Handle<JSObject> holder = it->GetHolder<JSObject>();
-        if (!holder->GetNamedInterceptor().getter().IsUndefined(
-                it->isolate())) {
+        if (!IsUndefined(holder->GetNamedInterceptor()->getter(),
+                         it->isolate())) {
           return;
         }
         if (is_has_property &&
-            !holder->GetNamedInterceptor().query().IsUndefined(it->isolate())) {
+            !IsUndefined(holder->GetNamedInterceptor()->query(),
+                         it->isolate())) {
           return;
         }
         break;
       }
       case LookupIterator::ACCESS_CHECK:
         // ICs know how to perform access checks on global proxies.
-        if (it->GetHolder<JSObject>()->IsJSGlobalProxy() && it->HasAccess()) {
+        if (it->GetHolder<JSObject>().is_identical_to(
+                it->isolate()->global_proxy()) &&
+            !it->isolate()->global_object()->IsDetached()) {
           break;
         }
         return;
@@ -249,8 +252,8 @@ bool IC::ShouldRecomputeHandler(Handle<String> name) {
   // TODO(verwaest): Check if the current map is actually what the old map
   // would transition to.
   if (maybe_handler.is_null()) {
-    if (!lookup_start_object_map()->IsJSObjectMap()) return false;
-    Map first_map = FirstTargetMap();
+    if (!IsJSObjectMap(*lookup_start_object_map())) return false;
+    Tagged<Map> first_map = FirstTargetMap();
     if (first_map.is_null()) return false;
     Handle<Map> old_map(first_map, isolate());
     if (old_map->is_deprecated()) return true;
@@ -264,8 +267,8 @@ bool IC::ShouldRecomputeHandler(Handle<String> name) {
 bool IC::RecomputeHandlerForName(Handle<Object> name) {
   if (is_keyed()) {
     // Determine whether the failure is due to a name failure.
-    if (!name->IsName()) return false;
-    Name stub_name = nexus()->GetName();
+    if (!IsName(*name)) return false;
+    Tagged<Name> stub_name = nexus()->GetName();
     if (*name != stub_name) return false;
   }
 
@@ -275,9 +278,9 @@ bool IC::RecomputeHandlerForName(Handle<Object> name) {
 void IC::UpdateState(Handle<Object> lookup_start_object, Handle<Object> name) {
   if (state() == NO_FEEDBACK) return;
   update_lookup_start_object_map(lookup_start_object);
-  if (!name->IsString()) return;
+  if (!IsString(*name)) return;
   if (state() != MONOMORPHIC && state() != POLYMORPHIC) return;
-  if (lookup_start_object->IsNullOrUndefined(isolate())) return;
+  if (IsNullOrUndefined(*lookup_start_object, isolate())) return;
 
   // Remove the target from the code cache if it became invalid
   // because of changes in the prototype chain to avoid hitting it
@@ -301,42 +304,29 @@ MaybeHandle<Object> IC::ReferenceError(Handle<Name> name) {
 
 void IC::OnFeedbackChanged(const char* reason) {
   vector_set_ = true;
-  FeedbackVector vector = nexus()->vector();
+  Tagged<FeedbackVector> vector = nexus()->vector();
   FeedbackSlot slot = nexus()->slot();
   OnFeedbackChanged(isolate(), vector, slot, reason);
 }
 
 // static
-void IC::OnFeedbackChanged(Isolate* isolate, FeedbackVector vector,
+void IC::OnFeedbackChanged(Isolate* isolate, Tagged<FeedbackVector> vector,
                            FeedbackSlot slot, const char* reason) {
-  if (v8_flags.reset_ticks_on_ic_update) {
-    if (v8_flags.trace_opt_verbose) {
-      if (vector.profiler_ticks() != 0) {
-        StdoutStream os;
-        os << "[resetting ticks for ";
-        vector.shared_function_info().ShortPrint(os);
-        os << " from " << vector.profiler_ticks()
-           << " due to IC change: " << reason << "]" << std::endl;
-      }
-    }
-    vector.set_profiler_ticks(0);
-  }
-
 #ifdef V8_TRACE_FEEDBACK_UPDATES
   if (v8_flags.trace_feedback_updates) {
-    int slot_count = vector.metadata().slot_count();
+    int slot_count = vector->metadata()->slot_count();
     StdoutStream os;
     if (slot.IsInvalid()) {
       os << "[Feedback slots in ";
     } else {
       os << "[Feedback slot " << slot.ToInt() << "/" << slot_count << " in ";
     }
-    vector.shared_function_info().ShortPrint(os);
+    ShortPrint(vector->shared_function_info(), os);
     if (slot.IsInvalid()) {
       os << " updated - ";
     } else {
       os << " updated to ";
-      vector.FeedbackSlotPrint(os, slot);
+      vector->FeedbackSlotPrint(os, slot);
       os << " - ";
     }
     os << reason << "]" << std::endl;
@@ -349,9 +339,9 @@ void IC::OnFeedbackChanged(Isolate* isolate, FeedbackVector vector,
 namespace {
 
 bool MigrateDeprecated(Isolate* isolate, Handle<Object> object) {
-  if (!object->IsJSObject()) return false;
+  if (!IsJSObject(*object)) return false;
   Handle<JSObject> receiver = Handle<JSObject>::cast(object);
-  if (!receiver->map().is_deprecated()) return false;
+  if (!receiver->map()->is_deprecated()) return false;
   JSObject::MigrateInstance(isolate, receiver);
   return true;
 }
@@ -360,13 +350,12 @@ bool MigrateDeprecated(Isolate* isolate, Handle<Object> object) {
 
 bool IC::ConfigureVectorState(IC::State new_state, Handle<Object> key) {
   DCHECK_EQ(MEGAMORPHIC, new_state);
-  DCHECK_IMPLIES(!is_keyed(), key->IsName());
-  // Even though we don't change the feedback data, we still want to reset the
-  // profiler ticks. Real-world observations suggest that optimizing these
-  // functions doesn't improve performance.
+  DCHECK_IMPLIES(!is_keyed(), IsName(*key));
   bool changed = nexus()->ConfigureMegamorphic(
-      key->IsName() ? IcCheckType::kProperty : IcCheckType::kElement);
-  OnFeedbackChanged("Megamorphic");
+      IsName(*key) ? IcCheckType::kProperty : IcCheckType::kElement);
+  if (changed) {
+    OnFeedbackChanged("Megamorphic");
+  }
   return changed;
 }
 
@@ -420,8 +409,8 @@ MaybeHandle<Object> LoadIC::Load(Handle<Object> object, Handle<Name> name,
 
   // If the object is undefined or null it's illegal to try to get any
   // of its properties; throw a TypeError in that case.
-  if (IsAnyHas() ? !object->IsJSReceiver()
-                 : object->IsNullOrUndefined(isolate())) {
+  if (IsAnyHas() ? !IsJSReceiver(*object)
+                 : IsNullOrUndefined(*object, isolate())) {
     if (use_ic) {
       // Ensure the IC state progresses.
       TRACE_HANDLER_STATS(isolate(), LoadIC_NonReceiver);
@@ -438,7 +427,7 @@ MaybeHandle<Object> LoadIC::Load(Handle<Object> object, Handle<Name> name,
     if (IsAnyHas()) {
       return TypeError(MessageTemplate::kInvalidInOperatorUse, object, name);
     } else {
-      DCHECK(object->IsNullOrUndefined(isolate()));
+      DCHECK(IsNullOrUndefined(*object, isolate()));
       ErrorUtils::ThrowLoadFromNullOrUndefined(isolate(), object, name);
       return MaybeHandle<Object>();
     }
@@ -461,30 +450,6 @@ MaybeHandle<Object> LoadIC::Load(Handle<Object> object, Handle<Name> name,
   // Named lookup in the object.
   LookupForRead(&it, IsAnyHas());
 
-  if (name->IsPrivate()) {
-    Handle<Symbol> private_symbol = Handle<Symbol>::cast(name);
-    if (!IsAnyHas() && private_symbol->is_private_name() && !it.IsFound()) {
-      Handle<String> name_string(String::cast(private_symbol->description()),
-                                 isolate());
-      if (private_symbol->is_private_brand()) {
-        Handle<String> class_name =
-            (name_string->length() == 0)
-                ? isolate()->factory()->anonymous_string()
-                : name_string;
-        return TypeError(MessageTemplate::kInvalidPrivateBrandInstance, object,
-                         class_name);
-      }
-      return TypeError(MessageTemplate::kInvalidPrivateMemberRead, object,
-                       name_string);
-    }
-
-    // IC handling of private symbols/fields lookup on JSProxy is not
-    // supported.
-    if (object->IsJSProxy()) {
-      use_ic = false;
-    }
-  }
-
   if (it.IsFound() || !ShouldThrowReferenceError()) {
     // Update inline cache and stub cache.
     if (use_ic) {
@@ -499,8 +464,7 @@ MaybeHandle<Object> LoadIC::Load(Handle<Object> object, Handle<Name> name,
       // Named lookup in the object.
       Maybe<bool> maybe = JSReceiver::HasProperty(&it);
       if (maybe.IsNothing()) return MaybeHandle<Object>();
-      return maybe.FromJust() ? ReadOnlyRoots(isolate()).true_value_handle()
-                              : ReadOnlyRoots(isolate()).false_value_handle();
+      return isolate()->factory()->ToBoolean(maybe.FromJust());
     }
 
     // Get the property.
@@ -521,11 +485,11 @@ MaybeHandle<Object> LoadGlobalIC::Load(Handle<Name> name,
                                        bool update_feedback) {
   Handle<JSGlobalObject> global = isolate()->global_object();
 
-  if (name->IsString()) {
+  if (IsString(*name)) {
     // Look up in script context table.
     Handle<String> str_name = Handle<String>::cast(name);
     Handle<ScriptContextTable> script_contexts(
-        global->native_context().script_context_table(), isolate());
+        global->native_context()->script_context_table(), isolate());
 
     VariableLookupResult lookup_result;
     if (script_contexts->Lookup(str_name, &lookup_result)) {
@@ -535,7 +499,7 @@ MaybeHandle<Object> LoadGlobalIC::Load(Handle<Name> name,
       Handle<Object> result(script_context->get(lookup_result.slot_index),
                             isolate());
 
-      if (result->IsTheHole(isolate())) {
+      if (IsTheHole(*result, isolate())) {
         // Do not install stubs and stay pre-monomorphic for
         // uninitialized accesses.
         THROW_NEW_ERROR(
@@ -570,8 +534,10 @@ MaybeHandle<Object> LoadGlobalIC::Load(Handle<Name> name,
   return LoadIC::Load(global, name, update_feedback);
 }
 
-static bool AddOneReceiverMapIfMissing(MapHandles* receiver_maps,
-                                       Handle<Map> new_receiver_map) {
+namespace {
+
+bool AddOneReceiverMapIfMissing(MapHandles* receiver_maps,
+                                Handle<Map> new_receiver_map) {
   DCHECK(!new_receiver_map.is_null());
   for (Handle<Map> map : *receiver_maps) {
     if (!map.is_null() && map.is_identical_to(new_receiver_map)) {
@@ -582,7 +548,7 @@ static bool AddOneReceiverMapIfMissing(MapHandles* receiver_maps,
   return true;
 }
 
-static bool AddOneReceiverMapIfMissing(
+bool AddOneReceiverMapIfMissing(
     std::vector<MapAndHandler>* receiver_maps_and_handlers,
     Handle<Map> new_receiver_map) {
   DCHECK(!new_receiver_map.is_null());
@@ -598,6 +564,19 @@ static bool AddOneReceiverMapIfMissing(
   return true;
 }
 
+Handle<NativeContext> GetAccessorContext(
+    const CallOptimization& call_optimization, Tagged<Map> holder_map,
+    Isolate* isolate) {
+  base::Optional<NativeContext> maybe_context =
+      call_optimization.GetAccessorContext(holder_map);
+
+  // Holders which are remote objects are not expected in the IC system.
+  CHECK(maybe_context.has_value());
+  return handle(maybe_context.value(), isolate);
+}
+
+}  // namespace
+
 bool IC::UpdateMegaDOMIC(const MaybeObjectHandle& handler, Handle<Name> name) {
   if (!v8_flags.mega_dom_ic) return false;
 
@@ -637,12 +616,12 @@ bool IC::UpdateMegaDOMIC(const MaybeObjectHandle& handler, Handle<Name> name) {
   call_optimization.LookupHolderOfExpectedType(isolate(), map, &holder_lookup);
   if (holder_lookup != CallOptimization::kHolderIsReceiver) return false;
 
-  Handle<Context> accessor_context(call_optimization.GetAccessorContext(*map),
-                                   isolate());
+  Handle<NativeContext> accessor_context =
+      GetAccessorContext(call_optimization, *map, isolate());
 
   Handle<FunctionTemplateInfo> fti;
-  if (accessor_obj->IsJSFunction()) {
-    fti = handle(JSFunction::cast(*accessor_obj).shared().get_api_func_data(),
+  if (IsJSFunction(*accessor_obj)) {
+    fti = handle(JSFunction::cast(*accessor_obj)->shared()->api_func_data(),
                  isolate());
   } else {
     fti = Handle<FunctionTemplateInfo>::cast(accessor_obj);
@@ -710,8 +689,12 @@ bool IC::UpdatePolymorphicIC(Handle<Name> name,
   int number_of_valid_maps =
       number_of_maps - deprecated_maps - (handler_to_overwrite != -1);
 
-  if (number_of_valid_maps >= v8_flags.max_valid_polymorphic_map_count)
+  if (number_of_valid_maps >= v8_flags.max_valid_polymorphic_map_count) {
+    return false;
+  }
+  if (deprecated_maps >= v8_flags.max_valid_polymorphic_map_count) {
     return false;
+  }
   if (number_of_maps == 0 && state() != MONOMORPHIC && state() != POLYMORPHIC) {
     return false;
   }
@@ -751,18 +734,19 @@ void IC::CopyICToMegamorphicCache(Handle<Name> name) {
   }
 }
 
-bool IC::IsTransitionOfMonomorphicTarget(Map source_map, Map target_map) {
+bool IC::IsTransitionOfMonomorphicTarget(Tagged<Map> source_map,
+                                         Tagged<Map> target_map) {
   if (source_map.is_null()) return true;
   if (target_map.is_null()) return false;
-  if (source_map.is_abandoned_prototype_map()) return false;
-  ElementsKind target_elements_kind = target_map.elements_kind();
+  if (source_map->is_abandoned_prototype_map()) return false;
+  ElementsKind target_elements_kind = target_map->elements_kind();
   bool more_general_transition = IsMoreGeneralElementsKindTransition(
-      source_map.elements_kind(), target_elements_kind);
-  Map transitioned_map;
+      source_map->elements_kind(), target_elements_kind);
+  Tagged<Map> transitioned_map;
   if (more_general_transition) {
     MapHandles map_list;
     map_list.push_back(handle(target_map, isolate_));
-    transitioned_map = source_map.FindElementsKindTransitionedMap(
+    transitioned_map = source_map->FindElementsKindTransitionedMap(
         isolate(), map_list, ConcurrencyMode::kSynchronous);
   }
   return transitioned_map == target_map;
@@ -814,11 +798,15 @@ void LoadIC::UpdateCaches(LookupIterator* lookup) {
   if (lookup->state() == LookupIterator::ACCESS_CHECK) {
     handler = MaybeObjectHandle(LoadHandler::LoadSlow(isolate()));
   } else if (!lookup->IsFound()) {
-    TRACE_HANDLER_STATS(isolate(), LoadIC_LoadNonexistentDH);
-    Handle<Smi> smi_handler = LoadHandler::LoadNonExistent(isolate());
-    handler = MaybeObjectHandle(LoadHandler::LoadFullChain(
-        isolate(), lookup_start_object_map(),
-        MaybeObjectHandle(isolate()->factory()->null_value()), smi_handler));
+    if (lookup->IsPrivateName()) {
+      handler = MaybeObjectHandle(LoadHandler::LoadSlow(isolate()));
+    } else {
+      TRACE_HANDLER_STATS(isolate(), LoadIC_LoadNonexistentDH);
+      Handle<Smi> smi_handler = LoadHandler::LoadNonExistent(isolate());
+      handler = MaybeObjectHandle(LoadHandler::LoadFullChain(
+          isolate(), lookup_start_object_map(),
+          MaybeObjectHandle(isolate()->factory()->null_value()), smi_handler));
+    }
   } else if (IsLoadGlobalIC() && lookup->state() == LookupIterator::JSPROXY) {
     // If there is proxy just install the slow stub since we need to call the
     // HasProperty trap for global loads. The ProxyGetProperty builtin doesn't
@@ -831,7 +819,7 @@ void LoadIC::UpdateCaches(LookupIterator* lookup) {
       }
       if (lookup->state() == LookupIterator::DATA &&
           lookup->GetReceiver().is_identical_to(lookup->GetHolder<Object>())) {
-        DCHECK(lookup->GetReceiver()->IsJSGlobalObject());
+        DCHECK(IsJSGlobalObject(*lookup->GetReceiver()));
         // Now update the cell in the feedback vector.
         nexus()->ConfigurePropertyCellMode(lookup->GetPropertyCell());
         TraceIC("LoadGlobalIC", lookup->name());
@@ -842,7 +830,7 @@ void LoadIC::UpdateCaches(LookupIterator* lookup) {
     auto holder = lookup->GetHolder<Object>();
     CHECK(*holder == *(lookup->lookup_start_object()) ||
           LoadHandler::CanHandleHolderNotLookupStart(*handler.object()) ||
-          holder->IsJSPrimitiveWrapper());
+          IsJSPrimitiveWrapper(*holder));
   }
   // Can't use {lookup->name()} because the LookupIterator might be in
   // "elements" mode for keys that are strings representing integers above
@@ -880,13 +868,13 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
   // wrapper length and function prototypes. The latter two cases are given
   // LoadHandler::LoadNativeDataProperty below.
   if (!IsAnyHas() && !lookup->IsElement()) {
-    if (lookup_start_object->IsString() &&
+    if (IsString(*lookup_start_object) &&
         *lookup->name() == roots.length_string()) {
       TRACE_HANDLER_STATS(isolate(), LoadIC_StringLength);
       return MaybeObjectHandle(BUILTIN_CODE(isolate(), LoadIC_StringLength));
     }
 
-    if (lookup_start_object->IsStringWrapper() &&
+    if (IsStringWrapper(*lookup_start_object) &&
         *lookup->name() == roots.length_string()) {
       TRACE_HANDLER_STATS(isolate(), LoadIC_StringWrapperLength);
       return MaybeObjectHandle(
@@ -894,10 +882,10 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
     }
 
     // Use specialized code for getting prototype of functions.
-    if (lookup_start_object->IsJSFunction() &&
+    if (IsJSFunction(*lookup_start_object) &&
         *lookup->name() == roots.prototype_string() &&
         !JSFunction::cast(*lookup_start_object)
-             .PrototypeRequiresRuntimeLookup()) {
+             ->PrototypeRequiresRuntimeLookup()) {
       TRACE_HANDLER_STATS(isolate(), LoadIC_FunctionPrototypeStub);
       return MaybeObjectHandle(
           BUILTIN_CODE(isolate(), LoadIC_FunctionPrototype));
@@ -913,7 +901,7 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
       Handle<JSObject> holder = lookup->GetHolder<JSObject>();
       Handle<Smi> smi_handler = LoadHandler::LoadInterceptor(isolate());
 
-      if (holder->GetNamedInterceptor().non_masking()) {
+      if (holder->GetNamedInterceptor()->non_masking()) {
         MaybeObjectHandle holder_ref(isolate()->factory()->null_value());
         if (!holder_is_lookup_start_object || IsLoadGlobalIC()) {
           holder_ref = MaybeObjectHandle::Weak(holder);
@@ -931,7 +919,7 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
 
       TRACE_HANDLER_STATS(isolate(), LoadIC_LoadInterceptorFromPrototypeDH);
       return MaybeObjectHandle(
-          LoadHandler::LoadFromPrototype(isolate(), map, holder, smi_handler));
+          LoadHandler::LoadFromPrototype(isolate(), map, holder, *smi_handler));
     }
 
     case LookupIterator::ACCESSOR: {
@@ -946,13 +934,13 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
         return MaybeObjectHandle(
             LoadHandler::LoadField(isolate(), field_index));
       }
-      if (holder->IsJSModuleNamespace()) {
+      if (IsJSModuleNamespace(*holder)) {
         Handle<ObjectHashTable> exports(
-            Handle<JSModuleNamespace>::cast(holder)->module().exports(),
+            Handle<JSModuleNamespace>::cast(holder)->module()->exports(),
             isolate());
         InternalIndex entry =
             exports->FindEntry(isolate(), roots, lookup->name(),
-                               Smi::ToInt(lookup->name()->GetHash()));
+                               Smi::ToInt(Object::GetHash(*lookup->name())));
         // We found the accessor, so the entry must exist.
         DCHECK(entry.is_found());
         int value_index = ObjectHashTable::EntryToValueIndex(entry);
@@ -962,11 +950,11 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
           return MaybeObjectHandle(smi_handler);
         }
         return MaybeObjectHandle(LoadHandler::LoadFromPrototype(
-            isolate(), map, holder, smi_handler));
+            isolate(), map, holder, *smi_handler));
       }
 
       Handle<Object> accessors = lookup->GetAccessors();
-      if (accessors->IsAccessorPair()) {
+      if (IsAccessorPair(*accessors)) {
         Handle<AccessorPair> accessor_pair =
             Handle<AccessorPair>::cast(accessors);
         if (lookup->TryLookupCachedProperty(accessor_pair)) {
@@ -975,17 +963,17 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
         }
 
         Handle<Object> getter(accessor_pair->getter(), isolate());
-        if (!getter->IsJSFunction() && !getter->IsFunctionTemplateInfo()) {
+        if (!IsJSFunction(*getter) && !IsFunctionTemplateInfo(*getter)) {
           // TODO(jgruber): Update counter name.
           TRACE_HANDLER_STATS(isolate(), LoadIC_SlowStub);
           return MaybeObjectHandle(LoadHandler::LoadSlow(isolate()));
         }
         set_accessor(getter);
 
-        if ((getter->IsFunctionTemplateInfo() &&
-             FunctionTemplateInfo::cast(*getter).BreakAtEntry()) ||
-            (getter->IsJSFunction() &&
-             JSFunction::cast(*getter).shared().BreakAtEntry())) {
+        if ((IsFunctionTemplateInfo(*getter) &&
+             FunctionTemplateInfo::cast(*getter)->BreakAtEntry(isolate())) ||
+            (IsJSFunction(*getter) &&
+             JSFunction::cast(*getter)->shared()->BreakAtEntry(isolate()))) {
           // Do not install an IC if the api function has a breakpoint.
           TRACE_HANDLER_STATS(isolate(), LoadIC_SlowStub);
           return MaybeObjectHandle(LoadHandler::LoadSlow(isolate()));
@@ -1010,14 +998,14 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
           smi_handler = LoadHandler::LoadApiGetter(
               isolate(), holder_lookup == CallOptimization::kHolderIsReceiver);
 
-          Handle<Context> context(
-              call_optimization.GetAccessorContext(holder->map()), isolate());
+          Handle<NativeContext> accessor_context =
+              GetAccessorContext(call_optimization, holder->map(), isolate());
 
           TRACE_HANDLER_STATS(isolate(), LoadIC_LoadApiGetterFromPrototypeDH);
           return MaybeObjectHandle(LoadHandler::LoadFromPrototype(
-              isolate(), map, holder, smi_handler,
+              isolate(), map, holder, *smi_handler,
               MaybeObjectHandle::Weak(call_optimization.api_call_info()),
-              MaybeObjectHandle::Weak(context)));
+              MaybeObjectHandle::Weak(accessor_context)));
         }
 
         if (holder->HasFastProperties()) {
@@ -1027,15 +1015,15 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
           TRACE_HANDLER_STATS(isolate(), LoadIC_LoadAccessorFromPrototypeDH);
           return MaybeObjectHandle(LoadHandler::LoadFromPrototype(
               isolate(), map, holder,
-              LoadHandler::LoadAccessorFromPrototype(isolate()),
+              *LoadHandler::LoadAccessorFromPrototype(isolate()),
               MaybeObjectHandle::Weak(getter)));
         }
 
-        if (holder->IsJSGlobalObject()) {
+        if (IsJSGlobalObject(*holder)) {
           TRACE_HANDLER_STATS(isolate(), LoadIC_LoadGlobalFromPrototypeDH);
           smi_handler = LoadHandler::LoadGlobal(isolate());
           return MaybeObjectHandle(LoadHandler::LoadFromPrototype(
-              isolate(), map, holder, smi_handler,
+              isolate(), map, holder, *smi_handler,
               MaybeObjectHandle::Weak(lookup->GetPropertyCell())));
         } else {
           smi_handler = LoadHandler::LoadNormal(isolate());
@@ -1046,7 +1034,7 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
         }
 
         return MaybeObjectHandle(LoadHandler::LoadFromPrototype(
-            isolate(), map, holder, smi_handler));
+            isolate(), map, holder, *smi_handler));
       }
 
       Handle<AccessorInfo> info = Handle<AccessorInfo>::cast(accessors);
@@ -1058,8 +1046,8 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
         return MaybeObjectHandle(LoadHandler::LoadSlow(isolate()));
       }
 
-      if (!info->has_getter() || !holder->HasFastProperties() ||
-          (info->is_sloppy() && !receiver->IsJSReceiver())) {
+      if (!info->has_getter(isolate()) || !holder->HasFastProperties() ||
+          (info->is_sloppy() && !IsJSReceiver(*receiver))) {
         TRACE_HANDLER_STATS(isolate(), LoadIC_SlowStub);
         return MaybeObjectHandle(LoadHandler::LoadSlow(isolate()));
       }
@@ -1071,7 +1059,7 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
       TRACE_HANDLER_STATS(isolate(),
                           LoadIC_LoadNativeDataPropertyFromPrototypeDH);
       return MaybeObjectHandle(
-          LoadHandler::LoadFromPrototype(isolate(), map, holder, smi_handler));
+          LoadHandler::LoadFromPrototype(isolate(), map, holder, *smi_handler));
     }
 
     case LookupIterator::DATA: {
@@ -1079,13 +1067,13 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
       DCHECK_EQ(PropertyKind::kData, lookup->property_details().kind());
       Handle<Smi> smi_handler;
       if (lookup->is_dictionary_holder()) {
-        if (holder->IsJSGlobalObject(isolate())) {
+        if (IsJSGlobalObject(*holder, isolate())) {
           // TODO(verwaest): Also supporting the global object as receiver is a
           // workaround for code that leaks the global object.
           TRACE_HANDLER_STATS(isolate(), LoadIC_LoadGlobalDH);
           smi_handler = LoadHandler::LoadGlobal(isolate());
           return MaybeObjectHandle(LoadHandler::LoadFromPrototype(
-              isolate(), map, holder, smi_handler,
+              isolate(), map, holder, *smi_handler,
               MaybeObjectHandle::Weak(lookup->GetPropertyCell())));
         }
         smi_handler = LoadHandler::LoadNormal(isolate());
@@ -1099,7 +1087,7 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
       } else {
         DCHECK_EQ(PropertyLocation::kField,
                   lookup->property_details().location());
-        DCHECK(holder->IsJSObject(isolate()));
+        DCHECK(IsJSObject(*holder, isolate()));
         FieldIndex field = lookup->GetFieldIndex();
         smi_handler = LoadHandler::LoadField(isolate(), field);
         TRACE_HANDLER_STATS(isolate(), LoadIC_LoadFieldDH);
@@ -1114,8 +1102,8 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
 
         Handle<Object> value = lookup->GetDataValue();
 
-        if (value->IsThinString()) {
-          value = handle(ThinString::cast(*value).actual(), isolate());
+        if (IsThinString(*value)) {
+          value = handle(ThinString::cast(*value)->actual(), isolate());
         }
 
         // Non internalized strings could turn into thin/cons strings
@@ -1123,32 +1111,36 @@ MaybeObjectHandle LoadIC::ComputeHandler(LookupIterator* lookup) {
         // not supported in the GC. If concurrent marking is running
         // and the thin/cons string is marked but the actual string is
         // not, then the weak reference could be missed.
-        if (!value->IsString() ||
-            (value->IsString() && value->IsInternalizedString())) {
+        if (!IsString(*value) ||
+            (IsString(*value) && IsInternalizedString(*value))) {
           MaybeObjectHandle weak_value =
-              value->IsSmi() ? MaybeObjectHandle(*value, isolate())
-                             : MaybeObjectHandle::Weak(*value, isolate());
+              IsSmi(*value) ? MaybeObjectHandle(*value, isolate())
+                            : MaybeObjectHandle::Weak(*value, isolate());
 
           smi_handler = LoadHandler::LoadConstantFromPrototype(isolate());
           TRACE_HANDLER_STATS(isolate(), LoadIC_LoadConstantFromPrototypeDH);
           return MaybeObjectHandle(LoadHandler::LoadFromPrototype(
-              isolate(), map, holder, smi_handler, weak_value));
+              isolate(), map, holder, *smi_handler, weak_value));
         }
       }
       return MaybeObjectHandle(
-          LoadHandler::LoadFromPrototype(isolate(), map, holder, smi_handler));
+          LoadHandler::LoadFromPrototype(isolate(), map, holder, *smi_handler));
     }
     case LookupIterator::INTEGER_INDEXED_EXOTIC:
       TRACE_HANDLER_STATS(isolate(), LoadIC_LoadIntegerIndexedExoticDH);
       return MaybeObjectHandle(LoadHandler::LoadNonExistent(isolate()));
 
     case LookupIterator::JSPROXY: {
+      // Private names on JSProxy is currently not supported.
+      if (lookup->name()->IsPrivate()) {
+        return MaybeObjectHandle(LoadHandler::LoadSlow(isolate()));
+      }
       Handle<Smi> smi_handler = LoadHandler::LoadProxy(isolate());
       if (holder_is_lookup_start_object) return MaybeObjectHandle(smi_handler);
 
       Handle<JSProxy> holder_proxy = lookup->GetHolder<JSProxy>();
       return MaybeObjectHandle(LoadHandler::LoadFromPrototype(
-          isolate(), map, holder_proxy, smi_handler));
+          isolate(), map, holder_proxy, *smi_handler));
     }
 
     case LookupIterator::WASM_OBJECT:
@@ -1201,11 +1193,11 @@ void KeyedLoadIC::UpdateLoadElement(Handle<HeapObject> receiver,
   // miss again and it will become polymorphic and support both the
   // untransitioned and transitioned maps.
   if (state() == MONOMORPHIC) {
-    if ((receiver->IsJSObject() &&
+    if ((IsJSObject(*receiver) &&
          IsMoreGeneralElementsKindTransition(
              target_receiver_maps.at(0)->elements_kind(),
              Handle<JSObject>::cast(receiver)->GetElementsKind())) ||
-        receiver->IsWasmObject()) {
+        IsWasmObject(*receiver)) {
       Handle<Object> handler = LoadElementHandler(receiver_map, load_mode);
       return ConfigureVectorState(Handle<Name>(), receiver_map, handler);
     }
@@ -1251,17 +1243,17 @@ namespace {
 
 bool AllowConvertHoleElementToUndefined(Isolate* isolate,
                                         Handle<Map> receiver_map) {
-  if (receiver_map->IsJSTypedArrayMap()) {
+  if (IsJSTypedArrayMap(*receiver_map)) {
     // For JSTypedArray we never lookup elements in the prototype chain.
     return true;
   }
 
   // For other {receiver}s we need to check the "no elements" protector.
   if (Protectors::IsNoElementsIntact(isolate)) {
-    if (receiver_map->IsStringMap()) {
+    if (IsStringMap(*receiver_map)) {
       return true;
     }
-    if (receiver_map->IsJSObjectMap()) {
+    if (IsJSObjectMap(*receiver_map)) {
       // For other JSObjects (including JSArrays) we can only continue if
       // the {receiver}s prototype is either the initial Object.prototype
       // or the initial Array.prototype, which are both guarded by the
@@ -1285,11 +1277,12 @@ Handle<Object> KeyedLoadIC::LoadElementHandler(Handle<Map> receiver_map,
                                                KeyedAccessLoadMode load_mode) {
   // Has a getter interceptor, or is any has and has a query interceptor.
   if (receiver_map->has_indexed_interceptor() &&
-      (!receiver_map->GetIndexedInterceptor().getter().IsUndefined(isolate()) ||
+      (!IsUndefined(receiver_map->GetIndexedInterceptor()->getter(),
+                    isolate()) ||
        (IsAnyHas() &&
-        !receiver_map->GetIndexedInterceptor().query().IsUndefined(
-            isolate()))) &&
-      !receiver_map->GetIndexedInterceptor().non_masking()) {
+        !IsUndefined(receiver_map->GetIndexedInterceptor()->query(),
+                     isolate()))) &&
+      !receiver_map->GetIndexedInterceptor()->non_masking()) {
     // TODO(jgruber): Update counter name.
     TRACE_HANDLER_STATS(isolate(), KeyedLoadIC_LoadIndexedInterceptorStub);
     return IsAnyHas() ? BUILTIN_CODE(isolate(), HasIndexedInterceptorIC)
@@ -1358,7 +1351,7 @@ void KeyedLoadIC::LoadElementPolymorphicHandlers(
     // among receiver_maps as unstable because the optimizing compilers may
     // generate an elements kind transition for this kind of receivers.
     if (receiver_map->is_stable()) {
-      Map tmap = receiver_map->FindElementsKindTransitionedMap(
+      Tagged<Map> tmap = receiver_map->FindElementsKindTransitionedMap(
           isolate(), *receiver_maps, ConcurrencyMode::kSynchronous);
       if (!tmap.is_null()) {
         receiver_map->NotifyLeafMapLayoutChange(isolate());
@@ -1377,22 +1370,22 @@ enum KeyType { kIntPtr, kName, kBailout };
 // CodeStubAssembler::TryToIntptr can handle!
 KeyType TryConvertKey(Handle<Object> key, Isolate* isolate, intptr_t* index_out,
                       Handle<Name>* name_out) {
-  if (key->IsSmi()) {
+  if (IsSmi(*key)) {
     *index_out = Smi::ToInt(*key);
     return kIntPtr;
   }
-  if (key->IsHeapNumber()) {
-    double num = HeapNumber::cast(*key).value();
+  if (IsHeapNumber(*key)) {
+    double num = HeapNumber::cast(*key)->value();
     if (!(num >= -kMaxSafeInteger)) return kBailout;
     if (num > kMaxSafeInteger) return kBailout;
     *index_out = static_cast<intptr_t>(num);
     if (*index_out != num) return kBailout;
     return kIntPtr;
   }
-  if (key->IsString()) {
+  if (IsString(*key)) {
     key = isolate->factory()->InternalizeString(Handle<String>::cast(key));
     uint32_t maybe_array_index;
-    if (String::cast(*key).AsArrayIndex(&maybe_array_index)) {
+    if (String::cast(*key)->AsArrayIndex(&maybe_array_index)) {
       if (maybe_array_index <= INT_MAX) {
         *index_out = static_cast<intptr_t>(maybe_array_index);
         return kIntPtr;
@@ -1404,7 +1397,7 @@ KeyType TryConvertKey(Handle<Object> key, Isolate* isolate, intptr_t* index_out,
     *name_out = Handle<String>::cast(key);
     return kName;
   }
-  if (key->IsSymbol()) {
+  if (IsSymbol(*key)) {
     *name_out = Handle<Symbol>::cast(key);
     return kName;
   }
@@ -1413,7 +1406,7 @@ KeyType TryConvertKey(Handle<Object> key, Isolate* isolate, intptr_t* index_out,
 
 bool IntPtrKeyToSize(intptr_t index, Handle<HeapObject> receiver, size_t* out) {
   if (index < 0) {
-    if (receiver->IsJSTypedArray()) {
+    if (IsJSTypedArray(*receiver)) {
       // For JSTypedArray receivers, we can support negative keys, which we
       // just map to a very large value. This is valid because all OOB accesses
       // (negative or positive) are handled the same way, and size_t::max is
@@ -1424,7 +1417,7 @@ bool IntPtrKeyToSize(intptr_t index, Handle<HeapObject> receiver, size_t* out) {
     return false;
   }
 #if V8_HOST_ARCH_64_BIT
-  if (index > JSObject::kMaxElementIndex && !receiver->IsJSTypedArray()) {
+  if (index > JSObject::kMaxElementIndex && !IsJSTypedArray(*receiver)) {
     return false;
   }
 #else
@@ -1439,20 +1432,20 @@ bool IntPtrKeyToSize(intptr_t index, Handle<HeapObject> receiver, size_t* out) {
 
 bool CanCache(Handle<Object> receiver, InlineCacheState state) {
   if (!v8_flags.use_ic || state == NO_FEEDBACK) return false;
-  if (!receiver->IsJSReceiver() && !receiver->IsString()) return false;
-  return !receiver->IsAccessCheckNeeded() && !receiver->IsJSPrimitiveWrapper();
+  if (!IsJSReceiver(*receiver) && !IsString(*receiver)) return false;
+  return !IsAccessCheckNeeded(*receiver) && !IsJSPrimitiveWrapper(*receiver);
 }
 
 bool IsOutOfBoundsAccess(Handle<Object> receiver, size_t index) {
   size_t length;
-  if (receiver->IsJSArray()) {
-    length = JSArray::cast(*receiver).length().Number();
-  } else if (receiver->IsJSTypedArray()) {
-    length = JSTypedArray::cast(*receiver).GetLength();
-  } else if (receiver->IsJSObject()) {
-    length = JSObject::cast(*receiver).elements().length();
-  } else if (receiver->IsString()) {
-    length = String::cast(*receiver).length();
+  if (IsJSArray(*receiver)) {
+    length = Object::Number(JSArray::cast(*receiver)->length());
+  } else if (IsJSTypedArray(*receiver)) {
+    length = JSTypedArray::cast(*receiver)->GetLength();
+  } else if (IsJSObject(*receiver)) {
+    length = JSObject::cast(*receiver)->elements()->length();
+  } else if (IsString(*receiver)) {
+    length = String::cast(*receiver)->length();
   } else {
     return false;
   }
@@ -1462,7 +1455,7 @@ bool IsOutOfBoundsAccess(Handle<Object> receiver, size_t index) {
 KeyedAccessLoadMode GetLoadMode(Isolate* isolate, Handle<Object> receiver,
                                 size_t index) {
   if (IsOutOfBoundsAccess(receiver, index)) {
-    DCHECK(receiver->IsHeapObject());
+    DCHECK(IsHeapObject(*receiver));
     Handle<Map> receiver_map(Handle<HeapObject>::cast(receiver)->map(),
                              isolate);
     if (AllowConvertHoleElementToUndefined(isolate, receiver_map)) {
@@ -1531,10 +1524,10 @@ bool StoreIC::LookupForWrite(LookupIterator* it, Handle<Object> value,
                              StoreOrigin store_origin) {
   // Disable ICs for non-JSObjects for now.
   Handle<Object> object = it->GetReceiver();
-  if (object->IsJSProxy()) return true;
-  if (!object->IsJSObject()) return false;
+  if (IsJSProxy(*object)) return true;
+  if (!IsJSObject(*object)) return false;
   Handle<JSObject> receiver = Handle<JSObject>::cast(object);
-  DCHECK(!receiver->map().is_deprecated());
+  DCHECK(!receiver->map()->is_deprecated());
 
   if (it->state() != LookupIterator::TRANSITION) {
     for (; it->IsFound(); it->Next()) {
@@ -1548,16 +1541,16 @@ bool StoreIC::LookupForWrite(LookupIterator* it, Handle<Object> value,
           return true;
         case LookupIterator::INTERCEPTOR: {
           Handle<JSObject> holder = it->GetHolder<JSObject>();
-          InterceptorInfo info = holder->GetNamedInterceptor();
+          Tagged<InterceptorInfo> info = holder->GetNamedInterceptor();
           if (it->HolderIsReceiverOrHiddenPrototype() ||
-              !info.getter().IsUndefined(isolate()) ||
-              !info.query().IsUndefined(isolate())) {
+              !IsUndefined(info->getter(), isolate()) ||
+              !IsUndefined(info->query(), isolate())) {
             return true;
           }
           break;
         }
         case LookupIterator::ACCESS_CHECK:
-          if (it->GetHolder<JSObject>()->IsAccessCheckNeeded()) return false;
+          if (IsAccessCheckNeeded(*it->GetHolder<JSObject>())) return false;
           break;
         case LookupIterator::ACCESSOR:
           return !it->IsReadOnly();
@@ -1575,7 +1568,7 @@ bool StoreIC::LookupForWrite(LookupIterator* it, Handle<Object> value,
           }
 
           // Receiver != holder.
-          if (receiver->IsJSGlobalProxy()) {
+          if (IsJSGlobalProxy(*receiver)) {
             PrototypeIterator iter(isolate(), receiver);
             return it->GetHolder<Object>().is_identical_to(
                 PrototypeIterator::GetCurrent(iter));
@@ -1622,13 +1615,13 @@ bool StoreIC::LookupForWrite(LookupIterator* it, Handle<Object> value,
 
 MaybeHandle<Object> StoreGlobalIC::Store(Handle<Name> name,
                                          Handle<Object> value) {
-  DCHECK(name->IsString());
+  DCHECK(IsString(*name));
 
   // Look up in script context table.
   Handle<String> str_name = Handle<String>::cast(name);
   Handle<JSGlobalObject> global = isolate()->global_object();
   Handle<ScriptContextTable> script_contexts(
-      global->native_context().script_context_table(), isolate());
+      global->native_context()->script_context_table(), isolate());
 
   VariableLookupResult lookup_result;
   if (script_contexts->Lookup(str_name, &lookup_result)) {
@@ -1641,7 +1634,7 @@ MaybeHandle<Object> StoreGlobalIC::Store(Handle<Name> name,
     Handle<Object> previous_value(script_context->get(lookup_result.slot_index),
                                   isolate());
 
-    if (previous_value->IsTheHole(isolate())) {
+    if (IsTheHole(*previous_value, isolate())) {
       // Do not install stubs and stay pre-monomorphic for
       // uninitialized accesses.
       THROW_NEW_ERROR(
@@ -1681,7 +1674,7 @@ Maybe<bool> DefineOwnDataProperty(LookupIterator* it,
                                   StoreOrigin store_origin) {
   // It should not be possible to call DefineOwnDataProperty in a
   // contextual store (indicated by IsJSGlobalObject()).
-  DCHECK(!it->GetReceiver()->IsJSGlobalObject(it->isolate()));
+  DCHECK(!IsJSGlobalObject(*it->GetReceiver(), it->isolate()));
 
   // Handle special cases that can't be handled by
   // DefineOwnPropertyIgnoreAttributes first.
@@ -1714,7 +1707,7 @@ Maybe<bool> DefineOwnDataProperty(LookupIterator* it,
         case LookupIterator::INTEGER_INDEXED_EXOTIC:
           UNREACHABLE();
         case LookupIterator::ACCESS_CHECK: {
-          DCHECK(!it->GetHolder<JSObject>()->IsAccessCheckNeeded());
+          DCHECK(!IsAccessCheckNeeded(*it->GetHolder<JSObject>()));
           V8_FALLTHROUGH;
         }
         case LookupIterator::NOT_FOUND:
@@ -1770,7 +1763,7 @@ MaybeHandle<Object> StoreIC::Store(Handle<Object> object, Handle<Name> name,
   bool use_ic = (state() != NO_FEEDBACK) && v8_flags.use_ic;
   // If the object is undefined or null it's illegal to try to set any
   // properties on it; throw a TypeError in that case.
-  if (object->IsNullOrUndefined(isolate())) {
+  if (IsNullOrUndefined(*object, isolate())) {
     if (use_ic) {
       // Ensure the IC state progresses.
       TRACE_HANDLER_STATS(isolate(), StoreIC_NonReceiver);
@@ -1801,7 +1794,7 @@ MaybeHandle<Object> StoreIC::Store(Handle<Object> object, Handle<Name> name,
 
     // IC handling of private fields/symbols stores on JSProxy is not
     // supported.
-    if (object->IsJSProxy()) {
+    if (IsJSProxy(*object)) {
       use_ic = false;
     }
   }
@@ -1815,17 +1808,17 @@ MaybeHandle<Object> StoreIC::Store(Handle<Object> object, Handle<Name> name,
   // present. We can also skip this for private names since they are not
   // bound by configurability or extensibility checks, and errors would've
   // been thrown if the private field already exists in the object.
-  if (IsAnyDefineOwn() && !name->IsPrivateName() && !object->IsJSProxy() &&
+  if (IsAnyDefineOwn() && !name->IsPrivateName() && !IsJSProxy(*object) &&
       !Handle<JSObject>::cast(object)->HasNamedInterceptor()) {
-    Maybe<bool> can_define = JSReceiver::CheckIfCanDefine(
+    Maybe<bool> can_define = JSObject::CheckIfCanDefineAsConfigurable(
         isolate(), &it, value, Nothing<ShouldThrow>());
     MAYBE_RETURN_NULL(can_define);
     if (!can_define.FromJust()) {
       return isolate()->factory()->undefined_value();
     }
-    // Restart the lookup iterator updated by CheckIfCanDefine() for
-    // UpdateCaches() to handle access checks.
-    if (use_ic && object->IsAccessCheckNeeded()) {
+    // Restart the lookup iterator updated by CheckIfCanDefineAsConfigurable()
+    // for UpdateCaches() to handle access checks.
+    if (use_ic && IsAccessCheckNeeded(*object)) {
       it.Restart();
     }
   }
@@ -1866,7 +1859,7 @@ void StoreIC::UpdateCaches(LookupIterator* lookup, Handle<Object> value,
     if (IsStoreGlobalIC()) {
       if (lookup->state() == LookupIterator::DATA &&
           lookup->GetReceiver().is_identical_to(lookup->GetHolder<Object>())) {
-        DCHECK(lookup->GetReceiver()->IsJSGlobalObject());
+        DCHECK(IsJSGlobalObject(*lookup->GetReceiver()));
         // Now update the cell in the feedback vector.
         nexus()->ConfigurePropertyCellMode(lookup->GetPropertyCell());
         TraceIC("StoreGlobalIC", lookup->GetName());
@@ -1889,10 +1882,10 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
   switch (lookup->state()) {
     case LookupIterator::TRANSITION: {
       Handle<JSObject> store_target = lookup->GetStoreTarget<JSObject>();
-      if (store_target->IsJSGlobalObject()) {
+      if (IsJSGlobalObject(*store_target)) {
         TRACE_HANDLER_STATS(isolate(), StoreIC_StoreGlobalTransitionDH);
 
-        if (lookup_start_object_map()->IsJSGlobalObject()) {
+        if (IsJSGlobalObject(*lookup_start_object_map())) {
           DCHECK(IsStoreGlobalIC());
 #ifdef DEBUG
           Handle<JSObject> holder = lookup->GetHolder<JSObject>();
@@ -1911,7 +1904,7 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
 
         Handle<Smi> smi_handler = StoreHandler::StoreGlobalProxy(isolate());
         Handle<Object> handler = StoreHandler::StoreThroughPrototype(
-            isolate(), lookup_start_object_map(), store_target, smi_handler,
+            isolate(), lookup_start_object_map(), store_target, *smi_handler,
             MaybeObjectHandle::Weak(lookup->transition_cell()));
         return MaybeObjectHandle(handler);
       }
@@ -1929,14 +1922,14 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
 
     case LookupIterator::INTERCEPTOR: {
       Handle<JSObject> holder = lookup->GetHolder<JSObject>();
-      InterceptorInfo info = holder->GetNamedInterceptor();
+      Tagged<InterceptorInfo> info = holder->GetNamedInterceptor();
 
       // If the interceptor is on the receiver...
-      if (lookup->HolderIsReceiverOrHiddenPrototype() && !info.non_masking()) {
+      if (lookup->HolderIsReceiverOrHiddenPrototype() && !info->non_masking()) {
         // ...return a store interceptor Smi handler if there is a setter
         // interceptor and it's not DefineNamedOwnIC or DefineKeyedOwnIC
         // (which should call the definer)...
-        if (!info.setter().IsUndefined(isolate()) && !IsAnyDefineOwn()) {
+        if (!IsUndefined(info->setter(), isolate()) && !IsAnyDefineOwn()) {
           return MaybeObjectHandle(StoreHandler::StoreInterceptor(isolate()));
         }
         // ...otherwise return a slow-case Smi handler, which invokes the
@@ -1947,11 +1940,11 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
       // If the interceptor is a getter/query interceptor on the prototype
       // chain, return an invalidatable slow handler so it can turn fast if the
       // interceptor is masked by a regular property later.
-      DCHECK(!info.getter().IsUndefined(isolate()) ||
-             !info.query().IsUndefined(isolate()));
+      DCHECK(!IsUndefined(info->getter(), isolate()) ||
+             !IsUndefined(info->query(), isolate()));
       Handle<Object> handler = StoreHandler::StoreThroughPrototype(
           isolate(), lookup_start_object_map(), holder,
-          StoreHandler::StoreSlow(isolate()));
+          *StoreHandler::StoreSlow(isolate()));
       return MaybeObjectHandle(handler);
     }
 
@@ -1959,7 +1952,7 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
       // This is currently guaranteed by checks in StoreIC::Store.
       Handle<JSObject> receiver = Handle<JSObject>::cast(lookup->GetReceiver());
       Handle<JSObject> holder = lookup->GetHolder<JSObject>();
-      DCHECK(!receiver->IsAccessCheckNeeded() || lookup->name()->IsPrivate());
+      DCHECK(!IsAccessCheckNeeded(*receiver) || lookup->name()->IsPrivate());
 
       if (!holder->HasFastProperties()) {
         set_slow_stub_reason("accessor on slow map");
@@ -1969,14 +1962,14 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
         return handler;
       }
       Handle<Object> accessors = lookup->GetAccessors();
-      if (accessors->IsAccessorInfo()) {
+      if (IsAccessorInfo(*accessors)) {
         Handle<AccessorInfo> info = Handle<AccessorInfo>::cast(accessors);
-        if (!info->has_setter()) {
+        if (!info->has_setter(isolate())) {
           set_slow_stub_reason("setter == kNullAddress");
           TRACE_HANDLER_STATS(isolate(), StoreIC_SlowStub);
           return MaybeObjectHandle(StoreHandler::StoreSlow(isolate()));
         }
-        if (AccessorInfo::cast(*accessors).is_special_data_property() &&
+        if (AccessorInfo::cast(*accessors)->is_special_data_property() &&
             !lookup->HolderIsReceiverOrHiddenPrototype()) {
           set_slow_stub_reason("special data property in prototype chain");
           TRACE_HANDLER_STATS(isolate(), StoreIC_SlowStub);
@@ -1992,21 +1985,21 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
         TRACE_HANDLER_STATS(isolate(),
                             StoreIC_StoreNativeDataPropertyOnPrototypeDH);
         return MaybeObjectHandle(StoreHandler::StoreThroughPrototype(
-            isolate(), lookup_start_object_map(), holder, smi_handler));
+            isolate(), lookup_start_object_map(), holder, *smi_handler));
 
-      } else if (accessors->IsAccessorPair()) {
+      } else if (IsAccessorPair(*accessors)) {
         Handle<Object> setter(Handle<AccessorPair>::cast(accessors)->setter(),
                               isolate());
-        if (!setter->IsJSFunction() && !setter->IsFunctionTemplateInfo()) {
+        if (!IsJSFunction(*setter) && !IsFunctionTemplateInfo(*setter)) {
           set_slow_stub_reason("setter not a function");
           TRACE_HANDLER_STATS(isolate(), StoreIC_SlowStub);
           return MaybeObjectHandle(StoreHandler::StoreSlow(isolate()));
         }
 
-        if ((setter->IsFunctionTemplateInfo() &&
-             FunctionTemplateInfo::cast(*setter).BreakAtEntry()) ||
-            (setter->IsJSFunction() &&
-             JSFunction::cast(*setter).shared().BreakAtEntry())) {
+        if ((IsFunctionTemplateInfo(*setter) &&
+             FunctionTemplateInfo::cast(*setter)->BreakAtEntry(isolate())) ||
+            (IsJSFunction(*setter) &&
+             JSFunction::cast(*setter)->shared()->BreakAtEntry(isolate()))) {
           // Do not install an IC if the api function has a breakpoint.
           TRACE_HANDLER_STATS(isolate(), StoreIC_SlowStub);
           return MaybeObjectHandle(StoreHandler::StoreSlow(isolate()));
@@ -2024,18 +2017,19 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
                 isolate(),
                 holder_lookup == CallOptimization::kHolderIsReceiver);
 
-            Handle<Context> context(
-                call_optimization.GetAccessorContext(holder->map()), isolate());
+            Handle<NativeContext> accessor_context =
+                GetAccessorContext(call_optimization, holder->map(), isolate());
+
             TRACE_HANDLER_STATS(isolate(), StoreIC_StoreApiSetterOnPrototypeDH);
             return MaybeObjectHandle(StoreHandler::StoreThroughPrototype(
-                isolate(), lookup_start_object_map(), holder, smi_handler,
+                isolate(), lookup_start_object_map(), holder, *smi_handler,
                 MaybeObjectHandle::Weak(call_optimization.api_call_info()),
-                MaybeObjectHandle::Weak(context)));
+                MaybeObjectHandle::Weak(accessor_context)));
           }
           set_slow_stub_reason("incompatible receiver");
           TRACE_HANDLER_STATS(isolate(), StoreIC_SlowStub);
           return MaybeObjectHandle(StoreHandler::StoreSlow(isolate()));
-        } else if (setter->IsFunctionTemplateInfo()) {
+        } else if (IsFunctionTemplateInfo(*setter)) {
           set_slow_stub_reason("setter non-simple template");
           TRACE_HANDLER_STATS(isolate(), StoreIC_SlowStub);
           return MaybeObjectHandle(StoreHandler::StoreSlow(isolate()));
@@ -2051,7 +2045,7 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
         TRACE_HANDLER_STATS(isolate(), StoreIC_StoreAccessorOnPrototypeDH);
 
         return MaybeObjectHandle(StoreHandler::StoreThroughPrototype(
-            isolate(), lookup_start_object_map(), holder, smi_handler));
+            isolate(), lookup_start_object_map(), holder, *smi_handler));
       }
       TRACE_HANDLER_STATS(isolate(), StoreIC_SlowStub);
       return MaybeObjectHandle(StoreHandler::StoreSlow(isolate()));
@@ -2062,11 +2056,11 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
       Handle<JSObject> receiver = Handle<JSObject>::cast(lookup->GetReceiver());
       USE(receiver);
       Handle<JSObject> holder = lookup->GetHolder<JSObject>();
-      DCHECK(!receiver->IsAccessCheckNeeded() || lookup->name()->IsPrivate());
+      DCHECK(!IsAccessCheckNeeded(*receiver) || lookup->name()->IsPrivate());
 
       DCHECK_EQ(PropertyKind::kData, lookup->property_details().kind());
       if (lookup->is_dictionary_holder()) {
-        if (holder->IsJSGlobalObject()) {
+        if (IsJSGlobalObject(*holder)) {
           TRACE_HANDLER_STATS(isolate(), StoreIC_StoreGlobalDH);
           return MaybeObjectHandle(
               StoreHandler::StoreGlobal(lookup->GetPropertyCell()));
@@ -2091,7 +2085,7 @@ MaybeObjectHandle StoreIC::ComputeHandler(LookupIterator* lookup) {
         TRACE_HANDLER_STATS(isolate(), StoreIC_StoreFieldDH);
         int descriptor = lookup->GetFieldDescriptorIndex();
         FieldIndex index = lookup->GetFieldIndex();
-        if (V8_UNLIKELY(holder->IsJSSharedStruct())) {
+        if (V8_UNLIKELY(IsJSSharedStruct(*holder))) {
           return MaybeObjectHandle(StoreHandler::StoreSharedStructField(
               isolate(), descriptor, index, lookup->representation()));
         }
@@ -2191,7 +2185,7 @@ void KeyedStoreIC::UpdateStoreElement(Handle<Map> receiver_map,
     if (receiver_map.is_identical_to(previous_receiver_map) &&
         new_receiver_map.is_identical_to(receiver_map) &&
         old_store_mode == STANDARD_STORE && store_mode != STANDARD_STORE) {
-      if (receiver_map->IsJSArrayMap() &&
+      if (IsJSArrayMap(*receiver_map) &&
           JSArray::MayHaveReadOnlyLength(*receiver_map)) {
         set_slow_stub_reason(
             "can't generalize store mode (potentially read-only length)");
@@ -2247,7 +2241,7 @@ void KeyedStoreIC::UpdateStoreElement(Handle<Map> receiver_map,
     size_t external_arrays = 0;
     for (MapAndHandler map_and_handler : target_maps_and_handlers) {
       Handle<Map> map = map_and_handler.first;
-      if (map->IsJSArrayMap() && JSArray::MayHaveReadOnlyLength(*map)) {
+      if (IsJSArrayMap(*map) && JSArray::MayHaveReadOnlyLength(*map)) {
         set_slow_stub_reason(
             "unsupported combination of arrays (potentially read-only length)");
         return;
@@ -2289,7 +2283,7 @@ Handle<Object> KeyedStoreIC::StoreElementHandler(
           receiver_map->MayHaveReadOnlyElementsInPrototypeChain(isolate()),
       IsStoreInArrayLiteralIC());
 
-  if (receiver_map->IsJSProxyMap()) {
+  if (IsJSProxyMap(*receiver_map)) {
     // DefineKeyedOwnIC, which is used to define computed fields in instances,
     // should be handled by the slow stub.
     if (IsDefineKeyedOwnIC()) {
@@ -2310,10 +2304,18 @@ Handle<Object> KeyedStoreIC::StoreElementHandler(
              receiver_map->has_sealed_elements() ||
              receiver_map->has_nonextensible_elements() ||
              receiver_map->has_typed_array_or_rab_gsab_typed_array_elements()) {
+    // TODO(jgruber): Update counter name.
     TRACE_HANDLER_STATS(isolate(), KeyedStoreIC_StoreFastElementStub);
-    code = StoreHandler::StoreFastElementBuiltin(isolate(), store_mode);
-    if (receiver_map->has_typed_array_or_rab_gsab_typed_array_elements()) {
-      return code;
+    if (IsJSArgumentsObjectMap(*receiver_map) &&
+        receiver_map->has_fast_packed_elements()) {
+      // Allow fast behaviour for in-bounds stores while making it miss and
+      // properly handle the out of bounds store case.
+      code = StoreHandler::StoreFastElementBuiltin(isolate(), STANDARD_STORE);
+    } else {
+      code = StoreHandler::StoreFastElementBuiltin(isolate(), store_mode);
+      if (receiver_map->has_typed_array_or_rab_gsab_typed_array_elements()) {
+        return code;
+      }
     }
   } else if (IsStoreInArrayLiteralIC()) {
     // TODO(jgruber): Update counter name.
@@ -2324,7 +2326,7 @@ Handle<Object> KeyedStoreIC::StoreElementHandler(
     TRACE_HANDLER_STATS(isolate(), KeyedStoreIC_StoreElementStub);
     DCHECK(DICTIONARY_ELEMENTS == receiver_map->elements_kind() ||
            receiver_map->has_frozen_elements());
-    code = StoreHandler::StoreSlow(isolate(), store_mode);
+    return StoreHandler::StoreSlow(isolate(), store_mode);
   }
 
   if (IsAnyDefineOwn() || IsStoreInArrayLiteralIC()) return code;
@@ -2333,7 +2335,7 @@ Handle<Object> KeyedStoreIC::StoreElementHandler(
     validity_cell =
         Map::GetOrCreatePrototypeChainValidityCell(receiver_map, isolate());
   }
-  if (validity_cell->IsSmi()) {
+  if (IsSmi(*validity_cell)) {
     // There's no prototype validity cell to check, so we can just use the stub.
     return code;
   }
@@ -2367,7 +2369,7 @@ void KeyedStoreIC::StoreElementPolymorphicHandlers(
 
     } else {
       {
-        Map tmap = receiver_map->FindElementsKindTransitionedMap(
+        Tagged<Map> tmap = receiver_map->FindElementsKindTransitionedMap(
             isolate(), receiver_maps, ConcurrencyMode::kSynchronous);
         if (!tmap.is_null()) {
           if (receiver_map->is_stable()) {
@@ -2378,12 +2380,12 @@ void KeyedStoreIC::StoreElementPolymorphicHandlers(
       }
 
       MaybeHandle<Object> validity_cell;
-      HeapObject old_handler_obj;
+      Tagged<HeapObject> old_handler_obj;
       if (!old_handler.is_null() &&
           old_handler->GetHeapObject(&old_handler_obj) &&
-          old_handler_obj.IsDataHandler()) {
+          IsDataHandler(old_handler_obj)) {
         validity_cell = MaybeHandle<Object>(
-            DataHandler::cast(old_handler_obj).validity_cell(), isolate());
+            DataHandler::cast(old_handler_obj)->validity_cell(), isolate());
       }
       // TODO(mythria): Do not recompute the handler if we know there is no
       // change in the handler.
@@ -2413,8 +2415,8 @@ bool MayHaveTypedArrayInPrototypeChain(Handle<JSObject> object) {
   for (PrototypeIterator iter(object->GetIsolate(), *object); !iter.IsAtEnd();
        iter.Advance()) {
     // Be conservative, don't walk into proxies.
-    if (iter.GetCurrent().IsJSProxy()) return true;
-    if (iter.GetCurrent().IsJSTypedArray()) return true;
+    if (IsJSProxy(iter.GetCurrent())) return true;
+    if (IsJSTypedArray(iter.GetCurrent())) return true;
   }
   return false;
 }
@@ -2424,16 +2426,16 @@ KeyedAccessStoreMode GetStoreMode(Handle<JSObject> receiver, size_t index) {
   // Don't consider this a growing store if the store would send the receiver to
   // dictionary mode.
   bool allow_growth =
-      receiver->IsJSArray() && oob_access && index <= JSArray::kMaxArrayIndex &&
+      IsJSArray(*receiver) && oob_access && index <= JSArray::kMaxArrayIndex &&
       !receiver->WouldConvertToSlowElements(static_cast<uint32_t>(index));
   if (allow_growth) {
     return STORE_AND_GROW_HANDLE_COW;
   }
-  if (receiver->map().has_typed_array_or_rab_gsab_typed_array_elements() &&
+  if (receiver->map()->has_typed_array_or_rab_gsab_typed_array_elements() &&
       oob_access) {
     return STORE_IGNORE_OUT_OF_BOUNDS;
   }
-  return receiver->elements().IsCowArray() ? STORE_HANDLE_COW : STANDARD_STORE;
+  return receiver->elements()->IsCowArray() ? STORE_HANDLE_COW : STANDARD_STORE;
 }
 
 }  // namespace
@@ -2482,19 +2484,19 @@ MaybeHandle<Object> KeyedStoreIC::Store(Handle<Object> object,
 
   // TODO(jkummerow): Refactor the condition logic here and below.
   bool use_ic = (state() != NO_FEEDBACK) && v8_flags.use_ic &&
-                !object->IsStringWrapper() && !object->IsAccessCheckNeeded() &&
-                !object->IsJSGlobalProxy();
-  if (use_ic && !object->IsSmi()) {
+                !IsStringWrapper(*object) && !IsAccessCheckNeeded(*object) &&
+                !IsJSGlobalProxy(*object);
+  if (use_ic && !IsSmi(*object)) {
     // Don't use ICs for maps of the objects in Array's prototype chain. We
     // expect to be able to trap element sets to objects with those maps in
     // the runtime to enable optimization of element hole access.
     Handle<HeapObject> heap_object = Handle<HeapObject>::cast(object);
-    if (heap_object->map().IsMapInArrayPrototypeChain(isolate())) {
+    if (heap_object->map()->IsMapInArrayPrototypeChain(isolate())) {
       set_slow_stub_reason("map in array prototype");
       use_ic = false;
     }
 #if V8_ENABLE_WEBASSEMBLY
-    if (heap_object->map().IsWasmObjectMap()) {
+    if (IsWasmObjectMap(heap_object->map())) {
       set_slow_stub_reason("wasm object");
       use_ic = false;
     }
@@ -2505,11 +2507,11 @@ MaybeHandle<Object> KeyedStoreIC::Store(Handle<Object> object,
   bool is_arguments = false;
   bool key_is_valid_index = (key_type == kIntPtr);
   KeyedAccessStoreMode store_mode = STANDARD_STORE;
-  if (use_ic && object->IsJSReceiver() && key_is_valid_index) {
+  if (use_ic && IsJSReceiver(*object) && key_is_valid_index) {
     Handle<JSReceiver> receiver = Handle<JSReceiver>::cast(object);
     old_receiver_map = handle(receiver->map(), isolate());
-    is_arguments = receiver->IsJSArgumentsObject();
-    bool is_proxy = receiver->IsJSProxy();
+    is_arguments = IsJSArgumentsObject(*receiver);
+    bool is_proxy = IsJSProxy(*receiver);
     size_t index;
     key_is_valid_index = IntPtrKeyToSize(maybe_index, receiver, &index);
     if (!is_arguments && !is_proxy) {
@@ -2538,11 +2540,11 @@ MaybeHandle<Object> KeyedStoreIC::Store(Handle<Object> object,
     if (!old_receiver_map.is_null()) {
       if (is_arguments) {
         set_slow_stub_reason("arguments receiver");
-      } else if (object->IsJSArray() && IsGrowStoreMode(store_mode) &&
+      } else if (IsJSArray(*object) && IsGrowStoreMode(store_mode) &&
                  JSArray::HasReadOnlyLength(Handle<JSArray>::cast(object))) {
         set_slow_stub_reason("array has read only length");
-      } else if (object->IsJSObject() && MayHaveTypedArrayInPrototypeChain(
-                                             Handle<JSObject>::cast(object))) {
+      } else if (IsJSObject(*object) && MayHaveTypedArrayInPrototypeChain(
+                                            Handle<JSObject>::cast(object))) {
         // Make sure we don't handle this in IC if there's any JSTypedArray in
         // the {receiver}'s prototype chain, since that prototype is going to
         // swallow all stores that are out-of-bounds for said prototype, and we
@@ -2583,7 +2585,7 @@ MaybeHandle<Object> KeyedStoreIC::Store(Handle<Object> object,
 namespace {
 Maybe<bool> StoreOwnElement(Isolate* isolate, Handle<JSArray> array,
                             Handle<Object> index, Handle<Object> value) {
-  DCHECK(index->IsNumber());
+  DCHECK(IsNumber(*index));
   PropertyKey key(isolate, index);
   LookupIterator it(isolate, array, key, LookupIterator::OWN);
 
@@ -2597,8 +2599,8 @@ Maybe<bool> StoreOwnElement(Isolate* isolate, Handle<JSArray> array,
 MaybeHandle<Object> StoreInArrayLiteralIC::Store(Handle<JSArray> array,
                                                  Handle<Object> index,
                                                  Handle<Object> value) {
-  DCHECK(!array->map().IsMapInArrayPrototypeChain(isolate()));
-  DCHECK(index->IsNumber());
+  DCHECK(!array->map()->IsMapInArrayPrototypeChain(isolate()));
+  DCHECK(IsNumber(*index));
 
   if (!v8_flags.use_ic || state() == NO_FEEDBACK ||
       MigrateDeprecated(isolate(), array)) {
@@ -2610,7 +2612,7 @@ MaybeHandle<Object> StoreInArrayLiteralIC::Store(Handle<JSArray> array,
   // TODO(neis): Convert HeapNumber to Smi if possible?
 
   KeyedAccessStoreMode store_mode = STANDARD_STORE;
-  if (index->IsSmi()) {
+  if (IsSmi(*index)) {
     DCHECK_GE(Smi::ToInt(*index), 0);
     uint32_t index32 = static_cast<uint32_t>(Smi::ToInt(*index));
     store_mode = GetStoreMode(array, index32);
@@ -2619,7 +2621,7 @@ MaybeHandle<Object> StoreInArrayLiteralIC::Store(Handle<JSArray> array,
   Handle<Map> old_array_map(array->map(), isolate());
   MAYBE_RETURN_NULL(StoreOwnElement(isolate(), array, index, value));
 
-  if (index->IsSmi()) {
+  if (IsSmi(*index)) {
     DCHECK(!old_array_map->is_abandoned_prototype_map());
     UpdateStoreElement(old_array_map, store_mode,
                        handle(array->map(), isolate()));
@@ -2644,9 +2646,9 @@ RUNTIME_FUNCTION(Runtime_LoadIC_Miss) {
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> receiver = args.at(0);
   Handle<Name> key = args.at<Name>(1);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(2);
+  int slot = args.tagged_index_value_at(2);
   Handle<FeedbackVector> vector = args.at<FeedbackVector>(3);
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
 
   // A monomorphic or polymorphic KeyedLoadIC with a string key can call the
   // LoadIC miss handler if the handler misses. Since the vector Nexus is
@@ -2711,15 +2713,15 @@ RUNTIME_FUNCTION(Runtime_LoadGlobalIC_Miss) {
   // Runtime functions don't follow the IC's calling convention.
   Handle<JSGlobalObject> global = isolate->global_object();
   Handle<String> name = args.at<String>(0);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+  int slot = args.tagged_index_value_at(1);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(2);
   int typeof_value = args.smi_value_at(3);
   TypeofMode typeof_mode = static_cast<TypeofMode>(typeof_value);
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
 
   Handle<FeedbackVector> vector = Handle<FeedbackVector>();
-  if (!maybe_vector->IsUndefined(isolate)) {
-    DCHECK(maybe_vector->IsFeedbackVector());
+  if (!IsUndefined(*maybe_vector, isolate)) {
+    DCHECK(IsFeedbackVector(*maybe_vector));
     vector = Handle<FeedbackVector>::cast(maybe_vector);
   }
 
@@ -2739,9 +2741,9 @@ RUNTIME_FUNCTION(Runtime_LoadGlobalIC_Slow) {
   DCHECK_EQ(3, args.length());
   Handle<String> name = args.at<String>(0);
 
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+  int slot = args.tagged_index_value_at(1);
   Handle<FeedbackVector> vector = args.at<FeedbackVector>(2);
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
   FeedbackSlotKind kind = vector->GetKind(vector_slot);
 
   LoadGlobalIC ic(isolate, vector, vector_slot, kind);
@@ -2757,9 +2759,9 @@ RUNTIME_FUNCTION(Runtime_LoadWithReceiverIC_Miss) {
   Handle<Object> receiver = args.at(0);
   Handle<Object> object = args.at(1);
   Handle<Name> key = args.at<Name>(2);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(3);
+  int slot = args.tagged_index_value_at(3);
   Handle<FeedbackVector> vector = args.at<FeedbackVector>(4);
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
 
   DCHECK(IsLoadICKind(vector->GetKind(vector_slot)));
   LoadIC ic(isolate, vector, vector_slot, FeedbackSlotKind::kLoadProperty);
@@ -2773,15 +2775,15 @@ RUNTIME_FUNCTION(Runtime_KeyedLoadIC_Miss) {
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> receiver = args.at(0);
   Handle<Object> key = args.at(1);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(2);
+  int slot = args.tagged_index_value_at(2);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(3);
 
   Handle<FeedbackVector> vector = Handle<FeedbackVector>();
-  if (!maybe_vector->IsUndefined(isolate)) {
-    DCHECK(maybe_vector->IsFeedbackVector());
+  if (!IsUndefined(*maybe_vector, isolate)) {
+    DCHECK(IsFeedbackVector(*maybe_vector));
     vector = Handle<FeedbackVector>::cast(maybe_vector);
   }
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
   KeyedLoadIC ic(isolate, vector, vector_slot, FeedbackSlotKind::kLoadKeyed);
   ic.UpdateState(receiver, key);
   RETURN_RESULT_OR_FAILURE(isolate, ic.Load(receiver, key));
@@ -2792,12 +2794,12 @@ RUNTIME_FUNCTION(Runtime_StoreIC_Miss) {
   DCHECK_EQ(5, args.length());
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> value = args.at(0);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+  int slot = args.tagged_index_value_at(1);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(2);
   Handle<Object> receiver = args.at(3);
   Handle<Name> key = args.at<Name>(4);
 
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
 
   // When there is no feedback vector it is OK to use the SetNamedStrict as
   // the feedback slot kind. We only reuse this for DefineNamedOwnIC when
@@ -2805,8 +2807,8 @@ RUNTIME_FUNCTION(Runtime_StoreIC_Miss) {
   // when feedback vector is available.
   FeedbackSlotKind kind = FeedbackSlotKind::kSetNamedStrict;
   Handle<FeedbackVector> vector = Handle<FeedbackVector>();
-  if (!maybe_vector->IsUndefined(isolate)) {
-    DCHECK(maybe_vector->IsFeedbackVector());
+  if (!IsUndefined(*maybe_vector, isolate)) {
+    DCHECK(IsFeedbackVector(*maybe_vector));
     vector = Handle<FeedbackVector>::cast(maybe_vector);
     kind = vector->GetKind(vector_slot);
   }
@@ -2822,19 +2824,19 @@ RUNTIME_FUNCTION(Runtime_DefineNamedOwnIC_Miss) {
   DCHECK_EQ(5, args.length());
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> value = args.at(0);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+  int slot = args.tagged_index_value_at(1);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(2);
   Handle<Object> receiver = args.at(3);
   Handle<Name> key = args.at<Name>(4);
 
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
 
   // When there is no feedback vector it is OK to use the DefineNamedOwn
   // feedback kind. There _should_ be a vector, though.
   FeedbackSlotKind kind = FeedbackSlotKind::kDefineNamedOwn;
   Handle<FeedbackVector> vector = Handle<FeedbackVector>();
-  if (!maybe_vector->IsUndefined(isolate)) {
-    DCHECK(maybe_vector->IsFeedbackVector());
+  if (!IsUndefined(*maybe_vector, isolate)) {
+    DCHECK(IsFeedbackVector(*maybe_vector));
     vector = Handle<FeedbackVector>::cast(maybe_vector);
     kind = vector->GetKind(vector_slot);
   }
@@ -2859,7 +2861,7 @@ RUNTIME_FUNCTION(Runtime_DefineNamedOwnIC_Slow) {
   // Unlike DefineKeyedOwnIC, DefineNamedOwnIC doesn't handle private
   // fields and is used for defining data properties in object literals
   // and defining named public class fields.
-  DCHECK(!key->IsSymbol() || !Symbol::cast(*key).is_private_name());
+  DCHECK(!IsSymbol(*key) || !Symbol::cast(*key)->is_private_name());
 
   PropertyKey lookup_key(isolate, key);
   LookupIterator it(isolate, object, lookup_key, LookupIterator::OWN);
@@ -2875,11 +2877,11 @@ RUNTIME_FUNCTION(Runtime_StoreGlobalIC_Miss) {
   DCHECK_EQ(4, args.length());
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> value = args.at(0);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+  int slot = args.tagged_index_value_at(1);
   Handle<FeedbackVector> vector = args.at<FeedbackVector>(2);
   Handle<Name> key = args.at<Name>(3);
 
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
   FeedbackSlotKind kind = vector->GetKind(vector_slot);
   StoreGlobalIC ic(isolate, vector, vector_slot, kind);
   Handle<JSGlobalObject> global = isolate->global_object();
@@ -2911,13 +2913,13 @@ RUNTIME_FUNCTION(Runtime_StoreGlobalIC_Slow) {
 
 #ifdef DEBUG
   {
-    Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+    int slot = args.tagged_index_value_at(1);
     Handle<FeedbackVector> vector = args.at<FeedbackVector>(2);
-    FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+    FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
     FeedbackSlotKind slot_kind = vector->GetKind(vector_slot);
     DCHECK(IsStoreGlobalICKind(slot_kind));
     Handle<Object> receiver = args.at(3);
-    DCHECK(receiver->IsJSGlobalProxy());
+    DCHECK(IsJSGlobalProxy(*receiver));
   }
 #endif
 
@@ -2938,7 +2940,7 @@ RUNTIME_FUNCTION(Runtime_StoreGlobalIC_Slow) {
     Handle<Object> previous_value(script_context->get(lookup_result.slot_index),
                                   isolate);
 
-    if (previous_value->IsTheHole(isolate)) {
+    if (IsTheHole(*previous_value, isolate)) {
       THROW_NEW_ERROR_RETURN_FAILURE(
           isolate, NewReferenceError(
                        MessageTemplate::kAccessedUninitializedVariable, name));
@@ -2958,11 +2960,11 @@ RUNTIME_FUNCTION(Runtime_KeyedStoreIC_Miss) {
   DCHECK_EQ(5, args.length());
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> value = args.at(0);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+  int slot = args.tagged_index_value_at(1);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(2);
   Handle<Object> receiver = args.at(3);
   Handle<Object> key = args.at(4);
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
 
   // When the feedback vector is not valid the slot can only be of type
   // StoreKeyed. Storing in array literals falls back to
@@ -2972,8 +2974,8 @@ RUNTIME_FUNCTION(Runtime_KeyedStoreIC_Miss) {
   // and StoreInArrayLiteral kinds.
   FeedbackSlotKind kind = FeedbackSlotKind::kSetKeyedStrict;
   Handle<FeedbackVector> vector = Handle<FeedbackVector>();
-  if (!maybe_vector->IsUndefined(isolate)) {
-    DCHECK(maybe_vector->IsFeedbackVector());
+  if (!IsUndefined(*maybe_vector, isolate)) {
+    DCHECK(IsFeedbackVector(*maybe_vector));
     vector = Handle<FeedbackVector>::cast(maybe_vector);
     kind = vector->GetKind(vector_slot);
   }
@@ -2988,8 +2990,8 @@ RUNTIME_FUNCTION(Runtime_KeyedStoreIC_Miss) {
     RETURN_RESULT_OR_FAILURE(isolate, ic.Store(receiver, key, value));
   } else {
     DCHECK(IsStoreInArrayLiteralICKind(kind));
-    DCHECK(receiver->IsJSArray());
-    DCHECK(key->IsNumber());
+    DCHECK(IsJSArray(*receiver));
+    DCHECK(IsNumber(*key));
     StoreInArrayLiteralIC ic(isolate, vector, vector_slot);
     ic.UpdateState(receiver, key);
     RETURN_RESULT_OR_FAILURE(
@@ -3002,16 +3004,16 @@ RUNTIME_FUNCTION(Runtime_DefineKeyedOwnIC_Miss) {
   DCHECK_EQ(5, args.length());
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> value = args.at(0);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+  int slot = args.tagged_index_value_at(1);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(2);
   Handle<Object> receiver = args.at(3);
   Handle<Object> key = args.at(4);
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
 
   FeedbackSlotKind kind = FeedbackSlotKind::kDefineKeyedOwn;
   Handle<FeedbackVector> vector = Handle<FeedbackVector>();
-  if (!maybe_vector->IsUndefined(isolate)) {
-    DCHECK(maybe_vector->IsFeedbackVector());
+  if (!IsUndefined(*maybe_vector, isolate)) {
+    DCHECK(IsFeedbackVector(*maybe_vector));
     vector = Handle<FeedbackVector>::cast(maybe_vector);
     kind = vector->GetKind(vector_slot);
     DCHECK(IsDefineKeyedOwnICKind(kind));
@@ -3029,18 +3031,18 @@ RUNTIME_FUNCTION(Runtime_StoreInArrayLiteralIC_Miss) {
   DCHECK_EQ(5, args.length());
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> value = args.at(0);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(1);
+  int slot = args.tagged_index_value_at(1);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(2);
   Handle<Object> receiver = args.at(3);
   Handle<Object> key = args.at(4);
   Handle<FeedbackVector> vector = Handle<FeedbackVector>();
-  if (!maybe_vector->IsUndefined(isolate)) {
-    DCHECK(maybe_vector->IsFeedbackVector());
+  if (!IsUndefined(*maybe_vector, isolate)) {
+    DCHECK(IsFeedbackVector(*maybe_vector));
     vector = Handle<FeedbackVector>::cast(maybe_vector);
   }
-  DCHECK(receiver->IsJSArray());
-  DCHECK(key->IsNumber());
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  DCHECK(IsJSArray(*receiver));
+  DCHECK(IsNumber(*key));
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
   StoreInArrayLiteralIC ic(isolate, vector, vector_slot);
   RETURN_RESULT_OR_FAILURE(
       isolate, ic.Store(Handle<JSArray>::cast(receiver), key, value));
@@ -3089,12 +3091,12 @@ RUNTIME_FUNCTION(Runtime_ElementsTransitionAndStoreIC_Miss) {
   Handle<Object> key = args.at(1);
   Handle<Object> value = args.at(2);
   Handle<Map> map = args.at<Map>(3);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(4);
+  int slot = args.tagged_index_value_at(4);
   Handle<FeedbackVector> vector = args.at<FeedbackVector>(5);
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
   FeedbackSlotKind kind = vector->GetKind(vector_slot);
 
-  if (object->IsJSObject()) {
+  if (IsJSObject(*object)) {
     JSObject::TransitionElementsKind(Handle<JSObject>::cast(object),
                                      map->elements_kind());
   }
@@ -3115,93 +3117,165 @@ RUNTIME_FUNCTION(Runtime_ElementsTransitionAndStoreIC_Miss) {
   }
 }
 
-static bool CanFastCloneObject(Handle<Map> map) {
+namespace {
+
+enum class FastCloneObjectMode {
+  // The clone has the same map as the input.
+  kIdenticalMap,
+  // The clone is the empty object literal.
+  kEmptyObject,
+  // The clone has an empty object literal map.
+  kDifferentMap,
+  // The source map is to complicated to handle.
+  kNotSupported,
+};
+
+FastCloneObjectMode GetCloneModeForMap(Handle<Map> map, int flags,
+                                       Isolate* isolate) {
   DisallowGarbageCollection no_gc;
-  if (map->IsNullOrUndefinedMap()) return true;
-  if (!map->IsJSObjectMap() ||
-      !IsSmiOrObjectElementsKind(map->elements_kind()) ||
+  if (!IsJSObjectMap(*map)) {
+    // Everything that produces the empty object literal can be supported since
+    // we have a special case for that.
+    return IsNullOrUndefinedMap(*map) || IsBooleanMap(*map) ||
+                   IsHeapNumberMap(*map)
+               ? FastCloneObjectMode::kEmptyObject
+               : FastCloneObjectMode::kNotSupported;
+  }
+  if (!IsSmiOrObjectElementsKind(map->elements_kind()) ||
       !map->OnlyHasSimpleProperties()) {
-    return false;
+    return FastCloneObjectMode::kNotSupported;
+  }
+
+  // The clone must always start from an object literal map, it must be an
+  // instance of the object function, have the default prototype and not be a
+  // prototype itself. Only if the source map fits that criterion we can
+  // directly use it as the target map.
+  FastCloneObjectMode mode =
+      map->instance_type() == JS_OBJECT_TYPE &&
+              map->GetConstructor() == *isolate->object_function() &&
+              map->prototype() == *isolate->object_function_prototype() &&
+              !map->is_prototype_map()
+          ? FastCloneObjectMode::kIdenticalMap
+          : FastCloneObjectMode::kDifferentMap;
+
+  if (flags & ObjectLiteral::kHasNullPrototype || IsNull(map->prototype())) {
+    mode = FastCloneObjectMode::kDifferentMap;
   }
 
-  DescriptorArray descriptors = map->instance_descriptors();
+  Tagged<DescriptorArray> descriptors = map->instance_descriptors();
   for (InternalIndex i : map->IterateOwnDescriptors()) {
-    PropertyDetails details = descriptors.GetDetails(i);
-    Name key = descriptors.GetKey(i);
+    PropertyDetails details = descriptors->GetDetails(i);
+    Tagged<Name> key = descriptors->GetKey(i);
     if (details.kind() != PropertyKind::kData || !details.IsEnumerable() ||
-        key.IsPrivateName()) {
-      return false;
+        key->IsPrivateName()) {
+      return FastCloneObjectMode::kNotSupported;
+    }
+    if (!details.IsConfigurable() || details.IsReadOnly()) {
+      mode = FastCloneObjectMode::kDifferentMap;
     }
   }
 
-  return true;
-}
+  DCHECK_IMPLIES(mode == FastCloneObjectMode::kIdenticalMap,
+                 !map->is_prototype_map());
 
-static Handle<Map> FastCloneObjectMap(Isolate* isolate, Handle<Map> source_map,
-                                      int flags) {
-  SLOW_DCHECK(CanFastCloneObject(source_map));
-  Handle<JSFunction> constructor(isolate->native_context()->object_function(),
-                                 isolate);
-  DCHECK(constructor->has_initial_map());
-  Handle<Map> initial_map(constructor->initial_map(), isolate);
-  Handle<Map> map = initial_map;
+  return mode;
+}
 
-  if (source_map->IsJSObjectMap() && source_map->GetInObjectProperties() !=
-                                         initial_map->GetInObjectProperties()) {
-    int inobject_properties = source_map->GetInObjectProperties();
-    int instance_size =
-        JSObject::kHeaderSize + kTaggedSize * inobject_properties;
-    int unused = source_map->UnusedInObjectProperties();
-    DCHECK(instance_size <= JSObject::kMaxInstanceSize);
-    map = Map::CopyInitialMap(isolate, map, instance_size, inobject_properties,
-                              unused);
+bool CanFastCloneObjectWithDifferentMaps(Handle<Map> source_map,
+                                         Handle<Map> target_map,
+                                         Isolate* isolate) {
+  DisallowGarbageCollection no_gc;
+  // Ensure source and target have identical binary represenation of properties
+  // and elements as the IC relies on copying the raw bytes. This also excludes
+  // cases with non-enumerable properties or accessors on the source object.
+  if (source_map->instance_type() != JS_OBJECT_TYPE ||
+      target_map->instance_type() != JS_OBJECT_TYPE ||
+      !source_map->OnlyHasSimpleProperties() ||
+      !target_map->OnlyHasSimpleProperties() ||
+      source_map->elements_kind() != target_map->elements_kind() ||
+      !source_map->has_fast_elements()) {
+    return false;
   }
-
-  if (flags & ObjectLiteral::kHasNullPrototype) {
-    if (map.is_identical_to(initial_map)) {
-      map = Map::Copy(isolate, map, "ObjectWithNullProto");
-    }
-    Map::SetPrototype(isolate, map, isolate->factory()->null_value());
+  // Check that the source inobject properties are big enough to initialize all
+  // target slots, but not too big to fit.
+  // TODO(olivf): This restriction (and the same restriction on the backing
+  // store) could be lifted by properly initializing the target object instead
+  // of relying on copying empty slots.
+  int source_inobj_properties = source_map->GetInObjectProperties();
+  int target_inobj_properties = target_map->GetInObjectProperties();
+  int source_used_inobj_properties =
+      source_inobj_properties - source_map->UnusedPropertyFields();
+  if (source_inobj_properties < target_inobj_properties ||
+      source_used_inobj_properties > target_inobj_properties) {
+    return false;
   }
-
-  if (source_map->NumberOfOwnDescriptors() == 0) {
-    return map;
+  // The properties backing store must be of the same size as the clone ic again
+  // blindly copies it.
+  if (source_map->HasOutOfObjectProperties() !=
+          target_map->HasOutOfObjectProperties() ||
+      (target_map->HasOutOfObjectProperties() &&
+       source_map->UnusedPropertyFields() !=
+           target_map->UnusedPropertyFields())) {
+    return false;
   }
-  DCHECK(!source_map->IsNullOrUndefinedMap());
-
-  if (map.is_identical_to(initial_map)) {
-    map = Map::Copy(isolate, map, "InitializeClonedDescriptors");
+  // TODO(olivf, chrome:1204540) The clone ic blindly copies the bytes from
+  // source object to result object. Therefore it must be ensured that
+  // the both maps are in the same slack tracking state and the result map is
+  // always at least as generic in the element representations as the source.
+  // The former could be relieved by a slighly more clever obect initialization
+  // in the fast case. For the latter, since we currently do not have any way of
+  // ensuring this dependency we limit ourselves to the cases where nothing bad
+  // can happen, since the source is already as generic as possible.
+  if (source_map->IsInobjectSlackTrackingInProgress() ||
+      target_map->IsInobjectSlackTrackingInProgress()) {
+    // Only if they belong to the same root map we can ensure that they end
+    // slack tracking at the same time.
+    if (source_map->FindRootMap(isolate) != target_map->FindRootMap(isolate)) {
+      return false;
+    }
   }
-
-  Handle<DescriptorArray> source_descriptors(
-      source_map->instance_descriptors(isolate), isolate);
-  int size = source_map->NumberOfOwnDescriptors();
-  int slack = 0;
-  Handle<DescriptorArray> descriptors = DescriptorArray::CopyForFastObjectClone(
-      isolate, source_descriptors, size, slack);
-  map->InitializeDescriptors(isolate, *descriptors);
-  map->CopyUnusedPropertyFieldsAdjustedForInstanceSize(*source_map);
-
-  // Update bitfields
-  map->set_may_have_interesting_symbols(
-      source_map->may_have_interesting_symbols());
-
-  return map;
+  Tagged<DescriptorArray> descriptors = source_map->instance_descriptors();
+  Tagged<DescriptorArray> target_descriptors =
+      target_map->instance_descriptors();
+  for (InternalIndex i : target_map->IterateOwnDescriptors()) {
+    PropertyDetails details = descriptors->GetDetails(i);
+    PropertyDetails target_details = target_descriptors->GetDetails(i);
+    DCHECK_EQ(details.kind(), PropertyKind::kData);
+    DCHECK_EQ(target_details.kind(), PropertyKind::kData);
+    if (!details.representation().MostGenericInPlaceChange().Equals(
+            target_details.representation())) {
+      return false;
+    }
+  }
+  return true;
 }
 
+}  // namespace
+
 static MaybeHandle<JSObject> CloneObjectSlowPath(Isolate* isolate,
                                                  Handle<Object> source,
                                                  int flags) {
   Handle<JSObject> new_object;
   if (flags & ObjectLiteral::kHasNullPrototype) {
     new_object = isolate->factory()->NewJSObjectWithNullProto();
+  } else if (IsJSObject(*source) &&
+             JSObject::cast(*source)->map()->OnlyHasSimpleProperties()) {
+    Tagged<Map> source_map = JSObject::cast(*source)->map();
+    // TODO(olivf, chrome:1204540) It might be interesting to pick a map with
+    // more properties, depending how many properties are added by the
+    // surrounding literal.
+    int properties = source_map->GetInObjectProperties() -
+                     source_map->UnusedInObjectProperties();
+    Handle<Map> map = isolate->factory()->ObjectLiteralMapFromCache(
+        isolate->native_context(), properties);
+    new_object = isolate->factory()->NewFastOrSlowJSObjectFromMap(map);
   } else {
     Handle<JSFunction> constructor(isolate->native_context()->object_function(),
                                    isolate);
     new_object = isolate->factory()->NewJSObject(constructor);
   }
 
-  if (source->IsNullOrUndefined()) {
+  if (IsNullOrUndefined(*source)) {
     return new_object;
   }
 
@@ -3213,6 +3287,15 @@ static MaybeHandle<JSObject> CloneObjectSlowPath(Isolate* isolate,
   return new_object;
 }
 
+RUNTIME_FUNCTION(Runtime_CloneObjectIC_Slow) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(2, args.length());
+  Handle<Object> source = args.at(0);
+  int flags = args.smi_value_at(1);
+  RETURN_RESULT_OR_FAILURE(isolate,
+                           CloneObjectSlowPath(isolate, source, flags));
+}
+
 RUNTIME_FUNCTION(Runtime_CloneObjectIC_Miss) {
   HandleScope scope(isolate);
   DCHECK_EQ(4, args.length());
@@ -3220,21 +3303,55 @@ RUNTIME_FUNCTION(Runtime_CloneObjectIC_Miss) {
   int flags = args.smi_value_at(1);
 
   if (!MigrateDeprecated(isolate, source)) {
-    int index = args.tagged_index_value_at(2);
-    FeedbackSlot slot = FeedbackVector::ToSlot(index);
     Handle<HeapObject> maybe_vector = args.at<HeapObject>(3);
-    if (maybe_vector->IsFeedbackVector()) {
+    if (IsFeedbackVector(*maybe_vector)) {
+      int index = args.tagged_index_value_at(2);
+      FeedbackSlot slot = FeedbackVector::ToSlot(index);
       FeedbackNexus nexus(Handle<FeedbackVector>::cast(maybe_vector), slot);
-      if (!source->IsSmi() && !nexus.IsMegamorphic()) {
+      if (!IsSmi(*source) && !nexus.IsMegamorphic()) {
         Handle<Map> source_map(Handle<HeapObject>::cast(source)->map(),
                                isolate);
-        if (CanFastCloneObject(source_map)) {
-          Handle<Map> target_map =
-              FastCloneObjectMap(isolate, source_map, flags);
-          nexus.ConfigureCloneObject(source_map, target_map);
-          return *target_map;
+        FastCloneObjectMode clone_mode =
+            GetCloneModeForMap(source_map, flags, isolate);
+        switch (clone_mode) {
+          case FastCloneObjectMode::kIdenticalMap: {
+            nexus.ConfigureCloneObject(source_map,
+                                       MaybeObjectHandle(source_map));
+            // When returning a map the IC miss handler re-starts from the top.
+            return *source_map;
+          }
+          case FastCloneObjectMode::kEmptyObject: {
+            nexus.ConfigureCloneObject(source_map,
+                                       MaybeObjectHandle(Smi(0), isolate));
+            RETURN_RESULT_OR_FAILURE(
+                isolate, CloneObjectSlowPath(isolate, source, flags));
+          }
+          case FastCloneObjectMode::kDifferentMap: {
+            Handle<Object> res;
+            ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
+                isolate, res, CloneObjectSlowPath(isolate, source, flags));
+            Handle<Map> result_map(Handle<HeapObject>::cast(res)->map(),
+                                   isolate);
+            if (CanFastCloneObjectWithDifferentMaps(source_map, result_map,
+                                                    isolate)) {
+              DCHECK(result_map->OnlyHasSimpleProperties());
+              DCHECK_LE(source_map->GetInObjectProperties() -
+                            source_map->UnusedInObjectProperties(),
+                        result_map->GetInObjectProperties());
+              DCHECK_GE(source_map->GetInObjectProperties(),
+                        result_map->GetInObjectProperties());
+              nexus.ConfigureCloneObject(source_map,
+                                         MaybeObjectHandle(result_map));
+            } else {
+              nexus.ConfigureMegamorphic();
+            }
+            return *res;
+          }
+          case FastCloneObjectMode::kNotSupported: {
+            break;
+          }
         }
-
+        DCHECK(clone_mode == FastCloneObjectMode::kNotSupported);
         nexus.ConfigureMegamorphic();
       }
     }
@@ -3278,7 +3395,7 @@ RUNTIME_FUNCTION(Runtime_LoadPropertyWithInterceptor) {
   Handle<Object> receiver = args.at(1);
   Handle<JSObject> holder = args.at<JSObject>(2);
 
-  if (!receiver->IsJSReceiver()) {
+  if (!IsJSReceiver(*receiver)) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
         isolate, receiver, Object::ConvertReceiver(isolate, receiver));
   }
@@ -3314,9 +3431,9 @@ RUNTIME_FUNCTION(Runtime_LoadPropertyWithInterceptor) {
 
   if (it.IsFound()) return *result;
 
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(3);
+  int slot = args.tagged_index_value_at(3);
   Handle<FeedbackVector> vector = args.at<FeedbackVector>(4);
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
   FeedbackSlotKind slot_kind = vector->GetKind(vector_slot);
   // It could actually be any kind of load IC slot here but the predicate
   // handles all the cases properly.
@@ -3340,11 +3457,11 @@ RUNTIME_FUNCTION(Runtime_StorePropertyWithInterceptor) {
   // TODO(ishell): Cache interceptor_holder in the store handler like we do
   // for LoadHandler::kInterceptor case.
   Handle<JSObject> interceptor_holder = receiver;
-  if (receiver->IsJSGlobalProxy() &&
+  if (IsJSGlobalProxy(*receiver) &&
       (!receiver->HasNamedInterceptor() ||
-       receiver->GetNamedInterceptor().non_masking())) {
+       receiver->GetNamedInterceptor()->non_masking())) {
     interceptor_holder =
-        handle(JSObject::cast(receiver->map().prototype()), isolate);
+        handle(JSObject::cast(receiver->map()->prototype()), isolate);
   }
   DCHECK(interceptor_holder->HasNamedInterceptor());
   {
@@ -3409,15 +3526,15 @@ RUNTIME_FUNCTION(Runtime_KeyedHasIC_Miss) {
   // Runtime functions don't follow the IC's calling convention.
   Handle<Object> receiver = args.at(0);
   Handle<Object> key = args.at(1);
-  Handle<TaggedIndex> slot = args.at<TaggedIndex>(2);
+  int slot = args.tagged_index_value_at(2);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(3);
 
   Handle<FeedbackVector> vector = Handle<FeedbackVector>();
-  if (!maybe_vector->IsUndefined(isolate)) {
-    DCHECK(maybe_vector->IsFeedbackVector());
+  if (!IsUndefined(*maybe_vector, isolate)) {
+    DCHECK(IsFeedbackVector(*maybe_vector));
     vector = Handle<FeedbackVector>::cast(maybe_vector);
   }
-  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot->value());
+  FeedbackSlot vector_slot = FeedbackVector::ToSlot(slot);
   KeyedLoadIC ic(isolate, vector, vector_slot, FeedbackSlotKind::kHasKeyed);
   ic.UpdateState(receiver, key);
   RETURN_RESULT_OR_FAILURE(isolate, ic.Load(receiver, key));
@@ -3435,16 +3552,16 @@ RUNTIME_FUNCTION(Runtime_HasElementWithInterceptor) {
     PropertyCallbackArguments arguments(isolate, interceptor->data(), *receiver,
                                         *receiver, Just(kDontThrow));
 
-    if (!interceptor->query().IsUndefined(isolate)) {
+    if (!IsUndefined(interceptor->query(), isolate)) {
       Handle<Object> result = arguments.CallIndexedQuery(interceptor, index);
       if (!result.is_null()) {
         int32_t value;
-        CHECK(result->ToInt32(&value));
+        CHECK(Object::ToInt32(*result, &value));
         if (value == ABSENT) return ReadOnlyRoots(isolate).false_value();
         arguments.AcceptSideEffects();
         return ReadOnlyRoots(isolate).true_value();
       }
-    } else if (!interceptor->getter().IsUndefined(isolate)) {
+    } else if (!IsUndefined(interceptor->getter(), isolate)) {
       Handle<Object> result = arguments.CallIndexedGetter(interceptor, index);
       if (!result.is_null()) {
         arguments.AcceptSideEffects();
@@ -3460,8 +3577,7 @@ RUNTIME_FUNCTION(Runtime_HasElementWithInterceptor) {
   it.Next();
   Maybe<bool> maybe = JSReceiver::HasProperty(&it);
   if (maybe.IsNothing()) return ReadOnlyRoots(isolate).exception();
-  return maybe.FromJust() ? ReadOnlyRoots(isolate).true_value()
-                          : ReadOnlyRoots(isolate).false_value();
+  return ReadOnlyRoots(isolate).boolean_value(maybe.FromJust());
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/ic/ic.h b/deps/v8/src/ic/ic.h
index af272166b12e24..138938b9118637 100644
--- a/deps/v8/src/ic/ic.h
+++ b/deps/v8/src/ic/ic.h
@@ -64,7 +64,7 @@ class IC {
   static inline bool IsHandler(MaybeObject object);
 
   // Nofity the IC system that a feedback has changed.
-  static void OnFeedbackChanged(Isolate* isolate, FeedbackVector vector,
+  static void OnFeedbackChanged(Isolate* isolate, Tagged<FeedbackVector> vector,
                                 FeedbackSlot slot, const char* reason);
 
   void OnFeedbackChanged(const char* reason);
@@ -110,7 +110,8 @@ class IC {
   StubCache* stub_cache();
 
   void CopyICToMegamorphicCache(Handle<Name> name);
-  bool IsTransitionOfMonomorphicTarget(Map source_map, Map target_map);
+  bool IsTransitionOfMonomorphicTarget(Tagged<Map> source_map,
+                                       Tagged<Map> target_map);
   void SetCache(Handle<Name> name, Handle<Object> handler);
   void SetCache(Handle<Name> name, const MaybeObjectHandle& handler);
   FeedbackSlotKind kind() const { return kind_; }
@@ -143,9 +144,9 @@ class IC {
     }
   }
 
-  Map FirstTargetMap() {
+  Tagged<Map> FirstTargetMap() {
     FindTargetMaps();
-    return !target_maps_.empty() ? *target_maps_[0] : Map();
+    return !target_maps_.empty() ? *target_maps_[0] : Tagged<Map>();
   }
 
   const FeedbackNexus* nexus() const { return &nexus_; }
diff --git a/deps/v8/src/ic/keyed-store-generic.cc b/deps/v8/src/ic/keyed-store-generic.cc
index dbc8620113e541..48358ea0d03fb7 100644
--- a/deps/v8/src/ic/keyed-store-generic.cc
+++ b/deps/v8/src/ic/keyed-store-generic.cc
@@ -300,7 +300,7 @@ void KeyedStoreGenericAssembler::TryRewriteElements(
   BIND(&perform_transition);
   {
     if (IsDoubleElementsKind(from_kind) != IsDoubleElementsKind(to_kind)) {
-      TNode<IntPtrT> capacity = SmiUntag(LoadFixedArrayBaseLength(elements));
+      TNode<IntPtrT> capacity = LoadAndUntagFixedArrayBaseLength(elements);
       GrowElementsCapacity(receiver, elements, from_kind, to_kind, capacity,
                            capacity, bailout);
     }
@@ -591,14 +591,15 @@ void KeyedStoreGenericAssembler::EmitGenericElementStore(
   Label if_array(this);
   GotoIf(IsJSArrayInstanceType(instance_type), &if_array);
   {
-    TNode<IntPtrT> capacity = SmiUntag(LoadFixedArrayBaseLength(elements));
+    TNode<IntPtrT> capacity = LoadAndUntagFixedArrayBaseLength(elements);
     Branch(UintPtrLessThan(index, capacity), &if_in_bounds, &if_grow);
   }
   BIND(&if_array);
   {
-    TNode<IntPtrT> length = SmiUntag(LoadFastJSArrayLength(CAST(receiver)));
+    TNode<IntPtrT> length =
+        PositiveSmiUntag(LoadFastJSArrayLength(CAST(receiver)));
     GotoIf(UintPtrLessThan(index, length), &if_in_bounds);
-    TNode<IntPtrT> capacity = SmiUntag(LoadFixedArrayBaseLength(elements));
+    TNode<IntPtrT> capacity = LoadAndUntagFixedArrayBaseLength(elements);
     GotoIf(UintPtrGreaterThanOrEqual(index, capacity), &if_grow);
     Branch(WordEqual(index, length), &if_increment_length_by_one,
            &if_bump_length_with_gap);
@@ -1017,9 +1018,9 @@ void KeyedStoreGenericAssembler::EmitGenericPropertyStore(
       }
       Label add_dictionary_property_slow(this);
       InvalidateValidityCellIfPrototype(receiver_map, bitfield3);
-      UpdateMayHaveInterestingSymbol(properties, name);
-      Add<PropertyDictionary>(properties, name, p->value(),
-                              &add_dictionary_property_slow);
+      UpdateMayHaveInterestingProperty(properties, name);
+      AddToDictionary<PropertyDictionary>(properties, name, p->value(),
+                                          &add_dictionary_property_slow);
       exit_point->Return(p->value());
 
       BIND(&add_dictionary_property_slow);
diff --git a/deps/v8/src/ic/stub-cache.cc b/deps/v8/src/ic/stub-cache.cc
index c3457563a65326..8a5dfd2e447e93 100644
--- a/deps/v8/src/ic/stub-cache.cc
+++ b/deps/v8/src/ic/stub-cache.cc
@@ -29,9 +29,9 @@ void StubCache::Initialize() {
 // Hash algorithm for the primary table. This algorithm is replicated in
 // the AccessorAssembler.  Returns an index into the table that
 // is scaled by 1 << kCacheIndexShift.
-int StubCache::PrimaryOffset(Name name, Map map) {
+int StubCache::PrimaryOffset(Tagged<Name> name, Tagged<Map> map) {
   // Compute the hash of the name (use entire hash field).
-  uint32_t field = name.RawHash();
+  uint32_t field = name->RawHash();
   DCHECK(Name::IsHashFieldComputed(field));
   // Using only the low bits in 64-bit mode is unlikely to increase the
   // risk of collision even if the heap is spread over an area larger than
@@ -47,7 +47,7 @@ int StubCache::PrimaryOffset(Name name, Map map) {
 // assembler. This hash should be sufficiently different from the primary one
 // in order to avoid collisions for minified code with short names.
 // Returns an index into the table that is scaled by 1 << kCacheIndexShift.
-int StubCache::SecondaryOffset(Name name, Map old_map) {
+int StubCache::SecondaryOffset(Tagged<Name> name, Tagged<Map> old_map) {
   uint32_t name_low32bits = static_cast<uint32_t>(name.ptr());
   uint32_t map_low32bits = static_cast<uint32_t>(old_map.ptr());
   uint32_t key = (map_low32bits + name_low32bits);
@@ -55,24 +55,24 @@ int StubCache::SecondaryOffset(Name name, Map old_map) {
   return key & ((kSecondaryTableSize - 1) << kCacheIndexShift);
 }
 
-int StubCache::PrimaryOffsetForTesting(Name name, Map map) {
+int StubCache::PrimaryOffsetForTesting(Tagged<Name> name, Tagged<Map> map) {
   return PrimaryOffset(name, map);
 }
 
-int StubCache::SecondaryOffsetForTesting(Name name, Map map) {
+int StubCache::SecondaryOffsetForTesting(Tagged<Name> name, Tagged<Map> map) {
   return SecondaryOffset(name, map);
 }
 
 #ifdef DEBUG
 namespace {
 
-bool CommonStubCacheChecks(StubCache* stub_cache, Name name, Map map,
-                           MaybeObject handler) {
+bool CommonStubCacheChecks(StubCache* stub_cache, Tagged<Name> name,
+                           Tagged<Map> map, MaybeObject handler) {
   // Validate that the name and handler do not move on scavenge, and that we
   // can use identity checks instead of structural equality checks.
   DCHECK(!Heap::InYoungGeneration(name));
   DCHECK(!Heap::InYoungGeneration(handler));
-  DCHECK(name.IsUniqueName());
+  DCHECK(IsUniqueName(name));
   if (handler->ptr() != kNullAddress) DCHECK(IC::IsHandler(handler));
   return true;
 }
@@ -80,7 +80,7 @@ bool CommonStubCacheChecks(StubCache* stub_cache, Name name, Map map,
 }  // namespace
 #endif
 
-void StubCache::Set(Name name, Map map, MaybeObject handler) {
+void StubCache::Set(Tagged<Name> name, Tagged<Map> map, MaybeObject handler) {
   DCHECK(CommonStubCacheChecks(this, name, map, handler));
 
   // Compute the primary entry.
@@ -93,9 +93,9 @@ void StubCache::Set(Name name, Map map, MaybeObject handler) {
   if (old_handler != MaybeObject::FromObject(
                          isolate()->builtins()->code(Builtin::kIllegal)) &&
       !primary->map.IsSmi()) {
-    Map old_map =
+    Tagged<Map> old_map =
         Map::cast(StrongTaggedValue::ToObject(isolate(), primary->map));
-    Name old_name =
+    Tagged<Name> old_name =
         Name::cast(StrongTaggedValue::ToObject(isolate(), primary->key));
     int secondary_offset = SecondaryOffset(old_name, old_map);
     Entry* secondary = entry(secondary_, secondary_offset);
@@ -109,7 +109,7 @@ void StubCache::Set(Name name, Map map, MaybeObject handler) {
   isolate()->counters()->megamorphic_stub_cache_updates()->Increment();
 }
 
-MaybeObject StubCache::Get(Name name, Map map) {
+MaybeObject StubCache::Get(Tagged<Name> name, Tagged<Map> map) {
   DCHECK(CommonStubCacheChecks(this, name, map, MaybeObject()));
   int primary_offset = PrimaryOffset(name, map);
   Entry* primary = entry(primary_, primary_offset);
@@ -127,7 +127,7 @@ MaybeObject StubCache::Get(Name name, Map map) {
 void StubCache::Clear() {
   MaybeObject empty =
       MaybeObject::FromObject(isolate_->builtins()->code(Builtin::kIllegal));
-  Name empty_string = ReadOnlyRoots(isolate()).empty_string();
+  Tagged<Name> empty_string = ReadOnlyRoots(isolate()).empty_string();
   for (int i = 0; i < kPrimaryTableSize; i++) {
     primary_[i].key = StrongTaggedValue(empty_string);
     primary_[i].map = StrongTaggedValue(Smi::zero());
diff --git a/deps/v8/src/ic/stub-cache.h b/deps/v8/src/ic/stub-cache.h
index 2bee68c8938726..5c0b6e61fa197f 100644
--- a/deps/v8/src/ic/stub-cache.h
+++ b/deps/v8/src/ic/stub-cache.h
@@ -44,8 +44,8 @@ class V8_EXPORT_PRIVATE StubCache {
 
   void Initialize();
   // Access cache for entry hash(name, map).
-  void Set(Name name, Map map, MaybeObject handler);
-  MaybeObject Get(Name name, Map map);
+  void Set(Tagged<Name> name, Tagged<Map> map, MaybeObject handler);
+  MaybeObject Get(Tagged<Name> name, Tagged<Map> map);
   // Clear the lookup table (@ mark compact collection).
   void Clear();
 
@@ -90,8 +90,8 @@ class V8_EXPORT_PRIVATE StubCache {
   static const int kSecondaryTableBits = 9;
   static const int kSecondaryTableSize = (1 << kSecondaryTableBits);
 
-  static int PrimaryOffsetForTesting(Name name, Map map);
-  static int SecondaryOffsetForTesting(Name name, Map map);
+  static int PrimaryOffsetForTesting(Tagged<Name> name, Tagged<Map> map);
+  static int SecondaryOffsetForTesting(Tagged<Name> name, Tagged<Map> map);
 
   // The constructor is made public only for the purposes of testing.
   explicit StubCache(Isolate* isolate);
@@ -109,12 +109,12 @@ class V8_EXPORT_PRIVATE StubCache {
   // Hash algorithm for the primary table.  This algorithm is replicated in
   // assembler for every architecture.  Returns an index into the table that
   // is scaled by 1 << kCacheIndexShift.
-  static int PrimaryOffset(Name name, Map map);
+  static int PrimaryOffset(Tagged<Name> name, Tagged<Map> map);
 
   // Hash algorithm for the secondary table.  This algorithm is replicated in
   // assembler for every architecture.  Returns an index into the table that
   // is scaled by 1 << kCacheIndexShift.
-  static int SecondaryOffset(Name name, Map map);
+  static int SecondaryOffset(Tagged<Name> name, Tagged<Map> map);
 
   // Compute the entry for a given offset in exactly the same way as
   // we do in generated code.  We generate an hash code that already
diff --git a/deps/v8/src/ic/unary-op-assembler.cc b/deps/v8/src/ic/unary-op-assembler.cc
index fe3dc599cac175..d5b9ae0be87bba 100644
--- a/deps/v8/src/ic/unary-op-assembler.cc
+++ b/deps/v8/src/ic/unary-op-assembler.cc
@@ -28,9 +28,12 @@ class UnaryOpAssemblerImpl final : public CodeStubAssembler {
     TVARIABLE(BigInt, var_bigint);
     TVARIABLE(Object, var_result);
     Label if_number(this), if_bigint(this, Label::kDeferred), out(this);
+    LazyNode<HeapObject> get_vector = [&]() { return maybe_feedback_vector; };
+    FeedbackValues feedback = {&var_feedback, &get_vector, &slot,
+                               update_feedback_mode};
     TaggedToWord32OrBigIntWithFeedback(context, value, &if_number, &var_word32,
                                        &if_bigint, nullptr, &var_bigint,
-                                       &var_feedback);
+                                       feedback);
 
     // Number case.
     BIND(&if_number);
@@ -137,8 +140,10 @@ class UnaryOpAssemblerImpl final : public CodeStubAssembler {
     TVARIABLE(Object, var_result);
     TVARIABLE(Float64T, var_float_value);
     TVARIABLE(Smi, var_feedback, SmiConstant(BinaryOperationFeedback::kNone));
+    TVARIABLE(Object, var_exception);
     Label start(this, {&var_value, &var_feedback}), end(this);
     Label do_float_op(this, &var_float_value);
+    Label if_exception(this, Label::kDeferred);
     Goto(&start);
     // We might have to try again after ToNumeric conversion.
     BIND(&start);
@@ -199,12 +204,23 @@ class UnaryOpAssemblerImpl final : public CodeStubAssembler {
         CSA_DCHECK(this, SmiEqual(var_feedback.value(),
                                   SmiConstant(BinaryOperationFeedback::kNone)));
         OverwriteFeedback(&var_feedback, BinaryOperationFeedback::kAny);
-        var_value = CallBuiltin(Builtin::kNonNumberToNumeric, context,
-                                value_heap_object);
+        {
+          ScopedExceptionHandler handler(this, &if_exception, &var_exception);
+          var_value = CallBuiltin(Builtin::kNonNumberToNumeric, context,
+                                  value_heap_object);
+        }
         Goto(&start);
       }
     }
 
+    BIND(&if_exception);
+    {
+      UpdateFeedback(var_feedback.value(), maybe_feedback_vector, slot,
+                     update_feedback_mode);
+      CallRuntime(Runtime::kReThrow, context, var_exception.value());
+      Unreachable();
+    }
+
     BIND(&do_float_op);
     {
       CombineFeedback(&var_feedback, BinaryOperationFeedback::kNumber);
diff --git a/deps/v8/src/init/bootstrapper.cc b/deps/v8/src/init/bootstrapper.cc
index 69d01ff33902aa..2beaf45b14089b 100644
--- a/deps/v8/src/init/bootstrapper.cc
+++ b/deps/v8/src/init/bootstrapper.cc
@@ -88,7 +88,7 @@ namespace internal {
 
 void SourceCodeCache::Initialize(Isolate* isolate, bool create_heap_objects) {
   cache_ = create_heap_objects ? ReadOnlyRoots(isolate).empty_fixed_array()
-                               : FixedArray();
+                               : Tagged<FixedArray>();
 }
 
 void SourceCodeCache::Iterate(RootVisitor* v) {
@@ -97,11 +97,11 @@ void SourceCodeCache::Iterate(RootVisitor* v) {
 
 bool SourceCodeCache::Lookup(Isolate* isolate, base::Vector<const char> name,
                              Handle<SharedFunctionInfo>* handle) {
-  for (int i = 0; i < cache_.length(); i += 2) {
-    SeqOneByteString str = SeqOneByteString::cast(cache_.get(i));
-    if (str.IsOneByteEqualTo(name)) {
+  for (int i = 0; i < cache_->length(); i += 2) {
+    Tagged<SeqOneByteString> str = SeqOneByteString::cast(cache_->get(i));
+    if (str->IsOneByteEqualTo(name)) {
       *handle = Handle<SharedFunctionInfo>(
-          SharedFunctionInfo::cast(cache_.get(i + 1)), isolate);
+          SharedFunctionInfo::cast(cache_->get(i + 1)), isolate);
       return true;
     }
   }
@@ -112,10 +112,10 @@ void SourceCodeCache::Add(Isolate* isolate, base::Vector<const char> name,
                           Handle<SharedFunctionInfo> shared) {
   Factory* factory = isolate->factory();
   HandleScope scope(isolate);
-  int length = cache_.length();
+  int length = cache_->length();
   Handle<FixedArray> new_array =
       factory->NewFixedArray(length + 2, AllocationType::kOld);
-  cache_.CopyTo(0, *new_array, 0, cache_.length());
+  cache_->CopyTo(0, *new_array, 0, cache_->length());
   cache_ = *new_array;
   Handle<String> str =
       factory
@@ -123,15 +123,15 @@ void SourceCodeCache::Add(Isolate* isolate, base::Vector<const char> name,
                                  AllocationType::kOld)
           .ToHandleChecked();
   DCHECK(!str.is_null());
-  cache_.set(length, *str);
-  cache_.set(length + 1, *shared);
-  Script::cast(shared->script()).set_type(type_);
+  cache_->set(length, *str);
+  cache_->set(length + 1, *shared);
+  Script::cast(shared->script())->set_type(type_);
 }
 
 Bootstrapper::Bootstrapper(Isolate* isolate)
     : isolate_(isolate),
       nesting_(0),
-      extensions_cache_(Script::TYPE_EXTENSION) {}
+      extensions_cache_(Script::Type::kExtension) {}
 
 void Bootstrapper::Initialize(bool create_heap_objects) {
   extensions_cache_.Initialize(isolate_, create_heap_objects);
@@ -184,7 +184,7 @@ class Genesis {
   Builtins* builtins() const { return isolate_->builtins(); }
   Heap* heap() const { return isolate_->heap(); }
 
-  Handle<Context> result() { return result_; }
+  Handle<NativeContext> result() { return result_; }
 
   Handle<JSGlobalProxy> global_proxy() { return global_proxy_; }
 
@@ -242,10 +242,14 @@ class Genesis {
 #define DECLARE_FEATURE_INITIALIZATION(id, descr) void InitializeGlobal_##id();
 
   HARMONY_INPROGRESS(DECLARE_FEATURE_INITIALIZATION)
+  JAVASCRIPT_INPROGRESS_FEATURES(DECLARE_FEATURE_INITIALIZATION)
   HARMONY_STAGED(DECLARE_FEATURE_INITIALIZATION)
+  JAVASCRIPT_STAGED_FEATURES(DECLARE_FEATURE_INITIALIZATION)
   HARMONY_SHIPPING(DECLARE_FEATURE_INITIALIZATION)
+  JAVASCRIPT_SHIPPING_FEATURES(DECLARE_FEATURE_INITIALIZATION)
 #undef DECLARE_FEATURE_INITIALIZATION
   void InitializeGlobal_regexp_linear_flag();
+  void InitializeGlobal_sharedarraybuffer();
 
   enum ArrayBufferKind { ARRAY_BUFFER, SHARED_ARRAY_BUFFER };
   Handle<JSFunction> CreateArrayBuffer(Handle<String> name,
@@ -310,7 +314,7 @@ class Genesis {
   static bool CompileExtension(Isolate* isolate, v8::Extension* extension);
 
   Isolate* isolate_;
-  Handle<Context> result_;
+  Handle<NativeContext> result_;
   Handle<NativeContext> native_context_;
   Handle<JSGlobalProxy> global_proxy_;
 
@@ -326,21 +330,21 @@ void Bootstrapper::Iterate(RootVisitor* v) {
   v->Synchronize(VisitorSynchronization::kExtensions);
 }
 
-Handle<Context> Bootstrapper::CreateEnvironment(
+Handle<NativeContext> Bootstrapper::CreateEnvironment(
     MaybeHandle<JSGlobalProxy> maybe_global_proxy,
     v8::Local<v8::ObjectTemplate> global_proxy_template,
     v8::ExtensionConfiguration* extensions, size_t context_snapshot_index,
     v8::DeserializeEmbedderFieldsCallback embedder_fields_deserializer,
     v8::MicrotaskQueue* microtask_queue) {
   HandleScope scope(isolate_);
-  Handle<Context> env;
+  Handle<NativeContext> env;
   {
     Genesis genesis(isolate_, maybe_global_proxy, global_proxy_template,
                     context_snapshot_index, embedder_fields_deserializer,
                     microtask_queue);
     env = genesis.result();
     if (env.is_null() || !InstallExtensions(env, extensions)) {
-      return Handle<Context>();
+      return {};
     }
   }
   LogAllMaps();
@@ -440,6 +444,7 @@ V8_NOINLINE Handle<JSFunction> CreateFunctionForBuiltinWithPrototype(
   }
   Handle<Map> initial_map =
       factory->NewMap(type, instance_size, elements_kind, inobject_properties);
+  initial_map->SetConstructor(*result);
   if (type == JS_FUNCTION_TYPE) {
     DCHECK_EQ(instance_size, JSFunction::kSizeWithPrototype);
     // Since we are creating an initial map for JSFunction objects with
@@ -449,7 +454,7 @@ V8_NOINLINE Handle<JSFunction> CreateFunctionForBuiltinWithPrototype(
   // TODO(littledan): Why do we have this is_generator test when
   // NewFunctionPrototype already handles finding an appropriately
   // shared prototype?
-  if (!IsResumableFunction(info->kind()) && prototype->IsTheHole(isolate)) {
+  if (!IsResumableFunction(info->kind()) && IsTheHole(*prototype, isolate)) {
     prototype = factory->NewFunctionPrototype(result);
   }
   JSFunction::SetInitialMap(isolate, result, initial_map, prototype);
@@ -488,7 +493,7 @@ V8_NOINLINE Handle<JSFunction> CreateFunction(
 
   // Make the resulting JSFunction object fast.
   JSObject::MakePrototypesFast(result, kStartAtReceiver, isolate);
-  result->shared().set_native(true);
+  result->shared()->set_native(true);
   return result;
 }
 
@@ -520,31 +525,6 @@ V8_NOINLINE Handle<JSFunction> InstallFunction(
                          instance_size, inobject_properties, prototype, call);
 }
 
-V8_NOINLINE Handle<JSFunction> CreateSharedObjectConstructor(
-    Isolate* isolate, Handle<String> name, InstanceType type, int instance_size,
-    int inobject_properties, ElementsKind element_kind, Builtin builtin) {
-  Factory* factory = isolate->factory();
-  Handle<SharedFunctionInfo> info = factory->NewSharedFunctionInfoForBuiltin(
-      name, builtin, FunctionKind::kNormalFunction);
-  info->set_language_mode(LanguageMode::kStrict);
-  Handle<JSFunction> constructor =
-      Factory::JSFunctionBuilder{isolate, info, isolate->native_context()}
-          .set_map(isolate->strict_function_with_readonly_prototype_map())
-          .Build();
-  Handle<Map> instance_map =
-      factory->NewMap(type, instance_size, element_kind, inobject_properties,
-                      AllocationType::kSharedMap);
-  // Shared objects have fixed layout ahead of time, so there's no slack.
-  instance_map->SetInObjectUnusedPropertyFields(0);
-  // Shared objects are not extensible and have a null prototype.
-  instance_map->set_is_extensible(false);
-  JSFunction::SetInitialMap(isolate, constructor, instance_map,
-                            factory->null_value(), factory->null_value());
-  constructor->map().SetConstructor(ReadOnlyRoots(isolate).null_value());
-  constructor->map().set_has_non_instance_prototype(true);
-  return constructor;
-}
-
 // This sets a constructor instance type on the constructor map which will be
 // used in IsXxxConstructor() predicates. Having such predicates helps figuring
 // out if a protector cell should be invalidated. If there are no protector
@@ -558,17 +538,17 @@ V8_NOINLINE void SetConstructorInstanceType(Isolate* isolate,
   DCHECK(InstanceTypeChecker::IsJSFunction(constructor_type));
   DCHECK_NE(constructor_type, JS_FUNCTION_TYPE);
 
-  Map map = constructor->map();
+  Tagged<Map> map = constructor->map();
 
   // Check we don't accidentally change one of the existing maps.
   DCHECK_NE(map, *isolate->strict_function_map());
   DCHECK_NE(map, *isolate->strict_function_with_readonly_prototype_map());
   // Constructor function map is always a root map, and thus we don't have to
   // deal with updating the whole transition tree.
-  DCHECK(map.GetBackPointer().IsUndefined(isolate));
-  DCHECK_EQ(JS_FUNCTION_TYPE, map.instance_type());
+  DCHECK(IsUndefined(map->GetBackPointer(), isolate));
+  DCHECK_EQ(JS_FUNCTION_TYPE, map->instance_type());
 
-  map.set_instance_type(constructor_type);
+  map->set_instance_type(constructor_type);
 }
 
 V8_NOINLINE Handle<JSFunction> SimpleCreateFunction(Isolate* isolate,
@@ -581,14 +561,14 @@ V8_NOINLINE Handle<JSFunction> SimpleCreateFunction(Isolate* isolate,
       CreateFunctionForBuiltinWithoutPrototype(isolate, name, call);
   // Make the resulting JSFunction object fast.
   JSObject::MakePrototypesFast(fun, kStartAtReceiver, isolate);
-  fun->shared().set_native(true);
+  fun->shared()->set_native(true);
 
   if (adapt) {
-    fun->shared().set_internal_formal_parameter_count(JSParameterCount(len));
+    fun->shared()->set_internal_formal_parameter_count(JSParameterCount(len));
   } else {
-    fun->shared().DontAdaptArguments();
+    fun->shared()->DontAdaptArguments();
   }
-  fun->shared().set_length(len);
+  fun->shared()->set_length(len);
   return fun;
 }
 
@@ -615,6 +595,27 @@ V8_NOINLINE Handle<JSFunction> InstallFunctionAtSymbol(
   return fun;
 }
 
+V8_NOINLINE Handle<JSFunction> CreateSharedObjectConstructor(
+    Isolate* isolate, Handle<String> name, Handle<Map> instance_map,
+    Builtin builtin) {
+  Factory* factory = isolate->factory();
+  Handle<SharedFunctionInfo> info = factory->NewSharedFunctionInfoForBuiltin(
+      name, builtin, FunctionKind::kNormalFunction);
+  info->set_language_mode(LanguageMode::kStrict);
+  Handle<JSFunction> constructor =
+      Factory::JSFunctionBuilder{isolate, info, isolate->native_context()}
+          .set_map(isolate->strict_function_with_readonly_prototype_map())
+          .Build();
+  constructor->set_prototype_or_initial_map(*instance_map, kReleaseStore);
+
+  JSObject::AddProperty(
+      isolate, constructor, factory->has_instance_symbol(),
+      handle(isolate->native_context()->shared_space_js_object_has_instance(),
+             isolate),
+      static_cast<PropertyAttributes>(DONT_ENUM | DONT_DELETE | READ_ONLY));
+  return constructor;
+}
+
 V8_NOINLINE void SimpleInstallGetterSetter(Isolate* isolate,
                                            Handle<JSObject> base,
                                            Handle<String> name,
@@ -632,7 +633,9 @@ V8_NOINLINE void SimpleInstallGetterSetter(Isolate* isolate,
   Handle<JSFunction> setter =
       SimpleCreateFunction(isolate, setter_name, call_setter, 1, true);
 
-  JSObject::DefineAccessor(base, name, getter, setter, DONT_ENUM).Check();
+  JSObject::DefineOwnAccessorIgnoreAttributes(base, name, getter, setter,
+                                              DONT_ENUM)
+      .Check();
 }
 
 void SimpleInstallGetterSetter(Isolate* isolate, Handle<JSObject> base,
@@ -656,7 +659,8 @@ V8_NOINLINE Handle<JSFunction> SimpleInstallGetter(Isolate* isolate,
 
   Handle<Object> setter = isolate->factory()->undefined_value();
 
-  JSObject::DefineAccessor(base, property_name, getter, setter, DONT_ENUM)
+  JSObject::DefineOwnAccessorIgnoreAttributes(base, property_name, getter,
+                                              setter, DONT_ENUM)
       .Check();
 
   return getter;
@@ -707,6 +711,29 @@ void InstallToStringTag(Isolate* isolate, Handle<JSObject> holder,
                      isolate->factory()->InternalizeUtf8String(value));
 }
 
+// Create a map for result objects returned from builtins in such a way that
+// it's exactly the same map as the one produced by object literals. E.g.,
+// iterator result objects have the same map as literals in the form `{value,
+// done}`.
+//
+// This way we have better sharing of maps (i.e. less polymorphism) and also
+// make it possible to hit the fast-paths in various builtins (i.e. promises and
+// collections) with user defined iterators.
+template <size_t N>
+Handle<Map> CreateLiteralObjectMapFromCache(
+    Isolate* isolate, const std::array<Handle<Name>, N>& properties) {
+  Factory* factory = isolate->factory();
+  Handle<NativeContext> native_context = isolate->native_context();
+  Handle<Map> map = factory->ObjectLiteralMapFromCache(native_context, N);
+  for (Handle<Name> name : properties) {
+    map = Map::CopyWithField(isolate, map, name, FieldType::Any(isolate), NONE,
+                             PropertyConstness::kConst,
+                             Representation::Tagged(), INSERT_TRANSITION)
+              .ToHandleChecked();
+  }
+  return map;
+}
+
 }  // namespace
 
 Handle<JSFunction> Genesis::CreateEmptyFunction() {
@@ -721,18 +748,21 @@ Handle<JSFunction> Genesis::CreateEmptyFunction() {
   Handle<JSFunction> empty_function =
       CreateFunctionForBuiltin(isolate(), factory()->empty_string(),
                                empty_function_map, Builtin::kEmptyFunction);
+  empty_function_map->SetConstructor(*empty_function);
   native_context()->set_empty_function(*empty_function);
 
   // --- E m p t y ---
-  Handle<String> source = factory()->NewStringFromStaticChars("() {}");
+  Handle<String> source = factory()->InternalizeString("() {}");
   Handle<Script> script = factory()->NewScript(source);
-  script->set_type(Script::TYPE_NATIVE);
+  script->set_type(Script::Type::kNative);
   Handle<WeakFixedArray> infos = factory()->NewWeakFixedArray(2);
   script->set_shared_function_infos(*infos);
-  empty_function->shared().set_raw_scope_info(
-      ReadOnlyRoots(isolate()).empty_function_scope_info());
-  empty_function->shared().DontAdaptArguments();
-  empty_function->shared().SetScript(ReadOnlyRoots(isolate()), *script, 1);
+  ReadOnlyRoots roots{isolate()};
+  Tagged<SharedFunctionInfo> sfi = empty_function->shared();
+  sfi->set_raw_scope_info(roots.empty_function_scope_info());
+  sfi->DontAdaptArguments();
+  sfi->SetScript(roots, *script, 1);
+  sfi->UpdateFunctionMapIndex();
 
   return empty_function;
 }
@@ -773,7 +803,7 @@ Handle<JSFunction> Genesis::GetThrowTypeErrorIntrinsic() {
   Handle<String> name = factory()->empty_string();
   Handle<JSFunction> function = CreateFunctionForBuiltinWithoutPrototype(
       isolate(), name, Builtin::kStrictPoisonPillThrower);
-  function->shared().DontAdaptArguments();
+  function->shared()->DontAdaptArguments();
 
   // %ThrowTypeError% must have a name property with an empty string value. Per
   // spec, ThrowTypeError's name is non-configurable, unlike ordinary functions'
@@ -854,14 +884,14 @@ void Genesis::CreateObjectFunction(Handle<JSFunction> empty_function) {
   Handle<JSFunction> object_fun = CreateFunction(
       isolate_, factory->Object_string(), JS_OBJECT_TYPE, instance_size,
       inobject_properties, factory->null_value(), Builtin::kObjectConstructor);
-  object_fun->shared().set_length(1);
-  object_fun->shared().DontAdaptArguments();
+  object_fun->shared()->set_length(1);
+  object_fun->shared()->DontAdaptArguments();
   native_context()->set_object_function(*object_fun);
 
   {
     // Finish setting up Object function's initial map.
-    Map initial_map = object_fun->initial_map();
-    initial_map.set_elements_kind(HOLEY_ELEMENTS);
+    Tagged<Map> initial_map = object_fun->initial_map();
+    initial_map->set_elements_kind(HOLEY_ELEMENTS);
   }
 
   // Allocate a new prototype for the object function.
@@ -886,7 +916,7 @@ void Genesis::CreateObjectFunction(Handle<JSFunction> empty_function) {
 
   native_context()->set_initial_object_prototype(*object_function_prototype);
   JSFunction::SetPrototype(object_fun, object_function_prototype);
-  object_function_prototype->map().set_instance_type(JS_OBJECT_PROTOTYPE_TYPE);
+  object_function_prototype->map()->set_instance_type(JS_OBJECT_PROTOTYPE_TYPE);
   {
     // Set up slow map for Object.create(null) instances without in-object
     // properties.
@@ -953,7 +983,7 @@ void Genesis::CreateIteratorMaps(Handle<JSFunction> empty) {
   native_context()->set_initial_iterator_prototype(*iterator_prototype);
   CHECK_NE(iterator_prototype->map().ptr(),
            isolate_->initial_object_prototype()->map().ptr());
-  iterator_prototype->map().set_instance_type(JS_ITERATOR_PROTOTYPE_TYPE);
+  iterator_prototype->map()->set_instance_type(JS_ITERATOR_PROTOTYPE_TYPE);
 
   Handle<JSObject> generator_object_prototype = factory()->NewJSObject(
       isolate()->object_function(), AllocationType::kOld);
@@ -989,7 +1019,7 @@ void Genesis::CreateIteratorMaps(Handle<JSFunction> empty) {
   Handle<JSFunction> generator_next_internal =
       SimpleCreateFunction(isolate(), factory()->next_string(),
                            Builtin::kGeneratorPrototypeNext, 1, false);
-  generator_next_internal->shared().set_native(false);
+  generator_next_internal->shared()->set_native(false);
   native_context()->set_generator_next_internal(*generator_next_internal);
 
   // Internal version of async module functions, flagged as non-native such
@@ -998,7 +1028,7 @@ void Genesis::CreateIteratorMaps(Handle<JSFunction> empty) {
     Handle<JSFunction> async_module_evaluate_internal =
         SimpleCreateFunction(isolate(), factory()->next_string(),
                              Builtin::kAsyncModuleEvaluate, 1, false);
-    async_module_evaluate_internal->shared().set_native(false);
+    async_module_evaluate_internal->shared()->set_native(false);
     native_context()->set_async_module_evaluate_internal(
         *async_module_evaluate_internal);
   }
@@ -1158,8 +1188,9 @@ void Genesis::CreateJSProxyMaps() {
   Handle<Map> proxy_map = factory()->NewMap(JS_PROXY_TYPE, JSProxy::kSize,
                                             TERMINAL_FAST_ELEMENTS_KIND);
   proxy_map->set_is_dictionary_map(true);
-  proxy_map->set_may_have_interesting_symbols(true);
+  proxy_map->set_may_have_interesting_properties(true);
   native_context()->set_proxy_map(*proxy_map);
+  proxy_map->SetConstructor(native_context()->object_function());
 
   Handle<Map> proxy_callable_map =
       Map::Copy(isolate_, proxy_map, "callable Proxy");
@@ -1202,10 +1233,10 @@ namespace {
 void ReplaceAccessors(Isolate* isolate, Handle<Map> map, Handle<String> name,
                       PropertyAttributes attributes,
                       Handle<AccessorPair> accessor_pair) {
-  DescriptorArray descriptors = map->instance_descriptors(isolate);
-  InternalIndex entry = descriptors.SearchWithCache(isolate, *name, *map);
+  Tagged<DescriptorArray> descriptors = map->instance_descriptors(isolate);
+  InternalIndex entry = descriptors->SearchWithCache(isolate, *name, *map);
   Descriptor d = Descriptor::AccessorConstant(name, accessor_pair, attributes);
-  descriptors.Replace(entry, &d);
+  descriptors->Replace(entry, &d);
 }
 
 void InitializeJSArrayMaps(Isolate* isolate, Handle<Context> native_context,
@@ -1224,7 +1255,7 @@ void InitializeJSArrayMaps(Isolate* isolate, Handle<Context> native_context,
        i < kFastElementsKindCount; ++i) {
     Handle<Map> new_map;
     ElementsKind next_kind = GetFastElementsKindFromSequenceIndex(i);
-    Map maybe_elements_transition = current_map->ElementsTransitionMap(
+    Tagged<Map> maybe_elements_transition = current_map->ElementsTransitionMap(
         isolate, ConcurrencyMode::kSynchronous);
     if (!maybe_elements_transition.is_null()) {
       new_map = handle(maybe_elements_transition, isolate);
@@ -1254,22 +1285,23 @@ void Genesis::AddRestrictedFunctionProperties(Handle<JSFunction> empty) {
                    accessors);
 }
 
-static void AddToWeakNativeContextList(Isolate* isolate, Context context) {
-  DCHECK(context.IsNativeContext());
+static void AddToWeakNativeContextList(Isolate* isolate,
+                                       Tagged<Context> context) {
+  DCHECK(IsNativeContext(context));
   Heap* heap = isolate->heap();
 #ifdef DEBUG
   {
-    DCHECK(context.next_context_link().IsUndefined(isolate));
+    DCHECK(IsUndefined(context->next_context_link(), isolate));
     // Check that context is not in the list yet.
-    for (Object current = heap->native_contexts_list();
-         !current.IsUndefined(isolate);
-         current = Context::cast(current).next_context_link()) {
+    for (Tagged<Object> current = heap->native_contexts_list();
+         !IsUndefined(current, isolate);
+         current = Context::cast(current)->next_context_link()) {
       DCHECK(current != context);
     }
   }
 #endif
-  context.set(Context::NEXT_CONTEXT_LINK, heap->native_contexts_list(),
-              UPDATE_WRITE_BARRIER);
+  context->set(Context::NEXT_CONTEXT_LINK, heap->native_contexts_list(),
+               UPDATE_WRITE_BARRIER);
   heap->set_native_contexts_list(context);
 }
 
@@ -1282,12 +1314,6 @@ void Genesis::CreateRoots() {
 
   AddToWeakNativeContextList(isolate(), *native_context());
   isolate()->set_context(*native_context());
-
-  // Allocate the message listeners object.
-  {
-    Handle<TemplateList> list = TemplateList::New(isolate(), 1);
-    native_context()->set_message_listeners(*list);
-  }
 }
 
 void Genesis::InstallGlobalThisBinding() {
@@ -1336,7 +1362,7 @@ Handle<JSGlobalObject> Genesis::CreateNewGlobals(
             FunctionTemplateInfo::cast(data->constructor()), isolate());
     Handle<Object> proto_template(global_constructor->GetPrototypeTemplate(),
                                   isolate());
-    if (!proto_template->IsUndefined(isolate())) {
+    if (!IsUndefined(*proto_template, isolate())) {
       js_global_object_template =
           Handle<ObjectTemplateInfo>::cast(proto_template);
     }
@@ -1365,9 +1391,9 @@ Handle<JSGlobalObject> Genesis::CreateNewGlobals(
         factory()->the_hole_value(), JS_GLOBAL_OBJECT_TYPE);
   }
 
-  js_global_object_function->initial_map().set_is_prototype_map(true);
-  js_global_object_function->initial_map().set_is_dictionary_map(true);
-  js_global_object_function->initial_map().set_may_have_interesting_symbols(
+  js_global_object_function->initial_map()->set_is_prototype_map(true);
+  js_global_object_function->initial_map()->set_is_dictionary_map(true);
+  js_global_object_function->initial_map()->set_may_have_interesting_properties(
       true);
   Handle<JSGlobalObject> global_object =
       factory()->NewJSGlobalObject(js_global_object_function);
@@ -1389,8 +1415,9 @@ Handle<JSGlobalObject> Genesis::CreateNewGlobals(
         isolate(), isolate()->native_context(), global_constructor,
         factory()->the_hole_value(), JS_GLOBAL_PROXY_TYPE);
   }
-  global_proxy_function->initial_map().set_is_access_check_needed(true);
-  global_proxy_function->initial_map().set_may_have_interesting_symbols(true);
+  global_proxy_function->initial_map()->set_is_access_check_needed(true);
+  global_proxy_function->initial_map()->set_may_have_interesting_properties(
+      true);
   native_context()->set_global_proxy_function(*global_proxy_function);
 
   // Set the global object as the (hidden) __proto__ of the global proxy after
@@ -1405,9 +1432,8 @@ Handle<JSGlobalObject> Genesis::CreateNewGlobals(
   // Set the global proxy of the native context. If the native context has been
   // deserialized, the global proxy is already correctly set up by the
   // deserializer. Otherwise it's undefined.
-  DCHECK(native_context()
-             ->get(Context::GLOBAL_PROXY_INDEX)
-             .IsUndefined(isolate()) ||
+  DCHECK(IsUndefined(native_context()->get(Context::GLOBAL_PROXY_INDEX),
+                     isolate()) ||
          native_context()->global_proxy_object() == *global_proxy);
   native_context()->set_global_proxy_object(*global_proxy);
 
@@ -1442,6 +1468,10 @@ void Genesis::HookUpGlobalObject(Handle<JSGlobalObject> global_object) {
   TransferIndexedProperties(global_object_from_snapshot, global_object);
 }
 
+// See https://tc39.es/ecma262/#sec-ordinarycreatefromconstructor for details
+// about intrinsicDefaultProto concept. In short it's about using proper
+// prototype object from constructor's realm when the constructor has
+// non-instance prototype.
 static void InstallWithIntrinsicDefaultProto(Isolate* isolate,
                                              Handle<JSFunction> function,
                                              int context_index) {
@@ -1467,8 +1497,8 @@ static void InstallError(Isolate* isolate, Handle<JSObject> global,
   Handle<JSFunction> error_fun = InstallFunction(
       isolate, global, name, JS_ERROR_TYPE, kErrorObjectSize,
       in_object_properties, factory->the_hole_value(), error_constructor);
-  error_fun->shared().DontAdaptArguments();
-  error_fun->shared().set_length(error_function_length);
+  error_fun->shared()->DontAdaptArguments();
+  error_fun->shared()->set_length(error_function_length);
 
   if (context_index == Context::ERROR_FUNCTION_INDEX) {
     SimpleInstallFunction(isolate, error_fun, "captureStackTrace",
@@ -1506,12 +1536,22 @@ static void InstallError(Isolate* isolate, Handle<JSObject> global,
   }
 
   Handle<Map> initial_map(error_fun->initial_map(), isolate);
-  Map::EnsureDescriptorSlack(isolate, initial_map, 1);
+  Map::EnsureDescriptorSlack(isolate, initial_map, 2);
+  const int kJSErrorErrorStackSymbolIndex = 0;
 
-  {
-    Handle<AccessorInfo> info = factory->error_stack_accessor();
-    Descriptor d = Descriptor::AccessorConstant(handle(info->name(), isolate),
-                                                info, DONT_ENUM);
+  {  // error_stack_symbol
+    Descriptor d = Descriptor::DataField(isolate, factory->error_stack_symbol(),
+                                         kJSErrorErrorStackSymbolIndex,
+                                         DONT_ENUM, Representation::Tagged());
+    initial_map->AppendDescriptor(isolate, &d);
+  }
+  {  // stack
+    Handle<AccessorPair> new_pair = factory->NewAccessorPair();
+    new_pair->set_getter(*factory->error_stack_getter_fun_template());
+    new_pair->set_setter(*factory->error_stack_setter_fun_template());
+
+    Descriptor d = Descriptor::AccessorConstant(factory->stack_string(),
+                                                new_pair, DONT_ENUM);
     initial_map->AppendDescriptor(isolate, &d);
   }
 }
@@ -1684,8 +1724,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
     // Function instances are sloppy by default.
     function_fun->set_prototype_or_initial_map(*isolate_->sloppy_function_map(),
                                                kReleaseStore);
-    function_fun->shared().DontAdaptArguments();
-    function_fun->shared().set_length(1);
+    function_fun->shared()->DontAdaptArguments();
+    function_fun->shared()->set_length(1);
     InstallWithIntrinsicDefaultProto(isolate_, function_fun,
                                      Context::FUNCTION_FUNCTION_INDEX);
     native_context()->set_function_prototype(*prototype);
@@ -1719,11 +1759,15 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
       isolate_->sloppy_function_with_name_map()->SetConstructor(*function_fun);
       isolate_->sloppy_function_with_readonly_prototype_map()->SetConstructor(
           *function_fun);
+      isolate_->sloppy_function_without_prototype_map()->SetConstructor(
+          *function_fun);
 
       isolate_->strict_function_map()->SetConstructor(*function_fun);
       isolate_->strict_function_with_name_map()->SetConstructor(*function_fun);
       isolate_->strict_function_with_readonly_prototype_map()->SetConstructor(
           *function_fun);
+      isolate_->strict_function_without_prototype_map()->SetConstructor(
+          *function_fun);
 
       isolate_->class_function_map()->SetConstructor(*function_fun);
     }
@@ -1734,11 +1778,11 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
     Handle<JSFunction> array_function = InstallFunction(
         isolate_, global, "Array", JS_ARRAY_TYPE, JSArray::kHeaderSize, 0,
         isolate_->initial_object_prototype(), Builtin::kArrayConstructor);
-    array_function->shared().DontAdaptArguments();
+    array_function->shared()->DontAdaptArguments();
 
     // This seems a bit hackish, but we need to make sure Array.length
     // is 1.
-    array_function->shared().set_length(1);
+    array_function->shared()->set_length(1);
 
     Handle<Map> initial_map(array_function->initial_map(), isolate());
 
@@ -1903,7 +1947,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
                                 iterator_prototype);
     CHECK_NE(array_iterator_prototype->map().ptr(),
              isolate_->initial_object_prototype()->map().ptr());
-    array_iterator_prototype->map().set_instance_type(
+    array_iterator_prototype->map()->set_instance_type(
         JS_ARRAY_ITERATOR_PROTOTYPE_TYPE);
 
     InstallToStringTag(isolate_, array_iterator_prototype,
@@ -1916,7 +1960,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         CreateFunction(isolate_, factory->ArrayIterator_string(),
                        JS_ARRAY_ITERATOR_TYPE, JSArrayIterator::kHeaderSize, 0,
                        array_iterator_prototype, Builtin::kIllegal);
-    array_iterator_function->shared().set_native(false);
+    array_iterator_function->shared()->set_native(false);
 
     native_context()->set_initial_array_iterator_map(
         array_iterator_function->initial_map());
@@ -1929,8 +1973,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, global, "Number", JS_PRIMITIVE_WRAPPER_TYPE,
         JSPrimitiveWrapper::kHeaderSize, 0,
         isolate_->initial_object_prototype(), Builtin::kNumberConstructor);
-    number_fun->shared().DontAdaptArguments();
-    number_fun->shared().set_length(1);
+    number_fun->shared()->DontAdaptArguments();
+    number_fun->shared()->set_length(1);
     InstallWithIntrinsicDefaultProto(isolate_, number_fun,
                                      Context::NUMBER_FUNCTION_INDEX);
 
@@ -2014,8 +2058,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, global, "Boolean", JS_PRIMITIVE_WRAPPER_TYPE,
         JSPrimitiveWrapper::kHeaderSize, 0,
         isolate_->initial_object_prototype(), Builtin::kBooleanConstructor);
-    boolean_fun->shared().DontAdaptArguments();
-    boolean_fun->shared().set_length(1);
+    boolean_fun->shared()->DontAdaptArguments();
+    boolean_fun->shared()->set_length(1);
     InstallWithIntrinsicDefaultProto(isolate_, boolean_fun,
                                      Context::BOOLEAN_FUNCTION_INDEX);
 
@@ -2041,13 +2085,13 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, global, "String", JS_PRIMITIVE_WRAPPER_TYPE,
         JSPrimitiveWrapper::kHeaderSize, 0,
         isolate_->initial_object_prototype(), Builtin::kStringConstructor);
-    string_fun->shared().DontAdaptArguments();
-    string_fun->shared().set_length(1);
+    string_fun->shared()->DontAdaptArguments();
+    string_fun->shared()->set_length(1);
     InstallWithIntrinsicDefaultProto(isolate_, string_fun,
                                      Context::STRING_FUNCTION_INDEX);
 
     Handle<Map> string_map = Handle<Map>(
-        native_context()->string_function().initial_map(), isolate());
+        native_context()->string_function()->initial_map(), isolate());
     string_map->set_elements_kind(FAST_STRING_WRAPPER_ELEMENTS);
     Map::EnsureDescriptorSlack(isolate_, string_map, 1);
 
@@ -2220,7 +2264,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
                                 iterator_prototype);
     CHECK_NE(string_iterator_prototype->map().ptr(),
              isolate_->initial_object_prototype()->map().ptr());
-    string_iterator_prototype->map().set_instance_type(
+    string_iterator_prototype->map()->set_instance_type(
         JS_STRING_ITERATOR_PROTOTYPE_TYPE);
     InstallToStringTag(isolate_, string_iterator_prototype, "String Iterator");
 
@@ -2232,7 +2276,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, factory->InternalizeUtf8String("StringIterator"),
         JS_STRING_ITERATOR_TYPE, JSStringIterator::kHeaderSize, 0,
         string_iterator_prototype, Builtin::kIllegal);
-    string_iterator_function->shared().set_native(false);
+    string_iterator_function->shared()->set_native(false);
     native_context()->set_initial_string_iterator_map(
         string_iterator_function->initial_map());
     native_context()->set_initial_string_iterator_prototype(
@@ -2244,8 +2288,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         InstallFunction(isolate_, global, "Symbol", JS_PRIMITIVE_WRAPPER_TYPE,
                         JSPrimitiveWrapper::kHeaderSize, 0,
                         factory->the_hole_value(), Builtin::kSymbolConstructor);
-    symbol_fun->shared().set_length(0);
-    symbol_fun->shared().DontAdaptArguments();
+    symbol_fun->shared()->set_length(0);
+    symbol_fun->shared()->DontAdaptArguments();
     native_context()->set_symbol_function(*symbol_fun);
 
     // Install the Symbol.for and Symbol.keyFor functions.
@@ -2307,8 +2351,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         factory->the_hole_value(), Builtin::kDateConstructor);
     InstallWithIntrinsicDefaultProto(isolate_, date_fun,
                                      Context::DATE_FUNCTION_INDEX);
-    date_fun->shared().set_length(7);
-    date_fun->shared().DontAdaptArguments();
+    date_fun->shared()->set_length(7);
+    date_fun->shared()->DontAdaptArguments();
 
     // Install the Date.now, Date.parse and Date.UTC functions.
     SimpleInstallFunction(isolate_, date_fun, "now", Builtin::kDateNow, 0,
@@ -2497,7 +2541,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
     Map::SetShouldBeFastPrototypeMap(prototype_map, true, isolate_);
     CHECK_NE(prototype->map().ptr(),
              isolate_->initial_object_prototype()->map().ptr());
-    prototype->map().set_instance_type(JS_PROMISE_PROTOTYPE_TYPE);
+    prototype->map()->set_instance_type(JS_PROMISE_PROTOTYPE_TYPE);
 
     DCHECK(promise_fun->HasFastProperties());
   }
@@ -2527,7 +2571,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
                                   Builtin::kRegExpPrototypeExec, 1, true);
         native_context()->set_regexp_exec_function(*fun);
         DCHECK_EQ(JSRegExp::kExecFunctionDescriptorIndex,
-                  prototype->map().LastAdded().as_int());
+                  prototype->map()->LastAdded().as_int());
       }
 
       SimpleInstallGetter(isolate_, prototype, factory->dotAll_string(),
@@ -2562,7 +2606,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
             Builtin::kRegExpPrototypeMatch, 1, true);
         native_context()->set_regexp_match_function(*fun);
         DCHECK_EQ(JSRegExp::kSymbolMatchFunctionDescriptorIndex,
-                  prototype->map().LastAdded().as_int());
+                  prototype->map()->LastAdded().as_int());
       }
 
       {
@@ -2571,7 +2615,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
             "[Symbol.matchAll]", Builtin::kRegExpPrototypeMatchAll, 1, true);
         native_context()->set_regexp_match_all_function(*fun);
         DCHECK_EQ(JSRegExp::kSymbolMatchAllFunctionDescriptorIndex,
-                  prototype->map().LastAdded().as_int());
+                  prototype->map()->LastAdded().as_int());
       }
 
       {
@@ -2580,7 +2624,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
             Builtin::kRegExpPrototypeReplace, 2, false);
         native_context()->set_regexp_replace_function(*fun);
         DCHECK_EQ(JSRegExp::kSymbolReplaceFunctionDescriptorIndex,
-                  prototype->map().LastAdded().as_int());
+                  prototype->map()->LastAdded().as_int());
       }
 
       {
@@ -2589,7 +2633,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
             Builtin::kRegExpPrototypeSearch, 1, true);
         native_context()->set_regexp_search_function(*fun);
         DCHECK_EQ(JSRegExp::kSymbolSearchFunctionDescriptorIndex,
-                  prototype->map().LastAdded().as_int());
+                  prototype->map()->LastAdded().as_int());
       }
 
       {
@@ -2598,7 +2642,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
             Builtin::kRegExpPrototypeSplit, 2, false);
         native_context()->set_regexp_split_function(*fun);
         DCHECK_EQ(JSRegExp::kSymbolSplitFunctionDescriptorIndex,
-                  prototype->map().LastAdded().as_int());
+                  prototype->map()->LastAdded().as_int());
       }
 
       Handle<Map> prototype_map(prototype->map(), isolate());
@@ -2717,7 +2761,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate(), "RegExpStringIterator", JS_REG_EXP_STRING_ITERATOR_TYPE,
         JSRegExpStringIterator::kHeaderSize, 0,
         regexp_string_iterator_prototype, Builtin::kIllegal);
-    regexp_string_iterator_function->shared().set_native(false);
+    regexp_string_iterator_function->shared()->set_native(false);
     native_context()->set_initial_regexp_string_iterator_prototype_map(
         regexp_string_iterator_function->initial_map());
   }
@@ -2890,8 +2934,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           isolate_, intl, "DateTimeFormat", JS_DATE_TIME_FORMAT_TYPE,
           JSDateTimeFormat::kHeaderSize, 0, factory->the_hole_value(),
           Builtin::kDateTimeFormatConstructor);
-      date_time_format_constructor->shared().set_length(0);
-      date_time_format_constructor->shared().DontAdaptArguments();
+      date_time_format_constructor->shared()->set_length(0);
+      date_time_format_constructor->shared()->DontAdaptArguments();
       InstallWithIntrinsicDefaultProto(
           isolate_, date_time_format_constructor,
           Context::INTL_DATE_TIME_FORMAT_FUNCTION_INDEX);
@@ -2929,8 +2973,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           isolate_, intl, "NumberFormat", JS_NUMBER_FORMAT_TYPE,
           JSNumberFormat::kHeaderSize, 0, factory->the_hole_value(),
           Builtin::kNumberFormatConstructor);
-      number_format_constructor->shared().set_length(0);
-      number_format_constructor->shared().DontAdaptArguments();
+      number_format_constructor->shared()->set_length(0);
+      number_format_constructor->shared()->DontAdaptArguments();
       InstallWithIntrinsicDefaultProto(
           isolate_, number_format_constructor,
           Context::INTL_NUMBER_FORMAT_FUNCTION_INDEX);
@@ -2953,13 +2997,20 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
                             false);
       SimpleInstallGetter(isolate_, prototype, factory->format_string(),
                           Builtin::kNumberFormatPrototypeFormatNumber, false);
+
+      SimpleInstallFunction(isolate(), prototype, "formatRange",
+                            Builtin::kNumberFormatPrototypeFormatRange, 2,
+                            false);
+      SimpleInstallFunction(isolate(), prototype, "formatRangeToParts",
+                            Builtin::kNumberFormatPrototypeFormatRangeToParts,
+                            2, false);
     }
 
     {  // -- C o l l a t o r
       Handle<JSFunction> collator_constructor = InstallFunction(
           isolate_, intl, "Collator", JS_COLLATOR_TYPE, JSCollator::kHeaderSize,
           0, factory->the_hole_value(), Builtin::kCollatorConstructor);
-      collator_constructor->shared().DontAdaptArguments();
+      collator_constructor->shared()->DontAdaptArguments();
       InstallWithIntrinsicDefaultProto(isolate_, collator_constructor,
                                        Context::INTL_COLLATOR_FUNCTION_INDEX);
 
@@ -2985,7 +3036,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           isolate_, intl, "v8BreakIterator", JS_V8_BREAK_ITERATOR_TYPE,
           JSV8BreakIterator::kHeaderSize, 0, factory->the_hole_value(),
           Builtin::kV8BreakIteratorConstructor);
-      v8_break_iterator_constructor->shared().DontAdaptArguments();
+      v8_break_iterator_constructor->shared()->DontAdaptArguments();
 
       SimpleInstallFunction(
           isolate_, v8_break_iterator_constructor, "supportedLocalesOf",
@@ -3021,7 +3072,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           isolate_, intl, "PluralRules", JS_PLURAL_RULES_TYPE,
           JSPluralRules::kHeaderSize, 0, factory->the_hole_value(),
           Builtin::kPluralRulesConstructor);
-      plural_rules_constructor->shared().DontAdaptArguments();
+      plural_rules_constructor->shared()->DontAdaptArguments();
       InstallWithIntrinsicDefaultProto(
           isolate_, plural_rules_constructor,
           Context::INTL_PLURAL_RULES_FUNCTION_INDEX);
@@ -3041,6 +3092,10 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
 
       SimpleInstallFunction(isolate_, prototype, "select",
                             Builtin::kPluralRulesPrototypeSelect, 1, false);
+
+      SimpleInstallFunction(isolate(), prototype, "selectRange",
+                            Builtin::kPluralRulesPrototypeSelectRange, 2,
+                            false);
     }
 
     {  // -- R e l a t i v e T i m e F o r m a t
@@ -3048,8 +3103,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           isolate(), intl, "RelativeTimeFormat", JS_RELATIVE_TIME_FORMAT_TYPE,
           JSRelativeTimeFormat::kHeaderSize, 0, factory->the_hole_value(),
           Builtin::kRelativeTimeFormatConstructor);
-      relative_time_format_fun->shared().set_length(0);
-      relative_time_format_fun->shared().DontAdaptArguments();
+      relative_time_format_fun->shared()->set_length(0);
+      relative_time_format_fun->shared()->DontAdaptArguments();
       InstallWithIntrinsicDefaultProto(
           isolate_, relative_time_format_fun,
           Context::INTL_RELATIVE_TIME_FORMAT_FUNCTION_INDEX);
@@ -3081,8 +3136,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           isolate(), intl, "ListFormat", JS_LIST_FORMAT_TYPE,
           JSListFormat::kHeaderSize, 0, factory->the_hole_value(),
           Builtin::kListFormatConstructor);
-      list_format_fun->shared().set_length(0);
-      list_format_fun->shared().DontAdaptArguments();
+      list_format_fun->shared()->set_length(0);
+      list_format_fun->shared()->DontAdaptArguments();
       InstallWithIntrinsicDefaultProto(
           isolate_, list_format_fun, Context::INTL_LIST_FORMAT_FUNCTION_INDEX);
 
@@ -3111,8 +3166,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           factory->the_hole_value(), Builtin::kLocaleConstructor);
       InstallWithIntrinsicDefaultProto(isolate(), locale_fun,
                                        Context::INTL_LOCALE_FUNCTION_INDEX);
-      locale_fun->shared().set_length(1);
-      locale_fun->shared().DontAdaptArguments();
+      locale_fun->shared()->set_length(1);
+      locale_fun->shared()->DontAdaptArguments();
 
       // Setup %LocalePrototype%.
       Handle<JSObject> prototype(
@@ -3150,22 +3205,24 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
                           factory->numberingSystem_string(),
                           Builtin::kLocalePrototypeNumberingSystem, true);
 
-      // Intl Locale Info functions
-      SimpleInstallGetter(isolate(), prototype, factory->calendars_string(),
-                          Builtin::kLocalePrototypeCalendars, true);
-      SimpleInstallGetter(isolate(), prototype, factory->collations_string(),
-                          Builtin::kLocalePrototypeCollations, true);
-      SimpleInstallGetter(isolate(), prototype, factory->hourCycles_string(),
-                          Builtin::kLocalePrototypeHourCycles, true);
-      SimpleInstallGetter(isolate(), prototype,
-                          factory->numberingSystems_string(),
-                          Builtin::kLocalePrototypeNumberingSystems, true);
-      SimpleInstallGetter(isolate(), prototype, factory->textInfo_string(),
-                          Builtin::kLocalePrototypeTextInfo, true);
-      SimpleInstallGetter(isolate(), prototype, factory->timeZones_string(),
-                          Builtin::kLocalePrototypeTimeZones, true);
-      SimpleInstallGetter(isolate(), prototype, factory->weekInfo_string(),
-                          Builtin::kLocalePrototypeWeekInfo, true);
+      if (!v8_flags.harmony_remove_intl_locale_info_getters) {
+        // Intl Locale Info functions
+        SimpleInstallGetter(isolate(), prototype, factory->calendars_string(),
+                            Builtin::kLocalePrototypeCalendars, true);
+        SimpleInstallGetter(isolate(), prototype, factory->collations_string(),
+                            Builtin::kLocalePrototypeCollations, true);
+        SimpleInstallGetter(isolate(), prototype, factory->hourCycles_string(),
+                            Builtin::kLocalePrototypeHourCycles, true);
+        SimpleInstallGetter(isolate(), prototype,
+                            factory->numberingSystems_string(),
+                            Builtin::kLocalePrototypeNumberingSystems, true);
+        SimpleInstallGetter(isolate(), prototype, factory->textInfo_string(),
+                            Builtin::kLocalePrototypeTextInfo, true);
+        SimpleInstallGetter(isolate(), prototype, factory->timeZones_string(),
+                            Builtin::kLocalePrototypeTimeZones, true);
+        SimpleInstallGetter(isolate(), prototype, factory->weekInfo_string(),
+                            Builtin::kLocalePrototypeWeekInfo, true);
+      }
     }
 
     {  // -- D i s p l a y N a m e s
@@ -3173,8 +3230,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           isolate(), intl, "DisplayNames", JS_DISPLAY_NAMES_TYPE,
           JSDisplayNames::kHeaderSize, 0, factory->the_hole_value(),
           Builtin::kDisplayNamesConstructor);
-      display_names_fun->shared().set_length(2);
-      display_names_fun->shared().DontAdaptArguments();
+      display_names_fun->shared()->set_length(2);
+      display_names_fun->shared()->DontAdaptArguments();
       InstallWithIntrinsicDefaultProto(
           isolate(), display_names_fun,
           Context::INTL_DISPLAY_NAMES_FUNCTION_INDEX);
@@ -3203,8 +3260,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
           isolate(), intl, "Segmenter", JS_SEGMENTER_TYPE,
           JSSegmenter::kHeaderSize, 0, factory->the_hole_value(),
           Builtin::kSegmenterConstructor);
-      segmenter_fun->shared().set_length(0);
-      segmenter_fun->shared().DontAdaptArguments();
+      segmenter_fun->shared()->set_length(0);
+      segmenter_fun->shared()->DontAdaptArguments();
       InstallWithIntrinsicDefaultProto(isolate_, segmenter_fun,
                                        Context::INTL_SEGMENTER_FUNCTION_INDEX);
       SimpleInstallFunction(isolate(), segmenter_fun, "supportedLocalesOf",
@@ -3236,9 +3293,9 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         Handle<JSFunction> segments_fun = CreateFunction(
             isolate(), name_string, JS_SEGMENTS_TYPE, JSSegments::kHeaderSize,
             0, prototype, Builtin::kIllegal);
-        segments_fun->shared().set_native(false);
-        segments_fun->shared().set_length(0);
-        segments_fun->shared().DontAdaptArguments();
+        segments_fun->shared()->set_native(false);
+        segments_fun->shared()->set_length(0);
+        segments_fun->shared()->DontAdaptArguments();
         SimpleInstallFunction(isolate(), prototype, "containing",
                               Builtin::kSegmentsPrototypeContaining, 1, false);
         InstallFunctionAtSymbol(isolate_, prototype, factory->iterator_symbol(),
@@ -3271,7 +3328,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         Handle<JSFunction> segment_iterator_fun = CreateFunction(
             isolate(), name_string, JS_SEGMENT_ITERATOR_TYPE,
             JSSegmentIterator::kHeaderSize, 0, prototype, Builtin::kIllegal);
-        segment_iterator_fun->shared().set_native(false);
+        segment_iterator_fun->shared()->set_native(false);
         Handle<Map> segment_iterator_map(segment_iterator_fun->initial_map(),
                                          isolate());
         native_context()->set_intl_segment_iterator_map(*segment_iterator_map);
@@ -3308,7 +3365,9 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
   {  // -- A t o m i c s
     Handle<JSObject> atomics_object =
         factory->NewJSObject(isolate_->object_function(), AllocationType::kOld);
-    native_context()->set_atomics_object(*atomics_object);
+    JSObject::AddProperty(isolate_, global, "Atomics", atomics_object,
+                          DONT_ENUM);
+    InstallToStringTag(isolate_, atomics_object, "Atomics");
 
     SimpleInstallFunction(isolate_, atomics_object, "load",
                           Builtin::kAtomicsLoad, 2, true);
@@ -3343,8 +3402,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, factory->InternalizeUtf8String("TypedArray"),
         JS_TYPED_ARRAY_TYPE, JSTypedArray::kHeaderSize, 0,
         factory->the_hole_value(), Builtin::kTypedArrayBaseConstructor);
-    typed_array_fun->shared().set_native(false);
-    typed_array_fun->shared().set_length(0);
+    typed_array_fun->shared()->set_native(false);
+    typed_array_fun->shared()->set_length(0);
     InstallSpeciesGetter(isolate_, typed_array_fun);
     native_context()->set_typed_array_function(*typed_array_fun);
 
@@ -3458,8 +3517,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         Builtin::kDataViewConstructor);
     InstallWithIntrinsicDefaultProto(isolate_, data_view_fun,
                                      Context::DATA_VIEW_FUN_INDEX);
-    data_view_fun->shared().set_length(1);
-    data_view_fun->shared().DontAdaptArguments();
+    data_view_fun->shared()->set_length(1);
+    data_view_fun->shared()->DontAdaptArguments();
 
     // Setup %DataViewPrototype%.
     Handle<JSObject> prototype(
@@ -3551,7 +3610,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, prototype, "set", Builtin::kMapPrototypeSet, 2, true);
     // Check that index of "set" function in JSCollection is correct.
     DCHECK_EQ(JSCollection::kAddFunctionDescriptorIndex,
-              prototype->map().LastAdded().as_int());
+              prototype->map()->LastAdded().as_int());
     native_context()->set_map_set(*map_set);
 
     Handle<JSFunction> map_has = SimpleInstallFunction(
@@ -3592,8 +3651,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         InstallFunction(isolate_, global, "BigInt", JS_PRIMITIVE_WRAPPER_TYPE,
                         JSPrimitiveWrapper::kHeaderSize, 0,
                         factory->the_hole_value(), Builtin::kBigIntConstructor);
-    bigint_fun->shared().DontAdaptArguments();
-    bigint_fun->shared().set_length(1);
+    bigint_fun->shared()->DontAdaptArguments();
+    bigint_fun->shared()->set_length(1);
     InstallWithIntrinsicDefaultProto(isolate_, bigint_fun,
                                      Context::BIGINT_FUNCTION_INDEX);
 
@@ -3650,7 +3709,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, prototype, "add", Builtin::kSetPrototypeAdd, 1, true);
     // Check that index of "add" function in JSCollection is correct.
     DCHECK_EQ(JSCollection::kAddFunctionDescriptorIndex,
-              prototype->map().LastAdded().as_int());
+              prototype->map()->LastAdded().as_int());
     native_context()->set_set_add(*set_add);
 
     Handle<JSFunction> set_delete = SimpleInstallFunction(
@@ -3683,7 +3742,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
     native_context()->set_js_set_map(js_set_fun->initial_map());
     CHECK_NE(prototype->map().ptr(),
              isolate_->initial_object_prototype()->map().ptr());
-    prototype->map().set_instance_type(JS_SET_PROTOTYPE_TYPE);
+    prototype->map()->set_instance_type(JS_SET_PROTOTYPE_TYPE);
   }
 
   {  // -- J S M o d u l e N a m e s p a c e
@@ -3707,28 +3766,9 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
   }
 
   {  // -- I t e r a t o r R e s u l t
-    // Setup the map for IterResultObjects created from builtins in such a
-    // way that it's exactly the same map as the one produced by object
-    // literals in the form `{value, done}`. This way we have better sharing
-    // of maps (i.e. less polymorphism) and also make it possible to hit the
-    // fast-paths in various builtins (i.e. promises and collections) with
-    // user defined iterators.
-    Handle<Map> map = factory->ObjectLiteralMapFromCache(native_context(), 2);
-
-    // value
-    map = Map::CopyWithField(isolate(), map, factory->value_string(),
-                             FieldType::Any(isolate()), NONE,
-                             PropertyConstness::kConst,
-                             Representation::Tagged(), INSERT_TRANSITION)
-              .ToHandleChecked();
-
-    // done
-    map = Map::CopyWithField(isolate(), map, factory->done_string(),
-                             FieldType::Any(isolate()), NONE,
-                             PropertyConstness::kConst,
-                             Representation::HeapObject(), INSERT_TRANSITION)
-              .ToHandleChecked();
-
+    std::array<Handle<Name>, 2> fields{factory->value_string(),
+                                       factory->done_string()};
+    Handle<Map> map = CreateLiteralObjectMapFromCache(isolate(), fields);
     native_context()->set_iterator_result_map(*map);
   }
 
@@ -3760,7 +3800,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, prototype, "set", Builtin::kWeakMapPrototypeSet, 2, true);
     // Check that index of "set" function in JSWeakCollection is correct.
     DCHECK_EQ(JSWeakCollection::kAddFunctionDescriptorIndex,
-              prototype->map().LastAdded().as_int());
+              prototype->map()->LastAdded().as_int());
 
     native_context()->set_weakmap_set(*weakmap_set);
     SimpleInstallFunction(isolate_, prototype, "has",
@@ -3795,7 +3835,7 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, prototype, "add", Builtin::kWeakSetPrototypeAdd, 1, true);
     // Check that index of "add" function in JSWeakCollection is correct.
     DCHECK_EQ(JSWeakCollection::kAddFunctionDescriptorIndex,
-              prototype->map().LastAdded().as_int());
+              prototype->map()->LastAdded().as_int());
 
     native_context()->set_weakset_add(*weakset_add);
 
@@ -3819,9 +3859,9 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
 
     isolate_->proxy_map()->SetConstructor(*proxy_function);
 
-    proxy_function->shared().set_internal_formal_parameter_count(
+    proxy_function->shared()->set_internal_formal_parameter_count(
         JSParameterCount(2));
-    proxy_function->shared().set_length(2);
+    proxy_function->shared()->set_length(2);
 
     native_context()->set_proxy_function(*proxy_function);
     JSObject::AddProperty(isolate_, global, name, proxy_function, DONT_ENUM);
@@ -3920,8 +3960,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
         isolate_, finalization_registry_fun,
         Context::JS_FINALIZATION_REGISTRY_FUNCTION_INDEX);
 
-    finalization_registry_fun->shared().DontAdaptArguments();
-    finalization_registry_fun->shared().set_length(1);
+    finalization_registry_fun->shared()->DontAdaptArguments();
+    finalization_registry_fun->shared()->set_length(1);
 
     Handle<JSObject> finalization_registry_prototype(
         JSObject::cast(finalization_registry_fun->instance_prototype()),
@@ -3954,8 +3994,8 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
     InstallWithIntrinsicDefaultProto(isolate_, weak_ref_fun,
                                      Context::JS_WEAK_REF_FUNCTION_INDEX);
 
-    weak_ref_fun->shared().DontAdaptArguments();
-    weak_ref_fun->shared().set_length(1);
+    weak_ref_fun->shared()->DontAdaptArguments();
+    weak_ref_fun->shared()->set_length(1);
 
     Handle<JSObject> weak_ref_prototype(
         JSObject::cast(weak_ref_fun->instance_prototype()), isolate());
@@ -4046,13 +4086,13 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
     }
     // @@iterator method is added later.
 
-    DCHECK_EQ(native_context()->object_function().prototype(),
+    DCHECK_EQ(native_context()->object_function()->prototype(),
               *isolate_->initial_object_prototype());
     Map::SetPrototype(isolate(), map, isolate_->initial_object_prototype());
 
     // Copy constructor from the sloppy arguments boilerplate.
     map->SetConstructor(
-        native_context()->sloppy_arguments_map().GetConstructor());
+        native_context()->sloppy_arguments_map()->GetConstructor());
 
     native_context()->set_strict_arguments_map(*map);
 
@@ -4070,17 +4110,17 @@ void Genesis::InitializeGlobal(Handle<JSGlobalObject> global_object,
 
   {
     // Set up the call-as-function delegate.
-    Handle<JSFunction> delegate =
-        SimpleCreateFunction(isolate_, factory->empty_string(),
-                             Builtin::kHandleApiCallAsFunction, 0, false);
+    Handle<JSFunction> delegate = SimpleCreateFunction(
+        isolate_, factory->empty_string(),
+        Builtin::kHandleApiCallAsFunctionDelegate, 0, false);
     native_context()->set_call_as_function_delegate(*delegate);
   }
 
   {
     // Set up the call-as-constructor delegate.
-    Handle<JSFunction> delegate =
-        SimpleCreateFunction(isolate_, factory->empty_string(),
-                             Builtin::kHandleApiCallAsConstructor, 0, false);
+    Handle<JSFunction> delegate = SimpleCreateFunction(
+        isolate_, factory->empty_string(),
+        Builtin::kHandleApiCallAsConstructorDelegate, 0, false);
     native_context()->set_call_as_constructor_delegate(*delegate);
   }
 }
@@ -4099,10 +4139,10 @@ Handle<JSFunction> Genesis::InstallTypedArray(const char* name,
       isolate(), global, name, JS_TYPED_ARRAY_TYPE,
       JSTypedArray::kSizeWithEmbedderFields, 0, factory()->the_hole_value(),
       Builtin::kTypedArrayConstructor);
-  result->initial_map().set_elements_kind(elements_kind);
+  result->initial_map()->set_elements_kind(elements_kind);
 
-  result->shared().DontAdaptArguments();
-  result->shared().set_length(3);
+  result->shared()->DontAdaptArguments();
+  result->shared()->set_length(3);
 
   CHECK(JSObject::SetPrototype(isolate(), result, typed_array_function, false,
                                kDontThrow)
@@ -4119,7 +4159,7 @@ Handle<JSFunction> Genesis::InstallTypedArray(const char* name,
   SetConstructorInstanceType(isolate_, result, constructor_type);
 
   // Setup prototype object.
-  DCHECK(result->prototype().IsJSObject());
+  DCHECK(IsJSObject(result->prototype()));
   Handle<JSObject> prototype(JSObject::cast(result->prototype()), isolate());
 
   CHECK(JSObject::SetPrototype(isolate(), prototype, typed_array_prototype,
@@ -4128,7 +4168,7 @@ Handle<JSFunction> Genesis::InstallTypedArray(const char* name,
 
   CHECK_NE(prototype->map().ptr(),
            isolate_->initial_object_prototype()->map().ptr());
-  prototype->map().set_instance_type(JS_TYPED_ARRAY_PROTOTYPE_TYPE);
+  prototype->map()->set_instance_type(JS_TYPED_ARRAY_PROTOTYPE_TYPE);
 
   InstallConstant(isolate(), prototype, "BYTES_PER_ELEMENT", bytes_per_element);
 
@@ -4153,10 +4193,14 @@ void Genesis::InitializeExperimentalGlobal() {
   // features may depend on more mature features having been initialized
   // already.
   HARMONY_SHIPPING(FEATURE_INITIALIZE_GLOBAL)
+  JAVASCRIPT_SHIPPING_FEATURES(FEATURE_INITIALIZE_GLOBAL)
   HARMONY_STAGED(FEATURE_INITIALIZE_GLOBAL)
+  JAVASCRIPT_STAGED_FEATURES(FEATURE_INITIALIZE_GLOBAL)
   HARMONY_INPROGRESS(FEATURE_INITIALIZE_GLOBAL)
+  JAVASCRIPT_INPROGRESS_FEATURES(FEATURE_INITIALIZE_GLOBAL)
 #undef FEATURE_INITIALIZE_GLOBAL
   InitializeGlobal_regexp_linear_flag();
+  InitializeGlobal_sharedarraybuffer();
 }
 
 bool Genesis::CompileExtension(Isolate* isolate, v8::Extension* extension) {
@@ -4175,7 +4219,7 @@ bool Genesis::CompileExtension(Isolate* isolate, v8::Extension* extension) {
   base::Vector<const char> name = base::CStrVector(extension->name());
   SourceCodeCache* cache = isolate->bootstrapper()->extensions_cache();
   Handle<Context> context(isolate->context(), isolate);
-  DCHECK(context->IsNativeContext());
+  DCHECK(IsNativeContext(*context));
 
   if (!cache->Lookup(isolate, name, &function_info)) {
     Handle<String> script_name =
@@ -4223,8 +4267,8 @@ void Genesis::InitializeIteratorFunctions() {
         Builtin::kGeneratorFunctionConstructor);
     generator_function_function->set_prototype_or_initial_map(
         native_context->generator_function_map(), kReleaseStore);
-    generator_function_function->shared().DontAdaptArguments();
-    generator_function_function->shared().set_length(1);
+    generator_function_function->shared()->DontAdaptArguments();
+    generator_function_function->shared()->set_length(1);
     InstallWithIntrinsicDefaultProto(
         isolate, generator_function_function,
         Context::GENERATOR_FUNCTION_FUNCTION_INDEX);
@@ -4236,7 +4280,9 @@ void Genesis::InitializeIteratorFunctions() {
         generator_function_function,
         static_cast<PropertyAttributes>(DONT_ENUM | READ_ONLY));
 
-    native_context->generator_function_map().SetConstructor(
+    native_context->generator_function_map()->SetConstructor(
+        *generator_function_function);
+    native_context->generator_function_with_name_map()->SetConstructor(
         *generator_function_function);
   }
 
@@ -4252,8 +4298,8 @@ void Genesis::InitializeIteratorFunctions() {
         Builtin::kAsyncGeneratorFunctionConstructor);
     async_generator_function_function->set_prototype_or_initial_map(
         native_context->async_generator_function_map(), kReleaseStore);
-    async_generator_function_function->shared().DontAdaptArguments();
-    async_generator_function_function->shared().set_length(1);
+    async_generator_function_function->shared()->DontAdaptArguments();
+    async_generator_function_function->shared()->set_length(1);
     InstallWithIntrinsicDefaultProto(
         isolate, async_generator_function_function,
         Context::ASYNC_GENERATOR_FUNCTION_FUNCTION_INDEX);
@@ -4266,7 +4312,9 @@ void Genesis::InitializeIteratorFunctions() {
         factory->constructor_string(), async_generator_function_function,
         static_cast<PropertyAttributes>(DONT_ENUM | READ_ONLY));
 
-    native_context->async_generator_function_map().SetConstructor(
+    native_context->async_generator_function_map()->SetConstructor(
+        *async_generator_function_function);
+    native_context->async_generator_function_with_name_map()->SetConstructor(
         *async_generator_function_function);
   }
 
@@ -4284,13 +4332,13 @@ void Genesis::InitializeIteratorFunctions() {
     native_context->set_initial_set_iterator_prototype(*prototype);
     CHECK_NE(prototype->map().ptr(),
              isolate_->initial_object_prototype()->map().ptr());
-    prototype->map().set_instance_type(JS_SET_ITERATOR_PROTOTYPE_TYPE);
+    prototype->map()->set_instance_type(JS_SET_ITERATOR_PROTOTYPE_TYPE);
 
     // Setup SetIterator constructor.
     Handle<JSFunction> set_iterator_function = CreateFunction(
         isolate, "SetIterator", JS_SET_VALUE_ITERATOR_TYPE,
         JSSetIterator::kHeaderSize, 0, prototype, Builtin::kIllegal);
-    set_iterator_function->shared().set_native(false);
+    set_iterator_function->shared()->set_native(false);
 
     Handle<Map> set_value_iterator_map(set_iterator_function->initial_map(),
                                        isolate);
@@ -4317,13 +4365,13 @@ void Genesis::InitializeIteratorFunctions() {
     native_context->set_initial_map_iterator_prototype(*prototype);
     CHECK_NE(prototype->map().ptr(),
              isolate_->initial_object_prototype()->map().ptr());
-    prototype->map().set_instance_type(JS_MAP_ITERATOR_PROTOTYPE_TYPE);
+    prototype->map()->set_instance_type(JS_MAP_ITERATOR_PROTOTYPE_TYPE);
 
     // Setup MapIterator constructor.
     Handle<JSFunction> map_iterator_function = CreateFunction(
         isolate, "MapIterator", JS_MAP_KEY_ITERATOR_TYPE,
         JSMapIterator::kHeaderSize, 0, prototype, Builtin::kIllegal);
-    map_iterator_function->shared().set_native(false);
+    map_iterator_function->shared()->set_native(false);
 
     Handle<Map> map_key_iterator_map(map_iterator_function->initial_map(),
                                      isolate);
@@ -4353,11 +4401,10 @@ void Genesis::InitializeIteratorFunctions() {
         Builtin::kAsyncFunctionConstructor);
     async_function_constructor->set_prototype_or_initial_map(
         native_context->async_function_map(), kReleaseStore);
-    async_function_constructor->shared().DontAdaptArguments();
-    async_function_constructor->shared().set_length(1);
-    InstallWithIntrinsicDefaultProto(
-        isolate, async_function_constructor,
-        Context::ASYNC_FUNCTION_FUNCTION_INDEX);
+    async_function_constructor->shared()->DontAdaptArguments();
+    async_function_constructor->shared()->set_length(1);
+    InstallWithIntrinsicDefaultProto(isolate, async_function_constructor,
+                                     Context::ASYNC_FUNCTION_FUNCTION_INDEX);
 
     native_context->set_async_function_constructor(*async_function_constructor);
     JSObject::ForceSetPrototype(isolate, async_function_constructor,
@@ -4368,9 +4415,6 @@ void Genesis::InitializeIteratorFunctions() {
         async_function_constructor,
         static_cast<PropertyAttributes>(DONT_ENUM | READ_ONLY));
 
-    JSFunction::SetPrototype(async_function_constructor,
-                             async_function_prototype);
-
     // Async functions don't have a prototype, but they use generator objects
     // under the hood to model the suspend/resume (in await). Instead of using
     // the "prototype" / initial_map machinery (like for (async) generators),
@@ -4380,6 +4424,10 @@ void Genesis::InitializeIteratorFunctions() {
     Handle<Map> async_function_object_map = factory->NewMap(
         JS_ASYNC_FUNCTION_OBJECT_TYPE, JSAsyncFunctionObject::kHeaderSize);
     native_context->set_async_function_object_map(*async_function_object_map);
+
+    isolate_->async_function_map()->SetConstructor(*async_function_constructor);
+    isolate_->async_function_with_name_map()->SetConstructor(
+        *async_function_constructor);
   }
 }
 
@@ -4396,7 +4444,7 @@ void Genesis::InitializeCallSiteBuiltins() {
   Handle<JSFunction> callsite_fun = CreateFunction(
       isolate(), "CallSite", JS_OBJECT_TYPE, JSObject::kHeaderSize, 0,
       factory->the_hole_value(), Builtin::kUnsupportedThrower);
-  callsite_fun->shared().DontAdaptArguments();
+  callsite_fun->shared()->DontAdaptArguments();
   isolate()->native_context()->set_callsite_function(*callsite_fun);
 
   // Setup CallSite.prototype.
@@ -4464,7 +4512,7 @@ void Genesis::InitializeConsole(Handle<JSObject> extras_binding) {
   JSFunction::SetPrototype(cons, empty);
 
   Handle<JSObject> console = factory->NewJSObject(cons, AllocationType::kOld);
-  DCHECK(console->IsJSObject());
+  DCHECK(IsJSObject(*console));
 
   JSObject::AddProperty(isolate_, extras_binding, name, console, DONT_ENUM);
   // TODO(v8:11989): remove this in the next release
@@ -4523,11 +4571,12 @@ void Genesis::InitializeConsole(Handle<JSObject> extras_binding) {
   void Genesis::InitializeGlobal_##id() {}
 
 EMPTY_INITIALIZE_GLOBAL_FOR_FEATURE(harmony_import_assertions)
-EMPTY_INITIALIZE_GLOBAL_FOR_FEATURE(harmony_symbol_as_weakmap_key)
+EMPTY_INITIALIZE_GLOBAL_FOR_FEATURE(harmony_import_attributes)
 EMPTY_INITIALIZE_GLOBAL_FOR_FEATURE(harmony_rab_gsab_transfer)
 
 #ifdef V8_INTL_SUPPORT
 EMPTY_INITIALIZE_GLOBAL_FOR_FEATURE(harmony_intl_best_fit_matcher)
+EMPTY_INITIALIZE_GLOBAL_FOR_FEATURE(harmony_remove_intl_locale_info_getters)
 #endif  // V8_INTL_SUPPORT
 
 #undef EMPTY_INITIALIZE_GLOBAL_FOR_FEATURE
@@ -4542,8 +4591,8 @@ void Genesis::InitializeGlobal_harmony_iterator_helpers() {
   Handle<JSFunction> iterator_function = InstallFunction(
       isolate(), global, "Iterator", JS_OBJECT_TYPE, JSObject::kHeaderSize, 0,
       iterator_prototype, Builtin::kIteratorConstructor);
-  iterator_function->shared().DontAdaptArguments();
-  iterator_function->shared().set_length(0);
+  iterator_function->shared()->DontAdaptArguments();
+  iterator_function->shared()->set_length(0);
   SimpleInstallFunction(isolate(), iterator_function, "from",
                         Builtin::kIteratorFrom, 1, true);
   InstallWithIntrinsicDefaultProto(isolate(), iterator_function,
@@ -4554,6 +4603,9 @@ void Genesis::InitializeGlobal_harmony_iterator_helpers() {
       isolate()->object_function(), AllocationType::kOld);
   JSObject::ForceSetPrototype(isolate(), wrap_for_valid_iterator_prototype,
                               iterator_prototype);
+  JSObject::AddProperty(isolate(), iterator_prototype,
+                        factory()->constructor_string(), iterator_function,
+                        DONT_ENUM);
   SimpleInstallFunction(isolate(), wrap_for_valid_iterator_prototype, "next",
                         Builtin::kWrapForValidIteratorPrototypeNext, 0, true);
   SimpleInstallFunction(isolate(), wrap_for_valid_iterator_prototype, "return",
@@ -4563,7 +4615,9 @@ void Genesis::InitializeGlobal_harmony_iterator_helpers() {
       TERMINAL_FAST_ELEMENTS_KIND, 0);
   Map::SetPrototype(isolate(), valid_iterator_wrapper_map,
                     wrap_for_valid_iterator_prototype);
+  valid_iterator_wrapper_map->SetConstructor(*iterator_function);
   native_context()->set_valid_iterator_wrapper_map(*valid_iterator_wrapper_map);
+  LOG(isolate(), MapDetails(*valid_iterator_wrapper_map));
 
   // --- %IteratorHelperPrototype%
   Handle<JSObject> iterator_helper_prototype = factory()->NewJSObject(
@@ -4575,6 +4629,27 @@ void Genesis::InitializeGlobal_harmony_iterator_helpers() {
                         Builtin::kIteratorHelperPrototypeNext, 0, true);
   SimpleInstallFunction(isolate(), iterator_helper_prototype, "return",
                         Builtin::kIteratorHelperPrototypeReturn, 0, true);
+  SimpleInstallFunction(isolate(), iterator_prototype, "reduce",
+                        Builtin::kIteratorPrototypeReduce, 1, false);
+  SimpleInstallFunction(isolate(), iterator_prototype, "toArray",
+                        Builtin::kIteratorPrototypeToArray, 0, true);
+  SimpleInstallFunction(isolate(), iterator_prototype, "forEach",
+                        Builtin::kIteratorPrototypeForEach, 1, true);
+  SimpleInstallFunction(isolate(), iterator_prototype, "some",
+                        Builtin::kIteratorPrototypeSome, 1, true);
+  SimpleInstallFunction(isolate(), iterator_prototype, "every",
+                        Builtin::kIteratorPrototypeEvery, 1, true);
+  SimpleInstallFunction(isolate(), iterator_prototype, "find",
+                        Builtin::kIteratorPrototypeFind, 1, true);
+
+  // Add @@toStringTag to Iterator.prototype
+  // https://tc39.es/proposal-iterator-helpers/#sec-iteratorprototype-@@tostringtag
+  // We cannot use `InstallToStringTag` because this toStringTag, unlike other
+  // toStringTag values, is writable.
+  JSObject::AddProperty(isolate(), iterator_prototype,
+                        isolate()->factory()->to_string_tag_symbol(),
+                        isolate()->factory()->InternalizeUtf8String("Iterator"),
+                        static_cast<PropertyAttributes>(DONT_ENUM));
 
   // --- Helper maps
 #define INSTALL_ITERATOR_HELPER(lowercase_name, Capitalized_name,              \
@@ -4585,7 +4660,9 @@ void Genesis::InitializeGlobal_harmony_iterator_helpers() {
                           JSIterator##Capitalized_name##Helper::kHeaderSize,   \
                           TERMINAL_FAST_ELEMENTS_KIND, 0);                     \
     Map::SetPrototype(isolate(), map, iterator_helper_prototype);              \
+    map->SetConstructor(*iterator_function);                                   \
     native_context()->set_iterator_##lowercase_name##_helper_map(*map);        \
+    LOG(isolate(), MapDetails(*map));                                          \
     SimpleInstallFunction(isolate(), iterator_prototype, #lowercase_name,      \
                           Builtin::kIteratorPrototype##Capitalized_name, argc, \
                           true);                                               \
@@ -4595,7 +4672,8 @@ void Genesis::InitializeGlobal_harmony_iterator_helpers() {
   V(map, Map, MAP, 1)          \
   V(filter, Filter, FILTER, 1) \
   V(take, Take, TAKE, 1)       \
-  V(drop, Drop, DROP, 1)
+  V(drop, Drop, DROP, 1)       \
+  V(flatMap, FlatMap, FLAT_MAP, 1)
 
   ITERATOR_HELPERS(INSTALL_ITERATOR_HELPER)
 
@@ -4603,6 +4681,44 @@ void Genesis::InitializeGlobal_harmony_iterator_helpers() {
 #undef ITERATOR_HELPERS
 }
 
+void Genesis::InitializeGlobal_js_promise_withresolvers() {
+  if (!v8_flags.js_promise_withresolvers) return;
+
+  Factory* factory = isolate()->factory();
+
+  std::array<Handle<Name>, 3> fields{factory->promise_string(),
+                                     factory->resolve_string(),
+                                     factory->reject_string()};
+  Handle<Map> result_map = CreateLiteralObjectMapFromCache(isolate(), fields);
+  native_context()->set_promise_withresolvers_result_map(*result_map);
+
+  Handle<JSFunction> promise_fun =
+      handle(native_context()->promise_function(), isolate());
+  InstallFunctionWithBuiltinId(isolate(), promise_fun, "withResolvers",
+                               Builtin::kPromiseWithResolvers, 0, true);
+}
+
+void Genesis::InitializeGlobal_harmony_set_methods() {
+  if (!v8_flags.harmony_set_methods) return;
+
+  Handle<JSObject> set_prototype(native_context()->initial_set_prototype(),
+                                 isolate());
+  SimpleInstallFunction(isolate(), set_prototype, "union",
+                        Builtin::kSetPrototypeUnion, 1, true);
+  SimpleInstallFunction(isolate(), set_prototype, "intersection",
+                        Builtin::kSetPrototypeIntersection, 1, true);
+  SimpleInstallFunction(isolate(), set_prototype, "difference",
+                        Builtin::kSetPrototypeDifference, 1, true);
+  SimpleInstallFunction(isolate(), set_prototype, "symmetricDifference",
+                        Builtin::kSetPrototypeSymmetricDifference, 1, true);
+  SimpleInstallFunction(isolate(), set_prototype, "isSubsetOf",
+                        Builtin::kSetPrototypeIsSubsetOf, 1, true);
+  SimpleInstallFunction(isolate(), set_prototype, "isSupersetOf",
+                        Builtin::kSetPrototypeIsSupersetOf, 1, true);
+  SimpleInstallFunction(isolate(), set_prototype, "isDisjointFrom",
+                        Builtin::kSetPrototypeIsDisjointFrom, 1, true);
+}
+
 void Genesis::InitializeGlobal_harmony_json_parse_with_source() {
   if (!v8_flags.harmony_json_parse_with_source) return;
   Handle<Map> map = factory()->NewMap(JS_RAW_JSON_TYPE, JSRawJson::kInitialSize,
@@ -4617,6 +4733,10 @@ void Genesis::InitializeGlobal_harmony_json_parse_with_source() {
   map->SetPrototype(isolate(), map, isolate()->factory()->null_value());
   map->SetConstructor(native_context()->object_function());
   native_context()->set_js_raw_json_map(*map);
+  // TODO(v8:12955): Remove the LOG after the flag is removed and this map goes
+  // into the startup snapshot. It is needed for the
+  // LogMapsTest.LogMapsDetailsContexts unittest.
+  LOG(isolate(), MapDetails(*map));
   SimpleInstallFunction(isolate_,
                         handle(native_context()->json_object(), isolate_),
                         "rawJSON", Builtin::kJsonRawJson, 1, true);
@@ -4689,8 +4809,8 @@ void Genesis::InitializeGlobal_harmony_shadow_realm() {
       InstallFunction(isolate_, global, "ShadowRealm", JS_SHADOW_REALM_TYPE,
                       JSShadowRealm::kHeaderSize, 0, factory->the_hole_value(),
                       Builtin::kShadowRealmConstructor);
-  shadow_realm_fun->shared().set_length(0);
-  shadow_realm_fun->shared().DontAdaptArguments();
+  shadow_realm_fun->shared()->set_length(0);
+  shadow_realm_fun->shared()->DontAdaptArguments();
 
   // Setup %ShadowRealmPrototype%.
   Handle<JSObject> prototype(
@@ -4745,7 +4865,7 @@ void Genesis::InitializeGlobal_harmony_shadow_realm() {
         SimpleCreateFunction(isolate(), factory->empty_string(),
                              Builtin::kShadowRealmImportValueRejected, 1,
                              false);
-    shadow_realm_import_value_rejected->shared().set_native(false);
+    shadow_realm_import_value_rejected->shared()->set_native(false);
     native_context()->set_shadow_realm_import_value_rejected(
         *shadow_realm_import_value_rejected);
   }
@@ -4754,119 +4874,112 @@ void Genesis::InitializeGlobal_harmony_shadow_realm() {
 void Genesis::InitializeGlobal_harmony_struct() {
   if (!v8_flags.harmony_struct) return;
 
+  ReadOnlyRoots roots(isolate());
   Handle<JSGlobalObject> global(native_context()->global_object(), isolate());
-  Handle<String> name =
-      isolate()->factory()->InternalizeUtf8String("SharedStructType");
-  Handle<JSFunction> shared_struct_type_fun = CreateFunctionForBuiltin(
-      isolate(), name, isolate()->strict_function_with_readonly_prototype_map(),
-      Builtin::kSharedStructTypeConstructor);
-  JSObject::MakePrototypesFast(shared_struct_type_fun, kStartAtReceiver,
-                               isolate());
-  shared_struct_type_fun->shared().set_native(true);
-  shared_struct_type_fun->shared().DontAdaptArguments();
-  shared_struct_type_fun->shared().set_length(1);
-  JSObject::AddProperty(isolate(), global, "SharedStructType",
-                        shared_struct_type_fun, DONT_ENUM);
+  Handle<JSObject> atomics_object = Handle<JSObject>::cast(
+      JSReceiver::GetProperty(isolate(), global, "Atomics").ToHandleChecked());
+
+  {
+    // Install shared objects @@hasInstance in the native context.
+    Handle<JSFunction> has_instance = SimpleCreateFunction(
+        isolate(), factory()->empty_string(),
+        Builtin::kSharedSpaceJSObjectHasInstance, 1, false);
+    native_context()->set_shared_space_js_object_has_instance(*has_instance);
+  }
+
+  {  // SharedStructType
+    Handle<String> name =
+        isolate()->factory()->InternalizeUtf8String("SharedStructType");
+    Handle<JSFunction> shared_struct_type_fun = CreateFunctionForBuiltin(
+        isolate(), name,
+        isolate()->strict_function_with_readonly_prototype_map(),
+        Builtin::kSharedStructTypeConstructor);
+    JSObject::MakePrototypesFast(shared_struct_type_fun, kStartAtReceiver,
+                                 isolate());
+    shared_struct_type_fun->shared()->set_native(true);
+    shared_struct_type_fun->shared()->DontAdaptArguments();
+    shared_struct_type_fun->shared()->set_length(1);
+    JSObject::AddProperty(isolate(), global, "SharedStructType",
+                          shared_struct_type_fun, DONT_ENUM);
+
+    SimpleInstallFunction(isolate(), shared_struct_type_fun, "isSharedStruct",
+                          Builtin::kSharedStructTypeIsSharedStruct, 1, true);
+  }
 
   {  // SharedArray
     Handle<String> shared_array_str =
         isolate()->factory()->InternalizeUtf8String("SharedArray");
     Handle<JSFunction> shared_array_fun = CreateSharedObjectConstructor(
-        isolate(), shared_array_str, JS_SHARED_ARRAY_TYPE, JSSharedArray::kSize,
-        JSSharedArray::kInObjectFieldCount, SHARED_ARRAY_ELEMENTS,
+        isolate(), shared_array_str, roots.js_shared_array_map_handle(),
         Builtin::kSharedArrayConstructor);
-    shared_array_fun->shared().set_internal_formal_parameter_count(
+    shared_array_fun->shared()->set_internal_formal_parameter_count(
         JSParameterCount(0));
-    shared_array_fun->shared().set_length(0);
-
-    // Add the length accessor.
-    Handle<DescriptorArray> descriptors =
-        isolate()->factory()->NewDescriptorArray(1, 0,
-                                                 AllocationType::kSharedOld);
-    Descriptor length_descriptor = Descriptor::DataField(
-        isolate()->shared_space_isolate()->factory()->length_string(),
-        JSSharedArray::kLengthFieldIndex, ALL_ATTRIBUTES_MASK,
-        PropertyConstness::kConst, Representation::Smi(),
-        MaybeObjectHandle(FieldType::Any(isolate())));
-    descriptors->Set(InternalIndex(0), &length_descriptor);
-    shared_array_fun->initial_map().InitializeDescriptors(isolate(),
-                                                          *descriptors);
+    shared_array_fun->shared()->set_length(0);
 
     // Install SharedArray constructor.
     JSObject::AddProperty(isolate(), global, "SharedArray", shared_array_fun,
                           DONT_ENUM);
-  }
 
-  // TODO(v8:12547): Make a single canonical copy of the Mutex and Condition
-  // maps.
+    SimpleInstallFunction(isolate(), shared_array_fun, "isSharedArray",
+                          Builtin::kSharedArrayIsSharedArray, 1, true);
+  }
 
   {  // Atomics.Mutex
     Handle<String> mutex_str =
         isolate()->factory()->InternalizeUtf8String("Mutex");
     Handle<JSFunction> mutex_fun = CreateSharedObjectConstructor(
-        isolate(), mutex_str, JS_ATOMICS_MUTEX_TYPE,
-        JSAtomicsMutex::kHeaderSize, 0, TERMINAL_FAST_ELEMENTS_KIND,
+        isolate(), mutex_str, roots.js_atomics_mutex_map_handle(),
         Builtin::kAtomicsMutexConstructor);
-    mutex_fun->shared().set_internal_formal_parameter_count(
+    mutex_fun->shared()->set_internal_formal_parameter_count(
         JSParameterCount(0));
-    mutex_fun->shared().set_length(0);
-    native_context()->set_js_atomics_mutex_map(mutex_fun->initial_map());
-    JSObject::AddProperty(isolate(), isolate()->atomics_object(), mutex_str,
-                          mutex_fun, DONT_ENUM);
+    mutex_fun->shared()->set_length(0);
+    JSObject::AddProperty(isolate(), atomics_object, mutex_str, mutex_fun,
+                          DONT_ENUM);
 
     SimpleInstallFunction(isolate(), mutex_fun, "lock",
                           Builtin::kAtomicsMutexLock, 2, true);
     SimpleInstallFunction(isolate(), mutex_fun, "tryLock",
                           Builtin::kAtomicsMutexTryLock, 2, true);
+    SimpleInstallFunction(isolate(), mutex_fun, "isMutex",
+                          Builtin::kAtomicsMutexIsMutex, 1, true);
   }
 
   {  // Atomics.Condition
     Handle<String> condition_str =
         isolate()->factory()->InternalizeUtf8String("Condition");
     Handle<JSFunction> condition_fun = CreateSharedObjectConstructor(
-        isolate(), condition_str, JS_ATOMICS_CONDITION_TYPE,
-        JSAtomicsCondition::kHeaderSize, 0, TERMINAL_FAST_ELEMENTS_KIND,
+        isolate(), condition_str, roots.js_atomics_condition_map_handle(),
         Builtin::kAtomicsConditionConstructor);
-    condition_fun->shared().set_internal_formal_parameter_count(
+    condition_fun->shared()->set_internal_formal_parameter_count(
         JSParameterCount(0));
-    condition_fun->shared().set_length(0);
-    native_context()->set_js_atomics_condition_map(
-        condition_fun->initial_map());
-    JSObject::AddProperty(isolate(), isolate()->atomics_object(), condition_str,
+    condition_fun->shared()->set_length(0);
+    JSObject::AddProperty(isolate(), atomics_object, condition_str,
                           condition_fun, DONT_ENUM);
 
     SimpleInstallFunction(isolate(), condition_fun, "wait",
                           Builtin::kAtomicsConditionWait, 2, false);
     SimpleInstallFunction(isolate(), condition_fun, "notify",
                           Builtin::kAtomicsConditionNotify, 2, false);
+    SimpleInstallFunction(isolate(), condition_fun, "isCondition",
+                          Builtin::kAtomicsConditionIsCondition, 1, true);
   }
 }
 
 void Genesis::InitializeGlobal_harmony_array_grouping() {
   if (!v8_flags.harmony_array_grouping) return;
 
-  Handle<JSFunction> array_function(native_context()->array_function(),
-                                    isolate());
-  Handle<JSObject> array_prototype(
-      JSObject::cast(array_function->instance_prototype()), isolate());
-
-  SimpleInstallFunction(isolate_, array_prototype, "group",
-                        Builtin::kArrayPrototypeGroup, 1, false);
-  SimpleInstallFunction(isolate_, array_prototype, "groupToMap",
-                        Builtin::kArrayPrototypeGroupToMap, 1, false);
-
-  Handle<JSObject> unscopables = Handle<JSObject>::cast(
-      JSObject::GetProperty(isolate(), array_prototype,
-                            isolate()->factory()->unscopables_symbol())
-          .ToHandleChecked());
+  Handle<JSFunction> object_function(native_context()->object_function(),
+                                     isolate());
+  Handle<JSFunction> map_function(native_context()->js_map_fun(), isolate());
 
-  InstallTrueValuedProperty(isolate_, unscopables, "group");
-  InstallTrueValuedProperty(isolate_, unscopables, "groupToMap");
+  SimpleInstallFunction(isolate_, object_function, "groupBy",
+                        Builtin::kObjectGroupBy, 2, true);
+  SimpleInstallFunction(isolate_, map_function, "groupBy", Builtin::kMapGroupBy,
+                        2, true);
 }
 
-void Genesis::InitializeGlobal_harmony_sharedarraybuffer() {
-  if (!v8_flags.harmony_sharedarraybuffer ||
-      v8_flags.enable_sharedarraybuffer_per_context) {
+void Genesis::InitializeGlobal_sharedarraybuffer() {
+  if (v8_flags.enable_sharedarraybuffer_per_context) {
     return;
   }
 
@@ -4876,16 +4989,6 @@ void Genesis::InitializeGlobal_harmony_sharedarraybuffer() {
                         isolate()->shared_array_buffer_fun(), DONT_ENUM);
 }
 
-void Genesis::InitializeGlobal_harmony_atomics() {
-  if (!v8_flags.harmony_atomics) return;
-
-  Handle<JSGlobalObject> global(native_context()->global_object(), isolate());
-
-  JSObject::AddProperty(isolate_, global, "Atomics",
-                        isolate()->atomics_object(), DONT_ENUM);
-  InstallToStringTag(isolate_, isolate()->atomics_object(), "Atomics");
-}
-
 void Genesis::InitializeGlobal_harmony_weak_refs_with_cleanup_some() {
   if (!v8_flags.harmony_weak_refs_with_cleanup_some) return;
 
@@ -4922,7 +5025,8 @@ void Genesis::InitializeGlobal_regexp_linear_flag() {
 void Genesis::InitializeGlobal_harmony_rab_gsab() {
   if (!v8_flags.harmony_rab_gsab) return;
   Handle<JSObject> array_buffer_prototype(
-      JSObject::cast(native_context()->array_buffer_fun().instance_prototype()),
+      JSObject::cast(
+          native_context()->array_buffer_fun()->instance_prototype()),
       isolate());
   SimpleInstallGetter(isolate(), array_buffer_prototype,
                       factory()->max_byte_length_string(),
@@ -4945,7 +5049,7 @@ void Genesis::InitializeGlobal_harmony_rab_gsab() {
 
   Handle<JSObject> shared_array_buffer_prototype(
       JSObject::cast(
-          native_context()->shared_array_buffer_fun().instance_prototype()),
+          native_context()->shared_array_buffer_fun()->instance_prototype()),
       isolate());
   SimpleInstallGetter(isolate(), shared_array_buffer_prototype,
                       factory()->max_byte_length_string(),
@@ -4963,7 +5067,7 @@ void Genesis::InitializeGlobal_harmony_string_is_well_formed() {
   Handle<JSFunction> string_function(native_context()->string_function(),
                                      isolate());
   Handle<JSObject> string_prototype(
-      JSObject::cast(string_function->initial_map().prototype()), isolate());
+      JSObject::cast(string_function->initial_map()->prototype()), isolate());
   SimpleInstallFunction(isolate(), string_prototype, "isWellFormed",
                         Builtin::kStringPrototypeIsWellFormed, 0, false);
   SimpleInstallFunction(isolate(), string_prototype, "toWellFormed",
@@ -5016,8 +5120,8 @@ void Genesis::InitializeGlobal_harmony_temporal() {
       isolate(), temporal, #N, JS_TEMPORAL_##U##_TYPE,                         \
       JSTemporal##N::kHeaderSize, 0, factory()->the_hole_value(),              \
       Builtin::kTemporal##N##Constructor);                                     \
-  obj_func->shared().set_length(NUM_ARGS);                                     \
-  obj_func->shared().DontAdaptArguments();                                     \
+  obj_func->shared()->set_length(NUM_ARGS);                                    \
+  obj_func->shared()->DontAdaptArguments();                                    \
   InstallWithIntrinsicDefaultProto(isolate_, obj_func,                         \
                                    Context::JS_TEMPORAL_##U##_FUNCTION_INDEX); \
   Handle<JSObject> prototype(JSObject::cast(obj_func->instance_prototype()),   \
@@ -5612,38 +5716,27 @@ void Genesis::InitializeGlobal_harmony_temporal() {
 }
 
 #ifdef V8_INTL_SUPPORT
-
-void Genesis::InitializeGlobal_harmony_intl_number_format_v3() {
-  if (!v8_flags.harmony_intl_number_format_v3) return;
-
-  {
-    Handle<JSFunction> number_format_constructor =
-        isolate()->intl_number_format_function();
-
-    Handle<JSObject> prototype(
-        JSObject::cast(number_format_constructor->prototype()), isolate());
-
-    SimpleInstallFunction(isolate(), prototype, "formatRange",
-                          Builtin::kNumberFormatPrototypeFormatRange, 2, false);
-    SimpleInstallFunction(isolate(), prototype, "formatRangeToParts",
-                          Builtin::kNumberFormatPrototypeFormatRangeToParts, 2,
-                          false);
-  }
-  {
-    Handle<JSFunction> plural_rules_constructor =
-        isolate()->intl_plural_rules_function();
-
-    Handle<JSObject> prototype(
-        JSObject::cast(plural_rules_constructor->prototype()), isolate());
-
-    SimpleInstallFunction(isolate(), prototype, "selectRange",
-                          Builtin::kPluralRulesPrototypeSelectRange, 2, false);
-  }
+void Genesis::InitializeGlobal_harmony_intl_locale_info_func() {
+  if (!v8_flags.harmony_intl_locale_info_func) return;
+  Handle<JSObject> prototype(
+      JSObject::cast(native_context()->intl_locale_function()->prototype()),
+      isolate_);
+  SimpleInstallFunction(isolate(), prototype, "getCalendars",
+                        Builtin::kLocalePrototypeGetCalendars, 0, false);
+  SimpleInstallFunction(isolate(), prototype, "getCollations",
+                        Builtin::kLocalePrototypeGetCollations, 0, false);
+  SimpleInstallFunction(isolate(), prototype, "getHourCycles",
+                        Builtin::kLocalePrototypeGetHourCycles, 0, false);
+  SimpleInstallFunction(isolate(), prototype, "getNumberingSystems",
+                        Builtin::kLocalePrototypeGetNumberingSystems, 0, false);
+  SimpleInstallFunction(isolate(), prototype, "getTimeZones",
+                        Builtin::kLocalePrototypeGetTimeZones, 0, false);
+  SimpleInstallFunction(isolate(), prototype, "getTextInfo",
+                        Builtin::kLocalePrototypeGetTextInfo, 0, false);
+  SimpleInstallFunction(isolate(), prototype, "getWeekInfo",
+                        Builtin::kLocalePrototypeGetWeekInfo, 0, false);
 }
 
-#endif  // V8_INTL_SUPPORT
-
-#ifdef V8_INTL_SUPPORT
 void Genesis::InitializeGlobal_harmony_intl_duration_format() {
   if (!v8_flags.harmony_intl_duration_format) return;
   Handle<JSObject> intl = Handle<JSObject>::cast(
@@ -5657,8 +5750,8 @@ void Genesis::InitializeGlobal_harmony_intl_duration_format() {
       isolate(), intl, "DurationFormat", JS_DURATION_FORMAT_TYPE,
       JSDurationFormat::kHeaderSize, 0, factory()->the_hole_value(),
       Builtin::kDurationFormatConstructor);
-  duration_format_fun->shared().set_length(0);
-  duration_format_fun->shared().DontAdaptArguments();
+  duration_format_fun->shared()->set_length(0);
+  duration_format_fun->shared()->DontAdaptArguments();
   InstallWithIntrinsicDefaultProto(
       isolate(), duration_format_fun,
       Context::INTL_DURATION_FORMAT_FUNCTION_INDEX);
@@ -5696,8 +5789,8 @@ Handle<JSFunction> Genesis::CreateArrayBuffer(
       CreateFunction(isolate(), name, JS_ARRAY_BUFFER_TYPE,
                      JSArrayBuffer::kSizeWithEmbedderFields, 0, prototype,
                      Builtin::kArrayBufferConstructor);
-  array_buffer_fun->shared().DontAdaptArguments();
-  array_buffer_fun->shared().set_length(1);
+  array_buffer_fun->shared()->DontAdaptArguments();
+  array_buffer_fun->shared()->set_length(1);
 
   // Install the "constructor" property on the {prototype}.
   JSObject::AddProperty(isolate(), prototype, factory()->constructor_string(),
@@ -5754,23 +5847,23 @@ bool Genesis::InstallABunchOfRandomThings() {
   {
     Handle<JSFunction> object_function(native_context()->object_function(),
                                        isolate());
-    DCHECK(JSObject::cast(object_function->initial_map().prototype())
-               .HasFastProperties());
+    DCHECK(JSObject::cast(object_function->initial_map()->prototype())
+               ->HasFastProperties());
     native_context()->set_object_function_prototype(
-        JSObject::cast(object_function->initial_map().prototype()));
+        JSObject::cast(object_function->initial_map()->prototype()));
     native_context()->set_object_function_prototype_map(
-        HeapObject::cast(object_function->initial_map().prototype()).map());
+        HeapObject::cast(object_function->initial_map()->prototype())->map());
   }
 
   // Store the map for the %StringPrototype% after the natives has been compiled
   // and the String function has been set up.
   Handle<JSFunction> string_function(native_context()->string_function(),
                                      isolate());
-  JSObject string_function_prototype =
-      JSObject::cast(string_function->initial_map().prototype());
-  DCHECK(string_function_prototype.HasFastProperties());
+  Tagged<JSObject> string_function_prototype =
+      JSObject::cast(string_function->initial_map()->prototype());
+  DCHECK(string_function_prototype->HasFastProperties());
   native_context()->set_string_function_prototype_map(
-      string_function_prototype.map());
+      string_function_prototype->map());
 
   Handle<JSGlobalObject> global_object =
       handle(native_context()->global_object(), isolate());
@@ -5822,8 +5915,8 @@ bool Genesis::InstallABunchOfRandomThings() {
                           isolate());
 
     // Verification of important array prototype properties.
-    Object length = proto->length();
-    CHECK(length.IsSmi());
+    Tagged<Object> length = proto->length();
+    CHECK(IsSmi(length));
     CHECK_EQ(Smi::ToInt(length), 0);
     CHECK(proto->HasSmiOrObjectElements());
     // This is necessary to enable fast checks for absence of elements
@@ -5938,9 +6031,9 @@ bool Genesis::InstallABunchOfRandomThings() {
         Handle<JSArray>::cast(factory()->NewJSObjectFromMap(template_map));
     {
       DisallowGarbageCollection no_gc;
-      JSArray raw = *template_object;
-      raw.set_elements(ReadOnlyRoots(isolate()).empty_fixed_array());
-      raw.set_length(Smi::FromInt(0));
+      Tagged<JSArray> raw = *template_object;
+      raw->set_elements(ReadOnlyRoots(isolate()).empty_fixed_array());
+      raw->set_length(Smi::FromInt(0));
     }
 
     // Install a "raw" data property for {raw_object} on {template_object}.
@@ -5973,11 +6066,12 @@ bool Genesis::InstallABunchOfRandomThings() {
         .ToChecked();
     {
       DisallowGarbageCollection no_gc;
-      DescriptorArray desc = template_object->map().instance_descriptors();
+      Tagged<DescriptorArray> desc =
+          template_object->map()->instance_descriptors();
       {
         // Verify TemplateLiteralObject::kRawOffset
-        InternalIndex descriptor_index =
-            desc.Search(*factory()->raw_string(), desc.number_of_descriptors());
+        InternalIndex descriptor_index = desc->Search(
+            *factory()->raw_string(), desc->number_of_descriptors());
         FieldIndex index =
             FieldIndex::ForDescriptor(template_object->map(), descriptor_index);
         CHECK(index.is_inobject());
@@ -5986,9 +6080,9 @@ bool Genesis::InstallABunchOfRandomThings() {
 
       {
         // Verify TemplateLiteralObject::kFunctionLiteralIdOffset
-        InternalIndex descriptor_index = desc.Search(
+        InternalIndex descriptor_index = desc->Search(
             *factory()->template_literal_function_literal_id_symbol(),
-            desc.number_of_descriptors());
+            desc->number_of_descriptors());
         FieldIndex index =
             FieldIndex::ForDescriptor(template_object->map(), descriptor_index);
         CHECK(index.is_inobject());
@@ -5999,8 +6093,8 @@ bool Genesis::InstallABunchOfRandomThings() {
       {
         // Verify TemplateLiteralObject::kSlotIdOffset
         InternalIndex descriptor_index =
-            desc.Search(*factory()->template_literal_slot_id_symbol(),
-                        desc.number_of_descriptors());
+            desc->Search(*factory()->template_literal_slot_id_symbol(),
+                         desc->number_of_descriptors());
         FieldIndex index =
             FieldIndex::ForDescriptor(template_object->map(), descriptor_index);
         CHECK(index.is_inobject());
@@ -6197,10 +6291,13 @@ void Genesis::InitializeMapCaches() {
         JSObject::kMapCacheSize, AllocationType::kOld);
 
     DisallowGarbageCollection no_gc;
+    for (int i = 0; i < JSObject::kMapCacheSize; i++) {
+      cache->Set(i, HeapObjectReference::ClearedValue(isolate()));
+    }
     native_context()->set_map_cache(*cache);
-    Map initial = native_context()->object_function().initial_map();
+    Tagged<Map> initial = native_context()->object_function()->initial_map();
     cache->Set(0, HeapObjectReference::Weak(initial));
-    cache->Set(initial.GetInObjectProperties(),
+    cache->Set(initial->GetInObjectProperties(),
                HeapObjectReference::Weak(initial));
   }
 }
@@ -6390,7 +6487,7 @@ bool Genesis::ConfigureGlobalObject(
     Handle<FunctionTemplateInfo> proxy_constructor(
         FunctionTemplateInfo::cast(global_proxy_data->constructor()),
         isolate());
-    if (!proxy_constructor->GetPrototypeTemplate().IsUndefined(isolate())) {
+    if (!IsUndefined(proxy_constructor->GetPrototypeTemplate(), isolate())) {
       Handle<ObjectTemplateInfo> global_object_data(
           ObjectTemplateInfo::cast(proxy_constructor->GetPrototypeTemplate()),
           isolate());
@@ -6401,7 +6498,7 @@ bool Genesis::ConfigureGlobalObject(
   JSObject::ForceSetPrototype(isolate(), global_proxy, global_object);
 
   native_context()->set_array_buffer_map(
-      native_context()->array_buffer_fun().initial_map());
+      native_context()->array_buffer_fun()->initial_map());
 
   return true;
 }
@@ -6410,7 +6507,7 @@ bool Genesis::ConfigureApiObject(Handle<JSObject> object,
                                  Handle<ObjectTemplateInfo> object_template) {
   DCHECK(!object_template.is_null());
   DCHECK(FunctionTemplateInfo::cast(object_template->constructor())
-             .IsTemplateFor(object->map()));
+             ->IsTemplateFor(object->map()));
 
   MaybeHandle<JSObject> maybe_obj =
       ApiNatives::InstantiateObject(object->GetIsolate(), object_template);
@@ -6440,8 +6537,8 @@ void Genesis::TransferNamedProperties(Handle<JSObject> from,
   // in the snapshotted global object.
   if (from->HasFastProperties()) {
     Handle<DescriptorArray> descs = Handle<DescriptorArray>(
-        from->map().instance_descriptors(isolate()), isolate());
-    for (InternalIndex i : from->map().IterateOwnDescriptors()) {
+        from->map()->instance_descriptors(isolate()), isolate());
+    for (InternalIndex i : from->map()->IterateOwnDescriptors()) {
       PropertyDetails details = descs->GetDetails(i);
       if (details.location() == PropertyLocation::kField) {
         if (details.kind() == PropertyKind::kData) {
@@ -6474,10 +6571,11 @@ void Genesis::TransferNamedProperties(Handle<JSObject> from,
         JSObject::SetNormalizedProperty(to, key, value, d);
       }
     }
-  } else if (from->IsJSGlobalObject()) {
+  } else if (IsJSGlobalObject(*from)) {
     // Copy all keys and values in enumeration order.
     Handle<GlobalDictionary> properties(
-        JSGlobalObject::cast(*from).global_dictionary(kAcquireLoad), isolate());
+        JSGlobalObject::cast(*from)->global_dictionary(kAcquireLoad),
+        isolate());
     Handle<FixedArray> indices =
         GlobalDictionary::IterationIndices(isolate(), properties);
     for (int i = 0; i < indices->length(); i++) {
@@ -6488,7 +6586,7 @@ void Genesis::TransferNamedProperties(Handle<JSObject> from,
       if (PropertyAlreadyExists(isolate(), to, key)) continue;
       // Set the property.
       Handle<Object> value(cell->value(), isolate());
-      if (value->IsTheHole(isolate())) continue;
+      if (IsTheHole(*value, isolate())) continue;
       PropertyDetails details = cell->property_details();
       if (details.kind() == PropertyKind::kData) {
         JSObject::AddProperty(isolate(), to, key, value, details.attributes());
@@ -6507,18 +6605,18 @@ void Genesis::TransferNamedProperties(Handle<JSObject> from,
         from->property_dictionary_swiss(), isolate());
     ReadOnlyRoots roots(isolate());
     for (InternalIndex entry : properties->IterateEntriesOrdered()) {
-      Object raw_key;
+      Tagged<Object> raw_key;
       if (!properties->ToKey(roots, entry, &raw_key)) continue;
 
-      DCHECK(raw_key.IsName());
+      DCHECK(IsName(raw_key));
       Handle<Name> key(Name::cast(raw_key), isolate());
       // If the property is already there we skip it.
       if (PropertyAlreadyExists(isolate(), to, key)) continue;
       // Set the property.
       Handle<Object> value =
           Handle<Object>(properties->ValueAt(entry), isolate());
-      DCHECK(!value->IsCell());
-      DCHECK(!value->IsTheHole(isolate()));
+      DCHECK(!IsCell(*value));
+      DCHECK(!IsTheHole(*value, isolate()));
       PropertyDetails details = properties->DetailsAt(entry);
       DCHECK_EQ(PropertyKind::kData, details.kind());
       JSObject::AddProperty(isolate(), to, key, value, details.attributes());
@@ -6532,17 +6630,17 @@ void Genesis::TransferNamedProperties(Handle<JSObject> from,
     ReadOnlyRoots roots(isolate());
     for (int i = 0; i < key_indices->length(); i++) {
       InternalIndex key_index(Smi::ToInt(key_indices->get(i)));
-      Object raw_key = properties->KeyAt(key_index);
+      Tagged<Object> raw_key = properties->KeyAt(key_index);
       DCHECK(properties->IsKey(roots, raw_key));
-      DCHECK(raw_key.IsName());
+      DCHECK(IsName(raw_key));
       Handle<Name> key(Name::cast(raw_key), isolate());
       // If the property is already there we skip it.
       if (PropertyAlreadyExists(isolate(), to, key)) continue;
       // Set the property.
       Handle<Object> value =
           Handle<Object>(properties->ValueAt(key_index), isolate());
-      DCHECK(!value->IsCell());
-      DCHECK(!value->IsTheHole(isolate()));
+      DCHECK(!IsCell(*value));
+      DCHECK(!IsTheHole(*value, isolate()));
       PropertyDetails details = properties->DetailsAt(key_index);
       DCHECK_EQ(PropertyKind::kData, details.kind());
       JSObject::AddProperty(isolate(), to, key, value, details.attributes());
@@ -6562,14 +6660,14 @@ void Genesis::TransferIndexedProperties(Handle<JSObject> from,
 void Genesis::TransferObject(Handle<JSObject> from, Handle<JSObject> to) {
   HandleScope outer(isolate());
 
-  DCHECK(!from->IsJSArray());
-  DCHECK(!to->IsJSArray());
+  DCHECK(!IsJSArray(*from));
+  DCHECK(!IsJSArray(*to));
 
   TransferNamedProperties(from, to);
   TransferIndexedProperties(from, to);
 
   // Transfer the prototype (new map is needed).
-  Handle<HeapObject> proto(from->map().prototype(), isolate());
+  Handle<HeapObject> proto(from->map()->prototype(), isolate());
   JSObject::ForceSetPrototype(isolate(), to, proto);
 }
 
@@ -6597,13 +6695,13 @@ Handle<Map> Genesis::CreateInitialMapForArraySubclass(int size,
 
   // length descriptor.
   {
-    JSFunction array_function = native_context()->array_function();
+    Tagged<JSFunction> array_function = native_context()->array_function();
     Handle<DescriptorArray> array_descriptors(
-        array_function.initial_map().instance_descriptors(isolate()),
+        array_function->initial_map()->instance_descriptors(isolate()),
         isolate());
     Handle<String> length = factory()->length_string();
     InternalIndex old = array_descriptors->SearchWithCache(
-        isolate(), *length, array_function.initial_map());
+        isolate(), *length, array_function->initial_map());
     DCHECK(old.is_found());
     Descriptor d = Descriptor::AccessorConstant(
         length, handle(array_descriptors->GetStrongValue(old), isolate()),
@@ -6621,8 +6719,8 @@ Genesis::Genesis(
     v8::MicrotaskQueue* microtask_queue)
     : isolate_(isolate), active_(isolate->bootstrapper()) {
   RCS_SCOPE(isolate, RuntimeCallCounterId::kGenesis);
-  result_ = Handle<Context>::null();
-  global_proxy_ = Handle<JSGlobalProxy>::null();
+  result_ = {};
+  global_proxy_ = {};
 
   // Before creating the roots we must save the context and restore it
   // on all function exits.
@@ -6638,8 +6736,10 @@ Genesis::Genesis(
       // The global proxy function to reinitialize this global proxy is in the
       // context that is yet to be deserialized. We need to prepare a global
       // proxy of the correct size.
-      Object size = isolate->heap()->serialized_global_proxy_sizes().get(
-          static_cast<int>(context_snapshot_index) - 1);
+      Tagged<Object> size =
+          isolate->heap()->serialized_global_proxy_sizes()->get(
+              static_cast<int>(context_snapshot_index) -
+              SnapshotCreatorImpl::kFirstAddtlContextIndex);
       instance_size = Smi::ToInt(size);
     } else {
       instance_size = JSGlobalProxy::SizeWithEmbedderFields(
@@ -6687,6 +6787,8 @@ Genesis::Genesis(
   } else {
     DCHECK(native_context().is_null());
 
+    Isolate::EnableRoAllocationForSnapshotScope enable_ro_allocation(isolate);
+
     base::ElapsedTimer timer;
     if (v8_flags.profile_deserialization) timer.Start();
     DCHECK_EQ(0u, context_snapshot_index);
@@ -6731,11 +6833,11 @@ Genesis::Genesis(
     // experimental natives.
     Handle<JSFunction> string_function(native_context()->string_function(),
                                        isolate);
-    JSObject string_function_prototype =
-        JSObject::cast(string_function->initial_map().prototype());
-    DCHECK(string_function_prototype.HasFastProperties());
+    Tagged<JSObject> string_function_prototype =
+        JSObject::cast(string_function->initial_map()->prototype());
+    DCHECK(string_function_prototype->HasFastProperties());
     native_context()->set_string_function_prototype_map(
-        string_function_prototype.map());
+        string_function_prototype->map());
   }
 
   if (v8_flags.disallow_code_generation_from_strings) {
@@ -6756,8 +6858,8 @@ Genesis::Genesis(Isolate* isolate,
                  MaybeHandle<JSGlobalProxy> maybe_global_proxy,
                  v8::Local<v8::ObjectTemplate> global_proxy_template)
     : isolate_(isolate), active_(isolate->bootstrapper()) {
-  result_ = Handle<Context>::null();
-  global_proxy_ = Handle<JSGlobalProxy>::null();
+  result_ = {};
+  global_proxy_ = {};
 
   // Before creating the roots we must save the context and restore it
   // on all function exits.
@@ -6790,14 +6892,14 @@ Genesis::Genesis(Isolate* isolate,
   Handle<Map> global_proxy_map = isolate->factory()->NewMap(
       JS_GLOBAL_PROXY_TYPE, proxy_size, TERMINAL_FAST_ELEMENTS_KIND);
   global_proxy_map->set_is_access_check_needed(true);
-  global_proxy_map->set_may_have_interesting_symbols(true);
+  global_proxy_map->set_may_have_interesting_properties(true);
 
   // A remote global proxy has no native context.
   global_proxy->set_native_context(ReadOnlyRoots(heap()).null_value());
 
   // Configure the hidden prototype chain of the global proxy.
   JSObject::ForceSetPrototype(isolate, global_proxy, global_object);
-  global_proxy->map().SetConstructor(*global_constructor);
+  global_proxy->map()->SetConstructor(*global_constructor);
 
   global_proxy_ = global_proxy;
 }
diff --git a/deps/v8/src/init/bootstrapper.h b/deps/v8/src/init/bootstrapper.h
index 5939db6b4e5047..abcf80264e4d96 100644
--- a/deps/v8/src/init/bootstrapper.h
+++ b/deps/v8/src/init/bootstrapper.h
@@ -55,7 +55,7 @@ class Bootstrapper final {
 
   // Creates a JavaScript Global Context with initial object graph.
   // The returned value is a global handle casted to V8Environment*.
-  Handle<Context> CreateEnvironment(
+  Handle<NativeContext> CreateEnvironment(
       MaybeHandle<JSGlobalProxy> maybe_global_proxy,
       v8::Local<v8::ObjectTemplate> global_object_template,
       v8::ExtensionConfiguration* extensions, size_t context_snapshot_index,
@@ -64,7 +64,7 @@ class Bootstrapper final {
 
   // Used for testing context deserialization. No code runs in the generated
   // context. It only needs to pass heap verification.
-  Handle<Context> CreateEnvironmentForTesting() {
+  Handle<NativeContext> CreateEnvironmentForTesting() {
     MaybeHandle<JSGlobalProxy> no_global_proxy;
     v8::Local<v8::ObjectTemplate> no_global_object_template;
     ExtensionConfiguration no_extensions;
diff --git a/deps/v8/src/init/heap-symbols.h b/deps/v8/src/init/heap-symbols.h
index 5388b88d4e7599..87f1a78a18a50e 100644
--- a/deps/v8/src/init/heap-symbols.h
+++ b/deps/v8/src/init/heap-symbols.h
@@ -167,305 +167,312 @@
   V(_, value_string, "value")                              \
   V(_, writable_string, "writable")
 
-#define NOT_IMPORTANT_INTERNALIZED_STRING_LIST_GENERATOR(V, _)       \
-  INTERNALIZED_STRING_LIST_GENERATOR_INTL(V, _)                      \
-  V(_, add_string, "add")                                            \
-  V(_, AggregateError_string, "AggregateError")                      \
-  V(_, always_string, "always")                                      \
-  V(_, anonymous_function_string, "(anonymous function)")            \
-  V(_, anonymous_string, "anonymous")                                \
-  V(_, apply_string, "apply")                                        \
-  V(_, Arguments_string, "Arguments")                                \
-  V(_, arguments_string, "arguments")                                \
-  V(_, arguments_to_string, "[object Arguments]")                    \
-  V(_, Array_string, "Array")                                        \
-  V(_, array_to_string, "[object Array]")                            \
-  V(_, ArrayBuffer_string, "ArrayBuffer")                            \
-  V(_, ArrayIterator_string, "Array Iterator")                       \
-  V(_, as_string, "as")                                              \
-  V(_, assert_string, "assert")                                      \
-  V(_, async_string, "async")                                        \
-  V(_, AtomicsCondition_string, "Atomics.Condition")                 \
-  V(_, AtomicsMutex_string, "Atomics.Mutex")                         \
-  V(_, auto_string, "auto")                                          \
-  V(_, await_string, "await")                                        \
-  V(_, BigInt_string, "BigInt")                                      \
-  V(_, bigint_string, "bigint")                                      \
-  V(_, BigInt64Array_string, "BigInt64Array")                        \
-  V(_, BigUint64Array_string, "BigUint64Array")                      \
-  V(_, bind_string, "bind")                                          \
-  V(_, blank_string, "blank")                                        \
-  V(_, Boolean_string, "Boolean")                                    \
-  V(_, boolean_string, "boolean")                                    \
-  V(_, boolean_to_string, "[object Boolean]")                        \
-  V(_, bound__string, "bound ")                                      \
-  V(_, buffer_string, "buffer")                                      \
-  V(_, byte_length_string, "byteLength")                             \
-  V(_, byte_offset_string, "byteOffset")                             \
-  V(_, CompileError_string, "CompileError")                          \
-  V(_, calendar_string, "calendar")                                  \
-  V(_, callee_string, "callee")                                      \
-  V(_, caller_string, "caller")                                      \
-  V(_, cause_string, "cause")                                        \
-  V(_, character_string, "character")                                \
-  V(_, closure_string, "(closure)")                                  \
-  V(_, code_string, "code")                                          \
-  V(_, column_string, "column")                                      \
-  V(_, computed_string, "<computed>")                                \
-  V(_, conjunction_string, "conjunction")                            \
-  V(_, console_string, "console")                                    \
-  V(_, constrain_string, "constrain")                                \
-  V(_, construct_string, "construct")                                \
-  V(_, current_string, "current")                                    \
-  V(_, Date_string, "Date")                                          \
-  V(_, date_to_string, "[object Date]")                              \
-  V(_, dateAdd_string, "dateAdd")                                    \
-  V(_, dateFromFields_string, "dateFromFields")                      \
-  V(_, dateUntil_string, "dateUntil")                                \
-  V(_, day_string, "day")                                            \
-  V(_, dayOfWeek_string, "dayOfWeek")                                \
-  V(_, dayOfYear_string, "dayOfYear")                                \
-  V(_, days_string, "days")                                          \
-  V(_, daysInMonth_string, "daysInMonth")                            \
-  V(_, daysInWeek_string, "daysInWeek")                              \
-  V(_, daysInYear_string, "daysInYear")                              \
-  V(_, default_string, "default")                                    \
-  V(_, defineProperty_string, "defineProperty")                      \
-  V(_, deleteProperty_string, "deleteProperty")                      \
-  V(_, detached_string, "detached")                                  \
-  V(_, disjunction_string, "disjunction")                            \
-  V(_, done_string, "done")                                          \
-  V(_, dot_brand_string, ".brand")                                   \
-  V(_, dot_catch_string, ".catch")                                   \
-  V(_, dot_default_string, ".default")                               \
-  V(_, dot_for_string, ".for")                                       \
-  V(_, dot_generator_object_string, ".generator_object")             \
-  V(_, dot_home_object_string, ".home_object")                       \
-  V(_, dot_new_target_string, ".new.target")                         \
-  V(_, dot_result_string, ".result")                                 \
-  V(_, dot_repl_result_string, ".repl_result")                       \
-  V(_, dot_static_home_object_string, ".static_home_object")         \
-  V(_, dot_string, ".")                                              \
-  V(_, dot_switch_tag_string, ".switch_tag")                         \
-  V(_, dotAll_string, "dotAll")                                      \
-  V(_, Error_string, "Error")                                        \
-  V(_, EvalError_string, "EvalError")                                \
-  V(_, element_string, "element")                                    \
-  V(_, epochMicroseconds_string, "epochMicroseconds")                \
-  V(_, epochMilliseconds_string, "epochMilliseconds")                \
-  V(_, epochNanoseconds_string, "epochNanoseconds")                  \
-  V(_, epochSeconds_string, "epochSeconds")                          \
-  V(_, era_string, "era")                                            \
-  V(_, eraYear_string, "eraYear")                                    \
-  V(_, errors_string, "errors")                                      \
-  V(_, error_to_string, "[object Error]")                            \
-  V(_, eval_string, "eval")                                          \
-  V(_, exception_string, "exception")                                \
-  V(_, exec_string, "exec")                                          \
-  V(_, false_string, "false")                                        \
-  V(_, fields_string, "fields")                                      \
-  V(_, FinalizationRegistry_string, "FinalizationRegistry")          \
-  V(_, flags_string, "flags")                                        \
-  V(_, Float32Array_string, "Float32Array")                          \
-  V(_, Float64Array_string, "Float64Array")                          \
-  V(_, fractionalSecondDigits_string, "fractionalSecondDigits")      \
-  V(_, from_string, "from")                                          \
-  V(_, Function_string, "Function")                                  \
-  V(_, function_native_code_string, "function () { [native code] }") \
-  V(_, function_string, "function")                                  \
-  V(_, function_to_string, "[object Function]")                      \
-  V(_, Generator_string, "Generator")                                \
-  V(_, get_space_string, "get ")                                     \
-  V(_, get_string, "get")                                            \
-  V(_, getOffsetNanosecondsFor_string, "getOffsetNanosecondsFor")    \
-  V(_, getOwnPropertyDescriptor_string, "getOwnPropertyDescriptor")  \
-  V(_, getPossibleInstantsFor_string, "getPossibleInstantsFor")      \
-  V(_, getPrototypeOf_string, "getPrototypeOf")                      \
-  V(_, global_string, "global")                                      \
-  V(_, globalThis_string, "globalThis")                              \
-  V(_, groups_string, "groups")                                      \
-  V(_, growable_string, "growable")                                  \
-  V(_, has_string, "has")                                            \
-  V(_, hasIndices_string, "hasIndices")                              \
-  V(_, hour_string, "hour")                                          \
-  V(_, hours_string, "hours")                                        \
-  V(_, hoursInDay_string, "hoursInDay")                              \
-  V(_, ignoreCase_string, "ignoreCase")                              \
-  V(_, id_string, "id")                                              \
-  V(_, illegal_access_string, "illegal access")                      \
-  V(_, illegal_argument_string, "illegal argument")                  \
-  V(_, inLeapYear_string, "inLeapYear")                              \
-  V(_, index_string, "index")                                        \
-  V(_, indices_string, "indices")                                    \
-  V(_, Infinity_string, "Infinity")                                  \
-  V(_, infinity_string, "infinity")                                  \
-  V(_, input_string, "input")                                        \
-  V(_, Int16Array_string, "Int16Array")                              \
-  V(_, Int32Array_string, "Int32Array")                              \
-  V(_, Int8Array_string, "Int8Array")                                \
-  V(_, isExtensible_string, "isExtensible")                          \
-  V(_, iso8601_string, "iso8601")                                    \
-  V(_, isoDay_string, "isoDay")                                      \
-  V(_, isoHour_string, "isoHour")                                    \
-  V(_, isoMicrosecond_string, "isoMicrosecond")                      \
-  V(_, isoMillisecond_string, "isoMillisecond")                      \
-  V(_, isoMinute_string, "isoMinute")                                \
-  V(_, isoMonth_string, "isoMonth")                                  \
-  V(_, isoNanosecond_string, "isoNanosecond")                        \
-  V(_, isoSecond_string, "isoSecond")                                \
-  V(_, isoYear_string, "isoYear")                                    \
-  V(_, jsMemoryEstimate_string, "jsMemoryEstimate")                  \
-  V(_, jsMemoryRange_string, "jsMemoryRange")                        \
-  V(_, keys_string, "keys")                                          \
-  V(_, largestUnit_string, "largestUnit")                            \
-  V(_, lastIndex_string, "lastIndex")                                \
-  V(_, let_string, "let")                                            \
-  V(_, line_string, "line")                                          \
-  V(_, linear_string, "linear")                                      \
-  V(_, LinkError_string, "LinkError")                                \
-  V(_, long_string, "long")                                          \
-  V(_, Map_string, "Map")                                            \
-  V(_, MapIterator_string, "Map Iterator")                           \
-  V(_, max_byte_length_string, "maxByteLength")                      \
-  V(_, medium_string, "medium")                                      \
-  V(_, mergeFields_string, "mergeFields")                            \
-  V(_, message_string, "message")                                    \
-  V(_, meta_string, "meta")                                          \
-  V(_, minus_Infinity_string, "-Infinity")                           \
-  V(_, microsecond_string, "microsecond")                            \
-  V(_, microseconds_string, "microseconds")                          \
-  V(_, millisecond_string, "millisecond")                            \
-  V(_, milliseconds_string, "milliseconds")                          \
-  V(_, minute_string, "minute")                                      \
-  V(_, minutes_string, "minutes")                                    \
-  V(_, Module_string, "Module")                                      \
-  V(_, month_string, "month")                                        \
-  V(_, monthDayFromFields_string, "monthDayFromFields")              \
-  V(_, months_string, "months")                                      \
-  V(_, monthsInYear_string, "monthsInYear")                          \
-  V(_, monthCode_string, "monthCode")                                \
-  V(_, multiline_string, "multiline")                                \
-  V(_, NaN_string, "NaN")                                            \
-  V(_, nanosecond_string, "nanosecond")                              \
-  V(_, nanoseconds_string, "nanoseconds")                            \
-  V(_, narrow_string, "narrow")                                      \
-  V(_, native_string, "native")                                      \
-  V(_, new_target_string, ".new.target")                             \
-  V(_, NFC_string, "NFC")                                            \
-  V(_, NFD_string, "NFD")                                            \
-  V(_, NFKC_string, "NFKC")                                          \
-  V(_, NFKD_string, "NFKD")                                          \
-  V(_, not_equal_string, "not-equal")                                \
-  V(_, null_string, "null")                                          \
-  V(_, null_to_string, "[object Null]")                              \
-  V(_, Number_string, "Number")                                      \
-  V(_, number_string, "number")                                      \
-  V(_, number_to_string, "[object Number]")                          \
-  V(_, Object_string, "Object")                                      \
-  V(_, object_string, "object")                                      \
-  V(_, object_to_string, "[object Object]")                          \
-  V(_, Object_prototype_string, "Object.prototype")                  \
-  V(_, of_string, "of")                                              \
-  V(_, offset_string, "offset")                                      \
-  V(_, offsetNanoseconds_string, "offsetNanoseconds")                \
-  V(_, ok_string, "ok")                                              \
-  V(_, one_string, "1")                                              \
-  V(_, other_string, "other")                                        \
-  V(_, overflow_string, "overflow")                                  \
-  V(_, ownKeys_string, "ownKeys")                                    \
-  V(_, percent_string, "percent")                                    \
-  V(_, plainDate_string, "plainDate")                                \
-  V(_, plainTime_string, "plainTime")                                \
-  V(_, position_string, "position")                                  \
-  V(_, preventExtensions_string, "preventExtensions")                \
-  V(_, private_constructor_string, "#constructor")                   \
-  V(_, Promise_string, "Promise")                                    \
-  V(_, proto_string, "__proto__")                                    \
-  V(_, proxy_string, "proxy")                                        \
-  V(_, Proxy_string, "Proxy")                                        \
-  V(_, query_colon_string, "(?:)")                                   \
-  V(_, RangeError_string, "RangeError")                              \
-  V(_, raw_json_string, "rawJSON")                                   \
-  V(_, raw_string, "raw")                                            \
-  V(_, ReferenceError_string, "ReferenceError")                      \
-  V(_, ReflectGet_string, "Reflect.get")                             \
-  V(_, ReflectHas_string, "Reflect.has")                             \
-  V(_, RegExp_string, "RegExp")                                      \
-  V(_, regexp_to_string, "[object RegExp]")                          \
-  V(_, reject_string, "reject")                                      \
-  V(_, relativeTo_string, "relativeTo")                              \
-  V(_, resizable_string, "resizable")                                \
-  V(_, ResizableArrayBuffer_string, "ResizableArrayBuffer")          \
-  V(_, return_string, "return")                                      \
-  V(_, revoke_string, "revoke")                                      \
-  V(_, roundingIncrement_string, "roundingIncrement")                \
-  V(_, RuntimeError_string, "RuntimeError")                          \
-  V(_, WebAssemblyException_string, "WebAssembly.Exception")         \
-  V(_, Script_string, "Script")                                      \
-  V(_, script_string, "script")                                      \
-  V(_, second_string, "second")                                      \
-  V(_, seconds_string, "seconds")                                    \
-  V(_, short_string, "short")                                        \
-  V(_, Set_string, "Set")                                            \
-  V(_, sentence_string, "sentence")                                  \
-  V(_, set_space_string, "set ")                                     \
-  V(_, set_string, "set")                                            \
-  V(_, SetIterator_string, "Set Iterator")                           \
-  V(_, setPrototypeOf_string, "setPrototypeOf")                      \
-  V(_, ShadowRealm_string, "ShadowRealm")                            \
-  V(_, SharedArray_string, "SharedArray")                            \
-  V(_, SharedArrayBuffer_string, "SharedArrayBuffer")                \
-  V(_, SharedStruct_string, "SharedStruct")                          \
-  V(_, sign_string, "sign")                                          \
-  V(_, smallestUnit_string, "smallestUnit")                          \
-  V(_, source_string, "source")                                      \
-  V(_, sourceText_string, "sourceText")                              \
-  V(_, stack_string, "stack")                                        \
-  V(_, stackTraceLimit_string, "stackTraceLimit")                    \
-  V(_, sticky_string, "sticky")                                      \
-  V(_, String_string, "String")                                      \
-  V(_, string_string, "string")                                      \
-  V(_, string_to_string, "[object String]")                          \
-  V(_, Symbol_iterator_string, "Symbol.iterator")                    \
-  V(_, Symbol_replace_string, "Symbol.replace")                      \
-  V(_, symbol_species_string, "[Symbol.species]")                    \
-  V(_, Symbol_species_string, "Symbol.species")                      \
-  V(_, Symbol_string, "Symbol")                                      \
-  V(_, symbol_string, "symbol")                                      \
-  V(_, SyntaxError_string, "SyntaxError")                            \
-  V(_, target_string, "target")                                      \
-  V(_, this_function_string, ".this_function")                       \
-  V(_, this_string, "this")                                          \
-  V(_, throw_string, "throw")                                        \
-  V(_, timed_out_string, "timed-out")                                \
-  V(_, timeZone_string, "timeZone")                                  \
-  V(_, toJSON_string, "toJSON")                                      \
-  V(_, toString_string, "toString")                                  \
-  V(_, true_string, "true")                                          \
-  V(_, total_string, "total")                                        \
-  V(_, TypeError_string, "TypeError")                                \
-  V(_, Uint16Array_string, "Uint16Array")                            \
-  V(_, Uint32Array_string, "Uint32Array")                            \
-  V(_, Uint8Array_string, "Uint8Array")                              \
-  V(_, Uint8ClampedArray_string, "Uint8ClampedArray")                \
-  V(_, undefined_string, "undefined")                                \
-  V(_, undefined_to_string, "[object Undefined]")                    \
-  V(_, unicode_string, "unicode")                                    \
-  V(_, unicodeSets_string, "unicodeSets")                            \
-  V(_, unit_string, "unit")                                          \
-  V(_, URIError_string, "URIError")                                  \
-  V(_, UTC_string, "UTC")                                            \
-  V(_, valueOf_string, "valueOf")                                    \
-  V(_, WeakMap_string, "WeakMap")                                    \
-  V(_, WeakRef_string, "WeakRef")                                    \
-  V(_, WeakSet_string, "WeakSet")                                    \
-  V(_, week_string, "week")                                          \
-  V(_, weeks_string, "weeks")                                        \
-  V(_, weekOfYear_string, "weekOfYear")                              \
-  V(_, word_string, "word")                                          \
-  V(_, yearMonthFromFields_string, "yearMonthFromFields")            \
-  V(_, year_string, "year")                                          \
-  V(_, years_string, "years")                                        \
+#define NOT_IMPORTANT_INTERNALIZED_STRING_LIST_GENERATOR(V, _)                \
+  INTERNALIZED_STRING_LIST_GENERATOR_INTL(V, _)                               \
+  V(_, add_string, "add")                                                     \
+  V(_, AggregateError_string, "AggregateError")                               \
+  V(_, always_string, "always")                                               \
+  V(_, anonymous_function_string, "(anonymous function)")                     \
+  V(_, anonymous_string, "anonymous")                                         \
+  V(_, apply_string, "apply")                                                 \
+  V(_, Arguments_string, "Arguments")                                         \
+  V(_, arguments_string, "arguments")                                         \
+  V(_, arguments_to_string, "[object Arguments]")                             \
+  V(_, Array_string, "Array")                                                 \
+  V(_, array_to_string, "[object Array]")                                     \
+  V(_, ArrayBuffer_string, "ArrayBuffer")                                     \
+  V(_, ArrayIterator_string, "Array Iterator")                                \
+  V(_, as_string, "as")                                                       \
+  V(_, assert_string, "assert")                                               \
+  V(_, async_string, "async")                                                 \
+  V(_, AtomicsCondition_string, "Atomics.Condition")                          \
+  V(_, AtomicsMutex_string, "Atomics.Mutex")                                  \
+  V(_, auto_string, "auto")                                                   \
+  V(_, await_string, "await")                                                 \
+  V(_, BigInt_string, "BigInt")                                               \
+  V(_, bigint_string, "bigint")                                               \
+  V(_, BigInt64Array_string, "BigInt64Array")                                 \
+  V(_, BigUint64Array_string, "BigUint64Array")                               \
+  V(_, bind_string, "bind")                                                   \
+  V(_, blank_string, "blank")                                                 \
+  V(_, Boolean_string, "Boolean")                                             \
+  V(_, boolean_string, "boolean")                                             \
+  V(_, boolean_to_string, "[object Boolean]")                                 \
+  V(_, bound__string, "bound ")                                               \
+  V(_, buffer_string, "buffer")                                               \
+  V(_, byte_length_string, "byteLength")                                      \
+  V(_, byte_offset_string, "byteOffset")                                      \
+  V(_, CompileError_string, "CompileError")                                   \
+  V(_, calendar_string, "calendar")                                           \
+  V(_, callee_string, "callee")                                               \
+  V(_, caller_string, "caller")                                               \
+  V(_, cause_string, "cause")                                                 \
+  V(_, character_string, "character")                                         \
+  V(_, closure_string, "(closure)")                                           \
+  V(_, code_string, "code")                                                   \
+  V(_, column_string, "column")                                               \
+  V(_, computed_string, "<computed>")                                         \
+  V(_, conjunction_string, "conjunction")                                     \
+  V(_, console_string, "console")                                             \
+  V(_, constrain_string, "constrain")                                         \
+  V(_, construct_string, "construct")                                         \
+  V(_, current_string, "current")                                             \
+  V(_, Date_string, "Date")                                                   \
+  V(_, date_to_string, "[object Date]")                                       \
+  V(_, dateAdd_string, "dateAdd")                                             \
+  V(_, dateFromFields_string, "dateFromFields")                               \
+  V(_, dateUntil_string, "dateUntil")                                         \
+  V(_, day_string, "day")                                                     \
+  V(_, dayOfWeek_string, "dayOfWeek")                                         \
+  V(_, dayOfYear_string, "dayOfYear")                                         \
+  V(_, days_string, "days")                                                   \
+  V(_, daysInMonth_string, "daysInMonth")                                     \
+  V(_, daysInWeek_string, "daysInWeek")                                       \
+  V(_, daysInYear_string, "daysInYear")                                       \
+  V(_, default_string, "default")                                             \
+  V(_, defineProperty_string, "defineProperty")                               \
+  V(_, deleteProperty_string, "deleteProperty")                               \
+  V(_, detached_string, "detached")                                           \
+  V(_, disjunction_string, "disjunction")                                     \
+  V(_, done_string, "done")                                                   \
+  V(_, dot_brand_string, ".brand")                                            \
+  V(_, dot_catch_string, ".catch")                                            \
+  V(_, dot_default_string, ".default")                                        \
+  V(_, dot_for_string, ".for")                                                \
+  V(_, dot_generator_object_string, ".generator_object")                      \
+  V(_, dot_home_object_string, ".home_object")                                \
+  V(_, dot_new_target_string, ".new.target")                                  \
+  V(_, dot_result_string, ".result")                                          \
+  V(_, dot_repl_result_string, ".repl_result")                                \
+  V(_, dot_static_home_object_string, ".static_home_object")                  \
+  V(_, dot_string, ".")                                                       \
+  V(_, dot_switch_tag_string, ".switch_tag")                                  \
+  V(_, dotAll_string, "dotAll")                                               \
+  V(_, Error_string, "Error")                                                 \
+  V(_, EvalError_string, "EvalError")                                         \
+  V(_, element_string, "element")                                             \
+  V(_, epochMicroseconds_string, "epochMicroseconds")                         \
+  V(_, epochMilliseconds_string, "epochMilliseconds")                         \
+  V(_, epochNanoseconds_string, "epochNanoseconds")                           \
+  V(_, epochSeconds_string, "epochSeconds")                                   \
+  V(_, era_string, "era")                                                     \
+  V(_, eraYear_string, "eraYear")                                             \
+  V(_, errors_string, "errors")                                               \
+  V(_, error_to_string, "[object Error]")                                     \
+  V(_, eval_string, "eval")                                                   \
+  V(_, exception_string, "exception")                                         \
+  V(_, exec_string, "exec")                                                   \
+  V(_, false_string, "false")                                                 \
+  V(_, fields_string, "fields")                                               \
+  V(_, FinalizationRegistry_string, "FinalizationRegistry")                   \
+  V(_, flags_string, "flags")                                                 \
+  V(_, Float32Array_string, "Float32Array")                                   \
+  V(_, Float64Array_string, "Float64Array")                                   \
+  V(_, fractionalSecondDigits_string, "fractionalSecondDigits")               \
+  V(_, from_string, "from")                                                   \
+  V(_, Function_string, "Function")                                           \
+  V(_, function_native_code_string, "function () { [native code] }")          \
+  V(_, function_string, "function")                                           \
+  V(_, function_to_string, "[object Function]")                               \
+  V(_, Generator_string, "Generator")                                         \
+  V(_, get_space_string, "get ")                                              \
+  V(_, get_string, "get")                                                     \
+  V(_, getOffsetNanosecondsFor_string, "getOffsetNanosecondsFor")             \
+  V(_, getOwnPropertyDescriptor_string, "getOwnPropertyDescriptor")           \
+  V(_, getPossibleInstantsFor_string, "getPossibleInstantsFor")               \
+  V(_, getPrototypeOf_string, "getPrototypeOf")                               \
+  V(_, global_string, "global")                                               \
+  V(_, globalThis_string, "globalThis")                                       \
+  V(_, groups_string, "groups")                                               \
+  V(_, growable_string, "growable")                                           \
+  V(_, has_string, "has")                                                     \
+  V(_, hasIndices_string, "hasIndices")                                       \
+  V(_, hour_string, "hour")                                                   \
+  V(_, hours_string, "hours")                                                 \
+  V(_, hoursInDay_string, "hoursInDay")                                       \
+  V(_, ignoreCase_string, "ignoreCase")                                       \
+  V(_, id_string, "id")                                                       \
+  V(_, illegal_access_string, "illegal access")                               \
+  V(_, illegal_argument_string, "illegal argument")                           \
+  V(_, inLeapYear_string, "inLeapYear")                                       \
+  V(_, index_string, "index")                                                 \
+  V(_, indices_string, "indices")                                             \
+  V(_, Infinity_string, "Infinity")                                           \
+  V(_, infinity_string, "infinity")                                           \
+  V(_, input_string, "input")                                                 \
+  V(_, instance_members_initializer_string, "<instance_members_initializer>") \
+  V(_, Int16Array_string, "Int16Array")                                       \
+  V(_, Int32Array_string, "Int32Array")                                       \
+  V(_, Int8Array_string, "Int8Array")                                         \
+  V(_, isExtensible_string, "isExtensible")                                   \
+  V(_, iso8601_string, "iso8601")                                             \
+  V(_, isoDay_string, "isoDay")                                               \
+  V(_, isoHour_string, "isoHour")                                             \
+  V(_, isoMicrosecond_string, "isoMicrosecond")                               \
+  V(_, isoMillisecond_string, "isoMillisecond")                               \
+  V(_, isoMinute_string, "isoMinute")                                         \
+  V(_, isoMonth_string, "isoMonth")                                           \
+  V(_, isoNanosecond_string, "isoNanosecond")                                 \
+  V(_, isoSecond_string, "isoSecond")                                         \
+  V(_, isoYear_string, "isoYear")                                             \
+  V(_, jsMemoryEstimate_string, "jsMemoryEstimate")                           \
+  V(_, jsMemoryRange_string, "jsMemoryRange")                                 \
+  V(_, keys_string, "keys")                                                   \
+  V(_, largestUnit_string, "largestUnit")                                     \
+  V(_, lastIndex_string, "lastIndex")                                         \
+  V(_, let_string, "let")                                                     \
+  V(_, line_string, "line")                                                   \
+  V(_, linear_string, "linear")                                               \
+  V(_, LinkError_string, "LinkError")                                         \
+  V(_, long_string, "long")                                                   \
+  V(_, Map_string, "Map")                                                     \
+  V(_, MapIterator_string, "Map Iterator")                                    \
+  V(_, max_byte_length_string, "maxByteLength")                               \
+  V(_, medium_string, "medium")                                               \
+  V(_, mergeFields_string, "mergeFields")                                     \
+  V(_, message_string, "message")                                             \
+  V(_, meta_string, "meta")                                                   \
+  V(_, minus_Infinity_string, "-Infinity")                                    \
+  V(_, microsecond_string, "microsecond")                                     \
+  V(_, microseconds_string, "microseconds")                                   \
+  V(_, millisecond_string, "millisecond")                                     \
+  V(_, milliseconds_string, "milliseconds")                                   \
+  V(_, minute_string, "minute")                                               \
+  V(_, minutes_string, "minutes")                                             \
+  V(_, Module_string, "Module")                                               \
+  V(_, month_string, "month")                                                 \
+  V(_, monthDayFromFields_string, "monthDayFromFields")                       \
+  V(_, months_string, "months")                                               \
+  V(_, monthsInYear_string, "monthsInYear")                                   \
+  V(_, monthCode_string, "monthCode")                                         \
+  V(_, multiline_string, "multiline")                                         \
+  V(_, NaN_string, "NaN")                                                     \
+  V(_, nanosecond_string, "nanosecond")                                       \
+  V(_, nanoseconds_string, "nanoseconds")                                     \
+  V(_, narrow_string, "narrow")                                               \
+  V(_, native_string, "native")                                               \
+  V(_, new_target_string, ".new.target")                                      \
+  V(_, NFC_string, "NFC")                                                     \
+  V(_, NFD_string, "NFD")                                                     \
+  V(_, NFKC_string, "NFKC")                                                   \
+  V(_, NFKD_string, "NFKD")                                                   \
+  V(_, not_equal_string, "not-equal")                                         \
+  V(_, null_string, "null")                                                   \
+  V(_, null_to_string, "[object Null]")                                       \
+  V(_, Number_string, "Number")                                               \
+  V(_, number_string, "number")                                               \
+  V(_, number_to_string, "[object Number]")                                   \
+  V(_, Object_string, "Object")                                               \
+  V(_, object_string, "object")                                               \
+  V(_, object_to_string, "[object Object]")                                   \
+  V(_, Object_prototype_string, "Object.prototype")                           \
+  V(_, of_string, "of")                                                       \
+  V(_, offset_string, "offset")                                               \
+  V(_, offsetNanoseconds_string, "offsetNanoseconds")                         \
+  V(_, ok_string, "ok")                                                       \
+  V(_, one_string, "1")                                                       \
+  V(_, other_string, "other")                                                 \
+  V(_, overflow_string, "overflow")                                           \
+  V(_, ownKeys_string, "ownKeys")                                             \
+  V(_, percent_string, "percent")                                             \
+  V(_, plainDate_string, "plainDate")                                         \
+  V(_, plainTime_string, "plainTime")                                         \
+  V(_, position_string, "position")                                           \
+  V(_, preventExtensions_string, "preventExtensions")                         \
+  V(_, private_constructor_string, "#constructor")                            \
+  V(_, Promise_string, "Promise")                                             \
+  V(_, promise_string, "promise")                                             \
+  V(_, proto_string, "__proto__")                                             \
+  V(_, proxy_string, "proxy")                                                 \
+  V(_, Proxy_string, "Proxy")                                                 \
+  V(_, query_colon_string, "(?:)")                                            \
+  V(_, RangeError_string, "RangeError")                                       \
+  V(_, raw_json_string, "rawJSON")                                            \
+  V(_, raw_string, "raw")                                                     \
+  V(_, ReferenceError_string, "ReferenceError")                               \
+  V(_, ReflectGet_string, "Reflect.get")                                      \
+  V(_, ReflectHas_string, "Reflect.has")                                      \
+  V(_, RegExp_string, "RegExp")                                               \
+  V(_, regexp_to_string, "[object RegExp]")                                   \
+  V(_, reject_string, "reject")                                               \
+  V(_, relativeTo_string, "relativeTo")                                       \
+  V(_, resizable_string, "resizable")                                         \
+  V(_, ResizableArrayBuffer_string, "ResizableArrayBuffer")                   \
+  V(_, return_string, "return")                                               \
+  V(_, revoke_string, "revoke")                                               \
+  V(_, roundingIncrement_string, "roundingIncrement")                         \
+  V(_, RuntimeError_string, "RuntimeError")                                   \
+  V(_, WebAssemblyException_string, "WebAssembly.Exception")                  \
+  V(_, Script_string, "Script")                                               \
+  V(_, script_string, "script")                                               \
+  V(_, second_string, "second")                                               \
+  V(_, seconds_string, "seconds")                                             \
+  V(_, short_string, "short")                                                 \
+  V(_, Set_string, "Set")                                                     \
+  V(_, sentence_string, "sentence")                                           \
+  V(_, set_space_string, "set ")                                              \
+  V(_, set_string, "set")                                                     \
+  V(_, SetIterator_string, "Set Iterator")                                    \
+  V(_, setPrototypeOf_string, "setPrototypeOf")                               \
+  V(_, ShadowRealm_string, "ShadowRealm")                                     \
+  V(_, SharedArray_string, "SharedArray")                                     \
+  V(_, SharedArrayBuffer_string, "SharedArrayBuffer")                         \
+  V(_, SharedStruct_string, "SharedStruct")                                   \
+  V(_, sign_string, "sign")                                                   \
+  V(_, size_string, "size")                                                   \
+  V(_, smallestUnit_string, "smallestUnit")                                   \
+  V(_, source_string, "source")                                               \
+  V(_, sourceText_string, "sourceText")                                       \
+  V(_, stack_string, "stack")                                                 \
+  V(_, stackTraceLimit_string, "stackTraceLimit")                             \
+  V(_, static_initializer_string, "<static_initializer>")                     \
+  V(_, sticky_string, "sticky")                                               \
+  V(_, String_string, "String")                                               \
+  V(_, string_string, "string")                                               \
+  V(_, string_to_string, "[object String]")                                   \
+  V(_, Symbol_iterator_string, "Symbol.iterator")                             \
+  V(_, Symbol_match_all_string, "Symbol.matchAll")                            \
+  V(_, Symbol_replace_string, "Symbol.replace")                               \
+  V(_, symbol_species_string, "[Symbol.species]")                             \
+  V(_, Symbol_species_string, "Symbol.species")                               \
+  V(_, Symbol_split_string, "Symbol.split")                                   \
+  V(_, Symbol_string, "Symbol")                                               \
+  V(_, symbol_string, "symbol")                                               \
+  V(_, SyntaxError_string, "SyntaxError")                                     \
+  V(_, target_string, "target")                                               \
+  V(_, this_function_string, ".this_function")                                \
+  V(_, this_string, "this")                                                   \
+  V(_, throw_string, "throw")                                                 \
+  V(_, timed_out_string, "timed-out")                                         \
+  V(_, timeZone_string, "timeZone")                                           \
+  V(_, toJSON_string, "toJSON")                                               \
+  V(_, toString_string, "toString")                                           \
+  V(_, true_string, "true")                                                   \
+  V(_, total_string, "total")                                                 \
+  V(_, TypeError_string, "TypeError")                                         \
+  V(_, Uint16Array_string, "Uint16Array")                                     \
+  V(_, Uint32Array_string, "Uint32Array")                                     \
+  V(_, Uint8Array_string, "Uint8Array")                                       \
+  V(_, Uint8ClampedArray_string, "Uint8ClampedArray")                         \
+  V(_, undefined_string, "undefined")                                         \
+  V(_, undefined_to_string, "[object Undefined]")                             \
+  V(_, unicode_string, "unicode")                                             \
+  V(_, unicodeSets_string, "unicodeSets")                                     \
+  V(_, unit_string, "unit")                                                   \
+  V(_, URIError_string, "URIError")                                           \
+  V(_, UTC_string, "UTC")                                                     \
+  V(_, valueOf_string, "valueOf")                                             \
+  V(_, WeakMap_string, "WeakMap")                                             \
+  V(_, WeakRef_string, "WeakRef")                                             \
+  V(_, WeakSet_string, "WeakSet")                                             \
+  V(_, week_string, "week")                                                   \
+  V(_, weeks_string, "weeks")                                                 \
+  V(_, weekOfYear_string, "weekOfYear")                                       \
+  V(_, with_string, "with")                                                   \
+  V(_, word_string, "word")                                                   \
+  V(_, yearMonthFromFields_string, "yearMonthFromFields")                     \
+  V(_, year_string, "year")                                                   \
+  V(_, years_string, "years")                                                 \
   V(_, zero_string, "0")
 
 #define INTERNALIZED_STRING_LIST_GENERATOR(V, _)           \
@@ -522,10 +529,8 @@
 #define PUBLIC_SYMBOL_LIST_GENERATOR(V, _)                \
   V(_, async_iterator_symbol, Symbol.asyncIterator)       \
   V(_, intl_fallback_symbol, IntlLegacyConstructedSymbol) \
-  V(_, match_all_symbol, Symbol.matchAll)                 \
   V(_, match_symbol, Symbol.match)                        \
   V(_, search_symbol, Symbol.search)                      \
-  V(_, split_symbol, Symbol.split)                        \
   V(_, to_primitive_symbol, Symbol.toPrimitive)           \
   V(_, unscopables_symbol, Symbol.unscopables)
 
@@ -550,13 +555,15 @@
 // description in between the symbols during deserialization.
 #define SYMBOL_FOR_PROTECTOR_LIST_GENERATOR(V, _) \
   V(_, iterator_symbol, Symbol.iterator)          \
+  V(_, match_all_symbol, Symbol.matchAll)         \
   V(_, replace_symbol, Symbol.replace)            \
-  V(_, species_symbol, Symbol.species)
+  V(_, species_symbol, Symbol.species)            \
+  V(_, split_symbol, Symbol.split)
 
 #define WELL_KNOWN_SYMBOL_FOR_PROTECTOR_LIST_GENERATOR(V, _) \
   V(_, is_concat_spreadable_symbol, Symbol.isConcatSpreadable)
 
-#define INCREMENTAL_SCOPES(F)                                      \
+#define MC_INCREMENTAL_SCOPES(F)                                   \
   /* MC_INCREMENTAL is the top-level incremental marking scope. */ \
   F(MC_INCREMENTAL)                                                \
   F(MC_INCREMENTAL_EMBEDDER_PROLOGUE)                              \
@@ -568,7 +575,7 @@
   F(MC_INCREMENTAL_START)                                          \
   F(MC_INCREMENTAL_SWEEPING)
 
-#define MINOR_INCREMENTAL_SCOPES(F) F(MINOR_MC_INCREMENTAL_START)
+#define MINOR_MS_INCREMENTAL_SCOPES(F) F(MINOR_MS_INCREMENTAL_START)
 
 #define TOP_MC_SCOPES(F) \
   F(MC_CLEAR)            \
@@ -579,101 +586,41 @@
   F(MC_PROLOGUE)         \
   F(MC_SWEEP)
 
-#define TOP_MINOR_MC_SCOPES(F) \
-  F(MINOR_MC_CLEAR)            \
-  F(MINOR_MC_EVACUATE)         \
-  F(MINOR_MC_FINISH)           \
-  F(MINOR_MC_MARK)             \
-  F(MINOR_MC_SWEEP)
+#define TOP_MINOR_MS_SCOPES(F) \
+  F(MINOR_MS_CLEAR)            \
+  F(MINOR_MS_FINISH)           \
+  F(MINOR_MS_MARK)             \
+  F(MINOR_MS_SWEEP)
 
-#define TRACER_SCOPES(F)                             \
-  INCREMENTAL_SCOPES(F)                              \
-  MINOR_INCREMENTAL_SCOPES(F)                        \
-  F(HEAP_EMBEDDER_TRACING_EPILOGUE)                  \
-  F(HEAP_EPILOGUE)                                   \
-  F(HEAP_EPILOGUE_REDUCE_NEW_SPACE)                  \
-  F(HEAP_EPILOGUE_SAFEPOINT)                         \
-  F(HEAP_EXTERNAL_EPILOGUE)                          \
-  F(HEAP_EXTERNAL_NEAR_HEAP_LIMIT)                   \
-  F(HEAP_EXTERNAL_PROLOGUE)                          \
-  F(HEAP_EXTERNAL_SECOND_PASS_CALLBACKS)             \
-  F(HEAP_EXTERNAL_WEAK_GLOBAL_HANDLES)               \
-  F(HEAP_PROLOGUE)                                   \
-  F(HEAP_PROLOGUE_SAFEPOINT)                         \
-  F(MARK_COMPACTOR)                                  \
-  TOP_MC_SCOPES(F)                                   \
-  F(MC_CLEAR_DEPENDENT_CODE)                         \
-  F(MC_CLEAR_EXTERNAL_STRING_TABLE)                  \
-  F(MC_CLEAR_STRING_FORWARDING_TABLE)                \
-  F(MC_CLEAR_FLUSHABLE_BYTECODE)                     \
-  F(MC_CLEAR_FLUSHED_JS_FUNCTIONS)                   \
-  F(MC_CLEAR_JOIN_JOB)                               \
-  F(MC_CLEAR_MAPS)                                   \
-  F(MC_CLEAR_SLOTS_BUFFER)                           \
-  F(MC_CLEAR_STRING_TABLE)                           \
-  F(MC_CLEAR_WEAK_COLLECTIONS)                       \
-  F(MC_CLEAR_WEAK_GLOBAL_HANDLES)                    \
-  F(MC_CLEAR_WEAK_LISTS)                             \
-  F(MC_CLEAR_WEAK_REFERENCES)                        \
-  F(MC_SWEEP_EXTERNAL_POINTER_TABLE)                 \
-  F(MC_COMPLETE_SWEEP_ARRAY_BUFFERS)                 \
-  F(MC_COMPLETE_SWEEPING)                            \
-  F(MC_EVACUATE_CANDIDATES)                          \
-  F(MC_EVACUATE_CLEAN_UP)                            \
-  F(MC_EVACUATE_COPY)                                \
-  F(MC_EVACUATE_COPY_PARALLEL)                       \
-  F(MC_EVACUATE_EPILOGUE)                            \
-  F(MC_EVACUATE_PROLOGUE)                            \
-  F(MC_EVACUATE_REBALANCE)                           \
-  F(MC_EVACUATE_UPDATE_POINTERS)                     \
-  F(MC_EVACUATE_UPDATE_POINTERS_CLIENT_HEAPS)        \
-  F(MC_EVACUATE_UPDATE_POINTERS_PARALLEL)            \
-  F(MC_EVACUATE_UPDATE_POINTERS_SLOTS_MAIN)          \
-  F(MC_EVACUATE_UPDATE_POINTERS_TO_NEW_ROOTS)        \
-  F(MC_EVACUATE_UPDATE_POINTERS_WEAK)                \
-  F(MC_FINISH_SWEEP_ARRAY_BUFFERS)                   \
-  F(MC_MARK_CLIENT_HEAPS)                            \
-  F(MC_MARK_EMBEDDER_PROLOGUE)                       \
-  F(MC_MARK_EMBEDDER_TRACING)                        \
-  F(MC_MARK_FINISH_INCREMENTAL)                      \
-  F(MC_MARK_FULL_CLOSURE_PARALLEL)                   \
-  F(MC_MARK_FULL_CLOSURE_PARALLEL_JOIN)              \
-  F(MC_MARK_RETAIN_MAPS)                             \
-  F(MC_MARK_ROOTS)                                   \
-  F(MC_MARK_FULL_CLOSURE)                            \
-  F(MC_MARK_WEAK_CLOSURE_EPHEMERON_MARKING)          \
-  F(MC_MARK_WEAK_CLOSURE_EPHEMERON_LINEAR)           \
-  F(MC_SWEEP_CODE)                                   \
-  F(MC_SWEEP_CODE_LO)                                \
-  F(MC_SWEEP_LO)                                     \
-  F(MC_SWEEP_MAP)                                    \
-  F(MC_SWEEP_NEW)                                    \
-  F(MC_SWEEP_NEW_LO)                                 \
-  F(MC_SWEEP_OLD)                                    \
-  F(MC_SWEEP_SHARED)                                 \
-  F(MC_SWEEP_SHARED_LO)                              \
-  F(MINOR_MARK_COMPACTOR)                            \
-  F(MINOR_MC)                                        \
-  TOP_MINOR_MC_SCOPES(F)                             \
-  F(MINOR_MC_CLEAR_STRING_FORWARDING_TABLE)          \
-  F(MINOR_MC_CLEAR_STRING_TABLE)                     \
-  F(MINOR_MC_CLEAR_WEAK_GLOBAL_HANDLES)              \
-  F(MINOR_MC_COMPLETE_SWEEP_ARRAY_BUFFERS)           \
-  F(MINOR_MC_COMPLETE_SWEEPING)                      \
-  F(MINOR_MC_MARK_FINISH_INCREMENTAL)                \
-  F(MINOR_MC_MARK_PARALLEL)                          \
-  F(MINOR_MC_MARK_SEED)                              \
-  F(MINOR_MC_MARK_ROOTS)                             \
-  F(MINOR_MC_MARK_CLOSURE_PARALLEL)                  \
-  F(MINOR_MC_MARK_CLOSURE)                           \
-  F(MINOR_MC_MARK_EMBEDDER_PROLOGUE)                 \
-  F(MINOR_MC_MARK_EMBEDDER_TRACING)                  \
-  F(MINOR_MC_SWEEP_NEW)                              \
-  F(MINOR_MC_SWEEP_NEW_LO)                           \
-  F(MINOR_MC_SWEEP_UPDATE_STRING_TABLE)              \
-  F(MINOR_MC_SWEEP_START_JOBS)                       \
-  F(MINOR_MC_FINISH_ENSURE_CAPACITY)                 \
-  F(SAFEPOINT)                                       \
+#define MINOR_MS_MAIN_THREAD_SCOPES(F)      \
+  F(MINOR_MARK_SWEEPER)                     \
+  F(MINOR_MS)                               \
+  TOP_MINOR_MS_SCOPES(F)                    \
+  F(MINOR_MS_CLEAR_STRING_FORWARDING_TABLE) \
+  F(MINOR_MS_CLEAR_STRING_TABLE)            \
+  F(MINOR_MS_CLEAR_WEAK_GLOBAL_HANDLES)     \
+  F(MINOR_MS_COMPLETE_SWEEP_ARRAY_BUFFERS)  \
+  F(MINOR_MS_COMPLETE_SWEEPING)             \
+  F(MINOR_MS_MARK_FINISH_INCREMENTAL)       \
+  F(MINOR_MS_MARK_PARALLEL)                 \
+  F(MINOR_MS_MARK_INCREMENTAL_SEED)         \
+  F(MINOR_MS_MARK_SEED)                     \
+  F(MINOR_MS_MARK_TRACED_HANDLES)           \
+  F(MINOR_MS_MARK_CONSERVATIVE_STACK)       \
+  F(MINOR_MS_MARK_CLOSURE_PARALLEL)         \
+  F(MINOR_MS_MARK_CLOSURE)                  \
+  F(MINOR_MS_MARK_EMBEDDER_PROLOGUE)        \
+  F(MINOR_MS_MARK_EMBEDDER_TRACING)         \
+  F(MINOR_MS_MARK_VERIFY)                   \
+  F(MINOR_MS_INCREMENTAL_STEP)              \
+  F(MINOR_MS_SWEEP_NEW)                     \
+  F(MINOR_MS_SWEEP_NEW_LO)                  \
+  F(MINOR_MS_SWEEP_UPDATE_STRING_TABLE)     \
+  F(MINOR_MS_SWEEP_START_JOBS)              \
+  F(MINOR_MS_FINISH_SWEEP_ARRAY_BUFFERS)    \
+  F(MINOR_MS_FINISH_ENSURE_CAPACITY)
+
+#define SCAVENGER_MAIN_THREAD_SCOPES(F)              \
   F(SCAVENGER)                                       \
   F(SCAVENGER_COMPLETE_SWEEP_ARRAY_BUFFERS)          \
   F(SCAVENGER_FAST_PROMOTE)                          \
@@ -682,20 +629,100 @@
   F(SCAVENGER_SCAVENGE_WEAK_GLOBAL_HANDLES_IDENTIFY) \
   F(SCAVENGER_SCAVENGE_WEAK_GLOBAL_HANDLES_PROCESS)  \
   F(SCAVENGER_SCAVENGE_PARALLEL)                     \
+  F(SCAVENGER_SCAVENGE_PARALLEL_PHASE)               \
   F(SCAVENGER_SCAVENGE_ROOTS)                        \
   F(SCAVENGER_SCAVENGE_STACK_ROOTS)                  \
   F(SCAVENGER_SCAVENGE_UPDATE_REFS)                  \
   F(SCAVENGER_SCAVENGE_WEAK)                         \
   F(SCAVENGER_SCAVENGE_FINALIZE)                     \
-  F(SCAVENGER_SWEEP_ARRAY_BUFFERS)                   \
-  F(TIME_TO_GLOBAL_SAFEPOINT)                        \
-  F(TIME_TO_SAFEPOINT)                               \
-  F(UNMAPPER)                                        \
-  F(UNPARK)                                          \
-  F(YOUNG_ARRAY_BUFFER_SWEEP)                        \
-  F(FULL_ARRAY_BUFFER_SWEEP)
+  F(SCAVENGER_SWEEP_ARRAY_BUFFERS)
+
+#define MC_MAIN_THREAD_SCOPES(F)              \
+  F(MARK_COMPACTOR)                           \
+  TOP_MC_SCOPES(F)                            \
+  F(MC_CLEAR_DEPENDENT_CODE)                  \
+  F(MC_CLEAR_EXTERNAL_STRING_TABLE)           \
+  F(MC_CLEAR_STRING_FORWARDING_TABLE)         \
+  F(MC_CLEAR_FLUSHABLE_BYTECODE)              \
+  F(MC_CLEAR_FLUSHED_JS_FUNCTIONS)            \
+  F(MC_CLEAR_JOIN_JOB)                        \
+  F(MC_CLEAR_MAPS)                            \
+  F(MC_CLEAR_SLOTS_BUFFER)                    \
+  F(MC_CLEAR_STRING_TABLE)                    \
+  F(MC_CLEAR_WEAK_COLLECTIONS)                \
+  F(MC_CLEAR_WEAK_GLOBAL_HANDLES)             \
+  F(MC_CLEAR_WEAK_LISTS)                      \
+  F(MC_CLEAR_WEAK_REFERENCES)                 \
+  F(MC_SWEEP_EXTERNAL_POINTER_TABLE)          \
+  F(MC_SWEEP_CODE_POINTER_TABLE)              \
+  F(MC_COMPLETE_SWEEP_ARRAY_BUFFERS)          \
+  F(MC_COMPLETE_SWEEPING)                     \
+  F(MC_EVACUATE_CANDIDATES)                   \
+  F(MC_EVACUATE_CLEAN_UP)                     \
+  F(MC_EVACUATE_COPY)                         \
+  F(MC_EVACUATE_COPY_PARALLEL)                \
+  F(MC_EVACUATE_EPILOGUE)                     \
+  F(MC_EVACUATE_PROLOGUE)                     \
+  F(MC_EVACUATE_REBALANCE)                    \
+  F(MC_EVACUATE_UPDATE_POINTERS)              \
+  F(MC_EVACUATE_UPDATE_POINTERS_CLIENT_HEAPS) \
+  F(MC_EVACUATE_UPDATE_POINTERS_PARALLEL)     \
+  F(MC_EVACUATE_UPDATE_POINTERS_SLOTS_MAIN)   \
+  F(MC_EVACUATE_UPDATE_POINTERS_TO_NEW_ROOTS) \
+  F(MC_EVACUATE_UPDATE_POINTERS_WEAK)         \
+  F(MC_FINISH_SWEEP_ARRAY_BUFFERS)            \
+  F(MC_MARK_CLIENT_HEAPS)                     \
+  F(MC_MARK_EMBEDDER_PROLOGUE)                \
+  F(MC_MARK_EMBEDDER_TRACING)                 \
+  F(MC_MARK_FINISH_INCREMENTAL)               \
+  F(MC_MARK_FULL_CLOSURE_PARALLEL)            \
+  F(MC_MARK_FULL_CLOSURE_PARALLEL_JOIN)       \
+  F(MC_MARK_FULL_CLOSURE_SERIAL)              \
+  F(MC_MARK_RETAIN_MAPS)                      \
+  F(MC_MARK_ROOTS)                            \
+  F(MC_MARK_FULL_CLOSURE)                     \
+  F(MC_MARK_WEAK_CLOSURE_EPHEMERON_MARKING)   \
+  F(MC_MARK_WEAK_CLOSURE_EPHEMERON_LINEAR)    \
+  F(MC_MARK_VERIFY)                           \
+  F(MC_SWEEP_CODE)                            \
+  F(MC_SWEEP_CODE_LO)                         \
+  F(MC_SWEEP_LO)                              \
+  F(MC_SWEEP_MAP)                             \
+  F(MC_SWEEP_NEW)                             \
+  F(MC_SWEEP_NEW_LO)                          \
+  F(MC_SWEEP_OLD)                             \
+  F(MC_SWEEP_SHARED)                          \
+  F(MC_SWEEP_SHARED_LO)                       \
+  F(MC_SWEEP_START_JOBS)
+
+#define TRACER_SCOPES(F)                 \
+  MC_INCREMENTAL_SCOPES(F)               \
+  MINOR_MS_INCREMENTAL_SCOPES(F)         \
+  F(HEAP_EMBEDDER_TRACING_EPILOGUE)      \
+  F(HEAP_EPILOGUE)                       \
+  F(HEAP_EPILOGUE_REDUCE_NEW_SPACE)      \
+  F(HEAP_EPILOGUE_SAFEPOINT)             \
+  F(HEAP_EXTERNAL_EPILOGUE)              \
+  F(HEAP_EXTERNAL_NEAR_HEAP_LIMIT)       \
+  F(HEAP_EXTERNAL_PROLOGUE)              \
+  F(HEAP_EXTERNAL_SECOND_PASS_CALLBACKS) \
+  F(HEAP_EXTERNAL_WEAK_GLOBAL_HANDLES)   \
+  F(HEAP_PROLOGUE)                       \
+  F(HEAP_PROLOGUE_SAFEPOINT)             \
+  MC_MAIN_THREAD_SCOPES(F)               \
+  MINOR_MS_MAIN_THREAD_SCOPES(F)         \
+  F(SAFEPOINT)                           \
+  SCAVENGER_MAIN_THREAD_SCOPES(F)        \
+  F(TIME_TO_GLOBAL_SAFEPOINT)            \
+  F(TIME_TO_SAFEPOINT)                   \
+  F(UNMAPPER)                            \
+  F(UNPARK)                              \
+  F(YOUNG_ARRAY_BUFFER_SWEEP)            \
+  F(FULL_ARRAY_BUFFER_SWEEP)             \
+  F(CONSERVATIVE_STACK_SCANNING)
 
 #define TRACER_BACKGROUND_SCOPES(F)         \
+  /* FIRST_BACKGROUND_SCOPE = */            \
   F(BACKGROUND_YOUNG_ARRAY_BUFFER_SWEEP)    \
   F(BACKGROUND_FULL_ARRAY_BUFFER_SWEEP)     \
   F(BACKGROUND_COLLECTION)                  \
@@ -706,22 +733,21 @@
   F(MC_BACKGROUND_EVACUATE_UPDATE_POINTERS) \
   F(MC_BACKGROUND_MARKING)                  \
   F(MC_BACKGROUND_SWEEPING)                 \
-  F(MINOR_MC_BACKGROUND_EVACUATE_COPY)      \
-  F(MINOR_MC_BACKGROUND_MARKING)            \
-  F(MINOR_MC_BACKGROUND_SWEEPING)           \
+  F(MINOR_MS_BACKGROUND_MARKING)            \
+  F(MINOR_MS_BACKGROUND_SWEEPING)           \
+  F(MINOR_MS_BACKGROUND_MARKING_CLOSURE)    \
+  /* LAST_BACKGROUND_SCOPE = */             \
   F(SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL)
 
-#define TRACER_YOUNG_EPOCH_SCOPES(F)        \
-  F(YOUNG_ARRAY_BUFFER_SWEEP)               \
-  F(BACKGROUND_YOUNG_ARRAY_BUFFER_SWEEP)    \
-  F(MINOR_MARK_COMPACTOR)                   \
-  F(MINOR_MC_COMPLETE_SWEEP_ARRAY_BUFFERS)  \
-  F(MINOR_MC_COMPLETE_SWEEPING)             \
-  F(MINOR_MC_BACKGROUND_EVACUATE_COPY)      \
-  F(MINOR_MC_BACKGROUND_MARKING)            \
-  F(MINOR_MC_BACKGROUND_SWEEPING)           \
-  F(SCAVENGER)                              \
-  F(SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL) \
-  F(SCAVENGER_COMPLETE_SWEEP_ARRAY_BUFFERS)
+#define TRACER_YOUNG_EPOCH_SCOPES(F)     \
+  F(YOUNG_ARRAY_BUFFER_SWEEP)            \
+  F(BACKGROUND_YOUNG_ARRAY_BUFFER_SWEEP) \
+  MINOR_MS_INCREMENTAL_SCOPES(F)         \
+  MINOR_MS_MAIN_THREAD_SCOPES(F)         \
+  F(MINOR_MS_BACKGROUND_MARKING)         \
+  F(MINOR_MS_BACKGROUND_SWEEPING)        \
+  F(MINOR_MS_BACKGROUND_MARKING_CLOSURE) \
+  SCAVENGER_MAIN_THREAD_SCOPES(F)        \
+  F(SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL)
 
 #endif  // V8_INIT_HEAP_SYMBOLS_H_
diff --git a/deps/v8/src/init/isolate-allocator.cc b/deps/v8/src/init/isolate-allocator.cc
index e80a332d098bb0..7c558f85132269 100644
--- a/deps/v8/src/init/isolate-allocator.cc
+++ b/deps/v8/src/init/isolate-allocator.cc
@@ -31,7 +31,15 @@ struct PtrComprCageReservationParams
     requested_start_hint = RoundDown(
         reinterpret_cast<Address>(page_allocator->GetRandomMmapAddr()),
         base_alignment);
+
+#if V8_OS_FUCHSIA && !V8_EXTERNAL_CODE_SPACE
+    // If external code space is not enabled then executable pages (e.g. copied
+    // builtins, and JIT pages) will fall under the pointer compression range.
+    // Under Fuchsia that means the entire range must be allocated as JITtable.
+    jit = JitPermission::kMapAsJittable;
+#else
     jit = JitPermission::kNoJit;
+#endif
   }
 };
 #endif  // V8_COMPRESS_POINTERS
diff --git a/deps/v8/src/init/setup-isolate.h b/deps/v8/src/init/setup-isolate.h
index 6f52a157e1c507..c1166670ba1e14 100644
--- a/deps/v8/src/init/setup-isolate.h
+++ b/deps/v8/src/init/setup-isolate.h
@@ -12,6 +12,8 @@ namespace internal {
 
 class Builtins;
 enum class Builtin : int32_t;
+template <typename T>
+class Tagged;
 class Code;
 class Heap;
 class Isolate;
@@ -39,7 +41,8 @@ class V8_EXPORT_PRIVATE SetupIsolateDelegate {
 
  protected:
   static void SetupBuiltinsInternal(Isolate* isolate);
-  static void AddBuiltin(Builtins* builtins, Builtin builtin, Code code);
+  static void AddBuiltin(Builtins* builtins, Builtin builtin,
+                         Tagged<Code> code);
   static void PopulateWithPlaceholders(Isolate* isolate);
   static void ReplacePlaceholders(Isolate* isolate);
 
diff --git a/deps/v8/src/init/v8.cc b/deps/v8/src/init/v8.cc
index 9dad3911a4b1d2..7200df07078b19 100644
--- a/deps/v8/src/init/v8.cc
+++ b/deps/v8/src/init/v8.cc
@@ -137,17 +137,21 @@ void V8::Initialize() {
   CHECK(platform_);
 
   // Update logging information before enforcing flag implications.
-  FlagValue<bool>* log_all_flags[] = {&v8_flags.log_all,
-                                      &v8_flags.log_code,
-                                      &v8_flags.log_code_disassemble,
-                                      &v8_flags.log_source_code,
-                                      &v8_flags.log_source_position,
-                                      &v8_flags.log_feedback_vector,
-                                      &v8_flags.log_function_events,
-                                      &v8_flags.log_internal_timer_events,
-                                      &v8_flags.log_deopt,
-                                      &v8_flags.log_ic,
-                                      &v8_flags.log_maps};
+  FlagValue<bool>* log_all_flags[] = {
+      &v8_flags.log_all,
+      &v8_flags.log_code,
+      &v8_flags.log_code_disassemble,
+      &v8_flags.log_deopt,
+      &v8_flags.log_feedback_vector,
+      &v8_flags.log_function_events,
+      &v8_flags.log_ic,
+      &v8_flags.log_maps,
+      &v8_flags.log_source_code,
+      &v8_flags.log_source_position,
+      &v8_flags.log_timer_events,
+      &v8_flags.prof,
+      &v8_flags.prof_cpp,
+  };
   if (v8_flags.log_all) {
     // Enable all logging flags
     for (auto* flag : log_all_flags) {
@@ -212,6 +216,9 @@ void V8::Initialize() {
     DISABLE_FLAG(trace_turbo_graph);
     DISABLE_FLAG(trace_turbo_scheduled);
     DISABLE_FLAG(trace_turbo_reduction);
+#ifdef V8_ENABLE_SLOW_TRACING
+    // If expensive tracing is disabled via a build flag, the following flags
+    // cannot be disabled (because they are already).
     DISABLE_FLAG(trace_turbo_trimming);
     DISABLE_FLAG(trace_turbo_jt);
     DISABLE_FLAG(trace_turbo_ceq);
@@ -219,6 +226,7 @@ void V8::Initialize() {
     DISABLE_FLAG(trace_turbo_alloc);
     DISABLE_FLAG(trace_all_uses);
     DISABLE_FLAG(trace_representation);
+#endif
     DISABLE_FLAG(trace_turbo_stack_accesses);
   }
 
@@ -248,6 +256,10 @@ void V8::Initialize() {
   // If enabled, the sandbox must be initialized first.
   GetProcessWideSandbox()->Initialize(GetPlatformVirtualAddressSpace());
   CHECK_EQ(kSandboxSize, GetProcessWideSandbox()->size());
+
+#if defined(V8_CODE_POINTER_SANDBOXING)
+  GetProcessWideCodePointerTable()->Initialize();
+#endif
 #endif
 
 #if defined(V8_USE_PERFETTO)
@@ -264,10 +276,10 @@ void V8::Initialize() {
   Bootstrapper::InitializeOncePerProcess();
   CallDescriptors::InitializeOncePerProcess();
 
-#if V8_HAS_PKU_JIT_WRITE_PROTECT
-  base::MemoryProtectionKey::InitializeMemoryProtectionKeySupport();
-  RwxMemoryWriteScope::InitializeMemoryProtectionKey();
-#endif
+  // Fetch the ThreadIsolatedAllocator once since we need to keep the pointer in
+  // protected memory.
+  ThreadIsolation::Initialize(
+      GetCurrentPlatform()->GetThreadIsolatedAllocator());
 
 #if V8_ENABLE_WEBASSEMBLY
   wasm::WasmEngine::InitializeOncePerProcess();
@@ -314,6 +326,11 @@ void V8::DisposePlatform() {
 #endif  // V8_ENABLE_SANDBOX
 
   platform_ = nullptr;
+
+#if DEBUG
+  internal::ThreadIsolation::CheckTrackedMemoryEmpty();
+#endif
+
   AdvanceStartupState(V8StartupState::kPlatformDisposed);
 }
 
@@ -342,4 +359,12 @@ void V8::SetSnapshotBlob(StartupData* snapshot_blob) {
 double Platform::SystemClockTimeMillis() {
   return base::OS::TimeCurrentMillis();
 }
+
+// static
+void ThreadIsolatedAllocator::SetDefaultPermissionsForSignalHandler() {
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  internal::RwxMemoryWriteScope::SetDefaultPermissionsForSignalHandler();
+#endif
+}
+
 }  // namespace v8
diff --git a/deps/v8/src/inspector/BUILD.gn b/deps/v8/src/inspector/BUILD.gn
index 87ae628aa9bf6e..a2267e63dfe090 100644
--- a/deps/v8/src/inspector/BUILD.gn
+++ b/deps/v8/src/inspector/BUILD.gn
@@ -135,6 +135,8 @@ v8_source_set("inspector") {
     "v8-debugger-script.h",
     "v8-debugger.cc",
     "v8-debugger.h",
+    "v8-deep-serializer.cc",
+    "v8-deep-serializer.h",
     "v8-heap-profiler-agent-impl.cc",
     "v8-heap-profiler-agent-impl.h",
     "v8-inspector-impl.cc",
@@ -149,12 +151,12 @@ v8_source_set("inspector") {
     "v8-runtime-agent-impl.h",
     "v8-schema-agent-impl.cc",
     "v8-schema-agent-impl.h",
+    "v8-serialization-duplicate-tracker.cc",
+    "v8-serialization-duplicate-tracker.h",
     "v8-stack-trace-impl.cc",
     "v8-stack-trace-impl.h",
     "v8-value-utils.cc",
     "v8-value-utils.h",
-    "v8-webdriver-serializer.cc",
-    "v8-webdriver-serializer.h",
     "value-mirror.cc",
     "value-mirror.h",
   ]
diff --git a/deps/v8/src/inspector/custom-preview.cc b/deps/v8/src/inspector/custom-preview.cc
index a02cdadb738509..4e9c4a42ebeb0e 100644
--- a/deps/v8/src/inspector/custom-preview.cc
+++ b/deps/v8/src/inspector/custom-preview.cc
@@ -15,6 +15,7 @@
 #include "src/inspector/inspected-context.h"
 #include "src/inspector/string-util.h"
 #include "src/inspector/v8-console-message.h"
+#include "src/inspector/v8-debugger.h"
 #include "src/inspector/v8-inspector-impl.h"
 #include "src/inspector/v8-stack-trace-impl.h"
 
@@ -118,9 +119,9 @@ bool substituteObjectTags(int sessionId, const String16& groupName,
       return false;
     }
     std::unique_ptr<protocol::Runtime::RemoteObject> wrapper;
-    protocol::Response response =
-        injectedScript->wrapObject(originValue, groupName, WrapMode::kNoPreview,
-                                   configValue, maxDepth - 1, &wrapper);
+    protocol::Response response = injectedScript->wrapObject(
+        originValue, groupName, WrapOptions({WrapMode::kIdOnly}), configValue,
+        maxDepth - 1, &wrapper);
     if (!response.IsSuccess() || !wrapper) {
       reportError(context, tryCatch, "cannot wrap value");
       return false;
diff --git a/deps/v8/src/inspector/injected-script.cc b/deps/v8/src/inspector/injected-script.cc
index 51498c60dd0df3..40b4f8844f36da 100644
--- a/deps/v8/src/inspector/injected-script.cc
+++ b/deps/v8/src/inspector/injected-script.cc
@@ -31,6 +31,7 @@
 #include "src/inspector/injected-script.h"
 
 #include <cmath>
+#include <memory>
 #include <unordered_set>
 
 #include "../../third_party/inspector_protocol/crdtp/json.h"
@@ -46,8 +47,10 @@
 #include "src/inspector/remote-object-id.h"
 #include "src/inspector/string-util.h"
 #include "src/inspector/v8-console.h"
+#include "src/inspector/v8-debugger.h"
 #include "src/inspector/v8-inspector-impl.h"
 #include "src/inspector/v8-inspector-session-impl.h"
+#include "src/inspector/v8-serialization-duplicate-tracker.h"
 #include "src/inspector/v8-stack-trace-impl.h"
 #include "src/inspector/v8-value-utils.h"
 #include "src/inspector/value-mirror.h"
@@ -96,29 +99,13 @@ class InjectedScript::ProtocolPromiseHandler {
   static void add(V8InspectorSessionImpl* session,
                   v8::Local<v8::Context> context, v8::Local<v8::Value> value,
                   int executionContextId, const String16& objectGroup,
-                  WrapMode wrapMode, bool replMode, bool throwOnSideEffect,
+                  std::unique_ptr<WrapOptions> wrapOptions, bool replMode,
+                  bool throwOnSideEffect,
                   std::weak_ptr<EvaluateCallback> callback) {
     InjectedScript::ContextScope scope(session, executionContextId);
     Response response = scope.initialize();
     if (!response.IsSuccess()) return;
 
-    v8::MaybeLocal<v8::Promise> originalPromise =
-        value->IsPromise() ? value.As<v8::Promise>()
-                           : v8::MaybeLocal<v8::Promise>();
-    V8InspectorImpl* inspector = session->inspector();
-    ProtocolPromiseHandler* handler = new ProtocolPromiseHandler(
-        session, executionContextId, objectGroup, wrapMode, replMode,
-        throwOnSideEffect, callback, originalPromise);
-    v8::Local<v8::Value> wrapper = handler->m_wrapper.Get(inspector->isolate());
-    v8::Local<v8::Function> thenCallbackFunction =
-        v8::Function::New(context, thenCallback, wrapper, 0,
-                          v8::ConstructorBehavior::kThrow)
-            .ToLocalChecked();
-    v8::Local<v8::Function> catchCallbackFunction =
-        v8::Function::New(context, catchCallback, wrapper, 0,
-                          v8::ConstructorBehavior::kThrow)
-            .ToLocalChecked();
-
     v8::Local<v8::Promise> promise;
     v8::Local<v8::Promise::Resolver> resolver;
     if (value->IsPromise()) {
@@ -140,6 +127,22 @@ class InjectedScript::ProtocolPromiseHandler {
       promise = resolver->GetPromise();
     }
 
+    V8InspectorImpl* inspector = session->inspector();
+    PromiseHandlerTracker::Id handlerId =
+        inspector->promiseHandlerTracker().create(
+            session, executionContextId, objectGroup, std::move(wrapOptions),
+            replMode, throwOnSideEffect, callback, promise);
+    v8::Local<v8::Number> data =
+        v8::Number::New(inspector->isolate(), handlerId);
+    v8::Local<v8::Function> thenCallbackFunction =
+        v8::Function::New(context, thenCallback, data, 0,
+                          v8::ConstructorBehavior::kThrow)
+            .ToLocalChecked();
+    v8::Local<v8::Function> catchCallbackFunction =
+        v8::Function::New(context, catchCallback, data, 0,
+                          v8::ConstructorBehavior::kThrow)
+            .ToLocalChecked();
+
     if (promise->Then(context, thenCallbackFunction, catchCallbackFunction)
             .IsEmpty()) {
       // Re-initialize after returning from JS.
@@ -151,6 +154,8 @@ class InjectedScript::ProtocolPromiseHandler {
   }
 
  private:
+  friend class PromiseHandlerTracker;
+
   static v8::Local<v8::String> GetDotReplResultString(v8::Isolate* isolate) {
     // TODO(szuend): Cache the string in a v8::Persistent handle.
     return v8::String::NewFromOneByte(
@@ -159,65 +164,84 @@ class InjectedScript::ProtocolPromiseHandler {
   }
 
   static void thenCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
-    ProtocolPromiseHandler* handler = static_cast<ProtocolPromiseHandler*>(
-        info.Data().As<v8::External>()->Value());
-    DCHECK(handler);
+    PromiseHandlerTracker::Id handlerId =
+        static_cast<PromiseHandlerTracker::Id>(
+            info.Data().As<v8::Number>()->Value());
+    PromiseHandlerTracker& handlerTracker =
+        static_cast<V8InspectorImpl*>(
+            v8::debug::GetInspector(info.GetIsolate()))
+            ->promiseHandlerTracker();
+    // We currently store the handlers with the inspector. In rare cases the
+    // inspector dies (discarding the handler) with the micro task queue
+    // running after. Don't do anything in that case.
+    ProtocolPromiseHandler* handler = handlerTracker.get(handlerId);
+    if (!handler) return;
     v8::Local<v8::Value> value =
         info.Length() > 0 ? info[0]
                           : v8::Undefined(info.GetIsolate()).As<v8::Value>();
     handler->thenCallback(value);
-    delete handler;
+    handlerTracker.discard(handlerId,
+                           PromiseHandlerTracker::DiscardReason::kFulfilled);
   }
 
   static void catchCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
-    ProtocolPromiseHandler* handler = static_cast<ProtocolPromiseHandler*>(
-        info.Data().As<v8::External>()->Value());
-    DCHECK(handler);
+    PromiseHandlerTracker::Id handlerId =
+        static_cast<PromiseHandlerTracker::Id>(
+            info.Data().As<v8::Number>()->Value());
+    PromiseHandlerTracker& handlerTracker =
+        static_cast<V8InspectorImpl*>(
+            v8::debug::GetInspector(info.GetIsolate()))
+            ->promiseHandlerTracker();
+    // We currently store the handlers with the inspector. In rare cases the
+    // inspector dies (discarding the handler) with the micro task queue
+    // running after. Don't do anything in that case.
+    ProtocolPromiseHandler* handler = handlerTracker.get(handlerId);
+    if (!handler) return;
     v8::Local<v8::Value> value =
         info.Length() > 0 ? info[0]
                           : v8::Undefined(info.GetIsolate()).As<v8::Value>();
     handler->catchCallback(value);
-    delete handler;
+    handlerTracker.discard(handlerId,
+                           PromiseHandlerTracker::DiscardReason::kFulfilled);
   }
 
-  ProtocolPromiseHandler(V8InspectorSessionImpl* session,
+  ProtocolPromiseHandler(PromiseHandlerTracker::Id id,
+                         V8InspectorSessionImpl* session,
                          int executionContextId, const String16& objectGroup,
-                         WrapMode wrapMode, bool replMode,
-                         bool throwOnSideEffect,
+                         std::unique_ptr<WrapOptions> wrapOptions,
+                         bool replMode, bool throwOnSideEffect,
                          std::weak_ptr<EvaluateCallback> callback,
-                         v8::MaybeLocal<v8::Promise> maybeEvaluationResult)
+                         v8::Local<v8::Promise> evaluationResult)
       : m_inspector(session->inspector()),
         m_sessionId(session->sessionId()),
         m_contextGroupId(session->contextGroupId()),
         m_executionContextId(executionContextId),
         m_objectGroup(objectGroup),
-        m_wrapMode(wrapMode),
+        m_wrapOptions(std::move(wrapOptions)),
         m_replMode(replMode),
         m_throwOnSideEffect(throwOnSideEffect),
         m_callback(std::move(callback)),
-        m_wrapper(m_inspector->isolate(),
-                  v8::External::New(m_inspector->isolate(), this)) {
-    m_wrapper.SetWeak(this, cleanup, v8::WeakCallbackType::kParameter);
-    v8::Local<v8::Promise> promise;
-    if (maybeEvaluationResult.ToLocal(&promise)) {
-      m_evaluationResult =
-          v8::Global<v8::Promise>(m_inspector->isolate(), promise);
-    }
+        m_evaluationResult(m_inspector->isolate(), evaluationResult) {
+    m_evaluationResult.SetWeak(reinterpret_cast<PromiseHandlerTracker::Id*>(id),
+                               cleanup, v8::WeakCallbackType::kParameter);
   }
 
   static void cleanup(
-      const v8::WeakCallbackInfo<ProtocolPromiseHandler>& data) {
-    if (!data.GetParameter()->m_wrapper.IsEmpty()) {
-      data.GetParameter()->m_wrapper.Reset();
-      data.GetParameter()->m_evaluationResult.Reset();
-      data.SetSecondPassCallback(cleanup);
-    } else {
-      data.GetParameter()->sendPromiseCollected();
-      delete data.GetParameter();
-    }
+      const v8::WeakCallbackInfo<PromiseHandlerTracker::Id>& data) {
+    auto id = reinterpret_cast<PromiseHandlerTracker::Id>(data.GetParameter());
+    PromiseHandlerTracker& handlerTracker =
+        static_cast<V8InspectorImpl*>(
+            v8::debug::GetInspector(data.GetIsolate()))
+            ->promiseHandlerTracker();
+    // {discard} deletes the {ProtocolPromiseHandler} which resets the handle.
+    handlerTracker.discard(
+        id, PromiseHandlerTracker::DiscardReason::kPromiseCollected);
   }
 
   void thenCallback(v8::Local<v8::Value> value) {
+    // We don't need the m_evaluationResult in the `thenCallback`, but we also
+    // don't want `cleanup` running in case we re-enter JS.
+    m_evaluationResult.Reset();
     V8InspectorSessionImpl* session =
         m_inspector->sessionById(m_contextGroupId, m_sessionId);
     if (!session) return;
@@ -250,8 +274,8 @@ class InjectedScript::ProtocolPromiseHandler {
     }
 
     std::unique_ptr<protocol::Runtime::RemoteObject> wrappedValue;
-    response = scope.injectedScript()->wrapObject(result, m_objectGroup,
-                                                  m_wrapMode, &wrappedValue);
+    response = scope.injectedScript()->wrapObject(
+        result, m_objectGroup, *m_wrapOptions.get(), &wrappedValue);
     if (!response.IsSuccess()) {
       EvaluateCallback::sendFailure(m_callback, scope.injectedScript(),
                                     response);
@@ -263,6 +287,9 @@ class InjectedScript::ProtocolPromiseHandler {
   }
 
   void catchCallback(v8::Local<v8::Value> result) {
+    // Hold strongly onto m_evaluationResult now to prevent `cleanup` from
+    // running in case any code below triggers GC.
+    m_evaluationResult.ClearWeak();
     V8InspectorSessionImpl* session =
         m_inspector->sessionById(m_contextGroupId, m_sessionId);
     if (!session) return;
@@ -270,8 +297,8 @@ class InjectedScript::ProtocolPromiseHandler {
     Response response = scope.initialize();
     if (!response.IsSuccess()) return;
     std::unique_ptr<protocol::Runtime::RemoteObject> wrappedValue;
-    response = scope.injectedScript()->wrapObject(result, m_objectGroup,
-                                                  m_wrapMode, &wrappedValue);
+    response = scope.injectedScript()->wrapObject(
+        result, m_objectGroup, *m_wrapOptions.get(), &wrappedValue);
     if (!response.IsSuccess()) {
       EvaluateCallback::sendFailure(m_callback, scope.injectedScript(),
                                     response);
@@ -360,28 +387,15 @@ class InjectedScript::ProtocolPromiseHandler {
                                   std::move(exceptionDetails));
   }
 
-  void sendPromiseCollected() {
-    V8InspectorSessionImpl* session =
-        m_inspector->sessionById(m_contextGroupId, m_sessionId);
-    if (!session) return;
-    InjectedScript::ContextScope scope(session, m_executionContextId);
-    Response response = scope.initialize();
-    if (!response.IsSuccess()) return;
-    EvaluateCallback::sendFailure(
-        m_callback, scope.injectedScript(),
-        Response::ServerError("Promise was collected"));
-  }
-
   V8InspectorImpl* m_inspector;
   int m_sessionId;
   int m_contextGroupId;
   int m_executionContextId;
   String16 m_objectGroup;
-  WrapMode m_wrapMode;
+  std::unique_ptr<WrapOptions> m_wrapOptions;
   bool m_replMode;
   bool m_throwOnSideEffect;
   std::weak_ptr<EvaluateCallback> m_callback;
-  v8::Global<v8::External> m_wrapper;
   v8::Global<v8::Promise> m_evaluationResult;
 };
 
@@ -408,7 +422,8 @@ class PropertyAccumulator : public ValueMirror::PropertyAccumulator {
 Response InjectedScript::getProperties(
     v8::Local<v8::Object> object, const String16& groupName, bool ownProperties,
     bool accessorPropertiesOnly, bool nonIndexedPropertiesOnly,
-    WrapMode wrapMode, std::unique_ptr<Array<PropertyDescriptor>>* properties,
+    const WrapOptions& wrapOptions,
+    std::unique_ptr<Array<PropertyDescriptor>>* properties,
     Maybe<protocol::Runtime::ExceptionDetails>* exceptionDetails) {
   v8::HandleScope handles(m_context->isolate());
   v8::Local<v8::Context> context = m_context->context();
@@ -435,7 +450,7 @@ Response InjectedScript::getProperties(
     std::unique_ptr<RemoteObject> remoteObject;
     if (mirror.value) {
       Response response = wrapObjectMirror(
-          *mirror.value, groupName, wrapMode, v8::MaybeLocal<v8::Value>(),
+          *mirror.value, groupName, wrapOptions, v8::MaybeLocal<v8::Value>(),
           kMaxCustomPreviewDepth, &remoteObject);
       if (!response.IsSuccess()) return response;
       descriptor->setValue(std::move(remoteObject));
@@ -443,7 +458,7 @@ Response InjectedScript::getProperties(
     }
     if (mirror.getter) {
       Response response =
-          mirror.getter->buildRemoteObject(context, wrapMode, &remoteObject);
+          mirror.getter->buildRemoteObject(context, wrapOptions, &remoteObject);
       if (!response.IsSuccess()) return response;
       response =
           bindRemoteObjectIfNeeded(sessionId, context, mirror.getter->v8Value(),
@@ -453,7 +468,7 @@ Response InjectedScript::getProperties(
     }
     if (mirror.setter) {
       Response response =
-          mirror.setter->buildRemoteObject(context, wrapMode, &remoteObject);
+          mirror.setter->buildRemoteObject(context, wrapOptions, &remoteObject);
       if (!response.IsSuccess()) return response;
       response =
           bindRemoteObjectIfNeeded(sessionId, context, mirror.setter->v8Value(),
@@ -463,7 +478,7 @@ Response InjectedScript::getProperties(
     }
     if (mirror.symbol) {
       Response response =
-          mirror.symbol->buildRemoteObject(context, wrapMode, &remoteObject);
+          mirror.symbol->buildRemoteObject(context, wrapOptions, &remoteObject);
       if (!response.IsSuccess()) return response;
       response =
           bindRemoteObjectIfNeeded(sessionId, context, mirror.symbol->v8Value(),
@@ -472,8 +487,8 @@ Response InjectedScript::getProperties(
       descriptor->setSymbol(std::move(remoteObject));
     }
     if (mirror.exception) {
-      Response response =
-          mirror.exception->buildRemoteObject(context, wrapMode, &remoteObject);
+      Response response = mirror.exception->buildRemoteObject(
+          context, wrapOptions, &remoteObject);
       if (!response.IsSuccess()) return response;
       response = bindRemoteObjectIfNeeded(sessionId, context,
                                           mirror.exception->v8Value(),
@@ -511,7 +526,8 @@ Response InjectedScript::getInternalAndPrivateProperties(
     for (const auto& internalProperty : internalPropertiesWrappers) {
       std::unique_ptr<RemoteObject> remoteObject;
       Response response = internalProperty.value->buildRemoteObject(
-          m_context->context(), WrapMode::kNoPreview, &remoteObject);
+          m_context->context(), WrapOptions({WrapMode::kIdOnly}),
+          &remoteObject);
       if (!response.IsSuccess()) return response;
       response = bindRemoteObjectIfNeeded(sessionId, context,
                                           internalProperty.value->v8Value(),
@@ -539,7 +555,7 @@ Response InjectedScript::getInternalAndPrivateProperties(
            (!!privateProperty.value));
     if (privateProperty.value) {
       Response response = privateProperty.value->buildRemoteObject(
-          context, WrapMode::kNoPreview, &remoteObject);
+          context, WrapOptions({WrapMode::kIdOnly}), &remoteObject);
       if (!response.IsSuccess()) return response;
       response = bindRemoteObjectIfNeeded(sessionId, context,
                                           privateProperty.value->v8Value(),
@@ -550,7 +566,7 @@ Response InjectedScript::getInternalAndPrivateProperties(
 
     if (privateProperty.getter) {
       Response response = privateProperty.getter->buildRemoteObject(
-          context, WrapMode::kNoPreview, &remoteObject);
+          context, WrapOptions({WrapMode::kIdOnly}), &remoteObject);
       if (!response.IsSuccess()) return response;
       response = bindRemoteObjectIfNeeded(sessionId, context,
                                           privateProperty.getter->v8Value(),
@@ -561,7 +577,7 @@ Response InjectedScript::getInternalAndPrivateProperties(
 
     if (privateProperty.setter) {
       Response response = privateProperty.setter->buildRemoteObject(
-          context, WrapMode::kNoPreview, &remoteObject);
+          context, WrapOptions({WrapMode::kIdOnly}), &remoteObject);
       if (!response.IsSuccess()) return response;
       response = bindRemoteObjectIfNeeded(sessionId, context,
                                           privateProperty.setter->v8Value(),
@@ -582,33 +598,36 @@ void InjectedScript::releaseObject(const String16& objectId) {
 }
 
 Response InjectedScript::wrapObject(
-    v8::Local<v8::Value> value, const String16& groupName, WrapMode wrapMode,
+    v8::Local<v8::Value> value, const String16& groupName,
+    const WrapOptions& wrapOptions,
     std::unique_ptr<protocol::Runtime::RemoteObject>* result) {
-  return wrapObject(value, groupName, wrapMode, v8::MaybeLocal<v8::Value>(),
+  return wrapObject(value, groupName, wrapOptions, v8::MaybeLocal<v8::Value>(),
                     kMaxCustomPreviewDepth, result);
 }
 
 Response InjectedScript::wrapObject(
-    v8::Local<v8::Value> value, const String16& groupName, WrapMode wrapMode,
+    v8::Local<v8::Value> value, const String16& groupName,
+    const WrapOptions& wrapOptions,
     v8::MaybeLocal<v8::Value> customPreviewConfig, int maxCustomPreviewDepth,
     std::unique_ptr<protocol::Runtime::RemoteObject>* result) {
   v8::Local<v8::Context> context = m_context->context();
   v8::Context::Scope contextScope(context);
   std::unique_ptr<ValueMirror> mirror = ValueMirror::create(context, value);
   if (!mirror) return Response::InternalError();
-  return wrapObjectMirror(*mirror, groupName, wrapMode, customPreviewConfig,
+  return wrapObjectMirror(*mirror, groupName, wrapOptions, customPreviewConfig,
                           maxCustomPreviewDepth, result);
 }
 
 Response InjectedScript::wrapObjectMirror(
-    const ValueMirror& mirror, const String16& groupName, WrapMode wrapMode,
+    const ValueMirror& mirror, const String16& groupName,
+    const WrapOptions& wrapOptions,
     v8::MaybeLocal<v8::Value> customPreviewConfig, int maxCustomPreviewDepth,
     std::unique_ptr<protocol::Runtime::RemoteObject>* result) {
   int customPreviewEnabled = m_customPreviewEnabled;
   int sessionId = m_sessionId;
   v8::Local<v8::Context> context = m_context->context();
   v8::Context::Scope contextScope(context);
-  Response response = mirror.buildRemoteObject(context, wrapMode, result);
+  Response response = mirror.buildRemoteObject(context, wrapOptions, result);
   if (!response.IsSuccess()) return response;
   v8::Local<v8::Value> value = mirror.v8Value();
   response = bindRemoteObjectIfNeeded(sessionId, context, value, groupName,
@@ -621,12 +640,73 @@ Response InjectedScript::wrapObjectMirror(
                           &customPreview);
     if (customPreview) (*result)->setCustomPreview(std::move(customPreview));
   }
-  if (wrapMode == WrapMode::kGenerateWebDriverValue) {
+  if (wrapOptions.mode == WrapMode::kWebDriver) {
     int maxDepth = 1;
-    std::unique_ptr<protocol::Runtime::WebDriverValue> webDriverValue =
-        mirror.buildWebDriverValue(context, maxDepth);
+
+    V8SerializationDuplicateTracker duplicateTracker{context};
+
+    std::unique_ptr<protocol::DictionaryValue> deepSerializedValueDict;
+    response = mirror.buildDeepSerializedValue(
+        context, maxDepth, v8::Local<v8::Object>(), duplicateTracker,
+        &deepSerializedValueDict);
+    if (!response.IsSuccess()) return response;
+
+    String16 type;
+    deepSerializedValueDict->getString("type", &type);
+
+    std::unique_ptr<protocol::Runtime::DeepSerializedValue>
+        deepSerializedValue = protocol::Runtime::DeepSerializedValue::create()
+                                  .setType(type)
+                                  .build();
+
+    protocol::Value* maybeValue = deepSerializedValueDict->get("value");
+    if (maybeValue != nullptr) {
+      deepSerializedValue->setValue(maybeValue->clone());
+    }
+
+    int weakLocalObjectReference;
+    if (deepSerializedValueDict->getInteger("weakLocalObjectReference",
+                                            &weakLocalObjectReference)) {
+      deepSerializedValue->setWeakLocalObjectReference(
+          weakLocalObjectReference);
+    }
+
     if (!response.IsSuccess()) return response;
-    (*result)->setWebDriverValue(std::move(webDriverValue));
+    (*result)->setWebDriverValue(std::move(deepSerializedValue));
+  }
+  if (wrapOptions.mode == WrapMode::kDeep) {
+    V8SerializationDuplicateTracker duplicateTracker{context};
+
+    std::unique_ptr<protocol::DictionaryValue> deepSerializedValueDict;
+    response = mirror.buildDeepSerializedValue(
+        context, wrapOptions.serializationOptions.maxDepth,
+        wrapOptions.serializationOptions.additionalParameters.Get(
+            m_context->isolate()),
+        duplicateTracker, &deepSerializedValueDict);
+    if (!response.IsSuccess()) return response;
+
+    String16 type;
+    deepSerializedValueDict->getString("type", &type);
+
+    std::unique_ptr<protocol::Runtime::DeepSerializedValue>
+        deepSerializedValue = protocol::Runtime::DeepSerializedValue::create()
+                                  .setType(type)
+                                  .build();
+
+    protocol::Value* maybeValue = deepSerializedValueDict->get("value");
+    if (maybeValue != nullptr) {
+      deepSerializedValue->setValue(maybeValue->clone());
+    }
+
+    int weakLocalObjectReference;
+    if (deepSerializedValueDict->getInteger("weakLocalObjectReference",
+                                            &weakLocalObjectReference)) {
+      deepSerializedValue->setWeakLocalObjectReference(
+          weakLocalObjectReference);
+    }
+
+    if (!response.IsSuccess()) return response;
+    (*result)->setDeepSerializedValue(std::move(deepSerializedValue));
   }
 
   return Response::Success();
@@ -644,8 +724,8 @@ std::unique_ptr<protocol::Runtime::RemoteObject> InjectedScript::wrapTable(
   v8::Local<v8::Context> context = m_context->context();
 
   std::unique_ptr<RemoteObject> remoteObject;
-  Response response =
-      wrapObject(table, "console", WrapMode::kNoPreview, &remoteObject);
+  Response response = wrapObject(
+      table, "console", WrapOptions({WrapMode::kIdOnly}), &remoteObject);
   if (!remoteObject || !response.IsSuccess()) return nullptr;
 
   auto mirror = ValueMirror::create(context, table);
@@ -697,8 +777,9 @@ std::unique_ptr<protocol::Runtime::RemoteObject> InjectedScript::wrapTable(
 
 void InjectedScript::addPromiseCallback(
     V8InspectorSessionImpl* session, v8::MaybeLocal<v8::Value> value,
-    const String16& objectGroup, WrapMode wrapMode, bool replMode,
-    bool throwOnSideEffect, std::shared_ptr<EvaluateCallback> callback) {
+    const String16& objectGroup, std::unique_ptr<WrapOptions> wrapOptions,
+    bool replMode, bool throwOnSideEffect,
+    std::shared_ptr<EvaluateCallback> callback) {
   m_evaluateCallbacks.insert(callback);
   // After stashing the shared_ptr in `m_evaluateCallback`, we reset `callback`.
   // `ProtocolPromiseHandler:add` can take longer than the life time of this
@@ -717,7 +798,7 @@ void InjectedScript::addPromiseCallback(
                                       v8::MicrotasksScope::kRunMicrotasks);
   ProtocolPromiseHandler::add(session, m_context->context(),
                               value.ToLocalChecked(), m_context->contextId(),
-                              objectGroup, wrapMode, replMode,
+                              objectGroup, std::move(wrapOptions), replMode,
                               throwOnSideEffect, weak_callback);
   // Do not add any code here! `this` might be invalid.
   // `ProtocolPromiseHandler::add` calls into JS which could kill this
@@ -835,8 +916,8 @@ Response InjectedScript::addExceptionToDetails(
   std::unique_ptr<protocol::Runtime::RemoteObject> wrapped;
   Response response =
       wrapObject(exception, objectGroup,
-                 exception->IsNativeError() ? WrapMode::kNoPreview
-                                            : WrapMode::kWithPreview,
+                 exception->IsNativeError() ? WrapOptions({WrapMode::kIdOnly})
+                                            : WrapOptions({WrapMode::kPreview}),
                  &wrapped);
   if (!response.IsSuccess()) return response;
   exceptionDetails->setException(std::move(wrapped));
@@ -896,14 +977,16 @@ Response InjectedScript::createExceptionDetails(
 
 Response InjectedScript::wrapEvaluateResult(
     v8::MaybeLocal<v8::Value> maybeResultValue, const v8::TryCatch& tryCatch,
-    const String16& objectGroup, WrapMode wrapMode, bool throwOnSideEffect,
+    const String16& objectGroup, const WrapOptions& wrapOptions,
+    bool throwOnSideEffect,
     std::unique_ptr<protocol::Runtime::RemoteObject>* result,
     Maybe<protocol::Runtime::ExceptionDetails>* exceptionDetails) {
   v8::Local<v8::Value> resultValue;
   if (!tryCatch.HasCaught()) {
     if (!maybeResultValue.ToLocal(&resultValue))
       return Response::InternalError();
-    Response response = wrapObject(resultValue, objectGroup, wrapMode, result);
+    Response response =
+        wrapObject(resultValue, objectGroup, wrapOptions, result);
     if (!response.IsSuccess()) return response;
     if (objectGroup == "console") {
       m_lastEvaluationResult.Reset(m_context->isolate(), resultValue);
@@ -918,11 +1001,11 @@ Response InjectedScript::wrapEvaluateResult(
       m_context->inspector()->client()->dispatchError(
           m_context->context(), tryCatch.Message(), exception);
     }
-    Response response =
-        wrapObject(exception, objectGroup,
-                   exception->IsNativeError() ? WrapMode::kNoPreview
-                                              : WrapMode::kWithPreview,
-                   result);
+    Response response = wrapObject(exception, objectGroup,
+                                   exception->IsNativeError()
+                                       ? WrapOptions({WrapMode::kIdOnly})
+                                       : WrapOptions({WrapMode::kPreview}),
+                                   result);
     if (!response.IsSuccess()) return response;
     // We send exception in result for compatibility reasons, even though it's
     // accessible through exceptionDetails.exception.
@@ -1123,4 +1206,68 @@ void InjectedScript::unbindObject(int id) {
   m_idToObjectGroupName.erase(id);
 }
 
+PromiseHandlerTracker::PromiseHandlerTracker() = default;
+
+PromiseHandlerTracker::~PromiseHandlerTracker() { discardAll(); }
+
+template <typename... Args>
+PromiseHandlerTracker::Id PromiseHandlerTracker::create(Args&&... args) {
+  Id id = m_lastUsedId++;
+  InjectedScript::ProtocolPromiseHandler* handler =
+      new InjectedScript::ProtocolPromiseHandler(id,
+                                                 std::forward<Args>(args)...);
+  m_promiseHandlers.emplace(id, handler);
+  return id;
+}
+
+void PromiseHandlerTracker::discard(Id id, DiscardReason reason) {
+  auto iter = m_promiseHandlers.find(id);
+  CHECK_NE(iter, m_promiseHandlers.end());
+  InjectedScript::ProtocolPromiseHandler* handler = iter->second.get();
+
+  switch (reason) {
+    case DiscardReason::kPromiseCollected:
+      sendFailure(handler, Response::ServerError("Promise was collected"));
+      break;
+    case DiscardReason::kTearDown:
+      sendFailure(handler, Response::ServerError(
+                               "Tearing down inspector/session/context"));
+      break;
+    case DiscardReason::kFulfilled:
+      // Do nothing.
+      break;
+  }
+
+  m_promiseHandlers.erase(id);
+}
+
+InjectedScript::ProtocolPromiseHandler* PromiseHandlerTracker::get(
+    Id id) const {
+  auto iter = m_promiseHandlers.find(id);
+  if (iter == m_promiseHandlers.end()) return nullptr;
+
+  return iter->second.get();
+}
+
+void PromiseHandlerTracker::sendFailure(
+    InjectedScript::ProtocolPromiseHandler* handler,
+    const protocol::DispatchResponse& response) const {
+  V8InspectorImpl* inspector = handler->m_inspector;
+  V8InspectorSessionImpl* session =
+      inspector->sessionById(handler->m_contextGroupId, handler->m_sessionId);
+  if (!session) return;
+  InjectedScript::ContextScope scope(session, handler->m_executionContextId);
+  Response res = scope.initialize();
+  if (!res.IsSuccess()) return;
+  EvaluateCallback::sendFailure(handler->m_callback, scope.injectedScript(),
+                                response);
+}
+
+void PromiseHandlerTracker::discardAll() {
+  while (!m_promiseHandlers.empty()) {
+    discard(m_promiseHandlers.begin()->first, DiscardReason::kTearDown);
+  }
+  CHECK(m_promiseHandlers.empty());
+}
+
 }  // namespace v8_inspector
diff --git a/deps/v8/src/inspector/injected-script.h b/deps/v8/src/inspector/injected-script.h
index 4f5bbf2823386f..b2ccaf84941ed8 100644
--- a/deps/v8/src/inspector/injected-script.h
+++ b/deps/v8/src/inspector/injected-script.h
@@ -51,7 +51,6 @@ class RemoteObjectId;
 class V8InspectorImpl;
 class V8InspectorSessionImpl;
 class ValueMirror;
-enum class WrapMode;
 
 using protocol::Maybe;
 using protocol::Response;
@@ -88,7 +87,7 @@ class InjectedScript final {
   Response getProperties(
       v8::Local<v8::Object>, const String16& groupName, bool ownProperties,
       bool accessorPropertiesOnly, bool nonIndexedPropertiesOnly,
-      WrapMode wrapMode,
+      const WrapOptions& wrapOptions,
       std::unique_ptr<protocol::Array<protocol::Runtime::PropertyDescriptor>>*
           result,
       Maybe<protocol::Runtime::ExceptionDetails>*);
@@ -106,15 +105,16 @@ class InjectedScript final {
   void releaseObject(const String16& objectId);
 
   Response wrapObject(v8::Local<v8::Value>, const String16& groupName,
-                      WrapMode wrapMode,
+                      const WrapOptions& wrapOptions,
                       std::unique_ptr<protocol::Runtime::RemoteObject>* result);
   Response wrapObject(v8::Local<v8::Value>, const String16& groupName,
-                      WrapMode wrapMode,
+                      const WrapOptions& wrapOptions,
                       v8::MaybeLocal<v8::Value> customPreviewConfig,
                       int maxCustomPreviewDepth,
                       std::unique_ptr<protocol::Runtime::RemoteObject>* result);
   Response wrapObjectMirror(
-      const ValueMirror& mirror, const String16& groupName, WrapMode wrapMode,
+      const ValueMirror& mirror, const String16& groupName,
+      const WrapOptions& wrapOptions,
       v8::MaybeLocal<v8::Value> customPreviewConfig, int maxCustomPreviewDepth,
       std::unique_ptr<protocol::Runtime::RemoteObject>* result);
   std::unique_ptr<protocol::Runtime::RemoteObject> wrapTable(
@@ -122,7 +122,8 @@ class InjectedScript final {
 
   void addPromiseCallback(V8InspectorSessionImpl* session,
                           v8::MaybeLocal<v8::Value> value,
-                          const String16& objectGroup, WrapMode wrapMode,
+                          const String16& objectGroup,
+                          std::unique_ptr<WrapOptions> wrapOptions,
                           bool replMode, bool throwOnSideEffect,
                           std::shared_ptr<EvaluateCallback> callback);
 
@@ -143,7 +144,8 @@ class InjectedScript final {
 
   Response wrapEvaluateResult(
       v8::MaybeLocal<v8::Value> maybeResultValue, const v8::TryCatch&,
-      const String16& objectGroup, WrapMode wrapMode, bool throwOnSideEffect,
+      const String16& objectGroup, const WrapOptions& wrapOptions,
+      bool throwOnSideEffect,
       std::unique_ptr<protocol::Runtime::RemoteObject>* result,
       Maybe<protocol::Runtime::ExceptionDetails>*);
   v8::Local<v8::Value> lastEvaluationResult() const;
@@ -232,6 +234,7 @@ class InjectedScript final {
 
  private:
   friend class EvaluateCallback;
+  friend class PromiseHandlerTracker;
 
   v8::Local<v8::Object> commandLineAPI();
   void unbindObject(int id);
@@ -260,6 +263,53 @@ class InjectedScript final {
   bool m_customPreviewEnabled = false;
 };
 
+// Owns and tracks the life-time of {ProtocolPromiseHandler} instances.
+// Each Runtime#evaluate, Runtime#awaitPromise or Runtime#callFunctionOn
+// can create a {ProtocolPromiseHandler} to send the CDP response once it's
+// ready.
+//
+// A {ProtocolPromiseHandler} can be destroyed by various events:
+//
+//   1) The evaluation promise fulfills (and we send the CDP response).
+//   2) The evaluation promise gets GC'ed
+//   3) The {PromiseHandlerTracker} owning the {ProtocolPromiseHandler} dies.
+//
+// We keep the logic of {PromiseHandlerTracker} separate so it's
+// easier to move it. E.g. we could keep it on the inspector, session or
+// inspected context level.
+class PromiseHandlerTracker {
+ public:
+  PromiseHandlerTracker();
+  PromiseHandlerTracker(const PromiseHandlerTracker&) = delete;
+  void operator=(const PromiseHandlerTracker&) = delete;
+  ~PromiseHandlerTracker();
+
+  // Any reason other then kFulfilled will send a CDP error response as to
+  // not keep the request pending forever. Depending on when the
+  // {PromiseHandlerTracker} is destructed, the {EvaluateCallback} might
+  // already be dead and we can't send the error response (but that's fine).
+  enum class DiscardReason {
+    kFulfilled,
+    kPromiseCollected,
+    kTearDown,
+  };
+  using Id = int64_t;
+
+  template <typename... Args>
+  Id create(Args&&... args);
+  void discard(Id id, DiscardReason reason);
+  InjectedScript::ProtocolPromiseHandler* get(Id id) const;
+
+ private:
+  void sendFailure(InjectedScript::ProtocolPromiseHandler* handler,
+                   const protocol::DispatchResponse& response) const;
+  void discardAll();
+
+  std::map<Id, std::unique_ptr<InjectedScript::ProtocolPromiseHandler>>
+      m_promiseHandlers;
+  Id m_lastUsedId = 1;
+};
+
 }  // namespace v8_inspector
 
 #endif  // V8_INSPECTOR_INJECTED_SCRIPT_H_
diff --git a/deps/v8/src/inspector/inspector_protocol_config.json b/deps/v8/src/inspector/inspector_protocol_config.json
index ba96b34574cdf4..9fcc28e227a08b 100644
--- a/deps/v8/src/inspector/inspector_protocol_config.json
+++ b/deps/v8/src/inspector/inspector_protocol_config.json
@@ -25,7 +25,7 @@
             },
             {
                 "domain": "HeapProfiler",
-                "async": ["collectGarbage"]
+                "async": ["collectGarbage", "takeHeapSnapshot"]
             }
         ]
     },
diff --git a/deps/v8/src/inspector/string-16.cc b/deps/v8/src/inspector/string-16.cc
index a8b786a8166d54..6df9963e970e51 100644
--- a/deps/v8/src/inspector/string-16.cc
+++ b/deps/v8/src/inspector/string-16.cc
@@ -27,7 +27,7 @@ bool isSpaceOrNewLine(UChar c) {
   return isASCII(c) && c <= ' ' && (c == ' ' || (c <= 0xD && c >= 0x9));
 }
 
-int64_t charactersToInteger(const UChar* characters, size_t length,
+int64_t charactersToInteger(const uint16_t* characters, size_t length,
                             bool* ok = nullptr) {
   std::vector<char> buffer;
   buffer.reserve(length + 1);
@@ -50,6 +50,8 @@ int64_t charactersToInteger(const UChar* characters, size_t length,
 
 String16::String16(const UChar* characters, size_t size)
     : m_impl(characters, size) {}
+String16::String16(const uint16_t* characters, size_t size)
+    : m_impl(reinterpret_cast<const UChar*>(characters), size) {}
 
 String16::String16(const UChar* characters) : m_impl(characters) {}
 
@@ -241,6 +243,10 @@ String16 String16::fromUTF16LE(const UChar* stringStart, size_t length) {
 #endif  // V8_TARGET_BIG_ENDIAN
 }
 
+String16 String16::fromUTF16LE(const uint16_t* stringStart, size_t length) {
+  return fromUTF16LE(reinterpret_cast<const UChar*>(stringStart), length);
+}
+
 std::string String16::utf8() const {
   return UTF16ToUTF8(m_impl.data(), m_impl.size());
 }
diff --git a/deps/v8/src/inspector/string-16.h b/deps/v8/src/inspector/string-16.h
index 29651ac9592922..a0dd965792afab 100644
--- a/deps/v8/src/inspector/string-16.h
+++ b/deps/v8/src/inspector/string-16.h
@@ -11,13 +11,14 @@
 #include <climits>
 #include <cstring>
 #include <string>
+#include <utility>
 #include <vector>
 
 #include "src/base/compiler-specific.h"
 
 namespace v8_inspector {
 
-using UChar = uint16_t;
+using UChar = char16_t;
 
 class String16 {
  public:
@@ -27,6 +28,7 @@ class String16 {
   String16(const String16&) V8_NOEXCEPT = default;
   String16(String16&&) V8_NOEXCEPT = default;
   String16(const UChar* characters, size_t size);
+  String16(const uint16_t* characters, size_t size);
   V8_EXPORT String16(const UChar* characters);
   V8_EXPORT String16(const char* characters);
   String16(const char* characters, size_t size);
@@ -48,7 +50,9 @@ class String16 {
   int toInteger(bool* ok = nullptr) const;
   std::pair<size_t, size_t> getTrimmedOffsetAndLength() const;
   String16 stripWhiteSpace() const;
-  const UChar* characters16() const { return m_impl.c_str(); }
+  const uint16_t* characters16() const {
+    return reinterpret_cast<const uint16_t*>(m_impl.c_str());
+  }
   size_t length() const { return m_impl.length(); }
   bool isEmpty() const { return !m_impl.length(); }
   UChar operator[](size_t index) const { return m_impl[index]; }
@@ -78,6 +82,8 @@ class String16 {
   // On Big endian architectures, byte order needs to be flipped.
   V8_EXPORT static String16 fromUTF16LE(const UChar* stringStart,
                                         size_t length);
+  V8_EXPORT static String16 fromUTF16LE(const uint16_t* stringStart,
+                                        size_t length);
 
   std::size_t hash() const {
     if (!hash_code) {
diff --git a/deps/v8/src/inspector/v8-console.cc b/deps/v8/src/inspector/v8-console.cc
index 719aa69fc91ac3..f608d678505e67 100644
--- a/deps/v8/src/inspector/v8-console.cc
+++ b/deps/v8/src/inspector/v8-console.cc
@@ -736,7 +736,7 @@ static void inspectImpl(const v8::FunctionCallbackInfo<v8::Value>& info,
   if (!injectedScript) return;
   std::unique_ptr<protocol::Runtime::RemoteObject> wrappedObject;
   protocol::Response response = injectedScript->wrapObject(
-      value, "", WrapMode::kNoPreview, &wrappedObject);
+      value, "", WrapOptions({WrapMode::kIdOnly}), &wrappedObject);
   if (!response.IsSuccess()) return;
 
   std::unique_ptr<protocol::DictionaryValue> hints =
diff --git a/deps/v8/src/inspector/v8-debugger-agent-impl.cc b/deps/v8/src/inspector/v8-debugger-agent-impl.cc
index 1c6e5b22721fde..7e72a177f9ab14 100644
--- a/deps/v8/src/inspector/v8-debugger-agent-impl.cc
+++ b/deps/v8/src/inspector/v8-debugger-agent-impl.cc
@@ -348,7 +348,7 @@ Response buildScopes(v8::Isolate* isolate, v8::debug::ScopeIterator* iterator,
     std::unique_ptr<RemoteObject> object;
     Response result =
         injectedScript->wrapObject(iterator->GetObject(), kBacktraceObjectGroup,
-                                   WrapMode::kNoPreview, &object);
+                                   WrapOptions({WrapMode::kIdOnly}), &object);
     if (!result.IsSuccess()) return result;
 
     auto scope = Scope::create()
@@ -415,9 +415,8 @@ bool hitBreakReasonEncodedAsOther(v8::debug::BreakReasons breakReasons) {
   // The listed break reasons are not explicitly encoded in CDP when
   // reporting the break. They are summarized as 'other'.
   v8::debug::BreakReasons otherBreakReasons(
-      {v8::debug::BreakReason::kStep,
-       v8::debug::BreakReason::kDebuggerStatement,
-       v8::debug::BreakReason::kScheduled, v8::debug::BreakReason::kAsyncStep,
+      {v8::debug::BreakReason::kDebuggerStatement,
+       v8::debug::BreakReason::kScheduled,
        v8::debug::BreakReason::kAlreadyPaused});
   return breakReasons.contains_any(otherBreakReasons);
 }
@@ -464,7 +463,7 @@ Response V8DebuggerAgentImpl::enable(Maybe<double> maxScriptsCacheSize,
   if (m_enableState == kStopping)
     return Response::ServerError("Debugger is stopping");
   m_maxScriptCacheSize = v8::base::saturated_cast<size_t>(
-      maxScriptsCacheSize.fromMaybe(std::numeric_limits<double>::max()));
+      maxScriptsCacheSize.value_or(std::numeric_limits<double>::max()));
   *outDebuggerId =
       m_debugger->debuggerIdFor(m_session->contextGroupId()).toString();
   if (enabled()) return Response::Success();
@@ -612,37 +611,37 @@ Response V8DebuggerAgentImpl::setBreakpointByUrl(
 
   *locations = std::make_unique<Array<protocol::Debugger::Location>>();
 
-  int specified = (optionalURL.isJust() ? 1 : 0) +
-                  (optionalURLRegex.isJust() ? 1 : 0) +
-                  (optionalScriptHash.isJust() ? 1 : 0);
+  int specified = (optionalURL.has_value() ? 1 : 0) +
+                  (optionalURLRegex.has_value() ? 1 : 0) +
+                  (optionalScriptHash.has_value() ? 1 : 0);
   if (specified != 1) {
     return Response::ServerError(
         "Either url or urlRegex or scriptHash must be specified.");
   }
   int columnNumber = 0;
-  if (optionalColumnNumber.isJust()) {
-    columnNumber = optionalColumnNumber.fromJust();
+  if (optionalColumnNumber.has_value()) {
+    columnNumber = optionalColumnNumber.value();
     if (columnNumber < 0)
       return Response::ServerError("Incorrect column number");
   }
 
   BreakpointType type = BreakpointType::kByUrl;
   String16 selector;
-  if (optionalURLRegex.isJust()) {
-    selector = optionalURLRegex.fromJust();
+  if (optionalURLRegex.has_value()) {
+    selector = optionalURLRegex.value();
     type = BreakpointType::kByUrlRegex;
-  } else if (optionalURL.isJust()) {
-    selector = optionalURL.fromJust();
+  } else if (optionalURL.has_value()) {
+    selector = optionalURL.value();
     type = BreakpointType::kByUrl;
-  } else if (optionalScriptHash.isJust()) {
-    selector = optionalScriptHash.fromJust();
+  } else if (optionalScriptHash.has_value()) {
+    selector = optionalScriptHash.value();
     type = BreakpointType::kByScriptHash;
   }
 
   // Note: This constructor can call into JavaScript.
   Matcher matcher(m_inspector, type, selector);
 
-  String16 condition = optionalCondition.fromMaybe(String16());
+  String16 condition = optionalCondition.value_or(String16());
   String16 breakpointId =
       generateBreakpointId(type, selector, lineNumber, columnNumber);
   protocol::DictionaryValue* breakpoints;
@@ -717,7 +716,7 @@ Response V8DebuggerAgentImpl::setBreakpoint(
         "Breakpoint at specified location already exists.");
   }
   *actualLocation = setBreakpointImpl(breakpointId, location->getScriptId(),
-                                      optionalCondition.fromMaybe(String16()),
+                                      optionalCondition.value_or(String16()),
                                       location->getLineNumber(),
                                       location->getColumnNumber(0));
   if (!*actualLocation)
@@ -747,7 +746,7 @@ Response V8DebuggerAgentImpl::setBreakpointOnFunctionCall(
         "Breakpoint at specified location already exists.");
   }
   v8::Local<v8::String> condition =
-      toV8String(m_isolate, optionalCondition.fromMaybe(String16()));
+      toV8String(m_isolate, optionalCondition.value_or(String16()));
   setBreakpointImpl(breakpointId, function, condition);
   *outBreakpointId = breakpointId;
   return Response::Success();
@@ -866,12 +865,12 @@ Response V8DebuggerAgentImpl::getPossibleBreakpoints(
   v8::debug::Location v8Start(start->getLineNumber(),
                               start->getColumnNumber(0));
   v8::debug::Location v8End;
-  if (end.isJust()) {
-    if (end.fromJust()->getScriptId() != scriptId)
+  if (end.has_value()) {
+    if (end->getScriptId() != scriptId)
       return Response::ServerError(
           "Locations should contain the same scriptId");
-    int line = end.fromJust()->getLineNumber();
-    int column = end.fromJust()->getColumnNumber(0);
+    int line = end->getLineNumber();
+    int column = end->getColumnNumber(0);
     if (line < 0 || column < 0)
       return Response::ServerError(
           "end.lineNumber and end.columnNumber should be >= 0");
@@ -892,7 +891,7 @@ Response V8DebuggerAgentImpl::getPossibleBreakpoints(
                                    v8::MicrotasksScope::kDoNotRunMicrotasks);
     v8::TryCatch tryCatch(m_isolate);
     it->second->getPossibleBreakpoints(
-        v8Start, v8End, restrictToFunction.fromMaybe(false), &v8Locations);
+        v8Start, v8End, restrictToFunction.value_or(false), &v8Locations);
   }
 
   *locations =
@@ -935,7 +934,7 @@ Response V8DebuggerAgentImpl::continueToLocation(
   v8::Context::Scope contextScope(inspected->context());
   return m_debugger->continueToLocation(
       m_session->contextGroupId(), script, std::move(location),
-      targetCallFrames.fromMaybe(
+      targetCallFrames.value_or(
           protocol::Debugger::ContinueToLocation::TargetCallFramesEnum::Any));
 }
 
@@ -1094,8 +1093,8 @@ Response V8DebuggerAgentImpl::searchInContent(
 
   *results = std::make_unique<protocol::Array<protocol::Debugger::SearchMatch>>(
       searchInTextByLinesImpl(m_session, it->second->source(0), query,
-                              optionalCaseSensitive.fromMaybe(false),
-                              optionalIsRegex.fromMaybe(false)));
+                              optionalCaseSensitive.value_or(false),
+                              optionalIsRegex.value_or(false)));
   return Response::Success();
 }
 
@@ -1141,10 +1140,10 @@ Response V8DebuggerAgentImpl::setScriptSource(
   v8::HandleScope handleScope(m_isolate);
   v8::Local<v8::Context> context = inspected->context();
   v8::Context::Scope contextScope(context);
-  const bool allowTopFrameLiveEditing = allowTopFrameEditing.fromMaybe(false);
+  const bool allowTopFrameLiveEditing = allowTopFrameEditing.value_or(false);
 
   v8::debug::LiveEditResult result;
-  it->second->setSource(newContent, dryRun.fromMaybe(false),
+  it->second->setSource(newContent, dryRun.value_or(false),
                         allowTopFrameLiveEditing, &result);
   *status = buildStatus(result.status);
   if (result.status == v8::debug::LiveEditResult::COMPILE_ERROR) {
@@ -1178,12 +1177,11 @@ Response V8DebuggerAgentImpl::restartFrame(
     Maybe<protocol::Runtime::StackTrace>* asyncStackTrace,
     Maybe<protocol::Runtime::StackTraceId>* asyncStackTraceId) {
   if (!isPaused()) return Response::ServerError(kDebuggerNotPaused);
-  if (!mode.isJust()) {
+  if (!mode.has_value()) {
     return Response::ServerError(
         "Restarting frame without 'mode' not supported");
   }
-  CHECK_EQ(mode.fromJust(),
-           protocol::Debugger::RestartFrame::ModeEnum::StepInto);
+  CHECK_EQ(mode.value(), protocol::Debugger::RestartFrame::ModeEnum::StepInto);
 
   InjectedScript::CallFrameScope scope(m_session, callFrameId);
   Response response = scope.initialize();
@@ -1302,18 +1300,28 @@ Response V8DebuggerAgentImpl::disassembleWasmModule(
 #if V8_ENABLE_WEBASSEMBLY
   if (!enabled()) return Response::ServerError(kDebuggerNotEnabled);
   ScriptsMap::iterator it = m_scripts.find(in_scriptId);
-  if (it == m_scripts.end()) {
-    return Response::InvalidParams("No script for id: " + in_scriptId.utf8());
-  }
-  V8DebuggerScript* script = it->second.get();
-  if (script->getLanguage() != V8DebuggerScript::Language::WebAssembly) {
-    return Response::InvalidParams("Script with id " + in_scriptId.utf8() +
-                                   " is not WebAssembly");
-  }
   std::unique_ptr<DisassemblyCollectorImpl> collector =
       std::make_unique<DisassemblyCollectorImpl>();
   std::vector<int> functionBodyOffsets;
-  script->Disassemble(collector.get(), &functionBodyOffsets);
+  if (it != m_scripts.end()) {
+    V8DebuggerScript* script = it->second.get();
+    if (script->getLanguage() != V8DebuggerScript::Language::WebAssembly) {
+      return Response::InvalidParams("Script with id " + in_scriptId.utf8() +
+                                     " is not WebAssembly");
+    }
+    script->Disassemble(collector.get(), &functionBodyOffsets);
+  } else {
+    auto cachedScriptIt =
+        std::find_if(m_cachedScripts.begin(), m_cachedScripts.end(),
+                     [&in_scriptId](const CachedScript& cachedScript) {
+                       return cachedScript.scriptId == in_scriptId;
+                     });
+    if (cachedScriptIt == m_cachedScripts.end()) {
+      return Response::InvalidParams("No script for id: " + in_scriptId.utf8());
+    }
+    v8::debug::Disassemble(v8::base::VectorOf(cachedScriptIt->bytecode),
+                           collector.get(), &functionBodyOffsets);
+  }
   *out_totalNumberOfLines =
       static_cast<int>(collector->total_number_of_lines());
   *out_functionBodyOffsets =
@@ -1337,6 +1345,7 @@ Response V8DebuggerAgentImpl::disassembleWasmModule(
   return Response::ServerError("WebAssembly is disabled");
 #endif  // V8_ENABLE_WEBASSEMBLY
 }
+
 Response V8DebuggerAgentImpl::nextWasmDisassemblyChunk(
     const String16& in_streamId,
     std::unique_ptr<protocol::Debugger::WasmDisassemblyChunk>* out_chunk) {
@@ -1451,7 +1460,7 @@ Response V8DebuggerAgentImpl::resume(Maybe<bool> terminateOnResume) {
 
   m_instrumentationFinished = true;
   m_debugger->continueProgram(m_session->contextGroupId(),
-                              terminateOnResume.fromMaybe(false));
+                              terminateOnResume.value_or(false));
   return Response::Success();
 }
 
@@ -1459,8 +1468,8 @@ Response V8DebuggerAgentImpl::stepOver(
     Maybe<protocol::Array<protocol::Debugger::LocationRange>> inSkipList) {
   if (!isPaused()) return Response::ServerError(kDebuggerNotPaused);
 
-  if (inSkipList.isJust()) {
-    const Response res = processSkipList(inSkipList.fromJust());
+  if (inSkipList.has_value()) {
+    const Response res = processSkipList(inSkipList.value());
     if (res.IsError()) return res;
   } else {
     m_skipList.clear();
@@ -1476,8 +1485,8 @@ Response V8DebuggerAgentImpl::stepInto(
     Maybe<protocol::Array<protocol::Debugger::LocationRange>> inSkipList) {
   if (!isPaused()) return Response::ServerError(kDebuggerNotPaused);
 
-  if (inSkipList.isJust()) {
-    const Response res = processSkipList(inSkipList.fromJust());
+  if (inSkipList.has_value()) {
+    const Response res = processSkipList(inSkipList.value());
     if (res.IsError()) return res;
   } else {
     m_skipList.clear();
@@ -1485,7 +1494,7 @@ Response V8DebuggerAgentImpl::stepInto(
 
   m_session->releaseObjectGroup(kBacktraceObjectGroup);
   m_debugger->stepIntoStatement(m_session->contextGroupId(),
-                                inBreakOnAsyncCall.fromMaybe(false));
+                                inBreakOnAsyncCall.value_or(false));
   return Response::Success();
 }
 
@@ -1541,8 +1550,8 @@ Response V8DebuggerAgentImpl::evaluateOnCallFrame(
   InjectedScript::CallFrameScope scope(m_session, callFrameId);
   Response response = scope.initialize();
   if (!response.IsSuccess()) return response;
-  if (includeCommandLineAPI.fromMaybe(false)) scope.installCommandLineAPI();
-  if (silent.fromMaybe(false)) scope.ignoreExceptionsAndMuteConsole();
+  if (includeCommandLineAPI.value_or(false)) scope.installCommandLineAPI();
+  if (silent.value_or(false)) scope.ignoreExceptionsAndMuteConsole();
 
   int frameOrdinal = static_cast<int>(scope.frameOrdinal());
   auto it = v8::debug::StackTraceIterator::Create(m_isolate, frameOrdinal);
@@ -1553,23 +1562,25 @@ Response V8DebuggerAgentImpl::evaluateOnCallFrame(
   v8::MaybeLocal<v8::Value> maybeResultValue;
   {
     V8InspectorImpl::EvaluateScope evaluateScope(scope);
-    if (timeout.isJust()) {
-      response = evaluateScope.setTimeout(timeout.fromJust() / 1000.0);
+    if (timeout.has_value()) {
+      response = evaluateScope.setTimeout(timeout.value() / 1000.0);
       if (!response.IsSuccess()) return response;
     }
     maybeResultValue = it->Evaluate(toV8String(m_isolate, expression),
-                                    throwOnSideEffect.fromMaybe(false));
+                                    throwOnSideEffect.value_or(false));
   }
   // Re-initialize after running client's code, as it could have destroyed
   // context or session.
   response = scope.initialize();
   if (!response.IsSuccess()) return response;
-  WrapMode mode = generatePreview.fromMaybe(false) ? WrapMode::kWithPreview
-                                                   : WrapMode::kNoPreview;
-  if (returnByValue.fromMaybe(false)) mode = WrapMode::kForceValue;
+  WrapOptions wrapOptions = generatePreview.value_or(false)
+                                ? WrapOptions({WrapMode::kPreview})
+                                : WrapOptions({WrapMode::kIdOnly});
+  if (returnByValue.value_or(false))
+    wrapOptions = WrapOptions({WrapMode::kJson});
   return scope.injectedScript()->wrapEvaluateResult(
-      maybeResultValue, scope.tryCatch(), objectGroup.fromMaybe(""), mode,
-      throwOnSideEffect.fromMaybe(false), result, exceptionDetails);
+      maybeResultValue, scope.tryCatch(), objectGroup.value_or(""), wrapOptions,
+      throwOnSideEffect.value_or(false), result, exceptionDetails);
 }
 
 Response V8DebuggerAgentImpl::setVariableValue(
@@ -1743,9 +1754,9 @@ Response V8DebuggerAgentImpl::currentCallFrames(
     if (injectedScript) {
       v8::Local<v8::Value> receiver;
       if (iterator->GetReceiver().ToLocal(&receiver)) {
-        res =
-            injectedScript->wrapObject(receiver, kBacktraceObjectGroup,
-                                       WrapMode::kNoPreview, &protocolReceiver);
+        res = injectedScript->wrapObject(receiver, kBacktraceObjectGroup,
+                                         WrapOptions({WrapMode::kIdOnly}),
+                                         &protocolReceiver);
         if (!res.IsSuccess()) return res;
       }
     }
@@ -1788,8 +1799,9 @@ Response V8DebuggerAgentImpl::currentCallFrames(
     v8::Local<v8::Value> returnValue = iterator->GetReturnValue();
     if (!returnValue.IsEmpty() && injectedScript) {
       std::unique_ptr<RemoteObject> value;
-      res = injectedScript->wrapObject(returnValue, kBacktraceObjectGroup,
-                                       WrapMode::kNoPreview, &value);
+      res =
+          injectedScript->wrapObject(returnValue, kBacktraceObjectGroup,
+                                     WrapOptions({WrapMode::kIdOnly}), &value);
       if (!res.IsSuccess()) return res;
       frame->setReturnValue(std::move(value));
     }
@@ -2094,7 +2106,7 @@ void V8DebuggerAgentImpl::didPause(
               : protocol::Debugger::Paused::ReasonEnum::Exception;
       std::unique_ptr<protocol::Runtime::RemoteObject> obj;
       injectedScript->wrapObject(exception, kBacktraceObjectGroup,
-                                 WrapMode::kNoPreview, &obj);
+                                 WrapOptions({WrapMode::kIdOnly}), &obj);
       std::unique_ptr<protocol::DictionaryValue> breakAuxData;
       if (obj) {
         std::vector<uint8_t> serialized;
@@ -2108,6 +2120,12 @@ void V8DebuggerAgentImpl::didPause(
     }
   }
 
+  if (breakReasons.contains(v8::debug::BreakReason::kStep) ||
+      breakReasons.contains(v8::debug::BreakReason::kAsyncStep)) {
+    hitReasons.push_back(
+        std::make_pair(protocol::Debugger::Paused::ReasonEnum::Step, nullptr));
+  }
+
   auto hitBreakpointIds = std::make_unique<Array<String16>>();
   bool hitRegularBreakpoint = false;
   for (const auto& id : hitBreakpoints) {
@@ -2268,9 +2286,9 @@ void V8DebuggerAgentImpl::ScriptCollected(const V8DebuggerScript* script) {
 }
 
 Response V8DebuggerAgentImpl::processSkipList(
-    protocol::Array<protocol::Debugger::LocationRange>* skipList) {
+    protocol::Array<protocol::Debugger::LocationRange>& skipList) {
   std::unordered_map<String16, std::vector<std::pair<int, int>>> skipListInit;
-  for (std::unique_ptr<protocol::Debugger::LocationRange>& range : *skipList) {
+  for (std::unique_ptr<protocol::Debugger::LocationRange>& range : skipList) {
     protocol::Debugger::ScriptPosition* start = range->getStart();
     protocol::Debugger::ScriptPosition* end = range->getEnd();
     String16 scriptId = range->getScriptId();
diff --git a/deps/v8/src/inspector/v8-debugger-agent-impl.h b/deps/v8/src/inspector/v8-debugger-agent-impl.h
index 9853312bcecca2..41ea49e4b6653c 100644
--- a/deps/v8/src/inspector/v8-debugger-agent-impl.h
+++ b/deps/v8/src/inspector/v8-debugger-agent-impl.h
@@ -215,7 +215,7 @@ class V8DebuggerAgentImpl : public protocol::Debugger::Backend {
   void setScriptInstrumentationBreakpointIfNeeded(V8DebuggerScript* script);
 
   Response processSkipList(
-      protocol::Array<protocol::Debugger::LocationRange>* skipList);
+      protocol::Array<protocol::Debugger::LocationRange>& skipList);
 
   using ScriptsMap =
       std::unordered_map<String16, std::unique_ptr<V8DebuggerScript>>;
diff --git a/deps/v8/src/inspector/v8-debugger.cc b/deps/v8/src/inspector/v8-debugger.cc
index b11802ce641ab4..3d4733b5ba936e 100644
--- a/deps/v8/src/inspector/v8-debugger.cc
+++ b/deps/v8/src/inspector/v8-debugger.cc
@@ -13,6 +13,7 @@
 #include "src/inspector/protocol/Protocol.h"
 #include "src/inspector/string-util.h"
 #include "src/inspector/v8-debugger-agent-impl.h"
+#include "src/inspector/v8-heap-profiler-agent-impl.h"
 #include "src/inspector/v8-inspector-impl.h"
 #include "src/inspector/v8-inspector-session-impl.h"
 #include "src/inspector/v8-runtime-agent-impl.h"
@@ -178,7 +179,6 @@ void V8Debugger::setBreakpointsActive(bool active) {
 
 void V8Debugger::removeBreakpoint(v8::debug::BreakpointId id) {
   v8::debug::RemoveBreakpoint(m_isolate, id);
-  m_throwingConditionReported.erase(id);
 }
 
 v8::debug::ExceptionBreakState V8Debugger::getPauseOnExceptionsState() {
@@ -527,6 +527,14 @@ void V8Debugger::handleProgramBreak(
       });
   {
     v8::Context::Scope scope(pausedContext);
+
+    m_inspector->forEachSession(
+        contextGroupId, [](V8InspectorSessionImpl* session) {
+          if (session->heapProfilerAgent()) {
+            session->heapProfilerAgent()->takePendingHeapSnapshots();
+          }
+        });
+
     m_inspector->client()->runMessageLoopOnPause(contextGroupId);
     m_pausedContextGroupId = 0;
   }
@@ -712,24 +720,7 @@ bool V8Debugger::ShouldBeSkipped(v8::Local<v8::debug::Script> script, int line,
 void V8Debugger::BreakpointConditionEvaluated(
     v8::Local<v8::Context> context, v8::debug::BreakpointId breakpoint_id,
     bool exception_thrown, v8::Local<v8::Value> exception) {
-  auto it = m_throwingConditionReported.find(breakpoint_id);
-
-  if (!exception_thrown) {
-    // Successful evaluation, clear out the bit: we report exceptions should
-    // this breakpoint throw again.
-    if (it != m_throwingConditionReported.end()) {
-      m_throwingConditionReported.erase(it);
-    }
-    return;
-  }
-
-  CHECK(exception_thrown);
-  if (it != m_throwingConditionReported.end() || exception.IsEmpty()) {
-    // Already reported this breakpoint or no exception to report.
-    return;
-  }
-
-  CHECK(!exception.IsEmpty());
+  if (!exception_thrown || exception.IsEmpty()) return;
 
   v8::Local<v8::Message> message =
       v8::debug::CreateMessageFromException(isolate(), exception);
@@ -747,7 +738,6 @@ void V8Debugger::BreakpointConditionEvaluated(
       message->GetLineNumber(context).FromMaybe(0),
       message->GetStartColumn() + 1, createStackTrace(message->GetStackTrace()),
       origin.ScriptId());
-  m_throwingConditionReported.insert(breakpoint_id);
 }
 
 void V8Debugger::AsyncEventOccurred(v8::debug::DebugAsyncActionType type,
diff --git a/deps/v8/src/inspector/v8-debugger.h b/deps/v8/src/inspector/v8-debugger.h
index 65fb27e2384880..3c1aa6e098ee23 100644
--- a/deps/v8/src/inspector/v8-debugger.h
+++ b/deps/v8/src/inspector/v8-debugger.h
@@ -31,11 +31,16 @@ class V8RuntimeAgentImpl;
 class V8StackTraceImpl;
 struct V8StackTraceId;
 
-enum class WrapMode {
-  kForceValue,
-  kNoPreview,
-  kWithPreview,
-  kGenerateWebDriverValue
+enum class WrapMode { kJson, kIdOnly, kPreview, kWebDriver, kDeep };
+
+struct WrapSerializationOptions {
+  int maxDepth = v8::internal::kMaxInt;
+  v8::Global<v8::Object> additionalParameters;
+};
+
+struct WrapOptions {
+  WrapMode mode;
+  WrapSerializationOptions serializationOptions = {};
 };
 
 using protocol::Response;
@@ -311,12 +316,6 @@ class V8Debugger : public v8::debug::DebugDelegate,
   std::unique_ptr<TerminateExecutionCallback> m_terminateExecutionCallback;
   v8::Global<v8::Context> m_terminateExecutionCallbackContext;
   bool m_terminateExecutionReported = true;
-
-  // Throwing conditional breakpoints for which we already have logged an error
-  // message to the console. The intention is to reduce console spam.
-  // Removing the breakpoint or a non-throwing evaluation of the breakpoint
-  // clears it out of the set.
-  std::unordered_set<v8::debug::BreakpointId> m_throwingConditionReported;
 };
 
 }  // namespace v8_inspector
diff --git a/deps/v8/src/inspector/v8-deep-serializer.cc b/deps/v8/src/inspector/v8-deep-serializer.cc
new file mode 100644
index 00000000000000..84bd48f8cc268c
--- /dev/null
+++ b/deps/v8/src/inspector/v8-deep-serializer.cc
@@ -0,0 +1,365 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/inspector/v8-deep-serializer.h"
+
+#include <memory>
+
+#include "include/v8-container.h"
+#include "include/v8-context.h"
+#include "include/v8-date.h"
+#include "include/v8-exception.h"
+#include "include/v8-regexp.h"
+#include "src/inspector/protocol/Runtime.h"
+#include "src/inspector/v8-serialization-duplicate-tracker.h"
+#include "src/inspector/value-mirror.h"
+
+namespace v8_inspector {
+
+namespace {
+using protocol::Response;
+std::unique_ptr<protocol::Value> DescriptionForDate(
+    v8::Local<v8::Context> context, v8::Local<v8::Date> date) {
+  v8::Isolate* isolate = context->GetIsolate();
+  v8::TryCatch tryCatch(isolate);
+
+  v8::Local<v8::String> dateISOString = date->ToISOString();
+  return protocol::StringValue::create(
+      toProtocolString(isolate, dateISOString));
+}
+
+String16 DescriptionForRegExpFlags(v8::Local<v8::RegExp> value) {
+  String16Builder resultStringBuilder;
+  v8::RegExp::Flags flags = value->GetFlags();
+  if (flags & v8::RegExp::Flags::kHasIndices) resultStringBuilder.append('d');
+  if (flags & v8::RegExp::Flags::kGlobal) resultStringBuilder.append('g');
+  if (flags & v8::RegExp::Flags::kIgnoreCase) resultStringBuilder.append('i');
+  if (flags & v8::RegExp::Flags::kLinear) resultStringBuilder.append('l');
+  if (flags & v8::RegExp::Flags::kMultiline) resultStringBuilder.append('m');
+  if (flags & v8::RegExp::Flags::kDotAll) resultStringBuilder.append('s');
+  if (flags & v8::RegExp::Flags::kUnicode) resultStringBuilder.append('u');
+  if (flags & v8::RegExp::Flags::kUnicodeSets) {
+    resultStringBuilder.append('v');
+  }
+  if (flags & v8::RegExp::Flags::kSticky) resultStringBuilder.append('y');
+  return resultStringBuilder.toString();
+}
+
+Response SerializeRegexp(v8::Local<v8::RegExp> value,
+                         v8::Local<v8::Context> context,
+                         V8SerializationDuplicateTracker& duplicateTracker,
+                         protocol::DictionaryValue& result) {
+  result.setString("type",
+                   protocol::Runtime::DeepSerializedValue::TypeEnum::Regexp);
+
+  std::unique_ptr<protocol::DictionaryValue> resultValue =
+      protocol::DictionaryValue::create();
+
+  resultValue->setValue(protocol::String("pattern"),
+                        protocol::StringValue::create(toProtocolString(
+                            context->GetIsolate(), value->GetSource())));
+
+  String16 flags = DescriptionForRegExpFlags(value);
+  if (!flags.isEmpty()) {
+    resultValue->setValue(protocol::String("flags"),
+                          protocol::StringValue::create(flags));
+  }
+
+  result.setValue("value", std::move(resultValue));
+  return Response::Success();
+}
+
+Response SerializeDate(v8::Local<v8::Date> value,
+                       v8::Local<v8::Context> context,
+                       V8SerializationDuplicateTracker& duplicateTracker,
+                       protocol::DictionaryValue& result) {
+  result.setString("type",
+                   protocol::Runtime::DeepSerializedValue::TypeEnum::Date);
+  std::unique_ptr<protocol::Value> dateDescription =
+      DescriptionForDate(context, value.As<v8::Date>());
+
+  result.setValue("value", std::move(dateDescription));
+  return Response::Success();
+}
+
+Response SerializeArrayValue(v8::Local<v8::Array> value,
+                             v8::Local<v8::Context> context, int maxDepth,
+                             v8::Local<v8::Object> additionalParameters,
+                             V8SerializationDuplicateTracker& duplicateTracker,
+                             std::unique_ptr<protocol::ListValue>* result) {
+  std::unique_ptr<protocol::ListValue> serializedValue =
+      protocol::ListValue::create();
+  uint32_t length = value->Length();
+  serializedValue->reserve(length);
+  for (uint32_t i = 0; i < length; i++) {
+    v8::Local<v8::Value> elementValue;
+    bool success = value->Get(context, i).ToLocal(&elementValue);
+    CHECK(success);
+    USE(success);
+
+    std::unique_ptr<protocol::DictionaryValue> elementProtocolValue;
+    Response response = ValueMirror::create(context, elementValue)
+                            ->buildDeepSerializedValue(
+                                context, maxDepth - 1, additionalParameters,
+                                duplicateTracker, &elementProtocolValue);
+    if (!response.IsSuccess()) return response;
+    serializedValue->pushValue(std::move(elementProtocolValue));
+  }
+  *result = std::move(serializedValue);
+  return Response::Success();
+}
+
+Response SerializeArray(v8::Local<v8::Array> value,
+                        v8::Local<v8::Context> context, int maxDepth,
+                        v8::Local<v8::Object> additionalParameters,
+                        V8SerializationDuplicateTracker& duplicateTracker,
+                        protocol::DictionaryValue& result) {
+  result.setString("type",
+                   protocol::Runtime::DeepSerializedValue::TypeEnum::Array);
+
+  if (maxDepth > 0) {
+    std::unique_ptr<protocol::ListValue> serializedValue;
+    Response response =
+        SerializeArrayValue(value, context, maxDepth, additionalParameters,
+                            duplicateTracker, &serializedValue);
+    if (!response.IsSuccess()) return response;
+
+    result.setValue("value", std::move(serializedValue));
+  }
+
+  return Response::Success();
+}
+
+Response SerializeMap(v8::Local<v8::Map> value, v8::Local<v8::Context> context,
+                      int maxDepth, v8::Local<v8::Object> additionalParameters,
+                      V8SerializationDuplicateTracker& duplicateTracker,
+                      protocol::DictionaryValue& result) {
+  result.setString("type",
+                   protocol::Runtime::DeepSerializedValue::TypeEnum::Map);
+
+  if (maxDepth > 0) {
+    std::unique_ptr<protocol::ListValue> serializedValue =
+        protocol::ListValue::create();
+
+    v8::Local<v8::Array> propertiesAndValues = value->AsArray();
+
+    uint32_t length = propertiesAndValues->Length();
+    serializedValue->reserve(length);
+    for (uint32_t i = 0; i < length; i += 2) {
+      v8::Local<v8::Value> keyV8Value, propertyV8Value;
+      std::unique_ptr<protocol::Value> keyProtocolValue;
+      std::unique_ptr<protocol::DictionaryValue> propertyProtocolValue;
+
+      bool success = propertiesAndValues->Get(context, i).ToLocal(&keyV8Value);
+      CHECK(success);
+      success =
+          propertiesAndValues->Get(context, i + 1).ToLocal(&propertyV8Value);
+      CHECK(success);
+      USE(success);
+
+      if (keyV8Value->IsString()) {
+        keyProtocolValue = protocol::StringValue::create(toProtocolString(
+            context->GetIsolate(), keyV8Value.As<v8::String>()));
+      } else {
+        std::unique_ptr<protocol::DictionaryValue> keyDictionaryProtocolValue;
+        Response response =
+            ValueMirror::create(context, keyV8Value)
+                ->buildDeepSerializedValue(
+                    context, maxDepth - 1, additionalParameters,
+                    duplicateTracker, &keyDictionaryProtocolValue);
+        if (!response.IsSuccess()) return response;
+        keyProtocolValue = std::move(keyDictionaryProtocolValue);
+      }
+
+      Response response = ValueMirror::create(context, propertyV8Value)
+                              ->buildDeepSerializedValue(
+                                  context, maxDepth - 1, additionalParameters,
+                                  duplicateTracker, &propertyProtocolValue);
+      if (!response.IsSuccess()) return response;
+
+      std::unique_ptr<protocol::ListValue> keyValueList =
+          protocol::ListValue::create();
+
+      keyValueList->pushValue(std::move(keyProtocolValue));
+      keyValueList->pushValue(std::move(propertyProtocolValue));
+
+      serializedValue->pushValue(std::move(keyValueList));
+    }
+    result.setValue("value", std::move(serializedValue));
+  }
+
+  return Response::Success();
+}
+
+Response SerializeSet(v8::Local<v8::Set> value, v8::Local<v8::Context> context,
+                      int maxDepth, v8::Local<v8::Object> additionalParameters,
+                      V8SerializationDuplicateTracker& duplicateTracker,
+                      protocol::DictionaryValue& result) {
+  result.setString("type",
+                   protocol::Runtime::DeepSerializedValue::TypeEnum::Set);
+
+  if (maxDepth > 0) {
+    std::unique_ptr<protocol::ListValue> serializedValue;
+    Response response = SerializeArrayValue(value->AsArray(), context, maxDepth,
+                                            additionalParameters,
+
+                                            duplicateTracker, &serializedValue);
+    result.setValue("value", std::move(serializedValue));
+  }
+  return Response::Success();
+}
+
+Response SerializeObjectValue(v8::Local<v8::Object> value,
+                              v8::Local<v8::Context> context, int maxDepth,
+                              v8::Local<v8::Object> additionalParameters,
+                              V8SerializationDuplicateTracker& duplicateTracker,
+                              std::unique_ptr<protocol::ListValue>* result) {
+  std::unique_ptr<protocol::ListValue> serializedValue =
+      protocol::ListValue::create();
+  // Iterate through object's enumerable properties ignoring symbols.
+  v8::Local<v8::Array> propertyNames;
+  bool success =
+      value
+          ->GetOwnPropertyNames(context,
+                                static_cast<v8::PropertyFilter>(
+                                    v8::PropertyFilter::ONLY_ENUMERABLE |
+                                    v8::PropertyFilter::SKIP_SYMBOLS),
+                                v8::KeyConversionMode::kConvertToString)
+          .ToLocal(&propertyNames);
+  CHECK(success);
+
+  uint32_t length = propertyNames->Length();
+  serializedValue->reserve(length);
+  for (uint32_t i = 0; i < length; i++) {
+    v8::Local<v8::Value> keyV8Value, propertyV8Value;
+    std::unique_ptr<protocol::Value> keyProtocolValue;
+    std::unique_ptr<protocol::DictionaryValue> propertyProtocolValue;
+
+    success = propertyNames->Get(context, i).ToLocal(&keyV8Value);
+    CHECK(success);
+    CHECK(keyV8Value->IsString());
+
+    v8::Maybe<bool> hasRealNamedProperty =
+        value->HasRealNamedProperty(context, keyV8Value.As<v8::String>());
+    // Don't access properties with interceptors.
+    if (hasRealNamedProperty.IsNothing() || !hasRealNamedProperty.FromJust()) {
+      continue;
+    }
+    keyProtocolValue = protocol::StringValue::create(
+        toProtocolString(context->GetIsolate(), keyV8Value.As<v8::String>()));
+
+    success = value->Get(context, keyV8Value).ToLocal(&propertyV8Value);
+    CHECK(success);
+    USE(success);
+
+    Response response = ValueMirror::create(context, propertyV8Value)
+                            ->buildDeepSerializedValue(
+                                context, maxDepth - 1, additionalParameters,
+                                duplicateTracker, &propertyProtocolValue);
+    if (!response.IsSuccess()) return response;
+
+    std::unique_ptr<protocol::ListValue> keyValueList =
+        protocol::ListValue::create();
+
+    keyValueList->pushValue(std::move(keyProtocolValue));
+    keyValueList->pushValue(std::move(propertyProtocolValue));
+
+    serializedValue->pushValue(std::move(keyValueList));
+  }
+  *result = std::move(serializedValue);
+  return Response::Success();
+}
+
+Response SerializeObject(v8::Local<v8::Object> value,
+                         v8::Local<v8::Context> context, int maxDepth,
+                         v8::Local<v8::Object> additionalParameters,
+                         V8SerializationDuplicateTracker& duplicateTracker,
+                         protocol::DictionaryValue& result) {
+  result.setString("type",
+                   protocol::Runtime::DeepSerializedValue::TypeEnum::Object);
+
+  if (maxDepth > 0) {
+    std::unique_ptr<protocol::ListValue> serializedValue;
+    Response response = SerializeObjectValue(
+        value.As<v8::Object>(), context, maxDepth, additionalParameters,
+        duplicateTracker, &serializedValue);
+    if (!response.IsSuccess()) return response;
+    result.setValue("value", std::move(serializedValue));
+  }
+  return Response::Success();
+}
+}  // namespace
+
+Response V8DeepSerializer::serializeV8Value(
+    v8::Local<v8::Object> value, v8::Local<v8::Context> context, int maxDepth,
+    v8::Local<v8::Object> additionalParameters,
+    V8SerializationDuplicateTracker& duplicateTracker,
+    protocol::DictionaryValue& result) {
+  if (value->IsArray()) {
+    return SerializeArray(value.As<v8::Array>(), context, maxDepth,
+                          additionalParameters, duplicateTracker, result);
+  }
+  if (value->IsRegExp()) {
+    return SerializeRegexp(value.As<v8::RegExp>(), context, duplicateTracker,
+                           result);
+  }
+  if (value->IsDate()) {
+    return SerializeDate(value.As<v8::Date>(), context, duplicateTracker,
+                         result);
+  }
+  if (value->IsMap()) {
+    return SerializeMap(value.As<v8::Map>(), context, maxDepth,
+                        additionalParameters, duplicateTracker, result);
+  }
+  if (value->IsSet()) {
+    return SerializeSet(value.As<v8::Set>(), context, maxDepth,
+                        additionalParameters, duplicateTracker, result);
+  }
+  if (value->IsWeakMap()) {
+    result.setString("type",
+                     protocol::Runtime::DeepSerializedValue::TypeEnum::Weakmap);
+    return Response::Success();
+  }
+  if (value->IsWeakSet()) {
+    result.setString("type",
+                     protocol::Runtime::DeepSerializedValue::TypeEnum::Weakset);
+    return Response::Success();
+  }
+  if (value->IsNativeError()) {
+    result.setString("type",
+                     protocol::Runtime::DeepSerializedValue::TypeEnum::Error);
+    return Response::Success();
+  }
+  if (value->IsProxy()) {
+    result.setString("type",
+                     protocol::Runtime::DeepSerializedValue::TypeEnum::Proxy);
+    return Response::Success();
+  }
+  if (value->IsPromise()) {
+    result.setString("type",
+                     protocol::Runtime::DeepSerializedValue::TypeEnum::Promise);
+    return Response::Success();
+  }
+  if (value->IsTypedArray()) {
+    result.setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Typedarray);
+    return Response::Success();
+  }
+  if (value->IsArrayBuffer()) {
+    result.setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Arraybuffer);
+    return Response::Success();
+  }
+  if (value->IsFunction()) {
+    result.setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Function);
+    return Response::Success();
+  }
+
+  // Serialize as an Object.
+  return SerializeObject(value.As<v8::Object>(), context, maxDepth,
+                         additionalParameters, duplicateTracker, result);
+}
+
+}  // namespace v8_inspector
diff --git a/deps/v8/src/inspector/v8-deep-serializer.h b/deps/v8/src/inspector/v8-deep-serializer.h
new file mode 100644
index 00000000000000..1e75e6722e3e28
--- /dev/null
+++ b/deps/v8/src/inspector/v8-deep-serializer.h
@@ -0,0 +1,26 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_INSPECTOR_V8_DEEP_SERIALIZER_H_
+#define V8_INSPECTOR_V8_DEEP_SERIALIZER_H_
+
+#include "src/inspector/protocol/Runtime.h"
+#include "src/inspector/v8-serialization-duplicate-tracker.h"
+
+namespace v8_inspector {
+
+class V8DeepSerializer {
+ public:
+  static protocol::Response serializeV8Value(
+      v8::Local<v8::Object> value, v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      protocol::DictionaryValue& result);
+
+  V8_EXPORT explicit V8DeepSerializer(v8::Isolate* isolate);
+};
+
+}  // namespace v8_inspector
+
+#endif  // V8_INSPECTOR_V8_DEEP_SERIALIZER_H_
diff --git a/deps/v8/src/inspector/v8-heap-profiler-agent-impl.cc b/deps/v8/src/inspector/v8-heap-profiler-agent-impl.cc
index 4e8197fdec5c41..ee5ad60352011b 100644
--- a/deps/v8/src/inspector/v8-heap-profiler-agent-impl.cc
+++ b/deps/v8/src/inspector/v8-heap-profiler-agent-impl.cc
@@ -10,6 +10,7 @@
 #include "include/v8-profiler.h"
 #include "include/v8-version.h"
 #include "src/base/platform/mutex.h"
+#include "src/base/platform/time.h"
 #include "src/inspector/injected-script.h"
 #include "src/inspector/inspected-context.h"
 #include "src/inspector/protocol/Protocol.h"
@@ -150,34 +151,107 @@ class HeapStatsStream final : public v8::OutputStream {
 
 }  // namespace
 
-struct V8HeapProfilerAgentImpl::AsyncGC {
+struct V8HeapProfilerAgentImpl::AsyncCallbacks {
   v8::base::Mutex m_mutex;
   bool m_canceled = false;
-  bool m_pending = false;
-  std::vector<std::unique_ptr<CollectGarbageCallback>> m_pending_callbacks;
+  std::vector<std::unique_ptr<CollectGarbageCallback>> m_gcCallbacks;
+  std::vector<V8HeapProfilerAgentImpl::HeapSnapshotTask*> m_heapSnapshotTasks;
 };
 
 class V8HeapProfilerAgentImpl::GCTask : public v8::Task {
  public:
-  GCTask(v8::Isolate* isolate, std::shared_ptr<AsyncGC> async_gc)
-      : m_isolate(isolate), m_async_gc(async_gc) {}
+  GCTask(v8::Isolate* isolate, std::shared_ptr<AsyncCallbacks> asyncCallbacks)
+      : m_isolate(isolate), m_asyncCallbacks(asyncCallbacks) {}
 
   void Run() override {
-    std::shared_ptr<AsyncGC> async_gc = m_async_gc.lock();
-    if (!async_gc) return;
-    v8::base::MutexGuard lock(&async_gc->m_mutex);
-    if (async_gc->m_canceled) return;
+    std::shared_ptr<AsyncCallbacks> asyncCallbacks = m_asyncCallbacks.lock();
+    if (!asyncCallbacks) return;
+    v8::base::MutexGuard lock(&asyncCallbacks->m_mutex);
+    if (asyncCallbacks->m_canceled) return;
     v8::debug::ForceGarbageCollection(m_isolate,
                                       v8::StackState::kNoHeapPointers);
-    for (auto& callback : async_gc->m_pending_callbacks) {
+    for (auto& callback : asyncCallbacks->m_gcCallbacks) {
       callback->sendSuccess();
     }
-    async_gc->m_pending_callbacks.clear();
+    asyncCallbacks->m_gcCallbacks.clear();
   }
 
  private:
   v8::Isolate* m_isolate;
-  std::weak_ptr<AsyncGC> m_async_gc;
+  std::weak_ptr<AsyncCallbacks> m_asyncCallbacks;
+};
+
+struct V8HeapProfilerAgentImpl::HeapSnapshotProtocolOptions {
+  HeapSnapshotProtocolOptions(Maybe<bool> reportProgress,
+                              Maybe<bool> treatGlobalObjectsAsRoots,
+                              Maybe<bool> captureNumericValue,
+                              Maybe<bool> exposeInternals)
+      : m_reportProgress(reportProgress.value_or(false)),
+        m_treatGlobalObjectsAsRoots(treatGlobalObjectsAsRoots.value_or(true)),
+        m_captureNumericValue(captureNumericValue.value_or(false)),
+        m_exposeInternals(exposeInternals.value_or(false)) {}
+  bool m_reportProgress;
+  bool m_treatGlobalObjectsAsRoots;
+  bool m_captureNumericValue;
+  bool m_exposeInternals;
+};
+
+class V8HeapProfilerAgentImpl::HeapSnapshotTask : public v8::Task {
+ public:
+  HeapSnapshotTask(V8HeapProfilerAgentImpl* agent,
+                   std::shared_ptr<AsyncCallbacks> asyncCallbacks,
+                   HeapSnapshotProtocolOptions protocolOptions,
+                   std::unique_ptr<TakeHeapSnapshotCallback> callback)
+      : m_agent(agent),
+        m_asyncCallbacks(asyncCallbacks),
+        m_protocolOptions(protocolOptions),
+        m_callback(std::move(callback)) {}
+
+  void Run() override { Run(cppgc::EmbedderStackState::kNoHeapPointers); }
+
+  void Run(cppgc::EmbedderStackState stackState) {
+    Response response = Response::Success();
+    {
+      // If the async callbacks object still exists and is not canceled, then
+      // the V8HeapProfilerAgentImpl still exists, so we can safely take a
+      // snapshot.
+      std::shared_ptr<AsyncCallbacks> asyncCallbacks = m_asyncCallbacks.lock();
+      if (!asyncCallbacks) return;
+      v8::base::MutexGuard lock(&asyncCallbacks->m_mutex);
+      if (asyncCallbacks->m_canceled) return;
+
+      auto& heapSnapshotTasks = asyncCallbacks->m_heapSnapshotTasks;
+      auto it =
+          std::find(heapSnapshotTasks.begin(), heapSnapshotTasks.end(), this);
+      if (it == heapSnapshotTasks.end()) {
+        // This task must have already been run. This can happen because the
+        // task was queued with PostNonNestableTask but then got run early by
+        // takePendingHeapSnapshots.
+        return;
+      }
+      heapSnapshotTasks.erase(it);
+
+      response = m_agent->takeHeapSnapshotNow(m_protocolOptions, stackState);
+    }
+
+    // The rest of this function runs without the mutex, because Node expects to
+    // be able to dispose the profiler agent during the callback, which would
+    // deadlock if this function still held the mutex. It's safe to call the
+    // callback without the mutex; the internal implementation of the callback
+    // uses weak pointers to avoid doing anything dangerous if other components
+    // have been disposed (see DomainDispatcher::Callback::sendIfActive).
+    if (response.IsSuccess()) {
+      m_callback->sendSuccess();
+    } else {
+      m_callback->sendFailure(std::move(response));
+    }
+  }
+
+ private:
+  V8HeapProfilerAgentImpl* m_agent;
+  std::weak_ptr<AsyncCallbacks> m_asyncCallbacks;
+  HeapSnapshotProtocolOptions m_protocolOptions;
+  std::unique_ptr<TakeHeapSnapshotCallback> m_callback;
 };
 
 V8HeapProfilerAgentImpl::V8HeapProfilerAgentImpl(
@@ -188,12 +262,13 @@ V8HeapProfilerAgentImpl::V8HeapProfilerAgentImpl(
       m_frontend(frontendChannel),
       m_state(state),
       m_hasTimer(false),
-      m_async_gc(std::make_shared<AsyncGC>()) {}
+      m_asyncCallbacks(std::make_shared<AsyncCallbacks>()) {}
 
 V8HeapProfilerAgentImpl::~V8HeapProfilerAgentImpl() {
-  v8::base::MutexGuard lock(&m_async_gc->m_mutex);
-  m_async_gc->m_canceled = true;
-  m_async_gc->m_pending_callbacks.clear();
+  v8::base::MutexGuard lock(&m_asyncCallbacks->m_mutex);
+  m_asyncCallbacks->m_canceled = true;
+  m_asyncCallbacks->m_gcCallbacks.clear();
+  m_asyncCallbacks->m_heapSnapshotTasks.clear();
 }
 
 void V8HeapProfilerAgentImpl::restore() {
@@ -224,19 +299,18 @@ void V8HeapProfilerAgentImpl::restore() {
 
 void V8HeapProfilerAgentImpl::collectGarbage(
     std::unique_ptr<CollectGarbageCallback> callback) {
-  v8::base::MutexGuard lock(&m_async_gc->m_mutex);
-  m_async_gc->m_pending_callbacks.push_back(std::move(callback));
-  if (!m_async_gc->m_pending) {
-    v8::debug::GetCurrentPlatform()
-        ->GetForegroundTaskRunner(m_isolate)
-        ->PostNonNestableTask(std::make_unique<GCTask>(m_isolate, m_async_gc));
-  }
+  v8::base::MutexGuard lock(&m_asyncCallbacks->m_mutex);
+  m_asyncCallbacks->m_gcCallbacks.push_back(std::move(callback));
+  v8::debug::GetCurrentPlatform()
+      ->GetForegroundTaskRunner(m_isolate)
+      ->PostNonNestableTask(
+          std::make_unique<GCTask>(m_isolate, m_asyncCallbacks));
 }
 
 Response V8HeapProfilerAgentImpl::startTrackingHeapObjects(
     Maybe<bool> trackAllocations) {
   m_state->setBoolean(HeapProfilerAgentState::heapObjectsTrackingEnabled, true);
-  bool allocationTrackingEnabled = trackAllocations.fromMaybe(false);
+  bool allocationTrackingEnabled = trackAllocations.value_or(false);
   m_state->setBoolean(HeapProfilerAgentState::allocationTrackingEnabled,
                       allocationTrackingEnabled);
   startTrackingHeapObjectsInternal(allocationTrackingEnabled);
@@ -247,9 +321,11 @@ Response V8HeapProfilerAgentImpl::stopTrackingHeapObjects(
     Maybe<bool> reportProgress, Maybe<bool> treatGlobalObjectsAsRoots,
     Maybe<bool> captureNumericValue, Maybe<bool> exposeInternals) {
   requestHeapStatsUpdate();
-  takeHeapSnapshot(std::move(reportProgress),
-                   std::move(treatGlobalObjectsAsRoots),
-                   std::move(captureNumericValue), std::move(exposeInternals));
+  takeHeapSnapshotNow(
+      HeapSnapshotProtocolOptions(
+          std::move(reportProgress), std::move(treatGlobalObjectsAsRoots),
+          std::move(captureNumericValue), std::move(exposeInternals)),
+      cppgc::EmbedderStackState::kMayContainHeapPointers);
   stopTrackingHeapObjectsInternal();
   return Response::Success();
 }
@@ -271,13 +347,46 @@ Response V8HeapProfilerAgentImpl::disable() {
   return Response::Success();
 }
 
-Response V8HeapProfilerAgentImpl::takeHeapSnapshot(
+void V8HeapProfilerAgentImpl::takeHeapSnapshot(
     Maybe<bool> reportProgress, Maybe<bool> treatGlobalObjectsAsRoots,
-    Maybe<bool> captureNumericValue, Maybe<bool> exposeInternals) {
+    Maybe<bool> captureNumericValue, Maybe<bool> exposeInternals,
+    std::unique_ptr<TakeHeapSnapshotCallback> callback) {
+  HeapSnapshotProtocolOptions protocolOptions(
+      std::move(reportProgress), std::move(treatGlobalObjectsAsRoots),
+      std::move(captureNumericValue), std::move(exposeInternals));
+  std::shared_ptr<v8::TaskRunner> task_runner =
+      v8::debug::GetCurrentPlatform()->GetForegroundTaskRunner(m_isolate);
+
+  // Heap snapshots can be more accurate if we wait until the stack is empty and
+  // run the garbage collector without conservative stack scanning, as done in
+  // V8HeapProfilerAgentImpl::collectGarbage. However, heap snapshots can also
+  // be requested while paused in the debugger, in which case the snapshot must
+  // be taken immediately with conservative stack scanning enabled.
+  if (m_session->inspector()->debugger()->isPaused() ||
+      !task_runner->NonNestableTasksEnabled()) {
+    Response response = takeHeapSnapshotNow(
+        protocolOptions, cppgc::EmbedderStackState::kMayContainHeapPointers);
+    if (response.IsSuccess()) {
+      callback->sendSuccess();
+    } else {
+      callback->sendFailure(std::move(response));
+    }
+    return;
+  }
+
+  std::unique_ptr<HeapSnapshotTask> task = std::make_unique<HeapSnapshotTask>(
+      this, m_asyncCallbacks, protocolOptions, std::move(callback));
+  m_asyncCallbacks->m_heapSnapshotTasks.push_back(task.get());
+  task_runner->PostNonNestableTask(std::move(task));
+}
+
+Response V8HeapProfilerAgentImpl::takeHeapSnapshotNow(
+    const HeapSnapshotProtocolOptions& protocolOptions,
+    cppgc::EmbedderStackState stackState) {
   v8::HeapProfiler* profiler = m_isolate->GetHeapProfiler();
   if (!profiler) return Response::ServerError("Cannot access v8 heap profiler");
   std::unique_ptr<HeapSnapshotProgress> progress;
-  if (reportProgress.fromMaybe(false))
+  if (protocolOptions.m_reportProgress)
     progress.reset(new HeapSnapshotProgress(&m_frontend));
 
   GlobalObjectNameResolver resolver(m_session);
@@ -285,16 +394,17 @@ Response V8HeapProfilerAgentImpl::takeHeapSnapshot(
   options.global_object_name_resolver = &resolver;
   options.control = progress.get();
   options.snapshot_mode =
-      exposeInternals.fromMaybe(false) ||
+      protocolOptions.m_exposeInternals ||
               // Not treating global objects as roots results into exposing
               // internals.
-              !treatGlobalObjectsAsRoots.fromMaybe(true)
+              !protocolOptions.m_treatGlobalObjectsAsRoots
           ? v8::HeapProfiler::HeapSnapshotMode::kExposeInternals
           : v8::HeapProfiler::HeapSnapshotMode::kRegular;
   options.numerics_mode =
-      captureNumericValue.fromMaybe(false)
+      protocolOptions.m_captureNumericValue
           ? v8::HeapProfiler::NumericsMode::kExposeNumericValues
           : v8::HeapProfiler::NumericsMode::kHideNumericValues;
+  options.stack_state = stackState;
   const v8::HeapSnapshot* snapshot = profiler->TakeHeapSnapshot(options);
   if (!snapshot) return Response::ServerError("Failed to take heap snapshot");
   HeapSnapshotOutputStream stream(&m_frontend);
@@ -323,11 +433,19 @@ Response V8HeapProfilerAgentImpl::getObjectByHeapObjectId(
     return Response::ServerError("Object is not available");
   }
   *result = m_session->wrapObject(creationContext, heapObject,
-                                  objectGroup.fromMaybe(""), false);
+                                  objectGroup.value_or(""), false);
   if (!*result) return Response::ServerError("Object is not available");
   return Response::Success();
 }
 
+void V8HeapProfilerAgentImpl::takePendingHeapSnapshots() {
+  // Each task will remove itself from m_heapSnapshotTasks.
+  while (m_asyncCallbacks->m_heapSnapshotTasks.size() > 0) {
+    m_asyncCallbacks->m_heapSnapshotTasks.front()->Run(
+        cppgc::EmbedderStackState::kMayContainHeapPointers);
+  }
+}
+
 Response V8HeapProfilerAgentImpl::addInspectedHeapObject(
     const String16& inspectedHeapObjectId) {
   bool ok;
@@ -371,7 +489,38 @@ void V8HeapProfilerAgentImpl::requestHeapStatsUpdate() {
 
 // static
 void V8HeapProfilerAgentImpl::onTimer(void* data) {
-  reinterpret_cast<V8HeapProfilerAgentImpl*>(data)->requestHeapStatsUpdate();
+  reinterpret_cast<V8HeapProfilerAgentImpl*>(data)->onTimerImpl();
+}
+
+static constexpr v8::base::TimeDelta kDefaultTimerDelay =
+    v8::base::TimeDelta::FromMilliseconds(50);
+
+void V8HeapProfilerAgentImpl::onTimerImpl() {
+  v8::base::TimeTicks start = v8::base::TimeTicks::Now();
+  requestHeapStatsUpdate();
+  v8::base::TimeDelta elapsed = v8::base::TimeTicks::Now() - start;
+  if (m_hasTimer) {
+    // requestHeapStatsUpdate can take a long time on large heaps. To ensure
+    // that there is still some time for the thread to make progress on running
+    // JavaScript or doing other useful work, we'll adjust the timer delay here.
+    const v8::base::TimeDelta minAcceptableDelay =
+        std::max(elapsed * 2, kDefaultTimerDelay);
+    const v8::base::TimeDelta idealDelay =
+        std::max(elapsed * 3, kDefaultTimerDelay);
+    const v8::base::TimeDelta maxAcceptableDelay =
+        std::max(elapsed * 4, kDefaultTimerDelay);
+    if (m_timerDelayInSeconds < minAcceptableDelay.InSecondsF() ||
+        m_timerDelayInSeconds > maxAcceptableDelay.InSecondsF()) {
+      // The existing timer's speed is not very close to ideal, so cancel it and
+      // start a new timer.
+      m_session->inspector()->client()->cancelTimer(
+          reinterpret_cast<void*>(this));
+      m_timerDelayInSeconds = idealDelay.InSecondsF();
+      m_session->inspector()->client()->startRepeatingTimer(
+          m_timerDelayInSeconds, &V8HeapProfilerAgentImpl::onTimer,
+          reinterpret_cast<void*>(this));
+    }
+  }
 }
 
 void V8HeapProfilerAgentImpl::startTrackingHeapObjectsInternal(
@@ -379,8 +528,10 @@ void V8HeapProfilerAgentImpl::startTrackingHeapObjectsInternal(
   m_isolate->GetHeapProfiler()->StartTrackingHeapObjects(trackAllocations);
   if (!m_hasTimer) {
     m_hasTimer = true;
+    m_timerDelayInSeconds = kDefaultTimerDelay.InSecondsF();
     m_session->inspector()->client()->startRepeatingTimer(
-        0.05, &V8HeapProfilerAgentImpl::onTimer, reinterpret_cast<void*>(this));
+        m_timerDelayInSeconds, &V8HeapProfilerAgentImpl::onTimer,
+        reinterpret_cast<void*>(this));
   }
 }
 
@@ -404,7 +555,7 @@ Response V8HeapProfilerAgentImpl::startSampling(
   if (!profiler) return Response::ServerError("Cannot access v8 heap profiler");
   const unsigned defaultSamplingInterval = 1 << 15;
   double samplingIntervalValue =
-      samplingInterval.fromMaybe(defaultSamplingInterval);
+      samplingInterval.value_or(defaultSamplingInterval);
   if (samplingIntervalValue <= 0.0) {
     return Response::ServerError("Invalid sampling interval");
   }
@@ -413,10 +564,10 @@ Response V8HeapProfilerAgentImpl::startSampling(
   m_state->setBoolean(HeapProfilerAgentState::samplingHeapProfilerEnabled,
                       true);
   int flags = v8::HeapProfiler::kSamplingForceGC;
-  if (includeObjectsCollectedByMajorGC.fromMaybe(false)) {
+  if (includeObjectsCollectedByMajorGC.value_or(false)) {
     flags |= v8::HeapProfiler::kSamplingIncludeObjectsCollectedByMajorGC;
   }
-  if (includeObjectsCollectedByMinorGC.fromMaybe(false)) {
+  if (includeObjectsCollectedByMinorGC.value_or(false)) {
     flags |= v8::HeapProfiler::kSamplingIncludeObjectsCollectedByMinorGC;
   }
   m_state->setInteger(HeapProfilerAgentState::samplingHeapProfilerFlags, flags);
diff --git a/deps/v8/src/inspector/v8-heap-profiler-agent-impl.h b/deps/v8/src/inspector/v8-heap-profiler-agent-impl.h
index 61c6b6af53b9d5..be9e9724b69d85 100644
--- a/deps/v8/src/inspector/v8-heap-profiler-agent-impl.h
+++ b/deps/v8/src/inspector/v8-heap-profiler-agent-impl.h
@@ -43,10 +43,10 @@ class V8HeapProfilerAgentImpl : public protocol::HeapProfiler::Backend {
 
   Response disable() override;
 
-  Response takeHeapSnapshot(Maybe<bool> reportProgress,
-                            Maybe<bool> treatGlobalObjectsAsRoots,
-                            Maybe<bool> captureNumericValue,
-                            Maybe<bool> exposeInternals) override;
+  void takeHeapSnapshot(
+      Maybe<bool> reportProgress, Maybe<bool> treatGlobalObjectsAsRoots,
+      Maybe<bool> captureNumericValue, Maybe<bool> exposeInternals,
+      std::unique_ptr<TakeHeapSnapshotCallback> callback) override;
 
   Response getObjectByHeapObjectId(
       const String16& heapSnapshotObjectId, Maybe<String16> objectGroup,
@@ -64,21 +64,32 @@ class V8HeapProfilerAgentImpl : public protocol::HeapProfiler::Backend {
   Response getSamplingProfile(
       std::unique_ptr<protocol::HeapProfiler::SamplingHeapProfile>*) override;
 
+  // If any heap snapshot requests have been deferred, run them now. This is
+  // called by the debugger when pausing execution on this thread.
+  void takePendingHeapSnapshots();
+
  private:
-  struct AsyncGC;
+  struct AsyncCallbacks;
   class GCTask;
+  class HeapSnapshotTask;
+  struct HeapSnapshotProtocolOptions;
 
+  Response takeHeapSnapshotNow(
+      const HeapSnapshotProtocolOptions& protocolOptions,
+      cppgc::EmbedderStackState stackState);
   void startTrackingHeapObjectsInternal(bool trackAllocations);
   void stopTrackingHeapObjectsInternal();
   void requestHeapStatsUpdate();
   static void onTimer(void*);
+  void onTimerImpl();
 
   V8InspectorSessionImpl* m_session;
   v8::Isolate* m_isolate;
   protocol::HeapProfiler::Frontend m_frontend;
   protocol::DictionaryValue* m_state;
   bool m_hasTimer;
-  std::shared_ptr<AsyncGC> m_async_gc;
+  double m_timerDelayInSeconds;
+  std::shared_ptr<AsyncCallbacks> m_asyncCallbacks;
 };
 
 }  // namespace v8_inspector
diff --git a/deps/v8/src/inspector/v8-inspector-impl.h b/deps/v8/src/inspector/v8-inspector-impl.h
index 0d30cc59f9ba43..90f85854b8ec95 100644
--- a/deps/v8/src/inspector/v8-inspector-impl.h
+++ b/deps/v8/src/inspector/v8-inspector-impl.h
@@ -65,6 +65,9 @@ class V8InspectorImpl : public V8Inspector {
   v8::Isolate* isolate() const { return m_isolate; }
   V8InspectorClient* client() { return m_client; }
   V8Debugger* debugger() { return m_debugger.get(); }
+  PromiseHandlerTracker& promiseHandlerTracker() {
+    return m_promiseHandlerTracker;
+  }
   int contextGroupId(v8::Local<v8::Context>) const;
   int contextGroupId(int contextId) const;
   uint64_t isolateId() const { return m_isolateId; }
@@ -191,6 +194,7 @@ class V8InspectorImpl : public V8Inspector {
   std::map<std::pair<int64_t, int64_t>, int> m_uniqueIdToContextId;
 
   std::unique_ptr<V8Console> m_console;
+  PromiseHandlerTracker m_promiseHandlerTracker;
 };
 
 }  // namespace v8_inspector
diff --git a/deps/v8/src/inspector/v8-inspector-session-impl.cc b/deps/v8/src/inspector/v8-inspector-session-impl.cc
index 36e11bdf19b1b5..f0deb8b2e4167f 100644
--- a/deps/v8/src/inspector/v8-inspector-session-impl.cc
+++ b/deps/v8/src/inspector/v8-inspector-session-impl.cc
@@ -335,9 +335,10 @@ V8InspectorSessionImpl::wrapObject(v8::Local<v8::Context> context,
   findInjectedScript(InspectedContext::contextId(context), injectedScript);
   if (!injectedScript) return nullptr;
   std::unique_ptr<protocol::Runtime::RemoteObject> result;
-  injectedScript->wrapObject(
-      value, groupName,
-      generatePreview ? WrapMode::kWithPreview : WrapMode::kNoPreview, &result);
+  injectedScript->wrapObject(value, groupName,
+                             generatePreview ? WrapOptions({WrapMode::kPreview})
+                                             : WrapOptions({WrapMode::kIdOnly}),
+                             &result);
   return result;
 }
 
diff --git a/deps/v8/src/inspector/v8-inspector-session-impl.h b/deps/v8/src/inspector/v8-inspector-session-impl.h
index 9e443161c46861..bd00b9ff329e7d 100644
--- a/deps/v8/src/inspector/v8-inspector-session-impl.h
+++ b/deps/v8/src/inspector/v8-inspector-session-impl.h
@@ -48,6 +48,9 @@ class V8InspectorSessionImpl : public V8InspectorSession,
   V8SchemaAgentImpl* schemaAgent() { return m_schemaAgent.get(); }
   V8ProfilerAgentImpl* profilerAgent() { return m_profilerAgent.get(); }
   V8RuntimeAgentImpl* runtimeAgent() { return m_runtimeAgent.get(); }
+  V8HeapProfilerAgentImpl* heapProfilerAgent() {
+    return m_heapProfilerAgent.get();
+  }
   int contextGroupId() const { return m_contextGroupId; }
   int sessionId() const { return m_sessionId; }
 
diff --git a/deps/v8/src/inspector/v8-profiler-agent-impl.cc b/deps/v8/src/inspector/v8-profiler-agent-impl.cc
index 4b9ad7c40a7994..fda22a9a02fb50 100644
--- a/deps/v8/src/inspector/v8-profiler-agent-impl.cc
+++ b/deps/v8/src/inspector/v8-profiler-agent-impl.cc
@@ -305,9 +305,9 @@ Response V8ProfilerAgentImpl::startPreciseCoverage(
     Maybe<bool> allowTriggeredUpdates, double* out_timestamp) {
   if (!m_enabled) return Response::ServerError("Profiler is not enabled");
   *out_timestamp = v8::base::TimeTicks::Now().since_origin().InSecondsF();
-  bool callCountValue = callCount.fromMaybe(false);
-  bool detailedValue = detailed.fromMaybe(false);
-  bool allowTriggeredUpdatesValue = allowTriggeredUpdates.fromMaybe(false);
+  bool callCountValue = callCount.value_or(false);
+  bool detailedValue = detailed.value_or(false);
+  bool allowTriggeredUpdatesValue = allowTriggeredUpdates.value_or(false);
   m_state->setBoolean(ProfilerAgentState::preciseCoverageStarted, true);
   m_state->setBoolean(ProfilerAgentState::preciseCoverageCallCount,
                       callCountValue);
diff --git a/deps/v8/src/inspector/v8-runtime-agent-impl.cc b/deps/v8/src/inspector/v8-runtime-agent-impl.cc
index 9a1a845487ad4e..e047c50ffbfff3 100644
--- a/deps/v8/src/inspector/v8-runtime-agent-impl.cc
+++ b/deps/v8/src/inspector/v8-runtime-agent-impl.cc
@@ -32,6 +32,8 @@
 
 #include <inttypes.h>
 
+#include <memory>
+
 #include "../../third_party/inspector_protocol/crdtp/json.h"
 #include "include/v8-container.h"
 #include "include/v8-context.h"
@@ -42,6 +44,7 @@
 #include "src/inspector/injected-script.h"
 #include "src/inspector/inspected-context.h"
 #include "src/inspector/protocol/Protocol.h"
+#include "src/inspector/protocol/Runtime.h"
 #include "src/inspector/remote-object-id.h"
 #include "src/inspector/v8-console-message.h"
 #include "src/inspector/v8-debugger-agent-impl.h"
@@ -96,14 +99,15 @@ template <typename ProtocolCallback>
 bool wrapEvaluateResultAsync(InjectedScript* injectedScript,
                              v8::MaybeLocal<v8::Value> maybeResultValue,
                              const v8::TryCatch& tryCatch,
-                             const String16& objectGroup, WrapMode wrapMode,
+                             const String16& objectGroup,
+                             const WrapOptions& wrapOptions,
                              bool throwOnSideEffect,
                              ProtocolCallback* callback) {
   std::unique_ptr<RemoteObject> result;
   Maybe<protocol::Runtime::ExceptionDetails> exceptionDetails;
 
   Response response = injectedScript->wrapEvaluateResult(
-      maybeResultValue, tryCatch, objectGroup, wrapMode, throwOnSideEffect,
+      maybeResultValue, tryCatch, objectGroup, wrapOptions, throwOnSideEffect,
       &result, &exceptionDetails);
   if (response.IsSuccess()) {
     callback->sendSuccess(std::move(result), std::move(exceptionDetails));
@@ -117,22 +121,22 @@ void innerCallFunctionOn(
     V8InspectorSessionImpl* session, InjectedScript::Scope& scope,
     v8::Local<v8::Value> recv, const String16& expression,
     Maybe<protocol::Array<protocol::Runtime::CallArgument>> optionalArguments,
-    bool silent, WrapMode wrapMode, bool userGesture, bool awaitPromise,
-    const String16& objectGroup, bool throwOnSideEffect,
+    bool silent, std::unique_ptr<WrapOptions> wrapOptions, bool userGesture,
+    bool awaitPromise, const String16& objectGroup, bool throwOnSideEffect,
     std::unique_ptr<V8RuntimeAgentImpl::CallFunctionOnCallback> callback) {
   V8InspectorImpl* inspector = session->inspector();
 
   std::unique_ptr<v8::Local<v8::Value>[]> argv = nullptr;
   int argc = 0;
-  if (optionalArguments.isJust()) {
-    protocol::Array<protocol::Runtime::CallArgument>* arguments =
-        optionalArguments.fromJust();
-    argc = static_cast<int>(arguments->size());
+  if (optionalArguments.has_value()) {
+    protocol::Array<protocol::Runtime::CallArgument>& arguments =
+        optionalArguments.value();
+    argc = static_cast<int>(arguments.size());
     argv.reset(new v8::Local<v8::Value>[argc]);
     for (int i = 0; i < argc; ++i) {
       v8::Local<v8::Value> argumentValue;
       Response response = scope.injectedScript()->resolveCallArgument(
-          (*arguments)[i].get(), &argumentValue);
+          arguments[i].get(), &argumentValue);
       if (!response.IsSuccess()) {
         callback->sendFailure(response);
         return;
@@ -166,8 +170,9 @@ void innerCallFunctionOn(
 
   if (scope.tryCatch().HasCaught()) {
     wrapEvaluateResultAsync(scope.injectedScript(), maybeFunctionValue,
-                            scope.tryCatch(), objectGroup, WrapMode::kNoPreview,
-                            throwOnSideEffect, callback.get());
+                            scope.tryCatch(), objectGroup,
+                            WrapOptions({WrapMode::kIdOnly}), throwOnSideEffect,
+                            callback.get());
     return;
   }
 
@@ -197,14 +202,14 @@ void innerCallFunctionOn(
 
   if (!awaitPromise || scope.tryCatch().HasCaught()) {
     wrapEvaluateResultAsync(scope.injectedScript(), maybeResultValue,
-                            scope.tryCatch(), objectGroup, wrapMode,
+                            scope.tryCatch(), objectGroup, *wrapOptions.get(),
                             throwOnSideEffect, callback.get());
     return;
   }
 
   scope.injectedScript()->addPromiseCallback(
-      session, maybeResultValue, objectGroup, wrapMode, false /* replMode */,
-      throwOnSideEffect,
+      session, maybeResultValue, objectGroup, std::move(wrapOptions),
+      false /* replMode */, throwOnSideEffect,
       EvaluateCallbackWrapper<V8RuntimeAgentImpl::CallFunctionOnCallback>::wrap(
           std::move(callback)));
 }
@@ -212,14 +217,14 @@ void innerCallFunctionOn(
 Response ensureContext(V8InspectorImpl* inspector, int contextGroupId,
                        Maybe<int> executionContextId,
                        Maybe<String16> uniqueContextId, int* contextId) {
-  if (executionContextId.isJust()) {
-    if (uniqueContextId.isJust()) {
+  if (executionContextId.has_value()) {
+    if (uniqueContextId.has_value()) {
       return Response::InvalidParams(
           "contextId and uniqueContextId are mutually exclusive");
     }
-    *contextId = executionContextId.fromJust();
-  } else if (uniqueContextId.isJust()) {
-    internal::V8DebuggerId uniqueId(uniqueContextId.fromJust());
+    *contextId = executionContextId.value();
+  } else if (uniqueContextId.has_value()) {
+    internal::V8DebuggerId uniqueId(uniqueContextId.value());
     if (!uniqueId.isValid())
       return Response::InvalidParams("invalid uniqueContextId");
     int id = inspector->resolveUniqueContextId(uniqueId);
@@ -237,6 +242,106 @@ Response ensureContext(V8InspectorImpl* inspector, int contextGroupId,
   return Response::Success();
 }
 
+Response parseAdditionalSerializationParameters(
+    protocol::DictionaryValue* additionalParameters, v8::Isolate* isolate,
+    v8::Local<v8::Object>* result) {
+  std::vector<v8::Local<v8::Name>> keys;
+  std::vector<v8::Local<v8::Value>> values;
+
+  if (additionalParameters != nullptr) {
+    for (size_t i = 0; i < additionalParameters->size(); ++i) {
+      String16 key = (*additionalParameters).at(i).first;
+      keys.push_back(toV8String(isolate, key));
+
+      protocol::Value* value = (*additionalParameters).at(i).second;
+      String16 stringValue;
+      if (value->asString(&stringValue)) {
+        values.push_back(toV8String(isolate, stringValue));
+        continue;
+      }
+      int intValue;
+      if (value->asInteger(&intValue)) {
+        values.push_back(v8::Int32::New(isolate, intValue));
+        continue;
+      }
+      return Response::InvalidParams(
+          "Values of serializationOptions.additionalParameters can be only of "
+          "type string or integer.");
+    }
+  }
+  CHECK(keys.size() == values.size());
+  *result = v8::Object::New(isolate, v8::Null(isolate), keys.data(),
+                            values.data(), keys.size());
+
+  return Response::Success();
+}
+
+Response getWrapOptions(
+    Maybe<bool> returnByValue, Maybe<bool> generatePreview,
+    Maybe<bool> generateWebDriverValue,
+    Maybe<protocol::Runtime::SerializationOptions> maybeSerializationOptions,
+    v8::Isolate* isolate, std::unique_ptr<WrapOptions>* result) {
+  if (maybeSerializationOptions.has_value()) {
+    auto& serializationOptions = maybeSerializationOptions.value();
+    String16 serializationModeStr = serializationOptions.getSerialization();
+    if (serializationModeStr ==
+        protocol::Runtime::SerializationOptions::SerializationEnum::Deep) {
+      v8::Local<v8::Object> additionalParameters;
+      Response response = parseAdditionalSerializationParameters(
+          serializationOptions.getAdditionalParameters(nullptr), isolate,
+          &additionalParameters);
+      if (!response.IsSuccess()) {
+        return response;
+      }
+      *result = std::make_unique<WrapOptions>(
+          WrapOptions{WrapMode::kDeep,
+                      {serializationOptions.getMaxDepth(v8::internal::kMaxInt),
+                       v8::Global<v8::Object>(isolate, additionalParameters)}});
+      return Response::Success();
+    }
+    if (serializationModeStr ==
+        protocol::Runtime::SerializationOptions::SerializationEnum::Json) {
+      *result = std::make_unique<WrapOptions>(WrapOptions{WrapMode::kJson});
+      return Response::Success();
+    }
+    if (serializationModeStr ==
+        protocol::Runtime::SerializationOptions::SerializationEnum::IdOnly) {
+      *result = std::make_unique<WrapOptions>(WrapOptions{WrapMode::kIdOnly});
+      return Response::Success();
+    }
+    return Response::InvalidParams(
+        "Unknown serializationOptions.serialization value " +
+        serializationModeStr.utf8());
+  }
+
+  if (generateWebDriverValue.value_or(false)) {
+    *result = std::make_unique<WrapOptions>(WrapOptions{WrapMode::kWebDriver});
+    return Response::Success();
+  }
+  if (returnByValue.value_or(false)) {
+    *result = std::make_unique<WrapOptions>(WrapOptions{WrapMode::kJson});
+    return Response::Success();
+  }
+  if (generatePreview.value_or(false)) {
+    *result = std::make_unique<WrapOptions>(WrapOptions{WrapMode::kPreview});
+    return Response::Success();
+  }
+  *result = std::make_unique<WrapOptions>(WrapOptions{WrapMode::kIdOnly});
+  return Response::Success();
+}
+
+Response getWrapOptions(Maybe<bool> returnByValue, Maybe<bool> generatePreview,
+                        Maybe<bool> generateWebDriverValue,
+                        v8::Isolate* isolate,
+                        std::unique_ptr<WrapOptions>* result) {
+  return getWrapOptions(
+      std::move(returnByValue), std::move(generatePreview),
+      std::move(generateWebDriverValue),
+      Maybe<protocol::Runtime::
+                SerializationOptions>() /* empty serialization options */,
+      isolate, result);
+}
+
 }  // namespace
 
 V8RuntimeAgentImpl::V8RuntimeAgentImpl(
@@ -261,6 +366,7 @@ void V8RuntimeAgentImpl::evaluate(
     Maybe<double> timeout, Maybe<bool> disableBreaks, Maybe<bool> maybeReplMode,
     Maybe<bool> allowUnsafeEvalBlockedByCSP, Maybe<String16> uniqueContextId,
     Maybe<bool> generateWebDriverValue,
+    Maybe<protocol::Runtime::SerializationOptions> serializationOptions,
     std::unique_ptr<EvaluateCallback> callback) {
   TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("devtools.timeline"),
                "EvaluateScript");
@@ -280,22 +386,22 @@ void V8RuntimeAgentImpl::evaluate(
     return;
   }
 
-  if (silent.fromMaybe(false)) scope.ignoreExceptionsAndMuteConsole();
-  if (userGesture.fromMaybe(false)) scope.pretendUserGesture();
+  if (silent.value_or(false)) scope.ignoreExceptionsAndMuteConsole();
+  if (userGesture.value_or(false)) scope.pretendUserGesture();
 
-  if (includeCommandLineAPI.fromMaybe(false)) scope.installCommandLineAPI();
+  if (includeCommandLineAPI.value_or(false)) scope.installCommandLineAPI();
 
-  const bool replMode = maybeReplMode.fromMaybe(false);
+  const bool replMode = maybeReplMode.value_or(false);
 
-  if (allowUnsafeEvalBlockedByCSP.fromMaybe(true)) {
+  if (allowUnsafeEvalBlockedByCSP.value_or(true)) {
     // Temporarily enable allow evals for inspector.
     scope.allowCodeGenerationFromStrings();
   }
   v8::MaybeLocal<v8::Value> maybeResultValue;
   {
     V8InspectorImpl::EvaluateScope evaluateScope(scope);
-    if (timeout.isJust()) {
-      response = evaluateScope.setTimeout(timeout.fromJust() / 1000.0);
+    if (timeout.has_value()) {
+      response = evaluateScope.setTimeout(timeout.value() / 1000.0);
       if (!response.IsSuccess()) {
         callback->sendFailure(response);
         return;
@@ -305,9 +411,9 @@ void V8RuntimeAgentImpl::evaluate(
                                         v8::MicrotasksScope::kRunMicrotasks);
     v8::debug::EvaluateGlobalMode mode =
         v8::debug::EvaluateGlobalMode::kDefault;
-    if (throwOnSideEffect.fromMaybe(false)) {
+    if (throwOnSideEffect.value_or(false)) {
       mode = v8::debug::EvaluateGlobalMode::kDisableBreaksAndThrowOnSideEffect;
-    } else if (disableBreaks.fromMaybe(false)) {
+    } else if (disableBreaks.value_or(false)) {
       mode = v8::debug::EvaluateGlobalMode::kDisableBreaks;
     }
     const v8::Local<v8::String> source =
@@ -324,24 +430,28 @@ void V8RuntimeAgentImpl::evaluate(
     return;
   }
 
-  WrapMode wrap_mode = generatePreview.fromMaybe(false) ? WrapMode::kWithPreview
-                                                        : WrapMode::kNoPreview;
-  if (returnByValue.fromMaybe(false)) wrap_mode = WrapMode::kForceValue;
-  if (generateWebDriverValue.fromMaybe(false))
-    wrap_mode = WrapMode::kGenerateWebDriverValue;
+  std::unique_ptr<WrapOptions> wrapOptions;
+  response = getWrapOptions(
+      std::move(returnByValue), std::move(generatePreview),
+      std::move(generateWebDriverValue), std::move(serializationOptions),
+      m_inspector->isolate(), &wrapOptions);
+  if (!response.IsSuccess()) {
+    callback->sendFailure(response);
+    return;
+  }
 
   // REPL mode always returns a promise that must be awaited.
-  const bool await = replMode || maybeAwaitPromise.fromMaybe(false);
+  const bool await = replMode || maybeAwaitPromise.value_or(false);
   if (!await || scope.tryCatch().HasCaught()) {
     wrapEvaluateResultAsync(scope.injectedScript(), maybeResultValue,
-                            scope.tryCatch(), objectGroup.fromMaybe(""),
-                            wrap_mode, throwOnSideEffect.fromMaybe(false),
-                            callback.get());
+                            scope.tryCatch(), objectGroup.value_or(""),
+                            *wrapOptions.get(),
+                            throwOnSideEffect.value_or(false), callback.get());
     return;
   }
   scope.injectedScript()->addPromiseCallback(
-      m_session, maybeResultValue, objectGroup.fromMaybe(""), wrap_mode,
-      replMode, throwOnSideEffect.fromMaybe(false),
+      m_session, maybeResultValue, objectGroup.value_or(""),
+      std::move(wrapOptions), replMode, throwOnSideEffect.value_or(false),
       EvaluateCallbackWrapper<EvaluateCallback>::wrap(std::move(callback)));
 }
 
@@ -360,12 +470,20 @@ void V8RuntimeAgentImpl::awaitPromise(
         Response::ServerError("Could not find promise with given id"));
     return;
   }
-  WrapMode mode = generatePreview.fromMaybe(false) ? WrapMode::kWithPreview
-                                                   : WrapMode::kNoPreview;
-  if (returnByValue.fromMaybe(false)) mode = WrapMode::kForceValue;
+
+  std::unique_ptr<WrapOptions> wrapOptions;
+  response = getWrapOptions(
+      std::move(returnByValue), std::move(generatePreview),
+      false /* generateWebDriverValue */, m_inspector->isolate(), &wrapOptions);
+  if (!response.IsSuccess()) {
+    callback->sendFailure(response);
+    return;
+  }
+
   scope.injectedScript()->addPromiseCallback(
-      m_session, scope.object(), scope.objectGroupName(), mode,
-      false /* replMode */, false /* throwOnSideEffect */,
+      m_session, scope.object(), scope.objectGroupName(),
+      std::move(wrapOptions), false /* replMode */,
+      false /* throwOnSideEffect */,
       EvaluateCallbackWrapper<AwaitPromiseCallback>::wrap(std::move(callback)));
 }
 
@@ -377,10 +495,11 @@ void V8RuntimeAgentImpl::callFunctionOn(
     Maybe<int> executionContextId, Maybe<String16> objectGroup,
     Maybe<bool> throwOnSideEffect, Maybe<String16> uniqueContextId,
     Maybe<bool> generateWebDriverValue,
+    Maybe<protocol::Runtime::SerializationOptions> serializationOptions,
     std::unique_ptr<CallFunctionOnCallback> callback) {
-  int justCount = (objectId.isJust() ? 1 : 0) +
-                  (executionContextId.isJust() ? 1 : 0) +
-                  (uniqueContextId.isJust() ? 1 : 0);
+  int justCount = (objectId.has_value() ? 1 : 0) +
+                  (executionContextId.has_value() ? 1 : 0) +
+                  (uniqueContextId.has_value() ? 1 : 0);
   if (justCount > 1) {
     callback->sendFailure(Response::InvalidParams(
         "ObjectId, executionContextId and uniqueContextId must mutually "
@@ -393,25 +512,31 @@ void V8RuntimeAgentImpl::callFunctionOn(
                                 "uniqueContextId must be specified"));
     return;
   }
-  WrapMode wrap_mode = generatePreview.fromMaybe(false) ? WrapMode::kWithPreview
-                                                        : WrapMode::kNoPreview;
-  if (returnByValue.fromMaybe(false)) wrap_mode = WrapMode::kForceValue;
-  if (generateWebDriverValue.fromMaybe(false))
-    wrap_mode = WrapMode::kGenerateWebDriverValue;
-  if (objectId.isJust()) {
-    InjectedScript::ObjectScope scope(m_session, objectId.fromJust());
+
+  if (objectId.has_value()) {
+    InjectedScript::ObjectScope scope(m_session, objectId.value());
     Response response = scope.initialize();
     if (!response.IsSuccess()) {
       callback->sendFailure(response);
       return;
     }
-    innerCallFunctionOn(
-        m_session, scope, scope.object(), expression,
-        std::move(optionalArguments), silent.fromMaybe(false), wrap_mode,
-        userGesture.fromMaybe(false), awaitPromise.fromMaybe(false),
-        objectGroup.isJust() ? objectGroup.fromMaybe(String16())
-                             : scope.objectGroupName(),
-        throwOnSideEffect.fromMaybe(false), std::move(callback));
+
+    std::unique_ptr<WrapOptions> wrapOptions;
+    response = getWrapOptions(
+        std::move(returnByValue), std::move(generatePreview),
+        std::move(generateWebDriverValue), std::move(serializationOptions),
+        m_inspector->isolate(), &wrapOptions);
+    if (!response.IsSuccess()) {
+      callback->sendFailure(response);
+      return;
+    }
+
+    innerCallFunctionOn(m_session, scope, scope.object(), expression,
+                        std::move(optionalArguments), silent.value_or(false),
+                        std::move(wrapOptions), userGesture.value_or(false),
+                        awaitPromise.value_or(false),
+                        objectGroup.value_or(scope.objectGroupName()),
+                        throwOnSideEffect.value_or(false), std::move(callback));
   } else {
     int contextId = 0;
     Response response = ensureContext(m_inspector, m_session->contextGroupId(),
@@ -427,12 +552,22 @@ void V8RuntimeAgentImpl::callFunctionOn(
       callback->sendFailure(response);
       return;
     }
-    innerCallFunctionOn(
-        m_session, scope, scope.context()->Global(), expression,
-        std::move(optionalArguments), silent.fromMaybe(false), wrap_mode,
-        userGesture.fromMaybe(false), awaitPromise.fromMaybe(false),
-        objectGroup.fromMaybe(""), throwOnSideEffect.fromMaybe(false),
-        std::move(callback));
+
+    std::unique_ptr<WrapOptions> wrapOptions;
+    response = getWrapOptions(
+        std::move(returnByValue), std::move(generatePreview),
+        std::move(generateWebDriverValue), std::move(serializationOptions),
+        m_inspector->isolate(), &wrapOptions);
+    if (!response.IsSuccess()) {
+      callback->sendFailure(response);
+      return;
+    }
+
+    innerCallFunctionOn(m_session, scope, scope.context()->Global(), expression,
+                        std::move(optionalArguments), silent.value_or(false),
+                        std::move(wrapOptions), userGesture.value_or(false),
+                        awaitPromise.value_or(false), objectGroup.value_or(""),
+                        throwOnSideEffect.value_or(false), std::move(callback));
   }
 }
 
@@ -461,13 +596,18 @@ Response V8RuntimeAgentImpl::getProperties(
     return Response::ServerError("Value with given id is not an object");
 
   v8::Local<v8::Object> object = scope.object().As<v8::Object>();
+
+  std::unique_ptr<WrapOptions> wrapOptions;
+  response = getWrapOptions(
+      false /* returnByValue */, std::move(generatePreview),
+      false /* generateWebDriverValue */, m_inspector->isolate(), &wrapOptions);
+  if (!response.IsSuccess()) return response;
+
   response = scope.injectedScript()->getProperties(
-      object, scope.objectGroupName(), ownProperties.fromMaybe(false),
-      accessorPropertiesOnly.fromMaybe(false),
-      nonIndexedPropertiesOnly.fromMaybe(false),
-      generatePreview.fromMaybe(false) ? WrapMode::kWithPreview
-                                       : WrapMode::kNoPreview,
-      result, exceptionDetails);
+      object, scope.objectGroupName(), ownProperties.value_or(false),
+      accessorPropertiesOnly.value_or(false),
+      nonIndexedPropertiesOnly.value_or(false), *wrapOptions.get(), result,
+      exceptionDetails);
   if (!response.IsSuccess()) return response;
   if (exceptionDetails->isJust()) return Response::Success();
   std::unique_ptr<protocol::Array<InternalPropertyDescriptor>>
@@ -475,7 +615,7 @@ Response V8RuntimeAgentImpl::getProperties(
   std::unique_ptr<protocol::Array<PrivatePropertyDescriptor>>
       privatePropertiesProtocolArray;
   response = scope.injectedScript()->getInternalAndPrivateProperties(
-      object, scope.objectGroupName(), accessorPropertiesOnly.fromMaybe(false),
+      object, scope.objectGroupName(), accessorPropertiesOnly.value_or(false),
       &internalPropertiesProtocolArray, &privatePropertiesProtocolArray);
   if (!response.IsSuccess()) return response;
   if (!internalPropertiesProtocolArray->empty())
@@ -616,7 +756,7 @@ void V8RuntimeAgentImpl::runScript(
     return;
   }
 
-  if (silent.fromMaybe(false)) scope.ignoreExceptionsAndMuteConsole();
+  if (silent.value_or(false)) scope.ignoreExceptionsAndMuteConsole();
 
   std::unique_ptr<v8::Global<v8::Script>> scriptWrapper = std::move(it->second);
   m_compiledScripts.erase(it);
@@ -626,7 +766,7 @@ void V8RuntimeAgentImpl::runScript(
     return;
   }
 
-  if (includeCommandLineAPI.fromMaybe(false)) scope.installCommandLineAPI();
+  if (includeCommandLineAPI.value_or(false)) scope.installCommandLineAPI();
 
   v8::MaybeLocal<v8::Value> maybeResultValue;
   {
@@ -643,18 +783,26 @@ void V8RuntimeAgentImpl::runScript(
     return;
   }
 
-  WrapMode mode = generatePreview.fromMaybe(false) ? WrapMode::kWithPreview
-                                                   : WrapMode::kNoPreview;
-  if (returnByValue.fromMaybe(false)) mode = WrapMode::kForceValue;
-  if (!awaitPromise.fromMaybe(false) || scope.tryCatch().HasCaught()) {
+  std::unique_ptr<WrapOptions> wrapOptions;
+  response = getWrapOptions(
+      std::move(returnByValue), std::move(generatePreview),
+      false /* generateWebDriverValue */, m_inspector->isolate(), &wrapOptions);
+  if (!response.IsSuccess()) {
+    callback->sendFailure(response);
+    return;
+  }
+
+  if (!awaitPromise.value_or(false) || scope.tryCatch().HasCaught()) {
     wrapEvaluateResultAsync(scope.injectedScript(), maybeResultValue,
-                            scope.tryCatch(), objectGroup.fromMaybe(""), mode,
-                            false /* throwOnSideEffect */, callback.get());
+                            scope.tryCatch(), objectGroup.value_or(""),
+                            *wrapOptions.get(), false /* throwOnSideEffect */,
+                            callback.get());
     return;
   }
   scope.injectedScript()->addPromiseCallback(
-      m_session, maybeResultValue.ToLocalChecked(), objectGroup.fromMaybe(""),
-      mode, false /* replMode */, false /* throwOnSideEffect */,
+      m_session, maybeResultValue.ToLocalChecked(), objectGroup.value_or(""),
+      std::move(wrapOptions), false /* replMode */,
+      false /* throwOnSideEffect */,
       EvaluateCallbackWrapper<RunScriptCallback>::wrap(std::move(callback)));
 }
 
@@ -670,8 +818,8 @@ Response V8RuntimeAgentImpl::queryObjects(
   v8::Local<v8::Array> resultArray = m_inspector->debugger()->queryObjects(
       scope.context(), scope.object().As<v8::Object>());
   return scope.injectedScript()->wrapObject(
-      resultArray, objectGroup.fromMaybe(scope.objectGroupName()),
-      WrapMode::kNoPreview, objects);
+      resultArray, objectGroup.value_or(scope.objectGroupName()),
+      WrapOptions({WrapMode::kIdOnly}), objects);
 }
 
 Response V8RuntimeAgentImpl::globalLexicalScopeNames(
@@ -737,12 +885,12 @@ protocol::DictionaryValue* getOrCreateDictionary(
 Response V8RuntimeAgentImpl::addBinding(const String16& name,
                                         Maybe<int> executionContextId,
                                         Maybe<String16> executionContextName) {
-  if (executionContextId.isJust()) {
-    if (executionContextName.isJust()) {
+  if (executionContextId.has_value()) {
+    if (executionContextName.has_value()) {
       return Response::InvalidParams(
           "executionContextName is mutually exclusive with executionContextId");
     }
-    int contextId = executionContextId.fromJust();
+    int contextId = executionContextId.value();
     InspectedContext* context =
         m_inspector->getContext(m_session->contextGroupId(), contextId);
     if (!context) {
@@ -756,8 +904,8 @@ Response V8RuntimeAgentImpl::addBinding(const String16& name,
   // If it's a globally exposed binding, i.e. no context name specified, use
   // a special value for the context name.
   String16 contextKey = V8RuntimeAgentImplState::globalBindingsKey;
-  if (executionContextName.isJust()) {
-    contextKey = executionContextName.fromJust();
+  if (executionContextName.has_value()) {
+    contextKey = executionContextName.value();
     if (contextKey == V8RuntimeAgentImplState::globalBindingsKey) {
       return Response::InvalidParams("Invalid executionContextName");
     }
@@ -773,8 +921,8 @@ Response V8RuntimeAgentImpl::addBinding(const String16& name,
   m_inspector->forEachContext(
       m_session->contextGroupId(),
       [&name, &executionContextName, this](InspectedContext* context) {
-        if (executionContextName.isJust() &&
-            executionContextName.fromJust() != context->humanReadableName())
+        if (executionContextName.has_value() &&
+            executionContextName.value() != context->humanReadableName())
           return;
         addBinding(context, name);
       });
diff --git a/deps/v8/src/inspector/v8-runtime-agent-impl.h b/deps/v8/src/inspector/v8-runtime-agent-impl.h
index 4bb0e87114ab46..eaa8ab6c3db5a8 100644
--- a/deps/v8/src/inspector/v8-runtime-agent-impl.h
+++ b/deps/v8/src/inspector/v8-runtime-agent-impl.h
@@ -69,16 +69,17 @@ class V8RuntimeAgentImpl : public protocol::Runtime::Backend {
   // Part of the protocol.
   Response enable() override;
   Response disable() override;
-  void evaluate(const String16& expression, Maybe<String16> objectGroup,
-                Maybe<bool> includeCommandLineAPI, Maybe<bool> silent,
-                Maybe<int> executionContextId, Maybe<bool> returnByValue,
-                Maybe<bool> generatePreview, Maybe<bool> userGesture,
-                Maybe<bool> awaitPromise, Maybe<bool> throwOnSideEffect,
-                Maybe<double> timeout, Maybe<bool> disableBreaks,
-                Maybe<bool> replMode, Maybe<bool> allowUnsafeEvalBlockedByCSP,
-                Maybe<String16> uniqueContextId,
-                Maybe<bool> generateWebDriverValue,
-                std::unique_ptr<EvaluateCallback>) override;
+  void evaluate(
+      const String16& expression, Maybe<String16> objectGroup,
+      Maybe<bool> includeCommandLineAPI, Maybe<bool> silent,
+      Maybe<int> executionContextId, Maybe<bool> returnByValue,
+      Maybe<bool> generatePreview, Maybe<bool> userGesture,
+      Maybe<bool> awaitPromise, Maybe<bool> throwOnSideEffect,
+      Maybe<double> timeout, Maybe<bool> disableBreaks, Maybe<bool> replMode,
+      Maybe<bool> allowUnsafeEvalBlockedByCSP, Maybe<String16> uniqueContextId,
+      Maybe<bool> generateWebDriverValue,
+      Maybe<protocol::Runtime::SerializationOptions> serializationOptions,
+      std::unique_ptr<EvaluateCallback>) override;
   void awaitPromise(const String16& promiseObjectId, Maybe<bool> returnByValue,
                     Maybe<bool> generatePreview,
                     std::unique_ptr<AwaitPromiseCallback>) override;
@@ -90,6 +91,7 @@ class V8RuntimeAgentImpl : public protocol::Runtime::Backend {
       Maybe<bool> awaitPromise, Maybe<int> executionContextId,
       Maybe<String16> objectGroup, Maybe<bool> throwOnSideEffect,
       Maybe<String16> uniqueContextId, Maybe<bool> generateWebDriverValue,
+      Maybe<protocol::Runtime::SerializationOptions> serializationOptions,
       std::unique_ptr<CallFunctionOnCallback>) override;
   Response releaseObject(const String16& objectId) override;
   Response getProperties(
@@ -148,7 +150,7 @@ class V8RuntimeAgentImpl : public protocol::Runtime::Backend {
  private:
   bool reportMessage(V8ConsoleMessage*, bool generatePreview);
 
-  static void bindingCallback(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void bindingCallback(const v8::FunctionCallbackInfo<v8::Value>& info);
   void bindingCalled(const String16& name, const String16& payload,
                      int executionContextId);
   void addBinding(InspectedContext* context, const String16& name);
diff --git a/deps/v8/src/inspector/v8-serialization-duplicate-tracker.cc b/deps/v8/src/inspector/v8-serialization-duplicate-tracker.cc
new file mode 100644
index 00000000000000..a0f2c94d3357e4
--- /dev/null
+++ b/deps/v8/src/inspector/v8-serialization-duplicate-tracker.cc
@@ -0,0 +1,76 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/inspector/v8-serialization-duplicate-tracker.h"
+
+#include "src/base/logging.h"
+#include "v8-external.h"
+
+namespace v8_inspector {
+
+std::unique_ptr<protocol::DictionaryValue>
+V8SerializationDuplicateTracker::LinkExistingOrCreate(
+    v8::Local<v8::Value> v8Value, bool* isKnown) {
+  std::unique_ptr<protocol::DictionaryValue> result =
+      protocol::DictionaryValue::create();
+
+  protocol::DictionaryValue* maybeKnownSerializedValue =
+      FindKnownSerializedValue(v8Value);
+
+  if (maybeKnownSerializedValue == nullptr) {
+    *isKnown = false;
+    // Keep reference to the serialized value, so that
+    // `weakLocalObjectReference` can be set later.
+    SetKnownSerializedValue(v8Value, result.get());
+  } else {
+    *isKnown = true;
+
+    String16 type;
+    maybeKnownSerializedValue->getString("type", &type);
+    result->setString("type", type);
+
+    int weakLocalObjectReference;
+    // If `maybeKnownSerializedValue` has no `weakLocalObjectReference` yet,
+    // it's need to be set.
+    if (!maybeKnownSerializedValue->getInteger("weakLocalObjectReference",
+                                               &weakLocalObjectReference)) {
+      weakLocalObjectReference = m_counter++;
+      maybeKnownSerializedValue->setInteger("weakLocalObjectReference",
+                                            weakLocalObjectReference);
+    }
+    result->setInteger("weakLocalObjectReference", weakLocalObjectReference);
+  }
+
+  return result;
+}
+
+void V8SerializationDuplicateTracker::SetKnownSerializedValue(
+    v8::Local<v8::Value> v8Value, protocol::DictionaryValue* serializedValue) {
+  m_v8ObjectToSerializedDictionary =
+      m_v8ObjectToSerializedDictionary
+          ->Set(m_context, v8Value,
+                v8::External::New(m_context->GetIsolate(), serializedValue))
+          .ToLocalChecked();
+}
+
+protocol::DictionaryValue*
+V8SerializationDuplicateTracker::FindKnownSerializedValue(
+    v8::Local<v8::Value> v8Value) {
+  v8::Local<v8::Value> knownValue;
+  if (!m_v8ObjectToSerializedDictionary->Get(m_context, v8Value)
+           .ToLocal(&knownValue) ||
+      knownValue->IsUndefined()) {
+    return nullptr;
+  }
+
+  return static_cast<protocol::DictionaryValue*>(
+      knownValue.As<v8::External>()->Value());
+}
+
+V8SerializationDuplicateTracker::V8SerializationDuplicateTracker(
+    v8::Local<v8::Context> context)
+    : m_context(context),
+      m_counter(1),
+      m_v8ObjectToSerializedDictionary(v8::Map::New(context->GetIsolate())) {}
+}  // namespace v8_inspector
diff --git a/deps/v8/src/inspector/v8-serialization-duplicate-tracker.h b/deps/v8/src/inspector/v8-serialization-duplicate-tracker.h
new file mode 100644
index 00000000000000..b6036e3ac45ef2
--- /dev/null
+++ b/deps/v8/src/inspector/v8-serialization-duplicate-tracker.h
@@ -0,0 +1,40 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_INSPECTOR_V8_SERIALIZATION_DUPLICATE_TRACKER_H_
+#define V8_INSPECTOR_V8_SERIALIZATION_DUPLICATE_TRACKER_H_
+
+#include "include/v8-container.h"
+#include "src/base/vector.h"
+#include "src/debug/debug-interface.h"
+#include "src/inspector/protocol/Runtime.h"
+
+namespace v8_inspector {
+
+class V8SerializationDuplicateTracker {
+ public:
+  // Returns a `protocol::DictionaryValue` value either empty if the V8 value
+  // was not serialized yet, or filled in as a reference to previousely
+  // serialized protocol value.
+  V8_EXPORT std::unique_ptr<protocol::DictionaryValue> LinkExistingOrCreate(
+      v8::Local<v8::Value> v8Value, bool* isKnown);
+
+  V8_EXPORT explicit V8SerializationDuplicateTracker(
+      v8::Local<v8::Context> context);
+
+ private:
+  v8::Local<v8::Context> m_context;
+  int m_counter;
+  // Maps v8 value to corresponding serialized value.
+  v8::Local<v8::Map> m_v8ObjectToSerializedDictionary;
+
+  V8_EXPORT protocol::DictionaryValue* FindKnownSerializedValue(
+      v8::Local<v8::Value> v8Value);
+
+  V8_EXPORT void SetKnownSerializedValue(
+      v8::Local<v8::Value> v8Value, protocol::DictionaryValue* serializedValue);
+};
+}  // namespace v8_inspector
+
+#endif  // V8_INSPECTOR_V8_SERIALIZATION_DUPLICATE_TRACKER_H_
diff --git a/deps/v8/src/inspector/v8-string-conversions.cc b/deps/v8/src/inspector/v8-string-conversions.cc
index 0c75e66b972274..8cf19be816c240 100644
--- a/deps/v8/src/inspector/v8-string-conversions.cc
+++ b/deps/v8/src/inspector/v8-string-conversions.cc
@@ -12,7 +12,7 @@
 
 namespace v8_inspector {
 namespace {
-using UChar = uint16_t;
+using UChar = char16_t;
 using UChar32 = uint32_t;
 
 bool isASCII(UChar c) { return !(c & ~0x7F); }
@@ -386,7 +386,7 @@ std::string UTF16ToUTF8(const UChar* stringStart, size_t length) {
 
 std::basic_string<UChar> UTF8ToUTF16(const char* stringStart, size_t length) {
   if (!stringStart || !length) return std::basic_string<UChar>();
-  std::vector<uint16_t> buffer(length);
+  std::vector<UChar> buffer(length);
   UChar* bufferStart = buffer.data();
 
   UChar* bufferCurrent = bufferStart;
@@ -395,7 +395,7 @@ std::basic_string<UChar> UTF8ToUTF16(const char* stringStart, size_t length) {
                          reinterpret_cast<const char*>(stringStart + length),
                          &bufferCurrent, bufferCurrent + buffer.size(), nullptr,
                          true) != conversionOK)
-    return std::basic_string<uint16_t>();
+    return std::basic_string<UChar>();
   size_t utf16Length = bufferCurrent - bufferStart;
   return std::basic_string<UChar>(bufferStart, bufferStart + utf16Length);
 }
diff --git a/deps/v8/src/inspector/v8-string-conversions.h b/deps/v8/src/inspector/v8-string-conversions.h
index eb33c6816a5882..0f674f0bc81947 100644
--- a/deps/v8/src/inspector/v8-string-conversions.h
+++ b/deps/v8/src/inspector/v8-string-conversions.h
@@ -5,14 +5,15 @@
 #ifndef V8_INSPECTOR_V8_STRING_CONVERSIONS_H_
 #define V8_INSPECTOR_V8_STRING_CONVERSIONS_H_
 
+
 #include <cstdint>
 #include <string>
 
 // Conversion routines between UT8 and UTF16, used by string-16.{h,cc}. You may
 // want to use string-16.h directly rather than these.
 namespace v8_inspector {
-std::basic_string<uint16_t> UTF8ToUTF16(const char* stringStart, size_t length);
-std::string UTF16ToUTF8(const uint16_t* stringStart, size_t length);
+std::basic_string<char16_t> UTF8ToUTF16(const char* stringStart, size_t length);
+std::string UTF16ToUTF8(const char16_t* stringStart, size_t length);
 }  // namespace v8_inspector
 
 #endif  // V8_INSPECTOR_V8_STRING_CONVERSIONS_H_
diff --git a/deps/v8/src/inspector/v8-webdriver-serializer.cc b/deps/v8/src/inspector/v8-webdriver-serializer.cc
deleted file mode 100644
index bf68a4cdb30b5d..00000000000000
--- a/deps/v8/src/inspector/v8-webdriver-serializer.cc
+++ /dev/null
@@ -1,332 +0,0 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/inspector/v8-webdriver-serializer.h"
-
-#include "include/v8-container.h"
-#include "include/v8-context.h"
-#include "include/v8-date.h"
-#include "include/v8-exception.h"
-#include "include/v8-regexp.h"
-#include "src/inspector/protocol/Forward.h"
-#include "src/inspector/value-mirror.h"
-
-namespace v8_inspector {
-
-namespace {
-using protocol::Response;
-std::unique_ptr<protocol::Value> SerializeRecursively(
-    v8::Local<v8::Value> value, v8::Local<v8::Context> context, int max_depth) {
-  std::unique_ptr<ValueMirror> mirror = ValueMirror::create(context, value);
-  std::unique_ptr<protocol::Runtime::WebDriverValue> web_driver_value =
-      mirror->buildWebDriverValue(context, max_depth - 1);
-  DCHECK(web_driver_value);
-
-  std::unique_ptr<protocol::DictionaryValue> result_dict =
-      protocol::DictionaryValue::create();
-
-  result_dict->setValue(
-      protocol::String("type"),
-      protocol::StringValue::create(web_driver_value->getType()));
-  if (web_driver_value->hasValue()) {
-    result_dict->setValue(protocol::String("value"),
-                          web_driver_value->getValue(nullptr)->clone());
-  }
-  return result_dict;
-}
-
-std::unique_ptr<protocol::Value> DescriptionForDate(
-    v8::Local<v8::Context> context, v8::Local<v8::Date> date) {
-  v8::Isolate* isolate = context->GetIsolate();
-  v8::TryCatch tryCatch(isolate);
-
-  v8::Local<v8::String> dateISOString = date->ToISOString();
-  return protocol::StringValue::create(
-      toProtocolString(isolate, dateISOString));
-}
-
-String16 _descriptionForRegExpFlags(v8::Local<v8::RegExp> value) {
-  String16Builder result_string_builder;
-  v8::RegExp::Flags flags = value->GetFlags();
-  if (flags & v8::RegExp::Flags::kHasIndices) result_string_builder.append('d');
-  if (flags & v8::RegExp::Flags::kGlobal) result_string_builder.append('g');
-  if (flags & v8::RegExp::Flags::kIgnoreCase) result_string_builder.append('i');
-  if (flags & v8::RegExp::Flags::kLinear) result_string_builder.append('l');
-  if (flags & v8::RegExp::Flags::kMultiline) result_string_builder.append('m');
-  if (flags & v8::RegExp::Flags::kDotAll) result_string_builder.append('s');
-  if (flags & v8::RegExp::Flags::kUnicode) result_string_builder.append('u');
-  if (flags & v8::RegExp::Flags::kUnicodeSets) {
-    result_string_builder.append('v');
-  }
-  if (flags & v8::RegExp::Flags::kSticky) result_string_builder.append('y');
-  return result_string_builder.toString();
-}
-
-std::unique_ptr<protocol::Runtime::WebDriverValue> SerializeRegexp(
-    v8::Local<v8::RegExp> value, v8::Local<v8::Context> context) {
-  std::unique_ptr<protocol::Runtime::WebDriverValue> result =
-      protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Regexp)
-          .build();
-
-  std::unique_ptr<protocol::DictionaryValue> result_value =
-      protocol::DictionaryValue::create();
-
-  result_value->setValue(protocol::String("pattern"),
-                         protocol::StringValue::create(toProtocolString(
-                             context->GetIsolate(), value->GetSource())));
-
-  String16 flags = _descriptionForRegExpFlags(value);
-  if (!flags.isEmpty()) {
-    result_value->setValue(protocol::String("flags"),
-                           protocol::StringValue::create(flags));
-  }
-  result->setValue(std::move(result_value));
-  return result;
-}
-
-std::unique_ptr<protocol::Runtime::WebDriverValue> SerializeDate(
-    v8::Local<v8::Date> value, v8::Local<v8::Context> context) {
-  std::unique_ptr<protocol::Runtime::WebDriverValue> result =
-      protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Date)
-          .build();
-
-  std::unique_ptr<protocol::Value> date_description =
-      DescriptionForDate(context, value.As<v8::Date>());
-
-  result->setValue(std::move(date_description));
-  return result;
-}
-
-std::unique_ptr<protocol::Value> SerializeArrayValue(
-    v8::Local<v8::Array> value, v8::Local<v8::Context> context, int max_depth) {
-  std::unique_ptr<protocol::ListValue> result = protocol::ListValue::create();
-  uint32_t length = value->Length();
-  result->reserve(length);
-  for (uint32_t i = 0; i < length; i++) {
-    v8::Local<v8::Value> element_value;
-    bool success = value->Get(context, i).ToLocal(&element_value);
-    DCHECK(success);
-    USE(success);
-
-    std::unique_ptr<protocol::Value> element_protocol_value =
-        SerializeRecursively(element_value, context, max_depth);
-
-    result->pushValue(std::move(element_protocol_value));
-  }
-  return result;
-}
-
-std::unique_ptr<protocol::Runtime::WebDriverValue> SerializeArray(
-    v8::Local<v8::Array> value, v8::Local<v8::Context> context, int max_depth) {
-  std::unique_ptr<protocol::Runtime::WebDriverValue> result =
-      protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Array)
-          .build();
-  if (max_depth > 0) {
-    result->setValue(SerializeArrayValue(value, context, max_depth));
-  }
-
-  return result;
-}
-
-std::unique_ptr<protocol::Runtime::WebDriverValue> SerializeMap(
-    v8::Local<v8::Map> value, v8::Local<v8::Context> context, int max_depth) {
-  std::unique_ptr<protocol::Runtime::WebDriverValue> result =
-      protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Map)
-          .build();
-
-  if (max_depth > 0) {
-    std::unique_ptr<protocol::ListValue> result_value =
-        protocol::ListValue::create();
-
-    v8::Local<v8::Array> properties_and_values = value->AsArray();
-
-    uint32_t length = properties_and_values->Length();
-    result_value->reserve(length);
-    for (uint32_t i = 0; i < length; i += 2) {
-      v8::Local<v8::Value> key_value, property_value;
-      std::unique_ptr<protocol::Value> key_protocol_value,
-          property_protocol_value;
-
-      bool success = properties_and_values->Get(context, i).ToLocal(&key_value);
-      DCHECK(success);
-      success =
-          properties_and_values->Get(context, i + 1).ToLocal(&property_value);
-      DCHECK(success);
-      USE(success);
-
-      if (key_value->IsString()) {
-        key_protocol_value = protocol::StringValue::create(toProtocolString(
-            context->GetIsolate(), key_value.As<v8::String>()));
-      } else {
-        key_protocol_value =
-            SerializeRecursively(key_value, context, max_depth);
-      }
-
-      property_protocol_value =
-          SerializeRecursively(property_value, context, max_depth);
-
-      std::unique_ptr<protocol::ListValue> key_value_list =
-          protocol::ListValue::create();
-
-      key_value_list->pushValue(std::move(key_protocol_value));
-      key_value_list->pushValue(std::move(property_protocol_value));
-
-      result_value->pushValue(std::move(key_value_list));
-    }
-    result->setValue(std::move(result_value));
-  }
-
-  return result;
-}
-
-std::unique_ptr<protocol::Runtime::WebDriverValue> SerializeSet(
-    v8::Local<v8::Set> value, v8::Local<v8::Context> context, int max_depth) {
-  std::unique_ptr<protocol::Runtime::WebDriverValue> result =
-      protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Set)
-          .build();
-
-  if (max_depth > 0) {
-    result->setValue(SerializeArrayValue(value->AsArray(), context, max_depth));
-  }
-  return result;
-}
-
-std::unique_ptr<protocol::Value> SerializeObjectValue(
-    v8::Local<v8::Object> value, v8::Local<v8::Context> context,
-    int max_depth) {
-  std::unique_ptr<protocol::ListValue> result = protocol::ListValue::create();
-  // Iterate through object's properties.
-  v8::Local<v8::Array> property_names;
-  bool success = value->GetOwnPropertyNames(context).ToLocal(&property_names);
-  DCHECK(success);
-
-  uint32_t length = property_names->Length();
-  result->reserve(length);
-  for (uint32_t i = 0; i < length; i++) {
-    v8::Local<v8::Value> key_value, property_value;
-    std::unique_ptr<protocol::Value> key_protocol_value,
-        property_protocol_value;
-
-    success = property_names->Get(context, i).ToLocal(&key_value);
-    DCHECK(success);
-
-    if (key_value->IsString()) {
-      v8::Maybe<bool> hasRealNamedProperty =
-          value->HasRealNamedProperty(context, key_value.As<v8::String>());
-      // Don't access properties with interceptors.
-      if (hasRealNamedProperty.IsNothing() ||
-          !hasRealNamedProperty.FromJust()) {
-        continue;
-      }
-      key_protocol_value = protocol::StringValue::create(
-          toProtocolString(context->GetIsolate(), key_value.As<v8::String>()));
-    } else {
-      key_protocol_value = SerializeRecursively(key_value, context, max_depth);
-    }
-
-    success = value->Get(context, key_value).ToLocal(&property_value);
-    DCHECK(success);
-    USE(success);
-
-    property_protocol_value =
-        SerializeRecursively(property_value, context, max_depth);
-
-    std::unique_ptr<protocol::ListValue> key_value_list =
-        protocol::ListValue::create();
-
-    key_value_list->pushValue(std::move(key_protocol_value));
-    key_value_list->pushValue(std::move(property_protocol_value));
-
-    result->pushValue(std::move(key_value_list));
-  }
-
-  return result;
-}
-
-std::unique_ptr<protocol::Runtime::WebDriverValue> SerializeObject(
-    v8::Local<v8::Object> value, v8::Local<v8::Context> context,
-    int max_depth) {
-  std::unique_ptr<protocol::Runtime::WebDriverValue> result =
-      protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Object)
-          .build();
-
-  if (max_depth > 0) {
-    result->setValue(
-        SerializeObjectValue(value.As<v8::Object>(), context, max_depth));
-  }
-  return result;
-}
-}  // namespace
-
-std::unique_ptr<protocol::Runtime::WebDriverValue>
-V8WebDriverSerializer::serializeV8Value(v8::Local<v8::Object> value,
-                                        v8::Local<v8::Context> context,
-                                        int max_depth) {
-  if (value->IsArray()) {
-    return SerializeArray(value.As<v8::Array>(), context, max_depth);
-  }
-  if (value->IsRegExp()) {
-    return SerializeRegexp(value.As<v8::RegExp>(), context);
-  }
-  if (value->IsDate()) {
-    return SerializeDate(value.As<v8::Date>(), context);
-  }
-  if (value->IsMap()) {
-    return SerializeMap(value.As<v8::Map>(), context, max_depth);
-  }
-  if (value->IsSet()) {
-    return SerializeSet(value.As<v8::Set>(), context, max_depth);
-  }
-  if (value->IsWeakMap()) {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Weakmap)
-        .build();
-  }
-  if (value->IsWeakSet()) {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Weakset)
-        .build();
-  }
-  if (value->IsNativeError()) {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Error)
-        .build();
-  }
-  if (value->IsProxy()) {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Proxy)
-        .build();
-  }
-  if (value->IsPromise()) {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Promise)
-        .build();
-  }
-  if (value->IsTypedArray()) {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Typedarray)
-        .build();
-  }
-  if (value->IsArrayBuffer()) {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Arraybuffer)
-        .build();
-  }
-  if (value->IsFunction()) {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Function)
-        .build();
-  }
-
-  // Serialize as an Object.
-  return SerializeObject(value.As<v8::Object>(), context, max_depth);
-}
-
-}  // namespace v8_inspector
diff --git a/deps/v8/src/inspector/v8-webdriver-serializer.h b/deps/v8/src/inspector/v8-webdriver-serializer.h
deleted file mode 100644
index 1a9c2396a239ed..00000000000000
--- a/deps/v8/src/inspector/v8-webdriver-serializer.h
+++ /dev/null
@@ -1,24 +0,0 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_INSPECTOR_V8_WEBDRIVER_SERIALIZER_H_
-#define V8_INSPECTOR_V8_WEBDRIVER_SERIALIZER_H_
-
-#include "include/v8-container.h"
-#include "include/v8-context.h"
-#include "include/v8-exception.h"
-#include "include/v8-regexp.h"
-#include "src/inspector/protocol/Runtime.h"
-#include "src/inspector/v8-value-utils.h"
-
-namespace v8_inspector {
-class V8WebDriverSerializer {
- public:
-  static std::unique_ptr<protocol::Runtime::WebDriverValue> serializeV8Value(
-      v8::Local<v8::Object> value, v8::Local<v8::Context> context,
-      int max_depth);
-};
-}  // namespace v8_inspector
-
-#endif  // V8_INSPECTOR_V8_WEBDRIVER_SERIALIZER_H_
diff --git a/deps/v8/src/inspector/value-mirror.cc b/deps/v8/src/inspector/value-mirror.cc
index 37db97e2c57dcf..0c282a689df758 100644
--- a/deps/v8/src/inspector/value-mirror.cc
+++ b/deps/v8/src/inspector/value-mirror.cc
@@ -19,9 +19,10 @@
 #include "src/base/optional.h"
 #include "src/debug/debug-interface.h"
 #include "src/inspector/v8-debugger.h"
+#include "src/inspector/v8-deep-serializer.h"
 #include "src/inspector/v8-inspector-impl.h"
+#include "src/inspector/v8-serialization-duplicate-tracker.h"
 #include "src/inspector/v8-value-utils.h"
-#include "src/inspector/v8-webdriver-serializer.h"
 
 namespace v8_inspector {
 
@@ -31,6 +32,13 @@ using protocol::Runtime::ObjectPreview;
 using protocol::Runtime::PropertyPreview;
 using protocol::Runtime::RemoteObject;
 
+#if defined(V8_USE_ADDRESS_SANITIZER) && V8_OS_DARWIN
+// For whatever reason, ASan on MacOS has bigger stack frames.
+static const int kMaxProtocolDepth = 900;
+#else
+static const int kMaxProtocolDepth = 1000;
+#endif
+
 Response toProtocolValue(v8::Local<v8::Context> context,
                          v8::Local<v8::Value> value, int maxDepth,
                          std::unique_ptr<protocol::Value>* result);
@@ -154,13 +162,7 @@ Response toProtocolValue(v8::Local<v8::Context> context,
                          v8::Local<v8::Value> value,
                          std::unique_ptr<protocol::Value>* result) {
   if (value->IsUndefined()) return Response::Success();
-#if defined(V8_USE_ADDRESS_SANITIZER) && V8_OS_DARWIN
-  // For whatever reason, ASan on MacOS has bigger stack frames.
-  static const int kMaxDepth = 900;
-#else
-  static const int kMaxDepth = 1000;
-#endif
-  return toProtocolValue(context, value, kMaxDepth, result);
+  return toProtocolValue(context, value, kMaxProtocolDepth, result);
 }
 
 namespace {
@@ -428,7 +430,7 @@ class PrimitiveValueMirror final : public ValueMirror {
 
   v8::Local<v8::Value> v8Value() const override { return m_value; }
   Response buildRemoteObject(
-      v8::Local<v8::Context> context, WrapMode mode,
+      v8::Local<v8::Context> context, const WrapOptions& wrapOptions,
       std::unique_ptr<RemoteObject>* result) const override {
     std::unique_ptr<protocol::Value> protocolValue;
     toProtocolValue(context, m_value, &protocolValue);
@@ -468,40 +470,49 @@ class PrimitiveValueMirror final : public ValueMirror {
       (*preview)->setSubtype(RemoteObject::SubtypeEnum::Null);
   }
 
-  std::unique_ptr<protocol::Runtime::WebDriverValue> buildWebDriverValue(
-      v8::Local<v8::Context> context, int max_depth) const override {
-    // https://w3c.github.io/webdriver-bidi/#data-types-protocolValue-primitiveProtocolValue-serialization
-
+  Response buildDeepSerializedValue(
+      v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      std::unique_ptr<protocol::DictionaryValue>* result) const override {
     if (m_value->IsUndefined()) {
-      return protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Undefined)
-          .build();
+      *result = protocol::DictionaryValue::create();
+      (*result)->setString(
+          "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Undefined);
+      return Response::Success();
     }
     if (m_value->IsNull()) {
-      return protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Null)
-          .build();
+      *result = protocol::DictionaryValue::create();
+      (*result)->setString(
+          "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Null);
+      return Response::Success();
     }
     if (m_value->IsString()) {
-      return protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::String)
-          .setValue(protocol::StringValue::create(toProtocolString(
-              context->GetIsolate(), m_value.As<v8::String>())))
-          .build();
+      *result = protocol::DictionaryValue::create();
+      (*result)->setString(
+          "type", protocol::Runtime::DeepSerializedValue::TypeEnum::String);
+      (*result)->setString("value", toProtocolString(context->GetIsolate(),
+                                                     m_value.As<v8::String>()));
+      return Response::Success();
     }
     if (m_value->IsBoolean()) {
-      return protocol::Runtime::WebDriverValue::create()
-          .setType(protocol::Runtime::WebDriverValue::TypeEnum::Boolean)
-          .setValue(protocol::FundamentalValue::create(
-              m_value.As<v8::Boolean>()->Value()))
-          .build();
+      *result = protocol::DictionaryValue::create();
+      (*result)->setString(
+          "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Boolean);
+      (*result)->setBoolean("value", m_value.As<v8::Boolean>()->Value());
+      return Response::Success();
     }
 
-    DCHECK(false);
-    // Fallback.
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Object)
-        .build();
+    // Fallback in case of unexpected type.
+    bool isKnown;
+    *result = duplicateTracker.LinkExistingOrCreate(m_value, &isKnown);
+    if (isKnown) {
+      return Response::Success();
+    }
+
+    (*result)->setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Object);
+    return Response::Success();
   }
 
  private:
@@ -516,7 +527,7 @@ class NumberMirror final : public ValueMirror {
   v8::Local<v8::Value> v8Value() const override { return m_value; }
 
   Response buildRemoteObject(
-      v8::Local<v8::Context> context, WrapMode mode,
+      v8::Local<v8::Context> context, const WrapOptions& wrapOptions,
       std::unique_ptr<RemoteObject>* result) const override {
     bool unserializable = false;
     String16 descriptionValue = description(&unserializable);
@@ -554,21 +565,25 @@ class NumberMirror final : public ValueMirror {
             .build();
   }
 
-  std::unique_ptr<protocol::Runtime::WebDriverValue> buildWebDriverValue(
-      v8::Local<v8::Context> context, int max_depth) const override {
-    // https://w3c.github.io/webdriver-bidi/#data-types-protocolValue-primitiveProtocolValue-serialization
-    std::unique_ptr<protocol::Runtime::WebDriverValue> result =
-        protocol::Runtime::WebDriverValue::create()
-            .setType(protocol::Runtime::WebDriverValue::TypeEnum::Number)
-            .build();
+  Response buildDeepSerializedValue(
+      v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      std::unique_ptr<protocol::DictionaryValue>* result) const override {
+    *result = protocol::DictionaryValue::create();
+    (*result)->setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Number);
+
     bool unserializable = false;
     String16 descriptionValue = description(&unserializable);
     if (unserializable) {
-      result->setValue(protocol::StringValue::create(descriptionValue));
+      (*result)->setValue("value",
+                          protocol::StringValue::create(descriptionValue));
     } else {
-      result->setValue(toProtocolValue(m_value.As<v8::Number>()->Value()));
+      (*result)->setValue("value",
+                          toProtocolValue(m_value.As<v8::Number>()->Value()));
     }
-    return result;
+    return Response::Success();
   }
 
  private:
@@ -592,7 +607,7 @@ class BigIntMirror final : public ValueMirror {
   explicit BigIntMirror(v8::Local<v8::BigInt> value) : m_value(value) {}
 
   Response buildRemoteObject(
-      v8::Local<v8::Context> context, WrapMode mode,
+      v8::Local<v8::Context> context, const WrapOptions& wrapOptions,
       std::unique_ptr<RemoteObject>* result) const override {
     String16 description = descriptionForBigInt(context, m_value);
     *result = RemoteObject::create()
@@ -631,18 +646,21 @@ class BigIntMirror final : public ValueMirror {
 
   v8::Local<v8::Value> v8Value() const override { return m_value; }
 
-  std::unique_ptr<protocol::Runtime::WebDriverValue> buildWebDriverValue(
-      v8::Local<v8::Context> context, int max_depth) const override {
-    // https://w3c.github.io/webdriver-bidi/#data-types-protocolValue-primitiveProtocolValue-serialization
-
-    v8::Local<v8::String> string_value =
+  Response buildDeepSerializedValue(
+      v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      std::unique_ptr<protocol::DictionaryValue>* result) const override {
+    v8::Local<v8::String> stringValue =
         v8::debug::GetBigIntStringValue(context->GetIsolate(), m_value);
 
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Bigint)
-        .setValue(protocol::StringValue::create(
-            toProtocolString(context->GetIsolate(), string_value)))
-        .build();
+    *result = protocol::DictionaryValue::create();
+    (*result)->setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Bigint);
+
+    (*result)->setValue("value", protocol::StringValue::create(toProtocolString(
+                                     context->GetIsolate(), stringValue)));
+    return Response::Success();
   }
 
  private:
@@ -655,9 +673,9 @@ class SymbolMirror final : public ValueMirror {
       : m_symbol(value.As<v8::Symbol>()) {}
 
   Response buildRemoteObject(
-      v8::Local<v8::Context> context, WrapMode mode,
+      v8::Local<v8::Context> context, const WrapOptions& wrapOptions,
       std::unique_ptr<RemoteObject>* result) const override {
-    if (mode == WrapMode::kForceValue) {
+    if (wrapOptions.mode == WrapMode::kJson) {
       return Response::ServerError("Object couldn't be returned by value");
     }
     *result = RemoteObject::create()
@@ -693,12 +711,20 @@ class SymbolMirror final : public ValueMirror {
 
   v8::Local<v8::Value> v8Value() const override { return m_symbol; }
 
-  std::unique_ptr<protocol::Runtime::WebDriverValue> buildWebDriverValue(
-      v8::Local<v8::Context> context, int max_depth) const override {
-    // https://w3c.github.io/webdriver-bidi/#data-types-protocolValue-RemoteValue-serialization
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Symbol)
-        .build();
+  Response buildDeepSerializedValue(
+      v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      std::unique_ptr<protocol::DictionaryValue>* result) const override {
+    bool isKnown;
+    *result = duplicateTracker.LinkExistingOrCreate(m_symbol, &isKnown);
+    if (isKnown) {
+      return Response::Success();
+    }
+
+    (*result)->setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Symbol);
+    return Response::Success();
   }
 
  private:
@@ -729,7 +755,7 @@ class LocationMirror final : public ValueMirror {
   }
 
   Response buildRemoteObject(
-      v8::Local<v8::Context> context, WrapMode mode,
+      v8::Local<v8::Context> context, const WrapOptions& wrapOptions,
       std::unique_ptr<RemoteObject>* result) const override {
     auto location = protocol::DictionaryValue::create();
     location->setString("scriptId", String16::fromInteger(m_scriptId));
@@ -745,11 +771,20 @@ class LocationMirror final : public ValueMirror {
   }
   v8::Local<v8::Value> v8Value() const override { return m_value; }
 
-  std::unique_ptr<protocol::Runtime::WebDriverValue> buildWebDriverValue(
-      v8::Local<v8::Context> context, int max_depth) const override {
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Object)
-        .build();
+  Response buildDeepSerializedValue(
+      v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      std::unique_ptr<protocol::DictionaryValue>* result) const override {
+    bool isKnown;
+    *result = duplicateTracker.LinkExistingOrCreate(m_value, &isKnown);
+    if (isKnown) {
+      return Response::Success();
+    }
+
+    (*result)->setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Object);
+    return Response::Success();
   }
 
  private:
@@ -786,10 +821,10 @@ class FunctionMirror final : public ValueMirror {
   v8::Local<v8::Value> v8Value() const override { return m_value; }
 
   Response buildRemoteObject(
-      v8::Local<v8::Context> context, WrapMode mode,
+      v8::Local<v8::Context> context, const WrapOptions& wrapOptions,
       std::unique_ptr<RemoteObject>* result) const override {
     // TODO(alph): drop this functionality.
-    if (mode == WrapMode::kForceValue) {
+    if (wrapOptions.mode == WrapMode::kJson) {
       std::unique_ptr<protocol::Value> protocolValue;
       Response response = toProtocolValue(context, m_value, &protocolValue);
       if (!response.IsSuccess()) return response;
@@ -829,12 +864,20 @@ class FunctionMirror final : public ValueMirror {
             .build();
   }
 
-  std::unique_ptr<protocol::Runtime::WebDriverValue> buildWebDriverValue(
-      v8::Local<v8::Context> context, int max_depth) const override {
-    // https://w3c.github.io/webdriver-bidi/#data-types-protocolValue-RemoteValue-serialization
-    return protocol::Runtime::WebDriverValue::create()
-        .setType(protocol::Runtime::WebDriverValue::TypeEnum::Function)
-        .build();
+  Response buildDeepSerializedValue(
+      v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      std::unique_ptr<protocol::DictionaryValue>* result) const override {
+    bool isKnown;
+    *result = duplicateTracker.LinkExistingOrCreate(m_value, &isKnown);
+    if (isKnown) {
+      return Response::Success();
+    }
+
+    (*result)->setString(
+        "type", protocol::Runtime::DeepSerializedValue::TypeEnum::Function);
+    return Response::Success();
   }
 
  private:
@@ -1062,9 +1105,9 @@ class ObjectMirror final : public ValueMirror {
   v8::Local<v8::Value> v8Value() const override { return m_value; }
 
   Response buildRemoteObject(
-      v8::Local<v8::Context> context, WrapMode mode,
+      v8::Local<v8::Context> context, const WrapOptions& wrapOptions,
       std::unique_ptr<RemoteObject>* result) const override {
-    if (mode == WrapMode::kForceValue) {
+    if (wrapOptions.mode == WrapMode::kJson) {
       std::unique_ptr<protocol::Value> protocolValue;
       Response response = toProtocolValue(context, m_value, &protocolValue);
       if (!response.IsSuccess()) return response;
@@ -1081,7 +1124,7 @@ class ObjectMirror final : public ValueMirror {
                     .setDescription(m_description)
                     .build();
       if (m_hasSubtype) (*result)->setSubtype(m_subtype);
-      if (mode == WrapMode::kWithPreview) {
+      if (wrapOptions.mode == WrapMode::kPreview) {
         std::unique_ptr<ObjectPreview> previewValue;
         int nameLimit = 5;
         int indexLimit = 100;
@@ -1124,34 +1167,69 @@ class ObjectMirror final : public ValueMirror {
     if (m_hasSubtype) (*result)->setSubtype(m_subtype);
   }
 
-  std::unique_ptr<protocol::Runtime::WebDriverValue> buildWebDriverValue(
-      v8::Local<v8::Context> context, int max_depth) const override {
-    // https://w3c.github.io/webdriver-bidi/#data-types-protocolValue-RemoteValue-serialization
+  Response buildDeepSerializedValue(
+      v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      std::unique_ptr<protocol::DictionaryValue>* result) const override {
+    maxDepth = std::min(kMaxProtocolDepth, maxDepth);
+    bool isKnown;
+    *result = duplicateTracker.LinkExistingOrCreate(m_value, &isKnown);
+    if (isKnown) {
+      return Response::Success();
+    }
 
     // Check if embedder implemented custom serialization.
-    std::unique_ptr<v8_inspector::WebDriverValue> embedder_serialized_result =
-        clientFor(context)->serializeToWebDriverValue(m_value, max_depth);
-
-    if (embedder_serialized_result) {
+    std::unique_ptr<v8_inspector::DeepSerializationResult>
+        embedderDeepSerializedResult = clientFor(context)->deepSerialize(
+            m_value, maxDepth, additionalParameters);
+    if (embedderDeepSerializedResult) {
       // Embedder-implemented serialization.
-      std::unique_ptr<protocol::Runtime::WebDriverValue> result =
-          protocol::Runtime::WebDriverValue::create()
-              .setType(toString16(embedder_serialized_result->type->string()))
-              .build();
 
-      v8::Local<v8::Value> v8_value;
-      if (embedder_serialized_result->value.ToLocal(&v8_value)) {
+      if (!embedderDeepSerializedResult->isSuccess)
+        return Response::ServerError(
+            toString16(embedderDeepSerializedResult->errorMessage->string())
+                .utf8());
+
+      (*result)->setString(
+          "type",
+          toString16(
+              embedderDeepSerializedResult->serializedValue->type->string()));
+      v8::Local<v8::Value> v8Value;
+      if (embedderDeepSerializedResult->serializedValue->value.ToLocal(
+              &v8Value)) {
+        // Embedder-implemented serialization has value.
+        std::unique_ptr<protocol::Value> protocolValue;
+        Response response = toProtocolValue(context, v8Value, &protocolValue);
+        if (!response.IsSuccess()) return response;
+        (*result)->setValue("value", std::move(protocolValue));
+      }
+      return Response::Success();
+    }
+
+    // TODO(crbug.com/1420968): remove as deprecated.
+    std::unique_ptr<v8_inspector::WebDriverValue> embedderWebDriverValue =
+        clientFor(context)->serializeToWebDriverValue(m_value, 0);
+
+    if (embedderWebDriverValue) {
+      // Embedder-implemented serialization.
+      (*result)->setString("type",
+                           toString16(embedderWebDriverValue->type->string()));
+      v8::Local<v8::Value> v8Value;
+      if (embedderWebDriverValue->value.ToLocal(&v8Value)) {
         // Embedder-implemented serialization has value.
-        std::unique_ptr<protocol::Value> protocol_value;
-        Response response = toProtocolValue(context, v8_value, &protocol_value);
-        DCHECK(response.IsSuccess());
-        result->setValue(std::move(protocol_value));
+        std::unique_ptr<protocol::Value> protocolValue;
+        Response response = toProtocolValue(context, v8Value, &protocolValue);
+        if (!response.IsSuccess()) return response;
+        (*result)->setValue("value", std::move(protocolValue));
       }
-      return result;
+      return Response::Success();
     }
 
     // No embedder-implemented serialization. Serialize as V8 Object.
-    return V8WebDriverSerializer::serializeV8Value(m_value, context, max_depth);
+    return V8DeepSerializer::serializeV8Value(
+        m_value, context, maxDepth, additionalParameters, duplicateTracker,
+        *(result->get()));
   }
 
  private:
diff --git a/deps/v8/src/inspector/value-mirror.h b/deps/v8/src/inspector/value-mirror.h
index 71555680ad9dbb..65f70308eecfa4 100644
--- a/deps/v8/src/inspector/value-mirror.h
+++ b/deps/v8/src/inspector/value-mirror.h
@@ -13,11 +13,12 @@
 #include "src/inspector/protocol/Protocol.h"
 #include "src/inspector/protocol/Runtime.h"
 #include "src/inspector/string-16.h"
+#include "src/inspector/v8-debugger.h"
+#include "src/inspector/v8-deep-serializer.h"
 
 namespace v8_inspector {
 
 class ValueMirror;
-enum class WrapMode;
 
 struct PrivatePropertyMirror {
   String16 name;
@@ -53,7 +54,7 @@ class ValueMirror {
   static std::unique_ptr<ValueMirror> create(v8::Local<v8::Context> context,
                                              v8::Local<v8::Value> value);
   virtual protocol::Response buildRemoteObject(
-      v8::Local<v8::Context> context, WrapMode mode,
+      v8::Local<v8::Context> context, const WrapOptions& wrapOptions,
       std::unique_ptr<protocol::Runtime::RemoteObject>* result) const = 0;
   virtual void buildPropertyPreview(
       v8::Local<v8::Context> context, const String16& name,
@@ -66,8 +67,12 @@ class ValueMirror {
       v8::Local<v8::Context> context, int* nameLimit, int* indexLimit,
       std::unique_ptr<protocol::Runtime::ObjectPreview>*) const {}
   virtual v8::Local<v8::Value> v8Value() const = 0;
-  virtual std::unique_ptr<protocol::Runtime::WebDriverValue>
-  buildWebDriverValue(v8::Local<v8::Context> context, int max_depth) const = 0;
+  // https://goo.gle/browser-automation-deepserialization
+  virtual Response buildDeepSerializedValue(
+      v8::Local<v8::Context> context, int maxDepth,
+      v8::Local<v8::Object> additionalParameters,
+      V8SerializationDuplicateTracker& duplicateTracker,
+      std::unique_ptr<protocol::DictionaryValue>* result) const = 0;
 
   class PropertyAccumulator {
    public:
diff --git a/deps/v8/src/interpreter/bytecode-array-builder.cc b/deps/v8/src/interpreter/bytecode-array-builder.cc
index 7bf855afb8f8a4..573007d5cf2876 100644
--- a/deps/v8/src/interpreter/bytecode-array-builder.cc
+++ b/deps/v8/src/interpreter/bytecode-array-builder.cc
@@ -108,7 +108,7 @@ template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
         LocalIsolate* isolate);
 
 #ifdef DEBUG
-int BytecodeArrayBuilder::CheckBytecodeMatches(BytecodeArray bytecode) {
+int BytecodeArrayBuilder::CheckBytecodeMatches(Tagged<BytecodeArray> bytecode) {
   DisallowGarbageCollection no_gc;
   return bytecode_array_writer_.CheckBytecodeMatches(bytecode);
 }
@@ -438,7 +438,7 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::BinaryOperation(Token::Value op,
 }
 
 BytecodeArrayBuilder& BytecodeArrayBuilder::BinaryOperationSmiLiteral(
-    Token::Value op, Smi literal, int feedback_slot) {
+    Token::Value op, Tagged<Smi> literal, int feedback_slot) {
   switch (op) {
     case Token::Value::ADD:
       OutputAddSmi(literal.value(), feedback_slot);
@@ -614,7 +614,7 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::LoadConstantPoolEntry(
   return *this;
 }
 
-BytecodeArrayBuilder& BytecodeArrayBuilder::LoadLiteral(Smi smi) {
+BytecodeArrayBuilder& BytecodeArrayBuilder::LoadLiteral(Tagged<Smi> smi) {
   int32_t raw_smi = smi.value();
   if (raw_smi == 0) {
     OutputLdaZero();
@@ -1075,8 +1075,8 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::ToObject(Register out) {
   return *this;
 }
 
-BytecodeArrayBuilder& BytecodeArrayBuilder::ToName(Register out) {
-  OutputToName(out);
+BytecodeArrayBuilder& BytecodeArrayBuilder::ToName() {
+  OutputToName();
   return *this;
 }
 
@@ -1085,6 +1085,17 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::ToString() {
   return *this;
 }
 
+BytecodeArrayBuilder& BytecodeArrayBuilder::ToBoolean(ToBooleanMode mode) {
+  if (mode == ToBooleanMode::kAlreadyBoolean) {
+    // No-op, the accumulator is already a boolean and ToBoolean both reads and
+    // writes the accumulator.
+  } else {
+    DCHECK_EQ(mode, ToBooleanMode::kConvertToBoolean);
+    OutputToBoolean();
+  }
+  return *this;
+}
+
 BytecodeArrayBuilder& BytecodeArrayBuilder::ToNumber(int feedback_slot) {
   OutputToNumber(feedback_slot);
   return *this;
@@ -1102,7 +1113,10 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::Bind(BytecodeLabel* label) {
 
   // Flush the register optimizer when binding a label to ensure all
   // expected registers are valid when jumping to this label.
-  if (register_optimizer_) register_optimizer_->Flush();
+  if (register_optimizer_) {
+    register_optimizer_->Flush();
+    register_optimizer_->ResetTypeHintForAccumulator();
+  }
   bytecode_array_writer_.BindLabel(label);
   return *this;
 }
@@ -1111,7 +1125,10 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::Bind(
     BytecodeLoopHeader* loop_header) {
   // Flush the register optimizer when starting a loop to ensure all expected
   // registers are valid when jumping to the loop header.
-  if (register_optimizer_) register_optimizer_->Flush();
+  if (register_optimizer_) {
+    register_optimizer_->Flush();
+    register_optimizer_->ResetTypeHintForAccumulator();
+  }
   bytecode_array_writer_.BindLoopHeader(loop_header);
   return *this;
 }
@@ -1120,7 +1137,10 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::Bind(BytecodeJumpTable* jump_table,
                                                  int case_value) {
   // Flush the register optimizer when binding a jump table entry to ensure
   // all expected registers are valid when jumping to this location.
-  if (register_optimizer_) register_optimizer_->Flush();
+  if (register_optimizer_) {
+    register_optimizer_->Flush();
+    register_optimizer_->ResetTypeHintForAccumulator();
+  }
   bytecode_array_writer_.BindJumpTableEntry(jump_table, case_value);
   return *this;
 }
@@ -1131,6 +1151,8 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::MarkHandler(
   // let control fall through into it.
   DCHECK_IMPLIES(register_optimizer_,
                  register_optimizer_->EnsureAllRegistersAreFlushed());
+  DCHECK_IMPLIES(register_optimizer_,
+                 register_optimizer_->IsAccumulatorReset());
   bytecode_array_writer_.BindHandlerTarget(handler_table_builder(), handler_id);
   handler_table_builder()->SetPrediction(handler_id, catch_prediction);
   return *this;
@@ -1148,6 +1170,9 @@ BytecodeArrayBuilder& BytecodeArrayBuilder::MarkTryBegin(int handler_id,
 }
 
 BytecodeArrayBuilder& BytecodeArrayBuilder::MarkTryEnd(int handler_id) {
+  if (register_optimizer_) {
+    register_optimizer_->ResetTypeHintForAccumulator();
+  }
   bytecode_array_writer_.BindTryRegionEnd(handler_table_builder(), handler_id);
   return *this;
 }
diff --git a/deps/v8/src/interpreter/bytecode-array-builder.h b/deps/v8/src/interpreter/bytecode-array-builder.h
index cf75af42732405..b24467380a7566 100644
--- a/deps/v8/src/interpreter/bytecode-array-builder.h
+++ b/deps/v8/src/interpreter/bytecode-array-builder.h
@@ -52,7 +52,7 @@ class V8_EXPORT_PRIVATE BytecodeArrayBuilder final {
   Handle<ByteArray> ToSourcePositionTable(IsolateT* isolate);
 
 #ifdef DEBUG
-  int CheckBytecodeMatches(BytecodeArray bytecode);
+  int CheckBytecodeMatches(Tagged<BytecodeArray> bytecode);
 #endif
 
   // Get the number of parameters expected by function.
@@ -83,7 +83,7 @@ class V8_EXPORT_PRIVATE BytecodeArrayBuilder final {
 
   // Constant loads to accumulator.
   BytecodeArrayBuilder& LoadConstantPoolEntry(size_t entry);
-  BytecodeArrayBuilder& LoadLiteral(Smi value);
+  BytecodeArrayBuilder& LoadLiteral(Tagged<Smi> value);
   BytecodeArrayBuilder& LoadLiteral(double value);
   BytecodeArrayBuilder& LoadLiteral(const AstRawString* raw_string);
   BytecodeArrayBuilder& LoadLiteral(const Scope* scope);
@@ -362,7 +362,7 @@ class V8_EXPORT_PRIVATE BytecodeArrayBuilder final {
                                         int feedback_slot);
   // Same as above, but lhs in the accumulator and rhs in |literal|.
   BytecodeArrayBuilder& BinaryOperationSmiLiteral(Token::Value binop,
-                                                  Smi literal,
+                                                  Tagged<Smi> literal,
                                                   int feedback_slot);
 
   // Unary and Count Operators (value stored in accumulator).
@@ -406,10 +406,11 @@ class V8_EXPORT_PRIVATE BytecodeArrayBuilder final {
 
   // Converts accumulator and stores result in register |out|.
   BytecodeArrayBuilder& ToObject(Register out);
-  BytecodeArrayBuilder& ToName(Register out);
-  BytecodeArrayBuilder& ToString();
 
   // Converts accumulator and stores result back in accumulator.
+  BytecodeArrayBuilder& ToName();
+  BytecodeArrayBuilder& ToString();
+  BytecodeArrayBuilder& ToBoolean(ToBooleanMode mode);
   BytecodeArrayBuilder& ToNumber(int feedback_slot);
   BytecodeArrayBuilder& ToNumeric(int feedback_slot);
 
diff --git a/deps/v8/src/interpreter/bytecode-array-iterator.cc b/deps/v8/src/interpreter/bytecode-array-iterator.cc
index dc910fe89ef783..557e8114ef31a3 100644
--- a/deps/v8/src/interpreter/bytecode-array-iterator.cc
+++ b/deps/v8/src/interpreter/bytecode-array-iterator.cc
@@ -6,7 +6,6 @@
 
 #include "src/interpreter/bytecode-decoder.h"
 #include "src/interpreter/interpreter-intrinsics.h"
-#include "src/objects/code-inl.h"
 #include "src/objects/feedback-vector.h"
 #include "src/objects/objects-inl.h"
 
@@ -30,8 +29,25 @@ BytecodeArrayIterator::BytecodeArrayIterator(
   UpdateOperandScale();
 }
 
+BytecodeArrayIterator::BytecodeArrayIterator(
+    Handle<BytecodeArray> bytecode_array, int initial_offset,
+    DisallowGarbageCollection& no_gc)
+    : bytecode_array_(bytecode_array),
+      start_(reinterpret_cast<uint8_t*>(
+          bytecode_array_->GetFirstBytecodeAddress())),
+      end_(start_ + bytecode_array_->length()),
+      cursor_(start_ + initial_offset),
+      operand_scale_(OperandScale::kSingle),
+      prefix_size_(0),
+      local_heap_(nullptr) {
+  // Don't add a GC callback, since we're in a no_gc scope.
+  UpdateOperandScale();
+}
+
 BytecodeArrayIterator::~BytecodeArrayIterator() {
-  local_heap_->RemoveGCEpilogueCallback(UpdatePointersCallback, this);
+  if (local_heap_) {
+    local_heap_->RemoveGCEpilogueCallback(UpdatePointersCallback, this);
+  }
 }
 
 void BytecodeArrayIterator::SetOffset(int offset) {
@@ -217,15 +233,15 @@ Runtime::FunctionId BytecodeArrayIterator::GetIntrinsicIdOperand(
 template <typename IsolateT>
 Handle<Object> BytecodeArrayIterator::GetConstantAtIndex(
     int index, IsolateT* isolate) const {
-  return handle(bytecode_array()->constant_pool().get(index), isolate);
+  return handle(bytecode_array()->constant_pool()->get(index), isolate);
 }
 
 bool BytecodeArrayIterator::IsConstantAtIndexSmi(int index) const {
-  return bytecode_array()->constant_pool().get(index).IsSmi();
+  return IsSmi(bytecode_array()->constant_pool()->get(index));
 }
 
-Smi BytecodeArrayIterator::GetConstantAtIndexAsSmi(int index) const {
-  return Smi::cast(bytecode_array()->constant_pool().get(index));
+Tagged<Smi> BytecodeArrayIterator::GetConstantAtIndexAsSmi(int index) const {
+  return Smi::cast(bytecode_array()->constant_pool()->get(index));
 }
 
 template <typename IsolateT>
@@ -249,7 +265,7 @@ int BytecodeArrayIterator::GetRelativeJumpTargetOffset() const {
     }
     return relative_offset;
   } else if (interpreter::Bytecodes::IsJumpConstant(bytecode)) {
-    Smi smi = GetConstantAtIndexAsSmi(GetIndexOperand(0));
+    Tagged<Smi> smi = GetConstantAtIndexAsSmi(GetIndexOperand(0));
     return smi.value();
   } else {
     UNREACHABLE();
diff --git a/deps/v8/src/interpreter/bytecode-array-iterator.h b/deps/v8/src/interpreter/bytecode-array-iterator.h
index 11f92e50b52698..3343e82a4bafe8 100644
--- a/deps/v8/src/interpreter/bytecode-array-iterator.h
+++ b/deps/v8/src/interpreter/bytecode-array-iterator.h
@@ -69,8 +69,10 @@ class V8_EXPORT_PRIVATE JumpTableTargetOffsets final {
 
 class V8_EXPORT_PRIVATE BytecodeArrayIterator {
  public:
+  explicit BytecodeArrayIterator(Handle<BytecodeArray> bytecode_array,
+                                 int initial_offset = 0);
   BytecodeArrayIterator(Handle<BytecodeArray> bytecode_array,
-                        int initial_offset = 0);
+                        int initial_offset, DisallowGarbageCollection& no_gc);
   ~BytecodeArrayIterator();
 
   BytecodeArrayIterator(const BytecodeArrayIterator&) = delete;
@@ -137,7 +139,7 @@ class V8_EXPORT_PRIVATE BytecodeArrayIterator {
   template <typename IsolateT>
   Handle<Object> GetConstantAtIndex(int offset, IsolateT* isolate) const;
   bool IsConstantAtIndexSmi(int offset) const;
-  Smi GetConstantAtIndexAsSmi(int offset) const;
+  Tagged<Smi> GetConstantAtIndexAsSmi(int offset) const;
   template <typename IsolateT>
   Handle<Object> GetConstantForIndexOperand(int operand_index,
                                             IsolateT* isolate) const;
@@ -161,8 +163,7 @@ class V8_EXPORT_PRIVATE BytecodeArrayIterator {
 
   std::ostream& PrintTo(std::ostream& os) const;
 
-  static void UpdatePointersCallback(LocalIsolate*, GCType, GCCallbackFlags,
-                                     void* iterator) {
+  static void UpdatePointersCallback(void* iterator) {
     reinterpret_cast<BytecodeArrayIterator*>(iterator)->UpdatePointers();
   }
 
@@ -170,6 +171,13 @@ class V8_EXPORT_PRIVATE BytecodeArrayIterator {
 
   inline bool done() const { return cursor_ >= end_; }
 
+  bool operator==(const BytecodeArrayIterator& other) const {
+    return cursor_ == other.cursor_;
+  }
+  bool operator!=(const BytecodeArrayIterator& other) const {
+    return cursor_ != other.cursor_;
+  }
+
  private:
   uint32_t GetUnsignedOperand(int operand_index,
                               OperandType operand_type) const;
diff --git a/deps/v8/src/interpreter/bytecode-array-random-iterator.cc b/deps/v8/src/interpreter/bytecode-array-random-iterator.cc
index 5343edcc73ef3a..9c014e87d9117e 100644
--- a/deps/v8/src/interpreter/bytecode-array-random-iterator.cc
+++ b/deps/v8/src/interpreter/bytecode-array-random-iterator.cc
@@ -3,7 +3,7 @@
 // found in the LICENSE file.
 
 #include "src/interpreter/bytecode-array-random-iterator.h"
-#include "src/objects/code-inl.h"
+
 #include "src/objects/objects-inl.h"
 
 namespace v8 {
diff --git a/deps/v8/src/interpreter/bytecode-array-writer.cc b/deps/v8/src/interpreter/bytecode-array-writer.cc
index 6962891133e35e..bb1bcf763c12c0 100644
--- a/deps/v8/src/interpreter/bytecode-array-writer.cc
+++ b/deps/v8/src/interpreter/bytecode-array-writer.cc
@@ -82,17 +82,17 @@ template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
         LocalIsolate* isolate);
 
 #ifdef DEBUG
-int BytecodeArrayWriter::CheckBytecodeMatches(BytecodeArray bytecode) {
+int BytecodeArrayWriter::CheckBytecodeMatches(Tagged<BytecodeArray> bytecode) {
   int mismatches = false;
   int bytecode_size = static_cast<int>(bytecodes()->size());
-  const byte* bytecode_ptr = &bytecodes()->front();
-  if (bytecode_size != bytecode.length()) mismatches = true;
+  const uint8_t* bytecode_ptr = &bytecodes()->front();
+  if (bytecode_size != bytecode->length()) mismatches = true;
 
   // If there's a mismatch only in the length of the bytecode (very unlikely)
   // then the first mismatch will be the first extra bytecode.
-  int first_mismatch = std::min(bytecode_size, bytecode.length());
+  int first_mismatch = std::min(bytecode_size, bytecode->length());
   for (int i = 0; i < first_mismatch; ++i) {
-    if (bytecode_ptr[i] != bytecode.get(i)) {
+    if (bytecode_ptr[i] != bytecode->get(i)) {
       mismatches = true;
       first_mismatch = i;
       break;
diff --git a/deps/v8/src/interpreter/bytecode-array-writer.h b/deps/v8/src/interpreter/bytecode-array-writer.h
index 672d544b398379..71b710e4ed66ec 100644
--- a/deps/v8/src/interpreter/bytecode-array-writer.h
+++ b/deps/v8/src/interpreter/bytecode-array-writer.h
@@ -66,7 +66,7 @@ class V8_EXPORT_PRIVATE BytecodeArrayWriter final {
 
 #ifdef DEBUG
   // Returns -1 if they match or the offset of the first mismatching byte.
-  int CheckBytecodeMatches(BytecodeArray bytecode);
+  int CheckBytecodeMatches(Tagged<BytecodeArray> bytecode);
 #endif
 
   bool RemainderOfBlockIsDead() const { return exit_seen_in_block_; }
diff --git a/deps/v8/src/interpreter/bytecode-generator.cc b/deps/v8/src/interpreter/bytecode-generator.cc
index acaa1dae45fb18..f82c7f5347684a 100644
--- a/deps/v8/src/interpreter/bytecode-generator.cc
+++ b/deps/v8/src/interpreter/bytecode-generator.cc
@@ -19,6 +19,7 @@
 #include "src/common/globals.h"
 #include "src/compiler-dispatcher/lazy-compile-dispatcher.h"
 #include "src/heap/parked-scope.h"
+#include "src/interpreter/bytecode-array-builder.h"
 #include "src/interpreter/bytecode-flags.h"
 #include "src/interpreter/bytecode-jump-table.h"
 #include "src/interpreter/bytecode-label.h"
@@ -623,7 +624,7 @@ class V8_NODISCARD BytecodeGenerator::ExpressionResultScope {
       : outer_(generator->execution_result()),
         allocator_(generator),
         kind_(kind),
-        type_hint_(TypeHint::kAny) {
+        type_hint_(TypeHint::kUnknown) {
     generator->set_execution_result(this);
   }
 
@@ -645,15 +646,20 @@ class V8_NODISCARD BytecodeGenerator::ExpressionResultScope {
 
   // Specify expression always returns a Boolean result value.
   void SetResultIsBoolean() {
-    DCHECK_EQ(type_hint_, TypeHint::kAny);
+    DCHECK_EQ(type_hint_, TypeHint::kUnknown);
     type_hint_ = TypeHint::kBoolean;
   }
 
   void SetResultIsString() {
-    DCHECK_EQ(type_hint_, TypeHint::kAny);
+    DCHECK_EQ(type_hint_, TypeHint::kUnknown);
     type_hint_ = TypeHint::kString;
   }
 
+  void SetResultIsInternalizedString() {
+    DCHECK_EQ(type_hint_, TypeHint::kUnknown);
+    type_hint_ = TypeHint::kInternalizedString;
+  }
+
   TypeHint type_hint() const { return type_hint_; }
 
  private:
@@ -998,6 +1004,102 @@ class BytecodeGenerator::FeedbackSlotCache : public ZoneObject {
   ZoneMap<Key, int> map_;
 };
 
+// Scoped class to help elide hole checks within a conditionally executed basic
+// block. Each conditionally executed basic block must have a scope to emit
+// hole checks correctly.
+//
+// The duration of the scope must correspond to a basic block. Numbered
+// Variables (see Variable::HoleCheckBitmap) are remembered in the bitmap when
+// the first hole check is emitted. Subsequent hole checks are elided.
+//
+// On scope exit, the hole check state at construction time is restored.
+class V8_NODISCARD BytecodeGenerator::HoleCheckElisionScope {
+ public:
+  explicit HoleCheckElisionScope(BytecodeGenerator* bytecode_generator)
+      : HoleCheckElisionScope(&bytecode_generator->hole_check_bitmap_) {}
+
+  ~HoleCheckElisionScope() { *bitmap_ = prev_bitmap_value_; }
+
+ protected:
+  explicit HoleCheckElisionScope(Variable::HoleCheckBitmap* bitmap)
+      : bitmap_(bitmap), prev_bitmap_value_(*bitmap) {}
+
+  Variable::HoleCheckBitmap* bitmap_;
+  Variable::HoleCheckBitmap prev_bitmap_value_;
+};
+
+// Scoped class to help elide hole checks within control flow that branch and
+// merge.
+//
+// Each such control flow construct (e.g., if-else, ternary expressions) must
+// have a scope to emit hole checks correctly. Additionally, each branch must
+// have a Branch.
+//
+// The Merge or MergeIf method must be called to merge variables that have been
+// hole-checked along every branch are marked as no longer needing a hole check.
+//
+// Example:
+//
+//   HoleCheckElisionMergeScope merge_elider(this);
+//   {
+//      HoleCheckElisionMergeScope::Branch branch_elider(merge_elider);
+//      Visit(then_branch);
+//   }
+//   {
+//      HoleCheckElisionMergeScope::Branch branch_elider(merge_elider);
+//      Visit(else_branch);
+//   }
+//   merge_elider.Merge();
+//
+// Conversely, it is incorrect to use this class for control flow constructs
+// that do not merge (e.g., if without else). HoleCheckElisionScope should be
+// used for those cases.
+class V8_NODISCARD BytecodeGenerator::HoleCheckElisionMergeScope final {
+ public:
+  explicit HoleCheckElisionMergeScope(BytecodeGenerator* bytecode_generator)
+      : bitmap_(&bytecode_generator->hole_check_bitmap_) {}
+
+  ~HoleCheckElisionMergeScope() {
+    // Did you forget to call Merge or MergeIf?
+    DCHECK(merge_called_);
+  }
+
+  void Merge() {
+    DCHECK_NE(UINT64_MAX, merge_value_);
+    *bitmap_ = merge_value_;
+#ifdef DEBUG
+    merge_called_ = true;
+#endif
+  }
+
+  void MergeIf(bool cond) {
+    if (cond) Merge();
+#ifdef DEBUG
+    merge_called_ = true;
+#endif
+  }
+
+  class V8_NODISCARD Branch final : public HoleCheckElisionScope {
+   public:
+    explicit Branch(HoleCheckElisionMergeScope& merge_into)
+        : HoleCheckElisionScope(merge_into.bitmap_),
+          merge_into_bitmap_(&merge_into.merge_value_) {}
+
+    ~Branch() { *merge_into_bitmap_ &= *bitmap_; }
+
+   private:
+    Variable::HoleCheckBitmap* merge_into_bitmap_;
+  };
+
+ private:
+  Variable::HoleCheckBitmap* bitmap_;
+  Variable::HoleCheckBitmap merge_value_ = UINT64_MAX;
+
+#ifdef DEBUG
+  bool merge_called_ = false;
+#endif
+};
+
 class BytecodeGenerator::IteratorRecord final {
  public:
   IteratorRecord(Register object_register, Register next_register,
@@ -1151,6 +1253,7 @@ BytecodeGenerator::BytecodeGenerator(
       array_literals_(0, zone()),
       class_literals_(0, zone()),
       template_objects_(0, zone()),
+      vars_in_hole_check_bitmap_(0, zone()),
       execution_control_(nullptr),
       execution_context_(nullptr),
       execution_result_(nullptr),
@@ -1160,6 +1263,7 @@ BytecodeGenerator::BytecodeGenerator(
       generator_jump_table_(nullptr),
       suspend_count_(0),
       loop_depth_(0),
+      hole_check_bitmap_(0),
       current_loop_scope_(nullptr),
       catch_prediction_(HandlerTable::UNCAUGHT) {
   DCHECK_EQ(closure_scope(), closure_scope()->GetClosureScope());
@@ -1258,7 +1362,7 @@ template Handle<ByteArray> BytecodeGenerator::FinalizeSourcePositionTable(
     LocalIsolate* isolate);
 
 #ifdef DEBUG
-int BytecodeGenerator::CheckBytecodeMatches(BytecodeArray bytecode) {
+int BytecodeGenerator::CheckBytecodeMatches(Tagged<BytecodeArray> bytecode) {
   return builder()->CheckBytecodeMatches(bytecode);
 }
 #endif
@@ -1361,6 +1465,14 @@ bool NeedsContextInitialization(DeclarationScope* scope) {
 
 void BytecodeGenerator::GenerateBytecode(uintptr_t stack_limit) {
   InitializeAstVisitor(stack_limit);
+  if (v8_flags.stress_lazy_compilation && local_isolate_->is_main_thread()) {
+    // Trigger stack overflow with 1/stress_lazy_compilation probability.
+    // Do this only for the main thread compilations because querying random
+    // numbers from background threads will make the random values dependent
+    // on the thread scheduling and thus non-deterministic.
+    stack_overflow_ = local_isolate_->fuzzer_rng()->NextInt(
+                          v8_flags.stress_lazy_compilation) == 0;
+  }
 
   // Initialize the incoming context.
   ContextScope incoming_context(this, closure_scope());
@@ -1389,6 +1501,12 @@ void BytecodeGenerator::GenerateBytecode(uintptr_t stack_limit) {
     GenerateBytecodeBody();
   }
 
+  // Reset variables with hole check bitmap indices for subsequent compilations
+  // in the same parsing zone.
+  for (Variable* var : vars_in_hole_check_bitmap_) {
+    var->ResetHoleCheckBitmapIndex();
+  }
+
   // Check that we are not falling off the end.
   DCHECK(builder()->RemainderOfBlockIsDead());
 }
@@ -1516,7 +1634,21 @@ void BytecodeGenerator::VisitBlockDeclarationsAndStatements(Block* stmt) {
   if (stmt->scope() != nullptr) {
     VisitDeclarations(stmt->scope()->declarations());
   }
-  VisitStatements(stmt->statements());
+  if (V8_UNLIKELY(stmt->is_breakable())) {
+    // Loathsome labeled blocks can be the target of break statements, which
+    // causes unconditional blocks to act conditionally, and therefore to
+    // require their own elision scope.
+    //
+    // lbl: {
+    //   if (cond) break lbl;
+    //   x;
+    // }
+    // x;  <-- Cannot elide TDZ check
+    HoleCheckElisionScope elider(this);
+    VisitStatements(stmt->statements());
+  } else {
+    VisitStatements(stmt->statements());
+  }
 }
 
 void BytecodeGenerator::VisitVariableDeclaration(VariableDeclaration* decl) {
@@ -1737,14 +1869,23 @@ void BytecodeGenerator::VisitIfStatement(IfStatement* stmt) {
     VisitForTest(stmt->condition(), conditional_builder.then_labels(),
                  conditional_builder.else_labels(), TestFallthrough::kThen);
 
-    conditional_builder.Then();
-    Visit(stmt->then_statement());
+    HoleCheckElisionMergeScope merge_elider(this);
+    {
+      HoleCheckElisionMergeScope::Branch branch(merge_elider);
+      conditional_builder.Then();
+      Visit(stmt->then_statement());
+    }
 
-    if (stmt->HasElseStatement()) {
-      conditional_builder.JumpToEnd();
-      conditional_builder.Else();
-      Visit(stmt->else_statement());
+    {
+      HoleCheckElisionMergeScope::Branch branch(merge_elider);
+      if (stmt->HasElseStatement()) {
+        conditional_builder.JumpToEnd();
+        conditional_builder.Else();
+        Visit(stmt->else_statement());
+      }
     }
+
+    merge_elider.Merge();
   }
 }
 
@@ -2065,20 +2206,32 @@ void BytecodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) {
                             : FeedbackSlot::Invalid();
     builder()->StoreAccumulatorInRegister(tag_holder);
 
-    for (int i = 0; i < clauses->length(); ++i) {
-      CaseClause* clause = clauses->at(i);
-      if (clause->is_default()) {
-        info.default_case = i;
-      } else if (!info.CaseExists(clause->label())) {
-        // Perform label comparison as if via '===' with tag.
-        VisitForAccumulatorValue(clause->label());
-        builder()->CompareOperation(Token::Value::EQ_STRICT, tag_holder,
-                                    feedback_index(slot));
+    {
+      // The comparisons linearly dominate, so no need to open a new elision
+      // scope for each one.
+      base::Optional<HoleCheckElisionScope> elider;
+      bool first_jump_emitted = false;
+      for (int i = 0; i < clauses->length(); ++i) {
+        CaseClause* clause = clauses->at(i);
+        if (clause->is_default()) {
+          info.default_case = i;
+        } else if (!info.CaseExists(clause->label())) {
+          // The first non-default label is
+          // unconditionally executed, so we only need to emplace it before
+          // visiting the second non-default label.
+          if (first_jump_emitted) elider.emplace(this);
+
+          // Perform label comparison as if via '===' with tag.
+          VisitForAccumulatorValue(clause->label());
+          builder()->CompareOperation(Token::Value::EQ_STRICT, tag_holder,
+                                      feedback_index(slot));
 #ifdef DEBUG
-        case_ctr_checker[i] = case_compare_ctr;
+          case_ctr_checker[i] = case_compare_ctr;
 #endif
-        switch_builder.JumpToCaseIfTrue(ToBooleanMode::kAlreadyBoolean,
-                                        case_compare_ctr++);
+          switch_builder.JumpToCaseIfTrue(ToBooleanMode::kAlreadyBoolean,
+                                          case_compare_ctr++);
+          first_jump_emitted = true;
+        }
       }
     }
     register_allocator()->ReleaseRegister(tag_holder);
@@ -2092,6 +2245,10 @@ void BytecodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) {
     switch_builder.Break();
   }
 
+  // It is only correct to merge hole check states if there is a default clause,
+  // as otherwise it's unknown if the switch is exhaustive.
+  HoleCheckElisionMergeScope merge_elider(this);
+
   case_compare_ctr = 0;
   for (int i = 0; i < clauses->length(); ++i) {
     CaseClause* clause = clauses->at(i);
@@ -2115,8 +2272,11 @@ void BytecodeGenerator::VisitSwitchStatement(SwitchStatement* stmt) {
       switch_builder.BindDefault(clause);
     }
     // Regardless, generate code (in case of fall throughs).
+    HoleCheckElisionMergeScope::Branch branch_elider(merge_elider);
     VisitStatements(clause->statements());
   }
+
+  merge_elider.MergeIf(info.DefaultExists());
 }
 
 template <typename TryBodyFunc, typename CatchBodyFunc>
@@ -2140,13 +2300,34 @@ void BytecodeGenerator::BuildTryCatch(
   // Evaluate the try-block inside a control scope. This simulates a handler
   // that is intercepting 'throw' control commands.
   try_control_builder.BeginTry(context);
+
+  HoleCheckElisionMergeScope merge_elider(this);
+
   {
     ControlScopeForTryCatch scope(this, &try_control_builder);
+    // The try-block itself, even though unconditionally executed, can throw
+    // basically at any point, and so must be treated as conditional from the
+    // perspective of the hole check elision analysis.
+    //
+    // try { x } catch (e) { }
+    // use(x); <-- Still requires a TDZ check
+    //
+    // However, if both the try-block and the catch-block emit a hole check,
+    // subsequent TDZ checks can be elided.
+    //
+    // try { x; } catch (e) { x; }
+    // use(x); <-- TDZ check can be elided
+    HoleCheckElisionMergeScope::Branch branch_elider(merge_elider);
     try_body_func();
   }
   try_control_builder.EndTry();
 
-  catch_body_func(context);
+  {
+    HoleCheckElisionMergeScope::Branch branch_elider(merge_elider);
+    catch_body_func(context);
+  }
+
+  merge_elider.Merge();
 
   try_control_builder.EndCatch();
 }
@@ -2195,6 +2376,10 @@ void BytecodeGenerator::BuildTryFinally(
   try_control_builder.BeginTry(context);
   {
     ControlScopeForTryFinally scope(this, &try_control_builder, &commands);
+    // The try-block itself, even though unconditionally executed, can throw
+    // basically at any point, and so must be treated as conditional from the
+    // perspective of the hole check elision analysis.
+    HoleCheckElisionScope elider(this);
     try_body_func();
   }
   try_control_builder.EndTry();
@@ -2232,6 +2417,12 @@ void BytecodeGenerator::VisitIterationBody(IterationStatement* stmt,
   loop_builder->BindContinueTarget();
 }
 
+void BytecodeGenerator::VisitIterationBodyInHoleCheckElisionScope(
+    IterationStatement* stmt, LoopBuilder* loop_builder) {
+  HoleCheckElisionScope elider(this);
+  VisitIterationBody(stmt, loop_builder);
+}
+
 void BytecodeGenerator::VisitDoWhileStatement(DoWhileStatement* stmt) {
   LoopBuilder loop_builder(builder(), block_coverage_builder_, stmt,
                            feedback_spec());
@@ -2240,17 +2431,25 @@ void BytecodeGenerator::VisitDoWhileStatement(DoWhileStatement* stmt) {
     // Therefore, we don't create a LoopScope (and thus we don't create a header
     // and a JumpToHeader). However, we still need to iterate once through the
     // body.
-    VisitIterationBody(stmt, &loop_builder);
+    VisitIterationBodyInHoleCheckElisionScope(stmt, &loop_builder);
   } else if (stmt->cond()->ToBooleanIsTrue()) {
     LoopScope loop_scope(this, &loop_builder);
-    VisitIterationBody(stmt, &loop_builder);
+    VisitIterationBodyInHoleCheckElisionScope(stmt, &loop_builder);
   } else {
     LoopScope loop_scope(this, &loop_builder);
-    VisitIterationBody(stmt, &loop_builder);
+    VisitIterationBodyInHoleCheckElisionScope(stmt, &loop_builder);
     builder()->SetExpressionAsStatementPosition(stmt->cond());
     BytecodeLabels loop_backbranch(zone());
-    VisitForTest(stmt->cond(), &loop_backbranch, loop_builder.break_labels(),
-                 TestFallthrough::kThen);
+    if (!loop_builder.break_labels()->empty()) {
+      // The test may be conditionally executed if there was a break statement
+      // inside the loop body, and therefore requires its own elision scope.
+      HoleCheckElisionScope elider(this);
+      VisitForTest(stmt->cond(), &loop_backbranch, loop_builder.break_labels(),
+                   TestFallthrough::kThen);
+    } else {
+      VisitForTest(stmt->cond(), &loop_backbranch, loop_builder.break_labels(),
+                   TestFallthrough::kThen);
+    }
     loop_backbranch.Bind(builder());
   }
 }
@@ -2272,7 +2471,7 @@ void BytecodeGenerator::VisitWhileStatement(WhileStatement* stmt) {
                  TestFallthrough::kThen);
     loop_body.Bind(builder());
   }
-  VisitIterationBody(stmt, &loop_builder);
+  VisitIterationBodyInHoleCheckElisionScope(stmt, &loop_builder);
 }
 
 void BytecodeGenerator::VisitForStatement(ForStatement* stmt) {
@@ -2296,6 +2495,24 @@ void BytecodeGenerator::VisitForStatement(ForStatement* stmt) {
                  TestFallthrough::kThen);
     loop_body.Bind(builder());
   }
+
+  // C-style for loops' textual order differs from dominator order.
+  //
+  // for (INIT; TEST; NEXT) BODY
+  // REST
+  //
+  //   has the dominator order of
+  //
+  // INIT dominates TEST dominates BODY dominates NEXT
+  //   and
+  // INIT dominates TEST dominates REST
+  //
+  // INIT and TEST are always evaluated and so do not have their own
+  // HoleCheckElisionScope. BODY, like all iteration bodies, can contain control
+  // flow like breaks or continues, has its own HoleCheckElisionScope. NEXT is
+  // therefore conditionally evaluated and also so has its own
+  // HoleCheckElisionScope.
+  HoleCheckElisionScope elider(this);
   VisitIterationBody(stmt, &loop_builder);
   if (stmt->next() != nullptr) {
     builder()->SetStatementPosition(stmt->next());
@@ -2336,6 +2553,7 @@ void BytecodeGenerator::VisitForInStatement(ForInStatement* stmt) {
     LoopBuilder loop_builder(builder(), block_coverage_builder_, stmt,
                              feedback_spec());
     LoopScope loop_scope(this, &loop_builder);
+    HoleCheckElisionScope elider(this);
     builder()->SetExpressionAsStatementPosition(stmt->each());
     builder()->ForInContinue(index, cache_length);
     loop_builder.BreakIfFalse(ToBooleanMode::kAlreadyBoolean);
@@ -2409,6 +2627,9 @@ void BytecodeGenerator::VisitForOfStatement(ForOfStatement* stmt) {
                                  feedback_spec());
         LoopScope loop_scope(this, &loop_builder);
 
+        // This doesn't need a HoleCheckElisionScope because BuildTryFinally
+        // already makes one for try blocks.
+
         builder()->LoadTrue().StoreAccumulatorInRegister(done);
 
         {
@@ -2988,12 +3209,21 @@ void BytecodeGenerator::VisitConditional(Conditional* expr) {
     VisitForTest(expr->condition(), conditional_builder.then_labels(),
                  conditional_builder.else_labels(), TestFallthrough::kThen);
 
+    HoleCheckElisionMergeScope merge_elider(this);
     conditional_builder.Then();
-    VisitForAccumulatorValue(expr->then_expression());
+    {
+      HoleCheckElisionMergeScope::Branch branch_elider(merge_elider);
+      VisitForAccumulatorValue(expr->then_expression());
+    }
     conditional_builder.JumpToEnd();
 
     conditional_builder.Else();
-    VisitForAccumulatorValue(expr->else_expression());
+    {
+      HoleCheckElisionMergeScope::Branch branch_elider(merge_elider);
+      VisitForAccumulatorValue(expr->else_expression());
+    }
+
+    merge_elider.Merge();
   }
 }
 
@@ -3021,7 +3251,7 @@ void BytecodeGenerator::VisitLiteral(Literal* expr) {
       break;
     case Literal::kString:
       builder()->LoadLiteral(expr->AsRawString());
-      execution_result()->SetResultIsString();
+      execution_result()->SetResultIsInternalizedString();
       break;
     case Literal::kBigInt:
       builder()->LoadLiteral(expr->AsBigInt());
@@ -3293,6 +3523,8 @@ void BytecodeGenerator::VisitObjectLiteral(ObjectLiteral* expr) {
         break;
       }
       case ObjectLiteral::Property::SPREAD: {
+        // TODO(olivf, chrome:1204540) This can be slower than the Babel
+        // translation. Should we compile this to a copying loop in bytecode?
         RegisterList args = register_allocator()->NewRegisterList(2);
         builder()->MoveRegister(literal, args[0]);
         builder()->SetExpressionPosition(property->value());
@@ -3558,7 +3790,7 @@ void BytecodeGenerator::BuildVariableLoad(Variable* variable,
       // VisitForRegisterScope, in order to avoid register aliasing if
       // subsequent expressions assign to the same variable.
       builder()->LoadAccumulatorWithRegister(source);
-      if (hole_check_mode == HoleCheckMode::kRequired) {
+      if (VariableNeedsHoleCheckInCurrentBlock(variable, hole_check_mode)) {
         BuildThrowIfHole(variable);
       }
       break;
@@ -3574,7 +3806,7 @@ void BytecodeGenerator::BuildVariableLoad(Variable* variable,
       // VisitForRegisterScope, in order to avoid register aliasing if
       // subsequent expressions assign to the same variable.
       builder()->LoadAccumulatorWithRegister(source);
-      if (hole_check_mode == HoleCheckMode::kRequired) {
+      if (VariableNeedsHoleCheckInCurrentBlock(variable, hole_check_mode)) {
         BuildThrowIfHole(variable);
       }
       break;
@@ -3615,7 +3847,7 @@ void BytecodeGenerator::BuildVariableLoad(Variable* variable,
 
       builder()->LoadContextSlot(context_reg, variable->index(), depth,
                                  immutable);
-      if (hole_check_mode == HoleCheckMode::kRequired) {
+      if (VariableNeedsHoleCheckInCurrentBlock(variable, hole_check_mode)) {
         BuildThrowIfHole(variable);
       }
       if (immutable == BytecodeArrayBuilder::kImmutableSlot) {
@@ -3631,8 +3863,9 @@ void BytecodeGenerator::BuildVariableLoad(Variable* variable,
               execution_context()->ContextChainDepth(local_variable->scope());
           builder()->LoadLookupContextSlot(variable->raw_name(), typeof_mode,
                                            local_variable->index(), depth);
-          if (hole_check_mode == HoleCheckMode::kRequired) {
-            BuildThrowIfHole(variable);
+          if (VariableNeedsHoleCheckInCurrentBlock(local_variable,
+                                                   hole_check_mode)) {
+            BuildThrowIfHole(local_variable);
           }
           break;
         }
@@ -3661,7 +3894,7 @@ void BytecodeGenerator::BuildVariableLoad(Variable* variable,
     case VariableLocation::MODULE: {
       int depth = execution_context()->ContextChainDepth(variable->scope());
       builder()->LoadModuleVariable(variable->index(), depth);
-      if (hole_check_mode == HoleCheckMode::kRequired) {
+      if (VariableNeedsHoleCheckInCurrentBlock(variable, hole_check_mode)) {
         BuildThrowIfHole(variable);
       }
       break;
@@ -3720,6 +3953,30 @@ void BytecodeGenerator::BuildAsyncReturn(int source_position) {
 
 void BytecodeGenerator::BuildReThrow() { builder()->ReThrow(); }
 
+void BytecodeGenerator::RememberHoleCheckInCurrentBlock(Variable* variable) {
+  if (!v8_flags.ignition_elide_redundant_tdz_checks) return;
+
+  // The first N-1 variables that need hole checks may be cached in a bitmap to
+  // elide subsequent hole checks in the same basic block, where N is
+  // Variable::kHoleCheckBitmapBits.
+  //
+  // This numbering is done during bytecode generation instead of scope analysis
+  // for 2 reasons:
+  //
+  // 1. There may be multiple eagerly compiled inner functions during a single
+  // run of scope analysis, so a global numbering will result in fewer variables
+  // with cacheable hole checks.
+  //
+  // 2. Compiler::CollectSourcePositions reparses functions and checks that the
+  // recompiled bytecode is identical. Therefore the numbering must be kept
+  // identical regardless of whether a function is eagerly compiled as part of
+  // an outer compilation or recompiled during source position collection. The
+  // simplest way to guarantee identical numbering is to scope it to the
+  // compilation instead of scope analysis.
+  variable->RememberHoleCheckInBitmap(hole_check_bitmap_,
+                                      vars_in_hole_check_bitmap_);
+}
+
 void BytecodeGenerator::BuildThrowIfHole(Variable* variable) {
   if (variable->is_this()) {
     DCHECK(variable->mode() == VariableMode::kConst);
@@ -3727,16 +3984,35 @@ void BytecodeGenerator::BuildThrowIfHole(Variable* variable) {
   } else {
     builder()->ThrowReferenceErrorIfHole(variable->raw_name());
   }
+  RememberHoleCheckInCurrentBlock(variable);
+}
+
+bool BytecodeGenerator::VariableNeedsHoleCheckInCurrentBlock(
+    Variable* variable, HoleCheckMode hole_check_mode) {
+  return hole_check_mode == HoleCheckMode::kRequired &&
+         !variable->HasRememberedHoleCheck(hole_check_bitmap_);
+}
+
+bool BytecodeGenerator::VariableNeedsHoleCheckInCurrentBlockForAssignment(
+    Variable* variable, Token::Value op, HoleCheckMode hole_check_mode) {
+  return VariableNeedsHoleCheckInCurrentBlock(variable, hole_check_mode) ||
+         (variable->is_this() && variable->mode() == VariableMode::kConst &&
+          op == Token::INIT);
 }
 
 void BytecodeGenerator::BuildHoleCheckForVariableAssignment(Variable* variable,
                                                             Token::Value op) {
   DCHECK(!IsPrivateMethodOrAccessorVariableMode(variable->mode()));
-  if (variable->is_this() && variable->mode() == VariableMode::kConst &&
-      op == Token::INIT) {
+  DCHECK(VariableNeedsHoleCheckInCurrentBlockForAssignment(
+      variable, op, HoleCheckMode::kRequired));
+  if (variable->is_this()) {
+    DCHECK(variable->mode() == VariableMode::kConst && op == Token::INIT);
     // Perform an initialization check for 'this'. 'this' variable is the
     // only variable able to trigger bind operations outside the TDZ
     // via 'super' calls.
+    //
+    // Do not remember the hole check because this bytecode throws if 'this' is
+    // *not* the hole, i.e. the opposite of the TDZ hole check.
     builder()->ThrowSuperAlreadyCalledIfNotHole();
   } else {
     // Perform an initialization check for let/const declared variables.
@@ -3766,18 +4042,24 @@ void BytecodeGenerator::BuildVariableAssignment(
         destination = builder()->Local(variable->index());
       }
 
-      if (hole_check_mode == HoleCheckMode::kRequired) {
+      if (VariableNeedsHoleCheckInCurrentBlockForAssignment(variable, op,
+                                                            hole_check_mode)) {
         // Load destination to check for hole.
         Register value_temp = register_allocator()->NewRegister();
         builder()
             ->StoreAccumulatorInRegister(value_temp)
             .LoadAccumulatorWithRegister(destination);
-
         BuildHoleCheckForVariableAssignment(variable, op);
         builder()->LoadAccumulatorWithRegister(value_temp);
       }
 
       if (mode != VariableMode::kConst || op == Token::INIT) {
+        if (op == Token::INIT &&
+            variable->HasHoleCheckUseInSameClosureScope()) {
+          // After initializing a variable it won't be the hole anymore, so
+          // elide subsequent checks.
+          RememberHoleCheckInCurrentBlock(variable);
+        }
         builder()->StoreAccumulatorInRegister(destination);
       } else if (variable->throw_on_const_assignment(language_mode())) {
         builder()->CallRuntime(Runtime::kThrowConstAssignError);
@@ -3800,7 +4082,8 @@ void BytecodeGenerator::BuildVariableAssignment(
         context_reg = execution_context()->reg();
       }
 
-      if (hole_check_mode == HoleCheckMode::kRequired) {
+      if (VariableNeedsHoleCheckInCurrentBlockForAssignment(variable, op,
+                                                            hole_check_mode)) {
         // Load destination to check for hole.
         Register value_temp = register_allocator()->NewRegister();
         builder()
@@ -3813,6 +4096,12 @@ void BytecodeGenerator::BuildVariableAssignment(
       }
 
       if (mode != VariableMode::kConst || op == Token::INIT) {
+        if (op == Token::INIT &&
+            variable->HasHoleCheckUseInSameClosureScope()) {
+          // After initializing a variable it won't be the hole anymore, so
+          // elide subsequent checks.
+          RememberHoleCheckInCurrentBlock(variable);
+        }
         builder()->StoreContextSlot(context_reg, variable->index(), depth);
       } else if (variable->throw_on_const_assignment(language_mode())) {
         builder()->CallRuntime(Runtime::kThrowConstAssignError);
@@ -3838,7 +4127,8 @@ void BytecodeGenerator::BuildVariableAssignment(
       DCHECK(variable->IsExport());
 
       int depth = execution_context()->ContextChainDepth(variable->scope());
-      if (hole_check_mode == HoleCheckMode::kRequired) {
+      if (VariableNeedsHoleCheckInCurrentBlockForAssignment(variable, op,
+                                                            hole_check_mode)) {
         Register value_temp = register_allocator()->NewRegister();
         builder()
             ->StoreAccumulatorInRegister(value_temp)
@@ -4283,7 +4573,7 @@ void BytecodeGenerator::BuildDestructuringArrayAssignment(
               // Since done == true => temp == undefined, jump directly to using
               // the default value for that case.
               is_done.Bind(builder());
-              VisitForAccumulatorValue(default_value);
+              VisitInHoleCheckElisionScopeForAccumulatorValue(default_value);
             } else {
               builder()->Jump(&do_assignment);
               is_done.Bind(builder());
@@ -4456,7 +4746,7 @@ void BytecodeGenerator::BuildDestructuringObjectAssignment(
           DCHECK(!pattern_key->IsPropertyName() ||
                  !pattern_key->IsNumberLiteral());
           VisitForAccumulatorValue(pattern_key);
-          builder()->ToName(value_key);
+          builder()->ToName().StoreAccumulatorInRegister(value_key);
         } else {
           // We only need the key for non-computed properties when it is numeric
           // or is being saved for the rest_runtime_callargs.
@@ -4494,7 +4784,7 @@ void BytecodeGenerator::BuildDestructuringObjectAssignment(
     if (default_value) {
       BytecodeLabel value_not_undefined;
       builder()->JumpIfNotUndefined(&value_not_undefined);
-      VisitForAccumulatorValue(default_value);
+      VisitInHoleCheckElisionScopeForAccumulatorValue(default_value);
       builder()->Bind(&value_not_undefined);
     }
 
@@ -4687,13 +4977,13 @@ void BytecodeGenerator::VisitCompoundAssignment(CompoundAssignment* expr) {
         ->JumpIfUndefinedOrNull(&nullish)
         .Jump(&short_circuit)
         .Bind(&nullish);
-    VisitForAccumulatorValue(expr->value());
+    VisitInHoleCheckElisionScopeForAccumulatorValue(expr->value());
   } else if (binop->op() == Token::OR) {
     builder()->JumpIfTrue(ToBooleanMode::kConvertToBoolean, &short_circuit);
-    VisitForAccumulatorValue(expr->value());
+    VisitInHoleCheckElisionScopeForAccumulatorValue(expr->value());
   } else if (binop->op() == Token::AND) {
     builder()->JumpIfFalse(ToBooleanMode::kConvertToBoolean, &short_circuit);
-    VisitForAccumulatorValue(expr->value());
+    VisitInHoleCheckElisionScopeForAccumulatorValue(expr->value());
   } else if (expr->value()->IsSmiLiteral()) {
     builder()->BinaryOperationSmiLiteral(
         binop->op(), expr->value()->AsLiteral()->AsSmiLiteral(),
@@ -5437,6 +5727,9 @@ template <typename ExpressionFunc>
 void BytecodeGenerator::BuildOptionalChain(ExpressionFunc expression_func) {
   BytecodeLabel done;
   OptionalChainNullLabelScope label_scope(this);
+  // Use the same scope for the entire optional chain, as links earlier in the
+  // chain dominate later links, linearly.
+  HoleCheckElisionScope elider(this);
   expression_func();
   builder()->Jump(&done);
   label_scope.labels()->Bind(builder());
@@ -5938,6 +6231,7 @@ void BytecodeGenerator::VisitForTypeOfValue(Expression* expr) {
 void BytecodeGenerator::VisitTypeOf(UnaryOperation* expr) {
   VisitForTypeOfValue(expr->expression());
   builder()->TypeOf();
+  execution_result()->SetResultIsInternalizedString();
 }
 
 void BytecodeGenerator::VisitNot(UnaryOperation* expr) {
@@ -5951,8 +6245,16 @@ void BytecodeGenerator::VisitNot(UnaryOperation* expr) {
     test_result->InvertControlFlow();
     VisitInSameTestExecutionScope(expr->expression());
   } else {
-    TypeHint type_hint = VisitForAccumulatorValue(expr->expression());
-    builder()->LogicalNot(ToBooleanModeFromTypeHint(type_hint));
+    UnaryOperation* unary_op = expr->expression()->AsUnaryOperation();
+    if (unary_op && unary_op->op() == Token::Value::NOT) {
+      // Shortcut repeated nots, to capture the `!!foo` pattern for converting
+      // expressions to booleans.
+      TypeHint type_hint = VisitForAccumulatorValue(unary_op->expression());
+      builder()->ToBoolean(ToBooleanModeFromTypeHint(type_hint));
+    } else {
+      TypeHint type_hint = VisitForAccumulatorValue(expr->expression());
+      builder()->LogicalNot(ToBooleanModeFromTypeHint(type_hint));
+    }
     // Always returns a boolean value.
     execution_result()->SetResultIsBoolean();
   }
@@ -6017,7 +6319,11 @@ void BytecodeGenerator::VisitDelete(UnaryOperation* unary) {
       }
       Register object = register_allocator()->NewRegister();
       builder()->StoreAccumulatorInRegister(object);
-      VisitForAccumulatorValue(property->key());
+      if (property->is_optional_chain_link()) {
+        VisitInHoleCheckElisionScopeForAccumulatorValue(property->key());
+      } else {
+        VisitForAccumulatorValue(property->key());
+      }
       builder()->Delete(object, language_mode());
       builder()->Jump(&done);
       label_scope.labels()->Bind(builder());
@@ -6333,6 +6639,15 @@ void BytecodeGenerator::BuildLiteralStrictCompareBoolean(Literal* literal) {
   builder()->CompareReference(result);
 }
 
+bool BytecodeGenerator::IsLocalVariableWithInternalizedStringHint(
+    Expression* expr) {
+  VariableProxy* proxy = expr->AsVariableProxy();
+  return proxy != nullptr && proxy->is_resolved() &&
+         proxy->var()->IsStackLocal() &&
+         GetTypeHintForLocalVariable(proxy->var()) ==
+             TypeHint::kInternalizedString;
+}
+
 void BytecodeGenerator::VisitCompareOperation(CompareOperation* expr) {
   Expression* sub_expr;
   Literal* literal;
@@ -6361,6 +6676,11 @@ void BytecodeGenerator::VisitCompareOperation(CompareOperation* expr) {
     VisitForAccumulatorValue(sub_expr);
     builder()->SetExpressionPosition(expr);
     BuildLiteralCompareNil(expr->op(), BytecodeArrayBuilder::kNullValue);
+  } else if (expr->IsLiteralCompareEqualVariable(&sub_expr, &literal) &&
+             IsLocalVariableWithInternalizedStringHint(sub_expr)) {
+    builder()->LoadLiteral(literal->AsRawString());
+    builder()->CompareReference(
+        GetRegisterForLocalVariable(sub_expr->AsVariableProxy()->var()));
   } else {
     if (expr->op() == Token::IN && expr->left()->IsPrivateName()) {
       Variable* var = expr->left()->AsVariableProxy()->var();
@@ -6391,13 +6711,13 @@ void BytecodeGenerator::VisitCompareOperation(CompareOperation* expr) {
 void BytecodeGenerator::VisitArithmeticExpression(BinaryOperation* expr) {
   FeedbackSlot slot = feedback_spec()->AddBinaryOpICSlot();
   Expression* subexpr;
-  Smi literal;
+  Tagged<Smi> literal;
   if (expr->IsSmiLiteralOperation(&subexpr, &literal)) {
     TypeHint type_hint = VisitForAccumulatorValue(subexpr);
     builder()->SetExpressionPosition(expr);
     builder()->BinaryOperationSmiLiteral(expr->op(), literal,
                                          feedback_index(slot));
-    if (expr->op() == Token::ADD && type_hint == TypeHint::kString) {
+    if (expr->op() == Token::ADD && IsStringTypeHint(type_hint)) {
       execution_result()->SetResultIsString();
     }
   } else {
@@ -6406,7 +6726,7 @@ void BytecodeGenerator::VisitArithmeticExpression(BinaryOperation* expr) {
     builder()->StoreAccumulatorInRegister(lhs);
     TypeHint rhs_type = VisitForAccumulatorValue(expr->right());
     if (expr->op() == Token::ADD &&
-        (lhs_type == TypeHint::kString || rhs_type == TypeHint::kString)) {
+        (IsStringTypeHint(lhs_type) || IsStringTypeHint(rhs_type))) {
       execution_result()->SetResultIsString();
     }
 
@@ -6430,7 +6750,7 @@ void BytecodeGenerator::VisitNaryArithmeticExpression(NaryOperation* expr) {
       Register lhs = register_allocator()->NewRegister();
       builder()->StoreAccumulatorInRegister(lhs);
       TypeHint rhs_hint = VisitForAccumulatorValue(expr->subsequent(i));
-      if (rhs_hint == TypeHint::kString) type_hint = TypeHint::kString;
+      if (IsStringTypeHint(rhs_hint)) type_hint = TypeHint::kString;
       builder()->SetExpressionPosition(expr->subsequent_op_position(i));
       builder()->BinaryOperation(
           expr->op(), lhs,
@@ -6438,7 +6758,7 @@ void BytecodeGenerator::VisitNaryArithmeticExpression(NaryOperation* expr) {
     }
   }
 
-  if (type_hint == TypeHint::kString && expr->op() == Token::ADD) {
+  if (IsStringTypeHint(type_hint) && expr->op() == Token::ADD) {
     // If any operand of an ADD is a String, a String is produced.
     execution_result()->SetResultIsString();
   }
@@ -6650,7 +6970,7 @@ void BytecodeGenerator::VisitTemplateLiteral(TemplateLiteral* expr) {
     }
 
     TypeHint type_hint = VisitForAccumulatorValue(substitutions[i]);
-    if (type_hint != TypeHint::kString) {
+    if (!IsStringTypeHint(type_hint)) {
       builder()->ToString();
     }
     if (last_part_valid) {
@@ -6743,6 +7063,7 @@ void BytecodeGenerator::VisitLogicalTest(Token::Value token, Expression* left,
   VisitLogicalTestSubExpression(token, left, then_labels, else_labels,
                                 right_coverage_slot);
   // The last test has the same then, else and fallthrough as the parent test.
+  HoleCheckElisionScope elider(this);
   VisitForTest(right, then_labels, else_labels, fallthrough);
 }
 
@@ -6759,6 +7080,7 @@ void BytecodeGenerator::VisitNaryLogicalTest(
 
   VisitLogicalTestSubExpression(token, expr->first(), then_labels, else_labels,
                                 coverage_slots->GetSlotFor(0));
+  HoleCheckElisionScope elider(this);
   for (size_t i = 0; i < expr->subsequent_length() - 1; ++i) {
     VisitLogicalTestSubExpression(token, expr->subsequent(i), then_labels,
                                   else_labels,
@@ -6849,7 +7171,7 @@ void BytecodeGenerator::VisitLogicalOrExpression(BinaryOperation* binop) {
     if (VisitLogicalOrSubExpression(left, &end_labels, right_coverage_slot)) {
       return;
     }
-    VisitForAccumulatorValue(right);
+    VisitInHoleCheckElisionScopeForAccumulatorValue(right);
     end_labels.Bind(builder());
   }
 }
@@ -6874,6 +7196,8 @@ void BytecodeGenerator::VisitNaryLogicalOrExpression(NaryOperation* expr) {
                                     coverage_slots.GetSlotFor(0))) {
       return;
     }
+
+    HoleCheckElisionScope elider(this);
     for (size_t i = 0; i < expr->subsequent_length() - 1; ++i) {
       if (VisitLogicalOrSubExpression(expr->subsequent(i), &end_labels,
                                       coverage_slots.GetSlotFor(i + 1))) {
@@ -6910,7 +7234,7 @@ void BytecodeGenerator::VisitLogicalAndExpression(BinaryOperation* binop) {
     if (VisitLogicalAndSubExpression(left, &end_labels, right_coverage_slot)) {
       return;
     }
-    VisitForAccumulatorValue(right);
+    VisitInHoleCheckElisionScopeForAccumulatorValue(right);
     end_labels.Bind(builder());
   }
 }
@@ -6935,6 +7259,7 @@ void BytecodeGenerator::VisitNaryLogicalAndExpression(NaryOperation* expr) {
                                      coverage_slots.GetSlotFor(0))) {
       return;
     }
+    HoleCheckElisionScope elider(this);
     for (size_t i = 0; i < expr->subsequent_length() - 1; ++i) {
       if (VisitLogicalAndSubExpression(expr->subsequent(i), &end_labels,
                                        coverage_slots.GetSlotFor(i + 1))) {
@@ -6972,7 +7297,7 @@ void BytecodeGenerator::VisitNullishExpression(BinaryOperation* binop) {
     if (VisitNullishSubExpression(left, &end_labels, right_coverage_slot)) {
       return;
     }
-    VisitForAccumulatorValue(right);
+    VisitInHoleCheckElisionScopeForAccumulatorValue(right);
     end_labels.Bind(builder());
   }
 }
@@ -6997,6 +7322,7 @@ void BytecodeGenerator::VisitNaryNullishExpression(NaryOperation* expr) {
                                   coverage_slots.GetSlotFor(0))) {
       return;
     }
+    HoleCheckElisionScope elider(this);
     for (size_t i = 0; i < expr->subsequent_length() - 1; ++i) {
       if (VisitNullishSubExpression(expr->subsequent(i), &end_labels,
                                     coverage_slots.GetSlotFor(i + 1))) {
@@ -7193,7 +7519,7 @@ void BytecodeGenerator::BuildLoadPropertyKey(LiteralProperty* property,
         .StoreAccumulatorInRegister(out_reg);
   } else {
     VisitForAccumulatorValue(property->key());
-    builder()->ToName(out_reg);
+    builder()->ToName().StoreAccumulatorInRegister(out_reg);
   }
 }
 
@@ -7230,7 +7556,13 @@ BytecodeGenerator::TypeHint BytecodeGenerator::VisitForAccumulatorValue(
     Expression* expr) {
   ValueResultScope accumulator_scope(this);
   Visit(expr);
-  return accumulator_scope.type_hint();
+  // Record the type hint for the result of current expression in accumulator.
+  const TypeHint type_hint = accumulator_scope.type_hint();
+  BytecodeRegisterOptimizer* optimizer = builder()->GetRegisterOptimizer();
+  if (optimizer && type_hint != TypeHint::kUnknown) {
+    optimizer->SetTypeHintForAccumulator(type_hint);
+  }
+  return type_hint;
 }
 
 void BytecodeGenerator::VisitForAccumulatorValueOrTheHole(Expression* expr) {
@@ -7368,11 +7700,34 @@ void BytecodeGenerator::VisitInScope(Statement* stmt, Scope* scope) {
   Visit(stmt);
 }
 
+template <typename T>
+void BytecodeGenerator::VisitInHoleCheckElisionScope(T* node) {
+  HoleCheckElisionScope elider(this);
+  Visit(node);
+}
+
+BytecodeGenerator::TypeHint
+BytecodeGenerator::VisitInHoleCheckElisionScopeForAccumulatorValue(
+    Expression* expr) {
+  HoleCheckElisionScope elider(this);
+  return VisitForAccumulatorValue(expr);
+}
+
 Register BytecodeGenerator::GetRegisterForLocalVariable(Variable* variable) {
   DCHECK_EQ(VariableLocation::LOCAL, variable->location());
   return builder()->Local(variable->index());
 }
 
+BytecodeGenerator::TypeHint BytecodeGenerator::GetTypeHintForLocalVariable(
+    Variable* variable) {
+  BytecodeRegisterOptimizer* optimizer = builder()->GetRegisterOptimizer();
+  if (optimizer) {
+    Register reg = GetRegisterForLocalVariable(variable);
+    return optimizer->GetTypeHint(reg);
+  }
+  return TypeHint::kAny;
+}
+
 FunctionKind BytecodeGenerator::function_kind() const {
   return info()->literal()->kind();
 }
diff --git a/deps/v8/src/interpreter/bytecode-generator.h b/deps/v8/src/interpreter/bytecode-generator.h
index a114c0dfdff479..9ec9e807504548 100644
--- a/deps/v8/src/interpreter/bytecode-generator.h
+++ b/deps/v8/src/interpreter/bytecode-generator.h
@@ -31,6 +31,14 @@ class BytecodeJumpTable;
 
 class BytecodeGenerator final : public AstVisitor<BytecodeGenerator> {
  public:
+  enum TypeHint : uint8_t {
+    kBoolean = 1 << 0,
+    kInternalizedString = 1 << 1,
+    kString = kInternalizedString | (1 << 2),
+    kAny = kBoolean | kString,
+    kUnknown = 0xFFu
+  };
+
   explicit BytecodeGenerator(
       LocalIsolate* local_isolate, Zone* zone, UnoptimizedCompilationInfo* info,
       const AstStringConstants* ast_string_constants,
@@ -44,8 +52,17 @@ class BytecodeGenerator final : public AstVisitor<BytecodeGenerator> {
   template <typename IsolateT>
   Handle<ByteArray> FinalizeSourcePositionTable(IsolateT* isolate);
 
+  // Check if hint2 is same or the subtype of hint1.
+  static bool IsSameOrSubTypeHint(TypeHint hint1, TypeHint hint2) {
+    return hint1 == (hint1 | hint2);
+  }
+
+  static bool IsStringTypeHint(TypeHint hint) {
+    return IsSameOrSubTypeHint(TypeHint::kString, hint);
+  }
+
 #ifdef DEBUG
-  int CheckBytecodeMatches(BytecodeArray bytecode);
+  int CheckBytecodeMatches(Tagged<BytecodeArray> bytecode);
 #endif
 
 #define DECLARE_VISIT(type) void Visit##type(type* node);
@@ -71,6 +88,8 @@ class BytecodeGenerator final : public AstVisitor<BytecodeGenerator> {
   class EffectResultScope;
   class ExpressionResultScope;
   class FeedbackSlotCache;
+  class HoleCheckElisionScope;
+  class HoleCheckElisionMergeScope;
   class IteratorRecord;
   class MultipleEntryBlockContextScope;
   class LoopScope;
@@ -84,7 +103,6 @@ class BytecodeGenerator final : public AstVisitor<BytecodeGenerator> {
   using ToBooleanMode = BytecodeArrayBuilder::ToBooleanMode;
 
   enum class TestFallthrough { kThen, kElse, kNone };
-  enum class TypeHint { kAny, kBoolean, kString };
   enum class AccumulatorPreservingMode { kNone, kPreserve };
 
   // An assignment has to evaluate its LHS before its RHS, but has to assign to
@@ -274,6 +292,11 @@ class BytecodeGenerator final : public AstVisitor<BytecodeGenerator> {
   void BuildAsyncReturn(int source_position);
   void BuildAsyncGeneratorReturn();
   void BuildReThrow();
+  void RememberHoleCheckInCurrentBlock(Variable* variable);
+  bool VariableNeedsHoleCheckInCurrentBlock(Variable* variable,
+                                            HoleCheckMode hole_check_mode);
+  bool VariableNeedsHoleCheckInCurrentBlockForAssignment(
+      Variable* variable, Token::Value op, HoleCheckMode hole_check_mode);
   void BuildHoleCheckForVariableAssignment(Variable* variable, Token::Value op);
   void BuildThrowIfHole(Variable* variable);
 
@@ -430,10 +453,21 @@ class BytecodeGenerator final : public AstVisitor<BytecodeGenerator> {
                            BytecodeLabels* test_next_labels,
                            BytecodeLabels* else_labels);
 
+  // Convenience visitors that put a HoleCheckElisionScope on stack.
+  template <typename T>
+  void VisitInHoleCheckElisionScope(T* node);
+  void VisitIterationBodyInHoleCheckElisionScope(IterationStatement* stmt,
+                                                 LoopBuilder* loop_builder);
+  TypeHint VisitInHoleCheckElisionScopeForAccumulatorValue(Expression* expr);
+
   void VisitInSameTestExecutionScope(Expression* expr);
 
   Register GetRegisterForLocalVariable(Variable* variable);
 
+  bool IsLocalVariableWithInternalizedStringHint(Expression* expr);
+
+  TypeHint GetTypeHintForLocalVariable(Variable* variable);
+
   // Returns the runtime function id for a store to super for the function's
   // language mode.
   inline Runtime::FunctionId StoreToSuperRuntimeId();
@@ -540,6 +574,7 @@ class BytecodeGenerator final : public AstVisitor<BytecodeGenerator> {
       array_literals_;
   ZoneVector<std::pair<ClassLiteral*, size_t>> class_literals_;
   ZoneVector<std::pair<GetTemplateObject*, size_t>> template_objects_;
+  ZoneVector<Variable*> vars_in_hole_check_bitmap_;
 
   ControlScope* execution_control_;
   ContextScope* execution_context_;
@@ -558,6 +593,10 @@ class BytecodeGenerator final : public AstVisitor<BytecodeGenerator> {
   // TODO(solanes): assess if we can move loop_depth_ into LoopScope.
   int loop_depth_;
 
+  // Variables for which hole checks have been emitted in the current basic
+  // block. Managed by HoleCheckElisionScope and HoleCheckElisionMergeScope.
+  Variable::HoleCheckBitmap hole_check_bitmap_;
+
   LoopScope* current_loop_scope_;
 
   HandlerTable::CatchPrediction catch_prediction_;
diff --git a/deps/v8/src/interpreter/bytecode-register-optimizer.cc b/deps/v8/src/interpreter/bytecode-register-optimizer.cc
index a733b5bab45326..b8dd61249aa94f 100644
--- a/deps/v8/src/interpreter/bytecode-register-optimizer.cc
+++ b/deps/v8/src/interpreter/bytecode-register-optimizer.cc
@@ -4,12 +4,16 @@
 
 #include "src/interpreter/bytecode-register-optimizer.h"
 
+#include "src/interpreter/bytecode-generator.h"
+
 namespace v8 {
 namespace internal {
 namespace interpreter {
 
 const uint32_t BytecodeRegisterOptimizer::kInvalidEquivalenceId = kMaxUInt32;
 
+using TypeHint = BytecodeRegisterOptimizer::TypeHint;
+
 // A class for tracking the state of a register. This class tracks
 // which equivalence set a register is a member of and also whether a
 // register is materialized in the bytecode stream.
@@ -22,6 +26,7 @@ class BytecodeRegisterOptimizer::RegisterInfo final : public ZoneObject {
         materialized_(materialized),
         allocated_(allocated),
         needs_flush_(false),
+        type_hint_(TypeHint::kAny),
         var_in_reg_(nullptr),
         next_(this),
         prev_(this) {}
@@ -78,6 +83,9 @@ class BytecodeRegisterOptimizer::RegisterInfo final : public ZoneObject {
   // Indicates if a register should be processed when calling Flush().
   bool needs_flush() const { return needs_flush_; }
   void set_needs_flush(bool needs_flush) { needs_flush_ = needs_flush; }
+  TypeHint type_hint() const { return type_hint_; }
+  void set_type_hint(TypeHint hint) { type_hint_ = hint; }
+
   Variable* var_in_reg() const { return var_in_reg_; }
   void set_var_in_reg(Variable* var) { var_in_reg_ = var; }
 
@@ -87,6 +95,7 @@ class BytecodeRegisterOptimizer::RegisterInfo final : public ZoneObject {
   bool materialized_;
   bool allocated_;
   bool needs_flush_;
+  TypeHint type_hint_;
   Variable* var_in_reg_;
 
   // Equivalence set pointers.
@@ -108,6 +117,7 @@ void BytecodeRegisterOptimizer::RegisterInfo::AddToEquivalenceSetOf(
   set_equivalence_id(info->equivalence_id());
   set_materialized(false);
   set_var_in_reg(info->var_in_reg());
+  type_hint_ = info->type_hint();
 }
 
 void BytecodeRegisterOptimizer::RegisterInfo::MoveToNewEquivalenceSet(
@@ -118,6 +128,7 @@ void BytecodeRegisterOptimizer::RegisterInfo::MoveToNewEquivalenceSet(
   equivalence_id_ = equivalence_id;
   materialized_ = materialized;
   var_in_reg_ = var;
+  type_hint_ = TypeHint::kAny;
 }
 
 bool BytecodeRegisterOptimizer::RegisterInfo::IsOnlyMemberOfEquivalenceSet()
@@ -144,6 +155,27 @@ bool BytecodeRegisterOptimizer::IsVariableInRegister(Variable* var,
   return info->var_in_reg() == var;
 }
 
+TypeHint BytecodeRegisterOptimizer::GetTypeHint(Register reg) {
+  RegisterInfo* info = GetRegisterInfo(reg);
+  return info->type_hint();
+}
+
+void BytecodeRegisterOptimizer::SetTypeHintForAccumulator(TypeHint hint) {
+  DCHECK(BytecodeGenerator::IsSameOrSubTypeHint(accumulator_info_->type_hint(),
+                                                hint));
+  if (accumulator_info_->type_hint() != hint) {
+    accumulator_info_->set_type_hint(hint);
+  }
+}
+
+void BytecodeRegisterOptimizer::ResetTypeHintForAccumulator() {
+  accumulator_info_->set_type_hint(TypeHint::kAny);
+}
+
+bool BytecodeRegisterOptimizer::IsAccumulatorReset() {
+  return accumulator_info_->type_hint() == TypeHint::kAny;
+}
+
 bool BytecodeRegisterOptimizer::RegisterInfo::
     IsOnlyMaterializedMemberOfEquivalenceSet() const {
   DCHECK(materialized());
@@ -311,6 +343,7 @@ void BytecodeRegisterOptimizer::Flush() {
     if (!reg_info->needs_flush()) continue;
     reg_info->set_needs_flush(false);
     reg_info->set_var_in_reg(nullptr);
+    reg_info->set_type_hint(TypeHint::kAny);
 
     RegisterInfo* materialized = reg_info->materialized()
                                      ? reg_info
diff --git a/deps/v8/src/interpreter/bytecode-register-optimizer.h b/deps/v8/src/interpreter/bytecode-register-optimizer.h
index 65deb09c244e9c..f6e9d631cd28d8 100644
--- a/deps/v8/src/interpreter/bytecode-register-optimizer.h
+++ b/deps/v8/src/interpreter/bytecode-register-optimizer.h
@@ -8,6 +8,7 @@
 #include "src/ast/variables.h"
 #include "src/base/compiler-specific.h"
 #include "src/common/globals.h"
+#include "src/interpreter/bytecode-generator.h"
 #include "src/interpreter/bytecode-register-allocator.h"
 #include "src/zone/zone-containers.h"
 #include "src/zone/zone.h"
@@ -24,6 +25,8 @@ class V8_EXPORT_PRIVATE BytecodeRegisterOptimizer final
     : public NON_EXPORTED_BASE(BytecodeRegisterAllocator::Observer),
       public NON_EXPORTED_BASE(ZoneObject) {
  public:
+  using TypeHint = BytecodeGenerator::TypeHint;
+
   class BytecodeWriter {
    public:
     BytecodeWriter() = default;
@@ -96,6 +99,7 @@ class V8_EXPORT_PRIVATE BytecodeRegisterOptimizer final
     // clobbered when the bytecode is dispatched.
     if (BytecodeOperands::WritesOrClobbersAccumulator(implicit_register_use)) {
       PrepareOutputRegister(accumulator_);
+      DCHECK_EQ(GetTypeHint(accumulator_), TypeHint::kAny);
     }
   }
 
@@ -121,6 +125,11 @@ class V8_EXPORT_PRIVATE BytecodeRegisterOptimizer final
   // Return true if the var is in the reg.
   bool IsVariableInRegister(Variable* var, Register reg);
 
+  TypeHint GetTypeHint(Register reg);
+  void SetTypeHintForAccumulator(TypeHint hint);
+  void ResetTypeHintForAccumulator();
+  bool IsAccumulatorReset();
+
   int maxiumum_register_index() const { return max_register_index_; }
 
  private:
diff --git a/deps/v8/src/interpreter/bytecode-register.cc b/deps/v8/src/interpreter/bytecode-register.cc
index 6e47f14d05dec7..00e2d5562f9d06 100644
--- a/deps/v8/src/interpreter/bytecode-register.cc
+++ b/deps/v8/src/interpreter/bytecode-register.cc
@@ -8,117 +8,6 @@ namespace v8 {
 namespace internal {
 namespace interpreter {
 
-static const int kFirstParamRegisterIndex =
-    (InterpreterFrameConstants::kRegisterFileFromFp -
-     InterpreterFrameConstants::kFirstParamFromFp) /
-    kSystemPointerSize;
-static const int kFunctionClosureRegisterIndex =
-    (InterpreterFrameConstants::kRegisterFileFromFp -
-     StandardFrameConstants::kFunctionOffset) /
-    kSystemPointerSize;
-static const int kCurrentContextRegisterIndex =
-    (InterpreterFrameConstants::kRegisterFileFromFp -
-     StandardFrameConstants::kContextOffset) /
-    kSystemPointerSize;
-static const int kBytecodeArrayRegisterIndex =
-    (InterpreterFrameConstants::kRegisterFileFromFp -
-     InterpreterFrameConstants::kBytecodeArrayFromFp) /
-    kSystemPointerSize;
-static const int kBytecodeOffsetRegisterIndex =
-    (InterpreterFrameConstants::kRegisterFileFromFp -
-     InterpreterFrameConstants::kBytecodeOffsetFromFp) /
-    kSystemPointerSize;
-static const int kCallerPCOffsetRegisterIndex =
-    (InterpreterFrameConstants::kRegisterFileFromFp -
-     InterpreterFrameConstants::kCallerPCOffset) /
-    kSystemPointerSize;
-static const int kArgumentCountRegisterIndex =
-    (InterpreterFrameConstants::kRegisterFileFromFp -
-     InterpreterFrameConstants::kArgCOffset) /
-    kSystemPointerSize;
-
-Register Register::FromParameterIndex(int index) {
-  DCHECK_GE(index, 0);
-  int register_index = kFirstParamRegisterIndex - index;
-  DCHECK_LT(register_index, 0);
-  return Register(register_index);
-}
-
-int Register::ToParameterIndex() const {
-  DCHECK(is_parameter());
-  return kFirstParamRegisterIndex - index();
-}
-
-Register Register::function_closure() {
-  return Register(kFunctionClosureRegisterIndex);
-}
-
-bool Register::is_function_closure() const {
-  return index() == kFunctionClosureRegisterIndex;
-}
-
-Register Register::current_context() {
-  return Register(kCurrentContextRegisterIndex);
-}
-
-bool Register::is_current_context() const {
-  return index() == kCurrentContextRegisterIndex;
-}
-
-Register Register::bytecode_array() {
-  return Register(kBytecodeArrayRegisterIndex);
-}
-
-bool Register::is_bytecode_array() const {
-  return index() == kBytecodeArrayRegisterIndex;
-}
-
-Register Register::bytecode_offset() {
-  return Register(kBytecodeOffsetRegisterIndex);
-}
-
-bool Register::is_bytecode_offset() const {
-  return index() == kBytecodeOffsetRegisterIndex;
-}
-
-// static
-Register Register::virtual_accumulator() {
-  return Register(kCallerPCOffsetRegisterIndex);
-}
-
-// static
-Register Register::argument_count() {
-  return Register(kArgumentCountRegisterIndex);
-}
-
-OperandSize Register::SizeOfOperand() const {
-  int32_t operand = ToOperand();
-  if (operand >= kMinInt8 && operand <= kMaxInt8) {
-    return OperandSize::kByte;
-  } else if (operand >= kMinInt16 && operand <= kMaxInt16) {
-    return OperandSize::kShort;
-  } else {
-    return OperandSize::kQuad;
-  }
-}
-
-bool Register::AreContiguous(Register reg1, Register reg2, Register reg3,
-                             Register reg4, Register reg5) {
-  if (reg1.index() + 1 != reg2.index()) {
-    return false;
-  }
-  if (reg3.is_valid() && reg2.index() + 1 != reg3.index()) {
-    return false;
-  }
-  if (reg4.is_valid() && reg3.index() + 1 != reg4.index()) {
-    return false;
-  }
-  if (reg5.is_valid() && reg4.index() + 1 != reg5.index()) {
-    return false;
-  }
-  return true;
-}
-
 std::string Register::ToString() const {
   if (is_current_context()) {
     return std::string("<context>");
diff --git a/deps/v8/src/interpreter/bytecode-register.h b/deps/v8/src/interpreter/bytecode-register.h
index 6f8d3cdb188a0a..5168f195d1edb5 100644
--- a/deps/v8/src/interpreter/bytecode-register.h
+++ b/deps/v8/src/interpreter/bytecode-register.h
@@ -16,55 +16,60 @@ namespace v8 {
 namespace internal {
 namespace interpreter {
 
+constexpr int OffsetFromFPToRegisterIndex(int offset) {
+  return (InterpreterFrameConstants::kRegisterFileFromFp - offset) /
+         kSystemPointerSize;
+}
+
 // An interpreter Register which is located in the function's Register file
 // in its stack-frame. Register hold parameters, this, and expression values.
 class V8_EXPORT_PRIVATE Register final {
  public:
   constexpr explicit Register(int index = kInvalidIndex) : index_(index) {}
 
-  int index() const { return index_; }
-  bool is_parameter() const { return index() < 0; }
-  bool is_valid() const { return index_ != kInvalidIndex; }
+  constexpr int index() const { return index_; }
+  constexpr bool is_parameter() const { return index() < 0; }
+  constexpr bool is_valid() const { return index_ != kInvalidIndex; }
 
-  static Register FromParameterIndex(int index);
-  int ToParameterIndex() const;
+  static constexpr Register FromParameterIndex(int index);
+  constexpr int ToParameterIndex() const;
 
-  static Register receiver() { return FromParameterIndex(0); }
-  bool is_receiver() const { return ToParameterIndex() == 0; }
+  static constexpr Register receiver() { return FromParameterIndex(0); }
+  constexpr bool is_receiver() const { return ToParameterIndex() == 0; }
 
   // Returns an invalid register.
-  static Register invalid_value() { return Register(); }
+  static constexpr Register invalid_value() { return Register(); }
 
   // Returns the register for the function's closure object.
-  static Register function_closure();
-  bool is_function_closure() const;
+  static constexpr Register function_closure();
+  constexpr bool is_function_closure() const;
 
   // Returns the register which holds the current context object.
-  static Register current_context();
-  bool is_current_context() const;
+  static constexpr Register current_context();
+  constexpr bool is_current_context() const;
 
   // Returns the register for the bytecode array.
-  static Register bytecode_array();
-  bool is_bytecode_array() const;
+  static constexpr Register bytecode_array();
+  constexpr bool is_bytecode_array() const;
 
   // Returns the register for the saved bytecode offset.
-  static Register bytecode_offset();
-  bool is_bytecode_offset() const;
+  static constexpr Register bytecode_offset();
+  constexpr bool is_bytecode_offset() const;
 
   // Returns the register for the argument count.
-  static Register argument_count();
+  static constexpr Register argument_count();
 
   // Returns a register that can be used to represent the accumulator
   // within code in the interpreter, but should never be emitted in
   // bytecode.
-  static Register virtual_accumulator();
+  static constexpr Register virtual_accumulator();
 
-  OperandSize SizeOfOperand() const;
+  constexpr OperandSize SizeOfOperand() const;
 
   constexpr int32_t ToOperand() const {
     return kRegisterFileStartOffset - index_;
   }
-  static Register FromOperand(int32_t operand) {
+  static constexpr Register FromOperand(int32_t operand) {
     return Register(kRegisterFileStartOffset - operand);
   }
 
@@ -74,7 +79,7 @@ class V8_EXPORT_PRIVATE Register final {
                     static_cast<int>(bytecode));
   }
 
-  const base::Optional<Bytecode> TryToShortStar() const {
+  constexpr base::Optional<Bytecode> TryToShortStar() const {
     if (index() >= 0 && index() < Bytecodes::kShortStarCount) {
       Bytecode bytecode =
           static_cast<Bytecode>(static_cast<int>(Bytecode::kStar0) - index());
@@ -85,38 +90,50 @@ class V8_EXPORT_PRIVATE Register final {
     return {};
   }
 
-  static bool AreContiguous(Register reg1, Register reg2,
-                            Register reg3 = invalid_value(),
-                            Register reg4 = invalid_value(),
-                            Register reg5 = invalid_value());
-
   std::string ToString() const;
 
-  bool operator==(const Register& other) const {
+  constexpr bool operator==(const Register& other) const {
     return index() == other.index();
   }
-  bool operator!=(const Register& other) const {
+  constexpr bool operator!=(const Register& other) const {
     return index() != other.index();
   }
-  bool operator<(const Register& other) const {
+  constexpr bool operator<(const Register& other) const {
     return index() < other.index();
   }
-  bool operator<=(const Register& other) const {
+  constexpr bool operator<=(const Register& other) const {
     return index() <= other.index();
   }
-  bool operator>(const Register& other) const {
+  constexpr bool operator>(const Register& other) const {
     return index() > other.index();
   }
-  bool operator>=(const Register& other) const {
+  constexpr bool operator>=(const Register& other) const {
     return index() >= other.index();
   }
 
  private:
   DISALLOW_NEW_AND_DELETE()
 
-  static const int kInvalidIndex = kMaxInt;
-  static const int kRegisterFileStartOffset =
-      InterpreterFrameConstants::kRegisterFileFromFp / kSystemPointerSize;
+  static constexpr int kInvalidIndex = kMaxInt;
+
+  static constexpr int kRegisterFileStartOffset =
+      OffsetFromFPToRegisterIndex(0);
+  static constexpr int kFirstParamRegisterIndex =
+      OffsetFromFPToRegisterIndex(InterpreterFrameConstants::kFirstParamFromFp);
+  static constexpr int kFunctionClosureRegisterIndex =
+      OffsetFromFPToRegisterIndex(StandardFrameConstants::kFunctionOffset);
+  static constexpr int kCurrentContextRegisterIndex =
+      OffsetFromFPToRegisterIndex(StandardFrameConstants::kContextOffset);
+  static constexpr int kBytecodeArrayRegisterIndex =
+      OffsetFromFPToRegisterIndex(
+          InterpreterFrameConstants::kBytecodeArrayFromFp);
+  static constexpr int kBytecodeOffsetRegisterIndex =
+      OffsetFromFPToRegisterIndex(
+          InterpreterFrameConstants::kBytecodeOffsetFromFp);
+  static constexpr int kCallerPCOffsetRegisterIndex =
+      OffsetFromFPToRegisterIndex(InterpreterFrameConstants::kCallerPCOffset);
+  static constexpr int kArgumentCountRegisterIndex =
+      OffsetFromFPToRegisterIndex(InterpreterFrameConstants::kArgCOffset);
 
   int index_;
 };
@@ -173,6 +190,71 @@ class RegisterList {
   int register_count_;
 };
 
+constexpr Register Register::FromParameterIndex(int index) {
+  DCHECK_GE(index, 0);
+  int register_index = kFirstParamRegisterIndex - index;
+  DCHECK_LT(register_index, 0);
+  return Register(register_index);
+}
+
+constexpr int Register::ToParameterIndex() const {
+  DCHECK(is_parameter());
+  return kFirstParamRegisterIndex - index();
+}
+
+constexpr Register Register::function_closure() {
+  return Register(kFunctionClosureRegisterIndex);
+}
+
+constexpr bool Register::is_function_closure() const {
+  return index() == kFunctionClosureRegisterIndex;
+}
+
+constexpr Register Register::current_context() {
+  return Register(kCurrentContextRegisterIndex);
+}
+
+constexpr bool Register::is_current_context() const {
+  return index() == kCurrentContextRegisterIndex;
+}
+
+constexpr Register Register::bytecode_array() {
+  return Register(kBytecodeArrayRegisterIndex);
+}
+
+constexpr bool Register::is_bytecode_array() const {
+  return index() == kBytecodeArrayRegisterIndex;
+}
+
+constexpr Register Register::bytecode_offset() {
+  return Register(kBytecodeOffsetRegisterIndex);
+}
+
+constexpr bool Register::is_bytecode_offset() const {
+  return index() == kBytecodeOffsetRegisterIndex;
+}
+
+// static
+constexpr Register Register::virtual_accumulator() {
+  return Register(kCallerPCOffsetRegisterIndex);
+}
+
+// static
+constexpr Register Register::argument_count() {
+  return Register(kArgumentCountRegisterIndex);
+}
+
+constexpr OperandSize Register::SizeOfOperand() const {
+  int32_t operand = ToOperand();
+  if (operand >= kMinInt8 && operand <= kMaxInt8) {
+    return OperandSize::kByte;
+  } else if (operand >= kMinInt16 && operand <= kMaxInt16) {
+    return OperandSize::kShort;
+  } else {
+    return OperandSize::kQuad;
+  }
+}
+
 }  // namespace interpreter
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/interpreter/bytecodes.h b/deps/v8/src/interpreter/bytecodes.h
index 72dfec59a991df..5aa0776adf3334 100644
--- a/deps/v8/src/interpreter/bytecodes.h
+++ b/deps/v8/src/interpreter/bytecodes.h
@@ -257,8 +257,9 @@ namespace interpreter {
     OperandType::kRegList, OperandType::kRegCount, OperandType::kIdx)          \
   V(CallRuntime, ImplicitRegisterUse::kWriteAccumulator,                       \
     OperandType::kRuntimeId, OperandType::kRegList, OperandType::kRegCount)    \
-  V(CallRuntimeForPair, ImplicitRegisterUse::kNone, OperandType::kRuntimeId,   \
-    OperandType::kRegList, OperandType::kRegCount, OperandType::kRegOutPair)   \
+  V(CallRuntimeForPair, ImplicitRegisterUse::kClobberAccumulator,              \
+    OperandType::kRuntimeId, OperandType::kRegList, OperandType::kRegCount,    \
+    OperandType::kRegOutPair)                                                  \
   V(CallJSRuntime, ImplicitRegisterUse::kWriteAccumulator,                     \
     OperandType::kNativeContextIndex, OperandType::kRegList,                   \
     OperandType::kRegCount)                                                    \
@@ -293,11 +294,12 @@ namespace interpreter {
     OperandType::kIdx)                                                         \
                                                                                \
   /* Cast operators */                                                         \
-  V(ToName, ImplicitRegisterUse::kReadAccumulator, OperandType::kRegOut)       \
+  V(ToName, ImplicitRegisterUse::kReadWriteAccumulator)                        \
   V(ToNumber, ImplicitRegisterUse::kReadWriteAccumulator, OperandType::kIdx)   \
   V(ToNumeric, ImplicitRegisterUse::kReadWriteAccumulator, OperandType::kIdx)  \
   V(ToObject, ImplicitRegisterUse::kReadAccumulator, OperandType::kRegOut)     \
   V(ToString, ImplicitRegisterUse::kReadWriteAccumulator)                      \
+  V(ToBoolean, ImplicitRegisterUse::kReadWriteAccumulator)                     \
                                                                                \
   /* Literals */                                                               \
   V(CreateRegExpLiteral, ImplicitRegisterUse::kWriteAccumulator,               \
@@ -340,7 +342,7 @@ namespace interpreter {
                                                                                \
   /* Control Flow -- carefully ordered for efficient checks */                 \
   /* - [Unconditional jumps] */                                                \
-  V(JumpLoop, ImplicitRegisterUse::kNone, OperandType::kUImm,                  \
+  V(JumpLoop, ImplicitRegisterUse::kClobberAccumulator, OperandType::kUImm,    \
     OperandType::kImm, OperandType::kIdx)                                      \
   /* - [Forward jumps] */                                                      \
   V(Jump, ImplicitRegisterUse::kNone, OperandType::kUImm)                      \
@@ -430,7 +432,7 @@ namespace interpreter {
     OperandType::kIdx, OperandType::kIdx)                                      \
                                                                                \
   /* Debugger */                                                               \
-  V(Debugger, ImplicitRegisterUse::kNone)                                      \
+  V(Debugger, ImplicitRegisterUse::kClobberAccumulator)                        \
                                                                                \
   /* Block Coverage */                                                         \
   V(IncBlockCounter, ImplicitRegisterUse::kNone, OperandType::kIdx)            \
diff --git a/deps/v8/src/interpreter/constant-array-builder.cc b/deps/v8/src/interpreter/constant-array-builder.cc
index 8591a37183dbd8..e2cba36f6f5785 100644
--- a/deps/v8/src/interpreter/constant-array-builder.cc
+++ b/deps/v8/src/interpreter/constant-array-builder.cc
@@ -220,7 +220,7 @@ template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE)
     Handle<FixedArray> ConstantArrayBuilder::ToFixedArray(
         LocalIsolate* isolate);
 
-size_t ConstantArrayBuilder::Insert(Smi smi) {
+size_t ConstantArrayBuilder::Insert(Tagged<Smi> smi) {
   auto entry = smi_map_.find(smi);
   if (entry == smi_map_.end()) {
     return AllocateReservedEntry(smi);
@@ -321,7 +321,7 @@ void ConstantArrayBuilder::SetDeferredAt(size_t index, Handle<Object> object) {
   return slice->At(index).SetDeferred(object);
 }
 
-void ConstantArrayBuilder::SetJumpTableSmi(size_t index, Smi smi) {
+void ConstantArrayBuilder::SetJumpTableSmi(size_t index, Tagged<Smi> smi) {
   ConstantArraySlice* slice = IndexToSlice(index);
   // Allow others to reuse these Smis, but insert using emplace to avoid
   // overwriting existing values in the Smi map (which may have a smaller
@@ -341,14 +341,14 @@ OperandSize ConstantArrayBuilder::CreateReservedEntry() {
 }
 
 ConstantArrayBuilder::index_t ConstantArrayBuilder::AllocateReservedEntry(
-    Smi value) {
+    Tagged<Smi> value) {
   index_t index = static_cast<index_t>(AllocateIndex(Entry(value)));
   smi_map_[value] = index;
   return index;
 }
 
 size_t ConstantArrayBuilder::CommitReservedEntry(OperandSize operand_size,
-                                                 Smi value) {
+                                                 Tagged<Smi> value) {
   DiscardReservedEntry(operand_size);
   size_t index;
   auto entry = smi_map_.find(value);
diff --git a/deps/v8/src/interpreter/constant-array-builder.h b/deps/v8/src/interpreter/constant-array-builder.h
index 14eec07edcb3ec..76d970c93a728b 100644
--- a/deps/v8/src/interpreter/constant-array-builder.h
+++ b/deps/v8/src/interpreter/constant-array-builder.h
@@ -67,7 +67,7 @@ class V8_EXPORT_PRIVATE ConstantArrayBuilder final {
 
   // Insert an object into the constants array if it is not already present.
   // Returns the array index associated with the object.
-  size_t Insert(Smi smi);
+  size_t Insert(Tagged<Smi> smi);
   size_t Insert(double number);
   size_t Insert(const AstRawString* raw_string);
   size_t Insert(AstBigInt bigint);
@@ -91,7 +91,7 @@ class V8_EXPORT_PRIVATE ConstantArrayBuilder final {
 
   // Sets the jump table entry at |index| to |smi|. Note that |index| is the
   // constant pool index, not the switch case value.
-  void SetJumpTableSmi(size_t index, Smi smi);
+  void SetJumpTableSmi(size_t index, Tagged<Smi> smi);
 
   // Creates a reserved entry in the constant pool and returns
   // the size of the operand that'll be required to hold the entry
@@ -100,7 +100,7 @@ class V8_EXPORT_PRIVATE ConstantArrayBuilder final {
 
   // Commit reserved entry and returns the constant pool index for the
   // SMI value.
-  size_t CommitReservedEntry(OperandSize operand_size, Smi value);
+  size_t CommitReservedEntry(OperandSize operand_size, Tagged<Smi> value);
 
   // Discards constant pool reservation.
   void DiscardReservedEntry(OperandSize operand_size);
@@ -115,7 +115,7 @@ class V8_EXPORT_PRIVATE ConstantArrayBuilder final {
     enum class Tag : uint8_t;
 
    public:
-    explicit Entry(Smi smi) : smi_(smi), tag_(Tag::kSmi) {}
+    explicit Entry(Tagged<Smi> smi) : smi_(smi), tag_(Tag::kSmi) {}
     explicit Entry(double heap_number)
         : heap_number_(heap_number), tag_(Tag::kHeapNumber) {}
     explicit Entry(const AstRawString* raw_string)
@@ -147,7 +147,7 @@ class V8_EXPORT_PRIVATE ConstantArrayBuilder final {
       handle_ = handle;
     }
 
-    void SetJumpTableSmi(Smi smi) {
+    void SetJumpTableSmi(Tagged<Smi> smi) {
       DCHECK_EQ(tag_, Tag::kUninitializedJumpTableSmi);
       tag_ = Tag::kJumpTableSmi;
       smi_ = smi;
@@ -191,7 +191,7 @@ class V8_EXPORT_PRIVATE ConstantArrayBuilder final {
 
   index_t AllocateIndex(Entry constant_entry);
   index_t AllocateIndexArray(Entry constant_entry, size_t size);
-  index_t AllocateReservedEntry(Smi value);
+  index_t AllocateReservedEntry(Tagged<Smi> value);
 
   struct ConstantArraySlice final : public ZoneObject {
     ConstantArraySlice(Zone* zone, size_t start_index, size_t capacity,
diff --git a/deps/v8/src/interpreter/handler-table-builder.h b/deps/v8/src/interpreter/handler-table-builder.h
index d74bb656160f17..ae36ba6f5d701a 100644
--- a/deps/v8/src/interpreter/handler-table-builder.h
+++ b/deps/v8/src/interpreter/handler-table-builder.h
@@ -13,10 +13,7 @@
 namespace v8 {
 namespace internal {
 
-template <typename T>
-class Handle;
 class HandlerTable;
-class Isolate;
 
 namespace interpreter {
 
diff --git a/deps/v8/src/interpreter/interpreter-assembler.cc b/deps/v8/src/interpreter/interpreter-assembler.cc
index ef4f781b8a5322..23985ede10357f 100644
--- a/deps/v8/src/interpreter/interpreter-assembler.cc
+++ b/deps/v8/src/interpreter/interpreter-assembler.cc
@@ -826,13 +826,26 @@ TNode<Object> InterpreterAssembler::Construct(
   DCHECK(Bytecodes::MakesCallAlongCriticalPath(bytecode_));
   TVARIABLE(Object, var_result);
   TVARIABLE(AllocationSite, var_site);
-  Label return_result(this), construct_generic(this),
+  Label return_result(this), try_fast_construct(this), construct_generic(this),
       construct_array(this, &var_site);
 
   TNode<Word32T> args_count = JSParameterCount(args.reg_count());
   CollectConstructFeedback(context, target, new_target, maybe_feedback_vector,
                            slot_id, UpdateFeedbackMode::kOptionalFeedback,
-                           &construct_generic, &construct_array, &var_site);
+                           &try_fast_construct, &construct_array, &var_site);
+
+  BIND(&try_fast_construct);
+  {
+    Comment("call using FastConstruct builtin");
+    GotoIf(TaggedIsSmi(target), &construct_generic);
+    GotoIfNot(IsJSFunction(CAST(target)), &construct_generic);
+    Callable callable = Builtins::CallableFor(
+        isolate(), Builtin::kInterpreterPushArgsThenFastConstructFunction);
+    var_result =
+        CallStub(callable, context, args_count, args.base_reg_location(),
+                 target, new_target, UndefinedConstant());
+    Goto(&return_result);
+  }
 
   BIND(&construct_generic);
   {
@@ -1021,56 +1034,48 @@ InterpreterAssembler::CallRuntimeN(TNode<Uint32T> function_id,
                                    const RegListNodePair& args,
                                    int return_count);
 
-void InterpreterAssembler::UpdateInterruptBudget(TNode<Int32T> weight,
-                                                 bool backward) {
-  Comment("[ UpdateInterruptBudget");
-
-  // Assert that the weight is positive (negative weights should be implemented
-  // as backward updates).
-  CSA_DCHECK(this, Int32GreaterThanOrEqual(weight, Int32Constant(0)));
-
-  Label load_budget_from_bytecode(this), load_budget_done(this);
+TNode<Int32T> InterpreterAssembler::UpdateInterruptBudget(
+    TNode<Int32T> weight) {
   TNode<JSFunction> function = CAST(LoadRegister(Register::function_closure()));
   TNode<FeedbackCell> feedback_cell =
       LoadObjectField<FeedbackCell>(function, JSFunction::kFeedbackCellOffset);
   TNode<Int32T> old_budget = LoadObjectField<Int32T>(
       feedback_cell, FeedbackCell::kInterruptBudgetOffset);
 
-  // Make sure we include the current bytecode in the budget calculation.
-  TNode<Int32T> budget_after_bytecode =
-      Int32Sub(old_budget, Int32Constant(CurrentBytecodeSize()));
-
-  Label done(this);
-  TVARIABLE(Int32T, new_budget);
-  if (backward) {
-    // Update budget by |weight| and check if it reaches zero.
-    new_budget = Int32Sub(budget_after_bytecode, weight);
-    TNode<BoolT> condition =
-        Int32GreaterThanOrEqual(new_budget.value(), Int32Constant(0));
-    Label ok(this), interrupt_check(this, Label::kDeferred);
-    Branch(condition, &ok, &interrupt_check);
-
-    BIND(&interrupt_check);
-    // JumpLoop should do a stack check as part of the interrupt.
-    CallRuntime(bytecode() == Bytecode::kJumpLoop
-                    ? Runtime::kBytecodeBudgetInterruptWithStackCheck_Ignition
-                    : Runtime::kBytecodeBudgetInterrupt_Ignition,
-                GetContext(), function);
-    Goto(&done);
-
-    BIND(&ok);
-  } else {
-    // For a forward jump, we know we only increase the interrupt budget, so
-    // no need to check if it's below zero.
-    new_budget = Int32Add(budget_after_bytecode, weight);
-  }
-
+  // Update budget by |weight| and check if it reaches zero.
+  TNode<Int32T> new_budget = Int32Sub(old_budget, weight);
   // Update budget.
   StoreObjectFieldNoWriteBarrier(
-      feedback_cell, FeedbackCell::kInterruptBudgetOffset, new_budget.value());
+      feedback_cell, FeedbackCell::kInterruptBudgetOffset, new_budget);
+  return new_budget;
+}
+
+void InterpreterAssembler::DecreaseInterruptBudget(
+    TNode<Int32T> weight, StackCheckBehavior stack_check_behavior) {
+  Comment("[ DecreaseInterruptBudget");
+  Label done(this), interrupt_check(this);
+
+  // Assert that the weight is positive.
+  CSA_DCHECK(this, Int32GreaterThanOrEqual(weight, Int32Constant(0)));
+
+  // Make sure we include the current bytecode in the budget calculation.
+  TNode<Int32T> weight_after_bytecode =
+      Int32Add(weight, Int32Constant(CurrentBytecodeSize()));
+  TNode<Int32T> new_budget = UpdateInterruptBudget(weight_after_bytecode);
+  Branch(Int32GreaterThanOrEqual(new_budget, Int32Constant(0)), &done,
+         &interrupt_check);
+
+  BIND(&interrupt_check);
+  TNode<JSFunction> function = CAST(LoadRegister(Register::function_closure()));
+  CallRuntime(stack_check_behavior == kEnableStackCheck
+                  ? Runtime::kBytecodeBudgetInterruptWithStackCheck_Ignition
+                  : Runtime::kBytecodeBudgetInterrupt_Ignition,
+              GetContext(), function);
   Goto(&done);
+
   BIND(&done);
-  Comment("] UpdateInterruptBudget");
+
+  Comment("] DecreaseInterruptBudget");
 }
 
 TNode<IntPtrT> InterpreterAssembler::Advance() {
@@ -1081,33 +1086,31 @@ TNode<IntPtrT> InterpreterAssembler::Advance(int delta) {
   return Advance(IntPtrConstant(delta));
 }
 
-TNode<IntPtrT> InterpreterAssembler::Advance(TNode<IntPtrT> delta,
-                                             bool backward) {
-#ifdef V8_TRACE_UNOPTIMIZED
-  TraceBytecode(Runtime::kTraceUnoptimizedBytecodeExit);
-#endif
-  TNode<IntPtrT> next_offset = backward ? IntPtrSub(BytecodeOffset(), delta)
-                                        : IntPtrAdd(BytecodeOffset(), delta);
+TNode<IntPtrT> InterpreterAssembler::Advance(TNode<IntPtrT> delta) {
+  TNode<IntPtrT> next_offset = IntPtrAdd(BytecodeOffset(), delta);
   bytecode_offset_ = next_offset;
   return next_offset;
 }
 
-void InterpreterAssembler::Jump(TNode<IntPtrT> jump_offset, bool backward) {
+void InterpreterAssembler::JumpToOffset(TNode<IntPtrT> new_bytecode_offset) {
   DCHECK(!Bytecodes::IsStarLookahead(bytecode_, operand_scale_));
-
-  UpdateInterruptBudget(TruncateIntPtrToInt32(jump_offset), backward);
-  TNode<IntPtrT> new_bytecode_offset = Advance(jump_offset, backward);
+#ifdef V8_TRACE_UNOPTIMIZED
+  TraceBytecode(Runtime::kTraceUnoptimizedBytecodeExit);
+#endif
+  bytecode_offset_ = new_bytecode_offset;
   TNode<RawPtrT> target_bytecode =
       UncheckedCast<RawPtrT>(LoadBytecode(new_bytecode_offset));
   DispatchToBytecode(target_bytecode, new_bytecode_offset);
 }
 
 void InterpreterAssembler::Jump(TNode<IntPtrT> jump_offset) {
-  Jump(jump_offset, false);
+  JumpToOffset(IntPtrAdd(BytecodeOffset(), jump_offset));
 }
 
 void InterpreterAssembler::JumpBackward(TNode<IntPtrT> jump_offset) {
-  Jump(jump_offset, true);
+  DecreaseInterruptBudget(TruncateIntPtrToInt32(jump_offset),
+                          kEnableStackCheck);
+  JumpToOffset(IntPtrSub(BytecodeOffset(), jump_offset));
 }
 
 void InterpreterAssembler::JumpConditional(TNode<BoolT> condition,
@@ -1334,7 +1337,7 @@ void InterpreterAssembler::UpdateInterruptBudgetOnReturn() {
   TNode<Int32T> profiling_weight =
       Int32Sub(TruncateIntPtrToInt32(BytecodeOffset()),
                Int32Constant(kFirstBytecodeOffset));
-  UpdateInterruptBudget(profiling_weight, true);
+  DecreaseInterruptBudget(profiling_weight, kDisableStackCheck);
 }
 
 TNode<Int8T> InterpreterAssembler::LoadOsrState(
@@ -1370,13 +1373,13 @@ void InterpreterAssembler::OnStackReplacement(
     OnStackReplacementParams params) {
   // Three cases may cause us to attempt OSR, in the following order:
   //
-  // 1) Presence of cached OSR Turbofan code.
+  // 1) Presence of cached OSR Turbofan/Maglev code.
   // 2) Presence of cached OSR Sparkplug code.
   // 3) The OSR urgency exceeds the current loop depth - in that case, trigger
   //    a Turbofan OSR compilation.
 
   TVARIABLE(Object, maybe_target_code, SmiConstant(0));
-  Label osr_to_turbofan(this), osr_to_sparkplug(this);
+  Label osr_to_opt(this), osr_to_sparkplug(this);
 
   // Case 1).
   {
@@ -1388,7 +1391,7 @@ void InterpreterAssembler::OnStackReplacement(
 
     // Is it marked_for_deoptimization? If yes, clear the slot.
     GotoIfNot(IsMarkedForDeoptimization(CAST(maybe_target_code.value())),
-              &osr_to_turbofan);
+              &osr_to_opt);
     StoreFeedbackVectorSlot(feedback_vector, Unsigned(feedback_slot),
                             ClearedValue(), UNSAFE_SKIP_WRITE_BARRIER);
     maybe_target_code = SmiConstant(0);
@@ -1414,15 +1417,21 @@ void InterpreterAssembler::OnStackReplacement(
       static_assert(FeedbackVector::OsrUrgencyBits::kShift == 0);
       TNode<Int32T> osr_urgency = Word32And(
           osr_state, Int32Constant(FeedbackVector::OsrUrgencyBits::kMask));
-      GotoIf(Uint32LessThan(loop_depth, osr_urgency), &osr_to_turbofan);
+      GotoIf(Uint32LessThan(loop_depth, osr_urgency), &osr_to_opt);
       JumpBackward(relative_jump);
     }
   }
 
-  BIND(&osr_to_turbofan);
+  BIND(&osr_to_opt);
   {
+    TNode<Uint32T> length =
+        LoadAndUntagFixedArrayBaseLengthAsUint32(BytecodeArrayTaggedPointer());
+    TNode<Uint32T> weight =
+        Uint32Mul(length, Uint32Constant(v8_flags.osr_to_tierup));
+    DecreaseInterruptBudget(Signed(weight), kDisableStackCheck);
     Callable callable = CodeFactory::InterpreterOnStackReplacement(isolate());
     CallStub(callable, context, maybe_target_code.value());
+    UpdateInterruptBudget(Int32Mul(Signed(weight), Int32Constant(-1)));
     JumpBackward(relative_jump);
   }
 
diff --git a/deps/v8/src/interpreter/interpreter-assembler.h b/deps/v8/src/interpreter/interpreter-assembler.h
index 4a5c165f58c2d7..1aa9a9ba34c9f7 100644
--- a/deps/v8/src/interpreter/interpreter-assembler.h
+++ b/deps/v8/src/interpreter/interpreter-assembler.h
@@ -9,6 +9,7 @@
 #include "src/common/globals.h"
 #include "src/interpreter/bytecode-register.h"
 #include "src/interpreter/bytecodes.h"
+#include "src/objects/bytecode-array.h"
 #include "src/runtime/runtime.h"
 
 namespace v8 {
@@ -252,6 +253,18 @@ class V8_EXPORT_PRIVATE InterpreterAssembler : public CodeStubAssembler {
   // Updates the profiler interrupt budget for a return.
   void UpdateInterruptBudgetOnReturn();
 
+  // Adjusts the interrupt budget by the provided weight. Returns the new
+  // budget.
+  TNode<Int32T> UpdateInterruptBudget(TNode<Int32T> weight);
+  // Decrements the bytecode array's interrupt budget by a 32-bit unsigned
+  // |weight| and calls Runtime::kInterrupt if counter reaches zero.
+  enum StackCheckBehavior {
+    kEnableStackCheck,
+    kDisableStackCheck,
+  };
+  void DecreaseInterruptBudget(TNode<Int32T> weight,
+                               StackCheckBehavior stack_check_behavior);
+
   TNode<Int8T> LoadOsrState(TNode<FeedbackVector> feedback_vector);
 
   // Dispatch to the bytecode.
@@ -346,11 +359,6 @@ class V8_EXPORT_PRIVATE InterpreterAssembler : public CodeStubAssembler {
   // Traces the current bytecode by calling |function_id|.
   void TraceBytecode(Runtime::FunctionId function_id);
 
-  // Updates the bytecode array's interrupt budget by a 32-bit unsigned |weight|
-  // and calls Runtime::kInterrupt if counter reaches zero. If |backward|, then
-  // the interrupt budget is decremented, otherwise it is incremented.
-  void UpdateInterruptBudget(TNode<Int32T> weight, bool backward);
-
   // Returns the offset of register |index| relative to RegisterFilePointer().
   TNode<IntPtrT> RegisterFrameOffset(TNode<IntPtrT> index);
 
@@ -389,10 +397,8 @@ class V8_EXPORT_PRIVATE InterpreterAssembler : public CodeStubAssembler {
   // pool element.
   TNode<UintPtrT> BytecodeOperandConstantPoolIdx(int operand_index);
 
-  // Jump relative to the current bytecode by the |jump_offset|. If |backward|,
-  // then jump backward (subtract the offset), otherwise jump forward (add the
-  // offset). Helper function for Jump and JumpBackward.
-  void Jump(TNode<IntPtrT> jump_offset, bool backward);
+  // Jump to a specific bytecode offset.
+  void JumpToOffset(TNode<IntPtrT> new_bytecode_offset);
 
   // Jump forward relative to the current bytecode by |jump_offset| if the
   // |condition| is true. Helper function for JumpIfTaggedEqual and
@@ -424,7 +430,7 @@ class V8_EXPORT_PRIVATE InterpreterAssembler : public CodeStubAssembler {
   // Updates and returns BytecodeOffset() advanced by delta bytecodes.
   // Traces the exit of the current bytecode.
   TNode<IntPtrT> Advance(int delta);
-  TNode<IntPtrT> Advance(TNode<IntPtrT> delta, bool backward = false);
+  TNode<IntPtrT> Advance(TNode<IntPtrT> delta);
 
   // Look ahead for short Star and inline it in a branch, including subsequent
   // dispatch. Anything after this point can assume that the following
diff --git a/deps/v8/src/interpreter/interpreter-generator.cc b/deps/v8/src/interpreter/interpreter-generator.cc
index 672ec482d49009..4ec9c4c8054a5e 100644
--- a/deps/v8/src/interpreter/interpreter-generator.cc
+++ b/deps/v8/src/interpreter/interpreter-generator.cc
@@ -1171,7 +1171,7 @@ IGNITION_HANDLER(ToName, InterpreterAssembler) {
   TNode<Object> object = GetAccumulator();
   TNode<Context> context = GetContext();
   TNode<Object> result = CallBuiltin(Builtin::kToName, context, object);
-  StoreRegisterAtOperandIndex(result, 0);
+  SetAccumulator(result);
   Dispatch();
 }
 
@@ -1208,6 +1208,29 @@ IGNITION_HANDLER(ToString, InterpreterAssembler) {
   Dispatch();
 }
 
+// ToString
+//
+// Convert the accumulator to a String.
+IGNITION_HANDLER(ToBoolean, InterpreterAssembler) {
+  TNode<Object> value = GetAccumulator();
+  TVARIABLE(Boolean, result);
+  Label if_true(this), if_false(this), end(this);
+  BranchIfToBooleanIsTrue(value, &if_true, &if_false);
+  BIND(&if_true);
+  {
+    result = TrueConstant();
+    Goto(&end);
+  }
+  BIND(&if_false);
+  {
+    result = FalseConstant();
+    Goto(&end);
+  }
+  BIND(&end);
+  SetAccumulator(result.value());
+  Dispatch();
+}
+
 // Inc
 //
 // Increments value in the accumulator by one.
@@ -1252,7 +1275,7 @@ IGNITION_HANDLER(Dec, InterpreterAssembler) {
 // accumulator to a boolean value if required.
 IGNITION_HANDLER(ToBooleanLogicalNot, InterpreterAssembler) {
   TNode<Object> value = GetAccumulator();
-  TVARIABLE(Oddball, result);
+  TVARIABLE(Boolean, result);
   Label if_true(this), if_false(this), end(this);
   BranchIfToBooleanIsTrue(value, &if_true, &if_false);
   BIND(&if_true);
@@ -1276,10 +1299,10 @@ IGNITION_HANDLER(ToBooleanLogicalNot, InterpreterAssembler) {
 // value.
 IGNITION_HANDLER(LogicalNot, InterpreterAssembler) {
   TNode<Object> value = GetAccumulator();
-  TVARIABLE(Oddball, result);
+  TVARIABLE(Boolean, result);
   Label if_true(this), if_false(this), end(this);
-  TNode<Oddball> true_value = TrueConstant();
-  TNode<Oddball> false_value = FalseConstant();
+  TNode<True> true_value = TrueConstant();
+  TNode<False> false_value = FalseConstant();
   Branch(TaggedEqual(value, true_value), &if_true, &if_false);
   BIND(&if_true);
   {
@@ -1521,6 +1544,7 @@ IGNITION_HANDLER(CallRuntimeForPair, InterpreterAssembler) {
   TNode<Object> result0 = Projection<0>(result_pair);
   TNode<Object> result1 = Projection<1>(result_pair);
   StoreRegisterPairAtOperandIndex(result0, result1, 3);
+  ClobberAccumulator(result0);
   Dispatch();
 }
 
@@ -1607,7 +1631,7 @@ class InterpreterCompareOpAssembler : public InterpreterAssembler {
     TNode<Context> context = GetContext();
 
     TVARIABLE(Smi, var_type_feedback);
-    TNode<Oddball> result;
+    TNode<Boolean> result;
     switch (compare_op) {
       case Operation::kEqual:
         result = Equal(lhs, rhs, context, &var_type_feedback);
@@ -1688,7 +1712,7 @@ IGNITION_HANDLER(TestGreaterThanOrEqual, InterpreterCompareOpAssembler) {
 IGNITION_HANDLER(TestReferenceEqual, InterpreterAssembler) {
   TNode<Object> lhs = LoadRegisterAtOperandIndex(0);
   TNode<Object> rhs = GetAccumulator();
-  TNode<Oddball> result = SelectBooleanConstant(TaggedEqual(lhs, rhs));
+  TNode<Boolean> result = SelectBooleanConstant(TaggedEqual(lhs, rhs));
   SetAccumulator(result);
   Dispatch();
 }
@@ -1743,7 +1767,7 @@ IGNITION_HANDLER(TestUndetectable, InterpreterAssembler) {
   GotoIf(TaggedIsSmi(object), &end);
 
   // If it is a HeapObject, load the map and check for undetectable bit.
-  TNode<Oddball> result =
+  TNode<Boolean> result =
       SelectBooleanConstant(IsUndetectableMap(LoadMap(CAST(object))));
   SetAccumulator(result);
   Goto(&end);
@@ -1757,7 +1781,7 @@ IGNITION_HANDLER(TestUndetectable, InterpreterAssembler) {
 // Test if the value in accumulator is strictly equal to null.
 IGNITION_HANDLER(TestNull, InterpreterAssembler) {
   TNode<Object> object = GetAccumulator();
-  TNode<Oddball> result =
+  TNode<Boolean> result =
       SelectBooleanConstant(TaggedEqual(object, NullConstant()));
   SetAccumulator(result);
   Dispatch();
@@ -1768,7 +1792,7 @@ IGNITION_HANDLER(TestNull, InterpreterAssembler) {
 // Test if the value in the accumulator is strictly equal to undefined.
 IGNITION_HANDLER(TestUndefined, InterpreterAssembler) {
   TNode<Object> object = GetAccumulator();
-  TNode<Oddball> result =
+  TNode<Boolean> result =
       SelectBooleanConstant(TaggedEqual(object, UndefinedConstant()));
   SetAccumulator(result);
   Dispatch();
@@ -2183,8 +2207,11 @@ IGNITION_HANDLER(JumpLoop, InterpreterAssembler) {
   Label maybe_osr_because_osr_state(this, Label::kDeferred);
   // The quick initial OSR check. If it passes, we proceed on to more expensive
   // OSR logic.
-  static_assert(FeedbackVector::MaybeHasOptimizedOsrCodeBit::encode(true) >
+  static_assert(FeedbackVector::MaybeHasMaglevOsrCodeBit::encode(true) >
+                FeedbackVector::kMaxOsrUrgency);
+  static_assert(FeedbackVector::MaybeHasTurbofanOsrCodeBit::encode(true) >
                 FeedbackVector::kMaxOsrUrgency);
+
   GotoIfNot(Uint32GreaterThanOrEqual(loop_depth, osr_state),
             &maybe_osr_because_osr_state);
 
@@ -2200,6 +2227,8 @@ IGNITION_HANDLER(JumpLoop, InterpreterAssembler) {
   BIND(&ok);
 #endif  // !V8_JITLESS
 
+  ClobberAccumulator(UndefinedConstant());
+
   // The backward jump can trigger a budget interrupt, which can handle stack
   // interrupts, so we don't need to explicitly handle them here.
   JumpBackward(relative_jump);
@@ -2807,9 +2836,8 @@ IGNITION_HANDLER(FindNonDefaultConstructorOrConstruct, InterpreterAssembler) {
 
   TNode<JSFunction> this_function = CAST(LoadRegisterAtOperandIndex(0));
 
-  FindNonDefaultConstructorOrConstruct(context, this_function, constructor,
-                                       &found_default_base_ctor,
-                                       &found_something_else);
+  FindNonDefaultConstructor(this_function, constructor,
+                            &found_default_base_ctor, &found_something_else);
 
   BIND(&found_default_base_ctor);
   {
@@ -2835,7 +2863,9 @@ IGNITION_HANDLER(FindNonDefaultConstructorOrConstruct, InterpreterAssembler) {
 // Call runtime to handle debugger statement.
 IGNITION_HANDLER(Debugger, InterpreterAssembler) {
   TNode<Context> context = GetContext();
-  CallRuntime(Runtime::kHandleDebuggerStatement, context);
+  TNode<Object> result =
+      CallRuntime(Runtime::kHandleDebuggerStatement, context);
+  ClobberAccumulator(result);
   Dispatch();
 }
 
@@ -3070,7 +3100,6 @@ IGNITION_HANDLER(SuspendGenerator, InterpreterAssembler) {
   StoreObjectField(generator, JSGeneratorObject::kInputOrDebugPosOffset,
                    offset);
 
-  UpdateInterruptBudgetOnReturn();
   Return(GetAccumulator());
 }
 
diff --git a/deps/v8/src/interpreter/interpreter.cc b/deps/v8/src/interpreter/interpreter.cc
index a39483f7684483..a3339f3d5a2a95 100644
--- a/deps/v8/src/interpreter/interpreter.cc
+++ b/deps/v8/src/interpreter/interpreter.cc
@@ -111,18 +111,19 @@ Builtin BuiltinIndexFromBytecode(Bytecode bytecode,
 
 }  // namespace
 
-Code Interpreter::GetBytecodeHandler(Bytecode bytecode,
-                                     OperandScale operand_scale) {
+Tagged<Code> Interpreter::GetBytecodeHandler(Bytecode bytecode,
+                                             OperandScale operand_scale) {
   Builtin builtin = BuiltinIndexFromBytecode(bytecode, operand_scale);
   return isolate_->builtins()->code(builtin);
 }
 
 void Interpreter::SetBytecodeHandler(Bytecode bytecode,
-                                     OperandScale operand_scale, Code handler) {
-  DCHECK(!handler.has_instruction_stream());
-  DCHECK(handler.kind() == CodeKind::BYTECODE_HANDLER);
+                                     OperandScale operand_scale,
+                                     Tagged<Code> handler) {
+  DCHECK(!handler->has_instruction_stream());
+  DCHECK(handler->kind() == CodeKind::BYTECODE_HANDLER);
   size_t index = GetDispatchTableIndex(bytecode, operand_scale);
-  dispatch_table_[index] = handler.InstructionStart();
+  dispatch_table_[index] = handler->instruction_start();
 }
 
 // static
@@ -194,7 +195,7 @@ InterpreterCompilationJob::Status InterpreterCompilationJob::ExecuteJobImpl() {
     MaybePrintAst(parse_info(), compilation_info());
   }
 
-  ParkedScope parked_scope(local_isolate_);
+  ParkedScopeIfOnBackground parked_scope(local_isolate_);
 
   generator()->GenerateBytecode(stack_limit());
 
@@ -226,10 +227,10 @@ void InterpreterCompilationJob::CheckAndPrintBytecodeMismatch(
     } else {
       std::cerr << "anonymous";
     }
-    Object script_name = script->GetNameOrSourceURL();
-    if (script_name.IsString()) {
+    Tagged<Object> script_name = script->GetNameOrSourceURL();
+    if (IsString(script_name)) {
       std::cerr << " ";
-      String::cast(script_name).PrintUC16(std::cerr);
+      String::cast(script_name)->PrintUC16(std::cerr);
       std::cerr << ":" << parse_info()->literal()->start_position();
     }
 #endif
@@ -343,12 +344,12 @@ void Interpreter::Initialize() {
   Handle<Code> code = BUILTIN_CODE(isolate_, InterpreterEntryTrampoline);
   DCHECK(builtins->is_initialized());
   DCHECK(!code->has_instruction_stream());
-  interpreter_entry_trampoline_instruction_start_ = code->InstructionStart();
+  interpreter_entry_trampoline_instruction_start_ = code->instruction_start();
 
   // Initialize the dispatch table.
   ForEachBytecode([=](Bytecode bytecode, OperandScale operand_scale) {
     Builtin builtin = BuiltinIndexFromBytecode(bytecode, operand_scale);
-    Code handler = builtins->code(builtin);
+    Tagged<Code> handler = builtins->code(builtin);
     if (Bytecodes::BytecodeHasHandler(bytecode, operand_scale)) {
 #ifdef DEBUG
       std::string builtin_name(Builtins::name(builtin));
diff --git a/deps/v8/src/interpreter/interpreter.h b/deps/v8/src/interpreter/interpreter.h
index 59c88097e2c4e5..5657e2d3e0130d 100644
--- a/deps/v8/src/interpreter/interpreter.h
+++ b/deps/v8/src/interpreter/interpreter.h
@@ -62,12 +62,12 @@ class Interpreter {
 
   // If the bytecode handler for |bytecode| and |operand_scale| has not yet
   // been loaded, deserialize it. Then return the handler.
-  V8_EXPORT_PRIVATE Code GetBytecodeHandler(Bytecode bytecode,
-                                            OperandScale operand_scale);
+  V8_EXPORT_PRIVATE Tagged<Code> GetBytecodeHandler(Bytecode bytecode,
+                                                    OperandScale operand_scale);
 
   // Set the bytecode handler for |bytecode| and |operand_scale|.
   void SetBytecodeHandler(Bytecode bytecode, OperandScale operand_scale,
-                          Code handler);
+                          Tagged<Code> handler);
 
   V8_EXPORT_PRIVATE Handle<JSObject> GetDispatchCountersObject();
 
diff --git a/deps/v8/src/json/json-parser.cc b/deps/v8/src/json/json-parser.cc
index 4f8924d334a245..28e18d6195d343 100644
--- a/deps/v8/src/json/json-parser.cc
+++ b/deps/v8/src/json/json-parser.cc
@@ -127,7 +127,7 @@ static const constexpr uint8_t character_json_scan_flags[256] = {
 MaybeHandle<Object> JsonParseInternalizer::Internalize(
     Isolate* isolate, Handle<Object> result, Handle<Object> reviver,
     Handle<String> source, MaybeHandle<Object> val_node) {
-  DCHECK(reviver->IsCallable());
+  DCHECK(IsCallable(*reviver));
   JsonParseInternalizer internalizer(isolate, Handle<JSReceiver>::cast(reviver),
                                      source);
   Handle<JSObject> holder =
@@ -148,7 +148,7 @@ MaybeHandle<Object> JsonParseInternalizer::InternalizeJsonProperty(
     Handle<Object> snapshot) {
   DCHECK_EQ(with_source == kWithSource,
             !val_node.is_null() && !snapshot.is_null());
-  DCHECK(reviver_->IsCallable());
+  DCHECK(IsCallable(*reviver_));
   HandleScope outer_scope(isolate_);
   Handle<Object> value;
   ASSIGN_RETURN_ON_EXCEPTION(
@@ -160,9 +160,9 @@ MaybeHandle<Object> JsonParseInternalizer::InternalizeJsonProperty(
   //
   // When with_source == kWithoutSource, this is unused.
   bool pass_source_to_reviver =
-      with_source == kWithSource && value->SameValue(*snapshot);
+      with_source == kWithSource && Object::SameValue(*value, *snapshot);
 
-  if (value->IsJSReceiver()) {
+  if (IsJSReceiver(*value)) {
     Handle<JSReceiver> object = Handle<JSReceiver>::cast(value);
     Maybe<bool> is_array = Object::IsArray(object);
     if (is_array.IsNothing()) return MaybeHandle<Object>();
@@ -171,7 +171,7 @@ MaybeHandle<Object> JsonParseInternalizer::InternalizeJsonProperty(
       ASSIGN_RETURN_ON_EXCEPTION(
           isolate_, length_object,
           Object::GetLengthFromArrayLike(isolate_, object), Object);
-      double length = length_object->Number();
+      double length = Object::Number(*length_object);
       if (pass_source_to_reviver) {
         Handle<FixedArray> val_nodes_and_snapshots =
             Handle<FixedArray>::cast(val_node);
@@ -233,7 +233,7 @@ MaybeHandle<Object> JsonParseInternalizer::InternalizeJsonProperty(
           // object had new properties added that are not in the snapshotted
           // contents.
           const bool rv =
-              !property_snapshot->IsTheHole()
+              !IsTheHole(*property_snapshot)
                   ? RecurseAndApply<kWithSource>(
                         object, key_name, property_val_node, property_snapshot)
                   : RecurseAndApply<kWithoutSource>(
@@ -259,7 +259,7 @@ MaybeHandle<Object> JsonParseInternalizer::InternalizeJsonProperty(
   if (v8_flags.harmony_json_parse_with_source) {
     Handle<JSObject> context =
         isolate_->factory()->NewJSObject(isolate_->object_function());
-    if (pass_source_to_reviver && val_node->IsString()) {
+    if (pass_source_to_reviver && IsString(*val_node)) {
       JSReceiver::CreateDataProperty(isolate_, context,
                                      isolate_->factory()->source_string(),
                                      val_node, Just(kThrowOnError))
@@ -284,14 +284,14 @@ bool JsonParseInternalizer::RecurseAndApply(Handle<JSReceiver> holder,
                                             Handle<Object> val_node,
                                             Handle<Object> snapshot) {
   STACK_CHECK(isolate_, false);
-  DCHECK(reviver_->IsCallable());
+  DCHECK(IsCallable(*reviver_));
   Handle<Object> result;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate_, result,
       InternalizeJsonProperty<with_source>(holder, name, val_node, snapshot),
       false);
   Maybe<bool> change_result = Nothing<bool>();
-  if (result->IsUndefined(isolate_)) {
+  if (IsUndefined(*result, isolate_)) {
     change_result = JSReceiver::DeletePropertyOrElement(holder, name,
                                                         LanguageMode::kSloppy);
   } else {
@@ -316,12 +316,12 @@ JsonParser<Char>::JsonParser(Isolate* isolate, Handle<String> source)
   size_t start = 0;
   size_t length = source->length();
   PtrComprCageBase cage_base(isolate);
-  if (source->IsSlicedString(cage_base)) {
-    SlicedString string = SlicedString::cast(*source);
-    start = string.offset();
-    String parent = string.parent(cage_base);
-    if (parent.IsThinString(cage_base))
-      parent = ThinString::cast(parent).actual(cage_base);
+  if (IsSlicedString(*source, cage_base)) {
+    Tagged<SlicedString> string = SlicedString::cast(*source);
+    start = string->offset();
+    Tagged<String> parent = string->parent(cage_base);
+    if (IsThinString(parent, cage_base))
+      parent = ThinString::cast(parent)->actual(cage_base);
     source_ = handle(parent, isolate);
   } else {
     source_ = String::Flatten(isolate, source);
@@ -329,13 +329,13 @@ JsonParser<Char>::JsonParser(Isolate* isolate, Handle<String> source)
 
   if (StringShape(*source_, cage_base).IsExternal()) {
     chars_ = static_cast<const Char*>(
-        SeqExternalString::cast(*source_).GetChars(cage_base));
+        SeqExternalString::cast(*source_)->GetChars(cage_base));
     chars_may_relocate_ = false;
   } else {
     DisallowGarbageCollection no_gc;
     isolate->main_thread_local_heap()->AddGCEpilogueCallback(
         UpdatePointersCallback, this);
-    chars_ = SeqString::cast(*source_).GetChars(no_gc);
+    chars_ = SeqString::cast(*source_)->GetChars(no_gc);
     chars_may_relocate_ = true;
   }
   cursor_ = chars_ + start;
@@ -346,8 +346,8 @@ template <typename Char>
 bool JsonParser<Char>::IsSpecialString() {
   // The special cases are undefined, NaN, Infinity, and {} being passed to the
   // parse method
-  int offset = original_source_->IsSlicedString()
-                   ? SlicedString::cast(*original_source_).offset()
+  int offset = IsSlicedString(*original_source_)
+                   ? SlicedString::cast(*original_source_)->offset()
                    : 0;
   size_t length = original_source_->length();
 #define CASES(V)       \
@@ -435,6 +435,36 @@ MessageTemplate JsonParser<Char>::LookUpErrorMessageForJsonToken(
   return message;
 }
 
+template <typename Char>
+void JsonParser<Char>::CalculateFileLocation(Handle<Object>& line,
+                                             Handle<Object>& column) {
+  // JSON allows only \r and \n as line terminators.
+  // (See https://www.json.org/json-en.html - "whitespace")
+  int line_number = 1;
+  const Char* start =
+      chars_ + (IsSlicedString(*original_source_)
+                    ? SlicedString::cast(*original_source_)->offset()
+                    : 0);
+  const Char* last_line_break = start;
+  const Char* cursor = start;
+  const Char* end = cursor_;  // cursor_ points to the position of the error.
+  for (; cursor < end; ++cursor) {
+    if (*cursor == '\r' && cursor < end - 1 && cursor[1] == '\n') {
+      // \r\n counts as a single line terminator, as of
+      // https://tc39.es/ecma262/#sec-line-terminators. JSON itself does not
+      // have a notion of lines or line terminators.
+      ++cursor;
+    }
+    if (*cursor == '\r' || *cursor == '\n') {
+      ++line_number;
+      last_line_break = cursor + 1;
+    }
+  }
+  int column_number = 1 + static_cast<int>(cursor - last_line_break);
+  line = handle(Smi::FromInt(line_number), isolate());
+  column = handle(Smi::FromInt(column_number), isolate());
+}
+
 template <typename Char>
 void JsonParser<Char>::ReportUnexpectedToken(
     JsonToken token, base::Optional<MessageTemplate> errorMessage) {
@@ -443,29 +473,28 @@ void JsonParser<Char>::ReportUnexpectedToken(
 
   // Parse failed. Current character is the unexpected token.
   Factory* factory = this->factory();
-  int offset = original_source_->IsSlicedString()
-                   ? SlicedString::cast(*original_source_).offset()
+  int offset = IsSlicedString(*original_source_)
+                   ? SlicedString::cast(*original_source_)->offset()
                    : 0;
   int pos = position() - offset;
   Handle<Object> arg(Smi::FromInt(pos), isolate());
   Handle<Object> arg2;
+  Handle<Object> arg3;
+  CalculateFileLocation(arg2, arg3);
 
   MessageTemplate message =
       errorMessage ? errorMessage.value()
                    : LookUpErrorMessageForJsonToken(token, arg, arg2, pos);
 
   Handle<Script> script(factory->NewScript(original_source_));
-  if (isolate()->NeedsSourcePositionsForProfiling()) {
-    Script::InitLineEnds(isolate(), script);
-  }
-
+  DCHECK_IMPLIES(isolate_->NeedsSourcePositions(), script->has_line_ends());
   DebuggableStackFrameIterator it(isolate_);
   if (!it.done() && it.is_javascript()) {
     FrameSummary summary = it.GetTopValidFrame();
     script->set_eval_from_shared(summary.AsJavaScript().function()->shared());
-    if (summary.script()->IsScript()) {
+    if (IsScript(*summary.script())) {
       script->set_origin_options(
-          Script::cast(*summary.script()).origin_options());
+          Script::cast(*summary.script())->origin_options());
     }
   }
 
@@ -473,7 +502,8 @@ void JsonParser<Char>::ReportUnexpectedToken(
   // separated source file.
   isolate()->debug()->OnCompileError(script);
   MessageLocation location(script, pos, pos + 1);
-  isolate()->ThrowAt(factory->NewSyntaxError(message, arg, arg2), &location);
+  isolate()->ThrowAt(factory->NewSyntaxError(message, arg, arg2, arg3),
+                     &location);
 
   // Move the cursor to the end so we won't be able to proceed parsing.
   cursor_ = end_;
@@ -509,7 +539,7 @@ template <typename Char>
 MaybeHandle<Object> JsonParser<Char>::ParseJson(Handle<Object> reviver) {
   Handle<Object> result;
   // Only record the val node when reviver is callable.
-  bool reviver_is_callable = reviver->IsCallable();
+  bool reviver_is_callable = IsCallable(*reviver);
   bool should_track_json_source =
       v8_flags.harmony_json_parse_with_source && reviver_is_callable;
   if (should_track_json_source) {
@@ -653,8 +683,8 @@ Handle<Object> JsonParser<Char>::BuildJsonObject(
       Handle<FixedArray> elms =
           factory()->NewFixedArrayWithHoles(cont.max_index + 1);
       DisallowGarbageCollection no_gc;
-      FixedArray raw_elements = *elms;
-      WriteBarrierMode mode = raw_elements.GetWriteBarrierMode(no_gc);
+      Tagged<FixedArray> raw_elements = *elms;
+      WriteBarrierMode mode = raw_elements->GetWriteBarrierMode(no_gc);
       DCHECK_EQ(HOLEY_ELEMENTS, map->elements_kind());
 
       for (int i = 0; i < length; i++) {
@@ -662,7 +692,7 @@ Handle<Object> JsonParser<Char>::BuildJsonObject(
         if (!property.string.is_index()) continue;
         uint32_t index = property.string.index();
         Handle<Object> value = property.value;
-        raw_elements.set(static_cast<int>(index), *value, mode);
+        raw_elements->set(static_cast<int>(index), *value, mode);
       }
       elements = elms;
     }
@@ -673,13 +703,13 @@ Handle<Object> JsonParser<Char>::BuildJsonObject(
   int feedback_descriptors = 0;
   if (!feedback.is_null()) {
     DisallowGarbageCollection no_gc;
-    auto raw_feedback = *feedback;
-    auto raw_map = *map;
+    Tagged<Map> raw_feedback = *feedback;
+    Tagged<Map> raw_map = *map;
     feedback_descriptors =
-        (raw_feedback.elements_kind() != raw_map.elements_kind() ||
-         raw_feedback.instance_size() != raw_map.instance_size())
+        (raw_feedback->elements_kind() != raw_map->elements_kind() ||
+         raw_feedback->instance_size() != raw_map->instance_size())
             ? 0
-            : raw_feedback.NumberOfOwnDescriptors();
+            : raw_feedback->NumberOfOwnDescriptors();
   }
 
   int i;
@@ -693,7 +723,7 @@ Handle<Object> JsonParser<Char>::BuildJsonObject(
     InternalIndex descriptor_index(descriptor);
     if (descriptor < feedback_descriptors) {
       expected =
-          handle(String::cast(feedback->instance_descriptors(isolate_).GetKey(
+          handle(String::cast(feedback->instance_descriptors(isolate_)->GetKey(
                      descriptor_index)),
                  isolate_);
     } else {
@@ -725,37 +755,38 @@ Handle<Object> JsonParser<Char>::BuildJsonObject(
     Handle<Object> value = property.value;
 
     PropertyDetails details =
-        target->instance_descriptors(isolate_).GetDetails(descriptor_index);
+        target->instance_descriptors(isolate_)->GetDetails(descriptor_index);
     Representation expected_representation = details.representation();
 
-    if (!value->FitsRepresentation(expected_representation)) {
-      Representation representation = value->OptimalRepresentation(isolate());
+    if (!Object::FitsRepresentation(*value, expected_representation)) {
+      Representation representation =
+          Object::OptimalRepresentation(*value, isolate());
       representation = representation.generalize(expected_representation);
       if (!expected_representation.CanBeInPlaceChangedTo(representation)) {
         map = ParentOfDescriptorOwner(isolate_, map, target, descriptor);
         break;
       }
       Handle<FieldType> value_type =
-          value->OptimalType(isolate(), representation);
+          Object::OptimalType(*value, isolate(), representation);
       MapUpdater::GeneralizeField(isolate(), target, descriptor_index,
                                   details.constness(), representation,
                                   value_type);
     } else if (expected_representation.IsHeapObject() &&
                !target->instance_descriptors(isolate())
-                    .GetFieldType(descriptor_index)
-                    .NowContains(value)) {
+                    ->GetFieldType(descriptor_index)
+                    ->NowContains(value)) {
       Handle<FieldType> value_type =
-          value->OptimalType(isolate(), expected_representation);
+          Object::OptimalType(*value, isolate(), expected_representation);
       MapUpdater::GeneralizeField(isolate(), target, descriptor_index,
                                   details.constness(), expected_representation,
                                   value_type);
-    } else if (expected_representation.IsDouble() && value->IsSmi()) {
+    } else if (expected_representation.IsDouble() && IsSmi(*value)) {
       new_mutable_double++;
     }
 
     DCHECK(target->instance_descriptors(isolate())
-               .GetFieldType(descriptor_index)
-               .NowContains(value));
+               ->GetFieldType(descriptor_index)
+               ->NowContains(value));
     map = target;
     descriptor++;
   }
@@ -784,9 +815,9 @@ Handle<Object> JsonParser<Char>::BuildJsonObject(
   {
     descriptor = 0;
     DisallowGarbageCollection no_gc;
-    auto raw_object = *object;
-    auto raw_map = *map;
-    WriteBarrierMode mode = raw_object.GetWriteBarrierMode(no_gc);
+    Tagged<JSObject> raw_object = *object;
+    Tagged<Map> raw_map = *map;
+    WriteBarrierMode mode = raw_object->GetWriteBarrierMode(no_gc);
     Address mutable_double_address =
         mutable_double_buffer.is_null()
             ? 0
@@ -805,17 +836,18 @@ Handle<Object> JsonParser<Char>::BuildJsonObject(
       if (property.string.is_index()) continue;
       InternalIndex descriptor_index(descriptor);
       PropertyDetails details =
-          raw_map.instance_descriptors(isolate()).GetDetails(descriptor_index);
+          raw_map->instance_descriptors(isolate())->GetDetails(
+              descriptor_index);
       FieldIndex index = FieldIndex::ForDetails(raw_map, details);
-      Object value = *property.value;
+      Tagged<Object> value = *property.value;
       descriptor++;
 
       if (details.representation().IsDouble()) {
-        if (value.IsSmi()) {
+        if (IsSmi(value)) {
           if (!V8_COMPRESS_POINTERS_8GB_BOOL && kTaggedSize != kDoubleSize) {
             // Write alignment filler.
-            HeapObject filler = HeapObject::FromAddress(filler_address);
-            filler.set_map_after_allocation(roots().one_pointer_filler_map());
+            Tagged<HeapObject> filler = HeapObject::FromAddress(filler_address);
+            filler->set_map_after_allocation(roots().one_pointer_filler_map());
             filler_address += kMutableDoubleSize;
           }
 
@@ -824,17 +856,18 @@ Handle<Object> JsonParser<Char>::BuildJsonObject(
           // Allocate simple heapnumber with immortal map, with non-pointer
           // payload, so we can skip notifying object layout change.
 
-          HeapObject hn = HeapObject::FromAddress(mutable_double_address);
-          hn.set_map_after_allocation(roots().heap_number_map());
-          HeapNumber::cast(hn).set_value_as_bits(bits, kRelaxedStore);
+          Tagged<HeapObject> hn =
+              HeapObject::FromAddress(mutable_double_address);
+          hn->set_map_after_allocation(roots().heap_number_map());
+          HeapNumber::cast(hn)->set_value_as_bits(bits, kRelaxedStore);
           value = hn;
           mutable_double_address +=
               ALIGN_TO_ALLOCATION_ALIGNMENT(kMutableDoubleSize);
         } else {
-          DCHECK(value.IsHeapNumber());
+          DCHECK(IsHeapNumber(value));
         }
       }
-      raw_object.RawFastInobjectPropertyAtPut(index, value, mode);
+      raw_object->RawFastInobjectPropertyAtPut(index, value, mode);
     }
     // Make all mutable HeapNumbers alive.
     if (!mutable_double_buffer.is_null()) {
@@ -886,9 +919,9 @@ Handle<Object> JsonParser<Char>::BuildJsonArray(
 
   ElementsKind kind = PACKED_SMI_ELEMENTS;
   for (size_t i = start; i < element_stack.size(); i++) {
-    Object value = *element_stack[i];
-    if (value.IsHeapObject()) {
-      if (HeapObject::cast(value).IsHeapNumber()) {
+    Tagged<Object> value = *element_stack[i];
+    if (IsHeapObject(value)) {
+      if (IsHeapNumber(HeapObject::cast(value))) {
         kind = PACKED_DOUBLE_ELEMENTS;
       } else {
         kind = PACKED_ELEMENTS;
@@ -900,18 +933,19 @@ Handle<Object> JsonParser<Char>::BuildJsonArray(
   Handle<JSArray> array = factory()->NewJSArray(kind, length, length);
   if (kind == PACKED_DOUBLE_ELEMENTS) {
     DisallowGarbageCollection no_gc;
-    FixedDoubleArray elements = FixedDoubleArray::cast(array->elements());
+    Tagged<FixedDoubleArray> elements =
+        FixedDoubleArray::cast(array->elements());
     for (int i = 0; i < length; i++) {
-      elements.set(i, element_stack[start + i]->Number());
+      elements->set(i, Object::Number(*element_stack[start + i]));
     }
   } else {
     DisallowGarbageCollection no_gc;
-    FixedArray elements = FixedArray::cast(array->elements());
+    Tagged<FixedArray> elements = FixedArray::cast(array->elements());
     WriteBarrierMode mode = kind == PACKED_SMI_ELEMENTS
                                 ? SKIP_WRITE_BARRIER
-                                : elements.GetWriteBarrierMode(no_gc);
+                                : elements->GetWriteBarrierMode(no_gc);
     for (int i = 0; i < length; i++) {
-      elements.set(i, *element_stack[start + i], mode);
+      elements->set(i, *element_stack[start + i], mode);
     }
   }
   return array;
@@ -1157,7 +1191,7 @@ MaybeHandle<Object> JsonParser<Char>::ParseJsonValue(Handle<Object> reviver) {
         case JsonContinuation::kReturn:
           if constexpr (should_track_json_source) {
             DCHECK(!val_node.is_null());
-            auto raw_value = *value;
+            Tagged<Object> raw_value = *value;
             parsed_val_node_ = cont.scope.CloseAndEscape(val_node);
             return cont.scope.CloseAndEscape(handle(raw_value, isolate_));
           } else {
@@ -1191,13 +1225,14 @@ MaybeHandle<Object> JsonParser<Char>::ParseJsonValue(Handle<Object> reviver) {
           if (cont_stack.size() > 0 &&
               cont_stack.back().type() == JsonContinuation::kArrayElement &&
               cont_stack.back().index < element_stack.size() &&
-              element_stack.back()->IsJSObject()) {
-            Map maybe_feedback = JSObject::cast(*element_stack.back()).map();
+              IsJSObject(*element_stack.back())) {
+            Tagged<Map> maybe_feedback =
+                JSObject::cast(*element_stack.back())->map();
             // Don't consume feedback from objects with a map that's detached
             // from the transition tree.
-            if (!maybe_feedback.IsDetached(isolate_)) {
+            if (!maybe_feedback->IsDetached(isolate_)) {
               feedback = handle(maybe_feedback, isolate_);
-              if (maybe_feedback.is_deprecated()) {
+              if (maybe_feedback->is_deprecated()) {
                 feedback = Map::Update(isolate_, feedback);
               }
             }
@@ -1229,7 +1264,7 @@ MaybeHandle<Object> JsonParser<Char>::ParseJsonValue(Handle<Object> reviver) {
             }
             property_val_node_stack.resize_no_init(cont.index);
             DisallowGarbageCollection no_gc;
-            auto raw_table = *table;
+            Tagged<ObjectTwoHashTable> raw_table = *table;
             value = cont.scope.CloseAndEscape(value);
             val_node = cont.scope.CloseAndEscape(handle(raw_table, isolate_));
           } else {
@@ -1263,12 +1298,13 @@ MaybeHandle<Object> JsonParser<Char>::ParseJsonValue(Handle<Object> reviver) {
             Handle<FixedArray> val_node_and_snapshot_array =
                 factory()->NewFixedArray(num_elements * 2);
             DisallowGarbageCollection no_gc;
-            auto raw_val_node_and_snapshot_array = *val_node_and_snapshot_array;
+            Tagged<FixedArray> raw_val_node_and_snapshot_array =
+                *val_node_and_snapshot_array;
             for (int i = 0; i < num_elements; i++) {
-              raw_val_node_and_snapshot_array.set(
+              raw_val_node_and_snapshot_array->set(
                   i * 2, *element_val_node_stack[start + i]);
-              raw_val_node_and_snapshot_array.set(i * 2 + 1,
-                                                  *element_stack[start + i]);
+              raw_val_node_and_snapshot_array->set(i * 2 + 1,
+                                                   *element_stack[start + i]);
             }
             element_val_node_stack.resize_no_init(cont.index);
             value = cont.scope.CloseAndEscape(value);
@@ -1397,7 +1433,7 @@ Handle<Object> JsonParser<Char>::ParseJsonNumber() {
 namespace {
 
 template <typename Char>
-bool Matches(const base::Vector<const Char>& chars, Handle<String> string) {
+bool Matches(base::Vector<const Char> chars, Handle<String> string) {
   DCHECK(!string.is_null());
   return string->IsEqualTo(chars);
 }
diff --git a/deps/v8/src/json/json-parser.h b/deps/v8/src/json/json-parser.h
index 60eb13c83e7d02..cfe306253f33d4 100644
--- a/deps/v8/src/json/json-parser.h
+++ b/deps/v8/src/json/json-parser.h
@@ -12,6 +12,7 @@
 #include "src/execution/isolate.h"
 #include "src/heap/factory.h"
 #include "src/objects/objects.h"
+#include "src/objects/string.h"
 #include "src/roots/roots.h"
 
 namespace v8 {
@@ -172,7 +173,7 @@ class JsonParser final {
                                  Object);
       val_node = parser.parsed_val_node_;
     }
-    if (reviver->IsCallable()) {
+    if (IsCallable(*reviver)) {
       return JsonParseInternalizer::Internalize(isolate, result, reviver,
                                                 source, val_node);
     }
@@ -342,6 +343,10 @@ class JsonParser final {
   MessageTemplate LookUpErrorMessageForJsonToken(JsonToken token,
                                                  Handle<Object>& arg,
                                                  Handle<Object>& arg2, int pos);
+
+  // Calculate line and column based on the current cursor position.
+  // Both values start at 1.
+  void CalculateFileLocation(Handle<Object>& line, Handle<Object>& column);
   // Mark that a parsing error has happened at the current token.
   void ReportUnexpectedToken(
       JsonToken token,
@@ -354,8 +359,7 @@ class JsonParser final {
 
   static const int kInitialSpecialStringLength = 32;
 
-  static void UpdatePointersCallback(LocalIsolate*, GCType, GCCallbackFlags,
-                                     void* parser) {
+  static void UpdatePointersCallback(void* parser) {
     reinterpret_cast<JsonParser<Char>*>(parser)->UpdatePointers();
   }
 
diff --git a/deps/v8/src/json/json-stringifier.cc b/deps/v8/src/json/json-stringifier.cc
index f718bcd9cf94c6..95e335c504ff13 100644
--- a/deps/v8/src/json/json-stringifier.cc
+++ b/deps/v8/src/json/json-stringifier.cc
@@ -24,7 +24,11 @@ class JsonStringifier {
  public:
   explicit JsonStringifier(Isolate* isolate);
 
-  ~JsonStringifier() { DeleteArray(gap_); }
+  ~JsonStringifier() {
+    if (one_byte_ptr_ != one_byte_array_) delete[] one_byte_ptr_;
+    if (two_byte_ptr_) delete[] two_byte_ptr_;
+    DeleteArray(gap_);
+  }
 
   V8_WARN_UNUSED_RESULT MaybeHandle<Object> Stringify(Handle<Object> object,
                                                       Handle<Object> replacer,
@@ -63,6 +67,123 @@ class JsonStringifier {
     return Serialize_<true>(object, deferred_comma, deferred_key);
   }
 
+  template <typename SrcChar, typename DestChar>
+  V8_INLINE void Append(SrcChar c) {
+    DCHECK_EQ(encoding_ == String::ONE_BYTE_ENCODING, sizeof(DestChar) == 1);
+    if (sizeof(DestChar) == 1) {
+      DCHECK_EQ(String::ONE_BYTE_ENCODING, encoding_);
+      one_byte_ptr_[current_index_++] = c;
+    } else {
+      DCHECK_EQ(String::TWO_BYTE_ENCODING, encoding_);
+      // Make sure to use unsigned extension even when SrcChar == char.
+      two_byte_ptr_[current_index_++] =
+          static_cast<std::make_unsigned_t<SrcChar>>(c);
+    }
+    if V8_UNLIKELY (current_index_ == part_length_) Extend();
+  }
+
+  V8_INLINE void AppendCharacter(uint8_t c) {
+    if (encoding_ == String::ONE_BYTE_ENCODING) {
+      Append<uint8_t, uint8_t>(c);
+    } else {
+      Append<uint8_t, base::uc16>(c);
+    }
+  }
+
+  template <int N>
+  V8_INLINE void AppendCStringLiteral(const char (&literal)[N]) {
+    // Note that the literal contains the zero char.
+    const int length = N - 1;
+    static_assert(length > 0);
+    if (length == 1) return AppendCharacter(literal[0]);
+    if (encoding_ == String::ONE_BYTE_ENCODING && CurrentPartCanFit(N)) {
+      const uint8_t* chars = reinterpret_cast<const uint8_t*>(literal);
+      CopyChars<uint8_t, uint8_t>(one_byte_ptr_ + current_index_, chars,
+                                  length);
+      current_index_ += length;
+      if (current_index_ == part_length_) Extend();
+      DCHECK(HasValidCurrentIndex());
+      return;
+    }
+    return AppendCString(literal);
+  }
+
+  template <typename SrcChar>
+  V8_INLINE void AppendCString(const SrcChar* s) {
+    if (encoding_ == String::ONE_BYTE_ENCODING) {
+      while (*s != '\0') Append<SrcChar, uint8_t>(*s++);
+    } else {
+      while (*s != '\0') Append<SrcChar, base::uc16>(*s++);
+    }
+  }
+
+  V8_INLINE bool CurrentPartCanFit(int length) {
+    return part_length_ - current_index_ > length;
+  }
+
+  // We make a rough estimate to find out if the current string can be
+  // serialized without allocating a new string part. The worst case length of
+  // an escaped character is 6. Shifting the remaining string length right by 3
+  // is a more pessimistic estimate, but faster to calculate.
+  V8_INLINE bool EscapedLengthIfCurrentPartFits(int length) {
+    if (length > kMaxPartLength) return false;
+    static_assert((kMaxPartLength << 3) <= String::kMaxLength);
+    // This shift will not overflow because length is already less than the
+    // maximum part length.
+    return CurrentPartCanFit(length << 3);
+  }
+
+  void AppendStringByCopy(Handle<String> string) {
+    DCHECK(encoding_ == String::TWO_BYTE_ENCODING ||
+           (string->IsFlat() &&
+            String::IsOneByteRepresentationUnderneath(*string)));
+    DCHECK(CurrentPartCanFit(string->length()));
+
+    {
+      DisallowGarbageCollection no_gc;
+      if (encoding_ == String::ONE_BYTE_ENCODING) {
+        if (String::IsOneByteRepresentationUnderneath(*string)) {
+          CopyChars<uint8_t, uint8_t>(
+              one_byte_ptr_ + current_index_,
+              string->GetCharVector<uint8_t>(no_gc).begin(), string->length());
+        } else {
+          ChangeEncoding();
+          CopyChars<uint16_t, uint16_t>(
+              two_byte_ptr_ + current_index_,
+              string->GetCharVector<uint16_t>(no_gc).begin(), string->length());
+        }
+      } else {
+        if (String::IsOneByteRepresentationUnderneath(*string)) {
+          CopyChars<uint8_t, uint16_t>(
+              two_byte_ptr_ + current_index_,
+              string->GetCharVector<uint8_t>(no_gc).begin(), string->length());
+        } else {
+          CopyChars<uint16_t, uint16_t>(
+              two_byte_ptr_ + current_index_,
+              string->GetCharVector<uint16_t>(no_gc).begin(), string->length());
+        }
+      }
+    }
+    current_index_ += string->length();
+    DCHECK(current_index_ <= part_length_);
+    if (current_index_ == part_length_) Extend();
+  }
+
+  V8_NOINLINE void AppendString(Handle<String> string) {
+    const bool representation_ok =
+        encoding_ == String::TWO_BYTE_ENCODING ||
+        (string->IsFlat() &&
+         String::IsOneByteRepresentationUnderneath(*string));
+    if (representation_ok) {
+      while (!CurrentPartCanFit(string->length())) Extend();
+      AppendStringByCopy(string);
+      return;
+    }
+    SerializeString<true>(string);
+  }
+
+  bool HasValidCurrentIndex() const { return current_index_ < part_length_; }
+
   template <bool deferred_string_key>
   Result Serialize_(Handle<Object> object, bool comma, Handle<Object> key);
 
@@ -88,15 +209,97 @@ class JsonStringifier {
   Result SerializeArrayLikeSlow(Handle<JSReceiver> object, uint32_t start,
                                 uint32_t length);
 
-  void SerializeString(Handle<String> object);
+  // Returns whether any escape sequences were used.
+  template <bool raw_json>
+  bool SerializeString(Handle<String> object);
+
+  template <typename DestChar>
+  class NoExtendBuilder {
+   public:
+    NoExtendBuilder(DestChar* start, int* current_index)
+        : current_index_(current_index), start_(start), cursor_(start) {}
+    ~NoExtendBuilder() {
+      *current_index_ += static_cast<int>(cursor_ - start_);
+    }
 
-  template <typename SrcChar, typename DestChar>
-  V8_INLINE static void SerializeStringUnchecked_(
-      base::Vector<const SrcChar> src,
-      IncrementalStringBuilder::NoExtend<DestChar>* dest);
+    V8_INLINE void Append(DestChar c) { *(cursor_++) = c; }
+    V8_INLINE void AppendCString(const char* s) {
+      const uint8_t* u = reinterpret_cast<const uint8_t*>(s);
+      while (*u != '\0') Append(*(u++));
+    }
 
-  template <typename SrcChar, typename DestChar>
-  V8_INLINE void SerializeString_(Handle<String> string);
+    // Appends all of the chars from the provided span, but only increases the
+    // cursor by `length`. This allows oversizing the span to the nearest
+    // convenient multiple, allowing CopyChars to run slightly faster.
+    V8_INLINE void AppendChars(base::Vector<const uint8_t> chars,
+                               size_t length) {
+      DCHECK_GE(chars.size(), length);
+      CopyChars(cursor_, chars.begin(), chars.size());
+      cursor_ += length;
+    }
+
+   private:
+    int* current_index_;
+    DestChar* start_;
+    DestChar* cursor_;
+  };
+
+  // A cache of recently seen property keys which were simple. Simple means:
+  //
+  // - Internalized, sequential, one-byte string
+  // - Contains no characters which need escaping
+  //
+  // This can be helpful because it's common for JSON to have lists of similar
+  // objects. Since property keys are internalized, we will see identical key
+  // pointers again and again, and we can use a fast path to copy those keys to
+  // the output. However, strings can be externalized any time JS runs, so the
+  // caller is responsible for checking whether a string is still the expected
+  // type.
+  class SimplePropertyKeyCache {
+   public:
+    explicit SimplePropertyKeyCache(Isolate* isolate) {
+      Tagged<String> zero;
+      for (size_t i = 0; i < kSize; ++i) {
+        keys_[i] = handle(zero, isolate);
+      }
+    }
+
+    void TryInsert(String string, Isolate* isolate) {
+      ReadOnlyRoots roots(isolate);
+      if (string.map(isolate) == roots.internalized_one_byte_string_map()) {
+        keys_[GetIndex(string)].PatchValue(string);
+      }
+    }
+
+    bool Contains(String string) { return *keys_[GetIndex(string)] == string; }
+
+   private:
+    size_t GetIndex(String string) {
+      // Short strings are 16 bytes long in pointer-compression builds, so the
+      // lower four bits of the pointer may not provide much entropy.
+      return (string.ptr() >> 4) & kIndexMask;
+    }
+
+    static constexpr size_t kSizeBits = 6;
+    static constexpr size_t kSize = 1 << kSizeBits;
+    static constexpr size_t kIndexMask = kSize - 1;
+
+    Handle<String> keys_[kSize];
+  };
+
+  // Returns whether any escape sequences were used.
+  template <typename SrcChar, typename DestChar, bool raw_json>
+  V8_INLINE static bool SerializeStringUnchecked_(
+      base::Vector<const SrcChar> src, NoExtendBuilder<DestChar>* dest);
+
+  // Returns whether any escape sequences were used.
+  template <typename SrcChar, typename DestChar, bool raw_json>
+  V8_INLINE bool SerializeString_(Handle<String> string);
+
+  // Tries to do fast-path serialization for a property key, and returns whether
+  // it was successful.
+  template <typename DestChar>
+  bool TrySerializeSimplePropertyKey(String string);
 
   template <typename Char>
   V8_INLINE static bool DoNotEscape(Char c);
@@ -122,21 +325,37 @@ class JsonStringifier {
   static const int kCircularErrorMessagePrefixCount = 2;
   static const int kCircularErrorMessagePostfixCount = 1;
 
+  static const int kInitialPartLength = 2048;
+  static const int kMaxPartLength = 16 * 1024;
+  static const int kPartLengthGrowthFactor = 2;
+
   Factory* factory() { return isolate_->factory(); }
 
+  V8_NOINLINE void Extend();
+  V8_NOINLINE void ChangeEncoding();
+
   Isolate* isolate_;
-  IncrementalStringBuilder builder_;
-  Handle<String> tojson_string_;
+  String::Encoding encoding_;
   Handle<FixedArray> property_list_;
   Handle<JSReceiver> replacer_function_;
+  uint8_t* one_byte_ptr_;
   base::uc16* gap_;
+  base::uc16* two_byte_ptr_;
+  void* part_ptr_;
   int indent_;
+  int part_length_;
+  int current_index_;
+  bool overflowed_;
 
   using KeyObject = std::pair<Handle<Object>, Handle<Object>>;
   std::vector<KeyObject> stack_;
 
+  SimplePropertyKeyCache key_cache_;
+  uint8_t one_byte_array_[kInitialPartLength];
+
   static const int kJsonEscapeTableEntrySize = 8;
   static const char* const JsonEscapeTable;
+  static const bool JsonDoNotEscapeFlagTable[];
 };
 
 MaybeHandle<Object> JsonStringify(Isolate* isolate, Handle<Object> object,
@@ -171,55 +390,35 @@ const char* const JsonStringifier::JsonEscapeTable =
     "P\0      Q\0      R\0      S\0      "
     "T\0      U\0      V\0      W\0      "
     "X\0      Y\0      Z\0      [\0      "
-    "\\\\\0     ]\0      ^\0      _\0      "
-    "`\0      a\0      b\0      c\0      "
-    "d\0      e\0      f\0      g\0      "
-    "h\0      i\0      j\0      k\0      "
-    "l\0      m\0      n\0      o\0      "
-    "p\0      q\0      r\0      s\0      "
-    "t\0      u\0      v\0      w\0      "
-    "x\0      y\0      z\0      {\0      "
-    "|\0      }\0      ~\0      \x7F\0      "
-    "\x80\0      \x81\0      \x82\0      \x83\0      "
-    "\x84\0      \x85\0      \x86\0      \x87\0      "
-    "\x88\0      \x89\0      \x8A\0      \x8B\0      "
-    "\x8C\0      \x8D\0      \x8E\0      \x8F\0      "
-    "\x90\0      \x91\0      \x92\0      \x93\0      "
-    "\x94\0      \x95\0      \x96\0      \x97\0      "
-    "\x98\0      \x99\0      \x9A\0      \x9B\0      "
-    "\x9C\0      \x9D\0      \x9E\0      \x9F\0      "
-    "\xA0\0      \xA1\0      \xA2\0      \xA3\0      "
-    "\xA4\0      \xA5\0      \xA6\0      \xA7\0      "
-    "\xA8\0      \xA9\0      \xAA\0      \xAB\0      "
-    "\xAC\0      \xAD\0      \xAE\0      \xAF\0      "
-    "\xB0\0      \xB1\0      \xB2\0      \xB3\0      "
-    "\xB4\0      \xB5\0      \xB6\0      \xB7\0      "
-    "\xB8\0      \xB9\0      \xBA\0      \xBB\0      "
-    "\xBC\0      \xBD\0      \xBE\0      \xBF\0      "
-    "\xC0\0      \xC1\0      \xC2\0      \xC3\0      "
-    "\xC4\0      \xC5\0      \xC6\0      \xC7\0      "
-    "\xC8\0      \xC9\0      \xCA\0      \xCB\0      "
-    "\xCC\0      \xCD\0      \xCE\0      \xCF\0      "
-    "\xD0\0      \xD1\0      \xD2\0      \xD3\0      "
-    "\xD4\0      \xD5\0      \xD6\0      \xD7\0      "
-    "\xD8\0      \xD9\0      \xDA\0      \xDB\0      "
-    "\xDC\0      \xDD\0      \xDE\0      \xDF\0      "
-    "\xE0\0      \xE1\0      \xE2\0      \xE3\0      "
-    "\xE4\0      \xE5\0      \xE6\0      \xE7\0      "
-    "\xE8\0      \xE9\0      \xEA\0      \xEB\0      "
-    "\xEC\0      \xED\0      \xEE\0      \xEF\0      "
-    "\xF0\0      \xF1\0      \xF2\0      \xF3\0      "
-    "\xF4\0      \xF5\0      \xF6\0      \xF7\0      "
-    "\xF8\0      \xF9\0      \xFA\0      \xFB\0      "
-    "\xFC\0      \xFD\0      \xFE\0      \xFF\0      ";
+    "\\\\\0     ]\0      ^\0      _\0      ";
+
+const bool JsonStringifier::JsonDoNotEscapeFlagTable[] = {
+    0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+    0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+    1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+};
 
 JsonStringifier::JsonStringifier(Isolate* isolate)
     : isolate_(isolate),
-      builder_(isolate),
+      encoding_(String::ONE_BYTE_ENCODING),
       gap_(nullptr),
+      two_byte_ptr_(nullptr),
       indent_(0),
-      stack_() {
-  tojson_string_ = factory()->toJSON_string();
+      part_length_(kInitialPartLength),
+      current_index_(0),
+      overflowed_(false),
+      stack_(),
+      key_cache_(isolate) {
+  one_byte_ptr_ = one_byte_array_;
+  part_ptr_ = one_byte_ptr_;
 }
 
 MaybeHandle<Object> JsonStringifier::Stringify(Handle<Object> object,
@@ -229,13 +428,26 @@ MaybeHandle<Object> JsonStringifier::Stringify(Handle<Object> object,
     CHECK(isolate_->has_pending_exception());
     return MaybeHandle<Object>();
   }
-  if (!gap->IsUndefined(isolate_) && !InitializeGap(gap)) {
+  if (!IsUndefined(*gap, isolate_) && !InitializeGap(gap)) {
     CHECK(isolate_->has_pending_exception());
     return MaybeHandle<Object>();
   }
   Result result = SerializeObject(object);
   if (result == UNCHANGED) return factory()->undefined_value();
-  if (result == SUCCESS) return builder_.Finish();
+  if (result == SUCCESS) {
+    if (overflowed_ || current_index_ > String::kMaxLength) {
+      THROW_NEW_ERROR(isolate_, NewInvalidStringLengthError(), String);
+    }
+    if (encoding_ == String::ONE_BYTE_ENCODING) {
+      return isolate_->factory()
+          ->NewStringFromOneByte(base::OneByteVector(
+              reinterpret_cast<char*>(one_byte_ptr_), current_index_))
+          .ToHandleChecked();
+    } else {
+      return isolate_->factory()->NewStringFromTwoByte(
+          base::Vector<const base::uc16>(two_byte_ptr_, current_index_));
+    }
+  }
   DCHECK(result == EXCEPTION);
   CHECK(isolate_->has_pending_exception());
   return MaybeHandle<Object>();
@@ -256,19 +468,19 @@ bool JsonStringifier::InitializeReplacer(Handle<Object> replacer) {
                                        Handle<JSReceiver>::cast(replacer)),
         false);
     uint32_t length;
-    if (!length_obj->ToUint32(&length)) length = kMaxUInt32;
+    if (!Object::ToUint32(*length_obj, &length)) length = kMaxUInt32;
     for (uint32_t i = 0; i < length; i++) {
       Handle<Object> element;
       Handle<String> key;
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate_, element, Object::GetElement(isolate_, replacer, i), false);
-      if (element->IsNumber() || element->IsString()) {
+      if (IsNumber(*element) || IsString(*element)) {
         ASSIGN_RETURN_ON_EXCEPTION_VALUE(
             isolate_, key, Object::ToString(isolate_, element), false);
-      } else if (element->IsJSPrimitiveWrapper()) {
+      } else if (IsJSPrimitiveWrapper(*element)) {
         Handle<Object> value(Handle<JSPrimitiveWrapper>::cast(element)->value(),
                              isolate_);
-        if (value->IsNumber() || value->IsString()) {
+        if (IsNumber(*value) || IsString(*value)) {
           ASSIGN_RETURN_ON_EXCEPTION_VALUE(
               isolate_, key, Object::ToString(isolate_, element), false);
         }
@@ -286,7 +498,7 @@ bool JsonStringifier::InitializeReplacer(Handle<Object> replacer) {
     property_list_ = OrderedHashSet::ConvertToKeysArray(
         isolate_, set, GetKeysConversion::kKeepNumbers);
     property_list_ = handle_scope.CloseAndEscape(property_list_);
-  } else if (replacer->IsCallable()) {
+  } else if (IsCallable(*replacer)) {
     replacer_function_ = Handle<JSReceiver>::cast(replacer);
   }
   return true;
@@ -295,19 +507,19 @@ bool JsonStringifier::InitializeReplacer(Handle<Object> replacer) {
 bool JsonStringifier::InitializeGap(Handle<Object> gap) {
   DCHECK_NULL(gap_);
   HandleScope scope(isolate_);
-  if (gap->IsJSPrimitiveWrapper()) {
+  if (IsJSPrimitiveWrapper(*gap)) {
     Handle<Object> value(Handle<JSPrimitiveWrapper>::cast(gap)->value(),
                          isolate_);
-    if (value->IsString()) {
+    if (IsString(*value)) {
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate_, gap,
                                        Object::ToString(isolate_, gap), false);
-    } else if (value->IsNumber()) {
+    } else if (IsNumber(*value)) {
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate_, gap,
                                        Object::ToNumber(isolate_, gap), false);
     }
   }
 
-  if (gap->IsString()) {
+  if (IsString(*gap)) {
     Handle<String> gap_string = Handle<String>::cast(gap);
     if (gap_string->length() > 0) {
       int gap_length = std::min(gap_string->length(), 10);
@@ -315,14 +527,14 @@ bool JsonStringifier::InitializeGap(Handle<Object> gap) {
       String::WriteToFlat(*gap_string, gap_, 0, gap_length);
       for (int i = 0; i < gap_length; i++) {
         if (gap_[i] > String::kMaxOneByteCharCode) {
-          builder_.ChangeEncoding();
+          ChangeEncoding();
           break;
         }
       }
       gap_[gap_length] = '\0';
     }
-  } else if (gap->IsNumber()) {
-    double value = std::min(gap->Number(), 10.0);
+  } else if (IsNumber(*gap)) {
+    double value = std::min(Object::Number(*gap), 10.0);
     if (value > 0) {
       int gap_length = DoubleToInt32(value);
       gap_ = NewArray<base::uc16>(gap_length + 1);
@@ -340,13 +552,13 @@ MaybeHandle<Object> JsonStringifier::ApplyToJsonFunction(Handle<Object> object,
   // Retrieve toJSON function. The LookupIterator automatically handles
   // the ToObject() equivalent ("GetRoot") if {object} is a BigInt.
   Handle<Object> fun;
-  LookupIterator it(isolate_, object, tojson_string_,
+  LookupIterator it(isolate_, object, factory()->toJSON_string(),
                     LookupIterator::PROTOTYPE_CHAIN_SKIP_INTERCEPTOR);
   ASSIGN_RETURN_ON_EXCEPTION(isolate_, fun, Object::GetProperty(&it), Object);
-  if (!fun->IsCallable()) return object;
+  if (!IsCallable(*fun)) return object;
 
   // Call toJSON function.
-  if (key->IsSmi()) key = factory()->NumberToString(key);
+  if (IsSmi(*key)) key = factory()->NumberToString(key);
   Handle<Object> argv[] = {key};
   ASSIGN_RETURN_ON_EXCEPTION(isolate_, object,
                              Execution::Call(isolate_, fun, object, 1, argv),
@@ -357,7 +569,7 @@ MaybeHandle<Object> JsonStringifier::ApplyToJsonFunction(Handle<Object> object,
 MaybeHandle<Object> JsonStringifier::ApplyReplacerFunction(
     Handle<Object> value, Handle<Object> key, Handle<Object> initial_holder) {
   HandleScope scope(isolate_);
-  if (key->IsSmi()) key = factory()->NumberToString(key);
+  if (IsSmi(*key)) key = factory()->NumberToString(key);
   Handle<Object> argv[] = {key, value};
   Handle<JSReceiver> holder = CurrentHolder(value, initial_holder);
   ASSIGN_RETURN_ON_EXCEPTION(
@@ -452,13 +664,13 @@ class CircularStructureMessageBuilder {
 
   // A key can either be a string, the empty string or a Smi.
   void AppendKey(Handle<Object> key) {
-    if (key->IsSmi()) {
+    if (IsSmi(*key)) {
       builder_.AppendCStringLiteral("index ");
       AppendSmi(Smi::cast(*key));
       return;
     }
 
-    CHECK(key->IsString());
+    CHECK(IsString(*key));
     Handle<String> key_as_string = Handle<String>::cast(key);
     if (key_as_string->length() == 0) {
       builder_.AppendCStringLiteral("<anonymous>");
@@ -521,22 +733,32 @@ Handle<String> JsonStringifier::ConstructCircularStructureErrorMessage(
   return result;
 }
 
+bool MayHaveInterestingProperties(Isolate* isolate, JSReceiver object) {
+  for (PrototypeIterator iter(isolate, object, kStartAtReceiver);
+       !iter.IsAtEnd(); iter.Advance()) {
+    if (iter.GetCurrent()->map()->may_have_interesting_properties())
+      return true;
+  }
+  return false;
+}
+
 template <bool deferred_string_key>
 JsonStringifier::Result JsonStringifier::Serialize_(Handle<Object> object,
                                                     bool comma,
                                                     Handle<Object> key) {
   StackLimitCheck interrupt_check(isolate_);
   if (interrupt_check.InterruptRequested() &&
-      isolate_->stack_guard()->HandleInterrupts().IsException(isolate_)) {
+      IsException(isolate_->stack_guard()->HandleInterrupts(), isolate_)) {
     return EXCEPTION;
   }
 
   Handle<Object> initial_value = object;
   PtrComprCageBase cage_base(isolate_);
-  if (!object->IsSmi()) {
+  if (!IsSmi(*object)) {
     InstanceType instance_type =
-        HeapObject::cast(*object).map(cage_base).instance_type();
-    if (InstanceTypeChecker::IsJSReceiver(instance_type) ||
+        HeapObject::cast(*object)->map(cage_base)->instance_type();
+    if ((InstanceTypeChecker::IsJSReceiver(instance_type) &&
+         MayHaveInterestingProperties(isolate_, JSReceiver::cast(*object))) ||
         InstanceTypeChecker::IsBigInt(instance_type)) {
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate_, object, ApplyToJsonFunction(object, key), EXCEPTION);
@@ -548,13 +770,13 @@ JsonStringifier::Result JsonStringifier::Serialize_(Handle<Object> object,
         EXCEPTION);
   }
 
-  if (object->IsSmi()) {
+  if (IsSmi(*object)) {
     if (deferred_string_key) SerializeDeferredKey(comma, key);
     return SerializeSmi(Smi::cast(*object));
   }
 
   InstanceType instance_type =
-      HeapObject::cast(*object).map(cage_base).instance_type();
+      HeapObject::cast(*object)->map(cage_base)->instance_type();
   switch (instance_type) {
     case HEAP_NUMBER_TYPE:
       if (deferred_string_key) SerializeDeferredKey(comma, key);
@@ -564,18 +786,18 @@ JsonStringifier::Result JsonStringifier::Serialize_(Handle<Object> object,
           *factory()->NewTypeError(MessageTemplate::kBigIntSerializeJSON));
       return EXCEPTION;
     case ODDBALL_TYPE:
-      switch (Oddball::cast(*object).kind()) {
+      switch (Oddball::cast(*object)->kind()) {
         case Oddball::kFalse:
           if (deferred_string_key) SerializeDeferredKey(comma, key);
-          builder_.AppendCStringLiteral("false");
+          AppendCStringLiteral("false");
           return SUCCESS;
         case Oddball::kTrue:
           if (deferred_string_key) SerializeDeferredKey(comma, key);
-          builder_.AppendCStringLiteral("true");
+          AppendCStringLiteral("true");
           return SUCCESS;
         case Oddball::kNull:
           if (deferred_string_key) SerializeDeferredKey(comma, key);
-          builder_.AppendCStringLiteral("null");
+          AppendCStringLiteral("null");
           return SUCCESS;
         default:
           return UNCHANGED;
@@ -612,7 +834,7 @@ JsonStringifier::Result JsonStringifier::Serialize_(Handle<Object> object,
                                     isolate_->factory()->raw_json_string())
                   .ToHandleChecked());
         }
-        builder_.AppendString(raw_json);
+        AppendString(raw_json);
       }
       return SUCCESS;
 #if V8_ENABLE_WEBASSEMBLY
@@ -623,11 +845,11 @@ JsonStringifier::Result JsonStringifier::Serialize_(Handle<Object> object,
     default:
       if (InstanceTypeChecker::IsString(instance_type)) {
         if (deferred_string_key) SerializeDeferredKey(comma, key);
-        SerializeString(Handle<String>::cast(object));
+        SerializeString<false>(Handle<String>::cast(object));
         return SUCCESS;
       } else {
-        DCHECK(object->IsJSReceiver());
-        if (HeapObject::cast(*object).IsCallable(cage_base)) return UNCHANGED;
+        DCHECK(IsJSReceiver(*object));
+        if (IsCallable(HeapObject::cast(*object), cage_base)) return UNCHANGED;
         // Go to slow path for global proxy and objects requiring access checks.
         if (deferred_string_key) SerializeDeferredKey(comma, key);
         if (InstanceTypeChecker::IsJSProxy(instance_type)) {
@@ -643,26 +865,26 @@ JsonStringifier::Result JsonStringifier::Serialize_(Handle<Object> object,
 JsonStringifier::Result JsonStringifier::SerializeJSPrimitiveWrapper(
     Handle<JSPrimitiveWrapper> object, Handle<Object> key) {
   Object raw = object->value();
-  if (raw.IsString()) {
+  if (IsString(raw)) {
     Handle<Object> value;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate_, value, Object::ToString(isolate_, object), EXCEPTION);
-    SerializeString(Handle<String>::cast(value));
-  } else if (raw.IsNumber()) {
+    SerializeString<false>(Handle<String>::cast(value));
+  } else if (IsNumber(raw)) {
     Handle<Object> value;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate_, value, Object::ToNumber(isolate_, object), EXCEPTION);
-    if (value->IsSmi()) return SerializeSmi(Smi::cast(*value));
+    if (IsSmi(*value)) return SerializeSmi(Smi::cast(*value));
     SerializeHeapNumber(Handle<HeapNumber>::cast(value));
-  } else if (raw.IsBigInt()) {
+  } else if (IsBigInt(raw)) {
     isolate_->Throw(
         *factory()->NewTypeError(MessageTemplate::kBigIntSerializeJSON));
     return EXCEPTION;
-  } else if (raw.IsBoolean()) {
-    if (raw.IsTrue(isolate_)) {
-      builder_.AppendCStringLiteral("true");
+  } else if (IsBoolean(raw)) {
+    if (IsTrue(raw, isolate_)) {
+      AppendCStringLiteral("true");
     } else {
-      builder_.AppendCStringLiteral("false");
+      AppendCStringLiteral("false");
     }
   } else {
     // ES6 24.3.2.1 step 10.c, serialize as an ordinary JSObject.
@@ -675,29 +897,29 @@ JsonStringifier::Result JsonStringifier::SerializeSmi(Smi object) {
   static const int kBufferSize = 100;
   char chars[kBufferSize];
   base::Vector<char> buffer(chars, kBufferSize);
-  builder_.AppendCString(IntToCString(object.value(), buffer));
+  AppendCString(IntToCString(object.value(), buffer));
   return SUCCESS;
 }
 
 JsonStringifier::Result JsonStringifier::SerializeDouble(double number) {
   if (std::isinf(number) || std::isnan(number)) {
-    builder_.AppendCStringLiteral("null");
+    AppendCStringLiteral("null");
     return SUCCESS;
   }
   static const int kBufferSize = 100;
   char chars[kBufferSize];
   base::Vector<char> buffer(chars, kBufferSize);
-  builder_.AppendCString(DoubleToCString(number, buffer));
+  AppendCString(DoubleToCString(number, buffer));
   return SUCCESS;
 }
 
 JsonStringifier::Result JsonStringifier::SerializeJSArray(
     Handle<JSArray> object, Handle<Object> key) {
   uint32_t length = 0;
-  CHECK(object->length().ToArrayLength(&length));
-  DCHECK(!object->IsAccessCheckNeeded());
+  CHECK(Object::ToArrayLength(object->length(), &length));
+  DCHECK(!IsAccessCheckNeeded(*object));
   if (length == 0) {
-    builder_.AppendCStringLiteral("[]");
+    AppendCStringLiteral("[]");
     return SUCCESS;
   }
 
@@ -705,7 +927,7 @@ JsonStringifier::Result JsonStringifier::SerializeJSArray(
   Result stack_push = StackPush(object, key);
   if (stack_push != SUCCESS) return stack_push;
 
-  builder_.AppendCharacter('[');
+  AppendCharacter('[');
   Indent();
   uint32_t i = 0;
   if (replacer_function_.is_null()) {
@@ -728,8 +950,8 @@ JsonStringifier::Result JsonStringifier::SerializeJSArray(
           DCHECK_LT(limit, kMaxAllowedFastPackedLength);
           limit = std::min(length, limit + kInterruptLength);
           if (interrupt_check.InterruptRequested() &&
-              isolate_->stack_guard()->HandleInterrupts().IsException(
-                  isolate_)) {
+              IsException(isolate_->stack_guard()->HandleInterrupts(),
+                          isolate_)) {
             return EXCEPTION;
           }
         }
@@ -747,8 +969,8 @@ JsonStringifier::Result JsonStringifier::SerializeJSArray(
           DCHECK_LT(limit, kMaxAllowedFastPackedLength);
           limit = std::min(length, limit + kInterruptLength);
           if (interrupt_check.InterruptRequested() &&
-              isolate_->stack_guard()->HandleInterrupts().IsException(
-                  isolate_)) {
+              IsException(isolate_->stack_guard()->HandleInterrupts(),
+                          isolate_)) {
             return EXCEPTION;
           }
         }
@@ -766,11 +988,11 @@ JsonStringifier::Result JsonStringifier::SerializeJSArray(
           Separator(i == 0);
           Result result = SerializeElement(
               isolate_,
-              handle(FixedArray::cast(object->elements()).get(cage_base, i),
+              handle(FixedArray::cast(object->elements())->get(cage_base, i),
                      isolate_),
               i);
           if (result == UNCHANGED) {
-            builder_.AppendCStringLiteral("null");
+            AppendCStringLiteral("null");
           } else if (result != SUCCESS) {
             return result;
           }
@@ -788,7 +1010,7 @@ JsonStringifier::Result JsonStringifier::SerializeJSArray(
   }
   Unindent();
   NewLine();
-  builder_.AppendCharacter(']');
+  AppendCharacter(']');
   StackPop();
   return SUCCESS;
 }
@@ -812,8 +1034,11 @@ JsonStringifier::Result JsonStringifier::SerializeArrayLikeSlow(
     if (result == SUCCESS) continue;
     if (result == UNCHANGED) {
       // Detect overflow sooner for large sparse arrays.
-      if (builder_.HasOverflowed()) return EXCEPTION;
-      builder_.AppendCStringLiteral("null");
+      if (overflowed_) {
+        isolate_->Throw(*isolate_->factory()->NewInvalidStringLengthError());
+        return EXCEPTION;
+      }
+      AppendCStringLiteral("null");
     } else {
       return result;
     }
@@ -825,10 +1050,10 @@ namespace {
 V8_INLINE bool CanFastSerializeJSObject(PtrComprCageBase cage_base,
                                         JSObject raw_object, Isolate* isolate) {
   DisallowGarbageCollection no_gc;
-  if (raw_object.map(cage_base).IsCustomElementsReceiverMap()) return false;
-  if (!raw_object.HasFastProperties(cage_base)) return false;
+  if (IsCustomElementsReceiverMap(raw_object->map(cage_base))) return false;
+  if (!raw_object->HasFastProperties(cage_base)) return false;
   auto roots = ReadOnlyRoots(isolate);
-  auto elements = raw_object.elements(cage_base);
+  auto elements = raw_object->elements(cage_base);
   return elements == roots.empty_fixed_array() ||
          elements == roots.empty_slow_element_dictionary();
 }
@@ -849,19 +1074,19 @@ JsonStringifier::Result JsonStringifier::SerializeJSObject(
     return SUCCESS;
   }
 
-  DCHECK(!object->IsJSGlobalProxy());
+  DCHECK(!IsJSGlobalProxy(*object));
   DCHECK(!object->HasIndexedInterceptor());
   DCHECK(!object->HasNamedInterceptor());
 
   Handle<Map> map(object->map(cage_base), isolate_);
   if (map->NumberOfOwnDescriptors() == 0) {
-    builder_.AppendCStringLiteral("{}");
+    AppendCStringLiteral("{}");
     return SUCCESS;
   }
 
   Result stack_push = StackPush(object, key);
   if (stack_push != SUCCESS) return stack_push;
-  builder_.AppendCharacter('{');
+  AppendCharacter('{');
   Indent();
   bool comma = false;
   for (InternalIndex i : map->IterateOwnDescriptors()) {
@@ -870,11 +1095,11 @@ JsonStringifier::Result JsonStringifier::SerializeJSObject(
     {
       DisallowGarbageCollection no_gc;
       DescriptorArray descriptors = map->instance_descriptors(cage_base);
-      Name name = descriptors.GetKey(i);
+      Name name = descriptors->GetKey(i);
       // TODO(rossberg): Should this throw?
-      if (!name.IsString(cage_base)) continue;
+      if (!IsString(name, cage_base)) continue;
       key_name = handle(String::cast(name), isolate_);
-      details = descriptors.GetDetails(i);
+      details = descriptors->GetDetails(i);
     }
     if (details.IsDontEnum()) continue;
     Handle<Object> property;
@@ -895,7 +1120,7 @@ JsonStringifier::Result JsonStringifier::SerializeJSObject(
   }
   Unindent();
   if (comma) NewLine();
-  builder_.AppendCharacter('}');
+  AppendCharacter('}');
   StackPop();
   return SUCCESS;
 }
@@ -911,7 +1136,7 @@ JsonStringifier::Result JsonStringifier::SerializeJSReceiverSlow(
                                 GetKeysConversion::kConvertToString),
         EXCEPTION);
   }
-  builder_.AppendCharacter('{');
+  AppendCharacter('{');
   Indent();
   bool comma = false;
   for (int i = 0; i < contents->length(); i++) {
@@ -926,7 +1151,7 @@ JsonStringifier::Result JsonStringifier::SerializeJSReceiverSlow(
   }
   Unindent();
   if (comma) NewLine();
-  builder_.AppendCharacter('}');
+  AppendCharacter('}');
   return SUCCESS;
 }
 
@@ -945,20 +1170,20 @@ JsonStringifier::Result JsonStringifier::SerializeJSProxy(
                                        Handle<JSReceiver>::cast(object)),
         EXCEPTION);
     uint32_t length;
-    if (!length_object->ToUint32(&length)) {
+    if (!Object::ToUint32(*length_object, &length)) {
       // Technically, we need to be able to handle lengths outside the
       // uint32_t range. However, we would run into string size overflow
       // if we tried to stringify such an array.
       isolate_->Throw(*isolate_->factory()->NewInvalidStringLengthError());
       return EXCEPTION;
     }
-    builder_.AppendCharacter('[');
+    AppendCharacter('[');
     Indent();
     Result result = SerializeArrayLikeSlow(object, 0, length);
     if (result != SUCCESS) return result;
     Unindent();
     if (length > 0) NewLine();
-    builder_.AppendCharacter(']');
+    AppendCharacter(']');
   } else {
     Result result = SerializeJSReceiverSlow(object);
     if (result != SUCCESS) return result;
@@ -967,21 +1192,22 @@ JsonStringifier::Result JsonStringifier::SerializeJSProxy(
   return SUCCESS;
 }
 
-template <typename SrcChar, typename DestChar>
-void JsonStringifier::SerializeStringUnchecked_(
-    base::Vector<const SrcChar> src,
-    IncrementalStringBuilder::NoExtend<DestChar>* dest) {
+template <typename SrcChar, typename DestChar, bool raw_json>
+bool JsonStringifier::SerializeStringUnchecked_(
+    base::Vector<const SrcChar> src, NoExtendBuilder<DestChar>* dest) {
   // Assert that base::uc16 character is not truncated down to 8 bit.
   // The <base::uc16, char> version of this method must not be called.
   DCHECK(sizeof(DestChar) >= sizeof(SrcChar));
+  bool required_escaping = false;
   for (int i = 0; i < src.length(); i++) {
     SrcChar c = src[i];
-    if (DoNotEscape(c)) {
+    if (raw_json || DoNotEscape(c)) {
       dest->Append(c);
     } else if (sizeof(SrcChar) != 1 &&
                base::IsInRange(c, static_cast<SrcChar>(0xD800),
                                static_cast<SrcChar>(0xDFFF))) {
       // The current character is a surrogate.
+      required_escaping = true;
       if (c <= 0xDBFF) {
         // The current character is a leading surrogate.
         if (i + 1 < src.length()) {
@@ -1021,33 +1247,40 @@ void JsonStringifier::SerializeStringUnchecked_(
         DeleteArray(hex);
       }
     } else {
+      DCHECK_LT(c, 0x60);
+      required_escaping = true;
       dest->AppendCString(&JsonEscapeTable[c * kJsonEscapeTableEntrySize]);
     }
   }
+  return required_escaping;
 }
 
-template <typename SrcChar, typename DestChar>
-void JsonStringifier::SerializeString_(Handle<String> string) {
+template <typename SrcChar, typename DestChar, bool raw_json>
+bool JsonStringifier::SerializeString_(Handle<String> string) {
   int length = string->length();
-  builder_.Append<uint8_t, DestChar>('"');
+  bool required_escaping = false;
+  if (!raw_json) Append<uint8_t, DestChar>('"');
   // We might be able to fit the whole escaped string in the current string
   // part, or we might need to allocate.
-  if (int worst_case_length = builder_.EscapedLengthIfCurrentPartFits(length)) {
+  if V8_LIKELY (EscapedLengthIfCurrentPartFits(length)) {
     DisallowGarbageCollection no_gc;
     base::Vector<const SrcChar> vector = string->GetCharVector<SrcChar>(no_gc);
-    IncrementalStringBuilder::NoExtendBuilder<DestChar> no_extend(
-        &builder_, worst_case_length, no_gc);
-    SerializeStringUnchecked_(vector, &no_extend);
+    NoExtendBuilder<DestChar> no_extend(
+        reinterpret_cast<DestChar*>(part_ptr_) + current_index_,
+        &current_index_);
+    required_escaping = SerializeStringUnchecked_<SrcChar, DestChar, raw_json>(
+        vector, &no_extend);
   } else {
     FlatStringReader reader(isolate_, string);
     for (int i = 0; i < reader.length(); i++) {
       SrcChar c = reader.Get<SrcChar>(i);
-      if (DoNotEscape(c)) {
-        builder_.Append<SrcChar, DestChar>(c);
+      if (raw_json || DoNotEscape(c)) {
+        Append<SrcChar, DestChar>(c);
       } else if (sizeof(SrcChar) != 1 &&
                  base::IsInRange(c, static_cast<SrcChar>(0xD800),
                                  static_cast<SrcChar>(0xDFFF))) {
         // The current character is a surrogate.
+        required_escaping = true;
         if (c <= 0xDBFF) {
           // The current character is a leading surrogate.
           if (i + 1 < reader.length()) {
@@ -1057,23 +1290,23 @@ void JsonStringifier::SerializeString_(Handle<String> string) {
                                 static_cast<SrcChar>(0xDFFF))) {
               // The next character is a trailing surrogate, meaning this is a
               // surrogate pair.
-              builder_.Append<SrcChar, DestChar>(c);
-              builder_.Append<SrcChar, DestChar>(next);
+              Append<SrcChar, DestChar>(c);
+              Append<SrcChar, DestChar>(next);
               i++;
             } else {
               // The next character is not a trailing surrogate. Thus, the
               // current character is a lone leading surrogate.
-              builder_.AppendCStringLiteral("\\u");
+              AppendCStringLiteral("\\u");
               char* const hex = DoubleToRadixCString(c, 16);
-              builder_.AppendCString(hex);
+              AppendCString(hex);
               DeleteArray(hex);
             }
           } else {
             // There is no next character. Thus, the current character is a
             // lone leading surrogate.
-            builder_.AppendCStringLiteral("\\u");
+            AppendCStringLiteral("\\u");
             char* const hex = DoubleToRadixCString(c, 16);
-            builder_.AppendCString(hex);
+            AppendCString(hex);
             DeleteArray(hex);
           }
         } else {
@@ -1081,31 +1314,80 @@ void JsonStringifier::SerializeString_(Handle<String> string) {
           // been preceded by a leading surrogate, we would've ended up in the
           // other branch earlier on, and the current character would've been
           // handled as part of the surrogate pair already.)
-          builder_.AppendCStringLiteral("\\u");
+          AppendCStringLiteral("\\u");
           char* const hex = DoubleToRadixCString(c, 16);
-          builder_.AppendCString(hex);
+          AppendCString(hex);
           DeleteArray(hex);
         }
       } else {
-        builder_.AppendCString(&JsonEscapeTable[c * kJsonEscapeTableEntrySize]);
+        DCHECK_LT(c, 0x60);
+        required_escaping = true;
+        AppendCString(&JsonEscapeTable[c * kJsonEscapeTableEntrySize]);
       }
     }
   }
-  builder_.Append<uint8_t, DestChar>('"');
+  if (!raw_json) Append<uint8_t, DestChar>('"');
+  return required_escaping;
+}
+
+template <typename DestChar>
+bool JsonStringifier::TrySerializeSimplePropertyKey(String key) {
+  DisallowGarbageCollection no_gc;
+  ReadOnlyRoots roots(isolate_);
+  if (key.map(isolate_) != roots.internalized_one_byte_string_map()) {
+    return false;
+  }
+  if (!key_cache_.Contains(key)) {
+    return false;
+  }
+  int length = key.length();
+  int copy_length = length;
+  if constexpr (sizeof(DestChar) == 1) {
+    // CopyChars has fast paths for small integer lengths, and is generally a
+    // little faster if we round the length up to the nearest 4. This is still
+    // within the bounds of the object on the heap, because object alignment is
+    // never less than 4 for any build configuration.
+    constexpr int kRounding = 4;
+    static_assert(kRounding <= kObjectAlignment);
+    copy_length = RoundUp(length, kRounding);
+  }
+  // Add three for the quote marks and colon, to determine how much output space
+  // is needed. We might actually require a little less output space than this,
+  // depending on how much rounding happened above, but it's more important to
+  // compute the requirement quickly than to be precise.
+  int required_length = copy_length + 3;
+  if (!CurrentPartCanFit(required_length)) {
+    return false;
+  }
+  NoExtendBuilder<DestChar> no_extend(
+      reinterpret_cast<DestChar*>(part_ptr_) + current_index_, &current_index_);
+  no_extend.Append('"');
+  base::Vector<const uint8_t> chars(
+      SeqOneByteString::cast(key)->GetChars(no_gc), copy_length);
+  DCHECK_LE(reinterpret_cast<Address>(chars.end()),
+            key.address() + key.Size(isolate_));
+#if DEBUG
+  for (int i = 0; i < length; ++i) {
+    DCHECK(DoNotEscape(chars[i]));
+  }
+#endif  // DEBUG
+  no_extend.AppendChars(chars, length);
+  no_extend.Append('"');
+  no_extend.Append(':');
+  return true;
 }
 
 template <>
 bool JsonStringifier::DoNotEscape(uint8_t c) {
   // https://tc39.github.io/ecma262/#table-json-single-character-escapes
-  return base::IsInRange(c, static_cast<uint8_t>(0x23),
-                         static_cast<uint8_t>(0x7E)) &&
-         c != 0x5C;
+  return JsonDoNotEscapeFlagTable[c];
 }
 
 template <>
 bool JsonStringifier::DoNotEscape(uint16_t c) {
   // https://tc39.github.io/ecma262/#table-json-single-character-escapes
-  return c >= 0x23 && c != 0x5C && c != 0x7F && (c < 0xD800 || c > 0xDFFF);
+  return (c >= 0x20 && c <= 0x21) ||
+         (c >= 0x23 && c != 0x5C && (c < 0xD800 || c > 0xDFFF));
 }
 
 void JsonStringifier::NewLine() {
@@ -1114,40 +1396,89 @@ void JsonStringifier::NewLine() {
 }
 
 void JsonStringifier::NewLineOutline() {
-  builder_.AppendCharacter('\n');
-  for (int i = 0; i < indent_; i++) builder_.AppendCString(gap_);
+  AppendCharacter('\n');
+  for (int i = 0; i < indent_; i++) AppendCString(gap_);
 }
 
 void JsonStringifier::Separator(bool first) {
-  if (!first) builder_.AppendCharacter(',');
+  if (!first) AppendCharacter(',');
   NewLine();
 }
 
 void JsonStringifier::SerializeDeferredKey(bool deferred_comma,
                                            Handle<Object> deferred_key) {
   Separator(!deferred_comma);
-  SerializeString(Handle<String>::cast(deferred_key));
-  builder_.AppendCharacter(':');
-  if (gap_ != nullptr) builder_.AppendCharacter(' ');
+  Handle<String> string_key = Handle<String>::cast(deferred_key);
+  bool wrote_simple =
+      encoding_ == String::ONE_BYTE_ENCODING
+          ? TrySerializeSimplePropertyKey<uint8_t>(*string_key)
+          : TrySerializeSimplePropertyKey<base::uc16>(*string_key);
+
+  if (!wrote_simple) {
+    bool required_escaping = SerializeString<false>(string_key);
+    if (!required_escaping) {
+      key_cache_.TryInsert(*string_key, isolate_);
+    }
+    AppendCharacter(':');
+  }
+
+  if (gap_ != nullptr) AppendCharacter(' ');
 }
 
-void JsonStringifier::SerializeString(Handle<String> object) {
+template <bool raw_json>
+bool JsonStringifier::SerializeString(Handle<String> object) {
   object = String::Flatten(isolate_, object);
-  if (builder_.CurrentEncoding() == String::ONE_BYTE_ENCODING) {
+  if (encoding_ == String::ONE_BYTE_ENCODING) {
     if (String::IsOneByteRepresentationUnderneath(*object)) {
-      SerializeString_<uint8_t, uint8_t>(object);
+      return SerializeString_<uint8_t, uint8_t, raw_json>(object);
     } else {
-      builder_.ChangeEncoding();
-      SerializeString(object);
+      ChangeEncoding();
+      return SerializeString<raw_json>(object);
     }
   } else {
     if (String::IsOneByteRepresentationUnderneath(*object)) {
-      SerializeString_<uint8_t, base::uc16>(object);
+      return SerializeString_<uint8_t, base::uc16, raw_json>(object);
     } else {
-      SerializeString_<base::uc16, base::uc16>(object);
+      return SerializeString_<base::uc16, base::uc16, raw_json>(object);
     }
   }
 }
 
+void JsonStringifier::Extend() {
+  if (part_length_ >= String::kMaxLength) {
+    // Set the flag and carry on. Delay throwing the exception till the end.
+    current_index_ = 0;
+    overflowed_ = true;
+    return;
+  }
+  part_length_ *= kPartLengthGrowthFactor;
+  if (encoding_ == String::ONE_BYTE_ENCODING) {
+    uint8_t* tmp_ptr = new uint8_t[part_length_];
+    memcpy(tmp_ptr, one_byte_ptr_, current_index_);
+    if (one_byte_ptr_ != one_byte_array_) delete[] one_byte_ptr_;
+    one_byte_ptr_ = tmp_ptr;
+    part_ptr_ = one_byte_ptr_;
+  } else {
+    base::uc16* tmp_ptr = new base::uc16[part_length_];
+    for (int i = 0; i < current_index_; i++) {
+      tmp_ptr[i] = two_byte_ptr_[i];
+    }
+    delete[] two_byte_ptr_;
+    two_byte_ptr_ = tmp_ptr;
+    part_ptr_ = two_byte_ptr_;
+  }
+}
+
+void JsonStringifier::ChangeEncoding() {
+  encoding_ = String::TWO_BYTE_ENCODING;
+  two_byte_ptr_ = new base::uc16[part_length_];
+  for (int i = 0; i < current_index_; i++) {
+    two_byte_ptr_[i] = one_byte_ptr_[i];
+  }
+  part_ptr_ = two_byte_ptr_;
+  if (one_byte_ptr_ != one_byte_array_) delete[] one_byte_ptr_;
+  one_byte_ptr_ = nullptr;
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/libplatform/default-platform.cc b/deps/v8/src/libplatform/default-platform.cc
index 2bbbb7e1f47630..958aa0b98413df 100644
--- a/deps/v8/src/libplatform/default-platform.cc
+++ b/deps/v8/src/libplatform/default-platform.cc
@@ -45,13 +45,15 @@ int GetActualThreadPoolSize(int thread_pool_size) {
 std::unique_ptr<v8::Platform> NewDefaultPlatform(
     int thread_pool_size, IdleTaskSupport idle_task_support,
     InProcessStackDumping in_process_stack_dumping,
-    std::unique_ptr<v8::TracingController> tracing_controller) {
+    std::unique_ptr<v8::TracingController> tracing_controller,
+    PriorityMode priority_mode) {
   if (in_process_stack_dumping == InProcessStackDumping::kEnabled) {
     v8::base::debug::EnableInProcessStackDumping();
   }
   thread_pool_size = GetActualThreadPoolSize(thread_pool_size);
   auto platform = std::make_unique<DefaultPlatform>(
-      thread_pool_size, idle_task_support, std::move(tracing_controller));
+      thread_pool_size, idle_task_support, std::move(tracing_controller),
+      priority_mode);
   return platform;
 }
 
@@ -92,11 +94,13 @@ void NotifyIsolateShutdown(v8::Platform* platform, Isolate* isolate) {
 
 DefaultPlatform::DefaultPlatform(
     int thread_pool_size, IdleTaskSupport idle_task_support,
-    std::unique_ptr<v8::TracingController> tracing_controller)
+    std::unique_ptr<v8::TracingController> tracing_controller,
+    PriorityMode priority_mode)
     : thread_pool_size_(thread_pool_size),
       idle_task_support_(idle_task_support),
       tracing_controller_(std::move(tracing_controller)),
-      page_allocator_(std::make_unique<v8::base::PageAllocator>()) {
+      page_allocator_(std::make_unique<v8::base::PageAllocator>()),
+      priority_mode_(priority_mode) {
   if (!tracing_controller_) {
     tracing::TracingController* controller = new tracing::TracingController();
 #if !defined(V8_USE_PERFETTO)
@@ -111,7 +115,11 @@ DefaultPlatform::DefaultPlatform(
 
 DefaultPlatform::~DefaultPlatform() {
   base::MutexGuard guard(&lock_);
-  if (worker_threads_task_runner_) worker_threads_task_runner_->Terminate();
+  if (worker_threads_task_runners_[0]) {
+    for (int i = 0; i < num_worker_runners(); i++) {
+      worker_threads_task_runners_[i]->Terminate();
+    }
+  }
   for (const auto& it : foreground_task_runner_map_) {
     it.second->Terminate();
   }
@@ -127,13 +135,16 @@ double DefaultTimeFunction() {
 }  // namespace
 
 void DefaultPlatform::EnsureBackgroundTaskRunnerInitialized() {
-  DCHECK_NULL(worker_threads_task_runner_);
-  worker_threads_task_runner_ =
-      std::make_shared<DefaultWorkerThreadsTaskRunner>(
-          thread_pool_size_, time_function_for_testing_
-                                 ? time_function_for_testing_
-                                 : DefaultTimeFunction);
-  DCHECK_NOT_NULL(worker_threads_task_runner_);
+  DCHECK_NULL(worker_threads_task_runners_[0]);
+  for (int i = 0; i < num_worker_runners(); i++) {
+    worker_threads_task_runners_[i] =
+        std::make_shared<DefaultWorkerThreadsTaskRunner>(
+            thread_pool_size_,
+            time_function_for_testing_ ? time_function_for_testing_
+                                       : DefaultTimeFunction,
+            priority_from_index(i));
+  }
+  DCHECK_NOT_NULL(worker_threads_task_runners_[0]);
 }
 
 void DefaultPlatform::SetTimeFunctionForTesting(
@@ -200,39 +211,37 @@ std::shared_ptr<TaskRunner> DefaultPlatform::GetForegroundTaskRunner(
   return foreground_task_runner_map_[isolate];
 }
 
-void DefaultPlatform::CallOnWorkerThread(std::unique_ptr<Task> task) {
+void DefaultPlatform::PostTaskOnWorkerThreadImpl(
+    TaskPriority priority, std::unique_ptr<Task> task,
+    const SourceLocation& location) {
   // If this DCHECK fires, then this means that either
   // - V8 is running without the --single-threaded flag but
   //   but the platform was created as a single-threaded platform.
   // - or some component in V8 is ignoring --single-threaded
   //   and posting a background task.
-  DCHECK_NOT_NULL(worker_threads_task_runner_);
-  worker_threads_task_runner_->PostTask(std::move(task));
+  int index = priority_to_index(priority);
+  DCHECK_NOT_NULL(worker_threads_task_runners_[index]);
+  worker_threads_task_runners_[index]->PostTask(std::move(task));
 }
 
-void DefaultPlatform::CallDelayedOnWorkerThread(std::unique_ptr<Task> task,
-                                                double delay_in_seconds) {
+void DefaultPlatform::PostDelayedTaskOnWorkerThreadImpl(
+    TaskPriority priority, std::unique_ptr<Task> task, double delay_in_seconds,
+    const SourceLocation& location) {
   // If this DCHECK fires, then this means that either
   // - V8 is running without the --single-threaded flag but
   //   but the platform was created as a single-threaded platform.
   // - or some component in V8 is ignoring --single-threaded
   //   and posting a background task.
-  DCHECK_NOT_NULL(worker_threads_task_runner_);
-  worker_threads_task_runner_->PostDelayedTask(std::move(task),
-                                               delay_in_seconds);
+  int index = priority_to_index(priority);
+  DCHECK_NOT_NULL(worker_threads_task_runners_[index]);
+  worker_threads_task_runners_[index]->PostDelayedTask(std::move(task),
+                                                       delay_in_seconds);
 }
 
 bool DefaultPlatform::IdleTasksEnabled(Isolate* isolate) {
   return idle_task_support_ == IdleTaskSupport::kEnabled;
 }
 
-std::unique_ptr<JobHandle> DefaultPlatform::PostJob(
-    TaskPriority priority, std::unique_ptr<JobTask> job_task) {
-  std::unique_ptr<JobHandle> handle = CreateJob(priority, std::move(job_task));
-  handle->NotifyConcurrencyIncrease();
-  return handle;
-}
-
 std::unique_ptr<JobHandle> DefaultPlatform::CreateJob(
     TaskPriority priority, std::unique_ptr<JobTask> job_task) {
   size_t num_worker_threads = NumberOfWorkerThreads();
@@ -272,6 +281,13 @@ v8::PageAllocator* DefaultPlatform::GetPageAllocator() {
   return page_allocator_.get();
 }
 
+v8::ThreadIsolatedAllocator* DefaultPlatform::GetThreadIsolatedAllocator() {
+  if (thread_isolated_allocator_.Valid()) {
+    return &thread_isolated_allocator_;
+  }
+  return nullptr;
+}
+
 void DefaultPlatform::NotifyIsolateShutdown(Isolate* isolate) {
   std::shared_ptr<DefaultForegroundTaskRunner> taskrunner;
   {
diff --git a/deps/v8/src/libplatform/default-platform.h b/deps/v8/src/libplatform/default-platform.h
index 4e746fbabba31b..830f3dcfa89d0d 100644
--- a/deps/v8/src/libplatform/default-platform.h
+++ b/deps/v8/src/libplatform/default-platform.h
@@ -14,6 +14,7 @@
 #include "include/v8-platform.h"
 #include "src/base/compiler-specific.h"
 #include "src/base/platform/mutex.h"
+#include "src/libplatform/default-thread-isolated-allocator.h"
 
 namespace v8 {
 namespace platform {
@@ -29,7 +30,8 @@ class V8_PLATFORM_EXPORT DefaultPlatform : public NON_EXPORTED_BASE(Platform) {
   explicit DefaultPlatform(
       int thread_pool_size = 0,
       IdleTaskSupport idle_task_support = IdleTaskSupport::kDisabled,
-      std::unique_ptr<v8::TracingController> tracing_controller = {});
+      std::unique_ptr<v8::TracingController> tracing_controller = {},
+      PriorityMode priority_mode = PriorityMode::kDontApply);
 
   ~DefaultPlatform() override;
 
@@ -55,12 +57,13 @@ class V8_PLATFORM_EXPORT DefaultPlatform : public NON_EXPORTED_BASE(Platform) {
   int NumberOfWorkerThreads() override;
   std::shared_ptr<TaskRunner> GetForegroundTaskRunner(
       v8::Isolate* isolate) override;
-  void CallOnWorkerThread(std::unique_ptr<Task> task) override;
-  void CallDelayedOnWorkerThread(std::unique_ptr<Task> task,
-                                 double delay_in_seconds) override;
+  void PostTaskOnWorkerThreadImpl(TaskPriority priority,
+                                  std::unique_ptr<Task> task,
+                                  const SourceLocation& location) override;
+  void PostDelayedTaskOnWorkerThreadImpl(
+      TaskPriority priority, std::unique_ptr<Task> task,
+      double delay_in_seconds, const SourceLocation& location) override;
   bool IdleTasksEnabled(Isolate* isolate) override;
-  std::unique_ptr<JobHandle> PostJob(
-      TaskPriority priority, std::unique_ptr<JobTask> job_state) override;
   std::unique_ptr<JobHandle> CreateJob(
       TaskPriority priority, std::unique_ptr<JobTask> job_state) override;
   double MonotonicallyIncreasingTime() override;
@@ -68,20 +71,49 @@ class V8_PLATFORM_EXPORT DefaultPlatform : public NON_EXPORTED_BASE(Platform) {
   v8::TracingController* GetTracingController() override;
   StackTracePrinter GetStackTracePrinter() override;
   v8::PageAllocator* GetPageAllocator() override;
+  v8::ThreadIsolatedAllocator* GetThreadIsolatedAllocator() override;
 
   void NotifyIsolateShutdown(Isolate* isolate);
 
  private:
+  base::Thread::Priority priority_from_index(int i) const {
+    if (priority_mode_ == PriorityMode::kDontApply) {
+      return base::Thread::Priority::kDefault;
+    }
+    switch (static_cast<TaskPriority>(i)) {
+      case TaskPriority::kUserBlocking:
+        return base::Thread::Priority::kUserBlocking;
+      case TaskPriority::kUserVisible:
+        return base::Thread::Priority::kUserVisible;
+      case TaskPriority::kBestEffort:
+        return base::Thread::Priority::kBestEffort;
+    }
+  }
+
+  int priority_to_index(TaskPriority priority) const {
+    if (priority_mode_ == PriorityMode::kDontApply) {
+      return 0;
+    }
+    return static_cast<int>(priority);
+  }
+
+  int num_worker_runners() const {
+    return priority_to_index(TaskPriority::kMaxPriority) + 1;
+  }
+
   base::Mutex lock_;
   const int thread_pool_size_;
   IdleTaskSupport idle_task_support_;
-  std::shared_ptr<DefaultWorkerThreadsTaskRunner> worker_threads_task_runner_;
+  std::shared_ptr<DefaultWorkerThreadsTaskRunner> worker_threads_task_runners_
+      [static_cast<int>(TaskPriority::kMaxPriority) + 1] = {0};
   std::map<v8::Isolate*, std::shared_ptr<DefaultForegroundTaskRunner>>
       foreground_task_runner_map_;
 
   std::unique_ptr<TracingController> tracing_controller_;
   std::unique_ptr<PageAllocator> page_allocator_;
+  DefaultThreadIsolatedAllocator thread_isolated_allocator_;
 
+  const PriorityMode priority_mode_;
   TimeFunction time_function_for_testing_ = nullptr;
 };
 
diff --git a/deps/v8/src/libplatform/default-thread-isolated-allocator.cc b/deps/v8/src/libplatform/default-thread-isolated-allocator.cc
new file mode 100644
index 00000000000000..bda0e43cef0f14
--- /dev/null
+++ b/deps/v8/src/libplatform/default-thread-isolated-allocator.cc
@@ -0,0 +1,118 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/libplatform/default-thread-isolated-allocator.h"
+
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+
+#if !V8_OS_LINUX
+#error pkey support in this file is only implemented on Linux
+#endif
+
+#include <sys/mman.h>
+#include <sys/syscall.h>
+#include <sys/utsname.h>
+#include <unistd.h>
+#endif
+
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+
+extern int pkey_alloc(unsigned int flags, unsigned int access_rights) V8_WEAK;
+extern int pkey_free(int pkey) V8_WEAK;
+
+namespace {
+
+bool KernelHasPkruFix() {
+  // PKU was broken on Linux kernels before 5.13 (see
+  // https://lore.kernel.org/all/20210623121456.399107624@linutronix.de/).
+  // A fix is also included in the 5.4.182 and 5.10.103 versions ("x86/fpu:
+  // Correct pkru/xstate inconsistency" by Brian Geffon <bgeffon@google.com>).
+  // Thus check the kernel version we are running on, and bail out if does not
+  // contain the fix.
+  struct utsname uname_buffer;
+  CHECK_EQ(0, uname(&uname_buffer));
+  int kernel, major, minor;
+  // Conservatively return if the release does not match the format we expect.
+  if (sscanf(uname_buffer.release, "%d.%d.%d", &kernel, &major, &minor) != 3) {
+    return false;
+  }
+
+  return kernel > 5 || (kernel == 5 && major >= 13) ||   // anything >= 5.13
+         (kernel == 5 && major == 4 && minor >= 182) ||  // 5.4 >= 5.4.182
+         (kernel == 5 && major == 10 && minor >= 103);   // 5.10 >= 5.10.103
+}
+
+int PkeyAlloc() {
+#ifdef PKEY_DISABLE_WRITE
+  if (!pkey_alloc) return -1;
+
+  static bool kernel_has_pkru_fix = KernelHasPkruFix();
+  if (!kernel_has_pkru_fix) return -1;
+
+  return pkey_alloc(0, PKEY_DISABLE_WRITE);
+#else  // PKEY_DISABLE_WRITE
+  return -1;
+#endif
+}
+
+int PkeyFree(int pkey) {
+  DCHECK(pkey_free);
+  return pkey_free(pkey);
+}
+
+}  // namespace
+
+#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
+
+namespace v8::platform {
+
+DefaultThreadIsolatedAllocator::DefaultThreadIsolatedAllocator()
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+    : pkey_(PkeyAlloc())
+#endif
+{
+}
+
+DefaultThreadIsolatedAllocator::~DefaultThreadIsolatedAllocator() {
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  if (pkey_ != -1) {
+    PkeyFree(pkey_);
+  }
+#endif
+}
+
+// TODO(sroettger): this should return thread isolated (e.g. pkey-tagged) memory
+//                  for testing.
+void* DefaultThreadIsolatedAllocator::Allocate(size_t size) {
+  return malloc(size);
+}
+
+void DefaultThreadIsolatedAllocator::Free(void* object) { free(object); }
+
+enum DefaultThreadIsolatedAllocator::Type DefaultThreadIsolatedAllocator::Type()
+    const {
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  return Type::kPkey;
+#else
+  UNREACHABLE();
+#endif
+}
+
+int DefaultThreadIsolatedAllocator::Pkey() const {
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  return pkey_;
+#else
+  UNREACHABLE();
+#endif
+}
+
+bool DefaultThreadIsolatedAllocator::Valid() const {
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  return pkey_ != -1;
+#else
+  return false;
+#endif
+}
+
+}  // namespace v8::platform
diff --git a/deps/v8/src/libplatform/default-thread-isolated-allocator.h b/deps/v8/src/libplatform/default-thread-isolated-allocator.h
new file mode 100644
index 00000000000000..580df6ee8e4db6
--- /dev/null
+++ b/deps/v8/src/libplatform/default-thread-isolated-allocator.h
@@ -0,0 +1,42 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_LIBPLATFORM_DEFAULT_THREAD_ISOLATED_ALLOCATOR_H_
+#define V8_LIBPLATFORM_DEFAULT_THREAD_ISOLATED_ALLOCATOR_H_
+
+#include "include/libplatform/libplatform-export.h"
+#include "include/v8-platform.h"
+#include "src/base/build_config.h"
+#include "src/base/platform/platform.h"
+
+namespace v8 {
+namespace platform {
+
+class V8_PLATFORM_EXPORT DefaultThreadIsolatedAllocator
+    : public NON_EXPORTED_BASE(ThreadIsolatedAllocator) {
+ public:
+  DefaultThreadIsolatedAllocator();
+
+  ~DefaultThreadIsolatedAllocator() override;
+
+  void* Allocate(size_t size) override;
+
+  void Free(void* object) override;
+
+  enum Type Type() const override;
+
+  int Pkey() const override;
+
+  bool Valid() const;
+
+ private:
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+  const int pkey_;
+#endif
+};
+
+}  // namespace platform
+}  // namespace v8
+
+#endif  // V8_LIBPLATFORM_DEFAULT_THREAD_ISOLATED_ALLOCATOR_H_
diff --git a/deps/v8/src/libplatform/default-worker-threads-task-runner.cc b/deps/v8/src/libplatform/default-worker-threads-task-runner.cc
index 3d57994493b6f9..0d7d895f5430a9 100644
--- a/deps/v8/src/libplatform/default-worker-threads-task-runner.cc
+++ b/deps/v8/src/libplatform/default-worker-threads-task-runner.cc
@@ -4,16 +4,18 @@
 
 #include "src/libplatform/default-worker-threads-task-runner.h"
 
+#include "src/base/platform/time.h"
 #include "src/libplatform/delayed-task-queue.h"
 
 namespace v8 {
 namespace platform {
 
 DefaultWorkerThreadsTaskRunner::DefaultWorkerThreadsTaskRunner(
-    uint32_t thread_pool_size, TimeFunction time_function)
+    uint32_t thread_pool_size, TimeFunction time_function,
+    base::Thread::Priority priority)
     : queue_(time_function), time_function_(time_function) {
   for (uint32_t i = 0; i < thread_pool_size; ++i) {
-    thread_pool_.push_back(std::make_unique<WorkerThread>(this));
+    thread_pool_.push_back(std::make_unique<WorkerThread>(this, priority));
   }
 }
 
@@ -24,9 +26,12 @@ double DefaultWorkerThreadsTaskRunner::MonotonicallyIncreasingTime() {
 }
 
 void DefaultWorkerThreadsTaskRunner::Terminate() {
-  base::MutexGuard guard(&lock_);
-  terminated_ = true;
-  queue_.Terminate();
+  {
+    base::MutexGuard guard(&lock_);
+    terminated_ = true;
+    queue_.Terminate();
+    idle_threads_.clear();
+  }
   // Clearing the thread pool lets all worker threads join.
   thread_pool_.clear();
 }
@@ -35,6 +40,11 @@ void DefaultWorkerThreadsTaskRunner::PostTask(std::unique_ptr<Task> task) {
   base::MutexGuard guard(&lock_);
   if (terminated_) return;
   queue_.Append(std::move(task));
+
+  if (!idle_threads_.empty()) {
+    idle_threads_.back()->Notify();
+    idle_threads_.pop_back();
+  }
 }
 
 void DefaultWorkerThreadsTaskRunner::PostDelayedTask(std::unique_ptr<Task> task,
@@ -42,6 +52,11 @@ void DefaultWorkerThreadsTaskRunner::PostDelayedTask(std::unique_ptr<Task> task,
   base::MutexGuard guard(&lock_);
   if (terminated_) return;
   queue_.AppendDelayed(std::move(task), delay_in_seconds);
+
+  if (!idle_threads_.empty()) {
+    idle_threads_.back()->Notify();
+    idle_threads_.pop_back();
+  }
 }
 
 void DefaultWorkerThreadsTaskRunner::PostIdleTask(
@@ -55,24 +70,51 @@ bool DefaultWorkerThreadsTaskRunner::IdleTasksEnabled() {
   return false;
 }
 
-std::unique_ptr<Task> DefaultWorkerThreadsTaskRunner::GetNext() {
-  return queue_.GetNext();
-}
-
 DefaultWorkerThreadsTaskRunner::WorkerThread::WorkerThread(
-    DefaultWorkerThreadsTaskRunner* runner)
-    : Thread(Options("V8 DefaultWorkerThreadsTaskRunner WorkerThread")),
+    DefaultWorkerThreadsTaskRunner* runner, base::Thread::Priority priority)
+    : Thread(
+          Options("V8 DefaultWorkerThreadsTaskRunner WorkerThread", priority)),
       runner_(runner) {
   CHECK(Start());
 }
 
-DefaultWorkerThreadsTaskRunner::WorkerThread::~WorkerThread() { Join(); }
+DefaultWorkerThreadsTaskRunner::WorkerThread::~WorkerThread() {
+  condition_var_.NotifyAll();
+  Join();
+}
 
 void DefaultWorkerThreadsTaskRunner::WorkerThread::Run() {
-  while (std::unique_ptr<Task> task = runner_->GetNext()) {
-    task->Run();
+  base::MutexGuard guard(&runner_->lock_);
+  while (true) {
+    DelayedTaskQueue::MaybeNextTask next_task = runner_->queue_.TryGetNext();
+    switch (next_task.state) {
+      case DelayedTaskQueue::MaybeNextTask::kTask:
+        runner_->lock_.Unlock();
+        next_task.task->Run();
+        runner_->lock_.Lock();
+        continue;
+      case DelayedTaskQueue::MaybeNextTask::kTerminated:
+        return;
+      case DelayedTaskQueue::MaybeNextTask::kWaitIndefinite:
+        runner_->idle_threads_.push_back(this);
+        condition_var_.Wait(&runner_->lock_);
+        continue;
+      case DelayedTaskQueue::MaybeNextTask::kWaitDelayed:
+        // WaitFor unfortunately doesn't care about our fake time and will wait
+        // the 'real' amount of time, based on whatever clock the system call
+        // uses.
+        runner_->idle_threads_.push_back(this);
+        bool notified =
+            condition_var_.WaitFor(&runner_->lock_, next_task.wait_time);
+        USE(notified);
+        continue;
+    }
   }
 }
 
+void DefaultWorkerThreadsTaskRunner::WorkerThread::Notify() {
+  condition_var_.NotifyAll();
+}
+
 }  // namespace platform
 }  // namespace v8
diff --git a/deps/v8/src/libplatform/default-worker-threads-task-runner.h b/deps/v8/src/libplatform/default-worker-threads-task-runner.h
index 04eb8d4a38088d..05ada23fb705d2 100644
--- a/deps/v8/src/libplatform/default-worker-threads-task-runner.h
+++ b/deps/v8/src/libplatform/default-worker-threads-task-runner.h
@@ -10,6 +10,7 @@
 
 #include "include/libplatform/libplatform-export.h"
 #include "include/v8-platform.h"
+#include "src/base/platform/condition-variable.h"
 #include "src/base/platform/mutex.h"
 #include "src/base/platform/platform.h"
 #include "src/libplatform/delayed-task-queue.h"
@@ -22,8 +23,9 @@ class V8_PLATFORM_EXPORT DefaultWorkerThreadsTaskRunner
  public:
   using TimeFunction = double (*)();
 
-  DefaultWorkerThreadsTaskRunner(uint32_t thread_pool_size,
-                                 TimeFunction time_function);
+  DefaultWorkerThreadsTaskRunner(
+      uint32_t thread_pool_size, TimeFunction time_function,
+      base::Thread::Priority priority = base::Thread::Priority::kDefault);
 
   ~DefaultWorkerThreadsTaskRunner() override;
 
@@ -44,7 +46,8 @@ class V8_PLATFORM_EXPORT DefaultWorkerThreadsTaskRunner
  private:
   class WorkerThread : public base::Thread {
    public:
-    explicit WorkerThread(DefaultWorkerThreadsTaskRunner* runner);
+    explicit WorkerThread(DefaultWorkerThreadsTaskRunner* runner,
+                          base::Thread::Priority priority);
     ~WorkerThread() override;
 
     WorkerThread(const WorkerThread&) = delete;
@@ -53,8 +56,11 @@ class V8_PLATFORM_EXPORT DefaultWorkerThreadsTaskRunner
     // This thread attempts to get tasks in a loop from |runner_| and run them.
     void Run() override;
 
+    void Notify();
+
    private:
     DefaultWorkerThreadsTaskRunner* runner_;
+    base::ConditionVariable condition_var_;
   };
 
   // Called by the WorkerThread. Gets the next take (delayed or immediate) to be
@@ -63,10 +69,14 @@ class V8_PLATFORM_EXPORT DefaultWorkerThreadsTaskRunner
 
   bool terminated_ = false;
   base::Mutex lock_;
+  // Vector of idle threads -- these are pushed in LIFO order, so that the most
+  // recently active thread is the first to be reactivated.
+  std::vector<WorkerThread*> idle_threads_;
   std::vector<std::unique_ptr<WorkerThread>> thread_pool_;
   // Worker threads access this queue, so we can only destroy it after all
   // workers stopped.
   DelayedTaskQueue queue_;
+  std::queue<std::unique_ptr<Task>> task_queue_;
   TimeFunction time_function_;
 };
 
diff --git a/deps/v8/src/libplatform/delayed-task-queue.cc b/deps/v8/src/libplatform/delayed-task-queue.cc
index bd8fd7817fb598..bd32895d099cf0 100644
--- a/deps/v8/src/libplatform/delayed-task-queue.cc
+++ b/deps/v8/src/libplatform/delayed-task-queue.cc
@@ -15,7 +15,6 @@ DelayedTaskQueue::DelayedTaskQueue(TimeFunction time_function)
     : time_function_(time_function) {}
 
 DelayedTaskQueue::~DelayedTaskQueue() {
-  base::MutexGuard guard(&lock_);
   DCHECK(terminated_);
   DCHECK(task_queue_.empty());
 }
@@ -25,10 +24,8 @@ double DelayedTaskQueue::MonotonicallyIncreasingTime() {
 }
 
 void DelayedTaskQueue::Append(std::unique_ptr<Task> task) {
-  base::MutexGuard guard(&lock_);
   DCHECK(!terminated_);
   task_queue_.push(std::move(task));
-  queues_condition_var_.NotifyOne();
 }
 
 void DelayedTaskQueue::AppendDelayed(std::unique_ptr<Task> task,
@@ -36,47 +33,40 @@ void DelayedTaskQueue::AppendDelayed(std::unique_ptr<Task> task,
   DCHECK_GE(delay_in_seconds, 0.0);
   double deadline = MonotonicallyIncreasingTime() + delay_in_seconds;
   {
-    base::MutexGuard guard(&lock_);
     DCHECK(!terminated_);
     delayed_task_queue_.emplace(deadline, std::move(task));
-    queues_condition_var_.NotifyOne();
   }
 }
 
-std::unique_ptr<Task> DelayedTaskQueue::GetNext() {
-  base::MutexGuard guard(&lock_);
+DelayedTaskQueue::MaybeNextTask DelayedTaskQueue::TryGetNext() {
   for (;;) {
     // Move delayed tasks that have hit their deadline to the main queue.
     double now = MonotonicallyIncreasingTime();
-    std::unique_ptr<Task> task = PopTaskFromDelayedQueue(now);
-    while (task) {
+    for (;;) {
+      std::unique_ptr<Task> task = PopTaskFromDelayedQueue(now);
+      if (!task) break;
       task_queue_.push(std::move(task));
-      task = PopTaskFromDelayedQueue(now);
     }
     if (!task_queue_.empty()) {
-      std::unique_ptr<Task> result = std::move(task_queue_.front());
+      std::unique_ptr<Task> task = std::move(task_queue_.front());
       task_queue_.pop();
-      return result;
+      return {MaybeNextTask::kTask, std::move(task), {}};
     }
 
     if (terminated_) {
-      queues_condition_var_.NotifyAll();
-      return nullptr;
+      return {MaybeNextTask::kTerminated, {}, {}};
     }
 
     if (task_queue_.empty() && !delayed_task_queue_.empty()) {
       // Wait for the next delayed task or a newly posted task.
       double wait_in_seconds = delayed_task_queue_.begin()->first - now;
-      base::TimeDelta wait_delta = base::TimeDelta::FromMicroseconds(
-          base::TimeConstants::kMicrosecondsPerSecond * wait_in_seconds);
-
-      // WaitFor unfortunately doesn't care about our fake time and will wait
-      // the 'real' amount of time, based on whatever clock the system call
-      // uses.
-      bool notified = queues_condition_var_.WaitFor(&lock_, wait_delta);
-      USE(notified);
+      return {
+          MaybeNextTask::kWaitDelayed,
+          {},
+          base::TimeDelta::FromMicroseconds(
+              base::TimeConstants::kMicrosecondsPerSecond * wait_in_seconds)};
     } else {
-      queues_condition_var_.Wait(&lock_);
+      return {MaybeNextTask::kWaitIndefinite, {}, {}};
     }
   }
 }
@@ -95,10 +85,8 @@ std::unique_ptr<Task> DelayedTaskQueue::PopTaskFromDelayedQueue(double now) {
 }
 
 void DelayedTaskQueue::Terminate() {
-  base::MutexGuard guard(&lock_);
   DCHECK(!terminated_);
   terminated_ = true;
-  queues_condition_var_.NotifyAll();
 }
 
 }  // namespace platform
diff --git a/deps/v8/src/libplatform/delayed-task-queue.h b/deps/v8/src/libplatform/delayed-task-queue.h
index 8420bbe8e5392f..0c086cb7ce0119 100644
--- a/deps/v8/src/libplatform/delayed-task-queue.h
+++ b/deps/v8/src/libplatform/delayed-task-queue.h
@@ -12,6 +12,7 @@
 #include "include/libplatform/libplatform-export.h"
 #include "src/base/platform/condition-variable.h"
 #include "src/base/platform/mutex.h"
+#include "src/base/platform/time.h"
 
 namespace v8 {
 
@@ -22,6 +23,8 @@ namespace platform {
 // DelayedTaskQueue provides queueing for immediate and delayed tasks. It does
 // not provide any guarantees about ordering of tasks, except that immediate
 // tasks will be run in the order that they are posted.
+//
+// This class is not thread-safe, and should be guarded by a lock.
 class V8_PLATFORM_EXPORT DelayedTaskQueue {
  public:
   using TimeFunction = double (*)();
@@ -35,19 +38,25 @@ class V8_PLATFORM_EXPORT DelayedTaskQueue {
   double MonotonicallyIncreasingTime();
 
   // Appends an immediate task to the queue. The queue takes ownership of
-  // |task|. Tasks appended via this method will be run in order. Thread-safe.
+  // |task|. Tasks appended via this method will be run in order.
   void Append(std::unique_ptr<Task> task);
 
   // Appends a delayed task to the queue. There is no ordering guarantee
   // provided regarding delayed tasks, both with respect to other delayed tasks
-  // and non-delayed tasks that were appended using Append(). Thread-safe.
+  // and non-delayed tasks that were appended using Append().
   void AppendDelayed(std::unique_ptr<Task> task, double delay_in_seconds);
 
-  // Returns the next task to process. Blocks if no task is available.
-  // Returns nullptr if the queue is terminated. Will return either an immediate
-  // task posted using Append() or a delayed task where the deadline has passed,
-  // according to the |time_function| provided in the constructor. Thread-safe.
-  std::unique_ptr<Task> GetNext();
+  struct MaybeNextTask {
+    enum { kTask, kWaitIndefinite, kWaitDelayed, kTerminated } state;
+    std::unique_ptr<Task> task;
+    base::TimeDelta wait_time;
+  };
+  // Returns the next task to process, or the amount of time to wait until the
+  // next delayed task.  Returns nullptr if the queue is terminated. Will return
+  // either an immediate task posted using Append() or a delayed task where the
+  // deadline has passed, according to the |time_function| provided in the
+  // constructor.
+  MaybeNextTask TryGetNext();
 
   // Terminate the queue.
   void Terminate();
@@ -55,8 +64,6 @@ class V8_PLATFORM_EXPORT DelayedTaskQueue {
  private:
   std::unique_ptr<Task> PopTaskFromDelayedQueue(double now);
 
-  base::ConditionVariable queues_condition_var_;
-  base::Mutex lock_;
   std::queue<std::unique_ptr<Task>> task_queue_;
   std::multimap<double, std::unique_ptr<Task>> delayed_task_queue_;
   bool terminated_ = false;
diff --git a/deps/v8/src/libplatform/tracing/trace-event-listener.cc b/deps/v8/src/libplatform/tracing/trace-event-listener.cc
deleted file mode 100644
index 2910d8fab23037..00000000000000
--- a/deps/v8/src/libplatform/tracing/trace-event-listener.cc
+++ /dev/null
@@ -1,27 +0,0 @@
-// Copyright 2019 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/libplatform/tracing/trace-event-listener.h"
-
-#include "protos/perfetto/trace/trace.pb.h"
-#include "src/base/logging.h"
-
-namespace v8 {
-namespace platform {
-namespace tracing {
-
-void TraceEventListener::ParseFromArray(const std::vector<char>& array) {
-  perfetto::protos::Trace trace;
-  CHECK(trace.ParseFromArray(array.data(), static_cast<int>(array.size())));
-
-  for (int i = 0; i < trace.packet_size(); i++) {
-    // TODO(petermarshall): ChromeTracePacket instead.
-    const perfetto::protos::TracePacket& packet = trace.packet(i);
-    ProcessPacket(packet);
-  }
-}
-
-}  // namespace tracing
-}  // namespace platform
-}  // namespace v8
diff --git a/deps/v8/src/libplatform/tracing/trace-event-listener.h b/deps/v8/src/libplatform/tracing/trace-event-listener.h
index f8fa7932e8d810..32a1aa106edd4d 100644
--- a/deps/v8/src/libplatform/tracing/trace-event-listener.h
+++ b/deps/v8/src/libplatform/tracing/trace-event-listener.h
@@ -9,27 +9,19 @@
 
 #include "libplatform/libplatform-export.h"
 
-namespace perfetto {
-namespace protos {
-class TracePacket;
-}  // namespace protos
-}  // namespace perfetto
-
 namespace v8 {
 namespace platform {
 namespace tracing {
 
 // A TraceEventListener is a simple interface that allows subclasses to listen
 // to trace events. This interface is to hide the more complex interactions that
-// the PerfettoConsumer class has to perform. Clients override ProcessPacket()
-// to respond to trace events, e.g. to write them to a file as JSON or for
-// testing purposes.
+// the PerfettoConsumer class has to perform. Clients override ParseFromArray()
+// to process traces, e.g. to write them to a file as JSON or for testing
+// purposes.
 class V8_PLATFORM_EXPORT TraceEventListener {
  public:
   virtual ~TraceEventListener() = default;
-  virtual void ProcessPacket(const ::perfetto::protos::TracePacket& packet) = 0;
-
-  void ParseFromArray(const std::vector<char>& array);
+  virtual void ParseFromArray(const std::vector<char>& array) = 0;
 };
 
 }  // namespace tracing
diff --git a/deps/v8/src/libsampler/sampler.cc b/deps/v8/src/libsampler/sampler.cc
index 83028c9ee81b36..acb9db8e17cd5e 100644
--- a/deps/v8/src/libsampler/sampler.cc
+++ b/deps/v8/src/libsampler/sampler.cc
@@ -5,6 +5,7 @@
 #include "src/libsampler/sampler.h"
 
 #include "include/v8-isolate.h"
+#include "include/v8-platform.h"
 #include "include/v8-unwinder.h"
 
 #ifdef USE_SIGNALS
@@ -380,6 +381,7 @@ bool SignalHandler::signal_handler_installed_ = false;
 
 void SignalHandler::HandleProfilerSignal(int signal, siginfo_t* info,
                                          void* context) {
+  v8::ThreadIsolatedAllocator::SetDefaultPermissionsForSignalHandler();
   USE(info);
   if (signal != SIGPROF) return;
   v8::RegisterState state;
diff --git a/deps/v8/src/logging/code-events.h b/deps/v8/src/logging/code-events.h
index 9faee22ab69ed0..b39e59218ba20b 100644
--- a/deps/v8/src/logging/code-events.h
+++ b/deps/v8/src/logging/code-events.h
@@ -10,7 +10,9 @@
 #include "src/base/platform/mutex.h"
 #include "src/base/vector.h"
 #include "src/common/globals.h"
+#include "src/objects/bytecode-array.h"
 #include "src/objects/code.h"
+#include "src/objects/instruction-stream.h"
 #include "src/objects/name.h"
 #include "src/objects/shared-function-info.h"
 #include "src/objects/string.h"
@@ -88,8 +90,10 @@ class LogEventListener {
   virtual void RegExpCodeCreateEvent(Handle<AbstractCode> code,
                                      Handle<String> source) = 0;
   // Not handlified as this happens during GC. No allocation allowed.
-  virtual void CodeMoveEvent(InstructionStream from, InstructionStream to) = 0;
-  virtual void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) = 0;
+  virtual void CodeMoveEvent(Tagged<InstructionStream> from,
+                             Tagged<InstructionStream> to) = 0;
+  virtual void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                                 Tagged<BytecodeArray> to) = 0;
   virtual void SharedFunctionInfoMoveEvent(Address from, Address to) = 0;
   virtual void NativeContextMoveEvent(Address from, Address to) = 0;
   virtual void CodeMovingGCEvent() = 0;
@@ -107,6 +111,7 @@ class LogEventListener {
   virtual void WeakCodeClearEvent() = 0;
 
   virtual bool is_listening_to_code_events() { return false; }
+  virtual bool allows_code_compaction() { return true; }
 };
 
 // Dispatches code events to a set of registered listeners.
@@ -141,6 +146,13 @@ class Logger {
     return false;
   }
 
+  bool allows_code_compaction() const {
+    for (auto listener : listeners_) {
+      if (!listener->allows_code_compaction()) return false;
+    }
+    return true;
+  }
+
   void CodeCreateEvent(CodeTag tag, Handle<AbstractCode> code,
                        const char* comment) {
     base::MutexGuard guard(&mutex_);
@@ -205,13 +217,14 @@ class Logger {
       listener->RegExpCodeCreateEvent(code, source);
     }
   }
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) {
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) {
     base::MutexGuard guard(&mutex_);
     for (auto listener : listeners_) {
       listener->CodeMoveEvent(from, to);
     }
   }
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) {
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from, Tagged<BytecodeArray> to) {
     base::MutexGuard guard(&mutex_);
     for (auto listener : listeners_) {
       listener->BytecodeMoveEvent(from, to);
diff --git a/deps/v8/src/logging/counters-definitions.h b/deps/v8/src/logging/counters-definitions.h
index f86a7be5f28523..750c33c86797f8 100644
--- a/deps/v8/src/logging/counters-definitions.h
+++ b/deps/v8/src/logging/counters-definitions.h
@@ -13,9 +13,8 @@ namespace internal {
 // Generic range histograms.
 // HR(name, caption, min, max, num_buckets)
 #define HISTOGRAM_RANGE_LIST(HR)                                               \
-  HR(code_cache_reject_reason, V8.CodeCacheRejectReason, 1, 6, 6)              \
+  HR(code_cache_reject_reason, V8.CodeCacheRejectReason, 1, 9, 9)              \
   HR(errors_thrown_per_context, V8.ErrorsThrownPerContext, 0, 200, 20)         \
-  HR(debug_feature_usage, V8.DebugFeatureUsage, 1, 7, 7)                       \
   HR(incremental_marking_reason, V8.GCIncrementalMarkingReason, 0,             \
      kGarbageCollectionReasonMaxValue, kGarbageCollectionReasonMaxValue + 1)   \
   HR(incremental_marking_sum, V8.GCIncrementalMarkingSum, 0, 10000, 101)       \
@@ -47,14 +46,6 @@ namespace internal {
      100 * KB, GB, 51)                                                         \
   HR(wasm_asm_module_size_bytes, V8.WasmModuleSizeBytes.asm, 1, GB, 51)        \
   HR(wasm_wasm_module_size_bytes, V8.WasmModuleSizeBytes.wasm, 1, GB, 51)      \
-  HR(wasm_asm_min_mem_pages_count, V8.WasmMinMemPagesCount.asm, 1, 2 << 16,    \
-     51)                                                                       \
-  HR(wasm_wasm_min_mem_pages_count, V8.WasmMinMemPagesCount.wasm, 1, 2 << 16,  \
-     51)                                                                       \
-  HR(wasm_wasm_max_mem_pages_count, V8.WasmMaxMemPagesCount.wasm, 1, 2 << 16,  \
-     51)                                                                       \
-  HR(wasm_compile_function_peak_memory_bytes,                                  \
-     V8.WasmCompileFunctionPeakMemoryBytes, 1, GB, 51)                         \
   HR(wasm_compile_huge_function_peak_memory_bytes,                             \
      V8.WasmCompileHugeFunctionPeakMemoryBytes, 1, GB, 51)                     \
   HR(asm_module_size_bytes, V8.AsmModuleSizeBytes, 1, GB, 51)                  \
@@ -101,6 +92,8 @@ namespace internal {
   /* Counted after sweeping the table at the end of mark-compact GC. */        \
   HR(external_pointers_count, V8.SandboxedExternalPointersCount, 0,            \
      kMaxExternalPointers, 101)                                                \
+  HR(code_pointers_count, V8.SandboxedCodePointersCount, 0, kMaxCodePointers,  \
+     101)                                                                      \
   HR(wasm_num_lazy_compilations_5sec, V8.WasmNumLazyCompilations5Sec, 0,       \
      200000, 50)                                                               \
   HR(wasm_num_lazy_compilations_20sec, V8.WasmNumLazyCompilations20Sec, 0,     \
@@ -114,7 +107,8 @@ namespace internal {
   /* ExternalPointerTable::TableCompactionOutcome enum for more details. */    \
   HR(external_pointer_table_compaction_outcome,                                \
      V8.ExternalPointerTableCompactionOutcome, 0, 2, 3)                        \
-  HR(wasm_compilation_method, V8.WasmCompilationMethod, 0, 4, 5)
+  HR(wasm_compilation_method, V8.WasmCompilationMethod, 0, 4, 5)               \
+  HR(asmjs_instantiate_result, V8.AsmjsInstantiateResult, 0, 1, 2)
 
 // Like TIMED_HISTOGRAM_LIST, but allows the use of NestedTimedHistogramScope.
 // HT(name, caption, max, unit)
@@ -155,20 +149,66 @@ namespace internal {
 // Timer histograms, thread safe: HT(name, caption, max, unit)
 #define TIMED_HISTOGRAM_LIST(HT)                                               \
   /* Garbage collection timers. */                                             \
-  HT(gc_compactor, V8.GCCompactor, 10000, MILLISECOND)                         \
-  HT(gc_compactor_background, V8.GCCompactorBackground, 10000, MILLISECOND)    \
-  HT(gc_compactor_foreground, V8.GCCompactorForeground, 10000, MILLISECOND)    \
-  HT(gc_finalize, V8.GCFinalizeMC, 10000, MILLISECOND)                         \
-  HT(gc_finalize_background, V8.GCFinalizeMCBackground, 10000, MILLISECOND)    \
-  HT(gc_finalize_foreground, V8.GCFinalizeMCForeground, 10000, MILLISECOND)    \
-  HT(gc_finalize_measure_memory, V8.GCFinalizeMCMeasureMemory, 10000,          \
+  HT(gc_finalize_incremental_regular,                                          \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.Regular, 10000,          \
+     MILLISECOND)                                                              \
+  HT(gc_finalize_incremental_regular_foreground,                               \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.Regular.Foreground,      \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_incremental_regular_background,                               \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.Regular.Background,      \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_incremental_memory_reducing,                                  \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.ReduceMemory, 10000,     \
      MILLISECOND)                                                              \
-  HT(gc_finalize_reduce_memory, V8.GCFinalizeMCReduceMemory, 10000,            \
+  HT(gc_finalize_incremental_memory_reducing_foreground,                       \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.ReduceMemory.Foreground, \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_incremental_memory_reducing_background,                       \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.ReduceMemory.Background, \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_incremental_memory_measure,                                   \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.MeasureMemory, 10000,    \
      MILLISECOND)                                                              \
-  HT(gc_finalize_reduce_memory_background,                                     \
-     V8.GCFinalizeMCReduceMemoryBackground, 10000, MILLISECOND)                \
-  HT(gc_finalize_reduce_memory_foreground,                                     \
-     V8.GCFinalizeMCReduceMemoryForeground, 10000, MILLISECOND)                \
+  HT(gc_finalize_incremental_memory_measure_foreground,                        \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.MeasureMemory            \
+         .Foreground,                                                          \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_incremental_memory_measure_background,                        \
+     V8.GC.Event.MainThread.Full.Finalize.Incremental.MeasureMemory            \
+         .Background,                                                          \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_non_incremental_regular,                                      \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.Regular, 10000,       \
+     MILLISECOND)                                                              \
+  HT(gc_finalize_non_incremental_regular_foreground,                           \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.Regular.Foreground,   \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_non_incremental_regular_background,                           \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.Regular.Background,   \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_non_incremental_memory_reducing,                              \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.ReduceMemory, 10000,  \
+     MILLISECOND)                                                              \
+  HT(gc_finalize_non_incremental_memory_reducing_foreground,                   \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.ReduceMemory          \
+         .Foreground,                                                          \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_non_incremental_memory_reducing_background,                   \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.ReduceMemory          \
+         .Background,                                                          \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_non_incremental_memory_measure,                               \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.MeasureMemory, 10000, \
+     MILLISECOND)                                                              \
+  HT(gc_finalize_non_incremental_memory_measure_foreground,                    \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.MeasureMemory         \
+         .Foreground,                                                          \
+     10000, MILLISECOND)                                                       \
+  HT(gc_finalize_non_incremental_memory_measure_background,                    \
+     V8.GC.Event.MainThread.Full.Finalize.NonIncremental.MeasureMemory         \
+         .Background,                                                          \
+     10000, MILLISECOND)                                                       \
   HT(measure_memory_delay_ms, V8.MeasureMemoryDelayMilliseconds, 100000,       \
      MILLISECOND)                                                              \
   HT(gc_time_to_global_safepoint, V8.GC.TimeToGlobalSafepoint, 10000000,       \
@@ -220,8 +260,6 @@ namespace internal {
      V8.WasmFinishModuleStreamingMicroSeconds, 100000000, MICROSECOND)         \
   HT(wasm_deserialization_time, V8.WasmDeserializationTimeMilliSeconds, 10000, \
      MILLISECOND)                                                              \
-  HT(wasm_tier_up_module_time, V8.WasmTierUpModuleMicroSeconds, 100000000,     \
-     MICROSECOND)                                                              \
   HT(wasm_compile_asm_function_time, V8.WasmCompileFunctionMicroSeconds.asm,   \
      1000000, MICROSECOND)                                                     \
   HT(wasm_compile_wasm_function_time, V8.WasmCompileFunctionMicroSeconds.wasm, \
@@ -323,6 +361,7 @@ namespace internal {
      V8.GCCompactorCausedByOldspaceExhaustion)                                 \
   SC(enum_cache_hits, V8.EnumCacheHits)                                        \
   SC(enum_cache_misses, V8.EnumCacheMisses)                                    \
+  SC(maps_created, V8.MapsCreated)                                             \
   SC(megamorphic_stub_cache_updates, V8.MegamorphicStubCacheUpdates)           \
   SC(regexp_entry_runtime, V8.RegExpEntryRuntime)                              \
   SC(stack_interrupts, V8.StackInterrupts)                                     \
diff --git a/deps/v8/src/logging/counters.cc b/deps/v8/src/logging/counters.cc
index ad8da51d85bf35..69e90957d7fd5e 100644
--- a/deps/v8/src/logging/counters.cc
+++ b/deps/v8/src/logging/counters.cc
@@ -99,202 +99,165 @@ bool TimedHistogram::ToggleRunningState(bool expect_to_run) const {
 }
 #endif
 
-Counters::Counters(Isolate* isolate)
-    :
-#ifdef V8_RUNTIME_CALL_STATS
-      runtime_call_stats_(RuntimeCallStats::kMainIsolateThread),
-      worker_thread_runtime_call_stats_(),
-#endif
-      isolate_(isolate),
-      stats_table_(this) {
-  static const struct {
-    Histogram Counters::*member;
-    const char* caption;
-    int min;
-    int max;
-    int num_buckets;
-  } kHistograms[] = {
-#define HR(name, caption, min, max, num_buckets) \
-  {&Counters::name##_, #caption, min, max, num_buckets},
-      HISTOGRAM_RANGE_LIST(HR)
-#undef HR
-  };
-  for (const auto& histogram : kHistograms) {
-    (this->*histogram.member)
-        .Initialize(histogram.caption, histogram.min, histogram.max,
-                    histogram.num_buckets, this);
-  }
-
-  const int DefaultTimedHistogramNumBuckets = 50;
-
-  static const struct {
-    NestedTimedHistogram Counters::*member;
-    const char* caption;
-    int max;
-    TimedHistogramResolution res;
-  } kNestedTimedHistograms[] = {
-#define HT(name, caption, max, res) \
-  {&Counters::name##_, #caption, max, TimedHistogramResolution::res},
-      NESTED_TIMED_HISTOGRAM_LIST(HT) NESTED_TIMED_HISTOGRAM_LIST_SLOW(HT)
-#undef HT
-  };
-  for (const auto& timer : kNestedTimedHistograms) {
-    (this->*timer.member)
-        .Initialize(timer.caption, 0, timer.max, timer.res,
-                    DefaultTimedHistogramNumBuckets, this);
-  }
-
-  static const struct {
-    TimedHistogram Counters::*member;
-    const char* caption;
-    int max;
-    TimedHistogramResolution res;
-  } kTimedHistograms[] = {
-#define HT(name, caption, max, res) \
-  {&Counters::name##_, #caption, max, TimedHistogramResolution::res},
-      TIMED_HISTOGRAM_LIST(HT)
-#undef HT
-  };
-  for (const auto& timer : kTimedHistograms) {
-    (this->*timer.member)
-        .Initialize(timer.caption, 0, timer.max, timer.res,
-                    DefaultTimedHistogramNumBuckets, this);
-  }
+namespace {
+static constexpr int DefaultTimedHistogramNumBuckets = 50;
+}
 
-  static const struct {
-    AggregatableHistogramTimer Counters::*member;
-    const char* caption;
-  } kAggregatableHistogramTimers[] = {
-#define AHT(name, caption) {&Counters::name##_, #caption},
-      AGGREGATABLE_HISTOGRAM_TIMER_LIST(AHT)
-#undef AHT
-  };
-  for (const auto& aht : kAggregatableHistogramTimers) {
-    (this->*aht.member)
-        .Initialize(aht.caption, 0, 10000000, DefaultTimedHistogramNumBuckets,
-                    this);
-  }
+void CountersInitializer::Visit(Histogram* histogram, const char* caption,
+                                int min, int max, int num_buckets) {
+  histogram->Initialize(caption, min, max, num_buckets, counters());
+}
 
-  static const struct {
-    Histogram Counters::*member;
-    const char* caption;
-  } kHistogramPercentages[] = {
-#define HP(name, caption) {&Counters::name##_, #caption},
-      HISTOGRAM_PERCENTAGE_LIST(HP)
-#undef HP
-  };
-  for (const auto& percentage : kHistogramPercentages) {
-    (this->*percentage.member)
-        .Initialize(percentage.caption, 0, 101, 100, this);
-  }
+void CountersInitializer::Visit(PercentageHistogram* histogram,
+                                const char* caption) {
+  histogram->Initialize(caption, 0, 101, 100, counters());
+}
 
+void CountersInitializer::Visit(LegacyMemoryHistogram* histogram,
+                                const char* caption) {
   // Exponential histogram assigns bucket limits to points
   // p[1], p[2], ... p[n] such that p[i+1] / p[i] = constant.
   // The constant factor is equal to the n-th root of (high / low),
   // where the n is the number of buckets, the low is the lower limit,
   // the high is the upper limit.
   // For n = 50, low = 1000, high = 500000: the factor = 1.13.
-  static const struct {
-    Histogram Counters::*member;
-    const char* caption;
-  } kLegacyMemoryHistograms[] = {
-#define HM(name, caption) {&Counters::name##_, #caption},
-      HISTOGRAM_LEGACY_MEMORY_LIST(HM)
-#undef HM
-  };
-  for (const auto& histogram : kLegacyMemoryHistograms) {
-    (this->*histogram.member)
-        .Initialize(histogram.caption, 1000, 500000, 50, this);
-  }
+  histogram->Initialize(caption, 1000, 500000, 50, counters());
+}
 
-  static constexpr struct {
-    StatsCounter Counters::*member;
-    const char* caption;
-  } kStatsCounters[] = {
-#define SC(name, caption) {&Counters::name##_, "c:" caption},
-#define BARE_SC(name, caption) SC(name, #caption)
-#define COUNT_AND_SIZE_SC(name)            \
-  SC(count_of_##name, "V8.CountOf_" #name) \
-  SC(size_of_##name, "V8.SizeOf_" #name)
-#define CODE_KIND_SC(name) COUNT_AND_SIZE_SC(CODE_TYPE_##name)
-#define FIXED_ARRAY_INSTANCE_TYPE_SC(name) COUNT_AND_SIZE_SC(FIXED_ARRAY_##name)
-
-      // clang-format off
-  STATS_COUNTER_LIST(BARE_SC)
-  STATS_COUNTER_NATIVE_CODE_LIST(BARE_SC)
-  INSTANCE_TYPE_LIST(COUNT_AND_SIZE_SC)
-  CODE_KIND_LIST(CODE_KIND_SC)
-  FIXED_ARRAY_SUB_INSTANCE_TYPE_LIST(FIXED_ARRAY_INSTANCE_TYPE_SC)
-  // clang-format on
-
-#undef FIXED_ARRAY_INSTANCE_TYPE_SC
-#undef CODE_KIND_SC
-#undef COUNT_AND_SIZE_SC
-#undef BARE_SC
-#undef SC
-  };
-  for (const auto& counter : kStatsCounters) {
-    (this->*counter.member).Init(this, counter.caption);
-  }
+void CountersInitializer::Visit(TimedHistogram* histogram, const char* caption,
+                                int max, TimedHistogramResolution res) {
+  histogram->Initialize(caption, 0, max, res, DefaultTimedHistogramNumBuckets,
+                        counters());
 }
 
-void Counters::ResetCounterFunction(CounterLookupCallback f) {
-  stats_table_.SetCounterFunction(f);
+void CountersInitializer::Visit(NestedTimedHistogram* histogram,
+                                const char* caption, int max,
+                                TimedHistogramResolution res) {
+  histogram->Initialize(caption, 0, max, res, DefaultTimedHistogramNumBuckets,
+                        counters());
+}
 
-#define SC(name, caption) name##_.Reset();
-  STATS_COUNTER_LIST(SC)
-  STATS_COUNTER_NATIVE_CODE_LIST(SC)
-#undef SC
+void CountersInitializer::Visit(AggregatableHistogramTimer* histogram,
+                                const char* caption) {
+  histogram->Initialize(caption, 0, 10000000, DefaultTimedHistogramNumBuckets,
+                        counters());
+}
 
-#define SC(name)              \
-  count_of_##name##_.Reset(); \
-  size_of_##name##_.Reset();
-  INSTANCE_TYPE_LIST(SC)
-#undef SC
+void CountersInitializer::Visit(StatsCounter* counter, const char* caption) {
+  counter->Initialize(caption, counters());
+}
 
-#define SC(name)                        \
-  count_of_CODE_TYPE_##name##_.Reset(); \
-  size_of_CODE_TYPE_##name##_.Reset();
-  CODE_KIND_LIST(SC)
-#undef SC
+Counters::Counters(Isolate* isolate)
+    :
+#ifdef V8_RUNTIME_CALL_STATS
+      runtime_call_stats_(RuntimeCallStats::kMainIsolateThread),
+      worker_thread_runtime_call_stats_(),
+#endif
+      isolate_(isolate),
+      stats_table_(this) {
+  CountersInitializer init(this);
+  init.Start();
+}
 
-#define SC(name)                          \
-  count_of_FIXED_ARRAY_##name##_.Reset(); \
-  size_of_FIXED_ARRAY_##name##_.Reset();
-  FIXED_ARRAY_SUB_INSTANCE_TYPE_LIST(SC)
-#undef SC
+void StatsCounterResetter::VisitStatsCounter(StatsCounter* counter,
+                                             const char* caption) {
+  counter->Reset();
+}
+
+void Counters::ResetCounterFunction(CounterLookupCallback f) {
+  stats_table_.SetCounterFunction(f);
+  StatsCounterResetter resetter(this);
+  resetter.Start();
+}
+
+void HistogramResetter::VisitHistogram(Histogram* histogram,
+                                       const char* caption) {
+  histogram->Reset();
 }
 
 void Counters::ResetCreateHistogramFunction(CreateHistogramCallback f) {
   stats_table_.SetCreateHistogramFunction(f);
+  HistogramResetter resetter(this);
+  resetter.Start();
+}
 
-#define HR(name, caption, min, max, num_buckets) name##_.Reset();
+void CountersVisitor::Start() {
+  VisitStatsCounters();
+  VisitHistograms();
+}
+
+void CountersVisitor::VisitHistograms() {
+#define HR(name, caption, min, max, num_buckets) \
+  Visit(&counters()->name##_, #caption, min, max, num_buckets);
   HISTOGRAM_RANGE_LIST(HR)
 #undef HR
 
-#define HT(name, caption, max, res) name##_.Reset();
+#define HR(name, caption) Visit(&counters()->name##_, #caption);
+  HISTOGRAM_PERCENTAGE_LIST(HR)
+#undef HR
+
+#define HR(name, caption) Visit(&counters()->name##_, #caption);
+  HISTOGRAM_LEGACY_MEMORY_LIST(HR)
+#undef HR
+
+#define HT(name, caption, max, res) \
+  Visit(&counters()->name##_, #caption, max, TimedHistogramResolution::res);
   NESTED_TIMED_HISTOGRAM_LIST(HT)
 #undef HT
 
-#define HT(name, caption, max, res) name##_.Reset();
+#define HT(name, caption, max, res) \
+  Visit(&counters()->name##_, #caption, max, TimedHistogramResolution::res);
   NESTED_TIMED_HISTOGRAM_LIST_SLOW(HT)
 #undef HT
 
-#define HT(name, caption, max, res) name##_.Reset();
+#define HT(name, caption, max, res) \
+  Visit(&counters()->name##_, #caption, max, TimedHistogramResolution::res);
   TIMED_HISTOGRAM_LIST(HT)
 #undef HT
 
-#define AHT(name, caption) name##_.Reset();
+#define AHT(name, caption) Visit(&counters()->name##_, #caption);
   AGGREGATABLE_HISTOGRAM_TIMER_LIST(AHT)
 #undef AHT
+}
+
+void CountersVisitor::VisitStatsCounters() {
+#define SC(name, caption) Visit(&counters()->name##_, "c:" #caption);
+  STATS_COUNTER_LIST(SC)
+  STATS_COUNTER_NATIVE_CODE_LIST(SC)
+#undef SC
+}
+
+void CountersVisitor::Visit(Histogram* histogram, const char* caption, int min,
+                            int max, int num_buckets) {
+  VisitHistogram(histogram, caption);
+}
+void CountersVisitor::Visit(TimedHistogram* histogram, const char* caption,
+                            int max, TimedHistogramResolution res) {
+  VisitHistogram(histogram, caption);
+}
+void CountersVisitor::Visit(NestedTimedHistogram* histogram,
+                            const char* caption, int max,
+                            TimedHistogramResolution res) {
+  VisitHistogram(histogram, caption);
+}
 
-#define HP(name, caption) name##_.Reset();
-  HISTOGRAM_PERCENTAGE_LIST(HP)
-#undef HP
+void CountersVisitor::Visit(AggregatableHistogramTimer* histogram,
+                            const char* caption) {
+  VisitHistogram(histogram, caption);
+}
+
+void CountersVisitor::Visit(PercentageHistogram* histogram,
+                            const char* caption) {
+  VisitHistogram(histogram, caption);
+}
+
+void CountersVisitor::Visit(LegacyMemoryHistogram* histogram,
+                            const char* caption) {
+  VisitHistogram(histogram, caption);
+}
 
-#define HM(name, caption) name##_.Reset();
-  HISTOGRAM_LEGACY_MEMORY_LIST(HM)
-#undef HM
+void CountersVisitor::Visit(StatsCounter* counter, const char* caption) {
+  VisitStatsCounter(counter, caption);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/logging/counters.h b/deps/v8/src/logging/counters.h
index f62a15b0c6fd71..b2f958326ffba8 100644
--- a/deps/v8/src/logging/counters.h
+++ b/deps/v8/src/logging/counters.h
@@ -102,6 +102,7 @@ class StatsTable {
 class StatsCounter {
  public:
   void Set(int value) { GetPtr()->store(value, std::memory_order_relaxed); }
+  int Get() { return GetPtr()->load(); }
 
   void Increment(int value = 1) {
     GetPtr()->fetch_add(value, std::memory_order_relaxed);
@@ -122,8 +123,10 @@ class StatsCounter {
 
  private:
   friend class Counters;
+  friend class CountersInitializer;
+  friend class StatsCounterResetter;
 
-  void Init(Counters* counters, const char* name) {
+  void Initialize(const char* name, Counters* counters) {
     DCHECK_NULL(counters_);
     DCHECK_NOT_NULL(counters);
     // Counter names always start with "c:V8.".
@@ -205,6 +208,8 @@ class Histogram {
 
  private:
   friend class Counters;
+  friend class CountersInitializer;
+  friend class HistogramResetter;
 
   V8_EXPORT_PRIVATE void* CreateHistogram() const;
 
@@ -217,6 +222,11 @@ class Histogram {
   base::Mutex mutex_;
 };
 
+// Dummy classes for better visiting.
+
+class PercentageHistogram : public Histogram {};
+class LegacyMemoryHistogram : public Histogram {};
+
 enum class TimedHistogramResolution { MILLISECOND, MICROSECOND };
 
 // A thread safe histogram timer.
@@ -244,6 +254,8 @@ class TimedHistogram : public Histogram {
   void LogEnd(Isolate* isolate);
 
   friend class Counters;
+  friend class CountersInitializer;
+
   TimedHistogramResolution resolution_;
 
   TimedHistogram() = default;
@@ -550,18 +562,18 @@ class Counters : public std::enable_shared_from_this<Counters> {
   AGGREGATABLE_HISTOGRAM_TIMER_LIST(AHT)
 #undef AHT
 
-#define HP(name, caption)    \
-  Histogram* name() {        \
-    name##_.EnsureCreated(); \
-    return &name##_;         \
+#define HP(name, caption)       \
+  PercentageHistogram* name() { \
+    name##_.EnsureCreated();    \
+    return &name##_;            \
   }
   HISTOGRAM_PERCENTAGE_LIST(HP)
 #undef HP
 
-#define HM(name, caption)    \
-  Histogram* name() {        \
-    name##_.EnsureCreated(); \
-    return &name##_;         \
+#define HM(name, caption)         \
+  LegacyMemoryHistogram* name() { \
+    name##_.EnsureCreated();      \
+    return &name##_;              \
   }
   HISTOGRAM_LEGACY_MEMORY_LIST(HM)
 #undef HM
@@ -598,10 +610,6 @@ class Counters : public std::enable_shared_from_this<Counters> {
 #define COUNTER_ID(name) kCountOfCODE_TYPE_##name, \
     kSizeOfCODE_TYPE_##name,
     CODE_KIND_LIST(COUNTER_ID)
-#undef COUNTER_ID
-#define COUNTER_ID(name) kCountOfFIXED_ARRAY__##name, \
-    kSizeOfFIXED_ARRAY__##name,
-    FIXED_ARRAY_SUB_INSTANCE_TYPE_LIST(COUNTER_ID)
 #undef COUNTER_ID
     stats_counter_count
   };
@@ -622,10 +630,11 @@ class Counters : public std::enable_shared_from_this<Counters> {
 #endif  // V8_RUNTIME_CALL_STATS
 
  private:
-  friend class StatsTable;
-  friend class StatsCounter;
+  friend class CountersVisitor;
   friend class Histogram;
   friend class NestedTimedHistogramScope;
+  friend class StatsCounter;
+  friend class StatsTable;
 
   int* FindLocation(const char* name) {
     return stats_table_.FindLocation(name);
@@ -658,11 +667,11 @@ class Counters : public std::enable_shared_from_this<Counters> {
   AGGREGATABLE_HISTOGRAM_TIMER_LIST(AHT)
 #undef AHT
 
-#define HP(name, caption) Histogram name##_;
+#define HP(name, caption) PercentageHistogram name##_;
   HISTOGRAM_PERCENTAGE_LIST(HP)
 #undef HP
 
-#define HM(name, caption) Histogram name##_;
+#define HM(name, caption) LegacyMemoryHistogram name##_;
   HISTOGRAM_LEGACY_MEMORY_LIST(HM)
 #undef HM
 
@@ -671,24 +680,6 @@ class Counters : public std::enable_shared_from_this<Counters> {
   STATS_COUNTER_NATIVE_CODE_LIST(SC)
 #undef SC
 
-#define SC(name)                  \
-  StatsCounter size_of_##name##_; \
-  StatsCounter count_of_##name##_;
-  INSTANCE_TYPE_LIST(SC)
-#undef SC
-
-#define SC(name)                            \
-  StatsCounter size_of_CODE_TYPE_##name##_; \
-  StatsCounter count_of_CODE_TYPE_##name##_;
-  CODE_KIND_LIST(SC)
-#undef SC
-
-#define SC(name)                              \
-  StatsCounter size_of_FIXED_ARRAY_##name##_; \
-  StatsCounter count_of_FIXED_ARRAY_##name##_;
-  FIXED_ARRAY_SUB_INSTANCE_TYPE_LIST(SC)
-#undef SC
-
 #ifdef V8_RUNTIME_CALL_STATS
   RuntimeCallStats runtime_call_stats_;
   WorkerThreadRuntimeCallStats worker_thread_runtime_call_stats_;
@@ -699,6 +690,70 @@ class Counters : public std::enable_shared_from_this<Counters> {
   DISALLOW_IMPLICIT_CONSTRUCTORS(Counters);
 };
 
+class CountersVisitor {
+ public:
+  explicit CountersVisitor(Counters* counters) : counters_(counters) {}
+
+  void Start();
+  Counters* counters() { return counters_; }
+
+ protected:
+  virtual void VisitHistograms();
+  virtual void VisitStatsCounters();
+
+  virtual void VisitHistogram(Histogram* histogram, const char* caption) {}
+  virtual void VisitStatsCounter(StatsCounter* counter, const char* caption) {}
+
+  virtual void Visit(Histogram* histogram, const char* caption, int min,
+                     int max, int num_buckets);
+  virtual void Visit(TimedHistogram* histogram, const char* caption, int max,
+                     TimedHistogramResolution res);
+  virtual void Visit(NestedTimedHistogram* histogram, const char* caption,
+                     int max, TimedHistogramResolution res);
+  virtual void Visit(AggregatableHistogramTimer* histogram,
+                     const char* caption);
+  virtual void Visit(PercentageHistogram* histogram, const char* caption);
+  virtual void Visit(LegacyMemoryHistogram* histogram, const char* caption);
+  virtual void Visit(StatsCounter* counter, const char* caption);
+
+ private:
+  Counters* counters_;
+};
+
+class CountersInitializer : public CountersVisitor {
+ public:
+  using CountersVisitor::CountersVisitor;
+
+ protected:
+  void Visit(Histogram* histogram, const char* caption, int min, int max,
+             int num_buckets) final;
+  void Visit(TimedHistogram* histogram, const char* caption, int max,
+             TimedHistogramResolution res) final;
+  void Visit(NestedTimedHistogram* histogram, const char* caption, int max,
+             TimedHistogramResolution res) final;
+  void Visit(AggregatableHistogramTimer* histogram, const char* caption) final;
+  void Visit(PercentageHistogram* histogram, const char* caption) final;
+  void Visit(LegacyMemoryHistogram* histogram, const char* caption) final;
+  void Visit(StatsCounter* counter, const char* caption) final;
+};
+
+class StatsCounterResetter : public CountersVisitor {
+ public:
+  using CountersVisitor::CountersVisitor;
+
+ protected:
+  void VisitHistograms() final {}
+  void VisitStatsCounter(StatsCounter* counter, const char* caption) final;
+};
+
+class HistogramResetter : public CountersVisitor {
+ public:
+  using CountersVisitor::CountersVisitor;
+
+ protected:
+  void VisitStatsCounters() final {}
+  void VisitHistogram(Histogram* histogram, const char* caption) final;
+};
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/logging/local-logger.cc b/deps/v8/src/logging/local-logger.cc
index 6792383c6c42ca..1c023cf2a88201 100644
--- a/deps/v8/src/logging/local-logger.cc
+++ b/deps/v8/src/logging/local-logger.cc
@@ -17,22 +17,26 @@ LocalLogger::LocalLogger(Isolate* isolate)
       is_listening_to_code_events_(
           v8_file_logger_->is_listening_to_code_events()) {}
 
-void LocalLogger::ScriptDetails(Script script) {
+void LocalLogger::ScriptDetails(Tagged<Script> script) {
   v8_file_logger_->ScriptDetails(script);
 }
 void LocalLogger::ScriptEvent(ScriptEventType type, int script_id) {
   v8_file_logger_->ScriptEvent(type, script_id);
 }
-void LocalLogger::CodeLinePosInfoRecordEvent(Address code_start,
-                                             ByteArray source_position_table,
-                                             JitCodeEvent::CodeType code_type) {
+void LocalLogger::CodeLinePosInfoRecordEvent(
+    Address code_start, Tagged<ByteArray> source_position_table,
+    JitCodeEvent::CodeType code_type) {
   v8_file_logger_->CodeLinePosInfoRecordEvent(code_start, source_position_table,
                                               code_type);
 }
 
-void LocalLogger::MapCreate(Map map) { v8_file_logger_->MapCreate(map); }
+void LocalLogger::MapCreate(Tagged<Map> map) {
+  v8_file_logger_->MapCreate(map);
+}
 
-void LocalLogger::MapDetails(Map map) { v8_file_logger_->MapDetails(map); }
+void LocalLogger::MapDetails(Tagged<Map> map) {
+  v8_file_logger_->MapDetails(map);
+}
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/logging/local-logger.h b/deps/v8/src/logging/local-logger.h
index 347c4991dd4f11..049cfcecb68f0e 100644
--- a/deps/v8/src/logging/local-logger.h
+++ b/deps/v8/src/logging/local-logger.h
@@ -20,14 +20,14 @@ class LocalLogger {
   bool is_listening_to_code_events() const {
     return is_listening_to_code_events_;
   }
-  void ScriptDetails(Script script);
+  void ScriptDetails(Tagged<Script> script);
   void ScriptEvent(ScriptEventType type, int script_id);
   void CodeLinePosInfoRecordEvent(Address code_start,
-                                  ByteArray source_position_table,
+                                  Tagged<ByteArray> source_position_table,
                                   JitCodeEvent::CodeType code_type);
 
-  void MapCreate(Map map);
-  void MapDetails(Map map);
+  void MapCreate(Tagged<Map> map);
+  void MapDetails(Tagged<Map> map);
 
  private:
   V8FileLogger* v8_file_logger_;
diff --git a/deps/v8/src/logging/log-file.cc b/deps/v8/src/logging/log-file.cc
index d8201d157533d0..af487e7cf3ee54 100644
--- a/deps/v8/src/logging/log-file.cc
+++ b/deps/v8/src/logging/log-file.cc
@@ -17,6 +17,7 @@
 #include "src/logging/log.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/string-inl.h"
+#include "src/objects/tagged.h"
 #include "src/strings/string-stream.h"
 #include "src/utils/version.h"
 
@@ -107,17 +108,17 @@ std::string LogFile::file_name() const { return file_name_; }
 LogFile::MessageBuilder::MessageBuilder(LogFile* log)
     : log_(log), lock_guard_(&log_->mutex_) {}
 
-void LogFile::MessageBuilder::AppendString(String str,
+void LogFile::MessageBuilder::AppendString(Tagged<String> str,
                                            base::Optional<int> length_limit) {
   if (str.is_null()) return;
 
   DisallowGarbageCollection no_gc;  // Ensure string stays valid.
   PtrComprCageBase cage_base = GetPtrComprCageBase(str);
   SharedStringAccessGuardIfNeeded access_guard(str);
-  int length = str.length();
+  int length = str->length();
   if (length_limit) length = std::min(length, *length_limit);
   for (int i = 0; i < length; i++) {
-    uint16_t c = str.Get(i, cage_base, access_guard);
+    uint16_t c = str->Get(i, cage_base, access_guard);
     if (c <= 0xFF) {
       AppendCharacter(static_cast<char>(c));
     } else {
@@ -191,31 +192,31 @@ void LogFile::MessageBuilder::AppendCharacter(char c) {
   }
 }
 
-void LogFile::MessageBuilder::AppendSymbolName(Symbol symbol) {
+void LogFile::MessageBuilder::AppendSymbolName(Tagged<Symbol> symbol) {
   DCHECK(!symbol.is_null());
   OFStream& os = log_->os_;
   os << "symbol(";
-  if (!symbol.description().IsUndefined()) {
+  if (!IsUndefined(symbol->description())) {
     os << "\"";
-    AppendSymbolNameDetails(String::cast(symbol.description()), false);
+    AppendSymbolNameDetails(String::cast(symbol->description()), false);
     os << "\" ";
   }
-  os << "hash " << std::hex << symbol.hash() << std::dec << ")";
+  os << "hash " << std::hex << symbol->hash() << std::dec << ")";
 }
 
-void LogFile::MessageBuilder::AppendSymbolNameDetails(String str,
+void LogFile::MessageBuilder::AppendSymbolNameDetails(Tagged<String> str,
                                                       bool show_impl_info) {
   if (str.is_null()) return;
 
   DisallowGarbageCollection no_gc;  // Ensure string stays valid.
   OFStream& os = log_->os_;
-  int limit = str.length();
+  int limit = str->length();
   if (limit > 0x1000) limit = 0x1000;
   if (show_impl_info) {
-    os << (str.IsOneByteRepresentation() ? 'a' : '2');
+    os << (str->IsOneByteRepresentation() ? 'a' : '2');
     if (StringShape(str).IsExternal()) os << 'e';
     if (StringShape(str).IsInternalized()) os << '#';
-    os << ':' << str.length() << ':';
+    os << ':' << str->length() << ':';
   }
   AppendString(str, limit);
 }
@@ -275,22 +276,23 @@ LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<char>(char c) {
 }
 
 template <>
-LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<String>(
-    String string) {
+LogFile::MessageBuilder& LogFile::MessageBuilder::operator<< <Tagged<String>>(
+    Tagged<String> string) {
   this->AppendString(string);
   return *this;
 }
 
 template <>
-LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<Symbol>(
-    Symbol symbol) {
+LogFile::MessageBuilder& LogFile::MessageBuilder::operator<< <Tagged<Symbol>>(
+    Tagged<Symbol> symbol) {
   this->AppendSymbolName(symbol);
   return *this;
 }
 
 template <>
-LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<Name>(Name name) {
-  if (name.IsString()) {
+LogFile::MessageBuilder& LogFile::MessageBuilder::operator<< <Tagged<Name>>(
+    Tagged<Name> name) {
+  if (IsString(name)) {
     this->AppendString(String::cast(name));
   } else {
     this->AppendSymbolName(Symbol::cast(name));
diff --git a/deps/v8/src/logging/log-file.h b/deps/v8/src/logging/log-file.h
index 4f3de2ff5fd5b0..e23abd4708d222 100644
--- a/deps/v8/src/logging/log-file.h
+++ b/deps/v8/src/logging/log-file.h
@@ -61,7 +61,7 @@ class LogFile {
    public:
     ~MessageBuilder() = default;
 
-    void AppendString(String str,
+    void AppendString(Tagged<String> str,
                       base::Optional<int> length_limit = base::nullopt);
     void AppendString(base::Vector<const char> str);
     void AppendString(const char* str);
@@ -69,7 +69,7 @@ class LogFile {
     void PRINTF_FORMAT(2, 3) AppendFormatString(const char* format, ...);
     void AppendCharacter(char c);
     void AppendTwoByteCharacter(char c1, char c2);
-    void AppendSymbolName(Symbol symbol);
+    void AppendSymbolName(Tagged<Symbol> symbol);
 
     // Delegate insertion to the underlying {log_}.
     // All appended strings are escaped to maintain one-line log entries.
@@ -92,7 +92,7 @@ class LogFile {
     int PRINTF_FORMAT(2, 0)
         FormatStringIntoBuffer(const char* format, va_list args);
 
-    void AppendSymbolNameDetails(String str, bool show_impl_info);
+    void AppendSymbolNameDetails(Tagged<String> str, bool show_impl_info);
 
     void PRINTF_FORMAT(2, 3) AppendRawFormatString(const char* format, ...);
     void AppendRawString(const char* format);
@@ -147,13 +147,14 @@ LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<const char*>(
 template <>
 LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<char>(char c);
 template <>
-LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<String>(
-    String string);
+LogFile::MessageBuilder& LogFile::MessageBuilder::operator<< <Tagged<String>>(
+    Tagged<String> string);
 template <>
-LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<Symbol>(
-    Symbol symbol);
+LogFile::MessageBuilder& LogFile::MessageBuilder::operator<< <Tagged<Symbol>>(
+    Tagged<Symbol> symbol);
 template <>
-LogFile::MessageBuilder& LogFile::MessageBuilder::operator<<<Name>(Name name);
+LogFile::MessageBuilder& LogFile::MessageBuilder::operator<< <Tagged<Name>>(
+    Tagged<Name> name);
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/logging/log-inl.h b/deps/v8/src/logging/log-inl.h
index 602a9758162513..881f85f676999b 100644
--- a/deps/v8/src/logging/log-inl.h
+++ b/deps/v8/src/logging/log-inl.h
@@ -14,8 +14,8 @@ namespace v8 {
 namespace internal {
 
 LogEventListener::CodeTag V8FileLogger::ToNativeByScript(
-    LogEventListener::CodeTag tag, Script script) {
-  if (script.type() != Script::TYPE_NATIVE) return tag;
+    LogEventListener::CodeTag tag, Tagged<Script> script) {
+  if (script->type() != Script::Type::kNative) return tag;
   switch (tag) {
     case LogEventListener::CodeTag::kFunction:
       return LogEventListener::CodeTag::kNativeFunction;
diff --git a/deps/v8/src/logging/log.cc b/deps/v8/src/logging/log.cc
index ca97693465f427..8bd10449687bcf 100644
--- a/deps/v8/src/logging/log.cc
+++ b/deps/v8/src/logging/log.cc
@@ -17,6 +17,7 @@
 #include "src/base/platform/wrappers.h"
 #include "src/builtins/profile-data-reader.h"
 #include "src/codegen/bailout-reason.h"
+#include "src/codegen/compiler.h"
 #include "src/codegen/macro-assembler.h"
 #include "src/codegen/source-position-table.h"
 #include "src/common/assert-scope.h"
@@ -124,17 +125,19 @@ v8::CodeEventType GetCodeEventTypeForTag(LogEventListener::CodeTag tag) {
     PROFILE(isolate_, Call);          \
   }
 
-const char* ComputeMarker(SharedFunctionInfo shared, AbstractCode code) {
+const char* ComputeMarker(Tagged<SharedFunctionInfo> shared,
+                          Tagged<AbstractCode> code) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(shared);
-  CodeKind kind = code.kind(cage_base);
+  CodeKind kind = code->kind(cage_base);
   // We record interpreter trampoline builtin copies as having the
   // "interpreted" marker.
   if (v8_flags.interpreted_frames_native_stack && kind == CodeKind::BUILTIN &&
-      code.has_instruction_stream(cage_base)) {
-    DCHECK_EQ(code.builtin_id(cage_base), Builtin::kInterpreterEntryTrampoline);
+      code->has_instruction_stream(cage_base)) {
+    DCHECK_EQ(code->builtin_id(cage_base),
+              Builtin::kInterpreterEntryTrampoline);
     kind = CodeKind::INTERPRETED_FUNCTION;
   }
-  if (shared.optimization_disabled() &&
+  if (shared->optimization_disabled() &&
       kind == CodeKind::INTERPRETED_FUNCTION) {
     return "";
   }
@@ -166,28 +169,28 @@ class CodeEventLogger::NameBuffer {
     AppendByte(':');
   }
 
-  void AppendName(Name name) {
-    if (name.IsString()) {
+  void AppendName(Tagged<Name> name) {
+    if (IsString(name)) {
       AppendString(String::cast(name));
     } else {
-      Symbol symbol = Symbol::cast(name);
+      Tagged<Symbol> symbol = Symbol::cast(name);
       AppendBytes("symbol(");
-      if (!symbol.description().IsUndefined()) {
+      if (!IsUndefined(symbol->description())) {
         AppendBytes("\"");
-        AppendString(String::cast(symbol.description()));
+        AppendString(String::cast(symbol->description()));
         AppendBytes("\" ");
       }
       AppendBytes("hash ");
-      AppendHex(symbol.hash());
+      AppendHex(symbol->hash());
       AppendByte(')');
     }
   }
 
-  void AppendString(String str) {
+  void AppendString(Tagged<String> str) {
     if (str.is_null()) return;
     int length = 0;
     std::unique_ptr<char[]> c_str =
-        str.ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL, &length);
+        str->ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL, &length);
     AppendBytes(c_str.get(), length);
   }
 
@@ -285,11 +288,11 @@ void CodeEventLogger::CodeCreateEvent(CodeTag tag, Handle<AbstractCode> code,
   name_buffer_->AppendBytes(ComputeMarker(*shared, *code));
   name_buffer_->AppendBytes(shared->DebugNameCStr().get());
   name_buffer_->AppendByte(' ');
-  if (script_name->IsString()) {
+  if (IsString(*script_name)) {
     name_buffer_->AppendString(String::cast(*script_name));
   } else {
     name_buffer_->AppendBytes("symbol(hash ");
-    name_buffer_->AppendHex(Name::cast(*script_name).hash());
+    name_buffer_->AppendHex(Name::cast(*script_name)->hash());
     name_buffer_->AppendByte(')');
   }
   name_buffer_->AppendByte(':');
@@ -339,13 +342,15 @@ class LinuxPerfBasicLogger : public CodeEventLogger {
   explicit LinuxPerfBasicLogger(Isolate* isolate);
   ~LinuxPerfBasicLogger() override;
 
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) override {}
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) override {}
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) override {}
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                         Tagged<BytecodeArray> to) override {}
   void CodeDisableOptEvent(Handle<AbstractCode> code,
                            Handle<SharedFunctionInfo> shared) override {}
 
  private:
-  void LogRecordedBuffer(AbstractCode code,
+  void LogRecordedBuffer(Tagged<AbstractCode> code,
                          MaybeHandle<SharedFunctionInfo> maybe_shared,
                          const char* name, int length) override;
 #if V8_ENABLE_WEBASSEMBLY
@@ -367,9 +372,8 @@ class LinuxPerfBasicLogger : public CodeEventLogger {
   static uint64_t reference_count_;
 };
 
-const char LinuxPerfBasicLogger::kFilenameFormatString[] = "/tmp/perf-%d.map";
-// Extra space for the PID in the filename
-const int LinuxPerfBasicLogger::kFilenameBufferPadding = 16;
+// Extra space for the "perf-%d.map" filename, including the PID.
+const int LinuxPerfBasicLogger::kFilenameBufferPadding = 32;
 
 // static
 base::LazyRecursiveMutex& LinuxPerfBasicLogger::GetFileMutex() {
@@ -378,7 +382,7 @@ base::LazyRecursiveMutex& LinuxPerfBasicLogger::GetFileMutex() {
 }
 
 // The following static variables are protected by
-// LinuxPerfBasicLogger::GetFileMutext().
+// LinuxPerfBasicLogger::GetFileMutex().
 uint64_t LinuxPerfBasicLogger::reference_count_ = 0;
 FILE* LinuxPerfBasicLogger::perf_output_handle_ = nullptr;
 
@@ -390,10 +394,13 @@ LinuxPerfBasicLogger::LinuxPerfBasicLogger(Isolate* isolate)
   // If this is the first logger, open the file.
   if (reference_count_ == 1) {
     CHECK_NULL(perf_output_handle_);
+    CHECK_NOT_NULL(v8_flags.perf_basic_prof_path);
+    const char* base_dir = v8_flags.perf_basic_prof_path;
     // Open the perf JIT dump file.
-    int bufferSize = sizeof(kFilenameFormatString) + kFilenameBufferPadding;
-    base::ScopedVector<char> perf_dump_name(bufferSize);
-    int size = SNPrintF(perf_dump_name, kFilenameFormatString, process_id_);
+    base::ScopedVector<char> perf_dump_name(strlen(base_dir) +
+                                            kFilenameBufferPadding);
+    int size =
+        SNPrintF(perf_dump_name, "%s/perf-%d.map", base_dir, process_id_);
     CHECK_NE(size, -1);
     perf_output_handle_ =
         base::OS::FOpen(perf_dump_name.begin(), base::OS::LogFileOpenMode);
@@ -419,27 +426,33 @@ void LinuxPerfBasicLogger::WriteLogRecordedBuffer(uintptr_t address, int size,
                                                   int name_length) {
   // Linux perf expects hex literals without a leading 0x, while some
   // implementations of printf might prepend one when using the %p format
-  // for pointers, leading to wrongly formatted JIT symbols maps.
+  // for pointers, leading to wrongly formatted JIT symbols maps. On the other
+  // hand, Android's simpleperf does expect a leading 0x.
   //
   // Instead, we use V8PRIxPTR format string and cast pointer to uintpr_t,
   // so that we have control over the exact output format.
+#ifdef V8_OS_ANDROID
+  base::OS::FPrint(perf_output_handle_, "0x%" V8PRIxPTR " 0x%x %.*s\n", address,
+                   size, name_length, name);
+#else
   base::OS::FPrint(perf_output_handle_, "%" V8PRIxPTR " %x %.*s\n", address,
                    size, name_length, name);
+#endif
 }
 
-void LinuxPerfBasicLogger::LogRecordedBuffer(AbstractCode code,
+void LinuxPerfBasicLogger::LogRecordedBuffer(Tagged<AbstractCode> code,
                                              MaybeHandle<SharedFunctionInfo>,
                                              const char* name, int length) {
   DisallowGarbageCollection no_gc;
   PtrComprCageBase cage_base(isolate_);
   if (v8_flags.perf_basic_prof_only_functions &&
-      CodeKindIsBuiltinOrJSFunction(code.kind(cage_base))) {
+      CodeKindIsBuiltinOrJSFunction(code->kind(cage_base))) {
     return;
   }
 
   WriteLogRecordedBuffer(
-      static_cast<uintptr_t>(code.InstructionStart(cage_base)),
-      code.InstructionSize(cage_base), name, length);
+      static_cast<uintptr_t>(code->InstructionStart(cage_base)),
+      code->InstructionSize(cage_base), name, length);
 }
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -621,20 +634,20 @@ void InitializeCodeEvent(Isolate* isolate, CodeEvent* event,
 
 }  // namespace
 
-void ExternalLogEventListener::CodeMoveEvent(InstructionStream from,
-                                             InstructionStream to) {
+void ExternalLogEventListener::CodeMoveEvent(Tagged<InstructionStream> from,
+                                             Tagged<InstructionStream> to) {
   CodeEvent code_event;
-  InitializeCodeEvent(isolate_, &code_event, from.instruction_start(),
-                      to.instruction_start(),
-                      to.code(kAcquireLoad).instruction_size());
+  InitializeCodeEvent(isolate_, &code_event, from->instruction_start(),
+                      to->instruction_start(),
+                      to->code(kAcquireLoad)->instruction_size());
   code_event_handler_->Handle(reinterpret_cast<v8::CodeEvent*>(&code_event));
 }
 
-void ExternalLogEventListener::BytecodeMoveEvent(BytecodeArray from,
-                                                 BytecodeArray to) {
+void ExternalLogEventListener::BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                                                 Tagged<BytecodeArray> to) {
   CodeEvent code_event;
-  InitializeCodeEvent(isolate_, &code_event, from.GetFirstBytecodeAddress(),
-                      to.GetFirstBytecodeAddress(), to.length());
+  InitializeCodeEvent(isolate_, &code_event, from->GetFirstBytecodeAddress(),
+                      to->GetFirstBytecodeAddress(), to->length());
   code_event_handler_->Handle(reinterpret_cast<v8::CodeEvent*>(&code_event));
 }
 
@@ -644,15 +657,17 @@ class LowLevelLogger : public CodeEventLogger {
   LowLevelLogger(Isolate* isolate, const char* file_name);
   ~LowLevelLogger() override;
 
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) override;
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) override;
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) override;
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                         Tagged<BytecodeArray> to) override;
   void CodeDisableOptEvent(Handle<AbstractCode> code,
                            Handle<SharedFunctionInfo> shared) override {}
-  void SnapshotPositionEvent(HeapObject obj, int pos);
+  void SnapshotPositionEvent(Tagged<HeapObject> obj, int pos);
   void CodeMovingGCEvent() override;
 
  private:
-  void LogRecordedBuffer(AbstractCode code,
+  void LogRecordedBuffer(Tagged<AbstractCode> code,
                          MaybeHandle<SharedFunctionInfo> maybe_shared,
                          const char* name, int length) override;
 #if V8_ENABLE_WEBASSEMBLY
@@ -742,19 +757,20 @@ void LowLevelLogger::LogCodeInfo() {
   LogWriteBytes(arch, sizeof(arch));
 }
 
-void LowLevelLogger::LogRecordedBuffer(AbstractCode code,
+void LowLevelLogger::LogRecordedBuffer(Tagged<AbstractCode> code,
                                        MaybeHandle<SharedFunctionInfo>,
                                        const char* name, int length) {
   DisallowGarbageCollection no_gc;
   PtrComprCageBase cage_base(isolate_);
   CodeCreateStruct event;
   event.name_size = length;
-  event.code_address = code.InstructionStart(cage_base);
-  event.code_size = code.InstructionSize(cage_base);
+  event.code_address = code->InstructionStart(cage_base);
+  event.code_size = code->InstructionSize(cage_base);
   LogWriteStruct(event);
   LogWriteBytes(name, length);
-  LogWriteBytes(reinterpret_cast<const char*>(code.InstructionStart(cage_base)),
-                code.InstructionSize(cage_base));
+  LogWriteBytes(
+      reinterpret_cast<const char*>(code->InstructionStart(cage_base)),
+      code->InstructionSize(cage_base));
 }
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -771,18 +787,19 @@ void LowLevelLogger::LogRecordedBuffer(const wasm::WasmCode* code,
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void LowLevelLogger::CodeMoveEvent(InstructionStream from,
-                                   InstructionStream to) {
+void LowLevelLogger::CodeMoveEvent(Tagged<InstructionStream> from,
+                                   Tagged<InstructionStream> to) {
   CodeMoveStruct event;
-  event.from_address = from.instruction_start();
-  event.to_address = to.instruction_start();
+  event.from_address = from->instruction_start();
+  event.to_address = to->instruction_start();
   LogWriteStruct(event);
 }
 
-void LowLevelLogger::BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) {
+void LowLevelLogger::BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                                       Tagged<BytecodeArray> to) {
   CodeMoveStruct event;
-  event.from_address = from.GetFirstBytecodeAddress();
-  event.to_address = to.GetFirstBytecodeAddress();
+  event.from_address = from->GetFirstBytecodeAddress();
+  event.to_address = to->GetFirstBytecodeAddress();
   LogWriteStruct(event);
 }
 
@@ -802,8 +819,10 @@ class JitLogger : public CodeEventLogger {
  public:
   JitLogger(Isolate* isolate, JitCodeEventHandler code_event_handler);
 
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) override;
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) override;
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) override;
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                         Tagged<BytecodeArray> to) override;
   void CodeDisableOptEvent(Handle<AbstractCode> code,
                            Handle<SharedFunctionInfo> shared) override {}
   void AddCodeLinePosInfoEvent(void* jit_handler_data, int pc_offset,
@@ -816,7 +835,7 @@ class JitLogger : public CodeEventLogger {
                            JitCodeEvent::CodeType code_type);
 
  private:
-  void LogRecordedBuffer(AbstractCode code,
+  void LogRecordedBuffer(Tagged<AbstractCode> code,
                          MaybeHandle<SharedFunctionInfo> maybe_shared,
                          const char* name, int length) override;
 #if V8_ENABLE_WEBASSEMBLY
@@ -833,20 +852,20 @@ JitLogger::JitLogger(Isolate* isolate, JitCodeEventHandler code_event_handler)
   DCHECK_NOT_NULL(code_event_handler);
 }
 
-void JitLogger::LogRecordedBuffer(AbstractCode code,
+void JitLogger::LogRecordedBuffer(Tagged<AbstractCode> code,
                                   MaybeHandle<SharedFunctionInfo> maybe_shared,
                                   const char* name, int length) {
   DisallowGarbageCollection no_gc;
   PtrComprCageBase cage_base(isolate_);
   JitCodeEvent event;
   event.type = JitCodeEvent::CODE_ADDED;
-  event.code_start = reinterpret_cast<void*>(code.InstructionStart(cage_base));
-  event.code_type =
-      code.IsCode(cage_base) ? JitCodeEvent::JIT_CODE : JitCodeEvent::BYTE_CODE;
-  event.code_len = code.InstructionSize(cage_base);
+  event.code_start = reinterpret_cast<void*>(code->InstructionStart(cage_base));
+  event.code_type = IsCode(code, cage_base) ? JitCodeEvent::JIT_CODE
+                                            : JitCodeEvent::BYTE_CODE;
+  event.code_len = code->InstructionSize(cage_base);
   Handle<SharedFunctionInfo> shared;
   if (maybe_shared.ToHandle(&shared) &&
-      shared->script(cage_base).IsScript(cage_base)) {
+      IsScript(shared->script(cage_base), cage_base)) {
     event.script = ToApiHandle<v8::UnboundScript>(shared);
   } else {
     event.script = Local<v8::UnboundScript>();
@@ -908,29 +927,37 @@ void JitLogger::LogRecordedBuffer(const wasm::WasmCode* code, const char* name,
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-void JitLogger::CodeMoveEvent(InstructionStream from, InstructionStream to) {
+void JitLogger::CodeMoveEvent(Tagged<InstructionStream> from,
+                              Tagged<InstructionStream> to) {
   base::MutexGuard guard(&logger_mutex_);
 
+  Tagged<Code> code;
+  if (!from->TryGetCodeUnchecked(&code, kAcquireLoad)) {
+    // Not yet fully initialized and no CodeCreateEvent has been emitted yet.
+    return;
+  }
+
   JitCodeEvent event;
   event.type = JitCodeEvent::CODE_MOVED;
   event.code_type = JitCodeEvent::JIT_CODE;
-  event.code_start = reinterpret_cast<void*>(from.instruction_start());
-  event.code_len = from.unchecked_code().instruction_size();
-  event.new_code_start = reinterpret_cast<void*>(to.instruction_start());
+  event.code_start = reinterpret_cast<void*>(from->instruction_start());
+  event.code_len = code->instruction_size();
+  event.new_code_start = reinterpret_cast<void*>(to->instruction_start());
   event.isolate = reinterpret_cast<v8::Isolate*>(isolate_);
 
   code_event_handler_(&event);
 }
 
-void JitLogger::BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) {
+void JitLogger::BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                                  Tagged<BytecodeArray> to) {
   base::MutexGuard guard(&logger_mutex_);
 
   JitCodeEvent event;
   event.type = JitCodeEvent::CODE_MOVED;
   event.code_type = JitCodeEvent::BYTE_CODE;
-  event.code_start = reinterpret_cast<void*>(from.GetFirstBytecodeAddress());
-  event.code_len = from.length();
-  event.new_code_start = reinterpret_cast<void*>(to.GetFirstBytecodeAddress());
+  event.code_start = reinterpret_cast<void*>(from->GetFirstBytecodeAddress());
+  event.code_len = from->length();
+  event.new_code_start = reinterpret_cast<void*>(to->GetFirstBytecodeAddress());
   event.isolate = reinterpret_cast<v8::Isolate*>(isolate_);
 
   code_event_handler_(&event);
@@ -1249,13 +1276,14 @@ void V8FileLogger::SharedLibraryEnd() {
 }
 
 void V8FileLogger::CurrentTimeEvent() {
-  DCHECK(v8_flags.log_internal_timer_events);
+  DCHECK(v8_flags.log_timer_events);
   MSG_BUILDER();
   msg << "current-time" << kNext << Time();
   msg.WriteToLogFile();
 }
 
 void V8FileLogger::TimerEvent(v8::LogEventStatus se, const char* name) {
+  DCHECK(v8_flags.log_timer_events);
   MSG_BUILDER();
   switch (se) {
     case kStart:
@@ -1311,13 +1339,13 @@ void AppendCodeCreateHeader(LogFile::MessageBuilder& msg,
 }
 
 void AppendCodeCreateHeader(Isolate* isolate, LogFile::MessageBuilder& msg,
-                            LogEventListener::CodeTag tag, AbstractCode code,
-                            uint64_t time) {
+                            LogEventListener::CodeTag tag,
+                            Tagged<AbstractCode> code, uint64_t time) {
   PtrComprCageBase cage_base(isolate);
   AppendCodeCreateHeader(
-      msg, tag, code.kind(cage_base),
-      reinterpret_cast<uint8_t*>(code.InstructionStart(cage_base)),
-      code.InstructionSize(cage_base), time);
+      msg, tag, code->kind(cage_base),
+      reinterpret_cast<uint8_t*>(code->InstructionStart(cage_base)),
+      code->InstructionSize(cage_base), time);
 }
 
 }  // namespace
@@ -1346,16 +1374,16 @@ void AppendCodeCreateHeader(Isolate* isolate, LogFile::MessageBuilder& msg,
 void V8FileLogger::LogSourceCodeInformation(Handle<AbstractCode> code,
                                             Handle<SharedFunctionInfo> shared) {
   PtrComprCageBase cage_base(isolate_);
-  Object script_object = shared->script(cage_base);
-  if (!script_object.IsScript(cage_base)) return;
-  Script script = Script::cast(script_object);
+  Tagged<Object> script_object = shared->script(cage_base);
+  if (!IsScript(script_object, cage_base)) return;
+  Tagged<Script> script = Script::cast(script_object);
   EnsureLogScriptSource(script);
 
   if (!v8_flags.log_source_position) return;
   MSG_BUILDER();
   msg << "code-source-info" << V8FileLogger::kNext
       << reinterpret_cast<void*>(code->InstructionStart(cage_base))
-      << V8FileLogger::kNext << script.id() << V8FileLogger::kNext
+      << V8FileLogger::kNext << script->id() << V8FileLogger::kNext
       << shared->StartPosition() << V8FileLogger::kNext << shared->EndPosition()
       << V8FileLogger::kNext;
   // TODO(v8:11429): Clean-up baseline-replated code in source position
@@ -1376,12 +1404,12 @@ void V8FileLogger::LogSourceCodeInformation(Handle<AbstractCode> code,
   msg << V8FileLogger::kNext;
   int maxInlinedId = -1;
   if (hasInlined) {
-    PodArray<InliningPosition> inlining_positions =
+    Tagged<PodArray<InliningPosition>> inlining_positions =
         DeoptimizationData::cast(
             Handle<Code>::cast(code)->deoptimization_data())
-            .InliningPositions();
-    for (int i = 0; i < inlining_positions.length(); i++) {
-      InliningPosition inlining_pos = inlining_positions.get(i);
+            ->InliningPositions();
+    for (int i = 0; i < inlining_positions->length(); i++) {
+      InliningPosition inlining_pos = inlining_positions->get(i);
       msg << "F";
       if (inlining_pos.inlined_function_id != -1) {
         msg << inlining_pos.inlined_function_id;
@@ -1398,13 +1426,13 @@ void V8FileLogger::LogSourceCodeInformation(Handle<AbstractCode> code,
   }
   msg << V8FileLogger::kNext;
   if (hasInlined) {
-    DeoptimizationData deopt_data = DeoptimizationData::cast(
+    Tagged<DeoptimizationData> deopt_data = DeoptimizationData::cast(
         Handle<Code>::cast(code)->deoptimization_data());
     msg << std::hex;
     for (int i = 0; i <= maxInlinedId; i++) {
       msg << "S"
           << reinterpret_cast<void*>(
-                 deopt_data.GetInlinedFunction(i).address());
+                 deopt_data->GetInlinedFunction(i).address());
     }
     msg << std::dec;
   }
@@ -1421,12 +1449,12 @@ void V8FileLogger::LogCodeDisassemble(Handle<AbstractCode> code) {
       << V8FileLogger::kNext;
   {
     std::ostringstream stream;
-    if (code->IsCode(cage_base)) {
+    if (IsCode(*code, cage_base)) {
 #ifdef ENABLE_DISASSEMBLER
-      Code::cast(*code).Disassemble(nullptr, stream, isolate_);
+      Code::cast(*code)->Disassemble(nullptr, stream, isolate_);
 #endif
     } else {
-      BytecodeArray::cast(*code).Disassemble(stream);
+      BytecodeArray::cast(*code)->Disassemble(stream);
     }
     std::string string = stream.str();
     msg.AppendString(string.c_str(), string.length());
@@ -1482,25 +1510,24 @@ void V8FileLogger::CodeCreateEvent(CodeTag tag, Handle<AbstractCode> code,
   LogCodeDisassemble(code);
 }
 
-void V8FileLogger::FeedbackVectorEvent(FeedbackVector vector,
-                                       AbstractCode code) {
+void V8FileLogger::FeedbackVectorEvent(Tagged<FeedbackVector> vector,
+                                       Tagged<AbstractCode> code) {
   DisallowGarbageCollection no_gc;
   if (!v8_flags.log_feedback_vector) return;
   PtrComprCageBase cage_base(isolate_);
   MSG_BUILDER();
   msg << "feedback-vector" << kNext << Time();
   msg << kNext << reinterpret_cast<void*>(vector.address()) << kNext
-      << vector.length();
-  msg << kNext << reinterpret_cast<void*>(code.InstructionStart(cage_base));
-  msg << kNext << vector.tiering_state();
-  msg << kNext << vector.maybe_has_maglev_code();
-  msg << kNext << vector.maybe_has_turbofan_code();
-  msg << kNext << vector.invocation_count();
-  msg << kNext << vector.profiler_ticks() << kNext;
+      << vector->length();
+  msg << kNext << reinterpret_cast<void*>(code->InstructionStart(cage_base));
+  msg << kNext << vector->tiering_state();
+  msg << kNext << vector->maybe_has_maglev_code();
+  msg << kNext << vector->maybe_has_turbofan_code();
+  msg << kNext << vector->invocation_count();
 
 #ifdef OBJECT_PRINT
   std::ostringstream buffer;
-  vector.FeedbackVectorPrint(buffer);
+  vector->FeedbackVectorPrint(buffer);
   std::string contents = buffer.str();
   msg.AppendString(contents.c_str(), contents.length());
 #else
@@ -1552,7 +1579,7 @@ void V8FileLogger::CodeCreateEvent(CodeTag tag, const wasm::WasmCode* code,
   // to the native module + function index works well enough.
   // TODO(herhut) Clean up the tick processor code instead.
   void* tag_ptr =
-      reinterpret_cast<byte*>(code->native_module()) + code->index();
+      reinterpret_cast<uint8_t*>(code->native_module()) + code->index();
   msg << kNext << tag_ptr << kNext << ComputeMarker(code);
   msg.WriteToLogFile();
 }
@@ -1591,16 +1618,18 @@ void V8FileLogger::RegExpCodeCreateEvent(Handle<AbstractCode> code,
   msg.WriteToLogFile();
 }
 
-void V8FileLogger::CodeMoveEvent(InstructionStream from, InstructionStream to) {
+void V8FileLogger::CodeMoveEvent(Tagged<InstructionStream> from,
+                                 Tagged<InstructionStream> to) {
   if (!is_listening_to_code_events()) return;
-  MoveEventInternal(Event::kCodeMove, from.instruction_start(),
-                    to.instruction_start());
+  MoveEventInternal(Event::kCodeMove, from->instruction_start(),
+                    to->instruction_start());
 }
 
-void V8FileLogger::BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) {
+void V8FileLogger::BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                                     Tagged<BytecodeArray> to) {
   if (!is_listening_to_code_events()) return;
-  MoveEventInternal(Event::kCodeMove, from.GetFirstBytecodeAddress(),
-                    to.GetFirstBytecodeAddress());
+  MoveEventInternal(Event::kCodeMove, from->GetFirstBytecodeAddress(),
+                    to->GetFirstBytecodeAddress());
 }
 
 void V8FileLogger::SharedFunctionInfoMoveEvent(Address from, Address to) {
@@ -1627,8 +1656,9 @@ void V8FileLogger::CodeDisableOptEvent(Handle<AbstractCode> code,
 void V8FileLogger::ProcessDeoptEvent(Handle<Code> code, SourcePosition position,
                                      const char* kind, const char* reason) {
   MSG_BUILDER();
-  msg << Event::kCodeDeopt << kNext << Time() << kNext << code->CodeSize()
-      << kNext << reinterpret_cast<void*>(code->InstructionStart());
+  msg << Event::kCodeDeopt << kNext << Time() << kNext
+      << code->InstructionStreamObjectSize() << kNext
+      << reinterpret_cast<void*>(code->instruction_start());
 
   std::ostringstream deopt_location;
   int inlining_id = -1;
@@ -1685,7 +1715,7 @@ void CodeLinePosEvent(JitLogger& jit_logger, Address code_start,
 }  // namespace
 
 void V8FileLogger::CodeLinePosInfoRecordEvent(
-    Address code_start, ByteArray source_position_table,
+    Address code_start, Tagged<ByteArray> source_position_table,
     JitCodeEvent::CodeType code_type) {
   if (!jit_logger_) return;
   SourcePositionTableIterator iter(source_position_table);
@@ -1694,7 +1724,7 @@ void V8FileLogger::CodeLinePosInfoRecordEvent(
 
 #if V8_ENABLE_WEBASSEMBLY
 void V8FileLogger::WasmCodeLinePosInfoRecordEvent(
-    Address code_start, base::Vector<const byte> source_position_table) {
+    Address code_start, base::Vector<const uint8_t> source_position_table) {
   if (!jit_logger_) return;
   SourcePositionTableIterator iter(source_position_table);
   CodeLinePosEvent(*jit_logger_, code_start, iter, JitCodeEvent::WASM_CODE);
@@ -1735,7 +1765,8 @@ void AppendFunctionMessage(LogFile::MessageBuilder& msg, const char* reason,
 
 void V8FileLogger::FunctionEvent(const char* reason, int script_id,
                                  double time_delta, int start_position,
-                                 int end_position, String function_name) {
+                                 int end_position,
+                                 Tagged<String> function_name) {
   if (!v8_flags.log_function_events) return;
   MSG_BUILDER();
   AppendFunctionMessage(msg, reason, script_id, time_delta, start_position,
@@ -1761,17 +1792,17 @@ void V8FileLogger::FunctionEvent(const char* reason, int script_id,
 
 void V8FileLogger::CompilationCacheEvent(const char* action,
                                          const char* cache_type,
-                                         SharedFunctionInfo sfi) {
+                                         Tagged<SharedFunctionInfo> sfi) {
   if (!v8_flags.log_function_events) return;
   MSG_BUILDER();
   int script_id = -1;
-  if (sfi.script().IsScript()) {
-    script_id = Script::cast(sfi.script()).id();
+  if (IsScript(sfi->script())) {
+    script_id = Script::cast(sfi->script())->id();
   }
   msg << "compilation-cache" << V8FileLogger::kNext << action
       << V8FileLogger::kNext << cache_type << V8FileLogger::kNext << script_id
-      << V8FileLogger::kNext << sfi.StartPosition() << V8FileLogger::kNext
-      << sfi.EndPosition() << V8FileLogger::kNext << Time();
+      << V8FileLogger::kNext << sfi->StartPosition() << V8FileLogger::kNext
+      << sfi->EndPosition() << V8FileLogger::kNext << Time();
   msg.WriteToLogFile();
 }
 
@@ -1803,47 +1834,47 @@ void V8FileLogger::ScriptEvent(ScriptEventType type, int script_id) {
   msg.WriteToLogFile();
 }
 
-void V8FileLogger::ScriptDetails(Script script) {
+void V8FileLogger::ScriptDetails(Tagged<Script> script) {
   if (!v8_flags.log_function_events) return;
   {
     MSG_BUILDER();
-    msg << "script-details" << V8FileLogger::kNext << script.id()
+    msg << "script-details" << V8FileLogger::kNext << script->id()
         << V8FileLogger::kNext;
-    if (script.name().IsString()) {
-      msg << String::cast(script.name());
+    if (IsString(script->name())) {
+      msg << String::cast(script->name());
     }
-    msg << V8FileLogger::kNext << script.line_offset() << V8FileLogger::kNext
-        << script.column_offset() << V8FileLogger::kNext;
-    if (script.source_mapping_url().IsString()) {
-      msg << String::cast(script.source_mapping_url());
+    msg << V8FileLogger::kNext << script->line_offset() << V8FileLogger::kNext
+        << script->column_offset() << V8FileLogger::kNext;
+    if (IsString(script->source_mapping_url())) {
+      msg << String::cast(script->source_mapping_url());
     }
     msg.WriteToLogFile();
   }
   EnsureLogScriptSource(script);
 }
 
-bool V8FileLogger::EnsureLogScriptSource(Script script) {
+bool V8FileLogger::EnsureLogScriptSource(Tagged<Script> script) {
   if (!v8_flags.log_source_code) return true;
   // Make sure the script is written to the log file.
-  int script_id = script.id();
+  int script_id = script->id();
   if (logged_source_code_.find(script_id) != logged_source_code_.end()) {
     return true;
   }
   // This script has not been logged yet.
   logged_source_code_.insert(script_id);
-  Object source_object = script.source();
-  if (!source_object.IsString()) return false;
+  Tagged<Object> source_object = script->source();
+  if (!IsString(source_object)) return false;
 
   std::unique_ptr<LogFile::MessageBuilder> msg_ptr = log_->NewMessageBuilder();
   if (!msg_ptr) return false;
   LogFile::MessageBuilder& msg = *msg_ptr.get();
 
-  String source_code = String::cast(source_object);
+  Tagged<String> source_code = String::cast(source_object);
   msg << "script-source" << kNext << script_id << kNext;
 
   // Log the script name.
-  if (script.name().IsString()) {
-    msg << String::cast(script.name()) << kNext;
+  if (IsString(script->name())) {
+    msg << String::cast(script->name()) << kNext;
   } else {
     msg << "<unknown>" << kNext;
   }
@@ -1903,11 +1934,11 @@ void V8FileLogger::ICEvent(const char* type, bool keyed, Handle<Map> map,
       << kNext << line << kNext << column << kNext << old_state << kNext
       << new_state << kNext
       << AsHex::Address(map.is_null() ? kNullAddress : map->ptr()) << kNext;
-  if (key->IsSmi()) {
+  if (IsSmi(*key)) {
     msg << Smi::ToInt(*key);
-  } else if (key->IsNumber()) {
-    msg << key->Number();
-  } else if (key->IsName()) {
+  } else if (IsNumber(*key)) {
+    msg << Object::Number(*key);
+  } else if (IsName(*key)) {
     msg << Name::cast(*key);
   }
   msg << kNext << modifier << kNext;
@@ -1937,20 +1968,18 @@ void V8FileLogger::MapEvent(const char* type, Handle<Map> from, Handle<Map> to,
       << reason << kNext;
 
   if (!name_or_sfi.is_null()) {
-    if (name_or_sfi->IsName()) {
+    if (IsName(*name_or_sfi)) {
       msg << Name::cast(*name_or_sfi);
-    } else if (name_or_sfi->IsSharedFunctionInfo()) {
-      SharedFunctionInfo sfi = SharedFunctionInfo::cast(*name_or_sfi);
-      msg << sfi.DebugNameCStr().get();
-#if V8_SFI_HAS_UNIQUE_ID
-      msg << " " << sfi.unique_id();
-#endif  // V8_SFI_HAS_UNIQUE_ID
+    } else if (IsSharedFunctionInfo(*name_or_sfi)) {
+      Tagged<SharedFunctionInfo> sfi = SharedFunctionInfo::cast(*name_or_sfi);
+      msg << sfi->DebugNameCStr().get();
+      msg << " " << sfi->unique_id();
     }
   }
   msg.WriteToLogFile();
 }
 
-void V8FileLogger::MapCreate(Map map) {
+void V8FileLogger::MapCreate(Tagged<Map> map) {
   if (!v8_flags.log_maps) return;
   DisallowGarbageCollection no_gc;
   MSG_BUILDER();
@@ -1958,7 +1987,7 @@ void V8FileLogger::MapCreate(Map map) {
   msg.WriteToLogFile();
 }
 
-void V8FileLogger::MapDetails(Map map) {
+void V8FileLogger::MapDetails(Tagged<Map> map) {
   if (!v8_flags.log_maps) return;
   DisallowGarbageCollection no_gc;
   MSG_BUILDER();
@@ -1966,12 +1995,21 @@ void V8FileLogger::MapDetails(Map map) {
       << kNext;
   if (v8_flags.log_maps_details) {
     std::ostringstream buffer;
-    map.PrintMapDetails(buffer);
+    map->PrintMapDetails(buffer);
     msg << buffer.str().c_str();
   }
   msg.WriteToLogFile();
 }
 
+void V8FileLogger::MapMoveEvent(Tagged<Map> from, Tagged<Map> to) {
+  if (!v8_flags.log_maps) return;
+  DisallowGarbageCollection no_gc;
+  MSG_BUILDER();
+  msg << "map-move" << kNext << Time() << kNext << AsHex::Address(from.ptr())
+      << kNext << AsHex::Address(to.ptr());
+  msg.WriteToLogFile();
+}
+
 static std::vector<std::pair<Handle<SharedFunctionInfo>, Handle<AbstractCode>>>
 EnumerateCompiledFunctions(Heap* heap) {
   HeapObjectIterator iterator(heap);
@@ -1986,43 +2024,43 @@ EnumerateCompiledFunctions(Heap* heap) {
                      decltype(hash)>
       seen(8, hash);
 
-  auto record = [&](SharedFunctionInfo sfi, AbstractCode c) {
+  auto record = [&](Tagged<SharedFunctionInfo> sfi, Tagged<AbstractCode> c) {
     if (auto [iter, inserted] = seen.emplace(sfi, c); inserted)
       compiled_funcs.emplace_back(handle(sfi, isolate), handle(c, isolate));
   };
 
   // Iterate the heap to find JSFunctions and record their optimized code.
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (obj.IsSharedFunctionInfo()) {
-      SharedFunctionInfo sfi = SharedFunctionInfo::cast(obj);
-      if (sfi.is_compiled() && !sfi.HasBytecodeArray()) {
-        record(sfi, AbstractCode::cast(sfi.abstract_code(isolate)));
+    if (IsSharedFunctionInfo(obj)) {
+      Tagged<SharedFunctionInfo> sfi = SharedFunctionInfo::cast(obj);
+      if (sfi->is_compiled() && !sfi->HasBytecodeArray()) {
+        record(sfi, AbstractCode::cast(sfi->abstract_code(isolate)));
       }
-    } else if (obj.IsJSFunction()) {
+    } else if (IsJSFunction(obj)) {
       // Given that we no longer iterate over all optimized JSFunctions, we need
       // to take care of this here.
-      JSFunction function = JSFunction::cast(obj);
+      Tagged<JSFunction> function = JSFunction::cast(obj);
       // TODO(jarin) This leaves out deoptimized code that might still be on the
       // stack. Also note that we will not log optimized code objects that are
       // only on a type feedback vector. We should make this more precise.
-      if (function.HasAttachedOptimizedCode() &&
-          Script::cast(function.shared().script()).HasValidSource()) {
-        record(function.shared(), AbstractCode::cast(function.code()));
+      if (function->HasAttachedOptimizedCode() &&
+          Script::cast(function->shared()->script())->HasValidSource()) {
+        record(function->shared(), AbstractCode::cast(function->code()));
       }
     }
   }
 
   Script::Iterator script_iterator(heap->isolate());
-  for (Script script = script_iterator.Next(); !script.is_null();
+  for (Tagged<Script> script = script_iterator.Next(); !script.is_null();
        script = script_iterator.Next()) {
-    if (!script.HasValidSource()) continue;
+    if (!script->HasValidSource()) continue;
 
     SharedFunctionInfo::ScriptIterator sfi_iterator(heap->isolate(), script);
-    for (SharedFunctionInfo sfi = sfi_iterator.Next(); !sfi.is_null();
+    for (Tagged<SharedFunctionInfo> sfi = sfi_iterator.Next(); !sfi.is_null();
          sfi = sfi_iterator.Next()) {
-      if (sfi.is_compiled()) {
-        record(sfi, AbstractCode::cast(sfi.abstract_code(isolate)));
+      if (sfi->is_compiled()) {
+        record(sfi, AbstractCode::cast(sfi->abstract_code(isolate)));
       }
     }
   }
@@ -2030,6 +2068,50 @@ EnumerateCompiledFunctions(Heap* heap) {
   return compiled_funcs;
 }
 
+#if defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+static std::vector<Handle<SharedFunctionInfo>> EnumerateInterpretedFunctions(
+    Heap* heap) {
+  HeapObjectIterator iterator(heap);
+  DisallowGarbageCollection no_gc;
+  std::vector<Handle<SharedFunctionInfo>> interpreted_funcs;
+  Isolate* isolate = heap->isolate();
+
+  for (HeapObject obj = iterator.Next(); !obj.is_null();
+       obj = iterator.Next()) {
+    if (IsSharedFunctionInfo(obj)) {
+      SharedFunctionInfo sfi = SharedFunctionInfo::cast(obj);
+      if (sfi.HasBytecodeArray()) {
+        interpreted_funcs.push_back(handle(sfi, isolate));
+      }
+    }
+  }
+
+  return interpreted_funcs;
+}
+
+void V8FileLogger::LogInterpretedFunctions() {
+  existing_code_logger_.LogInterpretedFunctions();
+}
+
+void ExistingCodeLogger::LogInterpretedFunctions() {
+  DCHECK(isolate_->logger()->is_listening_to_code_events());
+  Heap* heap = isolate_->heap();
+  HandleScope scope(isolate_);
+  std::vector<Handle<SharedFunctionInfo>> interpreted_funcs =
+      EnumerateInterpretedFunctions(heap);
+  for (Handle<SharedFunctionInfo> sfi : interpreted_funcs) {
+    if (sfi->HasInterpreterData() || !sfi->HasSourceCode() ||
+        !sfi->HasBytecodeArray()) {
+      continue;
+    }
+    LogEventListener::CodeTag log_tag =
+        sfi->is_toplevel() ? LogEventListener::CodeTag::kScript
+                           : LogEventListener::CodeTag::kFunction;
+    Compiler::InstallInterpreterTrampolineCopy(isolate_, sfi, log_tag);
+  }
+}
+#endif  // V8_OS_WIN && V8_ENABLE_ETW_STACK_WALKING
+
 void V8FileLogger::LogCodeObjects() { existing_code_logger_.LogCodeObjects(); }
 
 void V8FileLogger::LogExistingFunction(Handle<SharedFunctionInfo> shared,
@@ -2048,21 +2130,21 @@ void V8FileLogger::LogAccessorCallbacks() {
   Heap* heap = isolate_->heap();
   HeapObjectIterator iterator(heap);
   DisallowGarbageCollection no_gc;
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (!obj.IsAccessorInfo()) continue;
-    AccessorInfo ai = AccessorInfo::cast(obj);
-    if (!ai.name().IsName()) continue;
-    Address getter_entry = ai.getter();
+    if (!IsAccessorInfo(obj)) continue;
+    Tagged<AccessorInfo> ai = AccessorInfo::cast(obj);
+    if (!IsName(ai->name())) continue;
+    Address getter_entry = ai->getter(isolate_);
     HandleScope scope(isolate_);
-    Handle<Name> name(Name::cast(ai.name()), isolate_);
+    Handle<Name> name(Name::cast(ai->name()), isolate_);
     if (getter_entry != kNullAddress) {
 #if USES_FUNCTION_DESCRIPTORS
       getter_entry = *FUNCTION_ENTRYPOINT_ADDRESS(getter_entry);
 #endif
       PROFILE(isolate_, GetterCallbackEvent(name, getter_entry));
     }
-    Address setter_entry = ai.setter();
+    Address setter_entry = ai->setter(isolate_);
     if (setter_entry != kNullAddress) {
 #if USES_FUNCTION_DESCRIPTORS
       setter_entry = *FUNCTION_ENTRYPOINT_ADDRESS(setter_entry);
@@ -2075,10 +2157,10 @@ void V8FileLogger::LogAccessorCallbacks() {
 void V8FileLogger::LogAllMaps() {
   Heap* heap = isolate_->heap();
   CombinedHeapObjectIterator iterator(heap);
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (!obj.IsMap()) continue;
-    Map map = Map::cast(obj);
+    if (!IsMap(obj)) continue;
+    Tagged<Map> map = Map::cast(obj);
     MapCreate(map);
     MapDetails(map);
   }
@@ -2222,6 +2304,9 @@ void V8FileLogger::SetEtwCodeEventHandler(uint32_t options) {
     LogBuiltins();
     LogCodeObjects();
     LogCompiledFunctions(false);
+    if (v8_flags.interpreted_frames_native_stack) {
+      LogInterpretedFunctions();
+    }
   }
 }
 
@@ -2316,7 +2401,7 @@ void V8FileLogger::UpdateIsLogging(bool value) {
   isolate_->UpdateLogObjectRelocation();
 }
 
-void ExistingCodeLogger::LogCodeObject(AbstractCode object) {
+void ExistingCodeLogger::LogCodeObject(Tagged<AbstractCode> object) {
   HandleScope scope(isolate_);
   Handle<AbstractCode> abstract_code(object, isolate_);
   CodeTag tag = CodeTag::kStub;
@@ -2385,9 +2470,9 @@ void ExistingCodeLogger::LogCodeObjects() {
   CombinedHeapObjectIterator iterator(heap);
   DisallowGarbageCollection no_gc;
   PtrComprCageBase cage_base(isolate_);
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    InstanceType instance_type = obj.map(cage_base).instance_type();
+    InstanceType instance_type = obj->map(cage_base)->instance_type();
     if (InstanceTypeChecker::IsCode(instance_type) ||
         InstanceTypeChecker::IsBytecodeArray(instance_type)) {
       LogCodeObject(AbstractCode::cast(obj));
@@ -2415,6 +2500,15 @@ void ExistingCodeLogger::LogCompiledFunctions(
   // GetScriptLineNumber call.
   for (auto& pair : compiled_funcs) {
     Handle<SharedFunctionInfo> shared = pair.first;
+
+    // If the script is a Smi, then the SharedFunctionInfo is in
+    // the process of being deserialized.
+    Tagged<Object> script = shared->raw_script(kAcquireLoad);
+    if (IsSmi(script)) {
+      DCHECK_EQ(script, Smi::uninitialized_deserialization_value());
+      continue;
+    }
+
     if (ensure_source_positions_available) {
       SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate_, shared);
     }
@@ -2440,12 +2534,12 @@ void ExistingCodeLogger::LogCompiledFunctions(
   HeapObjectIterator iterator(heap);
   DisallowGarbageCollection no_gc;
 
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (!obj.IsWasmModuleObject()) continue;
+    if (!IsWasmModuleObject(obj)) continue;
     auto module_object = WasmModuleObject::cast(obj);
-    module_object.native_module()->LogWasmCodes(isolate_,
-                                                module_object.script());
+    module_object->native_module()->LogWasmCodes(isolate_,
+                                                 module_object->script());
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
 }
@@ -2453,12 +2547,13 @@ void ExistingCodeLogger::LogCompiledFunctions(
 void ExistingCodeLogger::LogExistingFunction(Handle<SharedFunctionInfo> shared,
                                              Handle<AbstractCode> code,
                                              CodeTag tag) {
-  if (shared->script().IsScript()) {
+  if (IsScript(shared->script())) {
     Handle<Script> script(Script::cast(shared->script()), isolate_);
-    int line_num = Script::GetLineNumber(script, shared->StartPosition()) + 1;
-    int column_num =
-        Script::GetColumnNumber(script, shared->StartPosition()) + 1;
-    if (script->name().IsString()) {
+    Script::PositionInfo info;
+    Script::GetPositionInfo(script, shared->StartPosition(), &info);
+    int line_num = info.line + 1;
+    int column_num = info.column + 1;
+    if (IsString(script->name())) {
       Handle<String> script_name(String::cast(script->name()), isolate_);
       if (!shared->is_toplevel()) {
         CALL_CODE_EVENT_HANDLER(
@@ -2478,11 +2573,11 @@ void ExistingCodeLogger::LogExistingFunction(Handle<SharedFunctionInfo> shared,
   } else if (shared->IsApiFunction()) {
     // API function.
     Handle<FunctionTemplateInfo> fun_data =
-        handle(shared->get_api_func_data(), isolate_);
-    Object raw_call_data = fun_data->call_code(kAcquireLoad);
-    if (!raw_call_data.IsUndefined(isolate_)) {
-      CallHandlerInfo call_data = CallHandlerInfo::cast(raw_call_data);
-      Address entry_point = call_data.callback();
+        handle(shared->api_func_data(), isolate_);
+    Tagged<Object> raw_call_data = fun_data->call_code(kAcquireLoad);
+    if (!IsUndefined(raw_call_data, isolate_)) {
+      Tagged<CallHandlerInfo> call_data = CallHandlerInfo::cast(raw_call_data);
+      Address entry_point = call_data->callback(isolate_);
 #if USES_FUNCTION_DESCRIPTORS
       entry_point = *FUNCTION_ENTRYPOINT_ADDRESS(entry_point);
 #endif
diff --git a/deps/v8/src/logging/log.h b/deps/v8/src/logging/log.h
index c0720c9f27a285..f2f4fe07906500 100644
--- a/deps/v8/src/logging/log.h
+++ b/deps/v8/src/logging/log.h
@@ -99,7 +99,11 @@ class ExistingCodeLogger {
   void LogExistingFunction(
       Handle<SharedFunctionInfo> shared, Handle<AbstractCode> code,
       LogEventListener::CodeTag tag = LogEventListener::CodeTag::kFunction);
-  void LogCodeObject(AbstractCode object);
+  void LogCodeObject(Tagged<AbstractCode> object);
+
+#if defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+  void LogInterpretedFunctions();
+#endif  // V8_OS_WIN && V8_ENABLE_ETW_STACK_WALKING
 
  private:
   Isolate* isolate_;
@@ -153,16 +157,16 @@ class V8FileLogger : public LogEventListener {
   // ==== Events logged by --log-function-events ====
   void FunctionEvent(const char* reason, int script_id, double time_delta_ms,
                      int start_position, int end_position,
-                     String function_name);
+                     Tagged<String> function_name);
   void FunctionEvent(const char* reason, int script_id, double time_delta_ms,
                      int start_position, int end_position,
                      const char* function_name = nullptr,
                      size_t function_name_length = 0, bool is_one_byte = true);
 
   void CompilationCacheEvent(const char* action, const char* cache_type,
-                             SharedFunctionInfo sfi);
+                             Tagged<SharedFunctionInfo> sfi);
   void ScriptEvent(ScriptEventType type, int script_id);
-  void ScriptDetails(Script script);
+  void ScriptDetails(Tagged<Script> script);
 
   // ==== Events logged by --log-code. ====
   V8_EXPORT_PRIVATE void AddLogEventListener(LogEventListener* listener);
@@ -190,8 +194,10 @@ class V8FileLogger : public LogEventListener {
   void SetterCallbackEvent(Handle<Name> name, Address entry_point) override;
   void RegExpCodeCreateEvent(Handle<AbstractCode> code,
                              Handle<String> source) override;
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) override;
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) override;
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) override;
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                         Tagged<BytecodeArray> to) override;
   void SharedFunctionInfoMoveEvent(Address from, Address to) override;
   void NativeContextMoveEvent(Address from, Address to) override {}
   void CodeMovingGCEvent() override;
@@ -202,7 +208,8 @@ class V8FileLogger : public LogEventListener {
   void CodeDependencyChangeEvent(Handle<Code> code,
                                  Handle<SharedFunctionInfo> sfi,
                                  const char* reason) override;
-  void FeedbackVectorEvent(FeedbackVector vector, AbstractCode code);
+  void FeedbackVectorEvent(Tagged<FeedbackVector> vector,
+                           Tagged<AbstractCode> code);
   void WeakCodeClearEvent() override {}
 
   void ProcessDeoptEvent(Handle<Code> code, SourcePosition position,
@@ -210,11 +217,11 @@ class V8FileLogger : public LogEventListener {
 
   // Emits a code line info record event.
   void CodeLinePosInfoRecordEvent(Address code_start,
-                                  ByteArray source_position_table,
+                                  Tagged<ByteArray> source_position_table,
                                   JitCodeEvent::CodeType code_type);
 #if V8_ENABLE_WEBASSEMBLY
   void WasmCodeLinePosInfoRecordEvent(
-      Address code_start, base::Vector<const byte> source_position_table);
+      Address code_start, base::Vector<const uint8_t> source_position_table);
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   void CodeNameEvent(Address addr, int pos, const char* code_name);
@@ -226,8 +233,9 @@ class V8FileLogger : public LogEventListener {
   void MapEvent(const char* type, Handle<Map> from, Handle<Map> to,
                 const char* reason = nullptr,
                 Handle<HeapObject> name_or_sfi = Handle<HeapObject>());
-  void MapCreate(Map map);
-  void MapDetails(Map map);
+  void MapCreate(Tagged<Map> map);
+  void MapDetails(Tagged<Map> map);
+  void MapMoveEvent(Tagged<Map> from, Tagged<Map> to);
 
   void SharedLibraryEvent(const std::string& library_path, uintptr_t start,
                           uintptr_t end, intptr_t aslr_slide);
@@ -240,24 +248,21 @@ class V8FileLogger : public LogEventListener {
   static void EnterExternal(Isolate* isolate);
   static void LeaveExternal(Isolate* isolate);
 
-  static void DefaultEventLoggerSentinel(const char* name, int event) {}
-
-  V8_INLINE static void CallEventLoggerInternal(Isolate* isolate,
-                                                const char* name,
-                                                v8::LogEventStatus se,
-                                                bool expose_to_api) {
-    if (isolate->event_logger() == DefaultEventLoggerSentinel) {
-      LOG(isolate, TimerEvent(se, name));
-    } else if (expose_to_api) {
-      isolate->event_logger()(name, static_cast<v8::LogEventStatus>(se));
+  V8_NOINLINE V8_PRESERVE_MOST static void CallEventLoggerInternal(
+      Isolate* isolate, const char* name, v8::LogEventStatus se,
+      bool expose_to_api) {
+    LOG(isolate, TimerEvent(se, name));
+    if (V8_UNLIKELY(isolate->event_logger())) {
+      isolate->event_logger()(name, se);
     }
   }
 
   V8_INLINE static void CallEventLogger(Isolate* isolate, const char* name,
                                         v8::LogEventStatus se,
                                         bool expose_to_api) {
-    if (!isolate->event_logger()) return;
-    CallEventLoggerInternal(isolate, name, se, expose_to_api);
+    if (V8_UNLIKELY(v8_flags.log_timer_events)) {
+      CallEventLoggerInternal(isolate, name, se, expose_to_api);
+    }
   }
 
   V8_EXPORT_PRIVATE bool is_logging();
@@ -270,6 +275,14 @@ class V8FileLogger : public LogEventListener {
         is_logging() || jit_logger_ != nullptr;
   }
 
+  bool allows_code_compaction() override {
+#if defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+    return etw_jit_logger_ == nullptr;
+#else
+    return true;
+#endif
+  }
+
   void LogExistingFunction(Handle<SharedFunctionInfo> shared,
                            Handle<AbstractCode> code);
   // Logs all compiled functions found in the heap.
@@ -284,7 +297,11 @@ class V8FileLogger : public LogEventListener {
   void LogAllMaps();
 
   // Converts tag to a corresponding NATIVE_... if the script is native.
-  V8_INLINE static CodeTag ToNativeByScript(CodeTag tag, Script script);
+  V8_INLINE static CodeTag ToNativeByScript(CodeTag tag, Tagged<Script> script);
+
+#if defined(V8_OS_WIN) && defined(V8_ENABLE_ETW_STACK_WALKING)
+  void LogInterpretedFunctions();
+#endif  // V8_OS_WIN && V8_ENABLE_ETW_STACK_WALKING
 
  private:
   void UpdateIsLogging(bool value);
@@ -311,18 +328,18 @@ class V8FileLogger : public LogEventListener {
 
   // Logs a scripts sources. Keeps track of all logged scripts to ensure that
   // each script is logged only once.
-  bool EnsureLogScriptSource(Script script);
+  bool EnsureLogScriptSource(Tagged<Script> script);
 
   void LogSourceCodeInformation(Handle<AbstractCode> code,
                                 Handle<SharedFunctionInfo> shared);
   void LogCodeDisassemble(Handle<AbstractCode> code);
 
   void WriteApiSecurityCheck();
-  void WriteApiNamedPropertyAccess(const char* tag, JSObject holder,
-                                   Object name);
-  void WriteApiIndexedPropertyAccess(const char* tag, JSObject holder,
+  void WriteApiNamedPropertyAccess(const char* tag, Tagged<JSObject> holder,
+                                   Tagged<Object> name);
+  void WriteApiIndexedPropertyAccess(const char* tag, Tagged<JSObject> holder,
                                      uint32_t index);
-  void WriteApiObjectAccess(const char* tag, JSReceiver obj);
+  void WriteApiObjectAccess(const char* tag, Tagged<JSReceiver> obj);
   void WriteApiEntryCall(const char* name);
 
   int64_t Time();
@@ -447,7 +464,7 @@ class V8_EXPORT_PRIVATE CodeEventLogger : public LogEventListener {
  private:
   class NameBuffer;
 
-  virtual void LogRecordedBuffer(AbstractCode code,
+  virtual void LogRecordedBuffer(Tagged<AbstractCode> code,
                                  MaybeHandle<SharedFunctionInfo> maybe_shared,
                                  const char* name, int length) = 0;
 #if V8_ENABLE_WEBASSEMBLY
@@ -499,8 +516,10 @@ class ExternalLogEventListener : public LogEventListener {
   void SetterCallbackEvent(Handle<Name> name, Address entry_point) override {}
   void SharedFunctionInfoMoveEvent(Address from, Address to) override {}
   void NativeContextMoveEvent(Address from, Address to) override {}
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) override;
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) override;
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) override;
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                         Tagged<BytecodeArray> to) override;
   void CodeDisableOptEvent(Handle<AbstractCode> code,
                            Handle<SharedFunctionInfo> shared) override {}
   void CodeMovingGCEvent() override {}
diff --git a/deps/v8/src/logging/runtime-call-stats.h b/deps/v8/src/logging/runtime-call-stats.h
index 8b00ac14a0ec6f..23170681655e7a 100644
--- a/deps/v8/src/logging/runtime-call-stats.h
+++ b/deps/v8/src/logging/runtime-call-stats.h
@@ -226,7 +226,9 @@ class RuntimeCallTimer final {
   V(Object_ToInt32)                                        \
   V(Object_ToInteger)                                      \
   V(Object_ToNumber)                                       \
+  V(Object_ToNumeric)                                      \
   V(Object_ToObject)                                       \
+  V(Object_ToPrimitive)                                    \
   V(Object_ToString)                                       \
   V(Object_ToUint32)                                       \
   V(Persistent_New)                                        \
@@ -345,6 +347,7 @@ class RuntimeCallTimer final {
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, GenericLowering)                 \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, Inlining)                        \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, JSWasmInlining)                  \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, JSWasmLowering)                  \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, JumpThreading)                   \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, MidTierPopulateReferenceMaps)    \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, MidTierRegisterAllocator)        \
@@ -356,6 +359,7 @@ class RuntimeCallTimer final {
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, LoopExitElimination)             \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, LoopPeeling)                     \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, MachineOperatorOptimization)     \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, PairingOptimization)             \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, MeetRegisterConstraints)         \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, MemoryOptimization)              \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, OptimizeMoves)                   \
@@ -375,15 +379,20 @@ class RuntimeCallTimer final {
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TraceScheduleAndVerify)          \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftBuildGraph)            \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftDeadCodeElimination)   \
-  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize,                                  \
-                              TurboshaftDecompressionOptimization)          \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftDebugFeatureLowering)  \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftDecompressionOpt)      \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftInstructionSelection)  \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftInt64Lowering)         \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftLateOptimization)      \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftMachineLowering)       \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftOptimize)              \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftRecreateSchedule)      \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftSpecialRPOScheduling)  \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftStoreStoreElim)        \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftTagUntagLowering)      \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftTypeAssertions)        \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftTypedOptimizations)    \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TurboshaftWasmOptimize)          \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TypeAssertions)                  \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, TypedLowering)                   \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, Typer)                           \
@@ -396,6 +405,7 @@ class RuntimeCallTimer final {
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, WasmLoopPeeling)                 \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, WasmLoopUnrolling)               \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, WasmOptimization)                \
+  ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, WasmJSLowering)                  \
   ADD_THREAD_SPECIFIC_COUNTER(V, Optimize, WasmTyping)                      \
                                                                             \
   ADD_THREAD_SPECIFIC_COUNTER(V, Parse, ArrowFunctionLiteral)               \
diff --git a/deps/v8/src/maglev/OWNERS b/deps/v8/src/maglev/OWNERS
index 291b217d6ebb70..63920eaed82677 100644
--- a/deps/v8/src/maglev/OWNERS
+++ b/deps/v8/src/maglev/OWNERS
@@ -2,3 +2,4 @@ leszeks@chromium.org
 jgruber@chromium.org
 verwaest@chromium.org
 victorgomes@chromium.org
+dmercadier@chromium.org
diff --git a/deps/v8/src/maglev/arm/maglev-assembler-arm-inl.h b/deps/v8/src/maglev/arm/maglev-assembler-arm-inl.h
new file mode 100644
index 00000000000000..2cdd9035b30ac3
--- /dev/null
+++ b/deps/v8/src/maglev/arm/maglev-assembler-arm-inl.h
@@ -0,0 +1,1077 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_MAGLEV_ARM_MAGLEV_ASSEMBLER_ARM_INL_H_
+#define V8_MAGLEV_ARM_MAGLEV_ASSEMBLER_ARM_INL_H_
+
+#include "src/base/numbers/double.h"
+#include "src/codegen/interface-descriptors-inl.h"
+#include "src/codegen/macro-assembler-inl.h"
+#include "src/common/globals.h"
+#include "src/compiler/compilation-dependencies.h"
+#include "src/maglev/maglev-assembler.h"
+#include "src/maglev/maglev-basic-block.h"
+#include "src/maglev/maglev-code-gen-state.h"
+
+namespace v8 {
+namespace internal {
+namespace maglev {
+
+constexpr Condition ConditionForFloat64(Operation operation) {
+  return ConditionFor(operation);
+}
+
+constexpr Condition ConditionForNaN() { return vs; }
+
+inline int ShiftFromScale(int n) {
+  switch (n) {
+    case 1:
+      return 0;
+    case 2:
+      return 1;
+    case 4:
+      return 2;
+    case 8:
+      return 3;
+    default:
+      UNREACHABLE();
+  }
+}
+
+class MaglevAssembler::ScratchRegisterScope {
+ public:
+  explicit ScratchRegisterScope(MaglevAssembler* masm)
+      : wrapped_scope_(masm),
+        masm_(masm),
+        prev_scope_(masm->scratch_register_scope_) {
+    masm_->scratch_register_scope_ = this;
+    if (prev_scope_ == nullptr) {
+      // Add extra scratch register if no previous scope.
+      wrapped_scope_.Include(kMaglevExtraScratchRegister);
+    }
+  }
+
+  ~ScratchRegisterScope() { masm_->scratch_register_scope_ = prev_scope_; }
+
+  void ResetToDefault() {
+    wrapped_scope_.SetAvailable(Assembler::DefaultTmpList() |
+                                kMaglevExtraScratchRegister);
+    wrapped_scope_.SetAvailableVfp(Assembler::DefaultFPTmpList());
+  }
+
+  Register GetDefaultScratchRegister() { return Acquire(); }
+  DoubleRegister GetDefaultScratchDoubleRegister() { return AcquireDouble(); }
+
+  Register Acquire() { return wrapped_scope_.Acquire(); }
+  void Include(Register reg) { wrapped_scope_.Include(reg); }
+  void Include(const RegList list) { wrapped_scope_.Include(list); }
+
+  DoubleRegister AcquireDouble() { return wrapped_scope_.AcquireD(); }
+  void IncludeDouble(const DoubleRegList list) {
+    wrapped_scope_.Include(DoubleToVpfRegList(list));
+  }
+
+  RegList Available() { return wrapped_scope_.Available(); }
+  void SetAvailable(RegList list) { wrapped_scope_.SetAvailable(list); }
+
+  DoubleRegList AvailableDouble() {
+    return VpfToDoubleRegList(wrapped_scope_.AvailableVfp());
+  }
+  void SetAvailableDouble(DoubleRegList list) {
+    wrapped_scope_.SetAvailableVfp(DoubleToVpfRegList(list));
+  }
+
+  // TODO(victorgomes): These are very inefficient, but it suffices for now to
+  // bootstrap arm. We should be able to define a special DoubleRegList for arm
+  // that takes VpfRegList into account directly.
+  DoubleRegList VpfToDoubleRegList(VfpRegList list) {
+    DoubleRegList double_list;
+    for (int index = 0; index < DoubleRegister::kNumRegisters; index++) {
+      DoubleRegister reg = DoubleRegister::from_code(index);
+      uint64_t mask = reg.ToVfpRegList();
+      if ((list & mask) == mask) {
+        double_list.set(reg);
+      }
+    }
+    return double_list;
+  }
+  VfpRegList DoubleToVpfRegList(DoubleRegList list) {
+    VfpRegList vfp_list = 0;
+    for (DoubleRegister reg : list) {
+      vfp_list |= reg.ToVfpRegList();
+    }
+    return vfp_list;
+  }
+
+ private:
+  UseScratchRegisterScope wrapped_scope_;
+  MaglevAssembler* masm_;
+  ScratchRegisterScope* prev_scope_;
+};
+
+inline MapCompare::MapCompare(MaglevAssembler* masm, Register object,
+                              size_t map_count)
+    : masm_(masm), object_(object), map_count_(map_count) {
+  map_ = masm_->scratch_register_scope()->Acquire();
+  masm_->LoadMap(map_, object_);
+  USE(map_count_);
+}
+
+void MapCompare::Generate(Handle<Map> map) {
+  MaglevAssembler::ScratchRegisterScope temps(masm_);
+  Register temp = temps.Acquire();
+  masm_->Move(temp, map);
+  masm_->cmp(map_, temp);
+}
+
+Register MapCompare::GetMap() { return map_; }
+
+int MapCompare::TemporaryCount(size_t map_count) { return 1; }
+
+namespace detail {
+
+template <typename... Args>
+struct PushAllHelper;
+
+template <>
+struct PushAllHelper<> {
+  static void Push(MaglevAssembler* masm) {}
+  static void PushReverse(MaglevAssembler* masm) {}
+};
+
+inline void PushInput(MaglevAssembler* masm, const Input& input) {
+  if (input.operand().IsConstant()) {
+    MaglevAssembler::ScratchRegisterScope temps(masm);
+    Register scratch = temps.Acquire();
+    input.node()->LoadToRegister(masm, scratch);
+    masm->Push(scratch);
+  } else {
+    // TODO(leszeks): Consider special casing the value. (Toon: could possibly
+    // be done through Input directly?)
+    const compiler::AllocatedOperand& operand =
+        compiler::AllocatedOperand::cast(input.operand());
+    if (operand.IsRegister()) {
+      masm->Push(operand.GetRegister());
+    } else {
+      DCHECK(operand.IsStackSlot());
+      MaglevAssembler::ScratchRegisterScope temps(masm);
+      Register scratch = temps.Acquire();
+      masm->ldr(scratch, masm->GetStackSlot(operand));
+      masm->Push(scratch);
+    }
+  }
+}
+
+template <typename T, typename... Args>
+inline void PushIterator(MaglevAssembler* masm, base::iterator_range<T> range,
+                         Args... args) {
+  for (auto iter = range.begin(), end = range.end(); iter != end; ++iter) {
+    masm->Push(*iter);
+  }
+  PushAllHelper<Args...>::Push(masm, args...);
+}
+
+template <typename T, typename... Args>
+inline void PushIteratorReverse(MaglevAssembler* masm,
+                                base::iterator_range<T> range, Args... args) {
+  PushAllHelper<Args...>::PushReverse(masm, args...);
+  for (auto iter = range.rbegin(), end = range.rend(); iter != end; ++iter) {
+    masm->Push(*iter);
+  }
+}
+
+template <typename... Args>
+struct PushAllHelper<Input, Args...> {
+  static void Push(MaglevAssembler* masm, const Input& arg, Args... args) {
+    PushInput(masm, arg);
+    PushAllHelper<Args...>::Push(masm, args...);
+  }
+  static void PushReverse(MaglevAssembler* masm, const Input& arg,
+                          Args... args) {
+    PushAllHelper<Args...>::PushReverse(masm, args...);
+    PushInput(masm, arg);
+  }
+};
+template <typename Arg, typename... Args>
+struct PushAllHelper<Arg, Args...> {
+  static void Push(MaglevAssembler* masm, Arg arg, Args... args) {
+    if constexpr (is_iterator_range<Arg>::value) {
+      PushIterator(masm, arg, args...);
+    } else {
+      masm->MacroAssembler::Push(arg);
+      PushAllHelper<Args...>::Push(masm, args...);
+    }
+  }
+  static void PushReverse(MaglevAssembler* masm, Arg arg, Args... args) {
+    if constexpr (is_iterator_range<Arg>::value) {
+      PushIteratorReverse(masm, arg, args...);
+    } else {
+      PushAllHelper<Args...>::PushReverse(masm, args...);
+      masm->Push(arg);
+    }
+  }
+};
+
+}  // namespace detail
+
+template <typename... T>
+void MaglevAssembler::Push(T... vals) {
+  detail::PushAllHelper<T...>::Push(this, vals...);
+}
+
+template <typename... T>
+void MaglevAssembler::PushReverse(T... vals) {
+  detail::PushAllHelper<T...>::PushReverse(this, vals...);
+}
+
+inline void MaglevAssembler::BindJumpTarget(Label* label) { bind(label); }
+
+inline void MaglevAssembler::BindBlock(BasicBlock* block) {
+  bind(block->label());
+}
+
+inline void MaglevAssembler::SmiTagInt32AndSetFlags(Register dst,
+                                                    Register src) {
+  add(dst, src, src, SetCC);
+}
+
+inline void MaglevAssembler::CheckInt32IsSmi(Register obj, Label* fail,
+                                             Register scratch) {
+  static_assert(!SmiValuesAre32Bits());
+
+  ScratchRegisterScope temps(this);
+  if (scratch == Register::no_reg()) {
+    scratch = temps.Acquire();
+  }
+  add(scratch, obj, obj, SetCC);
+  JumpIf(kOverflow, fail);
+}
+
+inline void MaglevAssembler::MoveHeapNumber(Register dst, double value) {
+  mov(dst, Operand::EmbeddedNumber(value));
+}
+
+inline Condition MaglevAssembler::IsRootConstant(Input input,
+                                                 RootIndex root_index) {
+  if (input.operand().IsRegister()) {
+    CompareRoot(ToRegister(input), root_index);
+  } else {
+    DCHECK(input.operand().IsStackSlot());
+    ScratchRegisterScope temps(this);
+    Register scratch = temps.Acquire();
+    ldr(scratch, ToMemOperand(input));
+    CompareRoot(scratch, root_index);
+  }
+  return eq;
+}
+
+inline MemOperand MaglevAssembler::StackSlotOperand(StackSlot slot) {
+  return MemOperand(fp, slot.index);
+}
+
+// TODO(Victorgomes): Unify this to use StackSlot struct.
+inline MemOperand MaglevAssembler::GetStackSlot(
+    const compiler::AllocatedOperand& operand) {
+  return MemOperand(fp, GetFramePointerOffsetForStackSlot(operand));
+}
+
+inline MemOperand MaglevAssembler::ToMemOperand(
+    const compiler::InstructionOperand& operand) {
+  return GetStackSlot(compiler::AllocatedOperand::cast(operand));
+}
+
+inline MemOperand MaglevAssembler::ToMemOperand(const ValueLocation& location) {
+  return ToMemOperand(location.operand());
+}
+
+inline void MaglevAssembler::BuildTypedArrayDataPointer(Register data_pointer,
+                                                        Register object) {
+  DCHECK_NE(data_pointer, object);
+  ldr(data_pointer,
+      FieldMemOperand(object, JSTypedArray::kExternalPointerOffset));
+  if (JSTypedArray::kMaxSizeInHeap == 0) return;
+  ScratchRegisterScope temps(this);
+  Register base = temps.Acquire();
+  ldr(base, FieldMemOperand(object, JSTypedArray::kBasePointerOffset));
+  add(data_pointer, data_pointer, base);
+}
+
+inline MemOperand MaglevAssembler::TypedArrayElementOperand(
+    Register data_pointer, Register index, int element_size) {
+  add(data_pointer, data_pointer,
+      Operand(index, LSL, ShiftFromScale(element_size)));
+  return MemOperand(data_pointer);
+}
+
+inline MemOperand MaglevAssembler::DataViewElementOperand(Register data_pointer,
+                                                          Register index) {
+  return MemOperand(data_pointer, index);
+}
+
+inline void MaglevAssembler::LoadTaggedFieldByIndex(Register result,
+                                                    Register object,
+                                                    Register index, int scale,
+                                                    int offset) {
+  add(result, object, Operand(index, LSL, ShiftFromScale(scale)));
+  MacroAssembler::LoadTaggedField(result, FieldMemOperand(result, offset));
+}
+
+inline void MaglevAssembler::LoadBoundedSizeFromObject(Register result,
+                                                       Register object,
+                                                       int offset) {
+  Move(result, FieldMemOperand(object, offset));
+}
+
+inline void MaglevAssembler::LoadExternalPointerField(Register result,
+                                                      MemOperand operand) {
+  Move(result, operand);
+}
+
+void MaglevAssembler::LoadFixedArrayElement(Register result, Register array,
+                                            Register index) {
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  LoadTaggedFieldByIndex(result, array, index, kTaggedSize,
+                         FixedArray::kHeaderSize);
+}
+
+void MaglevAssembler::LoadFixedArrayElementWithoutDecompressing(
+    Register result, Register array, Register index) {
+  // No compression mode on arm.
+  LoadFixedArrayElement(result, array, index);
+}
+
+void MaglevAssembler::LoadFixedDoubleArrayElement(DoubleRegister result,
+                                                  Register array,
+                                                  Register index) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_DOUBLE_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  add(scratch, array, Operand(index, LSL, kDoubleSizeLog2));
+  vldr(result, FieldMemOperand(scratch, FixedArray::kHeaderSize));
+}
+
+inline void MaglevAssembler::StoreFixedDoubleArrayElement(
+    Register array, Register index, DoubleRegister value) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  add(scratch, array, Operand(index, LSL, kDoubleSizeLog2));
+  vstr(value, FieldMemOperand(scratch, FixedArray::kHeaderSize));
+}
+
+inline void MaglevAssembler::LoadSignedField(Register result,
+                                             MemOperand operand, int size) {
+  if (size == 1) {
+    ldrsb(result, operand);
+  } else if (size == 2) {
+    ldrsh(result, operand);
+  } else {
+    DCHECK_EQ(size, 4);
+    ldr(result, operand);
+  }
+}
+
+inline void MaglevAssembler::LoadUnsignedField(Register result,
+                                               MemOperand operand, int size) {
+  if (size == 1) {
+    ldrb(result, operand);
+  } else if (size == 2) {
+    ldrh(result, operand);
+  } else {
+    DCHECK_EQ(size, 4);
+    ldr(result, operand);
+  }
+}
+
+inline void MaglevAssembler::SetSlotAddressForTaggedField(Register slot_reg,
+                                                          Register object,
+                                                          int offset) {
+  add(slot_reg, object, Operand(offset - kHeapObjectTag));
+}
+inline void MaglevAssembler::SetSlotAddressForFixedArrayElement(
+    Register slot_reg, Register object, Register index) {
+  add(slot_reg, object, Operand(FixedArray::kHeaderSize - kHeapObjectTag));
+  add(slot_reg, slot_reg, Operand(index, LSL, kTaggedSizeLog2));
+}
+
+inline void MaglevAssembler::StoreTaggedFieldNoWriteBarrier(Register object,
+                                                            int offset,
+                                                            Register value) {
+  MacroAssembler::StoreTaggedField(value, FieldMemOperand(object, offset));
+}
+
+inline void MaglevAssembler::StoreFixedArrayElementNoWriteBarrier(
+    Register array, Register index, Register value) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  add(scratch, array, Operand(index, LSL, kTaggedSizeLog2));
+  MacroAssembler::StoreTaggedField(
+      value, FieldMemOperand(scratch, FixedArray::kHeaderSize));
+}
+
+inline void MaglevAssembler::StoreTaggedSignedField(Register object, int offset,
+                                                    Register value) {
+  AssertSmi(value);
+  MacroAssembler::StoreTaggedField(value, FieldMemOperand(object, offset));
+}
+
+inline void MaglevAssembler::StoreTaggedSignedField(Register object, int offset,
+                                                    Tagged<Smi> value) {
+  ScratchRegisterScope scope(this);
+  Register scratch = scope.Acquire();
+  Move(scratch, value);
+  MacroAssembler::StoreTaggedField(scratch, FieldMemOperand(object, offset));
+}
+
+inline void MaglevAssembler::StoreInt32Field(Register object, int offset,
+                                             int32_t value) {
+  ScratchRegisterScope scope(this);
+  Register scratch = scope.Acquire();
+  Move(scratch, value);
+  str(scratch, FieldMemOperand(object, offset));
+}
+
+inline void MaglevAssembler::StoreField(MemOperand operand, Register value,
+                                        int size) {
+  DCHECK(size == 1 || size == 2 || size == 4);
+  if (size == 1) {
+    strb(value, operand);
+  } else if (size == 2) {
+    strh(value, operand);
+  } else {
+    DCHECK_EQ(size, 4);
+    str(value, operand);
+  }
+}
+
+inline void MaglevAssembler::ReverseByteOrder(Register value, int size) {
+  if (size == 2) {
+    rev(value, value);
+    asr(value, value, Operand(16));
+  } else if (size == 4) {
+    rev(value, value);
+  } else {
+    DCHECK_EQ(size, 1);
+  }
+}
+
+inline void MaglevAssembler::IncrementInt32(Register reg) {
+  add(reg, reg, Operand(1));
+}
+
+inline void MaglevAssembler::Move(StackSlot dst, Register src) {
+  str(src, StackSlotOperand(dst));
+}
+inline void MaglevAssembler::Move(StackSlot dst, DoubleRegister src) {
+  vstr(src, StackSlotOperand(dst));
+}
+inline void MaglevAssembler::Move(Register dst, StackSlot src) {
+  ldr(dst, StackSlotOperand(src));
+}
+inline void MaglevAssembler::Move(DoubleRegister dst, StackSlot src) {
+  vldr(dst, StackSlotOperand(src));
+}
+inline void MaglevAssembler::Move(MemOperand dst, Register src) {
+  str(src, dst);
+}
+inline void MaglevAssembler::Move(Register dst, MemOperand src) {
+  ldr(dst, src);
+}
+inline void MaglevAssembler::Move(DoubleRegister dst, DoubleRegister src) {
+  if (dst != src) {
+    vmov(dst, src);
+  }
+}
+inline void MaglevAssembler::Move(Register dst, Tagged<Smi> src) {
+  MacroAssembler::Move(dst, src);
+}
+inline void MaglevAssembler::Move(Register dst, ExternalReference src) {
+  MacroAssembler::Move(dst, src);
+}
+inline void MaglevAssembler::Move(Register dst, Register src) {
+  if (dst != src) {
+    mov(dst, src);
+  }
+}
+inline void MaglevAssembler::Move(Register dst, Tagged<TaggedIndex> i) {
+  mov(dst, Operand(i.ptr()));
+}
+inline void MaglevAssembler::Move(Register dst, int32_t i) {
+  mov(dst, Operand(i));
+}
+inline void MaglevAssembler::Move(DoubleRegister dst, double n) {
+  vmov(dst, base::Double(n));
+}
+inline void MaglevAssembler::Move(DoubleRegister dst, Float64 n) {
+  vmov(dst, base::Double(n.get_bits()));
+}
+inline void MaglevAssembler::Move(Register dst, Handle<HeapObject> obj) {
+  MacroAssembler::Move(dst, obj);
+}
+
+inline void MaglevAssembler::LoadFloat32(DoubleRegister dst, MemOperand src) {
+  UseScratchRegisterScope temps(this);
+  SwVfpRegister temp_vfps = SwVfpRegister::no_reg();
+  if (dst.code() < 16) {
+    temp_vfps = LowDwVfpRegister::from_code(dst.code()).low();
+  } else {
+    temp_vfps = temps.AcquireS();
+  }
+  vldr(temp_vfps, src);
+  vcvt_f64_f32(dst, temp_vfps);
+}
+inline void MaglevAssembler::StoreFloat32(MemOperand dst, DoubleRegister src) {
+  UseScratchRegisterScope temps(this);
+  SwVfpRegister temp_vfps = temps.AcquireS();
+  vcvt_f32_f64(temp_vfps, src);
+  vstr(temp_vfps, dst);
+}
+inline void MaglevAssembler::LoadFloat64(DoubleRegister dst, MemOperand src) {
+  vldr(dst, src);
+}
+inline void MaglevAssembler::StoreFloat64(MemOperand dst, DoubleRegister src) {
+  vstr(src, dst);
+}
+
+inline void MaglevAssembler::LoadUnalignedFloat64(DoubleRegister dst,
+                                                  Register base,
+                                                  Register index) {
+  // vldr only works on 4 bytes aligned access.
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  ldr(scratch, MemOperand(base, index));
+  VmovLow(dst, scratch);
+  add(scratch, index, Operand(4));
+  ldr(scratch, MemOperand(base, scratch));
+  VmovHigh(dst, scratch);
+}
+inline void MaglevAssembler::LoadUnalignedFloat64AndReverseByteOrder(
+    DoubleRegister dst, Register base, Register index) {
+  // vldr only works on 4 bytes aligned access.
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  ldr(scratch, MemOperand(base, index));
+  rev(scratch, scratch);
+  VmovHigh(dst, scratch);
+  add(scratch, index, Operand(4));
+  ldr(scratch, MemOperand(base, scratch));
+  rev(scratch, scratch);
+  VmovLow(dst, scratch);
+}
+inline void MaglevAssembler::StoreUnalignedFloat64(Register base,
+                                                   Register index,
+                                                   DoubleRegister src) {
+  // vstr only works on 4 bytes aligned access.
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  Register index_scratch = temps.Acquire();
+  VmovLow(scratch, src);
+  str(scratch, MemOperand(base, index));
+  add(index_scratch, index, Operand(4));
+  VmovHigh(scratch, src);
+  str(scratch, MemOperand(base, index_scratch));
+}
+inline void MaglevAssembler::ReverseByteOrderAndStoreUnalignedFloat64(
+    Register base, Register index, DoubleRegister src) {
+  // vstr only works on 4 bytes aligned access.
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  Register index_scratch = temps.Acquire();
+  VmovHigh(scratch, src);
+  rev(scratch, scratch);
+  str(scratch, MemOperand(base, index));
+  add(index_scratch, index, Operand(4));
+  VmovLow(scratch, src);
+  rev(scratch, scratch);
+  str(scratch, MemOperand(base, index_scratch));
+}
+
+inline void MaglevAssembler::SignExtend32To64Bits(Register dst, Register src) {
+  // No 64-bit registers.
+}
+inline void MaglevAssembler::NegateInt32(Register val) {
+  rsb(val, val, Operand(0));
+}
+
+inline void MaglevAssembler::ToUint8Clamped(Register result,
+                                            DoubleRegister value, Label* min,
+                                            Label* max, Label* done) {
+  CpuFeatureScope scope(this, ARMv8);
+  ScratchRegisterScope temps(this);
+  DoubleRegister scratch = temps.AcquireDouble();
+  Move(scratch, 0.0);
+  VFPCompareAndSetFlags(scratch, value);
+  // Set to 0 if NaN.
+  JumpIf(kOverflow, min);
+  JumpIf(kGreaterThanEqual, min);
+  Move(scratch, 255.0);
+  VFPCompareAndSetFlags(value, scratch);
+  JumpIf(kGreaterThanEqual, max);
+  // if value in [0, 255], then round up to the nearest.
+  vrintn(scratch, value);
+  TruncateDoubleToInt32(result, scratch);
+  Jump(done);
+}
+
+template <typename NodeT>
+inline void MaglevAssembler::DeoptIfBufferDetached(Register array,
+                                                   Register scratch,
+                                                   NodeT* node) {
+  if (!code_gen_state()
+           ->broker()
+           ->dependencies()
+           ->DependOnArrayBufferDetachingProtector()) {
+    // A detached buffer leads to megamorphic feedback, so we won't have a deopt
+    // loop if we deopt here.
+    LoadTaggedField(scratch,
+                    FieldMemOperand(array, JSArrayBufferView::kBufferOffset));
+    LoadTaggedField(scratch,
+                    FieldMemOperand(scratch, JSArrayBuffer::kBitFieldOffset));
+    tst(scratch, Operand(JSArrayBuffer::WasDetachedBit::kMask));
+    EmitEagerDeoptIf(ne, DeoptimizeReason::kArrayBufferWasDetached, node);
+  }
+}
+
+inline void MaglevAssembler::LoadByte(Register dst, MemOperand src) {
+  ldrb(dst, src);
+}
+
+inline Condition MaglevAssembler::IsCallableAndNotUndetectable(
+    Register map, Register scratch) {
+  ldr(scratch, FieldMemOperand(map, Map::kBitFieldOffset));
+  and_(scratch, scratch,
+       Operand(Map::Bits1::IsUndetectableBit::kMask |
+               Map::Bits1::IsCallableBit::kMask));
+  cmp(scratch, Operand(Map::Bits1::IsCallableBit::kMask));
+  return kEqual;
+}
+
+inline Condition MaglevAssembler::IsNotCallableNorUndetactable(
+    Register map, Register scratch) {
+  ldr(scratch, FieldMemOperand(map, Map::kBitFieldOffset));
+  tst(scratch, Operand(Map::Bits1::IsUndetectableBit::kMask |
+                       Map::Bits1::IsCallableBit::kMask));
+  return kEqual;
+}
+
+inline void MaglevAssembler::LoadInstanceType(Register instance_type,
+                                              Register heap_object) {
+  LoadMap(instance_type, heap_object);
+  ldrh(instance_type, FieldMemOperand(instance_type, Map::kInstanceTypeOffset));
+}
+
+inline void MaglevAssembler::IsObjectType(Register heap_object,
+                                          InstanceType type) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  MacroAssembler::CompareObjectType(heap_object, scratch, scratch, type);
+}
+
+inline void MaglevAssembler::CompareObjectType(Register heap_object,
+                                               InstanceType type) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  CompareObjectType(heap_object, type, scratch);
+}
+
+inline void MaglevAssembler::JumpIfJSAnyIsNotPrimitive(
+    Register heap_object, Label* target, Label::Distance distance) {
+  // If the type of the result (stored in its map) is less than
+  // FIRST_JS_RECEIVER_TYPE, it is not an object in the ECMA sense.
+  static_assert(LAST_JS_RECEIVER_TYPE == LAST_TYPE);
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  MacroAssembler::CompareObjectType(heap_object, scratch, scratch,
+                                    FIRST_JS_RECEIVER_TYPE);
+  JumpIf(kUnsignedGreaterThanEqual, target, distance);
+}
+
+inline void MaglevAssembler::CompareObjectType(Register heap_object,
+                                               InstanceType type,
+                                               Register scratch) {
+  LoadMap(scratch, heap_object);
+  MacroAssembler::CompareInstanceType(scratch, scratch, type);
+}
+
+inline void MaglevAssembler::CompareObjectTypeRange(Register heap_object,
+                                                    InstanceType lower_limit,
+                                                    InstanceType higher_limit) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  CompareObjectTypeRange(heap_object, scratch, lower_limit, higher_limit);
+}
+
+inline void MaglevAssembler::CompareObjectTypeRange(Register heap_object,
+                                                    Register scratch,
+                                                    InstanceType lower_limit,
+                                                    InstanceType higher_limit) {
+  LoadMap(scratch, heap_object);
+  CompareInstanceTypeRange(scratch, scratch, lower_limit, higher_limit);
+}
+
+inline void MaglevAssembler::CompareMapWithRoot(Register object,
+                                                RootIndex index,
+                                                Register scratch) {
+  LoadMap(scratch, object);
+  CompareRoot(scratch, index);
+}
+
+inline void MaglevAssembler::CompareInstanceType(Register map,
+                                                 InstanceType instance_type) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  MacroAssembler::CompareInstanceType(map, scratch, instance_type);
+}
+
+inline void MaglevAssembler::CompareInstanceTypeRange(
+    Register map, Register instance_type_out, InstanceType lower_limit,
+    InstanceType higher_limit) {
+  MacroAssembler::CompareInstanceTypeRange(map, instance_type_out, lower_limit,
+                                           higher_limit);
+}
+
+inline void MaglevAssembler::CompareTagged(Register reg, Tagged<Smi> smi) {
+  cmp(reg, Operand(smi));
+}
+
+inline void MaglevAssembler::CompareTagged(Register reg,
+                                           Handle<HeapObject> obj) {
+  cmp(reg, Operand(obj));
+}
+
+inline void MaglevAssembler::CompareTagged(Register src1, Register src2) {
+  cmp(src1, src2);
+}
+
+inline void MaglevAssembler::CompareInt32(Register reg, int32_t imm) {
+  cmp(reg, Operand(imm));
+}
+
+inline void MaglevAssembler::CompareInt32(Register src1, Register src2) {
+  cmp(src1, src2);
+}
+
+inline void MaglevAssembler::CompareFloat64(DoubleRegister src1,
+                                            DoubleRegister src2) {
+  VFPCompareAndSetFlags(src1, src2);
+}
+
+inline void MaglevAssembler::PrepareCallCFunction(int num_reg_arguments,
+                                                  int num_double_registers) {
+  MacroAssembler::PrepareCallCFunction(num_reg_arguments, num_double_registers);
+}
+
+inline void MaglevAssembler::CallSelf() {
+  DCHECK(code_gen_state()->entry_label()->is_bound());
+  bl(code_gen_state()->entry_label());
+}
+
+inline void MaglevAssembler::Jump(Label* target, Label::Distance) {
+  // Any eager deopts should go through JumpIf to enable us to support the
+  // `--deopt-every-n-times` stress mode. See EmitEagerDeoptStress.
+  DCHECK(!IsDeoptLabel(target));
+  b(target);
+}
+
+inline void MaglevAssembler::JumpToDeopt(Label* target) {
+  DCHECK(IsDeoptLabel(target));
+  b(target);
+}
+
+inline void MaglevAssembler::EmitEagerDeoptStress(Label* target) {
+  // TODO(olivf): On arm `--deopt-every-n-times` is currently not supported.
+  // Supporting it would require to implement this method, additionally handle
+  // deopt branches in Cbz, and handle all cases where we fall through to the
+  // deopt branch (like Int32Divide).
+}
+
+inline void MaglevAssembler::JumpIf(Condition cond, Label* target,
+                                    Label::Distance) {
+  b(target, cond);
+}
+
+inline void MaglevAssembler::JumpIfRoot(Register with, RootIndex index,
+                                        Label* if_equal,
+                                        Label::Distance distance) {
+  MacroAssembler::JumpIfRoot(with, index, if_equal);
+}
+
+inline void MaglevAssembler::JumpIfNotRoot(Register with, RootIndex index,
+                                           Label* if_not_equal,
+                                           Label::Distance distance) {
+  MacroAssembler::JumpIfNotRoot(with, index, if_not_equal);
+}
+
+inline void MaglevAssembler::JumpIfSmi(Register src, Label* on_smi,
+                                       Label::Distance distance) {
+  MacroAssembler::JumpIfSmi(src, on_smi);
+}
+
+inline void MaglevAssembler::JumpIfNotSmi(Register src, Label* on_smi,
+                                          Label::Distance distance) {
+  MacroAssembler::JumpIfNotSmi(src, on_smi);
+}
+
+void MaglevAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
+                                 Label* target, Label::Distance) {
+  cmp(value, Operand(byte));
+  b(cc, target);
+}
+
+void MaglevAssembler::JumpIfHoleNan(DoubleRegister value, Register scratch,
+                                    Label* target, Label::Distance distance) {
+  MaglevAssembler::ScratchRegisterScope temps(this);
+  Register repr = temps.Acquire();
+  Label not_hole_nan;
+  static_assert(kHoleNanLower32 == kHoleNanUpper32);
+  Move(scratch, kHoleNanLower32);
+  VmovLow(repr, value);
+  cmp(repr, scratch);
+  JumpIf(kNotEqual, &not_hole_nan, Label::kNear);
+  VmovHigh(repr, value);
+  cmp(repr, scratch);
+  JumpIf(kEqual, target, distance);
+  bind(&not_hole_nan);
+}
+
+void MaglevAssembler::JumpIfNotHoleNan(DoubleRegister value, Register scratch,
+                                       Label* target,
+                                       Label::Distance distance) {
+  MaglevAssembler::ScratchRegisterScope temps(this);
+  Register repr = temps.Acquire();
+  static_assert(kHoleNanLower32 == kHoleNanUpper32);
+  Move(scratch, kHoleNanLower32);
+  VmovLow(repr, value);
+  cmp(repr, scratch);
+  JumpIf(kNotEqual, target, distance);
+  VmovHigh(repr, value);
+  cmp(repr, scratch);
+  JumpIf(kNotEqual, target, distance);
+}
+
+void MaglevAssembler::JumpIfNotHoleNan(MemOperand operand, Label* target,
+                                       Label::Distance distance) {
+  MaglevAssembler::ScratchRegisterScope temps(this);
+  Register repr = temps.Acquire();
+  ldr(repr, operand);
+  // Acquire {scratch} after ldr, since this might need a scratch register.
+  Register scratch = temps.Acquire();
+  static_assert(kHoleNanLower32 == kHoleNanUpper32);
+  Move(scratch, kHoleNanUpper32);
+  cmp(repr, scratch);
+  JumpIf(kNotEqual, target, distance);
+  operand.set_offset(operand.offset() + 4);
+  ldr(repr, operand);
+  cmp(repr, scratch);
+  JumpIf(kNotEqual, target, distance);
+}
+
+inline void MaglevAssembler::CompareInt32AndJumpIf(Register r1, Register r2,
+                                                   Condition cond,
+                                                   Label* target,
+                                                   Label::Distance distance) {
+  cmp(r1, r2);
+  b(cond, target);
+}
+
+inline void MaglevAssembler::CompareInt32AndJumpIf(Register r1, int32_t value,
+                                                   Condition cond,
+                                                   Label* target,
+                                                   Label::Distance distance) {
+  cmp(r1, Operand(value));
+  b(cond, target);
+}
+
+inline void MaglevAssembler::CompareSmiAndJumpIf(Register r1, Tagged<Smi> value,
+                                                 Condition cond, Label* target,
+                                                 Label::Distance distance) {
+  cmp(r1, Operand(value));
+  b(cond, target);
+}
+
+inline void MaglevAssembler::CompareByteAndJumpIf(MemOperand left, int8_t right,
+                                                  Condition cond,
+                                                  Register scratch,
+                                                  Label* target,
+                                                  Label::Distance distance) {
+  LoadByte(scratch, left);
+  Cmp(scratch, right);
+  JumpIf(cond, target, distance);
+}
+
+inline void MaglevAssembler::CompareTaggedAndJumpIf(Register r1,
+                                                    Tagged<Smi> value,
+                                                    Condition cond,
+                                                    Label* target,
+                                                    Label::Distance distance) {
+  cmp(r1, Operand(value));
+  b(cond, target);
+}
+
+inline void MaglevAssembler::CompareDoubleAndJumpIfZeroOrNaN(
+    DoubleRegister reg, Label* target, Label::Distance distance) {
+  VFPCompareAndSetFlags(reg, 0.0);
+  JumpIf(eq, target);
+  JumpIf(vs, target);  // NaN check
+}
+
+inline void MaglevAssembler::CompareDoubleAndJumpIfZeroOrNaN(
+    MemOperand operand, Label* target, Label::Distance distance) {
+  ScratchRegisterScope temps(this);
+  DoubleRegister value_double = temps.AcquireDouble();
+  vldr(value_double, operand);
+  CompareDoubleAndJumpIfZeroOrNaN(value_double, target, distance);
+}
+
+inline void MaglevAssembler::TestInt32AndJumpIfAnySet(
+    Register r1, int32_t mask, Label* target, Label::Distance distance) {
+  tst(r1, Operand(mask));
+  b(ne, target);
+}
+
+inline void MaglevAssembler::TestInt32AndJumpIfAnySet(
+    MemOperand operand, int32_t mask, Label* target, Label::Distance distance) {
+  ScratchRegisterScope temps(this);
+  Register value = temps.Acquire();
+  ldr(value, operand);
+  TestInt32AndJumpIfAnySet(value, mask, target);
+}
+
+inline void MaglevAssembler::TestInt32AndJumpIfAllClear(
+    Register r1, int32_t mask, Label* target, Label::Distance distance) {
+  tst(r1, Operand(mask));
+  b(eq, target);
+}
+
+inline void MaglevAssembler::TestInt32AndJumpIfAllClear(
+    MemOperand operand, int32_t mask, Label* target, Label::Distance distance) {
+  ScratchRegisterScope temps(this);
+  Register value = temps.Acquire();
+  ldr(value, operand);
+  TestInt32AndJumpIfAllClear(value, mask, target);
+}
+
+inline void MaglevAssembler::LoadHeapNumberValue(DoubleRegister result,
+                                                 Register heap_number) {
+  vldr(result, FieldMemOperand(heap_number, HeapNumber::kValueOffset));
+}
+
+inline void MaglevAssembler::Int32ToDouble(DoubleRegister result,
+                                           Register src) {
+  UseScratchRegisterScope temps(this);
+  SwVfpRegister temp_vfps = SwVfpRegister::no_reg();
+  if (result.code() < 16) {
+    temp_vfps = LowDwVfpRegister::from_code(result.code()).low();
+  } else {
+    temp_vfps = temps.AcquireS();
+  }
+  vmov(temp_vfps, src);
+  vcvt_f64_s32(result, temp_vfps);
+}
+
+inline void MaglevAssembler::Uint32ToDouble(DoubleRegister result,
+                                            Register src) {
+  UseScratchRegisterScope temps(this);
+  SwVfpRegister temp_vfps = SwVfpRegister::no_reg();
+  if (result.code() < 16) {
+    temp_vfps = LowDwVfpRegister::from_code(result.code()).low();
+  } else {
+    temp_vfps = temps.AcquireS();
+  }
+  vmov(temp_vfps, src);
+  vcvt_f64_u32(result, temp_vfps);
+}
+
+inline void MaglevAssembler::Pop(Register dst) { pop(dst); }
+
+inline void MaglevAssembler::AssertStackSizeCorrect() {
+  if (v8_flags.debug_code) {
+    ScratchRegisterScope temps(this);
+    Register scratch = temps.Acquire();
+    add(scratch, sp,
+        Operand(code_gen_state()->stack_slots() * kSystemPointerSize +
+                StandardFrameConstants::kFixedFrameSizeFromFp));
+    cmp(scratch, fp);
+    Assert(eq, AbortReason::kStackAccessBelowStackPointer);
+  }
+}
+
+inline Condition MaglevAssembler::FunctionEntryStackCheck(
+    int stack_check_offset) {
+  ScratchRegisterScope temps(this);
+  Register stack_cmp_reg = sp;
+  if (stack_check_offset > kStackLimitSlackForDeoptimizationInBytes) {
+    stack_cmp_reg = temps.Acquire();
+    sub(stack_cmp_reg, sp, Operand(stack_check_offset));
+  }
+  Register interrupt_stack_limit = temps.Acquire();
+  LoadStackLimit(interrupt_stack_limit, StackLimitKind::kInterruptStackLimit);
+  cmp(stack_cmp_reg, interrupt_stack_limit);
+  return kUnsignedGreaterThanEqual;
+}
+
+inline void MaglevAssembler::FinishCode() { CheckConstPool(true, false); }
+
+template <typename NodeT>
+inline void MaglevAssembler::EmitEagerDeoptIfNotEqual(DeoptimizeReason reason,
+                                                      NodeT* node) {
+  EmitEagerDeoptIf(ne, reason, node);
+}
+
+template <>
+inline void MaglevAssembler::MoveRepr(MachineRepresentation repr, Register dst,
+                                      Register src) {
+  Move(dst, src);
+}
+template <>
+inline void MaglevAssembler::MoveRepr(MachineRepresentation repr, Register dst,
+                                      MemOperand src) {
+  switch (repr) {
+    case MachineRepresentation::kWord32:
+    case MachineRepresentation::kTagged:
+    case MachineRepresentation::kTaggedPointer:
+    case MachineRepresentation::kTaggedSigned:
+      return ldr(dst, src);
+    default:
+      UNREACHABLE();
+  }
+}
+template <>
+inline void MaglevAssembler::MoveRepr(MachineRepresentation repr,
+                                      MemOperand dst, Register src) {
+  switch (repr) {
+    case MachineRepresentation::kWord32:
+    case MachineRepresentation::kTagged:
+    case MachineRepresentation::kTaggedPointer:
+    case MachineRepresentation::kTaggedSigned:
+      return str(src, dst);
+    default:
+      UNREACHABLE();
+  }
+}
+template <>
+inline void MaglevAssembler::MoveRepr(MachineRepresentation repr,
+                                      MemOperand dst, MemOperand src) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  MoveRepr(repr, scratch, src);
+  MoveRepr(repr, dst, scratch);
+}
+
+}  // namespace maglev
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_MAGLEV_ARM_MAGLEV_ASSEMBLER_ARM_INL_H_
diff --git a/deps/v8/src/maglev/arm/maglev-assembler-arm.cc b/deps/v8/src/maglev/arm/maglev-assembler-arm.cc
new file mode 100644
index 00000000000000..432f27b914a678
--- /dev/null
+++ b/deps/v8/src/maglev/arm/maglev-assembler-arm.cc
@@ -0,0 +1,568 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/codegen/interface-descriptors-inl.h"
+#include "src/deoptimizer/deoptimizer.h"
+#include "src/maglev/maglev-assembler-inl.h"
+#include "src/maglev/maglev-graph.h"
+
+namespace v8 {
+namespace internal {
+namespace maglev {
+
+#define __ masm->
+
+void MaglevAssembler::Allocate(RegisterSnapshot register_snapshot,
+                               Register object, int size_in_bytes,
+                               AllocationType alloc_type,
+                               AllocationAlignment alignment) {
+  DCHECK(allow_allocate());
+  // TODO(victorgomes): Call the runtime for large object allocation.
+  // TODO(victorgomes): Support double alignment.
+  DCHECK_EQ(alignment, kTaggedAligned);
+  size_in_bytes = ALIGN_TO_ALLOCATION_ALIGNMENT(size_in_bytes);
+  if (v8_flags.single_generation) {
+    alloc_type = AllocationType::kOld;
+  }
+  bool in_new_space = alloc_type == AllocationType::kYoung;
+  ExternalReference top =
+      in_new_space
+          ? ExternalReference::new_space_allocation_top_address(isolate_)
+          : ExternalReference::old_space_allocation_top_address(isolate_);
+  ExternalReference limit =
+      in_new_space
+          ? ExternalReference::new_space_allocation_limit_address(isolate_)
+          : ExternalReference::old_space_allocation_limit_address(isolate_);
+
+  ZoneLabelRef done(this);
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  // We are a bit short on registers, so we use the same register for {object}
+  // and {new_top}. Once we have defined {new_top}, we don't use {object} until
+  // {new_top} is used for the last time. And there (at the end of this
+  // function), we recover the original {object} from {new_top} by subtracting
+  // {size_in_bytes}.
+  Register new_top = object;
+  // Check if there is enough space.
+  ldr(object, ExternalReferenceAsOperand(top, scratch));
+  add(new_top, object, Operand(size_in_bytes), LeaveCC);
+  ldr(scratch, ExternalReferenceAsOperand(limit, scratch));
+  cmp(new_top, scratch);
+  // Otherwise call runtime.
+  JumpToDeferredIf(
+      ge,
+      [](MaglevAssembler* masm, RegisterSnapshot register_snapshot,
+         Register object, Builtin builtin, int size_in_bytes,
+         ZoneLabelRef done) {
+        // Remove {object} from snapshot, since it is the returned allocated
+        // HeapObject.
+        register_snapshot.live_registers.clear(object);
+        register_snapshot.live_tagged_registers.clear(object);
+        {
+          SaveRegisterStateForCall save_register_state(masm, register_snapshot);
+          using D = AllocateDescriptor;
+          __ Move(D::GetRegisterParameter(D::kRequestedSize), size_in_bytes);
+          __ CallBuiltin(builtin);
+          save_register_state.DefineSafepoint();
+          __ Move(object, kReturnRegister0);
+        }
+        __ b(*done);
+      },
+      register_snapshot, object,
+      in_new_space ? Builtin::kAllocateInYoungGeneration
+                   : Builtin::kAllocateInOldGeneration,
+      size_in_bytes, done);
+  // Store new top and tag object.
+  Move(ExternalReferenceAsOperand(top, scratch), new_top);
+  add(object, object, Operand(kHeapObjectTag - size_in_bytes), LeaveCC);
+  bind(*done);
+}
+
+void MaglevAssembler::OSRPrologue(Graph* graph) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+
+  DCHECK(graph->is_osr());
+  CHECK(!graph->has_recursive_calls());
+
+  uint32_t source_frame_size =
+      graph->min_maglev_stackslots_for_unoptimized_frame_size();
+
+  if (v8_flags.maglev_assert_stack_size && v8_flags.debug_code) {
+    add(scratch, sp,
+        Operand(source_frame_size * kSystemPointerSize +
+                StandardFrameConstants::kFixedFrameSizeFromFp));
+    cmp(scratch, fp);
+    Assert(eq, AbortReason::kOsrUnexpectedStackSize);
+  }
+
+  uint32_t target_frame_size =
+      graph->tagged_stack_slots() + graph->untagged_stack_slots();
+  CHECK_LE(source_frame_size, target_frame_size);
+
+  if (source_frame_size < target_frame_size) {
+    ASM_CODE_COMMENT_STRING(this, "Growing frame for OSR");
+    uint32_t additional_tagged =
+        source_frame_size < graph->tagged_stack_slots()
+            ? graph->tagged_stack_slots() - source_frame_size
+            : 0;
+    if (additional_tagged) {
+      Move(scratch, 0);
+    }
+    for (size_t i = 0; i < additional_tagged; ++i) {
+      Push(scratch);
+    }
+    uint32_t size_so_far = source_frame_size + additional_tagged;
+    CHECK_LE(size_so_far, target_frame_size);
+    if (size_so_far < target_frame_size) {
+      sub(sp, sp,
+          Operand((target_frame_size - size_so_far) * kSystemPointerSize));
+    }
+  }
+}
+
+void MaglevAssembler::Prologue(Graph* graph) {
+  ScratchRegisterScope temps(this);
+  temps.Include({r4, r8});
+
+  DCHECK(!graph->is_osr());
+
+  BailoutIfDeoptimized();
+
+  if (graph->has_recursive_calls()) {
+    bind(code_gen_state()->entry_label());
+  }
+
+  // Tiering support.
+  if (v8_flags.turbofan) {
+    using D = MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor;
+    Register flags = D::GetRegisterParameter(D::kFlags);
+    Register feedback_vector = D::GetRegisterParameter(D::kFeedbackVector);
+    DCHECK(!AreAliased(flags, feedback_vector, kJavaScriptCallArgCountRegister,
+                       kJSFunctionRegister, kContextRegister,
+                       kJavaScriptCallNewTargetRegister));
+    DCHECK(!temps.Available().has(flags));
+    DCHECK(!temps.Available().has(feedback_vector));
+    Move(feedback_vector,
+         compilation_info()->toplevel_compilation_unit()->feedback().object());
+    Condition needs_processing =
+        LoadFeedbackVectorFlagsAndCheckIfNeedsProcessing(flags, feedback_vector,
+                                                         CodeKind::MAGLEV);
+    // Tail call on Arm produces 3 instructions, so we emit that in deferred
+    // code.
+    JumpToDeferredIf(needs_processing, [](MaglevAssembler* masm) {
+      __ TailCallBuiltin(
+          Builtin::kMaglevOptimizeCodeOrTailCallOptimizedCodeSlot);
+    });
+  }
+
+  EnterFrame(StackFrame::MAGLEV);
+  // Save arguments in frame.
+  // TODO(leszeks): Consider eliding this frame if we don't make any calls
+  // that could clobber these registers.
+  Push(kContextRegister);
+  Push(kJSFunctionRegister);              // Callee's JS function.
+  Push(kJavaScriptCallArgCountRegister);  // Actual argument count.
+
+  // Initialize stack slots.
+  if (graph->tagged_stack_slots() > 0) {
+    ASM_CODE_COMMENT_STRING(this, "Initializing stack slots");
+    ScratchRegisterScope temps(this);
+    Register scratch = temps.Acquire();
+    Move(scratch, 0);
+
+    // Magic value. Experimentally, an unroll size of 8 doesn't seem any
+    // worse than fully unrolled pushes.
+    const int kLoopUnrollSize = 8;
+    int tagged_slots = graph->tagged_stack_slots();
+    if (tagged_slots < kLoopUnrollSize) {
+      // If the frame is small enough, just unroll the frame fill
+      // completely.
+      for (int i = 0; i < tagged_slots; ++i) {
+        Push(scratch);
+      }
+    } else {
+      // Extract the first few slots to round to the unroll size.
+      int first_slots = tagged_slots % kLoopUnrollSize;
+      for (int i = 0; i < first_slots; ++i) {
+        Push(scratch);
+      }
+      Register unroll_counter = temps.Acquire();
+      Move(unroll_counter, tagged_slots / kLoopUnrollSize);
+      // We enter the loop unconditionally, so make sure we need to loop at
+      // least once.
+      DCHECK_GT(tagged_slots / kLoopUnrollSize, 0);
+      Label loop;
+      bind(&loop);
+      for (int i = 0; i < kLoopUnrollSize; ++i) {
+        Push(scratch);
+      }
+      sub(unroll_counter, unroll_counter, Operand(1), SetCC);
+      b(kGreaterThan, &loop);
+    }
+  }
+  if (graph->untagged_stack_slots() > 0) {
+    // Extend rsp by the size of the remaining untagged part of the frame,
+    // no need to initialise these.
+    sub(sp, sp, Operand(graph->untagged_stack_slots() * kSystemPointerSize));
+  }
+}
+
+void MaglevAssembler::MaybeEmitDeoptBuiltinsCall(size_t eager_deopt_count,
+                                                 Label* eager_deopt_entry,
+                                                 size_t lazy_deopt_count,
+                                                 Label* lazy_deopt_entry) {
+  CheckConstPool(true, false);
+}
+
+void MaglevAssembler::LoadSingleCharacterString(Register result,
+                                                Register char_code,
+                                                Register scratch) {
+  DCHECK_NE(char_code, scratch);
+  if (v8_flags.debug_code) {
+    cmp(char_code, Operand(String::kMaxOneByteCharCode));
+    Assert(kUnsignedLessThanEqual, AbortReason::kUnexpectedValue);
+  }
+  Register table = scratch;
+  LoadRoot(table, RootIndex::kSingleCharacterStringTable);
+  add(table, table, Operand(char_code, LSL, kTaggedSizeLog2));
+  ldr(result, FieldMemOperand(table, FixedArray::kHeaderSize));
+}
+
+void MaglevAssembler::StringFromCharCode(RegisterSnapshot register_snapshot,
+                                         Label* char_code_fits_one_byte,
+                                         Register result, Register char_code,
+                                         Register scratch) {
+  AssertZeroExtended(char_code);
+  DCHECK_NE(char_code, scratch);
+  ZoneLabelRef done(this);
+  cmp(char_code, Operand(String::kMaxOneByteCharCode));
+  JumpToDeferredIf(
+      kUnsignedGreaterThan,
+      [](MaglevAssembler* masm, RegisterSnapshot register_snapshot,
+         ZoneLabelRef done, Register result, Register char_code,
+         Register scratch) {
+        ScratchRegisterScope temps(masm);
+        // Ensure that {result} never aliases {scratch}, otherwise the store
+        // will fail.
+        Register string = result;
+        bool reallocate_result = (scratch == result);
+        if (reallocate_result) {
+          string = temps.Acquire();
+        }
+        // Be sure to save {char_code}. If it aliases with {result}, use
+        // the scratch register.
+        if (char_code == result) {
+          __ Move(scratch, char_code);
+          char_code = scratch;
+        }
+        DCHECK_NE(char_code, string);
+        DCHECK_NE(scratch, string);
+        DCHECK(!register_snapshot.live_tagged_registers.has(char_code));
+        register_snapshot.live_registers.set(char_code);
+        __ AllocateTwoByteString(register_snapshot, string, 1);
+        __ and_(scratch, char_code, Operand(0xFFFF));
+        __ strh(scratch,
+                FieldMemOperand(string, SeqTwoByteString::kHeaderSize));
+        if (reallocate_result) {
+          __ Move(result, string);
+        }
+        __ b(*done);
+      },
+      register_snapshot, done, result, char_code, scratch);
+  if (char_code_fits_one_byte != nullptr) {
+    bind(char_code_fits_one_byte);
+  }
+  LoadSingleCharacterString(result, char_code, scratch);
+  bind(*done);
+}
+
+void MaglevAssembler::StringCharCodeOrCodePointAt(
+    BuiltinStringPrototypeCharCodeOrCodePointAt::Mode mode,
+    RegisterSnapshot& register_snapshot, Register result, Register string,
+    Register index, Register instance_type, Label* result_fits_one_byte) {
+  ZoneLabelRef done(this);
+  Label seq_string;
+  Label cons_string;
+  Label sliced_string;
+
+  Label* deferred_runtime_call = MakeDeferredCode(
+      [](MaglevAssembler* masm,
+         BuiltinStringPrototypeCharCodeOrCodePointAt::Mode mode,
+         RegisterSnapshot register_snapshot, ZoneLabelRef done, Register result,
+         Register string, Register index) {
+        DCHECK(!register_snapshot.live_registers.has(result));
+        DCHECK(!register_snapshot.live_registers.has(string));
+        DCHECK(!register_snapshot.live_registers.has(index));
+        {
+          SaveRegisterStateForCall save_register_state(masm, register_snapshot);
+          __ SmiTag(index);
+          __ Push(string, index);
+          __ Move(kContextRegister, masm->native_context().object());
+          // This call does not throw nor can deopt.
+          if (mode ==
+              BuiltinStringPrototypeCharCodeOrCodePointAt::kCodePointAt) {
+            __ CallRuntime(Runtime::kStringCodePointAt);
+          } else {
+            DCHECK_EQ(mode,
+                      BuiltinStringPrototypeCharCodeOrCodePointAt::kCharCodeAt);
+            __ CallRuntime(Runtime::kStringCharCodeAt);
+          }
+          save_register_state.DefineSafepoint();
+          __ SmiUntag(kReturnRegister0);
+          __ Move(result, kReturnRegister0);
+        }
+        __ b(*done);
+      },
+      mode, register_snapshot, done, result, string, index);
+
+  // We might need to try more than one time for ConsString, SlicedString and
+  // ThinString.
+  Label loop;
+  bind(&loop);
+
+  if (v8_flags.debug_code) {
+    Register scratch = instance_type;
+
+    // Check if {string} is a string.
+    AssertNotSmi(string);
+    LoadMap(scratch, string);
+    CompareInstanceTypeRange(scratch, scratch, FIRST_STRING_TYPE,
+                             LAST_STRING_TYPE);
+    Check(ls, AbortReason::kUnexpectedValue);
+
+    ldr(scratch, FieldMemOperand(string, String::kLengthOffset));
+    cmp(index, scratch);
+    Check(lo, AbortReason::kUnexpectedValue);
+  }
+
+  // Get instance type.
+  LoadInstanceType(instance_type, string);
+
+  {
+    ScratchRegisterScope temps(this);
+    Register representation = temps.Acquire();
+
+    // TODO(victorgomes): Add fast path for external strings.
+    and_(representation, instance_type, Operand(kStringRepresentationMask));
+    cmp(representation, Operand(kSeqStringTag));
+    b(eq, &seq_string);
+    cmp(representation, Operand(kConsStringTag));
+    b(eq, &cons_string);
+    cmp(representation, Operand(kSlicedStringTag));
+    b(eq, &sliced_string);
+    cmp(representation, Operand(kThinStringTag));
+    b(ne, deferred_runtime_call);
+    // Fallthrough to thin string.
+  }
+
+  // Is a thin string.
+  {
+    ldr(string, FieldMemOperand(string, ThinString::kActualOffset));
+    b(&loop);
+  }
+
+  bind(&sliced_string);
+  {
+    ScratchRegisterScope temps(this);
+    Register offset = temps.Acquire();
+
+    LoadAndUntagTaggedSignedField(offset, string, SlicedString::kOffsetOffset);
+    LoadTaggedField(string, string, SlicedString::kParentOffset);
+    add(index, index, offset);
+    b(&loop);
+  }
+
+  bind(&cons_string);
+  {
+    // Reuse {instance_type} register here, since CompareRoot requires a scratch
+    // register as well.
+    Register second_string = instance_type;
+    ldr(second_string, FieldMemOperand(string, ConsString::kSecondOffset));
+    CompareRoot(second_string, RootIndex::kempty_string);
+    b(ne, deferred_runtime_call);
+    ldr(string, FieldMemOperand(string, ConsString::kFirstOffset));
+    b(&loop);  // Try again with first string.
+  }
+
+  bind(&seq_string);
+  {
+    Label two_byte_string;
+    tst(instance_type, Operand(kOneByteStringTag));
+    b(eq, &two_byte_string);
+    // The result of one-byte string will be the same for both modes
+    // (CharCodeAt/CodePointAt), since it cannot be the first half of a
+    // surrogate pair.
+    add(index, index, Operand(SeqOneByteString::kHeaderSize - kHeapObjectTag));
+    ldrb(result, MemOperand(string, index));
+    b(result_fits_one_byte);
+
+    bind(&two_byte_string);
+    // {instance_type} is unused from this point, so we can use as scratch.
+    Register scratch = instance_type;
+    lsl(scratch, index, Operand(1));
+    add(scratch, scratch,
+        Operand(SeqTwoByteString::kHeaderSize - kHeapObjectTag));
+    ldrh(result, MemOperand(string, scratch));
+
+    if (mode == BuiltinStringPrototypeCharCodeOrCodePointAt::kCodePointAt) {
+      Register first_code_point = scratch;
+      and_(first_code_point, result, Operand(0xfc00));
+      cmp(first_code_point, Operand(0xd800));
+      b(ne, *done);
+
+      Register length = scratch;
+      ldr(length, FieldMemOperand(string, String::kLengthOffset));
+      add(index, index, Operand(1));
+      cmp(index, length);
+      b(ge, *done);
+
+      Register second_code_point = scratch;
+      lsl(index, index, Operand(1));
+      add(index, index,
+          Operand(SeqTwoByteString::kHeaderSize - kHeapObjectTag));
+      ldrh(second_code_point, MemOperand(string, index));
+
+      // {index} is not needed at this point.
+      Register scratch2 = index;
+      and_(scratch2, second_code_point, Operand(0xfc00));
+      cmp(scratch2, Operand(0xdc00));
+      b(ne, *done);
+
+      int surrogate_offset = 0x10000 - (0xd800 << 10) - 0xdc00;
+      add(second_code_point, second_code_point, Operand(surrogate_offset));
+      lsl(result, result, Operand(10));
+      add(result, result, second_code_point);
+    }
+
+    // Fallthrough.
+  }
+
+  bind(*done);
+
+  if (v8_flags.debug_code) {
+    // We make sure that the user of this macro is not relying in string and
+    // index to not be clobbered.
+    if (result != string) {
+      Move(string, 0xdeadbeef);
+    }
+    if (result != index) {
+      Move(index, 0xdeadbeef);
+    }
+  }
+}
+
+void MaglevAssembler::TruncateDoubleToInt32(Register dst, DoubleRegister src) {
+  ZoneLabelRef done(this);
+  Label* slow_path = MakeDeferredCode(
+      [](MaglevAssembler* masm, DoubleRegister src, Register dst,
+         ZoneLabelRef done) {
+        __ push(lr);
+        __ AllocateStackSpace(kDoubleSize);
+        __ vstr(src, MemOperand(sp, 0));
+        __ CallBuiltin(Builtin::kDoubleToI);
+        __ ldr(dst, MemOperand(sp, 0));
+        __ add(sp, sp, Operand(kDoubleSize));
+        __ pop(lr);
+        __ Jump(*done);
+      },
+      src, dst, done);
+  TryInlineTruncateDoubleToI(dst, src, *done);
+  Jump(slow_path);
+  bind(*done);
+}
+
+void MaglevAssembler::TryTruncateDoubleToInt32(Register dst, DoubleRegister src,
+                                               Label* fail) {
+  UseScratchRegisterScope temps(this);
+  LowDwVfpRegister low_double = temps.AcquireLowD();
+  SwVfpRegister temp_vfps = low_double.low();
+  DoubleRegister converted_back = low_double;
+  Label done;
+
+  // Convert the input float64 value to int32.
+  vcvt_s32_f64(temp_vfps, src);
+  vmov(dst, temp_vfps);
+
+  // Convert that int32 value back to float64.
+  vcvt_f64_s32(converted_back, temp_vfps);
+
+  // Check that the result of the float64->int32->float64 is equal to the input
+  // (i.e. that the conversion didn't truncate.
+  VFPCompareAndSetFlags(src, converted_back);
+  JumpIf(kNotEqual, fail);
+
+  // Check if {input} is -0.
+  tst(dst, dst);
+  JumpIf(kNotEqual, &done);
+
+  // In case of 0, we need to check the high bits for the IEEE -0 pattern.
+  {
+    Register high_word32_of_input = temps.Acquire();
+    VmovHigh(high_word32_of_input, src);
+    cmp(high_word32_of_input, Operand(0));
+    JumpIf(kLessThan, fail);
+  }
+
+  bind(&done);
+}
+
+void MaglevAssembler::TryTruncateDoubleToUint32(Register dst,
+                                                DoubleRegister src,
+                                                Label* fail) {
+  UseScratchRegisterScope temps(this);
+  LowDwVfpRegister low_double = temps.AcquireLowD();
+  SwVfpRegister temp_vfps = low_double.low();
+  DoubleRegister converted_back = low_double;
+  Label done;
+
+  // Convert the input float64 value to uint32.
+  vcvt_u32_f64(temp_vfps, src);
+  vmov(dst, temp_vfps);
+
+  // Convert that uint32 value back to float64.
+  vcvt_f64_u32(converted_back, temp_vfps);
+
+  // Check that the result of the float64->uint32->float64 is equal to the input
+  // (i.e. that the conversion didn't truncate.
+  VFPCompareAndSetFlags(src, converted_back);
+  JumpIf(kNotEqual, fail);
+
+  // Check if {input} is -0.
+  tst(dst, dst);
+  JumpIf(kNotEqual, &done);
+
+  // In case of 0, we need to check the high bits for the IEEE -0 pattern.
+  {
+    Register high_word32_of_input = temps.Acquire();
+    VmovHigh(high_word32_of_input, src);
+    cmp(high_word32_of_input, Operand(0));
+    JumpIf(kLessThan, fail);
+  }
+
+  bind(&done);
+}
+
+void MaglevAssembler::TryChangeFloat64ToIndex(Register result,
+                                              DoubleRegister value,
+                                              Label* success, Label* fail) {
+  UseScratchRegisterScope temps(this);
+  LowDwVfpRegister low_double = temps.AcquireLowD();
+  SwVfpRegister temp_vfps = low_double.low();
+  DoubleRegister converted_back = low_double;
+  // Convert the input float64 value to int32.
+  vcvt_s32_f64(temp_vfps, value);
+  vmov(result, temp_vfps);
+  // Convert that int32 value back to float64.
+  vcvt_f64_s32(converted_back, temp_vfps);
+  // Check that the result of the float64->int32->float64 is equal to
+  // the input (i.e. that the conversion didn't truncate).
+  VFPCompareAndSetFlags(value, converted_back);
+  JumpIf(kNotEqual, fail);
+  Jump(success);
+}
+
+}  // namespace maglev
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/maglev/arm/maglev-ir-arm.cc b/deps/v8/src/maglev/arm/maglev-ir-arm.cc
new file mode 100644
index 00000000000000..3ce9d7f16ed0aa
--- /dev/null
+++ b/deps/v8/src/maglev/arm/maglev-ir-arm.cc
@@ -0,0 +1,895 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/base/logging.h"
+#include "src/codegen/arm/assembler-arm.h"
+#include "src/codegen/arm/register-arm.h"
+#include "src/maglev/arm/maglev-assembler-arm-inl.h"
+#include "src/maglev/maglev-assembler-inl.h"
+#include "src/maglev/maglev-graph-processor.h"
+#include "src/maglev/maglev-graph.h"
+#include "src/maglev/maglev-ir-inl.h"
+#include "src/maglev/maglev-ir.h"
+
+namespace v8 {
+namespace internal {
+namespace maglev {
+
+#define __ masm->
+
+void Int32NegateWithOverflow::SetValueLocationConstraints() {
+  UseRegister(value_input());
+  DefineAsRegister(this);
+}
+
+void Int32NegateWithOverflow::GenerateCode(MaglevAssembler* masm,
+                                           const ProcessingState& state) {
+  Register value = ToRegister(value_input());
+  Register out = ToRegister(result());
+
+  // Deopt when result would be -0.
+  __ cmp(value, Operand(0));
+  __ EmitEagerDeoptIf(eq, DeoptimizeReason::kOverflow, this);
+
+  __ rsb(out, value, Operand(0), SetCC);
+  // Output register must not be a register input into the eager deopt info.
+  DCHECK_REGLIST_EMPTY(RegList{out} &
+                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
+  __ EmitEagerDeoptIf(vs, DeoptimizeReason::kOverflow, this);
+}
+
+void Int32IncrementWithOverflow::SetValueLocationConstraints() {
+  UseRegister(value_input());
+  DefineAsRegister(this);
+}
+
+void Int32IncrementWithOverflow::GenerateCode(MaglevAssembler* masm,
+                                              const ProcessingState& state) {
+  Register value = ToRegister(value_input());
+  Register out = ToRegister(result());
+  __ add(out, value, Operand(1), SetCC);
+  // Output register must not be a register input into the eager deopt info.
+  DCHECK_REGLIST_EMPTY(RegList{out} &
+                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
+  __ EmitEagerDeoptIf(vs, DeoptimizeReason::kOverflow, this);
+}
+
+void Int32DecrementWithOverflow::SetValueLocationConstraints() {
+  UseRegister(value_input());
+  DefineAsRegister(this);
+}
+
+void Int32DecrementWithOverflow::GenerateCode(MaglevAssembler* masm,
+                                              const ProcessingState& state) {
+  Register value = ToRegister(value_input());
+  Register out = ToRegister(result());
+  __ sub(out, value, Operand(1), SetCC);
+  // Output register must not be a register input into the eager deopt info.
+  DCHECK_REGLIST_EMPTY(RegList{out} &
+                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
+  __ EmitEagerDeoptIf(vs, DeoptimizeReason::kOverflow, this);
+}
+
+int BuiltinStringFromCharCode::MaxCallStackArgs() const {
+  return AllocateDescriptor::GetStackParameterCount();
+}
+void BuiltinStringFromCharCode::SetValueLocationConstraints() {
+  if (code_input().node()->Is<Int32Constant>()) {
+    UseAny(code_input());
+  } else {
+    UseRegister(code_input());
+  }
+  set_temporaries_needed(2);
+  DefineAsRegister(this);
+}
+void BuiltinStringFromCharCode::GenerateCode(MaglevAssembler* masm,
+                                             const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+  Register result_string = ToRegister(result());
+  if (Int32Constant* constant = code_input().node()->TryCast<Int32Constant>()) {
+    int32_t char_code = constant->value();
+    if (0 <= char_code && char_code < String::kMaxOneByteCharCode) {
+      __ LoadSingleCharacterString(result_string, char_code);
+    } else {
+      // Ensure that {result_string} never aliases {scratch}, otherwise the
+      // store will fail.
+      bool reallocate_result = (scratch == result_string);
+      if (reallocate_result) {
+        result_string = temps.Acquire();
+      }
+      DCHECK(scratch != result_string);
+      __ AllocateTwoByteString(register_snapshot(), result_string, 1);
+      __ Move(scratch, char_code & 0xFFFF);
+      __ strh(scratch,
+              FieldMemOperand(result_string, SeqTwoByteString::kHeaderSize));
+      if (reallocate_result) {
+        __ Move(ToRegister(result()), result_string);
+      }
+    }
+  } else {
+    __ StringFromCharCode(register_snapshot(), nullptr, result_string,
+                          ToRegister(code_input()), scratch);
+  }
+}
+
+int BuiltinStringPrototypeCharCodeOrCodePointAt::MaxCallStackArgs() const {
+  DCHECK_EQ(Runtime::FunctionForId(Runtime::kStringCharCodeAt)->nargs, 2);
+  return 2;
+}
+void BuiltinStringPrototypeCharCodeOrCodePointAt::
+    SetValueLocationConstraints() {
+  UseAndClobberRegister(string_input());
+  UseAndClobberRegister(index_input());
+  DefineAsRegister(this);
+}
+void BuiltinStringPrototypeCharCodeOrCodePointAt::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  Label done;
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+  RegisterSnapshot save_registers = register_snapshot();
+  __ StringCharCodeOrCodePointAt(mode_, save_registers, ToRegister(result()),
+                                 ToRegister(string_input()),
+                                 ToRegister(index_input()), scratch, &done);
+  __ bind(&done);
+}
+
+void FoldedAllocation::SetValueLocationConstraints() {
+  UseRegister(raw_allocation());
+  DefineAsRegister(this);
+}
+
+void FoldedAllocation::GenerateCode(MaglevAssembler* masm,
+                                    const ProcessingState& state) {
+  __ add(ToRegister(result()), ToRegister(raw_allocation()), Operand(offset()));
+}
+
+int CheckedObjectToIndex::MaxCallStackArgs() const { return 0; }
+
+void Int32AddWithOverflow::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+}
+
+void Int32AddWithOverflow::GenerateCode(MaglevAssembler* masm,
+                                        const ProcessingState& state) {
+  Register left = ToRegister(left_input());
+  Register right = ToRegister(right_input());
+  Register out = ToRegister(result());
+  __ add(out, left, right, SetCC);
+  // The output register shouldn't be a register input into the eager deopt
+  // info.
+  DCHECK_REGLIST_EMPTY(RegList{out} &
+                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
+  __ EmitEagerDeoptIf(vs, DeoptimizeReason::kOverflow, this);
+}
+
+void Int32SubtractWithOverflow::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+}
+void Int32SubtractWithOverflow::GenerateCode(MaglevAssembler* masm,
+                                             const ProcessingState& state) {
+  Register left = ToRegister(left_input());
+  Register right = ToRegister(right_input());
+  Register out = ToRegister(result());
+  __ sub(out, left, right, SetCC);
+  // The output register shouldn't be a register input into the eager deopt
+  // info.
+  DCHECK_REGLIST_EMPTY(RegList{out} &
+                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
+  __ EmitEagerDeoptIf(vs, DeoptimizeReason::kOverflow, this);
+}
+
+void Int32MultiplyWithOverflow::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+  set_temporaries_needed(1);
+}
+void Int32MultiplyWithOverflow::GenerateCode(MaglevAssembler* masm,
+                                             const ProcessingState& state) {
+  Register left = ToRegister(left_input());
+  Register right = ToRegister(right_input());
+  Register out = ToRegister(result());
+
+  // TODO(leszeks): peephole optimise multiplication by a constant.
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  bool out_alias_input = out == left || out == right;
+  Register res_low = out;
+  if (out_alias_input) {
+    res_low = temps.Acquire();
+  }
+  Register res_high = temps.Acquire();
+  __ smull(res_low, res_high, left, right);
+
+  // ARM doesn't set the overflow flag for multiplication, so we need to
+  // test on kNotEqual.
+  __ cmp(res_high, Operand(res_low, ASR, 31));
+  __ EmitEagerDeoptIf(ne, DeoptimizeReason::kOverflow, this);
+
+  // If the result is zero, check if either lhs or rhs is negative.
+  Label end;
+  __ tst(res_low, res_low);
+  __ b(ne, &end);
+  Register temp = res_high;
+  __ orr(temp, left, right, SetCC);
+  // If one of them is negative, we must have a -0 result, which is non-int32,
+  // so deopt.
+  __ EmitEagerDeoptIf(mi, DeoptimizeReason::kOverflow, this);
+
+  __ bind(&end);
+  if (out_alias_input) {
+    __ Move(out, res_low);
+  }
+}
+
+void Int32DivideWithOverflow::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+  if (!CpuFeatures::IsSupported(SUDIV)) {
+    // We use the standard low double register and an extra one.
+    set_double_temporaries_needed(1);
+  }
+}
+void Int32DivideWithOverflow::GenerateCode(MaglevAssembler* masm,
+                                           const ProcessingState& state) {
+  Register left = ToRegister(left_input());
+  Register right = ToRegister(right_input());
+  Register out = ToRegister(result());
+
+  // TODO(leszeks): peephole optimise division by a constant.
+
+  // Pre-check for overflow, since idiv throws a division exception on overflow
+  // rather than setting the overflow flag. Logic copied from
+  // effect-control-linearizer.cc
+
+  // Check if {right} is positive (and not zero).
+  __ cmp(right, Operand(0));
+  ZoneLabelRef done(masm);
+  __ JumpToDeferredIf(
+      le,
+      [](MaglevAssembler* masm, ZoneLabelRef done, Register left,
+         Register right, Int32DivideWithOverflow* node) {
+        // {right} is negative or zero.
+
+        // TODO(leszeks): Using kNotInt32 here, but in same places
+        // kDivisionByZerokMinusZero/kMinusZero/kOverflow would be better. Right
+        // now all eager deopts in a node have to be the same -- we should allow
+        // a node to emit multiple eager deopts with different reasons.
+        Label* deopt = __ GetDeoptLabel(node, DeoptimizeReason::kNotInt32);
+
+        // Check if {right} is zero.
+        // We've already done the compare and flags won't be cleared yet.
+        __ JumpIf(eq, deopt);
+
+        // Check if {left} is zero, as that would produce minus zero.
+        __ tst(left, left);
+        __ JumpIf(eq, deopt);
+
+        // Check if {left} is kMinInt and {right} is -1, in which case we'd have
+        // to return -kMinInt, which is not representable as Int32.
+        __ cmp(left, Operand(kMinInt));
+        __ JumpIf(ne, *done);
+        __ cmp(right, Operand(-1));
+        __ JumpIf(ne, *done);
+        __ JumpToDeopt(deopt);
+      },
+      done, left, right, this);
+  __ bind(*done);
+
+  // Perform the actual integer division.
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  bool out_alias_input = out == left || out == right;
+  Register res = out;
+  if (out_alias_input) {
+    res = temps.Acquire();
+  }
+  if (CpuFeatures::IsSupported(SUDIV)) {
+    CpuFeatureScope scope(masm, SUDIV);
+    __ sdiv(res, left, right);
+  } else {
+    UseScratchRegisterScope temps(masm);
+    LowDwVfpRegister double_right = temps.AcquireLowD();
+    SwVfpRegister tmp = double_right.low();
+    DwVfpRegister double_left = temps.AcquireD();
+    DwVfpRegister double_res = double_left;
+    __ vmov(tmp, left);
+    __ vcvt_f64_s32(double_left, tmp);
+    __ vmov(tmp, right);
+    __ vcvt_f64_s32(double_right, tmp);
+    __ vdiv(double_res, double_left, double_right);
+    __ vcvt_s32_f64(tmp, double_res);
+    __ vmov(res, tmp);
+  }
+
+  // Check that the remainder is zero.
+  Register temp = temps.Acquire();
+  __ mul(temp, res, right);
+  __ cmp(temp, left);
+  __ EmitEagerDeoptIf(ne, DeoptimizeReason::kNotInt32, this);
+
+  __ Move(out, res);
+}
+
+namespace {
+void Uint32Mod(MaglevAssembler* masm, Register out, Register left,
+               Register right) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register res = temps.Acquire();
+  if (CpuFeatures::IsSupported(SUDIV)) {
+    CpuFeatureScope scope(masm, SUDIV);
+    __ udiv(res, left, right);
+  } else {
+    UseScratchRegisterScope temps(masm);
+    LowDwVfpRegister double_right = temps.AcquireLowD();
+    SwVfpRegister tmp = double_right.low();
+    DwVfpRegister double_left = temps.AcquireD();
+    DwVfpRegister double_res = double_left;
+    __ vmov(tmp, left);
+    __ vcvt_f64_s32(double_left, tmp);
+    __ vmov(tmp, right);
+    __ vcvt_f64_s32(double_right, tmp);
+    __ vdiv(double_res, double_left, double_right);
+    __ vcvt_s32_f64(tmp, double_res);
+    __ vmov(res, tmp);
+  }
+  if (CpuFeatures::IsSupported(ARMv7)) {
+    __ mls(out, res, right, left);
+  } else {
+    __ mul(res, res, right);
+    __ sub(out, left, res);
+  }
+}
+}  // namespace
+
+void Int32ModulusWithOverflow::SetValueLocationConstraints() {
+  UseAndClobberRegister(left_input());
+  UseAndClobberRegister(right_input());
+  DefineAsRegister(this);
+  if (!CpuFeatures::IsSupported(SUDIV)) {
+    // We use the standard low double register and an extra one.
+    set_double_temporaries_needed(1);
+  }
+}
+void Int32ModulusWithOverflow::GenerateCode(MaglevAssembler* masm,
+                                            const ProcessingState& state) {
+  // If AreAliased(lhs, rhs):
+  //   deopt if lhs < 0  // Minus zero.
+  //   0
+  //
+  // Using same algorithm as in EffectControlLinearizer:
+  //   if rhs <= 0 then
+  //     rhs = -rhs
+  //     deopt if rhs == 0
+  //   if lhs < 0 then
+  //     let lhs_abs = -lsh in
+  //     let res = lhs_abs % rhs in
+  //     deopt if res == 0
+  //     -res
+  //   else
+  //     let msk = rhs - 1 in
+  //     if rhs & msk == 0 then
+  //       lhs & msk
+  //     else
+  //       lhs % rhs
+
+  Register lhs = ToRegister(left_input());
+  Register rhs = ToRegister(right_input());
+  Register out = ToRegister(result());
+
+  static constexpr DeoptimizeReason deopt_reason =
+      DeoptimizeReason::kDivisionByZero;
+
+  if (lhs == rhs) {
+    // For the modulus algorithm described above, lhs and rhs must not alias
+    // each other.
+    __ tst(lhs, lhs);
+    // TODO(victorgomes): This ideally should be kMinusZero, but Maglev only
+    // allows one deopt reason per IR.
+    __ EmitEagerDeoptIf(mi, deopt_reason, this);
+    __ Move(ToRegister(result()), 0);
+    return;
+  }
+
+  DCHECK_NE(lhs, rhs);
+
+  ZoneLabelRef done(masm);
+  ZoneLabelRef rhs_checked(masm);
+  __ cmp(rhs, Operand(0));
+  __ JumpToDeferredIf(
+      le,
+      [](MaglevAssembler* masm, ZoneLabelRef rhs_checked, Register rhs,
+         Int32ModulusWithOverflow* node) {
+        __ rsb(rhs, rhs, Operand(0), SetCC);
+        __ b(ne, *rhs_checked);
+        __ EmitEagerDeopt(node, deopt_reason);
+      },
+      rhs_checked, rhs, this);
+  __ bind(*rhs_checked);
+
+  __ cmp(lhs, Operand(0));
+  __ JumpToDeferredIf(
+      lt,
+      [](MaglevAssembler* masm, ZoneLabelRef done, Register lhs, Register rhs,
+         Register out, Int32ModulusWithOverflow* node) {
+        __ rsb(lhs, lhs, Operand(0));
+        Uint32Mod(masm, out, lhs, rhs);
+        __ rsb(out, out, Operand(0), SetCC);
+        // TODO(victorgomes): This ideally should be kMinusZero, but Maglev
+        // only allows one deopt reason per IR.
+        __ b(ne, *done);
+        __ EmitEagerDeopt(node, deopt_reason);
+      },
+      done, lhs, rhs, out, this);
+
+  Label rhs_not_power_of_2;
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register mask = temps.Acquire();
+  __ add(mask, rhs, Operand(-1));
+  __ tst(mask, rhs);
+  __ JumpIf(ne, &rhs_not_power_of_2);
+
+  // {rhs} is power of 2.
+  __ and_(out, mask, lhs);
+  __ Jump(*done);
+  // {mask} can be reused from now on.
+  temps.Include(mask);
+
+  __ bind(&rhs_not_power_of_2);
+  Uint32Mod(masm, out, lhs, rhs);
+  __ bind(*done);
+}
+
+#define DEF_BITWISE_BINOP(Instruction, opcode)                   \
+  void Instruction::SetValueLocationConstraints() {              \
+    UseRegister(left_input());                                   \
+    UseRegister(right_input());                                  \
+    DefineAsRegister(this);                                      \
+  }                                                              \
+                                                                 \
+  void Instruction::GenerateCode(MaglevAssembler* masm,          \
+                                 const ProcessingState& state) { \
+    Register left = ToRegister(left_input());                    \
+    Register right = ToRegister(right_input());                  \
+    Register out = ToRegister(result());                         \
+    __ opcode(out, left, right);                                 \
+  }
+DEF_BITWISE_BINOP(Int32BitwiseAnd, and_)
+DEF_BITWISE_BINOP(Int32BitwiseOr, orr)
+DEF_BITWISE_BINOP(Int32BitwiseXor, eor)
+#undef DEF_BITWISE_BINOP
+
+#define DEF_SHIFT_BINOP(Instruction, opcode)                                   \
+  void Instruction::SetValueLocationConstraints() {                            \
+    UseRegister(left_input());                                                 \
+    if (right_input().node()->Is<Int32Constant>()) {                           \
+      UseAny(right_input());                                                   \
+    } else {                                                                   \
+      UseRegister(right_input());                                              \
+    }                                                                          \
+    DefineAsRegister(this);                                                    \
+  }                                                                            \
+  void Instruction::GenerateCode(MaglevAssembler* masm,                        \
+                                 const ProcessingState& state) {               \
+    Register left = ToRegister(left_input());                                  \
+    Register out = ToRegister(result());                                       \
+    if (Int32Constant* constant =                                              \
+            right_input().node()->TryCast<Int32Constant>()) {                  \
+      uint32_t shift = constant->value() & 31;                                 \
+      if (shift == 0) {                                                        \
+        /* TODO(victorgomes): Arm will do a shift of 32 if right == 0. Ideally \
+         * we should not even emit the shift in the first place. We do a move  \
+         * here for the moment. */                                             \
+        __ Move(out, left);                                                    \
+        return;                                                                \
+      }                                                                        \
+      __ opcode(out, left, Operand(shift));                                    \
+    } else {                                                                   \
+      MaglevAssembler::ScratchRegisterScope temps(masm);                       \
+      Register scratch = temps.Acquire();                                      \
+      Register right = ToRegister(right_input());                              \
+      __ and_(scratch, right, Operand(31));                                    \
+      __ opcode(out, left, Operand(scratch));                                  \
+    }                                                                          \
+  }
+DEF_SHIFT_BINOP(Int32ShiftLeft, lsl)
+DEF_SHIFT_BINOP(Int32ShiftRight, asr)
+DEF_SHIFT_BINOP(Int32ShiftRightLogical, lsr)
+#undef DEF_SHIFT_BINOP
+
+void Int32BitwiseNot::SetValueLocationConstraints() {
+  UseRegister(value_input());
+  DefineAsRegister(this);
+}
+
+void Int32BitwiseNot::GenerateCode(MaglevAssembler* masm,
+                                   const ProcessingState& state) {
+  Register value = ToRegister(value_input());
+  Register out = ToRegister(result());
+  __ mvn(out, Operand(value));
+}
+
+void Float64Add::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+}
+
+void Float64Add::GenerateCode(MaglevAssembler* masm,
+                              const ProcessingState& state) {
+  DoubleRegister left = ToDoubleRegister(left_input());
+  DoubleRegister right = ToDoubleRegister(right_input());
+  DoubleRegister out = ToDoubleRegister(result());
+  __ vadd(out, left, right);
+}
+
+void Float64Subtract::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+}
+
+void Float64Subtract::GenerateCode(MaglevAssembler* masm,
+                                   const ProcessingState& state) {
+  DoubleRegister left = ToDoubleRegister(left_input());
+  DoubleRegister right = ToDoubleRegister(right_input());
+  DoubleRegister out = ToDoubleRegister(result());
+  __ vsub(out, left, right);
+}
+
+void Float64Multiply::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+}
+
+void Float64Multiply::GenerateCode(MaglevAssembler* masm,
+                                   const ProcessingState& state) {
+  DoubleRegister left = ToDoubleRegister(left_input());
+  DoubleRegister right = ToDoubleRegister(right_input());
+  DoubleRegister out = ToDoubleRegister(result());
+  __ vmul(out, left, right);
+}
+
+void Float64Divide::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+}
+
+void Float64Divide::GenerateCode(MaglevAssembler* masm,
+                                 const ProcessingState& state) {
+  DoubleRegister left = ToDoubleRegister(left_input());
+  DoubleRegister right = ToDoubleRegister(right_input());
+  DoubleRegister out = ToDoubleRegister(result());
+  __ vdiv(out, left, right);
+}
+
+int Float64Modulus::MaxCallStackArgs() const { return 0; }
+void Float64Modulus::SetValueLocationConstraints() {
+  UseFixed(left_input(), d0);
+  UseFixed(right_input(), d1);
+  DefineAsRegister(this);
+}
+void Float64Modulus::GenerateCode(MaglevAssembler* masm,
+                                  const ProcessingState& state) {
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ PrepareCallCFunction(0, 2);
+  __ MovToFloatParameters(ToDoubleRegister(left_input()),
+                          ToDoubleRegister(right_input()));
+  __ CallCFunction(ExternalReference::mod_two_doubles_operation(), 0, 2);
+  // Move the result in the double result register.
+  __ MovFromFloatResult(ToDoubleRegister(result()));
+}
+
+void Float64Negate::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineAsRegister(this);
+}
+void Float64Negate::GenerateCode(MaglevAssembler* masm,
+                                 const ProcessingState& state) {
+  DoubleRegister value = ToDoubleRegister(input());
+  DoubleRegister out = ToDoubleRegister(result());
+  __ vneg(out, value);
+}
+
+void Float64Round::GenerateCode(MaglevAssembler* masm,
+                                const ProcessingState& state) {
+  DoubleRegister in = ToDoubleRegister(input());
+  DoubleRegister out = ToDoubleRegister(result());
+  CpuFeatureScope scope(masm, ARMv8);
+  if (kind_ == Kind::kNearest) {
+    MaglevAssembler::ScratchRegisterScope temps(masm);
+    DoubleRegister temp = temps.AcquireDouble();
+    DoubleRegister half_one = temps.AcquireDouble();
+    __ Move(temp, in);
+    // vrintn rounds to even on tie, while JS expects it to round towards
+    // +Infinity. Fix the difference by checking if we rounded down by exactly
+    // 0.5, and if so, round to the other side.
+    __ vrintn(out, in);
+    __ vsub(temp, temp, out);
+    __ Move(half_one, 0.5);
+    __ VFPCompareAndSetFlags(temp, half_one);
+    Label done;
+    __ JumpIf(ne, &done, Label::kNear);
+    // Fix wrong tie-to-even by adding 0.5 twice.
+    __ vadd(out, out, half_one);
+    __ vadd(out, out, half_one);
+    __ bind(&done);
+  } else if (kind_ == Kind::kCeil) {
+    __ vrintp(out, in);
+  } else if (kind_ == Kind::kFloor) {
+    __ vrintm(out, in);
+  }
+}
+
+int Float64Exponentiate::MaxCallStackArgs() const { return 0; }
+void Float64Exponentiate::SetValueLocationConstraints() {
+  UseFixed(left_input(), d0);
+  UseFixed(right_input(), d1);
+  DefineAsRegister(this);
+}
+void Float64Exponentiate::GenerateCode(MaglevAssembler* masm,
+                                       const ProcessingState& state) {
+  DoubleRegister left = ToDoubleRegister(left_input());
+  DoubleRegister right = ToDoubleRegister(right_input());
+  DoubleRegister out = ToDoubleRegister(result());
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ PrepareCallCFunction(0, 2);
+  __ MovToFloatParameters(left, right);
+  __ CallCFunction(ExternalReference::ieee754_pow_function(), 0, 2);
+  __ MovFromFloatResult(out);
+}
+
+int Float64Ieee754Unary::MaxCallStackArgs() const { return 0; }
+void Float64Ieee754Unary::SetValueLocationConstraints() {
+  UseFixed(input(), d0);
+  DefineAsRegister(this);
+}
+void Float64Ieee754Unary::GenerateCode(MaglevAssembler* masm,
+                                       const ProcessingState& state) {
+  DoubleRegister value = ToDoubleRegister(input());
+  DoubleRegister out = ToDoubleRegister(result());
+  FrameScope scope(masm, StackFrame::MANUAL);
+  __ PrepareCallCFunction(0, 1);
+  __ MovToFloatParameter(value);
+  __ CallCFunction(ieee_function_, 0, 1);
+  __ MovFromFloatResult(out);
+}
+
+void CheckJSTypedArrayBounds::SetValueLocationConstraints() {
+  UseRegister(receiver_input());
+  if (ElementsKindSize(elements_kind_) == 1) {
+    UseRegister(index_input());
+  } else {
+    UseAndClobberRegister(index_input());
+  }
+}
+void CheckJSTypedArrayBounds::GenerateCode(MaglevAssembler* masm,
+                                           const ProcessingState& state) {
+  Register object = ToRegister(receiver_input());
+  Register index = ToRegister(index_input());
+
+  if (v8_flags.debug_code) {
+    __ AssertNotSmi(object);
+    __ IsObjectType(object, JS_TYPED_ARRAY_TYPE);
+    __ Assert(eq, AbortReason::kUnexpectedValue);
+  }
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register byte_length = temps.Acquire();
+  __ LoadBoundedSizeFromObject(byte_length, object,
+                               JSTypedArray::kRawByteLengthOffset);
+  int element_size = ElementsKindSize(elements_kind_);
+  if (element_size > 1) {
+    DCHECK(element_size == 2 || element_size == 4 || element_size == 8);
+    __ mov(index,
+           Operand(index, LSL, base::bits::CountTrailingZeros(element_size)),
+           SetCC);
+    // MOVS does not affect the overflow flag on Arm. Since we know {index} is
+    // an unsigned integer, we check the carry flag.
+    __ EmitEagerDeoptIf(cs, DeoptimizeReason::kOutOfBounds, this);
+    __ cmp(byte_length, index);
+  } else {
+    __ cmp(byte_length, index);
+  }
+  // We use an unsigned comparison to handle negative indices as well.
+  __ EmitEagerDeoptIf(kUnsignedLessThanEqual, DeoptimizeReason::kOutOfBounds,
+                      this);
+}
+
+int CheckJSDataViewBounds::MaxCallStackArgs() const { return 1; }
+void CheckJSDataViewBounds::SetValueLocationConstraints() {
+  UseRegister(receiver_input());
+  UseRegister(index_input());
+  set_temporaries_needed(1);
+}
+void CheckJSDataViewBounds::GenerateCode(MaglevAssembler* masm,
+                                         const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register object = ToRegister(receiver_input());
+  Register index = ToRegister(index_input());
+  if (v8_flags.debug_code) {
+    __ AssertNotSmi(object);
+    __ IsObjectType(object, JS_DATA_VIEW_TYPE);
+    __ Assert(eq, AbortReason::kUnexpectedValue);
+  }
+
+  // Normal DataView (backed by AB / SAB) or non-length tracking backed by GSAB.
+  Register byte_length = temps.Acquire();
+  __ LoadBoundedSizeFromObject(byte_length, object,
+                               JSDataView::kRawByteLengthOffset);
+
+  int element_size = ExternalArrayElementSize(element_type_);
+  if (element_size > 1) {
+    __ sub(byte_length, byte_length, Operand(element_size - 1), SetCC);
+    __ EmitEagerDeoptIf(mi, DeoptimizeReason::kOutOfBounds, this);
+  }
+  __ cmp(index, byte_length);
+  __ EmitEagerDeoptIf(hs, DeoptimizeReason::kOutOfBounds, this);
+}
+
+void HoleyFloat64ToMaybeNanFloat64::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineAsRegister(this);
+}
+void HoleyFloat64ToMaybeNanFloat64::GenerateCode(MaglevAssembler* masm,
+                                                 const ProcessingState& state) {
+  // The hole value is a signalling NaN, so just silence it to get the float64
+  // value.
+  __ VFPCanonicalizeNaN(ToDoubleRegister(result()), ToDoubleRegister(input()));
+}
+
+namespace {
+
+enum class ReduceInterruptBudgetType { kLoop, kReturn };
+
+void HandleInterruptsAndTiering(MaglevAssembler* masm, ZoneLabelRef done,
+                                Node* node, ReduceInterruptBudgetType type,
+                                Register scratch0) {
+  // For loops, first check for interrupts. Don't do this for returns, as we
+  // can't lazy deopt to the end of a return.
+  if (type == ReduceInterruptBudgetType::kLoop) {
+    Label next;
+    // Here, we only care about interrupts since we've already guarded against
+    // real stack overflows on function entry.
+    {
+      Register stack_limit = scratch0;
+      __ LoadStackLimit(stack_limit, StackLimitKind::kInterruptStackLimit);
+      __ cmp(sp, stack_limit);
+      __ b(hi, &next);
+    }
+
+    // An interrupt has been requested and we must call into runtime to handle
+    // it; since we already pay the call cost, combine with the TieringManager
+    // call.
+    {
+      SaveRegisterStateForCall save_register_state(masm,
+                                                   node->register_snapshot());
+      Register function = scratch0;
+      __ ldr(function, MemOperand(fp, StandardFrameConstants::kFunctionOffset));
+      __ Push(function);
+      // Move into kContextRegister after the load into scratch0, just in case
+      // scratch0 happens to be kContextRegister.
+      __ Move(kContextRegister, masm->native_context().object());
+      __ CallRuntime(Runtime::kBytecodeBudgetInterruptWithStackCheck_Maglev, 1);
+      save_register_state.DefineSafepointWithLazyDeopt(node->lazy_deopt_info());
+    }
+    __ b(*done);  // All done, continue.
+    __ bind(&next);
+  }
+
+  // No pending interrupts. Call into the TieringManager if needed.
+  {
+    SaveRegisterStateForCall save_register_state(masm,
+                                                 node->register_snapshot());
+    Register function = scratch0;
+    __ ldr(function, MemOperand(fp, StandardFrameConstants::kFunctionOffset));
+    __ Push(function);
+    // Move into kContextRegister after the load into scratch0, just in case
+    // scratch0 happens to be kContextRegister.
+    __ Move(kContextRegister, masm->native_context().object());
+    // Note: must not cause a lazy deopt!
+    __ CallRuntime(Runtime::kBytecodeBudgetInterrupt_Maglev, 1);
+    save_register_state.DefineSafepoint();
+  }
+  __ b(*done);
+}
+
+void GenerateReduceInterruptBudget(MaglevAssembler* masm, Node* node,
+                                   ReduceInterruptBudgetType type, int amount) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+  Register feedback_cell = scratch;
+  Register budget = temps.Acquire();
+  __ ldr(feedback_cell,
+         MemOperand(fp, StandardFrameConstants::kFunctionOffset));
+  __ LoadTaggedField(
+      feedback_cell,
+      FieldMemOperand(feedback_cell, JSFunction::kFeedbackCellOffset));
+  __ ldr(budget,
+         FieldMemOperand(feedback_cell, FeedbackCell::kInterruptBudgetOffset));
+  __ sub(budget, budget, Operand(amount), SetCC);
+  __ str(budget,
+         FieldMemOperand(feedback_cell, FeedbackCell::kInterruptBudgetOffset));
+  ZoneLabelRef done(masm);
+  __ JumpToDeferredIf(lt, HandleInterruptsAndTiering, done, node, type,
+                      scratch);
+  __ bind(*done);
+}
+
+}  // namespace
+
+int ReduceInterruptBudgetForLoop::MaxCallStackArgs() const { return 1; }
+void ReduceInterruptBudgetForLoop::SetValueLocationConstraints() {
+  set_temporaries_needed(2);
+}
+void ReduceInterruptBudgetForLoop::GenerateCode(MaglevAssembler* masm,
+                                                const ProcessingState& state) {
+  GenerateReduceInterruptBudget(masm, this, ReduceInterruptBudgetType::kLoop,
+                                amount());
+}
+
+int ReduceInterruptBudgetForReturn::MaxCallStackArgs() const { return 1; }
+void ReduceInterruptBudgetForReturn::SetValueLocationConstraints() {
+  set_temporaries_needed(2);
+}
+void ReduceInterruptBudgetForReturn::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  GenerateReduceInterruptBudget(masm, this, ReduceInterruptBudgetType::kReturn,
+                                amount());
+}
+
+// ---
+// Control nodes
+// ---
+void Return::SetValueLocationConstraints() {
+  UseFixed(value_input(), kReturnRegister0);
+}
+void Return::GenerateCode(MaglevAssembler* masm, const ProcessingState& state) {
+  DCHECK_EQ(ToRegister(value_input()), kReturnRegister0);
+
+  // Read the formal number of parameters from the top level compilation unit
+  // (i.e. the outermost, non inlined function).
+  int formal_params_size =
+      masm->compilation_info()->toplevel_compilation_unit()->parameter_count();
+
+  // We're not going to continue execution, so we can use an arbitrary register
+  // here instead of relying on temporaries from the register allocator.
+  Register actual_params_size = r4;
+  Register params_size = r8;
+
+  // Compute the size of the actual parameters + receiver (in bytes).
+  // TODO(leszeks): Consider making this an input into Return to re-use the
+  // incoming argc's register (if it's still valid).
+  __ ldr(actual_params_size,
+         MemOperand(fp, StandardFrameConstants::kArgCOffset));
+
+  // Leave the frame.
+  __ LeaveFrame(StackFrame::MAGLEV);
+
+  // If actual is bigger than formal, then we should use it to free up the stack
+  // arguments.
+  Label corrected_args_count;
+  __ Move(params_size, formal_params_size);
+  __ cmp(params_size, actual_params_size);
+  __ b(kGreaterThanEqual, &corrected_args_count);
+  __ Move(params_size, actual_params_size);
+  __ bind(&corrected_args_count);
+
+  // Drop receiver + arguments according to dynamic arguments size.
+  __ DropArguments(params_size, MacroAssembler::kCountIsInteger,
+                   MacroAssembler::kCountIncludesReceiver);
+  __ Ret();
+}
+
+}  // namespace maglev
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/maglev/arm64/maglev-assembler-arm64-inl.h b/deps/v8/src/maglev/arm64/maglev-assembler-arm64-inl.h
index 4d7cec43586064..85610e84f0cc0e 100644
--- a/deps/v8/src/maglev/arm64/maglev-assembler-arm64-inl.h
+++ b/deps/v8/src/maglev/arm64/maglev-assembler-arm64-inl.h
@@ -7,33 +7,23 @@
 
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/codegen/macro-assembler-inl.h"
+#include "src/common/globals.h"
 #include "src/compiler/compilation-dependencies.h"
 #include "src/maglev/maglev-assembler.h"
 #include "src/maglev/maglev-basic-block.h"
 #include "src/maglev/maglev-code-gen-state.h"
+#include "src/maglev/maglev-ir.h"
 
 namespace v8 {
 namespace internal {
 namespace maglev {
 
-constexpr Condition ConditionFor(Operation operation) {
-  switch (operation) {
-    case Operation::kEqual:
-    case Operation::kStrictEqual:
-      return eq;
-    case Operation::kLessThan:
-      return lt;
-    case Operation::kLessThanOrEqual:
-      return le;
-    case Operation::kGreaterThan:
-      return gt;
-    case Operation::kGreaterThanOrEqual:
-      return ge;
-    default:
-      UNREACHABLE();
-  }
+constexpr Condition ConditionForFloat64(Operation operation) {
+  return ConditionFor(operation);
 }
 
+constexpr Condition ConditionForNaN() { return vs; }
+
 inline int ShiftFromScale(int n) {
   switch (n) {
     case 1:
@@ -42,6 +32,8 @@ inline int ShiftFromScale(int n) {
       return 1;
     case 4:
       return 2;
+    case 8:
+      return 3;
     default:
       UNREACHABLE();
   }
@@ -49,11 +41,23 @@ inline int ShiftFromScale(int n) {
 
 class MaglevAssembler::ScratchRegisterScope {
  public:
-  explicit ScratchRegisterScope(MaglevAssembler* masm) : wrapped_scope_(masm) {
-    // This field is never used in arm64.
-    DCHECK_NULL(masm->scratch_register_scope_);
+  explicit ScratchRegisterScope(MaglevAssembler* masm)
+      : wrapped_scope_(masm),
+        masm_(masm),
+        prev_scope_(masm->scratch_register_scope_) {
+    masm_->scratch_register_scope_ = this;
   }
 
+  ~ScratchRegisterScope() { masm_->scratch_register_scope_ = prev_scope_; }
+
+  void ResetToDefault() {
+    wrapped_scope_.SetAvailable(masm_->DefaultTmpList());
+    wrapped_scope_.SetAvailableFP(masm_->DefaultFPTmpList());
+  }
+
+  Register GetDefaultScratchRegister() { return Acquire(); }
+  DoubleRegister GetDefaultScratchDoubleRegister() { return AcquireDouble(); }
+
   Register Acquire() { return wrapped_scope_.AcquireX(); }
   void Include(Register reg) { wrapped_scope_.Include(reg); }
   void Include(const RegList list) {
@@ -84,10 +88,64 @@ class MaglevAssembler::ScratchRegisterScope {
 
  private:
   UseScratchRegisterScope wrapped_scope_;
+  MaglevAssembler* masm_;
+  ScratchRegisterScope* prev_scope_;
 };
 
+inline MapCompare::MapCompare(MaglevAssembler* masm, Register object,
+                              size_t map_count)
+    : masm_(masm), object_(object), map_count_(map_count) {
+  map_ = masm_->scratch_register_scope()->Acquire();
+  if (PointerCompressionIsEnabled()) {
+    masm_->LoadCompressedMap(map_, object_);
+  } else {
+    masm_->LoadMap(map_, object_);
+  }
+  USE(map_count_);
+}
+
+void MapCompare::Generate(Handle<Map> map) {
+  MaglevAssembler::ScratchRegisterScope temps(masm_);
+  Register temp = temps.Acquire();
+  masm_->Move(temp, map);
+  masm_->CmpTagged(map_, temp);
+}
+
+Register MapCompare::GetMap() {
+  if (PointerCompressionIsEnabled()) {
+    // Decompression is idempotent (UXTW operand is used), so this would return
+    // a valid pointer even if called multiple times in a row.
+    masm_->DecompressTagged(map_, map_);
+  }
+  return map_;
+}
+
+int MapCompare::TemporaryCount(size_t map_count) { return 1; }
+
 namespace detail {
 
+// Check if the argument is already in a register and doesn't need any
+// scratches to reload. This should be in sync with `ToRegister` function below.
+template <typename Arg>
+inline bool AlreadyInARegister(Arg arg) {
+  return false;
+}
+
+inline bool AlreadyInARegister(Register reg) { return true; }
+
+inline bool AlreadyInARegister(const Input& input) {
+  if (input.operand().IsConstant()) {
+    return false;
+  }
+  const compiler::AllocatedOperand& operand =
+      compiler::AllocatedOperand::cast(input.operand());
+  if (operand.IsRegister()) {
+    return true;
+  }
+  DCHECK(operand.IsStackSlot());
+  return false;
+}
+
 template <typename Arg>
 inline Register ToRegister(MaglevAssembler* masm,
                            MaglevAssembler::ScratchRegisterScope* scratch,
@@ -202,6 +260,14 @@ inline void PushIteratorReverse(MaglevAssembler* masm,
 
 template <typename Arg1, typename Arg2>
 inline void PushAligned(MaglevAssembler* masm, Arg1 arg1, Arg2 arg2) {
+  if (AlreadyInARegister(arg1) || AlreadyInARegister(arg2)) {
+    // If one of the operands is already in a register, there is no need
+    // to reuse scratch registers, so two arguments can be pushed together.
+    MaglevAssembler::ScratchRegisterScope temps(masm);
+    masm->MacroAssembler::Push(ToRegister(masm, &temps, arg1),
+                               ToRegister(masm, &temps, arg2));
+    return;
+  }
   {
     // Push the first argument together with padding to ensure alignment.
     // The second argument is not pushed together with the first so we can
@@ -305,23 +371,25 @@ inline void MaglevAssembler::BindBlock(BasicBlock* block) {
   }
 }
 
-inline void MaglevAssembler::DoubleToInt64Repr(Register dst,
-                                               DoubleRegister src) {
-  Mov(dst, src, 0);
+inline void MaglevAssembler::SmiTagInt32AndSetFlags(Register dst,
+                                                    Register src) {
+  if (SmiValuesAre31Bits()) {
+    Adds(dst.W(), src.W(), src.W());
+  } else {
+    SmiTag(dst, src);
+  }
 }
 
-inline void MaglevAssembler::SmiTagInt32(Register obj, Label* fail) {
-  Adds(obj.W(), obj.W(), obj.W());
-  JumpIf(vs, fail);
+inline void MaglevAssembler::CheckInt32IsSmi(Register obj, Label* fail,
+                                             Register scratch) {
+  DCHECK(!SmiValuesAre32Bits());
+
+  Adds(wzr, obj.W(), obj.W());
+  JumpIf(kOverflow, fail);
 }
 
-inline Condition MaglevAssembler::IsInt64Constant(Register reg,
-                                                  int64_t constant) {
-  ScratchRegisterScope temps(this);
-  Register scratch = temps.Acquire();
-  Mov(scratch, kHoleNanInt64);
-  Cmp(reg, scratch);
-  return eq;
+inline void MaglevAssembler::MoveHeapNumber(Register dst, double value) {
+  Mov(dst, Operand::EmbeddedHeapNumber(value));
 }
 
 inline Condition MaglevAssembler::IsRootConstant(Input input,
@@ -366,19 +434,31 @@ inline void MaglevAssembler::BuildTypedArrayDataPointer(Register data_pointer,
   if (JSTypedArray::kMaxSizeInHeap == 0) return;
   ScratchRegisterScope scope(this);
   Register base = scope.Acquire();
-  Ldr(base.W(), FieldMemOperand(object, JSTypedArray::kBasePointerOffset));
+  if (COMPRESS_POINTERS_BOOL) {
+    Ldr(base.W(), FieldMemOperand(object, JSTypedArray::kBasePointerOffset));
+  } else {
+    Ldr(base, FieldMemOperand(object, JSTypedArray::kBasePointerOffset));
+  }
   Add(data_pointer, data_pointer, base);
 }
 
+inline MemOperand MaglevAssembler::TypedArrayElementOperand(
+    Register data_pointer, Register index, int element_size) {
+  Add(data_pointer, data_pointer,
+      Operand(index, LSL, ShiftFromScale(element_size)));
+  return MemOperand(data_pointer);
+}
+
+inline MemOperand MaglevAssembler::DataViewElementOperand(Register data_pointer,
+                                                          Register index) {
+  return MemOperand(data_pointer, index);
+}
+
 inline void MaglevAssembler::LoadTaggedFieldByIndex(Register result,
                                                     Register object,
                                                     Register index, int scale,
                                                     int offset) {
-  if (scale == 1) {
-    Add(result, object, index);
-  } else {
-    Add(result, object, Operand(index, LSL, ShiftFromScale(scale / 2)));
-  }
+  Add(result, object, Operand(index, LSL, ShiftFromScale(scale)));
   MacroAssembler::LoadTaggedField(result, FieldMemOperand(result, offset));
 }
 
@@ -400,6 +480,57 @@ inline void MaglevAssembler::LoadExternalPointerField(Register result,
 #endif
 }
 
+void MaglevAssembler::LoadFixedArrayElement(Register result, Register array,
+                                            Register index) {
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  LoadTaggedFieldByIndex(result, array, index, kTaggedSize,
+                         FixedArray::kHeaderSize);
+}
+
+void MaglevAssembler::LoadFixedArrayElementWithoutDecompressing(
+    Register result, Register array, Register index) {
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  Add(result, array, Operand(index, LSL, kTaggedSizeLog2));
+  MacroAssembler::LoadTaggedFieldWithoutDecompressing(
+      result, FieldMemOperand(result, FixedArray::kHeaderSize));
+}
+
+void MaglevAssembler::LoadFixedDoubleArrayElement(DoubleRegister result,
+                                                  Register array,
+                                                  Register index) {
+  MaglevAssembler::ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_DOUBLE_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  Add(scratch, array, Operand(index, LSL, kDoubleSizeLog2));
+  Ldr(result, FieldMemOperand(scratch, FixedArray::kHeaderSize));
+}
+
+inline void MaglevAssembler::StoreFixedDoubleArrayElement(
+    Register array, Register index, DoubleRegister value) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  Add(scratch, array, Operand(index, LSL, kDoubleSizeLog2));
+  Str(value, FieldMemOperand(scratch, FixedArray::kHeaderSize));
+}
+
 inline void MaglevAssembler::LoadSignedField(Register result,
                                              MemOperand operand, int size) {
   if (size == 1) {
@@ -408,55 +539,91 @@ inline void MaglevAssembler::LoadSignedField(Register result,
     Ldrsh(result, operand);
   } else {
     DCHECK_EQ(size, 4);
-    DCHECK(result.IsW());
-    Ldr(result, operand);
+    Ldr(result.W(), operand);
   }
 }
 
 inline void MaglevAssembler::LoadUnsignedField(Register result,
                                                MemOperand operand, int size) {
   if (size == 1) {
-    Ldrb(result, operand);
+    Ldrb(result.W(), operand);
   } else if (size == 2) {
-    Ldrh(result, operand);
+    Ldrh(result.W(), operand);
   } else {
     DCHECK_EQ(size, 4);
-    DCHECK(result.IsW());
-    Ldr(result, operand);
+    Ldr(result.W(), operand);
   }
 }
 
+inline void MaglevAssembler::SetSlotAddressForTaggedField(Register slot_reg,
+                                                          Register object,
+                                                          int offset) {
+  Add(slot_reg, object, offset - kHeapObjectTag);
+}
+inline void MaglevAssembler::SetSlotAddressForFixedArrayElement(
+    Register slot_reg, Register object, Register index) {
+  Add(slot_reg, object, FixedArray::kHeaderSize - kHeapObjectTag);
+  Add(slot_reg, slot_reg, Operand(index, LSL, kTaggedSizeLog2));
+}
+
+inline void MaglevAssembler::StoreTaggedFieldNoWriteBarrier(Register object,
+                                                            int offset,
+                                                            Register value) {
+  MacroAssembler::StoreTaggedField(value, FieldMemOperand(object, offset));
+}
+
+inline void MaglevAssembler::StoreFixedArrayElementNoWriteBarrier(
+    Register array, Register index, Register value) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  Add(scratch, array, Operand(index, LSL, kTaggedSizeLog2));
+  MacroAssembler::StoreTaggedField(
+      value, FieldMemOperand(scratch, FixedArray::kHeaderSize));
+}
+
 inline void MaglevAssembler::StoreTaggedSignedField(Register object, int offset,
                                                     Register value) {
   AssertSmi(value);
-  StoreTaggedField(value, FieldMemOperand(object, offset));
+  MacroAssembler::StoreTaggedField(value, FieldMemOperand(object, offset));
 }
 
 inline void MaglevAssembler::StoreTaggedSignedField(Register object, int offset,
-                                                    Smi value) {
+                                                    Tagged<Smi> value) {
   ScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
   Mov(scratch, value);
-  StoreTaggedField(scratch, FieldMemOperand(object, offset));
+  MacroAssembler::StoreTaggedField(scratch, FieldMemOperand(object, offset));
+}
+
+inline void MaglevAssembler::StoreInt32Field(Register object, int offset,
+                                             int32_t value) {
+  if (value == 0) {
+    Str(wzr, FieldMemOperand(object, offset));
+    return;
+  }
+  ScratchRegisterScope scope(this);
+  Register scratch = scope.Acquire().W();
+  Move(scratch, value);
+  Str(scratch, FieldMemOperand(object, offset));
 }
 
 inline void MaglevAssembler::StoreField(MemOperand operand, Register value,
                                         int size) {
   DCHECK(size == 1 || size == 2 || size == 4);
   if (size == 1) {
-    Strb(value, operand);
+    Strb(value.W(), operand);
   } else if (size == 2) {
-    Strh(value, operand);
+    Strh(value.W(), operand);
   } else {
     DCHECK_EQ(size, 4);
-    DCHECK(value.IsW());
-    Str(value, operand);
+    Str(value.W(), operand);
   }
 }
 
 inline void MaglevAssembler::ReverseByteOrder(Register value, int size) {
   if (size == 2) {
     Rev16(value, value);
+    Sxth(value, value);
   } else if (size == 4) {
     Rev32(value, value);
   } else {
@@ -464,6 +631,10 @@ inline void MaglevAssembler::ReverseByteOrder(Register value, int size) {
   }
 }
 
+inline void MaglevAssembler::IncrementInt32(Register reg) {
+  Add(reg.W(), reg.W(), Immediate(1));
+}
+
 inline void MaglevAssembler::Move(StackSlot dst, Register src) {
   Str(src, StackSlotOperand(dst));
 }
@@ -479,19 +650,13 @@ inline void MaglevAssembler::Move(DoubleRegister dst, StackSlot src) {
 inline void MaglevAssembler::Move(MemOperand dst, Register src) {
   Str(src, dst);
 }
-inline void MaglevAssembler::Move(MemOperand dst, DoubleRegister src) {
-  Str(src, dst);
-}
 inline void MaglevAssembler::Move(Register dst, MemOperand src) {
   Ldr(dst, src);
 }
-inline void MaglevAssembler::Move(DoubleRegister dst, MemOperand src) {
-  Ldr(dst, src);
-}
 inline void MaglevAssembler::Move(DoubleRegister dst, DoubleRegister src) {
   Fmov(dst, src);
 }
-inline void MaglevAssembler::Move(Register dst, Smi src) {
+inline void MaglevAssembler::Move(Register dst, Tagged<Smi> src) {
   MacroAssembler::Move(dst, src);
 }
 inline void MaglevAssembler::Move(Register dst, ExternalReference src) {
@@ -500,7 +665,7 @@ inline void MaglevAssembler::Move(Register dst, ExternalReference src) {
 inline void MaglevAssembler::Move(Register dst, Register src) {
   MacroAssembler::Move(dst, src);
 }
-inline void MaglevAssembler::Move(Register dst, TaggedIndex i) {
+inline void MaglevAssembler::Move(Register dst, Tagged<TaggedIndex> i) {
   Mov(dst, i.ptr());
 }
 inline void MaglevAssembler::Move(Register dst, int32_t i) {
@@ -516,6 +681,50 @@ inline void MaglevAssembler::Move(Register dst, Handle<HeapObject> obj) {
   Mov(dst, Operand(obj));
 }
 
+inline void MaglevAssembler::LoadFloat32(DoubleRegister dst, MemOperand src) {
+  Ldr(dst.S(), src);
+  Fcvt(dst, dst.S());
+}
+inline void MaglevAssembler::StoreFloat32(MemOperand dst, DoubleRegister src) {
+  ScratchRegisterScope temps(this);
+  DoubleRegister scratch = temps.AcquireDouble();
+  Fcvt(scratch.S(), src);
+  Str(scratch.S(), dst);
+}
+inline void MaglevAssembler::LoadFloat64(DoubleRegister dst, MemOperand src) {
+  Ldr(dst, src);
+}
+inline void MaglevAssembler::StoreFloat64(MemOperand dst, DoubleRegister src) {
+  Str(src, dst);
+}
+
+inline void MaglevAssembler::LoadUnalignedFloat64(DoubleRegister dst,
+                                                  Register base,
+                                                  Register index) {
+  LoadFloat64(dst, MemOperand(base, index));
+}
+inline void MaglevAssembler::LoadUnalignedFloat64AndReverseByteOrder(
+    DoubleRegister dst, Register base, Register index) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  Ldr(scratch, MemOperand(base, index));
+  Rev(scratch, scratch);
+  Fmov(dst, scratch);
+}
+inline void MaglevAssembler::StoreUnalignedFloat64(Register base,
+                                                   Register index,
+                                                   DoubleRegister src) {
+  StoreFloat64(MemOperand(base, index), src);
+}
+inline void MaglevAssembler::ReverseByteOrderAndStoreUnalignedFloat64(
+    Register base, Register index, DoubleRegister src) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.Acquire();
+  Fmov(scratch, src);
+  Rev(scratch, scratch);
+  Str(scratch, MemOperand(base, index));
+}
+
 inline void MaglevAssembler::SignExtend32To64Bits(Register dst, Register src) {
   Mov(dst, Operand(src.W(), SXTW));
 }
@@ -565,6 +774,30 @@ inline void MaglevAssembler::LoadByte(Register dst, MemOperand src) {
   Ldrb(dst, src);
 }
 
+inline Condition MaglevAssembler::IsCallableAndNotUndetectable(
+    Register map, Register scratch) {
+  Ldr(scratch.W(), FieldMemOperand(map, Map::kBitFieldOffset));
+  And(scratch.W(), scratch.W(),
+      Map::Bits1::IsUndetectableBit::kMask | Map::Bits1::IsCallableBit::kMask);
+  Cmp(scratch.W(), Map::Bits1::IsCallableBit::kMask);
+  return kEqual;
+}
+
+inline Condition MaglevAssembler::IsNotCallableNorUndetactable(
+    Register map, Register scratch) {
+  Ldr(scratch.W(), FieldMemOperand(map, Map::kBitFieldOffset));
+  Tst(scratch.W(), Immediate(Map::Bits1::IsUndetectableBit::kMask |
+                             Map::Bits1::IsCallableBit::kMask));
+  return kEqual;
+}
+
+inline void MaglevAssembler::LoadInstanceType(Register instance_type,
+                                              Register heap_object) {
+  LoadMap(instance_type, heap_object);
+  Ldrh(instance_type.W(),
+       FieldMemOperand(instance_type, Map::kInstanceTypeOffset));
+}
+
 inline void MaglevAssembler::IsObjectType(Register heap_object,
                                           InstanceType type) {
   ScratchRegisterScope temps(this);
@@ -591,7 +824,7 @@ inline void MaglevAssembler::CompareObjectType(Register heap_object,
                                                InstanceType type,
                                                Register scratch) {
   LoadMap(scratch, heap_object);
-  CompareInstanceType(scratch, scratch, type);
+  MacroAssembler::CompareInstanceType(scratch, scratch, type);
 }
 
 inline void MaglevAssembler::CompareObjectTypeRange(Register heap_object,
@@ -599,6 +832,13 @@ inline void MaglevAssembler::CompareObjectTypeRange(Register heap_object,
                                                     InstanceType higher_limit) {
   ScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
+  CompareObjectTypeRange(heap_object, scratch, lower_limit, higher_limit);
+}
+
+inline void MaglevAssembler::CompareObjectTypeRange(Register heap_object,
+                                                    Register scratch,
+                                                    InstanceType lower_limit,
+                                                    InstanceType higher_limit) {
   LoadMap(scratch, heap_object);
   CompareInstanceTypeRange(scratch, scratch, lower_limit, higher_limit);
 }
@@ -607,7 +847,7 @@ inline void MaglevAssembler::CompareMapWithRoot(Register object,
                                                 RootIndex index,
                                                 Register scratch) {
   if (V8_STATIC_ROOTS_BOOL && RootsTable::IsReadOnly(index)) {
-    Ldr(scratch.W(), FieldMemOperand(object, HeapObject::kMapOffset));
+    LoadCompressedMap(scratch, object);
     CmpTagged(scratch, Immediate(ReadOnlyRootPtr(index)));
     return;
   }
@@ -615,11 +855,11 @@ inline void MaglevAssembler::CompareMapWithRoot(Register object,
   CompareRoot(scratch, index);
 }
 
-inline void MaglevAssembler::CompareInstanceTypeRange(
-    Register map, InstanceType lower_limit, InstanceType higher_limit) {
+inline void MaglevAssembler::CompareInstanceType(Register map,
+                                                 InstanceType instance_type) {
   ScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
-  CompareInstanceTypeRange(map, scratch, lower_limit, higher_limit);
+  MacroAssembler::CompareInstanceType(map, scratch, instance_type);
 }
 
 inline void MaglevAssembler::CompareInstanceTypeRange(
@@ -629,9 +869,15 @@ inline void MaglevAssembler::CompareInstanceTypeRange(
                                            higher_limit);
 }
 
+inline void MaglevAssembler::CompareTagged(Register reg, Tagged<Smi> smi) {
+  CmpTagged(reg, Immediate(smi));
+}
+
 inline void MaglevAssembler::CompareTagged(Register reg,
                                            Handle<HeapObject> obj) {
-  CmpTagged(reg, Operand(obj, RelocInfo::COMPRESSED_EMBEDDED_OBJECT));
+  CmpTagged(reg, Operand(obj, COMPRESS_POINTERS_BOOL
+                                  ? RelocInfo::COMPRESSED_EMBEDDED_OBJECT
+                                  : RelocInfo::FULL_EMBEDDED_OBJECT));
 }
 
 inline void MaglevAssembler::CompareTagged(Register src1, Register src2) {
@@ -646,12 +892,38 @@ inline void MaglevAssembler::CompareInt32(Register src1, Register src2) {
   Cmp(src1.W(), src2.W());
 }
 
+inline void MaglevAssembler::CompareFloat64(DoubleRegister src1,
+                                            DoubleRegister src2) {
+  Fcmp(src1, src2);
+}
+
+inline void MaglevAssembler::PrepareCallCFunction(int num_reg_arguments,
+                                                  int num_double_registers) {}
+
 inline void MaglevAssembler::CallSelf() {
+  DCHECK(allow_call());
   DCHECK(code_gen_state()->entry_label()->is_bound());
   Bl(code_gen_state()->entry_label());
 }
 
-inline void MaglevAssembler::Jump(Label* target, Label::Distance) { B(target); }
+inline void MaglevAssembler::Jump(Label* target, Label::Distance) {
+  // Any eager deopts should go through JumpIf to enable us to support the
+  // `--deopt-every-n-times` stress mode. See EmitEagerDeoptStress.
+  DCHECK(!IsDeoptLabel(target));
+  B(target);
+}
+
+inline void MaglevAssembler::JumpToDeopt(Label* target) {
+  DCHECK(IsDeoptLabel(target));
+  B(target);
+}
+
+inline void MaglevAssembler::EmitEagerDeoptStress(Label* target) {
+  // TODO(olivf): On arm `--deopt-every-n-times` is currently not supported.
+  // Supporting it would require to implement this method, additionally handle
+  // deopt branches in Cbz, and handle all cases where we fall through to the
+  // deopt branch (like Int32Divide).
+}
 
 inline void MaglevAssembler::JumpIf(Condition cond, Label* target,
                                     Label::Distance) {
@@ -675,11 +947,49 @@ inline void MaglevAssembler::JumpIfSmi(Register src, Label* on_smi,
   MacroAssembler::JumpIfSmi(src, on_smi);
 }
 
+inline void MaglevAssembler::JumpIfNotSmi(Register src, Label* on_smi,
+                                          Label::Distance distance) {
+  MacroAssembler::JumpIfNotSmi(src, on_smi);
+}
+
 void MaglevAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
                                  Label* target, Label::Distance) {
   CompareAndBranch(value, Immediate(byte), cc, target);
 }
 
+void MaglevAssembler::JumpIfHoleNan(DoubleRegister value, Register scratch,
+                                    Label* target, Label::Distance distance) {
+  MaglevAssembler::ScratchRegisterScope temps(this);
+  Register repr = temps.Acquire();
+  Mov(repr, value, 0);
+  Mov(scratch, kHoleNanInt64);
+  Cmp(repr, scratch);
+  JumpIf(kEqual, target, distance);
+}
+
+void MaglevAssembler::JumpIfNotHoleNan(DoubleRegister value, Register scratch,
+                                       Label* target,
+                                       Label::Distance distance) {
+  MaglevAssembler::ScratchRegisterScope temps(this);
+  Register repr = temps.Acquire();
+  Mov(repr, value, 0);
+  Mov(scratch, kHoleNanInt64);
+  Cmp(repr, scratch);
+  JumpIf(kNotEqual, target, distance);
+}
+
+void MaglevAssembler::JumpIfNotHoleNan(MemOperand operand, Label* target,
+                                       Label::Distance distance) {
+  MaglevAssembler::ScratchRegisterScope temps(this);
+  Register repr = temps.Acquire();
+  Ldr(repr, operand);
+  // Acquire {scratch} after Ldr, since this might need a scratch register.
+  Register scratch = temps.Acquire();
+  Mov(scratch, kHoleNanInt64);
+  Cmp(repr, scratch);
+  JumpIf(kNotEqual, target, distance);
+}
+
 inline void MaglevAssembler::CompareInt32AndJumpIf(Register r1, Register r2,
                                                    Condition cond,
                                                    Label* target,
@@ -694,11 +1004,43 @@ inline void MaglevAssembler::CompareInt32AndJumpIf(Register r1, int32_t value,
   CompareAndBranch(r1.W(), Immediate(value), cond, target);
 }
 
-inline void MaglevAssembler::CompareSmiAndJumpIf(Register r1, Smi value,
+inline void MaglevAssembler::CompareSmiAndJumpIf(Register r1, Tagged<Smi> value,
                                                  Condition cond, Label* target,
                                                  Label::Distance distance) {
   AssertSmi(r1);
-  CompareAndBranch(r1, Immediate(value), cond, target);
+  CompareTaggedAndBranch(r1, Immediate(value), cond, target);
+}
+
+inline void MaglevAssembler::CompareByteAndJumpIf(MemOperand left, int8_t right,
+                                                  Condition cond,
+                                                  Register scratch,
+                                                  Label* target,
+                                                  Label::Distance distance) {
+  LoadByte(scratch.W(), left);
+  CompareAndBranch(scratch.W(), Immediate(right), cond, target);
+}
+
+inline void MaglevAssembler::CompareTaggedAndJumpIf(Register r1,
+                                                    Tagged<Smi> value,
+                                                    Condition cond,
+                                                    Label* target,
+                                                    Label::Distance distance) {
+  CompareTaggedAndBranch(r1, Immediate(value), cond, target);
+}
+
+inline void MaglevAssembler::CompareDoubleAndJumpIfZeroOrNaN(
+    DoubleRegister reg, Label* target, Label::Distance distance) {
+  Fcmp(reg, 0.0);
+  JumpIf(eq, target);
+  JumpIf(vs, target);  // NaN check
+}
+
+inline void MaglevAssembler::CompareDoubleAndJumpIfZeroOrNaN(
+    MemOperand operand, Label* target, Label::Distance distance) {
+  ScratchRegisterScope temps(this);
+  DoubleRegister value_double = temps.AcquireDouble();
+  Ldr(value_double, operand);
+  CompareDoubleAndJumpIfZeroOrNaN(value_double, target, distance);
 }
 
 inline void MaglevAssembler::TestInt32AndJumpIfAnySet(
@@ -706,18 +1048,40 @@ inline void MaglevAssembler::TestInt32AndJumpIfAnySet(
   TestAndBranchIfAnySet(r1.W(), mask, target);
 }
 
+inline void MaglevAssembler::TestInt32AndJumpIfAnySet(
+    MemOperand operand, int32_t mask, Label* target, Label::Distance distance) {
+  ScratchRegisterScope temps(this);
+  Register value = temps.Acquire().W();
+  Ldr(value, operand);
+  TestAndBranchIfAnySet(value, mask, target);
+}
+
 inline void MaglevAssembler::TestInt32AndJumpIfAllClear(
     Register r1, int32_t mask, Label* target, Label::Distance distance) {
   TestAndBranchIfAllClear(r1.W(), mask, target);
 }
 
+inline void MaglevAssembler::TestInt32AndJumpIfAllClear(
+    MemOperand operand, int32_t mask, Label* target, Label::Distance distance) {
+  ScratchRegisterScope temps(this);
+  Register value = temps.Acquire().W();
+  Ldr(value, operand);
+  TestAndBranchIfAllClear(value, mask, target);
+}
+
 inline void MaglevAssembler::LoadHeapNumberValue(DoubleRegister result,
                                                  Register heap_number) {
   Ldr(result, FieldMemOperand(heap_number, HeapNumber::kValueOffset));
 }
 
-inline void MaglevAssembler::Int32ToDouble(DoubleRegister result, Register n) {
-  Scvtf(result, n.W());
+inline void MaglevAssembler::Int32ToDouble(DoubleRegister result,
+                                           Register src) {
+  Scvtf(result, src.W());
+}
+
+inline void MaglevAssembler::Uint32ToDouble(DoubleRegister result,
+                                            Register src) {
+  Ucvtf(result, src.W());
 }
 
 inline void MaglevAssembler::Pop(Register dst) { Pop(dst, padreg); }
@@ -735,6 +1099,20 @@ inline void MaglevAssembler::AssertStackSizeCorrect() {
   }
 }
 
+inline Condition MaglevAssembler::FunctionEntryStackCheck(
+    int stack_check_offset) {
+  ScratchRegisterScope temps(this);
+  Register stack_cmp_reg = sp;
+  if (stack_check_offset > kStackLimitSlackForDeoptimizationInBytes) {
+    stack_cmp_reg = temps.Acquire();
+    Sub(stack_cmp_reg, sp, stack_check_offset);
+  }
+  Register interrupt_stack_limit = temps.Acquire();
+  LoadStackLimit(interrupt_stack_limit, StackLimitKind::kInterruptStackLimit);
+  Cmp(stack_cmp_reg, interrupt_stack_limit);
+  return kUnsignedGreaterThanEqual;
+}
+
 inline void MaglevAssembler::FinishCode() {
   ForceConstantPoolEmissionWithoutJump();
 }
@@ -745,76 +1123,6 @@ inline void MaglevAssembler::EmitEagerDeoptIfNotEqual(DeoptimizeReason reason,
   EmitEagerDeoptIf(ne, reason, node);
 }
 
-inline void MaglevAssembler::MaterialiseValueNode(Register dst,
-                                                  ValueNode* value) {
-  switch (value->opcode()) {
-    case Opcode::kInt32Constant: {
-      int32_t int_value = value->Cast<Int32Constant>()->value();
-      if (Smi::IsValid(int_value)) {
-        Move(dst, Smi::FromInt(int_value));
-      } else {
-        MoveHeapNumber(dst, int_value);
-      }
-      return;
-    }
-    case Opcode::kFloat64Constant: {
-      double double_value =
-          value->Cast<Float64Constant>()->value().get_scalar();
-      MoveHeapNumber(dst, double_value);
-      return;
-    }
-    default:
-      break;
-  }
-
-  DCHECK(!value->allocation().IsConstant());
-  DCHECK(value->allocation().IsAnyStackSlot());
-  using D = NewHeapNumberDescriptor;
-  MemOperand src = ToMemOperand(value->allocation());
-  switch (value->properties().value_representation()) {
-    case ValueRepresentation::kInt32: {
-      Label done;
-      ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      Ldr(scratch.W(), src);
-      Adds(dst.W(), scratch.W(), scratch.W());
-      B(&done, vc);
-      // If we overflow, instead of bailing out (deopting), we change
-      // representation to a HeapNumber.
-      Scvtf(D::GetDoubleRegisterParameter(D::kValue), scratch);
-      CallBuiltin(Builtin::kNewHeapNumber);
-      Move(dst, kReturnRegister0);
-      bind(&done);
-      break;
-    }
-    case ValueRepresentation::kUint32: {
-      Label done, tag_smi;
-      Ldr(dst.W(), src);
-      // Unsigned comparison against Smi::kMaxValue.
-      Cmp(dst.W(), Immediate(Smi::kMaxValue));
-      B(&tag_smi, ls);
-      // If we don't fit in a Smi, instead of bailing out (deopting), we
-      // change representation to a HeapNumber.
-      Ucvtf(D::GetDoubleRegisterParameter(D::kValue), dst.W());
-      CallBuiltin(Builtin::kNewHeapNumber);
-      Move(dst, kReturnRegister0);
-      B(&done);
-      bind(&tag_smi);
-      SmiTag(dst);
-      bind(&done);
-      break;
-    }
-    case ValueRepresentation::kFloat64:
-      Ldr(D::GetDoubleRegisterParameter(D::kValue), src);
-      CallBuiltin(Builtin::kNewHeapNumber);
-      Move(dst, kReturnRegister0);
-      break;
-    case ValueRepresentation::kWord64:
-    case ValueRepresentation::kTagged:
-      UNREACHABLE();
-  }
-}
-
 template <>
 inline void MaglevAssembler::MoveRepr(MachineRepresentation repr, Register dst,
                                       Register src) {
diff --git a/deps/v8/src/maglev/arm64/maglev-assembler-arm64.cc b/deps/v8/src/maglev/arm64/maglev-assembler-arm64.cc
index a3814cfcfb3efe..416b87a4486410 100644
--- a/deps/v8/src/maglev/arm64/maglev-assembler-arm64.cc
+++ b/deps/v8/src/maglev/arm64/maglev-assembler-arm64.cc
@@ -17,6 +17,7 @@ void MaglevAssembler::Allocate(RegisterSnapshot register_snapshot,
                                Register object, int size_in_bytes,
                                AllocationType alloc_type,
                                AllocationAlignment alignment) {
+  DCHECK(allow_allocate());
   // TODO(victorgomes): Call the runtime for large object allocation.
   // TODO(victorgomes): Support double alignment.
   DCHECK_EQ(alignment, kTaggedAligned);
@@ -69,8 +70,8 @@ void MaglevAssembler::Allocate(RegisterSnapshot register_snapshot,
         __ B(*done);
       },
       register_snapshot, object,
-      in_new_space ? Builtin::kAllocateRegularInYoungGeneration
-                   : Builtin::kAllocateRegularInOldGeneration,
+      in_new_space ? Builtin::kAllocateInYoungGeneration
+                   : Builtin::kAllocateInOldGeneration,
       size_in_bytes, done);
   // Store new top and tag object.
   Move(ExternalReferenceAsOperand(top, scratch), new_top);
@@ -78,279 +79,48 @@ void MaglevAssembler::Allocate(RegisterSnapshot register_snapshot,
   bind(*done);
 }
 
-void MaglevAssembler::AllocateHeapNumber(RegisterSnapshot register_snapshot,
-                                         Register result,
-                                         DoubleRegister value) {
-  // In the case we need to call the runtime, we should spill the value
-  // register. Even if it is not live in the next node, otherwise the
-  // allocation call might trash it.
-  register_snapshot.live_double_registers.set(value);
-  Allocate(register_snapshot, result, HeapNumber::kSize);
-  // `Allocate` needs 2 scratch registers, so it's important to `Acquire` after
-  // `Allocate` is done and not before.
-  ScratchRegisterScope temps(this);
-  Register scratch = temps.Acquire();
-  LoadTaggedRoot(scratch, RootIndex::kHeapNumberMap);
-  StoreTaggedField(scratch, FieldMemOperand(result, HeapObject::kMapOffset));
-  Str(value, FieldMemOperand(result, HeapNumber::kValueOffset));
-}
-
-void MaglevAssembler::StoreTaggedFieldWithWriteBarrier(
-    Register object, int offset, Register value,
-    RegisterSnapshot register_snapshot, ValueIsCompressed value_is_compressed,
-    ValueCanBeSmi value_can_be_smi) {
-  AssertNotSmi(object);
-  StoreTaggedField(FieldMemOperand(object, offset), value);
-
-  ZoneLabelRef done(this);
-  Label* deferred_write_barrier = MakeDeferredCode(
-      [](MaglevAssembler* masm, ZoneLabelRef done, Register object, int offset,
-         Register value, RegisterSnapshot register_snapshot,
-         ValueIsCompressed value_is_compressed) {
-        ASM_CODE_COMMENT_STRING(masm, "Write barrier slow path");
-        if (value_is_compressed == kValueIsCompressed) {
-          __ DecompressTagged(value, value);
-        }
-        __ CheckPageFlag(value, MemoryChunk::kPointersToHereAreInterestingMask,
-                         eq, *done);
-
-        Register stub_object_reg = WriteBarrierDescriptor::ObjectRegister();
-        Register slot_reg = WriteBarrierDescriptor::SlotAddressRegister();
-
-        RegList saved;
-        if (object != stub_object_reg &&
-            register_snapshot.live_registers.has(stub_object_reg)) {
-          saved.set(stub_object_reg);
-        }
-        if (register_snapshot.live_registers.has(slot_reg)) {
-          saved.set(slot_reg);
-        }
-
-        __ PushAll(saved);
-
-        if (object != stub_object_reg) {
-          __ Move(stub_object_reg, object);
-          object = stub_object_reg;
-        }
-        __ Add(slot_reg, object, offset - kHeapObjectTag);
-
-        SaveFPRegsMode const save_fp_mode =
-            !register_snapshot.live_double_registers.is_empty()
-                ? SaveFPRegsMode::kSave
-                : SaveFPRegsMode::kIgnore;
-
-        __ CallRecordWriteStub(object, slot_reg, save_fp_mode);
-
-        __ PopAll(saved);
-        __ B(*done);
-      },
-      done, object, offset, value, register_snapshot, value_is_compressed);
-
-  if (value_can_be_smi == kValueCanBeSmi) {
-    JumpIfSmi(value, *done);
-  } else {
-    AssertNotSmi(value);
-  }
-  CheckPageFlag(object, MemoryChunk::kPointersFromHereAreInterestingMask, ne,
-                deferred_write_barrier);
-  bind(*done);
-}
-
-void MaglevAssembler::ToBoolean(Register value, ZoneLabelRef is_true,
-                                ZoneLabelRef is_false,
-                                bool fallthrough_when_true) {
-  ScratchRegisterScope temps(this);
-  Register map = temps.Acquire();
-
-  // Check if {{value}} is Smi.
-  Condition is_smi = CheckSmi(value);
-  JumpToDeferredIf(
-      is_smi,
-      [](MaglevAssembler* masm, Register value, ZoneLabelRef is_true,
-         ZoneLabelRef is_false) {
-        // Check if {value} is not zero.
-        __ CmpTagged(value, Smi::FromInt(0));
-        __ JumpIf(eq, *is_false);
-        __ Jump(*is_true);
-      },
-      value, is_true, is_false);
+void MaglevAssembler::OSRPrologue(Graph* graph) {
+  DCHECK(graph->is_osr());
+  CHECK(!graph->has_recursive_calls());
 
-  // Check if {{value}} is false.
-  CompareRoot(value, RootIndex::kFalseValue);
-  JumpIf(eq, *is_false);
+  uint32_t source_frame_size =
+      graph->min_maglev_stackslots_for_unoptimized_frame_size();
 
-  // Check if {{value}} is empty string.
-  CompareRoot(value, RootIndex::kempty_string);
-  JumpIf(eq, *is_false);
+  static_assert(StandardFrameConstants::kFixedSlotCount % 2 == 1);
+  if (source_frame_size % 2 == 0) source_frame_size++;
 
-  // Check if {{value}} is undetectable.
-  LoadMap(map, value);
-  {
-    ScratchRegisterScope scope(this);
-    Register tmp = scope.Acquire().W();
-    Move(tmp, FieldMemOperand(map, Map::kBitFieldOffset));
-    Tst(tmp, Immediate(Map::Bits1::IsUndetectableBit::kMask));
-    JumpIf(ne, *is_false);
-  }
-
-  // Check if {{value}} is a HeapNumber.
-  CompareRoot(map, RootIndex::kHeapNumberMap);
-  JumpToDeferredIf(
-      eq,
-      [](MaglevAssembler* masm, Register value, ZoneLabelRef is_true,
-         ZoneLabelRef is_false) {
-        ScratchRegisterScope scope(masm);
-        DoubleRegister value_double = scope.AcquireDouble();
-        __ Ldr(value_double, FieldMemOperand(value, HeapNumber::kValueOffset));
-        __ Fcmp(value_double, 0.0);
-        __ JumpIf(eq, *is_false);
-        __ JumpIf(vs, *is_false);  // NaN check
-        __ Jump(*is_true);
-      },
-      value, is_true, is_false);
-
-  // Check if {{value}} is a BigInt.
-  CompareRoot(map, RootIndex::kBigIntMap);
-  JumpToDeferredIf(
-      eq,
-      [](MaglevAssembler* masm, Register value, ZoneLabelRef is_true,
-         ZoneLabelRef is_false) {
-        ScratchRegisterScope scope(masm);
-        Register tmp = scope.Acquire().W();
-        __ Ldr(tmp, FieldMemOperand(value, BigInt::kBitfieldOffset));
-        __ Tst(tmp, Immediate(BigInt::LengthBits::kMask));
-        __ JumpIf(eq, *is_false);
-        __ Jump(*is_true);
-      },
-      value, is_true, is_false);
-
-  // Otherwise true.
-  if (!fallthrough_when_true) {
-    Jump(*is_true);
+  if (v8_flags.maglev_assert_stack_size && v8_flags.debug_code) {
+    ScratchRegisterScope temps(this);
+    Register scratch = temps.Acquire();
+    Add(scratch, sp,
+        source_frame_size * kSystemPointerSize +
+            StandardFrameConstants::kFixedFrameSizeFromFp);
+    Cmp(scratch, fp);
+    Assert(eq, AbortReason::kOsrUnexpectedStackSize);
   }
-}
 
-void MaglevAssembler::TestTypeOf(
-    Register object, interpreter::TestTypeOfFlags::LiteralFlag literal,
-    Label* is_true, Label::Distance true_distance, bool fallthrough_when_true,
-    Label* is_false, Label::Distance false_distance,
-    bool fallthrough_when_false) {
-  // If both true and false are fallthroughs, we don't have to do anything.
-  if (fallthrough_when_true && fallthrough_when_false) return;
-
-  // IMPORTANT: Note that `object` could be a register that aliases registers in
-  // the ScratchRegisterScope. Make sure that all reads of `object` are before
-  // any writes to scratch registers
-  using LiteralFlag = interpreter::TestTypeOfFlags::LiteralFlag;
-  switch (literal) {
-    case LiteralFlag::kNumber: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_true);
-      Ldr(scratch.W(), FieldMemOperand(object, HeapObject::kMapOffset));
-      CompareRoot(scratch.W(), RootIndex::kHeapNumberMap);
-      Branch(eq, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kString: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false);
-      LoadMap(scratch, object);
-      CompareInstanceTypeRange(scratch, scratch, FIRST_STRING_TYPE,
-                               LAST_STRING_TYPE);
-      Branch(le, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kSymbol: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false);
-      LoadMap(scratch, object);
-      CompareInstanceType(scratch, scratch, SYMBOL_TYPE);
-      Branch(eq, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kBoolean:
-      CompareRoot(object, RootIndex::kTrueValue);
-      B(eq, is_true);
-      CompareRoot(object, RootIndex::kFalseValue);
-      Branch(eq, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    case LiteralFlag::kBigInt: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false);
-      LoadMap(scratch, object);
-      CompareInstanceType(scratch, scratch, BIGINT_TYPE);
-      Branch(eq, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
+  uint32_t target_frame_size =
+      graph->tagged_stack_slots() + graph->untagged_stack_slots();
+  CHECK_EQ(target_frame_size % 2, 1);
+  CHECK_LE(source_frame_size, target_frame_size);
+  if (source_frame_size < target_frame_size) {
+    ASM_CODE_COMMENT_STRING(this, "Growing frame for OSR");
+    uint32_t additional_tagged =
+        source_frame_size < graph->tagged_stack_slots()
+            ? graph->tagged_stack_slots() - source_frame_size
+            : 0;
+    uint32_t additional_tagged_double =
+        additional_tagged / 2 + additional_tagged % 2;
+    for (size_t i = 0; i < additional_tagged_double; ++i) {
+      Push(xzr, xzr);
     }
-    case LiteralFlag::kUndefined: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      // Make sure `object` isn't a valid temp here, since we re-use it.
-      temps.SetAvailable(temps.Available() - object);
-      Register map = temps.Acquire();
-      JumpIfSmi(object, is_false);
-      // Check it has the undetectable bit set and it is not null.
-      LoadMap(map, object);
-      Ldr(map.W(), FieldMemOperand(map, Map::kBitFieldOffset));
-      TestAndBranchIfAllClear(map.W(), Map::Bits1::IsUndetectableBit::kMask,
-                              is_false);
-      CompareRoot(object, RootIndex::kNullValue);
-      Branch(ne, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kFunction: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false);
-      // Check if callable bit is set and not undetectable.
-      LoadMap(scratch, object);
-      Ldr(scratch.W(), FieldMemOperand(scratch, Map::kBitFieldOffset));
-      And(scratch.W(), scratch.W(),
-          Map::Bits1::IsUndetectableBit::kMask |
-              Map::Bits1::IsCallableBit::kMask);
-      Cmp(scratch.W(), Map::Bits1::IsCallableBit::kMask);
-      Branch(eq, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kObject: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false);
-      // If the object is null then return true.
-      CompareRoot(object, RootIndex::kNullValue);
-      B(eq, is_true);
-      // Check if the object is a receiver type,
-      LoadMap(scratch, object);
-      {
-        MaglevAssembler::ScratchRegisterScope temps(this);
-        CompareInstanceType(scratch, temps.Acquire(), FIRST_JS_RECEIVER_TYPE);
-      }
-      B(lt, is_false);
-      // ... and is not undefined (undetectable) nor callable.
-      Ldr(scratch.W(), FieldMemOperand(scratch, Map::kBitFieldOffset));
-      Tst(scratch.W(), Immediate(Map::Bits1::IsUndetectableBit::kMask |
-                                 Map::Bits1::IsCallableBit::kMask));
-      Branch(eq, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
+    uint32_t size_so_far = source_frame_size + additional_tagged_double * 2;
+    CHECK_LE(size_so_far, target_frame_size);
+    if (size_so_far < target_frame_size) {
+      Sub(sp, sp,
+          Immediate((target_frame_size - size_so_far) * kSystemPointerSize));
     }
-    case LiteralFlag::kOther:
-      if (!fallthrough_when_false) {
-        Jump(is_false, false_distance);
-      }
-      return;
   }
-  UNREACHABLE();
 }
 
 void MaglevAssembler::Prologue(Graph* graph) {
@@ -364,8 +134,9 @@ void MaglevAssembler::Prologue(Graph* graph) {
   // used registers manually.
   temps.Include({x14, x15});
 
-  CallTarget();
+  DCHECK(!graph->is_osr());
 
+  CallTarget();
   BailoutIfDeoptimized();
 
   if (graph->has_recursive_calls()) {
@@ -373,27 +144,22 @@ void MaglevAssembler::Prologue(Graph* graph) {
   }
 
   // Tiering support.
-  // TODO(jgruber): Extract to a builtin.
-  {
-    ScratchRegisterScope temps(this);
-    Register flags = temps.Acquire();
-    Register feedback_vector = temps.Acquire();
-
-    Label* deferred_flags_need_processing = MakeDeferredCode(
-        [](MaglevAssembler* masm, Register flags, Register feedback_vector) {
-          ASM_CODE_COMMENT_STRING(masm, "Optimized marker check");
-          // TODO(leszeks): This could definitely be a builtin that we
-          // tail-call.
-          __ OptimizeCodeOrTailCallOptimizedCodeSlot(flags, feedback_vector);
-          __ Trap();
-        },
-        flags, feedback_vector);
-
+  if (v8_flags.turbofan) {
+    using D = MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor;
+    Register flags = D::GetRegisterParameter(D::kFlags);
+    Register feedback_vector = D::GetRegisterParameter(D::kFeedbackVector);
+    DCHECK(!AreAliased(flags, feedback_vector, kJavaScriptCallArgCountRegister,
+                       kJSFunctionRegister, kContextRegister,
+                       kJavaScriptCallNewTargetRegister));
+    DCHECK(!temps.Available().has(flags));
+    DCHECK(!temps.Available().has(feedback_vector));
     Move(feedback_vector,
          compilation_info()->toplevel_compilation_unit()->feedback().object());
-    LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-        flags, feedback_vector, CodeKind::MAGLEV,
-        deferred_flags_need_processing);
+    Condition needs_processing =
+        LoadFeedbackVectorFlagsAndCheckIfNeedsProcessing(flags, feedback_vector,
+                                                         CodeKind::MAGLEV);
+    TailCallBuiltin(Builtin::kMaglevOptimizeCodeOrTailCallOptimizedCodeSlot,
+                    needs_processing);
   }
 
   EnterFrame(StackFrame::MAGLEV);
@@ -481,21 +247,6 @@ void MaglevAssembler::MaybeEmitDeoptBuiltinsCall(size_t eager_deopt_count,
   }
 }
 
-void MaglevAssembler::AllocateTwoByteString(RegisterSnapshot register_snapshot,
-                                            Register result, int length) {
-  int size = SeqTwoByteString::SizeFor(length);
-  Allocate(register_snapshot, result, size);
-  ScratchRegisterScope scope(this);
-  Register scratch = scope.Acquire();
-  StoreTaggedField(xzr, FieldMemOperand(result, size - kObjectAlignment));
-  LoadTaggedRoot(scratch, RootIndex::kStringMap);
-  StoreTaggedField(scratch, FieldMemOperand(result, HeapObject::kMapOffset));
-  Move(scratch, Name::kEmptyHashField);
-  StoreTaggedField(scratch, FieldMemOperand(result, Name::kRawHashFieldOffset));
-  Move(scratch, length);
-  StoreTaggedField(scratch, FieldMemOperand(result, String::kLengthOffset));
-}
-
 void MaglevAssembler::LoadSingleCharacterString(Register result,
                                                 Register char_code,
                                                 Register scratch) {
@@ -506,8 +257,8 @@ void MaglevAssembler::LoadSingleCharacterString(Register result,
   }
   Register table = scratch;
   LoadRoot(table, RootIndex::kSingleCharacterStringTable);
-  Add(table, table, Operand(char_code, LSL, kTaggedSizeLog2));
-  DecompressTagged(result, FieldMemOperand(table, FixedArray::kHeaderSize));
+  LoadTaggedFieldByIndex(result, table, char_code, kTaggedSize,
+                         FixedArray::kHeaderSize);
 }
 
 void MaglevAssembler::StringFromCharCode(RegisterSnapshot register_snapshot,
@@ -618,9 +369,7 @@ void MaglevAssembler::StringCharCodeOrCodePointAt(
   }
 
   // Get instance type.
-  LoadMap(instance_type, string);
-  Ldr(instance_type.W(),
-      FieldMemOperand(instance_type, Map::kInstanceTypeOffset));
+  LoadInstanceType(instance_type, string);
 
   {
     ScratchRegisterScope temps(this);
@@ -629,21 +378,20 @@ void MaglevAssembler::StringCharCodeOrCodePointAt(
     // TODO(victorgomes): Add fast path for external strings.
     And(representation, instance_type.W(),
         Immediate(kStringRepresentationMask));
-    Cmp(representation, Immediate(kSeqStringTag));
-    B(&seq_string, eq);
-    Cmp(representation, Immediate(kConsStringTag));
-    B(&cons_string, eq);
-    Cmp(representation, Immediate(kSlicedStringTag));
-    B(&sliced_string, eq);
-    Cmp(representation, Immediate(kThinStringTag));
-    B(deferred_runtime_call, ne);
+    CompareAndBranch(representation, Immediate(kSeqStringTag), kEqual,
+                     &seq_string);
+    CompareAndBranch(representation, Immediate(kConsStringTag), kEqual,
+                     &cons_string);
+    CompareAndBranch(representation, Immediate(kSlicedStringTag), kEqual,
+                     &sliced_string);
+    CompareAndBranch(representation, Immediate(kThinStringTag), kNotEqual,
+                     deferred_runtime_call);
     // Fallthrough to thin string.
   }
 
   // Is a thin string.
   {
-    DecompressTagged(string,
-                     FieldMemOperand(string, ThinString::kActualOffset));
+    LoadTaggedField(string, string, ThinString::kActualOffset);
     B(&loop);
   }
 
@@ -652,10 +400,8 @@ void MaglevAssembler::StringCharCodeOrCodePointAt(
     ScratchRegisterScope temps(this);
     Register offset = temps.Acquire();
 
-    Ldr(offset.W(), FieldMemOperand(string, SlicedString::kOffsetOffset));
-    SmiUntag(offset);
-    DecompressTagged(string,
-                     FieldMemOperand(string, SlicedString::kParentOffset));
+    LoadAndUntagTaggedSignedField(offset, string, SlicedString::kOffsetOffset);
+    LoadTaggedField(string, string, SlicedString::kParentOffset);
     Add(index, index, offset);
     B(&loop);
   }
@@ -665,10 +411,11 @@ void MaglevAssembler::StringCharCodeOrCodePointAt(
     // Reuse {instance_type} register here, since CompareRoot requires a scratch
     // register as well.
     Register second_string = instance_type;
-    Ldr(second_string.W(), FieldMemOperand(string, ConsString::kSecondOffset));
+    LoadTaggedFieldWithoutDecompressing(second_string, string,
+                                        ConsString::kSecondOffset);
     CompareRoot(second_string, RootIndex::kempty_string);
     B(deferred_runtime_call, ne);
-    DecompressTagged(string, FieldMemOperand(string, ConsString::kFirstOffset));
+    LoadTaggedField(string, string, ConsString::kFirstOffset);
     B(&loop);  // Try again with first string.
   }
 
@@ -802,98 +549,47 @@ void MaglevAssembler::TryTruncateDoubleToInt32(Register dst, DoubleRegister src,
   Bind(&check_done);
 }
 
-void MaglevAssembler::StringLength(Register result, Register string) {
-  if (v8_flags.debug_code) {
-    // Check if {string} is a string.
-    MaglevAssembler::ScratchRegisterScope temps(this);
-    Register scratch = temps.Acquire();
-    AssertNotSmi(string);
-    LoadMap(scratch, string);
-    CompareInstanceTypeRange(scratch, scratch, FIRST_STRING_TYPE,
-                             LAST_STRING_TYPE);
-    Check(ls, AbortReason::kUnexpectedValue);
-  }
-  Ldr(result.W(), FieldMemOperand(string, String::kLengthOffset));
-}
-
-void MaglevAssembler::StoreFixedArrayElementWithWriteBarrier(
-    Register array, Register index, Register value,
-    RegisterSnapshot register_snapshot) {
-  if (v8_flags.debug_code) {
-    AssertNotSmi(array);
-    IsObjectType(array, FIXED_ARRAY_TYPE);
-    Assert(eq, AbortReason::kUnexpectedValue);
-    Cmp(index, Immediate(0));
-    Assert(hs, AbortReason::kUnexpectedNegativeValue);
-  }
-  {
-    ScratchRegisterScope temps(this);
-    Register scratch = temps.Acquire();
-    Add(scratch, array, Operand(index, LSL, kTaggedSizeLog2));
-    Str(value.W(), FieldMemOperand(scratch, FixedArray::kHeaderSize));
-  }
-
-  ZoneLabelRef done(this);
-  Label* deferred_write_barrier = MakeDeferredCode(
-      [](MaglevAssembler* masm, ZoneLabelRef done, Register object,
-         Register index, Register value, RegisterSnapshot register_snapshot) {
-        ASM_CODE_COMMENT_STRING(masm, "Write barrier slow path");
-        __ CheckPageFlag(value, MemoryChunk::kPointersToHereAreInterestingMask,
-                         eq, *done);
-
-        Register stub_object_reg = WriteBarrierDescriptor::ObjectRegister();
-        Register slot_reg = WriteBarrierDescriptor::SlotAddressRegister();
-
-        RegList saved;
-        if (object != stub_object_reg &&
-            register_snapshot.live_registers.has(stub_object_reg)) {
-          saved.set(stub_object_reg);
-        }
-        if (register_snapshot.live_registers.has(slot_reg)) {
-          saved.set(slot_reg);
-        }
-
-        __ PushAll(saved);
-
-        if (object != stub_object_reg) {
-          __ Move(stub_object_reg, object);
-          object = stub_object_reg;
-        }
-        __ Add(slot_reg, object, FixedArray::kHeaderSize - kHeapObjectTag);
-        __ Add(slot_reg, slot_reg, Operand(index, LSL, kTaggedSizeLog2));
+void MaglevAssembler::TryTruncateDoubleToUint32(Register dst,
+                                                DoubleRegister src,
+                                                Label* fail) {
+  ScratchRegisterScope temps(this);
+  DoubleRegister converted_back = temps.AcquireDouble();
 
-        SaveFPRegsMode const save_fp_mode =
-            !register_snapshot.live_double_registers.is_empty()
-                ? SaveFPRegsMode::kSave
-                : SaveFPRegsMode::kIgnore;
+  // Convert the input float64 value to uint32.
+  Fcvtzu(dst, src);
+  // Convert that uint32 value back to float64.
+  Ucvtf(converted_back, dst);
+  // Check that the result of the float64->uint32->float64 is equal to the input
+  // (i.e. that the conversion didn't truncate.
+  Fcmp(src, converted_back);
+  JumpIf(ne, fail);
 
-        __ CallRecordWriteStub(object, slot_reg, save_fp_mode);
+  // Check if {input} is -0.
+  Label check_done;
+  Cbnz(dst, &check_done);
 
-        __ PopAll(saved);
-        __ B(*done);
-      },
-      done, array, index, value, register_snapshot);
+  // In case of 0, we need to check for the IEEE 0 pattern (which is all zeros).
+  Register input_bits = temps.Acquire();
+  Fmov(input_bits, src);
+  Cbnz(input_bits, fail);
 
-  JumpIfSmi(value, *done);
-  CheckPageFlag(array, MemoryChunk::kPointersFromHereAreInterestingMask, ne,
-                deferred_write_barrier);
-  bind(*done);
+  Bind(&check_done);
 }
 
-void MaglevAssembler::StoreFixedArrayElementNoWriteBarrier(Register array,
-                                                           Register index,
-                                                           Register value) {
+void MaglevAssembler::TryChangeFloat64ToIndex(Register result,
+                                              DoubleRegister value,
+                                              Label* success, Label* fail) {
   ScratchRegisterScope temps(this);
-  Register scratch = temps.Acquire();
-  if (v8_flags.debug_code) {
-    AssertNotSmi(array);
-    IsObjectType(array, FIXED_ARRAY_TYPE);
-    Assert(eq, AbortReason::kUnexpectedValue);
-    Cmp(index, Immediate(0));
-    Assert(hs, AbortReason::kUnexpectedNegativeValue);
-  }
-  Add(scratch, array, Operand(index, LSL, kTaggedSizeLog2));
-  Str(value.W(), FieldMemOperand(scratch, FixedArray::kHeaderSize));
+  DoubleRegister converted_back = temps.AcquireDouble();
+  // Convert the input float64 value to int32.
+  Fcvtzs(result.W(), value);
+  // Convert that int32 value back to float64.
+  Scvtf(converted_back, result.W());
+  // Check that the result of the float64->int32->float64 is equal to
+  // the input (i.e. that the conversion didn't truncate).
+  Fcmp(value, converted_back);
+  JumpIf(kNotEqual, fail);
+  Jump(success);
 }
 
 }  // namespace maglev
diff --git a/deps/v8/src/maglev/arm64/maglev-ir-arm64.cc b/deps/v8/src/maglev/arm64/maglev-ir-arm64.cc
index dee8e594de084c..145979d45222b3 100644
--- a/deps/v8/src/maglev/arm64/maglev-ir-arm64.cc
+++ b/deps/v8/src/maglev/arm64/maglev-ir-arm64.cc
@@ -11,6 +11,7 @@
 #include "src/maglev/maglev-graph-processor.h"
 #include "src/maglev/maglev-graph.h"
 #include "src/maglev/maglev-ir-inl.h"
+#include "src/maglev/maglev-ir.h"
 #include "src/objects/feedback-cell.h"
 #include "src/objects/js-function.h"
 
@@ -75,35 +76,6 @@ void Int32DecrementWithOverflow::GenerateCode(MaglevAssembler* masm,
   __ EmitEagerDeoptIf(vs, DeoptimizeReason::kOverflow, this);
 }
 
-void CheckJSObjectElementsBounds::SetValueLocationConstraints() {
-  UseRegister(receiver_input());
-  set_temporaries_needed(1);
-  UseRegister(index_input());
-}
-void CheckJSObjectElementsBounds::GenerateCode(MaglevAssembler* masm,
-                                               const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-  Register object = ToRegister(receiver_input());
-  Register index = ToRegister(index_input()).W();
-
-  __ AssertNotSmi(object);
-
-  if (v8_flags.debug_code) {
-    __ CompareObjectType(object, FIRST_JS_OBJECT_TYPE, scratch);
-    __ Assert(ge, AbortReason::kUnexpectedValue);
-  }
-  __ LoadTaggedField(scratch,
-                     FieldMemOperand(object, JSObject::kElementsOffset));
-  if (v8_flags.debug_code) {
-    __ AssertNotSmi(scratch);
-  }
-  __ SmiUntagField(scratch,
-                   FieldMemOperand(scratch, FixedArray::kLengthOffset));
-  __ Cmp(index, scratch.W());
-  __ EmitEagerDeoptIf(hs, DeoptimizeReason::kOutOfBounds, this);
-}
-
 int BuiltinStringFromCharCode::MaxCallStackArgs() const {
   return AllocateDescriptor::GetStackParameterCount();
 }
@@ -179,456 +151,7 @@ void FoldedAllocation::GenerateCode(MaglevAssembler* masm,
   __ Add(ToRegister(result()), ToRegister(raw_allocation()), offset());
 }
 
-int CreateEmptyObjectLiteral::MaxCallStackArgs() const {
-  return AllocateDescriptor::GetStackParameterCount();
-}
-void CreateEmptyObjectLiteral::SetValueLocationConstraints() {
-  DefineAsRegister(this);
-}
-void CreateEmptyObjectLiteral::GenerateCode(MaglevAssembler* masm,
-                                            const ProcessingState& state) {
-  Register object = ToRegister(result());
-  __ Allocate(register_snapshot(), object, map().instance_size());
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-  __ Move(scratch, map().object());
-  __ StoreTaggedField(scratch, FieldMemOperand(object, HeapObject::kMapOffset));
-  __ LoadTaggedRoot(scratch, RootIndex::kEmptyFixedArray);
-  static_assert(JSObject::kPropertiesOrHashOffset + sizeof(Tagged_t) ==
-                JSObject::kElementsOffset);
-  __ StoreTwoTaggedFields(
-      scratch, FieldMemOperand(object, JSObject::kPropertiesOrHashOffset));
-  __ LoadTaggedRoot(scratch, RootIndex::kUndefinedValue);
-  int i = 0;
-  for (; i + 1 < map().GetInObjectProperties(); i += 2) {
-    int offset1 = map().GetInObjectPropertyOffset(i);
-    int offset2 = map().GetInObjectPropertyOffset(i + 1);
-    CHECK(offset1 + sizeof(Tagged_t) == offset2);
-    __ StoreTwoTaggedFields(scratch, FieldMemOperand(object, offset1));
-  }
-  if (i < map().GetInObjectProperties()) {
-    CHECK(i + 1 == map().GetInObjectProperties());
-    int offset = map().GetInObjectPropertyOffset(i);
-    __ StoreTaggedField(scratch, FieldMemOperand(object, offset));
-  }
-}
-
-void CheckedInt32ToUint32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void CheckedInt32ToUint32::GenerateCode(MaglevAssembler* masm,
-                                        const ProcessingState& state) {
-  Register input_reg = ToRegister(input()).W();
-  __ Tst(input_reg, input_reg);
-  __ EmitEagerDeoptIf(mi, DeoptimizeReason::kNotUint32, this);
-}
-
-void CheckJSArrayBounds::SetValueLocationConstraints() {
-  UseRegister(receiver_input());
-  UseRegister(index_input());
-}
-void CheckJSArrayBounds::GenerateCode(MaglevAssembler* masm,
-                                      const ProcessingState& state) {
-  Register object = ToRegister(receiver_input());
-  Register index = ToRegister(index_input());
-  __ AssertNotSmi(object);
-
-  if (v8_flags.debug_code) {
-    __ IsObjectType(object, JS_ARRAY_TYPE);
-    __ Assert(eq, AbortReason::kUnexpectedValue);
-  }
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-
-  __ SmiUntagField(scratch, FieldMemOperand(object, JSArray::kLengthOffset));
-  __ Cmp(index, scratch);
-  __ EmitEagerDeoptIf(hs, DeoptimizeReason::kOutOfBounds, this);
-}
-
-void ChangeInt32ToFloat64::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void ChangeInt32ToFloat64::GenerateCode(MaglevAssembler* masm,
-                                        const ProcessingState& state) {
-  __ Scvtf(ToDoubleRegister(result()), ToRegister(input()).W());
-}
-
-void ChangeUint32ToFloat64::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void ChangeUint32ToFloat64::GenerateCode(MaglevAssembler* masm,
-                                         const ProcessingState& state) {
-  __ Ucvtf(ToDoubleRegister(result()), ToRegister(input()).W());
-}
-
-void CheckedTruncateFloat64ToUint32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void CheckedTruncateFloat64ToUint32::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  DoubleRegister input_reg = ToDoubleRegister(input());
-  Register result_reg = ToRegister(result()).W();
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  DoubleRegister converted_back = temps.AcquireDouble();
-
-  // Convert the input float64 value to uint32.
-  __ Fcvtzu(result_reg, input_reg);
-  // Convert that uint32 value back to float64.
-  __ Ucvtf(converted_back, result_reg);
-  // Check that the result of the float64->uint32->float64 is equal to the input
-  // (i.e. that the conversion didn't truncate.
-  __ Fcmp(input_reg, converted_back);
-  __ EmitEagerDeoptIf(ne, DeoptimizeReason::kNotUint32, this);
-
-  // Check if {input} is -0.
-  Label check_done;
-  __ Cbnz(result_reg, &check_done);
-
-  // In case of 0, we need to check for the IEEE 0 pattern (which is all zeros).
-  Register input_bits = temps.Acquire();
-  __ Fmov(input_bits, input_reg);
-  __ Cbnz(input_bits, __ GetDeoptLabel(this, DeoptimizeReason::kNotUint32));
-
-  __ Bind(&check_done);
-}
-
-void CheckMaps::SetValueLocationConstraints() { UseRegister(receiver_input()); }
-void CheckMaps::GenerateCode(MaglevAssembler* masm,
-                             const ProcessingState& state) {
-  Register object = ToRegister(receiver_input());
-
-  // TODO(victorgomes): This can happen, because we do not emit an unconditional
-  // deopt when we intersect the map sets.
-  if (maps().is_empty()) {
-    __ EmitEagerDeopt(this, DeoptimizeReason::kWrongMap);
-    return;
-  }
-
-  bool maps_include_heap_number = AnyMapIsHeapNumber(maps());
-
-  Label done;
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
-    __ AssertNotSmi(object);
-  } else {
-    Condition is_smi = __ CheckSmi(object);
-    if (maps_include_heap_number) {
-      // Smis count as matching the HeapNumber map, so we're done.
-      __ B(&done, is_smi);
-    } else {
-      __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kWrongMap, this);
-    }
-  }
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register object_map = temps.Acquire();
-  Register map = temps.Acquire();
-  __ LoadMap(object_map, object);
-  size_t map_count = maps().size();
-  for (size_t i = 0; i < map_count - 1; ++i) {
-    Handle<Map> map_handle = maps().at(i);
-    __ Move(map, map_handle);
-    __ CmpTagged(object_map, map);
-    __ B(&done, eq);
-  }
-  Handle<Map> last_map_handle = maps().at(map_count - 1);
-  __ Move(map, last_map_handle);
-  __ CmpTagged(object_map, map);
-  __ EmitEagerDeoptIf(ne, DeoptimizeReason::kWrongMap, this);
-  __ Bind(&done);
-}
-
-int CheckMapsWithMigration::MaxCallStackArgs() const {
-  DCHECK_EQ(Runtime::FunctionForId(Runtime::kTryMigrateInstance)->nargs, 1);
-  return 1;
-}
-void CheckMapsWithMigration::SetValueLocationConstraints() {
-  UseRegister(receiver_input());
-  set_temporaries_needed(1);
-}
-void CheckMapsWithMigration::GenerateCode(MaglevAssembler* masm,
-                                          const ProcessingState& state) {
-  // TODO(victorgomes): This can happen, because we do not emit an unconditional
-  // deopt when we intersect the map sets.
-  if (maps().is_empty()) {
-    __ EmitEagerDeopt(this, DeoptimizeReason::kWrongMap);
-    return;
-  }
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register object = ToRegister(receiver_input());
-
-  bool maps_include_heap_number = AnyMapIsHeapNumber(maps());
-
-  ZoneLabelRef done(masm);
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
-    __ AssertNotSmi(object);
-  } else {
-    Condition is_smi = __ CheckSmi(object);
-    if (maps_include_heap_number) {
-      // Smis count as matching the HeapNumber map, so we're done.
-      __ B(*done, is_smi);
-    } else {
-      __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kWrongMap, this);
-    }
-  }
-
-  // Use general temporaries to be able to send to deferred code.
-  Register object_map = temps.Acquire();
-  Register scratch = temps.Acquire();
-  __ LoadMap(object_map, object);
-
-  size_t map_count = maps().size();
-  for (size_t i = 0; i < map_count; ++i) {
-    ZoneLabelRef continue_label(masm);
-    Handle<Map> map_handle = maps().at(i);
-    {
-      Register map = scratch;
-      __ Move(map, map_handle);
-      __ CmpTagged(object_map, map);
-    }
-    bool last_map = (i == map_count - 1);
-    if (map_handle->is_migration_target()) {
-      __ JumpToDeferredIf(
-          ne,
-          [](MaglevAssembler* masm, ZoneLabelRef continue_label,
-             ZoneLabelRef done, Register object, Register object_map,
-             Register scratch, int map_index, CheckMapsWithMigration* node) {
-            // If the map is not deprecated, we fail the map check, continue to
-            // the next one.
-            __ Ldr(scratch.W(),
-                   FieldMemOperand(object_map, Map::kBitField3Offset));
-            __ TestAndBranchIfAllClear(scratch.W(),
-                                       Map::Bits3::IsDeprecatedBit::kMask,
-                                       *continue_label);
-
-            // Otherwise, try migrating the object. If the migration
-            // returns Smi zero, then it failed the migration.
-            Register return_val = Register::no_reg();
-            {
-              RegisterSnapshot register_snapshot = node->register_snapshot();
-              // We can eager deopt after the snapshot, so make sure the nodes
-              // used by the deopt are included in it.
-              // TODO(leszeks): This is a bit of a footgun -- we likely want the
-              // snapshot to always include eager deopt input registers.
-              AddDeoptRegistersToSnapshot(&register_snapshot,
-                                          node->eager_deopt_info());
-              SaveRegisterStateForCall save_register_state(masm,
-                                                           register_snapshot);
-
-              __ Push(object);
-              __ Move(kContextRegister, masm->native_context().object());
-              __ CallRuntime(Runtime::kTryMigrateInstance);
-              save_register_state.DefineSafepoint();
-
-              // Make sure the return value is preserved across the live
-              // register restoring pop all.
-              return_val = kReturnRegister0;
-              if (register_snapshot.live_registers.has(return_val)) {
-                DCHECK(!register_snapshot.live_registers.has(scratch));
-                __ Mov(scratch, return_val);
-                return_val = scratch;
-              }
-            }
-
-            // On failure, the returned value is zero
-            __ Cbz(return_val, *continue_label);
-
-            // The migrated object is returned on success, retry the map check.
-            __ Move(object, return_val);
-            __ LoadMap(object_map, object);
-            __ Move(scratch, node->maps().at(map_index));
-            __ CmpTagged(object_map, scratch);
-            __ B(*done, eq);
-            __ B(*continue_label);
-          },
-          // If this is the last map to check, we should deopt if we fail.
-          // This is safe to do, since {eager_deopt_info} is ZoneAllocated.
-          (last_map ? ZoneLabelRef::UnsafeFromLabelPointer(masm->GetDeoptLabel(
-                          this, DeoptimizeReason::kWrongMap))
-                    : continue_label),
-          done, object, object_map, scratch, i, this);
-    } else if (last_map) {
-      // If it is the last map and it is not a migration target, we should deopt
-      // if the check fails.
-      __ EmitEagerDeoptIf(ne, DeoptimizeReason::kWrongMap, this);
-    }
-
-    if (!last_map) {
-      // We don't need to Bind the label for the last map.
-      __ B(*done, eq);
-      __ Bind(*continue_label);
-    }
-  }
-
-  __ Bind(*done);
-}
-
-void CheckNumber::SetValueLocationConstraints() {
-  UseRegister(receiver_input());
-}
-void CheckNumber::GenerateCode(MaglevAssembler* masm,
-                               const ProcessingState& state) {
-  Label done;
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-  Register value = ToRegister(receiver_input());
-  // If {value} is a Smi or a HeapNumber, we're done.
-  __ JumpIfSmi(value, &done);
-  if (mode() == Object::Conversion::kToNumeric) {
-    __ LoadMap(scratch, value);
-    __ CompareRoot(scratch.W(), RootIndex::kHeapNumberMap);
-    // Jump to done if it is a HeapNumber.
-    __ B(&done, eq);
-    // Check if it is a BigInt.
-    __ Ldrh(scratch.W(), FieldMemOperand(scratch, Map::kInstanceTypeOffset));
-    __ Cmp(scratch, Immediate(BIGINT_TYPE));
-  } else {
-    __ Ldr(scratch.W(), FieldMemOperand(value, HeapObject::kMapOffset));
-    __ CompareRoot(scratch, RootIndex::kHeapNumberMap);
-  }
-  __ EmitEagerDeoptIf(ne, DeoptimizeReason::kNotANumber, this);
-  __ Bind(&done);
-}
-
 int CheckedObjectToIndex::MaxCallStackArgs() const { return 0; }
-void CheckedObjectToIndex::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  DefineAsRegister(this);
-  set_double_temporaries_needed(1);
-}
-void CheckedObjectToIndex::GenerateCode(MaglevAssembler* masm,
-                                        const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register result_reg = ToRegister(result());
-
-  ZoneLabelRef done(masm);
-  Condition is_smi = __ CheckSmi(object);
-  __ JumpToDeferredIf(
-      NegateCondition(is_smi),
-      [](MaglevAssembler* masm, Register object, Register result_reg,
-         ZoneLabelRef done, CheckedObjectToIndex* node) {
-        Label is_string;
-        MaglevAssembler::ScratchRegisterScope temps(masm);
-        Register scratch = temps.Acquire();
-        __ LoadMap(scratch, object);
-        __ CompareInstanceTypeRange(scratch, scratch, FIRST_STRING_TYPE,
-                                    LAST_STRING_TYPE);
-        __ B(&is_string, ls);
-
-        __ Cmp(scratch, Immediate(HEAP_NUMBER_TYPE));
-        // The IC will go generic if it encounters something other than a
-        // Number or String key.
-        __ EmitEagerDeoptIf(ne, DeoptimizeReason::kNotInt32, node);
-
-        // Heap Number.
-        {
-          DoubleRegister number_value = temps.AcquireDouble();
-          DoubleRegister converted_back = temps.AcquireDouble();
-          __ Ldr(number_value,
-                 FieldMemOperand(object, HeapNumber::kValueOffset));
-          // Convert the input float64 value to int32.
-          __ TruncateDoubleToInt32(result_reg, number_value);
-          // Convert that int32 value back to float64.
-          __ Scvtf(converted_back, result_reg);
-          // Check that the result of the float64->int32->float64 is equal to
-          // the input (i.e. that the conversion didn't truncate.
-          __ Fcmp(number_value, converted_back);
-          __ B(*done, eq);
-          __ EmitEagerDeopt(node, DeoptimizeReason::kNotInt32);
-        }
-
-        // String.
-        __ Bind(&is_string);
-        {
-          RegisterSnapshot snapshot = node->register_snapshot();
-          snapshot.live_registers.clear(result_reg);
-          DCHECK(!snapshot.live_tagged_registers.has(result_reg));
-          {
-            SaveRegisterStateForCall save_register_state(masm, snapshot);
-            AllowExternalCallThatCantCauseGC scope(masm);
-            __ Move(x0, object);
-            __ CallCFunction(
-                ExternalReference::string_to_array_index_function(), 1);
-            // No need for safepoint since this is a fast C call.
-            __ Move(result_reg, kReturnRegister0);
-          }
-          __ Cmp(result_reg, Immediate(0));
-          __ B(*done, ge);
-          __ EmitEagerDeopt(node, DeoptimizeReason::kNotInt32);
-        }
-      },
-      object, result_reg, done, this);
-
-  // If we didn't enter the deferred block, we're a Smi.
-  if (result_reg == object) {
-    __ SmiToInt32(result_reg);
-  } else {
-    __ SmiToInt32(result_reg, object);
-  }
-
-  __ Bind(*done);
-}
-
-void Int32ToNumber::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void Int32ToNumber::GenerateCode(MaglevAssembler* masm,
-                                 const ProcessingState& state) {
-  ZoneLabelRef done(masm);
-  Register object = ToRegister(result());
-  Register value = ToRegister(input());
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-  __ Adds(scratch.W(), value.W(), value.W());
-  __ JumpToDeferredIf(
-      vs,
-      [](MaglevAssembler* masm, Register object, Register value,
-         Register scratch, ZoneLabelRef done, Int32ToNumber* node) {
-        MaglevAssembler::ScratchRegisterScope temps(masm);
-        // We can include {scratch} back to the temporary set, since we jump
-        // over its use to the label {done}.
-        temps.Include(scratch);
-        DoubleRegister double_value = temps.AcquireDouble();
-        __ Scvtf(double_value, value.W());
-        __ AllocateHeapNumber(node->register_snapshot(), object, double_value);
-        __ B(*done);
-      },
-      object, value, scratch, done, this);
-  __ Mov(object, scratch);
-  __ Bind(*done);
-}
-
-void Uint32ToNumber::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void Uint32ToNumber::GenerateCode(MaglevAssembler* masm,
-                                  const ProcessingState& state) {
-  ZoneLabelRef done(masm);
-  Register value = ToRegister(input());
-  Register object = ToRegister(result());
-  __ Cmp(value.W(), Immediate(Smi::kMaxValue));
-  __ JumpToDeferredIf(
-      hi,
-      [](MaglevAssembler* masm, Register object, Register value,
-         ZoneLabelRef done, Uint32ToNumber* node) {
-        MaglevAssembler::ScratchRegisterScope temps(masm);
-        DoubleRegister double_value = temps.AcquireDouble();
-        __ Ucvtf(double_value, value.W());
-        __ AllocateHeapNumber(node->register_snapshot(), object, double_value);
-        __ B(*done);
-      },
-      object, value, done, this);
-  __ Add(object, value, value);
-  __ Bind(*done);
-}
 
 void Int32AddWithOverflow::SetValueLocationConstraints() {
   UseRegister(left_input());
@@ -701,12 +224,13 @@ void Int32MultiplyWithOverflow::GenerateCode(MaglevAssembler* masm,
     MaglevAssembler::ScratchRegisterScope temps(masm);
     Register temp = temps.Acquire().W();
     __ Orr(temp, left, right);
-    __ Cmp(temp, Immediate(0));
     // If one of them is negative, we must have a -0 result, which is non-int32,
     // so deopt.
     // TODO(leszeks): Consider splitting these deopts to have distinct deopt
     // reasons. Otherwise, the reason has to match the above.
-    __ EmitEagerDeoptIf(lt, DeoptimizeReason::kOverflow, this);
+    __ RecordComment("-- Jump to eager deopt if the result is negative zero");
+    __ Tbnz(temp, temp.SizeInBits() - 1,
+            __ GetDeoptLabel(this, DeoptimizeReason::kOverflow));
   }
   __ Bind(&end);
   if (out_alias_input) {
@@ -740,18 +264,18 @@ void Int32DivideWithOverflow::GenerateCode(MaglevAssembler* masm,
          Register right, Int32DivideWithOverflow* node) {
         // {right} is negative or zero.
 
+        // TODO(leszeks): Using kNotInt32 here, but in same places
+        // kDivisionByZerokMinusZero/kMinusZero/kOverflow would be better. Right
+        // now all eager deopts in a node have to be the same -- we should allow
+        // a node to emit multiple eager deopts with different reasons.
+        Label* deopt = __ GetDeoptLabel(node, DeoptimizeReason::kNotInt32);
+
         // Check if {right} is zero.
         // We've already done the compare and flags won't be cleared yet.
-        // TODO(leszeks): Using kNotInt32 here, but kDivisionByZero would be
-        // better. Right now all eager deopts in a node have to be the same --
-        // we should allow a node to emit multiple eager deopts with different
-        // reasons.
-        __ EmitEagerDeoptIf(eq, DeoptimizeReason::kNotInt32, node);
+        __ JumpIf(eq, deopt);
 
         // Check if {left} is zero, as that would produce minus zero.
-        __ Cmp(left, Immediate(0));
-        // TODO(leszeks): Better DeoptimizeReason = kMinusZero.
-        __ EmitEagerDeoptIf(eq, DeoptimizeReason::kNotInt32, node);
+        __ CompareAndBranch(left, Immediate(0), eq, deopt);
 
         // Check if {left} is kMinInt and {right} is -1, in which case we'd have
         // to return -kMinInt, which is not representable as Int32.
@@ -759,9 +283,7 @@ void Int32DivideWithOverflow::GenerateCode(MaglevAssembler* masm,
         __ JumpIf(ne, *done);
         __ Cmp(right, Immediate(-1));
         __ JumpIf(ne, *done);
-        // TODO(leszeks): Better DeoptimizeReason = kOverflow, but
-        // eager_deopt_info is already configured as kNotInt32.
-        __ EmitEagerDeopt(node, DeoptimizeReason::kNotInt32);
+        __ JumpToDeopt(deopt);
       },
       done, left, right, this);
   __ Bind(*done);
@@ -778,8 +300,8 @@ void Int32DivideWithOverflow::GenerateCode(MaglevAssembler* masm,
   // Check that the remainder is zero.
   Register temp = temps.Acquire().W();
   __ Msub(temp, res, right, left);
-  __ Cmp(temp, Immediate(0));
-  __ EmitEagerDeoptIf(ne, DeoptimizeReason::kNotInt32, this);
+  __ CompareAndBranch(temp, Immediate(0), ne,
+                      __ GetDeoptLabel(this, DeoptimizeReason::kNotInt32));
 
   __ Move(out, res);
 }
@@ -839,8 +361,8 @@ void Int32ModulusWithOverflow::GenerateCode(MaglevAssembler* masm,
       [](MaglevAssembler* masm, ZoneLabelRef rhs_checked, Register rhs,
          Int32ModulusWithOverflow* node) {
         __ Negs(rhs, rhs);
-        __ EmitEagerDeoptIf(eq, deopt_reason, node);
-        __ Jump(*rhs_checked);
+        __ B(*rhs_checked, ne);
+        __ EmitEagerDeopt(node, deopt_reason);
       },
       rhs_checked, rhs, this);
   __ Bind(*rhs_checked);
@@ -855,12 +377,11 @@ void Int32ModulusWithOverflow::GenerateCode(MaglevAssembler* masm,
         __ Neg(lhs, lhs);
         __ Udiv(res, lhs, rhs);
         __ Msub(out, res, rhs, lhs);
-        __ Cmp(out, Immediate(0));
+        __ Negs(out, out);
+        __ B(*done, ne);
         // TODO(victorgomes): This ideally should be kMinusZero, but Maglev
         // only allows one deopt reason per IR.
-        __ EmitEagerDeoptIf(eq, deopt_reason, node);
-        __ Neg(out, out);
-        __ B(*done);
+        __ EmitEagerDeopt(node, deopt_reason);
       },
       done, lhs, rhs, out, this);
 
@@ -1007,20 +528,20 @@ void Float64Round::GenerateCode(MaglevAssembler* masm,
   if (kind_ == Kind::kNearest) {
     MaglevAssembler::ScratchRegisterScope temps(masm);
     DoubleRegister temp = temps.AcquireDouble();
-    DoubleRegister temp2 = temps.AcquireDouble();
+    DoubleRegister half_one = temps.AcquireDouble();
     __ Move(temp, in);
     // Frintn rounds to even on tie, while JS expects it to round towards
     // +Infinity. Fix the difference by checking if we rounded down by exactly
     // 0.5, and if so, round to the other side.
     __ Frintn(out, in);
     __ Fsub(temp, temp, out);
-    __ Move(temp2, 0.5);
-    __ Fcmp(temp, temp2);
+    __ Move(half_one, 0.5);
+    __ Fcmp(temp, half_one);
     Label done;
     __ JumpIf(ne, &done, Label::kNear);
     // Fix wrong tie-to-even by adding 0.5 twice.
-    __ Fadd(out, out, temp2);
-    __ Fadd(out, out, temp2);
+    __ Fadd(out, out, half_one);
+    __ Fadd(out, out, half_one);
     __ bind(&done);
   } else if (kind_ == Kind::kCeil) {
     __ Frintp(out, in);
@@ -1052,104 +573,6 @@ void Float64Ieee754Unary::GenerateCode(MaglevAssembler* masm,
   __ CallCFunction(ieee_function_, 1);
 }
 
-void Float64SilenceNaN::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-
-void Float64SilenceNaN::GenerateCode(MaglevAssembler* masm,
-                                     const ProcessingState& state) {
-  __ CanonicalizeNaN(ToDoubleRegister(result()), ToDoubleRegister(input()));
-}
-
-template <class Derived, Operation kOperation>
-void Float64CompareNode<Derived, kOperation>::SetValueLocationConstraints() {
-  UseRegister(left_input());
-  UseRegister(right_input());
-  DefineAsRegister(this);
-}
-
-template <class Derived, Operation kOperation>
-void Float64CompareNode<Derived, kOperation>::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  DoubleRegister left = ToDoubleRegister(left_input());
-  DoubleRegister right = ToDoubleRegister(right_input());
-  Register result = ToRegister(this->result());
-  Label is_false, end;
-  __ Fcmp(left, right);
-  // Check for NaN first.
-  __ JumpIf(vs, &is_false);
-  __ JumpIf(NegateCondition(ConditionFor(kOperation)), &is_false);
-  // TODO(leszeks): Investigate loading existing materialisations of roots here,
-  // if available.
-  __ LoadRoot(result, RootIndex::kTrueValue);
-  __ Jump(&end);
-  {
-    __ Bind(&is_false);
-    __ LoadRoot(result, RootIndex::kFalseValue);
-  }
-  __ Bind(&end);
-}
-
-#define DEF_OPERATION(Name)                               \
-  void Name::SetValueLocationConstraints() {              \
-    Base::SetValueLocationConstraints();                  \
-  }                                                       \
-  void Name::GenerateCode(MaglevAssembler* masm,          \
-                          const ProcessingState& state) { \
-    Base::GenerateCode(masm, state);                      \
-  }
-DEF_OPERATION(Float64Equal)
-DEF_OPERATION(Float64StrictEqual)
-DEF_OPERATION(Float64LessThan)
-DEF_OPERATION(Float64LessThanOrEqual)
-DEF_OPERATION(Float64GreaterThan)
-DEF_OPERATION(Float64GreaterThanOrEqual)
-#undef DEF_OPERATION
-
-void CheckInt32IsSmi::SetValueLocationConstraints() { UseRegister(input()); }
-void CheckInt32IsSmi::GenerateCode(MaglevAssembler* masm,
-                                   const ProcessingState& state) {
-  // TODO(leszeks): This basically does a SmiTag and throws the result away.
-  // Don't throw the result away if we want to actually use it.
-  Register reg = ToRegister(input()).W();
-  __ Adds(wzr, reg, reg);
-  DCHECK_REGLIST_EMPTY(RegList{reg} &
-                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
-  __ EmitEagerDeoptIf(vs, DeoptimizeReason::kNotASmi, this);
-}
-
-void CheckedSmiTagInt32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void CheckedSmiTagInt32::GenerateCode(MaglevAssembler* masm,
-                                      const ProcessingState& state) {
-  Register reg = ToRegister(input()).W();
-  Register out = ToRegister(result()).W();
-  __ Adds(out, reg, reg);
-  // None of the mutated input registers should be a register input into the
-  // eager deopt info.
-  DCHECK_REGLIST_EMPTY(RegList{out} &
-                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
-  __ EmitEagerDeoptIf(vs, DeoptimizeReason::kOverflow, this);
-}
-
-void CheckedSmiTagUint32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void CheckedSmiTagUint32::GenerateCode(MaglevAssembler* masm,
-                                       const ProcessingState& state) {
-  Register reg = ToRegister(input()).W();
-  Register result_reg = ToRegister(result()).W();
-  // Perform an unsigned comparison against Smi::kMaxValue.
-  __ Cmp(reg, Immediate(Smi::kMaxValue));
-  __ EmitEagerDeoptIf(hi, DeoptimizeReason::kOverflow, this);
-  __ Adds(result_reg, reg, reg);
-  __ Assert(vc, AbortReason::kInputDoesNotFitSmi);
-}
-
 void CheckJSTypedArrayBounds::SetValueLocationConstraints() {
   UseRegister(receiver_input());
   if (ElementsKindSize(elements_kind_) == 1) {
@@ -1217,240 +640,20 @@ void CheckJSDataViewBounds::GenerateCode(MaglevAssembler* masm,
   __ EmitEagerDeoptIf(hs, DeoptimizeReason::kOutOfBounds, this);
 }
 
-void CheckedInternalizedString::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  DefineSameAsFirst(this);
-  set_temporaries_needed(1);
-}
-void CheckedInternalizedString::GenerateCode(MaglevAssembler* masm,
-                                             const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-  Register object = ToRegister(object_input());
-
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
-    __ AssertNotSmi(object);
-  } else {
-    Condition is_smi = __ CheckSmi(object);
-    __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kWrongMap, this);
-  }
-
-  __ LoadMap(scratch, object);
-  __ RecordComment("Test IsInternalizedString");
-  // Go to the slow path if this is a non-string, or a non-internalised string.
-  __ Ldrh(scratch.W(), FieldMemOperand(scratch, Map::kInstanceTypeOffset));
-  __ Tst(scratch.W(), Immediate(kIsNotStringMask | kIsNotInternalizedMask));
-  static_assert((kStringTag | kInternalizedTag) == 0);
-  ZoneLabelRef done(masm);
-  __ JumpToDeferredIf(
-      ne,
-      [](MaglevAssembler* masm, ZoneLabelRef done, Register object,
-         CheckedInternalizedString* node, EagerDeoptInfo* deopt_info,
-         Register instance_type) {
-        __ RecordComment("Deferred Test IsThinString");
-        // Deopt if this isn't a thin string.
-        __ Cmp(instance_type.W(), Immediate(THIN_STRING_TYPE));
-        __ EmitEagerDeoptIf(ne, DeoptimizeReason::kWrongMap, node);
-        __ LoadTaggedField(object,
-                           FieldMemOperand(object, ThinString::kActualOffset));
-        if (v8_flags.debug_code) {
-          __ RecordComment("DCHECK IsInternalizedString");
-          Register scratch = instance_type;
-          __ LoadMap(scratch, object);
-          __ Ldrh(scratch.W(),
-                  FieldMemOperand(scratch, Map::kInstanceTypeOffset));
-          __ Tst(scratch.W(),
-                 Immediate(kIsNotStringMask | kIsNotInternalizedMask));
-          static_assert((kStringTag | kInternalizedTag) == 0);
-          __ Check(eq, AbortReason::kUnexpectedValue);
-        }
-        __ jmp(*done);
-      },
-      done, object, this, eager_deopt_info(), scratch);
-  __ Bind(*done);
-}
-
-void UnsafeSmiTag::SetValueLocationConstraints() {
+void HoleyFloat64ToMaybeNanFloat64::SetValueLocationConstraints() {
   UseRegister(input());
   DefineAsRegister(this);
 }
-void UnsafeSmiTag::GenerateCode(MaglevAssembler* masm,
-                                const ProcessingState& state) {
-  Register reg = ToRegister(input()).W();
-  Register out = ToRegister(result()).W();
-  if (v8_flags.debug_code) {
-    if (input().node()->properties().value_representation() ==
-        ValueRepresentation::kUint32) {
-      __ Cmp(reg, Immediate(Smi::kMaxValue));
-      __ Check(ls, AbortReason::kInputDoesNotFitSmi);
-    }
-  }
-  __ Adds(out, reg, reg);
-  if (v8_flags.debug_code) {
-    __ Check(vc, AbortReason::kInputDoesNotFitSmi);
-  }
+void HoleyFloat64ToMaybeNanFloat64::GenerateCode(MaglevAssembler* masm,
+                                                 const ProcessingState& state) {
+  // The hole value is a signalling NaN, so just silence it to get the float64
+  // value.
+  __ CanonicalizeNaN(ToDoubleRegister(result()), ToDoubleRegister(input()));
 }
 
 namespace {
 
-void JumpToFailIfNotHeapNumberOrOddball(
-    MaglevAssembler* masm, Register value,
-    TaggedToFloat64ConversionType conversion_type, Label* fail) {
-  switch (conversion_type) {
-    case TaggedToFloat64ConversionType::kNumberOrOddball:
-      // Check if HeapNumber or Oddball, jump to fail otherwise.
-      static_assert(InstanceType::HEAP_NUMBER_TYPE + 1 ==
-                    InstanceType::ODDBALL_TYPE);
-      if (fail) {
-        __ CompareObjectTypeRange(value, InstanceType::HEAP_NUMBER_TYPE,
-                                  InstanceType::ODDBALL_TYPE);
-        __ JumpIf(kUnsignedGreaterThan, fail);
-      } else {
-        if (v8_flags.debug_code) {
-          __ CompareObjectTypeRange(value, InstanceType::HEAP_NUMBER_TYPE,
-                                    InstanceType::ODDBALL_TYPE);
-          __ Assert(kUnsignedLessThanEqual, AbortReason::kUnexpectedValue);
-        }
-      }
-      break;
-    case TaggedToFloat64ConversionType::kNumber:
-      // Check if HeapNumber, jump to fail otherwise.
-      if (fail) {
-        __ IsObjectType(value, InstanceType::HEAP_NUMBER_TYPE);
-        __ JumpIf(kNotEqual, fail);
-      } else {
-        if (v8_flags.debug_code) {
-          __ IsObjectType(value, InstanceType::HEAP_NUMBER_TYPE);
-          __ Assert(kEqual, AbortReason::kUnexpectedValue);
-        }
-      }
-      break;
-  }
-}
-
-void TryUnboxNumberOrOddball(MaglevAssembler* masm, DoubleRegister dst,
-                             Register src,
-                             TaggedToFloat64ConversionType conversion_type,
-                             Label* fail) {
-  Label is_not_smi, done;
-  // Check if Smi.
-  __ JumpIfNotSmi(src, &is_not_smi);
-  // If Smi, convert to Float64.
-  {
-    MaglevAssembler::ScratchRegisterScope temps(masm);
-    Register temp = temps.Acquire();
-    __ SmiToInt32(temp, src);
-    __ Sxtw(temp, temp.W());
-    __ Scvtf(dst, temp);
-  }
-  __ Jump(&done);
-  __ Bind(&is_not_smi);
-  JumpToFailIfNotHeapNumberOrOddball(masm, src, conversion_type, fail);
-  static_assert(HeapNumber::kValueOffset == Oddball::kToNumberRawOffset);
-  __ LoadHeapNumberValue(dst, src);
-  __ Bind(&done);
-}
-
-}  // namespace
-
-void CheckedNumberOrOddballToFloat64::SetValueLocationConstraints() {
-  UseAndClobberRegister(input());
-  DefineAsRegister(this);
-}
-void CheckedNumberOrOddballToFloat64::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register value = ToRegister(input());
-  TryUnboxNumberOrOddball(
-      masm, ToDoubleRegister(result()), value, conversion_type(),
-      __ GetDeoptLabel(this, DeoptimizeReason::kNotANumberOrOddball));
-}
-
-void UncheckedNumberOrOddballToFloat64::SetValueLocationConstraints() {
-  UseAndClobberRegister(input());
-  DefineAsRegister(this);
-}
-void UncheckedNumberOrOddballToFloat64::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register value = ToRegister(input());
-  TryUnboxNumberOrOddball(masm, ToDoubleRegister(result()), value,
-                          conversion_type(), nullptr);
-}
-
-namespace {
-
-void EmitTruncateNumberOrOddballToInt32(
-    MaglevAssembler* masm, Register value, Register result_reg,
-    TaggedToFloat64ConversionType conversion_type, Label* not_a_number) {
-  Label is_not_smi, done;
-  // Check if Smi.
-  __ JumpIfNotSmi(value, &is_not_smi);
-  // If Smi, convert to Int32.
-  __ SmiToInt32(value);
-  __ B(&done);
-  __ Bind(&is_not_smi);
-  JumpToFailIfNotHeapNumberOrOddball(masm, value, conversion_type,
-                                     not_a_number);
-  static_assert(HeapNumber::kValueOffset == Oddball::kToNumberRawOffset);
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  DoubleRegister double_value = temps.AcquireDouble();
-  __ Ldr(double_value, FieldMemOperand(value, HeapNumber::kValueOffset));
-  __ TruncateDoubleToInt32(result_reg, double_value);
-  __ Bind(&done);
-}
-
-}  // namespace
-
-void CheckedTruncateNumberOrOddballToInt32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void CheckedTruncateNumberOrOddballToInt32::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register value = ToRegister(input());
-  Register result_reg = ToRegister(result());
-  DCHECK_EQ(value, result_reg);
-  Label* deopt_label =
-      __ GetDeoptLabel(this, DeoptimizeReason::kNotANumberOrOddball);
-  EmitTruncateNumberOrOddballToInt32(masm, value, result_reg, conversion_type(),
-                                     deopt_label);
-}
-
-void TruncateNumberOrOddballToInt32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void TruncateNumberOrOddballToInt32::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register value = ToRegister(input());
-  Register result_reg = ToRegister(result());
-  DCHECK_EQ(value, result_reg);
-  EmitTruncateNumberOrOddballToInt32(masm, value, result_reg, conversion_type(),
-                                     nullptr);
-}
-
-void IncreaseInterruptBudget::SetValueLocationConstraints() {
-  set_temporaries_needed(1);
-}
-void IncreaseInterruptBudget::GenerateCode(MaglevAssembler* masm,
-                                           const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register feedback_cell = temps.Acquire();
-  Register budget = temps.Acquire().W();
-  __ Ldr(feedback_cell,
-         MemOperand(fp, StandardFrameConstants::kFunctionOffset));
-  __ LoadTaggedField(
-      feedback_cell,
-      FieldMemOperand(feedback_cell, JSFunction::kFeedbackCellOffset));
-  __ Ldr(budget,
-         FieldMemOperand(feedback_cell, FeedbackCell::kInterruptBudgetOffset));
-  __ Add(budget, budget, Immediate(amount()));
-  __ Str(budget,
-         FieldMemOperand(feedback_cell, FeedbackCell::kInterruptBudgetOffset));
-}
-
-namespace {
-
-enum class ReduceInterruptBudgetType { kLoop, kReturn };
+enum class ReduceInterruptBudgetType { kLoop, kReturn };
 
 void HandleInterruptsAndTiering(MaglevAssembler* masm, ZoneLabelRef done,
                                 Node* node, ReduceInterruptBudgetType type,
@@ -1489,90 +692,19 @@ void HandleInterruptsAndTiering(MaglevAssembler* masm, ZoneLabelRef done,
 
   // No pending interrupts. Call into the TieringManager if needed.
   {
-    // Skip the runtime call if the tiering state is kInProgress. The runtime
-    // only performs simple bookkeeping in this case, which we can easily
-    // replicate here in generated code.
-    // TODO(jgruber): Use the correct feedback vector once Maglev inlining is
-    // enabled.
-    Label update_profiler_ticks_and_interrupt_budget;
-    {
-      MaglevAssembler::ScratchRegisterScope temps(masm);
-      Register scratch1 = temps.Acquire();
-      static_assert(kTieringStateInProgressBlocksTierup);
-      __ Move(scratch0, masm->compilation_info()
-                            ->toplevel_compilation_unit()
-                            ->feedback()
-                            .object());
-
-      // If tiering_state is kInProgress, skip the runtime call.
-      __ Ldrh(scratch1.W(),
-              FieldMemOperand(scratch0, FeedbackVector::kFlagsOffset));
-      __ DecodeField<FeedbackVector::TieringStateBits>(scratch1);
-      __ Cmp(scratch1.W(),
-             Immediate(static_cast<int>(TieringState::kInProgress)));
-      __ B(&update_profiler_ticks_and_interrupt_budget, eq);
-
-      // If osr_tiering_state is kInProgress, skip the runtime call.
-      __ Ldrh(scratch1.W(),
-              FieldMemOperand(scratch0, FeedbackVector::kFlagsOffset));
-      __ DecodeField<FeedbackVector::OsrTieringStateBit>(scratch1);
-      __ Cmp(scratch1.W(),
-             Immediate(static_cast<int>(TieringState::kInProgress)));
-      __ B(&update_profiler_ticks_and_interrupt_budget, eq);
-    }
-
-    {
-      SaveRegisterStateForCall save_register_state(masm,
-                                                   node->register_snapshot());
-      Register function = scratch0;
-      __ Ldr(function, MemOperand(fp, StandardFrameConstants::kFunctionOffset));
-      __ Push(function);
-      // Move into kContextRegister after the load into scratch0, just in case
-      // scratch0 happens to be kContextRegister.
-      __ Move(kContextRegister, masm->native_context().object());
-      // Note: must not cause a lazy deopt!
-      __ CallRuntime(Runtime::kBytecodeBudgetInterrupt_Maglev, 1);
-      save_register_state.DefineSafepoint();
-    }
-    __ B(*done);
-
-    __ Bind(&update_profiler_ticks_and_interrupt_budget);
-    {
-      MaglevAssembler::ScratchRegisterScope temps(masm);
-      Register feedback_vector = scratch0;
-      Register ticks = temps.Acquire().W();
-      // We are skipping the call to Runtime::kBytecodeBudgetInterrupt_Maglev
-      // since the tiering state is kInProgress. Perform bookkeeping that would
-      // have been done in the runtime function:
-      __ AssertFeedbackVector(feedback_vector);
-      // FeedbackVector::SaturatingIncrementProfilerTicks.
-      // TODO(jgruber): This isn't saturating and thus we may theoretically
-      // exceed Smi::kMaxValue. But, 1) this is very unlikely since it'd take
-      // quite some time to exhaust the budget that many times; and 2) even an
-      // overflow doesn't hurt us at all.
-      __ Ldr(ticks, FieldMemOperand(feedback_vector,
-                                    FeedbackVector::kProfilerTicksOffset));
-      __ Add(ticks, ticks, Immediate(1));
-      __ Str(ticks, FieldMemOperand(feedback_vector,
-                                    FeedbackVector::kProfilerTicksOffset));
-    }
-
-    // JSFunction::SetInterruptBudget.
-    {
-      MaglevAssembler::ScratchRegisterScope temps(masm);
-      Register feedback_cell = scratch0;
-      Register budget = temps.Acquire().W();
-      __ Ldr(feedback_cell,
-             MemOperand(fp, StandardFrameConstants::kFunctionOffset));
-      __ LoadTaggedField(
-          feedback_cell,
-          FieldMemOperand(feedback_cell, JSFunction::kFeedbackCellOffset));
-      __ Move(budget, v8_flags.interrupt_budget);
-      __ Str(budget, FieldMemOperand(feedback_cell,
-                                     FeedbackCell::kInterruptBudgetOffset));
-    }
-    __ B(*done);
+    SaveRegisterStateForCall save_register_state(masm,
+                                                 node->register_snapshot());
+    Register function = scratch0;
+    __ Ldr(function, MemOperand(fp, StandardFrameConstants::kFunctionOffset));
+    __ Push(function);
+    // Move into kContextRegister after the load into scratch0, just in case
+    // scratch0 happens to be kContextRegister.
+    __ Move(kContextRegister, masm->native_context().object());
+    // Note: must not cause a lazy deopt!
+    __ CallRuntime(Runtime::kBytecodeBudgetInterrupt_Maglev, 1);
+    save_register_state.DefineSafepoint();
   }
+  __ B(*done);
 }
 
 void GenerateReduceInterruptBudget(MaglevAssembler* masm, Node* node,
@@ -1619,625 +751,6 @@ void ReduceInterruptBudgetForReturn::GenerateCode(
                                 amount());
 }
 
-namespace {
-
-template <bool check_detached, typename ResultReg, typename NodeT>
-void GenerateTypedArrayLoad(MaglevAssembler* masm, NodeT* node, Register object,
-                            Register index, ResultReg result_reg,
-                            ElementsKind kind) {
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    MaglevAssembler::ScratchRegisterScope temps(masm);
-    __ IsObjectType(object, JS_TYPED_ARRAY_TYPE);
-    __ Assert(eq, AbortReason::kUnexpectedValue);
-  }
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-
-  if constexpr (check_detached) {
-    __ DeoptIfBufferDetached(object, scratch, node);
-  }
-
-  Register data_pointer = scratch;
-  __ BuildTypedArrayDataPointer(data_pointer, object);
-
-  if constexpr (std::is_same_v<ResultReg, Register>) {
-    if (IsSignedIntTypedArrayElementsKind(kind)) {
-      int element_size = ElementsKindSize(kind);
-      __ Add(data_pointer, data_pointer,
-             Operand(index, LSL, ShiftFromScale(element_size)));
-      __ LoadSignedField(result_reg.W(), MemOperand(data_pointer),
-                         element_size);
-    } else {
-      DCHECK(IsUnsignedIntTypedArrayElementsKind(kind));
-      int element_size = ElementsKindSize(kind);
-      __ Add(data_pointer, data_pointer,
-             Operand(index, LSL, ShiftFromScale(element_size)));
-      __ LoadUnsignedField(result_reg.W(), MemOperand(data_pointer),
-                           element_size);
-    }
-  } else {
-#ifdef DEBUG
-    bool result_reg_is_double = std::is_same_v<ResultReg, DoubleRegister>;
-    DCHECK(result_reg_is_double);
-    DCHECK(IsFloatTypedArrayElementsKind(kind));
-#endif
-    switch (kind) {
-      case FLOAT32_ELEMENTS:
-        __ Add(data_pointer, data_pointer, Operand(index, LSL, 2));
-        __ Ldr(result_reg.S(), MemOperand(data_pointer));
-        __ Fcvt(result_reg, result_reg.S());
-        break;
-      case FLOAT64_ELEMENTS:
-        __ Add(data_pointer, data_pointer, Operand(index, LSL, 3));
-        __ Ldr(result_reg, MemOperand(data_pointer));
-        break;
-      default:
-        UNREACHABLE();
-    }
-  }
-}
-
-template <bool check_detached, typename ValueReg, typename NodeT>
-void GenerateTypedArrayStore(MaglevAssembler* masm, NodeT* node,
-                             Register object, Register index, ValueReg value,
-                             ElementsKind kind) {
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    MaglevAssembler::ScratchRegisterScope temps(masm);
-    __ IsObjectType(object, JS_TYPED_ARRAY_TYPE);
-    __ Assert(eq, AbortReason::kUnexpectedValue);
-  }
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-
-  if constexpr (check_detached) {
-    __ DeoptIfBufferDetached(object, scratch, node);
-  }
-
-  Register data_pointer = scratch;
-  __ BuildTypedArrayDataPointer(data_pointer, object);
-
-  if constexpr (std::is_same_v<ValueReg, Register>) {
-    int element_size = ElementsKindSize(kind);
-    __ Add(data_pointer, data_pointer,
-           Operand(index, LSL, ShiftFromScale(element_size)));
-    __ StoreField(MemOperand(data_pointer), value.W(), element_size);
-  } else {
-#ifdef DEBUG
-    bool value_is_double = std::is_same_v<ValueReg, DoubleRegister>;
-    DCHECK(value_is_double);
-    DCHECK(IsFloatTypedArrayElementsKind(kind));
-#endif
-    switch (kind) {
-      case FLOAT32_ELEMENTS: {
-        DoubleRegister double_scratch = temps.AcquireDouble();
-        __ Fcvt(double_scratch.S(), value);
-        __ Add(data_pointer, data_pointer, Operand(index, LSL, 2));
-        __ Str(double_scratch.S(), MemOperand(data_pointer));
-        break;
-      }
-      case FLOAT64_ELEMENTS:
-        __ Add(data_pointer, data_pointer, Operand(index, LSL, 3));
-        __ Str(value, MemOperand(data_pointer));
-        break;
-      default:
-        UNREACHABLE();
-    }
-  }
-}
-
-}  // namespace
-
-#define DEF_LOAD_TYPED_ARRAY(Name, ResultReg, ToResultReg, check_detached) \
-  void Name::SetValueLocationConstraints() {                               \
-    UseRegister(object_input());                                           \
-    UseRegister(index_input());                                            \
-    DefineAsRegister(this);                                                \
-  }                                                                        \
-  void Name::GenerateCode(MaglevAssembler* masm,                           \
-                          const ProcessingState& state) {                  \
-    Register object = ToRegister(object_input());                          \
-    Register index = ToRegister(index_input());                            \
-    ResultReg result_reg = ToResultReg(result());                          \
-                                                                           \
-    GenerateTypedArrayLoad<check_detached>(masm, this, object, index,      \
-                                           result_reg, elements_kind_);    \
-  }
-
-DEF_LOAD_TYPED_ARRAY(LoadSignedIntTypedArrayElement, Register, ToRegister,
-                     /*check_detached*/ true)
-DEF_LOAD_TYPED_ARRAY(LoadSignedIntTypedArrayElementNoDeopt, Register,
-                     ToRegister,
-                     /*check_detached*/ false)
-
-DEF_LOAD_TYPED_ARRAY(LoadUnsignedIntTypedArrayElement, Register, ToRegister,
-                     /*check_detached*/ true)
-DEF_LOAD_TYPED_ARRAY(LoadUnsignedIntTypedArrayElementNoDeopt, Register,
-                     ToRegister,
-                     /*check_detached*/ false)
-
-DEF_LOAD_TYPED_ARRAY(LoadDoubleTypedArrayElement, DoubleRegister,
-                     ToDoubleRegister,
-                     /*check_detached*/ true)
-DEF_LOAD_TYPED_ARRAY(LoadDoubleTypedArrayElementNoDeopt, DoubleRegister,
-                     ToDoubleRegister, /*check_detached*/ false)
-#undef DEF_LOAD_TYPED_ARRAY
-
-#define DEF_STORE_TYPED_ARRAY(Name, ValueReg, ToValueReg, check_detached)     \
-  void Name::SetValueLocationConstraints() {                                  \
-    UseRegister(object_input());                                              \
-    UseRegister(index_input());                                               \
-    UseRegister(value_input());                                               \
-  }                                                                           \
-  void Name::GenerateCode(MaglevAssembler* masm,                              \
-                          const ProcessingState& state) {                     \
-    Register object = ToRegister(object_input());                             \
-    Register index = ToRegister(index_input());                               \
-    ValueReg value = ToValueReg(value_input());                               \
-                                                                              \
-    GenerateTypedArrayStore<check_detached>(masm, this, object, index, value, \
-                                            elements_kind_);                  \
-  }
-
-DEF_STORE_TYPED_ARRAY(StoreIntTypedArrayElement, Register, ToRegister,
-                      /*check_detached*/ true)
-DEF_STORE_TYPED_ARRAY(StoreIntTypedArrayElementNoDeopt, Register, ToRegister,
-                      /*check_detached*/ false)
-
-DEF_STORE_TYPED_ARRAY(StoreDoubleTypedArrayElement, DoubleRegister,
-                      ToDoubleRegister,
-                      /*check_detached*/ true)
-DEF_STORE_TYPED_ARRAY(StoreDoubleTypedArrayElementNoDeopt, DoubleRegister,
-                      ToDoubleRegister, /*check_detached*/ false)
-
-#undef DEF_STORE_TYPED_ARRAY
-
-void LoadFixedArrayElement::SetValueLocationConstraints() {
-  UseRegister(elements_input());
-  UseRegister(index_input());
-  DefineAsRegister(this);
-}
-void LoadFixedArrayElement::GenerateCode(MaglevAssembler* masm,
-                                         const ProcessingState& state) {
-  Register elements = ToRegister(elements_input());
-  Register index = ToRegister(index_input());
-  if (v8_flags.debug_code) {
-    __ AssertNotSmi(elements);
-    __ IsObjectType(elements, FIXED_ARRAY_TYPE);
-    __ Assert(eq, AbortReason::kUnexpectedValue);
-  }
-  Register result_reg = ToRegister(result());
-  __ Add(result_reg, elements, Operand(index, LSL, kTaggedSizeLog2));
-  if (this->decompresses_tagged_result()) {
-    __ DecompressTagged(result_reg,
-                        FieldMemOperand(result_reg, FixedArray::kHeaderSize));
-  } else {
-    __ Ldr(result_reg.W(),
-           FieldMemOperand(result_reg, FixedArray::kHeaderSize));
-  }
-}
-
-void LoadFixedDoubleArrayElement::SetValueLocationConstraints() {
-  UseAndClobberRegister(elements_input());
-  UseRegister(index_input());
-  DefineAsRegister(this);
-}
-void LoadFixedDoubleArrayElement::GenerateCode(MaglevAssembler* masm,
-                                               const ProcessingState& state) {
-  Register elements = ToRegister(elements_input());
-  Register index = ToRegister(index_input());
-  if (v8_flags.debug_code) {
-    __ AssertNotSmi(elements);
-    __ IsObjectType(elements, FIXED_DOUBLE_ARRAY_TYPE);
-    __ Assert(eq, AbortReason::kUnexpectedValue);
-  }
-  __ Add(elements, elements, Operand(index, LSL, kDoubleSizeLog2));
-  __ Ldr(ToDoubleRegister(result()),
-         FieldMemOperand(elements, FixedArray::kHeaderSize));
-}
-
-void StoreFixedDoubleArrayElement::SetValueLocationConstraints() {
-  UseRegister(elements_input());
-  UseRegister(index_input());
-  UseRegister(value_input());
-  set_temporaries_needed(1);
-}
-void StoreFixedDoubleArrayElement::GenerateCode(MaglevAssembler* masm,
-                                                const ProcessingState& state) {
-  Register elements = ToRegister(elements_input());
-  Register index = ToRegister(index_input());
-  DoubleRegister value = ToDoubleRegister(value_input());
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-  if (v8_flags.debug_code) {
-    __ AssertNotSmi(elements);
-    __ IsObjectType(elements, FIXED_DOUBLE_ARRAY_TYPE);
-    __ Assert(eq, AbortReason::kUnexpectedValue);
-  }
-  __ Add(scratch, elements, Operand(index, LSL, kDoubleSizeLog2));
-  __ Str(value, FieldMemOperand(scratch, FixedArray::kHeaderSize));
-}
-
-void StoreDoubleField::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(value_input());
-}
-void StoreDoubleField::GenerateCode(MaglevAssembler* masm,
-                                    const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  DoubleRegister value = ToDoubleRegister(value_input());
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register tmp = temps.Acquire();
-
-  __ AssertNotSmi(object);
-  __ DecompressTagged(tmp, FieldMemOperand(object, offset()));
-  __ AssertNotSmi(tmp);
-  __ Move(FieldMemOperand(tmp, HeapNumber::kValueOffset), value);
-}
-
-void LoadSignedIntDataViewElement::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(index_input());
-  if (is_little_endian_constant() ||
-      type_ == ExternalArrayType::kExternalInt8Array) {
-    UseAny(is_little_endian_input());
-  } else {
-    UseRegister(is_little_endian_input());
-  }
-  DefineAsRegister(this);
-}
-void LoadSignedIntDataViewElement::GenerateCode(MaglevAssembler* masm,
-                                                const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
-  Register result_reg = ToRegister(result());
-
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CompareObjectType(object, JS_DATA_VIEW_TYPE);
-    __ Assert(hs, AbortReason::kUnexpectedValue);
-  }
-
-  int element_size = ExternalArrayElementSize(type_);
-
-  // Load data pointer.
-  {
-    MaglevAssembler::ScratchRegisterScope temps(masm);
-    Register data_pointer = temps.Acquire();
-    __ LoadExternalPointerField(
-        data_pointer, FieldMemOperand(object, JSDataView::kDataPointerOffset));
-
-    __ LoadSignedField(result_reg.W(), MemOperand(data_pointer, index),
-                       element_size);
-  }
-
-  // We ignore little endian argument if type is a byte size.
-  if (type_ != ExternalArrayType::kExternalInt8Array) {
-    if (is_little_endian_constant()) {
-      if (!FromConstantToBool(masm, is_little_endian_input().node())) {
-        __ ReverseByteOrder(result_reg, element_size);
-      }
-    } else {
-      ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
-      __ ToBoolean(ToRegister(is_little_endian_input()), is_little_endian,
-                   is_big_endian, false);
-      __ Bind(*is_big_endian);
-      __ ReverseByteOrder(result_reg, element_size);
-      __ Bind(*is_little_endian);
-      // arm64 is little endian.
-      static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
-    }
-  }
-}
-
-void StoreSignedIntDataViewElement::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(index_input());
-  if (ExternalArrayElementSize(type_) > 1) {
-    UseAndClobberRegister(value_input());
-  } else {
-    UseRegister(value_input());
-  }
-  if (is_little_endian_constant() ||
-      type_ == ExternalArrayType::kExternalInt8Array) {
-    UseAny(is_little_endian_input());
-  } else {
-    UseRegister(is_little_endian_input());
-  }
-}
-void StoreSignedIntDataViewElement::GenerateCode(MaglevAssembler* masm,
-                                                 const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
-  Register value = ToRegister(value_input());
-
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CompareObjectType(object, JS_DATA_VIEW_TYPE);
-    __ Assert(hs, AbortReason::kUnexpectedValue);
-  }
-
-  int element_size = ExternalArrayElementSize(type_);
-
-  // We ignore little endian argument if type is a byte size.
-  if (element_size > 1) {
-    if (is_little_endian_constant()) {
-      if (!FromConstantToBool(masm, is_little_endian_input().node())) {
-        __ ReverseByteOrder(value, element_size);
-      }
-    } else {
-      ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
-      __ ToBoolean(ToRegister(is_little_endian_input()), is_little_endian,
-                   is_big_endian, false);
-      __ Bind(*is_big_endian);
-      __ ReverseByteOrder(value, element_size);
-      __ Bind(*is_little_endian);
-      // arm64 is little endian.
-      static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
-    }
-  }
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register data_pointer = temps.Acquire();
-  __ LoadExternalPointerField(
-      data_pointer, FieldMemOperand(object, JSDataView::kDataPointerOffset));
-  __ StoreField(MemOperand(data_pointer, index), value.W(), element_size);
-}
-
-void LoadDoubleDataViewElement::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(index_input());
-  if (is_little_endian_constant()) {
-    UseAny(is_little_endian_input());
-  } else {
-    UseRegister(is_little_endian_input());
-  }
-  set_temporaries_needed(1);
-  DefineAsRegister(this);
-}
-void LoadDoubleDataViewElement::GenerateCode(MaglevAssembler* masm,
-                                             const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
-  DoubleRegister result_reg = ToDoubleRegister(result());
-  Register data_pointer = temps.Acquire();
-
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CompareObjectType(object, JS_DATA_VIEW_TYPE);
-    __ Assert(hs, AbortReason::kUnexpectedValue);
-  }
-
-  // Load data pointer.
-  __ LoadExternalPointerField(
-      data_pointer, FieldMemOperand(object, JSDataView::kDataPointerOffset));
-
-  if (is_little_endian_constant()) {
-    if (FromConstantToBool(masm, is_little_endian_input().node())) {
-      __ Move(result_reg, MemOperand(data_pointer, index));
-    } else {
-      MaglevAssembler::ScratchRegisterScope temps(masm);
-      Register scratch = temps.Acquire();
-      __ Move(scratch, MemOperand(data_pointer, index));
-      __ Rev(scratch, scratch);
-      __ Fmov(result_reg, scratch);
-    }
-  } else {
-    Label done;
-    ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
-    // TODO(leszeks): We're likely to be calling this on an existing boolean --
-    // maybe that's a case we should fast-path here and re-use that boolean
-    // value?
-    __ ToBoolean(ToRegister(is_little_endian_input()), is_little_endian,
-                 is_big_endian, true);
-    // arm64 is little endian.
-    static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
-    __ Bind(*is_little_endian);
-    __ Move(result_reg, MemOperand(data_pointer, index));
-    __ B(&done);
-    // We should swap the bytes if big endian.
-    __ Bind(*is_big_endian);
-    MaglevAssembler::ScratchRegisterScope temps(masm);
-    Register scratch = temps.Acquire();
-    __ Move(scratch, MemOperand(data_pointer, index));
-    __ Rev(scratch, scratch);
-    __ Fmov(result_reg, scratch);
-    __ Bind(&done);
-  }
-}
-
-void StoreDoubleDataViewElement::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(index_input());
-  UseRegister(value_input());
-  if (is_little_endian_constant()) {
-    UseAny(is_little_endian_input());
-  } else {
-    UseRegister(is_little_endian_input());
-  }
-  set_temporaries_needed(1);
-}
-void StoreDoubleDataViewElement::GenerateCode(MaglevAssembler* masm,
-                                              const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
-  DoubleRegister value = ToDoubleRegister(value_input());
-  Register data_pointer = temps.Acquire();
-
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CompareObjectType(object, JS_DATA_VIEW_TYPE);
-    __ Assert(hs, AbortReason::kUnexpectedValue);
-  }
-
-  // Load data pointer.
-  __ LoadExternalPointerField(
-      data_pointer, FieldMemOperand(object, JSDataView::kDataPointerOffset));
-
-  if (is_little_endian_constant()) {
-    if (FromConstantToBool(masm, is_little_endian_input().node())) {
-      __ Str(value, MemOperand(data_pointer, index));
-    } else {
-      MaglevAssembler::ScratchRegisterScope temps(masm);
-      Register scratch = temps.Acquire();
-      __ Fmov(scratch, value);
-      __ Rev(scratch, scratch);
-      __ Str(scratch, MemOperand(data_pointer, index));
-    }
-  } else {
-    Label done;
-    ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
-    // TODO(leszeks): We're likely to be calling this on an existing boolean --
-    // maybe that's a case we should fast-path here and re-use that boolean
-    // value?
-    __ ToBoolean(ToRegister(is_little_endian_input()), is_little_endian,
-                 is_big_endian, true);
-    // arm64 is little endian.
-    static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
-    __ Bind(*is_little_endian);
-    __ Str(value, MemOperand(data_pointer, index));
-    __ B(&done);
-    // We should swap the bytes if big endian.
-    __ Bind(*is_big_endian);
-    MaglevAssembler::ScratchRegisterScope temps(masm);
-    Register scratch = temps.Acquire();
-    __ Fmov(scratch, value);
-    __ Rev(scratch, scratch);
-    __ Str(scratch, MemOperand(data_pointer, index));
-    __ Bind(&done);
-  }
-}
-
-void SetPendingMessage::SetValueLocationConstraints() {
-  UseRegister(value());
-  DefineAsRegister(this);
-}
-
-void SetPendingMessage::GenerateCode(MaglevAssembler* masm,
-                                     const ProcessingState& state) {
-  Register new_message = ToRegister(value());
-  Register return_value = ToRegister(result());
-
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch0 = temps.Acquire();
-  MemOperand pending_message_operand = __ ExternalReferenceAsOperand(
-      ExternalReference::address_of_pending_message(masm->isolate()), scratch0);
-
-  if (new_message != return_value) {
-    __ Ldr(return_value, pending_message_operand);
-    __ Str(new_message, pending_message_operand);
-  } else {
-    Register scratch1 = temps.Acquire();
-    __ Ldr(scratch1, pending_message_operand);
-    __ Str(new_message, pending_message_operand);
-    __ Move(return_value, scratch1);
-  }
-}
-
-void TestUndetectable::SetValueLocationConstraints() {
-  UseRegister(value());
-  DefineAsRegister(this);
-}
-void TestUndetectable::GenerateCode(MaglevAssembler* masm,
-                                    const ProcessingState& state) {
-  Register object = ToRegister(value());
-  Register return_value = ToRegister(result());
-
-  Label return_false, done;
-  __ JumpIfSmi(object, &return_false);
-  {
-    // For heap objects, check the map's undetectable bit.
-    MaglevAssembler::ScratchRegisterScope temps(masm);
-    Register scratch = temps.Acquire();
-    __ LoadMap(scratch, object);
-    __ Ldr(scratch.W(), FieldMemOperand(scratch, Map::kBitFieldOffset));
-    __ TestAndBranchIfAllClear(
-        scratch.W(), Map::Bits1::IsUndetectableBit::kMask, &return_false);
-  }
-
-  __ LoadRoot(return_value, RootIndex::kTrueValue);
-  __ B(&done);
-
-  __ Bind(&return_false);
-  __ LoadRoot(return_value, RootIndex::kFalseValue);
-
-  __ Bind(&done);
-}
-
-int ThrowIfNotSuperConstructor::MaxCallStackArgs() const { return 2; }
-void ThrowIfNotSuperConstructor::SetValueLocationConstraints() {
-  UseRegister(constructor());
-  UseRegister(function());
-}
-void ThrowIfNotSuperConstructor::GenerateCode(MaglevAssembler* masm,
-                                              const ProcessingState& state) {
-  Label* deferred_abort = __ MakeDeferredCode(
-      [](MaglevAssembler* masm, ThrowIfNotSuperConstructor* node) {
-        __ Push(ToRegister(node->constructor()), ToRegister(node->function()));
-        __ Move(kContextRegister, masm->native_context().object());
-        __ CallRuntime(Runtime::kThrowNotSuperConstructor, 2);
-        masm->DefineExceptionHandlerAndLazyDeoptPoint(node);
-        __ Abort(AbortReason::kUnexpectedReturnFromThrow);
-      },
-      this);
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-  __ LoadMap(scratch, ToRegister(constructor()));
-  __ Ldr(scratch, FieldMemOperand(scratch, Map::kBitFieldOffset));
-  __ TestAndBranchIfAllClear(scratch, Map::Bits1::IsConstructorBit::kMask,
-                             deferred_abort);
-}
-
-int FunctionEntryStackCheck::MaxCallStackArgs() const { return 1; }
-void FunctionEntryStackCheck::SetValueLocationConstraints() {
-  set_temporaries_needed(2);
-}
-void FunctionEntryStackCheck::GenerateCode(MaglevAssembler* masm,
-                                           const ProcessingState& state) {
-  // Stack check. This folds the checks for both the interrupt stack limit
-  // check and the real stack limit into one by just checking for the
-  // interrupt limit. The interrupt limit is either equal to the real
-  // stack limit or tighter. By ensuring we have space until that limit
-  // after building the frame we can quickly precheck both at once.
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  const int stack_check_offset = masm->code_gen_state()->stack_check_offset();
-  Register stack_cmp_reg = sp;
-  if (stack_check_offset > kStackLimitSlackForDeoptimizationInBytes) {
-    stack_cmp_reg = temps.Acquire();
-    __ Sub(stack_cmp_reg, sp, stack_check_offset);
-  }
-  Register interrupt_stack_limit = temps.Acquire();
-  __ LoadStackLimit(interrupt_stack_limit,
-                    StackLimitKind::kInterruptStackLimit);
-  __ Cmp(stack_cmp_reg, interrupt_stack_limit);
-
-  ZoneLabelRef deferred_call_stack_guard_return(masm);
-  __ JumpToDeferredIf(
-      lo,
-      [](MaglevAssembler* masm, FunctionEntryStackCheck* node,
-         ZoneLabelRef done, int stack_check_offset) {
-        ASM_CODE_COMMENT_STRING(masm, "Stack/interrupt call");
-        {
-          SaveRegisterStateForCall save_register_state(
-              masm, node->register_snapshot());
-          // Push the frame size
-          __ Push(Smi::FromInt(stack_check_offset));
-          __ CallRuntime(Runtime::kStackGuardWithGap, 1);
-          save_register_state.DefineSafepointWithLazyDeopt(
-              node->lazy_deopt_info());
-        }
-        __ B(*done);
-      },
-      this, deferred_call_stack_guard_return, stack_check_offset);
-  __ bind(*deferred_call_stack_guard_return);
-}
-
 // ---
 // Control nodes
 // ---
@@ -2281,24 +794,6 @@ void Return::GenerateCode(MaglevAssembler* masm, const ProcessingState& state) {
   __ Ret();
 }
 
-void BranchIfFloat64Compare::SetValueLocationConstraints() {
-  UseRegister(left_input());
-  UseRegister(right_input());
-}
-void BranchIfFloat64Compare::GenerateCode(MaglevAssembler* masm,
-                                          const ProcessingState& state) {
-  DoubleRegister left = ToDoubleRegister(left_input());
-  DoubleRegister right = ToDoubleRegister(right_input());
-  __ Fcmp(left, right);
-  if (jump_mode_if_nan_ == JumpModeIfNaN::kJumpToTrue) {
-    __ JumpIf(vs, if_true()->label());
-  } else {
-    __ JumpIf(vs, if_false()->label());
-  }
-  __ Branch(ConditionFor(operation_), if_true(), if_false(),
-            state.next_block());
-}
-
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/maglev/maglev-assembler-inl.h b/deps/v8/src/maglev/maglev-assembler-inl.h
index 44b3b75d340942..1edf8bd1901a07 100644
--- a/deps/v8/src/maglev/maglev-assembler-inl.h
+++ b/deps/v8/src/maglev/maglev-assembler-inl.h
@@ -5,11 +5,17 @@
 #ifndef V8_MAGLEV_MAGLEV_ASSEMBLER_INL_H_
 #define V8_MAGLEV_MAGLEV_ASSEMBLER_INL_H_
 
+#include <algorithm>
 #include <type_traits>
 
+#include "src/base/iterator.h"
+#include "src/base/template-utils.h"
+#include "src/codegen/machine-type.h"
 #include "src/maglev/maglev-assembler.h"
 
-#ifdef V8_TARGET_ARCH_ARM64
+#ifdef V8_TARGET_ARCH_ARM
+#include "src/maglev/arm/maglev-assembler-arm-inl.h"
+#elif V8_TARGET_ARCH_ARM64
 #include "src/maglev/arm64/maglev-assembler-arm64-inl.h"
 #elif V8_TARGET_ARCH_X64
 #include "src/maglev/x64/maglev-assembler-x64-inl.h"
@@ -81,6 +87,10 @@ struct CopyForDeferredHelper<LazyDeoptInfo*>
 template <>
 struct CopyForDeferredHelper<ZoneLabelRef>
     : public CopyForDeferredByValue<ZoneLabelRef> {};
+// MapCompare is copied by value.
+template <>
+struct CopyForDeferredHelper<MapCompare>
+    : public CopyForDeferredByValue<MapCompare> {};
 // RegList are copied by value.
 template <>
 struct CopyForDeferredHelper<RegList> : public CopyForDeferredByValue<RegList> {
@@ -166,15 +176,35 @@ class DeferredCodeInfoImpl final : public DeferredCodeInfo {
     MaglevAssembler::ScratchRegisterScope scratch_scope(masm);
     scratch_scope.SetAvailable(general_temporaries_);
     scratch_scope.SetAvailableDouble(double_temporaries_);
+#ifdef DEBUG
+    masm->set_allow_call(allow_call_);
+    masm->set_allow_deferred_call(allow_call_);
+    masm->set_allow_allocate(allow_allocate_);
+#endif  // DEBUG
     std::apply(function,
                std::tuple_cat(std::make_tuple(masm), std::move(args)));
+#ifdef DEBUG
+    masm->set_allow_call(false);
+    masm->set_allow_deferred_call(false);
+    masm->set_allow_allocate(false);
+#endif  // DEBUG
   }
 
+#ifdef DEBUG
+  void set_allow_call(bool value) { allow_call_ = value; }
+  void set_allow_allocate(bool value) { allow_allocate_ = value; }
+#endif  // DEBUG
+
  private:
   FunctionPointer function;
   Tuple args;
   RegList general_temporaries_;
   DoubleRegList double_temporaries_;
+
+#ifdef DEBUG
+  bool allow_call_ = false;
+  bool allow_allocate_ = false;
+#endif  // DEBUG
 };
 
 }  // namespace detail
@@ -200,6 +230,11 @@ inline Label* MaglevAssembler::MakeDeferredCode(Function&& deferred_code_gen,
           scratch_scope.AvailableDouble(), deferred_code_gen,
           std::forward<Args>(args)...);
 
+#ifdef DEBUG
+  deferred_code->set_allow_call(allow_deferred_call_);
+  deferred_code->set_allow_allocate(allow_allocate_);
+#endif  // DEBUG
+
   code_gen_state()->PushDeferredCode(deferred_code);
   return &deferred_code->deferred_code_label;
 }
@@ -282,6 +317,447 @@ inline void MaglevAssembler::LoadTaggedSignedField(Register result,
   MacroAssembler::LoadTaggedField(result, FieldMemOperand(object, offset));
 }
 
+inline void MaglevAssembler::LoadAndUntagTaggedSignedField(Register result,
+                                                           Register object,
+                                                           int offset) {
+  MacroAssembler::SmiUntagField(result, FieldMemOperand(object, offset));
+}
+
+namespace detail {
+
+#ifdef DEBUG
+inline bool ClobberedBy(RegList written_registers, Register reg) {
+  return written_registers.has(reg);
+}
+inline bool ClobberedBy(RegList written_registers, DoubleRegister reg) {
+  return false;
+}
+inline bool ClobberedBy(RegList written_registers, Handle<Object> handle) {
+  return false;
+}
+inline bool ClobberedBy(RegList written_registers, Tagged<Smi> smi) {
+  return false;
+}
+inline bool ClobberedBy(RegList written_registers, Tagged<TaggedIndex> index) {
+  return false;
+}
+inline bool ClobberedBy(RegList written_registers, int32_t imm) {
+  return false;
+}
+inline bool ClobberedBy(RegList written_registers, RootIndex index) {
+  return false;
+}
+inline bool ClobberedBy(RegList written_registers, const Input& input) {
+  if (!input.IsGeneralRegister()) return false;
+  return ClobberedBy(written_registers, input.AssignedGeneralRegister());
+}
+
+inline bool ClobberedBy(DoubleRegList written_registers, Register reg) {
+  return false;
+}
+inline bool ClobberedBy(DoubleRegList written_registers, DoubleRegister reg) {
+  return written_registers.has(reg);
+}
+inline bool ClobberedBy(DoubleRegList written_registers,
+                        Handle<Object> handle) {
+  return false;
+}
+inline bool ClobberedBy(DoubleRegList written_registers, Tagged<Smi> smi) {
+  return false;
+}
+inline bool ClobberedBy(DoubleRegList written_registers,
+                        Tagged<TaggedIndex> index) {
+  return false;
+}
+inline bool ClobberedBy(DoubleRegList written_registers, int32_t imm) {
+  return false;
+}
+inline bool ClobberedBy(DoubleRegList written_registers, RootIndex index) {
+  return false;
+}
+inline bool ClobberedBy(DoubleRegList written_registers, const Input& input) {
+  if (!input.IsDoubleRegister()) return false;
+  return ClobberedBy(written_registers, input.AssignedDoubleRegister());
+}
+
+// We don't know what's inside machine registers or operands, so assume they
+// match.
+inline bool MachineTypeMatches(MachineType type, Register reg) {
+  return !IsFloatingPoint(type.representation());
+}
+inline bool MachineTypeMatches(MachineType type, DoubleRegister reg) {
+  return IsFloatingPoint(type.representation());
+}
+inline bool MachineTypeMatches(MachineType type, MemOperand reg) {
+  return true;
+}
+inline bool MachineTypeMatches(MachineType type, Handle<HeapObject> handle) {
+  return type.IsTagged() && !type.IsTaggedSigned();
+}
+inline bool MachineTypeMatches(MachineType type, Tagged<Smi> smi) {
+  return type.IsTagged() && !type.IsTaggedPointer();
+}
+inline bool MachineTypeMatches(MachineType type, Tagged<TaggedIndex> index) {
+  // TaggedIndex doesn't have a separate type, so check for the same type as for
+  // Smis.
+  return type.IsTagged() && !type.IsTaggedPointer();
+}
+inline bool MachineTypeMatches(MachineType type, int32_t imm) {
+  // 32-bit immediates can be used for 64-bit params -- they'll be
+  // zero-extended.
+  return type.representation() == MachineRepresentation::kWord32 ||
+         type.representation() == MachineRepresentation::kWord64;
+}
+inline bool MachineTypeMatches(MachineType type, RootIndex index) {
+  return type.IsTagged() && !type.IsTaggedSigned();
+}
+inline bool MachineTypeMatches(MachineType type, const Input& input) {
+  if (type.representation() == input.node()->GetMachineRepresentation()) {
+    return true;
+  }
+  if (type.IsTagged()) {
+    return input.node()->is_tagged();
+  }
+  return false;
+}
+
+template <typename Descriptor, typename Arg>
+void CheckArg(MaglevAssembler* masm, Arg& arg, int& i) {
+  if (i >= Descriptor::GetParameterCount()) {
+    CHECK(Descriptor::AllowVarArgs());
+  }
+  CHECK(MachineTypeMatches(Descriptor::GetParameterType(i), arg));
+  ++i;
+}
+
+template <typename Descriptor, typename Iterator>
+void CheckArg(MaglevAssembler* masm,
+              const base::iterator_range<Iterator>& range, int& i) {
+  for (auto it = range.begin(), end = range.end(); it != end; ++it, ++i) {
+    if (i >= Descriptor::GetParameterCount()) {
+      CHECK(Descriptor::AllowVarArgs());
+    }
+    CHECK(MachineTypeMatches(Descriptor::GetParameterType(i), *it));
+  }
+}
+
+template <typename Descriptor, typename... Args>
+void CheckArgs(MaglevAssembler* masm, const std::tuple<Args...>& args) {
+  int i = 0;
+  base::tuple_for_each(args,
+                       [&](auto&& arg) { CheckArg<Descriptor>(masm, arg, i); });
+  if (Descriptor::AllowVarArgs()) {
+    CHECK_GE(i, Descriptor::GetParameterCount());
+  } else {
+    CHECK_EQ(i, Descriptor::GetParameterCount());
+  }
+}
+
+#else  // DEBUG
+
+template <typename Descriptor, typename... Args>
+void CheckArgs(Args&&... args) {}
+
+#endif  // DEBUG
+
+template <typename Descriptor, typename... Args>
+void PushArgumentsForBuiltin(MaglevAssembler* masm, std::tuple<Args...> args) {
+  std::apply(
+      [&](auto&&... stack_args) {
+        if (Descriptor::kStackArgumentOrder == StackArgumentOrder::kDefault) {
+          masm->Push(std::forward<decltype(stack_args)>(stack_args)...);
+        } else {
+          masm->PushReverse(std::forward<decltype(stack_args)>(stack_args)...);
+        }
+      },
+      args);
+}
+
+template <typename Descriptor>
+void PushArgumentsForBuiltin(MaglevAssembler* masm, std::tuple<> empty_args) {}
+
+template <Builtin kBuiltin, typename... Args>
+void MoveArgumentsForBuiltin(MaglevAssembler* masm, Args&&... args) {
+  using Descriptor = typename CallInterfaceDescriptorFor<kBuiltin>::type;
+
+  // Put the args into a tuple for easier manipulation.
+  std::tuple<Args&&...> args_tuple{std::forward<Args>(args)...};
+
+  // If there is a context, the first argument is the context parameter. Use
+  // the remaining args as the actual arguments. We pass the context first
+  // instead of last to avoid ambiguity around dealing with on-stack
+  // arguments.
+  constexpr size_t context_args = Descriptor::HasContextParameter() ? 1 : 0;
+  static_assert(context_args <= std::tuple_size_v<decltype(args_tuple)>,
+                "Not enough arguments passed in to builtin (are you missing a "
+                "context argument?)");
+  auto args_tuple_without_context = base::tuple_drop<context_args>(args_tuple);
+  CheckArgs<Descriptor>(masm, args_tuple_without_context);
+
+  // Split args into register and stack args.
+  static_assert(Descriptor::GetRegisterParameterCount() <=
+                    std::tuple_size_v<decltype(args_tuple_without_context)>,
+                "Not enough arguments passed in to builtin (are you missing a "
+                "context argument?)");
+  auto register_args =
+      base::tuple_head<Descriptor::GetRegisterParameterCount()>(
+          args_tuple_without_context);
+  auto stack_args = base::tuple_drop<Descriptor::GetRegisterParameterCount()>(
+      args_tuple_without_context);
+
+  // Split stack args into fixed and variable.
+  static_assert(
+      Descriptor::GetStackParameterCount() <=
+          std::tuple_size_v<decltype(stack_args)>,
+      "Not enough stack arguments passed in to builtin (are you missing a "
+      "context argument?)");
+  auto fixed_stack_args =
+      base::tuple_head<Descriptor::GetStackParameterCount()>(stack_args);
+  auto vararg_stack_args =
+      base::tuple_drop<Descriptor::GetStackParameterCount()>(stack_args);
+
+  if constexpr (!Descriptor::AllowVarArgs()) {
+    static_assert(std::tuple_size_v<decltype(vararg_stack_args)> == 0,
+                  "Too many arguments passed in to builtin that expects no "
+                  "vararg stack arguments");
+  }
+
+  // First push stack arguments (if any), since some of these may be in
+  // registers and we don't want to clobber them. This supports any thing
+  // `masm->Push` supports, including iterator ranges, so the tuple size may be
+  // smaller than the number of arguments actually pushed. We push fixed and
+  // vararg stack arguments separately, so that there's an appropriate amount
+  // of padding between them.
+  if (Descriptor::kStackArgumentOrder == StackArgumentOrder::kDefault) {
+    PushArgumentsForBuiltin<Descriptor>(
+        masm, std::forward<decltype(fixed_stack_args)>(fixed_stack_args));
+    PushArgumentsForBuiltin<Descriptor>(
+        masm, std::forward<decltype(vararg_stack_args)>(vararg_stack_args));
+  } else {
+    PushArgumentsForBuiltin<Descriptor>(
+        masm, std::forward<decltype(vararg_stack_args)>(vararg_stack_args));
+    PushArgumentsForBuiltin<Descriptor>(
+        masm, std::forward<decltype(fixed_stack_args)>(fixed_stack_args));
+  }
+
+// Then, set register arguments.
+// TODO(leszeks): Use the parallel move helper to do register moves, instead
+// of detecting clobbering.
+#ifdef DEBUG
+  RegList written_registers = {};
+  DoubleRegList written_double_registers = {};
+#endif  // DEBUG
+
+  base::tuple_for_each_with_index(register_args, [&](auto&& arg, auto index) {
+    using Arg = decltype(arg);
+    static_assert(index < Descriptor::GetRegisterParameterCount());
+
+    // Make sure the argument wasn't clobbered by any previous write.
+    DCHECK(!ClobberedBy(written_registers, arg));
+    DCHECK(!ClobberedBy(written_double_registers, arg));
+
+    static constexpr bool use_double_register =
+        IsFloatingPoint(Descriptor::GetParameterType(index).representation());
+    if constexpr (use_double_register) {
+      DoubleRegister target = Descriptor::GetDoubleRegisterParameter(index);
+      if constexpr (std::is_same_v<Input, std::decay_t<Arg>>) {
+        DCHECK_EQ(target, arg.AssignedDoubleRegister());
+        USE(target);
+      } else {
+        masm->Move(target, std::forward<Arg>(arg));
+      }
+#ifdef DEBUG
+      written_double_registers.set(target);
+#endif  // DEBUG
+    } else {
+      Register target = Descriptor::GetRegisterParameter(index);
+      if constexpr (std::is_same_v<Input, std::decay_t<Arg>>) {
+        DCHECK_EQ(target, arg.AssignedGeneralRegister());
+        USE(target);
+      } else {
+        masm->Move(target, std::forward<Arg>(arg));
+      }
+#ifdef DEBUG
+      written_registers.set(target);
+#endif  // DEBUG
+    }
+
+    // TODO(leszeks): Support iterator range for register args.
+  });
+
+  // Set the context last (to avoid clobbering).
+  if constexpr (Descriptor::HasContextParameter()) {
+    auto&& context = std::get<0>(args_tuple);
+    DCHECK(!ClobberedBy(written_registers, context));
+    DCHECK(!ClobberedBy(written_double_registers, context));
+    DCHECK(MachineTypeMatches(MachineType::AnyTagged(), context));
+
+    if constexpr (std::is_same_v<Input, std::decay_t<decltype(context)>>) {
+      DCHECK_EQ(Descriptor::ContextRegister(),
+                context.AssignedGeneralRegister());
+    } else {
+      // Don't allow raw Register here, force materialisation from a constant.
+      // This is because setting parameters could have clobbered the register.
+      // TODO(leszeks): Include the context register in the parallel moves
+      // described above.
+      static_assert(!std::is_same_v<Register, std::decay_t<decltype(context)>>);
+      masm->Move(Descriptor::ContextRegister(), context);
+    }
+  }
+}
+
+}  // namespace detail
+
+inline void MaglevAssembler::CallBuiltin(Builtin builtin) {
+  // Special case allowing calls to DoubleToI, which takes care to preserve all
+  // registers and therefore doesn't require special spill handling.
+  DCHECK(allow_call() || builtin == Builtin::kDoubleToI);
+
+  // Temporaries have to be reset before calling CallBuiltin, in case it uses
+  // temporaries that alias register parameters.
+  ScratchRegisterScope reset_temps(this);
+  reset_temps.ResetToDefault();
+
+  // Make sure that none of the register parameters alias the default
+  // temporaries.
+#ifdef DEBUG
+  CallInterfaceDescriptor descriptor =
+      Builtins::CallInterfaceDescriptorFor(builtin);
+  for (int i = 0; i < descriptor.GetRegisterParameterCount(); ++i) {
+    DCHECK(!reset_temps.Available().has(descriptor.GetRegisterParameter(i)));
+  }
+#endif
+
+  MacroAssembler::CallBuiltin(builtin);
+}
+
+template <Builtin kBuiltin, typename... Args>
+inline void MaglevAssembler::CallBuiltin(Args&&... args) {
+  ASM_CODE_COMMENT(this);
+  detail::MoveArgumentsForBuiltin<kBuiltin>(this, std::forward<Args>(args)...);
+  CallBuiltin(kBuiltin);
+}
+
+inline void MaglevAssembler::CallRuntime(Runtime::FunctionId fid) {
+  DCHECK(allow_call());
+  // Temporaries have to be reset before calling CallRuntime, in case it uses
+  // temporaries that alias register parameters.
+  ScratchRegisterScope reset_temps(this);
+  reset_temps.ResetToDefault();
+  MacroAssembler::CallRuntime(fid);
+}
+
+inline void MaglevAssembler::CallRuntime(Runtime::FunctionId fid,
+                                         int num_args) {
+  DCHECK(allow_call());
+  // Temporaries have to be reset before calling CallRuntime, in case it uses
+  // temporaries that alias register parameters.
+  ScratchRegisterScope reset_temps(this);
+  reset_temps.ResetToDefault();
+  MacroAssembler::CallRuntime(fid, num_args);
+}
+
+inline void MaglevAssembler::SetMapAsRoot(Register object, RootIndex map) {
+  ScratchRegisterScope temps(this);
+  Register scratch = temps.GetDefaultScratchRegister();
+  LoadTaggedRoot(scratch, map);
+  StoreTaggedFieldNoWriteBarrier(object, HeapObject::kMapOffset, scratch);
+}
+
+inline void MaglevAssembler::SmiTagInt32AndJumpIfFail(
+    Register dst, Register src, Label* fail, Label::Distance distance) {
+  SmiTagInt32AndSetFlags(dst, src);
+  if (!SmiValuesAre32Bits()) {
+    JumpIf(kOverflow, fail, distance);
+  }
+}
+
+inline void MaglevAssembler::SmiTagInt32AndJumpIfFail(
+    Register reg, Label* fail, Label::Distance distance) {
+  SmiTagInt32AndJumpIfFail(reg, reg, fail, distance);
+}
+
+inline void MaglevAssembler::SmiTagInt32AndJumpIfSuccess(
+    Register dst, Register src, Label* success, Label::Distance distance) {
+  SmiTagInt32AndSetFlags(dst, src);
+  if (!SmiValuesAre32Bits()) {
+    JumpIf(kNoOverflow, success, distance);
+  } else {
+    jmp(success);
+  }
+}
+
+inline void MaglevAssembler::SmiTagInt32AndJumpIfSuccess(
+    Register reg, Label* success, Label::Distance distance) {
+  SmiTagInt32AndJumpIfSuccess(reg, reg, success, distance);
+}
+
+inline void MaglevAssembler::UncheckedSmiTagInt32(Register dst, Register src) {
+  SmiTagInt32AndSetFlags(dst, src);
+  Assert(kNoOverflow, AbortReason::kInputDoesNotFitSmi);
+}
+
+inline void MaglevAssembler::UncheckedSmiTagInt32(Register reg) {
+  UncheckedSmiTagInt32(reg, reg);
+}
+
+inline void MaglevAssembler::SmiTagUint32AndJumpIfFail(
+    Register dst, Register src, Label* fail, Label::Distance distance) {
+  // Perform an unsigned comparison against Smi::kMaxValue.
+  CompareInt32AndJumpIf(src, Smi::kMaxValue, kUnsignedGreaterThan, fail,
+                        distance);
+  SmiTagInt32AndSetFlags(dst, src);
+  Assert(kNoOverflow, AbortReason::kInputDoesNotFitSmi);
+}
+
+inline void MaglevAssembler::SmiTagUint32AndJumpIfFail(
+    Register reg, Label* fail, Label::Distance distance) {
+  SmiTagUint32AndJumpIfFail(reg, reg, fail, distance);
+}
+
+inline void MaglevAssembler::SmiTagUint32AndJumpIfSuccess(
+    Register dst, Register src, Label* success, Label::Distance distance) {
+  // Perform an unsigned comparison against Smi::kMaxValue.
+  CompareInt32AndJumpIf(src, Smi::kMaxValue, kUnsignedLessThanEqual, success,
+                        distance);
+  SmiTagInt32AndSetFlags(dst, src);
+  Assert(kNoOverflow, AbortReason::kInputDoesNotFitSmi);
+}
+
+inline void MaglevAssembler::SmiTagUint32AndJumpIfSuccess(
+    Register reg, Label* success, Label::Distance distance) {
+  SmiTagUint32AndJumpIfSuccess(reg, reg, success, distance);
+}
+
+inline void MaglevAssembler::UncheckedSmiTagUint32(Register dst, Register src) {
+  if (v8_flags.debug_code) {
+    // Perform an unsigned comparison against Smi::kMaxValue.
+    CompareInt32(src, Smi::kMaxValue);
+    Check(kUnsignedLessThanEqual, AbortReason::kInputDoesNotFitSmi);
+  }
+  SmiTagInt32AndSetFlags(dst, src);
+  Assert(kNoOverflow, AbortReason::kInputDoesNotFitSmi);
+}
+
+inline void MaglevAssembler::UncheckedSmiTagUint32(Register reg) {
+  UncheckedSmiTagUint32(reg, reg);
+}
+
+inline void MaglevAssembler::StringLength(Register result, Register string) {
+  if (v8_flags.debug_code) {
+    // Check if {string} is a string.
+    ScratchRegisterScope temps(this);
+    Register scratch = temps.GetDefaultScratchRegister();
+    AssertNotSmi(string);
+    LoadMap(scratch, string);
+    CompareInstanceTypeRange(scratch, scratch, FIRST_STRING_TYPE,
+                             LAST_STRING_TYPE);
+    Check(kUnsignedLessThanEqual, AbortReason::kUnexpectedValue);
+  }
+  LoadSignedField(result, FieldMemOperand(string, String::kLengthOffset),
+                  sizeof(int32_t));
+}
+
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/maglev/maglev-assembler.cc b/deps/v8/src/maglev/maglev-assembler.cc
index 3f245cd60a3be6..b66f18c082b0fe 100644
--- a/deps/v8/src/maglev/maglev-assembler.cc
+++ b/deps/v8/src/maglev/maglev-assembler.cc
@@ -2,6 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include "src/maglev/maglev-assembler.h"
+
 #include "src/maglev/maglev-assembler-inl.h"
 #include "src/maglev/maglev-code-generator.h"
 
@@ -9,6 +11,30 @@ namespace v8 {
 namespace internal {
 namespace maglev {
 
+#define __ masm->
+
+void MaglevAssembler::AllocateHeapNumber(RegisterSnapshot register_snapshot,
+                                         Register result,
+                                         DoubleRegister value) {
+  // In the case we need to call the runtime, we should spill the value
+  // register. Even if it is not live in the next node, otherwise the
+  // allocation call might trash it.
+  register_snapshot.live_double_registers.set(value);
+  Allocate(register_snapshot, result, HeapNumber::kSize);
+  SetMapAsRoot(result, RootIndex::kHeapNumberMap);
+  StoreFloat64(FieldMemOperand(result, HeapNumber::kValueOffset), value);
+}
+
+void MaglevAssembler::AllocateTwoByteString(RegisterSnapshot register_snapshot,
+                                            Register result, int length) {
+  int size = SeqTwoByteString::SizeFor(length);
+  Allocate(register_snapshot, result, size);
+  StoreTaggedSignedField(result, size - kObjectAlignment, Smi::zero());
+  SetMapAsRoot(result, RootIndex::kSeqTwoByteStringMap);
+  StoreInt32Field(result, Name::kRawHashFieldOffset, Name::kEmptyHashField);
+  StoreInt32Field(result, String::kLengthOffset, length);
+}
+
 Register MaglevAssembler::FromAnyToRegister(const Input& input,
                                             Register scratch) {
   if (input.operand().IsConstant()) {
@@ -32,8 +58,8 @@ void MaglevAssembler::LoadSingleCharacterString(Register result,
   DCHECK_LT(char_code, String::kMaxOneByteCharCode);
   Register table = result;
   LoadRoot(table, RootIndex::kSingleCharacterStringTable);
-  DecompressTagged(result, FieldMemOperand(table, FixedArray::kHeaderSize +
-                                                      char_code * kTaggedSize));
+  LoadTaggedField(result, table,
+                  FixedArray::kHeaderSize + char_code * kTaggedSize);
 }
 
 void MaglevAssembler::LoadDataField(const PolymorphicAccessInfo& access_info,
@@ -53,12 +79,414 @@ void MaglevAssembler::LoadDataField(const PolymorphicAccessInfo& access_info,
     }
     // The field is in the property array, first load it from there.
     AssertNotSmi(load_source_object);
-    DecompressTagged(load_source,
-                     FieldMemOperand(load_source_object,
-                                     JSReceiver::kPropertiesOrHashOffset));
+    LoadTaggedField(load_source, load_source_object,
+                    JSReceiver::kPropertiesOrHashOffset);
   }
   AssertNotSmi(load_source);
-  DecompressTagged(result, FieldMemOperand(load_source, field_index.offset()));
+  LoadTaggedField(result, load_source, field_index.offset());
+}
+
+void MaglevAssembler::JumpIfNotUndetectable(Register object, Register scratch,
+                                            CheckType check_type, Label* target,
+                                            Label::Distance distance) {
+  if (check_type == CheckType::kCheckHeapObject) {
+    JumpIfSmi(object, target, distance);
+  } else if (v8_flags.debug_code) {
+    AssertNotSmi(object);
+  }
+  // For heap objects, check the map's undetectable bit.
+  LoadMap(scratch, object);
+  LoadByte(scratch, FieldMemOperand(scratch, Map::kBitFieldOffset));
+  TestInt32AndJumpIfAllClear(scratch, Map::Bits1::IsUndetectableBit::kMask,
+                             target, distance);
+}
+
+void MaglevAssembler::JumpIfUndetectable(Register object, Register scratch,
+                                         CheckType check_type, Label* target,
+                                         Label::Distance distance) {
+  Label detectable;
+  if (check_type == CheckType::kCheckHeapObject) {
+    JumpIfSmi(object, &detectable, Label::kNear);
+  } else if (v8_flags.debug_code) {
+    AssertNotSmi(object);
+  }
+  // For heap objects, check the map's undetectable bit.
+  LoadMap(scratch, object);
+  LoadByte(scratch, FieldMemOperand(scratch, Map::kBitFieldOffset));
+  TestInt32AndJumpIfAnySet(scratch, Map::Bits1::IsUndetectableBit::kMask,
+                           target, distance);
+  bind(&detectable);
+}
+
+void MaglevAssembler::EnsureWritableFastElements(
+    RegisterSnapshot register_snapshot, Register elements, Register object,
+    Register scratch) {
+  ZoneLabelRef done(this);
+  CompareMapWithRoot(elements, RootIndex::kFixedArrayMap, scratch);
+  JumpToDeferredIf(
+      kNotEqual,
+      [](MaglevAssembler* masm, ZoneLabelRef done, Register object,
+         Register result_reg, RegisterSnapshot snapshot) {
+        {
+          snapshot.live_registers.clear(result_reg);
+          snapshot.live_tagged_registers.clear(result_reg);
+          SaveRegisterStateForCall save_register_state(masm, snapshot);
+          __ CallBuiltin<Builtin::kCopyFastSmiOrObjectElements>(object);
+          save_register_state.DefineSafepoint();
+          __ Move(result_reg, kReturnRegister0);
+        }
+        __ Jump(*done);
+      },
+      done, object, elements, register_snapshot);
+  bind(*done);
+}
+
+void MaglevAssembler::ToBoolean(Register value, CheckType check_type,
+                                ZoneLabelRef is_true, ZoneLabelRef is_false,
+                                bool fallthrough_when_true) {
+  ScratchRegisterScope temps(this);
+  Register map = temps.GetDefaultScratchRegister();
+
+  if (check_type == CheckType::kCheckHeapObject) {
+    // Check if {{value}} is Smi.
+    Condition is_smi = CheckSmi(value);
+    JumpToDeferredIf(
+        is_smi,
+        [](MaglevAssembler* masm, Register value, ZoneLabelRef is_true,
+           ZoneLabelRef is_false) {
+          // Check if {value} is not zero.
+          __ CompareSmiAndJumpIf(value, Smi::FromInt(0), kEqual, *is_false);
+          __ Jump(*is_true);
+        },
+        value, is_true, is_false);
+  } else if (v8_flags.debug_code) {
+    AssertNotSmi(value);
+  }
+  // Check if {{value}} is false.
+  CompareRoot(value, RootIndex::kFalseValue);
+  JumpIf(kEqual, *is_false);
+
+  // Check if {{value}} is empty string.
+  CompareRoot(value, RootIndex::kempty_string);
+  JumpIf(kEqual, *is_false);
+
+  // Check if {{value}} is undetectable.
+  LoadMap(map, value);
+  TestInt32AndJumpIfAnySet(FieldMemOperand(map, Map::kBitFieldOffset),
+                           Map::Bits1::IsUndetectableBit::kMask, *is_false);
+
+  // Check if {{value}} is a HeapNumber.
+  CompareRoot(map, RootIndex::kHeapNumberMap);
+  JumpToDeferredIf(
+      kEqual,
+      [](MaglevAssembler* masm, Register value, ZoneLabelRef is_true,
+         ZoneLabelRef is_false) {
+        __ CompareDoubleAndJumpIfZeroOrNaN(
+            FieldMemOperand(value, HeapNumber::kValueOffset), *is_false);
+        __ Jump(*is_true);
+      },
+      value, is_true, is_false);
+
+  // Check if {{value}} is a BigInt.
+  CompareRoot(map, RootIndex::kBigIntMap);
+  // {{map}} is not needed from this point on.
+  temps.Include(map);
+  JumpToDeferredIf(
+      kEqual,
+      [](MaglevAssembler* masm, Register value, Register map,
+         ZoneLabelRef is_true, ZoneLabelRef is_false) {
+        __ TestInt32AndJumpIfAllClear(
+            FieldMemOperand(value, BigInt::kBitfieldOffset),
+            BigInt::LengthBits::kMask, *is_false);
+        __ Jump(*is_true);
+      },
+      value, map, is_true, is_false);
+
+  // Otherwise true.
+  if (!fallthrough_when_true) {
+    Jump(*is_true);
+  }
+}
+
+void MaglevAssembler::MaterialiseValueNode(Register dst, ValueNode* value) {
+  switch (value->opcode()) {
+    case Opcode::kInt32Constant: {
+      int32_t int_value = value->Cast<Int32Constant>()->value();
+      if (Smi::IsValid(int_value)) {
+        Move(dst, Smi::FromInt(int_value));
+      } else {
+        MoveHeapNumber(dst, int_value);
+      }
+      return;
+    }
+    case Opcode::kFloat64Constant: {
+      double double_value =
+          value->Cast<Float64Constant>()->value().get_scalar();
+      MoveHeapNumber(dst, double_value);
+      return;
+    }
+    default:
+      break;
+  }
+  DCHECK(!value->allocation().IsConstant());
+  DCHECK(value->allocation().IsAnyStackSlot());
+  using D = NewHeapNumberDescriptor;
+  DoubleRegister builtin_input_value = D::GetDoubleRegisterParameter(D::kValue);
+  MemOperand src = ToMemOperand(value->allocation());
+  switch (value->properties().value_representation()) {
+    case ValueRepresentation::kInt32: {
+      Label done;
+      ScratchRegisterScope temps(this);
+      Register scratch = temps.GetDefaultScratchRegister();
+      Move(scratch, src);
+      SmiTagInt32AndJumpIfSuccess(dst, scratch, &done, Label::kNear);
+      // If smi tagging fails, instead of bailing out (deopting), we change
+      // representation to a HeapNumber.
+      Int32ToDouble(builtin_input_value, scratch);
+      CallBuiltin<Builtin::kNewHeapNumber>(builtin_input_value);
+      Move(dst, kReturnRegister0);
+      bind(&done);
+      break;
+    }
+    case ValueRepresentation::kUint32: {
+      Label done;
+      ScratchRegisterScope temps(this);
+      Register scratch = temps.GetDefaultScratchRegister();
+      Move(scratch, src);
+      SmiTagUint32AndJumpIfSuccess(dst, scratch, &done, Label::kNear);
+      // If smi tagging fails, instead of bailing out (deopting), we change
+      // representation to a HeapNumber.
+      Uint32ToDouble(builtin_input_value, scratch);
+      CallBuiltin<Builtin::kNewHeapNumber>(builtin_input_value);
+      Move(dst, kReturnRegister0);
+      bind(&done);
+      break;
+    }
+    case ValueRepresentation::kFloat64:
+      LoadFloat64(builtin_input_value, src);
+      CallBuiltin<Builtin::kNewHeapNumber>(builtin_input_value);
+      Move(dst, kReturnRegister0);
+      break;
+    case ValueRepresentation::kHoleyFloat64: {
+      Label done, box;
+      JumpIfNotHoleNan(src, &box, Label::kNear);
+      LoadRoot(dst, RootIndex::kUndefinedValue);
+      Jump(&done);
+      bind(&box);
+      LoadFloat64(builtin_input_value, src);
+      CallBuiltin<Builtin::kNewHeapNumber>(builtin_input_value);
+      Move(dst, kReturnRegister0);
+      bind(&done);
+      break;
+    }
+    case ValueRepresentation::kWord64:
+    case ValueRepresentation::kTagged:
+      UNREACHABLE();
+  }
+}
+
+void MaglevAssembler::TestTypeOf(
+    Register object, interpreter::TestTypeOfFlags::LiteralFlag literal,
+    Label* is_true, Label::Distance true_distance, bool fallthrough_when_true,
+    Label* is_false, Label::Distance false_distance,
+    bool fallthrough_when_false) {
+  // If both true and false are fallthroughs, we don't have to do anything.
+  if (fallthrough_when_true && fallthrough_when_false) return;
+
+  MaglevAssembler::ScratchRegisterScope temps(this);
+  Register scratch = temps.GetDefaultScratchRegister();
+
+  // IMPORTANT: Note that `object` could be a register that aliases registers in
+  // the ScratchRegisterScope. Make sure that all reads of `object` are before
+  // any writes to scratch registers
+  using LiteralFlag = interpreter::TestTypeOfFlags::LiteralFlag;
+  switch (literal) {
+    case LiteralFlag::kNumber: {
+      JumpIfSmi(object, is_true, true_distance);
+      CompareMapWithRoot(object, RootIndex::kHeapNumberMap, scratch);
+      Branch(kEqual, is_true, true_distance, fallthrough_when_true, is_false,
+             false_distance, fallthrough_when_false);
+      return;
+    }
+    case LiteralFlag::kString: {
+      JumpIfSmi(object, is_false, false_distance);
+      CompareObjectTypeRange(object, scratch, FIRST_STRING_TYPE,
+                             LAST_STRING_TYPE);
+      Branch(kLessThanEqual, is_true, true_distance, fallthrough_when_true,
+             is_false, false_distance, fallthrough_when_false);
+      return;
+    }
+    case LiteralFlag::kSymbol: {
+      JumpIfSmi(object, is_false, false_distance);
+      IsObjectType(object, SYMBOL_TYPE);
+      Branch(kEqual, is_true, true_distance, fallthrough_when_true, is_false,
+             false_distance, fallthrough_when_false);
+      return;
+    }
+    case LiteralFlag::kBoolean:
+      JumpIfRoot(object, RootIndex::kTrueValue, is_true, true_distance);
+      CompareRoot(object, RootIndex::kFalseValue);
+      Branch(kEqual, is_true, true_distance, fallthrough_when_true, is_false,
+             false_distance, fallthrough_when_false);
+      return;
+    case LiteralFlag::kBigInt: {
+      JumpIfSmi(object, is_false, false_distance);
+      IsObjectType(object, BIGINT_TYPE);
+      Branch(kEqual, is_true, true_distance, fallthrough_when_true, is_false,
+             false_distance, fallthrough_when_false);
+      return;
+    }
+    case LiteralFlag::kUndefined: {
+      // Make sure `object` isn't a valid temp here, since we re-use it.
+      DCHECK(!temps.Available().has(object));
+      JumpIfSmi(object, is_false, false_distance);
+      // Check it has the undetectable bit set and it is not null.
+      LoadMap(scratch, object);
+      TestInt32AndJumpIfAllClear(FieldMemOperand(scratch, Map::kBitFieldOffset),
+                                 Map::Bits1::IsUndetectableBit::kMask, is_false,
+                                 false_distance);
+      CompareRoot(object, RootIndex::kNullValue);
+      Branch(kNotEqual, is_true, true_distance, fallthrough_when_true, is_false,
+             false_distance, fallthrough_when_false);
+      return;
+    }
+    case LiteralFlag::kFunction: {
+      JumpIfSmi(object, is_false, false_distance);
+      // Check if callable bit is set and not undetectable.
+      LoadMap(scratch, object);
+      Branch(IsCallableAndNotUndetectable(scratch, scratch), is_true,
+             true_distance, fallthrough_when_true, is_false, false_distance,
+             fallthrough_when_false);
+      return;
+    }
+    case LiteralFlag::kObject: {
+      JumpIfSmi(object, is_false, false_distance);
+      // If the object is null then return true.
+      JumpIfRoot(object, RootIndex::kNullValue, is_true, true_distance);
+      // Check if the object is a receiver type,
+      LoadMap(scratch, object);
+      CompareInstanceType(scratch, FIRST_JS_RECEIVER_TYPE);
+      JumpIf(kLessThan, is_false, false_distance);
+      // ... and is not undefined (undetectable) nor callable.
+      Branch(IsNotCallableNorUndetactable(scratch, scratch), is_true,
+             true_distance, fallthrough_when_true, is_false, false_distance,
+             fallthrough_when_false);
+      return;
+    }
+    case LiteralFlag::kOther:
+      if (!fallthrough_when_false) {
+        Jump(is_false, false_distance);
+      }
+      return;
+  }
+  UNREACHABLE();
+}
+
+template <MaglevAssembler::StoreMode store_mode>
+void MaglevAssembler::CheckAndEmitDeferredWriteBarrier(
+    Register object, OffsetTypeFor<store_mode> offset, Register value,
+    RegisterSnapshot register_snapshot, ValueIsCompressed value_is_compressed,
+    ValueCanBeSmi value_can_be_smi) {
+  ZoneLabelRef done(this);
+  Label* deferred_write_barrier = MakeDeferredCode(
+      [](MaglevAssembler* masm, ZoneLabelRef done, Register object,
+         OffsetTypeFor<store_mode> offset, Register value,
+         RegisterSnapshot register_snapshot, ValueIsCompressed value_type) {
+        ASM_CODE_COMMENT_STRING(masm, "Write barrier slow path");
+        if (PointerCompressionIsEnabled() && value_type == kValueIsCompressed) {
+          __ DecompressTagged(value, value);
+        }
+
+        {
+          // Use the value as the scratch register if possible, since
+          // CheckPageFlag emits slightly better code when value == scratch.
+          MaglevAssembler::ScratchRegisterScope temp(masm);
+          Register scratch = temp.GetDefaultScratchRegister();
+          if (value != object && !register_snapshot.live_registers.has(value)) {
+            scratch = value;
+          }
+          __ CheckPageFlag(value, scratch,
+                           MemoryChunk::kPointersToHereAreInterestingMask,
+                           kEqual, *done);
+        }
+
+        Register stub_object_reg = WriteBarrierDescriptor::ObjectRegister();
+        Register slot_reg = WriteBarrierDescriptor::SlotAddressRegister();
+
+        RegList saved;
+        if (object != stub_object_reg &&
+            register_snapshot.live_registers.has(stub_object_reg)) {
+          saved.set(stub_object_reg);
+        }
+        if (register_snapshot.live_registers.has(slot_reg)) {
+          saved.set(slot_reg);
+        }
+
+        __ PushAll(saved);
+
+        if (object != stub_object_reg) {
+          __ Move(stub_object_reg, object);
+          object = stub_object_reg;
+        }
+
+        if constexpr (store_mode == kElement) {
+          __ SetSlotAddressForFixedArrayElement(slot_reg, object, offset);
+        } else {
+          static_assert(store_mode == kField);
+          __ SetSlotAddressForTaggedField(slot_reg, object, offset);
+        }
+
+        SaveFPRegsMode const save_fp_mode =
+            !register_snapshot.live_double_registers.is_empty()
+                ? SaveFPRegsMode::kSave
+                : SaveFPRegsMode::kIgnore;
+
+        __ CallRecordWriteStub(object, slot_reg, save_fp_mode);
+
+        __ PopAll(saved);
+        __ Jump(*done);
+      },
+      done, object, offset, value, register_snapshot, value_is_compressed);
+
+  if (value_can_be_smi) {
+    JumpIfSmi(value, *done);
+  } else {
+    AssertNotSmi(value);
+  }
+
+  MaglevAssembler::ScratchRegisterScope temp(this);
+  Register scratch = temp.GetDefaultScratchRegister();
+  CheckPageFlag(object, scratch,
+                MemoryChunk::kPointersFromHereAreInterestingMask, kNotEqual,
+                deferred_write_barrier);
+  bind(*done);
+}
+
+void MaglevAssembler::StoreTaggedFieldWithWriteBarrier(
+    Register object, int offset, Register value,
+    RegisterSnapshot register_snapshot, ValueIsCompressed value_is_compressed,
+    ValueCanBeSmi value_can_be_smi) {
+  AssertNotSmi(object);
+  StoreTaggedFieldNoWriteBarrier(object, offset, value);
+  CheckAndEmitDeferredWriteBarrier<kField>(
+      object, offset, value, register_snapshot, value_is_compressed,
+      value_can_be_smi);
+}
+
+void MaglevAssembler::StoreFixedArrayElementWithWriteBarrier(
+    Register array, Register index, Register value,
+    RegisterSnapshot register_snapshot) {
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  StoreFixedArrayElementNoWriteBarrier(array, index, value);
+  CheckAndEmitDeferredWriteBarrier<kElement>(
+      array, index, value, register_snapshot, kValueIsDecompressed,
+      kValueCanBeSmi);
 }
 
 }  // namespace maglev
diff --git a/deps/v8/src/maglev/maglev-assembler.h b/deps/v8/src/maglev/maglev-assembler.h
index 3f0dfd210135fc..7fb1c6590d7c87 100644
--- a/deps/v8/src/maglev/maglev-assembler.h
+++ b/deps/v8/src/maglev/maglev-assembler.h
@@ -45,6 +45,27 @@ struct StackSlot {
   int32_t index;
 };
 
+// Helper for generating the platform-specific parts of map comparison
+// operations.
+class MapCompare {
+ public:
+  inline explicit MapCompare(MaglevAssembler* masm, Register object,
+                             size_t map_count);
+
+  inline void Generate(Handle<Map> map);
+  inline Register GetObject() const { return object_; }
+  inline Register GetMap();
+
+  // For counting the temporaries needed by the above operations:
+  static inline int TemporaryCount(size_t map_count);
+
+ private:
+  MaglevAssembler* masm_;
+  const Register object_;
+  const size_t map_count_;
+  Register map_ = Register::no_reg();
+};
+
 class MaglevAssembler : public MacroAssembler {
  public:
   class ScratchRegisterScope;
@@ -53,6 +74,18 @@ class MaglevAssembler : public MacroAssembler {
       : MacroAssembler(isolate, CodeObjectRequired::kNo),
         code_gen_state_(code_gen_state) {}
 
+  static constexpr RegList GetAllocatableRegisters() {
+#ifdef V8_TARGET_ARCH_ARM
+    return kAllocatableGeneralRegisters - kMaglevExtraScratchRegister;
+#else
+    return kAllocatableGeneralRegisters;
+#endif  // V8_TARGET_ARCH_ARM
+  }
+
+  static constexpr DoubleRegList GetAllocatableDoubleRegisters() {
+    return kAllocatableDoubleRegisters;
+  }
+
   inline MemOperand GetStackSlot(const compiler::AllocatedOperand& operand);
   inline MemOperand ToMemOperand(const compiler::InstructionOperand& operand);
   inline MemOperand ToMemOperand(const ValueLocation& location);
@@ -84,10 +117,13 @@ class MaglevAssembler : public MacroAssembler {
   void LoadSingleCharacterString(Register result, Register char_code,
                                  Register scratch);
 
+  void EnsureWritableFastElements(RegisterSnapshot register_snapshot,
+                                  Register elements, Register object,
+                                  Register scratch);
+
   inline void BindJumpTarget(Label* label);
   inline void BindBlock(BasicBlock* block);
 
-  inline Condition IsInt64Constant(Register reg, int64_t constant);
   inline Condition IsRootConstant(Input input, RootIndex root_index);
 
   inline void Branch(Condition condition, BasicBlock* if_true,
@@ -106,12 +142,24 @@ class MaglevAssembler : public MacroAssembler {
   inline void LoadTaggedSignedField(Register result, MemOperand operand);
   inline void LoadTaggedSignedField(Register result, Register object,
                                     int offset);
+  inline void LoadAndUntagTaggedSignedField(Register result, Register object,
+                                            int offset);
   inline void LoadTaggedFieldByIndex(Register result, Register object,
                                      Register index, int scale, int offset);
   inline void LoadBoundedSizeFromObject(Register result, Register object,
                                         int offset);
   inline void LoadExternalPointerField(Register result, MemOperand operand);
 
+  inline void LoadFixedArrayElement(Register result, Register array,
+                                    Register index);
+  inline void LoadFixedArrayElementWithoutDecompressing(Register result,
+                                                        Register array,
+                                                        Register index);
+  inline void LoadFixedDoubleArrayElement(DoubleRegister result, Register array,
+                                          Register index);
+  inline void StoreFixedDoubleArrayElement(Register array, Register index,
+                                           DoubleRegister value);
+
   inline void LoadSignedField(Register result, MemOperand operand,
                               int element_size);
   inline void LoadUnsignedField(Register result, MemOperand operand,
@@ -128,8 +176,27 @@ class MaglevAssembler : public MacroAssembler {
     DecodeField<BitField>(result);
   }
 
+  enum StoreMode { kField, kElement };
   enum ValueIsCompressed { kValueIsDecompressed, kValueIsCompressed };
   enum ValueCanBeSmi { kValueCannotBeSmi, kValueCanBeSmi };
+
+  inline void SetSlotAddressForTaggedField(Register slot_reg, Register object,
+                                           int offset);
+  inline void SetSlotAddressForFixedArrayElement(Register slot_reg,
+                                                 Register object,
+                                                 Register index);
+
+  template <StoreMode store_mode>
+  using OffsetTypeFor = std::conditional_t<store_mode == kField, int, Register>;
+
+  template <StoreMode store_mode>
+  void CheckAndEmitDeferredWriteBarrier(Register object,
+                                        OffsetTypeFor<store_mode> offset,
+                                        Register value,
+                                        RegisterSnapshot register_snapshot,
+                                        ValueIsCompressed value_is_compressed,
+                                        ValueCanBeSmi value_can_be_smi);
+
   // Preserves all registers that are in the register snapshot, but is otherwise
   // allowed to clobber both input registers if they are not in the snapshot.
   //
@@ -144,14 +211,23 @@ class MaglevAssembler : public MacroAssembler {
                                         RegisterSnapshot register_snapshot,
                                         ValueIsCompressed value_is_compressed,
                                         ValueCanBeSmi value_can_be_smi);
+  inline void StoreTaggedFieldNoWriteBarrier(Register object, int offset,
+                                             Register value);
   inline void StoreTaggedSignedField(Register object, int offset,
                                      Register value);
-  inline void StoreTaggedSignedField(Register object, int offset, Smi value);
+  inline void StoreTaggedSignedField(Register object, int offset,
+                                     Tagged<Smi> value);
 
+  inline void StoreInt32Field(Register object, int offset, int32_t value);
   inline void StoreField(MemOperand operand, Register value, int element_size);
   inline void ReverseByteOrder(Register value, int element_size);
 
-  void BuildTypedArrayDataPointer(Register data_pointer, Register object);
+  inline void BuildTypedArrayDataPointer(Register data_pointer,
+                                         Register object);
+  inline MemOperand TypedArrayElementOperand(Register data_pointer,
+                                             Register index, int element_size);
+  inline MemOperand DataViewElementOperand(Register data_pointer,
+                                           Register index);
 
   // Warning: Input registers {string} and {index} will be scratched.
   // {result} is allowed to alias with one the other 3 input registers.
@@ -165,20 +241,51 @@ class MaglevAssembler : public MacroAssembler {
                           Label* char_code_fits_one_byte, Register result,
                           Register char_code, Register scratch);
 
-  void ToBoolean(Register value, ZoneLabelRef is_true, ZoneLabelRef is_false,
-                 bool fallthrough_when_true);
+  void ToBoolean(Register value, CheckType check_type, ZoneLabelRef is_true,
+                 ZoneLabelRef is_false, bool fallthrough_when_true);
+
   void TestTypeOf(Register object,
                   interpreter::TestTypeOfFlags::LiteralFlag literal,
                   Label* if_true, Label::Distance true_distance,
                   bool fallthrough_when_true, Label* if_false,
                   Label::Distance false_distance, bool fallthrough_when_false);
 
-  // Smi-tags {obj} in place.
-  inline void SmiTagInt32(Register obj, Label* fail);
+  inline void SmiTagInt32AndJumpIfFail(Register dst, Register src, Label* fail,
+                                       Label::Distance distance = Label::kFar);
+  inline void SmiTagInt32AndJumpIfFail(Register reg, Label* fail,
+                                       Label::Distance distance = Label::kFar);
+  inline void SmiTagInt32AndJumpIfSuccess(
+      Register dst, Register src, Label* success,
+      Label::Distance distance = Label::kFar);
+  inline void SmiTagInt32AndJumpIfSuccess(
+      Register reg, Label* success, Label::Distance distance = Label::kFar);
+  inline void UncheckedSmiTagInt32(Register dst, Register src);
+  inline void UncheckedSmiTagInt32(Register reg);
+
+  inline void SmiTagUint32AndJumpIfFail(Register dst, Register src, Label* fail,
+                                        Label::Distance distance = Label::kFar);
+  inline void SmiTagUint32AndJumpIfFail(Register reg, Label* fail,
+                                        Label::Distance distance = Label::kFar);
+  inline void SmiTagUint32AndJumpIfSuccess(
+      Register dst, Register src, Label* success,
+      Label::Distance distance = Label::kFar);
+  inline void SmiTagUint32AndJumpIfSuccess(
+      Register reg, Label* success, Label::Distance distance = Label::kFar);
+  inline void UncheckedSmiTagUint32(Register dst, Register src);
+  inline void UncheckedSmiTagUint32(Register reg);
+
+  // Try to smi-tag {obj}. Result is thrown away.
+  inline void CheckInt32IsSmi(Register obj, Label* fail,
+                              Register scratch = Register::no_reg());
+
+  inline void MoveHeapNumber(Register dst, double value);
 
-  inline void DoubleToInt64Repr(Register dst, DoubleRegister src);
   void TruncateDoubleToInt32(Register dst, DoubleRegister src);
   void TryTruncateDoubleToInt32(Register dst, DoubleRegister src, Label* fail);
+  void TryTruncateDoubleToUint32(Register dst, DoubleRegister src, Label* fail);
+
+  void TryChangeFloat64ToIndex(Register result, DoubleRegister value,
+                               Label* success, Label* fail);
 
   inline void DefineLazyDeoptPoint(LazyDeoptInfo* info);
   inline void DefineExceptionHandlerPoint(NodeBase* node);
@@ -189,8 +296,16 @@ class MaglevAssembler : public MacroAssembler {
   template <typename Function, typename... Args>
   inline void JumpToDeferredIf(Condition cond, Function&& deferred_code_gen,
                                Args&&... args);
+  void JumpIfUndetectable(Register object, Register scratch,
+                          CheckType check_type, Label* target,
+                          Label::Distance distance = Label::kFar);
+  void JumpIfNotUndetectable(Register object, Register scratch, CheckType,
+                             Label* target,
+                             Label::Distance distance = Label::kFar);
   template <typename NodeT>
   inline Label* GetDeoptLabel(NodeT* node, DeoptimizeReason reason);
+  inline bool IsDeoptLabel(Label* label);
+  inline void EmitEagerDeoptStress(Label* label);
   template <typename NodeT>
   inline void EmitEagerDeopt(NodeT* node, DeoptimizeReason reason);
   template <typename NodeT>
@@ -198,8 +313,16 @@ class MaglevAssembler : public MacroAssembler {
                                NodeT* node);
   template <typename NodeT>
   inline void EmitEagerDeoptIfNotEqual(DeoptimizeReason reason, NodeT* node);
+  template <typename NodeT>
+  inline void EmitEagerDeoptIfSmi(NodeT* node, Register object,
+                                  DeoptimizeReason reason);
+  template <typename NodeT>
+  inline void EmitEagerDeoptIfNotSmi(NodeT* node, Register object,
+                                     DeoptimizeReason reason);
 
-  inline void MaterialiseValueNode(Register dst, ValueNode* value);
+  void MaterialiseValueNode(Register dst, ValueNode* value);
+
+  inline void IncrementInt32(Register reg);
 
   inline MemOperand StackSlotOperand(StackSlot slot);
   inline void Move(StackSlot dst, Register src);
@@ -207,14 +330,12 @@ class MaglevAssembler : public MacroAssembler {
   inline void Move(Register dst, StackSlot src);
   inline void Move(DoubleRegister dst, StackSlot src);
   inline void Move(MemOperand dst, Register src);
-  inline void Move(MemOperand dst, DoubleRegister src);
   inline void Move(Register dst, MemOperand src);
-  inline void Move(DoubleRegister dst, MemOperand src);
   inline void Move(DoubleRegister dst, DoubleRegister src);
-  inline void Move(Register dst, Smi src);
+  inline void Move(Register dst, Tagged<Smi> src);
   inline void Move(Register dst, ExternalReference src);
   inline void Move(Register dst, Register src);
-  inline void Move(Register dst, TaggedIndex i);
+  inline void Move(Register dst, Tagged<TaggedIndex> i);
   inline void Move(Register dst, int32_t i);
   inline void Move(DoubleRegister dst, double n);
   inline void Move(DoubleRegister dst, Float64 n);
@@ -222,6 +343,22 @@ class MaglevAssembler : public MacroAssembler {
 
   inline void LoadByte(Register dst, MemOperand src);
 
+  inline void LoadFloat32(DoubleRegister dst, MemOperand src);
+  inline void StoreFloat32(MemOperand dst, DoubleRegister src);
+  inline void LoadFloat64(DoubleRegister dst, MemOperand src);
+  inline void StoreFloat64(MemOperand dst, DoubleRegister src);
+
+  inline void LoadUnalignedFloat64(DoubleRegister dst, Register base,
+                                   Register index);
+  inline void LoadUnalignedFloat64AndReverseByteOrder(DoubleRegister dst,
+                                                      Register base,
+                                                      Register index);
+  inline void StoreUnalignedFloat64(Register base, Register index,
+                                    DoubleRegister src);
+  inline void ReverseByteOrderAndStoreUnalignedFloat64(Register base,
+                                                       Register index,
+                                                       DoubleRegister src);
+
   inline void SignExtend32To64Bits(Register dst, Register src);
   inline void NegateInt32(Register val);
 
@@ -232,6 +369,10 @@ class MaglevAssembler : public MacroAssembler {
   inline void DeoptIfBufferDetached(Register array, Register scratch,
                                     NodeT* node);
 
+  inline Condition IsCallableAndNotUndetectable(Register map, Register scratch);
+  inline Condition IsNotCallableNorUndetactable(Register map, Register scratch);
+
+  inline void LoadInstanceType(Register instance_type, Register heap_object);
   inline void IsObjectType(Register heap_object, InstanceType type);
   inline void CompareObjectType(Register heap_object, InstanceType type);
   inline void JumpIfJSAnyIsNotPrimitive(Register heap_object, Label* target,
@@ -241,25 +382,45 @@ class MaglevAssembler : public MacroAssembler {
   inline void CompareObjectTypeRange(Register heap_object,
                                      InstanceType lower_limit,
                                      InstanceType higher_limit);
+  inline void CompareObjectTypeRange(Register heap_object, Register scratch,
+                                     InstanceType lower_limit,
+                                     InstanceType higher_limit);
 
   inline void CompareMapWithRoot(Register object, RootIndex index,
                                  Register scratch);
 
+  inline void CompareInstanceType(Register map, InstanceType instance_type);
   inline void CompareInstanceTypeRange(Register map, InstanceType lower_limit,
                                        InstanceType higher_limit);
   inline void CompareInstanceTypeRange(Register map, Register instance_type_out,
                                        InstanceType lower_limit,
                                        InstanceType higher_limit);
 
+  inline void CompareTagged(Register reg, Tagged<Smi> smi);
   inline void CompareTagged(Register reg, Handle<HeapObject> obj);
   inline void CompareTagged(Register src1, Register src2);
 
+  inline void CompareTaggedAndJumpIf(Register reg, Tagged<Smi> smi,
+                                     Condition cond, Label* target,
+                                     Label::Distance distance = Label::kFar);
+
   inline void CompareInt32(Register reg, int32_t imm);
   inline void CompareInt32(Register src1, Register src2);
 
+  inline void CompareFloat64(DoubleRegister src1, DoubleRegister src2);
+
+  inline void PrepareCallCFunction(int num_reg_arguments,
+                                   int num_double_registers = 0);
+
   inline void CallSelf();
+  inline void CallBuiltin(Builtin builtin);
+  template <Builtin kBuiltin, typename... Args>
+  inline void CallBuiltin(Args&&... args);
+  inline void CallRuntime(Runtime::FunctionId fid);
+  inline void CallRuntime(Runtime::FunctionId fid, int num_args);
 
   inline void Jump(Label* target, Label::Distance distance = Label::kFar);
+  inline void JumpToDeopt(Label* target);
   inline void JumpIf(Condition cond, Label* target,
                      Label::Distance distance = Label::kFar);
 
@@ -269,36 +430,68 @@ class MaglevAssembler : public MacroAssembler {
                             Label::Distance distance = Label::kFar);
   inline void JumpIfSmi(Register src, Label* on_smi,
                         Label::Distance near_jump = Label::kFar);
+  inline void JumpIfNotSmi(Register src, Label* on_not_smi,
+                           Label::Distance near_jump = Label::kFar);
   inline void JumpIfByte(Condition cc, Register value, int32_t byte,
                          Label* target, Label::Distance distance = Label::kFar);
 
+  inline void JumpIfHoleNan(DoubleRegister value, Register scratch,
+                            Label* target,
+                            Label::Distance distance = Label::kFar);
+  inline void JumpIfNotHoleNan(DoubleRegister value, Register scratch,
+                               Label* target,
+                               Label::Distance distance = Label::kFar);
+  inline void JumpIfNotHoleNan(MemOperand operand, Label* target,
+                               Label::Distance distance = Label::kFar);
+
   inline void CompareInt32AndJumpIf(Register r1, Register r2, Condition cond,
                                     Label* target,
                                     Label::Distance distance = Label::kFar);
   inline void CompareInt32AndJumpIf(Register r1, int32_t value, Condition cond,
                                     Label* target,
                                     Label::Distance distance = Label::kFar);
-  inline void CompareSmiAndJumpIf(Register r1, Smi value, Condition cond,
-                                  Label* target,
+  inline void CompareSmiAndJumpIf(Register r1, Tagged<Smi> value,
+                                  Condition cond, Label* target,
                                   Label::Distance distance = Label::kFar);
+  inline void CompareByteAndJumpIf(MemOperand left, int8_t right,
+                                   Condition cond, Register scratch,
+                                   Label* target,
+                                   Label::Distance distance = Label::kFar);
+
+  inline void CompareDoubleAndJumpIfZeroOrNaN(
+      DoubleRegister reg, Label* target,
+      Label::Distance distance = Label::kFar);
+  inline void CompareDoubleAndJumpIfZeroOrNaN(
+      MemOperand operand, Label* target,
+      Label::Distance distance = Label::kFar);
+
   inline void TestInt32AndJumpIfAnySet(Register r1, int32_t mask, Label* target,
                                        Label::Distance distance = Label::kFar);
+  inline void TestInt32AndJumpIfAnySet(MemOperand operand, int32_t mask,
+                                       Label* target,
+                                       Label::Distance distance = Label::kFar);
+
   inline void TestInt32AndJumpIfAllClear(
       Register r1, int32_t mask, Label* target,
       Label::Distance distance = Label::kFar);
+  inline void TestInt32AndJumpIfAllClear(
+      MemOperand operand, int32_t mask, Label* target,
+      Label::Distance distance = Label::kFar);
 
-  inline void Int32ToDouble(DoubleRegister result, Register n);
+  inline void Int32ToDouble(DoubleRegister result, Register src);
+  inline void Uint32ToDouble(DoubleRegister result, Register src);
   inline void SmiToDouble(DoubleRegister result, Register smi);
 
-  void StringLength(Register result, Register string);
+  inline void StringLength(Register result, Register string);
 
   // The registers WriteBarrierDescriptor::ObjectRegister and
   // WriteBarrierDescriptor::SlotAddressRegister can be clobbered.
   void StoreFixedArrayElementWithWriteBarrier(
       Register array, Register index, Register value,
       RegisterSnapshot register_snapshot);
-  void StoreFixedArrayElementNoWriteBarrier(Register array, Register index,
-                                            Register value);
+  inline void StoreFixedArrayElementNoWriteBarrier(Register array,
+                                                   Register index,
+                                                   Register value);
 
   // TODO(victorgomes): Import baseline Pop(T...) methods.
   inline void Pop(Register dst);
@@ -309,11 +502,15 @@ class MaglevAssembler : public MacroAssembler {
   template <typename... T>
   inline void PushReverse(T... vals);
 
+  void OSRPrologue(Graph* graph);
   void Prologue(Graph* graph);
 
   inline void FinishCode();
 
   inline void AssertStackSizeCorrect();
+  inline Condition FunctionEntryStackCheck(int stack_check_offset);
+
+  inline void SetMapAsRoot(Register object, RootIndex map);
 
   inline void LoadHeapNumberValue(DoubleRegister result, Register heap_number);
 
@@ -337,14 +534,36 @@ class MaglevAssembler : public MacroAssembler {
     return code_gen_state()->compilation_info();
   }
 
+  ScratchRegisterScope* scratch_register_scope() const {
+    return scratch_register_scope_;
+  }
+
+#ifdef DEBUG
+  bool allow_allocate() const { return allow_allocate_; }
+  void set_allow_allocate(bool value) { allow_allocate_ = value; }
+
+  bool allow_call() const { return allow_call_; }
+  void set_allow_call(bool value) { allow_call_ = value; }
+
+  bool allow_deferred_call() const { return allow_deferred_call_; }
+  void set_allow_deferred_call(bool value) { allow_deferred_call_ = value; }
+#endif  // DEBUG
+
  private:
   inline constexpr int GetFramePointerOffsetForStackSlot(int index) {
     return StandardFrameConstants::kExpressionsOffset -
            index * kSystemPointerSize;
   }
 
+  inline void SmiTagInt32AndSetFlags(Register dst, Register src);
+
   MaglevCodeGenState* const code_gen_state_;
   ScratchRegisterScope* scratch_register_scope_ = nullptr;
+#ifdef DEBUG
+  bool allow_allocate_ = false;
+  bool allow_call_ = false;
+  bool allow_deferred_call_ = false;
+#endif  // DEBUG
 };
 
 class SaveRegisterStateForCall {
@@ -374,11 +593,12 @@ class SaveRegisterStateForCall {
 #ifdef V8_TARGET_ARCH_ARM64
     pushed_reg_index = RoundUp<2>(pushed_reg_index);
 #endif
-    int num_pushed_double_reg = snapshot_.live_double_registers.Count();
+    int num_double_slots = snapshot_.live_double_registers.Count() *
+                           (kDoubleSize / kSystemPointerSize);
 #ifdef V8_TARGET_ARCH_ARM64
-    num_pushed_double_reg = RoundUp<2>(num_pushed_double_reg);
+    num_double_slots = RoundUp<2>(num_double_slots);
 #endif
-    safepoint.SetNumPushedRegisters(pushed_reg_index + num_pushed_double_reg);
+    safepoint.SetNumExtraSpillSlots(pushed_reg_index + num_double_slots);
     return safepoint;
   }
 
@@ -402,6 +622,15 @@ ZoneLabelRef::ZoneLabelRef(MaglevAssembler* masm)
 // Deopt
 // ---
 
+inline bool MaglevAssembler::IsDeoptLabel(Label* label) {
+  for (auto deopt : code_gen_state_->eager_deopts()) {
+    if (deopt->deopt_entry_label() == label) {
+      return true;
+    }
+  }
+  return false;
+}
+
 template <typename NodeT>
 inline Label* MaglevAssembler::GetDeoptLabel(NodeT* node,
                                              DeoptimizeReason reason) {
@@ -420,8 +649,8 @@ inline Label* MaglevAssembler::GetDeoptLabel(NodeT* node,
 template <typename NodeT>
 inline void MaglevAssembler::EmitEagerDeopt(NodeT* node,
                                             DeoptimizeReason reason) {
-  RecordComment("-- Jump to eager deopt");
-  Jump(GetDeoptLabel(node, reason));
+  RecordComment("-- jump to eager deopt");
+  JumpToDeopt(GetDeoptLabel(node, reason));
 }
 
 template <typename NodeT>
@@ -432,6 +661,20 @@ inline void MaglevAssembler::EmitEagerDeoptIf(Condition cond,
   JumpIf(cond, GetDeoptLabel(node, reason));
 }
 
+template <typename NodeT>
+void MaglevAssembler::EmitEagerDeoptIfSmi(NodeT* node, Register object,
+                                          DeoptimizeReason reason) {
+  RecordComment("-- Jump to eager deopt");
+  JumpIfSmi(object, GetDeoptLabel(node, reason));
+}
+
+template <typename NodeT>
+void MaglevAssembler::EmitEagerDeoptIfNotSmi(NodeT* node, Register object,
+                                             DeoptimizeReason reason) {
+  RecordComment("-- Jump to eager deopt");
+  JumpIfNotSmi(object, GetDeoptLabel(node, reason));
+}
+
 inline void MaglevAssembler::DefineLazyDeoptPoint(LazyDeoptInfo* info) {
   info->set_deopting_call_return_pc(pc_offset_for_safepoint());
   code_gen_state()->PushLazyDeopt(info);
@@ -509,9 +752,17 @@ struct is_iterator_range<base::iterator_range<T>> : std::true_type {};
 
 // General helpers.
 
-inline bool AnyMapIsHeapNumber(const ZoneHandleSet<Map>& maps) {
-  return std::any_of(maps.begin(), maps.end(),
-                     [](Handle<Map> map) { return map->IsHeapNumberMap(); });
+inline bool AnyMapIsHeapNumber(const compiler::ZoneRefSet<Map>& maps) {
+  return std::any_of(maps.begin(), maps.end(), [](compiler::MapRef map) {
+    return map.IsHeapNumberMap();
+  });
+}
+
+inline bool AnyMapIsHeapNumber(
+    const base::Vector<const compiler::MapRef>& maps) {
+  return std::any_of(maps.begin(), maps.end(), [](compiler::MapRef map) {
+    return map.IsHeapNumberMap();
+  });
 }
 
 inline Condition ToCondition(AssertCondition cond) {
@@ -524,6 +775,24 @@ inline Condition ToCondition(AssertCondition cond) {
   }
 }
 
+constexpr Condition ConditionFor(Operation operation) {
+  switch (operation) {
+    case Operation::kEqual:
+    case Operation::kStrictEqual:
+      return kEqual;
+    case Operation::kLessThan:
+      return kLessThan;
+    case Operation::kLessThanOrEqual:
+      return kLessThanEqual;
+    case Operation::kGreaterThan:
+      return kGreaterThan;
+    case Operation::kGreaterThanOrEqual:
+      return kGreaterThanEqual;
+    default:
+      UNREACHABLE();
+  }
+}
+
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/maglev/maglev-basic-block.h b/deps/v8/src/maglev/maglev-basic-block.h
index d40b3c5c2e2d03..8464f1f639adb0 100644
--- a/deps/v8/src/maglev/maglev-basic-block.h
+++ b/deps/v8/src/maglev/maglev-basic-block.h
@@ -9,8 +9,10 @@
 
 #include "src/base/small-vector.h"
 #include "src/codegen/label.h"
+#include "src/compiler/turboshaft/snapshot-table.h"
 #include "src/maglev/maglev-interpreter-frame-state.h"
 #include "src/maglev/maglev-ir.h"
+#include "src/zone/zone-list.h"
 #include "src/zone/zone.h"
 
 namespace v8 {
@@ -22,8 +24,19 @@ using NodeConstIterator = Node::List::Iterator;
 
 class BasicBlock {
  public:
-  explicit BasicBlock(MergePointInterpreterFrameState* state)
-      : control_node_(nullptr), state_(state) {}
+  using Snapshot = compiler::turboshaft::SnapshotTable<ValueNode*>::Snapshot;
+  using MaybeSnapshot =
+      compiler::turboshaft::SnapshotTable<ValueNode*>::MaybeSnapshot;
+
+  explicit BasicBlock(MergePointInterpreterFrameState* state, Zone* zone)
+      : control_node_(nullptr),
+        state_(state),
+        reload_hints_(0, zone),
+        spill_hints_(0, zone) {
+    if (state == nullptr) {
+      type_ = kOther;
+    }
+  }
 
   uint32_t first_id() const {
     if (has_phi()) return phis()->first()->id();
@@ -59,7 +72,8 @@ class BasicBlock {
 
   bool has_phi() const { return has_state() && state_->has_phi(); }
 
-  bool is_edge_split_block() const { return is_edge_split_block_; }
+  bool is_merge_block() const { return type_ == kMerge; }
+  bool is_edge_split_block() const { return type_ == kEdgeSplit; }
 
   bool is_loop() const { return has_state() && state()->is_loop(); }
 
@@ -78,14 +92,22 @@ class BasicBlock {
     edge_split_block_register_state_ = register_state;
   }
 
-  void set_edge_split_block() {
-    DCHECK_IMPLIES(!nodes_.is_empty(),
-                   nodes_.LengthForTest() == 1 &&
-                       nodes_.first()->Is<IncreaseInterruptBudget>());
+  void set_edge_split_block(BasicBlock* predecessor) {
+    DCHECK(nodes_.is_empty());
     DCHECK(control_node()->Is<Jump>());
     DCHECK_NULL(state_);
-    is_edge_split_block_ = true;
-    edge_split_block_register_state_ = nullptr;
+    type_ = kEdgeSplit;
+    predecessor_ = predecessor;
+  }
+
+  BasicBlock* predecessor() const {
+    DCHECK(type_ == kEdgeSplit || type_ == kOther);
+    return predecessor_;
+  }
+  void set_predecessor(BasicBlock* predecessor) {
+    DCHECK(type_ == kEdgeSplit || type_ == kOther);
+    DCHECK_NULL(edge_split_block_register_state_);
+    predecessor_ = predecessor;
   }
 
   bool is_start_block_of_switch_case() const {
@@ -99,9 +121,18 @@ class BasicBlock {
     DCHECK(has_phi());
     return state_->phis();
   }
+  void AddPhi(Phi* phi) const {
+    DCHECK(has_state());
+    state_->phis()->Add(phi);
+  }
+
+  int predecessor_count() const {
+    DCHECK(has_state());
+    return state()->predecessor_count();
+  }
 
   BasicBlock* predecessor_at(int i) const {
-    DCHECK_NOT_NULL(state_);
+    DCHECK(has_state());
     return state_->predecessor_at(i);
   }
 
@@ -119,22 +150,43 @@ class BasicBlock {
     DCHECK(has_state());
     return state_;
   }
-  bool has_state() const { return !is_edge_split_block() && state_ != nullptr; }
+  bool has_state() const { return type_ == kMerge && state_ != nullptr; }
 
   bool is_exception_handler_block() const {
     return has_state() && state_->is_exception_handler();
   }
 
+  Snapshot snapshot() const {
+    DCHECK(snapshot_.has_value());
+    return snapshot_.value();
+  }
+
+  void SetSnapshot(Snapshot snapshot) { snapshot_.Set(snapshot); }
+
+  ZonePtrList<ValueNode>& reload_hints() { return reload_hints_; }
+  ZonePtrList<ValueNode>& spill_hints() { return spill_hints_; }
+
  private:
-  bool is_edge_split_block_ = false;
+  enum : uint8_t { kMerge, kEdgeSplit, kOther } type_ = kMerge;
   bool is_start_block_of_switch_case_ = false;
   Node::List nodes_;
   ControlNode* control_node_;
   union {
     MergePointInterpreterFrameState* state_;
     MergePointRegisterState* edge_split_block_register_state_;
+    // For kEdgeSplit and kOther blocks, predecessor_ contains a pointer to
+    // the (only) predecessor of the block. This is only valid before register
+    // allocation where this field is used for edge_split_block_register_state_.
+    BasicBlock* predecessor_;
   };
   Label label_;
+  // Hints about which nodes should be in registers or spilled when entering
+  // this block. Only relevant for loop headers.
+  ZonePtrList<ValueNode> reload_hints_;
+  ZonePtrList<ValueNode> spill_hints_;
+  // {snapshot_} is used during PhiRepresentationSelection in order to track to
+  // phi tagging nodes that come out of this basic block.
+  MaybeSnapshot snapshot_;
 };
 
 inline base::SmallVector<BasicBlock*, 2> BasicBlock::successors() const {
diff --git a/deps/v8/src/maglev/maglev-code-gen-state.h b/deps/v8/src/maglev/maglev-code-gen-state.h
index 2c3ee8c3090981..175a88a66eaa69 100644
--- a/deps/v8/src/maglev/maglev-code-gen-state.h
+++ b/deps/v8/src/maglev/maglev-code-gen-state.h
@@ -111,6 +111,8 @@ class MaglevCodeGenState {
     return std::max(frame_height_delta, max_pushed_argument_bytes);
   }
 
+  Label* osr_entry() { return &osr_entry_; }
+
  private:
   MaglevCompilationInfo* const compilation_info_;
   MaglevSafepointTableBuilder* const safepoint_table_builder_;
@@ -127,6 +129,7 @@ class MaglevCodeGenState {
 
   // Entry point label for recursive calls.
   Label entry_label_;
+  Label osr_entry_;
 };
 
 // Some helpers for codegen.
diff --git a/deps/v8/src/maglev/maglev-code-generator.cc b/deps/v8/src/maglev/maglev-code-generator.cc
index 1c221459f7603e..cb42c56148ead4 100644
--- a/deps/v8/src/maglev/maglev-code-generator.cc
+++ b/deps/v8/src/maglev/maglev-code-generator.cc
@@ -18,8 +18,9 @@
 #include "src/compiler/backend/instruction.h"
 #include "src/deoptimizer/deoptimize-reason.h"
 #include "src/deoptimizer/deoptimizer.h"
-#include "src/deoptimizer/translation-array.h"
+#include "src/deoptimizer/frame-translation-builder.h"
 #include "src/execution/frame-constants.h"
+#include "src/flags/flags.h"
 #include "src/interpreter/bytecode-register.h"
 #include "src/maglev/maglev-assembler-inl.h"
 #include "src/maglev/maglev-code-gen-state.h"
@@ -31,6 +32,7 @@
 #include "src/maglev/maglev-ir.h"
 #include "src/maglev/maglev-regalloc-data.h"
 #include "src/objects/code-inl.h"
+#include "src/objects/deoptimization-data.h"
 #include "src/utils/identity-map.h"
 
 namespace v8 {
@@ -45,12 +47,13 @@ template <typename RegisterT>
 struct RegisterTHelper;
 template <>
 struct RegisterTHelper<Register> {
-  static constexpr RegList kAllocatableRegisters = kAllocatableGeneralRegisters;
+  static constexpr RegList kAllocatableRegisters =
+      MaglevAssembler::GetAllocatableRegisters();
 };
 template <>
 struct RegisterTHelper<DoubleRegister> {
   static constexpr DoubleRegList kAllocatableRegisters =
-      kAllocatableDoubleRegisters;
+      MaglevAssembler::GetAllocatableDoubleRegisters();
 };
 
 enum NeedsDecompression { kDoesNotNeedDecompression, kNeedsDecompression };
@@ -92,6 +95,7 @@ class ParallelMoveResolver {
   static constexpr auto kAllocatableRegistersT =
       RegisterTHelper<RegisterT>::kAllocatableRegisters;
   static_assert(!DecompressIfNeeded || std::is_same_v<Register, RegisterT>);
+  static_assert(!DecompressIfNeeded || COMPRESS_POINTERS_BOOL);
 
  public:
   explicit ParallelMoveResolver(MaglevAssembler* masm)
@@ -415,6 +419,7 @@ class ParallelMoveResolver {
   void EmitMovesFromSource(RegisterT source_reg, GapMoveTargets&& targets) {
     DCHECK(moves_from_register_[source_reg.code()].is_empty());
     if constexpr (DecompressIfNeeded) {
+      static_assert(COMPRESS_POINTERS_BOOL);
       if (targets.needs_decompression == kNeedsDecompression) {
         __ DecompressTagged(source_reg, source_reg);
       }
@@ -457,6 +462,7 @@ class ParallelMoveResolver {
     // Decompress after the first move, subsequent moves reuse this register so
     // they're guaranteed to be decompressed.
     if constexpr (DecompressIfNeeded) {
+      static_assert(COMPRESS_POINTERS_BOOL);
       if (targets.needs_decompression == kNeedsDecompression) {
         __ DecompressTagged(register_with_slot_value, register_with_slot_value);
         targets.needs_decompression = kDoesNotNeedDecompression;
@@ -553,7 +559,7 @@ class ExceptionHandlerTrampolineBuilder {
     const InterpretedDeoptFrame& lazy_frame = bottom_frame->as_interpreted();
 
     // TODO(v8:7700): Handle inlining.
-    ParallelMoveResolver<Register, true> direct_moves(masm_);
+    ParallelMoveResolver<Register, COMPRESS_POINTERS_BOOL> direct_moves(masm_);
     MoveVector materialising_moves;
     bool save_accumulator = false;
     RecordMoves(lazy_frame.unit(), catch_block, lazy_frame.frame_state(),
@@ -563,16 +569,8 @@ class ExceptionHandlerTrampolineBuilder {
     EmitMaterialisationsAndPushResults(materialising_moves, save_accumulator);
 
     __ RecordComment("EmitMoves");
-// TODO(victorgomes): Add a scratch register scope to MaglevAssembler and
-// remove this arch depedent code.
-#ifdef V8_TARGET_ARCH_ARM64
-    UseScratchRegisterScope temps(masm_);
-    Register scratch = temps.AcquireX();
-#elif V8_TARGET_ARCH_X64
-    Register scratch = kScratchRegister;
-#else
-#error "Maglev does not supported this architecture."
-#endif
+    MaglevAssembler::ScratchRegisterScope temps(masm_);
+    Register scratch = temps.GetDefaultScratchRegister();
     direct_moves.EmitMoves(scratch);
     EmitPopMaterialisedResults(materialising_moves, save_accumulator, scratch);
     __ Jump(catch_block->label());
@@ -581,10 +579,12 @@ class ExceptionHandlerTrampolineBuilder {
 
   MaglevAssembler* masm() const { return masm_; }
 
-  void RecordMoves(const MaglevCompilationUnit& unit, BasicBlock* catch_block,
-                   const CompactInterpreterFrameState* register_frame,
-                   ParallelMoveResolver<Register, true>* direct_moves,
-                   MoveVector* materialising_moves, bool* save_accumulator) {
+  void RecordMoves(
+      const MaglevCompilationUnit& unit, BasicBlock* catch_block,
+      const CompactInterpreterFrameState* register_frame,
+      ParallelMoveResolver<Register, COMPRESS_POINTERS_BOOL>* direct_moves,
+      MoveVector* materialising_moves, bool* save_accumulator) {
+    if (!catch_block->has_phi()) return;
     for (Phi* phi : *catch_block->phis()) {
       DCHECK(phi->is_exception_phi());
       if (!phi->has_valid_live_range()) continue;
@@ -623,8 +623,10 @@ class ExceptionHandlerTrampolineBuilder {
           materialising_moves->emplace_back(target, source);
           break;
         case ValueRepresentation::kFloat64:
+        case ValueRepresentation::kHoleyFloat64:
           materialising_moves->emplace_back(target, source);
           break;
+          UNREACHABLE();
       }
     }
   }
@@ -649,6 +651,11 @@ class ExceptionHandlerTrampolineBuilder {
     __ RecordComment("EmitMaterialisationsAndPushResults");
 
     if (save_accumulator) __ Push(kReturnRegister0);
+
+#ifdef DEBUG
+    // Allow calls in these materialisations.
+    __ set_allow_call(true);
+#endif
     for (const Move& move : moves) {
       // We consider constants after all other operations, since constants
       // don't need to call NewHeapNumber.
@@ -656,6 +663,9 @@ class ExceptionHandlerTrampolineBuilder {
       __ MaterialiseValueNode(kReturnRegister0, move.source);
       __ Push(kReturnRegister0);
     }
+#ifdef DEBUG
+    __ set_allow_call(false);
+#endif
   }
 
   void EmitPopMaterialisedResults(const MoveVector& moves,
@@ -701,7 +711,11 @@ class MaglevCodeGeneratingNodeProcessor {
       __ DebugBreak();
     }
 
-    __ Prologue(graph);
+    if (graph->is_osr()) {
+      __ OSRPrologue(graph);
+    } else {
+      __ Prologue(graph);
+    }
   }
 
   void PostProcessGraph(Graph* graph) {}
@@ -719,7 +733,7 @@ class MaglevCodeGeneratingNodeProcessor {
   }
 
   template <typename NodeT>
-  void Process(NodeT* node, const ProcessingState& state) {
+  ProcessResult Process(NodeT* node, const ProcessingState& state) {
     if (v8_flags.code_comments) {
       std::stringstream ss;
       ss << "--   " << graph_labeller()->NodeId(node) << ": "
@@ -762,8 +776,20 @@ class MaglevCodeGeneratingNodeProcessor {
     scratch_scope.Include(node->general_temporaries());
     scratch_scope.IncludeDouble(node->double_temporaries());
 
+#ifdef DEBUG
+    masm()->set_allow_allocate(node->properties().can_allocate());
+    masm()->set_allow_call(node->properties().is_call());
+    masm()->set_allow_deferred_call(node->properties().is_deferred_call());
+#endif
+
     node->GenerateCode(masm(), state);
 
+#ifdef DEBUG
+    masm()->set_allow_allocate(false);
+    masm()->set_allow_call(false);
+    masm()->set_allow_deferred_call(false);
+#endif
+
     if (std::is_base_of<ValueNode, NodeT>::value) {
       ValueNode* value_node = node->template Cast<ValueNode>();
       if (value_node->has_valid_live_range() && value_node->is_spilled()) {
@@ -776,8 +802,8 @@ class MaglevCodeGeneratingNodeProcessor {
             __ Move(masm()->GetStackSlot(value_node->spill_slot()),
                     ToRegister(source));
           } else {
-            __ Move(masm()->GetStackSlot(value_node->spill_slot()),
-                    ToDoubleRegister(source));
+            __ StoreFloat64(masm()->GetStackSlot(value_node->spill_slot()),
+                            ToDoubleRegister(source));
           }
         } else {
           // Otherwise, the result source stack slot should be equal to the
@@ -786,6 +812,7 @@ class MaglevCodeGeneratingNodeProcessor {
         }
       }
     }
+    return ProcessResult::kContinue;
   }
 
   void EmitBlockEndGapMoves(UnconditionalControlNode* node,
@@ -798,18 +825,9 @@ class MaglevCodeGeneratingNodeProcessor {
 
     int predecessor_id = state.block()->predecessor_id();
 
-// TODO(victorgomes): Add a scratch register scope to MaglevAssembler and
-// remove this arch depedent code.
-#ifdef V8_TARGET_ARCH_ARM64
-    UseScratchRegisterScope temps(masm_);
-    Register scratch = temps.AcquireX();
-    DoubleRegister double_scratch = temps.AcquireD();
-#elif V8_TARGET_ARCH_X64
-    Register scratch = kScratchRegister;
-    DoubleRegister double_scratch = kScratchDoubleReg;
-#else
-#error "Maglev does not supported this architecture."
-#endif
+    MaglevAssembler::ScratchRegisterScope temps(masm_);
+    Register scratch = temps.GetDefaultScratchRegister();
+    DoubleRegister double_scratch = temps.GetDefaultScratchDoubleRegister();
 
     // TODO(leszeks): Move these to fields, to allow their data structure
     // allocations to be reused. Will need some sort of state resetting.
@@ -851,7 +869,7 @@ class MaglevCodeGeneratingNodeProcessor {
              << graph_labeller()->NodeId(phi) << ")";
           __ RecordComment(ss.str());
         }
-        if (phi->value_representation() == ValueRepresentation::kFloat64) {
+        if (phi->use_double_register()) {
           DCHECK(!phi->decompresses_tagged_result());
           double_register_moves.RecordMove(node, source, target, false);
         } else {
@@ -859,7 +877,7 @@ class MaglevCodeGeneratingNodeProcessor {
                                     kDoesNotNeedDecompression);
         }
         if (target.IsAnyRegister()) {
-          if (phi->value_representation() == ValueRepresentation::kFloat64) {
+          if (phi->use_double_register()) {
             double_registers_set_by_phis.set(target.GetDoubleRegister());
           } else {
             registers_set_by_phis.set(target.GetRegister());
@@ -936,8 +954,9 @@ class SafepointingNodeProcessor {
   void PreProcessGraph(Graph* graph) {}
   void PostProcessGraph(Graph* graph) {}
   void PreProcessBasicBlock(BasicBlock* block) {}
-  void Process(NodeBase* node, const ProcessingState& state) {
+  ProcessResult Process(NodeBase* node, const ProcessingState& state) {
     local_isolate_->heap()->Safepoint();
+    return ProcessResult::kContinue;
   }
 
  private:
@@ -945,22 +964,18 @@ class SafepointingNodeProcessor {
 };
 
 namespace {
-struct FrameCount {
-  int total;
-  int js_frame;
-};
-
-FrameCount GetFrameCount(const DeoptFrame* deopt_frame) {
-  int total = 1;
-  int js_frame = 1;
-  while (deopt_frame->parent()) {
-    deopt_frame = deopt_frame->parent();
-    if (deopt_frame->type() != DeoptFrame::FrameType::kInlinedArgumentsFrame) {
+DeoptimizationFrameTranslation::FrameCount GetFrameCount(
+    const DeoptFrame* deopt_frame) {
+  int total = 0;
+  int js_frame = 0;
+  do {
+    if (deopt_frame->IsJsFrame()) {
       js_frame++;
     }
     total++;
-  }
-  return FrameCount{total, js_frame};
+    deopt_frame = deopt_frame->parent();
+  } while (deopt_frame);
+  return {total, js_frame};
 }
 
 BytecodeOffset GetBytecodeOffset(const DeoptFrame& deopt_frame) {
@@ -970,6 +985,8 @@ BytecodeOffset GetBytecodeOffset(const DeoptFrame& deopt_frame) {
     case DeoptFrame::FrameType::kInlinedArgumentsFrame:
       DCHECK_NOT_NULL(deopt_frame.parent());
       return GetBytecodeOffset(*deopt_frame.parent());
+    case DeoptFrame::FrameType::kConstructInvokeStubFrame:
+      return BytecodeOffset::None();
     case DeoptFrame::FrameType::kBuiltinContinuationFrame:
       return Builtins::GetContinuationBytecodeOffset(
           deopt_frame.as_builtin_continuation().builtin_id());
@@ -982,6 +999,8 @@ SourcePosition GetSourcePosition(const DeoptFrame& deopt_frame) {
     case DeoptFrame::FrameType::kInlinedArgumentsFrame:
       DCHECK_NOT_NULL(deopt_frame.parent());
       return GetSourcePosition(*deopt_frame.parent());
+    case DeoptFrame::FrameType::kConstructInvokeStubFrame:
+      return deopt_frame.as_construct_stub().source_position();
     case DeoptFrame::FrameType::kBuiltinContinuationFrame:
       return SourcePosition::Unknown();
   }
@@ -993,17 +1012,19 @@ compiler::SharedFunctionInfoRef GetSharedFunctionInfo(
       return deopt_frame.as_interpreted().unit().shared_function_info();
     case DeoptFrame::FrameType::kInlinedArgumentsFrame:
       return deopt_frame.as_inlined_arguments().unit().shared_function_info();
+    case DeoptFrame::FrameType::kConstructInvokeStubFrame:
+      return deopt_frame.as_construct_stub().unit().shared_function_info();
     case DeoptFrame::FrameType::kBuiltinContinuationFrame:
       return GetSharedFunctionInfo(*deopt_frame.parent());
   }
 }
 }  // namespace
 
-class MaglevTranslationArrayBuilder {
+class MaglevFrameTranslationBuilder {
  public:
-  MaglevTranslationArrayBuilder(
+  MaglevFrameTranslationBuilder(
       LocalIsolate* local_isolate, MaglevAssembler* masm,
-      TranslationArrayBuilder* translation_array_builder,
+      FrameTranslationBuilder* translation_array_builder,
       IdentityMap<int, base::DefaultAllocationPolicy>* deopt_literals)
       : local_isolate_(local_isolate),
         masm_(masm),
@@ -1011,110 +1032,39 @@ class MaglevTranslationArrayBuilder {
         deopt_literals_(deopt_literals) {}
 
   void BuildEagerDeopt(EagerDeoptInfo* deopt_info) {
-    auto [frame_count, jsframe_count] = GetFrameCount(&deopt_info->top_frame());
-    deopt_info->set_translation_index(
-        translation_array_builder_->BeginTranslation(
-            frame_count, jsframe_count,
-            deopt_info->feedback_to_update().IsValid()));
-    if (deopt_info->feedback_to_update().IsValid()) {
-      translation_array_builder_->AddUpdateFeedback(
-          GetDeoptLiteral(*deopt_info->feedback_to_update().vector),
-          deopt_info->feedback_to_update().index());
-    }
+    BuildBeginDeopt(deopt_info);
 
     const InputLocation* current_input_location = deopt_info->input_locations();
-    BuildDeoptFrame(deopt_info->top_frame(), current_input_location);
+    RecursiveBuildDeoptFrame(deopt_info->top_frame(), current_input_location);
   }
 
   void BuildLazyDeopt(LazyDeoptInfo* deopt_info) {
-    auto [frame_count, jsframe_count] = GetFrameCount(&deopt_info->top_frame());
-    deopt_info->set_translation_index(
-        translation_array_builder_->BeginTranslation(
-            frame_count, jsframe_count,
-            deopt_info->feedback_to_update().IsValid()));
-    if (deopt_info->feedback_to_update().IsValid()) {
-      translation_array_builder_->AddUpdateFeedback(
-          GetDeoptLiteral(*deopt_info->feedback_to_update().vector),
-          deopt_info->feedback_to_update().index());
-    }
+    BuildBeginDeopt(deopt_info);
 
     const InputLocation* current_input_location = deopt_info->input_locations();
 
     if (deopt_info->top_frame().parent()) {
       // Deopt input locations are in the order of deopt frame emission, so
       // update the pointer after emitting the parent frame.
-      BuildDeoptFrame(*deopt_info->top_frame().parent(),
-                      current_input_location);
+      RecursiveBuildDeoptFrame(*deopt_info->top_frame().parent(),
+                               current_input_location);
     }
 
     const DeoptFrame& top_frame = deopt_info->top_frame();
     switch (top_frame.type()) {
-      case DeoptFrame::FrameType::kInterpretedFrame: {
-        const InterpretedDeoptFrame& interpreted_frame =
-            top_frame.as_interpreted();
-
-        // Return offsets are counted from the end of the translation frame,
-        // which is the array [parameters..., locals..., accumulator]. Since
-        // it's the end, we don't need to worry about earlier frames.
-        int return_offset;
-        if (deopt_info->result_location() ==
-            interpreter::Register::virtual_accumulator()) {
-          return_offset = 0;
-        } else if (deopt_info->result_location().is_parameter()) {
-          // This is slightly tricky to reason about because of zero indexing
-          // and fence post errors. As an example, consider a frame with 2
-          // locals and 2 parameters, where we want argument index 1 -- looking
-          // at the array in reverse order we have:
-          //   [acc, r1, r0, a1, a0]
-          //                  ^
-          // and this calculation gives, correctly:
-          //   2 + 2 - 1 = 3
-          return_offset = interpreted_frame.unit().register_count() +
-                          interpreted_frame.unit().parameter_count() -
-                          deopt_info->result_location().ToParameterIndex();
-        } else {
-          return_offset = interpreted_frame.unit().register_count() -
-                          deopt_info->result_location().index();
-        }
-        translation_array_builder_->BeginInterpretedFrame(
-            interpreted_frame.bytecode_position(),
-            GetDeoptLiteral(GetSharedFunctionInfo(interpreted_frame)),
-            interpreted_frame.unit().register_count(), return_offset,
-            deopt_info->result_size());
-
-        BuildDeoptFrameValues(
-            interpreted_frame.unit(), interpreted_frame.frame_state(),
-            current_input_location, deopt_info->result_location(),
-            deopt_info->result_size());
-        break;
-      }
+      case DeoptFrame::FrameType::kInterpretedFrame:
+        return BuildSingleDeoptFrame(
+            top_frame.as_interpreted(), current_input_location,
+            deopt_info->result_location(), deopt_info->result_size());
       case DeoptFrame::FrameType::kInlinedArgumentsFrame:
         // The inlined arguments frame can never be the top frame.
         UNREACHABLE();
-      case DeoptFrame::FrameType::kBuiltinContinuationFrame: {
-        const BuiltinContinuationDeoptFrame& builtin_continuation_frame =
-            top_frame.as_builtin_continuation();
-
-        translation_array_builder_->BeginBuiltinContinuationFrame(
-            Builtins::GetContinuationBytecodeOffset(
-                builtin_continuation_frame.builtin_id()),
-            GetDeoptLiteral(GetSharedFunctionInfo(builtin_continuation_frame)),
-            builtin_continuation_frame.parameters().length());
-
-        // Closure
-        translation_array_builder_->StoreOptimizedOut();
-
-        // Parameters
-        for (ValueNode* value : builtin_continuation_frame.parameters()) {
-          BuildDeoptFrameSingleValue(value, *current_input_location);
-          current_input_location++;
-        }
-
-        // Context
-        ValueNode* value = builtin_continuation_frame.context();
-        BuildDeoptFrameSingleValue(value, *current_input_location);
-        current_input_location++;
-      }
+      case DeoptFrame::FrameType::kConstructInvokeStubFrame:
+        return BuildSingleDeoptFrame(top_frame.as_construct_stub(),
+                                     current_input_location);
+      case DeoptFrame::FrameType::kBuiltinContinuationFrame:
+        return BuildSingleDeoptFrame(top_frame.as_builtin_continuation(),
+                                     current_input_location);
     }
   }
 
@@ -1137,82 +1087,171 @@ class MaglevTranslationArrayBuilder {
                            result_location.index() + result_size - 1);
   }
 
-  void BuildDeoptFrame(const DeoptFrame& frame,
-                       const InputLocation*& current_input_location) {
+  void BuildBeginDeopt(DeoptInfo* deopt_info) {
+    auto [frame_count, jsframe_count] = GetFrameCount(&deopt_info->top_frame());
+    deopt_info->set_translation_index(
+        translation_array_builder_->BeginTranslation(
+            frame_count, jsframe_count,
+            deopt_info->feedback_to_update().IsValid()));
+    if (deopt_info->feedback_to_update().IsValid()) {
+      translation_array_builder_->AddUpdateFeedback(
+          GetDeoptLiteral(*deopt_info->feedback_to_update().vector),
+          deopt_info->feedback_to_update().index());
+    }
+  }
+
+  void RecursiveBuildDeoptFrame(const DeoptFrame& frame,
+                                const InputLocation*& current_input_location) {
     if (frame.parent()) {
       // Deopt input locations are in the order of deopt frame emission, so
       // update the pointer after emitting the parent frame.
-      BuildDeoptFrame(*frame.parent(), current_input_location);
+      RecursiveBuildDeoptFrame(*frame.parent(), current_input_location);
     }
 
     switch (frame.type()) {
-      case DeoptFrame::FrameType::kInterpretedFrame: {
-        const InterpretedDeoptFrame& interpreted_frame = frame.as_interpreted();
-        // Returns are used for updating an accumulator or register after a
-        // lazy deopt.
-        const int return_offset = 0;
-        const int return_count = 0;
-        translation_array_builder_->BeginInterpretedFrame(
-            interpreted_frame.bytecode_position(),
-            GetDeoptLiteral(GetSharedFunctionInfo(interpreted_frame)),
-            interpreted_frame.unit().register_count(), return_offset,
-            return_count);
-
-        BuildDeoptFrameValues(
-            interpreted_frame.unit(), interpreted_frame.frame_state(),
-            current_input_location, interpreter::Register::invalid_value(),
-            return_count);
-        break;
-      }
-      case DeoptFrame::FrameType::kInlinedArgumentsFrame: {
-        const InlinedArgumentsDeoptFrame& inlined_arguments_frame =
-            frame.as_inlined_arguments();
-
-        translation_array_builder_->BeginInlinedExtraArguments(
-            GetDeoptLiteral(GetSharedFunctionInfo(inlined_arguments_frame)),
-            static_cast<uint32_t>(inlined_arguments_frame.arguments().size()));
-
-        // Closure
-        translation_array_builder_->StoreLiteral(
-            GetDeoptLiteral(inlined_arguments_frame.unit().function()));
-
-        // Arguments
-        // TODO(victorgomes): Technically we don't need all arguments, only the
-        // extra ones. But doing this at the moment, since it matches the
-        // TurboFan behaviour.
-        for (ValueNode* value : inlined_arguments_frame.arguments()) {
-          BuildDeoptFrameSingleValue(value, *current_input_location);
-          current_input_location++;
-        }
-        break;
-      }
-      case DeoptFrame::FrameType::kBuiltinContinuationFrame: {
-        const BuiltinContinuationDeoptFrame& builtin_continuation_frame =
-            frame.as_builtin_continuation();
+      case DeoptFrame::FrameType::kInterpretedFrame:
+        return BuildSingleDeoptFrame(frame.as_interpreted(),
+                                     current_input_location);
+      case DeoptFrame::FrameType::kInlinedArgumentsFrame:
+        return BuildSingleDeoptFrame(frame.as_inlined_arguments(),
+                                     current_input_location);
+      case DeoptFrame::FrameType::kConstructInvokeStubFrame:
+        return BuildSingleDeoptFrame(frame.as_construct_stub(),
+                                     current_input_location);
+      case DeoptFrame::FrameType::kBuiltinContinuationFrame:
+        return BuildSingleDeoptFrame(frame.as_builtin_continuation(),
+                                     current_input_location);
+    }
+  }
 
-        translation_array_builder_->BeginBuiltinContinuationFrame(
-            Builtins::GetContinuationBytecodeOffset(
-                builtin_continuation_frame.builtin_id()),
-            GetDeoptLiteral(GetSharedFunctionInfo(builtin_continuation_frame)),
-            builtin_continuation_frame.parameters().length());
+  void BuildSingleDeoptFrame(const InterpretedDeoptFrame& frame,
+                             const InputLocation*& current_input_location,
+                             interpreter::Register result_location,
+                             int result_size) {
+    // Return offsets are counted from the end of the translation frame,
+    // which is the array [parameters..., locals..., accumulator]. Since
+    // it's the end, we don't need to worry about earlier frames.
+    int return_offset;
+    if (result_location == interpreter::Register::virtual_accumulator()) {
+      return_offset = 0;
+    } else if (result_location.is_parameter()) {
+      // This is slightly tricky to reason about because of zero indexing
+      // and fence post errors. As an example, consider a frame with 2
+      // locals and 2 parameters, where we want argument index 1 -- looking
+      // at the array in reverse order we have:
+      //   [acc, r1, r0, a1, a0]
+      //                  ^
+      // and this calculation gives, correctly:
+      //   2 + 2 - 1 = 3
+      return_offset = frame.unit().register_count() +
+                      frame.unit().parameter_count() -
+                      result_location.ToParameterIndex();
+    } else {
+      return_offset = frame.unit().register_count() - result_location.index();
+    }
+    translation_array_builder_->BeginInterpretedFrame(
+        frame.bytecode_position(),
+        GetDeoptLiteral(GetSharedFunctionInfo(frame)),
+        frame.unit().register_count(), return_offset, result_size);
 
-        // Closure
-        translation_array_builder_->StoreOptimizedOut();
+    BuildDeoptFrameValues(frame.unit(), frame.frame_state(), frame.closure(),
+                          current_input_location, result_location, result_size);
+  }
 
-        // Parameters
-        for (ValueNode* value : builtin_continuation_frame.parameters()) {
-          BuildDeoptFrameSingleValue(value, *current_input_location);
-          current_input_location++;
-        }
+  void BuildSingleDeoptFrame(const InterpretedDeoptFrame& frame,
+                             const InputLocation*& current_input_location) {
+    // Returns offset/count is used for updating an accumulator or register
+    // after a lazy deopt -- this function is overloaded to allow them to be
+    // passed in.
+    const int return_offset = 0;
+    const int return_count = 0;
+    translation_array_builder_->BeginInterpretedFrame(
+        frame.bytecode_position(),
+        GetDeoptLiteral(GetSharedFunctionInfo(frame)),
+        frame.unit().register_count(), return_offset, return_count);
+
+    BuildDeoptFrameValues(frame.unit(), frame.frame_state(), frame.closure(),
+                          current_input_location,
+                          interpreter::Register::invalid_value(), return_count);
+  }
 
-        // Context
-        ValueNode* value = builtin_continuation_frame.context();
-        BuildDeoptFrameSingleValue(value, *current_input_location);
-        current_input_location++;
+  void BuildSingleDeoptFrame(const InlinedArgumentsDeoptFrame& frame,
+                             const InputLocation*& current_input_location) {
+    translation_array_builder_->BeginInlinedExtraArguments(
+        GetDeoptLiteral(GetSharedFunctionInfo(frame)),
+        static_cast<uint32_t>(frame.arguments().size()));
 
-        break;
-      }
+    // Closure
+    BuildDeoptFrameSingleValue(frame.closure(), current_input_location);
+
+    // Arguments
+    // TODO(victorgomes): Technically we don't need all arguments, only the
+    // extra ones. But doing this at the moment, since it matches the
+    // TurboFan behaviour.
+    for (ValueNode* value : frame.arguments()) {
+      BuildDeoptFrameSingleValue(value, current_input_location);
+    }
+  }
+
+  void BuildSingleDeoptFrame(const ConstructInvokeStubDeoptFrame& frame,
+                             const InputLocation*& current_input_location) {
+    translation_array_builder_->BeginConstructInvokeStubFrame(
+        GetDeoptLiteral(GetSharedFunctionInfo(frame)));
+
+    // Implicit receiver
+    BuildDeoptFrameSingleValue(frame.receiver(), current_input_location);
+
+    // Context
+    BuildDeoptFrameSingleValue(frame.context(), current_input_location);
+  }
+
+  void BuildSingleDeoptFrame(const BuiltinContinuationDeoptFrame& frame,
+                             const InputLocation*& current_input_location) {
+    BytecodeOffset bailout_id =
+        Builtins::GetContinuationBytecodeOffset(frame.builtin_id());
+    int literal_id = GetDeoptLiteral(GetSharedFunctionInfo(frame));
+    int height = frame.parameters().length();
+
+    constexpr int kExtraFixedJSFrameParameters = 3;
+    if (frame.is_javascript()) {
+      translation_array_builder_->BeginJavaScriptBuiltinContinuationFrame(
+          bailout_id, literal_id, height + kExtraFixedJSFrameParameters);
+    } else {
+      translation_array_builder_->BeginBuiltinContinuationFrame(
+          bailout_id, literal_id, height);
+    }
+
+    // Closure
+    if (frame.is_javascript()) {
+      translation_array_builder_->StoreLiteral(
+          GetDeoptLiteral(frame.javascript_target()));
+    } else {
+      translation_array_builder_->StoreOptimizedOut();
+    }
+
+    // Parameters
+    for (ValueNode* value : frame.parameters()) {
+      BuildDeoptFrameSingleValue(value, current_input_location);
     }
+
+    // Extra fixed JS frame parameters. These at the end since JS builtins
+    // push their parameters in reverse order.
+    if (frame.is_javascript()) {
+      static_assert(kExtraFixedJSFrameParameters == 3);
+      // kJavaScriptCallTargetRegister
+      translation_array_builder_->StoreLiteral(
+          GetDeoptLiteral(frame.javascript_target()));
+      // kJavaScriptCallNewTargetRegister
+      translation_array_builder_->StoreLiteral(
+          GetDeoptLiteral(ReadOnlyRoots(local_isolate_).undefined_value()));
+      // kJavaScriptCallArgCountRegister
+      translation_array_builder_->StoreLiteral(GetDeoptLiteral(
+          Smi::FromInt(Builtins::GetStackParameterCount(frame.builtin_id()))));
+    }
+
+    // Context
+    ValueNode* value = frame.context();
+    BuildDeoptFrameSingleValue(value, current_input_location);
   }
 
   void BuildDeoptStoreRegister(const compiler::AllocatedOperand& operand,
@@ -1233,6 +1272,10 @@ class MaglevTranslationArrayBuilder {
         translation_array_builder_->StoreDoubleRegister(
             operand.GetDoubleRegister());
         break;
+      case ValueRepresentation::kHoleyFloat64:
+        translation_array_builder_->StoreHoleyDoubleRegister(
+            operand.GetDoubleRegister());
+        break;
     }
   }
 
@@ -1254,17 +1297,20 @@ class MaglevTranslationArrayBuilder {
       case ValueRepresentation::kFloat64:
         translation_array_builder_->StoreDoubleStackSlot(stack_slot);
         break;
+      case ValueRepresentation::kHoleyFloat64:
+        translation_array_builder_->StoreHoleyDoubleStackSlot(stack_slot);
+        break;
     }
   }
 
-  void BuildDeoptFrameSingleValue(ValueNode* value,
-                                  const InputLocation& input_location) {
-    if (input_location.operand().IsConstant()) {
+  void BuildDeoptFrameSingleValue(const ValueNode* value,
+                                  const InputLocation*& input_location) {
+    if (input_location->operand().IsConstant()) {
       translation_array_builder_->StoreLiteral(
           GetDeoptLiteral(*value->Reify(local_isolate_)));
     } else {
       const compiler::AllocatedOperand& operand =
-          compiler::AllocatedOperand::cast(input_location.operand());
+          compiler::AllocatedOperand::cast(input_location->operand());
       ValueRepresentation repr = value->properties().value_representation();
       if (operand.IsAnyRegister()) {
         BuildDeoptStoreRegister(operand, repr);
@@ -1272,26 +1318,20 @@ class MaglevTranslationArrayBuilder {
         BuildDeoptStoreStackSlot(operand, repr);
       }
     }
+    input_location++;
   }
 
   void BuildDeoptFrameValues(
       const MaglevCompilationUnit& compilation_unit,
       const CompactInterpreterFrameState* checkpoint_state,
-      const InputLocation*& input_location,
+      const ValueNode* closure, const InputLocation*& input_location,
       interpreter::Register result_location, int result_size) {
-    // Closure
-    if (compilation_unit.inlining_depth() == 0) {
-      int closure_index = DeoptStackSlotIndexFromFPOffset(
-          StandardFrameConstants::kFunctionOffset);
-      translation_array_builder_->StoreStackSlot(closure_index);
-    } else {
-      translation_array_builder_->StoreLiteral(
-          GetDeoptLiteral(compilation_unit.function()));
-    }
-
     // TODO(leszeks): The input locations array happens to be in the same order
-    // as parameters+context+locals+accumulator are accessed here. We should
-    // make this clearer and guard against this invariant failing.
+    // as closure+parameters+context+locals+accumulator are accessed here. We
+    // should make this clearer and guard against this invariant failing.
+
+    // Closure
+    BuildDeoptFrameSingleValue(closure, input_location);
 
     // Parameters
     {
@@ -1302,8 +1342,7 @@ class MaglevTranslationArrayBuilder {
             if (InReturnValues(reg, result_location, result_size)) {
               translation_array_builder_->StoreOptimizedOut();
             } else {
-              BuildDeoptFrameSingleValue(value, *input_location);
-              input_location++;
+              BuildDeoptFrameSingleValue(value, input_location);
             }
             i++;
           });
@@ -1311,8 +1350,7 @@ class MaglevTranslationArrayBuilder {
 
     // Context
     ValueNode* value = checkpoint_state->context(compilation_unit);
-    BuildDeoptFrameSingleValue(value, *input_location);
-    input_location++;
+    BuildDeoptFrameSingleValue(value, input_location);
 
     // Locals
     {
@@ -1326,8 +1364,7 @@ class MaglevTranslationArrayBuilder {
               i++;
             }
             DCHECK_EQ(i, reg.index());
-            BuildDeoptFrameSingleValue(value, *input_location);
-            input_location++;
+            BuildDeoptFrameSingleValue(value, input_location);
             i++;
           });
       while (i < compilation_unit.register_count()) {
@@ -1342,15 +1379,14 @@ class MaglevTranslationArrayBuilder {
           !InReturnValues(interpreter::Register::virtual_accumulator(),
                           result_location, result_size)) {
         ValueNode* value = checkpoint_state->accumulator(compilation_unit);
-        BuildDeoptFrameSingleValue(value, *input_location);
-        input_location++;
+        BuildDeoptFrameSingleValue(value, input_location);
       } else {
         translation_array_builder_->StoreOptimizedOut();
       }
     }
   }
 
-  int GetDeoptLiteral(Object obj) {
+  int GetDeoptLiteral(Tagged<Object> obj) {
     IdentityMapFindResult<int> res = deopt_literals_->FindOrInsert(obj);
     if (!res.already_exists) {
       DCHECK_EQ(0, *res.entry);
@@ -1365,7 +1401,7 @@ class MaglevTranslationArrayBuilder {
 
   LocalIsolate* local_isolate_;
   MaglevAssembler* masm_;
-  TranslationArrayBuilder* translation_array_builder_;
+  FrameTranslationBuilder* translation_array_builder_;
   IdentityMap<int, base::DefaultAllocationPolicy>* deopt_literals_;
 };
 
@@ -1378,33 +1414,68 @@ MaglevCodeGenerator::MaglevCodeGenerator(
       safepoint_table_builder_(compilation_info->zone(),
                                graph->tagged_stack_slots(),
                                graph->untagged_stack_slots()),
-      translation_array_builder_(compilation_info->zone()),
+      frame_translation_builder_(compilation_info->zone()),
       code_gen_state_(compilation_info, &safepoint_table_builder_),
       masm_(isolate->GetMainThreadIsolateUnsafe(), &code_gen_state_),
       graph_(graph),
       deopt_literals_(isolate->heap()->heap()) {}
 
-void MaglevCodeGenerator::Assemble() {
-  EmitCode();
+bool MaglevCodeGenerator::Assemble() {
+  if (!EmitCode()) {
+#ifdef V8_TARGET_ARCH_ARM
+    // Even if we fail, we force emit the constant pool, so that it is empty.
+    __ CheckConstPool(true, false);
+#endif
+    return false;
+  }
+
   EmitMetadata();
+
+  if (v8_flags.maglev_build_code_on_background) {
+    code_ = local_isolate_->heap()->NewPersistentMaybeHandle(
+        BuildCodeObject(local_isolate_));
+  } else if (v8_flags.maglev_deopt_data_on_background) {
+    // Only do this if not --maglev-build-code-on-background, since that will do
+    // it itself.
+    deopt_data_ = local_isolate_->heap()->NewPersistentHandle(
+        GenerateDeoptimizationData(local_isolate_));
+  }
+  return true;
 }
 
 MaybeHandle<Code> MaglevCodeGenerator::Generate(Isolate* isolate) {
-  return BuildCodeObject(isolate);
+  if (v8_flags.maglev_build_code_on_background) {
+    Handle<Code> code;
+    if (code_.ToHandle(&code)) {
+      return handle(*code, isolate);
+    }
+    return kNullMaybeHandle;
+  }
+
+  return BuildCodeObject(isolate->main_thread_local_isolate());
 }
 
-void MaglevCodeGenerator::EmitCode() {
+bool MaglevCodeGenerator::EmitCode() {
   GraphProcessor<NodeMultiProcessor<SafepointingNodeProcessor,
                                     MaglevCodeGeneratingNodeProcessor>>
       processor(SafepointingNodeProcessor{local_isolate_},
                 MaglevCodeGeneratingNodeProcessor{masm()});
   RecordInlinedFunctions();
+
+  if (graph_->is_osr()) {
+    masm_.Abort(AbortReason::kShouldNotDirectlyEnterOsrFunction);
+    masm_.RecordComment("-- OSR entrpoint --");
+    masm_.BindJumpTarget(code_gen_state_.osr_entry());
+  }
+
   processor.ProcessGraph(graph_);
   EmitDeferredCode();
-  EmitDeopts();
-  if (code_gen_failed_) return;
+  if (!EmitDeopts()) return false;
   EmitExceptionHandlerTrampolines();
   __ FinishCode();
+
+  code_gen_succeeded_ = true;
+  return true;
 }
 
 void MaglevCodeGenerator::RecordInlinedFunctions() {
@@ -1436,16 +1507,15 @@ void MaglevCodeGenerator::EmitDeferredCode() {
   }
 }
 
-void MaglevCodeGenerator::EmitDeopts() {
+bool MaglevCodeGenerator::EmitDeopts() {
   const size_t num_deopts = code_gen_state_.eager_deopts().size() +
                             code_gen_state_.lazy_deopts().size();
   if (num_deopts > Deoptimizer::kMaxNumberOfEntries) {
-    code_gen_failed_ = true;
-    return;
+    return false;
   }
 
-  MaglevTranslationArrayBuilder translation_builder(
-      local_isolate_, &masm_, &translation_array_builder_, &deopt_literals_);
+  MaglevFrameTranslationBuilder translation_builder(
+      local_isolate_, &masm_, &frame_translation_builder_, &deopt_literals_);
 
   // Deoptimization exits must be as small as possible, since their count grows
   // with function size. These labels are an optimization which extracts the
@@ -1511,6 +1581,8 @@ void MaglevCodeGenerator::EmitDeopts() {
         deopt_index);
     deopt_index++;
   }
+
+  return true;
 }
 
 void MaglevCodeGenerator::EmitExceptionHandlerTrampolines() {
@@ -1536,110 +1608,138 @@ void MaglevCodeGenerator::EmitMetadata() {
   }
 }
 
-MaybeHandle<Code> MaglevCodeGenerator::BuildCodeObject(Isolate* isolate) {
-  if (code_gen_failed_) return {};
+MaybeHandle<Code> MaglevCodeGenerator::BuildCodeObject(
+    LocalIsolate* local_isolate) {
+  if (!code_gen_succeeded_) return {};
+
+  Handle<DeoptimizationData> deopt_data =
+      (v8_flags.maglev_deopt_data_on_background &&
+       !v8_flags.maglev_build_code_on_background)
+          ? deopt_data_
+          : GenerateDeoptimizationData(local_isolate);
+  CHECK(!deopt_data->is_null());
 
   CodeDesc desc;
-  masm()->GetCode(isolate, &desc, &safepoint_table_builder_,
+  masm()->GetCode(local_isolate, &desc, &safepoint_table_builder_,
                   handler_table_offset_);
-  return Factory::CodeBuilder{isolate, desc, CodeKind::MAGLEV}
+  return Factory::CodeBuilder{local_isolate, desc, CodeKind::MAGLEV}
       .set_stack_slots(stack_slot_count_with_fixed_frame())
-      .set_deoptimization_data(GenerateDeoptimizationData(isolate))
+      .set_deoptimization_data(deopt_data)
+      .set_osr_offset(code_gen_state_.compilation_info()->toplevel_osr_offset())
       .TryBuild();
 }
 
 Handle<DeoptimizationData> MaglevCodeGenerator::GenerateDeoptimizationData(
-    Isolate* isolate) {
+    LocalIsolate* local_isolate) {
   int eager_deopt_count =
       static_cast<int>(code_gen_state_.eager_deopts().size());
   int lazy_deopt_count = static_cast<int>(code_gen_state_.lazy_deopts().size());
   int deopt_count = lazy_deopt_count + eager_deopt_count;
-  if (deopt_count == 0) {
-    return DeoptimizationData::Empty(isolate);
+  if (deopt_count == 0 && !graph_->is_osr()) {
+    return DeoptimizationData::Empty(local_isolate);
   }
   Handle<DeoptimizationData> data =
-      DeoptimizationData::New(isolate, deopt_count, AllocationType::kOld);
+      DeoptimizationData::New(local_isolate, deopt_count, AllocationType::kOld);
 
-  Handle<TranslationArray> translation_array =
-      translation_array_builder_.ToTranslationArray(isolate->factory());
+  Handle<DeoptimizationFrameTranslation> translations =
+      frame_translation_builder_.ToFrameTranslation(local_isolate->factory());
   {
     DisallowGarbageCollection no_gc;
-    auto raw_data = *data;
+    Tagged<DeoptimizationData> raw_data = *data;
 
-    raw_data.SetTranslationByteArray(*translation_array);
-    raw_data.SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_));
-    raw_data.SetOptimizationId(Smi::FromInt(isolate->NextOptimizationId()));
+    raw_data->SetFrameTranslation(*translations);
+    raw_data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_));
+    raw_data->SetOptimizationId(
+        Smi::FromInt(local_isolate->NextOptimizationId()));
 
     DCHECK_NE(deopt_exit_start_offset_, -1);
-    raw_data.SetDeoptExitStart(Smi::FromInt(deopt_exit_start_offset_));
-    raw_data.SetEagerDeoptCount(Smi::FromInt(eager_deopt_count));
-    raw_data.SetLazyDeoptCount(Smi::FromInt(lazy_deopt_count));
-
-    raw_data.SetSharedFunctionInfo(*code_gen_state_.compilation_info()
-                                        ->toplevel_compilation_unit()
-                                        ->shared_function_info()
-                                        .object());
+    raw_data->SetDeoptExitStart(Smi::FromInt(deopt_exit_start_offset_));
+    raw_data->SetEagerDeoptCount(Smi::FromInt(eager_deopt_count));
+    raw_data->SetLazyDeoptCount(Smi::FromInt(lazy_deopt_count));
+
+    raw_data->SetSharedFunctionInfo(*code_gen_state_.compilation_info()
+                                         ->toplevel_compilation_unit()
+                                         ->shared_function_info()
+                                         .object());
   }
 
-  Handle<DeoptimizationLiteralArray> literals =
-      isolate->factory()->NewDeoptimizationLiteralArray(deopt_literals_.size() +
-                                                        1);
   int inlined_functions_size =
       static_cast<int>(graph_->inlined_functions().size());
+  Handle<DeoptimizationLiteralArray> literals =
+      local_isolate->factory()->NewDeoptimizationLiteralArray(
+          deopt_literals_.size() + inlined_functions_size + 1);
   Handle<PodArray<InliningPosition>> inlining_positions =
-      PodArray<InliningPosition>::New(isolate, inlined_functions_size);
-  for (int i = 0; i < inlined_functions_size; ++i) {
-    inlining_positions->set(i, graph_->inlined_functions()[i].position);
-  }
+      PodArray<InliningPosition>::New(local_isolate, inlined_functions_size);
 
   DisallowGarbageCollection no_gc;
 
-  auto raw_literals = *literals;
-  auto raw_data = *data;
-  IdentityMap<int, base::DefaultAllocationPolicy>::IteratableScope iterate(
-      &deopt_literals_);
-  for (auto it = iterate.begin(); it != iterate.end(); ++it) {
-    raw_literals.set(*it.entry(), it.key());
+  Tagged<DeoptimizationLiteralArray> raw_literals = *literals;
+  Tagged<DeoptimizationData> raw_data = *data;
+  {
+    IdentityMap<int, base::DefaultAllocationPolicy>::IteratableScope iterate(
+        &deopt_literals_);
+    for (auto it = iterate.begin(); it != iterate.end(); ++it) {
+      raw_literals->set(*it.entry(), it.key());
+    }
   }
   // Add the bytecode to the deopt literals to make sure it's held strongly.
-  // TODO(leszeks): Do this for inlined functions too.
-  raw_literals.set(deopt_literals_.size(), *code_gen_state_.compilation_info()
-                                                ->toplevel_compilation_unit()
-                                                ->bytecode()
-                                                .object());
-  raw_data.SetLiteralArray(raw_literals);
-  raw_data.SetInliningPositions(*inlining_positions);
-
-  // TODO(leszeks): Fix once we have OSR.
-  BytecodeOffset osr_offset = BytecodeOffset::None();
-  raw_data.SetOsrBytecodeOffset(Smi::FromInt(osr_offset.ToInt()));
-  raw_data.SetOsrPcOffset(Smi::FromInt(-1));
+  int literal_offsets = deopt_literals_.size();
+  // Clear the deopt literals while the local isolate is still active.
+  deopt_literals_.Clear();
+
+  for (int i = 0; i < inlined_functions_size; i++) {
+    auto inlined_function_info = graph_->inlined_functions()[i];
+    inlining_positions->set(i, inlined_function_info.position);
+    raw_literals->set(literal_offsets++, *inlined_function_info.bytecode_array);
+  }
+  raw_literals->set(literal_offsets, *code_gen_state_.compilation_info()
+                                          ->toplevel_compilation_unit()
+                                          ->bytecode()
+                                          .object());
+  raw_data->SetLiteralArray(raw_literals);
+  raw_data->SetInliningPositions(*inlining_positions);
+
+  auto info = code_gen_state_.compilation_info();
+  raw_data->SetOsrBytecodeOffset(
+      Smi::FromInt(info->toplevel_osr_offset().ToInt()));
+  if (graph_->is_osr()) {
+    raw_data->SetOsrPcOffset(Smi::FromInt(code_gen_state_.osr_entry()->pos()));
+  } else {
+    raw_data->SetOsrPcOffset(Smi::FromInt(-1));
+  }
 
   // Populate deoptimization entries.
   int i = 0;
   for (EagerDeoptInfo* deopt_info : code_gen_state_.eager_deopts()) {
     DCHECK_NE(deopt_info->translation_index(), -1);
-    raw_data.SetBytecodeOffset(i, GetBytecodeOffset(deopt_info->top_frame()));
-    raw_data.SetTranslationIndex(i,
-                                 Smi::FromInt(deopt_info->translation_index()));
-    raw_data.SetPc(i, Smi::FromInt(deopt_info->deopt_entry_label()->pos()));
+    raw_data->SetBytecodeOffset(i, GetBytecodeOffset(deopt_info->top_frame()));
+    raw_data->SetTranslationIndex(
+        i, Smi::FromInt(deopt_info->translation_index()));
+    raw_data->SetPc(i, Smi::FromInt(deopt_info->deopt_entry_label()->pos()));
 #ifdef DEBUG
-    raw_data.SetNodeId(i, Smi::FromInt(i));
+    raw_data->SetNodeId(i, Smi::FromInt(i));
 #endif  // DEBUG
     i++;
   }
   for (LazyDeoptInfo* deopt_info : code_gen_state_.lazy_deopts()) {
     DCHECK_NE(deopt_info->translation_index(), -1);
-    raw_data.SetBytecodeOffset(i, GetBytecodeOffset(deopt_info->top_frame()));
-    raw_data.SetTranslationIndex(i,
-                                 Smi::FromInt(deopt_info->translation_index()));
-    raw_data.SetPc(i, Smi::FromInt(deopt_info->deopt_entry_label()->pos()));
+    raw_data->SetBytecodeOffset(i, GetBytecodeOffset(deopt_info->top_frame()));
+    raw_data->SetTranslationIndex(
+        i, Smi::FromInt(deopt_info->translation_index()));
+    raw_data->SetPc(i, Smi::FromInt(deopt_info->deopt_entry_label()->pos()));
 #ifdef DEBUG
-    raw_data.SetNodeId(i, Smi::FromInt(i));
+    raw_data->SetNodeId(i, Smi::FromInt(i));
 #endif  // DEBUG
     i++;
   }
 
+#ifdef DEBUG
+  raw_data->Verify(code_gen_state_.compilation_info()
+                       ->toplevel_compilation_unit()
+                       ->bytecode()
+                       .object());
+#endif
+
   return data;
 }
 
diff --git a/deps/v8/src/maglev/maglev-code-generator.h b/deps/v8/src/maglev/maglev-code-generator.h
index 53b1f5279e3e61..700f71792efeb8 100644
--- a/deps/v8/src/maglev/maglev-code-generator.h
+++ b/deps/v8/src/maglev/maglev-code-generator.h
@@ -7,7 +7,7 @@
 
 #include "src/codegen/maglev-safepoint-table.h"
 #include "src/common/globals.h"
-#include "src/deoptimizer/translation-array.h"
+#include "src/deoptimizer/frame-translation-builder.h"
 #include "src/maglev/maglev-assembler.h"
 #include "src/maglev/maglev-code-gen-state.h"
 #include "src/utils/identity-map.h"
@@ -24,20 +24,21 @@ class MaglevCodeGenerator final {
   MaglevCodeGenerator(LocalIsolate* isolate,
                       MaglevCompilationInfo* compilation_info, Graph* graph);
 
-  void Assemble();
+  V8_NODISCARD bool Assemble();
 
   MaybeHandle<Code> Generate(Isolate* isolate);
 
  private:
-  void EmitCode();
+  V8_NODISCARD bool EmitCode();
   void EmitDeferredCode();
-  void EmitDeopts();
+  V8_NODISCARD bool EmitDeopts();
   void EmitExceptionHandlerTrampolines();
   void EmitMetadata();
   void RecordInlinedFunctions();
 
-  MaybeHandle<Code> BuildCodeObject(Isolate* isolate);
-  Handle<DeoptimizationData> GenerateDeoptimizationData(Isolate* isolate);
+  Handle<DeoptimizationData> GenerateDeoptimizationData(
+      LocalIsolate* local_isolate);
+  MaybeHandle<Code> BuildCodeObject(LocalIsolate* local_isolate);
 
   int stack_slot_count() const { return code_gen_state_.stack_slots(); }
   int stack_slot_count_with_fixed_frame() const {
@@ -48,7 +49,7 @@ class MaglevCodeGenerator final {
 
   LocalIsolate* local_isolate_;
   MaglevSafepointTableBuilder safepoint_table_builder_;
-  TranslationArrayBuilder translation_array_builder_;
+  FrameTranslationBuilder frame_translation_builder_;
   MaglevCodeGenState code_gen_state_;
   MaglevAssembler masm_;
   Graph* const graph_;
@@ -58,7 +59,10 @@ class MaglevCodeGenerator final {
   int handler_table_offset_ = 0;
   int inlined_function_count_ = 0;
 
-  bool code_gen_failed_ = false;
+  bool code_gen_succeeded_ = false;
+
+  Handle<DeoptimizationData> deopt_data_;
+  MaybeHandle<Code> code_;
 };
 
 }  // namespace maglev
diff --git a/deps/v8/src/maglev/maglev-compilation-info.cc b/deps/v8/src/maglev/maglev-compilation-info.cc
index 6c858a57158ac7..647f7cff18f7d8 100644
--- a/deps/v8/src/maglev/maglev-compilation-info.cc
+++ b/deps/v8/src/maglev/maglev-compilation-info.cc
@@ -28,11 +28,8 @@ class V8_NODISCARD MaglevCompilationHandleScope final {
  public:
   MaglevCompilationHandleScope(Isolate* isolate,
                                maglev::MaglevCompilationInfo* info)
-      : info_(info),
-        persistent_(isolate),
-        exported_info_(info),
-        canonical_(isolate, &exported_info_) {
-    info->ReopenHandlesInNewHandleScope(isolate);
+      : info_(info), persistent_(isolate), exported_info_(info) {
+    info->ReopenAndCanonicalizeHandlesInNewScope(isolate);
   }
 
   ~MaglevCompilationHandleScope() {
@@ -43,25 +40,32 @@ class V8_NODISCARD MaglevCompilationHandleScope final {
   maglev::MaglevCompilationInfo* const info_;
   PersistentHandlesScope persistent_;
   ExportedMaglevCompilationInfo exported_info_;
-  CanonicalHandleScopeForMaglev canonical_;
 };
 
 }  // namespace
 
 MaglevCompilationInfo::MaglevCompilationInfo(Isolate* isolate,
-                                             Handle<JSFunction> function)
+                                             Handle<JSFunction> function,
+                                             BytecodeOffset osr_offset)
     : zone_(isolate->allocator(), kMaglevZoneName),
       broker_(new compiler::JSHeapBroker(
-          isolate, zone(), v8_flags.trace_heap_broker, CodeKind::MAGLEV))
+          isolate, zone(), v8_flags.trace_heap_broker, CodeKind::MAGLEV)),
+      toplevel_function_(function),
+      osr_offset_(osr_offset)
 #define V(Name) , Name##_(v8_flags.Name)
           MAGLEV_COMPILATION_FLAG_LIST(V)
 #undef V
       ,
       specialize_to_function_context_(
+          osr_offset == BytecodeOffset::None() &&
           v8_flags.maglev_function_context_specialization &&
-          function->raw_feedback_cell().map() ==
+          function->raw_feedback_cell()->map() ==
               ReadOnlyRoots(isolate).one_closure_cell_map()) {
-  DCHECK(v8_flags.maglev);
+  DCHECK(maglev::IsMaglevEnabled());
+  DCHECK_IMPLIES(osr_offset != BytecodeOffset::None(),
+                 maglev::IsMaglevOsrEnabled());
+  canonical_handles_ = std::make_unique<CanonicalHandlesMap>(
+      isolate->heap(), ZoneAllocationPolicy(&zone_));
   compiler::CurrentHeapBrokerScope current_broker(broker_.get());
 
   collect_source_positions_ = isolate->NeedsDetailedOptimizedCodeLineInfo();
@@ -76,12 +80,12 @@ MaglevCompilationInfo::MaglevCompilationInfo(Isolate* isolate,
       zone()->New<compiler::CompilationDependencies>(broker(), zone());
   USE(deps);  // The deps register themselves in the heap broker.
 
+  broker()->AttachCompilationInfo(this);
+
   // Heap broker initialization may already use IsPendingAllocation.
   isolate->heap()->PublishPendingAllocations();
-
-  broker()->SetTargetNativeContextRef(
+  broker()->InitializeAndStartSerializing(
       handle(function->native_context(), isolate));
-  broker()->InitializeAndStartSerializing();
   broker()->StopSerializing();
 
   // Serialization may have allocated.
@@ -103,7 +107,25 @@ void MaglevCompilationInfo::set_code_generator(
   code_generator_ = std::move(code_generator);
 }
 
-void MaglevCompilationInfo::ReopenHandlesInNewHandleScope(Isolate* isolate) {}
+namespace {
+template <typename T>
+Handle<T> CanonicalHandle(CanonicalHandlesMap* canonical_handles,
+                          Tagged<T> object, Isolate* isolate) {
+  DCHECK_NOT_NULL(canonical_handles);
+  DCHECK(PersistentHandlesScope::IsActive(isolate));
+  auto find_result = canonical_handles->FindOrInsert(object);
+  if (!find_result.already_exists) {
+    *find_result.entry = Handle<T>(object, isolate).location();
+  }
+  return Handle<T>(*find_result.entry);
+}
+}  // namespace
+
+void MaglevCompilationInfo::ReopenAndCanonicalizeHandlesInNewScope(
+    Isolate* isolate) {
+  toplevel_function_ =
+      CanonicalHandle(canonical_handles_.get(), *toplevel_function_, isolate);
+}
 
 void MaglevCompilationInfo::set_persistent_handles(
     std::unique_ptr<PersistentHandles>&& persistent_handles) {
@@ -125,6 +147,10 @@ void MaglevCompilationInfo::set_canonical_handles(
   DCHECK_NOT_NULL(canonical_handles_);
 }
 
+bool MaglevCompilationInfo::is_detached() {
+  return toplevel_function_->context()->IsDetached();
+}
+
 std::unique_ptr<CanonicalHandlesMap>
 MaglevCompilationInfo::DetachCanonicalHandles() {
   DCHECK_NOT_NULL(canonical_handles_);
diff --git a/deps/v8/src/maglev/maglev-compilation-info.h b/deps/v8/src/maglev/maglev-compilation-info.h
index 1f8b6073fe6223..04c151a3fa6d2d 100644
--- a/deps/v8/src/maglev/maglev-compilation-info.h
+++ b/deps/v8/src/maglev/maglev-compilation-info.h
@@ -45,11 +45,12 @@ class MaglevCodeGenerator;
 
 class MaglevCompilationInfo final {
  public:
-  static std::unique_ptr<MaglevCompilationInfo> New(
-      Isolate* isolate, Handle<JSFunction> function) {
+  static std::unique_ptr<MaglevCompilationInfo> New(Isolate* isolate,
+                                                    Handle<JSFunction> function,
+                                                    BytecodeOffset osr_offset) {
     // Doesn't use make_unique due to the private ctor.
     return std::unique_ptr<MaglevCompilationInfo>(
-        new MaglevCompilationInfo(isolate, function));
+        new MaglevCompilationInfo(isolate, function, osr_offset));
   }
   ~MaglevCompilationInfo();
 
@@ -58,6 +59,14 @@ class MaglevCompilationInfo final {
   MaglevCompilationUnit* toplevel_compilation_unit() const {
     return toplevel_compilation_unit_;
   }
+  Handle<JSFunction> toplevel_function() const { return toplevel_function_; }
+  BytecodeOffset toplevel_osr_offset() const { return osr_offset_; }
+  bool toplevel_is_osr() const { return osr_offset_ != BytecodeOffset::None(); }
+  void set_code(Handle<Code> code) {
+    DCHECK(code_.is_null());
+    code_ = code;
+  }
+  MaybeHandle<Code> get_code() { return code_; }
 
   bool has_graph_labeller() const { return !!graph_labeller_; }
   void set_graph_labeller(MaglevGraphLabeller* graph_labeller);
@@ -83,7 +92,7 @@ class MaglevCompilationInfo final {
 
   // Must be called from within a MaglevCompilationHandleScope. Transfers owned
   // handles (e.g. shared_, function_) to the new scope.
-  void ReopenHandlesInNewHandleScope(Isolate* isolate);
+  void ReopenAndCanonicalizeHandlesInNewScope(Isolate* isolate);
 
   // Persistent and canonical handles are passed back and forth between the
   // Isolate, this info, and the LocalIsolate.
@@ -94,13 +103,27 @@ class MaglevCompilationInfo final {
       std::unique_ptr<CanonicalHandlesMap>&& canonical_handles);
   std::unique_ptr<CanonicalHandlesMap> DetachCanonicalHandles();
 
+  bool is_detached();
+
  private:
-  MaglevCompilationInfo(Isolate* isolate, Handle<JSFunction> function);
+  MaglevCompilationInfo(Isolate* isolate, Handle<JSFunction> function,
+                        BytecodeOffset osr_offset);
+
+  // Storing the raw pointer to the CanonicalHandlesMap is generally not safe.
+  // Use DetachCanonicalHandles() to transfer ownership instead.
+  // We explicitly allow the JSHeapBroker to store the raw pointer as it is
+  // guaranteed that the MaglevCompilationInfo's lifetime exceeds the lifetime
+  // of the broker.
+  CanonicalHandlesMap* canonical_handles() { return canonical_handles_.get(); }
+  friend compiler::JSHeapBroker;
 
   Zone zone_;
   const std::unique_ptr<compiler::JSHeapBroker> broker_;
   // Must be initialized late since it requires an initialized heap broker.
   MaglevCompilationUnit* toplevel_compilation_unit_ = nullptr;
+  Handle<JSFunction> toplevel_function_;
+  Handle<Code> code_;
+  BytecodeOffset osr_offset_;
 
   std::unique_ptr<MaglevGraphLabeller> graph_labeller_;
 
diff --git a/deps/v8/src/maglev/maglev-compilation-unit.cc b/deps/v8/src/maglev/maglev-compilation-unit.cc
index 29da7bc49f9cde..4be684ca283460 100644
--- a/deps/v8/src/maglev/maglev-compilation-unit.cc
+++ b/deps/v8/src/maglev/maglev-compilation-unit.cc
@@ -4,6 +4,7 @@
 
 #include "src/maglev/maglev-compilation-unit.h"
 
+#include "src/compiler/heap-refs.h"
 #include "src/compiler/js-heap-broker.h"
 #include "src/maglev/maglev-compilation-info.h"
 #include "src/maglev/maglev-graph-labeller.h"
@@ -17,20 +18,31 @@ MaglevCompilationUnit::MaglevCompilationUnit(MaglevCompilationInfo* info,
                                              Handle<JSFunction> function)
     : MaglevCompilationUnit(
           info, nullptr,
-          MakeRef(info->broker(),
-                  info->broker()->CanonicalPersistentHandle(function))) {}
+          MakeRef(info->broker(), info->broker()->CanonicalPersistentHandle(
+                                      function->shared())),
+          MakeRef(info->broker(), info->broker()->CanonicalPersistentHandle(
+                                      function->feedback_vector()))) {}
 
 MaglevCompilationUnit::MaglevCompilationUnit(
     MaglevCompilationInfo* info, const MaglevCompilationUnit* caller,
-    compiler::JSFunctionRef function)
+    compiler::SharedFunctionInfoRef shared_function_info,
+    compiler::FeedbackVectorRef feedback_vector)
     : info_(info),
       caller_(caller),
-      function_(function),
-      shared_function_info_(function_.shared(broker())),
-      bytecode_(shared_function_info_.GetBytecodeArray(broker())),
-      feedback_(function_.feedback_vector(info_->broker()).value()),
-      register_count_(bytecode_.register_count()),
-      parameter_count_(bytecode_.parameter_count()),
+      shared_function_info_(shared_function_info),
+      bytecode_(shared_function_info.GetBytecodeArray(broker())),
+      feedback_(feedback_vector),
+      register_count_(bytecode_->register_count()),
+      parameter_count_(bytecode_->parameter_count()),
+      inlining_depth_(caller == nullptr ? 0 : caller->inlining_depth_ + 1) {}
+
+MaglevCompilationUnit::MaglevCompilationUnit(
+    MaglevCompilationInfo* info, const MaglevCompilationUnit* caller,
+    int register_count, int parameter_count)
+    : info_(info),
+      caller_(caller),
+      register_count_(register_count),
+      parameter_count_(parameter_count),
       inlining_depth_(caller == nullptr ? 0 : caller->inlining_depth_ + 1) {}
 
 compiler::JSHeapBroker* MaglevCompilationUnit::broker() const {
@@ -54,6 +66,14 @@ void MaglevCompilationUnit::RegisterNodeInGraphLabeller(const Node* node) {
   }
 }
 
+bool MaglevCompilationUnit::is_osr() const {
+  return inlining_depth_ == 0 && info_->toplevel_is_osr();
+}
+
+BytecodeOffset MaglevCompilationUnit::osr_offset() const {
+  return is_osr() ? info_->toplevel_osr_offset() : BytecodeOffset::None();
+}
+
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/maglev/maglev-compilation-unit.h b/deps/v8/src/maglev/maglev-compilation-unit.h
index 023285f6be6191..fa62255f5c5554 100644
--- a/deps/v8/src/maglev/maglev-compilation-unit.h
+++ b/deps/v8/src/maglev/maglev-compilation-unit.h
@@ -26,10 +26,19 @@ class MaglevCompilationUnit : public ZoneObject {
                                     Handle<JSFunction> function) {
     return zone->New<MaglevCompilationUnit>(info, function);
   }
-  static MaglevCompilationUnit* NewInner(Zone* zone,
+  static MaglevCompilationUnit* NewInner(
+      Zone* zone, const MaglevCompilationUnit* caller,
+      compiler::SharedFunctionInfoRef shared_function_info,
+      compiler::FeedbackVectorRef feedback_vector) {
+    return zone->New<MaglevCompilationUnit>(
+        caller->info(), caller, shared_function_info, feedback_vector);
+  }
+  static MaglevCompilationUnit* NewDummy(Zone* zone,
                                          const MaglevCompilationUnit* caller,
-                                         compiler::JSFunctionRef function) {
-    return zone->New<MaglevCompilationUnit>(caller->info(), caller, function);
+                                         int register_count,
+                                         int parameter_count) {
+    return zone->New<MaglevCompilationUnit>(caller->info(), caller,
+                                            register_count, parameter_count);
   }
 
   MaglevCompilationUnit(MaglevCompilationInfo* info,
@@ -37,7 +46,12 @@ class MaglevCompilationUnit : public ZoneObject {
 
   MaglevCompilationUnit(MaglevCompilationInfo* info,
                         const MaglevCompilationUnit* caller,
-                        compiler::JSFunctionRef function);
+                        compiler::SharedFunctionInfoRef shared_function_info,
+                        compiler::FeedbackVectorRef feedback_vector);
+
+  MaglevCompilationUnit(MaglevCompilationInfo* info,
+                        const MaglevCompilationUnit* caller, int register_count,
+                        int parameter_count);
 
   MaglevCompilationInfo* info() const { return info_; }
   const MaglevCompilationUnit* caller() const { return caller_; }
@@ -46,25 +60,26 @@ class MaglevCompilationUnit : public ZoneObject {
   Zone* zone() const;
   int register_count() const { return register_count_; }
   int parameter_count() const { return parameter_count_; }
+  bool is_osr() const;
+  BytecodeOffset osr_offset() const;
   int inlining_depth() const { return inlining_depth_; }
+  bool is_inline() const { return inlining_depth_ != 0; }
   bool has_graph_labeller() const;
   MaglevGraphLabeller* graph_labeller() const;
-  const compiler::SharedFunctionInfoRef& shared_function_info() const {
-    return shared_function_info_;
+  compiler::SharedFunctionInfoRef shared_function_info() const {
+    return shared_function_info_.value();
   }
-  const compiler::JSFunctionRef& function() const { return function_; }
-  const compiler::BytecodeArrayRef& bytecode() const { return bytecode_; }
-  const compiler::FeedbackVectorRef& feedback() const { return feedback_; }
+  compiler::BytecodeArrayRef bytecode() const { return bytecode_.value(); }
+  compiler::FeedbackVectorRef feedback() const { return feedback_.value(); }
 
   void RegisterNodeInGraphLabeller(const Node* node);
 
  private:
   MaglevCompilationInfo* const info_;
   const MaglevCompilationUnit* const caller_;
-  const compiler::JSFunctionRef function_;
-  const compiler::SharedFunctionInfoRef shared_function_info_;
-  const compiler::BytecodeArrayRef bytecode_;
-  const compiler::FeedbackVectorRef feedback_;
+  const compiler::OptionalSharedFunctionInfoRef shared_function_info_;
+  const compiler::OptionalBytecodeArrayRef bytecode_;
+  const compiler::OptionalFeedbackVectorRef feedback_;
   const int register_count_;
   const int parameter_count_;
   const int inlining_depth_;
diff --git a/deps/v8/src/maglev/maglev-compiler.cc b/deps/v8/src/maglev/maglev-compiler.cc
index 186e6ec3d5f172..ebca1ccfbe04bf 100644
--- a/deps/v8/src/maglev/maglev-compiler.cc
+++ b/deps/v8/src/maglev/maglev-compiler.cc
@@ -22,7 +22,7 @@
 #include "src/compiler/compilation-dependencies.h"
 #include "src/compiler/heap-refs.h"
 #include "src/compiler/js-heap-broker.h"
-#include "src/deoptimizer/translation-array.h"
+#include "src/deoptimizer/frame-translation-builder.h"
 #include "src/execution/frames.h"
 #include "src/ic/handler-configuration.h"
 #include "src/maglev/maglev-basic-block.h"
@@ -56,9 +56,10 @@ class ValueLocationConstraintProcessor {
   void PostProcessGraph(Graph* graph) {}
   void PreProcessBasicBlock(BasicBlock* block) {}
 
-#define DEF_PROCESS_NODE(NAME)                             \
-  void Process(NAME* node, const ProcessingState& state) { \
-    node->SetValueLocationConstraints();                   \
+#define DEF_PROCESS_NODE(NAME)                                      \
+  ProcessResult Process(NAME* node, const ProcessingState& state) { \
+    node->SetValueLocationConstraints();                            \
+    return ProcessResult::kContinue;                                \
   }
   NODE_BASE_LIST(DEF_PROCESS_NODE)
 #undef DEF_PROCESS_NODE
@@ -71,8 +72,11 @@ class DecompressedUseMarkingProcessor {
   void PreProcessBasicBlock(BasicBlock* block) {}
 
   template <typename NodeT>
-  void Process(NodeT* node, const ProcessingState& state) {
+  ProcessResult Process(NodeT* node, const ProcessingState& state) {
+#ifdef V8_COMPRESS_POINTERS
     node->MarkTaggedInputsAsDecompressing();
+#endif
+    return ProcessResult::kContinue;
   }
 };
 
@@ -86,7 +90,7 @@ class MaxCallDepthProcessor {
   void PreProcessBasicBlock(BasicBlock* block) {}
 
   template <typename NodeT>
-  void Process(NodeT* node, const ProcessingState& state) {
+  ProcessResult Process(NodeT* node, const ProcessingState& state) {
     if constexpr (NodeT::kProperties.is_call() ||
                   NodeT::kProperties.needs_register_snapshot()) {
       int node_stack_args = node->MaxCallStackArgs();
@@ -104,6 +108,7 @@ class MaxCallDepthProcessor {
     if constexpr (NodeT::kProperties.can_lazy_deopt()) {
       UpdateMaxDeoptedStackSize(node->lazy_deopt_info());
     }
+    return ProcessResult::kContinue;
   }
 
  private:
@@ -129,10 +134,16 @@ class MaxCallDepthProcessor {
             deopt_frame->as_interpreted().unit().register_count());
         return info.frame_size_in_bytes();
       }
+      case DeoptFrame::FrameType::kConstructInvokeStubFrame: {
+        return FastConstructStubFrameInfo::Conservative().frame_size_in_bytes();
+      }
       case DeoptFrame::FrameType::kInlinedArgumentsFrame: {
-        return static_cast<int>(
-            deopt_frame->as_inlined_arguments().arguments().size() -
-            deopt_frame->as_inlined_arguments().unit().parameter_count());
+        return std::max(
+            0,
+            static_cast<int>(
+                deopt_frame->as_inlined_arguments().arguments().size() -
+                deopt_frame->as_inlined_arguments().unit().parameter_count()) *
+                kSystemPointerSize);
       }
       case DeoptFrame::FrameType::kBuiltinContinuationFrame: {
         // PC + FP + Closure + Params + Context
@@ -164,17 +175,24 @@ class UseMarkingProcessor {
   void PreProcessBasicBlock(BasicBlock* block) {
     if (!block->has_state()) return;
     if (block->state()->is_loop()) {
-      loop_used_nodes_.push_back(LoopUsedNodes{next_node_id_, {}});
-#ifdef DEBUG
-      loop_used_nodes_.back().header = block;
-#endif
+      loop_used_nodes_.push_back(
+          LoopUsedNodes{{}, kInvalidNodeId, kInvalidNodeId, block});
     }
   }
 
   template <typename NodeT>
-  void Process(NodeT* node, const ProcessingState& state) {
+  ProcessResult Process(NodeT* node, const ProcessingState& state) {
     node->set_id(next_node_id_++);
+    LoopUsedNodes* loop_used_nodes = GetCurrentLoopUsedNodes();
+    if (loop_used_nodes && node->properties().is_call() &&
+        loop_used_nodes->header->has_state()) {
+      if (loop_used_nodes->first_call == kInvalidNodeId) {
+        loop_used_nodes->first_call = node->id();
+      }
+      loop_used_nodes->last_call = node->id();
+    }
     MarkInputUses(node, state);
+    return ProcessResult::kContinue;
   }
 
   template <typename NodeT>
@@ -224,15 +242,40 @@ class UseMarkingProcessor {
 
     DCHECK_EQ(loop_used_nodes.header, target);
     if (!loop_used_nodes.used_nodes.empty()) {
+      // Try to avoid unnecessary reloads or spills across the back-edge based
+      // on use positions and calls inside the loop.
+      ZonePtrList<ValueNode>& reload_hints =
+          loop_used_nodes.header->reload_hints();
+      ZonePtrList<ValueNode>& spill_hints =
+          loop_used_nodes.header->spill_hints();
+      for (auto p : loop_used_nodes.used_nodes) {
+        // If the node is used before the first call and after the last call,
+        // keep it in a register across the back-edge.
+        if (p.second.first_register_use != kInvalidNodeId &&
+            (loop_used_nodes.first_call == kInvalidNodeId ||
+             (p.second.first_register_use <= loop_used_nodes.first_call &&
+              p.second.last_register_use > loop_used_nodes.last_call))) {
+          reload_hints.Add(p.first, compilation_info_->zone());
+        }
+        // If the node is not used, or used after the first call and before the
+        // last call, keep it spilled across the back-edge.
+        if (p.second.first_register_use == kInvalidNodeId ||
+            (loop_used_nodes.first_call != kInvalidNodeId &&
+             p.second.first_register_use > loop_used_nodes.first_call &&
+             p.second.last_register_use <= loop_used_nodes.last_call)) {
+          spill_hints.Add(p.first, compilation_info_->zone());
+        }
+      }
+
       // Uses of nodes in this loop may need to propagate to an outer loop, so
       // that they're lifetime is extended there too.
       // TODO(leszeks): We only need to extend the lifetime in one outermost
       // loop, allow nodes to be "moved" between lifetime extensions.
       base::Vector<Input> used_node_inputs =
-          compilation_info_->zone()->NewVector<Input>(
+          compilation_info_->zone()->AllocateVector<Input>(
               loop_used_nodes.used_nodes.size());
       int i = 0;
-      for (ValueNode* used_node : loop_used_nodes.used_nodes) {
+      for (auto& [used_node, info] : loop_used_nodes.used_nodes) {
         Input* input = new (&used_node_inputs[i++]) Input(used_node);
         MarkUse(used_node, use, input, outer_loop_used_nodes);
       }
@@ -252,12 +295,17 @@ class UseMarkingProcessor {
   }
 
  private:
+  struct NodeUse {
+    // First and last register use inside a loop.
+    NodeIdT first_register_use;
+    NodeIdT last_register_use;
+  };
+
   struct LoopUsedNodes {
-    uint32_t loop_header_id;
-    std::unordered_set<ValueNode*> used_nodes;
-#ifdef DEBUG
-    BasicBlock* header = nullptr;
-#endif
+    std::map<ValueNode*, NodeUse> used_nodes;
+    NodeIdT first_call;
+    NodeIdT last_call;
+    BasicBlock* header;
   };
 
   LoopUsedNodes* GetCurrentLoopUsedNodes() {
@@ -277,8 +325,20 @@ class UseMarkingProcessor {
       // it must have been created before the loop. This means that it's alive
       // on loop entry, and therefore has to be alive across the loop back edge
       // too.
-      if (node->id() < loop_used_nodes->loop_header_id) {
-        loop_used_nodes->used_nodes.insert(node);
+      if (node->id() < loop_used_nodes->header->first_id()) {
+        auto [it, info] = loop_used_nodes->used_nodes.emplace(
+            node, NodeUse{kInvalidNodeId, kInvalidNodeId});
+        if (input->operand().IsUnallocated()) {
+          const auto& operand =
+              compiler::UnallocatedOperand::cast(input->operand());
+          if (operand.HasRegisterPolicy() || operand.HasFixedRegisterPolicy() ||
+              operand.HasFixedFPRegisterPolicy()) {
+            if (it->second.first_register_use == kInvalidNodeId) {
+              it->second.first_register_use = use_id;
+            }
+            it->second.last_register_use = use_id;
+          }
+        }
       }
     }
   }
@@ -311,46 +371,58 @@ class UseMarkingProcessor {
 bool MaglevCompiler::Compile(LocalIsolate* local_isolate,
                              MaglevCompilationInfo* compilation_info) {
   compiler::CurrentHeapBrokerScope current_broker(compilation_info->broker());
-  Graph* graph = Graph::New(compilation_info->zone());
+  Graph* graph =
+      Graph::New(compilation_info->zone(),
+                 compilation_info->toplevel_compilation_unit()->is_osr());
 
   // Build graph.
   if (v8_flags.print_maglev_code || v8_flags.code_comments ||
-      v8_flags.print_maglev_graph || v8_flags.trace_maglev_graph_building ||
-      v8_flags.trace_maglev_regalloc) {
+      v8_flags.print_maglev_graph || v8_flags.print_maglev_graphs ||
+      v8_flags.trace_maglev_graph_building ||
+      v8_flags.trace_maglev_phi_untagging || v8_flags.trace_maglev_regalloc) {
     compilation_info->set_graph_labeller(new MaglevGraphLabeller());
   }
 
   {
-    UnparkedScope unparked_scope(local_isolate->heap());
+    UnparkedScopeIfOnBackground unparked_scope(local_isolate->heap());
 
     if (v8_flags.print_maglev_code || v8_flags.print_maglev_graph ||
-        v8_flags.trace_maglev_graph_building ||
-        v8_flags.trace_maglev_regalloc) {
+        v8_flags.print_maglev_graphs || v8_flags.trace_maglev_graph_building ||
+        v8_flags.trace_maglev_phi_untagging || v8_flags.trace_maglev_regalloc) {
       MaglevCompilationUnit* top_level_unit =
           compilation_info->toplevel_compilation_unit();
-      std::cout << "Compiling " << Brief(*top_level_unit->function().object())
+      std::cout << "Compiling " << Brief(*compilation_info->toplevel_function())
                 << " with Maglev\n";
       BytecodeArray::Disassemble(top_level_unit->bytecode().object(),
                                  std::cout);
-      top_level_unit->feedback().object()->Print(std::cout);
+      if (v8_flags.maglev_print_feedback) {
+        Print(*top_level_unit->feedback().object(), std::cout);
+      }
     }
 
     MaglevGraphBuilder graph_builder(
         local_isolate, compilation_info->toplevel_compilation_unit(), graph);
 
-    graph_builder.Build();
+    {
+      TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                   "V8.Maglev.GraphBuilding");
+      graph_builder.Build();
 
-    if (v8_flags.print_maglev_graph) {
-      std::cout << "\nAfter graph buiding" << std::endl;
-      PrintGraph(std::cout, compilation_info, graph);
+      if (v8_flags.print_maglev_graphs) {
+        std::cout << "\nAfter graph buiding" << std::endl;
+        PrintGraph(std::cout, compilation_info, graph);
+      }
     }
 
     if (v8_flags.maglev_untagged_phis) {
+      TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                   "V8.Maglev.PhiUntagging");
+
       GraphProcessor<MaglevPhiRepresentationSelector> representation_selector(
           &graph_builder);
       representation_selector.ProcessGraph(graph);
 
-      if (v8_flags.print_maglev_graph) {
+      if (v8_flags.print_maglev_graphs) {
         std::cout << "\nAfter Phi untagging" << std::endl;
         PrintGraph(std::cout, compilation_info, graph);
       }
@@ -369,32 +441,43 @@ bool MaglevCompiler::Compile(LocalIsolate* local_isolate,
     //   - Collect input/output location constraints
     //   - Find the maximum number of stack arguments passed to calls
     //   - Collect use information, for SSA liveness and next-use distance.
+    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                 "V8.Maglev.NodeProcessing");
     GraphMultiProcessor<ValueLocationConstraintProcessor, MaxCallDepthProcessor,
                         UseMarkingProcessor, DecompressedUseMarkingProcessor>
         processor(UseMarkingProcessor{compilation_info});
     processor.ProcessGraph(graph);
   }
 
-  if (v8_flags.print_maglev_graph) {
-    UnparkedScope unparked_scope(local_isolate->heap());
+  if (v8_flags.print_maglev_graphs) {
+    UnparkedScopeIfOnBackground unparked_scope(local_isolate->heap());
     std::cout << "After register allocation pre-processing" << std::endl;
     PrintGraph(std::cout, compilation_info, graph);
   }
 
-  StraightForwardRegisterAllocator allocator(compilation_info, graph);
+  {
+    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                 "V8.Maglev.RegisterAllocation");
+    StraightForwardRegisterAllocator allocator(compilation_info, graph);
 
-  if (v8_flags.print_maglev_graph) {
-    UnparkedScope unparked_scope(local_isolate->heap());
-    std::cout << "After register allocation" << std::endl;
-    PrintGraph(std::cout, compilation_info, graph);
+    if (v8_flags.print_maglev_graph || v8_flags.print_maglev_graphs) {
+      UnparkedScopeIfOnBackground unparked_scope(local_isolate->heap());
+      std::cout << "After register allocation" << std::endl;
+      PrintGraph(std::cout, compilation_info, graph);
+    }
   }
 
   {
-    UnparkedScope unparked_scope(local_isolate->heap());
+    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                 "V8.Maglev.CodeAssembly");
+    UnparkedScopeIfOnBackground unparked_scope(local_isolate->heap());
     std::unique_ptr<MaglevCodeGenerator> code_generator =
         std::make_unique<MaglevCodeGenerator>(local_isolate, compilation_info,
                                               graph);
-    code_generator->Assemble();
+    bool success = code_generator->Assemble();
+    if (!success) {
+      return false;
+    }
 
     // Stash the compiled code_generator on the compilation info.
     compilation_info->set_code_generator(std::move(code_generator));
@@ -412,23 +495,33 @@ MaybeHandle<Code> MaglevCompiler::GenerateCode(
   DCHECK_NOT_NULL(code_generator);
 
   Handle<Code> code;
-  if (!code_generator->Generate(isolate).ToHandle(&code)) {
-    compilation_info->toplevel_compilation_unit()
-        ->shared_function_info()
-        .object()
-        ->set_maglev_compilation_failed(true);
-    return {};
+  {
+    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                 "V8.Maglev.CodeGeneration");
+    if (compilation_info->is_detached() ||
+        !code_generator->Generate(isolate).ToHandle(&code)) {
+      compilation_info->toplevel_compilation_unit()
+          ->shared_function_info()
+          .object()
+          ->set_maglev_compilation_failed(true);
+      return {};
+    }
   }
 
-  if (!compilation_info->broker()->dependencies()->Commit(code)) {
-    // Don't `set_maglev_compilation_failed` s.t. we may reattempt compilation.
-    // TODO(v8:7700): Make this more robust, i.e.: don't recompile endlessly,
-    // and possibly attempt to recompile as early as possible.
-    return {};
+  {
+    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                 "V8.Maglev.CommittingDependencies");
+    if (!compilation_info->broker()->dependencies()->Commit(code)) {
+      // Don't `set_maglev_compilation_failed` s.t. we may reattempt
+      // compilation.
+      // TODO(v8:7700): Make this more robust, i.e.: don't recompile endlessly,
+      // and possibly attempt to recompile as early as possible.
+      return {};
+    }
   }
 
   if (v8_flags.print_maglev_code) {
-    code->Print();
+    Print(*code);
   }
 
   return code;
diff --git a/deps/v8/src/maglev/maglev-concurrent-dispatcher.cc b/deps/v8/src/maglev/maglev-concurrent-dispatcher.cc
index af6ebf8f23659c..c774477ff2db06 100644
--- a/deps/v8/src/maglev/maglev-concurrent-dispatcher.cc
+++ b/deps/v8/src/maglev/maglev-concurrent-dispatcher.cc
@@ -10,9 +10,11 @@
 #include "src/execution/isolate.h"
 #include "src/flags/flags.h"
 #include "src/handles/persistent-handles.h"
+#include "src/heap/parked-scope.h"
 #include "src/maglev/maglev-compilation-info.h"
 #include "src/maglev/maglev-compiler.h"
 #include "src/maglev/maglev-graph-labeller.h"
+#include "src/maglev/maglev-pipeline-statistics.h"
 #include "src/objects/js-function-inl.h"
 #include "src/utils/identity-map.h"
 #include "src/utils/locked-queue-inl.h"
@@ -24,7 +26,6 @@ namespace compiler {
 
 void JSHeapBroker::AttachLocalIsolateForMaglev(
     maglev::MaglevCompilationInfo* info, LocalIsolate* local_isolate) {
-  set_canonical_handles(info->DetachCanonicalHandles());
   DCHECK_NULL(local_isolate_);
   local_isolate_ = local_isolate;
   DCHECK_NOT_NULL(local_isolate_);
@@ -39,7 +40,6 @@ void JSHeapBroker::DetachLocalIsolateForMaglev(
   std::unique_ptr<PersistentHandles> ph =
       local_isolate_->heap()->DetachPersistentHandles();
   local_isolate_ = nullptr;
-  info->set_canonical_handles(DetachCanonicalHandles());
   info->set_persistent_handles(std::move(ph));
 }
 
@@ -78,54 +78,101 @@ void ExportedMaglevCompilationInfo::set_canonical_handles(
 
 // static
 std::unique_ptr<MaglevCompilationJob> MaglevCompilationJob::New(
-    Isolate* isolate, Handle<JSFunction> function) {
-  auto info = maglev::MaglevCompilationInfo::New(isolate, function);
+    Isolate* isolate, Handle<JSFunction> function, BytecodeOffset osr_offset) {
+  auto info = maglev::MaglevCompilationInfo::New(isolate, function, osr_offset);
   return std::unique_ptr<MaglevCompilationJob>(
-      new MaglevCompilationJob(std::move(info)));
+      new MaglevCompilationJob(isolate, std::move(info)));
 }
 
+namespace {
+
+MaglevPipelineStatistics* CreatePipelineStatistics(
+    Isolate* isolate, MaglevCompilationInfo* compilation_info,
+    compiler::ZoneStats* zone_stats) {
+  MaglevPipelineStatistics* pipeline_stats = nullptr;
+  bool tracing_enabled;
+  TRACE_EVENT_CATEGORY_GROUP_ENABLED(TRACE_DISABLED_BY_DEFAULT("v8.maglev"),
+                                     &tracing_enabled);
+  if (tracing_enabled || v8_flags.maglev_stats || v8_flags.maglev_stats_nvp) {
+    pipeline_stats = new MaglevPipelineStatistics(
+        compilation_info, isolate->GetMaglevStatistics(), zone_stats);
+  }
+  return pipeline_stats;
+}
+
+}  // namespace
+
 MaglevCompilationJob::MaglevCompilationJob(
-    std::unique_ptr<MaglevCompilationInfo>&& info)
+    Isolate* isolate, std::unique_ptr<MaglevCompilationInfo>&& info)
     : OptimizedCompilationJob(kMaglevCompilerName, State::kReadyToPrepare),
-      info_(std::move(info)) {
-  DCHECK(v8_flags.maglev);
+      info_(std::move(info)),
+      zone_stats_(isolate->allocator()),
+      pipeline_statistics_(
+          CreatePipelineStatistics(isolate, info_.get(), &zone_stats_)) {
+  DCHECK(maglev::IsMaglevEnabled());
 }
 
 MaglevCompilationJob::~MaglevCompilationJob() = default;
 
 CompilationJob::Status MaglevCompilationJob::PrepareJobImpl(Isolate* isolate) {
+  BeginPhaseKind("V8.MaglevPrepareJob");
   if (info()->collect_source_positions()) {
     SharedFunctionInfo::EnsureSourcePositionsAvailable(
         isolate,
         info()->toplevel_compilation_unit()->shared_function_info().object());
   }
+  EndPhaseKind();
   // TODO(v8:7700): Actual return codes.
   return CompilationJob::SUCCEEDED;
 }
 
 CompilationJob::Status MaglevCompilationJob::ExecuteJobImpl(
     RuntimeCallStats* stats, LocalIsolate* local_isolate) {
+  BeginPhaseKind("V8.MaglevExecuteJob");
   LocalIsolateScope scope{info(), local_isolate};
   if (!maglev::MaglevCompiler::Compile(local_isolate, info())) {
     return CompilationJob::FAILED;
   }
+  EndPhaseKind();
   // TODO(v8:7700): Actual return codes.
   return CompilationJob::SUCCEEDED;
 }
 
 CompilationJob::Status MaglevCompilationJob::FinalizeJobImpl(Isolate* isolate) {
+  BeginPhaseKind("V8.MaglevFinalizeJob");
   Handle<Code> code;
   if (!maglev::MaglevCompiler::GenerateCode(isolate, info()).ToHandle(&code)) {
     return CompilationJob::FAILED;
   }
-  info()->toplevel_compilation_unit()->function().object()->set_code(*code);
+  info()->set_code(code);
+  RegisterWeakObjectsInOptimizedCode(
+      isolate, info()->broker()->target_native_context().object(), code);
+  EndPhaseKind();
   return CompilationJob::SUCCEEDED;
 }
 
+void MaglevCompilationJob::DisposeOnMainThread(Isolate* isolate) {
+  // Drop canonical handles on the main thread, to avoid (in the case of
+  // background job destruction) needing to unpark the local isolate on the
+  // background thread for unregistering the identity map's strong roots.
+  DCHECK(isolate->IsCurrent());
+  info()->DetachCanonicalHandles()->Clear();
+}
+
+MaybeHandle<Code> MaglevCompilationJob::code() const {
+  return info_->get_code();
+}
+
 Handle<JSFunction> MaglevCompilationJob::function() const {
-  return info_->toplevel_compilation_unit()->function().object();
+  return info_->toplevel_function();
+}
+
+BytecodeOffset MaglevCompilationJob::osr_offset() const {
+  return info_->toplevel_osr_offset();
 }
 
+bool MaglevCompilationJob::is_osr() const { return info_->toplevel_is_osr(); }
+
 bool MaglevCompilationJob::specialize_to_function_context() const {
   return info_->specialize_to_function_context();
 }
@@ -145,6 +192,42 @@ void MaglevCompilationJob::RecordCompilationStats(Isolate* isolate) const {
     counters->maglev_optimize_total_time()->AddSample(
         static_cast<int>(ElapsedTime().InMicroseconds()));
   }
+  if (v8_flags.trace_opt_stats) {
+    static double compilation_time = 0.0;
+    static int compiled_functions = 0;
+    static int code_size = 0;
+
+    compilation_time += (time_taken_to_prepare_.InMillisecondsF() +
+                         time_taken_to_execute_.InMillisecondsF() +
+                         time_taken_to_finalize_.InMillisecondsF());
+    compiled_functions++;
+    code_size += function()->shared()->SourceSize();
+    PrintF(
+        "[maglev] Compiled: %d functions with %d byte source size in %fms.\n",
+        compiled_functions, code_size, compilation_time);
+  }
+}
+
+uint64_t MaglevCompilationJob::trace_id() const {
+  // Xor together the this pointer, the info pointer, and the top level
+  // function's Handle address, to try to make the id more unique on platforms
+  // where just the `this` pointer is likely to be reused.
+  return reinterpret_cast<uint64_t>(this) ^
+         reinterpret_cast<uint64_t>(info_.get()) ^
+         info_->toplevel_function().address() ^
+         info_->toplevel_function()->shared()->function_literal_id();
+}
+
+void MaglevCompilationJob::BeginPhaseKind(const char* name) {
+  if (V8_UNLIKELY(pipeline_statistics_ != nullptr)) {
+    pipeline_statistics_->BeginPhaseKind(name);
+  }
+}
+
+void MaglevCompilationJob::EndPhaseKind() {
+  if (V8_UNLIKELY(pipeline_statistics_ != nullptr)) {
+    pipeline_statistics_->EndPhaseKind();
+  }
 }
 
 // The JobTask is posted to V8::GetCurrentPlatform(). It's responsible for
@@ -155,35 +238,56 @@ class MaglevConcurrentDispatcher::JobTask final : public v8::JobTask {
       : dispatcher_(dispatcher) {}
 
   void Run(JobDelegate* delegate) override {
+    TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"), "V8.MaglevTask");
     LocalIsolate local_isolate(isolate(), ThreadKind::kBackground);
     DCHECK(local_isolate.heap()->IsParked());
 
-    while (!incoming_queue()->IsEmpty() && !delegate->ShouldYield()) {
+    std::unique_ptr<MaglevCompilationJob> job_to_destruct;
+    while (!delegate->ShouldYield()) {
       std::unique_ptr<MaglevCompilationJob> job;
-      if (!incoming_queue()->Dequeue(&job)) break;
-      DCHECK_NOT_NULL(job);
-      TRACE_EVENT_WITH_FLOW0(
-          TRACE_DISABLED_BY_DEFAULT("v8.compile"), "V8.MaglevBackground",
-          job.get(), TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
-      RCS_SCOPE(&local_isolate,
-                RuntimeCallCounterId::kOptimizeBackgroundMaglev);
-      CompilationJob::Status status =
-          job->ExecuteJob(local_isolate.runtime_call_stats(), &local_isolate);
-      if (status == CompilationJob::SUCCEEDED) {
-        outgoing_queue()->Enqueue(std::move(job));
+      if (incoming_queue()->Dequeue(&job)) {
+        DCHECK_NOT_NULL(job);
+        TRACE_EVENT_WITH_FLOW0(
+            TRACE_DISABLED_BY_DEFAULT("v8.compile"), "V8.MaglevBackground",
+            job->trace_id(),
+            TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
+        RCS_SCOPE(&local_isolate,
+                  RuntimeCallCounterId::kOptimizeBackgroundMaglev);
+        CompilationJob::Status status =
+            job->ExecuteJob(local_isolate.runtime_call_stats(), &local_isolate);
+        if (status == CompilationJob::SUCCEEDED) {
+          outgoing_queue()->Enqueue(std::move(job));
+          isolate()->stack_guard()->RequestInstallMaglevCode();
+        }
+      } else if (destruction_queue()->Dequeue(&job)) {
+        // Maglev jobs aren't cheap to destruct, so destroy them here in the
+        // background thread rather than on the main thread.
+        DCHECK_NOT_NULL(job);
+        TRACE_EVENT_WITH_FLOW0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                               "V8.MaglevDestructBackground", job->trace_id(),
+                               TRACE_EVENT_FLAG_FLOW_IN);
+        job.reset();
+      } else {
+        break;
       }
     }
-    isolate()->stack_guard()->RequestInstallMaglevCode();
   }
 
-  size_t GetMaxConcurrency(size_t) const override {
-    return incoming_queue()->size();
+  size_t GetMaxConcurrency(size_t worker_count) const override {
+    size_t num_tasks =
+        incoming_queue()->size() + destruction_queue()->size() + worker_count;
+    size_t max_threads = v8_flags.concurrent_maglev_max_threads;
+    if (max_threads > 0) {
+      return std::min(max_threads, num_tasks);
+    }
+    return num_tasks;
   }
 
  private:
   Isolate* isolate() const { return dispatcher_->isolate_; }
   QueueT* incoming_queue() const { return &dispatcher_->incoming_queue_; }
   QueueT* outgoing_queue() const { return &dispatcher_->outgoing_queue_; }
+  QueueT* destruction_queue() const { return &dispatcher_->destruction_queue_; }
 
   MaglevConcurrentDispatcher* const dispatcher_;
   const Handle<JSFunction> function_;
@@ -191,9 +295,25 @@ class MaglevConcurrentDispatcher::JobTask final : public v8::JobTask {
 
 MaglevConcurrentDispatcher::MaglevConcurrentDispatcher(Isolate* isolate)
     : isolate_(isolate) {
-  if (v8_flags.concurrent_recompilation && v8_flags.maglev) {
+  bool enable = v8_flags.concurrent_recompilation && maglev::IsMaglevEnabled();
+  if (enable) {
+    bool is_tracing =
+        v8_flags.print_maglev_code || v8_flags.trace_maglev_graph_building ||
+        v8_flags.trace_maglev_inlining || v8_flags.print_maglev_deopt_verbose ||
+        v8_flags.print_maglev_graph || v8_flags.print_maglev_graphs ||
+        v8_flags.trace_maglev_phi_untagging || v8_flags.trace_maglev_regalloc;
+
+    if (is_tracing) {
+      PrintF("Concurrent maglev has been disabled for tracing.\n");
+      enable = false;
+    }
+  }
+  if (enable) {
+    TaskPriority priority = v8_flags.concurrent_maglev_high_priority_threads
+                                ? TaskPriority::kUserBlocking
+                                : TaskPriority::kUserVisible;
     job_handle_ = V8::GetCurrentPlatform()->PostJob(
-        TaskPriority::kUserVisible, std::make_unique<JobTask>(this));
+        priority, std::make_unique<JobTask>(this));
     DCHECK(is_enabled());
   } else {
     DCHECK(!is_enabled());
@@ -220,12 +340,24 @@ void MaglevConcurrentDispatcher::FinalizeFinishedJobs() {
   while (!outgoing_queue_.IsEmpty()) {
     std::unique_ptr<MaglevCompilationJob> job;
     outgoing_queue_.Dequeue(&job);
-    TRACE_EVENT_WITH_FLOW0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
-                           "V8.MaglevConcurrentFinalize", job.get(),
-                           TRACE_EVENT_FLAG_FLOW_IN);
+    TRACE_EVENT_WITH_FLOW0(
+        TRACE_DISABLED_BY_DEFAULT("v8.compile"), "V8.MaglevConcurrentFinalize",
+        job->trace_id(), TRACE_EVENT_FLAG_FLOW_IN | TRACE_EVENT_FLAG_FLOW_OUT);
     RCS_SCOPE(isolate_,
               RuntimeCallCounterId::kOptimizeConcurrentFinalizeMaglev);
     Compiler::FinalizeMaglevCompilationJob(job.get(), isolate_);
+    job->DisposeOnMainThread(isolate_);
+    if (v8_flags.maglev_destroy_on_background) {
+      // Maglev jobs aren't cheap to destruct, so re-enqueue them for
+      // destruction on a background thread.
+      destruction_queue_.Enqueue(std::move(job));
+      job_handle_->NotifyConcurrencyIncrease();
+    } else {
+      TRACE_EVENT_WITH_FLOW0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+                             "V8.MaglevDestruct", job->trace_id(),
+                             TRACE_EVENT_FLAG_FLOW_IN);
+      job.reset();
+    }
   }
 }
 
@@ -238,6 +370,22 @@ void MaglevConcurrentDispatcher::AwaitCompileJobs() {
   DCHECK(incoming_queue_.IsEmpty());
 }
 
+void MaglevConcurrentDispatcher::Flush(BlockingBehavior behavior) {
+  while (!incoming_queue_.IsEmpty()) {
+    std::unique_ptr<MaglevCompilationJob> job;
+    incoming_queue_.Dequeue(&job);
+  }
+  if (behavior == BlockingBehavior::kBlock) {
+    job_handle_->Cancel();
+    job_handle_ = V8::GetCurrentPlatform()->PostJob(
+        TaskPriority::kUserVisible, std::make_unique<JobTask>(this));
+  }
+  while (!outgoing_queue_.IsEmpty()) {
+    std::unique_ptr<MaglevCompilationJob> job;
+    outgoing_queue_.Dequeue(&job);
+  }
+}
+
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/maglev/maglev-concurrent-dispatcher.h b/deps/v8/src/maglev/maglev-concurrent-dispatcher.h
index 4f05f9b3b4b279..485dbc3059aa07 100644
--- a/deps/v8/src/maglev/maglev-concurrent-dispatcher.h
+++ b/deps/v8/src/maglev/maglev-concurrent-dispatcher.h
@@ -10,6 +10,7 @@
 #include <memory>
 
 #include "src/codegen/compiler.h"  // For OptimizedCompilationJob.
+#include "src/maglev/maglev-pipeline-statistics.h"
 #include "src/utils/locked-queue.h"
 
 namespace v8 {
@@ -46,7 +47,8 @@ class ExportedMaglevCompilationInfo final {
 class MaglevCompilationJob final : public OptimizedCompilationJob {
  public:
   static std::unique_ptr<MaglevCompilationJob> New(Isolate* isolate,
-                                                   Handle<JSFunction> function);
+                                                   Handle<JSFunction> function,
+                                                   BytecodeOffset osr_offset);
   ~MaglevCompilationJob() override;
 
   Status PrepareJobImpl(Isolate* isolate) override;
@@ -55,6 +57,9 @@ class MaglevCompilationJob final : public OptimizedCompilationJob {
   Status FinalizeJobImpl(Isolate* isolate) override;
 
   Handle<JSFunction> function() const;
+  MaybeHandle<Code> code() const;
+  BytecodeOffset osr_offset() const;
+  bool is_osr() const;
 
   bool specialize_to_function_context() const;
 
@@ -64,17 +69,29 @@ class MaglevCompilationJob final : public OptimizedCompilationJob {
 
   void RecordCompilationStats(Isolate* isolate) const;
 
+  void DisposeOnMainThread(Isolate* isolate);
+
+  // Intended for use as a globally unique id in trace events.
+  uint64_t trace_id() const;
+
  private:
-  explicit MaglevCompilationJob(std::unique_ptr<MaglevCompilationInfo>&& info);
+  explicit MaglevCompilationJob(Isolate* isolate,
+                                std::unique_ptr<MaglevCompilationInfo>&& info);
+  void BeginPhaseKind(const char* name);
+  void EndPhaseKind();
 
   MaglevCompilationInfo* info() const { return info_.get(); }
 
   const std::unique_ptr<MaglevCompilationInfo> info_;
+  // TODO(pthier): Gather more fine grained stats for maglev compilation.
+  // Currently only totals are collected.
+  compiler::ZoneStats zone_stats_;
+  std::unique_ptr<MaglevPipelineStatistics> pipeline_statistics_;
 };
 
 // The public API for Maglev concurrent compilation.
 // Keep this as minimal as possible.
-class MaglevConcurrentDispatcher final {
+class V8_EXPORT_PRIVATE MaglevConcurrentDispatcher final {
   class JobTask;
 
   // TODO(jgruber): There's no reason to use locking queues here, we only use
@@ -93,6 +110,8 @@ class MaglevConcurrentDispatcher final {
 
   void AwaitCompileJobs();
 
+  void Flush(BlockingBehavior blocking_behavior);
+
   bool is_enabled() const { return static_cast<bool>(job_handle_); }
 
  private:
@@ -100,6 +119,7 @@ class MaglevConcurrentDispatcher final {
   std::unique_ptr<JobHandle> job_handle_;
   QueueT incoming_queue_;
   QueueT outgoing_queue_;
+  QueueT destruction_queue_;
 };
 
 }  // namespace maglev
diff --git a/deps/v8/src/maglev/maglev-graph-builder.cc b/deps/v8/src/maglev/maglev-graph-builder.cc
index 9f07f1cb727a7a..6a0e3718536293 100644
--- a/deps/v8/src/maglev/maglev-graph-builder.cc
+++ b/deps/v8/src/maglev/maglev-graph-builder.cc
@@ -4,6 +4,7 @@
 
 #include "src/maglev/maglev-graph-builder.h"
 
+#include <algorithm>
 #include <limits>
 
 #include "src/base/logging.h"
@@ -14,18 +15,20 @@
 #include "src/builtins/builtins.h"
 #include "src/codegen/cpu-features.h"
 #include "src/codegen/interface-descriptors-inl.h"
+#include "src/common/assert-scope.h"
 #include "src/common/globals.h"
 #include "src/compiler/access-info.h"
 #include "src/compiler/bytecode-liveness-map.h"
 #include "src/compiler/compilation-dependencies.h"
 #include "src/compiler/feedback-source.h"
 #include "src/compiler/heap-refs.h"
-#include "src/compiler/js-heap-broker.h"
+#include "src/compiler/js-heap-broker-inl.h"
 #include "src/compiler/processed-feedback.h"
 #include "src/deoptimizer/deoptimize-reason.h"
 #include "src/flags/flags.h"
 #include "src/handles/maybe-handles-inl.h"
 #include "src/ic/handler-configuration-inl.h"
+#include "src/interpreter/bytecode-array-iterator.h"
 #include "src/interpreter/bytecode-flags.h"
 #include "src/interpreter/bytecode-register.h"
 #include "src/interpreter/bytecodes.h"
@@ -36,6 +39,8 @@
 #include "src/maglev/maglev-ir.h"
 #include "src/objects/elements-kind.h"
 #include "src/objects/feedback-vector.h"
+#include "src/objects/fixed-array.h"
+#include "src/objects/heap-number-inl.h"
 #include "src/objects/literal-objects-inl.h"
 #include "src/objects/name-inl.h"
 #include "src/objects/property-cell.h"
@@ -43,7 +48,12 @@
 #include "src/objects/shared-function-info.h"
 #include "src/objects/slots-inl.h"
 #include "src/objects/type-hints.h"
-#include "src/zone/zone-handle-set.h"
+#include "src/roots/roots.h"
+#include "src/utils/utils.h"
+
+#ifdef V8_INTL_SUPPORT
+#include "src/objects/intl-objects.h"
+#endif
 
 namespace v8::internal::maglev {
 
@@ -56,16 +66,18 @@ enum class CpuOperation {
 // TODO(leszeks): Add a generic mechanism for marking nodes as optionally
 // supported.
 bool IsSupported(CpuOperation op) {
-#ifdef V8_TARGET_ARCH_X64
   switch (op) {
     case CpuOperation::kFloat64Round:
+#if defined(V8_TARGET_ARCH_X64)
       return CpuFeatures::IsSupported(SSE4_1) || CpuFeatures::IsSupported(AVX);
-  }
-#elif V8_TARGET_ARCH_ARM64
-  return true;
+#elif defined(V8_TARGET_ARCH_ARM)
+      return CpuFeatures::IsSupported(ARMv8);
+#elif defined(V8_TARGET_ARCH_ARM64)
+      return true;
 #else
-#error "Maglev does not supported this architecture."
+#error "Maglev does not support this architecture."
 #endif
+  }
 }
 
 ValueNode* TryGetParentContext(ValueNode* node) {
@@ -103,16 +115,10 @@ class FunctionContextSpecialization final : public AllStatic {
   static compiler::OptionalContextRef TryToRef(
       const MaglevCompilationUnit* unit, ValueNode* context, size_t* depth) {
     DCHECK(unit->info()->specialize_to_function_context());
-    compiler::OptionalContextRef ref;
-    if (InitialValue* n = context->TryCast<InitialValue>()) {
-      if (n->source().is_current_context()) {
-        ref = unit->function().context(unit->broker());
-      }
-    } else if (Constant* n = context->TryCast<Constant>()) {
-      ref = n->ref().AsContext();
+    if (Constant* n = context->TryCast<Constant>()) {
+      return n->ref().AsContext().previous(unit->broker(), depth);
     }
-    if (!ref.has_value()) return {};
-    return ref->previous(unit->broker(), depth);
+    return {};
   }
 };
 
@@ -162,6 +168,15 @@ class CallArguments {
     return args_[0];
   }
 
+  void set_receiver(ValueNode* receiver) {
+    if (receiver_mode_ == ConvertReceiverMode::kNullOrUndefined) {
+      args_.insert(args_.data(), receiver);
+      receiver_mode_ = ConvertReceiverMode::kAny;
+    } else {
+      args_[0] = receiver;
+    }
+  }
+
   size_t count() const {
     if (receiver_mode_ == ConvertReceiverMode::kNullOrUndefined) {
       return args_.size();
@@ -242,55 +257,342 @@ class V8_NODISCARD MaglevGraphBuilder::CallSpeculationScope {
   MaglevGraphBuilder* builder_;
 };
 
-class V8_NODISCARD MaglevGraphBuilder::LazyDeoptContinuationScope {
+class V8_NODISCARD MaglevGraphBuilder::DeoptFrameScope {
  public:
-  LazyDeoptContinuationScope(MaglevGraphBuilder* builder, Builtin continuation)
+  DeoptFrameScope(MaglevGraphBuilder* builder, Builtin continuation,
+                  compiler::OptionalJSFunctionRef maybe_js_target = {})
+      : builder_(builder),
+        parent_(builder->current_deopt_scope_),
+        data_(DeoptFrame::BuiltinContinuationFrameData{
+            continuation, {}, builder->GetContext(), maybe_js_target}) {
+    builder_->current_deopt_scope_ = this;
+  }
+
+  DeoptFrameScope(MaglevGraphBuilder* builder, Builtin continuation,
+                  compiler::OptionalJSFunctionRef maybe_js_target,
+                  base::Vector<ValueNode* const> parameters)
       : builder_(builder),
-        parent_(builder->current_lazy_deopt_continuation_scope_),
-        continuation_(continuation) {
-    builder_->current_lazy_deopt_continuation_scope_ = this;
+        parent_(builder->current_deopt_scope_),
+        data_(DeoptFrame::BuiltinContinuationFrameData{
+            continuation, builder->zone()->CloneVector(parameters),
+            builder->GetContext(), maybe_js_target}) {
+    builder_->current_deopt_scope_ = this;
   }
-  ~LazyDeoptContinuationScope() {
-    builder_->current_lazy_deopt_continuation_scope_ = parent_;
+
+  DeoptFrameScope(MaglevGraphBuilder* builder, ValueNode* receiver)
+      : builder_(builder),
+        parent_(builder->current_deopt_scope_),
+        data_(DeoptFrame::ConstructInvokeStubFrameData{
+            *builder->compilation_unit(), builder->current_source_position_,
+            receiver, builder->GetContext()}) {
+    builder_->current_deopt_scope_ = this;
   }
 
-  LazyDeoptContinuationScope* parent() const { return parent_; }
-  Builtin continuation() const { return continuation_; }
+  ~DeoptFrameScope() { builder_->current_deopt_scope_ = parent_; }
+
+  DeoptFrameScope* parent() const { return parent_; }
+
+  DeoptFrame::FrameData data() const { return data_; }
 
  private:
   MaglevGraphBuilder* builder_;
-  LazyDeoptContinuationScope* parent_;
-  Builtin continuation_;
+  DeoptFrameScope* parent_;
+  DeoptFrame::FrameData data_;
+};
+
+// Helper class for building a subgraph with its own control flow, that is not
+// attached to any bytecode.
+//
+// It does this by creating a fake dummy compilation unit and frame state, and
+// wrapping up all the places where it pretends to be interpreted but isn't.
+class MaglevGraphBuilder::MaglevSubGraphBuilder {
+ public:
+  class Variable {
+   public:
+    explicit Variable(int index) : pseudo_register_(index) {}
+
+   private:
+    friend class MaglevSubGraphBuilder;
+
+    // Variables pretend to be interpreter registers as far as the dummy
+    // compilation unit and merge states are concerned.
+    interpreter::Register pseudo_register_;
+  };
+
+  class Label {
+   public:
+    Label(MaglevSubGraphBuilder* sub_builder, int predecessor_count)
+        : predecessor_count_(predecessor_count),
+          liveness_(sub_builder->builder_->zone()
+                        ->New<compiler::BytecodeLivenessState>(
+                            sub_builder->compilation_unit_->register_count(),
+                            sub_builder->builder_->zone())) {}
+    Label(MaglevSubGraphBuilder* sub_builder, int predecessor_count,
+          std::initializer_list<Variable*> vars)
+        : Label(sub_builder, predecessor_count) {
+      for (Variable* var : vars) {
+        liveness_->MarkRegisterLive(var->pseudo_register_.index());
+      }
+    }
+
+   private:
+    explicit Label(MergePointInterpreterFrameState* merge_state,
+                   BasicBlock* basic_block)
+        : merge_state_(merge_state), ref_(basic_block) {}
+
+    friend class MaglevSubGraphBuilder;
+    MergePointInterpreterFrameState* merge_state_ = nullptr;
+    int predecessor_count_ = -1;
+    compiler::BytecodeLivenessState* liveness_ = nullptr;
+    BasicBlockRef ref_;
+  };
+
+  class LoopLabel {
+   public:
+   private:
+    explicit LoopLabel(MergePointInterpreterFrameState* merge_state,
+                       BasicBlock* loop_header)
+        : merge_state_(merge_state), loop_header_(loop_header) {}
+
+    friend class MaglevSubGraphBuilder;
+    MergePointInterpreterFrameState* merge_state_ = nullptr;
+    BasicBlock* loop_header_;
+  };
+
+  explicit MaglevSubGraphBuilder(MaglevGraphBuilder* builder,
+                                 int variable_count)
+      : builder_(builder),
+        compilation_unit_(MaglevCompilationUnit::NewDummy(
+            builder->zone(), builder->compilation_unit(), variable_count, 0)),
+        pseudo_frame_(*compilation_unit_, nullptr) {
+    // We need to set a context, since this is unconditional in the frame state,
+    // so set it to the real context.
+    pseudo_frame_.set(interpreter::Register::current_context(),
+                      builder_->current_interpreter_frame().get(
+                          interpreter::Register::current_context()));
+    DCHECK_NULL(pseudo_frame_.known_node_aspects());
+  }
+
+  LoopLabel BeginLoop(std::initializer_list<Variable*> loop_vars) {
+    // Create fake liveness and loop info for the loop, with all given loop vars
+    // set to be live and assigned inside the loop.
+    compiler::BytecodeLivenessState* loop_header_liveness =
+        builder_->zone()->New<compiler::BytecodeLivenessState>(
+            compilation_unit_->register_count(), builder_->zone());
+    compiler::LoopInfo* loop_info = builder_->zone()->New<compiler::LoopInfo>(
+        -1, 0, kMaxInt, compilation_unit_->parameter_count(),
+        compilation_unit_->register_count(), builder_->zone());
+    for (Variable* var : loop_vars) {
+      loop_header_liveness->MarkRegisterLive(var->pseudo_register_.index());
+      loop_info->assignments().Add(var->pseudo_register_);
+    }
+
+    // Finish the current block, jumping (as a fallthrough) to the loop header.
+    BasicBlockRef loop_header_ref;
+    BasicBlock* loop_predecessor =
+        builder_->FinishBlock<Jump>({}, &loop_header_ref);
+
+    // Create a state for the loop header, with two predecessors (the above jump
+    // and the back edge), and initialise with the current state.
+    MergePointInterpreterFrameState* loop_state =
+        MergePointInterpreterFrameState::NewForLoop(
+            pseudo_frame_, *compilation_unit_, 0, 2, loop_header_liveness,
+            loop_info);
+
+    {
+      BorrowParentKnownNodeAspects borrow(this);
+      loop_state->Merge(builder_, *compilation_unit_, pseudo_frame_,
+                        loop_predecessor);
+    }
+
+    // Start a new basic block for the loop.
+    DCHECK_NULL(pseudo_frame_.known_node_aspects());
+    pseudo_frame_.CopyFrom(*compilation_unit_, *loop_state);
+    MoveKnownNodeAspectsToParent();
+
+    builder_->ProcessMergePointPredecessors(*loop_state, loop_header_ref);
+    builder_->StartNewBlock(nullptr, loop_state, loop_header_ref);
+
+    return LoopLabel{loop_state, loop_header_ref.block_ptr()};
+  }
+
+  template <typename ControlNodeT, typename... Args>
+  void GotoIfTrue(Label* true_target,
+                  std::initializer_list<ValueNode*> control_inputs,
+                  Args&&... args) {
+    static_assert(IsConditionalControlNode(Node::opcode_of<ControlNodeT>));
+
+    BasicBlockRef fallthrough_ref;
+
+    // Pass through to FinishBlock, converting Labels to BasicBlockRefs and the
+    // fallthrough label to the fallthrough ref.
+    BasicBlock* block = builder_->FinishBlock<ControlNodeT>(
+        control_inputs, std::forward<Args>(args)..., &true_target->ref_,
+        &fallthrough_ref);
+
+    MergeIntoLabel(true_target, block);
+
+    builder_->StartNewBlock(block, nullptr, fallthrough_ref);
+  }
+
+  template <typename ControlNodeT, typename... Args>
+  void GotoIfFalse(Label* false_target,
+                   std::initializer_list<ValueNode*> control_inputs,
+                   Args&&... args) {
+    static_assert(IsConditionalControlNode(Node::opcode_of<ControlNodeT>));
+
+    BasicBlockRef fallthrough_ref;
+
+    // Pass through to FinishBlock, converting Labels to BasicBlockRefs and the
+    // fallthrough label to the fallthrough ref.
+    BasicBlock* block = builder_->FinishBlock<ControlNodeT>(
+        control_inputs, std::forward<Args>(args)..., &fallthrough_ref,
+        &false_target->ref_);
+
+    MergeIntoLabel(false_target, block);
+
+    builder_->StartNewBlock(block, nullptr, fallthrough_ref);
+  }
+
+  void Goto(Label* label) {
+    if (builder_->current_block_ == nullptr) {
+      label->merge_state_->MergeDead(*compilation_unit_);
+      return;
+    }
+
+    BasicBlock* block = builder_->FinishBlock<Jump>({}, &label->ref_);
+    MergeIntoLabel(label, block);
+  }
+
+  void EndLoop(LoopLabel* loop_label) {
+    if (builder_->current_block_ == nullptr) {
+      loop_label->merge_state_->MergeDeadLoop(*compilation_unit_);
+      return;
+    }
+
+    BasicBlock* block =
+        builder_->FinishBlock<JumpLoop>({}, loop_label->loop_header_);
+    {
+      BorrowParentKnownNodeAspects borrow(this);
+      loop_label->merge_state_->MergeLoop(builder_, *compilation_unit_,
+                                          pseudo_frame_, block);
+    }
+    block->set_predecessor_id(loop_label->merge_state_->predecessor_count() -
+                              1);
+  }
+
+  void Bind(Label* label) {
+    DCHECK_NULL(builder_->current_block_);
+
+    DCHECK_NULL(pseudo_frame_.known_node_aspects());
+    pseudo_frame_.CopyFrom(*compilation_unit_, *label->merge_state_);
+    MoveKnownNodeAspectsToParent();
+
+    builder_->ProcessMergePointPredecessors(*label->merge_state_, label->ref_);
+    builder_->StartNewBlock(nullptr, label->merge_state_, label->ref_);
+  }
+
+  void set(Variable& var, ValueNode* value) {
+    pseudo_frame_.set(var.pseudo_register_, value);
+  }
+  ValueNode* get(const Variable& var) const {
+    return pseudo_frame_.get(var.pseudo_register_);
+  }
+
+ private:
+  // Known node aspects for the pseudo frame are null aside from when merging --
+  // before each merge, we should borrow the node aspects from the parent
+  // builder, and after each merge point, we should copy the node aspects back
+  // to the parent. This is so that the parent graph builder can update its own
+  // known node aspects without having to worry about this pseudo frame.
+  class BorrowParentKnownNodeAspects {
+   public:
+    explicit BorrowParentKnownNodeAspects(MaglevSubGraphBuilder* sub_builder)
+        : sub_builder_(sub_builder) {
+      sub_builder_->TakeKnownNodeAspectsFromParent();
+    }
+    ~BorrowParentKnownNodeAspects() {
+      sub_builder_->MoveKnownNodeAspectsToParent();
+    }
+
+   private:
+    MaglevSubGraphBuilder* sub_builder_;
+  };
+
+  void TakeKnownNodeAspectsFromParent() {
+    DCHECK_NULL(pseudo_frame_.known_node_aspects());
+    pseudo_frame_.set_known_node_aspects(
+        builder_->current_interpreter_frame_.known_node_aspects());
+  }
+
+  void MoveKnownNodeAspectsToParent() {
+    DCHECK_NOT_NULL(pseudo_frame_.known_node_aspects());
+    builder_->current_interpreter_frame_.set_known_node_aspects(
+        pseudo_frame_.known_node_aspects());
+    pseudo_frame_.clear_known_node_aspects();
+  }
+
+  void MergeIntoLabel(Label* label, BasicBlock* predecessor) {
+    BorrowParentKnownNodeAspects borrow(this);
+
+    if (label->merge_state_ == nullptr) {
+      // If there's no merge state, allocate a new one.
+      label->merge_state_ = MergePointInterpreterFrameState::New(
+          *compilation_unit_, pseudo_frame_, 0, label->predecessor_count_,
+          predecessor, label->liveness_);
+    } else {
+      // If there already is a frame state, merge.
+      label->merge_state_->Merge(builder_, *compilation_unit_, pseudo_frame_,
+                                 predecessor);
+    }
+  }
+  template <typename T>
+  T LabelToRef(T&& val) {
+    return std::forward<T>(val);
+  }
+
+  MaglevGraphBuilder* builder_;
+  MaglevCompilationUnit* compilation_unit_;
+  InterpreterFrameState pseudo_frame_;
 };
 
 MaglevGraphBuilder::MaglevGraphBuilder(LocalIsolate* local_isolate,
                                        MaglevCompilationUnit* compilation_unit,
                                        Graph* graph, float call_frequency,
-                                       BytecodeOffset bytecode_offset,
+                                       BytecodeOffset caller_bytecode_offset,
+                                       int inlining_id,
                                        MaglevGraphBuilder* parent)
     : local_isolate_(local_isolate),
       compilation_unit_(compilation_unit),
       parent_(parent),
       graph_(graph),
-      bytecode_analysis_(bytecode().object(), zone(), BytecodeOffset::None(),
-                         true),
+      bytecode_analysis_(bytecode().object(), zone(),
+                         compilation_unit->osr_offset(), true),
       iterator_(bytecode().object()),
       source_position_iterator_(bytecode().SourcePositionTable(broker())),
+      allow_loop_peeling_(is_inline() ? parent_->allow_loop_peeling_
+                                      : v8_flags.maglev_loop_peeling),
+      decremented_predecessor_offsets_(zone()),
+      loop_headers_to_peel_(bytecode().length(), zone()),
       call_frequency_(call_frequency),
       // Add an extra jump_target slot for the inline exit if needed.
-      jump_targets_(zone()->NewArray<BasicBlockRef>(bytecode().length() +
-                                                    (is_inline() ? 1 : 0))),
+      jump_targets_(zone()->AllocateArray<BasicBlockRef>(
+          bytecode().length() + (is_inline() ? 1 : 0))),
       // Overallocate merge_states_ by one to allow always looking up the
       // next offset. This overallocated slot can also be used for the inline
       // exit when needed.
-      merge_states_(zone()->NewArray<MergePointInterpreterFrameState*>(
+      merge_states_(zone()->AllocateArray<MergePointInterpreterFrameState*>(
           bytecode().length() + 1)),
       current_interpreter_frame_(
           *compilation_unit_,
           is_inline() ? parent->current_interpreter_frame_.known_node_aspects()
                       : compilation_unit_->zone()->New<KnownNodeAspects>(
                             compilation_unit_->zone())),
-      caller_bytecode_offset_(bytecode_offset),
+      caller_bytecode_offset_(caller_bytecode_offset),
+      entrypoint_(compilation_unit->is_osr()
+                      ? bytecode_analysis_.osr_entry_point()
+                      : 0),
+      inlining_id_(inlining_id),
       catch_block_stack_(zone()) {
   memset(merge_states_, 0,
          (bytecode().length() + 1) * sizeof(InterpreterFrameState*));
@@ -310,16 +612,40 @@ MaglevGraphBuilder::MaglevGraphBuilder(LocalIsolate* local_isolate,
     new (&jump_targets_[inline_exit_offset()]) BasicBlockRef();
   }
 
+  CHECK_IMPLIES(compilation_unit_->is_osr(), graph_->is_osr());
+  CHECK_EQ(compilation_unit_->info()->toplevel_osr_offset() !=
+               BytecodeOffset::None(),
+           graph_->is_osr());
+  if (compilation_unit_->is_osr()) {
+    CHECK(!is_inline());
+#ifdef DEBUG
+    // OSR'ing into the middle of a loop is currently not supported. There
+    // should not be any issue with OSR'ing outside of loops, just we currently
+    // dont do it...
+    iterator_.SetOffset(compilation_unit_->osr_offset().ToInt());
+    DCHECK_EQ(iterator_.current_bytecode(), interpreter::Bytecode::kJumpLoop);
+    DCHECK_EQ(entrypoint_, iterator_.GetJumpTargetOffset());
+    iterator_.SetOffset(entrypoint_);
+#endif
+
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cerr << "- Non-standard entrypoint @" << entrypoint_
+                << " by OSR from @" << compilation_unit_->osr_offset().ToInt()
+                << std::endl;
+    }
+  }
+  CHECK_IMPLIES(!compilation_unit_->is_osr(), entrypoint_ == 0);
+
   CalculatePredecessorCounts();
 }
 
 void MaglevGraphBuilder::StartPrologue() {
-  current_block_ = zone()->New<BasicBlock>(nullptr);
+  current_block_ = zone()->New<BasicBlock>(nullptr, zone());
 }
 
 BasicBlock* MaglevGraphBuilder::EndPrologue() {
-  BasicBlock* first_block = FinishBlock<Jump>({}, &jump_targets_[0]);
-  MergeIntoFrameState(first_block, 0);
+  BasicBlock* first_block = FinishBlock<Jump>({}, &jump_targets_[entrypoint_]);
+  MergeIntoFrameState(first_block, entrypoint_);
   return first_block;
 }
 
@@ -339,8 +665,16 @@ void MaglevGraphBuilder::InitializeRegister(interpreter::Register reg,
       reg, value ? value : AddNewNode<InitialValue>({}, reg));
 }
 
-void MaglevGraphBuilder::BuildRegisterFrameInitialization(ValueNode* context,
-                                                          ValueNode* closure) {
+void MaglevGraphBuilder::BuildRegisterFrameInitialization(
+    ValueNode* context, ValueNode* closure, ValueNode* new_target) {
+  if (closure == nullptr &&
+      compilation_unit_->info()->specialize_to_function_context()) {
+    compiler::JSFunctionRef function = compiler::MakeRefAssumeMemoryFence(
+        broker(), broker()->CanonicalPersistentHandle(
+                      compilation_unit_->info()->toplevel_function()));
+    closure = GetConstant(function);
+    context = GetConstant(function.context(broker()));
+  }
   InitializeRegister(interpreter::Register::current_context(), context);
   InitializeRegister(interpreter::Register::function_closure(), closure);
 
@@ -348,6 +682,17 @@ void MaglevGraphBuilder::BuildRegisterFrameInitialization(ValueNode* context,
       bytecode().incoming_new_target_or_generator_register();
 
   int register_index = 0;
+
+  if (compilation_unit_->is_osr()) {
+    for (; register_index < register_count(); register_index++) {
+      auto val =
+          AddNewNode<InitialValue>({}, interpreter::Register(register_index));
+      InitializeRegister(interpreter::Register(register_index), val);
+      graph_->osr_values().push_back(val);
+    }
+    return;
+  }
+
   // TODO(leszeks): Don't emit if not needed.
   ValueNode* undefined_value = GetRootConstant(RootIndex::kUndefinedValue);
   if (new_target_or_generator_register.is_valid()) {
@@ -358,19 +703,30 @@ void MaglevGraphBuilder::BuildRegisterFrameInitialization(ValueNode* context,
     }
     current_interpreter_frame_.set(
         new_target_or_generator_register,
-        GetRegisterInput(kJavaScriptCallNewTargetRegister));
+        new_target ? new_target
+                   : GetRegisterInput(kJavaScriptCallNewTargetRegister));
     register_index++;
   }
   for (; register_index < register_count(); register_index++) {
-    current_interpreter_frame_.set(interpreter::Register(register_index),
-                                   undefined_value);
+    InitializeRegister(interpreter::Register(register_index), undefined_value);
   }
 }
 
 void MaglevGraphBuilder::BuildMergeStates() {
-  for (auto& offset_and_info : bytecode_analysis().GetLoopInfos()) {
-    int offset = offset_and_info.first;
-    const compiler::LoopInfo& loop_info = offset_and_info.second;
+  auto offset_and_info = bytecode_analysis().GetLoopInfos().begin();
+  auto end = bytecode_analysis().GetLoopInfos().end();
+  while (offset_and_info != end && offset_and_info->first < entrypoint_) {
+    ++offset_and_info;
+  }
+  for (; offset_and_info != end; ++offset_and_info) {
+    int offset = offset_and_info->first;
+    const compiler::LoopInfo& loop_info = offset_and_info->second;
+    if (loop_headers_to_peel_.Contains(offset)) {
+      // Peeled loops are treated like normal merges at first. We will construct
+      // the proper loop header merge state when reaching the `JumpLoop` of the
+      // peeled iteration.
+      continue;
+    }
     const compiler::BytecodeLivenessState* liveness = GetInLivenessFor(offset);
     DCHECK_NULL(merge_states_[offset]);
     if (v8_flags.trace_maglev_graph_building) {
@@ -395,8 +751,7 @@ void MaglevGraphBuilder::BuildMergeStates() {
                   << ", context register r" << context_reg.index() << std::endl;
       }
       merge_states_[offset] = MergePointInterpreterFrameState::NewForCatchBlock(
-          *compilation_unit_, liveness, offset, context_reg, graph_,
-          is_inline());
+          *compilation_unit_, liveness, offset, context_reg, graph_);
     }
   }
 }
@@ -552,17 +907,17 @@ DeoptFrame* MaglevGraphBuilder::GetParentDeoptFrame() {
     // TODO(leszeks): This is true for our current set of
     // inlinings/continuations, but there might be cases in the future where it
     // isn't. We may need to store the relevant overwritten register in
-    // LazyDeoptContinuationScope.
+    // LazyDeoptFrameScope.
     DCHECK(interpreter::Bytecodes::WritesAccumulator(
         parent_->iterator_.current_bytecode()));
 
     parent_deopt_frame_ =
         zone()->New<DeoptFrame>(parent_->GetDeoptFrameForLazyDeoptHelper(
-            parent_->current_lazy_deopt_continuation_scope_, true));
+            parent_->current_deopt_scope_, true));
     if (inlined_arguments_) {
       parent_deopt_frame_ = zone()->New<InlinedArgumentsDeoptFrame>(
-          *compilation_unit_, caller_bytecode_offset_, *inlined_arguments_,
-          parent_deopt_frame_);
+          *compilation_unit_, caller_bytecode_offset_, GetClosure(),
+          *inlined_arguments_, parent_deopt_frame_);
     }
   }
   return parent_deopt_frame_;
@@ -570,27 +925,53 @@ DeoptFrame* MaglevGraphBuilder::GetParentDeoptFrame() {
 
 DeoptFrame MaglevGraphBuilder::GetLatestCheckpointedFrame() {
   if (!latest_checkpointed_frame_) {
-    // TODO(leszeks): Figure out a way of handling eager continuations.
-    DCHECK_NULL(current_lazy_deopt_continuation_scope_);
-    latest_checkpointed_frame_.emplace(
+    latest_checkpointed_frame_.emplace(InterpretedDeoptFrame(
         *compilation_unit_,
         zone()->New<CompactInterpreterFrameState>(
             *compilation_unit_, GetInLiveness(), current_interpreter_frame_),
-        BytecodeOffset(iterator_.current_offset()), current_source_position_,
-        GetParentDeoptFrame());
+        GetClosure(), BytecodeOffset(iterator_.current_offset()),
+        current_source_position_, GetParentDeoptFrame()));
+
+    if (current_deopt_scope_ != nullptr) {
+      // Support exactly one eager deopt builtin continuation. This can be
+      // expanded in the future if necessary.
+      DCHECK_NULL(current_deopt_scope_->parent());
+      DCHECK_EQ(current_deopt_scope_->data().tag(),
+                DeoptFrame::FrameType::kBuiltinContinuationFrame);
+#ifdef DEBUG
+      if (current_deopt_scope_->data().tag() ==
+          DeoptFrame::FrameType::kBuiltinContinuationFrame) {
+        const DeoptFrame::BuiltinContinuationFrameData& frame =
+            current_deopt_scope_->data()
+                .get<DeoptFrame::BuiltinContinuationFrameData>();
+        if (frame.maybe_js_target) {
+          int stack_parameter_count =
+              Builtins::GetStackParameterCount(frame.builtin_id);
+          DCHECK_EQ(stack_parameter_count, frame.parameters.length());
+        } else {
+          CallInterfaceDescriptor descriptor =
+              Builtins::CallInterfaceDescriptorFor(frame.builtin_id);
+          DCHECK_EQ(descriptor.GetParameterCount(), frame.parameters.length());
+        }
+      }
+#endif
+
+      // Wrap the above frame in the scope frame.
+      latest_checkpointed_frame_.emplace(
+          current_deopt_scope_->data(),
+          zone()->New<DeoptFrame>(*latest_checkpointed_frame_));
+    }
   }
   return *latest_checkpointed_frame_;
 }
 
 DeoptFrame MaglevGraphBuilder::GetDeoptFrameForLazyDeopt() {
-  return GetDeoptFrameForLazyDeoptHelper(current_lazy_deopt_continuation_scope_,
-                                         false);
+  return GetDeoptFrameForLazyDeoptHelper(current_deopt_scope_, false);
 }
 
 DeoptFrame MaglevGraphBuilder::GetDeoptFrameForLazyDeoptHelper(
-    LazyDeoptContinuationScope* continuation_scope,
-    bool mark_accumulator_dead) {
-  if (continuation_scope == nullptr) {
+    DeoptFrameScope* scope, bool mark_accumulator_dead) {
+  if (scope == nullptr) {
     // Potentially copy the out liveness if we want to explicitly drop the
     // accumulator.
     const compiler::BytecodeLivenessState* liveness = GetOutLiveness();
@@ -604,301 +985,519 @@ DeoptFrame MaglevGraphBuilder::GetDeoptFrameForLazyDeoptHelper(
         *compilation_unit_,
         zone()->New<CompactInterpreterFrameState>(*compilation_unit_, liveness,
                                                   current_interpreter_frame_),
-        BytecodeOffset(iterator_.current_offset()), current_source_position_,
-        GetParentDeoptFrame());
+        GetClosure(), BytecodeOffset(iterator_.current_offset()),
+        current_source_position_, GetParentDeoptFrame());
   }
 
   // Currently only support builtin continuations for bytecodes that write to
   // the accumulator
   DCHECK(
       interpreter::Bytecodes::WritesAccumulator(iterator_.current_bytecode()));
-  return BuiltinContinuationDeoptFrame(
-      continuation_scope->continuation(), {}, GetContext(),
-      // Mark the accumulator dead in parent frames since we know that the
-      // continuation will write it.
-      zone()->New<DeoptFrame>(
-          GetDeoptFrameForLazyDeoptHelper(continuation_scope->parent(), true)));
+
+#ifdef DEBUG
+  if (scope->data().tag() == DeoptFrame::FrameType::kBuiltinContinuationFrame) {
+    const DeoptFrame::BuiltinContinuationFrameData& frame =
+        current_deopt_scope_->data()
+            .get<DeoptFrame::BuiltinContinuationFrameData>();
+    if (frame.maybe_js_target) {
+      int stack_parameter_count =
+          Builtins::GetStackParameterCount(frame.builtin_id);
+      // The deopt input value is passed by the deoptimizer, so shouldn't be a
+      // parameter here.
+      DCHECK_EQ(stack_parameter_count, frame.parameters.length() + 1);
+    } else {
+      CallInterfaceDescriptor descriptor =
+          Builtins::CallInterfaceDescriptorFor(frame.builtin_id);
+      // The deopt input value is passed by the deoptimizer, so shouldn't be a
+      // parameter here.
+      DCHECK_EQ(descriptor.GetParameterCount(), frame.parameters.length() + 1);
+      // The deopt input value is passed on the stack.
+      DCHECK_GT(descriptor.GetStackParameterCount(), 0);
+    }
+  }
+#endif
+
+  // Mark the accumulator dead in parent frames since we know that the
+  // continuation will write it.
+  return DeoptFrame(scope->data(),
+                    zone()->New<DeoptFrame>(GetDeoptFrameForLazyDeoptHelper(
+                        scope->parent(),
+                        scope->data().tag() ==
+                            DeoptFrame::FrameType::kBuiltinContinuationFrame)));
 }
 
 InterpretedDeoptFrame MaglevGraphBuilder::GetDeoptFrameForEntryStackCheck() {
-  DCHECK_EQ(iterator_.current_offset(), 0);
+  DCHECK_EQ(iterator_.current_offset(), entrypoint_);
   DCHECK_NULL(parent_);
+  int osr_jump_loop_pos;
+  if (graph_->is_osr()) {
+    osr_jump_loop_pos = bytecode_analysis_.osr_bailout_id().ToInt();
+  }
   return InterpretedDeoptFrame(
       *compilation_unit_,
       zone()->New<CompactInterpreterFrameState>(
-          *compilation_unit_, GetInLivenessFor(0), current_interpreter_frame_),
-      BytecodeOffset(kFunctionEntryBytecodeOffset), current_source_position_,
-      nullptr);
+          *compilation_unit_,
+          GetInLivenessFor(graph_->is_osr() ? osr_jump_loop_pos : 0),
+          current_interpreter_frame_),
+      GetClosure(),
+      BytecodeOffset(graph_->is_osr() ? osr_jump_loop_pos
+                                      : kFunctionEntryBytecodeOffset),
+      current_source_position_, nullptr);
 }
 
-ValueNode* MaglevGraphBuilder::GetTaggedValue(ValueNode* value) {
-  switch (value->properties().value_representation()) {
+ValueNode* MaglevGraphBuilder::GetTaggedValue(
+    ValueNode* value, UseReprHintRecording record_use_repr_hint) {
+  if (V8_LIKELY(record_use_repr_hint == UseReprHintRecording::kRecord)) {
+    RecordUseReprHintIfPhi(value, UseRepresentation::kTagged);
+  }
+
+  ValueRepresentation representation =
+      value->properties().value_representation();
+  if (representation == ValueRepresentation::kTagged) return value;
+
+  NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
+  auto& alternative = node_info->alternative();
+
+  if (ValueNode* alt = alternative.tagged()) {
+    return alt;
+  }
+
+  switch (representation) {
+    case ValueRepresentation::kInt32: {
+      if (NodeTypeIsSmi(node_info->type())) {
+        return alternative.set_tagged(AddNewNode<UnsafeSmiTag>({value}));
+      }
+      return alternative.set_tagged(AddNewNode<Int32ToNumber>({value}));
+    }
+    case ValueRepresentation::kUint32: {
+      if (NodeTypeIsSmi(node_info->type())) {
+        return alternative.set_tagged(AddNewNode<UnsafeSmiTag>({value}));
+      }
+      return alternative.set_tagged(AddNewNode<Uint32ToNumber>({value}));
+    }
+    case ValueRepresentation::kFloat64: {
+      return alternative.set_tagged(AddNewNode<Float64ToTagged>({value}));
+    }
+    case ValueRepresentation::kHoleyFloat64: {
+      return alternative.set_tagged(AddNewNode<HoleyFloat64ToTagged>({value}));
+    }
+
+    case ValueRepresentation::kTagged:
     case ValueRepresentation::kWord64:
       UNREACHABLE();
-    case ValueRepresentation::kTagged:
-      return value;
+  }
+  UNREACHABLE();
+}
+
+ValueNode* MaglevGraphBuilder::GetSmiValue(
+    ValueNode* value, UseReprHintRecording record_use_repr_hint) {
+  if (V8_LIKELY(record_use_repr_hint == UseReprHintRecording::kRecord)) {
+    RecordUseReprHintIfPhi(value, UseRepresentation::kTagged);
+  }
+
+  NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
+
+  ValueRepresentation representation =
+      value->properties().value_representation();
+  if (representation == ValueRepresentation::kTagged) {
+    BuildCheckSmi(value, !value->Is<Phi>());
+    return value;
+  }
+
+  auto& alternative = node_info->alternative();
+
+  if (ValueNode* alt = alternative.tagged()) {
+    BuildCheckSmi(alt, !value->Is<Phi>());
+    return alt;
+  }
+
+  switch (representation) {
     case ValueRepresentation::kInt32: {
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->tagged_alternative == nullptr) {
-        if (NodeTypeIsSmi(node_info->type)) {
-          node_info->tagged_alternative = AddNewNode<UnsafeSmiTag>({value});
-        } else {
-          node_info->tagged_alternative = AddNewNode<Int32ToNumber>({value});
-        }
+      if (NodeTypeIsSmi(node_info->type())) {
+        return alternative.set_tagged(AddNewNode<UnsafeSmiTag>({value}));
       }
-      return node_info->tagged_alternative;
+      return alternative.set_tagged(AddNewNode<CheckedSmiTagInt32>({value}));
     }
     case ValueRepresentation::kUint32: {
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->tagged_alternative == nullptr) {
-        if (NodeTypeIsSmi(node_info->type)) {
-          node_info->tagged_alternative = AddNewNode<UnsafeSmiTag>({value});
-        } else {
-          node_info->tagged_alternative = AddNewNode<Uint32ToNumber>({value});
-        }
+      if (NodeTypeIsSmi(node_info->type())) {
+        return alternative.set_tagged(AddNewNode<UnsafeSmiTag>({value}));
       }
-      return node_info->tagged_alternative;
+      return alternative.set_tagged(AddNewNode<CheckedSmiTagUint32>({value}));
     }
     case ValueRepresentation::kFloat64: {
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->tagged_alternative == nullptr) {
-        node_info->tagged_alternative = AddNewNode<Float64ToTagged>({value});
-      }
-      return node_info->tagged_alternative;
+      return alternative.set_tagged(AddNewNode<CheckedSmiTagFloat64>({value}));
+    }
+    case ValueRepresentation::kHoleyFloat64: {
+      return alternative.set_tagged(AddNewNode<CheckedSmiTagFloat64>({value}));
     }
+
+    case ValueRepresentation::kTagged:
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
   }
   UNREACHABLE();
 }
 
+namespace {
+CheckType GetCheckType(NodeType type) {
+  return NodeTypeIs(type, NodeType::kAnyHeapObject)
+             ? CheckType::kOmitHeapObjectCheck
+             : CheckType::kCheckHeapObject;
+}
+}  // namespace
+
 ValueNode* MaglevGraphBuilder::GetInternalizedString(
     interpreter::Register reg) {
   ValueNode* node = GetTaggedValue(reg);
-  if (known_node_aspects().GetOrCreateInfoFor(node)->is_internalized_string()) {
-    return node;
-  }
-  if (Constant* constant = node->TryCast<Constant>()) {
-    if (constant->object().IsInternalizedString()) {
-      SetKnownType(constant, NodeType::kInternalizedString);
-      return constant;
-    }
+  NodeType old_type;
+  if (CheckType(node, NodeType::kInternalizedString, &old_type)) return node;
+  if (!NodeTypeIs(old_type, NodeType::kString)) {
+    NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(node);
+    known_info->CombineType(NodeType::kString);
   }
-  node = AddNewNode<CheckedInternalizedString>({node});
-  SetKnownType(node, NodeType::kInternalizedString);
+  node = AddNewNode<CheckedInternalizedString>({node}, GetCheckType(old_type));
   current_interpreter_frame_.set(reg, node);
   return node;
 }
 
 namespace {
-NodeType TaggedToFloat64ConversionTypeToNodeType(
-    TaggedToFloat64ConversionType conversion_type) {
+NodeType ToNumberHintToNodeType(ToNumberHint conversion_type) {
   switch (conversion_type) {
-    case TaggedToFloat64ConversionType::kNumber:
+    case ToNumberHint::kAssumeSmi:
+      return NodeType::kSmi;
+    case ToNumberHint::kDisallowToNumber:
+    case ToNumberHint::kAssumeNumber:
       return NodeType::kNumber;
-    case TaggedToFloat64ConversionType::kNumberOrOddball:
+    case ToNumberHint::kAssumeNumberOrOddball:
       return NodeType::kNumberOrOddball;
   }
 }
+TaggedToFloat64ConversionType ToNumberHintToConversionType(
+    ToNumberHint conversion_type) {
+  switch (conversion_type) {
+    case ToNumberHint::kAssumeSmi:
+      UNREACHABLE();
+    case ToNumberHint::kDisallowToNumber:
+    case ToNumberHint::kAssumeNumber:
+      return TaggedToFloat64ConversionType::kOnlyNumber;
+    case ToNumberHint::kAssumeNumberOrOddball:
+      return TaggedToFloat64ConversionType::kNumberOrOddball;
+  }
+}
 }  // namespace
 
-ValueNode* MaglevGraphBuilder::GetTruncatedInt32FromNumber(
-    ValueNode* value, TaggedToFloat64ConversionType conversion_type) {
-  switch (value->properties().value_representation()) {
-    case ValueRepresentation::kWord64:
-      UNREACHABLE();
+ValueNode* MaglevGraphBuilder::GetTruncatedInt32ForToNumber(ValueNode* value,
+                                                            ToNumberHint hint) {
+  RecordUseReprHintIfPhi(value, UseRepresentation::kTruncatedInt32);
+
+  ValueRepresentation representation =
+      value->properties().value_representation();
+  if (representation == ValueRepresentation::kInt32) return value;
+  if (representation == ValueRepresentation::kUint32) {
+    // This node is cheap (no code gen, just a bitcast), so don't cache it.
+    return AddNewNode<TruncateUint32ToInt32>({value});
+  }
+
+  // Process constants first to avoid allocating NodeInfo for them.
+  switch (value->opcode()) {
+    case Opcode::kConstant: {
+      compiler::ObjectRef object = value->Cast<Constant>()->object();
+      if (!object.IsHeapNumber()) break;
+      int32_t truncated_value = DoubleToInt32(object.AsHeapNumber().value());
+      if (!Smi::IsValid(truncated_value)) break;
+      return GetInt32Constant(truncated_value);
+    }
+    case Opcode::kSmiConstant:
+      return GetInt32Constant(value->Cast<SmiConstant>()->value().value());
+    case Opcode::kRootConstant: {
+      Object root_object =
+          local_isolate_->root(value->Cast<RootConstant>()->index());
+      if (!IsOddball(root_object, local_isolate_)) break;
+      int32_t truncated_value =
+          DoubleToInt32(Oddball::cast(root_object)->to_number_raw());
+      // All oddball ToNumber truncations are valid Smis.
+      DCHECK(Smi::IsValid(truncated_value));
+      return GetInt32Constant(truncated_value);
+    }
+    case Opcode::kFloat64Constant: {
+      int32_t truncated_value =
+          DoubleToInt32(value->Cast<Float64Constant>()->value().get_scalar());
+      if (!Smi::IsValid(truncated_value)) break;
+      return GetInt32Constant(truncated_value);
+    }
+
+    // We could emit unconditional eager deopts for other kinds of constant, but
+    // it's not necessary, the appropriate checking conversion nodes will deopt.
+    default:
+      break;
+  }
+
+  NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
+  auto& alternative = node_info->alternative();
+
+  // If there is an int32_alternative, then that works as a truncated value
+  // too.
+  if (ValueNode* alt = alternative.int32()) {
+    return alt;
+  }
+  if (ValueNode* alt = alternative.truncated_int32_to_number()) {
+    return alt;
+  }
+
+  switch (representation) {
     case ValueRepresentation::kTagged: {
-      if (SmiConstant* constant = value->TryCast<SmiConstant>()) {
-        return GetInt32Constant(constant->value().value());
-      }
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->int32_alternative != nullptr) {
-        return node_info->int32_alternative;
-      }
-      if (node_info->truncated_int32_alternative != nullptr) {
-        return node_info->truncated_int32_alternative;
-      }
       NodeType old_type;
-      NodeType desired_type =
-          TaggedToFloat64ConversionTypeToNodeType(conversion_type);
+      NodeType desired_type = ToNumberHintToNodeType(hint);
       EnsureType(value, desired_type, &old_type);
       if (NodeTypeIsSmi(old_type)) {
-        return node_info->int32_alternative =
-                   AddNewNode<UnsafeSmiUntag>({value});
+        // Smi untagging can be cached as an int32 alternative, not just a
+        // truncated alternative.
+        return alternative.set_int32(AddNewNode<UnsafeSmiUntag>({value}));
+      }
+      if (desired_type == NodeType::kSmi) {
+        return alternative.set_int32(AddNewNode<CheckedSmiUntag>({value}));
       }
+      TaggedToFloat64ConversionType conversion_type =
+          ToNumberHintToConversionType(hint);
       if (NodeTypeIs(old_type, desired_type)) {
-        return node_info->truncated_int32_alternative =
-                   AddNewNode<TruncateNumberOrOddballToInt32>({value},
-                                                              conversion_type);
+        return alternative.set_truncated_int32_to_number(
+            AddNewNode<TruncateNumberOrOddballToInt32>({value},
+                                                       conversion_type));
       }
-      return node_info->truncated_int32_alternative =
-                 AddNewNode<CheckedTruncateNumberOrOddballToInt32>(
-                     {value}, conversion_type);
-      UNREACHABLE();
+      return alternative.set_truncated_int32_to_number(
+          AddNewNode<CheckedTruncateNumberOrOddballToInt32>({value},
+                                                            conversion_type));
     }
-    case ValueRepresentation::kFloat64: {
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->truncated_int32_alternative == nullptr) {
-        node_info->truncated_int32_alternative =
-            AddNewNode<TruncateFloat64ToInt32>({value});
-      }
-      return node_info->truncated_int32_alternative;
+    case ValueRepresentation::kFloat64:
+    // Ignore conversion_type for HoleyFloat64, and treat them like Float64.
+    // ToNumber of undefined is anyway a NaN, so we'll simply truncate away
+    // the NaN-ness of the hole, and don't need to do extra oddball checks so
+    // we can ignore the hint (though we'll miss updating the feedback).
+    case ValueRepresentation::kHoleyFloat64: {
+      return alternative.set_truncated_int32_to_number(
+          AddNewNode<TruncateFloat64ToInt32>({value}));
     }
+
     case ValueRepresentation::kInt32:
-      // Already good.
-      return value;
     case ValueRepresentation::kUint32:
-      return AddNewNode<TruncateUint32ToInt32>({value});
-  }
-  UNREACHABLE();
-}
-
-ValueNode* MaglevGraphBuilder::GetTruncatedInt32(ValueNode* value) {
-  switch (value->properties().value_representation()) {
     case ValueRepresentation::kWord64:
       UNREACHABLE();
-    case ValueRepresentation::kTagged:
-    case ValueRepresentation::kFloat64:
-      return GetInt32(value);
-    case ValueRepresentation::kInt32:
-      // Already good.
-      return value;
-    case ValueRepresentation::kUint32:
-      return AddNewNode<TruncateUint32ToInt32>({value});
   }
   UNREACHABLE();
 }
 
 ValueNode* MaglevGraphBuilder::GetInt32(ValueNode* value) {
-  switch (value->properties().value_representation()) {
-    case ValueRepresentation::kWord64:
-      UNREACHABLE();
+  RecordUseReprHintIfPhi(value, UseRepresentation::kInt32);
+
+  ValueRepresentation representation =
+      value->properties().value_representation();
+  if (representation == ValueRepresentation::kInt32) return value;
+
+  // Process constants first to avoid allocating NodeInfo for them.
+  switch (value->opcode()) {
+    case Opcode::kSmiConstant:
+      return GetInt32Constant(value->Cast<SmiConstant>()->value().value());
+    case Opcode::kFloat64Constant: {
+      double double_value =
+          value->Cast<Float64Constant>()->value().get_scalar();
+      if (!IsSmiDouble(double_value)) break;
+      return GetInt32Constant(
+          FastD2I(value->Cast<Float64Constant>()->value().get_scalar()));
+    }
+
+    // We could emit unconditional eager deopts for other kinds of constant, but
+    // it's not necessary, the appropriate checking conversion nodes will deopt.
+    default:
+      break;
+  }
+
+  NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
+  auto& alternative = node_info->alternative();
+
+  if (ValueNode* alt = alternative.int32()) {
+    return alt;
+  }
+
+  switch (representation) {
     case ValueRepresentation::kTagged: {
-      if (SmiConstant* constant = value->TryCast<SmiConstant>()) {
-        return GetInt32Constant(constant->value().value());
-      }
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->int32_alternative == nullptr) {
-        node_info->int32_alternative = BuildSmiUntag(value);
-      }
-      return node_info->int32_alternative;
+      // TODO(leszeks): Widen this path to allow HeapNumbers with Int32 values.
+      return alternative.set_int32(BuildSmiUntag(value));
     }
-    case ValueRepresentation::kInt32:
-      return value;
     case ValueRepresentation::kUint32: {
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->int32_alternative == nullptr) {
-        if (node_info->is_smi()) {
-          node_info->int32_alternative =
-              AddNewNode<TruncateUint32ToInt32>({value});
-        } else {
-          node_info->int32_alternative =
-              AddNewNode<CheckedUint32ToInt32>({value});
-        }
+      if (node_info->is_smi()) {
+        return alternative.set_int32(
+            AddNewNode<TruncateUint32ToInt32>({value}));
       }
-      return node_info->int32_alternative;
+      return alternative.set_int32(AddNewNode<CheckedUint32ToInt32>({value}));
     }
-    case ValueRepresentation::kFloat64: {
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->int32_alternative == nullptr) {
-        node_info->int32_alternative =
-            AddNewNode<CheckedTruncateFloat64ToInt32>({value});
-      }
-      return node_info->int32_alternative;
+    case ValueRepresentation::kFloat64:
+    // The check here will also work for the hole NaN, so we can treat
+    // HoleyFloat64 as Float64.
+    case ValueRepresentation::kHoleyFloat64: {
+      return alternative.set_int32(
+          AddNewNode<CheckedTruncateFloat64ToInt32>({value}));
     }
+
+    case ValueRepresentation::kInt32:
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
   }
   UNREACHABLE();
 }
 
-ValueNode* MaglevGraphBuilder::GetFloat64(
-    ValueNode* value, TaggedToFloat64ConversionType conversion_type) {
-  switch (value->properties().value_representation()) {
-    case ValueRepresentation::kWord64:
-      UNREACHABLE();
-    case ValueRepresentation::kTagged: {
-      if (Constant* constant = value->TryCast<Constant>()) {
-        if (constant->object().IsHeapNumber()) {
-          return GetFloat64Constant(constant->object().AsHeapNumber().value());
-        }
+ValueNode* MaglevGraphBuilder::GetFloat64(ValueNode* value) {
+  RecordUseReprHintIfPhi(value, UseRepresentation::kFloat64);
+
+  return GetFloat64ForToNumber(value, ToNumberHint::kDisallowToNumber);
+}
+
+ValueNode* MaglevGraphBuilder::GetFloat64ForToNumber(ValueNode* value,
+                                                     ToNumberHint hint) {
+  ValueRepresentation representation =
+      value->properties().value_representation();
+  if (representation == ValueRepresentation::kFloat64) return value;
+
+  // Process constants first to avoid allocating NodeInfo for them.
+  switch (value->opcode()) {
+    case Opcode::kConstant: {
+      compiler::ObjectRef object = value->Cast<Constant>()->object();
+      if (object.IsHeapNumber()) {
+        return GetFloat64Constant(object.AsHeapNumber().value());
       }
-      if (SmiConstant* constant = value->TryCast<SmiConstant>()) {
-        return GetFloat64Constant(constant->value().value());
+      // Oddballs should be RootConstants.
+      DCHECK(!IsOddball(*object.object()));
+      break;
+    }
+    case Opcode::kSmiConstant:
+      return GetFloat64Constant(value->Cast<SmiConstant>()->value().value());
+    case Opcode::kInt32Constant:
+      return GetFloat64Constant(value->Cast<Int32Constant>()->value());
+    case Opcode::kRootConstant: {
+      Object root_object =
+          local_isolate_->root(value->Cast<RootConstant>()->index());
+      if (hint != ToNumberHint::kDisallowToNumber && IsOddball(root_object)) {
+        return GetFloat64Constant(Oddball::cast(root_object)->to_number_raw());
       }
-      if (conversion_type == TaggedToFloat64ConversionType::kNumberOrOddball) {
-        if (RootConstant* constant = value->TryCast<RootConstant>()) {
-          Object root_object = local_isolate_->root(constant->index());
-          if (root_object.IsOddball(local_isolate_)) {
-            return GetFloat64Constant(
-                Oddball::cast(root_object).to_number_raw());
-          }
-        }
+      if (IsHeapNumber(root_object)) {
+        return GetFloat64Constant(HeapNumber::cast(root_object)->value());
       }
+      break;
+    }
 
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->float64_alternative != nullptr) {
-        return node_info->float64_alternative;
-      }
-      switch (conversion_type) {
-        case TaggedToFloat64ConversionType::kNumber:
-          // Number->Float64 conversions are lossless, so they can become the
-          // canonical float64_alternative.
-          return node_info->float64_alternative = BuildNumberOrOddballToFloat64(
-                     value, TaggedToFloat64ConversionType::kNumber);
-        case TaggedToFloat64ConversionType::kNumberOrOddball: {
-          // NumberOrOddball->Float64 conversions are lossy, since they lose the
-          // oddball information, so they can only become the canonical
-          // float64_alternative if they are known number (and therefore not
-          // oddball).
+    // We could emit unconditional eager deopts for other kinds of constant, but
+    // it's not necessary, the appropriate checking conversion nodes will deopt.
+    default:
+      break;
+  }
+
+  NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
+  auto& alternative = node_info->alternative();
+
+  if (ValueNode* alt = alternative.float64()) {
+    return alt;
+  }
+
+  switch (representation) {
+    case ValueRepresentation::kTagged: {
+      switch (hint) {
+        case ToNumberHint::kAssumeSmi:
+          // Get the float64 value of a Smi value its int32 representation.
+          return GetFloat64(GetInt32(value));
+        case ToNumberHint::kDisallowToNumber:
+        case ToNumberHint::kAssumeNumber:
+          // Number->Float64 conversions are exact alternatives, so they can
+          // also become the canonical float64_alternative.
+          return alternative.set_float64(BuildNumberOrOddballToFloat64(
+              value, TaggedToFloat64ConversionType::kOnlyNumber));
+        case ToNumberHint::kAssumeNumberOrOddball: {
+          // NumberOrOddball->Float64 conversions are not exact alternatives,
+          // since they lose the information that this is an oddball, so they
+          // can only become the canonical float64_alternative if they are a
+          // known number (and therefore not oddball).
           ValueNode* float64_node = BuildNumberOrOddballToFloat64(
               value, TaggedToFloat64ConversionType::kNumberOrOddball);
-          if (NodeTypeIsNumber(node_info->type)) {
-            node_info->float64_alternative = float64_node;
+          if (NodeTypeIsNumber(node_info->type())) {
+            alternative.set_float64(float64_node);
           }
           return float64_node;
         }
       }
     }
-    case ValueRepresentation::kInt32: {
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->float64_alternative == nullptr) {
-        node_info->float64_alternative =
-            AddNewNode<ChangeInt32ToFloat64>({value});
-      }
-      return node_info->float64_alternative;
-    }
-    case ValueRepresentation::kUint32: {
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->float64_alternative == nullptr) {
-        node_info->float64_alternative =
-            AddNewNode<ChangeUint32ToFloat64>({value});
+    case ValueRepresentation::kInt32:
+      return alternative.set_float64(AddNewNode<ChangeInt32ToFloat64>({value}));
+    case ValueRepresentation::kUint32:
+      return alternative.set_float64(
+          AddNewNode<ChangeUint32ToFloat64>({value}));
+    case ValueRepresentation::kHoleyFloat64: {
+      switch (hint) {
+        case ToNumberHint::kAssumeSmi:
+        case ToNumberHint::kDisallowToNumber:
+        case ToNumberHint::kAssumeNumber:
+          // Number->Float64 conversions are exact alternatives, so they can
+          // also become the canonical float64_alternative.
+          return alternative.set_float64(
+              AddNewNode<CheckedHoleyFloat64ToFloat64>({value}));
+        case ToNumberHint::kAssumeNumberOrOddball:
+          // NumberOrOddball->Float64 conversions are not exact alternatives,
+          // since they lose the information that this is an oddball, so they
+          // cannot become the canonical float64_alternative.
+          return AddNewNode<HoleyFloat64ToMaybeNanFloat64>({value});
       }
-      return node_info->float64_alternative;
     }
     case ValueRepresentation::kFloat64:
-      return value;
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
   }
   UNREACHABLE();
 }
 
-ValueNode* MaglevGraphBuilder::GetUint32ClampedFromNumber(ValueNode* value) {
+ValueNode* MaglevGraphBuilder::GetHoleyFloat64ForToNumber(ValueNode* value,
+                                                          ToNumberHint hint) {
+  RecordUseReprHintIfPhi(value, UseRepresentation::kHoleyFloat64);
+
+  ValueRepresentation representation =
+      value->properties().value_representation();
+  // Ignore the hint for
+  if (representation == ValueRepresentation::kHoleyFloat64) return value;
+  return GetFloat64ForToNumber(value, hint);
+}
+
+namespace {
+int32_t ClampToUint8(int32_t value) {
+  if (value < 0) return 0;
+  if (value > 255) return 255;
+  return value;
+}
+}  // namespace
+
+ValueNode* MaglevGraphBuilder::GetUint8ClampedForToNumber(ValueNode* value,
+                                                          ToNumberHint hint) {
   switch (value->properties().value_representation()) {
     case ValueRepresentation::kWord64:
       UNREACHABLE();
     case ValueRepresentation::kTagged: {
       if (SmiConstant* constant = value->TryCast<SmiConstant>()) {
-        int32_t value = constant->value().value();
-        if (value < 0) return GetInt32Constant(0);
-        if (value > 255) return GetInt32Constant(255);
-        return GetInt32Constant(constant->value().value());
+        return GetInt32Constant(ClampToUint8(constant->value().value()));
       }
-      NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(value);
-      if (node_info->int32_alternative != nullptr) {
-        return AddNewNode<Int32ToUint8Clamped>({node_info->int32_alternative});
+      NodeInfo* info = known_node_aspects().TryGetInfoFor(value);
+      if (info && info->alternative().int32()) {
+        return AddNewNode<Int32ToUint8Clamped>({info->alternative().int32()});
       }
       return AddNewNode<CheckedNumberToUint8Clamped>({value});
     }
-    case ValueRepresentation::kFloat64: {
+    // Ignore conversion_type for HoleyFloat64, and treat them like Float64.
+    // ToNumber of undefined is anyway a NaN, so we'll simply truncate away the
+    // NaN-ness of the hole, and don't need to do extra oddball checks so we can
+    // ignore the hint (though we'll miss updating the feedback).
+    case ValueRepresentation::kFloat64:
+    case ValueRepresentation::kHoleyFloat64:
+      // TODO(leszeks): Handle Float64Constant, which requires the correct
+      // rounding for clamping.
       return AddNewNode<Float64ToUint8Clamped>({value});
-    }
     case ValueRepresentation::kInt32:
+      if (Int32Constant* constant = value->TryCast<Int32Constant>()) {
+        return GetInt32Constant(ClampToUint8(constant->value()));
+      }
       return AddNewNode<Int32ToUint8Clamped>({value});
     case ValueRepresentation::kUint32:
       return AddNewNode<Uint32ToUint8Clamped>({value});
@@ -965,14 +1564,6 @@ constexpr bool BinaryOperationIsBitwiseInt32() {
   V(Decrement, Int32DecrementWithOverflow)   \
   V(Negate, Int32NegateWithOverflow)
 
-#define MAP_COMPARE_OPERATION_TO_INT32_NODE(V) \
-  V(Equal, Int32Equal)                         \
-  V(StrictEqual, Int32StrictEqual)             \
-  V(LessThan, Int32LessThan)                   \
-  V(LessThanOrEqual, Int32LessThanOrEqual)     \
-  V(GreaterThan, Int32GreaterThan)             \
-  V(GreaterThanOrEqual, Int32GreaterThanOrEqual)
-
 // MAP_OPERATION_TO_FLOAT64_NODE are tuples with the following format:
 // (Operation name, Float64 operation node).
 #define MAP_OPERATION_TO_FLOAT64_NODE(V) \
@@ -984,14 +1575,6 @@ constexpr bool BinaryOperationIsBitwiseInt32() {
   V(Negate, Float64Negate)               \
   V(Exponentiate, Float64Exponentiate)
 
-#define MAP_COMPARE_OPERATION_TO_FLOAT64_NODE(V) \
-  V(Equal, Float64Equal)                         \
-  V(StrictEqual, Float64StrictEqual)             \
-  V(LessThan, Float64LessThan)                   \
-  V(LessThanOrEqual, Float64LessThanOrEqual)     \
-  V(GreaterThan, Float64GreaterThan)             \
-  V(GreaterThanOrEqual, Float64GreaterThanOrEqual)
-
 template <Operation kOperation>
 static constexpr base::Optional<int> Int32Identity() {
   switch (kOperation) {
@@ -1015,7 +1598,6 @@ struct Int32NodeForHelper;
   };
 MAP_UNARY_OPERATION_TO_INT32_NODE(SPECIALIZATION)
 MAP_BINARY_OPERATION_TO_INT32_NODE(SPECIALIZATION)
-MAP_COMPARE_OPERATION_TO_INT32_NODE(SPECIALIZATION)
 #undef SPECIALIZATION
 
 template <Operation kOperation>
@@ -1029,7 +1611,6 @@ struct Float64NodeForHelper;
     using type = OpNode;                          \
   };
 MAP_OPERATION_TO_FLOAT64_NODE(SPECIALIZATION)
-MAP_COMPARE_OPERATION_TO_FLOAT64_NODE(SPECIALIZATION)
 #undef SPECIALIZATION
 
 template <Operation kOperation>
@@ -1065,20 +1646,20 @@ void MaglevGraphBuilder::BuildGenericBinarySmiOperationNode() {
 
 template <Operation kOperation>
 void MaglevGraphBuilder::BuildInt32UnaryOperationNode() {
-  static const bool input_is_truncated =
-      BinaryOperationIsBitwiseInt32<kOperation>();
+  // Use BuildTruncatingInt32BitwiseNotForToNumber with Smi input hint
+  // for truncating operations.
+  static_assert(!BinaryOperationIsBitwiseInt32<kOperation>());
   // TODO(v8:7700): Do constant folding.
-  ValueNode* value = input_is_truncated ? GetAccumulatorTruncatedInt32()
-                                        : GetAccumulatorInt32();
+  ValueNode* value = GetAccumulatorInt32();
   using OpNodeT = Int32NodeFor<kOperation>;
   SetAccumulator(AddNewNode<OpNodeT>({value}));
 }
 
-void MaglevGraphBuilder::BuildTruncatingInt32BitwiseNotForNumber(
-    TaggedToFloat64ConversionType conversion_type) {
+void MaglevGraphBuilder::BuildTruncatingInt32BitwiseNotForToNumber(
+    ToNumberHint hint) {
   // TODO(v8:7700): Do constant folding.
-  ValueNode* value = GetTruncatedInt32FromNumber(
-      current_interpreter_frame_.accumulator(), conversion_type);
+  ValueNode* value = GetTruncatedInt32ForToNumber(
+      current_interpreter_frame_.accumulator(), hint);
   SetAccumulator(AddNewNode<Int32BitwiseNot>({value}));
 }
 
@@ -1121,16 +1702,12 @@ ValueNode* MaglevGraphBuilder::TryFoldInt32BinaryOperation(ValueNode* left,
 
 template <Operation kOperation>
 void MaglevGraphBuilder::BuildInt32BinaryOperationNode() {
-  // Truncating Int32 nodes treat their input as a signed int32 regardless
-  // of whether it's really signed or not, so we allow Uint32 by loading a
-  // TruncatedInt32 value.
-  static const bool inputs_are_truncated =
-      BinaryOperationIsBitwiseInt32<kOperation>();
+  // Use BuildTruncatingInt32BinaryOperationNodeForToNumber with Smi input hint
+  // for truncating operations.
+  static_assert(!BinaryOperationIsBitwiseInt32<kOperation>());
   // TODO(v8:7700): Do constant folding.
-  ValueNode* left = inputs_are_truncated ? LoadRegisterTruncatedInt32(0)
-                                         : LoadRegisterInt32(0);
-  ValueNode* right = inputs_are_truncated ? GetAccumulatorTruncatedInt32()
-                                          : GetAccumulatorInt32();
+  ValueNode* left = LoadRegisterInt32(0);
+  ValueNode* right = GetAccumulatorInt32();
 
   if (ValueNode* result =
           TryFoldInt32BinaryOperation<kOperation>(left, right)) {
@@ -1143,22 +1720,20 @@ void MaglevGraphBuilder::BuildInt32BinaryOperationNode() {
 }
 
 template <Operation kOperation>
-void MaglevGraphBuilder::BuildTruncatingInt32BinaryOperationNodeForNumber(
-    TaggedToFloat64ConversionType conversion_type) {
-  DCHECK(BinaryOperationIsBitwiseInt32<kOperation>());
+void MaglevGraphBuilder::BuildTruncatingInt32BinaryOperationNodeForToNumber(
+    ToNumberHint hint) {
+  static_assert(BinaryOperationIsBitwiseInt32<kOperation>());
   // TODO(v8:7700): Do constant folding.
   ValueNode* left;
   ValueNode* right;
   if (IsRegisterEqualToAccumulator(0)) {
-    left = right = GetTruncatedInt32FromNumber(
-        current_interpreter_frame_.get(iterator_.GetRegisterOperand(0)),
-        conversion_type);
+    left = right = GetTruncatedInt32ForToNumber(
+        current_interpreter_frame_.get(iterator_.GetRegisterOperand(0)), hint);
   } else {
-    left = GetTruncatedInt32FromNumber(
-        current_interpreter_frame_.get(iterator_.GetRegisterOperand(0)),
-        conversion_type);
-    right = GetTruncatedInt32FromNumber(
-        current_interpreter_frame_.accumulator(), conversion_type);
+    left = GetTruncatedInt32ForToNumber(
+        current_interpreter_frame_.get(iterator_.GetRegisterOperand(0)), hint);
+    right = GetTruncatedInt32ForToNumber(
+        current_interpreter_frame_.accumulator(), hint);
   }
 
   if (ValueNode* result =
@@ -1174,19 +1749,13 @@ void MaglevGraphBuilder::BuildInt32BinarySmiOperationNode() {
   // Truncating Int32 nodes treat their input as a signed int32 regardless
   // of whether it's really signed or not, so we allow Uint32 by loading a
   // TruncatedInt32 value.
-  static const bool inputs_are_truncated =
-      BinaryOperationIsBitwiseInt32<kOperation>();
+  static_assert(!BinaryOperationIsBitwiseInt32<kOperation>());
   // TODO(v8:7700): Do constant folding.
-  ValueNode* left = inputs_are_truncated ? GetAccumulatorTruncatedInt32()
-                                         : GetAccumulatorInt32();
+  ValueNode* left = GetAccumulatorInt32();
   int32_t constant = iterator_.GetImmediateOperand(0);
   if (base::Optional<int>(constant) == Int32Identity<kOperation>()) {
     // If the constant is the unit of the operation, it already has the right
-    // value, so use the truncated value if necessary (and if not just a
-    // conversion) and return.
-    if (inputs_are_truncated && !left->properties().is_conversion()) {
-      current_interpreter_frame_.set_accumulator(left);
-    }
+    // value, so just return.
     return;
   }
   if (ValueNode* result =
@@ -1202,12 +1771,12 @@ void MaglevGraphBuilder::BuildInt32BinarySmiOperationNode() {
 }
 
 template <Operation kOperation>
-void MaglevGraphBuilder::BuildTruncatingInt32BinarySmiOperationNodeForNumber(
-    TaggedToFloat64ConversionType conversion_type) {
-  DCHECK(BinaryOperationIsBitwiseInt32<kOperation>());
+void MaglevGraphBuilder::BuildTruncatingInt32BinarySmiOperationNodeForToNumber(
+    ToNumberHint hint) {
+  static_assert(BinaryOperationIsBitwiseInt32<kOperation>());
   // TODO(v8:7700): Do constant folding.
-  ValueNode* left = GetTruncatedInt32FromNumber(
-      current_interpreter_frame_.accumulator(), conversion_type);
+  ValueNode* left = GetTruncatedInt32ForToNumber(
+      current_interpreter_frame_.accumulator(), hint);
   int32_t constant = iterator_.GetImmediateOperand(0);
   if (base::Optional<int>(constant) == Int32Identity<kOperation>()) {
     // If the constant is the unit of the operation, it already has the right
@@ -1227,20 +1796,22 @@ void MaglevGraphBuilder::BuildTruncatingInt32BinarySmiOperationNodeForNumber(
 }
 
 template <Operation kOperation>
-void MaglevGraphBuilder::BuildFloat64BinarySmiOperationNode(
-    TaggedToFloat64ConversionType conversion_type) {
-  // TODO(v8:7700): Do constant folding.
-  ValueNode* left = GetAccumulatorFloat64(conversion_type);
+void MaglevGraphBuilder::BuildFloat64BinarySmiOperationNodeForToNumber(
+    ToNumberHint hint) {
+  // TODO(v8:7700): Do constant folding. Make sure to normalize HoleyFloat64
+  // nodes if constant folded.
+  ValueNode* left = GetAccumulatorHoleyFloat64ForToNumber(hint);
   double constant = static_cast<double>(iterator_.GetImmediateOperand(0));
   ValueNode* right = GetFloat64Constant(constant);
   SetAccumulator(AddNewNode<Float64NodeFor<kOperation>>({left, right}));
 }
 
 template <Operation kOperation>
-void MaglevGraphBuilder::BuildFloat64UnaryOperationNode(
-    TaggedToFloat64ConversionType conversion_type) {
-  // TODO(v8:7700): Do constant folding.
-  ValueNode* value = GetAccumulatorFloat64(conversion_type);
+void MaglevGraphBuilder::BuildFloat64UnaryOperationNodeForToNumber(
+    ToNumberHint hint) {
+  // TODO(v8:7700): Do constant folding. Make sure to normalize HoleyFloat64
+  // nodes if constant folded.
+  ValueNode* value = GetAccumulatorHoleyFloat64ForToNumber(hint);
   switch (kOperation) {
     case Operation::kNegate:
       SetAccumulator(AddNewNode<Float64Negate>({value}));
@@ -1258,26 +1829,27 @@ void MaglevGraphBuilder::BuildFloat64UnaryOperationNode(
 }
 
 template <Operation kOperation>
-void MaglevGraphBuilder::BuildFloat64BinaryOperationNode(
-    TaggedToFloat64ConversionType conversion_type) {
-  // TODO(v8:7700): Do constant folding.
-  ValueNode* left = LoadRegisterFloat64(0, conversion_type);
-  ValueNode* right = GetAccumulatorFloat64(conversion_type);
+void MaglevGraphBuilder::BuildFloat64BinaryOperationNodeForToNumber(
+    ToNumberHint hint) {
+  // TODO(v8:7700): Do constant folding. Make sure to normalize HoleyFloat64
+  // nodes if constant folded.
+  ValueNode* left = LoadRegisterHoleyFloat64ForToNumber(0, hint);
+  ValueNode* right = GetAccumulatorHoleyFloat64ForToNumber(hint);
   SetAccumulator(AddNewNode<Float64NodeFor<kOperation>>({left, right}));
 }
 
 namespace {
-TaggedToFloat64ConversionType HintToTaggedToFloat64ConversionType(
-    BinaryOperationHint hint) {
+ToNumberHint BinopHintToToNumberHint(BinaryOperationHint hint) {
   switch (hint) {
+    case BinaryOperationHint::kSignedSmall:
+      return ToNumberHint::kAssumeSmi;
     case BinaryOperationHint::kSignedSmallInputs:
     case BinaryOperationHint::kNumber:
-      return TaggedToFloat64ConversionType::kNumber;
+      return ToNumberHint::kAssumeNumber;
     case BinaryOperationHint::kNumberOrOddball:
-      return TaggedToFloat64ConversionType::kNumberOrOddball;
+      return ToNumberHint::kAssumeNumberOrOddball;
 
     case BinaryOperationHint::kNone:
-    case BinaryOperationHint::kSignedSmall:
     case BinaryOperationHint::kString:
     case BinaryOperationHint::kBigInt:
     case BinaryOperationHint::kBigInt64:
@@ -1290,23 +1862,23 @@ TaggedToFloat64ConversionType HintToTaggedToFloat64ConversionType(
 template <Operation kOperation>
 void MaglevGraphBuilder::VisitUnaryOperation() {
   FeedbackNexus nexus = FeedbackNexusForOperand(0);
-  switch (nexus.GetBinaryOperationFeedback()) {
+  BinaryOperationHint feedback_hint = nexus.GetBinaryOperationFeedback();
+  switch (feedback_hint) {
     case BinaryOperationHint::kNone:
-      return EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForBinaryOperation);
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForBinaryOperation));
     case BinaryOperationHint::kSignedSmall:
-      return BuildInt32UnaryOperationNode<kOperation>();
     case BinaryOperationHint::kSignedSmallInputs:
     case BinaryOperationHint::kNumber:
     case BinaryOperationHint::kNumberOrOddball: {
-      TaggedToFloat64ConversionType conversion_type =
-          HintToTaggedToFloat64ConversionType(
-              nexus.GetBinaryOperationFeedback());
+      ToNumberHint hint = BinopHintToToNumberHint(feedback_hint);
       if constexpr (BinaryOperationIsBitwiseInt32<kOperation>()) {
         static_assert(kOperation == Operation::kBitwiseNot);
-        return BuildTruncatingInt32BitwiseNotForNumber(conversion_type);
+        return BuildTruncatingInt32BitwiseNotForToNumber(hint);
+      } else if (feedback_hint == BinaryOperationHint::kSignedSmall) {
+        return BuildInt32UnaryOperationNode<kOperation>();
       }
-      return BuildFloat64UnaryOperationNode<kOperation>(conversion_type);
+      return BuildFloat64UnaryOperationNodeForToNumber<kOperation>(hint);
       break;
     }
     case BinaryOperationHint::kString:
@@ -1322,32 +1894,41 @@ void MaglevGraphBuilder::VisitUnaryOperation() {
 template <Operation kOperation>
 void MaglevGraphBuilder::VisitBinaryOperation() {
   FeedbackNexus nexus = FeedbackNexusForOperand(1);
-  switch (nexus.GetBinaryOperationFeedback()) {
+  BinaryOperationHint feedback_hint = nexus.GetBinaryOperationFeedback();
+  switch (feedback_hint) {
     case BinaryOperationHint::kNone:
-      return EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForBinaryOperation);
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForBinaryOperation));
     case BinaryOperationHint::kSignedSmall:
-      if constexpr (kOperation == Operation::kExponentiate) {
-        // Exponentiate never updates the feedback to be a Smi.
-        UNREACHABLE();
-      } else {
-        return BuildInt32BinaryOperationNode<kOperation>();
-      }
     case BinaryOperationHint::kSignedSmallInputs:
     case BinaryOperationHint::kNumber:
     case BinaryOperationHint::kNumberOrOddball: {
-      TaggedToFloat64ConversionType conversion_type =
-          HintToTaggedToFloat64ConversionType(
-              nexus.GetBinaryOperationFeedback());
+      ToNumberHint hint = BinopHintToToNumberHint(feedback_hint);
       if constexpr (BinaryOperationIsBitwiseInt32<kOperation>()) {
-        return BuildTruncatingInt32BinaryOperationNodeForNumber<kOperation>(
-            conversion_type);
+        return BuildTruncatingInt32BinaryOperationNodeForToNumber<kOperation>(
+            hint);
+      } else if (feedback_hint == BinaryOperationHint::kSignedSmall) {
+        if constexpr (kOperation == Operation::kExponentiate) {
+          // Exponentiate never updates the feedback to be a Smi.
+          UNREACHABLE();
+        } else {
+          return BuildInt32BinaryOperationNode<kOperation>();
+        }
       } else {
-        return BuildFloat64BinaryOperationNode<kOperation>(conversion_type);
+        return BuildFloat64BinaryOperationNodeForToNumber<kOperation>(hint);
       }
       break;
     }
     case BinaryOperationHint::kString:
+      if constexpr (kOperation == Operation::kAdd) {
+        ValueNode* left = LoadRegisterTagged(0);
+        ValueNode* right = GetAccumulatorTagged();
+        BuildCheckString(left);
+        BuildCheckString(right);
+        SetAccumulator(AddNewNode<StringConcat>({left, right}));
+        return;
+      }
+      break;
     case BinaryOperationHint::kBigInt:
     case BinaryOperationHint::kBigInt64:
     case BinaryOperationHint::kAny:
@@ -1360,28 +1941,28 @@ void MaglevGraphBuilder::VisitBinaryOperation() {
 template <Operation kOperation>
 void MaglevGraphBuilder::VisitBinarySmiOperation() {
   FeedbackNexus nexus = FeedbackNexusForOperand(1);
-  switch (nexus.GetBinaryOperationFeedback()) {
+  BinaryOperationHint feedback_hint = nexus.GetBinaryOperationFeedback();
+  switch (feedback_hint) {
     case BinaryOperationHint::kNone:
-      return EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForBinaryOperation);
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForBinaryOperation));
     case BinaryOperationHint::kSignedSmall:
-      if constexpr (kOperation == Operation::kExponentiate) {
-        // Exponentiate never updates the feedback to be a Smi.
-        UNREACHABLE();
-      } else {
-        return BuildInt32BinarySmiOperationNode<kOperation>();
-      }
     case BinaryOperationHint::kSignedSmallInputs:
     case BinaryOperationHint::kNumber:
     case BinaryOperationHint::kNumberOrOddball: {
-      TaggedToFloat64ConversionType conversion_type =
-          HintToTaggedToFloat64ConversionType(
-              nexus.GetBinaryOperationFeedback());
+      ToNumberHint hint = BinopHintToToNumberHint(feedback_hint);
       if constexpr (BinaryOperationIsBitwiseInt32<kOperation>()) {
-        return BuildTruncatingInt32BinarySmiOperationNodeForNumber<kOperation>(
-            conversion_type);
+        return BuildTruncatingInt32BinarySmiOperationNodeForToNumber<
+            kOperation>(hint);
+      } else if (feedback_hint == BinaryOperationHint::kSignedSmall) {
+        if constexpr (kOperation == Operation::kExponentiate) {
+          // Exponentiate never updates the feedback to be a Smi.
+          UNREACHABLE();
+        } else {
+          return BuildInt32BinarySmiOperationNode<kOperation>();
+        }
       } else {
-        return BuildFloat64BinarySmiOperationNode<kOperation>(conversion_type);
+        return BuildFloat64BinarySmiOperationNodeForToNumber<kOperation>(hint);
       }
       break;
     }
@@ -1395,57 +1976,75 @@ void MaglevGraphBuilder::VisitBinarySmiOperation() {
   BuildGenericBinarySmiOperationNode<kOperation>();
 }
 
-template <typename BranchControlNodeT, typename... Args>
-bool MaglevGraphBuilder::TryBuildBranchFor(
-    std::initializer_list<ValueNode*> control_inputs, Args&&... args) {
-  // Don't emit the shortcut branch if the next bytecode is a merge target.
-  if (IsOffsetAMergePoint(next_offset())) return false;
-
-  interpreter::Bytecode next_bytecode = iterator_.next_bytecode();
-  int true_offset, false_offset;
-  int true_interrupt_correction, false_interrupt_correction;
-  switch (next_bytecode) {
-    case interpreter::Bytecode::kJumpIfFalse:
-    case interpreter::Bytecode::kJumpIfFalseConstant:
-    case interpreter::Bytecode::kJumpIfToBooleanFalse:
-    case interpreter::Bytecode::kJumpIfToBooleanFalseConstant:
-      // This jump must kill the accumulator, otherwise we need to
-      // materialize the actual boolean value.
-      if (GetOutLivenessFor(next_offset())->AccumulatorIsLive()) return false;
-      // Advance the iterator past the test to the jump, skipping
-      // emitting the test.
-      iterator_.Advance();
-      true_offset = next_offset();
-      true_interrupt_correction = 0;
-      false_offset = iterator_.GetJumpTargetOffset();
-      false_interrupt_correction = iterator_.GetRelativeJumpTargetOffset();
-      break;
-    case interpreter::Bytecode::kJumpIfTrue:
-    case interpreter::Bytecode::kJumpIfTrueConstant:
-    case interpreter::Bytecode::kJumpIfToBooleanTrue:
-    case interpreter::Bytecode::kJumpIfToBooleanTrueConstant:
-      // This jump must kill the accumulator, otherwise we need to
-      // materialize the actual boolean value.
-      if (GetOutLivenessFor(next_offset())->AccumulatorIsLive()) return false;
-      // Advance the iterator past the test to the jump, skipping
-      // emitting the test.
-      iterator_.Advance();
-      true_offset = iterator_.GetJumpTargetOffset();
-      true_interrupt_correction = iterator_.GetRelativeJumpTargetOffset();
-      false_offset = next_offset();
-      false_interrupt_correction = 0;
-      break;
-    default:
-      return false;
+template <Operation kOperation, typename type>
+bool OperationValue(type left, type right) {
+  switch (kOperation) {
+    case Operation::kEqual:
+    case Operation::kStrictEqual:
+      return left == right;
+    case Operation::kLessThan:
+      return left < right;
+    case Operation::kLessThanOrEqual:
+      return left <= right;
+    case Operation::kGreaterThan:
+      return left > right;
+    case Operation::kGreaterThanOrEqual:
+      return left >= right;
+  }
+}
+
+// static
+compiler::OptionalHeapObjectRef MaglevGraphBuilder::TryGetConstant(
+    compiler::JSHeapBroker* broker, LocalIsolate* isolate, ValueNode* node) {
+  if (Constant* c = node->TryCast<Constant>()) {
+    return c->object();
+  }
+  if (RootConstant* c = node->TryCast<RootConstant>()) {
+    return MakeRef(broker, isolate->root_handle(c->index())).AsHeapObject();
   }
+  return {};
+}
 
-  BasicBlock* block = FinishBlock<BranchControlNodeT>(
-      control_inputs, std::forward<Args>(args)..., &jump_targets_[true_offset],
-      true_interrupt_correction, &jump_targets_[false_offset],
-      false_interrupt_correction);
+compiler::OptionalHeapObjectRef MaglevGraphBuilder::TryGetConstant(
+    ValueNode* node, ValueNode** constant_node) {
+  if (auto result = TryGetConstant(broker(), local_isolate(), node)) {
+    if (constant_node) *constant_node = node;
+    return result;
+  }
+  const NodeInfo* info = known_node_aspects().TryGetInfoFor(node);
+  if (info) {
+    if (auto c = info->alternative().constant()) {
+      if (constant_node) *constant_node = c;
+      return TryGetConstant(c);
+    }
+  }
+  return {};
+}
 
-  MergeIntoFrameState(block, iterator_.GetJumpTargetOffset());
-  StartFallthroughBlock(next_offset(), block);
+template <Operation kOperation>
+bool MaglevGraphBuilder::TryReduceCompareEqualAgainstConstant() {
+  // First handle strict equal comparison with constant.
+  if (kOperation != Operation::kStrictEqual) return false;
+  ValueNode* left = LoadRegisterRaw(0);
+  ValueNode* right = GetRawAccumulator();
+
+  compiler::OptionalHeapObjectRef maybe_constant = TryGetConstant(left);
+  if (!maybe_constant) maybe_constant = TryGetConstant(right);
+  if (!maybe_constant) return false;
+  InstanceType type = maybe_constant.value().map(broker()).instance_type();
+
+  if (!InstanceTypeChecker::IsReferenceComparable(type)) return false;
+
+  if (left->properties().value_representation() !=
+          ValueRepresentation::kTagged ||
+      right->properties().value_representation() !=
+          ValueRepresentation::kTagged) {
+    SetAccumulator(GetBooleanConstant(false));
+  } else if (left == right) {
+    SetAccumulator(GetBooleanConstant(true));
+  } else {
+    SetAccumulator(AddNewNode<TaggedEqual>({left, right}));
+  }
   return true;
 }
 
@@ -1454,31 +2053,45 @@ void MaglevGraphBuilder::VisitCompareOperation() {
   FeedbackNexus nexus = FeedbackNexusForOperand(1);
   switch (nexus.GetCompareOperationFeedback()) {
     case CompareOperationHint::kNone:
-      EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForCompareOperation);
-      return;
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForCompareOperation));
+
     case CompareOperationHint::kSignedSmall: {
       ValueNode* left = LoadRegisterInt32(0);
       ValueNode* right = GetAccumulatorInt32();
-      if (TryBuildBranchFor<BranchIfInt32Compare>({left, right}, kOperation)) {
+      if (left == right) {
+        SetAccumulator(
+            GetBooleanConstant(kOperation == Operation::kEqual ||
+                               kOperation == Operation::kStrictEqual ||
+                               kOperation == Operation::kLessThanOrEqual ||
+                               kOperation == Operation::kGreaterThanOrEqual));
         return;
       }
-      SetAccumulator(AddNewNode<Int32NodeFor<kOperation>>({left, right}));
+      if (left->Is<Int32Constant>() && right->Is<Int32Constant>()) {
+        int left_value = left->Cast<Int32Constant>()->value();
+        int right_value = right->Cast<Int32Constant>()->value();
+        SetAccumulator(GetBooleanConstant(
+            OperationValue<kOperation>(left_value, right_value)));
+        return;
+      }
+      SetAccumulator(AddNewNode<Int32Compare>({left, right}, kOperation));
       return;
     }
     case CompareOperationHint::kNumber: {
       // TODO(leszeks): we could support kNumberOrOddball with
       // BranchIfFloat64Compare, but we'd need to special case comparing
       // oddballs with NaN value (e.g. undefined) against themselves.
-      ValueNode* left =
-          LoadRegisterFloat64(0, TaggedToFloat64ConversionType::kNumber);
-      ValueNode* right =
-          GetAccumulatorFloat64(TaggedToFloat64ConversionType::kNumber);
-      if (TryBuildBranchFor<BranchIfFloat64Compare>({left, right},
-                                                    kOperation)) {
+      ValueNode* left = LoadRegisterFloat64(0);
+      ValueNode* right = GetAccumulatorFloat64();
+      if (left->Is<Float64Constant>() && right->Is<Float64Constant>()) {
+        double left_value = left->Cast<Float64Constant>()->value().get_scalar();
+        double right_value =
+            right->Cast<Float64Constant>()->value().get_scalar();
+        SetAccumulator(GetBooleanConstant(
+            OperationValue<kOperation>(left_value, right_value)));
         return;
       }
-      SetAccumulator(AddNewNode<Float64NodeFor<kOperation>>({left, right}));
+      SetAccumulator(AddNewNode<Float64Compare>({left, right}, kOperation));
       return;
     }
     case CompareOperationHint::kInternalizedString: {
@@ -1487,15 +2100,14 @@ void MaglevGraphBuilder::VisitCompareOperation() {
       ValueNode *left, *right;
       if (IsRegisterEqualToAccumulator(0)) {
         left = right = GetInternalizedString(iterator_.GetRegisterOperand(0));
-        current_interpreter_frame_.set(
-            interpreter::Register::virtual_accumulator(), left);
-      } else {
-        left = GetInternalizedString(iterator_.GetRegisterOperand(0));
-        right =
-            GetInternalizedString(interpreter::Register::virtual_accumulator());
+        SetAccumulator(GetRootConstant(RootIndex::kTrueValue));
+        return;
       }
-      if (TryBuildBranchFor<BranchIfReferenceCompare>({left, right},
-                                                      kOperation)) {
+      left = GetInternalizedString(iterator_.GetRegisterOperand(0));
+      right =
+          GetInternalizedString(interpreter::Register::virtual_accumulator());
+      if (left == right) {
+        SetAccumulator(GetBooleanConstant(true));
         return;
       }
       SetAccumulator(AddNewNode<TaggedEqual>({left, right}));
@@ -1504,28 +2116,85 @@ void MaglevGraphBuilder::VisitCompareOperation() {
     case CompareOperationHint::kSymbol: {
       DCHECK(kOperation == Operation::kEqual ||
              kOperation == Operation::kStrictEqual);
+
       ValueNode* left = LoadRegisterTagged(0);
       ValueNode* right = GetAccumulatorTagged();
       BuildCheckSymbol(left);
       BuildCheckSymbol(right);
-      if (TryBuildBranchFor<BranchIfReferenceCompare>({left, right},
-                                                      kOperation)) {
+      if (left == right) {
+        SetAccumulator(GetBooleanConstant(true));
         return;
       }
       SetAccumulator(AddNewNode<TaggedEqual>({left, right}));
       return;
     }
-    case CompareOperationHint::kNumberOrOddball:
-    case CompareOperationHint::kNumberOrBoolean:
-    case CompareOperationHint::kString:
-    case CompareOperationHint::kBigInt:
+    case CompareOperationHint::kString: {
+      if (TryReduceCompareEqualAgainstConstant<kOperation>()) return;
+
+      ValueNode* left = LoadRegisterTagged(0);
+      ValueNode* right = GetAccumulatorTagged();
+      BuildCheckString(left);
+      BuildCheckString(right);
+
+      ValueNode* result;
+      if (left == right) {
+        SetAccumulator(
+            GetBooleanConstant(kOperation == Operation::kEqual ||
+                               kOperation == Operation::kStrictEqual ||
+                               kOperation == Operation::kLessThanOrEqual ||
+                               kOperation == Operation::kGreaterThanOrEqual));
+        return;
+      }
+      switch (kOperation) {
+        case Operation::kEqual:
+        case Operation::kStrictEqual:
+          result = AddNewNode<StringEqual>({left, right});
+          break;
+        case Operation::kLessThan:
+          result = BuildCallBuiltin<Builtin::kStringLessThan>({left, right});
+          break;
+        case Operation::kLessThanOrEqual:
+          result =
+              BuildCallBuiltin<Builtin::kStringLessThanOrEqual>({left, right});
+          break;
+        case Operation::kGreaterThan:
+          result = BuildCallBuiltin<Builtin::kStringGreaterThan>({left, right});
+          break;
+        case Operation::kGreaterThanOrEqual:
+          result = BuildCallBuiltin<Builtin::kStringGreaterThanOrEqual>(
+              {left, right});
+          break;
+      }
+
+      SetAccumulator(result);
+      return;
+    }
+    case CompareOperationHint::kAny:
     case CompareOperationHint::kBigInt64:
-    case CompareOperationHint::kReceiver:
+    case CompareOperationHint::kBigInt:
+    case CompareOperationHint::kNumberOrBoolean:
+    case CompareOperationHint::kNumberOrOddball:
     case CompareOperationHint::kReceiverOrNullOrUndefined:
-    case CompareOperationHint::kAny:
-      // Fallback to generic node.
+      if (TryReduceCompareEqualAgainstConstant<kOperation>()) return;
       break;
+    case CompareOperationHint::kReceiver: {
+      if (TryReduceCompareEqualAgainstConstant<kOperation>()) return;
+      DCHECK(kOperation == Operation::kEqual ||
+             kOperation == Operation::kStrictEqual);
+
+      ValueNode* left = LoadRegisterTagged(0);
+      ValueNode* right = GetAccumulatorTagged();
+      BuildCheckJSReceiver(left);
+      BuildCheckJSReceiver(right);
+      if (left == right) {
+        SetAccumulator(GetBooleanConstant(true));
+        return;
+      }
+      SetAccumulator(AddNewNode<TaggedEqual>({left, right}));
+      return;
+    }
   }
+
   BuildGenericBinaryOperationNode<kOperation>();
 }
 
@@ -1596,7 +2265,7 @@ bool MaglevGraphBuilder::TrySpecializeLoadContextSlotToFunctionContext(
     compiler::OddballType oddball_type =
         slot_value.AsHeapObject().map(broker()).oddball_type(broker());
     if (oddball_type == compiler::OddballType::kUndefined ||
-        oddball_type == compiler::OddballType::kHole) {
+        slot_value.IsTheHole()) {
       *depth = new_depth;
       *context = GetConstant(context_ref);
       return false;
@@ -1762,16 +2431,28 @@ void MaglevGraphBuilder::VisitTestReferenceEqual() {
     SetAccumulator(GetRootConstant(RootIndex::kTrueValue));
     return;
   }
-  if (TryBuildBranchFor<BranchIfReferenceCompare>({lhs, rhs},
-                                                  Operation::kStrictEqual)) {
-    return;
-  }
   SetAccumulator(AddNewNode<TaggedEqual>({lhs, rhs}));
 }
 
 void MaglevGraphBuilder::VisitTestUndetectable() {
   ValueNode* value = GetAccumulatorTagged();
-  SetAccumulator(AddNewNode<TestUndetectable>({value}));
+  if (compiler::OptionalHeapObjectRef maybe_constant = TryGetConstant(value)) {
+    if (maybe_constant.value().map(broker()).is_undetectable()) {
+      SetAccumulator(GetRootConstant(RootIndex::kTrueValue));
+    } else {
+      SetAccumulator(GetRootConstant(RootIndex::kFalseValue));
+    }
+    return;
+  }
+
+  NodeType old_type;
+  if (CheckType(value, NodeType::kSmi, &old_type)) {
+    SetAccumulator(GetRootConstant(RootIndex::kFalseValue));
+    return;
+  }
+
+  enum CheckType type = GetCheckType(old_type);
+  SetAccumulator(AddNewNode<TestUndetectable>({value}, type));
 }
 
 void MaglevGraphBuilder::VisitTestNull() {
@@ -1805,56 +2486,142 @@ void MaglevGraphBuilder::VisitTestTypeOf() {
     return;
   }
   ValueNode* value = GetAccumulatorTagged();
-  if (TryBuildBranchFor<BranchIfTypeOf>({value}, literal)) {
-    return;
-  }
   SetAccumulator(AddNewNode<TestTypeOf>({value}, literal));
 }
 
-bool MaglevGraphBuilder::TryBuildScriptContextConstantAccess(
+ReduceResult MaglevGraphBuilder::TryBuildScriptContextStore(
+    const compiler::GlobalAccessFeedback& global_access_feedback) {
+  DCHECK(global_access_feedback.IsScriptContextSlot());
+  if (global_access_feedback.immutable()) {
+    return ReduceResult::Fail();
+  }
+  auto script_context = GetConstant(global_access_feedback.script_context());
+  int offset = Context::OffsetOfElementAt(global_access_feedback.slot_index());
+  StoreAndCacheContextSlot(script_context, offset, GetRawAccumulator());
+  return ReduceResult::Done();
+}
+
+ReduceResult MaglevGraphBuilder::TryBuildPropertyCellStore(
     const compiler::GlobalAccessFeedback& global_access_feedback) {
-  if (!global_access_feedback.immutable()) return false;
+  DCHECK(global_access_feedback.IsPropertyCell());
+
+  compiler::PropertyCellRef property_cell =
+      global_access_feedback.property_cell();
+  if (!property_cell.Cache(broker())) return ReduceResult::Fail();
+
+  compiler::ObjectRef property_cell_value = property_cell.value(broker());
+  if (property_cell_value.IsPropertyCellHole()) {
+    // The property cell is no longer valid.
+    return EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess);
+  }
+
+  PropertyDetails property_details = property_cell.property_details();
+  DCHECK_EQ(PropertyKind::kData, property_details.kind());
+
+  if (property_details.IsReadOnly()) {
+    // Don't even bother trying to lower stores to read-only data
+    // properties.
+    // TODO(neis): We could generate code that checks if the new value
+    // equals the old one and then does nothing or deopts, respectively.
+    return ReduceResult::Fail();
+  }
+
+  switch (property_details.cell_type()) {
+    case PropertyCellType::kUndefined:
+      return ReduceResult::Fail();
+    case PropertyCellType::kConstant: {
+      // TODO(victorgomes): Support non-internalized string.
+      if (property_cell_value.IsString() &&
+          !property_cell_value.IsInternalizedString()) {
+        return ReduceResult::Fail();
+      }
+      // Record a code dependency on the cell, and just deoptimize if the new
+      // value doesn't match the previous value stored inside the cell.
+      broker()->dependencies()->DependOnGlobalProperty(property_cell);
+      ValueNode* value = GetAccumulatorTagged();
+      return BuildCheckValue(value, property_cell_value);
+    }
+    case PropertyCellType::kConstantType: {
+      // We rely on stability further below.
+      if (property_cell_value.IsHeapObject() &&
+          !property_cell_value.AsHeapObject().map(broker()).is_stable()) {
+        return ReduceResult::Fail();
+      }
+      // Record a code dependency on the cell, and just deoptimize if the new
+      // value's type doesn't match the type of the previous value in the cell.
+      broker()->dependencies()->DependOnGlobalProperty(property_cell);
+      ValueNode* value;
+      if (property_cell_value.IsHeapObject()) {
+        value = GetAccumulatorTagged();
+        compiler::MapRef property_cell_value_map =
+            property_cell_value.AsHeapObject().map(broker());
+        broker()->dependencies()->DependOnStableMap(property_cell_value_map);
+        BuildCheckHeapObject(value);
+        RETURN_IF_ABORT(
+            BuildCheckMaps(value, base::VectorOf({property_cell_value_map})));
+      } else {
+        value = GetAccumulatorSmi();
+      }
+      ValueNode* property_cell_node = GetConstant(property_cell.AsHeapObject());
+      BuildStoreTaggedField(property_cell_node, value,
+                            PropertyCell::kValueOffset);
+      break;
+    }
+    case PropertyCellType::kMutable: {
+      // Record a code dependency on the cell, and just deoptimize if the
+      // property ever becomes read-only.
+      broker()->dependencies()->DependOnGlobalProperty(property_cell);
+      ValueNode* property_cell_node = GetConstant(property_cell.AsHeapObject());
+      ValueNode* value = GetAccumulatorTagged();
+      BuildStoreTaggedField(property_cell_node, value,
+                            PropertyCell::kValueOffset);
+      break;
+    }
+    case PropertyCellType::kInTransition:
+      UNREACHABLE();
+  }
+  return ReduceResult::Done();
+}
 
+ReduceResult MaglevGraphBuilder::TryBuildScriptContextConstantLoad(
+    const compiler::GlobalAccessFeedback& global_access_feedback) {
+  DCHECK(global_access_feedback.IsScriptContextSlot());
+  if (!global_access_feedback.immutable()) return ReduceResult::Fail();
   compiler::OptionalObjectRef maybe_slot_value =
       global_access_feedback.script_context().get(
           broker(), global_access_feedback.slot_index());
-  if (!maybe_slot_value) return false;
-
-  SetAccumulator(GetConstant(maybe_slot_value.value()));
-  return true;
+  if (!maybe_slot_value) return ReduceResult::Fail();
+  return GetConstant(maybe_slot_value.value());
 }
 
-bool MaglevGraphBuilder::TryBuildScriptContextAccess(
+ReduceResult MaglevGraphBuilder::TryBuildScriptContextLoad(
     const compiler::GlobalAccessFeedback& global_access_feedback) {
-  if (!global_access_feedback.IsScriptContextSlot()) return false;
-  if (TryBuildScriptContextConstantAccess(global_access_feedback)) return true;
-
+  DCHECK(global_access_feedback.IsScriptContextSlot());
+  RETURN_IF_DONE(TryBuildScriptContextConstantLoad(global_access_feedback));
   auto script_context = GetConstant(global_access_feedback.script_context());
-  current_interpreter_frame_.set_accumulator(LoadAndCacheContextSlot(
-      script_context,
-      Context::OffsetOfElementAt(global_access_feedback.slot_index()),
-      global_access_feedback.immutable() ? kImmutable : kMutable));
-  return true;
+  int offset = Context::OffsetOfElementAt(global_access_feedback.slot_index());
+  return LoadAndCacheContextSlot(
+      script_context, offset,
+      global_access_feedback.immutable() ? kImmutable : kMutable);
 }
 
-bool MaglevGraphBuilder::TryBuildPropertyCellAccess(
+ReduceResult MaglevGraphBuilder::TryBuildPropertyCellLoad(
     const compiler::GlobalAccessFeedback& global_access_feedback) {
   // TODO(leszeks): A bunch of this is copied from
   // js-native-context-specialization.cc -- I wonder if we can unify it
   // somehow.
+  DCHECK(global_access_feedback.IsPropertyCell());
 
-  if (!global_access_feedback.IsPropertyCell()) return false;
   compiler::PropertyCellRef property_cell =
       global_access_feedback.property_cell();
-
-  if (!property_cell.Cache(broker())) return false;
+  if (!property_cell.Cache(broker())) return ReduceResult::Fail();
 
   compiler::ObjectRef property_cell_value = property_cell.value(broker());
-  if (property_cell_value.IsTheHole(broker())) {
+  if (property_cell_value.IsPropertyCellHole()) {
     // The property cell is no longer valid.
-    EmitUnconditionalDeopt(
+    return EmitUnconditionalDeopt(
         DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess);
-    return true;
   }
 
   PropertyDetails property_details = property_cell.property_details();
@@ -1862,8 +2629,7 @@ bool MaglevGraphBuilder::TryBuildPropertyCellAccess(
   DCHECK_EQ(PropertyKind::kData, property_details.kind());
 
   if (!property_details.IsConfigurable() && property_details.IsReadOnly()) {
-    SetAccumulator(GetConstant(property_cell_value));
-    return true;
+    return GetConstant(property_cell_value);
   }
 
   // Record a code dependency on the cell if we can benefit from the
@@ -1877,14 +2643,36 @@ bool MaglevGraphBuilder::TryBuildPropertyCellAccess(
   // Load from constant/undefined global property can be constant-folded.
   if (property_cell_type == PropertyCellType::kConstant ||
       property_cell_type == PropertyCellType::kUndefined) {
-    SetAccumulator(GetConstant(property_cell_value));
-    return true;
+    return GetConstant(property_cell_value);
   }
 
   ValueNode* property_cell_node = GetConstant(property_cell.AsHeapObject());
-  SetAccumulator(AddNewNode<LoadTaggedField>({property_cell_node},
-                                             PropertyCell::kValueOffset));
-  return true;
+  return AddNewNode<LoadTaggedField>({property_cell_node},
+                                     PropertyCell::kValueOffset);
+}
+
+ReduceResult MaglevGraphBuilder::TryBuildGlobalStore(
+    const compiler::GlobalAccessFeedback& global_access_feedback) {
+  if (global_access_feedback.IsScriptContextSlot()) {
+    return TryBuildScriptContextStore(global_access_feedback);
+  } else if (global_access_feedback.IsPropertyCell()) {
+    return TryBuildPropertyCellStore(global_access_feedback);
+  } else {
+    DCHECK(global_access_feedback.IsMegamorphic());
+    return ReduceResult::Fail();
+  }
+}
+
+ReduceResult MaglevGraphBuilder::TryBuildGlobalLoad(
+    const compiler::GlobalAccessFeedback& global_access_feedback) {
+  if (global_access_feedback.IsScriptContextSlot()) {
+    return TryBuildScriptContextLoad(global_access_feedback);
+  } else if (global_access_feedback.IsPropertyCell()) {
+    return TryBuildPropertyCellLoad(global_access_feedback);
+  } else {
+    DCHECK(global_access_feedback.IsMegamorphic());
+    return ReduceResult::Fail();
+  }
 }
 
 void MaglevGraphBuilder::VisitLdaGlobal() {
@@ -1913,13 +2701,23 @@ void MaglevGraphBuilder::VisitLdaGlobalInsideTypeof() {
 
 void MaglevGraphBuilder::VisitStaGlobal() {
   // StaGlobal <name_index> <slot>
-  ValueNode* value = GetAccumulatorTagged();
-  compiler::NameRef name = GetRefOperand<Name>(0);
   FeedbackSlot slot = GetSlotOperand(1);
   compiler::FeedbackSource feedback_source{feedback(), slot};
 
-  // TODO(v8:7700): Add fast path.
+  const compiler::ProcessedFeedback& access_feedback =
+      broker()->GetFeedbackForGlobalAccess(feedback_source);
+
+  if (access_feedback.IsInsufficient()) {
+    RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForGenericGlobalAccess));
+  }
+
+  const compiler::GlobalAccessFeedback& global_access_feedback =
+      access_feedback.AsGlobalAccess();
+  RETURN_VOID_IF_DONE(TryBuildGlobalStore(global_access_feedback));
 
+  ValueNode* value = GetAccumulatorTagged();
+  compiler::NameRef name = GetRefOperand<Name>(0);
   ValueNode* context = GetContext();
   AddNewNode<StoreGlobal>({context, value}, name, feedback_source);
 }
@@ -1933,8 +2731,9 @@ void MaglevGraphBuilder::VisitLdaLookupSlot() {
 void MaglevGraphBuilder::VisitLdaLookupContextSlot() {
   // LdaLookupContextSlot <name_index> <feedback_slot> <depth>
   ValueNode* name = GetConstant(GetRefOperand<Name>(0));
-  ValueNode* slot = GetSmiConstant(iterator_.GetIndexOperand(1));
-  ValueNode* depth = GetSmiConstant(iterator_.GetUnsignedImmediateOperand(2));
+  ValueNode* slot = GetTaggedIndexConstant(iterator_.GetIndexOperand(1));
+  ValueNode* depth =
+      GetTaggedIndexConstant(iterator_.GetUnsignedImmediateOperand(2));
   SetAccumulator(
       BuildCallBuiltin<Builtin::kLookupContextTrampoline>({name, depth, slot}));
 }
@@ -1942,8 +2741,9 @@ void MaglevGraphBuilder::VisitLdaLookupContextSlot() {
 void MaglevGraphBuilder::VisitLdaLookupGlobalSlot() {
   // LdaLookupGlobalSlot <name_index> <feedback_slot> <depth>
   ValueNode* name = GetConstant(GetRefOperand<Name>(0));
-  ValueNode* slot = GetSmiConstant(iterator_.GetIndexOperand(1));
-  ValueNode* depth = GetSmiConstant(iterator_.GetUnsignedImmediateOperand(2));
+  ValueNode* slot = GetTaggedIndexConstant(iterator_.GetIndexOperand(1));
+  ValueNode* depth =
+      GetTaggedIndexConstant(iterator_.GetUnsignedImmediateOperand(2));
   ValueNode* result;
   if (parent_) {
     ValueNode* vector = GetConstant(feedback());
@@ -1966,8 +2766,9 @@ void MaglevGraphBuilder::VisitLdaLookupSlotInsideTypeof() {
 void MaglevGraphBuilder::VisitLdaLookupContextSlotInsideTypeof() {
   // LdaLookupContextSlotInsideTypeof <name_index> <context_slot> <depth>
   ValueNode* name = GetConstant(GetRefOperand<Name>(0));
-  ValueNode* slot = GetSmiConstant(iterator_.GetIndexOperand(1));
-  ValueNode* depth = GetSmiConstant(iterator_.GetUnsignedImmediateOperand(2));
+  ValueNode* slot = GetTaggedIndexConstant(iterator_.GetIndexOperand(1));
+  ValueNode* depth =
+      GetTaggedIndexConstant(iterator_.GetUnsignedImmediateOperand(2));
   SetAccumulator(
       BuildCallBuiltin<Builtin::kLookupContextInsideTypeofTrampoline>(
           {name, depth, slot}));
@@ -1976,8 +2777,9 @@ void MaglevGraphBuilder::VisitLdaLookupContextSlotInsideTypeof() {
 void MaglevGraphBuilder::VisitLdaLookupGlobalSlotInsideTypeof() {
   // LdaLookupGlobalSlotInsideTypeof <name_index> <context_slot> <depth>
   ValueNode* name = GetConstant(GetRefOperand<Name>(0));
-  ValueNode* slot = GetSmiConstant(iterator_.GetIndexOperand(1));
-  ValueNode* depth = GetSmiConstant(iterator_.GetUnsignedImmediateOperand(2));
+  ValueNode* slot = GetTaggedIndexConstant(iterator_.GetIndexOperand(1));
+  ValueNode* depth =
+      GetTaggedIndexConstant(iterator_.GetUnsignedImmediateOperand(2));
   ValueNode* result;
   if (parent_) {
     ValueNode* vector = GetConstant(feedback());
@@ -2014,28 +2816,56 @@ void MaglevGraphBuilder::VisitStaLookupSlot() {
   SetAccumulator(BuildCallRuntime(StaLookupSlotFunction(flags), {name, value}));
 }
 
-namespace {
-NodeType StaticTypeForNode(ValueNode* node) {
-  if (!node->is_tagged()) {
-    return NodeType::kNumber;
+NodeType StaticTypeForNode(compiler::JSHeapBroker* broker,
+                           LocalIsolate* isolate, ValueNode* node) {
+  switch (node->properties().value_representation()) {
+    case ValueRepresentation::kInt32:
+    case ValueRepresentation::kUint32:
+    case ValueRepresentation::kFloat64:
+      return NodeType::kNumber;
+    case ValueRepresentation::kHoleyFloat64:
+      return NodeType::kNumberOrOddball;
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
+    case ValueRepresentation::kTagged:
+      break;
   }
   switch (node->opcode()) {
+    case Opcode::kPhi:
+      return node->Cast<Phi>()->type();
     case Opcode::kCheckedSmiTagInt32:
     case Opcode::kCheckedSmiTagUint32:
+    case Opcode::kCheckedSmiTagFloat64:
+    case Opcode::kUnsafeSmiTag:
     case Opcode::kSmiConstant:
       return NodeType::kSmi;
-    case Opcode::kConstant: {
-      compiler::HeapObjectRef ref = node->Cast<Constant>()->object();
-      if (ref.IsString()) {
-        return NodeType::kString;
-      } else if (ref.IsSymbol()) {
-        return NodeType::kSymbol;
-      } else if (ref.IsHeapNumber()) {
-        return NodeType::kHeapNumber;
-      } else if (ref.IsJSReceiver()) {
-        return NodeType::kJSReceiverWithKnownMap;
+    case Opcode::kInt32ToNumber:
+    case Opcode::kUint32ToNumber:
+    case Opcode::kFloat64ToTagged:
+      return NodeType::kNumber;
+    case Opcode::kHoleyFloat64ToTagged:
+      return NodeType::kNumberOrOddball;
+    case Opcode::kAllocateRaw:
+    case Opcode::kFoldedAllocation:
+      return NodeType::kAnyHeapObject;
+    case Opcode::kRootConstant: {
+      RootConstant* constant = node->Cast<RootConstant>();
+      switch (constant->index()) {
+        case RootIndex::kTrueValue:
+        case RootIndex::kFalseValue:
+          return NodeType::kBoolean;
+        case RootIndex::kUndefinedValue:
+        case RootIndex::kNullValue:
+          return NodeType::kOddball;
+        default:
+          break;
       }
-      return NodeType::kHeapObjectWithKnownMap;
+      V8_FALLTHROUGH;
+    }
+    case Opcode::kConstant: {
+      compiler::HeapObjectRef ref =
+          MaglevGraphBuilder::TryGetConstant(broker, isolate, node).value();
+      return StaticTypeForConstant(broker, ref);
     }
     case Opcode::kLoadPolymorphicTaggedField: {
       Representation field_representation =
@@ -2057,6 +2887,8 @@ NodeType StaticTypeForNode(ValueNode* node) {
       // TODO(verwaest): Check what we need here.
       return NodeType::kUnknown;
     case Opcode::kToString:
+    case Opcode::kNumberToString:
+    case Opcode::kStringConcat:
       return NodeType::kString;
     case Opcode::kCheckedInternalizedString:
       return NodeType::kInternalizedString;
@@ -2064,31 +2896,76 @@ NodeType StaticTypeForNode(ValueNode* node) {
       return NodeType::kJSReceiver;
     case Opcode::kToName:
       return NodeType::kName;
+    case Opcode::kFastCreateClosure:
+    case Opcode::kCreateClosure:
+      return NodeType::kCallable;
+    case Opcode::kInt32Compare:
+    case Opcode::kFloat64Compare:
+    case Opcode::kGenericEqual:
+    case Opcode::kGenericStrictEqual:
+    case Opcode::kGenericLessThan:
+    case Opcode::kGenericLessThanOrEqual:
+    case Opcode::kGenericGreaterThan:
+    case Opcode::kGenericGreaterThanOrEqual:
+    case Opcode::kLogicalNot:
+    case Opcode::kStringEqual:
+    case Opcode::kTaggedEqual:
+    case Opcode::kTaggedNotEqual:
+    case Opcode::kTestInstanceOf:
+    case Opcode::kTestTypeOf:
+    case Opcode::kTestUndetectable:
+    case Opcode::kToBoolean:
+    case Opcode::kToBooleanLogicalNot:
+      return NodeType::kBoolean;
     default:
       return NodeType::kUnknown;
   }
 }
-}  // namespace
+
+bool MaglevGraphBuilder::CheckStaticType(ValueNode* node, NodeType type,
+                                         NodeType* old_type) {
+  NodeType static_type = StaticTypeForNode(broker(), local_isolate(), node);
+  if (old_type) *old_type = static_type;
+  return NodeTypeIs(static_type, type);
+}
 
 bool MaglevGraphBuilder::EnsureType(ValueNode* node, NodeType type,
                                     NodeType* old_type) {
-  NodeType static_type = StaticTypeForNode(node);
-  if (NodeTypeIs(static_type, type)) {
-    if (old_type) *old_type = static_type;
-    return true;
-  }
+  if (CheckStaticType(node, type, old_type)) return true;
   NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(node);
-  if (old_type) *old_type = known_info->type;
-  if (NodeTypeIs(known_info->type, type)) return true;
-  known_info->type = CombineType(known_info->type, type);
+  if (old_type) *old_type = known_info->type();
+  if (NodeTypeIs(known_info->type(), type)) return true;
+  known_info->CombineType(type);
   return false;
 }
 
-bool MaglevGraphBuilder::CheckType(ValueNode* node, NodeType type) {
-  if (NodeTypeIs(StaticTypeForNode(node), type)) return true;
+template <typename Function>
+bool MaglevGraphBuilder::EnsureType(ValueNode* node, NodeType type,
+                                    Function ensure_new_type) {
+  if (CheckStaticType(node, type)) return true;
+  NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(node);
+  if (NodeTypeIs(known_info->type(), type)) return true;
+  ensure_new_type(known_info->type());
+  known_info->CombineType(type);
+  return false;
+}
+
+void MaglevGraphBuilder::SetKnownValue(ValueNode* node,
+                                       compiler::ObjectRef ref) {
+  DCHECK(!node->Is<Constant>());
+  DCHECK(!node->Is<RootConstant>());
+  NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(node);
+  known_info->CombineType(StaticTypeForConstant(broker(), ref));
+  known_info->alternative().set_constant(GetConstant(ref));
+}
+
+bool MaglevGraphBuilder::CheckType(ValueNode* node, NodeType type,
+                                   NodeType* old_type) {
+  if (CheckStaticType(node, type, old_type)) return true;
   auto it = known_node_aspects().FindInfo(node);
   if (!known_node_aspects().IsValid(it)) return false;
-  return NodeTypeIs(it->second.type, type);
+  if (old_type) *old_type = it->second.type();
+  return NodeTypeIs(it->second.type(), type);
 }
 
 ValueNode* MaglevGraphBuilder::BuildSmiUntag(ValueNode* node) {
@@ -2099,6 +2976,18 @@ ValueNode* MaglevGraphBuilder::BuildSmiUntag(ValueNode* node) {
   }
 }
 
+namespace {
+NodeType TaggedToFloat64ConversionTypeToNodeType(
+    TaggedToFloat64ConversionType conversion_type) {
+  switch (conversion_type) {
+    case TaggedToFloat64ConversionType::kOnlyNumber:
+      return NodeType::kNumber;
+    case TaggedToFloat64ConversionType::kNumberOrOddball:
+      return NodeType::kNumberOrOddball;
+  }
+}
+}  // namespace
+
 ValueNode* MaglevGraphBuilder::BuildNumberOrOddballToFloat64(
     ValueNode* node, TaggedToFloat64ConversionType conversion_type) {
   NodeType old_type;
@@ -2115,8 +3004,9 @@ ValueNode* MaglevGraphBuilder::BuildNumberOrOddballToFloat64(
   }
 }
 
-void MaglevGraphBuilder::BuildCheckSmi(ValueNode* object) {
-  if (EnsureType(object, NodeType::kSmi)) return;
+void MaglevGraphBuilder::BuildCheckSmi(ValueNode* object, bool elidable) {
+  if (CheckStaticType(object, NodeType::kSmi)) return;
+  if (EnsureType(object, NodeType::kSmi) && elidable) return;
   AddNewNode<CheckSmi>({object});
 }
 
@@ -2125,14 +3015,6 @@ void MaglevGraphBuilder::BuildCheckHeapObject(ValueNode* object) {
   AddNewNode<CheckHeapObject>({object});
 }
 
-namespace {
-CheckType GetCheckType(NodeType type) {
-  return NodeTypeIs(type, NodeType::kAnyHeapObject)
-             ? CheckType::kOmitHeapObjectCheck
-             : CheckType::kCheckHeapObject;
-}
-}  // namespace
-
 void MaglevGraphBuilder::BuildCheckString(ValueNode* object) {
   NodeType known_type;
   if (EnsureType(object, NodeType::kString, &known_type)) return;
@@ -2150,145 +3032,152 @@ void MaglevGraphBuilder::BuildCheckSymbol(ValueNode* object) {
   AddNewNode<CheckSymbol>({object}, GetCheckType(known_type));
 }
 
+void MaglevGraphBuilder::BuildCheckJSReceiver(ValueNode* object) {
+  NodeType known_type;
+  if (EnsureType(object, NodeType::kJSReceiver, &known_type)) return;
+  AddNewNode<CheckInstanceType>({object}, GetCheckType(known_type),
+                                FIRST_JS_RECEIVER_TYPE, LAST_JS_RECEIVER_TYPE);
+}
+
 namespace {
 
 class KnownMapsMerger {
  public:
   explicit KnownMapsMerger(compiler::JSHeapBroker* broker,
-                           base::Vector<const compiler::MapRef> maps)
-      : broker_(broker),
-        maps_(maps),
-        known_maps_are_subset_of_maps_(true),
-        emit_check_with_migration_(false) {}
+                           base::Vector<const compiler::MapRef> requested_maps)
+      : broker_(broker), requested_maps_(requested_maps) {}
 
   void IntersectWithKnownNodeAspects(
       ValueNode* object, const KnownNodeAspects& known_node_aspects) {
-    // A non-value value here means the universal set, i.e., we don't know
-    // anything about the possible maps of the object.
-    base::Optional<ZoneHandleSet<Map>> known_stable_map_set =
-        GetKnownMapSet(object, known_node_aspects.stable_maps);
-    base::Optional<ZoneHandleSet<Map>> known_unstable_map_set =
-        GetKnownMapSet(object, known_node_aspects.unstable_maps);
-
-    IntersectKnownMaps(known_stable_map_set, true);
-    IntersectKnownMaps(known_unstable_map_set, false);
+    auto node_info_it = known_node_aspects.FindInfo(object);
+    bool has_node_info = known_node_aspects.IsValid(node_info_it);
+    NodeType type =
+        has_node_info ? node_info_it->second.type() : NodeType::kUnknown;
+    if (has_node_info && node_info_it->second.possible_maps_are_known()) {
+      // TODO(v8:7700): Make intersection non-quadratic.
+      for (compiler::MapRef possible_map :
+           node_info_it->second.possible_maps()) {
+        if (std::find(requested_maps_.begin(), requested_maps_.end(),
+                      possible_map) != requested_maps_.end()) {
+          // No need to add dependencies, we already have them for all known
+          // possible maps.
+          // Filter maps which are impossible given this objects type. Since we
+          // want to prove that an object with map `map` is not an instance of
+          // `type`, we cannot use `StaticTypeForMap`, as it only provides an
+          // approximation. This filtering is done to avoid creating
+          // non-sensical types later (e.g. if we think only a non-string map
+          // is possible, after a string check).
+          if (IsInstanceOfNodeType(possible_map, type, broker_)) {
+            InsertMap(possible_map);
+          }
+        } else {
+          known_maps_are_subset_of_requested_maps_ = false;
+        }
+      }
+      if (intersect_set_.is_empty()) {
+        node_type_ = NodeType::kUnknown;
+      }
+    } else {
+      // A missing entry here means the universal set, i.e., we don't know
+      // anything about the possible maps of the object. Intersect with the
+      // universal set, which means just insert all requested maps.
+      known_maps_are_subset_of_requested_maps_ = false;
+      existing_known_maps_found_ = false;
+      for (compiler::MapRef map : requested_maps_) {
+        InsertMap(map);
+      }
+    }
   }
 
   void UpdateKnownNodeAspects(ValueNode* object,
                               KnownNodeAspects& known_node_aspects) {
     // Update known maps.
-    known_node_aspects.stable_maps[object] = stable_map_set_;
-    known_node_aspects.unstable_maps[object] = unstable_map_set_;
+    auto node_info = known_node_aspects.GetOrCreateInfoFor(object);
+    node_info->SetPossibleMaps(intersect_set_, any_map_is_unstable_,
+                               node_type_);
+    // Make sure known_node_aspects.any_map_for_any_node_is_unstable is updated
+    // in case any_map_is_unstable changed to true for this object -- this can
+    // happen if this was an intersection with the universal set which added new
+    // possible unstable maps.
+    if (any_map_is_unstable_) {
+      known_node_aspects.any_map_for_any_node_is_unstable = true;
+    }
+    // At this point, known_node_aspects.any_map_for_any_node_is_unstable may be
+    // true despite there no longer being any unstable maps for any nodes (if
+    // this was the only node with unstable maps and this intersection removed
+    // those). This is ok, because that's at worst just an overestimate -- we
+    // could track whether this node's any_map_is_unstable flipped from true to
+    // false, but this is likely overkill.
+    // Insert stable map dependencies which weren't inserted yet. This is only
+    // needed if our set of known maps was empty and we created it anew based on
+    // maps we checked.
+    if (!existing_known_maps_found_) {
+      for (compiler::MapRef map : intersect_set_) {
+        if (map.is_stable()) {
+          broker_->dependencies()->DependOnStableMap(map);
+        }
+      }
+    } else {
+      // TODO(victorgomes): Add a DCHECK_SLOW that checks if the maps already
+      // exist in the CompilationDependencySet.
+    }
   }
 
-  bool known_maps_are_subset_of_maps() const {
-    return known_maps_are_subset_of_maps_;
+  bool known_maps_are_subset_of_requested_maps() const {
+    return known_maps_are_subset_of_requested_maps_;
   }
   bool emit_check_with_migration() const { return emit_check_with_migration_; }
 
-  ZoneHandleSet<Map> intersect_set() const {
-    ZoneHandleSet<Map> map_set;
-    map_set.Union(stable_map_set_, zone());
-    map_set.Union(unstable_map_set_, zone());
-    return map_set;
+  const compiler::ZoneRefSet<Map>& intersect_set() const {
+    return intersect_set_;
   }
 
   NodeType node_type() const { return node_type_; }
 
  private:
   compiler::JSHeapBroker* broker_;
-  base::Vector<const compiler::MapRef> maps_;
-  bool known_maps_are_subset_of_maps_;
-  bool emit_check_with_migration_;
-  ZoneHandleSet<Map> stable_map_set_;
-  ZoneHandleSet<Map> unstable_map_set_;
-  NodeType node_type_ = NodeType::kJSReceiverWithKnownMap;
+  base::Vector<const compiler::MapRef> requested_maps_;
+  compiler::ZoneRefSet<Map> intersect_set_;
+  bool known_maps_are_subset_of_requested_maps_ = true;
+  bool existing_known_maps_found_ = true;
+  bool emit_check_with_migration_ = false;
+  bool any_map_is_unstable_ = false;
+  NodeType node_type_ = static_cast<NodeType>(-1);
 
   Zone* zone() const { return broker_->zone(); }
 
-  base::Optional<ZoneHandleSet<Map>> GetKnownMapSet(
-      ValueNode* object,
-      const ZoneMap<ValueNode*, ZoneHandleSet<Map>>& map_of_map_set) {
-    auto it = map_of_map_set.find(object);
-    if (it == map_of_map_set.end()) {
-      return {};
-    }
-    return it->second;
-  }
-
-  compiler::OptionalMapRef GetMapRefFromMaps(Handle<Map> handle) {
-    auto it =
-        std::find_if(maps_.begin(), maps_.end(), [&](compiler::MapRef map_ref) {
-          return map_ref.object().is_identical_to(handle);
-        });
-    if (it == maps_.end()) return {};
-    return *it;
-  }
-
-  void InsertMap(compiler::MapRef map, bool add_dependency) {
+  void InsertMap(compiler::MapRef map) {
     if (map.is_migration_target()) {
       emit_check_with_migration_ = true;
     }
-    if (map.IsHeapNumberMap()) {
-      // If this is a heap number map, the object may be a Smi, so mask away
-      // the known HeapObject bit.
-      node_type_ = IntersectType(node_type_, NodeType::kObjectWithKnownMap);
-    } else if (!map.IsJSReceiverMap()) {
-      node_type_ = IntersectType(node_type_, NodeType::kHeapObjectWithKnownMap);
-    }
-    if (map.is_stable()) {
-      // TODO(victorgomes): Add a DCHECK_SLOW that checks if the map already
-      // exists in the CompilationDependencySet for the else branch.
-      if (add_dependency) {
-        broker_->dependencies()->DependOnStableMap(map);
-      }
-      stable_map_set_.insert(map.object(), zone());
-    } else {
-      unstable_map_set_.insert(map.object(), zone());
+    NodeType new_type = StaticTypeForMap(map);
+    if (new_type == NodeType::kHeapNumber) {
+      new_type = IntersectType(new_type, NodeType::kSmi);
     }
-  }
-
-  void IntersectKnownMaps(base::Optional<ZoneHandleSet<Map>>& known_maps,
-                          bool is_set_with_stable_maps) {
-    if (known_maps.has_value()) {
-      // TODO(v8:7700): Make intersection non-quadratic.
-      for (Handle<Map> handle : *known_maps) {
-        auto map = GetMapRefFromMaps(handle);
-        if (map.has_value()) {
-          InsertMap(*map, false);
-        } else {
-          known_maps_are_subset_of_maps_ = false;
-        }
-      }
-    } else {
-      // Intersect with the universal set.
-      known_maps_are_subset_of_maps_ = false;
-      for (compiler::MapRef map : maps_) {
-        if (map.is_stable() == is_set_with_stable_maps) {
-          InsertMap(map, true);
-        }
-      }
+    node_type_ = IntersectType(node_type_, new_type);
+    if (!map.is_stable()) {
+      any_map_is_unstable_ = true;
     }
+    intersect_set_.insert(map, zone());
   }
 };
 
 }  // namespace
 
-void MaglevGraphBuilder::BuildCheckMaps(
+ReduceResult MaglevGraphBuilder::BuildCheckMaps(
     ValueNode* object, base::Vector<const compiler::MapRef> maps) {
   // TODO(verwaest): Support other objects with possible known stable maps as
   // well.
-  if (object->Is<Constant>()) {
+  if (compiler::OptionalHeapObjectRef constant = TryGetConstant(object)) {
     // For constants with stable maps that match one of the desired maps, we
     // don't need to emit a map check, and can use the dependency -- we
     // can't do this for unstable maps because the constant could migrate
     // during compilation.
-    compiler::MapRef constant_map =
-        object->Cast<Constant>()->object().map(broker());
+    compiler::MapRef constant_map = constant.value().map(broker());
     if (std::find(maps.begin(), maps.end(), constant_map) != maps.end()) {
       if (constant_map.is_stable()) {
         broker()->dependencies()->DependOnStableMap(constant_map);
-        return;
+        return ReduceResult::Done();
       }
       // TODO(verwaest): Reduce maps to the constant map.
     } else {
@@ -2298,22 +3187,37 @@ void MaglevGraphBuilder::BuildCheckMaps(
   }
 
   NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(object);
-  known_info->type = CombineType(known_info->type, StaticTypeForNode(object));
+  known_info->CombineType(StaticTypeForNode(broker(), local_isolate(), object));
 
   // Calculates if known maps are a subset of maps, their map intersection and
   // whether we should emit check with migration.
   KnownMapsMerger merger(broker(), maps);
   merger.IntersectWithKnownNodeAspects(object, known_node_aspects());
-  merger.UpdateKnownNodeAspects(object, known_node_aspects());
 
   // If the known maps are the subset of the maps to check, we are done.
-  if (merger.known_maps_are_subset_of_maps()) {
-    DCHECK(NodeTypeIs(known_info->type, merger.node_type()));
-    return;
+  if (merger.known_maps_are_subset_of_requested_maps()) {
+    // The node type of known_info can get out of sync with the possible maps.
+    // For instance after merging with an effectively dead branch (i.e., check
+    // contradicting all possible maps).
+    // TODO(olivf) Try to combine node_info and possible maps and ensure that
+    // narrowing the type also clears impossible possible_maps.
+    if (!NodeTypeIs(known_info->type(), merger.node_type())) {
+      known_info->IntersectType(merger.node_type());
+    }
+#ifdef DEBUG
+    // Double check that, for every possible map, it's one of the maps we'd
+    // want to check.
+    for (compiler::MapRef map :
+         known_node_aspects().TryGetInfoFor(object)->possible_maps()) {
+      DCHECK_NE(std::find(maps.begin(), maps.end(), map), maps.end());
+    }
+#endif
+    return ReduceResult::Done();
   }
 
-  // TODO(v8:7700): Insert an unconditional deopt here if intersect map sets are
-  // empty.
+  if (merger.intersect_set().is_empty()) {
+    return EmitUnconditionalDeopt(DeoptimizeReason::kWrongMap);
+  }
 
   // TODO(v8:7700): Check if the {maps} - {known_maps} size is smaller than
   // {maps} \intersect {known_maps}, we can emit CheckNotMaps instead.
@@ -2321,12 +3225,46 @@ void MaglevGraphBuilder::BuildCheckMaps(
   // Emit checks.
   if (merger.emit_check_with_migration()) {
     AddNewNode<CheckMapsWithMigration>({object}, merger.intersect_set(),
-                                       GetCheckType(known_info->type));
+                                       GetCheckType(known_info->type()));
   } else {
     AddNewNode<CheckMaps>({object}, merger.intersect_set(),
-                          GetCheckType(known_info->type));
+                          GetCheckType(known_info->type()));
+  }
+
+  merger.UpdateKnownNodeAspects(object, known_node_aspects());
+  return ReduceResult::Done();
+}
+
+ReduceResult MaglevGraphBuilder::BuildTransitionElementsKindOrCheckMap(
+    ValueNode* object, base::Vector<const compiler::MapRef> transition_sources,
+    compiler::MapRef transition_target) {
+  // TODO(marja): Optimizations based on what we know about the intersection of
+  // known maps and transition sources or transition target.
+
+  // TransitionElementsKind doesn't happen in cases where we'd need to do
+  // CheckMapsWithMigration instead of CheckMaps.
+  CHECK(!transition_target.is_migration_target());
+  for (const compiler::MapRef transition_source : transition_sources) {
+    CHECK(!transition_source.is_migration_target());
+  }
+
+  NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(object);
+  known_info->CombineType(StaticTypeForNode(broker(), local_isolate(), object));
+
+  AddNewNode<TransitionElementsKindOrCheckMap>(
+      {object}, transition_sources, transition_target,
+      GetCheckType(known_info->type()));
+  // After this operation, object's map is transition_target (or we deopted).
+  known_info->SetPossibleMaps(PossibleMaps{transition_target},
+                              !transition_target.is_stable(),
+                              NodeType::kJSReceiver);
+  DCHECK(transition_target.IsJSReceiverMap());
+  if (!transition_target.is_stable()) {
+    known_node_aspects().any_map_for_any_node_is_unstable = true;
+  } else {
+    broker()->dependencies()->DependOnStableMap(transition_target);
   }
-  known_info->type = merger.node_type();
+  return ReduceResult::Done();
 }
 
 namespace {
@@ -2405,7 +3343,7 @@ bool MaglevGraphBuilder::CanTreatHoleAsUndefined(
 
 compiler::OptionalObjectRef
 MaglevGraphBuilder::TryFoldLoadDictPrototypeConstant(
-    compiler::PropertyAccessInfo access_info) {
+    compiler::PropertyAccessInfo const& access_info) {
   DCHECK(V8_DICT_PROPERTY_CONST_TRACKING_BOOL);
   DCHECK(access_info.IsDictionaryProtoDataConstant());
   DCHECK(access_info.holder().has_value());
@@ -2419,7 +3357,7 @@ MaglevGraphBuilder::TryFoldLoadDictPrototypeConstant(
     Handle<Map> map_handle = map.object();
     // Non-JSReceivers that passed AccessInfoFactory::ComputePropertyAccessInfo
     // must have different lookup start map.
-    if (!map_handle->IsJSReceiverMap()) {
+    if (!IsJSReceiverMap(*map_handle)) {
       // Perform the implicit ToObject for primitives here.
       // Implemented according to ES6 section 7.3.2 GetV (V, P).
       JSFunction constructor =
@@ -2428,8 +3366,8 @@ MaglevGraphBuilder::TryFoldLoadDictPrototypeConstant(
               .value();
       // {constructor.initial_map()} is loaded/stored with acquire-release
       // semantics for constructors.
-      map = MakeRefAssumeMemoryFence(broker(), constructor.initial_map());
-      DCHECK(map.object()->IsJSObjectMap());
+      map = MakeRefAssumeMemoryFence(broker(), constructor->initial_map());
+      DCHECK(IsJSObjectMap(*map.object()));
     }
     broker()->dependencies()->DependOnConstantInDictionaryPrototypeChain(
         map, access_info.name(), constant.value(), PropertyKind::kData);
@@ -2439,14 +3377,16 @@ MaglevGraphBuilder::TryFoldLoadDictPrototypeConstant(
 }
 
 compiler::OptionalObjectRef MaglevGraphBuilder::TryFoldLoadConstantDataField(
-    compiler::PropertyAccessInfo access_info, ValueNode* lookup_start_object) {
+    compiler::PropertyAccessInfo const& access_info,
+    ValueNode* lookup_start_object) {
   if (!access_info.IsFastDataConstant()) return {};
   compiler::OptionalJSObjectRef source;
   if (access_info.holder().has_value()) {
     source = access_info.holder();
-  } else if (Constant* n = lookup_start_object->TryCast<Constant>()) {
-    if (!n->ref().IsJSObject()) return {};
-    source = n->ref().AsJSObject();
+  } else if (compiler::OptionalHeapObjectRef c =
+                 TryGetConstant(lookup_start_object)) {
+    if (!c.value().IsJSObject()) return {};
+    source = c.value().AsJSObject();
   } else {
     return {};
   }
@@ -2456,7 +3396,7 @@ compiler::OptionalObjectRef MaglevGraphBuilder::TryFoldLoadConstantDataField(
 }
 
 ReduceResult MaglevGraphBuilder::TryBuildPropertyGetterCall(
-    compiler::PropertyAccessInfo access_info, ValueNode* receiver,
+    compiler::PropertyAccessInfo const& access_info, ValueNode* receiver,
     ValueNode* lookup_start_object) {
   compiler::ObjectRef constant = access_info.constant().value();
 
@@ -2475,35 +3415,28 @@ ReduceResult MaglevGraphBuilder::TryBuildPropertyGetterCall(
             ? ConvertReceiverMode::kNotNullOrUndefined
             : ConvertReceiverMode::kAny;
     CallArguments args(receiver_mode, {receiver});
-    return ReduceCall(constant.AsJSFunction(), args);
-  } else if (receiver != lookup_start_object) {
-    return ReduceResult::Fail();
+    return ReduceCallForConstant(constant.AsJSFunction(), args);
   } else {
-    ValueNode* api_holder = access_info.api_holder().has_value()
-                                ? GetConstant(access_info.api_holder().value())
-                                : receiver;
+    // Disable optimizations for super ICs using API getters, so that we get
+    // the correct receiver checks.
+    if (receiver != lookup_start_object) {
+      return ReduceResult::Fail();
+    }
     compiler::FunctionTemplateInfoRef templ = constant.AsFunctionTemplateInfo();
-    if (!templ.call_code(broker()).has_value()) return ReduceResult::Fail();
+    CallArguments args(ConvertReceiverMode::kNotNullOrUndefined, {receiver});
 
-    compiler::CallHandlerInfoRef call_handler_info =
-        templ.call_code(broker()).value();
-    ApiFunction function(call_handler_info.callback());
-    ExternalReference reference = ExternalReference::Create(
-        &function, ExternalReference::DIRECT_API_CALL);
-    return BuildCallBuiltin<Builtin::kCallApiCallback>(
-        {GetExternalConstant(reference), GetInt32Constant(0),
-         GetConstant(call_handler_info.data(broker())), api_holder, receiver});
+    return ReduceCallForApiFunction(templ, {}, access_info.api_holder(), args);
   }
 }
 
 ReduceResult MaglevGraphBuilder::TryBuildPropertySetterCall(
-    compiler::PropertyAccessInfo access_info, ValueNode* receiver,
+    compiler::PropertyAccessInfo const& access_info, ValueNode* receiver,
     ValueNode* value) {
   compiler::ObjectRef constant = access_info.constant().value();
   if (constant.IsJSFunction()) {
     CallArguments args(ConvertReceiverMode::kNotNullOrUndefined,
                        {receiver, value});
-    return ReduceCall(constant.AsJSFunction(), args);
+    return ReduceCallForConstant(constant.AsJSFunction(), args);
   } else {
     // TODO(victorgomes): API calls.
     return ReduceResult::Fail();
@@ -2511,7 +3444,8 @@ ReduceResult MaglevGraphBuilder::TryBuildPropertySetterCall(
 }
 
 ValueNode* MaglevGraphBuilder::BuildLoadField(
-    compiler::PropertyAccessInfo access_info, ValueNode* lookup_start_object) {
+    compiler::PropertyAccessInfo const& access_info,
+    ValueNode* lookup_start_object) {
   compiler::OptionalObjectRef constant =
       TryFoldLoadConstantDataField(access_info, lookup_start_object);
   if (constant.has_value()) {
@@ -2542,28 +3476,53 @@ ValueNode* MaglevGraphBuilder::BuildLoadField(
   // Insert stable field information if present.
   if (access_info.field_representation().IsSmi()) {
     NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(value);
-    known_info->type = NodeType::kSmi;
+    known_info->CombineType(NodeType::kSmi);
   } else if (access_info.field_representation().IsHeapObject()) {
     NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(value);
     if (access_info.field_map().has_value() &&
         access_info.field_map().value().is_stable()) {
       DCHECK(access_info.field_map().value().IsJSReceiverMap());
-      known_info->type = NodeType::kJSReceiverWithKnownMap;
       auto map = access_info.field_map().value();
-      ZoneHandleSet<Map> stable_maps(map.object());
-      ZoneHandleSet<Map> unstable_maps;
-      known_node_aspects().stable_maps.emplace(value, stable_maps);
-      known_node_aspects().unstable_maps.emplace(value, unstable_maps);
+      known_info->SetPossibleMaps(PossibleMaps{map}, false,
+                                  NodeType::kJSReceiver);
       broker()->dependencies()->DependOnStableMap(map);
     } else {
-      known_info->type = NodeType::kAnyHeapObject;
+      known_info->CombineType(NodeType::kAnyHeapObject);
     }
   }
   return value;
 }
 
+ReduceResult MaglevGraphBuilder::BuildLoadJSArrayLength(ValueNode* js_array) {
+  // TODO(leszeks): JSArray.length is known to be non-constant, don't bother
+  // searching the constant values.
+  RETURN_IF_DONE(
+      TryReuseKnownPropertyLoad(js_array, broker()->length_string()));
+
+  ValueNode* length =
+      AddNewNode<LoadTaggedField>({js_array}, JSArray::kLengthOffset);
+  known_node_aspects().GetOrCreateInfoFor(length)->CombineType(NodeType::kSmi);
+  RecordKnownProperty(js_array, broker()->length_string(), length, false,
+                      compiler::AccessMode::kLoad);
+  return length;
+}
+
+void MaglevGraphBuilder::BuildStoreReceiverMap(ValueNode* receiver,
+                                               compiler::MapRef map) {
+  AddNewNode<StoreMap>({receiver}, map);
+  NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(receiver);
+  DCHECK(map.IsJSReceiverMap());
+  if (map.is_stable()) {
+    node_info->SetPossibleMaps(PossibleMaps{map}, false, NodeType::kJSReceiver);
+    broker()->dependencies()->DependOnStableMap(map);
+  } else {
+    node_info->SetPossibleMaps(PossibleMaps{map}, true, NodeType::kJSReceiver);
+    known_node_aspects().any_map_for_any_node_is_unstable = true;
+  }
+}
+
 ReduceResult MaglevGraphBuilder::TryBuildStoreField(
-    compiler::PropertyAccessInfo access_info, ValueNode* receiver,
+    compiler::PropertyAccessInfo const& access_info, ValueNode* receiver,
     compiler::AccessMode access_mode) {
   FieldIndex field_index = access_info.field_index();
   Representation field_representation = access_info.field_representation();
@@ -2577,7 +3536,7 @@ ReduceResult MaglevGraphBuilder::TryBuildStoreField(
     }
   } else if (access_info.IsFastDataConstant() &&
              access_mode == compiler::AccessMode::kStore) {
-    return ReduceResult::DoneWithAbort();
+    return EmitUnconditionalDeopt(DeoptimizeReason::kStoreToConstant);
   }
 
   ValueNode* store_target;
@@ -2591,29 +3550,33 @@ ReduceResult MaglevGraphBuilder::TryBuildStoreField(
 
   ValueNode* value;
   if (field_representation.IsDouble()) {
-    value = GetAccumulatorFloat64(TaggedToFloat64ConversionType::kNumber);
+    value = GetAccumulatorFloat64();
     if (access_info.HasTransitionMap()) {
       // Allocate the mutable double box owned by the field.
       value = AddNewNode<Float64ToTagged>(
           {value}, Float64ToTagged::ConversionMode::kForceHeapNumber);
     }
   } else {
-    value = GetAccumulatorTagged();
-    if (field_representation.IsHeapObject()) {
-      // Emit a map check for the field type, if needed, otherwise just a
-      // HeapObject check.
-      if (access_info.field_map().has_value()) {
-        BuildCheckMaps(value,
-                       base::VectorOf({access_info.field_map().value()}));
-      } else {
-        BuildCheckHeapObject(value);
+    if (field_representation.IsSmi()) {
+      value = GetAccumulatorSmi();
+    } else {
+      value = GetAccumulatorTagged();
+      if (field_representation.IsHeapObject()) {
+        // Emit a map check for the field type, if needed, otherwise just a
+        // HeapObject check.
+        if (access_info.field_map().has_value()) {
+          RETURN_IF_ABORT(BuildCheckMaps(
+              value, base::VectorOf({access_info.field_map().value()})));
+        } else {
+          BuildCheckHeapObject(value);
+        }
       }
     }
   }
 
   if (field_representation.IsSmi()) {
-    AddNewNode<CheckedStoreSmiField>({store_target, value},
-                                     field_index.offset());
+    BuildStoreTaggedFieldNoWriteBarrier(store_target, value,
+                                        field_index.offset());
   } else if (value->use_double_register()) {
     DCHECK(field_representation.IsDouble());
     DCHECK(!access_info.HasTransitionMap());
@@ -2626,28 +3589,33 @@ ReduceResult MaglevGraphBuilder::TryBuildStoreField(
   }
 
   if (access_info.HasTransitionMap()) {
-    compiler::MapRef transition = access_info.transition_map().value();
-    AddNewNode<StoreMap>({receiver}, transition);
-    NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(receiver);
-    DCHECK(transition.IsJSReceiverMap());
-    node_info->type = NodeType::kJSReceiverWithKnownMap;
-    if (transition.is_stable()) {
-      ZoneHandleSet<Map> stable_maps(transition.object());
-      ZoneHandleSet<Map> unstable_maps;
-      known_node_aspects().stable_maps.emplace(receiver, stable_maps);
-      known_node_aspects().unstable_maps.emplace(receiver, unstable_maps);
-      broker()->dependencies()->DependOnStableMap(transition);
-    } else {
-      ZoneHandleSet<Map> stable_maps;
-      ZoneHandleSet<Map> unstable_maps(transition.object());
-      known_node_aspects().stable_maps.emplace(receiver, stable_maps);
-      known_node_aspects().unstable_maps.emplace(receiver, unstable_maps);
-    }
+    BuildStoreReceiverMap(receiver, access_info.transition_map().value());
   }
 
   return ReduceResult::Done();
 }
 
+namespace {
+bool AccessInfoGuaranteedConst(
+    compiler::PropertyAccessInfo const& access_info) {
+  if (!access_info.IsFastDataConstant() && !access_info.IsStringLength()) {
+    return false;
+  }
+
+  // Even if we have a constant load, if the map is not stable, we cannot
+  // guarantee that the load is preserved across side-effecting calls.
+  // TODO(v8:7700): It might be possible to track it as const if we know
+  // that we're still on the main transition tree; and if we add a
+  // dependency on the stable end-maps of the entire tree.
+  for (auto& map : access_info.lookup_start_object_maps()) {
+    if (!map.is_stable()) {
+      return false;
+    }
+  }
+  return true;
+}
+}  // namespace
+
 ReduceResult MaglevGraphBuilder::TryBuildPropertyLoad(
     ValueNode* receiver, ValueNode* lookup_start_object, compiler::NameRef name,
     compiler::PropertyAccessInfo const& access_info) {
@@ -2665,7 +3633,9 @@ ReduceResult MaglevGraphBuilder::TryBuildPropertyLoad(
     case compiler::PropertyAccessInfo::kDataField:
     case compiler::PropertyAccessInfo::kFastDataConstant: {
       ValueNode* result = BuildLoadField(access_info, lookup_start_object);
-      RecordKnownProperty(lookup_start_object, name, result, access_info);
+      RecordKnownProperty(lookup_start_object, name, result,
+                          AccessInfoGuaranteedConst(access_info),
+                          compiler::AccessMode::kLoad);
       return result;
     }
     case compiler::PropertyAccessInfo::kDictionaryProtoDataConstant: {
@@ -2685,7 +3655,9 @@ ReduceResult MaglevGraphBuilder::TryBuildPropertyLoad(
     case compiler::PropertyAccessInfo::kStringLength: {
       DCHECK_EQ(receiver, lookup_start_object);
       ValueNode* result = AddNewNode<StringLength>({receiver});
-      RecordKnownProperty(lookup_start_object, name, result, access_info);
+      RecordKnownProperty(lookup_start_object, name, result,
+                          AccessInfoGuaranteedConst(access_info),
+                          compiler::AccessMode::kLoad);
       return result;
     }
   }
@@ -2706,11 +3678,12 @@ ReduceResult MaglevGraphBuilder::TryBuildPropertyStore(
                                       GetAccumulatorTagged());
   } else {
     DCHECK(access_info.IsDataField() || access_info.IsFastDataConstant());
-    if (TryBuildStoreField(access_info, receiver, access_mode).IsDone()) {
+    ReduceResult res = TryBuildStoreField(access_info, receiver, access_mode);
+    if (res.IsDone()) {
       RecordKnownProperty(receiver, name,
                           current_interpreter_frame_.accumulator(),
-                          access_info);
-      return ReduceResult::Done();
+                          AccessInfoGuaranteedConst(access_info), access_mode);
+      return res;
     }
     return ReduceResult::Fail();
   }
@@ -2756,11 +3729,25 @@ ReduceResult MaglevGraphBuilder::TryBuildNamedAccess(
   ZoneVector<compiler::PropertyAccessInfo> access_infos(zone());
   {
     ZoneVector<compiler::PropertyAccessInfo> access_infos_for_feedback(zone());
-    ZoneHandleSet<Map> inferred_maps;
-
-    if (Constant* n = lookup_start_object->TryCast<Constant>()) {
-      compiler::MapRef constant_map = n->object().map(broker());
-      inferred_maps = ZoneHandleSet<Map>(constant_map.object());
+    compiler::ZoneRefSet<Map> inferred_maps;
+
+    if (compiler::OptionalHeapObjectRef c =
+            TryGetConstant(lookup_start_object)) {
+      compiler::MapRef constant_map = c.value().map(broker());
+      if (c.value().IsJSFunction() &&
+          feedback.name().equals(broker()->prototype_string())) {
+        compiler::JSFunctionRef function = c.value().AsJSFunction();
+        if (!constant_map.has_prototype_slot() ||
+            !function.has_instance_prototype(broker()) ||
+            function.PrototypeRequiresRuntimeLookup(broker()) ||
+            access_mode != compiler::AccessMode::kLoad) {
+          return ReduceResult::Fail();
+        }
+        compiler::HeapObjectRef prototype =
+            broker()->dependencies()->DependOnPrototypeProperty(function);
+        return GetConstant(prototype);
+      }
+      inferred_maps = compiler::ZoneRefSet<Map>(constant_map);
     } else {
       // TODO(leszeks): This is doing duplicate work with BuildCheckMaps,
       // consider passing the merger into there.
@@ -2770,22 +3757,24 @@ ReduceResult MaglevGraphBuilder::TryBuildNamedAccess(
       inferred_maps = merger.intersect_set();
     }
 
-    for (Handle<Map> map : inferred_maps) {
-      if (map->is_deprecated()) continue;
+    if (inferred_maps.is_empty()) {
+      return EmitUnconditionalDeopt(DeoptimizeReason::kWrongMap);
+    }
+
+    for (compiler::MapRef map : inferred_maps) {
+      if (map.is_deprecated()) continue;
 
       // TODO(v8:12547): Support writing to objects in shared space, which
       // need a write barrier that calls Object::Share to ensure the RHS is
       // shared.
       if (InstanceTypeChecker::IsAlwaysSharedSpaceJSObject(
-              map->instance_type()) &&
+              map.instance_type()) &&
           access_mode == compiler::AccessMode::kStore) {
         return ReduceResult::Fail();
       }
 
-      compiler::MapRef map_ref = MakeRefAssumeMemoryFence(broker(), map);
       compiler::PropertyAccessInfo access_info =
-          broker()->GetPropertyAccessInfo(map_ref, feedback.name(),
-                                          access_mode);
+          broker()->GetPropertyAccessInfo(map, feedback.name(), access_mode);
       access_infos_for_feedback.push_back(access_info);
     }
 
@@ -2809,7 +3798,7 @@ ReduceResult MaglevGraphBuilder::TryBuildNamedAccess(
     } else if (HasOnlyNumberMaps(maps)) {
       BuildCheckNumber(lookup_start_object);
     } else {
-      BuildCheckMaps(lookup_start_object, maps);
+      RETURN_IF_ABORT(BuildCheckMaps(lookup_start_object, maps));
     }
 
     // Generate the actual property
@@ -2824,7 +3813,7 @@ ReduceResult MaglevGraphBuilder::TryBuildNamedAccess(
     }
 
     // Check if we support the polymorphic load.
-    for (compiler::PropertyAccessInfo access_info : access_infos) {
+    for (compiler::PropertyAccessInfo const& access_info : access_infos) {
       DCHECK(!access_info.IsInvalid());
       if (access_info.IsDictionaryProtoDataConstant()) {
         compiler::OptionalObjectRef constant =
@@ -2853,7 +3842,7 @@ ReduceResult MaglevGraphBuilder::TryBuildNamedAccess(
     ZoneVector<PolymorphicAccessInfo> poly_access_infos(zone());
     poly_access_infos.reserve(access_infos.size());
 
-    for (compiler::PropertyAccessInfo access_info : access_infos) {
+    for (compiler::PropertyAccessInfo const& access_info : access_infos) {
       if (access_info.holder().has_value() &&
           !access_info.HasDictionaryHolder()) {
         broker()->dependencies()->DependOnStablePrototypeChains(
@@ -2916,28 +3905,32 @@ ReduceResult MaglevGraphBuilder::TryBuildNamedAccess(
 }
 
 ValueNode* MaglevGraphBuilder::GetInt32ElementIndex(ValueNode* object) {
+  RecordUseReprHintIfPhi(object, UseRepresentation::kInt32);
+
   switch (object->properties().value_representation()) {
     case ValueRepresentation::kWord64:
       UNREACHABLE();
     case ValueRepresentation::kTagged:
+      NodeType old_type;
       if (SmiConstant* constant = object->TryCast<SmiConstant>()) {
         return GetInt32Constant(constant->value().value());
-      } else if (CheckType(object, NodeType::kSmi)) {
-        NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(object);
-        if (!node_info->int32_alternative) {
-          node_info->int32_alternative = AddNewNode<UnsafeSmiUntag>({object});
-        }
-        return node_info->int32_alternative;
+      } else if (CheckType(object, NodeType::kSmi, &old_type)) {
+        auto& alternative =
+            known_node_aspects().GetOrCreateInfoFor(object)->alternative();
+        return alternative.get_or_set_int32(
+            [&]() { return AddNewNode<UnsafeSmiUntag>({object}); });
       } else {
         // TODO(leszeks): Cache this knowledge/converted value somehow on
         // the node info.
-        return AddNewNode<CheckedObjectToIndex>({object});
+        return AddNewNode<CheckedObjectToIndex>({object},
+                                                GetCheckType(old_type));
       }
     case ValueRepresentation::kInt32:
       // Already good.
       return object;
     case ValueRepresentation::kUint32:
     case ValueRepresentation::kFloat64:
+    case ValueRepresentation::kHoleyFloat64:
       return GetInt32(object);
   }
 }
@@ -2945,6 +3938,8 @@ ValueNode* MaglevGraphBuilder::GetInt32ElementIndex(ValueNode* object) {
 // TODO(victorgomes): Consider caching the values and adding an
 // uint32_alternative in node_info.
 ValueNode* MaglevGraphBuilder::GetUint32ElementIndex(ValueNode* object) {
+  RecordUseReprHintIfPhi(object, UseRepresentation::kUint32);
+
   switch (object->properties().value_representation()) {
     case ValueRepresentation::kWord64:
       UNREACHABLE();
@@ -2957,7 +3952,10 @@ ValueNode* MaglevGraphBuilder::GetUint32ElementIndex(ValueNode* object) {
     case ValueRepresentation::kUint32:
       return object;
     case ValueRepresentation::kFloat64:
+      // CheckedTruncateFloat64ToUint32 will gracefully deopt on holes.
+    case ValueRepresentation::kHoleyFloat64: {
       return AddNewNode<CheckedTruncateFloat64ToUint32>({object});
+    }
   }
 }
 
@@ -3024,11 +4022,16 @@ void MaglevGraphBuilder::BuildStoreTypedArrayElement(
   } else {                                                                 \
     AddNewNode<Store##Type##TypedArrayElement>(__VA_ARGS__);               \
   }
+  // TODO(leszeks): These operations have a deopt loop when the ToNumber
+  // conversion sees a type other than number or oddball. Turbofan has the same
+  // deopt loop, but ideally we'd avoid it.
   switch (elements_kind) {
     case UINT8_CLAMPED_ELEMENTS: {
-      BUILD_STORE_TYPED_ARRAY(
-          Int, {object, index, GetAccumulatorUint32ClampedFromNumber()},
-          elements_kind)
+      BUILD_STORE_TYPED_ARRAY(Int,
+                              {object, index,
+                               GetAccumulatorUint8ClampedForToNumber(
+                                   ToNumberHint::kAssumeNumberOrOddball)},
+                              elements_kind)
       break;
     }
     case INT8_ELEMENTS:
@@ -3039,17 +4042,17 @@ void MaglevGraphBuilder::BuildStoreTypedArrayElement(
     case UINT32_ELEMENTS:
       BUILD_STORE_TYPED_ARRAY(Int,
                               {object, index,
-                               GetAccumulatorTruncatedInt32FromNumber(
-                                   TaggedToFloat64ConversionType::kNumber)},
+                               GetAccumulatorTruncatedInt32ForToNumber(
+                                   ToNumberHint::kAssumeNumberOrOddball)},
                               elements_kind)
       break;
     case FLOAT32_ELEMENTS:
     case FLOAT64_ELEMENTS:
-      BUILD_STORE_TYPED_ARRAY(
-          Double,
-          {object, index,
-           GetAccumulatorFloat64(TaggedToFloat64ConversionType::kNumber)},
-          elements_kind)
+      BUILD_STORE_TYPED_ARRAY(Double,
+                              {object, index,
+                               GetAccumulatorHoleyFloat64ForToNumber(
+                                   ToNumberHint::kAssumeNumberOrOddball)},
+                              elements_kind)
       break;
     default:
       UNREACHABLE();
@@ -3100,86 +4103,205 @@ ReduceResult MaglevGraphBuilder::TryBuildElementAccessOnTypedArray(
   }
 }
 
-ReduceResult MaglevGraphBuilder::TryBuildElementAccessOnJSArrayOrJSObject(
+ReduceResult MaglevGraphBuilder::TryBuildElementLoadOnJSArrayOrJSObject(
     ValueNode* object, ValueNode* index_object,
     const compiler::ElementAccessInfo& access_info,
-    compiler::KeyedAccessMode const& keyed_mode) {
+    KeyedAccessLoadMode load_mode) {
   ElementsKind elements_kind = access_info.elements_kind();
-  if (!IsFastElementsKind(elements_kind)) {
-    return ReduceResult::Fail();
-  }
+  DCHECK(IsFastElementsKind(elements_kind));
+
   base::Vector<const compiler::MapRef> maps =
       base::VectorOf(access_info.lookup_start_object_maps());
-  if ((keyed_mode.access_mode() == compiler::AccessMode::kLoad) &&
-      IsHoleyElementsKind(elements_kind) && !CanTreatHoleAsUndefined(maps)) {
+  // TODO(v8:7700): Add non-deopting bounds check (has to support undefined
+  // values).
+  if (load_mode != STANDARD_LOAD) {
     return ReduceResult::Fail();
   }
-  if (keyed_mode.access_mode() == compiler::AccessMode::kStore &&
-      keyed_mode.store_mode() == STORE_AND_GROW_HANDLE_COW) {
-    // TODO(victorgomes): Handle growable elements.
-    return ReduceResult::Fail();
+
+  bool is_jsarray = HasOnlyJSArrayMaps(maps);
+  DCHECK(is_jsarray || HasOnlyJSObjectMaps(maps));
+
+  // 1. Get the elements array.
+  ValueNode* elements_array =
+      AddNewNode<LoadTaggedField>({object}, JSObject::kElementsOffset);
+
+  // 2. Check boundaries,
+  ValueNode* index = GetInt32ElementIndex(index_object);
+  ValueNode* length_as_smi =
+      is_jsarray ? AddNewNode<LoadTaggedField>({object}, JSArray::kLengthOffset)
+                 : AddNewNode<LoadTaggedField>({elements_array},
+                                               FixedArray::kLengthOffset);
+  ValueNode* length = AddNewNode<UnsafeSmiUntag>({length_as_smi});
+  AddNewNode<CheckInt32Condition>({index, length},
+                                  AssertCondition::kUnsignedLessThan,
+                                  DeoptimizeReason::kOutOfBounds);
+
+  // 3. Do the load.
+  ValueNode* result;
+  if (elements_kind == HOLEY_DOUBLE_ELEMENTS) {
+    if (CanTreatHoleAsUndefined(maps)) {
+      result =
+          AddNewNode<LoadHoleyFixedDoubleArrayElement>({elements_array, index});
+    } else {
+      result = AddNewNode<LoadHoleyFixedDoubleArrayElementCheckedNotHole>(
+          {elements_array, index});
+    }
+  } else if (elements_kind == PACKED_DOUBLE_ELEMENTS) {
+    result = AddNewNode<LoadFixedDoubleArrayElement>({elements_array, index});
+  } else {
+    DCHECK(!IsDoubleElementsKind(elements_kind));
+    result = AddNewNode<LoadFixedArrayElement>({elements_array, index});
+    if (IsHoleyElementsKind(elements_kind)) {
+      if (CanTreatHoleAsUndefined(maps)) {
+        result = AddNewNode<ConvertHoleToUndefined>({result});
+      } else {
+        result = AddNewNode<CheckNotHole>({result});
+      }
+    }
+  }
+  return result;
+}
+
+ValueNode* MaglevGraphBuilder::ConvertForStoring(ValueNode* value,
+                                                 ElementsKind kind) {
+  if (IsDoubleElementsKind(kind)) {
+    // Make sure we do not store signalling NaNs into double arrays.
+    // TODO(leszeks): Consider making this a bit on StoreFixedDoubleArrayElement
+    // rather than a separate node.
+    return GetSilencedNaN(GetFloat64(value));
   }
+  if (IsSmiElementsKind(kind)) return GetSmiValue(value);
+  return GetTaggedValue(value);
+}
+
+ReduceResult MaglevGraphBuilder::TryBuildElementStoreOnJSArrayOrJSObject(
+    ValueNode* object, ValueNode* index_object, ValueNode* value,
+    base::Vector<const compiler::MapRef> maps, ElementsKind elements_kind,
+    const compiler::KeyedAccessMode& keyed_mode) {
+  DCHECK(IsFastElementsKind(elements_kind));
+
+  const bool is_jsarray = HasOnlyJSArrayMaps(maps);
+  DCHECK(is_jsarray || HasOnlyJSObjectMaps(maps));
+
+  // Get the elements array.
+  ValueNode* elements_array =
+      AddNewNode<LoadTaggedField>({object}, JSObject::kElementsOffset);
+
+  value = ConvertForStoring(value, elements_kind);
   ValueNode* index;
-  if (HasOnlyJSArrayMaps(maps)) {
+
+  // TODO(verwaest): Loop peeling will turn the first iteration index of spread
+  // literals into smi constants as well, breaking the assumption that we'll
+  // have preallocated the space if we see known indices. Turn off this
+  // optimization if loop peeling is on.
+  if (keyed_mode.access_mode() == compiler::AccessMode::kStoreInLiteral &&
+      index_object->Is<SmiConstant>() && is_jsarray &&
+      !v8_flags.maglev_loop_peeling) {
     index = GetInt32ElementIndex(index_object);
-    AddNewNode<CheckJSArrayBounds>({object, index});
   } else {
-    DCHECK(HasOnlyJSObjectMaps(maps));
+    // Check boundaries.
+    ValueNode* elements_array_length = nullptr;
+    ValueNode* length;
+    if (is_jsarray) {
+      length = GetInt32(BuildLoadJSArrayLength(object).value());
+    } else {
+      length = elements_array_length =
+          AddNewNode<UnsafeSmiUntag>({AddNewNode<LoadTaggedField>(
+              {elements_array}, FixedArray::kLengthOffset)});
+    }
     index = GetInt32ElementIndex(index_object);
-    AddNewNode<CheckJSObjectElementsBounds>({object, index});
-  }
-  switch (keyed_mode.access_mode()) {
-    case compiler::AccessMode::kLoad: {
-      DCHECK_EQ(keyed_mode.load_mode(), STANDARD_LOAD);
-      ValueNode* elements_array =
-          AddNewNode<LoadTaggedField>({object}, JSObject::kElementsOffset);
-      ValueNode* result;
-      if (IsDoubleElementsKind(elements_kind)) {
-        result =
-            AddNewNode<LoadFixedDoubleArrayElement>({elements_array, index});
-        if (IsHoleyElementsKind(elements_kind)) {
-          // TODO(v8:7700): Add a representation for "Float64OrHole" and emit
-          // this boxing lazily.
-          result = AddNewNode<HoleyFloat64Box>({result});
-        }
-      } else {
-        result = AddNewNode<LoadFixedArrayElement>({elements_array, index});
-        if (IsHoleyElementsKind(elements_kind)) {
-          result = AddNewNode<ConvertHoleToUndefined>({result});
-        }
+    if (keyed_mode.store_mode() == STORE_AND_GROW_HANDLE_COW) {
+      if (elements_array_length == nullptr) {
+        elements_array_length =
+            AddNewNode<UnsafeSmiUntag>({AddNewNode<LoadTaggedField>(
+                {elements_array}, FixedArray::kLengthOffset)});
       }
-      return result;
-    }
-    case compiler::AccessMode::kStore: {
-      ValueNode* elements_array =
-          AddNewNode<LoadTaggedField>({object}, JSObject::kElementsOffset);
-      if (IsDoubleElementsKind(elements_kind)) {
-        ValueNode* value =
-            GetAccumulatorFloat64(TaggedToFloat64ConversionType::kNumber);
-        // Make sure we do not store signalling NaNs into double arrays.
-        // TODO(leszeks): Consider making this a bit on
-        // StoreFixedDoubleArrayElement rather than a separate node.
-        value = GetSilencedNaN(value);
-        AddNewNode<StoreFixedDoubleArrayElement>(
-            {elements_array, index, value});
-      } else {
+
+      // Validate the {index} depending on holeyness:
+      //
+      // For HOLEY_*_ELEMENTS the {index} must not exceed the {elements}
+      // backing store capacity plus the maximum allowed gap, as otherwise
+      // the (potential) backing store growth would normalize and thus
+      // the elements kind of the {receiver} would change to slow mode.
+      //
+      // For JSArray PACKED_*_ELEMENTS the {index} must be within the range
+      // [0,length+1[ to be valid. In case {index} equals {length},
+      // the {receiver} will be extended, but kept packed.
+      //
+      // Non-JSArray PACKED_*_ELEMENTS always grow by adding holes because they
+      // lack the magical length property, which requires a map transition.
+      // So we can assume that this did not happen if we did not see this map.
+      ValueNode* limit =
+          IsHoleyElementsKind(elements_kind)
+              ? AddNewNode<Int32AddWithOverflow>(
+                    {elements_array_length,
+                     GetInt32Constant(JSObject::kMaxGap)})
+          : is_jsarray
+              ? AddNewNode<Int32AddWithOverflow>({length, GetInt32Constant(1)})
+              : elements_array_length;
+      AddNewNode<CheckInt32Condition>({index, limit},
+                                      AssertCondition::kUnsignedLessThan,
+                                      DeoptimizeReason::kOutOfBounds);
+
+      // Grow backing store if necessary and handle COW.
+      elements_array = AddNewNode<MaybeGrowAndEnsureWritableFastElements>(
+          {elements_array, object, index, elements_array_length},
+          elements_kind);
+
+      // Update length if necessary.
+      if (is_jsarray) {
+        AddNewNode<UpdateJSArrayLength>({object, index, length});
+        RecordKnownProperty(object, broker()->length_string(), length, false,
+                            compiler::AccessMode::kStore);
+      }
+    } else {
+      AddNewNode<CheckInt32Condition>({index, length},
+                                      AssertCondition::kUnsignedLessThan,
+                                      DeoptimizeReason::kOutOfBounds);
+
+      // Handle COW if needed.
+      if (IsSmiOrObjectElementsKind(elements_kind)) {
         if (keyed_mode.store_mode() == STORE_HANDLE_COW) {
           elements_array =
               AddNewNode<EnsureWritableFastElements>({elements_array, object});
         } else {
           // Ensure that this is not a COW FixedArray.
-          BuildCheckMaps(elements_array,
-                         base::VectorOf({broker()->fixed_array_map()}));
-        }
-        ValueNode* value = GetAccumulatorTagged();
-        if (IsSmiElementsKind(elements_kind)) {
-          AddNewNode<CheckedStoreFixedArraySmiElement>(
-              {elements_array, index, value});
-        } else {
-          BuildStoreFixedArrayElement(elements_array, index, value);
+          RETURN_IF_ABORT(BuildCheckMaps(
+              elements_array, base::VectorOf({broker()->fixed_array_map()})));
         }
       }
-      return ReduceResult::Done();
+    }
+  }
+
+  // Do the store.
+  if (IsDoubleElementsKind(elements_kind)) {
+    AddNewNode<StoreFixedDoubleArrayElement>({elements_array, index, value});
+  } else {
+    BuildStoreFixedArrayElement(elements_array, index, value);
+  }
+
+  return ReduceResult::Done();
+}
+
+ReduceResult MaglevGraphBuilder::TryBuildElementAccessOnJSArrayOrJSObject(
+    ValueNode* object, ValueNode* index_object,
+    const compiler::ElementAccessInfo& access_info,
+    compiler::KeyedAccessMode const& keyed_mode) {
+  if (!IsFastElementsKind(access_info.elements_kind())) {
+    return ReduceResult::Fail();
+  }
+  switch (keyed_mode.access_mode()) {
+    case compiler::AccessMode::kLoad:
+      return TryBuildElementLoadOnJSArrayOrJSObject(
+          object, index_object, access_info, keyed_mode.load_mode());
+    case compiler::AccessMode::kStoreInLiteral:
+    case compiler::AccessMode::kStore: {
+      base::Vector<const compiler::MapRef> maps =
+          base::VectorOf(access_info.lookup_start_object_maps());
+      ElementsKind elements_kind = access_info.elements_kind();
+      return TryBuildElementStoreOnJSArrayOrJSObject(object, index_object,
+                                                     GetRawAccumulator(), maps,
+                                                     elements_kind, keyed_mode);
     }
     default:
       // TODO(victorgomes): Implement more access types.
@@ -3238,10 +4360,11 @@ ReduceResult MaglevGraphBuilder::TryBuildElementAccess(
         // If the {receiver_map} has a prototype and its elements backing
         // store is either holey, or we have a potentially growing store,
         // then we need to check that all prototypes have stable maps with
-        // fast elements (and we need to guard against changes to that below).
+        // with no element accessors and no throwing behavior for elements (and
+        // we need to guard against changes to that below).
         if ((IsHoleyOrDictionaryElementsKind(receiver_map.elements_kind()) ||
              IsGrowStoreMode(feedback.keyed_mode().store_mode())) &&
-            !receiver_map.HasOnlyStablePrototypesWithFastElements(
+            !receiver_map.PrototypesElementsDoNotHaveAccessorsOrThrow(
                 broker(), &prototype_maps)) {
           return ReduceResult::Fail();
         }
@@ -3255,7 +4378,7 @@ ReduceResult MaglevGraphBuilder::TryBuildElementAccess(
         }
       }
     }
-    for (compiler::MapRef const& prototype_map : prototype_maps) {
+    for (compiler::MapRef prototype_map : prototype_maps) {
       broker()->dependencies()->DependOnStableMap(prototype_map);
     }
   }
@@ -3273,12 +4396,12 @@ ReduceResult MaglevGraphBuilder::TryBuildElementAccess(
     if (!access_info.transition_sources().empty()) {
       base::Vector<compiler::MapRef> transition_sources =
           zone()->CloneVector(base::VectorOf(access_info.transition_sources()));
-      AddNewNode<TransitionElementsKind>({object}, transition_sources,
-                                         transition_target);
+      RETURN_IF_ABORT(BuildTransitionElementsKindOrCheckMap(
+          object, transition_sources, transition_target));
+    } else {
+      RETURN_IF_ABORT(BuildCheckMaps(
+          object, base::VectorOf(access_info.lookup_start_object_maps())));
     }
-
-    BuildCheckMaps(object,
-                   base::VectorOf(access_info.lookup_start_object_maps()));
     if (IsTypedArrayElementsKind(access_info.elements_kind())) {
       return TryBuildElementAccessOnTypedArray(object, index_object,
                                                access_info, keyed_mode);
@@ -3291,25 +4414,30 @@ ReduceResult MaglevGraphBuilder::TryBuildElementAccess(
   }
 }
 
-void MaglevGraphBuilder::RecordKnownProperty(
-    ValueNode* lookup_start_object, compiler::NameRef name, ValueNode* value,
-    compiler::PropertyAccessInfo const& access_info) {
-  bool is_const;
-  if (access_info.IsFastDataConstant() || access_info.IsStringLength()) {
-    is_const = true;
-    // Even if we have a constant load, if the map is not stable, we cannot
-    // guarantee that the load is preserved across side-effecting calls.
-    // TODO(v8:7700): It might be possible to track it as const if we know that
-    // we're still on the main transition tree; and if we add a dependency on
-    // the stable end-maps of the entire tree.
-    for (auto& map : access_info.lookup_start_object_maps()) {
-      if (!map.is_stable()) {
-        is_const = false;
-        break;
-      }
+void MaglevGraphBuilder::RecordKnownProperty(ValueNode* lookup_start_object,
+                                             compiler::NameRef name,
+                                             ValueNode* value, bool is_const,
+                                             compiler::AccessMode access_mode) {
+  KnownNodeAspects::LoadedPropertyMap& loaded_properties =
+      is_const ? known_node_aspects().loaded_constant_properties
+               : known_node_aspects().loaded_properties;
+  // Try to get loaded_properties[name] if it already exists, otherwise
+  // construct loaded_properties[name] = ZoneMap{zone()}.
+  auto& props_for_name =
+      loaded_properties.try_emplace(name, zone()).first->second;
+
+  if (!is_const && IsAnyStore(access_mode)) {
+    // We don't do any aliasing analysis, so stores clobber all other cached
+    // loads of a property with that name. We only need to do this for
+    // non-constant properties, since constant properties are known not to
+    // change and therefore can't be clobbered.
+    // TODO(leszeks): Do some light aliasing analysis here, e.g. checking
+    // whether there's an intersection of known maps.
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cout << "  * Removing all non-constant cached properties with name "
+                << *name.object() << std::endl;
     }
-  } else {
-    is_const = false;
+    props_for_name.clear();
   }
 
   if (v8_flags.trace_maglev_graph_building) {
@@ -3321,37 +4449,48 @@ void MaglevGraphBuilder::RecordKnownProperty(
               << "] = " << PrintNodeLabel(graph_labeller(), value) << ": "
               << PrintNode(graph_labeller(), value) << std::endl;
   }
-  auto& loaded_properties =
-      is_const ? known_node_aspects().loaded_constant_properties
-               : known_node_aspects().loaded_properties;
-  loaded_properties[std::make_pair(lookup_start_object, name)] = value;
+
+  props_for_name[lookup_start_object] = value;
 }
 
-bool MaglevGraphBuilder::TryReuseKnownPropertyLoad(
+namespace {
+ReduceResult TryFindLoadedProperty(
+    const KnownNodeAspects::LoadedPropertyMap& loaded_properties,
     ValueNode* lookup_start_object, compiler::NameRef name) {
-  if (auto it = known_node_aspects().loaded_properties.find(
-          {lookup_start_object, name});
-      it != known_node_aspects().loaded_properties.end()) {
-    current_interpreter_frame_.set_accumulator(it->second);
-    if (v8_flags.trace_maglev_graph_building) {
+  auto props_for_name = loaded_properties.find(name);
+  if (props_for_name == loaded_properties.end()) return ReduceResult::Fail();
+
+  auto it = props_for_name->second.find(lookup_start_object);
+  if (it == props_for_name->second.end()) return ReduceResult::Fail();
+
+  return it->second;
+}
+}  // namespace
+
+ReduceResult MaglevGraphBuilder::TryReuseKnownPropertyLoad(
+    ValueNode* lookup_start_object, compiler::NameRef name) {
+  if (ReduceResult result = TryFindLoadedProperty(
+          known_node_aspects().loaded_properties, lookup_start_object, name);
+      result.IsDone()) {
+    if (v8_flags.trace_maglev_graph_building && result.IsDoneWithValue()) {
       std::cout << "  * Reusing non-constant loaded property "
-                << PrintNodeLabel(graph_labeller(), it->second) << ": "
-                << PrintNode(graph_labeller(), it->second) << std::endl;
+                << PrintNodeLabel(graph_labeller(), result.value()) << ": "
+                << PrintNode(graph_labeller(), result.value()) << std::endl;
     }
-    return true;
+    return result;
   }
-  if (auto it = known_node_aspects().loaded_constant_properties.find(
-          {lookup_start_object, name});
-      it != known_node_aspects().loaded_constant_properties.end()) {
-    current_interpreter_frame_.set_accumulator(it->second);
-    if (v8_flags.trace_maglev_graph_building) {
+  if (ReduceResult result =
+          TryFindLoadedProperty(known_node_aspects().loaded_constant_properties,
+                                lookup_start_object, name);
+      result.IsDone()) {
+    if (v8_flags.trace_maglev_graph_building && result.IsDoneWithValue()) {
       std::cout << "  * Reusing constant loaded property "
-                << PrintNodeLabel(graph_labeller(), it->second) << ": "
-                << PrintNode(graph_labeller(), it->second) << std::endl;
+                << PrintNodeLabel(graph_labeller(), result.value()) << ": "
+                << PrintNode(graph_labeller(), result.value()) << std::endl;
     }
-    return true;
+    return result;
   }
-  return false;
+  return ReduceResult::Fail();
 }
 
 void MaglevGraphBuilder::VisitGetNamedProperty() {
@@ -3367,17 +4506,17 @@ void MaglevGraphBuilder::VisitGetNamedProperty() {
 
   switch (processed_feedback.kind()) {
     case compiler::ProcessedFeedback::kInsufficient:
-      EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess);
-      return;
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess));
 
     case compiler::ProcessedFeedback::kNamedAccess: {
-      if (TryReuseKnownPropertyLoad(object, name)) return;
-      ReduceResult result = TryBuildNamedAccess(
+      ReduceResult result = TryReuseKnownPropertyLoad(object, name);
+      PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
+
+      result = TryBuildNamedAccess(
           object, object, processed_feedback.AsNamedAccess(), feedback_source,
           compiler::AccessMode::kLoad);
-      PROCESS_AND_RETURN_IF_DONE(
-          result, [&](ValueNode* value) { SetAccumulator(value); });
+      PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
       break;
     }
     default:
@@ -3390,6 +4529,30 @@ void MaglevGraphBuilder::VisitGetNamedProperty() {
       AddNewNode<LoadNamedGeneric>({context, object}, name, feedback_source));
 }
 
+ValueNode* MaglevGraphBuilder::GetConstant(compiler::ObjectRef ref) {
+  if (ref.IsSmi()) return GetSmiConstant(ref.AsSmi());
+  compiler::HeapObjectRef constant = ref.AsHeapObject();
+
+  if (IsThinString(*constant.object())) {
+    constant = MakeRefAssumeMemoryFence(
+        broker(), ThinString::cast(*constant.object())->actual());
+  }
+
+  auto root_index = broker()->FindRootIndex(constant);
+  if (root_index.has_value()) {
+    return GetRootConstant(*root_index);
+  }
+
+  auto it = graph_->constants().find(constant);
+  if (it == graph_->constants().end()) {
+    Constant* node = CreateNewConstantNode<Constant>(0, constant);
+    if (has_graph_labeller()) graph_labeller()->RegisterNode(node);
+    graph_->constants().emplace(constant, node);
+    return node;
+  }
+  return it->second;
+}
+
 void MaglevGraphBuilder::VisitGetNamedPropertyFromSuper() {
   // GetNamedPropertyFromSuper <receiver> <name_index> <slot>
   ValueNode* receiver = LoadRegisterTagged(0);
@@ -3410,17 +4573,18 @@ void MaglevGraphBuilder::VisitGetNamedPropertyFromSuper() {
 
   switch (processed_feedback.kind()) {
     case compiler::ProcessedFeedback::kInsufficient:
-      EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess);
-      return;
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess));
 
     case compiler::ProcessedFeedback::kNamedAccess: {
-      if (TryReuseKnownPropertyLoad(lookup_start_object, name)) return;
-      ReduceResult result = TryBuildNamedAccess(
+      ReduceResult result =
+          TryReuseKnownPropertyLoad(lookup_start_object, name);
+      PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
+
+      result = TryBuildNamedAccess(
           receiver, lookup_start_object, processed_feedback.AsNamedAccess(),
           feedback_source, compiler::AccessMode::kLoad);
-      PROCESS_AND_RETURN_IF_DONE(
-          result, [&](ValueNode* value) { SetAccumulator(value); });
+      PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
       break;
     }
     default:
@@ -3469,9 +4633,8 @@ void MaglevGraphBuilder::VisitGetKeyedProperty() {
 
   switch (processed_feedback.kind()) {
     case compiler::ProcessedFeedback::kInsufficient:
-      EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForGenericKeyedAccess);
-      return;
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForGenericKeyedAccess));
 
     case compiler::ProcessedFeedback::kElementAccess: {
       // Get the accumulator without conversion. TryBuildElementAccess
@@ -3479,21 +4642,22 @@ void MaglevGraphBuilder::VisitGetKeyedProperty() {
       ValueNode* index = current_interpreter_frame_.accumulator();
       ReduceResult result = TryBuildElementAccess(
           object, index, processed_feedback.AsElementAccess(), feedback_source);
-      PROCESS_AND_RETURN_IF_DONE(
-          result, [&](ValueNode* value) { SetAccumulator(value); });
+      PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
       break;
     }
 
     case compiler::ProcessedFeedback::kNamedAccess: {
       ValueNode* key = GetAccumulatorTagged();
       compiler::NameRef name = processed_feedback.AsNamedAccess().name();
-      if (BuildCheckValue(key, name).IsDoneWithAbort()) return;
-      if (TryReuseKnownPropertyLoad(object, name)) return;
-      ReduceResult result = TryBuildNamedAccess(
+      RETURN_VOID_IF_ABORT(BuildCheckValue(key, name));
+
+      ReduceResult result = TryReuseKnownPropertyLoad(object, name);
+      PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
+
+      result = TryBuildNamedAccess(
           object, object, processed_feedback.AsNamedAccess(), feedback_source,
           compiler::AccessMode::kLoad);
-      PROCESS_AND_RETURN_IF_DONE(
-          result, [&](ValueNode* value) { SetAccumulator(value); });
+      PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
       break;
     }
 
@@ -3501,7 +4665,7 @@ void MaglevGraphBuilder::VisitGetKeyedProperty() {
       break;
   }
 
-  // Create a generic store in the fallthrough.
+  // Create a generic load in the fallthrough.
   ValueNode* context = GetContext();
   ValueNode* key = GetAccumulatorTagged();
   SetAccumulator(
@@ -3594,14 +4758,16 @@ void MaglevGraphBuilder::BuildLoadGlobal(
   const compiler::ProcessedFeedback& access_feedback =
       broker()->GetFeedbackForGlobalAccess(feedback_source);
 
-  if (!access_feedback.IsInsufficient()) {
-    const compiler::GlobalAccessFeedback& global_access_feedback =
-        access_feedback.AsGlobalAccess();
-
-    if (TryBuildScriptContextAccess(global_access_feedback)) return;
-    if (TryBuildPropertyCellAccess(global_access_feedback)) return;
+  if (access_feedback.IsInsufficient()) {
+    RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForGenericGlobalAccess));
   }
 
+  const compiler::GlobalAccessFeedback& global_access_feedback =
+      access_feedback.AsGlobalAccess();
+  PROCESS_AND_RETURN_IF_DONE(TryBuildGlobalLoad(global_access_feedback),
+                             SetAccumulator);
+
   ValueNode* context = GetContext();
   SetAccumulator(
       AddNewNode<LoadGlobal>({context}, name, feedback_source, typeof_mode));
@@ -3620,17 +4786,13 @@ void MaglevGraphBuilder::VisitSetNamedProperty() {
 
   switch (processed_feedback.kind()) {
     case compiler::ProcessedFeedback::kInsufficient:
-      EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess);
-      return;
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess));
 
     case compiler::ProcessedFeedback::kNamedAccess:
-      if (TryBuildNamedAccess(object, object,
-                              processed_feedback.AsNamedAccess(),
-                              feedback_source, compiler::AccessMode::kStore)
-              .IsDone()) {
-        return;
-      }
+      RETURN_VOID_IF_DONE(TryBuildNamedAccess(
+          object, object, processed_feedback.AsNamedAccess(), feedback_source,
+          compiler::AccessMode::kStore));
       break;
     default:
       break;
@@ -3655,17 +4817,13 @@ void MaglevGraphBuilder::VisitDefineNamedOwnProperty() {
 
   switch (processed_feedback.kind()) {
     case compiler::ProcessedFeedback::kInsufficient:
-      EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess);
-      return;
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForGenericNamedAccess));
 
     case compiler::ProcessedFeedback::kNamedAccess:
-      if (TryBuildNamedAccess(object, object,
-                              processed_feedback.AsNamedAccess(),
-                              feedback_source, compiler::AccessMode::kDefine)
-              .IsDone()) {
-        return;
-      }
+      RETURN_VOID_IF_DONE(TryBuildNamedAccess(
+          object, object, processed_feedback.AsNamedAccess(), feedback_source,
+          compiler::AccessMode::kDefine));
       break;
 
     default:
@@ -3691,21 +4849,17 @@ void MaglevGraphBuilder::VisitSetKeyedProperty() {
 
   switch (processed_feedback.kind()) {
     case compiler::ProcessedFeedback::kInsufficient:
-      EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForGenericKeyedAccess);
-      return;
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForGenericKeyedAccess));
 
     case compiler::ProcessedFeedback::kElementAccess: {
       // Get the key without conversion. TryBuildElementAccess will try to pick
       // the best representation.
       ValueNode* index =
           current_interpreter_frame_.get(iterator_.GetRegisterOperand(1));
-      if (TryBuildElementAccess(object, index,
-                                processed_feedback.AsElementAccess(),
-                                feedback_source)
-              .IsDone()) {
-        return;
-      }
+      RETURN_VOID_IF_DONE(TryBuildElementAccess(
+          object, index, processed_feedback.AsElementAccess(),
+          feedback_source));
     } break;
 
     default:
@@ -3737,9 +4891,9 @@ void MaglevGraphBuilder::VisitDefineKeyedOwnProperty() {
 }
 
 void MaglevGraphBuilder::VisitStaInArrayLiteral() {
-  // StaInArrayLiteral <object> <name_reg> <slot>
+  // StaInArrayLiteral <object> <index> <slot>
   ValueNode* object = LoadRegisterTagged(0);
-  ValueNode* name = LoadRegisterTagged(1);
+  ValueNode* index = LoadRegisterRaw(1);
   FeedbackSlot slot = GetSlotOperand(2);
   compiler::FeedbackSource feedback_source{feedback(), slot};
 
@@ -3750,9 +4904,15 @@ void MaglevGraphBuilder::VisitStaInArrayLiteral() {
 
   switch (processed_feedback.kind()) {
     case compiler::ProcessedFeedback::kInsufficient:
-      EmitUnconditionalDeopt(
-          DeoptimizeReason::kInsufficientTypeFeedbackForGenericKeyedAccess);
-      return;
+      RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+          DeoptimizeReason::kInsufficientTypeFeedbackForGenericKeyedAccess));
+
+    case compiler::ProcessedFeedback::kElementAccess: {
+      RETURN_VOID_IF_DONE(TryBuildElementAccess(
+          object, index, processed_feedback.AsElementAccess(),
+          feedback_source));
+      break;
+    }
 
     default:
       break;
@@ -3761,8 +4921,8 @@ void MaglevGraphBuilder::VisitStaInArrayLiteral() {
   // Create a generic store in the fallthrough.
   ValueNode* context = GetContext();
   ValueNode* value = GetAccumulatorTagged();
-  AddNewNode<StoreInArrayLiteralGeneric>({context, object, name, value},
-                                         feedback_source);
+  AddNewNode<StoreInArrayLiteralGeneric>(
+      {context, object, GetTaggedValue(index), value}, feedback_source);
 }
 
 void MaglevGraphBuilder::VisitDefineKeyedOwnPropertyInLiteral() {
@@ -3770,7 +4930,7 @@ void MaglevGraphBuilder::VisitDefineKeyedOwnPropertyInLiteral() {
   ValueNode* name = LoadRegisterTagged(1);
   ValueNode* value = GetAccumulatorTagged();
   ValueNode* flags = GetSmiConstant(GetFlag8Operand(2));
-  ValueNode* slot = GetSmiConstant(GetSlotOperand(3).ToInt());
+  ValueNode* slot = GetTaggedIndexConstant(GetSlotOperand(3).ToInt());
   ValueNode* feedback_vector = GetConstant(feedback());
   BuildCallRuntime(Runtime::kDefineKeyedOwnPropertyInLiteral,
                    {object, name, value, flags, feedback_vector, slot});
@@ -3862,20 +5022,7 @@ void MaglevGraphBuilder::VisitBitwiseNot() {
 }
 
 void MaglevGraphBuilder::VisitToBooleanLogicalNot() {
-  ValueNode* value = GetAccumulatorTagged();
-  switch (value->opcode()) {
-#define CASE(Name)                                                             \
-  case Opcode::k##Name: {                                                      \
-    SetAccumulator(                                                            \
-        GetBooleanConstant(!value->Cast<Name>()->ToBoolean(local_isolate()))); \
-    break;                                                                     \
-  }
-    CONSTANT_VALUE_NODE_LIST(CASE)
-#undef CASE
-    default:
-      SetAccumulator(AddNewNode<ToBooleanLogicalNot>({value}));
-      break;
-  }
+  SetAccumulator(BuildToBoolean</* flip */ true>(GetRawAccumulator()));
 }
 
 void MaglevGraphBuilder::VisitLogicalNot() {
@@ -3919,35 +5066,137 @@ void MaglevGraphBuilder::VisitDeletePropertySloppy() {
 
 void MaglevGraphBuilder::VisitGetSuperConstructor() {
   ValueNode* active_function = GetAccumulatorTagged();
-  ValueNode* map =
-      AddNewNode<LoadTaggedField>({active_function}, HeapObject::kMapOffset);
-  ValueNode* map_proto =
-      AddNewNode<LoadTaggedField>({map}, Map::kPrototypeOffset);
+  ValueNode* map_proto;
+  if (compiler::OptionalHeapObjectRef constant =
+          TryGetConstant(active_function)) {
+    map_proto = GetConstant(constant->map(broker()).prototype(broker()));
+  } else {
+    ValueNode* map =
+        AddNewNode<LoadTaggedField>({active_function}, HeapObject::kMapOffset);
+    map_proto = AddNewNode<LoadTaggedField>({map}, Map::kPrototypeOffset);
+  }
   StoreRegister(iterator_.GetRegisterOperand(0), map_proto);
 }
 
+bool MaglevGraphBuilder::HasValidInitialMap(
+    compiler::JSFunctionRef new_target, compiler::JSFunctionRef constructor) {
+  if (!new_target.map(broker()).has_prototype_slot()) return false;
+  if (!new_target.has_initial_map(broker())) return false;
+  compiler::MapRef initial_map = new_target.initial_map(broker());
+  return initial_map.GetConstructor(broker()).equals(constructor);
+}
+
+bool MaglevGraphBuilder::TryBuildFindNonDefaultConstructorOrConstruct(
+    ValueNode* this_function, ValueNode* new_target,
+    std::pair<interpreter::Register, interpreter::Register> result) {
+  // See also:
+  // JSNativeContextSpecialization::ReduceJSFindNonDefaultConstructorOrConstruct
+
+  compiler::OptionalHeapObjectRef maybe_constant =
+      TryGetConstant(this_function);
+  if (!maybe_constant) return false;
+
+  compiler::MapRef function_map = maybe_constant->map(broker());
+  compiler::HeapObjectRef current = function_map.prototype(broker());
+
+  // TODO(v8:13091): Don't produce incomplete stack traces when debug is active.
+  // We already deopt when a breakpoint is set. But it would be even nicer to
+  // avoid producting incomplete stack traces when when debug is active, even if
+  // there are no breakpoints - then a user inspecting stack traces via Dev
+  // Tools would always see the full stack trace.
+
+  while (true) {
+    if (!current.IsJSFunction()) return false;
+    compiler::JSFunctionRef current_function = current.AsJSFunction();
+
+    // If there are class fields, bail out. TODO(v8:13091): Handle them here.
+    if (current_function.shared(broker())
+            .requires_instance_members_initializer()) {
+      return false;
+    }
+
+    // If there are private methods, bail out. TODO(v8:13091): Handle them here.
+    if (current_function.context(broker())
+            .scope_info(broker())
+            .ClassScopeHasPrivateBrand()) {
+      return false;
+    }
+
+    FunctionKind kind = current_function.shared(broker()).kind();
+    if (kind != FunctionKind::kDefaultDerivedConstructor) {
+      // The hierarchy walk will end here; this is the last change to bail out
+      // before creating new nodes.
+      if (!broker()->dependencies()->DependOnArrayIteratorProtector()) {
+        return false;
+      }
+
+      compiler::OptionalHeapObjectRef new_target_function =
+          TryGetConstant(new_target);
+      if (kind == FunctionKind::kDefaultBaseConstructor) {
+        // Store the result register first, so that a lazy deopt in
+        // `FastNewObject` writes `true` to this register.
+        StoreRegister(result.first, GetBooleanConstant(true));
+
+        ValueNode* object;
+        if (new_target_function && new_target_function->IsJSFunction() &&
+            HasValidInitialMap(new_target_function->AsJSFunction(),
+                               current_function)) {
+          object = BuildAllocateFastObject(
+              FastObject(new_target_function->AsJSFunction(), zone(), broker()),
+              AllocationType::kYoung);
+        } else {
+          object = BuildCallBuiltin<Builtin::kFastNewObject>(
+              {GetConstant(current_function), new_target});
+          // We've already stored "true" into result.first, so a deopt here just
+          // has to store result.second.
+          object->lazy_deopt_info()->UpdateResultLocation(result.second, 1);
+        }
+        StoreRegister(result.second, object);
+      } else {
+        StoreRegister(result.first, GetBooleanConstant(false));
+        StoreRegister(result.second, GetConstant(current));
+      }
+
+      broker()->dependencies()->DependOnStablePrototypeChain(
+          function_map, WhereToStart::kStartAtReceiver, current_function);
+      return true;
+    }
+
+    // Keep walking up the class tree.
+    current = current_function.map(broker()).prototype(broker());
+  }
+}
+
 void MaglevGraphBuilder::VisitFindNonDefaultConstructorOrConstruct() {
   ValueNode* this_function = LoadRegisterTagged(0);
   ValueNode* new_target = LoadRegisterTagged(1);
 
-  CallBuiltin* call_builtin =
+  auto register_pair = iterator_.GetRegisterPairOperand(2);
+
+  if (TryBuildFindNonDefaultConstructorOrConstruct(this_function, new_target,
+                                                   register_pair)) {
+    return;
+  }
+
+  CallBuiltin* result =
       BuildCallBuiltin<Builtin::kFindNonDefaultConstructorOrConstruct>(
           {this_function, new_target});
-  auto result = iterator_.GetRegisterPairOperand(2);
-  StoreRegisterPair(result, call_builtin);
+  StoreRegisterPair(register_pair, result);
 }
 
-ReduceResult MaglevGraphBuilder::BuildInlined(const CallArguments& args,
-                                              BasicBlockRef* start_ref,
-                                              BasicBlockRef* end_ref) {
+ReduceResult MaglevGraphBuilder::BuildInlined(ValueNode* context,
+                                              ValueNode* function,
+                                              ValueNode* new_target,
+                                              const CallArguments& args) {
   DCHECK(is_inline());
 
   // Manually create the prologue of the inner function graph, so that we
   // can manually set up the arguments.
-  StartPrologue();
+  DCHECK_NOT_NULL(current_block_);
 
   // Set receiver.
-  ValueNode* receiver = GetConvertReceiver(function(), args);
+  ValueNode* receiver =
+      GetRawConvertReceiver(compilation_unit_->shared_function_info(), args);
   SetArgument(0, receiver);
   // Set remaining arguments.
   RootConstant* undefined_constant =
@@ -3963,45 +5212,38 @@ ReduceResult MaglevGraphBuilder::BuildInlined(const CallArguments& args,
       compilation_unit_->shared_function_info()
           .internal_formal_parameter_count_without_receiver();
   if (arg_count != formal_parameter_count) {
-    inlined_arguments_.emplace(zone()->NewVector<ValueNode*>(arg_count + 1));
+    inlined_arguments_.emplace(
+        zone()->AllocateVector<ValueNode*>(arg_count + 1));
     (*inlined_arguments_)[0] = receiver;
     for (int i = 0; i < arg_count; i++) {
       (*inlined_arguments_)[i + 1] = args[i];
     }
   }
+  inlined_new_target_ = new_target;
 
-  BuildRegisterFrameInitialization(GetConstant(function().context(broker())),
-                                   GetConstant(function()));
+  BuildRegisterFrameInitialization(context, function, new_target);
   BuildMergeStates();
-  BasicBlock* inlined_prologue = EndPrologue();
-
-  // Set the entry JumpToInlined to jump to the prologue block.
-  // TODO(leszeks): Passing start_ref to JumpToInlined creates a two-element
-  // linked list of refs. Consider adding a helper to explicitly set the target
-  // instead.
-  start_ref->SetToBlockAndReturnNext(inlined_prologue)
-      ->SetToBlockAndReturnNext(inlined_prologue);
+  EndPrologue();
 
   // Build the inlined function body.
   BuildBody();
 
-  // All returns in the inlined body jump to a merge point one past the
-  // bytecode length (i.e. at offset bytecode.length()). Create a block at
-  // this fake offset and have it jump out of the inlined function, into a new
-  // block that we create which resumes execution of the outer function.
-  // TODO(leszeks): Wrap this up in a helper.
-  DCHECK_NULL(current_block_);
-
-  // If we don't have a merge state at the inline_exit_offset, then there is no
-  // control flow that reaches the end of the inlined function, either because
-  // of infinite loops or deopts
-  if (merge_states_[inline_exit_offset()] == nullptr) {
-    return ReduceResult::DoneWithAbort();
-  }
+  // All returns in the inlined body jump to a merge point one past the bytecode
+  // length (i.e. at offset bytecode.length()). If there isn't one already,
+  // create a block at this fake offset and have it jump out of the inlined
+  // function, into a new block that we create which resumes execution of the
+  // outer function.
+  if (!current_block_) {
+    // If we don't have a merge state at the inline_exit_offset, then there is
+    // no control flow that reaches the end of the inlined function, either
+    // because of infinite loops or deopts
+    if (merge_states_[inline_exit_offset()] == nullptr) {
+      return ReduceResult::DoneWithAbort();
+    }
 
-  ProcessMergePoint(inline_exit_offset());
-  StartNewBlock(inline_exit_offset());
-  FinishBlock<JumpFromInlined>({}, end_ref);
+    ProcessMergePoint(inline_exit_offset());
+    StartNewBlock(inline_exit_offset(), /*predecessor*/ nullptr);
+  }
 
   // Pull the returned accumulator value out of the inlined function's final
   // merged return state.
@@ -4017,26 +5259,32 @@ ReduceResult MaglevGraphBuilder::BuildInlined(const CallArguments& args,
 #define TRACE_CANNOT_INLINE(...) \
   TRACE_INLINING("  cannot inline " << shared << ": " << __VA_ARGS__)
 
-bool MaglevGraphBuilder::ShouldInlineCall(compiler::JSFunctionRef function,
-                                          float call_frequency) {
-  compiler::OptionalCodeRef code = function.code(broker());
-  compiler::SharedFunctionInfoRef shared = function.shared(broker());
+bool MaglevGraphBuilder::ShouldInlineCall(
+    compiler::SharedFunctionInfoRef shared,
+    compiler::OptionalFeedbackVectorRef feedback_vector, float call_frequency) {
   if (graph()->total_inlined_bytecode_size() >
       v8_flags.max_maglev_inlined_bytecode_size_cumulative) {
     TRACE_CANNOT_INLINE("maximum inlined bytecode size");
     return false;
   }
-  if (!code) {
+  if (!feedback_vector) {
     // TODO(verwaest): Soft deopt instead?
-    TRACE_CANNOT_INLINE("it has not been compiled yet");
+    TRACE_CANNOT_INLINE("it has not been compiled/run with feedback yet");
     return false;
   }
-  if (code->object()->kind() == CodeKind::TURBOFAN) {
-    TRACE_CANNOT_INLINE("already turbofanned");
+  // TODO(olivf): This is a temporary stopgap to prevent infinite recursion when
+  // inlining, because we currently excempt small functions from some of the
+  // negative heuristics. We should refactor these heuristics and make sure they
+  // make sense in the presence of (mutually) recursive inlining. Please do
+  // *not* return true before this check.
+  if (inlining_depth() > v8_flags.max_maglev_hard_inline_depth) {
+    TRACE_CANNOT_INLINE("inlining depth ("
+                        << inlining_depth() << ") >= hard-max-depth ("
+                        << v8_flags.max_maglev_hard_inline_depth << ")");
     return false;
   }
-  if (!function.feedback_vector(broker()).has_value()) {
-    TRACE_CANNOT_INLINE("no feedback vector");
+  if (compilation_unit_->shared_function_info().equals(shared)) {
+    TRACE_CANNOT_INLINE("direct recursion");
     return false;
   }
   SharedFunctionInfo::Inlineability inlineability =
@@ -4076,7 +5324,9 @@ bool MaglevGraphBuilder::ShouldInlineCall(compiler::JSFunctionRef function,
     return false;
   }
   if (bytecode.length() < v8_flags.max_maglev_inlined_bytecode_size_small) {
-    TRACE_INLINING("  inlining " << shared << ": small function");
+    TRACE_INLINING("  inlining "
+                   << shared
+                   << ": small function, skipping max-size and max-depth");
     return true;
   }
   if (bytecode.length() > v8_flags.max_maglev_inlined_bytecode_size) {
@@ -4094,14 +5344,16 @@ bool MaglevGraphBuilder::ShouldInlineCall(compiler::JSFunctionRef function,
   TRACE_INLINING("  inlining " << shared);
   if (v8_flags.trace_maglev_inlining_verbose) {
     BytecodeArray::Disassemble(bytecode.object(), std::cout);
-    function.feedback_vector(broker())->object()->Print(std::cout);
+    i::Print(*feedback_vector->object(), std::cout);
   }
   graph()->add_inlined_bytecode_size(bytecode.length());
   return true;
 }
 
 ReduceResult MaglevGraphBuilder::TryBuildInlinedCall(
-    compiler::JSFunctionRef function, CallArguments& args,
+    ValueNode* context, ValueNode* function, ValueNode* new_target,
+    compiler::SharedFunctionInfoRef shared,
+    compiler::OptionalFeedbackVectorRef feedback_vector, CallArguments& args,
     const compiler::FeedbackSource& feedback_source) {
   DCHECK_EQ(args.mode(), CallArguments::kDefault);
   float feedback_frequency = 0.0f;
@@ -4112,65 +5364,355 @@ ReduceResult MaglevGraphBuilder::TryBuildInlinedCall(
         feedback.IsInsufficient() ? 0.0f : feedback.AsCall().frequency();
   }
   float call_frequency = feedback_frequency * call_frequency_;
-  if (!ShouldInlineCall(function, call_frequency)) {
+  if (!ShouldInlineCall(shared, feedback_vector, call_frequency)) {
     return ReduceResult::Fail();
   }
 
-  compiler::BytecodeArrayRef bytecode =
-      function.shared(broker()).GetBytecodeArray(broker());
+  if (v8_flags.trace_maglev_graph_building) {
+    std::cout << "== Inlining " << shared.object() << std::endl;
+  }
+
+  compiler::BytecodeArrayRef bytecode = shared.GetBytecodeArray(broker());
   graph()->inlined_functions().push_back(
       OptimizedCompilationInfo::InlinedFunctionHolder(
-          function.shared(broker()).object(), bytecode.object(),
-          current_source_position_));
+          shared.object(), bytecode.object(), current_source_position_));
+  int inlining_id = static_cast<int>(graph()->inlined_functions().size() - 1);
 
   // Create a new compilation unit and graph builder for the inlined
   // function.
-  MaglevCompilationUnit* inner_unit =
-      MaglevCompilationUnit::NewInner(zone(), compilation_unit_, function);
+  MaglevCompilationUnit* inner_unit = MaglevCompilationUnit::NewInner(
+      zone(), compilation_unit_, shared, feedback_vector.value());
   MaglevGraphBuilder inner_graph_builder(
       local_isolate_, inner_unit, graph_, call_frequency,
-      BytecodeOffset(iterator_.current_offset()), this);
+      BytecodeOffset(iterator_.current_offset()), inlining_id, this);
 
   // Propagate catch block.
-  inner_graph_builder.parent_catch_block_ = GetCurrentTryCatchBlockOffset();
+  inner_graph_builder.parent_catch_ = GetCurrentTryCatchBlock();
 
-  // Finish the current block with a jump to the inlined function.
-  BasicBlockRef start_ref, end_ref;
-  BasicBlock* block = FinishBlock<JumpToInlined>({}, &start_ref, inner_unit);
+  // Set the inner graph builder to build in the current block.
+  inner_graph_builder.current_block_ = current_block_;
 
   ReduceResult result =
-      inner_graph_builder.BuildInlined(args, &start_ref, &end_ref);
+      inner_graph_builder.BuildInlined(context, function, new_target, args);
   if (result.IsDoneWithAbort()) {
-    MarkBytecodeDead();
+    DCHECK_NULL(inner_graph_builder.current_block_);
+    current_block_ = nullptr;
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cout << "== Finished inlining (abort) " << shared.object()
+                << std::endl;
+    }
     return ReduceResult::DoneWithAbort();
   }
-  DCHECK(result.IsDoneWithValue());
 
   // Propagate KnownNodeAspects back to the caller.
   current_interpreter_frame_.set_known_node_aspects(
       inner_graph_builder.current_interpreter_frame_.known_node_aspects());
 
-  // Create a new block at our current offset, and resume execution. Do this
-  // manually to avoid trying to resolve any merges to this offset, which will
-  // have already been processed on entry to this visitor.
-  current_block_ = zone()->New<BasicBlock>(MergePointInterpreterFrameState::New(
-      *compilation_unit_, current_interpreter_frame_,
-      iterator_.current_offset(), 1, block, GetInLiveness()));
-  // Set the exit JumpFromInlined to jump to this resume block.
-  // TODO(leszeks): Passing start_ref to JumpFromInlined creates a two-element
-  // linked list of refs. Consider adding a helper to explicitly set the
-  // target instead.
-  end_ref.SetToBlockAndReturnNext(current_block_)
-      ->SetToBlockAndReturnNext(current_block_);
+  DCHECK(result.IsDoneWithValue());
+  // Resume execution using the final block of the inner builder.
+  current_block_ = inner_graph_builder.current_block_;
 
+  if (v8_flags.trace_maglev_graph_building) {
+    std::cout << "== Finished inlining " << shared.object() << std::endl;
+  }
   return result;
 }
 
+namespace {
+
+bool CanInlineArrayIteratingBuiltin(compiler::JSHeapBroker* broker,
+                                    const PossibleMaps& maps,
+                                    ElementsKind* kind_return) {
+  DCHECK_NE(0, maps.size());
+  *kind_return = maps.at(0).elements_kind();
+  for (compiler::MapRef map : maps) {
+    if (!map.supports_fast_array_iteration(broker) ||
+        !UnionElementsKindUptoSize(kind_return, map.elements_kind())) {
+      return false;
+    }
+  }
+  return true;
+}
+
+}  // namespace
+
+ReduceResult MaglevGraphBuilder::TryReduceArrayForEach(
+    compiler::JSFunctionRef target, CallArguments& args) {
+  ValueNode* receiver = args.receiver();
+  if (!receiver) return ReduceResult::Fail();
+
+  if (args.count() < 1) {
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cout << "  ! Failed to reduce Array.prototype.forEach - not enough "
+                   "arguments"
+                << std::endl;
+    }
+    return ReduceResult::Fail();
+  }
+
+  auto node_info = known_node_aspects().TryGetInfoFor(receiver);
+  if (!node_info || !node_info->possible_maps_are_known()) {
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cout << "  ! Failed to reduce Array.prototype.forEach - receiver "
+                   "map is unknown"
+                << std::endl;
+    }
+    return ReduceResult::Fail();
+  }
+
+  ElementsKind elements_kind;
+  if (!CanInlineArrayIteratingBuiltin(broker(), node_info->possible_maps(),
+                                      &elements_kind)) {
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cout << "  ! Failed to reduce Array.prototype.forEach - doesn't "
+                   "support fast array iteration or incompatible maps"
+                << std::endl;
+    }
+    return ReduceResult::Fail();
+  }
+
+  // TODO(leszeks): May only be needed for holey elements kinds.
+  if (!broker()->dependencies()->DependOnNoElementsProtector()) {
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cout << "  ! Failed to reduce Array.prototype.forEach - invalidated "
+                   "no elements protector"
+                << std::endl;
+    }
+    return ReduceResult::Fail();
+  }
+
+  ValueNode* callback = args[0];
+  if (!callback->is_tagged()) {
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cout << "  ! Failed to reduce Array.prototype.forEach - callback is "
+                   "untagged value"
+                << std::endl;
+    }
+    return ReduceResult::Fail();
+  }
+
+  ValueNode* this_arg =
+      args.count() > 1 ? args[1] : GetRootConstant(RootIndex::kUndefinedValue);
+
+  ValueNode* original_length = BuildLoadJSArrayLength(receiver).value();
+
+  // Elide the callable check if the node is known callable.
+  EnsureType(callback, NodeType::kCallable, [&](NodeType old_type) {
+    // ThrowIfNotCallable is wrapped in a lazy_deopt_scope to make sure the
+    // exception has the right call stack.
+    DeoptFrameScope lazy_deopt_scope(
+        this, Builtin::kArrayForEachLoopLazyDeoptContinuation, target,
+        base::VectorOf<ValueNode*>({receiver, callback, this_arg,
+                                    GetSmiConstant(0), original_length}));
+    AddNewNode<ThrowIfNotCallable>({callback});
+  });
+
+  ValueNode* original_length_int32 = GetInt32(original_length);
+
+  // Remember the receiver map set before entering the loop the call.
+  bool receiver_maps_were_unstable = node_info->possible_maps_are_unstable();
+  PossibleMaps receiver_maps_before_loop(node_info->possible_maps());
+
+  // Create a sub graph builder with one variable (for the index)
+  MaglevSubGraphBuilder sub_builder(this, 1);
+  MaglevSubGraphBuilder::Variable var_index(0);
+
+  MaglevSubGraphBuilder::Label loop_end(&sub_builder, 1);
+
+  // ```
+  // index = 0
+  // bind loop_header
+  // ```
+  sub_builder.set(var_index, GetSmiConstant(0));
+  MaglevSubGraphBuilder::LoopLabel loop_header =
+      sub_builder.BeginLoop({&var_index});
+
+  // Reset known state that is cleared by BeginLoop, but is known to be true on
+  // the first iteration, and will be re-checked at the end of the loop.
+
+  // Reset the known receiver maps if necessary.
+  if (receiver_maps_were_unstable) {
+    node_info->SetPossibleMaps(receiver_maps_before_loop,
+                               receiver_maps_were_unstable,
+                               // Node type is monotonic, no need to reset it.
+                               NodeType::kUnknown);
+    known_node_aspects().any_map_for_any_node_is_unstable = true;
+  } else {
+    DCHECK_EQ(node_info->possible_maps().size(),
+              receiver_maps_before_loop.size());
+  }
+  // Reset the cached loaded array length to the original length.
+  RecordKnownProperty(receiver, broker()->length_string(), original_length,
+                      false, compiler::AccessMode::kLoad);
+
+  // ```
+  // if (index_int32 < length_int32)
+  //   fallthrough
+  // else
+  //   goto end
+  // ```
+  Phi* index_tagged = sub_builder.get(var_index)->Cast<Phi>();
+  EnsureType(index_tagged, NodeType::kSmi);
+  ValueNode* index_int32 = GetInt32(index_tagged);
+
+  sub_builder.GotoIfFalse<BranchIfInt32Compare>(
+      &loop_end, {index_int32, original_length_int32}, Operation::kLessThan);
+
+  // ```
+  // next_index = index + 1
+  // ```
+  ValueNode* next_index_int32 =
+      AddNewNode<Int32IncrementWithOverflow>({index_int32});
+  EnsureType(next_index_int32, NodeType::kSmi);
+  // TODO(leszeks): Assert Smi.
+
+  // ```
+  // element = array.elements[index]
+  // ```
+  ValueNode* elements =
+      AddNewNode<LoadTaggedField>({receiver}, JSArray::kElementsOffset);
+  ValueNode* element;
+  if (IsDoubleElementsKind(elements_kind)) {
+    element = AddNewNode<LoadFixedDoubleArrayElement>({elements, index_int32});
+  } else {
+    element = AddNewNode<LoadFixedArrayElement>({elements, index_int32});
+  }
+
+  base::Optional<MaglevSubGraphBuilder::Label> skip_call;
+  if (IsHoleyElementsKind(elements_kind)) {
+    // ```
+    // if (element is hole) goto skip_call
+    // ```
+    skip_call.emplace(&sub_builder, 2);
+    if (elements_kind == HOLEY_DOUBLE_ELEMENTS) {
+      sub_builder.GotoIfTrue<BranchIfFloat64IsHole>(&*skip_call, {element});
+    } else {
+      sub_builder.GotoIfTrue<BranchIfRootConstant>(&*skip_call, {element},
+                                                   RootIndex::kTheHoleValue);
+    }
+  }
+
+  // ```
+  // callback(this_arg, element, array)
+  // ```
+  ReduceResult result;
+  {
+    // Checkpoint for eager deopts before creating the lazy deopt scope, so that
+    // reduced builtin calls that eager deopt don't pick up the lazy deopt
+    // continuation.
+    GetLatestCheckpointedFrame();
+
+    DeoptFrameScope lazy_deopt_scope(
+        this, Builtin::kArrayForEachLoopLazyDeoptContinuation, target,
+        base::VectorOf<ValueNode*>(
+            {receiver, callback, this_arg, next_index_int32, original_length}));
+
+    CallArguments call_args =
+        args.count() < 2
+            ? CallArguments(ConvertReceiverMode::kNullOrUndefined,
+                            {element, index_tagged, receiver})
+            : CallArguments(ConvertReceiverMode::kAny,
+                            {this_arg, element, index_tagged, receiver});
+
+    compiler::FeedbackSource feedback_source = std::exchange(
+        current_speculation_feedback_, compiler::FeedbackSource());
+    result = ReduceCall(callback, call_args, feedback_source,
+                        SpeculationMode::kAllowSpeculation);
+    current_speculation_feedback_ = feedback_source;
+  }
+
+  // ```
+  // index = next_index
+  // jump loop_header
+  // ```
+  DCHECK_IMPLIES(result.IsDoneWithAbort(), current_block_ == nullptr);
+
+  // If any of the receiver's maps were unstable maps, we have to re-check the
+  // maps on each iteration, in case the callback changed them. That said, we
+  // know that the maps are valid on the first iteration, so we can rotate the
+  // check to _after_ the callback, and then elide it if the receiver maps are
+  // still known to be valid (i.e. the known maps after the call are contained
+  // inside the known maps before the call).
+  bool recheck_maps_after_call = receiver_maps_were_unstable;
+  if (recheck_maps_after_call) {
+    if (current_block_ == nullptr) {
+      // No need to recheck maps if this code is unreachable.
+      recheck_maps_after_call = false;
+    } else {
+      // No need to recheck maps if there are known maps...
+      if (auto receiver_info_after_call =
+              known_node_aspects().TryGetInfoFor(receiver)) {
+        // ... and those known maps are equal to, or a subset of, the maps
+        // before the call.
+        if (receiver_info_after_call &&
+            receiver_info_after_call->possible_maps_are_known()) {
+          recheck_maps_after_call = !receiver_maps_before_loop.contains(
+              receiver_info_after_call->possible_maps());
+        }
+      }
+    }
+  }
+
+  {
+    // Make sure to finish the loop if we eager deopt in the map check or index
+    // check.
+    DeoptFrameScope eager_deopt_scope(
+        this, Builtin::kArrayForEachLoopEagerDeoptContinuation, target,
+        base::VectorOf<ValueNode*>(
+            {receiver, callback, this_arg, next_index_int32, original_length}));
+
+    if (recheck_maps_after_call) {
+      // Build the CheckMap manually, since we're doing it with already known
+      // maps rather than feedback, and we don't need to update known node
+      // aspects or types since we're at the end of the loop anyway.
+      bool emit_check_with_migration = std::any_of(
+          receiver_maps_before_loop.begin(), receiver_maps_before_loop.end(),
+          [](compiler::MapRef map) { return map.is_migration_target(); });
+      if (emit_check_with_migration) {
+        AddNewNode<CheckMapsWithMigration>({receiver},
+                                           receiver_maps_before_loop,
+                                           CheckType::kOmitHeapObjectCheck);
+      } else {
+        AddNewNode<CheckMaps>({receiver}, receiver_maps_before_loop,
+                              CheckType::kOmitHeapObjectCheck);
+      }
+    }
+
+    // Check if the index is still in bounds, in case the callback changed the
+    // length.
+    ValueNode* current_length = BuildLoadJSArrayLength(receiver).value();
+    // Reference compare the loaded length against the original length. If this
+    // is the same value node, then we didn't have any side effects and didn't
+    // clear the cached length.
+    if (current_length != original_length) {
+      AddNewNode<CheckInt32Condition>(
+          {original_length_int32, GetInt32(current_length)},
+          AssertCondition::kUnsignedLessThanEqual,
+          DeoptimizeReason::kArrayLengthChanged);
+    }
+  }
+
+  if (skip_call.has_value()) {
+    sub_builder.Goto(&*skip_call);
+    sub_builder.Bind(&*skip_call);
+  }
+
+  sub_builder.set(var_index, next_index_int32);
+  sub_builder.EndLoop(&loop_header);
+
+  // ```
+  // bind end
+  // ```
+  sub_builder.Bind(&loop_end);
+
+  return GetRootConstant(RootIndex::kUndefinedValue);
+}
+
 ReduceResult MaglevGraphBuilder::TryReduceStringFromCharCode(
     compiler::JSFunctionRef target, CallArguments& args) {
   if (args.count() != 1) return ReduceResult::Fail();
-  return AddNewNode<BuiltinStringFromCharCode>({GetTruncatedInt32FromNumber(
-      args[0], TaggedToFloat64ConversionType::kNumber)});
+  return AddNewNode<BuiltinStringFromCharCode>({GetTruncatedInt32ForToNumber(
+      args[0], ToNumberHint::kAssumeNumberOrOddball)});
 }
 
 ReduceResult MaglevGraphBuilder::TryReduceStringPrototypeCharCodeAt(
@@ -4184,6 +5726,20 @@ ReduceResult MaglevGraphBuilder::TryReduceStringPrototypeCharCodeAt(
     index = GetInt32ElementIndex(args[0]);
   }
   // Any other argument is ignored.
+
+  // Try to constant-fold if receiver and index are constant
+  if (auto cst = TryGetConstant(receiver)) {
+    if (cst->IsString() && index->Is<Int32Constant>()) {
+      compiler::StringRef str = cst->AsString();
+      int idx = index->Cast<Int32Constant>()->value();
+      if (idx >= 0 && idx < str.length()) {
+        if (base::Optional<uint16_t> value = str.GetChar(broker(), idx)) {
+          return GetSmiConstant(*value);
+        }
+      }
+    }
+  }
+
   // Ensure that {receiver} is actually a String.
   BuildCheckString(receiver);
   // And index is below length.
@@ -4219,6 +5775,60 @@ ReduceResult MaglevGraphBuilder::TryReduceStringPrototypeCodePointAt(
       BuiltinStringPrototypeCharCodeOrCodePointAt::kCodePointAt);
 }
 
+ReduceResult MaglevGraphBuilder::TryReduceStringPrototypeLocaleCompare(
+    compiler::JSFunctionRef target, CallArguments& args) {
+#ifdef V8_INTL_SUPPORT
+  if (args.count() < 1 || args.count() > 3) return ReduceResult::Fail();
+
+  LocalFactory* factory = local_isolate()->factory();
+  compiler::ObjectRef undefined_ref = broker()->undefined_value();
+
+  Handle<Object> locales_handle;
+  ValueNode* locales_node = nullptr;
+  if (args.count() > 1) {
+    compiler::OptionalHeapObjectRef maybe_locales = TryGetConstant(args[1]);
+    if (!maybe_locales) return ReduceResult::Fail();
+    compiler::HeapObjectRef locales = maybe_locales.value();
+    if (locales.equals(undefined_ref)) {
+      locales_handle = factory->undefined_value();
+      locales_node = GetRootConstant(RootIndex::kUndefinedValue);
+    } else {
+      if (!locales.IsString()) return ReduceResult::Fail();
+      compiler::StringRef sref = locales.AsString();
+      base::Optional<Handle<String>> maybe_locales_handle =
+          sref.ObjectIfContentAccessible(broker());
+      if (!maybe_locales_handle) return ReduceResult::Fail();
+      locales_handle = *maybe_locales_handle;
+      locales_node = GetTaggedValue(args[1]);
+    }
+  } else {
+    locales_handle = factory->undefined_value();
+    locales_node = GetRootConstant(RootIndex::kUndefinedValue);
+  }
+
+  if (args.count() > 2) {
+    compiler::OptionalHeapObjectRef maybe_options = TryGetConstant(args[2]);
+    if (!maybe_options) return ReduceResult::Fail();
+    if (!maybe_options.value().equals(undefined_ref))
+      return ReduceResult::Fail();
+  }
+
+  DCHECK(!locales_handle.is_null());
+  DCHECK_NOT_NULL(locales_node);
+
+  if (Intl::CompareStringsOptionsFor(local_isolate(), locales_handle,
+                                     factory->undefined_value()) !=
+      Intl::CompareStringsOptions::kTryFastPath) {
+    return ReduceResult::Fail();
+  }
+  return BuildCallBuiltin<Builtin::kStringFastLocaleCompare>(
+      {GetConstant(target), GetTaggedOrUndefined(args.receiver()),
+       GetTaggedValue(args[0]), locales_node});
+#else
+  return ReduceResult::Fail();
+#endif
+}
+
 template <typename LoadNode>
 ReduceResult MaglevGraphBuilder::TryBuildLoadDataView(const CallArguments& args,
                                                       ExternalArrayType type) {
@@ -4307,7 +5917,8 @@ ReduceResult MaglevGraphBuilder::TryReduceDataViewPrototypeSetFloat64(
     compiler::JSFunctionRef target, CallArguments& args) {
   return TryBuildStoreDataView<StoreDoubleDataViewElement>(
       args, ExternalArrayType::kExternalFloat64Array, [&](ValueNode* value) {
-        return value ? GetFloat64(value, TaggedToFloat64ConversionType::kNumber)
+        return value ? GetHoleyFloat64ForToNumber(
+                           value, ToNumberHint::kAssumeNumberOrOddball)
                      : GetFloat64Constant(
                            std::numeric_limits<double>::quiet_NaN());
       });
@@ -4319,20 +5930,134 @@ ReduceResult MaglevGraphBuilder::TryReduceFunctionPrototypeCall(
   if (args.receiver_mode() == ConvertReceiverMode::kNullOrUndefined) {
     return ReduceResult::Fail();
   }
-  // Use Function.prototype.call context, to ensure any exception is thrown in
-  // the correct context.
-  ValueNode* context = GetConstant(target.context(broker()));
   ValueNode* receiver = GetTaggedOrUndefined(args.receiver());
   args.PopReceiver(ConvertReceiverMode::kAny);
-  return BuildGenericCall(receiver, context, Call::TargetType::kAny, args);
+
+  compiler::FeedbackSource source = current_speculation_feedback_;
+  if (!source.IsValid()) {
+    return ReduceCall(receiver, args);
+  }
+  // Reset speculation feedback source to no feedback.
+  current_speculation_feedback_ = compiler::FeedbackSource();
+  const compiler::ProcessedFeedback& processed_feedback =
+      broker()->GetFeedbackForCall(source);
+  DCHECK_EQ(processed_feedback.kind(), compiler::ProcessedFeedback::kCall);
+  const compiler::CallFeedback& call_feedback = processed_feedback.AsCall();
+  return ReduceCall(receiver, args, source, call_feedback.speculation_mode());
 }
 
-ReduceResult MaglevGraphBuilder::TryReduceObjectPrototypeHasOwnProperty(
+ReduceResult MaglevGraphBuilder::TryReduceArrayPrototypePush(
     compiler::JSFunctionRef target, CallArguments& args) {
   // We can't reduce Function#call when there is no receiver function.
   if (args.receiver_mode() == ConvertReceiverMode::kNullOrUndefined) {
     return ReduceResult::Fail();
   }
+  if (args.count() != 1) return ReduceResult::Fail();
+  ValueNode* receiver = GetTaggedOrUndefined(args.receiver());
+
+  auto node_info = known_node_aspects().TryGetInfoFor(receiver);
+  // If the map set is not found, then we don't know anything about the map of
+  // the receiver, so bail.
+  if (!node_info || !node_info->possible_maps_are_known()) {
+    return ReduceResult::Fail();
+  }
+
+  // If the set of possible maps is empty, then there's no possible map for this
+  // receiver, therefore this path is unreachable at runtime. We're unlikely to
+  // ever hit this case, BuildCheckMaps should already unconditionally deopt,
+  // but check it in case another checking operation fails to statically
+  // unconditionally deopt.
+  if (node_info->possible_maps().is_empty()) {
+    // TODO(leszeks): Add an unreachable assert here.
+    return ReduceResult::DoneWithAbort();
+  }
+
+  if (!broker()->dependencies()->DependOnNoElementsProtector()) {
+    return ReduceResult::Fail();
+  }
+
+  ElementsKind kind;
+  ZoneVector<compiler::MapRef> receiver_map_refs(zone());
+  // Check that all receiver maps are JSArray maps with compatible elements
+  // kinds.
+  for (compiler::MapRef map : node_info->possible_maps()) {
+    if (!map.IsJSArrayMap()) return ReduceResult::Fail();
+    ElementsKind packed = GetPackedElementsKind(map.elements_kind());
+    if (!IsFastElementsKind(packed)) return ReduceResult::Fail();
+    if (!map.supports_fast_array_resize(broker())) {
+      return ReduceResult::Fail();
+    }
+    if (receiver_map_refs.empty()) {
+      kind = packed;
+    } else if (kind != packed) {
+      return ReduceResult::Fail();
+    }
+    receiver_map_refs.push_back(map);
+  }
+
+  ValueNode* value = ConvertForStoring(args[0], kind);
+
+  ValueNode* old_array_length_smi =
+      AddNewNode<LoadTaggedField>({receiver}, JSArray::kLengthOffset);
+  ValueNode* old_array_length =
+      AddNewNode<UnsafeSmiUntag>({old_array_length_smi});
+  ValueNode* new_array_length =
+      AddNewNode<Int32IncrementWithOverflow>({old_array_length});
+  ValueNode* new_array_length_smi = GetSmiValue(new_array_length);
+
+  ValueNode* elements_array =
+      AddNewNode<LoadTaggedField>({receiver}, JSObject::kElementsOffset);
+
+  ValueNode* elements_array_length =
+      AddNewNode<UnsafeSmiUntag>({AddNewNode<LoadTaggedField>(
+          {elements_array}, FixedArray::kLengthOffset)});
+
+  elements_array = AddNewNode<MaybeGrowAndEnsureWritableFastElements>(
+      {elements_array, receiver, old_array_length, elements_array_length},
+      kind);
+
+  AddNewNode<StoreTaggedFieldNoWriteBarrier>({receiver, new_array_length_smi},
+                                             JSArray::kLengthOffset);
+
+  // Do the store
+  if (IsDoubleElementsKind(kind)) {
+    AddNewNode<StoreFixedDoubleArrayElement>(
+        {elements_array, old_array_length, value});
+  } else {
+    BuildStoreFixedArrayElement(elements_array, old_array_length, value);
+  }
+
+  return new_array_length;
+}
+
+ReduceResult MaglevGraphBuilder::TryReduceFunctionPrototypeHasInstance(
+    compiler::JSFunctionRef target, CallArguments& args) {
+  // We can't reduce Function#hasInstance when there is no receiver function.
+  if (args.receiver_mode() == ConvertReceiverMode::kNullOrUndefined) {
+    return ReduceResult::Fail();
+  }
+  if (args.count() != 1) {
+    return ReduceResult::Fail();
+  }
+  compiler::OptionalHeapObjectRef maybe_receiver_constant =
+      TryGetConstant(args.receiver());
+  if (!maybe_receiver_constant) {
+    return ReduceResult::Fail();
+  }
+  compiler::HeapObjectRef receiver_object = maybe_receiver_constant.value();
+  if (!receiver_object.IsJSObject() ||
+      !receiver_object.map(broker()).is_callable()) {
+    return ReduceResult::Fail();
+  }
+  return BuildOrdinaryHasInstance(GetTaggedValue(args[0]),
+                                  receiver_object.AsJSObject(), nullptr);
+}
+
+ReduceResult MaglevGraphBuilder::TryReduceObjectPrototypeHasOwnProperty(
+    compiler::JSFunctionRef target, CallArguments& args) {
+  if (args.receiver_mode() == ConvertReceiverMode::kNullOrUndefined) {
+    return ReduceResult::Fail();
+  }
   if (args.receiver() != current_for_in_state.receiver) {
     return ReduceResult::Fail();
   }
@@ -4344,24 +6069,23 @@ ReduceResult MaglevGraphBuilder::TryReduceObjectPrototypeHasOwnProperty(
 
 ReduceResult MaglevGraphBuilder::TryReduceMathRound(
     compiler::JSFunctionRef target, CallArguments& args) {
-  return DoTryReduceMathRound(target, args, Float64Round::Kind::kNearest);
+  return DoTryReduceMathRound(args, Float64Round::Kind::kNearest);
 }
 
 ReduceResult MaglevGraphBuilder::TryReduceMathFloor(
     compiler::JSFunctionRef target, CallArguments& args) {
-  return DoTryReduceMathRound(target, args, Float64Round::Kind::kFloor);
+  return DoTryReduceMathRound(args, Float64Round::Kind::kFloor);
 }
 
 ReduceResult MaglevGraphBuilder::TryReduceMathCeil(
     compiler::JSFunctionRef target, CallArguments& args) {
-  return DoTryReduceMathRound(target, args, Float64Round::Kind::kCeil);
+  return DoTryReduceMathRound(args, Float64Round::Kind::kCeil);
 }
 
-ReduceResult MaglevGraphBuilder::DoTryReduceMathRound(
-    compiler::JSFunctionRef target, CallArguments& args,
-    Float64Round::Kind kind) {
+ReduceResult MaglevGraphBuilder::DoTryReduceMathRound(CallArguments& args,
+                                                      Float64Round::Kind kind) {
   if (args.count() == 0) {
-    return GetFloat64Constant(std::numeric_limits<double>::quiet_NaN());
+    return GetRootConstant(RootIndex::kNanValue);
   }
   ValueNode* arg = args[0];
   switch (arg->value_representation()) {
@@ -4370,20 +6094,22 @@ ReduceResult MaglevGraphBuilder::DoTryReduceMathRound(
       return arg;
     case ValueRepresentation::kTagged:
       if (CheckType(arg, NodeType::kSmi)) return arg;
-      if (CheckType(arg, NodeType::kNumber)) {
-        arg = GetFloat64(arg, TaggedToFloat64ConversionType::kNumber);
+      if (CheckType(arg, NodeType::kNumberOrOddball)) {
+        arg = GetHoleyFloat64ForToNumber(arg,
+                                         ToNumberHint::kAssumeNumberOrOddball);
       } else {
-        LazyDeoptContinuationScope continuation_scope(
-            this, Float64Round::continuation(kind));
-        ToNumberOrNumeric* conversion = AddNewNode<ToNumberOrNumeric>(
-            {GetContext(), arg}, Object::Conversion::kToNumber);
+        DeoptFrameScope continuation_scope(this,
+                                           Float64Round::continuation(kind));
+        ToNumberOrNumeric* conversion =
+            AddNewNode<ToNumberOrNumeric>({arg}, Object::Conversion::kToNumber);
         arg = AddNewNode<UncheckedNumberOrOddballToFloat64>(
-            {conversion}, TaggedToFloat64ConversionType::kNumber);
+            {conversion}, TaggedToFloat64ConversionType::kOnlyNumber);
       }
       break;
     case ValueRepresentation::kWord64:
       UNREACHABLE();
     case ValueRepresentation::kFloat64:
+    case ValueRepresentation::kHoleyFloat64:
       break;
   }
   if (IsSupported(CpuOperation::kFloat64Round)) {
@@ -4396,9 +6122,28 @@ ReduceResult MaglevGraphBuilder::DoTryReduceMathRound(
   return ReduceResult::Fail();
 }
 
+ReduceResult MaglevGraphBuilder::TryReduceStringConstructor(
+    compiler::JSFunctionRef target, CallArguments& args) {
+  if (args.count() == 0) {
+    return GetRootConstant(RootIndex::kempty_string);
+  }
+
+  return BuildToString(args[0], ToString::kConvertSymbol);
+}
+
 ReduceResult MaglevGraphBuilder::TryReduceMathPow(
     compiler::JSFunctionRef target, CallArguments& args) {
   if (args.count() < 2) {
+    // For < 2 args, we'll be calculating Math.Pow(arg[0], undefined), which is
+    // ToNumber(arg[0]) ** NaN == NaN. So we can just return NaN.
+    // However, if there is a single argument and it's tagged, we have to call
+    // ToNumber on it before returning NaN, for side effects. This call could
+    // lazy deopt, which would mean we'd need a continuation to actually set
+    // the NaN return value... it's easier to just bail out, this should be
+    // an uncommon case anyway.
+    if (args.count() == 1 && args[0]->properties().is_tagged()) {
+      return ReduceResult::Fail();
+    }
     return GetRootConstant(RootIndex::kNanValue);
   }
   // If both arguments are tagged, it is cheaper to call Math.Pow builtin,
@@ -4408,9 +6153,10 @@ ReduceResult MaglevGraphBuilder::TryReduceMathPow(
     // The Math.pow call will be created in CallKnownJSFunction reduction.
     return ReduceResult::Fail();
   }
-  ValueNode* left = GetFloat64(args[0], TaggedToFloat64ConversionType::kNumber);
+  ValueNode* left =
+      GetHoleyFloat64ForToNumber(args[0], ToNumberHint::kAssumeNumber);
   ValueNode* right =
-      GetFloat64(args[1], TaggedToFloat64ConversionType::kNumber);
+      GetHoleyFloat64ForToNumber(args[1], ToNumberHint::kAssumeNumber);
   return AddNewNode<Float64Exponentiate>({left, right});
 }
 
@@ -4442,7 +6188,7 @@ ReduceResult MaglevGraphBuilder::TryReduceMathPow(
       return GetRootConstant(RootIndex::kNanValue);                  \
     }                                                                \
     ValueNode* value =                                               \
-        GetFloat64(args[0], TaggedToFloat64ConversionType::kNumber); \
+        GetFloat64ForToNumber(args[0], ToNumberHint::kAssumeNumber); \
     return AddNewNode<Float64Ieee754Unary>(                          \
         {value}, ExternalReference::ieee754_##IeeeOp##_function());  \
   }
@@ -4453,8 +6199,8 @@ MAP_MATH_UNARY_TO_IEEE_754(MATH_UNARY_IEEE_BUILTIN_REDUCER)
 #undef MAP_MATH_UNARY_TO_IEEE_754
 
 ReduceResult MaglevGraphBuilder::TryReduceBuiltin(
-    compiler::JSFunctionRef target, CallArguments& args,
-    const compiler::FeedbackSource& feedback_source,
+    compiler::JSFunctionRef target, compiler::SharedFunctionInfoRef shared,
+    CallArguments& args, const compiler::FeedbackSource& feedback_source,
     SpeculationMode speculation_mode) {
   if (args.mode() != CallArguments::kDefault) {
     // TODO(victorgomes): Maybe inline the spread stub? Or call known function
@@ -4467,10 +6213,14 @@ ReduceResult MaglevGraphBuilder::TryReduceBuiltin(
     return ReduceResult::Fail();
   }
   CallSpeculationScope speculate(this, feedback_source);
-  if (!target.shared(broker()).HasBuiltinId()) {
+  if (!shared.HasBuiltinId()) {
     return ReduceResult::Fail();
   }
-  switch (target.shared(broker()).builtin_id()) {
+  if (v8_flags.trace_maglev_graph_building) {
+    std::cout << "  ! Trying to reduce builtin "
+              << Builtins::name(shared.builtin_id()) << std::endl;
+  }
+  switch (shared.builtin_id()) {
 #define CASE(Name)       \
   case Builtin::k##Name: \
     return TryReduce##Name(target, args);
@@ -4483,31 +6233,35 @@ ReduceResult MaglevGraphBuilder::TryReduceBuiltin(
 }
 
 ValueNode* MaglevGraphBuilder::GetConvertReceiver(
-    compiler::JSFunctionRef function, const CallArguments& args) {
-  compiler::SharedFunctionInfoRef shared = function.shared(broker());
+    compiler::SharedFunctionInfoRef shared, const CallArguments& args) {
+  return GetTaggedValue(GetRawConvertReceiver(shared, args));
+}
+
+ValueNode* MaglevGraphBuilder::GetRawConvertReceiver(
+    compiler::SharedFunctionInfoRef shared, const CallArguments& args) {
   if (shared.native() || shared.language_mode() == LanguageMode::kStrict) {
     if (args.receiver_mode() == ConvertReceiverMode::kNullOrUndefined) {
       return GetRootConstant(RootIndex::kUndefinedValue);
     } else {
-      return GetTaggedValue(args.receiver());
+      return args.receiver();
     }
   }
   if (args.receiver_mode() == ConvertReceiverMode::kNullOrUndefined) {
     return GetConstant(
-        function.native_context(broker()).global_proxy_object(broker()));
+        broker()->target_native_context().global_proxy_object(broker()));
   }
-  ValueNode* receiver = GetTaggedValue(args.receiver());
+  ValueNode* receiver = args.receiver();
   if (CheckType(receiver, NodeType::kJSReceiver)) return receiver;
-  if (Constant* constant = receiver->TryCast<Constant>()) {
-    const Handle<HeapObject> object = constant->object().object();
-    if (object->IsUndefined() || object->IsNull()) {
+  if (compiler::OptionalHeapObjectRef maybe_constant =
+          TryGetConstant(receiver)) {
+    compiler::HeapObjectRef constant = maybe_constant.value();
+    if (constant.IsNullOrUndefined()) {
       return GetConstant(
-          function.native_context(broker()).global_proxy_object(broker()));
-    } else if (object->IsJSReceiver()) {
-      return constant;
+          broker()->target_native_context().global_proxy_object(broker()));
     }
   }
-  return AddNewNode<ConvertReceiver>({receiver}, function,
+  return AddNewNode<ConvertReceiver>({GetTaggedValue(receiver)},
+                                     broker()->target_native_context(),
                                      args.receiver_mode());
 }
 
@@ -4526,11 +6280,10 @@ CallNode* MaglevGraphBuilder::AddNewCallNode(const CallArguments& args,
       },
       std::forward<Args>(extra_args)...);
 }
-
-ValueNode* MaglevGraphBuilder::BuildGenericCall(
-    ValueNode* target, ValueNode* context, Call::TargetType target_type,
-    const CallArguments& args,
-    const compiler::FeedbackSource& feedback_source) {
+
+ValueNode* MaglevGraphBuilder::BuildGenericCall(ValueNode* target,
+                                                Call::TargetType target_type,
+                                                const CallArguments& args) {
   // TODO(victorgomes): We do not collect call feedback from optimized/inlined
   // calls. In order to be consistent, we don't pass the feedback_source to the
   // IR, so that we avoid collecting for generic calls as well. We might want to
@@ -4538,21 +6291,21 @@ ValueNode* MaglevGraphBuilder::BuildGenericCall(
   switch (args.mode()) {
     case CallArguments::kDefault:
       return AddNewCallNode<Call>(args, args.receiver_mode(), target_type,
-                                  compiler::FeedbackSource(), target, context);
+                                  target, GetContext());
     case CallArguments::kWithSpread:
       DCHECK_EQ(args.receiver_mode(), ConvertReceiverMode::kAny);
-      return AddNewCallNode<CallWithSpread>(args, compiler::FeedbackSource(),
-                                            target, context);
+      return AddNewCallNode<CallWithSpread>(args, target, GetContext());
     case CallArguments::kWithArrayLike:
       DCHECK_EQ(args.receiver_mode(), ConvertReceiverMode::kAny);
       return AddNewNode<CallWithArrayLike>(
-          {target, args.receiver(), args[0], context});
+          {target, args.receiver(), args[0], GetContext()});
   }
 }
 
-ValueNode* MaglevGraphBuilder::BuildCallSelf(compiler::JSFunctionRef function,
-                                             CallArguments& args) {
-  ValueNode* receiver = GetConvertReceiver(function, args);
+ValueNode* MaglevGraphBuilder::BuildCallSelf(
+    ValueNode* context, ValueNode* function, ValueNode* new_target,
+    compiler::SharedFunctionInfoRef shared, CallArguments& args) {
+  ValueNode* receiver = GetConvertReceiver(shared, args);
   size_t input_count = args.count() + CallSelf::kFixedInputCount;
   graph()->set_has_recursive_calls(true);
   return AddNewNode<CallSelf>(
@@ -4562,37 +6315,205 @@ ValueNode* MaglevGraphBuilder::BuildCallSelf(compiler::JSFunctionRef function,
           call->set_arg(i, GetTaggedValue(args[i]));
         }
       },
-      broker(), function, receiver);
+      shared, function, context, receiver, new_target);
 }
 
 bool MaglevGraphBuilder::TargetIsCurrentCompilingUnit(
     compiler::JSFunctionRef target) {
   if (compilation_unit_->info()->specialize_to_function_context()) {
-    return target.equals(compilation_unit_->function());
+    return target.object().equals(
+        compilation_unit_->info()->toplevel_function());
   }
-  return compilation_unit_->shared_function_info().equals(
-      target.shared(broker()));
+  return target.object()->shared() ==
+         compilation_unit_->info()->toplevel_function()->shared();
 }
 
-ReduceResult MaglevGraphBuilder::TryBuildCallKnownJSFunction(
-    compiler::JSFunctionRef function, CallArguments& args,
-    const compiler::FeedbackSource& feedback_source) {
-  // Don't inline CallFunction stub across native contexts.
-  if (function.native_context(broker()) != broker()->target_native_context()) {
-    return ReduceResult::Fail();
-  }
+ReduceResult MaglevGraphBuilder::ReduceCallForApiFunction(
+    compiler::FunctionTemplateInfoRef api_callback,
+    compiler::OptionalSharedFunctionInfoRef maybe_shared,
+    compiler::OptionalJSObjectRef api_holder, CallArguments& args) {
   if (args.mode() != CallArguments::kDefault) {
     // TODO(victorgomes): Maybe inline the spread stub? Or call known function
     // directly if arguments list is an array.
     return ReduceResult::Fail();
   }
-  if (!is_inline() && TargetIsCurrentCompilingUnit(function)) {
-    return BuildCallSelf(function, args);
+  compiler::OptionalCallHandlerInfoRef maybe_call_handler_info =
+      api_callback.call_code(broker());
+  if (!maybe_call_handler_info.has_value()) {
+    // TODO(ishell): distinguish TryMakeRef-related failure from empty function
+    // case and generate "return undefined" for the latter.
+    return ReduceResult::Fail();
+  }
+  compiler::CallHandlerInfoRef call_handler_info =
+      maybe_call_handler_info.value();
+  compiler::ObjectRef data = call_handler_info.data(broker());
+
+  size_t input_count = args.count() + CallKnownApiFunction::kFixedInputCount;
+  ValueNode* receiver;
+  if (maybe_shared.has_value()) {
+    receiver = GetConvertReceiver(maybe_shared.value(), args);
+  } else {
+    receiver = args.receiver();
+    CHECK_NOT_NULL(receiver);
+  }
+
+  CallKnownApiFunction::Mode mode =
+      broker()->dependencies()->DependOnNoProfilingProtector()
+          ? CallKnownApiFunction::kNoProfiling
+          : CallKnownApiFunction::kGeneric;
+
+  return AddNewNode<CallKnownApiFunction>(
+      input_count,
+      [&](CallKnownApiFunction* call) {
+        for (int i = 0; i < static_cast<int>(args.count()); i++) {
+          call->set_arg(i, GetTaggedValue(args[i]));
+        }
+      },
+      mode, api_callback, call_handler_info, data, api_holder, GetContext(),
+      receiver);
+}
+
+ReduceResult MaglevGraphBuilder::TryBuildCallKnownApiFunction(
+    compiler::JSFunctionRef function, compiler::SharedFunctionInfoRef shared,
+    CallArguments& args) {
+  compiler::OptionalFunctionTemplateInfoRef maybe_function_template_info =
+      shared.function_template_info(broker());
+  if (!maybe_function_template_info.has_value()) {
+    // Not an Api function.
+    return ReduceResult::Fail();
+  }
+
+  // See if we can optimize this API call.
+  compiler::FunctionTemplateInfoRef function_template_info =
+      maybe_function_template_info.value();
+
+  compiler::HolderLookupResult api_holder;
+  if (function_template_info.accept_any_receiver() &&
+      function_template_info.is_signature_undefined(broker())) {
+    // We might be able to optimize the API call depending on the
+    // {function_template_info}.
+    // If the API function accepts any kind of {receiver}, we only need to
+    // ensure that the {receiver} is actually a JSReceiver at this point,
+    // and also pass that as the {holder}. There are two independent bits
+    // here:
+    //
+    //  a. When the "accept any receiver" bit is set, it means we don't
+    //     need to perform access checks, even if the {receiver}'s map
+    //     has the "needs access check" bit set.
+    //  b. When the {function_template_info} has no signature, we don't
+    //     need to do the compatible receiver check, since all receivers
+    //     are considered compatible at that point, and the {receiver}
+    //     will be pass as the {holder}.
+
+    api_holder =
+        compiler::HolderLookupResult{CallOptimization::kHolderIsReceiver};
+  } else {
+    // Try to infer API holder from the known aspects of the {receiver}.
+    api_holder =
+        TryInferApiHolderValue(function_template_info, args.receiver());
+  }
+
+  switch (api_holder.lookup) {
+    case CallOptimization::kHolderIsReceiver:
+    case CallOptimization::kHolderFound: {
+      // Add lazy deopt point to make the API function appear in exception
+      // stack trace.
+      base::Optional<DeoptFrameScope> lazy_deopt_scope;
+      if (v8_flags.experimental_stack_trace_frames) {
+        // The receiver is only necessary for displaying "class.method" name
+        // if applicable, so full GetConvertReceiver() is not needed here.
+        // Another reason to not use GetConvertReceiver() here because
+        // ReduceCallForApiFunction might bailout and we'll end up with
+        // unused ConvertReceiver node.
+        ValueNode* receiver =
+            args.receiver_mode() == ConvertReceiverMode::kNullOrUndefined
+                ? GetRootConstant(RootIndex::kUndefinedValue)
+                : args.receiver();
+
+        lazy_deopt_scope.emplace(this, Builtin::kGenericLazyDeoptContinuation,
+                                 function,
+                                 base::VectorOf<ValueNode*>({receiver}));
+      }
+      return ReduceCallForApiFunction(function_template_info, shared,
+                                      api_holder.holder, args);
+    }
+    case CallOptimization::kHolderNotFound:
+      break;
+  }
+
+  // We don't have enough information to eliminate the access check
+  // and/or the compatible receiver check, so use the generic builtin
+  // that does those checks dynamically. This is still significantly
+  // faster than the generic call sequence.
+  Builtin builtin_name;
+  // TODO(ishell): create no-profiling versions of kCallFunctionTemplate
+  // builtins and use them here based on DependOnNoProfilingProtector()
+  // dependency state.
+  if (function_template_info.accept_any_receiver()) {
+    DCHECK(!function_template_info.is_signature_undefined(broker()));
+    builtin_name = Builtin::kCallFunctionTemplate_CheckCompatibleReceiver;
+  } else if (function_template_info.is_signature_undefined(broker())) {
+    builtin_name = Builtin::kCallFunctionTemplate_CheckAccess;
+  } else {
+    builtin_name =
+        Builtin::kCallFunctionTemplate_CheckAccessAndCompatibleReceiver;
+  }
+
+  // The CallFunctionTemplate builtin requires the {receiver} to be
+  // an actual JSReceiver, so make sure we do the proper conversion
+  // first if necessary.
+  ValueNode* receiver = GetConvertReceiver(shared, args);
+  int kContext = 1;
+  int kFunctionTemplateInfo = 1;
+  int kArgc = 1;
+  return AddNewNode<CallBuiltin>(
+      kFunctionTemplateInfo + kArgc + kContext + args.count_with_receiver(),
+      [&](CallBuiltin* call_builtin) {
+        int arg_index = 0;
+        call_builtin->set_arg(arg_index++, GetConstant(function_template_info));
+        call_builtin->set_arg(
+            arg_index++,
+            GetInt32Constant(JSParameterCount(static_cast<int>(args.count()))));
+
+        call_builtin->set_arg(arg_index++, receiver);
+        for (int i = 0; i < static_cast<int>(args.count()); i++) {
+          call_builtin->set_arg(arg_index++, GetTaggedValue(args[i]));
+        }
+      },
+      builtin_name, GetContext());
+}
+
+ReduceResult MaglevGraphBuilder::TryBuildCallKnownJSFunction(
+    compiler::JSFunctionRef function, ValueNode* new_target,
+    CallArguments& args, const compiler::FeedbackSource& feedback_source) {
+  // Don't inline CallFunction stub across native contexts.
+  if (function.native_context(broker()) != broker()->target_native_context()) {
+    return ReduceResult::Fail();
+  }
+  compiler::SharedFunctionInfoRef shared = function.shared(broker());
+  RETURN_IF_DONE(TryBuildCallKnownApiFunction(function, shared, args));
+
+  ValueNode* closure = GetConstant(function);
+  ValueNode* context = GetConstant(function.context(broker()));
+  if (MaglevIsTopTier() && TargetIsCurrentCompilingUnit(function) &&
+      !graph_->is_osr()) {
+    return BuildCallSelf(context, closure, new_target, shared, args);
   }
+  return TryBuildCallKnownJSFunction(context, closure, new_target, shared,
+                                     function.feedback_vector(broker()), args,
+                                     feedback_source);
+}
+
+ReduceResult MaglevGraphBuilder::TryBuildCallKnownJSFunction(
+    ValueNode* context, ValueNode* function, ValueNode* new_target,
+    compiler::SharedFunctionInfoRef shared,
+    compiler::OptionalFeedbackVectorRef feedback_vector, CallArguments& args,
+    const compiler::FeedbackSource& feedback_source) {
   if (v8_flags.maglev_inlining) {
-    RETURN_IF_DONE(TryBuildInlinedCall(function, args, feedback_source));
+    RETURN_IF_DONE(TryBuildInlinedCall(context, function, new_target, shared,
+                                       feedback_vector, args, feedback_source));
   }
-  ValueNode* receiver = GetConvertReceiver(function, args);
+  ValueNode* receiver = GetConvertReceiver(shared, args);
   size_t input_count = args.count() + CallKnownJSFunction::kFixedInputCount;
   return AddNewNode<CallKnownJSFunction>(
       input_count,
@@ -4601,62 +6522,192 @@ ReduceResult MaglevGraphBuilder::TryBuildCallKnownJSFunction(
           call->set_arg(i, GetTaggedValue(args[i]));
         }
       },
-      broker(), function, receiver);
+      shared, function, context, receiver, new_target);
 }
 
-ReduceResult MaglevGraphBuilder::BuildCheckValue(
-    ValueNode* node, const compiler::HeapObjectRef& ref) {
-  if (node->Is<Constant>()) {
-    if (node->Cast<Constant>()->object().equals(ref))
-      return ReduceResult::Done();
-    EmitUnconditionalDeopt(DeoptimizeReason::kUnknown);
-    return ReduceResult::DoneWithAbort();
-  }
-  // TODO(v8:7700): Add CheckValue support for numbers (incl. conversion between
-  // Smi and HeapNumber).
+ReduceResult MaglevGraphBuilder::BuildCheckValue(ValueNode* node,
+                                                 compiler::HeapObjectRef ref) {
   DCHECK(!ref.IsSmi());
   DCHECK(!ref.IsHeapNumber());
+
+  if (compiler::OptionalHeapObjectRef maybe_constant = TryGetConstant(node)) {
+    if (maybe_constant.value().equals(ref)) {
+      return ReduceResult::Done();
+    }
+    return EmitUnconditionalDeopt(DeoptimizeReason::kUnknown);
+  }
   if (ref.IsString()) {
+    DCHECK(ref.IsInternalizedString());
     AddNewNode<CheckValueEqualsString>({node}, ref.AsInternalizedString());
   } else {
     AddNewNode<CheckValue>({node}, ref);
   }
+  SetKnownValue(node, ref);
   return ReduceResult::Done();
 }
 
-ReduceResult MaglevGraphBuilder::ReduceCall(
-    compiler::ObjectRef object, CallArguments& args,
+ReduceResult MaglevGraphBuilder::BuildCheckValue(ValueNode* node,
+                                                 compiler::ObjectRef ref) {
+  if (ref.IsHeapObject() && !ref.IsHeapNumber()) {
+    return BuildCheckValue(node, ref.AsHeapObject());
+  }
+  if (ref.IsSmi()) {
+    int ref_value = ref.AsSmi();
+    if (IsConstantNode(node->opcode())) {
+      if (node->Is<SmiConstant>() &&
+          node->Cast<SmiConstant>()->value().value() == ref_value) {
+        return ReduceResult::Done();
+      }
+      if (node->Is<Int32Constant>() &&
+          node->Cast<Int32Constant>()->value() == ref_value) {
+        return ReduceResult::Done();
+      }
+      return EmitUnconditionalDeopt(DeoptimizeReason::kUnknown);
+    }
+    AddNewNode<CheckValueEqualsInt32>({GetInt32(node)}, ref_value);
+  } else {
+    DCHECK(ref.IsHeapNumber());
+    double ref_value = ref.AsHeapNumber().value();
+    if (node->Is<Float64Constant>()) {
+      if (node->Cast<Float64Constant>()->value().get_scalar() == ref_value) {
+        return ReduceResult::Done();
+      }
+      // TODO(verwaest): Handle NaN.
+      return EmitUnconditionalDeopt(DeoptimizeReason::kUnknown);
+    } else if (compiler::OptionalHeapObjectRef constant =
+                   TryGetConstant(node)) {
+      if (constant.value().IsHeapNumber() &&
+          constant.value().AsHeapNumber().value() == ref_value) {
+        return ReduceResult::Done();
+      }
+      // TODO(verwaest): Handle NaN.
+      return EmitUnconditionalDeopt(DeoptimizeReason::kUnknown);
+    }
+    AddNewNode<CheckValueEqualsFloat64>({GetFloat64(node)}, ref_value);
+  }
+  SetKnownValue(node, ref);
+  return ReduceResult::Done();
+}
+
+ReduceResult MaglevGraphBuilder::ReduceCallForConstant(
+    compiler::JSFunctionRef target, CallArguments& args,
     const compiler::FeedbackSource& feedback_source,
     SpeculationMode speculation_mode) {
-  if (!object.IsJSFunction()) {
-    return BuildGenericCall(GetConstant(object), GetContext(),
-                            Call::TargetType::kAny, args);
+  if (args.mode() != CallArguments::kDefault) {
+    // TODO(victorgomes): Maybe inline the spread stub? Or call known function
+    // directly if arguments list is an array.
+    return ReduceResult::Fail();
   }
-  compiler::JSFunctionRef target = object.AsJSFunction();
+  compiler::SharedFunctionInfoRef shared = target.shared(broker());
+  ValueNode* target_node = GetConstant(target);
   // Do not reduce calls to functions with break points.
-  if (!target.shared(broker()).HasBreakInfo()) {
-    if (target.object()->IsJSClassConstructor()) {
+  if (!shared.HasBreakInfo(broker())) {
+    if (IsClassConstructor(shared.kind())) {
       // If we have a class constructor, we should raise an exception.
       return BuildCallRuntime(Runtime::kThrowConstructorNonCallableError,
-                              {GetConstant(target)});
+                              {target_node});
+    }
+    DCHECK(IsCallable(*target.object()));
+    RETURN_IF_DONE(TryReduceBuiltin(target, shared, args, feedback_source,
+                                    speculation_mode));
+    RETURN_IF_DONE(TryBuildCallKnownJSFunction(
+        target, GetRootConstant(RootIndex::kUndefinedValue), args,
+        feedback_source));
+  }
+  return BuildGenericCall(target_node, Call::TargetType::kJSFunction, args);
+}
+
+compiler::HolderLookupResult MaglevGraphBuilder::TryInferApiHolderValue(
+    compiler::FunctionTemplateInfoRef function_template_info,
+    ValueNode* receiver) {
+  const compiler::HolderLookupResult not_found;
+
+  auto receiver_info = known_node_aspects().TryGetInfoFor(receiver);
+  if (!receiver_info || !receiver_info->possible_maps_are_known()) {
+    // No info about receiver, can't infer API holder.
+    return not_found;
+  }
+  DCHECK(!receiver_info->possible_maps().is_empty());
+  compiler::MapRef first_receiver_map = receiver_info->possible_maps()[0];
+
+  // See if we can constant-fold the compatible receiver checks.
+  compiler::HolderLookupResult api_holder =
+      function_template_info.LookupHolderOfExpectedType(broker(),
+                                                        first_receiver_map);
+  if (api_holder.lookup == CallOptimization::kHolderNotFound) {
+    // Can't infer API holder.
+    return not_found;
+  }
+
+  // Check that all {receiver_maps} are actually JSReceiver maps and
+  // that the {function_template_info} accepts them without access
+  // checks (even if "access check needed" is set for {receiver}).
+  //
+  // API holder might be a receivers's hidden prototype (i.e. the receiver is
+  // a global proxy), so in this case the map check or stability dependency on
+  // the receiver guard us from detaching a global object from global proxy.
+  CHECK(first_receiver_map.IsJSReceiverMap());
+  CHECK(!first_receiver_map.is_access_check_needed() ||
+        function_template_info.accept_any_receiver());
+
+  for (compiler::MapRef receiver_map : receiver_info->possible_maps()) {
+    compiler::HolderLookupResult holder_i =
+        function_template_info.LookupHolderOfExpectedType(broker(),
+                                                          receiver_map);
+
+    if (api_holder.lookup != holder_i.lookup) {
+      // Different API holders, dynamic lookup is required.
+      return not_found;
+    }
+    DCHECK(holder_i.lookup == CallOptimization::kHolderFound ||
+           holder_i.lookup == CallOptimization::kHolderIsReceiver);
+    if (holder_i.lookup == CallOptimization::kHolderFound) {
+      DCHECK(api_holder.holder.has_value() && holder_i.holder.has_value());
+      if (!api_holder.holder->equals(*holder_i.holder)) {
+        // Different API holders, dynamic lookup is required.
+        return not_found;
+      }
     }
 
-    DCHECK(target.object()->IsCallable());
-    RETURN_IF_DONE(
-        TryReduceBuiltin(target, args, feedback_source, speculation_mode));
-    RETURN_IF_DONE(TryBuildCallKnownJSFunction(target, args, feedback_source));
+    CHECK(receiver_map.IsJSReceiverMap());
+    CHECK(!receiver_map.is_access_check_needed() ||
+          function_template_info.accept_any_receiver());
   }
-  return BuildGenericCall(GetConstant(target), GetContext(),
-                          Call::TargetType::kJSFunction, args);
+  return api_holder;
 }
 
 ReduceResult MaglevGraphBuilder::ReduceCallForTarget(
     ValueNode* target_node, compiler::JSFunctionRef target, CallArguments& args,
     const compiler::FeedbackSource& feedback_source,
     SpeculationMode speculation_mode) {
-  if (BuildCheckValue(target_node, target).IsDoneWithAbort())
-    return ReduceResult::DoneWithAbort();
-  return ReduceCall(target, args, feedback_source, speculation_mode);
+  RETURN_IF_ABORT(BuildCheckValue(target_node, target));
+  return ReduceCallForConstant(target, args, feedback_source, speculation_mode);
+}
+
+ReduceResult MaglevGraphBuilder::ReduceCallForNewClosure(
+    ValueNode* target_node, ValueNode* target_context,
+    compiler::SharedFunctionInfoRef shared,
+    compiler::OptionalFeedbackVectorRef feedback_vector, CallArguments& args,
+    const compiler::FeedbackSource& feedback_source,
+    SpeculationMode speculation_mode) {
+  // Do not reduce calls to functions with break points.
+  if (args.mode() != CallArguments::kDefault) {
+    // TODO(victorgomes): Maybe inline the spread stub? Or call known function
+    // directly if arguments list is an array.
+    return ReduceResult::Fail();
+  }
+  if (!shared.HasBreakInfo(broker())) {
+    if (IsClassConstructor(shared.kind())) {
+      // If we have a class constructor, we should raise an exception.
+      return BuildCallRuntime(Runtime::kThrowConstructorNonCallableError,
+                              {target_node});
+    }
+    RETURN_IF_DONE(TryBuildCallKnownJSFunction(
+        target_context, target_node,
+        GetRootConstant(RootIndex::kUndefinedValue), shared, feedback_vector,
+        args, feedback_source));
+  }
+  return BuildGenericCall(target_node, Call::TargetType::kJSFunction, args);
 }
 
 ReduceResult MaglevGraphBuilder::ReduceFunctionPrototypeApplyCallWithReceiver(
@@ -4697,41 +6748,78 @@ ReduceResult MaglevGraphBuilder::ReduceFunctionPrototypeApplyCallWithReceiver(
   //                   feedback_source, speculation_mode);
 }
 
-void MaglevGraphBuilder::BuildCall(ValueNode* target_node, CallArguments& args,
-                                   compiler::FeedbackSource& feedback_source) {
+void MaglevGraphBuilder::BuildCallWithFeedback(
+    ValueNode* target_node, CallArguments& args,
+    const compiler::FeedbackSource& feedback_source) {
   const compiler::ProcessedFeedback& processed_feedback =
       broker()->GetFeedbackForCall(feedback_source);
   if (processed_feedback.IsInsufficient()) {
-    EmitUnconditionalDeopt(DeoptimizeReason::kInsufficientTypeFeedbackForCall);
-    return;
+    RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForCall));
   }
 
   DCHECK_EQ(processed_feedback.kind(), compiler::ProcessedFeedback::kCall);
   const compiler::CallFeedback& call_feedback = processed_feedback.AsCall();
+
   if (call_feedback.target().has_value() &&
       call_feedback.target()->IsJSFunction()) {
     CallFeedbackContent content = call_feedback.call_feedback_content();
-    compiler::JSFunctionRef function = call_feedback.target()->AsJSFunction();
-    ReduceResult result;
-    if (content == CallFeedbackContent::kTarget) {
-      result = ReduceCallForTarget(target_node, function, args, feedback_source,
-                                   call_feedback.speculation_mode());
+    compiler::JSFunctionRef feedback_target =
+        call_feedback.target()->AsJSFunction();
+    if (content == CallFeedbackContent::kReceiver) {
+      // TODO(verwaest): Actually implement
+      // FunctionPrototypeApplyCallWithReceiver.
+      compiler::NativeContextRef native_context =
+          broker()->target_native_context();
+      feedback_target = native_context.function_prototype_apply(broker());
     } else {
-      DCHECK_EQ(content, CallFeedbackContent::kReceiver);
-      // We only collect receiver feedback for FunctionPrototypeApply.
-      // See CollectCallFeedback in ic-callable.tq
-      result = ReduceFunctionPrototypeApplyCallWithReceiver(
-          target_node, function, args, feedback_source,
-          call_feedback.speculation_mode());
+      DCHECK_EQ(CallFeedbackContent::kTarget, content);
     }
-    PROCESS_AND_RETURN_IF_DONE(
-        result, [&](ValueNode* value) { SetAccumulator(value); });
+    RETURN_VOID_IF_ABORT(BuildCheckValue(target_node, feedback_target));
+  }
+
+  PROCESS_AND_RETURN_IF_DONE(ReduceCall(target_node, args, feedback_source,
+                                        call_feedback.speculation_mode()),
+                             SetAccumulator);
+}
+
+ReduceResult MaglevGraphBuilder::ReduceCall(
+    ValueNode* target_node, CallArguments& args,
+    const compiler::FeedbackSource& feedback_source,
+    SpeculationMode speculation_mode) {
+  if (compiler::OptionalHeapObjectRef maybe_constant =
+          TryGetConstant(target_node)) {
+    if (maybe_constant->IsJSFunction()) {
+      ReduceResult result =
+          ReduceCallForTarget(target_node, maybe_constant->AsJSFunction(), args,
+                              feedback_source, speculation_mode);
+      RETURN_IF_DONE(result);
+    }
+  }
+
+  // If the implementation here becomes more complex, we could probably
+  // deduplicate the code for FastCreateClosure and CreateClosure by using
+  // templates or giving them a shared base class.
+  if (FastCreateClosure* create_closure =
+          target_node->TryCast<FastCreateClosure>()) {
+    ReduceResult result = ReduceCallForNewClosure(
+        create_closure, create_closure->context().node(),
+        create_closure->shared_function_info(),
+        create_closure->feedback_cell().feedback_vector(broker()), args,
+        feedback_source, speculation_mode);
+    RETURN_IF_DONE(result);
+  } else if (CreateClosure* create_closure =
+                 target_node->TryCast<CreateClosure>()) {
+    ReduceResult result = ReduceCallForNewClosure(
+        create_closure, create_closure->context().node(),
+        create_closure->shared_function_info(),
+        create_closure->feedback_cell().feedback_vector(broker()), args,
+        feedback_source, speculation_mode);
+    RETURN_IF_DONE(result);
   }
 
   // On fallthrough, create a generic call.
-  ValueNode* context = GetContext();
-  SetAccumulator(BuildGenericCall(target_node, context, Call::TargetType::kAny,
-                                  args, feedback_source));
+  return BuildGenericCall(target_node, Call::TargetType::kAny, args);
 }
 
 void MaglevGraphBuilder::BuildCallFromRegisterList(
@@ -4741,7 +6829,7 @@ void MaglevGraphBuilder::BuildCallFromRegisterList(
   FeedbackSlot slot = GetSlotOperand(3);
   compiler::FeedbackSource feedback_source(feedback(), slot);
   CallArguments args(receiver_mode, reg_list, current_interpreter_frame_);
-  BuildCall(target, args, feedback_source);
+  BuildCallWithFeedback(target, args, feedback_source);
 }
 
 void MaglevGraphBuilder::BuildCallFromRegisters(
@@ -4756,24 +6844,24 @@ void MaglevGraphBuilder::BuildCallFromRegisters(
     case 0: {
       DCHECK_EQ(receiver_mode, ConvertReceiverMode::kNullOrUndefined);
       CallArguments args(receiver_mode);
-      BuildCall(target, args, feedback_source);
+      BuildCallWithFeedback(target, args, feedback_source);
       break;
     }
     case 1: {
       CallArguments args(receiver_mode, {LoadRegisterRaw(1)});
-      BuildCall(target, args, feedback_source);
+      BuildCallWithFeedback(target, args, feedback_source);
       break;
     }
     case 2: {
       CallArguments args(receiver_mode,
                          {LoadRegisterRaw(1), LoadRegisterRaw(2)});
-      BuildCall(target, args, feedback_source);
+      BuildCallWithFeedback(target, args, feedback_source);
       break;
     }
     case 3: {
       CallArguments args(receiver_mode, {LoadRegisterRaw(1), LoadRegisterRaw(2),
                                          LoadRegisterRaw(3)});
-      BuildCall(target, args, feedback_source);
+      BuildCallWithFeedback(target, args, feedback_source);
       break;
     }
     default:
@@ -4816,7 +6904,7 @@ void MaglevGraphBuilder::VisitCallWithSpread() {
   compiler::FeedbackSource feedback_source(feedback(), slot);
   CallArguments args(ConvertReceiverMode::kAny, reglist,
                      current_interpreter_frame_, CallArguments::kWithSpread);
-  BuildCall(function, args, feedback_source);
+  BuildCallWithFeedback(function, args, feedback_source);
 }
 
 void MaglevGraphBuilder::VisitCallRuntime() {
@@ -4846,8 +6934,7 @@ void MaglevGraphBuilder::VisitCallJSRuntime() {
   interpreter::RegisterList reglist = iterator_.GetRegisterListOperand(1);
   CallArguments args(ConvertReceiverMode::kNullOrUndefined, reglist,
                      current_interpreter_frame_);
-  SetAccumulator(BuildGenericCall(callee, GetContext(),
-                                  Call::TargetType::kJSFunction, args));
+  SetAccumulator(BuildGenericCall(callee, Call::TargetType::kJSFunction, args));
 }
 
 void MaglevGraphBuilder::VisitCallRuntimeForPair() {
@@ -5031,28 +7118,188 @@ void MaglevGraphBuilder::VisitIntrinsicAsyncGeneratorYieldWithAwait(
        GetTaggedValue(args[2])}));
 }
 
-void MaglevGraphBuilder::VisitConstruct() {
-  ValueNode* new_target = GetAccumulatorTagged();
-  ValueNode* constructor = LoadRegisterTagged(0);
-  interpreter::RegisterList args = iterator_.GetRegisterListOperand(1);
-  ValueNode* context = GetContext();
-  FeedbackSlot slot = GetSlotOperand(3);
-  compiler::FeedbackSource feedback_source{feedback(), slot};
-
-  size_t input_count = args.register_count() + 1 + Construct::kFixedInputCount;
-  Construct* construct = AddNewNode<Construct>(
+ValueNode* MaglevGraphBuilder::BuildGenericConstruct(
+    ValueNode* target, ValueNode* new_target, ValueNode* context,
+    const CallArguments& args,
+    const compiler::FeedbackSource& feedback_source) {
+  size_t input_count = args.count_with_receiver() + Construct::kFixedInputCount;
+  DCHECK_EQ(args.receiver_mode(), ConvertReceiverMode::kNullOrUndefined);
+  return AddNewNode<Construct>(
       input_count,
       [&](Construct* construct) {
         int arg_index = 0;
         // Add undefined receiver.
         construct->set_arg(arg_index++,
                            GetRootConstant(RootIndex::kUndefinedValue));
-        for (int i = 0; i < args.register_count(); i++) {
+        for (size_t i = 0; i < args.count(); i++) {
           construct->set_arg(arg_index++, GetTaggedValue(args[i]));
         }
       },
-      feedback_source, constructor, new_target, context);
-  SetAccumulator(construct);
+      feedback_source, target, new_target, context);
+}
+
+ReduceResult MaglevGraphBuilder::ReduceConstruct(
+    compiler::HeapObjectRef feedback_target, ValueNode* target,
+    ValueNode* new_target, CallArguments& args,
+    compiler::FeedbackSource& feedback_source) {
+  if (feedback_target.IsAllocationSite()) {
+    // TODO(victorgomes): Inline array constructors.
+    return ReduceResult::Fail();
+  } else if (feedback_target.map(broker()).is_constructor()) {
+    if (target != new_target) return ReduceResult::Fail();
+    if (feedback_target.IsJSFunction()) {
+      compiler::JSFunctionRef function = feedback_target.AsJSFunction();
+
+      // Do not inline constructors with break points.
+      compiler::SharedFunctionInfoRef sfi = function.shared(broker());
+      if (sfi.HasBreakInfo(broker())) {
+        return ReduceResult::Fail();
+      }
+
+      // Do not inline cross natives context.
+      if (function.native_context(broker()) !=
+          broker()->target_native_context()) {
+        return ReduceResult::Fail();
+      }
+
+      if (args.mode() != CallArguments::kDefault) {
+        // TODO(victorgomes): Maybe inline the spread stub? Or call known
+        // function directly if arguments list is an array.
+        return ReduceResult::Fail();
+      }
+
+      // TODO(victorgomes): specialize for known constants targets, specially
+      // ArrayConstructor.
+
+      if (sfi.construct_as_builtin()) {
+        // TODO(victorgomes): Inline JSBuiltinsConstructStub.
+        return ReduceResult::Fail();
+      }
+
+      RETURN_IF_ABORT(BuildCheckValue(target, function));
+
+      int construct_arg_count = static_cast<int>(args.count());
+      base::Vector<ValueNode*> construct_arguments_without_receiver =
+          zone()->AllocateVector<ValueNode*>(construct_arg_count);
+      for (int i = 0; i < construct_arg_count; i++) {
+        construct_arguments_without_receiver[i] = args[i];
+      }
+
+      if (IsDerivedConstructor(sfi.kind())) {
+        ValueNode* implicit_receiver =
+            GetRootConstant(RootIndex::kTheHoleValue);
+        args.set_receiver(implicit_receiver);
+        ValueNode* call_result;
+        {
+          DeoptFrameScope construct(this, implicit_receiver);
+          ReduceResult result = TryBuildCallKnownJSFunction(
+              function, new_target, args, feedback_source);
+          RETURN_IF_ABORT(result);
+          call_result = result.value();
+        }
+        if (CheckType(call_result, NodeType::kJSReceiver)) return call_result;
+        ValueNode* constant_node;
+        if (compiler::OptionalHeapObjectRef maybe_constant =
+                TryGetConstant(call_result, &constant_node)) {
+          compiler::HeapObjectRef constant = maybe_constant.value();
+          if (constant.IsJSReceiver()) return constant_node;
+        }
+        if (!call_result->properties().is_tagged()) {
+          return BuildCallRuntime(Runtime::kThrowConstructorReturnedNonObject,
+                                  {});
+        }
+        return AddNewNode<CheckDerivedConstructResult>({call_result});
+      }
+
+      // We do not create a construct stub lazy deopt frame, since
+      // FastNewObject cannot fail if target is a JSFunction.
+      ValueNode* implicit_receiver = nullptr;
+      if (function.has_initial_map(broker())) {
+        compiler::MapRef map = function.initial_map(broker());
+        if (map.GetConstructor(broker()).equals(feedback_target)) {
+          implicit_receiver = BuildAllocateFastObject(
+              FastObject(function, zone(), broker()), AllocationType::kYoung);
+          // TODO(leszeks): Don't eagerly clear the raw allocation, have the
+          // next side effect clear it.
+          ClearCurrentRawAllocation();
+        }
+      }
+      if (implicit_receiver == nullptr) {
+        implicit_receiver =
+            BuildCallBuiltin<Builtin::kFastNewObject>({target, new_target});
+      }
+      EnsureType(implicit_receiver, NodeType::kJSReceiver);
+
+      args.set_receiver(implicit_receiver);
+      ValueNode* call_result;
+      {
+        DeoptFrameScope construct(this, implicit_receiver);
+        ReduceResult result = TryBuildCallKnownJSFunction(
+            function, new_target, args, feedback_source);
+        RETURN_IF_ABORT(result);
+        call_result = result.value();
+      }
+      if (CheckType(call_result, NodeType::kJSReceiver)) return call_result;
+      if (!call_result->properties().is_tagged()) return implicit_receiver;
+      ValueNode* constant_node;
+      if (compiler::OptionalHeapObjectRef maybe_constant =
+              TryGetConstant(call_result, &constant_node)) {
+        compiler::HeapObjectRef constant = maybe_constant.value();
+        DCHECK(CheckType(implicit_receiver, NodeType::kJSReceiver));
+        if (constant.IsJSReceiver()) return constant_node;
+        return implicit_receiver;
+      }
+      return AddNewNode<CheckConstructResult>({call_result, implicit_receiver});
+    }
+    // TODO(v8:7700): Add fast paths for other callables.
+    return ReduceResult::Fail();
+  } else {
+    // TODO(victorgomes): Deal the case where target is not a constructor.
+    return ReduceResult::Fail();
+  }
+}
+
+void MaglevGraphBuilder::BuildConstruct(
+    ValueNode* target, ValueNode* new_target, CallArguments& args,
+    compiler::FeedbackSource& feedback_source) {
+  compiler::ProcessedFeedback const& processed_feedback =
+      broker()->GetFeedbackForCall(feedback_source);
+  if (processed_feedback.IsInsufficient()) {
+    RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForConstruct));
+  }
+
+  DCHECK_EQ(processed_feedback.kind(), compiler::ProcessedFeedback::kCall);
+  compiler::OptionalHeapObjectRef feedback_target =
+      processed_feedback.AsCall().target();
+  if (feedback_target.has_value()) {
+    PROCESS_AND_RETURN_IF_DONE(
+        ReduceConstruct(feedback_target.value(), target, new_target, args,
+                        feedback_source),
+        SetAccumulator);
+  }
+
+  if (compiler::OptionalHeapObjectRef maybe_constant = TryGetConstant(target)) {
+    PROCESS_AND_RETURN_IF_DONE(
+        ReduceConstruct(maybe_constant.value(), target, new_target, args,
+                        feedback_source),
+        SetAccumulator);
+  }
+
+  ValueNode* context = GetContext();
+  SetAccumulator(BuildGenericConstruct(target, new_target, context, args,
+                                       feedback_source));
+}
+
+void MaglevGraphBuilder::VisitConstruct() {
+  ValueNode* new_target = GetAccumulatorTagged();
+  ValueNode* target = LoadRegisterTagged(0);
+  interpreter::RegisterList reg_list = iterator_.GetRegisterListOperand(1);
+  FeedbackSlot slot = GetSlotOperand(3);
+  compiler::FeedbackSource feedback_source{feedback(), slot};
+  CallArguments args(ConvertReceiverMode::kNullOrUndefined, reg_list,
+                     current_interpreter_frame_);
+  BuildConstruct(target, new_target, args, feedback_source);
 }
 
 void MaglevGraphBuilder::VisitConstructWithSpread() {
@@ -5103,16 +7350,23 @@ void MaglevGraphBuilder::VisitTestGreaterThanOrEqual() {
 MaglevGraphBuilder::InferHasInPrototypeChainResult
 MaglevGraphBuilder::InferHasInPrototypeChain(
     ValueNode* receiver, compiler::HeapObjectRef prototype) {
-  auto stable_it = known_node_aspects().stable_maps.find(receiver);
-  auto unstable_it = known_node_aspects().unstable_maps.find(receiver);
-  auto stable_end = known_node_aspects().stable_maps.end();
-  auto unstable_end = known_node_aspects().unstable_maps.end();
-  // If either of the map sets is not found, then we don't know anything about
-  // the map of the receiver, so bail.
-  if (stable_it == stable_end || unstable_it == unstable_end) {
+  auto node_info = known_node_aspects().TryGetInfoFor(receiver);
+  // If the map set is not found, then we don't know anything about the map of
+  // the receiver, so bail.
+  if (!node_info || !node_info->possible_maps_are_known()) {
     return kMayBeInPrototypeChain;
   }
 
+  // If the set of possible maps is empty, then there's no possible map for this
+  // receiver, therefore this path is unreachable at runtime. We're unlikely to
+  // ever hit this case, BuildCheckMaps should already unconditionally deopt,
+  // but check it in case another checking operation fails to statically
+  // unconditionally deopt.
+  if (node_info->possible_maps().is_empty()) {
+    // TODO(leszeks): Add an unreachable assert here.
+    return kIsNotInPrototypeChain;
+  }
+
   ZoneVector<compiler::MapRef> receiver_map_refs(zone());
 
   // Try to determine either that all of the {receiver_maps} have the given
@@ -5120,36 +7374,33 @@ MaglevGraphBuilder::InferHasInPrototypeChain(
   // kMayBeInPrototypeChain.
   bool all = true;
   bool none = true;
-  for (const ZoneHandleSet<Map>& map_set :
-       {stable_it->second, unstable_it->second}) {
-    for (Handle<Map> map_handle : map_set) {
-      compiler::MapRef map = MakeRefAssumeMemoryFence(broker(), map_handle);
-      receiver_map_refs.push_back(map);
-      while (true) {
-        if (IsSpecialReceiverInstanceType(map.instance_type())) {
-          return kMayBeInPrototypeChain;
-        }
-        if (!map.IsJSObjectMap()) {
-          all = false;
-          break;
-        }
-        compiler::HeapObjectRef map_prototype = map.prototype(broker());
-        if (map_prototype.equals(prototype)) {
-          none = false;
-          break;
-        }
-        map = map_prototype.map(broker());
-        // TODO(v8:11457) Support dictionary mode protoypes here.
-        if (!map.is_stable() || map.is_dictionary_map()) {
-          return kMayBeInPrototypeChain;
-        }
-        if (map.oddball_type(broker()) == compiler::OddballType::kNull) {
-          all = false;
-          break;
-        }
+  for (compiler::MapRef map : node_info->possible_maps()) {
+    receiver_map_refs.push_back(map);
+    while (true) {
+      if (IsSpecialReceiverInstanceType(map.instance_type())) {
+        return kMayBeInPrototypeChain;
+      }
+      if (!map.IsJSObjectMap()) {
+        all = false;
+        break;
+      }
+      compiler::HeapObjectRef map_prototype = map.prototype(broker());
+      if (map_prototype.equals(prototype)) {
+        none = false;
+        break;
+      }
+      map = map_prototype.map(broker());
+      // TODO(v8:11457) Support dictionary mode protoypes here.
+      if (!map.is_stable() || map.is_dictionary_map()) {
+        return kMayBeInPrototypeChain;
+      }
+      if (map.oddball_type(broker()) == compiler::OddballType::kNull) {
+        all = false;
+        break;
       }
     }
   }
+  DCHECK(!receiver_map_refs.empty());
   DCHECK_IMPLIES(all, !none);
   if (!all && !none) return kMayBeInPrototypeChain;
 
@@ -5173,30 +7424,25 @@ MaglevGraphBuilder::InferHasInPrototypeChain(
   return all ? kIsInPrototypeChain : kIsNotInPrototypeChain;
 }
 
-bool MaglevGraphBuilder::TryBuildFastHasInPrototypeChain(
-    ValueNode* object, compiler::ObjectRef prototype) {
-  if (!prototype.IsHeapObject()) return false;
-  auto in_prototype_chain =
-      InferHasInPrototypeChain(object, prototype.AsHeapObject());
-  if (in_prototype_chain == kMayBeInPrototypeChain) return false;
+ReduceResult MaglevGraphBuilder::TryBuildFastHasInPrototypeChain(
+    ValueNode* object, compiler::HeapObjectRef prototype) {
+  auto in_prototype_chain = InferHasInPrototypeChain(object, prototype);
+  if (in_prototype_chain == kMayBeInPrototypeChain) return ReduceResult::Fail();
 
-  SetAccumulator(GetBooleanConstant(in_prototype_chain == kIsInPrototypeChain));
-  return true;
+  return GetBooleanConstant(in_prototype_chain == kIsInPrototypeChain);
 }
 
-void MaglevGraphBuilder::BuildHasInPrototypeChain(
-    ValueNode* object, compiler::ObjectRef prototype) {
-  if (TryBuildFastHasInPrototypeChain(object, prototype)) return;
-
-  SetAccumulator(BuildCallRuntime(Runtime::kHasInPrototypeChain,
-                                  {object, GetConstant(prototype)}));
+ReduceResult MaglevGraphBuilder::BuildHasInPrototypeChain(
+    ValueNode* object, compiler::HeapObjectRef prototype) {
+  RETURN_IF_DONE(TryBuildFastHasInPrototypeChain(object, prototype));
+  return AddNewNode<HasInPrototypeChain>({object}, prototype);
 }
 
-bool MaglevGraphBuilder::TryBuildFastOrdinaryHasInstance(
+ReduceResult MaglevGraphBuilder::TryBuildFastOrdinaryHasInstance(
     ValueNode* object, compiler::JSObjectRef callable,
     ValueNode* callable_node_if_not_constant) {
   const bool is_constant = callable_node_if_not_constant == nullptr;
-  if (!is_constant) return false;
+  if (!is_constant) return ReduceResult::Fail();
 
   if (callable.IsJSBoundFunction()) {
     // OrdinaryHasInstance on bound functions turns into a recursive
@@ -5205,15 +7451,15 @@ bool MaglevGraphBuilder::TryBuildFastOrdinaryHasInstance(
     compiler::JSReceiverRef bound_target_function =
         function.bound_target_function(broker());
 
-    if (!bound_target_function.IsJSObject() ||
-        !TryBuildFastInstanceOf(object, bound_target_function.AsJSObject(),
-                                nullptr)) {
-      // If we can't build a fast instance-of, build a slow one with the
-      // partial optimisation of using the bound target function constant.
-      SetAccumulator(BuildCallBuiltin<Builtin::kInstanceOf>(
-          {object, GetConstant(bound_target_function)}));
+    if (bound_target_function.IsJSObject()) {
+      RETURN_IF_DONE(TryBuildFastInstanceOf(
+          object, bound_target_function.AsJSObject(), nullptr));
     }
-    return true;
+
+    // If we can't build a fast instance-of, build a slow one with the
+    // partial optimisation of using the bound target function constant.
+    return BuildCallBuiltin<Builtin::kInstanceOf>(
+        {object, GetConstant(bound_target_function)});
   }
 
   if (callable.IsJSFunction()) {
@@ -5225,31 +7471,30 @@ bool MaglevGraphBuilder::TryBuildFastOrdinaryHasInstance(
     if (!function.map(broker()).has_prototype_slot() ||
         !function.has_instance_prototype(broker()) ||
         function.PrototypeRequiresRuntimeLookup(broker())) {
-      return false;
+      return ReduceResult::Fail();
     }
 
-    compiler::ObjectRef prototype =
+    compiler::HeapObjectRef prototype =
         broker()->dependencies()->DependOnPrototypeProperty(function);
-    BuildHasInPrototypeChain(object, prototype);
-    return true;
+    return BuildHasInPrototypeChain(object, prototype);
   }
 
-  return false;
+  return ReduceResult::Fail();
 }
 
-void MaglevGraphBuilder::BuildOrdinaryHasInstance(
+ReduceResult MaglevGraphBuilder::BuildOrdinaryHasInstance(
     ValueNode* object, compiler::JSObjectRef callable,
     ValueNode* callable_node_if_not_constant) {
-  if (TryBuildFastOrdinaryHasInstance(object, callable,
-                                      callable_node_if_not_constant))
-    return;
+  RETURN_IF_DONE(TryBuildFastOrdinaryHasInstance(
+      object, callable, callable_node_if_not_constant));
 
-  SetAccumulator(BuildCallBuiltin<Builtin::kOrdinaryHasInstance>(
-      {object, callable_node_if_not_constant ? callable_node_if_not_constant
-                                             : GetConstant(callable)}));
+  return BuildCallBuiltin<Builtin::kOrdinaryHasInstance>(
+      {callable_node_if_not_constant ? callable_node_if_not_constant
+                                     : GetConstant(callable),
+       object});
 }
 
-bool MaglevGraphBuilder::TryBuildFastInstanceOf(
+ReduceResult MaglevGraphBuilder::TryBuildFastInstanceOf(
     ValueNode* object, compiler::JSObjectRef callable,
     ValueNode* callable_node_if_not_constant) {
   compiler::MapRef receiver_map = callable.map(broker());
@@ -5259,7 +7504,7 @@ bool MaglevGraphBuilder::TryBuildFastInstanceOf(
 
   // TODO(v8:11457) Support dictionary mode holders here.
   if (access_info.IsInvalid() || access_info.HasDictionaryHolder()) {
-    return false;
+    return ReduceResult::Fail();
   }
   access_info.RecordDependencies(broker()->dependencies());
 
@@ -5267,7 +7512,7 @@ bool MaglevGraphBuilder::TryBuildFastInstanceOf(
     // If there's no @@hasInstance handler, the OrdinaryHasInstance operation
     // takes over, but that requires the constructor to be callable.
     if (!receiver_map.is_callable()) {
-      return false;
+      return ReduceResult::Fail();
     }
 
     broker()->dependencies()->DependOnStablePrototypeChains(
@@ -5275,12 +7520,23 @@ bool MaglevGraphBuilder::TryBuildFastInstanceOf(
 
     // Monomorphic property access.
     if (callable_node_if_not_constant) {
-      BuildCheckMaps(callable_node_if_not_constant,
-                     base::VectorOf(access_info.lookup_start_object_maps()));
+      RETURN_IF_ABORT(BuildCheckMaps(
+          callable_node_if_not_constant,
+          base::VectorOf(access_info.lookup_start_object_maps())));
+    } else {
+      // Even if we have a constant receiver, we still have to make sure its
+      // map is correct, in case it migrates.
+      if (receiver_map.is_stable()) {
+        broker()->dependencies()->DependOnStableMap(receiver_map);
+      } else {
+        RETURN_IF_ABORT(BuildCheckMaps(
+            GetConstant(callable),
+            base::VectorOf(access_info.lookup_start_object_maps())));
+      }
     }
 
-    BuildOrdinaryHasInstance(object, callable, callable_node_if_not_constant);
-    return true;
+    return BuildOrdinaryHasInstance(object, callable,
+                                    callable_node_if_not_constant);
   }
 
   if (access_info.IsFastDataConstant()) {
@@ -5295,7 +7551,7 @@ bool MaglevGraphBuilder::TryBuildFastInstanceOf(
     if (!has_instance_field.has_value() ||
         !has_instance_field->IsHeapObject() ||
         !has_instance_field->AsHeapObject().map(broker()).is_callable()) {
-      return false;
+      return ReduceResult::Fail();
     }
 
     if (found_on_proto) {
@@ -5307,55 +7563,141 @@ bool MaglevGraphBuilder::TryBuildFastInstanceOf(
     ValueNode* callable_node;
     if (callable_node_if_not_constant) {
       // Check that {callable_node_if_not_constant} is actually {callable}.
-      BuildCheckValue(callable_node_if_not_constant, callable);
+      RETURN_IF_ABORT(BuildCheckValue(callable_node_if_not_constant, callable));
       callable_node = callable_node_if_not_constant;
     } else {
       callable_node = GetConstant(callable);
     }
-    BuildCheckMaps(callable_node,
-                   base::VectorOf(access_info.lookup_start_object_maps()));
+    RETURN_IF_ABORT(BuildCheckMaps(
+        callable_node, base::VectorOf(access_info.lookup_start_object_maps())));
+
+    // Special case the common case, where @@hasInstance is
+    // Function.p.hasInstance. In this case we don't need to call ToBoolean (or
+    // use the continuation), since OrdinaryHasInstance is guaranteed to return
+    // a boolean.
+    if (has_instance_field->IsJSFunction()) {
+      compiler::SharedFunctionInfoRef shared =
+          has_instance_field->AsJSFunction().shared(broker());
+      if (shared.HasBuiltinId() &&
+          shared.builtin_id() == Builtin::kFunctionPrototypeHasInstance) {
+        return BuildOrdinaryHasInstance(object, callable,
+                                        callable_node_if_not_constant);
+      }
+    }
 
     // Call @@hasInstance
     CallArguments args(ConvertReceiverMode::kNotNullOrUndefined,
                        {callable_node, object});
     ValueNode* call_result;
     {
+      // Checkpoint for eager deopts before creating the lazy deopt scope, so
+      // that reduced builtin calls that eager deopt don't pick up the lazy
+      // deopt continuation.
+      GetLatestCheckpointedFrame();
+
       // Make sure that a lazy deopt after the @@hasInstance call also performs
       // ToBoolean before returning to the interpreter.
-      LazyDeoptContinuationScope continuation_scope(
+      DeoptFrameScope continuation_scope(
           this, Builtin::kToBooleanLazyDeoptContinuation);
-      ReduceResult result = ReduceCall(*has_instance_field, args);
+
+      if (has_instance_field->IsJSFunction()) {
+        ReduceResult result =
+            ReduceCallForConstant(has_instance_field->AsJSFunction(), args);
+        DCHECK(!result.IsDoneWithAbort());
+        call_result = result.value();
+      } else {
+        call_result = BuildGenericCall(GetConstant(*has_instance_field),
+                                       Call::TargetType::kAny, args);
+      }
       // TODO(victorgomes): Propagate the case if we need to soft deopt.
-      DCHECK(!result.IsDoneWithAbort());
-      call_result = result.value();
     }
 
-    // TODO(v8:7700): Do we need to call ToBoolean here? If we have reduce the
-    // call further, we might already have a boolean constant as result.
-    // TODO(leszeks): Avoid forcing a conversion to tagged here.
-    SetAccumulator(AddNewNode<ToBoolean>({GetTaggedValue(call_result)}));
-    return true;
+    return BuildToBoolean(call_result);
+  }
+
+  return ReduceResult::Fail();
+}
+
+template <bool flip>
+ValueNode* MaglevGraphBuilder::BuildToBoolean(ValueNode* value) {
+  if (IsConstantNode(value->opcode())) {
+    return GetBooleanConstant(FromConstantToBool(local_isolate(), value) ^
+                              flip);
+  }
+
+  switch (value->value_representation()) {
+    case ValueRepresentation::kFloat64:
+    case ValueRepresentation::kHoleyFloat64:
+      // The ToBoolean of both the_hole and NaN is false, so we can use the
+      // same operation for HoleyFloat64 and Float64.
+      return AddNewNode<Float64ToBoolean>({value}, flip);
+
+    case ValueRepresentation::kUint32:
+      // Uint32 has the same logic as Int32 when converting ToBoolean, namely
+      // comparison against zero, so we can cast it and ignore the signedness.
+      value = AddNewNode<TruncateUint32ToInt32>({value});
+      V8_FALLTHROUGH;
+    case ValueRepresentation::kInt32:
+      return AddNewNode<Int32ToBoolean>({value}, flip);
+
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
+
+    case ValueRepresentation::kTagged:
+      break;
+  }
+
+  NodeInfo* node_info = known_node_aspects().TryGetInfoFor(value);
+  if (node_info) {
+    if (ValueNode* as_int32 = node_info->alternative().int32()) {
+      return AddNewNode<Int32ToBoolean>({as_int32}, flip);
+    }
+    if (ValueNode* as_float64 = node_info->alternative().float64()) {
+      return AddNewNode<Float64ToBoolean>({as_float64}, flip);
+    }
   }
 
-  return false;
+  NodeType value_type;
+  if (CheckType(value, NodeType::kJSReceiver, &value_type)) {
+    return GetBooleanConstant(!flip);
+  }
+  ValueNode* falsy_value = nullptr;
+  if (CheckType(value, NodeType::kString)) {
+    falsy_value = GetRootConstant(RootIndex::kempty_string);
+  } else if (CheckType(value, NodeType::kSmi)) {
+    falsy_value = GetSmiConstant(0);
+  }
+  if (falsy_value != nullptr) {
+    return AddNewNode<std::conditional_t<flip, TaggedEqual, TaggedNotEqual>>(
+        {value, falsy_value});
+  }
+  if (CheckType(value, NodeType::kBoolean)) {
+    if (flip) {
+      value = AddNewNode<LogicalNot>({value});
+    }
+    return value;
+  }
+  return AddNewNode<std::conditional_t<flip, ToBooleanLogicalNot, ToBoolean>>(
+      {value}, GetCheckType(value_type));
 }
 
-bool MaglevGraphBuilder::TryBuildFastInstanceOfWithFeedback(
+ReduceResult MaglevGraphBuilder::TryBuildFastInstanceOfWithFeedback(
     ValueNode* object, ValueNode* callable,
     compiler::FeedbackSource feedback_source) {
   compiler::ProcessedFeedback const& feedback =
       broker()->GetFeedbackForInstanceOf(feedback_source);
 
-  // TurboFan emits generic code when there's no feedback, rather than
-  // deopting.
-  if (feedback.IsInsufficient()) return false;
+  if (feedback.IsInsufficient()) {
+    return EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForInstanceOf);
+  }
 
   // Check if the right hand side is a known receiver, or
   // we have feedback from the InstanceOfIC.
-  if (callable->Is<Constant>() &&
-      callable->Cast<Constant>()->object().IsJSObject()) {
-    compiler::JSObjectRef callable_ref =
-        callable->Cast<Constant>()->object().AsJSObject();
+  compiler::OptionalHeapObjectRef maybe_constant;
+  if ((maybe_constant = TryGetConstant(callable)) &&
+      maybe_constant.value().IsJSObject()) {
+    compiler::JSObjectRef callable_ref = maybe_constant.value().AsJSObject();
     return TryBuildFastInstanceOf(object, callable_ref, nullptr);
   }
   if (feedback_source.IsValid()) {
@@ -5365,7 +7707,7 @@ bool MaglevGraphBuilder::TryBuildFastInstanceOfWithFeedback(
       return TryBuildFastInstanceOf(object, *callable_from_feedback, callable);
     }
   }
-  return false;
+  return ReduceResult::Fail();
 }
 
 void MaglevGraphBuilder::VisitTestInstanceOf() {
@@ -5375,9 +7717,9 @@ void MaglevGraphBuilder::VisitTestInstanceOf() {
   FeedbackSlot slot = GetSlotOperand(1);
   compiler::FeedbackSource feedback_source{feedback(), slot};
 
-  if (TryBuildFastInstanceOfWithFeedback(object, callable, feedback_source)) {
-    return;
-  }
+  ReduceResult result =
+      TryBuildFastInstanceOfWithFeedback(object, callable, feedback_source);
+  PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
 
   ValueNode* context = GetContext();
   SetAccumulator(
@@ -5401,17 +7743,45 @@ void MaglevGraphBuilder::VisitTestIn() {
 void MaglevGraphBuilder::VisitToName() {
   // ToObject <dst>
   ValueNode* value = GetAccumulatorTagged();
-  interpreter::Register destination = iterator_.GetRegisterOperand(0);
   if (CheckType(value, NodeType::kName)) {
-    MoveNodeBetweenRegisters(interpreter::Register::virtual_accumulator(),
-                             destination);
+    SetAccumulator(value);
   } else {
-    StoreRegister(destination, AddNewNode<ToName>({GetContext(), value}));
+    SetAccumulator(AddNewNode<ToName>({GetContext(), value}));
   }
 }
 
+ValueNode* MaglevGraphBuilder::BuildToString(ValueNode* value,
+                                             ToString::ConversionMode mode) {
+  if (CheckType(value, NodeType::kString)) return value;
+  // TODO(victorgomes): Add fast path for constant primitives.
+  if (CheckType(value, NodeType::kNumber)) {
+    // TODO(verwaest): Float64ToString if float.
+    return AddNewNode<NumberToString>({GetTaggedValue(value)});
+  }
+  return AddNewNode<ToString>({GetContext(), GetTaggedValue(value)}, mode);
+}
+
 void MaglevGraphBuilder::BuildToNumberOrToNumeric(Object::Conversion mode) {
-  ValueNode* value = GetAccumulatorTagged();
+  ValueNode* value = GetRawAccumulator();
+  switch (value->value_representation()) {
+    case ValueRepresentation::kInt32:
+    case ValueRepresentation::kUint32:
+    case ValueRepresentation::kFloat64:
+      return;
+
+    case ValueRepresentation::kHoleyFloat64: {
+      SetAccumulator(AddNewNode<HoleyFloat64ToMaybeNanFloat64>({value}));
+      return;
+    }
+
+    case ValueRepresentation::kTagged:
+      // We'll insert the required checks depending on the feedback.
+      break;
+
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
+  }
+
   FeedbackSlot slot = GetSlotOperand(0);
   switch (broker()->GetFeedbackForBinaryOperation(
       compiler::FeedbackSource(feedback(), slot))) {
@@ -5435,8 +7805,7 @@ void MaglevGraphBuilder::BuildToNumberOrToNumeric(Object::Conversion mode) {
     case BinaryOperationHint::kString:
     case BinaryOperationHint::kAny:
       if (CheckType(value, NodeType::kNumber)) return;
-      SetAccumulator(
-          AddNewNode<ToNumberOrNumeric>({GetContext(), value}, mode));
+      SetAccumulator(AddNewNode<ToNumberOrNumeric>({value}, mode));
       break;
   }
 }
@@ -5452,20 +7821,43 @@ void MaglevGraphBuilder::VisitToObject() {
   // ToObject <dst>
   ValueNode* value = GetAccumulatorTagged();
   interpreter::Register destination = iterator_.GetRegisterOperand(0);
-  if (CheckType(value, NodeType::kJSReceiver)) {
+  NodeType old_type;
+  if (CheckType(value, NodeType::kJSReceiver, &old_type)) {
     MoveNodeBetweenRegisters(interpreter::Register::virtual_accumulator(),
                              destination);
   } else {
-    StoreRegister(destination, AddNewNode<ToObject>({GetContext(), value}));
+    StoreRegister(destination, AddNewNode<ToObject>({GetContext(), value},
+                                                    GetCheckType(old_type)));
   }
 }
 
 void MaglevGraphBuilder::VisitToString() {
   // ToString
   ValueNode* value = GetAccumulatorTagged();
-  if (CheckType(value, NodeType::kString)) return;
-  // TODO(victorgomes): Add fast path for constant primitives.
-  SetAccumulator(AddNewNode<ToString>({GetContext(), value}));
+  SetAccumulator(BuildToString(value, ToString::kThrowOnSymbol));
+}
+
+void MaglevGraphBuilder::VisitToBoolean() {
+  SetAccumulator(BuildToBoolean(GetRawAccumulator()));
+}
+
+void FastObject::ClearFields() {
+  for (int i = 0; i < inobject_properties; i++) {
+    fields[i] = FastField();
+  }
+}
+
+FastObject::FastObject(compiler::JSFunctionRef constructor, Zone* zone,
+                       compiler::JSHeapBroker* broker)
+    : map(constructor.initial_map(broker)) {
+  compiler::SlackTrackingPrediction prediction =
+      broker->dependencies()->DependOnInitialMapInstanceSizePrediction(
+          constructor);
+  inobject_properties = prediction.inobject_property_count();
+  instance_size = prediction.instance_size();
+  fields = zone->AllocateArray<FastField>(inobject_properties);
+  ClearFields();
+  elements = FastFixedArray();
 }
 
 void MaglevGraphBuilder::VisitCreateRegExpLiteral() {
@@ -5489,13 +7881,16 @@ void MaglevGraphBuilder::VisitCreateArrayLiteral() {
 
   compiler::ProcessedFeedback const& processed_feedback =
       broker()->GetFeedbackForArrayOrObjectLiteral(feedback_source);
-  if (!processed_feedback.IsInsufficient()) {
-    ReduceResult result =
-        TryBuildFastCreateObjectOrArrayLiteral(processed_feedback.AsLiteral());
-    PROCESS_AND_RETURN_IF_DONE(
-        result, [&](ValueNode* value) { SetAccumulator(value); });
+
+  if (processed_feedback.IsInsufficient()) {
+    RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForArrayLiteral));
   }
 
+  ReduceResult result =
+      TryBuildFastCreateObjectOrArrayLiteral(processed_feedback.AsLiteral());
+  PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
+
   if (interpreter::CreateArrayLiteralFlags::FastCloneSupportedBit::decode(
           bytecode_flags)) {
     // TODO(victorgomes): CreateShallowArrayLiteral should not need the
@@ -5516,14 +7911,30 @@ void MaglevGraphBuilder::VisitCreateArrayFromIterable() {
 }
 
 void MaglevGraphBuilder::VisitCreateEmptyArrayLiteral() {
-  // TODO(v8:7700): Consider inlining the allocation.
   FeedbackSlot slot_index = GetSlotOperand(0);
-  SetAccumulator(AddNewNode<CreateEmptyArrayLiteral>(
-      {}, compiler::FeedbackSource{feedback(), slot_index}));
+  compiler::FeedbackSource feedback_source(feedback(), slot_index);
+  compiler::ProcessedFeedback const& processed_feedback =
+      broker()->GetFeedbackForArrayOrObjectLiteral(feedback_source);
+  if (processed_feedback.IsInsufficient()) {
+    RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForArrayLiteral));
+  }
+  compiler::AllocationSiteRef site = processed_feedback.AsLiteral().value();
+
+  broker()->dependencies()->DependOnElementsKind(site);
+  ElementsKind kind = site.GetElementsKind();
+
+  compiler::NativeContextRef native_context = broker()->target_native_context();
+  compiler::MapRef map = native_context.GetInitialJSArrayMap(broker(), kind);
+  FastObject literal(map, zone(), {});
+  literal.js_array_length = MakeRef(broker(), Object::cast(Smi::zero()));
+  SetAccumulator(BuildAllocateFastObject(literal, AllocationType::kYoung));
+  // TODO(leszeks): Don't eagerly clear the raw allocation, have the next side
+  // effect clear it.
+  ClearCurrentRawAllocation();
 }
 
-base::Optional<FastLiteralObject>
-MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
+base::Optional<FastObject> MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
     compiler::JSObjectRef boilerplate, AllocationType allocation, int max_depth,
     int* max_properties) {
   DCHECK_GE(max_depth, 0);
@@ -5587,7 +7998,7 @@ MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
       boilerplate, JSObject::kElementsOffset, boilerplate_elements);
   int const elements_length = boilerplate_elements.length();
 
-  FastLiteralObject fast_literal(boilerplate_map, zone(), {});
+  FastObject fast_literal(boilerplate_map, zone(), {});
 
   // Compute the in-object properties to store first.
   int index = 0;
@@ -5624,25 +8035,25 @@ MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
     // via the boilerplate_migration_access lock.
     compiler::ObjectRef boilerplate_value = maybe_boilerplate_value.value();
 
-    FastLiteralField value;
+    FastField value;
     if (boilerplate_value.IsJSObject()) {
       compiler::JSObjectRef boilerplate_object = boilerplate_value.AsJSObject();
-      base::Optional<FastLiteralObject> maybe_object_value =
+      base::Optional<FastObject> maybe_object_value =
           TryReadBoilerplateForFastLiteral(boilerplate_object, allocation,
                                            max_depth - 1, max_properties);
       if (!maybe_object_value.has_value()) return {};
-      value = FastLiteralField(maybe_object_value.value());
+      value = FastField(maybe_object_value.value());
     } else if (property_details.representation().IsDouble()) {
       Float64 number =
           Float64::FromBits(boilerplate_value.AsHeapNumber().value_as_bits());
-      value = FastLiteralField(number);
+      value = FastField(number);
     } else {
       // It's fine to store the 'uninitialized' Oddball into a Smi field since
       // it will get overwritten anyway.
       DCHECK_IMPLIES(property_details.representation().IsSmi() &&
                          !boilerplate_value.IsSmi(),
-                     boilerplate_value.object()->IsUninitialized());
-      value = FastLiteralField(boilerplate_value);
+                     IsUninitialized(*boilerplate_value.object()));
+      value = FastField(boilerplate_value);
     }
 
     DCHECK_LT(index, boilerplate_map.GetInObjectProperties());
@@ -5657,7 +8068,7 @@ MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
     // TODO(wenyuzhao): Fix incorrect MachineType when V8_MAP_PACKING is
     // enabled.
     DCHECK_LT(index, boilerplate_map.GetInObjectProperties());
-    fast_literal.fields[index] = FastLiteralField(MakeRef(
+    fast_literal.fields[index] = FastField(MakeRef(
         broker(), local_isolate()->factory()->one_pointer_filler_map()));
   }
 
@@ -5673,14 +8084,13 @@ MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
         !boilerplate.IsElementsTenured(boilerplate_elements)) {
       return {};
     }
-    fast_literal.elements = FastLiteralFixedArray(boilerplate_elements);
+    fast_literal.elements = FastFixedArray(boilerplate_elements);
   } else {
     // Compute the elements to store first (might have effects).
     if (boilerplate_elements.IsFixedDoubleArray()) {
       int const size = FixedDoubleArray::SizeFor(elements_length);
       if (size > kMaxRegularHeapObjectSize) return {};
-      fast_literal.elements =
-          FastLiteralFixedArray(elements_length, zone(), double{});
+      fast_literal.elements = FastFixedArray(elements_length, zone(), double{});
 
       compiler::FixedDoubleArrayRef elements =
           boilerplate_elements.AsFixedDoubleArray();
@@ -5691,7 +8101,7 @@ MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
     } else {
       int const size = FixedArray::SizeFor(elements_length);
       if (size > kMaxRegularHeapObjectSize) return {};
-      fast_literal.elements = FastLiteralFixedArray(elements_length, zone());
+      fast_literal.elements = FastFixedArray(elements_length, zone());
 
       compiler::FixedArrayRef elements = boilerplate_elements.AsFixedArray();
       for (int i = 0; i < elements_length; ++i) {
@@ -5700,14 +8110,13 @@ MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
             elements.TryGet(broker(), i);
         if (!element_value.has_value()) return {};
         if (element_value->IsJSObject()) {
-          base::Optional<FastLiteralObject> object =
-              TryReadBoilerplateForFastLiteral(element_value->AsJSObject(),
-                                               allocation, max_depth - 1,
-                                               max_properties);
+          base::Optional<FastObject> object = TryReadBoilerplateForFastLiteral(
+              element_value->AsJSObject(), allocation, max_depth - 1,
+              max_properties);
           if (!object.has_value()) return {};
-          fast_literal.elements.values[i] = FastLiteralField(*object);
+          fast_literal.elements.values[i] = FastField(*object);
         } else {
-          fast_literal.elements.values[i] = FastLiteralField(*element_value);
+          fast_literal.elements.values[i] = FastField(*element_value);
         }
       }
     }
@@ -5724,7 +8133,8 @@ MaglevGraphBuilder::TryReadBoilerplateForFastLiteral(
 ValueNode* MaglevGraphBuilder::ExtendOrReallocateCurrentRawAllocation(
     int size, AllocationType allocation_type) {
   if (!current_raw_allocation_ ||
-      current_raw_allocation_->allocation_type() != allocation_type) {
+      current_raw_allocation_->allocation_type() != allocation_type ||
+      !v8_flags.inline_new) {
     current_raw_allocation_ =
         AddNewNode<AllocateRaw>({}, allocation_type, size);
     return current_raw_allocation_;
@@ -5746,25 +8156,22 @@ void MaglevGraphBuilder::ClearCurrentRawAllocation() {
   current_raw_allocation_ = nullptr;
 }
 
-ValueNode* MaglevGraphBuilder::BuildAllocateFastLiteral(
-    FastLiteralObject object, AllocationType allocation_type) {
-  base::SmallVector<ValueNode*, 8, ZoneAllocator<ValueNode*>> properties(
-      object.map.GetInObjectProperties(), ZoneAllocator<ValueNode*>(zone()));
-  for (int i = 0; i < object.map.GetInObjectProperties(); ++i) {
-    properties[i] = BuildAllocateFastLiteral(object.fields[i], allocation_type);
+ValueNode* MaglevGraphBuilder::BuildAllocateFastObject(
+    FastObject object, AllocationType allocation_type) {
+  SmallZoneVector<ValueNode*, 8> properties(object.inobject_properties, zone());
+  for (int i = 0; i < object.inobject_properties; ++i) {
+    properties[i] = BuildAllocateFastObject(object.fields[i], allocation_type);
   }
   ValueNode* elements =
-      BuildAllocateFastLiteral(object.elements, allocation_type);
+      BuildAllocateFastObject(object.elements, allocation_type);
 
   DCHECK(object.map.IsJSObjectMap());
   // TODO(leszeks): Fold allocations.
   ValueNode* allocation = ExtendOrReallocateCurrentRawAllocation(
-      object.map.instance_size(), allocation_type);
-  AddNewNode<StoreMap>({allocation}, object.map);
+      object.instance_size, allocation_type);
+  BuildStoreReceiverMap(allocation, object.map);
   AddNewNode<StoreTaggedFieldNoWriteBarrier>(
-      {allocation,
-       GetConstant(MakeRefAssumeMemoryFence(
-           broker(), local_isolate()->factory()->empty_fixed_array()))},
+      {allocation, GetRootConstant(RootIndex::kEmptyFixedArray)},
       JSObject::kPropertiesOrHashOffset);
   if (object.js_array_length.has_value()) {
     BuildStoreTaggedField(allocation, GetConstant(*object.js_array_length),
@@ -5772,19 +8179,19 @@ ValueNode* MaglevGraphBuilder::BuildAllocateFastLiteral(
   }
 
   BuildStoreTaggedField(allocation, elements, JSObject::kElementsOffset);
-  for (int i = 0; i < object.map.GetInObjectProperties(); ++i) {
+  for (int i = 0; i < object.inobject_properties; ++i) {
     BuildStoreTaggedField(allocation, properties[i],
                           object.map.GetInObjectPropertyOffset(i));
   }
   return allocation;
 }
 
-ValueNode* MaglevGraphBuilder::BuildAllocateFastLiteral(
-    FastLiteralField value, AllocationType allocation_type) {
+ValueNode* MaglevGraphBuilder::BuildAllocateFastObject(
+    FastField value, AllocationType allocation_type) {
   switch (value.type) {
-    case FastLiteralField::kObject:
-      return BuildAllocateFastLiteral(value.object, allocation_type);
-    case FastLiteralField::kMutableDouble: {
+    case FastField::kObject:
+      return BuildAllocateFastObject(value.object, allocation_type);
+    case FastField::kMutableDouble: {
       ValueNode* new_alloc = ExtendOrReallocateCurrentRawAllocation(
           HeapNumber::kSize, allocation_type);
       AddNewNode<StoreMap>(
@@ -5795,25 +8202,24 @@ ValueNode* MaglevGraphBuilder::BuildAllocateFastLiteral(
       AddNewNode<StoreFloat64>(
           {new_alloc, GetFloat64Constant(value.mutable_double_value)},
           HeapNumber::kValueOffset);
+      EnsureType(new_alloc, NodeType::kNumber);
       return new_alloc;
     }
 
-    case FastLiteralField::kConstant:
+    case FastField::kConstant:
       return GetConstant(value.constant_value);
-    case FastLiteralField::kUninitialized:
-      UNREACHABLE();
+    case FastField::kUninitialized:
+      return GetRootConstant(RootIndex::kOnePointerFillerMap);
   }
 }
 
-ValueNode* MaglevGraphBuilder::BuildAllocateFastLiteral(
-    FastLiteralFixedArray value, AllocationType allocation_type) {
+ValueNode* MaglevGraphBuilder::BuildAllocateFastObject(
+    FastFixedArray value, AllocationType allocation_type) {
   switch (value.type) {
-    case FastLiteralFixedArray::kTagged: {
-      base::SmallVector<ValueNode*, 8, ZoneAllocator<ValueNode*>> elements(
-          value.length, ZoneAllocator<ValueNode*>(zone()));
+    case FastFixedArray::kTagged: {
+      SmallZoneVector<ValueNode*, 8> elements(value.length, zone());
       for (int i = 0; i < value.length; ++i) {
-        elements[i] =
-            BuildAllocateFastLiteral(value.values[i], allocation_type);
+        elements[i] = BuildAllocateFastObject(value.values[i], allocation_type);
       }
       ValueNode* allocation = ExtendOrReallocateCurrentRawAllocation(
           FixedArray::SizeFor(value.length), allocation_type);
@@ -5829,9 +8235,10 @@ ValueNode* MaglevGraphBuilder::BuildAllocateFastLiteral(
         BuildStoreTaggedField(allocation, elements[i],
                               FixedArray::OffsetOfElementAt(i));
       }
+      EnsureType(allocation, NodeType::kJSReceiver);
       return allocation;
     }
-    case FastLiteralFixedArray::kDouble: {
+    case FastFixedArray::kDouble: {
       ValueNode* allocation = ExtendOrReallocateCurrentRawAllocation(
           FixedDoubleArray::SizeFor(value.length), allocation_type);
       AddNewNode<StoreMap>(
@@ -5850,10 +8257,10 @@ ValueNode* MaglevGraphBuilder::BuildAllocateFastLiteral(
       }
       return allocation;
     }
-    case FastLiteralFixedArray::kCoW:
+    case FastFixedArray::kCoW:
       return GetConstant(value.cow_value);
-    case FastLiteralFixedArray::kUninitialized:
-      UNREACHABLE();
+    case FastFixedArray::kUninitialized:
+      return GetRootConstant(RootIndex::kEmptyFixedArray);
   }
 }
 
@@ -5867,17 +8274,16 @@ ReduceResult MaglevGraphBuilder::TryBuildFastCreateObjectOrArrayLiteral(
   // First try to extract out the shape and values of the boilerplate, bailing
   // out on complex boilerplates.
   int max_properties = compiler::kMaxFastLiteralProperties;
-  base::Optional<FastLiteralObject> maybe_value =
-      TryReadBoilerplateForFastLiteral(
-          *site.boilerplate(broker()), allocation_type,
-          compiler::kMaxFastLiteralDepth, &max_properties);
+  base::Optional<FastObject> maybe_value = TryReadBoilerplateForFastLiteral(
+      *site.boilerplate(broker()), allocation_type,
+      compiler::kMaxFastLiteralDepth, &max_properties);
   if (!maybe_value.has_value()) return ReduceResult::Fail();
 
   // Then, use the collected information to actually create nodes in the graph.
   // TODO(leszeks): Add support for unwinding graph modifications, so that we
   // can get rid of this two pass approach.
   broker()->dependencies()->DependOnElementsKinds(site);
-  ReduceResult result = BuildAllocateFastLiteral(*maybe_value, allocation_type);
+  ReduceResult result = BuildAllocateFastObject(*maybe_value, allocation_type);
   // TODO(leszeks): Don't eagerly clear the raw allocation, have the next side
   // effect clear it.
   ClearCurrentRawAllocation();
@@ -5895,13 +8301,15 @@ void MaglevGraphBuilder::VisitCreateObjectLiteral() {
 
   compiler::ProcessedFeedback const& processed_feedback =
       broker()->GetFeedbackForArrayOrObjectLiteral(feedback_source);
-  if (!processed_feedback.IsInsufficient()) {
-    ReduceResult result =
-        TryBuildFastCreateObjectOrArrayLiteral(processed_feedback.AsLiteral());
-    PROCESS_AND_RETURN_IF_DONE(
-        result, [&](ValueNode* value) { SetAccumulator(value); });
+  if (processed_feedback.IsInsufficient()) {
+    RETURN_VOID_ON_ABORT(EmitUnconditionalDeopt(
+        DeoptimizeReason::kInsufficientTypeFeedbackForObjectLiteral));
   }
 
+  ReduceResult result =
+      TryBuildFastCreateObjectOrArrayLiteral(processed_feedback.AsLiteral());
+  PROCESS_AND_RETURN_IF_DONE(result, SetAccumulator);
+
   if (interpreter::CreateObjectLiteralFlags::FastCloneSupportedBit::decode(
           bytecode_flags)) {
     // TODO(victorgomes): CreateShallowObjectLiteral should not need the
@@ -5921,7 +8329,12 @@ void MaglevGraphBuilder::VisitCreateEmptyObjectLiteral() {
       native_context.object_function(broker()).initial_map(broker());
   DCHECK(!map.is_dictionary_map());
   DCHECK(!map.IsInobjectSlackTrackingInProgress());
-  SetAccumulator(AddNewNode<CreateEmptyObjectLiteral>({}, map));
+  FastObject literal(map, zone(), {});
+  literal.ClearFields();
+  SetAccumulator(BuildAllocateFastObject(literal, AllocationType::kYoung));
+  // TODO(leszeks): Don't eagerly clear the raw allocation, have the next side
+  // effect clear it.
+  ClearCurrentRawAllocation();
 }
 
 void MaglevGraphBuilder::VisitCloneObject() {
@@ -6055,6 +8468,76 @@ void MaglevGraphBuilder::VisitCreateRestParameter() {
   }
 }
 
+void MaglevGraphBuilder::PeelLoop() {
+  DCHECK(!in_peeled_iteration_);
+  int loop_header = iterator_.current_offset();
+  DCHECK(loop_headers_to_peel_.Contains(loop_header));
+  in_peeled_iteration_ = true;
+  allow_loop_peeling_ = false;
+  while (iterator_.current_bytecode() != interpreter::Bytecode::kJumpLoop) {
+    local_isolate_->heap()->Safepoint();
+    VisitSingleBytecode();
+    iterator_.Advance();
+  }
+  VisitSingleBytecode();
+  in_peeled_iteration_ = false;
+
+  // After processing the peeled iteration and reaching the `JumpLoop`, we
+  // re-process the loop body. For this, we need to reset the graph building
+  // state roughly as if we didn't process it yet.
+
+  // Reset predecessors as if the loop body had not been visited.
+  while (!decremented_predecessor_offsets_.empty()) {
+    DCHECK_GE(decremented_predecessor_offsets_.back(), loop_header);
+    if (decremented_predecessor_offsets_.back() <= iterator_.current_offset()) {
+      predecessors_[decremented_predecessor_offsets_.back()]++;
+    }
+    decremented_predecessor_offsets_.pop_back();
+  }
+
+  // Reset position in exception handler table to before the loop.
+  HandlerTable table(*bytecode().object());
+  while (next_handler_table_index_ > 0) {
+    next_handler_table_index_--;
+    int start = table.GetRangeStart(next_handler_table_index_);
+    if (start < loop_header) break;
+  }
+
+  // Re-create catch handler merge states.
+  for (int offset = loop_header; offset <= iterator_.current_offset();
+       ++offset) {
+    if (auto& merge_state = merge_states_[offset]) {
+      if (merge_state->is_exception_handler()) {
+        merge_state = MergePointInterpreterFrameState::NewForCatchBlock(
+            *compilation_unit_, merge_state->frame_state().liveness(), offset,
+            merge_state->catch_block_context_register(), graph_);
+      } else {
+        // We only peel innermost loops.
+        DCHECK(!merge_state->is_loop());
+        merge_state = nullptr;
+      }
+    }
+    new (&jump_targets_[offset]) BasicBlockRef();
+  }
+
+  if (current_block_) {
+    // After resetting, the new loop header always has exactly 2 predecessors:
+    // the two copies of `JumpLoop`.
+    merge_states_[loop_header] = MergePointInterpreterFrameState::NewForLoop(
+        current_interpreter_frame_, *compilation_unit_, loop_header, 2,
+        GetInLivenessFor(loop_header),
+        &bytecode_analysis_.GetLoopInfoFor(loop_header),
+        /* has_been_peeled */ true);
+
+    BasicBlock* block = FinishBlock<Jump>({}, &jump_targets_[loop_header]);
+    MergeIntoFrameState(block, loop_header);
+  } else {
+    merge_states_[loop_header] = nullptr;
+    predecessors_[loop_header] = 0;
+  }
+  iterator_.SetOffset(loop_header);
+}
+
 void MaglevGraphBuilder::VisitJumpLoop() {
   const uint32_t relative_jump_bytecode_offset =
       iterator_.GetUnsignedImmediateOperand(0);
@@ -6063,31 +8546,36 @@ void MaglevGraphBuilder::VisitJumpLoop() {
   int target = iterator_.GetJumpTargetOffset();
 
   if (ShouldEmitInterruptBudgetChecks()) {
-    if (relative_jump_bytecode_offset > 0) {
-      AddNewNode<ReduceInterruptBudgetForLoop>({},
-                                               relative_jump_bytecode_offset);
-    }
-    AddNewNode<JumpLoopPrologue>({}, loop_offset, feedback_slot,
-                                 BytecodeOffset(iterator_.current_offset()),
-                                 compilation_unit_);
+    AddNewNode<ReduceInterruptBudgetForLoop>(
+        {}, relative_jump_bytecode_offset ? relative_jump_bytecode_offset : 1);
+  } else {
+    AddNewNode<HandleNoHeapWritesInterrupt>({});
+  }
+
+  if (in_peeled_iteration_) {
+    // We have reached the end of the peeled iteration.
+    return;
+  }
+
+  if (ShouldEmitOsrInterruptBudgetChecks()) {
+    AddNewNode<TryOnStackReplacement>(
+        {GetClosure()}, loop_offset, feedback_slot,
+        BytecodeOffset(iterator_.current_offset()), compilation_unit_);
   }
   BasicBlock* block =
       FinishBlock<JumpLoop>({}, jump_targets_[target].block_ptr());
 
-  merge_states_[target]->MergeLoop(*compilation_unit_, graph_->smi(),
-                                   current_interpreter_frame_, block);
+  merge_states_[target]->MergeLoop(this, current_interpreter_frame_, block);
   block->set_predecessor_id(merge_states_[target]->predecessor_count() - 1);
+  if (loop_headers_to_peel_.Contains(iterator_.current_offset())) {
+    allow_loop_peeling_ = true;
+  }
 }
 void MaglevGraphBuilder::VisitJump() {
-  const uint32_t relative_jump_bytecode_offset =
-      iterator_.GetRelativeJumpTargetOffset();
-  if (v8_flags.maglev_increase_budget_forward_jump &&
-      ShouldEmitInterruptBudgetChecks() && relative_jump_bytecode_offset > 0) {
-    AddNewNode<IncreaseInterruptBudget>({}, relative_jump_bytecode_offset);
-  }
   BasicBlock* block =
       FinishBlock<Jump>({}, &jump_targets_[iterator_.GetJumpTargetOffset()]);
   MergeIntoFrameState(block, iterator_.GetJumpTargetOffset());
+  DCHECK_EQ(current_block_, nullptr);
   DCHECK_LT(next_offset(), bytecode().length());
 }
 void MaglevGraphBuilder::VisitJumpConstant() { VisitJump(); }
@@ -6117,16 +8605,22 @@ void MaglevGraphBuilder::VisitJumpIfToBooleanFalseConstant() {
 void MaglevGraphBuilder::MergeIntoFrameState(BasicBlock* predecessor,
                                              int target) {
   if (merge_states_[target] == nullptr) {
-    DCHECK(!bytecode_analysis().IsLoopHeader(target));
+    DCHECK(!bytecode_analysis().IsLoopHeader(target) ||
+           loop_headers_to_peel_.Contains(target));
+    bool jumping_to_peeled_iteration = bytecode_analysis().IsLoopHeader(target);
     const compiler::BytecodeLivenessState* liveness = GetInLivenessFor(target);
+    int num_of_predecessors = NumPredecessors(target);
+    if (jumping_to_peeled_iteration) {
+      // The peeled iteration is missing the backedge.
+      num_of_predecessors--;
+    }
     // If there's no target frame state, allocate a new one.
     merge_states_[target] = MergePointInterpreterFrameState::New(
         *compilation_unit_, current_interpreter_frame_, target,
-        NumPredecessors(target), predecessor, liveness);
+        num_of_predecessors, predecessor, liveness);
   } else {
     // If there already is a frame state, merge.
-    merge_states_[target]->Merge(*compilation_unit_, graph_->smi(),
-                                 current_interpreter_frame_, predecessor);
+    merge_states_[target]->Merge(this, current_interpreter_frame_, predecessor);
   }
 }
 
@@ -6134,6 +8628,9 @@ void MaglevGraphBuilder::MergeDeadIntoFrameState(int target) {
   // If there is no merge state yet, don't create one, but just reduce the
   // number of possible predecessors to zero.
   predecessors_[target]--;
+  if (V8_UNLIKELY(in_peeled_iteration_)) {
+    decremented_predecessor_offsets_.push_back(target);
+  }
   if (merge_states_[target]) {
     // If there already is a frame state, merge.
     merge_states_[target]->MergeDead(*compilation_unit_);
@@ -6149,10 +8646,20 @@ void MaglevGraphBuilder::MergeDeadIntoFrameState(int target) {
 }
 
 void MaglevGraphBuilder::MergeDeadLoopIntoFrameState(int target) {
+  // Check if the Loop entry is dead (e.g. an outer loop from OSR).
+  if (V8_UNLIKELY(!merge_states_[target])) {
+    static_assert(kLoopsMustBeEnteredThroughHeader);
+    return;
+  }
   // If there is no merge state yet, don't create one, but just reduce the
   // number of possible predecessors to zero.
   predecessors_[target]--;
-  if (merge_states_[target]) {
+  if (V8_UNLIKELY(in_peeled_iteration_)) {
+    decremented_predecessor_offsets_.push_back(target);
+  }
+  if (merge_states_[target]->is_unreachable_loop()) {
+    static_assert(MaglevGraphBuilder::kLoopsMustBeEnteredThroughHeader);
+  } else {
     // If there already is a frame state, merge.
     merge_states_[target]->MergeDeadLoop(*compilation_unit_);
   }
@@ -6176,16 +8683,76 @@ void MaglevGraphBuilder::MergeIntoInlinedReturnFrameState(
     // Again, all returns should have the same liveness, so double check this.
     DCHECK(GetInLiveness()->Equals(
         *merge_states_[target]->frame_state().liveness()));
-    merge_states_[target]->Merge(*compilation_unit_, graph_->smi(),
-                                 current_interpreter_frame_, predecessor);
+    merge_states_[target]->Merge(this, current_interpreter_frame_, predecessor);
+  }
+}
+
+MaglevGraphBuilder::JumpType MaglevGraphBuilder::NegateJumpType(
+    JumpType jump_type) {
+  switch (jump_type) {
+    case JumpType::kJumpIfTrue:
+      return JumpType::kJumpIfFalse;
+    case JumpType::kJumpIfFalse:
+      return JumpType::kJumpIfTrue;
+  }
+}
+
+BasicBlock* MaglevGraphBuilder::BuildBranchIfReferenceEqual(
+    ValueNode* lhs, ValueNode* rhs, BasicBlockRef* true_target,
+    BasicBlockRef* false_target) {
+  if (RootConstant* root_constant = rhs->TryCast<RootConstant>()) {
+    return FinishBlock<BranchIfRootConstant>({lhs}, root_constant->index(),
+                                             true_target, false_target);
   }
+  if (RootConstant* root_constant = lhs->TryCast<RootConstant>()) {
+    return FinishBlock<BranchIfRootConstant>({rhs}, root_constant->index(),
+                                             true_target, false_target);
+  }
+
+  return FinishBlock<BranchIfReferenceEqual>({lhs, rhs}, true_target,
+                                             false_target);
 }
 
-void MaglevGraphBuilder::BuildBranchIfRootConstant(ValueNode* node,
-                                                   JumpType jump_type,
-                                                   RootIndex root_index) {
+void MaglevGraphBuilder::BuildBranchIfRootConstant(
+    ValueNode* node, JumpType jump_type, RootIndex root_index,
+    BranchSpecializationMode mode) {
+  ValueNode* original_node = node;
+  JumpType original_jump_type = jump_type;
+
   int fallthrough_offset = next_offset();
   int jump_offset = iterator_.GetJumpTargetOffset();
+
+  BasicBlockRef *true_target, *false_target;
+  if (jump_type == kJumpIfTrue) {
+    true_target = &jump_targets_[jump_offset];
+    false_target = &jump_targets_[fallthrough_offset];
+  } else {
+    true_target = &jump_targets_[fallthrough_offset];
+    false_target = &jump_targets_[jump_offset];
+  }
+
+  if (root_index != RootIndex::kTrueValue &&
+      root_index != RootIndex::kFalseValue &&
+      CheckType(node, NodeType::kBoolean)) {
+    bool is_jump_taken = jump_type == kJumpIfFalse;
+    if (is_jump_taken) {
+      BasicBlock* block = FinishBlock<Jump>({}, &jump_targets_[jump_offset]);
+      MergeDeadIntoFrameState(fallthrough_offset);
+      MergeIntoFrameState(block, jump_offset);
+    } else {
+      MergeDeadIntoFrameState(jump_offset);
+    }
+    return;
+  }
+
+  while (LogicalNot* logical_not = node->TryCast<LogicalNot>()) {
+    // Bypassing logical not(s) on the input and swapping true/false
+    // destinations.
+    node = logical_not->value().node();
+    std::swap(true_target, false_target);
+    jump_type = NegateJumpType(jump_type);
+  }
+
   if (RootConstant* c = node->TryCast<RootConstant>()) {
     bool constant_is_match = c->index() == root_index;
     bool is_jump_taken = constant_is_match == (jump_type == kJumpIfTrue);
@@ -6199,30 +8766,109 @@ void MaglevGraphBuilder::BuildBranchIfRootConstant(ValueNode* node,
     return;
   }
 
-  BasicBlockRef *true_target, *false_target;
-  int true_interrupt_correction, false_interrupt_correction;
-  if (jump_type == kJumpIfTrue) {
-    true_target = &jump_targets_[jump_offset];
-    true_interrupt_correction = iterator_.GetRelativeJumpTargetOffset();
-    false_target = &jump_targets_[fallthrough_offset];
-    false_interrupt_correction = 0;
+  BasicBlock* block;
+  if (root_index == RootIndex::kTrueValue ||
+      root_index == RootIndex::kFalseValue) {
+    if (root_index == RootIndex::kFalseValue) {
+      std::swap(true_target, false_target);
+    }
+    switch (node->opcode()) {
+      case Opcode::kTaggedEqual: {
+        block = BuildBranchIfReferenceEqual(
+            node->Cast<TaggedEqual>()->lhs().node(),
+            node->Cast<TaggedEqual>()->rhs().node(), true_target, false_target);
+        break;
+      }
+      case Opcode::kTaggedNotEqual:
+        block = BuildBranchIfReferenceEqual(
+            node->Cast<TaggedNotEqual>()->lhs().node(),
+            node->Cast<TaggedNotEqual>()->rhs().node(),
+            // Swapped true and false targets.
+            false_target, true_target);
+        break;
+      case Opcode::kInt32Compare:
+        block = FinishBlock<BranchIfInt32Compare>(
+            {node->Cast<Int32Compare>()->left_input().node(),
+             node->Cast<Int32Compare>()->right_input().node()},
+            node->Cast<Int32Compare>()->operation(), true_target, false_target);
+        break;
+      case Opcode::kFloat64Compare:
+        block = FinishBlock<BranchIfFloat64Compare>(
+            {node->Cast<Float64Compare>()->left_input().node(),
+             node->Cast<Float64Compare>()->right_input().node()},
+            node->Cast<Float64Compare>()->operation(), true_target,
+            false_target);
+        break;
+      case Opcode::kInt32ToBoolean:
+        if (node->Cast<Int32ToBoolean>()->flip()) {
+          std::swap(true_target, false_target);
+        }
+        block = FinishBlock<BranchIfInt32ToBooleanTrue>(
+            {node->Cast<Int32ToBoolean>()->value().node()}, true_target,
+            false_target);
+        break;
+      case Opcode::kFloat64ToBoolean:
+        if (node->Cast<Float64ToBoolean>()->flip()) {
+          std::swap(true_target, false_target);
+        }
+        block = FinishBlock<BranchIfFloat64ToBooleanTrue>(
+            {node->Cast<Float64ToBoolean>()->value().node()}, true_target,
+            false_target);
+        break;
+      case Opcode::kTestUndetectable:
+        block = FinishBlock<BranchIfUndetectable>(
+            {node->Cast<TestUndetectable>()->value().node()},
+            // TODO(leszeks): Could we use the current known_node_info of the
+            // value node instead of the check_type of TestUndetectable?
+            node->Cast<TestUndetectable>()->check_type(), true_target,
+            false_target);
+        break;
+
+      default:
+        block = FinishBlock<BranchIfRootConstant>({node}, RootIndex::kTrueValue,
+                                                  true_target, false_target);
+        break;
+    }
   } else {
-    true_target = &jump_targets_[fallthrough_offset];
-    true_interrupt_correction = 0;
-    false_target = &jump_targets_[jump_offset];
-    false_interrupt_correction = iterator_.GetRelativeJumpTargetOffset();
+    block = FinishBlock<BranchIfRootConstant>({node}, root_index, true_target,
+                                              false_target);
   }
 
-  BasicBlock* block = FinishBlock<BranchIfRootConstant>(
-      {node}, true_target, true_interrupt_correction, false_target,
-      false_interrupt_correction, root_index);
+  // If the node we're checking is in the accumulator, swap it in the branch
+  // with the checked value. Cache whether we want to swap, since after we've
+  // swapped the accumulator isn't the original node anymore.
+  bool swap_accumulator = original_node == GetRawAccumulator();
+
+  if (swap_accumulator) {
+    if (mode == BranchSpecializationMode::kAlwaysBoolean) {
+      SetAccumulatorInBranch(
+          GetBooleanConstant(original_jump_type == kJumpIfTrue));
+    } else if (original_jump_type == kJumpIfTrue) {
+      SetAccumulatorInBranch(GetRootConstant(root_index));
+    } else {
+      SetAccumulatorInBranch(node);
+    }
+  }
 
   MergeIntoFrameState(block, jump_offset);
+
+  if (swap_accumulator) {
+    if (mode == BranchSpecializationMode::kAlwaysBoolean) {
+      SetAccumulatorInBranch(
+          GetBooleanConstant(original_jump_type == kJumpIfFalse));
+    } else if (original_jump_type == kJumpIfFalse) {
+      SetAccumulatorInBranch(GetRootConstant(root_index));
+    } else {
+      SetAccumulatorInBranch(node);
+    }
+  }
+
   StartFallthroughBlock(fallthrough_offset, block);
 }
 void MaglevGraphBuilder::BuildBranchIfTrue(ValueNode* node,
                                            JumpType jump_type) {
-  BuildBranchIfRootConstant(node, jump_type, RootIndex::kTrueValue);
+  BuildBranchIfRootConstant(node, jump_type, RootIndex::kTrueValue,
+                            BranchSpecializationMode::kAlwaysBoolean);
 }
 void MaglevGraphBuilder::BuildBranchIfNull(ValueNode* node,
                                            JumpType jump_type) {
@@ -6232,91 +8878,128 @@ void MaglevGraphBuilder::BuildBranchIfUndefined(ValueNode* node,
                                                 JumpType jump_type) {
   BuildBranchIfRootConstant(node, jump_type, RootIndex::kUndefinedValue);
 }
-void MaglevGraphBuilder::BuildBranchIfToBooleanTrue(ValueNode* node,
-                                                    JumpType jump_type) {
-  int fallthrough_offset = next_offset();
-  int jump_offset = iterator_.GetJumpTargetOffset();
 
-  if (IsConstantNode(node->opcode())) {
-    bool constant_is_true = FromConstantToBool(local_isolate(), node);
-    bool is_jump_taken = constant_is_true == (jump_type == kJumpIfTrue);
-    if (is_jump_taken) {
-      BasicBlock* block = FinishBlock<Jump>({}, &jump_targets_[jump_offset]);
-      MergeDeadIntoFrameState(fallthrough_offset);
-      MergeIntoFrameState(block, jump_offset);
-    } else {
-      MergeDeadIntoFrameState(jump_offset);
+BasicBlock* MaglevGraphBuilder::BuildSpecializedBranchIfCompareNode(
+    ValueNode* node, BasicBlockRef* true_target, BasicBlockRef* false_target) {
+  switch (node->value_representation()) {
+    // The ToBoolean of both the_hole and NaN is false, so we can use the
+    // same operation for HoleyFloat64 and Float64.
+    case ValueRepresentation::kFloat64:
+    case ValueRepresentation::kHoleyFloat64:
+      return FinishBlock<BranchIfFloat64ToBooleanTrue>({node}, true_target,
+                                                       false_target);
+
+    case ValueRepresentation::kUint32:
+      // Uint32 has the same logic as Int32 when converting ToBoolean, namely
+      // comparison against zero, so we can cast it and ignore the signedness.
+      node = AddNewNode<TruncateUint32ToInt32>({node});
+      V8_FALLTHROUGH;
+    case ValueRepresentation::kInt32:
+      return FinishBlock<BranchIfInt32ToBooleanTrue>({node}, true_target,
+                                                     false_target);
+
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
+
+    case ValueRepresentation::kTagged:
+      break;
+  }
+
+  NodeInfo* node_info = known_node_aspects().TryGetInfoFor(node);
+  if (node_info) {
+    if (ValueNode* as_int32 = node_info->alternative().int32()) {
+      return FinishBlock<BranchIfInt32ToBooleanTrue>({as_int32}, true_target,
+                                                     false_target);
     }
+    if (ValueNode* as_float64 = node_info->alternative().float64()) {
+      return FinishBlock<BranchIfFloat64ToBooleanTrue>(
+          {as_float64}, true_target, false_target);
+    }
+  }
+
+  NodeType old_type;
+  if (CheckType(node, NodeType::kBoolean, &old_type)) {
+    return FinishBlock<BranchIfRootConstant>({node}, RootIndex::kTrueValue,
+                                             true_target, false_target);
+  }
+  if (CheckType(node, NodeType::kSmi)) {
+    return FinishBlock<BranchIfReferenceEqual>({node, GetSmiConstant(0)},
+                                               false_target, true_target);
+  }
+  if (CheckType(node, NodeType::kString)) {
+    return FinishBlock<BranchIfRootConstant>({node}, RootIndex::kempty_string,
+                                             false_target, true_target);
+  }
+  // TODO(verwaest): Number or oddball.
+  return FinishBlock<BranchIfToBooleanTrue>({node}, GetCheckType(old_type),
+                                            true_target, false_target);
+}
+
+void MaglevGraphBuilder::BuildBranchIfToBooleanTrue(ValueNode* node,
+                                                    JumpType jump_type) {
+  // If this is a known boolean, use the non-ToBoolean version.
+  if (CheckType(node, NodeType::kBoolean)) {
+    BuildBranchIfTrue(node, jump_type);
     return;
   }
 
+  int fallthrough_offset = next_offset();
+  int jump_offset = iterator_.GetJumpTargetOffset();
+
   BasicBlockRef *true_target, *false_target;
-  int true_interrupt_correction, false_interrupt_correction;
   if (jump_type == kJumpIfTrue) {
     true_target = &jump_targets_[jump_offset];
-    true_interrupt_correction = iterator_.GetRelativeJumpTargetOffset();
     false_target = &jump_targets_[fallthrough_offset];
-    false_interrupt_correction = 0;
   } else {
     true_target = &jump_targets_[fallthrough_offset];
-    true_interrupt_correction = 0;
     false_target = &jump_targets_[jump_offset];
-    false_interrupt_correction = iterator_.GetRelativeJumpTargetOffset();
-  }
-
-  auto make_specialized_branch_if_compare = [&](ValueRepresentation repr,
-                                                ValueNode* cond) {
-    // Note that this function (BuildBranchIfToBooleanTrue) generates either a
-    // BranchIfToBooleanTrue, or a BranchIfFloat64Compare/BranchIfInt32Compare
-    // comparing the {node} with 0. In the former case, the jump is taken if
-    // {node} is non-zero, while in the latter cases, the jump is taken if
-    // {node} is zero. The {true_target} and {false_target} are thus swapped
-    // when we generate a BranchIfFloat64Compare or a BranchIfInt32Compare
-    // below.
-    DCHECK_EQ(repr, cond->value_representation());
-    switch (repr) {
-      case ValueRepresentation::kFloat64:
-        return FinishBlock<BranchIfFloat64Compare>(
-            {cond, GetFloat64Constant(0)}, Operation::kEqual, false_target,
-            false_interrupt_correction, true_target, true_interrupt_correction,
-            BranchIfFloat64Compare::JumpModeIfNaN::kJumpToTrue);
-      case ValueRepresentation::kInt32:
-        return FinishBlock<BranchIfInt32Compare>(
-            {cond, GetInt32Constant(0)}, Operation::kEqual, false_target,
-            false_interrupt_correction, true_target, true_interrupt_correction);
-      default:
-        UNREACHABLE();
-    }
-  };
+  }
 
-  BasicBlock* block;
-  if (node->value_representation() == ValueRepresentation::kInt32) {
-    block =
-        make_specialized_branch_if_compare(ValueRepresentation::kInt32, node);
-  } else if (node->value_representation() == ValueRepresentation::kFloat64) {
-    block =
-        make_specialized_branch_if_compare(ValueRepresentation::kFloat64, node);
+  // There shouldn't be any LogicalNots here, for swapping true/false, since
+  // these are known to be boolean and should have gone throught the
+  // non-ToBoolean path.
+  DCHECK(!node->Is<LogicalNot>());
+
+  bool known_to_boolean_value = false;
+  bool direction_is_true = true;
+  if (IsConstantNode(node->opcode())) {
+    known_to_boolean_value = true;
+    direction_is_true = FromConstantToBool(local_isolate(), node);
   } else {
-    NodeInfo* node_info = known_node_aspects().GetOrCreateInfoFor(node);
-    if (ValueNode* as_int32 = node_info->int32_alternative) {
-      block = make_specialized_branch_if_compare(ValueRepresentation::kInt32,
-                                                 as_int32);
-    } else if (ValueNode* as_float64 = node_info->float64_alternative) {
-      block = make_specialized_branch_if_compare(ValueRepresentation::kFloat64,
-                                                 as_float64);
+    // JSReceivers are true iff they are not marked as undetectable. Check if
+    // all maps have the same detectability, and if yes, the boolean value is
+    // known.
+    NodeInfo* node_info = known_node_aspects().TryGetInfoFor(node);
+    if (node_info && NodeTypeIs(node_info->type(), NodeType::kJSReceiver) &&
+        node_info->possible_maps_are_known()) {
+      bool all_detectable = true;
+      bool all_undetectable = true;
+      for (compiler::MapRef map : node_info->possible_maps()) {
+        bool is_undetectable = map.is_undetectable();
+        all_detectable &= !is_undetectable;
+        all_undetectable &= is_undetectable;
+      }
+      if (all_detectable || all_undetectable) {
+        known_to_boolean_value = true;
+        direction_is_true = all_detectable;
+      }
+    }
+  }
+  if (known_to_boolean_value) {
+    bool is_jump_taken = direction_is_true == (jump_type == kJumpIfTrue);
+    if (is_jump_taken) {
+      BasicBlock* block = FinishBlock<Jump>({}, &jump_targets_[jump_offset]);
+      MergeDeadIntoFrameState(fallthrough_offset);
+      MergeIntoFrameState(block, jump_offset);
     } else {
-      DCHECK(node->value_representation() == ValueRepresentation::kTagged ||
-             node->value_representation() == ValueRepresentation::kUint32);
-      // Uint32 should be rare enough that tagging them shouldn't be too
-      // expensive (we don't have a `BranchIfUint32Compare` node, and adding one
-      // doesn't seem worth it at this point).
-      node = GetTaggedValue(node);
-      block = FinishBlock<BranchIfToBooleanTrue>(
-          {node}, true_target, true_interrupt_correction, false_target,
-          false_interrupt_correction);
+      MergeDeadIntoFrameState(jump_offset);
     }
+    return;
   }
 
+  BasicBlock* block =
+      BuildSpecializedBranchIfCompareNode(node, true_target, false_target);
+
   MergeIntoFrameState(block, jump_offset);
   StartFallthroughBlock(fallthrough_offset, block);
 }
@@ -6345,22 +9028,16 @@ void MaglevGraphBuilder::VisitJumpIfNotUndefined() {
   BuildBranchIfUndefined(GetAccumulatorTagged(), kJumpIfFalse);
 }
 void MaglevGraphBuilder::VisitJumpIfUndefinedOrNull() {
-  int true_interrupt_correction = iterator_.GetRelativeJumpTargetOffset();
-  int false_interrupt_correction = 0;
   BasicBlock* block = FinishBlock<BranchIfUndefinedOrNull>(
       {GetAccumulatorTagged()}, &jump_targets_[iterator_.GetJumpTargetOffset()],
-      true_interrupt_correction, &jump_targets_[next_offset()],
-      false_interrupt_correction);
+      &jump_targets_[next_offset()]);
   MergeIntoFrameState(block, iterator_.GetJumpTargetOffset());
   StartFallthroughBlock(next_offset(), block);
 }
 void MaglevGraphBuilder::VisitJumpIfJSReceiver() {
-  int true_interrupt_correction = iterator_.GetRelativeJumpTargetOffset();
-  int false_interrupt_correction = 0;
   BasicBlock* block = FinishBlock<BranchIfJSReceiver>(
       {GetAccumulatorTagged()}, &jump_targets_[iterator_.GetJumpTargetOffset()],
-      true_interrupt_correction, &jump_targets_[next_offset()],
-      false_interrupt_correction);
+      &jump_targets_[next_offset()]);
   MergeIntoFrameState(block, iterator_.GetJumpTargetOffset());
   StartFallthroughBlock(next_offset(), block);
 }
@@ -6373,7 +9050,7 @@ void MaglevGraphBuilder::VisitSwitchOnSmiNoFeedback() {
   if (offsets.size() == 0) return;
 
   int case_value_base = (*offsets.begin()).case_value;
-  BasicBlockRef* targets = zone()->NewArray<BasicBlockRef>(offsets.size());
+  BasicBlockRef* targets = zone()->AllocateArray<BasicBlockRef>(offsets.size());
   for (interpreter::JumpTableTargetOffset offset : offsets) {
     BasicBlockRef* ref = &targets[offset.case_value - case_value_base];
     new (ref) BasicBlockRef(&jump_targets_[offset.target_offset]);
@@ -6413,7 +9090,8 @@ void MaglevGraphBuilder::VisitForInPrepare() {
     case ForInHint::kNone:
     case ForInHint::kEnumCacheKeysAndIndices:
     case ForInHint::kEnumCacheKeys: {
-      BuildCheckMaps(enumerator, base::VectorOf({broker()->meta_map()}));
+      RETURN_VOID_IF_ABORT(
+          BuildCheckMaps(enumerator, base::VectorOf({broker()->meta_map()})));
 
       auto* descriptor_array = AddNewNode<LoadTaggedField>(
           {enumerator}, Map::kInstanceDescriptorsOffset);
@@ -6462,12 +9140,8 @@ void MaglevGraphBuilder::VisitForInContinue() {
   // ForInContinue <index> <cache_length>
   ValueNode* index = LoadRegisterInt32(0);
   ValueNode* cache_length = LoadRegisterInt32(1);
-  if (TryBuildBranchFor<BranchIfInt32Compare>({index, cache_length},
-                                              Operation::kLessThan)) {
-    return;
-  }
   SetAccumulator(
-      AddNewNode<Int32NodeFor<Operation::kLessThan>>({index, cache_length}));
+      AddNewNode<Int32Compare>({index, cache_length}, Operation::kLessThan));
 }
 
 void MaglevGraphBuilder::VisitForInNext() {
@@ -6530,7 +9204,11 @@ void MaglevGraphBuilder::VisitForInNext() {
 void MaglevGraphBuilder::VisitForInStep() {
   ValueNode* index = LoadRegisterInt32(0);
   SetAccumulator(AddNewNode<Int32NodeFor<Operation::kIncrement>>({index}));
-  current_for_in_state = ForInState();
+  if (!in_peeled_iteration_) {
+    // With loop peeling, only the `ForInStep` in the non-peeled loop body marks
+    // the end of for-in.
+    current_for_in_state = ForInState();
+  }
 }
 
 void MaglevGraphBuilder::VisitSetPendingMessage() {
@@ -6558,24 +9236,35 @@ void MaglevGraphBuilder::VisitReturn() {
   }
 
   if (!is_inline()) {
-    FinishBlock<Return>({GetAccumulatorTagged()});
+    // We do not record a Tagged use on Return, since they are never on the hot
+    // path, and will lead to a maximum of one additional Tagging operation in
+    // the worst case. This allows loop accumulator to be untagged even if they
+    // are later returned.
+    FinishBlock<Return>(
+        {GetAccumulatorTagged(UseReprHintRecording::kDoNotRecord)});
     return;
   }
 
   // All inlined function returns instead jump to one past the end of the
   // bytecode, where we'll later create a final basic block which resumes
-  // execution of the caller.
-  // TODO(leszeks): Consider shortcutting this Jump for cases where there is
-  // only one return and no need to merge return states.
-  BasicBlock* block =
-      FinishBlock<Jump>({}, &jump_targets_[inline_exit_offset()]);
-  MergeIntoInlinedReturnFrameState(block);
+  // execution of the caller. If there is only one return, at the end of the
+  // function, we can elide this jump and just continue in the same basic block.
+  if (iterator_.next_offset() != inline_exit_offset() ||
+      NumPredecessors(inline_exit_offset()) > 1) {
+    BasicBlock* block =
+        FinishBlock<Jump>({}, &jump_targets_[inline_exit_offset()]);
+    // The context is dead by now, set it to optimized out to avoid creating
+    // unnecessary phis.
+    SetContext(GetRootConstant(RootIndex::kOptimizedOut));
+    MergeIntoInlinedReturnFrameState(block);
+  }
 }
 
 void MaglevGraphBuilder::VisitThrowReferenceErrorIfHole() {
   // ThrowReferenceErrorIfHole <variable_name>
   compiler::NameRef name = GetRefOperand<Name>(0);
-  ValueNode* value = GetAccumulatorTagged();
+  ValueNode* value = GetRawAccumulator();
+
   // Avoid the check if we know it is not the hole.
   if (IsConstantNode(value->opcode())) {
     if (IsTheHoleValue(value)) {
@@ -6586,11 +9275,43 @@ void MaglevGraphBuilder::VisitThrowReferenceErrorIfHole() {
     }
     return;
   }
+
+  // Avoid the check if {value}'s representation doesn't allow the hole.
+  switch (value->value_representation()) {
+    case ValueRepresentation::kInt32:
+    case ValueRepresentation::kUint32:
+    case ValueRepresentation::kFloat64:
+    case ValueRepresentation::kHoleyFloat64:
+      // Can't be the hole.
+      // Note that HoleyFloat64 when converted to Tagged becomes Undefined
+      // rather than the_hole, hence the early return for HoleyFloat64.
+      return;
+
+    case ValueRepresentation::kTagged:
+      // Could be the hole.
+      break;
+
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
+  }
+
+  // Avoid the check if {value} has an alternative whose representation doesn't
+  // allow the hole.
+  if (const NodeInfo* info = known_node_aspects().TryGetInfoFor(value)) {
+    auto& alt = info->alternative();
+    if (alt.int32() || alt.truncated_int32_to_number() || alt.float64()) {
+      return;
+    }
+  }
+
+  DCHECK(value->value_representation() == ValueRepresentation::kTagged);
   AddNewNode<ThrowReferenceErrorIfHole>({value}, name);
 }
+
 void MaglevGraphBuilder::VisitThrowSuperNotCalledIfHole() {
   // ThrowSuperNotCalledIfHole
   ValueNode* value = GetAccumulatorTagged();
+  if (CheckType(value, NodeType::kJSReceiver)) return;
   // Avoid the check if we know it is not the hole.
   if (IsConstantNode(value->opcode())) {
     if (IsTheHoleValue(value)) {
@@ -6637,16 +9358,14 @@ void MaglevGraphBuilder::VisitSwitchOnGeneratorState() {
   // We create an initial block that checks if the generator is undefined.
   ValueNode* maybe_generator = LoadRegisterTagged(0);
   // Neither the true nor the false path jump over any bytecode
-  int true_interrupt_correction = 0, false_interrupt_correction = 0;
   BasicBlock* block_is_generator_undefined = FinishBlock<BranchIfRootConstant>(
-      {maybe_generator}, &jump_targets_[next_offset()],
-      true_interrupt_correction,
-      &jump_targets_[generator_prologue_block_offset],
-      false_interrupt_correction, RootIndex::kUndefinedValue);
+      {maybe_generator}, RootIndex::kUndefinedValue,
+      &jump_targets_[next_offset()],
+      &jump_targets_[generator_prologue_block_offset]);
   MergeIntoFrameState(block_is_generator_undefined, next_offset());
 
   // We create the generator prologue block.
-  StartNewBlock(generator_prologue_block_offset);
+  StartNewBlock(generator_prologue_block_offset, block_is_generator_undefined);
 
   // Generator prologue.
   ValueNode* generator = maybe_generator;
@@ -6665,7 +9384,7 @@ void MaglevGraphBuilder::VisitSwitchOnGeneratorState() {
 
   // Switch on generator state.
   int case_value_base = (*offsets.begin()).case_value;
-  BasicBlockRef* targets = zone()->NewArray<BasicBlockRef>(offsets.size());
+  BasicBlockRef* targets = zone()->AllocateArray<BasicBlockRef>(offsets.size());
   for (interpreter::JumpTableTargetOffset offset : offsets) {
     BasicBlockRef* ref = &targets[offset.case_value - case_value_base];
     new (ref) BasicBlockRef(&jump_targets_[offset.target_offset]);
@@ -6708,11 +9427,6 @@ void MaglevGraphBuilder::VisitSuspendGenerator() {
 
       context, generator, suspend_id, debug_pos_offset);
 
-  const uint32_t relative_jump_bytecode_offset = iterator_.current_offset();
-  if (ShouldEmitInterruptBudgetChecks() && relative_jump_bytecode_offset > 0) {
-    AddNewNode<ReduceInterruptBudgetForReturn>({},
-                                               relative_jump_bytecode_offset);
-  }
   FinishBlock<Return>({GetAccumulatorTagged()});
 }
 
diff --git a/deps/v8/src/maglev/maglev-graph-builder.h b/deps/v8/src/maglev/maglev-graph-builder.h
index a0a9caf71b9ea2..a65b564fe9eca5 100644
--- a/deps/v8/src/maglev/maglev-graph-builder.h
+++ b/deps/v8/src/maglev/maglev-graph-builder.h
@@ -14,6 +14,7 @@
 #include "src/base/optional.h"
 #include "src/codegen/source-position-table.h"
 #include "src/common/globals.h"
+#include "src/compiler-dispatcher/optimizing-compile-dispatcher.h"
 #include "src/compiler/bytecode-analysis.h"
 #include "src/compiler/bytecode-liveness-map.h"
 #include "src/compiler/feedback-source.h"
@@ -32,7 +33,9 @@
 #include "src/maglev/maglev-graph.h"
 #include "src/maglev/maglev-interpreter-frame-state.h"
 #include "src/maglev/maglev-ir.h"
+#include "src/objects/bytecode-array.h"
 #include "src/objects/elements-kind.h"
+#include "src/objects/string.h"
 #include "src/utils/memcopy.h"
 
 namespace v8 {
@@ -41,7 +44,7 @@ namespace maglev {
 
 class CallArguments;
 
-class ReduceResult {
+class V8_NODISCARD ReduceResult {
  public:
   enum Kind {
     kDoneWithValue = 0,  // No need to mask while returning the pointer.
@@ -96,21 +99,21 @@ class ReduceResult {
   base::PointerWithPayload<ValueNode, Kind, 3> payload_;
 };
 
-struct FastLiteralField;
+struct FastField;
 
 // Encoding of a fast allocation site object's element fixed array.
-struct FastLiteralFixedArray {
-  FastLiteralFixedArray() : type(kUninitialized) {}
-  explicit FastLiteralFixedArray(compiler::ObjectRef cow_value)
+struct FastFixedArray {
+  FastFixedArray() : type(kUninitialized) {}
+  explicit FastFixedArray(compiler::ObjectRef cow_value)
       : type(kCoW), cow_value(cow_value) {}
-  explicit FastLiteralFixedArray(int length, Zone* zone)
+  explicit FastFixedArray(int length, Zone* zone)
       : type(kTagged),
         length(length),
-        values(zone->NewArray<FastLiteralField>(length)) {}
-  explicit FastLiteralFixedArray(int length, Zone* zone, double)
+        values(zone->AllocateArray<FastField>(length)) {}
+  explicit FastFixedArray(int length, Zone* zone, double)
       : type(kDouble),
         length(length),
-        double_values(zone->NewArray<Float64>(length)) {}
+        double_values(zone->AllocateArray<Float64>(length)) {}
 
   enum { kUninitialized, kCoW, kTagged, kDouble } type;
 
@@ -122,7 +125,7 @@ struct FastLiteralFixedArray {
     struct {
       int length;
       union {
-        FastLiteralField* values;
+        FastField* values;
         Float64* double_values;
       };
     };
@@ -130,69 +133,124 @@ struct FastLiteralFixedArray {
 };
 
 // Encoding of a fast allocation site boilerplate object.
-struct FastLiteralObject {
-  FastLiteralObject(compiler::MapRef map, Zone* zone,
-                    FastLiteralFixedArray elements)
+struct FastObject {
+  FastObject(compiler::MapRef map, Zone* zone, FastFixedArray elements)
       : map(map),
-        fields(zone->NewArray<FastLiteralField>(map.GetInObjectProperties())),
-        elements(elements) {}
+        inobject_properties(map.GetInObjectProperties()),
+        instance_size(map.instance_size()),
+        fields(zone->AllocateArray<FastField>(inobject_properties)),
+        elements(elements) {
+    DCHECK(!map.is_dictionary_map());
+    DCHECK(!map.IsInobjectSlackTrackingInProgress());
+  }
+  FastObject(compiler::JSFunctionRef constructor, Zone* zone,
+             compiler::JSHeapBroker* broker);
+
+  void ClearFields();
 
   compiler::MapRef map;
-  FastLiteralField* fields;
-  FastLiteralFixedArray elements;
+  int inobject_properties;
+  int instance_size;
+  FastField* fields;
+  FastFixedArray elements;
   compiler::OptionalObjectRef js_array_length;
 };
 
 // Encoding of a fast allocation site literal value.
-struct FastLiteralField {
-  FastLiteralField() : type(kUninitialized) {}
-  explicit FastLiteralField(FastLiteralObject object)
-      : type(kObject), object(object) {}
-  explicit FastLiteralField(Float64 mutable_double_value)
+struct FastField {
+  FastField() : type(kUninitialized) {}
+  explicit FastField(FastObject object) : type(kObject), object(object) {}
+  explicit FastField(Float64 mutable_double_value)
       : type(kMutableDouble), mutable_double_value(mutable_double_value) {}
-  explicit FastLiteralField(compiler::ObjectRef constant_value)
+  explicit FastField(compiler::ObjectRef constant_value)
       : type(kConstant), constant_value(constant_value) {}
 
   enum { kUninitialized, kObject, kMutableDouble, kConstant } type;
 
   union {
     char uninitialized_marker;
-    FastLiteralObject object;
+    FastObject object;
     Float64 mutable_double_value;
     compiler::ObjectRef constant_value;
   };
 };
 
-#define RETURN_IF_DONE(result) \
-  do {                         \
-    auto res = result;         \
-    if (res.IsDone()) {        \
-      return res;              \
-    }                          \
+#define RETURN_IF_DONE(result)   \
+  do {                           \
+    ReduceResult res = (result); \
+    if (res.IsDone()) {          \
+      return res;                \
+    }                            \
+  } while (false)
+
+#define RETURN_VOID_IF_DONE(result) \
+  do {                              \
+    ReduceResult res = (result);    \
+    if (res.IsDone()) {             \
+      if (res.IsDoneWithAbort()) {  \
+        MarkBytecodeDead();         \
+        return;                     \
+      }                             \
+      return;                       \
+    }                               \
   } while (false)
 
 #define PROCESS_AND_RETURN_IF_DONE(result, value_processor) \
   do {                                                      \
-    auto res = result;                                      \
+    ReduceResult res = (result);                            \
     if (res.IsDone()) {                                     \
-      if (res.IsDoneWithValue()) {                          \
+      if (res.IsDoneWithAbort()) {                          \
+        MarkBytecodeDead();                                 \
+      } else if (res.IsDoneWithValue()) {                   \
         value_processor(res.value());                       \
       }                                                     \
       return;                                               \
     }                                                       \
   } while (false)
 
-#define RETURN_IF_ABORT(result)           \
-  if (result.IsDoneWithAbort()) {         \
-    return ReduceResult::DoneWithAbort(); \
-  }
+#define RETURN_IF_ABORT(result)             \
+  do {                                      \
+    if ((result).IsDoneWithAbort()) {       \
+      return ReduceResult::DoneWithAbort(); \
+    }                                       \
+  } while (false)
+
+#define RETURN_VOID_IF_ABORT(result)  \
+  do {                                \
+    if ((result).IsDoneWithAbort()) { \
+      MarkBytecodeDead();             \
+      return;                         \
+    }                                 \
+  } while (false)
+
+#define RETURN_VOID_ON_ABORT(result) \
+  do {                               \
+    ReduceResult res = (result);     \
+    USE(res);                        \
+    DCHECK(res.IsDoneWithAbort());   \
+    MarkBytecodeDead();              \
+    return;                          \
+  } while (false)
+
+enum class ToNumberHint {
+  kDisallowToNumber,
+  kAssumeSmi,
+  kAssumeNumber,
+  kAssumeNumberOrOddball
+};
+
+enum class UseReprHintRecording { kRecord, kDoNotRecord };
+
+NodeType StaticTypeForNode(compiler::JSHeapBroker* broker,
+                           LocalIsolate* isolate, ValueNode* node);
 
 class MaglevGraphBuilder {
  public:
   explicit MaglevGraphBuilder(
       LocalIsolate* local_isolate, MaglevCompilationUnit* compilation_unit,
       Graph* graph, float call_frequency = 1.0f,
-      BytecodeOffset bytecode_offset = BytecodeOffset::None(),
+      BytecodeOffset caller_bytecode_offset = BytecodeOffset::None(),
+      int inlining_id = SourcePosition::kNotInlined,
       MaglevGraphBuilder* parent = nullptr);
 
   void Build() {
@@ -207,12 +265,13 @@ class MaglevGraphBuilder {
       graph()->parameters().push_back(v);
       SetArgument(i, v);
     }
+
     BuildRegisterFrameInitialization();
 
     // Don't use the AddNewNode helper for the function entry stack check, so
     // that we can set a custom deopt frame on it.
     FunctionEntryStackCheck* function_entry_stack_check =
-        FunctionEntryStackCheck::New(zone(), {});
+        NodeBase::New<FunctionEntryStackCheck>(zone(), {});
     new (function_entry_stack_check->lazy_deopt_info()) LazyDeoptInfo(
         zone(), GetDeoptFrameForEntryStackCheck(),
         interpreter::Register::invalid_value(), 0, compiler::FeedbackSource());
@@ -223,26 +282,66 @@ class MaglevGraphBuilder {
     BuildBody();
   }
 
-  ReduceResult BuildInlined(const CallArguments& args, BasicBlockRef* start_ref,
-                            BasicBlockRef* end_ref);
+  ReduceResult BuildInlined(ValueNode* context, ValueNode* function,
+                            ValueNode* new_target, const CallArguments& args);
 
   void StartPrologue();
   void SetArgument(int i, ValueNode* value);
-  void InitializeRegister(interpreter::Register reg,
-                          ValueNode* value = nullptr);
+  void InitializeRegister(interpreter::Register reg, ValueNode* value);
   ValueNode* GetTaggedArgument(int i);
   void BuildRegisterFrameInitialization(ValueNode* context = nullptr,
-                                        ValueNode* closure = nullptr);
+                                        ValueNode* closure = nullptr,
+                                        ValueNode* new_target = nullptr);
   void BuildMergeStates();
   BasicBlock* EndPrologue();
+  void PeelLoop();
 
   void BuildBody() {
-    for (iterator_.Reset(); !iterator_.done(); iterator_.Advance()) {
+    while (!source_position_iterator_.done() &&
+           source_position_iterator_.code_offset() < entrypoint_) {
+      source_position_iterator_.Advance();
+      UpdateSourceAndBytecodePosition(source_position_iterator_.code_offset());
+    }
+
+    // TODO(olivf) We might want to start collecting known_node_aspects_ for
+    // the whole bytecode array instead of starting at entrypoint_.
+    for (iterator_.SetOffset(entrypoint_); !iterator_.done();
+         iterator_.Advance()) {
       local_isolate_->heap()->Safepoint();
+      if (V8_UNLIKELY(
+              loop_headers_to_peel_.Contains(iterator_.current_offset()))) {
+        PeelLoop();
+      }
       VisitSingleBytecode();
     }
   }
 
+  SmiConstant* GetSmiConstant(int constant) {
+    DCHECK(Smi::IsValid(constant));
+    auto it = graph_->smi().find(constant);
+    if (it == graph_->smi().end()) {
+      SmiConstant* node =
+          CreateNewConstantNode<SmiConstant>(0, Smi::FromInt(constant));
+      if (has_graph_labeller()) graph_labeller()->RegisterNode(node);
+      graph_->smi().emplace(constant, node);
+      return node;
+    }
+    return it->second;
+  }
+
+  TaggedIndexConstant* GetTaggedIndexConstant(int constant) {
+    DCHECK(TaggedIndex::IsValid(constant));
+    auto it = graph_->tagged_index().find(constant);
+    if (it == graph_->tagged_index().end()) {
+      TaggedIndexConstant* node = CreateNewConstantNode<TaggedIndexConstant>(
+          0, TaggedIndex::FromIntptr(constant));
+      if (has_graph_labeller()) graph_labeller()->RegisterNode(node);
+      graph_->tagged_index().emplace(constant, node);
+      return node;
+    }
+    return it->second;
+  }
+
   Int32Constant* GetInt32Constant(int constant) {
     // The constant must fit in a Smi, since it could be later tagged in a Phi.
     DCHECK(Smi::IsValid(constant));
@@ -273,9 +372,18 @@ class MaglevGraphBuilder {
     return it->second;
   }
 
+  static compiler::OptionalHeapObjectRef TryGetConstant(
+      compiler::JSHeapBroker* broker, LocalIsolate* isolate, ValueNode* node);
+
   Graph* graph() const { return graph_; }
   Zone* zone() const { return compilation_unit_->zone(); }
   MaglevCompilationUnit* compilation_unit() const { return compilation_unit_; }
+  const InterpreterFrameState& current_interpreter_frame() const {
+    return current_interpreter_frame_;
+  }
+  const MaglevGraphBuilder* parent() const { return parent_; }
+  compiler::JSHeapBroker* broker() const { return broker_; }
+  LocalIsolate* local_isolate() const { return local_isolate_; }
 
   bool has_graph_labeller() const {
     return compilation_unit_->has_graph_labeller();
@@ -284,32 +392,71 @@ class MaglevGraphBuilder {
     return compilation_unit_->graph_labeller();
   }
 
+  DeoptFrame GetLatestCheckpointedFrame();
+
+  void RecordUseReprHint(Phi* phi, UseRepresentationSet reprs) {
+    phi->RecordUseReprHint(reprs, iterator_.current_offset());
+  }
+  void RecordUseReprHint(Phi* phi, UseRepresentation repr) {
+    RecordUseReprHint(phi, UseRepresentationSet{repr});
+  }
+  void RecordUseReprHintIfPhi(ValueNode* node, UseRepresentation repr) {
+    if (Phi* phi = node->TryCast<Phi>()) {
+      RecordUseReprHint(phi, repr);
+    }
+  }
+
  private:
+  class MaglevSubGraphBuilder;
+
+  // TODO(olivf): Currently identifying dead code relies on the fact that loops
+  // must be entered through the loop header by at least one of the
+  // predecessors. We might want to re-evaluate this in case we want to be able
+  // to OSR into nested loops while compiling the full continuation.
+  static constexpr bool kLoopsMustBeEnteredThroughHeader = true;
+
   class CallSpeculationScope;
-  class LazyDeoptContinuationScope;
+  class DeoptFrameScope;
 
-  bool CheckType(ValueNode* node, NodeType type);
+  bool CheckStaticType(ValueNode* node, NodeType type, NodeType* old = nullptr);
+  bool CheckType(ValueNode* node, NodeType type, NodeType* old = nullptr);
   bool EnsureType(ValueNode* node, NodeType type, NodeType* old = nullptr);
+  template <typename Function>
+  bool EnsureType(ValueNode* node, NodeType type, Function ensure_new_type);
+  void SetKnownValue(ValueNode* node, compiler::ObjectRef constant);
   bool ShouldEmitInterruptBudgetChecks() {
+    if (is_inline()) return false;
     return v8_flags.force_emit_interrupt_budget_checks || v8_flags.turbofan;
   }
-  BasicBlock* CreateEdgeSplitBlock(int offset,
-                                   int interrupt_budget_correction) {
+  bool ShouldEmitOsrInterruptBudgetChecks() {
+    if (!v8_flags.turbofan || !v8_flags.use_osr || !v8_flags.osr_from_maglev)
+      return false;
+    if (!graph_->is_osr() && !v8_flags.always_osr_from_maglev) return false;
+    // TODO(olivf) OSR from maglev requires lazy recompilation (see
+    // CompileOptimizedOSRFromMaglev for details). Without this we end up in
+    // deopt loops, e.g., in chromium content_unittests.
+    if (!OptimizingCompileDispatcher::Enabled()) {
+      return false;
+    }
+    // TODO(olivf) OSR'ing from inlined loops is something we might want, but
+    // can't with our current osr-from-maglev implementation. The reason is that
+    // we OSR up by first going down to the interpreter. For inlined loops this
+    // means we would deoptimize to the caller and then probably end up in the
+    // same maglev osr code again, before reaching the turbofan OSR code in the
+    // callee. The solution is to support osr from maglev without
+    // deoptimization.
+    return !(graph_->is_osr() && is_inline());
+  }
+  bool MaglevIsTopTier() const { return !v8_flags.turbofan && v8_flags.maglev; }
+  BasicBlock* CreateEdgeSplitBlock(BasicBlockRef& jump_targets,
+                                   BasicBlock* predecessor) {
     if (v8_flags.trace_maglev_graph_building) {
       std::cout << "== New empty block ==" << std::endl;
     }
     DCHECK_NULL(current_block_);
-    current_block_ = zone()->New<BasicBlock>(nullptr);
-    // Add an interrupt budget correction if necessary. This makes the edge
-    // split block no longer empty, which is unexpected, but we're not changing
-    // interpreter frame state, so that's ok.
-    if (v8_flags.maglev_increase_budget_forward_jump &&
-        ShouldEmitInterruptBudgetChecks() && interrupt_budget_correction != 0) {
-      DCHECK_GT(interrupt_budget_correction, 0);
-      AddNewNode<IncreaseInterruptBudget>({}, interrupt_budget_correction);
-    }
-    BasicBlock* result = FinishBlock<Jump>({}, &jump_targets_[offset]);
-    result->set_edge_split_block();
+    current_block_ = zone()->New<BasicBlock>(nullptr, zone());
+    BasicBlock* result = FinishBlock<Jump>({}, &jump_targets);
+    result->set_edge_split_block(predecessor);
 #ifdef DEBUG
     new_nodes_.clear();
 #endif
@@ -325,12 +472,14 @@ class MaglevGraphBuilder {
 
     // Merges aren't simple fallthroughs, so we should reset the checkpoint
     // validity.
-    latest_checkpointed_frame_.reset();
+    ResetBuilderCachedState();
 
     // Register exception phis.
     if (has_graph_labeller()) {
       for (Phi* phi : *merge_states_[offset]->phis()) {
-        graph_labeller()->RegisterNode(phi);
+        graph_labeller()->RegisterNode(phi, compilation_unit_,
+                                       BytecodeOffset(offset),
+                                       current_source_position_);
         if (v8_flags.trace_maglev_graph_building) {
           std::cout << "  " << phi << "  "
                     << PrintNodeLabel(graph_labeller(), phi) << ": "
@@ -345,10 +494,16 @@ class MaglevGraphBuilder {
     MergePointInterpreterFrameState& merge_state = *merge_states_[offset];
     current_interpreter_frame_.CopyFrom(*compilation_unit_, merge_state);
 
-    // Merges aren't simple fallthroughs, so we should reset the checkpoint
-    // and for-in state validity.
-    latest_checkpointed_frame_.reset();
-    current_for_in_state.receiver_needs_map_check = true;
+    ProcessMergePointPredecessors(merge_state, jump_targets_[offset]);
+  }
+
+  // Splits incoming critical edges and labels predecessors.
+  void ProcessMergePointPredecessors(
+      MergePointInterpreterFrameState& merge_state,
+      BasicBlockRef& jump_targets) {
+    // Merges aren't simple fallthroughs, so we should reset state which is
+    // cached directly on the builder instead of on the merge states.
+    ResetBuilderCachedState();
 
     if (merge_state.predecessor_count() == 1) return;
 
@@ -361,34 +516,40 @@ class MaglevGraphBuilder {
       DCHECK(merge_state.is_unmerged_loop());
       predecessor_index--;
     }
-    BasicBlockRef* old_jump_targets = jump_targets_[offset].Reset();
+    BasicBlockRef* old_jump_targets = jump_targets.Reset();
     while (old_jump_targets != nullptr) {
       BasicBlock* predecessor = merge_state.predecessor_at(predecessor_index);
+      CHECK(predecessor);
       ControlNode* control = predecessor->control_node();
       if (control->Is<ConditionalControlNode>()) {
         // CreateEmptyBlock automatically registers itself with the offset.
-        predecessor = CreateEdgeSplitBlock(
-            offset, old_jump_targets->interrupt_budget_correction());
+        predecessor = CreateEdgeSplitBlock(jump_targets, predecessor);
         // Set the old predecessor's (the conditional block) reference to
         // point to the new empty predecessor block.
         old_jump_targets =
             old_jump_targets->SetToBlockAndReturnNext(predecessor);
       } else {
         // Re-register the block in the offset's ref list.
-        old_jump_targets =
-            old_jump_targets->MoveToRefList(&jump_targets_[offset]);
+        old_jump_targets = old_jump_targets->MoveToRefList(&jump_targets);
       }
+      // We only set the predecessor id after splitting critical edges, to make
+      // sure the edge split blocks pick up the correct predecessor index.
       predecessor->set_predecessor_id(predecessor_index--);
     }
     DCHECK_EQ(predecessor_index, -1);
-    if (has_graph_labeller()) {
-      for (Phi* phi : *merge_states_[offset]->phis()) {
-        graph_labeller()->RegisterNode(phi);
-        if (v8_flags.trace_maglev_graph_building) {
-          std::cout << "  " << phi << "  "
-                    << PrintNodeLabel(graph_labeller(), phi) << ": "
-                    << PrintNode(graph_labeller(), phi) << std::endl;
-        }
+    RegisterPhisWithGraphLabeller(merge_state);
+  }
+
+  void RegisterPhisWithGraphLabeller(
+      MergePointInterpreterFrameState& merge_state) {
+    if (!has_graph_labeller()) return;
+
+    for (Phi* phi : *merge_state.phis()) {
+      graph_labeller()->RegisterNode(phi);
+      if (v8_flags.trace_maglev_graph_building) {
+        std::cout << "  " << phi << "  "
+                  << PrintNodeLabel(graph_labeller(), phi) << ": "
+                  << PrintNode(graph_labeller(), phi) << std::endl;
       }
     }
   }
@@ -400,11 +561,11 @@ class MaglevGraphBuilder {
   }
 
   // Called when a block is killed by an unconditional eager deopt.
-  void EmitUnconditionalDeopt(DeoptimizeReason reason) {
+  ReduceResult EmitUnconditionalDeopt(DeoptimizeReason reason) {
     // Create a block rather than calling finish, since we don't yet know the
     // next block's offset before the loop skipping the rest of the bytecodes.
     FinishBlock<Deopt>({}, reason);
-    MarkBytecodeDead();
+    return ReduceResult::DoneWithAbort();
   }
 
   void MarkBytecodeDead() {
@@ -430,7 +591,9 @@ class MaglevGraphBuilder {
     } else if (bytecode == interpreter::Bytecode::kJumpLoop) {
       // JumpLoop merges into its loop header, which has to be treated
       // specially by the merge.
-      MergeDeadLoopIntoFrameState(iterator_.GetJumpTargetOffset());
+      if (!in_peeled_iteration_) {
+        MergeDeadLoopIntoFrameState(iterator_.GetJumpTargetOffset());
+      }
     } else if (interpreter::Bytecodes::IsSwitch(bytecode)) {
       // Switches merge into their targets, and into the fallthrough.
       for (auto offset : iterator_.GetJumpTableTargetOffsets()) {
@@ -452,11 +615,9 @@ class MaglevGraphBuilder {
   void UpdateSourceAndBytecodePosition(int offset) {
     if (source_position_iterator_.done()) return;
     if (source_position_iterator_.code_offset() == offset) {
-      // TODO(leszeks): Add inlining support.
-      const int kInliningId = SourcePosition::kNotInlined;
       current_source_position_ = SourcePosition(
           source_position_iterator_.source_position().ScriptOffset(),
-          kInliningId);
+          inlining_id_);
       source_position_iterator_.Advance();
     } else {
       DCHECK_GT(source_position_iterator_.code_offset(), offset);
@@ -464,6 +625,13 @@ class MaglevGraphBuilder {
   }
 
   void VisitSingleBytecode() {
+    if (v8_flags.trace_maglev_graph_building) {
+      std::cout << std::setw(4) << iterator_.current_offset() << " : ";
+      interpreter::BytecodeDecoder::Decode(std::cout,
+                                           iterator_.current_address());
+      std::cout << std::endl;
+    }
+
     int offset = iterator_.current_offset();
     UpdateSourceAndBytecodePosition(offset);
 
@@ -474,14 +642,14 @@ class MaglevGraphBuilder {
         // bytecodes in this basic block were only register juggling.
         // DCHECK(!current_block_->nodes().is_empty());
         BasicBlock* predecessor = FinishBlock<Jump>({}, &jump_targets_[offset]);
-        merge_state->Merge(*compilation_unit_, graph_->smi(),
-                           current_interpreter_frame_, predecessor);
+        merge_state->Merge(this, current_interpreter_frame_, predecessor);
       }
       if (v8_flags.trace_maglev_graph_building) {
         auto detail = merge_state->is_exception_handler() ? "exception handler"
                       : merge_state->is_loop()            ? "loop header"
                                                           : "merge";
-        std::cout << "== New block (" << detail << ") at " << function()
+        std::cout << "== New block (" << detail << ") at "
+                  << compilation_unit()->shared_function_info().object()
                   << "==" << std::endl;
       }
 
@@ -494,11 +662,22 @@ class MaglevGraphBuilder {
           return;
         }
         ProcessMergePointAtExceptionHandlerStart(offset);
+      } else if (merge_state->is_loop() && !merge_state->is_resumable_loop() &&
+                 merge_state->is_unreachable_loop()) {
+        // We encoutered a loop header that is only reachable by the JumpLoop
+        // back-edge, but the bytecode_analysis didn't notice upfront. This can
+        // e.g. be a loop that is entered on a dead fall-through.
+        static_assert(kLoopsMustBeEnteredThroughHeader);
+        MarkBytecodeDead();
+        return;
       } else {
         ProcessMergePoint(offset);
       }
 
-      StartNewBlock(offset);
+      // We pass nullptr for the `predecessor` argument of StartNewBlock because
+      // this block is guaranteed to have a merge_state_, and hence to not have
+      // a `predecessor_` field.
+      StartNewBlock(offset, /*predecessor*/ nullptr);
     } else if (V8_UNLIKELY(current_block_ == nullptr)) {
       // If we don't have a current block, the bytecode must be dead (because of
       // some earlier deopt). Mark this bytecode dead too and return.
@@ -544,16 +723,18 @@ class MaglevGraphBuilder {
     }
 
     DCHECK_NOT_NULL(current_block_);
-    if (v8_flags.trace_maglev_graph_building) {
-      std::cout << std::setw(4) << iterator_.current_offset() << " : ";
-      interpreter::BytecodeDecoder::Decode(std::cout,
-                                           iterator_.current_address());
-      std::cout << std::endl;
-    }
 #ifdef DEBUG
     // Clear new nodes for the next VisitFoo
     new_nodes_.clear();
 #endif
+
+    if (iterator_.current_bytecode() == interpreter::Bytecode::kJumpLoop &&
+        iterator_.GetJumpTargetOffset() < entrypoint_) {
+      static_assert(kLoopsMustBeEnteredThroughHeader);
+      RETURN_VOID_ON_ABORT(
+          EmitUnconditionalDeopt(DeoptimizeReason::kOSREarlyExit));
+    }
+
     switch (iterator_.current_bytecode()) {
 #define BYTECODE_CASE(name, ...)       \
   case interpreter::Bytecode::k##name: \
@@ -575,7 +756,10 @@ class MaglevGraphBuilder {
 
   void AddInitializedNodeToGraph(Node* node) {
     current_block_->nodes().Add(node);
-    if (has_graph_labeller()) graph_labeller()->RegisterNode(node);
+    if (has_graph_labeller())
+      graph_labeller()->RegisterNode(node, compilation_unit_,
+                                     BytecodeOffset(iterator_.current_offset()),
+                                     current_source_position_);
     if (v8_flags.trace_maglev_graph_building) {
       std::cout << "  " << node << "  "
                 << PrintNodeLabel(graph_labeller(), node) << ": "
@@ -613,7 +797,7 @@ class MaglevGraphBuilder {
     static_assert(!NodeT::kProperties.can_eager_deopt());
     static_assert(!NodeT::kProperties.can_lazy_deopt());
     static_assert(!NodeT::kProperties.can_throw());
-    static_assert(!NodeT::kProperties.has_any_side_effects());
+    static_assert(!NodeT::kProperties.can_write());
     return node;
   }
 
@@ -630,8 +814,8 @@ class MaglevGraphBuilder {
   template <typename NodeT>
   void AttachEagerDeoptInfo(NodeT* node) {
     if constexpr (NodeT::kProperties.can_eager_deopt()) {
-      new (node->eager_deopt_info()) EagerDeoptInfo(
-          zone(), GetLatestCheckpointedFrame(), current_speculation_feedback_);
+      node->SetEagerDeoptInfo(zone(), GetLatestCheckpointedFrame(),
+                              current_speculation_feedback_);
     }
   }
 
@@ -648,10 +832,15 @@ class MaglevGraphBuilder {
   template <typename NodeT>
   void AttachExceptionHandlerInfo(NodeT* node) {
     if constexpr (NodeT::kProperties.can_throw()) {
-      BasicBlockRef* catch_block_ref = GetCurrentTryCatchBlockOffset();
-      if (catch_block_ref) {
+      CatchBlockDetails catch_block = GetCurrentTryCatchBlock();
+      if (catch_block.ref) {
         new (node->exception_handler_info())
-            ExceptionHandlerInfo(catch_block_ref);
+            ExceptionHandlerInfo(catch_block.ref);
+
+        // Merge the current state into the handler state.
+        DCHECK_NOT_NULL(catch_block.state);
+        catch_block.state->MergeThrow(this, catch_block.unit,
+                                      current_interpreter_frame_);
       } else {
         // Patch no exception handler marker.
         // TODO(victorgomes): Avoid allocating exception handler data in this
@@ -661,17 +850,20 @@ class MaglevGraphBuilder {
     }
   }
 
-  BasicBlockRef* GetCurrentTryCatchBlockOffset() {
+  struct CatchBlockDetails {
+    BasicBlockRef* ref = nullptr;
+    MergePointInterpreterFrameState* state = nullptr;
+    const MaglevCompilationUnit* unit = nullptr;
+  };
+
+  CatchBlockDetails GetCurrentTryCatchBlock() {
     if (catch_block_stack_.size() > 0) {
       // Inside a try-block.
-      return &jump_targets_[catch_block_stack_.top().handler];
-    }
-    // Function is inlined and the call is inside a catch block.
-    if (parent_catch_block_) {
-      DCHECK(is_inline());
-      return parent_catch_block_;
+      int offset = catch_block_stack_.top().handler;
+      return {&jump_targets_[offset], merge_states_[offset], compilation_unit_};
     }
-    return nullptr;
+    DCHECK_IMPLIES(parent_catch_.ref != nullptr, is_inline());
+    return parent_catch_;
   }
 
   enum ContextSlotMutability { kImmutable, kMutable };
@@ -687,6 +879,8 @@ class MaglevGraphBuilder {
   void BuildStoreContextSlot(ValueNode* context, size_t depth, int slot_index,
                              ValueNode* value);
 
+  void BuildStoreReceiverMap(ValueNode* receiver, compiler::MapRef map);
+
   template <Builtin kBuiltin>
   CallBuiltin* BuildCallBuiltin(std::initializer_list<ValueNode*> inputs) {
     using Descriptor = typename CallInterfaceDescriptorFor<kBuiltin>::type;
@@ -729,6 +923,8 @@ class MaglevGraphBuilder {
                        compiler::FeedbackSource& feedback_source,
                        TypeofMode typeof_mode);
 
+  ValueNode* BuildToString(ValueNode* value, ToString::ConversionMode mode);
+
   CallRuntime* BuildCallRuntime(Runtime::FunctionId function_id,
                                 std::initializer_list<ValueNode*> inputs) {
     return AddNewNode<CallRuntime>(
@@ -805,19 +1001,6 @@ class MaglevGraphBuilder {
                           operand_index, local_isolate()))));
   }
 
-  SmiConstant* GetSmiConstant(int constant) {
-    DCHECK(Smi::IsValid(constant));
-    auto it = graph_->smi().find(constant);
-    if (it == graph_->smi().end()) {
-      SmiConstant* node =
-          CreateNewConstantNode<SmiConstant>(0, Smi::FromInt(constant));
-      if (has_graph_labeller()) graph_labeller()->RegisterNode(node);
-      graph_->smi().emplace(constant, node);
-      return node;
-    }
-    return it->second;
-  }
-
   ExternalConstant* GetExternalConstant(ExternalReference reference) {
     auto it = graph_->external_references().find(reference.address());
     if (it == graph_->external_references().end()) {
@@ -846,24 +1029,7 @@ class MaglevGraphBuilder {
                                  : RootIndex::kFalseValue);
   }
 
-  ValueNode* GetConstant(const compiler::ObjectRef& ref) {
-    if (ref.IsSmi()) return GetSmiConstant(ref.AsSmi());
-    const compiler::HeapObjectRef& constant = ref.AsHeapObject();
-
-    auto root_index = broker()->FindRootIndex(constant);
-    if (root_index.has_value()) {
-      return GetRootConstant(*root_index);
-    }
-
-    auto it = graph_->constants().find(constant);
-    if (it == graph_->constants().end()) {
-      Constant* node = CreateNewConstantNode<Constant>(0, constant);
-      if (has_graph_labeller()) graph_labeller()->RegisterNode(node);
-      graph_->constants().emplace(constant, node);
-      return node;
-    }
-    return it->second;
-  }
+  ValueNode* GetConstant(compiler::ObjectRef ref);
 
   ValueNode* GetRegisterInput(Register reg) {
     DCHECK(!graph_->register_inputs().has(reg));
@@ -892,55 +1058,97 @@ class MaglevGraphBuilder {
     current_interpreter_frame_.set(dst, current_interpreter_frame_.get(src));
   }
 
-  ValueNode* GetTaggedValue(ValueNode* value);
+  ValueNode* GetTaggedValue(ValueNode* value,
+                            UseReprHintRecording record_use_repr_hint =
+                                UseReprHintRecording::kRecord);
+  ValueNode* GetSmiValue(ValueNode* value,
+                         UseReprHintRecording record_use_repr_hint =
+                             UseReprHintRecording::kRecord);
 
-  ValueNode* GetTaggedValue(interpreter::Register reg) {
+  ValueNode* GetSmiValue(interpreter::Register reg,
+                         UseReprHintRecording record_use_repr_hint =
+                             UseReprHintRecording::kRecord) {
     ValueNode* value = current_interpreter_frame_.get(reg);
-    return GetTaggedValue(value);
+    return GetSmiValue(value, record_use_repr_hint);
   }
 
-  void SetKnownType(ValueNode* node, NodeType type) {
-    NodeInfo* known_info = known_node_aspects().GetOrCreateInfoFor(node);
-    known_info->type = type;
+  ValueNode* GetTaggedValue(interpreter::Register reg,
+                            UseReprHintRecording record_use_repr_hint =
+                                UseReprHintRecording::kRecord) {
+    ValueNode* value = current_interpreter_frame_.get(reg);
+    return GetTaggedValue(value, record_use_repr_hint);
   }
 
   ValueNode* GetInternalizedString(interpreter::Register reg);
 
-  ValueNode* GetTruncatedInt32FromNumber(
-      ValueNode* value, TaggedToFloat64ConversionType conversion_type);
+  // Get an Int32 representation node whose value is equivalent to the ToInt32
+  // truncation of the given node (including a ToNumber call). Only trivial
+  // ToNumber is allowed -- values that are already numeric, and optionally
+  // oddballs.
+  //
+  // Deopts if the ToNumber is non-trivial.
+  ValueNode* GetTruncatedInt32ForToNumber(ValueNode* value, ToNumberHint hint);
+
+  ValueNode* GetTruncatedInt32ForToNumber(interpreter::Register reg,
+                                          ToNumberHint hint) {
+    return GetTruncatedInt32ForToNumber(current_interpreter_frame_.get(reg),
+                                        hint);
+  }
+
+  // Get an Int32 representation node whose value is equivalent to the ToUint8
+  // truncation of the given node (including a ToNumber call). Only trivial
+  // ToNumber is allowed -- values that are already numeric, and optionally
+  // oddballs.
+  //
+  // Deopts if the ToNumber is non-trivial.
+  ValueNode* GetUint8ClampedForToNumber(ValueNode* value, ToNumberHint hint);
+
+  ValueNode* GetUint8ClampedForToNumber(interpreter::Register reg,
+                                        ToNumberHint hint) {
+    return GetUint8ClampedForToNumber(current_interpreter_frame_.get(reg),
+                                      hint);
+  }
+
+  // Get an Int32 representation node whose value is equivalent to the given
+  // node.
+  //
+  // Deopts if the value is not exactly representable as an Int32.
+  ValueNode* GetInt32(ValueNode* value);
 
-  ValueNode* GetTruncatedInt32FromNumber(
-      interpreter::Register reg,
-      TaggedToFloat64ConversionType conversion_type) {
-    return GetTruncatedInt32FromNumber(current_interpreter_frame_.get(reg),
-                                       conversion_type);
+  ValueNode* GetInt32(interpreter::Register reg) {
+    ValueNode* value = current_interpreter_frame_.get(reg);
+    return GetInt32(value);
   }
 
-  ValueNode* GetUint32ClampedFromNumber(ValueNode* value);
+  // Get a Float64 representation node whose value is equivalent to the given
+  // node.
+  //
+  // Deopts if the value is not exactly representable as a Float64.
+  ValueNode* GetFloat64(ValueNode* value);
 
-  ValueNode* GetUint32ClampedFromNumber(interpreter::Register reg) {
-    return GetUint32ClampedFromNumber(current_interpreter_frame_.get(reg));
+  ValueNode* GetFloat64(interpreter::Register reg) {
+    return GetFloat64(current_interpreter_frame_.get(reg));
   }
 
-  ValueNode* GetTruncatedInt32(ValueNode* node);
+  // Get a Float64 representation node whose value is the result of ToNumber on
+  // the given node. Only trivial ToNumber is allowed -- values that are already
+  // numeric, and optionally oddballs.
+  //
+  // Deopts if the ToNumber value is not exactly representable as a Float64, or
+  // the ToNumber is non-trivial.
+  ValueNode* GetFloat64ForToNumber(ValueNode* value, ToNumberHint hint);
 
-  ValueNode* GetTruncatedInt32(interpreter::Register reg) {
-    return GetTruncatedInt32(current_interpreter_frame_.get(reg));
+  ValueNode* GetFloat64ForToNumber(interpreter::Register reg,
+                                   ToNumberHint hint) {
+    return GetFloat64ForToNumber(current_interpreter_frame_.get(reg), hint);
   }
 
-  ValueNode* GetInt32(ValueNode* value);
+  ValueNode* GetHoleyFloat64ForToNumber(ValueNode* value, ToNumberHint hint);
 
-  ValueNode* GetInt32(interpreter::Register reg) {
-    ValueNode* value = current_interpreter_frame_.get(reg);
-    return GetInt32(value);
-  }
-
-  ValueNode* GetFloat64(ValueNode* value,
-                        TaggedToFloat64ConversionType conversion_type);
-
-  ValueNode* GetFloat64(interpreter::Register reg,
-                        TaggedToFloat64ConversionType conversion_type) {
-    return GetFloat64(current_interpreter_frame_.get(reg), conversion_type);
+  ValueNode* GetHoleyFloat64ForToNumber(interpreter::Register reg,
+                                        ToNumberHint hint) {
+    return GetHoleyFloat64ForToNumber(current_interpreter_frame_.get(reg),
+                                      hint);
   }
 
   ValueNode* GetRawAccumulator() {
@@ -948,42 +1156,61 @@ class MaglevGraphBuilder {
         interpreter::Register::virtual_accumulator());
   }
 
-  ValueNode* GetAccumulatorTagged() {
-    return GetTaggedValue(interpreter::Register::virtual_accumulator());
+  ValueNode* GetAccumulatorTagged(UseReprHintRecording record_use_repr_hint =
+                                      UseReprHintRecording::kRecord) {
+    return GetTaggedValue(interpreter::Register::virtual_accumulator(),
+                          record_use_repr_hint);
+  }
+
+  ValueNode* GetAccumulatorSmi(UseReprHintRecording record_use_repr_hint =
+                                   UseReprHintRecording::kRecord) {
+    return GetSmiValue(interpreter::Register::virtual_accumulator(),
+                       record_use_repr_hint);
   }
 
   ValueNode* GetAccumulatorInt32() {
     return GetInt32(interpreter::Register::virtual_accumulator());
   }
 
-  ValueNode* GetAccumulatorTruncatedInt32() {
-    return GetTruncatedInt32(interpreter::Register::virtual_accumulator());
+  ValueNode* GetAccumulatorTruncatedInt32ForToNumber(ToNumberHint hint) {
+    return GetTruncatedInt32ForToNumber(
+        interpreter::Register::virtual_accumulator(), hint);
   }
 
-  ValueNode* GetAccumulatorTruncatedInt32FromNumber(
-      TaggedToFloat64ConversionType conversion_type) {
-    return GetTruncatedInt32FromNumber(
-        interpreter::Register::virtual_accumulator(), conversion_type);
+  ValueNode* GetAccumulatorUint8ClampedForToNumber(ToNumberHint hint) {
+    return GetUint8ClampedForToNumber(
+        interpreter::Register::virtual_accumulator(), hint);
   }
 
-  ValueNode* GetAccumulatorUint32ClampedFromNumber() {
-    return GetUint32ClampedFromNumber(
-        interpreter::Register::virtual_accumulator());
+  ValueNode* GetAccumulatorFloat64() {
+    return GetFloat64(interpreter::Register::virtual_accumulator());
+  }
+
+  ValueNode* GetAccumulatorFloat64ForToNumber(ToNumberHint hint) {
+    return GetFloat64ForToNumber(interpreter::Register::virtual_accumulator(),
+                                 hint);
   }
 
-  ValueNode* GetAccumulatorFloat64(
-      TaggedToFloat64ConversionType conversion_type) {
-    return GetFloat64(interpreter::Register::virtual_accumulator(),
-                      conversion_type);
+  ValueNode* GetAccumulatorHoleyFloat64ForToNumber(ToNumberHint hint) {
+    return GetHoleyFloat64ForToNumber(
+        interpreter::Register::virtual_accumulator(), hint);
   }
 
   ValueNode* GetSilencedNaN(ValueNode* value) {
     DCHECK_EQ(value->properties().value_representation(),
               ValueRepresentation::kFloat64);
 
-    // We only need to check for silenced NaN in non-conversion nodes, since
-    // conversions can't be signalling NaNs.
-    if (value->properties().is_conversion()) return value;
+    // We only need to check for silenced NaN in non-conversion nodes or
+    // conversion from tagged, since they can't be signalling NaNs.
+    if (value->properties().is_conversion()) {
+      // A conversion node should have at least one input.
+      DCHECK_GE(value->input_count(), 1);
+      // If the conversion node is tagged, we could be reading a fabricated sNaN
+      // value (built using a BufferArray for example).
+      if (!value->input(0).node()->properties().is_tagged()) {
+        return value;
+      }
+    }
 
     // Special case constants, since we know what they are.
     Float64Constant* constant = value->TryCast<Float64Constant>();
@@ -994,7 +1221,7 @@ class MaglevGraphBuilder {
     }
 
     // Silence all other values.
-    return AddNewNode<Float64SilenceNaN>({value});
+    return AddNewNode<HoleyFloat64ToMaybeNanFloat64>({value});
   }
 
   bool IsRegisterEqualToAccumulator(int operand_index) {
@@ -1016,14 +1243,20 @@ class MaglevGraphBuilder {
     return GetInt32(iterator_.GetRegisterOperand(operand_index));
   }
 
-  ValueNode* LoadRegisterTruncatedInt32(int operand_index) {
-    return GetTruncatedInt32(iterator_.GetRegisterOperand(operand_index));
+  ValueNode* LoadRegisterFloat64(int operand_index) {
+    return GetFloat64(iterator_.GetRegisterOperand(operand_index));
+  }
+
+  ValueNode* LoadRegisterFloat64ForToNumber(int operand_index,
+                                            ToNumberHint hint) {
+    return GetFloat64ForToNumber(iterator_.GetRegisterOperand(operand_index),
+                                 hint);
   }
 
-  ValueNode* LoadRegisterFloat64(
-      int operand_index, TaggedToFloat64ConversionType conversion_type) {
-    return GetFloat64(iterator_.GetRegisterOperand(operand_index),
-                      conversion_type);
+  ValueNode* LoadRegisterHoleyFloat64ForToNumber(int operand_index,
+                                                 ToNumberHint hint) {
+    return GetHoleyFloat64ForToNumber(
+        iterator_.GetRegisterOperand(operand_index), hint);
   }
 
   ValueNode* BuildLoadFixedArrayElement(ValueNode* node, int index) {
@@ -1070,6 +1303,13 @@ class MaglevGraphBuilder {
                    value->lazy_deopt_info()->IsResultRegister(target));
   }
 
+  void SetAccumulatorInBranch(ValueNode* value) {
+    DCHECK_IMPLIES(value->properties().can_lazy_deopt(),
+                   !IsNodeCreatedForThisBytecode(value));
+    current_interpreter_frame_.set(interpreter::Register::virtual_accumulator(),
+                                   value);
+  }
+
   template <typename NodeT>
   void StoreRegisterPair(
       std::pair<interpreter::Register, interpreter::Register> target,
@@ -1105,17 +1345,15 @@ class MaglevGraphBuilder {
 #endif
 
   DeoptFrame* GetParentDeoptFrame();
-  DeoptFrame GetLatestCheckpointedFrame();
   DeoptFrame GetDeoptFrameForLazyDeopt();
-  DeoptFrame GetDeoptFrameForLazyDeoptHelper(
-      LazyDeoptContinuationScope* continuation_scope,
-      bool mark_accumulator_dead);
+  DeoptFrame GetDeoptFrameForLazyDeoptHelper(DeoptFrameScope* scope,
+                                             bool mark_accumulator_dead);
   InterpretedDeoptFrame GetDeoptFrameForEntryStackCheck();
 
   template <typename NodeT>
   void MarkPossibleSideEffect(NodeT* node) {
     // Don't do anything for nodes without side effects.
-    if constexpr (!NodeT::kProperties.has_any_side_effects()) return;
+    if constexpr (!NodeT::kProperties.can_write()) return;
 
     // Simple field stores are stores which do nothing but change a field value
     // (i.e. no map transitions or calls into user code).
@@ -1123,7 +1361,7 @@ class MaglevGraphBuilder {
         std::is_same_v<NodeT, StoreTaggedFieldWithWriteBarrier> ||
         std::is_same_v<NodeT, StoreTaggedFieldNoWriteBarrier> ||
         std::is_same_v<NodeT, StoreDoubleField> ||
-        std::is_same_v<NodeT, CheckedStoreSmiField>;
+        std::is_same_v<NodeT, UpdateJSArrayLength>;
 
     // Don't change known node aspects for:
     //
@@ -1144,22 +1382,11 @@ class MaglevGraphBuilder {
     // the parent, since we'll anyway copy the known_node_aspects to the parent
     // once we finish the inlined function.
     if constexpr (should_clear_unstable_node_aspects) {
-      // A side effect could change existing objects' maps. For stable maps we
-      // know this hasn't happened (because we added a dependency on the maps
-      // staying stable and therefore not possible to transition away from), but
-      // we can no longer assume that objects with unstable maps still have the
-      // same map. Unstable maps can also transition to stable ones, so the
-      // set of stable maps becomes invalid for a not that had a unstable map.
-      auto it = known_node_aspects().unstable_maps.begin();
-      while (it != known_node_aspects().unstable_maps.end()) {
-        if (it->second.size() == 0) {
-          it++;
-        } else {
-          known_node_aspects().stable_maps.erase(it->first);
-          it = known_node_aspects().unstable_maps.erase(it);
-        }
+      if (v8_flags.trace_maglev_graph_building) {
+        std::cout << "  ! Clearing unstable node aspects" << std::endl;
       }
-      // Similarly, side-effects can change object contents, so we have to clear
+      known_node_aspects().ClearUnstableMaps();
+      // Side-effects can change object contents, so we have to clear
       // our known loaded properties -- however, constant properties are known
       // to not change (and we added a dependency on this), so we don't have to
       // clear those.
@@ -1167,17 +1394,24 @@ class MaglevGraphBuilder {
       known_node_aspects().loaded_context_slots.clear();
     }
 
-    // Other kinds of side effect have to be propagated up to the parent.
+    // All user-observable side effects need to clear state that is cached on
+    // the builder. This reset has to be propagated up through the parents.
+    // TODO(leszeks): What side effects aren't observable? Maybe migrations?
     for (MaglevGraphBuilder* builder = this; builder != nullptr;
          builder = builder->parent_) {
-      // All user-observable side effects need to clear the checkpointed frame.
-      // TODO(leszeks): What side effects aren't observable? Maybe migrations?
-      builder->latest_checkpointed_frame_.reset();
+      builder->ResetBuilderCachedState<is_possible_map_change>();
+    }
+  }
 
-      // If a map might have changed, then we need to re-check it for for-in.
-      if (is_possible_map_change) {
-        builder->current_for_in_state.receiver_needs_map_check = true;
-      }
+  template <bool is_possible_map_change = true>
+  void ResetBuilderCachedState() {
+    latest_checkpointed_frame_.reset();
+
+    // If a map might have changed, then we need to re-check it for for-in.
+    // TODO(leszeks): Track this on merge states / known node aspects, rather
+    // than on the graph, so that it can survive control flow.
+    if constexpr (is_possible_map_change) {
+      current_for_in_state.receiver_needs_map_check = true;
     }
   }
 
@@ -1197,10 +1431,20 @@ class MaglevGraphBuilder {
     return bytecode_analysis().GetOutLivenessFor(offset);
   }
 
-  void StartNewBlock(int offset) {
+  void StartNewBlock(int offset, BasicBlock* predecessor) {
+    StartNewBlock(predecessor, merge_states_[offset], jump_targets_[offset]);
+  }
+
+  void StartNewBlock(BasicBlock* predecessor,
+                     MergePointInterpreterFrameState* merge_state,
+                     BasicBlockRef& refs_to_block) {
     DCHECK_NULL(current_block_);
-    current_block_ = zone()->New<BasicBlock>(merge_states_[offset]);
-    ResolveJumpsToBlockAtOffset(current_block_, offset);
+    current_block_ = zone()->New<BasicBlock>(merge_state, zone());
+    if (merge_state == nullptr) {
+      DCHECK_NOT_NULL(predecessor);
+      current_block_->set_predecessor(predecessor);
+    }
+    refs_to_block.Bind(current_block_);
   }
 
   template <typename ControlNodeT, typename... Args>
@@ -1211,7 +1455,7 @@ class MaglevGraphBuilder {
     AttachEagerDeoptInfo(control_node);
     static_assert(!ControlNodeT::kProperties.can_lazy_deopt());
     static_assert(!ControlNodeT::kProperties.can_throw());
-    static_assert(!ControlNodeT::kProperties.has_any_side_effects());
+    static_assert(!ControlNodeT::kProperties.can_write());
     current_block_->set_control_node(control_node);
 
     BasicBlock* block = current_block_;
@@ -1219,6 +1463,9 @@ class MaglevGraphBuilder {
 
     graph()->Add(block);
     if (has_graph_labeller()) {
+      graph_labeller()->RegisterNode(control_node, compilation_unit_,
+                                     BytecodeOffset(iterator_.current_offset()),
+                                     current_source_position_);
       graph_labeller()->RegisterBasicBlock(block);
       if (v8_flags.trace_maglev_graph_building) {
         bool kSkipTargets = true;
@@ -1231,28 +1478,6 @@ class MaglevGraphBuilder {
     return block;
   }
 
-  // Update all jumps which were targetting the not-yet-created block at the
-  // given `block_offset`, to now point to the given `block`.
-  void ResolveJumpsToBlockAtOffset(BasicBlock* block, int block_offset) {
-    int interrupt_budget_correction = 0;
-    BasicBlockRef* jump_target_refs_head =
-        jump_targets_[block_offset].SetToBlockAndReturnNext(block);
-    while (jump_target_refs_head != nullptr) {
-      // Only one jump target should ever set the interrupt budget correction.
-      DCHECK_EQ(interrupt_budget_correction, 0);
-      interrupt_budget_correction =
-          jump_target_refs_head->interrupt_budget_correction();
-      jump_target_refs_head =
-          jump_target_refs_head->SetToBlockAndReturnNext(block);
-    }
-    if (v8_flags.maglev_increase_budget_forward_jump &&
-        ShouldEmitInterruptBudgetChecks() && interrupt_budget_correction != 0) {
-      DCHECK_GT(interrupt_budget_correction, 0);
-      AddNewNode<IncreaseInterruptBudget>({}, interrupt_budget_correction);
-    }
-    DCHECK_EQ(jump_targets_[block_offset].block_ptr(), block);
-  }
-
   void StartFallthroughBlock(int next_block_offset, BasicBlock* predecessor) {
     // Start a new block for the fallthrough path, unless it's a merge point, in
     // which case we merge our state into it. That merge-point could also be a
@@ -1262,10 +1487,11 @@ class MaglevGraphBuilder {
 
     if (NumPredecessors(next_block_offset) == 1) {
       if (v8_flags.trace_maglev_graph_building) {
-        std::cout << "== New block (single fallthrough) at " << function()
+        std::cout << "== New block (single fallthrough) at "
+                  << *compilation_unit_->shared_function_info().object()
                   << "==" << std::endl;
       }
-      StartNewBlock(next_block_offset);
+      StartNewBlock(next_block_offset, predecessor);
     } else {
       MergeIntoFrameState(predecessor, next_block_offset);
     }
@@ -1278,9 +1504,14 @@ class MaglevGraphBuilder {
     return GetTaggedValue(maybe_value);
   }
 
-  ValueNode* GetConvertReceiver(compiler::JSFunctionRef function,
+  ValueNode* GetRawConvertReceiver(compiler::SharedFunctionInfoRef shared,
+                                   const CallArguments& args);
+  ValueNode* GetConvertReceiver(compiler::SharedFunctionInfoRef shared,
                                 const CallArguments& args);
 
+  compiler::OptionalHeapObjectRef TryGetConstant(
+      ValueNode* node, ValueNode** constant_node = nullptr);
+
   template <typename LoadNode>
   ReduceResult TryBuildLoadDataView(const CallArguments& args,
                                     ExternalArrayType type);
@@ -1311,6 +1542,7 @@ class MaglevGraphBuilder {
   V(MathTanh)
 
 #define MAGLEV_REDUCED_BUILTIN(V)  \
+  V(ArrayForEach)                  \
   V(DataViewPrototypeGetInt8)      \
   V(DataViewPrototypeSetInt8)      \
   V(DataViewPrototypeGetInt16)     \
@@ -1320,50 +1552,62 @@ class MaglevGraphBuilder {
   V(DataViewPrototypeGetFloat64)   \
   V(DataViewPrototypeSetFloat64)   \
   V(FunctionPrototypeCall)         \
+  V(FunctionPrototypeHasInstance)  \
   V(ObjectPrototypeHasOwnProperty) \
   V(MathCeil)                      \
   V(MathFloor)                     \
   V(MathPow)                       \
+  V(ArrayPrototypePush)            \
   V(MathRound)                     \
+  V(StringConstructor)             \
   V(StringFromCharCode)            \
   V(StringPrototypeCharCodeAt)     \
   V(StringPrototypeCodePointAt)    \
+  V(StringPrototypeLocaleCompare)  \
   MATH_UNARY_IEEE_BUILTIN(V)
 
-#define DEFINE_BUILTIN_REDUCER(Name)                                   \
-  ReduceResult TryReduce##Name(compiler::JSFunctionRef builtin_target, \
+#define DEFINE_BUILTIN_REDUCER(Name)                           \
+  ReduceResult TryReduce##Name(compiler::JSFunctionRef target, \
                                CallArguments& args);
   MAGLEV_REDUCED_BUILTIN(DEFINE_BUILTIN_REDUCER)
 #undef DEFINE_BUILTIN_REDUCER
 
-  ReduceResult DoTryReduceMathRound(compiler::JSFunctionRef builtin_target,
-                                    CallArguments& args,
+  ReduceResult DoTryReduceMathRound(CallArguments& args,
                                     Float64Round::Kind kind);
 
   template <typename CallNode, typename... Args>
   CallNode* AddNewCallNode(const CallArguments& args, Args&&... extra_args);
 
-  ValueNode* BuildCallSelf(compiler::JSFunctionRef function,
+  ValueNode* BuildCallSelf(ValueNode* context, ValueNode* function,
+                           ValueNode* new_target,
+                           compiler::SharedFunctionInfoRef shared,
                            CallArguments& args);
-  ReduceResult TryReduceBuiltin(compiler::JSFunctionRef builtin_target,
+  ReduceResult TryReduceBuiltin(compiler::JSFunctionRef target,
+                                compiler::SharedFunctionInfoRef shared,
                                 CallArguments& args,
                                 const compiler::FeedbackSource& feedback_source,
                                 SpeculationMode speculation_mode);
   bool TargetIsCurrentCompilingUnit(compiler::JSFunctionRef target);
   ReduceResult TryBuildCallKnownJSFunction(
-      compiler::JSFunctionRef function, CallArguments& args,
+      compiler::JSFunctionRef function, ValueNode* new_target,
+      CallArguments& args, const compiler::FeedbackSource& feedback_source);
+  ReduceResult TryBuildCallKnownJSFunction(
+      ValueNode* context, ValueNode* function, ValueNode* new_target,
+      compiler::SharedFunctionInfoRef shared,
+      compiler::OptionalFeedbackVectorRef feedback_vector, CallArguments& args,
       const compiler::FeedbackSource& feedback_source);
-  bool ShouldInlineCall(compiler::JSFunctionRef function, float call_frequency);
+  bool ShouldInlineCall(compiler::SharedFunctionInfoRef shared,
+                        compiler::OptionalFeedbackVectorRef feedback_vector,
+                        float call_frequency);
   ReduceResult TryBuildInlinedCall(
-      compiler::JSFunctionRef function, CallArguments& args,
+      ValueNode* context, ValueNode* function, ValueNode* new_target,
+      compiler::SharedFunctionInfoRef shared,
+      compiler::OptionalFeedbackVectorRef feedback_vector, CallArguments& args,
       const compiler::FeedbackSource& feedback_source);
-  ValueNode* BuildGenericCall(ValueNode* target, ValueNode* context,
-                              Call::TargetType target_type,
-                              const CallArguments& args,
-                              const compiler::FeedbackSource& feedback_source =
-                                  compiler::FeedbackSource());
-  ReduceResult ReduceCall(
-      compiler::ObjectRef target, CallArguments& args,
+  ValueNode* BuildGenericCall(ValueNode* target, Call::TargetType target_type,
+                              const CallArguments& args);
+  ReduceResult ReduceCallForConstant(
+      compiler::JSFunctionRef target, CallArguments& args,
       const compiler::FeedbackSource& feedback_source =
           compiler::FeedbackSource(),
       SpeculationMode speculation_mode = SpeculationMode::kDisallowSpeculation);
@@ -1371,38 +1615,90 @@ class MaglevGraphBuilder {
       ValueNode* target_node, compiler::JSFunctionRef target,
       CallArguments& args, const compiler::FeedbackSource& feedback_source,
       SpeculationMode speculation_mode);
+  ReduceResult ReduceCallForNewClosure(
+      ValueNode* target_node, ValueNode* target_context,
+      compiler::SharedFunctionInfoRef shared,
+      compiler::OptionalFeedbackVectorRef feedback_vector, CallArguments& args,
+      const compiler::FeedbackSource& feedback_source,
+      SpeculationMode speculation_mode);
+  ReduceResult TryBuildCallKnownApiFunction(
+      compiler::JSFunctionRef function, compiler::SharedFunctionInfoRef shared,
+      CallArguments& args);
+  compiler::HolderLookupResult TryInferApiHolderValue(
+      compiler::FunctionTemplateInfoRef function_template_info,
+      ValueNode* receiver);
+  ReduceResult ReduceCallForApiFunction(
+      compiler::FunctionTemplateInfoRef api_callback,
+      compiler::OptionalSharedFunctionInfoRef maybe_shared,
+      compiler::OptionalJSObjectRef api_holder, CallArguments& args);
   ReduceResult ReduceFunctionPrototypeApplyCallWithReceiver(
       ValueNode* target_node, compiler::JSFunctionRef receiver,
       CallArguments& args, const compiler::FeedbackSource& feedback_source,
       SpeculationMode speculation_mode);
-  void BuildCall(ValueNode* target_node, CallArguments& args,
-                 compiler::FeedbackSource& feedback_source);
+  ReduceResult ReduceCall(
+      ValueNode* target_node, CallArguments& args,
+      const compiler::FeedbackSource& feedback_source =
+          compiler::FeedbackSource(),
+      SpeculationMode speculation_mode = SpeculationMode::kDisallowSpeculation);
+  void BuildCallWithFeedback(ValueNode* target_node, CallArguments& args,
+                             const compiler::FeedbackSource& feedback_source);
   void BuildCallFromRegisterList(ConvertReceiverMode receiver_mode);
   void BuildCallFromRegisters(int argc_count,
                               ConvertReceiverMode receiver_mode);
 
-  bool TryBuildScriptContextConstantAccess(
+  ValueNode* BuildGenericConstruct(
+      ValueNode* target, ValueNode* new_target, ValueNode* context,
+      const CallArguments& args,
+      const compiler::FeedbackSource& feedback_source =
+          compiler::FeedbackSource());
+  ReduceResult ReduceConstruct(compiler::HeapObjectRef feedback_target,
+                               ValueNode* target, ValueNode* new_target,
+                               CallArguments& args,
+                               compiler::FeedbackSource& feedback_source);
+  void BuildConstruct(ValueNode* target, ValueNode* new_target,
+                      CallArguments& args,
+                      compiler::FeedbackSource& feedback_source);
+
+  ReduceResult TryBuildScriptContextStore(
+      const compiler::GlobalAccessFeedback& global_access_feedback);
+  ReduceResult TryBuildPropertyCellStore(
+      const compiler::GlobalAccessFeedback& global_access_feedback);
+  ReduceResult TryBuildGlobalStore(
+      const compiler::GlobalAccessFeedback& global_access_feedback);
+
+  ReduceResult TryBuildScriptContextConstantLoad(
+      const compiler::GlobalAccessFeedback& global_access_feedback);
+  ReduceResult TryBuildScriptContextLoad(
       const compiler::GlobalAccessFeedback& global_access_feedback);
-  bool TryBuildScriptContextAccess(
+  ReduceResult TryBuildPropertyCellLoad(
       const compiler::GlobalAccessFeedback& global_access_feedback);
-  bool TryBuildPropertyCellAccess(
+  ReduceResult TryBuildGlobalLoad(
       const compiler::GlobalAccessFeedback& global_access_feedback);
 
+  bool TryBuildFindNonDefaultConstructorOrConstruct(
+      ValueNode* this_function, ValueNode* new_target,
+      std::pair<interpreter::Register, interpreter::Register> result);
+
   ValueNode* BuildSmiUntag(ValueNode* node);
   ValueNode* BuildNumberOrOddballToFloat64(
       ValueNode* node, TaggedToFloat64ConversionType conversion_type);
 
-  void BuildCheckSmi(ValueNode* object);
+  void BuildCheckSmi(ValueNode* object, bool elidable = true);
   void BuildCheckNumber(ValueNode* object);
   void BuildCheckHeapObject(ValueNode* object);
+  void BuildCheckJSReceiver(ValueNode* object);
   void BuildCheckString(ValueNode* object);
   void BuildCheckSymbol(ValueNode* object);
-  void BuildCheckMaps(ValueNode* object,
-                      base::Vector<const compiler::MapRef> maps);
+  ReduceResult BuildCheckMaps(ValueNode* object,
+                              base::Vector<const compiler::MapRef> maps);
+  ReduceResult BuildTransitionElementsKindOrCheckMap(
+      ValueNode* object,
+      base::Vector<const compiler::MapRef> transition_sources,
+      compiler::MapRef transition_target);
   // Emits an unconditional deopt and returns false if the node is a constant
   // that doesn't match the ref.
-  ReduceResult BuildCheckValue(ValueNode* node,
-                               const compiler::HeapObjectRef& ref);
+  ReduceResult BuildCheckValue(ValueNode* node, compiler::ObjectRef ref);
+  ReduceResult BuildCheckValue(ValueNode* node, compiler::HeapObjectRef ref);
 
   bool CanElideWriteBarrier(ValueNode* object, ValueNode* value);
   void BuildStoreTaggedField(ValueNode* object, ValueNode* value, int offset);
@@ -1427,23 +1723,26 @@ class MaglevGraphBuilder {
       base::Vector<const compiler::MapRef> const& receiver_maps);
 
   compiler::OptionalObjectRef TryFoldLoadDictPrototypeConstant(
-      compiler::PropertyAccessInfo access_info);
+      compiler::PropertyAccessInfo const& access_info);
   compiler::OptionalObjectRef TryFoldLoadConstantDataField(
-      compiler::PropertyAccessInfo access_info, ValueNode* lookup_start_object);
+      compiler::PropertyAccessInfo const& access_info,
+      ValueNode* lookup_start_object);
 
   // Returns the loaded value node but doesn't update the accumulator yet.
-  ValueNode* BuildLoadField(compiler::PropertyAccessInfo access_info,
+  ValueNode* BuildLoadField(compiler::PropertyAccessInfo const& access_info,
                             ValueNode* lookup_start_object);
-  ReduceResult TryBuildStoreField(compiler::PropertyAccessInfo access_info,
-                                  ValueNode* receiver,
-                                  compiler::AccessMode access_mode);
+  ReduceResult TryBuildStoreField(
+      compiler::PropertyAccessInfo const& access_info, ValueNode* receiver,
+      compiler::AccessMode access_mode);
   ReduceResult TryBuildPropertyGetterCall(
-      compiler::PropertyAccessInfo access_info, ValueNode* receiver,
+      compiler::PropertyAccessInfo const& access_info, ValueNode* receiver,
       ValueNode* lookup_start_object);
   ReduceResult TryBuildPropertySetterCall(
-      compiler::PropertyAccessInfo access_info, ValueNode* receiver,
+      compiler::PropertyAccessInfo const& access_info, ValueNode* receiver,
       ValueNode* value);
 
+  ReduceResult BuildLoadJSArrayLength(ValueNode* js_array);
+
   ReduceResult TryBuildPropertyLoad(
       ValueNode* receiver, ValueNode* lookup_start_object,
       compiler::NameRef name, compiler::PropertyAccessInfo const& access_info);
@@ -1473,6 +1772,14 @@ class MaglevGraphBuilder {
       ValueNode* object, ValueNode* index,
       const compiler::ElementAccessInfo& access_info,
       compiler::KeyedAccessMode const& keyed_mode);
+  ReduceResult TryBuildElementLoadOnJSArrayOrJSObject(
+      ValueNode* object, ValueNode* index,
+      const compiler::ElementAccessInfo& access_info,
+      KeyedAccessLoadMode load_mode);
+  ReduceResult TryBuildElementStoreOnJSArrayOrJSObject(
+      ValueNode* object, ValueNode* index_object, ValueNode* value,
+      base::Vector<const compiler::MapRef> maps, ElementsKind kind,
+      const compiler::KeyedAccessMode& keyed_mode);
   ReduceResult TryBuildElementAccessOnJSArrayOrJSObject(
       ValueNode* object, ValueNode* index,
       const compiler::ElementAccessInfo& access_info,
@@ -1487,9 +1794,13 @@ class MaglevGraphBuilder {
   // subsequent loads.
   void RecordKnownProperty(ValueNode* lookup_start_object,
                            compiler::NameRef name, ValueNode* value,
-                           compiler::PropertyAccessInfo const& access_info);
-  bool TryReuseKnownPropertyLoad(ValueNode* lookup_start_object,
-                                 compiler::NameRef name);
+                           bool is_const, compiler::AccessMode access_mode);
+  ReduceResult TryReuseKnownPropertyLoad(ValueNode* lookup_start_object,
+                                         compiler::NameRef name);
+
+  // Converts the input node to a representation that's valid to store into an
+  // array with elements kind |kind|.
+  ValueNode* ConvertForStoring(ValueNode* node, ElementsKind kind);
 
   enum InferHasInPrototypeChainResult {
     kMayBeInPrototypeChain,
@@ -1498,20 +1809,20 @@ class MaglevGraphBuilder {
   };
   InferHasInPrototypeChainResult InferHasInPrototypeChain(
       ValueNode* receiver, compiler::HeapObjectRef prototype);
-  bool TryBuildFastHasInPrototypeChain(ValueNode* object,
-                                       compiler::ObjectRef prototype);
-  void BuildHasInPrototypeChain(ValueNode* object,
-                                compiler::ObjectRef prototype);
-  bool TryBuildFastOrdinaryHasInstance(ValueNode* object,
-                                       compiler::JSObjectRef callable,
-                                       ValueNode* callable_node);
-  void BuildOrdinaryHasInstance(ValueNode* object,
-                                compiler::JSObjectRef callable,
-                                ValueNode* callable_node);
-  bool TryBuildFastInstanceOf(ValueNode* object,
-                              compiler::JSObjectRef callable_ref,
-                              ValueNode* callable_node);
-  bool TryBuildFastInstanceOfWithFeedback(
+  ReduceResult TryBuildFastHasInPrototypeChain(
+      ValueNode* object, compiler::HeapObjectRef prototype);
+  ReduceResult BuildHasInPrototypeChain(ValueNode* object,
+                                        compiler::HeapObjectRef prototype);
+  ReduceResult TryBuildFastOrdinaryHasInstance(ValueNode* object,
+                                               compiler::JSObjectRef callable,
+                                               ValueNode* callable_node);
+  ReduceResult BuildOrdinaryHasInstance(ValueNode* object,
+                                        compiler::JSObjectRef callable,
+                                        ValueNode* callable_node);
+  ReduceResult TryBuildFastInstanceOf(ValueNode* object,
+                                      compiler::JSObjectRef callable_ref,
+                                      ValueNode* callable_node);
+  ReduceResult TryBuildFastInstanceOfWithFeedback(
       ValueNode* object, ValueNode* callable,
       compiler::FeedbackSource feedback_source);
 
@@ -1521,15 +1832,15 @@ class MaglevGraphBuilder {
 
   ReduceResult TryBuildFastCreateObjectOrArrayLiteral(
       const compiler::LiteralFeedback& feedback);
-  base::Optional<FastLiteralObject> TryReadBoilerplateForFastLiteral(
+  base::Optional<FastObject> TryReadBoilerplateForFastLiteral(
       compiler::JSObjectRef boilerplate, AllocationType allocation,
       int max_depth, int* max_properties);
-  ValueNode* BuildAllocateFastLiteral(FastLiteralObject object,
-                                      AllocationType allocation);
-  ValueNode* BuildAllocateFastLiteral(FastLiteralField value,
-                                      AllocationType allocation);
-  ValueNode* BuildAllocateFastLiteral(FastLiteralFixedArray array,
-                                      AllocationType allocation);
+  ValueNode* BuildAllocateFastObject(FastObject object,
+                                     AllocationType allocation);
+  ValueNode* BuildAllocateFastObject(FastField value,
+                                     AllocationType allocation);
+  ValueNode* BuildAllocateFastObject(FastFixedArray array,
+                                     AllocationType allocation);
 
   template <Operation kOperation>
   void BuildGenericUnaryOperationNode();
@@ -1538,6 +1849,9 @@ class MaglevGraphBuilder {
   template <Operation kOperation>
   void BuildGenericBinarySmiOperationNode();
 
+  template <Operation kOperation>
+  bool TryReduceCompareEqualAgainstConstant();
+
   template <Operation kOperation>
   ValueNode* TryFoldInt32BinaryOperation(ValueNode* left, ValueNode* right);
   template <Operation kOperation>
@@ -1545,27 +1859,21 @@ class MaglevGraphBuilder {
 
   template <Operation kOperation>
   void BuildInt32UnaryOperationNode();
-  void BuildTruncatingInt32BitwiseNotForNumber(
-      TaggedToFloat64ConversionType conversion_type);
+  void BuildTruncatingInt32BitwiseNotForToNumber(ToNumberHint hint);
   template <Operation kOperation>
   void BuildInt32BinaryOperationNode();
   template <Operation kOperation>
   void BuildInt32BinarySmiOperationNode();
   template <Operation kOperation>
-  void BuildTruncatingInt32BinaryOperationNodeForNumber(
-      TaggedToFloat64ConversionType conversion_type);
+  void BuildTruncatingInt32BinaryOperationNodeForToNumber(ToNumberHint hint);
   template <Operation kOperation>
-  void BuildTruncatingInt32BinarySmiOperationNodeForNumber(
-      TaggedToFloat64ConversionType conversion_type);
+  void BuildTruncatingInt32BinarySmiOperationNodeForToNumber(ToNumberHint hint);
   template <Operation kOperation>
-  void BuildFloat64UnaryOperationNode(
-      TaggedToFloat64ConversionType conversion_type);
+  void BuildFloat64UnaryOperationNodeForToNumber(ToNumberHint hint);
   template <Operation kOperation>
-  void BuildFloat64BinaryOperationNode(
-      TaggedToFloat64ConversionType conversion_type);
+  void BuildFloat64BinaryOperationNodeForToNumber(ToNumberHint hint);
   template <Operation kOperation>
-  void BuildFloat64BinarySmiOperationNode(
-      TaggedToFloat64ConversionType conversion_type);
+  void BuildFloat64BinarySmiOperationNodeForToNumber(ToNumberHint hint);
 
   template <Operation kOperation>
   void VisitUnaryOperation();
@@ -1574,10 +1882,6 @@ class MaglevGraphBuilder {
   template <Operation kOperation>
   void VisitBinarySmiOperation();
 
-  template <typename BranchControlNodeT, typename... Args>
-  bool TryBuildBranchFor(std::initializer_list<ValueNode*> control_inputs,
-                         Args&&... args);
-
   template <Operation kOperation>
   void VisitCompareOperation();
 
@@ -1586,13 +1890,28 @@ class MaglevGraphBuilder {
   void MergeDeadLoopIntoFrameState(int target);
   void MergeIntoInlinedReturnFrameState(BasicBlock* block);
 
+  bool HasValidInitialMap(compiler::JSFunctionRef new_target,
+                          compiler::JSFunctionRef constructor);
+
+  BasicBlock* BuildBranchIfReferenceEqual(ValueNode* lhs, ValueNode* rhs,
+                                          BasicBlockRef* true_target,
+                                          BasicBlockRef* false_target);
+
   enum JumpType { kJumpIfTrue, kJumpIfFalse };
-  void BuildBranchIfRootConstant(ValueNode* node, JumpType jump_type,
-                                 RootIndex root_index);
+  enum class BranchSpecializationMode { kDefault, kAlwaysBoolean };
+  JumpType NegateJumpType(JumpType jump_type);
+  void BuildBranchIfRootConstant(
+      ValueNode* node, JumpType jump_type, RootIndex root_index,
+      BranchSpecializationMode mode = BranchSpecializationMode::kDefault);
   void BuildBranchIfTrue(ValueNode* node, JumpType jump_type);
   void BuildBranchIfNull(ValueNode* node, JumpType jump_type);
   void BuildBranchIfUndefined(ValueNode* node, JumpType jump_type);
   void BuildBranchIfToBooleanTrue(ValueNode* node, JumpType jump_type);
+  template <bool flip = false>
+  ValueNode* BuildToBoolean(ValueNode* node);
+  BasicBlock* BuildSpecializedBranchIfCompareNode(ValueNode* node,
+                                                  BasicBlockRef* true_target,
+                                                  BasicBlockRef* false_target);
 
   void BuildToNumberOrToNumeric(Object::Conversion mode);
 
@@ -1600,14 +1919,55 @@ class MaglevGraphBuilder {
     // Add 1 after the end of the bytecode so we can always write to the offset
     // after the last bytecode.
     size_t array_length = bytecode().length() + 1;
-    predecessors_ = zone()->NewArray<uint32_t>(array_length);
-    MemsetUint32(predecessors_, 1, array_length);
+    predecessors_ = zone()->AllocateArray<uint32_t>(array_length);
+    MemsetUint32(predecessors_, 0, entrypoint_);
+    MemsetUint32(predecessors_ + entrypoint_, 1, array_length - entrypoint_);
 
+    // We count jumps from peeled loops to outside of the loop twice.
+    bool is_loop_peeling_iteration = false;
+    base::Optional<int> peeled_loop_end;
     interpreter::BytecodeArrayIterator iterator(bytecode().object());
-    for (; !iterator.done(); iterator.Advance()) {
+    for (iterator.SetOffset(entrypoint_); !iterator.done();
+         iterator.Advance()) {
       interpreter::Bytecode bytecode = iterator.current_bytecode();
+      if (allow_loop_peeling_ &&
+          bytecode_analysis().IsLoopHeader(iterator.current_offset())) {
+        const compiler::LoopInfo& loop_info =
+            bytecode_analysis().GetLoopInfoFor(iterator.current_offset());
+        // Generators use irreducible control flow, which makes loop peeling too
+        // complicated.
+        if (loop_info.innermost() && !loop_info.resumable()) {
+          DCHECK(!is_loop_peeling_iteration);
+          is_loop_peeling_iteration = true;
+          loop_headers_to_peel_.Add(iterator.current_offset());
+          peeled_loop_end = bytecode_analysis().GetLoopEndOffsetForInnermost(
+              iterator.current_offset());
+        }
+      }
       if (interpreter::Bytecodes::IsJump(bytecode)) {
-        predecessors_[iterator.GetJumpTargetOffset()]++;
+        if (is_loop_peeling_iteration &&
+            bytecode == interpreter::Bytecode::kJumpLoop) {
+          DCHECK_EQ(iterator.next_offset(), peeled_loop_end);
+          is_loop_peeling_iteration = false;
+          peeled_loop_end = {};
+        }
+        if (iterator.GetJumpTargetOffset() < entrypoint_) {
+          static_assert(kLoopsMustBeEnteredThroughHeader);
+          if (predecessors_[iterator.GetJumpTargetOffset()] == 1) {
+            // We encoutered a JumpLoop whose loop header is not reachable
+            // otherwise. This loop is either dead or the JumpLoop will bail
+            // with DeoptimizeReason::kOSREarlyExit.
+            predecessors_[iterator.GetJumpTargetOffset()] = 0;
+          }
+        } else {
+          predecessors_[iterator.GetJumpTargetOffset()]++;
+        }
+        if (is_loop_peeling_iteration &&
+            iterator.GetJumpTargetOffset() >= *peeled_loop_end) {
+          // Jumps from within the peeled loop to outside need to be counted
+          // twice, once for the peeled and once for the regular loop body.
+          predecessors_[iterator.GetJumpTargetOffset()]++;
+        }
         if (!interpreter::Bytecodes::IsConditionalJump(bytecode)) {
           predecessors_[iterator.next_offset()]--;
         }
@@ -1621,6 +1981,9 @@ class MaglevGraphBuilder {
         // Collect inline return jumps in the slot after the last bytecode.
         if (is_inline() && interpreter::Bytecodes::Returns(bytecode)) {
           predecessors_[array_length - 1]++;
+          if (is_loop_peeling_iteration) {
+            predecessors_[array_length - 1]++;
+          }
         }
       }
       // TODO(leszeks): Also consider handler entries (the bytecode analysis)
@@ -1633,8 +1996,7 @@ class MaglevGraphBuilder {
 
   int NumPredecessors(int offset) { return predecessors_[offset]; }
 
-  compiler::JSHeapBroker* broker() const { return broker_; }
-  const compiler::FeedbackVectorRef& feedback() const {
+  compiler::FeedbackVectorRef feedback() const {
     return compilation_unit_->feedback();
   }
   const FeedbackNexus FeedbackNexusForOperand(int slot_operand_index) const {
@@ -1646,16 +2008,12 @@ class MaglevGraphBuilder {
     return FeedbackNexus(feedback().object(), slot,
                          broker()->feedback_nexus_config());
   }
-  const compiler::BytecodeArrayRef& bytecode() const {
+  compiler::BytecodeArrayRef bytecode() const {
     return compilation_unit_->bytecode();
   }
-  const compiler::JSFunctionRef& function() const {
-    return compilation_unit_->function();
-  }
   const compiler::BytecodeAnalysis& bytecode_analysis() const {
     return bytecode_analysis_;
   }
-  LocalIsolate* local_isolate() const { return local_isolate_; }
   int parameter_count() const { return compilation_unit_->parameter_count(); }
   int parameter_count_without_receiver() { return parameter_count() - 1; }
   int register_count() const { return compilation_unit_->register_count(); }
@@ -1678,7 +2036,7 @@ class MaglevGraphBuilder {
   MaglevCompilationUnit* const compilation_unit_;
   MaglevGraphBuilder* const parent_;
   DeoptFrame* parent_deopt_frame_ = nullptr;
-  BasicBlockRef* parent_catch_block_ = nullptr;
+  CatchBlockDetails parent_catch_;
   // Cache the heap broker since we access it a bunch.
   compiler::JSHeapBroker* broker_ = compilation_unit_->broker();
 
@@ -1688,9 +2046,20 @@ class MaglevGraphBuilder {
   SourcePositionTableIterator source_position_iterator_;
   uint32_t* predecessors_;
 
+  bool in_peeled_iteration_ = false;
+  bool allow_loop_peeling_;
+
+  // When processing the peeled iteration of a loop, we need to reset the
+  // decremented predecessor counts inside of the loop before processing the
+  // body again. For this, we record offsets where we decremented the
+  // predecessor count.
+  ZoneVector<int> decremented_predecessor_offsets_;
+  // The set of loop headers for which we decided to do loop peeling.
+  BitVector loop_headers_to_peel_;
+
   // Current block information.
   BasicBlock* current_block_ = nullptr;
-  base::Optional<InterpretedDeoptFrame> latest_checkpointed_frame_;
+  base::Optional<DeoptFrame> latest_checkpointed_frame_;
   SourcePosition current_source_position_;
   struct ForInState {
     ValueNode* receiver = nullptr;
@@ -1718,8 +2087,14 @@ class MaglevGraphBuilder {
   // base::Vector<ValueNode*>* inlined_arguments_ = nullptr;
   base::Optional<base::Vector<ValueNode*>> inlined_arguments_;
   BytecodeOffset caller_bytecode_offset_;
+  ValueNode* inlined_new_target_ = nullptr;
+
+  // Bytecode offset at which compilation should start.
+  int entrypoint_;
+
+  int inlining_id_;
 
-  LazyDeoptContinuationScope* current_lazy_deopt_continuation_scope_ = nullptr;
+  DeoptFrameScope* current_deopt_scope_ = nullptr;
 
   struct HandlerTableEntry {
     int end;
diff --git a/deps/v8/src/maglev/maglev-graph-labeller.h b/deps/v8/src/maglev/maglev-graph-labeller.h
index 076377ed11b71e..cf9f7b578a469f 100644
--- a/deps/v8/src/maglev/maglev-graph-labeller.h
+++ b/deps/v8/src/maglev/maglev-graph-labeller.h
@@ -9,6 +9,7 @@
 
 #include "src/maglev/maglev-graph.h"
 #include "src/maglev/maglev-ir.h"
+#include "src/utils/utils.h"
 
 namespace v8 {
 namespace internal {
@@ -16,27 +17,45 @@ namespace maglev {
 
 class MaglevGraphLabeller {
  public:
-  void RegisterNode(const Node* node) {
-    if (node_ids_.emplace(node, next_node_id_).second) {
-      next_node_id_++;
+  struct Provenance {
+    const MaglevCompilationUnit* unit = nullptr;
+    BytecodeOffset bytecode_offset = BytecodeOffset::None();
+    SourcePosition position = SourcePosition::Unknown();
+  };
+  struct NodeInfo {
+    int label = -1;
+    Provenance provenance;
+  };
+
+  void RegisterNode(const NodeBase* node, const MaglevCompilationUnit* unit,
+                    BytecodeOffset bytecode_offset, SourcePosition position) {
+    if (nodes_
+            .emplace(node, NodeInfo{next_node_label_,
+                                    {unit, bytecode_offset, position}})
+            .second) {
+      next_node_label_++;
     }
   }
+  void RegisterNode(const NodeBase* node) {
+    RegisterNode(node, nullptr, BytecodeOffset::None(),
+                 SourcePosition::Unknown());
+  }
   void RegisterBasicBlock(const BasicBlock* block) {
-    block_ids_[block] = next_block_id_++;
-    if (node_ids_.emplace(block->control_node(), next_node_id_).second) {
-      next_node_id_++;
-    }
+    block_ids_[block] = next_block_label_++;
   }
 
   int BlockId(const BasicBlock* block) { return block_ids_[block]; }
-  int NodeId(const NodeBase* node) { return node_ids_[node]; }
+  int NodeId(const NodeBase* node) { return nodes_[node].label; }
+  const Provenance& GetNodeProvenance(const NodeBase* node) {
+    return nodes_[node].provenance;
+  }
 
-  int max_node_id() const { return next_node_id_ - 1; }
+  int max_node_id() const { return next_node_label_ - 1; }
 
   void PrintNodeLabel(std::ostream& os, const NodeBase* node) {
-    auto node_id_it = node_ids_.find(node);
+    auto node_id_it = nodes_.find(node);
 
-    if (node_id_it == node_ids_.end()) {
+    if (node_id_it == nodes_.end()) {
       os << "<unregistered node " << node << ">";
       return;
     }
@@ -44,7 +63,7 @@ class MaglevGraphLabeller {
     if (node->has_id()) {
       os << "v" << node->id() << "/";
     }
-    os << "n" << node_id_it->second;
+    os << "n" << node_id_it->second.label;
   }
 
   void PrintInput(std::ostream& os, const Input& input) {
@@ -54,9 +73,9 @@ class MaglevGraphLabeller {
 
  private:
   std::map<const BasicBlock*, int> block_ids_;
-  std::map<const NodeBase*, int> node_ids_;
-  int next_block_id_ = 1;
-  int next_node_id_ = 1;
+  std::map<const NodeBase*, NodeInfo> nodes_;
+  int next_block_label_ = 1;
+  int next_node_label_ = 1;
 };
 
 }  // namespace maglev
diff --git a/deps/v8/src/maglev/maglev-graph-printer.cc b/deps/v8/src/maglev/maglev-graph-printer.cc
index 9762bb622aa77a..b2b0f91ec881e9 100644
--- a/deps/v8/src/maglev/maglev-graph-printer.cc
+++ b/deps/v8/src/maglev/maglev-graph-printer.cc
@@ -2,6 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#ifdef V8_ENABLE_MAGLEV_GRAPH_PRINTER
+
 #include "src/maglev/maglev-graph-printer.h"
 
 #include <initializer_list>
@@ -10,11 +12,18 @@
 #include <type_traits>
 #include <vector>
 
+#include "src/base/logging.h"
+#include "src/common/assert-scope.h"
+#include "src/interpreter/bytecode-array-iterator.h"
+#include "src/interpreter/bytecode-decoder.h"
 #include "src/maglev/maglev-basic-block.h"
 #include "src/maglev/maglev-graph-labeller.h"
 #include "src/maglev/maglev-graph-processor.h"
 #include "src/maglev/maglev-graph.h"
 #include "src/maglev/maglev-ir.h"
+#include "src/objects/script-inl.h"
+#include "src/objects/shared-function-info-inl.h"
+#include "src/utils/utils.h"
 
 namespace v8 {
 namespace internal {
@@ -403,6 +412,21 @@ void PrintSingleDeoptFrame(
       os << "}";
       break;
     }
+    case DeoptFrame::FrameType::kConstructInvokeStubFrame: {
+      os << "@ConstructInvokeStub";
+      if (!v8_flags.print_maglev_deopt_verbose) return;
+      os << " : {";
+      os << "<this>:"
+         << PrintNodeLabel(graph_labeller, frame.as_construct_stub().receiver())
+         << ":" << current_input_location->operand();
+      current_input_location++;
+      os << ", <context>:"
+         << PrintNodeLabel(graph_labeller, frame.as_construct_stub().context())
+         << ":" << current_input_location->operand();
+      current_input_location++;
+      os << "}";
+      break;
+    }
     case DeoptFrame::FrameType::kInlinedArgumentsFrame: {
       os << "@" << frame.as_inlined_arguments().bytecode_position();
       if (!v8_flags.print_maglev_deopt_verbose) return;
@@ -537,30 +561,37 @@ void PrintExceptionHandlerPoint(std::ostream& os,
   BasicBlock* block = info->catch_block.block_ptr();
   DCHECK(block->is_exception_handler_block());
 
-  Phi* first_phi = block->phis()->first();
-  if (first_phi == nullptr) {
-    // No phis in the block.
+  if (!block->has_phi()) {
     return;
   }
+  Phi* first_phi = block->phis()->first();
+  CHECK_NOT_NULL(first_phi);
   int handler_offset = first_phi->merge_state()->merge_offset();
 
   // The exception handler liveness should be a subset of lazy_deopt_info one.
   auto* liveness = block->state()->frame_state().liveness();
   LazyDeoptInfo* deopt_info = node->lazy_deopt_info();
 
-  const InterpretedDeoptFrame& lazy_frame =
-      deopt_info->top_frame().type() ==
-              DeoptFrame::FrameType::kBuiltinContinuationFrame
-          ? deopt_info->top_frame().parent()->as_interpreted()
-          : deopt_info->top_frame().as_interpreted();
+  const InterpretedDeoptFrame* lazy_frame;
+  switch (deopt_info->top_frame().type()) {
+    case DeoptFrame::FrameType::kInterpretedFrame:
+      lazy_frame = &deopt_info->top_frame().as_interpreted();
+      break;
+    case DeoptFrame::FrameType::kInlinedArgumentsFrame:
+      UNREACHABLE();
+    case DeoptFrame::FrameType::kConstructInvokeStubFrame:
+    case DeoptFrame::FrameType::kBuiltinContinuationFrame:
+      lazy_frame = &deopt_info->top_frame().parent()->as_interpreted();
+      break;
+  }
 
   PrintVerticalArrows(os, targets);
   PrintPadding(os, graph_labeller, max_node_id, 0);
 
   os << "  ↳ throw @" << handler_offset << " : {";
   bool first = true;
-  lazy_frame.as_interpreted().frame_state()->ForEachValue(
-      lazy_frame.as_interpreted().unit(),
+  lazy_frame->as_interpreted().frame_state()->ForEachValue(
+      lazy_frame->as_interpreted().unit(),
       [&](ValueNode* node, interpreter::Register reg) {
         if (!reg.is_parameter() && !liveness->RegisterIsLive(reg.index())) {
           // Skip, since not live at the handler offset.
@@ -598,9 +629,79 @@ void MaybePrintLazyDeoptOrExceptionHandler(std::ostream& os,
   }
 }
 
+void MaybePrintProvenance(std::ostream& os, std::vector<BasicBlock*> targets,
+                          MaglevGraphLabeller::Provenance provenance,
+                          MaglevGraphLabeller::Provenance existing_provenance) {
+  DisallowGarbageCollection no_gc;
+
+  // Print function every time the compilation unit changes.
+  bool needs_function_print = provenance.unit != existing_provenance.unit;
+  Tagged<Script> script;
+  Script::PositionInfo position_info;
+  bool has_position_info = false;
+
+  // Print position inside function every time either the position or the
+  // compilation unit changes.
+  if (provenance.position.IsKnown() &&
+      (provenance.position != existing_provenance.position ||
+       provenance.unit != existing_provenance.unit)) {
+    script = Script::cast(
+        provenance.unit->shared_function_info().object()->script());
+    has_position_info = script->GetPositionInfo(
+        provenance.position.ScriptOffset(), &position_info,
+        Script::OffsetFlag::kWithOffset);
+    needs_function_print = true;
+  }
+
+  // Do the actual function + position print.
+  if (needs_function_print) {
+    if (script.is_null()) {
+      script = Script::cast(
+          provenance.unit->shared_function_info().object()->script());
+    }
+    PrintVerticalArrows(os, targets);
+    if (v8_flags.log_colour) {
+      os << "\033[1;34m";
+    }
+    os << *provenance.unit->shared_function_info().object() << " ("
+       << script->GetNameOrSourceURL();
+    if (has_position_info) {
+      os << ":" << position_info.line << ":" << position_info.column;
+    } else if (provenance.position.IsKnown()) {
+      os << "@" << provenance.position.ScriptOffset();
+    }
+    os << ")\n";
+    if (v8_flags.log_colour) {
+      os << "\033[m";
+    }
+  }
+
+  // Print current bytecode every time the offset or current compilation unit
+  // (i.e. bytecode array) changes.
+  if (!provenance.bytecode_offset.IsNone() &&
+      (provenance.bytecode_offset != existing_provenance.bytecode_offset ||
+       provenance.unit != existing_provenance.unit)) {
+    PrintVerticalArrows(os, targets);
+
+    interpreter::BytecodeArrayIterator iterator(
+        provenance.unit->bytecode().object(),
+        provenance.bytecode_offset.ToInt(), no_gc);
+    if (v8_flags.log_colour) {
+      os << "\033[0;34m";
+    }
+    os << std::setw(4) << iterator.current_offset() << " : ";
+    interpreter::BytecodeDecoder::Decode(os, iterator.current_address(), false);
+    os << "\n";
+    if (v8_flags.log_colour) {
+      os << "\033[m";
+    }
+  }
+}
+
 }  // namespace
 
-void MaglevPrintingVisitor::Process(Phi* phi, const ProcessingState& state) {
+ProcessResult MaglevPrintingVisitor::Process(Phi* phi,
+                                             const ProcessingState& state) {
   PrintVerticalArrows(os_, targets_);
   PrintPaddedId(os_, graph_labeller_, max_node_id_, phi);
   os_ << "φ";
@@ -617,13 +718,16 @@ void MaglevPrintingVisitor::Process(Phi* phi, const ProcessingState& state) {
     case ValueRepresentation::kFloat64:
       os_ << "ᶠ";
       break;
+    case ValueRepresentation::kHoleyFloat64:
+      os_ << "ʰᶠ";
+      break;
     case ValueRepresentation::kWord64:
       UNREACHABLE();
   }
   if (phi->input_count() == 0) {
     os_ << "ₑ " << phi->owner().ToString();
   } else {
-    os_ << " (";
+    os_ << " " << phi->owner().ToString() << " (";
     // Manually walk Phi inputs to print just the node labels, without
     // input locations (which are shown in the predecessor block's gap
     // moves).
@@ -640,17 +744,34 @@ void MaglevPrintingVisitor::Process(Phi* phi, const ProcessingState& state) {
       os_ << " (compressed)";
     }
   }
-  os_ << " → " << phi->result().operand() << "\n";
+  os_ << " → " << phi->result().operand();
+  if (phi->has_valid_live_range()) {
+    os_ << ", live range: [" << phi->live_range().start << "-"
+        << phi->live_range().end << "]";
+  }
+  os_ << "\n";
 
   MaglevPrintingVisitorOstream::cast(os_for_additional_info_)
       ->set_padding(MaxIdWidth(graph_labeller_, max_node_id_, 2));
+  return ProcessResult::kContinue;
 }
 
-void MaglevPrintingVisitor::Process(Node* node, const ProcessingState& state) {
+ProcessResult MaglevPrintingVisitor::Process(Node* node,
+                                             const ProcessingState& state) {
+  MaglevGraphLabeller::Provenance provenance =
+      graph_labeller_->GetNodeProvenance(node);
+  if (provenance.unit != nullptr) {
+    MaybePrintProvenance(os_, targets_, provenance, existing_provenance_);
+    existing_provenance_ = provenance;
+  }
+
   MaybePrintEagerDeopt(os_, targets_, node, graph_labeller_, max_node_id_);
 
   PrintVerticalArrows(os_, targets_);
   PrintPaddedId(os_, graph_labeller_, max_node_id_, node);
+  if (node->properties().is_call()) {
+    os_ << "🐢 ";
+  }
   os_ << PrintNode(graph_labeller_, node) << "\n";
 
   MaglevPrintingVisitorOstream::cast(os_for_additional_info_)
@@ -658,10 +779,18 @@ void MaglevPrintingVisitor::Process(Node* node, const ProcessingState& state) {
 
   MaybePrintLazyDeoptOrExceptionHandler(os_, targets_, node, graph_labeller_,
                                         max_node_id_);
+  return ProcessResult::kContinue;
 }
 
-void MaglevPrintingVisitor::Process(ControlNode* control_node,
-                                    const ProcessingState& state) {
+ProcessResult MaglevPrintingVisitor::Process(ControlNode* control_node,
+                                             const ProcessingState& state) {
+  MaglevGraphLabeller::Provenance provenance =
+      graph_labeller_->GetNodeProvenance(control_node);
+  if (provenance.unit != nullptr) {
+    MaybePrintProvenance(os_, targets_, provenance, existing_provenance_);
+    existing_provenance_ = provenance;
+  }
+
   MaybePrintEagerDeopt(os_, targets_, control_node, graph_labeller_,
                        max_node_id_);
 
@@ -758,10 +887,14 @@ void MaglevPrintingVisitor::Process(ControlNode* control_node,
           case ValueRepresentation::kFloat64:
             os_ << "ᶠ";
             break;
+          case ValueRepresentation::kHoleyFloat64:
+            os_ << "ʰᶠ";
+            break;
           case ValueRepresentation::kWord64:
             UNREACHABLE();
         }
-        os_ << " " << phi->result().operand() << "\n";
+        os_ << " " << phi->owner().ToString() << " " << phi->result().operand()
+            << "\n";
       }
       if (target->state()->register_state().is_initialized()) {
         PrintVerticalArrows(os_, targets_);
@@ -802,6 +935,8 @@ void MaglevPrintingVisitor::Process(ControlNode* control_node,
   // so that it overlaps the fallthrough arrow.
   MaglevPrintingVisitorOstream::cast(os_for_additional_info_)
       ->set_padding(MaxIdWidth(graph_labeller_, max_node_id_, 2));
+
+  return ProcessResult::kContinue;
 }
 
 void PrintGraph(std::ostream& os, MaglevCompilationInfo* compilation_info,
@@ -815,20 +950,12 @@ void PrintNode::Print(std::ostream& os) const {
   node_->Print(os, graph_labeller_, skip_targets_);
 }
 
-std::ostream& operator<<(std::ostream& os, const PrintNode& printer) {
-  printer.Print(os);
-  return os;
-}
-
 void PrintNodeLabel::Print(std::ostream& os) const {
   graph_labeller_->PrintNodeLabel(os, node_);
 }
 
-std::ostream& operator<<(std::ostream& os, const PrintNodeLabel& printer) {
-  printer.Print(os);
-  return os;
-}
-
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
+
+#endif  // V8_ENABLE_MAGLEV_GRAPH_PRINTER
diff --git a/deps/v8/src/maglev/maglev-graph-printer.h b/deps/v8/src/maglev/maglev-graph-printer.h
index 16a6b9a0c5acae..1bcc61cd66cb79 100644
--- a/deps/v8/src/maglev/maglev-graph-printer.h
+++ b/deps/v8/src/maglev/maglev-graph-printer.h
@@ -10,6 +10,9 @@
 #include <set>
 #include <vector>
 
+#include "src/maglev/maglev-compilation-unit.h"
+#include "src/maglev/maglev-graph-labeller.h"
+#include "src/maglev/maglev-graph-processor.h"
 #include "src/maglev/maglev-ir.h"
 
 namespace v8 {
@@ -26,6 +29,8 @@ class NodeBase;
 class Phi;
 class ProcessingState;
 
+#ifdef V8_ENABLE_MAGLEV_GRAPH_PRINTER
+
 class MaglevPrintingVisitor {
  public:
   explicit MaglevPrintingVisitor(MaglevGraphLabeller* graph_labeller,
@@ -34,9 +39,9 @@ class MaglevPrintingVisitor {
   void PreProcessGraph(Graph* graph);
   void PostProcessGraph(Graph* graph) {}
   void PreProcessBasicBlock(BasicBlock* block);
-  void Process(Phi* phi, const ProcessingState& state);
-  void Process(Node* node, const ProcessingState& state);
-  void Process(ControlNode* node, const ProcessingState& state);
+  ProcessResult Process(Phi* phi, const ProcessingState& state);
+  ProcessResult Process(Node* node, const ProcessingState& state);
+  ProcessResult Process(ControlNode* node, const ProcessingState& state);
 
   std::ostream& os() { return *os_for_additional_info_; }
 
@@ -47,6 +52,7 @@ class MaglevPrintingVisitor {
   std::set<BasicBlock*> loop_headers_;
   std::vector<BasicBlock*> targets_;
   NodeIdT max_node_id_ = kInvalidNodeId;
+  MaglevGraphLabeller::Provenance existing_provenance_;
 };
 
 void PrintGraph(std::ostream& os, MaglevCompilationInfo* compilation_info,
@@ -70,8 +76,6 @@ class PrintNode {
   const bool skip_targets_;
 };
 
-std::ostream& operator<<(std::ostream& os, const PrintNode& printer);
-
 class PrintNodeLabel {
  public:
   PrintNodeLabel(MaglevGraphLabeller* graph_labeller, const NodeBase* node)
@@ -84,7 +88,64 @@ class PrintNodeLabel {
   const NodeBase* node_;
 };
 
-std::ostream& operator<<(std::ostream& os, const PrintNodeLabel& printer);
+#else
+
+// Dummy inlined definitions of the printer classes/functions.
+
+class MaglevPrintingVisitor {
+ public:
+  explicit MaglevPrintingVisitor(MaglevGraphLabeller* graph_labeller,
+                                 std::ostream& os)
+      : os_(os) {}
+
+  void PreProcessGraph(Graph* graph) {}
+  void PostProcessGraph(Graph* graph) {}
+  void PreProcessBasicBlock(BasicBlock* block) {}
+  ProcessResult Process(Phi* phi, const ProcessingState& state) {
+    return ProcessResult::kContinue;
+  }
+  ProcessResult Process(Node* node, const ProcessingState& state) {
+    return ProcessResult::kContinue;
+  }
+  ProcessResult Process(ControlNode* node, const ProcessingState& state) {
+    return ProcessResult::kContinue;
+  }
+
+  std::ostream& os() { return os_; }
+
+ private:
+  std::ostream& os_;
+};
+
+inline void PrintGraph(std::ostream& os,
+                       MaglevCompilationInfo* compilation_info,
+                       Graph* const graph) {}
+
+class PrintNode {
+ public:
+  PrintNode(MaglevGraphLabeller* graph_labeller, const NodeBase* node,
+            bool skip_targets = false) {}
+  void Print(std::ostream& os) const {}
+};
+
+class PrintNodeLabel {
+ public:
+  PrintNodeLabel(MaglevGraphLabeller* graph_labeller, const NodeBase* node) {}
+  void Print(std::ostream& os) const {}
+};
+
+#endif  // V8_ENABLE_MAGLEV_GRAPH_PRINTER
+
+inline std::ostream& operator<<(std::ostream& os, const PrintNode& printer) {
+  printer.Print(os);
+  return os;
+}
+
+inline std::ostream& operator<<(std::ostream& os,
+                                const PrintNodeLabel& printer) {
+  printer.Print(os);
+  return os;
+}
 
 }  // namespace maglev
 }  // namespace internal
diff --git a/deps/v8/src/maglev/maglev-graph-processor.h b/deps/v8/src/maglev/maglev-graph-processor.h
index a6d5dfedcc68e8..f5cba6256c0785 100644
--- a/deps/v8/src/maglev/maglev-graph-processor.h
+++ b/deps/v8/src/maglev/maglev-graph-processor.h
@@ -43,6 +43,13 @@ namespace maglev {
 template <typename NodeProcessor, bool visit_identity_nodes = false>
 class GraphProcessor;
 
+enum class ProcessResult {
+  kContinue,  // Process exited normally, and the following processors will be
+              // called on the node.
+  kRemove     // Remove the current node from the graph (and do not call the
+              // following processors).
+};
+
 class ProcessingState {
  public:
   explicit ProcessingState(BlockConstIterator block_it,
@@ -90,6 +97,10 @@ class GraphProcessor {
       node_processor_.Process(constant, GetCurrentState());
       USE(index);
     }
+    for (const auto& [index, constant] : graph->tagged_index()) {
+      node_processor_.Process(constant, GetCurrentState());
+      USE(index);
+    }
     for (const auto& [index, constant] : graph->int32()) {
       node_processor_.Process(constant, GetCurrentState());
       USE(index);
@@ -114,10 +125,15 @@ class GraphProcessor {
         }
       }
 
-      for (node_it_ = block->nodes().begin(); node_it_ != block->nodes().end();
-           ++node_it_) {
+      for (node_it_ = block->nodes().begin();
+           node_it_ != block->nodes().end();) {
         Node* node = *node_it_;
-        ProcessNodeBase(node, GetCurrentState());
+        ProcessResult result = ProcessNodeBase(node, GetCurrentState());
+        if (V8_UNLIKELY(result == ProcessResult::kRemove)) {
+          node_it_ = block->nodes().RemoveAt(node_it_);
+        } else {
+          ++node_it_;
+        }
       }
 
       ProcessNodeBase(block->control_node(), GetCurrentState());
@@ -134,17 +150,17 @@ class GraphProcessor {
     return ProcessingState(block_it_, &node_it_);
   }
 
-  void ProcessNodeBase(NodeBase* node, const ProcessingState& state) {
+  ProcessResult ProcessNodeBase(NodeBase* node, const ProcessingState& state) {
     switch (node->opcode()) {
 #define CASE(OPCODE)                                        \
   case Opcode::k##OPCODE:                                   \
     if constexpr (!visit_identity_nodes &&                  \
                   Opcode::k##OPCODE == Opcode::kIdentity) { \
-      return;                                               \
+      return ProcessResult::kContinue;                      \
     }                                                       \
     PreProcess(node->Cast<OPCODE>(), state);                \
-    node_processor_.Process(node->Cast<OPCODE>(), state);   \
-    break;
+    return node_processor_.Process(node->Cast<OPCODE>(), state);
+
       NODE_BASE_LIST(CASE)
 #undef CASE
     }
@@ -169,7 +185,9 @@ class NodeMultiProcessor<> {
   void PreProcessGraph(Graph* graph) {}
   void PostProcessGraph(Graph* graph) {}
   void PreProcessBasicBlock(BasicBlock* block) {}
-  void Process(NodeBase* node, const ProcessingState& state) {}
+  ProcessResult Process(NodeBase* node, const ProcessingState& state) {
+    return ProcessResult::kContinue;
+  }
 };
 
 template <typename Processor, typename... Processors>
@@ -187,9 +205,12 @@ class NodeMultiProcessor<Processor, Processors...>
       : Base(std::forward<Args>(processors)...) {}
 
   template <typename Node>
-  void Process(Node* node, const ProcessingState& state) {
-    processor_.Process(node, state);
-    Base::Process(node, state);
+  ProcessResult Process(Node* node, const ProcessingState& state) {
+    if (V8_UNLIKELY(processor_.Process(node, state) ==
+                    ProcessResult::kRemove)) {
+      return ProcessResult::kRemove;
+    }
+    return Base::Process(node, state);
   }
   void PreProcessGraph(Graph* graph) {
     processor_.PreProcessGraph(graph);
diff --git a/deps/v8/src/maglev/maglev-graph-verifier.h b/deps/v8/src/maglev/maglev-graph-verifier.h
index 6af5f928c41e48..388f32def9a72f 100644
--- a/deps/v8/src/maglev/maglev-graph-verifier.h
+++ b/deps/v8/src/maglev/maglev-graph-verifier.h
@@ -7,6 +7,7 @@
 
 #include "src/maglev/maglev-compilation-info.h"
 #include "src/maglev/maglev-graph-labeller.h"
+#include "src/maglev/maglev-graph-processor.h"
 #include "src/maglev/maglev-ir.h"
 
 namespace v8 {
@@ -30,8 +31,9 @@ class MaglevGraphVerifier {
   void PreProcessBasicBlock(BasicBlock* block) {}
 
   template <typename NodeT>
-  void Process(NodeT* node, const ProcessingState& state) {
+  ProcessResult Process(NodeT* node, const ProcessingState& state) {
     node->VerifyInputs(graph_labeller_);
+    return ProcessResult::kContinue;
   }
 
  private:
diff --git a/deps/v8/src/maglev/maglev-graph.h b/deps/v8/src/maglev/maglev-graph.h
index 225008224eeb66..e574fbbd865211 100644
--- a/deps/v8/src/maglev/maglev-graph.h
+++ b/deps/v8/src/maglev/maglev-graph.h
@@ -21,20 +21,25 @@ using BlockConstReverseIterator =
 
 class Graph final : public ZoneObject {
  public:
-  static Graph* New(Zone* zone) { return zone->New<Graph>(zone); }
+  static Graph* New(Zone* zone, bool is_osr) {
+    return zone->New<Graph>(zone, is_osr);
+  }
 
   // Shouldn't be used directly; public so that Zone::New can access it.
-  explicit Graph(Zone* zone)
+  Graph(Zone* zone, bool is_osr)
       : blocks_(zone),
         root_(zone),
+        osr_values_(zone),
         smi_(zone),
+        tagged_index_(zone),
         int_(zone),
         float_(zone),
         external_references_(zone),
         parameters_(zone),
         register_inputs_(),
         constants_(zone),
-        inlined_functions_(zone) {}
+        inlined_functions_(zone),
+        is_osr_(is_osr) {}
 
   BasicBlock* operator[](int i) { return blocks_[i]; }
   const BasicBlock* operator[](int i) const { return blocks_[i]; }
@@ -83,7 +88,9 @@ class Graph final : public ZoneObject {
   }
 
   ZoneMap<RootIndex, RootConstant*>& root() { return root_; }
+  ZoneVector<InitialValue*>& osr_values() { return osr_values_; }
   ZoneMap<int, SmiConstant*>& smi() { return smi_; }
+  ZoneMap<int, TaggedIndexConstant*>& tagged_index() { return tagged_index_; }
   ZoneMap<int, Int32Constant*>& int32() { return int_; }
   ZoneMap<uint64_t, Float64Constant*>& float64() { return float_; }
   ZoneMap<Address, ExternalConstant*>& external_references() {
@@ -101,6 +108,15 @@ class Graph final : public ZoneObject {
   bool has_recursive_calls() const { return has_recursive_calls_; }
   void set_has_recursive_calls(bool value) { has_recursive_calls_ = value; }
 
+  bool is_osr() const { return is_osr_; }
+  uint32_t min_maglev_stackslots_for_unoptimized_frame_size() {
+    DCHECK(is_osr());
+    if (osr_values().size() == 0) {
+      return InitialValue::stack_slot(0);
+    }
+    return osr_values().back()->stack_slot() + 1;
+  }
+
  private:
   uint32_t tagged_stack_slots_ = kMaxUInt32;
   uint32_t untagged_stack_slots_ = kMaxUInt32;
@@ -108,7 +124,9 @@ class Graph final : public ZoneObject {
   uint32_t max_deopted_stack_size_ = kMaxUInt32;
   ZoneVector<BasicBlock*> blocks_;
   ZoneMap<RootIndex, RootConstant*> root_;
+  ZoneVector<InitialValue*> osr_values_;
   ZoneMap<int, SmiConstant*> smi_;
+  ZoneMap<int, TaggedIndexConstant*> tagged_index_;
   ZoneMap<int, Int32Constant*> int_;
   // Use the bits of the float as the key.
   ZoneMap<uint64_t, Float64Constant*> float_;
@@ -120,6 +138,7 @@ class Graph final : public ZoneObject {
       inlined_functions_;
   bool has_recursive_calls_ = false;
   int total_inlined_bytecode_size_ = 0;
+  bool is_osr_ = false;
 };
 
 }  // namespace maglev
diff --git a/deps/v8/src/maglev/maglev-interpreter-frame-state.cc b/deps/v8/src/maglev/maglev-interpreter-frame-state.cc
index 83031a3f21ec3a..f43286bc1e4b82 100644
--- a/deps/v8/src/maglev/maglev-interpreter-frame-state.cc
+++ b/deps/v8/src/maglev/maglev-interpreter-frame-state.cc
@@ -4,41 +4,43 @@
 
 #include "src/maglev/maglev-interpreter-frame-state.h"
 
+#include "src/handles/handles-inl.h"
+#include "src/interpreter/bytecode-register.h"
 #include "src/maglev/maglev-basic-block.h"
 #include "src/maglev/maglev-compilation-info.h"
+#include "src/maglev/maglev-compilation-unit.h"
+#include "src/maglev/maglev-graph-builder.h"
+#include "src/maglev/maglev-graph-printer.h"
 #include "src/maglev/maglev-graph.h"
+#include "src/objects/function-kind.h"
 
 namespace v8 {
 namespace internal {
 namespace maglev {
 
 void KnownNodeAspects::Merge(const KnownNodeAspects& other, Zone* zone) {
+  bool any_merged_map_is_unstable = false;
   DestructivelyIntersect(node_infos, other.node_infos,
-                         [](NodeInfo& lhs, const NodeInfo& rhs) {
-                           lhs.MergeWith(rhs);
-                           return !lhs.is_empty();
+                         [&](NodeInfo& lhs, const NodeInfo& rhs) {
+                           lhs.MergeWith(rhs, zone, any_merged_map_is_unstable);
+                           return !lhs.no_info_available();
                          });
-  DestructivelyIntersect(
-      stable_maps, other.stable_maps,
-      [zone](ZoneHandleSet<Map>& lhs, const ZoneHandleSet<Map>& rhs) {
-        for (Handle<Map> map : rhs) {
-          lhs.insert(map, zone);
-        }
-        // We should always add the value even if the set is empty.
-        return true;
-      });
-  DestructivelyIntersect(
-      unstable_maps, other.unstable_maps,
-      [zone](ZoneHandleSet<Map>& lhs, const ZoneHandleSet<Map>& rhs) {
-        for (Handle<Map> map : rhs) {
-          lhs.insert(map, zone);
-        }
-        // We should always add the value even if the set is empty.
-        return true;
-      });
+
+  this->any_map_for_any_node_is_unstable = any_merged_map_is_unstable;
+
+  auto merge_loaded_properties =
+      [](ZoneMap<ValueNode*, ValueNode*>& lhs,
+         const ZoneMap<ValueNode*, ValueNode*>& rhs) {
+        // Loaded properties are maps of maps, so just do the destructive
+        // intersection recursively.
+        DestructivelyIntersect(lhs, rhs);
+        return !lhs.empty();
+      };
   DestructivelyIntersect(loaded_constant_properties,
-                         other.loaded_constant_properties);
-  DestructivelyIntersect(loaded_properties, other.loaded_properties);
+                         other.loaded_constant_properties,
+                         merge_loaded_properties);
+  DestructivelyIntersect(loaded_properties, other.loaded_properties,
+                         merge_loaded_properties);
   DestructivelyIntersect(loaded_context_constants,
                          other.loaded_context_constants);
   DestructivelyIntersect(loaded_context_slots, other.loaded_context_slots);
@@ -52,7 +54,7 @@ MergePointInterpreterFrameState* MergePointInterpreterFrameState::New(
   MergePointInterpreterFrameState* merge_state =
       info.zone()->New<MergePointInterpreterFrameState>(
           info, merge_offset, predecessor_count, 1,
-          info.zone()->NewArray<BasicBlock*>(predecessor_count),
+          info.zone()->AllocateArray<BasicBlock*>(predecessor_count),
           BasicBlockType::kDefault, liveness);
   int i = 0;
   merge_state->frame_state_.ForEachValue(
@@ -78,16 +80,19 @@ MergePointInterpreterFrameState* MergePointInterpreterFrameState::NewForLoop(
     const InterpreterFrameState& start_state, const MaglevCompilationUnit& info,
     int merge_offset, int predecessor_count,
     const compiler::BytecodeLivenessState* liveness,
-    const compiler::LoopInfo* loop_info) {
+    const compiler::LoopInfo* loop_info, bool has_been_peeled) {
   MergePointInterpreterFrameState* state =
       info.zone()->New<MergePointInterpreterFrameState>(
           info, merge_offset, predecessor_count, 0,
-          info.zone()->NewArray<BasicBlock*>(predecessor_count),
+          info.zone()->AllocateArray<BasicBlock*>(predecessor_count),
           BasicBlockType::kLoopHeader, liveness);
+  state->bitfield_ =
+      kIsLoopWithPeeledIterationBit::update(state->bitfield_, has_been_peeled);
+  state->loop_info_ = loop_info;
   if (loop_info->resumable()) {
     state->known_node_aspects_ =
         info.zone()->New<KnownNodeAspects>(info.zone());
-    state->is_resumable_loop_ = true;
+    state->bitfield_ = kIsResumableLoopBit::update(state->bitfield_, true);
   }
   auto& assignments = loop_info->assignments();
   auto& frame_state = state->frame_state_;
@@ -107,7 +112,7 @@ MergePointInterpreterFrameState* MergePointInterpreterFrameState::NewForLoop(
         ++i;
       });
   frame_state.context(info) = nullptr;
-  if (state->is_resumable_loop_) {
+  if (state->is_resumable_loop()) {
     // While contexts are always the same at specific locations, resumable loops
     // do have different nodes to set the context across resume points. Create a
     // phi for them.
@@ -130,7 +135,7 @@ MergePointInterpreterFrameState*
 MergePointInterpreterFrameState::NewForCatchBlock(
     const MaglevCompilationUnit& unit,
     const compiler::BytecodeLivenessState* liveness, int handler_offset,
-    interpreter::Register context_register, Graph* graph, bool is_inline) {
+    interpreter::Register context_register, Graph* graph) {
   Zone* const zone = unit.zone();
   MergePointInterpreterFrameState* state =
       zone->New<MergePointInterpreterFrameState>(
@@ -145,16 +150,10 @@ MergePointInterpreterFrameState::NewForCatchBlock(
     frame_state.accumulator(unit) = state->NewExceptionPhi(
         zone, interpreter::Register::virtual_accumulator());
   }
-  frame_state.ForEachParameter(
-      unit, [&](ValueNode*& entry, interpreter::Register reg) {
-        entry = state->NewExceptionPhi(zone, reg);
-      });
-  frame_state.context(unit) = state->NewExceptionPhi(zone, context_register);
-  frame_state.ForEachLocal(unit,
-                           [&](ValueNode*& entry, interpreter::Register reg) {
-                             entry = state->NewExceptionPhi(zone, reg);
-                           });
-  state->known_node_aspects_ = zone->New<KnownNodeAspects>(zone);
+  frame_state.ForEachRegister(
+      unit,
+      [&](ValueNode*& entry, interpreter::Register reg) { entry = nullptr; });
+  state->catch_block_context_register_ = context_register;
   return state;
 }
 
@@ -165,16 +164,75 @@ MergePointInterpreterFrameState::MergePointInterpreterFrameState(
     : merge_offset_(merge_offset),
       predecessor_count_(predecessor_count),
       predecessors_so_far_(predecessors_so_far),
+      bitfield_(kBasicBlockTypeBits::encode(type)),
       predecessors_(predecessors),
-      basic_block_type_(type),
       frame_state_(info, liveness),
       per_predecessor_alternatives_(
-          info.zone()->NewArray<Alternatives::List>(frame_state_.size(info))) {}
+          type == BasicBlockType::kExceptionHandlerStart
+              ? nullptr
+              : info.zone()->AllocateArray<Alternatives::List>(
+                    frame_state_.size(info))) {}
+
+namespace {
+void PrintBeforeMerge(const MaglevCompilationUnit& compilation_unit,
+                      ValueNode* current_value, ValueNode* unmerged_value,
+                      interpreter::Register reg, KnownNodeAspects* kna) {
+  if (!v8_flags.trace_maglev_graph_building) return;
+  std::cout << "  " << reg.ToString() << ": "
+            << PrintNodeLabel(compilation_unit.graph_labeller(), current_value)
+            << "<";
+  if (kna) {
+    if (auto cur_info = kna->TryGetInfoFor(current_value)) {
+      std::cout << cur_info->type();
+      if (cur_info->possible_maps_are_known()) {
+        std::cout << " " << cur_info->possible_maps().size();
+      }
+    }
+  }
+  std::cout << "> <- "
+            << PrintNodeLabel(compilation_unit.graph_labeller(), unmerged_value)
+            << "<";
+  if (kna) {
+    if (auto in_info = kna->TryGetInfoFor(unmerged_value)) {
+      std::cout << in_info->type();
+      if (in_info->possible_maps_are_known()) {
+        std::cout << " " << in_info->possible_maps().size();
+      }
+    }
+  }
+  std::cout << ">";
+}
+void PrintAfterMerge(const MaglevCompilationUnit& compilation_unit,
+                     ValueNode* merged_value, KnownNodeAspects* kna) {
+  if (!v8_flags.trace_maglev_graph_building) return;
+  std::cout << " => "
+            << PrintNodeLabel(compilation_unit.graph_labeller(), merged_value)
+            << ": "
+            << PrintNode(compilation_unit.graph_labeller(), merged_value)
+            << "<";
+
+  if (kna) {
+    if (auto out_info = kna->TryGetInfoFor(merged_value)) {
+      std::cout << out_info->type();
+      if (out_info->possible_maps_are_known()) {
+        std::cout << " " << out_info->possible_maps().size();
+      }
+    }
+  }
+
+  std::cout << ">" << std::endl;
+}
+}  // namespace
+
+void MergePointInterpreterFrameState::Merge(MaglevGraphBuilder* builder,
+                                            InterpreterFrameState& unmerged,
+                                            BasicBlock* predecessor) {
+  Merge(builder, *builder->compilation_unit(), unmerged, predecessor);
+}
 
 void MergePointInterpreterFrameState::Merge(
-    MaglevCompilationUnit& compilation_unit,
-    ZoneMap<int, SmiConstant*>& smi_constants, InterpreterFrameState& unmerged,
-    BasicBlock* predecessor) {
+    MaglevGraphBuilder* builder, MaglevCompilationUnit& compilation_unit,
+    InterpreterFrameState& unmerged, BasicBlock* predecessor) {
   DCHECK_GT(predecessor_count_, 1);
   DCHECK_LT(predecessors_so_far_, predecessor_count_);
   predecessors_[predecessors_so_far_] = predecessor;
@@ -185,33 +243,21 @@ void MergePointInterpreterFrameState::Merge(
   int i = 0;
   frame_state_.ForEachValue(compilation_unit, [&](ValueNode*& value,
                                                   interpreter::Register reg) {
-    if (v8_flags.trace_maglev_graph_building) {
-      std::cout << "  " << reg.ToString() << ": "
-                << PrintNodeLabel(compilation_unit.graph_labeller(), value)
-                << " <- "
-                << PrintNodeLabel(compilation_unit.graph_labeller(),
-                                  unmerged.get(reg));
-    }
-    value = MergeValue(compilation_unit, smi_constants, reg,
-                       *unmerged.known_node_aspects(), value, unmerged.get(reg),
-                       per_predecessor_alternatives_[i]);
-    if (v8_flags.trace_maglev_graph_building) {
-      std::cout << " => "
-                << PrintNodeLabel(compilation_unit.graph_labeller(), value)
-                << ": " << PrintNode(compilation_unit.graph_labeller(), value)
-                << std::endl;
-    }
+    PrintBeforeMerge(compilation_unit, value, unmerged.get(reg), reg,
+                     known_node_aspects_);
+    value = MergeValue(builder, reg, *unmerged.known_node_aspects(), value,
+                       unmerged.get(reg), &per_predecessor_alternatives_[i]);
+    PrintAfterMerge(compilation_unit, value, known_node_aspects_);
     ++i;
   });
 
   if (known_node_aspects_ == nullptr) {
     DCHECK(is_unmerged_loop());
     DCHECK_EQ(predecessors_so_far_, 0);
-    known_node_aspects_ = unmerged.known_node_aspects()->CloneForLoopHeader(
-        compilation_unit.zone());
+    known_node_aspects_ =
+        unmerged.known_node_aspects()->CloneForLoopHeader(builder->zone());
   } else {
-    known_node_aspects_->Merge(*unmerged.known_node_aspects(),
-                               compilation_unit.zone());
+    known_node_aspects_->Merge(*unmerged.known_node_aspects(), builder->zone());
   }
 
   predecessors_so_far_++;
@@ -219,63 +265,107 @@ void MergePointInterpreterFrameState::Merge(
 }
 
 void MergePointInterpreterFrameState::MergeLoop(
-    MaglevCompilationUnit& compilation_unit,
-    ZoneMap<int, SmiConstant*>& smi_constants,
+    MaglevGraphBuilder* builder, InterpreterFrameState& loop_end_state,
+    BasicBlock* loop_end_block) {
+  MergeLoop(builder, *builder->compilation_unit(), loop_end_state,
+            loop_end_block);
+}
+
+void MergePointInterpreterFrameState::MergeLoop(
+    MaglevGraphBuilder* builder, MaglevCompilationUnit& compilation_unit,
     InterpreterFrameState& loop_end_state, BasicBlock* loop_end_block) {
   // This should be the last predecessor we try to merge.
   DCHECK_EQ(predecessors_so_far_, predecessor_count_ - 1);
   DCHECK(is_unmerged_loop());
   predecessors_[predecessor_count_ - 1] = loop_end_block;
 
+  backedge_deopt_frame_ =
+      builder->zone()->New<DeoptFrame>(builder->GetLatestCheckpointedFrame());
+
   if (v8_flags.trace_maglev_graph_building) {
     std::cout << "Merging loop backedge..." << std::endl;
   }
-  frame_state_.ForEachValue(compilation_unit, [&](ValueNode* value,
-                                                  interpreter::Register reg) {
-    if (v8_flags.trace_maglev_graph_building) {
-      std::cout << "  " << reg.ToString() << ": "
-                << PrintNodeLabel(compilation_unit.graph_labeller(), value)
-                << " <- "
-                << PrintNodeLabel(compilation_unit.graph_labeller(),
-                                  loop_end_state.get(reg));
-    }
-    MergeLoopValue(compilation_unit, smi_constants, reg,
-                   *loop_end_state.known_node_aspects(), value,
-                   loop_end_state.get(reg));
-    if (v8_flags.trace_maglev_graph_building) {
-      std::cout << " => "
-                << PrintNodeLabel(compilation_unit.graph_labeller(), value)
-                << ": " << PrintNode(compilation_unit.graph_labeller(), value)
-                << std::endl;
-    }
-  });
+  frame_state_.ForEachValue(
+      compilation_unit, [&](ValueNode* value, interpreter::Register reg) {
+        PrintBeforeMerge(compilation_unit, value, loop_end_state.get(reg), reg,
+                         known_node_aspects_);
+        MergeLoopValue(builder, reg, *loop_end_state.known_node_aspects(),
+                       value, loop_end_state.get(reg));
+        PrintAfterMerge(compilation_unit, value, known_node_aspects_);
+      });
   predecessors_so_far_++;
   DCHECK_EQ(predecessors_so_far_, predecessor_count_);
 }
 
-namespace {
+void MergePointInterpreterFrameState::MergeThrow(
+    MaglevGraphBuilder* builder, const MaglevCompilationUnit* handler_unit,
+    InterpreterFrameState& unmerged) {
+  // We don't count total predecessors on exception handlers, but we do want to
+  // special case the first predecessor so we do count predecessors_so_far
+  DCHECK_EQ(predecessor_count_, 0);
+  DCHECK(is_exception_handler());
+
+  // Find the graph builder that contains the actual handler, so that we merge
+  // in the right function's interpreter frame state.
+  const MaglevGraphBuilder* handler_builder = builder;
+  while (handler_builder->compilation_unit() != handler_unit) {
+    handler_builder = handler_builder->parent();
+  }
+  const InterpreterFrameState& handler_builder_frame =
+      handler_builder->current_interpreter_frame();
 
-// TODO(victorgomes): Consider refactor this function to share code with
-// MaglevGraphBuilder::GetSmiConstant.
-SmiConstant* GetSmiConstant(MaglevCompilationUnit& compilation_unit,
-                            ZoneMap<int, SmiConstant*>& smi_constants,
-                            int constant) {
-  DCHECK(Smi::IsValid(constant));
-  auto it = smi_constants.find(constant);
-  if (it == smi_constants.end()) {
-    SmiConstant* node = Node::New<SmiConstant>(compilation_unit.zone(), 0,
-                                               Smi::FromInt(constant));
-    compilation_unit.RegisterNodeInGraphLabeller(node);
-    smi_constants.emplace(constant, node);
-    return node;
+  if (v8_flags.trace_maglev_graph_building) {
+    if (handler_builder == builder) {
+      std::cout << "Merging into exception handler..." << std::endl;
+    } else {
+      std::cout << "Merging into parent exception handler..." << std::endl;
+    }
   }
-  return it->second;
+
+  frame_state_.ForEachParameter(*handler_unit, [&](ValueNode*& value,
+                                                   interpreter::Register reg) {
+    PrintBeforeMerge(*handler_unit, value, handler_builder_frame.get(reg), reg,
+                     known_node_aspects_);
+    value = MergeValue(builder, reg, *unmerged.known_node_aspects(), value,
+                       handler_builder_frame.get(reg), nullptr);
+    PrintAfterMerge(*handler_unit, value, known_node_aspects_);
+  });
+  frame_state_.ForEachLocal(*handler_unit, [&](ValueNode*& value,
+                                               interpreter::Register reg) {
+    PrintBeforeMerge(*handler_unit, value, handler_builder_frame.get(reg), reg,
+                     known_node_aspects_);
+    value = MergeValue(builder, reg, *unmerged.known_node_aspects(), value,
+                       handler_builder_frame.get(reg), nullptr);
+    PrintAfterMerge(*handler_unit, value, known_node_aspects_);
+  });
+
+  // Pick out the context value from the incoming registers.
+  // TODO(leszeks): This should be the same for all incoming states, but we lose
+  // the identity for generator-restored context. If generator value restores
+  // were handled differently, we could avoid emitting a Phi here.
+  ValueNode*& context = frame_state_.context(*handler_unit);
+  PrintBeforeMerge(*handler_unit, context,
+                   handler_builder_frame.get(catch_block_context_register_),
+                   catch_block_context_register_, known_node_aspects_);
+  context = MergeValue(builder, catch_block_context_register_,
+                       *unmerged.known_node_aspects(), context,
+                       handler_builder_frame.get(catch_block_context_register_),
+                       nullptr);
+  PrintAfterMerge(*handler_unit, context, known_node_aspects_);
+
+  if (known_node_aspects_ == nullptr) {
+    DCHECK_EQ(predecessors_so_far_, 0);
+    known_node_aspects_ = unmerged.known_node_aspects()->Clone(builder->zone());
+  } else {
+    known_node_aspects_->Merge(*unmerged.known_node_aspects(), builder->zone());
+  }
+  predecessors_so_far_++;
 }
 
-ValueNode* FromInt32ToTagged(MaglevCompilationUnit& compilation_unit,
-                             ZoneMap<int, SmiConstant*>& smi_constants,
-                             NodeType node_type, ValueNode* value,
-                             BasicBlock* predecessor) {
+namespace {
+
+ValueNode* FromInt32ToTagged(MaglevGraphBuilder* builder, NodeType node_type,
+                             ValueNode* value, BasicBlock* predecessor) {
   DCHECK_EQ(value->properties().value_representation(),
             ValueRepresentation::kInt32);
   DCHECK(!value->properties().is_conversion());
@@ -283,81 +373,88 @@ ValueNode* FromInt32ToTagged(MaglevCompilationUnit& compilation_unit,
   ValueNode* tagged;
   if (value->Is<Int32Constant>()) {
     int32_t constant = value->Cast<Int32Constant>()->value();
-    return GetSmiConstant(compilation_unit, smi_constants, constant);
+    return builder->GetSmiConstant(constant);
   } else if (value->Is<StringLength>() ||
              value->Is<BuiltinStringPrototypeCharCodeOrCodePointAt>()) {
     static_assert(String::kMaxLength <= kSmiMaxValue,
                   "String length must fit into a Smi");
-    tagged = Node::New<UnsafeSmiTag>(compilation_unit.zone(), {value});
+    tagged = Node::New<UnsafeSmiTag>(builder->zone(), {value});
   } else if (NodeTypeIsSmi(node_type)) {
     // For known Smis, we can tag without a check.
-    tagged = Node::New<UnsafeSmiTag>(compilation_unit.zone(), {value});
+    tagged = Node::New<UnsafeSmiTag>(builder->zone(), {value});
   } else {
-    tagged = Node::New<Int32ToNumber>(compilation_unit.zone(), {value});
+    tagged = Node::New<Int32ToNumber>(builder->zone(), {value});
   }
 
   predecessor->nodes().Add(tagged);
-  compilation_unit.RegisterNodeInGraphLabeller(tagged);
+  builder->compilation_unit()->RegisterNodeInGraphLabeller(tagged);
   return tagged;
 }
 
-ValueNode* FromUint32ToTagged(MaglevCompilationUnit& compilation_unit,
-                              ZoneMap<int, SmiConstant*>& smi_constants,
-                              NodeType node_type, ValueNode* value,
-                              BasicBlock* predecessor) {
+ValueNode* FromUint32ToTagged(MaglevGraphBuilder* builder, NodeType node_type,
+                              ValueNode* value, BasicBlock* predecessor) {
   DCHECK_EQ(value->properties().value_representation(),
             ValueRepresentation::kUint32);
   DCHECK(!value->properties().is_conversion());
 
   ValueNode* tagged;
   if (NodeTypeIsSmi(node_type)) {
-    tagged = Node::New<UnsafeSmiTag>(compilation_unit.zone(), {value});
+    tagged = Node::New<UnsafeSmiTag>(builder->zone(), {value});
   } else {
-    tagged = Node::New<Uint32ToNumber>(compilation_unit.zone(), {value});
+    tagged = Node::New<Uint32ToNumber>(builder->zone(), {value});
   }
 
   predecessor->nodes().Add(tagged);
-  compilation_unit.RegisterNodeInGraphLabeller(tagged);
+  builder->compilation_unit()->RegisterNodeInGraphLabeller(tagged);
   return tagged;
 }
 
-ValueNode* FromFloat64ToTagged(MaglevCompilationUnit& compilation_unit,
-                               NodeType node_type, ValueNode* value,
-                               BasicBlock* predecessor) {
+ValueNode* FromFloat64ToTagged(MaglevGraphBuilder* builder, NodeType node_type,
+                               ValueNode* value, BasicBlock* predecessor) {
   DCHECK_EQ(value->properties().value_representation(),
             ValueRepresentation::kFloat64);
   DCHECK(!value->properties().is_conversion());
 
   // Create a tagged version, and insert it at the end of the predecessor.
-  ValueNode* tagged =
-      Node::New<Float64ToTagged>(compilation_unit.zone(), {value});
+  ValueNode* tagged = Node::New<Float64ToTagged>(builder->zone(), {value});
 
   predecessor->nodes().Add(tagged);
-  compilation_unit.RegisterNodeInGraphLabeller(tagged);
+  builder->compilation_unit()->RegisterNodeInGraphLabeller(tagged);
   return tagged;
 }
 
-ValueNode* NonTaggedToTagged(MaglevCompilationUnit& compilation_unit,
-                             ZoneMap<int, SmiConstant*>& smi_constants,
-                             NodeType node_type, ValueNode* value,
-                             BasicBlock* predecessor) {
+ValueNode* FromHoleyFloat64ToTagged(MaglevGraphBuilder* builder,
+                                    NodeType node_type, ValueNode* value,
+                                    BasicBlock* predecessor) {
+  DCHECK_EQ(value->properties().value_representation(),
+            ValueRepresentation::kHoleyFloat64);
+  DCHECK(!value->properties().is_conversion());
+
+  // Create a tagged version, and insert it at the end of the predecessor.
+  ValueNode* tagged = Node::New<HoleyFloat64ToTagged>(builder->zone(), {value});
+
+  predecessor->nodes().Add(tagged);
+  builder->compilation_unit()->RegisterNodeInGraphLabeller(tagged);
+  return tagged;
+}
+
+ValueNode* NonTaggedToTagged(MaglevGraphBuilder* builder, NodeType node_type,
+                             ValueNode* value, BasicBlock* predecessor) {
   switch (value->properties().value_representation()) {
     case ValueRepresentation::kWord64:
     case ValueRepresentation::kTagged:
       UNREACHABLE();
     case ValueRepresentation::kInt32:
-      return FromInt32ToTagged(compilation_unit, smi_constants, node_type,
-                               value, predecessor);
+      return FromInt32ToTagged(builder, node_type, value, predecessor);
     case ValueRepresentation::kUint32:
-      return FromUint32ToTagged(compilation_unit, smi_constants, node_type,
-                                value, predecessor);
+      return FromUint32ToTagged(builder, node_type, value, predecessor);
     case ValueRepresentation::kFloat64:
-      return FromFloat64ToTagged(compilation_unit, node_type, value,
-                                 predecessor);
+      return FromFloat64ToTagged(builder, node_type, value, predecessor);
+    case ValueRepresentation::kHoleyFloat64:
+      return FromHoleyFloat64ToTagged(builder, node_type, value, predecessor);
   }
 }
-ValueNode* EnsureTagged(MaglevCompilationUnit& compilation_unit,
-                        ZoneMap<int, SmiConstant*>& smi_constants,
+ValueNode* EnsureTagged(MaglevGraphBuilder* builder,
                         const KnownNodeAspects& known_node_aspects,
                         ValueNode* value, BasicBlock* predecessor) {
   if (value->properties().value_representation() ==
@@ -368,31 +465,54 @@ ValueNode* EnsureTagged(MaglevCompilationUnit& compilation_unit,
   auto info_it = known_node_aspects.FindInfo(value);
   const NodeInfo* info =
       known_node_aspects.IsValid(info_it) ? &info_it->second : nullptr;
-  if (info && info->tagged_alternative) {
-    return info->tagged_alternative;
+  if (info) {
+    if (auto alt = info->alternative().tagged()) {
+      return alt;
+    }
   }
-  return NonTaggedToTagged(compilation_unit, smi_constants,
-                           info ? info->type : NodeType::kUnknown, value,
-                           predecessor);
+  return NonTaggedToTagged(builder, info ? info->type() : NodeType::kUnknown,
+                           value, predecessor);
+}
+
+NodeType GetNodeType(compiler::JSHeapBroker* broker, LocalIsolate* isolate,
+                     const KnownNodeAspects& aspects, ValueNode* node) {
+  // We first check the KnownNodeAspects in order to return the most precise
+  // type possible.
+  NodeType type = aspects.NodeTypeFor(node);
+  if (type != NodeType::kUnknown) {
+    return type;
+  }
+  // If this node has no NodeInfo (or not known type in its NodeInfo), we fall
+  // back to its static type.
+  return StaticTypeForNode(broker, isolate, node);
 }
 
 }  // namespace
 
+NodeType MergePointInterpreterFrameState::AlternativeType(
+    const Alternatives* alt) {
+  if (!alt) return NodeType::kUnknown;
+  return alt->node_type();
+}
+
 ValueNode* MergePointInterpreterFrameState::MergeValue(
-    MaglevCompilationUnit& compilation_unit,
-    ZoneMap<int, SmiConstant*>& smi_constants, interpreter::Register owner,
+    MaglevGraphBuilder* builder, interpreter::Register owner,
     const KnownNodeAspects& unmerged_aspects, ValueNode* merged,
-    ValueNode* unmerged, Alternatives::List& per_predecessor_alternatives) {
+    ValueNode* unmerged, Alternatives::List* per_predecessor_alternatives) {
   // If the merged node is null, this is a pre-created loop header merge
   // frame will null values for anything that isn't a loop Phi.
   if (merged == nullptr) {
-    DCHECK(is_unmerged_loop());
+    DCHECK(is_exception_handler() || is_unmerged_loop());
     DCHECK_EQ(predecessors_so_far_, 0);
     // Initialise the alternatives list and cache the alternative
     // representations of the node.
-    new (&per_predecessor_alternatives) Alternatives::List();
-    per_predecessor_alternatives.Add(compilation_unit.zone()->New<Alternatives>(
-        unmerged_aspects.TryGetInfoFor(unmerged)));
+    if (per_predecessor_alternatives) {
+      new (per_predecessor_alternatives) Alternatives::List();
+      per_predecessor_alternatives->Add(builder->zone()->New<Alternatives>(
+          unmerged_aspects.TryGetInfoFor(unmerged)));
+    } else {
+      DCHECK(is_exception_handler());
+    }
     return unmerged;
   }
 
@@ -401,21 +521,58 @@ ValueNode* MergePointInterpreterFrameState::MergeValue(
     // It's possible that merged == unmerged at this point since loop-phis are
     // not dropped if they are only assigned to themselves in the loop.
     DCHECK_EQ(result->owner(), owner);
-    unmerged = EnsureTagged(compilation_unit, smi_constants, unmerged_aspects,
-                            unmerged, predecessors_[predecessors_so_far_]);
+    // Don't set inputs on exception phis.
+    DCHECK_EQ(result->is_exception_phi(), is_exception_handler());
+    if (is_exception_handler()) {
+      return result;
+    }
+    NodeType unmerged_type =
+        GetNodeType(builder->broker(), builder->local_isolate(),
+                    unmerged_aspects, unmerged);
+    unmerged = EnsureTagged(builder, unmerged_aspects, unmerged,
+                            predecessors_[predecessors_so_far_]);
     result->set_input(predecessors_so_far_, unmerged);
+
+    if (predecessors_so_far_ == 0) {
+      DCHECK(result->is_loop_phi());
+      // For loop Phis, `type` is always Unknown until the backedge has been
+      // bound, so there is no point in updating it here.
+      result->set_post_loop_type(unmerged_type);
+    } else {
+      result->merge_type(unmerged_type);
+      result->merge_post_loop_type(unmerged_type);
+    }
+
     return result;
   }
 
   if (merged == unmerged) {
     // Cache the alternative representations of the unmerged node.
-    DCHECK_EQ(per_predecessor_alternatives.LengthForTest(),
-              predecessors_so_far_);
-    per_predecessor_alternatives.Add(compilation_unit.zone()->New<Alternatives>(
-        unmerged_aspects.TryGetInfoFor(unmerged)));
+    if (per_predecessor_alternatives) {
+      DCHECK_EQ(per_predecessor_alternatives->LengthForTest(),
+                predecessors_so_far_);
+      per_predecessor_alternatives->Add(builder->zone()->New<Alternatives>(
+          unmerged_aspects.TryGetInfoFor(unmerged)));
+    } else {
+      DCHECK(is_exception_handler());
+    }
     return merged;
   }
 
+  // We should always statically know what the context is, so we should never
+  // create Phis for it. The exception is resumable functions and OSR, where the
+  // context should be statically known but we lose that static information
+  // across the resume / OSR entry.
+  DCHECK_IMPLIES(
+      owner == interpreter::Register::current_context() ||
+          (is_exception_handler() && owner == catch_block_context_register()),
+      IsResumableFunction(builder->compilation_unit()
+                              ->info()
+                              ->toplevel_compilation_unit()
+                              ->shared_function_info()
+                              .kind()) ||
+          builder->compilation_unit()->info()->toplevel_is_osr());
+
   // Up to this point all predecessors had the same value for this interpreter
   // frame slot. Now that we find a distinct value, insert a copy of the first
   // value for each predecessor seen so far, in addition to the new value.
@@ -424,47 +581,59 @@ ValueNode* MergePointInterpreterFrameState::MergeValue(
   // the frame slot. In that case we only need the inputs for representation
   // selection, and hence could remove duplicate inputs. We'd likely need to
   // attach the interpreter register to the phi in that case?
-  result =
-      Node::New<Phi>(compilation_unit.zone(), predecessor_count_, this, owner);
+
+  // For exception phis, just allocate exception handlers.
+  if (is_exception_handler()) {
+    return NewExceptionPhi(builder->zone(), owner);
+  }
+
+  result = Node::New<Phi>(builder->zone(), predecessor_count_, this, owner);
   if (v8_flags.trace_maglev_graph_building) {
     for (int i = 0; i < predecessor_count_; i++) {
       result->set_input(i, nullptr);
     }
   }
 
-  if (merged->properties().value_representation() ==
-      ValueRepresentation::kTagged) {
-    for (int i = 0; i < predecessors_so_far_; i++) {
-      result->set_input(i, merged);
-    }
-  } else {
-    // If the existing merged value is untagged, we look through the
-    // per-predecessor alternative representations, and try to find tagged
-    // representations there.
-    int i = 0;
-    for (const Alternatives* alt : per_predecessor_alternatives) {
-      // TODO(victorgomes): Support Phi nodes of untagged values.
-      ValueNode* tagged = alt->tagged_alternative();
-      if (tagged == nullptr) {
-        tagged = NonTaggedToTagged(compilation_unit, smi_constants,
-                                   alt->node_type(), merged, predecessors_[i]);
-      }
-      result->set_input(i, tagged);
-      i++;
+  NodeType merged_type =
+      StaticTypeForNode(builder->broker(), builder->local_isolate(), merged);
+
+  bool is_tagged = merged->properties().value_representation() ==
+                   ValueRepresentation::kTagged;
+  NodeType type = merged_type != NodeType::kUnknown
+                      ? merged_type
+                      : AlternativeType(per_predecessor_alternatives->first());
+  int i = 0;
+  for (const Alternatives* alt : *per_predecessor_alternatives) {
+    ValueNode* tagged = is_tagged ? merged : alt->tagged_alternative();
+    if (tagged == nullptr) {
+      DCHECK_NOT_NULL(alt);
+      tagged = NonTaggedToTagged(builder, alt->node_type(), merged,
+                                 predecessors_[i]);
     }
-    DCHECK_EQ(i, predecessors_so_far_);
+    result->set_input(i, tagged);
+    type = IntersectType(type, merged_type != NodeType::kUnknown
+                                   ? merged_type
+                                   : AlternativeType(alt));
+    i++;
   }
-
-  unmerged = EnsureTagged(compilation_unit, smi_constants, unmerged_aspects,
-                          unmerged, predecessors_[predecessors_so_far_]);
+  DCHECK_EQ(i, predecessors_so_far_);
+
+  // Note: it's better to call GetNodeType on {unmerged} before updating it with
+  // EnsureTagged, since untagged nodes have a higher chance of having a
+  // StaticType.
+  NodeType unmerged_type = GetNodeType(
+      builder->broker(), builder->local_isolate(), unmerged_aspects, unmerged);
+  unmerged = EnsureTagged(builder, unmerged_aspects, unmerged,
+                          predecessors_[predecessors_so_far_]);
   result->set_input(predecessors_so_far_, unmerged);
 
+  result->set_type(IntersectType(type, unmerged_type));
+
   phis_.Add(result);
   return result;
 }
 void MergePointInterpreterFrameState::MergeLoopValue(
-    MaglevCompilationUnit& compilation_unit,
-    ZoneMap<int, SmiConstant*>& smi_constants, interpreter::Register owner,
+    MaglevGraphBuilder* builder, interpreter::Register owner,
     KnownNodeAspects& unmerged_aspects, ValueNode* merged,
     ValueNode* unmerged) {
   Phi* result = merged->TryCast<Phi>();
@@ -473,9 +642,23 @@ void MergePointInterpreterFrameState::MergeLoopValue(
     return;
   }
   DCHECK_EQ(result->owner(), owner);
-  unmerged = EnsureTagged(compilation_unit, smi_constants, unmerged_aspects,
-                          unmerged, predecessors_[predecessors_so_far_]);
+  unmerged = EnsureTagged(builder, unmerged_aspects, unmerged,
+                          predecessors_[predecessors_so_far_]);
   result->set_input(predecessor_count_ - 1, unmerged);
+
+  NodeType type = GetNodeType(builder->broker(), builder->local_isolate(),
+                              unmerged_aspects, unmerged);
+  result->merge_post_loop_type(type);
+  // We've just merged the backedge, which means that future uses of this Phi
+  // will be after the loop, so we can now promote `post_loop_type` to the
+  // regular `type`.
+  DCHECK_EQ(predecessors_so_far_, predecessor_count_ - 1);
+  result->promote_post_loop_type();
+
+  if (Phi* unmerged_phi = unmerged->TryCast<Phi>()) {
+    // Propagating the `uses_repr` from {result} to {unmerged_phi}.
+    builder->RecordUseReprHint(unmerged_phi, result->get_uses_repr_hints());
+  }
 }
 
 ValueNode* MergePointInterpreterFrameState::NewLoopPhi(
@@ -483,6 +666,7 @@ ValueNode* MergePointInterpreterFrameState::NewLoopPhi(
   DCHECK_EQ(predecessors_so_far_, 0);
   // Create a new loop phi, which for now is empty.
   Phi* result = Node::New<Phi>(zone, predecessor_count_, this, reg);
+
   if (v8_flags.trace_maglev_graph_building) {
     for (int i = 0; i < predecessor_count_; i++) {
       result->set_input(i, nullptr);
diff --git a/deps/v8/src/maglev/maglev-interpreter-frame-state.h b/deps/v8/src/maglev/maglev-interpreter-frame-state.h
index 3a173b55d176c0..ceb2ba62d3d62f 100644
--- a/deps/v8/src/maglev/maglev-interpreter-frame-state.h
+++ b/deps/v8/src/maglev/maglev-interpreter-frame-state.h
@@ -11,11 +11,9 @@
 #include "src/compiler/bytecode-liveness-map.h"
 #include "src/interpreter/bytecode-register.h"
 #include "src/maglev/maglev-compilation-unit.h"
-#include "src/maglev/maglev-graph-printer.h"
 #include "src/maglev/maglev-ir.h"
 #include "src/maglev/maglev-regalloc-data.h"
 #include "src/maglev/maglev-register-frame-array.h"
-#include "src/zone/zone-handle-set.h"
 #include "src/zone/zone.h"
 
 namespace v8 {
@@ -23,6 +21,8 @@ namespace internal {
 namespace maglev {
 
 class BasicBlock;
+class Graph;
+class MaglevGraphBuilder;
 class MergePointInterpreterFrameState;
 
 // Destructively intersects the right map into the left map, such that the
@@ -64,107 +64,195 @@ void DestructivelyIntersect(ZoneMap<Key, Value>& lhs_map,
   }
 }
 
-// The intersection (using `&`) of any two NodeTypes must be a valid NodeType
-// (possibly "kUnknown").
-// All heap object types include the heap object bit, so that they can be
-// checked for AnyHeapObject with a single bit check.
-#define NODE_TYPE_LIST(V)                                         \
-  V(Unknown, 0)                                                   \
-  V(NumberOrOddball, (1 << 1))                                    \
-  V(Number, (1 << 2) | kNumberOrOddball)                          \
-  V(Oddball, (1 << 3) | kNumberOrOddball)                         \
-  V(ObjectWithKnownMap, (1 << 4))                                 \
-  V(Smi, (1 << 5) | kObjectWithKnownMap | kNumber)                \
-  V(AnyHeapObject, (1 << 6))                                      \
-  V(Name, (1 << 7) | kAnyHeapObject)                              \
-  V(String, (1 << 8) | kName)                                     \
-  V(InternalizedString, (1 << 9) | kString)                       \
-  V(Symbol, (1 << 10) | kName)                                    \
-  V(JSReceiver, (1 << 11) | kAnyHeapObject)                       \
-  V(HeapObjectWithKnownMap, kObjectWithKnownMap | kAnyHeapObject) \
-  V(HeapNumber, kHeapObjectWithKnownMap | kNumber)                \
-  V(JSReceiverWithKnownMap, kJSReceiver | kHeapObjectWithKnownMap)
-
-enum class NodeType {
-#define DEFINE_NODE_TYPE(Name, Value) k##Name = Value,
-  NODE_TYPE_LIST(DEFINE_NODE_TYPE)
-#undef DEFINE_NODE_TYPE
-};
+using PossibleMaps = compiler::ZoneRefSet<Map>;
 
-inline NodeType CombineType(NodeType left, NodeType right) {
-  return static_cast<NodeType>(static_cast<int>(left) |
-                               static_cast<int>(right));
-}
-inline NodeType IntersectType(NodeType left, NodeType right) {
-  return static_cast<NodeType>(static_cast<int>(left) &
-                               static_cast<int>(right));
-}
-inline bool NodeTypeIs(NodeType type, NodeType to_check) {
-  int right = static_cast<int>(to_check);
-  return (static_cast<int>(type) & right) == right;
-}
+class NodeInfo {
+ public:
+  NodeInfo() = default;
 
-#define DEFINE_NODE_TYPE_CHECK(Type, _)         \
-  inline bool NodeTypeIs##Type(NodeType type) { \
-    return NodeTypeIs(type, NodeType::k##Type); \
+  struct ClearUnstableMapsOnCopy {
+    const NodeInfo& val;
+  };
+  explicit NodeInfo(ClearUnstableMapsOnCopy other) V8_NOEXCEPT {
+    type_ = other.val.type_;
+    alternative_ = other.val.alternative_;
+    if (other.val.possible_maps_are_known_ && !other.val.any_map_is_unstable_) {
+      possible_maps_ = other.val.possible_maps_;
+      possible_maps_are_known_ = true;
+    }
   }
-NODE_TYPE_LIST(DEFINE_NODE_TYPE_CHECK)
-#undef DEFINE_NODE_TYPE_CHECK
 
-struct NodeInfo {
-  NodeType type = NodeType::kUnknown;
+  NodeType type() const { return type_; }
+  NodeType CombineType(NodeType other) {
+    return type_ = maglev::CombineType(type_, other);
+  }
+  NodeType IntersectType(NodeType other) {
+    return type_ = maglev::IntersectType(type_, other);
+  }
 
   // Optional alternative nodes with the equivalent value but a different
   // representation.
-  // TODO(leszeks): At least one of these is redundant for every node, consider
-  // a more compressed form or even linked list.
-  ValueNode* tagged_alternative = nullptr;
-  ValueNode* int32_alternative = nullptr;
-  ValueNode* float64_alternative = nullptr;
-  ValueNode* truncated_int32_alternative = nullptr;
+  class AlternativeNodes {
+   public:
+    AlternativeNodes() { store_.fill(nullptr); }
+
+#define ALTERNATIVES(V)                                \
+  V(tagged, Tagged)                                    \
+  V(int32, Int32)                                      \
+  V(truncated_int32_to_number, TruncatedInt32ToNumber) \
+  V(float64, Float64)                                  \
+  V(constant, Constant)
+
+    enum Kind {
+#define KIND(name, Name) k##Name,
+      ALTERNATIVES(KIND)
+#undef KIND
+          kNumberOfAlternatives
+    };
+
+#define API(name, Name)                                      \
+  ValueNode* name() const { return store_[Kind::k##Name]; }  \
+  ValueNode* set_##name(ValueNode* val) {                    \
+    return store_[Kind::k##Name] = val;                      \
+  }                                                          \
+  template <typename Function>                               \
+  ValueNode* get_or_set_##name(Function create) {            \
+    if (store_[Kind::k##Name]) return store_[Kind::k##Name]; \
+    return store_[Kind::k##Name] = create();                 \
+  }
+    ALTERNATIVES(API)
+#undef API
+#undef ALTERNATIVES
+
+    bool has_none() const { return store_ == AlternativeNodes().store_; }
+
+    void MergeWith(const AlternativeNodes& other) {
+      for (size_t i = 0; i < Kind::kNumberOfAlternatives; ++i) {
+        if (store_[i] && store_[i] != other.store_[i]) {
+          store_[i] = nullptr;
+        }
+      }
+    }
+
+   private:
+    // TODO(leszeks): At least one of these is redundant for every node,
+    // consider a more compressed form or even linked list.
+    std::array<ValueNode*, Kind::kNumberOfAlternatives> store_;
+
+    // Prevent callers from copying these when they try to update the
+    // alternatives by making these private.
+    AlternativeNodes(const AlternativeNodes&) V8_NOEXCEPT = default;
+    AlternativeNodes& operator=(const AlternativeNodes&) V8_NOEXCEPT = default;
+    friend class NodeInfo;
+  };
+
+  const AlternativeNodes& alternative() const { return alternative_; }
+  AlternativeNodes& alternative() { return alternative_; }
 
-  bool is_empty() {
-    return type == NodeType::kUnknown && tagged_alternative == nullptr &&
-           int32_alternative == nullptr && float64_alternative == nullptr;
+  bool no_info_available() const {
+    return type_ == NodeType::kUnknown && alternative_.has_none() &&
+           !possible_maps_are_known_;
   }
 
-  bool is_smi() const { return NodeTypeIsSmi(type); }
-  bool is_any_heap_object() const { return NodeTypeIsAnyHeapObject(type); }
-  bool is_string() const { return NodeTypeIsString(type); }
+  bool is_smi() const { return NodeTypeIsSmi(type_); }
+  bool is_any_heap_object() const { return NodeTypeIsAnyHeapObject(type_); }
+  bool is_string() const { return NodeTypeIsString(type_); }
   bool is_internalized_string() const {
-    return NodeTypeIsInternalizedString(type);
+    return NodeTypeIsInternalizedString(type_);
   }
-  bool is_symbol() const { return NodeTypeIsSymbol(type); }
+  bool is_symbol() const { return NodeTypeIsSymbol(type_); }
 
   // Mutate this node info by merging in another node info, with the result
   // being a node info that is the subset of information valid in both inputs.
-  void MergeWith(const NodeInfo& other) {
-    type = IntersectType(type, other.type);
-    tagged_alternative = tagged_alternative == other.tagged_alternative
-                             ? tagged_alternative
-                             : nullptr;
-    int32_alternative = int32_alternative == other.int32_alternative
-                            ? int32_alternative
-                            : nullptr;
-    float64_alternative = float64_alternative == other.float64_alternative
-                              ? float64_alternative
-                              : nullptr;
-    truncated_int32_alternative =
-        truncated_int32_alternative == other.truncated_int32_alternative
-            ? truncated_int32_alternative
-            : nullptr;
+  void MergeWith(const NodeInfo& other, Zone* zone,
+                 bool& any_merged_map_is_unstable) {
+    IntersectType(other.type_);
+    alternative_.MergeWith(other.alternative_);
+    if (possible_maps_are_known_) {
+      if (other.possible_maps_are_known_) {
+        // Map sets are the set of _possible_ maps, so on a merge we need to
+        // _union_ them together (i.e. intersect the set of impossible maps).
+        // Remember whether _any_ of these merges observed unstable maps.
+        possible_maps_.Union(other.possible_maps_, zone);
+      } else {
+        possible_maps_.clear();
+        possible_maps_are_known_ = false;
+      }
+    }
+
+    any_map_is_unstable_ = possible_maps_are_known_ &&
+                           (any_map_is_unstable_ || other.any_map_is_unstable_);
+    any_merged_map_is_unstable =
+        any_merged_map_is_unstable || any_map_is_unstable_;
+  }
+
+  bool possible_maps_are_unstable() const { return any_map_is_unstable_; }
+
+  void ClearUnstableMaps() {
+    if (!any_map_is_unstable_) return;
+    possible_maps_.clear();
+    possible_maps_are_known_ = false;
+    any_map_is_unstable_ = false;
+  }
+
+  bool possible_maps_are_known() const { return possible_maps_are_known_; }
+
+  const PossibleMaps& possible_maps() const {
+    // If !possible_maps_are_known_ then every map is possible and using the
+    // (probably empty) possible_maps_ set is definetly wrong.
+    CHECK(possible_maps_are_known_);
+    return possible_maps_;
   }
+
+  void SetPossibleMaps(const PossibleMaps& possible_maps,
+                       bool any_map_is_unstable, NodeType possible_type) {
+    possible_maps_ = possible_maps;
+    possible_maps_are_known_ = true;
+    any_map_is_unstable_ = any_map_is_unstable;
+#ifdef DEBUG
+    if (possible_maps.size()) {
+      NodeType expected = StaticTypeForMap(*possible_maps.begin());
+      for (auto map : possible_maps) {
+        expected = maglev::IntersectType(StaticTypeForMap(map), expected);
+      }
+      // Ensure the claimed type is not narrower than what can be learned from
+      // the map checks.
+      DCHECK(NodeTypeIs(expected, possible_type));
+    } else {
+      DCHECK_EQ(possible_type, NodeType::kUnknown);
+    }
+#endif
+    CombineType(possible_type);
+  }
+
+  bool any_map_is_unstable() const { return any_map_is_unstable_; }
+
+ private:
+  NodeType type_ = NodeType::kUnknown;
+
+  bool any_map_is_unstable_ = false;
+
+  // Maps for a node. Sets of maps that only contain stable maps are valid
+  // across side-effecting calls, as long as we install a dependency, otherwise
+  // they are cleared on side-effects.
+  // TODO(v8:7700): Investigate a better data structure to use than ZoneMap.
+  bool possible_maps_are_known_ = false;
+  PossibleMaps possible_maps_;
+
+  AlternativeNodes alternative_;
 };
 
 struct KnownNodeAspects {
+  // Permanently valid if checked in a dominator.
+  using NodeInfos = ZoneMap<ValueNode*, NodeInfo>;
+
   explicit KnownNodeAspects(Zone* zone)
-      : node_infos(zone),
-        stable_maps(zone),
-        unstable_maps(zone),
+      : any_map_for_any_node_is_unstable(false),
         loaded_constant_properties(zone),
         loaded_properties(zone),
         loaded_context_constants(zone),
-        loaded_context_slots(zone) {}
+        loaded_context_slots(zone),
+        node_infos(zone) {}
 
   // Copy constructor is defaulted but private so that we explicitly call the
   // Clone method.
@@ -182,33 +270,69 @@ struct KnownNodeAspects {
   // calls, and we don't know about these until it's too late.
   KnownNodeAspects* CloneForLoopHeader(Zone* zone) const {
     KnownNodeAspects* clone = zone->New<KnownNodeAspects>(zone);
-    clone->node_infos = node_infos;
-    clone->stable_maps = stable_maps;
+    if (!any_map_for_any_node_is_unstable) {
+      clone->node_infos = node_infos;
+#ifdef DEBUG
+      for (const auto& it : node_infos) {
+        DCHECK(!it.second.any_map_is_unstable());
+      }
+#endif
+    } else {
+      for (const auto& it : node_infos) {
+        clone->node_infos.emplace(it.first,
+                                  NodeInfo::ClearUnstableMapsOnCopy{it.second});
+      }
+    }
     clone->loaded_constant_properties = loaded_constant_properties;
     clone->loaded_context_constants = loaded_context_constants;
     return clone;
   }
 
-  ZoneMap<ValueNode*, NodeInfo>::iterator FindInfo(ValueNode* node) {
-    return node_infos.find(node);
+  void ClearUnstableMaps() {
+    // A side effect could change existing objects' maps. For stable maps we
+    // know this hasn't happened (because we added a dependency on the maps
+    // staying stable and therefore not possible to transition away from), but
+    // we can no longer assume that objects with unstable maps still have the
+    // same map. Unstable maps can also transition to stable ones, so we have to
+    // clear _all_ maps for a node if it had _any_ unstable map.
+    if (!any_map_for_any_node_is_unstable) return;
+    for (auto& it : node_infos) {
+      it.second.ClearUnstableMaps();
+    }
+    any_map_for_any_node_is_unstable = false;
   }
-  ZoneMap<ValueNode*, NodeInfo>::const_iterator FindInfo(
-      ValueNode* node) const {
+
+  NodeInfos::iterator FindInfo(ValueNode* node) {
     return node_infos.find(node);
   }
-  bool IsValid(ZoneMap<ValueNode*, NodeInfo>::iterator& it) {
-    return it != node_infos.end();
+  NodeInfos::const_iterator FindInfo(ValueNode* node) const {
+    return node_infos.find(node);
   }
-  bool IsValid(ZoneMap<ValueNode*, NodeInfo>::const_iterator& it) const {
+  bool IsValid(NodeInfos::iterator& it) { return it != node_infos.end(); }
+  bool IsValid(NodeInfos::const_iterator& it) const {
     return it != node_infos.end();
   }
 
   const NodeInfo* TryGetInfoFor(ValueNode* node) const {
+    return const_cast<KnownNodeAspects*>(this)->TryGetInfoFor(node);
+  }
+  NodeInfo* TryGetInfoFor(ValueNode* node) {
     auto info_it = FindInfo(node);
     if (!IsValid(info_it)) return nullptr;
     return &info_it->second;
   }
-  NodeInfo* GetOrCreateInfoFor(ValueNode* node) { return &node_infos[node]; }
+  NodeInfo* GetOrCreateInfoFor(ValueNode* node) {
+    auto info_it = FindInfo(node);
+    if (IsValid(info_it)) return &info_it->second;
+    return &node_infos.emplace(node, NodeInfo()).first->second;
+  }
+
+  NodeType NodeTypeFor(ValueNode* node) const {
+    if (auto info = TryGetInfoFor(node)) {
+      return info->type();
+    }
+    return NodeType::kUnknown;
+  }
 
   void Merge(const KnownNodeAspects& other, Zone* zone);
 
@@ -216,21 +340,19 @@ struct KnownNodeAspects {
   // particular, clear out entries that are no longer reachable, perhaps also
   // allow lookup by interpreter register rather than by node pointer.
 
-  // Permanently valid if checked in a dominator.
-  ZoneMap<ValueNode*, NodeInfo> node_infos;
-  // TODO(v8:7700): Investigate a better data structure to use than
-  // ZoneHandleSet.
-  // Valid across side-effecting calls, as long as we install a dependency.
-  ZoneMap<ValueNode*, ZoneHandleSet<Map>> stable_maps;
-  // Flushed after side-effecting calls.
-  ZoneMap<ValueNode*, ZoneHandleSet<Map>> unstable_maps;
+  bool any_map_for_any_node_is_unstable;
+
+  // Cached property loads.
+
+  // Maps name->object->value, so that stores to a name can invalidate all loads
+  // of that name (in case the objects are aliasing).
+  using LoadedPropertyMap =
+      ZoneMap<compiler::NameRef, ZoneMap<ValueNode*, ValueNode*>>;
 
   // Valid across side-effecting calls, as long as we install a dependency.
-  ZoneMap<std::pair<ValueNode*, compiler::NameRef>, ValueNode*>
-      loaded_constant_properties;
+  LoadedPropertyMap loaded_constant_properties;
   // Flushed after side-effecting calls.
-  ZoneMap<std::pair<ValueNode*, compiler::NameRef>, ValueNode*>
-      loaded_properties;
+  LoadedPropertyMap loaded_properties;
 
   // Unconditionally valid across side-effecting calls.
   ZoneMap<std::tuple<ValueNode*, int>, ValueNode*> loaded_context_constants;
@@ -238,6 +360,8 @@ struct KnownNodeAspects {
   ZoneMap<std::tuple<ValueNode*, int>, ValueNode*> loaded_context_slots;
 
  private:
+  NodeInfos node_infos;
+
   friend KnownNodeAspects* Zone::New<KnownNodeAspects, const KnownNodeAspects&>(
       const KnownNodeAspects&);
   KnownNodeAspects(const KnownNodeAspects& other) V8_NOEXCEPT = default;
@@ -254,7 +378,7 @@ class InterpreterFrameState {
             info, info.zone()->New<KnownNodeAspects>(info.zone())) {}
 
   inline void CopyFrom(const MaglevCompilationUnit& info,
-                       const MergePointInterpreterFrameState& state);
+                       MergePointInterpreterFrameState& state);
 
   void set_accumulator(ValueNode* value) {
     // Conversions should be stored in known_node_aspects/NodeInfo.
@@ -296,6 +420,8 @@ class InterpreterFrameState {
     known_node_aspects_ = known_node_aspects;
   }
 
+  void clear_known_node_aspects() { known_node_aspects_ = nullptr; }
+
  private:
   RegisterFrameArray<ValueNode*> frame_;
   KnownNodeAspects* known_node_aspects_;
@@ -306,7 +432,7 @@ class CompactInterpreterFrameState {
   CompactInterpreterFrameState(const MaglevCompilationUnit& info,
                                const compiler::BytecodeLivenessState* liveness)
       : live_registers_and_accumulator_(
-            info.zone()->NewArray<ValueNode*>(SizeFor(info, liveness))),
+            info.zone()->AllocateArray<ValueNode*>(SizeFor(info, liveness))),
         liveness_(liveness) {}
 
   CompactInterpreterFrameState(const MaglevCompilationUnit& info,
@@ -463,7 +589,7 @@ class MergePointRegisterState {
   template <typename Function>
   void ForEachGeneralRegister(Function&& f) {
     RegisterState* current_value = &values_[0];
-    for (Register reg : kAllocatableGeneralRegisters) {
+    for (Register reg : MaglevAssembler::GetAllocatableRegisters()) {
       f(reg, *current_value);
       ++current_value;
     }
@@ -472,7 +598,8 @@ class MergePointRegisterState {
   template <typename Function>
   void ForEachDoubleRegister(Function&& f) {
     RegisterState* current_value = &double_values_[0];
-    for (DoubleRegister reg : kAllocatableDoubleRegisters) {
+    for (DoubleRegister reg :
+         MaglevAssembler::GetAllocatableDoubleRegisters()) {
       f(reg, *current_value);
       ++current_value;
     }
@@ -500,26 +627,37 @@ class MergePointInterpreterFrameState {
       const InterpreterFrameState& start_state,
       const MaglevCompilationUnit& info, int merge_offset,
       int predecessor_count, const compiler::BytecodeLivenessState* liveness,
-      const compiler::LoopInfo* loop_info);
+      const compiler::LoopInfo* loop_info, bool has_been_peeled = false);
 
   static MergePointInterpreterFrameState* NewForCatchBlock(
       const MaglevCompilationUnit& unit,
       const compiler::BytecodeLivenessState* liveness, int handler_offset,
-      interpreter::Register context_register, Graph* graph, bool is_inline);
+      interpreter::Register context_register, Graph* graph);
 
   // Merges an unmerged framestate with a possibly merged framestate into |this|
   // framestate.
-  void Merge(MaglevCompilationUnit& compilation_unit,
-             ZoneMap<int, SmiConstant*>& smi_constants,
+  void Merge(MaglevGraphBuilder* graph_builder, InterpreterFrameState& unmerged,
+             BasicBlock* predecessor);
+  void Merge(MaglevGraphBuilder* graph_builder,
+             MaglevCompilationUnit& compilation_unit,
              InterpreterFrameState& unmerged, BasicBlock* predecessor);
 
   // Merges an unmerged framestate with a possibly merged framestate into |this|
   // framestate.
-  void MergeLoop(MaglevCompilationUnit& compilation_unit,
-                 ZoneMap<int, SmiConstant*>& smi_constants,
+  void MergeLoop(MaglevGraphBuilder* graph_builder,
+                 InterpreterFrameState& loop_end_state,
+                 BasicBlock* loop_end_block);
+  void MergeLoop(MaglevGraphBuilder* graph_builder,
+                 MaglevCompilationUnit& compilation_unit,
                  InterpreterFrameState& loop_end_state,
                  BasicBlock* loop_end_block);
 
+  // Merges an unmerged framestate with a possibly merged framestate into |this|
+  // framestate.
+  void MergeThrow(MaglevGraphBuilder* builder,
+                  const MaglevCompilationUnit* handler_unit,
+                  InterpreterFrameState& unmerged);
+
   // Merges a dead framestate (e.g. one which has been early terminated with a
   // deopt).
   void MergeDead(const MaglevCompilationUnit& compilation_unit) {
@@ -542,7 +680,15 @@ class MergePointInterpreterFrameState {
     DCHECK(is_unmerged_loop());
     MergeDead(compilation_unit);
     // This means that this is no longer a loop.
-    basic_block_type_ = BasicBlockType::kDefault;
+    bitfield_ =
+        kBasicBlockTypeBits::update(bitfield_, BasicBlockType::kDefault);
+  }
+
+  // Returns and clears the known node aspects on this state. Expects to only
+  // ever be called once, when starting a basic block with this state.
+  KnownNodeAspects* TakeKnownNodeAspects() {
+    DCHECK_NOT_NULL(known_node_aspects_);
+    return std::exchange(known_node_aspects_, nullptr);
   }
 
   const CompactInterpreterFrameState& frame_state() const {
@@ -568,17 +714,17 @@ class MergePointInterpreterFrameState {
   }
 
   bool is_loop() const {
-    return basic_block_type_ == BasicBlockType::kLoopHeader;
+    return basic_block_type() == BasicBlockType::kLoopHeader;
   }
 
   bool is_exception_handler() const {
-    return basic_block_type_ == BasicBlockType::kExceptionHandlerStart;
+    return basic_block_type() == BasicBlockType::kExceptionHandlerStart;
   }
 
   bool is_unmerged_loop() const {
     // If this is a loop and not all predecessors are set, then the loop isn't
     // merged yet.
-    DCHECK_GT(predecessor_count_, 0);
+    DCHECK_IMPLIES(is_loop(), predecessor_count_ > 0);
     return is_loop() && predecessors_so_far_ < predecessor_count_;
   }
 
@@ -589,11 +735,35 @@ class MergePointInterpreterFrameState {
            predecessors_so_far_ == 0;
   }
 
-  bool is_resumable_loop() const { return is_resumable_loop_; }
+  BasicBlockType basic_block_type() const {
+    return kBasicBlockTypeBits::decode(bitfield_);
+  }
+  bool is_resumable_loop() const {
+    return kIsResumableLoopBit::decode(bitfield_);
+  }
+  bool is_loop_with_peeled_iteration() const {
+    return kIsLoopWithPeeledIterationBit::decode(bitfield_);
+  }
 
   int merge_offset() const { return merge_offset_; }
 
+  DeoptFrame* backedge_deopt_frame() const { return backedge_deopt_frame_; }
+
+  const compiler::LoopInfo* loop_info() const {
+    DCHECK(loop_info_.has_value());
+    return loop_info_.value();
+  }
+
+  interpreter::Register catch_block_context_register() const {
+    DCHECK(is_exception_handler());
+    return catch_block_context_register_;
+  }
+
  private:
+  using kBasicBlockTypeBits = base::BitField<BasicBlockType, 0, 2>;
+  using kIsResumableLoopBit = kBasicBlockTypeBits::Next<bool, 1>;
+  using kIsLoopWithPeeledIterationBit = kIsResumableLoopBit::Next<bool, 1>;
+
   // For each non-Phi value in the frame state, store its alternative
   // representations to avoid re-converting on Phi creation.
   class Alternatives {
@@ -601,8 +771,8 @@ class MergePointInterpreterFrameState {
     using List = base::ThreadedList<Alternatives>;
 
     explicit Alternatives(const NodeInfo* node_info)
-        : node_type_(node_info ? node_info->type : NodeType::kUnknown),
-          tagged_alternative_(node_info ? node_info->tagged_alternative
+        : node_type_(node_info ? node_info->type() : NodeType::kUnknown),
+          tagged_alternative_(node_info ? node_info->alternative().tagged()
                                         : nullptr) {}
 
     NodeType node_type() const { return node_type_; }
@@ -617,10 +787,7 @@ class MergePointInterpreterFrameState {
     Alternatives* next_ = nullptr;
     friend base::ThreadedListTraits<Alternatives>;
   };
-
-  friend void InterpreterFrameState::CopyFrom(
-      const MaglevCompilationUnit& info,
-      const MergePointInterpreterFrameState& state);
+  NodeType AlternativeType(const Alternatives* alt);
 
   template <typename T, typename... Args>
   friend T* Zone::New(Args&&... args);
@@ -630,18 +797,16 @@ class MergePointInterpreterFrameState {
       int predecessor_count, int predecessors_so_far, BasicBlock** predecessors,
       BasicBlockType type, const compiler::BytecodeLivenessState* liveness);
 
-  ValueNode* MergeValue(MaglevCompilationUnit& compilation_unit,
-                        ZoneMap<int, SmiConstant*>& smi_constants,
+  ValueNode* MergeValue(MaglevGraphBuilder* graph_builder,
                         interpreter::Register owner,
                         const KnownNodeAspects& unmerged_aspects,
                         ValueNode* merged, ValueNode* unmerged,
-                        Alternatives::List& per_predecessor_alternatives);
+                        Alternatives::List* per_predecessor_alternatives);
 
   void ReducePhiPredecessorCount(interpreter::Register owner,
                                  ValueNode* merged);
 
-  void MergeLoopValue(MaglevCompilationUnit& compilation_unit,
-                      ZoneMap<int, SmiConstant*>& smi_constants,
+  void MergeLoopValue(MaglevGraphBuilder* graph_builder,
                       interpreter::Register owner,
                       KnownNodeAspects& unmerged_aspects, ValueNode* merged,
                       ValueNode* unmerged);
@@ -649,7 +814,6 @@ class MergePointInterpreterFrameState {
   ValueNode* NewLoopPhi(Zone* zone, interpreter::Register reg);
 
   ValueNode* NewExceptionPhi(Zone* zone, interpreter::Register reg) {
-    DCHECK_EQ(predecessors_so_far_, 0);
     DCHECK_EQ(predecessor_count_, 0);
     DCHECK_NULL(predecessors_);
     Phi* result = Node::New<Phi>(zone, 0, this, reg);
@@ -661,28 +825,44 @@ class MergePointInterpreterFrameState {
 
   int predecessor_count_;
   int predecessors_so_far_;
-  bool is_resumable_loop_ = false;
+
+  uint32_t bitfield_;
+
   BasicBlock** predecessors_;
 
-  BasicBlockType basic_block_type_;
   Phi::List phis_;
 
   CompactInterpreterFrameState frame_state_;
   MergePointRegisterState register_state_;
   KnownNodeAspects* known_node_aspects_ = nullptr;
-  Alternatives::List* per_predecessor_alternatives_;
+
+  union {
+    // {pre_predecessor_alternatives_} is used to keep track of the alternatives
+    // of Phi inputs. Once the block has been merged, it's not used anymore.
+    Alternatives::List* per_predecessor_alternatives_;
+    // {backedge_deopt_frame_} is used to record the deopt frame for the
+    // backedge, in case we want to insert a deopting conversion during phi
+    // untagging. It is set when visiting the JumpLoop (and will only be set for
+    // loop headers), when the header has already been merged and
+    // {per_predecessor_alternatives_} is thus not used anymore.
+    DeoptFrame* backedge_deopt_frame_;
+    // For catch blocks, store the interpreter register holding the context.
+    // This will be the same value for all incoming merges.
+    interpreter::Register catch_block_context_register_;
+  };
+
+  base::Optional<const compiler::LoopInfo*> loop_info_ = base::nullopt;
 };
 
-void InterpreterFrameState::CopyFrom(
-    const MaglevCompilationUnit& info,
-    const MergePointInterpreterFrameState& state) {
+void InterpreterFrameState::CopyFrom(const MaglevCompilationUnit& info,
+                                     MergePointInterpreterFrameState& state) {
   state.frame_state().ForEachValue(
       info, [&](ValueNode* value, interpreter::Register reg) {
         frame_[reg] = value;
       });
   // Move "what we know" across without copying -- we can safely mutate it
   // now, as we won't be entering this merge point again.
-  known_node_aspects_ = state.known_node_aspects_;
+  known_node_aspects_ = state.TakeKnownNodeAspects();
 }
 
 }  // namespace maglev
diff --git a/deps/v8/src/maglev/maglev-ir-inl.h b/deps/v8/src/maglev/maglev-ir-inl.h
index 03ce8e3a1e88ae..d0848b18307570 100644
--- a/deps/v8/src/maglev/maglev-ir-inl.h
+++ b/deps/v8/src/maglev/maglev-ir-inl.h
@@ -5,6 +5,8 @@
 #ifndef V8_MAGLEV_MAGLEV_IR_INL_H_
 #define V8_MAGLEV_MAGLEV_IR_INL_H_
 
+#include <type_traits>
+
 #include "src/maglev/maglev-interpreter-frame-state.h"
 #include "src/maglev/maglev-ir.h"
 
@@ -14,29 +16,56 @@ namespace maglev {
 
 namespace detail {
 
+// A little bit of template magic to allow DeepForEachInput to either take a
+// `const DeoptInfo*` or a `DeoptInfo*`, depending on whether the Function
+// processes read-only `ValueNode*` or read-write `ValueNode*&`.
+template <typename F, typename Ret, typename A, typename... Rest>
+A first_argument_helper(Ret (F::*)(A, Rest...));
+
+template <typename F, typename Ret, typename A, typename... Rest>
+A first_argument_helper(Ret (F::*)(A, Rest...) const);
+
+template <typename Function>
+using first_argument = decltype(first_argument_helper(
+    &std::remove_reference_t<Function>::operator()));
+
+template <typename T, typename Function>
+using const_if_function_first_arg_not_reference =
+    std::conditional_t<std::is_reference_v<first_argument<Function>>, T,
+                       const T>;
+
 template <typename Function>
-void DeepForEachInputImpl(const DeoptFrame& frame,
-                          InputLocation* input_locations, int& index,
-                          Function&& f) {
+void DeepForEachInputImpl(
+    const_if_function_first_arg_not_reference<DeoptFrame, Function>& frame,
+    InputLocation* input_locations, int& index, Function&& f) {
   if (frame.parent()) {
     DeepForEachInputImpl(*frame.parent(), input_locations, index, f);
   }
   switch (frame.type()) {
     case DeoptFrame::FrameType::kInterpretedFrame:
+      f(frame.as_interpreted().closure(), &input_locations[index++]);
       frame.as_interpreted().frame_state()->ForEachValue(
           frame.as_interpreted().unit(),
-          [&](ValueNode*& node, interpreter::Register reg) {
+          [&](first_argument<Function> node, interpreter::Register reg) {
             f(node, &input_locations[index++]);
           });
       break;
     case DeoptFrame::FrameType::kInlinedArgumentsFrame: {
-      for (ValueNode*& node : frame.as_inlined_arguments().arguments()) {
+      f(frame.as_inlined_arguments().closure(), &input_locations[index++]);
+      for (first_argument<Function> node :
+           frame.as_inlined_arguments().arguments()) {
         f(node, &input_locations[index++]);
       }
       break;
     }
+    case DeoptFrame::FrameType::kConstructInvokeStubFrame: {
+      f(frame.as_construct_stub().receiver(), &input_locations[index++]);
+      f(frame.as_construct_stub().context(), &input_locations[index++]);
+      break;
+    }
     case DeoptFrame::FrameType::kBuiltinContinuationFrame:
-      for (ValueNode*& node : frame.as_builtin_continuation().parameters()) {
+      for (first_argument<Function> node :
+           frame.as_builtin_continuation().parameters()) {
         f(node, &input_locations[index++]);
       }
       f(frame.as_builtin_continuation().context(), &input_locations[index++]);
@@ -45,17 +74,21 @@ void DeepForEachInputImpl(const DeoptFrame& frame,
 }
 
 template <typename Function>
-void DeepForEachInput(const EagerDeoptInfo* deopt_info, Function&& f) {
+void DeepForEachInput(const_if_function_first_arg_not_reference<
+                          EagerDeoptInfo, Function>* deopt_info,
+                      Function&& f) {
   int index = 0;
   DeepForEachInputImpl(deopt_info->top_frame(), deopt_info->input_locations(),
-                       index, f);
+                       index, std::forward<Function>(f));
 }
 
 template <typename Function>
-void DeepForEachInput(const LazyDeoptInfo* deopt_info, Function&& f) {
+void DeepForEachInput(const_if_function_first_arg_not_reference<
+                          LazyDeoptInfo, Function>* deopt_info,
+                      Function&& f) {
   int index = 0;
   InputLocation* input_locations = deopt_info->input_locations();
-  const DeoptFrame& top_frame = deopt_info->top_frame();
+  auto& top_frame = deopt_info->top_frame();
   if (top_frame.parent()) {
     DeepForEachInputImpl(*top_frame.parent(), input_locations, index, f);
   }
@@ -63,20 +96,26 @@ void DeepForEachInput(const LazyDeoptInfo* deopt_info, Function&& f) {
   // location.
   switch (top_frame.type()) {
     case DeoptFrame::FrameType::kInterpretedFrame:
+      f(top_frame.as_interpreted().closure(), &input_locations[index++]);
       top_frame.as_interpreted().frame_state()->ForEachValue(
           top_frame.as_interpreted().unit(),
-          [&](ValueNode*& node, interpreter::Register reg) {
+          [&](first_argument<Function> node, interpreter::Register reg) {
             // Skip over the result location since it is irrelevant for lazy
             // deopts (unoptimized code will recreate the result).
             if (deopt_info->IsResultRegister(reg)) return;
             f(node, &input_locations[index++]);
           });
       break;
+    case DeoptFrame::FrameType::kConstructInvokeStubFrame: {
+      f(top_frame.as_construct_stub().receiver(), &input_locations[index++]);
+      f(top_frame.as_construct_stub().context(), &input_locations[index++]);
+      break;
+    }
     case DeoptFrame::FrameType::kInlinedArgumentsFrame:
       // The inlined arguments frame can never be the top frame.
       UNREACHABLE();
     case DeoptFrame::FrameType::kBuiltinContinuationFrame:
-      for (ValueNode*& node :
+      for (first_argument<Function> node :
            top_frame.as_builtin_continuation().parameters()) {
         f(node, &input_locations[index++]);
       }
diff --git a/deps/v8/src/maglev/maglev-ir.cc b/deps/v8/src/maglev/maglev-ir.cc
index 3b31db524179f0..e2fa798a208fd9 100644
--- a/deps/v8/src/maglev/maglev-ir.cc
+++ b/deps/v8/src/maglev/maglev-ir.cc
@@ -10,13 +10,17 @@
 #include "src/builtins/builtins-constructor.h"
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/codegen/interface-descriptors.h"
+#include "src/common/globals.h"
 #include "src/compiler/heap-refs.h"
+#include "src/deoptimizer/deoptimize-reason.h"
 #include "src/execution/isolate-inl.h"
 #include "src/heap/local-heap.h"
 #include "src/heap/parked-scope.h"
 #include "src/interpreter/bytecode-flags.h"
 #include "src/maglev/maglev-assembler-inl.h"
 #include "src/maglev/maglev-assembler.h"
+#include "src/maglev/maglev-code-gen-state.h"
+#include "src/maglev/maglev-compilation-unit.h"
 #include "src/maglev/maglev-graph-labeller.h"
 #include "src/maglev/maglev-graph-processor.h"
 #include "src/maglev/maglev-ir-inl.h"
@@ -99,6 +103,29 @@ void NodeBase::CheckCanOverwriteWith(Opcode new_opcode,
 
 #endif  // DEBUG
 
+bool Phi::is_loop_phi() const { return merge_state()->is_loop(); }
+
+void Phi::RecordUseReprHint(UseRepresentationSet repr_mask,
+                            int current_offset) {
+  if (is_loop_phi() && merge_state()->loop_info()->Contains(current_offset)) {
+    same_loop_uses_repr_hint_.Add(repr_mask);
+  }
+
+  if (!repr_mask.is_subset_of(uses_repr_hint_)) {
+    uses_repr_hint_.Add(repr_mask);
+
+    // Propagate in inputs, ignoring unbounded loop backedges.
+    int bound_inputs = input_count();
+    if (merge_state()->is_unmerged_loop()) --bound_inputs;
+
+    for (int i = 0; i < bound_inputs; i++) {
+      if (Phi* phi_input = input(i).node()->TryCast<Phi>()) {
+        phi_input->RecordUseReprHint(repr_mask, current_offset);
+      }
+    }
+  }
+}
+
 namespace {
 
 // ---
@@ -123,6 +150,10 @@ void PrintResult(std::ostream& os, MaglevGraphLabeller* graph_labeller,
 void PrintResult(std::ostream& os, MaglevGraphLabeller* graph_labeller,
                  const ValueNode* node) {
   os << " → " << node->result().operand();
+  if (node->result().operand().IsAllocated() && node->is_spilled() &&
+      node->spill_slot() != node->result().operand()) {
+    os << " (spilled: " << node->spill_slot() << ")";
+  }
   if (node->has_valid_live_range()) {
     os << ", live range: [" << node->live_range().start << "-"
        << node->live_range().end << "]";
@@ -186,19 +217,26 @@ void PrintImpl(std::ostream& os, MaglevGraphLabeller* graph_labeller,
 }
 
 size_t GetInputLocationsArraySize(const DeoptFrame& top_frame) {
+  static constexpr int kClosureSize = 1;
+  static constexpr int kReceiverSize = 1;
+  static constexpr int kContextSize = 1;
   size_t size = 0;
   const DeoptFrame* frame = &top_frame;
   do {
     switch (frame->type()) {
       case DeoptFrame::FrameType::kInterpretedFrame:
-        size += frame->as_interpreted().frame_state()->size(
-            frame->as_interpreted().unit());
+        size += kClosureSize + frame->as_interpreted().frame_state()->size(
+                                   frame->as_interpreted().unit());
         break;
       case DeoptFrame::FrameType::kInlinedArgumentsFrame:
-        size += frame->as_inlined_arguments().arguments().size();
+        size += kClosureSize + frame->as_inlined_arguments().arguments().size();
+        break;
+      case DeoptFrame::FrameType::kConstructInvokeStubFrame:
+        size += kReceiverSize + kContextSize;
         break;
       case DeoptFrame::FrameType::kBuiltinContinuationFrame:
-        size += frame->as_builtin_continuation().parameters().size() + 1;
+        size +=
+            frame->as_builtin_continuation().parameters().size() + kContextSize;
         break;
     }
     frame = frame->parent();
@@ -235,7 +273,7 @@ bool CheckToBooleanOnAllRoots(LocalIsolate* local_isolate) {
   /* Ignore 'undefined' roots that are not the undefined value itself. */ \
   if (roots.name() != roots.undefined_value() ||                          \
       RootIndex::k##CamelName == RootIndex::kUndefinedValue) {            \
-    DCHECK_EQ(roots.name().BooleanValue(local_isolate),                   \
+    DCHECK_EQ(Object::BooleanValue(roots.name(), local_isolate),          \
               RootToBoolean(RootIndex::k##CamelName));                    \
   }
   READ_ONLY_ROOT_LIST(DO_CHECK)
@@ -284,7 +322,7 @@ DeoptInfo::DeoptInfo(Zone* zone, const DeoptFrame top_frame,
                      compiler::FeedbackSource feedback_to_update)
     : top_frame_(top_frame),
       feedback_to_update_(feedback_to_update),
-      input_locations_(zone->NewArray<InputLocation>(
+      input_locations_(zone->AllocateArray<InputLocation>(
           GetInputLocationsArraySize(top_frame))) {
   // Initialise InputLocations so that they correctly don't have a next use id.
   for (size_t i = 0; i < GetInputLocationsArraySize(top_frame); ++i) {
@@ -293,6 +331,9 @@ DeoptInfo::DeoptInfo(Zone* zone, const DeoptFrame top_frame,
 }
 
 bool LazyDeoptInfo::IsResultRegister(interpreter::Register reg) const {
+  if (top_frame().type() == DeoptFrame::FrameType::kConstructInvokeStubFrame) {
+    return reg == interpreter::Register::virtual_accumulator();
+  }
   if (V8_LIKELY(result_size() == 1)) {
     return reg == result_location_;
   }
@@ -383,7 +424,11 @@ void CheckValueInputIs(const NodeBase* node, int i,
   ValueNode* input = node->input(i).node();
   DCHECK(!input->Is<Identity>());
   ValueRepresentation got = input->properties().value_representation();
-  if (got != expected) {
+  // Allow Float64 values to be inputs when HoleyFloat64 is expected.
+  bool valid =
+      (got == expected) || (got == ValueRepresentation::kFloat64 &&
+                            expected == ValueRepresentation::kHoleyFloat64);
+  if (!valid) {
     std::ostringstream str;
     str << "Type representation error: node ";
     if (graph_labeller) {
@@ -454,6 +499,7 @@ void Phi::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
     CASE_REPR(Int32)
     CASE_REPR(Uint32)
     CASE_REPR(Float64)
+    CASE_REPR(HoleyFloat64)
 #undef CASE_REPR
     case ValueRepresentation::kWord64:
       UNREACHABLE();
@@ -466,11 +512,13 @@ void Call::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void Call::MarkTaggedInputsAsDecompressing() {
   for (int i = 0; i < input_count(); i++) {
     input(i).node()->SetTaggedResultNeedsDecompress();
   }
 }
+#endif
 
 void CallWithArrayLike::VerifyInputs(
     MaglevGraphLabeller* graph_labeller) const {
@@ -479,11 +527,13 @@ void CallWithArrayLike::VerifyInputs(
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void CallWithArrayLike::MarkTaggedInputsAsDecompressing() {
   for (int i = 0; i < input_count(); i++) {
     input(i).node()->SetTaggedResultNeedsDecompress();
   }
 }
+#endif
 
 void CallWithSpread::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   for (int i = 0; i < input_count(); i++) {
@@ -491,11 +541,13 @@ void CallWithSpread::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void CallWithSpread::MarkTaggedInputsAsDecompressing() {
   for (int i = 0; i < input_count(); i++) {
     input(i).node()->SetTaggedResultNeedsDecompress();
   }
 }
+#endif
 
 void CallSelf::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   for (int i = 0; i < input_count(); i++) {
@@ -503,11 +555,13 @@ void CallSelf::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void CallSelf::MarkTaggedInputsAsDecompressing() {
   for (int i = 0; i < input_count(); i++) {
     input(i).node()->SetTaggedResultNeedsDecompress();
   }
 }
+#endif
 
 void CallKnownJSFunction::VerifyInputs(
     MaglevGraphLabeller* graph_labeller) const {
@@ -516,11 +570,28 @@ void CallKnownJSFunction::VerifyInputs(
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void CallKnownJSFunction::MarkTaggedInputsAsDecompressing() {
   for (int i = 0; i < input_count(); i++) {
     input(i).node()->SetTaggedResultNeedsDecompress();
   }
 }
+#endif
+
+void CallKnownApiFunction::VerifyInputs(
+    MaglevGraphLabeller* graph_labeller) const {
+  for (int i = 0; i < input_count(); i++) {
+    CheckValueInputIs(this, i, ValueRepresentation::kTagged, graph_labeller);
+  }
+}
+
+#ifdef V8_COMPRESS_POINTERS
+void CallKnownApiFunction::MarkTaggedInputsAsDecompressing() {
+  for (int i = 0; i < input_count(); i++) {
+    input(i).node()->SetTaggedResultNeedsDecompress();
+  }
+}
+#endif
 
 void Construct::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   for (int i = 0; i < input_count(); i++) {
@@ -528,11 +599,13 @@ void Construct::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void Construct::MarkTaggedInputsAsDecompressing() {
   for (int i = 0; i < input_count(); i++) {
     input(i).node()->SetTaggedResultNeedsDecompress();
   }
 }
+#endif
 
 void ConstructWithSpread::VerifyInputs(
     MaglevGraphLabeller* graph_labeller) const {
@@ -541,11 +614,13 @@ void ConstructWithSpread::VerifyInputs(
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void ConstructWithSpread::MarkTaggedInputsAsDecompressing() {
   for (int i = 0; i < input_count(); i++) {
     input(i).node()->SetTaggedResultNeedsDecompress();
   }
 }
+#endif
 
 void CallBuiltin::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   auto descriptor = Builtins::CallInterfaceDescriptorFor(builtin());
@@ -576,6 +651,7 @@ void CallBuiltin::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void CallBuiltin::MarkTaggedInputsAsDecompressing() {
   auto descriptor = Builtins::CallInterfaceDescriptorFor(builtin());
   int count = input_count();
@@ -595,6 +671,7 @@ void CallBuiltin::MarkTaggedInputsAsDecompressing() {
     }
   }
 }
+#endif
 
 void CallRuntime::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   for (int i = 0; i < input_count(); i++) {
@@ -602,11 +679,13 @@ void CallRuntime::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   }
 }
 
+#ifdef V8_COMPRESS_POINTERS
 void CallRuntime::MarkTaggedInputsAsDecompressing() {
   for (int i = 0; i < input_count(); i++) {
     input(i).node()->SetTaggedResultNeedsDecompress();
   }
 }
+#endif
 
 void FoldedAllocation::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
   Base::VerifyInputs(graph_labeller);
@@ -617,7 +696,7 @@ void FoldedAllocation::VerifyInputs(MaglevGraphLabeller* graph_labeller) const {
 // Reify constants
 // ---
 
-Handle<Object> ValueNode::Reify(LocalIsolate* isolate) {
+Handle<Object> ValueNode::Reify(LocalIsolate* isolate) const {
   switch (opcode()) {
 #define V(Name)         \
   case Opcode::k##Name: \
@@ -629,28 +708,32 @@ Handle<Object> ValueNode::Reify(LocalIsolate* isolate) {
   }
 }
 
-Handle<Object> ExternalConstant::DoReify(LocalIsolate* isolate) {
+Handle<Object> ExternalConstant::DoReify(LocalIsolate* isolate) const {
   UNREACHABLE();
 }
 
-Handle<Object> SmiConstant::DoReify(LocalIsolate* isolate) {
+Handle<Object> SmiConstant::DoReify(LocalIsolate* isolate) const {
   return handle(value_, isolate);
 }
 
-Handle<Object> Int32Constant::DoReify(LocalIsolate* isolate) {
+Handle<Object> TaggedIndexConstant::DoReify(LocalIsolate* isolate) const {
+  UNREACHABLE();
+}
+
+Handle<Object> Int32Constant::DoReify(LocalIsolate* isolate) const {
   return isolate->factory()->NewNumber<AllocationType::kOld>(value());
 }
 
-Handle<Object> Float64Constant::DoReify(LocalIsolate* isolate) {
+Handle<Object> Float64Constant::DoReify(LocalIsolate* isolate) const {
   return isolate->factory()->NewNumber<AllocationType::kOld>(
       value_.get_scalar());
 }
 
-Handle<Object> Constant::DoReify(LocalIsolate* isolate) {
+Handle<Object> Constant::DoReify(LocalIsolate* isolate) const {
   return object_.object();
 }
 
-Handle<Object> RootConstant::DoReify(LocalIsolate* isolate) {
+Handle<Object> RootConstant::DoReify(LocalIsolate* isolate) const {
   return isolate->root_handle(index());
 }
 
@@ -661,8 +744,8 @@ Handle<Object> RootConstant::DoReify(LocalIsolate* isolate) {
 namespace {
 template <typename NodeT>
 void LoadToRegisterHelper(NodeT* node, MaglevAssembler* masm, Register reg) {
-  if constexpr (NodeT::kProperties.value_representation() !=
-                ValueRepresentation::kFloat64) {
+  if constexpr (!IsDoubleRepresentation(
+                    NodeT::kProperties.value_representation())) {
     return node->DoLoadToRegister(masm, reg);
   } else {
     UNREACHABLE();
@@ -671,8 +754,8 @@ void LoadToRegisterHelper(NodeT* node, MaglevAssembler* masm, Register reg) {
 template <typename NodeT>
 void LoadToRegisterHelper(NodeT* node, MaglevAssembler* masm,
                           DoubleRegister reg) {
-  if constexpr (NodeT::kProperties.value_representation() ==
-                ValueRepresentation::kFloat64) {
+  if constexpr (IsDoubleRepresentation(
+                    NodeT::kProperties.value_representation())) {
     return node->DoLoadToRegister(masm, reg);
   } else {
     UNREACHABLE();
@@ -713,8 +796,8 @@ void ValueNode::DoLoadToRegister(MaglevAssembler* masm, Register reg) {
 void ValueNode::DoLoadToRegister(MaglevAssembler* masm, DoubleRegister reg) {
   DCHECK(is_spilled());
   DCHECK(use_double_register());
-  __ Move(reg,
-          masm->GetStackSlot(compiler::AllocatedOperand::cast(spill_slot())));
+  __ LoadFloat64(
+      reg, masm->GetStackSlot(compiler::AllocatedOperand::cast(spill_slot())));
 }
 
 void ExternalConstant::DoLoadToRegister(MaglevAssembler* masm, Register reg) {
@@ -725,6 +808,11 @@ void SmiConstant::DoLoadToRegister(MaglevAssembler* masm, Register reg) {
   __ Move(reg, value());
 }
 
+void TaggedIndexConstant::DoLoadToRegister(MaglevAssembler* masm,
+                                           Register reg) {
+  __ Move(reg, value());
+}
+
 void Int32Constant::DoLoadToRegister(MaglevAssembler* masm, Register reg) {
   __ Move(reg, value());
 }
@@ -754,6 +842,12 @@ void SmiConstant::SetValueLocationConstraints() { DefineAsConstant(this); }
 void SmiConstant::GenerateCode(MaglevAssembler* masm,
                                const ProcessingState& state) {}
 
+void TaggedIndexConstant::SetValueLocationConstraints() {
+  DefineAsConstant(this);
+}
+void TaggedIndexConstant::GenerateCode(MaglevAssembler* masm,
+                                       const ProcessingState& state) {}
+
 void Int32Constant::SetValueLocationConstraints() { DefineAsConstant(this); }
 void Int32Constant::GenerateCode(MaglevAssembler* masm,
                                  const ProcessingState& state) {}
@@ -770,20 +864,75 @@ void RootConstant::SetValueLocationConstraints() { DefineAsConstant(this); }
 void RootConstant::GenerateCode(MaglevAssembler* masm,
                                 const ProcessingState& state) {}
 
+InitialValue::InitialValue(uint64_t bitfield, interpreter::Register source)
+    : Base(bitfield), source_(source) {}
+
 void InitialValue::SetValueLocationConstraints() {
-  // TODO(leszeks): Make this nicer.
   result().SetUnallocated(compiler::UnallocatedOperand::FIXED_SLOT,
-                          (StandardFrameConstants::kExpressionsOffset -
-                           UnoptimizedFrameConstants::kRegisterFileFromFp) /
-                                  kSystemPointerSize +
-                              source().index(),
-                          kNoVreg);
+                          stack_slot(), kNoVreg);
 }
 void InitialValue::GenerateCode(MaglevAssembler* masm,
                                 const ProcessingState& state) {
   // No-op, the value is already in the appropriate slot.
 }
 
+// static
+uint32_t InitialValue::stack_slot(uint32_t register_index) {
+  // TODO(leszeks): Make this nicer.
+  return (StandardFrameConstants::kExpressionsOffset -
+          UnoptimizedFrameConstants::kRegisterFileFromFp) /
+             kSystemPointerSize +
+         register_index;
+}
+
+uint32_t InitialValue::stack_slot() const {
+  return stack_slot(source_.index());
+}
+
+int FunctionEntryStackCheck::MaxCallStackArgs() const { return 0; }
+void FunctionEntryStackCheck::SetValueLocationConstraints() {
+  set_temporaries_needed(2);
+  // kReturnRegister0 should not be one of the available temporary registers.
+  RequireSpecificTemporary(kReturnRegister0);
+}
+void FunctionEntryStackCheck::GenerateCode(MaglevAssembler* masm,
+                                           const ProcessingState& state) {
+  // Stack check. This folds the checks for both the interrupt stack limit
+  // check and the real stack limit into one by just checking for the
+  // interrupt limit. The interrupt limit is either equal to the real
+  // stack limit or tighter. By ensuring we have space until that limit
+  // after building the frame we can quickly precheck both at once.
+  const int stack_check_offset = masm->code_gen_state()->stack_check_offset();
+  // Only NewTarget can be live at this point.
+  DCHECK_LE(register_snapshot().live_registers.Count(), 1);
+  Builtin builtin =
+      register_snapshot().live_tagged_registers.has(
+          kJavaScriptCallNewTargetRegister)
+          ? Builtin::kMaglevFunctionEntryStackCheck_WithNewTarget
+          : Builtin::kMaglevFunctionEntryStackCheck_WithoutNewTarget;
+  ZoneLabelRef done(masm);
+  Condition cond = __ FunctionEntryStackCheck(stack_check_offset);
+  if (masm->isolate()->is_short_builtin_calls_enabled()) {
+    __ JumpIf(cond, *done, Label::kNear);
+    __ Move(kReturnRegister0, Smi::FromInt(stack_check_offset));
+    __ MacroAssembler::CallBuiltin(builtin);
+    masm->DefineLazyDeoptPoint(lazy_deopt_info());
+  } else {
+    __ JumpToDeferredIf(
+        NegateCondition(cond),
+        [](MaglevAssembler* masm, ZoneLabelRef done,
+           FunctionEntryStackCheck* node, Builtin builtin,
+           int stack_check_offset) {
+          __ Move(kReturnRegister0, Smi::FromInt(stack_check_offset));
+          __ MacroAssembler::CallBuiltin(builtin);
+          masm->DefineLazyDeoptPoint(node->lazy_deopt_info());
+          __ Jump(*done);
+        },
+        done, this, builtin, stack_check_offset);
+  }
+  __ bind(*done);
+}
+
 void RegisterInput::SetValueLocationConstraints() {
   DefineAsFixed(this, input());
 }
@@ -858,12 +1007,12 @@ void UnaryWithFeedbackNode<Derived, kOperation>::SetValueLocationConstraints() {
 template <class Derived, Operation kOperation>
 void UnaryWithFeedbackNode<Derived, kOperation>::GenerateCode(
     MaglevAssembler* masm, const ProcessingState& state) {
-  using D = UnaryOp_WithFeedbackDescriptor;
-  DCHECK_EQ(ToRegister(operand_input()), D::GetRegisterParameter(D::kValue));
-  __ Move(kContextRegister, masm->native_context().object());
-  __ Move(D::GetRegisterParameter(D::kSlot), feedback().index());
-  __ Move(D::GetRegisterParameter(D::kFeedbackVector), feedback().vector);
-  __ CallBuiltin(BuiltinFor(kOperation));
+  __ CallBuiltin<BuiltinFor(kOperation)>(
+      masm->native_context().object(),  // context
+      operand_input(),                  // value
+      feedback().index(),               // feedback slot
+      feedback().vector                 // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -879,13 +1028,13 @@ void BinaryWithFeedbackNode<Derived,
 template <class Derived, Operation kOperation>
 void BinaryWithFeedbackNode<Derived, kOperation>::GenerateCode(
     MaglevAssembler* masm, const ProcessingState& state) {
-  using D = BinaryOp_WithFeedbackDescriptor;
-  DCHECK_EQ(ToRegister(left_input()), D::GetRegisterParameter(D::kLeft));
-  DCHECK_EQ(ToRegister(right_input()), D::GetRegisterParameter(D::kRight));
-  __ Move(kContextRegister, masm->native_context().object());
-  __ Move(D::GetRegisterParameter(D::kSlot), feedback().index());
-  __ Move(D::GetRegisterParameter(D::kFeedbackVector), feedback().vector);
-  __ CallBuiltin(BuiltinFor(kOperation));
+  __ CallBuiltin<BuiltinFor(kOperation)>(
+      masm->native_context().object(),  // context
+      left_input(),                     // left
+      right_input(),                    // right
+      feedback().index(),               // feedback slot
+      feedback().vector                 // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -952,7 +1101,7 @@ void GapMove::GenerateCode(MaglevAssembler* masm,
       DCHECK(target().IsDoubleRegister());
       __ Move(ToDoubleRegister(target()), source_reg);
     } else {
-      __ Move(masm->ToMemOperand(target()), source_reg);
+      __ StoreFloat64(masm->ToMemOperand(target()), source_reg);
     }
   } else {
     DCHECK(source().IsAnyStackSlot());
@@ -960,7 +1109,7 @@ void GapMove::GenerateCode(MaglevAssembler* masm,
     if (target().IsRegister()) {
       __ MoveRepr(repr, ToRegister(target()), source_op);
     } else if (target().IsDoubleRegister()) {
-      __ Move(ToDoubleRegister(target()), source_op);
+      __ LoadFloat64(ToDoubleRegister(target()), source_op);
     } else {
       DCHECK(target().IsAnyStackSlot());
       __ MoveRepr(repr, masm->ToMemOperand(target()), source_op);
@@ -998,9 +1147,7 @@ void CheckedSmiUntag::GenerateCode(MaglevAssembler* masm,
   // TODO(leszeks): Consider optimizing away this test and using the carry bit
   // of the `sarl` for cases where the deopt uses the value from a different
   // register.
-  Condition is_smi = __ CheckSmi(value);
-  __ EmitEagerDeoptIf(NegateCondition(is_smi), DeoptimizeReason::kNotASmi,
-                      this);
+  __ EmitEagerDeoptIfNotSmi(this, value, DeoptimizeReason::kNotASmi);
   __ SmiToInt32(value);
 }
 
@@ -1016,274 +1163,855 @@ void UnsafeSmiUntag::GenerateCode(MaglevAssembler* masm,
   __ SmiToInt32(value);
 }
 
-int DeleteProperty::MaxCallStackArgs() const {
-  using D = CallInterfaceDescriptorFor<Builtin::kDeleteProperty>::type;
-  return D::GetStackParameterCount();
+void CheckInt32IsSmi::SetValueLocationConstraints() { UseRegister(input()); }
+void CheckInt32IsSmi::GenerateCode(MaglevAssembler* masm,
+                                   const ProcessingState& state) {
+  // We shouldn't be emitting this node for 32-bit Smis.
+  DCHECK(!SmiValuesAre32Bits());
+
+  // TODO(leszeks): This basically does a SmiTag and throws the result away.
+  // Don't throw the result away if we want to actually use it.
+  Register reg = ToRegister(input());
+  Label* fail = __ GetDeoptLabel(this, DeoptimizeReason::kNotASmi);
+  __ CheckInt32IsSmi(reg, fail);
 }
-void DeleteProperty::SetValueLocationConstraints() {
-  using D = CallInterfaceDescriptorFor<Builtin::kDeleteProperty>::type;
-  UseFixed(context(), kContextRegister);
-  UseFixed(object(), D::GetRegisterParameter(D::kObject));
-  UseFixed(key(), D::GetRegisterParameter(D::kKey));
-  DefineAsFixed(this, kReturnRegister0);
+
+void CheckedInt32ToUint32::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineSameAsFirst(this);
 }
-void DeleteProperty::GenerateCode(MaglevAssembler* masm,
-                                  const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kDeleteProperty>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object()), D::GetRegisterParameter(D::kObject));
-  DCHECK_EQ(ToRegister(key()), D::GetRegisterParameter(D::kKey));
-  __ Move(D::GetRegisterParameter(D::kLanguageMode),
-          Smi::FromInt(static_cast<int>(mode())));
-  __ CallBuiltin(Builtin::kDeleteProperty);
-  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+void CheckedInt32ToUint32::GenerateCode(MaglevAssembler* masm,
+                                        const ProcessingState& state) {
+  __ CompareInt32AndJumpIf(
+      ToRegister(input()), 0, kLessThan,
+      __ GetDeoptLabel(this, DeoptimizeReason::kNotUint32));
 }
 
-int ForInPrepare::MaxCallStackArgs() const {
-  using D = CallInterfaceDescriptorFor<Builtin::kForInPrepare>::type;
-  return D::GetStackParameterCount();
-}
-void ForInPrepare::SetValueLocationConstraints() {
-  using D = CallInterfaceDescriptorFor<Builtin::kForInPrepare>::type;
-  UseFixed(context(), kContextRegister);
-  UseFixed(enumerator(), D::GetRegisterParameter(D::kEnumerator));
-  DefineAsFixed(this, kReturnRegister0);
+void CheckHoleyFloat64IsSmi::SetValueLocationConstraints() {
+  UseRegister(input());
+  set_temporaries_needed(1);
 }
-void ForInPrepare::GenerateCode(MaglevAssembler* masm,
-                                const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kForInPrepare>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(enumerator()), D::GetRegisterParameter(D::kEnumerator));
-  __ Move(D::GetRegisterParameter(D::kVectorIndex),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kFeedbackVector), feedback().vector);
-  __ CallBuiltin(Builtin::kForInPrepare);
-  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+void CheckHoleyFloat64IsSmi::GenerateCode(MaglevAssembler* masm,
+                                          const ProcessingState& state) {
+  DoubleRegister value = ToDoubleRegister(input());
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+  Label* fail = __ GetDeoptLabel(this, DeoptimizeReason::kNotASmi);
+  __ TryTruncateDoubleToInt32(scratch, value, fail);
+  if (!SmiValuesAre32Bits()) {
+    __ CheckInt32IsSmi(scratch, fail, scratch);
+  }
 }
 
-int ForInNext::MaxCallStackArgs() const {
-  using D = CallInterfaceDescriptorFor<Builtin::kForInNext>::type;
-  return D::GetStackParameterCount();
-}
-void ForInNext::SetValueLocationConstraints() {
-  using D = CallInterfaceDescriptorFor<Builtin::kForInNext>::type;
-  UseFixed(context(), kContextRegister);
-  UseFixed(receiver(), D::GetRegisterParameter(D::kReceiver));
-  UseFixed(cache_array(), D::GetRegisterParameter(D::kCacheArray));
-  UseFixed(cache_type(), D::GetRegisterParameter(D::kCacheType));
-  UseFixed(cache_index(), D::GetRegisterParameter(D::kCacheIndex));
-  DefineAsFixed(this, kReturnRegister0);
+void CheckedSmiTagInt32::SetValueLocationConstraints() {
+  UseAndClobberRegister(input());
+  DefineSameAsFirst(this);
 }
-void ForInNext::GenerateCode(MaglevAssembler* masm,
-                             const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kForInNext>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(receiver()), D::GetRegisterParameter(D::kReceiver));
-  DCHECK_EQ(ToRegister(cache_array()), D::GetRegisterParameter(D::kCacheArray));
-  DCHECK_EQ(ToRegister(cache_type()), D::GetRegisterParameter(D::kCacheType));
-  DCHECK_EQ(ToRegister(cache_index()), D::GetRegisterParameter(D::kCacheIndex));
-  __ Move(D::GetRegisterParameter(D::kSlot), feedback().index());
-  // Feedback vector is pushed into the stack.
-  static_assert(D::GetStackParameterIndex(D::kFeedbackVector) == 0);
-  static_assert(D::GetStackParameterCount() == 1);
-  __ Push(feedback().vector);
-  __ CallBuiltin(Builtin::kForInNext);
-  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+void CheckedSmiTagInt32::GenerateCode(MaglevAssembler* masm,
+                                      const ProcessingState& state) {
+  Register reg = ToRegister(input());
+  Label* fail = __ GetDeoptLabel(this, DeoptimizeReason::kNotASmi);
+  // None of the mutated input registers should be a register input into the
+  // eager deopt info.
+  DCHECK_REGLIST_EMPTY(RegList{reg} &
+                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
+  __ SmiTagInt32AndJumpIfFail(reg, fail);
 }
 
-int GetIterator::MaxCallStackArgs() const {
-  using D = CallInterfaceDescriptorFor<Builtin::kGetIteratorWithFeedback>::type;
-  return D::GetStackParameterCount();
-}
-void GetIterator::SetValueLocationConstraints() {
-  using D = CallInterfaceDescriptorFor<Builtin::kGetIteratorWithFeedback>::type;
-  UseFixed(context(), kContextRegister);
-  UseFixed(receiver(), D::GetRegisterParameter(D::kReceiver));
-  DefineAsFixed(this, kReturnRegister0);
+void CheckedSmiTagUint32::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineSameAsFirst(this);
 }
-void GetIterator::GenerateCode(MaglevAssembler* masm,
-                               const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kGetIteratorWithFeedback>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(receiver()), D::GetRegisterParameter(D::kReceiver));
-  __ Move(D::GetRegisterParameter(D::kLoadSlot),
-          TaggedIndex::FromIntptr(load_slot()));
-  __ Move(D::GetRegisterParameter(D::kCallSlot),
-          TaggedIndex::FromIntptr(call_slot()));
-  __ Move(D::GetRegisterParameter(D::kMaybeFeedbackVector), feedback());
-  __ CallBuiltin(Builtin::kGetIteratorWithFeedback);
-  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+void CheckedSmiTagUint32::GenerateCode(MaglevAssembler* masm,
+                                       const ProcessingState& state) {
+  Register reg = ToRegister(input());
+  Label* fail = __ GetDeoptLabel(this, DeoptimizeReason::kNotASmi);
+  // None of the mutated input registers should be a register input into the
+  // eager deopt info.
+  DCHECK_REGLIST_EMPTY(RegList{reg} &
+                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
+  __ SmiTagUint32AndJumpIfFail(reg, fail);
 }
 
-template <class Derived, Operation kOperation>
-void Int32CompareNode<Derived, kOperation>::SetValueLocationConstraints() {
-  UseRegister(left_input());
-  UseRegister(right_input());
-  DefineAsRegister(this);
+void UnsafeSmiTag::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineSameAsFirst(this);
 }
-
-template <class Derived, Operation kOperation>
-void Int32CompareNode<Derived, kOperation>::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register result = ToRegister(this->result());
-  Label is_true, end;
-  __ CompareInt32AndJumpIf(ToRegister(left_input()), ToRegister(right_input()),
-                           ConditionFor(kOperation), &is_true,
-                           Label::Distance::kNear);
-  // TODO(leszeks): Investigate loading existing materialisations of roots here,
-  // if available.
-  __ LoadRoot(result, RootIndex::kFalseValue);
-  __ jmp(&end);
-  {
-    __ bind(&is_true);
-    __ LoadRoot(result, RootIndex::kTrueValue);
+void UnsafeSmiTag::GenerateCode(MaglevAssembler* masm,
+                                const ProcessingState& state) {
+  Register reg = ToRegister(input());
+  switch (input().node()->properties().value_representation()) {
+    case ValueRepresentation::kInt32:
+      __ UncheckedSmiTagInt32(reg);
+      break;
+    case ValueRepresentation::kUint32:
+      __ UncheckedSmiTagUint32(reg);
+      break;
+    default:
+      UNREACHABLE();
   }
-  __ bind(&end);
 }
 
-#define DEF_OPERATION(Name)                               \
-  void Name::SetValueLocationConstraints() {              \
-    Base::SetValueLocationConstraints();                  \
-  }                                                       \
-  void Name::GenerateCode(MaglevAssembler* masm,          \
-                          const ProcessingState& state) { \
-    Base::GenerateCode(masm, state);                      \
+namespace {
+
+void JumpToFailIfNotHeapNumberOrOddball(
+    MaglevAssembler* masm, Register value,
+    TaggedToFloat64ConversionType conversion_type, Label* fail) {
+  switch (conversion_type) {
+    case TaggedToFloat64ConversionType::kNumberOrOddball:
+      // Check if HeapNumber or Oddball, jump to fail otherwise.
+      static_assert(InstanceType::HEAP_NUMBER_TYPE + 1 ==
+                    InstanceType::ODDBALL_TYPE);
+      if (fail) {
+        __ CompareObjectTypeRange(value, InstanceType::HEAP_NUMBER_TYPE,
+                                  InstanceType::ODDBALL_TYPE);
+        __ JumpIf(kUnsignedGreaterThan, fail);
+      } else {
+        if (v8_flags.debug_code) {
+          __ CompareObjectTypeRange(value, InstanceType::HEAP_NUMBER_TYPE,
+                                    InstanceType::ODDBALL_TYPE);
+          __ Assert(kUnsignedLessThanEqual, AbortReason::kUnexpectedValue);
+        }
+      }
+      break;
+    case TaggedToFloat64ConversionType::kOnlyNumber:
+      // Check if HeapNumber, jump to fail otherwise.
+      if (fail) {
+        __ IsObjectType(value, InstanceType::HEAP_NUMBER_TYPE);
+        __ JumpIf(kNotEqual, fail);
+      } else {
+        if (v8_flags.debug_code) {
+          __ IsObjectType(value, InstanceType::HEAP_NUMBER_TYPE);
+          __ Assert(kEqual, AbortReason::kUnexpectedValue);
+        }
+      }
+      break;
   }
-DEF_OPERATION(Int32Equal)
-DEF_OPERATION(Int32StrictEqual)
-DEF_OPERATION(Int32LessThan)
-DEF_OPERATION(Int32LessThanOrEqual)
-DEF_OPERATION(Int32GreaterThan)
-DEF_OPERATION(Int32GreaterThanOrEqual)
-#undef DEF_OPERATION
+}
 
-void LoadDoubleField::SetValueLocationConstraints() {
-  UseRegister(object_input());
+void TryUnboxNumberOrOddball(MaglevAssembler* masm, DoubleRegister dst,
+                             Register clobbered_src,
+                             TaggedToFloat64ConversionType conversion_type,
+                             Label* fail) {
+  Label is_not_smi, done;
+  // Check if Smi.
+  __ JumpIfNotSmi(clobbered_src, &is_not_smi, Label::kNear);
+  // If Smi, convert to Float64.
+  __ SmiToInt32(clobbered_src);
+  __ Int32ToDouble(dst, clobbered_src);
+  __ Jump(&done, Label::kNear);
+  __ bind(&is_not_smi);
+  JumpToFailIfNotHeapNumberOrOddball(masm, clobbered_src, conversion_type,
+                                     fail);
+  static_assert(HeapNumber::kValueOffset == Oddball::kToNumberRawOffset);
+  __ LoadHeapNumberValue(dst, clobbered_src);
+  __ bind(&done);
+}
+
+}  // namespace
+
+void CheckedNumberOrOddballToFloat64::SetValueLocationConstraints() {
+  UseAndClobberRegister(input());
   DefineAsRegister(this);
-  set_temporaries_needed(1);
 }
-void LoadDoubleField::GenerateCode(MaglevAssembler* masm,
-                                   const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register tmp = temps.Acquire();
-  Register object = ToRegister(object_input());
-  __ AssertNotSmi(object);
-  __ DecompressTagged(tmp, FieldMemOperand(object, offset()));
-  __ AssertNotSmi(tmp);
-  __ LoadHeapNumberValue(ToDoubleRegister(result()), tmp);
+void CheckedNumberOrOddballToFloat64::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  Register value = ToRegister(input());
+  TryUnboxNumberOrOddball(
+      masm, ToDoubleRegister(result()), value, conversion_type(),
+      __ GetDeoptLabel(this, DeoptimizeReason::kNotANumberOrOddball));
 }
 
-void LoadTaggedField::SetValueLocationConstraints() {
-  UseRegister(object_input());
+void UncheckedNumberOrOddballToFloat64::SetValueLocationConstraints() {
+  UseAndClobberRegister(input());
   DefineAsRegister(this);
 }
-void LoadTaggedField::GenerateCode(MaglevAssembler* masm,
-                                   const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  __ AssertNotSmi(object);
-  if (this->decompresses_tagged_result()) {
-    __ LoadTaggedField(ToRegister(result()), object, offset());
-  } else {
-    __ LoadTaggedFieldWithoutDecompressing(ToRegister(result()), object,
-                                           offset());
-  }
+void UncheckedNumberOrOddballToFloat64::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  Register value = ToRegister(input());
+  TryUnboxNumberOrOddball(masm, ToDoubleRegister(result()), value,
+                          conversion_type(), nullptr);
 }
 
-void LoadTaggedFieldByFieldIndex::SetValueLocationConstraints() {
+namespace {
+
+void EmitTruncateNumberOrOddballToInt32(
+    MaglevAssembler* masm, Register value, Register result_reg,
+    TaggedToFloat64ConversionType conversion_type, Label* not_a_number) {
+  Label is_not_smi, done;
+  // Check if Smi.
+  __ JumpIfNotSmi(value, &is_not_smi, Label::kNear);
+  // If Smi, convert to Int32.
+  __ SmiToInt32(value);
+  __ Jump(&done, Label::kNear);
+  __ bind(&is_not_smi);
+  JumpToFailIfNotHeapNumberOrOddball(masm, value, conversion_type,
+                                     not_a_number);
+  static_assert(HeapNumber::kValueOffset == Oddball::kToNumberRawOffset);
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  DoubleRegister double_value = temps.GetDefaultScratchDoubleRegister();
+  __ LoadHeapNumberValue(double_value, value);
+  __ TruncateDoubleToInt32(result_reg, double_value);
+  __ bind(&done);
+}
+
+}  // namespace
+
+void CheckedObjectToIndex::SetValueLocationConstraints() {
   UseRegister(object_input());
-  UseAndClobberRegister(index_input());
   DefineAsRegister(this);
-  set_temporaries_needed(1);
   set_double_temporaries_needed(1);
 }
-void LoadTaggedFieldByFieldIndex::GenerateCode(MaglevAssembler* masm,
-                                               const ProcessingState& state) {
+void CheckedObjectToIndex::GenerateCode(MaglevAssembler* masm,
+                                        const ProcessingState& state) {
   Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
   Register result_reg = ToRegister(result());
-  __ AssertNotSmi(object);
-  __ AssertSmi(index);
-
   ZoneLabelRef done(masm);
+  __ JumpIfNotSmi(
+      object,
+      __ MakeDeferredCode(
+          [](MaglevAssembler* masm, Register object, Register result_reg,
+             ZoneLabelRef done, CheckedObjectToIndex* node) {
+            MaglevAssembler::ScratchRegisterScope temps(masm);
+            Register map = temps.GetDefaultScratchRegister();
+            Label check_string;
+            __ LoadMap(map, object);
+            __ JumpIfNotRoot(
+                map, RootIndex::kHeapNumberMap, &check_string,
+                v8_flags.deopt_every_n_times > 0 ? Label::kFar : Label::kNear);
+            {
+              DoubleRegister number_value = temps.AcquireDouble();
+              __ LoadHeapNumberValue(number_value, object);
+              __ TryChangeFloat64ToIndex(
+                  result_reg, number_value, *done,
+                  __ GetDeoptLabel(node, DeoptimizeReason::kNotInt32));
+            }
+            __ bind(&check_string);
+            __ CompareInstanceTypeRange(map, map, FIRST_STRING_TYPE,
+                                        LAST_STRING_TYPE);
+            // The IC will go generic if it encounters something other than a
+            // Number or String key.
+            __ EmitEagerDeoptIf(kUnsignedGreaterThan,
+                                DeoptimizeReason::kNotInt32, node);
+            {
+              // TODO(verwaest): Load the cached number from the string hash.
+              RegisterSnapshot snapshot = node->register_snapshot();
+              snapshot.live_registers.clear(result_reg);
+              DCHECK(!snapshot.live_tagged_registers.has(result_reg));
+              {
+                SaveRegisterStateForCall save_register_state(masm, snapshot);
+                AllowExternalCallThatCantCauseGC scope(masm);
+                __ PrepareCallCFunction(1);
+                __ Move(arg_reg_1, object);
+                __ CallCFunction(
+                    ExternalReference::string_to_array_index_function(), 1);
+                // No need for safepoint since this is a fast C call.
+                __ Move(result_reg, kReturnRegister0);
+              }
+              __ CompareInt32AndJumpIf(
+                  result_reg, 0, kLessThan,
+                  __ GetDeoptLabel(node, DeoptimizeReason::kNotInt32));
+              __ Jump(*done);
+            }
+          },
+          object, result_reg, done, this));
 
-  // For in-object properties, the index is encoded as:
+  // If we didn't enter the deferred block, we're a Smi.
+  __ SmiToInt32(result_reg, object);
+  __ bind(*done);
+}
+
+void CheckedTruncateNumberOrOddballToInt32::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineSameAsFirst(this);
+}
+void CheckedTruncateNumberOrOddballToInt32::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  Register value = ToRegister(input());
+  Register result_reg = ToRegister(result());
+  DCHECK_EQ(value, result_reg);
+  Label* deopt_label =
+      __ GetDeoptLabel(this, DeoptimizeReason::kNotANumberOrOddball);
+  EmitTruncateNumberOrOddballToInt32(masm, value, result_reg, conversion_type(),
+                                     deopt_label);
+}
+
+void TruncateNumberOrOddballToInt32::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineSameAsFirst(this);
+}
+void TruncateNumberOrOddballToInt32::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  Register value = ToRegister(input());
+  Register result_reg = ToRegister(result());
+  DCHECK_EQ(value, result_reg);
+  EmitTruncateNumberOrOddballToInt32(masm, value, result_reg, conversion_type(),
+                                     nullptr);
+}
+
+void ChangeInt32ToFloat64::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineAsRegister(this);
+}
+void ChangeInt32ToFloat64::GenerateCode(MaglevAssembler* masm,
+                                        const ProcessingState& state) {
+  __ Int32ToDouble(ToDoubleRegister(result()), ToRegister(input()));
+}
+
+void ChangeUint32ToFloat64::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineAsRegister(this);
+}
+void ChangeUint32ToFloat64::GenerateCode(MaglevAssembler* masm,
+                                         const ProcessingState& state) {
+  __ Uint32ToDouble(ToDoubleRegister(result()), ToRegister(input()));
+}
+
+void CheckMaps::SetValueLocationConstraints() {
+  UseRegister(receiver_input());
+  set_temporaries_needed(MapCompare::TemporaryCount(maps_.size()));
+}
+
+void CheckMaps::GenerateCode(MaglevAssembler* masm,
+                             const ProcessingState& state) {
+  Register object = ToRegister(receiver_input());
+
+  // We emit an unconditional deopt if we intersect the map sets and the
+  // intersection is empty.
+  DCHECK(!maps().is_empty());
+
+  bool maps_include_heap_number = AnyMapIsHeapNumber(maps());
+
+  // Exprimentally figured out map limit (with slack) which allows us to use
+  // near jumps in the code below
+  constexpr int kMapCountForNearJumps = kTaggedSize == 4 ? 10 : 5;
+  Label::Distance jump_distance = maps().size() <= kMapCountForNearJumps
+                                      ? Label::Distance::kNear
+                                      : Label::Distance::kFar;
+
+  Label done;
+  if (check_type() == CheckType::kOmitHeapObjectCheck) {
+    __ AssertNotSmi(object);
+  } else {
+    if (maps_include_heap_number) {
+      // Smis count as matching the HeapNumber map, so we're done.
+      __ JumpIfSmi(object, &done, jump_distance);
+    } else {
+      __ EmitEagerDeoptIfSmi(this, object, DeoptimizeReason::kWrongMap);
+    }
+  }
+
+  MapCompare map_compare(masm, object, maps_.size());
+  size_t map_count = maps().size();
+  for (size_t i = 0; i < map_count - 1; ++i) {
+    Handle<Map> map = maps().at(i).object();
+    map_compare.Generate(map);
+    __ JumpIf(kEqual, &done, jump_distance);
+  }
+  Handle<Map> last_map = maps().at(map_count - 1).object();
+  map_compare.Generate(last_map);
+  __ EmitEagerDeoptIfNotEqual(DeoptimizeReason::kWrongMap, this);
+  __ bind(&done);
+}
+
+int CheckMapsWithMigration::MaxCallStackArgs() const {
+  DCHECK_EQ(Runtime::FunctionForId(Runtime::kTryMigrateInstance)->nargs, 1);
+  return 1;
+}
+
+void CheckMapsWithMigration::SetValueLocationConstraints() {
+  UseRegister(receiver_input());
+  set_temporaries_needed(MapCompare::TemporaryCount(maps_.size()));
+}
+
+void CheckMapsWithMigration::GenerateCode(MaglevAssembler* masm,
+                                          const ProcessingState& state) {
+  // We emit an unconditional deopt if we intersect the map sets and the
+  // intersection is empty.
+  DCHECK(!maps().is_empty());
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register object = ToRegister(receiver_input());
+
+  bool maps_include_heap_number = AnyMapIsHeapNumber(maps());
+
+  ZoneLabelRef map_checks(masm), done(masm);
+
+  if (check_type() == CheckType::kOmitHeapObjectCheck) {
+    __ AssertNotSmi(object);
+  } else {
+    if (maps_include_heap_number) {
+      // Smis count as matching the HeapNumber map, so we're done.
+      __ JumpIfSmi(object, *done);
+    } else {
+      __ EmitEagerDeoptIfSmi(this, object, DeoptimizeReason::kWrongMap);
+    }
+  }
+
+  // If we jump from here from the deferred code (below), we need to reload
+  // the map.
+  __ bind(*map_checks);
+
+  RegisterSnapshot save_registers = register_snapshot();
+  // Make sure that the object register is not clobbered by the
+  // Runtime::kMigrateInstance runtime call. It's ok to clobber the register
+  // where the object map is, since the map is reloaded after the runtime call.
+  save_registers.live_registers.set(object);
+  save_registers.live_tagged_registers.set(object);
+
+  // We can eager deopt after the snapshot, so make sure the nodes used by the
+  // deopt are included in it.
+  // TODO(leszeks): This is a bit of a footgun -- we likely want the snapshot to
+  // always include eager deopt input registers.
+  AddDeoptRegistersToSnapshot(&save_registers, eager_deopt_info());
+
+  size_t map_count = maps().size();
+  bool has_migration_targets = false;
+  MapCompare map_compare(masm, object, maps_.size());
+  for (size_t i = 0; i < map_count; ++i) {
+    Handle<Map> map_handle = maps().at(i).object();
+    map_compare.Generate(map_handle);
+    const bool last_map = (i == map_count - 1);
+    if (!last_map) {
+      __ JumpIf(kEqual, *done);
+    }
+    if (map_handle->is_migration_target()) {
+      has_migration_targets = true;
+    }
+  }
+
+  if (!has_migration_targets) {
+    // Emit deopt for the last map.
+    __ EmitEagerDeoptIf(kNotEqual, DeoptimizeReason::kWrongMap, this);
+  } else {
+    __ JumpToDeferredIf(
+        kNotEqual,
+        [](MaglevAssembler* masm, RegisterSnapshot register_snapshot,
+           ZoneLabelRef map_checks, MapCompare map_compare,
+           CheckMapsWithMigration* node) {
+          Label* deopt = __ GetDeoptLabel(node, DeoptimizeReason::kWrongMap);
+          // If the map is not deprecated, we fail the map check.
+          __ TestInt32AndJumpIfAllClear(
+              FieldMemOperand(map_compare.GetMap(), Map::kBitField3Offset),
+              Map::Bits3::IsDeprecatedBit::kMask, deopt);
+
+          // Otherwise, try migrating the object.
+          Register return_val = Register::no_reg();
+          {
+            SaveRegisterStateForCall save_register_state(masm,
+                                                         register_snapshot);
+
+            __ Push(map_compare.GetObject());
+            __ Move(kContextRegister, masm->native_context().object());
+            __ CallRuntime(Runtime::kTryMigrateInstance);
+            save_register_state.DefineSafepoint();
+
+            // Make sure the return value is preserved across the live
+            // register restoring pop all.
+            return_val = kReturnRegister0;
+            MaglevAssembler::ScratchRegisterScope temps(masm);
+            Register scratch = temps.GetDefaultScratchRegister();
+            if (register_snapshot.live_registers.has(return_val)) {
+              DCHECK(!register_snapshot.live_registers.has(scratch));
+              __ Move(scratch, return_val);
+              return_val = scratch;
+            }
+          }
+
+          // On failure, the returned value is Smi zero.
+          __ CompareTaggedAndJumpIf(return_val, Smi::zero(), kEqual, deopt);
+
+          // Otherwise, the return value is the object (it's always the same
+          // object we called TryMigrate with). We already have it in a
+          // register, so we can ignore the return value. We'll need to reload
+          // the map though since it might have changed; it's done right after
+          // the map_checks label.
+          __ Jump(*map_checks);
+        },
+        save_registers, map_checks, map_compare, this);
+    // If the jump to deferred code was not taken, the map was equal to the
+    // last map.
+  }  // End of the `has_migration_targets` case.
+  __ bind(*done);
+}
+
+int DeleteProperty::MaxCallStackArgs() const {
+  using D = CallInterfaceDescriptorFor<Builtin::kDeleteProperty>::type;
+  return D::GetStackParameterCount();
+}
+void DeleteProperty::SetValueLocationConstraints() {
+  using D = CallInterfaceDescriptorFor<Builtin::kDeleteProperty>::type;
+  UseFixed(context(), kContextRegister);
+  UseFixed(object(), D::GetRegisterParameter(D::kObject));
+  UseFixed(key(), D::GetRegisterParameter(D::kKey));
+  DefineAsFixed(this, kReturnRegister0);
+}
+void DeleteProperty::GenerateCode(MaglevAssembler* masm,
+                                  const ProcessingState& state) {
+  __ CallBuiltin<Builtin::kDeleteProperty>(
+      context(),                              // context
+      object(),                               // object
+      key(),                                  // key
+      Smi::FromInt(static_cast<int>(mode()))  // language mode
+  );
+  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+}
+
+int ForInPrepare::MaxCallStackArgs() const {
+  using D = CallInterfaceDescriptorFor<Builtin::kForInPrepare>::type;
+  return D::GetStackParameterCount();
+}
+void ForInPrepare::SetValueLocationConstraints() {
+  using D = CallInterfaceDescriptorFor<Builtin::kForInPrepare>::type;
+  UseFixed(context(), kContextRegister);
+  UseFixed(enumerator(), D::GetRegisterParameter(D::kEnumerator));
+  DefineAsFixed(this, kReturnRegister0);
+}
+void ForInPrepare::GenerateCode(MaglevAssembler* masm,
+                                const ProcessingState& state) {
+  __ CallBuiltin<Builtin::kForInPrepare>(
+      context(),                                    // context
+      enumerator(),                                 // enumerator
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
+  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+}
+
+int ForInNext::MaxCallStackArgs() const {
+  using D = CallInterfaceDescriptorFor<Builtin::kForInNext>::type;
+  return D::GetStackParameterCount();
+}
+void ForInNext::SetValueLocationConstraints() {
+  using D = CallInterfaceDescriptorFor<Builtin::kForInNext>::type;
+  UseFixed(context(), kContextRegister);
+  UseFixed(receiver(), D::GetRegisterParameter(D::kReceiver));
+  UseFixed(cache_array(), D::GetRegisterParameter(D::kCacheArray));
+  UseFixed(cache_type(), D::GetRegisterParameter(D::kCacheType));
+  UseFixed(cache_index(), D::GetRegisterParameter(D::kCacheIndex));
+  DefineAsFixed(this, kReturnRegister0);
+}
+void ForInNext::GenerateCode(MaglevAssembler* masm,
+                             const ProcessingState& state) {
+  __ CallBuiltin<Builtin::kForInNext>(context(),           // context
+                                      feedback().index(),  // feedback slot
+                                      receiver(),          // receiver
+                                      cache_array(),       // cache array
+                                      cache_type(),        // cache type
+                                      cache_index(),       // cache index
+                                      feedback().vector    // feedback vector
+  );
+  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+}
+
+int GetIterator::MaxCallStackArgs() const {
+  using D = CallInterfaceDescriptorFor<Builtin::kGetIteratorWithFeedback>::type;
+  return D::GetStackParameterCount();
+}
+void GetIterator::SetValueLocationConstraints() {
+  using D = CallInterfaceDescriptorFor<Builtin::kGetIteratorWithFeedback>::type;
+  UseFixed(context(), kContextRegister);
+  UseFixed(receiver(), D::GetRegisterParameter(D::kReceiver));
+  DefineAsFixed(this, kReturnRegister0);
+}
+void GetIterator::GenerateCode(MaglevAssembler* masm,
+                               const ProcessingState& state) {
+  __ CallBuiltin<Builtin::kGetIteratorWithFeedback>(
+      context(),                             // context
+      receiver(),                            // receiver
+      TaggedIndex::FromIntptr(load_slot()),  // feedback load slot
+      TaggedIndex::FromIntptr(call_slot()),  // feedback call slot
+      feedback()                             // feedback vector
+  );
+  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+}
+
+void Int32Compare::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+}
+
+void Int32Compare::GenerateCode(MaglevAssembler* masm,
+                                const ProcessingState& state) {
+  Register result = ToRegister(this->result());
+  Label is_true, end;
+  __ CompareInt32AndJumpIf(ToRegister(left_input()), ToRegister(right_input()),
+                           ConditionFor(operation()), &is_true,
+                           Label::Distance::kNear);
+  // TODO(leszeks): Investigate loading existing materialisations of roots here,
+  // if available.
+  __ LoadRoot(result, RootIndex::kFalseValue);
+  __ jmp(&end);
+  {
+    __ bind(&is_true);
+    __ LoadRoot(result, RootIndex::kTrueValue);
+  }
+  __ bind(&end);
+}
+
+void Int32ToBoolean::SetValueLocationConstraints() {
+  UseRegister(value());
+  DefineAsRegister(this);
+}
+
+void Int32ToBoolean::GenerateCode(MaglevAssembler* masm,
+                                  const ProcessingState& state) {
+  Register result = ToRegister(this->result());
+  Label is_true, end;
+  __ CompareInt32AndJumpIf(ToRegister(value()), 0, kNotEqual, &is_true,
+                           Label::Distance::kNear);
+  // TODO(leszeks): Investigate loading existing materialisations of roots here,
+  // if available.
+  __ LoadRoot(result, flip() ? RootIndex::kTrueValue : RootIndex::kFalseValue);
+  __ jmp(&end);
+  {
+    __ bind(&is_true);
+    __ LoadRoot(result,
+                flip() ? RootIndex::kFalseValue : RootIndex::kTrueValue);
+  }
+  __ bind(&end);
+}
+
+void Float64Compare::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+  DefineAsRegister(this);
+}
+
+void Float64Compare::GenerateCode(MaglevAssembler* masm,
+                                  const ProcessingState& state) {
+  DoubleRegister left = ToDoubleRegister(left_input());
+  DoubleRegister right = ToDoubleRegister(right_input());
+  Register result = ToRegister(this->result());
+  Label is_false, end;
+  __ CompareFloat64(left, right);
+  // Ucomisd sets these flags accordingly:
+  //   UNORDERED(one of the operands is a NaN): ZF,PF,CF := 111;
+  //   GREATER_THAN: ZF,PF,CF := 000;
+  //   LESS_THAN: ZF,PF,CF := 001;
+  //   EQUAL: ZF,PF,CF := 100;
+  // Since ZF can be set by NaN or EQUAL, we check for NaN first.
+  __ JumpIf(ConditionForNaN(), &is_false);
+  __ JumpIf(NegateCondition(ConditionForFloat64(operation())), &is_false);
+  // TODO(leszeks): Investigate loading existing materialisations of roots here,
+  // if available.
+  __ LoadRoot(result, RootIndex::kTrueValue);
+  __ Jump(&end);
+  {
+    __ bind(&is_false);
+    __ LoadRoot(result, RootIndex::kFalseValue);
+  }
+  __ bind(&end);
+}
+
+void Float64ToBoolean::SetValueLocationConstraints() {
+  UseRegister(value());
+  set_double_temporaries_needed(1);
+  DefineAsRegister(this);
+}
+void Float64ToBoolean::GenerateCode(MaglevAssembler* masm,
+                                    const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  DoubleRegister double_scratch = temps.AcquireDouble();
+  Register result = ToRegister(this->result());
+  Label is_false, end;
+
+  __ Move(double_scratch, 0.0);
+  __ CompareFloat64(ToDoubleRegister(value()), double_scratch);
+  __ JumpIf(ConditionForNaN(), &is_false);
+  __ JumpIf(kEqual, &is_false);
+
+  __ LoadRoot(result, flip() ? RootIndex::kFalseValue : RootIndex::kTrueValue);
+  __ Jump(&end);
+  {
+    __ bind(&is_false);
+    __ LoadRoot(result,
+                flip() ? RootIndex::kTrueValue : RootIndex::kFalseValue);
+  }
+  __ bind(&end);
+}
+
+void CheckedHoleyFloat64ToFloat64::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineSameAsFirst(this);
+  set_temporaries_needed(1);
+}
+void CheckedHoleyFloat64ToFloat64::GenerateCode(MaglevAssembler* masm,
+                                                const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  __ JumpIfHoleNan(ToDoubleRegister(input()), temps.Acquire(),
+                   __ GetDeoptLabel(this, DeoptimizeReason::kHole));
+}
+
+void LoadDoubleField::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  DefineAsRegister(this);
+  set_temporaries_needed(1);
+}
+void LoadDoubleField::GenerateCode(MaglevAssembler* masm,
+                                   const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register tmp = temps.Acquire();
+  Register object = ToRegister(object_input());
+  __ AssertNotSmi(object);
+  __ LoadTaggedField(tmp, object, offset());
+  __ AssertNotSmi(tmp);
+  __ LoadHeapNumberValue(ToDoubleRegister(result()), tmp);
+}
+
+void LoadTaggedField::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  DefineAsRegister(this);
+}
+void LoadTaggedField::GenerateCode(MaglevAssembler* masm,
+                                   const ProcessingState& state) {
+  Register object = ToRegister(object_input());
+  __ AssertNotSmi(object);
+  if (this->decompresses_tagged_result()) {
+    __ LoadTaggedField(ToRegister(result()), object, offset());
+  } else {
+    __ LoadTaggedFieldWithoutDecompressing(ToRegister(result()), object,
+                                           offset());
+  }
+}
+
+void LoadTaggedFieldByFieldIndex::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  UseAndClobberRegister(index_input());
+  DefineAsRegister(this);
+  set_temporaries_needed(1);
+  set_double_temporaries_needed(1);
+}
+void LoadTaggedFieldByFieldIndex::GenerateCode(MaglevAssembler* masm,
+                                               const ProcessingState& state) {
+  Register object = ToRegister(object_input());
+  Register field_index = ToRegister(index_input());
+  Register result_reg = ToRegister(result());
+  __ AssertNotSmi(object);
+  __ AssertSmi(field_index);
+
+  ZoneLabelRef done(masm);
+
+  // For in-object properties, the field_index is encoded as:
   //
-  //      index = actual_index | is_double_bit | smi_tag_bit
-  //            = actual_index << 2 | is_double_bit << 1
+  //      field_index = array_index | is_double_bit | smi_tag
+  //                  = array_index << (1+kSmiTagBits)
+  //                        + is_double_bit << kSmiTagBits
   //
   // The value we want is at the field offset:
   //
-  //      (actual_index << kTaggedSizeLog2) + JSObject::kHeaderSize
+  //      (array_index << kTaggedSizeLog2) + JSObject::kHeaderSize
+  //
+  // We could get field_index from array_index by shifting away the double bit
+  // and smi tag, followed by shifting back up again, but this means shifting
+  // twice:
+  //
+  //      ((field_index >> kSmiTagBits >> 1) << kTaggedSizeLog2
+  //          + JSObject::kHeaderSize
   //
-  // We could get index from actual_index by shifting away the double and smi
-  // bits. But, note that `kTaggedSizeLog2 == 2` and `index` encodes
-  // `actual_index` with a two bit shift. So, we can do some rearranging
-  // to get the offset without shifting:
+  // Instead, we can do some rearranging to get the offset with either a single
+  // small shift, or no shift at all:
   //
-  //      ((index >> 2) << kTaggedSizeLog2 + JSObject::kHeaderSize
+  //      (array_index << kTaggedSizeLog2) + JSObject::kHeaderSize
   //
-  //    [Expand definitions of index and kTaggedSizeLog2]
-  //    = (((actual_index << 2 | is_double_bit << 1) >> 2) << 2)
-  //           + JSObject::kHeaderSize
+  //    [Split shift to match array_index component of field_index]
+  //    = (
+  //        (array_index << 1+kSmiTagBits)) << (kTaggedSizeLog2-1-kSmiTagBits)
+  //      ) + JSObject::kHeaderSize
   //
-  //    [Cancel out shift down and shift up, clear is_double bit by subtracting]
-  //    = (actual_index << 2 | is_double_bit << 1) - (is_double_bit << 1)
-  //           + JSObject::kHeaderSize
+  //    [Substitute in field_index]
+  //    = (
+  //        (field_index - is_double_bit << kSmiTagBits)
+  //           << (kTaggedSizeLog2-1-kSmiTagBits)
+  //      ) + JSObject::kHeaderSize
   //
-  //    [Fold together the constants, and collapse definition of index]
-  //    = index + (JSObject::kHeaderSize - (is_double_bit << 1))
+  //    [Fold together the constants]
+  //    = (field_index << (kTaggedSizeLog2-1-kSmiTagBits)
+  //          + (JSObject::kHeaderSize - (is_double_bit << (kTaggedSizeLog2-1)))
+  //
+  // Note that this results in:
   //
+  //     * No shift when kSmiTagBits == kTaggedSizeLog2 - 1, which is the case
+  //       when pointer compression is on.
+  //     * A shift of 1 when kSmiTagBits == 1 and kTaggedSizeLog2 == 3, which
+  //       is the case when pointer compression is off but Smis are 31 bit.
+  //     * A shift of 2 when kSmiTagBits == 0 and kTaggedSizeLog2 == 3, which
+  //       is the case when pointer compression is off, Smis are 32 bit, and
+  //       the Smi was untagged to int32 already.
+  //
+  // These shifts are small enough to encode in the load operand.
   //
   // For out-of-object properties, the encoding is:
   //
-  //     index = (-1 - actual_index) | is_double_bit | smi_tag_bit
-  //           = (-1 - actual_index) << 2 | is_double_bit << 1
-  //           = (-1 - actual_index) * 4 + (is_double_bit ? 2 : 0)
-  //           = -(actual_index * 4) + (is_double_bit ? 2 : 0) - 4
-  //           = -(actual_index << 2) + (is_double_bit ? 2 : 0) - 4
+  //     field_index = (-1 - array_index) | is_double_bit | smi_tag
+  //                 = (-1 - array_index) << (1+kSmiTagBits)
+  //                       + is_double_bit << kSmiTagBits
+  //                 = -array_index << (1+kSmiTagBits)
+  //                       - 1 << (1+kSmiTagBits) + is_double_bit << kSmiTagBits
+  //                 = -array_index << (1+kSmiTagBits)
+  //                       - 2 << kSmiTagBits + is_double_bit << kSmiTagBits
+  //                 = -array_index << (1+kSmiTagBits)
+  //                       (is_double_bit - 2) << kSmiTagBits
   //
   // The value we want is in the property array at offset:
   //
-  //      (actual_index << kTaggedSizeLog2) + FixedArray::kHeaderSize
+  //      (array_index << kTaggedSizeLog2) + FixedArray::kHeaderSize
   //
-  //    [Expand definition of kTaggedSizeLog2]
-  //    = (actual_index << 2) + FixedArray::kHeaderSize
+  //    [Split shift to match array_index component of field_index]
+  //    = (array_index << (1+kSmiTagBits)) << (kTaggedSizeLog2-1-kSmiTagBits)
+  //        + FixedArray::kHeaderSize
   //
-  //    [Substitute in index]
-  //    = (-index + (is_double_bit ? 2 : 0) - 4) + FixedArray::kHeaderSize
+  //    [Substitute in field_index]
+  //    = (-field_index - (is_double_bit - 2) << kSmiTagBits)
+  //        << (kTaggedSizeLog2-1-kSmiTagBits)
+  //        + FixedArray::kHeaderSize
   //
   //    [Fold together the constants]
-  //    = -index + (FixedArray::kHeaderSize + (is_double_bit ? 2 : 0) - 4))
+  //    = -field_index << (kTaggedSizeLog2-1-kSmiTagBits)
+  //        + FixedArray::kHeaderSize
+  //        - (is_double_bit - 2) << (kTaggedSizeLog2-1))
   //
-  // This allows us to simply negate the index register and do a load with
-  // otherwise constant offset.
+  // This allows us to simply negate the field_index register and do a load with
+  // otherwise constant offset and the same scale factor as for in-object
+  // properties.
+
+  static constexpr int kSmiTagBitsInValue = SmiValuesAre32Bits() ? 0 : 1;
+  static_assert(kSmiTagBitsInValue == 32 - kSmiValueSize);
+  if (SmiValuesAre32Bits()) {
+    __ SmiUntag(field_index);
+  }
+
+  static constexpr int scale = 1 << (kTaggedSizeLog2 - 1 - kSmiTagBitsInValue);
 
   // Check if field is a mutable double field.
-  static constexpr int32_t kIsDoubleBitMask = 1 << kSmiTagSize;
+  static constexpr int32_t kIsDoubleBitMask = 1 << kSmiTagBitsInValue;
   __ TestInt32AndJumpIfAnySet(
-      index, kIsDoubleBitMask,
+      field_index, kIsDoubleBitMask,
       __ MakeDeferredCode(
-          [](MaglevAssembler* masm, Register object, Register index,
+          [](MaglevAssembler* masm, Register object, Register field_index,
              Register result_reg, RegisterSnapshot register_snapshot,
              ZoneLabelRef done) {
             // The field is a Double field, a.k.a. a mutable HeapNumber.
-            static const int kIsDoubleBit = 1;
+            static constexpr int kIsDoubleBit = 1;
 
             // Check if field is in-object or out-of-object. The is_double bit
             // value doesn't matter, since negative values will stay negative.
             Label if_outofobject, loaded_field;
-            __ CompareInt32AndJumpIf(index, 0, kLessThan, &if_outofobject);
+            __ CompareInt32AndJumpIf(field_index, 0, kLessThan,
+                                     &if_outofobject);
 
             // The field is located in the {object} itself.
             {
               // See giant comment above.
-              static_assert(kTaggedSizeLog2 == 2);
-              static_assert(kSmiTagSize == 1);
-              // We haven't untagged, so we need to sign extend.
-              __ SignExtend32To64Bits(index, index);
+              if (SmiValuesAre31Bits() && kTaggedSize != kSystemPointerSize) {
+                // We haven't untagged, so we need to sign extend.
+                __ SignExtend32To64Bits(field_index, field_index);
+              }
               __ LoadTaggedFieldByIndex(
-                  result_reg, object, index, 1,
-                  JSObject::kHeaderSize - (kIsDoubleBit << kSmiTagSize));
+                  result_reg, object, field_index, scale,
+                  JSObject::kHeaderSize -
+                      (kIsDoubleBit << (kTaggedSizeLog2 - 1)));
               __ Jump(&loaded_field);
             }
 
@@ -1296,12 +2024,13 @@ void LoadTaggedFieldByFieldIndex::GenerateCode(MaglevAssembler* masm,
                   property_array,
                   FieldMemOperand(object, JSObject::kPropertiesOrHashOffset));
 
-              // See giant comment above.
-              static_assert(kSmiTagSize == 1);
-              __ NegateInt32(index);
+              // See giant comment above. No need to sign extend, negate will
+              // handle it.
+              __ NegateInt32(field_index);
               __ LoadTaggedFieldByIndex(
-                  result_reg, property_array, index, 1,
-                  FixedArray::kHeaderSize + (kIsDoubleBit << kSmiTagSize) - 4);
+                  result_reg, property_array, field_index, scale,
+                  FixedArray::kHeaderSize +
+                      ((kIsDoubleBit - 2) << (kTaggedSizeLog2 - 1)));
               __ Jump(&loaded_field);
             }
 
@@ -1313,13 +2042,13 @@ void LoadTaggedFieldByFieldIndex::GenerateCode(MaglevAssembler* masm,
             MaglevAssembler::ScratchRegisterScope temps(masm);
             Register map = temps.Acquire();
             // Hack: The temporary allocated for `map` might alias the result
-            // register. If it does, use the index register as a temporary
+            // register. If it does, use the field_index register as a temporary
             // instead (since it's clobbered anyway).
             // TODO(leszeks): Extend the result register's lifetime to overlap
             // the temporaries, so that this alias isn't possible.
             if (map == result_reg) {
-              DCHECK_NE(map, index);
-              map = index;
+              DCHECK_NE(map, field_index);
+              map = field_index;
             }
             __ LoadMap(map, result_reg);
             __ JumpIfNotRoot(map, RootIndex::kHeapNumberMap, *done);
@@ -1328,28 +2057,29 @@ void LoadTaggedFieldByFieldIndex::GenerateCode(MaglevAssembler* masm,
             __ AllocateHeapNumber(register_snapshot, result_reg, double_value);
             __ Jump(*done);
           },
-          object, index, result_reg, register_snapshot(), done));
+          object, field_index, result_reg, register_snapshot(), done));
 
-  // The field is a proper Tagged field on {object}. The {index} is shifted
-  // to the left by one in the code below.
+  // The field is a proper Tagged field on {object}. The {field_index} is
+  // shifted to the left by one in the code below.
   {
-    static const int kIsDoubleBit = 0;
+    static constexpr int kIsDoubleBit = 0;
 
     // Check if field is in-object or out-of-object. The is_double bit value
     // doesn't matter, since negative values will stay negative.
     Label if_outofobject;
-    __ CompareInt32AndJumpIf(index, 0, kLessThan, &if_outofobject);
+    __ CompareInt32AndJumpIf(field_index, 0, kLessThan, &if_outofobject);
 
     // The field is located in the {object} itself.
     {
       // See giant comment above.
-      static_assert(kTaggedSizeLog2 == 2);
-      static_assert(kSmiTagSize == 1);
-      // We haven't untagged, so we need to sign extend.
-      __ SignExtend32To64Bits(index, index);
+      if (SmiValuesAre31Bits() && kTaggedSize != kSystemPointerSize) {
+        // We haven't untagged, so we need to sign extend.
+        __ SignExtend32To64Bits(field_index, field_index);
+      }
+      __ SignExtend32To64Bits(field_index, field_index);
       __ LoadTaggedFieldByIndex(
-          result_reg, object, index, 1,
-          JSObject::kHeaderSize - (kIsDoubleBit << kSmiTagSize));
+          result_reg, object, field_index, scale,
+          JSObject::kHeaderSize - (kIsDoubleBit << (kTaggedSizeLog2 - 1)));
       __ Jump(*done);
     }
 
@@ -1362,12 +2092,12 @@ void LoadTaggedFieldByFieldIndex::GenerateCode(MaglevAssembler* masm,
           property_array,
           FieldMemOperand(object, JSObject::kPropertiesOrHashOffset));
 
-      // See giant comment above.
-      static_assert(kSmiTagSize == 1);
-      __ NegateInt32(index);
+      // See giant comment above. No need to sign extend, negate will handle it.
+      __ NegateInt32(field_index);
       __ LoadTaggedFieldByIndex(
-          result_reg, property_array, index, 1,
-          FixedArray::kHeaderSize + (kIsDoubleBit << kSmiTagSize) - 4);
+          result_reg, property_array, field_index, scale,
+          FixedArray::kHeaderSize +
+              ((kIsDoubleBit - 2) << (kTaggedSizeLog2 - 1)));
       // Fallthrough to `done`.
     }
   }
@@ -1375,6 +2105,87 @@ void LoadTaggedFieldByFieldIndex::GenerateCode(MaglevAssembler* masm,
   __ bind(*done);
 }
 
+void LoadFixedArrayElement::SetValueLocationConstraints() {
+  UseRegister(elements_input());
+  UseRegister(index_input());
+  DefineAsRegister(this);
+}
+void LoadFixedArrayElement::GenerateCode(MaglevAssembler* masm,
+                                         const ProcessingState& state) {
+  Register elements = ToRegister(elements_input());
+  Register index = ToRegister(index_input());
+  Register result_reg = ToRegister(result());
+  if (this->decompresses_tagged_result()) {
+    __ LoadFixedArrayElement(result_reg, elements, index);
+  } else {
+    __ LoadFixedArrayElementWithoutDecompressing(result_reg, elements, index);
+  }
+}
+
+void LoadFixedDoubleArrayElement::SetValueLocationConstraints() {
+  UseRegister(elements_input());
+  UseRegister(index_input());
+  DefineAsRegister(this);
+}
+void LoadFixedDoubleArrayElement::GenerateCode(MaglevAssembler* masm,
+                                               const ProcessingState& state) {
+  Register elements = ToRegister(elements_input());
+  Register index = ToRegister(index_input());
+  DoubleRegister result_reg = ToDoubleRegister(result());
+  __ LoadFixedDoubleArrayElement(result_reg, elements, index);
+}
+
+void LoadHoleyFixedDoubleArrayElement::SetValueLocationConstraints() {
+  UseRegister(elements_input());
+  UseRegister(index_input());
+  DefineAsRegister(this);
+}
+void LoadHoleyFixedDoubleArrayElement::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  Register elements = ToRegister(elements_input());
+  Register index = ToRegister(index_input());
+  DoubleRegister result_reg = ToDoubleRegister(result());
+  __ LoadFixedDoubleArrayElement(result_reg, elements, index);
+}
+
+void LoadHoleyFixedDoubleArrayElementCheckedNotHole::
+    SetValueLocationConstraints() {
+  UseRegister(elements_input());
+  UseRegister(index_input());
+  DefineAsRegister(this);
+  set_temporaries_needed(1);
+}
+void LoadHoleyFixedDoubleArrayElementCheckedNotHole::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register elements = ToRegister(elements_input());
+  Register index = ToRegister(index_input());
+  DoubleRegister result_reg = ToDoubleRegister(result());
+  __ LoadFixedDoubleArrayElement(result_reg, elements, index);
+  __ JumpIfHoleNan(result_reg, temps.Acquire(),
+                   __ GetDeoptLabel(this, DeoptimizeReason::kHole));
+}
+
+void StoreFixedDoubleArrayElement::SetValueLocationConstraints() {
+  UseRegister(elements_input());
+  UseRegister(index_input());
+  UseRegister(value_input());
+}
+void StoreFixedDoubleArrayElement::GenerateCode(MaglevAssembler* masm,
+                                                const ProcessingState& state) {
+  Register elements = ToRegister(elements_input());
+  Register index = ToRegister(index_input());
+  DoubleRegister value = ToDoubleRegister(value_input());
+  if (v8_flags.debug_code) {
+    __ AssertNotSmi(elements);
+    __ IsObjectType(elements, FIXED_DOUBLE_ARRAY_TYPE);
+    __ Assert(kEqual, AbortReason::kUnexpectedValue);
+    __ CompareInt32(index, 0);
+    __ Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  __ StoreFixedDoubleArrayElement(elements, index, value);
+}
+
 int StoreMap::MaxCallStackArgs() const {
   return WriteBarrierDescriptor::GetStackParameterCount();
 }
@@ -1405,20 +2216,259 @@ void StoreTaggedFieldWithWriteBarrier::SetValueLocationConstraints() {
   UseFixed(object_input(), WriteBarrierDescriptor::ObjectRegister());
   UseRegister(value_input());
 }
-void StoreTaggedFieldWithWriteBarrier::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  // TODO(leszeks): Consider making this an arbitrary register and push/popping
-  // in the deferred path.
-  Register object = WriteBarrierDescriptor::ObjectRegister();
-  DCHECK_EQ(object, ToRegister(object_input()));
-  Register value = ToRegister(value_input());
+void StoreTaggedFieldWithWriteBarrier::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  // TODO(leszeks): Consider making this an arbitrary register and push/popping
+  // in the deferred path.
+  Register object = WriteBarrierDescriptor::ObjectRegister();
+  DCHECK_EQ(object, ToRegister(object_input()));
+  Register value = ToRegister(value_input());
+
+  __ StoreTaggedFieldWithWriteBarrier(
+      object, offset(), value, register_snapshot(),
+      value_input().node()->decompresses_tagged_result()
+          ? MaglevAssembler::kValueIsDecompressed
+          : MaglevAssembler::kValueIsCompressed,
+      MaglevAssembler::kValueCanBeSmi);
+}
+
+void LoadSignedIntDataViewElement::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  UseRegister(index_input());
+  if (is_little_endian_constant() ||
+      type_ == ExternalArrayType::kExternalInt8Array) {
+    UseAny(is_little_endian_input());
+  } else {
+    UseRegister(is_little_endian_input());
+  }
+  DefineAsRegister(this);
+  set_temporaries_needed(1);
+}
+void LoadSignedIntDataViewElement::GenerateCode(MaglevAssembler* masm,
+                                                const ProcessingState& state) {
+  Register object = ToRegister(object_input());
+  Register index = ToRegister(index_input());
+  Register result_reg = ToRegister(result());
+
+  __ AssertNotSmi(object);
+  if (v8_flags.debug_code) {
+    __ CompareObjectType(object, JS_DATA_VIEW_TYPE);
+    __ Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedValue);
+  }
+
+  int element_size = ExternalArrayElementSize(type_);
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register data_pointer = temps.Acquire();
+
+  // We need to make sure we don't clobber is_little_endian_input by writing to
+  // the result register.
+  Register reg_with_result = result_reg;
+  if (type_ != ExternalArrayType::kExternalInt8Array &&
+      !is_little_endian_constant() &&
+      result_reg == ToRegister(is_little_endian_input())) {
+    reg_with_result = data_pointer;
+  }
+
+  // Load data pointer.
+  __ LoadExternalPointerField(
+      data_pointer, FieldMemOperand(object, JSDataView::kDataPointerOffset));
+  MemOperand element_address = __ DataViewElementOperand(data_pointer, index);
+  __ LoadSignedField(reg_with_result, element_address, element_size);
+
+  // We ignore little endian argument if type is a byte size.
+  if (type_ != ExternalArrayType::kExternalInt8Array) {
+    if (is_little_endian_constant()) {
+      // TODO(v8:7700): Support big endian architectures.
+      static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
+      if (!FromConstantToBool(masm, is_little_endian_input().node())) {
+        DCHECK_EQ(reg_with_result, result_reg);
+        __ ReverseByteOrder(result_reg, element_size);
+      }
+    } else {
+      ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
+      DCHECK_NE(reg_with_result, ToRegister(is_little_endian_input()));
+      __ ToBoolean(ToRegister(is_little_endian_input()),
+                   CheckType::kCheckHeapObject, is_little_endian, is_big_endian,
+                   false);
+      __ bind(*is_big_endian);
+      __ ReverseByteOrder(reg_with_result, element_size);
+      __ bind(*is_little_endian);
+      if (reg_with_result != result_reg) {
+        __ Move(result_reg, reg_with_result);
+      }
+    }
+  }
+}
+
+void StoreSignedIntDataViewElement::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  UseRegister(index_input());
+  if (ExternalArrayElementSize(type_) > 1) {
+    UseAndClobberRegister(value_input());
+  } else {
+    UseRegister(value_input());
+  }
+  if (is_little_endian_constant() ||
+      type_ == ExternalArrayType::kExternalInt8Array) {
+    UseAny(is_little_endian_input());
+  } else {
+    UseRegister(is_little_endian_input());
+  }
+  set_temporaries_needed(1);
+}
+void StoreSignedIntDataViewElement::GenerateCode(MaglevAssembler* masm,
+                                                 const ProcessingState& state) {
+  Register object = ToRegister(object_input());
+  Register index = ToRegister(index_input());
+  Register value = ToRegister(value_input());
+
+  __ AssertNotSmi(object);
+  if (v8_flags.debug_code) {
+    __ CompareObjectType(object, JS_DATA_VIEW_TYPE);
+    __ Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedValue);
+  }
+
+  int element_size = ExternalArrayElementSize(type_);
+
+  // We ignore little endian argument if type is a byte size.
+  if (element_size > 1) {
+    if (is_little_endian_constant()) {
+      // TODO(v8:7700): Support big endian architectures.
+      static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
+      if (!FromConstantToBool(masm, is_little_endian_input().node())) {
+        __ ReverseByteOrder(value, element_size);
+      }
+    } else {
+      ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
+      __ ToBoolean(ToRegister(is_little_endian_input()),
+                   CheckType::kCheckHeapObject, is_little_endian, is_big_endian,
+                   false);
+      __ bind(*is_big_endian);
+      __ ReverseByteOrder(value, element_size);
+      __ bind(*is_little_endian);
+    }
+  }
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register data_pointer = temps.Acquire();
+  __ LoadExternalPointerField(
+      data_pointer, FieldMemOperand(object, JSDataView::kDataPointerOffset));
+  MemOperand element_address = __ DataViewElementOperand(data_pointer, index);
+  __ StoreField(element_address, value, element_size);
+}
+
+void LoadDoubleDataViewElement::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  UseRegister(index_input());
+  if (is_little_endian_constant()) {
+    UseAny(is_little_endian_input());
+  } else {
+    UseRegister(is_little_endian_input());
+  }
+  set_temporaries_needed(1);
+  DefineAsRegister(this);
+}
+void LoadDoubleDataViewElement::GenerateCode(MaglevAssembler* masm,
+                                             const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register object = ToRegister(object_input());
+  Register index = ToRegister(index_input());
+  DoubleRegister result_reg = ToDoubleRegister(result());
+  Register data_pointer = temps.Acquire();
+
+  __ AssertNotSmi(object);
+  if (v8_flags.debug_code) {
+    __ CompareObjectType(object, JS_DATA_VIEW_TYPE);
+    __ Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedValue);
+  }
+
+  // Load data pointer.
+  __ LoadExternalPointerField(
+      data_pointer, FieldMemOperand(object, JSDataView::kDataPointerOffset));
+
+  // TODO(v8:7700): Support big endian architectures.
+  static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
+  if (is_little_endian_constant()) {
+    if (FromConstantToBool(masm, is_little_endian_input().node())) {
+      __ LoadUnalignedFloat64(result_reg, data_pointer, index);
+    } else {
+      __ LoadUnalignedFloat64AndReverseByteOrder(result_reg, data_pointer,
+                                                 index);
+    }
+  } else {
+    Label done;
+    ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
+    // TODO(leszeks): We're likely to be calling this on an existing boolean --
+    // maybe that's a case we should fast-path here and re-use that boolean
+    // value?
+    __ ToBoolean(ToRegister(is_little_endian_input()),
+                 CheckType::kCheckHeapObject, is_little_endian, is_big_endian,
+                 true);
+    __ bind(*is_little_endian);
+    __ LoadUnalignedFloat64(result_reg, data_pointer, index);
+    __ Jump(&done);
+    // We should swap the bytes if big endian.
+    __ bind(*is_big_endian);
+    __ LoadUnalignedFloat64AndReverseByteOrder(result_reg, data_pointer, index);
+    __ bind(&done);
+  }
+}
+
+void StoreDoubleDataViewElement::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  UseRegister(index_input());
+  UseRegister(value_input());
+  if (is_little_endian_constant()) {
+    UseAny(is_little_endian_input());
+  } else {
+    UseRegister(is_little_endian_input());
+  }
+  set_temporaries_needed(1);
+}
+void StoreDoubleDataViewElement::GenerateCode(MaglevAssembler* masm,
+                                              const ProcessingState& state) {
+  Register object = ToRegister(object_input());
+  Register index = ToRegister(index_input());
+  DoubleRegister value = ToDoubleRegister(value_input());
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register data_pointer = temps.Acquire();
 
-  __ StoreTaggedFieldWithWriteBarrier(
-      object, offset(), value, register_snapshot(),
-      value_input().node()->decompresses_tagged_result()
-          ? MaglevAssembler::kValueIsDecompressed
-          : MaglevAssembler::kValueIsCompressed,
-      MaglevAssembler::kValueCanBeSmi);
+  __ AssertNotSmi(object);
+  if (v8_flags.debug_code) {
+    __ CompareObjectType(object, JS_DATA_VIEW_TYPE);
+    __ Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedValue);
+  }
+
+  // Load data pointer.
+  __ LoadExternalPointerField(
+      data_pointer, FieldMemOperand(object, JSDataView::kDataPointerOffset));
+
+  // TODO(v8:7700): Support big endian architectures.
+  static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
+  if (is_little_endian_constant()) {
+    if (FromConstantToBool(masm, is_little_endian_input().node())) {
+      __ StoreUnalignedFloat64(data_pointer, index, value);
+    } else {
+      __ ReverseByteOrderAndStoreUnalignedFloat64(data_pointer, index, value);
+    }
+  } else {
+    Label done;
+    ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
+    // TODO(leszeks): We're likely to be calling this on an existing boolean --
+    // maybe that's a case we should fast-path here and re-use that boolean
+    // value?
+    __ ToBoolean(ToRegister(is_little_endian_input()),
+                 CheckType::kCheckHeapObject, is_little_endian, is_big_endian,
+                 true);
+    __ bind(*is_little_endian);
+    __ StoreUnalignedFloat64(data_pointer, index, value);
+    __ Jump(&done);
+    // We should swap the bytes if big endian.
+    __ bind(*is_big_endian);
+    __ ReverseByteOrderAndStoreUnalignedFloat64(data_pointer, index, value);
+    __ bind(&done);
+  }
 }
 
 namespace {
@@ -1428,12 +2478,11 @@ void EmitPolymorphicAccesses(MaglevAssembler* masm, NodeT* node,
                              Register object, Function&& f, Args&&... args) {
   MaglevAssembler::ScratchRegisterScope temps(masm);
   Register object_map = temps.Acquire();
-
   Label done;
   Label is_number;
+  Label* deopt = __ GetDeoptLabel(node, DeoptimizeReason::kWrongMap);
 
-  Condition is_smi = __ CheckSmi(object);
-  __ JumpIf(is_smi, &is_number);
+  __ JumpIfSmi(object, &is_number);
   __ LoadMap(object_map, object);
 
   for (const PolymorphicAccessInfo& access_info : node->access_infos()) {
@@ -1441,20 +2490,22 @@ void EmitPolymorphicAccesses(MaglevAssembler* masm, NodeT* node,
     Label map_found;
     auto& maps = access_info.maps();
 
-    if (HasOnlyNumberMaps(base::VectorOf(maps))) {
-      __ CompareRoot(object_map, RootIndex::kHeapNumberMap);
-      __ JumpIf(kNotEqual, &next);
-      // Fallthrough... to map_found.
-      DCHECK(!is_number.is_bound());
-      __ bind(&is_number);
-    } else if (HasOnlyStringMaps(base::VectorOf(maps))) {
-      __ CompareInstanceTypeRange(object_map, FIRST_STRING_TYPE,
+    bool has_number_map = false;
+    if (HasOnlyStringMaps(base::VectorOf(maps))) {
+      MaglevAssembler::ScratchRegisterScope temps(masm);
+      Register scratch = temps.GetDefaultScratchRegister();
+      __ CompareInstanceTypeRange(object_map, scratch, FIRST_STRING_TYPE,
                                   LAST_STRING_TYPE);
       __ JumpIf(kUnsignedGreaterThan, &next);
       // Fallthrough... to map_found.
     } else {
       for (auto it = maps.begin(); it != maps.end(); ++it) {
-        __ CompareTagged(object_map, it->object());
+        if (IsHeapNumberMap(*it->object())) {
+          __ CompareRoot(object_map, RootIndex::kHeapNumberMap);
+          has_number_map = true;
+        } else {
+          __ CompareTagged(object_map, it->object());
+        }
         if (it == maps.end() - 1) {
           __ JumpIf(kNotEqual, &next);
           // Fallthrough... to map_found.
@@ -1464,7 +2515,12 @@ void EmitPolymorphicAccesses(MaglevAssembler* masm, NodeT* node,
       }
     }
 
+    if (has_number_map) {
+      DCHECK(!is_number.is_bound());
+      __ bind(&is_number);
+    }
     __ bind(&map_found);
+    __ EmitEagerDeoptStress(deopt);
     f(masm, node, access_info, object, object_map, std::forward<Args>(args)...);
     __ Jump(&done);
 
@@ -1478,7 +2534,7 @@ void EmitPolymorphicAccesses(MaglevAssembler* masm, NodeT* node,
   }
 
   // No map matched!
-  __ EmitEagerDeopt(node, DeoptimizeReason::kWrongMap);
+  __ JumpToDeopt(deopt);
   __ bind(&done);
 }
 
@@ -1487,7 +2543,7 @@ void EmitPolymorphicAccesses(MaglevAssembler* masm, NodeT* node,
 void LoadPolymorphicTaggedField::SetValueLocationConstraints() {
   UseRegister(object_input());
   DefineAsRegister(this);
-  set_temporaries_needed(1);
+  set_temporaries_needed(2);
   set_double_temporaries_needed(1);
 }
 void LoadPolymorphicTaggedField::GenerateCode(MaglevAssembler* masm,
@@ -1504,10 +2560,10 @@ void LoadPolymorphicTaggedField::GenerateCode(MaglevAssembler* masm,
             break;
           case PolymorphicAccessInfo::kConstant: {
             Handle<Object> constant = access_info.constant();
-            if (constant->IsSmi()) {
+            if (IsSmi(*constant)) {
               __ Move(result, Smi::cast(*constant));
             } else {
-              DCHECK(access_info.constant()->IsHeapObject());
+              DCHECK(IsHeapObject(*access_info.constant()));
               __ Move(result, Handle<HeapObject>::cast(constant));
             }
             break;
@@ -1516,8 +2572,7 @@ void LoadPolymorphicTaggedField::GenerateCode(MaglevAssembler* masm,
             Register cell = map;  // Reuse scratch.
             __ Move(cell, access_info.cell());
             __ AssertNotSmi(cell);
-            __ DecompressTagged(result,
-                                FieldMemOperand(cell, Cell::kValueOffset));
+            __ LoadTaggedField(result, cell, Cell::kValueOffset);
             break;
           }
           case PolymorphicAccessInfo::kDataLoad: {
@@ -1570,11 +2625,12 @@ void LoadPolymorphicDoubleField::GenerateCode(MaglevAssembler* masm,
             break;
           case PolymorphicAccessInfo::kConstant: {
             Handle<Object> constant = access_info.constant();
-            if (constant->IsSmi()) {
+            if (IsSmi(*constant)) {
+              // Remove the cast to Tagged<Smi> once Smi::cast returns Tagged.
               __ Move(scratch, Smi::cast(*constant));
               __ SmiToDouble(result, scratch);
             } else {
-              DCHECK(constant->IsHeapNumber());
+              DCHECK(IsHeapNumber(*constant));
               __ Move(result, Handle<HeapNumber>::cast(constant)->value());
             }
             break;
@@ -1619,27 +2675,21 @@ void LoadGlobal::SetValueLocationConstraints() {
 }
 void LoadGlobal::GenerateCode(MaglevAssembler* masm,
                               const ProcessingState& state) {
-  // TODO(leszeks): Port the nice Sparkplug CallBuiltin helper.
   if (typeof_mode() == TypeofMode::kNotInside) {
-    using D = CallInterfaceDescriptorFor<Builtin::kLoadGlobalIC>::type;
-    DCHECK_EQ(ToRegister(context()), kContextRegister);
-    __ Move(D::GetRegisterParameter(D::kName), name().object());
-    __ Move(D::GetRegisterParameter(D::kSlot),
-            TaggedIndex::FromIntptr(feedback().index()));
-    __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-
-    __ CallBuiltin(Builtin::kLoadGlobalIC);
+    __ CallBuiltin<Builtin::kLoadGlobalIC>(
+        context(),                                    // context
+        name().object(),                              // name
+        TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+        feedback().vector                             // feedback vector
+    );
   } else {
     DCHECK_EQ(typeof_mode(), TypeofMode::kInside);
-    using D =
-        CallInterfaceDescriptorFor<Builtin::kLoadGlobalICInsideTypeof>::type;
-    DCHECK_EQ(ToRegister(context()), kContextRegister);
-    __ Move(D::GetRegisterParameter(D::kName), name().object());
-    __ Move(D::GetRegisterParameter(D::kSlot),
-            TaggedIndex::FromIntptr(feedback().index()));
-    __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-
-    __ CallBuiltin(Builtin::kLoadGlobalICInsideTypeof);
+    __ CallBuiltin<Builtin::kLoadGlobalICInsideTypeof>(
+        context(),                                    // context
+        name().object(),                              // name
+        TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+        feedback().vector                             // feedback vector
+    );
   }
 
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
@@ -1657,15 +2707,13 @@ void StoreGlobal::SetValueLocationConstraints() {
 }
 void StoreGlobal::GenerateCode(MaglevAssembler* masm,
                                const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kStoreGlobalIC>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(value()), D::GetRegisterParameter(D::kValue));
-  __ Move(D::GetRegisterParameter(D::kName), name().object());
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-
-  __ CallBuiltin(Builtin::kStoreGlobalIC);
+  __ CallBuiltin<Builtin::kStoreGlobalIC>(
+      context(),                                    // context
+      name().object(),                              // name
+      value(),                                      // value
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -1677,6 +2725,31 @@ void CheckValue::GenerateCode(MaglevAssembler* masm,
   __ EmitEagerDeoptIfNotEqual(DeoptimizeReason::kWrongValue, this);
 }
 
+void CheckValueEqualsInt32::SetValueLocationConstraints() {
+  UseRegister(target_input());
+}
+void CheckValueEqualsInt32::GenerateCode(MaglevAssembler* masm,
+                                         const ProcessingState& state) {
+  Register target = ToRegister(target_input());
+  __ CompareInt32(target, value());
+  __ EmitEagerDeoptIfNotEqual(DeoptimizeReason::kWrongValue, this);
+}
+
+void CheckValueEqualsFloat64::SetValueLocationConstraints() {
+  UseRegister(target_input());
+  set_double_temporaries_needed(1);
+}
+void CheckValueEqualsFloat64::GenerateCode(MaglevAssembler* masm,
+                                           const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  DoubleRegister scratch = temps.AcquireDouble();
+  DoubleRegister target = ToDoubleRegister(target_input());
+  __ Move(scratch, value());
+  __ CompareFloat64(scratch, target);
+  __ EmitEagerDeoptIf(ConditionForNaN(), DeoptimizeReason::kWrongValue, this);
+  __ EmitEagerDeoptIfNotEqual(DeoptimizeReason::kWrongValue, this);
+}
+
 void CheckValueEqualsString::SetValueLocationConstraints() {
   using D = CallInterfaceDescriptorFor<Builtin::kStringEqual>::type;
   UseFixed(target_input(), D::GetRegisterParameter(D::kLeft));
@@ -1693,7 +2766,7 @@ void CheckValueEqualsString::GenerateCode(MaglevAssembler* masm,
   __ CompareTagged(target, value().object());
   __ JumpIf(kEqual, *end, Label::kNear);
 
-  __ EmitEagerDeoptIf(__ CheckSmi(target), DeoptimizeReason::kWrongValue, this);
+  __ EmitEagerDeoptIfSmi(this, target, DeoptimizeReason::kWrongValue);
   __ CompareObjectTypeRange(target, FIRST_STRING_TYPE, LAST_STRING_TYPE);
 
   __ JumpToDeferredIf(
@@ -1705,21 +2778,22 @@ void CheckValueEqualsString::GenerateCode(MaglevAssembler* masm,
         __ StringLength(string_length, target);
         __ CompareInt32(string_length, node->value().length());
         __ EmitEagerDeoptIf(kNotEqual, DeoptimizeReason::kWrongValue, node);
-
         RegisterSnapshot snapshot = node->register_snapshot();
         AddDeoptRegistersToSnapshot(&snapshot, node->eager_deopt_info());
         {
           SaveRegisterStateForCall save_register_state(masm, snapshot);
-          __ Move(kContextRegister, masm->native_context().object());
-          __ Move(D::GetRegisterParameter(D::kRight), node->value().object());
-          __ CallBuiltin(Builtin::kStringEqual);
+          __ CallBuiltin<Builtin::kStringEqual>(
+              node->target_input(),    // left
+              node->value().object(),  // right
+              string_length            // length
+          );
           save_register_state.DefineSafepoint();
           // Compare before restoring registers, so that the deopt below has the
           // correct register set.
           __ CompareRoot(kReturnRegister0, RootIndex::kTrueValue);
         }
-        __ JumpIf(kEqual, *end);
-        __ EmitEagerDeopt(node, DeoptimizeReason::kWrongValue);
+        __ EmitEagerDeoptIf(kNotEqual, DeoptimizeReason::kWrongValue, node);
+        __ Jump(*end);
       },
       this, end);
 
@@ -1744,9 +2818,7 @@ void CheckSmi::SetValueLocationConstraints() { UseRegister(receiver_input()); }
 void CheckSmi::GenerateCode(MaglevAssembler* masm,
                             const ProcessingState& state) {
   Register object = ToRegister(receiver_input());
-  Condition is_smi = __ CheckSmi(object);
-  __ EmitEagerDeoptIf(NegateCondition(is_smi), DeoptimizeReason::kNotASmi,
-                      this);
+  __ EmitEagerDeoptIfNotSmi(this, object, DeoptimizeReason::kNotASmi);
 }
 
 void CheckHeapObject::SetValueLocationConstraints() {
@@ -1755,8 +2827,7 @@ void CheckHeapObject::SetValueLocationConstraints() {
 void CheckHeapObject::GenerateCode(MaglevAssembler* masm,
                                    const ProcessingState& state) {
   Register object = ToRegister(receiver_input());
-  Condition is_smi = __ CheckSmi(object);
-  __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kSmi, this);
+  __ EmitEagerDeoptIfSmi(this, object, DeoptimizeReason::kSmi);
 }
 
 void CheckSymbol::SetValueLocationConstraints() {
@@ -1765,11 +2836,10 @@ void CheckSymbol::SetValueLocationConstraints() {
 void CheckSymbol::GenerateCode(MaglevAssembler* masm,
                                const ProcessingState& state) {
   Register object = ToRegister(receiver_input());
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
+  if (check_type() == CheckType::kOmitHeapObjectCheck) {
     __ AssertNotSmi(object);
   } else {
-    Condition is_smi = __ CheckSmi(object);
-    __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kNotASymbol, this);
+    __ EmitEagerDeoptIfSmi(this, object, DeoptimizeReason::kNotASymbol);
   }
   __ IsObjectType(object, SYMBOL_TYPE);
   __ EmitEagerDeoptIf(kNotEqual, DeoptimizeReason::kNotASymbol, this);
@@ -1777,18 +2847,30 @@ void CheckSymbol::GenerateCode(MaglevAssembler* masm,
 
 void CheckInstanceType::SetValueLocationConstraints() {
   UseRegister(receiver_input());
+  if (first_instance_type_ != last_instance_type_) {
+    set_temporaries_needed(1);
+  }
 }
 void CheckInstanceType::GenerateCode(MaglevAssembler* masm,
                                      const ProcessingState& state) {
   Register object = ToRegister(receiver_input());
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
+  if (check_type() == CheckType::kOmitHeapObjectCheck) {
     __ AssertNotSmi(object);
   } else {
-    Condition is_smi = __ CheckSmi(object);
-    __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kWrongInstanceType, this);
+    __ EmitEagerDeoptIfSmi(this, object, DeoptimizeReason::kWrongInstanceType);
+  }
+  if (first_instance_type_ == last_instance_type_) {
+    __ IsObjectType(object, first_instance_type_);
+    __ EmitEagerDeoptIf(kNotEqual, DeoptimizeReason::kWrongInstanceType, this);
+  } else {
+    MaglevAssembler::ScratchRegisterScope temps(masm);
+    Register map = temps.Acquire();
+    __ LoadMap(map, object);
+    __ CompareInstanceTypeRange(map, map, first_instance_type_,
+                                last_instance_type_);
+    __ EmitEagerDeoptIf(kUnsignedGreaterThan,
+                        DeoptimizeReason::kWrongInstanceType, this);
   }
-  __ IsObjectType(object, instance_type());
-  __ EmitEagerDeoptIf(kNotEqual, DeoptimizeReason::kWrongInstanceType, this);
 }
 
 void CheckFixedArrayNonEmpty::SetValueLocationConstraints() {
@@ -1823,7 +2905,8 @@ void CheckInt32Condition::SetValueLocationConstraints() {
 void CheckInt32Condition::GenerateCode(MaglevAssembler* masm,
                                        const ProcessingState& state) {
   __ CompareInt32(ToRegister(left_input()), ToRegister(right_input()));
-  __ EmitEagerDeoptIf(NegateCondition(ToCondition(condition_)), reason_, this);
+  __ EmitEagerDeoptIf(NegateCondition(ToCondition(condition())), reason(),
+                      this);
 }
 
 void CheckString::SetValueLocationConstraints() {
@@ -1832,17 +2915,28 @@ void CheckString::SetValueLocationConstraints() {
 void CheckString::GenerateCode(MaglevAssembler* masm,
                                const ProcessingState& state) {
   Register object = ToRegister(receiver_input());
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
+  if (check_type() == CheckType::kOmitHeapObjectCheck) {
     __ AssertNotSmi(object);
   } else {
-    Condition is_smi = __ CheckSmi(object);
-    __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kNotAString, this);
+    __ EmitEagerDeoptIfSmi(this, object, DeoptimizeReason::kNotAString);
   }
   __ CompareObjectTypeRange(object, FIRST_STRING_TYPE, LAST_STRING_TYPE);
   __ EmitEagerDeoptIf(kUnsignedGreaterThan, DeoptimizeReason::kNotAString,
                       this);
 }
 
+void CheckNotHole::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  DefineSameAsFirst(this);
+}
+void CheckNotHole::GenerateCode(MaglevAssembler* masm,
+                                const ProcessingState& state) {
+  DCHECK_EQ(ToRegister(object_input()), ToRegister(result()));
+  Register reg = ToRegister(object_input());
+  __ CompareRoot(reg, RootIndex::kTheHoleValue);
+  __ EmitEagerDeoptIf(kEqual, DeoptimizeReason::kHole, this);
+}
+
 void ConvertHoleToUndefined::SetValueLocationConstraints() {
   UseRegister(object_input());
   DefineSameAsFirst(this);
@@ -1881,34 +2975,92 @@ void ConvertReceiver::GenerateCode(MaglevAssembler* masm,
                      Label::Distance::kNear);
     __ bind(&convert_global_proxy);
     // Patch receiver to global proxy.
-    __ Move(
-        ToRegister(result()),
-        target_.native_context(broker).global_proxy_object(broker).object());
+    __ Move(ToRegister(result()),
+            native_context_.global_proxy_object(broker).object());
     __ Jump(&done);
   }
 
   __ bind(&convert_to_object);
-  // ToObject needs to be ran with the target context installed.
-  __ Move(kContextRegister, target_.context(broker).object());
-  __ CallBuiltin(Builtin::kToObject);
+  __ CallBuiltin<Builtin::kToObject>(native_context_.object(),
+                                     receiver_input());
   __ bind(&done);
 }
 
-int CreateEmptyArrayLiteral::MaxCallStackArgs() const {
-  using D = CallInterfaceDescriptorFor<Builtin::kCreateEmptyArrayLiteral>::type;
-  return D::GetStackParameterCount();
+int CheckDerivedConstructResult::MaxCallStackArgs() const { return 0; }
+void CheckDerivedConstructResult::SetValueLocationConstraints() {
+  UseRegister(construct_result_input());
+  DefineSameAsFirst(this);
 }
-void CreateEmptyArrayLiteral::SetValueLocationConstraints() {
-  DefineAsFixed(this, kReturnRegister0);
+void CheckDerivedConstructResult::GenerateCode(MaglevAssembler* masm,
+                                               const ProcessingState& state) {
+  Register construct_result = ToRegister(construct_result_input());
+
+  DCHECK_EQ(construct_result, ToRegister(result()));
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label done, do_throw;
+
+  __ CompareRoot(construct_result, RootIndex::kUndefinedValue);
+  __ Assert(kNotEqual, AbortReason::kUnexpectedValue);
+
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(construct_result, &do_throw, Label::Distance::kNear);
+
+  // Check if the type of the result is not an object in the ECMA sense.
+  __ JumpIfJSAnyIsNotPrimitive(construct_result, &done, Label::Distance::kNear);
+
+  // Throw away the result of the constructor invocation and use the
+  // implicit receiver as the result.
+  __ bind(&do_throw);
+  __ Jump(__ MakeDeferredCode(
+      [](MaglevAssembler* masm, CheckDerivedConstructResult* node) {
+        __ Move(kContextRegister, masm->native_context().object());
+        __ CallRuntime(Runtime::kThrowConstructorReturnedNonObject);
+        masm->DefineExceptionHandlerAndLazyDeoptPoint(node);
+        __ Abort(AbortReason::kUnexpectedReturnFromThrow);
+      },
+      this));
+
+  __ bind(&done);
 }
-void CreateEmptyArrayLiteral::GenerateCode(MaglevAssembler* masm,
-                                           const ProcessingState& state) {
-  using D = CreateEmptyArrayLiteralDescriptor;
-  __ Move(kContextRegister, masm->native_context().object());
-  __ Move(D::GetRegisterParameter(D::kSlot), Smi::FromInt(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kFeedbackVector), feedback().vector);
-  __ CallBuiltin(Builtin::kCreateEmptyArrayLiteral);
-  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+
+int CheckConstructResult::MaxCallStackArgs() const { return 0; }
+void CheckConstructResult::SetValueLocationConstraints() {
+  UseRegister(construct_result_input());
+  UseRegister(implicit_receiver_input());
+  DefineSameAsFirst(this);
+}
+void CheckConstructResult::GenerateCode(MaglevAssembler* masm,
+                                        const ProcessingState& state) {
+  Register construct_result = ToRegister(construct_result_input());
+  Register result_reg = ToRegister(result());
+
+  DCHECK_EQ(construct_result, result_reg);
+
+  // If the result is an object (in the ECMA sense), we should get rid
+  // of the receiver and use the result; see ECMA-262 section 13.2.2-7
+  // on page 74.
+  Label done, use_receiver;
+
+  // If the result is undefined, we'll use the implicit receiver.
+  __ JumpIfRoot(construct_result, RootIndex::kUndefinedValue, &use_receiver,
+                Label::Distance::kNear);
+
+  // If the result is a smi, it is *not* an object in the ECMA sense.
+  __ JumpIfSmi(construct_result, &use_receiver, Label::Distance::kNear);
+
+  // Check if the type of the result is not an object in the ECMA sense.
+  __ JumpIfJSAnyIsNotPrimitive(construct_result, &done, Label::Distance::kNear);
+
+  // Throw away the result of the constructor invocation and use the
+  // implicit receiver as the result.
+  __ bind(&use_receiver);
+  Register implicit_receiver = ToRegister(implicit_receiver_input());
+  __ Move(result_reg, implicit_receiver);
+
+  __ bind(&done);
 }
 
 int CreateObjectLiteral::MaxCallStackArgs() const {
@@ -1928,7 +3080,8 @@ void CreateObjectLiteral::GenerateCode(MaglevAssembler* masm,
 }
 
 int CreateShallowArrayLiteral::MaxCallStackArgs() const {
-  using D = CallInterfaceDescriptorFor<Builtin::kCreateEmptyArrayLiteral>::type;
+  using D =
+      CallInterfaceDescriptorFor<Builtin::kCreateShallowArrayLiteral>::type;
   return D::GetStackParameterCount();
 }
 void CreateShallowArrayLiteral::SetValueLocationConstraints() {
@@ -1936,15 +3089,13 @@ void CreateShallowArrayLiteral::SetValueLocationConstraints() {
 }
 void CreateShallowArrayLiteral::GenerateCode(MaglevAssembler* masm,
                                              const ProcessingState& state) {
-  using D = CreateShallowArrayLiteralDescriptor;
-  __ Move(D::ContextRegister(), masm->native_context().object());
-  __ Move(D::GetRegisterParameter(D::kMaybeFeedbackVector), feedback().vector);
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kConstantElements),
-          constant_elements().object());
-  __ Move(D::GetRegisterParameter(D::kFlags), Smi::FromInt(flags()));
-  __ CallBuiltin(Builtin::kCreateShallowArrayLiteral);
+  __ CallBuiltin<Builtin::kCreateShallowArrayLiteral>(
+      masm->native_context().object(),              // context
+      feedback().vector,                            // feedback vector
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      constant_elements().object(),                 // constant elements
+      Smi::FromInt(flags())                         // flags
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -1974,14 +3125,13 @@ void CreateShallowObjectLiteral::SetValueLocationConstraints() {
 }
 void CreateShallowObjectLiteral::GenerateCode(MaglevAssembler* masm,
                                               const ProcessingState& state) {
-  using D = CreateShallowObjectLiteralDescriptor;
-  __ Move(D::ContextRegister(), masm->native_context().object());
-  __ Move(D::GetRegisterParameter(D::kMaybeFeedbackVector), feedback().vector);
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kDesc), boilerplate_descriptor().object());
-  __ Move(D::GetRegisterParameter(D::kFlags), Smi::FromInt(flags()));
-  __ CallBuiltin(Builtin::kCreateShallowObjectLiteral);
+  __ CallBuiltin<Builtin::kCreateShallowObjectLiteral>(
+      masm->native_context().object(),              // context
+      feedback().vector,                            // feedback vector
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      boilerplate_descriptor().object(),            // desc
+      Smi::FromInt(flags())                         // flags
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -2024,14 +3174,12 @@ void FastCreateClosure::SetValueLocationConstraints() {
 }
 void FastCreateClosure::GenerateCode(MaglevAssembler* masm,
                                      const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kFastNewClosure>::type;
-
-  DCHECK_EQ(ToRegister(context()), D::ContextRegister());
-  __ Move(D::GetRegisterParameter(D::kSharedFunctionInfo),
-          shared_function_info().object());
-  __ Move(D::GetRegisterParameter(D::kFeedbackCell), feedback_cell().object());
-  __ CallBuiltin(Builtin::kFastNewClosure);
-  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+  __ CallBuiltin<Builtin::kFastNewClosure>(
+      context(),                        // context
+      shared_function_info().object(),  // shared function info
+      feedback_cell().object()          // feedback cell
+  );
+  masm->DefineLazyDeoptPoint(lazy_deopt_info());
 }
 
 int CreateFunctionContext::MaxCallStackArgs() const {
@@ -2066,21 +3214,17 @@ void CreateFunctionContext::SetValueLocationConstraints() {
 void CreateFunctionContext::GenerateCode(MaglevAssembler* masm,
                                          const ProcessingState& state) {
   if (scope_type() == FUNCTION_SCOPE) {
-    using D = CallInterfaceDescriptorFor<
-        Builtin::kFastNewFunctionContextFunction>::type;
-    DCHECK_EQ(ToRegister(context()), D::ContextRegister());
-    __ Move(D::GetRegisterParameter(D::kScopeInfo), scope_info().object());
-    __ Move(D::GetRegisterParameter(D::kSlots), slot_count());
-    // TODO(leszeks): Consider inlining this allocation.
-    __ CallBuiltin(Builtin::kFastNewFunctionContextFunction);
+    __ CallBuiltin<Builtin::kFastNewFunctionContextFunction>(
+        context(),              // context
+        scope_info().object(),  // scope info
+        slot_count()            // slots
+    );
   } else {
-    DCHECK_EQ(scope_type(), ScopeType::EVAL_SCOPE);
-    using D =
-        CallInterfaceDescriptorFor<Builtin::kFastNewFunctionContextEval>::type;
-    DCHECK_EQ(ToRegister(context()), D::ContextRegister());
-    __ Move(D::GetRegisterParameter(D::kScopeInfo), scope_info().object());
-    __ Move(D::GetRegisterParameter(D::kSlots), slot_count());
-    __ CallBuiltin(Builtin::kFastNewFunctionContextEval);
+    __ CallBuiltin<Builtin::kFastNewFunctionContextEval>(
+        context(),              // context
+        scope_info().object(),  // scope info
+        slot_count()            // slots
+    );
   }
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
@@ -2094,14 +3238,13 @@ void CreateRegExpLiteral::SetValueLocationConstraints() {
 }
 void CreateRegExpLiteral::GenerateCode(MaglevAssembler* masm,
                                        const ProcessingState& state) {
-  using D = CreateRegExpLiteralDescriptor;
-  __ Move(D::ContextRegister(), masm->native_context().object());
-  __ Move(D::GetRegisterParameter(D::kMaybeFeedbackVector), feedback().vector);
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kPattern), pattern().object());
-  __ Move(D::GetRegisterParameter(D::kFlags), Smi::FromInt(flags()));
-  __ CallBuiltin(Builtin::kCreateRegExpLiteral);
+  __ CallBuiltin<Builtin::kCreateRegExpLiteral>(
+      masm->native_context().object(),              // context
+      feedback().vector,                            // feedback vector
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      pattern().object(),                           // pattern
+      Smi::FromInt(flags())                         // flags
+  );
 }
 
 int GetTemplateObject::MaxCallStackArgs() const {
@@ -2115,15 +3258,109 @@ void GetTemplateObject::SetValueLocationConstraints() {
 }
 void GetTemplateObject::GenerateCode(MaglevAssembler* masm,
                                      const ProcessingState& state) {
-  using D = GetTemplateObjectDescriptor;
-  __ Move(D::ContextRegister(), masm->native_context().object());
-  __ Move(D::GetRegisterParameter(D::kMaybeFeedbackVector), feedback().vector);
-  __ Move(D::GetRegisterParameter(D::kSlot), feedback().slot.ToInt());
-  __ Move(D::GetRegisterParameter(D::kShared), shared_function_info_.object());
-  __ CallBuiltin(Builtin::kGetTemplateObject);
+  __ CallBuiltin<Builtin::kGetTemplateObject>(
+      masm->native_context().object(),  // context
+      shared_function_info_.object(),   // shared function info
+      description(),                    // description
+      feedback().index(),               // feedback slot
+      feedback().vector                 // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
+int HasInPrototypeChain::MaxCallStackArgs() const {
+  DCHECK_EQ(2, Runtime::FunctionForId(Runtime::kHasInPrototypeChain)->nargs);
+  return 2;
+}
+void HasInPrototypeChain::SetValueLocationConstraints() {
+  UseRegister(object());
+  DefineAsRegister(this);
+  set_temporaries_needed(2);
+}
+void HasInPrototypeChain::GenerateCode(MaglevAssembler* masm,
+                                       const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register object_reg = ToRegister(object());
+  Register result_reg = ToRegister(result());
+
+  Label return_false, return_true;
+  ZoneLabelRef done(masm);
+
+  __ JumpIfSmi(object_reg, &return_false, Label::kNear);
+
+  // Loop through the prototype chain looking for the {prototype}.
+  Register map = temps.Acquire();
+  __ LoadMap(map, object_reg);
+  Label loop;
+  {
+    __ bind(&loop);
+    Register scratch = temps.Acquire();
+    // Check if we can determine the prototype directly from the {object_map}.
+    ZoneLabelRef if_objectisdirect(masm);
+    Register instance_type = scratch;
+    __ CompareInstanceTypeRange(map, instance_type, FIRST_TYPE,
+                                LAST_SPECIAL_RECEIVER_TYPE);
+    __ JumpToDeferredIf(
+        kLessThan,
+        [](MaglevAssembler* masm, RegisterSnapshot snapshot,
+           Register object_reg, Register map, Register instance_type,
+           Register result_reg, HasInPrototypeChain* node,
+           ZoneLabelRef if_objectisdirect, ZoneLabelRef done) {
+          Label return_runtime;
+          // The {object_map} is a special receiver map or a primitive map,
+          // check if we need to use the if_objectisspecial path in the runtime.
+          __ JumpIfEqual(instance_type, JS_PROXY_TYPE, &return_runtime);
+
+          Register object_bitfield = instance_type;
+          __ LoadByte(object_bitfield,
+                      FieldMemOperand(map, Map::kBitFieldOffset));
+          int mask = Map::Bits1::HasNamedInterceptorBit::kMask |
+                     Map::Bits1::IsAccessCheckNeededBit::kMask;
+          __ TestInt32AndJumpIfAllClear(object_bitfield, mask,
+                                        *if_objectisdirect);
+
+          __ bind(&return_runtime);
+          {
+            snapshot.live_registers.clear(result_reg);
+            SaveRegisterStateForCall save_register_state(masm, snapshot);
+            __ Move(kContextRegister, masm->native_context().object());
+            __ Push(object_reg, node->prototype().object());
+            __ CallRuntime(Runtime::kHasInPrototypeChain, 2);
+            masm->DefineExceptionHandlerPoint(node);
+            save_register_state.DefineSafepointWithLazyDeopt(
+                node->lazy_deopt_info());
+            __ Move(result_reg, kReturnRegister0);
+          }
+          __ Jump(*done);
+        },
+        register_snapshot(), object_reg, map, instance_type, result_reg, this,
+        if_objectisdirect, done);
+    instance_type = Register::no_reg();
+
+    __ bind(*if_objectisdirect);
+    // Check the current {object} prototype.
+    Register object_prototype = scratch;
+    __ LoadTaggedField(object_prototype, map, Map::kPrototypeOffset);
+    __ JumpIfRoot(object_prototype, RootIndex::kNullValue, &return_false,
+                  Label::kNear);
+    __ CompareTagged(object_prototype, prototype().object());
+    __ JumpIf(kEqual, &return_true, Label::kNear);
+
+    // Continue with the prototype.
+    __ AssertNotSmi(object_prototype);
+    __ LoadMap(map, object_prototype);
+    __ Jump(&loop);
+  }
+
+  __ bind(&return_true);
+  __ LoadRoot(result_reg, RootIndex::kTrueValue);
+  __ Jump(*done, Label::kNear);
+
+  __ bind(&return_false);
+  __ LoadRoot(result_reg, RootIndex::kFalseValue);
+  __ bind(*done);
+}
+
 void DebugBreak::SetValueLocationConstraints() {}
 void DebugBreak::GenerateCode(MaglevAssembler* masm,
                               const ProcessingState& state) {
@@ -2178,14 +3415,13 @@ void LoadNamedGeneric::SetValueLocationConstraints() {
 }
 void LoadNamedGeneric::GenerateCode(MaglevAssembler* masm,
                                     const ProcessingState& state) {
-  using D = LoadWithVectorDescriptor;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object_input()), D::GetRegisterParameter(D::kReceiver));
-  __ Move(D::GetRegisterParameter(D::kName), name().object());
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          Smi::FromInt(feedback().slot.ToInt()));
-  __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-  __ CallBuiltin(Builtin::kLoadIC);
+  __ CallBuiltin<Builtin::kLoadIC>(
+      context(),                                    // context
+      object_input(),                               // receiver
+      name().object(),                              // name
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -2202,16 +3438,14 @@ void LoadNamedFromSuperGeneric::SetValueLocationConstraints() {
 }
 void LoadNamedFromSuperGeneric::GenerateCode(MaglevAssembler* masm,
                                              const ProcessingState& state) {
-  using D = LoadWithReceiverAndVectorDescriptor;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(receiver()), D::GetRegisterParameter(D::kReceiver));
-  DCHECK_EQ(ToRegister(lookup_start_object()),
-            D::GetRegisterParameter(D::kLookupStartObject));
-  __ Move(D::GetRegisterParameter(D::kName), name().object());
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          Smi::FromInt(feedback().slot.ToInt()));
-  __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-  __ CallBuiltin(Builtin::kLoadSuperIC);
+  __ CallBuiltin<Builtin::kLoadSuperIC>(
+      context(),                                    // context
+      receiver(),                                   // receiver
+      lookup_start_object(),                        // lookup start object
+      name().object(),                              // name
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -2228,15 +3462,14 @@ void SetNamedGeneric::SetValueLocationConstraints() {
 }
 void SetNamedGeneric::GenerateCode(MaglevAssembler* masm,
                                    const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kStoreIC>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object_input()), D::GetRegisterParameter(D::kReceiver));
-  DCHECK_EQ(ToRegister(value_input()), D::GetRegisterParameter(D::kValue));
-  __ Move(D::GetRegisterParameter(D::kName), name().object());
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-  __ CallBuiltin(Builtin::kStoreIC);
+  __ CallBuiltin<Builtin::kStoreIC>(
+      context(),                                    // context
+      object_input(),                               // receiver
+      name().object(),                              // name
+      value_input(),                                // value
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -2253,18 +3486,44 @@ void DefineNamedOwnGeneric::SetValueLocationConstraints() {
 }
 void DefineNamedOwnGeneric::GenerateCode(MaglevAssembler* masm,
                                          const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kDefineNamedOwnIC>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object_input()), D::GetRegisterParameter(D::kReceiver));
-  DCHECK_EQ(ToRegister(value_input()), D::GetRegisterParameter(D::kValue));
-  __ Move(D::GetRegisterParameter(D::kName), name().object());
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-  __ CallBuiltin(Builtin::kDefineNamedOwnIC);
+  __ CallBuiltin<Builtin::kDefineNamedOwnIC>(
+      context(),                                    // context
+      object_input(),                               // receiver
+      name().object(),                              // name
+      value_input(),                                // value
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
+void UpdateJSArrayLength::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  UseAndClobberRegister(index_input());
+  UseRegister(length_input());
+}
+void UpdateJSArrayLength::GenerateCode(MaglevAssembler* masm,
+                                       const ProcessingState& state) {
+  Register object = ToRegister(object_input());
+  Register index = ToRegister(index_input());
+  Register length = ToRegister(length_input());
+  Label done;
+  if (v8_flags.debug_code) {
+    __ IsObjectType(object, JS_ARRAY_TYPE);
+    __ Assert(kEqual, AbortReason::kUnexpectedValue);
+    static_assert(Internals::IsValidSmi(FixedArray::kMaxLength),
+                  "MaxLength not a Smi");
+    __ CompareInt32(index, FixedArray::kMaxLength);
+    __ Assert(kUnsignedLessThan, AbortReason::kUnexpectedValue);
+  }
+  __ CompareInt32(index, length);
+  __ JumpIf(kUnsignedLessThan, &done);
+  __ IncrementInt32(index);  // This cannot overflow.
+  __ SmiTag(index);
+  __ StoreTaggedSignedField(object, JSArray::kLengthOffset, index);
+  __ bind(&done);
+}
+
 void EnsureWritableFastElements::SetValueLocationConstraints() {
   UseRegister(elements_input());
   UseRegister(object_input());
@@ -2275,30 +3534,75 @@ void EnsureWritableFastElements::GenerateCode(MaglevAssembler* masm,
                                               const ProcessingState& state) {
   Register object = ToRegister(object_input());
   Register elements = ToRegister(elements_input());
-  Register result_reg = ToRegister(result());
-  DCHECK_EQ(elements, result_reg);
+  DCHECK_EQ(elements, ToRegister(result()));
   MaglevAssembler::ScratchRegisterScope temps(masm);
   Register scratch = temps.Acquire();
-  __ CompareMapWithRoot(elements, RootIndex::kFixedArrayMap, scratch);
+  __ EnsureWritableFastElements(register_snapshot(), elements, object, scratch);
+}
+
+void MaybeGrowAndEnsureWritableFastElements::SetValueLocationConstraints() {
+  UseRegister(elements_input());
+  UseRegister(object_input());
+  UseRegister(index_input());
+  UseRegister(elements_length_input());
+  if (IsSmiOrObjectElementsKind(elements_kind())) {
+    set_temporaries_needed(1);
+  }
+  DefineSameAsFirst(this);
+}
+void MaybeGrowAndEnsureWritableFastElements::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  Register elements = ToRegister(elements_input());
+  Register object = ToRegister(object_input());
+  Register index = ToRegister(index_input());
+  Register elements_length = ToRegister(elements_length_input());
+  DCHECK_EQ(elements, ToRegister(result()));
+
   ZoneLabelRef done(masm);
+  __ CompareInt32(index, elements_length);
   __ JumpToDeferredIf(
-      kNotEqual,
+      kUnsignedGreaterThanEqual,
       [](MaglevAssembler* masm, ZoneLabelRef done, Register object,
-         Register result_reg, RegisterSnapshot snapshot) {
+         Register index, Register result_reg,
+         MaybeGrowAndEnsureWritableFastElements* node) {
         {
-          using D = CallInterfaceDescriptorFor<
-              Builtin::kCopyFastSmiOrObjectElements>::type;
+          RegisterSnapshot snapshot = node->register_snapshot();
+          AddDeoptRegistersToSnapshot(&snapshot, node->eager_deopt_info());
           snapshot.live_registers.clear(result_reg);
           snapshot.live_tagged_registers.clear(result_reg);
           SaveRegisterStateForCall save_register_state(masm, snapshot);
-          __ Move(D::GetRegisterParameter(D::kObject), object);
-          __ CallBuiltin(Builtin::kCopyFastSmiOrObjectElements);
+          using D = GrowArrayElementsDescriptor;
+          if (index == D::GetRegisterParameter(D::kObject)) {
+            // That implies that the first parameter move will clobber the index
+            // value. So we use the result register as temporary.
+            // TODO(leszeks): Use parallel moves to resolve cases like this.
+            __ SmiTag(result_reg, index);
+            index = result_reg;
+          } else {
+            __ SmiTag(index);
+          }
+          if (IsDoubleElementsKind(node->elements_kind())) {
+            __ CallBuiltin<Builtin::kGrowFastDoubleElements>(object, index);
+          } else {
+            __ CallBuiltin<Builtin::kGrowFastSmiOrObjectElements>(object,
+                                                                  index);
+          }
           save_register_state.DefineSafepoint();
           __ Move(result_reg, kReturnRegister0);
         }
+        __ EmitEagerDeoptIfSmi(node, result_reg,
+                               DeoptimizeReason::kCouldNotGrowElements);
         __ Jump(*done);
       },
-      done, object, result_reg, register_snapshot());
+      done, object, index, elements, this);
+
+  if (IsSmiOrObjectElementsKind(elements_kind())) {
+    MaglevAssembler::ScratchRegisterScope temps(masm);
+    Register scratch = temps.Acquire();
+    __ EnsureWritableFastElements(register_snapshot(), elements, object,
+                                  scratch);
+  }
+
   __ bind(*done);
 }
 
@@ -2316,15 +3620,14 @@ void SetKeyedGeneric::SetValueLocationConstraints() {
 }
 void SetKeyedGeneric::GenerateCode(MaglevAssembler* masm,
                                    const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kKeyedStoreIC>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object_input()), D::GetRegisterParameter(D::kReceiver));
-  DCHECK_EQ(ToRegister(key_input()), D::GetRegisterParameter(D::kName));
-  DCHECK_EQ(ToRegister(value_input()), D::GetRegisterParameter(D::kValue));
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-  __ CallBuiltin(Builtin::kKeyedStoreIC);
+  __ CallBuiltin<Builtin::kKeyedStoreIC>(
+      context(),                                    // context
+      object_input(),                               // receiver
+      key_input(),                                  // name
+      value_input(),                                // value
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -2343,16 +3646,15 @@ void DefineKeyedOwnGeneric::SetValueLocationConstraints() {
 }
 void DefineKeyedOwnGeneric::GenerateCode(MaglevAssembler* masm,
                                          const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kDefineKeyedOwnIC>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object_input()), D::GetRegisterParameter(D::kReceiver));
-  DCHECK_EQ(ToRegister(key_input()), D::GetRegisterParameter(D::kName));
-  DCHECK_EQ(ToRegister(value_input()), D::GetRegisterParameter(D::kValue));
-  DCHECK_EQ(ToRegister(flags_input()), D::GetRegisterParameter(D::kFlags));
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Push(feedback().vector);
-  __ CallBuiltin(Builtin::kDefineKeyedOwnIC);
+  __ CallBuiltin<Builtin::kDefineKeyedOwnIC>(
+      context(),                                    // context
+      object_input(),                               // receiver
+      key_input(),                                  // name
+      value_input(),                                // value
+      flags_input(),                                // flags
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -2370,15 +3672,14 @@ void StoreInArrayLiteralGeneric::SetValueLocationConstraints() {
 }
 void StoreInArrayLiteralGeneric::GenerateCode(MaglevAssembler* masm,
                                               const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kStoreInArrayLiteralIC>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object_input()), D::GetRegisterParameter(D::kReceiver));
-  DCHECK_EQ(ToRegister(value_input()), D::GetRegisterParameter(D::kValue));
-  DCHECK_EQ(ToRegister(name_input()), D::GetRegisterParameter(D::kName));
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().index()));
-  __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-  __ CallBuiltin(Builtin::kStoreInArrayLiteralIC);
+  __ CallBuiltin<Builtin::kStoreInArrayLiteralIC>(
+      context(),                                    // context
+      object_input(),                               // receiver
+      name_input(),                                 // name
+      value_input(),                                // value
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -2401,12 +3702,12 @@ void GeneratorRestoreRegister::GenerateCode(MaglevAssembler* masm,
   Register value = (array == result_reg ? temp : result_reg);
 
   // Loads the current value in the generator register file.
-  __ DecompressTagged(
-      value, FieldMemOperand(array, FixedArray::OffsetOfElementAt(index())));
+  __ LoadTaggedField(value, array, FixedArray::OffsetOfElementAt(index()));
 
   // And trashs it with StaleRegisterConstant.
-  __ StoreTaggedField(
-      FieldMemOperand(array, FixedArray::OffsetOfElementAt(index())), stale);
+  DCHECK(stale_input().node()->Is<RootConstant>());
+  __ StoreTaggedFieldNoWriteBarrier(
+      array, FixedArray::OffsetOfElementAt(index()), stale);
 
   if (value != result_reg) {
     __ Move(result_reg, value);
@@ -2494,17 +3795,82 @@ void GetKeyedGeneric::SetValueLocationConstraints() {
 }
 void GetKeyedGeneric::GenerateCode(MaglevAssembler* masm,
                                    const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kKeyedLoadIC>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object_input()), D::GetRegisterParameter(D::kReceiver));
-  DCHECK_EQ(ToRegister(key_input()), D::GetRegisterParameter(D::kName));
-  __ Move(D::GetRegisterParameter(D::kSlot),
-          TaggedIndex::FromIntptr(feedback().slot.ToInt()));
-  __ Move(D::GetRegisterParameter(D::kVector), feedback().vector);
-  __ CallBuiltin(Builtin::kKeyedLoadIC);
+  __ CallBuiltin<Builtin::kKeyedLoadIC>(
+      context(),                                    // context
+      object_input(),                               // receiver
+      key_input(),                                  // name
+      TaggedIndex::FromIntptr(feedback().index()),  // feedback slot
+      feedback().vector                             // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
+void Int32ToNumber::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineAsRegister(this);
+}
+void Int32ToNumber::GenerateCode(MaglevAssembler* masm,
+                                 const ProcessingState& state) {
+  Register object = ToRegister(result());
+  Register value = ToRegister(input());
+  ZoneLabelRef done(masm);
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  bool input_output_alias = (object == value);
+  Register res = object;
+  if (input_output_alias) {
+    res = temps.GetDefaultScratchRegister();
+  }
+  __ SmiTagInt32AndJumpIfFail(
+      res, value,
+      __ MakeDeferredCode(
+          [](MaglevAssembler* masm, Register object, Register value,
+             ZoneLabelRef done, Int32ToNumber* node) {
+            MaglevAssembler::ScratchRegisterScope temps(masm);
+            DoubleRegister double_value =
+                temps.GetDefaultScratchDoubleRegister();
+            __ Int32ToDouble(double_value, value);
+            __ AllocateHeapNumber(node->register_snapshot(), object,
+                                  double_value);
+            __ Jump(*done);
+          },
+          object, value, done, this));
+  if (input_output_alias) {
+    __ Move(object, res);
+  }
+  __ bind(*done);
+}
+
+void Uint32ToNumber::SetValueLocationConstraints() {
+  UseRegister(input());
+#ifdef V8_TARGET_ARCH_X64
+  // We emit slightly more efficient code if result is the same as input.
+  DefineSameAsFirst(this);
+#else
+  DefineAsRegister(this);
+#endif
+}
+void Uint32ToNumber::GenerateCode(MaglevAssembler* masm,
+                                  const ProcessingState& state) {
+  ZoneLabelRef done(masm);
+  Register value = ToRegister(input());
+  Register object = ToRegister(result());
+  __ SmiTagUint32AndJumpIfFail(
+      object, value,
+      __ MakeDeferredCode(
+          [](MaglevAssembler* masm, Register object, Register value,
+             ZoneLabelRef done, Uint32ToNumber* node) {
+            MaglevAssembler::ScratchRegisterScope temps(masm);
+            DoubleRegister double_value =
+                temps.GetDefaultScratchDoubleRegister();
+            __ Uint32ToDouble(double_value, value);
+            __ AllocateHeapNumber(node->register_snapshot(), object,
+                                  double_value);
+            __ Jump(*done);
+          },
+          object, value, done, this));
+  __ bind(*done);
+}
+
 void Float64ToTagged::SetValueLocationConstraints() {
   UseRegister(input());
   DefineAsRegister(this);
@@ -2516,8 +3882,8 @@ void Float64ToTagged::GenerateCode(MaglevAssembler* masm,
   Label box, done;
   if (canonicalize_smi()) {
     __ TryTruncateDoubleToInt32(object, value, &box);
-    __ SmiTagInt32(object, &box);
-    __ jmp(&done);
+    __ SmiTagInt32AndJumpIfFail(object, &box);
+    __ Jump(&done, Label::kNear);
     __ bind(&box);
   }
   __ AllocateHeapNumber(register_snapshot(), object, value);
@@ -2526,36 +3892,44 @@ void Float64ToTagged::GenerateCode(MaglevAssembler* masm,
   }
 }
 
-void Float64Round::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-  if (kind_ == Kind::kNearest) {
-    set_double_temporaries_needed(1);
-  }
-}
-void HoleyFloat64Box::SetValueLocationConstraints() {
+void HoleyFloat64ToTagged::SetValueLocationConstraints() {
   UseRegister(input());
   DefineAsRegister(this);
 }
-void HoleyFloat64Box::GenerateCode(MaglevAssembler* masm,
-                                   const ProcessingState& state) {
+void HoleyFloat64ToTagged::GenerateCode(MaglevAssembler* masm,
+                                        const ProcessingState& state) {
   ZoneLabelRef done(masm);
   DoubleRegister value = ToDoubleRegister(input());
-  // Using return as scratch register.
-  Register repr = ToRegister(result());
   Register object = ToRegister(result());
-  __ DoubleToInt64Repr(repr, value);
-  __ JumpToDeferredIf(
-      __ IsInt64Constant(repr, kHoleNanInt64),
-      [](MaglevAssembler* masm, Register object, ZoneLabelRef done) {
-        __ LoadRoot(object, RootIndex::kUndefinedValue);
-        __ Jump(*done);
-      },
-      object, done);
+  Label box;
+  if (canonicalize_smi()) {
+    __ TryTruncateDoubleToInt32(object, value, &box);
+    __ SmiTagInt32AndJumpIfFail(object, &box);
+    __ Jump(*done, Label::kNear);
+    __ bind(&box);
+  }
+  // Using return as scratch register.
+  __ JumpIfHoleNan(
+      value, ToRegister(result()),
+      __ MakeDeferredCode(
+          [](MaglevAssembler* masm, Register object, ZoneLabelRef done) {
+            // TODO(leszeks): Evaluate whether this is worth deferring.
+            __ LoadRoot(object, RootIndex::kUndefinedValue);
+            __ Jump(*done);
+          },
+          object, done));
   __ AllocateHeapNumber(register_snapshot(), object, value);
   __ bind(*done);
 }
 
+void Float64Round::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineAsRegister(this);
+  if (kind_ == Kind::kNearest) {
+    set_double_temporaries_needed(1);
+  }
+}
+
 void CheckedSmiTagFloat64::SetValueLocationConstraints() {
   UseRegister(input());
   DefineAsRegister(this);
@@ -2567,7 +3941,8 @@ void CheckedSmiTagFloat64::GenerateCode(MaglevAssembler* masm,
 
   __ TryTruncateDoubleToInt32(
       object, value, __ GetDeoptLabel(this, DeoptimizeReason::kNotASmi));
-  __ SmiTagInt32(object, __ GetDeoptLabel(this, DeoptimizeReason::kNotASmi));
+  __ SmiTagInt32AndJumpIfFail(
+      object, __ GetDeoptLabel(this, DeoptimizeReason::kNotASmi));
 }
 
 void StoreFloat64::SetValueLocationConstraints() {
@@ -2580,22 +3955,7 @@ void StoreFloat64::GenerateCode(MaglevAssembler* masm,
   DoubleRegister value = ToDoubleRegister(value_input());
 
   __ AssertNotSmi(object);
-  __ Move(FieldMemOperand(object, offset()), value);
-}
-
-void CheckedStoreSmiField::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(value_input());
-}
-void CheckedStoreSmiField::GenerateCode(MaglevAssembler* masm,
-                                        const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register value = ToRegister(value_input());
-
-  Condition is_smi = __ CheckSmi(value);
-  __ EmitEagerDeoptIf(NegateCondition(is_smi), DeoptimizeReason::kNotASmi,
-                      this);
-  __ StoreTaggedField(FieldMemOperand(object, offset()), value);
+  __ StoreFloat64(FieldMemOperand(object, offset()), value);
 }
 
 void StoreTaggedFieldNoWriteBarrier::SetValueLocationConstraints() {
@@ -2608,7 +3968,7 @@ void StoreTaggedFieldNoWriteBarrier::GenerateCode(
   Register value = ToRegister(value_input());
 
   __ AssertNotSmi(object);
-  __ StoreTaggedField(FieldMemOperand(object, offset()), value);
+  __ StoreTaggedFieldNoWriteBarrier(object, offset(), value);
 }
 
 int StringAt::MaxCallStackArgs() const {
@@ -2650,6 +4010,73 @@ void StringLength::GenerateCode(MaglevAssembler* masm,
   __ StringLength(ToRegister(result()), ToRegister(object_input()));
 }
 
+void StringConcat::SetValueLocationConstraints() {
+  using D = StringAdd_CheckNoneDescriptor;
+  UseFixed(lhs(), D::GetRegisterParameter(D::kLeft));
+  UseFixed(rhs(), D::GetRegisterParameter(D::kRight));
+  DefineAsFixed(this, kReturnRegister0);
+}
+void StringConcat::GenerateCode(MaglevAssembler* masm,
+                                const ProcessingState& state) {
+  __ CallBuiltin<Builtin::kStringAdd_CheckNone>(
+      masm->native_context().object(),  // context
+      lhs(),                            // left
+      rhs()                             // right
+  );
+  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+  DCHECK_EQ(kReturnRegister0, ToRegister(result()));
+}
+
+void StringEqual::SetValueLocationConstraints() {
+  using D = StringEqualDescriptor;
+  UseFixed(lhs(), D::GetRegisterParameter(D::kLeft));
+  UseFixed(rhs(), D::GetRegisterParameter(D::kRight));
+  set_temporaries_needed(1);
+  RequireSpecificTemporary(D::GetRegisterParameter(D::kLength));
+  DefineAsFixed(this, kReturnRegister0);
+}
+void StringEqual::GenerateCode(MaglevAssembler* masm,
+                               const ProcessingState& state) {
+  using D = StringEqualDescriptor;
+  Label done, if_equal, if_not_equal;
+  Register left = ToRegister(lhs());
+  Register right = ToRegister(rhs());
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register left_length = temps.Acquire();
+  Register right_length = D::GetRegisterParameter(D::kLength);
+
+  __ CmpTagged(left, right);
+  __ JumpIf(kEqual, &if_equal,
+            // Debug checks in StringLength can make this jump too long for a
+            // near jump.
+            v8_flags.debug_code ? Label::kFar : Label::kNear);
+
+  __ StringLength(left_length, left);
+  __ StringLength(right_length, right);
+  __ CompareInt32(left_length, right_length);
+  __ JumpIf(kNotEqual, &if_not_equal, Label::Distance::kNear);
+
+  // The inputs are already in the right registers. The |left| and |right|
+  // inputs were required to come in in the left/right inputs of the builtin,
+  // and the |length| input of the builtin is where we loaded the length of the
+  // right string (which matches the length of the left string when we get
+  // here).
+  DCHECK_EQ(right_length, D::GetRegisterParameter(D::kLength));
+  __ CallBuiltin<Builtin::kStringEqual>(lhs(), rhs(),
+                                        D::GetRegisterParameter(D::kLength));
+  masm->DefineLazyDeoptPoint(this->lazy_deopt_info());
+  __ Jump(&done, Label::Distance::kNear);
+
+  __ bind(&if_equal);
+  __ LoadRoot(ToRegister(result()), RootIndex::kTrueValue);
+  __ Jump(&done, Label::Distance::kNear);
+
+  __ bind(&if_not_equal);
+  __ LoadRoot(ToRegister(result()), RootIndex::kFalseValue);
+
+  __ bind(&done);
+}
+
 void TaggedEqual::SetValueLocationConstraints() {
   UseRegister(lhs());
   UseRegister(rhs());
@@ -2697,31 +4124,26 @@ void TestInstanceOf::SetValueLocationConstraints() {
 }
 void TestInstanceOf::GenerateCode(MaglevAssembler* masm,
                                   const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<Builtin::kInstanceOf_WithFeedback>::type;
-#ifdef DEBUG
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(object()), D::GetRegisterParameter(D::kLeft));
-  DCHECK_EQ(ToRegister(callable()), D::GetRegisterParameter(D::kRight));
-#endif
-  __ Move(D::GetRegisterParameter(D::kFeedbackVector), feedback().vector);
-  __ Move(D::GetRegisterParameter(D::kSlot), feedback().index());
-  __ CallBuiltin(Builtin::kInstanceOf_WithFeedback);
+  __ CallBuiltin<Builtin::kInstanceOf_WithFeedback>(
+      context(),           // context
+      object(),            // left
+      callable(),          // right
+      feedback().index(),  // feedback slot
+      feedback().vector    // feedback vector
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
 void TestTypeOf::SetValueLocationConstraints() {
   UseRegister(value());
   DefineAsRegister(this);
+#ifdef V8_TARGET_ARCH_ARM
+  set_temporaries_needed(1);
+#endif
 }
 void TestTypeOf::GenerateCode(MaglevAssembler* masm,
                               const ProcessingState& state) {
   Register object = ToRegister(value());
-  // Use return register as temporary if needed. Be careful: {object} and
-  // {scratch} could alias (which means that {object} should be considered dead
-  // once {scratch} has been written to).
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  temps.Include(ToRegister(result()));
-
   Label is_true, is_false, done;
   __ TestTypeOf(object, literal_, &is_true, Label::Distance::kNear, true,
                 &is_false, Label::Distance::kNear, false);
@@ -2746,7 +4168,7 @@ void ToBoolean::GenerateCode(MaglevAssembler* masm,
   ZoneLabelRef object_is_true(masm), object_is_false(masm);
   // TODO(leszeks): We're likely to be calling this on an existing boolean --
   // maybe that's a case we should fast-path here and re-use that boolean value?
-  __ ToBoolean(object, object_is_true, object_is_false, true);
+  __ ToBoolean(object, check_type(), object_is_true, object_is_false, true);
   __ bind(*object_is_true);
   __ LoadRoot(return_value, RootIndex::kTrueValue);
   __ Jump(&done);
@@ -2765,7 +4187,7 @@ void ToBooleanLogicalNot::GenerateCode(MaglevAssembler* masm,
   Register return_value = ToRegister(result());
   Label done;
   ZoneLabelRef object_is_true(masm), object_is_false(masm);
-  __ ToBoolean(object, object_is_true, object_is_false, true);
+  __ ToBoolean(object, check_type(), object_is_true, object_is_false, true);
   __ bind(*object_is_true);
   __ LoadRoot(return_value, RootIndex::kFalseValue);
   __ Jump(&done);
@@ -2785,12 +4207,9 @@ void ToName::SetValueLocationConstraints() {
   DefineAsFixed(this, kReturnRegister0);
 }
 void ToName::GenerateCode(MaglevAssembler* masm, const ProcessingState& state) {
-#ifdef DEBUG
-  using D = CallInterfaceDescriptorFor<Builtin::kToName>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(value_input()), D::GetRegisterParameter(D::kInput));
-#endif  // DEBUG
-  __ CallBuiltin(Builtin::kToName);
+  __ CallBuiltin<Builtin::kToName>(context(),     // context
+                                   value_input()  // input
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -2798,22 +4217,51 @@ int ToNumberOrNumeric::MaxCallStackArgs() const {
   return TypeConversionDescriptor::GetStackParameterCount();
 }
 void ToNumberOrNumeric::SetValueLocationConstraints() {
-  using D = TypeConversionDescriptor;
-  UseFixed(context(), kContextRegister);
-  UseFixed(value_input(), D::GetRegisterParameter(D::kArgument));
-  DefineAsFixed(this, kReturnRegister0);
+  UseRegister(value_input());
+  set_temporaries_needed(1);
+  DefineAsRegister(this);
 }
 void ToNumberOrNumeric::GenerateCode(MaglevAssembler* masm,
                                      const ProcessingState& state) {
-  switch (mode()) {
-    case Object::Conversion::kToNumber:
-      __ CallBuiltin(Builtin::kToNumber);
-      break;
-    case Object::Conversion::kToNumeric:
-      __ CallBuiltin(Builtin::kToNumeric);
-      break;
-  }
-  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+  ZoneLabelRef done(masm);
+  Label move_and_return;
+  Register object = ToRegister(value_input());
+  Register result_reg = ToRegister(result());
+
+  __ JumpIfSmi(object, &move_and_return, Label::kNear);
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+  __ CompareMapWithRoot(object, RootIndex::kHeapNumberMap, scratch);
+  __ JumpToDeferredIf(
+      kNotEqual,
+      [](MaglevAssembler* masm, Object::Conversion mode, Register object,
+         Register result_reg, ToNumberOrNumeric* node, ZoneLabelRef done) {
+        {
+          RegisterSnapshot snapshot = node->register_snapshot();
+          snapshot.live_registers.clear(result_reg);
+          SaveRegisterStateForCall save_register_state(masm, snapshot);
+          switch (mode) {
+            case Object::Conversion::kToNumber:
+              __ CallBuiltin<Builtin::kToNumber>(
+                  masm->native_context().object(), object);
+              break;
+            case Object::Conversion::kToNumeric:
+              __ CallBuiltin<Builtin::kToNumeric>(
+                  masm->native_context().object(), object);
+              break;
+          }
+          masm->DefineExceptionHandlerPoint(node);
+          save_register_state.DefineSafepointWithLazyDeopt(
+              node->lazy_deopt_info());
+          __ Move(result_reg, kReturnRegister0);
+        }
+        __ Jump(*done);
+      },
+      mode(), object, result_reg, this, done);
+  __ bind(&move_and_return);
+  __ Move(result_reg, object);
+
+  __ bind(*done);
 }
 
 int ToObject::MaxCallStackArgs() const {
@@ -2828,18 +4276,19 @@ void ToObject::SetValueLocationConstraints() {
 }
 void ToObject::GenerateCode(MaglevAssembler* masm,
                             const ProcessingState& state) {
-#ifdef DEBUG
-  using D = CallInterfaceDescriptorFor<Builtin::kToObject>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(value_input()), D::GetRegisterParameter(D::kInput));
-#endif  // DEBUG
   Register value = ToRegister(value_input());
   Label call_builtin, done;
   // Avoid the builtin call if {value} is a JSReceiver.
-  __ JumpIfSmi(value, &call_builtin, Label::Distance::kNear);
+  if (check_type() == CheckType::kOmitHeapObjectCheck) {
+    __ AssertNotSmi(value);
+  } else {
+    __ JumpIfSmi(value, &call_builtin, Label::Distance::kNear);
+  }
   __ JumpIfJSAnyIsNotPrimitive(value, &done, Label::Distance::kNear);
   __ bind(&call_builtin);
-  __ CallBuiltin(Builtin::kToObject);
+  __ CallBuiltin<Builtin::kToObject>(context(),     // context
+                                     value_input()  // input
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
   __ bind(&done);
 }
@@ -2856,23 +4305,38 @@ void ToString::SetValueLocationConstraints() {
 }
 void ToString::GenerateCode(MaglevAssembler* masm,
                             const ProcessingState& state) {
-#ifdef DEBUG
-  using D = CallInterfaceDescriptorFor<Builtin::kToString>::type;
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  DCHECK_EQ(ToRegister(value_input()), D::GetRegisterParameter(D::kO));
-#endif  // DEBUG
   Register value = ToRegister(value_input());
   Label call_builtin, done;
   // Avoid the builtin call if {value} is a string.
   __ JumpIfSmi(value, &call_builtin, Label::Distance::kNear);
   __ CompareObjectType(value, FIRST_NONSTRING_TYPE);
   __ JumpIf(kUnsignedLessThan, &done, Label::Distance::kNear);
+  if (mode() == kConvertSymbol) {
+    __ CompareObjectType(value, SYMBOL_TYPE);
+    __ JumpIf(kNotEqual, &call_builtin, Label::Distance::kNear);
+    __ Push(value);
+    __ CallRuntime(Runtime::kSymbolDescriptiveString, 1);
+    __ Jump(&done, Label::kNear);
+  }
   __ bind(&call_builtin);
-  __ CallBuiltin(Builtin::kToString);
+  __ CallBuiltin<Builtin::kToString>(context(),     // context
+                                     value_input()  // input
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
   __ bind(&done);
 }
 
+void NumberToString::SetValueLocationConstraints() {
+  using D = CallInterfaceDescriptorFor<Builtin::kNumberToString>::type;
+  UseFixed(value_input(), D::GetRegisterParameter(D::kInput));
+  DefineAsFixed(this, kReturnRegister0);
+}
+void NumberToString::GenerateCode(MaglevAssembler* masm,
+                                  const ProcessingState& state) {
+  __ CallBuiltin<Builtin::kNumberToString>(value_input());
+  masm->DefineLazyDeoptPoint(this->lazy_deopt_info());
+}
+
 int ThrowReferenceErrorIfHole::MaxCallStackArgs() const { return 1; }
 void ThrowReferenceErrorIfHole::SetValueLocationConstraints() {
   UseAny(value());
@@ -2925,6 +4389,64 @@ void ThrowSuperAlreadyCalledIfNotHole::GenerateCode(
       this);
 }
 
+int ThrowIfNotCallable::MaxCallStackArgs() const { return 1; }
+void ThrowIfNotCallable::SetValueLocationConstraints() {
+  UseRegister(value());
+  set_temporaries_needed(1);
+}
+void ThrowIfNotCallable::GenerateCode(MaglevAssembler* masm,
+                                      const ProcessingState& state) {
+  Label* if_not_callable = __ MakeDeferredCode(
+      [](MaglevAssembler* masm, ThrowIfNotCallable* node) {
+        __ Push(node->value());
+        __ Move(kContextRegister, masm->native_context().object());
+        __ CallRuntime(Runtime::kThrowCalledNonCallable, 1);
+        masm->DefineExceptionHandlerAndLazyDeoptPoint(node);
+        __ Abort(AbortReason::kUnexpectedReturnFromThrow);
+      },
+      this);
+
+  Register value_reg = ToRegister(value());
+  __ JumpIfSmi(value_reg, if_not_callable);
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+  __ LoadMap(scratch, value_reg);
+  static_assert(Map::kBitFieldOffsetEnd + 1 - Map::kBitFieldOffset == 1);
+  __ LoadUnsignedField(scratch, FieldMemOperand(scratch, Map::kBitFieldOffset),
+                       1);
+  __ TestInt32AndJumpIfAllClear(scratch, Map::Bits1::IsCallableBit::kMask,
+                                if_not_callable);
+}
+
+int ThrowIfNotSuperConstructor::MaxCallStackArgs() const { return 2; }
+void ThrowIfNotSuperConstructor::SetValueLocationConstraints() {
+  UseRegister(constructor());
+  UseRegister(function());
+  set_temporaries_needed(1);
+}
+void ThrowIfNotSuperConstructor::GenerateCode(MaglevAssembler* masm,
+                                              const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+  __ LoadMap(scratch, ToRegister(constructor()));
+  static_assert(Map::kBitFieldOffsetEnd + 1 - Map::kBitFieldOffset == 1);
+  __ LoadUnsignedField(scratch, FieldMemOperand(scratch, Map::kBitFieldOffset),
+                       1);
+  __ TestInt32AndJumpIfAllClear(
+      scratch, Map::Bits1::IsConstructorBit::kMask,
+      __ MakeDeferredCode(
+          [](MaglevAssembler* masm, ThrowIfNotSuperConstructor* node) {
+            __ Push(ToRegister(node->constructor()),
+                    ToRegister(node->function()));
+            __ Move(kContextRegister, masm->native_context().object());
+            __ CallRuntime(Runtime::kThrowNotSuperConstructor, 2);
+            masm->DefineExceptionHandlerAndLazyDeoptPoint(node);
+            __ Abort(AbortReason::kUnexpectedReturnFromThrow);
+          },
+          this));
+}
+
 void TruncateUint32ToInt32::SetValueLocationConstraints() {
   UseRegister(input());
   DefineSameAsFirst(this);
@@ -2955,6 +4477,17 @@ void CheckedTruncateFloat64ToInt32::GenerateCode(MaglevAssembler* masm,
       __ GetDeoptLabel(this, DeoptimizeReason::kNotInt32));
 }
 
+void CheckedTruncateFloat64ToUint32::SetValueLocationConstraints() {
+  UseRegister(input());
+  DefineAsRegister(this);
+}
+void CheckedTruncateFloat64ToUint32::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
+  __ TryTruncateDoubleToUint32(
+      ToRegister(result()), ToDoubleRegister(input()),
+      __ GetDeoptLabel(this, DeoptimizeReason::kNotUint32));
+}
+
 void UnsafeTruncateFloat64ToInt32::SetValueLocationConstraints() {
   UseRegister(input());
   DefineAsRegister(this);
@@ -3062,6 +4595,84 @@ void Float64ToUint8Clamped::GenerateCode(MaglevAssembler* masm,
   __ bind(&done);
 }
 
+void CheckNumber::SetValueLocationConstraints() {
+  UseRegister(receiver_input());
+}
+void CheckNumber::GenerateCode(MaglevAssembler* masm,
+                               const ProcessingState& state) {
+  Label done;
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.GetDefaultScratchRegister();
+  Register value = ToRegister(receiver_input());
+  // If {value} is a Smi or a HeapNumber, we're done.
+  __ JumpIfSmi(value, &done, Label::Distance::kNear);
+  if (mode() == Object::Conversion::kToNumeric) {
+    __ LoadMap(scratch, value);
+    __ CompareRoot(scratch, RootIndex::kHeapNumberMap);
+    // Jump to done if it is a HeapNumber.
+    __ JumpIf(kEqual, &done, Label::Distance::kNear);
+    // Check if it is a BigInt.
+    __ CompareRoot(scratch, RootIndex::kBigIntMap);
+  } else {
+    __ CompareMapWithRoot(value, RootIndex::kHeapNumberMap, scratch);
+  }
+  __ EmitEagerDeoptIf(kNotEqual, DeoptimizeReason::kNotANumber, this);
+  __ bind(&done);
+}
+
+void CheckedInternalizedString::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  DefineSameAsFirst(this);
+}
+void CheckedInternalizedString::GenerateCode(MaglevAssembler* masm,
+                                             const ProcessingState& state) {
+  Register object = ToRegister(object_input());
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register instance_type = temps.GetDefaultScratchRegister();
+  if (check_type() == CheckType::kOmitHeapObjectCheck) {
+    __ AssertNotSmi(object);
+  } else {
+    __ EmitEagerDeoptIfSmi(this, object, DeoptimizeReason::kWrongMap);
+  }
+  __ LoadInstanceType(instance_type, object);
+  __ RecordComment("Test IsInternalizedString");
+  // Go to the slow path if this is a non-string, or a non-internalised string.
+  static_assert((kStringTag | kInternalizedTag) == 0);
+  ZoneLabelRef done(masm);
+  __ TestInt32AndJumpIfAnySet(
+      instance_type, kIsNotStringMask | kIsNotInternalizedMask,
+      __ MakeDeferredCode(
+          [](MaglevAssembler* masm, ZoneLabelRef done,
+             CheckedInternalizedString* node, Register object,
+             Register instance_type) {
+            __ RecordComment("Deferred Test IsThinString");
+            // Deopt if this isn't a string.
+            __ TestInt32AndJumpIfAnySet(
+                instance_type, kIsNotStringMask,
+                __ GetDeoptLabel(node, DeoptimizeReason::kWrongMap));
+            // Deopt if this isn't a thin string.
+            static_assert(base::bits::CountPopulation(kThinStringTagBit) == 1);
+            __ TestInt32AndJumpIfAllClear(
+                instance_type, kThinStringTagBit,
+                __ GetDeoptLabel(node, DeoptimizeReason::kWrongMap));
+            // Load internalized string from thin string.
+            __ LoadTaggedField(object, object, ThinString::kActualOffset);
+            if (v8_flags.debug_code) {
+              __ RecordComment("DCHECK IsInternalizedString");
+              Label checked;
+              __ LoadInstanceType(instance_type, object);
+              __ TestInt32AndJumpIfAllClear(
+                  instance_type, kIsNotStringMask | kIsNotInternalizedMask,
+                  &checked);
+              __ Abort(AbortReason::kUnexpectedValue);
+              __ bind(&checked);
+            }
+            __ Jump(*done);
+          },
+          done, this, object, instance_type));
+  __ bind(*done);
+}
+
 void CheckedNumberToUint8Clamped::SetValueLocationConstraints() {
   UseRegister(input());
   DefineSameAsFirst(this);
@@ -3131,39 +4742,15 @@ void StoreFixedArrayElementNoWriteBarrier::GenerateCode(
   __ StoreFixedArrayElementNoWriteBarrier(elements, index, value);
 }
 
-void CheckedStoreFixedArraySmiElement::SetValueLocationConstraints() {
-  UseRegister(elements_input());
-  UseRegister(index_input());
-  UseRegister(value_input());
-}
-void CheckedStoreFixedArraySmiElement::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register elements = ToRegister(elements_input());
-  Register index = ToRegister(index_input());
-  Register value = ToRegister(value_input());
-  Condition is_smi = __ CheckSmi(value);
-  __ EmitEagerDeoptIf(NegateCondition(is_smi), DeoptimizeReason::kNotASmi,
-                      this);
-  __ StoreFixedArrayElementNoWriteBarrier(elements, index, value);
-}
-
 // ---
 // Arch agnostic call nodes
 // ---
 
 int Call::MaxCallStackArgs() const { return num_args(); }
 void Call::SetValueLocationConstraints() {
-  // TODO(leszeks): Consider splitting Call into with- and without-feedback
-  // opcodes, rather than checking for feedback validity.
-  if (feedback_.IsValid()) {
-    using D = CallTrampoline_WithFeedbackDescriptor;
-    UseFixed(function(), D::GetRegisterParameter(D::kFunction));
-    UseFixed(arg(0), D::GetRegisterParameter(D::kReceiver));
-  } else {
-    using D = CallTrampolineDescriptor;
-    UseFixed(function(), D::GetRegisterParameter(D::kFunction));
-    UseAny(arg(0));
-  }
+  using D = CallTrampolineDescriptor;
+  UseFixed(function(), D::GetRegisterParameter(D::kFunction));
+  UseAny(arg(0));
   for (int i = 1; i < num_args(); i++) {
     UseAny(arg(i));
   }
@@ -3172,70 +4759,38 @@ void Call::SetValueLocationConstraints() {
 }
 
 void Call::GenerateCode(MaglevAssembler* masm, const ProcessingState& state) {
-  // TODO(leszeks): Port the nice Sparkplug CallBuiltin helper.
-#ifdef DEBUG
-  if (feedback_.IsValid()) {
-    using D = CallTrampoline_WithFeedbackDescriptor;
-    DCHECK_EQ(ToRegister(function()), D::GetRegisterParameter(D::kFunction));
-    DCHECK_EQ(ToRegister(arg(0)), D::GetRegisterParameter(D::kReceiver));
-  } else {
-    using D = CallTrampolineDescriptor;
-    DCHECK_EQ(ToRegister(function()), D::GetRegisterParameter(D::kFunction));
-  }
-#endif
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-
   __ PushReverse(base::make_iterator_range(args_begin(), args_end()));
 
   uint32_t arg_count = num_args();
-  if (feedback_.IsValid()) {
-    DCHECK_EQ(TargetType::kAny, target_type_);
-    using D = CallTrampoline_WithFeedbackDescriptor;
-    __ Move(D::GetRegisterParameter(D::kActualArgumentsCount), arg_count);
-    __ Move(D::GetRegisterParameter(D::kFeedbackVector), feedback().vector);
-    __ Move(D::GetRegisterParameter(D::kSlot), feedback().index());
-
-    switch (receiver_mode_) {
-      case ConvertReceiverMode::kNullOrUndefined:
-        __ CallBuiltin(Builtin::kCall_ReceiverIsNullOrUndefined_WithFeedback);
-        break;
-      case ConvertReceiverMode::kNotNullOrUndefined:
-        __ CallBuiltin(
-            Builtin::kCall_ReceiverIsNotNullOrUndefined_WithFeedback);
-        break;
-      case ConvertReceiverMode::kAny:
-        __ CallBuiltin(Builtin::kCall_ReceiverIsAny_WithFeedback);
-        break;
-    }
-  } else if (target_type_ == TargetType::kAny) {
-    using D = CallTrampolineDescriptor;
-    __ Move(D::GetRegisterParameter(D::kActualArgumentsCount), arg_count);
-
+  if (target_type_ == TargetType::kAny) {
     switch (receiver_mode_) {
       case ConvertReceiverMode::kNullOrUndefined:
-        __ CallBuiltin(Builtin::kCall_ReceiverIsNullOrUndefined);
+        __ CallBuiltin<Builtin::kCall_ReceiverIsNullOrUndefined>(
+            context(), function(), arg_count);
         break;
       case ConvertReceiverMode::kNotNullOrUndefined:
-        __ CallBuiltin(Builtin::kCall_ReceiverIsNotNullOrUndefined);
+        __ CallBuiltin<Builtin::kCall_ReceiverIsNotNullOrUndefined>(
+            context(), function(), arg_count);
         break;
       case ConvertReceiverMode::kAny:
-        __ CallBuiltin(Builtin::kCall_ReceiverIsAny);
+        __ CallBuiltin<Builtin::kCall_ReceiverIsAny>(context(), function(),
+                                                     arg_count);
         break;
     }
   } else {
     DCHECK_EQ(TargetType::kJSFunction, target_type_);
-    using D = CallTrampolineDescriptor;
-    __ Move(D::GetRegisterParameter(D::kActualArgumentsCount), arg_count);
-
     switch (receiver_mode_) {
       case ConvertReceiverMode::kNullOrUndefined:
-        __ CallBuiltin(Builtin::kCallFunction_ReceiverIsNullOrUndefined);
+        __ CallBuiltin<Builtin::kCallFunction_ReceiverIsNullOrUndefined>(
+            context(), function(), arg_count);
         break;
       case ConvertReceiverMode::kNotNullOrUndefined:
-        __ CallBuiltin(Builtin::kCallFunction_ReceiverIsNotNullOrUndefined);
+        __ CallBuiltin<Builtin::kCallFunction_ReceiverIsNotNullOrUndefined>(
+            context(), function(), arg_count);
         break;
       case ConvertReceiverMode::kAny:
-        __ CallBuiltin(Builtin::kCallFunction_ReceiverIsAny);
+        __ CallBuiltin<Builtin::kCallFunction_ReceiverIsAny>(
+            context(), function(), arg_count);
         break;
     }
   }
@@ -3252,6 +4807,9 @@ void CallSelf::SetValueLocationConstraints() {
   for (int i = 0; i < num_args(); i++) {
     UseAny(arg(i));
   }
+  UseFixed(closure(), kJavaScriptCallTargetRegister);
+  UseFixed(new_target(), kJavaScriptCallNewTargetRegister);
+  UseFixed(context(), kContextRegister);
   DefineAsFixed(this, kReturnRegister0);
   set_temporaries_needed(1);
 }
@@ -3272,12 +4830,10 @@ void CallSelf::GenerateCode(MaglevAssembler* masm,
     __ PushReverse(receiver(),
                    base::make_iterator_range(args_begin(), args_end()));
   }
-  compiler::JSHeapBroker* broker = masm->compilation_info()->broker();
-  __ Move(kContextRegister, function_.context(broker).object());
-  __ Move(kJavaScriptCallTargetRegister, function_.object());
-  __ LoadRoot(kJavaScriptCallNewTargetRegister, RootIndex::kUndefinedValue);
+  DCHECK_EQ(kContextRegister, ToRegister(context()));
+  DCHECK_EQ(kJavaScriptCallTargetRegister, ToRegister(closure()));
   __ Move(kJavaScriptCallArgCountRegister, actual_parameter_count);
-  DCHECK(!shared_function_info(broker).HasBuiltinId());
+  DCHECK(!shared_function_info().HasBuiltinId());
   __ CallSelf();
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
@@ -3291,6 +4847,9 @@ void CallKnownJSFunction::SetValueLocationConstraints() {
   for (int i = 0; i < num_args(); i++) {
     UseAny(arg(i));
   }
+  UseFixed(closure(), kJavaScriptCallTargetRegister);
+  UseFixed(new_target(), kJavaScriptCallNewTargetRegister);
+  UseFixed(context(), kContextRegister);
   DefineAsFixed(this, kReturnRegister0);
   set_temporaries_needed(1);
 }
@@ -3311,19 +4870,103 @@ void CallKnownJSFunction::GenerateCode(MaglevAssembler* masm,
     __ PushReverse(receiver(),
                    base::make_iterator_range(args_begin(), args_end()));
   }
-  compiler::JSHeapBroker* broker = masm->compilation_info()->broker();
-  __ Move(kContextRegister, function_.context(broker).object());
-  __ Move(kJavaScriptCallTargetRegister, function_.object());
-  __ LoadRoot(kJavaScriptCallNewTargetRegister, RootIndex::kUndefinedValue);
+  // From here on, we're going to do a call, so all registers are valid temps,
+  // except for the ones we're going to write. This is needed in case one of the
+  // helper methods below wants to use a temp and one of these is in the temp
+  // list (in particular, this can happen on arm64 where cp is a temp register
+  // by default).
+  temps.SetAvailable(MaglevAssembler::GetAllocatableRegisters() -
+                     RegList{kContextRegister, kJavaScriptCallCodeStartRegister,
+                             kJavaScriptCallTargetRegister,
+                             kJavaScriptCallNewTargetRegister,
+                             kJavaScriptCallArgCountRegister});
+  DCHECK_EQ(kContextRegister, ToRegister(context()));
+  DCHECK_EQ(kJavaScriptCallTargetRegister, ToRegister(closure()));
   __ Move(kJavaScriptCallArgCountRegister, actual_parameter_count);
-  if (shared_function_info(broker).HasBuiltinId()) {
-    __ CallBuiltin(shared_function_info(broker).builtin_id());
+  if (shared_function_info().HasBuiltinId()) {
+    __ CallBuiltin(shared_function_info().builtin_id());
+  } else {
+    __ CallJSFunction(kJavaScriptCallTargetRegister);
+  }
+  masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
+}
+
+int CallKnownApiFunction::MaxCallStackArgs() const {
+  int actual_parameter_count = num_args() + 1;
+  return actual_parameter_count;
+}
+
+void CallKnownApiFunction::SetValueLocationConstraints() {
+  if (api_holder_.has_value()) {
+    UseAny(receiver());
+  } else {
+    // This is an "Api holder is receiver" case, ask register allocator to put
+    // receiver value into the right register.
+    UseFixed(receiver(), CallApiCallbackOptimizedDescriptor::HolderRegister());
+  }
+  for (int i = 0; i < num_args(); i++) {
+    UseAny(arg(i));
+  }
+  UseFixed(context(), kContextRegister);
+
+  DefineAsFixed(this, kReturnRegister0);
+  set_temporaries_needed(1);
+}
+
+void CallKnownApiFunction::GenerateCode(MaglevAssembler* masm,
+                                        const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  __ PushReverse(receiver(),
+                 base::make_iterator_range(args_begin(), args_end()));
+
+  // From here on, we're going to do a call, so all registers are valid temps,
+  // except for the ones we're going to write. This is needed in case one of the
+  // helper methods below wants to use a temp and one of these is in the temp
+  // list (in particular, this can happen on arm64 where cp is a temp register
+  // by default).
+  temps.SetAvailable(
+      kAllocatableGeneralRegisters -
+      RegList{
+          kContextRegister,
+          CallApiCallbackOptimizedDescriptor::HolderRegister(),
+          CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister(),
+          CallApiCallbackOptimizedDescriptor::CallDataRegister(),
+          CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister()});
+  DCHECK_EQ(kContextRegister, ToRegister(context()));
+
+  if (api_holder_.has_value()) {
+    __ Move(CallApiCallbackOptimizedDescriptor::HolderRegister(),
+            api_holder_.value().object());
   } else {
-    __ AssertCallableFunction(kJavaScriptCallTargetRegister);
-    __ LoadTaggedField(kJavaScriptCallCodeStartRegister,
-                       FieldMemOperand(kJavaScriptCallTargetRegister,
-                                       JSFunction::kCodeOffset));
-    __ CallCodeObject(kJavaScriptCallCodeStartRegister);
+    // This is an "Api holder is receiver" case, register allocator was asked
+    // to put receiver value into the right register.
+    DCHECK_EQ(CallApiCallbackOptimizedDescriptor::HolderRegister(),
+              ToRegister(receiver()));
+  }
+  __ Move(CallApiCallbackOptimizedDescriptor::ActualArgumentsCountRegister(),
+          num_args());  // not including receiver
+
+  if (data_.IsSmi()) {
+    __ Move(CallApiCallbackOptimizedDescriptor::CallDataRegister(),
+            Smi::FromInt(data_.AsSmi()));
+  } else {
+    __ Move(CallApiCallbackOptimizedDescriptor::CallDataRegister(),
+            Handle<HeapObject>::cast(data_.object()));
+  }
+  compiler::JSHeapBroker* broker = masm->compilation_info()->broker();
+  ApiFunction function(call_handler_info_.callback(broker));
+  ExternalReference reference =
+      ExternalReference::Create(&function, ExternalReference::DIRECT_API_CALL);
+  __ Move(CallApiCallbackOptimizedDescriptor::ApiFunctionAddressRegister(),
+          reference);
+
+  switch (mode()) {
+    case kNoProfiling:
+      __ CallBuiltin(Builtin::kCallApiCallbackOptimizedNoProfiling);
+      break;
+    case kGeneric:
+      __ CallBuiltin(Builtin::kCallApiCallbackOptimized);
+      break;
   }
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
@@ -3453,26 +5096,13 @@ void CallRuntime::GenerateCode(MaglevAssembler* masm,
 
 int CallWithSpread::MaxCallStackArgs() const {
   int argc_no_spread = num_args() - 1;
-  if (feedback_.IsValid()) {
-    using D =
-        CallInterfaceDescriptorFor<Builtin::kCallWithSpread_WithFeedback>::type;
-    return argc_no_spread + D::GetStackParameterCount();
-  } else {
-    using D = CallInterfaceDescriptorFor<Builtin::kCallWithSpread>::type;
-    return argc_no_spread + D::GetStackParameterCount();
-  }
+  using D = CallInterfaceDescriptorFor<Builtin::kCallWithSpread>::type;
+  return argc_no_spread + D::GetStackParameterCount();
 }
 void CallWithSpread::SetValueLocationConstraints() {
-  if (feedback_.IsValid()) {
-    using D =
-        CallInterfaceDescriptorFor<Builtin::kCallWithSpread_WithFeedback>::type;
-    UseFixed(function(), D::GetRegisterParameter(D::kTarget));
-    UseFixed(spread(), D::GetRegisterParameter(D::kSpread));
-  } else {
-    using D = CallInterfaceDescriptorFor<Builtin::kCallWithSpread>::type;
-    UseFixed(function(), D::GetRegisterParameter(D::kTarget));
-    UseFixed(spread(), D::GetRegisterParameter(D::kSpread));
-  }
+  using D = CallInterfaceDescriptorFor<Builtin::kCallWithSpread>::type;
+  UseFixed(function(), D::GetRegisterParameter(D::kTarget));
+  UseFixed(spread(), D::GetRegisterParameter(D::kSpread));
   UseFixed(context(), kContextRegister);
   for (int i = 0; i < num_args() - 1; i++) {
     UseAny(arg(i));
@@ -3481,43 +5111,14 @@ void CallWithSpread::SetValueLocationConstraints() {
 }
 void CallWithSpread::GenerateCode(MaglevAssembler* masm,
                                   const ProcessingState& state) {
-#ifdef DEBUG
-  if (feedback_.IsValid()) {
-    using D =
-        CallInterfaceDescriptorFor<Builtin::kCallWithSpread_WithFeedback>::type;
-    DCHECK_EQ(ToRegister(function()), D::GetRegisterParameter(D::kTarget));
-    DCHECK_EQ(ToRegister(spread()), D::GetRegisterParameter(D::kSpread));
-  } else {
-    using D = CallInterfaceDescriptorFor<Builtin::kCallWithSpread>::type;
-    DCHECK_EQ(ToRegister(function()), D::GetRegisterParameter(D::kTarget));
-    DCHECK_EQ(ToRegister(spread()), D::GetRegisterParameter(D::kSpread));
-  }
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-#endif
-
-  if (feedback_.IsValid()) {
-    using D =
-        CallInterfaceDescriptorFor<Builtin::kCallWithSpread_WithFeedback>::type;
-    __ PushReverse(base::make_iterator_range(args_no_spread_begin(),
-                                             args_no_spread_end()));
-    // Receiver needs to be pushed (aligned) separately as it is consumed by
-    // CallWithSpread_WithFeedback directly while the other arguments on the
-    // stack are passed through to CallWithSpread.
-    static_assert(D::GetStackParameterIndex(D::kReceiver) == 0);
-    static_assert(D::GetStackParameterCount() == 1);
-    __ Push(receiver());
-
-    __ Move(D::GetRegisterParameter(D::kArgumentsCount), num_args_no_spread());
-    __ Move(D::GetRegisterParameter(D::kFeedbackVector), feedback().vector);
-    __ Move(D::GetRegisterParameter(D::kSlot), feedback().index());
-    __ CallBuiltin(Builtin::kCallWithSpread_WithFeedback);
-  } else {
-    using D = CallInterfaceDescriptorFor<Builtin::kCallWithSpread>::type;
-    __ PushReverse(base::make_iterator_range(args_no_spread_begin(),
-                                             args_no_spread_end()));
-    __ Move(D::GetRegisterParameter(D::kArgumentsCount), num_args_no_spread());
-    __ CallBuiltin(Builtin::kCallWithSpread);
-  }
+  __ CallBuiltin<Builtin::kCallWithSpread>(
+      context(),             // context
+      function(),            // target
+      num_args_no_spread(),  // arguments count
+      spread(),              // spread
+      base::make_iterator_range(args_no_spread_begin(),
+                                args_no_spread_end())  // pushed args
+  );
 
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
@@ -3536,15 +5137,18 @@ void CallWithArrayLike::SetValueLocationConstraints() {
 }
 void CallWithArrayLike::GenerateCode(MaglevAssembler* masm,
                                      const ProcessingState& state) {
-#ifdef DEBUG
-  using D = CallInterfaceDescriptorFor<Builtin::kCallWithArrayLike>::type;
-  DCHECK_EQ(ToRegister(function()), D::GetRegisterParameter(D::kTarget));
-  DCHECK_EQ(ToRegister(arguments_list()),
-            D::GetRegisterParameter(D::kArgumentsList));
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-#endif  // DEBUG
+  // CallWithArrayLike is a weird builtin that expects a receiver as top of the
+  // stack, but doesn't explicitly list it as an extra argument. Push it
+  // manually, and assert that there are no other stack arguments.
+  static_assert(
+      CallInterfaceDescriptorFor<
+          Builtin::kCallWithArrayLike>::type::GetStackParameterCount() == 0);
   __ Push(receiver());
-  __ CallBuiltin(Builtin::kCallWithArrayLike);
+  __ CallBuiltin<Builtin::kCallWithArrayLike>(
+      context(),        // context
+      function(),       // target
+      arguments_list()  // arguments list
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -3566,25 +5170,17 @@ void Construct::SetValueLocationConstraints() {
   }
   DefineAsFixed(this, kReturnRegister0);
 }
-void Construct::GenerateCode(MaglevAssembler* masm,
-                             const ProcessingState& state) {
-  using D = Construct_WithFeedbackDescriptor;
-  DCHECK_EQ(ToRegister(function()), D::GetRegisterParameter(D::kTarget));
-  DCHECK_EQ(ToRegister(new_target()), D::GetRegisterParameter(D::kNewTarget));
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-
-  __ PushReverse(base::make_iterator_range(args_begin(), args_end()));
-  // Feedback needs to be pushed (aligned) separately as it is consumed by
-  // Construct_WithFeedback directly while the other arguments on the stack
-  // are passed through to Construct.
-  static_assert(D::GetStackParameterIndex(D::kFeedbackVector) == 0);
-  static_assert(D::GetStackParameterCount() == 1);
-  __ Push(feedback().vector);
-
-  __ Move(D::GetRegisterParameter(D::kActualArgumentsCount), num_args());
-  __ Move(D::GetRegisterParameter(D::kSlot), feedback().index());
-
-  __ CallBuiltin(Builtin::kConstruct_WithFeedback);
+void Construct::GenerateCode(MaglevAssembler* masm,
+                             const ProcessingState& state) {
+  __ CallBuiltin<Builtin::kConstruct_WithFeedback>(
+      context(),           // context
+      function(),          // target
+      new_target(),        // new target
+      num_args(),          // actual arguments count
+      feedback().index(),  // feedback slot
+      feedback().vector,   // feedback vector
+      base::make_iterator_range(args_begin(), args_end())  // args
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
@@ -3608,48 +5204,85 @@ void ConstructWithSpread::SetValueLocationConstraints() {
 }
 void ConstructWithSpread::GenerateCode(MaglevAssembler* masm,
                                        const ProcessingState& state) {
-  using D = CallInterfaceDescriptorFor<
-      Builtin::kConstructWithSpread_WithFeedback>::type;
-  DCHECK_EQ(ToRegister(function()), D::GetRegisterParameter(D::kTarget));
-  DCHECK_EQ(ToRegister(new_target()), D::GetRegisterParameter(D::kNewTarget));
-  DCHECK_EQ(ToRegister(context()), kContextRegister);
-  __ PushReverse(
-      base::make_iterator_range(args_no_spread_begin(), args_no_spread_end()));
-
-  // Feedback needs to be pushed (aligned) separately as it is consumed by
-  // Construct_WithFeedback directly while the other arguments on the stack
-  // are passed through to Construct.
-  static_assert(D::GetStackParameterIndex(D::kFeedbackVector) == 0);
-  static_assert(D::GetStackParameterCount() == 1);
-  __ Push(feedback().vector);
-
-  __ Move(D::GetRegisterParameter(D::kActualArgumentsCount),
-          num_args_no_spread());
-  __ Move(D::GetRegisterParameter(D::kSlot), feedback().index());
-  __ CallBuiltin(Builtin::kConstructWithSpread_WithFeedback);
+  __ CallBuiltin<Builtin::kConstructWithSpread_WithFeedback>(
+      context(),             // context
+      function(),            // target
+      new_target(),          // new target
+      num_args_no_spread(),  // actual arguments count
+      feedback().index(),    // feedback slot
+      spread(),              // spread
+      feedback().vector,     // feedback vector
+      base::make_iterator_range(args_no_spread_begin(),
+                                args_no_spread_end())  // args
+  );
   masm->DefineExceptionHandlerAndLazyDeoptPoint(this);
 }
 
-int TransitionElementsKind::MaxCallStackArgs() const {
+void SetPendingMessage::SetValueLocationConstraints() {
+  UseRegister(value());
+  DefineAsRegister(this);
+}
+
+void SetPendingMessage::GenerateCode(MaglevAssembler* masm,
+                                     const ProcessingState& state) {
+  Register new_message = ToRegister(value());
+  Register return_value = ToRegister(result());
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.GetDefaultScratchRegister();
+  MemOperand pending_message_operand = __ ExternalReferenceAsOperand(
+      ExternalReference::address_of_pending_message(masm->isolate()), scratch);
+  if (new_message != return_value) {
+    __ Move(return_value, pending_message_operand);
+    __ Move(pending_message_operand, new_message);
+  } else {
+    __ Move(scratch, pending_message_operand);
+    __ Move(pending_message_operand, new_message);
+    __ Move(return_value, scratch);
+  }
+}
+
+void StoreDoubleField::SetValueLocationConstraints() {
+  UseRegister(object_input());
+  UseRegister(value_input());
+}
+void StoreDoubleField::GenerateCode(MaglevAssembler* masm,
+                                    const ProcessingState& state) {
+  Register object = ToRegister(object_input());
+  DoubleRegister value = ToDoubleRegister(value_input());
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register tmp = temps.GetDefaultScratchRegister();
+
+  __ AssertNotSmi(object);
+  __ LoadTaggedField(tmp, object, offset());
+  __ AssertNotSmi(tmp);
+  __ StoreFloat64(FieldMemOperand(tmp, HeapNumber::kValueOffset), value);
+}
+
+int TransitionElementsKindOrCheckMap::MaxCallStackArgs() const {
   return std::max(WriteBarrierDescriptor::GetStackParameterCount(), 2);
 }
-void TransitionElementsKind::SetValueLocationConstraints() {
+
+void TransitionElementsKindOrCheckMap::SetValueLocationConstraints() {
   UseRegister(object_input());
   set_temporaries_needed(1);
 }
-void TransitionElementsKind::GenerateCode(MaglevAssembler* masm,
-                                          const ProcessingState& state) {
+
+void TransitionElementsKindOrCheckMap::GenerateCode(
+    MaglevAssembler* masm, const ProcessingState& state) {
   MaglevAssembler::ScratchRegisterScope temps(masm);
   Register object = ToRegister(object_input());
 
   ZoneLabelRef done(masm);
 
-  // TODO(leszeks): We could consider just deopting straight away if the object
-  // is a Smi, but it's also fine to not deopt since there will be another Smi
-  // check in the map check after this transition. This second Smi check could
-  // be elided if we deopted here, but OTOH then we'd need extra deopt info for
-  // this node.
-  __ JumpIfSmi(object, *done, Label::kNear);
+  DCHECK(!AnyMapIsHeapNumber(transition_sources_));
+  DCHECK(!IsHeapNumberMap(*transition_target_.object()));
+
+  if (check_type() == CheckType::kOmitHeapObjectCheck) {
+    __ AssertNotSmi(object);
+  } else {
+    __ EmitEagerDeoptIfSmi(this, object, DeoptimizeReason::kWrongMap);
+  }
 
   Register map = temps.Acquire();
   __ LoadMap(map, object);
@@ -3661,16 +5294,18 @@ void TransitionElementsKind::GenerateCode(MaglevAssembler* masm,
     // TODO(leszeks): If there are a lot of transition source maps, move the
     // source into a register and share the deferred code between maps.
     __ CompareTagged(map, transition_source.object());
+    // We can use `map` as a temporary register, since the deferred code will
+    // jump to `done`, so we won't use it afterwards.
     __ JumpToDeferredIf(
         kEqual,
-        [](MaglevAssembler* masm, Register object, Register map,
+        [](MaglevAssembler* masm, Register object, Register temp,
            RegisterSnapshot register_snapshot,
            compiler::MapRef transition_target, bool is_simple,
            ZoneLabelRef done) {
           if (is_simple) {
-            __ Move(map, transition_target.object());
+            __ Move(temp, transition_target.object());
             __ StoreTaggedFieldWithWriteBarrier(
-                object, HeapObject::kMapOffset, map, register_snapshot,
+                object, HeapObject::kMapOffset, temp, register_snapshot,
                 MaglevAssembler::kValueIsDecompressed,
                 MaglevAssembler::kValueCannotBeSmi);
           } else {
@@ -3684,32 +5319,183 @@ void TransitionElementsKind::GenerateCode(MaglevAssembler* masm,
         },
         object, map, register_snapshot(), transition_target_, is_simple, done);
   }
+  __ CompareTagged(map, transition_target_.object());
+  __ EmitEagerDeoptIfNotEqual(DeoptimizeReason::kWrongMap, this);
   __ bind(*done);
 }
 
-// ---
-// Arch agnostic control nodes
-// ---
+namespace {
 
-void Jump::SetValueLocationConstraints() {}
-void Jump::GenerateCode(MaglevAssembler* masm, const ProcessingState& state) {
-  // Avoid emitting a jump to the next block.
-  if (target() != state.next_block()) {
-    __ Jump(target()->label());
+template <bool check_detached, typename ResultReg, typename NodeT>
+void GenerateTypedArrayLoad(MaglevAssembler* masm, NodeT* node, Register object,
+                            Register index, ResultReg result_reg,
+                            ElementsKind kind) {
+  __ AssertNotSmi(object);
+  if (v8_flags.debug_code) {
+    MaglevAssembler::ScratchRegisterScope temps(masm);
+    __ IsObjectType(object, JS_TYPED_ARRAY_TYPE);
+    __ Assert(kEqual, AbortReason::kUnexpectedValue);
+  }
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+
+  if constexpr (check_detached) {
+    __ DeoptIfBufferDetached(object, scratch, node);
+  }
+
+  Register data_pointer = scratch;
+  __ BuildTypedArrayDataPointer(data_pointer, object);
+
+  int element_size = ElementsKindSize(kind);
+  MemOperand operand =
+      __ TypedArrayElementOperand(data_pointer, index, element_size);
+  if constexpr (std::is_same_v<ResultReg, Register>) {
+    if (IsSignedIntTypedArrayElementsKind(kind)) {
+      __ LoadSignedField(result_reg, operand, element_size);
+    } else {
+      DCHECK(IsUnsignedIntTypedArrayElementsKind(kind));
+      __ LoadUnsignedField(result_reg, operand, element_size);
+    }
+  } else {
+#ifdef DEBUG
+    bool result_reg_is_double = std::is_same_v<ResultReg, DoubleRegister>;
+    DCHECK(result_reg_is_double);
+    DCHECK(IsFloatTypedArrayElementsKind(kind));
+#endif
+    switch (kind) {
+      case FLOAT32_ELEMENTS:
+        __ LoadFloat32(result_reg, operand);
+        break;
+      case FLOAT64_ELEMENTS:
+        __ LoadFloat64(result_reg, operand);
+        break;
+      default:
+        UNREACHABLE();
+    }
   }
 }
 
-void JumpToInlined::SetValueLocationConstraints() {}
-void JumpToInlined::GenerateCode(MaglevAssembler* masm,
-                                 const ProcessingState& state) {
-  // Avoid emitting a jump to the next block.
-  if (target() != state.next_block()) {
-    __ Jump(target()->label());
+template <bool check_detached, typename ValueReg, typename NodeT>
+void GenerateTypedArrayStore(MaglevAssembler* masm, NodeT* node,
+                             Register object, Register index, ValueReg value,
+                             ElementsKind kind) {
+  __ AssertNotSmi(object);
+  if (v8_flags.debug_code) {
+    MaglevAssembler::ScratchRegisterScope temps(masm);
+    __ IsObjectType(object, JS_TYPED_ARRAY_TYPE);
+    __ Assert(kEqual, AbortReason::kUnexpectedValue);
+  }
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+
+  if constexpr (check_detached) {
+    __ DeoptIfBufferDetached(object, scratch, node);
+  }
+
+  Register data_pointer = scratch;
+  __ BuildTypedArrayDataPointer(data_pointer, object);
+
+  int element_size = ElementsKindSize(kind);
+  MemOperand operand =
+      __ TypedArrayElementOperand(data_pointer, index, element_size);
+  if constexpr (std::is_same_v<ValueReg, Register>) {
+    int element_size = ElementsKindSize(kind);
+    __ StoreField(operand, value, element_size);
+  } else {
+#ifdef DEBUG
+    bool value_is_double = std::is_same_v<ValueReg, DoubleRegister>;
+    DCHECK(value_is_double);
+    DCHECK(IsFloatTypedArrayElementsKind(kind));
+#endif
+    switch (kind) {
+      case FLOAT32_ELEMENTS:
+        __ StoreFloat32(operand, value);
+        break;
+      case FLOAT64_ELEMENTS:
+        __ StoreFloat64(operand, value);
+        break;
+      default:
+        UNREACHABLE();
+    }
   }
 }
-void JumpFromInlined::SetValueLocationConstraints() {}
-void JumpFromInlined::GenerateCode(MaglevAssembler* masm,
-                                   const ProcessingState& state) {
+
+}  // namespace
+
+#define DEF_LOAD_TYPED_ARRAY(Name, ResultReg, ToResultReg, check_detached) \
+  void Name::SetValueLocationConstraints() {                               \
+    UseRegister(object_input());                                           \
+    UseRegister(index_input());                                            \
+    DefineAsRegister(this);                                                \
+    set_temporaries_needed(1);                                             \
+  }                                                                        \
+  void Name::GenerateCode(MaglevAssembler* masm,                           \
+                          const ProcessingState& state) {                  \
+    Register object = ToRegister(object_input());                          \
+    Register index = ToRegister(index_input());                            \
+    ResultReg result_reg = ToResultReg(result());                          \
+                                                                           \
+    GenerateTypedArrayLoad<check_detached>(masm, this, object, index,      \
+                                           result_reg, elements_kind_);    \
+  }
+
+DEF_LOAD_TYPED_ARRAY(LoadSignedIntTypedArrayElement, Register, ToRegister,
+                     /*check_detached*/ true)
+DEF_LOAD_TYPED_ARRAY(LoadSignedIntTypedArrayElementNoDeopt, Register,
+                     ToRegister,
+                     /*check_detached*/ false)
+
+DEF_LOAD_TYPED_ARRAY(LoadUnsignedIntTypedArrayElement, Register, ToRegister,
+                     /*check_detached*/ true)
+DEF_LOAD_TYPED_ARRAY(LoadUnsignedIntTypedArrayElementNoDeopt, Register,
+                     ToRegister,
+                     /*check_detached*/ false)
+
+DEF_LOAD_TYPED_ARRAY(LoadDoubleTypedArrayElement, DoubleRegister,
+                     ToDoubleRegister,
+                     /*check_detached*/ true)
+DEF_LOAD_TYPED_ARRAY(LoadDoubleTypedArrayElementNoDeopt, DoubleRegister,
+                     ToDoubleRegister, /*check_detached*/ false)
+#undef DEF_LOAD_TYPED_ARRAY
+
+#define DEF_STORE_TYPED_ARRAY(Name, ValueReg, ToValueReg, check_detached)     \
+  void Name::SetValueLocationConstraints() {                                  \
+    UseRegister(object_input());                                              \
+    UseRegister(index_input());                                               \
+    UseRegister(value_input());                                               \
+    set_temporaries_needed(1);                                                \
+  }                                                                           \
+  void Name::GenerateCode(MaglevAssembler* masm,                              \
+                          const ProcessingState& state) {                     \
+    Register object = ToRegister(object_input());                             \
+    Register index = ToRegister(index_input());                               \
+    ValueReg value = ToValueReg(value_input());                               \
+                                                                              \
+    GenerateTypedArrayStore<check_detached>(masm, this, object, index, value, \
+                                            elements_kind_);                  \
+  }
+
+DEF_STORE_TYPED_ARRAY(StoreIntTypedArrayElement, Register, ToRegister,
+                      /*check_detached*/ true)
+DEF_STORE_TYPED_ARRAY(StoreIntTypedArrayElementNoDeopt, Register, ToRegister,
+                      /*check_detached*/ false)
+
+DEF_STORE_TYPED_ARRAY(StoreDoubleTypedArrayElement, DoubleRegister,
+                      ToDoubleRegister,
+                      /*check_detached*/ true)
+DEF_STORE_TYPED_ARRAY(StoreDoubleTypedArrayElementNoDeopt, DoubleRegister,
+                      ToDoubleRegister, /*check_detached*/ false)
+
+#undef DEF_STORE_TYPED_ARRAY
+
+// ---
+// Arch agnostic control nodes
+// ---
+
+void Jump::SetValueLocationConstraints() {}
+void Jump::GenerateCode(MaglevAssembler* masm, const ProcessingState& state) {
   // Avoid emitting a jump to the next block.
   if (target() != state.next_block()) {
     __ Jump(target()->label());
@@ -3720,7 +5506,7 @@ namespace {
 
 void AttemptOnStackReplacement(MaglevAssembler* masm,
                                ZoneLabelRef no_code_for_osr,
-                               JumpLoopPrologue* node, Register scratch0,
+                               TryOnStackReplacement* node, Register scratch0,
                                Register scratch1, int32_t loop_depth,
                                FeedbackSlot feedback_slot,
                                BytecodeOffset osr_offset) {
@@ -3739,8 +5525,8 @@ void AttemptOnStackReplacement(MaglevAssembler* masm,
   // Case 1).
   Label deopt;
   Register maybe_target_code = scratch1;
-  __ TryLoadOptimizedOsrCode(maybe_target_code, scratch0, feedback_slot, &deopt,
-                             Label::kFar);
+  __ TryLoadOptimizedOsrCode(scratch1, CodeKind::TURBOFAN, scratch0,
+                             feedback_slot, &deopt, Label::kFar);
 
   // Case 2).
   {
@@ -3748,7 +5534,7 @@ void AttemptOnStackReplacement(MaglevAssembler* masm,
                 FieldMemOperand(scratch0, FeedbackVector::kOsrStateOffset));
     __ DecodeField<FeedbackVector::OsrUrgencyBits>(scratch0);
     __ JumpIfByte(kUnsignedLessThanEqual, scratch0, loop_depth,
-                  *no_code_for_osr, Label::Distance::kNear);
+                  *no_code_for_osr);
 
     // The osr_urgency exceeds the current loop_depth, signaling an OSR
     // request. Call into runtime to compile.
@@ -3763,9 +5549,18 @@ void AttemptOnStackReplacement(MaglevAssembler* masm,
       AddDeoptRegistersToSnapshot(&snapshot, node->eager_deopt_info());
       DCHECK(!snapshot.live_registers.has(maybe_target_code));
       SaveRegisterStateForCall save_register_state(masm, snapshot);
-      __ Move(kContextRegister, masm->native_context().object());
-      __ Push(Smi::FromInt(osr_offset.ToInt()));
-      __ CallRuntime(Runtime::kCompileOptimizedOSRFromMaglev, 1);
+      if (node->unit()->is_inline()) {
+        // See comment in
+        // MaglevGraphBuilder::ShouldEmitOsrInterruptBudgetChecks.
+        CHECK(!node->unit()->is_osr());
+        __ Push(Smi::FromInt(osr_offset.ToInt()), node->closure());
+        __ Move(kContextRegister, masm->native_context().object());
+        __ CallRuntime(Runtime::kCompileOptimizedOSRFromMaglevInlined, 2);
+      } else {
+        __ Push(Smi::FromInt(osr_offset.ToInt()));
+        __ Move(kContextRegister, masm->native_context().object());
+        __ CallRuntime(Runtime::kCompileOptimizedOSRFromMaglev, 1);
+      }
       save_register_state.DefineSafepoint();
       __ Move(maybe_target_code, kReturnRegister0);
     }
@@ -3796,17 +5591,17 @@ void AttemptOnStackReplacement(MaglevAssembler* masm,
 
 }  // namespace
 
-int JumpLoopPrologue::MaxCallStackArgs() const {
+int TryOnStackReplacement::MaxCallStackArgs() const {
   // For the kCompileOptimizedOSRFromMaglev call.
+  if (unit()->is_inline()) return 2;
   return 1;
 }
-void JumpLoopPrologue::SetValueLocationConstraints() {
-  if (!v8_flags.use_osr) return;
+void TryOnStackReplacement::SetValueLocationConstraints() {
+  UseAny(closure());
   set_temporaries_needed(2);
 }
-void JumpLoopPrologue::GenerateCode(MaglevAssembler* masm,
-                                    const ProcessingState& state) {
-  if (!v8_flags.use_osr) return;
+void TryOnStackReplacement::GenerateCode(MaglevAssembler* masm,
+                                         const ProcessingState& state) {
   MaglevAssembler::ScratchRegisterScope temps(masm);
   Register scratch0 = temps.Acquire();
   Register scratch1 = temps.Acquire();
@@ -3817,12 +5612,22 @@ void JumpLoopPrologue::GenerateCode(MaglevAssembler* masm,
   __ LoadByte(osr_state,
               FieldMemOperand(scratch0, FeedbackVector::kOsrStateOffset));
 
+  ZoneLabelRef no_code_for_osr(masm);
+
+  if (v8_flags.maglev_osr) {
+    // In case we use maglev_osr, we need to explicitly know if there is
+    // turbofan code waiting for us (i.e., ignore the MaybeHasMaglevOsrCodeBit).
+    __ DecodeField<
+        base::BitFieldUnion<FeedbackVector::OsrUrgencyBits,
+                            FeedbackVector::MaybeHasTurbofanOsrCodeBit>>(
+        osr_state);
+  }
+
   // The quick initial OSR check. If it passes, we proceed on to more
   // expensive OSR logic.
-  static_assert(FeedbackVector::MaybeHasOptimizedOsrCodeBit::encode(true) >
+  static_assert(FeedbackVector::MaybeHasTurbofanOsrCodeBit::encode(true) >
                 FeedbackVector::kMaxOsrUrgency);
   __ CompareInt32(osr_state, loop_depth_);
-  ZoneLabelRef no_code_for_osr(masm);
   __ JumpToDeferredIf(kUnsignedGreaterThan, AttemptOnStackReplacement,
                       no_code_for_osr, this, scratch0, scratch1, loop_depth_,
                       feedback_slot_, osr_offset_);
@@ -3857,21 +5662,89 @@ void BranchIfToBooleanTrue::GenerateCode(MaglevAssembler* masm,
   ZoneLabelRef false_label =
       ZoneLabelRef::UnsafeFromLabelPointer(if_false()->label());
   bool fallthrough_when_true = (if_true() == state.next_block());
-  __ ToBoolean(ToRegister(condition_input()), true_label, false_label,
-               fallthrough_when_true);
+  __ ToBoolean(ToRegister(condition_input()), check_type(), true_label,
+               false_label, fallthrough_when_true);
+}
+
+void BranchIfInt32ToBooleanTrue::SetValueLocationConstraints() {
+  // TODO(victorgomes): consider using any input instead.
+  UseRegister(condition_input());
+}
+void BranchIfInt32ToBooleanTrue::GenerateCode(MaglevAssembler* masm,
+                                              const ProcessingState& state) {
+  __ CompareInt32(ToRegister(condition_input()), 0);
+  __ Branch(kNotEqual, if_true(), if_false(), state.next_block());
+}
+
+void BranchIfFloat64ToBooleanTrue::SetValueLocationConstraints() {
+  UseRegister(condition_input());
+  set_double_temporaries_needed(1);
+}
+void BranchIfFloat64ToBooleanTrue::GenerateCode(MaglevAssembler* masm,
+                                                const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  DoubleRegister double_scratch = temps.AcquireDouble();
+
+  __ Move(double_scratch, 0.0);
+  __ CompareFloat64(ToDoubleRegister(condition_input()), double_scratch);
+  __ JumpIf(ConditionForNaN(), if_false()->label());
+  __ Branch(kEqual, if_false(), if_true(), state.next_block());
+}
+
+void BranchIfFloat64IsHole::SetValueLocationConstraints() {
+  UseRegister(condition_input());
+  set_temporaries_needed(1);
+}
+void BranchIfFloat64IsHole::GenerateCode(MaglevAssembler* masm,
+                                         const ProcessingState& state) {
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+  DoubleRegister input = ToDoubleRegister(condition_input());
+  // See MaglevAssembler::Branch.
+  bool fallthrough_when_true = if_true() == state.next_block();
+  bool fallthrough_when_false = if_false() == state.next_block();
+  if (fallthrough_when_false) {
+    if (fallthrough_when_true) {
+      // If both paths are a fallthrough, do nothing.
+      DCHECK_EQ(if_true(), if_false());
+      return;
+    }
+    // Jump over the false block if true, otherwise fall through into it.
+    __ JumpIfHoleNan(input, scratch, if_true()->label(), Label::kFar);
+  } else {
+    // Jump to the false block if true.
+    __ JumpIfNotHoleNan(input, scratch, if_false()->label(), Label::kFar);
+    // Jump to the true block if it's not the next block.
+    if (!fallthrough_when_true) {
+      __ Jump(if_true()->label(), Label::kFar);
+    }
+  }
 }
 
-void BranchIfReferenceCompare::SetValueLocationConstraints() {
+void BranchIfFloat64Compare::SetValueLocationConstraints() {
   UseRegister(left_input());
   UseRegister(right_input());
 }
-void BranchIfReferenceCompare::GenerateCode(MaglevAssembler* masm,
-                                            const ProcessingState& state) {
+void BranchIfFloat64Compare::GenerateCode(MaglevAssembler* masm,
+                                          const ProcessingState& state) {
+  DoubleRegister left = ToDoubleRegister(left_input());
+  DoubleRegister right = ToDoubleRegister(right_input());
+  __ CompareFloat64(left, right);
+  __ JumpIf(ConditionForNaN(), if_false()->label());
+  __ Branch(ConditionForFloat64(operation_), if_true(), if_false(),
+            state.next_block());
+}
+
+void BranchIfReferenceEqual::SetValueLocationConstraints() {
+  UseRegister(left_input());
+  UseRegister(right_input());
+}
+void BranchIfReferenceEqual::GenerateCode(MaglevAssembler* masm,
+                                          const ProcessingState& state) {
   Register left = ToRegister(left_input());
   Register right = ToRegister(right_input());
   __ CmpTagged(left, right);
-  __ Branch(ConditionFor(operation_), if_true(), if_false(),
-            state.next_block());
+  __ Branch(kEqual, if_true(), if_false(), state.next_block());
 }
 
 void BranchIfInt32Compare::SetValueLocationConstraints() {
@@ -3901,6 +5774,52 @@ void BranchIfUndefinedOrNull::GenerateCode(MaglevAssembler* masm,
   }
 }
 
+void BranchIfUndetectable::SetValueLocationConstraints() {
+  UseRegister(condition_input());
+  set_temporaries_needed(1);
+}
+void BranchIfUndetectable::GenerateCode(MaglevAssembler* masm,
+                                        const ProcessingState& state) {
+  Register value = ToRegister(condition_input());
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+
+  auto* next_block = state.next_block();
+  if (next_block == if_true() || next_block != if_false()) {
+    __ JumpIfNotUndetectable(value, scratch, check_type(), if_false()->label());
+    if (next_block != if_true()) {
+      __ Jump(if_true()->label());
+    }
+  } else {
+    __ JumpIfUndetectable(value, scratch, check_type(), if_true()->label());
+  }
+}
+
+void TestUndetectable::SetValueLocationConstraints() {
+  UseRegister(value());
+  set_temporaries_needed(1);
+  DefineAsRegister(this);
+}
+void TestUndetectable::GenerateCode(MaglevAssembler* masm,
+                                    const ProcessingState& state) {
+  Register object = ToRegister(value());
+  Register return_value = ToRegister(result());
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.Acquire();
+
+  Label return_false, done;
+  __ JumpIfNotUndetectable(object, scratch, check_type(), &return_false,
+                           Label::kNear);
+
+  __ LoadRoot(return_value, RootIndex::kTrueValue);
+  __ Jump(&done, Label::kNear);
+
+  __ bind(&return_false);
+  __ LoadRoot(return_value, RootIndex::kFalseValue);
+
+  __ bind(&done);
+}
+
 void BranchIfTypeOf::SetValueLocationConstraints() {
   UseRegister(value_input());
   // One temporary for TestTypeOf.
@@ -3966,6 +5885,11 @@ void SmiConstant::PrintParams(std::ostream& os,
   os << "(" << value() << ")";
 }
 
+void TaggedIndexConstant::PrintParams(
+    std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
+  os << "(" << value() << ")";
+}
+
 void Int32Constant::PrintParams(std::ostream& os,
                                 MaglevGraphLabeller* graph_labeller) const {
   os << "(" << value() << ")";
@@ -3991,7 +5915,7 @@ void Float64Constant::PrintParams(std::ostream& os,
 
 void Constant::PrintParams(std::ostream& os,
                            MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << object_ << ")";
+  os << "(" << *object_.object() << ")";
 }
 
 void DeleteProperty::PrintParams(std::ostream& os,
@@ -4006,12 +5930,12 @@ void InitialValue::PrintParams(std::ostream& os,
 
 void LoadGlobal::PrintParams(std::ostream& os,
                              MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << name() << ")";
+  os << "(" << *name().object() << ")";
 }
 
 void StoreGlobal::PrintParams(std::ostream& os,
                               MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << name() << ")";
+  os << "(" << *name().object() << ")";
 }
 
 void RegisterInput::PrintParams(std::ostream& os,
@@ -4080,12 +6004,14 @@ void BuiltinStringPrototypeCharCodeOrCodePointAt::PrintParams(
 void CheckMaps::PrintParams(std::ostream& os,
                             MaglevGraphLabeller* graph_labeller) const {
   os << "(";
-  size_t map_count = maps().size();
-  if (map_count > 0) {
-    for (size_t i = 0; i < map_count - 1; ++i) {
-      os << maps().at(i) << ", ";
+  bool first = true;
+  for (compiler::MapRef map : maps()) {
+    if (first) {
+      first = false;
+    } else {
+      os << ", ";
     }
-    os << maps().at(map_count - 1);
+    os << *map.object();
   }
   os << ")";
 }
@@ -4095,6 +6021,16 @@ void CheckValue::PrintParams(std::ostream& os,
   os << "(" << *value().object() << ")";
 }
 
+void CheckValueEqualsInt32::PrintParams(
+    std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
+  os << "(" << value() << ")";
+}
+
+void CheckValueEqualsFloat64::PrintParams(
+    std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
+  os << "(" << value() << ")";
+}
+
 void CheckValueEqualsString::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
   os << "(" << *value().object() << ")";
@@ -4102,25 +6038,31 @@ void CheckValueEqualsString::PrintParams(
 
 void CheckInstanceType::PrintParams(std::ostream& os,
                                     MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << instance_type() << ")";
+  os << "(" << first_instance_type_;
+  if (first_instance_type_ != last_instance_type_) {
+    os << " - " << last_instance_type_;
+  }
+  os << ")";
 }
 
 void CheckMapsWithMigration::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
   os << "(";
-  size_t map_count = maps().size();
-  if (map_count > 0) {
-    for (size_t i = 0; i < map_count - 1; ++i) {
-      os << maps().at(i) << ", ";
+  bool first = true;
+  for (compiler::MapRef map : maps()) {
+    if (first) {
+      first = false;
+    } else {
+      os << ", ";
     }
-    os << maps().at(map_count - 1);
+    os << *map.object();
   }
   os << ")";
 }
 
 void CheckInt32Condition::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << condition_ << ")";
+  os << "(" << condition() << ", " << reason() << ")";
 }
 
 void CheckedNumberOrOddballToFloat64::PrintParams(
@@ -4186,11 +6128,6 @@ void StoreFloat64::PrintParams(std::ostream& os,
   os << "(0x" << std::hex << offset() << std::dec << ")";
 }
 
-void CheckedStoreSmiField::PrintParams(
-    std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << std::hex << offset() << std::dec << ")";
-}
-
 void StoreTaggedFieldNoWriteBarrier::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
   os << "(0x" << std::hex << offset() << std::dec << ")";
@@ -4208,22 +6145,27 @@ void StoreTaggedFieldWithWriteBarrier::PrintParams(
 
 void LoadNamedGeneric::PrintParams(std::ostream& os,
                                    MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << name_ << ")";
+  os << "(" << *name_.object() << ")";
 }
 
 void LoadNamedFromSuperGeneric::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << name_ << ")";
+  os << "(" << *name_.object() << ")";
 }
 
 void SetNamedGeneric::PrintParams(std::ostream& os,
                                   MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << name_ << ")";
+  os << "(" << *name_.object() << ")";
 }
 
 void DefineNamedOwnGeneric::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << name_ << ")";
+  os << "(" << *name_.object() << ")";
+}
+
+void HasInPrototypeChain::PrintParams(
+    std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
+  os << "(" << *prototype_.object() << ")";
 }
 
 void GapMove::PrintParams(std::ostream& os,
@@ -4238,6 +6180,30 @@ void ConstantGapMove::PrintParams(std::ostream& os,
   os << " → " << target() << ")";
 }
 
+void Float64Compare::PrintParams(std::ostream& os,
+                                 MaglevGraphLabeller* graph_labeller) const {
+  os << "(" << operation() << ")";
+}
+
+void Float64ToBoolean::PrintParams(std::ostream& os,
+                                   MaglevGraphLabeller* graph_labeller) const {
+  if (flip()) {
+    os << "(flipped)";
+  }
+}
+
+void Int32Compare::PrintParams(std::ostream& os,
+                               MaglevGraphLabeller* graph_labeller) const {
+  os << "(" << operation() << ")";
+}
+
+void Int32ToBoolean::PrintParams(std::ostream& os,
+                                 MaglevGraphLabeller* graph_labeller) const {
+  if (flip()) {
+    os << "(flipped)";
+  }
+}
+
 void Float64Ieee754Unary::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
   os << "("
@@ -4282,12 +6248,31 @@ void Call::PrintParams(std::ostream& os,
 
 void CallSelf::PrintParams(std::ostream& os,
                            MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << function_.object() << ")";
+  os << "(" << shared_function_info_.object() << ")";
 }
 
 void CallKnownJSFunction::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << function_.object() << ")";
+  os << "(" << shared_function_info_.object() << ")";
+}
+
+void CallKnownApiFunction::PrintParams(
+    std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
+  os << "(";
+  switch (mode()) {
+    case kNoProfiling:
+      os << "no profiling, ";
+      break;
+    case kGeneric:
+      break;
+  }
+  os << function_template_info_.object() << ", ";
+  if (api_holder_.has_value()) {
+    os << api_holder_.value().object();
+  } else {
+    os << "Api holder is receiver";
+  }
+  os << ")";
 }
 
 void CallBuiltin::PrintParams(std::ostream& os,
@@ -4305,11 +6290,6 @@ void TestTypeOf::PrintParams(std::ostream& os,
   os << "(" << interpreter::TestTypeOfFlags::ToString(literal_) << ")";
 }
 
-void IncreaseInterruptBudget::PrintParams(
-    std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << amount() << ")";
-}
-
 void ReduceInterruptBudgetForLoop::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
   os << "(" << amount() << ")";
@@ -4325,11 +6305,6 @@ void Deopt::PrintParams(std::ostream& os,
   os << "(" << DeoptimizeReasonToString(reason()) << ")";
 }
 
-void JumpToInlined::PrintParams(std::ostream& os,
-                                MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << Brief(*unit()->shared_function_info().object()) << ")";
-}
-
 void BranchIfRootConstant::PrintParams(
     std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
   os << "(" << RootsTable::name(root_index_) << ")";
@@ -4345,16 +6320,39 @@ void BranchIfInt32Compare::PrintParams(
   os << "(" << operation_ << ")";
 }
 
-void BranchIfReferenceCompare::PrintParams(
-    std::ostream& os, MaglevGraphLabeller* graph_labeller) const {
-  os << "(" << operation_ << ")";
-}
-
 void BranchIfTypeOf::PrintParams(std::ostream& os,
                                  MaglevGraphLabeller* graph_labeller) const {
   os << "(" << interpreter::TestTypeOfFlags::ToString(literal_) << ")";
 }
 
+void HandleNoHeapWritesInterrupt::GenerateCode(MaglevAssembler* masm,
+                                               const ProcessingState& state) {
+  ZoneLabelRef done(masm);
+  Label* deferred = __ MakeDeferredCode(
+      [](MaglevAssembler* masm, ZoneLabelRef done, Node* node) {
+        ASM_CODE_COMMENT_STRING(masm, "HandleNoHeapWritesInterrupt");
+        {
+          SaveRegisterStateForCall save_register_state(
+              masm, node->register_snapshot());
+          __ Move(kContextRegister, masm->native_context().object());
+          __ CallRuntime(Runtime::kHandleNoHeapWritesInterrupts, 0);
+          save_register_state.DefineSafepointWithLazyDeopt(
+              node->lazy_deopt_info());
+        }
+        __ Jump(*done);
+      },
+      done, this);
+
+  MaglevAssembler::ScratchRegisterScope temps(masm);
+  Register scratch = temps.GetDefaultScratchRegister();
+  MemOperand check = __ ExternalReferenceAsOperand(
+      ExternalReference::address_of_no_heap_write_interrupt_request(
+          masm->isolate()),
+      scratch);
+  __ CompareByteAndJumpIf(check, 0, kNotEqual, scratch, deferred, Label::kFar);
+  __ bind(*done);
+}
+
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/maglev/maglev-ir.h b/deps/v8/src/maglev/maglev-ir.h
index 09966e259c3230..888944b606db72 100644
--- a/deps/v8/src/maglev/maglev-ir.h
+++ b/deps/v8/src/maglev/maglev-ir.h
@@ -6,6 +6,9 @@
 #define V8_MAGLEV_MAGLEV_IR_H_
 
 #include "src/base/bit-field.h"
+#include "src/base/bits.h"
+#include "src/base/discriminated-union.h"
+#include "src/base/enum-set.h"
 #include "src/base/logging.h"
 #include "src/base/macros.h"
 #include "src/base/small-vector.h"
@@ -23,21 +26,22 @@
 // TODO(dmercadier): move the Turboshaft utils functions to shared code (in
 // particular, any_of, which is the reason we're including this Turboshaft
 // header)
+#include "src/compiler/turboshaft/snapshot-table.h"
 #include "src/compiler/turboshaft/utils.h"
 #include "src/deoptimizer/deoptimize-reason.h"
 #include "src/interpreter/bytecode-flags.h"
 #include "src/interpreter/bytecode-register.h"
 #include "src/maglev/maglev-compilation-unit.h"
 #include "src/objects/smi.h"
+#include "src/objects/tagged-index.h"
 #include "src/roots/roots.h"
 #include "src/utils/utils.h"
-#include "src/zone/zone-handle-set.h"
 #include "src/zone/zone.h"
 
 namespace v8 {
 namespace internal {
 
-enum Condition : uint8_t;
+enum Condition : int;
 
 namespace maglev {
 
@@ -98,12 +102,8 @@ class MergePointInterpreterFrameState;
   V(Int32NegateWithOverflow)          \
   V(Int32IncrementWithOverflow)       \
   V(Int32DecrementWithOverflow)       \
-  V(Int32Equal)                       \
-  V(Int32StrictEqual)                 \
-  V(Int32LessThan)                    \
-  V(Int32LessThanOrEqual)             \
-  V(Int32GreaterThan)                 \
-  V(Int32GreaterThanOrEqual)
+  V(Int32Compare)                     \
+  V(Int32ToBoolean)
 
 #define FLOAT64_OPERATIONS_NODE_LIST(V) \
   V(Float64Add)                         \
@@ -114,14 +114,9 @@ class MergePointInterpreterFrameState;
   V(Float64Modulus)                     \
   V(Float64Negate)                      \
   V(Float64Round)                       \
-  V(Float64Equal)                       \
-  V(Float64StrictEqual)                 \
-  V(Float64LessThan)                    \
-  V(Float64LessThanOrEqual)             \
-  V(Float64GreaterThan)                 \
-  V(Float64GreaterThanOrEqual)          \
-  V(Float64Ieee754Unary)                \
-  V(Float64SilenceNaN)
+  V(Float64Compare)                     \
+  V(Float64ToBoolean)                   \
+  V(Float64Ieee754Unary)
 
 #define CONSTANT_VALUE_NODE_LIST(V) \
   V(Constant)                       \
@@ -129,123 +124,135 @@ class MergePointInterpreterFrameState;
   V(Float64Constant)                \
   V(Int32Constant)                  \
   V(RootConstant)                   \
-  V(SmiConstant)
+  V(SmiConstant)                    \
+  V(TaggedIndexConstant)
 
 #define INLINE_BUILTIN_NODE_LIST(V) \
   V(BuiltinStringFromCharCode)      \
   V(BuiltinStringPrototypeCharCodeOrCodePointAt)
 
-#define VALUE_NODE_LIST(V)                   \
-  V(Identity)                                \
-  V(AllocateRaw)                             \
-  V(Call)                                    \
-  V(CallBuiltin)                             \
-  V(CallRuntime)                             \
-  V(CallWithArrayLike)                       \
-  V(CallWithSpread)                          \
-  V(CallKnownJSFunction)                     \
-  V(CallSelf)                                \
-  V(Construct)                               \
-  V(ConstructWithSpread)                     \
-  V(ConvertReceiver)                         \
-  V(ConvertHoleToUndefined)                  \
-  V(CreateEmptyArrayLiteral)                 \
-  V(CreateArrayLiteral)                      \
-  V(CreateShallowArrayLiteral)               \
-  V(CreateObjectLiteral)                     \
-  V(CreateEmptyObjectLiteral)                \
-  V(CreateShallowObjectLiteral)              \
-  V(CreateFunctionContext)                   \
-  V(CreateClosure)                           \
-  V(FastCreateClosure)                       \
-  V(CreateRegExpLiteral)                     \
-  V(DeleteProperty)                          \
-  V(EnsureWritableFastElements)              \
-  V(FoldedAllocation)                        \
-  V(ForInPrepare)                            \
-  V(ForInNext)                               \
-  V(GeneratorRestoreRegister)                \
-  V(GetIterator)                             \
-  V(GetSecondReturnedValue)                  \
-  V(GetTemplateObject)                       \
-  V(InitialValue)                            \
-  V(LoadPolymorphicDoubleField)              \
-  V(LoadPolymorphicTaggedField)              \
-  V(LoadTaggedField)                         \
-  V(LoadDoubleField)                         \
-  V(LoadTaggedFieldByFieldIndex)             \
-  V(LoadFixedArrayElement)                   \
-  V(LoadFixedDoubleArrayElement)             \
-  V(LoadSignedIntDataViewElement)            \
-  V(LoadDoubleDataViewElement)               \
-  V(LoadSignedIntTypedArrayElement)          \
-  V(LoadSignedIntTypedArrayElementNoDeopt)   \
-  V(LoadUnsignedIntTypedArrayElement)        \
-  V(LoadUnsignedIntTypedArrayElementNoDeopt) \
-  V(LoadDoubleTypedArrayElement)             \
-  V(LoadDoubleTypedArrayElementNoDeopt)      \
-  V(LoadEnumCacheLength)                     \
-  V(LoadGlobal)                              \
-  V(LoadNamedGeneric)                        \
-  V(LoadNamedFromSuperGeneric)               \
-  V(SetNamedGeneric)                         \
-  V(DefineNamedOwnGeneric)                   \
-  V(StoreInArrayLiteralGeneric)              \
-  V(StoreGlobal)                             \
-  V(GetKeyedGeneric)                         \
-  V(SetKeyedGeneric)                         \
-  V(DefineKeyedOwnGeneric)                   \
-  V(Phi)                                     \
-  V(RegisterInput)                           \
-  V(CheckedSmiTagInt32)                      \
-  V(CheckedSmiTagUint32)                     \
-  V(UnsafeSmiTag)                            \
-  V(CheckedSmiUntag)                         \
-  V(UnsafeSmiUntag)                          \
-  V(CheckedInternalizedString)               \
-  V(CheckedObjectToIndex)                    \
-  V(CheckedTruncateNumberOrOddballToInt32)   \
-  V(CheckedInt32ToUint32)                    \
-  V(CheckedUint32ToInt32)                    \
-  V(ChangeInt32ToFloat64)                    \
-  V(ChangeUint32ToFloat64)                   \
-  V(CheckedTruncateFloat64ToInt32)           \
-  V(CheckedTruncateFloat64ToUint32)          \
-  V(TruncateNumberOrOddballToInt32)          \
-  V(TruncateUint32ToInt32)                   \
-  V(TruncateFloat64ToInt32)                  \
-  V(UnsafeTruncateUint32ToInt32)             \
-  V(UnsafeTruncateFloat64ToInt32)            \
-  V(Int32ToUint8Clamped)                     \
-  V(Uint32ToUint8Clamped)                    \
-  V(Float64ToUint8Clamped)                   \
-  V(CheckedNumberToUint8Clamped)             \
-  V(Int32ToNumber)                           \
-  V(Uint32ToNumber)                          \
-  V(Float64ToTagged)                         \
-  V(HoleyFloat64Box)                         \
-  V(CheckedSmiTagFloat64)                    \
-  V(CheckedNumberOrOddballToFloat64)         \
-  V(UncheckedNumberOrOddballToFloat64)       \
-  V(LogicalNot)                              \
-  V(SetPendingMessage)                       \
-  V(StringAt)                                \
-  V(StringLength)                            \
-  V(ToBoolean)                               \
-  V(ToBooleanLogicalNot)                     \
-  V(TaggedEqual)                             \
-  V(TaggedNotEqual)                          \
-  V(TestInstanceOf)                          \
-  V(TestUndetectable)                        \
-  V(TestTypeOf)                              \
-  V(ToName)                                  \
-  V(ToNumberOrNumeric)                       \
-  V(ToObject)                                \
-  V(ToString)                                \
-  CONSTANT_VALUE_NODE_LIST(V)                \
-  INT32_OPERATIONS_NODE_LIST(V)              \
-  FLOAT64_OPERATIONS_NODE_LIST(V)            \
-  GENERIC_OPERATIONS_NODE_LIST(V)            \
+#define VALUE_NODE_LIST(V)                          \
+  V(Identity)                                       \
+  V(AllocateRaw)                                    \
+  V(Call)                                           \
+  V(CallBuiltin)                                    \
+  V(CallRuntime)                                    \
+  V(CallWithArrayLike)                              \
+  V(CallWithSpread)                                 \
+  V(CallKnownApiFunction)                           \
+  V(CallKnownJSFunction)                            \
+  V(CallSelf)                                       \
+  V(Construct)                                      \
+  V(CheckConstructResult)                           \
+  V(CheckDerivedConstructResult)                    \
+  V(CheckNotHole)                                   \
+  V(ConstructWithSpread)                            \
+  V(ConvertReceiver)                                \
+  V(ConvertHoleToUndefined)                         \
+  V(CreateArrayLiteral)                             \
+  V(CreateShallowArrayLiteral)                      \
+  V(CreateObjectLiteral)                            \
+  V(CreateShallowObjectLiteral)                     \
+  V(CreateFunctionContext)                          \
+  V(CreateClosure)                                  \
+  V(FastCreateClosure)                              \
+  V(CreateRegExpLiteral)                            \
+  V(DeleteProperty)                                 \
+  V(EnsureWritableFastElements)                     \
+  V(FoldedAllocation)                               \
+  V(ForInPrepare)                                   \
+  V(ForInNext)                                      \
+  V(GeneratorRestoreRegister)                       \
+  V(GetIterator)                                    \
+  V(GetSecondReturnedValue)                         \
+  V(GetTemplateObject)                              \
+  V(HasInPrototypeChain)                            \
+  V(InitialValue)                                   \
+  V(LoadPolymorphicDoubleField)                     \
+  V(LoadPolymorphicTaggedField)                     \
+  V(LoadTaggedField)                                \
+  V(LoadDoubleField)                                \
+  V(LoadTaggedFieldByFieldIndex)                    \
+  V(LoadFixedArrayElement)                          \
+  V(LoadFixedDoubleArrayElement)                    \
+  V(LoadHoleyFixedDoubleArrayElement)               \
+  V(LoadHoleyFixedDoubleArrayElementCheckedNotHole) \
+  V(LoadSignedIntDataViewElement)                   \
+  V(LoadDoubleDataViewElement)                      \
+  V(LoadSignedIntTypedArrayElement)                 \
+  V(LoadSignedIntTypedArrayElementNoDeopt)          \
+  V(LoadUnsignedIntTypedArrayElement)               \
+  V(LoadUnsignedIntTypedArrayElementNoDeopt)        \
+  V(LoadDoubleTypedArrayElement)                    \
+  V(LoadDoubleTypedArrayElementNoDeopt)             \
+  V(LoadEnumCacheLength)                            \
+  V(LoadGlobal)                                     \
+  V(LoadNamedGeneric)                               \
+  V(LoadNamedFromSuperGeneric)                      \
+  V(MaybeGrowAndEnsureWritableFastElements)         \
+  V(SetNamedGeneric)                                \
+  V(DefineNamedOwnGeneric)                          \
+  V(StoreInArrayLiteralGeneric)                     \
+  V(StoreGlobal)                                    \
+  V(GetKeyedGeneric)                                \
+  V(SetKeyedGeneric)                                \
+  V(DefineKeyedOwnGeneric)                          \
+  V(Phi)                                            \
+  V(RegisterInput)                                  \
+  V(CheckedSmiTagInt32)                             \
+  V(CheckedSmiTagUint32)                            \
+  V(UnsafeSmiTag)                                   \
+  V(CheckedSmiUntag)                                \
+  V(UnsafeSmiUntag)                                 \
+  V(CheckedInternalizedString)                      \
+  V(CheckedObjectToIndex)                           \
+  V(CheckedTruncateNumberOrOddballToInt32)          \
+  V(CheckedInt32ToUint32)                           \
+  V(CheckedUint32ToInt32)                           \
+  V(ChangeInt32ToFloat64)                           \
+  V(ChangeUint32ToFloat64)                          \
+  V(CheckedTruncateFloat64ToInt32)                  \
+  V(CheckedTruncateFloat64ToUint32)                 \
+  V(TruncateNumberOrOddballToInt32)                 \
+  V(TruncateUint32ToInt32)                          \
+  V(TruncateFloat64ToInt32)                         \
+  V(UnsafeTruncateUint32ToInt32)                    \
+  V(UnsafeTruncateFloat64ToInt32)                   \
+  V(Int32ToUint8Clamped)                            \
+  V(Uint32ToUint8Clamped)                           \
+  V(Float64ToUint8Clamped)                          \
+  V(CheckedNumberToUint8Clamped)                    \
+  V(Int32ToNumber)                                  \
+  V(Uint32ToNumber)                                 \
+  V(Float64ToTagged)                                \
+  V(HoleyFloat64ToTagged)                           \
+  V(CheckedSmiTagFloat64)                           \
+  V(CheckedNumberOrOddballToFloat64)                \
+  V(UncheckedNumberOrOddballToFloat64)              \
+  V(CheckedHoleyFloat64ToFloat64)                   \
+  V(HoleyFloat64ToMaybeNanFloat64)                  \
+  V(LogicalNot)                                     \
+  V(SetPendingMessage)                              \
+  V(StringAt)                                       \
+  V(StringEqual)                                    \
+  V(StringLength)                                   \
+  V(StringConcat)                                   \
+  V(ToBoolean)                                      \
+  V(ToBooleanLogicalNot)                            \
+  V(TaggedEqual)                                    \
+  V(TaggedNotEqual)                                 \
+  V(TestInstanceOf)                                 \
+  V(TestUndetectable)                               \
+  V(TestTypeOf)                                     \
+  V(ToName)                                         \
+  V(ToNumberOrNumeric)                              \
+  V(ToObject)                                       \
+  V(ToString)                                       \
+  V(NumberToString)                                 \
+  CONSTANT_VALUE_NODE_LIST(V)                       \
+  INT32_OPERATIONS_NODE_LIST(V)                     \
+  FLOAT64_OPERATIONS_NODE_LIST(V)                   \
+  GENERIC_OPERATIONS_NODE_LIST(V)                   \
   INLINE_BUILTIN_NODE_LIST(V)
 
 #define GAP_MOVE_NODE_LIST(V) \
@@ -257,12 +264,11 @@ class MergePointInterpreterFrameState;
   V(CheckDynamicValue)                      \
   V(CheckInt32IsSmi)                        \
   V(CheckUint32IsSmi)                       \
+  V(CheckHoleyFloat64IsSmi)                 \
   V(CheckHeapObject)                        \
   V(CheckInt32Condition)                    \
   V(CheckFixedArrayNonEmpty)                \
-  V(CheckJSArrayBounds)                     \
   V(CheckJSDataViewBounds)                  \
-  V(CheckJSObjectElementsBounds)            \
   V(CheckJSTypedArrayBounds)                \
   V(CheckMaps)                              \
   V(CheckMapsWithMigration)                 \
@@ -271,15 +277,16 @@ class MergePointInterpreterFrameState;
   V(CheckString)                            \
   V(CheckSymbol)                            \
   V(CheckValue)                             \
+  V(CheckValueEqualsInt32)                  \
+  V(CheckValueEqualsFloat64)                \
   V(CheckValueEqualsString)                 \
   V(CheckInstanceType)                      \
   V(DebugBreak)                             \
   V(FunctionEntryStackCheck)                \
   V(GeneratorStore)                         \
-  V(JumpLoopPrologue)                       \
+  V(TryOnStackReplacement)                  \
   V(StoreMap)                               \
   V(StoreDoubleField)                       \
-  V(CheckedStoreFixedArraySmiElement)       \
   V(StoreFixedArrayElementWithWriteBarrier) \
   V(StoreFixedArrayElementNoWriteBarrier)   \
   V(StoreFixedDoubleArrayElement)           \
@@ -292,25 +299,30 @@ class MergePointInterpreterFrameState;
   V(StoreDoubleDataViewElement)             \
   V(StoreTaggedFieldNoWriteBarrier)         \
   V(StoreTaggedFieldWithWriteBarrier)       \
-  V(CheckedStoreSmiField)                   \
-  V(IncreaseInterruptBudget)                \
+  V(HandleNoHeapWritesInterrupt)            \
   V(ReduceInterruptBudgetForLoop)           \
   V(ReduceInterruptBudgetForReturn)         \
   V(ThrowReferenceErrorIfHole)              \
   V(ThrowSuperNotCalledIfHole)              \
   V(ThrowSuperAlreadyCalledIfNotHole)       \
+  V(ThrowIfNotCallable)                     \
   V(ThrowIfNotSuperConstructor)             \
-  V(TransitionElementsKind)                 \
+  V(TransitionElementsKindOrCheckMap)       \
+  V(UpdateJSArrayLength)                    \
   GAP_MOVE_NODE_LIST(V)                     \
   VALUE_NODE_LIST(V)
 
 #define BRANCH_CONTROL_NODE_LIST(V) \
   V(BranchIfRootConstant)           \
   V(BranchIfToBooleanTrue)          \
-  V(BranchIfReferenceCompare)       \
+  V(BranchIfInt32ToBooleanTrue)     \
+  V(BranchIfFloat64ToBooleanTrue)   \
+  V(BranchIfFloat64IsHole)          \
+  V(BranchIfReferenceEqual)         \
   V(BranchIfInt32Compare)           \
   V(BranchIfFloat64Compare)         \
   V(BranchIfUndefinedOrNull)        \
+  V(BranchIfUndetectable)           \
   V(BranchIfJSReceiver)             \
   V(BranchIfTypeOf)
 
@@ -320,9 +332,7 @@ class MergePointInterpreterFrameState;
 
 #define UNCONDITIONAL_CONTROL_NODE_LIST(V) \
   V(Jump)                                  \
-  V(JumpLoop)                              \
-  V(JumpToInlined)                         \
-  V(JumpFromInlined)
+  V(JumpLoop)
 
 #define TERMINAL_CONTROL_NODE_LIST(V) \
   V(Abort)                            \
@@ -440,15 +450,161 @@ enum class ValueRepresentation : uint8_t {
   kInt32,
   kUint32,
   kFloat64,
+  kHoleyFloat64,
   kWord64
 };
 
+inline constexpr bool IsDoubleRepresentation(ValueRepresentation repr) {
+  return repr == ValueRepresentation::kFloat64 ||
+         repr == ValueRepresentation::kHoleyFloat64;
+}
+
+/*
+ * The intersection (using `&`) of any two NodeTypes must be a valid NodeType
+ * (possibly "kUnknown", modulo heap object bit).
+ *
+ * All heap object types include the heap object bit, so that they can be
+ * checked for AnyHeapObject with a single bit check.
+ *
+ * Here is a diagram of the relations between the types, where (*) means that
+ * they have the kAnyHeapObject bit set.
+ *
+ *    NumberOrOddball              JsReceiver*            Name*
+ *     /         \                     |                 /    \
+ *  Oddball*     Number             Callable*        String*  Symbol*
+ *    |          /    \                                |
+ *  Boolean*    Smi   HeapNumber*              InternalizedString*
+ *
+ */
+
+#define NODE_TYPE_LIST(V)                                  \
+  V(Unknown, 0)                                            \
+  V(NumberOrOddball, (1 << 1))                             \
+  V(Number, (1 << 2) | kNumberOrOddball)                   \
+  V(Smi, (1 << 4) | kNumber)                               \
+  V(AnyHeapObject, (1 << 5))                               \
+  V(Oddball, (1 << 6) | kAnyHeapObject | kNumberOrOddball) \
+  V(Boolean, (1 << 7) | kOddball)                          \
+  V(Name, (1 << 8) | kAnyHeapObject)                       \
+  V(String, (1 << 9) | kName)                              \
+  V(InternalizedString, (1 << 10) | kString)               \
+  V(Symbol, (1 << 11) | kName)                             \
+  V(JSReceiver, (1 << 12) | kAnyHeapObject)                \
+  V(Callable, (1 << 13) | kJSReceiver | kAnyHeapObject)    \
+  V(HeapNumber, kAnyHeapObject | kNumber)
+
+enum class NodeType : uint16_t {
+#define DEFINE_NODE_TYPE(Name, Value) k##Name = Value,
+  NODE_TYPE_LIST(DEFINE_NODE_TYPE)
+#undef DEFINE_NODE_TYPE
+};
+
+inline NodeType CombineType(NodeType left, NodeType right) {
+  return static_cast<NodeType>(static_cast<int>(left) |
+                               static_cast<int>(right));
+}
+inline NodeType IntersectType(NodeType left, NodeType right) {
+  return static_cast<NodeType>(static_cast<int>(left) &
+                               static_cast<int>(right));
+}
+inline bool NodeTypeIs(NodeType type, NodeType to_check) {
+  int right = static_cast<int>(to_check);
+  return (static_cast<int>(type) & right) == right;
+}
+
+inline NodeType StaticTypeForMap(compiler::MapRef map) {
+  if (map.IsHeapNumberMap()) return NodeType::kHeapNumber;
+  if (map.IsInternalizedStringMap()) return NodeType::kInternalizedString;
+  if (map.IsStringMap()) return NodeType::kString;
+  if (map.IsJSReceiverMap()) return NodeType::kJSReceiver;
+  return NodeType::kAnyHeapObject;
+}
+
+inline NodeType StaticTypeForConstant(compiler::JSHeapBroker* broker,
+                                      compiler::ObjectRef ref) {
+  if (ref.IsSmi()) return NodeType::kSmi;
+  return StaticTypeForMap(ref.AsHeapObject().map(broker));
+}
+
+inline bool IsInstanceOfNodeType(compiler::MapRef map, NodeType type,
+                                 compiler::JSHeapBroker* broker) {
+  switch (type) {
+    case NodeType::kUnknown:
+      return true;
+    case NodeType::kNumberOrOddball:
+      return map.IsHeapNumberMap() || map.IsOddballMap();
+    case NodeType::kSmi:
+      return false;
+    case NodeType::kNumber:
+    case NodeType::kHeapNumber:
+      return map.IsHeapNumberMap();
+    case NodeType::kAnyHeapObject:
+      return true;
+    case NodeType::kOddball:
+      return map.IsOddballMap();
+    case NodeType::kBoolean:
+      return map.IsOddballMap() &&
+             map.oddball_type(broker) == compiler::OddballType::kBoolean;
+    case NodeType::kName:
+      return map.IsNameMap();
+    case NodeType::kString:
+      return map.IsStringMap();
+    case NodeType::kInternalizedString:
+      return map.IsInternalizedStringMap();
+    case NodeType::kSymbol:
+      return map.IsSymbolMap();
+    case NodeType::kJSReceiver:
+      return map.IsJSReceiverMap();
+    case NodeType::kCallable:
+      return map.is_callable();
+  }
+
+    // This is some composed type. We could speed this up by exploiting the tree
+    // structure of the types.
+#define CASE(Name, _)                                            \
+  if (NodeTypeIs(type, NodeType::k##Name)) {                     \
+    if (!IsInstanceOfNodeType(map, NodeType::k##Name, broker)) { \
+      return false;                                              \
+    }                                                            \
+  }
+  NODE_TYPE_LIST(CASE)
+#undef CASE
+  return true;
+}
+
+inline std::ostream& operator<<(std::ostream& out, const NodeType& type) {
+  switch (type) {
+#define CASE(Name, _)     \
+  case NodeType::k##Name: \
+    out << #Name;         \
+    break;
+    NODE_TYPE_LIST(CASE)
+#undef CASE
+    default:
+#define CASE(Name, _)                        \
+  if (NodeTypeIs(type, NodeType::k##Name)) { \
+    out << #Name ",";                        \
+  }
+      NODE_TYPE_LIST(CASE)
+#undef CASE
+  }
+  return out;
+}
+
+#define DEFINE_NODE_TYPE_CHECK(Type, _)         \
+  inline bool NodeTypeIs##Type(NodeType type) { \
+    return NodeTypeIs(type, NodeType::k##Type); \
+  }
+NODE_TYPE_LIST(DEFINE_NODE_TYPE_CHECK)
+#undef DEFINE_NODE_TYPE_CHECK
+
 enum class TaggedToFloat64ConversionType : uint8_t {
-  kNumber,
+  kOnlyNumber,
   kNumberOrOddball,
 };
 
 constexpr Condition ConditionFor(Operation cond);
+constexpr Condition ConditionForNaN();
 
 bool FromConstantToBool(LocalIsolate* local_isolate, ValueNode* node);
 bool FromConstantToBool(MaglevAssembler* masm, ValueNode* node);
@@ -490,6 +646,8 @@ inline std::ostream& operator<<(std::ostream& os,
       return os << "Uint32";
     case ValueRepresentation::kFloat64:
       return os << "Float64";
+    case ValueRepresentation::kHoleyFloat64:
+      return os << "HoleyFloat64";
     case ValueRepresentation::kWord64:
       return os << "Word64";
   }
@@ -498,7 +656,7 @@ inline std::ostream& operator<<(std::ostream& os,
 inline std::ostream& operator<<(
     std::ostream& os, const TaggedToFloat64ConversionType& conversion_type) {
   switch (conversion_type) {
-    case TaggedToFloat64ConversionType::kNumber:
+    case TaggedToFloat64ConversionType::kOnlyNumber:
       return os << "Number";
     case TaggedToFloat64ConversionType::kNumberOrOddball:
       return os << "NumberOrOddball";
@@ -616,6 +774,16 @@ class BasicBlockRef {
     return old_next_ptr;
   }
 
+  void Bind(BasicBlock* block) {
+    DCHECK_EQ(state_, kRefList);
+
+    BasicBlockRef* next_ref = SetToBlockAndReturnNext(block);
+    while (next_ref != nullptr) {
+      next_ref = next_ref->SetToBlockAndReturnNext(block);
+    }
+    DCHECK_EQ(block_ptr(), block);
+  }
+
   BasicBlock* block_ptr() const {
     DCHECK_EQ(state_, kBlockPointer);
     return block_ptr_;
@@ -631,22 +799,11 @@ class BasicBlockRef {
     return next_ref_ != nullptr;
   }
 
-  int interrupt_budget_correction() const {
-    DCHECK_EQ(state_, kRefList);
-    return interrupt_budget_correction_;
-  }
-
-  void set_interrupt_budget_correction(int interrupt_budget_correction) {
-    DCHECK_EQ(state_, kRefList);
-    interrupt_budget_correction_ = interrupt_budget_correction;
-  }
-
  private:
   union {
     BasicBlock* block_ptr_;
     BasicBlockRef* next_ref_;
   };
-  int interrupt_budget_correction_ = 0;
 #ifdef DEBUG
   enum { kBlockPointer, kRefList } state_;
 #endif  // DEBUG
@@ -659,6 +816,7 @@ class OpProperties {
     // deferred calls as well.
     return kIsCallBit::decode(bitfield_);
   }
+  constexpr bool is_any_call() const { return is_call() || is_deferred_call(); }
   constexpr bool can_eager_deopt() const {
     return kCanEagerDeoptBit::decode(bitfield_);
   }
@@ -673,8 +831,8 @@ class OpProperties {
   }
   constexpr bool can_read() const { return kCanReadBit::decode(bitfield_); }
   constexpr bool can_write() const { return kCanWriteBit::decode(bitfield_); }
-  constexpr bool non_memory_side_effects() const {
-    return kNonMemorySideEffectsBit::decode(bitfield_);
+  constexpr bool can_allocate() const {
+    return kCanAllocate::decode(bitfield_);
   }
   constexpr ValueRepresentation value_representation() const {
     return kValueRepresentationBits::decode(bitfield_);
@@ -691,18 +849,14 @@ class OpProperties {
   constexpr bool is_pure() const {
     return (bitfield_ & kPureMask) == kPureValue;
   }
-  constexpr bool has_any_side_effects() const {
-    return can_write() || non_memory_side_effects();
-  }
   constexpr bool is_required_when_unused() {
     if (is_conversion()) {
-      // Calls in conversions are not counted as side-effect as far as
+      // Calls in conversions are not counted as a side-effect as far as
       // is_required_when_unused is concerned, since they should always be to
       // the Allocate builtin.
-      return has_any_side_effects() || can_throw() || can_deopt();
+      return can_write() || can_throw() || can_deopt();
     } else {
-      return has_any_side_effects() || can_throw() || can_deopt() ||
-             is_any_call();
+      return can_write() || can_throw() || can_deopt() || is_any_call();
     }
   }
 
@@ -720,17 +874,17 @@ class OpProperties {
   static constexpr OpProperties LazyDeopt() {
     return OpProperties(kCanLazyDeoptBit::encode(true));
   }
-  static constexpr OpProperties Throw() {
+  static constexpr OpProperties CanThrow() {
     return OpProperties(kCanThrowBit::encode(true)) | LazyDeopt();
   }
-  static constexpr OpProperties Reading() {
+  static constexpr OpProperties CanRead() {
     return OpProperties(kCanReadBit::encode(true));
   }
-  static constexpr OpProperties Writing() {
+  static constexpr OpProperties CanWrite() {
     return OpProperties(kCanWriteBit::encode(true));
   }
-  static constexpr OpProperties NonMemorySideEffects() {
-    return OpProperties(kNonMemorySideEffectsBit::encode(true));
+  static constexpr OpProperties CanAllocate() {
+    return OpProperties(kCanAllocate::encode(true));
   }
   static constexpr OpProperties TaggedValue() {
     return OpProperties(
@@ -752,22 +906,27 @@ class OpProperties {
     return OpProperties(
         kValueRepresentationBits::encode(ValueRepresentation::kFloat64));
   }
+  static constexpr OpProperties HoleyFloat64() {
+    return OpProperties(
+        kValueRepresentationBits::encode(ValueRepresentation::kHoleyFloat64));
+  }
   static constexpr OpProperties ConversionNode() {
     return OpProperties(kIsConversionBit::encode(true));
   }
+  static constexpr OpProperties CanCallUserCode() {
+    return AnySideEffects() | LazyDeopt() | CanThrow();
+  }
   // Without auditing the call target, we must assume it can cause a lazy deopt
   // and throw. Use this when codegen calls runtime or a builtin, unless
   // certain that the target either doesn't throw or cannot deopt.
   // TODO(jgruber): Go through all nodes marked with this property and decide
   // whether to keep it (or remove either the lazy-deopt or throw flag).
   static constexpr OpProperties GenericRuntimeOrBuiltinCall() {
-    return Call() | NonMemorySideEffects() | LazyDeopt() | Throw();
-  }
-  static constexpr OpProperties JSCall() {
-    return Call() | NonMemorySideEffects() | LazyDeopt() | Throw();
+    return Call() | CanCallUserCode();
   }
+  static constexpr OpProperties JSCall() { return Call() | CanCallUserCode(); }
   static constexpr OpProperties AnySideEffects() {
-    return Reading() | Writing() | NonMemorySideEffects();
+    return CanRead() | CanWrite() | CanAllocate();
   }
   static constexpr OpProperties DeferredCall() {
     // Operations with a deferred call need a snapshot of register state,
@@ -795,20 +954,19 @@ class OpProperties {
   using kCanThrowBit = kCanLazyDeoptBit::Next<bool, 1>;
   using kCanReadBit = kCanThrowBit::Next<bool, 1>;
   using kCanWriteBit = kCanReadBit::Next<bool, 1>;
-  using kNonMemorySideEffectsBit = kCanWriteBit::Next<bool, 1>;
-  using kValueRepresentationBits =
-      kNonMemorySideEffectsBit::Next<ValueRepresentation, 3>;
+  using kCanAllocate = kCanWriteBit::Next<bool, 1>;
+  using kValueRepresentationBits = kCanAllocate::Next<ValueRepresentation, 3>;
   using kIsConversionBit = kValueRepresentationBits::Next<bool, 1>;
   using kNeedsRegisterSnapshotBit = kIsConversionBit::Next<bool, 1>;
 
-  static const uint32_t kPureMask = kCanReadBit::kMask | kCanWriteBit::kMask |
-                                    kNonMemorySideEffectsBit::kMask;
+  static const uint32_t kPureMask =
+      kCanReadBit::kMask | kCanWriteBit::kMask | kCanAllocate::kMask;
   static const uint32_t kPureValue = kCanReadBit::encode(false) |
                                      kCanWriteBit::encode(false) |
-                                     kNonMemorySideEffectsBit::encode(false);
+                                     kCanAllocate::encode(false);
 
   // NeedsRegisterSnapshot is only used for DeferredCall, and we rely on this in
-  // `is_any_call` to detect deferred calls. If you need to use
+  // `is_deferred_call` to detect deferred calls. If you need to use
   // NeedsRegisterSnapshot for something else that DeferredCalls, then you'll
   // have to update `is_any_call`.
   static constexpr OpProperties NeedsRegisterSnapshot() {
@@ -820,14 +978,14 @@ class OpProperties {
  public:
   static const size_t kSize = kNeedsRegisterSnapshotBit::kLastUsedBit + 1;
 
-  constexpr bool is_any_call() const {
+  constexpr bool is_deferred_call() const {
     // Currently, there is no kDeferredCall bit, but DeferredCall only sets a
     // single bit: kNeedsRegisterSnapShot. If this static assert breaks, it
     // means that you added additional properties to DeferredCall, and you
     // should update this function accordingly.
     static_assert(DeferredCall().bitfield_ ==
                   kNeedsRegisterSnapshotBit::encode(true));
-    return is_call() || needs_register_snapshot();
+    return needs_register_snapshot();
   }
 };
 
@@ -908,96 +1066,104 @@ class Input : public InputLocation {
 
 class InterpretedDeoptFrame;
 class InlinedArgumentsDeoptFrame;
+class ConstructInvokeStubDeoptFrame;
 class BuiltinContinuationDeoptFrame;
 class DeoptFrame {
  public:
   enum class FrameType {
     kInterpretedFrame,
     kInlinedArgumentsFrame,
+    kConstructInvokeStubFrame,
     kBuiltinContinuationFrame,
   };
 
-  FrameType type() const { return type_; }
-  const DeoptFrame* parent() const { return parent_; }
-
-  inline const InterpretedDeoptFrame& as_interpreted() const;
-  inline const InlinedArgumentsDeoptFrame& as_inlined_arguments() const;
-  inline const BuiltinContinuationDeoptFrame& as_builtin_continuation() const;
-
- protected:
   struct InterpretedFrameData {
     const MaglevCompilationUnit& unit;
     const CompactInterpreterFrameState* frame_state;
-    BytecodeOffset bytecode_position;
-    SourcePosition source_position;
+    ValueNode* closure;
+    const BytecodeOffset bytecode_position;
+    const SourcePosition source_position;
   };
+
   struct InlinedArgumentsFrameData {
     const MaglevCompilationUnit& unit;
-    BytecodeOffset bytecode_position;
-    base::Vector<ValueNode*> arguments;
+    const BytecodeOffset bytecode_position;
+    ValueNode* closure;
+    const base::Vector<ValueNode*> arguments;
   };
+
+  struct ConstructInvokeStubFrameData {
+    const MaglevCompilationUnit& unit;
+    const SourcePosition source_position;
+    ValueNode* receiver;
+    ValueNode* context;
+  };
+
   struct BuiltinContinuationFrameData {
-    Builtin builtin_id;
-    base::Vector<ValueNode*> parameters;
-    // All of the ValueNode inputs in InterpretedFrameData,
-    // InlinedArgumentsFrameData and BuiltinContinuationFrameData are stored in
-    // non-const pointers (`frame_state.live_registers_and_accumulator_`,
-    // `arguments` and `parameters`), which allows DeepForEachInput and
-    // CompactInterpreterFrameState::ForEachValue to iterate over all of the
-    // inputs as ValueNode*&, allowing the callback function to mutate the frame
-    // state inputs. This is in particular useful for PhiRepresentationSelector,
-    // which may need to update some frame state inputs.
-    // However, the following `context` field is the only exception, as it is
-    // stored directly in the frame state. Thus, we made it mutable, so that we
-    // can update it in DeepForEachInput while still keeping as many `const`
-    // methods and fields as we can.
-    mutable ValueNode* context;
+    const Builtin builtin_id;
+    const base::Vector<ValueNode*> parameters;
+    ValueNode* context;
+    compiler::OptionalJSFunctionRef maybe_js_target;
   };
 
-  DeoptFrame(InterpretedFrameData data, const DeoptFrame* parent)
-      : interpreted_frame_data_(data),
-        type_(FrameType::kInterpretedFrame),
-        parent_(parent) {}
-  DeoptFrame(InlinedArgumentsFrameData data, const DeoptFrame* parent)
-      : inlined_arguments_frame_data_(data),
-        type_(FrameType::kInlinedArgumentsFrame),
-        parent_(parent) {}
-  DeoptFrame(BuiltinContinuationFrameData data, const DeoptFrame* parent)
-      : builtin_continuation_frame_data_(data),
-        type_(FrameType::kBuiltinContinuationFrame),
-        parent_(parent) {}
+  using FrameData = base::DiscriminatedUnion<
+      FrameType, InterpretedFrameData, InlinedArgumentsFrameData,
+      ConstructInvokeStubFrameData, BuiltinContinuationFrameData>;
 
-  union {
-    const InterpretedFrameData interpreted_frame_data_;
-    const InlinedArgumentsFrameData inlined_arguments_frame_data_;
-    const BuiltinContinuationFrameData builtin_continuation_frame_data_;
-  };
-  FrameType type_;
-  const DeoptFrame* parent_;
+  DeoptFrame(FrameData&& data, DeoptFrame* parent)
+      : data_(std::move(data)), parent_(parent) {}
+
+  FrameType type() const { return data_.tag(); }
+  DeoptFrame* parent() { return parent_; }
+  const DeoptFrame* parent() const { return parent_; }
+
+  inline const InterpretedDeoptFrame& as_interpreted() const;
+  inline const InlinedArgumentsDeoptFrame& as_inlined_arguments() const;
+  inline const ConstructInvokeStubDeoptFrame& as_construct_stub() const;
+  inline const BuiltinContinuationDeoptFrame& as_builtin_continuation() const;
+  inline InterpretedDeoptFrame& as_interpreted();
+  inline InlinedArgumentsDeoptFrame& as_inlined_arguments();
+  inline ConstructInvokeStubDeoptFrame& as_construct_stub();
+  inline BuiltinContinuationDeoptFrame& as_builtin_continuation();
+  inline bool IsJsFrame() const;
+
+ protected:
+  DeoptFrame(InterpretedFrameData&& data, DeoptFrame* parent)
+      : data_(std::move(data)), parent_(parent) {}
+  DeoptFrame(InlinedArgumentsFrameData&& data, DeoptFrame* parent)
+      : data_(std::move(data)), parent_(parent) {}
+  DeoptFrame(ConstructInvokeStubFrameData&& data, DeoptFrame* parent)
+      : data_(std::move(data)), parent_(parent) {}
+  DeoptFrame(BuiltinContinuationFrameData&& data, DeoptFrame* parent)
+      : data_(std::move(data)), parent_(parent) {}
+
+  FrameData data_;
+  DeoptFrame* const parent_;
 };
 
 class InterpretedDeoptFrame : public DeoptFrame {
  public:
   InterpretedDeoptFrame(const MaglevCompilationUnit& unit,
                         const CompactInterpreterFrameState* frame_state,
-                        BytecodeOffset bytecode_position,
-                        SourcePosition source_position,
-                        const DeoptFrame* parent)
-      : DeoptFrame(InterpretedFrameData{unit, frame_state, bytecode_position,
-                                        source_position},
+                        ValueNode* closure, BytecodeOffset bytecode_position,
+                        SourcePosition source_position, DeoptFrame* parent)
+      : DeoptFrame(InterpretedFrameData{unit, frame_state, closure,
+                                        bytecode_position, source_position},
                    parent) {}
 
-  const MaglevCompilationUnit& unit() const {
-    return interpreted_frame_data_.unit;
-  }
+  const MaglevCompilationUnit& unit() const { return data().unit; }
   const CompactInterpreterFrameState* frame_state() const {
-    return interpreted_frame_data_.frame_state;
+    return data().frame_state;
   }
-  BytecodeOffset bytecode_position() const {
-    return interpreted_frame_data_.bytecode_position;
-  }
-  SourcePosition source_position() const {
-    return interpreted_frame_data_.source_position;
+  ValueNode*& closure() { return data().closure; }
+  ValueNode* closure() const { return data().closure; }
+  BytecodeOffset bytecode_position() const { return data().bytecode_position; }
+  SourcePosition source_position() const { return data().source_position; }
+
+ private:
+  InterpretedFrameData& data() { return data_.get<InterpretedFrameData>(); }
+  const InterpretedFrameData& data() const {
+    return data_.get<InterpretedFrameData>();
   }
 };
 
@@ -1008,25 +1174,34 @@ inline const InterpretedDeoptFrame& DeoptFrame::as_interpreted() const {
   DCHECK_EQ(type(), FrameType::kInterpretedFrame);
   return static_cast<const InterpretedDeoptFrame&>(*this);
 }
+inline InterpretedDeoptFrame& DeoptFrame::as_interpreted() {
+  DCHECK_EQ(type(), FrameType::kInterpretedFrame);
+  return static_cast<InterpretedDeoptFrame&>(*this);
+}
 
 class InlinedArgumentsDeoptFrame : public DeoptFrame {
  public:
   InlinedArgumentsDeoptFrame(const MaglevCompilationUnit& unit,
                              BytecodeOffset bytecode_position,
+                             ValueNode* closure,
                              base::Vector<ValueNode*> arguments,
-                             const DeoptFrame* parent)
-      : DeoptFrame(
-            InlinedArgumentsFrameData{unit, bytecode_position, arguments},
-            parent) {}
+                             DeoptFrame* parent)
+      : DeoptFrame(InlinedArgumentsFrameData{unit, bytecode_position, closure,
+                                             arguments},
+                   parent) {}
 
-  const MaglevCompilationUnit& unit() const {
-    return interpreted_frame_data_.unit;
-  }
-  BytecodeOffset bytecode_position() const {
-    return inlined_arguments_frame_data_.bytecode_position;
+  const MaglevCompilationUnit& unit() const { return data().unit; }
+  BytecodeOffset bytecode_position() const { return data().bytecode_position; }
+  ValueNode*& closure() { return data().closure; }
+  ValueNode* closure() const { return data().closure; }
+  base::Vector<ValueNode*> arguments() const { return data().arguments; }
+
+ private:
+  InlinedArgumentsFrameData& data() {
+    return data_.get<InlinedArgumentsFrameData>();
   }
-  base::Vector<ValueNode*> arguments() const {
-    return inlined_arguments_frame_data_.arguments;
+  const InlinedArgumentsFrameData& data() const {
+    return data_.get<InlinedArgumentsFrameData>();
   }
 };
 
@@ -1038,24 +1213,77 @@ inline const InlinedArgumentsDeoptFrame& DeoptFrame::as_inlined_arguments()
   DCHECK_EQ(type(), FrameType::kInlinedArgumentsFrame);
   return static_cast<const InlinedArgumentsDeoptFrame&>(*this);
 }
+inline InlinedArgumentsDeoptFrame& DeoptFrame::as_inlined_arguments() {
+  DCHECK_EQ(type(), FrameType::kInlinedArgumentsFrame);
+  return static_cast<InlinedArgumentsDeoptFrame&>(*this);
+}
+
+class ConstructInvokeStubDeoptFrame : public DeoptFrame {
+ public:
+  ConstructInvokeStubDeoptFrame(const MaglevCompilationUnit& unit,
+                                SourcePosition source_position,
+                                ValueNode* receiver, ValueNode* context,
+                                DeoptFrame* parent)
+      : DeoptFrame(ConstructInvokeStubFrameData{unit, source_position, receiver,
+                                                context},
+                   parent) {}
+
+  const MaglevCompilationUnit& unit() const { return data().unit; }
+  ValueNode*& receiver() { return data().receiver; }
+  ValueNode* receiver() const { return data().receiver; }
+  ValueNode*& context() { return data().context; }
+  ValueNode* context() const { return data().context; }
+  SourcePosition source_position() const { return data().source_position; }
+
+ private:
+  ConstructInvokeStubFrameData& data() {
+    return data_.get<ConstructInvokeStubFrameData>();
+  }
+  const ConstructInvokeStubFrameData& data() const {
+    return data_.get<ConstructInvokeStubFrameData>();
+  }
+};
+
+// Make sure storing/passing deopt frames by value doesn't truncate them.
+static_assert(sizeof(ConstructInvokeStubDeoptFrame) == sizeof(DeoptFrame));
+
+inline const ConstructInvokeStubDeoptFrame& DeoptFrame::as_construct_stub()
+    const {
+  DCHECK_EQ(type(), FrameType::kConstructInvokeStubFrame);
+  return static_cast<const ConstructInvokeStubDeoptFrame&>(*this);
+}
+
+inline ConstructInvokeStubDeoptFrame& DeoptFrame::as_construct_stub() {
+  DCHECK_EQ(type(), FrameType::kConstructInvokeStubFrame);
+  return static_cast<ConstructInvokeStubDeoptFrame&>(*this);
+}
 
 class BuiltinContinuationDeoptFrame : public DeoptFrame {
  public:
   BuiltinContinuationDeoptFrame(Builtin builtin_id,
                                 base::Vector<ValueNode*> parameters,
-                                ValueNode* context, const DeoptFrame* parent)
-      : DeoptFrame(
-            BuiltinContinuationFrameData{builtin_id, parameters, context},
-            parent) {}
+                                ValueNode* context,
+                                compiler::OptionalJSFunctionRef maybe_js_target,
+                                DeoptFrame* parent)
+      : DeoptFrame(BuiltinContinuationFrameData{builtin_id, parameters, context,
+                                                maybe_js_target},
+                   parent) {}
 
-  const Builtin& builtin_id() const {
-    return builtin_continuation_frame_data_.builtin_id;
+  const Builtin& builtin_id() const { return data().builtin_id; }
+  base::Vector<ValueNode*> parameters() const { return data().parameters; }
+  ValueNode*& context() { return data().context; }
+  ValueNode* context() const { return data().context; }
+  bool is_javascript() const { return data().maybe_js_target.has_value(); }
+  compiler::JSFunctionRef javascript_target() const {
+    return data().maybe_js_target.value();
   }
-  base::Vector<ValueNode*> parameters() const {
-    return builtin_continuation_frame_data_.parameters;
+
+ private:
+  BuiltinContinuationFrameData& data() {
+    return data_.get<BuiltinContinuationFrameData>();
   }
-  ValueNode*& context() const {
-    return builtin_continuation_frame_data_.context;
+  const BuiltinContinuationFrameData& data() const {
+    return data_.get<BuiltinContinuationFrameData>();
   }
 };
 
@@ -1067,6 +1295,24 @@ DeoptFrame::as_builtin_continuation() const {
   DCHECK_EQ(type(), FrameType::kBuiltinContinuationFrame);
   return static_cast<const BuiltinContinuationDeoptFrame&>(*this);
 }
+inline BuiltinContinuationDeoptFrame& DeoptFrame::as_builtin_continuation() {
+  DCHECK_EQ(type(), FrameType::kBuiltinContinuationFrame);
+  return static_cast<BuiltinContinuationDeoptFrame&>(*this);
+}
+
+inline bool DeoptFrame::IsJsFrame() const {
+  // This must be in sync with TRANSLATION_JS_FRAME_OPCODE_LIST in
+  // translation-opcode.h or bad things happen.
+  switch (data_.tag()) {
+    case FrameType::kInterpretedFrame:
+      return true;
+    case FrameType::kBuiltinContinuationFrame:
+      return as_builtin_continuation().is_javascript();
+    case FrameType::kConstructInvokeStubFrame:
+    case FrameType::kInlinedArgumentsFrame:
+      return false;
+  }
+}
 
 class DeoptInfo {
  protected:
@@ -1074,8 +1320,9 @@ class DeoptInfo {
             compiler::FeedbackSource feedback_to_update);
 
  public:
+  DeoptFrame& top_frame() { return top_frame_; }
   const DeoptFrame& top_frame() const { return top_frame_; }
-  const compiler::FeedbackSource& feedback_to_update() {
+  const compiler::FeedbackSource& feedback_to_update() const {
     return feedback_to_update_;
   }
 
@@ -1086,7 +1333,7 @@ class DeoptInfo {
   void set_translation_index(int index) { translation_index_ = index; }
 
  private:
-  const DeoptFrame top_frame_;
+  DeoptFrame top_frame_;
   const compiler::FeedbackSource feedback_to_update_;
   InputLocation* const input_locations_;
   Label deopt_entry_label_;
@@ -1124,15 +1371,11 @@ class LazyDeoptInfo : public DeoptInfo {
             ResultSizeField::encode(result_size)) {}
 
   interpreter::Register result_location() const {
-    // We should only be checking this for interpreted frames, other kinds of
-    // frames shouldn't be considered for result locations.
-    DCHECK_EQ(top_frame().type(), DeoptFrame::FrameType::kInterpretedFrame);
+    DCHECK(IsConsideredForResultLocation());
     return result_location_;
   }
   int result_size() const {
-    // We should only be checking this for interpreted frames, other kinds of
-    // frames shouldn't be considered for result locations.
-    DCHECK_EQ(top_frame().type(), DeoptFrame::FrameType::kInterpretedFrame);
+    DCHECK(IsConsideredForResultLocation());
     return ResultSizeField::decode(bitfield_);
   }
 
@@ -1147,9 +1390,7 @@ class LazyDeoptInfo : public DeoptInfo {
     bitfield_ = ResultSizeField::update(bitfield_, result_size);
   }
   bool HasResultLocation() const {
-    // We should only be checking this for interpreted frames, other kinds of
-    // frames shouldn't be considered for result locations.
-    DCHECK_EQ(top_frame().type(), DeoptFrame::FrameType::kInterpretedFrame);
+    DCHECK(IsConsideredForResultLocation());
     return result_location_.is_valid();
   }
 
@@ -1165,6 +1406,27 @@ class LazyDeoptInfo : public DeoptInfo {
   }
 
  private:
+#ifdef DEBUG
+  bool IsConsideredForResultLocation() const {
+    switch (top_frame().type()) {
+      case DeoptFrame::FrameType::kInterpretedFrame:
+        // Interpreted frames obviously need a result location.
+        return true;
+      case DeoptFrame::FrameType::kInlinedArgumentsFrame:
+      case DeoptFrame::FrameType::kConstructInvokeStubFrame:
+        return false;
+      case DeoptFrame::FrameType::kBuiltinContinuationFrame:
+        // Normally if the function is going to be deoptimized then the top
+        // frame should be an interpreted one. The only exception is the case
+        // when the lazy deopt point was added only for the sake of recoring
+        // an inlined Api function instance in the deopt info for exception
+        // stack trace reconstruction.
+        return top_frame().as_builtin_continuation().builtin_id() ==
+               Builtin::kGenericLazyDeoptContinuation;
+    }
+  }
+#endif  // DEBUG
+
   using DeoptingCallReturnPcField = base::BitField<unsigned int, 0, 30>;
   using ResultSizeField = DeoptingCallReturnPcField::Next<unsigned int, 2>;
 
@@ -1443,6 +1705,14 @@ class NodeBase : public ZoneObject {
                        other->eager_deopt_info()->feedback_to_update());
   }
 
+  void SetEagerDeoptInfo(Zone* zone, DeoptFrame deopt_frame,
+                         compiler::FeedbackSource feedback_to_update =
+                             compiler::FeedbackSource()) {
+    DCHECK(properties().can_eager_deopt());
+    new (eager_deopt_info())
+        EagerDeoptInfo(zone, deopt_frame, feedback_to_update);
+  }
+
   template <typename NodeT>
   void OverwriteWith() {
     OverwriteWith(NodeBase::opcode_of<NodeT>, NodeT::kProperties);
@@ -1529,6 +1799,7 @@ class NodeBase : public ZoneObject {
 
  private:
   template <class Derived, typename... Args>
+
   static Derived* Allocate(Zone* zone, size_t input_count, Args&&... args) {
     static_assert(
         !Derived::kProperties.can_eager_deopt() ||
@@ -1537,13 +1808,11 @@ class NodeBase : public ZoneObject {
         "that we cannot have both lazy and eager deopts on a node. If we ever "
         "need this, we have to update accessors to check node->properties() "
         "for which deopts are active.");
-    constexpr size_t size_before_inputs = RoundUp<alignof(Input)>(
-        (Derived::kProperties.can_throw() ? sizeof(ExceptionHandlerInfo) : 0) +
-        (Derived::kProperties.needs_register_snapshot()
-             ? sizeof(RegisterSnapshot)
-             : 0) +
-        (Derived::kProperties.can_eager_deopt() ? sizeof(EagerDeoptInfo) : 0) +
-        (Derived::kProperties.can_lazy_deopt() ? sizeof(LazyDeoptInfo) : 0));
+    constexpr size_t size_before_inputs =
+        ExceptionHandlerInfoSize(Derived::kProperties) +
+        RegisterSnapshotSize(Derived::kProperties) +
+        EagerDeoptInfoSize(Derived::kProperties) +
+        LazyDeoptInfoSize(Derived::kProperties);
 
     static_assert(IsAligned(size_before_inputs, alignof(Input)));
     const size_t size_before_node =
@@ -1562,29 +1831,46 @@ class NodeBase : public ZoneObject {
     return node;
   }
 
+  static constexpr size_t ExceptionHandlerInfoSize(OpProperties properties) {
+    return RoundUp<alignof(Input)>(
+        properties.can_throw() ? sizeof(ExceptionHandlerInfo) : 0);
+  }
+
+  static constexpr size_t RegisterSnapshotSize(OpProperties properties) {
+    return RoundUp<alignof(Input)>(
+        properties.needs_register_snapshot() ? sizeof(RegisterSnapshot) : 0);
+  }
+
+  static constexpr size_t EagerDeoptInfoSize(OpProperties properties) {
+    return RoundUp<alignof(Input)>(
+        properties.can_eager_deopt() ? sizeof(EagerDeoptInfo) : 0);
+  }
+
+  static constexpr size_t LazyDeoptInfoSize(OpProperties properties) {
+    return RoundUp<alignof(Input)>(
+        properties.can_lazy_deopt() ? sizeof(LazyDeoptInfo) : 0);
+  }
+
   // Returns the position of deopt info if it exists, otherwise returns
   // its position as if DeoptInfo size were zero.
   Address deopt_info_address() const {
     DCHECK(!properties().can_eager_deopt() || !properties().can_lazy_deopt());
-    size_t extra = RoundUp<alignof(Input)>(
-        (properties().can_eager_deopt() ? sizeof(EagerDeoptInfo) : 0) +
-        (properties().can_lazy_deopt() ? sizeof(LazyDeoptInfo) : 0));
+    size_t extra =
+        EagerDeoptInfoSize(properties()) + LazyDeoptInfoSize(properties());
     return last_input_address() - extra;
   }
 
   // Returns the position of register snapshot if it exists, otherwise returns
   // its position as if RegisterSnapshot size were zero.
   Address register_snapshot_address() const {
-    size_t extra = RoundUp<alignof(Input)>((
-        properties().needs_register_snapshot() ? sizeof(RegisterSnapshot) : 0));
+    size_t extra = RegisterSnapshotSize(properties());
     return deopt_info_address() - extra;
   }
 
   // Returns the position of exception handler info if it exists, otherwise
   // returns its position as if ExceptionHandlerInfo size were zero.
   Address exception_handler_address() const {
-    size_t extra = RoundUp<alignof(Input)>(
-        (properties().can_throw() ? sizeof(ExceptionHandlerInfo) : 0));
+    size_t extra = ExceptionHandlerInfoSize(properties());
     return register_snapshot_address() - extra;
   }
 
@@ -1707,7 +1993,7 @@ class ValueNode : public Node {
   void LoadToRegister(MaglevAssembler*, DoubleRegister);
   void DoLoadToRegister(MaglevAssembler*, Register);
   void DoLoadToRegister(MaglevAssembler*, DoubleRegister);
-  Handle<Object> Reify(LocalIsolate* isolate);
+  Handle<Object> Reify(LocalIsolate* isolate) const;
 
   void Spill(compiler::AllocatedOperand operand) {
 #ifdef DEBUG
@@ -1762,8 +2048,7 @@ class ValueNode : public Node {
   bool is_dead() const { return next_use_ == kInvalidNodeId; }
 
   constexpr bool use_double_register() const {
-    return (properties().value_representation() ==
-            ValueRepresentation::kFloat64);
+    return IsDoubleRepresentation(properties().value_representation());
   }
 
   constexpr bool is_tagged() const {
@@ -1771,10 +2056,14 @@ class ValueNode : public Node {
             ValueRepresentation::kTagged);
   }
 
+#ifdef V8_COMPRESS_POINTERS
   constexpr bool decompresses_tagged_result() const {
     return TaggedResultNeedsDecompressField::decode(bitfield());
   }
+
   void SetTaggedResultNeedsDecompress() {
+    static_assert(PointerCompressionIsEnabled());
+
     DCHECK_IMPLIES(!Is<Identity>(), is_tagged());
     DCHECK_IMPLIES(Is<Identity>(), input(0).node()->is_tagged());
     set_bitfield(TaggedResultNeedsDecompressField::update(bitfield(), true));
@@ -1789,6 +2078,9 @@ class ValueNode : public Node {
       input(0).node()->SetTaggedResultNeedsDecompress();
     }
   }
+#else
+  constexpr bool decompresses_tagged_result() const { return false; }
+#endif
 
   constexpr ValueRepresentation value_representation() const {
     return properties().value_representation();
@@ -1805,6 +2097,16 @@ class ValueNode : public Node {
         return MachineRepresentation::kWord64;
       case ValueRepresentation::kFloat64:
         return MachineRepresentation::kFloat64;
+      case ValueRepresentation::kHoleyFloat64:
+        return MachineRepresentation::kFloat64;
+    }
+  }
+
+  void InitializeRegisterData() {
+    if (use_double_register()) {
+      double_registers_with_result_ = kEmptyDoubleRegList;
+    } else {
+      registers_with_result_ = kEmptyRegList;
     }
   }
 
@@ -1881,11 +2183,7 @@ class ValueNode : public Node {
         state_(kLastUse)
 #endif  // DEBUG
   {
-    if (use_double_register()) {
-      double_registers_with_result_ = kEmptyDoubleRegList;
-    } else {
-      registers_with_result_ = kEmptyRegList;
-    }
+    InitializeRegisterData();
   }
 
   int FirstRegisterCode() const {
@@ -2005,6 +2303,7 @@ class FixedInputNodeTMixin : public NodeTMixin<Base, Derived> {
     }
   }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() const {
     if constexpr (kInputCount != 0) {
       static_assert(
@@ -2018,6 +2317,7 @@ class FixedInputNodeTMixin : public NodeTMixin<Base, Derived> {
       }
     }
   }
+#endif
 
  protected:
   using InputTypes = detail::ArrayWrapper<kInputCount>;
@@ -2055,11 +2355,13 @@ class Identity : public FixedInputValueNodeT<1, Identity> {
   void VerifyInputs(MaglevGraphLabeller*) const {
     // Identity is valid for all input types.
   }
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Do not mark inputs as decompressing here, since we don't yet know whether
     // this Phi needs decompression. Instead, let
     // Node::SetTaggedResultNeedsDecompress pass through phis.
   }
+#endif
   void SetValueLocationConstraints() {}
   void GenerateCode(MaglevAssembler*, const ProcessingState&) {}
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -2277,36 +2579,53 @@ class Int32ShiftRightLogical
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-template <class Derived, Operation kOperation>
-class Int32CompareNode : public FixedInputValueNodeT<2, Derived> {
-  using Base = FixedInputValueNodeT<2, Derived>;
+class Int32Compare : public FixedInputValueNodeT<2, Int32Compare> {
+  using Base = FixedInputValueNodeT<2, Int32Compare>;
 
  public:
-  static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kInt32, ValueRepresentation::kInt32};
+  explicit Int32Compare(uint64_t bitfield, Operation operation)
+      : Base(OperationBitField::update(bitfield, operation)) {}
+
+  static constexpr Base::InputTypes kInputTypes{ValueRepresentation::kInt32,
+                                                ValueRepresentation::kInt32};
 
   static constexpr int kLeftIndex = 0;
   static constexpr int kRightIndex = 1;
   Input& left_input() { return Node::input(kLeftIndex); }
   Input& right_input() { return Node::input(kRightIndex); }
 
- protected:
-  explicit Int32CompareNode(uint64_t bitfield) : Base(bitfield) {}
+  constexpr Operation operation() const {
+    return OperationBitField::decode(bitfield());
+  }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+ private:
+  using OperationBitField = NextBitField<Operation, 5>;
 };
 
-#define DEF_INT32_COMPARE_NODE(Name) \
-  DEF_OPERATION_NODE(Int32##Name, Int32CompareNode, Name)
-DEF_INT32_COMPARE_NODE(Equal)
-DEF_INT32_COMPARE_NODE(StrictEqual)
-DEF_INT32_COMPARE_NODE(LessThan)
-DEF_INT32_COMPARE_NODE(LessThanOrEqual)
-DEF_INT32_COMPARE_NODE(GreaterThan)
-DEF_INT32_COMPARE_NODE(GreaterThanOrEqual)
-#undef DEF_INT32_COMPARE_NODE
+class Int32ToBoolean : public FixedInputValueNodeT<1, Int32ToBoolean> {
+  using Base = FixedInputValueNodeT<1, Int32ToBoolean>;
+
+ public:
+  explicit Int32ToBoolean(uint64_t bitfield, bool flip)
+      : Base(FlipBitField::update(bitfield, flip)) {}
+
+  static constexpr Base::InputTypes kInputTypes{ValueRepresentation::kInt32};
+
+  Input& value() { return Node::input(0); }
+
+  constexpr bool flip() const { return FlipBitField::decode(bitfield()); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+ private:
+  using FlipBitField = NextBitField<bool, 1>;
+};
 
 template <class Derived, Operation kOperation>
 class Float64BinaryNode : public FixedInputValueNodeT<2, Derived> {
@@ -2315,7 +2634,7 @@ class Float64BinaryNode : public FixedInputValueNodeT<2, Derived> {
  public:
   static constexpr OpProperties kProperties = OpProperties::Float64();
   static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kFloat64, ValueRepresentation::kFloat64};
+      ValueRepresentation::kHoleyFloat64, ValueRepresentation::kHoleyFloat64};
 
   static constexpr int kLeftIndex = 0;
   static constexpr int kRightIndex = 1;
@@ -2348,7 +2667,7 @@ class Float64BinaryNodeWithCall : public FixedInputValueNodeT<2, Derived> {
   static constexpr OpProperties kProperties =
       OpProperties::Float64() | OpProperties::Call();
   static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kFloat64, ValueRepresentation::kFloat64};
+      ValueRepresentation::kHoleyFloat64, ValueRepresentation::kHoleyFloat64};
 
   static constexpr int kLeftIndex = 0;
   static constexpr int kRightIndex = 1;
@@ -2369,8 +2688,8 @@ DEF_FLOAT64_BINARY_NODE(Add)
 DEF_FLOAT64_BINARY_NODE(Subtract)
 DEF_FLOAT64_BINARY_NODE(Multiply)
 DEF_FLOAT64_BINARY_NODE(Divide)
-#ifdef V8_TARGET_ARCH_ARM64
-// On Arm64, floating point modulus is implemented with a call to a C++
+#if defined(V8_TARGET_ARCH_ARM64) || defined(V8_TARGET_ARCH_ARM)
+// On Arm/Arm64, floating point modulus is implemented with a call to a C++
 // function, while on x64, it's implemented natively without call.
 DEF_FLOAT64_BINARY_NODE_WITH_CALL(Modulus)
 #else
@@ -2380,39 +2699,57 @@ DEF_FLOAT64_BINARY_NODE_WITH_CALL(Exponentiate)
 #undef DEF_FLOAT64_BINARY_NODE
 #undef DEF_FLOAT64_BINARY_NODE_WITH_CALL
 
-template <class Derived, Operation kOperation>
-class Float64CompareNode : public FixedInputValueNodeT<2, Derived> {
-  using Base = FixedInputValueNodeT<2, Derived>;
+#undef DEF_OPERATION_NODE
+#undef DEF_OPERATION_NODE_WITH_CALL
+
+class Float64Compare : public FixedInputValueNodeT<2, Float64Compare> {
+  using Base = FixedInputValueNodeT<2, Float64Compare>;
 
  public:
-  static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kFloat64, ValueRepresentation::kFloat64};
+  explicit Float64Compare(uint64_t bitfield, Operation operation)
+      : Base(OperationBitField::update(bitfield, operation)) {}
+
+  static constexpr Base::InputTypes kInputTypes{ValueRepresentation::kFloat64,
+                                                ValueRepresentation::kFloat64};
 
   static constexpr int kLeftIndex = 0;
   static constexpr int kRightIndex = 1;
   Input& left_input() { return Node::input(kLeftIndex); }
   Input& right_input() { return Node::input(kRightIndex); }
 
- protected:
-  explicit Float64CompareNode(uint64_t bitfield) : Base(bitfield) {}
+  constexpr Operation operation() const {
+    return OperationBitField::decode(bitfield());
+  }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+ private:
+  using OperationBitField = NextBitField<Operation, 5>;
 };
 
-#define DEF_FLOAT64_COMPARE_NODE(Name) \
-  DEF_OPERATION_NODE(Float64##Name, Float64CompareNode, Name)
-DEF_FLOAT64_COMPARE_NODE(Equal)
-DEF_FLOAT64_COMPARE_NODE(StrictEqual)
-DEF_FLOAT64_COMPARE_NODE(LessThan)
-DEF_FLOAT64_COMPARE_NODE(LessThanOrEqual)
-DEF_FLOAT64_COMPARE_NODE(GreaterThan)
-DEF_FLOAT64_COMPARE_NODE(GreaterThanOrEqual)
-#undef DEF_FLOAT64_COMPARE_NODE
+class Float64ToBoolean : public FixedInputValueNodeT<1, Float64ToBoolean> {
+  using Base = FixedInputValueNodeT<1, Float64ToBoolean>;
 
-#undef DEF_OPERATION_NODE
-#undef DEF_OPERATION_NODE_WITH_CALL
+ public:
+  explicit Float64ToBoolean(uint64_t bitfield, bool flip)
+      : Base(FlipBitField::update(bitfield, flip)) {}
+
+  static constexpr Base::InputTypes kInputTypes{
+      ValueRepresentation::kHoleyFloat64};
+
+  Input& value() { return Node::input(0); }
+
+  constexpr bool flip() const { return FlipBitField::decode(bitfield()); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+ private:
+  using FlipBitField = NextBitField<bool, 1>;
+};
 
 class Float64Negate : public FixedInputValueNodeT<1, Float64Negate> {
   using Base = FixedInputValueNodeT<1, Float64Negate>;
@@ -2422,7 +2759,7 @@ class Float64Negate : public FixedInputValueNodeT<1, Float64Negate> {
 
   static constexpr OpProperties kProperties = OpProperties::Float64();
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
 
   Input& input() { return Node::input(0); }
 
@@ -2443,7 +2780,7 @@ class Float64Ieee754Unary
   static constexpr OpProperties kProperties =
       OpProperties::Float64() | OpProperties::Call();
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
 
   Input& input() { return Node::input(0); }
 
@@ -2456,15 +2793,15 @@ class Float64Ieee754Unary
   ExternalReference ieee_function_;
 };
 
-class Float64SilenceNaN : public FixedInputValueNodeT<1, Float64SilenceNaN> {
-  using Base = FixedInputValueNodeT<1, Float64SilenceNaN>;
+class CheckInt32IsSmi : public FixedInputNodeT<1, CheckInt32IsSmi> {
+  using Base = FixedInputNodeT<1, CheckInt32IsSmi>;
 
  public:
-  explicit Float64SilenceNaN(uint64_t bitfield) : Base(bitfield) {}
+  explicit CheckInt32IsSmi(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Float64();
+  static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kInt32};
 
   Input& input() { return Node::input(0); }
 
@@ -2473,15 +2810,15 @@ class Float64SilenceNaN : public FixedInputValueNodeT<1, Float64SilenceNaN> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-class CheckInt32IsSmi : public FixedInputNodeT<1, CheckInt32IsSmi> {
-  using Base = FixedInputNodeT<1, CheckInt32IsSmi>;
+class CheckUint32IsSmi : public FixedInputNodeT<1, CheckUint32IsSmi> {
+  using Base = FixedInputNodeT<1, CheckUint32IsSmi>;
 
  public:
-  explicit CheckInt32IsSmi(uint64_t bitfield) : Base(bitfield) {}
+  explicit CheckUint32IsSmi(uint64_t bitfield) : Base(bitfield) {}
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kInt32};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kUint32};
 
   Input& input() { return Node::input(0); }
 
@@ -2490,15 +2827,16 @@ class CheckInt32IsSmi : public FixedInputNodeT<1, CheckInt32IsSmi> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-class CheckUint32IsSmi : public FixedInputNodeT<1, CheckUint32IsSmi> {
-  using Base = FixedInputNodeT<1, CheckUint32IsSmi>;
+class CheckHoleyFloat64IsSmi
+    : public FixedInputNodeT<1, CheckHoleyFloat64IsSmi> {
+  using Base = FixedInputNodeT<1, CheckHoleyFloat64IsSmi>;
 
  public:
-  explicit CheckUint32IsSmi(uint64_t bitfield) : Base(bitfield) {}
+  explicit CheckHoleyFloat64IsSmi(uint64_t bitfield) : Base(bitfield) {}
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kUint32};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
 
   Input& input() { return Node::input(0); }
 
@@ -2556,9 +2894,13 @@ class UnsafeSmiTag : public FixedInputValueNodeT<1, UnsafeSmiTag> {
   Input& input() { return Node::input(0); }
 
   void VerifyInputs(MaglevGraphLabeller*) const;
+
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // No tagged inputs.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -2578,9 +2920,12 @@ class CheckedSmiUntag : public FixedInputValueNodeT<1, CheckedSmiUntag> {
 
   Input& input() { return Node::input(0); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to untag.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -2599,9 +2944,12 @@ class UnsafeSmiUntag : public FixedInputValueNodeT<1, UnsafeSmiUntag> {
 
   Input& input() { return Node::input(0); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to untag.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -2627,7 +2975,7 @@ class Int32Constant : public FixedInputValueNodeT<0, Int32Constant> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
   void DoLoadToRegister(MaglevAssembler*, OutputRegister);
-  Handle<Object> DoReify(LocalIsolate* isolate);
+  Handle<Object> DoReify(LocalIsolate* isolate) const;
 
  private:
   const int32_t value_;
@@ -2655,7 +3003,7 @@ class Float64Constant : public FixedInputValueNodeT<0, Float64Constant> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
   void DoLoadToRegister(MaglevAssembler*, OutputRegister);
-  Handle<Object> DoReify(LocalIsolate* isolate);
+  Handle<Object> DoReify(LocalIsolate* isolate) const;
 
  private:
   const Float64 value_;
@@ -2706,7 +3054,7 @@ class Float64ToUint8Clamped
 
   static constexpr OpProperties kProperties = OpProperties::Int32();
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
 
   Input& input() { return Node::input(0); }
 
@@ -2740,8 +3088,9 @@ class Int32ToNumber : public FixedInputValueNodeT<1, Int32ToNumber> {
  public:
   explicit Int32ToNumber(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties =
-      OpProperties::DeferredCall() | OpProperties::ConversionNode();
+  static constexpr OpProperties kProperties = OpProperties::CanAllocate() |
+                                              OpProperties::DeferredCall() |
+                                              OpProperties::ConversionNode();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kInt32};
 
@@ -2759,8 +3108,9 @@ class Uint32ToNumber : public FixedInputValueNodeT<1, Uint32ToNumber> {
  public:
   explicit Uint32ToNumber(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties =
-      OpProperties::DeferredCall() | OpProperties::ConversionNode();
+  static constexpr OpProperties kProperties = OpProperties::CanAllocate() |
+                                              OpProperties::DeferredCall() |
+                                              OpProperties::ConversionNode();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kUint32};
 
@@ -2783,8 +3133,9 @@ class Float64ToTagged : public FixedInputValueNodeT<1, Float64ToTagged> {
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
 
-  static constexpr OpProperties kProperties =
-      OpProperties::DeferredCall() | OpProperties::ConversionNode();
+  static constexpr OpProperties kProperties = OpProperties::CanAllocate() |
+                                              OpProperties::DeferredCall() |
+                                              OpProperties::ConversionNode();
 
   Input& input() { return Node::input(0); }
 
@@ -2801,15 +3152,21 @@ class Float64ToTagged : public FixedInputValueNodeT<1, Float64ToTagged> {
   using ConversionModeBitField = NextBitField<ConversionMode, 1>;
 };
 
-class HoleyFloat64Box : public FixedInputValueNodeT<1, HoleyFloat64Box> {
-  using Base = FixedInputValueNodeT<1, HoleyFloat64Box>;
+class HoleyFloat64ToTagged
+    : public FixedInputValueNodeT<1, HoleyFloat64ToTagged> {
+  using Base = FixedInputValueNodeT<1, HoleyFloat64ToTagged>;
 
  public:
-  explicit HoleyFloat64Box(uint64_t bitfield) : Base(bitfield) {}
-
-  static constexpr OpProperties kProperties = OpProperties::DeferredCall();
+  enum class ConversionMode { kCanonicalizeSmi, kForceHeapNumber };
+  explicit HoleyFloat64ToTagged(
+      uint64_t bitfield, ConversionMode mode = ConversionMode::kCanonicalizeSmi)
+      : Base(ConversionModeBitField::update(bitfield, mode)) {}
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
+
+  static constexpr OpProperties kProperties = OpProperties::CanAllocate() |
+                                              OpProperties::DeferredCall() |
+                                              OpProperties::ConversionNode();
 
   Input& input() { return Node::input(0); }
 
@@ -2817,6 +3174,13 @@ class HoleyFloat64Box : public FixedInputValueNodeT<1, HoleyFloat64Box> {
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  bool canonicalize_smi() {
+    return ConversionModeBitField::decode(bitfield()) ==
+           ConversionMode::kCanonicalizeSmi;
+  }
+  using ConversionModeBitField = NextBitField<ConversionMode, 1>;
 };
 
 class CheckedSmiTagFloat64
@@ -2826,7 +3190,7 @@ class CheckedSmiTagFloat64
  public:
   explicit CheckedSmiTagFloat64(uint64_t bitfield) : Base(bitfield) {}
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
 
   static constexpr OpProperties kProperties =
       OpProperties::EagerDeopt() | OpProperties::ConversionNode();
@@ -2928,7 +3292,7 @@ class CheckedTruncateFloat64ToInt32
                                               OpProperties::Int32() |
                                               OpProperties::ConversionNode();
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
 
   Input& input() { return Node::input(0); }
 
@@ -2959,7 +3323,7 @@ class Float64Round : public FixedInputValueNodeT<1, Float64Round> {
 
   static constexpr OpProperties kProperties = OpProperties::Float64();
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
 
   Input& input() { return Node::input(0); }
 
@@ -2978,7 +3342,7 @@ class CheckedTruncateFloat64ToUint32
  public:
   explicit CheckedTruncateFloat64ToUint32(uint64_t bitfield) : Base(bitfield) {}
   static constexpr
-      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt() |
                                               OpProperties::Uint32() |
@@ -3010,9 +3374,10 @@ class CheckedTruncateFloat64ToUint32
   };
 
 DEFINE_TRUNCATE_NODE(TruncateUint32ToInt32, Uint32, OpProperties::Int32())
-DEFINE_TRUNCATE_NODE(TruncateFloat64ToInt32, Float64, OpProperties::Int32())
+DEFINE_TRUNCATE_NODE(TruncateFloat64ToInt32, HoleyFloat64,
+                     OpProperties::Int32())
 DEFINE_TRUNCATE_NODE(UnsafeTruncateUint32ToInt32, Uint32, OpProperties::Int32())
-DEFINE_TRUNCATE_NODE(UnsafeTruncateFloat64ToInt32, Float64,
+DEFINE_TRUNCATE_NODE(UnsafeTruncateFloat64ToInt32, HoleyFloat64,
                      OpProperties::Int32())
 
 #undef DEFINE_TRUNCATE_NODE
@@ -3078,9 +3443,49 @@ class UncheckedNumberOrOddballToFloat64
       NextBitField<TaggedToFloat64ConversionType, 1>;
 };
 
-class TruncateNumberOrOddballToInt32
-    : public FixedInputValueNodeT<1, TruncateNumberOrOddballToInt32> {
-  using Base = FixedInputValueNodeT<1, TruncateNumberOrOddballToInt32>;
+class CheckedHoleyFloat64ToFloat64
+    : public FixedInputValueNodeT<1, CheckedHoleyFloat64ToFloat64> {
+  using Base = FixedInputValueNodeT<1, CheckedHoleyFloat64ToFloat64>;
+
+ public:
+  explicit CheckedHoleyFloat64ToFloat64(uint64_t bitfield) : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties = OpProperties::EagerDeopt() |
+                                              OpProperties::Float64() |
+                                              OpProperties::ConversionNode();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
+
+  Input& input() { return Node::input(0); }
+
+  int MaxCallStackArgs() const { return 0; }
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class HoleyFloat64ToMaybeNanFloat64
+    : public FixedInputValueNodeT<1, HoleyFloat64ToMaybeNanFloat64> {
+  using Base = FixedInputValueNodeT<1, HoleyFloat64ToMaybeNanFloat64>;
+
+ public:
+  explicit HoleyFloat64ToMaybeNanFloat64(uint64_t bitfield) : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties = OpProperties::Float64();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
+
+  Input& input() { return Node::input(0); }
+
+  int MaxCallStackArgs() const { return 0; }
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class TruncateNumberOrOddballToInt32
+    : public FixedInputValueNodeT<1, TruncateNumberOrOddballToInt32> {
+  using Base = FixedInputValueNodeT<1, TruncateNumberOrOddballToInt32>;
 
  public:
   explicit TruncateNumberOrOddballToInt32(
@@ -3088,15 +3493,15 @@ class TruncateNumberOrOddballToInt32
       : Base(TaggedToFloat64ConversionTypeOffset::update(bitfield,
                                                          conversion_type)) {}
 
-  static constexpr OpProperties kProperties = OpProperties ::Int32();
+  static constexpr OpProperties kProperties = OpProperties::Int32();
   static constexpr
-      typename Base ::InputTypes kInputTypes{ValueRepresentation ::kTagged};
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
-  Input& input() { return Node ::input(0); }
+  Input& input() { return Node::input(0); }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std ::ostream&, MaglevGraphLabeller*) const;
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
   TaggedToFloat64ConversionType conversion_type() const {
     return TaggedToFloat64ConversionTypeOffset::decode(bitfield());
@@ -3160,7 +3565,7 @@ class SetPendingMessage : public FixedInputValueNodeT<1, SetPendingMessage> {
   explicit SetPendingMessage(uint64_t bitfield) : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Writing() | OpProperties::Reading();
+      OpProperties::CanWrite() | OpProperties::CanRead();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -3171,20 +3576,26 @@ class SetPendingMessage : public FixedInputValueNodeT<1, SetPendingMessage> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
+enum class CheckType { kCheckHeapObject, kOmitHeapObjectCheck };
 class ToBoolean : public FixedInputValueNodeT<1, ToBoolean> {
   using Base = FixedInputValueNodeT<1, ToBoolean>;
 
  public:
-  explicit ToBoolean(uint64_t bitfield) : Base(bitfield) {}
+  explicit ToBoolean(uint64_t bitfield, CheckType check_type)
+      : Base(CheckTypeBitField::update(bitfield, check_type)) {}
 
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
   Input& value() { return Node::input(0); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
 };
 
 class ToBooleanLogicalNot
@@ -3192,13 +3603,38 @@ class ToBooleanLogicalNot
   using Base = FixedInputValueNodeT<1, ToBooleanLogicalNot>;
 
  public:
-  explicit ToBooleanLogicalNot(uint64_t bitfield) : Base(bitfield) {}
+  explicit ToBooleanLogicalNot(uint64_t bitfield, CheckType check_type)
+      : Base(CheckTypeBitField::update(bitfield, check_type)) {}
 
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
   Input& value() { return Node::input(0); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
+};
+
+class StringEqual : public FixedInputValueNodeT<2, StringEqual> {
+  using Base = FixedInputValueNodeT<2, StringEqual>;
 
+ public:
+  explicit StringEqual(uint64_t bitfield) : Base(bitfield) {}
+  static constexpr OpProperties kProperties =
+      OpProperties::Call() | OpProperties::LazyDeopt();
+
+  static constexpr typename Base::InputTypes kInputTypes{
+      ValueRepresentation::kTagged, ValueRepresentation::kTagged};
+
+  Input& lhs() { return Node::input(0); }
+  Input& rhs() { return Node::input(1); }
+
+  int MaxCallStackArgs() const { return 0; }
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -3216,9 +3652,12 @@ class TaggedEqual : public FixedInputValueNodeT<2, TaggedEqual> {
   Input& lhs() { return Node::input(0); }
   Input& rhs() { return Node::input(1); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to compare reference equality.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -3236,9 +3675,12 @@ class TaggedNotEqual : public FixedInputValueNodeT<2, TaggedNotEqual> {
   Input& lhs() { return Node::input(0); }
   Input& rhs() { return Node::input(1); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to compare reference equality.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -3275,16 +3717,21 @@ class TestUndetectable : public FixedInputValueNodeT<1, TestUndetectable> {
   using Base = FixedInputValueNodeT<1, TestUndetectable>;
 
  public:
-  explicit TestUndetectable(uint64_t bitfield) : Base(bitfield) {}
+  explicit TestUndetectable(uint64_t bitfield, CheckType check_type)
+      : Base(CheckTypeBitField::update(bitfield, check_type)) {}
 
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
   Input& value() { return Node::input(0); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
 };
 
 class TestTypeOf : public FixedInputValueNodeT<1, TestTypeOf> {
@@ -3328,20 +3775,19 @@ class ToName : public FixedInputValueNodeT<2, ToName> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-class ToNumberOrNumeric : public FixedInputValueNodeT<2, ToNumberOrNumeric> {
-  using Base = FixedInputValueNodeT<2, ToNumberOrNumeric>;
+class ToNumberOrNumeric : public FixedInputValueNodeT<1, ToNumberOrNumeric> {
+  using Base = FixedInputValueNodeT<1, ToNumberOrNumeric>;
 
  public:
   explicit ToNumberOrNumeric(uint64_t bitfield, Object::Conversion mode)
       : Base(bitfield), mode_(mode) {}
 
-  // The implementation currently calls runtime.
-  static constexpr OpProperties kProperties = OpProperties::JSCall();
-  static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kTagged, ValueRepresentation::kTagged};
+  static constexpr OpProperties kProperties =
+      OpProperties::DeferredCall() | OpProperties::CanCallUserCode();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
-  Input& context() { return Node::input(0); }
-  Input& value_input() { return Node::input(1); }
+  Input& value_input() { return Node::input(0); }
   Object::Conversion mode() const { return mode_; }
 
   int MaxCallStackArgs() const;
@@ -3419,9 +3865,13 @@ class GeneratorStore : public NodeT<GeneratorStore> {
 
   int MaxCallStackArgs() const;
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to store.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -3431,22 +3881,29 @@ class GeneratorStore : public NodeT<GeneratorStore> {
   const int bytecode_offset_;
 };
 
-class JumpLoopPrologue : public FixedInputNodeT<0, JumpLoopPrologue> {
-  using Base = FixedInputNodeT<0, JumpLoopPrologue>;
+class TryOnStackReplacement : public FixedInputNodeT<1, TryOnStackReplacement> {
+  using Base = FixedInputNodeT<1, TryOnStackReplacement>;
 
  public:
-  explicit JumpLoopPrologue(uint64_t bitfield, int32_t loop_depth,
-                            FeedbackSlot feedback_slot,
-                            BytecodeOffset osr_offset,
-                            MaglevCompilationUnit* unit)
+  explicit TryOnStackReplacement(uint64_t bitfield, int32_t loop_depth,
+                                 FeedbackSlot feedback_slot,
+                                 BytecodeOffset osr_offset,
+                                 MaglevCompilationUnit* unit)
       : Base(bitfield),
         loop_depth_(loop_depth),
         feedback_slot_(feedback_slot),
         osr_offset_(osr_offset),
         unit_(unit) {}
 
-  static constexpr OpProperties kProperties =
-      OpProperties::DeferredCall() | OpProperties::EagerDeopt();
+  static constexpr OpProperties kProperties = OpProperties::DeferredCall() |
+                                              OpProperties::EagerDeopt() |
+                                              OpProperties::Call();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
+
+  Input& closure() { return Node::input(0); }
+
+  const MaglevCompilationUnit* unit() const { return unit_; }
 
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
@@ -3524,7 +3981,7 @@ class GetIterator : public FixedInputValueNodeT<2, GetIterator> {
 
  public:
   explicit GetIterator(uint64_t bitfield, int load_slot, int call_slot,
-                       const compiler::FeedbackVectorRef& feedback)
+                       compiler::FeedbackVectorRef feedback)
       : Base(bitfield),
         load_slot_(load_slot),
         call_slot_(call_slot),
@@ -3568,7 +4025,8 @@ class ToObject : public FixedInputValueNodeT<2, ToObject> {
   using Base = FixedInputValueNodeT<2, ToObject>;
 
  public:
-  explicit ToObject(uint64_t bitfield) : Base(bitfield) {}
+  explicit ToObject(uint64_t bitfield, CheckType check_type)
+      : Base(CheckTypeBitField::update(bitfield, check_type)) {}
 
   // The implementation currently calls runtime.
   static constexpr OpProperties kProperties = OpProperties::JSCall();
@@ -3577,18 +4035,24 @@ class ToObject : public FixedInputValueNodeT<2, ToObject> {
 
   Input& context() { return Node::input(0); }
   Input& value_input() { return Node::input(1); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
 };
 
 class ToString : public FixedInputValueNodeT<2, ToString> {
   using Base = FixedInputValueNodeT<2, ToString>;
 
  public:
-  explicit ToString(uint64_t bitfield) : Base(bitfield) {}
+  enum ConversionMode { kConvertSymbol, kThrowOnSymbol };
+  explicit ToString(uint64_t bitfield, ConversionMode mode)
+      : Base(ConversionModeBitField::update(bitfield, mode)) {}
 
   // The implementation currently calls runtime.
   static constexpr OpProperties kProperties = OpProperties::JSCall();
@@ -3597,11 +4061,36 @@ class ToString : public FixedInputValueNodeT<2, ToString> {
 
   Input& context() { return Node::input(0); }
   Input& value_input() { return Node::input(1); }
+  ConversionMode mode() const {
+    return ConversionModeBitField::decode(bitfield());
+  }
 
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  using ConversionModeBitField = NextBitField<ConversionMode, 1>;
+};
+
+class NumberToString : public FixedInputValueNodeT<1, NumberToString> {
+  using Base = FixedInputValueNodeT<1, NumberToString>;
+
+ public:
+  explicit NumberToString(uint64_t bitfield) : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties =
+      OpProperties::Call() | OpProperties::LazyDeopt();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
+
+  Input& value_input() { return Node::input(0); }
+
+  int MaxCallStackArgs() const { return 0; }
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
 class GeneratorRestoreRegister
@@ -3631,10 +4120,11 @@ class InitialValue : public FixedInputValueNodeT<0, InitialValue> {
   using Base = FixedInputValueNodeT<0, InitialValue>;
 
  public:
-  explicit InitialValue(uint64_t bitfield, interpreter::Register source)
-      : Base(bitfield), source_(source) {}
+  explicit InitialValue(uint64_t bitfield, interpreter::Register source);
 
   interpreter::Register source() const { return source_; }
+  uint32_t stack_slot() const;
+  static uint32_t stack_slot(uint32_t register_idx);
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -3667,10 +4157,10 @@ class SmiConstant : public FixedInputValueNodeT<0, SmiConstant> {
  public:
   using OutputRegister = Register;
 
-  explicit SmiConstant(uint64_t bitfield, Smi value)
+  explicit SmiConstant(uint64_t bitfield, Tagged<Smi> value)
       : Base(bitfield), value_(value) {}
 
-  Smi value() const { return value_; }
+  Tagged<Smi> value() const { return value_; }
 
   bool ToBoolean(LocalIsolate* local_isolate) const {
     return value_ != Smi::FromInt(0);
@@ -3681,10 +4171,35 @@ class SmiConstant : public FixedInputValueNodeT<0, SmiConstant> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
   void DoLoadToRegister(MaglevAssembler*, OutputRegister);
-  Handle<Object> DoReify(LocalIsolate* isolate);
+  Handle<Object> DoReify(LocalIsolate* isolate) const;
+
+ private:
+  const Tagged<Smi> value_;
+};
+
+class TaggedIndexConstant
+    : public FixedInputValueNodeT<0, TaggedIndexConstant> {
+  using Base = FixedInputValueNodeT<0, TaggedIndexConstant>;
+
+ public:
+  using OutputRegister = Register;
+
+  explicit TaggedIndexConstant(uint64_t bitfield, Tagged<TaggedIndex> value)
+      : Base(bitfield), value_(value) {}
+
+  Tagged<TaggedIndex> value() const { return value_; }
+
+  bool ToBoolean(LocalIsolate* local_isolate) const { UNREACHABLE(); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+  void DoLoadToRegister(MaglevAssembler*, OutputRegister);
+  Handle<Object> DoReify(LocalIsolate* isolate) const;
 
  private:
-  const Smi value_;
+  const Tagged<TaggedIndex> value_;
 };
 
 class ExternalConstant : public FixedInputValueNodeT<0, ExternalConstant> {
@@ -3709,7 +4224,7 @@ class ExternalConstant : public FixedInputValueNodeT<0, ExternalConstant> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
   void DoLoadToRegister(MaglevAssembler*, OutputRegister);
-  Handle<Object> DoReify(LocalIsolate* isolate);
+  Handle<Object> DoReify(LocalIsolate* isolate) const;
 
  private:
   const ExternalReference reference_;
@@ -3721,15 +4236,15 @@ class Constant : public FixedInputValueNodeT<0, Constant> {
  public:
   using OutputRegister = Register;
 
-  explicit Constant(uint64_t bitfield, const compiler::HeapObjectRef& object)
+  explicit Constant(uint64_t bitfield, compiler::HeapObjectRef object)
       : Base(bitfield), object_(object) {}
 
   bool ToBoolean(LocalIsolate* local_isolate) const {
-    return object_.object()->BooleanValue(local_isolate);
+    return Object::BooleanValue(*object_.object(), local_isolate);
   }
 
   bool IsTheHole(compiler::JSHeapBroker* broker) const {
-    return object_.IsTheHole(broker);
+    return object_.IsTheHole();
   }
 
   void SetValueLocationConstraints();
@@ -3739,9 +4254,9 @@ class Constant : public FixedInputValueNodeT<0, Constant> {
   compiler::HeapObjectRef object() { return object_; }
 
   void DoLoadToRegister(MaglevAssembler*, OutputRegister);
-  Handle<Object> DoReify(LocalIsolate* isolate);
+  Handle<Object> DoReify(LocalIsolate* isolate) const;
 
-  const compiler::HeapObjectRef& ref() const { return object_; }
+  compiler::HeapObjectRef ref() const { return object_; }
 
  private:
   const compiler::HeapObjectRef object_;
@@ -3765,42 +4280,18 @@ class RootConstant : public FixedInputValueNodeT<0, RootConstant> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
   void DoLoadToRegister(MaglevAssembler*, OutputRegister);
-  Handle<Object> DoReify(LocalIsolate* isolate);
+  Handle<Object> DoReify(LocalIsolate* isolate) const;
 
  private:
   const RootIndex index_;
 };
 
-class CreateEmptyArrayLiteral
-    : public FixedInputValueNodeT<0, CreateEmptyArrayLiteral> {
-  using Base = FixedInputValueNodeT<0, CreateEmptyArrayLiteral>;
-
- public:
-  explicit CreateEmptyArrayLiteral(uint64_t bitfield,
-                                   const compiler::FeedbackSource& feedback)
-      : Base(bitfield), feedback_(feedback) {}
-
-  compiler::FeedbackSource feedback() const { return feedback_; }
-
-  // The implementation currently calls runtime.
-  static constexpr OpProperties kProperties =
-      OpProperties::GenericRuntimeOrBuiltinCall();
-
-  int MaxCallStackArgs() const;
-  void SetValueLocationConstraints();
-  void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
-
- private:
-  const compiler::FeedbackSource feedback_;
-};
-
 class CreateArrayLiteral : public FixedInputValueNodeT<0, CreateArrayLiteral> {
   using Base = FixedInputValueNodeT<0, CreateArrayLiteral>;
 
  public:
   explicit CreateArrayLiteral(uint64_t bitfield,
-                              const compiler::HeapObjectRef& constant_elements,
+                              compiler::HeapObjectRef constant_elements,
                               const compiler::FeedbackSource& feedback,
                               int flags)
       : Base(bitfield),
@@ -3813,8 +4304,9 @@ class CreateArrayLiteral : public FixedInputValueNodeT<0, CreateArrayLiteral> {
   int flags() const { return flags_; }
 
   // The implementation currently calls runtime.
-  static constexpr OpProperties kProperties =
-      OpProperties::Call() | OpProperties::Throw() | OpProperties::LazyDeopt();
+  static constexpr OpProperties kProperties = OpProperties::Call() |
+                                              OpProperties::CanThrow() |
+                                              OpProperties::LazyDeopt();
 
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
@@ -3832,9 +4324,10 @@ class CreateShallowArrayLiteral
   using Base = FixedInputValueNodeT<0, CreateShallowArrayLiteral>;
 
  public:
-  explicit CreateShallowArrayLiteral(
-      uint64_t bitfield, const compiler::HeapObjectRef& constant_elements,
-      const compiler::FeedbackSource& feedback, int flags)
+  explicit CreateShallowArrayLiteral(uint64_t bitfield,
+                                     compiler::HeapObjectRef constant_elements,
+                                     const compiler::FeedbackSource& feedback,
+                                     int flags)
       : Base(bitfield),
         constant_elements_(constant_elements),
         feedback_(feedback),
@@ -3866,7 +4359,7 @@ class CreateObjectLiteral
  public:
   explicit CreateObjectLiteral(
       uint64_t bitfield,
-      const compiler::ObjectBoilerplateDescriptionRef& boilerplate_descriptor,
+      compiler::ObjectBoilerplateDescriptionRef boilerplate_descriptor,
       const compiler::FeedbackSource& feedback, int flags)
       : Base(bitfield),
         boilerplate_descriptor_(boilerplate_descriptor),
@@ -3880,8 +4373,9 @@ class CreateObjectLiteral
   int flags() const { return flags_; }
 
   // The implementation currently calls runtime.
-  static constexpr OpProperties kProperties =
-      OpProperties::Call() | OpProperties::Throw() | OpProperties::LazyDeopt();
+  static constexpr OpProperties kProperties = OpProperties::Call() |
+                                              OpProperties::CanThrow() |
+                                              OpProperties::LazyDeopt();
 
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
@@ -3894,27 +4388,6 @@ class CreateObjectLiteral
   const int flags_;
 };
 
-class CreateEmptyObjectLiteral
-    : public FixedInputValueNodeT<0, CreateEmptyObjectLiteral> {
-  using Base = FixedInputValueNodeT<0, CreateEmptyObjectLiteral>;
-
- public:
-  explicit CreateEmptyObjectLiteral(uint64_t bitfield, compiler::MapRef& map)
-      : Base(bitfield), map_(map) {}
-
-  static constexpr OpProperties kProperties = OpProperties::DeferredCall();
-
-  compiler::MapRef map() { return map_; }
-
-  int MaxCallStackArgs() const;
-  void SetValueLocationConstraints();
-  void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
-
- private:
-  const compiler::MapRef map_;
-};
-
 class CreateShallowObjectLiteral
     : public FixedInputValueNodeT<0, CreateShallowObjectLiteral> {
   using Base = FixedInputValueNodeT<0, CreateShallowObjectLiteral>;
@@ -3922,7 +4395,7 @@ class CreateShallowObjectLiteral
  public:
   explicit CreateShallowObjectLiteral(
       uint64_t bitfield,
-      const compiler::ObjectBoilerplateDescriptionRef& boilerplate_descriptor,
+      compiler::ObjectBoilerplateDescriptionRef boilerplate_descriptor,
       const compiler::FeedbackSource& feedback, int flags)
       : Base(bitfield),
         boilerplate_descriptor_(boilerplate_descriptor),
@@ -3960,7 +4433,8 @@ class AllocateRaw : public FixedInputValueNodeT<0, AllocateRaw> {
                        int size)
       : Base(bitfield), allocation_type_(allocation_type), size_(size) {}
 
-  static constexpr OpProperties kProperties = OpProperties::DeferredCall();
+  static constexpr OpProperties kProperties =
+      OpProperties::CanAllocate() | OpProperties::DeferredCall();
 
   int MaxCallStackArgs() const { return 0; }
   void SetValueLocationConstraints();
@@ -4060,8 +4534,9 @@ class FastCreateClosure : public FixedInputValueNodeT<1, FastCreateClosure> {
   Input& context() { return input(0); }
 
   // The implementation currently calls runtime.
-  static constexpr OpProperties kProperties =
-      OpProperties::GenericRuntimeOrBuiltinCall();
+  static constexpr OpProperties kProperties = OpProperties::Call() |
+                                              OpProperties::CanAllocate() |
+                                              OpProperties::LazyDeopt();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -4080,8 +4555,7 @@ class CreateRegExpLiteral
   using Base = FixedInputValueNodeT<0, CreateRegExpLiteral>;
 
  public:
-  explicit CreateRegExpLiteral(uint64_t bitfield,
-                               const compiler::StringRef& pattern,
+  explicit CreateRegExpLiteral(uint64_t bitfield, compiler::StringRef pattern,
                                const compiler::FeedbackSource& feedback,
                                int flags)
       : Base(bitfield), pattern_(pattern), feedback_(feedback), flags_(flags) {}
@@ -4158,6 +4632,10 @@ enum class AssertCondition {
   ASSERT_CONDITION(D)
 #undef D
 };
+static constexpr int kNumAssertConditions =
+#define D(Name) +1
+    0 ASSERT_CONDITION(D);
+#undef D
 
 inline std::ostream& operator<<(std::ostream& os, const AssertCondition cond) {
   switch (cond) {
@@ -4194,21 +4672,20 @@ class AssertInt32 : public FixedInputNodeT<2, AssertInt32> {
   AbortReason reason_;
 };
 
-enum class CheckType { kCheckHeapObject, kOmitHeapObjectCheck };
-
 class CheckMaps : public FixedInputNodeT<1, CheckMaps> {
   using Base = FixedInputNodeT<1, CheckMaps>;
 
  public:
-  explicit CheckMaps(uint64_t bitfield, const ZoneHandleSet<Map>& maps,
+  explicit CheckMaps(uint64_t bitfield, const compiler::ZoneRefSet<Map>& maps,
                      CheckType check_type)
-      : Base(bitfield), maps_(maps), check_type_(check_type) {}
+      : Base(CheckTypeBitField::update(bitfield, check_type)), maps_(maps) {}
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
-  const ZoneHandleSet<Map>& maps() const { return maps_; }
+  const compiler::ZoneRefSet<Map>& maps() const { return maps_; }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   static constexpr int kReceiverIndex = 0;
   Input& receiver_input() { return input(kReceiverIndex); }
@@ -4218,15 +4695,15 @@ class CheckMaps : public FixedInputNodeT<1, CheckMaps> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
  private:
-  const ZoneHandleSet<Map> maps_;
-  const CheckType check_type_;
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
+  const compiler::ZoneRefSet<Map> maps_;
 };
 
 class CheckValue : public FixedInputNodeT<1, CheckValue> {
   using Base = FixedInputNodeT<1, CheckValue>;
 
  public:
-  explicit CheckValue(uint64_t bitfield, const compiler::HeapObjectRef& value)
+  explicit CheckValue(uint64_t bitfield, compiler::HeapObjectRef value)
       : Base(bitfield), value_(value) {}
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
@@ -4238,9 +4715,12 @@ class CheckValue : public FixedInputNodeT<1, CheckValue> {
   static constexpr int kTargetIndex = 0;
   Input& target_input() { return input(kTargetIndex); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to compare reference equality.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
@@ -4249,17 +4729,68 @@ class CheckValue : public FixedInputNodeT<1, CheckValue> {
   const compiler::HeapObjectRef value_;
 };
 
+class CheckValueEqualsInt32 : public FixedInputNodeT<1, CheckValueEqualsInt32> {
+  using Base = FixedInputNodeT<1, CheckValueEqualsInt32>;
+
+ public:
+  explicit CheckValueEqualsInt32(uint64_t bitfield, int32_t value)
+      : Base(bitfield), value_(value) {}
+
+  static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kInt32};
+
+  int32_t value() const { return value_; }
+
+  static constexpr int kTargetIndex = 0;
+  Input& target_input() { return input(kTargetIndex); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+ private:
+  const int32_t value_;
+};
+
+class CheckValueEqualsFloat64
+    : public FixedInputNodeT<1, CheckValueEqualsFloat64> {
+  using Base = FixedInputNodeT<1, CheckValueEqualsFloat64>;
+
+ public:
+  explicit CheckValueEqualsFloat64(uint64_t bitfield, double value)
+      : Base(bitfield), value_(value) {}
+
+  static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kFloat64};
+
+  double value() const { return value_; }
+
+  static constexpr int kTargetIndex = 0;
+  Input& target_input() { return input(kTargetIndex); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+ private:
+  const double value_;
+};
+
 class CheckValueEqualsString
     : public FixedInputNodeT<1, CheckValueEqualsString> {
   using Base = FixedInputNodeT<1, CheckValueEqualsString>;
 
  public:
   explicit CheckValueEqualsString(uint64_t bitfield,
-                                  const compiler::InternalizedStringRef& value)
+                                  compiler::InternalizedStringRef value)
       : Base(bitfield), value_(value) {}
 
-  static constexpr OpProperties kProperties =
-      OpProperties::EagerDeopt() | OpProperties::DeferredCall();
+  // Can allocate if strings are flattened for comparison.
+  static constexpr OpProperties kProperties = OpProperties::CanAllocate() |
+                                              OpProperties::EagerDeopt() |
+                                              OpProperties::DeferredCall();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -4292,9 +4823,12 @@ class CheckDynamicValue : public FixedInputNodeT<2, CheckDynamicValue> {
   Input& first_input() { return input(kFirstIndex); }
   Input& second_input() { return input(kSecondIndex); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to compare reference equality.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -4313,9 +4847,14 @@ class CheckSmi : public FixedInputNodeT<1, CheckSmi> {
   static constexpr int kReceiverIndex = 0;
   Input& receiver_input() { return input(kReceiverIndex); }
 
+  using Node::set_input;
+
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to check Smi bits.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -4357,9 +4896,12 @@ class CheckHeapObject : public FixedInputNodeT<1, CheckHeapObject> {
   static constexpr int kReceiverIndex = 0;
   Input& receiver_input() { return input(kReceiverIndex); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress to check Smi bits.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
@@ -4370,7 +4912,7 @@ class CheckSymbol : public FixedInputNodeT<1, CheckSymbol> {
 
  public:
   explicit CheckSymbol(uint64_t bitfield, CheckType check_type)
-      : Base(bitfield), check_type_(check_type) {}
+      : Base(CheckTypeBitField::update(bitfield, check_type)) {}
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr
@@ -4378,13 +4920,14 @@ class CheckSymbol : public FixedInputNodeT<1, CheckSymbol> {
 
   static constexpr int kReceiverIndex = 0;
   Input& receiver_input() { return input(kReceiverIndex); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 
  private:
-  const CheckType check_type_;
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
 };
 
 class CheckInstanceType : public FixedInputNodeT<1, CheckInstanceType> {
@@ -4393,9 +4936,15 @@ class CheckInstanceType : public FixedInputNodeT<1, CheckInstanceType> {
  public:
   explicit CheckInstanceType(uint64_t bitfield, CheckType check_type,
                              InstanceType instance_type)
-      : Base(bitfield),
-        check_type_(check_type),
-        instance_type_(instance_type) {}
+      : CheckInstanceType(bitfield, check_type, instance_type, instance_type) {}
+  explicit CheckInstanceType(uint64_t bitfield, CheckType check_type,
+                             InstanceType first_instance_type,
+                             InstanceType last_instance_type)
+      : Base(CheckTypeBitField::update(bitfield, check_type)),
+        first_instance_type_(first_instance_type),
+        last_instance_type_(last_instance_type) {
+    DCHECK_LE(first_instance_type, last_instance_type);
+  }
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr
@@ -4404,15 +4953,16 @@ class CheckInstanceType : public FixedInputNodeT<1, CheckInstanceType> {
   static constexpr int kReceiverIndex = 0;
   Input& receiver_input() { return input(kReceiverIndex); }
 
-  InstanceType instance_type() const { return instance_type_; }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
  private:
-  const CheckType check_type_;
-  const InstanceType instance_type_;
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
+  const InstanceType first_instance_type_;
+  const InstanceType last_instance_type_;
 };
 
 class CheckString : public FixedInputNodeT<1, CheckString> {
@@ -4420,7 +4970,7 @@ class CheckString : public FixedInputNodeT<1, CheckString> {
 
  public:
   explicit CheckString(uint64_t bitfield, CheckType check_type)
-      : Base(bitfield), check_type_(check_type) {}
+      : Base(CheckTypeBitField::update(bitfield, check_type)) {}
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr
@@ -4428,13 +4978,14 @@ class CheckString : public FixedInputNodeT<1, CheckString> {
 
   static constexpr int kReceiverIndex = 0;
   Input& receiver_input() { return input(kReceiverIndex); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 
  private:
-  const CheckType check_type_;
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
 };
 
 class CheckMapsWithMigration
@@ -4443,20 +4994,22 @@ class CheckMapsWithMigration
 
  public:
   explicit CheckMapsWithMigration(uint64_t bitfield,
-                                  const ZoneHandleSet<Map>& maps,
+                                  const compiler::ZoneRefSet<Map>& maps,
                                   CheckType check_type)
-      : Base(bitfield), maps_(maps), check_type_(check_type) {}
+      : Base(CheckTypeBitField::update(bitfield, check_type)), maps_(maps) {}
 
-  static constexpr OpProperties kProperties = OpProperties::EagerDeopt() |
-                                              OpProperties::DeferredCall() |
-                                              OpProperties::Writing();
+  static constexpr OpProperties kProperties =
+      OpProperties::EagerDeopt() | OpProperties::DeferredCall() |
+      OpProperties::CanAllocate() | OpProperties::CanWrite() |
+      OpProperties::CanRead();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
-  const ZoneHandleSet<Map>& maps() const { return maps_; }
+  const compiler::ZoneRefSet<Map>& maps() const { return maps_; }
 
   static constexpr int kReceiverIndex = 0;
   Input& receiver_input() { return input(kReceiverIndex); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
@@ -4464,8 +5017,8 @@ class CheckMapsWithMigration
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
  private:
-  const ZoneHandleSet<Map> maps_;
-  const CheckType check_type_;
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
+  const compiler::ZoneRefSet<Map> maps_;
 };
 
 class CheckFixedArrayNonEmpty
@@ -4486,25 +5039,6 @@ class CheckFixedArrayNonEmpty
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-class CheckJSArrayBounds : public FixedInputNodeT<2, CheckJSArrayBounds> {
-  using Base = FixedInputNodeT<2, CheckJSArrayBounds>;
-
- public:
-  explicit CheckJSArrayBounds(uint64_t bitfield) : Base(bitfield) {}
-  static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
-  static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kTagged, ValueRepresentation::kInt32};
-
-  static constexpr int kReceiverIndex = 0;
-  static constexpr int kIndexIndex = 1;
-  Input& receiver_input() { return input(kReceiverIndex); }
-  Input& index_input() { return input(kIndexIndex); }
-
-  void SetValueLocationConstraints();
-  void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
-};
-
 class CheckJSDataViewBounds : public FixedInputNodeT<2, CheckJSDataViewBounds> {
   using Base = FixedInputNodeT<2, CheckJSDataViewBounds>;
 
@@ -4513,8 +5047,7 @@ class CheckJSDataViewBounds : public FixedInputNodeT<2, CheckJSDataViewBounds> {
                                  ExternalArrayType element_type)
       : Base(bitfield), element_type_(element_type) {}
 
-  static constexpr OpProperties kProperties =
-      OpProperties::EagerDeopt() | OpProperties::DeferredCall();
+  static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32};
 
@@ -4563,7 +5096,8 @@ class CheckInt32Condition : public FixedInputNodeT<2, CheckInt32Condition> {
  public:
   explicit CheckInt32Condition(uint64_t bitfield, AssertCondition condition,
                                DeoptimizeReason reason)
-      : Base(bitfield), condition_(condition), reason_(reason) {}
+      : Base(bitfield | ConditionField::encode(condition) |
+             ReasonField::encode(reason)) {}
 
   static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
   static constexpr typename Base::InputTypes kInputTypes{
@@ -4574,41 +5108,32 @@ class CheckInt32Condition : public FixedInputNodeT<2, CheckInt32Condition> {
   Input& left_input() { return input(kLeftIndex); }
   Input& right_input() { return input(kRightIndex); }
 
+  AssertCondition condition() const {
+    return ConditionField::decode(bitfield());
+  }
+  DeoptimizeReason reason() const { return ReasonField::decode(bitfield()); }
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
  private:
-  AssertCondition condition_;
-  DeoptimizeReason reason_;
+  using ConditionField =
+      NextBitField<AssertCondition, base::bits::WhichPowerOfTwo<size_t>(
+                                        base::bits::RoundUpToPowerOfTwo32(
+                                            kNumAssertConditions))>;
+  using ReasonField =
+      ConditionField::Next<DeoptimizeReason,
+                           base::bits::WhichPowerOfTwo<size_t>(
+                               base::bits::RoundUpToPowerOfTwo32(
+                                   kDeoptimizeReasonCount))>;
 };
 
-class CheckJSObjectElementsBounds
-    : public FixedInputNodeT<2, CheckJSObjectElementsBounds> {
-  using Base = FixedInputNodeT<2, CheckJSObjectElementsBounds>;
+class DebugBreak : public FixedInputNodeT<0, DebugBreak> {
+  using Base = FixedInputNodeT<0, DebugBreak>;
 
  public:
-  explicit CheckJSObjectElementsBounds(uint64_t bitfield) : Base(bitfield) {}
-
-  static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
-  static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kTagged, ValueRepresentation::kInt32};
-
-  static constexpr int kReceiverIndex = 0;
-  static constexpr int kIndexIndex = 1;
-  Input& receiver_input() { return input(kReceiverIndex); }
-  Input& index_input() { return input(kIndexIndex); }
-
-  void SetValueLocationConstraints();
-  void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
-};
-
-class DebugBreak : public FixedInputNodeT<0, DebugBreak> {
-  using Base = FixedInputNodeT<0, DebugBreak>;
-
- public:
-  explicit DebugBreak(uint64_t bitfield) : Base(bitfield) {}
+  explicit DebugBreak(uint64_t bitfield) : Base(bitfield) {}
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -4622,8 +5147,12 @@ class FunctionEntryStackCheck
  public:
   explicit FunctionEntryStackCheck(uint64_t bitfield) : Base(bitfield) {}
 
+  // Although FunctionEntryStackCheck calls a builtin, we don't mark it as Call
+  // here. The register allocator should not spill any live registers, since the
+  // builtin already handles it. The only possible live register is
+  // kJavaScriptCallNewTargetRegister.
   static constexpr OpProperties kProperties =
-      OpProperties::DeferredCall() | OpProperties::LazyDeopt();
+      OpProperties::LazyDeopt() | OpProperties::DeferredCall();
 
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
@@ -4636,9 +5165,8 @@ class CheckedInternalizedString
   using Base = FixedInputValueNodeT<1, CheckedInternalizedString>;
 
  public:
-  explicit CheckedInternalizedString(
-      uint64_t bitfield, CheckType check_type = CheckType::kCheckHeapObject)
-      : Base(bitfield), check_type_(check_type) {
+  explicit CheckedInternalizedString(uint64_t bitfield, CheckType check_type)
+      : Base(CheckTypeBitField::update(bitfield, check_type)) {
     CHECK_EQ(properties().value_representation(), ValueRepresentation::kTagged);
   }
 
@@ -4649,13 +5177,14 @@ class CheckedInternalizedString
 
   static constexpr int kObjectIndex = 0;
   Input& object_input() { return Node::input(kObjectIndex); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 
  private:
-  const CheckType check_type_;
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
 };
 
 class CheckedObjectToIndex
@@ -4663,7 +5192,8 @@ class CheckedObjectToIndex
   using Base = FixedInputValueNodeT<1, CheckedObjectToIndex>;
 
  public:
-  explicit CheckedObjectToIndex(uint64_t bitfield) : Base(bitfield) {}
+  explicit CheckedObjectToIndex(uint64_t bitfield, CheckType check_type)
+      : Base(CheckTypeBitField::update(bitfield, check_type)) {}
 
   static constexpr OpProperties kProperties =
       OpProperties::EagerDeopt() | OpProperties::Int32() |
@@ -4673,11 +5203,15 @@ class CheckedObjectToIndex
 
   static constexpr int kObjectIndex = 0;
   Input& object_input() { return Node::input(kObjectIndex); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
 
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
 };
 
 class GetTemplateObject : public FixedInputValueNodeT<1, GetTemplateObject> {
@@ -4685,8 +5219,7 @@ class GetTemplateObject : public FixedInputValueNodeT<1, GetTemplateObject> {
 
  public:
   explicit GetTemplateObject(
-      uint64_t bitfield,
-      const compiler::SharedFunctionInfoRef& shared_function_info,
+      uint64_t bitfield, compiler::SharedFunctionInfoRef shared_function_info,
       const compiler::FeedbackSource& feedback)
       : Base(bitfield),
         shared_function_info_(shared_function_info),
@@ -4715,6 +5248,35 @@ class GetTemplateObject : public FixedInputValueNodeT<1, GetTemplateObject> {
   const compiler::FeedbackSource feedback_;
 };
 
+class HasInPrototypeChain
+    : public FixedInputValueNodeT<1, HasInPrototypeChain> {
+  using Base = FixedInputValueNodeT<1, HasInPrototypeChain>;
+
+ public:
+  explicit HasInPrototypeChain(uint64_t bitfield,
+                               compiler::HeapObjectRef prototype)
+      : Base(bitfield), prototype_(prototype) {}
+
+  // The implementation can enter user code in the deferred call (due to
+  // proxied getPrototypeOf).
+  static constexpr OpProperties kProperties =
+      OpProperties::DeferredCall() | OpProperties::CanCallUserCode();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
+
+  Input& object() { return input(0); }
+
+  compiler::HeapObjectRef prototype() { return prototype_; }
+
+  int MaxCallStackArgs() const;
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+ private:
+  compiler::HeapObjectRef prototype_;
+};
+
 class BuiltinStringFromCharCode
     : public FixedInputValueNodeT<1, BuiltinStringFromCharCode> {
   using Base = FixedInputValueNodeT<1, BuiltinStringFromCharCode>;
@@ -4722,7 +5284,8 @@ class BuiltinStringFromCharCode
  public:
   explicit BuiltinStringFromCharCode(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties = OpProperties::DeferredCall();
+  static constexpr OpProperties kProperties =
+      OpProperties::CanAllocate() | OpProperties::DeferredCall();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kInt32};
 
@@ -4750,9 +5313,9 @@ class BuiltinStringPrototypeCharCodeOrCodePointAt
                                                        Mode mode)
       : Base(bitfield), mode_(mode) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Reading() |
-                                              OpProperties::DeferredCall() |
-                                              OpProperties::Int32();
+  static constexpr OpProperties kProperties =
+      OpProperties::CanAllocate() | OpProperties::CanRead() |
+      OpProperties::DeferredCall() | OpProperties::Int32();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32};
 
@@ -4885,9 +5448,9 @@ class LoadPolymorphicTaggedField
         field_representation_(field_representation),
         access_infos_(access_info) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Reading() |
-                                              OpProperties::EagerDeopt() |
-                                              OpProperties::DeferredCall();
+  static constexpr OpProperties kProperties =
+      OpProperties::CanAllocate() | OpProperties::CanRead() |
+      OpProperties::EagerDeopt() | OpProperties::DeferredCall();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -4918,7 +5481,7 @@ class LoadPolymorphicDoubleField
       uint64_t bitfield, ZoneVector<PolymorphicAccessInfo>&& access_info)
       : Base(bitfield), access_infos_(access_info) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Reading() |
+  static constexpr OpProperties kProperties = OpProperties::CanRead() |
                                               OpProperties::EagerDeopt() |
                                               OpProperties::Float64();
   static constexpr
@@ -4945,7 +5508,7 @@ class LoadTaggedField : public FixedInputValueNodeT<1, LoadTaggedField> {
   explicit LoadTaggedField(uint64_t bitfield, int offset)
       : Base(bitfield), offset_(offset) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Reading();
+  static constexpr OpProperties kProperties = OpProperties::CanRead();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -4970,7 +5533,7 @@ class LoadDoubleField : public FixedInputValueNodeT<1, LoadDoubleField> {
       : Base(bitfield), offset_(offset) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Reading() | OpProperties::Float64();
+      OpProperties::CanRead() | OpProperties::Float64();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -4994,8 +5557,9 @@ class LoadTaggedFieldByFieldIndex
  public:
   explicit LoadTaggedFieldByFieldIndex(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties =
-      OpProperties::Reading() | OpProperties::DeferredCall();
+  static constexpr OpProperties kProperties = OpProperties::CanAllocate() |
+                                              OpProperties::CanRead() |
+                                              OpProperties::DeferredCall();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kTagged};
 
@@ -5004,6 +5568,13 @@ class LoadTaggedFieldByFieldIndex
   Input& object_input() { return input(kObjectIndex); }
   Input& index_input() { return input(kIndexIndex); }
 
+#ifdef V8_COMPRESS_POINTERS
+  void MarkTaggedInputsAsDecompressing() {
+    // Only need to decompress the object, the index should be a Smi.
+    object_input().node()->SetTaggedResultNeedsDecompress();
+  }
+#endif
+
   int MaxCallStackArgs() const { return 0; }
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -5017,7 +5588,7 @@ class LoadFixedArrayElement
  public:
   explicit LoadFixedArrayElement(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Reading();
+  static constexpr OpProperties kProperties = OpProperties::CanRead();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32};
 
@@ -5038,7 +5609,8 @@ class EnsureWritableFastElements
  public:
   explicit EnsureWritableFastElements(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties = OpProperties::DeferredCall();
+  static constexpr OpProperties kProperties =
+      OpProperties::CanAllocate() | OpProperties::DeferredCall();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kTagged};
 
@@ -5053,6 +5625,42 @@ class EnsureWritableFastElements
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
+class MaybeGrowAndEnsureWritableFastElements
+    : public FixedInputValueNodeT<4, MaybeGrowAndEnsureWritableFastElements> {
+  using Base = FixedInputValueNodeT<4, MaybeGrowAndEnsureWritableFastElements>;
+
+ public:
+  explicit MaybeGrowAndEnsureWritableFastElements(uint64_t bitfield,
+                                                  ElementsKind elements_kind)
+      : Base(bitfield), elements_kind_(elements_kind) {}
+
+  static constexpr OpProperties kProperties = OpProperties::CanAllocate() |
+                                              OpProperties::DeferredCall() |
+                                              OpProperties::EagerDeopt();
+  static constexpr typename Base::InputTypes kInputTypes{
+      ValueRepresentation::kTagged, ValueRepresentation::kTagged,
+      ValueRepresentation::kInt32, ValueRepresentation::kInt32};
+
+  static constexpr int kElementsIndex = 0;
+  static constexpr int kObjectIndex = 1;
+  static constexpr int kIndexIndex = 2;
+  static constexpr int kElementsLengthIndex = 3;
+  Input& elements_input() { return input(kElementsIndex); }
+  Input& object_input() { return input(kObjectIndex); }
+  Input& index_input() { return input(kIndexIndex); }
+  Input& elements_length_input() { return input(kElementsLengthIndex); }
+
+  ElementsKind elements_kind() const { return elements_kind_; }
+
+  int MaxCallStackArgs() const { return 0; }
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  const ElementsKind elements_kind_;
+};
+
 class StoreFixedArrayElementWithWriteBarrier
     : public FixedInputNodeT<3, StoreFixedArrayElementWithWriteBarrier> {
   using Base = FixedInputNodeT<3, StoreFixedArrayElementWithWriteBarrier>;
@@ -5062,7 +5670,7 @@ class StoreFixedArrayElementWithWriteBarrier
       : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Writing() | OpProperties::DeferredCall();
+      OpProperties::CanWrite() | OpProperties::DeferredCall();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32,
       ValueRepresentation::kTagged};
@@ -5095,7 +5703,7 @@ class StoreFixedArrayElementNoWriteBarrier
       : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Writing() | OpProperties::DeferredCall();
+      OpProperties::CanWrite() | OpProperties::DeferredCall();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32,
       ValueRepresentation::kTagged};
@@ -5116,58 +5724,64 @@ class StoreFixedArrayElementNoWriteBarrier
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-// CheckedStoreFixedArraySmiElement doesn't do any Deferred Calls, but
-// PhiRepresentationSelector could turn this node into a
-// StoreFixedArrayElementNoWriteBarrier, which needs the register snapshot (see
-// the comment before the definition of kProperties in
-// StoreFixedArrayElementNoWriteBarrier).
-// TODO(dmercadier): when CheckedStoreFixedArraySmiElement is transformed into a
-// StoreFixedArrayElementNoWriteBarrier, the later can never be transformed in
-// turn into a StoreFixedArrayElementWithWriteBarrier, so the register snapshot
-// is not actually needed. We should introduce a
-// StoreFixedArrayElementNoWriteBarrier node without register snapshot for such
-// cases, in order to avoid the DeferredCall property in
-// CheckedStoreFixedArraySmiElement.
-class CheckedStoreFixedArraySmiElement
-    : public FixedInputNodeT<3, CheckedStoreFixedArraySmiElement> {
-  using Base = FixedInputNodeT<3, CheckedStoreFixedArraySmiElement>;
-
- public:
-  explicit CheckedStoreFixedArraySmiElement(uint64_t bitfield)
-      : Base(bitfield) {}
+class LoadFixedDoubleArrayElement
+    : public FixedInputValueNodeT<2, LoadFixedDoubleArrayElement> {
+  using Base = FixedInputValueNodeT<2, LoadFixedDoubleArrayElement>;
 
-  static constexpr OpProperties kProperties = OpProperties::Writing() |
-                                              OpProperties::EagerDeopt() |
-                                              OpProperties::DeferredCall();
+ public:
+  explicit LoadFixedDoubleArrayElement(uint64_t bitfield) : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties =
+      OpProperties::CanRead() | OpProperties::Float64();
   static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kTagged, ValueRepresentation::kInt32,
-      ValueRepresentation::kTagged};
+      ValueRepresentation::kTagged, ValueRepresentation::kInt32};
 
   static constexpr int kElementsIndex = 0;
   static constexpr int kIndexIndex = 1;
-  static constexpr int kValueIndex = 2;
   Input& elements_input() { return input(kElementsIndex); }
   Input& index_input() { return input(kIndexIndex); }
-  Input& value_input() { return input(kValueIndex); }
 
-  int MaxCallStackArgs() const {
-    // CheckedStoreFixedArraySmiElement never really does any call.
-    return 0;
-  }
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-class LoadFixedDoubleArrayElement
-    : public FixedInputValueNodeT<2, LoadFixedDoubleArrayElement> {
-  using Base = FixedInputValueNodeT<2, LoadFixedDoubleArrayElement>;
+class LoadHoleyFixedDoubleArrayElement
+    : public FixedInputValueNodeT<2, LoadHoleyFixedDoubleArrayElement> {
+  using Base = FixedInputValueNodeT<2, LoadHoleyFixedDoubleArrayElement>;
 
  public:
-  explicit LoadFixedDoubleArrayElement(uint64_t bitfield) : Base(bitfield) {}
+  explicit LoadHoleyFixedDoubleArrayElement(uint64_t bitfield)
+      : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Reading() | OpProperties::Float64();
+      OpProperties::CanRead() | OpProperties::HoleyFloat64();
+  static constexpr typename Base::InputTypes kInputTypes{
+      ValueRepresentation::kTagged, ValueRepresentation::kInt32};
+
+  static constexpr int kElementsIndex = 0;
+  static constexpr int kIndexIndex = 1;
+  Input& elements_input() { return input(kElementsIndex); }
+  Input& index_input() { return input(kIndexIndex); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class LoadHoleyFixedDoubleArrayElementCheckedNotHole
+    : public FixedInputValueNodeT<
+          2, LoadHoleyFixedDoubleArrayElementCheckedNotHole> {
+  using Base =
+      FixedInputValueNodeT<2, LoadHoleyFixedDoubleArrayElementCheckedNotHole>;
+
+ public:
+  explicit LoadHoleyFixedDoubleArrayElementCheckedNotHole(uint64_t bitfield)
+      : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties = OpProperties::CanRead() |
+                                              OpProperties::Float64() |
+                                              OpProperties::EagerDeopt();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32};
 
@@ -5188,10 +5802,10 @@ class StoreFixedDoubleArrayElement
  public:
   explicit StoreFixedDoubleArrayElement(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Writing();
+  static constexpr OpProperties kProperties = OpProperties::CanWrite();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32,
-      ValueRepresentation::kFloat64};
+      ValueRepresentation::kHoleyFloat64};
 
   static constexpr int kElementsIndex = 0;
   static constexpr int kIndexIndex = 1;
@@ -5219,7 +5833,7 @@ class LoadSignedIntDataViewElement
   }
 
   static constexpr OpProperties kProperties =
-      OpProperties::Reading() | OpProperties::Int32();
+      OpProperties::CanRead() | OpProperties::Int32();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32,
       ValueRepresentation::kTagged};
@@ -5254,7 +5868,7 @@ class LoadDoubleDataViewElement
   }
 
   static constexpr OpProperties kProperties =
-      OpProperties::Reading() | OpProperties::Float64();
+      OpProperties::CanRead() | OpProperties::Float64();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32,
       ValueRepresentation::kTagged};
@@ -5287,7 +5901,7 @@ class LoadDoubleDataViewElement
     }                                                                  \
                                                                        \
     static constexpr OpProperties kProperties =                        \
-        OpProperties::Reading() | properties;                          \
+        OpProperties::CanRead() | properties;                          \
     static constexpr typename Base::InputTypes kInputTypes{            \
         ValueRepresentation::kTagged, ValueRepresentation::kUint32};   \
                                                                        \
@@ -5371,21 +5985,21 @@ LOAD_TYPED_ARRAY(LoadDoubleTypedArrayElementNoDeopt, OpProperties::Float64(),
 // while the deopting versions have a runtime check that triggers a deopt if the
 // buffer is detached.
 STORE_TYPED_ARRAY(StoreIntTypedArrayElement,
-                  OpProperties::EagerDeopt() | OpProperties::Writing(),
+                  OpProperties::EagerDeopt() | OpProperties::CanWrite(),
                   ValueRepresentation::kInt32, INT8_ELEMENTS, INT16_ELEMENTS,
                   INT32_ELEMENTS, UINT8_ELEMENTS, UINT8_CLAMPED_ELEMENTS,
                   UINT16_ELEMENTS, UINT16_ELEMENTS, UINT32_ELEMENTS)
-STORE_TYPED_ARRAY(StoreIntTypedArrayElementNoDeopt, OpProperties::Writing(),
+STORE_TYPED_ARRAY(StoreIntTypedArrayElementNoDeopt, OpProperties::CanWrite(),
                   ValueRepresentation::kInt32, INT8_ELEMENTS, INT16_ELEMENTS,
                   INT32_ELEMENTS, UINT8_ELEMENTS, UINT8_CLAMPED_ELEMENTS,
                   UINT16_ELEMENTS, UINT16_ELEMENTS, UINT32_ELEMENTS)
 
 STORE_TYPED_ARRAY(StoreDoubleTypedArrayElement,
-                  OpProperties::EagerDeopt() | OpProperties::Writing(),
-                  ValueRepresentation::kFloat64, FLOAT32_ELEMENTS,
+                  OpProperties::EagerDeopt() | OpProperties::CanWrite(),
+                  ValueRepresentation::kHoleyFloat64, FLOAT32_ELEMENTS,
                   FLOAT64_ELEMENTS)
-STORE_TYPED_ARRAY(StoreDoubleTypedArrayElementNoDeopt, OpProperties::Writing(),
-                  ValueRepresentation::kFloat64, FLOAT32_ELEMENTS,
+STORE_TYPED_ARRAY(StoreDoubleTypedArrayElementNoDeopt, OpProperties::CanWrite(),
+                  ValueRepresentation::kHoleyFloat64, FLOAT32_ELEMENTS,
                   FLOAT64_ELEMENTS)
 #undef STORE_TYPED_ARRAY
 
@@ -5402,7 +6016,7 @@ class StoreSignedIntDataViewElement
            type == ExternalArrayType::kExternalInt32Array);
   }
 
-  static constexpr OpProperties kProperties = OpProperties::Writing();
+  static constexpr OpProperties kProperties = OpProperties::CanWrite();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32,
       ValueRepresentation::kInt32, ValueRepresentation::kTagged};
@@ -5438,10 +6052,10 @@ class StoreDoubleDataViewElement
     DCHECK_EQ(type, ExternalArrayType::kExternalFloat64Array);
   }
 
-  static constexpr OpProperties kProperties = OpProperties::Writing();
+  static constexpr OpProperties kProperties = OpProperties::CanWrite();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32,
-      ValueRepresentation::kFloat64, ValueRepresentation::kTagged};
+      ValueRepresentation::kHoleyFloat64, ValueRepresentation::kTagged};
 
   static constexpr int kObjectIndex = 0;
   static constexpr int kIndexIndex = 1;
@@ -5468,7 +6082,7 @@ class StoreDoubleField : public FixedInputNodeT<2, StoreDoubleField> {
   explicit StoreDoubleField(uint64_t bitfield, int offset)
       : Base(bitfield), offset_(offset) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Writing();
+  static constexpr OpProperties kProperties = OpProperties::CanWrite();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kFloat64};
 
@@ -5494,7 +6108,7 @@ class StoreFloat64 : public FixedInputNodeT<2, StoreFloat64> {
   explicit StoreFloat64(uint64_t bitfield, int offset)
       : Base(bitfield), offset_(offset) {}
 
-  static constexpr OpProperties kProperties = OpProperties::Writing();
+  static constexpr OpProperties kProperties = OpProperties::CanWrite();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kFloat64};
 
@@ -5513,49 +6127,6 @@ class StoreFloat64 : public FixedInputNodeT<2, StoreFloat64> {
   const int offset_;
 };
 
-class CheckedStoreSmiField : public FixedInputNodeT<2, CheckedStoreSmiField> {
-  using Base = FixedInputNodeT<2, CheckedStoreSmiField>;
-
- public:
-  explicit CheckedStoreSmiField(uint64_t bitfield, int offset)
-      : Base(bitfield), offset_(offset) {}
-
-  // CheckedStoreSmiField doesn't do any Deferred Calls, but
-  // PhiRepresentationSelector could turn this node into a
-  // StoreTaggedFieldNoWriteBarrier, which needs the register snapshot (see the
-  // comment before the definition of kProperties in
-  // StoreTaggedFieldNoWriteBarrier).
-  // TODO(dmercadier): when CheckedStoreSmiField is transformed into a
-  // StoreTaggedFieldNoWriteBarrier, the later can never be transformed in turn
-  // into a StoreTaggedFieldWithWriteBarrier, so the register snapshot is not
-  // actually needed. We should introduce a StoreTaggedField node without
-  // register snapshot for such cases, in order to avoid the DeferredCall
-  // property in CheckedStoreSmiField.
-  static constexpr OpProperties kProperties = OpProperties::Writing() |
-                                              OpProperties::EagerDeopt() |
-                                              OpProperties::DeferredCall();
-  static constexpr typename Base::InputTypes kInputTypes{
-      ValueRepresentation::kTagged, ValueRepresentation::kTagged};
-
-  int offset() const { return offset_; }
-
-  static constexpr int kObjectIndex = 0;
-  static constexpr int kValueIndex = 1;
-  Input& object_input() { return input(kObjectIndex); }
-  Input& value_input() { return input(kValueIndex); }
-
-  int MaxCallStackArgs() const {
-    // CheckedStoreSmiField never really does any call.
-    return 0;
-  }
-  void SetValueLocationConstraints();
-  void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
-
- private:
-  const int offset_;
-};
-
 class StoreTaggedFieldNoWriteBarrier
     : public FixedInputNodeT<2, StoreTaggedFieldNoWriteBarrier> {
   using Base = FixedInputNodeT<2, StoreTaggedFieldNoWriteBarrier>;
@@ -5571,7 +6142,7 @@ class StoreTaggedFieldNoWriteBarrier
   // StoreTaggedFieldNoWriteBarrier so that it's allocated with enough space for
   // the register snapshot.
   static constexpr OpProperties kProperties =
-      OpProperties::Writing() | OpProperties::DeferredCall();
+      OpProperties::CanWrite() | OpProperties::DeferredCall();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kTagged};
 
@@ -5582,10 +6153,13 @@ class StoreTaggedFieldNoWriteBarrier
   Input& object_input() { return input(kObjectIndex); }
   Input& value_input() { return input(kValueIndex); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     object_input().node()->SetTaggedResultNeedsDecompress();
     // Don't need to decompress value to store it.
   }
+#endif
+
   int MaxCallStackArgs() const {
     // StoreTaggedFieldNoWriteBarrier never really does any call.
     return 0;
@@ -5606,7 +6180,7 @@ class StoreMap : public FixedInputNodeT<1, StoreMap> {
       : Base(bitfield), map_(map) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Writing() | OpProperties::DeferredCall();
+      OpProperties::CanWrite() | OpProperties::DeferredCall();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -5631,7 +6205,7 @@ class StoreTaggedFieldWithWriteBarrier
       : Base(bitfield), offset_(offset) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Writing() | OpProperties::DeferredCall();
+      OpProperties::CanWrite() | OpProperties::DeferredCall();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kTagged};
 
@@ -5642,10 +6216,13 @@ class StoreTaggedFieldWithWriteBarrier
   Input& object_input() { return input(kObjectIndex); }
   Input& value_input() { return input(kValueIndex); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     object_input().node()->SetTaggedResultNeedsDecompress();
     // Don't need to decompress value to store it.
   }
+#endif
+
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -5659,7 +6236,7 @@ class LoadGlobal : public FixedInputValueNodeT<1, LoadGlobal> {
   using Base = FixedInputValueNodeT<1, LoadGlobal>;
 
  public:
-  explicit LoadGlobal(uint64_t bitfield, const compiler::NameRef& name,
+  explicit LoadGlobal(uint64_t bitfield, compiler::NameRef name,
                       const compiler::FeedbackSource& feedback,
                       TypeofMode typeof_mode)
       : Base(bitfield),
@@ -5672,7 +6249,7 @@ class LoadGlobal : public FixedInputValueNodeT<1, LoadGlobal> {
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
-  const compiler::NameRef& name() const { return name_; }
+  compiler::NameRef name() const { return name_; }
   compiler::FeedbackSource feedback() const { return feedback_; }
   TypeofMode typeof_mode() const { return typeof_mode_; }
 
@@ -5693,7 +6270,7 @@ class StoreGlobal : public FixedInputValueNodeT<2, StoreGlobal> {
   using Base = FixedInputValueNodeT<2, StoreGlobal>;
 
  public:
-  explicit StoreGlobal(uint64_t bitfield, const compiler::NameRef& name,
+  explicit StoreGlobal(uint64_t bitfield, compiler::NameRef name,
                        const compiler::FeedbackSource& feedback)
       : Base(bitfield), name_(name), feedback_(feedback) {}
 
@@ -5702,7 +6279,7 @@ class StoreGlobal : public FixedInputValueNodeT<2, StoreGlobal> {
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kTagged};
 
-  const compiler::NameRef& name() const { return name_; }
+  compiler::NameRef name() const { return name_; }
   compiler::FeedbackSource feedback() const { return feedback_; }
 
   Input& context() { return input(0); }
@@ -5718,11 +6295,34 @@ class StoreGlobal : public FixedInputValueNodeT<2, StoreGlobal> {
   const compiler::FeedbackSource feedback_;
 };
 
+class UpdateJSArrayLength : public FixedInputNodeT<3, UpdateJSArrayLength> {
+  using Base = FixedInputNodeT<3, UpdateJSArrayLength>;
+
+ public:
+  explicit UpdateJSArrayLength(uint64_t bitfield) : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties = OpProperties::CanWrite();
+  static constexpr typename Base::InputTypes kInputTypes{
+      ValueRepresentation::kTagged, ValueRepresentation::kInt32,
+      ValueRepresentation::kInt32};
+
+  static constexpr int kObjectIndex = 0;
+  static constexpr int kIndexIndex = 1;
+  static constexpr int kLengthIndex = 2;
+  Input& object_input() { return input(kObjectIndex); }
+  Input& index_input() { return input(kIndexIndex); }
+  Input& length_input() { return input(kLengthIndex); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
 class LoadNamedGeneric : public FixedInputValueNodeT<2, LoadNamedGeneric> {
   using Base = FixedInputValueNodeT<2, LoadNamedGeneric>;
 
  public:
-  explicit LoadNamedGeneric(uint64_t bitfield, const compiler::NameRef& name,
+  explicit LoadNamedGeneric(uint64_t bitfield, compiler::NameRef name,
                             const compiler::FeedbackSource& feedback)
       : Base(bitfield), name_(name), feedback_(feedback) {}
 
@@ -5754,8 +6354,7 @@ class LoadNamedFromSuperGeneric
   using Base = FixedInputValueNodeT<3, LoadNamedFromSuperGeneric>;
 
  public:
-  explicit LoadNamedFromSuperGeneric(uint64_t bitfield,
-                                     const compiler::NameRef& name,
+  explicit LoadNamedFromSuperGeneric(uint64_t bitfield, compiler::NameRef name,
                                      const compiler::FeedbackSource& feedback)
       : Base(bitfield), name_(name), feedback_(feedback) {}
 
@@ -5789,7 +6388,7 @@ class SetNamedGeneric : public FixedInputValueNodeT<3, SetNamedGeneric> {
   using Base = FixedInputValueNodeT<3, SetNamedGeneric>;
 
  public:
-  explicit SetNamedGeneric(uint64_t bitfield, const compiler::NameRef& name,
+  explicit SetNamedGeneric(uint64_t bitfield, compiler::NameRef name,
                            const compiler::FeedbackSource& feedback)
       : Base(bitfield), name_(name), feedback_(feedback) {}
 
@@ -5827,7 +6426,7 @@ class LoadEnumCacheLength
   explicit LoadEnumCacheLength(uint64_t bitfield) : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Reading() | OpProperties::Int32();
+      OpProperties::CanRead() | OpProperties::Int32();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -5845,8 +6444,9 @@ class StringAt : public FixedInputValueNodeT<2, StringAt> {
  public:
   explicit StringAt(uint64_t bitfield) : Base(bitfield) {}
 
-  static constexpr OpProperties kProperties =
-      OpProperties::Reading() | OpProperties::DeferredCall();
+  static constexpr OpProperties kProperties = OpProperties::CanRead() |
+                                              OpProperties::CanAllocate() |
+                                              OpProperties::DeferredCall();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kInt32};
 
@@ -5868,7 +6468,7 @@ class StringLength : public FixedInputValueNodeT<1, StringLength> {
   explicit StringLength(uint64_t bitfield) : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Reading() | OpProperties::Int32();
+      OpProperties::CanRead() | OpProperties::Int32();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -5881,13 +6481,33 @@ class StringLength : public FixedInputValueNodeT<1, StringLength> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
+class StringConcat : public FixedInputValueNodeT<2, StringConcat> {
+  using Base = FixedInputValueNodeT<2, StringConcat>;
+
+ public:
+  explicit StringConcat(uint64_t bitfield) : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties = OpProperties::Call() |
+                                              OpProperties::LazyDeopt() |
+                                              OpProperties::CanThrow();
+  static constexpr typename Base::InputTypes kInputTypes{
+      ValueRepresentation::kTagged, ValueRepresentation::kTagged};
+
+  Input& lhs() { return Node::input(0); }
+  Input& rhs() { return Node::input(1); }
+
+  int MaxCallStackArgs() const { return 0; }
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
 class DefineNamedOwnGeneric
     : public FixedInputValueNodeT<3, DefineNamedOwnGeneric> {
   using Base = FixedInputValueNodeT<3, DefineNamedOwnGeneric>;
 
  public:
-  explicit DefineNamedOwnGeneric(uint64_t bitfield,
-                                 const compiler::NameRef& name,
+  explicit DefineNamedOwnGeneric(uint64_t bitfield, compiler::NameRef name,
                                  const compiler::FeedbackSource& feedback)
       : Base(bitfield), name_(name), feedback_(feedback) {}
 
@@ -6099,6 +6719,42 @@ class ConstantGapMove : public FixedInputNodeT<0, ConstantGapMove> {
 
 class MergePointInterpreterFrameState;
 
+// ValueRepresentation doesn't distinguish between Int32 and TruncatedInt32:
+// both are Int32. For Phi untagging however, it's interesting to have a
+// difference between the 2, as a TruncatedInt32 would allow untagging to
+// Float64, whereas a Int32 use wouldn't (because it would require a deopting
+// Float64->Int32 conversion, whereas the truncating version of this conversion
+// cannot deopt). We thus use a UseRepresentation to record use hints for Phis.
+enum class UseRepresentation : uint8_t {
+  kTagged,
+  kInt32,
+  kTruncatedInt32,
+  kUint32,
+  kFloat64,
+  kHoleyFloat64,
+};
+
+inline std::ostream& operator<<(std::ostream& os,
+                                const UseRepresentation& repr) {
+  switch (repr) {
+    case UseRepresentation::kTagged:
+      return os << "Tagged";
+    case UseRepresentation::kInt32:
+      return os << "Int32";
+    case UseRepresentation::kTruncatedInt32:
+      return os << "TruncatedInt32";
+    case UseRepresentation::kUint32:
+      return os << "Uint32";
+    case UseRepresentation::kFloat64:
+      return os << "Float64";
+    case UseRepresentation::kHoleyFloat64:
+      return os << "HoleyFloat64";
+  }
+}
+
+typedef base::EnumSet<ValueRepresentation, int8_t> ValueRepresentationSet;
+typedef base::EnumSet<UseRepresentation, int8_t> UseRepresentationSet;
+
 // TODO(verwaest): It may make more sense to buffer phis in merged_states until
 // we set up the interpreter frame state for code generation. At that point we
 // can generate correctly-sized phis.
@@ -6111,7 +6767,11 @@ class Phi : public ValueNodeT<Phi> {
   // TODO(jgruber): More intuitive constructors, if possible.
   Phi(uint64_t bitfield, MergePointInterpreterFrameState* merge_state,
       interpreter::Register owner)
-      : Base(bitfield), owner_(owner), merge_state_(merge_state) {
+      : Base(bitfield),
+        owner_(owner),
+        merge_state_(merge_state),
+        type_(NodeType::kUnknown),
+        post_loop_type_(NodeType::kUnknown) {
     DCHECK_NOT_NULL(merge_state);
   }
 
@@ -6124,25 +6784,106 @@ class Phi : public ValueNodeT<Phi> {
   using Node::set_input;
 
   bool is_exception_phi() const { return input_count() == 0; }
+  bool is_loop_phi() const;
+
+  bool is_backedge_offset(int i) const {
+    return is_loop_phi() && i == input_count() - 1;
+  }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Do not mark inputs as decompressing here, since we don't yet know whether
     // this Phi needs decompression. Instead, let
     // Node::SetTaggedResultNeedsDecompress pass through phis.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
   BasicBlock* predecessor_at(int i);
 
+  void RecordUseReprHint(UseRepresentation repr, int current_offset) {
+    RecordUseReprHint(UseRepresentationSet{repr}, current_offset);
+  }
+
+  void RecordUseReprHint(UseRepresentationSet repr_mask, int current_offset);
+
+  UseRepresentationSet get_uses_repr_hints() { return uses_repr_hint_; }
+  UseRepresentationSet get_same_loop_uses_repr_hints() {
+    return same_loop_uses_repr_hint_;
+  }
+
+  void merge_post_loop_type(NodeType type) {
+    DCHECK(!has_key_);
+    post_loop_type_ = IntersectType(post_loop_type_, type);
+  }
+  void set_post_loop_type(NodeType type) {
+    DCHECK(!has_key_);
+    post_loop_type_ = type;
+  }
+  void promote_post_loop_type() {
+    DCHECK(!has_key_);
+    type_ = post_loop_type_;
+  }
+
+  void merge_type(NodeType type) {
+    DCHECK(!has_key_);
+    type_ = IntersectType(type_, type);
+  }
+  void set_type(NodeType type) {
+    DCHECK(!has_key_);
+    type_ = type;
+  }
+  NodeType type() const {
+    DCHECK(!has_key_);
+    return type_;
+  }
+
+  using Key = compiler::turboshaft::SnapshotTable<ValueNode*>::Key;
+  bool has_key() const { return has_key_; }
+  Key key() const {
+    DCHECK(has_key_);
+    return key_;
+  }
+  void set_key(Key key) {
+    has_key_ = true;
+    key_ = key;
+  }
+
  private:
   Phi** next() { return &next_; }
 
   const interpreter::Register owner_;
+  bool has_key_ = false;  // True if the {key_} field has been initialized.
+  UseRepresentationSet uses_repr_hint_ = {};
+  UseRepresentationSet same_loop_uses_repr_hint_ = {};
+
   Phi* next_ = nullptr;
   MergePointInterpreterFrameState* const merge_state_;
+
+  union {
+    struct {
+      // The type of this Phi based on its predecessors' types.
+      NodeType type_;
+      // {type_} for loop Phis should always be Unknown until their backedge has
+      // been bound (because we don't know what will be the type of the
+      // backedge). However, once the backedge is bound, we might be able to
+      // refine it. {post_loop_type_} is thus used to keep track of loop Phi
+      // types: for loop Phis, we update {post_loop_type_} when we merge
+      // predecessors, but keep {type_} as Unknown. Once the backedge is bound,
+      // we set {type_} as {post_loop_type_}.
+      NodeType post_loop_type_;
+    };
+    // After graph building, {type_} and {post_loop_type_} are not used anymore,
+    // so we reuse this memory to store the SnapshotTable Key for this Phi for
+    // phi untagging.
+    Key key_;
+  };
+
   friend base::ThreadedListTraits<Phi>;
 };
 
@@ -6158,18 +6899,13 @@ class Call : public ValueNodeT<Call> {
 
   // We need enough inputs to have these fixed inputs plus the maximum arguments
   // to a function call.
-  static_assert(kMaxInputs >=
-                kFixedInputCount + InstructionStream::kMaxArguments);
+  static_assert(kMaxInputs >= kFixedInputCount + Code::kMaxArguments);
 
   // This ctor is used when for variable input counts.
   // Inputs must be initialized manually.
   Call(uint64_t bitfield, ConvertReceiverMode mode, TargetType target_type,
-       const compiler::FeedbackSource& feedback, ValueNode* function,
-       ValueNode* context)
-      : Base(bitfield),
-        receiver_mode_(mode),
-        target_type_(target_type),
-        feedback_(feedback) {
+       ValueNode* function, ValueNode* context)
+      : Base(bitfield), receiver_mode_(mode), target_type_(target_type) {
     set_input(kFunctionIndex, function);
     set_input(kContextIndex, context);
   }
@@ -6188,10 +6924,10 @@ class Call : public ValueNodeT<Call> {
   auto args_begin() { return std::make_reverse_iterator(&arg(-1)); }
   auto args_end() { return std::make_reverse_iterator(&arg(num_args() - 1)); }
 
-  compiler::FeedbackSource feedback() const { return feedback_; }
-
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -6200,7 +6936,6 @@ class Call : public ValueNodeT<Call> {
  private:
   ConvertReceiverMode receiver_mode_;
   TargetType target_type_;
-  const compiler::FeedbackSource feedback_;
 };
 
 class Construct : public ValueNodeT<Construct> {
@@ -6215,8 +6950,7 @@ class Construct : public ValueNodeT<Construct> {
 
   // We need enough inputs to have these fixed inputs plus the maximum arguments
   // to a function call.
-  static_assert(kMaxInputs >=
-                kFixedInputCount + InstructionStream::kMaxArguments);
+  static_assert(kMaxInputs >= kFixedInputCount + Code::kMaxArguments);
 
   // This ctor is used when for variable input counts.
   // Inputs must be initialized manually.
@@ -6247,7 +6981,9 @@ class Construct : public ValueNodeT<Construct> {
   compiler::FeedbackSource feedback() const { return feedback_; }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -6342,7 +7078,9 @@ class CallBuiltin : public ValueNodeT<CallBuiltin> {
   }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -6394,7 +7132,9 @@ class CallRuntime : public ValueNodeT<CallRuntime> {
   }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -6415,9 +7155,8 @@ class CallWithSpread : public ValueNodeT<CallWithSpread> {
 
   // This ctor is used when for variable input counts.
   // Inputs must be initialized manually.
-  CallWithSpread(uint64_t bitfield, compiler::FeedbackSource feedback,
-                 ValueNode* function, ValueNode* context)
-      : Base(bitfield), feedback_(feedback) {
+  CallWithSpread(uint64_t bitfield, ValueNode* function, ValueNode* context)
+      : Base(bitfield) {
     set_input(kFunctionIndex, function);
     set_input(kContextIndex, context);
   }
@@ -6446,17 +7185,15 @@ class CallWithSpread : public ValueNodeT<CallWithSpread> {
     return input(input_count() - 1);
   }
   Input& receiver() { return arg(0); }
-  compiler::FeedbackSource feedback() const { return feedback_; }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
-
- private:
-  const compiler::FeedbackSource feedback_;
 };
 
 class CallWithArrayLike : public FixedInputValueNodeT<4, CallWithArrayLike> {
@@ -6481,7 +7218,9 @@ class CallWithArrayLike : public FixedInputValueNodeT<4, CallWithArrayLike> {
   Input& context() { return input(kContextIndex); }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -6492,31 +7231,43 @@ class CallSelf : public ValueNodeT<CallSelf> {
   using Base = ValueNodeT<CallSelf>;
 
  public:
-  // We assume function and context as fixed inputs.
-  static constexpr int kReceiverIndex = 0;
-  static constexpr int kFixedInputCount = 1;
+  static constexpr int kClosureIndex = 0;
+  static constexpr int kContextIndex = 1;
+  static constexpr int kReceiverIndex = 2;
+  static constexpr int kNewTargetIndex = 3;
+  static constexpr int kFixedInputCount = 4;
 
   // We need enough inputs to have these fixed inputs plus the maximum arguments
   // to a function call.
-  static_assert(kMaxInputs >=
-                kFixedInputCount + InstructionStream::kMaxArguments);
+  static_assert(kMaxInputs >= kFixedInputCount + Code::kMaxArguments);
 
   // This ctor is used when for variable input counts.
   // Inputs must be initialized manually.
-  CallSelf(uint64_t bitfield, compiler::JSHeapBroker* broker,
-           const compiler::JSFunctionRef function, ValueNode* receiver)
+  CallSelf(uint64_t bitfield,
+           compiler::SharedFunctionInfoRef shared_function_info,
+           ValueNode* closure, ValueNode* context, ValueNode* receiver,
+           ValueNode* new_target)
       : Base(bitfield),
-        function_(function),
+        shared_function_info_(shared_function_info),
         expected_parameter_count_(
-            function.shared(broker)
+            shared_function_info
                 .internal_formal_parameter_count_with_receiver()) {
+    set_input(kClosureIndex, closure);
+    set_input(kContextIndex, context);
     set_input(kReceiverIndex, receiver);
+    set_input(kNewTargetIndex, new_target);
   }
 
   static constexpr OpProperties kProperties = OpProperties::JSCall();
 
+  Input& closure() { return input(kClosureIndex); }
+  const Input& closure() const { return input(kClosureIndex); }
+  Input& context() { return input(kContextIndex); }
+  const Input& context() const { return input(kContextIndex); }
   Input& receiver() { return input(kReceiverIndex); }
   const Input& receiver() const { return input(kReceiverIndex); }
+  Input& new_target() { return input(kNewTargetIndex); }
+  const Input& new_target() const { return input(kNewTargetIndex); }
   int num_args() const { return input_count() - kFixedInputCount; }
   Input& arg(int i) { return input(i + kFixedInputCount); }
   void set_arg(int i, ValueNode* node) {
@@ -6525,20 +7276,21 @@ class CallSelf : public ValueNodeT<CallSelf> {
   auto args_begin() { return std::make_reverse_iterator(&arg(-1)); }
   auto args_end() { return std::make_reverse_iterator(&arg(num_args() - 1)); }
 
-  compiler::SharedFunctionInfoRef shared_function_info(
-      compiler::JSHeapBroker* broker) const {
-    return function_.shared(broker);
+  compiler::SharedFunctionInfoRef shared_function_info() const {
+    return shared_function_info_;
   }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
  private:
-  const compiler::JSFunctionRef function_;
+  const compiler::SharedFunctionInfoRef shared_function_info_;
   // Cache the expected parameter count so that we can access it in
   // MaxCallStackArgs without needing to unpark the local isolate.
   int expected_parameter_count_;
@@ -6548,32 +7300,43 @@ class CallKnownJSFunction : public ValueNodeT<CallKnownJSFunction> {
   using Base = ValueNodeT<CallKnownJSFunction>;
 
  public:
-  // We assume function and context as fixed inputs.
-  static constexpr int kReceiverIndex = 0;
-  static constexpr int kFixedInputCount = 1;
+  static constexpr int kClosureIndex = 0;
+  static constexpr int kContextIndex = 1;
+  static constexpr int kReceiverIndex = 2;
+  static constexpr int kNewTargetIndex = 3;
+  static constexpr int kFixedInputCount = 4;
 
   // We need enough inputs to have these fixed inputs plus the maximum arguments
   // to a function call.
-  static_assert(kMaxInputs >=
-                kFixedInputCount + InstructionStream::kMaxArguments);
+  static_assert(kMaxInputs >= kFixedInputCount + Code::kMaxArguments);
 
   // This ctor is used when for variable input counts.
   // Inputs must be initialized manually.
-  CallKnownJSFunction(uint64_t bitfield, compiler::JSHeapBroker* broker,
-                      const compiler::JSFunctionRef function,
-                      ValueNode* receiver)
+  CallKnownJSFunction(uint64_t bitfield,
+                      compiler::SharedFunctionInfoRef shared_function_info,
+                      ValueNode* closure, ValueNode* context,
+                      ValueNode* receiver, ValueNode* new_target)
       : Base(bitfield),
-        function_(function),
+        shared_function_info_(shared_function_info),
         expected_parameter_count_(
-            function.shared(broker)
+            shared_function_info
                 .internal_formal_parameter_count_with_receiver()) {
+    set_input(kClosureIndex, closure);
+    set_input(kContextIndex, context);
     set_input(kReceiverIndex, receiver);
+    set_input(kNewTargetIndex, new_target);
   }
 
   static constexpr OpProperties kProperties = OpProperties::JSCall();
 
+  Input& closure() { return input(kClosureIndex); }
+  const Input& closure() const { return input(kClosureIndex); }
+  Input& context() { return input(kContextIndex); }
+  const Input& context() const { return input(kContextIndex); }
   Input& receiver() { return input(kReceiverIndex); }
   const Input& receiver() const { return input(kReceiverIndex); }
+  Input& new_target() { return input(kNewTargetIndex); }
+  const Input& new_target() const { return input(kNewTargetIndex); }
   int num_args() const { return input_count() - kFixedInputCount; }
   Input& arg(int i) { return input(i + kFixedInputCount); }
   void set_arg(int i, ValueNode* node) {
@@ -6582,25 +7345,107 @@ class CallKnownJSFunction : public ValueNodeT<CallKnownJSFunction> {
   auto args_begin() { return std::make_reverse_iterator(&arg(-1)); }
   auto args_end() { return std::make_reverse_iterator(&arg(num_args() - 1)); }
 
-  compiler::SharedFunctionInfoRef shared_function_info(
-      compiler::JSHeapBroker* broker) const {
-    return function_.shared(broker);
+  compiler::SharedFunctionInfoRef shared_function_info() const {
+    return shared_function_info_;
   }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
 
  private:
-  const compiler::JSFunctionRef function_;
+  const compiler::SharedFunctionInfoRef shared_function_info_;
   // Cache the expected parameter count so that we can access it in
   // MaxCallStackArgs without needing to unpark the local isolate.
   int expected_parameter_count_;
 };
 
+class CallKnownApiFunction : public ValueNodeT<CallKnownApiFunction> {
+  using Base = ValueNodeT<CallKnownApiFunction>;
+
+ public:
+  enum Mode {
+    // Use Builtin::kCallApiCallbackOptimizedNoProfiling.
+    kNoProfiling,
+    // Use Builtin::kCallApiCallbackOptimized.
+    kGeneric,
+  };
+
+  static constexpr int kContextIndex = 0;
+  static constexpr int kReceiverIndex = 1;
+  static constexpr int kFixedInputCount = 2;
+
+  // We need enough inputs to have these fixed inputs plus the maximum arguments
+  // to a function call.
+  static_assert(kMaxInputs >= kFixedInputCount + Code::kMaxArguments);
+
+  // This ctor is used when for variable input counts.
+  // Inputs must be initialized manually.
+  CallKnownApiFunction(uint64_t bitfield, Mode mode,
+                       compiler::FunctionTemplateInfoRef function_template_info,
+                       compiler::CallHandlerInfoRef call_handler_info,
+                       compiler::ObjectRef data,
+                       compiler::OptionalJSObjectRef api_holder,
+                       ValueNode* context, ValueNode* receiver)
+      : Base(bitfield | ModeField::encode(mode)),
+        function_template_info_(function_template_info),
+        call_handler_info_(call_handler_info),
+        data_(data),
+        api_holder_(api_holder) {
+    set_input(kContextIndex, context);
+    set_input(kReceiverIndex, receiver);
+  }
+
+  // TODO(ishell): introduce JSApiCall() which will take C++ ABI into account
+  // when deciding which registers to splill.
+  static constexpr OpProperties kProperties = OpProperties::JSCall();
+
+  // Input& closure() { return input(kClosureIndex); }
+  // const Input& closure() const { return input(kClosureIndex); }
+  Input& context() { return input(kContextIndex); }
+  const Input& context() const { return input(kContextIndex); }
+  Input& receiver() { return input(kReceiverIndex); }
+  const Input& receiver() const { return input(kReceiverIndex); }
+  int num_args() const { return input_count() - kFixedInputCount; }
+  Input& arg(int i) { return input(i + kFixedInputCount); }
+  void set_arg(int i, ValueNode* node) {
+    set_input(i + kFixedInputCount, node);
+  }
+  auto args_begin() { return std::make_reverse_iterator(&arg(-1)); }
+  auto args_end() { return std::make_reverse_iterator(&arg(num_args() - 1)); }
+
+  Mode mode() const { return ModeField::decode(bitfield()); }
+
+  compiler::FunctionTemplateInfoRef function_template_info() const {
+    return function_template_info_;
+  }
+  compiler::CallHandlerInfoRef call_handler_info() const {
+    return call_handler_info_;
+  }
+  compiler::ObjectRef data() const { return data_; }
+  void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
+  void MarkTaggedInputsAsDecompressing();
+#endif
+  int MaxCallStackArgs() const;
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
+
+ private:
+  using ModeField = NextBitField<Mode, 1>;
+
+  const compiler::FunctionTemplateInfoRef function_template_info_;
+  const compiler::CallHandlerInfoRef call_handler_info_;
+  const compiler::ObjectRef data_;
+  const compiler::OptionalJSObjectRef api_holder_;
+};
+
 class ConstructWithSpread : public ValueNodeT<ConstructWithSpread> {
   using Base = ValueNodeT<ConstructWithSpread>;
 
@@ -6650,7 +7495,9 @@ class ConstructWithSpread : public ValueNodeT<ConstructWithSpread> {
   compiler::FeedbackSource feedback() const { return feedback_; }
 
   void VerifyInputs(MaglevGraphLabeller* graph_labeller) const;
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing();
+#endif
   int MaxCallStackArgs() const;
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
@@ -6665,9 +7512,9 @@ class ConvertReceiver : public FixedInputValueNodeT<1, ConvertReceiver> {
 
  public:
   explicit ConvertReceiver(uint64_t bitfield,
-                           const compiler::JSFunctionRef target,
+                           compiler::NativeContextRef native_context,
                            ConvertReceiverMode mode)
-      : Base(bitfield), target_(target), mode_(mode) {}
+      : Base(bitfield), native_context_(native_context), mode_(mode) {}
 
   Input& receiver_input() { return input(0); }
 
@@ -6682,10 +7529,68 @@ class ConvertReceiver : public FixedInputValueNodeT<1, ConvertReceiver> {
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 
  private:
-  const compiler::JSFunctionRef target_;
+  const compiler::NativeContextRef native_context_;
   ConvertReceiverMode mode_;
 };
 
+class CheckConstructResult
+    : public FixedInputValueNodeT<2, CheckConstructResult> {
+  using Base = FixedInputValueNodeT<2, CheckConstructResult>;
+
+ public:
+  explicit CheckConstructResult(uint64_t bitfield) : Base(bitfield) {}
+
+  Input& construct_result_input() { return input(0); }
+  Input& implicit_receiver_input() { return input(1); }
+
+  static constexpr typename Base::InputTypes kInputTypes{
+      ValueRepresentation::kTagged, ValueRepresentation::kTagged};
+
+  int MaxCallStackArgs() const;
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class CheckDerivedConstructResult
+    : public FixedInputValueNodeT<1, CheckDerivedConstructResult> {
+  using Base = FixedInputValueNodeT<1, CheckDerivedConstructResult>;
+
+ public:
+  explicit CheckDerivedConstructResult(uint64_t bitfield) : Base(bitfield) {}
+
+  Input& construct_result_input() { return input(0); }
+
+  static constexpr OpProperties kProperties =
+      OpProperties::CanThrow() | OpProperties::DeferredCall();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
+
+  bool for_derived_constructor();
+
+  int MaxCallStackArgs() const;
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class CheckNotHole : public FixedInputValueNodeT<1, CheckNotHole> {
+  using Base = FixedInputValueNodeT<1, CheckNotHole>;
+
+ public:
+  explicit CheckNotHole(uint64_t bitfield) : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties = OpProperties::EagerDeopt();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
+
+  Input& object_input() { return input(0); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
 class ConvertHoleToUndefined
     : public FixedInputValueNodeT<1, ConvertHoleToUndefined> {
   using Base = FixedInputValueNodeT<1, ConvertHoleToUndefined>;
@@ -6703,24 +7608,20 @@ class ConvertHoleToUndefined
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-class IncreaseInterruptBudget
-    : public FixedInputNodeT<0, IncreaseInterruptBudget> {
-  using Base = FixedInputNodeT<0, IncreaseInterruptBudget>;
+class HandleNoHeapWritesInterrupt
+    : public FixedInputNodeT<0, HandleNoHeapWritesInterrupt> {
+  using Base = FixedInputNodeT<0, HandleNoHeapWritesInterrupt>;
 
  public:
-  explicit IncreaseInterruptBudget(uint64_t bitfield, int amount)
-      : Base(bitfield), amount_(amount) {
-    DCHECK_GT(amount, 0);
-  }
+  explicit HandleNoHeapWritesInterrupt(uint64_t bitfield) : Base(bitfield) {}
 
-  int amount() const { return amount_; }
+  static constexpr OpProperties kProperties =
+      OpProperties::DeferredCall() | OpProperties::LazyDeopt();
 
-  void SetValueLocationConstraints();
+  void SetValueLocationConstraints() {}
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
-
- private:
-  const int amount_;
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+  int MaxCallStackArgs() const { return 0; }
 };
 
 class ReduceInterruptBudgetForLoop
@@ -6775,16 +7676,15 @@ class ThrowReferenceErrorIfHole
   using Base = FixedInputNodeT<1, ThrowReferenceErrorIfHole>;
 
  public:
-  explicit ThrowReferenceErrorIfHole(uint64_t bitfield,
-                                     const compiler::NameRef& name)
+  explicit ThrowReferenceErrorIfHole(uint64_t bitfield, compiler::NameRef name)
       : Base(bitfield), name_(name) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Throw() | OpProperties::DeferredCall();
+      OpProperties::CanThrow() | OpProperties::DeferredCall();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
-  const compiler::NameRef& name() const { return name_; }
+  compiler::NameRef name() const { return name_; }
 
   Input& value() { return Node::input(0); }
 
@@ -6805,7 +7705,7 @@ class ThrowSuperNotCalledIfHole
   explicit ThrowSuperNotCalledIfHole(uint64_t bitfield) : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Throw() | OpProperties::DeferredCall();
+      OpProperties::CanThrow() | OpProperties::DeferredCall();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -6826,7 +7726,26 @@ class ThrowSuperAlreadyCalledIfNotHole
       : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Throw() | OpProperties::DeferredCall();
+      OpProperties::CanThrow() | OpProperties::DeferredCall();
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
+
+  Input& value() { return Node::input(0); }
+
+  int MaxCallStackArgs() const;
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class ThrowIfNotCallable : public FixedInputNodeT<1, ThrowIfNotCallable> {
+  using Base = FixedInputNodeT<1, ThrowIfNotCallable>;
+
+ public:
+  explicit ThrowIfNotCallable(uint64_t bitfield) : Base(bitfield) {}
+
+  static constexpr OpProperties kProperties =
+      OpProperties::CanThrow() | OpProperties::DeferredCall();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
@@ -6846,7 +7765,7 @@ class ThrowIfNotSuperConstructor
   explicit ThrowIfNotSuperConstructor(uint64_t bitfield) : Base(bitfield) {}
 
   static constexpr OpProperties kProperties =
-      OpProperties::Throw() | OpProperties::DeferredCall();
+      OpProperties::CanThrow() | OpProperties::DeferredCall();
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kTagged};
 
@@ -6859,25 +7778,28 @@ class ThrowIfNotSuperConstructor
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
-class TransitionElementsKind
-    : public FixedInputNodeT<1, TransitionElementsKind> {
-  using Base = FixedInputNodeT<1, TransitionElementsKind>;
+class TransitionElementsKindOrCheckMap
+    : public FixedInputNodeT<1, TransitionElementsKindOrCheckMap> {
+  using Base = FixedInputNodeT<1, TransitionElementsKindOrCheckMap>;
 
  public:
-  explicit TransitionElementsKind(
+  explicit TransitionElementsKindOrCheckMap(
       uint64_t bitfield,
       base::Vector<const compiler::MapRef> transition_sources,
-      compiler::MapRef transition_target)
-      : Base(bitfield),
+      compiler::MapRef transition_target, CheckType check_type)
+      : Base(CheckTypeBitField::update(bitfield, check_type)),
         transition_sources_(transition_sources),
         transition_target_(transition_target) {}
 
   // TODO(leszeks): Special case the case where all transitions are fast.
-  static constexpr OpProperties kProperties =
-      OpProperties::DeferredCall() | OpProperties::Writing();
+  static constexpr OpProperties kProperties = OpProperties::AnySideEffects() |
+                                              OpProperties::DeferredCall() |
+                                              OpProperties::EagerDeopt();
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
+
   Input& object_input() { return Node::input(0); }
 
   int MaxCallStackArgs() const;
@@ -6886,6 +7808,8 @@ class TransitionElementsKind
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 
  private:
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
+
   const base::Vector<const compiler::MapRef> transition_sources_;
   const compiler::MapRef transition_target_;
 };
@@ -6956,14 +7880,10 @@ class ConditionalControlNode : public ControlNode {
 class BranchControlNode : public ConditionalControlNode {
  public:
   BranchControlNode(uint64_t bitfield, BasicBlockRef* if_true_refs,
-                    int true_correction, BasicBlockRef* if_false_refs,
-                    int false_correction)
+                    BasicBlockRef* if_false_refs)
       : ConditionalControlNode(bitfield),
         if_true_(if_true_refs),
-        if_false_(if_false_refs) {
-    if_true_.set_interrupt_budget_correction(true_correction);
-    if_false_.set_interrupt_budget_correction(false_correction);
-  }
+        if_false_(if_false_refs) {}
 
   BasicBlock* if_true() const { return if_true_.block_ptr(); }
   BasicBlock* if_false() const { return if_false_.block_ptr(); }
@@ -6996,12 +7916,9 @@ class BranchControlNodeT
 
  protected:
   explicit BranchControlNodeT(uint64_t bitfield, BasicBlockRef* if_true_refs,
-                              int true_interrupt_correction,
-                              BasicBlockRef* if_false_refs,
-                              int false_interrupt_correction)
+                              BasicBlockRef* if_false_refs)
       : FixedInputNodeTMixin<InputCount, BranchControlNode, Derived>(
-            bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-            false_interrupt_correction) {}
+            bitfield, if_true_refs, if_false_refs) {}
 };
 
 class Jump : public UnconditionalControlNodeT<Jump> {
@@ -7039,36 +7956,6 @@ class JumpLoop : public UnconditionalControlNodeT<JumpLoop> {
   base::Vector<Input> used_node_locations_;
 };
 
-class JumpToInlined : public UnconditionalControlNodeT<JumpToInlined> {
-  using Base = UnconditionalControlNodeT<JumpToInlined>;
-
- public:
-  explicit JumpToInlined(uint64_t bitfield, BasicBlockRef* target_refs,
-                         MaglevCompilationUnit* unit)
-      : Base(bitfield, target_refs), unit_(unit) {}
-
-  void SetValueLocationConstraints();
-  void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
-
-  const MaglevCompilationUnit* unit() const { return unit_; }
-
- private:
-  MaglevCompilationUnit* const unit_;
-};
-
-class JumpFromInlined : public UnconditionalControlNodeT<JumpFromInlined> {
-  using Base = UnconditionalControlNodeT<JumpFromInlined>;
-
- public:
-  explicit JumpFromInlined(uint64_t bitfield, BasicBlockRef* target_refs)
-      : Base(bitfield, target_refs) {}
-
-  void SetValueLocationConstraints();
-  void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
-};
-
 class Abort : public TeminalControlNodeT<0, Abort> {
   using Base = TeminalControlNodeT<0, Abort>;
 
@@ -7181,14 +8068,10 @@ class BranchIfRootConstant
   using Base = BranchControlNodeT<1, BranchIfRootConstant>;
 
  public:
-  explicit BranchIfRootConstant(uint64_t bitfield, BasicBlockRef* if_true_refs,
-                                int true_interrupt_correction,
-                                BasicBlockRef* if_false_refs,
-                                int false_interrupt_correction,
-                                RootIndex root_index)
-      : Base(bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-             false_interrupt_correction),
-        root_index_(root_index) {}
+  explicit BranchIfRootConstant(uint64_t bitfield, RootIndex root_index,
+                                BasicBlockRef* if_true_refs,
+                                BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs), root_index_(root_index) {}
 
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
@@ -7196,9 +8079,12 @@ class BranchIfRootConstant
   RootIndex root_index() { return root_index_; }
   Input& condition_input() { return input(0); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress values to reference compare.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
@@ -7214,23 +8100,48 @@ class BranchIfUndefinedOrNull
  public:
   explicit BranchIfUndefinedOrNull(uint64_t bitfield,
                                    BasicBlockRef* if_true_refs,
-                                   int true_interrupt_correction,
-                                   BasicBlockRef* if_false_refs,
-                                   int false_interrupt_correction)
-      : Base(bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-             false_interrupt_correction) {}
+                                   BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs) {}
 
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
   Input& condition_input() { return input(0); }
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress values to reference compare.
   }
+#endif
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class BranchIfUndetectable
+    : public BranchControlNodeT<1, BranchIfUndetectable> {
+  using Base = BranchControlNodeT<1, BranchIfUndetectable>;
+
+ public:
+  explicit BranchIfUndetectable(uint64_t bitfield, CheckType check_type,
+                                BasicBlockRef* if_true_refs,
+                                BasicBlockRef* if_false_refs)
+      : Base(CheckTypeBitField::update(bitfield, check_type), if_true_refs,
+             if_false_refs) {}
+
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
+
+  Input& condition_input() { return input(0); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
   void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
 };
 
 class BranchIfJSReceiver : public BranchControlNodeT<1, BranchIfJSReceiver> {
@@ -7238,11 +8149,8 @@ class BranchIfJSReceiver : public BranchControlNodeT<1, BranchIfJSReceiver> {
 
  public:
   explicit BranchIfJSReceiver(uint64_t bitfield, BasicBlockRef* if_true_refs,
-                              int true_interrupt_correction,
-                              BasicBlockRef* if_false_refs,
-                              int false_interrupt_correction)
-      : Base(bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-             false_interrupt_correction) {}
+                              BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs) {}
 
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
@@ -7259,16 +8167,78 @@ class BranchIfToBooleanTrue
   using Base = BranchControlNodeT<1, BranchIfToBooleanTrue>;
 
  public:
-  explicit BranchIfToBooleanTrue(uint64_t bitfield, BasicBlockRef* if_true_refs,
-                                 int true_interrupt_correction,
-                                 BasicBlockRef* if_false_refs,
-                                 int false_interrupt_correction)
-      : Base(bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-             false_interrupt_correction) {}
+  explicit BranchIfToBooleanTrue(uint64_t bitfield, CheckType check_type,
+                                 BasicBlockRef* if_true_refs,
+                                 BasicBlockRef* if_false_refs)
+      : Base(CheckTypeBitField::update(bitfield, check_type), if_true_refs,
+             if_false_refs) {}
 
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
 
+  Input& condition_input() { return input(0); }
+  CheckType check_type() const { return CheckTypeBitField::decode(bitfield()); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+
+ private:
+  using CheckTypeBitField = NextBitField<CheckType, 1>;
+};
+
+class BranchIfInt32ToBooleanTrue
+    : public BranchControlNodeT<1, BranchIfInt32ToBooleanTrue> {
+  using Base = BranchControlNodeT<1, BranchIfInt32ToBooleanTrue>;
+
+ public:
+  explicit BranchIfInt32ToBooleanTrue(uint64_t bitfield,
+                                      BasicBlockRef* if_true_refs,
+                                      BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs) {}
+
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kInt32};
+
+  Input& condition_input() { return input(0); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class BranchIfFloat64ToBooleanTrue
+    : public BranchControlNodeT<1, BranchIfFloat64ToBooleanTrue> {
+  using Base = BranchControlNodeT<1, BranchIfFloat64ToBooleanTrue>;
+
+ public:
+  explicit BranchIfFloat64ToBooleanTrue(uint64_t bitfield,
+                                        BasicBlockRef* if_true_refs,
+                                        BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs) {}
+
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
+
+  Input& condition_input() { return input(0); }
+
+  void SetValueLocationConstraints();
+  void GenerateCode(MaglevAssembler*, const ProcessingState&);
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
+};
+
+class BranchIfFloat64IsHole
+    : public BranchControlNodeT<1, BranchIfFloat64IsHole> {
+  using Base = BranchControlNodeT<1, BranchIfFloat64IsHole>;
+
+ public:
+  explicit BranchIfFloat64IsHole(uint64_t bitfield, BasicBlockRef* if_true_refs,
+                                 BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs) {}
+
+  static constexpr
+      typename Base::InputTypes kInputTypes{ValueRepresentation::kHoleyFloat64};
+
   Input& condition_input() { return input(0); }
 
   void SetValueLocationConstraints();
@@ -7288,12 +8258,8 @@ class BranchIfInt32Compare
 
   explicit BranchIfInt32Compare(uint64_t bitfield, Operation operation,
                                 BasicBlockRef* if_true_refs,
-                                int true_interrupt_correction,
-                                BasicBlockRef* if_false_refs,
-                                int false_interrupt_correction)
-      : Base(bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-             false_interrupt_correction),
-        operation_(operation) {}
+                                BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs), operation_(operation) {}
 
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kInt32, ValueRepresentation::kInt32};
@@ -7316,17 +8282,10 @@ class BranchIfFloat64Compare
   Input& left_input() { return NodeBase::input(kLeftIndex); }
   Input& right_input() { return NodeBase::input(kRightIndex); }
 
-  enum class JumpModeIfNaN { kJumpToFalse, kJumpToTrue };
-
-  explicit BranchIfFloat64Compare(
-      uint64_t bitfield, Operation operation, BasicBlockRef* if_true_refs,
-      int true_interrupt_correction, BasicBlockRef* if_false_refs,
-      int false_interrupt_correction,
-      JumpModeIfNaN jump_mode_if_nan = JumpModeIfNaN::kJumpToFalse)
-      : Base(bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-             false_interrupt_correction),
-        operation_(operation),
-        jump_mode_if_nan_(jump_mode_if_nan) {}
+  explicit BranchIfFloat64Compare(uint64_t bitfield, Operation operation,
+                                  BasicBlockRef* if_true_refs,
+                                  BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs), operation_(operation) {}
 
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kFloat64, ValueRepresentation::kFloat64};
@@ -7337,12 +8296,11 @@ class BranchIfFloat64Compare
 
  private:
   Operation operation_;
-  JumpModeIfNaN jump_mode_if_nan_;
 };
 
-class BranchIfReferenceCompare
-    : public BranchControlNodeT<2, BranchIfReferenceCompare> {
-  using Base = BranchControlNodeT<2, BranchIfReferenceCompare>;
+class BranchIfReferenceEqual
+    : public BranchControlNodeT<2, BranchIfReferenceEqual> {
+  using Base = BranchControlNodeT<2, BranchIfReferenceEqual>;
 
  public:
   static constexpr int kLeftIndex = 0;
@@ -7350,27 +8308,23 @@ class BranchIfReferenceCompare
   Input& left_input() { return NodeBase::input(kLeftIndex); }
   Input& right_input() { return NodeBase::input(kRightIndex); }
 
-  explicit BranchIfReferenceCompare(uint64_t bitfield, Operation operation,
-                                    BasicBlockRef* if_true_refs,
-                                    int true_interrupt_correction,
-                                    BasicBlockRef* if_false_refs,
-                                    int false_interrupt_correction)
-      : Base(bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-             false_interrupt_correction),
-        operation_(operation) {}
+  explicit BranchIfReferenceEqual(uint64_t bitfield,
+                                  BasicBlockRef* if_true_refs,
+                                  BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs) {}
 
   static constexpr typename Base::InputTypes kInputTypes{
       ValueRepresentation::kTagged, ValueRepresentation::kTagged};
 
+#ifdef V8_COMPRESS_POINTERS
   void MarkTaggedInputsAsDecompressing() {
     // Don't need to decompress values to reference compare.
   }
+#endif
+
   void SetValueLocationConstraints();
   void GenerateCode(MaglevAssembler*, const ProcessingState&);
-  void PrintParams(std::ostream&, MaglevGraphLabeller*) const;
-
- private:
-  Operation operation_;
+  void PrintParams(std::ostream&, MaglevGraphLabeller*) const {}
 };
 
 class BranchIfTypeOf : public BranchControlNodeT<1, BranchIfTypeOf> {
@@ -7383,12 +8337,8 @@ class BranchIfTypeOf : public BranchControlNodeT<1, BranchIfTypeOf> {
   explicit BranchIfTypeOf(uint64_t bitfield,
                           interpreter::TestTypeOfFlags::LiteralFlag literal,
                           BasicBlockRef* if_true_refs,
-                          int true_interrupt_correction,
-                          BasicBlockRef* if_false_refs,
-                          int false_interrupt_correction)
-      : Base(bitfield, if_true_refs, true_interrupt_correction, if_false_refs,
-             false_interrupt_correction),
-        literal_(literal) {}
+                          BasicBlockRef* if_false_refs)
+      : Base(bitfield, if_true_refs, if_false_refs), literal_(literal) {}
 
   static constexpr
       typename Base::InputTypes kInputTypes{ValueRepresentation::kTagged};
diff --git a/deps/v8/src/maglev/maglev-phi-representation-selector.cc b/deps/v8/src/maglev/maglev-phi-representation-selector.cc
index 67966ed7bfe2bb..38839dcd0aeeac 100644
--- a/deps/v8/src/maglev/maglev-phi-representation-selector.cc
+++ b/deps/v8/src/maglev/maglev-phi-representation-selector.cc
@@ -4,6 +4,8 @@
 
 #include "src/maglev/maglev-phi-representation-selector.h"
 
+#include "src/base/enum-set.h"
+#include "src/flags/flags.h"
 #include "src/handles/handles-inl.h"
 #include "src/maglev/maglev-graph-processor.h"
 #include "src/maglev/maglev-ir-inl.h"
@@ -13,66 +15,201 @@ namespace v8 {
 namespace internal {
 namespace maglev {
 
-namespace {
+#define TRACE_UNTAGGING(...)                      \
+  do {                                            \
+    if (v8_flags.trace_maglev_phi_untagging) {    \
+      StdoutStream{} << __VA_ARGS__ << std::endl; \
+    }                                             \
+  } while (false)
 
-constexpr int representation_mask_for(ValueRepresentation r) {
-  if (r == ValueRepresentation::kTagged) return 0;
-  return 1 << static_cast<int>(r);
-}
+ProcessResult MaglevPhiRepresentationSelector::Process(Phi* node,
+                                                       const ProcessingState&) {
+  DCHECK_EQ(node->value_representation(), ValueRepresentation::kTagged);
 
-}  // namespace
+  if (node->is_exception_phi()) {
+    // Exception phis have no inputs (or, at least, none accessible through
+    // `node->input(...)`), so we don't know if the inputs could be untagged or
+    // not, so we just keep those Phis tagged.
+    return ProcessResult::kContinue;
+  }
 
-void MaglevPhiRepresentationSelector::Process(Phi* node,
-                                              const ProcessingState&) {
-  DCHECK_EQ(node->value_representation(), ValueRepresentation::kTagged);
+  TRACE_UNTAGGING(
+      "Considering for untagging: " << PrintNodeLabel(graph_labeller(), node));
 
-  // We negate the Uint32 from {representation_mask} from the start in order to
-  // disable Uint32 untagged Phis for now, because they don't seem very useful,
-  // and this simplifies things a little bit.
-  // TODO(dmercadier): evaluate what benefits untagged Uint32 Phis would bring,
-  // and consider allowing them.
-  unsigned int representation_mask =
-      ~representation_mask_for(ValueRepresentation::kUint32);
+  // {input_mask} represents the ValueRepresentation that {node} could have,
+  // based on the ValueRepresentation of its inputs.
+  ValueRepresentationSet input_reprs;
 
   for (int i = 0; i < node->input_count(); i++) {
-    Node* input = node->input(i).node();
+    ValueNode* input = node->input(i).node();
     if (input->Is<SmiConstant>()) {
-      // Could be any representation
+      // Could be any representation. We treat such inputs as Int32, since we
+      // later allow ourselves to promote Int32 to Float64 if needed (but we
+      // never downgrade Float64 to Int32, as it could cause deopt loops).
+      input_reprs.Add(ValueRepresentation::kInt32);
     } else if (Constant* constant = input->TryCast<Constant>()) {
       if (constant->object().IsHeapNumber()) {
-        representation_mask &=
-            representation_mask_for(ValueRepresentation::kFloat64);
+        input_reprs.Add(ValueRepresentation::kFloat64);
       } else {
         // Not a Constant that we can untag.
-        representation_mask = 0;
+        // TODO(leszeks): Consider treating 'undefined' as a potential
+        // HoleyFloat64.
+        input_reprs.RemoveAll();
         break;
       }
     } else if (input->properties().is_conversion()) {
       DCHECK_EQ(input->input_count(), 1);
-      representation_mask &= representation_mask_for(
+      // The graph builder tags all Phi inputs, so this conversion should
+      // produce a tagged value.
+      DCHECK_EQ(input->value_representation(), ValueRepresentation::kTagged);
+      // If we want to untag {node}, then we'll drop the conversion and use its
+      // input instead.
+      input_reprs.Add(
           input->input(0).node()->properties().value_representation());
+    } else if (Phi* input_phi = input->TryCast<Phi>()) {
+      if (input_phi->value_representation() != ValueRepresentation::kTagged) {
+        input_reprs.Add(input_phi->value_representation());
+      } else {
+        // An untagged phi is an input of the current phi.
+        if (node->is_backedge_offset(i) &&
+            node->merge_state()->is_loop_with_peeled_iteration()) {
+          // This is the backedge of a loop that has a peeled iteration. We
+          // ignore it and speculatively assume that it will be the same as the
+          // 1st input.
+          DCHECK_EQ(node->input_count(), 2);
+          DCHECK_EQ(i, 1);
+          break;
+        }
+        input_reprs.RemoveAll();
+        break;
+      }
     } else {
-      representation_mask = 0;
+      // This input is tagged (and didn't require a tagging operation to be
+      // tagged); we won't untag {node}.
+      // TODO(dmercadier): this is a bit suboptimal, because some nodes start
+      // tagged, and later become untagged (parameters for instance). Such nodes
+      // will have their untagged alternative passed to {node} without any
+      // explicit conversion, and we thus won't untag {node} even though we
+      // could have.
+      input_reprs.RemoveAll();
       break;
     }
   }
 
-  if (base::bits::CountPopulation(representation_mask) == 1) {
-    ConvertTaggedPhiTo(
-        node, static_cast<ValueRepresentation>(
-                  base::bits::CountTrailingZeros(representation_mask)));
+  UseRepresentationSet use_reprs;
+  if (node->is_loop_phi() && !node->get_same_loop_uses_repr_hints().empty()) {
+    // {node} is a loop phi that has uses inside the loop; we will tag/untag
+    // based on those uses, ignoring uses after the loop.
+    use_reprs = node->get_same_loop_uses_repr_hints();
   } else {
-    // No possible representations, or more than 1 possible representation.
-    // We'll typically end up in this case if:
-    //   - All of the inputs of the Phi are SmiConstant (which can have any
-    //     representation)
-    //   - Some inputs are Int32 tagging and other inputs are Float64 tagging.
-    // If we had information about uses of the node, then we could chose a
-    // representation over the other (eg, Float64 rather than Int32), but
-    // since we don't, we just bail out to avoid choosing the wrong
-    // representation.
+    use_reprs = node->get_uses_repr_hints();
+  }
+
+  TRACE_UNTAGGING("  + use_reprs  : " << use_reprs);
+  TRACE_UNTAGGING("  + input_reprs: " << input_reprs);
+
+  if (use_reprs.contains(UseRepresentation::kTagged) ||
+      use_reprs.contains(UseRepresentation::kUint32) || use_reprs.empty()) {
+    // We don't untag phis that are used as tagged (because we'd have to retag
+    // them later). We also ignore phis that are used as Uint32, because this is
+    // a fairly rare case and supporting it doesn't improve performance all that
+    // much but will increase code complexity.
+    // TODO(dmercadier): consider taking into account where those Tagged uses
+    // are: Tagged uses outside of a loop or for a Return could probably be
+    // ignored.
+    TRACE_UNTAGGING("  => Leaving tagged [incompatible uses]");
     EnsurePhiInputsTagged(node);
+    return ProcessResult::kContinue;
   }
+
+  if (input_reprs.contains(ValueRepresentation::kTagged) ||
+      input_reprs.contains(ValueRepresentation::kUint32) ||
+      input_reprs.empty()) {
+    TRACE_UNTAGGING("  => Leaving tagged [tagged or uint32 inputs]");
+    EnsurePhiInputsTagged(node);
+    return ProcessResult::kContinue;
+  }
+
+  // Only allowed to have Int32, Float64 and HoleyFloat64 inputs from here.
+  DCHECK_EQ(input_reprs -
+                ValueRepresentationSet({ValueRepresentation::kInt32,
+                                        ValueRepresentation::kFloat64,
+                                        ValueRepresentation::kHoleyFloat64}),
+            ValueRepresentationSet());
+
+  DCHECK_EQ(
+      use_reprs - UseRepresentationSet({UseRepresentation::kInt32,
+                                        UseRepresentation::kTruncatedInt32,
+                                        UseRepresentation::kFloat64,
+                                        UseRepresentation::kHoleyFloat64}),
+      UseRepresentationSet());
+
+  // The rules for untagging are that we can only widen input representations,
+  // i.e. promote Int32 -> Float64 -> HoleyFloat64.
+  //
+  // Inputs can always be used as more generic uses, and tighter uses always
+  // block more generic inputs. So, we can find the minimum generic use and
+  // maximum generic input, extend inputs upwards, uses downwards, and convert
+  // to the least generic use in the intersection.
+  //
+  // Of interest is the fact that we don't want to insert conversions which
+  // reduce genericity, e.g. Float64->Int32 conversions, since they could deopt
+  // and lead to deopt loops. The above logic ensures that if a Phi has Float64
+  // inputs and Int32 uses, we simply don't untag it.
+  //
+  // TODO(leszeks): The above logic could be implemented with bit magic if the
+  // representations were contiguous.
+
+  ValueRepresentationSet possible_inputs;
+  if (input_reprs.contains(ValueRepresentation::kHoleyFloat64)) {
+    possible_inputs = {ValueRepresentation::kHoleyFloat64};
+  } else if (input_reprs.contains(ValueRepresentation::kFloat64)) {
+    possible_inputs = {ValueRepresentation::kFloat64,
+                       ValueRepresentation::kHoleyFloat64};
+  } else {
+    DCHECK(input_reprs.contains_only(ValueRepresentation::kInt32));
+    possible_inputs = {ValueRepresentation::kInt32,
+                       ValueRepresentation::kFloat64,
+                       ValueRepresentation::kHoleyFloat64};
+  }
+
+  ValueRepresentationSet allowed_inputs_for_uses;
+  if (use_reprs.contains(UseRepresentation::kInt32)) {
+    allowed_inputs_for_uses = {ValueRepresentation::kInt32};
+  } else if (use_reprs.contains(UseRepresentation::kFloat64)) {
+    allowed_inputs_for_uses = {ValueRepresentation::kInt32,
+                               ValueRepresentation::kFloat64};
+  } else {
+    DCHECK(!use_reprs.empty() &&
+           use_reprs.is_subset_of({UseRepresentation::kHoleyFloat64,
+                                   UseRepresentation::kTruncatedInt32}));
+    allowed_inputs_for_uses = {ValueRepresentation::kInt32,
+                               ValueRepresentation::kFloat64,
+                               ValueRepresentation::kHoleyFloat64};
+  }
+
+  auto intersection = possible_inputs & allowed_inputs_for_uses;
+
+  TRACE_UNTAGGING("  + intersection reprs: " << intersection);
+  if (intersection.contains(ValueRepresentation::kInt32)) {
+    TRACE_UNTAGGING("  => Untagging to Int32");
+    ConvertTaggedPhiTo(node, ValueRepresentation::kInt32);
+    return ProcessResult::kContinue;
+  } else if (intersection.contains(ValueRepresentation::kFloat64)) {
+    TRACE_UNTAGGING("  => Untagging to kFloat64");
+    ConvertTaggedPhiTo(node, ValueRepresentation::kFloat64);
+    return ProcessResult::kContinue;
+  } else if (intersection.contains(ValueRepresentation::kHoleyFloat64)) {
+    TRACE_UNTAGGING("  => Untagging to HoleyFloat64");
+    ConvertTaggedPhiTo(node, ValueRepresentation::kHoleyFloat64);
+    return ProcessResult::kContinue;
+  }
+
+  DCHECK(intersection.empty());
+  // We don't untag the Phi.
+  TRACE_UNTAGGING("  => Leaving tagged [incompatible inputs/uses]");
+  EnsurePhiInputsTagged(node);
+  return ProcessResult::kContinue;
 }
 
 void MaglevPhiRepresentationSelector::EnsurePhiInputsTagged(Phi* phi) {
@@ -86,7 +223,7 @@ void MaglevPhiRepresentationSelector::EnsurePhiInputsTagged(Phi* phi) {
     ValueNode* input = phi->input(i).node();
     if (Phi* phi_input = input->TryCast<Phi>()) {
       phi->set_input(i, EnsurePhiTagged(phi_input, phi->predecessor_at(i),
-                                        NewNodePosition::kEnd));
+                                        NewNodePosition::kEnd, i));
     } else {
       // Inputs of Phis that aren't Phi should always be tagged (except for the
       // phis untagged by this class, but {phi} isn't one of them).
@@ -95,64 +232,10 @@ void MaglevPhiRepresentationSelector::EnsurePhiInputsTagged(Phi* phi) {
   }
 }
 
-void MaglevPhiRepresentationSelector::ConvertTaggedPhiTo(
-    Phi* phi, ValueRepresentation repr) {
-  phi->change_representation(repr);
-
-  for (int i = 0; i < phi->input_count(); i++) {
-    ValueNode* input = phi->input(i).node();
-    if (input->Is<SmiConstant>()) {
-      switch (repr) {
-        case ValueRepresentation::kInt32:
-          phi->change_input(i,
-                            builder_->GetInt32Constant(
-                                input->Cast<SmiConstant>()->value().value()));
-          break;
-        case ValueRepresentation::kFloat64:
-          phi->change_input(i,
-                            builder_->GetFloat64Constant(
-                                input->Cast<SmiConstant>()->value().value()));
-          break;
-        case ValueRepresentation::kUint32:
-          UNIMPLEMENTED();
-        default:
-          UNREACHABLE();
-      }
-    } else if (Constant* constant = input->TryCast<Constant>()) {
-      DCHECK(constant->object().IsHeapNumber());
-      DCHECK_EQ(repr, ValueRepresentation::kFloat64);
-      phi->change_input(i, builder_->GetFloat64Constant(
-                               constant->object().AsHeapNumber().value()));
-    } else if (input->properties().is_conversion()) {
-      // Unwrapping the conversion.
-      DCHECK_EQ(input->value_representation(), ValueRepresentation::kTagged);
-      DCHECK_EQ(input->input(0).node()->value_representation(), repr);
-      phi->set_input(i, input->input(0).node());
-    } else {
-      DCHECK_EQ(input->value_representation(), repr);
-    }
-  }
-}
-
-bool MaglevPhiRepresentationSelector::IsUntagging(Opcode op) {
-  switch (op) {
-    case Opcode::kCheckedSmiUntag:
-    case Opcode::kUnsafeSmiUntag:
-    case Opcode::kCheckedObjectToIndex:
-    case Opcode::kCheckedTruncateNumberOrOddballToInt32:
-    case Opcode::kTruncateNumberOrOddballToInt32:
-    case Opcode::kCheckedNumberOrOddballToFloat64:
-    case Opcode::kUncheckedNumberOrOddballToFloat64:
-      return true;
-    default:
-      return false;
-  }
-}
-
 namespace {
 
-Opcode GetOpcodeForCheckedConversion(ValueRepresentation from,
-                                     ValueRepresentation to, bool truncating) {
+Opcode GetOpcodeForConversion(ValueRepresentation from, ValueRepresentation to,
+                              bool truncating) {
   DCHECK_NE(from, ValueRepresentation::kTagged);
   DCHECK_NE(to, ValueRepresentation::kTagged);
 
@@ -162,6 +245,7 @@ Opcode GetOpcodeForCheckedConversion(ValueRepresentation from,
         case ValueRepresentation::kUint32:
           return Opcode::kCheckedInt32ToUint32;
         case ValueRepresentation::kFloat64:
+        case ValueRepresentation::kHoleyFloat64:
           return Opcode::kChangeInt32ToFloat64;
 
         case ValueRepresentation::kInt32:
@@ -175,6 +259,7 @@ Opcode GetOpcodeForCheckedConversion(ValueRepresentation from,
           return Opcode::kCheckedUint32ToInt32;
 
         case ValueRepresentation::kFloat64:
+        case ValueRepresentation::kHoleyFloat64:
           return Opcode::kChangeUint32ToFloat64;
 
         case ValueRepresentation::kUint32:
@@ -193,12 +278,35 @@ Opcode GetOpcodeForCheckedConversion(ValueRepresentation from,
           // The graph builder never inserts Tagged->Uint32 conversions, so we
           // don't have to handle this case.
           UNREACHABLE();
+        case ValueRepresentation::kHoleyFloat64:
+          return Opcode::kIdentity;
 
         case ValueRepresentation::kFloat64:
         case ValueRepresentation::kTagged:
         case ValueRepresentation::kWord64:
           UNREACHABLE();
       }
+    case ValueRepresentation::kHoleyFloat64:
+      switch (to) {
+        case ValueRepresentation::kInt32:
+          // Holes are NaNs, so we can truncate them to int32 same as real NaNs.
+          if (truncating) {
+            return Opcode::kTruncateFloat64ToInt32;
+          }
+          return Opcode::kCheckedTruncateFloat64ToInt32;
+        case ValueRepresentation::kUint32:
+          // The graph builder never inserts Tagged->Uint32 conversions, so we
+          // don't have to handle this case.
+          UNREACHABLE();
+        case ValueRepresentation::kFloat64:
+          return Opcode::kHoleyFloat64ToMaybeNanFloat64;
+
+        case ValueRepresentation::kHoleyFloat64:
+        case ValueRepresentation::kTagged:
+        case ValueRepresentation::kWord64:
+          UNREACHABLE();
+      }
+
     case ValueRepresentation::kTagged:
     case ValueRepresentation::kWord64:
       UNREACHABLE();
@@ -208,6 +316,166 @@ Opcode GetOpcodeForCheckedConversion(ValueRepresentation from,
 
 }  // namespace
 
+void MaglevPhiRepresentationSelector::ConvertTaggedPhiTo(
+    Phi* phi, ValueRepresentation repr) {
+  // We currently only support Int32, Float64, and HoleyFloat64 untagged phis.
+  DCHECK(repr == ValueRepresentation::kInt32 ||
+         repr == ValueRepresentation::kFloat64 ||
+         repr == ValueRepresentation::kHoleyFloat64);
+  phi->change_representation(repr);
+  // Re-initialise register data, since we might have changed from integer
+  // registers to floating registers.
+  phi->InitializeRegisterData();
+
+  for (int i = 0; i < phi->input_count(); i++) {
+    ValueNode* input = phi->input(i).node();
+#define TRACE_INPUT_LABEL \
+  "    @ Input " << i << " (" << PrintNodeLabel(graph_labeller(), input) << ")"
+
+    if (input->Is<SmiConstant>()) {
+      switch (repr) {
+        case ValueRepresentation::kInt32:
+          TRACE_UNTAGGING(TRACE_INPUT_LABEL << ": Making Int32 instead of Smi");
+          phi->change_input(i,
+                            builder_->GetInt32Constant(
+                                input->Cast<SmiConstant>()->value().value()));
+          break;
+        case ValueRepresentation::kFloat64:
+        case ValueRepresentation::kHoleyFloat64:
+          TRACE_UNTAGGING(TRACE_INPUT_LABEL
+                          << ": Making Float64 instead of Smi");
+          phi->change_input(i,
+                            builder_->GetFloat64Constant(
+                                input->Cast<SmiConstant>()->value().value()));
+          break;
+        case ValueRepresentation::kUint32:
+          UNIMPLEMENTED();
+        default:
+          UNREACHABLE();
+      }
+    } else if (Constant* constant = input->TryCast<Constant>()) {
+      TRACE_UNTAGGING(TRACE_INPUT_LABEL
+                      << ": Making Float64 instead of Constant");
+      DCHECK(constant->object().IsHeapNumber());
+      DCHECK(repr == ValueRepresentation::kFloat64 ||
+             repr == ValueRepresentation::kHoleyFloat64);
+      phi->change_input(i, builder_->GetFloat64Constant(
+                               constant->object().AsHeapNumber().value()));
+    } else if (input->properties().is_conversion()) {
+      // Unwrapping the conversion.
+      DCHECK_EQ(input->value_representation(), ValueRepresentation::kTagged);
+      // Needs to insert a new conversion.
+      ValueNode* bypassed_input = input->input(0).node();
+      ValueRepresentation from_repr = bypassed_input->value_representation();
+      ValueNode* new_input;
+      if (from_repr == repr) {
+        TRACE_UNTAGGING(TRACE_INPUT_LABEL << ": Bypassing conversion");
+        new_input = bypassed_input;
+      } else {
+        Opcode conv_opcode =
+            GetOpcodeForConversion(from_repr, repr, /*truncating*/ false);
+        switch (conv_opcode) {
+          case Opcode::kChangeInt32ToFloat64: {
+            TRACE_UNTAGGING(
+                TRACE_INPUT_LABEL
+                << ": Replacing old conversion with a ChangeInt32ToFloat64");
+            ValueNode* new_node = NodeBase::New<ChangeInt32ToFloat64>(
+                builder_->zone(), {input->input(0).node()});
+            new_input = AddNode(new_node, phi->predecessor_at(i),
+                                NewNodePosition::kEnd);
+            break;
+          }
+          case Opcode::kIdentity:
+            TRACE_UNTAGGING(TRACE_INPUT_LABEL << ": Bypassing conversion");
+            new_input = bypassed_input;
+            break;
+          default:
+            UNREACHABLE();
+        }
+      }
+      phi->set_input(i, new_input);
+    } else if (Phi* input_phi = input->TryCast<Phi>()) {
+      ValueRepresentation from_repr = input_phi->value_representation();
+      if (from_repr == ValueRepresentation::kTagged) {
+        // We allow speculative untagging of the backedge for loop phis from
+        // loops that have been peeled.
+        // This can lead to deopt loops (eg, if after the last iteration of a
+        // loop, a loop Phi has a specific representation that it never has in
+        // the loop), but this case should (hopefully) be rare.
+
+        // We know that we are on the backedge input of a peeled loop, because
+        // if it wasn't the case, then Process(Phi*) would not have decided to
+        // untag this Phi, and this function would not have been called (because
+        // except for backedges of peeled loops, tagged inputs prevent phi
+        // untagging).
+        DCHECK(phi->merge_state()->is_loop_with_peeled_iteration());
+        DCHECK(phi->is_backedge_offset(i));
+
+        DeoptFrame* deopt_frame = phi->merge_state()->backedge_deopt_frame();
+        if (repr == ValueRepresentation::kInt32) {
+          phi->set_input(i, AddNode(NodeBase::New<CheckedSmiUntag>(
+                                        builder_->zone(), {input_phi}),
+                                    phi->predecessor_at(i),
+                                    NewNodePosition::kEnd, deopt_frame));
+        } else {
+          DCHECK(repr == ValueRepresentation::kFloat64 ||
+                 repr == ValueRepresentation::kHoleyFloat64);
+          TaggedToFloat64ConversionType convertion_type =
+              repr == ValueRepresentation::kFloat64
+                  ? TaggedToFloat64ConversionType::kOnlyNumber
+                  : TaggedToFloat64ConversionType::kNumberOrOddball;
+          phi->set_input(
+              i, AddNode(NodeBase::New<CheckedNumberOrOddballToFloat64>(
+                             builder_->zone(), {input_phi}, convertion_type),
+                         phi->predecessor_at(i), NewNodePosition::kEnd,
+                         deopt_frame));
+        }
+        TRACE_UNTAGGING(TRACE_INPUT_LABEL
+                        << ": Eagerly untagging Phi on backedge");
+      } else if (from_repr != repr &&
+                 from_repr == ValueRepresentation::kInt32) {
+        // We allow widening of Int32 inputs to Float64, which can lead to the
+        // current Phi having a Float64 representation but having some Int32
+        // inputs, which will require a Int32ToFloat64 conversion.
+        DCHECK(repr == ValueRepresentation::kFloat64 ||
+               repr == ValueRepresentation::kHoleyFloat64);
+        phi->set_input(
+            i, AddNode(NodeBase::New<ChangeInt32ToFloat64>(builder_->zone(),
+                                                           {input_phi}),
+                       phi->predecessor_at(i), NewNodePosition::kEnd));
+        TRACE_UNTAGGING(
+            TRACE_INPUT_LABEL
+            << ": Converting phi input with a ChangeInt32ToFloat64");
+      } else {
+        // We allow Float64 to silently be used as HoleyFloat64.
+        DCHECK_IMPLIES(from_repr != repr,
+                       from_repr == ValueRepresentation::kFloat64 &&
+                           repr == ValueRepresentation::kHoleyFloat64);
+        TRACE_UNTAGGING(TRACE_INPUT_LABEL
+                        << ": Keeping untagged Phi input as-is");
+      }
+    } else {
+      TRACE_UNTAGGING(TRACE_INPUT_LABEL << ": Invalid input for untagged phi");
+      UNREACHABLE();
+    }
+  }
+}
+
+bool MaglevPhiRepresentationSelector::IsUntagging(Opcode op) {
+  switch (op) {
+    case Opcode::kCheckedSmiUntag:
+    case Opcode::kUnsafeSmiUntag:
+    case Opcode::kCheckedObjectToIndex:
+    case Opcode::kCheckedTruncateNumberOrOddballToInt32:
+    case Opcode::kTruncateNumberOrOddballToInt32:
+    case Opcode::kCheckedNumberOrOddballToFloat64:
+    case Opcode::kUncheckedNumberOrOddballToFloat64:
+      return true;
+    default:
+      return false;
+  }
+}
+
 void MaglevPhiRepresentationSelector::UpdateUntaggingOfPhi(
     ValueNode* old_untagging) {
   DCHECK_EQ(old_untagging->input_count(), 1);
@@ -239,7 +507,8 @@ void MaglevPhiRepresentationSelector::UpdateUntaggingOfPhi(
     // current phi has a Float64/Uint32 representation, then we can safely
     // truncate it to Int32, because we know that the Float64/Uint32 fits in a
     // Smi, and therefore in a Int32.
-    if (from_repr == ValueRepresentation::kFloat64) {
+    if (from_repr == ValueRepresentation::kFloat64 ||
+        from_repr == ValueRepresentation::kHoleyFloat64) {
       old_untagging->OverwriteWith<UnsafeTruncateFloat64ToInt32>();
     } else if (from_repr == ValueRepresentation::kUint32) {
       old_untagging->OverwriteWith<UnsafeTruncateUint32ToInt32>();
@@ -261,7 +530,7 @@ void MaglevPhiRepresentationSelector::UpdateUntaggingOfPhi(
       old_untagging->Is<CheckedTruncateNumberOrOddballToInt32>() ||
       old_untagging->Is<TruncateNumberOrOddballToInt32>();
 
-  Opcode needed_conversion = GetOpcodeForCheckedConversion(
+  Opcode needed_conversion = GetOpcodeForConversion(
       from_repr, to_repr, conversion_is_truncating_float64);
 
   if (needed_conversion != old_untagging->opcode()) {
@@ -269,10 +538,49 @@ void MaglevPhiRepresentationSelector::UpdateUntaggingOfPhi(
   }
 }
 
+ProcessResult MaglevPhiRepresentationSelector::UpdateNodePhiInput(
+    CheckSmi* node, Phi* phi, int input_index, const ProcessingState& state) {
+  DCHECK_EQ(input_index, 0);
+
+  switch (phi->value_representation()) {
+    case ValueRepresentation::kTagged:
+      return ProcessResult::kContinue;
+
+    case ValueRepresentation::kInt32:
+      if (!SmiValuesAre32Bits()) {
+        node->OverwriteWith<CheckInt32IsSmi>();
+        return ProcessResult::kContinue;
+      } else {
+        return ProcessResult::kRemove;
+      }
+
+    case ValueRepresentation::kFloat64:
+    case ValueRepresentation::kHoleyFloat64:
+      node->OverwriteWith<CheckHoleyFloat64IsSmi>();
+      return ProcessResult::kContinue;
+
+    case ValueRepresentation::kUint32:
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
+  }
+}
+
+ProcessResult MaglevPhiRepresentationSelector::UpdateNodePhiInput(
+    CheckNumber* node, Phi* phi, int input_index,
+    const ProcessingState& state) {
+  if (phi->value_representation() != ValueRepresentation::kTagged) {
+    // The phi was untagged, so we know that it's a number. We thus remove this
+    // CheckNumber from the graph.
+    return ProcessResult::kRemove;
+  }
+  return UpdateNodePhiInput(static_cast<NodeBase*>(node), phi, input_index,
+                            state);
+}
+
 // If the input of a StoreTaggedFieldNoWriteBarrier was a Phi that got
 // untagged, then we need to retag it, and we might need to actually use a write
 // barrier.
-void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
+ProcessResult MaglevPhiRepresentationSelector::UpdateNodePhiInput(
     StoreTaggedFieldNoWriteBarrier* node, Phi* phi, int input_index,
     const ProcessingState& state) {
   if (input_index == StoreTaggedFieldNoWriteBarrier::kObjectIndex) {
@@ -280,8 +588,8 @@ void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
     // possible to write `let x = a ? 4 : 2; x.c = 10`, which will produce a
     // store whose receiver could be an untagged Phi. So, for such cases, we use
     // the generic UpdateNodePhiInput method to tag `phi` if needed.
-    UpdateNodePhiInput(static_cast<NodeBase*>(node), phi, input_index, state);
-    return;
+    return UpdateNodePhiInput(static_cast<NodeBase*>(node), phi, input_index,
+                              state);
   }
   DCHECK_EQ(input_index, StoreTaggedFieldNoWriteBarrier::kValueIndex);
 
@@ -298,36 +606,19 @@ void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
                   StoreTaggedFieldWithWriteBarrier::kValueIndex);
     node->OverwriteWith<StoreTaggedFieldWithWriteBarrier>();
   }
-}
 
-// CheckedStoreSmiField is a bit of a special node, because it expects its input
-// to be a Smi, and not just any Object. The comments in SmiTagPhi explain what
-// this means for untagged Phis.
-void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
-    CheckedStoreSmiField* node, Phi* phi, int input_index,
-    const ProcessingState& state) {
-  if (input_index == CheckedStoreSmiField::kValueIndex) {
-    node->change_input(input_index, SmiTagPhi(phi, node, state));
-  } else {
-    DCHECK_EQ(input_index, CheckedStoreSmiField::kObjectIndex);
-    // The 1st input of a Store should usually not be untagged. However, it is
-    // possible to write `let x = a ? 4 : 2; x.c = 10`, which will produce a
-    // store whose receiver could be an untagged Phi. So, for such cases, we use
-    // the generic UpdateNodePhiInput method to tag `phi` if needed.
-    UpdateNodePhiInput(static_cast<NodeBase*>(node), phi, input_index, state);
-    return;
-  }
+  return ProcessResult::kContinue;
 }
 
 // If the input of a StoreFixedArrayElementNoWriteBarrier was a Phi that got
 // untagged, then we need to retag it, and we might need to actually use a write
 // barrier.
-void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
+ProcessResult MaglevPhiRepresentationSelector::UpdateNodePhiInput(
     StoreFixedArrayElementNoWriteBarrier* node, Phi* phi, int input_index,
     const ProcessingState& state) {
   if (input_index != StoreFixedArrayElementNoWriteBarrier::kValueIndex) {
-    UpdateNodePhiInput(static_cast<NodeBase*>(node), phi, input_index, state);
-    return;
+    return UpdateNodePhiInput(static_cast<NodeBase*>(node), phi, input_index,
+                              state);
   }
 
   if (phi->value_representation() != ValueRepresentation::kTagged) {
@@ -345,25 +636,41 @@ void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
                   StoreFixedArrayElementWithWriteBarrier::kValueIndex);
     node->OverwriteWith<StoreFixedArrayElementWithWriteBarrier>();
   }
+
+  return ProcessResult::kContinue;
 }
 
-// CheckedStoreFixedArraySmiElement is a bit of a special node, because it
-// expects its input to be a Smi, and not just any Object. The comments in
-// SmiTagPhi explain what this means for untagged Phis.
-void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
-    CheckedStoreFixedArraySmiElement* node, Phi* phi, int input_index,
+// When a BranchIfToBooleanTrue has an untagged Int32/Float64 Phi as input, we
+// convert it to a BranchIfInt32ToBooleanTrue/BranchIfFloat6ToBooleanTrue to
+// avoid retagging the Phi.
+ProcessResult MaglevPhiRepresentationSelector::UpdateNodePhiInput(
+    BranchIfToBooleanTrue* node, Phi* phi, int input_index,
     const ProcessingState& state) {
-  if (input_index == CheckedStoreFixedArraySmiElement::kValueIndex) {
-    node->change_input(input_index, SmiTagPhi(phi, node, state));
-  } else {
-    UpdateNodePhiInput(static_cast<NodeBase*>(node), phi, input_index, state);
+  DCHECK_EQ(input_index, 0);
+
+  switch (phi->value_representation()) {
+    case ValueRepresentation::kInt32:
+      node->OverwriteWith<BranchIfInt32ToBooleanTrue>();
+      return ProcessResult::kContinue;
+
+    case ValueRepresentation::kFloat64:
+    case ValueRepresentation::kHoleyFloat64:
+      node->OverwriteWith<BranchIfFloat64ToBooleanTrue>();
+      return ProcessResult::kContinue;
+
+    case ValueRepresentation::kTagged:
+      return ProcessResult::kContinue;
+
+    case ValueRepresentation::kUint32:
+    case ValueRepresentation::kWord64:
+      UNREACHABLE();
   }
 }
 
 // {node} was using {phi} without any untagging, which means that it was using
 // {phi} as a tagged value, so, if we've untagged {phi}, we need to re-tag it
 // for {node}.
-void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
+ProcessResult MaglevPhiRepresentationSelector::UpdateNodePhiInput(
     NodeBase* node, Phi* phi, int input_index, const ProcessingState&) {
   if (node->properties().is_conversion()) {
     // {node} can't be an Untagging if we reached this point (because
@@ -379,112 +686,84 @@ void MaglevPhiRepresentationSelector::UpdateNodePhiInput(
     node->change_input(input_index, EnsurePhiTagged(phi, current_block_,
                                                     NewNodePosition::kStart));
   }
+  return ProcessResult::kContinue;
 }
 
-template <class ToNodeT, class FromNodeT>
-ValueNode* MaglevPhiRepresentationSelector::SmiTagPhi(
-    Phi* phi, FromNodeT* user_node, const ProcessingState& state) {
-  // The input graph was something like:
-  //
-  //                            Tagged Phi
-  //                                │
-  //                                │
-  //                                ▼
-  //                            FromNodeT
-  //
-  // If the phi has been untagged, we have to retag it to a Smi, after which we
-  // can omit the "CheckedSmi" part of the FromNodeT, which we do by
-  // replacing the FromNodeT by a ToNodeT:
-  //
-  //                           Untagged Phi
-  //                                │
-  //                                │
-  //                                ▼
-  //            CheckedSmiTagFloat64/CheckedSmiTagInt32
-  //                                │
-  //                                │
-  //                                ▼
-  //                             ToNodeT
-
-  ValueNode* tagged;
-  switch (phi->value_representation()) {
-#define TAG_INPUT(tagging_op)                                  \
-  tagged = NodeBase::New<tagging_op>(builder_->zone(), {phi}); \
-  break;
-    case ValueRepresentation::kFloat64:
-      TAG_INPUT(CheckedSmiTagFloat64)
-    case ValueRepresentation::kInt32:
-      TAG_INPUT(CheckedSmiTagInt32)
-    case ValueRepresentation::kUint32:
-      TAG_INPUT(CheckedSmiTagUint32)
-    case ValueRepresentation::kTagged:
-      return phi;
-    case ValueRepresentation::kWord64:
-      UNREACHABLE();
-#undef TAG_INPUT
+ValueNode* MaglevPhiRepresentationSelector::EnsurePhiTagged(
+    Phi* phi, BasicBlock* block, NewNodePosition pos,
+    base::Optional<int> predecessor_index) {
+  if (phi->value_representation() == ValueRepresentation::kTagged) {
+    return phi;
   }
 
-  tagged->CopyEagerDeoptInfoOf(user_node, builder_->zone());
-
-  state.node_it()->InsertBefore(tagged);
-  if (builder_->has_graph_labeller()) {
-    builder_->graph_labeller()->RegisterNode(tagged);
+  // Try to find an existing Tagged conversion for {phi} in {phi_taggings_}.
+  if (phi->has_key()) {
+    if (predecessor_index.has_value()) {
+      if (ValueNode* tagging = phi_taggings_.GetPredecessorValue(
+              phi->key(), predecessor_index.value())) {
+        return tagging;
+      }
+    } else {
+      if (ValueNode* tagging = phi_taggings_.Get(phi->key())) {
+        return tagging;
+      }
+    }
   }
-#ifdef DEBUG
-  new_nodes_.insert(tagged);
-#endif
-  user_node->template OverwriteWith<ToNodeT>();
-  return tagged;
-}
-
-ValueNode* MaglevPhiRepresentationSelector::SmiTagPhi(
-    Phi* phi, CheckedStoreSmiField* user_node, const ProcessingState& state) {
-  // Since we're planning on replacing CheckedStoreSmiField by a
-  // StoreTaggedFieldNoWriteBarrier, it's important to ensure that they have the
-  // same layout. OverwriteWith will check the sizes and properties of the
-  // operators, but isn't aware of which inputs are at which index, so we
-  // static_assert that both operators have the same inputs at the same index.
-  static_assert(StoreTaggedFieldNoWriteBarrier::kObjectIndex ==
-                CheckedStoreSmiField::kObjectIndex);
-  static_assert(StoreTaggedFieldNoWriteBarrier::kValueIndex ==
-                CheckedStoreSmiField::kValueIndex);
-  return SmiTagPhi<StoreTaggedFieldNoWriteBarrier>(phi, user_node, state);
-}
-
-ValueNode* MaglevPhiRepresentationSelector::SmiTagPhi(
-    Phi* phi, CheckedStoreFixedArraySmiElement* user_node,
-    const ProcessingState& state) {
-  // Since we're planning on replacing CheckedStoreFixedArraySmiElement by a
-  // StoreFixedArrayElementNoWriteBarrier, it's important to ensure that they
-  // have the same layout. OverwriteWith will check the sizes and properties of
-  // the operators, but isn't aware of which inputs are at which index, so we
-  // static_assert that both operators have the same inputs at the same index.
-  static_assert(StoreFixedArrayElementNoWriteBarrier::kElementsIndex ==
-                CheckedStoreFixedArraySmiElement::kElementsIndex);
-  static_assert(StoreFixedArrayElementNoWriteBarrier::kIndexIndex ==
-                CheckedStoreFixedArraySmiElement::kIndexIndex);
-  static_assert(StoreFixedArrayElementNoWriteBarrier::kValueIndex ==
-                CheckedStoreFixedArraySmiElement::kValueIndex);
-  return SmiTagPhi<StoreFixedArrayElementNoWriteBarrier>(phi, user_node, state);
-}
 
-ValueNode* MaglevPhiRepresentationSelector::EnsurePhiTagged(
-    Phi* phi, BasicBlock* block, NewNodePosition pos) {
+  // We didn't already Tag {phi} on the current path; creating this tagging now.
+  ValueNode* tagged = nullptr;
   switch (phi->value_representation()) {
     case ValueRepresentation::kFloat64:
-      return AddNode(NodeBase::New<Float64ToTagged>(builder_->zone(), {phi}),
-                     block, pos);
+      // It's important to use kCanonicalizeSmi for Float64ToTagged, as
+      // otherwise, we could end up storing HeapNumbers in Smi fields.
+      tagged = AddNode(NodeBase::New<Float64ToTagged>(
+                           builder_->zone(), {phi},
+                           Float64ToTagged::ConversionMode::kCanonicalizeSmi),
+                       block, pos);
+      break;
+    case ValueRepresentation::kHoleyFloat64:
+      // It's important to use kCanonicalizeSmi for HoleyFloat64ToTagged, as
+      // otherwise, we could end up storing HeapNumbers in Smi fields.
+      tagged =
+          AddNode(NodeBase::New<HoleyFloat64ToTagged>(
+                      builder_->zone(), {phi},
+                      HoleyFloat64ToTagged::ConversionMode::kCanonicalizeSmi),
+                  block, pos);
+      break;
     case ValueRepresentation::kInt32:
-      return AddNode(NodeBase::New<Int32ToNumber>(builder_->zone(), {phi}),
-                     block, pos);
+      tagged = AddNode(NodeBase::New<Int32ToNumber>(builder_->zone(), {phi}),
+                       block, pos);
+      break;
     case ValueRepresentation::kUint32:
-      return AddNode(NodeBase::New<Uint32ToNumber>(builder_->zone(), {phi}),
-                     block, pos);
+      tagged = AddNode(NodeBase::New<Uint32ToNumber>(builder_->zone(), {phi}),
+                       block, pos);
+      break;
     case ValueRepresentation::kTagged:
-      return phi;
+      // Already handled at the begining of this function.
     case ValueRepresentation::kWord64:
       UNREACHABLE();
   }
+
+  if (predecessor_index.has_value()) {
+    // We inserted the new tagging node in a predecessor of the current block,
+    // so we shouldn't update the snapshot table for the current block (and we
+    // can't update it for the predecessor either since its snapshot is sealed).
+    DCHECK_IMPLIES(block == current_block_,
+                   block->is_loop() && block->successors().size() == 1 &&
+                       block->successors().at(0) == block);
+    return tagged;
+  }
+
+  if (phi->has_key()) {
+    // The Key already existed, but wasn't set on the current path.
+    phi_taggings_.Set(phi->key(), tagged);
+  } else {
+    // The Key didn't already exist, so we create it now.
+    auto key = phi_taggings_.NewKey();
+    phi->set_key(key);
+    phi_taggings_.Set(key, tagged);
+  }
+  return tagged;
 }
 
 void MaglevPhiRepresentationSelector::FixLoopPhisBackedge(BasicBlock* block) {
@@ -526,8 +805,7 @@ void MaglevPhiRepresentationSelector::FixLoopPhisBackedge(BasicBlock* block) {
 }
 
 template <typename DeoptInfoT>
-void MaglevPhiRepresentationSelector::BypassIdentities(
-    const DeoptInfoT* deopt_info) {
+void MaglevPhiRepresentationSelector::BypassIdentities(DeoptInfoT* deopt_info) {
   detail::DeepForEachInput(deopt_info,
                            [&](ValueNode*& node, InputLocation* input) {
                              if (node->Is<Identity>()) {
@@ -536,13 +814,18 @@ void MaglevPhiRepresentationSelector::BypassIdentities(
                            });
 }
 template void MaglevPhiRepresentationSelector::BypassIdentities<EagerDeoptInfo>(
-    const EagerDeoptInfo*);
+    EagerDeoptInfo*);
 template void MaglevPhiRepresentationSelector::BypassIdentities<LazyDeoptInfo>(
-    const LazyDeoptInfo*);
+    LazyDeoptInfo*);
 
 ValueNode* MaglevPhiRepresentationSelector::AddNode(ValueNode* node,
                                                     BasicBlock* block,
-                                                    NewNodePosition pos) {
+                                                    NewNodePosition pos,
+                                                    DeoptFrame* deopt_frame) {
+  if (node->properties().can_eager_deopt()) {
+    DCHECK_NOT_NULL(deopt_frame);
+    node->SetEagerDeoptInfo(builder_->zone(), *deopt_frame);
+  }
   if (block == current_block_) {
     // When adding an Node in the current block, we delay until we've finished
     // processing the current block, to avoid mutating the list of nodes while
@@ -559,13 +842,17 @@ ValueNode* MaglevPhiRepresentationSelector::AddNode(ValueNode* node,
     DCHECK_EQ(pos, NewNodePosition::kEnd);
     block->nodes().Add(node);
   }
+  RegisterNewNode(node);
+  return node;
+}
+
+void MaglevPhiRepresentationSelector::RegisterNewNode(ValueNode* node) {
   if (builder_->has_graph_labeller()) {
     builder_->graph_labeller()->RegisterNode(node);
   }
 #ifdef DEBUG
   new_nodes_.insert(node);
 #endif
-  return node;
 }
 
 void MaglevPhiRepresentationSelector::MergeNewNodesInBlock(BasicBlock* block) {
@@ -584,6 +871,68 @@ void MaglevPhiRepresentationSelector::MergeNewNodesInBlock(BasicBlock* block) {
   new_nodes_current_block_end_.clear();
 }
 
+void MaglevPhiRepresentationSelector::PreparePhiTaggings(
+    BasicBlock* old_block, const BasicBlock* new_block) {
+  // Sealing and saving current snapshot
+  if (phi_taggings_.IsSealed()) {
+    phi_taggings_.StartNewSnapshot();
+    return;
+  }
+  old_block->SetSnapshot(phi_taggings_.Seal());
+
+  // Setting up new snapshot
+  predecessors_.clear();
+
+  if (!new_block->is_merge_block()) {
+    BasicBlock* pred = new_block->predecessor();
+    predecessors_.push_back(pred->snapshot());
+  } else {
+    int skip_backedge = new_block->is_loop();
+    for (int i = 0; i < new_block->predecessor_count() - skip_backedge; i++) {
+      BasicBlock* pred = new_block->predecessor_at(i);
+      predecessors_.push_back(pred->snapshot());
+    }
+  }
+
+  auto merge_taggings =
+      [&](Key key, base::Vector<ValueNode* const> predecessors) -> ValueNode* {
+    for (ValueNode* node : predecessors) {
+      if (node == nullptr) {
+        // There is a predecessor that doesn't have this Tagging, so we'll
+        // return nullptr, and if we need it in the future, we'll have to
+        // recreate it. An alternative would be to eagerly insert this Tagging
+        // in all of the other predecesors, but it's possible that it's not used
+        // anymore or not on all future path, so this could also introduce
+        // unnecessary tagging.
+        return static_cast<Phi*>(nullptr);
+      }
+    }
+
+    // Only merge blocks should require Phis.
+    DCHECK(new_block->is_merge_block());
+
+    // We create a Phi to merge all of the existing taggings.
+    int predecessor_count = new_block->predecessor_count();
+    Phi* phi = Node::New<Phi>(builder_->zone(), predecessor_count,
+                              new_block->state(), interpreter::Register());
+    for (int i = 0; static_cast<size_t>(i) < predecessors.size(); i++) {
+      phi->set_input(i, predecessors[i]);
+    }
+    if (predecessors.size() != static_cast<size_t>(predecessor_count)) {
+      // The backedge is omitted from {predecessors}. With set the Phi as its
+      // own backedge.
+      DCHECK(new_block->is_loop());
+      phi->set_input(predecessor_count - 1, phi);
+    }
+    RegisterNewNode(phi);
+    new_block->AddPhi(phi);
+
+    return phi;
+  };
+
+  phi_taggings_.StartNewSnapshot(base::VectorOf(predecessors_), merge_taggings);
+}
+
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/maglev/maglev-phi-representation-selector.h b/deps/v8/src/maglev/maglev-phi-representation-selector.h
index 52ef9a14d38f91..142310e47259c7 100644
--- a/deps/v8/src/maglev/maglev-phi-representation-selector.h
+++ b/deps/v8/src/maglev/maglev-phi-representation-selector.h
@@ -5,8 +5,10 @@
 #ifndef V8_MAGLEV_MAGLEV_PHI_REPRESENTATION_SELECTOR_H_
 #define V8_MAGLEV_MAGLEV_PHI_REPRESENTATION_SELECTOR_H_
 
+#include "src/compiler/turboshaft/snapshot-table.h"
 #include "src/maglev/maglev-compilation-info.h"
 #include "src/maglev/maglev-graph-builder.h"
+#include "src/maglev/maglev-graph-processor.h"
 
 namespace v8 {
 namespace internal {
@@ -15,28 +17,47 @@ namespace maglev {
 class Graph;
 
 class MaglevPhiRepresentationSelector {
+  template <class Value>
+  using SnapshotTable = compiler::turboshaft::SnapshotTable<Value>;
+  using Key = SnapshotTable<ValueNode*>::Key;
+  using Snapshot = SnapshotTable<ValueNode*>::Snapshot;
+
  public:
   explicit MaglevPhiRepresentationSelector(MaglevGraphBuilder* builder)
       : builder_(builder),
         new_nodes_current_block_start_(builder->zone()),
-        new_nodes_current_block_end_(builder->zone()) {}
+        new_nodes_current_block_end_(builder->zone()),
+        phi_taggings_(builder->zone()),
+        predecessors_(builder->zone()) {}
+
+  void PreProcessGraph(Graph* graph) {
+    if (v8_flags.trace_maglev_phi_untagging) {
+      StdoutStream{} << "\nMaglevPhiRepresentationSelector\n";
+    }
+  }
+  void PostProcessGraph(Graph* graph) {
+    MergeNewNodesInBlock(current_block_);
 
-  void PreProcessGraph(Graph* graph) {}
-  void PostProcessGraph(Graph* graph) { MergeNewNodesInBlock(current_block_); }
+    if (v8_flags.trace_maglev_phi_untagging) {
+      StdoutStream{} << "\n";
+    }
+  }
   void PreProcessBasicBlock(BasicBlock* block) {
     MergeNewNodesInBlock(current_block_);
+    PreparePhiTaggings(current_block_, block);
     current_block_ = block;
   }
 
-  void Process(Phi* node, const ProcessingState&);
+  ProcessResult Process(Phi* node, const ProcessingState&);
 
-  void Process(JumpLoop* node, const ProcessingState&) {
+  ProcessResult Process(JumpLoop* node, const ProcessingState&) {
     FixLoopPhisBackedge(node->target());
+    return ProcessResult::kContinue;
   }
 
   template <class NodeT>
-  void Process(NodeT* node, const ProcessingState& state) {
-    UpdateNodeInputs(node, state);
+  ProcessResult Process(NodeT* node, const ProcessingState& state) {
+    return UpdateNodeInputs(node, state);
   }
 
  private:
@@ -50,9 +71,10 @@ class MaglevPhiRepresentationSelector {
   // it. UpdateNodeInputs(n) removes such untagging from {n}'s input (and insert
   // new conversions if needed, from Int32 to Float64 for instance).
   template <class NodeT>
-  void UpdateNodeInputs(NodeT* n, const ProcessingState& state) {
+  ProcessResult UpdateNodeInputs(NodeT* n, const ProcessingState& state) {
     NodeBase* node = static_cast<NodeBase*>(n);
 
+    ProcessResult result = ProcessResult::kContinue;
     if (IsUntagging(n->opcode())) {
       if (node->input(0).node()->Is<Phi>() &&
           node->input(0).node()->value_representation() !=
@@ -63,10 +85,9 @@ class MaglevPhiRepresentationSelector {
         // by another untagged->untagged conversion, or it might need to be
         // removed alltogether (or rather, replaced by an identity node).
         UpdateUntaggingOfPhi(n->template Cast<ValueNode>());
-        return;
       }
     } else {
-      UpdateNonUntaggingNodeInputs(n, state);
+      result = UpdateNonUntaggingNodeInputs(n, state);
     }
 
     // It's important to check the properties of {node} rather than the static
@@ -79,10 +100,13 @@ class MaglevPhiRepresentationSelector {
     if (node->properties().can_lazy_deopt()) {
       BypassIdentities(node->lazy_deopt_info());
     }
+
+    return result;
   }
 
   template <class NodeT>
-  void UpdateNonUntaggingNodeInputs(NodeT* n, const ProcessingState& state) {
+  ProcessResult UpdateNonUntaggingNodeInputs(NodeT* n,
+                                             const ProcessingState& state) {
     NodeBase* node = static_cast<NodeBase*>(n);
 
     // It would be bad to re-tag the input of an untagging node, so this
@@ -98,21 +122,31 @@ class MaglevPhiRepresentationSelector {
         // If the input is a Phi and it was used without any untagging, then
         // we need to retag it (with some additional checks/changes for some
         // nodes, cf the overload of UpdateNodePhiInput).
-        UpdateNodePhiInput(n, phi, i, state);
+        ProcessResult result = UpdateNodePhiInput(n, phi, i, state);
+        if (V8_UNLIKELY(result == ProcessResult::kRemove)) {
+          return ProcessResult::kRemove;
+        }
       }
     }
+
+    return ProcessResult::kContinue;
   }
 
-  void UpdateNodePhiInput(StoreTaggedFieldNoWriteBarrier* node, Phi* phi,
-                          int input_index, const ProcessingState& state);
-  void UpdateNodePhiInput(CheckedStoreSmiField* node, Phi* phi, int input_index,
-                          const ProcessingState& state);
-  void UpdateNodePhiInput(StoreFixedArrayElementNoWriteBarrier* node, Phi* phi,
-                          int input_index, const ProcessingState& state);
-  void UpdateNodePhiInput(CheckedStoreFixedArraySmiElement* node, Phi* phi,
-                          int input_index, const ProcessingState& state);
-  void UpdateNodePhiInput(NodeBase* node, Phi* phi, int input_index,
-                          const ProcessingState& state);
+  ProcessResult UpdateNodePhiInput(CheckSmi* node, Phi* phi, int input_index,
+                                   const ProcessingState& state);
+  ProcessResult UpdateNodePhiInput(CheckNumber* node, Phi* phi, int input_index,
+                                   const ProcessingState& state);
+  ProcessResult UpdateNodePhiInput(StoreTaggedFieldNoWriteBarrier* node,
+                                   Phi* phi, int input_index,
+                                   const ProcessingState& state);
+  ProcessResult UpdateNodePhiInput(StoreFixedArrayElementNoWriteBarrier* node,
+                                   Phi* phi, int input_index,
+                                   const ProcessingState& state);
+  ProcessResult UpdateNodePhiInput(BranchIfToBooleanTrue* node, Phi* phi,
+                                   int input_index,
+                                   const ProcessingState& state);
+  ProcessResult UpdateNodePhiInput(NodeBase* node, Phi* phi, int input_index,
+                                   const ProcessingState& state);
 
   void EnsurePhiInputsTagged(Phi* phi);
 
@@ -127,19 +161,19 @@ class MaglevPhiRepresentationSelector {
   // at the start of a block (kStart), or at the end of a block (kEnd).
   enum class NewNodePosition { kStart, kEnd };
 
-  // Tags {phi} as a Smi.
-  ValueNode* SmiTagPhi(Phi* phi, CheckedStoreSmiField* user_node,
-                       const ProcessingState& state);
-  ValueNode* SmiTagPhi(Phi* phi, CheckedStoreFixedArraySmiElement* user_node,
-                       const ProcessingState& state);
-  template <class ToNodeT, class FromNodeT>
-  ValueNode* SmiTagPhi(Phi*, FromNodeT* user_node,
-                       const ProcessingState& state);
-
   // Returns a tagged node that represents a tagged version of {phi}.
-  ValueNode* EnsurePhiTagged(Phi* phi, BasicBlock* block, NewNodePosition pos);
-
-  ValueNode* AddNode(ValueNode* node, BasicBlock* block, NewNodePosition pos);
+  // If we are calling EnsurePhiTagged to ensure a Phi input of a Phi is tagged,
+  // then {predecessor_index} should be set to the id of this input (ie, 0 for
+  // the 1st input, 1 for the 2nd, etc.), so that we can use the SnapshotTable
+  // to find existing tagging for {phi} in the {predecessor_index}th predecessor
+  // of the current block.
+  ValueNode* EnsurePhiTagged(
+      Phi* phi, BasicBlock* block, NewNodePosition pos,
+      base::Optional<int> predecessor_index = base::nullopt);
+
+  ValueNode* AddNode(ValueNode* node, BasicBlock* block, NewNodePosition pos,
+                     DeoptFrame* deopt_frame = nullptr);
+  void RegisterNewNode(ValueNode* node);
 
   // Merges the nodes from {new_nodes_current_block_start_} and
   // {new_nodes_current_block_end_} into their destinations.
@@ -153,7 +187,13 @@ class MaglevPhiRepresentationSelector {
 
   // Replaces Identity nodes by their inputs in {deopt_info}
   template <typename DeoptInfoT>
-  void BypassIdentities(const DeoptInfoT* deopt_info);
+  void BypassIdentities(DeoptInfoT* deopt_info);
+
+  void PreparePhiTaggings(BasicBlock* old_block, const BasicBlock* new_block);
+
+  MaglevGraphLabeller* graph_labeller() const {
+    return builder_->graph_labeller();
+  }
 
   MaglevGraphBuilder* builder_ = nullptr;
   BasicBlock* current_block_ = nullptr;
@@ -167,6 +207,13 @@ class MaglevPhiRepresentationSelector {
   ZoneVector<Node*> new_nodes_current_block_start_;
   ZoneVector<Node*> new_nodes_current_block_end_;
 
+  // {phi_taggings_} is a SnapshotTable containing mappings from untagged Phis
+  // to Tagged alternatives for those phis.
+  SnapshotTable<ValueNode*> phi_taggings_;
+  // {predecessors_} is used during merging, but we use an instance variable for
+  // it, in order to save memory and not reallocate it for each merge.
+  ZoneVector<Snapshot> predecessors_;
+
 #ifdef DEBUG
   std::unordered_set<NodeBase*> new_nodes_;
 #endif
diff --git a/deps/v8/src/maglev/maglev-pipeline-statistics.cc b/deps/v8/src/maglev/maglev-pipeline-statistics.cc
new file mode 100644
index 00000000000000..d099f409e94449
--- /dev/null
+++ b/deps/v8/src/maglev/maglev-pipeline-statistics.cc
@@ -0,0 +1,55 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/maglev/maglev-pipeline-statistics.h"
+
+#include "src/compiler/zone-stats.h"
+#include "src/objects/js-function-inl.h"
+#include "src/objects/shared-function-info.h"
+
+namespace v8 {
+namespace internal {
+namespace maglev {
+
+constexpr char MaglevPipelineStatistics::kTraceCategory[];
+
+MaglevPipelineStatistics::MaglevPipelineStatistics(
+    maglev::MaglevCompilationInfo* info,
+    std::shared_ptr<CompilationStatistics> compilation_stats,
+    compiler::ZoneStats* zone_stats)
+    : Base(info->zone(), zone_stats, compilation_stats, CodeKind::MAGLEV) {
+  set_function_name(info->toplevel_function()->shared()->DebugNameCStr().get());
+}
+
+void MaglevPipelineStatistics::BeginPhaseKind(const char* name) {
+  Base::BeginPhaseKind(name);
+  TRACE_EVENT_BEGIN1(kTraceCategory, name, "kind",
+                     CodeKindToString(code_kind()));
+}
+
+void MaglevPipelineStatistics::EndPhaseKind() {
+  CompilationStatistics::BasicStats diff;
+  Base::EndPhaseKind(&diff);
+  TRACE_EVENT_END2(kTraceCategory, phase_kind_name(), "kind",
+                   CodeKindToString(code_kind()), "stats",
+                   TRACE_STR_COPY(diff.AsJSON().c_str()));
+}
+
+void MaglevPipelineStatistics::BeginPhase(const char* name) {
+  Base::BeginPhase(name);
+  TRACE_EVENT_BEGIN1(kTraceCategory, phase_name(), "kind",
+                     CodeKindToString(code_kind()));
+}
+
+void MaglevPipelineStatistics::EndPhase() {
+  CompilationStatistics::BasicStats diff;
+  Base::EndPhase(&diff);
+  TRACE_EVENT_END2(kTraceCategory, phase_name(), "kind",
+                   CodeKindToString(code_kind()), "stats",
+                   TRACE_STR_COPY(diff.AsJSON().c_str()));
+}
+
+}  // namespace maglev
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/maglev/maglev-pipeline-statistics.h b/deps/v8/src/maglev/maglev-pipeline-statistics.h
new file mode 100644
index 00000000000000..1466e4331987fa
--- /dev/null
+++ b/deps/v8/src/maglev/maglev-pipeline-statistics.h
@@ -0,0 +1,44 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_MAGLEV_MAGLEV_PIPELINE_STATISTICS_H_
+#define V8_MAGLEV_MAGLEV_PIPELINE_STATISTICS_H_
+
+#ifdef V8_ENABLE_MAGLEV
+
+#include "src/compiler/pipeline-statistics.h"
+#include "src/compiler/zone-stats.h"
+#include "src/diagnostics/compilation-statistics.h"
+#include "src/maglev/maglev-compilation-info.h"
+#include "src/tracing/trace-event.h"
+
+namespace v8 {
+namespace internal {
+namespace maglev {
+
+class MaglevPipelineStatistics : public compiler::PipelineStatisticsBase,
+                                 public Malloced {
+ public:
+  MaglevPipelineStatistics(maglev::MaglevCompilationInfo* info,
+                           std::shared_ptr<CompilationStatistics> stats,
+                           compiler::ZoneStats* zone_stats);
+  MaglevPipelineStatistics(const MaglevPipelineStatistics&) = delete;
+  MaglevPipelineStatistics& operator=(const MaglevPipelineStatistics&) = delete;
+
+  static constexpr char kTraceCategory[] =
+      TRACE_DISABLED_BY_DEFAULT("v8.maglev");
+
+  void BeginPhaseKind(const char* name);
+  void EndPhaseKind();
+  void BeginPhase(const char* name);
+  void EndPhase();
+};
+
+}  // namespace maglev
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_ENABLE_MAGLEV
+
+#endif  // V8_MAGLEV_MAGLEV_PIPELINE_STATISTICS_H_
diff --git a/deps/v8/src/maglev/maglev-regalloc-data.h b/deps/v8/src/maglev/maglev-regalloc-data.h
index 6b081a741d8dc2..3d99299aca1c39 100644
--- a/deps/v8/src/maglev/maglev-regalloc-data.h
+++ b/deps/v8/src/maglev/maglev-regalloc-data.h
@@ -8,6 +8,7 @@
 #include "src/base/pointer-with-payload.h"
 #include "src/codegen/register.h"
 #include "src/compiler/backend/instruction.h"
+#include "src/maglev/maglev-assembler.h"
 
 namespace v8 {
 namespace internal {
@@ -15,29 +16,24 @@ namespace maglev {
 
 class ValueNode;
 
-#define COUNT(V) +1
 static constexpr int kAllocatableGeneralRegisterCount =
-    ALLOCATABLE_GENERAL_REGISTERS(COUNT);
-#undef COUNT
-
-#define COUNT(V) +1
+    MaglevAssembler::GetAllocatableRegisters().Count();
 static constexpr int kAllocatableDoubleRegisterCount =
-    ALLOCATABLE_DOUBLE_REGISTERS(COUNT);
-#undef COUNT
+    MaglevAssembler::GetAllocatableDoubleRegisters().Count();
 
 template <typename T>
 struct AllocatableRegisters;
 
 template <>
 struct AllocatableRegisters<Register> {
-  static constexpr RegList kRegisters = kAllocatableGeneralRegisters;
-  static constexpr int kCount = kAllocatableGeneralRegisterCount;
+  static constexpr RegList kRegisters =
+      MaglevAssembler::GetAllocatableRegisters();
 };
 
 template <>
 struct AllocatableRegisters<DoubleRegister> {
-  static constexpr DoubleRegList kRegisters = kAllocatableDoubleRegisters;
-  static constexpr int kCount = kAllocatableDoubleRegisterCount;
+  static constexpr DoubleRegList kRegisters =
+      MaglevAssembler::GetAllocatableDoubleRegisters();
 };
 
 struct RegisterStateFlags {
diff --git a/deps/v8/src/maglev/maglev-regalloc.cc b/deps/v8/src/maglev/maglev-regalloc.cc
index 3bb45ba267f24f..c59176b14cb5bf 100644
--- a/deps/v8/src/maglev/maglev-regalloc.cc
+++ b/deps/v8/src/maglev/maglev-regalloc.cc
@@ -27,7 +27,9 @@
 #include "src/maglev/maglev-regalloc-data.h"
 #include "src/zone/zone-containers.h"
 
-#ifdef V8_TARGET_ARCH_ARM64
+#ifdef V8_TARGET_ARCH_ARM
+#include "src/codegen/arm/register-arm.h"
+#elif V8_TARGET_ARCH_ARM64
 #include "src/codegen/arm64/register-arm64.h"
 #elif V8_TARGET_ARCH_X64
 #include "src/codegen/x64/register-x64.h"
@@ -192,6 +194,26 @@ StraightForwardRegisterAllocator::StraightForwardRegisterAllocator(
   AllocateRegisters();
   uint32_t tagged_stack_slots = tagged_.top;
   uint32_t untagged_stack_slots = untagged_.top;
+  if (graph_->is_osr()) {
+    // Fix our stack frame to be compatible with the source stack frame of this
+    // OSR transition:
+    // 1) Ensure the section with tagged slots is big enough to receive all
+    //    live OSR-in values.
+    for (auto val : graph_->osr_values()) {
+      if (val->result().operand().IsAllocated() &&
+          val->stack_slot() >= tagged_stack_slots) {
+        tagged_stack_slots = val->stack_slot() + 1;
+      }
+    }
+    // 2) Ensure we never have to shrink stack frames when OSR'ing into Maglev.
+    //    We don't grow tagged slots or they might end up being uninitialized.
+    uint32_t source_frame_size =
+        graph_->min_maglev_stackslots_for_unoptimized_frame_size();
+    uint32_t target_frame_size = tagged_stack_slots + untagged_stack_slots;
+    if (source_frame_size > target_frame_size) {
+      untagged_stack_slots += source_frame_size - target_frame_size;
+    }
+  }
 #ifdef V8_TARGET_ARCH_ARM64
   // Due to alignment constraints, we add one untagged slot if
   // stack_slots + fixed_slot_count is odd.
@@ -340,6 +362,10 @@ void StraightForwardRegisterAllocator::AllocateRegisters() {
     constant->SetConstantLocation();
     USE(value);
   }
+  for (const auto& [value, constant] : graph_->tagged_index()) {
+    constant->SetConstantLocation();
+    USE(value);
+  }
   for (const auto& [value, constant] : graph_->int32()) {
     constant->SetConstantLocation();
     USE(value);
@@ -386,8 +412,12 @@ void StraightForwardRegisterAllocator::AllocateRegisters() {
       if (!control->Is<JumpLoop>()) {
         printing_visitor_->os() << "\n[holes:";
         while (true) {
-          if (control->Is<Jump>()) {
-            BasicBlock* target = control->Cast<Jump>()->target();
+          if (control->Is<JumpLoop>()) {
+            printing_visitor_->os() << " " << control->id() << "↰";
+            break;
+          } else if (control->Is<UnconditionalControlNode>()) {
+            BasicBlock* target =
+                control->Cast<UnconditionalControlNode>()->target();
             printing_visitor_->os()
                 << " " << control->id() << "-" << target->first_id();
             control = control->next_post_dominating_hole();
@@ -409,9 +439,6 @@ void StraightForwardRegisterAllocator::AllocateRegisters() {
           } else if (control->Is<Deopt>() || control->Is<Abort>()) {
             printing_visitor_->os() << " " << control->id() << "✖️";
             break;
-          } else if (control->Is<JumpLoop>()) {
-            printing_visitor_->os() << " " << control->id() << "↰";
-            break;
           }
           UNREACHABLE();
         }
@@ -437,43 +464,42 @@ void StraightForwardRegisterAllocator::AllocateRegisters() {
         // (the first one by default) that is marked with the
         // virtual_accumulator and force kReturnRegister0. This corresponds to
         // the exception message object.
-        Phi::List::Iterator phi_it = block->phis()->begin();
-        Phi* phi = *phi_it;
-        DCHECK_EQ(phi->input_count(), 0);
-        if (phi->owner() == interpreter::Register::virtual_accumulator() &&
-            !phi->is_dead()) {
-          phi->result().SetAllocated(ForceAllocate(kReturnRegister0, phi));
-          if (v8_flags.trace_maglev_regalloc) {
-            printing_visitor_->Process(phi, ProcessingState(block_it_));
-            printing_visitor_->os() << "phi (exception message object) "
-                                    << phi->result().operand() << std::endl;
+        for (Phi* phi : *block->phis()) {
+          DCHECK_EQ(phi->input_count(), 0);
+          DCHECK(phi->is_exception_phi());
+          if (phi->owner() == interpreter::Register::virtual_accumulator()) {
+            if (!phi->is_dead()) {
+              phi->result().SetAllocated(ForceAllocate(kReturnRegister0, phi));
+              if (v8_flags.trace_maglev_regalloc) {
+                printing_visitor_->Process(phi, ProcessingState(block_it_));
+                printing_visitor_->os() << "phi (exception message object) "
+                                        << phi->result().operand() << std::endl;
+              }
+            }
+          } else if (phi->owner().is_parameter() &&
+                     phi->owner().is_receiver()) {
+            // The receiver is a special case for a fairly silly reason:
+            // OptimizedFrame::Summarize requires the receiver (and the
+            // function) to be in a stack slot, since its value must be
+            // available even though we're not deoptimizing (and thus register
+            // states are not available).
+            //
+            // TODO(leszeks):
+            // For inlined functions / nested graph generation, this a) doesn't
+            // work (there's no receiver stack slot); and b) isn't necessary
+            // (Summarize only looks at noninlined functions).
+            phi->Spill(compiler::AllocatedOperand(
+                compiler::AllocatedOperand::STACK_SLOT,
+                MachineRepresentation::kTagged,
+                (StandardFrameConstants::kExpressionsOffset -
+                 UnoptimizedFrameConstants::kRegisterFileFromFp) /
+                        kSystemPointerSize +
+                    interpreter::Register::receiver().index()));
+            phi->result().SetAllocated(phi->spill_slot());
+            // Break once both accumulator and receiver have been processed.
+            break;
           }
         }
-        // The receiver is the next phi after the accumulator (or the first phi
-        // if there is no accumulator).
-        if (phi->owner() == interpreter::Register::virtual_accumulator()) {
-          ++phi_it;
-          phi = *phi_it;
-        }
-        DCHECK(phi->owner().is_receiver());
-        // The receiver is a special case for a fairly silly reason:
-        // OptimizedFrame::Summarize requires the receiver (and the function)
-        // to be in a stack slot, since its value must be available even
-        // though we're not deoptimizing (and thus register states are not
-        // available).
-        //
-        // TODO(leszeks):
-        // For inlined functions / nested graph generation, this a) doesn't
-        // work (there's no receiver stack slot); and b) isn't necessary
-        // (Summarize only looks at noninlined functions).
-        phi->Spill(compiler::AllocatedOperand(
-            compiler::AllocatedOperand::STACK_SLOT,
-            MachineRepresentation::kTagged,
-            (StandardFrameConstants::kExpressionsOffset -
-             UnoptimizedFrameConstants::kRegisterFileFromFp) /
-                    kSystemPointerSize +
-                interpreter::Register::receiver().index()));
-        phi->result().SetAllocated(phi->spill_slot());
       }
       // Secondly try to assign the phi to a free register.
       for (Phi* phi : *block->phis()) {
@@ -482,8 +508,7 @@ void StraightForwardRegisterAllocator::AllocateRegisters() {
         // a DCHECK.
         if (!phi->has_valid_live_range()) continue;
         if (phi->result().operand().IsAllocated()) continue;
-        if (phi->value_representation() == ValueRepresentation::kFloat64) {
-          // We'll use a double register.
+        if (phi->use_double_register()) {
           if (!double_registers_.UnblockedFreeIsEmpty()) {
             compiler::AllocatedOperand allocation =
                 double_registers_.AllocateRegister(phi, phi->hint());
@@ -612,7 +637,10 @@ void StraightForwardRegisterAllocator::UpdateUse(
       DCHECK_IMPLIES(
           slots.free_slots.size() > 0,
           slots.free_slots.back().freed_at_position <= node->live_range().end);
-      slots.free_slots.emplace_back(slot.index(), node->live_range().end);
+      bool double_slot =
+          IsDoubleRepresentation(node->properties().value_representation());
+      slots.free_slots.emplace_back(slot.index(), node->live_range().end,
+                                    double_slot);
     }
   }
 }
@@ -742,7 +770,8 @@ void StraightForwardRegisterAllocator::AllocateNode(Node* node) {
 }
 
 template <typename RegisterT>
-void StraightForwardRegisterAllocator::DropRegisterValueAtEnd(RegisterT reg) {
+void StraightForwardRegisterAllocator::DropRegisterValueAtEnd(
+    RegisterT reg, bool force_spill) {
   RegisterFrameState<RegisterT>& list = GetRegisterFrameState<RegisterT>();
   list.unblock(reg);
   if (!list.free().has(reg)) {
@@ -752,7 +781,7 @@ void StraightForwardRegisterAllocator::DropRegisterValueAtEnd(RegisterT reg) {
     if (IsCurrentNodeLastUseOf(node)) {
       node->RemoveRegister(reg);
     } else {
-      DropRegisterValue(list, reg);
+      DropRegisterValue(list, reg, force_spill);
     }
     list.AddToFree(reg);
   }
@@ -768,13 +797,28 @@ void StraightForwardRegisterAllocator::AllocateNodeResult(ValueNode* node) {
 
   if (operand.basic_policy() == compiler::UnallocatedOperand::FIXED_SLOT) {
     DCHECK(node->Is<InitialValue>());
-    DCHECK_LT(operand.fixed_slot_index(), 0);
+    DCHECK_IMPLIES(!graph_->is_osr(), operand.fixed_slot_index() < 0);
     // Set the stack slot to exactly where the value is.
     compiler::AllocatedOperand location(compiler::AllocatedOperand::STACK_SLOT,
                                         node->GetMachineRepresentation(),
                                         operand.fixed_slot_index());
     node->result().SetAllocated(location);
     node->Spill(location);
+
+    int idx = operand.fixed_slot_index();
+    if (idx > 0) {
+      // Reserve this slot by increasing the top and also marking slots below as
+      // free. Assumes slots are processed in increasing order.
+      CHECK(node->is_tagged());
+      CHECK_GE(idx, tagged_.top);
+      for (int i = tagged_.top; i < idx; ++i) {
+        bool double_slot =
+            IsDoubleRepresentation(node->properties().value_representation());
+        tagged_.free_slots.emplace_back(i, node->live_range().start,
+                                        double_slot);
+      }
+      tagged_.top = idx + 1;
+    }
     return;
   }
 
@@ -830,7 +874,7 @@ void StraightForwardRegisterAllocator::AllocateNodeResult(ValueNode* node) {
 
 template <typename RegisterT>
 void StraightForwardRegisterAllocator::DropRegisterValue(
-    RegisterFrameState<RegisterT>& registers, RegisterT reg) {
+    RegisterFrameState<RegisterT>& registers, RegisterT reg, bool force_spill) {
   // The register should not already be free.
   DCHECK(!registers.free().has(reg));
 
@@ -850,7 +894,7 @@ void StraightForwardRegisterAllocator::DropRegisterValue(
   if (node->has_register() || node->is_loadable()) return;
   // Try to move the value to another register. Do so without blocking that
   // register, as we may still want to use it elsewhere.
-  if (!registers.UnblockedFreeIsEmpty()) {
+  if (!registers.UnblockedFreeIsEmpty() && !force_spill) {
     RegisterT target_reg = registers.unblocked_free().first();
     RegisterT hint_reg = node->GetRegisterHint<RegisterT>();
     if (hint_reg.is_valid() && registers.unblocked_free().has(hint_reg)) {
@@ -928,7 +972,7 @@ void StraightForwardRegisterAllocator::AllocateControlNode(ControlNode* node,
   // Control nodes can't lazy deopt at the moment.
   DCHECK(!node->properties().can_lazy_deopt());
 
-  if (node->Is<JumpToInlined>() || node->Is<Abort>()) {
+  if (node->Is<Abort>()) {
     // Do nothing.
     DCHECK(node->general_temporaries().is_empty());
     DCHECK(node->double_temporaries().is_empty());
@@ -1536,12 +1580,21 @@ void StraightForwardRegisterAllocator::AllocateSpillSlot(ValueNode* node) {
   uint32_t free_slot;
   bool is_tagged = (node->properties().value_representation() ==
                     ValueRepresentation::kTagged);
-  // TODO(v8:7700): We will need a new class of SpillSlots for doubles in 32-bit
-  // architectures.
+  uint32_t slot_size = 1;
+  bool double_slot =
+      IsDoubleRepresentation(node->properties().value_representation());
+  if constexpr (kDoubleSize != kSystemPointerSize) {
+    if (double_slot) {
+      slot_size = kDoubleSize / kSystemPointerSize;
+    }
+  }
   SpillSlots& slots = is_tagged ? tagged_ : untagged_;
   MachineRepresentation representation = node->GetMachineRepresentation();
-  if (!v8_flags.maglev_reuse_stack_slots || slots.free_slots.empty()) {
-    free_slot = slots.top++;
+  // TODO(victorgomes): We don't currently reuse double slots on arm.
+  if (!v8_flags.maglev_reuse_stack_slots || slot_size > 1 ||
+      slots.free_slots.empty()) {
+    free_slot = slots.top + slot_size - 1;
+    slots.top += slot_size;
   } else {
     NodeIdT start = node->live_range().start;
     auto it =
@@ -1549,10 +1602,23 @@ void StraightForwardRegisterAllocator::AllocateSpillSlot(ValueNode* node) {
                          start, [](NodeIdT s, const SpillSlotInfo& slot_info) {
                            return slot_info.freed_at_position >= s;
                          });
+    // {it} points to the first invalid slot. Decrement it to get to the last
+    // valid slot freed before {start}.
     if (it != slots.free_slots.begin()) {
-      // {it} points to the first invalid slot. Decrement it to get to the last
-      // valid slot freed before {start}.
       --it;
+    }
+
+    // TODO(olivf): Currently we cannot mix double and normal stack slots since
+    // the gap resolver treats them independently and cannot detect cycles via
+    // shared slots.
+    while (it != slots.free_slots.begin()) {
+      if (it->double_slot == double_slot) break;
+      --it;
+    }
+
+    if (it != slots.free_slots.begin()) {
+      CHECK_EQ(double_slot, it->double_slot);
+      CHECK_GT(start, it->freed_at_position);
       free_slot = it->slot_index;
       slots.free_slots.erase(it);
     } else {
@@ -1840,6 +1906,10 @@ RegListBase<RegisterT> GetReservedRegisters(NodeBase* node_base) {
   compiler::UnallocatedOperand operand =
       compiler::UnallocatedOperand::cast(node->result().operand());
   RegListBase<RegisterT> reserved = {node->GetRegisterHint<RegisterT>()};
+  if (operand.basic_policy() == compiler::UnallocatedOperand::FIXED_SLOT) {
+    DCHECK(node->Is<InitialValue>());
+    return reserved;
+  }
   if constexpr (std::is_same_v<RegisterT, Register>) {
     if (operand.extended_policy() ==
         compiler::UnallocatedOperand::FIXED_REGISTER) {
@@ -1934,8 +2004,10 @@ void StraightForwardRegisterAllocator::ClearRegisterValues() {
   ClearRegisterState(double_registers_);
 
   // All registers should be free by now.
-  DCHECK_EQ(general_registers_.unblocked_free(), kAllocatableGeneralRegisters);
-  DCHECK_EQ(double_registers_.unblocked_free(), kAllocatableDoubleRegisters);
+  DCHECK_EQ(general_registers_.unblocked_free(),
+            MaglevAssembler::GetAllocatableRegisters());
+  DCHECK_EQ(double_registers_.unblocked_free(),
+            MaglevAssembler::GetAllocatableDoubleRegisters());
 }
 
 void StraightForwardRegisterAllocator::InitializeRegisterValues(
@@ -2014,6 +2086,57 @@ bool StraightForwardRegisterAllocator::IsForwardReachable(
 
 #endif  //  DEBUG
 
+// If a node needs a register before the first call and after the last call of
+// the loop, initialize the merge state with a register for this node to avoid
+// an unnecessary spill + reload on every iteration.
+template <typename RegisterT>
+void StraightForwardRegisterAllocator::HoistLoopReloads(
+    BasicBlock* target, RegisterFrameState<RegisterT>& registers) {
+  for (ValueNode* node : target->reload_hints()) {
+    DCHECK(general_registers_.blocked().is_empty());
+    if (registers.free().is_empty()) break;
+    if (node->has_register()) continue;
+    // The value is in a liveness hole, don't try to reload it.
+    if (!node->is_loadable()) continue;
+    if ((node->use_double_register() && std::is_same_v<RegisterT, Register>) ||
+        (!node->use_double_register() &&
+         std::is_same_v<RegisterT, DoubleRegister>)) {
+      continue;
+    }
+    RegisterT target_reg = node->GetRegisterHint<RegisterT>();
+    if (!registers.free().has(target_reg)) {
+      target_reg = registers.free().first();
+    }
+    compiler::AllocatedOperand target(compiler::LocationOperand::REGISTER,
+                                      node->GetMachineRepresentation(),
+                                      target_reg.code());
+    registers.RemoveFromFree(target_reg);
+    registers.SetValueWithoutBlocking(target_reg, node);
+    AddMoveBeforeCurrentNode(node, node->loadable_slot(), target);
+  }
+}
+
+// Same as above with spills: if the node does not need a register before the
+// first call and after the last call of the loop, keep it spilled in the merge
+// state to avoid an unnecessary reload + spill on every iteration.
+void StraightForwardRegisterAllocator::HoistLoopSpills(BasicBlock* target) {
+  for (ValueNode* node : target->spill_hints()) {
+    if (!node->has_register()) continue;
+    // Do not move to a different register, the goal is to keep the value
+    // spilled on the back-edge.
+    const bool kForceSpill = true;
+    if (node->use_double_register()) {
+      for (DoubleRegister reg : node->result_registers<DoubleRegister>()) {
+        DropRegisterValueAtEnd(reg, kForceSpill);
+      }
+    } else {
+      for (Register reg : node->result_registers<Register>()) {
+        DropRegisterValueAtEnd(reg, kForceSpill);
+      }
+    }
+  }
+}
+
 void StraightForwardRegisterAllocator::InitializeBranchTargetRegisterValues(
     ControlNode* source, BasicBlock* target) {
   MergePointRegisterState& target_state = target->state()->register_state();
@@ -2027,6 +2150,9 @@ void StraightForwardRegisterAllocator::InitializeBranchTargetRegisterValues(
     }
     state = {node, initialized_node};
   };
+  HoistLoopReloads(target, general_registers_);
+  HoistLoopReloads(target, double_registers_);
+  HoistLoopSpills(target);
   ForEachMergePointRegisterState(target_state, init);
 }
 
diff --git a/deps/v8/src/maglev/maglev-regalloc.h b/deps/v8/src/maglev/maglev-regalloc.h
index e02b914424b10a..017758f659be5f 100644
--- a/deps/v8/src/maglev/maglev-regalloc.h
+++ b/deps/v8/src/maglev/maglev-regalloc.h
@@ -149,10 +149,14 @@ class StraightForwardRegisterAllocator {
   RegisterFrameState<DoubleRegister> double_registers_;
 
   struct SpillSlotInfo {
-    SpillSlotInfo(uint32_t slot_index, NodeIdT freed_at_position)
-        : slot_index(slot_index), freed_at_position(freed_at_position) {}
+    SpillSlotInfo(uint32_t slot_index, NodeIdT freed_at_position,
+                  bool double_slot)
+        : slot_index(slot_index),
+          freed_at_position(freed_at_position),
+          double_slot(double_slot) {}
     uint32_t slot_index;
     NodeIdT freed_at_position;
+    bool double_slot;
   };
   struct SpillSlots {
     int top = 0;
@@ -229,7 +233,7 @@ class StraightForwardRegisterAllocator {
   }
 
   template <typename RegisterT>
-  void DropRegisterValueAtEnd(RegisterT reg);
+  void DropRegisterValueAtEnd(RegisterT reg, bool force_spill = false);
   bool IsCurrentNodeLastUseOf(ValueNode* node);
   template <typename RegisterT>
   void EnsureFreeRegisterAtEnd(const compiler::InstructionOperand& hint =
@@ -238,7 +242,7 @@ class StraightForwardRegisterAllocator {
 
   template <typename RegisterT>
   void DropRegisterValue(RegisterFrameState<RegisterT>& registers,
-                         RegisterT reg);
+                         RegisterT reg, bool force_spill = false);
   void DropRegisterValue(Register reg);
   void DropRegisterValue(DoubleRegister reg);
 
@@ -265,6 +269,10 @@ class StraightForwardRegisterAllocator {
                           NodeIdT last_id);
 #endif
 
+  template <typename RegisterT>
+  void HoistLoopReloads(BasicBlock* target,
+                        RegisterFrameState<RegisterT>& registers);
+  void HoistLoopSpills(BasicBlock* target);
   void InitializeBranchTargetRegisterValues(ControlNode* source,
                                             BasicBlock* target);
   void InitializeEmptyBlockRegisterValues(ControlNode* source,
diff --git a/deps/v8/src/maglev/maglev-register-frame-array.h b/deps/v8/src/maglev/maglev-register-frame-array.h
index c3032533f632d9..311bf8b06afdcc 100644
--- a/deps/v8/src/maglev/maglev-register-frame-array.h
+++ b/deps/v8/src/maglev/maglev-register-frame-array.h
@@ -21,21 +21,22 @@ class RegisterFrameArray {
   explicit RegisterFrameArray(const MaglevCompilationUnit& info) {
     // The first local is at index zero, parameters are behind it with
     // negative indices, and the unoptimized frame header is between the two,
-    // so the entire frame state including parameters is the distance from the
-    // last parameter to the last local frame register, plus one to include both
-    // ends.
-    interpreter::Register last_local =
-        interpreter::Register(info.register_count() - 1);
-    interpreter::Register last_param =
-        interpreter::Register::FromParameterIndex(info.parameter_count() - 1);
-    DCHECK_LT(last_param.index(), 0);
-    T* frame =
-        info.zone()->NewArray<T>(last_local.index() - last_param.index() + 1);
+    // so the entire frame state including parameters is the number of locals
+    // and parameters, plus the number of slots between them.
+    constexpr interpreter::Register first_param =
+        interpreter::Register::FromParameterIndex(0);
+    static_assert(first_param.index() < 0);
+    static_assert(interpreter::Register(0).index() == 0);
+    constexpr int frame_size_between_params_and_locals = -first_param.index();
+
+    T* frame = info.zone()->AllocateArray<T>(
+        info.parameter_count() + frame_size_between_params_and_locals +
+        info.register_count());
 
     // Set frame_start_ to a "butterfly" pointer into the middle of the above
-    // Zone-allocated array. Parameters are at a negative index, so we have to
-    // subtract it from the above frame pointer.
-    frame_start_ = frame - last_param.index();
+    // Zone-allocated array, so that locals start at zero.
+    frame_start_ =
+        frame + info.parameter_count() + frame_size_between_params_and_locals;
   }
 
   // Disallow copy (use CopyFrom instead).
diff --git a/deps/v8/src/maglev/maglev.cc b/deps/v8/src/maglev/maglev.cc
index c8b8b0161c8df4..4f87aac4cb800a 100644
--- a/deps/v8/src/maglev/maglev.cc
+++ b/deps/v8/src/maglev/maglev.cc
@@ -12,12 +12,12 @@
 namespace v8 {
 namespace internal {
 
-MaybeHandle<Code> Maglev::Compile(Isolate* isolate,
-                                  Handle<JSFunction> function) {
+MaybeHandle<Code> Maglev::Compile(Isolate* isolate, Handle<JSFunction> function,
+                                  BytecodeOffset osr_offset) {
   DCHECK(v8_flags.maglev);
   RCS_SCOPE(isolate, RuntimeCallCounterId::kOptimizeNonConcurrentMaglev);
   std::unique_ptr<maglev::MaglevCompilationInfo> info =
-      maglev::MaglevCompilationInfo::New(isolate, function);
+      maglev::MaglevCompilationInfo::New(isolate, function, osr_offset);
   if (!maglev::MaglevCompiler::Compile(isolate->main_thread_local_isolate(),
                                        info.get())) {
     return {};
diff --git a/deps/v8/src/maglev/maglev.h b/deps/v8/src/maglev/maglev.h
index 940fa10ea9ccaa..82842576e839df 100644
--- a/deps/v8/src/maglev/maglev.h
+++ b/deps/v8/src/maglev/maglev.h
@@ -20,7 +20,8 @@ class Maglev : public AllStatic {
   // TODO(v8:7700): This entry point is only used for testing. Consider
   // removing it once BenchMaglev runtime functions are no longer useful.
   static MaybeHandle<Code> Compile(Isolate* isolate,
-                                   Handle<JSFunction> function);
+                                   Handle<JSFunction> function,
+                                   BytecodeOffset osr_offset);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/maglev/x64/maglev-assembler-x64-inl.h b/deps/v8/src/maglev/x64/maglev-assembler-x64-inl.h
index 015eb2a2e8e406..8c37f8c8a62364 100644
--- a/deps/v8/src/maglev/x64/maglev-assembler-x64-inl.h
+++ b/deps/v8/src/maglev/x64/maglev-assembler-x64-inl.h
@@ -11,33 +11,37 @@
 
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/codegen/macro-assembler-inl.h"
+#include "src/common/globals.h"
 #include "src/compiler/compilation-dependencies.h"
-#include "src/maglev/maglev-assembler.h"
+#include "src/maglev/maglev-assembler-inl.h"
 #include "src/maglev/maglev-basic-block.h"
 #include "src/maglev/maglev-code-gen-state.h"
+#include "v8-internal.h"
 
 namespace v8 {
 namespace internal {
 namespace maglev {
 
-constexpr Condition ConditionFor(Operation operation) {
+constexpr Condition ConditionForFloat64(Operation operation) {
   switch (operation) {
     case Operation::kEqual:
     case Operation::kStrictEqual:
       return equal;
     case Operation::kLessThan:
-      return less;
+      return below;
     case Operation::kLessThanOrEqual:
-      return less_equal;
+      return below_equal;
     case Operation::kGreaterThan:
-      return greater;
+      return above;
     case Operation::kGreaterThanOrEqual:
-      return greater_equal;
+      return above_equal;
     default:
       UNREACHABLE();
   }
 }
 
+constexpr Condition ConditionForNaN() { return parity_even; }
+
 inline ScaleFactor ScaleFactorFromInt(int n) {
   switch (n) {
     case 1:
@@ -46,6 +50,8 @@ inline ScaleFactor ScaleFactorFromInt(int n) {
       return times_2;
     case 4:
       return times_4;
+    case 8:
+      return times_8;
     default:
       UNREACHABLE();
   }
@@ -67,6 +73,14 @@ class MaglevAssembler::ScratchRegisterScope {
   }
   ~ScratchRegisterScope() { masm_->scratch_register_scope_ = prev_scope_; }
 
+  void ResetToDefault() {
+    available_ = {};
+    available_double_ = {};
+  }
+
+  Register GetDefaultScratchRegister() { return kScratchRegister; }
+  DoubleRegister GetDefaultScratchDoubleRegister() { return kScratchDoubleReg; }
+
   Register Acquire() { return available_.PopFirst(); }
   void Include(Register reg) { available_.set(reg); }
   void Include(const RegList list) { available_ = available_ | list; }
@@ -89,6 +103,40 @@ class MaglevAssembler::ScratchRegisterScope {
   DoubleRegList available_double_;
 };
 
+inline MapCompare::MapCompare(MaglevAssembler* masm, Register object,
+                              size_t map_count)
+    : masm_(masm), object_(object), map_count_(map_count) {
+  if (map_count_ != 1) {
+    map_ = masm_->scratch_register_scope()->Acquire();
+    masm_->LoadMap(map_, object_);
+  }
+}
+
+void MapCompare::Generate(Handle<Map> map) {
+  if (map_count_ == 1) {
+    masm_->Cmp(FieldOperand(object_, HeapObject::kMapOffset), map);
+  } else {
+    masm_->CompareTagged(map_, map);
+  }
+}
+
+Register MapCompare::GetMap() {
+  if (map_count_ == 1) {
+    DCHECK_EQ(map_, Register::no_reg());
+    // Load the map; the object is in register_for_map_compare_. This
+    // avoids loading the map in the fast path of CheckMapsWithMigration.
+    masm_->LoadMap(kScratchRegister, object_);
+    return kScratchRegister;
+  } else {
+    DCHECK_NE(map_, Register::no_reg());
+    return map_;
+  }
+}
+
+int MapCompare::TemporaryCount(size_t map_count) {
+  return map_count == 1 ? 0 : 1;
+}
+
 namespace detail {
 
 template <typename... Args>
@@ -187,21 +235,30 @@ inline void MaglevAssembler::BindBlock(BasicBlock* block) {
   bind(block->label());
 }
 
-inline void MaglevAssembler::DoubleToInt64Repr(Register dst,
-                                               DoubleRegister src) {
-  Movq(dst, src);
+inline void MaglevAssembler::SmiTagInt32AndSetFlags(Register dst,
+                                                    Register src) {
+  Move(dst, src);
+  if (SmiValuesAre31Bits()) {
+    addl(dst, dst);
+  } else {
+    SmiTag(dst);
+  }
 }
 
-inline void MaglevAssembler::SmiTagInt32(Register obj, Label* fail) {
-  addl(obj, obj);
-  JumpIf(overflow, fail);
+inline void MaglevAssembler::CheckInt32IsSmi(Register obj, Label* fail,
+                                             Register scratch) {
+  DCHECK(!SmiValuesAre32Bits());
+
+  if (scratch == Register::no_reg()) {
+    scratch = kScratchRegister;
+  }
+  movl(scratch, obj);
+  addl(scratch, scratch);
+  JumpIf(kOverflow, fail);
 }
 
-inline Condition MaglevAssembler::IsInt64Constant(Register reg,
-                                                  int64_t constant) {
-  movq(kScratchRegister, kHoleNanInt64);
-  cmpq(reg, kScratchRegister);
-  return equal;
+inline void MaglevAssembler::MoveHeapNumber(Register dst, double value) {
+  movq_heap_number(dst, value);
 }
 
 inline Condition MaglevAssembler::IsRootConstant(Input input,
@@ -237,10 +294,24 @@ inline void MaglevAssembler::BuildTypedArrayDataPointer(Register data_pointer,
   if (JSTypedArray::kMaxSizeInHeap == 0) return;
 
   Register base = kScratchRegister;
-  movl(base, FieldOperand(object, JSTypedArray::kBasePointerOffset));
+  if (COMPRESS_POINTERS_BOOL) {
+    movl(base, FieldOperand(object, JSTypedArray::kBasePointerOffset));
+  } else {
+    movq(base, FieldOperand(object, JSTypedArray::kBasePointerOffset));
+  }
   addq(data_pointer, base);
 }
 
+inline MemOperand MaglevAssembler::TypedArrayElementOperand(
+    Register data_pointer, Register index, int element_size) {
+  return Operand(data_pointer, index, ScaleFactorFromInt(element_size), 0);
+}
+
+inline MemOperand MaglevAssembler::DataViewElementOperand(Register data_pointer,
+                                                          Register index) {
+  return Operand(data_pointer, index, times_1, 0);
+}
+
 inline void MaglevAssembler::LoadTaggedFieldByIndex(Register result,
                                                     Register object,
                                                     Register index, int scale,
@@ -267,6 +338,53 @@ inline void MaglevAssembler::LoadExternalPointerField(Register result,
 #endif
 }
 
+void MaglevAssembler::LoadFixedArrayElement(Register result, Register array,
+                                            Register index) {
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  LoadTaggedFieldByIndex(result, array, index, kTaggedSize,
+                         FixedArray::kHeaderSize);
+}
+
+void MaglevAssembler::LoadFixedArrayElementWithoutDecompressing(
+    Register result, Register array, Register index) {
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  MacroAssembler::LoadTaggedFieldWithoutDecompressing(
+      result,
+      FieldOperand(array, index, times_tagged_size, FixedArray::kHeaderSize));
+}
+
+void MaglevAssembler::LoadFixedDoubleArrayElement(DoubleRegister result,
+                                                  Register array,
+                                                  Register index) {
+  if (v8_flags.debug_code) {
+    AssertNotSmi(array);
+    IsObjectType(array, FIXED_DOUBLE_ARRAY_TYPE);
+    Assert(kEqual, AbortReason::kUnexpectedValue);
+    CompareInt32(index, 0);
+    Assert(kUnsignedGreaterThanEqual, AbortReason::kUnexpectedNegativeValue);
+  }
+  Movsd(result,
+        FieldOperand(array, index, times_8, FixedDoubleArray::kHeaderSize));
+}
+
+inline void MaglevAssembler::StoreFixedDoubleArrayElement(
+    Register array, Register index, DoubleRegister value) {
+  Movsd(FieldOperand(array, index, times_8, FixedDoubleArray::kHeaderSize),
+        value);
+}
+
 inline void MaglevAssembler::LoadSignedField(Register result, Operand operand,
                                              int size) {
   if (size == 1) {
@@ -291,17 +409,46 @@ inline void MaglevAssembler::LoadUnsignedField(Register result, Operand operand,
   }
 }
 
+inline void MaglevAssembler::SetSlotAddressForTaggedField(Register slot_reg,
+                                                          Register object,
+                                                          int offset) {
+  leaq(slot_reg, FieldOperand(object, offset));
+}
+inline void MaglevAssembler::SetSlotAddressForFixedArrayElement(
+    Register slot_reg, Register object, Register index) {
+  leaq(slot_reg,
+       FieldOperand(object, index, times_tagged_size, FixedArray::kHeaderSize));
+}
+
+inline void MaglevAssembler::StoreTaggedFieldNoWriteBarrier(Register object,
+                                                            int offset,
+                                                            Register value) {
+  MacroAssembler::StoreTaggedField(FieldOperand(object, offset), value);
+}
+
+inline void MaglevAssembler::StoreFixedArrayElementNoWriteBarrier(
+    Register array, Register index, Register value) {
+  MacroAssembler::StoreTaggedField(
+      FieldOperand(array, index, times_tagged_size, FixedArray::kHeaderSize),
+      value);
+}
+
 inline void MaglevAssembler::StoreTaggedSignedField(Register object, int offset,
                                                     Register value) {
   AssertSmi(value);
-  mov_tagged(FieldOperand(object, offset), value);
+  MacroAssembler::StoreTaggedField(FieldOperand(object, offset), value);
 }
 
 inline void MaglevAssembler::StoreTaggedSignedField(Register object, int offset,
-                                                    Smi value) {
+                                                    Tagged<Smi> value) {
   MacroAssembler::StoreTaggedSignedField(FieldOperand(object, offset), value);
 }
 
+inline void MaglevAssembler::StoreInt32Field(Register object, int offset,
+                                             int32_t value) {
+  movl(FieldOperand(object, offset), Immediate(value));
+}
+
 inline void MaglevAssembler::StoreField(Operand operand, Register value,
                                         int size) {
   DCHECK(size == 1 || size == 2 || size == 4);
@@ -330,6 +477,8 @@ inline MemOperand MaglevAssembler::StackSlotOperand(StackSlot stack_slot) {
   return MemOperand(rbp, stack_slot.index);
 }
 
+inline void MaglevAssembler::IncrementInt32(Register reg) { incl(reg); }
+
 inline void MaglevAssembler::Move(StackSlot dst, Register src) {
   movq(StackSlotOperand(dst), src);
 }
@@ -350,11 +499,7 @@ inline void MaglevAssembler::Move(MemOperand dst, Register src) {
   movq(dst, src);
 }
 
-inline void MaglevAssembler::Move(MemOperand dst, DoubleRegister src) {
-  Movsd(dst, src);
-}
-
-inline void MaglevAssembler::Move(Register dst, TaggedIndex i) {
+inline void MaglevAssembler::Move(Register dst, Tagged<TaggedIndex> i) {
   MacroAssembler::Move(dst, i);
 }
 
@@ -362,7 +507,7 @@ inline void MaglevAssembler::Move(DoubleRegister dst, DoubleRegister src) {
   MacroAssembler::Move(dst, src);
 }
 
-inline void MaglevAssembler::Move(Register dst, Smi src) {
+inline void MaglevAssembler::Move(Register dst, Tagged<Smi> src) {
   MacroAssembler::Move(dst, src);
 }
 
@@ -374,10 +519,6 @@ inline void MaglevAssembler::Move(Register dst, MemOperand src) {
   MacroAssembler::Move(dst, src);
 }
 
-inline void MaglevAssembler::Move(DoubleRegister dst, MemOperand src) {
-  Movsd(dst, src);
-}
-
 inline void MaglevAssembler::Move(Register dst, Register src) {
   MacroAssembler::Move(dst, src);
 }
@@ -399,6 +540,44 @@ inline void MaglevAssembler::Move(Register dst, Handle<HeapObject> obj) {
   MacroAssembler::Move(dst, obj);
 }
 
+inline void MaglevAssembler::LoadFloat32(DoubleRegister dst, MemOperand src) {
+  Movss(dst, src);
+  Cvtss2sd(dst, dst);
+}
+inline void MaglevAssembler::StoreFloat32(MemOperand dst, DoubleRegister src) {
+  Cvtsd2ss(kScratchDoubleReg, src);
+  Movss(dst, kScratchDoubleReg);
+}
+inline void MaglevAssembler::LoadFloat64(DoubleRegister dst, MemOperand src) {
+  Movsd(dst, src);
+}
+inline void MaglevAssembler::StoreFloat64(MemOperand dst, DoubleRegister src) {
+  Movsd(dst, src);
+}
+
+inline void MaglevAssembler::LoadUnalignedFloat64(DoubleRegister dst,
+                                                  Register base,
+                                                  Register index) {
+  LoadFloat64(dst, Operand(base, index, times_1, 0));
+}
+inline void MaglevAssembler::LoadUnalignedFloat64AndReverseByteOrder(
+    DoubleRegister dst, Register base, Register index) {
+  movq(kScratchRegister, Operand(base, index, times_1, 0));
+  bswapq(kScratchRegister);
+  Movq(dst, kScratchRegister);
+}
+inline void MaglevAssembler::StoreUnalignedFloat64(Register base,
+                                                   Register index,
+                                                   DoubleRegister src) {
+  StoreFloat64(Operand(base, index, times_1, 0), src);
+}
+inline void MaglevAssembler::ReverseByteOrderAndStoreUnalignedFloat64(
+    Register base, Register index, DoubleRegister src) {
+  Movq(kScratchRegister, src);
+  bswapq(kScratchRegister);
+  movq(Operand(base, index, times_1, 0), kScratchRegister);
+}
+
 inline void MaglevAssembler::SignExtend32To64Bits(Register dst, Register src) {
   movsxlq(dst, src);
 }
@@ -445,6 +624,29 @@ inline void MaglevAssembler::LoadByte(Register dst, MemOperand src) {
   movzxbl(dst, src);
 }
 
+inline Condition MaglevAssembler::IsCallableAndNotUndetectable(
+    Register map, Register scratch) {
+  movl(scratch, FieldOperand(map, Map::kBitFieldOffset));
+  andl(scratch, Immediate(Map::Bits1::IsUndetectableBit::kMask |
+                          Map::Bits1::IsCallableBit::kMask));
+  cmpl(scratch, Immediate(Map::Bits1::IsCallableBit::kMask));
+  return kEqual;
+}
+
+inline Condition MaglevAssembler::IsNotCallableNorUndetactable(
+    Register map, Register scratch) {
+  testl(FieldOperand(map, Map::kBitFieldOffset),
+        Immediate(Map::Bits1::IsUndetectableBit::kMask |
+                  Map::Bits1::IsCallableBit::kMask));
+  return kEqual;
+}
+
+inline void MaglevAssembler::LoadInstanceType(Register instance_type,
+                                              Register heap_object) {
+  LoadMap(instance_type, heap_object);
+  movzxwl(instance_type, FieldOperand(instance_type, Map::kInstanceTypeOffset));
+}
+
 inline void MaglevAssembler::IsObjectType(Register heap_object,
                                           InstanceType type) {
   MacroAssembler::IsObjectType(heap_object, type, kScratchRegister);
@@ -471,9 +673,16 @@ inline void MaglevAssembler::CompareObjectType(Register heap_object,
 inline void MaglevAssembler::CompareObjectTypeRange(Register heap_object,
                                                     InstanceType lower_limit,
                                                     InstanceType higher_limit) {
-  LoadMap(kScratchRegister, heap_object);
-  CmpInstanceTypeRange(kScratchRegister, kScratchRegister, lower_limit,
-                       higher_limit);
+  CompareObjectTypeRange(heap_object, kScratchRegister, lower_limit,
+                         higher_limit);
+}
+
+inline void MaglevAssembler::CompareObjectTypeRange(Register heap_object,
+                                                    Register scratch,
+                                                    InstanceType lower_limit,
+                                                    InstanceType higher_limit) {
+  LoadMap(scratch, heap_object);
+  CmpInstanceTypeRange(scratch, scratch, lower_limit, higher_limit);
 }
 
 inline void MaglevAssembler::CompareMapWithRoot(Register object,
@@ -488,9 +697,9 @@ inline void MaglevAssembler::CompareMapWithRoot(Register object,
   CompareRoot(scratch, index);
 }
 
-inline void MaglevAssembler::CompareInstanceTypeRange(
-    Register map, InstanceType lower_limit, InstanceType higher_limit) {
-  CompareInstanceTypeRange(map, kScratchRegister, lower_limit, higher_limit);
+inline void MaglevAssembler::CompareInstanceType(Register map,
+                                                 InstanceType instance_type) {
+  CmpInstanceType(map, instance_type);
 }
 
 inline void MaglevAssembler::CompareInstanceTypeRange(
@@ -499,6 +708,10 @@ inline void MaglevAssembler::CompareInstanceTypeRange(
   CmpInstanceTypeRange(map, instance_type_out, lower_limit, higher_limit);
 }
 
+inline void MaglevAssembler::CompareTagged(Register reg, Tagged<Smi> obj) {
+  Cmp(reg, obj);
+}
+
 inline void MaglevAssembler::CompareTagged(Register reg,
                                            Handle<HeapObject> obj) {
   Cmp(reg, obj);
@@ -509,24 +722,80 @@ inline void MaglevAssembler::CompareTagged(Register src1, Register src2) {
 }
 
 inline void MaglevAssembler::CompareInt32(Register reg, int32_t imm) {
-  cmpl(reg, Immediate(imm));
+  Cmp(reg, imm);
 }
 
 inline void MaglevAssembler::CompareInt32(Register src1, Register src2) {
   cmpl(src1, src2);
 }
 
+inline void MaglevAssembler::CompareFloat64(DoubleRegister src1,
+                                            DoubleRegister src2) {
+  Ucomisd(src1, src2);
+}
+
+inline void MaglevAssembler::PrepareCallCFunction(int num_reg_arguments,
+                                                  int num_double_registers) {
+  MacroAssembler::PrepareCallCFunction(num_reg_arguments +
+                                       num_double_registers);
+}
+
 inline void MaglevAssembler::CallSelf() {
+  DCHECK(allow_call());
   DCHECK(code_gen_state()->entry_label()->is_bound());
   Call(code_gen_state()->entry_label());
 }
 
 inline void MaglevAssembler::Jump(Label* target, Label::Distance distance) {
+  // Any eager deopts should go through JumpIf to enable us to support the
+  // `--deopt-every-n-times` stress mode. See EmitEagerDeoptStress.
+  DCHECK(!IsDeoptLabel(target));
   jmp(target, distance);
 }
 
+inline void MaglevAssembler::JumpToDeopt(Label* target) {
+  DCHECK(IsDeoptLabel(target));
+  jmp(target);
+}
+
+inline void MaglevAssembler::EmitEagerDeoptStress(Label* target) {
+  if (V8_LIKELY(v8_flags.deopt_every_n_times <= 0)) {
+    return;
+  }
+
+  ExternalReference counter = ExternalReference::stress_deopt_count(isolate());
+
+  Label fallthrough;
+  pushfq();
+  pushq(rax);
+  load_rax(counter);
+  decl(rax);
+  JumpIf(not_zero, &fallthrough, Label::kNear);
+
+  RecordComment("-- deopt_every_n_times hit, jump to eager deopt");
+  Move(rax, v8_flags.deopt_every_n_times);
+  store_rax(counter);
+  popq(rax);
+  popfq();
+  JumpToDeopt(target);
+
+  bind(&fallthrough);
+  store_rax(counter);
+  popq(rax);
+  popfq();
+}
+
 inline void MaglevAssembler::JumpIf(Condition cond, Label* target,
                                     Label::Distance distance) {
+  // The least common denominator of all eager deopts is that they eventually
+  // (should) bottom out in `JumpIf`. We use the opportunity here to trigger
+  // extra eager deoptimizations with the `--deopt-every-n-times` stress mode.
+  // Since `IsDeoptLabel` is slow we duplicate the test for the flag here.
+  if (V8_UNLIKELY(v8_flags.deopt_every_n_times > 0)) {
+    if (IsDeoptLabel(target)) {
+      EmitEagerDeoptStress(target);
+    }
+  }
   j(cond, target, distance);
 }
 
@@ -547,12 +816,41 @@ inline void MaglevAssembler::JumpIfSmi(Register src, Label* on_smi,
   MacroAssembler::JumpIfSmi(src, on_smi, distance);
 }
 
+inline void MaglevAssembler::JumpIfNotSmi(Register src, Label* on_not_smi,
+                                          Label::Distance distance) {
+  MacroAssembler::JumpIfNotSmi(src, on_not_smi, distance);
+}
+
 void MaglevAssembler::JumpIfByte(Condition cc, Register value, int32_t byte,
                                  Label* target, Label::Distance distance) {
   cmpb(value, Immediate(byte));
   j(cc, target, distance);
 }
 
+void MaglevAssembler::JumpIfHoleNan(DoubleRegister value, Register scratch,
+                                    Label* target, Label::Distance distance) {
+  Movq(scratch, value);
+  movq(kScratchRegister, kHoleNanInt64);
+  cmpq(scratch, kScratchRegister);
+  JumpIf(kEqual, target, distance);
+}
+
+void MaglevAssembler::JumpIfNotHoleNan(DoubleRegister value, Register scratch,
+                                       Label* target,
+                                       Label::Distance distance) {
+  Movq(scratch, value);
+  movq(kScratchRegister, kHoleNanInt64);
+  cmpq(scratch, kScratchRegister);
+  JumpIf(kNotEqual, target, distance);
+}
+
+void MaglevAssembler::JumpIfNotHoleNan(MemOperand operand, Label* target,
+                                       Label::Distance distance) {
+  movq(kScratchRegister, kHoleNanInt64);
+  cmpq(operand, kScratchRegister);
+  JumpIf(kNotEqual, target, distance);
+}
+
 void MaglevAssembler::CompareInt32AndJumpIf(Register r1, Register r2,
                                             Condition cond, Label* target,
                                             Label::Distance distance) {
@@ -568,7 +866,7 @@ inline void MaglevAssembler::CompareInt32AndJumpIf(Register r1, int32_t value,
   JumpIf(cond, target, distance);
 }
 
-inline void MaglevAssembler::CompareSmiAndJumpIf(Register r1, Smi value,
+inline void MaglevAssembler::CompareSmiAndJumpIf(Register r1, Tagged<Smi> value,
                                                  Condition cond, Label* target,
                                                  Label::Distance distance) {
   AssertSmi(r1);
@@ -576,25 +874,82 @@ inline void MaglevAssembler::CompareSmiAndJumpIf(Register r1, Smi value,
   JumpIf(cond, target, distance);
 }
 
+inline void MaglevAssembler::CompareByteAndJumpIf(MemOperand left, int8_t right,
+                                                  Condition cond,
+                                                  Register scratch,
+                                                  Label* target,
+                                                  Label::Distance distance) {
+  cmpb(left, Immediate(right));
+  JumpIf(cond, target, distance);
+}
+
+inline void MaglevAssembler::CompareTaggedAndJumpIf(Register r1,
+                                                    Tagged<Smi> value,
+                                                    Condition cond,
+                                                    Label* target,
+                                                    Label::Distance distance) {
+  Cmp(r1, value);
+  JumpIf(cond, target, distance);
+}
+
+inline void MaglevAssembler::CompareDoubleAndJumpIfZeroOrNaN(
+    DoubleRegister reg, Label* target, Label::Distance distance) {
+  // Sets scratch register to 0.0.
+  Xorpd(kScratchDoubleReg, kScratchDoubleReg);
+  // Sets ZF if equal to 0.0, -0.0 or NaN.
+  Ucomisd(kScratchDoubleReg, reg);
+  JumpIf(kZero, target, distance);
+}
+
+inline void MaglevAssembler::CompareDoubleAndJumpIfZeroOrNaN(
+    MemOperand operand, Label* target, Label::Distance distance) {
+  // Sets scratch register to 0.0.
+  Xorpd(kScratchDoubleReg, kScratchDoubleReg);
+  // Sets ZF if equal to 0.0, -0.0 or NaN.
+  Ucomisd(kScratchDoubleReg, operand);
+  JumpIf(kZero, target, distance);
+}
+
 inline void MaglevAssembler::TestInt32AndJumpIfAnySet(
     Register r1, int32_t mask, Label* target, Label::Distance distance) {
   testl(r1, Immediate(mask));
   JumpIf(kNotZero, target, distance);
 }
 
+inline void MaglevAssembler::TestInt32AndJumpIfAnySet(
+    MemOperand operand, int32_t mask, Label* target, Label::Distance distance) {
+  testl(operand, Immediate(mask));
+  JumpIf(kNotZero, target, distance);
+}
+
 inline void MaglevAssembler::TestInt32AndJumpIfAllClear(
     Register r1, int32_t mask, Label* target, Label::Distance distance) {
   testl(r1, Immediate(mask));
   JumpIf(kZero, target, distance);
 }
 
+inline void MaglevAssembler::TestInt32AndJumpIfAllClear(
+    MemOperand operand, int32_t mask, Label* target, Label::Distance distance) {
+  testl(operand, Immediate(mask));
+  JumpIf(kZero, target, distance);
+}
+
 inline void MaglevAssembler::LoadHeapNumberValue(DoubleRegister result,
                                                  Register heap_number) {
   Movsd(result, FieldOperand(heap_number, HeapNumber::kValueOffset));
 }
 
-inline void MaglevAssembler::Int32ToDouble(DoubleRegister result, Register n) {
-  Cvtlsi2sd(result, n);
+inline void MaglevAssembler::Int32ToDouble(DoubleRegister result,
+                                           Register src) {
+  Cvtlsi2sd(result, src);
+}
+
+inline void MaglevAssembler::Uint32ToDouble(DoubleRegister result,
+                                            Register src) {
+  // TODO(leszeks): Cvtlui2sd does a manual movl to clear the top bits of the
+  // input register. We could eliminate this movl by ensuring that word32
+  // registers are always written with 32-bit ops and not 64-bit ones.
+  Cvtlui2sd(result, src);
 }
 
 inline void MaglevAssembler::Pop(Register dst) { MacroAssembler::Pop(dst); }
@@ -605,77 +960,6 @@ inline void MaglevAssembler::EmitEagerDeoptIfNotEqual(DeoptimizeReason reason,
   EmitEagerDeoptIf(not_equal, reason, node);
 }
 
-inline void MaglevAssembler::MaterialiseValueNode(Register dst,
-                                                  ValueNode* value) {
-  switch (value->opcode()) {
-    case Opcode::kInt32Constant: {
-      int32_t int_value = value->Cast<Int32Constant>()->value();
-      if (Smi::IsValid(int_value)) {
-        Move(dst, Smi::FromInt(int_value));
-      } else {
-        movq_heap_number(dst, int_value);
-      }
-      return;
-    }
-    case Opcode::kFloat64Constant: {
-      double double_value =
-          value->Cast<Float64Constant>()->value().get_scalar();
-      movq_heap_number(dst, double_value);
-      return;
-    }
-    default:
-      break;
-  }
-
-  DCHECK(!value->allocation().IsConstant());
-  DCHECK(value->allocation().IsAnyStackSlot());
-  using D = NewHeapNumberDescriptor;
-  MemOperand src = ToMemOperand(value->allocation());
-  switch (value->properties().value_representation()) {
-    case ValueRepresentation::kInt32: {
-      Label done;
-      movl(dst, src);
-      addl(dst, dst);
-      j(no_overflow, &done, Label::kNear);
-      // If we overflow, instead of bailing out (deopting), we change
-      // representation to a HeapNumber.
-      Cvtlsi2sd(D::GetDoubleRegisterParameter(D::kValue), src);
-      CallBuiltin(Builtin::kNewHeapNumber);
-      Move(dst, kReturnRegister0);
-      bind(&done);
-      break;
-    }
-    case ValueRepresentation::kUint32: {
-      Label done, tag_smi;
-      movl(dst, src);
-      // Unsigned comparison against Smi::kMaxValue.
-      cmpl(dst, Immediate(Smi::kMaxValue));
-      // If we don't fit in a Smi, instead of bailing out (deopting), we
-      // change representation to a HeapNumber.
-      j(below_equal, &tag_smi, Label::kNear);
-      // The value was loaded with movl, so is zero extended in 64-bit.
-      // Therefore, we can do an unsigned 32-bit converstion to double with a
-      // 64-bit signed conversion (Cvt_q_si2sd instead of Cvt_l_si2sd).
-      Cvtqsi2sd(D::GetDoubleRegisterParameter(D::kValue), dst);
-      CallBuiltin(Builtin::kNewHeapNumber);
-      Move(dst, kReturnRegister0);
-      jmp(&done, Label::kNear);
-      bind(&tag_smi);
-      SmiTag(dst);
-      bind(&done);
-      break;
-    }
-    case ValueRepresentation::kFloat64:
-      Movsd(D::GetDoubleRegisterParameter(D::kValue), src);
-      CallBuiltin(Builtin::kNewHeapNumber);
-      Move(dst, kReturnRegister0);
-      break;
-    case ValueRepresentation::kWord64:
-    case ValueRepresentation::kTagged:
-      UNREACHABLE();
-  }
-}
-
 inline void MaglevAssembler::AssertStackSizeCorrect() {
   if (v8_flags.debug_code) {
     movq(kScratchRegister, rbp);
@@ -687,6 +971,18 @@ inline void MaglevAssembler::AssertStackSizeCorrect() {
   }
 }
 
+inline Condition MaglevAssembler::FunctionEntryStackCheck(
+    int stack_check_offset) {
+  Register stack_cmp_reg = rsp;
+  if (stack_check_offset > kStackLimitSlackForDeoptimizationInBytes) {
+    stack_cmp_reg = kScratchRegister;
+    leaq(stack_cmp_reg, Operand(rsp, -stack_check_offset));
+  }
+  cmpq(stack_cmp_reg,
+       StackLimitAsOperand(StackLimitKind::kInterruptStackLimit));
+  return kUnsignedGreaterThanEqual;
+}
+
 inline void MaglevAssembler::FinishCode() {}
 
 template <typename Dest, typename Source>
diff --git a/deps/v8/src/maglev/x64/maglev-assembler-x64.cc b/deps/v8/src/maglev/x64/maglev-assembler-x64.cc
index 4d7eee06db7ba6..5e0ba089c2e17a 100644
--- a/deps/v8/src/maglev/x64/maglev-assembler-x64.cc
+++ b/deps/v8/src/maglev/x64/maglev-assembler-x64.cc
@@ -5,6 +5,7 @@
 #include "src/base/logging.h"
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/common/globals.h"
+#include "src/compiler/backend/instruction.h"
 #include "src/interpreter/bytecode-flags.h"
 #include "src/maglev/maglev-assembler-inl.h"
 #include "src/maglev/maglev-assembler.h"
@@ -66,8 +67,8 @@ void MaglevAssembler::Allocate(RegisterSnapshot register_snapshot,
         __ jmp(*done);
       },
       register_snapshot, object,
-      in_new_space ? Builtin::kAllocateRegularInYoungGeneration
-                   : Builtin::kAllocateRegularInOldGeneration,
+      in_new_space ? Builtin::kAllocateInYoungGeneration
+                   : Builtin::kAllocateInOldGeneration,
       size_in_bytes, done);
   // Store new top and tag object.
   movq(ExternalReferenceAsOperand(top), new_top);
@@ -75,34 +76,6 @@ void MaglevAssembler::Allocate(RegisterSnapshot register_snapshot,
   bind(*done);
 }
 
-void MaglevAssembler::AllocateHeapNumber(RegisterSnapshot register_snapshot,
-                                         Register result,
-                                         DoubleRegister value) {
-  // In the case we need to call the runtime, we should spill the value
-  // register. Even if it is not live in the next node, otherwise the
-  // allocation call might trash it.
-  register_snapshot.live_double_registers.set(value);
-  Allocate(register_snapshot, result, HeapNumber::kSize);
-  LoadRoot(kScratchRegister, RootIndex::kHeapNumberMap);
-  StoreTaggedField(FieldOperand(result, HeapObject::kMapOffset),
-                   kScratchRegister);
-  Movsd(FieldOperand(result, HeapNumber::kValueOffset), value);
-}
-
-void MaglevAssembler::AllocateTwoByteString(RegisterSnapshot register_snapshot,
-                                            Register result, int length) {
-  int size = SeqTwoByteString::SizeFor(length);
-  Allocate(register_snapshot, result, size);
-  LoadRoot(kScratchRegister, RootIndex::kStringMap);
-  StoreTaggedField(FieldOperand(result, size - kObjectAlignment), Immediate(0));
-  StoreTaggedField(FieldOperand(result, HeapObject::kMapOffset),
-                   kScratchRegister);
-  StoreTaggedField(FieldOperand(result, Name::kRawHashFieldOffset),
-                   Immediate(Name::kEmptyHashField));
-  StoreTaggedField(FieldOperand(result, String::kLengthOffset),
-                   Immediate(length));
-}
-
 void MaglevAssembler::LoadSingleCharacterString(Register result,
                                                 Register char_code,
                                                 Register scratch) {
@@ -114,80 +87,8 @@ void MaglevAssembler::LoadSingleCharacterString(Register result,
   DCHECK_NE(char_code, scratch);
   Register table = scratch;
   LoadRoot(table, RootIndex::kSingleCharacterStringTable);
-  DecompressTagged(result, FieldOperand(table, char_code, times_tagged_size,
-                                        FixedArray::kHeaderSize));
-}
-
-void MaglevAssembler::StoreTaggedFieldWithWriteBarrier(
-    Register object, int offset, Register value,
-    RegisterSnapshot register_snapshot, ValueIsCompressed value_is_compressed,
-    ValueCanBeSmi value_can_be_smi) {
-  DCHECK_NE(object, kScratchRegister);
-  DCHECK_NE(value, kScratchRegister);
-  AssertNotSmi(object);
-  StoreTaggedField(FieldOperand(object, offset), value);
-
-  ZoneLabelRef done(this);
-  Label* deferred_write_barrier = MakeDeferredCode(
-      [](MaglevAssembler* masm, ZoneLabelRef done, Register object, int offset,
-         Register value, RegisterSnapshot register_snapshot,
-         ValueIsCompressed value_is_compressed) {
-        ASM_CODE_COMMENT_STRING(masm, "Write barrier slow path");
-        if (value_is_compressed == kValueIsCompressed) {
-          __ DecompressTagged(value, value);
-        }
-
-        // Use the value as the scratch register if possible, since
-        // CheckPageFlag emits slightly better code when value == scratch.
-        Register scratch = kScratchRegister;
-        if (value != object && !register_snapshot.live_registers.has(value)) {
-          scratch = value;
-        }
-        __ CheckPageFlag(value, scratch,
-                         MemoryChunk::kPointersToHereAreInterestingMask, zero,
-                         *done);
-
-        Register stub_object_reg = WriteBarrierDescriptor::ObjectRegister();
-        Register slot_reg = WriteBarrierDescriptor::SlotAddressRegister();
-
-        RegList saved;
-        if (object != stub_object_reg &&
-            register_snapshot.live_registers.has(stub_object_reg)) {
-          saved.set(stub_object_reg);
-        }
-        if (register_snapshot.live_registers.has(slot_reg)) {
-          saved.set(slot_reg);
-        }
-
-        __ PushAll(saved);
-
-        if (object != stub_object_reg) {
-          __ Move(stub_object_reg, object);
-          object = stub_object_reg;
-        }
-        __ leaq(slot_reg, FieldOperand(object, offset));
-
-        SaveFPRegsMode const save_fp_mode =
-            !register_snapshot.live_double_registers.is_empty()
-                ? SaveFPRegsMode::kSave
-                : SaveFPRegsMode::kIgnore;
-
-        __ CallRecordWriteStub(object, slot_reg, save_fp_mode);
-
-        __ PopAll(saved);
-        __ jmp(*done);
-      },
-      done, object, offset, value, register_snapshot, value_is_compressed);
-
-  if (value_can_be_smi == kValueCanBeSmi) {
-    JumpIfSmi(value, *done);
-  } else {
-    AssertNotSmi(value);
-  }
-  CheckPageFlag(object, kScratchRegister,
-                MemoryChunk::kPointersFromHereAreInterestingMask, not_zero,
-                deferred_write_barrier);
-  bind(*done);
+  LoadTaggedFieldByIndex(result, table, char_code, kTaggedSize,
+                         FixedArray::kHeaderSize);
 }
 
 void MaglevAssembler::StringFromCharCode(RegisterSnapshot register_snapshot,
@@ -286,9 +187,7 @@ void MaglevAssembler::StringCharCodeOrCodePointAt(
   }
 
   // Get instance type.
-  LoadMap(instance_type, string);
-  mov_tagged(instance_type,
-             FieldOperand(instance_type, Map::kInstanceTypeOffset));
+  LoadInstanceType(instance_type, string);
 
   {
     // TODO(victorgomes): Add fast path for external strings.
@@ -308,16 +207,15 @@ void MaglevAssembler::StringCharCodeOrCodePointAt(
 
   // Is a thin string.
   {
-    DecompressTagged(string, FieldOperand(string, ThinString::kActualOffset));
+    LoadTaggedField(string, string, ThinString::kActualOffset);
     jmp(&loop, Label::kNear);
   }
 
   bind(&sliced_string);
   {
     Register offset = scratch;
-    movl(offset, FieldOperand(string, SlicedString::kOffsetOffset));
-    SmiUntag(offset);
-    DecompressTagged(string, FieldOperand(string, SlicedString::kParentOffset));
+    LoadAndUntagTaggedSignedField(offset, string, SlicedString::kOffsetOffset);
+    LoadTaggedField(string, string, SlicedString::kParentOffset);
     addl(index, offset);
     jmp(&loop, Label::kNear);
   }
@@ -327,7 +225,7 @@ void MaglevAssembler::StringCharCodeOrCodePointAt(
     CompareRoot(FieldOperand(string, ConsString::kSecondOffset),
                 RootIndex::kempty_string);
     j(not_equal, deferred_runtime_call);
-    DecompressTagged(string, FieldOperand(string, ConsString::kFirstOffset));
+    LoadTaggedField(string, string, ConsString::kFirstOffset);
     jmp(&loop, Label::kNear);  // Try again with first string.
   }
 
@@ -394,188 +292,6 @@ void MaglevAssembler::StringCharCodeOrCodePointAt(
   }
 }
 
-void MaglevAssembler::ToBoolean(Register value, ZoneLabelRef is_true,
-                                ZoneLabelRef is_false,
-                                bool fallthrough_when_true) {
-  Register map = kScratchRegister;
-
-  // Check if {{value}} is Smi.
-  CheckSmi(value);
-  JumpToDeferredIf(
-      zero,
-      [](MaglevAssembler* masm, Register value, ZoneLabelRef is_true,
-         ZoneLabelRef is_false) {
-        // Check if {value} is not zero.
-        __ SmiCompare(value, Smi::FromInt(0));
-        __ j(equal, *is_false);
-        __ jmp(*is_true);
-      },
-      value, is_true, is_false);
-
-  // Check if {{value}} is false.
-  CompareRoot(value, RootIndex::kFalseValue);
-  j(equal, *is_false);
-
-  // Check if {{value}} is empty string.
-  CompareRoot(value, RootIndex::kempty_string);
-  j(equal, *is_false);
-
-  // Check if {{value}} is undetectable.
-  LoadMap(map, value);
-  testl(FieldOperand(map, Map::kBitFieldOffset),
-        Immediate(Map::Bits1::IsUndetectableBit::kMask));
-  j(not_zero, *is_false);
-
-  // Check if {{value}} is a HeapNumber.
-  CompareRoot(map, RootIndex::kHeapNumberMap);
-  JumpToDeferredIf(
-      equal,
-      [](MaglevAssembler* masm, Register value, ZoneLabelRef is_true,
-         ZoneLabelRef is_false) {
-        // Sets scratch register to 0.0.
-        __ Xorpd(kScratchDoubleReg, kScratchDoubleReg);
-        // Sets ZF if equal to 0.0, -0.0 or NaN.
-        __ Ucomisd(kScratchDoubleReg,
-                   FieldOperand(value, HeapNumber::kValueOffset));
-        __ j(zero, *is_false);
-        __ jmp(*is_true);
-      },
-      value, is_true, is_false);
-
-  // Check if {{value}} is a BigInt.
-  CompareRoot(map, RootIndex::kBigIntMap);
-  JumpToDeferredIf(
-      equal,
-      [](MaglevAssembler* masm, Register value, ZoneLabelRef is_true,
-         ZoneLabelRef is_false) {
-        __ testl(FieldOperand(value, BigInt::kBitfieldOffset),
-                 Immediate(BigInt::LengthBits::kMask));
-        __ j(zero, *is_false);
-        __ jmp(*is_true);
-      },
-      value, is_true, is_false);
-
-  // Otherwise true.
-  if (!fallthrough_when_true) {
-    jmp(*is_true);
-  }
-}
-
-void MaglevAssembler::TestTypeOf(
-    Register object, interpreter::TestTypeOfFlags::LiteralFlag literal,
-    Label* is_true, Label::Distance true_distance, bool fallthrough_when_true,
-    Label* is_false, Label::Distance false_distance,
-    bool fallthrough_when_false) {
-  // If both true and false are fallthroughs, we don't have to do anything.
-  if (fallthrough_when_true && fallthrough_when_false) return;
-
-  // IMPORTANT: Note that `object` could be a register that aliases registers in
-  // the ScratchRegisterScope. Make sure that all reads of `object` are before
-  // any writes to scratch registers
-  using LiteralFlag = interpreter::TestTypeOfFlags::LiteralFlag;
-  switch (literal) {
-    case LiteralFlag::kNumber:
-      JumpIfSmi(object, is_true, true_distance);
-      CompareRoot(FieldOperand(object, HeapObject::kMapOffset),
-                  RootIndex::kHeapNumberMap);
-      Branch(equal, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    case LiteralFlag::kString: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false, false_distance);
-      LoadMap(scratch, object);
-      cmpw(FieldOperand(scratch, Map::kInstanceTypeOffset),
-           Immediate(LAST_STRING_TYPE));
-      Branch(less_equal, is_true, true_distance, fallthrough_when_true,
-             is_false, false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kSymbol: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false, false_distance);
-      LoadMap(scratch, object);
-      cmpw(FieldOperand(scratch, Map::kInstanceTypeOffset),
-           Immediate(SYMBOL_TYPE));
-      Branch(equal, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kBoolean:
-      CompareRoot(object, RootIndex::kTrueValue);
-      JumpIf(equal, is_true, true_distance);
-      CompareRoot(object, RootIndex::kFalseValue);
-      Branch(equal, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    case LiteralFlag::kBigInt: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false, false_distance);
-      LoadMap(scratch, object);
-      cmpw(FieldOperand(scratch, Map::kInstanceTypeOffset),
-           Immediate(BIGINT_TYPE));
-      Branch(equal, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kUndefined: {
-      JumpIfSmi(object, is_false, false_distance);
-      // Check it has the undetectable bit set and it is not null.
-      LoadMap(kScratchRegister, object);
-      testl(FieldOperand(kScratchRegister, Map::kBitFieldOffset),
-            Immediate(Map::Bits1::IsUndetectableBit::kMask));
-      JumpIf(zero, is_false, false_distance);
-      CompareRoot(object, RootIndex::kNullValue);
-      Branch(not_equal, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kFunction: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false, false_distance);
-      // Check if callable bit is set and not undetectable.
-      LoadMap(scratch, object);
-      movl(scratch, FieldOperand(scratch, Map::kBitFieldOffset));
-      andl(scratch, Immediate(Map::Bits1::IsUndetectableBit::kMask |
-                              Map::Bits1::IsCallableBit::kMask));
-      cmpl(scratch, Immediate(Map::Bits1::IsCallableBit::kMask));
-      Branch(equal, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kObject: {
-      MaglevAssembler::ScratchRegisterScope temps(this);
-      Register scratch = temps.Acquire();
-      JumpIfSmi(object, is_false, false_distance);
-      // If the object is null then return true.
-      CompareRoot(object, RootIndex::kNullValue);
-      JumpIf(equal, is_true, true_distance);
-      // Check if the object is a receiver type,
-      LoadMap(scratch, object);
-      cmpw(FieldOperand(scratch, Map::kInstanceTypeOffset),
-           Immediate(FIRST_JS_RECEIVER_TYPE));
-      JumpIf(less, is_false, false_distance);
-      // ... and is not undefined (undetectable) nor callable.
-      testl(FieldOperand(scratch, Map::kBitFieldOffset),
-            Immediate(Map::Bits1::IsUndetectableBit::kMask |
-                      Map::Bits1::IsCallableBit::kMask));
-      Branch(equal, is_true, true_distance, fallthrough_when_true, is_false,
-             false_distance, fallthrough_when_false);
-      return;
-    }
-    case LiteralFlag::kOther:
-      if (!fallthrough_when_false) {
-        Jump(is_false, false_distance);
-      }
-      return;
-  }
-  UNREACHABLE();
-}
-
 void MaglevAssembler::TruncateDoubleToInt32(Register dst, DoubleRegister src) {
   ZoneLabelRef done(this);
 
@@ -630,7 +346,93 @@ void MaglevAssembler::TryTruncateDoubleToInt32(Register dst, DoubleRegister src,
   bind(&check_done);
 }
 
+void MaglevAssembler::TryTruncateDoubleToUint32(Register dst,
+                                                DoubleRegister src,
+                                                Label* fail) {
+  DoubleRegister converted_back = kScratchDoubleReg;
+
+  // Convert the input float64 value to uint32.
+  Cvttsd2ui(dst, src, fail);
+  // Convert that uint32 value back to float64.
+  Cvtlui2sd(converted_back, dst);
+  // Check that the result of the float64->uint32->float64 is equal to the input
+  // (i.e. that the conversion didn't truncate.
+  Ucomisd(src, converted_back);
+  JumpIf(parity_even, fail);
+  JumpIf(not_equal, fail);
+
+  // Check if {input} is -0.
+  Label check_done;
+  cmpl(dst, Immediate(0));
+  j(not_equal, &check_done);
+
+  // In case of 0, we need to check the high bits for the IEEE -0 pattern.
+  Register high_word32_of_input = kScratchRegister;
+  Pextrd(high_word32_of_input, src, 1);
+  cmpl(high_word32_of_input, Immediate(0));
+  JumpIf(less, fail);
+
+  bind(&check_done);
+}
+
+void MaglevAssembler::TryChangeFloat64ToIndex(Register result,
+                                              DoubleRegister value,
+                                              Label* success, Label* fail) {
+  DoubleRegister converted_back = kScratchDoubleReg;
+  // Convert the input float64 value to int32.
+  Cvttsd2si(result, value);
+  // Convert that int32 value back to float64.
+  Cvtlsi2sd(converted_back, result);
+  // Check that the result of the float64->int32->float64 is equal to
+  // the input (i.e. that the conversion didn't truncate).
+  Ucomisd(value, converted_back);
+  JumpIf(parity_even, fail);
+  JumpIf(kNotEqual, fail);
+  Jump(success);
+}
+
+void MaglevAssembler::OSRPrologue(Graph* graph) {
+  DCHECK(graph->is_osr());
+  CHECK(!graph->has_recursive_calls());
+
+  uint32_t source_frame_size =
+      graph->min_maglev_stackslots_for_unoptimized_frame_size();
+
+  if (v8_flags.maglev_assert_stack_size && v8_flags.debug_code) {
+    movq(kScratchRegister, rbp);
+    subq(kScratchRegister, rsp);
+    cmpq(kScratchRegister,
+         Immediate(source_frame_size * kSystemPointerSize +
+                   StandardFrameConstants::kFixedFrameSizeFromFp));
+    Assert(equal, AbortReason::kOsrUnexpectedStackSize);
+  }
+
+  uint32_t target_frame_size =
+      graph->tagged_stack_slots() + graph->untagged_stack_slots();
+  CHECK_LE(source_frame_size, target_frame_size);
+
+  if (source_frame_size < target_frame_size) {
+    ASM_CODE_COMMENT_STRING(this, "Growing frame for OSR");
+    Move(kScratchRegister, 0);
+    uint32_t additional_tagged =
+        source_frame_size < graph->tagged_stack_slots()
+            ? graph->tagged_stack_slots() - source_frame_size
+            : 0;
+    for (size_t i = 0; i < additional_tagged; ++i) {
+      pushq(kScratchRegister);
+    }
+    uint32_t size_so_far = source_frame_size + additional_tagged;
+    CHECK_LE(size_so_far, target_frame_size);
+    if (size_so_far < target_frame_size) {
+      subq(rsp,
+           Immediate((target_frame_size - size_so_far) * kSystemPointerSize));
+    }
+  }
+}
+
 void MaglevAssembler::Prologue(Graph* graph) {
+  DCHECK(!graph->is_osr());
+
   BailoutIfDeoptimized(rbx);
 
   if (graph->has_recursive_calls()) {
@@ -638,35 +440,20 @@ void MaglevAssembler::Prologue(Graph* graph) {
   }
 
   // Tiering support.
-  // TODO(jgruber): Extract to a builtin (the tiering prologue is ~230 bytes
-  // per Maglev code object on x64).
-  {
-    // Scratch registers. Don't clobber regs related to the calling
-    // convention (e.g. kJavaScriptCallArgCountRegister). Keep up-to-date
-    // with deferred flags code.
-    Register flags = rcx;
-    Register feedback_vector = r9;
-
-    Label* deferred_flags_need_processing = MakeDeferredCode(
-        [](MaglevAssembler* masm, Register flags, Register feedback_vector) {
-          ASM_CODE_COMMENT_STRING(masm, "Optimized marker check");
-          // TODO(leszeks): This could definitely be a builtin that we
-          // tail-call.
-          __ OptimizeCodeOrTailCallOptimizedCodeSlot(
-              flags, feedback_vector, kJSFunctionRegister, JumpMode::kJump);
-          __ Trap();
-        },
-        flags, feedback_vector);
-
+  if (v8_flags.turbofan) {
+    using D = MaglevOptimizeCodeOrTailCallOptimizedCodeSlotDescriptor;
+    Register feedback_vector = D::GetRegisterParameter(D::kFeedbackVector);
+    DCHECK(!AreAliased(feedback_vector, kJavaScriptCallArgCountRegister,
+                       kJSFunctionRegister, kContextRegister,
+                       kJavaScriptCallNewTargetRegister));
     Move(feedback_vector,
          compilation_info()->toplevel_compilation_unit()->feedback().object());
-    LoadFeedbackVectorFlagsAndJumpIfNeedsProcessing(
-        flags, feedback_vector, CodeKind::MAGLEV,
-        deferred_flags_need_processing);
+    TailCallBuiltin(Builtin::kMaglevOptimizeCodeOrTailCallOptimizedCodeSlot,
+                    CheckFeedbackVectorFlagsNeedsProcessing(feedback_vector,
+                                                            CodeKind::MAGLEV));
   }
 
   EnterFrame(StackFrame::MAGLEV);
-
   // Save arguments in frame.
   // TODO(leszeks): Consider eliding this frame if we don't make any calls
   // that could clobber these registers.
@@ -721,101 +508,6 @@ void MaglevAssembler::MaybeEmitDeoptBuiltinsCall(size_t eager_deopt_count,
                                                  size_t lazy_deopt_count,
                                                  Label* lazy_deopt_entry) {}
 
-void MaglevAssembler::StringLength(Register result, Register string) {
-  if (v8_flags.debug_code) {
-    // Check if {string} is a string.
-    AssertNotSmi(string);
-    LoadMap(kScratchRegister, string);
-    CmpInstanceTypeRange(kScratchRegister, kScratchRegister, FIRST_STRING_TYPE,
-                         LAST_STRING_TYPE);
-    Check(below_equal, AbortReason::kUnexpectedValue);
-  }
-  movl(result, FieldOperand(string, String::kLengthOffset));
-}
-
-void MaglevAssembler::StoreFixedArrayElementWithWriteBarrier(
-    Register array, Register index, Register value,
-    RegisterSnapshot register_snapshot) {
-  if (v8_flags.debug_code) {
-    AssertNotSmi(array);
-    CmpObjectType(array, FIXED_ARRAY_TYPE, kScratchRegister);
-    Assert(equal, AbortReason::kUnexpectedValue);
-    cmpq(index, Immediate(0));
-    Assert(above_equal, AbortReason::kUnexpectedNegativeValue);
-  }
-  mov_tagged(
-      FieldOperand(array, index, times_tagged_size, FixedArray::kHeaderSize),
-      value);
-  ZoneLabelRef done(this);
-  Label* deferred_write_barrier = MakeDeferredCode(
-      [](MaglevAssembler* masm, ZoneLabelRef done, Register object,
-         Register index, Register value, RegisterSnapshot register_snapshot) {
-        ASM_CODE_COMMENT_STRING(masm, "Write barrier slow path");
-        // Use the value as the scratch register if possible, since
-        // CheckPageFlag emits slightly better code when value == scratch.
-        Register scratch = kScratchRegister;
-        if (value != object && !register_snapshot.live_registers.has(value)) {
-          scratch = value;
-        }
-        __ CheckPageFlag(value, scratch,
-                         MemoryChunk::kPointersToHereAreInterestingMask, zero,
-                         *done);
-
-        Register stub_object_reg = WriteBarrierDescriptor::ObjectRegister();
-        Register slot_reg = WriteBarrierDescriptor::SlotAddressRegister();
-
-        RegList saved;
-        if (object != stub_object_reg &&
-            register_snapshot.live_registers.has(stub_object_reg)) {
-          saved.set(stub_object_reg);
-        }
-        if (register_snapshot.live_registers.has(slot_reg)) {
-          saved.set(slot_reg);
-        }
-
-        __ PushAll(saved);
-
-        if (object != stub_object_reg) {
-          __ Move(stub_object_reg, object);
-          object = stub_object_reg;
-        }
-        __ leaq(slot_reg, FieldOperand(object, index, times_tagged_size,
-                                       FixedArray::kHeaderSize));
-
-        SaveFPRegsMode const save_fp_mode =
-            !register_snapshot.live_double_registers.is_empty()
-                ? SaveFPRegsMode::kSave
-                : SaveFPRegsMode::kIgnore;
-
-        __ CallRecordWriteStub(object, slot_reg, save_fp_mode);
-
-        __ PopAll(saved);
-        __ jmp(*done);
-      },
-      done, array, index, value, register_snapshot);
-
-  JumpIfSmi(value, *done);
-  CheckPageFlag(array, kScratchRegister,
-                MemoryChunk::kPointersFromHereAreInterestingMask, not_zero,
-                deferred_write_barrier);
-  bind(*done);
-}
-
-void MaglevAssembler::StoreFixedArrayElementNoWriteBarrier(Register array,
-                                                           Register index,
-                                                           Register value) {
-  if (v8_flags.debug_code) {
-    AssertNotSmi(array);
-    CmpObjectType(array, FIXED_ARRAY_TYPE, kScratchRegister);
-    Assert(equal, AbortReason::kUnexpectedValue);
-    cmpq(index, Immediate(0));
-    Assert(above_equal, AbortReason::kUnexpectedNegativeValue);
-  }
-  mov_tagged(
-      FieldOperand(array, index, times_tagged_size, FixedArray::kHeaderSize),
-      value);
-}
-
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/maglev/x64/maglev-ir-x64.cc b/deps/v8/src/maglev/x64/maglev-ir-x64.cc
index 9b10d5b5dc4eef..a9a67360e4f0a6 100644
--- a/deps/v8/src/maglev/x64/maglev-ir-x64.cc
+++ b/deps/v8/src/maglev/x64/maglev-ir-x64.cc
@@ -22,24 +22,6 @@ namespace maglev {
 
 #define __ masm->
 
-constexpr Condition ConditionForFloat64(Operation operation) {
-  switch (operation) {
-    case Operation::kEqual:
-    case Operation::kStrictEqual:
-      return equal;
-    case Operation::kLessThan:
-      return below;
-    case Operation::kLessThanOrEqual:
-      return below_equal;
-    case Operation::kGreaterThan:
-      return above;
-    case Operation::kGreaterThanOrEqual:
-      return above_equal;
-    default:
-      UNREACHABLE();
-  }
-}
-
 // ---
 // Nodes
 // ---
@@ -55,233 +37,6 @@ void FoldedAllocation::GenerateCode(MaglevAssembler* masm,
           Operand(ToRegister(raw_allocation()), offset()));
 }
 
-int CreateEmptyObjectLiteral::MaxCallStackArgs() const {
-  return AllocateDescriptor::GetStackParameterCount();
-}
-void CreateEmptyObjectLiteral::SetValueLocationConstraints() {
-  DefineAsRegister(this);
-}
-void CreateEmptyObjectLiteral::GenerateCode(MaglevAssembler* masm,
-                                            const ProcessingState& state) {
-  Register object = ToRegister(result());
-  __ Allocate(register_snapshot(), object, map().instance_size());
-  __ Move(kScratchRegister, map().object());
-  __ StoreTaggedField(FieldOperand(object, HeapObject::kMapOffset),
-                      kScratchRegister);
-  __ LoadRoot(kScratchRegister, RootIndex::kEmptyFixedArray);
-  __ StoreTaggedField(FieldOperand(object, JSObject::kPropertiesOrHashOffset),
-                      kScratchRegister);
-  __ StoreTaggedField(FieldOperand(object, JSObject::kElementsOffset),
-                      kScratchRegister);
-  __ LoadRoot(kScratchRegister, RootIndex::kUndefinedValue);
-  for (int i = 0; i < map().GetInObjectProperties(); i++) {
-    int offset = map().GetInObjectPropertyOffset(i);
-    __ StoreTaggedField(FieldOperand(object, offset), kScratchRegister);
-  }
-}
-
-void CheckMaps::SetValueLocationConstraints() { UseRegister(receiver_input()); }
-void CheckMaps::GenerateCode(MaglevAssembler* masm,
-                             const ProcessingState& state) {
-  Register object = ToRegister(receiver_input());
-
-  // TODO(victorgomes): This can happen, because we do not emit an unconditional
-  // deopt when we intersect the map sets.
-  if (maps().is_empty()) {
-    __ EmitEagerDeopt(this, DeoptimizeReason::kWrongMap);
-    return;
-  }
-
-  bool maps_include_heap_number = AnyMapIsHeapNumber(maps());
-
-  Label done;
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
-    __ AssertNotSmi(object);
-  } else {
-    Condition is_smi = __ CheckSmi(object);
-    if (maps_include_heap_number) {
-      // Smis count as matching the HeapNumber map, so we're done.
-      __ j(is_smi, &done);
-    } else {
-      __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kWrongMap, this);
-    }
-  }
-
-  size_t map_count = maps().size();
-  for (size_t i = 0; i < map_count - 1; ++i) {
-    Handle<Map> map = maps().at(i);
-    __ Cmp(FieldOperand(object, HeapObject::kMapOffset), map);
-    __ j(equal, &done);
-  }
-  Handle<Map> last_map = maps().at(map_count - 1);
-  __ Cmp(FieldOperand(object, HeapObject::kMapOffset), last_map);
-  __ EmitEagerDeoptIf(not_equal, DeoptimizeReason::kWrongMap, this);
-  __ bind(&done);
-}
-
-void CheckNumber::SetValueLocationConstraints() {
-  UseRegister(receiver_input());
-}
-void CheckNumber::GenerateCode(MaglevAssembler* masm,
-                               const ProcessingState& state) {
-  Label done;
-  Register value = ToRegister(receiver_input());
-  // If {value} is a Smi or a HeapNumber, we're done.
-  __ JumpIfSmi(value, &done);
-  __ CompareRoot(FieldOperand(value, HeapObject::kMapOffset),
-                 RootIndex::kHeapNumberMap);
-  if (mode() == Object::Conversion::kToNumeric) {
-    // Jump to done if it is a HeapNumber.
-    __ j(equal, &done);
-    // Check if it is a BigInt.
-    __ LoadMap(kScratchRegister, value);
-    __ cmpw(FieldOperand(kScratchRegister, Map::kInstanceTypeOffset),
-            Immediate(BIGINT_TYPE));
-  }
-  __ EmitEagerDeoptIf(not_equal, DeoptimizeReason::kNotANumber, this);
-  __ bind(&done);
-}
-
-int CheckMapsWithMigration::MaxCallStackArgs() const {
-  DCHECK_EQ(Runtime::FunctionForId(Runtime::kTryMigrateInstance)->nargs, 1);
-  return 1;
-}
-void CheckMapsWithMigration::SetValueLocationConstraints() {
-  UseRegister(receiver_input());
-}
-void CheckMapsWithMigration::GenerateCode(MaglevAssembler* masm,
-                                          const ProcessingState& state) {
-  // TODO(victorgomes): This can happen, because we do not emit an unconditional
-  // deopt when we intersect the map sets.
-  if (maps().is_empty()) {
-    __ EmitEagerDeopt(this, DeoptimizeReason::kWrongMap);
-    return;
-  }
-
-  Register object = ToRegister(receiver_input());
-
-  bool maps_include_heap_number = AnyMapIsHeapNumber(maps());
-
-  ZoneLabelRef done(masm);
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
-    __ AssertNotSmi(object);
-  } else {
-    Condition is_smi = __ CheckSmi(object);
-    if (maps_include_heap_number) {
-      // Smis count as matching the HeapNumber map, so we're done.
-      __ j(is_smi, *done);
-    } else {
-      __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kWrongMap, this);
-    }
-  }
-
-  size_t map_count = maps().size();
-  for (size_t i = 0; i < map_count; ++i) {
-    ZoneLabelRef continue_label(masm);
-    Handle<Map> map = maps().at(i);
-    __ Cmp(FieldOperand(object, HeapObject::kMapOffset), map);
-
-    bool last_map = (i == map_count - 1);
-    if (map->is_migration_target()) {
-      __ JumpToDeferredIf(
-          not_equal,
-          [](MaglevAssembler* masm, ZoneLabelRef continue_label,
-             ZoneLabelRef done, Register object, int map_index,
-             CheckMapsWithMigration* node) {
-            // Reload the map to avoid needing to save it on a temporary in the
-            // fast path.
-            __ LoadMap(kScratchRegister, object);
-            // If the map is not deprecated, we fail the map check, continue to
-            // the next one.
-            __ movl(kScratchRegister,
-                    FieldOperand(kScratchRegister, Map::kBitField3Offset));
-            __ testl(kScratchRegister,
-                     Immediate(Map::Bits3::IsDeprecatedBit::kMask));
-            __ j(zero, *continue_label);
-
-            // Otherwise, try migrating the object. If the migration
-            // returns Smi zero, then it failed the migration.
-            Register return_val = Register::no_reg();
-            {
-              RegisterSnapshot register_snapshot = node->register_snapshot();
-              // We can eager deopt after the snapshot, so make sure the nodes
-              // used by the deopt are included in it.
-              // TODO(leszeks): This is a bit of a footgun -- we likely want the
-              // snapshot to always include eager deopt input registers.
-              AddDeoptRegistersToSnapshot(&register_snapshot,
-                                          node->eager_deopt_info());
-              SaveRegisterStateForCall save_register_state(masm,
-                                                           register_snapshot);
-
-              __ Push(object);
-              __ Move(kContextRegister, masm->native_context().object());
-              __ CallRuntime(Runtime::kTryMigrateInstance);
-              save_register_state.DefineSafepoint();
-
-              // Make sure the return value is preserved across the live
-              // register restoring pop all.
-              return_val = kReturnRegister0;
-              if (register_snapshot.live_registers.has(return_val)) {
-                DCHECK(!register_snapshot.live_registers.has(kScratchRegister));
-                __ movq(kScratchRegister, return_val);
-                return_val = kScratchRegister;
-              }
-            }
-
-            // On failure, the returned value is zero
-            __ cmpl(return_val, Immediate(0));
-            __ j(equal, *continue_label);
-
-            // The migrated object is returned on success, retry the map check.
-            __ Move(object, return_val);
-            // Manually load the map pointer without uncompressing it.
-            __ Cmp(FieldOperand(object, HeapObject::kMapOffset),
-                   node->maps().at(map_index));
-            __ j(equal, *done);
-            __ jmp(*continue_label);
-          },
-          // If this is the last map to check, we should deopt if we fail.
-          // This is safe to do, since {eager_deopt_info} is ZoneAllocated.
-          (last_map ? ZoneLabelRef::UnsafeFromLabelPointer(masm->GetDeoptLabel(
-                          this, DeoptimizeReason::kWrongMap))
-                    : continue_label),
-          done, object, i, this);
-    } else if (last_map) {
-      // If it is the last map and it is not a migration target, we should deopt
-      // if the check fails.
-      __ EmitEagerDeoptIf(not_equal, DeoptimizeReason::kWrongMap, this);
-    }
-
-    if (!last_map) {
-      // We don't need to bind the label for the last map.
-      __ j(equal, *done);
-      __ bind(*continue_label);
-    }
-  }
-
-  __ bind(*done);
-}
-
-void CheckJSArrayBounds::SetValueLocationConstraints() {
-  UseRegister(receiver_input());
-  UseRegister(index_input());
-}
-void CheckJSArrayBounds::GenerateCode(MaglevAssembler* masm,
-                                      const ProcessingState& state) {
-  Register object = ToRegister(receiver_input());
-  Register index = ToRegister(index_input());
-  __ AssertNotSmi(object);
-
-  if (v8_flags.debug_code) {
-    __ CmpObjectType(object, JS_ARRAY_TYPE, kScratchRegister);
-    __ Assert(equal, AbortReason::kUnexpectedValue);
-  }
-  __ SmiUntagField(kScratchRegister,
-                   FieldOperand(object, JSArray::kLengthOffset));
-  __ cmpl(index, kScratchRegister);
-  __ EmitEagerDeoptIf(above_equal, DeoptimizeReason::kOutOfBounds, this);
-}
-
 void CheckJSTypedArrayBounds::SetValueLocationConstraints() {
   UseRegister(receiver_input());
   if (ElementsKindSize(elements_kind_) == 1) {
@@ -313,7 +68,6 @@ void CheckJSTypedArrayBounds::GenerateCode(MaglevAssembler* masm,
   __ EmitEagerDeoptIf(above_equal, DeoptimizeReason::kOutOfBounds, this);
 }
 
-int CheckJSDataViewBounds::MaxCallStackArgs() const { return 1; }
 void CheckJSDataViewBounds::SetValueLocationConstraints() {
   UseRegister(receiver_input());
   UseRegister(index_input());
@@ -342,164 +96,9 @@ void CheckJSDataViewBounds::GenerateCode(MaglevAssembler* masm,
   __ EmitEagerDeoptIf(above_equal, DeoptimizeReason::kOutOfBounds, this);
 }
 
-void CheckJSObjectElementsBounds::SetValueLocationConstraints() {
-  UseRegister(receiver_input());
-  UseRegister(index_input());
-}
-void CheckJSObjectElementsBounds::GenerateCode(MaglevAssembler* masm,
-                                               const ProcessingState& state) {
-  Register object = ToRegister(receiver_input());
-  Register index = ToRegister(index_input());
-  __ AssertNotSmi(object);
-
-  if (v8_flags.debug_code) {
-    __ CmpObjectType(object, FIRST_JS_OBJECT_TYPE, kScratchRegister);
-    __ Assert(greater_equal, AbortReason::kUnexpectedValue);
-  }
-  __ LoadTaggedField(kScratchRegister,
-                     FieldOperand(object, JSObject::kElementsOffset));
-  if (v8_flags.debug_code) {
-    __ AssertNotSmi(kScratchRegister);
-  }
-  __ SmiUntagField(kScratchRegister,
-                   FieldOperand(kScratchRegister, FixedArray::kLengthOffset));
-  __ cmpl(index, kScratchRegister);
-  __ EmitEagerDeoptIf(above_equal, DeoptimizeReason::kOutOfBounds, this);
-}
-
-void CheckedInternalizedString::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  set_temporaries_needed(1);
-  DefineSameAsFirst(this);
-}
-void CheckedInternalizedString::GenerateCode(MaglevAssembler* masm,
-                                             const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register map_tmp = temps.Acquire();
-  Register object = ToRegister(object_input());
-
-  if (check_type_ == CheckType::kOmitHeapObjectCheck) {
-    __ AssertNotSmi(object);
-  } else {
-    Condition is_smi = __ CheckSmi(object);
-    __ EmitEagerDeoptIf(is_smi, DeoptimizeReason::kWrongMap, this);
-  }
-
-  __ LoadMap(map_tmp, object);
-  __ RecordComment("Test IsInternalizedString");
-  // Go to the slow path if this is a non-string, or a non-internalised string.
-  __ testw(FieldOperand(map_tmp, Map::kInstanceTypeOffset),
-           Immediate(kIsNotStringMask | kIsNotInternalizedMask));
-  static_assert((kStringTag | kInternalizedTag) == 0);
-  ZoneLabelRef done(masm);
-  __ JumpToDeferredIf(
-      not_zero,
-      [](MaglevAssembler* masm, ZoneLabelRef done, Register object,
-         CheckedInternalizedString* node, EagerDeoptInfo* deopt_info,
-         Register map_tmp) {
-        __ RecordComment("Deferred Test IsThinString");
-        __ movw(map_tmp, FieldOperand(map_tmp, Map::kInstanceTypeOffset));
-        __ cmpw(map_tmp, Immediate(THIN_STRING_TYPE));
-        // Deopt if this isn't a thin string.
-        __ EmitEagerDeoptIf(not_equal, DeoptimizeReason::kWrongMap, node);
-        __ LoadTaggedField(object,
-                           FieldOperand(object, ThinString::kActualOffset));
-        if (v8_flags.debug_code) {
-          __ RecordComment("DCHECK IsInternalizedString");
-          __ LoadMap(map_tmp, object);
-          __ testw(FieldOperand(map_tmp, Map::kInstanceTypeOffset),
-                   Immediate(kIsNotStringMask | kIsNotInternalizedMask));
-          static_assert((kStringTag | kInternalizedTag) == 0);
-          __ Check(zero, AbortReason::kUnexpectedValue);
-        }
-        __ jmp(*done);
-      },
-      done, object, this, eager_deopt_info(), map_tmp);
-  __ bind(*done);
-}
-
 int CheckedObjectToIndex::MaxCallStackArgs() const {
   return MaglevAssembler::ArgumentStackSlotsForCFunctionCall(1);
 }
-void CheckedObjectToIndex::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  DefineAsRegister(this);
-  set_double_temporaries_needed(1);
-}
-void CheckedObjectToIndex::GenerateCode(MaglevAssembler* masm,
-                                        const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register result_reg = ToRegister(result());
-
-  ZoneLabelRef done(masm);
-  Condition is_smi = __ CheckSmi(object);
-  __ JumpToDeferredIf(
-      NegateCondition(is_smi),
-      [](MaglevAssembler* masm, Register object, Register result_reg,
-         ZoneLabelRef done, CheckedObjectToIndex* node) {
-        Label is_string;
-        __ LoadMap(kScratchRegister, object);
-        __ CmpInstanceTypeRange(kScratchRegister, kScratchRegister,
-                                FIRST_STRING_TYPE, LAST_STRING_TYPE);
-        __ j(below_equal, &is_string);
-
-        __ cmpw(kScratchRegister, Immediate(HEAP_NUMBER_TYPE));
-        // The IC will go generic if it encounters something other than a
-        // Number or String key.
-        __ EmitEagerDeoptIf(not_equal, DeoptimizeReason::kNotInt32, node);
-
-        // Heap Number.
-        {
-          MaglevAssembler::ScratchRegisterScope temps(masm);
-          DoubleRegister number_value = temps.AcquireDouble();
-          DoubleRegister converted_back = kScratchDoubleReg;
-          // Load the heap number value into a double register.
-          __ Movsd(number_value,
-                   FieldOperand(object, HeapNumber::kValueOffset));
-          // Convert the input float64 value to int32.
-          __ Cvttsd2si(result_reg, number_value);
-          // Convert that int32 value back to float64.
-          __ Cvtlsi2sd(converted_back, result_reg);
-          // Check that the result of the float64->int32->float64 is equal to
-          // the input (i.e. that the conversion didn't truncate.
-          __ Ucomisd(number_value, converted_back);
-          __ EmitEagerDeoptIf(parity_even, DeoptimizeReason::kNotInt32, node);
-          __ j(equal, *done);
-          __ EmitEagerDeopt(node, DeoptimizeReason::kNotInt32);
-        }
-
-        // String.
-        __ bind(&is_string);
-        {
-          RegisterSnapshot snapshot = node->register_snapshot();
-          snapshot.live_registers.clear(result_reg);
-          DCHECK(!snapshot.live_tagged_registers.has(result_reg));
-          {
-            SaveRegisterStateForCall save_register_state(masm, snapshot);
-            AllowExternalCallThatCantCauseGC scope(masm);
-            __ PrepareCallCFunction(1);
-            __ Move(arg_reg_1, object);
-            __ CallCFunction(
-                ExternalReference::string_to_array_index_function(), 1);
-            // No need for safepoint since this is a fast C call.
-            __ Move(result_reg, kReturnRegister0);
-          }
-          __ cmpl(result_reg, Immediate(0));
-          __ j(greater_equal, *done);
-          __ EmitEagerDeopt(node, DeoptimizeReason::kNotInt32);
-        }
-      },
-      object, result_reg, done, this);
-
-  // If we didn't enter the deferred block, we're a Smi.
-  if (result_reg == object) {
-    __ SmiToInt32(result_reg);
-  } else {
-    __ SmiToInt32(result_reg, object);
-  }
-
-  __ bind(*done);
-}
 
 int BuiltinStringFromCharCode::MaxCallStackArgs() const {
   return AllocateDescriptor::GetStackParameterCount();
@@ -559,491 +158,6 @@ void BuiltinStringPrototypeCharCodeOrCodePointAt::GenerateCode(
   __ bind(*done);
 }
 
-void LoadFixedArrayElement::SetValueLocationConstraints() {
-  UseRegister(elements_input());
-  UseRegister(index_input());
-  DefineAsRegister(this);
-}
-void LoadFixedArrayElement::GenerateCode(MaglevAssembler* masm,
-                                         const ProcessingState& state) {
-  Register elements = ToRegister(elements_input());
-  Register index = ToRegister(index_input());
-  Register result_reg = ToRegister(result());
-  if (v8_flags.debug_code) {
-    __ AssertNotSmi(elements);
-    __ CmpObjectType(elements, FIXED_ARRAY_TYPE, kScratchRegister);
-    __ Assert(equal, AbortReason::kUnexpectedValue);
-    __ cmpq(index, Immediate(0));
-    __ Assert(above_equal, AbortReason::kUnexpectedNegativeValue);
-  }
-  if (this->decompresses_tagged_result()) {
-    __ DecompressTagged(result_reg,
-                        FieldOperand(elements, index, times_tagged_size,
-                                     FixedArray::kHeaderSize));
-  } else {
-    __ mov_tagged(result_reg, FieldOperand(elements, index, times_tagged_size,
-                                           FixedArray::kHeaderSize));
-  }
-}
-
-void LoadFixedDoubleArrayElement::SetValueLocationConstraints() {
-  UseRegister(elements_input());
-  UseRegister(index_input());
-  DefineAsRegister(this);
-}
-void LoadFixedDoubleArrayElement::GenerateCode(MaglevAssembler* masm,
-                                               const ProcessingState& state) {
-  Register elements = ToRegister(elements_input());
-  Register index = ToRegister(index_input());
-  DoubleRegister result_reg = ToDoubleRegister(result());
-  if (v8_flags.debug_code) {
-    __ AssertNotSmi(elements);
-    __ CmpObjectType(elements, FIXED_DOUBLE_ARRAY_TYPE, kScratchRegister);
-    __ Assert(equal, AbortReason::kUnexpectedValue);
-    __ cmpq(index, Immediate(0));
-    __ Assert(above_equal, AbortReason::kUnexpectedNegativeValue);
-  }
-  __ Movsd(result_reg, FieldOperand(elements, index, times_8,
-                                    FixedDoubleArray::kHeaderSize));
-}
-
-void StoreFixedDoubleArrayElement::SetValueLocationConstraints() {
-  UseRegister(elements_input());
-  UseRegister(index_input());
-  UseRegister(value_input());
-}
-void StoreFixedDoubleArrayElement::GenerateCode(MaglevAssembler* masm,
-                                                const ProcessingState& state) {
-  Register elements = ToRegister(elements_input());
-  Register index = ToRegister(index_input());
-  DoubleRegister value = ToDoubleRegister(value_input());
-  if (v8_flags.debug_code) {
-    __ AssertNotSmi(elements);
-    __ CmpObjectType(elements, FIXED_DOUBLE_ARRAY_TYPE, kScratchRegister);
-    __ Assert(equal, AbortReason::kUnexpectedValue);
-    __ cmpq(index, Immediate(0));
-    __ Assert(above_equal, AbortReason::kUnexpectedNegativeValue);
-  }
-  __ Movsd(
-      FieldOperand(elements, index, times_8, FixedDoubleArray::kHeaderSize),
-      value);
-}
-
-void LoadSignedIntDataViewElement::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(index_input());
-  if (is_little_endian_constant() ||
-      type_ == ExternalArrayType::kExternalInt8Array) {
-    UseAny(is_little_endian_input());
-  } else {
-    UseRegister(is_little_endian_input());
-  }
-  set_temporaries_needed(1);
-  DefineAsRegister(this);
-}
-void LoadSignedIntDataViewElement::GenerateCode(MaglevAssembler* masm,
-                                                const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
-  Register result_reg = ToRegister(result());
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register data_pointer = temps.Acquire();
-
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CmpObjectType(object, JS_DATA_VIEW_TYPE, kScratchRegister);
-    __ Assert(above_equal, AbortReason::kUnexpectedValue);
-  }
-
-  // Load data pointer.
-  __ LoadExternalPointerField(
-      data_pointer, FieldOperand(object, JSDataView::kDataPointerOffset));
-
-  int element_size = ExternalArrayElementSize(type_);
-  __ LoadSignedField(result_reg, Operand(data_pointer, index, times_1, 0),
-                     element_size);
-
-  // We ignore little endian argument if type is a byte size.
-  if (type_ != ExternalArrayType::kExternalInt8Array) {
-    if (is_little_endian_constant()) {
-      if (!FromConstantToBool(masm, is_little_endian_input().node())) {
-        __ ReverseByteOrder(result_reg, element_size);
-      }
-    } else {
-      ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
-      __ ToBoolean(ToRegister(is_little_endian_input()), is_little_endian,
-                   is_big_endian, false);
-      __ bind(*is_big_endian);
-      __ ReverseByteOrder(result_reg, element_size);
-      __ bind(*is_little_endian);
-      // x64 is little endian.
-      static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
-    }
-  }
-}
-
-void StoreSignedIntDataViewElement::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(index_input());
-  if (ExternalArrayElementSize(type_) > 1) {
-    UseAndClobberRegister(value_input());
-  } else {
-    UseRegister(value_input());
-  }
-  if (is_little_endian_constant() ||
-      type_ == ExternalArrayType::kExternalInt8Array) {
-    UseAny(is_little_endian_input());
-  } else {
-    UseRegister(is_little_endian_input());
-  }
-  set_temporaries_needed(1);
-}
-void StoreSignedIntDataViewElement::GenerateCode(MaglevAssembler* masm,
-                                                 const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
-  Register value = ToRegister(value_input());
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register data_pointer = temps.Acquire();
-
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CmpObjectType(object, JS_DATA_VIEW_TYPE, kScratchRegister);
-    __ Assert(above_equal, AbortReason::kUnexpectedValue);
-  }
-
-  // Load data pointer.
-  __ LoadExternalPointerField(
-      data_pointer, FieldOperand(object, JSDataView::kDataPointerOffset));
-
-  int element_size = ExternalArrayElementSize(type_);
-
-  // We ignore little endian argument if type is a byte size.
-  if (element_size > 1) {
-    if (is_little_endian_constant()) {
-      if (!FromConstantToBool(masm, is_little_endian_input().node())) {
-        __ ReverseByteOrder(value, element_size);
-      }
-    } else {
-      ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
-      __ ToBoolean(ToRegister(is_little_endian_input()), is_little_endian,
-                   is_big_endian, false);
-      __ bind(*is_big_endian);
-      __ ReverseByteOrder(value, element_size);
-      __ bind(*is_little_endian);
-      // x64 is little endian.
-      static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
-    }
-  }
-
-  __ StoreField(Operand(data_pointer, index, times_1, 0), value, element_size);
-}
-
-void LoadDoubleDataViewElement::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(index_input());
-  if (is_little_endian_constant()) {
-    UseAny(is_little_endian_input());
-  } else {
-    UseRegister(is_little_endian_input());
-  }
-  set_temporaries_needed(1);
-  DefineAsRegister(this);
-}
-void LoadDoubleDataViewElement::GenerateCode(MaglevAssembler* masm,
-                                             const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
-  DoubleRegister result_reg = ToDoubleRegister(result());
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register data_pointer = temps.Acquire();
-
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CmpObjectType(object, JS_DATA_VIEW_TYPE, kScratchRegister);
-    __ Assert(above_equal, AbortReason::kUnexpectedValue);
-  }
-
-  // Load data pointer.
-  __ LoadExternalPointerField(
-      data_pointer, FieldOperand(object, JSDataView::kDataPointerOffset));
-
-  if (is_little_endian_constant()) {
-    if (FromConstantToBool(masm, is_little_endian_input().node())) {
-      __ Movsd(result_reg, Operand(data_pointer, index, times_1, 0));
-    } else {
-      __ movq(kScratchRegister, Operand(data_pointer, index, times_1, 0));
-      __ bswapq(kScratchRegister);
-      __ Movq(result_reg, kScratchRegister);
-    }
-  } else {
-    Label done;
-    ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
-    // TODO(leszeks): We're likely to be calling this on an existing boolean --
-    // maybe that's a case we should fast-path here and re-use that boolean
-    // value?
-    __ ToBoolean(ToRegister(is_little_endian_input()), is_little_endian,
-                 is_big_endian, true);
-    // x64 is little endian.
-    static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
-    __ bind(*is_little_endian);
-    __ Movsd(result_reg, Operand(data_pointer, index, times_1, 0));
-    __ jmp(&done);
-    // We should swap the bytes if big endian.
-    __ bind(*is_big_endian);
-    __ movq(kScratchRegister, Operand(data_pointer, index, times_1, 0));
-    __ bswapq(kScratchRegister);
-    __ Movq(result_reg, kScratchRegister);
-    __ bind(&done);
-  }
-}
-
-void StoreDoubleDataViewElement::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(index_input());
-  UseRegister(value_input());
-  if (is_little_endian_constant()) {
-    UseAny(is_little_endian_input());
-  } else {
-    UseRegister(is_little_endian_input());
-  }
-  set_temporaries_needed(1);
-}
-void StoreDoubleDataViewElement::GenerateCode(MaglevAssembler* masm,
-                                              const ProcessingState& state) {
-  Register object = ToRegister(object_input());
-  Register index = ToRegister(index_input());
-  DoubleRegister value = ToDoubleRegister(value_input());
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register data_pointer = temps.Acquire();
-
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CmpObjectType(object, JS_DATA_VIEW_TYPE, kScratchRegister);
-    __ Assert(above_equal, AbortReason::kUnexpectedValue);
-  }
-
-  // Load data pointer.
-  __ LoadExternalPointerField(
-      data_pointer, FieldOperand(object, JSDataView::kDataPointerOffset));
-
-  if (is_little_endian_constant()) {
-    if (FromConstantToBool(masm, is_little_endian_input().node())) {
-      __ Movsd(Operand(data_pointer, index, times_1, 0), value);
-    } else {
-      __ Movq(kScratchRegister, value);
-      __ bswapq(kScratchRegister);
-      __ movq(Operand(data_pointer, index, times_1, 0), kScratchRegister);
-    }
-  } else {
-    Label done;
-    ZoneLabelRef is_little_endian(masm), is_big_endian(masm);
-    // TODO(leszeks): We're likely to be calling this on an existing boolean --
-    // maybe that's a case we should fast-path here and re-use that boolean
-    // value?
-    __ ToBoolean(ToRegister(is_little_endian_input()), is_little_endian,
-                 is_big_endian, true);
-    // x64 is little endian.
-    static_assert(V8_TARGET_LITTLE_ENDIAN == 1);
-    __ bind(*is_little_endian);
-    __ Movsd(Operand(data_pointer, index, times_1, 0), value);
-    __ jmp(&done);
-    // We should swap the bytes if big endian.
-    __ bind(*is_big_endian);
-    __ Movq(kScratchRegister, value);
-    __ bswapq(kScratchRegister);
-    __ movq(Operand(data_pointer, index, times_1, 0), kScratchRegister);
-    __ bind(&done);
-  }
-}
-
-namespace {
-
-template <bool check_detached, typename ResultReg, typename NodeT>
-void GenerateTypedArrayLoad(MaglevAssembler* masm, NodeT* node, Register object,
-                            Register index, ResultReg result_reg,
-                            Register scratch, ElementsKind kind) {
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CmpObjectType(object, JS_TYPED_ARRAY_TYPE, kScratchRegister);
-    __ Assert(equal, AbortReason::kUnexpectedValue);
-  }
-
-  if constexpr (check_detached) {
-    __ DeoptIfBufferDetached(object, scratch, node);
-  }
-
-  Register data_pointer = scratch;
-  __ BuildTypedArrayDataPointer(data_pointer, object);
-
-  if constexpr (std::is_same_v<ResultReg, Register>) {
-    if (IsSignedIntTypedArrayElementsKind(kind)) {
-      int element_size = ElementsKindSize(kind);
-      __ LoadSignedField(
-          result_reg,
-          Operand(data_pointer, index, ScaleFactorFromInt(element_size), 0),
-          element_size);
-    } else {
-      DCHECK(IsUnsignedIntTypedArrayElementsKind(kind));
-      int element_size = ElementsKindSize(kind);
-      __ LoadUnsignedField(
-          result_reg,
-          Operand(data_pointer, index, ScaleFactorFromInt(element_size), 0),
-          element_size);
-    }
-  } else {
-#ifdef DEBUG
-    bool result_reg_is_double = std::is_same_v<ResultReg, DoubleRegister>;
-    DCHECK(result_reg_is_double);
-    DCHECK(IsFloatTypedArrayElementsKind(kind));
-#endif
-    switch (kind) {
-      case FLOAT32_ELEMENTS:
-        __ Movss(result_reg, Operand(data_pointer, index, times_4, 0));
-        __ Cvtss2sd(result_reg, result_reg);
-        break;
-      case FLOAT64_ELEMENTS:
-        __ Movsd(result_reg, Operand(data_pointer, index, times_8, 0));
-        break;
-      default:
-        UNREACHABLE();
-    }
-  }
-}
-
-template <bool check_detached, typename ValueReg, typename NodeT>
-void GenerateTypedArrayStore(MaglevAssembler* masm, NodeT* node,
-                             Register object, Register index, ValueReg value,
-                             Register scratch, ElementsKind kind) {
-  __ AssertNotSmi(object);
-  if (v8_flags.debug_code) {
-    __ CmpObjectType(object, JS_TYPED_ARRAY_TYPE, kScratchRegister);
-    __ Assert(equal, AbortReason::kUnexpectedValue);
-  }
-
-  if constexpr (check_detached) {
-    __ DeoptIfBufferDetached(object, scratch, node);
-  }
-
-  Register data_pointer = scratch;
-  __ BuildTypedArrayDataPointer(data_pointer, object);
-
-  if constexpr (std::is_same_v<ValueReg, Register>) {
-    int element_size = ElementsKindSize(kind);
-    __ StoreField(
-        Operand(data_pointer, index, ScaleFactorFromInt(element_size), 0),
-        value, element_size);
-  } else {
-#ifdef DEBUG
-    bool value_is_double = std::is_same_v<ValueReg, DoubleRegister>;
-    DCHECK(value_is_double);
-    DCHECK(IsFloatTypedArrayElementsKind(kind));
-#endif
-    switch (kind) {
-      case FLOAT32_ELEMENTS:
-        __ Cvtsd2ss(kScratchDoubleReg, value);
-        __ Movss(Operand(data_pointer, index, times_4, 0), kScratchDoubleReg);
-        break;
-      case FLOAT64_ELEMENTS:
-        __ Movsd(Operand(data_pointer, index, times_8, 0), value);
-        break;
-      default:
-        UNREACHABLE();
-    }
-  }
-}
-
-}  // namespace
-
-#define DEF_LOAD_TYPED_ARRAY(Name, ResultReg, ToResultReg, check_detached) \
-  void Name::SetValueLocationConstraints() {                               \
-    UseRegister(object_input());                                           \
-    UseRegister(index_input());                                            \
-    DefineAsRegister(this);                                                \
-    set_temporaries_needed(1);                                             \
-  }                                                                        \
-  void Name::GenerateCode(MaglevAssembler* masm,                           \
-                          const ProcessingState& state) {                  \
-    Register object = ToRegister(object_input());                          \
-    Register index = ToRegister(index_input());                            \
-    ResultReg result_reg = ToResultReg(result());                          \
-    MaglevAssembler::ScratchRegisterScope temps(masm);                     \
-    Register scratch = temps.Acquire();                                    \
-                                                                           \
-    GenerateTypedArrayLoad<check_detached>(                                \
-        masm, this, object, index, result_reg, scratch, elements_kind_);   \
-  }
-
-DEF_LOAD_TYPED_ARRAY(LoadSignedIntTypedArrayElement, Register, ToRegister,
-                     /*check_detached*/ true)
-DEF_LOAD_TYPED_ARRAY(LoadSignedIntTypedArrayElementNoDeopt, Register,
-                     ToRegister,
-                     /*check_detached*/ false)
-
-DEF_LOAD_TYPED_ARRAY(LoadUnsignedIntTypedArrayElement, Register, ToRegister,
-                     /*check_detached*/ true)
-DEF_LOAD_TYPED_ARRAY(LoadUnsignedIntTypedArrayElementNoDeopt, Register,
-                     ToRegister,
-                     /*check_detached*/ false)
-
-DEF_LOAD_TYPED_ARRAY(LoadDoubleTypedArrayElement, DoubleRegister,
-                     ToDoubleRegister,
-                     /*check_detached*/ true)
-DEF_LOAD_TYPED_ARRAY(LoadDoubleTypedArrayElementNoDeopt, DoubleRegister,
-                     ToDoubleRegister, /*check_detached*/ false)
-
-#undef DEF_LOAD_TYPED_ARRAY
-
-#define DEF_STORE_TYPED_ARRAY(Name, ValueReg, ToValueReg, check_detached)     \
-  void Name::SetValueLocationConstraints() {                                  \
-    UseRegister(object_input());                                              \
-    UseRegister(index_input());                                               \
-    UseRegister(value_input());                                               \
-    set_temporaries_needed(1);                                                \
-  }                                                                           \
-  void Name::GenerateCode(MaglevAssembler* masm,                              \
-                          const ProcessingState& state) {                     \
-    Register object = ToRegister(object_input());                             \
-    Register index = ToRegister(index_input());                               \
-    ValueReg value = ToValueReg(value_input());                               \
-    MaglevAssembler::ScratchRegisterScope temps(masm);                        \
-    Register scratch = temps.Acquire();                                       \
-                                                                              \
-    GenerateTypedArrayStore<check_detached>(masm, this, object, index, value, \
-                                            scratch, elements_kind_);         \
-  }
-
-DEF_STORE_TYPED_ARRAY(StoreIntTypedArrayElement, Register, ToRegister,
-                      /*check_detached*/ true)
-DEF_STORE_TYPED_ARRAY(StoreIntTypedArrayElementNoDeopt, Register, ToRegister,
-                      /*check_detached*/ false)
-
-DEF_STORE_TYPED_ARRAY(StoreDoubleTypedArrayElement, DoubleRegister,
-                      ToDoubleRegister,
-                      /*check_detached*/ true)
-DEF_STORE_TYPED_ARRAY(StoreDoubleTypedArrayElementNoDeopt, DoubleRegister,
-                      ToDoubleRegister, /*check_detached*/ false)
-
-#undef DEF_STORE_TYPED_ARRAY
-
-void StoreDoubleField::SetValueLocationConstraints() {
-  UseRegister(object_input());
-  UseRegister(value_input());
-  set_temporaries_needed(1);
-}
-void StoreDoubleField::GenerateCode(MaglevAssembler* masm,
-                                    const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register tmp = temps.Acquire();
-  Register object = ToRegister(object_input());
-  DoubleRegister value = ToDoubleRegister(value_input());
-
-  __ AssertNotSmi(object);
-  __ DecompressTagged(tmp, FieldOperand(object, offset()));
-  __ AssertNotSmi(tmp);
-  __ Movsd(FieldOperand(tmp, HeapNumber::kValueOffset), value);
-}
-
 void Int32AddWithOverflow::SetValueLocationConstraints() {
   UseRegister(left_input());
   UseRegister(right_input());
@@ -1179,8 +293,8 @@ void Int32ModulusWithOverflow::GenerateCode(MaglevAssembler* masm,
       [](MaglevAssembler* masm, ZoneLabelRef rhs_checked, Register rhs,
          Int32ModulusWithOverflow* node) {
         __ negl(rhs);
-        __ EmitEagerDeoptIf(zero, deopt_reason, node);
-        __ jmp(*rhs_checked);
+        __ j(not_zero, *rhs_checked);
+        __ EmitEagerDeopt(node, deopt_reason);
       },
       rhs_checked, rhs, this);
   __ bind(*rhs_checked);
@@ -1196,12 +310,11 @@ void Int32ModulusWithOverflow::GenerateCode(MaglevAssembler* masm,
         __ negl(rax);
         __ xorl(rdx, rdx);
         __ divl(rhs);
-        __ testl(rdx, rdx);
+        __ negl(rdx);
+        __ j(not_zero, *done);
         // TODO(victorgomes): This ideally should be kMinusZero, but Maglev only
         // allows one deopt reason per IR.
-        __ EmitEagerDeoptIf(equal, deopt_reason, node);
-        __ negl(rdx);
-        __ jmp(*done);
+        __ EmitEagerDeopt(node, deopt_reason);
       },
       done, lhs, rhs, this);
 
@@ -1599,449 +712,19 @@ void Float64Ieee754Unary::GenerateCode(MaglevAssembler* masm,
   __ CallCFunction(ieee_function_, 1);
 }
 
-void Float64SilenceNaN::SetValueLocationConstraints() {
+void HoleyFloat64ToMaybeNanFloat64::SetValueLocationConstraints() {
   UseRegister(input());
   DefineSameAsFirst(this);
 }
-
-void Float64SilenceNaN::GenerateCode(MaglevAssembler* masm,
-                                     const ProcessingState& state) {
+void HoleyFloat64ToMaybeNanFloat64::GenerateCode(MaglevAssembler* masm,
+                                                 const ProcessingState& state) {
   DoubleRegister value = ToDoubleRegister(input());
+  // The hole value is a signalling NaN, so just silence it to get the float64
+  // value.
   __ Xorpd(kScratchDoubleReg, kScratchDoubleReg);
   __ Subsd(value, kScratchDoubleReg);
 }
 
-template <class Derived, Operation kOperation>
-void Float64CompareNode<Derived, kOperation>::SetValueLocationConstraints() {
-  UseRegister(left_input());
-  UseRegister(right_input());
-  DefineAsRegister(this);
-}
-
-template <class Derived, Operation kOperation>
-void Float64CompareNode<Derived, kOperation>::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  DoubleRegister left = ToDoubleRegister(left_input());
-  DoubleRegister right = ToDoubleRegister(right_input());
-  Register result = ToRegister(this->result());
-  Label is_false, end;
-  __ Ucomisd(left, right);
-  // Ucomisd sets these flags accordingly:
-  //   UNORDERED(one of the operands is a NaN): ZF,PF,CF := 111;
-  //   GREATER_THAN: ZF,PF,CF := 000;
-  //   LESS_THAN: ZF,PF,CF := 001;
-  //   EQUAL: ZF,PF,CF := 100;
-  // Since ZF can be set by NaN or EQUAL, we check for NaN first.
-  __ j(parity_even, &is_false);
-  __ j(NegateCondition(ConditionForFloat64(kOperation)), &is_false);
-  // TODO(leszeks): Investigate loading existing materialisations of roots here,
-  // if available.
-  __ LoadRoot(result, RootIndex::kTrueValue);
-  __ jmp(&end);
-  {
-    __ bind(&is_false);
-    __ LoadRoot(result, RootIndex::kFalseValue);
-  }
-  __ bind(&end);
-}
-
-#define DEF_OPERATION(Name)                               \
-  void Name::SetValueLocationConstraints() {              \
-    Base::SetValueLocationConstraints();                  \
-  }                                                       \
-  void Name::GenerateCode(MaglevAssembler* masm,          \
-                          const ProcessingState& state) { \
-    Base::GenerateCode(masm, state);                      \
-  }
-DEF_OPERATION(Float64Equal)
-DEF_OPERATION(Float64StrictEqual)
-DEF_OPERATION(Float64LessThan)
-DEF_OPERATION(Float64LessThanOrEqual)
-DEF_OPERATION(Float64GreaterThan)
-DEF_OPERATION(Float64GreaterThanOrEqual)
-#undef DEF_OPERATION
-
-void CheckInt32IsSmi::SetValueLocationConstraints() { UseRegister(input()); }
-void CheckInt32IsSmi::GenerateCode(MaglevAssembler* masm,
-                                   const ProcessingState& state) {
-  // TODO(leszeks): This basically does a SmiTag and throws the result away.
-  // Don't throw the result away if we want to actually use it.
-  Register reg = ToRegister(input());
-  __ movl(kScratchRegister, reg);
-  __ addl(kScratchRegister, kScratchRegister);
-  DCHECK_REGLIST_EMPTY(RegList{reg} &
-                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
-  __ EmitEagerDeoptIf(overflow, DeoptimizeReason::kNotASmi, this);
-}
-
-void CheckedSmiTagInt32::SetValueLocationConstraints() {
-  UseAndClobberRegister(input());
-  DefineSameAsFirst(this);
-}
-void CheckedSmiTagInt32::GenerateCode(MaglevAssembler* masm,
-                                      const ProcessingState& state) {
-  Register reg = ToRegister(input());
-  __ addl(reg, reg);
-  // None of the mutated input registers should be a register input into the
-  // eager deopt info.
-  DCHECK_REGLIST_EMPTY(RegList{reg} &
-                       GetGeneralRegistersUsedAsInputs(eager_deopt_info()));
-  __ EmitEagerDeoptIf(overflow, DeoptimizeReason::kOverflow, this);
-}
-
-void CheckedSmiTagUint32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void CheckedSmiTagUint32::GenerateCode(MaglevAssembler* masm,
-                                       const ProcessingState& state) {
-  Register reg = ToRegister(input());
-  // Perform an unsigned comparison against Smi::kMaxValue.
-  __ cmpl(reg, Immediate(Smi::kMaxValue));
-  __ EmitEagerDeoptIf(above, DeoptimizeReason::kOverflow, this);
-  __ addl(reg, reg);
-  __ Assert(no_overflow, AbortReason::kInputDoesNotFitSmi);
-}
-
-void UnsafeSmiTag::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void UnsafeSmiTag::GenerateCode(MaglevAssembler* masm,
-                                const ProcessingState& state) {
-  Register reg = ToRegister(input());
-  if (v8_flags.debug_code) {
-    if (input().node()->properties().value_representation() ==
-        ValueRepresentation::kUint32) {
-      __ cmpl(reg, Immediate(Smi::kMaxValue));
-      __ Check(below_equal, AbortReason::kInputDoesNotFitSmi);
-    }
-  }
-  __ addl(reg, reg);
-  if (v8_flags.debug_code) {
-    __ Check(no_overflow, AbortReason::kInputDoesNotFitSmi);
-  }
-}
-
-void Int32ToNumber::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void Int32ToNumber::GenerateCode(MaglevAssembler* masm,
-                                 const ProcessingState& state) {
-  ZoneLabelRef done(masm);
-  Register value = ToRegister(input());
-  Register object = ToRegister(result());
-  __ movl(kScratchRegister, value);
-  __ addl(kScratchRegister, kScratchRegister);
-  __ JumpToDeferredIf(
-      overflow,
-      [](MaglevAssembler* masm, Register object, Register value,
-         ZoneLabelRef done, Int32ToNumber* node) {
-        DoubleRegister double_value = kScratchDoubleReg;
-        __ Cvtlsi2sd(double_value, value);
-        __ AllocateHeapNumber(node->register_snapshot(), object, double_value);
-        __ jmp(*done);
-      },
-      object, value, done, this);
-  __ Move(object, kScratchRegister);
-  __ bind(*done);
-}
-
-void Uint32ToNumber::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void Uint32ToNumber::GenerateCode(MaglevAssembler* masm,
-                                  const ProcessingState& state) {
-  ZoneLabelRef done(masm);
-  Register value = ToRegister(input());
-  Register object = ToRegister(result());
-  __ cmpl(value, Immediate(Smi::kMaxValue));
-  __ JumpToDeferredIf(
-      above,
-      [](MaglevAssembler* masm, Register object, Register value,
-         ZoneLabelRef done, Uint32ToNumber* node) {
-        DoubleRegister double_value = kScratchDoubleReg;
-        __ Cvtlui2sd(double_value, value);
-        __ AllocateHeapNumber(node->register_snapshot(), object, double_value);
-        __ jmp(*done);
-      },
-      object, value, done, this);
-  __ addl(value, value);
-  DCHECK_EQ(object, value);
-  __ bind(*done);
-}
-
-namespace {
-
-void JumpToFailIfNotHeapNumberOrOddball(
-    MaglevAssembler* masm, Register value,
-    TaggedToFloat64ConversionType conversion_type, Label* fail) {
-  switch (conversion_type) {
-    case TaggedToFloat64ConversionType::kNumberOrOddball:
-      // Check if HeapNumber or Oddball, jump to fail otherwise.
-      static_assert(InstanceType::HEAP_NUMBER_TYPE + 1 ==
-                    InstanceType::ODDBALL_TYPE);
-      if (fail) {
-        __ CompareObjectTypeRange(value, InstanceType::HEAP_NUMBER_TYPE,
-                                  InstanceType::ODDBALL_TYPE);
-        __ JumpIf(kUnsignedGreaterThan, fail);
-      } else {
-        if (v8_flags.debug_code) {
-          __ CompareObjectTypeRange(value, InstanceType::HEAP_NUMBER_TYPE,
-                                    InstanceType::ODDBALL_TYPE);
-          __ Assert(kUnsignedLessThanEqual, AbortReason::kUnexpectedValue);
-        }
-      }
-      break;
-    case TaggedToFloat64ConversionType::kNumber:
-      // Check if HeapNumber, jump to fail otherwise.
-      if (fail) {
-        __ IsObjectType(value, InstanceType::HEAP_NUMBER_TYPE);
-        __ JumpIf(kNotEqual, fail);
-      } else {
-        if (v8_flags.debug_code) {
-          __ IsObjectType(value, InstanceType::HEAP_NUMBER_TYPE);
-          __ Assert(kEqual, AbortReason::kUnexpectedValue);
-        }
-      }
-      break;
-  }
-}
-
-void TryUnboxNumberOrOddball(MaglevAssembler* masm, DoubleRegister dst,
-                             Register clobbered_src,
-                             TaggedToFloat64ConversionType conversion_type,
-                             Label* fail) {
-  Label is_not_smi, done;
-  // Check if Smi.
-  __ JumpIfNotSmi(clobbered_src, &is_not_smi, Label::kNear);
-  // If Smi, convert to Float64.
-  __ SmiToInt32(clobbered_src);
-  __ Cvtlsi2sd(dst, clobbered_src);
-  __ jmp(&done, Label::kNear);
-  __ bind(&is_not_smi);
-  JumpToFailIfNotHeapNumberOrOddball(masm, clobbered_src, conversion_type,
-                                     fail);
-  static_assert(HeapNumber::kValueOffset == Oddball::kToNumberRawOffset);
-  __ LoadHeapNumberValue(dst, clobbered_src);
-  __ bind(&done);
-}
-
-}  // namespace
-
-void CheckedNumberOrOddballToFloat64::SetValueLocationConstraints() {
-  UseAndClobberRegister(input());
-  DefineAsRegister(this);
-}
-void CheckedNumberOrOddballToFloat64::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register value = ToRegister(input());
-  TryUnboxNumberOrOddball(
-      masm, ToDoubleRegister(result()), value, conversion_type(),
-      __ GetDeoptLabel(this, DeoptimizeReason::kNotANumberOrOddball));
-}
-
-void UncheckedNumberOrOddballToFloat64::SetValueLocationConstraints() {
-  UseAndClobberRegister(input());
-  DefineAsRegister(this);
-}
-void UncheckedNumberOrOddballToFloat64::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register value = ToRegister(input());
-  TryUnboxNumberOrOddball(masm, ToDoubleRegister(result()), value,
-                          conversion_type(), nullptr);
-}
-
-namespace {
-
-void EmitTruncateNumberOrOddballToInt32(
-    MaglevAssembler* masm, Register value, Register result_reg,
-    TaggedToFloat64ConversionType conversion_type, Label* not_a_number) {
-  Label is_not_smi, done;
-  // Check if Smi.
-  __ JumpIfNotSmi(value, &is_not_smi, Label::kNear);
-  // If Smi, convert to Int32.
-  __ SmiToInt32(value);
-  __ jmp(&done, Label::kNear);
-  __ bind(&is_not_smi);
-  JumpToFailIfNotHeapNumberOrOddball(masm, value, conversion_type,
-                                     not_a_number);
-  static_assert(HeapNumber::kValueOffset == Oddball::kToNumberRawOffset);
-  auto double_value = kScratchDoubleReg;
-  __ Movsd(double_value, FieldOperand(value, HeapNumber::kValueOffset));
-  __ TruncateDoubleToInt32(result_reg, double_value);
-  __ bind(&done);
-}
-
-}  // namespace
-
-void CheckedTruncateNumberOrOddballToInt32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void CheckedTruncateNumberOrOddballToInt32::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register value = ToRegister(input());
-  Register result_reg = ToRegister(result());
-  DCHECK_EQ(value, result_reg);
-  Label* deopt_label =
-      __ GetDeoptLabel(this, DeoptimizeReason::kNotANumberOrOddball);
-  EmitTruncateNumberOrOddballToInt32(masm, value, result_reg, conversion_type(),
-                                     deopt_label);
-}
-
-void TruncateNumberOrOddballToInt32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void TruncateNumberOrOddballToInt32::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  Register value = ToRegister(input());
-  Register result_reg = ToRegister(result());
-  DCHECK_EQ(value, result_reg);
-  EmitTruncateNumberOrOddballToInt32(masm, value, result_reg, conversion_type(),
-                                     nullptr);
-}
-
-void SetPendingMessage::SetValueLocationConstraints() {
-  UseRegister(value());
-  set_temporaries_needed(1);
-  DefineAsRegister(this);
-}
-
-void SetPendingMessage::GenerateCode(MaglevAssembler* masm,
-                                     const ProcessingState& state) {
-  Register new_message = ToRegister(value());
-  Register return_value = ToRegister(result());
-
-  MemOperand pending_message_operand = __ ExternalReferenceAsOperand(
-      ExternalReference::address_of_pending_message(masm->isolate()),
-      kScratchRegister);
-
-  if (new_message != return_value) {
-    __ Move(return_value, pending_message_operand);
-    __ movq(pending_message_operand, new_message);
-  } else {
-    MaglevAssembler::ScratchRegisterScope temps(masm);
-    Register scratch = temps.Acquire();
-    __ Move(scratch, pending_message_operand);
-    __ movq(pending_message_operand, new_message);
-    __ Move(return_value, scratch);
-  }
-}
-
-void TestUndetectable::SetValueLocationConstraints() {
-  UseRegister(value());
-  set_temporaries_needed(1);
-  DefineAsRegister(this);
-}
-void TestUndetectable::GenerateCode(MaglevAssembler* masm,
-                                    const ProcessingState& state) {
-  Register object = ToRegister(value());
-  Register return_value = ToRegister(result());
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-
-  Label return_false, done;
-  __ JumpIfSmi(object, &return_false, Label::kNear);
-  // For heap objects, check the map's undetectable bit.
-  __ LoadMap(scratch, object);
-  __ testl(FieldOperand(scratch, Map::kBitFieldOffset),
-           Immediate(Map::Bits1::IsUndetectableBit::kMask));
-  __ j(zero, &return_false, Label::kNear);
-
-  __ LoadRoot(return_value, RootIndex::kTrueValue);
-  __ jmp(&done, Label::kNear);
-
-  __ bind(&return_false);
-  __ LoadRoot(return_value, RootIndex::kFalseValue);
-
-  __ bind(&done);
-}
-
-void CheckedInt32ToUint32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineSameAsFirst(this);
-}
-void CheckedInt32ToUint32::GenerateCode(MaglevAssembler* masm,
-                                        const ProcessingState& state) {
-  Register input_reg = ToRegister(input());
-  __ testl(input_reg, input_reg);
-  __ EmitEagerDeoptIf(negative, DeoptimizeReason::kNotUint32, this);
-}
-
-void ChangeInt32ToFloat64::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void ChangeInt32ToFloat64::GenerateCode(MaglevAssembler* masm,
-                                        const ProcessingState& state) {
-  __ Cvtlsi2sd(ToDoubleRegister(result()), ToRegister(input()));
-}
-
-void ChangeUint32ToFloat64::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void ChangeUint32ToFloat64::GenerateCode(MaglevAssembler* masm,
-                                         const ProcessingState& state) {
-  // TODO(leszeks): Cvtlui2sd does a manual movl to clear the top bits of the
-  // input register. We could eliminate this movl by ensuring that word32
-  // registers are always written with 32-bit ops and not 64-bit ones.
-  __ Cvtlui2sd(ToDoubleRegister(result()), ToRegister(input()));
-}
-
-void CheckedTruncateFloat64ToUint32::SetValueLocationConstraints() {
-  UseRegister(input());
-  DefineAsRegister(this);
-}
-void CheckedTruncateFloat64ToUint32::GenerateCode(
-    MaglevAssembler* masm, const ProcessingState& state) {
-  DoubleRegister input_reg = ToDoubleRegister(input());
-  Register result_reg = ToRegister(result());
-  DoubleRegister converted_back = kScratchDoubleReg;
-
-  // Convert the input float64 value to uint32.
-  Label* deopt = __ GetDeoptLabel(this, DeoptimizeReason::kNotUint32);
-  __ Cvttsd2ui(result_reg, input_reg, deopt);
-  // Convert that uint32 value back to float64.
-  __ Cvtlui2sd(converted_back, result_reg);
-  // Check that the result of the float64->uint32->float64 is equal to the input
-  // (i.e. that the conversion didn't truncate.
-  __ Ucomisd(input_reg, converted_back);
-  __ EmitEagerDeoptIf(parity_even, DeoptimizeReason::kNotUint32, this);
-  __ EmitEagerDeoptIf(not_equal, DeoptimizeReason::kNotUint32, this);
-
-  // Check if {input} is -0.
-  Label check_done;
-  __ cmpl(result_reg, Immediate(0));
-  __ j(not_equal, &check_done);
-
-  // In case of 0, we need to check the high bits for the IEEE -0 pattern.
-  Register high_word32_of_input = kScratchRegister;
-  __ Pextrd(high_word32_of_input, input_reg, 1);
-  __ cmpl(high_word32_of_input, Immediate(0));
-  __ EmitEagerDeoptIf(less, DeoptimizeReason::kNotUint32, this);
-
-  __ bind(&check_done);
-}
-
-void IncreaseInterruptBudget::SetValueLocationConstraints() {
-  set_temporaries_needed(1);
-}
-void IncreaseInterruptBudget::GenerateCode(MaglevAssembler* masm,
-                                           const ProcessingState& state) {
-  MaglevAssembler::ScratchRegisterScope temps(masm);
-  Register scratch = temps.Acquire();
-  __ movq(scratch, MemOperand(rbp, StandardFrameConstants::kFunctionOffset));
-  __ LoadTaggedField(scratch,
-                     FieldOperand(scratch, JSFunction::kFeedbackCellOffset));
-  __ addl(FieldOperand(scratch, FeedbackCell::kInterruptBudgetOffset),
-          Immediate(amount()));
-}
-
 namespace {
 
 enum class ReduceInterruptBudgetType { kLoop, kReturn };
@@ -2077,65 +760,15 @@ void HandleInterruptsAndTiering(MaglevAssembler* masm, ZoneLabelRef done,
 
   // No pending interrupts. Call into the TieringManager if needed.
   {
-    // Skip the runtime call if the tiering state is kInProgress. The runtime
-    // only performs simple bookkeeping in this case, which we can easily
-    // replicate here in generated code.
-    // TODO(jgruber): Use the correct feedback vector once Maglev inlining is
-    // enabled.
-    Label update_profiler_ticks_and_interrupt_budget;
-    {
-      static_assert(kTieringStateInProgressBlocksTierup);
-      const Register scratch1 = kScratchRegister;
-      __ Move(scratch0, masm->compilation_info()
-                            ->toplevel_compilation_unit()
-                            ->feedback()
-                            .object());
-
-      // If tiering_state is kInProgress, skip the runtime call.
-      __ movzxwl(scratch1,
-                 FieldOperand(scratch0, FeedbackVector::kFlagsOffset));
-      __ DecodeField<FeedbackVector::TieringStateBits>(scratch1);
-      __ cmpl(scratch1, Immediate(static_cast<int>(TieringState::kInProgress)));
-      __ j(equal, &update_profiler_ticks_and_interrupt_budget);
-
-      // If osr_tiering_state is kInProgress, skip the runtime call.
-      __ movzxwl(scratch1,
-                 FieldOperand(scratch0, FeedbackVector::kFlagsOffset));
-      __ DecodeField<FeedbackVector::OsrTieringStateBit>(scratch1);
-      __ cmpl(scratch1, Immediate(static_cast<int>(TieringState::kInProgress)));
-      __ j(equal, &update_profiler_ticks_and_interrupt_budget);
-    }
-
-    {
-      SaveRegisterStateForCall save_register_state(masm,
-                                                   node->register_snapshot());
-      __ Move(kContextRegister, masm->native_context().object());
-      __ Push(MemOperand(rbp, StandardFrameConstants::kFunctionOffset));
-      // Note: must not cause a lazy deopt!
-      __ CallRuntime(Runtime::kBytecodeBudgetInterrupt_Maglev, 1);
-      save_register_state.DefineSafepoint();
-    }
-    __ jmp(*done);
-
-    __ bind(&update_profiler_ticks_and_interrupt_budget);
-    // We are skipping the call to Runtime::kBytecodeBudgetInterrupt_Maglev
-    // since the tiering state is kInProgress. Perform bookkeeping that would
-    // have been done in the runtime function:
-    __ AssertFeedbackVector(scratch0);
-    // FeedbackVector::SaturatingIncrementProfilerTicks.
-    // TODO(jgruber): This isn't saturating and thus we may theoretically
-    // exceed Smi::kMaxValue. But, 1) this is very unlikely since it'd take
-    // quite some time to exhaust the budget that many times; and 2) even an
-    // overflow doesn't hurt us at all.
-    __ incl(FieldOperand(scratch0, FeedbackVector::kProfilerTicksOffset));
-    // JSFunction::SetInterruptBudget.
-    __ movq(scratch0, MemOperand(rbp, StandardFrameConstants::kFunctionOffset));
-    __ LoadTaggedField(scratch0,
-                       FieldOperand(scratch0, JSFunction::kFeedbackCellOffset));
-    __ movl(FieldOperand(scratch0, FeedbackCell::kInterruptBudgetOffset),
-            Immediate(v8_flags.interrupt_budget));
-    __ jmp(*done);
+    SaveRegisterStateForCall save_register_state(masm,
+                                                 node->register_snapshot());
+    __ Move(kContextRegister, masm->native_context().object());
+    __ Push(MemOperand(rbp, StandardFrameConstants::kFunctionOffset));
+    // Note: must not cause a lazy deopt!
+    __ CallRuntime(Runtime::kBytecodeBudgetInterrupt_Maglev, 1);
+    save_register_state.DefineSafepoint();
   }
+  __ jmp(*done);
 }
 
 void GenerateReduceInterruptBudget(MaglevAssembler* masm, Node* node,
@@ -2175,68 +808,6 @@ void ReduceInterruptBudgetForReturn::GenerateCode(
                                 amount());
 }
 
-int ThrowIfNotSuperConstructor::MaxCallStackArgs() const { return 2; }
-void ThrowIfNotSuperConstructor::SetValueLocationConstraints() {
-  UseRegister(constructor());
-  UseRegister(function());
-}
-void ThrowIfNotSuperConstructor::GenerateCode(MaglevAssembler* masm,
-                                              const ProcessingState& state) {
-  __ LoadMap(kScratchRegister, ToRegister(constructor()));
-  __ testl(FieldOperand(kScratchRegister, Map::kBitFieldOffset),
-           Immediate(Map::Bits1::IsConstructorBit::kMask));
-  __ JumpToDeferredIf(
-      equal,
-      [](MaglevAssembler* masm, ThrowIfNotSuperConstructor* node) {
-        __ Push(ToRegister(node->constructor()));
-        __ Push(ToRegister(node->function()));
-        __ Move(kContextRegister, masm->native_context().object());
-        __ CallRuntime(Runtime::kThrowNotSuperConstructor, 2);
-        masm->DefineExceptionHandlerAndLazyDeoptPoint(node);
-        __ Abort(AbortReason::kUnexpectedReturnFromThrow);
-      },
-      this);
-}
-
-int FunctionEntryStackCheck::MaxCallStackArgs() const { return 1; }
-void FunctionEntryStackCheck::SetValueLocationConstraints() {}
-void FunctionEntryStackCheck::GenerateCode(MaglevAssembler* masm,
-                                           const ProcessingState& state) {
-  // Stack check. This folds the checks for both the interrupt stack limit
-  // check and the real stack limit into one by just checking for the
-  // interrupt limit. The interrupt limit is either equal to the real
-  // stack limit or tighter. By ensuring we have space until that limit
-  // after building the frame we can quickly precheck both at once.
-  const int stack_check_offset = masm->code_gen_state()->stack_check_offset();
-  Register stack_cmp_reg = rsp;
-  if (stack_check_offset > kStackLimitSlackForDeoptimizationInBytes) {
-    stack_cmp_reg = kScratchRegister;
-    __ leaq(stack_cmp_reg, Operand(rsp, -stack_check_offset));
-  }
-  __ cmpq(stack_cmp_reg,
-          __ StackLimitAsOperand(StackLimitKind::kInterruptStackLimit));
-
-  ZoneLabelRef deferred_call_stack_guard_return(masm);
-  __ JumpToDeferredIf(
-      below_equal,
-      [](MaglevAssembler* masm, FunctionEntryStackCheck* node,
-         ZoneLabelRef done, int stack_check_offset) {
-        ASM_CODE_COMMENT_STRING(masm, "Stack/interrupt call");
-        {
-          SaveRegisterStateForCall save_register_state(
-              masm, node->register_snapshot());
-          // Push the frame size
-          __ Push(Immediate(Smi::FromInt(stack_check_offset)));
-          __ CallRuntime(Runtime::kStackGuardWithGap, 1);
-          save_register_state.DefineSafepointWithLazyDeopt(
-              node->lazy_deopt_info());
-        }
-        __ jmp(*done);
-      },
-      this, deferred_call_stack_guard_return, stack_check_offset);
-  __ bind(*deferred_call_stack_guard_return);
-}
-
 // ---
 // Control nodes
 // ---
@@ -2280,24 +851,6 @@ void Return::GenerateCode(MaglevAssembler* masm, const ProcessingState& state) {
   __ Ret();
 }
 
-void BranchIfFloat64Compare::SetValueLocationConstraints() {
-  UseRegister(left_input());
-  UseRegister(right_input());
-}
-void BranchIfFloat64Compare::GenerateCode(MaglevAssembler* masm,
-                                          const ProcessingState& state) {
-  DoubleRegister left = ToDoubleRegister(left_input());
-  DoubleRegister right = ToDoubleRegister(right_input());
-  __ Ucomisd(left, right);
-  if (jump_mode_if_nan_ == JumpModeIfNaN::kJumpToTrue) {
-    __ j(parity_even, if_true()->label());
-  } else {
-    __ j(parity_even, if_false()->label());
-  }
-  __ Branch(ConditionForFloat64(operation_), if_true(), if_false(),
-            state.next_block());
-}
-
 }  // namespace maglev
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/numbers/conversions-inl.h b/deps/v8/src/numbers/conversions-inl.h
index 520149cd39f838..4026501cdae6d7 100644
--- a/deps/v8/src/numbers/conversions-inl.h
+++ b/deps/v8/src/numbers/conversions-inl.h
@@ -19,7 +19,7 @@
 #include "src/base/platform/platform.h"
 #include "src/numbers/conversions.h"
 #include "src/objects/heap-number-inl.h"
-#include "src/objects/objects-inl.h"
+#include "src/objects/smi-inl.h"
 
 namespace v8 {
 namespace internal {
@@ -191,23 +191,23 @@ bool DoubleToUint32IfEqualToSelf(double value, uint32_t* uint32_value) {
   return false;
 }
 
-int32_t NumberToInt32(Object number) {
-  if (number.IsSmi()) return Smi::ToInt(number);
-  return DoubleToInt32(HeapNumber::cast(number).value());
+int32_t NumberToInt32(Tagged<Object> number) {
+  if (IsSmi(number)) return Smi::ToInt(number);
+  return DoubleToInt32(HeapNumber::cast(number)->value());
 }
 
-uint32_t NumberToUint32(Object number) {
-  if (number.IsSmi()) return Smi::ToInt(number);
-  return DoubleToUint32(HeapNumber::cast(number).value());
+uint32_t NumberToUint32(Tagged<Object> number) {
+  if (IsSmi(number)) return Smi::ToInt(number);
+  return DoubleToUint32(HeapNumber::cast(number)->value());
 }
 
-uint32_t PositiveNumberToUint32(Object number) {
-  if (number.IsSmi()) {
+uint32_t PositiveNumberToUint32(Tagged<Object> number) {
+  if (IsSmi(number)) {
     int value = Smi::ToInt(number);
     if (value <= 0) return 0;
     return value;
   }
-  double value = HeapNumber::cast(number).value();
+  double value = HeapNumber::cast(number)->value();
   // Catch all values smaller than 1 and use the double-negation trick for NANs.
   if (!(value >= 1)) return 0;
   uint32_t max = std::numeric_limits<uint32_t>::max();
@@ -215,9 +215,9 @@ uint32_t PositiveNumberToUint32(Object number) {
   return max;
 }
 
-int64_t NumberToInt64(Object number) {
-  if (number.IsSmi()) return Smi::ToInt(number);
-  double d = HeapNumber::cast(number).value();
+int64_t NumberToInt64(Tagged<Object> number) {
+  if (IsSmi(number)) return Smi::ToInt(number);
+  double d = HeapNumber::cast(number)->value();
   if (std::isnan(d)) return 0;
   if (d >= static_cast<double>(std::numeric_limits<int64_t>::max())) {
     return std::numeric_limits<int64_t>::max();
@@ -228,13 +228,13 @@ int64_t NumberToInt64(Object number) {
   return static_cast<int64_t>(d);
 }
 
-uint64_t PositiveNumberToUint64(Object number) {
-  if (number.IsSmi()) {
+uint64_t PositiveNumberToUint64(Tagged<Object> number) {
+  if (IsSmi(number)) {
     int value = Smi::ToInt(number);
     if (value <= 0) return 0;
     return value;
   }
-  double value = HeapNumber::cast(number).value();
+  double value = HeapNumber::cast(number)->value();
   // Catch all values smaller than 1 and use the double-negation trick for NANs.
   if (!(value >= 1)) return 0;
   uint64_t max = std::numeric_limits<uint64_t>::max();
@@ -242,10 +242,10 @@ uint64_t PositiveNumberToUint64(Object number) {
   return max;
 }
 
-bool TryNumberToSize(Object number, size_t* result) {
+bool TryNumberToSize(Tagged<Object> number, size_t* result) {
   // Do not create handles in this function! Don't use SealHandleScope because
   // the function can be used concurrently.
-  if (number.IsSmi()) {
+  if (IsSmi(number)) {
     int value = Smi::ToInt(number);
     DCHECK(static_cast<unsigned>(Smi::kMaxValue) <=
            std::numeric_limits<size_t>::max());
@@ -255,7 +255,7 @@ bool TryNumberToSize(Object number, size_t* result) {
     }
     return false;
   } else {
-    double value = HeapNumber::cast(number).value();
+    double value = HeapNumber::cast(number)->value();
     // If value is compared directly to the limit, the limit will be
     // casted to a double and could end up as limit + 1,
     // because a double might not have enough mantissa bits for it.
@@ -270,7 +270,7 @@ bool TryNumberToSize(Object number, size_t* result) {
   }
 }
 
-size_t NumberToSize(Object number) {
+size_t NumberToSize(Tagged<Object> number) {
   size_t result = 0;
   bool is_valid = TryNumberToSize(number, &result);
   CHECK(is_valid);
diff --git a/deps/v8/src/numbers/conversions.cc b/deps/v8/src/numbers/conversions.cc
index 2e54111e4ebe96..03bd9ff214fb0d 100644
--- a/deps/v8/src/numbers/conversions.cc
+++ b/deps/v8/src/numbers/conversions.cc
@@ -1445,15 +1445,19 @@ char* DoubleToRadixCString(double value, int radix) {
 double StringToDouble(Isolate* isolate, Handle<String> string, int flags,
                       double empty_string_val) {
   Handle<String> flattened = String::Flatten(isolate, string);
-  {
-    DisallowGarbageCollection no_gc;
-    String::FlatContent flat = flattened->GetFlatContent(no_gc);
-    DCHECK(flat.IsFlat());
-    if (flat.IsOneByte()) {
-      return StringToDouble(flat.ToOneByteVector(), flags, empty_string_val);
-    } else {
-      return StringToDouble(flat.ToUC16Vector(), flags, empty_string_val);
-    }
+  return FlatStringToDouble(*flattened, flags, empty_string_val);
+}
+
+double FlatStringToDouble(Tagged<String> string, int flags,
+                          double empty_string_val) {
+  DisallowGarbageCollection no_gc;
+  DCHECK(string->IsFlat());
+  String::FlatContent flat = string->GetFlatContent(no_gc);
+  DCHECK(flat.IsFlat());
+  if (flat.IsOneByte()) {
+    return StringToDouble(flat.ToOneByteVector(), flags, empty_string_val);
+  } else {
+    return StringToDouble(flat.ToUC16Vector(), flags, empty_string_val);
   }
 }
 
@@ -1498,10 +1502,10 @@ base::Optional<double> TryStringToInt(LocalIsolate* isolate,
   }
 }
 
-bool IsSpecialIndex(String string) {
+bool IsSpecialIndex(Tagged<String> string) {
   // Max length of canonical double: -X.XXXXXXXXXXXXXXXXX-eXXX
   const int kBufferSize = 24;
-  const int length = string.length();
+  const int length = string->length();
   if (length == 0 || length > kBufferSize) return false;
   uint16_t buffer[kBufferSize];
   String::WriteToFlat(string, buffer, 0, length);
diff --git a/deps/v8/src/numbers/conversions.h b/deps/v8/src/numbers/conversions.h
index e70fc3bf4da83a..702e59a787abe0 100644
--- a/deps/v8/src/numbers/conversions.h
+++ b/deps/v8/src/numbers/conversions.h
@@ -16,8 +16,6 @@ namespace v8 {
 namespace internal {
 
 class BigInt;
-template <typename T>
-class Handle;
 
 // The limit for the the fractionDigits/precision for toFixed, toPrecision
 // and toExponential.
@@ -162,14 +160,16 @@ inline bool IsUint32Double(double value);
 inline bool DoubleToUint32IfEqualToSelf(double value, uint32_t* uint32_value);
 
 // Convert from Number object to C integer.
-inline uint32_t PositiveNumberToUint32(Object number);
-inline int32_t NumberToInt32(Object number);
-inline uint32_t NumberToUint32(Object number);
-inline int64_t NumberToInt64(Object number);
-inline uint64_t PositiveNumberToUint64(Object number);
+inline uint32_t PositiveNumberToUint32(Tagged<Object> number);
+inline int32_t NumberToInt32(Tagged<Object> number);
+inline uint32_t NumberToUint32(Tagged<Object> number);
+inline int64_t NumberToInt64(Tagged<Object> number);
+inline uint64_t PositiveNumberToUint64(Tagged<Object> number);
 
 double StringToDouble(Isolate* isolate, Handle<String> string, int flags,
                       double empty_string_val = 0.0);
+double FlatStringToDouble(Tagged<String> string, int flags,
+                          double empty_string_val);
 
 // String to double helper without heap allocation.
 // Returns base::nullopt if the string is longer than
@@ -184,13 +184,13 @@ V8_EXPORT_PRIVATE base::Optional<double> TryStringToInt(LocalIsolate* isolate,
                                                         Handle<String> object,
                                                         int radix);
 
-inline bool TryNumberToSize(Object number, size_t* result);
+inline bool TryNumberToSize(Tagged<Object> number, size_t* result);
 
 // Converts a number into size_t.
-inline size_t NumberToSize(Object number);
+inline size_t NumberToSize(Tagged<Object> number);
 
 // returns DoubleToString(StringToDouble(string)) == string
-V8_EXPORT_PRIVATE bool IsSpecialIndex(String string);
+V8_EXPORT_PRIVATE bool IsSpecialIndex(Tagged<String> string);
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/numbers/hash-seed-inl.h b/deps/v8/src/numbers/hash-seed-inl.h
index 0964d552414cf5..28e38b0a359b11 100644
--- a/deps/v8/src/numbers/hash-seed-inl.h
+++ b/deps/v8/src/numbers/hash-seed-inl.h
@@ -44,7 +44,7 @@ inline uint64_t HashSeed(LocalIsolate* isolate) {
 
 inline uint64_t HashSeed(ReadOnlyRoots roots) {
   uint64_t seed;
-  roots.hash_seed().copy_out(0, reinterpret_cast<byte*>(&seed), kInt64Size);
+  roots.hash_seed()->copy_out(0, reinterpret_cast<uint8_t*>(&seed), kInt64Size);
   return seed;
 }
 
diff --git a/deps/v8/src/numbers/math-random.cc b/deps/v8/src/numbers/math-random.cc
index 7670bf6eb29367..53fb393416ce83 100644
--- a/deps/v8/src/numbers/math-random.cc
+++ b/deps/v8/src/numbers/math-random.cc
@@ -26,18 +26,18 @@ void MathRandom::InitializeContext(Isolate* isolate,
   ResetContext(*native_context);
 }
 
-void MathRandom::ResetContext(Context native_context) {
-  native_context.set_math_random_index(Smi::zero());
+void MathRandom::ResetContext(Tagged<Context> native_context) {
+  native_context->set_math_random_index(Smi::zero());
   State state = {0, 0};
-  PodArray<State>::cast(native_context.math_random_state()).set(0, state);
+  PodArray<State>::cast(native_context->math_random_state())->set(0, state);
 }
 
 Address MathRandom::RefillCache(Isolate* isolate, Address raw_native_context) {
-  Context native_context = Context::cast(Object(raw_native_context));
+  Tagged<Context> native_context = Context::cast(Object(raw_native_context));
   DisallowGarbageCollection no_gc;
-  PodArray<State> pod =
-      PodArray<State>::cast(native_context.math_random_state());
-  State state = pod.get(0);
+  Tagged<PodArray<State>> pod =
+      PodArray<State>::cast(native_context->math_random_state());
+  State state = pod->get(0);
   // Initialize state if not yet initialized. If a fixed random seed was
   // requested, use it to reset our state the first time a script asks for
   // random numbers in this context. This ensures the script sees a consistent
@@ -54,18 +54,18 @@ Address MathRandom::RefillCache(Isolate* isolate, Address raw_native_context) {
     CHECK(state.s0 != 0 || state.s1 != 0);
   }
 
-  FixedDoubleArray cache =
-      FixedDoubleArray::cast(native_context.math_random_cache());
+  Tagged<FixedDoubleArray> cache =
+      FixedDoubleArray::cast(native_context->math_random_cache());
   // Create random numbers.
   for (int i = 0; i < kCacheSize; i++) {
     // Generate random numbers using xorshift128+.
     base::RandomNumberGenerator::XorShift128(&state.s0, &state.s1);
-    cache.set(i, base::RandomNumberGenerator::ToDouble(state.s0));
+    cache->set(i, base::RandomNumberGenerator::ToDouble(state.s0));
   }
-  pod.set(0, state);
+  pod->set(0, state);
 
-  Smi new_index = Smi::FromInt(kCacheSize);
-  native_context.set_math_random_index(new_index);
+  Tagged<Smi> new_index = Smi::FromInt(kCacheSize);
+  native_context->set_math_random_index(new_index);
   return new_index.ptr();
 }
 
diff --git a/deps/v8/src/numbers/math-random.h b/deps/v8/src/numbers/math-random.h
index c321b82ba2c698..fa7fba07bdc0a5 100644
--- a/deps/v8/src/numbers/math-random.h
+++ b/deps/v8/src/numbers/math-random.h
@@ -16,7 +16,7 @@ class MathRandom : public AllStatic {
   static void InitializeContext(Isolate* isolate,
                                 Handle<Context> native_context);
 
-  static void ResetContext(Context native_context);
+  static void ResetContext(Tagged<Context> native_context);
   // Takes native context as a raw Address for ExternalReference usage.
   // Returns a tagged Smi as a raw Address.
   static Address RefillCache(Isolate* isolate, Address raw_native_context);
diff --git a/deps/v8/src/objects/DEPS b/deps/v8/src/objects/DEPS
new file mode 100644
index 00000000000000..1e82edaad20092
--- /dev/null
+++ b/deps/v8/src/objects/DEPS
@@ -0,0 +1,5 @@
+specific_include_rules = {
+  "deoptimization-data.cc": [
+    "+third_party/zlib",
+  ],
+}
diff --git a/deps/v8/src/objects/abstract-code-inl.h b/deps/v8/src/objects/abstract-code-inl.h
new file mode 100644
index 00000000000000..c2eafde60528c4
--- /dev/null
+++ b/deps/v8/src/objects/abstract-code-inl.h
@@ -0,0 +1,137 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_ABSTRACT_CODE_INL_H_
+#define V8_OBJECTS_ABSTRACT_CODE_INL_H_
+
+#include "src/objects/abstract-code.h"
+#include "src/objects/bytecode-array-inl.h"
+#include "src/objects/code-inl.h"
+#include "src/objects/instance-type-inl.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+OBJECT_CONSTRUCTORS_IMPL(AbstractCode, HeapObject)
+CAST_ACCESSOR(AbstractCode)
+
+int AbstractCode::InstructionSize(PtrComprCageBase cage_base) {
+  Tagged<Map> map_object = map(cage_base);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    return GetCode()->instruction_size();
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    return GetBytecodeArray()->length();
+  }
+}
+
+Tagged<ByteArray> AbstractCode::SourcePositionTableInternal(
+    PtrComprCageBase cage_base) {
+  Tagged<Map> map_object = map(cage_base);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    Tagged<Code> code = GetCode();
+    if (!code->has_instruction_stream()) {
+      return GetReadOnlyRoots().empty_byte_array();
+    }
+    return code->source_position_table(cage_base);
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    return GetBytecodeArray()->SourcePositionTable(cage_base);
+  }
+}
+
+Tagged<ByteArray> AbstractCode::SourcePositionTable(
+    Isolate* isolate, Tagged<SharedFunctionInfo> sfi) {
+  Tagged<Map> map_object = map(isolate);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    return GetCode()->SourcePositionTable(isolate, sfi);
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    return GetBytecodeArray()->SourcePositionTable(isolate);
+  }
+}
+
+int AbstractCode::SizeIncludingMetadata(PtrComprCageBase cage_base) {
+  Tagged<Map> map_object = map(cage_base);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    return GetCode()->SizeIncludingMetadata();
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    return GetBytecodeArray()->SizeIncludingMetadata();
+  }
+}
+
+Address AbstractCode::InstructionStart(PtrComprCageBase cage_base) {
+  Tagged<Map> map_object = map(cage_base);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    return GetCode()->instruction_start();
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    return GetBytecodeArray()->GetFirstBytecodeAddress();
+  }
+}
+
+Address AbstractCode::InstructionEnd(PtrComprCageBase cage_base) {
+  Tagged<Map> map_object = map(cage_base);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    return GetCode()->instruction_end();
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    Tagged<BytecodeArray> bytecode_array = GetBytecodeArray();
+    return bytecode_array->GetFirstBytecodeAddress() + bytecode_array->length();
+  }
+}
+
+bool AbstractCode::contains(Isolate* isolate, Address inner_pointer) {
+  PtrComprCageBase cage_base(isolate);
+  Tagged<Map> map_object = map(cage_base);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    return GetCode()->contains(isolate, inner_pointer);
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    return (address() <= inner_pointer) &&
+           (inner_pointer <= address() + Size(cage_base));
+  }
+}
+
+CodeKind AbstractCode::kind(PtrComprCageBase cage_base) {
+  Tagged<Map> map_object = map(cage_base);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    return GetCode()->kind();
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    return CodeKind::INTERPRETED_FUNCTION;
+  }
+}
+
+Builtin AbstractCode::builtin_id(PtrComprCageBase cage_base) {
+  Tagged<Map> map_object = map(cage_base);
+  if (InstanceTypeChecker::IsCode(map_object)) {
+    return GetCode()->builtin_id();
+  } else {
+    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
+    return Builtin::kNoBuiltinId;
+  }
+}
+
+bool AbstractCode::has_instruction_stream(PtrComprCageBase cage_base) {
+  DCHECK(InstanceTypeChecker::IsCode(map(cage_base)));
+  return GetCode()->has_instruction_stream();
+}
+
+Tagged<Code> AbstractCode::GetCode() { return Code::cast(*this); }
+
+Tagged<BytecodeArray> AbstractCode::GetBytecodeArray() {
+  return BytecodeArray::cast(*this);
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_ABSTRACT_CODE_INL_H_
diff --git a/deps/v8/src/objects/abstract-code.cc b/deps/v8/src/objects/abstract-code.cc
new file mode 100644
index 00000000000000..16bf8b79d92439
--- /dev/null
+++ b/deps/v8/src/objects/abstract-code.cc
@@ -0,0 +1,53 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/objects/abstract-code.h"
+
+#include "src/objects/abstract-code-inl.h"
+
+namespace v8 {
+namespace internal {
+
+// TODO(cbruni): Move to BytecodeArray
+int AbstractCode::SourcePosition(PtrComprCageBase cage_base, int offset) {
+  CHECK_NE(kind(cage_base), CodeKind::BASELINE);
+  Tagged<Object> maybe_table = SourcePositionTableInternal(cage_base);
+  if (IsException(maybe_table)) return kNoSourcePosition;
+
+  Tagged<ByteArray> source_position_table = ByteArray::cast(maybe_table);
+  // Subtract one because the current PC is one instruction after the call site.
+  if (IsCode(*this, cage_base)) offset--;
+  int position = 0;
+  for (SourcePositionTableIterator iterator(
+           source_position_table, SourcePositionTableIterator::kJavaScriptOnly,
+           SourcePositionTableIterator::kDontSkipFunctionEntry);
+       !iterator.done() && iterator.code_offset() <= offset;
+       iterator.Advance()) {
+    position = iterator.source_position().ScriptOffset();
+  }
+  return position;
+}
+
+// TODO(cbruni): Move to BytecodeArray
+int AbstractCode::SourceStatementPosition(PtrComprCageBase cage_base,
+                                          int offset) {
+  CHECK_NE(kind(cage_base), CodeKind::BASELINE);
+  // First find the closest position.
+  int position = SourcePosition(cage_base, offset);
+  // Now find the closest statement position before the position.
+  int statement_position = 0;
+  for (SourcePositionTableIterator it(SourcePositionTableInternal(cage_base));
+       !it.done(); it.Advance()) {
+    if (it.is_statement()) {
+      int p = it.source_position().ScriptOffset();
+      if (statement_position < p && p <= position) {
+        statement_position = p;
+      }
+    }
+  }
+  return statement_position;
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/objects/abstract-code.h b/deps/v8/src/objects/abstract-code.h
new file mode 100644
index 00000000000000..93ca3496af7dcd
--- /dev/null
+++ b/deps/v8/src/objects/abstract-code.h
@@ -0,0 +1,70 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_ABSTRACT_CODE_H_
+#define V8_OBJECTS_ABSTRACT_CODE_H_
+
+#include "src/objects/code-kind.h"
+#include "src/objects/heap-object.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+enum class Builtin;
+class BytecodeArray;
+class Code;
+
+// AbstractCode is a helper wrapper around {Code|BytecodeArray}.
+// TODO(jgruber): Consider removing this wrapper as it's mainly used for
+// profiling. Perhaps methods should be specialized instead of this wrapper
+// class?
+class AbstractCode : public HeapObject {
+ public:
+  int SourcePosition(PtrComprCageBase cage_base, int offset);
+  int SourceStatementPosition(PtrComprCageBase cage_base, int offset);
+
+  inline Address InstructionStart(PtrComprCageBase cage_base);
+  inline Address InstructionEnd(PtrComprCageBase cage_base);
+  inline int InstructionSize(PtrComprCageBase cage_base);
+
+  // Return the source position table for interpreter code.
+  inline Tagged<ByteArray> SourcePositionTable(Isolate* isolate,
+                                               Tagged<SharedFunctionInfo> sfi);
+
+  void DropStackFrameCache(PtrComprCageBase cage_base);
+
+  // Returns the size of instructions and the metadata.
+  inline int SizeIncludingMetadata(PtrComprCageBase cage_base);
+
+  // Returns true if pc is inside this object's instructions.
+  inline bool contains(Isolate* isolate, Address pc);
+
+  // Returns the kind of the code.
+  inline CodeKind kind(PtrComprCageBase cage_base);
+
+  inline Builtin builtin_id(PtrComprCageBase cage_base);
+
+  inline bool has_instruction_stream(PtrComprCageBase cage_base);
+
+  DECL_CAST(AbstractCode)
+
+  inline Tagged<Code> GetCode();
+  inline Tagged<BytecodeArray> GetBytecodeArray();
+
+ private:
+  inline Tagged<ByteArray> SourcePositionTableInternal(
+      PtrComprCageBase cage_base);
+
+  OBJECT_CONSTRUCTORS(AbstractCode, HeapObject);
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_ABSTRACT_CODE_H_
diff --git a/deps/v8/src/objects/allocation-site-inl.h b/deps/v8/src/objects/allocation-site-inl.h
index 676ec3c1c52b33..7d55e5ae788841 100644
--- a/deps/v8/src/objects/allocation-site-inl.h
+++ b/deps/v8/src/objects/allocation-site-inl.h
@@ -8,6 +8,7 @@
 #include "src/common/globals.h"
 #include "src/heap/heap-write-barrier-inl.h"
 #include "src/objects/allocation-site.h"
+#include "src/objects/dependent-code-inl.h"
 #include "src/objects/js-objects-inl.h"
 
 // Has to be the last include (doesn't have include guards):
@@ -25,30 +26,33 @@ NEVER_READ_ONLY_SPACE_IMPL(AllocationSite)
 
 CAST_ACCESSOR(AllocationSite)
 
-ACCESSORS(AllocationSite, transition_info_or_boilerplate, Object,
+ACCESSORS(AllocationSite, transition_info_or_boilerplate, Tagged<Object>,
           kTransitionInfoOrBoilerplateOffset)
 RELEASE_ACQUIRE_ACCESSORS(AllocationSite, transition_info_or_boilerplate,
-                          Object, kTransitionInfoOrBoilerplateOffset)
-ACCESSORS(AllocationSite, nested_site, Object, kNestedSiteOffset)
+                          Tagged<Object>, kTransitionInfoOrBoilerplateOffset)
+ACCESSORS(AllocationSite, nested_site, Tagged<Object>, kNestedSiteOffset)
 RELAXED_INT32_ACCESSORS(AllocationSite, pretenure_data, kPretenureDataOffset)
 INT32_ACCESSORS(AllocationSite, pretenure_create_count,
                 kPretenureCreateCountOffset)
-ACCESSORS(AllocationSite, dependent_code, DependentCode, kDependentCodeOffset)
-ACCESSORS_CHECKED(AllocationSite, weak_next, Object, kWeakNextOffset,
+ACCESSORS(AllocationSite, dependent_code, Tagged<DependentCode>,
+          kDependentCodeOffset)
+ACCESSORS_CHECKED(AllocationSite, weak_next, Tagged<Object>, kWeakNextOffset,
                   HasWeakNext())
-ACCESSORS(AllocationMemento, allocation_site, Object, kAllocationSiteOffset)
+ACCESSORS(AllocationMemento, allocation_site, Tagged<Object>,
+          kAllocationSiteOffset)
 
-JSObject AllocationSite::boilerplate() const {
+Tagged<JSObject> AllocationSite::boilerplate() const {
   DCHECK(PointsToLiteral());
   return JSObject::cast(transition_info_or_boilerplate());
 }
 
-JSObject AllocationSite::boilerplate(AcquireLoadTag tag) const {
+Tagged<JSObject> AllocationSite::boilerplate(AcquireLoadTag tag) const {
   DCHECK(PointsToLiteral());
   return JSObject::cast(transition_info_or_boilerplate(tag));
 }
 
-void AllocationSite::set_boilerplate(JSObject value, ReleaseStoreTag tag,
+void AllocationSite::set_boilerplate(Tagged<JSObject> value,
+                                     ReleaseStoreTag tag,
                                      WriteBarrierMode mode) {
   set_transition_info_or_boilerplate(value, tag, mode);
 }
@@ -113,10 +117,9 @@ void AllocationSite::SetDoNotInlineCall() {
 }
 
 bool AllocationSite::PointsToLiteral() const {
-  Object raw_value = transition_info_or_boilerplate(kAcquireLoad);
-  DCHECK_EQ(!raw_value.IsSmi(),
-            raw_value.IsJSArray() || raw_value.IsJSObject());
-  return !raw_value.IsSmi();
+  Tagged<Object> raw_value = transition_info_or_boilerplate(kAcquireLoad);
+  DCHECK_EQ(!IsSmi(raw_value), IsJSArray(raw_value) || IsJSObject(raw_value));
+  return !IsSmi(raw_value);
 }
 
 // Heuristic: We only need to create allocation site info if the boilerplate
@@ -180,12 +183,12 @@ void AllocationSite::set_memento_create_count(int count) {
   set_pretenure_create_count(count);
 }
 
-bool AllocationSite::IncrementMementoFoundCount(int increment) {
-  if (IsZombie()) return false;
+int AllocationSite::IncrementMementoFoundCount(int increment) {
+  DCHECK(!IsZombie());
 
-  int value = memento_found_count();
-  set_memento_found_count(value + increment);
-  return memento_found_count() >= kPretenureMinimumCreated;
+  int new_value = memento_found_count() + increment;
+  set_memento_found_count(new_value);
+  return new_value;
 }
 
 inline void AllocationSite::IncrementMementoCreateCount() {
@@ -195,11 +198,11 @@ inline void AllocationSite::IncrementMementoCreateCount() {
 }
 
 bool AllocationMemento::IsValid() const {
-  return allocation_site().IsAllocationSite() &&
-         !AllocationSite::cast(allocation_site()).IsZombie();
+  return IsAllocationSite(allocation_site()) &&
+         !AllocationSite::cast(allocation_site())->IsZombie();
 }
 
-AllocationSite AllocationMemento::GetAllocationSite() const {
+Tagged<AllocationSite> AllocationMemento::GetAllocationSite() const {
   DCHECK(IsValid());
   return AllocationSite::cast(allocation_site());
 }
@@ -214,7 +217,7 @@ bool AllocationSite::DigestTransitionFeedback(Handle<AllocationSite> site,
   Isolate* isolate = site->GetIsolate();
   bool result = false;
 
-  if (site->PointsToLiteral() && site->boilerplate().IsJSArray()) {
+  if (site->PointsToLiteral() && IsJSArray(site->boilerplate())) {
     Handle<JSArray> boilerplate(JSArray::cast(site->boilerplate()), isolate);
     ElementsKind kind = boilerplate->GetElementsKind();
     // if kind is holey ensure that to_kind is as well.
@@ -225,7 +228,7 @@ bool AllocationSite::DigestTransitionFeedback(Handle<AllocationSite> site,
       // If the array is huge, it's not likely to be defined in a local
       // function, so we shouldn't make new instances of it very often.
       uint32_t length = 0;
-      CHECK(boilerplate->length().ToArrayLength(&length));
+      CHECK(Object::ToArrayLength(boilerplate->length(), &length));
       if (length <= kMaximumArrayBytesToPretransition) {
         if (update_or_check == AllocationSiteUpdateMode::kCheckOnly) {
           return true;
diff --git a/deps/v8/src/objects/allocation-site-scopes-inl.h b/deps/v8/src/objects/allocation-site-scopes-inl.h
index 27cc6d31f0b528..fd93799b3d39a7 100644
--- a/deps/v8/src/objects/allocation-site-scopes-inl.h
+++ b/deps/v8/src/objects/allocation-site-scopes-inl.h
@@ -24,7 +24,7 @@ Handle<AllocationSite> AllocationSiteUsageContext::EnterNewScope() {
     InitializeTraversal(top_site_);
   } else {
     // Advance current site
-    Object nested_site = current()->nested_site();
+    Tagged<Object> nested_site = current()->nested_site();
     // Something is wrong if we advance to the end of the list here.
     update_current_site(AllocationSite::cast(nested_site));
   }
@@ -39,12 +39,12 @@ void AllocationSiteUsageContext::ExitScope(Handle<AllocationSite> scope_site,
 }
 
 bool AllocationSiteUsageContext::ShouldCreateMemento(Handle<JSObject> object) {
-  if (activated_ && AllocationSite::CanTrack(object->map().instance_type())) {
+  if (activated_ && AllocationSite::CanTrack(object->map()->instance_type())) {
     if (v8_flags.allocation_site_pretenuring ||
         AllocationSite::ShouldTrack(object->GetElementsKind())) {
       if (v8_flags.trace_creation_allocation_sites) {
         PrintF("*** Creating Memento for %s %p\n",
-               object->IsJSArray() ? "JSArray" : "JSObject",
+               IsJSArray(*object) ? "JSArray" : "JSObject",
                reinterpret_cast<void*>(object->ptr()));
       }
       return true;
diff --git a/deps/v8/src/objects/allocation-site-scopes.h b/deps/v8/src/objects/allocation-site-scopes.h
index 9617b76b5e221d..87a3a36bc0b105 100644
--- a/deps/v8/src/objects/allocation-site-scopes.h
+++ b/deps/v8/src/objects/allocation-site-scopes.h
@@ -27,7 +27,9 @@ class AllocationSiteContext {
   Isolate* isolate() { return isolate_; }
 
  protected:
-  void update_current_site(AllocationSite site) { current_.PatchValue(site); }
+  void update_current_site(Tagged<AllocationSite> site) {
+    current_.PatchValue(site);
+  }
 
   inline void InitializeTraversal(Handle<AllocationSite> site);
 
diff --git a/deps/v8/src/objects/allocation-site.h b/deps/v8/src/objects/allocation-site.h
index 01b002c379e1c5..ee161af6f25009 100644
--- a/deps/v8/src/objects/allocation-site.h
+++ b/deps/v8/src/objects/allocation-site.h
@@ -22,8 +22,6 @@ class AllocationSite : public Struct {
  public:
   NEVER_READ_ONLY_SPACE
   static const uint32_t kMaximumArrayBytesToPretransition = 8 * 1024;
-  static const double kPretenureRatio;
-  static const int kPretenureMinimumCreated = 100;
 
   // Values for pretenure decision field.
   enum PretenureDecision {
@@ -39,27 +37,27 @@ class AllocationSite : public Struct {
 
   // Contains either a Smi-encoded bitfield or a boilerplate. If it's a Smi the
   // AllocationSite is for a constructed Array.
-  DECL_ACCESSORS(transition_info_or_boilerplate, Object)
-  DECL_RELEASE_ACQUIRE_ACCESSORS(transition_info_or_boilerplate, Object)
-  DECL_GETTER(boilerplate, JSObject)
-  DECL_RELEASE_ACQUIRE_ACCESSORS(boilerplate, JSObject)
+  DECL_ACCESSORS(transition_info_or_boilerplate, Tagged<Object>)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(transition_info_or_boilerplate, Tagged<Object>)
+  DECL_GETTER(boilerplate, Tagged<JSObject>)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(boilerplate, Tagged<JSObject>)
   DECL_INT_ACCESSORS(transition_info)
 
   // nested_site threads a list of sites that represent nested literals
   // walked in a particular order. So [[1, 2], 1, 2] will have one
   // nested_site, but [[1, 2], 3, [4]] will have a list of two.
-  DECL_ACCESSORS(nested_site, Object)
+  DECL_ACCESSORS(nested_site, Tagged<Object>)
 
   // Bitfield containing pretenuring information.
   DECL_RELAXED_INT32_ACCESSORS(pretenure_data)
 
   DECL_INT32_ACCESSORS(pretenure_create_count)
-  DECL_ACCESSORS(dependent_code, DependentCode)
+  DECL_ACCESSORS(dependent_code, Tagged<DependentCode>)
 
   // heap->allocation_site_list() points to the last AllocationSite which form
   // a linked list through the weak_next property. The GC might remove elements
   // from the list by updateing weak_next.
-  DECL_ACCESSORS(weak_next, Object)
+  DECL_ACCESSORS(weak_next, Tagged<Object>)
 
   inline void Initialize();
 
@@ -80,9 +78,8 @@ class AllocationSite : public Struct {
   using DeoptDependentCodeBit = base::BitField<bool, 29, 1>;
   static_assert(PretenureDecisionBits::kMax >= kLastPretenureDecisionValue);
 
-  // Increments the mementos found counter and returns true when the first
-  // memento was found for a given allocation site.
-  inline bool IncrementMementoFoundCount(int increment = 1);
+  // Increments the mementos found counter and returns the new count.
+  inline int IncrementMementoFoundCount(int increment = 1);
 
   inline void IncrementMementoCreateCount();
 
@@ -175,10 +172,10 @@ class AllocationSite : public Struct {
 class AllocationMemento
     : public TorqueGeneratedAllocationMemento<AllocationMemento, Struct> {
  public:
-  DECL_ACCESSORS(allocation_site, Object)
+  DECL_ACCESSORS(allocation_site, Tagged<Object>)
 
   inline bool IsValid() const;
-  inline AllocationSite GetAllocationSite() const;
+  inline Tagged<AllocationSite> GetAllocationSite() const;
   inline Address GetAllocationSiteUnchecked() const;
 
   DECL_PRINTER(AllocationMemento)
diff --git a/deps/v8/src/objects/api-callbacks-inl.h b/deps/v8/src/objects/api-callbacks-inl.h
index 69d6f110622dde..aca46261891dbf 100644
--- a/deps/v8/src/objects/api-callbacks-inl.h
+++ b/deps/v8/src/objects/api-callbacks-inl.h
@@ -28,15 +28,14 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(InterceptorInfo)
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(CallHandlerInfo)
 
-EXTERNAL_POINTER_ACCESSORS(AccessorInfo, maybe_redirected_getter, Address,
-                           kMaybeRedirectedGetterOffset, kAccessorInfoGetterTag)
-EXTERNAL_POINTER_ACCESSORS(AccessorInfo, setter, Address, kSetterOffset,
-                           kAccessorInfoSetterTag)
-
-Address AccessorInfo::getter() const {
-  i::Isolate* isolate_for_sandbox = GetIsolateForSandbox(*this);
-  return AccessorInfo::getter(isolate_for_sandbox);
-}
+EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(AccessorInfo,
+                                                maybe_redirected_getter,
+                                                Address,
+                                                kMaybeRedirectedGetterOffset,
+                                                kAccessorInfoGetterTag)
+EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(AccessorInfo, setter, Address,
+                                                kSetterOffset,
+                                                kAccessorInfoSetterTag)
 
 Address AccessorInfo::getter(i::Isolate* isolate_for_sandbox) const {
   Address result = maybe_redirected_getter(isolate_for_sandbox);
@@ -74,11 +73,13 @@ void AccessorInfo::remove_getter_redirection(i::Isolate* isolate) {
   set_maybe_redirected_getter(isolate, value);
 }
 
-bool AccessorInfo::has_getter() {
-  return maybe_redirected_getter() != kNullAddress;
+bool AccessorInfo::has_getter(Isolate* isolate) {
+  return maybe_redirected_getter(isolate) != kNullAddress;
 }
 
-bool AccessorInfo::has_setter() { return setter() != kNullAddress; }
+bool AccessorInfo::has_setter(Isolate* isolate) {
+  return setter(isolate) != kNullAddress;
+}
 
 BIT_FIELD_ACCESSORS(AccessorInfo, flags, all_can_read,
                     AccessorInfo::AllCanReadBit)
@@ -125,41 +126,22 @@ BOOL_ACCESSORS(InterceptorInfo, flags, has_no_side_effect,
 bool CallHandlerInfo::IsSideEffectFreeCallHandlerInfo() const {
   ReadOnlyRoots roots = GetReadOnlyRoots();
   DCHECK(map() == roots.side_effect_call_handler_info_map() ||
-         map() == roots.side_effect_free_call_handler_info_map() ||
-         map() == roots.next_call_side_effect_free_call_handler_info_map());
+         map() == roots.side_effect_free_call_handler_info_map());
   return map() == roots.side_effect_free_call_handler_info_map();
 }
 
 bool CallHandlerInfo::IsSideEffectCallHandlerInfo() const {
   ReadOnlyRoots roots = GetReadOnlyRoots();
   DCHECK(map() == roots.side_effect_call_handler_info_map() ||
-         map() == roots.side_effect_free_call_handler_info_map() ||
-         map() == roots.next_call_side_effect_free_call_handler_info_map());
+         map() == roots.side_effect_free_call_handler_info_map());
   return map() == roots.side_effect_call_handler_info_map();
 }
 
-void CallHandlerInfo::SetNextCallHasNoSideEffect() {
-  set_map(
-      GetReadOnlyRoots().next_call_side_effect_free_call_handler_info_map());
-}
-
-bool CallHandlerInfo::NextCallHasNoSideEffect() {
-  ReadOnlyRoots roots = GetReadOnlyRoots();
-  if (map() == roots.next_call_side_effect_free_call_handler_info_map()) {
-    set_map(roots.side_effect_call_handler_info_map());
-    return true;
-  }
-  return false;
-}
-
-EXTERNAL_POINTER_ACCESSORS(CallHandlerInfo, maybe_redirected_callback, Address,
-                           kMaybeRedirectedCallbackOffset,
-                           kCallHandlerInfoCallbackTag)
-
-Address CallHandlerInfo::callback() const {
-  i::Isolate* isolate_for_sandbox = GetIsolateForSandbox(*this);
-  return CallHandlerInfo::callback(isolate_for_sandbox);
-}
+EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(CallHandlerInfo,
+                                                maybe_redirected_callback,
+                                                Address,
+                                                kMaybeRedirectedCallbackOffset,
+                                                kCallHandlerInfoCallbackTag)
 
 Address CallHandlerInfo::callback(i::Isolate* isolate_for_sandbox) const {
   Address result = maybe_redirected_callback(isolate_for_sandbox);
diff --git a/deps/v8/src/objects/api-callbacks.h b/deps/v8/src/objects/api-callbacks.h
index 6be78a2e6a5f32..cd715a3bb13761 100644
--- a/deps/v8/src/objects/api-callbacks.h
+++ b/deps/v8/src/objects/api-callbacks.h
@@ -33,14 +33,14 @@ class AccessorInfo
   // This is a wrapper around |maybe_redirected_getter| accessor which
   // returns/accepts C function and converts the value from and to redirected
   // pointer.
-  DECL_EXTERNAL_POINTER_ACCESSORS(getter, Address)
-  inline void init_getter_redirection(i::Isolate* isolate);
-  inline void remove_getter_redirection(i::Isolate* isolate);
-  inline bool has_getter();
+  DECL_EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(getter, Address)
+  inline void init_getter_redirection(Isolate* isolate);
+  inline void remove_getter_redirection(Isolate* isolate);
+  inline bool has_getter(Isolate* isolate);
 
   // The field contains the address of the C function.
-  DECL_EXTERNAL_POINTER_ACCESSORS(setter, Address)
-  inline bool has_setter();
+  DECL_EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(setter, Address)
+  inline bool has_setter(Isolate* isolate);
 
   DECL_BOOLEAN_ACCESSORS(all_can_read)
   DECL_BOOLEAN_ACCESSORS(all_can_write)
@@ -63,7 +63,7 @@ class AccessorInfo
   // Checks whether the given receiver is compatible with this accessor.
   static bool IsCompatibleReceiverMap(Handle<AccessorInfo> info,
                                       Handle<Map> map);
-  inline bool IsCompatibleReceiver(Object receiver);
+  inline bool IsCompatibleReceiver(Tagged<Object> receiver);
 
   // Append all descriptors to the array that are not already there.
   // Return number added.
@@ -95,7 +95,8 @@ class AccessorInfo
 class AccessCheckInfo
     : public TorqueGeneratedAccessCheckInfo<AccessCheckInfo, Struct> {
  public:
-  static AccessCheckInfo Get(Isolate* isolate, Handle<JSObject> receiver);
+  static Tagged<AccessCheckInfo> Get(Isolate* isolate,
+                                     Handle<JSObject> receiver);
 
   using BodyDescriptor = StructBodyDescriptor;
 
@@ -123,10 +124,6 @@ class CallHandlerInfo
  public:
   inline bool IsSideEffectFreeCallHandlerInfo() const;
   inline bool IsSideEffectCallHandlerInfo() const;
-  inline void SetNextCallHasNoSideEffect();
-  // Returns whether or not the next call can be side effect free.
-  // Calling this will change the state back to having a side effect.
-  inline bool NextCallHasNoSideEffect();
 
   // Dispatched behavior.
   DECL_PRINTER(CallHandlerInfo)
@@ -135,7 +132,7 @@ class CallHandlerInfo
   // This is a wrapper around |maybe_redirected_callback| accessor which
   // returns/accepts C function and converts the value from and to redirected
   // pointer.
-  DECL_EXTERNAL_POINTER_ACCESSORS(callback, Address)
+  DECL_EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(callback, Address)
   inline void init_callback_redirection(i::Isolate* isolate);
   inline void remove_callback_redirection(i::Isolate* isolate);
 
@@ -149,7 +146,8 @@ class CallHandlerInfo
   // For native builds the field contains the address of the C function.
   // This field is initialized implicitly via respective |callback|-related
   // methods.
-  DECL_EXTERNAL_POINTER_ACCESSORS(maybe_redirected_callback, Address)
+  DECL_EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(
+      maybe_redirected_callback, Address)
 
   TQ_OBJECT_CONSTRUCTORS(CallHandlerInfo)
 };
diff --git a/deps/v8/src/objects/api-callbacks.tq b/deps/v8/src/objects/api-callbacks.tq
index 87331c2c240574..e311e433101303 100644
--- a/deps/v8/src/objects/api-callbacks.tq
+++ b/deps/v8/src/objects/api-callbacks.tq
@@ -4,6 +4,8 @@
 
 extern class CallHandlerInfo extends HeapObject {
   data: Object;
+  // Back reference to the function template object.
+  owner_template: FunctionTemplateInfo|ObjectTemplateInfo;
   // For simulator builds this field contains the address of the trampoline
   // callable from generated code and for native builds - the address of
   // the callback C function.
diff --git a/deps/v8/src/objects/arguments.tq b/deps/v8/src/objects/arguments.tq
index 9c89edeeb19d6d..baf3793cfec25e 100644
--- a/deps/v8/src/objects/arguments.tq
+++ b/deps/v8/src/objects/arguments.tq
@@ -8,8 +8,8 @@ type JSArgumentsObjectWithLength =
     JSSloppyArgumentsObject|JSStrictArgumentsObject;
 
 @export
-macro IsJSArgumentsObjectWithLength(implicit context: Context)(o: Object):
-    bool {
+macro IsJSArgumentsObjectWithLength(
+    implicit context: Context)(o: Object): bool {
   return Is<JSArgumentsObjectWithLength>(o);
 }
 
@@ -95,8 +95,8 @@ extern class AliasedArgumentsEntry extends Struct {
 // TODO(danno): This should be a namespace {} once supported
 namespace arguments {
 
-macro NewJSStrictArgumentsObject(implicit context: Context)(
-    elements: FixedArray): JSStrictArgumentsObject {
+macro NewJSStrictArgumentsObject(
+    implicit context: Context)(elements: FixedArray): JSStrictArgumentsObject {
   const map = GetStrictArgumentsMap();
   return new JSStrictArgumentsObject{
     map,
@@ -106,8 +106,9 @@ macro NewJSStrictArgumentsObject(implicit context: Context)(
   };
 }
 
-macro NewJSSloppyArgumentsObject(implicit context: Context)(
-    elements: FixedArrayBase, callee: JSFunction): JSSloppyArgumentsObject {
+macro NewJSSloppyArgumentsObject(
+    implicit context: Context)(elements: FixedArrayBase,
+    callee: JSFunction): JSSloppyArgumentsObject {
   const map = GetSloppyArgumentsMap();
   return new JSSloppyArgumentsObject{
     map,
@@ -118,8 +119,8 @@ macro NewJSSloppyArgumentsObject(implicit context: Context)(
   };
 }
 
-macro NewJSFastAliasedArgumentsObject(implicit context: Context)(
-    elements: FixedArrayBase, length: Smi,
+macro NewJSFastAliasedArgumentsObject(
+    implicit context: Context)(elements: FixedArrayBase, length: Smi,
     callee: JSFunction): JSSloppyArgumentsObject {
   // TODO(danno): FastAliasedArguments should really be a type for itself
   const map = GetFastAliasedArgumentsMap();
@@ -182,8 +183,8 @@ struct ParameterValueIterator {
   current: intptr;
 }
 
-macro NewParameterValueIterator(
-    mappedCount: intptr, arguments: Arguments): ParameterValueIterator {
+macro NewParameterValueIterator(mappedCount: intptr, arguments: Arguments):
+    ParameterValueIterator {
   return ParameterValueIterator{
     mapped_count: mappedCount,
     arguments,
@@ -191,8 +192,9 @@ macro NewParameterValueIterator(
   };
 }
 
-macro NewAllArguments(implicit context: Context)(
-    frame: FrameWithArguments, argumentCount: intptr): JSArray {
+macro NewAllArguments(
+    implicit context: Context)(frame: FrameWithArguments,
+    argumentCount: intptr): JSArray {
   const map = GetFastPackedElementsJSArrayMap();
   const arguments = GetFrameArguments(frame, argumentCount);
   const it = ArgumentsIterator{arguments, current: 0};
@@ -211,8 +213,8 @@ macro NewRestArgumentsElements(
   return NewFixedArray(length, it);
 }
 
-macro NewRestArguments(implicit context: Context)(info: FrameWithArgumentsInfo):
-    JSArray {
+macro NewRestArguments(
+    implicit context: Context)(info: FrameWithArgumentsInfo): JSArray {
   const argumentCount = Convert<intptr>(info.argument_count);
   const formalParameterCount = Convert<intptr>(info.formal_parameter_count);
   const map = GetFastPackedElementsJSArrayMap();
@@ -228,7 +230,8 @@ macro NewStrictArgumentsElements(
   return NewFixedArray(argumentCount, it);
 }
 
-macro NewStrictArguments(implicit context: Context)(
+macro NewStrictArguments(
+    implicit context: Context)(
     info: FrameWithArgumentsInfo): JSStrictArgumentsObject {
   const argumentCount = Convert<intptr>(info.argument_count);
   const elements = NewStrictArgumentsElements(info.frame, argumentCount);
@@ -248,8 +251,9 @@ macro NewSloppyArgumentsElements(
   return NewFixedArray(argumentCount, it);
 }
 
-macro NewSloppyArguments(implicit context: Context)(
-    info: FrameWithArgumentsInfo, callee: JSFunction): JSSloppyArgumentsObject {
+macro NewSloppyArguments(
+    implicit context: Context)(info: FrameWithArgumentsInfo,
+    callee: JSFunction): JSSloppyArgumentsObject {
   const argumentCount = Convert<intptr>(info.argument_count);
   const formalParameterCount = Convert<intptr>(info.formal_parameter_count);
   const parameterValues = arguments::NewSloppyArgumentsElements(
@@ -270,28 +274,29 @@ macro NewSloppyArguments(implicit context: Context)(
 }  // namespace arguments
 
 @export
-macro EmitFastNewAllArguments(implicit context: Context)(
-    frame: FrameWithArguments, argc: intptr): JSArray {
+macro EmitFastNewAllArguments(
+    implicit context: Context)(frame: FrameWithArguments,
+    argc: intptr): JSArray {
   return arguments::NewAllArguments(frame, argc);
 }
 
 @export
-macro EmitFastNewRestArguments(implicit context: Context)(_f: JSFunction):
-    JSArray {
+macro EmitFastNewRestArguments(
+    implicit context: Context)(_f: JSFunction): JSArray {
   const info = GetFrameWithArgumentsInfo();
   return arguments::NewRestArguments(info);
 }
 
 @export
-macro EmitFastNewStrictArguments(implicit context: Context)(_f: JSFunction):
-    JSStrictArgumentsObject {
+macro EmitFastNewStrictArguments(
+    implicit context: Context)(_f: JSFunction): JSStrictArgumentsObject {
   const info = GetFrameWithArgumentsInfo();
   return arguments::NewStrictArguments(info);
 }
 
 @export
-macro EmitFastNewSloppyArguments(implicit context: Context)(f: JSFunction):
-    JSSloppyArgumentsObject {
+macro EmitFastNewSloppyArguments(
+    implicit context: Context)(f: JSFunction): JSSloppyArgumentsObject {
   const info = GetFrameWithArgumentsInfo();
   return arguments::NewSloppyArguments(info, f);
 }
@@ -317,23 +322,22 @@ builtin NewRestArgumentsElements(
       frame, formalParameterCount, Convert<intptr>(argumentCount));
 }
 
-builtin FastNewSloppyArguments(implicit context: Context)(f: JSFunction):
-    JSSloppyArgumentsObject {
+builtin FastNewSloppyArguments(
+    implicit context: Context)(f: JSFunction): JSSloppyArgumentsObject {
   return EmitFastNewSloppyArguments(f);
 }
 
-builtin FastNewStrictArguments(implicit context: Context)(f: JSFunction):
-    JSStrictArgumentsObject {
+builtin FastNewStrictArguments(
+    implicit context: Context)(f: JSFunction): JSStrictArgumentsObject {
   return EmitFastNewStrictArguments(f);
 }
 
-builtin FastNewRestArguments(implicit context: Context)(f: JSFunction):
-    JSArray {
+builtin FastNewRestArguments(
+    implicit context: Context)(f: JSFunction): JSArray {
   return EmitFastNewRestArguments(f);
 }
 
-macro
-AccessSloppyArgumentsCommon(
+macro AccessSloppyArgumentsCommon(
     receiver: JSObject, keyObject: Object): &Object labels Bailout {
   const key = Cast<Smi>(keyObject) otherwise Bailout;
   const elements =
@@ -365,22 +369,22 @@ AccessSloppyArgumentsCommon(
 }
 
 @export
-macro SloppyArgumentsLoad(receiver: JSObject, keyObject: Object):
-    JSAny labels Bailout {
+macro SloppyArgumentsLoad(
+    receiver: JSObject, keyObject: Object): JSAny labels Bailout {
   return UnsafeCast<JSAny>(
       *AccessSloppyArgumentsCommon(receiver, keyObject) otherwise Bailout);
 }
 
 @export
-macro SloppyArgumentsHas(receiver: JSObject, keyObject: Object):
-    JSAny labels Bailout {
+macro SloppyArgumentsHas(
+    receiver: JSObject, keyObject: Object): JSAny labels Bailout {
   AccessSloppyArgumentsCommon(receiver, keyObject) otherwise Bailout;
   return True;
 }
 
 @export
-macro SloppyArgumentsStore(receiver: JSObject, keyObject: Object, value: JSAny):
-    JSAny labels Bailout {
+macro SloppyArgumentsStore(
+    receiver: JSObject, keyObject: Object, value: JSAny): JSAny labels Bailout {
   let destination =
       AccessSloppyArgumentsCommon(receiver, keyObject) otherwise Bailout;
   *destination = value;
diff --git a/deps/v8/src/objects/backing-store.cc b/deps/v8/src/objects/backing-store.cc
index 0a96df93b2e49e..aeac06e0b8e5aa 100644
--- a/deps/v8/src/objects/backing-store.cc
+++ b/deps/v8/src/objects/backing-store.cc
@@ -106,7 +106,7 @@ inline void DebugCheckZero(void* start, size_t byte_length) {
   // Double check memory is zero-initialized. Despite being DEBUG-only,
   // this function is somewhat optimized for the benefit of test suite
   // execution times (some tests allocate several gigabytes).
-  const byte* bytes = reinterpret_cast<const byte*>(start);
+  const uint8_t* bytes = reinterpret_cast<const uint8_t*>(start);
   const size_t kBaseCase = 32;
   for (size_t i = 0; i < kBaseCase && i < byte_length; i++) {
     DCHECK_EQ(0, bytes[i]);
@@ -127,33 +127,6 @@ struct SharedWasmMemoryData {
   std::vector<Isolate*> isolates_;
 };
 
-void BackingStore::Clear() {
-  buffer_start_ = nullptr;
-  byte_length_ = 0;
-  has_guard_regions_ = false;
-  if (holds_shared_ptr_to_allocator_) {
-    type_specific_data_.v8_api_array_buffer_allocator_shared
-        .std::shared_ptr<v8::ArrayBuffer::Allocator>::~shared_ptr();
-    holds_shared_ptr_to_allocator_ = false;
-  }
-  type_specific_data_.v8_api_array_buffer_allocator = nullptr;
-}
-
-void BackingStore::FreeResizableMemory() {
-  DCHECK(free_on_destruct_);
-  DCHECK(!custom_deleter_);
-  DCHECK(is_resizable_by_js_ || is_wasm_memory_);
-  auto region =
-      GetReservedRegion(has_guard_regions_, buffer_start_, byte_capacity_);
-
-  PageAllocator* page_allocator = GetArrayBufferPageAllocator();
-  if (!region.is_empty()) {
-    FreePages(page_allocator, reinterpret_cast<void*>(region.begin()),
-              region.size());
-  }
-  Clear();
-}
-
 BackingStore::BackingStore(void* buffer_start, size_t byte_length,
                            size_t max_byte_length, size_t byte_capacity,
                            SharedFlag shared, ResizableFlag resizable,
@@ -182,15 +155,42 @@ BackingStore::BackingStore(void* buffer_start, size_t byte_length,
                  byte_length_ == max_byte_length_);
   DCHECK_GE(max_byte_length_, byte_length_);
   DCHECK_GE(byte_capacity_, max_byte_length_);
+  // TODO(1445003): Demote to a DCHECK once we found the issue.
+  // Wasm memory should never be empty (== zero capacity). Otherwise
+  // {JSArrayBuffer::Attach} would replace it by the {EmptyBackingStore} and we
+  // loose information.
+  // This is particularly important for shared Wasm memory.
+  CHECK_IMPLIES(is_wasm_memory_, byte_capacity_ != 0);
 }
 
 BackingStore::~BackingStore() {
   GlobalBackingStoreRegistry::Unregister(this);
 
-  if (buffer_start_ == nullptr) {
-    Clear();
-    return;
-  }
+  struct ClearSharedAllocator {
+    BackingStore* const bs;
+
+    ~ClearSharedAllocator() {
+      if (!bs->holds_shared_ptr_to_allocator_) return;
+      bs->type_specific_data_.v8_api_array_buffer_allocator_shared
+          .std::shared_ptr<v8::ArrayBuffer::Allocator>::~shared_ptr();
+    }
+  } clear_shared_allocator{this};
+
+  if (buffer_start_ == nullptr) return;
+
+  auto FreeResizableMemory = [this] {
+    DCHECK(free_on_destruct_);
+    DCHECK(!custom_deleter_);
+    DCHECK(is_resizable_by_js_ || is_wasm_memory_);
+    auto region =
+        GetReservedRegion(has_guard_regions_, buffer_start_, byte_capacity_);
+
+    PageAllocator* page_allocator = GetArrayBufferPageAllocator();
+    if (!region.is_empty()) {
+      FreePages(page_allocator, reinterpret_cast<void*>(region.begin()),
+                region.size());
+    }
+  };
 
 #if V8_ENABLE_WEBASSEMBLY
   if (is_wasm_memory_) {
@@ -205,7 +205,6 @@ BackingStore::~BackingStore() {
       // Deallocate the list of attached memory objects.
       SharedWasmMemoryData* shared_data = get_shared_wasm_memory_data();
       delete shared_data;
-      type_specific_data_.shared_wasm_memory_data = nullptr;
     }
     // Wasm memories are always allocated through the page allocator.
     FreeResizableMemory();
@@ -217,15 +216,16 @@ BackingStore::~BackingStore() {
     FreeResizableMemory();
     return;
   }
+
   if (custom_deleter_) {
     DCHECK(free_on_destruct_);
     TRACE_BS("BS:custom deleter bs=%p mem=%p (length=%zu, capacity=%zu)\n",
              this, buffer_start_, byte_length(), byte_capacity_);
     type_specific_data_.deleter.callback(buffer_start_, byte_length_,
                                          type_specific_data_.deleter.data);
-    Clear();
     return;
   }
+
   if (free_on_destruct_) {
     // JSArrayBuffer backing store. Deallocate through the embedder's allocator.
     auto allocator = get_v8_api_array_buffer_allocator();
@@ -233,7 +233,6 @@ BackingStore::~BackingStore() {
              buffer_start_, byte_length(), byte_capacity_);
     allocator->Free(buffer_start_, byte_length_);
   }
-  Clear();
 }
 
 // Allocate a backing store using the array buffer allocator from the embedder.
@@ -384,11 +383,11 @@ std::unique_ptr<BackingStore> BackingStore::TryAllocateAndPartiallyCommitMemory(
   // Get a pointer to the start of the buffer, skipping negative guard region
   // if necessary.
 #if V8_ENABLE_WEBASSEMBLY
-  byte* buffer_start = reinterpret_cast<byte*>(allocation_base) +
-                       (guards ? kNegativeGuardSize : 0);
+  uint8_t* buffer_start = reinterpret_cast<uint8_t*>(allocation_base) +
+                          (guards ? kNegativeGuardSize : 0);
 #else
   DCHECK(!guards);
-  byte* buffer_start = reinterpret_cast<byte*>(allocation_base);
+  uint8_t* buffer_start = reinterpret_cast<uint8_t*>(allocation_base);
 #endif
 
   //--------------------------------------------------------------------------
@@ -588,10 +587,8 @@ void BackingStore::AttachSharedWasmMemoryObject(
                                                         memory_object);
 }
 
-void BackingStore::BroadcastSharedWasmMemoryGrow(
-    Isolate* isolate, std::shared_ptr<BackingStore> backing_store) {
-  GlobalBackingStoreRegistry::BroadcastSharedWasmMemoryGrow(isolate,
-                                                            backing_store);
+void BackingStore::BroadcastSharedWasmMemoryGrow(Isolate* isolate) const {
+  GlobalBackingStoreRegistry::BroadcastSharedWasmMemoryGrow(isolate, this);
 }
 
 void BackingStore::RemoveSharedWasmMemoryObjects(Isolate* isolate) {
@@ -624,7 +621,7 @@ BackingStore::ResizeOrGrowResult BackingStore::ResizeInPlace(
     // committed page). In addition, we don't rely on all platforms always
     // zeroing decommitted-then-recommitted memory, but zero the memory
     // explicitly here.
-    memset(reinterpret_cast<byte*>(buffer_start_) + new_byte_length, 0,
+    memset(reinterpret_cast<uint8_t*>(buffer_start_) + new_byte_length, 0,
            byte_length_ - new_byte_length);
 
     // Check if we can un-commit some pages.
@@ -639,7 +636,7 @@ BackingStore::ResizeOrGrowResult BackingStore::ResizeInPlace(
       size_t old_committed_length = old_committed_pages * page_size;
       if (!i::SetPermissions(
               GetPlatformPageAllocator(),
-              reinterpret_cast<byte*>(buffer_start_) + new_committed_length,
+              reinterpret_cast<uint8_t*>(buffer_start_) + new_committed_length,
               old_committed_length - new_committed_length,
               PageAllocator::kNoAccess)) {
         return kFailure;
@@ -806,7 +803,7 @@ v8::ArrayBuffer::Allocator* BackingStore::get_v8_api_array_buffer_allocator() {
   return array_buffer_allocator;
 }
 
-SharedWasmMemoryData* BackingStore::get_shared_wasm_memory_data() {
+SharedWasmMemoryData* BackingStore::get_shared_wasm_memory_data() const {
   CHECK(is_wasm_memory_ && is_shared_);
   auto shared_wasm_memory_data = type_specific_data_.shared_wasm_memory_data;
   CHECK(shared_wasm_memory_data);
@@ -820,11 +817,9 @@ struct GlobalBackingStoreRegistryImpl {
   base::Mutex mutex_;
   std::unordered_map<const void*, std::weak_ptr<BackingStore>> map_;
 };
-base::LazyInstance<GlobalBackingStoreRegistryImpl>::type global_registry_impl_ =
-    LAZY_INSTANCE_INITIALIZER;
-inline GlobalBackingStoreRegistryImpl* impl() {
-  return global_registry_impl_.Pointer();
-}
+
+DEFINE_LAZY_LEAKY_OBJECT_GETTER(GlobalBackingStoreRegistryImpl,
+                                GetGlobalBackingStoreRegistryImpl)
 }  // namespace
 
 void GlobalBackingStoreRegistry::Register(
@@ -833,13 +828,14 @@ void GlobalBackingStoreRegistry::Register(
   // Only wasm memory backing stores need to be registered globally.
   CHECK(backing_store->is_wasm_memory());
 
-  base::MutexGuard scope_lock(&impl()->mutex_);
+  GlobalBackingStoreRegistryImpl* impl = GetGlobalBackingStoreRegistryImpl();
+  base::MutexGuard scope_lock(&impl->mutex_);
   if (backing_store->globally_registered_) return;
   TRACE_BS("BS:reg    bs=%p mem=%p (length=%zu, capacity=%zu)\n",
            backing_store.get(), backing_store->buffer_start(),
            backing_store->byte_length(), backing_store->byte_capacity());
   std::weak_ptr<BackingStore> weak = backing_store;
-  auto result = impl()->map_.insert({backing_store->buffer_start(), weak});
+  auto result = impl->map_.insert({backing_store->buffer_start(), weak});
   CHECK(result.second);
   backing_store->globally_registered_ = true;
 }
@@ -851,11 +847,12 @@ void GlobalBackingStoreRegistry::Unregister(BackingStore* backing_store) {
 
   DCHECK_NOT_NULL(backing_store->buffer_start());
 
-  base::MutexGuard scope_lock(&impl()->mutex_);
-  const auto& result = impl()->map_.find(backing_store->buffer_start());
-  if (result != impl()->map_.end()) {
+  GlobalBackingStoreRegistryImpl* impl = GetGlobalBackingStoreRegistryImpl();
+  base::MutexGuard scope_lock(&impl->mutex_);
+  const auto& result = impl->map_.find(backing_store->buffer_start());
+  if (result != impl->map_.end()) {
     DCHECK(!result->second.lock());
-    impl()->map_.erase(result);
+    impl->map_.erase(result);
   }
   backing_store->globally_registered_ = false;
 }
@@ -865,11 +862,12 @@ void GlobalBackingStoreRegistry::Purge(Isolate* isolate) {
   // in the purging loop below. Otherwise, we might get a deadlock
   // if the temporary backing store reference created in the loop is
   // the last reference. In that case the destructor of the backing store
-  // may try to take the &impl()->mutex_ in order to unregister itself.
+  // may try to take the &impl->mutex_ in order to unregister itself.
   std::vector<std::shared_ptr<BackingStore>> prevent_destruction_under_lock;
-  base::MutexGuard scope_lock(&impl()->mutex_);
+  GlobalBackingStoreRegistryImpl* impl = GetGlobalBackingStoreRegistryImpl();
+  base::MutexGuard scope_lock(&impl->mutex_);
   // Purge all entries in the map that refer to the given isolate.
-  for (auto& entry : impl()->map_) {
+  for (auto& entry : impl->map_) {
     auto backing_store = entry.second.lock();
     prevent_destruction_under_lock.emplace_back(backing_store);
     if (!backing_store) continue;  // skip entries where weak ptr is null
@@ -878,10 +876,14 @@ void GlobalBackingStoreRegistry::Purge(Isolate* isolate) {
     SharedWasmMemoryData* shared_data =
         backing_store->get_shared_wasm_memory_data();
     // Remove this isolate from the isolates list.
-    auto& isolates = shared_data->isolates_;
-    for (size_t i = 0; i < isolates.size(); i++) {
-      if (isolates[i] == isolate) isolates[i] = nullptr;
+    std::vector<Isolate*>& isolates = shared_data->isolates_;
+    auto isolates_it = std::find(isolates.begin(), isolates.end(), isolate);
+    if (isolates_it != isolates.end()) {
+      *isolates_it = isolates.back();
+      isolates.pop_back();
     }
+    DCHECK_EQ(isolates.end(),
+              std::find(isolates.begin(), isolates.end(), isolate));
   }
 }
 
@@ -893,7 +895,8 @@ void GlobalBackingStoreRegistry::AddSharedWasmMemoryObject(
   isolate->AddSharedWasmMemory(memory_object);
 
   // Add the isolate to the list of isolates sharing this backing store.
-  base::MutexGuard scope_lock(&impl()->mutex_);
+  GlobalBackingStoreRegistryImpl* impl = GetGlobalBackingStoreRegistryImpl();
+  base::MutexGuard scope_lock(&impl->mutex_);
   SharedWasmMemoryData* shared_data =
       backing_store->get_shared_wasm_memory_data();
   auto& isolates = shared_data->isolates_;
@@ -909,16 +912,16 @@ void GlobalBackingStoreRegistry::AddSharedWasmMemoryObject(
 }
 
 void GlobalBackingStoreRegistry::BroadcastSharedWasmMemoryGrow(
-    Isolate* isolate, std::shared_ptr<BackingStore> backing_store) {
+    Isolate* isolate, const BackingStore* backing_store) {
   {
+    GlobalBackingStoreRegistryImpl* impl = GetGlobalBackingStoreRegistryImpl();
     // The global lock protects the list of isolates per backing store.
-    base::MutexGuard scope_lock(&impl()->mutex_);
+    base::MutexGuard scope_lock(&impl->mutex_);
     SharedWasmMemoryData* shared_data =
         backing_store->get_shared_wasm_memory_data();
     for (Isolate* other : shared_data->isolates_) {
-      if (other && other != isolate) {
-        other->stack_guard()->RequestGrowSharedMemory();
-      }
+      if (other == isolate) continue;
+      other->stack_guard()->RequestGrowSharedMemory();
     }
   }
   // Update memory objects in this isolate.
@@ -927,22 +930,35 @@ void GlobalBackingStoreRegistry::BroadcastSharedWasmMemoryGrow(
 
 void GlobalBackingStoreRegistry::UpdateSharedWasmMemoryObjects(
     Isolate* isolate) {
+  // TODO(1445003): Remove the {AlwaysAllocateScope} after finding the root
+  // cause.
+  AlwaysAllocateScope always_allocate_scope{isolate->heap()};
+
   HandleScope scope(isolate);
   Handle<WeakArrayList> shared_wasm_memories =
       isolate->factory()->shared_wasm_memories();
 
-  for (int i = 0; i < shared_wasm_memories->length(); i++) {
-    HeapObject obj;
+  for (int i = 0, e = shared_wasm_memories->length(); i < e; ++i) {
+    Tagged<HeapObject> obj;
     if (!shared_wasm_memories->Get(i).GetHeapObject(&obj)) continue;
 
     Handle<WasmMemoryObject> memory_object(WasmMemoryObject::cast(obj),
                                            isolate);
     Handle<JSArrayBuffer> old_buffer(memory_object->array_buffer(), isolate);
     std::shared_ptr<BackingStore> backing_store = old_buffer->GetBackingStore();
+    // Wasm memory always has a BackingStore.
+    CHECK_NOT_NULL(backing_store);
+    CHECK(backing_store->is_wasm_memory());
+    CHECK(backing_store->is_shared());
+
+    // Keep a raw pointer to the backing store for a CHECK later one. Make it
+    // {void*} so we do not accidentally try to use it for anything else.
+    void* expected_backing_store = backing_store.get();
 
     Handle<JSArrayBuffer> new_buffer =
         isolate->factory()->NewJSSharedArrayBuffer(std::move(backing_store));
-    memory_object->update_instances(isolate, new_buffer);
+    CHECK_EQ(expected_backing_store, new_buffer->GetBackingStore().get());
+    memory_object->SetNewBuffer(*new_buffer);
   }
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
diff --git a/deps/v8/src/objects/backing-store.h b/deps/v8/src/objects/backing-store.h
index 66840a46ca2b56..750926ead8cb99 100644
--- a/deps/v8/src/objects/backing-store.h
+++ b/deps/v8/src/objects/backing-store.h
@@ -144,8 +144,7 @@ class V8_EXPORT_PRIVATE BackingStore : public BackingStoreBase {
   // Send asynchronous updates to attached memory objects in other isolates
   // after the backing store has been grown. Memory objects in this
   // isolate are updated synchronously.
-  static void BroadcastSharedWasmMemoryGrow(Isolate* isolate,
-                                            std::shared_ptr<BackingStore>);
+  void BroadcastSharedWasmMemoryGrow(Isolate* isolate) const;
 
   // Remove all memory objects in the given isolate that refer to this
   // backing store.
@@ -187,6 +186,10 @@ class V8_EXPORT_PRIVATE BackingStore : public BackingStoreBase {
   BackingStore& operator=(const BackingStore&) = delete;
   void SetAllocatorFromIsolate(Isolate* isolate);
 
+  // Accessors for type-specific data.
+  v8::ArrayBuffer::Allocator* get_v8_api_array_buffer_allocator();
+  SharedWasmMemoryData* get_shared_wasm_memory_data() const;
+
   void* buffer_start_ = nullptr;
   std::atomic<size_t> byte_length_;
   // Max byte length of the corresponding JSArrayBuffer(s).
@@ -196,11 +199,7 @@ class V8_EXPORT_PRIVATE BackingStore : public BackingStoreBase {
   // Unique ID of this backing store. Currently only used by DevTools, to
   // identify stores used by several ArrayBuffers or WebAssembly memories
   // (reported by the inspector as [[ArrayBufferData]] internal property)
-  uint32_t id_;
-  struct DeleterInfo {
-    v8::BackingStore::DeleterCallback callback;
-    void* data;
-  };
+  const uint32_t id_;
 
   union TypeSpecificData {
     TypeSpecificData() : v8_api_array_buffer_allocator(nullptr) {}
@@ -223,26 +222,22 @@ class V8_EXPORT_PRIVATE BackingStore : public BackingStoreBase {
 
     // Custom deleter for the backing stores that wrap memory blocks that are
     // allocated with a custom allocator.
-    DeleterInfo deleter;
+    struct DeleterInfo {
+      v8::BackingStore::DeleterCallback callback;
+      void* data;
+    } deleter;
   } type_specific_data_;
 
-  bool is_shared_ : 1;
+  const bool is_shared_ : 1;
   // Backing stores for (Resizable|GrowableShared)ArrayBuffer
-  bool is_resizable_by_js_ : 1;
-  bool is_wasm_memory_ : 1;
+  const bool is_resizable_by_js_ : 1;
+  const bool is_wasm_memory_ : 1;
   bool holds_shared_ptr_to_allocator_ : 1;
-  bool free_on_destruct_ : 1;
-  bool has_guard_regions_ : 1;
+  const bool free_on_destruct_ : 1;
+  const bool has_guard_regions_ : 1;
   bool globally_registered_ : 1;
-  bool custom_deleter_ : 1;
-  bool empty_deleter_ : 1;
-
-  // Accessors for type-specific data.
-  v8::ArrayBuffer::Allocator* get_v8_api_array_buffer_allocator();
-  SharedWasmMemoryData* get_shared_wasm_memory_data();
-
-  void FreeResizableMemory();  // Free the reserved region for resizable memory
-  void Clear();  // Internally clears fields after deallocation.
+  const bool custom_deleter_ : 1;
+  const bool empty_deleter_ : 1;
 };
 
 // A global, per-process mapping from buffer addresses to backing stores
@@ -270,8 +265,8 @@ class GlobalBackingStoreRegistry {
   static void Purge(Isolate* isolate);
 
   // Broadcast updates to all attached memory objects.
-  static void BroadcastSharedWasmMemoryGrow(
-      Isolate* isolate, std::shared_ptr<BackingStore> backing_store);
+  static void BroadcastSharedWasmMemoryGrow(Isolate* isolate,
+                                            const BackingStore* backing_store);
 
   // Update all shared memory objects in the given isolate.
   static void UpdateSharedWasmMemoryObjects(Isolate* isolate);
diff --git a/deps/v8/src/objects/bigint.cc b/deps/v8/src/objects/bigint.cc
index 8132f9edd436f4..52693852162a77 100644
--- a/deps/v8/src/objects/bigint.cc
+++ b/deps/v8/src/objects/bigint.cc
@@ -49,7 +49,7 @@ class MutableBigInt : public FreshlyAllocatedBigInt {
   template <typename Isolate = v8::internal::Isolate>
   static Handle<BigInt> MakeImmutable(Handle<MutableBigInt> result);
 
-  static void Canonicalize(MutableBigInt result);
+  static void Canonicalize(Tagged<MutableBigInt> result);
 
   // Allocation helpers.
   template <typename IsolateT>
@@ -58,7 +58,7 @@ class MutableBigInt : public FreshlyAllocatedBigInt {
       AllocationType allocation = AllocationType::kYoung);
   static Handle<BigInt> NewFromInt(Isolate* isolate, int value);
   static Handle<BigInt> NewFromDouble(Isolate* isolate, double value);
-  void InitializeDigits(int length, byte value = 0);
+  void InitializeDigits(int length, uint8_t value = 0);
   static Handle<MutableBigInt> Copy(Isolate* isolate,
                                     Handle<BigIntBase> source);
   template <typename IsolateT>
@@ -70,21 +70,21 @@ class MutableBigInt : public FreshlyAllocatedBigInt {
   }
 
   static Handle<MutableBigInt> Cast(Handle<FreshlyAllocatedBigInt> bigint) {
-    SLOW_DCHECK(bigint->IsBigInt());
+    SLOW_DCHECK(IsBigInt(*bigint));
     return Handle<MutableBigInt>::cast(bigint);
   }
-  static MutableBigInt cast(Object o) {
-    SLOW_DCHECK(o.IsBigInt());
+  static Tagged<MutableBigInt> cast(Tagged<Object> o) {
+    SLOW_DCHECK(IsBigInt(o));
     return MutableBigInt(o.ptr());
   }
-  static MutableBigInt unchecked_cast(Object o) {
+  static Tagged<MutableBigInt> unchecked_cast(Tagged<Object> o) {
     return MutableBigInt(o.ptr());
   }
 
   // Internal helpers.
   static MaybeHandle<MutableBigInt> AbsoluteAddOne(
       Isolate* isolate, Handle<BigIntBase> x, bool sign,
-      MutableBigInt result_storage = MutableBigInt());
+      Tagged<MutableBigInt> result_storage = MutableBigInt());
   static Handle<MutableBigInt> AbsoluteSubOne(Isolate* isolate,
                                               Handle<BigIntBase> x);
 
@@ -105,7 +105,7 @@ class MutableBigInt : public FreshlyAllocatedBigInt {
 
   // Returns the least significant 64 bits, simulating two's complement
   // representation.
-  static uint64_t GetRawBits(BigIntBase x, bool* lossless);
+  static uint64_t GetRawBits(Tagged<BigIntBase> x, bool* lossless);
 
   static inline bool digit_ismax(digit_t x) {
     return static_cast<digit_t>(~x) == 0;
@@ -134,7 +134,7 @@ class MutableBigInt : public FreshlyAllocatedBigInt {
 
   void set_64_bits(uint64_t bits);
 
-  bool IsMutableBigInt() const { return IsBigInt(); }
+  static bool IsMutableBigInt(Tagged<MutableBigInt> o) { return IsBigInt(o); }
 
   static_assert(std::is_same<bigint::digit_t, BigIntBase::digit_t>::value,
                 "We must be able to call BigInt library functions");
@@ -149,21 +149,21 @@ NEVER_READ_ONLY_SPACE_IMPL(MutableBigInt)
 
 #include "src/objects/object-macros-undef.h"
 
-bigint::Digits GetDigits(BigIntBase bigint) {
+bigint::Digits GetDigits(Tagged<BigIntBase> bigint) {
   return bigint::Digits(
       reinterpret_cast<bigint::digit_t*>(
           bigint.ptr() + BigIntBase::kDigitsOffset - kHeapObjectTag),
-      bigint.length());
+      bigint->length());
 }
 bigint::Digits GetDigits(Handle<BigIntBase> bigint) {
   return GetDigits(*bigint);
 }
 
-bigint::RWDigits GetRWDigits(MutableBigInt bigint) {
+bigint::RWDigits GetRWDigits(Tagged<MutableBigInt> bigint) {
   return bigint::RWDigits(
       reinterpret_cast<bigint::digit_t*>(
           bigint.ptr() + BigIntBase::kDigitsOffset - kHeapObjectTag),
-      bigint.length());
+      bigint->length());
 }
 bigint::RWDigits GetRWDigits(Handle<MutableBigInt> bigint) {
   return GetRWDigits(*bigint);
@@ -295,7 +295,7 @@ Handle<MutableBigInt> MutableBigInt::Copy(Isolate* isolate,
   return result;
 }
 
-void MutableBigInt::InitializeDigits(int length, byte value) {
+void MutableBigInt::InitializeDigits(int length, uint8_t value) {
   memset(reinterpret_cast<void*>(ptr() + kDigitsOffset - kHeapObjectTag), value,
          length * kDigitSize);
 }
@@ -313,33 +313,32 @@ Handle<BigInt> MutableBigInt::MakeImmutable(Handle<MutableBigInt> result) {
   return Handle<BigInt>::cast(result);
 }
 
-void MutableBigInt::Canonicalize(MutableBigInt result) {
+void MutableBigInt::Canonicalize(Tagged<MutableBigInt> result) {
   // Check if we need to right-trim any leading zero-digits.
-  int old_length = result.length();
+  int old_length = result->length();
   int new_length = old_length;
-  while (new_length > 0 && result.digit(new_length - 1) == 0) new_length--;
+  while (new_length > 0 && result->digit(new_length - 1) == 0) new_length--;
   int to_trim = old_length - new_length;
   if (to_trim != 0) {
-    Heap* heap = result.GetHeap();
+    Heap* heap = result->GetHeap();
     if (!heap->IsLargeObject(result)) {
       int old_size = ALIGN_TO_ALLOCATION_ALIGNMENT(BigInt::SizeFor(old_length));
       int new_size = ALIGN_TO_ALLOCATION_ALIGNMENT(BigInt::SizeFor(new_length));
       heap->NotifyObjectSizeChange(result, old_size, new_size,
-                                   ClearRecordedSlots::kNo,
-                                   UpdateInvalidatedObjectSize::kNo);
+                                   ClearRecordedSlots::kNo);
     }
-    result.set_length(new_length, kReleaseStore);
+    result->set_length(new_length, kReleaseStore);
 
     // Canonicalize -0n.
     if (new_length == 0) {
-      result.set_sign(false);
+      result->set_sign(false);
       // TODO(jkummerow): If we cache a canonical 0n, return that here.
     }
   }
-  DCHECK_IMPLIES(result.length() > 0,
-                 result.digit(result.length() - 1) != 0);  // MSD is non-zero.
+  DCHECK_IMPLIES(result->length() > 0,
+                 result->digit(result->length() - 1) != 0);  // MSD is non-zero.
   // Callers that don't require trimming must ensure this themselves.
-  DCHECK_IMPLIES(result.length() == 0, result.sign() == false);
+  DCHECK_IMPLIES(result->length() == 0, result->sign() == false);
 }
 
 template <typename IsolateT>
@@ -620,11 +619,11 @@ ComparisonResult BigInt::CompareToBigInt(Handle<BigInt> x, Handle<BigInt> y) {
   return ComparisonResult::kEqual;
 }
 
-bool BigInt::EqualToBigInt(BigInt x, BigInt y) {
-  if (x.sign() != y.sign()) return false;
-  if (x.length() != y.length()) return false;
-  for (int i = 0; i < x.length(); i++) {
-    if (x.digit(i) != y.digit(i)) return false;
+bool BigInt::EqualToBigInt(Tagged<BigInt> x, Tagged<BigInt> y) {
+  if (x->sign() != y->sign()) return false;
+  if (x->length() != y->length()) return false;
+  for (int i = 0; i < x->length(); i++) {
+    if (x->digit(i) != y->digit(i)) return false;
   }
   return true;
 }
@@ -769,11 +768,11 @@ Maybe<bool> BigInt::EqualToString(Isolate* isolate, Handle<BigInt> x,
 }
 
 bool BigInt::EqualToNumber(Handle<BigInt> x, Handle<Object> y) {
-  DCHECK(y->IsNumber());
+  DCHECK(IsNumber(*y));
   // a. If x or y are any of NaN, +∞, or -∞, return false.
   // b. If the mathematical value of x is equal to the mathematical value of y,
   //    return true, otherwise return false.
-  if (y->IsSmi()) {
+  if (IsSmi(*y)) {
     int value = Smi::ToInt(*y);
     if (value == 0) return x->is_zero();
     // Any multi-digit BigInt is bigger than a Smi.
@@ -782,14 +781,14 @@ bool BigInt::EqualToNumber(Handle<BigInt> x, Handle<Object> y) {
            (x->digit(0) ==
             static_cast<digit_t>(std::abs(static_cast<int64_t>(value))));
   }
-  DCHECK(y->IsHeapNumber());
+  DCHECK(IsHeapNumber(*y));
   double value = Handle<HeapNumber>::cast(y)->value();
   return CompareToDouble(x, value) == ComparisonResult::kEqual;
 }
 
 ComparisonResult BigInt::CompareToNumber(Handle<BigInt> x, Handle<Object> y) {
-  DCHECK(y->IsNumber());
-  if (y->IsSmi()) {
+  DCHECK(IsNumber(*y));
+  if (IsSmi(*y)) {
     bool x_sign = x->sign();
     int y_value = Smi::ToInt(*y);
     bool y_sign = (y_value < 0);
@@ -810,7 +809,7 @@ ComparisonResult BigInt::CompareToNumber(Handle<BigInt> x, Handle<Object> y) {
     if (x_digit < abs_value) return AbsoluteLess(x_sign);
     return ComparisonResult::kEqual;
   }
-  DCHECK(y->IsHeapNumber());
+  DCHECK(IsHeapNumber(*y));
   double value = Handle<HeapNumber>::cast(y)->value();
   return CompareToDouble(x, value);
 }
@@ -927,16 +926,15 @@ void RightTrimString(Isolate* isolate, Handle<SeqOneByteString> string,
                      int chars_allocated, int chars_written) {
   DCHECK_LE(chars_written, chars_allocated);
   if (chars_written == chars_allocated) return;
-  string->set_length(chars_written, kReleaseStore);
   int string_size =
       ALIGN_TO_ALLOCATION_ALIGNMENT(SeqOneByteString::SizeFor(chars_allocated));
   int needed_size =
       ALIGN_TO_ALLOCATION_ALIGNMENT(SeqOneByteString::SizeFor(chars_written));
   if (needed_size < string_size && !isolate->heap()->IsLargeObject(*string)) {
     isolate->heap()->NotifyObjectSizeChange(*string, string_size, needed_size,
-                                            ClearRecordedSlots::kNo,
-                                            UpdateInvalidatedObjectSize::kNo);
+                                            ClearRecordedSlots::kNo);
   }
+  string->set_length(chars_written, kReleaseStore);
 }
 
 }  // namespace
@@ -1060,11 +1058,11 @@ Handle<String> BigInt::NoSideEffectsToString(Isolate* isolate,
 
 MaybeHandle<BigInt> BigInt::FromNumber(Isolate* isolate,
                                        Handle<Object> number) {
-  DCHECK(number->IsNumber());
-  if (number->IsSmi()) {
+  DCHECK(IsNumber(*number));
+  if (IsSmi(*number)) {
     return MutableBigInt::NewFromInt(isolate, Smi::ToInt(*number));
   }
-  double value = HeapNumber::cast(*number).value();
+  double value = HeapNumber::cast(*number)->value();
   if (!std::isfinite(value) || (DoubleToInteger(value) != value)) {
     THROW_NEW_ERROR(isolate,
                     NewRangeError(MessageTemplate::kBigIntFromNumber, number),
@@ -1074,7 +1072,7 @@ MaybeHandle<BigInt> BigInt::FromNumber(Isolate* isolate,
 }
 
 MaybeHandle<BigInt> BigInt::FromObject(Isolate* isolate, Handle<Object> obj) {
-  if (obj->IsJSReceiver()) {
+  if (IsJSReceiver(*obj)) {
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, obj,
         JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(obj),
@@ -1082,13 +1080,14 @@ MaybeHandle<BigInt> BigInt::FromObject(Isolate* isolate, Handle<Object> obj) {
         BigInt);
   }
 
-  if (obj->IsBoolean()) {
-    return MutableBigInt::NewFromInt(isolate, obj->BooleanValue(isolate));
+  if (IsBoolean(*obj)) {
+    return MutableBigInt::NewFromInt(isolate,
+                                     Object::BooleanValue(*obj, isolate));
   }
-  if (obj->IsBigInt()) {
+  if (IsBigInt(*obj)) {
     return Handle<BigInt>::cast(obj);
   }
-  if (obj->IsString()) {
+  if (IsString(*obj)) {
     Handle<BigInt> n;
     if (!StringToBigInt(isolate, Handle<String>::cast(obj)).ToHandle(&n)) {
       if (isolate->has_pending_exception()) {
@@ -1237,7 +1236,7 @@ void BigInt::BigIntShortPrint(std::ostream& os) {
 // modification.
 MaybeHandle<MutableBigInt> MutableBigInt::AbsoluteAddOne(
     Isolate* isolate, Handle<BigIntBase> x, bool sign,
-    MutableBigInt result_storage) {
+    Tagged<MutableBigInt> result_storage) {
   int input_length = x->length();
   // The addition will overflow into a new digit if all existing digits are
   // at maximum.
@@ -1440,10 +1439,10 @@ MaybeHandle<BigInt> BigInt::FromSerializedDigits(
   }
   if (bytelength % kDigitSize) {
     *digit = 0;
-    byte* digit_byte = reinterpret_cast<byte*>(digit);
+    uint8_t* digit_byte = reinterpret_cast<uint8_t*>(digit);
     digit_byte += sizeof(*digit) - 1;
-    const byte* digit_storage_byte =
-        reinterpret_cast<const byte*>(digit_storage);
+    const uint8_t* digit_storage_byte =
+        reinterpret_cast<const uint8_t*>(digit_storage);
     for (int i = 0; i < bytelength % kDigitSize; i++) {
       *digit_byte = *digit_storage_byte;
       digit_byte--;
@@ -1588,18 +1587,18 @@ void BigInt::ToWordsArray64(int* sign_bit, int* words64_count,
   }
 }
 
-uint64_t MutableBigInt::GetRawBits(BigIntBase x, bool* lossless) {
+uint64_t MutableBigInt::GetRawBits(Tagged<BigIntBase> x, bool* lossless) {
   if (lossless != nullptr) *lossless = true;
-  if (x.is_zero()) return 0;
-  int len = x.length();
+  if (x->is_zero()) return 0;
+  int len = x->length();
   static_assert(kDigitBits == 64 || kDigitBits == 32);
   if (lossless != nullptr && len > 64 / kDigitBits) *lossless = false;
-  uint64_t raw = static_cast<uint64_t>(x.digit(0));
+  uint64_t raw = static_cast<uint64_t>(x->digit(0));
   if (kDigitBits == 32 && len > 1) {
-    raw |= static_cast<uint64_t>(x.digit(1)) << 32;
+    raw |= static_cast<uint64_t>(x->digit(1)) << 32;
   }
   // Simulate two's complement. MSVC dislikes "-raw".
-  return x.sign() ? ((~raw) + 1u) : raw;
+  return x->sign() ? ((~raw) + 1u) : raw;
 }
 
 int64_t BigInt::AsInt64(bool* lossless) {
@@ -1644,26 +1643,26 @@ void BigIntBase::BigIntBasePrint(std::ostream& os) {
 
 void MutableBigInt_AbsoluteAddAndCanonicalize(Address result_addr,
                                               Address x_addr, Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::Add(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
 }
 
 int32_t MutableBigInt_AbsoluteCompare(Address x_addr, Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
 
   return bigint::Compare(GetDigits(x), GetDigits(y));
 }
 
 void MutableBigInt_AbsoluteSubAndCanonicalize(Address result_addr,
                                               Address x_addr, Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::Subtract(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1674,9 +1673,9 @@ void MutableBigInt_AbsoluteSubAndCanonicalize(Address result_addr,
 int32_t MutableBigInt_AbsoluteMulAndCanonicalize(Address result_addr,
                                                  Address x_addr,
                                                  Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   Isolate* isolate;
   if (!GetIsolateFromHeapObject(x, &isolate)) {
@@ -1697,10 +1696,10 @@ int32_t MutableBigInt_AbsoluteMulAndCanonicalize(Address result_addr,
 int32_t MutableBigInt_AbsoluteDivAndCanonicalize(Address result_addr,
                                                  Address x_addr,
                                                  Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
-  DCHECK_GE(result.length(),
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
+  DCHECK_GE(result->length(),
             bigint::DivideResultLength(GetDigits(x), GetDigits(y)));
 
   Isolate* isolate;
@@ -1722,9 +1721,9 @@ int32_t MutableBigInt_AbsoluteDivAndCanonicalize(Address result_addr,
 int32_t MutableBigInt_AbsoluteModAndCanonicalize(Address result_addr,
                                                  Address x_addr,
                                                  Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   Isolate* isolate;
   if (!GetIsolateFromHeapObject(x, &isolate)) {
@@ -1745,9 +1744,9 @@ int32_t MutableBigInt_AbsoluteModAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseAndPosPosAndCanonicalize(Address result_addr,
                                                    Address x_addr,
                                                    Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseAnd_PosPos(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1756,9 +1755,9 @@ void MutableBigInt_BitwiseAndPosPosAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseAndNegNegAndCanonicalize(Address result_addr,
                                                    Address x_addr,
                                                    Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseAnd_NegNeg(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1767,9 +1766,9 @@ void MutableBigInt_BitwiseAndNegNegAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseAndPosNegAndCanonicalize(Address result_addr,
                                                    Address x_addr,
                                                    Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseAnd_PosNeg(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1778,9 +1777,9 @@ void MutableBigInt_BitwiseAndPosNegAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseOrPosPosAndCanonicalize(Address result_addr,
                                                   Address x_addr,
                                                   Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseOr_PosPos(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1789,9 +1788,9 @@ void MutableBigInt_BitwiseOrPosPosAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseOrNegNegAndCanonicalize(Address result_addr,
                                                   Address x_addr,
                                                   Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseOr_NegNeg(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1800,9 +1799,9 @@ void MutableBigInt_BitwiseOrNegNegAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseOrPosNegAndCanonicalize(Address result_addr,
                                                   Address x_addr,
                                                   Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseOr_PosNeg(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1811,9 +1810,9 @@ void MutableBigInt_BitwiseOrPosNegAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseXorPosPosAndCanonicalize(Address result_addr,
                                                    Address x_addr,
                                                    Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseXor_PosPos(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1822,9 +1821,9 @@ void MutableBigInt_BitwiseXorPosPosAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseXorNegNegAndCanonicalize(Address result_addr,
                                                    Address x_addr,
                                                    Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseXor_NegNeg(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1833,9 +1832,9 @@ void MutableBigInt_BitwiseXorNegNegAndCanonicalize(Address result_addr,
 void MutableBigInt_BitwiseXorPosNegAndCanonicalize(Address result_addr,
                                                    Address x_addr,
                                                    Address y_addr) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  BigInt y = BigInt::cast(Object(y_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> y = BigInt::cast(Object(y_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::BitwiseXor_PosNeg(GetRWDigits(result), GetDigits(x), GetDigits(y));
   MutableBigInt::Canonicalize(result);
@@ -1843,8 +1842,8 @@ void MutableBigInt_BitwiseXorPosNegAndCanonicalize(Address result_addr,
 
 void MutableBigInt_LeftShiftAndCanonicalize(Address result_addr, Address x_addr,
                                             intptr_t shift) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
 
   bigint::LeftShift(GetRWDigits(result), GetDigits(x), shift);
   MutableBigInt::Canonicalize(result);
@@ -1852,7 +1851,7 @@ void MutableBigInt_LeftShiftAndCanonicalize(Address result_addr, Address x_addr,
 
 uint32_t RightShiftResultLength(Address x_addr, uint32_t x_sign,
                                 intptr_t shift) {
-  BigInt x = BigInt::cast(Object(x_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
   bigint::RightShiftState state;
   int length =
       bigint::RightShift_ResultLength(GetDigits(x), x_sign, shift, &state);
@@ -1866,8 +1865,8 @@ uint32_t RightShiftResultLength(Address x_addr, uint32_t x_sign,
 void MutableBigInt_RightShiftAndCanonicalize(Address result_addr,
                                              Address x_addr, intptr_t shift,
                                              uint32_t must_round_down) {
-  BigInt x = BigInt::cast(Object(x_addr));
-  MutableBigInt result = MutableBigInt::cast(Object(result_addr));
+  Tagged<BigInt> x = BigInt::cast(Object(x_addr));
+  Tagged<MutableBigInt> result = MutableBigInt::cast(Object(result_addr));
   bigint::RightShiftState state{must_round_down == 1};
   bigint::RightShift(GetRWDigits(result), GetDigits(x), shift, state);
   MutableBigInt::Canonicalize(result);
diff --git a/deps/v8/src/objects/bigint.h b/deps/v8/src/objects/bigint.h
index 44ac1815a49079..2b517b4c538b69 100644
--- a/deps/v8/src/objects/bigint.h
+++ b/deps/v8/src/objects/bigint.h
@@ -168,8 +168,9 @@ class FreshlyAllocatedBigInt : public BigIntBase {
   //   (and no explicit operator is provided either).
 
  public:
-  inline static FreshlyAllocatedBigInt cast(Object object);
-  inline static FreshlyAllocatedBigInt unchecked_cast(Object o) {
+  inline static Tagged<FreshlyAllocatedBigInt> cast(Tagged<Object> object);
+  inline static Tagged<FreshlyAllocatedBigInt> unchecked_cast(
+      Tagged<Object> o) {
     return base::bit_cast<FreshlyAllocatedBigInt>(o);
   }
 
@@ -184,7 +185,9 @@ class FreshlyAllocatedBigInt : public BigIntBase {
 
  private:
   // Only serves to make macros happy; other code should use IsBigInt.
-  bool IsFreshlyAllocatedBigInt() const { return true; }
+  static bool IsFreshlyAllocatedBigInt(Tagged<FreshlyAllocatedBigInt>) {
+    return true;
+  }
 
   OBJECT_CONSTRUCTORS(FreshlyAllocatedBigInt, BigIntBase);
 };
@@ -219,7 +222,7 @@ class BigInt : public BigIntBase {
                                                 Handle<BigInt> y);
   // More convenient version of "bool LessThan(x, y)".
   static ComparisonResult CompareToBigInt(Handle<BigInt> x, Handle<BigInt> y);
-  static bool EqualToBigInt(BigInt x, BigInt y);
+  static bool EqualToBigInt(Tagged<BigInt> x, Tagged<BigInt> y);
   static MaybeHandle<BigInt> BitwiseAnd(Isolate* isolate, Handle<BigInt> x,
                                         Handle<BigInt> y);
   static MaybeHandle<BigInt> BitwiseXor(Isolate* isolate, Handle<BigInt> x,
@@ -256,7 +259,8 @@ class BigInt : public BigIntBase {
 
   V8_EXPORT_PRIVATE static Handle<BigInt> FromInt64(Isolate* isolate,
                                                     int64_t n);
-  static Handle<BigInt> FromUint64(Isolate* isolate, uint64_t n);
+  V8_EXPORT_PRIVATE static Handle<BigInt> FromUint64(Isolate* isolate,
+                                                     uint64_t n);
   static MaybeHandle<BigInt> FromWords64(Isolate* isolate, int sign_bit,
                                          int words64_count,
                                          const uint64_t* words);
diff --git a/deps/v8/src/objects/bytecode-array-inl.h b/deps/v8/src/objects/bytecode-array-inl.h
new file mode 100644
index 00000000000000..07d7814c5177c2
--- /dev/null
+++ b/deps/v8/src/objects/bytecode-array-inl.h
@@ -0,0 +1,172 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_BYTECODE_ARRAY_INL_H_
+#define V8_OBJECTS_BYTECODE_ARRAY_INL_H_
+
+#include "src/common/ptr-compr-inl.h"
+#include "src/heap/heap-write-barrier-inl.h"
+#include "src/interpreter/bytecode-register.h"
+#include "src/objects/bytecode-array.h"
+#include "src/objects/fixed-array-inl.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+#include "torque-generated/src/objects/bytecode-array-tq-inl.inc"
+
+TQ_OBJECT_CONSTRUCTORS_IMPL(BytecodeArray)
+
+uint8_t BytecodeArray::get(int index) const {
+  DCHECK(index >= 0 && index < this->length());
+  return ReadField<uint8_t>(kHeaderSize + index * kCharSize);
+}
+
+void BytecodeArray::set(int index, uint8_t value) {
+  DCHECK(index >= 0 && index < this->length());
+  WriteField<uint8_t>(kHeaderSize + index * kCharSize, value);
+}
+
+void BytecodeArray::set_frame_size(int32_t frame_size) {
+  DCHECK_GE(frame_size, 0);
+  DCHECK(IsAligned(frame_size, kSystemPointerSize));
+  WriteField<int32_t>(kFrameSizeOffset, frame_size);
+}
+
+int32_t BytecodeArray::frame_size() const {
+  return ReadField<int32_t>(kFrameSizeOffset);
+}
+
+int BytecodeArray::register_count() const {
+  return static_cast<int>(frame_size()) / kSystemPointerSize;
+}
+
+void BytecodeArray::set_parameter_count(int32_t number_of_parameters) {
+  DCHECK_GE(number_of_parameters, 0);
+  // Parameter count is stored as the size on stack of the parameters to allow
+  // it to be used directly by generated code.
+  WriteField<int32_t>(kParameterSizeOffset,
+                      (number_of_parameters << kSystemPointerSizeLog2));
+}
+
+interpreter::Register BytecodeArray::incoming_new_target_or_generator_register()
+    const {
+  int32_t register_operand =
+      ReadField<int32_t>(kIncomingNewTargetOrGeneratorRegisterOffset);
+  if (register_operand == 0) {
+    return interpreter::Register::invalid_value();
+  } else {
+    return interpreter::Register::FromOperand(register_operand);
+  }
+}
+
+void BytecodeArray::set_incoming_new_target_or_generator_register(
+    interpreter::Register incoming_new_target_or_generator_register) {
+  if (!incoming_new_target_or_generator_register.is_valid()) {
+    WriteField<int32_t>(kIncomingNewTargetOrGeneratorRegisterOffset, 0);
+  } else {
+    DCHECK(incoming_new_target_or_generator_register.index() <
+           register_count());
+    DCHECK_NE(0, incoming_new_target_or_generator_register.ToOperand());
+    WriteField<int32_t>(kIncomingNewTargetOrGeneratorRegisterOffset,
+                        incoming_new_target_or_generator_register.ToOperand());
+  }
+}
+
+int32_t BytecodeArray::parameter_count() const {
+  // Parameter count is stored as the size on stack of the parameters to allow
+  // it to be used directly by generated code.
+  return ReadField<int32_t>(kParameterSizeOffset) >> kSystemPointerSizeLog2;
+}
+
+void BytecodeArray::clear_padding() {
+  int data_size = kHeaderSize + length();
+  memset(reinterpret_cast<void*>(address() + data_size), 0,
+         SizeFor(length()) - data_size);
+}
+
+Address BytecodeArray::GetFirstBytecodeAddress() {
+  return ptr() - kHeapObjectTag + kHeaderSize;
+}
+
+bool BytecodeArray::HasSourcePositionTable() const {
+  Tagged<Object> maybe_table = source_position_table(kAcquireLoad);
+  return !(IsUndefined(maybe_table) || DidSourcePositionGenerationFail());
+}
+
+bool BytecodeArray::DidSourcePositionGenerationFail() const {
+  return IsException(source_position_table(kAcquireLoad));
+}
+
+void BytecodeArray::SetSourcePositionsFailedToCollect() {
+  set_source_position_table(GetReadOnlyRoots().exception(), kReleaseStore);
+}
+
+DEF_GETTER(BytecodeArray, SourcePositionTable, Tagged<ByteArray>) {
+  // WARNING: This function may be called from a background thread, hence
+  // changes to how it accesses the heap can easily lead to bugs.
+  Tagged<Object> maybe_table = source_position_table(cage_base, kAcquireLoad);
+  if (IsByteArray(maybe_table, cage_base)) return ByteArray::cast(maybe_table);
+  ReadOnlyRoots roots = GetReadOnlyRoots();
+  DCHECK(IsUndefined(maybe_table, roots) || IsException(maybe_table, roots));
+  return roots.empty_byte_array();
+}
+
+DEF_GETTER(BytecodeArray, raw_constant_pool, Tagged<Object>) {
+  Tagged<Object> value =
+      TaggedField<Object>::load(cage_base, *this, kConstantPoolOffset);
+  // This field might be 0 during deserialization.
+  DCHECK(value == Smi::zero() || IsFixedArray(value));
+  return value;
+}
+
+DEF_GETTER(BytecodeArray, raw_handler_table, Tagged<Object>) {
+  Tagged<Object> value =
+      TaggedField<Object>::load(cage_base, *this, kHandlerTableOffset);
+  // This field might be 0 during deserialization.
+  DCHECK(value == Smi::zero() || IsByteArray(value));
+  return value;
+}
+
+DEF_GETTER(BytecodeArray, raw_source_position_table, Tagged<Object>) {
+  Tagged<Object> value =
+      TaggedField<Object>::load(cage_base, *this, kSourcePositionTableOffset);
+  // This field might be 0 during deserialization.
+  DCHECK(value == Smi::zero() || IsByteArray(value) || IsUndefined(value) ||
+         IsException(value));
+  return value;
+}
+
+int BytecodeArray::BytecodeArraySize() const { return SizeFor(this->length()); }
+
+DEF_GETTER(BytecodeArray, SizeIncludingMetadata, int) {
+  int size = BytecodeArraySize();
+  Tagged<Object> maybe_constant_pool = raw_constant_pool(cage_base);
+  if (IsFixedArray(maybe_constant_pool)) {
+    size += FixedArray::cast(maybe_constant_pool)->Size(cage_base);
+  } else {
+    DCHECK_EQ(maybe_constant_pool, Smi::zero());
+  }
+  Tagged<Object> maybe_handler_table = raw_handler_table(cage_base);
+  if (IsByteArray(maybe_handler_table)) {
+    size += ByteArray::cast(maybe_handler_table)->Size();
+  } else {
+    DCHECK_EQ(maybe_handler_table, Smi::zero());
+  }
+  Tagged<Object> maybe_table = raw_source_position_table(cage_base);
+  if (IsByteArray(maybe_table)) {
+    size += ByteArray::cast(maybe_table)->Size();
+  }
+  return size;
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_BYTECODE_ARRAY_INL_H_
diff --git a/deps/v8/src/objects/bytecode-array.cc b/deps/v8/src/objects/bytecode-array.cc
new file mode 100644
index 00000000000000..a05f7ac6f73aca
--- /dev/null
+++ b/deps/v8/src/objects/bytecode-array.cc
@@ -0,0 +1,168 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/objects/bytecode-array.h"
+
+#include <iomanip>
+
+#include "src/codegen/handler-table.h"
+#include "src/codegen/source-position-table.h"
+#include "src/interpreter/bytecode-array-iterator.h"
+#include "src/interpreter/bytecode-decoder.h"
+#include "src/objects/bytecode-array-inl.h"
+#include "src/utils/memcopy.h"
+
+namespace v8 {
+namespace internal {
+
+void BytecodeArray::PrintJson(std::ostream& os) {
+  DisallowGarbageCollection no_gc;
+
+  Address base_address = GetFirstBytecodeAddress();
+  BytecodeArray handle_storage = *this;
+  Handle<BytecodeArray> handle(reinterpret_cast<Address*>(&handle_storage));
+  interpreter::BytecodeArrayIterator iterator(handle);
+  bool first_data = true;
+
+  os << "{\"data\": [";
+
+  while (!iterator.done()) {
+    if (!first_data) os << ", ";
+    Address current_address = base_address + iterator.current_offset();
+    first_data = false;
+
+    os << "{\"offset\":" << iterator.current_offset() << ", \"disassembly\":\"";
+    interpreter::BytecodeDecoder::Decode(
+        os, reinterpret_cast<uint8_t*>(current_address), false);
+
+    if (interpreter::Bytecodes::IsJump(iterator.current_bytecode())) {
+      os << " (" << iterator.GetJumpTargetOffset() << ")";
+    }
+
+    if (interpreter::Bytecodes::IsSwitch(iterator.current_bytecode())) {
+      os << " {";
+      bool first_entry = true;
+      for (interpreter::JumpTableTargetOffset entry :
+           iterator.GetJumpTableTargetOffsets()) {
+        if (!first_entry) os << ", ";
+        first_entry = false;
+        os << entry.target_offset;
+      }
+      os << "}";
+    }
+
+    os << "\"}";
+    iterator.Advance();
+  }
+
+  os << "]";
+
+  int constant_pool_lenght = constant_pool()->length();
+  if (constant_pool_lenght > 0) {
+    os << ", \"constantPool\": [";
+    for (int i = 0; i < constant_pool_lenght; i++) {
+      Object object = constant_pool()->get(i);
+      if (i > 0) os << ", ";
+      os << "\"" << object << "\"";
+    }
+    os << "]";
+  }
+
+  os << "}";
+}
+
+void BytecodeArray::Disassemble(std::ostream& os) {
+  DisallowGarbageCollection no_gc;
+  // Storage for backing the handle passed to the iterator. This handle won't be
+  // updated by the gc, but that's ok because we've disallowed GCs anyway.
+  BytecodeArray handle_storage = *this;
+  Handle<BytecodeArray> handle(reinterpret_cast<Address*>(&handle_storage));
+  Disassemble(handle, os);
+}
+
+// static
+void BytecodeArray::Disassemble(Handle<BytecodeArray> handle,
+                                std::ostream& os) {
+  DisallowGarbageCollection no_gc;
+
+  os << "Parameter count " << handle->parameter_count() << "\n";
+  os << "Register count " << handle->register_count() << "\n";
+  os << "Frame size " << handle->frame_size() << "\n";
+
+  Address base_address = handle->GetFirstBytecodeAddress();
+  SourcePositionTableIterator source_positions(handle->SourcePositionTable());
+
+  interpreter::BytecodeArrayIterator iterator(handle);
+  while (!iterator.done()) {
+    if (!source_positions.done() &&
+        iterator.current_offset() == source_positions.code_offset()) {
+      os << std::setw(5) << source_positions.source_position().ScriptOffset();
+      os << (source_positions.is_statement() ? " S> " : " E> ");
+      source_positions.Advance();
+    } else {
+      os << "         ";
+    }
+    Address current_address = base_address + iterator.current_offset();
+    os << reinterpret_cast<const void*>(current_address) << " @ "
+       << std::setw(4) << iterator.current_offset() << " : ";
+    interpreter::BytecodeDecoder::Decode(
+        os, reinterpret_cast<uint8_t*>(current_address));
+    if (interpreter::Bytecodes::IsJump(iterator.current_bytecode())) {
+      Address jump_target = base_address + iterator.GetJumpTargetOffset();
+      os << " (" << reinterpret_cast<void*>(jump_target) << " @ "
+         << iterator.GetJumpTargetOffset() << ")";
+    }
+    if (interpreter::Bytecodes::IsSwitch(iterator.current_bytecode())) {
+      os << " {";
+      bool first_entry = true;
+      for (interpreter::JumpTableTargetOffset entry :
+           iterator.GetJumpTableTargetOffsets()) {
+        if (first_entry) {
+          first_entry = false;
+        } else {
+          os << ",";
+        }
+        os << " " << entry.case_value << ": @" << entry.target_offset;
+      }
+      os << " }";
+    }
+    os << std::endl;
+    iterator.Advance();
+  }
+
+  os << "Constant pool (size = " << handle->constant_pool()->length() << ")\n";
+#ifdef OBJECT_PRINT
+  if (handle->constant_pool()->length() > 0) {
+    Print(handle->constant_pool(), os);
+  }
+#endif
+
+  os << "Handler Table (size = " << handle->handler_table()->length() << ")\n";
+#ifdef ENABLE_DISASSEMBLER
+  if (handle->handler_table()->length() > 0) {
+    HandlerTable table(*handle);
+    table.HandlerTableRangePrint(os);
+  }
+#endif
+
+  ByteArray source_position_table = handle->SourcePositionTable();
+  os << "Source Position Table (size = " << source_position_table->length()
+     << ")\n";
+#ifdef OBJECT_PRINT
+  if (source_position_table->length() > 0) {
+    os << Brief(source_position_table) << std::endl;
+  }
+#endif
+}
+
+void BytecodeArray::CopyBytecodesTo(Tagged<BytecodeArray> to) {
+  BytecodeArray from = *this;
+  DCHECK_EQ(from->length(), to->length());
+  CopyBytes(reinterpret_cast<uint8_t*>(to->GetFirstBytecodeAddress()),
+            reinterpret_cast<uint8_t*>(from->GetFirstBytecodeAddress()),
+            from->length());
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/objects/bytecode-array.h b/deps/v8/src/objects/bytecode-array.h
new file mode 100644
index 00000000000000..48b7fd11c072eb
--- /dev/null
+++ b/deps/v8/src/objects/bytecode-array.h
@@ -0,0 +1,108 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_BYTECODE_ARRAY_H_
+#define V8_OBJECTS_BYTECODE_ARRAY_H_
+
+#include "src/objects/fixed-array.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+namespace interpreter {
+class Register;
+}  // namespace interpreter
+
+#include "torque-generated/src/objects/bytecode-array-tq.inc"
+
+// BytecodeArray represents a sequence of interpreter bytecodes.
+class BytecodeArray
+    : public TorqueGeneratedBytecodeArray<BytecodeArray, FixedArrayBase> {
+ public:
+  static constexpr int SizeFor(int length) {
+    return OBJECT_POINTER_ALIGN(kHeaderSize + length);
+  }
+
+  inline uint8_t get(int index) const;
+  inline void set(int index, uint8_t value);
+
+  inline Address GetFirstBytecodeAddress();
+
+  inline int32_t frame_size() const;
+  inline void set_frame_size(int32_t frame_size);
+
+  // Note: The register count is derived from frame_size.
+  inline int register_count() const;
+
+  // Note: the parameter count includes the implicit 'this' receiver.
+  inline int32_t parameter_count() const;
+  inline void set_parameter_count(int32_t number_of_parameters);
+
+  inline interpreter::Register incoming_new_target_or_generator_register()
+      const;
+  inline void set_incoming_new_target_or_generator_register(
+      interpreter::Register incoming_new_target_or_generator_register);
+
+  inline bool HasSourcePositionTable() const;
+  inline bool DidSourcePositionGenerationFail() const;
+
+  // If source positions have not been collected or an exception has been thrown
+  // this will return empty_byte_array.
+  DECL_GETTER(SourcePositionTable, Tagged<ByteArray>)
+
+  // Raw accessors to access these fields during code cache deserialization.
+  DECL_GETTER(raw_constant_pool, Tagged<Object>)
+  DECL_GETTER(raw_handler_table, Tagged<Object>)
+  DECL_GETTER(raw_source_position_table, Tagged<Object>)
+
+  // Indicates that an attempt was made to collect source positions, but that it
+  // failed most likely due to stack exhaustion. When in this state
+  // |SourcePositionTable| will return an empty byte array rather than crashing
+  // as it would if no attempt was ever made to collect source positions.
+  inline void SetSourcePositionsFailedToCollect();
+
+  inline int BytecodeArraySize() const;
+
+  // Returns the size of bytecode and its metadata. This includes the size of
+  // bytecode, constant pool, source position table, and handler table.
+  DECL_GETTER(SizeIncludingMetadata, int)
+
+  DECL_PRINTER(BytecodeArray)
+  DECL_VERIFIER(BytecodeArray)
+
+  V8_EXPORT_PRIVATE void PrintJson(std::ostream& os);
+  V8_EXPORT_PRIVATE void Disassemble(std::ostream& os);
+
+  V8_EXPORT_PRIVATE static void Disassemble(Handle<BytecodeArray> handle,
+                                            std::ostream& os);
+
+  void CopyBytecodesTo(Tagged<BytecodeArray> to);
+
+  // Clear uninitialized padding space. This ensures that the snapshot content
+  // is deterministic.
+  inline void clear_padding();
+
+  // Maximal memory consumption for a single BytecodeArray.
+  static const int kMaxSize = 512 * MB;
+  // Maximal length of a single BytecodeArray.
+  static const int kMaxLength = kMaxSize - kHeaderSize;
+
+  class BodyDescriptor;
+
+ private:
+  // Hide accessors inherited from generated class. Use parameter_count instead.
+  DECL_INT_ACCESSORS(parameter_size)
+
+  TQ_OBJECT_CONSTRUCTORS(BytecodeArray)
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_BYTECODE_ARRAY_H_
diff --git a/deps/v8/src/objects/code.tq b/deps/v8/src/objects/bytecode-array.tq
similarity index 91%
rename from deps/v8/src/objects/code.tq
rename to deps/v8/src/objects/bytecode-array.tq
index af6da378b62506..6d82bba128090b 100644
--- a/deps/v8/src/objects/code.tq
+++ b/deps/v8/src/objects/bytecode-array.tq
@@ -22,8 +22,6 @@ extern class BytecodeArray extends FixedArrayBase {
   frame_size: int32;
   parameter_size: int32;
   incoming_new_target_or_generator_register: int32;
-  // TODO(jgruber): Only 3 bits are in use; if bits are needed, steal here.
-  bytecode_age: uint16;
 }
 
 extern class Code extends HeapObject;
diff --git a/deps/v8/src/objects/call-site-info-inl.h b/deps/v8/src/objects/call-site-info-inl.h
index 8ea7d8d7471be2..6f8400ce149a08 100644
--- a/deps/v8/src/objects/call-site-info-inl.h
+++ b/deps/v8/src/objects/call-site-info-inl.h
@@ -26,16 +26,18 @@ BOOL_GETTER(CallSiteInfo, flags, IsWasm, IsWasmBit::kShift)
 BOOL_GETTER(CallSiteInfo, flags, IsAsmJsWasm, IsAsmJsWasmBit::kShift)
 BOOL_GETTER(CallSiteInfo, flags, IsAsmJsAtNumberConversion,
             IsAsmJsAtNumberConversionBit::kShift)
+BOOL_GETTER(CallSiteInfo, flags, IsBuiltin, IsBuiltinBit::kShift)
 #endif  // V8_ENABLE_WEBASSEMBLY
 BOOL_GETTER(CallSiteInfo, flags, IsStrict, IsStrictBit::kShift)
 BOOL_GETTER(CallSiteInfo, flags, IsConstructor, IsConstructorBit::kShift)
 BOOL_GETTER(CallSiteInfo, flags, IsAsync, IsAsyncBit::kShift)
 
-DEF_GETTER(CallSiteInfo, code_object, HeapObject) {
+DEF_GETTER(CallSiteInfo, code_object, Tagged<HeapObject>) {
   return TorqueGeneratedClass::code_object(cage_base);
 }
 
-void CallSiteInfo::set_code_object(HeapObject code, WriteBarrierMode mode) {
+void CallSiteInfo::set_code_object(Tagged<HeapObject> code,
+                                   WriteBarrierMode mode) {
   DCHECK(!IsCodeSpaceObject(code));
   TorqueGeneratedClass::set_code_object(code, mode);
 }
diff --git a/deps/v8/src/objects/call-site-info.cc b/deps/v8/src/objects/call-site-info.cc
index 97a6f12774c7f0..32c9042d36ac36 100644
--- a/deps/v8/src/objects/call-site-info.cc
+++ b/deps/v8/src/objects/call-site-info.cc
@@ -18,32 +18,35 @@ namespace internal {
 
 bool CallSiteInfo::IsPromiseAll() const {
   if (!IsAsync()) return false;
-  JSFunction fun = JSFunction::cast(function());
-  return fun == fun.native_context().promise_all();
+  Tagged<JSFunction> fun = JSFunction::cast(function());
+  return fun == fun->native_context()->promise_all();
 }
 
 bool CallSiteInfo::IsPromiseAllSettled() const {
   if (!IsAsync()) return false;
-  JSFunction fun = JSFunction::cast(function());
-  return fun == fun.native_context().promise_all_settled();
+  Tagged<JSFunction> fun = JSFunction::cast(function());
+  return fun == fun->native_context()->promise_all_settled();
 }
 
 bool CallSiteInfo::IsPromiseAny() const {
   if (!IsAsync()) return false;
-  JSFunction fun = JSFunction::cast(function());
-  return fun == fun.native_context().promise_any();
+  Tagged<JSFunction> fun = JSFunction::cast(function());
+  return fun == fun->native_context()->promise_any();
 }
 
 bool CallSiteInfo::IsNative() const {
+#if V8_ENABLE_WEBASSEMBLY
+  if (IsBuiltin()) return true;
+#endif
   if (auto script = GetScript()) {
-    return script->type() == Script::TYPE_NATIVE;
+    return script->type() == Script::Type::kNative;
   }
   return false;
 }
 
 bool CallSiteInfo::IsEval() const {
   if (auto script = GetScript()) {
-    return script->compilation_type() == Script::COMPILATION_TYPE_EVAL;
+    return script->compilation_type() == Script::CompilationType::kEval;
   }
   return false;
 }
@@ -51,20 +54,22 @@ bool CallSiteInfo::IsEval() const {
 bool CallSiteInfo::IsUserJavaScript() const {
 #if V8_ENABLE_WEBASSEMBLY
   if (IsWasm()) return false;
+  if (IsBuiltin()) return false;
 #endif  // V8_ENABLE_WEBASSEMBLY
-  return GetSharedFunctionInfo().IsUserJavaScript();
+  return GetSharedFunctionInfo()->IsUserJavaScript();
 }
 
 bool CallSiteInfo::IsMethodCall() const {
 #if V8_ENABLE_WEBASSEMBLY
   if (IsWasm()) return false;
+  if (IsBuiltin()) return false;
 #endif  // V8_ENABLE_WEBASSEMBLY
   return !IsToplevel() && !IsConstructor();
 }
 
 bool CallSiteInfo::IsToplevel() const {
-  return receiver_or_instance().IsJSGlobalProxy() ||
-         receiver_or_instance().IsNullOrUndefined();
+  return IsJSGlobalProxy(receiver_or_instance()) ||
+         IsNullOrUndefined(receiver_or_instance());
 }
 
 // static
@@ -98,11 +103,11 @@ int CallSiteInfo::GetColumnNumber(Handle<CallSiteInfo> info) {
 #endif  // V8_ENABLE_WEBASSEMBLY
   Handle<Script> script;
   if (GetScript(isolate, info).ToHandle(&script)) {
-    int column_number = Script::GetColumnNumber(script, position) + 1;
-    if (script->HasSourceURLComment()) {
-      if (Script::GetLineNumber(script, position) == script->line_offset()) {
-        column_number -= script->column_offset();
-      }
+    Script::PositionInfo info;
+    Script::GetPositionInfo(script, position, &info);
+    int column_number = info.column + 1;
+    if (script->HasSourceURLComment() && info.line == script->line_offset()) {
+      column_number -= script->column_offset();
     }
     return column_number;
   }
@@ -123,14 +128,14 @@ int CallSiteInfo::GetEnclosingLineNumber(Handle<CallSiteInfo> info) {
   }
 #if V8_ENABLE_WEBASSEMBLY
   if (info->IsAsmJsWasm()) {
-    auto module = info->GetWasmInstance().module();
+    auto module = info->GetWasmInstance()->module();
     auto func_index = info->GetWasmFunctionIndex();
     int position = wasm::GetSourcePosition(module, func_index, 0,
                                            info->IsAsmJsAtNumberConversion());
     return Script::GetLineNumber(script, position) + 1;
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
-  int position = info->GetSharedFunctionInfo().function_token_position();
+  int position = info->GetSharedFunctionInfo()->function_token_position();
   return Script::GetLineNumber(script, position) + 1;
 }
 
@@ -139,7 +144,7 @@ int CallSiteInfo::GetEnclosingColumnNumber(Handle<CallSiteInfo> info) {
   Isolate* isolate = info->GetIsolate();
 #if V8_ENABLE_WEBASSEMBLY
   if (info->IsWasm() && !info->IsAsmJsWasm()) {
-    auto module = info->GetWasmInstance().module();
+    auto module = info->GetWasmInstance()->module();
     auto func_index = info->GetWasmFunctionIndex();
     return GetWasmFunctionOffset(module, func_index);
   }
@@ -150,14 +155,14 @@ int CallSiteInfo::GetEnclosingColumnNumber(Handle<CallSiteInfo> info) {
   }
 #if V8_ENABLE_WEBASSEMBLY
   if (info->IsAsmJsWasm()) {
-    auto module = info->GetWasmInstance().module();
+    auto module = info->GetWasmInstance()->module();
     auto func_index = info->GetWasmFunctionIndex();
     int position = wasm::GetSourcePosition(module, func_index, 0,
                                            info->IsAsmJsAtNumberConversion());
     return Script::GetColumnNumber(script, position) + 1;
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
-  int position = info->GetSharedFunctionInfo().function_token_position();
+  int position = info->GetSharedFunctionInfo()->function_token_position();
   return Script::GetColumnNumber(script, position) + 1;
 }
 
@@ -168,21 +173,21 @@ int CallSiteInfo::GetScriptId() const {
   return Message::kNoScriptIdInfo;
 }
 
-Object CallSiteInfo::GetScriptName() const {
+Tagged<Object> CallSiteInfo::GetScriptName() const {
   if (auto script = GetScript()) {
     return script->name();
   }
   return ReadOnlyRoots(GetIsolate()).null_value();
 }
 
-Object CallSiteInfo::GetScriptNameOrSourceURL() const {
+Tagged<Object> CallSiteInfo::GetScriptNameOrSourceURL() const {
   if (auto script = GetScript()) {
     return script->GetNameOrSourceURL();
   }
   return ReadOnlyRoots(GetIsolate()).null_value();
 }
 
-Object CallSiteInfo::GetScriptSource() const {
+Tagged<Object> CallSiteInfo::GetScriptSource() const {
   if (auto script = GetScript()) {
     if (script->HasValidSource()) {
       return script->source();
@@ -191,7 +196,7 @@ Object CallSiteInfo::GetScriptSource() const {
   return ReadOnlyRoots(GetIsolate()).null_value();
 }
 
-Object CallSiteInfo::GetScriptSourceMappingURL() const {
+Tagged<Object> CallSiteInfo::GetScriptSourceMappingURL() const {
   if (auto script = GetScript()) {
     return script->source_mapping_url();
   }
@@ -215,7 +220,7 @@ namespace {
 
 MaybeHandle<String> FormatEvalOrigin(Isolate* isolate, Handle<Script> script) {
   Handle<Object> sourceURL(script->GetNameOrSourceURL(), isolate);
-  if (sourceURL->IsString()) return Handle<String>::cast(sourceURL);
+  if (IsString(*sourceURL)) return Handle<String>::cast(sourceURL);
 
   IncrementalStringBuilder builder(isolate);
   builder.AppendCStringLiteral("eval at ");
@@ -227,10 +232,10 @@ MaybeHandle<String> FormatEvalOrigin(Isolate* isolate, Handle<Script> script) {
     } else {
       builder.AppendCStringLiteral("<anonymous>");
     }
-    if (eval_shared->script().IsScript()) {
+    if (IsScript(eval_shared->script())) {
       Handle<Script> eval_script(Script::cast(eval_shared->script()), isolate);
       builder.AppendCStringLiteral(" (");
-      if (eval_script->compilation_type() == Script::COMPILATION_TYPE_EVAL) {
+      if (eval_script->compilation_type() == Script::CompilationType::kEval) {
         // Eval script originated from another eval.
         Handle<String> str;
         ASSIGN_RETURN_ON_EXCEPTION(
@@ -239,12 +244,12 @@ MaybeHandle<String> FormatEvalOrigin(Isolate* isolate, Handle<Script> script) {
       } else {
         // eval script originated from "real" source.
         Handle<Object> eval_script_name(eval_script->name(), isolate);
-        if (eval_script_name->IsString()) {
+        if (IsString(*eval_script_name)) {
           builder.AppendString(Handle<String>::cast(eval_script_name));
           Script::PositionInfo info;
           if (Script::GetPositionInfo(eval_script,
                                       Script::GetEvalPosition(isolate, script),
-                                      &info, Script::NO_OFFSET)) {
+                                      &info, Script::OffsetFlag::kNoOffset)) {
             builder.AppendCharacter(':');
             builder.AppendInt(info.line + 1);
             builder.AppendCharacter(':');
@@ -270,7 +275,7 @@ Handle<PrimitiveHeapObject> CallSiteInfo::GetEvalOrigin(
   auto isolate = info->GetIsolate();
   Handle<Script> script;
   if (!GetScript(isolate, info).ToHandle(&script) ||
-      script->compilation_type() != Script::COMPILATION_TYPE_EVAL) {
+      script->compilation_type() != Script::CompilationType::kEval) {
     return isolate->factory()->undefined_value();
   }
   return FormatEvalOrigin(isolate, script).ToHandleChecked();
@@ -283,7 +288,7 @@ Handle<PrimitiveHeapObject> CallSiteInfo::GetFunctionName(
 #if V8_ENABLE_WEBASSEMBLY
   if (info->IsWasm()) {
     Handle<WasmModuleObject> module_object(
-        info->GetWasmInstance().module_object(), isolate);
+        info->GetWasmInstance()->module_object(), isolate);
     uint32_t func_index = info->GetWasmFunctionIndex();
     Handle<String> name;
     if (WasmModuleObject::GetFunctionNameOrNull(isolate, module_object,
@@ -293,8 +298,23 @@ Handle<PrimitiveHeapObject> CallSiteInfo::GetFunctionName(
     }
     return isolate->factory()->null_value();
   }
+  if (info->IsBuiltin()) {
+    Builtin builtin = Builtins::FromInt(Smi::cast(info->function()).value());
+    return isolate->factory()->NewStringFromAsciiChecked(
+        Builtins::NameForStackTrace(builtin));
+  }
 #endif  // V8_ENABLE_WEBASSEMBLY
   Handle<JSFunction> function(JSFunction::cast(info->function()), isolate);
+  if (function->shared()->HasBuiltinId()) {
+    Builtin builtin = function->shared()->builtin_id();
+    const char* maybe_known_name = Builtins::NameForStackTrace(builtin);
+    if (maybe_known_name) {
+      // This is for cases where using the builtin's name allows us to print
+      // e.g. "String.indexOf", instead of just "indexOf" which is what we
+      // would infer below.
+      return isolate->factory()->NewStringFromAsciiChecked(maybe_known_name);
+    }
+  }
   Handle<String> name = JSFunction::GetDebugName(function);
   if (name->length() != 0) return name;
   if (info->IsEval()) return isolate->factory()->eval_string();
@@ -310,6 +330,9 @@ Handle<String> CallSiteInfo::GetFunctionDebugName(Handle<CallSiteInfo> info) {
                                     handle(info->GetWasmInstance(), isolate),
                                     info->GetWasmFunctionIndex());
   }
+  if (info->IsBuiltin()) {
+    return Handle<String>::cast(GetFunctionName(info));
+  }
 #endif  // V8_ENABLE_WEBASSEMBLY
   Handle<JSFunction> function(JSFunction::cast(info->function()), isolate);
   Handle<String> name = JSFunction::GetDebugName(function);
@@ -321,91 +344,94 @@ Handle<String> CallSiteInfo::GetFunctionDebugName(Handle<CallSiteInfo> info) {
 
 namespace {
 
-PrimitiveHeapObject InferMethodNameFromFastObject(Isolate* isolate,
-                                                  JSObject receiver,
-                                                  JSFunction fun,
-                                                  PrimitiveHeapObject name) {
+Tagged<PrimitiveHeapObject> InferMethodNameFromFastObject(
+    Isolate* isolate, Tagged<JSObject> receiver, Tagged<JSFunction> fun,
+    Tagged<PrimitiveHeapObject> name) {
   ReadOnlyRoots roots(isolate);
-  Map map = receiver.map();
-  DescriptorArray descriptors = map.instance_descriptors(isolate);
-  for (auto i : map.IterateOwnDescriptors()) {
-    PrimitiveHeapObject key = descriptors.GetKey(i);
-    if (key.IsSymbol()) continue;
-    auto details = descriptors.GetDetails(i);
+  Map map = receiver->map();
+  DescriptorArray descriptors = map->instance_descriptors(isolate);
+  for (auto i : map->IterateOwnDescriptors()) {
+    Tagged<PrimitiveHeapObject> key = descriptors->GetKey(i);
+    if (IsSymbol(key)) continue;
+    auto details = descriptors->GetDetails(i);
     if (details.IsDontEnum()) continue;
-    Object value;
+    Tagged<Object> value;
     if (details.location() == PropertyLocation::kField) {
       auto field_index = FieldIndex::ForPropertyIndex(
           map, details.field_index(), details.representation());
       if (field_index.is_double()) continue;
-      value = receiver.RawFastPropertyAt(isolate, field_index);
+      value = receiver->RawFastPropertyAt(isolate, field_index);
     } else {
-      value = descriptors.GetStrongValue(i);
+      value = descriptors->GetStrongValue(i);
     }
     if (value != fun) {
-      if (!value.IsAccessorPair()) continue;
+      if (!IsAccessorPair(value)) continue;
       auto pair = AccessorPair::cast(value);
-      if (pair.getter() != fun && pair.setter() != fun) continue;
+      if (pair->getter() != fun && pair->setter() != fun) continue;
     }
     if (name != key) {
-      name = name.IsUndefined(isolate) ? key : roots.null_value();
+      name = IsUndefined(name, isolate)
+                 ? key
+                 : Tagged<PrimitiveHeapObject>(roots.null_value());
     }
   }
   return name;
 }
 
 template <typename Dictionary>
-PrimitiveHeapObject InferMethodNameFromDictionary(Isolate* isolate,
-                                                  Dictionary dictionary,
-                                                  JSFunction fun,
-                                                  PrimitiveHeapObject name) {
+Tagged<PrimitiveHeapObject> InferMethodNameFromDictionary(
+    Isolate* isolate, Tagged<Dictionary> dictionary, Tagged<JSFunction> fun,
+    Tagged<PrimitiveHeapObject> name) {
   ReadOnlyRoots roots(isolate);
-  for (auto i : dictionary.IterateEntries()) {
-    Object key;
-    if (!dictionary.ToKey(roots, i, &key)) continue;
-    if (key.IsSymbol()) continue;
-    auto details = dictionary.DetailsAt(i);
+  for (auto i : dictionary->IterateEntries()) {
+    Tagged<Object> key;
+    if (!dictionary->ToKey(roots, i, &key)) continue;
+    if (IsSymbol(key)) continue;
+    auto details = dictionary->DetailsAt(i);
     if (details.IsDontEnum()) continue;
-    auto value = dictionary.ValueAt(i);
+    auto value = dictionary->ValueAt(i);
     if (value != fun) {
-      if (!value.IsAccessorPair()) continue;
+      if (!IsAccessorPair(value)) continue;
       auto pair = AccessorPair::cast(value);
-      if (pair.getter() != fun && pair.setter() != fun) continue;
+      if (pair->getter() != fun && pair->setter() != fun) continue;
     }
     if (name != key) {
-      name = name.IsUndefined(isolate) ? PrimitiveHeapObject::cast(key)
-                                       : roots.null_value();
+      name = IsUndefined(name, isolate)
+                 ? Tagged<PrimitiveHeapObject>::cast(key)
+                 : Tagged<PrimitiveHeapObject>(roots.null_value());
     }
   }
   return name;
 }
 
-PrimitiveHeapObject InferMethodName(Isolate* isolate, JSReceiver receiver,
-                                    JSFunction fun) {
+Tagged<PrimitiveHeapObject> InferMethodName(Isolate* isolate,
+                                            Tagged<JSReceiver> receiver,
+                                            Tagged<JSFunction> fun) {
   DisallowGarbageCollection no_gc;
   ReadOnlyRoots roots(isolate);
-  PrimitiveHeapObject name = roots.undefined_value();
+  Tagged<PrimitiveHeapObject> name = roots.undefined_value();
   for (PrototypeIterator it(isolate, receiver, kStartAtReceiver); !it.IsAtEnd();
        it.Advance()) {
     auto current = it.GetCurrent();
-    if (!current.IsJSObject()) break;
+    if (!IsJSObject(current)) break;
     auto object = JSObject::cast(current);
-    if (object.IsAccessCheckNeeded()) break;
-    if (object.HasFastProperties()) {
+    if (IsAccessCheckNeeded(object)) break;
+    if (object->HasFastProperties()) {
       name = InferMethodNameFromFastObject(isolate, object, fun, name);
-    } else if (object.IsJSGlobalObject()) {
+    } else if (IsJSGlobalObject(object)) {
       name = InferMethodNameFromDictionary(
-          isolate, JSGlobalObject::cast(object).global_dictionary(kAcquireLoad),
-          fun, name);
+          isolate,
+          JSGlobalObject::cast(object)->global_dictionary(kAcquireLoad), fun,
+          name);
     } else if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
       name = InferMethodNameFromDictionary(
-          isolate, object.property_dictionary_swiss(), fun, name);
+          isolate, object->property_dictionary_swiss(), fun, name);
     } else {
       name = InferMethodNameFromDictionary(
-          isolate, object.property_dictionary(), fun, name);
+          isolate, object->property_dictionary(), fun, name);
     }
   }
-  if (name.IsUndefined(isolate)) return roots.null_value();
+  if (IsUndefined(name, isolate)) return roots.null_value();
   return name;
 }
 
@@ -418,23 +444,22 @@ Handle<Object> CallSiteInfo::GetMethodName(Handle<CallSiteInfo> info) {
 #if V8_ENABLE_WEBASSEMBLY
   if (info->IsWasm()) return isolate->factory()->null_value();
 #endif  // V8_ENABLE_WEBASSEMBLY
-  if (receiver_or_instance->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*receiver_or_instance, isolate)) {
     return isolate->factory()->null_value();
   }
 
-  Handle<JSReceiver> receiver =
-      JSReceiver::ToObject(isolate, receiver_or_instance).ToHandleChecked();
   Handle<JSFunction> function =
       handle(JSFunction::cast(info->function()), isolate);
-  Handle<String> name(function->shared().Name(), isolate);
-  name = String::Flatten(isolate, name);
-
-  // The static initializer function is not a method, so don't add a
-  // class name, just return the function name.
-  if (name->HasOneBytePrefix(base::CStrVector("<static_fields_initializer>"))) {
-    return name;
+  // Class members initializer function is not a method.
+  if (IsClassMembersInitializerFunction(function->shared()->kind())) {
+    return isolate->factory()->null_value();
   }
 
+  Handle<JSReceiver> receiver =
+      JSReceiver::ToObject(isolate, receiver_or_instance).ToHandleChecked();
+  Handle<String> name(function->shared()->Name(), isolate);
+  name = String::Flatten(isolate, name);
+
   // ES2015 gives getters and setters name prefixes which must
   // be stripped to find the property name.
   if (name->HasOneBytePrefix(base::CStrVector("get ")) ||
@@ -445,7 +470,7 @@ Handle<Object> CallSiteInfo::GetMethodName(Handle<CallSiteInfo> info) {
     // the parser does store an inferred name "o.foo" for the common
     // case of `o.foo = function() {...}`, so see if we can derive a
     // property name to guess from that.
-    name = handle(function->shared().inferred_name(), isolate);
+    name = handle(function->shared()->inferred_name(), isolate);
     for (int index = name->length(); --index >= 0;) {
       if (name->Get(index, isolate) == '.') {
         name = isolate->factory()->NewProperSubString(name, index + 1,
@@ -465,7 +490,7 @@ Handle<Object> CallSiteInfo::GetMethodName(Handle<CallSiteInfo> info) {
       }
     } else if (it.state() == LookupIterator::ACCESSOR) {
       Handle<Object> accessors = it.GetAccessors();
-      if (accessors->IsAccessorPair()) {
+      if (IsAccessorPair(*accessors)) {
         Handle<AccessorPair> pair = Handle<AccessorPair>::cast(accessors);
         if (pair->getter() == *function || pair->setter() == *function) {
           return name;
@@ -487,7 +512,7 @@ Handle<Object> CallSiteInfo::GetTypeName(Handle<CallSiteInfo> info) {
       JSReceiver::ToObject(isolate,
                            handle(info->receiver_or_instance(), isolate))
           .ToHandleChecked();
-  if (receiver->IsJSProxy()) {
+  if (IsJSProxy(*receiver)) {
     return isolate->factory()->Proxy_string();
   }
   return JSReceiver::GetConstructorName(isolate, receiver);
@@ -499,7 +524,7 @@ uint32_t CallSiteInfo::GetWasmFunctionIndex() const {
   return Smi::ToInt(Smi::cast(function()));
 }
 
-WasmInstanceObject CallSiteInfo::GetWasmInstance() const {
+Tagged<WasmInstanceObject> CallSiteInfo::GetWasmInstance() const {
   DCHECK(IsWasm());
   return WasmInstanceObject::cast(receiver_or_instance());
 }
@@ -510,7 +535,7 @@ Handle<Object> CallSiteInfo::GetWasmModuleName(Handle<CallSiteInfo> info) {
   if (info->IsWasm()) {
     Handle<String> name;
     auto module_object =
-        handle(info->GetWasmInstance().module_object(), isolate);
+        handle(info->GetWasmInstance()->module_object(), isolate);
     if (WasmModuleObject::GetModuleNameOrNull(isolate, module_object)
             .ToHandle(&name)) {
       return name;
@@ -542,20 +567,23 @@ bool CallSiteInfo::ComputeLocation(Handle<CallSiteInfo> info,
 #if V8_ENABLE_WEBASSEMBLY
   if (info->IsWasm()) {
     int pos = GetSourcePosition(info);
-    Handle<Script> script(info->GetWasmInstance().module_object().script(),
+    Handle<Script> script(info->GetWasmInstance()->module_object()->script(),
                           isolate);
     *location = MessageLocation(script, pos, pos + 1);
     return true;
   }
+  if (info->IsBuiltin()) {
+    return false;
+  }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   Handle<SharedFunctionInfo> shared(info->GetSharedFunctionInfo(), isolate);
   if (!shared->IsSubjectToDebugging()) return false;
   Handle<Script> script(Script::cast(shared->script()), isolate);
-  if (script->source().IsUndefined()) return false;
+  if (IsUndefined(script->source())) return false;
   if (info->flags() & kIsSourcePositionComputed ||
       (shared->HasBytecodeArray() &&
-       shared->GetBytecodeArray(isolate).HasSourcePositionTable())) {
+       shared->GetBytecodeArray(isolate)->HasSourcePositionTable())) {
     int pos = GetSourcePosition(info);
     *location = MessageLocation(script, pos, pos + 1, shared);
   } else {
@@ -570,34 +598,41 @@ int CallSiteInfo::ComputeSourcePosition(Handle<CallSiteInfo> info, int offset) {
   Isolate* isolate = info->GetIsolate();
 #if V8_ENABLE_WEBASSEMBLY
   if (info->IsWasm()) {
-    auto module = info->GetWasmInstance().module();
+    auto module = info->GetWasmInstance()->module();
     uint32_t func_index = info->GetWasmFunctionIndex();
     return wasm::GetSourcePosition(module, func_index, offset,
                                    info->IsAsmJsAtNumberConversion());
   }
+  if (info->IsBuiltin()) {
+    return 0;
+  }
 #endif  // V8_ENABLE_WEBASSEMBLY
   Handle<SharedFunctionInfo> shared(info->GetSharedFunctionInfo(), isolate);
   SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, shared);
   return AbstractCode::cast(info->code_object())
-      .SourcePosition(isolate, offset);
+      ->SourcePosition(isolate, offset);
 }
 
 base::Optional<Script> CallSiteInfo::GetScript() const {
 #if V8_ENABLE_WEBASSEMBLY
   if (IsWasm()) {
-    return GetWasmInstance().module_object().script();
+    return GetWasmInstance()->module_object()->script();
+  }
+  if (IsBuiltin()) {
+    return base::nullopt;
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
-  Object script = GetSharedFunctionInfo().script();
-  if (script.IsScript()) return Script::cast(script);
+  Tagged<Object> script = GetSharedFunctionInfo()->script();
+  if (IsScript(script)) return Script::cast(script);
   return base::nullopt;
 }
 
-SharedFunctionInfo CallSiteInfo::GetSharedFunctionInfo() const {
+Tagged<SharedFunctionInfo> CallSiteInfo::GetSharedFunctionInfo() const {
 #if V8_ENABLE_WEBASSEMBLY
   DCHECK(!IsWasm());
+  DCHECK(!IsBuiltin());
 #endif  // V8_ENABLE_WEBASSEMBLY
-  return JSFunction::cast(function()).shared();
+  return JSFunction::cast(function())->shared();
 }
 
 // static
@@ -612,14 +647,14 @@ MaybeHandle<Script> CallSiteInfo::GetScript(Isolate* isolate,
 namespace {
 
 bool IsNonEmptyString(Handle<Object> object) {
-  return (object->IsString() && String::cast(*object).length() > 0);
+  return (IsString(*object) && String::cast(*object)->length() > 0);
 }
 
 void AppendFileLocation(Isolate* isolate, Handle<CallSiteInfo> frame,
                         IncrementalStringBuilder* builder) {
   Handle<Object> script_name_or_source_url(frame->GetScriptNameOrSourceURL(),
                                            isolate);
-  if (!script_name_or_source_url->IsString() && frame->IsEval()) {
+  if (!IsString(*script_name_or_source_url) && frame->IsEval()) {
     builder->AppendString(
         Handle<String>::cast(CallSiteInfo::GetEvalOrigin(frame)));
     // Expecting source position to follow.
@@ -686,7 +721,7 @@ void AppendMethodCall(Isolate* isolate, Handle<CallSiteInfo> frame,
   Handle<Object> function_name = CallSiteInfo::GetFunctionName(frame);
 
   Handle<Object> receiver(frame->receiver_or_instance(), isolate);
-  if (receiver->IsJSClassConstructor()) {
+  if (IsJSClassConstructor(*receiver)) {
     Handle<JSFunction> function = Handle<JSFunction>::cast(receiver);
     Handle<String> class_name = JSFunction::GetDebugName(function);
     if (class_name->length() != 0) {
@@ -766,13 +801,13 @@ void SerializeWasmStackFrame(Isolate* isolate, Handle<CallSiteInfo> frame,
                              IncrementalStringBuilder* builder) {
   Handle<Object> module_name = CallSiteInfo::GetWasmModuleName(frame);
   Handle<Object> function_name = CallSiteInfo::GetFunctionName(frame);
-  const bool has_name = !module_name->IsNull() || !function_name->IsNull();
+  const bool has_name = !IsNull(*module_name) || !IsNull(*function_name);
   if (has_name) {
-    if (module_name->IsNull()) {
+    if (IsNull(*module_name)) {
       builder->AppendString(Handle<String>::cast(function_name));
     } else {
       builder->AppendString(Handle<String>::cast(module_name));
-      if (!function_name->IsNull()) {
+      if (!IsNull(*function_name)) {
         builder->AppendCharacter('.');
         builder->AppendString(Handle<String>::cast(function_name));
       }
@@ -800,6 +835,13 @@ void SerializeWasmStackFrame(Isolate* isolate, Handle<CallSiteInfo> frame,
 
   if (has_name) builder->AppendCharacter(')');
 }
+
+void SerializeBuiltinStackFrame(Isolate* isolate, Handle<CallSiteInfo> frame,
+                                IncrementalStringBuilder* builder) {
+  builder->AppendString(
+      Handle<String>::cast(CallSiteInfo::GetFunctionName(frame)));
+  builder->AppendCStringLiteral(" (<anonymous>)");
+}
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 }  // namespace
@@ -811,6 +853,10 @@ void SerializeCallSiteInfo(Isolate* isolate, Handle<CallSiteInfo> frame,
     SerializeWasmStackFrame(isolate, frame, builder);
     return;
   }
+  if (frame->IsBuiltin()) {
+    SerializeBuiltinStackFrame(isolate, frame, builder);
+    return;
+  }
 #endif  // V8_ENABLE_WEBASSEMBLY
   SerializeJSStackFrame(isolate, frame, builder);
 }
diff --git a/deps/v8/src/objects/call-site-info.h b/deps/v8/src/objects/call-site-info.h
index 72ff3cb08a0ec5..cea5fc0300ef52 100644
--- a/deps/v8/src/objects/call-site-info.h
+++ b/deps/v8/src/objects/call-site-info.h
@@ -29,6 +29,7 @@ class CallSiteInfo : public TorqueGeneratedCallSiteInfo<CallSiteInfo, Struct> {
   inline bool IsWasm() const;
   inline bool IsAsmJsWasm() const;
   inline bool IsAsmJsAtNumberConversion() const;
+  inline bool IsBuiltin() const;
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   inline bool IsStrict() const;
@@ -44,7 +45,7 @@ class CallSiteInfo : public TorqueGeneratedCallSiteInfo<CallSiteInfo, Struct> {
   bool IsPromiseAny() const;
   bool IsNative() const;
 
-  DECL_ACCESSORS(code_object, HeapObject)
+  DECL_ACCESSORS(code_object, Tagged<HeapObject>)
 
   // Dispatched behavior.
   DECL_VERIFIER(CallSiteInfo)
@@ -63,10 +64,10 @@ class CallSiteInfo : public TorqueGeneratedCallSiteInfo<CallSiteInfo, Struct> {
   static MaybeHandle<Script> GetScript(Isolate* isolate,
                                        Handle<CallSiteInfo> info);
   int GetScriptId() const;
-  Object GetScriptName() const;
-  Object GetScriptNameOrSourceURL() const;
-  Object GetScriptSource() const;
-  Object GetScriptSourceMappingURL() const;
+  Tagged<Object> GetScriptName() const;
+  Tagged<Object> GetScriptNameOrSourceURL() const;
+  Tagged<Object> GetScriptSource() const;
+  Tagged<Object> GetScriptSourceMappingURL() const;
 
   static Handle<PrimitiveHeapObject> GetEvalOrigin(Handle<CallSiteInfo> info);
   V8_EXPORT_PRIVATE static Handle<PrimitiveHeapObject> GetFunctionName(
@@ -79,7 +80,7 @@ class CallSiteInfo : public TorqueGeneratedCallSiteInfo<CallSiteInfo, Struct> {
 #if V8_ENABLE_WEBASSEMBLY
   // These methods are only valid for Wasm and asm.js Wasm frames.
   uint32_t GetWasmFunctionIndex() const;
-  WasmInstanceObject GetWasmInstance() const;
+  Tagged<WasmInstanceObject> GetWasmInstance() const;
   static Handle<Object> GetWasmModuleName(Handle<CallSiteInfo> info);
 #endif  // V8_ENABLE_WEBASSEMBLY
 
@@ -100,7 +101,7 @@ class CallSiteInfo : public TorqueGeneratedCallSiteInfo<CallSiteInfo, Struct> {
   static int ComputeSourcePosition(Handle<CallSiteInfo> info, int offset);
 
   base::Optional<Script> GetScript() const;
-  SharedFunctionInfo GetSharedFunctionInfo() const;
+  Tagged<SharedFunctionInfo> GetSharedFunctionInfo() const;
 
   TQ_OBJECT_CONSTRUCTORS(CallSiteInfo)
 };
diff --git a/deps/v8/src/objects/call-site-info.tq b/deps/v8/src/objects/call-site-info.tq
index fda832618bed05..b88c53b99a8a28 100644
--- a/deps/v8/src/objects/call-site-info.tq
+++ b/deps/v8/src/objects/call-site-info.tq
@@ -9,6 +9,7 @@ bitfield struct CallSiteInfoFlags extends uint31 {
   is_constructor: bool: 1 bit;
   is_asm_js_at_number_conversion: bool: 1 bit;
   is_async: bool: 1 bit;
+  is_builtin: bool: 1 bit;
 
   // whether offset_or_source_position contains the source position.
   is_source_position_computed: bool: 1 bit;
diff --git a/deps/v8/src/objects/cell-inl.h b/deps/v8/src/objects/cell-inl.h
index d47b49504ec7a3..6333ed94506cda 100644
--- a/deps/v8/src/objects/cell-inl.h
+++ b/deps/v8/src/objects/cell-inl.h
@@ -20,7 +20,7 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(Cell)
 
-DEF_RELAXED_GETTER(Cell, value, Object) {
+DEF_RELAXED_GETTER(Cell, value, Tagged<Object>) {
   return TaggedField<Object, kValueOffset>::Relaxed_Load(cage_base, *this);
 }
 
diff --git a/deps/v8/src/objects/cell.h b/deps/v8/src/objects/cell.h
index 56c1016bd5fcb4..c67f1fac0167a3 100644
--- a/deps/v8/src/objects/cell.h
+++ b/deps/v8/src/objects/cell.h
@@ -20,7 +20,7 @@ class Cell : public TorqueGeneratedCell<Cell, HeapObject> {
   inline Address ValueAddress() { return address() + kValueOffset; }
 
   using TorqueGeneratedCell::value;
-  DECL_RELAXED_GETTER(value, Object)
+  DECL_RELAXED_GETTER(value, Tagged<Object>)
 
   using BodyDescriptor = FixedBodyDescriptor<kValueOffset, kSize, kSize>;
 
diff --git a/deps/v8/src/objects/code-inl.h b/deps/v8/src/objects/code-inl.h
index 48721e6f6eb000..b5bcab609d936f 100644
--- a/deps/v8/src/objects/code-inl.h
+++ b/deps/v8/src/objects/code-inl.h
@@ -5,23 +5,14 @@
 #ifndef V8_OBJECTS_CODE_INL_H_
 #define V8_OBJECTS_CODE_INL_H_
 
-#include "src/base/memory.h"
 #include "src/baseline/bytecode-offset-iterator.h"
 #include "src/codegen/code-desc.h"
-#include "src/common/assert-scope.h"
-#include "src/common/globals.h"
-#include "src/execution/isolate.h"
-#include "src/heap/heap-inl.h"
-#include "src/interpreter/bytecode-register.h"
+#include "src/heap/heap-write-barrier-inl.h"
 #include "src/objects/code.h"
-#include "src/objects/dictionary.h"
+#include "src/objects/deoptimization-data-inl.h"
 #include "src/objects/instance-type-inl.h"
-#include "src/objects/map-inl.h"
-#include "src/objects/maybe-object-inl.h"
-#include "src/objects/oddball.h"
-#include "src/objects/shared-function-info-inl.h"
-#include "src/objects/smi-inl.h"
-#include "src/utils/utils.h"
+#include "src/objects/instruction-stream-inl.h"
+#include "src/snapshot/embedded/embedded-data-inl.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -29,31 +20,20 @@
 namespace v8 {
 namespace internal {
 
-#include "torque-generated/src/objects/code-tq-inl.inc"
-
-OBJECT_CONSTRUCTORS_IMPL(DeoptimizationData, FixedArray)
-TQ_OBJECT_CONSTRUCTORS_IMPL(BytecodeArray)
-OBJECT_CONSTRUCTORS_IMPL(AbstractCode, HeapObject)
-OBJECT_CONSTRUCTORS_IMPL(DependentCode, WeakArrayList)
 OBJECT_CONSTRUCTORS_IMPL(Code, HeapObject)
 OBJECT_CONSTRUCTORS_IMPL(GcSafeCode, HeapObject)
 
-CAST_ACCESSOR(AbstractCode)
 CAST_ACCESSOR(GcSafeCode)
-CAST_ACCESSOR(InstructionStream)
 CAST_ACCESSOR(Code)
-CAST_ACCESSOR(DependentCode)
-CAST_ACCESSOR(DeoptimizationData)
-CAST_ACCESSOR(DeoptimizationLiteralArray)
 
-Code GcSafeCode::UnsafeCastToCode() const {
+Tagged<Code> GcSafeCode::UnsafeCastToCode() const {
   return Code::unchecked_cast(*this);
 }
 
 #define GCSAFE_CODE_FWD_ACCESSOR(ReturnType, Name) \
-  ReturnType GcSafeCode::Name() const { return UnsafeCastToCode().Name(); }
-GCSAFE_CODE_FWD_ACCESSOR(Address, InstructionStart)
-GCSAFE_CODE_FWD_ACCESSOR(Address, InstructionEnd)
+  ReturnType GcSafeCode::Name() const { return UnsafeCastToCode()->Name(); }
+GCSAFE_CODE_FWD_ACCESSOR(Address, instruction_start)
+GCSAFE_CODE_FWD_ACCESSOR(Address, instruction_end)
 GCSAFE_CODE_FWD_ACCESSOR(bool, is_builtin)
 GCSAFE_CODE_FWD_ACCESSOR(Builtin, builtin_id)
 GCSAFE_CODE_FWD_ACCESSOR(CodeKind, kind)
@@ -65,365 +45,125 @@ GCSAFE_CODE_FWD_ACCESSOR(bool, is_maglevved)
 GCSAFE_CODE_FWD_ACCESSOR(bool, is_turbofanned)
 GCSAFE_CODE_FWD_ACCESSOR(bool, has_tagged_outgoing_params)
 GCSAFE_CODE_FWD_ACCESSOR(bool, marked_for_deoptimization)
-GCSAFE_CODE_FWD_ACCESSOR(Object, raw_instruction_stream)
+GCSAFE_CODE_FWD_ACCESSOR(Tagged<Object>, raw_instruction_stream)
 GCSAFE_CODE_FWD_ACCESSOR(int, stack_slots)
 GCSAFE_CODE_FWD_ACCESSOR(Address, constant_pool)
-GCSAFE_CODE_FWD_ACCESSOR(Address, SafepointTableAddress)
+GCSAFE_CODE_FWD_ACCESSOR(Address, safepoint_table_address)
 #undef GCSAFE_CODE_FWD_ACCESSOR
 
 int GcSafeCode::GetOffsetFromInstructionStart(Isolate* isolate,
                                               Address pc) const {
-  return UnsafeCastToCode().GetOffsetFromInstructionStart(isolate, pc);
+  return UnsafeCastToCode()->GetOffsetFromInstructionStart(isolate, pc);
 }
 
 Address GcSafeCode::InstructionStart(Isolate* isolate, Address pc) const {
-  return UnsafeCastToCode().InstructionStart(isolate, pc);
+  return UnsafeCastToCode()->InstructionStart(isolate, pc);
 }
 
 Address GcSafeCode::InstructionEnd(Isolate* isolate, Address pc) const {
-  return UnsafeCastToCode().InstructionEnd(isolate, pc);
+  return UnsafeCastToCode()->InstructionEnd(isolate, pc);
+}
+
+Address GcSafeCode::constant_pool(Tagged<InstructionStream> istream) const {
+  return UnsafeCastToCode()->constant_pool(istream);
 }
 
 bool GcSafeCode::CanDeoptAt(Isolate* isolate, Address pc) const {
-  DeoptimizationData deopt_data = DeoptimizationData::unchecked_cast(
-      UnsafeCastToCode().unchecked_deoptimization_data());
-  Address code_start_address = InstructionStart();
-  for (int i = 0; i < deopt_data.DeoptCount(); i++) {
-    if (deopt_data.Pc(i).value() == -1) continue;
-    Address address = code_start_address + deopt_data.Pc(i).value();
-    if (address == pc &&
-        deopt_data.GetBytecodeOffset(i) != BytecodeOffset::None()) {
+  Tagged<DeoptimizationData> deopt_data = DeoptimizationData::unchecked_cast(
+      UnsafeCastToCode()->unchecked_deoptimization_data());
+  Address code_start_address = instruction_start();
+  for (int i = 0; i < deopt_data->DeoptCount(); i++) {
+    if (deopt_data->Pc(i).value() == -1) continue;
+    Address address = code_start_address + deopt_data->Pc(i).value();
+    if (address == pc && deopt_data->GetBytecodeOffsetOrBuiltinContinuationId(
+                             i) != BytecodeOffset::None()) {
       return true;
     }
   }
   return false;
 }
 
-Object GcSafeCode::raw_instruction_stream(
+Tagged<Object> GcSafeCode::raw_instruction_stream(
     PtrComprCageBase code_cage_base) const {
-  return UnsafeCastToCode().raw_instruction_stream(code_cage_base);
-}
-
-int AbstractCode::InstructionSize(PtrComprCageBase cage_base) {
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().InstructionSize();
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    return GetBytecodeArray().length();
-  }
-}
-
-ByteArray AbstractCode::SourcePositionTableInternal(
-    PtrComprCageBase cage_base) {
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    Code code = GetCode();
-    if (!code.has_instruction_stream()) {
-      return GetReadOnlyRoots().empty_byte_array();
-    }
-    return code.source_position_table(cage_base);
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    return GetBytecodeArray().SourcePositionTable(cage_base);
-  }
-}
-
-ByteArray AbstractCode::SourcePositionTable(Isolate* isolate,
-                                            SharedFunctionInfo sfi) {
-  Map map_object = map(isolate);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().SourcePositionTable(isolate, sfi);
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    return GetBytecodeArray().SourcePositionTable(isolate);
-  }
-}
-
-int AbstractCode::SizeIncludingMetadata(PtrComprCageBase cage_base) {
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().SizeIncludingMetadata();
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    return GetBytecodeArray().SizeIncludingMetadata();
-  }
-}
-
-Address AbstractCode::InstructionStart(PtrComprCageBase cage_base) {
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().InstructionStart();
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    return GetBytecodeArray().GetFirstBytecodeAddress();
-  }
-}
-
-Address AbstractCode::InstructionEnd(PtrComprCageBase cage_base) {
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().InstructionEnd();
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    BytecodeArray bytecode_array = GetBytecodeArray();
-    return bytecode_array.GetFirstBytecodeAddress() + bytecode_array.length();
-  }
-}
-
-bool AbstractCode::contains(Isolate* isolate, Address inner_pointer) {
-  PtrComprCageBase cage_base(isolate);
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().contains(isolate, inner_pointer);
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    return (address() <= inner_pointer) &&
-           (inner_pointer <= address() + Size(cage_base));
-  }
-}
-
-CodeKind AbstractCode::kind(PtrComprCageBase cage_base) {
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().kind();
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    return CodeKind::INTERPRETED_FUNCTION;
-  }
-}
-
-Builtin AbstractCode::builtin_id(PtrComprCageBase cage_base) {
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().builtin_id();
-  } else {
-    DCHECK(InstanceTypeChecker::IsBytecodeArray(map_object));
-    return Builtin::kNoBuiltinId;
-  }
-}
-
-bool AbstractCode::has_instruction_stream(PtrComprCageBase cage_base) {
-  DCHECK(InstanceTypeChecker::IsCode(map(cage_base)));
-  return GetCode().has_instruction_stream();
-}
-
-HandlerTable::CatchPrediction AbstractCode::GetBuiltinCatchPrediction(
-    PtrComprCageBase cage_base) {
-  Map map_object = map(cage_base);
-  if (InstanceTypeChecker::IsCode(map_object)) {
-    return GetCode().GetBuiltinCatchPrediction();
-  } else {
-    UNREACHABLE();
-  }
-}
-
-bool AbstractCode::IsCode(PtrComprCageBase cage_base) const {
-  return HeapObject::IsCode(cage_base);
-}
-
-bool AbstractCode::IsBytecodeArray(PtrComprCageBase cage_base) const {
-  return HeapObject::IsBytecodeArray(cage_base);
+  return UnsafeCastToCode()->raw_instruction_stream(code_cage_base);
 }
 
-Code AbstractCode::GetCode() { return Code::cast(*this); }
-
-BytecodeArray AbstractCode::GetBytecodeArray() {
-  return BytecodeArray::cast(*this);
-}
-
-OBJECT_CONSTRUCTORS_IMPL(InstructionStream, HeapObject)
-NEVER_READ_ONLY_SPACE_IMPL(InstructionStream)
-
 INT_ACCESSORS(Code, instruction_size, kInstructionSizeOffset)
 INT_ACCESSORS(Code, metadata_size, kMetadataSizeOffset)
 INT_ACCESSORS(Code, handler_table_offset, kHandlerTableOffsetOffset)
 INT_ACCESSORS(Code, code_comments_offset, kCodeCommentsOffsetOffset)
 INT32_ACCESSORS(Code, unwinding_info_offset, kUnwindingInfoOffsetOffset)
-ACCESSORS(Code, relocation_info, ByteArray, kRelocationInfoOffset)
-ACCESSORS_CHECKED2(Code, deoptimization_data, FixedArray,
+ACCESSORS_CHECKED2(Code, deoptimization_data, Tagged<FixedArray>,
                    kDeoptimizationDataOrInterpreterDataOffset,
                    kind() != CodeKind::BASELINE,
                    kind() != CodeKind::BASELINE &&
                        !ObjectInYoungGeneration(value))
-ACCESSORS_CHECKED2(Code, bytecode_or_interpreter_data, HeapObject,
+ACCESSORS_CHECKED2(Code, bytecode_or_interpreter_data, Tagged<HeapObject>,
                    kDeoptimizationDataOrInterpreterDataOffset,
                    kind() == CodeKind::BASELINE,
                    kind() == CodeKind::BASELINE &&
                        !ObjectInYoungGeneration(value))
-ACCESSORS_CHECKED2(Code, source_position_table, ByteArray, kPositionTableOffset,
-                   kind() != CodeKind::BASELINE,
+ACCESSORS_CHECKED2(Code, source_position_table, Tagged<ByteArray>,
+                   kPositionTableOffset, kind() != CodeKind::BASELINE,
                    kind() != CodeKind::BASELINE &&
                        !ObjectInYoungGeneration(value))
-ACCESSORS_CHECKED2(Code, bytecode_offset_table, ByteArray, kPositionTableOffset,
-                   kind() == CodeKind::BASELINE,
+ACCESSORS_CHECKED2(Code, bytecode_offset_table, Tagged<ByteArray>,
+                   kPositionTableOffset, kind() == CodeKind::BASELINE,
                    kind() == CodeKind::BASELINE &&
                        !ObjectInYoungGeneration(value))
 
-// Same as RELEASE_ACQUIRE_ACCESSORS_CHECKED2 macro but with InstructionStream
-// as a host and using main_cage_base(kRelaxedLoad) for computing the base.
-#define RELEASE_ACQUIRE_INSTRUCTION_STREAM_ACCESSORS_CHECKED2(              \
-    name, type, offset, get_condition, set_condition)                       \
-  type InstructionStream::name(AcquireLoadTag tag) const {                  \
-    PtrComprCageBase cage_base = main_cage_base(kRelaxedLoad);              \
-    return InstructionStream::name(cage_base, tag);                         \
-  }                                                                         \
-  type InstructionStream::name(PtrComprCageBase cage_base, AcquireLoadTag)  \
-      const {                                                               \
-    type value = TaggedField<type, offset>::Acquire_Load(cage_base, *this); \
-    DCHECK(get_condition);                                                  \
-    return value;                                                           \
-  }                                                                         \
-  void InstructionStream::set_##name(type value, ReleaseStoreTag,           \
-                                     WriteBarrierMode mode) {               \
-    DCHECK(set_condition);                                                  \
-    TaggedField<type, offset>::Release_Store(*this, value);                 \
-    CONDITIONAL_WRITE_BARRIER(*this, offset, value, mode);                  \
-  }
-
-#define RELEASE_ACQUIRE_INSTRUCTION_STREAM_ACCESSORS(name, type, offset) \
-  RELEASE_ACQUIRE_INSTRUCTION_STREAM_ACCESSORS_CHECKED2(                 \
-      name, type, offset, !ObjectInYoungGeneration(value),               \
-      !ObjectInYoungGeneration(value))
-
-// Concurrent marker needs to access kind specific flags in code.
-RELEASE_ACQUIRE_INSTRUCTION_STREAM_ACCESSORS(code, Code, kCodeOffset)
-RELEASE_ACQUIRE_INSTRUCTION_STREAM_ACCESSORS(raw_code, HeapObject, kCodeOffset)
-#undef RELEASE_ACQUIRE_INSTRUCTION_STREAM_ACCESSORS
-#undef RELEASE_ACQUIRE_INSTRUCTION_STREAM_ACCESSORS_CHECKED2
-
-PtrComprCageBase InstructionStream::main_cage_base() const {
-#ifdef V8_EXTERNAL_CODE_SPACE
-  Address cage_base_hi = ReadField<Tagged_t>(kMainCageBaseUpper32BitsOffset);
-  return PtrComprCageBase(cage_base_hi << 32);
-#else
-  return GetPtrComprCageBase(*this);
-#endif
-}
-
-PtrComprCageBase InstructionStream::main_cage_base(RelaxedLoadTag) const {
-#ifdef V8_EXTERNAL_CODE_SPACE
-  Address cage_base_hi =
-      Relaxed_ReadField<Tagged_t>(kMainCageBaseUpper32BitsOffset);
-  return PtrComprCageBase(cage_base_hi << 32);
-#else
-  return GetPtrComprCageBase(*this);
-#endif
-}
-
-void InstructionStream::set_main_cage_base(Address cage_base, RelaxedStoreTag) {
-#ifdef V8_EXTERNAL_CODE_SPACE
-  Tagged_t cage_base_hi = static_cast<Tagged_t>(cage_base >> 32);
-  Relaxed_WriteField<Tagged_t>(kMainCageBaseUpper32BitsOffset, cage_base_hi);
-#else
-  UNREACHABLE();
-#endif
-}
-
-Code InstructionStream::GCSafeCode(AcquireLoadTag) const {
-  PtrComprCageBase cage_base = main_cage_base(kRelaxedLoad);
-  HeapObject object =
-      TaggedField<HeapObject, kCodeOffset>::Acquire_Load(cage_base, *this);
-  DCHECK(!ObjectInYoungGeneration(object));
-  Code code = ForwardingAddress(Code::unchecked_cast(object));
-  return code;
-}
-
-// Helper functions for converting InstructionStream objects to
-// Code and back.
-inline Code ToCode(InstructionStream code) { return code.code(kAcquireLoad); }
-
-inline InstructionStream FromCode(Code code) {
-  DCHECK(code.has_instruction_stream());
-  // Compute the InstructionStream object pointer from the code entry point.
-  Address ptr =
-      code.code_entry_point() - InstructionStream::kHeaderSize + kHeapObjectTag;
-  return InstructionStream::cast(Object(ptr));
-}
-
-inline InstructionStream FromCode(Code code, PtrComprCageBase code_cage_base,
-                                  RelaxedLoadTag tag) {
-  DCHECK(code.has_instruction_stream());
-  // Since the code entry point field is not aligned we can't load it atomically
-  // and use for InstructionStream object pointer calculation. So, we load and
-  // decompress the code field.
-  return code.instruction_stream(code_cage_base, tag);
-}
-
-inline InstructionStream FromCode(Code code, Isolate* isolate,
-                                  RelaxedLoadTag tag) {
-#ifdef V8_EXTERNAL_CODE_SPACE
-  return FromCode(code, PtrComprCageBase{isolate->code_cage_base()}, tag);
-#else
-  return FromCode(code, GetPtrComprCageBase(code), tag);
-#endif  // V8_EXTERNAL_CODE_SPACE
-}
-
-// TODO(jgruber): Remove this method once main_cage_base is gone.
-void InstructionStream::WipeOutHeader() {
-  WRITE_FIELD(*this, kCodeOffset, Smi::FromInt(0));
-  if (V8_EXTERNAL_CODE_SPACE_BOOL) {
-    set_main_cage_base(kNullAddress, kRelaxedStore);
-  }
-}
-
-void Code::ClearInstructionStreamPadding() {
-  // Clear the padding after `body_end`.
-  size_t trailing_padding_size =
-      CodeSize() - InstructionStream::kHeaderSize - body_size();
-  memset(reinterpret_cast<void*>(body_end()), 0, trailing_padding_size);
-}
-
-ByteArray Code::SourcePositionTable(Isolate* isolate,
-                                    SharedFunctionInfo sfi) const {
+Tagged<ByteArray> Code::SourcePositionTable(
+    Isolate* isolate, Tagged<SharedFunctionInfo> sfi) const {
   if (!has_instruction_stream()) {
     return GetReadOnlyRoots().empty_byte_array();
   }
 
   DisallowGarbageCollection no_gc;
   if (kind() == CodeKind::BASELINE) {
-    return sfi.GetBytecodeArray(isolate).SourcePositionTable(isolate);
+    return sfi->GetBytecodeArray(isolate)->SourcePositionTable(isolate);
   }
   return source_position_table(isolate);
 }
 
-Address Code::body_start() const { return InstructionStart(); }
+Address Code::body_start() const { return instruction_start(); }
 
 Address Code::body_end() const { return body_start() + body_size(); }
 
 int Code::body_size() const { return instruction_size() + metadata_size(); }
 
-// TODO(jgruber): Remove instruction_size.
-int Code::InstructionSize() const { return instruction_size(); }
-
-Address InstructionStream::instruction_start() const {
-  return field_address(kHeaderSize);
-}
-
-Address Code::InstructionEnd() const {
-  return InstructionStart() + instruction_size();
+Address Code::instruction_end() const {
+  return instruction_start() + instruction_size();
 }
 
 Address Code::metadata_start() const {
-  return InstructionStart() + instruction_size();
+  if (has_instruction_stream()) {
+    static_assert(InstructionStream::kOnHeapBodyIsContiguous);
+    return instruction_start() + instruction_size();
+  }
+  // An embedded builtin. Remapping is irrelevant wrt the metadata section so
+  // we can simply use the global blob.
+  // TODO(jgruber): Consider adding this as a physical Code field to avoid the
+  // lookup. Alternatively, rename this (and callers) to camel-case to clarify
+  // it's more than a simple accessor.
+  static_assert(!InstructionStream::kOffHeapBodyIsContiguous);
+  return EmbeddedData::FromBlob().MetadataStartOf(builtin_id());
 }
 
 Address Code::InstructionStart(Isolate* isolate, Address pc) const {
-  return V8_LIKELY(has_instruction_stream())
-             ? code_entry_point()
-             : OffHeapInstructionStart(isolate, pc);
+  if (V8_LIKELY(has_instruction_stream())) return instruction_start();
+  // Note we intentionally don't bounds-check that `pc` is within the returned
+  // instruction area.
+  return EmbeddedData::FromBlobForPc(isolate, pc)
+      .InstructionStartOf(builtin_id());
 }
 
 Address Code::InstructionEnd(Isolate* isolate, Address pc) const {
-  return V8_LIKELY(has_instruction_stream())
-             ? InstructionEnd()
-             : OffHeapInstructionEnd(isolate, pc);
+  return InstructionStart(isolate, pc) + instruction_size();
 }
 
 int Code::GetOffsetFromInstructionStart(Isolate* isolate, Address pc) const {
-  Address instruction_start = InstructionStart(isolate, pc);
-  Address offset = pc - instruction_start;
-  DCHECK_LE(offset, InstructionSize());
+  const Address offset = pc - InstructionStart(isolate, pc);
+  DCHECK_LE(offset, instruction_size());
   return static_cast<int>(offset);
 }
 
@@ -431,24 +171,10 @@ Address Code::metadata_end() const {
   return metadata_start() + metadata_size();
 }
 
-int Code::SizeIncludingMetadata() const {
-  int size = CodeSize();
-  size += relocation_info().Size();
-  if (kind() != CodeKind::BASELINE) {
-    size += deoptimization_data().Size();
-  }
-  return size;
-}
-
 Address Code::safepoint_table_address() const {
   return metadata_start() + safepoint_table_offset();
 }
 
-Address Code::SafepointTableAddress() const {
-  return V8_LIKELY(has_instruction_stream()) ? safepoint_table_address()
-                                             : OffHeapSafepointTableAddress();
-}
-
 int Code::safepoint_table_size() const {
   return handler_table_offset() - safepoint_table_offset();
 }
@@ -459,11 +185,6 @@ Address Code::handler_table_address() const {
   return metadata_start() + handler_table_offset();
 }
 
-Address Code::HandlerTableAddress() const {
-  return V8_LIKELY(has_instruction_stream()) ? handler_table_address()
-                                             : OffHeapHandlerTableAddress();
-}
-
 int Code::handler_table_size() const {
   return constant_pool_offset() - handler_table_offset();
 }
@@ -471,8 +192,6 @@ int Code::handler_table_size() const {
 bool Code::has_handler_table() const { return handler_table_size() > 0; }
 
 int Code::constant_pool_size() const {
-  if V8_UNLIKELY (!has_instruction_stream()) return OffHeapConstantPoolSize();
-
   const int size = code_comments_offset() - constant_pool_offset();
   if (!V8_EMBEDDED_CONSTANT_POOL_BOOL) {
     DCHECK_EQ(size, 0);
@@ -484,89 +203,67 @@ int Code::constant_pool_size() const {
 
 bool Code::has_constant_pool() const { return constant_pool_size() > 0; }
 
-ByteArray Code::unchecked_relocation_info() const {
-  return ByteArray::unchecked_cast(
-      TaggedField<HeapObject, kRelocationInfoOffset>::load(*this));
-}
-
-FixedArray Code::unchecked_deoptimization_data() const {
+Tagged<FixedArray> Code::unchecked_deoptimization_data() const {
   return FixedArray::unchecked_cast(
       TaggedField<HeapObject, kDeoptimizationDataOrInterpreterDataOffset>::load(
           *this));
 }
 
-Code InstructionStream::unchecked_code() const {
-  PtrComprCageBase cage_base = main_cage_base(kRelaxedLoad);
-  return Code::unchecked_cast(
-      TaggedField<HeapObject, kCodeOffset>::Acquire_Load(cage_base, *this));
-}
-
-byte* Code::relocation_start() const {
+uint8_t* Code::relocation_start() const {
   return V8_LIKELY(has_instruction_stream())
-             ? relocation_info().GetDataStartAddress()
+             ? instruction_stream()->relocation_start()
              : nullptr;
 }
 
-byte* Code::relocation_end() const {
+uint8_t* Code::relocation_end() const {
   return V8_LIKELY(has_instruction_stream())
-             ? relocation_info().GetDataEndAddress()
+             ? instruction_stream()->relocation_end()
              : nullptr;
 }
 
 int Code::relocation_size() const {
-  return V8_LIKELY(has_instruction_stream()) ? relocation_info().length() : 0;
-}
-
-Address InstructionStream::entry() const { return instruction_start(); }
-
-bool InstructionStream::contains(Isolate* isolate, Address inner_pointer) {
-  return (address() <= inner_pointer) &&
-         (inner_pointer < address() + CodeSize());
+  return V8_LIKELY(has_instruction_stream())
+             ? instruction_stream()->relocation_size()
+             : 0;
 }
 
-bool Code::contains(Isolate* isolate, Address inner_pointer) {
-  return has_instruction_stream()
-             ? instruction_stream().contains(isolate, inner_pointer)
-             : OffHeapBuiltinContains(isolate, inner_pointer);
+bool Code::contains(Isolate* isolate, Address inner_pointer) const {
+  const Address start = InstructionStart(isolate, inner_pointer);
+  if (inner_pointer < start) return false;
+  return inner_pointer < start + instruction_size();
 }
 
-// static
-void Code::CopyRelocInfoToByteArray(ByteArray dest, const CodeDesc& desc) {
-  DCHECK_EQ(dest.length(), desc.reloc_size);
-  CopyBytes(dest.GetDataStartAddress(),
-            desc.buffer + desc.buffer_size - desc.reloc_size,
-            static_cast<size_t>(desc.reloc_size));
+int Code::InstructionStreamObjectSize() const {
+  return InstructionStream::SizeFor(body_size());
 }
 
-int InstructionStream::CodeSize() const {
-  return SizeFor(Code::unchecked_cast(raw_code(kAcquireLoad)).body_size());
+int Code::SizeIncludingMetadata() const {
+  int size = InstructionStreamObjectSize();
+  size += relocation_size();
+  if (kind() != CodeKind::BASELINE) {
+    size += deoptimization_data()->Size();
+  }
+  return size;
 }
-int Code::CodeSize() const { return InstructionStream::SizeFor(body_size()); }
 
-DEF_GETTER(InstructionStream, Size, int) { return CodeSize(); }
-
-CodeKind Code::kind() const {
-  static_assert(FIELD_SIZE(kFlagsOffset) == kInt32Size);
-  const uint32_t flags = RELAXED_READ_UINT32_FIELD(*this, kFlagsOffset);
-  return KindField::decode(flags);
-}
+CodeKind Code::kind() const { return KindField::decode(flags(kRelaxedLoad)); }
 
 int Code::GetBytecodeOffsetForBaselinePC(Address baseline_pc,
-                                         BytecodeArray bytecodes) {
+                                         Tagged<BytecodeArray> bytecodes) {
   DisallowGarbageCollection no_gc;
   CHECK(!is_baseline_trampoline_builtin());
   if (is_baseline_leave_frame_builtin()) return kFunctionExitBytecodeOffset;
   CHECK_EQ(kind(), CodeKind::BASELINE);
   baseline::BytecodeOffsetIterator offset_iterator(
       ByteArray::cast(bytecode_offset_table()), bytecodes);
-  Address pc = baseline_pc - InstructionStart();
+  Address pc = baseline_pc - instruction_start();
   offset_iterator.AdvanceToPCOffset(pc);
   return offset_iterator.current_bytecode_offset();
 }
 
-uintptr_t Code::GetBaselinePCForBytecodeOffset(int bytecode_offset,
-                                               BytecodeToPCPosition position,
-                                               BytecodeArray bytecodes) {
+uintptr_t Code::GetBaselinePCForBytecodeOffset(
+    int bytecode_offset, BytecodeToPCPosition position,
+    Tagged<BytecodeArray> bytecodes) {
   DisallowGarbageCollection no_gc;
   CHECK_EQ(kind(), CodeKind::BASELINE);
   baseline::BytecodeOffsetIterator offset_iterator(
@@ -582,20 +279,20 @@ uintptr_t Code::GetBaselinePCForBytecodeOffset(int bytecode_offset,
   return pc;
 }
 
-uintptr_t Code::GetBaselineStartPCForBytecodeOffset(int bytecode_offset,
-                                                    BytecodeArray bytecodes) {
+uintptr_t Code::GetBaselineStartPCForBytecodeOffset(
+    int bytecode_offset, Tagged<BytecodeArray> bytecodes) {
   return GetBaselinePCForBytecodeOffset(bytecode_offset, kPcAtStartOfBytecode,
                                         bytecodes);
 }
 
-uintptr_t Code::GetBaselineEndPCForBytecodeOffset(int bytecode_offset,
-                                                  BytecodeArray bytecodes) {
+uintptr_t Code::GetBaselineEndPCForBytecodeOffset(
+    int bytecode_offset, Tagged<BytecodeArray> bytecodes) {
   return GetBaselinePCForBytecodeOffset(bytecode_offset, kPcAtEndOfBytecode,
                                         bytecodes);
 }
 
-uintptr_t Code::GetBaselinePCForNextExecutedBytecode(int bytecode_offset,
-                                                     BytecodeArray bytecodes) {
+uintptr_t Code::GetBaselinePCForNextExecutedBytecode(
+    int bytecode_offset, Tagged<BytecodeArray> bytecodes) {
   DisallowGarbageCollection no_gc;
   CHECK_EQ(kind(), CodeKind::BASELINE);
   baseline::BytecodeOffsetIterator offset_iterator(
@@ -639,49 +336,11 @@ inline bool Code::has_tagged_outgoing_params() const {
 }
 
 inline bool Code::is_turbofanned() const {
-  const uint32_t flags = RELAXED_READ_UINT32_FIELD(*this, kFlagsOffset);
-  return IsTurbofannedField::decode(flags);
+  return IsTurbofannedField::decode(flags(kRelaxedLoad));
 }
 
 inline bool Code::is_maglevved() const { return kind() == CodeKind::MAGLEV; }
 
-inline bool Code::can_have_weak_objects() const {
-  DCHECK(CodeKindIsOptimizedJSFunction(kind()));
-  int16_t flags = kind_specific_flags(kRelaxedLoad);
-  return CanHaveWeakObjectsField::decode(flags);
-}
-
-inline void Code::set_can_have_weak_objects(bool value) {
-  DCHECK(CodeKindIsOptimizedJSFunction(kind()));
-  int16_t previous = kind_specific_flags(kRelaxedLoad);
-  int16_t updated = CanHaveWeakObjectsField::update(previous, value);
-  set_kind_specific_flags(updated, kRelaxedStore);
-}
-
-inline bool Code::is_promise_rejection() const {
-  DCHECK_EQ(kind(), CodeKind::BUILTIN);
-  int16_t flags = kind_specific_flags(kRelaxedLoad);
-  return IsPromiseRejectionField::decode(flags);
-}
-
-inline void Code::set_is_promise_rejection(bool value) {
-  DCHECK_EQ(kind(), CodeKind::BUILTIN);
-  int16_t previous = kind_specific_flags(kRelaxedLoad);
-  int16_t updated = IsPromiseRejectionField::update(previous, value);
-  set_kind_specific_flags(updated, kRelaxedStore);
-}
-
-inline HandlerTable::CatchPrediction
-InstructionStream::GetBuiltinCatchPrediction() const {
-  if (is_promise_rejection()) return HandlerTable::PROMISE;
-  return HandlerTable::UNCAUGHT;
-}
-
-inline HandlerTable::CatchPrediction Code::GetBuiltinCatchPrediction() const {
-  if (is_promise_rejection()) return HandlerTable::PROMISE;
-  return HandlerTable::UNCAUGHT;
-}
-
 unsigned Code::inlined_bytecode_size() const {
   unsigned size = RELAXED_READ_UINT_FIELD(*this, kInlinedBytecodeSizeOffset);
   DCHECK(CodeKindIsOptimizedJSFunction(kind()) || size == 0);
@@ -706,39 +365,42 @@ bool Code::uses_safepoint_table() const {
 }
 
 int Code::stack_slots() const {
-  const uint32_t flags = RELAXED_READ_UINT32_FIELD(*this, kFlagsOffset);
-  const int slots = StackSlotsField::decode(flags);
+  const int slots = StackSlotsField::decode(flags(kRelaxedLoad));
   DCHECK_IMPLIES(!uses_safepoint_table(), slots == 0);
   return slots;
 }
 
 bool Code::marked_for_deoptimization() const {
-  DCHECK(CodeKindCanDeoptimize(kind()));
-  int16_t flags = kind_specific_flags(kRelaxedLoad);
-  return MarkedForDeoptimizationField::decode(flags);
+  return MarkedForDeoptimizationField::decode(flags(kRelaxedLoad));
 }
 
 void Code::set_marked_for_deoptimization(bool flag) {
-  DCHECK(CodeKindCanDeoptimize(kind()));
   DCHECK_IMPLIES(flag, AllowDeoptimization::IsAllowed(
                            GetIsolateFromWritableObject(*this)));
-  int16_t previous = kind_specific_flags(kRelaxedLoad);
-  int16_t updated = MarkedForDeoptimizationField::update(previous, flag);
-  set_kind_specific_flags(updated, kRelaxedStore);
+  int32_t previous = flags(kRelaxedLoad);
+  int32_t updated = MarkedForDeoptimizationField::update(previous, flag);
+  set_flags(updated, kRelaxedStore);
 }
 
 bool Code::embedded_objects_cleared() const {
-  DCHECK(CodeKindIsOptimizedJSFunction(kind()));
-  int16_t flags = kind_specific_flags(kRelaxedLoad);
-  return Code::EmbeddedObjectsClearedField::decode(flags);
+  return Code::EmbeddedObjectsClearedField::decode(flags(kRelaxedLoad));
 }
 
 void Code::set_embedded_objects_cleared(bool flag) {
-  DCHECK(CodeKindIsOptimizedJSFunction(kind()));
   DCHECK_IMPLIES(flag, marked_for_deoptimization());
-  int16_t previous = kind_specific_flags(kRelaxedLoad);
-  int16_t updated = Code::EmbeddedObjectsClearedField::update(previous, flag);
-  set_kind_specific_flags(updated, kRelaxedStore);
+  int32_t previous = flags(kRelaxedLoad);
+  int32_t updated = Code::EmbeddedObjectsClearedField::update(previous, flag);
+  set_flags(updated, kRelaxedStore);
+}
+
+inline bool Code::can_have_weak_objects() const {
+  return CanHaveWeakObjectsField::decode(flags(kRelaxedLoad));
+}
+
+inline void Code::set_can_have_weak_objects(bool value) {
+  int32_t previous = flags(kRelaxedLoad);
+  int32_t updated = CanHaveWeakObjectsField::update(previous, value);
+  set_flags(updated, kRelaxedStore);
 }
 
 bool Code::is_wasm_code() const { return kind() == CodeKind::WASM_FUNCTION; }
@@ -762,15 +424,19 @@ void Code::set_constant_pool_offset(int value) {
 
 Address Code::constant_pool() const {
   if (!has_constant_pool()) return kNullAddress;
-  return V8_LIKELY(has_instruction_stream())
-             ? metadata_start() + constant_pool_offset()
-             : OffHeapConstantPoolAddress();
+  return metadata_start() + constant_pool_offset();
+}
+
+Address Code::constant_pool(
+    Tagged<InstructionStream> instruction_stream) const {
+  if (!has_constant_pool()) return kNullAddress;
+  static_assert(InstructionStream::kOnHeapBodyIsContiguous);
+  return instruction_stream->instruction_start() + instruction_size() +
+         constant_pool_offset();
 }
 
 Address Code::code_comments() const {
-  return V8_LIKELY(has_instruction_stream())
-             ? metadata_start() + code_comments_offset()
-             : OffHeapCodeCommentsAddress();
+  return metadata_start() + code_comments_offset();
 }
 
 int Code::code_comments_size() const {
@@ -792,63 +458,34 @@ int Code::unwinding_info_size() const {
 bool Code::has_unwinding_info() const { return unwinding_info_size() > 0; }
 
 // static
-InstructionStream InstructionStream::FromTargetAddress(Address address) {
-  {
-    // TODO(jgruber,v8:6666): Support embedded builtins here. We'd need to pass
-    // in the current isolate.
-    Address start =
-        reinterpret_cast<Address>(Isolate::CurrentEmbeddedBlobCode());
-    Address end = start + Isolate::CurrentEmbeddedBlobCodeSize();
-    CHECK(address < start || address >= end);
-  }
-
-  HeapObject code =
-      HeapObject::FromAddress(address - InstructionStream::kHeaderSize);
-  // Unchecked cast because we can't rely on the map currently not being a
-  // forwarding pointer.
-  return InstructionStream::unchecked_cast(code);
-}
-
-// static
-Code Code::FromTargetAddress(Address address) {
-  return InstructionStream::FromTargetAddress(address).code(kAcquireLoad);
-}
-
-// static
-InstructionStream InstructionStream::FromEntryAddress(
-    Address location_of_address) {
-  Address code_entry = base::Memory<Address>(location_of_address);
-  HeapObject code =
-      HeapObject::FromAddress(code_entry - InstructionStream::kHeaderSize);
-  // Unchecked cast because we can't rely on the map currently not being a
-  // forwarding pointer.
-  return InstructionStream::unchecked_cast(code);
+Tagged<Code> Code::FromTargetAddress(Address address) {
+  return InstructionStream::FromTargetAddress(address)->code(kAcquireLoad);
 }
 
 bool Code::CanContainWeakObjects() {
   return is_optimized_code() && can_have_weak_objects();
 }
 
-bool Code::IsWeakObject(HeapObject object) {
+bool Code::IsWeakObject(Tagged<HeapObject> object) {
   return (CanContainWeakObjects() && IsWeakObjectInOptimizedCode(object));
 }
 
-bool Code::IsWeakObjectInOptimizedCode(HeapObject object) {
-  Map map_object = object.map(kAcquireLoad);
+bool Code::IsWeakObjectInOptimizedCode(Tagged<HeapObject> object) {
+  Tagged<Map> map_object = object->map(kAcquireLoad);
   if (InstanceTypeChecker::IsMap(map_object)) {
-    return Map::cast(object).CanTransition();
+    return Map::cast(object)->CanTransition();
   }
   return InstanceTypeChecker::IsPropertyCell(map_object) ||
          InstanceTypeChecker::IsJSReceiver(map_object) ||
          InstanceTypeChecker::IsContext(map_object);
 }
 
-bool Code::IsWeakObjectInDeoptimizationLiteralArray(Object object) {
+bool Code::IsWeakObjectInDeoptimizationLiteralArray(Tagged<Object> object) {
   // Maps must be strong because they can be used as part of the description for
   // how to materialize an object upon deoptimization, in which case it is
   // possible to reach the code that requires the Map without anything else
   // holding a strong pointer to that Map.
-  return object.IsHeapObject() && !object.IsMap() &&
+  return IsHeapObject(object) && !IsMap(object) &&
          Code::IsWeakObjectInOptimizedCode(HeapObject::cast(object));
 }
 
@@ -856,13 +493,13 @@ void Code::IterateDeoptimizationLiterals(RootVisitor* v) {
   if (kind() == CodeKind::BASELINE) return;
 
   auto deopt_data = DeoptimizationData::cast(deoptimization_data());
-  if (deopt_data.length() == 0) return;
+  if (deopt_data->length() == 0) return;
 
-  DeoptimizationLiteralArray literals = deopt_data.LiteralArray();
-  const int literals_length = literals.length();
+  Tagged<DeoptimizationLiteralArray> literals = deopt_data->LiteralArray();
+  const int literals_length = literals->length();
   for (int i = 0; i < literals_length; ++i) {
-    MaybeObject maybe_literal = literals.Get(i);
-    HeapObject heap_literal;
+    MaybeObject maybe_literal = literals->Get(i);
+    Tagged<HeapObject> heap_literal;
     if (maybe_literal.GetHeapObject(&heap_literal)) {
       v->VisitRootPointer(Root::kStackRoots, "deoptimization literal",
                           FullObjectSlot(&heap_literal));
@@ -870,45 +507,46 @@ void Code::IterateDeoptimizationLiterals(RootVisitor* v) {
   }
 }
 
-// This field has to have relaxed atomic accessors because it is accessed in the
-// concurrent marker.
-static_assert(FIELD_SIZE(Code::kKindSpecificFlagsOffset) == kInt16Size);
-RELAXED_UINT16_ACCESSORS(Code, kind_specific_flags, kKindSpecificFlagsOffset)
-
-Object Code::raw_instruction_stream() const {
+Tagged<Object> Code::raw_instruction_stream() const {
   PtrComprCageBase cage_base = code_cage_base();
   return Code::raw_instruction_stream(cage_base);
 }
 
-Object Code::raw_instruction_stream(PtrComprCageBase cage_base) const {
+Tagged<Object> Code::raw_instruction_stream(PtrComprCageBase cage_base) const {
   return ExternalCodeField<Object>::load(cage_base, *this);
 }
 
-void Code::set_raw_instruction_stream(Object value, WriteBarrierMode mode) {
+void Code::set_raw_instruction_stream(Tagged<Object> value,
+                                      WriteBarrierMode mode) {
   ExternalCodeField<Object>::Release_Store(*this, value);
   CONDITIONAL_WRITE_BARRIER(*this, kInstructionStreamOffset, value, mode);
 }
 
 bool Code::has_instruction_stream() const {
+#if defined(V8_COMPRESS_POINTERS) || !defined(V8_HOST_ARCH_64_BIT)
   const uint32_t value = ReadField<uint32_t>(kInstructionStreamOffset);
+#else
+  const uint64_t value = ReadField<uint64_t>(kInstructionStreamOffset);
+#endif
   SLOW_DCHECK(value == 0 || !InReadOnlySpace());
   return value != 0;
 }
 
 bool Code::has_instruction_stream(RelaxedLoadTag tag) const {
+#if defined(V8_COMPRESS_POINTERS) || !defined(V8_HOST_ARCH_64_BIT)
   const uint32_t value =
       RELAXED_READ_INT32_FIELD(*this, kInstructionStreamOffset);
+#else
+  const uint64_t value =
+      RELAXED_READ_INT64_FIELD(*this, kInstructionStreamOffset);
+#endif
   SLOW_DCHECK(value == 0 || !InReadOnlySpace());
   return value != 0;
 }
 
 PtrComprCageBase Code::code_cage_base() const {
 #ifdef V8_EXTERNAL_CODE_SPACE
-  // Only available if the current Code object is not in RO space (otherwise we
-  // can't grab the current Isolate from it).
-  DCHECK(!InReadOnlySpace());
-  Isolate* isolate = GetIsolateFromWritableObject(*this);
-  return PtrComprCageBase(isolate->code_cage_base());
+  return PtrComprCageBase(ExternalCodeCompressionScheme::base());
 #else   // V8_EXTERNAL_CODE_SPACE
   // Without external code space: `code_cage_base == main_cage_base`. We can
   // get the main cage base from any heap object, including objects in RO
@@ -917,104 +555,125 @@ PtrComprCageBase Code::code_cage_base() const {
 #endif  // V8_EXTERNAL_CODE_SPACE
 }
 
-InstructionStream Code::instruction_stream() const {
+Tagged<InstructionStream> Code::instruction_stream() const {
   PtrComprCageBase cage_base = code_cage_base();
   return Code::instruction_stream(cage_base);
 }
-InstructionStream Code::instruction_stream(PtrComprCageBase cage_base) const {
+
+Tagged<InstructionStream> Code::unchecked_instruction_stream() const {
+  return InstructionStream::unchecked_cast(raw_instruction_stream());
+}
+
+Tagged<InstructionStream> Code::instruction_stream(
+    PtrComprCageBase cage_base) const {
   DCHECK(has_instruction_stream());
   return ExternalCodeField<InstructionStream>::load(cage_base, *this);
 }
 
-InstructionStream Code::instruction_stream(RelaxedLoadTag tag) const {
+Tagged<InstructionStream> Code::instruction_stream(RelaxedLoadTag tag) const {
   PtrComprCageBase cage_base = code_cage_base();
   return Code::instruction_stream(cage_base, tag);
 }
 
-InstructionStream Code::instruction_stream(PtrComprCageBase cage_base,
-                                           RelaxedLoadTag tag) const {
+Tagged<InstructionStream> Code::instruction_stream(PtrComprCageBase cage_base,
+                                                   RelaxedLoadTag tag) const {
   DCHECK(has_instruction_stream());
   return ExternalCodeField<InstructionStream>::Relaxed_Load(cage_base, *this);
 }
 
-Object Code::raw_instruction_stream(RelaxedLoadTag tag) const {
+Tagged<Object> Code::raw_instruction_stream(RelaxedLoadTag tag) const {
   PtrComprCageBase cage_base = code_cage_base();
   return Code::raw_instruction_stream(cage_base, tag);
 }
 
-Object Code::raw_instruction_stream(PtrComprCageBase cage_base,
-                                    RelaxedLoadTag tag) const {
+Tagged<Object> Code::raw_instruction_stream(PtrComprCageBase cage_base,
+                                            RelaxedLoadTag tag) const {
   return ExternalCodeField<Object>::Relaxed_Load(cage_base, *this);
 }
 
-DEF_GETTER(Code, code_entry_point, Address) {
-  return ReadField<Address>(kCodeEntryPointOffset);
+DEF_GETTER(Code, instruction_start, Address) {
+  return ReadCodeEntrypointField(kInstructionStartOffset);
 }
 
-void Code::init_code_entry_point(Isolate* isolate, Address value) {
-  set_code_entry_point(isolate, value);
+void Code::init_instruction_start(Isolate* isolate, Address value) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // In this case, the instruction_start is stored in this Code's code pointer
+  // table entry, so initialize that instead.
+  InitCodePointerTableEntryField(kCodePointerTableEntryOffset, isolate, *this,
+                                 value);
+#else
+  WriteCodeEntrypointField(kInstructionStartOffset, value);
+#endif
 }
 
-void Code::set_code_entry_point(Isolate* isolate, Address value) {
-  WriteField<Address>(kCodeEntryPointOffset, value);
+void Code::set_instruction_start(Isolate* isolate, Address value) {
+  WriteCodeEntrypointField(kInstructionStartOffset, value);
 }
 
-void Code::SetInstructionStreamAndEntryPoint(Isolate* isolate_for_sandbox,
-                                             InstructionStream code,
-                                             WriteBarrierMode mode) {
+void Code::SetInstructionStreamAndInstructionStart(
+    Isolate* isolate_for_sandbox, Tagged<InstructionStream> code,
+    WriteBarrierMode mode) {
   set_raw_instruction_stream(code, mode);
-  set_code_entry_point(isolate_for_sandbox, code.instruction_start());
+  set_instruction_start(isolate_for_sandbox, code->instruction_start());
 }
 
-void Code::SetEntryPointForOffHeapBuiltin(Isolate* isolate_for_sandbox,
-                                          Address entry) {
+void Code::SetInstructionStartForOffHeapBuiltin(Isolate* isolate_for_sandbox,
+                                                Address entry) {
   DCHECK(!has_instruction_stream());
-  set_code_entry_point(isolate_for_sandbox, entry);
+  set_instruction_start(isolate_for_sandbox, entry);
 }
 
-void Code::SetCodeEntryPointForSerialization(Isolate* isolate, Address entry) {
-  set_code_entry_point(isolate, entry);
+void Code::ClearInstructionStartForSerialization(Isolate* isolate) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  WriteField<CodePointerHandle>(kInstructionStartOffset,
+                                kNullCodePointerHandle);
+#else
+  set_instruction_start(isolate, kNullAddress);
+#endif  // V8_CODE_POINTER_SANDBOXING
 }
 
-void Code::UpdateCodeEntryPoint(Isolate* isolate_for_sandbox,
-                                InstructionStream code) {
-  DCHECK_EQ(raw_instruction_stream(), code);
-  set_code_entry_point(isolate_for_sandbox, code.instruction_start());
+void Code::UpdateInstructionStart(Isolate* isolate_for_sandbox,
+                                  Tagged<InstructionStream> istream) {
+  DCHECK_EQ(raw_instruction_stream(), istream);
+  set_instruction_start(isolate_for_sandbox, istream->instruction_start());
 }
 
-Address Code::InstructionStart() const { return code_entry_point(); }
-
 void Code::clear_padding() {
   memset(reinterpret_cast<void*>(address() + kUnalignedSize), 0,
          kSize - kUnalignedSize);
 }
 
-RELAXED_UINT16_ACCESSORS(Code, flags, kFlagsOffset)
+RELAXED_UINT32_ACCESSORS(Code, flags, kFlagsOffset)
 
-// Ensure builtin_id field fits into int16_t, so that we can rely on sign
-// extension to convert int16_t{-1} to kNoBuiltinId.
-// If the asserts fail, update the code that use kBuiltinIdOffset below.
-static_assert(static_cast<int>(Builtin::kNoBuiltinId) == -1);
-static_assert(Builtins::kBuiltinCount < std::numeric_limits<int16_t>::max());
-
-void Code::initialize_flags(CodeKind kind, Builtin builtin_id,
-                            bool is_turbofanned, int stack_slots) {
+void Code::initialize_flags(CodeKind kind, bool is_turbofanned,
+                            int stack_slots) {
   CHECK(0 <= stack_slots && stack_slots < StackSlotsField::kMax);
   DCHECK(!CodeKindIsInterpretedJSFunction(kind));
   uint32_t value = KindField::encode(kind) |
                    IsTurbofannedField::encode(is_turbofanned) |
                    StackSlotsField::encode(stack_slots);
   static_assert(FIELD_SIZE(kFlagsOffset) == kInt32Size);
-  RELAXED_WRITE_UINT32_FIELD(*this, kFlagsOffset, value);
+  set_flags(value, kRelaxedStore);
   DCHECK_IMPLIES(stack_slots != 0, uses_safepoint_table());
   DCHECK_IMPLIES(!uses_safepoint_table(), stack_slots == 0);
+}
 
-  WriteField<int16_t>(kBuiltinIdOffset, static_cast<int16_t>(builtin_id));
+// Ensure builtin_id field fits into int16_t, so that we can rely on sign
+// extension to convert int16_t{-1} to kNoBuiltinId.
+// If the asserts fail, update the code that use kBuiltinIdOffset below.
+static_assert(static_cast<int>(Builtin::kNoBuiltinId) == -1);
+static_assert(Builtins::kBuiltinCount < std::numeric_limits<int16_t>::max());
+
+void Code::set_builtin_id(Builtin builtin_id) {
+  static_assert(FIELD_SIZE(kBuiltinIdOffset) == kInt16Size);
+  Relaxed_WriteField<int16_t>(kBuiltinIdOffset,
+                              static_cast<int16_t>(builtin_id));
 }
 
 Builtin Code::builtin_id() const {
   // Rely on sign-extension when converting int16_t to int to preserve
   // kNoBuiltinId value.
+  static_assert(FIELD_SIZE(kBuiltinIdOffset) == kInt16Size);
   static_assert(static_cast<int>(static_cast<int16_t>(Builtin::kNoBuiltinId)) ==
                 static_cast<int>(Builtin::kNoBuiltinId));
   int value = ReadField<int16_t>(kBuiltinIdOffset);
@@ -1039,242 +698,6 @@ inline bool Code::is_baseline_leave_frame_builtin() const {
   return builtin_id() == Builtin::kBaselineLeaveFrame;
 }
 
-byte BytecodeArray::get(int index) const {
-  DCHECK(index >= 0 && index < this->length());
-  return ReadField<byte>(kHeaderSize + index * kCharSize);
-}
-
-void BytecodeArray::set(int index, byte value) {
-  DCHECK(index >= 0 && index < this->length());
-  WriteField<byte>(kHeaderSize + index * kCharSize, value);
-}
-
-void BytecodeArray::set_frame_size(int32_t frame_size) {
-  DCHECK_GE(frame_size, 0);
-  DCHECK(IsAligned(frame_size, kSystemPointerSize));
-  WriteField<int32_t>(kFrameSizeOffset, frame_size);
-}
-
-int32_t BytecodeArray::frame_size() const {
-  return ReadField<int32_t>(kFrameSizeOffset);
-}
-
-int BytecodeArray::register_count() const {
-  return static_cast<int>(frame_size()) / kSystemPointerSize;
-}
-
-void BytecodeArray::set_parameter_count(int32_t number_of_parameters) {
-  DCHECK_GE(number_of_parameters, 0);
-  // Parameter count is stored as the size on stack of the parameters to allow
-  // it to be used directly by generated code.
-  WriteField<int32_t>(kParameterSizeOffset,
-                      (number_of_parameters << kSystemPointerSizeLog2));
-}
-
-interpreter::Register BytecodeArray::incoming_new_target_or_generator_register()
-    const {
-  int32_t register_operand =
-      ReadField<int32_t>(kIncomingNewTargetOrGeneratorRegisterOffset);
-  if (register_operand == 0) {
-    return interpreter::Register::invalid_value();
-  } else {
-    return interpreter::Register::FromOperand(register_operand);
-  }
-}
-
-void BytecodeArray::set_incoming_new_target_or_generator_register(
-    interpreter::Register incoming_new_target_or_generator_register) {
-  if (!incoming_new_target_or_generator_register.is_valid()) {
-    WriteField<int32_t>(kIncomingNewTargetOrGeneratorRegisterOffset, 0);
-  } else {
-    DCHECK(incoming_new_target_or_generator_register.index() <
-           register_count());
-    DCHECK_NE(0, incoming_new_target_or_generator_register.ToOperand());
-    WriteField<int32_t>(kIncomingNewTargetOrGeneratorRegisterOffset,
-                        incoming_new_target_or_generator_register.ToOperand());
-  }
-}
-
-uint16_t BytecodeArray::bytecode_age() const {
-  // Bytecode is aged by the concurrent marker.
-  return RELAXED_READ_UINT16_FIELD(*this, kBytecodeAgeOffset);
-}
-
-void BytecodeArray::set_bytecode_age(uint16_t age) {
-  // Bytecode is aged by the concurrent marker.
-  RELAXED_WRITE_UINT16_FIELD(*this, kBytecodeAgeOffset, age);
-}
-
-int32_t BytecodeArray::parameter_count() const {
-  // Parameter count is stored as the size on stack of the parameters to allow
-  // it to be used directly by generated code.
-  return ReadField<int32_t>(kParameterSizeOffset) >> kSystemPointerSizeLog2;
-}
-
-void BytecodeArray::clear_padding() {
-  int data_size = kHeaderSize + length();
-  memset(reinterpret_cast<void*>(address() + data_size), 0,
-         SizeFor(length()) - data_size);
-}
-
-Address BytecodeArray::GetFirstBytecodeAddress() {
-  return ptr() - kHeapObjectTag + kHeaderSize;
-}
-
-bool BytecodeArray::HasSourcePositionTable() const {
-  Object maybe_table = source_position_table(kAcquireLoad);
-  return !(maybe_table.IsUndefined() || DidSourcePositionGenerationFail());
-}
-
-bool BytecodeArray::DidSourcePositionGenerationFail() const {
-  return source_position_table(kAcquireLoad).IsException();
-}
-
-void BytecodeArray::SetSourcePositionsFailedToCollect() {
-  set_source_position_table(GetReadOnlyRoots().exception(), kReleaseStore);
-}
-
-DEF_GETTER(BytecodeArray, SourcePositionTable, ByteArray) {
-  // WARNING: This function may be called from a background thread, hence
-  // changes to how it accesses the heap can easily lead to bugs.
-  Object maybe_table = source_position_table(cage_base, kAcquireLoad);
-  if (maybe_table.IsByteArray(cage_base)) return ByteArray::cast(maybe_table);
-  ReadOnlyRoots roots = GetReadOnlyRoots();
-  DCHECK(maybe_table.IsUndefined(roots) || maybe_table.IsException(roots));
-  return roots.empty_byte_array();
-}
-
-DEF_GETTER(BytecodeArray, raw_constant_pool, Object) {
-  Object value =
-      TaggedField<Object>::load(cage_base, *this, kConstantPoolOffset);
-  // This field might be 0 during deserialization.
-  DCHECK(value == Smi::zero() || value.IsFixedArray());
-  return value;
-}
-
-DEF_GETTER(BytecodeArray, raw_handler_table, Object) {
-  Object value =
-      TaggedField<Object>::load(cage_base, *this, kHandlerTableOffset);
-  // This field might be 0 during deserialization.
-  DCHECK(value == Smi::zero() || value.IsByteArray());
-  return value;
-}
-
-DEF_GETTER(BytecodeArray, raw_source_position_table, Object) {
-  Object value =
-      TaggedField<Object>::load(cage_base, *this, kSourcePositionTableOffset);
-  // This field might be 0 during deserialization.
-  DCHECK(value == Smi::zero() || value.IsByteArray() || value.IsUndefined() ||
-         value.IsException());
-  return value;
-}
-
-int BytecodeArray::BytecodeArraySize() const { return SizeFor(this->length()); }
-
-DEF_GETTER(BytecodeArray, SizeIncludingMetadata, int) {
-  int size = BytecodeArraySize();
-  Object maybe_constant_pool = raw_constant_pool(cage_base);
-  if (maybe_constant_pool.IsFixedArray()) {
-    size += FixedArray::cast(maybe_constant_pool).Size(cage_base);
-  } else {
-    DCHECK_EQ(maybe_constant_pool, Smi::zero());
-  }
-  Object maybe_handler_table = raw_handler_table(cage_base);
-  if (maybe_handler_table.IsByteArray()) {
-    size += ByteArray::cast(maybe_handler_table).Size();
-  } else {
-    DCHECK_EQ(maybe_handler_table, Smi::zero());
-  }
-  Object maybe_table = raw_source_position_table(cage_base);
-  if (maybe_table.IsByteArray()) {
-    size += ByteArray::cast(maybe_table).Size();
-  }
-  return size;
-}
-
-DEFINE_DEOPT_ELEMENT_ACCESSORS(TranslationByteArray, TranslationArray)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(InlinedFunctionCount, Smi)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(LiteralArray, DeoptimizationLiteralArray)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(OsrBytecodeOffset, Smi)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(OsrPcOffset, Smi)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(OptimizationId, Smi)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(InliningPositions, PodArray<InliningPosition>)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(DeoptExitStart, Smi)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(EagerDeoptCount, Smi)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(LazyDeoptCount, Smi)
-
-DEFINE_DEOPT_ENTRY_ACCESSORS(BytecodeOffsetRaw, Smi)
-DEFINE_DEOPT_ENTRY_ACCESSORS(TranslationIndex, Smi)
-DEFINE_DEOPT_ENTRY_ACCESSORS(Pc, Smi)
-#ifdef DEBUG
-DEFINE_DEOPT_ENTRY_ACCESSORS(NodeId, Smi)
-#endif  // DEBUG
-
-BytecodeOffset DeoptimizationData::GetBytecodeOffset(int i) const {
-  return BytecodeOffset(BytecodeOffsetRaw(i).value());
-}
-
-void DeoptimizationData::SetBytecodeOffset(int i, BytecodeOffset value) {
-  SetBytecodeOffsetRaw(i, Smi::FromInt(value.ToInt()));
-}
-
-int DeoptimizationData::DeoptCount() {
-  return (length() - kFirstDeoptEntryIndex) / kDeoptEntrySize;
-}
-
-inline DeoptimizationLiteralArray::DeoptimizationLiteralArray(Address ptr)
-    : WeakFixedArray(ptr) {
-  // No type check is possible beyond that for WeakFixedArray.
-}
-
-inline Object DeoptimizationLiteralArray::get(int index) const {
-  return get(GetPtrComprCageBase(*this), index);
-}
-
-inline Object DeoptimizationLiteralArray::get(PtrComprCageBase cage_base,
-                                              int index) const {
-  MaybeObject maybe = Get(cage_base, index);
-
-  // Slots in the DeoptimizationLiteralArray should only be cleared when there
-  // is no possible code path that could need that slot. This works because the
-  // weakly-held deoptimization literals are basically local variables that
-  // TurboFan has decided not to keep on the stack. Thus, if the deoptimization
-  // literal goes away, then whatever code needed it should be unreachable. The
-  // exception is currently running InstructionStream: in that case, the
-  // deoptimization literals array might be the only thing keeping the target
-  // object alive. Thus, when a InstructionStream is running, we strongly mark
-  // all of its deoptimization literals.
-  CHECK(!maybe.IsCleared());
-
-  return maybe.GetHeapObjectOrSmi();
-}
-
-inline void DeoptimizationLiteralArray::set(int index, Object value) {
-  MaybeObject maybe = MaybeObject::FromObject(value);
-  if (Code::IsWeakObjectInDeoptimizationLiteralArray(value)) {
-    maybe = MaybeObject::MakeWeak(maybe);
-  }
-  Set(index, maybe);
-}
-
-// static
-template <typename ObjectT>
-void DependentCode::DeoptimizeDependencyGroups(Isolate* isolate, ObjectT object,
-                                               DependencyGroups groups) {
-  // Shared objects are designed to never invalidate code.
-  DCHECK(!object.InSharedHeap());
-  object.dependent_code().DeoptimizeDependencyGroups(isolate, groups);
-}
-
-// static
-template <typename ObjectT>
-bool DependentCode::MarkCodeForDeoptimization(Isolate* isolate, ObjectT object,
-                                              DependencyGroups groups) {
-  // Shared objects are designed to never invalidate code.
-  DCHECK(!object.InSharedHeap());
-  return object.dependent_code().MarkCodeForDeoptimization(isolate, groups);
-}
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/code-kind.h b/deps/v8/src/objects/code-kind.h
index e9569af055feb0..a863831d66eeb5 100644
--- a/deps/v8/src/objects/code-kind.h
+++ b/deps/v8/src/objects/code-kind.h
@@ -86,7 +86,7 @@ inline constexpr bool CodeKindCanDeoptimize(CodeKind kind) {
 }
 
 inline constexpr bool CodeKindCanOSR(CodeKind kind) {
-  return kind == CodeKind::TURBOFAN;
+  return kind == CodeKind::TURBOFAN || kind == CodeKind::MAGLEV;
 }
 
 inline constexpr bool CodeKindCanTierUp(CodeKind kind) {
diff --git a/deps/v8/src/objects/code.cc b/deps/v8/src/objects/code.cc
index 1ca28beb309de0..43b19adafa1553 100644
--- a/deps/v8/src/objects/code.cc
+++ b/deps/v8/src/objects/code.cc
@@ -6,263 +6,46 @@
 
 #include <iomanip>
 
-#include "src/base/v8-fallthrough.h"
 #include "src/codegen/assembler-inl.h"
-#include "src/codegen/cpu-features.h"
-#include "src/codegen/reloc-info.h"
-#include "src/codegen/safepoint-table.h"
-#include "src/codegen/source-position.h"
+#include "src/codegen/flush-instruction-cache.h"
+#include "src/codegen/reloc-info-inl.h"
 #include "src/deoptimizer/deoptimizer.h"
-#include "src/execution/isolate-utils-inl.h"
-#include "src/interpreter/bytecode-array-iterator.h"
-#include "src/interpreter/bytecode-decoder.h"
-#include "src/interpreter/interpreter.h"
-#include "src/objects/allocation-site-inl.h"
-#include "src/objects/code-kind.h"
-#include "src/objects/fixed-array.h"
-#include "src/roots/roots-inl.h"
-#include "src/snapshot/embedded/embedded-data-inl.h"
-#include "src/utils/ostreams.h"
+#include "src/objects/code-inl.h"
 
 #ifdef ENABLE_DISASSEMBLER
-#include "src/codegen/code-comments.h"
-#include "src/diagnostics/disasm.h"
 #include "src/diagnostics/disassembler.h"
 #include "src/diagnostics/eh-frame.h"
 #endif
 
-#ifdef V8_ENABLE_WEBASSEMBLY
-#include "src/wasm/wasm-code-manager.h"
-#endif
-
 namespace v8 {
 namespace internal {
 
-namespace {
-
-// Helper function for getting an EmbeddedData that can handle un-embedded
-// builtins when short builtin calls are enabled.
-inline EmbeddedData EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(
-    HeapObject code) {
-#if defined(V8_COMPRESS_POINTERS_IN_ISOLATE_CAGE)
-  // GetIsolateFromWritableObject(*this) works for both read-only and writable
-  // objects when pointer compression is enabled with a per-Isolate cage.
-  return EmbeddedData::FromBlob(GetIsolateFromWritableObject(code));
-#elif defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE)
-  // When pointer compression is enabled with a shared cage, there is also a
-  // shared CodeRange. When short builtin calls are enabled, there is a single
-  // copy of the re-embedded builtins in the shared CodeRange, so use that if
-  // it's present.
-  if (v8_flags.jitless) return EmbeddedData::FromBlob();
-  CodeRange* code_range = CodeRange::GetProcessWideCodeRange();
-  return (code_range && code_range->embedded_blob_code_copy() != nullptr)
-             ? EmbeddedData::FromBlob(code_range)
-             : EmbeddedData::FromBlob();
-#else
-  // Otherwise there is a single copy of the blob across all Isolates, use the
-  // global atomic variables.
-  return EmbeddedData::FromBlob();
-#endif
-}
-
-}  // namespace
-
-Address Code::OffHeapInstructionStart() const {
-  // TODO(11527): Here and below: pass Isolate as an argument for getting
-  // the EmbeddedData.
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.InstructionStartOfBuiltin(builtin);
-}
-
-Address Code::OffHeapInstructionEnd() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.InstructionStartOfBuiltin(builtin) +
-         d.InstructionSizeOfBuiltin(builtin);
-}
-
-int Code::OffHeapInstructionSize() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.InstructionSizeOfBuiltin(builtin);
-}
-
-Address Code::OffHeapMetadataStart() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.MetadataStartOfBuiltin(builtin);
-}
-
-Address Code::OffHeapMetadataEnd() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.MetadataStartOfBuiltin(builtin) + d.MetadataSizeOfBuiltin(builtin);
-}
-
-int Code::OffHeapMetadataSize() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.MetadataSizeOfBuiltin(builtin);
-}
-
-Address Code::OffHeapSafepointTableAddress() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.SafepointTableStartOf(builtin);
-}
-
-int Code::OffHeapSafepointTableSize() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.SafepointTableSizeOf(builtin);
-}
-
-Address Code::OffHeapHandlerTableAddress() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.HandlerTableStartOf(builtin);
+Tagged<ByteArray> Code::raw_position_table() const {
+  return TaggedField<ByteArray, kPositionTableOffset>::load(*this);
 }
 
-int Code::OffHeapHandlerTableSize() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.HandlerTableSizeOf(builtin);
-}
-
-Address Code::OffHeapConstantPoolAddress() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.ConstantPoolStartOf(builtin);
-}
-
-int Code::OffHeapConstantPoolSize() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.ConstantPoolSizeOf(builtin);
-}
-
-Address Code::OffHeapCodeCommentsAddress() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.CodeCommentsStartOf(builtin);
-}
-
-int Code::OffHeapCodeCommentsSize() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.CodeCommentsSizeOf(builtin);
-}
-
-Address Code::OffHeapUnwindingInfoAddress() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.UnwindingInfoStartOf(builtin);
-}
-
-int Code::OffHeapUnwindingInfoSize() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.UnwindingInfoSizeOf(builtin);
-}
-
-int Code::OffHeapStackSlots() const {
-  Builtin builtin = builtin_id();
-  EmbeddedData d = EmbeddedDataWithMaybeRemappedEmbeddedBuiltins(*this);
-  return d.StackSlotsOf(builtin);
+Tagged<HeapObject> Code::raw_deoptimization_data_or_interpreter_data() const {
+  return TaggedField<HeapObject,
+                     kDeoptimizationDataOrInterpreterDataOffset>::load(*this);
 }
 
 void Code::ClearEmbeddedObjects(Heap* heap) {
-  HeapObject undefined = ReadOnlyRoots(heap).undefined_value();
+  DisallowGarbageCollection no_gc;
+  Tagged<HeapObject> undefined = ReadOnlyRoots(heap).undefined_value();
+  Tagged<InstructionStream> istream = unchecked_instruction_stream();
   int mode_mask = RelocInfo::EmbeddedObjectModeMask();
-  for (RelocIterator it(*this, mode_mask); !it.done(); it.next()) {
-    DCHECK(RelocInfo::IsEmbeddedObjectMode(it.rinfo()->rmode()));
-    it.rinfo()->set_target_object(heap, undefined, SKIP_WRITE_BARRIER);
+  {
+    CodePageMemoryModificationScope memory_modification_scope(istream);
+    for (RelocIterator it(*this, mode_mask); !it.done(); it.next()) {
+      DCHECK(RelocInfo::IsEmbeddedObjectMode(it.rinfo()->rmode()));
+      it.rinfo()->set_target_object(istream, undefined, SKIP_WRITE_BARRIER);
+    }
   }
   set_embedded_objects_cleared(true);
 }
 
-void InstructionStream::Relocate(intptr_t delta) {
-  Code code = unchecked_code();
-  // This is called during evacuation and code.instruction_stream() will point
-  // to the old object. So pass *this directly to the RelocIterator and use a
-  // dummy Code() since it's not needed.
-  for (RelocIterator it(Code(), *this, code.unchecked_relocation_info(),
-                        code.constant_pool(), RelocInfo::kApplyMask);
-       !it.done(); it.next()) {
-    it.rinfo()->apply(delta);
-  }
-  FlushInstructionCache(instruction_start(), code.instruction_size());
-}
-
 void Code::FlushICache() const {
-  FlushInstructionCache(InstructionStart(), instruction_size());
-}
-
-void Code::CopyFromNoFlush(ByteArray reloc_info, Heap* heap,
-                           const CodeDesc& desc) {
-  // Copy code.
-  static_assert(InstructionStream::kOnHeapBodyIsContiguous);
-  CopyBytes(reinterpret_cast<byte*>(InstructionStart()), desc.buffer,
-            static_cast<size_t>(desc.instr_size));
-  // TODO(jgruber,v8:11036): Merge with the above.
-  CopyBytes(reinterpret_cast<byte*>(InstructionStart() + desc.instr_size),
-            desc.unwinding_info, static_cast<size_t>(desc.unwinding_info_size));
-
-  // Copy reloc info.
-  CopyRelocInfoToByteArray(reloc_info, desc);
-
-  // Unbox handles and relocate.
-  RelocateFromDesc(reloc_info, heap, desc);
-}
-
-void Code::RelocateFromDesc(ByteArray reloc_info, Heap* heap,
-                            const CodeDesc& desc) {
-  // Unbox handles and relocate.
-  Assembler* origin = desc.origin;
-  const int mode_mask = RelocInfo::PostCodegenRelocationMask();
-  for (RelocIterator it(*this, reloc_info, mode_mask); !it.done(); it.next()) {
-    RelocInfo::Mode mode = it.rinfo()->rmode();
-    if (RelocInfo::IsEmbeddedObjectMode(mode)) {
-      Handle<HeapObject> p = it.rinfo()->target_object_handle(origin);
-      it.rinfo()->set_target_object(heap, *p, UPDATE_WRITE_BARRIER,
-                                    SKIP_ICACHE_FLUSH);
-    } else if (RelocInfo::IsCodeTargetMode(mode)) {
-      // Rewrite code handles to direct pointers to the first instruction in the
-      // code object.
-      Handle<HeapObject> p = it.rinfo()->target_object_handle(origin);
-      DCHECK(p->IsCode(GetPtrComprCageBaseSlow(*p)));
-      InstructionStream code = FromCode(Code::cast(*p));
-      it.rinfo()->set_target_address(code.instruction_start(),
-                                     UPDATE_WRITE_BARRIER, SKIP_ICACHE_FLUSH);
-    } else if (RelocInfo::IsNearBuiltinEntry(mode)) {
-      // Rewrite builtin IDs to PC-relative offset to the builtin entry point.
-      Builtin builtin = it.rinfo()->target_builtin_at(origin);
-      Address p =
-          heap->isolate()->builtin_entry_table()[Builtins::ToInt(builtin)];
-      it.rinfo()->set_target_address(p, UPDATE_WRITE_BARRIER,
-                                     SKIP_ICACHE_FLUSH);
-      DCHECK_EQ(p, it.rinfo()->target_address());
-    } else if (RelocInfo::IsWasmStubCall(mode)) {
-#if V8_ENABLE_WEBASSEMBLY
-      // Map wasm stub id to builtin.
-      uint32_t stub_call_tag = it.rinfo()->wasm_call_tag();
-      DCHECK_LT(stub_call_tag, wasm::WasmCode::kRuntimeStubCount);
-      Builtin builtin = wasm::RuntimeStubIdToBuiltinName(
-          static_cast<wasm::WasmCode::RuntimeStubId>(stub_call_tag));
-      // Store the builtin address in relocation info.
-      Address entry =
-          heap->isolate()->builtin_entry_table()[Builtins::ToInt(builtin)];
-      it.rinfo()->set_wasm_stub_call_address(entry, SKIP_ICACHE_FLUSH);
-#else
-      UNREACHABLE();
-#endif
-    } else {
-      intptr_t delta =
-          InstructionStart() - reinterpret_cast<Address>(desc.buffer);
-      it.rinfo()->apply(delta);
-    }
-  }
+  FlushInstructionCache(instruction_start(), instruction_size());
 }
 
 SafepointEntry Code::GetSafepointEntry(Isolate* isolate, Address pc) {
@@ -278,64 +61,6 @@ MaglevSafepointEntry Code::GetMaglevSafepointEntry(Isolate* isolate,
   return table.FindEntry(pc);
 }
 
-Address Code::OffHeapInstructionStart(Isolate* isolate, Address pc) const {
-  DCHECK(!has_instruction_stream());
-  EmbeddedData d = EmbeddedData::GetEmbeddedDataForPC(isolate, pc);
-  return d.InstructionStartOfBuiltin(builtin_id());
-}
-
-Address Code::OffHeapInstructionEnd(Isolate* isolate, Address pc) const {
-  DCHECK(!has_instruction_stream());
-  EmbeddedData d = EmbeddedData::GetEmbeddedDataForPC(isolate, pc);
-  return d.InstructionEndOf(builtin_id());
-}
-
-bool Code::OffHeapBuiltinContains(Isolate* isolate, Address pc) const {
-  DCHECK(!has_instruction_stream());
-  EmbeddedData d = EmbeddedData::GetEmbeddedDataForPC(isolate, pc);
-  return d.BuiltinContains(builtin_id(), pc);
-}
-
-// TODO(cbruni): Move to BytecodeArray
-int AbstractCode::SourcePosition(PtrComprCageBase cage_base, int offset) {
-  CHECK_NE(kind(cage_base), CodeKind::BASELINE);
-  Object maybe_table = SourcePositionTableInternal(cage_base);
-  if (maybe_table.IsException()) return kNoSourcePosition;
-
-  ByteArray source_position_table = ByteArray::cast(maybe_table);
-  // Subtract one because the current PC is one instruction after the call site.
-  if (IsCode(cage_base)) offset--;
-  int position = 0;
-  for (SourcePositionTableIterator iterator(
-           source_position_table, SourcePositionTableIterator::kJavaScriptOnly,
-           SourcePositionTableIterator::kDontSkipFunctionEntry);
-       !iterator.done() && iterator.code_offset() <= offset;
-       iterator.Advance()) {
-    position = iterator.source_position().ScriptOffset();
-  }
-  return position;
-}
-
-// TODO(cbruni): Move to BytecodeArray
-int AbstractCode::SourceStatementPosition(PtrComprCageBase cage_base,
-                                          int offset) {
-  CHECK_NE(kind(cage_base), CodeKind::BASELINE);
-  // First find the closest position.
-  int position = SourcePosition(cage_base, offset);
-  // Now find the closest statement position before the position.
-  int statement_position = 0;
-  for (SourcePositionTableIterator it(SourcePositionTableInternal(cage_base));
-       !it.done(); it.Advance()) {
-    if (it.is_statement()) {
-      int p = it.source_position().ScriptOffset();
-      if (statement_position < p && p <= position) {
-        statement_position = p;
-      }
-    }
-  }
-  return statement_position;
-}
-
 bool Code::IsIsolateIndependent(Isolate* isolate) {
   static constexpr int kModeMask =
       RelocInfo::AllRealModesMask() &
@@ -349,6 +74,7 @@ bool Code::IsIsolateIndependent(Isolate* isolate) {
                  RelocInfo::ModeMask(RelocInfo::FULL_EMBEDDED_OBJECT) |
                  RelocInfo::ModeMask(RelocInfo::EXTERNAL_REFERENCE) |
                  RelocInfo::ModeMask(RelocInfo::INTERNAL_REFERENCE) |
+                 RelocInfo::ModeMask(RelocInfo::RELATIVE_SWITCH_TABLE_ENTRY) |
                  RelocInfo::ModeMask(RelocInfo::INTERNAL_REFERENCE_ENCODED) |
                  RelocInfo::ModeMask(RelocInfo::NEAR_BUILTIN_ENTRY) |
                  RelocInfo::ModeMask(RelocInfo::WASM_CALL) |
@@ -371,10 +97,13 @@ bool Code::IsIsolateIndependent(Isolate* isolate) {
       if (OffHeapInstructionStream::PcIsOffHeap(isolate, target_address))
         continue;
 
-      Code target = Code::FromTargetAddress(target_address);
+      Tagged<Code> target = Code::FromTargetAddress(target_address);
       if (Builtins::IsIsolateIndependentBuiltin(target)) {
         continue;
       }
+    } else if (RelocInfo::IsRelativeSwitchTableEntry(it.rinfo()->rmode())) {
+      CHECK(is_builtin());
+      continue;
     }
     return false;
   }
@@ -384,189 +113,79 @@ bool Code::IsIsolateIndependent(Isolate* isolate) {
 #endif
 }
 
-bool Code::Inlines(SharedFunctionInfo sfi) {
+bool Code::Inlines(Tagged<SharedFunctionInfo> sfi) {
   // We can only check for inlining for optimized code.
   DCHECK(is_optimized_code());
   DisallowGarbageCollection no_gc;
-  DeoptimizationData const data =
+  Tagged<DeoptimizationData> const data =
       DeoptimizationData::cast(deoptimization_data());
-  if (data.length() == 0) return false;
-  if (data.SharedFunctionInfo() == sfi) return true;
-  DeoptimizationLiteralArray const literals = data.LiteralArray();
-  int const inlined_count = data.InlinedFunctionCount().value();
+  if (data->length() == 0) return false;
+  if (data->SharedFunctionInfo() == sfi) return true;
+  Tagged<DeoptimizationLiteralArray> const literals = data->LiteralArray();
+  int const inlined_count = data->InlinedFunctionCount().value();
   for (int i = 0; i < inlined_count; ++i) {
-    if (SharedFunctionInfo::cast(literals.get(i)) == sfi) return true;
+    if (SharedFunctionInfo::cast(literals->get(i)) == sfi) return true;
   }
   return false;
 }
 
-Code::OptimizedCodeIterator::OptimizedCodeIterator(Isolate* isolate)
-    : isolate_(isolate),
-      safepoint_scope_(std::make_unique<SafepointScope>(
-          isolate, isolate->is_shared_space_isolate()
-                       ? SafepointKind::kGlobal
-                       : SafepointKind::kIsolate)),
-      object_iterator_(
-          isolate->heap()->code_space()->GetObjectIterator(isolate->heap())),
-      state_(kIteratingCodeSpace) {}
-
-Code Code::OptimizedCodeIterator::Next() {
-  while (true) {
-    HeapObject object = object_iterator_->Next();
-    if (object.is_null()) {
-      // No objects left in the current iterator, try to move to the next space
-      // based on the state.
-      switch (state_) {
-        case kIteratingCodeSpace: {
-          object_iterator_ =
-              isolate_->heap()->code_lo_space()->GetObjectIterator(
-                  isolate_->heap());
-          state_ = kIteratingCodeLOSpace;
-          continue;
-        }
-        case kIteratingCodeLOSpace:
-          // No other spaces to iterate, so clean up and we're done. Keep the
-          // object iterator so that it keeps returning null on Next(), to avoid
-          // needing to branch on state_ before the while loop, but drop the
-          // safepoint scope since we no longer need to stop the heap from
-          // moving.
-          safepoint_scope_.reset();
-          state_ = kDone;
-          V8_FALLTHROUGH;
-        case kDone:
-          return Code();
-      }
-    }
-    InstructionStream istream = InstructionStream::cast(object);
-    Code code = istream.code(kAcquireLoad);
-    if (!CodeKindCanDeoptimize(code.kind())) continue;
-    return code;
-  }
-}
-
-Handle<DeoptimizationData> DeoptimizationData::New(Isolate* isolate,
-                                                   int deopt_entry_count,
-                                                   AllocationType allocation) {
-  return Handle<DeoptimizationData>::cast(isolate->factory()->NewFixedArray(
-      LengthFor(deopt_entry_count), allocation));
-}
-
-Handle<DeoptimizationData> DeoptimizationData::Empty(Isolate* isolate) {
-  return Handle<DeoptimizationData>::cast(
-      isolate->factory()->empty_fixed_array());
-}
-
-SharedFunctionInfo DeoptimizationData::GetInlinedFunction(int index) {
-  if (index == -1) {
-    return SharedFunctionInfo::cast(SharedFunctionInfo());
-  } else {
-    return SharedFunctionInfo::cast(LiteralArray().get(index));
-  }
-}
-
 #ifdef ENABLE_DISASSEMBLER
 
 namespace {
 
-void print_pc(std::ostream& os, int pc) {
-  if (pc == -1) {
-    os << "NA";
-  } else {
-    os << std::hex << pc << std::dec;
-  }
-}
-}  // anonymous namespace
-
-void DeoptimizationData::DeoptimizationDataPrint(std::ostream& os) {
-  if (length() == 0) {
-    os << "Deoptimization Input Data invalidated by lazy deoptimization\n";
-    return;
-  }
-
-  int const inlined_function_count = InlinedFunctionCount().value();
-  os << "Inlined functions (count = " << inlined_function_count << ")\n";
-  for (int id = 0; id < inlined_function_count; ++id) {
-    Object info = LiteralArray().get(id);
-    os << " " << Brief(SharedFunctionInfo::cast(info)) << "\n";
-  }
-  os << "\n";
-  int deopt_count = DeoptCount();
-  os << "Deoptimization Input Data (deopt points = " << deopt_count << ")\n";
-  if (0 != deopt_count) {
-#ifdef DEBUG
-    os << " index  bytecode-offset  node-id    pc";
-#else   // DEBUG
-    os << " index  bytecode-offset    pc";
-#endif  // DEBUG
-    if (v8_flags.print_code_verbose) os << "  commands";
-    os << "\n";
-  }
-  for (int i = 0; i < deopt_count; i++) {
-    os << std::setw(6) << i << "  " << std::setw(15)
-       << GetBytecodeOffset(i).ToInt() << "  "
-#ifdef DEBUG
-       << std::setw(7) << NodeId(i).value() << "  "
-#endif  // DEBUG
-       << std::setw(4);
-    print_pc(os, Pc(i).value());
-    os << std::setw(2);
-
-    if (!v8_flags.print_code_verbose) {
-      os << "\n";
-      continue;
-    }
-
-    TranslationArrayPrintSingleFrame(os, TranslationByteArray(),
-                                     TranslationIndex(i).value(),
-                                     LiteralArray());
-  }
-}
-
-namespace {
-
-void DisassembleCodeRange(Isolate* isolate, std::ostream& os, Code code,
-                          Address begin, size_t size, Address current_pc) {
+void DisassembleCodeRange(Isolate* isolate, std::ostream& os, Tagged<Code> code,
+                          Address begin, size_t size, Address current_pc,
+                          size_t range_limit = 0) {
   Address end = begin + size;
   AllowHandleAllocation allow_handles;
   DisallowGarbageCollection no_gc;
   HandleScope handle_scope(isolate);
-  Disassembler::Decode(isolate, os, reinterpret_cast<byte*>(begin),
-                       reinterpret_cast<byte*>(end),
-                       CodeReference(handle(code, isolate)), current_pc);
+  Disassembler::Decode(isolate, os, reinterpret_cast<uint8_t*>(begin),
+                       reinterpret_cast<uint8_t*>(end),
+                       CodeReference(handle(code, isolate)), current_pc,
+                       range_limit);
+}
+
+void DisassembleOnlyCode(const char* name, std::ostream& os, Isolate* isolate,
+                         Tagged<Code> code, Address current_pc,
+                         size_t range_limit) {
+  int code_size = code->instruction_size();
+  DisassembleCodeRange(isolate, os, code, code->instruction_start(), code_size,
+                       current_pc, range_limit);
 }
 
 void Disassemble(const char* name, std::ostream& os, Isolate* isolate,
-                 Code code, Address current_pc) {
-  CodeKind kind = code.kind();
+                 Tagged<Code> code, Address current_pc) {
+  CodeKind kind = code->kind();
   os << "kind = " << CodeKindToString(kind) << "\n";
-  if (name == nullptr && code.is_builtin()) {
-    name = Builtins::name(code.builtin_id());
+  if (name == nullptr && code->is_builtin()) {
+    name = Builtins::name(code->builtin_id());
   }
   if ((name != nullptr) && (name[0] != '\0')) {
     os << "name = " << name << "\n";
   }
   if (CodeKindIsOptimizedJSFunction(kind) && kind != CodeKind::BASELINE) {
-    os << "stack_slots = " << code.stack_slots() << "\n";
+    os << "stack_slots = " << code->stack_slots() << "\n";
   }
   os << "compiler = "
-     << (code.is_turbofanned()        ? "turbofan"
-         : code.is_maglevved()        ? "maglev"
+     << (code->is_turbofanned()       ? "turbofan"
+         : code->is_maglevved()       ? "maglev"
          : kind == CodeKind::BASELINE ? "baseline"
                                       : "unknown")
      << "\n";
   os << "address = " << reinterpret_cast<void*>(code.ptr()) << "\n\n";
 
   {
-    int code_size = code.InstructionSize();
+    int code_size = code->instruction_size();
     os << "Instructions (size = " << code_size << ")\n";
-    DisassembleCodeRange(isolate, os, code, code.InstructionStart(), code_size,
-                         current_pc);
+    DisassembleCodeRange(isolate, os, code, code->instruction_start(),
+                         code_size, current_pc);
 
-    if (int pool_size = code.constant_pool_size()) {
+    if (int pool_size = code->constant_pool_size()) {
       DCHECK_EQ(pool_size & kPointerAlignmentMask, 0);
       os << "\nConstant Pool (size = " << pool_size << ")\n";
       base::Vector<char> buf = base::Vector<char>::New(50);
-      intptr_t* ptr = reinterpret_cast<intptr_t*>(code.constant_pool());
+      intptr_t* ptr = reinterpret_cast<intptr_t*>(code->constant_pool());
       for (int i = 0; i < pool_size; i += kSystemPointerSize, ptr++) {
         SNPrintF(buf, "%4d %08" V8PRIxPTR, i, *ptr);
         os << static_cast<const void*>(ptr) << "  " << buf.begin() << "\n";
@@ -579,7 +198,7 @@ void Disassemble(const char* name, std::ostream& os, Isolate* isolate,
   if (kind != CodeKind::BASELINE) {
     {
       SourcePositionTableIterator it(
-          code.source_position_table(),
+          code->source_position_table(),
           SourcePositionTableIterator::kJavaScriptOnly);
       if (!it.done()) {
         os << "Source positions:\n pc offset  position\n";
@@ -594,7 +213,7 @@ void Disassemble(const char* name, std::ostream& os, Isolate* isolate,
 
     {
       SourcePositionTableIterator it(
-          code.source_position_table(),
+          code->source_position_table(),
           SourcePositionTableIterator::kExternalOnly);
       if (!it.done()) {
         os << "External Source positions:\n pc offset  fileid  line\n";
@@ -610,14 +229,14 @@ void Disassemble(const char* name, std::ostream& os, Isolate* isolate,
   }
 
   if (CodeKindCanDeoptimize(kind)) {
-    DeoptimizationData data =
-        DeoptimizationData::cast(code.deoptimization_data());
-    data.DeoptimizationDataPrint(os);
+    Tagged<DeoptimizationData> data =
+        DeoptimizationData::cast(code->deoptimization_data());
+    data->PrintDeoptimizationData(os);
   }
   os << "\n";
 
-  if (code.uses_safepoint_table()) {
-    if (code.is_maglevved()) {
+  if (code->uses_safepoint_table()) {
+    if (code->is_maglevved()) {
       MaglevSafepointTable table(isolate, current_pc, code);
       table.Print(os);
     } else {
@@ -627,7 +246,7 @@ void Disassemble(const char* name, std::ostream& os, Isolate* isolate,
     os << "\n";
   }
 
-  if (code.has_handler_table()) {
+  if (code->has_handler_table()) {
     HandlerTable table(code);
     os << "Handler Table (size = " << table.NumberOfReturnEntries() << ")\n";
     if (CodeKindIsOptimizedJSFunction(kind)) {
@@ -636,19 +255,19 @@ void Disassemble(const char* name, std::ostream& os, Isolate* isolate,
     os << "\n";
   }
 
-  os << "RelocInfo (size = " << code.relocation_size() << ")\n";
-  if (code.has_instruction_stream()) {
+  os << "RelocInfo (size = " << code->relocation_size() << ")\n";
+  if (code->has_instruction_stream()) {
     for (RelocIterator it(code); !it.done(); it.next()) {
       it.rinfo()->Print(isolate, os);
     }
   }
   os << "\n";
 
-  if (code.has_unwinding_info()) {
-    os << "UnwindingInfo (size = " << code.unwinding_info_size() << ")\n";
+  if (code->has_unwinding_info()) {
+    os << "UnwindingInfo (size = " << code->unwinding_info_size() << ")\n";
     EhFrameDisassembler eh_frame_disassembler(
-        reinterpret_cast<byte*>(code.unwinding_info_start()),
-        reinterpret_cast<byte*>(code.unwinding_info_end()));
+        reinterpret_cast<uint8_t*>(code->unwinding_info_start()),
+        reinterpret_cast<uint8_t*>(code->unwinding_info_end()));
     eh_frame_disassembler.DisassembleToStream(os);
     os << "\n";
   }
@@ -661,359 +280,18 @@ void Code::Disassemble(const char* name, std::ostream& os, Isolate* isolate,
   i::Disassemble(name, os, isolate, *this, current_pc);
 }
 
-#endif  // ENABLE_DISASSEMBLER
-
-void BytecodeArray::PrintJson(std::ostream& os) {
-  DisallowGarbageCollection no_gc;
-
-  Address base_address = GetFirstBytecodeAddress();
-  BytecodeArray handle_storage = *this;
-  Handle<BytecodeArray> handle(reinterpret_cast<Address*>(&handle_storage));
-  interpreter::BytecodeArrayIterator iterator(handle);
-  bool first_data = true;
-
-  os << "{\"data\": [";
-
-  while (!iterator.done()) {
-    if (!first_data) os << ", ";
-    Address current_address = base_address + iterator.current_offset();
-    first_data = false;
-
-    os << "{\"offset\":" << iterator.current_offset() << ", \"disassembly\":\"";
-    interpreter::BytecodeDecoder::Decode(
-        os, reinterpret_cast<byte*>(current_address), false);
-
-    if (interpreter::Bytecodes::IsJump(iterator.current_bytecode())) {
-      os << " (" << iterator.GetJumpTargetOffset() << ")";
-    }
-
-    if (interpreter::Bytecodes::IsSwitch(iterator.current_bytecode())) {
-      os << " {";
-      bool first_entry = true;
-      for (interpreter::JumpTableTargetOffset entry :
-           iterator.GetJumpTableTargetOffsets()) {
-        if (!first_entry) os << ", ";
-        first_entry = false;
-        os << entry.target_offset;
-      }
-      os << "}";
-    }
-
-    os << "\"}";
-    iterator.Advance();
-  }
-
-  os << "]";
-
-  int constant_pool_lenght = constant_pool().length();
-  if (constant_pool_lenght > 0) {
-    os << ", \"constantPool\": [";
-    for (int i = 0; i < constant_pool_lenght; i++) {
-      Object object = constant_pool().get(i);
-      if (i > 0) os << ", ";
-      os << "\"" << object << "\"";
-    }
-    os << "]";
-  }
-
-  os << "}";
-}
-
-void BytecodeArray::Disassemble(std::ostream& os) {
-  DisallowGarbageCollection no_gc;
-  // Storage for backing the handle passed to the iterator. This handle won't be
-  // updated by the gc, but that's ok because we've disallowed GCs anyway.
-  BytecodeArray handle_storage = *this;
-  Handle<BytecodeArray> handle(reinterpret_cast<Address*>(&handle_storage));
-  Disassemble(handle, os);
-}
-
-// static
-void BytecodeArray::Disassemble(Handle<BytecodeArray> handle,
-                                std::ostream& os) {
-  DisallowGarbageCollection no_gc;
-
-  os << "Parameter count " << handle->parameter_count() << "\n";
-  os << "Register count " << handle->register_count() << "\n";
-  os << "Frame size " << handle->frame_size() << "\n";
-  os << "Bytecode age: " << handle->bytecode_age() << "\n";
-
-  Address base_address = handle->GetFirstBytecodeAddress();
-  SourcePositionTableIterator source_positions(handle->SourcePositionTable());
-
-  interpreter::BytecodeArrayIterator iterator(handle);
-  while (!iterator.done()) {
-    if (!source_positions.done() &&
-        iterator.current_offset() == source_positions.code_offset()) {
-      os << std::setw(5) << source_positions.source_position().ScriptOffset();
-      os << (source_positions.is_statement() ? " S> " : " E> ");
-      source_positions.Advance();
-    } else {
-      os << "         ";
-    }
-    Address current_address = base_address + iterator.current_offset();
-    os << reinterpret_cast<const void*>(current_address) << " @ "
-       << std::setw(4) << iterator.current_offset() << " : ";
-    interpreter::BytecodeDecoder::Decode(
-        os, reinterpret_cast<byte*>(current_address));
-    if (interpreter::Bytecodes::IsJump(iterator.current_bytecode())) {
-      Address jump_target = base_address + iterator.GetJumpTargetOffset();
-      os << " (" << reinterpret_cast<void*>(jump_target) << " @ "
-         << iterator.GetJumpTargetOffset() << ")";
-    }
-    if (interpreter::Bytecodes::IsSwitch(iterator.current_bytecode())) {
-      os << " {";
-      bool first_entry = true;
-      for (interpreter::JumpTableTargetOffset entry :
-           iterator.GetJumpTableTargetOffsets()) {
-        if (first_entry) {
-          first_entry = false;
-        } else {
-          os << ",";
-        }
-        os << " " << entry.case_value << ": @" << entry.target_offset;
-      }
-      os << " }";
-    }
-    os << std::endl;
-    iterator.Advance();
-  }
-
-  os << "Constant pool (size = " << handle->constant_pool().length() << ")\n";
-#ifdef OBJECT_PRINT
-  if (handle->constant_pool().length() > 0) {
-    handle->constant_pool().Print(os);
-  }
-#endif
-
-  os << "Handler Table (size = " << handle->handler_table().length() << ")\n";
-#ifdef ENABLE_DISASSEMBLER
-  if (handle->handler_table().length() > 0) {
-    HandlerTable table(*handle);
-    table.HandlerTableRangePrint(os);
-  }
-#endif
-
-  ByteArray source_position_table = handle->SourcePositionTable();
-  os << "Source Position Table (size = " << source_position_table.length()
-     << ")\n";
-#ifdef OBJECT_PRINT
-  if (source_position_table.length() > 0) {
-    os << Brief(source_position_table) << std::endl;
-  }
-#endif
-}
-
-void BytecodeArray::CopyBytecodesTo(BytecodeArray to) {
-  BytecodeArray from = *this;
-  DCHECK_EQ(from.length(), to.length());
-  CopyBytes(reinterpret_cast<byte*>(to.GetFirstBytecodeAddress()),
-            reinterpret_cast<byte*>(from.GetFirstBytecodeAddress()),
-            from.length());
-}
-
-void BytecodeArray::MakeOlder() {
-  // BytecodeArray is aged in concurrent marker.
-  // The word must be completely within the byte code array.
-  Address age_addr = address() + kBytecodeAgeOffset;
-  DCHECK_LE(RoundDown(age_addr, kTaggedSize) + kTaggedSize, address() + Size());
-  uint16_t age = bytecode_age();
-  if (age < v8_flags.bytecode_old_age) {
-    static_assert(kBytecodeAgeSize == kUInt16Size);
-    base::AsAtomic16::Relaxed_CompareAndSwap(
-        reinterpret_cast<base::Atomic16*>(age_addr), age, age + 1);
-  }
-
-  DCHECK_LE(bytecode_age(), v8_flags.bytecode_old_age);
-}
-
-bool BytecodeArray::IsOld() const {
-  return bytecode_age() >= v8_flags.bytecode_old_age;
+void Code::DisassembleOnlyCode(const char* name, std::ostream& os,
+                               Isolate* isolate, Address current_pc,
+                               size_t range_limit) {
+  i::DisassembleOnlyCode(name, os, isolate, *this, current_pc, range_limit);
 }
 
-DependentCode DependentCode::GetDependentCode(HeapObject object) {
-  if (object.IsMap()) {
-    return Map::cast(object).dependent_code();
-  } else if (object.IsPropertyCell()) {
-    return PropertyCell::cast(object).dependent_code();
-  } else if (object.IsAllocationSite()) {
-    return AllocationSite::cast(object).dependent_code();
-  }
-  UNREACHABLE();
-}
-
-void DependentCode::SetDependentCode(Handle<HeapObject> object,
-                                     Handle<DependentCode> dep) {
-  if (object->IsMap()) {
-    Handle<Map>::cast(object)->set_dependent_code(*dep);
-  } else if (object->IsPropertyCell()) {
-    Handle<PropertyCell>::cast(object)->set_dependent_code(*dep);
-  } else if (object->IsAllocationSite()) {
-    Handle<AllocationSite>::cast(object)->set_dependent_code(*dep);
-  } else {
-    UNREACHABLE();
-  }
-}
-
-namespace {
-
-void PrintDependencyGroups(DependentCode::DependencyGroups groups) {
-  while (groups != 0) {
-    auto group = static_cast<DependentCode::DependencyGroup>(
-        1 << base::bits::CountTrailingZeros(static_cast<uint32_t>(groups)));
-    StdoutStream{} << DependentCode::DependencyGroupName(group);
-    groups &= ~group;
-    if (groups != 0) StdoutStream{} << ",";
-  }
-}
-
-}  // namespace
-
-void DependentCode::InstallDependency(Isolate* isolate, Handle<Code> code,
-                                      Handle<HeapObject> object,
-                                      DependencyGroups groups) {
-  if (V8_UNLIKELY(v8_flags.trace_compilation_dependencies)) {
-    StdoutStream{} << "Installing dependency of [" << code << "] on [" << object
-                   << "] in groups [";
-    PrintDependencyGroups(groups);
-    StdoutStream{} << "]\n";
-  }
-  Handle<DependentCode> old_deps(DependentCode::GetDependentCode(*object),
-                                 isolate);
-  Handle<DependentCode> new_deps =
-      InsertWeakCode(isolate, old_deps, groups, code);
-
-  // Update the list head if necessary.
-  if (!new_deps.is_identical_to(old_deps)) {
-    DependentCode::SetDependentCode(object, new_deps);
-  }
-}
-
-Handle<DependentCode> DependentCode::InsertWeakCode(
-    Isolate* isolate, Handle<DependentCode> entries, DependencyGroups groups,
-    Handle<Code> code) {
-  if (entries->length() == entries->capacity()) {
-    // We'd have to grow - try to compact first.
-    entries->IterateAndCompact([](Code, DependencyGroups) { return false; });
-  }
-
-  MaybeObjectHandle code_slot(HeapObjectReference::Weak(*code), isolate);
-  MaybeObjectHandle group_slot(MaybeObject::FromSmi(Smi::FromInt(groups)),
-                               isolate);
-  entries = Handle<DependentCode>::cast(
-      WeakArrayList::AddToEnd(isolate, entries, code_slot, group_slot));
-  return entries;
-}
-
-void DependentCode::IterateAndCompact(const IterateAndCompactFn& fn) {
-  DisallowGarbageCollection no_gc;
-
-  int len = length();
-  if (len == 0) return;
-
-  // We compact during traversal, thus use a somewhat custom loop construct:
-  //
-  // - Loop back-to-front s.t. trailing cleared entries can simply drop off
-  //   the back of the list.
-  // - Any cleared slots are filled from the back of the list.
-  int i = len - kSlotsPerEntry;
-  while (i >= 0) {
-    MaybeObject obj = Get(i + kCodeSlotOffset);
-    if (obj->IsCleared()) {
-      len = FillEntryFromBack(i, len);
-      i -= kSlotsPerEntry;
-      continue;
-    }
-
-    if (fn(Code::cast(obj->GetHeapObjectAssumeWeak()),
-           static_cast<DependencyGroups>(
-               Get(i + kGroupsSlotOffset).ToSmi().value()))) {
-      len = FillEntryFromBack(i, len);
-    }
-
-    i -= kSlotsPerEntry;
-  }
-
-  set_length(len);
-}
-
-bool DependentCode::MarkCodeForDeoptimization(
-    Isolate* isolate, DependentCode::DependencyGroups deopt_groups) {
-  DisallowGarbageCollection no_gc;
-
-  bool marked_something = false;
-  IterateAndCompact([&](Code code, DependencyGroups groups) {
-    if ((groups & deopt_groups) == 0) return false;
-
-    if (!code.marked_for_deoptimization()) {
-      code.SetMarkedForDeoptimization(isolate, "code dependencies");
-      marked_something = true;
-    }
-
-    return true;
-  });
-
-  return marked_something;
-}
-
-int DependentCode::FillEntryFromBack(int index, int length) {
-  DCHECK_EQ(index % 2, 0);
-  DCHECK_EQ(length % 2, 0);
-  for (int i = length - kSlotsPerEntry; i > index; i -= kSlotsPerEntry) {
-    MaybeObject obj = Get(i + kCodeSlotOffset);
-    if (obj->IsCleared()) continue;
-
-    Set(index + kCodeSlotOffset, obj);
-    Set(index + kGroupsSlotOffset, Get(i + kGroupsSlotOffset),
-        SKIP_WRITE_BARRIER);
-    return i;
-  }
-  return index;  // No non-cleared entry found.
-}
-
-void DependentCode::DeoptimizeDependencyGroups(
-    Isolate* isolate, DependentCode::DependencyGroups groups) {
-  DisallowGarbageCollection no_gc_scope;
-  bool marked_something = MarkCodeForDeoptimization(isolate, groups);
-  if (marked_something) {
-    DCHECK(AllowCodeDependencyChange::IsAllowed());
-    Deoptimizer::DeoptimizeMarkedCode(isolate);
-  }
-}
-
-// static
-DependentCode DependentCode::empty_dependent_code(const ReadOnlyRoots& roots) {
-  return DependentCode::cast(roots.empty_weak_array_list());
-}
+#endif  // ENABLE_DISASSEMBLER
 
 void Code::SetMarkedForDeoptimization(Isolate* isolate, const char* reason) {
   set_marked_for_deoptimization(true);
   Deoptimizer::TraceMarkForDeoptimization(isolate, *this, reason);
 }
 
-const char* DependentCode::DependencyGroupName(DependencyGroup group) {
-  switch (group) {
-    case kTransitionGroup:
-      return "transition";
-    case kPrototypeCheckGroup:
-      return "prototype-check";
-    case kPropertyCellChangedGroup:
-      return "property-cell-changed";
-    case kFieldConstGroup:
-      return "field-const";
-    case kFieldTypeGroup:
-      return "field-type";
-    case kFieldRepresentationGroup:
-      return "field-representation";
-    case kInitialMapChangedGroup:
-      return "initial-map-changed";
-    case kAllocationSiteTenuringChangedGroup:
-      return "allocation-site-tenuring-changed";
-    case kAllocationSiteTransitionChangedGroup:
-      return "allocation-site-transition-changed";
-  }
-  UNREACHABLE();
-}
-
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/code.h b/deps/v8/src/objects/code.h
index e4cba409486d8c..89e591ae39d245 100644
--- a/deps/v8/src/objects/code.h
+++ b/deps/v8/src/objects/code.h
@@ -5,18 +5,9 @@
 #ifndef V8_OBJECTS_CODE_H_
 #define V8_OBJECTS_CODE_H_
 
-#include "src/base/bit-field.h"
-#include "src/builtins/builtins.h"
-#include "src/codegen/handler-table.h"
 #include "src/codegen/maglev-safepoint-table.h"
-#include "src/deoptimizer/translation-array.h"
 #include "src/objects/code-kind.h"
-#include "src/objects/contexts.h"
-#include "src/objects/fixed-array.h"
 #include "src/objects/heap-object.h"
-#include "src/objects/objects.h"
-#include "src/objects/shared-function-info.h"
-#include "src/objects/struct.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -24,22 +15,14 @@
 namespace v8 {
 namespace internal {
 
-class ByteArray;
 class BytecodeArray;
-class Code;
 class CodeDesc;
-class ObjectIterator;
-class SafepointScope;
-
-class LocalFactory;
+class Factory;
 template <typename Impl>
 class FactoryBase;
+class LocalFactory;
 
-namespace interpreter {
-class Register;
-}  // namespace interpreter
-
-#include "torque-generated/src/objects/code-tq.inc"
+enum class Builtin;
 
 // Code is a container for data fields related to its associated
 // {InstructionStream} object. Since {InstructionStream} objects reside on
@@ -68,10 +51,6 @@ class Register;
 //  |                          |  <-- MS + unwinding_info_offset()
 //  +--------------------------+  <-- MetadataEnd()
 //
-// TODO(jgruber): Code currently contains many aliases for InstructionStream
-// functions. These will eventually move to the Code object. Once done, put all
-// these declarations in a decent order and move over comments from the current
-// declarations in InstructionStream.
 class Code : public HeapObject {
  public:
   // When V8_EXTERNAL_CODE_SPACE is enabled, InstructionStream objects are
@@ -85,52 +64,41 @@ class Code : public HeapObject {
   // object is InReadOnlySpace. That may only be the case for Code objects
   // representing builtins, or in other words, Code objects for which
   // has_instruction_stream() is never true.
-  DECL_GETTER(instruction_stream, InstructionStream)
-  DECL_RELAXED_GETTER(instruction_stream, InstructionStream)
-  DECL_ACCESSORS(raw_instruction_stream, Object)
-  DECL_RELAXED_GETTER(raw_instruction_stream, Object)
+  DECL_GETTER(instruction_stream, Tagged<InstructionStream>)
+  DECL_RELAXED_GETTER(instruction_stream, Tagged<InstructionStream>)
+  DECL_ACCESSORS(raw_instruction_stream, Tagged<Object>)
+  DECL_RELAXED_GETTER(raw_instruction_stream, Tagged<Object>)
+  // An unchecked accessor to be used during GC.
+  inline Tagged<InstructionStream> unchecked_instruction_stream() const;
 
   // Whether this Code object has an associated InstructionStream (embedded
   // builtins don't).
-  //
-  // Note there's a short amount of time during CodeBuilder::BuildInternal in
-  // which the Code object has been allocated and initialized, but the
-  // InstructionStream doesn't exist yet - in this situation,
-  // has_instruction_stream is `false` but will change to `true` once
-  // InstructionStream has also been initialized.
   inline bool has_instruction_stream() const;
   inline bool has_instruction_stream(RelaxedLoadTag) const;
 
-  // Cached value of instruction_stream().InstructionStart().
-  DECL_GETTER(code_entry_point, Address)
-
-  // Aliases for code_entry_point for API compatibility with InstructionStream.
-  inline Address InstructionStart() const;
+  // The start of the associated instruction stream. Points either into an
+  // on-heap InstructionStream object, or to the beginning of an embedded
+  // builtin.
+  DECL_GETTER(instruction_start, Address)
+  DECL_PRIMITIVE_ACCESSORS(instruction_size, int)
+  inline Address instruction_end() const;
 
-  inline void SetInstructionStreamAndEntryPoint(
-      Isolate* isolate_for_sandbox, InstructionStream code,
+  inline void init_instruction_start(Isolate* isolate, Address initial_value);
+  inline void SetInstructionStreamAndInstructionStart(
+      Isolate* isolate_for_sandbox, Tagged<InstructionStream> code,
       WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void SetEntryPointForOffHeapBuiltin(Isolate* isolate_for_sandbox,
-                                             Address entry);
-  inline void SetCodeEntryPointForSerialization(Isolate* isolate,
-                                                Address entry);
-  // Updates the value of the code entry point. The code must be equal to
-  // the code() value.
-  inline void UpdateCodeEntryPoint(Isolate* isolate_for_sandbox,
-                                   InstructionStream code);
-
-  DECL_RELAXED_UINT16_ACCESSORS(kind_specific_flags)
-
-  // Initializes internal flags field which stores cached values of some
-  // properties of the respective InstructionStream object.
-  inline void initialize_flags(CodeKind kind, Builtin builtin_id,
-                               bool is_turbofanned, int stack_slots);
+  inline void SetInstructionStartForOffHeapBuiltin(Isolate* isolate_for_sandbox,
+                                                   Address entry);
+  inline void ClearInstructionStartForSerialization(Isolate* isolate);
+  inline void UpdateInstructionStart(Isolate* isolate_for_sandbox,
+                                     Tagged<InstructionStream> istream);
+
+  inline void initialize_flags(CodeKind kind, bool is_turbofanned,
+                               int stack_slots);
 
   // Clear uninitialized padding space. This ensures that the snapshot content
   // is deterministic.
   inline void clear_padding();
-  // Clear the padding in the InstructionStream
-  inline void ClearInstructionStreamPadding();
 
   // Flushes the instruction cache for the executable instructions of this code
   // object. Make sure to call this while the code is still writable.
@@ -139,15 +107,6 @@ class Code : public HeapObject {
   DECL_PRIMITIVE_ACCESSORS(can_have_weak_objects, bool)
   DECL_PRIMITIVE_ACCESSORS(marked_for_deoptimization, bool)
 
-  // [is_promise_rejection]: For kind BUILTIN tells whether the
-  // exception thrown by the code will lead to promise rejection or
-  // uncaught if both this and is_exception_caught is set.
-  // Use GetBuiltinCatchPrediction to access this.
-  DECL_PRIMITIVE_ACCESSORS(is_promise_rejection, bool)
-
-  inline HandlerTable::CatchPrediction GetBuiltinCatchPrediction() const;
-
-  DECL_PRIMITIVE_ACCESSORS(instruction_size, int)
   DECL_PRIMITIVE_ACCESSORS(metadata_size, int)
   // [handler_table_offset]: The offset where the exception handler table
   // starts.
@@ -156,18 +115,16 @@ class Code : public HeapObject {
   DECL_PRIMITIVE_ACCESSORS(unwinding_info_offset, int32_t)
   // [deoptimization_data]: Array containing data for deopt for non-baseline
   // code.
-  DECL_ACCESSORS(deoptimization_data, FixedArray)
+  DECL_ACCESSORS(deoptimization_data, Tagged<FixedArray>)
   // [bytecode_or_interpreter_data]: BytecodeArray or InterpreterData for
   // baseline code.
-  DECL_ACCESSORS(bytecode_or_interpreter_data, HeapObject)
+  DECL_ACCESSORS(bytecode_or_interpreter_data, Tagged<HeapObject>)
   // [source_position_table]: ByteArray for the source positions table for
   // non-baseline code.
-  DECL_ACCESSORS(source_position_table, ByteArray)
+  DECL_ACCESSORS(source_position_table, Tagged<ByteArray>)
   // [bytecode_offset_table]: ByteArray for the bytecode offset for baseline
   // code.
-  DECL_ACCESSORS(bytecode_offset_table, ByteArray)
-  // [relocation_info]: InstructionStream relocation information
-  DECL_ACCESSORS(relocation_info, ByteArray)
+  DECL_ACCESSORS(bytecode_offset_table, Tagged<ByteArray>)
   DECL_PRIMITIVE_ACCESSORS(inlined_bytecode_size, unsigned)
   DECL_PRIMITIVE_ACCESSORS(osr_offset, BytecodeOffset)
   // [code_comments_offset]: Offset of the code comment section.
@@ -176,10 +133,13 @@ class Code : public HeapObject {
   DECL_PRIMITIVE_ACCESSORS(constant_pool_offset, int)
 
   // Unchecked accessors to be used during GC.
-  inline ByteArray unchecked_relocation_info() const;
-  inline FixedArray unchecked_deoptimization_data() const;
+  inline Tagged<FixedArray> unchecked_deoptimization_data() const;
+
+  DECL_RELAXED_UINT32_ACCESSORS(flags)
 
   inline CodeKind kind() const;
+
+  inline void set_builtin_id(Builtin builtin_id);
   inline Builtin builtin_id() const;
   inline bool is_builtin() const;
 
@@ -214,21 +174,22 @@ class Code : public HeapObject {
   // reserved in the code prologue; otherwise 0.
   inline int stack_slots() const;
 
-  inline ByteArray SourcePositionTable(Isolate* isolate,
-                                       SharedFunctionInfo sfi) const;
-
-  // Returns true if pc is inside this object's instructions.
-  inline bool contains(Isolate* isolate, Address pc);
+  inline Tagged<ByteArray> SourcePositionTable(
+      Isolate* isolate, Tagged<SharedFunctionInfo> sfi) const;
 
-  inline Address SafepointTableAddress() const;
+  inline Address safepoint_table_address() const;
   inline int safepoint_table_size() const;
   inline bool has_safepoint_table() const;
 
-  inline Address HandlerTableAddress() const;
+  inline Address handler_table_address() const;
   inline int handler_table_size() const;
   inline bool has_handler_table() const;
 
   inline Address constant_pool() const;
+  // An accessor to be used during GC if the instruction_stream moved and the
+  // field was not updated yet.
+  inline Address constant_pool(
+      Tagged<InstructionStream> instruction_stream) const;
   inline int constant_pool_size() const;
   inline bool has_constant_pool() const;
 
@@ -241,11 +202,10 @@ class Code : public HeapObject {
   inline int unwinding_info_size() const;
   inline bool has_unwinding_info() const;
 
-  inline byte* relocation_start() const;
-  inline byte* relocation_end() const;
+  inline uint8_t* relocation_start() const;
+  inline uint8_t* relocation_end() const;
   inline int relocation_size() const;
 
-  // [safepoint_table_offset]: The offset where the safepoint table starts.
   inline int safepoint_table_offset() const { return 0; }
 
   inline Address body_start() const;
@@ -255,13 +215,16 @@ class Code : public HeapObject {
   inline Address metadata_start() const;
   inline Address metadata_end() const;
 
-  inline Address handler_table_address() const;
+  // The size of the associated InstructionStream object, if it exists.
+  inline int InstructionStreamObjectSize() const;
 
-  inline Address safepoint_table_address() const;
-
-  inline int CodeSize() const;
+  // TODO(jgruber): This function tries to account for various parts of the
+  // object graph, but is incomplete. Take it as a lower bound for the memory
+  // associated with this Code object.
   inline int SizeIncludingMetadata() const;
 
+  // The following functions include support for short builtin calls:
+  //
   // When builtins un-embedding is enabled for the Isolate
   // (see Isolate::is_short_builtin_calls_enabled()) then both embedded and
   // un-embedded builtins might be exeuted and thus two kinds of |pc|s might
@@ -274,33 +237,21 @@ class Code : public HeapObject {
   // instruction_start/end() values.
   // TODO(11527): remove these versions once the full solution is ready.
   inline Address InstructionStart(Isolate* isolate, Address pc) const;
-  V8_EXPORT_PRIVATE Address OffHeapInstructionStart() const;
-  V8_EXPORT_PRIVATE Address OffHeapInstructionStart(Isolate* isolate,
-                                                    Address pc) const;
   inline Address InstructionEnd(Isolate* isolate, Address pc) const;
-  V8_EXPORT_PRIVATE Address OffHeapInstructionEnd(Isolate* isolate,
-                                                  Address pc) const;
-
-  V8_EXPORT_PRIVATE bool OffHeapBuiltinContains(Isolate* isolate,
-                                                Address pc) const;
-
-  inline Address InstructionEnd() const;
-  inline int InstructionSize() const;
+  inline bool contains(Isolate* isolate, Address pc) const;
+  inline int GetOffsetFromInstructionStart(Isolate* isolate, Address pc) const;
+  // Support for short builtin calls END.
 
   SafepointEntry GetSafepointEntry(Isolate* isolate, Address pc);
   MaglevSafepointEntry GetMaglevSafepointEntry(Isolate* isolate, Address pc);
 
-  inline int GetOffsetFromInstructionStart(Isolate* isolate, Address pc) const;
-
   void SetMarkedForDeoptimization(Isolate* isolate, const char* reason);
 
   inline bool CanContainWeakObjects();
-
-  inline bool IsWeakObject(HeapObject object);
-
-  static inline bool IsWeakObjectInOptimizedCode(HeapObject object);
-
-  static inline bool IsWeakObjectInDeoptimizationLiteralArray(Object object);
+  inline bool IsWeakObject(Tagged<HeapObject> object);
+  static inline bool IsWeakObjectInOptimizedCode(Tagged<HeapObject> object);
+  static inline bool IsWeakObjectInDeoptimizationLiteralArray(
+      Tagged<Object> object);
 
   // This function should be called only from GC.
   void ClearEmbeddedObjects(Heap* heap);
@@ -312,25 +263,16 @@ class Code : public HeapObject {
   inline bool embedded_objects_cleared() const;
   inline void set_embedded_objects_cleared(bool flag);
 
-  // Migrate code from desc without flushing the instruction cache.
-  void CopyFromNoFlush(ByteArray reloc_info, Heap* heap, const CodeDesc& desc);
-  void RelocateFromDesc(ByteArray reloc_info, Heap* heap, const CodeDesc& desc);
-
-  // Copy the RelocInfo portion of |desc| to |dest|. The ByteArray must be
-  // exactly the same size as the RelocInfo in |desc|.
-  static inline void CopyRelocInfoToByteArray(ByteArray dest,
-                                              const CodeDesc& desc);
-
   bool IsIsolateIndependent(Isolate* isolate);
 
-  inline uintptr_t GetBaselineStartPCForBytecodeOffset(int bytecode_offset,
-                                                       BytecodeArray bytecodes);
+  inline uintptr_t GetBaselineStartPCForBytecodeOffset(
+      int bytecode_offset, Tagged<BytecodeArray> bytecodes);
 
-  inline uintptr_t GetBaselineEndPCForBytecodeOffset(int bytecode_offset,
-                                                     BytecodeArray bytecodes);
+  inline uintptr_t GetBaselineEndPCForBytecodeOffset(
+      int bytecode_offset, Tagged<BytecodeArray> bytecodes);
 
   // Returns true if the function is inlined in the code.
-  bool Inlines(SharedFunctionInfo sfi);
+  bool Inlines(Tagged<SharedFunctionInfo> sfi);
 
   // Returns the PC of the next bytecode in execution order.
   // If the bytecode at the given offset is JumpLoop, the PC of the jump target
@@ -338,55 +280,66 @@ class Code : public HeapObject {
   // For other bytecodes this is equivalent to
   // GetBaselineEndPCForBytecodeOffset.
   inline uintptr_t GetBaselinePCForNextExecutedBytecode(
-      int bytecode_offset, BytecodeArray bytecodes);
+      int bytecode_offset, Tagged<BytecodeArray> bytecodes);
 
   inline int GetBytecodeOffsetForBaselinePC(Address baseline_pc,
-                                            BytecodeArray bytecodes);
+                                            Tagged<BytecodeArray> bytecodes);
 
   inline void IterateDeoptimizationLiterals(RootVisitor* v);
 
-  static inline Code FromTargetAddress(Address address);
+  static inline Tagged<Code> FromTargetAddress(Address address);
 
 #ifdef ENABLE_DISASSEMBLER
   V8_EXPORT_PRIVATE void Disassemble(const char* name, std::ostream& os,
                                      Isolate* isolate,
                                      Address current_pc = kNullAddress);
+  V8_EXPORT_PRIVATE void DisassembleOnlyCode(const char* name, std::ostream& os,
+                                             Isolate* isolate,
+                                             Address current_pc,
+                                             size_t range_limit);
 #endif  // ENABLE_DISASSEMBLER
 
-  DECL_CAST(Code)
+#ifdef OBJECT_PRINT
+  void CodePrint(std::ostream& os, const char* name = nullptr,
+                 Address current_pc = kNullAddress);
+#endif
 
-  // Dispatched behavior.
-  DECL_PRINTER(Code)
+  DECL_CAST(Code)
   DECL_VERIFIER(Code)
 
 // Layout description.
 #define CODE_DATA_FIELDS(V)                                                   \
   /* Strong pointer fields. */                                                \
-  V(kRelocationInfoOffset, kTaggedSize)                                       \
+  V(kStartOfStrongFieldsOffset, 0)                                            \
   V(kDeoptimizationDataOrInterpreterDataOffset, kTaggedSize)                  \
   V(kPositionTableOffset, kTaggedSize)                                        \
-  V(kPointerFieldsStrongEndOffset, 0)                                         \
-  /* Strong InstructionStream pointer fields. */                              \
+  V(kEndOfStrongFieldsWithMainCageBaseOffset, 0)                              \
+  /* The InstructionStream field is special: it uses code_cage_base. */       \
   V(kInstructionStreamOffset, kTaggedSize)                                    \
-  V(kCodePointerFieldsStrongEndOffset, 0)                                     \
-  /* Raw data fields. */                                                      \
-  /* Data or code not directly visited by GC directly starts here. */         \
-  V(kDataStart, 0)                                                            \
-  V(kCodeEntryPointOffset, kSystemPointerSize)                                \
+  V(kEndOfStrongFieldsOffset, 0)                                              \
+  /* Untagged data not directly visited by GC starts here. */                 \
+  /* When the sandbox is off, the instruction_start field contains a raw */   \
+  /* pointer to the first instruction of this Code. */                        \
+  /* If the sandbox is on, this field instead contains the handle for the */  \
+  /* code pointer table entry of this Code object. The instruction start */   \
+  /* value is then stored in that entry. */                                   \
+  V(kInstructionStartOffset,                                                  \
+    V8_CODE_POINTER_SANDBOXING_BOOL ? 0 : kSystemPointerSize)                 \
+  V(kCodePointerTableEntryOffset,                                             \
+    V8_CODE_POINTER_SANDBOXING_BOOL ? kIndirectPointerSlotSize : 0)           \
   /* The serializer needs to copy bytes starting from here verbatim. */       \
-  /* Objects embedded into code is visited via reloc info. */                 \
-  V(kFlagsOffset, kInt32Size)                                                 \
-  V(kBuiltinIdOffset, kInt16Size)                                             \
-  V(kKindSpecificFlagsOffset, kInt16Size)                                     \
+  V(kFlagsOffset, kUInt32Size)                                                \
   V(kInstructionSizeOffset, kIntSize)                                         \
   V(kMetadataSizeOffset, kIntSize)                                            \
+  /* TODO(jgruber): TF-specific fields could be merged with builtin_id. */    \
   V(kInlinedBytecodeSizeOffset, kIntSize)                                     \
   V(kOsrOffsetOffset, kInt32Size)                                             \
-  /* Offsets describing inline metadata tables, relative to MetadataStart. */ \
   V(kHandlerTableOffsetOffset, kIntSize)                                      \
   V(kUnwindingInfoOffsetOffset, kInt32Size)                                   \
   V(kConstantPoolOffsetOffset, V8_EMBEDDED_CONSTANT_POOL_BOOL ? kIntSize : 0) \
   V(kCodeCommentsOffsetOffset, kIntSize)                                      \
+  /* TODO(jgruber): 12 bits would suffice, steal from here if needed. */      \
+  V(kBuiltinIdOffset, kInt16Size)                                             \
   V(kUnalignedSize, OBJECT_POINTER_PADDING(kUnalignedSize))                   \
   /* Total size. */                                                           \
   V(kSize, 0)
@@ -406,63 +359,37 @@ class Code : public HeapObject {
   class BodyDescriptor;
 
   // Flags layout.
-#define FLAGS_BIT_FIELDS(V, _)      \
-  V(KindField, CodeKind, 4, _)      \
-  V(IsTurbofannedField, bool, 1, _) \
-  V(StackSlotsField, int, 24, _)
-  /* The other 3 bits are still free. */
-  // TODO(v8:13784): merge this with KindSpecificFlags by dropping the
-  // IsPromiseRejection field or taking one bit from the StackSlots field.
-
+#define FLAGS_BIT_FIELDS(V, _)                \
+  V(KindField, CodeKind, 4, _)                \
+  V(IsTurbofannedField, bool, 1, _)           \
+  /* Steal bits from here if needed: */       \
+  V(StackSlotsField, int, 24, _)              \
+  V(MarkedForDeoptimizationField, bool, 1, _) \
+  V(EmbeddedObjectsClearedField, bool, 1, _)  \
+  V(CanHaveWeakObjectsField, bool, 1, _)
   DEFINE_BIT_FIELDS(FLAGS_BIT_FIELDS)
 #undef FLAGS_BIT_FIELDS
-  static_assert(kCodeKindCount <= KindField::kNumValues);
-  static_assert(FLAGS_BIT_FIELDS_Ranges::kBitsCount == 29);
+  static_assert(FLAGS_BIT_FIELDS_Ranges::kBitsCount == 32);
   static_assert(FLAGS_BIT_FIELDS_Ranges::kBitsCount <=
                 FIELD_SIZE(kFlagsOffset) * kBitsPerByte);
-
-  // KindSpecificFlags layout.
-#define KIND_SPECIFIC_FLAGS_BIT_FIELDS(V, _)  \
-  V(MarkedForDeoptimizationField, bool, 1, _) \
-  V(EmbeddedObjectsClearedField, bool, 1, _)  \
-  V(CanHaveWeakObjectsField, bool, 1, _)      \
-  V(IsPromiseRejectionField, bool, 1, _)
-  DEFINE_BIT_FIELDS(KIND_SPECIFIC_FLAGS_BIT_FIELDS)
-#undef CODE_KIND_SPECIFIC_FLAGS_BIT_FIELDS
-  static_assert(KIND_SPECIFIC_FLAGS_BIT_FIELDS_Ranges::kBitsCount == 4);
-  static_assert(KIND_SPECIFIC_FLAGS_BIT_FIELDS_Ranges::kBitsCount <=
-                FIELD_SIZE(Code::kKindSpecificFlagsOffset) * kBitsPerByte);
+  static_assert(kCodeKindCount <= KindField::kNumValues);
 
   // The {marked_for_deoptimization} field is accessed from generated code.
   static const int kMarkedForDeoptimizationBit =
       MarkedForDeoptimizationField::kShift;
+  static const int kIsTurbofannedBit = IsTurbofannedField::kShift;
 
-  class OptimizedCodeIterator;
+  // Reserve one argument count value as the "don't adapt arguments" sentinel.
+  static const int kArgumentsBits = 16;
+  static const int kMaxArguments = (1 << kArgumentsBits) - 2;
 
  private:
-  inline void init_code_entry_point(Isolate* isolate, Address initial_value);
-  inline void set_code_entry_point(Isolate* isolate, Address value);
-
-  // Contains cached values of some flags of the from the respective
-  // InstructionStream object.
-  DECL_RELAXED_UINT16_ACCESSORS(flags)
-
-  V8_EXPORT_PRIVATE Address OffHeapInstructionEnd() const;
-  V8_EXPORT_PRIVATE int OffHeapInstructionSize() const;
-  V8_EXPORT_PRIVATE Address OffHeapMetadataStart() const;
-  V8_EXPORT_PRIVATE Address OffHeapMetadataEnd() const;
-  V8_EXPORT_PRIVATE int OffHeapMetadataSize() const;
-  V8_EXPORT_PRIVATE Address OffHeapSafepointTableAddress() const;
-  V8_EXPORT_PRIVATE int OffHeapSafepointTableSize() const;
-  V8_EXPORT_PRIVATE Address OffHeapHandlerTableAddress() const;
-  V8_EXPORT_PRIVATE int OffHeapHandlerTableSize() const;
-  V8_EXPORT_PRIVATE Address OffHeapConstantPoolAddress() const;
-  V8_EXPORT_PRIVATE int OffHeapConstantPoolSize() const;
-  V8_EXPORT_PRIVATE Address OffHeapCodeCommentsAddress() const;
-  V8_EXPORT_PRIVATE int OffHeapCodeCommentsSize() const;
-  V8_EXPORT_PRIVATE Address OffHeapUnwindingInfoAddress() const;
-  V8_EXPORT_PRIVATE int OffHeapUnwindingInfoSize() const;
-  V8_EXPORT_PRIVATE int OffHeapStackSlots() const;
+  inline void set_instruction_start(Isolate* isolate, Address value);
+
+  // TODO(jgruber): These field names are incomplete, we've squashed in more
+  // overloaded contents in the meantime. Update the field names.
+  Tagged<HeapObject> raw_deoptimization_data_or_interpreter_data() const;
+  Tagged<ByteArray> raw_position_table() const;
 
   enum BytecodeToPCPosition {
     kPcAtStartOfBytecode,
@@ -471,18 +398,15 @@ class Code : public HeapObject {
     // of non-topmost frame).
     kPcAtEndOfBytecode
   };
-  inline uintptr_t GetBaselinePCForBytecodeOffset(int bytecode_offset,
-                                                  BytecodeToPCPosition position,
-                                                  BytecodeArray bytecodes);
+  inline uintptr_t GetBaselinePCForBytecodeOffset(
+      int bytecode_offset, BytecodeToPCPosition position,
+      Tagged<BytecodeArray> bytecodes);
 
   template <typename IsolateT>
   friend class Deserializer;
-  friend class ReadOnlyDeserializer;  // For init_code_entry_point.
-  friend class GcSafeCode;  // For OffHeapFoo functions.
   friend Factory;
   friend FactoryBase<Factory>;
   friend FactoryBase<LocalFactory>;
-  friend Isolate;
 
   OBJECT_CONSTRUCTORS(Code, HeapObject);
 };
@@ -511,11 +435,11 @@ class GcSafeCode : public HeapObject {
 
   // Use with care, this casts away knowledge that we're dealing with a
   // special-semantics object.
-  inline Code UnsafeCastToCode() const;
+  inline Tagged<Code> UnsafeCastToCode() const;
 
   // Safe accessors (these just forward to Code methods).
-  inline Address InstructionStart() const;
-  inline Address InstructionEnd() const;
+  inline Address instruction_start() const;
+  inline Address instruction_end() const;
   inline bool is_builtin() const;
   inline Builtin builtin_id() const;
   inline CodeKind kind() const;
@@ -527,557 +451,23 @@ class GcSafeCode : public HeapObject {
   inline bool is_turbofanned() const;
   inline bool has_tagged_outgoing_params() const;
   inline bool marked_for_deoptimization() const;
-  inline Object raw_instruction_stream() const;
+  inline Tagged<Object> raw_instruction_stream() const;
   inline Address constant_pool() const;
+  inline Address constant_pool(Tagged<InstructionStream> istream) const;
+  inline Address safepoint_table_address() const;
   inline int stack_slots() const;
 
   inline int GetOffsetFromInstructionStart(Isolate* isolate, Address pc) const;
   inline Address InstructionStart(Isolate* isolate, Address pc) const;
   inline Address InstructionEnd(Isolate* isolate, Address pc) const;
   inline bool CanDeoptAt(Isolate* isolate, Address pc) const;
-  inline Object raw_instruction_stream(PtrComprCageBase code_cage_base) const;
-
-  // Accessors that had to be modified to be used in GC settings.
-  inline Address SafepointTableAddress() const;
+  inline Tagged<Object> raw_instruction_stream(
+      PtrComprCageBase code_cage_base) const;
 
  private:
   OBJECT_CONSTRUCTORS(GcSafeCode, HeapObject);
 };
 
-// InstructionStream contains the instruction stream for V8-generated code
-// objects.
-//
-// When V8_EXTERNAL_CODE_SPACE is enabled, InstructionStream objects are
-// allocated in a separate pointer compression cage instead of the cage where
-// all the other objects are allocated.
-class InstructionStream : public HeapObject {
- public:
-  NEVER_READ_ONLY_SPACE
-
-  // All InstructionStream objects have the following layout:
-  //
-  //  +--------------------------+
-  //  |          header          |
-  //  | padded to code alignment |
-  //  +--------------------------+  <-- body_start()
-  //  |       instructions       |   == instruction_start()
-  //  |           ...            |
-  //  | padded to meta alignment |      see kMetadataAlignment
-  //  +--------------------------+  <-- instruction_end()
-  //  |         metadata         |   == metadata_start() (MS)
-  //  |           ...            |
-  //  |                          |  <-- MS + handler_table_offset()
-  //  |                          |  <-- MS + constant_pool_offset()
-  //  |                          |  <-- MS + code_comments_offset()
-  //  |                          |  <-- MS + unwinding_info_offset()
-  //  | padded to obj alignment  |
-  //  +--------------------------+  <-- metadata_end() == body_end()
-  //  | padded to code alignment |
-  //  +--------------------------+
-  //
-  // In other words, the variable-size 'body' consists of 'instructions' and
-  // 'metadata'.
-
-  // Constants for use in static asserts, stating whether the body is adjacent,
-  // i.e. instructions and metadata areas are adjacent.
-  static constexpr bool kOnHeapBodyIsContiguous = true;
-  static constexpr bool kOffHeapBodyIsContiguous = false;
-  static constexpr bool kBodyIsContiguous =
-      kOnHeapBodyIsContiguous && kOffHeapBodyIsContiguous;
-
-  inline Address instruction_start() const;
-
-  // The metadata section is aligned to this value.
-  static constexpr int kMetadataAlignment = kIntSize;
-
-  // [code]: The associated Code object.
-  DECL_RELEASE_ACQUIRE_ACCESSORS(code, Code)
-  DECL_RELEASE_ACQUIRE_ACCESSORS(raw_code, HeapObject)
-
-  // A convenience wrapper around raw_code that will do an unchecked cast for
-  // you.
-  inline Code unchecked_code() const;
-
-  // The entire code object including its header is copied verbatim to the
-  // snapshot so that it can be written in one, fast, memcpy during
-  // deserialization. The deserializer will overwrite some pointers, rather
-  // like a runtime linker, but the random allocation addresses used in the
-  // mksnapshot process would still be present in the unlinked snapshot data,
-  // which would make snapshot production non-reproducible. This method wipes
-  // out the to-be-overwritten header data for reproducible snapshots.
-  inline void WipeOutHeader();
-
-  // When V8_EXTERNAL_CODE_SPACE is enabled, InstructionStream objects are
-  // allocated in a separate pointer compression cage instead of the cage where
-  // all the other objects are allocated. This field contains cage base value
-  // which is used for decompressing the references to non-InstructionStream
-  // objects (map, deoptimization_data, etc.).
-  inline PtrComprCageBase main_cage_base() const;
-  inline PtrComprCageBase main_cage_base(RelaxedLoadTag) const;
-  inline void set_main_cage_base(Address cage_base, RelaxedStoreTag);
-
-  static inline InstructionStream FromTargetAddress(Address address);
-  static inline InstructionStream FromEntryAddress(Address location_of_address);
-
-  // InstructionStream entry point.
-  inline Address entry() const;
-
-  // Returns true if pc is inside this object's instructions.
-  inline bool contains(Isolate* isolate, Address pc);
-
-  // Relocate the code by delta bytes. Called to signal that this code
-  // object has been moved by delta bytes.
-  void Relocate(intptr_t delta);
-
-  // Returns the object size for a given body (used for allocation).
-  static int SizeFor(int body_size) {
-    return RoundUp(kHeaderSize + body_size, kCodeAlignment);
-  }
-
-  inline int CodeSize() const;
-
-  // Hides HeapObject::Size(...) and redirects queries to CodeSize().
-  DECL_GETTER(Size, int)
-
-  DECL_CAST(InstructionStream)
-
-  // Dispatched behavior.
-  DECL_PRINTER(InstructionStream)
-  DECL_VERIFIER(InstructionStream)
-
-  inline HandlerTable::CatchPrediction GetBuiltinCatchPrediction() const;
-
-  // Layout description.
-#define ISTREAM_FIELDS(V)                                             \
-  V(kCodeOffset, kTaggedSize)                                         \
-  /* Data or code not directly visited by GC directly starts here. */ \
-  V(kDataStart, 0)                                                    \
-  V(kMainCageBaseUpper32BitsOffset,                                   \
-    V8_EXTERNAL_CODE_SPACE_BOOL ? kTaggedSize : 0)                    \
-  V(kHeaderSize, 0)
-
-  DEFINE_FIELD_OFFSET_CONSTANTS(HeapObject::kHeaderSize, ISTREAM_FIELDS)
-#undef ISTREAM_FIELDS
-
-  static_assert(kCodeAlignment > kHeaderSize);
-  // We do two things to ensure kCodeAlignment of the entry address:
-  // 1) add kCodeAlignmentMinusCodeHeader padding once in the beginning of every
-  //    MemoryChunk
-  // 2) Round up all IStream allocations to a multiple of kCodeAlignment
-  // Together, the IStream object itself will always start at offset
-  // kCodeAlignmentMinusCodeHeader, which aligns the entry to kCodeAlignment.
-  static constexpr int kCodeAlignmentMinusCodeHeader =
-      kCodeAlignment - kHeaderSize;
-
-  class BodyDescriptor;
-
-  static const int kArgumentsBits = 16;
-  // Reserve one argument count value as the "don't adapt arguments" sentinel.
-  static const int kMaxArguments = (1 << kArgumentsBits) - 2;
-
- private:
-  friend class RelocIterator;
-  friend class EvacuateVisitorBase;
-
-  inline Code GCSafeCode(AcquireLoadTag) const;
-
-  bool is_promise_rejection() const;
-
-  OBJECT_CONSTRUCTORS(InstructionStream, HeapObject);
-};
-
-class Code::OptimizedCodeIterator {
- public:
-  explicit OptimizedCodeIterator(Isolate* isolate);
-  OptimizedCodeIterator(const OptimizedCodeIterator&) = delete;
-  OptimizedCodeIterator& operator=(const OptimizedCodeIterator&) = delete;
-  Code Next();
-
- private:
-  Isolate* isolate_;
-  std::unique_ptr<SafepointScope> safepoint_scope_;
-  std::unique_ptr<ObjectIterator> object_iterator_;
-  enum { kIteratingCodeSpace, kIteratingCodeLOSpace, kDone } state_;
-
-  DISALLOW_GARBAGE_COLLECTION(no_gc)
-};
-
-// Helper functions for converting InstructionStream objects to
-// Code and back.
-inline Code ToCode(InstructionStream code);
-inline InstructionStream FromCode(Code code);
-inline InstructionStream FromCode(Code code, Isolate* isolate, RelaxedLoadTag);
-inline InstructionStream FromCode(Code code, PtrComprCageBase, RelaxedLoadTag);
-
-// AbstractCode is a helper wrapper around {Code|BytecodeArray}.
-class AbstractCode : public HeapObject {
- public:
-  int SourcePosition(PtrComprCageBase cage_base, int offset);
-  int SourceStatementPosition(PtrComprCageBase cage_base, int offset);
-
-  inline Address InstructionStart(PtrComprCageBase cage_base);
-  inline Address InstructionEnd(PtrComprCageBase cage_base);
-  inline int InstructionSize(PtrComprCageBase cage_base);
-
-  // Return the source position table for interpreter code.
-  inline ByteArray SourcePositionTable(Isolate* isolate,
-                                       SharedFunctionInfo sfi);
-
-  void DropStackFrameCache(PtrComprCageBase cage_base);
-
-  // Returns the size of instructions and the metadata.
-  inline int SizeIncludingMetadata(PtrComprCageBase cage_base);
-
-  // Returns true if pc is inside this object's instructions.
-  inline bool contains(Isolate* isolate, Address pc);
-
-  // Returns the kind of the code.
-  inline CodeKind kind(PtrComprCageBase cage_base);
-
-  inline Builtin builtin_id(PtrComprCageBase cage_base);
-
-  inline bool has_instruction_stream(PtrComprCageBase cage_base);
-
-  inline HandlerTable::CatchPrediction GetBuiltinCatchPrediction(
-      PtrComprCageBase cage_base);
-
-  DECL_CAST(AbstractCode)
-
-  inline bool IsCode(PtrComprCageBase cage_base) const;
-  inline bool IsBytecodeArray(PtrComprCageBase cage_base) const;
-
-  inline Code GetCode();
-  inline BytecodeArray GetBytecodeArray();
-
- private:
-  inline ByteArray SourcePositionTableInternal(PtrComprCageBase cage_base);
-
-  OBJECT_CONSTRUCTORS(AbstractCode, HeapObject);
-};
-
-// Dependent code is conceptually the list of {InstructionStream,
-// DependencyGroup} tuples associated with an object, where the dependency group
-// is a reason that could lead to a deopt of the corresponding code.
-//
-// Implementation details: DependentCode is a weak array list containing
-// entries, where each entry consists of a (weak) InstructionStream object and
-// the DependencyGroups bitset as a Smi.
-//
-// Note the underlying weak array list currently never shrinks physically (the
-// contents may shrink).
-// TODO(jgruber): Consider adding physical shrinking.
-class DependentCode : public WeakArrayList {
- public:
-  DECL_CAST(DependentCode)
-
-  enum DependencyGroup {
-    // Group of code objects that embed a transition to this map, and depend on
-    // being deoptimized when the transition is replaced by a new version.
-    kTransitionGroup = 1 << 0,
-    // Group of code objects that omit run-time prototype checks for prototypes
-    // described by this map. The group is deoptimized whenever the following
-    // conditions hold, possibly invalidating the assumptions embedded in the
-    // code:
-    // a) A fast-mode object described by this map changes shape (and
-    // transitions to a new map), or
-    // b) A dictionary-mode prototype described by this map changes shape, the
-    // const-ness of one of its properties changes, or its [[Prototype]]
-    // changes (only the latter causes a transition).
-    kPrototypeCheckGroup = 1 << 1,
-    // Group of code objects that depends on global property values in property
-    // cells not being changed.
-    kPropertyCellChangedGroup = 1 << 2,
-    // Group of code objects that omit run-time checks for field(s) introduced
-    // by this map, i.e. for the field type.
-    kFieldTypeGroup = 1 << 3,
-    kFieldConstGroup = 1 << 4,
-    kFieldRepresentationGroup = 1 << 5,
-    // Group of code objects that omit run-time type checks for initial maps of
-    // constructors.
-    kInitialMapChangedGroup = 1 << 6,
-    // Group of code objects that depends on tenuring information in
-    // AllocationSites not being changed.
-    kAllocationSiteTenuringChangedGroup = 1 << 7,
-    // Group of code objects that depends on element transition information in
-    // AllocationSites not being changed.
-    kAllocationSiteTransitionChangedGroup = 1 << 8,
-    // IMPORTANT: The last bit must fit into a Smi, i.e. into 31 bits.
-  };
-  using DependencyGroups = base::Flags<DependencyGroup, uint32_t>;
-
-  static const char* DependencyGroupName(DependencyGroup group);
-
-  // Register a dependency of {code} on {object}, of the kinds given by
-  // {groups}.
-  V8_EXPORT_PRIVATE static void InstallDependency(Isolate* isolate,
-                                                  Handle<Code> code,
-                                                  Handle<HeapObject> object,
-                                                  DependencyGroups groups);
-
-  template <typename ObjectT>
-  static void DeoptimizeDependencyGroups(Isolate* isolate, ObjectT object,
-                                         DependencyGroups groups);
-
-  template <typename ObjectT>
-  static bool MarkCodeForDeoptimization(Isolate* isolate, ObjectT object,
-                                        DependencyGroups groups);
-
-  V8_EXPORT_PRIVATE static DependentCode empty_dependent_code(
-      const ReadOnlyRoots& roots);
-  static constexpr RootIndex kEmptyDependentCode =
-      RootIndex::kEmptyWeakArrayList;
-
-  // Constants exposed for tests.
-  static constexpr int kSlotsPerEntry =
-      2;  // {code: weak InstructionStream, groups: Smi}.
-  static constexpr int kCodeSlotOffset = 0;
-  static constexpr int kGroupsSlotOffset = 1;
-
- private:
-  // Get/Set {object}'s {DependentCode}.
-  static DependentCode GetDependentCode(HeapObject object);
-  static void SetDependentCode(Handle<HeapObject> object,
-                               Handle<DependentCode> dep);
-
-  static Handle<DependentCode> InsertWeakCode(Isolate* isolate,
-                                              Handle<DependentCode> entries,
-                                              DependencyGroups groups,
-                                              Handle<Code> code);
-
-  bool MarkCodeForDeoptimization(Isolate* isolate,
-                                 DependencyGroups deopt_groups);
-
-  void DeoptimizeDependencyGroups(Isolate* isolate, DependencyGroups groups);
-
-  // The callback is called for all non-cleared entries, and should return true
-  // iff the current entry should be cleared.
-  using IterateAndCompactFn = std::function<bool(Code, DependencyGroups)>;
-  void IterateAndCompact(const IterateAndCompactFn& fn);
-
-  // Fills the given entry with the last non-cleared entry in this list, and
-  // returns the new length after the last non-cleared entry has been moved.
-  int FillEntryFromBack(int index, int length);
-
-  static constexpr int LengthFor(int number_of_entries) {
-    return number_of_entries * kSlotsPerEntry;
-  }
-
-  OBJECT_CONSTRUCTORS(DependentCode, WeakArrayList);
-};
-
-DEFINE_OPERATORS_FOR_FLAGS(DependentCode::DependencyGroups)
-
-// BytecodeArray represents a sequence of interpreter bytecodes.
-class BytecodeArray
-    : public TorqueGeneratedBytecodeArray<BytecodeArray, FixedArrayBase> {
- public:
-  static constexpr int SizeFor(int length) {
-    return OBJECT_POINTER_ALIGN(kHeaderSize + length);
-  }
-
-  inline byte get(int index) const;
-  inline void set(int index, byte value);
-
-  inline Address GetFirstBytecodeAddress();
-
-  inline int32_t frame_size() const;
-  inline void set_frame_size(int32_t frame_size);
-
-  // Note: The register count is derived from frame_size.
-  inline int register_count() const;
-
-  // Note: the parameter count includes the implicit 'this' receiver.
-  inline int32_t parameter_count() const;
-  inline void set_parameter_count(int32_t number_of_parameters);
-
-  inline interpreter::Register incoming_new_target_or_generator_register()
-      const;
-  inline void set_incoming_new_target_or_generator_register(
-      interpreter::Register incoming_new_target_or_generator_register);
-
-  static constexpr int kBytecodeAgeSize = kUInt16Size;
-  static_assert(kBytecodeAgeOffset + kBytecodeAgeSize - 1 ==
-                kBytecodeAgeOffsetEnd);
-
-  inline uint16_t bytecode_age() const;
-  inline void set_bytecode_age(uint16_t age);
-
-  inline bool HasSourcePositionTable() const;
-  inline bool DidSourcePositionGenerationFail() const;
-
-  // If source positions have not been collected or an exception has been thrown
-  // this will return empty_byte_array.
-  DECL_GETTER(SourcePositionTable, ByteArray)
-
-  // Raw accessors to access these fields during code cache deserialization.
-  DECL_GETTER(raw_constant_pool, Object)
-  DECL_GETTER(raw_handler_table, Object)
-  DECL_GETTER(raw_source_position_table, Object)
-
-  // Indicates that an attempt was made to collect source positions, but that it
-  // failed most likely due to stack exhaustion. When in this state
-  // |SourcePositionTable| will return an empty byte array rather than crashing
-  // as it would if no attempt was ever made to collect source positions.
-  inline void SetSourcePositionsFailedToCollect();
-
-  inline int BytecodeArraySize() const;
-
-  // Returns the size of bytecode and its metadata. This includes the size of
-  // bytecode, constant pool, source position table, and handler table.
-  DECL_GETTER(SizeIncludingMetadata, int)
-
-  DECL_PRINTER(BytecodeArray)
-  DECL_VERIFIER(BytecodeArray)
-
-  V8_EXPORT_PRIVATE void PrintJson(std::ostream& os);
-  V8_EXPORT_PRIVATE void Disassemble(std::ostream& os);
-
-  V8_EXPORT_PRIVATE static void Disassemble(Handle<BytecodeArray> handle,
-                                            std::ostream& os);
-
-  void CopyBytecodesTo(BytecodeArray to);
-
-  // Bytecode aging
-  V8_EXPORT_PRIVATE bool IsOld() const;
-  V8_EXPORT_PRIVATE void MakeOlder();
-
-  // Clear uninitialized padding space. This ensures that the snapshot content
-  // is deterministic.
-  inline void clear_padding();
-
-  // Maximal memory consumption for a single BytecodeArray.
-  static const int kMaxSize = 512 * MB;
-  // Maximal length of a single BytecodeArray.
-  static const int kMaxLength = kMaxSize - kHeaderSize;
-
-  class BodyDescriptor;
-
- private:
-  // Hide accessors inherited from generated class. Use parameter_count instead.
-  DECL_INT_ACCESSORS(parameter_size)
-
-  TQ_OBJECT_CONSTRUCTORS(BytecodeArray)
-};
-
-// This class holds data required during deoptimization. It does not have its
-// own instance type.
-class DeoptimizationLiteralArray : public WeakFixedArray {
- public:
-  // Getters for literals. These include runtime checks that the pointer was not
-  // cleared, if the literal was held weakly.
-  inline Object get(int index) const;
-  inline Object get(PtrComprCageBase cage_base, int index) const;
-
-  // Setter for literals. This will set the object as strong or weak depending
-  // on InstructionStream::IsWeakObjectInOptimizedCode.
-  inline void set(int index, Object value);
-
-  DECL_CAST(DeoptimizationLiteralArray)
-
-  OBJECT_CONSTRUCTORS(DeoptimizationLiteralArray, WeakFixedArray);
-};
-
-// DeoptimizationData is a fixed array used to hold the deoptimization data for
-// optimized code.  It also contains information about functions that were
-// inlined.  If N different functions were inlined then the first N elements of
-// the literal array will contain these functions.
-//
-// It can be empty.
-class DeoptimizationData : public FixedArray {
- public:
-  // Layout description.  Indices in the array.
-  static const int kTranslationByteArrayIndex = 0;
-  static const int kInlinedFunctionCountIndex = 1;
-  static const int kLiteralArrayIndex = 2;
-  static const int kOsrBytecodeOffsetIndex = 3;
-  static const int kOsrPcOffsetIndex = 4;
-  static const int kOptimizationIdIndex = 5;
-  static const int kSharedFunctionInfoIndex = 6;
-  static const int kInliningPositionsIndex = 7;
-  static const int kDeoptExitStartIndex = 8;
-  static const int kEagerDeoptCountIndex = 9;
-  static const int kLazyDeoptCountIndex = 10;
-  static const int kFirstDeoptEntryIndex = 11;
-
-  // Offsets of deopt entry elements relative to the start of the entry.
-  static const int kBytecodeOffsetRawOffset = 0;
-  static const int kTranslationIndexOffset = 1;
-  static const int kPcOffset = 2;
-#ifdef DEBUG
-  static const int kNodeIdOffset = 3;
-  static const int kDeoptEntrySize = 4;
-#else   // DEBUG
-  static const int kDeoptEntrySize = 3;
-#endif  // DEBUG
-
-// Simple element accessors.
-#define DECL_ELEMENT_ACCESSORS(name, type) \
-  inline type name() const;                \
-  inline void Set##name(type value);
-
-  DECL_ELEMENT_ACCESSORS(TranslationByteArray, TranslationArray)
-  DECL_ELEMENT_ACCESSORS(InlinedFunctionCount, Smi)
-  DECL_ELEMENT_ACCESSORS(LiteralArray, DeoptimizationLiteralArray)
-  DECL_ELEMENT_ACCESSORS(OsrBytecodeOffset, Smi)
-  DECL_ELEMENT_ACCESSORS(OsrPcOffset, Smi)
-  DECL_ELEMENT_ACCESSORS(OptimizationId, Smi)
-  DECL_ELEMENT_ACCESSORS(SharedFunctionInfo, Object)
-  DECL_ELEMENT_ACCESSORS(InliningPositions, PodArray<InliningPosition>)
-  DECL_ELEMENT_ACCESSORS(DeoptExitStart, Smi)
-  DECL_ELEMENT_ACCESSORS(EagerDeoptCount, Smi)
-  DECL_ELEMENT_ACCESSORS(LazyDeoptCount, Smi)
-
-#undef DECL_ELEMENT_ACCESSORS
-
-// Accessors for elements of the ith deoptimization entry.
-#define DECL_ENTRY_ACCESSORS(name, type) \
-  inline type name(int i) const;         \
-  inline void Set##name(int i, type value);
-
-  DECL_ENTRY_ACCESSORS(BytecodeOffsetRaw, Smi)
-  DECL_ENTRY_ACCESSORS(TranslationIndex, Smi)
-  DECL_ENTRY_ACCESSORS(Pc, Smi)
-#ifdef DEBUG
-  DECL_ENTRY_ACCESSORS(NodeId, Smi)
-#endif  // DEBUG
-
-#undef DECL_ENTRY_ACCESSORS
-
-  inline BytecodeOffset GetBytecodeOffset(int i) const;
-
-  inline void SetBytecodeOffset(int i, BytecodeOffset value);
-
-  inline int DeoptCount();
-
-  static const int kNotInlinedIndex = -1;
-
-  // Returns the inlined function at the given position in LiteralArray, or the
-  // outer function if index == kNotInlinedIndex.
-  class SharedFunctionInfo GetInlinedFunction(int index);
-
-  // Allocates a DeoptimizationData.
-  static Handle<DeoptimizationData> New(Isolate* isolate, int deopt_entry_count,
-                                        AllocationType allocation);
-
-  // Return an empty DeoptimizationData.
-  V8_EXPORT_PRIVATE static Handle<DeoptimizationData> Empty(Isolate* isolate);
-
-  DECL_CAST(DeoptimizationData)
-
-#ifdef ENABLE_DISASSEMBLER
-  void DeoptimizationDataPrint(std::ostream& os);
-#endif
-
- private:
-  static int IndexForEntry(int i) {
-    return kFirstDeoptEntryIndex + (i * kDeoptEntrySize);
-  }
-
-  static int LengthFor(int entry_count) { return IndexForEntry(entry_count); }
-
-  OBJECT_CONSTRUCTORS(DeoptimizationData, FixedArray);
-};
-
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/compilation-cache-table-inl.h b/deps/v8/src/objects/compilation-cache-table-inl.h
index 831cc474fe6493..bcaf2399b09cf0 100644
--- a/deps/v8/src/objects/compilation-cache-table-inl.h
+++ b/deps/v8/src/objects/compilation-cache-table-inl.h
@@ -20,28 +20,29 @@ namespace internal {
 
 CompilationCacheTable::CompilationCacheTable(Address ptr)
     : HashTable<CompilationCacheTable, CompilationCacheShape>(ptr) {
-  SLOW_DCHECK(IsCompilationCacheTable());
+  SLOW_DCHECK(IsCompilationCacheTable(*this));
 }
 
 NEVER_READ_ONLY_SPACE_IMPL(CompilationCacheTable)
 CAST_ACCESSOR(CompilationCacheTable)
 
-Object CompilationCacheTable::PrimaryValueAt(InternalIndex entry) {
+Tagged<Object> CompilationCacheTable::PrimaryValueAt(InternalIndex entry) {
   return get(EntryToIndex(entry) + 1);
 }
 
-void CompilationCacheTable::SetPrimaryValueAt(InternalIndex entry, Object value,
+void CompilationCacheTable::SetPrimaryValueAt(InternalIndex entry,
+                                              Tagged<Object> value,
                                               WriteBarrierMode mode) {
   set(EntryToIndex(entry) + 1, value, mode);
 }
 
-Object CompilationCacheTable::EvalFeedbackValueAt(InternalIndex entry) {
+Tagged<Object> CompilationCacheTable::EvalFeedbackValueAt(InternalIndex entry) {
   static_assert(CompilationCacheShape::kEntrySize == 3);
   return get(EntryToIndex(entry) + 2);
 }
 
 void CompilationCacheTable::SetEvalFeedbackValueAt(InternalIndex entry,
-                                                   Object value,
+                                                   Tagged<Object> value,
                                                    WriteBarrierMode mode) {
   set(EntryToIndex(entry) + 2, value, mode);
 }
@@ -69,20 +70,21 @@ class ScriptCacheKey : public HashTableKey {
                  v8::ScriptOriginOptions origin_options,
                  MaybeHandle<Object> host_defined_options, Isolate* isolate);
 
-  bool IsMatch(Object other) override;
-  bool MatchesOrigin(Script script);
+  bool IsMatch(Tagged<Object> other) override;
+  bool MatchesOrigin(Tagged<Script> script);
 
   Handle<Object> AsHandle(Isolate* isolate, Handle<SharedFunctionInfo> shared);
 
-  static base::Optional<String> SourceFromObject(Object obj) {
+  static base::Optional<String> SourceFromObject(Tagged<Object> obj) {
     DisallowGarbageCollection no_gc;
-    DCHECK(obj.IsWeakFixedArray());
-    WeakFixedArray array = WeakFixedArray::cast(obj);
-    DCHECK_EQ(array.length(), kEnd);
-
-    MaybeObject maybe_script = array.Get(kWeakScript);
-    if (HeapObject script; maybe_script.GetHeapObjectIfWeak(&script)) {
-      PrimitiveHeapObject source_or_undefined = Script::cast(script).source();
+    DCHECK(IsWeakFixedArray(obj));
+    Tagged<WeakFixedArray> array = WeakFixedArray::cast(obj);
+    DCHECK_EQ(array->length(), kEnd);
+
+    MaybeObject maybe_script = array->Get(kWeakScript);
+    if (Tagged<HeapObject> script; maybe_script.GetHeapObjectIfWeak(&script)) {
+      Tagged<PrimitiveHeapObject> source_or_undefined =
+          Script::cast(script)->source();
       // Scripts stored in the script cache should always have a source string.
       return String::cast(source_or_undefined);
     }
@@ -101,23 +103,24 @@ class ScriptCacheKey : public HashTableKey {
   Isolate* isolate_;
 };
 
-uint32_t CompilationCacheShape::RegExpHash(String string, Smi flags) {
-  return string.EnsureHash() + flags.value();
+uint32_t CompilationCacheShape::RegExpHash(Tagged<String> string,
+                                           Tagged<Smi> flags) {
+  return string->EnsureHash() + flags.value();
 }
 
-uint32_t CompilationCacheShape::EvalHash(String source,
-                                         SharedFunctionInfo shared,
+uint32_t CompilationCacheShape::EvalHash(Tagged<String> source,
+                                         Tagged<SharedFunctionInfo> shared,
                                          LanguageMode language_mode,
                                          int position) {
-  uint32_t hash = source.EnsureHash();
-  if (shared.HasSourceCode()) {
+  uint32_t hash = source->EnsureHash();
+  if (shared->HasSourceCode()) {
     // Instead of using the SharedFunctionInfo pointer in the hash
     // code computation, we use a combination of the hash of the
     // script source code and the start position of the calling scope.
     // We do this to ensure that the cache entries can survive garbage
     // collection.
-    Script script(Script::cast(shared.script()));
-    hash ^= String::cast(script.source()).EnsureHash();
+    Tagged<Script> script(Script::cast(shared->script()));
+    hash ^= String::cast(script->source())->EnsureHash();
   }
   static_assert(LanguageModeSize == 2);
   if (is_strict(language_mode)) hash ^= 0x8000;
@@ -126,46 +129,46 @@ uint32_t CompilationCacheShape::EvalHash(String source,
 }
 
 uint32_t CompilationCacheShape::HashForObject(ReadOnlyRoots roots,
-                                              Object object) {
+                                              Tagged<Object> object) {
   // Eval: The key field contains the hash as a Number.
-  if (object.IsNumber()) return static_cast<uint32_t>(object.Number());
+  if (IsNumber(object)) return static_cast<uint32_t>(Object::Number(object));
 
   // Code: The key field contains the SFI key.
-  if (object.IsSharedFunctionInfo()) {
-    return SharedFunctionInfo::cast(object).Hash();
+  if (IsSharedFunctionInfo(object)) {
+    return SharedFunctionInfo::cast(object)->Hash();
   }
 
   // Script.
-  if (object.IsWeakFixedArray()) {
+  if (IsWeakFixedArray(object)) {
     uint32_t result = static_cast<uint32_t>(Smi::ToInt(
-        WeakFixedArray::cast(object).Get(ScriptCacheKey::kHash).ToSmi()));
+        WeakFixedArray::cast(object)->Get(ScriptCacheKey::kHash).ToSmi()));
     return result;
   }
 
   // Eval: See EvalCacheKey::ToHandle for the encoding.
-  FixedArray val = FixedArray::cast(object);
-  if (val.map() == roots.fixed_cow_array_map()) {
-    DCHECK_EQ(4, val.length());
-    String source = String::cast(val.get(1));
-    int language_unchecked = Smi::ToInt(val.get(2));
+  Tagged<FixedArray> val = FixedArray::cast(object);
+  if (val->map() == roots.fixed_cow_array_map()) {
+    DCHECK_EQ(4, val->length());
+    Tagged<String> source = String::cast(val->get(1));
+    int language_unchecked = Smi::ToInt(val->get(2));
     DCHECK(is_valid_language_mode(language_unchecked));
     LanguageMode language_mode = static_cast<LanguageMode>(language_unchecked);
-    int position = Smi::ToInt(val.get(3));
-    Object shared = val.get(0);
+    int position = Smi::ToInt(val->get(3));
+    Tagged<Object> shared = val->get(0);
     return EvalHash(source, SharedFunctionInfo::cast(shared), language_mode,
                     position);
   }
 
   // RegExp: The key field (and the value field) contains the
   // JSRegExp::data fixed array.
-  DCHECK_GE(val.length(), JSRegExp::kMinDataArrayLength);
-  return RegExpHash(String::cast(val.get(JSRegExp::kSourceIndex)),
-                    Smi::cast(val.get(JSRegExp::kFlagsIndex)));
+  DCHECK_GE(val->length(), JSRegExp::kMinDataArrayLength);
+  return RegExpHash(String::cast(val->get(JSRegExp::kSourceIndex)),
+                    Smi::cast(val->get(JSRegExp::kFlagsIndex)));
 }
 
-InfoCellPair::InfoCellPair(Isolate* isolate, SharedFunctionInfo shared,
-                           FeedbackCell feedback_cell)
-    : is_compiled_scope_(!shared.is_null() ? shared.is_compiled_scope(isolate)
+InfoCellPair::InfoCellPair(Isolate* isolate, Tagged<SharedFunctionInfo> shared,
+                           Tagged<FeedbackCell> feedback_cell)
+    : is_compiled_scope_(!shared.is_null() ? shared->is_compiled_scope(isolate)
                                            : IsCompiledScope()),
       shared_(shared),
       feedback_cell_(feedback_cell) {}
diff --git a/deps/v8/src/objects/compilation-cache-table.cc b/deps/v8/src/objects/compilation-cache-table.cc
index 1c3b154310cb17..cff8a03deb88b7 100644
--- a/deps/v8/src/objects/compilation-cache-table.cc
+++ b/deps/v8/src/objects/compilation-cache-table.cc
@@ -18,21 +18,22 @@ const int kLiteralInitialLength = 2;
 const int kLiteralContextOffset = 0;
 const int kLiteralLiteralsOffset = 1;
 
-int SearchLiteralsMapEntry(CompilationCacheTable cache,
-                           InternalIndex cache_entry, Context native_context) {
+int SearchLiteralsMapEntry(Tagged<CompilationCacheTable> cache,
+                           InternalIndex cache_entry,
+                           Tagged<Context> native_context) {
   DisallowGarbageCollection no_gc;
-  DCHECK(native_context.IsNativeContext());
-  Object obj = cache.EvalFeedbackValueAt(cache_entry);
+  DCHECK(IsNativeContext(native_context));
+  Tagged<Object> obj = cache->EvalFeedbackValueAt(cache_entry);
 
   // Check that there's no confusion between FixedArray and WeakFixedArray (the
   // object used to be a FixedArray here).
-  DCHECK(!obj.IsFixedArray());
-  if (obj.IsWeakFixedArray()) {
-    WeakFixedArray literals_map = WeakFixedArray::cast(obj);
-    int length = literals_map.length();
+  DCHECK(!IsFixedArray(obj));
+  if (IsWeakFixedArray(obj)) {
+    Tagged<WeakFixedArray> literals_map = WeakFixedArray::cast(obj);
+    int length = literals_map->length();
     for (int i = 0; i < length; i += kLiteralEntryLength) {
-      DCHECK(literals_map.Get(i + kLiteralContextOffset)->IsWeakOrCleared());
-      if (literals_map.Get(i + kLiteralContextOffset) ==
+      DCHECK(literals_map->Get(i + kLiteralContextOffset)->IsWeakOrCleared());
+      if (literals_map->Get(i + kLiteralContextOffset) ==
           HeapObjectReference::Weak(native_context)) {
         return i;
       }
@@ -46,17 +47,17 @@ void AddToFeedbackCellsMap(Handle<CompilationCacheTable> cache,
                            Handle<Context> native_context,
                            Handle<FeedbackCell> feedback_cell) {
   Isolate* isolate = native_context->GetIsolate();
-  DCHECK(native_context->IsNativeContext());
+  DCHECK(IsNativeContext(*native_context));
   static_assert(kLiteralEntryLength == 2);
   Handle<WeakFixedArray> new_literals_map;
   int entry;
 
-  Object obj = cache->EvalFeedbackValueAt(cache_entry);
+  Tagged<Object> obj = cache->EvalFeedbackValueAt(cache_entry);
 
   // Check that there's no confusion between FixedArray and WeakFixedArray (the
   // object used to be a FixedArray here).
-  DCHECK(!obj.IsFixedArray());
-  if (!obj.IsWeakFixedArray() || WeakFixedArray::cast(obj).length() == 0) {
+  DCHECK(!IsFixedArray(obj));
+  if (!IsWeakFixedArray(obj) || WeakFixedArray::cast(obj)->length() == 0) {
     new_literals_map = isolate->factory()->NewWeakFixedArray(
         kLiteralInitialLength, AllocationType::kOld);
     entry = 0;
@@ -98,35 +99,35 @@ void AddToFeedbackCellsMap(Handle<CompilationCacheTable> cache,
   for (int i = 0; i < new_literals_map->length(); i += kLiteralEntryLength) {
     MaybeObject object = new_literals_map->Get(i + kLiteralContextOffset);
     DCHECK(object->IsCleared() ||
-           object->GetHeapObjectAssumeWeak().IsNativeContext());
+           IsNativeContext(object.GetHeapObjectAssumeWeak()));
     object = new_literals_map->Get(i + kLiteralLiteralsOffset);
     DCHECK(object->IsCleared() ||
-           object->GetHeapObjectAssumeWeak().IsFeedbackCell());
+           IsFeedbackCell(object.GetHeapObjectAssumeWeak()));
   }
 #endif
 
-  Object old_literals_map = cache->EvalFeedbackValueAt(cache_entry);
+  Tagged<Object> old_literals_map = cache->EvalFeedbackValueAt(cache_entry);
   if (old_literals_map != *new_literals_map) {
     cache->SetEvalFeedbackValueAt(cache_entry, *new_literals_map);
   }
 }
 
-FeedbackCell SearchLiteralsMap(CompilationCacheTable cache,
-                               InternalIndex cache_entry,
-                               Context native_context) {
-  FeedbackCell result;
+Tagged<FeedbackCell> SearchLiteralsMap(Tagged<CompilationCacheTable> cache,
+                                       InternalIndex cache_entry,
+                                       Tagged<Context> native_context) {
+  Tagged<FeedbackCell> result;
   int entry = SearchLiteralsMapEntry(cache, cache_entry, native_context);
   if (entry >= 0) {
-    WeakFixedArray literals_map =
-        WeakFixedArray::cast(cache.EvalFeedbackValueAt(cache_entry));
-    DCHECK_LE(entry + kLiteralEntryLength, literals_map.length());
-    MaybeObject object = literals_map.Get(entry + kLiteralLiteralsOffset);
+    Tagged<WeakFixedArray> literals_map =
+        WeakFixedArray::cast(cache->EvalFeedbackValueAt(cache_entry));
+    DCHECK_LE(entry + kLiteralEntryLength, literals_map->length());
+    MaybeObject object = literals_map->Get(entry + kLiteralLiteralsOffset);
 
     if (!object->IsCleared()) {
-      result = FeedbackCell::cast(object->GetHeapObjectAssumeWeak());
+      result = FeedbackCell::cast(object.GetHeapObjectAssumeWeak());
     }
   }
-  DCHECK(result.is_null() || result.IsFeedbackCell());
+  DCHECK(result.is_null() || IsFeedbackCell(result));
   return result;
 }
 
@@ -152,24 +153,24 @@ class EvalCacheKey : public HashTableKey {
         language_mode_(language_mode),
         position_(position) {}
 
-  bool IsMatch(Object other) override {
+  bool IsMatch(Tagged<Object> other) override {
     DisallowGarbageCollection no_gc;
-    if (!other.IsFixedArray()) {
-      DCHECK(other.IsNumber());
-      uint32_t other_hash = static_cast<uint32_t>(other.Number());
+    if (!IsFixedArray(other)) {
+      DCHECK(IsNumber(other));
+      uint32_t other_hash = static_cast<uint32_t>(Object::Number(other));
       return Hash() == other_hash;
     }
-    FixedArray other_array = FixedArray::cast(other);
-    DCHECK(other_array.get(0).IsSharedFunctionInfo());
-    if (*shared_ != other_array.get(0)) return false;
-    int language_unchecked = Smi::ToInt(other_array.get(2));
+    Tagged<FixedArray> other_array = FixedArray::cast(other);
+    DCHECK(IsSharedFunctionInfo(other_array->get(0)));
+    if (*shared_ != other_array->get(0)) return false;
+    int language_unchecked = Smi::ToInt(other_array->get(2));
     DCHECK(is_valid_language_mode(language_unchecked));
     LanguageMode language_mode = static_cast<LanguageMode>(language_unchecked);
     if (language_mode != language_mode_) return false;
-    int position = Smi::ToInt(other_array.get(3));
+    int position = Smi::ToInt(other_array->get(3));
     if (position != position_) return false;
-    String source = String::cast(other_array.get(1));
-    return source.Equals(*source_);
+    Tagged<String> source = String::cast(other_array->get(1));
+    return source->Equals(*source_);
   }
 
   Handle<Object> AsHandle(Isolate* isolate) {
@@ -202,10 +203,10 @@ class RegExpKey : public HashTableKey {
   // stored value is stored where the key should be.  IsMatch then
   // compares the search key to the found object, rather than comparing
   // a key to a key.
-  bool IsMatch(Object obj) override {
-    FixedArray val = FixedArray::cast(obj);
-    return string_->Equals(String::cast(val.get(JSRegExp::kSourceIndex))) &&
-           (flags_ == val.get(JSRegExp::kFlagsIndex));
+  bool IsMatch(Tagged<Object> obj) override {
+    Tagged<FixedArray> val = FixedArray::cast(obj);
+    return string_->Equals(String::cast(val->get(JSRegExp::kSourceIndex))) &&
+           (flags_ == val->get(JSRegExp::kFlagsIndex));
   }
 
   Handle<String> string_;
@@ -219,20 +220,21 @@ class CodeKey : public HashTableKey {
   explicit CodeKey(Handle<SharedFunctionInfo> key)
       : HashTableKey(key->Hash()), key_(key) {}
 
-  bool IsMatch(Object string) override { return *key_ == string; }
+  bool IsMatch(Tagged<Object> string) override { return *key_ == string; }
 
   Handle<SharedFunctionInfo> key_;
 };
 
-Smi ScriptHash(String source, MaybeHandle<Object> maybe_name, int line_offset,
-               int column_offset, v8::ScriptOriginOptions origin_options,
-               Isolate* isolate) {
+Tagged<Smi> ScriptHash(Tagged<String> source, MaybeHandle<Object> maybe_name,
+                       int line_offset, int column_offset,
+                       v8::ScriptOriginOptions origin_options,
+                       Isolate* isolate) {
   DisallowGarbageCollection no_gc;
-  size_t hash = base::hash_combine(source.EnsureHash());
+  size_t hash = base::hash_combine(source->EnsureHash());
   if (Handle<Object> name;
-      maybe_name.ToHandle(&name) && name->IsString(isolate)) {
+      maybe_name.ToHandle(&name) && IsString(*name, isolate)) {
     hash =
-        base::hash_combine(hash, String::cast(*name).EnsureHash(), line_offset,
+        base::hash_combine(hash, String::cast(*name)->EnsureHash(), line_offset,
                            column_offset, origin_options.Flags());
   }
   // The upper bits of the hash are discarded so that the value fits in a Smi.
@@ -244,27 +246,27 @@ Smi ScriptHash(String source, MaybeHandle<Object> maybe_name, int line_offset,
 // We only re-use a cached function for some script source code if the
 // script originates from the same place. This is to avoid issues
 // when reporting errors, etc.
-bool ScriptCacheKey::MatchesOrigin(Script script) {
+bool ScriptCacheKey::MatchesOrigin(Tagged<Script> script) {
   DisallowGarbageCollection no_gc;
 
   // If the script name isn't set, the boilerplate script should have
   // an undefined name to have the same origin.
   Handle<Object> name;
   if (!name_.ToHandle(&name)) {
-    return script.name().IsUndefined(isolate_);
+    return IsUndefined(script->name(), isolate_);
   }
   // Do the fast bailout checks first.
-  if (line_offset_ != script.line_offset()) return false;
-  if (column_offset_ != script.column_offset()) return false;
+  if (line_offset_ != script->line_offset()) return false;
+  if (column_offset_ != script->column_offset()) return false;
   // Check that both names are strings. If not, no match.
-  if (!name->IsString(isolate_) || !script.name().IsString(isolate_))
+  if (!IsString(*name, isolate_) || !IsString(script->name(), isolate_))
     return false;
   // Are the origin_options same?
-  if (origin_options_.Flags() != script.origin_options().Flags()) {
+  if (origin_options_.Flags() != script->origin_options().Flags()) {
     return false;
   }
   // Compare the two name strings for equality.
-  if (!String::cast(*name).Equals(String::cast(script.name()))) {
+  if (!String::cast(*name)->Equals(String::cast(script->name()))) {
     return false;
   }
 
@@ -273,17 +275,19 @@ bool ScriptCacheKey::MatchesOrigin(Script script) {
   if (!host_defined_options_.ToHandle(&maybe_host_defined_options)) {
     maybe_host_defined_options = isolate_->factory()->empty_fixed_array();
   }
-  FixedArray host_defined_options =
+  Tagged<FixedArray> host_defined_options =
       FixedArray::cast(*maybe_host_defined_options);
-  FixedArray script_options = FixedArray::cast(script.host_defined_options());
-  int length = host_defined_options.length();
-  if (length != script_options.length()) return false;
+  Tagged<FixedArray> script_options =
+      FixedArray::cast(script->host_defined_options());
+  int length = host_defined_options->length();
+  if (length != script_options->length()) return false;
 
   for (int i = 0; i < length; i++) {
     // host-defined options is a v8::PrimitiveArray.
-    DCHECK(host_defined_options.get(i).IsPrimitive());
-    DCHECK(script_options.get(i).IsPrimitive());
-    if (!host_defined_options.get(i).StrictEquals(script_options.get(i))) {
+    DCHECK(IsPrimitive(host_defined_options->get(i)));
+    DCHECK(IsPrimitive(script_options->get(i)));
+    if (!Object::StrictEquals(host_defined_options->get(i),
+                              script_options->get(i))) {
       return false;
     }
   }
@@ -317,25 +321,26 @@ ScriptCacheKey::ScriptCacheKey(Handle<String> source, MaybeHandle<Object> name,
   DCHECK(Smi::IsValid(static_cast<int>(Hash())));
 }
 
-bool ScriptCacheKey::IsMatch(Object other) {
+bool ScriptCacheKey::IsMatch(Tagged<Object> other) {
   DisallowGarbageCollection no_gc;
-  DCHECK(other.IsWeakFixedArray());
-  WeakFixedArray other_array = WeakFixedArray::cast(other);
-  DCHECK_EQ(other_array.length(), kEnd);
+  DCHECK(IsWeakFixedArray(other));
+  Tagged<WeakFixedArray> other_array = WeakFixedArray::cast(other);
+  DCHECK_EQ(other_array->length(), kEnd);
 
   // A hash check can quickly reject many non-matches, even though this step
   // isn't strictly necessary.
   uint32_t other_hash =
-      static_cast<uint32_t>(other_array.Get(kHash).ToSmi().value());
+      static_cast<uint32_t>(other_array->Get(kHash).ToSmi().value());
   if (other_hash != Hash()) return false;
 
-  HeapObject other_script_object;
-  if (!other_array.Get(kWeakScript).GetHeapObjectIfWeak(&other_script_object)) {
+  Tagged<HeapObject> other_script_object;
+  if (!other_array->Get(kWeakScript)
+           .GetHeapObjectIfWeak(&other_script_object)) {
     return false;
   }
-  Script other_script = Script::cast(other_script_object);
-  String other_source = String::cast(other_script.source());
-  return other_source.Equals(*source_) && MatchesOrigin(other_script);
+  Tagged<Script> other_script = Script::cast(other_script_object);
+  Tagged<String> other_source = String::cast(other_script->source());
+  return other_source->Equals(*source_) && MatchesOrigin(other_script);
 }
 
 Handle<Object> ScriptCacheKey::AsHandle(Isolate* isolate,
@@ -343,7 +348,7 @@ Handle<Object> ScriptCacheKey::AsHandle(Isolate* isolate,
   Handle<WeakFixedArray> array = isolate->factory()->NewWeakFixedArray(kEnd);
   // Any SharedFunctionInfo being stored in the script cache should have a
   // Script.
-  DCHECK(shared->script().IsScript());
+  DCHECK(IsScript(shared->script()));
   array->Set(kHash,
              MaybeObject::FromObject(Smi::FromInt(static_cast<int>(Hash()))));
   array->Set(kWeakScript,
@@ -372,7 +377,7 @@ CompilationCacheScriptLookupResult::FromRawObjects(
     result.script_ = handle(raw.first, isolate);
   }
   if (!raw.second.is_null()) {
-    result.is_compiled_scope_ = raw.second.is_compiled_scope(isolate);
+    result.is_compiled_scope_ = raw.second->is_compiled_scope(isolate);
     if (result.is_compiled_scope_.is_compiled()) {
       result.toplevel_sfi_ = handle(raw.second, isolate);
     }
@@ -389,16 +394,16 @@ CompilationCacheScriptLookupResult CompilationCacheTable::LookupScript(
   if (entry.is_not_found()) return {};
 
   DisallowGarbageCollection no_gc;
-  Object key_in_table = table->KeyAt(entry);
-  Script script = Script::cast(WeakFixedArray::cast(key_in_table)
-                                   .Get(ScriptCacheKey::kWeakScript)
-                                   .GetHeapObjectAssumeWeak());
-
-  Object obj = table->PrimaryValueAt(entry);
-  SharedFunctionInfo toplevel_sfi;
-  if (!obj.IsUndefined(isolate)) {
+  Tagged<Object> key_in_table = table->KeyAt(entry);
+  Tagged<Script> script = Script::cast(WeakFixedArray::cast(key_in_table)
+                                           ->Get(ScriptCacheKey::kWeakScript)
+                                           .GetHeapObjectAssumeWeak());
+
+  Tagged<Object> obj = table->PrimaryValueAt(entry);
+  Tagged<SharedFunctionInfo> toplevel_sfi;
+  if (!IsUndefined(obj, isolate)) {
     toplevel_sfi = SharedFunctionInfo::cast(obj);
-    DCHECK_EQ(toplevel_sfi.script(), script);
+    DCHECK_EQ(toplevel_sfi->script(), script);
   }
 
   return CompilationCacheScriptLookupResult::FromRawObjects(
@@ -417,12 +422,12 @@ InfoCellPair CompilationCacheTable::LookupEval(
   InternalIndex entry = table->FindEntry(isolate, &key);
   if (entry.is_not_found()) return empty_result;
 
-  if (!table->KeyAt(entry).IsFixedArray()) return empty_result;
-  Object obj = table->PrimaryValueAt(entry);
-  if (!obj.IsSharedFunctionInfo()) return empty_result;
+  if (!IsFixedArray(table->KeyAt(entry))) return empty_result;
+  Tagged<Object> obj = table->PrimaryValueAt(entry);
+  if (!IsSharedFunctionInfo(obj)) return empty_result;
 
   static_assert(CompilationCacheShape::kEntrySize == 3);
-  FeedbackCell feedback_cell =
+  Tagged<FeedbackCell> feedback_cell =
       SearchLiteralsMap(*table, entry, *native_context);
   return InfoCellPair(isolate, SharedFunctionInfo::cast(obj), feedback_cell);
 }
@@ -446,12 +451,12 @@ Handle<CompilationCacheTable> CompilationCacheTable::EnsureScriptTableCapacity(
   {
     DisallowGarbageCollection no_gc;
     for (InternalIndex entry : cache->IterateEntries()) {
-      Object key;
+      Tagged<Object> key;
       if (!cache->ToKey(isolate, entry, &key)) continue;
       if (WeakFixedArray::cast(key)
-              .Get(ScriptCacheKey::kWeakScript)
+              ->Get(ScriptCacheKey::kWeakScript)
               .IsCleared()) {
-        DCHECK(cache->PrimaryValueAt(entry).IsUndefined());
+        DCHECK(IsUndefined(cache->PrimaryValueAt(entry)));
         cache->RemoveEntry(entry);
       }
     }
@@ -466,7 +471,7 @@ Handle<CompilationCacheTable> CompilationCacheTable::PutScript(
   src = String::Flatten(isolate, src);
   Handle<Script> script = handle(Script::cast(value->script()), isolate);
   MaybeHandle<Object> script_name;
-  if (script->name().IsString(isolate)) {
+  if (IsString(script->name(), isolate)) {
     script_name = handle(script->name(), isolate);
   }
   Handle<FixedArray> host_defined_options(script->host_defined_options(),
@@ -554,7 +559,7 @@ Handle<CompilationCacheTable> CompilationCacheTable::PutRegExp(
   return cache;
 }
 
-void CompilationCacheTable::Remove(Object value) {
+void CompilationCacheTable::Remove(Tagged<Object> value) {
   DisallowGarbageCollection no_gc;
   for (InternalIndex entry : IterateEntries()) {
     if (PrimaryValueAt(entry) == value) {
@@ -565,7 +570,7 @@ void CompilationCacheTable::Remove(Object value) {
 
 void CompilationCacheTable::RemoveEntry(InternalIndex entry) {
   int entry_index = EntryToIndex(entry);
-  Object the_hole_value = GetReadOnlyRoots().the_hole_value();
+  Tagged<Object> the_hole_value = GetReadOnlyRoots().the_hole_value();
   for (int i = 0; i < kEntrySize; i++) {
     NoWriteBarrierSet(*this, entry_index + i, the_hole_value);
   }
diff --git a/deps/v8/src/objects/compilation-cache-table.h b/deps/v8/src/objects/compilation-cache-table.h
index fdd7fb57f0c1a2..9b36b54bff525d 100644
--- a/deps/v8/src/objects/compilation-cache-table.h
+++ b/deps/v8/src/objects/compilation-cache-table.h
@@ -21,7 +21,7 @@ struct ScriptDetails;
 
 class CompilationCacheShape : public BaseShape<HashTableKey*> {
  public:
-  static inline bool IsMatch(HashTableKey* key, Object value) {
+  static inline bool IsMatch(HashTableKey* key, Tagged<Object> value) {
     return key->IsMatch(value);
   }
 
@@ -29,12 +29,14 @@ class CompilationCacheShape : public BaseShape<HashTableKey*> {
     return key->Hash();
   }
 
-  static inline uint32_t RegExpHash(String string, Smi flags);
+  static inline uint32_t RegExpHash(Tagged<String> string, Tagged<Smi> flags);
 
-  static inline uint32_t EvalHash(String source, SharedFunctionInfo shared,
+  static inline uint32_t EvalHash(Tagged<String> source,
+                                  Tagged<SharedFunctionInfo> shared,
                                   LanguageMode language_mode, int position);
 
-  static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
+  static inline uint32_t HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object);
 
   static const int kPrefixSize = 0;
   // An 'entry' is essentially a grouped collection of slots. Entries are used
@@ -48,14 +50,14 @@ class CompilationCacheShape : public BaseShape<HashTableKey*> {
 class InfoCellPair {
  public:
   InfoCellPair() = default;
-  inline InfoCellPair(Isolate* isolate, SharedFunctionInfo shared,
-                      FeedbackCell feedback_cell);
+  inline InfoCellPair(Isolate* isolate, Tagged<SharedFunctionInfo> shared,
+                      Tagged<FeedbackCell> feedback_cell);
 
-  FeedbackCell feedback_cell() const {
+  Tagged<FeedbackCell> feedback_cell() const {
     DCHECK(is_compiled_scope_.is_compiled());
     return feedback_cell_;
   }
-  SharedFunctionInfo shared() const {
+  Tagged<SharedFunctionInfo> shared() const {
     DCHECK(is_compiled_scope_.is_compiled());
     return shared_;
   }
@@ -149,15 +151,15 @@ class CompilationCacheTable
       Isolate* isolate, Handle<CompilationCacheTable> cache, Handle<String> src,
       JSRegExp::Flags flags, Handle<FixedArray> value);
 
-  void Remove(Object value);
+  void Remove(Tagged<Object> value);
   void RemoveEntry(InternalIndex entry);
 
-  inline Object PrimaryValueAt(InternalIndex entry);
-  inline void SetPrimaryValueAt(InternalIndex entry, Object value,
+  inline Tagged<Object> PrimaryValueAt(InternalIndex entry);
+  inline void SetPrimaryValueAt(InternalIndex entry, Tagged<Object> value,
                                 WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline Object EvalFeedbackValueAt(InternalIndex entry);
+  inline Tagged<Object> EvalFeedbackValueAt(InternalIndex entry);
   inline void SetEvalFeedbackValueAt(
-      InternalIndex entry, Object value,
+      InternalIndex entry, Tagged<Object> value,
       WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   // The initial placeholder insertion of the eval cache survives this many GCs.
diff --git a/deps/v8/src/objects/compressed-slots-inl.h b/deps/v8/src/objects/compressed-slots-inl.h
index 4a4e9c8a2da8ae..aefe15d05e3a3f 100644
--- a/deps/v8/src/objects/compressed-slots-inl.h
+++ b/deps/v8/src/objects/compressed-slots-inl.h
@@ -17,77 +17,79 @@ namespace v8::internal {
 // CompressedObjectSlot implementation.
 //
 
-CompressedObjectSlot::CompressedObjectSlot(Object* object)
+CompressedObjectSlot::CompressedObjectSlot(Tagged<Object>* object)
     : SlotBase(reinterpret_cast<Address>(&object->ptr_)) {}
 
-bool CompressedObjectSlot::contains_value(Address raw_value) const {
-  AtomicTagged_t value = AsAtomicTagged::Relaxed_Load(location());
+bool CompressedObjectSlot::contains_map_value(Address raw_value) const {
+  DCHECK(!V8_MAP_PACKING_BOOL);
+  Tagged_t value = *location();
   return static_cast<uint32_t>(value) ==
          static_cast<uint32_t>(static_cast<Tagged_t>(raw_value));
 }
 
-bool CompressedObjectSlot::contains_map_value(Address raw_value) const {
-  // Simply forward to contains_value because map packing is not supported with
-  // pointer compression.
+bool CompressedObjectSlot::Relaxed_ContainsMapValue(Address raw_value) const {
   DCHECK(!V8_MAP_PACKING_BOOL);
-  return contains_value(raw_value);
+  AtomicTagged_t value = AsAtomicTagged::Relaxed_Load(location());
+  return static_cast<uint32_t>(value) ==
+         static_cast<uint32_t>(static_cast<Tagged_t>(raw_value));
 }
 
-Object CompressedObjectSlot::operator*() const {
+Tagged<Object> CompressedObjectSlot::operator*() const {
   Tagged_t value = *location();
   return Object(TCompressionScheme::DecompressTagged(address(), value));
 }
 
-Object CompressedObjectSlot::load(PtrComprCageBase cage_base) const {
+Tagged<Object> CompressedObjectSlot::load(PtrComprCageBase cage_base) const {
   Tagged_t value = *location();
   return Object(TCompressionScheme::DecompressTagged(cage_base, value));
 }
 
-void CompressedObjectSlot::store(Object value) const {
+void CompressedObjectSlot::store(Tagged<Object> value) const {
   *location() = TCompressionScheme::CompressObject(value.ptr());
 }
 
-void CompressedObjectSlot::store_map(Map map) const {
+void CompressedObjectSlot::store_map(Tagged<Map> map) const {
   // Simply forward to store because map packing is not supported with pointer
   // compression.
   DCHECK(!V8_MAP_PACKING_BOOL);
   store(map);
 }
 
-Map CompressedObjectSlot::load_map() const {
+Tagged<Map> CompressedObjectSlot::load_map() const {
   // Simply forward to Relaxed_Load because map packing is not supported with
   // pointer compression.
   DCHECK(!V8_MAP_PACKING_BOOL);
   return Map::unchecked_cast(Relaxed_Load());
 }
 
-Object CompressedObjectSlot::Acquire_Load() const {
+Tagged<Object> CompressedObjectSlot::Acquire_Load() const {
   AtomicTagged_t value = AsAtomicTagged::Acquire_Load(location());
   return Object(TCompressionScheme::DecompressTagged(address(), value));
 }
 
-Object CompressedObjectSlot::Relaxed_Load() const {
+Tagged<Object> CompressedObjectSlot::Relaxed_Load() const {
   AtomicTagged_t value = AsAtomicTagged::Relaxed_Load(location());
   return Object(TCompressionScheme::DecompressTagged(address(), value));
 }
 
-Object CompressedObjectSlot::Relaxed_Load(PtrComprCageBase cage_base) const {
+Tagged<Object> CompressedObjectSlot::Relaxed_Load(
+    PtrComprCageBase cage_base) const {
   AtomicTagged_t value = AsAtomicTagged::Relaxed_Load(location());
   return Object(TCompressionScheme::DecompressTagged(cage_base, value));
 }
 
-void CompressedObjectSlot::Relaxed_Store(Object value) const {
+void CompressedObjectSlot::Relaxed_Store(Tagged<Object> value) const {
   Tagged_t ptr = TCompressionScheme::CompressObject(value.ptr());
   AsAtomicTagged::Relaxed_Store(location(), ptr);
 }
 
-void CompressedObjectSlot::Release_Store(Object value) const {
+void CompressedObjectSlot::Release_Store(Tagged<Object> value) const {
   Tagged_t ptr = TCompressionScheme::CompressObject(value.ptr());
   AsAtomicTagged::Release_Store(location(), ptr);
 }
 
-Object CompressedObjectSlot::Release_CompareAndSwap(Object old,
-                                                    Object target) const {
+Tagged<Object> CompressedObjectSlot::Release_CompareAndSwap(
+    Tagged<Object> old, Tagged<Object> target) const {
   Tagged_t old_ptr = TCompressionScheme::CompressObject(old.ptr());
   Tagged_t target_ptr = TCompressionScheme::CompressObject(target.ptr());
   Tagged_t result =
@@ -157,14 +159,14 @@ void CompressedHeapObjectSlot::store(HeapObjectReference value) const {
   *location() = TCompressionScheme::CompressObject(value.ptr());
 }
 
-HeapObject CompressedHeapObjectSlot::ToHeapObject() const {
+Tagged<HeapObject> CompressedHeapObjectSlot::ToHeapObject() const {
   Tagged_t value = *location();
   DCHECK(HAS_STRONG_HEAP_OBJECT_TAG(value));
   return HeapObject::cast(
       Object(TCompressionScheme::DecompressTagged(address(), value)));
 }
 
-void CompressedHeapObjectSlot::StoreHeapObject(HeapObject value) const {
+void CompressedHeapObjectSlot::StoreHeapObject(Tagged<HeapObject> value) const {
   *location() = TCompressionScheme::CompressObject(value.ptr());
 }
 
@@ -173,26 +175,27 @@ void CompressedHeapObjectSlot::StoreHeapObject(HeapObject value) const {
 //
 
 template <typename CompressionScheme>
-Object OffHeapCompressedObjectSlot<CompressionScheme>::load(
+Tagged<Object> OffHeapCompressedObjectSlot<CompressionScheme>::load(
     PtrComprCageBase cage_base) const {
   Tagged_t value = *TSlotBase::location();
   return Object(CompressionScheme::DecompressTagged(cage_base, value));
 }
 
 template <typename CompressionScheme>
-void OffHeapCompressedObjectSlot<CompressionScheme>::store(Object value) const {
+void OffHeapCompressedObjectSlot<CompressionScheme>::store(
+    Tagged<Object> value) const {
   *TSlotBase::location() = CompressionScheme::CompressObject(value.ptr());
 }
 
 template <typename CompressionScheme>
-Object OffHeapCompressedObjectSlot<CompressionScheme>::Relaxed_Load(
+Tagged<Object> OffHeapCompressedObjectSlot<CompressionScheme>::Relaxed_Load(
     PtrComprCageBase cage_base) const {
   AtomicTagged_t value = AsAtomicTagged::Relaxed_Load(TSlotBase::location());
   return Object(CompressionScheme::DecompressTagged(cage_base, value));
 }
 
 template <typename CompressionScheme>
-Object OffHeapCompressedObjectSlot<CompressionScheme>::Acquire_Load(
+Tagged<Object> OffHeapCompressedObjectSlot<CompressionScheme>::Acquire_Load(
     PtrComprCageBase cage_base) const {
   AtomicTagged_t value = AsAtomicTagged::Acquire_Load(TSlotBase::location());
   return Object(CompressionScheme::DecompressTagged(cage_base, value));
@@ -200,21 +203,21 @@ Object OffHeapCompressedObjectSlot<CompressionScheme>::Acquire_Load(
 
 template <typename CompressionScheme>
 void OffHeapCompressedObjectSlot<CompressionScheme>::Relaxed_Store(
-    Object value) const {
+    Tagged<Object> value) const {
   Tagged_t ptr = CompressionScheme::CompressObject(value.ptr());
   AsAtomicTagged::Relaxed_Store(TSlotBase::location(), ptr);
 }
 
 template <typename CompressionScheme>
 void OffHeapCompressedObjectSlot<CompressionScheme>::Release_Store(
-    Object value) const {
+    Tagged<Object> value) const {
   Tagged_t ptr = CompressionScheme::CompressObject(value.ptr());
   AsAtomicTagged::Release_Store(TSlotBase::location(), ptr);
 }
 
 template <typename CompressionScheme>
 void OffHeapCompressedObjectSlot<CompressionScheme>::Release_CompareAndSwap(
-    Object old, Object target) const {
+    Tagged<Object> old, Tagged<Object> target) const {
   Tagged_t old_ptr = CompressionScheme::CompressObject(old.ptr());
   Tagged_t target_ptr = CompressionScheme::CompressObject(target.ptr());
   AsAtomicTagged::Release_CompareAndSwap(TSlotBase::location(), old_ptr,
diff --git a/deps/v8/src/objects/compressed-slots.h b/deps/v8/src/objects/compressed-slots.h
index fd6d9acf484633..af964d704bf517 100644
--- a/deps/v8/src/objects/compressed-slots.h
+++ b/deps/v8/src/objects/compressed-slots.h
@@ -21,7 +21,7 @@ class V8HeapCompressionScheme;
 class CompressedObjectSlot : public SlotBase<CompressedObjectSlot, Tagged_t> {
  public:
   using TCompressionScheme = V8HeapCompressionScheme;
-  using TObject = Object;
+  using TObject = Tagged<Object>;
   using THeapObjectSlot = CompressedHeapObjectSlot;
 
   static constexpr bool kCanBeWeak = false;
@@ -30,8 +30,8 @@ class CompressedObjectSlot : public SlotBase<CompressedObjectSlot, Tagged_t> {
   explicit CompressedObjectSlot(Address ptr) : SlotBase(ptr) {}
   explicit CompressedObjectSlot(Address* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
-  inline explicit CompressedObjectSlot(Object* object);
-  explicit CompressedObjectSlot(Object const* const* ptr)
+  inline explicit CompressedObjectSlot(Tagged<Object>* object);
+  explicit CompressedObjectSlot(Tagged<Object> const* const* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
   template <typename T>
   explicit CompressedObjectSlot(SlotBase<T, TData, kSlotDataAlignment> slot)
@@ -39,24 +39,25 @@ class CompressedObjectSlot : public SlotBase<CompressedObjectSlot, Tagged_t> {
 
   // Compares memory representation of a value stored in the slot with given
   // raw value without decompression.
-  inline bool contains_value(Address raw_value) const;
   inline bool contains_map_value(Address raw_value) const;
+  inline bool Relaxed_ContainsMapValue(Address raw_value) const;
 
   // TODO(leszeks): Consider deprecating the operator* load, and always pass the
   // Isolate.
-  inline Object operator*() const;
-  inline Object load(PtrComprCageBase cage_base) const;
-  inline void store(Object value) const;
-  inline void store_map(Map map) const;
-
-  inline Map load_map() const;
-
-  inline Object Acquire_Load() const;
-  inline Object Relaxed_Load() const;
-  inline Object Relaxed_Load(PtrComprCageBase cage_base) const;
-  inline void Relaxed_Store(Object value) const;
-  inline void Release_Store(Object value) const;
-  inline Object Release_CompareAndSwap(Object old, Object target) const;
+  inline Tagged<Object> operator*() const;
+  inline Tagged<Object> load(PtrComprCageBase cage_base) const;
+  inline void store(Tagged<Object> value) const;
+  inline void store_map(Tagged<Map> map) const;
+
+  inline Tagged<Map> load_map() const;
+
+  inline Tagged<Object> Acquire_Load() const;
+  inline Tagged<Object> Relaxed_Load() const;
+  inline Tagged<Object> Relaxed_Load(PtrComprCageBase cage_base) const;
+  inline void Relaxed_Store(Tagged<Object> value) const;
+  inline void Release_Store(Tagged<Object> value) const;
+  inline Tagged<Object> Release_CompareAndSwap(Tagged<Object> old,
+                                               Tagged<Object> target) const;
 };
 
 // A CompressedMaybeObjectSlot instance describes a kTaggedSize-sized field
@@ -75,7 +76,7 @@ class CompressedMaybeObjectSlot
 
   CompressedMaybeObjectSlot() : SlotBase(kNullAddress) {}
   explicit CompressedMaybeObjectSlot(Address ptr) : SlotBase(ptr) {}
-  explicit CompressedMaybeObjectSlot(Object* ptr)
+  explicit CompressedMaybeObjectSlot(Tagged<Object>* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
   explicit CompressedMaybeObjectSlot(MaybeObject* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
@@ -108,7 +109,7 @@ class CompressedHeapObjectSlot
 
   CompressedHeapObjectSlot() : SlotBase(kNullAddress) {}
   explicit CompressedHeapObjectSlot(Address ptr) : SlotBase(ptr) {}
-  explicit CompressedHeapObjectSlot(Object* ptr)
+  explicit CompressedHeapObjectSlot(TaggedBase* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
   template <typename T>
   explicit CompressedHeapObjectSlot(SlotBase<T, TData, kSlotDataAlignment> slot)
@@ -118,9 +119,9 @@ class CompressedHeapObjectSlot
   inline HeapObjectReference load(PtrComprCageBase cage_base) const;
   inline void store(HeapObjectReference value) const;
 
-  inline HeapObject ToHeapObject() const;
+  inline Tagged<HeapObject> ToHeapObject() const;
 
-  inline void StoreHeapObject(HeapObject value) const;
+  inline void StoreHeapObject(Tagged<HeapObject> value) const;
 };
 
 // An OffHeapCompressedObjectSlot instance describes a kTaggedSize-sized field
@@ -137,7 +138,7 @@ class OffHeapCompressedObjectSlot
   using TSlotBase =
       SlotBase<OffHeapCompressedObjectSlot<CompressionScheme>, Tagged_t>;
   using TCompressionScheme = CompressionScheme;
-  using TObject = Object;
+  using TObject = Tagged<Object>;
   using THeapObjectSlot = OffHeapCompressedObjectSlot<CompressionScheme>;
 
   static constexpr bool kCanBeWeak = false;
@@ -147,14 +148,15 @@ class OffHeapCompressedObjectSlot
   explicit OffHeapCompressedObjectSlot(const uint32_t* ptr)
       : TSlotBase(reinterpret_cast<Address>(ptr)) {}
 
-  inline Object load(PtrComprCageBase cage_base) const;
-  inline void store(Object value) const;
+  inline Tagged<Object> load(PtrComprCageBase cage_base) const;
+  inline void store(Tagged<Object> value) const;
 
-  inline Object Relaxed_Load(PtrComprCageBase cage_base) const;
-  inline Object Acquire_Load(PtrComprCageBase cage_base) const;
-  inline void Relaxed_Store(Object value) const;
-  inline void Release_Store(Object value) const;
-  inline void Release_CompareAndSwap(Object old, Object target) const;
+  inline Tagged<Object> Relaxed_Load(PtrComprCageBase cage_base) const;
+  inline Tagged<Object> Acquire_Load(PtrComprCageBase cage_base) const;
+  inline void Relaxed_Store(Tagged<Object> value) const;
+  inline void Release_Store(Tagged<Object> value) const;
+  inline void Release_CompareAndSwap(Tagged<Object> old,
+                                     Tagged<Object> target) const;
 };
 
 #endif  // V8_COMPRESS_POINTERS
diff --git a/deps/v8/src/objects/contexts-inl.h b/deps/v8/src/objects/contexts-inl.h
index 4fa5ec90303687..0119cab121562c 100644
--- a/deps/v8/src/objects/contexts-inl.h
+++ b/deps/v8/src/objects/contexts-inl.h
@@ -38,8 +38,8 @@ void ScriptContextTable::set_used(int used, ReleaseStoreTag tag) {
   set(kUsedSlotIndex, Smi::FromInt(used), tag);
 }
 
-ACCESSORS(ScriptContextTable, names_to_context_index, NameToIndexHashTable,
-          kHashTableOffset)
+ACCESSORS(ScriptContextTable, names_to_context_index,
+          Tagged<NameToIndexHashTable>, kHashTableOffset)
 
 // static
 Handle<Context> ScriptContextTable::GetContext(Isolate* isolate,
@@ -48,12 +48,13 @@ Handle<Context> ScriptContextTable::GetContext(Isolate* isolate,
   return handle(table->get_context(i), isolate);
 }
 
-Context ScriptContextTable::get_context(int i) const {
+Tagged<Context> ScriptContextTable::get_context(int i) const {
   DCHECK_LT(i, used(kAcquireLoad));
   return Context::cast(get(i + kFirstContextSlotIndex));
 }
 
-Context ScriptContextTable::get_context(int i, AcquireLoadTag tag) const {
+Tagged<Context> ScriptContextTable::get_context(int i,
+                                                AcquireLoadTag tag) const {
   DCHECK_LT(i, used(kAcquireLoad));
   return Context::cast(get(i + kFirstContextSlotIndex, tag));
 }
@@ -65,19 +66,19 @@ CAST_ACCESSOR(NativeContext)
 
 RELAXED_SMI_ACCESSORS(Context, length, kLengthOffset)
 
-Object Context::get(int index) const {
+Tagged<Object> Context::get(int index) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index);
 }
 
-Object Context::get(PtrComprCageBase cage_base, int index) const {
+Tagged<Object> Context::get(PtrComprCageBase cage_base, int index) const {
   DCHECK_LT(static_cast<unsigned int>(index),
             static_cast<unsigned int>(length(kRelaxedLoad)));
   return TaggedField<Object>::Relaxed_Load(cage_base, *this,
                                            OffsetOfElementAt(index));
 }
 
-void Context::set(int index, Object value, WriteBarrierMode mode) {
+void Context::set(int index, Tagged<Object> value, WriteBarrierMode mode) {
   DCHECK_LT(static_cast<unsigned int>(index),
             static_cast<unsigned int>(length(kRelaxedLoad)));
   const int offset = OffsetOfElementAt(index);
@@ -85,19 +86,19 @@ void Context::set(int index, Object value, WriteBarrierMode mode) {
   CONDITIONAL_WRITE_BARRIER(*this, offset, value, mode);
 }
 
-Object Context::get(int index, AcquireLoadTag tag) const {
+Tagged<Object> Context::get(int index, AcquireLoadTag tag) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index, tag);
 }
 
-Object Context::get(PtrComprCageBase cage_base, int index,
-                    AcquireLoadTag) const {
+Tagged<Object> Context::get(PtrComprCageBase cage_base, int index,
+                            AcquireLoadTag) const {
   DCHECK_LT(static_cast<unsigned int>(index),
             static_cast<unsigned int>(length(kRelaxedLoad)));
   return ACQUIRE_READ_FIELD(*this, OffsetOfElementAt(index));
 }
 
-void Context::set(int index, Object value, WriteBarrierMode mode,
+void Context::set(int index, Tagged<Object> value, WriteBarrierMode mode,
                   ReleaseStoreTag) {
   DCHECK_LT(static_cast<unsigned int>(index),
             static_cast<unsigned int>(length(kRelaxedLoad)));
@@ -106,97 +107,101 @@ void Context::set(int index, Object value, WriteBarrierMode mode,
   CONDITIONAL_WRITE_BARRIER(*this, offset, value, mode);
 }
 
-void NativeContext::set(int index, Object value, WriteBarrierMode mode,
+void NativeContext::set(int index, Tagged<Object> value, WriteBarrierMode mode,
                         ReleaseStoreTag tag) {
   Context::set(index, value, mode, tag);
 }
 
-ACCESSORS(Context, scope_info, ScopeInfo, kScopeInfoOffset)
+ACCESSORS(Context, scope_info, Tagged<ScopeInfo>, kScopeInfoOffset)
 
-Object Context::unchecked_previous() const { return get(PREVIOUS_INDEX); }
+Tagged<Object> Context::unchecked_previous() const {
+  return get(PREVIOUS_INDEX);
+}
 
-Context Context::previous() const {
-  Object result = get(PREVIOUS_INDEX);
+Tagged<Context> Context::previous() const {
+  Tagged<Object> result = get(PREVIOUS_INDEX);
   DCHECK(IsBootstrappingOrValidParentContext(result, *this));
   return Context::unchecked_cast(result);
 }
-void Context::set_previous(Context context, WriteBarrierMode mode) {
+void Context::set_previous(Tagged<Context> context, WriteBarrierMode mode) {
   set(PREVIOUS_INDEX, context, mode);
 }
 
-Object Context::next_context_link() const {
+Tagged<Object> Context::next_context_link() const {
   return get(Context::NEXT_CONTEXT_LINK);
 }
 
 bool Context::has_extension() const {
-  return scope_info().HasContextExtensionSlot() && !extension().IsUndefined();
+  return scope_info()->HasContextExtensionSlot() && !IsUndefined(extension());
 }
 
-HeapObject Context::extension() const {
-  DCHECK(scope_info().HasContextExtensionSlot());
+Tagged<HeapObject> Context::extension() const {
+  DCHECK(scope_info()->HasContextExtensionSlot());
   return HeapObject::cast(get(EXTENSION_INDEX));
 }
 
-NativeContext Context::native_context() const {
-  return this->map().native_context();
+Tagged<NativeContext> Context::native_context() const {
+  return this->map()->native_context();
 }
 
 bool Context::IsFunctionContext() const {
-  return map().instance_type() == FUNCTION_CONTEXT_TYPE;
+  return map()->instance_type() == FUNCTION_CONTEXT_TYPE;
 }
 
 bool Context::IsCatchContext() const {
-  return map().instance_type() == CATCH_CONTEXT_TYPE;
+  return map()->instance_type() == CATCH_CONTEXT_TYPE;
 }
 
 bool Context::IsWithContext() const {
-  return map().instance_type() == WITH_CONTEXT_TYPE;
+  return map()->instance_type() == WITH_CONTEXT_TYPE;
 }
 
 bool Context::IsDebugEvaluateContext() const {
-  return map().instance_type() == DEBUG_EVALUATE_CONTEXT_TYPE;
+  return map()->instance_type() == DEBUG_EVALUATE_CONTEXT_TYPE;
 }
 
 bool Context::IsAwaitContext() const {
-  return map().instance_type() == AWAIT_CONTEXT_TYPE;
+  return map()->instance_type() == AWAIT_CONTEXT_TYPE;
 }
 
 bool Context::IsBlockContext() const {
-  return map().instance_type() == BLOCK_CONTEXT_TYPE;
+  return map()->instance_type() == BLOCK_CONTEXT_TYPE;
 }
 
 bool Context::IsModuleContext() const {
-  return map().instance_type() == MODULE_CONTEXT_TYPE;
+  return map()->instance_type() == MODULE_CONTEXT_TYPE;
 }
 
 bool Context::IsEvalContext() const {
-  return map().instance_type() == EVAL_CONTEXT_TYPE;
+  return map()->instance_type() == EVAL_CONTEXT_TYPE;
 }
 
 bool Context::IsScriptContext() const {
-  return map().instance_type() == SCRIPT_CONTEXT_TYPE;
+  return map()->instance_type() == SCRIPT_CONTEXT_TYPE;
 }
 
-bool Context::HasSameSecurityTokenAs(Context that) const {
-  return this->native_context().security_token() ==
-         that.native_context().security_token();
+bool Context::HasSameSecurityTokenAs(Tagged<Context> that) const {
+  return this->native_context()->security_token() ==
+         that->native_context()->security_token();
 }
 
+bool Context::IsDetached() const { return global_object()->IsDetached(); }
+
 #define NATIVE_CONTEXT_FIELD_ACCESSORS(index, type, name)   \
   void Context::set_##name(type value) {                    \
-    DCHECK(IsNativeContext());                              \
+    DCHECK(IsNativeContext(*this));                         \
     set(index, value, UPDATE_WRITE_BARRIER, kReleaseStore); \
   }                                                         \
   bool Context::is_##name(type value) const {               \
-    DCHECK(IsNativeContext());                              \
+    DCHECK(IsNativeContext(*this));                         \
     return type::cast(get(index)) == value;                 \
   }                                                         \
   type Context::name() const {                              \
-    DCHECK(IsNativeContext());                              \
+    DCHECK(IsNativeContext(*this));                         \
     return type::cast(get(index));                          \
   }                                                         \
   type Context::name(AcquireLoadTag tag) const {            \
-    DCHECK(IsNativeContext());                              \
+    DCHECK(IsNativeContext(*this));                         \
     return type::cast(get(index, tag));                     \
   }
 NATIVE_CONTEXT_FIELDS(NATIVE_CONTEXT_FIELD_ACCESSORS)
@@ -257,12 +262,12 @@ int Context::FunctionMapIndex(LanguageMode language_mode, FunctionKind kind,
 #undef CHECK_FOLLOWS2
 #undef CHECK_FOLLOWS4
 
-Map Context::GetInitialJSArrayMap(ElementsKind kind) const {
-  DCHECK(IsNativeContext());
+Tagged<Map> Context::GetInitialJSArrayMap(ElementsKind kind) const {
+  DCHECK(IsNativeContext(*this));
   if (!IsFastElementsKind(kind)) return Map();
   DisallowGarbageCollection no_gc;
-  Object const initial_js_array_map = get(Context::ArrayMapIndex(kind));
-  DCHECK(!initial_js_array_map.IsUndefined());
+  Tagged<Object> const initial_js_array_map = get(Context::ArrayMapIndex(kind));
+  DCHECK(!IsUndefined(initial_js_array_map));
   return Map::cast(initial_js_array_map);
 }
 
@@ -271,33 +276,34 @@ EXTERNAL_POINTER_ACCESSORS(NativeContext, microtask_queue, MicrotaskQueue*,
                            kNativeContextMicrotaskQueueTag)
 
 void NativeContext::synchronized_set_script_context_table(
-    ScriptContextTable script_context_table) {
+    Tagged<ScriptContextTable> script_context_table) {
   set(SCRIPT_CONTEXT_TABLE_INDEX, script_context_table, UPDATE_WRITE_BARRIER,
       kReleaseStore);
 }
 
-ScriptContextTable NativeContext::synchronized_script_context_table() const {
+Tagged<ScriptContextTable> NativeContext::synchronized_script_context_table()
+    const {
   return ScriptContextTable::cast(
       get(SCRIPT_CONTEXT_TABLE_INDEX, kAcquireLoad));
 }
 
-Map NativeContext::TypedArrayElementsKindToCtorMap(
+Tagged<Map> NativeContext::TypedArrayElementsKindToCtorMap(
     ElementsKind element_kind) const {
   int ctor_index = Context::FIRST_FIXED_TYPED_ARRAY_FUN_INDEX + element_kind -
                    ElementsKind::FIRST_FIXED_TYPED_ARRAY_ELEMENTS_KIND;
-  Map map = Map::cast(JSFunction::cast(get(ctor_index)).initial_map());
-  DCHECK_EQ(map.elements_kind(), element_kind);
+  Tagged<Map> map = Map::cast(JSFunction::cast(get(ctor_index))->initial_map());
+  DCHECK_EQ(map->elements_kind(), element_kind);
   DCHECK(InstanceTypeChecker::IsJSTypedArray(map));
   return map;
 }
 
-Map NativeContext::TypedArrayElementsKindToRabGsabCtorMap(
+Tagged<Map> NativeContext::TypedArrayElementsKindToRabGsabCtorMap(
     ElementsKind element_kind) const {
   int ctor_index = Context::FIRST_RAB_GSAB_TYPED_ARRAY_MAP_INDEX +
                    element_kind -
                    ElementsKind::FIRST_FIXED_TYPED_ARRAY_ELEMENTS_KIND;
-  Map map = Map::cast(get(ctor_index));
-  DCHECK_EQ(map.elements_kind(),
+  Tagged<Map> map = Map::cast(get(ctor_index));
+  DCHECK_EQ(map->elements_kind(),
             GetCorrespondingRabGsabElementsKind(element_kind));
   DCHECK(InstanceTypeChecker::IsJSTypedArray(map));
   return map;
diff --git a/deps/v8/src/objects/contexts.cc b/deps/v8/src/objects/contexts.cc
index 6ff730cd7d641a..d9c76f260b5cb9 100644
--- a/deps/v8/src/objects/contexts.cc
+++ b/deps/v8/src/objects/contexts.cc
@@ -64,10 +64,10 @@ Handle<ScriptContextTable> ScriptContextTable::Extend(
 }
 
 void Context::Initialize(Isolate* isolate) {
-  ScopeInfo scope_info = this->scope_info();
-  int header = scope_info.ContextHeaderLength();
-  for (int var = 0; var < scope_info.ContextLocalCount(); var++) {
-    if (scope_info.ContextLocalInitFlag(var) == kNeedsInitialization) {
+  Tagged<ScopeInfo> scope_info = this->scope_info();
+  int header = scope_info->ContextHeaderLength();
+  for (int var = 0; var < scope_info->ContextLocalCount(); var++) {
+    if (scope_info->ContextLocalInitFlag(var) == kNeedsInitialization) {
       set(header + var, ReadOnlyRoots(isolate).the_hole_value());
     }
   }
@@ -76,13 +76,13 @@ void Context::Initialize(Isolate* isolate) {
 bool ScriptContextTable::Lookup(Handle<String> name,
                                 VariableLookupResult* result) {
   DisallowGarbageCollection no_gc;
-  int index = names_to_context_index().Lookup(name);
+  int index = names_to_context_index()->Lookup(name);
   if (index == -1) return false;
   DCHECK_LE(0, index);
   DCHECK_LT(index, used(kAcquireLoad));
-  Context context = get_context(index);
-  DCHECK(context.IsScriptContext());
-  int slot_index = context.scope_info().ContextSlotIndex(name, result);
+  Tagged<Context> context = get_context(index);
+  DCHECK(context->IsScriptContext());
+  int slot_index = context->scope_info()->ContextSlotIndex(name, result);
   if (slot_index >= 0) {
     result->context_index = index;
     result->slot_index = slot_index;
@@ -92,73 +92,73 @@ bool ScriptContextTable::Lookup(Handle<String> name,
 }
 
 bool Context::is_declaration_context() const {
-  if (IsFunctionContext() || IsNativeContext() || IsScriptContext() ||
+  if (IsFunctionContext() || IsNativeContext(*this) || IsScriptContext() ||
       IsModuleContext()) {
     return true;
   }
   if (IsEvalContext()) {
-    return scope_info().language_mode() == LanguageMode::kStrict;
+    return scope_info()->language_mode() == LanguageMode::kStrict;
   }
   if (!IsBlockContext()) return false;
-  return scope_info().is_declaration_scope();
+  return scope_info()->is_declaration_scope();
 }
 
-Context Context::declaration_context() const {
-  Context current = *this;
-  while (!current.is_declaration_context()) {
-    current = current.previous();
+Tagged<Context> Context::declaration_context() const {
+  Tagged<Context> current = *this;
+  while (!current->is_declaration_context()) {
+    current = current->previous();
   }
   return current;
 }
 
-Context Context::closure_context() const {
-  Context current = *this;
-  while (!current.IsFunctionContext() && !current.IsScriptContext() &&
-         !current.IsModuleContext() && !current.IsNativeContext() &&
-         !current.IsEvalContext()) {
-    current = current.previous();
+Tagged<Context> Context::closure_context() const {
+  Tagged<Context> current = *this;
+  while (!current->IsFunctionContext() && !current->IsScriptContext() &&
+         !current->IsModuleContext() && !IsNativeContext(current) &&
+         !current->IsEvalContext()) {
+    current = current->previous();
   }
   return current;
 }
 
-JSObject Context::extension_object() const {
-  DCHECK(IsNativeContext() || IsFunctionContext() || IsBlockContext() ||
+Tagged<JSObject> Context::extension_object() const {
+  DCHECK(IsNativeContext(*this) || IsFunctionContext() || IsBlockContext() ||
          IsEvalContext() || IsCatchContext());
-  HeapObject object = extension();
-  if (object.IsUndefined()) return JSObject();
-  DCHECK(object.IsJSContextExtensionObject() ||
-         (IsNativeContext() && object.IsJSGlobalObject()));
+  Tagged<HeapObject> object = extension();
+  if (IsUndefined(object)) return JSObject();
+  DCHECK(IsJSContextExtensionObject(object) ||
+         (IsNativeContext(*this) && IsJSGlobalObject(object)));
   return JSObject::cast(object);
 }
 
-JSReceiver Context::extension_receiver() const {
-  DCHECK(IsNativeContext() || IsWithContext() || IsEvalContext() ||
+Tagged<JSReceiver> Context::extension_receiver() const {
+  DCHECK(IsNativeContext(*this) || IsWithContext() || IsEvalContext() ||
          IsFunctionContext() || IsBlockContext());
   return IsWithContext() ? JSReceiver::cast(extension()) : extension_object();
 }
 
-SourceTextModule Context::module() const {
-  Context current = *this;
-  while (!current.IsModuleContext()) {
-    current = current.previous();
+Tagged<SourceTextModule> Context::module() const {
+  Tagged<Context> current = *this;
+  while (!current->IsModuleContext()) {
+    current = current->previous();
   }
-  return SourceTextModule::cast(current.extension());
+  return SourceTextModule::cast(current->extension());
 }
 
-JSGlobalObject Context::global_object() const {
-  return JSGlobalObject::cast(native_context().extension());
+Tagged<JSGlobalObject> Context::global_object() const {
+  return JSGlobalObject::cast(native_context()->extension());
 }
 
-Context Context::script_context() const {
-  Context current = *this;
-  while (!current.IsScriptContext()) {
-    current = current.previous();
+Tagged<Context> Context::script_context() const {
+  Tagged<Context> current = *this;
+  while (!current->IsScriptContext()) {
+    current = current->previous();
   }
   return current;
 }
 
-JSGlobalProxy Context::global_proxy() const {
-  return native_context().global_proxy_object();
+Tagged<JSGlobalProxy> Context::global_proxy() const {
+  return native_context()->global_proxy_object();
 }
 
 /**
@@ -178,14 +178,14 @@ static Maybe<bool> UnscopableLookup(LookupIterator* it, bool is_with_context) {
                               Handle<JSReceiver>::cast(it->GetReceiver()),
                               isolate->factory()->unscopables_symbol()),
       Nothing<bool>());
-  if (!unscopables->IsJSReceiver()) return Just(true);
+  if (!IsJSReceiver(*unscopables)) return Just(true);
   Handle<Object> blocklist;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, blocklist,
       JSReceiver::GetProperty(isolate, Handle<JSReceiver>::cast(unscopables),
                               it->name()),
       Nothing<bool>());
-  return Just(!blocklist->BooleanValue(isolate));
+  return Just(!Object::BooleanValue(*blocklist, isolate));
 }
 
 static PropertyAttributes GetAttributesForMode(VariableMode mode) {
@@ -214,7 +214,7 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
 
   if (v8_flags.trace_contexts) {
     PrintF("Context::Lookup(");
-    name->ShortPrint();
+    ShortPrint(*name);
     PrintF(")\n");
   }
 
@@ -223,30 +223,31 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
       PrintF(" - looking in context %p",
              reinterpret_cast<void*>(context->ptr()));
       if (context->IsScriptContext()) PrintF(" (script context)");
-      if (context->IsNativeContext()) PrintF(" (native context)");
+      if (IsNativeContext(*context)) PrintF(" (native context)");
       if (context->IsDebugEvaluateContext()) PrintF(" (debug context)");
       PrintF("\n");
     }
 
     // 1. Check global objects, subjects of with, and extension objects.
     DCHECK_IMPLIES(context->IsEvalContext() && context->has_extension(),
-                   context->extension().IsTheHole(isolate));
-    if ((context->IsNativeContext() || context->IsWithContext() ||
+                   IsTheHole(context->extension(), isolate));
+    if ((IsNativeContext(*context) || context->IsWithContext() ||
          context->IsFunctionContext() || context->IsBlockContext()) &&
         context->has_extension() && !context->extension_receiver().is_null()) {
       Handle<JSReceiver> object(context->extension_receiver(), isolate);
 
-      if (context->IsNativeContext()) {
+      if (IsNativeContext(*context)) {
         DisallowGarbageCollection no_gc;
         if (v8_flags.trace_contexts) {
           PrintF(" - trying other script contexts\n");
         }
         // Try other script contexts.
-        ScriptContextTable script_contexts =
-            context->global_object().native_context().script_context_table();
+        Tagged<ScriptContextTable> script_contexts =
+            context->native_context()->script_context_table();
         VariableLookupResult r;
-        if (script_contexts.Lookup(name, &r)) {
-          Context script_context = script_contexts.get_context(r.context_index);
+        if (script_contexts->Lookup(name, &r)) {
+          Tagged<Context> script_context =
+              script_contexts->get_context(r.context_index);
           if (v8_flags.trace_contexts) {
             PrintF("=> found property in script context %d: %p\n",
                    r.context_index,
@@ -265,7 +266,7 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
       // to only do a local lookup for context extension objects.
       Maybe<PropertyAttributes> maybe = Nothing<PropertyAttributes>();
       if ((flags & FOLLOW_PROTOTYPE_CHAIN) == 0 ||
-          object->IsJSContextExtensionObject()) {
+          IsJSContextExtensionObject(*object)) {
         maybe = JSReceiver::GetOwnPropertyAttributes(object, name);
       } else {
         // A with context will never bind "this", but debug-eval may look into
@@ -311,9 +312,9 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
       DisallowGarbageCollection no_gc;
       // Use serialized scope information of functions and blocks to search
       // for the context index.
-      ScopeInfo scope_info = context->scope_info();
+      Tagged<ScopeInfo> scope_info = context->scope_info();
       VariableLookupResult lookup_result;
-      int slot_index = scope_info.ContextSlotIndex(name, &lookup_result);
+      int slot_index = scope_info->ContextSlotIndex(name, &lookup_result);
       DCHECK(slot_index < 0 || slot_index >= MIN_CONTEXT_SLOTS);
       if (slot_index >= 0) {
         // Re-direct lookup to the ScriptContextTable in case we find a hole in
@@ -321,8 +322,8 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
         // script-level let bindings. The value itself is stored in the script
         // context of the first script that declared a variable, all other
         // script contexts will contain 'the hole' for that particular name.
-        if (scope_info.IsReplModeScope() &&
-            context->get(slot_index).IsTheHole(isolate)) {
+        if (scope_info->IsReplModeScope() &&
+            IsTheHole(context->get(slot_index), isolate)) {
           context = Handle<Context>(context->previous(), isolate);
           continue;
         }
@@ -342,7 +343,7 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
       // only the function name variable. It's conceptually (and spec-wise)
       // in an outer scope of the function's declaration scope.
       if (follow_context_chain && context->IsFunctionContext()) {
-        int function_index = scope_info.FunctionContextSlotIndex(*name);
+        int function_index = scope_info->FunctionContextSlotIndex(*name);
         if (function_index >= 0) {
           if (v8_flags.trace_contexts) {
             PrintF("=> found intermediate function in context slot %d\n",
@@ -353,7 +354,7 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
           *init_flag = kCreatedInitialized;
           *variable_mode = VariableMode::kConst;
           if (is_sloppy_function_name != nullptr &&
-              is_sloppy(scope_info.language_mode())) {
+              is_sloppy(scope_info->language_mode())) {
             *is_sloppy_function_name = true;
           }
           return context;
@@ -366,7 +367,7 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
         InitializationFlag flag;
         MaybeAssignedFlag maybe_assigned_flag;
         int cell_index =
-            scope_info.ModuleIndex(*name, &mode, &flag, &maybe_assigned_flag);
+            scope_info->ModuleIndex(*name, &mode, &flag, &maybe_assigned_flag);
         if (cell_index != 0) {
           if (v8_flags.trace_contexts) {
             PrintF("=> found in module imports or exports\n");
@@ -385,8 +386,8 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
       has_seen_debug_evaluate_context = true;
 
       // Check materialized locals.
-      Object ext = context->get(EXTENSION_INDEX);
-      if (ext.IsJSReceiver()) {
+      Tagged<Object> ext = context->get(EXTENSION_INDEX);
+      if (IsJSReceiver(ext)) {
         Handle<JSReceiver> extension(JSReceiver::cast(ext), isolate);
         LookupIterator it(isolate, extension, name, extension);
         Maybe<bool> found = JSReceiver::HasProperty(&it);
@@ -397,8 +398,8 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
       }
 
       // Check the original context, but do not follow its context chain.
-      Object obj = context->get(WRAPPED_CONTEXT_INDEX);
-      if (obj.IsContext()) {
+      Tagged<Object> obj = context->get(WRAPPED_CONTEXT_INDEX);
+      if (IsContext(obj)) {
         Handle<Context> wrapped_context(Context::cast(obj), isolate);
         Handle<Object> result =
             Context::Lookup(wrapped_context, name, DONT_FOLLOW_CHAINS, index,
@@ -408,7 +409,7 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
     }
 
     // 3. Prepare to continue with the previous (next outermost) context.
-    if (context->IsNativeContext()) break;
+    if (IsNativeContext(*context)) break;
 
     // In case we saw any DebugEvaluateContext, we'll need to check the block
     // list before we can advance to properly "shadow" stack-allocated
@@ -417,12 +418,12 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
     // "wrapped" context lookup for DebugEvaluateContexts. In that case
     // `has_seen_debug_evaluate_context` will always be false.
     if (has_seen_debug_evaluate_context &&
-        isolate->heap()->locals_block_list_cache().IsEphemeronHashTable()) {
+        IsEphemeronHashTable(isolate->heap()->locals_block_list_cache())) {
       Handle<ScopeInfo> scope_info = handle(context->scope_info(), isolate);
-      Object maybe_outer_block_list =
+      Tagged<Object> maybe_outer_block_list =
           isolate->LocalsBlockListCacheGet(scope_info);
-      if (maybe_outer_block_list.IsStringSet() &&
-          StringSet::cast(maybe_outer_block_list).Has(isolate, name)) {
+      if (IsStringSet(maybe_outer_block_list) &&
+          StringSet::cast(maybe_outer_block_list)->Has(isolate, name)) {
         if (v8_flags.trace_contexts) {
           PrintF(" - name is blocklisted. Aborting.\n");
         }
@@ -439,14 +440,14 @@ Handle<Object> Context::Lookup(Handle<Context> context, Handle<String> name,
   return Handle<Object>::null();
 }
 
-bool NativeContext::HasTemplateLiteralObject(JSArray array) {
-  return array.map() == js_array_template_literal_object_map();
+bool NativeContext::HasTemplateLiteralObject(Tagged<JSArray> array) {
+  return array->map() == js_array_template_literal_object_map();
 }
 
 Handle<Object> Context::ErrorMessageForCodeGenerationFromStrings() {
   Isolate* isolate = GetIsolate();
   Handle<Object> result(error_message_for_code_gen_from_strings(), isolate);
-  if (!result->IsUndefined(isolate)) return result;
+  if (!IsUndefined(*result, isolate)) return result;
   return isolate->factory()->NewStringFromStaticChars(
       "Code generation from strings disallowed for this context");
 }
@@ -454,7 +455,7 @@ Handle<Object> Context::ErrorMessageForCodeGenerationFromStrings() {
 Handle<Object> Context::ErrorMessageForWasmCodeGeneration() {
   Isolate* isolate = GetIsolate();
   Handle<Object> result(error_message_for_wasm_code_gen(), isolate);
-  if (!result->IsUndefined(isolate)) return result;
+  if (!IsUndefined(*result, isolate)) return result;
   return isolate->factory()->NewStringFromStaticChars(
       "Wasm code generation disallowed by embedder");
 }
@@ -490,36 +491,36 @@ namespace {
 // TODO(v8:12298): Fix js-context-specialization cctests to set up full
 // native contexts instead of using dummy internalized strings as
 // extensions.
-bool IsContexExtensionTestObject(HeapObject extension) {
-  return extension.IsInternalizedString() &&
-         String::cast(extension).length() == 1;
+bool IsContexExtensionTestObject(Tagged<HeapObject> extension) {
+  return IsInternalizedString(extension) &&
+         String::cast(extension)->length() == 1;
 }
 }  // namespace
 
-void Context::VerifyExtensionSlot(HeapObject extension) {
-  CHECK(scope_info().HasContextExtensionSlot());
+void Context::VerifyExtensionSlot(Tagged<HeapObject> extension) {
+  CHECK(scope_info()->HasContextExtensionSlot());
   // Early exit for potentially uninitialized contexfts.
-  if (extension.IsUndefined()) return;
-  if (extension.IsJSContextExtensionObject()) {
-    CHECK((IsBlockContext() && scope_info().is_declaration_scope()) ||
+  if (IsUndefined(extension)) return;
+  if (IsJSContextExtensionObject(extension)) {
+    CHECK((IsBlockContext() && scope_info()->is_declaration_scope()) ||
           IsFunctionContext());
   } else if (IsModuleContext()) {
-    CHECK(extension.IsSourceTextModule());
+    CHECK(IsSourceTextModule(extension));
   } else if (IsDebugEvaluateContext() || IsWithContext()) {
-    CHECK(extension.IsJSReceiver() ||
+    CHECK(IsJSReceiver(extension) ||
           (IsWithContext() && IsContexExtensionTestObject(extension)));
-  } else if (IsNativeContext()) {
-    CHECK(extension.IsJSGlobalObject() ||
+  } else if (IsNativeContext(*this)) {
+    CHECK(IsJSGlobalObject(extension) ||
           IsContexExtensionTestObject(extension));
   } else if (IsScriptContext()) {
     // Host-defined options can be stored on the context for classic scripts.
-    CHECK(extension.IsFixedArray());
+    CHECK(IsFixedArray(extension));
   }
 }
 #endif  // VERIFY_HEAP
 
-void Context::set_extension(HeapObject object, WriteBarrierMode mode) {
-  DCHECK(scope_info().HasContextExtensionSlot());
+void Context::set_extension(Tagged<HeapObject> object, WriteBarrierMode mode) {
+  DCHECK(scope_info()->HasContextExtensionSlot());
 #ifdef VERIFY_HEAP
   if (v8_flags.verify_heap) VerifyExtensionSlot(object);
 #endif
@@ -528,15 +529,15 @@ void Context::set_extension(HeapObject object, WriteBarrierMode mode) {
 
 #ifdef DEBUG
 
-bool Context::IsBootstrappingOrValidParentContext(Object object,
-                                                  Context child) {
+bool Context::IsBootstrappingOrValidParentContext(Tagged<Object> object,
+                                                  Tagged<Context> child) {
   // During bootstrapping we allow all objects to pass as
   // contexts. This is necessary to fix circular dependencies.
-  if (child.GetIsolate()->bootstrapper()->IsActive()) return true;
-  if (!object.IsContext()) return false;
-  Context context = Context::cast(object);
-  return context.IsNativeContext() || context.IsScriptContext() ||
-         context.IsModuleContext() || !child.IsModuleContext();
+  if (child->GetIsolate()->bootstrapper()->IsActive()) return true;
+  if (!IsContext(object)) return false;
+  Tagged<Context> context = Context::cast(object);
+  return IsNativeContext(context) || context->IsScriptContext() ||
+         context->IsModuleContext() || !child->IsModuleContext();
 }
 
 #endif
@@ -595,7 +596,7 @@ void NativeContext::RunPromiseHook(PromiseHookType type,
   }
 
   Handle<Object> hook(isolate->native_context()->get(contextSlot), isolate);
-  if (hook->IsUndefined()) return;
+  if (IsUndefined(*hook)) return;
 
   int argc = type == PromiseHookType::kInit ? 2 : 1;
   Handle<Object> argv[2] = {
diff --git a/deps/v8/src/objects/contexts.h b/deps/v8/src/objects/contexts.h
index 0b4760e1a45c98..cadf5e946ae4ee 100644
--- a/deps/v8/src/objects/contexts.h
+++ b/deps/v8/src/objects/contexts.h
@@ -94,7 +94,6 @@ enum ContextLookupFlags {
   V(ASYNC_FUNCTION_OBJECT_MAP_INDEX, Map, async_function_object_map)           \
   V(ASYNC_GENERATOR_FUNCTION_FUNCTION_INDEX, JSFunction,                       \
     async_generator_function_function)                                         \
-  V(ATOMICS_OBJECT, JSObject, atomics_object)                                  \
   V(BIGINT_FUNCTION_INDEX, JSFunction, bigint_function)                        \
   V(BOOLEAN_FUNCTION_INDEX, JSFunction, boolean_function)                      \
   V(BOUND_FUNCTION_WITH_CONSTRUCTOR_MAP_INDEX, Map,                            \
@@ -173,6 +172,7 @@ enum ContextLookupFlags {
   V(ITERATOR_MAP_HELPER_MAP_INDEX, Map, iterator_map_helper_map)               \
   V(ITERATOR_TAKE_HELPER_MAP_INDEX, Map, iterator_take_helper_map)             \
   V(ITERATOR_DROP_HELPER_MAP_INDEX, Map, iterator_drop_helper_map)             \
+  V(ITERATOR_FLAT_MAP_HELPER_MAP_INDEX, Map, iterator_flatMap_helper_map)      \
   V(ITERATOR_FUNCTION_INDEX, JSFunction, iterator_function)                    \
   V(VALID_ITERATOR_WRAPPER_MAP_INDEX, Map, valid_iterator_wrapper_map)         \
   V(ITERATOR_RESULT_MAP_INDEX, Map, iterator_result_map)                       \
@@ -188,8 +188,6 @@ enum ContextLookupFlags {
     js_array_holey_double_elements_map)                                        \
   V(JS_ARRAY_TEMPLATE_LITERAL_OBJECT_MAP, Map,                                 \
     js_array_template_literal_object_map)                                      \
-  V(JS_ATOMICS_CONDITION_MAP, Map, js_atomics_condition_map)                   \
-  V(JS_ATOMICS_MUTEX_MAP, Map, js_atomics_mutex_map)                           \
   V(JS_MAP_FUN_INDEX, JSFunction, js_map_fun)                                  \
   V(JS_MAP_MAP_INDEX, Map, js_map_map)                                         \
   V(JS_MODULE_NAMESPACE_MAP, Map, js_module_namespace_map)                     \
@@ -221,6 +219,8 @@ enum ContextLookupFlags {
   V(JS_TEMPORAL_ZONED_DATE_TIME_FUNCTION_INDEX, JSFunction,                    \
     temporal_zoned_date_time_function)                                         \
   V(JSON_OBJECT, JSObject, json_object)                                        \
+  V(PROMISE_WITHRESOLVERS_RESULT_MAP_INDEX, Map,                               \
+    promise_withresolvers_result_map)                                          \
   V(TEMPORAL_INSTANT_FIXED_ARRAY_FROM_ITERABLE_FUNCTION_INDEX, JSFunction,     \
     temporal_instant_fixed_array_from_iterable)                                \
   V(STRING_FIXED_ARRAY_FROM_ITERABLE_FUNCTION_INDEX, JSFunction,               \
@@ -244,7 +244,6 @@ enum ContextLookupFlags {
   V(MATH_RANDOM_INDEX_INDEX, Smi, math_random_index)                           \
   V(MATH_RANDOM_STATE_INDEX, ByteArray, math_random_state)                     \
   V(MATH_RANDOM_CACHE_INDEX, FixedDoubleArray, math_random_cache)              \
-  V(MESSAGE_LISTENERS_INDEX, TemplateList, message_listeners)                  \
   V(NORMALIZED_MAP_CACHE_INDEX, Object, normalized_map_cache)                  \
   V(NUMBER_FUNCTION_INDEX, JSFunction, number_function)                        \
   V(OBJECT_FUNCTION_INDEX, JSFunction, object_function)                        \
@@ -329,6 +328,7 @@ enum ContextLookupFlags {
   V(WASM_EXCEPTION_CONSTRUCTOR_INDEX, JSFunction, wasm_exception_constructor)  \
   V(WASM_GLOBAL_CONSTRUCTOR_INDEX, JSFunction, wasm_global_constructor)        \
   V(WASM_INSTANCE_CONSTRUCTOR_INDEX, JSFunction, wasm_instance_constructor)    \
+  V(WASM_JS_TAG_INDEX, JSObject, wasm_js_tag)                                  \
   V(WASM_MEMORY_CONSTRUCTOR_INDEX, JSFunction, wasm_memory_constructor)        \
   V(WASM_MODULE_CONSTRUCTOR_INDEX, JSFunction, wasm_module_constructor)        \
   V(WASM_TABLE_CONSTRUCTOR_INDEX, JSFunction, wasm_table_constructor)          \
@@ -382,7 +382,9 @@ enum ContextLookupFlags {
   V(WEAKMAP_DELETE_INDEX, JSFunction, weakmap_delete)                          \
   V(WEAKSET_ADD_INDEX, JSFunction, weakset_add)                                \
   V(WRAPPED_FUNCTION_MAP_INDEX, Map, wrapped_function_map)                     \
-  V(RETAINED_MAPS, Object, retained_maps)
+  V(RETAINED_MAPS, Object, retained_maps)                                      \
+  V(SHARED_SPACE_JS_OBJECT_HAS_INSTANCE_INDEX, JSFunction,                     \
+    shared_space_js_object_has_instance)
 
 #include "torque-generated/src/objects/contexts-tq.inc"
 
@@ -402,10 +404,10 @@ class ScriptContextTable : public FixedArray {
   static inline Handle<Context> GetContext(Isolate* isolate,
                                            Handle<ScriptContextTable> table,
                                            int i);
-  inline Context get_context(int i) const;
-  inline Context get_context(int i, AcquireLoadTag tag) const;
+  inline Tagged<Context> get_context(int i) const;
+  inline Tagged<Context> get_context(int i, AcquireLoadTag tag) const;
 
-  DECL_ACCESSORS(names_to_context_index, NameToIndexHashTable)
+  DECL_ACCESSORS(names_to_context_index, Tagged<NameToIndexHashTable>)
 
   // Adds local names from `script_context` to the hash table.
   static void AddLocalNamesFromContext(
@@ -493,15 +495,15 @@ class Context : public TorqueGeneratedContext<Context, HeapObject> {
   // Setter and getter for elements.
   // Note the plain accessors use relaxed semantics.
   // TODO(jgruber): Make that explicit through tags.
-  V8_INLINE Object get(int index) const;
-  V8_INLINE Object get(PtrComprCageBase cage_base, int index) const;
-  V8_INLINE void set(int index, Object value,
+  V8_INLINE Tagged<Object> get(int index) const;
+  V8_INLINE Tagged<Object> get(PtrComprCageBase cage_base, int index) const;
+  V8_INLINE void set(int index, Tagged<Object> value,
                      WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
   // Accessors with acquire-release semantics.
-  V8_INLINE Object get(int index, AcquireLoadTag) const;
-  V8_INLINE Object get(PtrComprCageBase cage_base, int index,
-                       AcquireLoadTag) const;
-  V8_INLINE void set(int index, Object value, WriteBarrierMode mode,
+  V8_INLINE Tagged<Object> get(int index, AcquireLoadTag) const;
+  V8_INLINE Tagged<Object> get(PtrComprCageBase cage_base, int index,
+                               AcquireLoadTag) const;
+  V8_INLINE void set(int index, Tagged<Object> value, WriteBarrierMode mode,
                      ReleaseStoreTag);
 
   static const int kScopeInfoOffset = kElementsOffset;
@@ -591,43 +593,44 @@ class Context : public TorqueGeneratedContext<Context, HeapObject> {
   static const int kInvalidContext = 1;
 
   // Direct slot access.
-  DECL_ACCESSORS(scope_info, ScopeInfo)
+  DECL_ACCESSORS(scope_info, Tagged<ScopeInfo>)
 
-  inline Object unchecked_previous() const;
-  inline Context previous() const;
+  inline Tagged<Object> unchecked_previous() const;
+  inline Tagged<Context> previous() const;
 
-  inline Object next_context_link() const;
+  inline Tagged<Object> next_context_link() const;
 
   inline bool has_extension() const;
-  inline HeapObject extension() const;
+  inline Tagged<HeapObject> extension() const;
   V8_EXPORT_PRIVATE void set_extension(
-      HeapObject object, WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  JSObject extension_object() const;
-  JSReceiver extension_receiver() const;
+      Tagged<HeapObject> object, WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
+  Tagged<JSObject> extension_object() const;
+  Tagged<JSReceiver> extension_receiver() const;
 
   // Find the module context (assuming there is one) and return the associated
   // module object.
-  SourceTextModule module() const;
+  Tagged<SourceTextModule> module() const;
 
   // Get the context where var declarations will be hoisted to, which
   // may be the context itself.
-  Context declaration_context() const;
+  Tagged<Context> declaration_context() const;
   bool is_declaration_context() const;
 
   // Get the next closure's context on the context chain.
-  Context closure_context() const;
+  Tagged<Context> closure_context() const;
 
   // Returns a JSGlobalProxy object or null.
-  V8_EXPORT_PRIVATE JSGlobalProxy global_proxy() const;
+  V8_EXPORT_PRIVATE Tagged<JSGlobalProxy> global_proxy() const;
 
   // Get the JSGlobalObject object.
-  V8_EXPORT_PRIVATE JSGlobalObject global_object() const;
+  V8_EXPORT_PRIVATE Tagged<JSGlobalObject> global_object() const;
 
   // Get the script context by traversing the context chain.
-  Context script_context() const;
+  Tagged<Context> script_context() const;
 
   // Compute the native context.
-  inline NativeContext native_context() const;
+  inline Tagged<NativeContext> native_context() const;
+  inline bool IsDetached() const;
 
   // Predicates for context types.  IsNativeContext is already defined on
   // Object.
@@ -641,7 +644,7 @@ class Context : public TorqueGeneratedContext<Context, HeapObject> {
   inline bool IsEvalContext() const;
   inline bool IsScriptContext() const;
 
-  inline bool HasSameSecurityTokenAs(Context that) const;
+  inline bool HasSameSecurityTokenAs(Tagged<Context> that) const;
 
   Handle<Object> ErrorMessageForCodeGenerationFromStrings();
   Handle<Object> ErrorMessageForWasmCodeGeneration();
@@ -693,7 +696,7 @@ class Context : public TorqueGeneratedContext<Context, HeapObject> {
     return int{elements_kind} + FIRST_JS_ARRAY_MAP_SLOT;
   }
 
-  inline Map GetInitialJSArrayMap(ElementsKind kind) const;
+  inline Tagged<Map> GetInitialJSArrayMap(ElementsKind kind) const;
 
   static const int kNotFound = -1;
 
@@ -704,17 +707,18 @@ class Context : public TorqueGeneratedContext<Context, HeapObject> {
   class BodyDescriptor;
 
 #ifdef VERIFY_HEAP
-  V8_EXPORT_PRIVATE void VerifyExtensionSlot(HeapObject extension);
+  V8_EXPORT_PRIVATE void VerifyExtensionSlot(Tagged<HeapObject> extension);
 #endif
 
  private:
 #ifdef DEBUG
   // Bootstrapping-aware type checks.
-  static bool IsBootstrappingOrValidParentContext(Object object, Context kid);
+  static bool IsBootstrappingOrValidParentContext(Tagged<Object> object,
+                                                  Tagged<Context> kid);
 #endif
 
   friend class Factory;
-  inline void set_previous(Context context,
+  inline void set_previous(Tagged<Context> context,
                            WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   TQ_OBJECT_CONSTRUCTORS(Context)
@@ -730,16 +734,16 @@ class NativeContext : public Context {
   // thus we hide the non-atomic setter. Note this doesn't protect fully since
   // one could still use Context::set and/or write directly using offsets (e.g.
   // from CSA/Torque).
-  void set(int index, Object value, WriteBarrierMode mode) = delete;
-  V8_INLINE void set(int index, Object value, WriteBarrierMode mode,
+  void set(int index, Tagged<Object> value, WriteBarrierMode mode) = delete;
+  V8_INLINE void set(int index, Tagged<Object> value, WriteBarrierMode mode,
                      ReleaseStoreTag);
 
   // [microtask_queue]: pointer to the MicrotaskQueue object.
   DECL_EXTERNAL_POINTER_ACCESSORS(microtask_queue, MicrotaskQueue*)
 
   inline void synchronized_set_script_context_table(
-      ScriptContextTable script_context_table);
-  inline ScriptContextTable synchronized_script_context_table() const;
+      Tagged<ScriptContextTable> script_context_table);
+  inline Tagged<ScriptContextTable> synchronized_script_context_table() const;
 
   // Caution, hack: this getter ignores the AcquireLoadTag. The global_object
   // slot is safe to read concurrently since it is immutable after
@@ -747,17 +751,18 @@ class NativeContext : public Context {
   // than heap-refs.cc.
   // TODO(jgruber): Remove this function after NativeContextRef is actually
   // never serialized and BROKER_NATIVE_CONTEXT_FIELDS is removed.
-  JSGlobalObject global_object() { return Context::global_object(); }
-  JSGlobalObject global_object(AcquireLoadTag) {
+  Tagged<JSGlobalObject> global_object() { return Context::global_object(); }
+  Tagged<JSGlobalObject> global_object(AcquireLoadTag) {
     return Context::global_object();
   }
 
-  inline Map TypedArrayElementsKindToCtorMap(ElementsKind element_kind) const;
+  inline Tagged<Map> TypedArrayElementsKindToCtorMap(
+      ElementsKind element_kind) const;
 
-  inline Map TypedArrayElementsKindToRabGsabCtorMap(
+  inline Tagged<Map> TypedArrayElementsKindToRabGsabCtorMap(
       ElementsKind element_kind) const;
 
-  bool HasTemplateLiteralObject(JSArray array);
+  bool HasTemplateLiteralObject(Tagged<JSArray> array);
 
   // Dispatched behavior.
   DECL_PRINTER(NativeContext)
diff --git a/deps/v8/src/objects/contexts.tq b/deps/v8/src/objects/contexts.tq
index 40238d455bb10d..319880775bd12b 100644
--- a/deps/v8/src/objects/contexts.tq
+++ b/deps/v8/src/objects/contexts.tq
@@ -82,8 +82,8 @@ macro NativeContextSlot<T: type>(
     context: Context, index: Slot<NativeContext, T>):&T {
   return ContextSlot(LoadNativeContext(context), index);
 }
-macro NativeContextSlot<C: type, T: type>(implicit context: C)(
-    index: Slot<NativeContext, T>):&T {
+macro NativeContextSlot<C: type, T: type>(
+    implicit context: C)(index: Slot<NativeContext, T>):&T {
   return NativeContextSlot(context, index);
 }
 
@@ -105,10 +105,13 @@ extern enum ContextSlot extends intptr constexpr 'Context::Field' {
   ITERATOR_FILTER_HELPER_MAP_INDEX: Slot<NativeContext, Map>,
   ITERATOR_TAKE_HELPER_MAP_INDEX: Slot<NativeContext, Map>,
   ITERATOR_DROP_HELPER_MAP_INDEX: Slot<NativeContext, Map>,
+  ITERATOR_FLAT_MAP_HELPER_MAP_INDEX: Slot<NativeContext, Map>,
   ITERATOR_FUNCTION_INDEX: Slot<NativeContext, JSFunction>,
   VALID_ITERATOR_WRAPPER_MAP_INDEX: Slot<NativeContext, Map>,
   JS_ARRAY_PACKED_ELEMENTS_MAP_INDEX: Slot<NativeContext, Map>,
   JS_ARRAY_PACKED_SMI_ELEMENTS_MAP_INDEX: Slot<NativeContext, Map>,
+  JS_MAP_MAP_INDEX: Slot<NativeContext, Map>,
+  JS_SET_MAP_INDEX: Slot<NativeContext, Map>,
   MATH_RANDOM_CACHE_INDEX: Slot<NativeContext, FixedDoubleArray>,
   MATH_RANDOM_INDEX_INDEX: Slot<NativeContext, Smi>,
   NUMBER_FUNCTION_INDEX: Slot<NativeContext, JSFunction>,
diff --git a/deps/v8/src/objects/data-handler-inl.h b/deps/v8/src/objects/data-handler-inl.h
index 7a00bcb26249d9..3a6dc680d5108d 100644
--- a/deps/v8/src/objects/data-handler-inl.h
+++ b/deps/v8/src/objects/data-handler-inl.h
@@ -19,15 +19,15 @@ namespace internal {
 TQ_OBJECT_CONSTRUCTORS_IMPL(DataHandler)
 
 int DataHandler::data_field_count() const {
-  return (map().instance_size() - kSizeWithData0) / kTaggedSize;
+  return (map()->instance_size() - kSizeWithData0) / kTaggedSize;
 }
 
 WEAK_ACCESSORS_CHECKED(DataHandler, data1, kData1Offset,
-                       map().instance_size() >= kSizeWithData1)
+                       map()->instance_size() >= kSizeWithData1)
 WEAK_ACCESSORS_CHECKED(DataHandler, data2, kData2Offset,
-                       map().instance_size() >= kSizeWithData2)
+                       map()->instance_size() >= kSizeWithData2)
 WEAK_ACCESSORS_CHECKED(DataHandler, data3, kData3Offset,
-                       map().instance_size() >= kSizeWithData3)
+                       map()->instance_size() >= kSizeWithData3)
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/debug-objects-inl.h b/deps/v8/src/objects/debug-objects-inl.h
index 6ea12ace1b9567..2aaa544781d0fa 100644
--- a/deps/v8/src/objects/debug-objects-inl.h
+++ b/deps/v8/src/objects/debug-objects-inl.h
@@ -5,12 +5,13 @@
 #ifndef V8_OBJECTS_DEBUG_OBJECTS_INL_H_
 #define V8_OBJECTS_DEBUG_OBJECTS_INL_H_
 
-#include "src/objects/debug-objects.h"
-
 #include "src/heap/heap-write-barrier-inl.h"
+#include "src/objects/bytecode-array-inl.h"
 #include "src/objects/code-inl.h"
+#include "src/objects/debug-objects.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/shared-function-info.h"
+#include "src/objects/string.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -37,17 +38,17 @@ BIT_FIELD_ACCESSORS(DebugInfo, debugger_hints, debugging_id,
                     DebugInfo::DebuggingIdBits)
 
 bool DebugInfo::HasInstrumentedBytecodeArray() {
-  return debug_bytecode_array(kAcquireLoad).IsBytecodeArray();
+  return IsBytecodeArray(debug_bytecode_array(kAcquireLoad));
 }
 
-BytecodeArray DebugInfo::OriginalBytecodeArray() {
+Tagged<BytecodeArray> DebugInfo::OriginalBytecodeArray() {
   DCHECK(HasInstrumentedBytecodeArray());
   return BytecodeArray::cast(original_bytecode_array(kAcquireLoad));
 }
 
-BytecodeArray DebugInfo::DebugBytecodeArray() {
+Tagged<BytecodeArray> DebugInfo::DebugBytecodeArray() {
   DCHECK(HasInstrumentedBytecodeArray());
-  DCHECK_EQ(shared().GetActiveBytecodeArray(),
+  DCHECK_EQ(shared()->GetActiveBytecodeArray(),
             debug_bytecode_array(kAcquireLoad));
   return BytecodeArray::cast(debug_bytecode_array(kAcquireLoad));
 }
@@ -55,10 +56,10 @@ BytecodeArray DebugInfo::DebugBytecodeArray() {
 TQ_OBJECT_CONSTRUCTORS_IMPL(StackFrameInfo)
 NEVER_READ_ONLY_SPACE_IMPL(StackFrameInfo)
 
-Script StackFrameInfo::script() const {
-  HeapObject object = shared_or_script();
-  if (object.IsSharedFunctionInfo()) {
-    object = SharedFunctionInfo::cast(object).script();
+Tagged<Script> StackFrameInfo::script() const {
+  Tagged<HeapObject> object = shared_or_script();
+  if (IsSharedFunctionInfo(object)) {
+    object = SharedFunctionInfo::cast(object)->script();
   }
   return Script::cast(object);
 }
@@ -72,16 +73,16 @@ NEVER_READ_ONLY_SPACE_IMPL(ErrorStackData)
 TQ_OBJECT_CONSTRUCTORS_IMPL(ErrorStackData)
 
 bool ErrorStackData::HasFormattedStack() const {
-  return !call_site_infos_or_formatted_stack().IsFixedArray();
+  return !IsFixedArray(call_site_infos_or_formatted_stack());
 }
 
-ACCESSORS_RELAXED_CHECKED(ErrorStackData, formatted_stack, Object,
+ACCESSORS_RELAXED_CHECKED(ErrorStackData, formatted_stack, Tagged<Object>,
                           kCallSiteInfosOrFormattedStackOffset,
-                          !limit_or_stack_frame_infos().IsSmi())
+                          !IsSmi(limit_or_stack_frame_infos()))
 
 bool ErrorStackData::HasCallSiteInfos() const { return !HasFormattedStack(); }
 
-ACCESSORS_RELAXED_CHECKED(ErrorStackData, call_site_infos, FixedArray,
+ACCESSORS_RELAXED_CHECKED(ErrorStackData, call_site_infos, Tagged<FixedArray>,
                           kCallSiteInfosOrFormattedStackOffset,
                           !HasFormattedStack())
 
diff --git a/deps/v8/src/objects/debug-objects.cc b/deps/v8/src/objects/debug-objects.cc
index 2c4eeba5c70b3e..e86429e98b0ea3 100644
--- a/deps/v8/src/objects/debug-objects.cc
+++ b/deps/v8/src/objects/debug-objects.cc
@@ -42,7 +42,8 @@ void DebugInfo::ClearBreakInfo(Isolate* isolate) {
     // Otherwise, it could be flushed and cause problems on resume. See v8:9067.
     {
       RedirectActiveFunctions redirect_visitor(
-          shared(), RedirectActiveFunctions::Mode::kUseOriginalBytecode);
+          isolate, shared(),
+          RedirectActiveFunctions::Mode::kUseOriginalBytecode);
       redirect_visitor.VisitThread(isolate, isolate->thread_local_top());
       isolate->thread_manager()->IterateArchivedThreads(&redirect_visitor);
     }
@@ -80,22 +81,24 @@ bool DebugInfo::CanBreakAtEntry() const {
 bool DebugInfo::HasBreakPoint(Isolate* isolate, int source_position) {
   DCHECK(HasBreakInfo());
   // Get the break point info object for this code offset.
-  Object break_point_info = GetBreakPointInfo(isolate, source_position);
+  Tagged<Object> break_point_info = GetBreakPointInfo(isolate, source_position);
 
   // If there is no break point info object or no break points in the break
   // point info object there is no break point at this code offset.
-  if (break_point_info.IsUndefined(isolate)) return false;
-  return BreakPointInfo::cast(break_point_info).GetBreakPointCount(isolate) > 0;
+  if (IsUndefined(break_point_info, isolate)) return false;
+  return BreakPointInfo::cast(break_point_info)->GetBreakPointCount(isolate) >
+         0;
 }
 
 // Get the break point info object for this source position.
-Object DebugInfo::GetBreakPointInfo(Isolate* isolate, int source_position) {
+Tagged<Object> DebugInfo::GetBreakPointInfo(Isolate* isolate,
+                                            int source_position) {
   DCHECK(HasBreakInfo());
-  for (int i = 0; i < break_points().length(); i++) {
-    if (!break_points().get(i).IsUndefined(isolate)) {
-      BreakPointInfo break_point_info =
-          BreakPointInfo::cast(break_points().get(i));
-      if (break_point_info.source_position() == source_position) {
+  for (int i = 0; i < break_points()->length(); i++) {
+    if (!IsUndefined(break_points()->get(i), isolate)) {
+      Tagged<BreakPointInfo> break_point_info =
+          BreakPointInfo::cast(break_points()->get(i));
+      if (break_point_info->source_position() == source_position) {
         return break_point_info;
       }
     }
@@ -106,10 +109,10 @@ Object DebugInfo::GetBreakPointInfo(Isolate* isolate, int source_position) {
 bool DebugInfo::ClearBreakPoint(Isolate* isolate, Handle<DebugInfo> debug_info,
                                 Handle<BreakPoint> break_point) {
   DCHECK(debug_info->HasBreakInfo());
-  for (int i = 0; i < debug_info->break_points().length(); i++) {
-    if (debug_info->break_points().get(i).IsUndefined(isolate)) continue;
+  for (int i = 0; i < debug_info->break_points()->length(); i++) {
+    if (IsUndefined(debug_info->break_points()->get(i), isolate)) continue;
     Handle<BreakPointInfo> break_point_info = Handle<BreakPointInfo>(
-        BreakPointInfo::cast(debug_info->break_points().get(i)), isolate);
+        BreakPointInfo::cast(debug_info->break_points()->get(i)), isolate);
     if (BreakPointInfo::HasBreakPoint(isolate, break_point_info, break_point)) {
       BreakPointInfo::ClearBreakPoint(isolate, break_point_info, break_point);
       return true;
@@ -124,7 +127,7 @@ void DebugInfo::SetBreakPoint(Isolate* isolate, Handle<DebugInfo> debug_info,
   DCHECK(debug_info->HasBreakInfo());
   Handle<Object> break_point_info(
       debug_info->GetBreakPointInfo(isolate, source_position), isolate);
-  if (!break_point_info->IsUndefined(isolate)) {
+  if (!IsUndefined(*break_point_info, isolate)) {
     BreakPointInfo::SetBreakPoint(
         isolate, Handle<BreakPointInfo>::cast(break_point_info), break_point);
     return;
@@ -134,8 +137,8 @@ void DebugInfo::SetBreakPoint(Isolate* isolate, Handle<DebugInfo> debug_info,
   // break points before. Try to find a free slot.
   static const int kNoBreakPointInfo = -1;
   int index = kNoBreakPointInfo;
-  for (int i = 0; i < debug_info->break_points().length(); i++) {
-    if (debug_info->break_points().get(i).IsUndefined(isolate)) {
+  for (int i = 0; i < debug_info->break_points()->length(); i++) {
+    if (IsUndefined(debug_info->break_points()->get(i), isolate)) {
       index = i;
       break;
     }
@@ -160,18 +163,18 @@ void DebugInfo::SetBreakPoint(Isolate* isolate, Handle<DebugInfo> debug_info,
   Handle<BreakPointInfo> new_break_point_info =
       isolate->factory()->NewBreakPointInfo(source_position);
   BreakPointInfo::SetBreakPoint(isolate, new_break_point_info, break_point);
-  debug_info->break_points().set(index, *new_break_point_info);
+  debug_info->break_points()->set(index, *new_break_point_info);
 }
 
 // Get the break point objects for a source position.
 Handle<Object> DebugInfo::GetBreakPoints(Isolate* isolate,
                                          int source_position) {
   DCHECK(HasBreakInfo());
-  Object break_point_info = GetBreakPointInfo(isolate, source_position);
-  if (break_point_info.IsUndefined(isolate)) {
+  Tagged<Object> break_point_info = GetBreakPointInfo(isolate, source_position);
+  if (IsUndefined(break_point_info, isolate)) {
     return isolate->factory()->undefined_value();
   }
-  return Handle<Object>(BreakPointInfo::cast(break_point_info).break_points(),
+  return Handle<Object>(BreakPointInfo::cast(break_point_info)->break_points(),
                         isolate);
 }
 
@@ -179,11 +182,11 @@ Handle<Object> DebugInfo::GetBreakPoints(Isolate* isolate,
 int DebugInfo::GetBreakPointCount(Isolate* isolate) {
   DCHECK(HasBreakInfo());
   int count = 0;
-  for (int i = 0; i < break_points().length(); i++) {
-    if (!break_points().get(i).IsUndefined(isolate)) {
-      BreakPointInfo break_point_info =
-          BreakPointInfo::cast(break_points().get(i));
-      count += break_point_info.GetBreakPointCount(isolate);
+  for (int i = 0; i < break_points()->length(); i++) {
+    if (!IsUndefined(break_points()->get(i), isolate)) {
+      Tagged<BreakPointInfo> break_point_info =
+          BreakPointInfo::cast(break_points()->get(i));
+      count += break_point_info->GetBreakPointCount(isolate);
     }
   }
   return count;
@@ -193,10 +196,10 @@ Handle<Object> DebugInfo::FindBreakPointInfo(Isolate* isolate,
                                              Handle<DebugInfo> debug_info,
                                              Handle<BreakPoint> break_point) {
   DCHECK(debug_info->HasBreakInfo());
-  for (int i = 0; i < debug_info->break_points().length(); i++) {
-    if (!debug_info->break_points().get(i).IsUndefined(isolate)) {
+  for (int i = 0; i < debug_info->break_points()->length(); i++) {
+    if (!IsUndefined(debug_info->break_points()->get(i), isolate)) {
       Handle<BreakPointInfo> break_point_info = Handle<BreakPointInfo>(
-          BreakPointInfo::cast(debug_info->break_points().get(i)), isolate);
+          BreakPointInfo::cast(debug_info->break_points()->get(i)), isolate);
       if (BreakPointInfo::HasBreakPoint(isolate, break_point_info,
                                         break_point)) {
         return break_point_info;
@@ -230,8 +233,8 @@ DebugInfo::SideEffectState DebugInfo::GetSideEffectState(Isolate* isolate) {
 }
 
 namespace {
-bool IsEqual(BreakPoint break_point1, BreakPoint break_point2) {
-  return break_point1.id() == break_point2.id();
+bool IsEqual(Tagged<BreakPoint> break_point1, Tagged<BreakPoint> break_point2) {
+  return break_point1->id() == break_point2->id();
 }
 }  // namespace
 
@@ -240,9 +243,9 @@ void BreakPointInfo::ClearBreakPoint(Isolate* isolate,
                                      Handle<BreakPointInfo> break_point_info,
                                      Handle<BreakPoint> break_point) {
   // If there are no break points just ignore.
-  if (break_point_info->break_points().IsUndefined(isolate)) return;
+  if (IsUndefined(break_point_info->break_points(), isolate)) return;
   // If there is a single break point clear it if it is the same.
-  if (!break_point_info->break_points().IsFixedArray()) {
+  if (!IsFixedArray(break_point_info->break_points())) {
     if (IsEqual(BreakPoint::cast(break_point_info->break_points()),
                 *break_point)) {
       break_point_info->set_break_points(
@@ -251,7 +254,7 @@ void BreakPointInfo::ClearBreakPoint(Isolate* isolate,
     return;
   }
   // If there are multiple break points shrink the array
-  DCHECK(break_point_info->break_points().IsFixedArray());
+  DCHECK(IsFixedArray(break_point_info->break_points()));
   Handle<FixedArray> old_array = Handle<FixedArray>(
       FixedArray::cast(break_point_info->break_points()), isolate);
   Handle<FixedArray> new_array =
@@ -274,12 +277,12 @@ void BreakPointInfo::SetBreakPoint(Isolate* isolate,
                                    Handle<BreakPointInfo> break_point_info,
                                    Handle<BreakPoint> break_point) {
   // If there was no break point objects before just set it.
-  if (break_point_info->break_points().IsUndefined(isolate)) {
+  if (IsUndefined(break_point_info->break_points(), isolate)) {
     break_point_info->set_break_points(*break_point);
     return;
   }
   // If there was one break point object before replace with array.
-  if (!break_point_info->break_points().IsFixedArray()) {
+  if (!IsFixedArray(break_point_info->break_points())) {
     if (IsEqual(BreakPoint::cast(break_point_info->break_points()),
         *break_point)) {
           return;
@@ -310,19 +313,19 @@ bool BreakPointInfo::HasBreakPoint(Isolate* isolate,
                                    Handle<BreakPointInfo> break_point_info,
                                    Handle<BreakPoint> break_point) {
   // No break point.
-  if (break_point_info->break_points().IsUndefined(isolate)) {
+  if (IsUndefined(break_point_info->break_points(), isolate)) {
     return false;
   }
   // Single break point.
-  if (!break_point_info->break_points().IsFixedArray()) {
+  if (!IsFixedArray(break_point_info->break_points())) {
     return IsEqual(BreakPoint::cast(break_point_info->break_points()),
                    *break_point);
   }
   // Multiple break points.
-  FixedArray array = FixedArray::cast(break_point_info->break_points());
-  for (int i = 0; i < array.length(); i++) {
-    if (IsEqual(BreakPoint::cast(array.get(i)), *break_point)) {
-      return true;
+  Tagged<FixedArray> array = FixedArray::cast(break_point_info->break_points());
+  for (int i = 0; i < array->length(); i++) {
+    if (IsEqual(BreakPoint::cast(array->get(i)), *break_point)) {
+          return true;
     }
   }
   return false;
@@ -332,21 +335,23 @@ MaybeHandle<BreakPoint> BreakPointInfo::GetBreakPointById(
     Isolate* isolate, Handle<BreakPointInfo> break_point_info,
     int breakpoint_id) {
   // No break point.
-  if (break_point_info->break_points().IsUndefined(isolate)) {
+  if (IsUndefined(break_point_info->break_points(), isolate)) {
     return MaybeHandle<BreakPoint>();
   }
   // Single break point.
-  if (!break_point_info->break_points().IsFixedArray()) {
-    BreakPoint breakpoint = BreakPoint::cast(break_point_info->break_points());
-    if (breakpoint.id() == breakpoint_id) {
-      return handle(breakpoint, isolate);
+  if (!IsFixedArray(break_point_info->break_points())) {
+    Tagged<BreakPoint> breakpoint =
+        BreakPoint::cast(break_point_info->break_points());
+    if (breakpoint->id() == breakpoint_id) {
+          return handle(breakpoint, isolate);
     }
   } else {
     // Multiple break points.
-    FixedArray array = FixedArray::cast(break_point_info->break_points());
-    for (int i = 0; i < array.length(); i++) {
-      BreakPoint breakpoint = BreakPoint::cast(array.get(i));
-      if (breakpoint.id() == breakpoint_id) {
+    Tagged<FixedArray> array =
+        FixedArray::cast(break_point_info->break_points());
+    for (int i = 0; i < array->length(); i++) {
+      Tagged<BreakPoint> breakpoint = BreakPoint::cast(array->get(i));
+      if (breakpoint->id() == breakpoint_id) {
         return handle(breakpoint, isolate);
       }
     }
@@ -357,11 +362,11 @@ MaybeHandle<BreakPoint> BreakPointInfo::GetBreakPointById(
 // Get the number of break points.
 int BreakPointInfo::GetBreakPointCount(Isolate* isolate) {
   // No break point.
-  if (break_points().IsUndefined(isolate)) return 0;
+  if (IsUndefined(break_points(), isolate)) return 0;
   // Single break point.
-  if (!break_points().IsFixedArray()) return 1;
+  if (!IsFixedArray(break_points())) return 1;
   // Multiple break points.
-  return FixedArray::cast(break_points()).length();
+  return FixedArray::cast(break_points())->length();
 }
 
 void CoverageInfo::InitializeSlot(int slot_index, int from_pos, int to_pos) {
@@ -377,7 +382,6 @@ void CoverageInfo::ResetBlockCount(int slot_index) {
 
 void CoverageInfo::CoverageInfoPrint(std::ostream& os,
                                      std::unique_ptr<char[]> function_name) {
-  DCHECK(v8_flags.trace_block_coverage);
   DisallowGarbageCollection no_gc;
 
   os << "Coverage info (";
@@ -398,14 +402,14 @@ void CoverageInfo::CoverageInfoPrint(std::ostream& os,
 
 // static
 int StackFrameInfo::GetSourcePosition(Handle<StackFrameInfo> info) {
-  if (info->shared_or_script().IsScript()) {
+  if (IsScript(info->shared_or_script())) {
     return info->bytecode_offset_or_source_position();
   }
   Isolate* isolate = info->GetIsolate();
   Handle<SharedFunctionInfo> shared(
       SharedFunctionInfo::cast(info->shared_or_script()), isolate);
   SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, shared);
-  int source_position = shared->abstract_code(isolate).SourcePosition(
+  int source_position = shared->abstract_code(isolate)->SourcePosition(
       isolate, info->bytecode_offset_or_source_position());
   info->set_shared_or_script(shared->script());
   info->set_bytecode_offset_or_source_position(source_position);
@@ -415,7 +419,7 @@ int StackFrameInfo::GetSourcePosition(Handle<StackFrameInfo> info) {
 // static
 void ErrorStackData::EnsureStackFrameInfos(Isolate* isolate,
                                            Handle<ErrorStackData> error_stack) {
-  if (!error_stack->limit_or_stack_frame_infos().IsSmi()) {
+  if (!IsSmi(error_stack->limit_or_stack_frame_infos())) {
     return;
   }
   int limit = Smi::cast(error_stack->limit_or_stack_frame_infos()).value();
@@ -427,7 +431,7 @@ void ErrorStackData::EnsureStackFrameInfos(Isolate* isolate,
     Handle<CallSiteInfo> call_site_info(
         CallSiteInfo::cast(call_site_infos->get(i)), isolate);
     if (call_site_info->IsAsync()) {
-      break;
+          break;
     }
     Handle<Script> script;
     if (!CallSiteInfo::GetScript(isolate, call_site_info).ToHandle(&script) ||
@@ -438,7 +442,7 @@ void ErrorStackData::EnsureStackFrameInfos(Isolate* isolate,
         isolate->factory()->NewStackFrameInfo(
             script, CallSiteInfo::GetSourcePosition(call_site_info),
             CallSiteInfo::GetFunctionDebugName(call_site_info),
-            call_site_info->IsConstructor());
+            IsConstructor(*call_site_info));
     stack_frame_infos->set(index++, *stack_frame_info);
   }
   stack_frame_infos =
@@ -460,9 +464,9 @@ void ErrorStackData::EnsureStackFrameInfos(Isolate* isolate,
 // static
 MaybeHandle<JSObject> PromiseOnStack::GetPromise(
     Handle<PromiseOnStack> promise_on_stack) {
-  HeapObject promise;
+  Tagged<HeapObject> promise;
   Isolate* isolate = promise_on_stack->GetIsolate();
-  if (promise_on_stack->promise()->GetHeapObjectIfWeak(isolate, &promise)) {
+  if (promise_on_stack->promise().GetHeapObjectIfWeak(isolate, &promise)) {
     return handle(JSObject::cast(promise), isolate);
   }
   return {};
diff --git a/deps/v8/src/objects/debug-objects.h b/deps/v8/src/objects/debug-objects.h
index ddea5008b8fcc9..3637cf696b763e 100644
--- a/deps/v8/src/objects/debug-objects.h
+++ b/deps/v8/src/objects/debug-objects.h
@@ -54,8 +54,8 @@ class DebugInfo : public TorqueGeneratedDebugInfo<DebugInfo, Struct> {
   // and DebugBytecodeArray returns the instrumented bytecode.
   inline bool HasInstrumentedBytecodeArray();
 
-  inline BytecodeArray OriginalBytecodeArray();
-  inline BytecodeArray DebugBytecodeArray();
+  inline Tagged<BytecodeArray> OriginalBytecodeArray();
+  inline Tagged<BytecodeArray> DebugBytecodeArray();
 
   // --- Break points ---
   // --------------------
@@ -137,7 +137,7 @@ class DebugInfo : public TorqueGeneratedDebugInfo<DebugInfo, Struct> {
 
  private:
   // Get the break point info object for a source position.
-  Object GetBreakPointInfo(Isolate* isolate, int source_position);
+  Tagged<Object> GetBreakPointInfo(Isolate* isolate, int source_position);
 
   TQ_OBJECT_CONSTRUCTORS(DebugInfo)
 };
@@ -211,7 +211,7 @@ class StackFrameInfo
   static int GetSourcePosition(Handle<StackFrameInfo> info);
 
   // The script for the stack frame.
-  inline Script script() const;
+  inline Tagged<Script> script() const;
 
   // The bytecode offset or source position for the stack frame.
   DECL_INT_ACCESSORS(bytecode_offset_or_source_position)
@@ -237,9 +237,9 @@ class ErrorStackData
   NEVER_READ_ONLY_SPACE
 
   inline bool HasFormattedStack() const;
-  DECL_ACCESSORS(formatted_stack, Object)
+  DECL_ACCESSORS(formatted_stack, Tagged<Object>)
   inline bool HasCallSiteInfos() const;
-  DECL_ACCESSORS(call_site_infos, FixedArray)
+  DECL_ACCESSORS(call_site_infos, Tagged<FixedArray>)
 
   static void EnsureStackFrameInfos(Isolate* isolate,
                                     Handle<ErrorStackData> error_stack);
diff --git a/deps/v8/src/objects/debug-objects.tq b/deps/v8/src/objects/debug-objects.tq
index 52a6ac2c35eee0..517f0ae965b511 100644
--- a/deps/v8/src/objects/debug-objects.tq
+++ b/deps/v8/src/objects/debug-objects.tq
@@ -34,8 +34,6 @@ extern class DebugInfo extends Struct {
   shared: SharedFunctionInfo;
   // Bit field containing various information collected for debugging.
   debugger_hints: SmiTagged<DebuggerHints>;
-  // Script field from shared function info.
-  script: Undefined|Script;
   // The original uninstrumented bytecode array for functions with break
   // points - the instrumented bytecode is held in the shared function info.
   @cppAcquireLoad
diff --git a/deps/v8/src/objects/deoptimization-data-inl.h b/deps/v8/src/objects/deoptimization-data-inl.h
new file mode 100644
index 00000000000000..d68006f772dd6e
--- /dev/null
+++ b/deps/v8/src/objects/deoptimization-data-inl.h
@@ -0,0 +1,101 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_DEOPTIMIZATION_DATA_INL_H_
+#define V8_OBJECTS_DEOPTIMIZATION_DATA_INL_H_
+
+#include "src/common/ptr-compr-inl.h"
+#include "src/objects/deoptimization-data.h"
+#include "src/objects/fixed-array-inl.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+OBJECT_CONSTRUCTORS_IMPL(DeoptimizationData, FixedArray)
+
+CAST_ACCESSOR(DeoptimizationData)
+CAST_ACCESSOR(DeoptimizationLiteralArray)
+CAST_ACCESSOR(DeoptimizationFrameTranslation)
+
+DEFINE_DEOPT_ELEMENT_ACCESSORS(FrameTranslation,
+                               Tagged<DeoptimizationFrameTranslation>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(InlinedFunctionCount, Tagged<Smi>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(LiteralArray, Tagged<DeoptimizationLiteralArray>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(OsrBytecodeOffset, Tagged<Smi>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(OsrPcOffset, Tagged<Smi>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(OptimizationId, Tagged<Smi>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(InliningPositions,
+                               Tagged<PodArray<InliningPosition>>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(DeoptExitStart, Tagged<Smi>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(EagerDeoptCount, Tagged<Smi>)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(LazyDeoptCount, Tagged<Smi>)
+
+DEFINE_DEOPT_ENTRY_ACCESSORS(BytecodeOffsetRaw, Tagged<Smi>)
+DEFINE_DEOPT_ENTRY_ACCESSORS(TranslationIndex, Tagged<Smi>)
+DEFINE_DEOPT_ENTRY_ACCESSORS(Pc, Tagged<Smi>)
+#ifdef DEBUG
+DEFINE_DEOPT_ENTRY_ACCESSORS(NodeId, Tagged<Smi>)
+#endif  // DEBUG
+
+BytecodeOffset DeoptimizationData::GetBytecodeOffsetOrBuiltinContinuationId(
+    int i) const {
+  return BytecodeOffset(BytecodeOffsetRaw(i).value());
+}
+
+void DeoptimizationData::SetBytecodeOffset(int i, BytecodeOffset value) {
+  SetBytecodeOffsetRaw(i, Smi::FromInt(value.ToInt()));
+}
+
+int DeoptimizationData::DeoptCount() const {
+  return (length() - kFirstDeoptEntryIndex) / kDeoptEntrySize;
+}
+
+inline DeoptimizationLiteralArray::DeoptimizationLiteralArray(Address ptr)
+    : WeakFixedArray(ptr) {
+  // No type check is possible beyond that for WeakFixedArray.
+}
+
+inline Tagged<Object> DeoptimizationLiteralArray::get(int index) const {
+  return get(GetPtrComprCageBase(*this), index);
+}
+
+inline Tagged<Object> DeoptimizationLiteralArray::get(
+    PtrComprCageBase cage_base, int index) const {
+  MaybeObject maybe = Get(cage_base, index);
+
+  // Slots in the DeoptimizationLiteralArray should only be cleared when there
+  // is no possible code path that could need that slot. This works because the
+  // weakly-held deoptimization literals are basically local variables that
+  // TurboFan has decided not to keep on the stack. Thus, if the deoptimization
+  // literal goes away, then whatever code needed it should be unreachable. The
+  // exception is currently running InstructionStream: in that case, the
+  // deoptimization literals array might be the only thing keeping the target
+  // object alive. Thus, when a InstructionStream is running, we strongly mark
+  // all of its deoptimization literals.
+  CHECK(!maybe.IsCleared());
+
+  return maybe.GetHeapObjectOrSmi();
+}
+
+inline void DeoptimizationLiteralArray::set(int index, Tagged<Object> value) {
+  MaybeObject maybe = MaybeObject::FromObject(value);
+  if (Code::IsWeakObjectInDeoptimizationLiteralArray(value)) {
+    maybe = MaybeObject::MakeWeak(maybe);
+  }
+  Set(index, maybe);
+}
+
+inline DeoptimizationFrameTranslation::DeoptimizationFrameTranslation(
+    Address ptr)
+    : ByteArray(ptr) {}
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_DEOPTIMIZATION_DATA_INL_H_
diff --git a/deps/v8/src/objects/deoptimization-data.cc b/deps/v8/src/objects/deoptimization-data.cc
new file mode 100644
index 00000000000000..994d8643a8649c
--- /dev/null
+++ b/deps/v8/src/objects/deoptimization-data.cc
@@ -0,0 +1,377 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/objects/deoptimization-data.h"
+
+#include <iomanip>
+
+#include "src/deoptimizer/translated-state.h"
+#include "src/interpreter/bytecode-array-iterator.h"
+#include "src/objects/code.h"
+#include "src/objects/deoptimization-data-inl.h"
+#include "src/objects/shared-function-info.h"
+
+#ifdef V8_USE_ZLIB
+#include "third_party/zlib/google/compression_utils_portable.h"
+#endif  // V8_USE_ZLIB
+
+namespace v8 {
+namespace internal {
+
+Handle<DeoptimizationData> DeoptimizationData::New(Isolate* isolate,
+                                                   int deopt_entry_count,
+                                                   AllocationType allocation) {
+  return Handle<DeoptimizationData>::cast(isolate->factory()->NewFixedArray(
+      LengthFor(deopt_entry_count), allocation));
+}
+
+Handle<DeoptimizationData> DeoptimizationData::New(LocalIsolate* isolate,
+                                                   int deopt_entry_count,
+                                                   AllocationType allocation) {
+  return Handle<DeoptimizationData>::cast(isolate->factory()->NewFixedArray(
+      LengthFor(deopt_entry_count), allocation));
+}
+
+Handle<DeoptimizationData> DeoptimizationData::Empty(Isolate* isolate) {
+  return Handle<DeoptimizationData>::cast(
+      isolate->factory()->empty_fixed_array());
+}
+
+Handle<DeoptimizationData> DeoptimizationData::Empty(LocalIsolate* isolate) {
+  return Handle<DeoptimizationData>::cast(
+      isolate->factory()->empty_fixed_array());
+}
+
+Tagged<SharedFunctionInfo> DeoptimizationData::GetInlinedFunction(int index) {
+  if (index == -1) {
+    return SharedFunctionInfo::cast(SharedFunctionInfo());
+  } else {
+    return SharedFunctionInfo::cast(LiteralArray()->get(index));
+  }
+}
+
+#ifdef DEBUG
+void DeoptimizationData::Verify(Handle<BytecodeArray> bytecode) const {
+#ifdef V8_USE_ZLIB
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
+    return;
+  }
+#endif  // V8_USE_ZLIB
+  for (int i = 0; i < DeoptCount(); ++i) {
+    // Check the frame count and identify the bailout id of the top compilation
+    // unit.
+    int idx = TranslationIndex(i).value();
+    DeoptimizationFrameTranslation::Iterator iterator(FrameTranslation(), idx);
+    auto [frame_count, jsframe_count] = iterator.EnterBeginOpcode();
+    DCHECK_GE(frame_count, jsframe_count);
+    BytecodeOffset bailout = BytecodeOffset::None();
+    bool first_frame = true;
+    while (frame_count > 0) {
+      TranslationOpcode frame = iterator.SeekNextFrame();
+      frame_count--;
+      if (IsTranslationJsFrameOpcode(frame)) {
+        jsframe_count--;
+        if (first_frame) {
+          bailout = BytecodeOffset(iterator.NextOperand());
+          first_frame = false;
+          iterator.SkipOperands(TranslationOpcodeOperandCount(frame) - 1);
+          continue;
+        }
+      }
+      iterator.SkipOperands(TranslationOpcodeOperandCount(frame));
+    }
+    CHECK_EQ(frame_count, 0);
+    CHECK_EQ(jsframe_count, 0);
+
+    // Check the bytecode offset exists in the bytecode array
+    if (bailout != BytecodeOffset::None()) {
+#ifdef ENABLE_SLOW_DCHECKS
+      interpreter::BytecodeArrayIterator bytecode_iterator(bytecode);
+      while (bytecode_iterator.current_offset() < bailout.ToInt()) {
+        bytecode_iterator.Advance();
+        DCHECK_LE(bytecode_iterator.current_offset(), bailout.ToInt());
+      }
+#else
+      DCHECK_GE(bailout.ToInt(), 0);
+      DCHECK_LT(bailout.ToInt(), bytecode->length());
+#endif  // ENABLE_SLOW_DCHECKS
+    }
+  }
+}
+#endif  // DEBUG
+
+#ifdef ENABLE_DISASSEMBLER
+
+namespace {
+void print_pc(std::ostream& os, int pc) {
+  if (pc == -1) {
+    os << "NA";
+  } else {
+    os << std::hex << pc << std::dec;
+  }
+}
+}  // namespace
+
+void DeoptimizationData::PrintDeoptimizationData(std::ostream& os) const {
+  if (length() == 0) {
+    os << "Deoptimization Input Data invalidated by lazy deoptimization\n";
+    return;
+  }
+
+  int const inlined_function_count = InlinedFunctionCount().value();
+  os << "Inlined functions (count = " << inlined_function_count << ")\n";
+  for (int id = 0; id < inlined_function_count; ++id) {
+    Tagged<Object> info = LiteralArray()->get(id);
+    os << " " << Brief(SharedFunctionInfo::cast(info)) << "\n";
+  }
+  os << "\n";
+  int deopt_count = DeoptCount();
+  os << "Deoptimization Input Data (deopt points = " << deopt_count << ")\n";
+  if (0 != deopt_count) {
+#ifdef DEBUG
+    os << " index  bytecode-offset  node-id    pc";
+#else   // DEBUG
+    os << " index  bytecode-offset    pc";
+#endif  // DEBUG
+    if (v8_flags.print_code_verbose) os << "  commands";
+    os << "\n";
+  }
+  for (int i = 0; i < deopt_count; i++) {
+    os << std::setw(6) << i << "  " << std::setw(15)
+       << GetBytecodeOffsetOrBuiltinContinuationId(i).ToInt() << "  "
+#ifdef DEBUG
+       << std::setw(7) << NodeId(i).value() << "  "
+#endif  // DEBUG
+       << std::setw(4);
+    print_pc(os, Pc(i).value());
+    os << std::setw(2) << "\n";
+
+    if (v8_flags.print_code_verbose) {
+      FrameTranslation()->PrintFrameTranslation(os, TranslationIndex(i).value(),
+                                                LiteralArray());
+    }
+  }
+}
+
+#endif  // ENABLE_DISASSEMBLER
+
+DeoptimizationFrameTranslation::Iterator::Iterator(
+    Tagged<DeoptimizationFrameTranslation> buffer, int index)
+    : buffer_(buffer), index_(index) {
+#ifdef V8_USE_ZLIB
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
+    const int size = buffer_.get_int(kUncompressedSizeOffset);
+    uncompressed_contents_.insert(uncompressed_contents_.begin(), size, 0);
+
+    uLongf uncompressed_size =
+        size * kDeoptimizationFrameTranslationElementSize;
+
+    CHECK_EQ(zlib_internal::UncompressHelper(
+                 zlib_internal::ZRAW,
+                 base::bit_cast<Bytef*>(uncompressed_contents_.data()),
+                 &uncompressed_size,
+                 buffer_.GetDataStartAddress() + kCompressedDataOffset,
+                 buffer_.DataSize()),
+             Z_OK);
+    DCHECK(index >= 0 && index < size);
+    return;
+  }
+#endif  // V8_USE_ZLIB
+  DCHECK(!v8_flags.turbo_compress_frame_translations);
+  DCHECK(index >= 0 && index < buffer->length());
+  // Starting at a location other than a BEGIN would make
+  // MATCH_PREVIOUS_TRANSLATION instructions not work.
+  DCHECK(TranslationOpcodeIsBegin(
+      static_cast<TranslationOpcode>(buffer_.GetDataStartAddress()[index])));
+}
+
+int32_t DeoptimizationFrameTranslation::Iterator::NextOperand() {
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
+    return uncompressed_contents_[index_++];
+  } else if (remaining_ops_to_use_from_previous_translation_) {
+    int32_t value =
+        base::VLQDecode(buffer_.GetDataStartAddress(), &previous_index_);
+    DCHECK_LT(previous_index_, index_);
+    return value;
+  } else {
+    int32_t value = base::VLQDecode(buffer_.GetDataStartAddress(), &index_);
+    DCHECK_LE(index_, buffer_.length());
+    return value;
+  }
+}
+
+TranslationOpcode
+DeoptimizationFrameTranslation::Iterator::NextOpcodeAtPreviousIndex() {
+  TranslationOpcode opcode =
+      static_cast<TranslationOpcode>(buffer_.get(previous_index_++));
+  DCHECK_LT(static_cast<uint32_t>(opcode), kNumTranslationOpcodes);
+  DCHECK_NE(opcode, TranslationOpcode::MATCH_PREVIOUS_TRANSLATION);
+  DCHECK_LT(previous_index_, index_);
+  return opcode;
+}
+
+uint32_t
+DeoptimizationFrameTranslation::Iterator::NextUnsignedOperandAtPreviousIndex() {
+  uint32_t value =
+      base::VLQDecodeUnsigned(buffer_.GetDataStartAddress(), &previous_index_);
+  DCHECK_LT(previous_index_, index_);
+  return value;
+}
+
+uint32_t DeoptimizationFrameTranslation::Iterator::NextOperandUnsigned() {
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
+    return uncompressed_contents_[index_++];
+  } else if (remaining_ops_to_use_from_previous_translation_) {
+    return NextUnsignedOperandAtPreviousIndex();
+  } else {
+    uint32_t value =
+        base::VLQDecodeUnsigned(buffer_.GetDataStartAddress(), &index_);
+    DCHECK_LE(index_, buffer_.length());
+    return value;
+  }
+}
+
+TranslationOpcode DeoptimizationFrameTranslation::Iterator::NextOpcode() {
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
+    return static_cast<TranslationOpcode>(NextOperandUnsigned());
+  }
+  if (remaining_ops_to_use_from_previous_translation_) {
+    --remaining_ops_to_use_from_previous_translation_;
+  }
+  if (remaining_ops_to_use_from_previous_translation_) {
+    return NextOpcodeAtPreviousIndex();
+  }
+  CHECK_LT(index_, buffer_.length());
+  uint8_t opcode_byte = buffer_.get(index_++);
+
+  // If the opcode byte is greater than any valid opcode, then the opcode is
+  // implicitly MATCH_PREVIOUS_TRANSLATION and the operand is the opcode byte
+  // minus kNumTranslationOpcodes. This special-case encoding of the most common
+  // opcode saves some memory.
+  if (opcode_byte >= kNumTranslationOpcodes) {
+    remaining_ops_to_use_from_previous_translation_ =
+        opcode_byte - kNumTranslationOpcodes;
+    opcode_byte =
+        static_cast<uint8_t>(TranslationOpcode::MATCH_PREVIOUS_TRANSLATION);
+  } else if (opcode_byte ==
+             static_cast<uint8_t>(
+                 TranslationOpcode::MATCH_PREVIOUS_TRANSLATION)) {
+    remaining_ops_to_use_from_previous_translation_ = NextOperandUnsigned();
+  }
+
+  TranslationOpcode opcode = static_cast<TranslationOpcode>(opcode_byte);
+  DCHECK_LE(index_, buffer_.length());
+  DCHECK_LT(static_cast<uint32_t>(opcode), kNumTranslationOpcodes);
+  if (TranslationOpcodeIsBegin(opcode)) {
+    int temp_index = index_;
+    // The first argument for BEGIN is the distance, in bytes, since the
+    // previous BEGIN, or zero to indicate that MATCH_PREVIOUS_TRANSLATION will
+    // not be used in this translation.
+    uint32_t lookback_distance =
+        base::VLQDecodeUnsigned(buffer_.GetDataStartAddress(), &temp_index);
+    if (lookback_distance) {
+      previous_index_ = index_ - 1 - lookback_distance;
+      DCHECK(TranslationOpcodeIsBegin(
+          static_cast<TranslationOpcode>(buffer_.get(previous_index_))));
+      // The previous BEGIN should specify zero as its lookback distance,
+      // meaning it won't use MATCH_PREVIOUS_TRANSLATION.
+      DCHECK_EQ(buffer_.get(previous_index_ + 1), 0);
+    }
+    ops_since_previous_index_was_updated_ = 1;
+  } else if (opcode == TranslationOpcode::MATCH_PREVIOUS_TRANSLATION) {
+    for (int i = 0; i < ops_since_previous_index_was_updated_; ++i) {
+      SkipOpcodeAndItsOperandsAtPreviousIndex();
+    }
+    ops_since_previous_index_was_updated_ = 0;
+    opcode = NextOpcodeAtPreviousIndex();
+  } else {
+    ++ops_since_previous_index_was_updated_;
+  }
+  return opcode;
+}
+
+DeoptimizationFrameTranslation::FrameCount
+DeoptimizationFrameTranslation::Iterator::EnterBeginOpcode() {
+  TranslationOpcode opcode = NextOpcode();
+  DCHECK(TranslationOpcodeIsBegin(opcode));
+  USE(opcode);
+  NextOperand();  // Skip lookback distance.
+  int frame_count = NextOperand();
+  int jsframe_count = NextOperand();
+  return {frame_count, jsframe_count};
+}
+
+TranslationOpcode DeoptimizationFrameTranslation::Iterator::SeekNextJSFrame() {
+  while (HasNextOpcode()) {
+    TranslationOpcode opcode = NextOpcode();
+    DCHECK(!TranslationOpcodeIsBegin(opcode));
+    if (IsTranslationJsFrameOpcode(opcode)) {
+      return opcode;
+    } else {
+      // Skip over operands to advance to the next opcode.
+      SkipOperands(TranslationOpcodeOperandCount(opcode));
+    }
+  }
+  UNREACHABLE();
+}
+
+TranslationOpcode DeoptimizationFrameTranslation::Iterator::SeekNextFrame() {
+  while (HasNextOpcode()) {
+    TranslationOpcode opcode = NextOpcode();
+    DCHECK(!TranslationOpcodeIsBegin(opcode));
+    if (IsTranslationFrameOpcode(opcode)) {
+      return opcode;
+    } else {
+      // Skip over operands to advance to the next opcode.
+      SkipOperands(TranslationOpcodeOperandCount(opcode));
+    }
+  }
+  UNREACHABLE();
+}
+
+bool DeoptimizationFrameTranslation::Iterator::HasNextOpcode() const {
+  if (V8_UNLIKELY(v8_flags.turbo_compress_frame_translations)) {
+    return index_ < static_cast<int>(uncompressed_contents_.size());
+  } else {
+    return index_ < buffer_.length() ||
+           remaining_ops_to_use_from_previous_translation_ > 1;
+  }
+}
+
+void DeoptimizationFrameTranslation::Iterator::
+    SkipOpcodeAndItsOperandsAtPreviousIndex() {
+  TranslationOpcode opcode = NextOpcodeAtPreviousIndex();
+  for (int count = TranslationOpcodeOperandCount(opcode); count != 0; --count) {
+    NextUnsignedOperandAtPreviousIndex();
+  }
+}
+
+#ifdef ENABLE_DISASSEMBLER
+
+void DeoptimizationFrameTranslation::PrintFrameTranslation(
+    std::ostream& os, int index,
+    Tagged<DeoptimizationLiteralArray> literal_array) const {
+  DisallowGarbageCollection gc_oh_noes;
+
+  DeoptimizationFrameTranslation::Iterator iterator(*this, index);
+  TranslationOpcode opcode = iterator.NextOpcode();
+  DCHECK(TranslationOpcodeIsBegin(opcode));
+  os << opcode << " ";
+  DeoptimizationFrameTranslationPrintSingleOpcode(os, opcode, iterator,
+                                                  literal_array);
+  while (iterator.HasNextOpcode()) {
+    TranslationOpcode opcode = iterator.NextOpcode();
+    if (TranslationOpcodeIsBegin(opcode)) {
+      break;
+    }
+    os << opcode << " ";
+    DeoptimizationFrameTranslationPrintSingleOpcode(os, opcode, iterator,
+                                                    literal_array);
+  }
+}
+
+#endif  // ENABLE_DISASSEMBLER
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/objects/deoptimization-data.h b/deps/v8/src/objects/deoptimization-data.h
new file mode 100644
index 00000000000000..2794e1eea803f7
--- /dev/null
+++ b/deps/v8/src/objects/deoptimization-data.h
@@ -0,0 +1,236 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_DEOPTIMIZATION_DATA_H_
+#define V8_OBJECTS_DEOPTIMIZATION_DATA_H_
+
+#include <vector>
+
+#include "src/objects/bytecode-array.h"
+#include "src/objects/fixed-array.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+// This class holds data required during deoptimization. It does not have its
+// own instance type.
+class DeoptimizationLiteralArray : public WeakFixedArray {
+ public:
+  // Getters for literals. These include runtime checks that the pointer was not
+  // cleared, if the literal was held weakly.
+  inline Tagged<Object> get(int index) const;
+  inline Tagged<Object> get(PtrComprCageBase cage_base, int index) const;
+
+  // Setter for literals. This will set the object as strong or weak depending
+  // on InstructionStream::IsWeakObjectInOptimizedCode.
+  inline void set(int index, Tagged<Object> value);
+
+  DECL_CAST(DeoptimizationLiteralArray)
+
+  OBJECT_CONSTRUCTORS(DeoptimizationLiteralArray, WeakFixedArray);
+};
+
+// The DeoptimizationFrameTranslation is the on-heap representation of
+// translations created during code generation in a (zone-allocated)
+// DeoptimizationFrameTranslationBuilder. The translation specifies how to
+// transform an optimized frame back into one or more unoptimized frames.
+enum class TranslationOpcode;
+class DeoptimizationFrameTranslation : public ByteArray {
+ public:
+  DECL_CAST(DeoptimizationFrameTranslation)
+
+  struct FrameCount {
+    int total_frame_count;
+    int js_frame_count;
+  };
+
+  class Iterator;
+
+#ifdef V8_USE_ZLIB
+  // Constants describing compressed DeoptimizationFrameTranslation layout. Only
+  // relevant if
+  // --turbo-compress-frame-translation is enabled.
+  static constexpr int kUncompressedSizeOffset = 0;
+  static constexpr int kUncompressedSizeSize = kInt32Size;
+  static constexpr int kCompressedDataOffset =
+      kUncompressedSizeOffset + kUncompressedSizeSize;
+  static constexpr int kDeoptimizationFrameTranslationElementSize = kInt32Size;
+#endif  // V8_USE_ZLIB
+
+#ifdef ENABLE_DISASSEMBLER
+  void PrintFrameTranslation(
+      std::ostream& os, int index,
+      Tagged<DeoptimizationLiteralArray> literal_array) const;
+#endif
+
+  OBJECT_CONSTRUCTORS(DeoptimizationFrameTranslation, ByteArray);
+};
+
+class DeoptimizationFrameTranslation::Iterator {
+ public:
+  Iterator(Tagged<DeoptimizationFrameTranslation> buffer, int index);
+
+  int32_t NextOperand();
+
+  uint32_t NextOperandUnsigned();
+
+  DeoptimizationFrameTranslation::FrameCount EnterBeginOpcode();
+
+  TranslationOpcode NextOpcode();
+
+  TranslationOpcode SeekNextJSFrame();
+  TranslationOpcode SeekNextFrame();
+
+  bool HasNextOpcode() const;
+
+  void SkipOperands(int n) {
+    for (int i = 0; i < n; i++) NextOperand();
+  }
+
+ private:
+  TranslationOpcode NextOpcodeAtPreviousIndex();
+  uint32_t NextUnsignedOperandAtPreviousIndex();
+  void SkipOpcodeAndItsOperandsAtPreviousIndex();
+
+  std::vector<int32_t> uncompressed_contents_;
+  DeoptimizationFrameTranslation buffer_;
+  int index_;
+
+  // This decrementing counter indicates how many more times to read operations
+  // from the previous translation before continuing to move the index forward.
+  int remaining_ops_to_use_from_previous_translation_ = 0;
+
+  // An index into buffer_ for operations starting at a previous BEGIN, which
+  // can be used to read operations referred to by MATCH_PREVIOUS_TRANSLATION.
+  int previous_index_ = 0;
+
+  // When starting a new MATCH_PREVIOUS_TRANSLATION operation, we'll need to
+  // advance the previous_index_ by this many steps.
+  int ops_since_previous_index_was_updated_ = 0;
+};
+
+// DeoptimizationData is a fixed array used to hold the deoptimization data for
+// optimized code.  It also contains information about functions that were
+// inlined.  If N different functions were inlined then the first N elements of
+// the literal array will contain these functions.
+//
+// It can be empty.
+class DeoptimizationData : public FixedArray {
+ public:
+  // Layout description.  Indices in the array.
+  static const int kFrameTranslationIndex = 0;
+  static const int kInlinedFunctionCountIndex = 1;
+  static const int kLiteralArrayIndex = 2;
+  static const int kOsrBytecodeOffsetIndex = 3;
+  static const int kOsrPcOffsetIndex = 4;
+  static const int kOptimizationIdIndex = 5;
+  static const int kSharedFunctionInfoIndex = 6;
+  static const int kInliningPositionsIndex = 7;
+  static const int kDeoptExitStartIndex = 8;
+  static const int kEagerDeoptCountIndex = 9;
+  static const int kLazyDeoptCountIndex = 10;
+  static const int kFirstDeoptEntryIndex = 11;
+
+  // Offsets of deopt entry elements relative to the start of the entry.
+  static const int kBytecodeOffsetRawOffset = 0;
+  static const int kTranslationIndexOffset = 1;
+  static const int kPcOffset = 2;
+#ifdef DEBUG
+  static const int kNodeIdOffset = 3;
+  static const int kDeoptEntrySize = 4;
+#else   // DEBUG
+  static const int kDeoptEntrySize = 3;
+#endif  // DEBUG
+
+// Simple element accessors.
+#define DECL_ELEMENT_ACCESSORS(name, type) \
+  inline type name() const;                \
+  inline void Set##name(type value);
+
+  DECL_ELEMENT_ACCESSORS(FrameTranslation,
+                         Tagged<DeoptimizationFrameTranslation>)
+  DECL_ELEMENT_ACCESSORS(InlinedFunctionCount, Tagged<Smi>)
+  DECL_ELEMENT_ACCESSORS(LiteralArray, Tagged<DeoptimizationLiteralArray>)
+  DECL_ELEMENT_ACCESSORS(OsrBytecodeOffset, Tagged<Smi>)
+  DECL_ELEMENT_ACCESSORS(OsrPcOffset, Tagged<Smi>)
+  DECL_ELEMENT_ACCESSORS(OptimizationId, Tagged<Smi>)
+  DECL_ELEMENT_ACCESSORS(SharedFunctionInfo, Tagged<Object>)
+  DECL_ELEMENT_ACCESSORS(InliningPositions, Tagged<PodArray<InliningPosition>>)
+  DECL_ELEMENT_ACCESSORS(DeoptExitStart, Tagged<Smi>)
+  DECL_ELEMENT_ACCESSORS(EagerDeoptCount, Tagged<Smi>)
+  DECL_ELEMENT_ACCESSORS(LazyDeoptCount, Tagged<Smi>)
+
+#undef DECL_ELEMENT_ACCESSORS
+
+// Accessors for elements of the ith deoptimization entry.
+#define DECL_ENTRY_ACCESSORS(name, type) \
+  inline type name(int i) const;         \
+  inline void Set##name(int i, type value);
+
+  DECL_ENTRY_ACCESSORS(BytecodeOffsetRaw, Tagged<Smi>)
+  DECL_ENTRY_ACCESSORS(TranslationIndex, Tagged<Smi>)
+  DECL_ENTRY_ACCESSORS(Pc, Tagged<Smi>)
+#ifdef DEBUG
+  DECL_ENTRY_ACCESSORS(NodeId, Tagged<Smi>)
+#endif  // DEBUG
+
+#undef DECL_ENTRY_ACCESSORS
+
+  // In case the innermost frame is a builtin continuation stub, then this field
+  // actually contains the builtin id. See uses of
+  // `Builtins::GetBuiltinFromBytecodeOffset`.
+  // TODO(olivf): Add some validation that callers do not misinterpret the
+  // result.
+  inline BytecodeOffset GetBytecodeOffsetOrBuiltinContinuationId(int i) const;
+
+  inline void SetBytecodeOffset(int i, BytecodeOffset value);
+
+  inline int DeoptCount() const;
+
+  static const int kNotInlinedIndex = -1;
+
+  // Returns the inlined function at the given position in LiteralArray, or the
+  // outer function if index == kNotInlinedIndex.
+  Tagged<class SharedFunctionInfo> GetInlinedFunction(int index);
+
+  // Allocates a DeoptimizationData.
+  static Handle<DeoptimizationData> New(Isolate* isolate, int deopt_entry_count,
+                                        AllocationType allocation);
+  static Handle<DeoptimizationData> New(LocalIsolate* isolate,
+                                        int deopt_entry_count,
+                                        AllocationType allocation);
+
+  // Return an empty DeoptimizationData.
+  V8_EXPORT_PRIVATE static Handle<DeoptimizationData> Empty(Isolate* isolate);
+  V8_EXPORT_PRIVATE static Handle<DeoptimizationData> Empty(
+      LocalIsolate* isolate);
+
+  DECL_CAST(DeoptimizationData)
+
+#ifdef DEBUG
+  void Verify(Handle<BytecodeArray> bytecode) const;
+#endif
+#ifdef ENABLE_DISASSEMBLER
+  void PrintDeoptimizationData(std::ostream& os) const;
+#endif
+
+ private:
+  static int IndexForEntry(int i) {
+    return kFirstDeoptEntryIndex + (i * kDeoptEntrySize);
+  }
+
+  static int LengthFor(int entry_count) { return IndexForEntry(entry_count); }
+
+  OBJECT_CONSTRUCTORS(DeoptimizationData, FixedArray);
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_DEOPTIMIZATION_DATA_H_
diff --git a/deps/v8/src/objects/dependent-code-inl.h b/deps/v8/src/objects/dependent-code-inl.h
new file mode 100644
index 00000000000000..f34550d156a1e3
--- /dev/null
+++ b/deps/v8/src/objects/dependent-code-inl.h
@@ -0,0 +1,54 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_DEPENDENT_CODE_INL_H_
+#define V8_OBJECTS_DEPENDENT_CODE_INL_H_
+
+#include "src/objects/dependent-code.h"
+#include "src/objects/fixed-array-inl.h"
+#include "src/objects/tagged.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+OBJECT_CONSTRUCTORS_IMPL(DependentCode, WeakArrayList)
+CAST_ACCESSOR(DependentCode)
+
+// static
+template <typename ObjectT>
+void DependentCode::DeoptimizeDependencyGroups(Isolate* isolate, ObjectT object,
+                                               DependencyGroups groups) {
+  static_assert(kTaggedCanConvertToRawObjects);
+  DeoptimizeDependencyGroups(isolate, Tagged<ObjectT>(object), groups);
+}
+
+// static
+template <typename ObjectT>
+void DependentCode::DeoptimizeDependencyGroups(Isolate* isolate,
+                                               Tagged<ObjectT> object,
+                                               DependencyGroups groups) {
+  // Shared objects are designed to never invalidate code.
+  DCHECK(!Object::InSharedHeap(object) && !object->InReadOnlySpace());
+  object->dependent_code()->DeoptimizeDependencyGroups(isolate, groups);
+}
+
+// static
+template <typename ObjectT>
+bool DependentCode::MarkCodeForDeoptimization(Isolate* isolate,
+                                              Tagged<ObjectT> object,
+                                              DependencyGroups groups) {
+  // Shared objects are designed to never invalidate code.
+  DCHECK(!object.InAnySharedSpace() && !object.InReadOnlySpace());
+  return object->dependent_code()->MarkCodeForDeoptimization(isolate, groups);
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_DEPENDENT_CODE_INL_H_
diff --git a/deps/v8/src/objects/dependent-code.cc b/deps/v8/src/objects/dependent-code.cc
new file mode 100644
index 00000000000000..871d4babf0a89a
--- /dev/null
+++ b/deps/v8/src/objects/dependent-code.cc
@@ -0,0 +1,195 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/objects/dependent-code.h"
+
+#include "src/deoptimizer/deoptimizer.h"
+#include "src/objects/allocation-site-inl.h"
+#include "src/objects/dependent-code-inl.h"
+#include "src/objects/map.h"
+
+namespace v8 {
+namespace internal {
+
+Tagged<DependentCode> DependentCode::GetDependentCode(
+    Tagged<HeapObject> object) {
+  if (IsMap(object)) {
+    return Map::cast(object)->dependent_code();
+  } else if (IsPropertyCell(object)) {
+    return PropertyCell::cast(object)->dependent_code();
+  } else if (IsAllocationSite(object)) {
+    return AllocationSite::cast(object)->dependent_code();
+  }
+  UNREACHABLE();
+}
+
+void DependentCode::SetDependentCode(Handle<HeapObject> object,
+                                     Handle<DependentCode> dep) {
+  if (IsMap(*object)) {
+    Handle<Map>::cast(object)->set_dependent_code(*dep);
+  } else if (IsPropertyCell(*object)) {
+    Handle<PropertyCell>::cast(object)->set_dependent_code(*dep);
+  } else if (IsAllocationSite(*object)) {
+    Handle<AllocationSite>::cast(object)->set_dependent_code(*dep);
+  } else {
+    UNREACHABLE();
+  }
+}
+
+namespace {
+
+void PrintDependencyGroups(DependentCode::DependencyGroups groups) {
+  while (groups != 0) {
+    auto group = static_cast<DependentCode::DependencyGroup>(
+        1 << base::bits::CountTrailingZeros(static_cast<uint32_t>(groups)));
+    StdoutStream{} << DependentCode::DependencyGroupName(group);
+    groups &= ~group;
+    if (groups != 0) StdoutStream{} << ",";
+  }
+}
+
+}  // namespace
+
+void DependentCode::InstallDependency(Isolate* isolate, Handle<Code> code,
+                                      Handle<HeapObject> object,
+                                      DependencyGroups groups) {
+  if (V8_UNLIKELY(v8_flags.trace_compilation_dependencies)) {
+    StdoutStream{} << "Installing dependency of [" << code << "] on [" << object
+                   << "] in groups [";
+    PrintDependencyGroups(groups);
+    StdoutStream{} << "]\n";
+  }
+  Handle<DependentCode> old_deps(DependentCode::GetDependentCode(*object),
+                                 isolate);
+  Handle<DependentCode> new_deps =
+      InsertWeakCode(isolate, old_deps, groups, code);
+
+  // Update the list head if necessary.
+  if (!new_deps.is_identical_to(old_deps)) {
+    DependentCode::SetDependentCode(object, new_deps);
+  }
+}
+
+Handle<DependentCode> DependentCode::InsertWeakCode(
+    Isolate* isolate, Handle<DependentCode> entries, DependencyGroups groups,
+    Handle<Code> code) {
+  if (entries->length() == entries->capacity()) {
+    // We'd have to grow - try to compact first.
+    entries->IterateAndCompact([](Code, DependencyGroups) { return false; });
+  }
+
+  MaybeObjectHandle code_slot(HeapObjectReference::Weak(*code), isolate);
+  entries = Handle<DependentCode>::cast(WeakArrayList::AddToEnd(
+      isolate, entries, code_slot, Smi::FromInt(groups)));
+  return entries;
+}
+
+void DependentCode::IterateAndCompact(const IterateAndCompactFn& fn) {
+  DisallowGarbageCollection no_gc;
+
+  int len = length();
+  if (len == 0) return;
+
+  // We compact during traversal, thus use a somewhat custom loop construct:
+  //
+  // - Loop back-to-front s.t. trailing cleared entries can simply drop off
+  //   the back of the list.
+  // - Any cleared slots are filled from the back of the list.
+  int i = len - kSlotsPerEntry;
+  while (i >= 0) {
+    MaybeObject obj = Get(i + kCodeSlotOffset);
+    if (obj->IsCleared()) {
+      len = FillEntryFromBack(i, len);
+      i -= kSlotsPerEntry;
+      continue;
+    }
+
+    if (fn(Code::cast(obj.GetHeapObjectAssumeWeak()),
+           static_cast<DependencyGroups>(
+               Get(i + kGroupsSlotOffset).ToSmi().value()))) {
+      len = FillEntryFromBack(i, len);
+    }
+
+    i -= kSlotsPerEntry;
+  }
+
+  set_length(len);
+}
+
+bool DependentCode::MarkCodeForDeoptimization(
+    Isolate* isolate, DependentCode::DependencyGroups deopt_groups) {
+  DisallowGarbageCollection no_gc;
+
+  bool marked_something = false;
+  IterateAndCompact([&](Code code, DependencyGroups groups) {
+    if ((groups & deopt_groups) == 0) return false;
+
+    if (!code->marked_for_deoptimization()) {
+      code->SetMarkedForDeoptimization(isolate, "code dependencies");
+      marked_something = true;
+    }
+
+    return true;
+  });
+
+  return marked_something;
+}
+
+int DependentCode::FillEntryFromBack(int index, int length) {
+  DCHECK_EQ(index % 2, 0);
+  DCHECK_EQ(length % 2, 0);
+  for (int i = length - kSlotsPerEntry; i > index; i -= kSlotsPerEntry) {
+    MaybeObject obj = Get(i + kCodeSlotOffset);
+    if (obj->IsCleared()) continue;
+
+    Set(index + kCodeSlotOffset, obj);
+    Set(index + kGroupsSlotOffset, Get(i + kGroupsSlotOffset),
+        SKIP_WRITE_BARRIER);
+    return i;
+  }
+  return index;  // No non-cleared entry found.
+}
+
+void DependentCode::DeoptimizeDependencyGroups(
+    Isolate* isolate, DependentCode::DependencyGroups groups) {
+  DisallowGarbageCollection no_gc_scope;
+  bool marked_something = MarkCodeForDeoptimization(isolate, groups);
+  if (marked_something) {
+    DCHECK(AllowCodeDependencyChange::IsAllowed());
+    Deoptimizer::DeoptimizeMarkedCode(isolate);
+  }
+}
+
+// static
+Tagged<DependentCode> DependentCode::empty_dependent_code(
+    const ReadOnlyRoots& roots) {
+  return DependentCode::cast(roots.empty_weak_array_list());
+}
+
+const char* DependentCode::DependencyGroupName(DependencyGroup group) {
+  switch (group) {
+    case kTransitionGroup:
+      return "transition";
+    case kPrototypeCheckGroup:
+      return "prototype-check";
+    case kPropertyCellChangedGroup:
+      return "property-cell-changed";
+    case kFieldConstGroup:
+      return "field-const";
+    case kFieldTypeGroup:
+      return "field-type";
+    case kFieldRepresentationGroup:
+      return "field-representation";
+    case kInitialMapChangedGroup:
+      return "initial-map-changed";
+    case kAllocationSiteTenuringChangedGroup:
+      return "allocation-site-tenuring-changed";
+    case kAllocationSiteTransitionChangedGroup:
+      return "allocation-site-transition-changed";
+  }
+  UNREACHABLE();
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/objects/dependent-code.h b/deps/v8/src/objects/dependent-code.h
new file mode 100644
index 00000000000000..ddcb1fbeeedbda
--- /dev/null
+++ b/deps/v8/src/objects/dependent-code.h
@@ -0,0 +1,141 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_DEPENDENT_CODE_H_
+#define V8_OBJECTS_DEPENDENT_CODE_H_
+
+#include "src/objects/fixed-array.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+#include "src/roots/roots.h"
+
+namespace v8 {
+namespace internal {
+
+// Dependent code is conceptually the list of {Code, DependencyGroup} tuples
+// associated with an object, where the dependency group is a reason that could
+// lead to a deopt of the corresponding code.
+//
+// Implementation details: DependentCode is a weak array list containing
+// entries, where each entry consists of a (weak) Code object and the
+// DependencyGroups bitset as a Smi.
+//
+// Note the underlying weak array list currently never shrinks physically (the
+// contents may shrink).
+// TODO(jgruber): Consider adding physical shrinking.
+class DependentCode : public WeakArrayList {
+ public:
+  DECL_CAST(DependentCode)
+
+  enum DependencyGroup {
+    // Group of code objects that embed a transition to this map, and depend on
+    // being deoptimized when the transition is replaced by a new version.
+    kTransitionGroup = 1 << 0,
+    // Group of code objects that omit run-time prototype checks for prototypes
+    // described by this map. The group is deoptimized whenever the following
+    // conditions hold, possibly invalidating the assumptions embedded in the
+    // code:
+    // a) A fast-mode object described by this map changes shape (and
+    // transitions to a new map), or
+    // b) A dictionary-mode prototype described by this map changes shape, the
+    // const-ness of one of its properties changes, or its [[Prototype]]
+    // changes (only the latter causes a transition).
+    kPrototypeCheckGroup = 1 << 1,
+    // Group of code objects that depends on global property values in property
+    // cells not being changed.
+    kPropertyCellChangedGroup = 1 << 2,
+    // Group of code objects that omit run-time checks for field(s) introduced
+    // by this map, i.e. for the field type.
+    kFieldTypeGroup = 1 << 3,
+    kFieldConstGroup = 1 << 4,
+    kFieldRepresentationGroup = 1 << 5,
+    // Group of code objects that omit run-time type checks for initial maps of
+    // constructors.
+    kInitialMapChangedGroup = 1 << 6,
+    // Group of code objects that depends on tenuring information in
+    // AllocationSites not being changed.
+    kAllocationSiteTenuringChangedGroup = 1 << 7,
+    // Group of code objects that depends on element transition information in
+    // AllocationSites not being changed.
+    kAllocationSiteTransitionChangedGroup = 1 << 8,
+    // IMPORTANT: The last bit must fit into a Smi, i.e. into 31 bits.
+  };
+  using DependencyGroups = base::Flags<DependencyGroup, uint32_t>;
+
+  static const char* DependencyGroupName(DependencyGroup group);
+
+  // Register a dependency of {code} on {object}, of the kinds given by
+  // {groups}.
+  V8_EXPORT_PRIVATE static void InstallDependency(Isolate* isolate,
+                                                  Handle<Code> code,
+                                                  Handle<HeapObject> object,
+                                                  DependencyGroups groups);
+
+  template <typename ObjectT>
+  static void DeoptimizeDependencyGroups(Isolate* isolate, ObjectT object,
+                                         DependencyGroups groups);
+
+  template <typename ObjectT>
+  static void DeoptimizeDependencyGroups(Isolate* isolate,
+                                         Tagged<ObjectT> object,
+                                         DependencyGroups groups);
+
+  template <typename ObjectT>
+  static bool MarkCodeForDeoptimization(Isolate* isolate,
+                                        Tagged<ObjectT> object,
+                                        DependencyGroups groups);
+
+  V8_EXPORT_PRIVATE static Tagged<DependentCode> empty_dependent_code(
+      const ReadOnlyRoots& roots);
+  static constexpr RootIndex kEmptyDependentCode =
+      RootIndex::kEmptyWeakArrayList;
+
+  // Constants exposed for tests.
+  static constexpr int kSlotsPerEntry =
+      2;  // {code: weak InstructionStream, groups: Smi}.
+  static constexpr int kCodeSlotOffset = 0;
+  static constexpr int kGroupsSlotOffset = 1;
+
+ private:
+  // Get/Set {object}'s {DependentCode}.
+  static Tagged<DependentCode> GetDependentCode(Tagged<HeapObject> object);
+  static void SetDependentCode(Handle<HeapObject> object,
+                               Handle<DependentCode> dep);
+
+  static Handle<DependentCode> InsertWeakCode(Isolate* isolate,
+                                              Handle<DependentCode> entries,
+                                              DependencyGroups groups,
+                                              Handle<Code> code);
+
+  bool MarkCodeForDeoptimization(Isolate* isolate,
+                                 DependencyGroups deopt_groups);
+
+  void DeoptimizeDependencyGroups(Isolate* isolate, DependencyGroups groups);
+
+  // The callback is called for all non-cleared entries, and should return true
+  // iff the current entry should be cleared.
+  using IterateAndCompactFn =
+      std::function<bool(Tagged<Code>, DependencyGroups)>;
+  void IterateAndCompact(const IterateAndCompactFn& fn);
+
+  // Fills the given entry with the last non-cleared entry in this list, and
+  // returns the new length after the last non-cleared entry has been moved.
+  int FillEntryFromBack(int index, int length);
+
+  static constexpr int LengthFor(int number_of_entries) {
+    return number_of_entries * kSlotsPerEntry;
+  }
+
+  OBJECT_CONSTRUCTORS(DependentCode, WeakArrayList);
+};
+
+DEFINE_OPERATORS_FOR_FLAGS(DependentCode::DependencyGroups)
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_DEPENDENT_CODE_H_
diff --git a/deps/v8/src/objects/descriptor-array-inl.h b/deps/v8/src/objects/descriptor-array-inl.h
index fa42dc17fc3024..a36be95706fd9c 100644
--- a/deps/v8/src/objects/descriptor-array-inl.h
+++ b/deps/v8/src/objects/descriptor-array-inl.h
@@ -16,6 +16,8 @@
 #include "src/objects/maybe-object-inl.h"
 #include "src/objects/property.h"
 #include "src/objects/struct-inl.h"
+#include "src/torque/runtime-macro-shims.h"
+#include "src/torque/runtime-support.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -42,21 +44,21 @@ inline int DescriptorArray::number_of_entries() const {
   return number_of_descriptors();
 }
 
-void DescriptorArray::CopyEnumCacheFrom(DescriptorArray array) {
-  set_enum_cache(array.enum_cache());
+void DescriptorArray::CopyEnumCacheFrom(Tagged<DescriptorArray> array) {
+  set_enum_cache(array->enum_cache());
 }
 
-InternalIndex DescriptorArray::Search(Name name, int valid_descriptors,
+InternalIndex DescriptorArray::Search(Tagged<Name> name, int valid_descriptors,
                                       bool concurrent_search) {
-  DCHECK(name.IsUniqueName());
+  DCHECK(IsUniqueName(name));
   return InternalIndex(internal::Search<VALID_ENTRIES>(
       this, name, valid_descriptors, nullptr, concurrent_search));
 }
 
-InternalIndex DescriptorArray::Search(Name name, Map map,
+InternalIndex DescriptorArray::Search(Tagged<Name> name, Tagged<Map> map,
                                       bool concurrent_search) {
-  DCHECK(name.IsUniqueName());
-  int number_of_own_descriptors = map.NumberOfOwnDescriptors();
+  DCHECK(IsUniqueName(name));
+  int number_of_own_descriptors = map->NumberOfOwnDescriptors();
   if (number_of_own_descriptors == 0) return InternalIndex::NotFound();
   return Search(name, number_of_own_descriptors, concurrent_search);
 }
@@ -74,16 +76,17 @@ InternalIndex DescriptorArray::Search(int field_index, int valid_descriptors) {
   return InternalIndex::NotFound();
 }
 
-InternalIndex DescriptorArray::Search(int field_index, Map map) {
-  int number_of_own_descriptors = map.NumberOfOwnDescriptors();
+InternalIndex DescriptorArray::Search(int field_index, Tagged<Map> map) {
+  int number_of_own_descriptors = map->NumberOfOwnDescriptors();
   if (number_of_own_descriptors == 0) return InternalIndex::NotFound();
   return Search(field_index, number_of_own_descriptors);
 }
 
-InternalIndex DescriptorArray::SearchWithCache(Isolate* isolate, Name name,
-                                               Map map) {
-  DCHECK(name.IsUniqueName());
-  int number_of_own_descriptors = map.NumberOfOwnDescriptors();
+InternalIndex DescriptorArray::SearchWithCache(Isolate* isolate,
+                                               Tagged<Name> name,
+                                               Tagged<Map> map) {
+  DCHECK(IsUniqueName(name));
+  int number_of_own_descriptors = map->NumberOfOwnDescriptors();
   if (number_of_own_descriptors == 0) return InternalIndex::NotFound();
 
   DescriptorLookupCache* cache = isolate->descriptor_lookup_cache();
@@ -113,20 +116,21 @@ ObjectSlot DescriptorArray::GetDescriptorSlot(int descriptor) {
   return RawField(OffsetOfDescriptorAt(descriptor));
 }
 
-Name DescriptorArray::GetKey(InternalIndex descriptor_number) const {
+Tagged<Name> DescriptorArray::GetKey(InternalIndex descriptor_number) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return GetKey(cage_base, descriptor_number);
 }
 
-Name DescriptorArray::GetKey(PtrComprCageBase cage_base,
-                             InternalIndex descriptor_number) const {
+Tagged<Name> DescriptorArray::GetKey(PtrComprCageBase cage_base,
+                                     InternalIndex descriptor_number) const {
   DCHECK_LT(descriptor_number.as_int(), number_of_descriptors());
   int entry_offset = OffsetOfDescriptorAt(descriptor_number.as_int());
   return Name::cast(
       EntryKeyField::Relaxed_Load(cage_base, *this, entry_offset));
 }
 
-void DescriptorArray::SetKey(InternalIndex descriptor_number, Name key) {
+void DescriptorArray::SetKey(InternalIndex descriptor_number,
+                             Tagged<Name> key) {
   DCHECK_LT(descriptor_number.as_int(), number_of_descriptors());
   int entry_offset = OffsetOfDescriptorAt(descriptor_number.as_int());
   EntryKeyField::Relaxed_Store(*this, entry_offset, key);
@@ -137,13 +141,13 @@ int DescriptorArray::GetSortedKeyIndex(int descriptor_number) {
   return GetDetails(InternalIndex(descriptor_number)).pointer();
 }
 
-Name DescriptorArray::GetSortedKey(int descriptor_number) {
+Tagged<Name> DescriptorArray::GetSortedKey(int descriptor_number) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return GetSortedKey(cage_base, descriptor_number);
 }
 
-Name DescriptorArray::GetSortedKey(PtrComprCageBase cage_base,
-                                   int descriptor_number) {
+Tagged<Name> DescriptorArray::GetSortedKey(PtrComprCageBase cage_base,
+                                           int descriptor_number) {
   return GetKey(cage_base, InternalIndex(GetSortedKeyIndex(descriptor_number)));
 }
 
@@ -152,13 +156,14 @@ void DescriptorArray::SetSortedKey(int descriptor_number, int pointer) {
   SetDetails(InternalIndex(descriptor_number), details.set_pointer(pointer));
 }
 
-Object DescriptorArray::GetStrongValue(InternalIndex descriptor_number) {
+Tagged<Object> DescriptorArray::GetStrongValue(
+    InternalIndex descriptor_number) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return GetStrongValue(cage_base, descriptor_number);
 }
 
-Object DescriptorArray::GetStrongValue(PtrComprCageBase cage_base,
-                                       InternalIndex descriptor_number) {
+Tagged<Object> DescriptorArray::GetStrongValue(
+    PtrComprCageBase cage_base, InternalIndex descriptor_number) {
   return GetValue(cage_base, descriptor_number).cast<Object>();
 }
 
@@ -185,7 +190,7 @@ MaybeObject DescriptorArray::GetValue(PtrComprCageBase cage_base,
 PropertyDetails DescriptorArray::GetDetails(InternalIndex descriptor_number) {
   DCHECK_LT(descriptor_number.as_int(), number_of_descriptors());
   int entry_offset = OffsetOfDescriptorAt(descriptor_number.as_int());
-  Smi details = EntryDetailsField::Relaxed_Load(*this, entry_offset);
+  Tagged<Smi> details = EntryDetailsField::Relaxed_Load(*this, entry_offset);
   return PropertyDetails(details);
 }
 
@@ -201,19 +206,20 @@ int DescriptorArray::GetFieldIndex(InternalIndex descriptor_number) {
   return GetDetails(descriptor_number).field_index();
 }
 
-FieldType DescriptorArray::GetFieldType(InternalIndex descriptor_number) {
+Tagged<FieldType> DescriptorArray::GetFieldType(
+    InternalIndex descriptor_number) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return GetFieldType(cage_base, descriptor_number);
 }
 
-FieldType DescriptorArray::GetFieldType(PtrComprCageBase cage_base,
-                                        InternalIndex descriptor_number) {
+Tagged<FieldType> DescriptorArray::GetFieldType(
+    PtrComprCageBase cage_base, InternalIndex descriptor_number) {
   DCHECK_EQ(GetDetails(descriptor_number).location(), PropertyLocation::kField);
   MaybeObject wrapped_type = GetValue(cage_base, descriptor_number);
   return Map::UnwrapFieldType(wrapped_type);
 }
 
-void DescriptorArray::Set(InternalIndex descriptor_number, Name key,
+void DescriptorArray::Set(InternalIndex descriptor_number, Tagged<Name> key,
                           MaybeObject value, PropertyDetails details) {
   SetKey(descriptor_number, key);
   SetDetails(descriptor_number, details);
@@ -221,7 +227,7 @@ void DescriptorArray::Set(InternalIndex descriptor_number, Name key,
 }
 
 void DescriptorArray::Set(InternalIndex descriptor_number, Descriptor* desc) {
-  Name key = *desc->GetKey();
+  Tagged<Name> key = *desc->GetKey();
   MaybeObject value = *desc->GetValue();
   Set(descriptor_number, key, value, desc->GetDetails());
 }
@@ -240,8 +246,8 @@ void DescriptorArray::Append(Descriptor* desc) {
   int insertion;
 
   for (insertion = descriptor_number; insertion > 0; --insertion) {
-    Name key = GetSortedKey(insertion - 1);
-    collision_hash = key.hash();
+    Tagged<Name> key = GetSortedKey(insertion - 1);
+    collision_hash = key->hash();
     if (collision_hash <= desc_hash) break;
     SetSortedKey(insertion, GetSortedKeyIndex(insertion - 1));
   }
@@ -261,10 +267,11 @@ void DescriptorArray::SwapSortedKeys(int first, int second) {
 
 // static
 bool DescriptorArrayMarkingState::TryUpdateIndicesToMark(
-    unsigned gc_epoch, DescriptorArray array, DescriptorIndex index_to_mark) {
+    unsigned gc_epoch, Tagged<DescriptorArray> array,
+    DescriptorIndex index_to_mark) {
   const auto current_epoch = gc_epoch & Epoch::kMask;
   while (true) {
-    const RawGCStateType raw_gc_state = array.raw_gc_state(kRelaxedLoad);
+    const RawGCStateType raw_gc_state = array->raw_gc_state(kRelaxedLoad);
     const auto epoch_from_state = Epoch::decode(raw_gc_state);
     RawGCStateType new_raw_gc_state = 0;
     if (current_epoch != epoch_from_state) {
@@ -293,10 +300,10 @@ bool DescriptorArrayMarkingState::TryUpdateIndicesToMark(
 std::pair<DescriptorArrayMarkingState::DescriptorIndex,
           DescriptorArrayMarkingState::DescriptorIndex>
 DescriptorArrayMarkingState::AcquireDescriptorRangeToMark(
-    unsigned gc_epoch, DescriptorArray array) {
+    unsigned gc_epoch, Tagged<DescriptorArray> array) {
   const auto current_epoch = gc_epoch & Epoch::kMask;
   while (true) {
-    const RawGCStateType raw_gc_state = array.raw_gc_state(kRelaxedLoad);
+    const RawGCStateType raw_gc_state = array->raw_gc_state(kRelaxedLoad);
     const DescriptorIndex marked = Marked::decode(raw_gc_state);
     const DescriptorIndex delta = Delta::decode(raw_gc_state);
     // We may encounter an array here that was merely pushed to the marker. In
@@ -312,8 +319,8 @@ DescriptorArrayMarkingState::AcquireDescriptorRangeToMark(
       // and delta as valid state which leads to double-accounting through the
       // marking barrier (when nof>1 in the barrier).
       const int16_t number_of_descriptors =
-          array.number_of_descriptors() ? array.number_of_descriptors()
-                                        : array.number_of_all_descriptors();
+          array->number_of_descriptors() ? array->number_of_descriptors()
+                                         : array->number_of_all_descriptors();
       DCHECK_GT(number_of_descriptors, 0);
       if (SwapState(array, raw_gc_state,
                     NewState(current_epoch, number_of_descriptors, 0))) {
diff --git a/deps/v8/src/objects/descriptor-array.h b/deps/v8/src/objects/descriptor-array.h
index f4ec397cb08ff3..4b00ecadd44ab8 100644
--- a/deps/v8/src/objects/descriptor-array.h
+++ b/deps/v8/src/objects/descriptor-array.h
@@ -20,10 +20,6 @@
 namespace v8 {
 namespace internal {
 
-template <typename T>
-class Handle;
-
-class Isolate;
 class StructBodyDescriptor;
 
 #include "torque-generated/src/objects/descriptor-array-tq.inc"
@@ -63,36 +59,37 @@ class DescriptorArray
   inline int number_of_entries() const;
 
   void ClearEnumCache();
-  inline void CopyEnumCacheFrom(DescriptorArray array);
+  inline void CopyEnumCacheFrom(Tagged<DescriptorArray> array);
   static void InitializeOrChangeEnumCache(
       Handle<DescriptorArray> descriptors, Isolate* isolate,
       Handle<FixedArray> keys, Handle<FixedArray> indices,
       AllocationType allocation_if_initialize);
 
   // Accessors for fetching instance descriptor at descriptor number.
-  inline Name GetKey(InternalIndex descriptor_number) const;
-  inline Name GetKey(PtrComprCageBase cage_base,
-                     InternalIndex descriptor_number) const;
-  inline Object GetStrongValue(InternalIndex descriptor_number);
-  inline Object GetStrongValue(PtrComprCageBase cage_base,
-                               InternalIndex descriptor_number);
+  inline Tagged<Name> GetKey(InternalIndex descriptor_number) const;
+  inline Tagged<Name> GetKey(PtrComprCageBase cage_base,
+                             InternalIndex descriptor_number) const;
+  inline Tagged<Object> GetStrongValue(InternalIndex descriptor_number);
+  inline Tagged<Object> GetStrongValue(PtrComprCageBase cage_base,
+                                       InternalIndex descriptor_number);
   inline MaybeObject GetValue(InternalIndex descriptor_number);
   inline MaybeObject GetValue(PtrComprCageBase cage_base,
                               InternalIndex descriptor_number);
   inline PropertyDetails GetDetails(InternalIndex descriptor_number);
   inline int GetFieldIndex(InternalIndex descriptor_number);
-  inline FieldType GetFieldType(InternalIndex descriptor_number);
-  inline FieldType GetFieldType(PtrComprCageBase cage_base,
-                                InternalIndex descriptor_number);
+  inline Tagged<FieldType> GetFieldType(InternalIndex descriptor_number);
+  inline Tagged<FieldType> GetFieldType(PtrComprCageBase cage_base,
+                                        InternalIndex descriptor_number);
 
-  inline Name GetSortedKey(int descriptor_number);
-  inline Name GetSortedKey(PtrComprCageBase cage_base, int descriptor_number);
+  inline Tagged<Name> GetSortedKey(int descriptor_number);
+  inline Tagged<Name> GetSortedKey(PtrComprCageBase cage_base,
+                                   int descriptor_number);
   inline int GetSortedKeyIndex(int descriptor_number);
 
   // Accessor for complete descriptor.
   inline void Set(InternalIndex descriptor_number, Descriptor* desc);
-  inline void Set(InternalIndex descriptor_number, Name key, MaybeObject value,
-                  PropertyDetails details);
+  inline void Set(InternalIndex descriptor_number, Tagged<Name> key,
+                  MaybeObject value, PropertyDetails details);
   void Replace(InternalIndex descriptor_number, Descriptor* descriptor);
 
   // Generalizes constness, representation and field type of all field
@@ -112,10 +109,6 @@ class DescriptorArray
       Isolate* isolate, Handle<DescriptorArray> desc, int enumeration_index,
       PropertyAttributes attributes, int slack = 0);
 
-  static Handle<DescriptorArray> CopyForFastObjectClone(
-      Isolate* isolate, Handle<DescriptorArray> desc, int enumeration_index,
-      int slack = 0);
-
   // Sort the instance descriptors by the hash codes of their keys.
   V8_EXPORT_PRIVATE void Sort();
 
@@ -130,21 +123,23 @@ class DescriptorArray
   // Search the instance descriptors for given name. {concurrent_search} signals
   // if we are doing the search on a background thread. If so, we will sacrifice
   // speed for thread-safety.
-  V8_INLINE InternalIndex Search(Name name, int number_of_own_descriptors,
+  V8_INLINE InternalIndex Search(Tagged<Name> name,
+                                 int number_of_own_descriptors,
                                  bool concurrent_search = false);
-  V8_INLINE InternalIndex Search(Name name, Map map,
+  V8_INLINE InternalIndex Search(Tagged<Name> name, Tagged<Map> map,
                                  bool concurrent_search = false);
 
   // Search the instance descriptors for given field offset.
   V8_INLINE InternalIndex Search(int field_offset,
                                  int number_of_own_descriptors);
-  V8_INLINE InternalIndex Search(int field_offset, Map map);
+  V8_INLINE InternalIndex Search(int field_offset, Tagged<Map> map);
 
   // As the above, but uses DescriptorLookupCache and updates it when
   // necessary.
-  V8_INLINE InternalIndex SearchWithCache(Isolate* isolate, Name name, Map map);
+  V8_INLINE InternalIndex SearchWithCache(Isolate* isolate, Tagged<Name> name,
+                                          Tagged<Map> map);
 
-  bool IsEqualUpTo(DescriptorArray desc, int nof_descriptors);
+  bool IsEqualUpTo(Tagged<DescriptorArray> desc, int nof_descriptors);
 
   // Allocates a DescriptorArray, but returns the singleton
   // empty descriptor array object if number_of_descriptors is 0.
@@ -153,8 +148,9 @@ class DescriptorArray
       IsolateT* isolate, int nof_descriptors, int slack,
       AllocationType allocation = AllocationType::kYoung);
 
-  void Initialize(EnumCache enum_cache, HeapObject undefined_value,
-                  int nof_descriptors, int slack, uint32_t raw_gc_state);
+  void Initialize(Tagged<EnumCache> enum_cache,
+                  Tagged<HeapObject> undefined_value, int nof_descriptors,
+                  int slack, uint32_t raw_gc_state);
 
   // Constant for denoting key was not found.
   static const int kNotFound = -1;
@@ -208,7 +204,7 @@ class DescriptorArray
   V8_EXPORT_PRIVATE bool IsSortedNoDuplicates();
 
   // Are two DescriptorArrays equal?
-  bool IsEqualTo(DescriptorArray other);
+  bool IsEqualTo(Tagged<DescriptorArray> other);
 #endif
 
   static constexpr int ToDetailsIndex(int descriptor_number) {
@@ -229,14 +225,14 @@ class DescriptorArray
   using EntryValueField = TaggedField<MaybeObject, kEntryValueOffset>;
 
  private:
-  inline void SetKey(InternalIndex descriptor_number, Name key);
+  inline void SetKey(InternalIndex descriptor_number, Tagged<Name> key);
   inline void SetValue(InternalIndex descriptor_number, MaybeObject value);
   inline void SetDetails(InternalIndex descriptor_number,
                          PropertyDetails details);
 
   // Transfer a complete descriptor from the src descriptor array to this
   // descriptor array.
-  void CopyFrom(InternalIndex index, DescriptorArray src);
+  void CopyFrom(InternalIndex index, Tagged<DescriptorArray> src);
 
   inline void SetSortedKey(int pointer, int descriptor_number);
 
@@ -287,7 +283,7 @@ class DescriptorArrayMarkingState final {
   // The call issues and Acq/Rel barrier to allow synchronizing other state
   // (e.g. value of descriptor slots) with it.
   static inline bool TryUpdateIndicesToMark(unsigned gc_epoch,
-                                            DescriptorArray array,
+                                            Tagged<DescriptorArray> array,
                                             DescriptorIndex index_to_mark);
 
   // Used from the visitor when processing a DescriptorArray. Returns a range of
@@ -295,7 +291,8 @@ class DescriptorArrayMarkingState final {
   // end. The method signals the first invocation by returning start == 0, and
   // end != 0.
   static inline std::pair<DescriptorIndex, DescriptorIndex>
-  AcquireDescriptorRangeToMark(unsigned gc_epoch, DescriptorArray array);
+  AcquireDescriptorRangeToMark(unsigned gc_epoch,
+                               Tagged<DescriptorArray> array);
 
  private:
   static constexpr RawGCStateType NewState(unsigned masked_epoch,
@@ -305,7 +302,7 @@ class DescriptorArrayMarkingState final {
            Delta::encode(delta);
   }
 
-  static bool SwapState(DescriptorArray array, RawGCStateType old_state,
+  static bool SwapState(Tagged<DescriptorArray> array, RawGCStateType old_state,
                         RawGCStateType new_state) {
     return static_cast<RawGCStateType>(base::AcquireRelease_CompareAndSwap(
                reinterpret_cast<base::Atomic32*>(
diff --git a/deps/v8/src/objects/dictionary-inl.h b/deps/v8/src/objects/dictionary-inl.h
index 05f774222cbd9b..4f7a06cc6ee95f 100644
--- a/deps/v8/src/objects/dictionary-inl.h
+++ b/deps/v8/src/objects/dictionary-inl.h
@@ -30,26 +30,42 @@ Dictionary<Derived, Shape>::Dictionary(Address ptr)
     : HashTable<Derived, Shape>(ptr) {}
 
 template <typename Derived, typename Shape>
-Object Dictionary<Derived, Shape>::ValueAt(InternalIndex entry) {
+Tagged<Object> Dictionary<Derived, Shape>::ValueAt(InternalIndex entry) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return ValueAt(cage_base, entry);
 }
 
 template <typename Derived, typename Shape>
-Object Dictionary<Derived, Shape>::ValueAt(PtrComprCageBase cage_base,
-                                           InternalIndex entry) {
+Tagged<Object> Dictionary<Derived, Shape>::ValueAt(PtrComprCageBase cage_base,
+                                                   InternalIndex entry) {
   return this->get(cage_base, DerivedHashTable::EntryToIndex(entry) +
                                   Derived::kEntryValueIndex);
 }
 
 template <typename Derived, typename Shape>
-base::Optional<Object> Dictionary<Derived, Shape>::TryValueAt(
+Tagged<Object> Dictionary<Derived, Shape>::ValueAt(InternalIndex entry,
+                                                   SeqCstAccessTag tag) {
+  PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
+  return ValueAt(cage_base, entry, tag);
+}
+
+template <typename Derived, typename Shape>
+Tagged<Object> Dictionary<Derived, Shape>::ValueAt(PtrComprCageBase cage_base,
+                                                   InternalIndex entry,
+                                                   SeqCstAccessTag tag) {
+  return this->get(
+      cage_base,
+      DerivedHashTable::EntryToIndex(entry) + Derived::kEntryValueIndex, tag);
+}
+
+template <typename Derived, typename Shape>
+base::Optional<Tagged<Object>> Dictionary<Derived, Shape>::TryValueAt(
     InternalIndex entry) {
 #if DEBUG
   Isolate* isolate;
   GetIsolateFromHeapObject(*this, &isolate);
   DCHECK_NE(isolate, nullptr);
-  SLOW_DCHECK(!isolate->heap()->IsPendingAllocation(*this));
+  SLOW_DCHECK(!isolate->heap()->IsPendingAllocation(Tagged(*this)));
 #endif  // DEBUG
   // We can read length() in a non-atomic way since we are reading an
   // initialized object which is not pending allocation.
@@ -61,11 +77,38 @@ base::Optional<Object> Dictionary<Derived, Shape>::TryValueAt(
 }
 
 template <typename Derived, typename Shape>
-void Dictionary<Derived, Shape>::ValueAtPut(InternalIndex entry, Object value) {
+void Dictionary<Derived, Shape>::ValueAtPut(InternalIndex entry,
+                                            Tagged<Object> value) {
   this->set(DerivedHashTable::EntryToIndex(entry) + Derived::kEntryValueIndex,
             value);
 }
 
+template <typename Derived, typename Shape>
+void Dictionary<Derived, Shape>::ValueAtPut(InternalIndex entry,
+                                            Tagged<Object> value,
+                                            SeqCstAccessTag tag) {
+  this->set(DerivedHashTable::EntryToIndex(entry) + Derived::kEntryValueIndex,
+            value, tag);
+}
+
+template <typename Derived, typename Shape>
+Tagged<Object> Dictionary<Derived, Shape>::ValueAtSwap(InternalIndex entry,
+                                                       Tagged<Object> value,
+                                                       SeqCstAccessTag tag) {
+  return this->swap(
+      DerivedHashTable::EntryToIndex(entry) + Derived::kEntryValueIndex, value,
+      tag);
+}
+
+template <typename Derived, typename Shape>
+Tagged<Object> Dictionary<Derived, Shape>::ValueAtCompareAndSwap(
+    InternalIndex entry, Tagged<Object> expected, Tagged<Object> value,
+    SeqCstAccessTag tag) {
+  return this->compare_and_swap(
+      DerivedHashTable::EntryToIndex(entry) + Derived::kEntryValueIndex,
+      expected, value, tag);
+}
+
 template <typename Derived, typename Shape>
 PropertyDetails Dictionary<Derived, Shape>::DetailsAt(InternalIndex entry) {
   return Shape::DetailsAt(Derived::cast(*this), entry);
@@ -100,7 +143,7 @@ void BaseNameDictionary<Derived, Shape>::SetHash(int hash) {
 
 template <typename Derived, typename Shape>
 int BaseNameDictionary<Derived, Shape>::Hash() const {
-  Object hash_obj = this->get(kObjectHashIndex);
+  Tagged<Object> hash_obj = this->get(kObjectHashIndex);
   int hash = Smi::ToInt(hash_obj);
   DCHECK(PropertyArray::HashField::is_valid(hash));
   return hash;
@@ -108,34 +151,34 @@ int BaseNameDictionary<Derived, Shape>::Hash() const {
 
 GlobalDictionary::GlobalDictionary(Address ptr)
     : BaseNameDictionary<GlobalDictionary, GlobalDictionaryShape>(ptr) {
-  SLOW_DCHECK(IsGlobalDictionary());
+  SLOW_DCHECK(IsGlobalDictionary(*this));
 }
 
 NameDictionary::NameDictionary(Address ptr)
     : BaseNameDictionary<NameDictionary, NameDictionaryShape>(ptr) {
-  SLOW_DCHECK(IsNameDictionary());
+  SLOW_DCHECK(IsNameDictionary(*this));
 }
 
 NumberDictionary::NumberDictionary(Address ptr)
     : Dictionary<NumberDictionary, NumberDictionaryShape>(ptr) {
-  SLOW_DCHECK(IsNumberDictionary());
+  SLOW_DCHECK(IsNumberDictionary(*this));
 }
 
 SimpleNumberDictionary::SimpleNumberDictionary(Address ptr)
     : Dictionary<SimpleNumberDictionary, SimpleNumberDictionaryShape>(ptr) {
-  SLOW_DCHECK(IsSimpleNumberDictionary());
+  SLOW_DCHECK(IsSimpleNumberDictionary(*this));
 }
 
 bool NumberDictionary::requires_slow_elements() {
-  Object max_index_object = get(kMaxNumberKeyIndex);
-  if (!max_index_object.IsSmi()) return false;
+  Tagged<Object> max_index_object = get(kMaxNumberKeyIndex);
+  if (!IsSmi(max_index_object)) return false;
   return 0 != (Smi::ToInt(max_index_object) & kRequiresSlowElementsMask);
 }
 
 uint32_t NumberDictionary::max_number_key() {
   DCHECK(!requires_slow_elements());
-  Object max_index_object = get(kMaxNumberKeyIndex);
-  if (!max_index_object.IsSmi()) return 0;
+  Tagged<Object> max_index_object = get(kMaxNumberKeyIndex);
+  if (!IsSmi(max_index_object)) return 0;
   uint32_t value = static_cast<uint32_t>(Smi::ToInt(max_index_object));
   return value >> kRequiresSlowElementsTagSize;
 }
@@ -146,17 +189,18 @@ void NumberDictionary::set_requires_slow_elements() {
 
 template <typename Derived, typename Shape>
 void Dictionary<Derived, Shape>::ClearEntry(InternalIndex entry) {
-  Object the_hole = this->GetReadOnlyRoots().the_hole_value();
+  Tagged<Object> the_hole = this->GetReadOnlyRoots().the_hole_value();
   PropertyDetails details = PropertyDetails::Empty();
-  Derived::cast(*this).SetEntry(entry, the_hole, the_hole, details);
+  Derived::cast(*this)->SetEntry(entry, the_hole, the_hole, details);
 }
 
 template <typename Derived, typename Shape>
-void Dictionary<Derived, Shape>::SetEntry(InternalIndex entry, Object key,
-                                          Object value,
+void Dictionary<Derived, Shape>::SetEntry(InternalIndex entry,
+                                          Tagged<Object> key,
+                                          Tagged<Object> value,
                                           PropertyDetails details) {
   DCHECK(Dictionary::kEntrySize == 2 || Dictionary::kEntrySize == 3);
-  DCHECK(!key.IsName() || details.dictionary_index() > 0);
+  DCHECK(!IsName(key) || details.dictionary_index() > 0);
   int index = DerivedHashTable::EntryToIndex(entry);
   DisallowGarbageCollection no_gc;
   WriteBarrierMode mode = this->GetWriteBarrierMode(no_gc);
@@ -173,38 +217,39 @@ ObjectSlot Dictionary<Derived, Shape>::RawFieldOfValueAt(InternalIndex entry) {
 
 template <typename Key>
 template <typename Dictionary>
-PropertyDetails BaseDictionaryShape<Key>::DetailsAt(Dictionary dict,
+PropertyDetails BaseDictionaryShape<Key>::DetailsAt(Tagged<Dictionary> dict,
                                                     InternalIndex entry) {
   static_assert(Dictionary::kEntrySize == 3);
   DCHECK(entry.is_found());
-  return PropertyDetails(Smi::cast(dict.get(Dictionary::EntryToIndex(entry) +
-                                            Dictionary::kEntryDetailsIndex)));
+  return PropertyDetails(Smi::cast(dict->get(Dictionary::EntryToIndex(entry) +
+                                             Dictionary::kEntryDetailsIndex)));
 }
 
 template <typename Key>
 template <typename Dictionary>
-void BaseDictionaryShape<Key>::DetailsAtPut(Dictionary dict,
+void BaseDictionaryShape<Key>::DetailsAtPut(Tagged<Dictionary> dict,
                                             InternalIndex entry,
                                             PropertyDetails value) {
   static_assert(Dictionary::kEntrySize == 3);
-  dict.set(Dictionary::EntryToIndex(entry) + Dictionary::kEntryDetailsIndex,
-           value.AsSmi());
+  dict->set(Dictionary::EntryToIndex(entry) + Dictionary::kEntryDetailsIndex,
+            value.AsSmi());
 }
 
-Object GlobalDictionaryShape::Unwrap(Object object) {
-  return PropertyCell::cast(object).name();
+Tagged<Object> GlobalDictionaryShape::Unwrap(Tagged<Object> object) {
+  return PropertyCell::cast(object)->name();
 }
 
 Handle<Map> GlobalDictionary::GetMap(ReadOnlyRoots roots) {
   return roots.global_dictionary_map_handle();
 }
 
-Name NameDictionary::NameAt(InternalIndex entry) {
+Tagged<Name> NameDictionary::NameAt(InternalIndex entry) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return NameAt(cage_base, entry);
 }
 
-Name NameDictionary::NameAt(PtrComprCageBase cage_base, InternalIndex entry) {
+Tagged<Name> NameDictionary::NameAt(PtrComprCageBase cage_base,
+                                    InternalIndex entry) {
   return Name::cast(KeyAt(cage_base, entry));
 }
 
@@ -220,58 +265,59 @@ void NameDictionary::set_flags(uint32_t flags) {
   this->set(kFlagsIndex, Smi::FromInt(flags));
 }
 
-BIT_FIELD_ACCESSORS(NameDictionary, flags, may_have_interesting_symbols,
-                    NameDictionary::MayHaveInterestingSymbolsBit)
+BIT_FIELD_ACCESSORS(NameDictionary, flags, may_have_interesting_properties,
+                    NameDictionary::MayHaveInterestingPropertiesBit)
 
-PropertyCell GlobalDictionary::CellAt(InternalIndex entry) {
+Tagged<PropertyCell> GlobalDictionary::CellAt(InternalIndex entry) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return CellAt(cage_base, entry);
 }
 
-PropertyCell GlobalDictionary::CellAt(PtrComprCageBase cage_base,
-                                      InternalIndex entry) {
-  DCHECK(KeyAt(cage_base, entry).IsPropertyCell(cage_base));
+Tagged<PropertyCell> GlobalDictionary::CellAt(PtrComprCageBase cage_base,
+                                              InternalIndex entry) {
+  DCHECK(IsPropertyCell(KeyAt(cage_base, entry), cage_base));
   return PropertyCell::cast(KeyAt(cage_base, entry));
 }
 
-Name GlobalDictionary::NameAt(InternalIndex entry) {
+Tagged<Name> GlobalDictionary::NameAt(InternalIndex entry) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return NameAt(cage_base, entry);
 }
 
-Name GlobalDictionary::NameAt(PtrComprCageBase cage_base, InternalIndex entry) {
-  return CellAt(cage_base, entry).name(cage_base);
+Tagged<Name> GlobalDictionary::NameAt(PtrComprCageBase cage_base,
+                                      InternalIndex entry) {
+  return CellAt(cage_base, entry)->name(cage_base);
 }
 
-Object GlobalDictionary::ValueAt(InternalIndex entry) {
+Tagged<Object> GlobalDictionary::ValueAt(InternalIndex entry) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return ValueAt(cage_base, entry);
 }
 
-Object GlobalDictionary::ValueAt(PtrComprCageBase cage_base,
-                                 InternalIndex entry) {
-  return CellAt(cage_base, entry).value(cage_base);
+Tagged<Object> GlobalDictionary::ValueAt(PtrComprCageBase cage_base,
+                                         InternalIndex entry) {
+  return CellAt(cage_base, entry)->value(cage_base);
 }
 
-void GlobalDictionary::SetEntry(InternalIndex entry, Object key, Object value,
-                                PropertyDetails details) {
-  DCHECK_EQ(key, PropertyCell::cast(value).name());
+void GlobalDictionary::SetEntry(InternalIndex entry, Tagged<Object> key,
+                                Tagged<Object> value, PropertyDetails details) {
+  DCHECK_EQ(key, PropertyCell::cast(value)->name());
   set(EntryToIndex(entry) + kEntryKeyIndex, value);
   DetailsAtPut(entry, details);
 }
 
 void GlobalDictionary::ClearEntry(InternalIndex entry) {
-  Object the_hole = this->GetReadOnlyRoots().the_hole_value();
+  Tagged<Hole> the_hole = this->GetReadOnlyRoots().the_hole_value();
   set(EntryToIndex(entry) + kEntryKeyIndex, the_hole);
 }
 
-void GlobalDictionary::ValueAtPut(InternalIndex entry, Object value) {
+void GlobalDictionary::ValueAtPut(InternalIndex entry, Tagged<Object> value) {
   set(EntryToIndex(entry), value);
 }
 
-bool NumberDictionaryBaseShape::IsMatch(uint32_t key, Object other) {
-  DCHECK(other.IsNumber());
-  return key == static_cast<uint32_t>(other.Number());
+bool NumberDictionaryBaseShape::IsMatch(uint32_t key, Tagged<Object> other) {
+  DCHECK(IsNumber(other));
+  return key == static_cast<uint32_t>(Object::Number(other));
 }
 
 uint32_t NumberDictionaryBaseShape::Hash(ReadOnlyRoots roots, uint32_t key) {
@@ -279,20 +325,22 @@ uint32_t NumberDictionaryBaseShape::Hash(ReadOnlyRoots roots, uint32_t key) {
 }
 
 uint32_t NumberDictionaryBaseShape::HashForObject(ReadOnlyRoots roots,
-                                                  Object other) {
-  DCHECK(other.IsNumber());
-  return ComputeSeededHash(static_cast<uint32_t>(other.Number()),
+                                                  Tagged<Object> other) {
+  DCHECK(IsNumber(other));
+  return ComputeSeededHash(static_cast<uint32_t>(Object::Number(other)),
                            HashSeed(roots));
 }
 
+template <AllocationType allocation>
 Handle<Object> NumberDictionaryBaseShape::AsHandle(Isolate* isolate,
                                                    uint32_t key) {
-  return isolate->factory()->NewNumberFromUint(key);
+  return isolate->factory()->NewNumberFromUint<allocation>(key);
 }
 
+template <AllocationType allocation>
 Handle<Object> NumberDictionaryBaseShape::AsHandle(LocalIsolate* isolate,
                                                    uint32_t key) {
-  return isolate->factory()->NewNumberFromUint<AllocationType::kOld>(key);
+  return isolate->factory()->NewNumberFromUint<allocation>(key);
 }
 
 Handle<Map> NumberDictionary::GetMap(ReadOnlyRoots roots) {
@@ -303,58 +351,61 @@ Handle<Map> SimpleNumberDictionary::GetMap(ReadOnlyRoots roots) {
   return roots.simple_number_dictionary_map_handle();
 }
 
-bool BaseNameDictionaryShape::IsMatch(Handle<Name> key, Object other) {
-  DCHECK(other.IsTheHole() || Name::cast(other).IsUniqueName());
-  DCHECK(key->IsUniqueName());
+bool BaseNameDictionaryShape::IsMatch(Handle<Name> key, Tagged<Object> other) {
+  DCHECK(IsTheHole(other) || IsUniqueName(Name::cast(other)));
+  DCHECK(IsUniqueName(*key));
   return *key == other;
 }
 
 uint32_t BaseNameDictionaryShape::Hash(ReadOnlyRoots roots, Handle<Name> key) {
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   return key->hash();
 }
 
 uint32_t BaseNameDictionaryShape::HashForObject(ReadOnlyRoots roots,
-                                                Object other) {
-  DCHECK(other.IsUniqueName());
-  return Name::cast(other).hash();
+                                                Tagged<Object> other) {
+  DCHECK(IsUniqueName(other));
+  return Name::cast(other)->hash();
 }
 
-bool GlobalDictionaryShape::IsMatch(Handle<Name> key, Object other) {
-  DCHECK(key->IsUniqueName());
-  DCHECK(PropertyCell::cast(other).name().IsUniqueName());
-  return *key == PropertyCell::cast(other).name();
+bool GlobalDictionaryShape::IsMatch(Handle<Name> key, Tagged<Object> other) {
+  DCHECK(IsUniqueName(*key));
+  DCHECK(IsUniqueName(PropertyCell::cast(other)->name()));
+  return *key == PropertyCell::cast(other)->name();
 }
 
 uint32_t GlobalDictionaryShape::HashForObject(ReadOnlyRoots roots,
-                                              Object other) {
-  return PropertyCell::cast(other).name().hash();
+                                              Tagged<Object> other) {
+  return PropertyCell::cast(other)->name()->hash();
 }
 
+template <AllocationType allocation>
 Handle<Object> BaseNameDictionaryShape::AsHandle(Isolate* isolate,
                                                  Handle<Name> key) {
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   return key;
 }
 
+template <AllocationType allocation>
 Handle<Object> BaseNameDictionaryShape::AsHandle(LocalIsolate* isolate,
                                                  Handle<Name> key) {
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   return key;
 }
 
 template <typename Dictionary>
-PropertyDetails GlobalDictionaryShape::DetailsAt(Dictionary dict,
+PropertyDetails GlobalDictionaryShape::DetailsAt(Tagged<Dictionary> dict,
                                                  InternalIndex entry) {
   DCHECK(entry.is_found());
-  return dict.CellAt(entry).property_details();
+  return dict->CellAt(entry)->property_details();
 }
 
 template <typename Dictionary>
-void GlobalDictionaryShape::DetailsAtPut(Dictionary dict, InternalIndex entry,
+void GlobalDictionaryShape::DetailsAtPut(Tagged<Dictionary> dict,
+                                         InternalIndex entry,
                                          PropertyDetails value) {
   DCHECK(entry.is_found());
-  dict.CellAt(entry).UpdatePropertyDetailsExceptCellType(value);
+  dict->CellAt(entry)->UpdatePropertyDetailsExceptCellType(value);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/dictionary.h b/deps/v8/src/objects/dictionary.h
index c5b1920873de68..887c2157b0c4e8 100644
--- a/deps/v8/src/objects/dictionary.h
+++ b/deps/v8/src/objects/dictionary.h
@@ -26,11 +26,6 @@ using PropertyDictionary = SwissNameDictionary;
 using PropertyDictionary = NameDictionary;
 #endif
 
-template <typename T>
-class Handle;
-
-class Isolate;
-
 template <typename Derived, typename Shape>
 class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) Dictionary
     : public HashTable<Derived, Shape> {
@@ -38,13 +33,29 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) Dictionary
 
  public:
   using Key = typename Shape::Key;
-  inline Object ValueAt(InternalIndex entry);
-  inline Object ValueAt(PtrComprCageBase cage_base, InternalIndex entry);
+  inline Tagged<Object> ValueAt(InternalIndex entry);
+  inline Tagged<Object> ValueAt(PtrComprCageBase cage_base,
+                                InternalIndex entry);
+  inline Tagged<Object> ValueAt(InternalIndex entry, SeqCstAccessTag);
+  inline Tagged<Object> ValueAt(PtrComprCageBase cage_base, InternalIndex entry,
+                                SeqCstAccessTag);
   // Returns {} if we would be reading out of the bounds of the object.
-  inline base::Optional<Object> TryValueAt(InternalIndex entry);
+  inline base::Optional<Tagged<Object>> TryValueAt(InternalIndex entry);
 
   // Set the value for entry.
-  inline void ValueAtPut(InternalIndex entry, Object value);
+  inline void ValueAtPut(InternalIndex entry, Tagged<Object> value);
+  inline void ValueAtPut(InternalIndex entry, Tagged<Object> value,
+                         SeqCstAccessTag);
+
+  // Swap the value for the entry.
+  inline Tagged<Object> ValueAtSwap(InternalIndex entry, Tagged<Object> value,
+                                    SeqCstAccessTag);
+
+  // Compare and swap the value for the entry.
+  inline Tagged<Object> ValueAtCompareAndSwap(InternalIndex entry,
+                                              Tagged<Object> expected,
+                                              Tagged<Object> value,
+                                              SeqCstAccessTag);
 
   // Returns the property details for the property at entry.
   inline PropertyDetails DetailsAt(InternalIndex entry);
@@ -67,18 +78,21 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) Dictionary
   int NumberOfEnumerableProperties();
 
   // Returns the key (slow).
-  Object SlowReverseLookup(Object value);
+  Tagged<Object> SlowReverseLookup(Tagged<Object> value);
 
   inline void ClearEntry(InternalIndex entry);
 
   // Sets the entry to (key, value) pair.
-  inline void SetEntry(InternalIndex entry, Object key, Object value,
-                       PropertyDetails details);
+  inline void SetEntry(InternalIndex entry, Tagged<Object> key,
+                       Tagged<Object> value, PropertyDetails details);
 
   // Garbage collection support.
   inline ObjectSlot RawFieldOfValueAt(InternalIndex entry);
 
-  template <typename IsolateT>
+  template <typename IsolateT, AllocationType key_allocation =
+                                   std::is_same<IsolateT, Isolate>::value
+                                       ? AllocationType::kYoung
+                                       : AllocationType::kOld>
   V8_WARN_UNUSED_RESULT static Handle<Derived> Add(
       IsolateT* isolate, Handle<Derived> dictionary, Key key,
       Handle<Object> value, PropertyDetails details,
@@ -86,15 +100,19 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) Dictionary
 
   // This method is only safe to use when it is guaranteed that the dictionary
   // doesn't need to grow.
-  // The number of elements stored is not upted. Use
+  // The number of elements stored is not updated. Use
   // |SetInitialNumberOfElements| to update the number in one go.
-  template <typename IsolateT>
+  template <typename IsolateT, AllocationType key_allocation =
+                                   std::is_same<IsolateT, Isolate>::value
+                                       ? AllocationType::kYoung
+                                       : AllocationType::kOld>
   static void UncheckedAdd(IsolateT* isolate, Handle<Derived> dictionary,
                            Key key, Handle<Object> value,
                            PropertyDetails details);
 
-  static Handle<Derived> ShallowCopy(Isolate* isolate,
-                                     Handle<Derived> dictionary);
+  static Handle<Derived> ShallowCopy(
+      Isolate* isolate, Handle<Derived> dictionary,
+      AllocationType allocation = AllocationType::kYoung);
 
  protected:
   // Generic at put operation.
@@ -120,19 +138,23 @@ class BaseDictionaryShape : public BaseShape<Key> {
  public:
   static const bool kHasDetails = true;
   template <typename Dictionary>
-  static inline PropertyDetails DetailsAt(Dictionary dict, InternalIndex entry);
+  static inline PropertyDetails DetailsAt(Tagged<Dictionary> dict,
+                                          InternalIndex entry);
 
   template <typename Dictionary>
-  static inline void DetailsAtPut(Dictionary dict, InternalIndex entry,
+  static inline void DetailsAtPut(Tagged<Dictionary> dict, InternalIndex entry,
                                   PropertyDetails value);
 };
 
 class BaseNameDictionaryShape : public BaseDictionaryShape<Handle<Name>> {
  public:
-  static inline bool IsMatch(Handle<Name> key, Object other);
+  static inline bool IsMatch(Handle<Name> key, Tagged<Object> other);
   static inline uint32_t Hash(ReadOnlyRoots roots, Handle<Name> key);
-  static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
+  static inline uint32_t HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object);
+  template <AllocationType allocation = AllocationType::kYoung>
   static inline Handle<Object> AsHandle(Isolate* isolate, Handle<Name> key);
+  template <AllocationType allocation = AllocationType::kOld>
   static inline Handle<Object> AsHandle(LocalIsolate* isolate,
                                         Handle<Name> key);
   static const int kEntryValueIndex = 1;
@@ -215,15 +237,15 @@ class V8_EXPORT_PRIVATE NameDictionary
   static const int kEntryDetailsIndex = 2;
   static const int kInitialCapacity = 2;
 
-  inline Name NameAt(InternalIndex entry);
-  inline Name NameAt(PtrComprCageBase cage_base, InternalIndex entry);
+  inline Tagged<Name> NameAt(InternalIndex entry);
+  inline Tagged<Name> NameAt(PtrComprCageBase cage_base, InternalIndex entry);
 
   inline void set_hash(int hash);
   inline int hash() const;
 
   // Note: Flags are stored as smi, so only 31 bits are usable.
-  using MayHaveInterestingSymbolsBit = base::BitField<bool, 0, 1, uint32_t>;
-  DECL_BOOLEAN_ACCESSORS(may_have_interesting_symbols)
+  using MayHaveInterestingPropertiesBit = base::BitField<bool, 0, 1, uint32_t>;
+  DECL_BOOLEAN_ACCESSORS(may_have_interesting_properties)
 
   static constexpr int kFlagsDefault = 0;
 
@@ -243,21 +265,23 @@ class V8_EXPORT_PRIVATE NameDictionary
 
 class V8_EXPORT_PRIVATE GlobalDictionaryShape : public BaseNameDictionaryShape {
  public:
-  static inline bool IsMatch(Handle<Name> key, Object other);
-  static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
+  static inline bool IsMatch(Handle<Name> key, Tagged<Object> other);
+  static inline uint32_t HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object);
 
   static const bool kMatchNeedsHoleCheck = true;
   static const int kPrefixSize = 2;
   static const int kEntrySize = 1;
 
   template <typename Dictionary>
-  static inline PropertyDetails DetailsAt(Dictionary dict, InternalIndex entry);
+  static inline PropertyDetails DetailsAt(Tagged<Dictionary> dict,
+                                          InternalIndex entry);
 
   template <typename Dictionary>
-  static inline void DetailsAtPut(Dictionary dict, InternalIndex entry,
+  static inline void DetailsAtPut(Tagged<Dictionary> dict, InternalIndex entry,
                                   PropertyDetails value);
 
-  static inline Object Unwrap(Object key);
+  static inline Tagged<Object> Unwrap(Tagged<Object> key);
 };
 
 EXTERN_DECLARE_BASE_NAME_DICTIONARY(GlobalDictionary, GlobalDictionaryShape)
@@ -270,19 +294,23 @@ class V8_EXPORT_PRIVATE GlobalDictionary
   DECL_CAST(GlobalDictionary)
   DECL_PRINTER(GlobalDictionary)
 
-  inline Object ValueAt(InternalIndex entry);
-  inline Object ValueAt(PtrComprCageBase cage_base, InternalIndex entry);
-  inline PropertyCell CellAt(InternalIndex entry);
-  inline PropertyCell CellAt(PtrComprCageBase cage_base, InternalIndex entry);
-  inline void SetEntry(InternalIndex entry, Object key, Object value,
-                       PropertyDetails details);
+  inline Tagged<Object> ValueAt(InternalIndex entry);
+  inline Tagged<Object> ValueAt(PtrComprCageBase cage_base,
+                                InternalIndex entry);
+  inline Tagged<PropertyCell> CellAt(InternalIndex entry);
+  inline Tagged<PropertyCell> CellAt(PtrComprCageBase cage_base,
+                                     InternalIndex entry);
+  inline void SetEntry(InternalIndex entry, Tagged<Object> key,
+                       Tagged<Object> value, PropertyDetails details);
   inline void ClearEntry(InternalIndex entry);
-  inline Name NameAt(InternalIndex entry);
-  inline Name NameAt(PtrComprCageBase cage_base, InternalIndex entry);
-  inline void ValueAtPut(InternalIndex entry, Object value);
+  inline Tagged<Name> NameAt(InternalIndex entry);
+  inline Tagged<Name> NameAt(PtrComprCageBase cage_base, InternalIndex entry);
+  inline void ValueAtPut(InternalIndex entry, Tagged<Object> value);
 
-  base::Optional<PropertyCell> TryFindPropertyCellForConcurrentLookupIterator(
-      Isolate* isolate, Handle<Name> name, RelaxedLoadTag tag);
+  base::Optional<Tagged<PropertyCell>>
+  TryFindPropertyCellForConcurrentLookupIterator(Isolate* isolate,
+                                                 Handle<Name> name,
+                                                 RelaxedLoadTag tag);
 
   OBJECT_CONSTRUCTORS(
       GlobalDictionary,
@@ -291,12 +319,15 @@ class V8_EXPORT_PRIVATE GlobalDictionary
 
 class NumberDictionaryBaseShape : public BaseDictionaryShape<uint32_t> {
  public:
-  static inline bool IsMatch(uint32_t key, Object other);
+  static inline bool IsMatch(uint32_t key, Tagged<Object> other);
+  template <AllocationType allocation = AllocationType::kYoung>
   static inline Handle<Object> AsHandle(Isolate* isolate, uint32_t key);
+  template <AllocationType allocation = AllocationType::kOld>
   static inline Handle<Object> AsHandle(LocalIsolate* isolate, uint32_t key);
 
   static inline uint32_t Hash(ReadOnlyRoots roots, uint32_t key);
-  static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
+  static inline uint32_t HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object);
 
   static const bool kMatchNeedsHoleCheck = true;
 };
@@ -314,13 +345,13 @@ class SimpleNumberDictionaryShape : public NumberDictionaryBaseShape {
   static const int kEntrySize = 2;
 
   template <typename Dictionary>
-  static inline PropertyDetails DetailsAt(Dictionary dict,
+  static inline PropertyDetails DetailsAt(Tagged<Dictionary> dict,
                                           InternalIndex entry) {
     UNREACHABLE();
   }
 
   template <typename Dictionary>
-  static inline void DetailsAtPut(Dictionary dict, InternalIndex entry,
+  static inline void DetailsAtPut(Tagged<Dictionary> dict, InternalIndex entry,
                                   PropertyDetails value) {
     UNREACHABLE();
   }
@@ -378,7 +409,7 @@ class NumberDictionary
   void UpdateMaxNumberKey(uint32_t key, Handle<JSObject> dictionary_holder);
 
   // Sorting support
-  void CopyValuesTo(FixedArray elements);
+  void CopyValuesTo(Tagged<FixedArray> elements);
 
   // If slow elements are required we will never go back to fast-case
   // for the elements kept in this dictionary.  We require slow
@@ -414,15 +445,15 @@ class NumberDictionary
 // enumeration order.
 template <typename Dictionary>
 struct EnumIndexComparator {
-  explicit EnumIndexComparator(Dictionary dict) : dict(dict) {}
+  explicit EnumIndexComparator(Tagged<Dictionary> dict) : dict(dict) {}
   bool operator()(Tagged_t a, Tagged_t b) {
     PropertyDetails da(
-        dict.DetailsAt(InternalIndex(Smi(static_cast<Address>(a)).value())));
+        dict->DetailsAt(InternalIndex(Smi(static_cast<Address>(a)).value())));
     PropertyDetails db(
-        dict.DetailsAt(InternalIndex(Smi(static_cast<Address>(b)).value())));
+        dict->DetailsAt(InternalIndex(Smi(static_cast<Address>(b)).value())));
     return da.dictionary_index() < db.dictionary_index();
   }
-  Dictionary dict;
+  Tagged<Dictionary> dict;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/elements-inl.h b/deps/v8/src/objects/elements-inl.h
index 143137e8c60322..20951c35a80209 100644
--- a/deps/v8/src/objects/elements-inl.h
+++ b/deps/v8/src/objects/elements-inl.h
@@ -29,9 +29,10 @@ inline MaybeHandle<FixedArray> ElementsAccessor::PrependElementIndices(
                                convert, filter);
 }
 
-inline bool ElementsAccessor::HasElement(JSObject holder, uint32_t index,
+inline bool ElementsAccessor::HasElement(Tagged<JSObject> holder,
+                                         uint32_t index,
                                          PropertyFilter filter) {
-  return HasElement(holder, index, holder.elements(), filter);
+  return HasElement(holder, index, holder->elements(), filter);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/elements-kind.h b/deps/v8/src/objects/elements-kind.h
index 833641bae42881..881bacca1de811 100644
--- a/deps/v8/src/objects/elements-kind.h
+++ b/deps/v8/src/objects/elements-kind.h
@@ -373,6 +373,15 @@ inline bool IsFrozenElementsKind(ElementsKind kind) {
   return base::IsInRange(kind, PACKED_FROZEN_ELEMENTS, HOLEY_FROZEN_ELEMENTS);
 }
 
+inline bool IsFastOrNonextensibleOrSealedElementsKind(ElementsKind kind) {
+  const bool result = kind <= HOLEY_SEALED_ELEMENTS;
+  DCHECK_IMPLIES(result, IsFastElementsKind(kind) ||
+                             IsNonextensibleElementsKind(kind) ||
+                             IsSealedElementsKind(kind));
+  DCHECK_IMPLIES(result, !IsFrozenElementsKind(kind));
+  return result;
+}
+
 inline bool IsSmiOrObjectElementsKind(ElementsKind kind) {
   return base::IsInRange(kind, PACKED_SMI_ELEMENTS, HOLEY_ELEMENTS);
 }
diff --git a/deps/v8/src/objects/elements.cc b/deps/v8/src/objects/elements.cc
index 9d9d93215a1745..948165de2bb2ab 100644
--- a/deps/v8/src/objects/elements.cc
+++ b/deps/v8/src/objects/elements.cc
@@ -181,11 +181,12 @@ MaybeHandle<Object> ThrowArrayLengthRangeError(Isolate* isolate) {
                   Object);
 }
 
-WriteBarrierMode GetWriteBarrierMode(FixedArrayBase elements, ElementsKind kind,
+WriteBarrierMode GetWriteBarrierMode(Tagged<FixedArrayBase> elements,
+                                     ElementsKind kind,
                                      const DisallowGarbageCollection& promise) {
   if (IsSmiElementsKind(kind)) return SKIP_WRITE_BARRIER;
   if (IsDoubleElementsKind(kind)) return SKIP_WRITE_BARRIER;
-  return elements.GetWriteBarrierMode(promise);
+  return elements->GetWriteBarrierMode(promise);
 }
 
 // If kCopyToEndAndInitializeToHole is specified as the copy_size to
@@ -194,27 +195,29 @@ WriteBarrierMode GetWriteBarrierMode(FixedArrayBase elements, ElementsKind kind,
 // destination array with the hole.
 constexpr int kCopyToEndAndInitializeToHole = -1;
 
-void CopyObjectToObjectElements(Isolate* isolate, FixedArrayBase from_base,
+void CopyObjectToObjectElements(Isolate* isolate,
+                                Tagged<FixedArrayBase> from_base,
                                 ElementsKind from_kind, uint32_t from_start,
-                                FixedArrayBase to_base, ElementsKind to_kind,
-                                uint32_t to_start, int raw_copy_size) {
+                                Tagged<FixedArrayBase> to_base,
+                                ElementsKind to_kind, uint32_t to_start,
+                                int raw_copy_size) {
   ReadOnlyRoots roots(isolate);
-  DCHECK(to_base.map() != roots.fixed_cow_array_map());
+  DCHECK(to_base->map() != roots.fixed_cow_array_map());
   DisallowGarbageCollection no_gc;
   int copy_size = raw_copy_size;
   if (raw_copy_size < 0) {
     DCHECK_EQ(kCopyToEndAndInitializeToHole, raw_copy_size);
-    copy_size =
-        std::min(from_base.length() - from_start, to_base.length() - to_start);
+    copy_size = std::min(from_base->length() - from_start,
+                         to_base->length() - to_start);
     int start = to_start + copy_size;
-    int length = to_base.length() - start;
+    int length = to_base->length() - start;
     if (length > 0) {
-      MemsetTagged(FixedArray::cast(to_base).RawFieldOfElementAt(start),
+      MemsetTagged(FixedArray::cast(to_base)->RawFieldOfElementAt(start),
                    roots.the_hole_value(), length);
     }
   }
-  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base.length() &&
-         (copy_size + static_cast<int>(from_start)) <= from_base.length());
+  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() &&
+         (copy_size + static_cast<int>(from_start)) <= from_base->length());
   if (copy_size == 0) return;
   FixedArray from = FixedArray::cast(from_base);
   FixedArray to = FixedArray::cast(to_base);
@@ -225,12 +228,14 @@ void CopyObjectToObjectElements(Isolate* isolate, FixedArrayBase from_base,
       (IsObjectElementsKind(from_kind) && IsObjectElementsKind(to_kind))
           ? UPDATE_WRITE_BARRIER
           : SKIP_WRITE_BARRIER;
-  to.CopyElements(isolate, to_start, from, from_start, copy_size,
-                  write_barrier_mode);
+  to->CopyElements(isolate, to_start, from, from_start, copy_size,
+                   write_barrier_mode);
 }
 
-void CopyDictionaryToObjectElements(Isolate* isolate, FixedArrayBase from_base,
-                                    uint32_t from_start, FixedArrayBase to_base,
+void CopyDictionaryToObjectElements(Isolate* isolate,
+                                    Tagged<FixedArrayBase> from_base,
+                                    uint32_t from_start,
+                                    Tagged<FixedArrayBase> to_base,
                                     ElementsKind to_kind, uint32_t to_start,
                                     int raw_copy_size) {
   DisallowGarbageCollection no_gc;
@@ -238,11 +243,11 @@ void CopyDictionaryToObjectElements(Isolate* isolate, FixedArrayBase from_base,
   int copy_size = raw_copy_size;
   if (raw_copy_size < 0) {
     DCHECK_EQ(kCopyToEndAndInitializeToHole, raw_copy_size);
-    copy_size = from.max_number_key() + 1 - from_start;
+    copy_size = from->max_number_key() + 1 - from_start;
     int start = to_start + copy_size;
-    int length = to_base.length() - start;
+    int length = to_base->length() - start;
     if (length > 0) {
-      MemsetTagged(FixedArray::cast(to_base).RawFieldOfElementAt(start),
+      MemsetTagged(FixedArray::cast(to_base)->RawFieldOfElementAt(start),
                    ReadOnlyRoots(isolate).the_hole_value(), length);
     }
   }
@@ -250,19 +255,19 @@ void CopyDictionaryToObjectElements(Isolate* isolate, FixedArrayBase from_base,
   DCHECK(IsSmiOrObjectElementsKind(to_kind));
   if (copy_size == 0) return;
   FixedArray to = FixedArray::cast(to_base);
-  uint32_t to_length = to.length();
+  uint32_t to_length = to->length();
   if (to_start + copy_size > to_length) {
     copy_size = to_length - to_start;
   }
   WriteBarrierMode write_barrier_mode = GetWriteBarrierMode(to, to_kind, no_gc);
   for (int i = 0; i < copy_size; i++) {
-    InternalIndex entry = from.FindEntry(isolate, i + from_start);
+    InternalIndex entry = from->FindEntry(isolate, i + from_start);
     if (entry.is_found()) {
-      Object value = from.ValueAt(entry);
-      DCHECK(!value.IsTheHole(isolate));
-      to.set(i + to_start, value, write_barrier_mode);
+      Tagged<Object> value = from->ValueAt(entry);
+      DCHECK(!IsTheHole(value, isolate));
+      to->set(i + to_start, value, write_barrier_mode);
     } else {
-      to.set_the_hole(isolate, i + to_start);
+      to->set_the_hole(isolate, i + to_start);
     }
   }
 }
@@ -270,28 +275,30 @@ void CopyDictionaryToObjectElements(Isolate* isolate, FixedArrayBase from_base,
 // NOTE: this method violates the handlified function signature convention:
 // raw pointer parameters in the function that allocates.
 // See ElementsAccessorBase::CopyElements() for details.
-void CopyDoubleToObjectElements(Isolate* isolate, FixedArrayBase from_base,
-                                uint32_t from_start, FixedArrayBase to_base,
+void CopyDoubleToObjectElements(Isolate* isolate,
+                                Tagged<FixedArrayBase> from_base,
+                                uint32_t from_start,
+                                Tagged<FixedArrayBase> to_base,
                                 uint32_t to_start, int raw_copy_size) {
   int copy_size = raw_copy_size;
   if (raw_copy_size < 0) {
     DisallowGarbageCollection no_gc;
     DCHECK_EQ(kCopyToEndAndInitializeToHole, raw_copy_size);
-    copy_size =
-        std::min(from_base.length() - from_start, to_base.length() - to_start);
+    copy_size = std::min(from_base->length() - from_start,
+                         to_base->length() - to_start);
     // Also initialize the area that will be copied over since HeapNumber
     // allocation below can cause an incremental marking step, requiring all
     // existing heap objects to be propertly initialized.
     int start = to_start;
-    int length = to_base.length() - start;
+    int length = to_base->length() - start;
     if (length > 0) {
-      MemsetTagged(FixedArray::cast(to_base).RawFieldOfElementAt(start),
+      MemsetTagged(FixedArray::cast(to_base)->RawFieldOfElementAt(start),
                    ReadOnlyRoots(isolate).the_hole_value(), length);
     }
   }
 
-  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base.length() &&
-         (copy_size + static_cast<int>(from_start)) <= from_base.length());
+  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() &&
+         (copy_size + static_cast<int>(from_start)) <= from_base->length());
   if (copy_size == 0) return;
 
   // From here on, the code below could actually allocate. Therefore the raw
@@ -314,21 +321,22 @@ void CopyDoubleToObjectElements(Isolate* isolate, FixedArrayBase from_base,
   }
 }
 
-void CopyDoubleToDoubleElements(FixedArrayBase from_base, uint32_t from_start,
-                                FixedArrayBase to_base, uint32_t to_start,
-                                int raw_copy_size) {
+void CopyDoubleToDoubleElements(Tagged<FixedArrayBase> from_base,
+                                uint32_t from_start,
+                                Tagged<FixedArrayBase> to_base,
+                                uint32_t to_start, int raw_copy_size) {
   DisallowGarbageCollection no_gc;
   int copy_size = raw_copy_size;
   if (raw_copy_size < 0) {
     DCHECK_EQ(kCopyToEndAndInitializeToHole, raw_copy_size);
-    copy_size =
-        std::min(from_base.length() - from_start, to_base.length() - to_start);
-    for (int i = to_start + copy_size; i < to_base.length(); ++i) {
-      FixedDoubleArray::cast(to_base).set_the_hole(i);
+    copy_size = std::min(from_base->length() - from_start,
+                         to_base->length() - to_start);
+    for (int i = to_start + copy_size; i < to_base->length(); ++i) {
+      FixedDoubleArray::cast(to_base)->set_the_hole(i);
     }
   }
-  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base.length() &&
-         (copy_size + static_cast<int>(from_start)) <= from_base.length());
+  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() &&
+         (copy_size + static_cast<int>(from_start)) <= from_base->length());
   if (copy_size == 0) return;
   FixedDoubleArray from = FixedDoubleArray::cast(from_base);
   FixedDoubleArray to = FixedDoubleArray::cast(to_base);
@@ -350,37 +358,39 @@ void CopyDoubleToDoubleElements(FixedArrayBase from_base, uint32_t from_start,
 #endif
 }
 
-void CopySmiToDoubleElements(FixedArrayBase from_base, uint32_t from_start,
-                             FixedArrayBase to_base, uint32_t to_start,
+void CopySmiToDoubleElements(Tagged<FixedArrayBase> from_base,
+                             uint32_t from_start,
+                             Tagged<FixedArrayBase> to_base, uint32_t to_start,
                              int raw_copy_size) {
   DisallowGarbageCollection no_gc;
   int copy_size = raw_copy_size;
   if (raw_copy_size < 0) {
     DCHECK_EQ(kCopyToEndAndInitializeToHole, raw_copy_size);
-    copy_size = from_base.length() - from_start;
-    for (int i = to_start + copy_size; i < to_base.length(); ++i) {
-      FixedDoubleArray::cast(to_base).set_the_hole(i);
+    copy_size = from_base->length() - from_start;
+    for (int i = to_start + copy_size; i < to_base->length(); ++i) {
+      FixedDoubleArray::cast(to_base)->set_the_hole(i);
     }
   }
-  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base.length() &&
-         (copy_size + static_cast<int>(from_start)) <= from_base.length());
+  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() &&
+         (copy_size + static_cast<int>(from_start)) <= from_base->length());
   if (copy_size == 0) return;
   FixedArray from = FixedArray::cast(from_base);
   FixedDoubleArray to = FixedDoubleArray::cast(to_base);
-  Object the_hole = from.GetReadOnlyRoots().the_hole_value();
+  Tagged<Object> the_hole = from->GetReadOnlyRoots().the_hole_value();
   for (uint32_t from_end = from_start + static_cast<uint32_t>(copy_size);
        from_start < from_end; from_start++, to_start++) {
-    Object hole_or_smi = from.get(from_start);
+    Tagged<Object> hole_or_smi = from->get(from_start);
     if (hole_or_smi == the_hole) {
-      to.set_the_hole(to_start);
+      to->set_the_hole(to_start);
     } else {
-      to.set(to_start, Smi::ToInt(hole_or_smi));
+      to->set(to_start, Smi::ToInt(hole_or_smi));
     }
   }
 }
 
-void CopyPackedSmiToDoubleElements(FixedArrayBase from_base,
-                                   uint32_t from_start, FixedArrayBase to_base,
+void CopyPackedSmiToDoubleElements(Tagged<FixedArrayBase> from_base,
+                                   uint32_t from_start,
+                                   Tagged<FixedArrayBase> to_base,
                                    uint32_t to_start, int packed_size,
                                    int raw_copy_size) {
   DisallowGarbageCollection no_gc;
@@ -389,82 +399,85 @@ void CopyPackedSmiToDoubleElements(FixedArrayBase from_base,
   if (raw_copy_size < 0) {
     DCHECK_EQ(kCopyToEndAndInitializeToHole, raw_copy_size);
     copy_size = packed_size - from_start;
-    to_end = to_base.length();
+    to_end = to_base->length();
     for (uint32_t i = to_start + copy_size; i < to_end; ++i) {
-      FixedDoubleArray::cast(to_base).set_the_hole(i);
+      FixedDoubleArray::cast(to_base)->set_the_hole(i);
     }
   } else {
     to_end = to_start + static_cast<uint32_t>(copy_size);
   }
-  DCHECK(static_cast<int>(to_end) <= to_base.length());
+  DCHECK(static_cast<int>(to_end) <= to_base->length());
   DCHECK(packed_size >= 0 && packed_size <= copy_size);
-  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base.length() &&
-         (copy_size + static_cast<int>(from_start)) <= from_base.length());
+  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() &&
+         (copy_size + static_cast<int>(from_start)) <= from_base->length());
   if (copy_size == 0) return;
   FixedArray from = FixedArray::cast(from_base);
   FixedDoubleArray to = FixedDoubleArray::cast(to_base);
   for (uint32_t from_end = from_start + static_cast<uint32_t>(packed_size);
        from_start < from_end; from_start++, to_start++) {
-    Object smi = from.get(from_start);
-    DCHECK(!smi.IsTheHole());
-    to.set(to_start, Smi::ToInt(smi));
+    Tagged<Object> smi = from->get(from_start);
+    DCHECK(!IsTheHole(smi));
+    to->set(to_start, Smi::ToInt(smi));
   }
 }
 
-void CopyObjectToDoubleElements(FixedArrayBase from_base, uint32_t from_start,
-                                FixedArrayBase to_base, uint32_t to_start,
-                                int raw_copy_size) {
+void CopyObjectToDoubleElements(Tagged<FixedArrayBase> from_base,
+                                uint32_t from_start,
+                                Tagged<FixedArrayBase> to_base,
+                                uint32_t to_start, int raw_copy_size) {
   DisallowGarbageCollection no_gc;
   int copy_size = raw_copy_size;
   if (raw_copy_size < 0) {
     DCHECK_EQ(kCopyToEndAndInitializeToHole, raw_copy_size);
-    copy_size = from_base.length() - from_start;
-    for (int i = to_start + copy_size; i < to_base.length(); ++i) {
-      FixedDoubleArray::cast(to_base).set_the_hole(i);
+    copy_size = from_base->length() - from_start;
+    for (int i = to_start + copy_size; i < to_base->length(); ++i) {
+      FixedDoubleArray::cast(to_base)->set_the_hole(i);
     }
   }
-  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base.length() &&
-         (copy_size + static_cast<int>(from_start)) <= from_base.length());
+  DCHECK((copy_size + static_cast<int>(to_start)) <= to_base->length() &&
+         (copy_size + static_cast<int>(from_start)) <= from_base->length());
   if (copy_size == 0) return;
   FixedArray from = FixedArray::cast(from_base);
   FixedDoubleArray to = FixedDoubleArray::cast(to_base);
-  Object the_hole = from.GetReadOnlyRoots().the_hole_value();
+  Tagged<Object> the_hole = from->GetReadOnlyRoots().the_hole_value();
   for (uint32_t from_end = from_start + copy_size; from_start < from_end;
        from_start++, to_start++) {
-    Object hole_or_object = from.get(from_start);
+    Tagged<Object> hole_or_object = from->get(from_start);
     if (hole_or_object == the_hole) {
-      to.set_the_hole(to_start);
+      to->set_the_hole(to_start);
     } else {
-      to.set(to_start, hole_or_object.Number());
+      to->set(to_start, Object::Number(hole_or_object));
     }
   }
 }
 
-void CopyDictionaryToDoubleElements(Isolate* isolate, FixedArrayBase from_base,
-                                    uint32_t from_start, FixedArrayBase to_base,
+void CopyDictionaryToDoubleElements(Isolate* isolate,
+                                    Tagged<FixedArrayBase> from_base,
+                                    uint32_t from_start,
+                                    Tagged<FixedArrayBase> to_base,
                                     uint32_t to_start, int raw_copy_size) {
   DisallowGarbageCollection no_gc;
   NumberDictionary from = NumberDictionary::cast(from_base);
   int copy_size = raw_copy_size;
   if (copy_size < 0) {
     DCHECK_EQ(kCopyToEndAndInitializeToHole, copy_size);
-    copy_size = from.max_number_key() + 1 - from_start;
-    for (int i = to_start + copy_size; i < to_base.length(); ++i) {
-      FixedDoubleArray::cast(to_base).set_the_hole(i);
+    copy_size = from->max_number_key() + 1 - from_start;
+    for (int i = to_start + copy_size; i < to_base->length(); ++i) {
+      FixedDoubleArray::cast(to_base)->set_the_hole(i);
     }
   }
   if (copy_size == 0) return;
   FixedDoubleArray to = FixedDoubleArray::cast(to_base);
-  uint32_t to_length = to.length();
+  uint32_t to_length = to->length();
   if (to_start + copy_size > to_length) {
     copy_size = to_length - to_start;
   }
   for (int i = 0; i < copy_size; i++) {
-    InternalIndex entry = from.FindEntry(isolate, i + from_start);
+    InternalIndex entry = from->FindEntry(isolate, i + from_start);
     if (entry.is_found()) {
-      to.set(i + to_start, from.ValueAt(entry).Number());
+      to->set(i + to_start, Object::Number(from->ValueAt(entry)));
     } else {
-      to.set_the_hole(i + to_start);
+      to->set_the_hole(i + to_start);
     }
   }
 }
@@ -479,19 +492,21 @@ void SortIndices(Isolate* isolate, Handle<FixedArray> indices,
   AtomicSlot end(start + sort_size);
   std::sort(start, end, [isolate](Tagged_t elementA, Tagged_t elementB) {
 #ifdef V8_COMPRESS_POINTERS
-    Object a(V8HeapCompressionScheme::DecompressTagged(isolate, elementA));
-    Object b(V8HeapCompressionScheme::DecompressTagged(isolate, elementB));
+    Tagged<Object> a(
+        V8HeapCompressionScheme::DecompressTagged(isolate, elementA));
+    Tagged<Object> b(
+        V8HeapCompressionScheme::DecompressTagged(isolate, elementB));
 #else
-    Object a(elementA);
-    Object b(elementB);
+    Tagged<Object> a(elementA);
+    Tagged<Object> b(elementB);
 #endif
-    if (a.IsSmi() || !a.IsUndefined(isolate)) {
-      if (!b.IsSmi() && b.IsUndefined(isolate)) {
+    if (IsSmi(a) || !IsUndefined(a, isolate)) {
+      if (!IsSmi(b) && IsUndefined(b, isolate)) {
         return true;
       }
-      return a.Number() < b.Number();
+      return Object::Number(a) < Object::Number(b);
     }
-    return !b.IsSmi() && b.IsUndefined(isolate);
+    return !IsSmi(b) && IsUndefined(b, isolate);
   });
   isolate->heap()->WriteBarrierForRange(*indices, ObjectSlot(start),
                                         ObjectSlot(end));
@@ -500,7 +515,7 @@ void SortIndices(Isolate* isolate, Handle<FixedArray> indices,
 Maybe<bool> IncludesValueSlowPath(Isolate* isolate, Handle<JSObject> receiver,
                                   Handle<Object> value, size_t start_from,
                                   size_t length) {
-  bool search_for_hole = value->IsUndefined(isolate);
+  bool search_for_hole = IsUndefined(*value, isolate);
   for (size_t k = start_from; k < length; ++k) {
     LookupIterator it(isolate, receiver, k);
     if (!it.IsFound()) {
@@ -511,7 +526,7 @@ Maybe<bool> IncludesValueSlowPath(Isolate* isolate, Handle<JSObject> receiver,
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, element_k,
                                      Object::GetProperty(&it), Nothing<bool>());
 
-    if (value->SameValueZero(*element_k)) return Just(true);
+    if (Object::SameValueZero(*value, *element_k)) return Just(true);
   }
 
   return Just(false);
@@ -529,7 +544,7 @@ Maybe<int64_t> IndexOfValueSlowPath(Isolate* isolate, Handle<JSObject> receiver,
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, element_k, Object::GetProperty(&it), Nothing<int64_t>());
 
-    if (value->StrictEquals(*element_k)) return Just<int64_t>(k);
+    if (Object::StrictEquals(*value, *element_k)) return Just<int64_t>(k);
   }
 
   return Just<int64_t>(-1);
@@ -540,11 +555,12 @@ Maybe<int64_t> IndexOfValueSlowPath(Isolate* isolate, Handle<JSObject> receiver,
 // that take an entry (instead of an index) as an argument.
 class InternalElementsAccessor : public ElementsAccessor {
  public:
-  InternalIndex GetEntryForIndex(Isolate* isolate, JSObject holder,
-                                 FixedArrayBase backing_store,
+  InternalIndex GetEntryForIndex(Isolate* isolate, Tagged<JSObject> holder,
+                                 Tagged<FixedArrayBase> backing_store,
                                  size_t index) override = 0;
 
-  PropertyDetails GetDetails(JSObject holder, InternalIndex entry) override = 0;
+  PropertyDetails GetDetails(Tagged<JSObject> holder,
+                             InternalIndex entry) override = 0;
 };
 
 // Base class for element handler implementations. Contains the
@@ -576,61 +592,64 @@ class ElementsAccessorBase : public InternalElementsAccessor {
 
   static ElementsKind kind() { return ElementsTraits::Kind; }
 
-  static void ValidateContents(JSObject holder, size_t length) {}
+  static void ValidateContents(Tagged<JSObject> holder, size_t length) {}
 
-  static void ValidateImpl(JSObject holder) {
-    FixedArrayBase fixed_array_base = holder.elements();
-    if (!fixed_array_base.IsHeapObject()) return;
+  static void ValidateImpl(Tagged<JSObject> holder) {
+    Tagged<FixedArrayBase> fixed_array_base = holder->elements();
+    if (!IsHeapObject(fixed_array_base)) return;
     // Arrays that have been shifted in place can't be verified.
-    if (fixed_array_base.IsFreeSpaceOrFiller()) return;
+    if (IsFreeSpaceOrFiller(fixed_array_base)) return;
     size_t length = 0;
-    if (holder.IsJSArray()) {
-      Object length_obj = JSArray::cast(holder).length();
-      if (length_obj.IsSmi()) {
+    if (IsJSArray(holder)) {
+      Tagged<Object> length_obj = JSArray::cast(holder)->length();
+      if (IsSmi(length_obj)) {
         length = Smi::ToInt(length_obj);
       }
-    } else if (holder.IsJSTypedArray()) {
-      length = JSTypedArray::cast(holder).length();
+    } else if (IsJSTypedArray(holder)) {
+      length = JSTypedArray::cast(holder)->length();
     } else {
-      length = fixed_array_base.length();
+      length = fixed_array_base->length();
     }
     Subclass::ValidateContents(holder, length);
   }
 
-  void Validate(JSObject holder) final {
+  void Validate(Tagged<JSObject> holder) final {
     DisallowGarbageCollection no_gc;
     Subclass::ValidateImpl(holder);
   }
 
-  bool HasElement(JSObject holder, uint32_t index, FixedArrayBase backing_store,
+  bool HasElement(Tagged<JSObject> holder, uint32_t index,
+                  Tagged<FixedArrayBase> backing_store,
                   PropertyFilter filter) final {
-    return Subclass::HasElementImpl(holder.GetIsolate(), holder, index,
+    return Subclass::HasElementImpl(holder->GetIsolate(), holder, index,
                                     backing_store, filter);
   }
 
-  static bool HasElementImpl(Isolate* isolate, JSObject holder, size_t index,
-                             FixedArrayBase backing_store,
+  static bool HasElementImpl(Isolate* isolate, Tagged<JSObject> holder,
+                             size_t index, Tagged<FixedArrayBase> backing_store,
                              PropertyFilter filter = ALL_PROPERTIES) {
     return Subclass::GetEntryForIndexImpl(isolate, holder, backing_store, index,
                                           filter)
         .is_found();
   }
 
-  bool HasEntry(JSObject holder, InternalIndex entry) final {
-    return Subclass::HasEntryImpl(holder.GetIsolate(), holder.elements(),
+  bool HasEntry(Tagged<JSObject> holder, InternalIndex entry) final {
+    return Subclass::HasEntryImpl(holder->GetIsolate(), holder->elements(),
                                   entry);
   }
 
-  static bool HasEntryImpl(Isolate* isolate, FixedArrayBase backing_store,
+  static bool HasEntryImpl(Isolate* isolate,
+                           Tagged<FixedArrayBase> backing_store,
                            InternalIndex entry) {
     UNIMPLEMENTED();
   }
 
-  bool HasAccessors(JSObject holder) final {
-    return Subclass::HasAccessorsImpl(holder, holder.elements());
+  bool HasAccessors(Tagged<JSObject> holder) final {
+    return Subclass::HasAccessorsImpl(holder, holder->elements());
   }
 
-  static bool HasAccessorsImpl(JSObject holder, FixedArrayBase backing_store) {
+  static bool HasAccessorsImpl(Tagged<JSObject> holder,
+                               Tagged<FixedArrayBase> backing_store) {
     return false;
   }
 
@@ -645,50 +664,73 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     return Subclass::GetImpl(isolate, holder->elements(), entry);
   }
 
-  static Handle<Object> GetImpl(Isolate* isolate, FixedArrayBase backing_store,
+  static Handle<Object> GetImpl(Isolate* isolate,
+                                Tagged<FixedArrayBase> backing_store,
                                 InternalIndex entry) {
-    return handle(BackingStore::cast(backing_store).get(entry.as_int()),
+    return handle(BackingStore::cast(backing_store)->get(entry.as_int()),
                   isolate);
   }
 
   Handle<Object> GetAtomic(Isolate* isolate, Handle<JSObject> holder,
                            InternalIndex entry, SeqCstAccessTag tag) final {
-    return Subclass::GetAtomicInternalImpl(isolate, holder, entry, tag);
+    return Subclass::GetAtomicInternalImpl(isolate, holder->elements(), entry,
+                                           tag);
   }
 
-  static Handle<Object> GetAtomicInternalImpl(Isolate* isolate,
-                                              Handle<JSObject> holder,
-                                              InternalIndex entry,
-                                              SeqCstAccessTag tag) {
+  static Handle<Object> GetAtomicInternalImpl(
+      Isolate* isolate, Tagged<FixedArrayBase> backing_store,
+      InternalIndex entry, SeqCstAccessTag tag) {
     UNREACHABLE();
   }
 
-  void SetAtomic(Handle<JSObject> holder, InternalIndex entry, Object value,
-                 SeqCstAccessTag tag) final {
-    Subclass::SetAtomicInternalImpl(holder, entry, value, tag);
+  void SetAtomic(Handle<JSObject> holder, InternalIndex entry,
+                 Tagged<Object> value, SeqCstAccessTag tag) final {
+    Subclass::SetAtomicInternalImpl(holder->elements(), entry, value, tag);
   }
 
-  static void SetAtomicInternalImpl(Handle<JSObject> holder,
-                                    InternalIndex entry, Object value,
+  static void SetAtomicInternalImpl(Tagged<FixedArrayBase> backing_store,
+                                    InternalIndex entry, Tagged<Object> value,
                                     SeqCstAccessTag tag) {
     UNREACHABLE();
   }
 
   Handle<Object> SwapAtomic(Isolate* isolate, Handle<JSObject> holder,
-                            InternalIndex entry, Object value,
+                            InternalIndex entry, Tagged<Object> value,
                             SeqCstAccessTag tag) final {
-    return Subclass::SwapAtomicInternalImpl(isolate, holder, entry, value, tag);
+    return Subclass::SwapAtomicInternalImpl(isolate, holder->elements(), entry,
+                                            value, tag);
+  }
+
+  static Handle<Object> SwapAtomicInternalImpl(
+      Isolate* isolate, Tagged<FixedArrayBase> backing_store,
+      InternalIndex entry, Tagged<Object> value, SeqCstAccessTag tag) {
+    UNREACHABLE();
   }
 
-  static Handle<Object> SwapAtomicInternalImpl(Isolate* isolate,
-                                               Handle<JSObject> holder,
-                                               InternalIndex entry,
-                                               Object value,
-                                               SeqCstAccessTag tag) {
+  Handle<Object> CompareAndSwapAtomic(Isolate* isolate, Handle<JSObject> holder,
+                                      InternalIndex entry,
+                                      Tagged<Object> expected,
+                                      Tagged<Object> value,
+                                      SeqCstAccessTag tag) final {
+    return handle(HeapObject::SeqCst_CompareAndSwapField(
+                      expected, value,
+                      [=](Tagged<Object> expected_value,
+                          Tagged<Object> new_value) {
+                        return Subclass::CompareAndSwapAtomicInternalImpl(
+                            holder->elements(), entry, expected_value,
+                            new_value, tag);
+                      }),
+                  isolate);
+  }
+
+  static Tagged<Object> CompareAndSwapAtomicInternalImpl(
+      Tagged<FixedArrayBase> backing_store, InternalIndex entry,
+      Tagged<Object> expected, Tagged<Object> value, SeqCstAccessTag tag) {
     UNREACHABLE();
   }
 
-  void Set(Handle<JSObject> holder, InternalIndex entry, Object value) final {
+  void Set(Handle<JSObject> holder, InternalIndex entry,
+           Tagged<Object> value) final {
     Subclass::SetImpl(holder, entry, value);
   }
 
@@ -766,7 +808,7 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     DCHECK(!array->SetLengthWouldNormalize(length));
     DCHECK(IsFastElementsKind(array->GetElementsKind()));
     uint32_t old_length = 0;
-    CHECK(array->length().ToArrayIndex(&old_length));
+    CHECK(Object::ToArrayIndex(array->length(), &old_length));
 
     if (old_length < length) {
       ElementsKind kind = array->GetElementsKind();
@@ -799,11 +841,11 @@ class ElementsAccessorBase : public InternalElementsAccessor {
         isolate->heap()->RightTrimFixedArray(*backing_store, elements_to_trim);
         // Fill the non-trimmed elements with holes.
         BackingStore::cast(*backing_store)
-            .FillWithHoles(length,
-                           std::min(old_length, capacity - elements_to_trim));
+            ->FillWithHoles(length,
+                            std::min(old_length, capacity - elements_to_trim));
       } else {
         // Otherwise, fill the unused tail with holes.
-        BackingStore::cast(*backing_store).FillWithHoles(length, old_length);
+        BackingStore::cast(*backing_store)->FillWithHoles(length, old_length);
       }
     } else {
       // Check whether the backing store should be expanded.
@@ -817,26 +859,27 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     return Just(true);
   }
 
-  size_t NumberOfElements(JSObject receiver) final {
-    return Subclass::NumberOfElementsImpl(receiver, receiver.elements());
+  size_t NumberOfElements(Tagged<JSObject> receiver) final {
+    return Subclass::NumberOfElementsImpl(receiver, receiver->elements());
   }
 
-  static uint32_t NumberOfElementsImpl(JSObject receiver,
-                                       FixedArrayBase backing_store) {
+  static uint32_t NumberOfElementsImpl(Tagged<JSObject> receiver,
+                                       Tagged<FixedArrayBase> backing_store) {
     UNREACHABLE();
   }
 
-  static size_t GetMaxIndex(JSObject receiver, FixedArrayBase elements) {
-    if (receiver.IsJSArray()) {
-      DCHECK(JSArray::cast(receiver).length().IsSmi());
+  static size_t GetMaxIndex(Tagged<JSObject> receiver,
+                            Tagged<FixedArrayBase> elements) {
+    if (IsJSArray(receiver)) {
+      DCHECK(IsSmi(JSArray::cast(receiver)->length()));
       return static_cast<uint32_t>(
-          Smi::ToInt(JSArray::cast(receiver).length()));
+          Smi::ToInt(JSArray::cast(receiver)->length()));
     }
     return Subclass::GetCapacityImpl(receiver, elements);
   }
 
-  static size_t GetMaxNumberOfEntries(JSObject receiver,
-                                      FixedArrayBase elements) {
+  static size_t GetMaxNumberOfEntries(Tagged<JSObject> receiver,
+                                      Tagged<FixedArrayBase> elements) {
     return Subclass::GetMaxIndex(receiver, elements);
   }
 
@@ -872,8 +915,8 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     }
 
     int packed_size = kPackedSizeNotKnown;
-    if (IsFastPackedElementsKind(from_kind) && object->IsJSArray()) {
-      packed_size = Smi::ToInt(JSArray::cast(*object).length());
+    if (IsFastPackedElementsKind(from_kind) && IsJSArray(*object)) {
+      packed_size = Smi::ToInt(JSArray::cast(*object)->length());
     }
 
     Subclass::CopyElementsImpl(isolate, *old_elements, src_index, *new_elements,
@@ -908,7 +951,7 @@ class ElementsAccessorBase : public InternalElementsAccessor {
         DCHECK(
             (IsSmiElementsKind(from_kind) && IsDoubleElementsKind(to_kind)) ||
             (IsDoubleElementsKind(from_kind) && IsObjectElementsKind(to_kind)));
-        uint32_t capacity = static_cast<uint32_t>(object->elements().length());
+        uint32_t capacity = static_cast<uint32_t>(object->elements()->length());
         Handle<FixedArrayBase> elements;
         ASSIGN_RETURN_ON_EXCEPTION_VALUE(
             object->GetIsolate(), elements,
@@ -984,7 +1027,7 @@ class ElementsAccessorBase : public InternalElementsAccessor {
   Maybe<bool> GrowCapacity(Handle<JSObject> object, uint32_t index) final {
     // This function is intended to be called from optimized code. We don't
     // want to trigger lazy deopts there, so refuse to handle cases that would.
-    if (object->map().is_prototype_map() ||
+    if (object->map()->is_prototype_map() ||
         object->WouldConvertToSlowElements(index)) {
       return Just(false);
     }
@@ -992,6 +1035,12 @@ class ElementsAccessorBase : public InternalElementsAccessor {
                                         object->GetIsolate());
     uint32_t new_capacity = JSObject::NewElementsCapacity(index + 1);
     DCHECK(static_cast<uint32_t>(old_elements->length()) < new_capacity);
+    const uint32_t kMaxLength = IsDoubleElementsKind(kind())
+                                    ? FixedDoubleArray::kMaxLength
+                                    : FixedArray::kMaxLength;
+    if (new_capacity > kMaxLength) {
+      return Just(false);
+    }
     Handle<FixedArrayBase> elements;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         object->GetIsolate(), elements,
@@ -1013,26 +1062,26 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     Subclass::DeleteImpl(obj, entry);
   }
 
-  static void CopyElementsImpl(Isolate* isolate, FixedArrayBase from,
-                               uint32_t from_start, FixedArrayBase to,
+  static void CopyElementsImpl(Isolate* isolate, Tagged<FixedArrayBase> from,
+                               uint32_t from_start, Tagged<FixedArrayBase> to,
                                ElementsKind from_kind, uint32_t to_start,
                                int packed_size, int copy_size) {
     UNREACHABLE();
   }
 
-  void CopyElements(JSObject from_holder, uint32_t from_start,
+  void CopyElements(Tagged<JSObject> from_holder, uint32_t from_start,
                     ElementsKind from_kind, Handle<FixedArrayBase> to,
                     uint32_t to_start, int copy_size) final {
     int packed_size = kPackedSizeNotKnown;
     bool is_packed =
-        IsFastPackedElementsKind(from_kind) && from_holder.IsJSArray();
+        IsFastPackedElementsKind(from_kind) && IsJSArray(from_holder);
     if (is_packed) {
-      packed_size = Smi::ToInt(JSArray::cast(from_holder).length());
+      packed_size = Smi::ToInt(JSArray::cast(from_holder)->length());
       if (copy_size >= 0 && packed_size > copy_size) {
         packed_size = copy_size;
       }
     }
-    FixedArrayBase from = from_holder.elements();
+    Tagged<FixedArrayBase> from = from_holder->elements();
     // NOTE: the Subclass::CopyElementsImpl() methods
     // violate the handlified function signature convention:
     // raw pointer parameters in the function that allocates. This is done
@@ -1042,7 +1091,7 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     // copying from object with fast double elements to object with object
     // elements. In all the other cases there are no allocations performed and
     // handle creation causes noticeable performance degradation of the builtin.
-    Subclass::CopyElementsImpl(from_holder.GetIsolate(), from, from_start, *to,
+    Subclass::CopyElementsImpl(from_holder->GetIsolate(), from, from_start, *to,
                                from_kind, to_start, packed_size, copy_size);
   }
 
@@ -1053,27 +1102,28 @@ class ElementsAccessorBase : public InternalElementsAccessor {
                                0, kPackedSizeNotKnown, size);
   }
 
-  void CopyTypedArrayElementsSlice(JSTypedArray source,
-                                   JSTypedArray destination, size_t start,
-                                   size_t end) override {
+  void CopyTypedArrayElementsSlice(Tagged<JSTypedArray> source,
+                                   Tagged<JSTypedArray> destination,
+                                   size_t start, size_t end) override {
     Subclass::CopyTypedArrayElementsSliceImpl(source, destination, start, end);
   }
 
-  static void CopyTypedArrayElementsSliceImpl(JSTypedArray source,
-                                              JSTypedArray destination,
+  static void CopyTypedArrayElementsSliceImpl(Tagged<JSTypedArray> source,
+                                              Tagged<JSTypedArray> destination,
                                               size_t start, size_t end) {
     UNREACHABLE();
   }
 
-  Object CopyElements(Handle<Object> source, Handle<JSObject> destination,
-                      size_t length, size_t offset) final {
+  Tagged<Object> CopyElements(Handle<Object> source,
+                              Handle<JSObject> destination, size_t length,
+                              size_t offset) final {
     return Subclass::CopyElementsHandleImpl(source, destination, length,
                                             offset);
   }
 
-  static Object CopyElementsHandleImpl(Handle<Object> source,
-                                       Handle<JSObject> destination,
-                                       size_t length, size_t offset) {
+  static Tagged<Object> CopyElementsHandleImpl(Handle<Object> source,
+                                               Handle<JSObject> destination,
+                                               size_t length, size_t offset) {
     UNREACHABLE();
   }
 
@@ -1113,7 +1163,7 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     for (; i < keys->length(); ++i) {
       Handle<Object> key(keys->get(i), isolate);
       uint32_t index;
-      if (!key->ToUint32(&index)) continue;
+      if (!Object::ToUint32(*key, &index)) continue;
 
       DCHECK_EQ(object->GetElementsKind(), original_elements_kind);
       InternalIndex entry = Subclass::GetEntryForIndexImpl(
@@ -1139,7 +1189,7 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     for (; i < keys->length(); i++) {
       Handle<Object> key(keys->get(i), isolate);
       uint32_t index;
-      if (!key->ToUint32(&index)) continue;
+      if (!Object::ToUint32(*key, &index)) continue;
 
       if (filter & ONLY_ENUMERABLE) {
         InternalElementsAccessor* accessor =
@@ -1279,7 +1329,7 @@ class ElementsAccessorBase : public InternalElementsAccessor {
       if (convert == GetKeysConversion::kConvertToString) {
         for (uint32_t i = 0; i < nof_indices; i++) {
           Handle<Object> index_string = isolate->factory()->Uint32ToString(
-              combined_keys->get(i).Number());
+              Object::Number(combined_keys->get(i)));
           combined_keys->set(i, *index_string);
         }
       }
@@ -1310,12 +1360,13 @@ class ElementsAccessorBase : public InternalElementsAccessor {
                                                      convert);
   }
 
-  static uint32_t GetCapacityImpl(JSObject holder,
-                                  FixedArrayBase backing_store) {
-    return backing_store.length();
+  static uint32_t GetCapacityImpl(Tagged<JSObject> holder,
+                                  Tagged<FixedArrayBase> backing_store) {
+    return backing_store->length();
   }
 
-  size_t GetCapacity(JSObject holder, FixedArrayBase backing_store) final {
+  size_t GetCapacity(Tagged<JSObject> holder,
+                     Tagged<FixedArrayBase> backing_store) final {
     return Subclass::GetCapacityImpl(holder, backing_store);
   }
 
@@ -1370,14 +1421,16 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     return Subclass::LastIndexOfValueImpl(receiver, value, start_from);
   }
 
-  static void ReverseImpl(JSObject receiver) { UNREACHABLE(); }
+  static void ReverseImpl(Tagged<JSObject> receiver) { UNREACHABLE(); }
 
-  void Reverse(JSObject receiver) final { Subclass::ReverseImpl(receiver); }
+  void Reverse(Tagged<JSObject> receiver) final {
+    Subclass::ReverseImpl(receiver);
+  }
 
-  static InternalIndex GetEntryForIndexImpl(Isolate* isolate, JSObject holder,
-                                            FixedArrayBase backing_store,
-                                            size_t index,
-                                            PropertyFilter filter) {
+  static InternalIndex GetEntryForIndexImpl(
+      Isolate* isolate, Tagged<JSObject> holder,
+      Tagged<FixedArrayBase> backing_store, size_t index,
+      PropertyFilter filter) {
     DCHECK(IsFastElementsKind(kind()) ||
            IsAnyNonextensibleElementsKind(kind()));
     size_t length = Subclass::GetMaxIndex(holder, backing_store);
@@ -1387,7 +1440,7 @@ class ElementsAccessorBase : public InternalElementsAccessor {
           index <= static_cast<size_t>(std::numeric_limits<int>::max()));
       return index < length &&
                      !BackingStore::cast(backing_store)
-                          .is_the_hole(isolate, static_cast<int>(index))
+                          ->is_the_hole(isolate, static_cast<int>(index))
                  ? InternalIndex(index)
                  : InternalIndex::NotFound();
     } else {
@@ -1395,25 +1448,27 @@ class ElementsAccessorBase : public InternalElementsAccessor {
     }
   }
 
-  InternalIndex GetEntryForIndex(Isolate* isolate, JSObject holder,
-                                 FixedArrayBase backing_store,
+  InternalIndex GetEntryForIndex(Isolate* isolate, Tagged<JSObject> holder,
+                                 Tagged<FixedArrayBase> backing_store,
                                  size_t index) final {
     return Subclass::GetEntryForIndexImpl(isolate, holder, backing_store, index,
                                           ALL_PROPERTIES);
   }
 
-  static PropertyDetails GetDetailsImpl(FixedArrayBase backing_store,
+  static PropertyDetails GetDetailsImpl(Tagged<FixedArrayBase> backing_store,
                                         InternalIndex entry) {
     return PropertyDetails(PropertyKind::kData, NONE,
                            PropertyCellType::kNoCell);
   }
 
-  static PropertyDetails GetDetailsImpl(JSObject holder, InternalIndex entry) {
+  static PropertyDetails GetDetailsImpl(Tagged<JSObject> holder,
+                                        InternalIndex entry) {
     return PropertyDetails(PropertyKind::kData, NONE,
                            PropertyCellType::kNoCell);
   }
 
-  PropertyDetails GetDetails(JSObject holder, InternalIndex entry) final {
+  PropertyDetails GetDetails(Tagged<JSObject> holder,
+                             InternalIndex entry) final {
     return Subclass::GetDetailsImpl(holder, entry);
   }
 
@@ -1434,20 +1489,21 @@ class DictionaryElementsAccessor
     : public ElementsAccessorBase<DictionaryElementsAccessor,
                                   ElementsKindTraits<DICTIONARY_ELEMENTS>> {
  public:
-  static uint32_t GetMaxIndex(JSObject receiver, FixedArrayBase elements) {
+  static uint32_t GetMaxIndex(Tagged<JSObject> receiver,
+                              Tagged<FixedArrayBase> elements) {
     // We cannot properly estimate this for dictionaries.
     UNREACHABLE();
   }
 
-  static uint32_t GetMaxNumberOfEntries(JSObject receiver,
-                                        FixedArrayBase backing_store) {
+  static uint32_t GetMaxNumberOfEntries(Tagged<JSObject> receiver,
+                                        Tagged<FixedArrayBase> backing_store) {
     return NumberOfElementsImpl(receiver, backing_store);
   }
 
-  static uint32_t NumberOfElementsImpl(JSObject receiver,
-                                       FixedArrayBase backing_store) {
+  static uint32_t NumberOfElementsImpl(Tagged<JSObject> receiver,
+                                       Tagged<FixedArrayBase> backing_store) {
     NumberDictionary dict = NumberDictionary::cast(backing_store);
-    return dict.NumberOfElements();
+    return dict->NumberOfElements();
   }
 
   static Maybe<bool> SetLengthImpl(Isolate* isolate, Handle<JSArray> array,
@@ -1456,7 +1512,7 @@ class DictionaryElementsAccessor
     Handle<NumberDictionary> dict =
         Handle<NumberDictionary>::cast(backing_store);
     uint32_t old_length = 0;
-    CHECK(array->length().ToArrayLength(&old_length));
+    CHECK(Object::ToArrayLength(array->length(), &old_length));
     {
       DisallowGarbageCollection no_gc;
       ReadOnlyRoots roots(isolate);
@@ -1465,9 +1521,9 @@ class DictionaryElementsAccessor
           // Find last non-deletable element in range of elements to be
           // deleted and adjust range accordingly.
           for (InternalIndex entry : dict->IterateEntries()) {
-            Object index = dict->KeyAt(isolate, entry);
+            Tagged<Object> index = dict->KeyAt(isolate, entry);
             if (dict->IsKey(roots, index)) {
-              uint32_t number = static_cast<uint32_t>(index.Number());
+              uint32_t number = static_cast<uint32_t>(Object::Number(index));
               if (length <= number && number < old_length) {
                 PropertyDetails details = dict->DetailsAt(entry);
                 if (!details.IsConfigurable()) length = number + 1;
@@ -1483,9 +1539,9 @@ class DictionaryElementsAccessor
           // Remove elements that should be deleted.
           int removed_entries = 0;
           for (InternalIndex entry : dict->IterateEntries()) {
-            Object index = dict->KeyAt(isolate, entry);
+            Tagged<Object> index = dict->KeyAt(isolate, entry);
             if (dict->IsKey(roots, index)) {
-              uint32_t number = static_cast<uint32_t>(index.Number());
+              uint32_t number = static_cast<uint32_t>(Object::Number(index));
               if (length <= number && number < old_length) {
                 dict->ClearEntry(entry);
                 removed_entries++;
@@ -1506,8 +1562,8 @@ class DictionaryElementsAccessor
     return Just(true);
   }
 
-  static void CopyElementsImpl(Isolate* isolate, FixedArrayBase from,
-                               uint32_t from_start, FixedArrayBase to,
+  static void CopyElementsImpl(Isolate* isolate, Tagged<FixedArrayBase> from,
+                               uint32_t from_start, Tagged<FixedArrayBase> to,
                                ElementsKind from_kind, uint32_t to_start,
                                int packed_size, int copy_size) {
     UNREACHABLE();
@@ -1520,39 +1576,70 @@ class DictionaryElementsAccessor
     obj->set_elements(*dict);
   }
 
-  static bool HasAccessorsImpl(JSObject holder, FixedArrayBase backing_store) {
+  static bool HasAccessorsImpl(Tagged<JSObject> holder,
+                               Tagged<FixedArrayBase> backing_store) {
     DisallowGarbageCollection no_gc;
     NumberDictionary dict = NumberDictionary::cast(backing_store);
-    if (!dict.requires_slow_elements()) return false;
+    if (!dict->requires_slow_elements()) return false;
     PtrComprCageBase cage_base = GetPtrComprCageBase(holder);
-    ReadOnlyRoots roots = holder.GetReadOnlyRoots(cage_base);
-    for (InternalIndex i : dict.IterateEntries()) {
-      Object key = dict.KeyAt(cage_base, i);
+    ReadOnlyRoots roots = holder->GetReadOnlyRoots(cage_base);
+    for (InternalIndex i : dict->IterateEntries()) {
+      Tagged<Object> key = dict->KeyAt(cage_base, i);
       if (!dict.IsKey(roots, key)) continue;
-      PropertyDetails details = dict.DetailsAt(i);
+      PropertyDetails details = dict->DetailsAt(i);
       if (details.kind() == PropertyKind::kAccessor) return true;
     }
     return false;
   }
 
-  static Object GetRaw(FixedArrayBase store, InternalIndex entry) {
+  static Tagged<Object> GetRaw(Tagged<FixedArrayBase> store,
+                               InternalIndex entry) {
     NumberDictionary backing_store = NumberDictionary::cast(store);
-    return backing_store.ValueAt(entry);
+    return backing_store->ValueAt(entry);
   }
 
-  static Handle<Object> GetImpl(Isolate* isolate, FixedArrayBase backing_store,
+  static Handle<Object> GetImpl(Isolate* isolate,
+                                Tagged<FixedArrayBase> backing_store,
                                 InternalIndex entry) {
     return handle(GetRaw(backing_store, entry), isolate);
   }
 
+  static Handle<Object> GetAtomicInternalImpl(
+      Isolate* isolate, Tagged<FixedArrayBase> backing_store,
+      InternalIndex entry, SeqCstAccessTag tag) {
+    return handle(NumberDictionary::cast(backing_store)->ValueAt(entry, tag),
+                  isolate);
+  }
+
   static inline void SetImpl(Handle<JSObject> holder, InternalIndex entry,
-                             Object value) {
+                             Tagged<Object> value) {
     SetImpl(holder->elements(), entry, value);
   }
 
-  static inline void SetImpl(FixedArrayBase backing_store, InternalIndex entry,
-                             Object value) {
-    NumberDictionary::cast(backing_store).ValueAtPut(entry, value);
+  static inline void SetImpl(Tagged<FixedArrayBase> backing_store,
+                             InternalIndex entry, Tagged<Object> value) {
+    NumberDictionary::cast(backing_store)->ValueAtPut(entry, value);
+  }
+
+  static void SetAtomicInternalImpl(Tagged<FixedArrayBase> backing_store,
+                                    InternalIndex entry, Tagged<Object> value,
+                                    SeqCstAccessTag tag) {
+    NumberDictionary::cast(backing_store)->ValueAtPut(entry, value, tag);
+  }
+
+  static Handle<Object> SwapAtomicInternalImpl(
+      Isolate* isolate, Tagged<FixedArrayBase> backing_store,
+      InternalIndex entry, Tagged<Object> value, SeqCstAccessTag tag) {
+    return handle(
+        NumberDictionary::cast(backing_store)->ValueAtSwap(entry, value, tag),
+        isolate);
+  }
+
+  static Tagged<Object> CompareAndSwapAtomicInternalImpl(
+      Tagged<FixedArrayBase> backing_store, InternalIndex entry,
+      Tagged<Object> expected, Tagged<Object> value, SeqCstAccessTag tag) {
+    return NumberDictionary::cast(backing_store)
+        ->ValueAtCompareAndSwap(entry, expected, value, tag);
   }
 
   static void ReconfigureImpl(Handle<JSObject> object,
@@ -1561,13 +1648,13 @@ class DictionaryElementsAccessor
                               PropertyAttributes attributes) {
     NumberDictionary dictionary = NumberDictionary::cast(*store);
     if (attributes != NONE) object->RequireSlowElements(dictionary);
-    dictionary.ValueAtPut(entry, *value);
-    PropertyDetails details = dictionary.DetailsAt(entry);
+    dictionary->ValueAtPut(entry, *value);
+    PropertyDetails details = dictionary->DetailsAt(entry);
     details =
         PropertyDetails(PropertyKind::kData, attributes,
                         PropertyCellType::kNoCell, details.dictionary_index());
 
-    dictionary.DetailsAtPut(entry, details);
+    dictionary->DetailsAtPut(entry, details);
   }
 
   static Maybe<bool> AddImpl(Handle<JSObject> object, uint32_t index,
@@ -1590,50 +1677,53 @@ class DictionaryElementsAccessor
     return Just(true);
   }
 
-  static bool HasEntryImpl(Isolate* isolate, FixedArrayBase store,
+  static bool HasEntryImpl(Isolate* isolate, Tagged<FixedArrayBase> store,
                            InternalIndex entry) {
     DisallowGarbageCollection no_gc;
     NumberDictionary dict = NumberDictionary::cast(store);
-    Object index = dict.KeyAt(isolate, entry);
-    return !index.IsTheHole(isolate);
+    Tagged<Object> index = dict->KeyAt(isolate, entry);
+    return !IsTheHole(index, isolate);
   }
 
-  static InternalIndex GetEntryForIndexImpl(Isolate* isolate, JSObject holder,
-                                            FixedArrayBase store, size_t index,
+  static InternalIndex GetEntryForIndexImpl(Isolate* isolate,
+                                            Tagged<JSObject> holder,
+                                            Tagged<FixedArrayBase> store,
+                                            size_t index,
                                             PropertyFilter filter) {
     DisallowGarbageCollection no_gc;
     NumberDictionary dictionary = NumberDictionary::cast(store);
     DCHECK_LE(index, std::numeric_limits<uint32_t>::max());
     InternalIndex entry =
-        dictionary.FindEntry(isolate, static_cast<uint32_t>(index));
+        dictionary->FindEntry(isolate, static_cast<uint32_t>(index));
     if (entry.is_not_found()) return entry;
 
     if (filter != ALL_PROPERTIES) {
-      PropertyDetails details = dictionary.DetailsAt(entry);
+      PropertyDetails details = dictionary->DetailsAt(entry);
       PropertyAttributes attr = details.attributes();
       if ((int{attr} & filter) != 0) return InternalIndex::NotFound();
     }
     return entry;
   }
 
-  static PropertyDetails GetDetailsImpl(JSObject holder, InternalIndex entry) {
-    return GetDetailsImpl(holder.elements(), entry);
+  static PropertyDetails GetDetailsImpl(Tagged<JSObject> holder,
+                                        InternalIndex entry) {
+    return GetDetailsImpl(holder->elements(), entry);
   }
 
-  static PropertyDetails GetDetailsImpl(FixedArrayBase backing_store,
+  static PropertyDetails GetDetailsImpl(Tagged<FixedArrayBase> backing_store,
                                         InternalIndex entry) {
-    return NumberDictionary::cast(backing_store).DetailsAt(entry);
+    return NumberDictionary::cast(backing_store)->DetailsAt(entry);
   }
 
   static uint32_t FilterKey(Handle<NumberDictionary> dictionary,
-                            InternalIndex entry, Object raw_key,
+                            InternalIndex entry, Tagged<Object> raw_key,
                             PropertyFilter filter) {
-    DCHECK(raw_key.IsNumber());
-    DCHECK_LE(raw_key.Number(), kMaxUInt32);
+    DCHECK(IsNumber(raw_key));
+    DCHECK_LE(Object::Number(raw_key), kMaxUInt32);
     PropertyDetails details = dictionary->DetailsAt(entry);
     PropertyAttributes attr = details.attributes();
     if ((int{attr} & filter) != 0) return kMaxUInt32;
-    return static_cast<uint32_t>(raw_key.Number());
+    return static_cast<uint32_t>(Object::Number(raw_key));
   }
 
   static uint32_t GetKeyForEntryImpl(Isolate* isolate,
@@ -1641,7 +1731,7 @@ class DictionaryElementsAccessor
                                      InternalIndex entry,
                                      PropertyFilter filter) {
     DisallowGarbageCollection no_gc;
-    Object raw_key = dictionary->KeyAt(isolate, entry);
+    Tagged<Object> raw_key = dictionary->KeyAt(isolate, entry);
     if (!dictionary->IsKey(ReadOnlyRoots(isolate), raw_key)) return kMaxUInt32;
     return FilterKey(dictionary, entry, raw_key, filter);
   }
@@ -1660,7 +1750,7 @@ class DictionaryElementsAccessor
     ReadOnlyRoots roots(isolate);
     for (InternalIndex i : dictionary->IterateEntries()) {
       AllowGarbageCollection allow_gc;
-      Object raw_key = dictionary->KeyAt(isolate, i);
+      Tagged<Object> raw_key = dictionary->KeyAt(isolate, i);
       if (!dictionary->IsKey(roots, raw_key)) continue;
       uint32_t key = FilterKey(dictionary, i, raw_key, filter);
       if (key == kMaxUInt32) {
@@ -1707,12 +1797,12 @@ class DictionaryElementsAccessor
         NumberDictionary::cast(receiver->elements()), isolate);
     ReadOnlyRoots roots(isolate);
     for (InternalIndex i : dictionary->IterateEntries()) {
-      Object k = dictionary->KeyAt(isolate, i);
+      Tagged<Object> k = dictionary->KeyAt(isolate, i);
       if (!dictionary->IsKey(roots, k)) continue;
-      Object value = dictionary->ValueAt(isolate, i);
-      DCHECK(!value.IsTheHole(isolate));
-      DCHECK(!value.IsAccessorPair());
-      DCHECK(!value.IsAccessorInfo());
+      Tagged<Object> value = dictionary->ValueAt(isolate, i);
+      DCHECK(!IsTheHole(value, isolate));
+      DCHECK(!IsAccessorPair(value));
+      DCHECK(!IsAccessorInfo(value));
       RETURN_FAILURE_IF_NOT_SUCCESSFUL(accumulator->AddKey(value, convert));
     }
     return ExceptionStatus::kSuccess;
@@ -1723,29 +1813,30 @@ class DictionaryElementsAccessor
                                     size_t length, Maybe<bool>* result) {
     DisallowGarbageCollection no_gc;
     NumberDictionary dictionary = NumberDictionary::cast(receiver->elements());
-    Object the_hole = ReadOnlyRoots(isolate).the_hole_value();
-    Object undefined = ReadOnlyRoots(isolate).undefined_value();
+    Tagged<Object> the_hole = ReadOnlyRoots(isolate).the_hole_value();
+    Tagged<Object> undefined = ReadOnlyRoots(isolate).undefined_value();
 
     // Scan for accessor properties. If accessors are present, then elements
     // must be accessed in order via the slow path.
     bool found = false;
-    for (InternalIndex i : dictionary.IterateEntries()) {
-      Object k = dictionary.KeyAt(isolate, i);
+    for (InternalIndex i : dictionary->IterateEntries()) {
+      Tagged<Object> k = dictionary->KeyAt(isolate, i);
       if (k == the_hole) continue;
       if (k == undefined) continue;
 
       uint32_t index;
-      if (!k.ToArrayIndex(&index) || index < start_from || index >= length) {
+      if (!Object::ToArrayIndex(k, &index) || index < start_from ||
+          index >= length) {
         continue;
       }
 
-      if (dictionary.DetailsAt(i).kind() == PropertyKind::kAccessor) {
+      if (dictionary->DetailsAt(i).kind() == PropertyKind::kAccessor) {
         // Restart from beginning in slow path, otherwise we may observably
         // access getters out of order
         return false;
       } else if (!found) {
-        Object element_k = dictionary.ValueAt(isolate, i);
-        if (value->SameValueZero(element_k)) found = true;
+        Tagged<Object> element_k = dictionary->ValueAt(isolate, i);
+        if (Object::SameValueZero(*value, element_k)) found = true;
       }
     }
 
@@ -1758,7 +1849,7 @@ class DictionaryElementsAccessor
                                        Handle<Object> value, size_t start_from,
                                        size_t length) {
     DCHECK(JSObject::PrototypeHasNoElements(isolate, *receiver));
-    bool search_for_hole = value->IsUndefined(isolate);
+    bool search_for_hole = IsUndefined(*value, isolate);
 
     if (!search_for_hole) {
       Maybe<bool> result = Nothing<bool>();
@@ -1785,8 +1876,8 @@ class DictionaryElementsAccessor
       PropertyDetails details = GetDetailsImpl(*dictionary, entry);
       switch (details.kind()) {
         case PropertyKind::kData: {
-          Object element_k = dictionary->ValueAt(entry);
-          if (value->SameValueZero(element_k)) return Just(true);
+          Tagged<Object> element_k = dictionary->ValueAt(entry);
+          if (Object::SameValueZero(*value, element_k)) return Just(true);
           break;
         }
         case PropertyKind::kAccessor: {
@@ -1800,7 +1891,7 @@ class DictionaryElementsAccessor
                                            Object::GetPropertyWithAccessor(&it),
                                            Nothing<bool>());
 
-          if (value->SameValueZero(*element_k)) return Just(true);
+          if (Object::SameValueZero(*value, *element_k)) return Just(true);
 
           // Bailout to slow path if elements on prototype changed
           if (!JSObject::PrototypeHasNoElements(isolate, *receiver)) {
@@ -1815,7 +1906,7 @@ class DictionaryElementsAccessor
 
           // If switched to initial elements, return true if searching for
           // undefined, and false otherwise.
-          if (receiver->map().GetInitialElements() == receiver->elements()) {
+          if (receiver->map()->GetInitialElements() == receiver->elements()) {
             return Just(search_for_hole);
           }
 
@@ -1857,8 +1948,8 @@ class DictionaryElementsAccessor
           GetDetailsImpl(*dictionary, InternalIndex(entry));
       switch (details.kind()) {
         case PropertyKind::kData: {
-          Object element_k = dictionary->ValueAt(entry);
-          if (value->StrictEquals(element_k)) {
+          Tagged<Object> element_k = dictionary->ValueAt(entry);
+          if (Object::StrictEquals(*value, element_k)) {
             return Just<int64_t>(k);
           }
           break;
@@ -1874,7 +1965,7 @@ class DictionaryElementsAccessor
                                            Object::GetPropertyWithAccessor(&it),
                                            Nothing<int64_t>());
 
-          if (value->StrictEquals(*element_k)) return Just<int64_t>(k);
+          if (Object::StrictEquals(*value, *element_k)) return Just<int64_t>(k);
 
           // Bailout to slow path if elements on prototype changed.
           if (!JSObject::PrototypeHasNoElements(isolate, *receiver)) {
@@ -1900,30 +1991,30 @@ class DictionaryElementsAccessor
     return Just<int64_t>(-1);
   }
 
-  static void ValidateContents(JSObject holder, size_t length) {
+  static void ValidateContents(Tagged<JSObject> holder, size_t length) {
     DisallowGarbageCollection no_gc;
 #if DEBUG
-    DCHECK_EQ(holder.map().elements_kind(), DICTIONARY_ELEMENTS);
+    DCHECK_EQ(holder->map()->elements_kind(), DICTIONARY_ELEMENTS);
     if (!v8_flags.enable_slow_asserts) return;
-    ReadOnlyRoots roots = holder.GetReadOnlyRoots();
-    NumberDictionary dictionary = NumberDictionary::cast(holder.elements());
+    ReadOnlyRoots roots = holder->GetReadOnlyRoots();
+    NumberDictionary dictionary = NumberDictionary::cast(holder->elements());
     // Validate the requires_slow_elements and max_number_key values.
     bool requires_slow_elements = false;
     int max_key = 0;
-    for (InternalIndex i : dictionary.IterateEntries()) {
-      Object k;
-      if (!dictionary.ToKey(roots, i, &k)) continue;
-      DCHECK_LE(0.0, k.Number());
-      if (k.Number() > NumberDictionary::kRequiresSlowElementsLimit) {
+    for (InternalIndex i : dictionary->IterateEntries()) {
+      Tagged<Object> k;
+      if (!dictionary->ToKey(roots, i, &k)) continue;
+      DCHECK_LE(0.0, Object::Number(k));
+      if (Object::Number(k) > NumberDictionary::kRequiresSlowElementsLimit) {
         requires_slow_elements = true;
       } else {
         max_key = std::max(max_key, Smi::ToInt(k));
       }
     }
     if (requires_slow_elements) {
-      DCHECK(dictionary.requires_slow_elements());
-    } else if (!dictionary.requires_slow_elements()) {
-      DCHECK_LE(max_key, dictionary.max_number_key());
+      DCHECK(dictionary->requires_slow_elements());
+    } else if (!dictionary->requires_slow_elements()) {
+      DCHECK_LE(max_key, dictionary->max_number_key());
     }
 #endif
   }
@@ -1956,7 +2047,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
     int max_number_key = -1;
     for (int i = 0; j < capacity; i++) {
       if (IsHoleyElementsKindForRead(kind)) {
-        if (BackingStore::cast(*store).is_the_hole(isolate, i)) continue;
+        if (BackingStore::cast(*store)->is_the_hole(isolate, i)) continue;
       }
       max_number_key = i;
       Handle<Object> value =
@@ -1985,7 +2076,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
       // Dynamically ask for the elements kind here since we manually redirect
       // the operations for argument backing stores.
       if (obj->GetElementsKind() == FAST_SLOPPY_ARGUMENTS_ELEMENTS) {
-        SloppyArgumentsElements::cast(obj->elements()).set_arguments(empty);
+        SloppyArgumentsElements::cast(obj->elements())->set_arguments(empty);
       } else {
         obj->set_elements(empty);
       }
@@ -2001,7 +2092,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
            obj->HasNonextensibleElements() || obj->HasFastArgumentsElements() ||
            obj->HasFastStringWrapperElements());
     Handle<BackingStore> backing_store = Handle<BackingStore>::cast(store);
-    if (!obj->IsJSArray() &&
+    if (!IsJSArray(*obj) &&
         entry == static_cast<uint32_t>(store->length()) - 1) {
       DeleteAtEnd(obj, backing_store, entry);
       return;
@@ -2016,8 +2107,8 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
     const int kMinLengthForSparsenessCheck = 64;
     if (backing_store->length() < kMinLengthForSparsenessCheck) return;
     uint32_t length = 0;
-    if (obj->IsJSArray()) {
-      JSArray::cast(*obj).length().ToArrayLength(&length);
+    if (IsJSArray(*obj)) {
+      Object::ToArrayLength(JSArray::cast(*obj)->length(), &length);
     } else {
       length = static_cast<uint32_t>(store->length());
     }
@@ -2039,7 +2130,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
     // Reset the counter whenever the full check is performed.
     isolate->set_elements_deletion_counter(0);
 
-    if (!obj->IsJSArray()) {
+    if (!IsJSArray(*obj)) {
       uint32_t i;
       for (i = entry + 1; i < length; i++) {
         if (!backing_store->is_the_hole(isolate, i)) break;
@@ -2116,20 +2207,21 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
                  handle(obj->elements(), obj->GetIsolate()));
   }
 
-  static bool HasEntryImpl(Isolate* isolate, FixedArrayBase backing_store,
+  static bool HasEntryImpl(Isolate* isolate,
+                           Tagged<FixedArrayBase> backing_store,
                            InternalIndex entry) {
     return !BackingStore::cast(backing_store)
-                .is_the_hole(isolate, entry.as_int());
+                ->is_the_hole(isolate, entry.as_int());
   }
 
-  static uint32_t NumberOfElementsImpl(JSObject receiver,
-                                       FixedArrayBase backing_store) {
+  static uint32_t NumberOfElementsImpl(Tagged<JSObject> receiver,
+                                       Tagged<FixedArrayBase> backing_store) {
     size_t max_index = Subclass::GetMaxIndex(receiver, backing_store);
     DCHECK_LE(max_index, std::numeric_limits<uint32_t>::max());
     if (IsFastPackedElementsKind(Subclass::kind())) {
       return static_cast<uint32_t>(max_index);
     }
-    Isolate* isolate = receiver.GetIsolate();
+    Isolate* isolate = receiver->GetIsolate();
     uint32_t count = 0;
     for (size_t i = 0; i < max_index; i++) {
       if (Subclass::HasEntryImpl(isolate, backing_store, InternalIndex(i))) {
@@ -2155,12 +2247,12 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
     return ExceptionStatus::kSuccess;
   }
 
-  static void ValidateContents(JSObject holder, size_t length) {
+  static void ValidateContents(Tagged<JSObject> holder, size_t length) {
 #if DEBUG
-    Isolate* isolate = holder.GetIsolate();
+    Isolate* isolate = holder->GetIsolate();
     Heap* heap = isolate->heap();
-    FixedArrayBase elements = holder.elements();
-    Map map = elements.map();
+    Tagged<FixedArrayBase> elements = holder->elements();
+    Map map = elements->map();
     if (IsSmiOrObjectElementsKind(KindTraits::Kind)) {
       DCHECK_NE(map, ReadOnlyRoots(heap).fixed_double_array_map());
     } else if (IsDoubleElementsKind(KindTraits::Kind)) {
@@ -2172,20 +2264,20 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
     if (length == 0u) return;  // nothing to do!
 #if ENABLE_SLOW_DCHECKS
     DisallowGarbageCollection no_gc;
-    BackingStore backing_store = BackingStore::cast(elements);
+    Tagged<BackingStore> backing_store = BackingStore::cast(elements);
     DCHECK(length <= std::numeric_limits<int>::max());
     int length_int = static_cast<int>(length);
     if (IsSmiElementsKind(KindTraits::Kind)) {
       HandleScope scope(isolate);
       for (int i = 0; i < length_int; i++) {
-        DCHECK(BackingStore::get(backing_store, i, isolate)->IsSmi() ||
+        DCHECK(IsSmi(*BackingStore::get(backing_store, i, isolate)) ||
                (IsHoleyElementsKind(KindTraits::Kind) &&
-                backing_store.is_the_hole(isolate, i)));
+                backing_store->is_the_hole(isolate, i)));
       }
     } else if (KindTraits::Kind == PACKED_ELEMENTS ||
                KindTraits::Kind == PACKED_DOUBLE_ELEMENTS) {
       for (int i = 0; i < length_int; i++) {
-        DCHECK(!backing_store.is_the_hole(isolate, i));
+        DCHECK(!backing_store->is_the_hole(isolate, i));
       }
     } else {
       DCHECK(IsHoleyElementsKind(KindTraits::Kind));
@@ -2224,7 +2316,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
                            int src_index, int len, int hole_start,
                            int hole_end) {
     DisallowGarbageCollection no_gc;
-    BackingStore dst_elms = BackingStore::cast(*backing_store);
+    Tagged<BackingStore> dst_elms = BackingStore::cast(*backing_store);
     if (len > JSArray::kMaxCopyElements && dst_index == 0 &&
         isolate->heap()->CanMoveObjectStart(dst_elms)) {
       dst_elms = BackingStore::cast(
@@ -2239,10 +2331,10 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
     } else if (len != 0) {
       WriteBarrierMode mode =
           GetWriteBarrierMode(dst_elms, KindTraits::Kind, no_gc);
-      dst_elms.MoveElements(isolate, dst_index, src_index, len, mode);
+      dst_elms->MoveElements(isolate, dst_index, src_index, len, mode);
     }
     if (hole_start != hole_end) {
-      dst_elms.FillWithHoles(hole_start, hole_end);
+      dst_elms->FillWithHoles(hole_start, hole_end);
     }
   }
 
@@ -2279,15 +2371,15 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
                                        size_t start_from, size_t length) {
     DCHECK(JSObject::PrototypeHasNoElements(isolate, *receiver));
     DisallowGarbageCollection no_gc;
-    FixedArrayBase elements_base = receiver->elements();
-    Object the_hole = ReadOnlyRoots(isolate).the_hole_value();
-    Object undefined = ReadOnlyRoots(isolate).undefined_value();
-    Object value = *search_value;
+    Tagged<FixedArrayBase> elements_base = receiver->elements();
+    Tagged<Object> the_hole = ReadOnlyRoots(isolate).the_hole_value();
+    Tagged<Object> undefined = ReadOnlyRoots(isolate).undefined_value();
+    Tagged<Object> value = *search_value;
 
     if (start_from >= length) return Just(false);
 
     // Elements beyond the capacity of the backing store treated as undefined.
-    size_t elements_length = static_cast<size_t>(elements_base.length());
+    size_t elements_length = static_cast<size_t>(elements_base->length());
     if (value == undefined && elements_length < length) return Just(true);
     if (elements_length == 0) {
       DCHECK_NE(value, undefined);
@@ -2297,7 +2389,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
     length = std::min(elements_length, length);
     DCHECK_LE(length, std::numeric_limits<int>::max());
 
-    if (!value.IsNumber()) {
+    if (!IsNumber(value)) {
       if (value == undefined) {
         // Search for `undefined` or The Hole. Even in the case of
         // PACKED_DOUBLE_ELEMENTS or PACKED_SMI_ELEMENTS, we might encounter The
@@ -2308,7 +2400,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
           FixedArray elements = FixedArray::cast(receiver->elements());
 
           for (size_t k = start_from; k < length; ++k) {
-            Object element_k = elements.get(static_cast<int>(k));
+            Tagged<Object> element_k = elements->get(static_cast<int>(k));
 
             if (element_k == the_hole || element_k == undefined) {
               return Just(true);
@@ -2323,7 +2415,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
               FixedDoubleArray::cast(receiver->elements());
 
           for (size_t k = start_from; k < length; ++k) {
-            if (elements.is_the_hole(static_cast<int>(k))) return Just(true);
+            if (elements->is_the_hole(static_cast<int>(k))) return Just(true);
           }
           return Just(false);
         }
@@ -2342,15 +2434,15 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
         FixedArray elements = FixedArray::cast(receiver->elements());
 
         for (size_t k = start_from; k < length; ++k) {
-          Object element_k = elements.get(static_cast<int>(k));
+          Tagged<Object> element_k = elements->get(static_cast<int>(k));
           if (element_k == the_hole) continue;
-          if (value.SameValueZero(element_k)) return Just(true);
+          if (Object::SameValueZero(value, element_k)) return Just(true);
         }
         return Just(false);
       }
     } else {
-      if (!value.IsNaN()) {
-        double search_number = value.Number();
+      if (!IsNaN(value)) {
+        double search_number = Object::Number(value);
         if (IsDoubleElementsKind(Subclass::kind())) {
           // Search for non-NaN Number in PACKED_DOUBLE_ELEMENTS or
           // HOLEY_DOUBLE_ELEMENTS --- Skip TheHole, and trust UCOMISD or
@@ -2359,8 +2451,8 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
               FixedDoubleArray::cast(receiver->elements());
 
           for (size_t k = start_from; k < length; ++k) {
-            if (elements.is_the_hole(static_cast<int>(k))) continue;
-            if (elements.get_scalar(static_cast<int>(k)) == search_number) {
+            if (elements->is_the_hole(static_cast<int>(k))) continue;
+            if (elements->get_scalar(static_cast<int>(k)) == search_number) {
               return Just(true);
             }
           }
@@ -2372,8 +2464,9 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
           FixedArray elements = FixedArray::cast(receiver->elements());
 
           for (size_t k = start_from; k < length; ++k) {
-            Object element_k = elements.get(static_cast<int>(k));
-            if (element_k.IsNumber() && element_k.Number() == search_number) {
+            Tagged<Object> element_k = elements->get(static_cast<int>(k));
+            if (IsNumber(element_k) &&
+                Object::Number(element_k) == search_number) {
               return Just(true);
             }
           }
@@ -2392,8 +2485,8 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
               FixedDoubleArray::cast(receiver->elements());
 
           for (size_t k = start_from; k < length; ++k) {
-            if (elements.is_the_hole(static_cast<int>(k))) continue;
-            if (std::isnan(elements.get_scalar(static_cast<int>(k)))) {
+            if (elements->is_the_hole(static_cast<int>(k))) continue;
+            if (std::isnan(elements->get_scalar(static_cast<int>(k)))) {
               return Just(true);
             }
           }
@@ -2406,7 +2499,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
           FixedArray elements = FixedArray::cast(receiver->elements());
 
           for (size_t k = start_from; k < length; ++k) {
-            if (elements.get(static_cast<int>(k)).IsNaN()) return Just(true);
+            if (IsNaN(elements->get(static_cast<int>(k)))) return Just(true);
           }
           return Just(false);
         }
@@ -2424,7 +2517,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
       if (!Subclass::HasEntryImpl(isolate, *elements, entry)) continue;
       Handle<Object> value;
       value = Subclass::GetImpl(isolate, *elements, entry);
-      if (value->IsName()) {
+      if (IsName(*value)) {
         value = isolate->factory()->InternalizeName(Handle<Name>::cast(value));
       }
       result->set(i, *value);
@@ -2454,7 +2547,7 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
     MAYBE_RETURN_NULL(
         Subclass::SetLengthImpl(isolate, receiver, new_length, backing_store));
 
-    if (IsHoleyElementsKind(kind) && result->IsTheHole(isolate)) {
+    if (IsHoleyElementsKind(kind) && IsTheHole(*result, isolate)) {
       return isolate->factory()->undefined_value();
     }
     return MaybeHandle<Object>(result);
@@ -2506,11 +2599,11 @@ class FastElementsAccessor : public ElementsAccessorBase<Subclass, KindTraits> {
                             uint32_t dst_index) {
     // Add the provided values.
     DisallowGarbageCollection no_gc;
-    FixedArrayBase raw_backing_store = *dst_store;
-    WriteBarrierMode mode = raw_backing_store.GetWriteBarrierMode(no_gc);
+    Tagged<FixedArrayBase> raw_backing_store = *dst_store;
+    WriteBarrierMode mode = raw_backing_store->GetWriteBarrierMode(no_gc);
     for (uint32_t i = 0; i < copy_size; i++) {
-      Object argument = (*args)[src_index + i];
-      DCHECK(!argument.IsTheHole());
+      Tagged<Object> argument = (*args)[src_index + i];
+      DCHECK(!IsTheHole(argument));
       Subclass::SetImpl(raw_backing_store, InternalIndex(dst_index + i),
                         argument, mode);
     }
@@ -2522,22 +2615,23 @@ class FastSmiOrObjectElementsAccessor
     : public FastElementsAccessor<Subclass, KindTraits> {
  public:
   static inline void SetImpl(Handle<JSObject> holder, InternalIndex entry,
-                             Object value) {
+                             Tagged<Object> value) {
     SetImpl(holder->elements(), entry, value);
   }
 
-  static inline void SetImpl(FixedArrayBase backing_store, InternalIndex entry,
-                             Object value) {
-    FixedArray::cast(backing_store).set(entry.as_int(), value);
+  static inline void SetImpl(Tagged<FixedArrayBase> backing_store,
+                             InternalIndex entry, Tagged<Object> value) {
+    FixedArray::cast(backing_store)->set(entry.as_int(), value);
   }
 
-  static inline void SetImpl(FixedArrayBase backing_store, InternalIndex entry,
-                             Object value, WriteBarrierMode mode) {
-    FixedArray::cast(backing_store).set(entry.as_int(), value, mode);
+  static inline void SetImpl(Tagged<FixedArrayBase> backing_store,
+                             InternalIndex entry, Tagged<Object> value,
+                             WriteBarrierMode mode) {
+    FixedArray::cast(backing_store)->set(entry.as_int(), value, mode);
   }
 
-  static Object GetRaw(FixedArray backing_store, InternalIndex entry) {
-    return backing_store.get(entry.as_int());
+  static Tagged<Object> GetRaw(FixedArray backing_store, InternalIndex entry) {
+    return backing_store->get(entry.as_int());
   }
 
   // NOTE: this method violates the handlified function signature convention:
@@ -2545,8 +2639,8 @@ class FastSmiOrObjectElementsAccessor
   // See ElementsAccessor::CopyElements() for details.
   // This method could actually allocate if copying from double elements to
   // object elements.
-  static void CopyElementsImpl(Isolate* isolate, FixedArrayBase from,
-                               uint32_t from_start, FixedArrayBase to,
+  static void CopyElementsImpl(Isolate* isolate, Tagged<FixedArrayBase> from,
+                               uint32_t from_start, Tagged<FixedArrayBase> to,
                                ElementsKind from_kind, uint32_t to_start,
                                int packed_size, int copy_size) {
     DisallowGarbageCollection no_gc;
@@ -2616,11 +2710,11 @@ class FastSmiOrObjectElementsAccessor
       // No allocations here, so we can avoid handlification overhead.
       DisallowGarbageCollection no_gc;
       FixedArray elements = FixedArray::cast(object->elements());
-      uint32_t length = elements.length();
+      uint32_t length = elements->length();
       for (uint32_t index = 0; index < length; ++index) {
         InternalIndex entry(index);
         if (!Subclass::HasEntryImpl(isolate, elements, entry)) continue;
-        Object value = GetRaw(elements, entry);
+        Tagged<Object> value = GetRaw(elements, entry);
         values_or_entries->set(count++, value);
       }
     }
@@ -2634,20 +2728,20 @@ class FastSmiOrObjectElementsAccessor
                                          size_t start_from, size_t length) {
     DCHECK(JSObject::PrototypeHasNoElements(isolate, *receiver));
     DisallowGarbageCollection no_gc;
-    FixedArrayBase elements_base = receiver->elements();
-    Object value = *search_value;
+    Tagged<FixedArrayBase> elements_base = receiver->elements();
+    Tagged<Object> value = *search_value;
 
     if (start_from >= length) return Just<int64_t>(-1);
 
-    length = std::min(static_cast<size_t>(elements_base.length()), length);
+    length = std::min(static_cast<size_t>(elements_base->length()), length);
 
     // Only FAST_{,HOLEY_}ELEMENTS can store non-numbers.
-    if (!value.IsNumber() && !IsObjectElementsKind(Subclass::kind()) &&
+    if (!IsNumber(value) && !IsObjectElementsKind(Subclass::kind()) &&
         !IsAnyNonextensibleElementsKind(Subclass::kind())) {
       return Just<int64_t>(-1);
     }
     // NaN can never be found by strict equality.
-    if (value.IsNaN()) return Just<int64_t>(-1);
+    if (IsNaN(value)) return Just<int64_t>(-1);
 
     // k can be greater than receiver->length() below, but it is bounded by
     // elements_base->length() so we never read out of bounds. This means that
@@ -2657,7 +2751,8 @@ class FastSmiOrObjectElementsAccessor
     static_assert(FixedArray::kMaxLength <=
                   std::numeric_limits<uint32_t>::max());
     for (size_t k = start_from; k < length; ++k) {
-      if (value.StrictEquals(elements.get(static_cast<uint32_t>(k)))) {
+      if (Object::StrictEquals(value,
+                               elements->get(static_cast<uint32_t>(k)))) {
         return Just<int64_t>(k);
       }
     }
@@ -2705,7 +2800,7 @@ class FastNonextensibleObjectElementsAccessor
                                    uint32_t length,
                                    Handle<FixedArrayBase> backing_store) {
     uint32_t old_length = 0;
-    CHECK(array->length().ToArrayIndex(&old_length));
+    CHECK(Object::ToArrayIndex(array->length(), &old_length));
     if (length == old_length) {
       // Do nothing.
       return Just(true);
@@ -2803,7 +2898,7 @@ class FastSealedObjectElementsAccessor
                                    uint32_t length,
                                    Handle<FixedArrayBase> backing_store) {
     uint32_t old_length = 0;
-    CHECK(array->length().ToArrayIndex(&old_length));
+    CHECK(Object::ToArrayIndex(array->length(), &old_length));
     if (length == old_length) {
       // Do nothing.
       return Just(true);
@@ -2853,30 +2948,33 @@ class SharedArrayElementsAccessor
           SharedArrayElementsAccessor,
           ElementsKindTraits<SHARED_ARRAY_ELEMENTS>> {
  public:
-  static Handle<Object> GetAtomicInternalImpl(Isolate* isolate,
-                                              Handle<JSObject> holder,
-                                              InternalIndex entry,
-                                              SeqCstAccessTag tag) {
-    return handle(
-        BackingStore::cast(holder->elements()).get(entry.as_int(), tag),
-        isolate);
+  static Handle<Object> GetAtomicInternalImpl(
+      Isolate* isolate, Tagged<FixedArrayBase> backing_store,
+      InternalIndex entry, SeqCstAccessTag tag) {
+    return handle(BackingStore::cast(backing_store)->get(entry.as_int(), tag),
+                  isolate);
   }
 
-  static void SetAtomicInternalImpl(Handle<JSObject> holder,
-                                    InternalIndex entry, Object value,
+  static void SetAtomicInternalImpl(Tagged<FixedArrayBase> backing_store,
+                                    InternalIndex entry, Tagged<Object> value,
                                     SeqCstAccessTag tag) {
-    BackingStore::cast(holder->elements()).set(entry.as_int(), value, tag);
+    BackingStore::cast(backing_store)->set(entry.as_int(), value, tag);
   }
 
-  static Handle<Object> SwapAtomicInternalImpl(Isolate* isolate,
-                                               Handle<JSObject> holder,
-                                               InternalIndex entry,
-                                               Object value,
-                                               SeqCstAccessTag tag) {
+  static Handle<Object> SwapAtomicInternalImpl(
+      Isolate* isolate, Tagged<FixedArrayBase> backing_store,
+      InternalIndex entry, Tagged<Object> value, SeqCstAccessTag tag) {
     return handle(
-        BackingStore::cast(holder->elements()).swap(entry.as_int(), value, tag),
+        BackingStore::cast(backing_store)->swap(entry.as_int(), value, tag),
         isolate);
   }
+
+  static Tagged<Object> CompareAndSwapAtomicInternalImpl(
+      Tagged<FixedArrayBase> backing_store, InternalIndex entry,
+      Tagged<Object> expected, Tagged<Object> value, SeqCstAccessTag tag) {
+    return BackingStore::cast(backing_store)
+        ->compare_and_swap(entry.as_int(), expected, value, tag);
+  }
 };
 
 class FastHoleySealedObjectElementsAccessor
@@ -2891,17 +2989,18 @@ class FastFrozenObjectElementsAccessor
   using BackingStore = typename KindTraits::BackingStore;
 
   static inline void SetImpl(Handle<JSObject> holder, InternalIndex entry,
-                             Object value) {
+                             Tagged<Object> value) {
     UNREACHABLE();
   }
 
-  static inline void SetImpl(FixedArrayBase backing_store, InternalIndex entry,
-                             Object value) {
+  static inline void SetImpl(Tagged<FixedArrayBase> backing_store,
+                             InternalIndex entry, Tagged<Object> value) {
     UNREACHABLE();
   }
 
-  static inline void SetImpl(FixedArrayBase backing_store, InternalIndex entry,
-                             Object value, WriteBarrierMode mode) {
+  static inline void SetImpl(Tagged<FixedArrayBase> backing_store,
+                             InternalIndex entry, Tagged<Object> value,
+                             WriteBarrierMode mode) {
     UNREACHABLE();
   }
 
@@ -2973,29 +3072,33 @@ template <typename Subclass, typename KindTraits>
 class FastDoubleElementsAccessor
     : public FastElementsAccessor<Subclass, KindTraits> {
  public:
-  static Handle<Object> GetImpl(Isolate* isolate, FixedArrayBase backing_store,
+  static Handle<Object> GetImpl(Isolate* isolate,
+                                Tagged<FixedArrayBase> backing_store,
                                 InternalIndex entry) {
     return FixedDoubleArray::get(FixedDoubleArray::cast(backing_store),
                                  entry.as_int(), isolate);
   }
 
   static inline void SetImpl(Handle<JSObject> holder, InternalIndex entry,
-                             Object value) {
+                             Tagged<Object> value) {
     SetImpl(holder->elements(), entry, value);
   }
 
-  static inline void SetImpl(FixedArrayBase backing_store, InternalIndex entry,
-                             Object value) {
-    FixedDoubleArray::cast(backing_store).set(entry.as_int(), value.Number());
+  static inline void SetImpl(Tagged<FixedArrayBase> backing_store,
+                             InternalIndex entry, Tagged<Object> value) {
+    FixedDoubleArray::cast(backing_store)
+        ->set(entry.as_int(), Object::Number(value));
   }
 
-  static inline void SetImpl(FixedArrayBase backing_store, InternalIndex entry,
-                             Object value, WriteBarrierMode mode) {
-    FixedDoubleArray::cast(backing_store).set(entry.as_int(), value.Number());
+  static inline void SetImpl(Tagged<FixedArrayBase> backing_store,
+                             InternalIndex entry, Tagged<Object> value,
+                             WriteBarrierMode mode) {
+    FixedDoubleArray::cast(backing_store)
+        ->set(entry.as_int(), Object::Number(value));
   }
 
-  static void CopyElementsImpl(Isolate* isolate, FixedArrayBase from,
-                               uint32_t from_start, FixedArrayBase to,
+  static void CopyElementsImpl(Isolate* isolate, Tagged<FixedArrayBase> from,
+                               uint32_t from_start, Tagged<FixedArrayBase> to,
                                ElementsKind from_kind, uint32_t to_start,
                                int packed_size, int copy_size) {
     DisallowGarbageCollection no_gc;
@@ -3069,30 +3172,30 @@ class FastDoubleElementsAccessor
                                          size_t start_from, size_t length) {
     DCHECK(JSObject::PrototypeHasNoElements(isolate, *receiver));
     DisallowGarbageCollection no_gc;
-    FixedArrayBase elements_base = receiver->elements();
-    Object value = *search_value;
+    Tagged<FixedArrayBase> elements_base = receiver->elements();
+    Tagged<Object> value = *search_value;
 
-    length = std::min(static_cast<size_t>(elements_base.length()), length);
+    length = std::min(static_cast<size_t>(elements_base->length()), length);
 
     if (start_from >= length) return Just<int64_t>(-1);
 
-    if (!value.IsNumber()) {
+    if (!IsNumber(value)) {
       return Just<int64_t>(-1);
     }
-    if (value.IsNaN()) {
+    if (IsNaN(value)) {
       return Just<int64_t>(-1);
     }
-    double numeric_search_value = value.Number();
+    double numeric_search_value = Object::Number(value);
     FixedDoubleArray elements = FixedDoubleArray::cast(receiver->elements());
 
     static_assert(FixedDoubleArray::kMaxLength <=
                   std::numeric_limits<int>::max());
     for (size_t k = start_from; k < length; ++k) {
       int k_int = static_cast<int>(k);
-      if (elements.is_the_hole(k_int)) {
+      if (elements->is_the_hole(k_int)) {
         continue;
       }
-      if (elements.get_scalar(k_int) == numeric_search_value) {
+      if (elements->get_scalar(k_int) == numeric_search_value) {
         return Just<int64_t>(k);
       }
     }
@@ -3135,16 +3238,17 @@ class TypedElementsAccessor
   static ElementType FromScalar(uint64_t value) { UNREACHABLE(); }
 
   // Conversions from objects / handles.
-  static ElementType FromObject(Object value, bool* lossless = nullptr) {
-    if (value.IsSmi()) {
+  static ElementType FromObject(Tagged<Object> value,
+                                bool* lossless = nullptr) {
+    if (IsSmi(value)) {
       return FromScalar(Smi::ToInt(value));
-    } else if (value.IsHeapNumber()) {
-      return FromScalar(HeapNumber::cast(value).value());
+    } else if (IsHeapNumber(value)) {
+      return FromScalar(HeapNumber::cast(value)->value());
     } else {
       // Clamp undefined here as well. All other types have been
       // converted to a number type further up in the call chain.
-      DCHECK(value.IsUndefined());
-      return FromScalar(Oddball::cast(value).to_number_raw());
+      DCHECK(IsUndefined(value));
+      return FromScalar(Oddball::cast(value)->to_number_raw());
     }
   }
   static ElementType FromHandle(Handle<Object> value,
@@ -3156,12 +3260,12 @@ class TypedElementsAccessor
   static Handle<Object> ToHandle(Isolate* isolate, ElementType value);
 
   static void SetImpl(Handle<JSObject> holder, InternalIndex entry,
-                      Object value) {
+                      Tagged<Object> value) {
     Handle<JSTypedArray> typed_array = Handle<JSTypedArray>::cast(holder);
     DCHECK_LE(entry.raw_value(), typed_array->GetLength());
     auto* entry_ptr =
         static_cast<ElementType*>(typed_array->DataPtr()) + entry.raw_value();
-    auto is_shared = typed_array->buffer().is_shared() ? kShared : kUnshared;
+    auto is_shared = typed_array->buffer()->is_shared() ? kShared : kUnshared;
     SetImpl(entry_ptr, FromObject(value), is_shared);
   }
 
@@ -3220,12 +3324,13 @@ class TypedElementsAccessor
     DCHECK(!typed_array->IsDetachedOrOutOfBounds());
     auto* element_ptr =
         static_cast<ElementType*>(typed_array->DataPtr()) + entry.raw_value();
-    auto is_shared = typed_array->buffer().is_shared() ? kShared : kUnshared;
+    auto is_shared = typed_array->buffer()->is_shared() ? kShared : kUnshared;
     ElementType elem = GetImpl(element_ptr, is_shared);
     return ToHandle(isolate, elem);
   }
 
-  static Handle<Object> GetImpl(Isolate* isolate, FixedArrayBase backing_store,
+  static Handle<Object> GetImpl(Isolate* isolate,
+                                Tagged<FixedArrayBase> backing_store,
                                 InternalIndex entry) {
     UNREACHABLE();
   }
@@ -3280,24 +3385,26 @@ class TypedElementsAccessor
     return result;
   }
 
-  static PropertyDetails GetDetailsImpl(JSObject holder, InternalIndex entry) {
+  static PropertyDetails GetDetailsImpl(Tagged<JSObject> holder,
+                                        InternalIndex entry) {
     return PropertyDetails(PropertyKind::kData, NONE,
                            PropertyCellType::kNoCell);
   }
 
-  static PropertyDetails GetDetailsImpl(FixedArrayBase backing_store,
+  static PropertyDetails GetDetailsImpl(Tagged<FixedArrayBase> backing_store,
                                         InternalIndex entry) {
     return PropertyDetails(PropertyKind::kData, NONE,
                            PropertyCellType::kNoCell);
   }
 
-  static bool HasElementImpl(Isolate* isolate, JSObject holder, size_t index,
-                             FixedArrayBase backing_store,
+  static bool HasElementImpl(Isolate* isolate, Tagged<JSObject> holder,
+                             size_t index, Tagged<FixedArrayBase> backing_store,
                              PropertyFilter filter) {
     return index < AccessorClass::GetCapacityImpl(holder, backing_store);
   }
 
-  static bool HasAccessorsImpl(JSObject holder, FixedArrayBase backing_store) {
+  static bool HasAccessorsImpl(Tagged<JSObject> holder,
+                               Tagged<FixedArrayBase> backing_store) {
     return false;
   }
 
@@ -3315,22 +3422,23 @@ class TypedElementsAccessor
     // deleted otherwise.
   }
 
-  static InternalIndex GetEntryForIndexImpl(Isolate* isolate, JSObject holder,
-                                            FixedArrayBase backing_store,
-                                            size_t index,
-                                            PropertyFilter filter) {
+  static InternalIndex GetEntryForIndexImpl(
+      Isolate* isolate, Tagged<JSObject> holder,
+      Tagged<FixedArrayBase> backing_store, size_t index,
+      PropertyFilter filter) {
     return index < AccessorClass::GetCapacityImpl(holder, backing_store)
                ? InternalIndex(index)
                : InternalIndex::NotFound();
   }
 
-  static size_t GetCapacityImpl(JSObject holder, FixedArrayBase backing_store) {
+  static size_t GetCapacityImpl(Tagged<JSObject> holder,
+                                Tagged<FixedArrayBase> backing_store) {
     JSTypedArray typed_array = JSTypedArray::cast(holder);
-    return typed_array.GetLength();
+    return typed_array->GetLength();
   }
 
-  static size_t NumberOfElementsImpl(JSObject receiver,
-                                     FixedArrayBase backing_store) {
+  static size_t NumberOfElementsImpl(Tagged<JSObject> receiver,
+                                     Tagged<FixedArrayBase> backing_store) {
     return AccessorClass::GetCapacityImpl(receiver, backing_store);
   }
 
@@ -3381,7 +3489,7 @@ class TypedElementsAccessor
     ElementType* data = static_cast<ElementType*>(typed_array->DataPtr());
     ElementType* first = data + start;
     ElementType* last = data + end;
-    if (typed_array->buffer().is_shared()) {
+    if (typed_array->buffer()->is_shared()) {
       // TypedArrays backed by shared buffers need to be filled using atomic
       // operations. Since 8-byte data are not currently always 8-byte aligned,
       // manually fill using SetImpl, which abstracts over alignment and atomic
@@ -3416,17 +3524,17 @@ class TypedElementsAccessor
     DisallowGarbageCollection no_gc;
     JSTypedArray typed_array = JSTypedArray::cast(*receiver);
 
-    if (typed_array.WasDetached()) {
-      return Just(value->IsUndefined(isolate) && length > start_from);
+    if (typed_array->WasDetached()) {
+      return Just(IsUndefined(*value, isolate) && length > start_from);
     }
 
     bool out_of_bounds = false;
-    size_t new_length = typed_array.GetLengthOrOutOfBounds(out_of_bounds);
+    size_t new_length = typed_array->GetLengthOrOutOfBounds(out_of_bounds);
     if (V8_UNLIKELY(out_of_bounds)) {
-      return Just(value->IsUndefined(isolate) && length > start_from);
+      return Just(IsUndefined(*value, isolate) && length > start_from);
     }
 
-    if (value->IsUndefined(isolate) && length > new_length) {
+    if (IsUndefined(*value, isolate) && length > new_length) {
       return Just(true);
     }
 
@@ -3438,18 +3546,18 @@ class TypedElementsAccessor
 
     ElementType typed_search_value;
     ElementType* data_ptr =
-        reinterpret_cast<ElementType*>(typed_array.DataPtr());
-    auto is_shared = typed_array.buffer().is_shared() ? kShared : kUnshared;
+        reinterpret_cast<ElementType*>(typed_array->DataPtr());
+    auto is_shared = typed_array->buffer()->is_shared() ? kShared : kUnshared;
     if (Kind == BIGINT64_ELEMENTS || Kind == BIGUINT64_ELEMENTS ||
         Kind == RAB_GSAB_BIGINT64_ELEMENTS ||
         Kind == RAB_GSAB_BIGUINT64_ELEMENTS) {
-      if (!value->IsBigInt()) return Just(false);
+      if (!IsBigInt(*value)) return Just(false);
       bool lossless;
       typed_search_value = FromHandle(value, &lossless);
       if (!lossless) return Just(false);
     } else {
-      if (!value->IsNumber()) return Just(false);
-      double search_value = value->Number();
+      if (!IsNumber(*value)) return Just(false);
+      double search_value = Object::Number(*value);
       if (!std::isfinite(search_value)) {
         // Integral types cannot represent +Inf or NaN.
         if (!(Kind == FLOAT32_ELEMENTS || Kind == FLOAT64_ELEMENTS ||
@@ -3493,10 +3601,10 @@ class TypedElementsAccessor
     // If this is called via Array.prototype.indexOf (not
     // TypedArray.prototype.indexOf), it's possible that the TypedArray is
     // detached / out of bounds here.
-    if (V8_UNLIKELY(typed_array.WasDetached())) return Just<int64_t>(-1);
+    if (V8_UNLIKELY(typed_array->WasDetached())) return Just<int64_t>(-1);
     bool out_of_bounds = false;
     size_t typed_array_length =
-        typed_array.GetLengthOrOutOfBounds(out_of_bounds);
+        typed_array->GetLengthOrOutOfBounds(out_of_bounds);
     if (V8_UNLIKELY(out_of_bounds)) {
       return Just<int64_t>(-1);
     }
@@ -3510,16 +3618,16 @@ class TypedElementsAccessor
     ElementType typed_search_value;
 
     ElementType* data_ptr =
-        reinterpret_cast<ElementType*>(typed_array.DataPtr());
+        reinterpret_cast<ElementType*>(typed_array->DataPtr());
 
     if (IsBigIntTypedArrayElementsKind(Kind)) {
-      if (!value->IsBigInt()) return Just<int64_t>(-1);
+      if (!IsBigInt(*value)) return Just<int64_t>(-1);
       bool lossless;
       typed_search_value = FromHandle(value, &lossless);
       if (!lossless) return Just<int64_t>(-1);
     } else {
-      if (!value->IsNumber()) return Just<int64_t>(-1);
-      double search_value = value->Number();
+      if (!IsNumber(*value)) return Just<int64_t>(-1);
+      double search_value = Object::Number(*value);
       if (!std::isfinite(search_value)) {
         // Integral types cannot represent +Inf or NaN.
         if (!IsFloatTypedArrayElementsKind(Kind)) {
@@ -3539,7 +3647,7 @@ class TypedElementsAccessor
       }
     }
 
-    auto is_shared = typed_array.buffer().is_shared() ? kShared : kUnshared;
+    auto is_shared = typed_array->buffer()->is_shared() ? kShared : kUnshared;
     for (size_t k = start_from; k < length; ++k) {
       ElementType elem_k = AccessorClass::GetImpl(data_ptr + k, is_shared);
       if (elem_k == typed_search_value) return Just<int64_t>(k);
@@ -3553,20 +3661,20 @@ class TypedElementsAccessor
     DisallowGarbageCollection no_gc;
     JSTypedArray typed_array = JSTypedArray::cast(*receiver);
 
-    DCHECK(!typed_array.IsDetachedOrOutOfBounds());
+    DCHECK(!typed_array->IsDetachedOrOutOfBounds());
 
     ElementType typed_search_value;
 
     ElementType* data_ptr =
-        reinterpret_cast<ElementType*>(typed_array.DataPtr());
+        reinterpret_cast<ElementType*>(typed_array->DataPtr());
     if (IsBigIntTypedArrayElementsKind(Kind)) {
-      if (!value->IsBigInt()) return Just<int64_t>(-1);
+      if (!IsBigInt(*value)) return Just<int64_t>(-1);
       bool lossless;
       typed_search_value = FromHandle(value, &lossless);
       if (!lossless) return Just<int64_t>(-1);
     } else {
-      if (!value->IsNumber()) return Just<int64_t>(-1);
-      double search_value = value->Number();
+      if (!IsNumber(*value)) return Just<int64_t>(-1);
+      double search_value = Object::Number(*value);
       if (!std::isfinite(search_value)) {
         if (std::is_integral<ElementType>::value) {
           // Integral types cannot represent +Inf or NaN.
@@ -3586,11 +3694,11 @@ class TypedElementsAccessor
       }
     }
 
-    size_t typed_array_length = typed_array.GetLength();
+    size_t typed_array_length = typed_array->GetLength();
     if (V8_UNLIKELY(start_from >= typed_array_length)) {
       // This can happen if the TypedArray got resized when we did ToInteger
       // on the last parameter of lastIndexOf.
-      DCHECK(typed_array.IsVariableLength());
+      DCHECK(typed_array->IsVariableLength());
       if (typed_array_length == 0) {
         return Just<int64_t>(-1);
       }
@@ -3598,7 +3706,7 @@ class TypedElementsAccessor
     }
 
     size_t k = start_from;
-    auto is_shared = typed_array.buffer().is_shared() ? kShared : kUnshared;
+    auto is_shared = typed_array->buffer()->is_shared() ? kShared : kUnshared;
     do {
       ElementType elem_k = AccessorClass::GetImpl(data_ptr + k, is_shared);
       if (elem_k == typed_search_value) return Just<int64_t>(k);
@@ -3606,17 +3714,17 @@ class TypedElementsAccessor
     return Just<int64_t>(-1);
   }
 
-  static void ReverseImpl(JSObject receiver) {
+  static void ReverseImpl(Tagged<JSObject> receiver) {
     DisallowGarbageCollection no_gc;
     JSTypedArray typed_array = JSTypedArray::cast(receiver);
 
-    DCHECK(!typed_array.IsDetachedOrOutOfBounds());
+    DCHECK(!typed_array->IsDetachedOrOutOfBounds());
 
-    size_t len = typed_array.GetLength();
+    size_t len = typed_array->GetLength();
     if (len == 0) return;
 
-    ElementType* data = static_cast<ElementType*>(typed_array.DataPtr());
-    if (typed_array.buffer().is_shared()) {
+    ElementType* data = static_cast<ElementType*>(typed_array->DataPtr());
+    if (typed_array->buffer()->is_shared()) {
       // TypedArrays backed by shared buffers need to be reversed using atomic
       // operations. Since 8-byte data are not currently always 8-byte aligned,
       // manually reverse using GetImpl and SetImpl, which abstract over
@@ -3654,35 +3762,35 @@ class TypedElementsAccessor
                                               JSTypedArray destination,
                                               size_t start, size_t end) {
     DisallowGarbageCollection no_gc;
-    DCHECK_EQ(destination.GetElementsKind(), AccessorClass::kind());
-    CHECK(!source.IsDetachedOrOutOfBounds());
-    CHECK(!destination.IsDetachedOrOutOfBounds());
+    DCHECK_EQ(destination->GetElementsKind(), AccessorClass::kind());
+    CHECK(!source->IsDetachedOrOutOfBounds());
+    CHECK(!destination->IsDetachedOrOutOfBounds());
     DCHECK_LE(start, end);
-    DCHECK_LE(end, source.GetLength());
+    DCHECK_LE(end, source->GetLength());
     size_t count = end - start;
-    DCHECK_LE(count, destination.GetLength());
-    ElementType* dest_data = static_cast<ElementType*>(destination.DataPtr());
+    DCHECK_LE(count, destination->GetLength());
+    ElementType* dest_data = static_cast<ElementType*>(destination->DataPtr());
     auto is_shared =
-        source.buffer().is_shared() || destination.buffer().is_shared()
+        source->buffer()->is_shared() || destination->buffer()->is_shared()
             ? kShared
             : kUnshared;
-    switch (source.GetElementsKind()) {
-#define TYPED_ARRAY_CASE(Type, type, TYPE, ctype)                            \
-  case TYPE##_ELEMENTS: {                                                    \
-    ctype* source_data = reinterpret_cast<ctype*>(source.DataPtr()) + start; \
-    CopyBetweenBackingStores<TYPE##_ELEMENTS, ctype>(source_data, dest_data, \
-                                                     count, is_shared);      \
-    break;                                                                   \
+    switch (source->GetElementsKind()) {
+#define TYPED_ARRAY_CASE(Type, type, TYPE, ctype)                             \
+  case TYPE##_ELEMENTS: {                                                     \
+    ctype* source_data = reinterpret_cast<ctype*>(source->DataPtr()) + start; \
+    CopyBetweenBackingStores<TYPE##_ELEMENTS, ctype>(source_data, dest_data,  \
+                                                     count, is_shared);       \
+    break;                                                                    \
   }
       TYPED_ARRAYS(TYPED_ARRAY_CASE)
 #undef TYPED_ARRAY_CASE
 
-#define TYPED_ARRAY_CASE(Type, type, TYPE, ctype, NON_RAB_GSAB_TYPE)         \
-  case TYPE##_ELEMENTS: {                                                    \
-    ctype* source_data = reinterpret_cast<ctype*>(source.DataPtr()) + start; \
-    CopyBetweenBackingStores<NON_RAB_GSAB_TYPE##_ELEMENTS, ctype>(           \
-        source_data, dest_data, count, is_shared);                           \
-    break;                                                                   \
+#define TYPED_ARRAY_CASE(Type, type, TYPE, ctype, NON_RAB_GSAB_TYPE)          \
+  case TYPE##_ELEMENTS: {                                                     \
+    ctype* source_data = reinterpret_cast<ctype*>(source->DataPtr()) + start; \
+    CopyBetweenBackingStores<NON_RAB_GSAB_TYPE##_ELEMENTS, ctype>(            \
+        source_data, dest_data, count, is_shared);                            \
+    break;                                                                    \
   }
       RAB_GSAB_TYPED_ARRAYS_WITH_NON_RAB_GSAB_ELEMENTS_KIND(TYPED_ARRAY_CASE)
 #undef TYPED_ARRAY_CASE
@@ -3721,35 +3829,35 @@ class TypedElementsAccessor
     // side-effects, as the source elements will always be a number.
     DisallowGarbageCollection no_gc;
 
-    CHECK(!source.IsDetachedOrOutOfBounds());
-    CHECK(!destination.IsDetachedOrOutOfBounds());
+    CHECK(!source->IsDetachedOrOutOfBounds());
+    CHECK(!destination->IsDetachedOrOutOfBounds());
 
-    DCHECK_LE(offset, destination.GetLength());
-    DCHECK_LE(length, destination.GetLength() - offset);
-    DCHECK_LE(length, source.GetLength());
+    DCHECK_LE(offset, destination->GetLength());
+    DCHECK_LE(length, destination->GetLength() - offset);
+    DCHECK_LE(length, source->GetLength());
 
-    ExternalArrayType source_type = source.type();
-    ExternalArrayType destination_type = destination.type();
+    ExternalArrayType source_type = source->type();
+    ExternalArrayType destination_type = destination->type();
 
     bool same_type = source_type == destination_type;
-    bool same_size = source.element_size() == destination.element_size();
+    bool same_size = source->element_size() == destination->element_size();
     bool both_are_simple = HasSimpleRepresentation(source_type) &&
                            HasSimpleRepresentation(destination_type);
 
-    uint8_t* source_data = static_cast<uint8_t*>(source.DataPtr());
-    uint8_t* dest_data = static_cast<uint8_t*>(destination.DataPtr());
-    size_t source_byte_length = source.GetByteLength();
-    size_t dest_byte_length = destination.GetByteLength();
+    uint8_t* source_data = static_cast<uint8_t*>(source->DataPtr());
+    uint8_t* dest_data = static_cast<uint8_t*>(destination->DataPtr());
+    size_t source_byte_length = source->GetByteLength();
+    size_t dest_byte_length = destination->GetByteLength();
 
-    bool source_shared = source.buffer().is_shared();
-    bool destination_shared = destination.buffer().is_shared();
+    bool source_shared = source->buffer()->is_shared();
+    bool destination_shared = destination->buffer()->is_shared();
 
     // We can simply copy the backing store if the types are the same, or if
     // we are converting e.g. Uint8 <-> Int8, as the binary representation
     // will be the same. This is not the case for floats or clamped Uint8,
     // which have special conversion operations.
     if (same_type || (same_size && both_are_simple)) {
-      size_t element_size = source.element_size();
+      size_t element_size = source->element_size();
       if (source_shared || destination_shared) {
         base::Relaxed_Memcpy(
             reinterpret_cast<base::Atomic8*>(dest_data + offset * element_size),
@@ -3778,7 +3886,7 @@ class TypedElementsAccessor
         source_data = cloned_source_elements.get();
       }
 
-      switch (source.GetElementsKind()) {
+      switch (source->GetElementsKind()) {
 #define TYPED_ARRAY_CASE(Type, type, TYPE, ctype)                   \
   case TYPE##_ELEMENTS:                                             \
     CopyBetweenBackingStores<TYPE##_ELEMENTS, ctype>(               \
@@ -3805,13 +3913,13 @@ class TypedElementsAccessor
     if (isolate->force_slow_path()) return true;
 #endif
 
-    Object source_proto = source.map().prototype();
+    Tagged<Object> source_proto = source->map()->prototype();
 
     // Null prototypes are OK - we don't need to do prototype chain lookups on
     // them.
-    if (source_proto.IsNull(isolate)) return false;
-    if (source_proto.IsJSProxy()) return true;
-    if (!context.native_context().is_initial_array_prototype(
+    if (IsNull(source_proto, isolate)) return false;
+    if (IsJSProxy(source_proto)) return true;
+    if (!context->native_context()->is_initial_array_prototype(
             JSObject::cast(source_proto))) {
       return true;
     }
@@ -3823,29 +3931,29 @@ class TypedElementsAccessor
                                         JSTypedArray destination, size_t length,
                                         size_t offset) {
     if (IsBigIntTypedArrayElementsKind(Kind)) return false;
-    Isolate* isolate = source.GetIsolate();
+    Isolate* isolate = source->GetIsolate();
     DisallowGarbageCollection no_gc;
     DisallowJavascriptExecution no_js(isolate);
 
-    CHECK(!destination.WasDetached());
+    CHECK(!destination->WasDetached());
     bool out_of_bounds = false;
-    CHECK_GE(destination.GetLengthOrOutOfBounds(out_of_bounds), length);
+    CHECK_GE(destination->GetLengthOrOutOfBounds(out_of_bounds), length);
     CHECK(!out_of_bounds);
 
     size_t current_length;
-    DCHECK(source.length().IsNumber() &&
-           TryNumberToSize(source.length(), &current_length) &&
+    DCHECK(IsNumber(source->length()) &&
+           TryNumberToSize(source->length(), &current_length) &&
            length <= current_length);
     USE(current_length);
 
-    size_t dest_length = destination.GetLength();
+    size_t dest_length = destination->GetLength();
     DCHECK(length + offset <= dest_length);
     USE(dest_length);
 
-    ElementsKind kind = source.GetElementsKind();
+    ElementsKind kind = source->GetElementsKind();
 
     auto destination_shared =
-        destination.buffer().is_shared() ? kShared : kUnshared;
+        destination->buffer()->is_shared() ? kShared : kUnshared;
 
     // When we find the hole, we normally have to look up the element on the
     // prototype chain, which is not handled here and we return false instead.
@@ -3856,25 +3964,25 @@ class TypedElementsAccessor
 
     Oddball undefined = ReadOnlyRoots(isolate).undefined_value();
     ElementType* dest_data =
-        reinterpret_cast<ElementType*>(destination.DataPtr()) + offset;
+        reinterpret_cast<ElementType*>(destination->DataPtr()) + offset;
 
     // Fast-path for packed Smi kind.
     if (kind == PACKED_SMI_ELEMENTS) {
-      FixedArray source_store = FixedArray::cast(source.elements());
+      FixedArray source_store = FixedArray::cast(source->elements());
 
       for (size_t i = 0; i < length; i++) {
-        Object elem = source_store.get(static_cast<int>(i));
+        Tagged<Object> elem = source_store->get(static_cast<int>(i));
         SetImpl(dest_data + i, FromScalar(Smi::ToInt(elem)),
                 destination_shared);
       }
       return true;
     } else if (kind == HOLEY_SMI_ELEMENTS) {
-      FixedArray source_store = FixedArray::cast(source.elements());
+      FixedArray source_store = FixedArray::cast(source->elements());
       for (size_t i = 0; i < length; i++) {
-        if (source_store.is_the_hole(isolate, static_cast<int>(i))) {
+        if (source_store->is_the_hole(isolate, static_cast<int>(i))) {
           SetImpl(dest_data + i, FromObject(undefined), destination_shared);
         } else {
-          Object elem = source_store.get(static_cast<int>(i));
+          Tagged<Object> elem = source_store->get(static_cast<int>(i));
           SetImpl(dest_data + i, FromScalar(Smi::ToInt(elem)),
                   destination_shared);
         }
@@ -3883,22 +3991,24 @@ class TypedElementsAccessor
     } else if (kind == PACKED_DOUBLE_ELEMENTS) {
       // Fast-path for packed double kind. We avoid boxing and then immediately
       // unboxing the double here by using get_scalar.
-      FixedDoubleArray source_store = FixedDoubleArray::cast(source.elements());
+      FixedDoubleArray source_store =
+          FixedDoubleArray::cast(source->elements());
 
       for (size_t i = 0; i < length; i++) {
         // Use the from_double conversion for this specific TypedArray type,
         // rather than relying on C++ to convert elem.
-        double elem = source_store.get_scalar(static_cast<int>(i));
+        double elem = source_store->get_scalar(static_cast<int>(i));
         SetImpl(dest_data + i, FromScalar(elem), destination_shared);
       }
       return true;
     } else if (kind == HOLEY_DOUBLE_ELEMENTS) {
-      FixedDoubleArray source_store = FixedDoubleArray::cast(source.elements());
+      FixedDoubleArray source_store =
+          FixedDoubleArray::cast(source->elements());
       for (size_t i = 0; i < length; i++) {
-        if (source_store.is_the_hole(static_cast<int>(i))) {
+        if (source_store->is_the_hole(static_cast<int>(i))) {
           SetImpl(dest_data + i, FromObject(undefined), destination_shared);
         } else {
-          double elem = source_store.get_scalar(static_cast<int>(i));
+          double elem = source_store->get_scalar(static_cast<int>(i));
           SetImpl(dest_data + i, FromScalar(elem), destination_shared);
         }
       }
@@ -3908,9 +4018,9 @@ class TypedElementsAccessor
   }
 
   // ES#sec-settypedarrayfromarraylike
-  static Object CopyElementsHandleSlow(Handle<Object> source,
-                                       Handle<JSTypedArray> destination,
-                                       size_t length, size_t offset) {
+  static Tagged<Object> CopyElementsHandleSlow(Handle<Object> source,
+                                               Handle<JSTypedArray> destination,
+                                               size_t length, size_t offset) {
     Isolate* isolate = destination->GetIsolate();
     // 8. Let k be 0.
     // 9. Repeat, while k < srcLength,
@@ -3959,9 +4069,9 @@ class TypedElementsAccessor
   // This doesn't guarantee that the destination array will be completely
   // filled. The caller must do this by passing a source with equal length, if
   // that is required.
-  static Object CopyElementsHandleImpl(Handle<Object> source,
-                                       Handle<JSObject> destination,
-                                       size_t length, size_t offset) {
+  static Tagged<Object> CopyElementsHandleImpl(Handle<Object> source,
+                                               Handle<JSObject> destination,
+                                               size_t length, size_t offset) {
     Isolate* isolate = destination->GetIsolate();
     if (length == 0) return *isolate->factory()->undefined_value();
 
@@ -3969,7 +4079,7 @@ class TypedElementsAccessor
         Handle<JSTypedArray>::cast(destination);
 
     // All conversions from TypedArrays can be done without allocation.
-    if (source->IsJSTypedArray()) {
+    if (IsJSTypedArray(*source)) {
       CHECK(!destination_ta->WasDetached());
       bool out_of_bounds = false;
       CHECK_LE(offset + length,
@@ -3986,7 +4096,7 @@ class TypedElementsAccessor
         CopyElementsFromTypedArray(*source_ta, *destination_ta, length, offset);
         return *isolate->factory()->undefined_value();
       }
-    } else if (source->IsJSArray()) {
+    } else if (IsJSArray(*source)) {
       CHECK(!destination_ta->WasDetached());
       bool out_of_bounds = false;
       CHECK_LE(offset + length,
@@ -3995,7 +4105,7 @@ class TypedElementsAccessor
       // Fast cases for packed numbers kinds where we don't need to allocate.
       Handle<JSArray> source_js_array = Handle<JSArray>::cast(source);
       size_t current_length;
-      DCHECK(source_js_array->length().IsNumber());
+      DCHECK(IsNumber(source_js_array->length()));
       if (TryNumberToSize(source_js_array->length(), &current_length) &&
           length <= current_length) {
         Handle<JSArray> source_array = Handle<JSArray>::cast(source);
@@ -4155,8 +4265,8 @@ int64_t TypedElementsAccessor<BIGINT64_ELEMENTS, int64_t>::FromScalar(
 // static
 template <>
 int64_t TypedElementsAccessor<BIGINT64_ELEMENTS, int64_t>::FromObject(
-    Object value, bool* lossless) {
-  return BigInt::cast(value).AsInt64(lossless);
+    Tagged<Object> value, bool* lossless) {
+  return BigInt::cast(value)->AsInt64(lossless);
 }
 
 // static
@@ -4204,8 +4314,8 @@ uint64_t TypedElementsAccessor<BIGUINT64_ELEMENTS, uint64_t>::FromScalar(
 // static
 template <>
 uint64_t TypedElementsAccessor<BIGUINT64_ELEMENTS, uint64_t>::FromObject(
-    Object value, bool* lossless) {
-  return BigInt::cast(value).AsUint64(lossless);
+    Tagged<Object> value, bool* lossless) {
+  return BigInt::cast(value)->AsUint64(lossless);
 }
 
 // static
@@ -4367,8 +4477,8 @@ int64_t TypedElementsAccessor<RAB_GSAB_BIGINT64_ELEMENTS, int64_t>::FromScalar(
 // static
 template <>
 int64_t TypedElementsAccessor<RAB_GSAB_BIGINT64_ELEMENTS, int64_t>::FromObject(
-    Object value, bool* lossless) {
-  return BigInt::cast(value).AsInt64(lossless);
+    Tagged<Object> value, bool* lossless) {
+  return BigInt::cast(value)->AsInt64(lossless);
 }
 
 // static
@@ -4417,9 +4527,9 @@ uint64_t TypedElementsAccessor<RAB_GSAB_BIGUINT64_ELEMENTS,
 // static
 template <>
 uint64_t TypedElementsAccessor<RAB_GSAB_BIGUINT64_ELEMENTS,
-                               uint64_t>::FromObject(Object value,
+                               uint64_t>::FromObject(Tagged<Object> value,
                                                      bool* lossless) {
-  return BigInt::cast(value).AsUint64(lossless);
+  return BigInt::cast(value)->AsUint64(lossless);
 }
 
 // static
@@ -4445,7 +4555,8 @@ class SloppyArgumentsElementsAccessor
     UNREACHABLE();
   }
 
-  static Handle<Object> GetImpl(Isolate* isolate, FixedArrayBase parameters,
+  static Handle<Object> GetImpl(Isolate* isolate,
+                                Tagged<FixedArrayBase> parameters,
                                 InternalIndex entry) {
     Handle<SloppyArgumentsElements> elements(
         SloppyArgumentsElements::cast(parameters), isolate);
@@ -4453,12 +4564,13 @@ class SloppyArgumentsElementsAccessor
     if (entry.as_uint32() < length) {
       // Read context mapped entry.
       DisallowGarbageCollection no_gc;
-      Object probe = elements->mapped_entries(entry.as_uint32(), kRelaxedLoad);
-      DCHECK(!probe.IsTheHole(isolate));
+      Tagged<Object> probe =
+          elements->mapped_entries(entry.as_uint32(), kRelaxedLoad);
+      DCHECK(!IsTheHole(probe, isolate));
       Context context = elements->context();
       int context_entry = Smi::ToInt(probe);
-      DCHECK(!context.get(context_entry).IsTheHole(isolate));
-      return handle(context.get(context_entry), isolate);
+      DCHECK(!IsTheHole(context->get(context_entry), isolate));
+      return handle(context->get(context_entry), isolate);
     } else {
       // Entry is not context mapped, defer to the arguments.
       Handle<Object> result = ArgumentsAccessor::GetImpl(
@@ -4478,34 +4590,36 @@ class SloppyArgumentsElementsAccessor
   }
 
   static inline void SetImpl(Handle<JSObject> holder, InternalIndex entry,
-                             Object value) {
+                             Tagged<Object> value) {
     SetImpl(holder->elements(), entry, value);
   }
 
-  static inline void SetImpl(FixedArrayBase store, InternalIndex entry,
-                             Object value) {
-    SloppyArgumentsElements elements = SloppyArgumentsElements::cast(store);
-    uint32_t length = elements.length();
+  static inline void SetImpl(Tagged<FixedArrayBase> store, InternalIndex entry,
+                             Tagged<Object> value) {
+    Tagged<SloppyArgumentsElements> elements =
+        SloppyArgumentsElements::cast(store);
+    uint32_t length = elements->length();
     if (entry.as_uint32() < length) {
       // Store context mapped entry.
       DisallowGarbageCollection no_gc;
-      Object probe = elements.mapped_entries(entry.as_uint32(), kRelaxedLoad);
-      DCHECK(!probe.IsTheHole());
-      Context context = Context::cast(elements.context());
+      Tagged<Object> probe =
+          elements->mapped_entries(entry.as_uint32(), kRelaxedLoad);
+      DCHECK(!IsTheHole(probe));
+      Context context = Context::cast(elements->context());
       int context_entry = Smi::ToInt(probe);
-      DCHECK(!context.get(context_entry).IsTheHole());
-      context.set(context_entry, value);
+      DCHECK(!IsTheHole(context->get(context_entry)));
+      context->set(context_entry, value);
     } else {
       //  Entry is not context mapped defer to arguments.
-      FixedArray arguments = elements.arguments();
-      Object current =
+      FixedArray arguments = elements->arguments();
+      Tagged<Object> current =
           ArgumentsAccessor::GetRaw(arguments, entry.adjust_down(length));
-      if (current.IsAliasedArgumentsEntry()) {
+      if (IsAliasedArgumentsEntry(current)) {
         AliasedArgumentsEntry alias = AliasedArgumentsEntry::cast(current);
-        Context context = Context::cast(elements.context());
-        int context_entry = alias.aliased_context_slot();
-        DCHECK(!context.get(context_entry).IsTheHole());
-        context.set(context_entry, value);
+        Context context = Context::cast(elements->context());
+        int context_entry = alias->aliased_context_slot();
+        DCHECK(!IsTheHole(context->get(context_entry)));
+        context->set(context_entry, value);
       } else {
         ArgumentsAccessor::SetImpl(arguments, entry.adjust_down(length), value);
       }
@@ -4519,32 +4633,34 @@ class SloppyArgumentsElementsAccessor
     UNREACHABLE();
   }
 
-  static uint32_t GetCapacityImpl(JSObject holder, FixedArrayBase store) {
-    SloppyArgumentsElements elements = SloppyArgumentsElements::cast(store);
-    FixedArray arguments = elements.arguments();
-    return elements.length() +
+  static uint32_t GetCapacityImpl(Tagged<JSObject> holder,
+                                  Tagged<FixedArrayBase> store) {
+    Tagged<SloppyArgumentsElements> elements =
+        SloppyArgumentsElements::cast(store);
+    Tagged<FixedArray> arguments = elements->arguments();
+    return elements->length() +
            ArgumentsAccessor::GetCapacityImpl(holder, arguments);
   }
 
-  static uint32_t GetMaxNumberOfEntries(JSObject holder,
-                                        FixedArrayBase backing_store) {
-    SloppyArgumentsElements elements =
+  static uint32_t GetMaxNumberOfEntries(Tagged<JSObject> holder,
+                                        Tagged<FixedArrayBase> backing_store) {
+    Tagged<SloppyArgumentsElements> elements =
         SloppyArgumentsElements::cast(backing_store);
-    FixedArrayBase arguments = elements.arguments();
+    Tagged<FixedArrayBase> arguments = elements->arguments();
     size_t max_entries =
         ArgumentsAccessor::GetMaxNumberOfEntries(holder, arguments);
     DCHECK_LE(max_entries, std::numeric_limits<uint32_t>::max());
-    return elements.length() + static_cast<uint32_t>(max_entries);
+    return elements->length() + static_cast<uint32_t>(max_entries);
   }
 
-  static uint32_t NumberOfElementsImpl(JSObject receiver,
-                                       FixedArrayBase backing_store) {
-    Isolate* isolate = receiver.GetIsolate();
-    SloppyArgumentsElements elements =
+  static uint32_t NumberOfElementsImpl(Tagged<JSObject> receiver,
+                                       Tagged<FixedArrayBase> backing_store) {
+    Isolate* isolate = receiver->GetIsolate();
+    Tagged<SloppyArgumentsElements> elements =
         SloppyArgumentsElements::cast(backing_store);
-    FixedArrayBase arguments = elements.arguments();
+    Tagged<FixedArrayBase> arguments = elements->arguments();
     uint32_t nof_elements = 0;
-    uint32_t length = elements.length();
+    uint32_t length = elements->length();
     for (uint32_t index = 0; index < length; index++) {
       if (HasParameterMapArg(isolate, elements, index)) nof_elements++;
     }
@@ -4567,64 +4683,68 @@ class SloppyArgumentsElementsAccessor
     return ExceptionStatus::kSuccess;
   }
 
-  static bool HasEntryImpl(Isolate* isolate, FixedArrayBase parameters,
+  static bool HasEntryImpl(Isolate* isolate, Tagged<FixedArrayBase> parameters,
                            InternalIndex entry) {
-    SloppyArgumentsElements elements =
+    Tagged<SloppyArgumentsElements> elements =
         SloppyArgumentsElements::cast(parameters);
-    uint32_t length = elements.length();
+    uint32_t length = elements->length();
     if (entry.raw_value() < length) {
       return HasParameterMapArg(isolate, elements, entry.raw_value());
     }
-    FixedArrayBase arguments = elements.arguments();
+    Tagged<FixedArrayBase> arguments = elements->arguments();
     return ArgumentsAccessor::HasEntryImpl(isolate, arguments,
                                            entry.adjust_down(length));
   }
 
-  static bool HasAccessorsImpl(JSObject holder, FixedArrayBase backing_store) {
-    SloppyArgumentsElements elements =
+  static bool HasAccessorsImpl(Tagged<JSObject> holder,
+                               Tagged<FixedArrayBase> backing_store) {
+    Tagged<SloppyArgumentsElements> elements =
         SloppyArgumentsElements::cast(backing_store);
-    FixedArray arguments = elements.arguments();
+    Tagged<FixedArray> arguments = elements->arguments();
     return ArgumentsAccessor::HasAccessorsImpl(holder, arguments);
   }
 
-  static InternalIndex GetEntryForIndexImpl(Isolate* isolate, JSObject holder,
-                                            FixedArrayBase parameters,
+  static InternalIndex GetEntryForIndexImpl(Isolate* isolate,
+                                            Tagged<JSObject> holder,
+                                            Tagged<FixedArrayBase> parameters,
                                             size_t index,
                                             PropertyFilter filter) {
-    SloppyArgumentsElements elements =
+    Tagged<SloppyArgumentsElements> elements =
         SloppyArgumentsElements::cast(parameters);
     if (HasParameterMapArg(isolate, elements, index)) {
       return InternalIndex(index);
     }
-    FixedArray arguments = elements.arguments();
+    Tagged<FixedArray> arguments = elements->arguments();
     InternalIndex entry = ArgumentsAccessor::GetEntryForIndexImpl(
         isolate, holder, arguments, index, filter);
     if (entry.is_not_found()) return entry;
     // Arguments entries could overlap with the dictionary entries, hence offset
     // them by the number of context mapped entries.
-    return entry.adjust_up(elements.length());
+    return entry.adjust_up(elements->length());
   }
 
-  static PropertyDetails GetDetailsImpl(JSObject holder, InternalIndex entry) {
-    SloppyArgumentsElements elements =
-        SloppyArgumentsElements::cast(holder.elements());
-    uint32_t length = elements.length();
+  static PropertyDetails GetDetailsImpl(Tagged<JSObject> holder,
+                                        InternalIndex entry) {
+    Tagged<SloppyArgumentsElements> elements =
+        SloppyArgumentsElements::cast(holder->elements());
+    uint32_t length = elements->length();
     if (entry.as_uint32() < length) {
       return PropertyDetails(PropertyKind::kData, NONE,
                              PropertyCellType::kNoCell);
     }
-    FixedArray arguments = elements.arguments();
+    Tagged<FixedArray> arguments = elements->arguments();
     return ArgumentsAccessor::GetDetailsImpl(arguments,
                                              entry.adjust_down(length));
   }
 
   static bool HasParameterMapArg(Isolate* isolate,
-                                 SloppyArgumentsElements elements,
+                                 Tagged<SloppyArgumentsElements> elements,
                                  size_t index) {
-    uint32_t length = elements.length();
+    uint32_t length = elements->length();
     if (index >= length) return false;
-    return !elements.mapped_entries(static_cast<uint32_t>(index), kRelaxedLoad)
-                .IsTheHole(isolate);
+    return !IsTheHole(
+        elements->mapped_entries(static_cast<uint32_t>(index), kRelaxedLoad),
+        isolate);
   }
 
   static void DeleteImpl(Handle<JSObject> obj, InternalIndex entry) {
@@ -4678,7 +4798,7 @@ class SloppyArgumentsElementsAccessor
     uint32_t length = elements->length();
 
     for (uint32_t i = 0; i < length; ++i) {
-      if (elements->mapped_entries(i, kRelaxedLoad).IsTheHole(isolate))
+      if (IsTheHole(elements->mapped_entries(i, kRelaxedLoad), isolate))
         continue;
       if (convert == GetKeysConversion::kConvertToString) {
         Handle<String> index_string = isolate->factory()->Uint32ToString(i);
@@ -4703,7 +4823,7 @@ class SloppyArgumentsElementsAccessor
     Handle<Map> original_map(object->map(), isolate);
     Handle<SloppyArgumentsElements> elements(
         SloppyArgumentsElements::cast(object->elements()), isolate);
-    bool search_for_hole = value->IsUndefined(isolate);
+    bool search_for_hole = IsUndefined(*value, isolate);
 
     for (size_t k = start_from; k < length; ++k) {
       DCHECK_EQ(object->map(), *original_map);
@@ -4716,7 +4836,7 @@ class SloppyArgumentsElementsAccessor
 
       Handle<Object> element_k = Subclass::GetImpl(isolate, *elements, entry);
 
-      if (element_k->IsAccessorPair()) {
+      if (IsAccessorPair(*element_k)) {
         LookupIterator it(isolate, object, k, LookupIterator::OWN);
         DCHECK(it.IsFound());
         DCHECK_EQ(it.state(), LookupIterator::ACCESSOR);
@@ -4724,13 +4844,13 @@ class SloppyArgumentsElementsAccessor
                                          Object::GetPropertyWithAccessor(&it),
                                          Nothing<bool>());
 
-        if (value->SameValueZero(*element_k)) return Just(true);
+        if (Object::SameValueZero(*value, *element_k)) return Just(true);
 
         if (object->map() != *original_map) {
           // Some mutation occurred in accessor. Abort "fast" path
           return IncludesValueSlowPath(isolate, object, value, k + 1, length);
         }
-      } else if (value->SameValueZero(*element_k)) {
+      } else if (Object::SameValueZero(*value, *element_k)) {
         return Just(true);
       }
     }
@@ -4756,7 +4876,7 @@ class SloppyArgumentsElementsAccessor
 
       Handle<Object> element_k = Subclass::GetImpl(isolate, *elements, entry);
 
-      if (element_k->IsAccessorPair()) {
+      if (IsAccessorPair(*element_k)) {
         LookupIterator it(isolate, object, k, LookupIterator::OWN);
         DCHECK(it.IsFound());
         DCHECK_EQ(it.state(), LookupIterator::ACCESSOR);
@@ -4764,7 +4884,7 @@ class SloppyArgumentsElementsAccessor
                                          Object::GetPropertyWithAccessor(&it),
                                          Nothing<int64_t>());
 
-        if (value->StrictEquals(*element_k)) {
+        if (Object::StrictEquals(*value, *element_k)) {
           return Just<int64_t>(k);
         }
 
@@ -4772,7 +4892,7 @@ class SloppyArgumentsElementsAccessor
           // Some mutation occurred in accessor. Abort "fast" path.
           return IndexOfValueSlowPath(isolate, object, value, k + 1, length);
         }
-      } else if (value->StrictEquals(*element_k)) {
+      } else if (Object::StrictEquals(*value, *element_k)) {
         return Just<int64_t>(k);
       }
     }
@@ -4789,13 +4909,14 @@ class SlowSloppyArgumentsElementsAccessor
       Isolate* isolate, Handle<SloppyArgumentsElements> elements,
       Handle<Object> result) {
     // Elements of the arguments object in slow mode might be slow aliases.
-    if (result->IsAliasedArgumentsEntry()) {
+    if (IsAliasedArgumentsEntry(*result)) {
       DisallowGarbageCollection no_gc;
-      AliasedArgumentsEntry alias = AliasedArgumentsEntry::cast(*result);
-      Context context = elements->context();
-      int context_entry = alias.aliased_context_slot();
-      DCHECK(!context.get(context_entry).IsTheHole(isolate));
-      return handle(context.get(context_entry), isolate);
+      Tagged<AliasedArgumentsEntry> alias =
+          AliasedArgumentsEntry::cast(*result);
+      Tagged<Context> context = elements->context();
+      int context_entry = alias->aliased_context_slot();
+      DCHECK(!IsTheHole(context->get(context_entry), isolate));
+      return handle(context->get(context_entry), isolate);
     }
     return result;
   }
@@ -4822,7 +4943,7 @@ class SlowSloppyArgumentsElementsAccessor
     Handle<FixedArrayBase> old_arguments(
         FixedArrayBase::cast(elements->arguments()), isolate);
     Handle<NumberDictionary> dictionary =
-        old_arguments->IsNumberDictionary()
+        IsNumberDictionary(*old_arguments)
             ? Handle<NumberDictionary>::cast(old_arguments)
             : JSObject::NormalizeElements(object);
     PropertyDetails details(PropertyKind::kData, attributes,
@@ -4845,12 +4966,13 @@ class SlowSloppyArgumentsElementsAccessor
         Handle<SloppyArgumentsElements>::cast(store);
     uint32_t length = elements->length();
     if (entry.as_uint32() < length) {
-      Object probe = elements->mapped_entries(entry.as_uint32(), kRelaxedLoad);
-      DCHECK(!probe.IsTheHole(isolate));
-      Context context = elements->context();
+      Tagged<Object> probe =
+          elements->mapped_entries(entry.as_uint32(), kRelaxedLoad);
+      DCHECK(!IsTheHole(probe, isolate));
+      Tagged<Context> context = elements->context();
       int context_entry = Smi::ToInt(probe);
-      DCHECK(!context.get(context_entry).IsTheHole(isolate));
-      context.set(context_entry, *value);
+      DCHECK(!IsTheHole(context->get(context_entry), isolate));
+      context->set(context_entry, *value);
 
       // Redefining attributes of an aliased element destroys fast aliasing.
       elements->set_mapped_entries(entry.as_uint32(),
@@ -4887,14 +5009,15 @@ class FastSloppyArgumentsElementsAccessor
   static Handle<Object> ConvertArgumentsStoreResult(
       Isolate* isolate, Handle<SloppyArgumentsElements> paramtere_map,
       Handle<Object> result) {
-    DCHECK(!result->IsAliasedArgumentsEntry());
+    DCHECK(!IsAliasedArgumentsEntry(*result));
     return result;
   }
 
   static Handle<FixedArray> GetArguments(Isolate* isolate,
-                                         FixedArrayBase store) {
-    SloppyArgumentsElements elements = SloppyArgumentsElements::cast(store);
-    return Handle<FixedArray>(elements.arguments(), isolate);
+                                         Tagged<FixedArrayBase> store) {
+    Tagged<SloppyArgumentsElements> elements =
+        SloppyArgumentsElements::cast(store);
+    return Handle<FixedArray>(elements->arguments(), isolate);
   }
 
   static Handle<NumberDictionary> NormalizeImpl(
@@ -4939,12 +5062,12 @@ class FastSloppyArgumentsElementsAccessor
     Handle<SloppyArgumentsElements> elements(
         SloppyArgumentsElements::cast(object->elements()), isolate);
     Handle<FixedArray> old_arguments(elements->arguments(), isolate);
-    if (old_arguments->IsNumberDictionary() ||
+    if (IsNumberDictionary(*old_arguments) ||
         static_cast<uint32_t>(old_arguments->length()) < new_capacity) {
       MAYBE_RETURN(GrowCapacityAndConvertImpl(object, new_capacity),
                    Nothing<bool>());
     }
-    FixedArray arguments = elements->arguments();
+    Tagged<FixedArray> arguments = elements->arguments();
     // For fast holey objects, the entry equals the index. The code above made
     // sure that there's enough space to store the value. We cannot convert
     // index to entry explicitly since the slot still contains the hole, so the
@@ -4967,11 +5090,11 @@ class FastSloppyArgumentsElementsAccessor
                                                          value, attributes);
   }
 
-  static void CopyElementsImpl(Isolate* isolate, FixedArrayBase from,
-                               uint32_t from_start, FixedArrayBase to,
+  static void CopyElementsImpl(Isolate* isolate, Tagged<FixedArrayBase> from,
+                               uint32_t from_start, Tagged<FixedArrayBase> to,
                                ElementsKind from_kind, uint32_t to_start,
                                int packed_size, int copy_size) {
-    DCHECK(!to.IsNumberDictionary());
+    DCHECK(!IsNumberDictionary(to));
     if (from_kind == SLOW_SLOPPY_ARGUMENTS_ELEMENTS) {
       CopyDictionaryToObjectElements(isolate, from, from_start, to,
                                      HOLEY_ELEMENTS, to_start, copy_size);
@@ -5030,13 +5153,15 @@ class StringWrapperElementsAccessor
                                          entry.adjust_down(length));
   }
 
-  static Handle<Object> GetImpl(Isolate* isolate, FixedArrayBase elements,
+  static Handle<Object> GetImpl(Isolate* isolate,
+                                Tagged<FixedArrayBase> elements,
                                 InternalIndex entry) {
     UNREACHABLE();
   }
 
-  static PropertyDetails GetDetailsImpl(JSObject holder, InternalIndex entry) {
-    uint32_t length = static_cast<uint32_t>(GetString(holder).length());
+  static PropertyDetails GetDetailsImpl(Tagged<JSObject> holder,
+                                        InternalIndex entry) {
+    uint32_t length = static_cast<uint32_t>(GetString(holder)->length());
     if (entry.as_uint32() < length) {
       PropertyAttributes attributes =
           static_cast<PropertyAttributes>(READ_ONLY | DONT_DELETE);
@@ -5047,11 +5172,11 @@ class StringWrapperElementsAccessor
                                                 entry.adjust_down(length));
   }
 
-  static InternalIndex GetEntryForIndexImpl(Isolate* isolate, JSObject holder,
-                                            FixedArrayBase backing_store,
-                                            size_t index,
-                                            PropertyFilter filter) {
-    uint32_t length = static_cast<uint32_t>(GetString(holder).length());
+  static InternalIndex GetEntryForIndexImpl(
+      Isolate* isolate, Tagged<JSObject> holder,
+      Tagged<FixedArrayBase> backing_store, size_t index,
+      PropertyFilter filter) {
+    uint32_t length = static_cast<uint32_t>(GetString(holder)->length());
     if (index < length) return InternalIndex(index);
     InternalIndex backing_store_entry =
         BackingStoreAccessor::GetEntryForIndexImpl(
@@ -5061,7 +5186,7 @@ class StringWrapperElementsAccessor
   }
 
   static void DeleteImpl(Handle<JSObject> holder, InternalIndex entry) {
-    uint32_t length = static_cast<uint32_t>(GetString(*holder).length());
+    uint32_t length = static_cast<uint32_t>(GetString(*holder)->length());
     if (entry.as_uint32() < length) {
       return;  // String contents can't be deleted.
     }
@@ -5069,8 +5194,8 @@ class StringWrapperElementsAccessor
   }
 
   static void SetImpl(Handle<JSObject> holder, InternalIndex entry,
-                      Object value) {
-    uint32_t length = static_cast<uint32_t>(GetString(*holder).length());
+                      Tagged<Object> value) {
+    uint32_t length = static_cast<uint32_t>(GetString(*holder)->length());
     if (entry.as_uint32() < length) {
       return;  // String contents are read-only.
     }
@@ -5082,7 +5207,7 @@ class StringWrapperElementsAccessor
                              Handle<Object> value,
                              PropertyAttributes attributes,
                              uint32_t new_capacity) {
-    DCHECK(index >= static_cast<uint32_t>(GetString(*object).length()));
+    DCHECK(index >= static_cast<uint32_t>(GetString(*object)->length()));
     // Explicitly grow fast backing stores if needed. Dictionaries know how to
     // extend their capacity themselves.
     if (KindTraits::Kind == FAST_STRING_WRAPPER_ELEMENTS &&
@@ -5101,7 +5226,7 @@ class StringWrapperElementsAccessor
                               Handle<FixedArrayBase> store, InternalIndex entry,
                               Handle<Object> value,
                               PropertyAttributes attributes) {
-    uint32_t length = static_cast<uint32_t>(GetString(*object).length());
+    uint32_t length = static_cast<uint32_t>(GetString(*object)->length());
     if (entry.as_uint32() < length) {
       return;  // String contents can't be reconfigured.
     }
@@ -5129,7 +5254,7 @@ class StringWrapperElementsAccessor
   V8_WARN_UNUSED_RESULT static ExceptionStatus CollectElementIndicesImpl(
       Handle<JSObject> object, Handle<FixedArrayBase> backing_store,
       KeyAccumulator* keys) {
-    uint32_t length = GetString(*object).length();
+    uint32_t length = GetString(*object)->length();
     Factory* factory = keys->isolate()->factory();
     for (uint32_t i = 0; i < length; i++) {
       RETURN_FAILURE_IF_NOT_SUCCESSFUL(
@@ -5160,11 +5285,11 @@ class StringWrapperElementsAccessor
         capacity);
   }
 
-  static void CopyElementsImpl(Isolate* isolate, FixedArrayBase from,
-                               uint32_t from_start, FixedArrayBase to,
+  static void CopyElementsImpl(Isolate* isolate, Tagged<FixedArrayBase> from,
+                               uint32_t from_start, Tagged<FixedArrayBase> to,
                                ElementsKind from_kind, uint32_t to_start,
                                int packed_size, int copy_size) {
-    DCHECK(!to.IsNumberDictionary());
+    DCHECK(!IsNumberDictionary(to));
     if (from_kind == SLOW_STRING_WRAPPER_ELEMENTS) {
       CopyDictionaryToObjectElements(isolate, from, from_start, to,
                                      HOLEY_ELEMENTS, to_start, copy_size);
@@ -5175,19 +5300,19 @@ class StringWrapperElementsAccessor
     }
   }
 
-  static uint32_t NumberOfElementsImpl(JSObject object,
-                                       FixedArrayBase backing_store) {
-    uint32_t length = GetString(object).length();
+  static uint32_t NumberOfElementsImpl(Tagged<JSObject> object,
+                                       Tagged<FixedArrayBase> backing_store) {
+    uint32_t length = GetString(object)->length();
     return length +
            BackingStoreAccessor::NumberOfElementsImpl(object, backing_store);
   }
 
  private:
-  static String GetString(JSObject holder) {
-    DCHECK(holder.IsJSPrimitiveWrapper());
-    JSPrimitiveWrapper js_value = JSPrimitiveWrapper::cast(holder);
-    DCHECK(js_value.value().IsString());
-    return String::cast(js_value.value());
+  static Tagged<String> GetString(Tagged<JSObject> holder) {
+    DCHECK(IsJSPrimitiveWrapper(holder));
+    Tagged<JSPrimitiveWrapper> js_value = JSPrimitiveWrapper::cast(holder);
+    DCHECK(IsString(js_value->value()));
+    return String::cast(js_value->value());
   }
 };
 
@@ -5207,7 +5332,8 @@ class SlowStringWrapperElementsAccessor
           SlowStringWrapperElementsAccessor, DictionaryElementsAccessor,
           ElementsKindTraits<SLOW_STRING_WRAPPER_ELEMENTS>> {
  public:
-  static bool HasAccessorsImpl(JSObject holder, FixedArrayBase backing_store) {
+  static bool HasAccessorsImpl(Tagged<JSObject> holder,
+                               Tagged<FixedArrayBase> backing_store) {
     return DictionaryElementsAccessor::HasAccessorsImpl(holder, backing_store);
   }
 };
@@ -5221,9 +5347,9 @@ MaybeHandle<Object> ArrayConstructInitializeElements(
     JSArray::Initialize(array, JSArray::kPreallocatedArrayElements);
     return array;
 
-  } else if (args->length() == 1 && args->at(0)->IsNumber()) {
+  } else if (args->length() == 1 && IsNumber(*args->at(0))) {
     uint32_t length;
-    if (!args->at(0)->ToArrayLength(&length)) {
+    if (!Object::ToArrayLength(*args->at(0), &length)) {
       return ThrowArrayLengthRangeError(array->GetIsolate());
     }
 
@@ -5290,7 +5416,7 @@ MaybeHandle<Object> ArrayConstructInitializeElements(
       Handle<FixedDoubleArray> double_elms =
           Handle<FixedDoubleArray>::cast(elms);
       for (int entry = 0; entry < number_of_elements; entry++) {
-        double_elms->set(entry, (*args)[entry].Number());
+        double_elms->set(entry, Object::Number((*args)[entry]));
       }
       break;
     }
@@ -5308,11 +5434,12 @@ void CopyFastNumberJSArrayElementsToTypedArray(Address raw_context,
                                                Address raw_destination,
                                                uintptr_t length,
                                                uintptr_t offset) {
-  Context context = Context::cast(Object(raw_context));
-  JSArray source = JSArray::cast(Object(raw_source));
-  JSTypedArray destination = JSTypedArray::cast(Object(raw_destination));
+  Tagged<Context> context = Context::cast(Object(raw_context));
+  Tagged<JSArray> source = JSArray::cast(Object(raw_source));
+  Tagged<JSTypedArray> destination =
+      JSTypedArray::cast(Object(raw_destination));
 
-  switch (destination.GetElementsKind()) {
+  switch (destination->GetElementsKind()) {
 #define TYPED_ARRAYS_CASE(Type, type, TYPE, ctype)           \
   case TYPE##_ELEMENTS:                                      \
     CHECK(Type##ElementsAccessor::TryCopyElementsFastNumber( \
@@ -5329,10 +5456,11 @@ void CopyFastNumberJSArrayElementsToTypedArray(Address raw_context,
 void CopyTypedArrayElementsToTypedArray(Address raw_source,
                                         Address raw_destination,
                                         uintptr_t length, uintptr_t offset) {
-  JSTypedArray source = JSTypedArray::cast(Object(raw_source));
-  JSTypedArray destination = JSTypedArray::cast(Object(raw_destination));
+  Tagged<JSTypedArray> source = JSTypedArray::cast(Object(raw_source));
+  Tagged<JSTypedArray> destination =
+      JSTypedArray::cast(Object(raw_destination));
 
-  switch (destination.GetElementsKind()) {
+  switch (destination->GetElementsKind()) {
 #define TYPED_ARRAYS_CASE(Type, type, TYPE, ctype)                          \
   case TYPE##_ELEMENTS:                                                     \
     Type##ElementsAccessor::CopyElementsFromTypedArray(source, destination, \
@@ -5348,10 +5476,11 @@ void CopyTypedArrayElementsToTypedArray(Address raw_source,
 
 void CopyTypedArrayElementsSlice(Address raw_source, Address raw_destination,
                                  uintptr_t start, uintptr_t end) {
-  JSTypedArray source = JSTypedArray::cast(Object(raw_source));
-  JSTypedArray destination = JSTypedArray::cast(Object(raw_destination));
+  Tagged<JSTypedArray> source = JSTypedArray::cast(Object(raw_source));
+  Tagged<JSTypedArray> destination =
+      JSTypedArray::cast(Object(raw_destination));
 
-  destination.GetElementsAccessor()->CopyTypedArrayElementsSlice(
+  destination->GetElementsAccessor()->CopyTypedArrayElementsSlice(
       source, destination, start, end);
 }
 
@@ -5386,8 +5515,8 @@ Handle<JSArray> ElementsAccessor::Concat(Isolate* isolate,
     DisallowGarbageCollection no_gc;
     bool is_holey = false;
     for (uint32_t i = 0; i < concat_size; i++) {
-      Object arg = (*args)[i];
-      ElementsKind arg_kind = JSArray::cast(arg).GetElementsKind();
+      Tagged<Object> arg = (*args)[i];
+      ElementsKind arg_kind = JSArray::cast(arg)->GetElementsKind();
       has_raw_doubles = has_raw_doubles || IsDoubleElementsKind(arg_kind);
       is_holey = is_holey || IsHoleyElementsKind(arg_kind);
       result_elements_kind =
@@ -5403,9 +5532,10 @@ Handle<JSArray> ElementsAccessor::Concat(Isolate* isolate,
   // boxing doubles may cause incremental marking.
   bool requires_double_boxing =
       has_raw_doubles && !IsDoubleElementsKind(result_elements_kind);
-  ArrayStorageAllocationMode mode = requires_double_boxing
-                                        ? INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE
-                                        : DONT_INITIALIZE_ARRAY_ELEMENTS;
+  auto mode =
+      requires_double_boxing
+          ? ArrayStorageAllocationMode::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE
+          : ArrayStorageAllocationMode::DONT_INITIALIZE_ARRAY_ELEMENTS;
   Handle<JSArray> result_array = isolate->factory()->NewJSArray(
       result_elements_kind, result_len, result_len, mode);
   if (result_len == 0) return result_array;
@@ -5416,11 +5546,11 @@ Handle<JSArray> ElementsAccessor::Concat(Isolate* isolate,
   for (uint32_t i = 0; i < concat_size; i++) {
     // It is crucial to keep |array| in a raw pointer form to avoid
     // performance degradation.
-    JSArray array = JSArray::cast((*args)[i]);
+    Tagged<JSArray> array = JSArray::cast((*args)[i]);
     uint32_t len = 0;
-    array.length().ToArrayLength(&len);
+    Object::ToArrayLength(array->length(), &len);
     if (len == 0) continue;
-    ElementsKind from_kind = array.GetElementsKind();
+    ElementsKind from_kind = array->GetElementsKind();
     accessor->CopyElements(array, 0, from_kind, storage, insertion_index, len);
     insertion_index += len;
   }
diff --git a/deps/v8/src/objects/elements.h b/deps/v8/src/objects/elements.h
index 5f53c9000dbfc4..7cfa42f4db78ca 100644
--- a/deps/v8/src/objects/elements.h
+++ b/deps/v8/src/objects/elements.h
@@ -33,7 +33,7 @@ class ElementsAccessor {
 
   // Checks the elements of an object for consistency, asserting when a problem
   // is found.
-  virtual void Validate(JSObject obj) = 0;
+  virtual void Validate(Tagged<JSObject> obj) = 0;
 
   // Returns true if a holder contains an element with the specified index
   // without iterating up the prototype chain. The first version takes the
@@ -45,16 +45,16 @@ class ElementsAccessor {
   // Note that only Dictionary elements have custom
   // PropertyAttributes associated, hence the |filter| argument is ignored for
   // all but DICTIONARY_ELEMENTS and SLOW_SLOPPY_ARGUMENTS_ELEMENTS.
-  virtual bool HasElement(JSObject holder, uint32_t index,
-                          FixedArrayBase backing_store,
+  virtual bool HasElement(Tagged<JSObject> holder, uint32_t index,
+                          Tagged<FixedArrayBase> backing_store,
                           PropertyFilter filter = ALL_PROPERTIES) = 0;
 
-  inline bool HasElement(JSObject holder, uint32_t index,
+  inline bool HasElement(Tagged<JSObject> holder, uint32_t index,
                          PropertyFilter filter = ALL_PROPERTIES);
 
   // Note: this is currently not implemented for string wrapper and
   // typed array elements.
-  virtual bool HasEntry(JSObject holder, InternalIndex entry) = 0;
+  virtual bool HasEntry(Tagged<JSObject> holder, InternalIndex entry) = 0;
 
   virtual Handle<Object> Get(Isolate* isolate, Handle<JSObject> holder,
                              InternalIndex entry) = 0;
@@ -65,8 +65,8 @@ class ElementsAccessor {
                                    InternalIndex entry,
                                    SeqCstAccessTag tag) = 0;
 
-  virtual bool HasAccessors(JSObject holder) = 0;
-  virtual size_t NumberOfElements(JSObject holder) = 0;
+  virtual bool HasAccessors(Tagged<JSObject> holder) = 0;
+  virtual size_t NumberOfElements(Tagged<JSObject> holder) = 0;
 
   // Modifies the length data property as specified for JSArrays and resizes the
   // underlying backing store accordingly. The method honors the semantics of
@@ -117,19 +117,23 @@ class ElementsAccessor {
   static void TearDown();
 
   virtual void Set(Handle<JSObject> holder, InternalIndex entry,
-                   Object value) = 0;
+                   Tagged<Object> value) = 0;
 
   // Currently only shared array elements support sequentially consistent
   // access.
   virtual void SetAtomic(Handle<JSObject> holder, InternalIndex entry,
-                         Object value, SeqCstAccessTag tag) = 0;
+                         Tagged<Object> value, SeqCstAccessTag tag) = 0;
 
   // Currently only shared array elements support sequentially consistent
   // access.
   virtual Handle<Object> SwapAtomic(Isolate* isolate, Handle<JSObject> holder,
-                                    InternalIndex entry, Object value,
+                                    InternalIndex entry, Tagged<Object> value,
                                     SeqCstAccessTag tag) = 0;
 
+  virtual Handle<Object> CompareAndSwapAtomic(
+      Isolate* isolate, Handle<JSObject> holder, InternalIndex entry,
+      Tagged<Object> expected, Tagged<Object> value, SeqCstAccessTag tag) = 0;
+
   V8_WARN_UNUSED_RESULT virtual Maybe<bool> Add(Handle<JSObject> object,
                                                 uint32_t index,
                                                 Handle<Object> value,
@@ -155,7 +159,8 @@ class ElementsAccessor {
 
   virtual Handle<NumberDictionary> Normalize(Handle<JSObject> object) = 0;
 
-  virtual size_t GetCapacity(JSObject holder, FixedArrayBase backing_store) = 0;
+  virtual size_t GetCapacity(Tagged<JSObject> holder,
+                             Tagged<FixedArrayBase> backing_store) = 0;
 
   V8_WARN_UNUSED_RESULT virtual MaybeHandle<Object> Fill(
       Handle<JSObject> receiver, Handle<Object> obj_value, size_t start,
@@ -178,22 +183,22 @@ class ElementsAccessor {
                                           Handle<Object> value,
                                           size_t start) = 0;
 
-  virtual void Reverse(JSObject receiver) = 0;
+  virtual void Reverse(Tagged<JSObject> receiver) = 0;
 
   virtual void CopyElements(Isolate* isolate, Handle<FixedArrayBase> source,
                             ElementsKind source_kind,
                             Handle<FixedArrayBase> destination, int size) = 0;
 
-  virtual Object CopyElements(Handle<Object> source,
-                              Handle<JSObject> destination, size_t length,
-                              size_t offset) = 0;
+  virtual Tagged<Object> CopyElements(Handle<Object> source,
+                                      Handle<JSObject> destination,
+                                      size_t length, size_t offset) = 0;
 
   virtual Handle<FixedArray> CreateListFromArrayLike(Isolate* isolate,
                                                      Handle<JSObject> object,
                                                      uint32_t length) = 0;
 
-  virtual void CopyTypedArrayElementsSlice(JSTypedArray source,
-                                           JSTypedArray destination,
+  virtual void CopyTypedArrayElementsSlice(Tagged<JSTypedArray> source,
+                                           Tagged<JSTypedArray> destination,
                                            size_t start, size_t end) = 0;
 
  protected:
@@ -207,11 +212,13 @@ class ElementsAccessor {
   // indices are equivalent to entries. In the NumberDictionary
   // ElementsAccessor, entries are mapped to an index using the KeyAt method on
   // the NumberDictionary.
-  virtual InternalIndex GetEntryForIndex(Isolate* isolate, JSObject holder,
-                                         FixedArrayBase backing_store,
+  virtual InternalIndex GetEntryForIndex(Isolate* isolate,
+                                         Tagged<JSObject> holder,
+                                         Tagged<FixedArrayBase> backing_store,
                                          size_t index) = 0;
 
-  virtual PropertyDetails GetDetails(JSObject holder, InternalIndex entry) = 0;
+  virtual PropertyDetails GetDetails(Tagged<JSObject> holder,
+                                     InternalIndex entry) = 0;
   virtual void Reconfigure(Handle<JSObject> object,
                            Handle<FixedArrayBase> backing_store,
                            InternalIndex entry, Handle<Object> value,
@@ -224,8 +231,8 @@ class ElementsAccessor {
   // raw pointer parameter |source_holder| in the function that allocates.
   // This is done intentionally to avoid ArrayConcat() builtin performance
   // degradation.
-  virtual void CopyElements(JSObject source_holder, uint32_t source_start,
-                            ElementsKind source_kind,
+  virtual void CopyElements(Tagged<JSObject> source_holder,
+                            uint32_t source_start, ElementsKind source_kind,
                             Handle<FixedArrayBase> destination,
                             uint32_t destination_start, int copy_size) = 0;
 
diff --git a/deps/v8/src/objects/embedder-data-slot-inl.h b/deps/v8/src/objects/embedder-data-slot-inl.h
index 8250ed97277d19..d4e5a9b932be1c 100644
--- a/deps/v8/src/objects/embedder-data-slot-inl.h
+++ b/deps/v8/src/objects/embedder-data-slot-inl.h
@@ -20,21 +20,23 @@
 namespace v8 {
 namespace internal {
 
-EmbedderDataSlot::EmbedderDataSlot(EmbedderDataArray array, int entry_index)
+EmbedderDataSlot::EmbedderDataSlot(Tagged<EmbedderDataArray> array,
+                                   int entry_index)
     : SlotBase(FIELD_ADDR(array,
                           EmbedderDataArray::OffsetOfElementAt(entry_index))) {}
 
-EmbedderDataSlot::EmbedderDataSlot(JSObject object, int embedder_field_index)
+EmbedderDataSlot::EmbedderDataSlot(Tagged<JSObject> object,
+                                   int embedder_field_index)
     : SlotBase(FIELD_ADDR(
-          object, object.GetEmbedderFieldOffset(embedder_field_index))) {}
+          object, object->GetEmbedderFieldOffset(embedder_field_index))) {}
 
 EmbedderDataSlot::EmbedderDataSlot(const EmbedderDataSlotSnapshot& snapshot)
     : SlotBase(reinterpret_cast<Address>(&snapshot)) {}
 
-void EmbedderDataSlot::Initialize(Object initial_value) {
+void EmbedderDataSlot::Initialize(Tagged<Object> initial_value) {
   // TODO(v8) initialize the slot with Smi::zero() instead. This'll also
   // guarantee that we don't need a write barrier.
-  DCHECK(initial_value.IsSmi() ||
+  DCHECK(IsSmi(initial_value) ||
          ReadOnlyHeap::Contains(HeapObject::cast(initial_value)));
   ObjectSlot(address() + kTaggedPayloadOffset).Relaxed_Store(initial_value);
 #ifdef V8_COMPRESS_POINTERS
@@ -42,11 +44,11 @@ void EmbedderDataSlot::Initialize(Object initial_value) {
 #endif
 }
 
-Object EmbedderDataSlot::load_tagged() const {
+Tagged<Object> EmbedderDataSlot::load_tagged() const {
   return ObjectSlot(address() + kTaggedPayloadOffset).Relaxed_Load();
 }
 
-void EmbedderDataSlot::store_smi(Smi value) {
+void EmbedderDataSlot::store_smi(Tagged<Smi> value) {
   ObjectSlot(address() + kTaggedPayloadOffset).Relaxed_Store(value);
 #ifdef V8_COMPRESS_POINTERS
   // See gc_safe_store() for the reasons behind two stores.
@@ -55,10 +57,10 @@ void EmbedderDataSlot::store_smi(Smi value) {
 }
 
 // static
-void EmbedderDataSlot::store_tagged(EmbedderDataArray array, int entry_index,
-                                    Object value) {
+void EmbedderDataSlot::store_tagged(Tagged<EmbedderDataArray> array,
+                                    int entry_index, Tagged<Object> value) {
 #ifdef V8_COMPRESS_POINTERS
-  CHECK(value.IsSmi() ||
+  CHECK(IsSmi(value) ||
         V8HeapCompressionScheme::GetPtrComprCageBaseAddress(value.ptr()) ==
             V8HeapCompressionScheme::GetPtrComprCageBaseAddress(array.ptr()));
 #endif
@@ -74,14 +76,15 @@ void EmbedderDataSlot::store_tagged(EmbedderDataArray array, int entry_index,
 }
 
 // static
-void EmbedderDataSlot::store_tagged(JSObject object, int embedder_field_index,
-                                    Object value) {
+void EmbedderDataSlot::store_tagged(Tagged<JSObject> object,
+                                    int embedder_field_index,
+                                    Tagged<Object> value) {
 #ifdef V8_COMPRESS_POINTERS
-  CHECK(value.IsSmi() ||
+  CHECK(IsSmi(value) ||
         V8HeapCompressionScheme::GetPtrComprCageBaseAddress(value.ptr()) ==
             V8HeapCompressionScheme::GetPtrComprCageBaseAddress(object.ptr()));
 #endif
-  int slot_offset = object.GetEmbedderFieldOffset(embedder_field_index);
+  int slot_offset = object->GetEmbedderFieldOffset(embedder_field_index);
   ObjectSlot(FIELD_ADDR(object, slot_offset + kTaggedPayloadOffset))
       .Relaxed_Store(value);
   WRITE_BARRIER(object, slot_offset + kTaggedPayloadOffset, value);
@@ -189,7 +192,7 @@ void EmbedderDataSlot::gc_safe_store(Isolate* isolate, Address value) {
 
 // static
 void EmbedderDataSlot::PopulateEmbedderDataSnapshot(
-    Map map, JSObject js_object, int entry_index,
+    Tagged<Map> map, Tagged<JSObject> js_object, int entry_index,
     EmbedderDataSlotSnapshot& snapshot) {
 #ifdef V8_COMPRESS_POINTERS
   static_assert(sizeof(EmbedderDataSlotSnapshot) == sizeof(AtomicTagged_t) * 2);
@@ -199,7 +202,7 @@ void EmbedderDataSlot::PopulateEmbedderDataSnapshot(
   static_assert(sizeof(EmbedderDataSlotSnapshot) == kEmbedderDataSlotSize);
 
   const Address field_base =
-      FIELD_ADDR(js_object, js_object.GetEmbedderFieldOffset(entry_index));
+      FIELD_ADDR(js_object, js_object->GetEmbedderFieldOffset(entry_index));
 
 #if defined(V8_TARGET_BIG_ENDIAN) && defined(V8_COMPRESS_POINTERS)
   const int index = 1;
diff --git a/deps/v8/src/objects/embedder-data-slot.h b/deps/v8/src/objects/embedder-data-slot.h
index 726c84e458ae8e..76cbb5128cb758 100644
--- a/deps/v8/src/objects/embedder-data-slot.h
+++ b/deps/v8/src/objects/embedder-data-slot.h
@@ -90,31 +90,32 @@ class EmbedderDataSlot
   static constexpr int kRequiredPtrAlignment = kSmiTagSize;
 
   using EmbedderDataSlotSnapshot = Address;
-  V8_INLINE static void PopulateEmbedderDataSnapshot(Map map,
-                                                     JSObject js_object,
+  V8_INLINE static void PopulateEmbedderDataSnapshot(Tagged<Map> map,
+                                                     Tagged<JSObject> js_object,
                                                      int entry_index,
                                                      EmbedderDataSlotSnapshot&);
 
   EmbedderDataSlot() : SlotBase(kNullAddress) {}
-  V8_INLINE EmbedderDataSlot(EmbedderDataArray array, int entry_index);
-  V8_INLINE EmbedderDataSlot(JSObject object, int embedder_field_index);
+  V8_INLINE EmbedderDataSlot(Tagged<EmbedderDataArray> array, int entry_index);
+  V8_INLINE EmbedderDataSlot(Tagged<JSObject> object, int embedder_field_index);
   V8_INLINE explicit EmbedderDataSlot(const EmbedderDataSlotSnapshot& snapshot);
 
   // Opaque type used for storing raw embedder data.
   using RawData = Address;
 
-  V8_INLINE void Initialize(Object initial_value);
+  V8_INLINE void Initialize(Tagged<Object> initial_value);
 
-  V8_INLINE Object load_tagged() const;
-  V8_INLINE void store_smi(Smi value);
+  V8_INLINE Tagged<Object> load_tagged() const;
+  V8_INLINE void store_smi(Tagged<Smi> value);
 
   // Setting an arbitrary tagged value requires triggering a write barrier
   // which requires separate object and offset values, therefore these static
   // functions also has the target object parameter.
-  static V8_INLINE void store_tagged(EmbedderDataArray array, int entry_index,
-                                     Object value);
-  static V8_INLINE void store_tagged(JSObject object, int embedder_field_index,
-                                     Object value);
+  static V8_INLINE void store_tagged(Tagged<EmbedderDataArray> array,
+                                     int entry_index, Tagged<Object> value);
+  static V8_INLINE void store_tagged(Tagged<JSObject> object,
+                                     int embedder_field_index,
+                                     Tagged<Object> value);
 
   // Tries reinterpret the value as an aligned pointer and sets *out_result to
   // the pointer-like value. Note, that some Smis could still look like an
diff --git a/deps/v8/src/objects/feedback-cell-inl.h b/deps/v8/src/objects/feedback-cell-inl.h
index 441e53312cea77..0e0a59d2a9d00c 100644
--- a/deps/v8/src/objects/feedback-cell-inl.h
+++ b/deps/v8/src/objects/feedback-cell-inl.h
@@ -22,25 +22,25 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(FeedbackCell)
 
-RELEASE_ACQUIRE_ACCESSORS(FeedbackCell, value, HeapObject, kValueOffset)
+RELEASE_ACQUIRE_ACCESSORS(FeedbackCell, value, Tagged<HeapObject>, kValueOffset)
 
 void FeedbackCell::clear_padding() {
   if (FeedbackCell::kAlignedSize == FeedbackCell::kUnalignedSize) return;
   DCHECK_GE(FeedbackCell::kAlignedSize, FeedbackCell::kUnalignedSize);
-  memset(reinterpret_cast<byte*>(address() + FeedbackCell::kUnalignedSize), 0,
-         FeedbackCell::kAlignedSize - FeedbackCell::kUnalignedSize);
+  memset(reinterpret_cast<uint8_t*>(address() + FeedbackCell::kUnalignedSize),
+         0, FeedbackCell::kAlignedSize - FeedbackCell::kUnalignedSize);
 }
 
 void FeedbackCell::reset_feedback_vector(
-    base::Optional<std::function<void(HeapObject object, ObjectSlot slot,
-                                      HeapObject target)>>
+    base::Optional<std::function<void(
+        Tagged<HeapObject> object, ObjectSlot slot, Tagged<HeapObject> target)>>
         gc_notify_updated_slot) {
-  SetInitialInterruptBudget();
-  if (value().IsUndefined() || value().IsClosureFeedbackCellArray()) return;
+  clear_interrupt_budget();
+  if (IsUndefined(value()) || IsClosureFeedbackCellArray(value())) return;
 
-  CHECK(value().IsFeedbackVector());
-  ClosureFeedbackCellArray closure_feedback_cell_array =
-      FeedbackVector::cast(value()).closure_feedback_cell_array();
+  CHECK(IsFeedbackVector(value()));
+  Tagged<ClosureFeedbackCellArray> closure_feedback_cell_array =
+      FeedbackVector::cast(value())->closure_feedback_cell_array();
   set_value(closure_feedback_cell_array, kReleaseStore);
   if (gc_notify_updated_slot) {
     (*gc_notify_updated_slot)(*this, RawField(FeedbackCell::kValueOffset),
@@ -48,11 +48,11 @@ void FeedbackCell::reset_feedback_vector(
   }
 }
 
-void FeedbackCell::SetInitialInterruptBudget() {
-  set_interrupt_budget(TieringManager::InitialInterruptBudget());
+void FeedbackCell::clear_interrupt_budget() {
+  // This value is always reset to a proper budget before it's used.
+  set_interrupt_budget(0);
 }
 
-
 void FeedbackCell::IncrementClosureCount(Isolate* isolate) {
   ReadOnlyRoots r(isolate);
   if (map() == r.no_closures_cell_map()) {
diff --git a/deps/v8/src/objects/feedback-cell.h b/deps/v8/src/objects/feedback-cell.h
index 8e9c82539f1706..25cebb5bd5907c 100644
--- a/deps/v8/src/objects/feedback-cell.h
+++ b/deps/v8/src/objects/feedback-cell.h
@@ -31,14 +31,16 @@ class FeedbackCell : public TorqueGeneratedFeedbackCell<FeedbackCell, Struct> {
   using TorqueGeneratedFeedbackCell<FeedbackCell, Struct>::value;
   using TorqueGeneratedFeedbackCell<FeedbackCell, Struct>::set_value;
 
-  DECL_RELEASE_ACQUIRE_ACCESSORS(value, HeapObject)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(value, Tagged<HeapObject>)
+
+  inline void clear_interrupt_budget();
 
   inline void clear_padding();
   inline void reset_feedback_vector(
-      base::Optional<std::function<void(HeapObject object, ObjectSlot slot,
-                                        HeapObject target)>>
+      base::Optional<
+          std::function<void(Tagged<HeapObject> object, ObjectSlot slot,
+                             Tagged<HeapObject> target)>>
           gc_notify_updated_slot = base::nullopt);
-  inline void SetInitialInterruptBudget();
 
   // The closure count is encoded in the cell's map, which distinguishes
   // between zero, one, or many closures. This function records a new closure
diff --git a/deps/v8/src/objects/feedback-vector-inl.h b/deps/v8/src/objects/feedback-vector-inl.h
index e5e3ea4772c477..bc5a2e69141623 100644
--- a/deps/v8/src/objects/feedback-vector-inl.h
+++ b/deps/v8/src/objects/feedback-vector-inl.h
@@ -14,6 +14,7 @@
 #include "src/objects/shared-function-info.h"
 #include "src/objects/smi.h"
 #include "src/roots/roots-inl.h"
+#include "src/torque/runtime-macro-shims.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -98,18 +99,19 @@ Handle<FeedbackCell> ClosureFeedbackCellArray::GetFeedbackCell(int index) {
   return handle(FeedbackCell::cast(get(index)), GetIsolate());
 }
 
-FeedbackCell ClosureFeedbackCellArray::cell(int index) {
+Tagged<FeedbackCell> ClosureFeedbackCellArray::cell(int index) {
   return FeedbackCell::cast(get(index));
 }
 
 bool FeedbackVector::is_empty() const { return length() == 0; }
 
-FeedbackMetadata FeedbackVector::metadata() const {
-  return shared_function_info().feedback_metadata();
+DEF_GETTER(FeedbackVector, metadata, Tagged<FeedbackMetadata>) {
+  return shared_function_info(cage_base)->feedback_metadata(cage_base);
 }
 
-FeedbackMetadata FeedbackVector::metadata(AcquireLoadTag tag) const {
-  return shared_function_info().feedback_metadata(tag);
+DEF_ACQUIRE_GETTER(FeedbackVector, metadata, Tagged<FeedbackMetadata>) {
+  return shared_function_info(cage_base)->feedback_metadata(cage_base,
+                                                            kAcquireLoad);
 }
 
 RELAXED_INT32_ACCESSORS(FeedbackVector, invocation_count,
@@ -138,19 +140,34 @@ void FeedbackVector::RequestOsrAtNextOpportunity() {
 void FeedbackVector::reset_osr_state() { set_osr_state(0); }
 
 bool FeedbackVector::maybe_has_optimized_osr_code() const {
-  return MaybeHasOptimizedOsrCodeBit::decode(osr_state());
+  return maybe_has_maglev_osr_code() || maybe_has_turbofan_osr_code();
 }
 
-void FeedbackVector::set_maybe_has_optimized_osr_code(bool value) {
-  set_osr_state(MaybeHasOptimizedOsrCodeBit::update(osr_state(), value));
+bool FeedbackVector::maybe_has_maglev_osr_code() const {
+  return MaybeHasMaglevOsrCodeBit::decode(osr_state());
 }
 
-Code FeedbackVector::optimized_code() const {
+bool FeedbackVector::maybe_has_turbofan_osr_code() const {
+  return MaybeHasTurbofanOsrCodeBit::decode(osr_state());
+}
+
+void FeedbackVector::set_maybe_has_optimized_osr_code(bool value,
+                                                      CodeKind code_kind) {
+  if (code_kind == CodeKind::MAGLEV) {
+    CHECK(v8_flags.maglev_osr);
+    set_osr_state(MaybeHasMaglevOsrCodeBit::update(osr_state(), value));
+  } else {
+    CHECK_EQ(code_kind, CodeKind::TURBOFAN);
+    set_osr_state(MaybeHasTurbofanOsrCodeBit::update(osr_state(), value));
+  }
+}
+
+Tagged<Code> FeedbackVector::optimized_code() const {
   MaybeObject slot = maybe_optimized_code();
   DCHECK(slot->IsWeakOrCleared());
-  HeapObject heap_object;
-  Code code;
-  if (slot->GetHeapObject(&heap_object)) {
+  Tagged<HeapObject> heap_object;
+  Tagged<Code> code;
+  if (slot.GetHeapObject(&heap_object)) {
     code = Code::cast(heap_object);
   }
   // It is possible that the maybe_optimized_code slot is cleared but the flags
@@ -158,9 +175,9 @@ Code FeedbackVector::optimized_code() const {
   // time / when we create new closure.
   DCHECK_IMPLIES(!code.is_null(),
                  maybe_has_maglev_code() || maybe_has_turbofan_code());
-  DCHECK_IMPLIES(!code.is_null() && code.is_maglevved(),
+  DCHECK_IMPLIES(!code.is_null() && code->is_maglevved(),
                  maybe_has_maglev_code());
-  DCHECK_IMPLIES(!code.is_null() && code.is_turbofanned(),
+  DCHECK_IMPLIES(!code.is_null() && code->is_turbofanned(),
                  maybe_has_turbofan_code());
   return code;
 }
@@ -204,8 +221,8 @@ base::Optional<Code> FeedbackVector::GetOptimizedOsrCode(Isolate* isolate,
   MaybeObject maybe_code = Get(isolate, slot);
   if (maybe_code->IsCleared()) return {};
 
-  Code code = Code::cast(maybe_code->GetHeapObject());
-  if (code.marked_for_deoptimization()) {
+  Tagged<Code> code = Code::cast(maybe_code.GetHeapObject());
+  if (code->marked_for_deoptimization()) {
     // Clear the cached Code object if deoptimized.
     // TODO(jgruber): Add tracing.
     Set(slot, HeapObjectReference::ClearedValue(isolate));
@@ -227,9 +244,9 @@ FeedbackSlot FeedbackVector::ToSlot(intptr_t index) {
 // Instead of FixedArray, the Feedback and the Extra should contain
 // WeakFixedArrays. The only allowed FixedArray subtype is HashTable.
 bool FeedbackVector::IsOfLegacyType(MaybeObject value) {
-  HeapObject heap_object;
-  if (value->GetHeapObject(&heap_object)) {
-    return heap_object.IsFixedArray() && !heap_object.IsHashTable();
+  Tagged<HeapObject> heap_object;
+  if (value.GetHeapObject(&heap_object)) {
+    return IsFixedArray(heap_object) && !IsHashTable(heap_object);
   }
   return false;
 }
@@ -251,12 +268,12 @@ MaybeObject FeedbackVector::Get(PtrComprCageBase cage_base,
 
 Handle<FeedbackCell> FeedbackVector::GetClosureFeedbackCell(int index) const {
   DCHECK_GE(index, 0);
-  return closure_feedback_cell_array().GetFeedbackCell(index);
+  return closure_feedback_cell_array()->GetFeedbackCell(index);
 }
 
-FeedbackCell FeedbackVector::closure_feedback_cell(int index) const {
+Tagged<FeedbackCell> FeedbackVector::closure_feedback_cell(int index) const {
   DCHECK_GE(index, 0);
-  return closure_feedback_cell_array().cell(index);
+  return closure_feedback_cell_array()->cell(index);
 }
 
 MaybeObject FeedbackVector::SynchronizedGet(FeedbackSlot slot) const {
@@ -278,7 +295,7 @@ void FeedbackVector::SynchronizedSet(FeedbackSlot slot, MaybeObject value,
   CONDITIONAL_WEAK_WRITE_BARRIER(*this, offset, value, mode);
 }
 
-void FeedbackVector::SynchronizedSet(FeedbackSlot slot, Object value,
+void FeedbackVector::SynchronizedSet(FeedbackSlot slot, Tagged<Object> value,
                                      WriteBarrierMode mode) {
   SynchronizedSet(slot, MaybeObject::FromObject(value), mode);
 }
@@ -289,7 +306,7 @@ void FeedbackVector::Set(FeedbackSlot slot, MaybeObject value,
   set_raw_feedback_slots(GetIndex(slot), value, mode);
 }
 
-void FeedbackVector::Set(FeedbackSlot slot, Object value,
+void FeedbackVector::Set(FeedbackSlot slot, Tagged<Object> value,
                          WriteBarrierMode mode) {
   MaybeObject maybe_value = MaybeObject::FromObject(value);
   DCHECK(!IsOfLegacyType(maybe_value));
@@ -398,18 +415,18 @@ Handle<Symbol> FeedbackVector::MegaDOMSentinel(Isolate* isolate) {
   return ReadOnlyRoots(isolate).mega_dom_symbol_handle();
 }
 
-Symbol FeedbackVector::RawUninitializedSentinel(Isolate* isolate) {
+Tagged<Symbol> FeedbackVector::RawUninitializedSentinel(Isolate* isolate) {
   return ReadOnlyRoots(isolate).uninitialized_symbol();
 }
 
 bool FeedbackMetadataIterator::HasNext() const {
-  return next_slot_.ToInt() < metadata().slot_count();
+  return next_slot_.ToInt() < metadata()->slot_count();
 }
 
 FeedbackSlot FeedbackMetadataIterator::Next() {
   DCHECK(HasNext());
   cur_slot_ = next_slot_;
-  slot_kind_ = metadata().GetKind(cur_slot_);
+  slot_kind_ = metadata()->GetKind(cur_slot_);
   next_slot_ = FeedbackSlot(next_slot_.ToInt() + entry_size());
   return cur_slot_;
 }
@@ -418,16 +435,16 @@ int FeedbackMetadataIterator::entry_size() const {
   return FeedbackMetadata::GetSlotSize(kind());
 }
 
-MaybeObject NexusConfig::GetFeedback(FeedbackVector vector,
+MaybeObject NexusConfig::GetFeedback(Tagged<FeedbackVector> vector,
                                      FeedbackSlot slot) const {
-  return vector.SynchronizedGet(slot);
+  return vector->SynchronizedGet(slot);
 }
 
-void NexusConfig::SetFeedback(FeedbackVector vector, FeedbackSlot slot,
+void NexusConfig::SetFeedback(Tagged<FeedbackVector> vector, FeedbackSlot slot,
                               MaybeObject feedback,
                               WriteBarrierMode mode) const {
   DCHECK(can_write());
-  vector.SynchronizedSet(slot, feedback, mode);
+  vector->SynchronizedSet(slot, feedback, mode);
 }
 
 MaybeObject FeedbackNexus::UninitializedSentinel() const {
@@ -485,6 +502,14 @@ std::pair<MaybeObject, MaybeObject> FeedbackNexus::GetFeedbackPair() const {
 
 template <typename T>
 struct IsValidFeedbackType
+    : public std::integral_constant<bool,
+                                    std::is_base_of<MaybeObject, T>::value ||
+                                        std::is_base_of<Object, T>::value> {
+  static_assert(kTaggedCanConvertToRawObjects);
+};
+
+template <typename T>
+struct IsValidFeedbackType<Tagged<T>>
     : public std::integral_constant<bool,
                                     std::is_base_of<MaybeObject, T>::value ||
                                         std::is_base_of<Object, T>::value> {};
@@ -510,7 +535,7 @@ void FeedbackNexus::SetFeedback(FeedbackType feedback, WriteBarrierMode mode,
   config()->SetFeedbackPair(vector(), slot(), fmo, mode, fmo_extra, mode_extra);
 }
 
-Isolate* FeedbackNexus::GetIsolate() const { return vector().GetIsolate(); }
+Isolate* FeedbackNexus::GetIsolate() const { return vector()->GetIsolate(); }
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/feedback-vector.cc b/deps/v8/src/objects/feedback-vector.cc
index f7918964068465..2d200bcc6a5e5b 100644
--- a/deps/v8/src/objects/feedback-vector.cc
+++ b/deps/v8/src/objects/feedback-vector.cc
@@ -4,6 +4,7 @@
 
 #include "src/objects/feedback-vector.h"
 
+#include "src/base/optional.h"
 #include "src/common/globals.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/diagnostics/code-tracer.h"
@@ -32,15 +33,15 @@ FeedbackSlot FeedbackVectorSpec::AddSlot(FeedbackSlotKind kind) {
 }
 
 static bool IsPropertyNameFeedback(MaybeObject feedback) {
-  HeapObject heap_object;
-  if (!feedback->GetHeapObjectIfStrong(&heap_object)) return false;
-  if (heap_object.IsString()) {
-    DCHECK(heap_object.IsInternalizedString());
+  Tagged<HeapObject> heap_object;
+  if (!feedback.GetHeapObjectIfStrong(&heap_object)) return false;
+  if (IsString(heap_object)) {
+    DCHECK(IsInternalizedString(heap_object));
     return true;
   }
-  if (!heap_object.IsSymbol()) return false;
-  Symbol symbol = Symbol::cast(heap_object);
-  ReadOnlyRoots roots = symbol.GetReadOnlyRoots();
+  if (!IsSymbol(heap_object)) return false;
+  Tagged<Symbol> symbol = Symbol::cast(heap_object);
+  ReadOnlyRoots roots = symbol->GetReadOnlyRoots();
   return symbol != roots.uninitialized_symbol() &&
          symbol != roots.mega_dom_symbol() &&
          symbol != roots.megamorphic_symbol();
@@ -183,13 +184,13 @@ const char* FeedbackMetadata::Kind2String(FeedbackSlotKind kind) {
 
 FeedbackSlotKind FeedbackVector::GetKind(FeedbackSlot slot) const {
   DCHECK(!is_empty());
-  return metadata().GetKind(slot);
+  return metadata()->GetKind(slot);
 }
 
 FeedbackSlotKind FeedbackVector::GetKind(FeedbackSlot slot,
                                          AcquireLoadTag tag) const {
   DCHECK(!is_empty());
-  return metadata(tag).GetKind(slot);
+  return metadata(tag)->GetKind(slot);
 }
 
 // static
@@ -198,7 +199,7 @@ Handle<ClosureFeedbackCellArray> ClosureFeedbackCellArray::New(
   Factory* factory = isolate->factory();
 
   int num_feedback_cells =
-      shared->feedback_metadata().create_closure_slot_count();
+      shared->feedback_metadata()->create_closure_slot_count();
 
   Handle<ClosureFeedbackCellArray> feedback_cell_array =
       factory->NewClosureFeedbackCellArray(num_feedback_cells);
@@ -234,7 +235,6 @@ Handle<FeedbackVector> FeedbackVector::New(
   DCHECK(!vector->maybe_has_maglev_code());
   DCHECK(!vector->maybe_has_turbofan_code());
   DCHECK_EQ(vector->invocation_count(), 0);
-  DCHECK_EQ(vector->profiler_ticks(), 0);
   DCHECK(vector->maybe_optimized_code()->IsCleared());
 
   // Ensure we can skip the write barrier
@@ -340,41 +340,44 @@ Handle<FeedbackVector> FeedbackVector::NewWithOneCompareSlotForTesting(
 void FeedbackVector::AddToVectorsForProfilingTools(
     Isolate* isolate, Handle<FeedbackVector> vector) {
   DCHECK(!isolate->is_best_effort_code_coverage());
-  if (!vector->shared_function_info().IsSubjectToDebugging()) return;
+  if (!vector->shared_function_info()->IsSubjectToDebugging()) return;
   Handle<ArrayList> list = Handle<ArrayList>::cast(
       isolate->factory()->feedback_vectors_for_profiling_tools());
   list = ArrayList::Add(isolate, list, vector);
   isolate->SetFeedbackVectorsForProfilingTools(*list);
 }
 
-void FeedbackVector::SaturatingIncrementProfilerTicks() {
-  int ticks = profiler_ticks();
-  if (ticks < Smi::kMaxValue) set_profiler_ticks(ticks + 1);
-}
-
-void FeedbackVector::SetOptimizedCode(Code code) {
-  DCHECK(CodeKindIsOptimizedJSFunction(code.kind()));
-  // We should set optimized code only when there is no valid optimized code.
-  DCHECK(!has_optimized_code() ||
-         optimized_code().marked_for_deoptimization() ||
-         (CodeKindCanTierUp(optimized_code().kind()) &&
-          optimized_code().kind() < code.kind()) ||
-         v8_flags.stress_concurrent_inlining_attach_code);
+void FeedbackVector::SetOptimizedCode(Tagged<Code> code) {
+  DCHECK(CodeKindIsOptimizedJSFunction(code->kind()));
+  int32_t state = flags();
+  // Skip setting optimized code if it would cause us to tier down.
+  if (!has_optimized_code()) {
+    state = MaybeHasTurbofanCodeBit::update(state, false);
+  } else if (!CodeKindCanTierUp(optimized_code()->kind()) ||
+             optimized_code()->kind() > code->kind()) {
+    if (!v8_flags.stress_concurrent_inlining_attach_code &&
+        !optimized_code()->marked_for_deoptimization()) {
+      return;
+    }
+    // If we fall through, we may be tiering down. This is fine since we only do
+    // that when the current code is marked for deoptimization, or because we're
+    // stress testing.
+    state = MaybeHasTurbofanCodeBit::update(state, false);
+  }
   // TODO(mythria): We could see a CompileOptimized state here either from
   // tests that use %OptimizeFunctionOnNextCall, --always-turbofan or because we
   // re-mark the function for non-concurrent optimization after an OSR. We
   // should avoid these cases and also check that marker isn't
   // TieringState::kRequestTurbofan*.
   set_maybe_optimized_code(HeapObjectReference::Weak(code));
-  int32_t state = flags();
   // TODO(leszeks): Reconsider whether this could clear the tiering state vs.
   // the callers doing so.
   state = TieringStateBits::update(state, TieringState::kNone);
-  if (code.is_maglevved()) {
+  if (code->is_maglevved()) {
     DCHECK(!MaybeHasTurbofanCodeBit::decode(state));
     state = MaybeHasMaglevCodeBit::update(state, true);
   } else {
-    DCHECK(code.is_turbofanned());
+    DCHECK(code->is_turbofanned());
     state = MaybeHasTurbofanCodeBit::update(state, true);
     state = MaybeHasMaglevCodeBit::update(state, false);
   }
@@ -389,11 +392,16 @@ void FeedbackVector::ClearOptimizedCode() {
   set_maybe_has_turbofan_code(false);
 }
 
-void FeedbackVector::SetOptimizedOsrCode(FeedbackSlot slot, Code code) {
-  DCHECK(CodeKindIsOptimizedJSFunction(code.kind()));
+void FeedbackVector::SetOptimizedOsrCode(Isolate* isolate, FeedbackSlot slot,
+                                         Tagged<Code> code) {
+  DCHECK(CodeKindIsOptimizedJSFunction(code->kind()));
   DCHECK(!slot.IsInvalid());
+  auto current = GetOptimizedOsrCode(isolate, slot);
+  if (V8_UNLIKELY(current && current->kind() > code->kind())) {
+    return;
+  }
   Set(slot, HeapObjectReference::Weak(code));
-  set_maybe_has_optimized_osr_code(true);
+  set_maybe_has_optimized_osr_code(true, code->kind());
 }
 
 void FeedbackVector::reset_tiering_state() {
@@ -412,7 +420,8 @@ void FeedbackVector::reset_flags() {
             MaybeHasMaglevCodeBit::encode(false) |
             MaybeHasTurbofanCodeBit::encode(false) |
             OsrTieringStateBit::encode(TieringState::kNone) |
-            MaybeHasOptimizedOsrCodeBit::encode(false));
+            MaybeHasMaglevOsrCodeBit::encode(false) |
+            MaybeHasTurbofanOsrCodeBit::encode(false));
 }
 
 TieringState FeedbackVector::osr_tiering_state() {
@@ -429,7 +438,7 @@ void FeedbackVector::set_osr_tiering_state(TieringState marker) {
 }
 
 void FeedbackVector::EvictOptimizedCodeMarkedForDeoptimization(
-    Isolate* isolate, SharedFunctionInfo shared, const char* reason) {
+    Isolate* isolate, Tagged<SharedFunctionInfo> shared, const char* reason) {
   MaybeObject slot = maybe_optimized_code();
   if (slot->IsCleared()) {
     set_maybe_has_maglev_code(false);
@@ -437,15 +446,15 @@ void FeedbackVector::EvictOptimizedCodeMarkedForDeoptimization(
     return;
   }
 
-  Code code = Code::cast(slot->GetHeapObject());
-  if (code.marked_for_deoptimization()) {
+  Tagged<Code> code = Code::cast(slot.GetHeapObject());
+  if (code->marked_for_deoptimization()) {
     Deoptimizer::TraceEvictFromOptimizedCodeCache(isolate, shared, reason);
     ClearOptimizedCode();
   }
 }
 
 bool FeedbackVector::ClearSlots(Isolate* isolate, ClearBehavior behavior) {
-  if (!shared_function_info().HasFeedbackMetadata()) return false;
+  if (!shared_function_info()->HasFeedbackMetadata()) return false;
   MaybeObject uninitialized_sentinel = MaybeObject::FromObject(
       FeedbackVector::RawUninitializedSentinel(isolate));
 
@@ -472,7 +481,7 @@ MaybeObjectHandle NexusConfig::NewHandle(MaybeObject object) const {
 }
 
 template <typename T>
-Handle<T> NexusConfig::NewHandle(T object) const {
+Handle<T> NexusConfig::NewHandle(Tagged<T> object) const {
   if (mode() == Mode::MainThread) {
     return handle(object, isolate_);
   }
@@ -480,25 +489,25 @@ Handle<T> NexusConfig::NewHandle(T object) const {
   return handle(object, local_heap_);
 }
 
-void NexusConfig::SetFeedbackPair(FeedbackVector vector,
+void NexusConfig::SetFeedbackPair(Tagged<FeedbackVector> vector,
                                   FeedbackSlot start_slot, MaybeObject feedback,
                                   WriteBarrierMode mode,
                                   MaybeObject feedback_extra,
                                   WriteBarrierMode mode_extra) const {
   CHECK(can_write());
-  CHECK_GT(vector.length(), start_slot.WithOffset(1).ToInt());
+  CHECK_GT(vector->length(), start_slot.WithOffset(1).ToInt());
   base::SharedMutexGuard<base::kExclusive> shared_mutex_guard(
       isolate()->feedback_vector_access());
-  vector.Set(start_slot, feedback, mode);
-  vector.Set(start_slot.WithOffset(1), feedback_extra, mode_extra);
+  vector->Set(start_slot, feedback, mode);
+  vector->Set(start_slot.WithOffset(1), feedback_extra, mode_extra);
 }
 
 std::pair<MaybeObject, MaybeObject> NexusConfig::GetFeedbackPair(
-    FeedbackVector vector, FeedbackSlot slot) const {
+    Tagged<FeedbackVector> vector, FeedbackSlot slot) const {
   base::SharedMutexGuardIf<base::kShared> scope(
       isolate()->feedback_vector_access(), mode() == BackgroundThread);
-  MaybeObject feedback = vector.Get(slot);
-  MaybeObject feedback_extra = vector.Get(slot.WithOffset(1));
+  MaybeObject feedback = vector->Get(slot);
+  MaybeObject feedback_extra = vector->Get(slot.WithOffset(1));
   return std::make_pair(feedback, feedback_extra);
 }
 
@@ -510,12 +519,12 @@ FeedbackNexus::FeedbackNexus(Handle<FeedbackVector> vector, FeedbackSlot slot)
   kind_ = vector.is_null() ? FeedbackSlotKind::kInvalid : vector->GetKind(slot);
 }
 
-FeedbackNexus::FeedbackNexus(FeedbackVector vector, FeedbackSlot slot)
+FeedbackNexus::FeedbackNexus(Tagged<FeedbackVector> vector, FeedbackSlot slot)
     : vector_(vector),
       slot_(slot),
       config_(NexusConfig::FromMainThread(
-          vector.is_null() ? nullptr : vector.GetIsolate())) {
-  kind_ = vector.is_null() ? FeedbackSlotKind::kInvalid : vector.GetKind(slot);
+          vector.is_null() ? nullptr : vector->GetIsolate())) {
+  kind_ = vector.is_null() ? FeedbackSlotKind::kInvalid : vector->GetKind(slot);
 }
 
 FeedbackNexus::FeedbackNexus(Handle<FeedbackVector> vector, FeedbackSlot slot,
@@ -663,7 +672,7 @@ bool FeedbackNexus::ConfigureMegamorphic(IcCheckType property_type) {
   return update_required;
 }
 
-Map FeedbackNexus::GetFirstMap() const {
+Tagged<Map> FeedbackNexus::GetFirstMap() const {
   FeedbackIterator it(this);
   if (!it.done()) {
     return it.map();
@@ -678,7 +687,7 @@ InlineCacheState FeedbackNexus::ic_state() const {
 
   switch (kind()) {
     case FeedbackSlotKind::kLiteral:
-      if (feedback->IsSmi()) return InlineCacheState::UNINITIALIZED;
+      if (IsSmi(feedback)) return InlineCacheState::UNINITIALIZED;
       return InlineCacheState::MONOMORPHIC;
 
     case FeedbackSlotKind::kStoreGlobalSloppy:
@@ -686,7 +695,7 @@ InlineCacheState FeedbackNexus::ic_state() const {
     case FeedbackSlotKind::kLoadGlobalNotInsideTypeof:
     case FeedbackSlotKind::kLoadGlobalInsideTypeof:
     case FeedbackSlotKind::kJumpLoop: {
-      if (feedback->IsSmi()) return InlineCacheState::MONOMORPHIC;
+      if (IsSmi(feedback)) return InlineCacheState::MONOMORPHIC;
 
       DCHECK(feedback->IsWeakOrCleared());
       if (!feedback->IsCleared() || extra != UninitializedSentinel()) {
@@ -719,20 +728,21 @@ InlineCacheState FeedbackNexus::ic_state() const {
         // Don't check if the map is cleared.
         return InlineCacheState::MONOMORPHIC;
       }
-      HeapObject heap_object;
-      if (feedback->GetHeapObjectIfStrong(&heap_object)) {
-        if (heap_object.IsWeakFixedArray()) {
+      Tagged<HeapObject> heap_object;
+      if (feedback.GetHeapObjectIfStrong(&heap_object)) {
+        if (IsWeakFixedArray(heap_object)) {
           // Determine state purely by our structure, don't check if the maps
           // are cleared.
           return InlineCacheState::POLYMORPHIC;
         }
-        if (heap_object.IsName()) {
+        if (IsName(heap_object)) {
           DCHECK(IsKeyedLoadICKind(kind()) || IsKeyedStoreICKind(kind()) ||
                  IsKeyedHasICKind(kind()) || IsDefineKeyedOwnICKind(kind()));
-          Object extra_object = extra->GetHeapObjectAssumeStrong();
-          WeakFixedArray extra_array = WeakFixedArray::cast(extra_object);
-          return extra_array.length() > 2 ? InlineCacheState::POLYMORPHIC
-                                          : InlineCacheState::MONOMORPHIC;
+          Tagged<Object> extra_object = extra.GetHeapObjectAssumeStrong();
+          Tagged<WeakFixedArray> extra_array =
+              WeakFixedArray::cast(extra_object);
+          return extra_array->length() > 2 ? InlineCacheState::POLYMORPHIC
+                                           : InlineCacheState::MONOMORPHIC;
         }
       }
       // TODO(1393773): Remove once the issue is solved.
@@ -749,19 +759,19 @@ InlineCacheState FeedbackNexus::ic_state() const {
       UNREACHABLE();
     }
     case FeedbackSlotKind::kCall: {
-      HeapObject heap_object;
+      Tagged<HeapObject> heap_object;
       if (feedback == MegamorphicSentinel()) {
         return InlineCacheState::GENERIC;
       } else if (feedback->IsWeakOrCleared()) {
-        if (feedback->GetHeapObjectIfWeak(&heap_object)) {
-          if (heap_object.IsFeedbackCell()) {
+        if (feedback.GetHeapObjectIfWeak(&heap_object)) {
+          if (IsFeedbackCell(heap_object)) {
             return InlineCacheState::POLYMORPHIC;
           }
-          CHECK(heap_object.IsJSFunction() || heap_object.IsJSBoundFunction());
+          CHECK(IsJSFunction(heap_object) || IsJSBoundFunction(heap_object));
         }
         return InlineCacheState::MONOMORPHIC;
-      } else if (feedback->GetHeapObjectIfStrong(&heap_object) &&
-                 heap_object.IsAllocationSite()) {
+      } else if (feedback.GetHeapObjectIfStrong(&heap_object) &&
+                 IsAllocationSite(heap_object)) {
         return InlineCacheState::MONOMORPHIC;
       }
 
@@ -827,7 +837,7 @@ InlineCacheState FeedbackNexus::ic_state() const {
         return InlineCacheState::MONOMORPHIC;
       }
 
-      DCHECK(feedback->GetHeapObjectAssumeStrong().IsWeakFixedArray());
+      DCHECK(IsWeakFixedArray(feedback.GetHeapObjectAssumeStrong()));
       return InlineCacheState::POLYMORPHIC;
     }
 
@@ -870,15 +880,24 @@ void FeedbackNexus::ConfigureHandlerMode(const MaybeObjectHandle& handler) {
               UPDATE_WRITE_BARRIER, *handler, UPDATE_WRITE_BARRIER);
 }
 
-void FeedbackNexus::ConfigureCloneObject(Handle<Map> source_map,
-                                         Handle<Map> result_map) {
+void FeedbackNexus::ConfigureCloneObject(
+    Handle<Map> source_map, const MaybeObjectHandle& handler_handle) {
+  // TODO(olivf): Introduce a CloneHandler to deal with all the logic of this
+  // state machine which is now spread between Runtime_CloneObjectIC_Miss and
+  // this method.
+  auto GetHandler = [=]() {
+    if (handler_handle->IsSmi()) {
+      return *handler_handle;
+    }
+    return HeapObjectReference::MakeWeak(*handler_handle);
+  };
   DCHECK(config()->can_write());
   Isolate* isolate = GetIsolate();
   Handle<HeapObject> feedback;
   {
     MaybeObject maybe_feedback = GetFeedback();
     if (maybe_feedback->IsStrongOrWeak()) {
-      feedback = handle(maybe_feedback->GetHeapObject(), isolate);
+      feedback = handle(maybe_feedback.GetHeapObject(), isolate);
     } else {
       DCHECK(maybe_feedback->IsCleared());
     }
@@ -887,23 +906,23 @@ void FeedbackNexus::ConfigureCloneObject(Handle<Map> source_map,
     case InlineCacheState::UNINITIALIZED:
       // Cache the first map seen which meets the fast case requirements.
       SetFeedback(HeapObjectReference::Weak(*source_map), UPDATE_WRITE_BARRIER,
-                  *result_map);
+                  GetHandler());
       break;
     case InlineCacheState::MONOMORPHIC:
       if (feedback.is_null() || feedback.is_identical_to(source_map) ||
-          Map::cast(*feedback).is_deprecated()) {
+          Map::cast(*feedback)->is_deprecated()) {
         SetFeedback(HeapObjectReference::Weak(*source_map),
-                    UPDATE_WRITE_BARRIER, *result_map);
+                    UPDATE_WRITE_BARRIER, GetHandler());
       } else {
         // Transition to POLYMORPHIC.
         Handle<WeakFixedArray> array =
             CreateArrayOfSize(2 * kCloneObjectPolymorphicEntrySize);
         DisallowGarbageCollection no_gc;
-        auto raw_array = *array;
-        raw_array.Set(0, HeapObjectReference::Weak(*feedback));
-        raw_array.Set(1, GetFeedbackExtra());
-        raw_array.Set(2, HeapObjectReference::Weak(*source_map));
-        raw_array.Set(3, MaybeObject::FromObject(*result_map));
+        Tagged<WeakFixedArray> raw_array = *array;
+        raw_array->Set(0, HeapObjectReference::Weak(*feedback));
+        raw_array->Set(1, GetFeedbackExtra());
+        raw_array->Set(2, HeapObjectReference::Weak(*source_map));
+        raw_array->Set(3, GetHandler());
         SetFeedback(raw_array, UPDATE_WRITE_BARRIER,
                     HeapObjectReference::ClearedValue(isolate));
       }
@@ -916,7 +935,7 @@ void FeedbackNexus::ConfigureCloneObject(Handle<Map> source_map,
       for (; i < array->length(); i += kCloneObjectPolymorphicEntrySize) {
         MaybeObject feedback_map = array->Get(i);
         if (feedback_map->IsCleared()) break;
-        Handle<Map> cached_map(Map::cast(feedback_map->GetHeapObject()),
+        Handle<Map> cached_map(Map::cast(feedback_map.GetHeapObject()),
                                isolate);
         if (cached_map.is_identical_to(source_map) ||
             cached_map->is_deprecated())
@@ -943,7 +962,7 @@ void FeedbackNexus::ConfigureCloneObject(Handle<Map> source_map,
       }
 
       array->Set(i, HeapObjectReference::Weak(*source_map));
-      array->Set(i + 1, MaybeObject::FromObject(*result_map));
+      array->Set(i + 1, GetHandler());
       break;
     }
 
@@ -955,8 +974,8 @@ void FeedbackNexus::ConfigureCloneObject(Handle<Map> source_map,
 int FeedbackNexus::GetCallCount() {
   DCHECK(IsCallICKind(kind()));
 
-  Object call_count = GetFeedbackExtra()->cast<Object>();
-  CHECK(call_count.IsSmi());
+  Tagged<Object> call_count = GetFeedbackExtra()->cast<Object>();
+  CHECK(IsSmi(call_count));
   uint32_t value = static_cast<uint32_t>(Smi::ToInt(call_count));
   return CallCountField::decode(value);
 }
@@ -964,8 +983,8 @@ int FeedbackNexus::GetCallCount() {
 void FeedbackNexus::SetSpeculationMode(SpeculationMode mode) {
   DCHECK(IsCallICKind(kind()));
 
-  Object call_count = GetFeedbackExtra()->cast<Object>();
-  CHECK(call_count.IsSmi());
+  Tagged<Object> call_count = GetFeedbackExtra()->cast<Object>();
+  CHECK(IsSmi(call_count));
   uint32_t count = static_cast<uint32_t>(Smi::ToInt(call_count));
   count = SpeculationModeField::update(count, mode);
   MaybeObject feedback = GetFeedback();
@@ -978,8 +997,8 @@ void FeedbackNexus::SetSpeculationMode(SpeculationMode mode) {
 SpeculationMode FeedbackNexus::GetSpeculationMode() {
   DCHECK(IsCallICKind(kind()));
 
-  Object call_count = GetFeedbackExtra()->cast<Object>();
-  CHECK(call_count.IsSmi());
+  Tagged<Object> call_count = GetFeedbackExtra()->cast<Object>();
+  CHECK(IsSmi(call_count));
   uint32_t value = static_cast<uint32_t>(Smi::ToInt(call_count));
   return SpeculationModeField::decode(value);
 }
@@ -987,8 +1006,8 @@ SpeculationMode FeedbackNexus::GetSpeculationMode() {
 CallFeedbackContent FeedbackNexus::GetCallFeedbackContent() {
   DCHECK(IsCallICKind(kind()));
 
-  Object call_count = GetFeedbackExtra()->cast<Object>();
-  CHECK(call_count.IsSmi());
+  Tagged<Object> call_count = GetFeedbackExtra()->cast<Object>();
+  CHECK(IsSmi(call_count));
   uint32_t value = static_cast<uint32_t>(Smi::ToInt(call_count));
   return CallFeedbackContentField::decode(value);
 }
@@ -996,7 +1015,7 @@ CallFeedbackContent FeedbackNexus::GetCallFeedbackContent() {
 float FeedbackNexus::ComputeCallFrequency() {
   DCHECK(IsCallICKind(kind()));
 
-  double const invocation_count = vector().invocation_count(kRelaxedLoad);
+  double const invocation_count = vector()->invocation_count(kRelaxedLoad);
   double const call_count = GetCallCount();
   if (invocation_count == 0.0) {  // Prevent division by 0.
     return 0.0f;
@@ -1126,18 +1145,18 @@ MaybeObjectHandle FeedbackNexus::FindHandlerForMap(Handle<Map> map) const {
   return MaybeObjectHandle();
 }
 
-Name FeedbackNexus::GetName() const {
+Tagged<Name> FeedbackNexus::GetName() const {
   if (IsKeyedStoreICKind(kind()) || IsKeyedLoadICKind(kind()) ||
       IsKeyedHasICKind(kind()) || IsDefineKeyedOwnICKind(kind())) {
     MaybeObject feedback = GetFeedback();
     if (IsPropertyNameFeedback(feedback)) {
-      return Name::cast(feedback->GetHeapObjectAssumeStrong());
+      return Name::cast(feedback.GetHeapObjectAssumeStrong());
     }
   }
   if (IsDefineKeyedOwnPropertyInLiteralKind(kind())) {
     MaybeObject extra = GetFeedbackExtra();
     if (IsPropertyNameFeedback(extra)) {
-      return Name::cast(extra->GetHeapObjectAssumeStrong());
+      return Name::cast(extra.GetHeapObjectAssumeStrong());
     }
   }
   return Name();
@@ -1223,22 +1242,22 @@ KeyedAccessStoreMode FeedbackNexus::GetKeyedAccessStoreMode() const {
     const MaybeObjectHandle maybe_code_handler = map_and_handler.second;
     // The first handler that isn't the slow handler will have the bits we need.
     Builtin builtin_handler = Builtin::kNoBuiltinId;
-    if (maybe_code_handler.object()->IsStoreHandler()) {
+    if (IsStoreHandler(*maybe_code_handler.object())) {
       Handle<StoreHandler> data_handler =
           Handle<StoreHandler>::cast(maybe_code_handler.object());
 
-      if ((data_handler->smi_handler()).IsSmi()) {
+      if (IsSmi(data_handler->smi_handler())) {
         // Decode the KeyedAccessStoreMode information from the Handler.
         mode = StoreHandler::GetKeyedAccessStoreMode(
             MaybeObject::FromObject(data_handler->smi_handler()));
         if (mode != STANDARD_STORE) return mode;
         continue;
       } else {
-        Code code = Code::cast(data_handler->smi_handler());
-        builtin_handler = code.builtin_id();
+        Tagged<Code> code = Code::cast(data_handler->smi_handler());
+        builtin_handler = code->builtin_id();
       }
 
-    } else if (maybe_code_handler.object()->IsSmi()) {
+    } else if (IsSmi(*maybe_code_handler.object())) {
       // Skip for Proxy Handlers.
       if (*maybe_code_handler.object() == StoreHandler::StoreProxy()) {
         continue;
@@ -1253,8 +1272,8 @@ KeyedAccessStoreMode FeedbackNexus::GetKeyedAccessStoreMode() const {
       continue;
     } else {
       // Element store without prototype chain check.
-      Code code = Code::cast(*maybe_code_handler.object());
-      builtin_handler = code.builtin_id();
+      Tagged<Code> code = Code::cast(*maybe_code_handler.object());
+      builtin_handler = code->builtin_id();
     }
 
     if (Builtins::IsBuiltinId(builtin_handler)) {
@@ -1308,8 +1327,8 @@ ForInHint FeedbackNexus::GetForInFeedback() const {
 MaybeHandle<JSObject> FeedbackNexus::GetConstructorFeedback() const {
   DCHECK_EQ(kind(), FeedbackSlotKind::kInstanceOf);
   MaybeObject feedback = GetFeedback();
-  HeapObject heap_object;
-  if (feedback->GetHeapObjectIfWeak(&heap_object)) {
+  Tagged<HeapObject> heap_object;
+  if (feedback.GetHeapObjectIfWeak(&heap_object)) {
     return config()->NewHandle(JSObject::cast(heap_object));
   }
   return MaybeHandle<JSObject>();
@@ -1329,23 +1348,23 @@ FeedbackIterator::FeedbackIterator(const FeedbackNexus* nexus)
   auto pair = nexus->GetFeedbackPair();
   MaybeObject feedback = pair.first;
   bool is_named_feedback = IsPropertyNameFeedback(feedback);
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
 
-  if ((feedback->GetHeapObjectIfStrong(&heap_object) &&
-       heap_object.IsWeakFixedArray()) ||
+  if ((feedback.GetHeapObjectIfStrong(&heap_object) &&
+       IsWeakFixedArray(heap_object)) ||
       is_named_feedback) {
     index_ = 0;
     state_ = kPolymorphic;
-    heap_object = feedback->GetHeapObjectAssumeStrong();
+    heap_object = feedback.GetHeapObjectAssumeStrong();
     if (is_named_feedback) {
       polymorphic_feedback_ = nexus->config()->NewHandle(
-          WeakFixedArray::cast(pair.second->GetHeapObjectAssumeStrong()));
+          WeakFixedArray::cast(pair.second.GetHeapObjectAssumeStrong()));
     } else {
       polymorphic_feedback_ =
           nexus->config()->NewHandle(WeakFixedArray::cast(heap_object));
     }
     AdvancePolymorphic();
-  } else if (feedback->GetHeapObjectIfWeak(&heap_object)) {
+  } else if (feedback.GetHeapObjectIfWeak(&heap_object)) {
     state_ = kMonomorphic;
     MaybeObject handler = pair.second;
     map_ = Map::cast(heap_object);
@@ -1371,10 +1390,10 @@ void FeedbackIterator::AdvancePolymorphic() {
   CHECK(!done_);
   CHECK_EQ(state_, kPolymorphic);
   int length = polymorphic_feedback_->length();
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
 
   while (index_ < length) {
-    if (polymorphic_feedback_->Get(index_)->GetHeapObjectIfWeak(&heap_object)) {
+    if (polymorphic_feedback_->Get(index_).GetHeapObjectIfWeak(&heap_object)) {
       MaybeObject handler = polymorphic_feedback_->Get(index_ + kHandlerOffset);
       map_ = Map::cast(heap_object);
       handler_ = handler;
diff --git a/deps/v8/src/objects/feedback-vector.h b/deps/v8/src/objects/feedback-vector.h
index 80e39a6d22919c..4e446d809ed135 100644
--- a/deps/v8/src/objects/feedback-vector.h
+++ b/deps/v8/src/objects/feedback-vector.h
@@ -186,7 +186,7 @@ class ClosureFeedbackCellArray : public FixedArray {
       Isolate* isolate, Handle<SharedFunctionInfo> shared);
 
   inline Handle<FeedbackCell> GetFeedbackCell(int index);
-  inline FeedbackCell cell(int index);
+  inline Tagged<FeedbackCell> cell(int index);
 
   DECL_VERIFIER(ClosureFeedbackCellArray)
   DECL_PRINTER(ClosureFeedbackCellArray)
@@ -221,11 +221,8 @@ class FeedbackVector
 
   inline bool is_empty() const;
 
-  inline FeedbackMetadata metadata() const;
-  inline FeedbackMetadata metadata(AcquireLoadTag tag) const;
-
-  // Increment profiler ticks, saturating at the maximal value.
-  void SaturatingIncrementProfilerTicks();
+  DECL_GETTER(metadata, Tagged<FeedbackMetadata>)
+  DECL_ACQUIRE_GETTER(metadata, Tagged<FeedbackMetadata>)
 
   // Forward declare the non-atomic accessors.
   using TorqueGeneratedFeedbackVector::invocation_count;
@@ -244,17 +241,18 @@ class FeedbackVector
   inline void RequestOsrAtNextOpportunity();
 
   // Whether this vector may contain cached optimized osr code for *any* slot.
-  // Represented internally as a bit that can be efficiently checked by
-  // generated code. May diverge from the state of the world; the invariant is
-  // that if `maybe_has_optimized_osr_code` is false, no optimized osr code
+  // May diverge from the state of the world; the invariant is that if
+  // `maybe_has_(maglev|turbofan)_osr_code` is false, no optimized osr code
   // exists.
+  inline bool maybe_has_maglev_osr_code() const;
+  inline bool maybe_has_turbofan_osr_code() const;
   inline bool maybe_has_optimized_osr_code() const;
-  inline void set_maybe_has_optimized_osr_code(bool value);
+  inline void set_maybe_has_optimized_osr_code(bool value, CodeKind code_kind);
 
   // The `osr_state` contains the osr_urgency and maybe_has_optimized_osr_code.
   inline void reset_osr_state();
 
-  inline Code optimized_code() const;
+  inline Tagged<Code> optimized_code() const;
   // Whether maybe_optimized_code contains a cached Code object.
   inline bool has_optimized_code() const;
 
@@ -268,17 +266,17 @@ class FeedbackVector
   inline bool maybe_has_turbofan_code() const;
   inline void set_maybe_has_turbofan_code(bool value);
 
-  void SetOptimizedCode(Code code);
-  void EvictOptimizedCodeMarkedForDeoptimization(Isolate* isolate,
-                                                 SharedFunctionInfo shared,
-                                                 const char* reason);
+  void SetOptimizedCode(Tagged<Code> code);
+  void EvictOptimizedCodeMarkedForDeoptimization(
+      Isolate* isolate, Tagged<SharedFunctionInfo> shared, const char* reason);
   void ClearOptimizedCode();
 
   // Optimized OSR'd code is cached in JumpLoop feedback vector slots. The
   // slots either contain a Code object or the ClearedValue.
   inline base::Optional<Code> GetOptimizedOsrCode(Isolate* isolate,
                                                   FeedbackSlot slot);
-  void SetOptimizedOsrCode(FeedbackSlot slot, Code code);
+  void SetOptimizedOsrCode(Isolate* isolate, FeedbackSlot slot,
+                           Tagged<Code> code);
 
   inline TieringState tiering_state() const;
   void set_tiering_state(TieringState state);
@@ -298,7 +296,7 @@ class FeedbackVector
   inline MaybeObject SynchronizedGet(FeedbackSlot slot) const;
   inline void SynchronizedSet(FeedbackSlot slot, MaybeObject value,
                               WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void SynchronizedSet(FeedbackSlot slot, Object value,
+  inline void SynchronizedSet(FeedbackSlot slot, Tagged<Object> value,
                               WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   inline MaybeObject Get(FeedbackSlot slot) const;
@@ -307,7 +305,7 @@ class FeedbackVector
   // Returns the feedback cell at |index| that is used to create the
   // closure.
   inline Handle<FeedbackCell> GetClosureFeedbackCell(int index) const;
-  inline FeedbackCell closure_feedback_cell(int index) const;
+  inline Tagged<FeedbackCell> closure_feedback_cell(int index) const;
 
   // Gives access to raw memory which stores the array's data.
   inline MaybeObjectSlot slots_start();
@@ -379,7 +377,7 @@ class FeedbackVector
 
   // A raw version of the uninitialized sentinel that's safe to read during
   // garbage collection (e.g., for patching the cache).
-  static inline Symbol RawUninitializedSentinel(Isolate* isolate);
+  static inline Tagged<Symbol> RawUninitializedSentinel(Isolate* isolate);
 
   static_assert(kHeaderSize % kObjectAlignment == 0,
                 "Header must be padded for alignment");
@@ -401,7 +399,7 @@ class FeedbackVector
   // Private for initializing stores in FeedbackVector::New().
   inline void Set(FeedbackSlot slot, MaybeObject value,
                   WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void Set(FeedbackSlot slot, Object value,
+  inline void Set(FeedbackSlot slot, Tagged<Object> value,
                   WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
 #ifdef DEBUG
@@ -656,7 +654,7 @@ class FeedbackMetadataIterator {
         next_slot_(FeedbackSlot(0)),
         slot_kind_(FeedbackSlotKind::kInvalid) {}
 
-  explicit FeedbackMetadataIterator(FeedbackMetadata metadata)
+  explicit FeedbackMetadataIterator(Tagged<FeedbackMetadata> metadata)
       : metadata_(metadata),
         next_slot_(FeedbackSlot(0)),
         slot_kind_(FeedbackSlotKind::kInvalid) {}
@@ -675,7 +673,7 @@ class FeedbackMetadataIterator {
   inline int entry_size() const;
 
  private:
-  FeedbackMetadata metadata() const {
+  Tagged<FeedbackMetadata> metadata() const {
     return !metadata_handle_.is_null() ? *metadata_handle_ : metadata_;
   }
 
@@ -683,7 +681,7 @@ class FeedbackMetadataIterator {
   // to have a single iterator implementation for both "handlified" and raw
   // pointer use cases.
   Handle<FeedbackMetadata> metadata_handle_;
-  FeedbackMetadata metadata_;
+  Tagged<FeedbackMetadata> metadata_;
   FeedbackSlot cur_slot_;
   FeedbackSlot next_slot_;
   FeedbackSlotKind slot_kind_;
@@ -722,19 +720,19 @@ class V8_EXPORT_PRIVATE NexusConfig {
 
   MaybeObjectHandle NewHandle(MaybeObject object) const;
   template <typename T>
-  Handle<T> NewHandle(T object) const;
+  Handle<T> NewHandle(Tagged<T> object) const;
 
   bool can_write() const { return mode() == MainThread; }
 
-  inline MaybeObject GetFeedback(FeedbackVector vector,
+  inline MaybeObject GetFeedback(Tagged<FeedbackVector> vector,
                                  FeedbackSlot slot) const;
-  inline void SetFeedback(FeedbackVector vector, FeedbackSlot slot,
+  inline void SetFeedback(Tagged<FeedbackVector> vector, FeedbackSlot slot,
                           MaybeObject object,
                           WriteBarrierMode mode = UPDATE_WRITE_BARRIER) const;
 
-  std::pair<MaybeObject, MaybeObject> GetFeedbackPair(FeedbackVector vector,
-                                                      FeedbackSlot slot) const;
-  void SetFeedbackPair(FeedbackVector vector, FeedbackSlot start_slot,
+  std::pair<MaybeObject, MaybeObject> GetFeedbackPair(
+      Tagged<FeedbackVector> vector, FeedbackSlot slot) const;
+  void SetFeedbackPair(Tagged<FeedbackVector> vector, FeedbackSlot start_slot,
                        MaybeObject feedback, WriteBarrierMode mode,
                        MaybeObject feedback_extra,
                        WriteBarrierMode mode_extra) const;
@@ -754,7 +752,7 @@ class V8_EXPORT_PRIVATE FeedbackNexus final {
  public:
   // For use on the main thread. A null {vector} is accepted as well.
   FeedbackNexus(Handle<FeedbackVector> vector, FeedbackSlot slot);
-  FeedbackNexus(FeedbackVector vector, FeedbackSlot slot);
+  FeedbackNexus(Tagged<FeedbackVector> vector, FeedbackSlot slot);
 
   // For use on the main or background thread as configured by {config}.
   // {vector} must be valid.
@@ -766,7 +764,7 @@ class V8_EXPORT_PRIVATE FeedbackNexus final {
     DCHECK(vector_.is_null());
     return vector_handle_;
   }
-  FeedbackVector vector() const {
+  Tagged<FeedbackVector> vector() const {
     return vector_handle_.is_null() ? vector_ : *vector_handle_;
   }
 
@@ -774,7 +772,7 @@ class V8_EXPORT_PRIVATE FeedbackNexus final {
   FeedbackSlotKind kind() const { return kind_; }
 
   inline LanguageMode GetLanguageMode() const {
-    return vector().GetLanguageMode(slot());
+    return vector()->GetLanguageMode(slot());
   }
 
   InlineCacheState ic_state() const;
@@ -789,7 +787,7 @@ class V8_EXPORT_PRIVATE FeedbackNexus final {
   void Print(std::ostream& os);
 
   // For map-based ICs (load, keyed-load, store, keyed-store).
-  Map GetFirstMap() const;
+  Tagged<Map> GetFirstMap() const;
   int ExtractMaps(MapHandles* maps) const;
   // Used to obtain maps and the associated handlers stored in the feedback
   // vector. This should be called when we expect only a handler to be stored in
@@ -846,7 +844,7 @@ class V8_EXPORT_PRIVATE FeedbackNexus final {
 
   // For KeyedLoad and KeyedStore ICs.
   IcCheckType GetKeyType() const;
-  Name GetName() const;
+  Tagged<Name> GetName() const;
 
   // For Call ICs.
   int GetCallCount();
@@ -874,7 +872,8 @@ class V8_EXPORT_PRIVATE FeedbackNexus final {
 
   // For CloneObject ICs
   static constexpr int kCloneObjectPolymorphicEntrySize = 2;
-  void ConfigureCloneObject(Handle<Map> source_map, Handle<Map> result_map);
+  void ConfigureCloneObject(Handle<Map> source_map,
+                            const MaybeObjectHandle& handler);
 
 // Bit positions in a smi that encodes lexical environment variable access.
 #define LEXICAL_MODE_BIT_FIELDS(V, _)  \
@@ -913,7 +912,7 @@ class V8_EXPORT_PRIVATE FeedbackNexus final {
   // you have a handle to the vector that is better because more operations can
   // be done, like allocation.
   Handle<FeedbackVector> vector_handle_;
-  FeedbackVector vector_;
+  Tagged<FeedbackVector> vector_;
   FeedbackSlot slot_;
   FeedbackSlotKind kind_;
   // When using the background-thread configuration, a cache is used to
@@ -928,7 +927,7 @@ class V8_EXPORT_PRIVATE FeedbackIterator final {
   explicit FeedbackIterator(const FeedbackNexus* nexus);
   void Advance();
   bool done() { return done_; }
-  Map map() { return map_; }
+  Tagged<Map> map() { return map_; }
   MaybeObject handler() { return handler_; }
 
   static int SizeFor(int number_of_entries) {
diff --git a/deps/v8/src/objects/feedback-vector.tq b/deps/v8/src/objects/feedback-vector.tq
index 1b8d89a643a7a6..b1287c57e4b757 100644
--- a/deps/v8/src/objects/feedback-vector.tq
+++ b/deps/v8/src/objects/feedback-vector.tq
@@ -20,25 +20,24 @@ bitfield struct FeedbackVectorFlags extends uint16 {
 }
 
 bitfield struct OsrState extends uint8 {
-  // The layout is chosen s.t. osr_urgency and maybe_has_optimized_osr_code can
-  // be loaded with a single load (i.e. no masking required).
+  // The layout is chosen s.t. osr_urgency and
+  // maybe_has_(maglev|turbofan)_osr_code can be loaded with a single load
+  // (i.e. no masking required).
   osr_urgency: uint32: 3 bit;
-  maybe_has_optimized_osr_code: bool: 1 bit;
+  maybe_has_maglev_osr_code: bool: 1 bit;
+  maybe_has_turbofan_osr_code: bool: 1 bit;
   // In order to have fast OSR checks in Ignition and Sparkplug, these bits
   // should remain 0. That way, the OSR check can be implemented as a single
   // comparison.
-  dont_use_these_bits_unless_beneficial: uint32: 4 bit;
+  dont_use_these_bits_unless_beneficial: uint32: 3 bit;
 }
 
 @generateBodyDescriptor
 extern class FeedbackVector extends HeapObject {
   const length: int32;
   invocation_count: int32;
-  // TODO(jgruber): We don't need 32 bits to count profiler_ticks (something
-  // like 4 bits seems sufficient).
-  profiler_ticks: int32;
-  // TODO(jgruber): These bits are available and could be merged with
-  // profiler_ticks.
+  @if(TAGGED_SIZE_8_BYTES) optional_padding: uint32;
+  // TODO(jgruber): These bits are available.
   placeholder0: uint8;
   osr_state: OsrState;
   flags: FeedbackVectorFlags;
diff --git a/deps/v8/src/objects/field-index-inl.h b/deps/v8/src/objects/field-index-inl.h
index e4461d4308c3dc..056809a9fb28ae 100644
--- a/deps/v8/src/objects/field-index-inl.h
+++ b/deps/v8/src/objects/field-index-inl.h
@@ -21,14 +21,14 @@ FieldIndex FieldIndex::ForInObjectOffset(int offset, Encoding encoding) {
   return FieldIndex(true, offset, encoding, 0, 0);
 }
 
-FieldIndex FieldIndex::ForSmiLoadHandler(Map map, int32_t handler) {
+FieldIndex FieldIndex::ForSmiLoadHandler(Tagged<Map> map, int32_t handler) {
   DCHECK_EQ(LoadHandler::KindBits::decode(handler), LoadHandler::Kind::kField);
 
   bool is_inobject = LoadHandler::IsInobjectBits::decode(handler);
-  int inobject_properties = map.GetInObjectProperties();
+  int inobject_properties = map->GetInObjectProperties();
   int first_inobject_offset;
   if (is_inobject) {
-    first_inobject_offset = map.GetInObjectPropertyOffset(0);
+    first_inobject_offset = map->GetInObjectPropertyOffset(0);
   } else {
     first_inobject_offset = FixedArray::kHeaderSize;
   }
@@ -38,16 +38,16 @@ FieldIndex FieldIndex::ForSmiLoadHandler(Map map, int32_t handler) {
       inobject_properties, first_inobject_offset);
 }
 
-FieldIndex FieldIndex::ForPropertyIndex(Map map, int property_index,
+FieldIndex FieldIndex::ForPropertyIndex(Tagged<Map> map, int property_index,
                                         Representation representation) {
-  DCHECK(map.instance_type() >= FIRST_NONSTRING_TYPE);
-  int inobject_properties = map.GetInObjectProperties();
+  DCHECK(map->instance_type() >= FIRST_NONSTRING_TYPE);
+  int inobject_properties = map->GetInObjectProperties();
   bool is_inobject = property_index < inobject_properties;
   int first_inobject_offset;
   int offset;
   if (is_inobject) {
-    first_inobject_offset = map.GetInObjectPropertyOffset(0);
-    offset = map.GetInObjectPropertyOffset(property_index);
+    first_inobject_offset = map->GetInObjectPropertyOffset(0);
+    offset = map->GetInObjectPropertyOffset(property_index);
   } else {
     first_inobject_offset = FixedArray::kHeaderSize;
     property_index -= inobject_properties;
@@ -79,19 +79,21 @@ int FieldIndex::GetLoadByFieldIndex() const {
   return is_double() ? (result | 1) : result;
 }
 
-FieldIndex FieldIndex::ForDescriptor(Map map, InternalIndex descriptor_index) {
+FieldIndex FieldIndex::ForDescriptor(Tagged<Map> map,
+                                     InternalIndex descriptor_index) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(map);
   return ForDescriptor(cage_base, map, descriptor_index);
 }
 
-FieldIndex FieldIndex::ForDescriptor(PtrComprCageBase cage_base, Map map,
+FieldIndex FieldIndex::ForDescriptor(PtrComprCageBase cage_base,
+                                     Tagged<Map> map,
                                      InternalIndex descriptor_index) {
-  PropertyDetails details = map.instance_descriptors(cage_base, kRelaxedLoad)
-                                .GetDetails(descriptor_index);
+  PropertyDetails details = map->instance_descriptors(cage_base, kRelaxedLoad)
+                                ->GetDetails(descriptor_index);
   return ForDetails(map, details);
 }
 
-FieldIndex FieldIndex::ForDetails(Map map, PropertyDetails details) {
+FieldIndex FieldIndex::ForDetails(Tagged<Map> map, PropertyDetails details) {
   int field_index = details.field_index();
   return ForPropertyIndex(map, field_index, details.representation());
 }
diff --git a/deps/v8/src/objects/field-index.h b/deps/v8/src/objects/field-index.h
index aa4d859c28d89c..6d943f86c06a09 100644
--- a/deps/v8/src/objects/field-index.h
+++ b/deps/v8/src/objects/field-index.h
@@ -26,15 +26,16 @@ class FieldIndex final {
   FieldIndex() : bit_field_(0) {}
 
   static inline FieldIndex ForPropertyIndex(
-      Map map, int index,
+      Tagged<Map> map, int index,
       Representation representation = Representation::Tagged());
   static inline FieldIndex ForInObjectOffset(int offset, Encoding encoding);
-  static inline FieldIndex ForSmiLoadHandler(Map map, int32_t handler);
-  static inline FieldIndex ForDescriptor(Map map,
+  static inline FieldIndex ForSmiLoadHandler(Tagged<Map> map, int32_t handler);
+  static inline FieldIndex ForDescriptor(Tagged<Map> map,
                                          InternalIndex descriptor_index);
-  static inline FieldIndex ForDescriptor(PtrComprCageBase cage_base, Map map,
+  static inline FieldIndex ForDescriptor(PtrComprCageBase cage_base,
+                                         Tagged<Map> map,
                                          InternalIndex descriptor_index);
-  static inline FieldIndex ForDetails(Map map, PropertyDetails details);
+  static inline FieldIndex ForDetails(Tagged<Map> map, PropertyDetails details);
 
   inline int GetLoadByFieldIndex() const;
 
diff --git a/deps/v8/src/objects/field-type.cc b/deps/v8/src/objects/field-type.cc
index 3b3457249fd2d4..8b2224d5d56a57 100644
--- a/deps/v8/src/objects/field-type.cc
+++ b/deps/v8/src/objects/field-type.cc
@@ -13,10 +13,14 @@ namespace v8 {
 namespace internal {
 
 // static
-FieldType FieldType::None() { return FieldType(Smi::FromInt(2).ptr()); }
+Tagged<FieldType> FieldType::None() {
+  return Tagged<FieldType>(Smi::FromInt(2).ptr());
+}
 
 // static
-FieldType FieldType::Any() { return FieldType(Smi::FromInt(1).ptr()); }
+Tagged<FieldType> FieldType::Any() {
+  return Tagged<FieldType>(Smi::FromInt(1).ptr());
+}
 
 // static
 Handle<FieldType> FieldType::None(Isolate* isolate) {
@@ -29,7 +33,9 @@ Handle<FieldType> FieldType::Any(Isolate* isolate) {
 }
 
 // static
-FieldType FieldType::Class(Map map) { return FieldType::cast(map); }
+Tagged<FieldType> FieldType::Class(Tagged<Map> map) {
+  return FieldType::cast(Tagged<Object>(map));
+}
 
 // static
 Handle<FieldType> FieldType::Class(Handle<Map> map, Isolate* isolate) {
@@ -37,36 +43,36 @@ Handle<FieldType> FieldType::Class(Handle<Map> map, Isolate* isolate) {
 }
 
 // static
-FieldType FieldType::cast(Object object) {
-  DCHECK(object == None() || object == Any() || object.IsMap());
-  return FieldType(object.ptr());
+Tagged<FieldType> FieldType::cast(Tagged<Object> object) {
+  DCHECK(object == None() || object == Any() || IsMap(object));
+  return Tagged<FieldType>(FieldType(object.ptr()).ptr());
 }
 
-bool FieldType::IsClass() const { return this->IsMap(); }
+bool IsClass(Tagged<FieldType> obj) { return IsMap(obj); }
 
-Map FieldType::AsClass() const {
-  DCHECK(IsClass());
+Tagged<Map> FieldType::AsClass() const {
+  DCHECK(IsClass(*this));
   return Map::cast(*this);
 }
 
 bool FieldType::NowStable() const {
-  return !this->IsClass() || AsClass().is_stable();
+  return !IsClass(*this) || AsClass()->is_stable();
 }
 
-bool FieldType::NowIs(FieldType other) const {
-  if (other.IsAny()) return true;
-  if (IsNone()) return true;
-  if (other.IsNone()) return false;
-  if (IsAny()) return false;
-  DCHECK(IsClass());
-  DCHECK(other.IsClass());
+bool FieldType::NowIs(Tagged<FieldType> other) const {
+  if (IsAny(other)) return true;
+  if (IsNone(*this)) return true;
+  if (IsNone(other)) return false;
+  if (IsAny(*this)) return false;
+  DCHECK(IsClass(*this));
+  DCHECK(IsClass(other));
   return *this == other;
 }
 
-bool FieldType::Equals(FieldType other) const {
-  if (IsAny() && other.IsAny()) return true;
-  if (IsNone() && other.IsNone()) return true;
-  if (IsClass() && other.IsClass()) {
+bool FieldType::Equals(Tagged<FieldType> other) const {
+  if (IsAny(*this) && IsAny(other)) return true;
+  if (IsNone(*this) && IsNone(other)) return true;
+  if (IsClass(*this) && IsClass(other)) {
     return *this == other;
   }
   return false;
@@ -75,21 +81,21 @@ bool FieldType::Equals(FieldType other) const {
 bool FieldType::NowIs(Handle<FieldType> other) const { return NowIs(*other); }
 
 void FieldType::PrintTo(std::ostream& os) const {
-  if (IsAny()) {
+  if (IsAny(*this)) {
     os << "Any";
-  } else if (IsNone()) {
+  } else if (IsNone(*this)) {
     os << "None";
   } else {
-    DCHECK(IsClass());
+    DCHECK(IsClass(*this));
     os << "Class(" << reinterpret_cast<void*>(AsClass().ptr()) << ")";
   }
 }
 
-bool FieldType::NowContains(Object value) const {
+bool FieldType::NowContains(Tagged<Object> value) const {
   if (*this == Any()) return true;
   if (*this == None()) return false;
-  if (!value.IsHeapObject()) return false;
-  return HeapObject::cast(value).map() == Map::cast(*this);
+  if (!IsHeapObject(value)) return false;
+  return HeapObject::cast(value)->map() == Map::cast(*this);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/field-type.h b/deps/v8/src/objects/field-type.h
index d3856c48b699ba..7017cf22f21714 100644
--- a/deps/v8/src/objects/field-type.h
+++ b/deps/v8/src/objects/field-type.h
@@ -12,42 +12,45 @@
 namespace v8 {
 namespace internal {
 
-template <typename T>
-class Handle;
-
 class FieldType : public Object {
  public:
-  static FieldType None();
-  static FieldType Any();
+  static Tagged<FieldType> None();
+  static Tagged<FieldType> Any();
   V8_EXPORT_PRIVATE static Handle<FieldType> None(Isolate* isolate);
   V8_EXPORT_PRIVATE static Handle<FieldType> Any(Isolate* isolate);
-  V8_EXPORT_PRIVATE static FieldType Class(Map map);
+  V8_EXPORT_PRIVATE static Tagged<FieldType> Class(Tagged<Map> map);
   V8_EXPORT_PRIVATE static Handle<FieldType> Class(Handle<Map> map,
                                                    Isolate* isolate);
-  V8_EXPORT_PRIVATE static FieldType cast(Object object);
-  static FieldType unchecked_cast(Object object) {
-    return FieldType(object.ptr());
+  V8_EXPORT_PRIVATE static Tagged<FieldType> cast(Tagged<Object> object);
+  static constexpr Tagged<FieldType> unchecked_cast(Tagged<Object> object) {
+    return Tagged<FieldType>(object.ptr());
   }
 
-  bool NowContains(Object value) const;
+  bool NowContains(Tagged<Object> value) const;
 
   bool NowContains(Handle<Object> value) const { return NowContains(*value); }
 
-  bool IsClass() const;
-  Map AsClass() const;
-  bool IsNone() const { return *this == None(); }
-  bool IsAny() const { return *this == Any(); }
+  Tagged<Map> AsClass() const;
   bool NowStable() const;
-  bool NowIs(FieldType other) const;
+  bool NowIs(Tagged<FieldType> other) const;
   bool NowIs(Handle<FieldType> other) const;
 
-  V8_EXPORT_PRIVATE bool Equals(FieldType other) const;
+  V8_EXPORT_PRIVATE bool Equals(Tagged<FieldType> other) const;
   V8_EXPORT_PRIVATE void PrintTo(std::ostream& os) const;
 
  private:
-  explicit constexpr FieldType(Address ptr) : Object(ptr) {}
+  friend class Tagged<FieldType>;
+
+  explicit constexpr FieldType(Address ptr) : Object(ptr) {
+    // TODO(leszeks): Typecheck that this is Map or Smi.
+  }
+  explicit constexpr FieldType(Address ptr, SkipTypeCheckTag) : Object(ptr) {}
 };
 
+bool IsClass(Tagged<FieldType> obj);
+inline bool IsNone(Tagged<FieldType> obj) { return obj == FieldType::None(); }
+inline bool IsAny(Tagged<FieldType> obj) { return obj == FieldType::Any(); }
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/fixed-array-inl.h b/deps/v8/src/objects/fixed-array-inl.h
index 413cd860e0599a..429e29459e355b 100644
--- a/deps/v8/src/objects/fixed-array-inl.h
+++ b/deps/v8/src/objects/fixed-array-inl.h
@@ -17,6 +17,8 @@
 #include "src/objects/oddball.h"
 #include "src/objects/slots.h"
 #include "src/roots/roots-inl.h"
+#include "src/torque/runtime-macro-shims.h"
+#include "src/torque/runtime-support.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -27,15 +29,11 @@ namespace internal {
 #include "torque-generated/src/objects/fixed-array-tq-inl.inc"
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(FixedArrayBase)
-FixedArrayBase::FixedArrayBase(Address ptr,
-                               HeapObject::AllowInlineSmiStorage allow_smi)
-    : TorqueGeneratedFixedArrayBase(ptr, allow_smi) {}
 TQ_OBJECT_CONSTRUCTORS_IMPL(FixedArray)
 TQ_OBJECT_CONSTRUCTORS_IMPL(FixedDoubleArray)
 TQ_OBJECT_CONSTRUCTORS_IMPL(ArrayList)
 TQ_OBJECT_CONSTRUCTORS_IMPL(ByteArray)
-ByteArray::ByteArray(Address ptr, HeapObject::AllowInlineSmiStorage allow_smi)
-    : TorqueGeneratedByteArray(ptr, allow_smi) {}
+TQ_OBJECT_CONSTRUCTORS_IMPL(ExternalPointerArray)
 TQ_OBJECT_CONSTRUCTORS_IMPL(TemplateList)
 TQ_OBJECT_CONSTRUCTORS_IMPL(WeakFixedArray)
 TQ_OBJECT_CONSTRUCTORS_IMPL(WeakArrayList)
@@ -46,7 +44,7 @@ RELEASE_ACQUIRE_SMI_ACCESSORS(FixedArrayBase, length, kLengthOffset)
 
 RELEASE_ACQUIRE_SMI_ACCESSORS(WeakFixedArray, length, kLengthOffset)
 
-Object FixedArrayBase::unchecked_length(AcquireLoadTag) const {
+Tagged<Object> FixedArrayBase::unchecked_length(AcquireLoadTag) const {
   return ACQUIRE_READ_FIELD(*this, kLengthOffset);
 }
 
@@ -55,52 +53,53 @@ ObjectSlot FixedArray::GetFirstElementAddress() {
 }
 
 bool FixedArray::ContainsOnlySmisOrHoles() {
-  Object the_hole = GetReadOnlyRoots().the_hole_value();
+  Tagged<Object> the_hole = GetReadOnlyRoots().the_hole_value();
   ObjectSlot current = GetFirstElementAddress();
   for (int i = 0; i < length(); ++i, ++current) {
-    Object candidate = *current;
-    if (!candidate.IsSmi() && candidate != the_hole) return false;
+    Tagged<Object> candidate = *current;
+    if (!IsSmi(candidate) && candidate != the_hole) return false;
   }
   return true;
 }
 
-Object FixedArray::get(int index) const {
+Tagged<Object> FixedArray::get(int index) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index);
 }
 
-Object FixedArray::get(PtrComprCageBase cage_base, int index) const {
+Tagged<Object> FixedArray::get(PtrComprCageBase cage_base, int index) const {
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
   return TaggedField<Object>::Relaxed_Load(cage_base, *this,
                                            OffsetOfElementAt(index));
 }
 
-Handle<Object> FixedArray::get(FixedArray array, int index, Isolate* isolate) {
-  return handle(array.get(isolate, index), isolate);
+Handle<Object> FixedArray::get(Tagged<FixedArray> array, int index,
+                               Isolate* isolate) {
+  return handle(array->get(isolate, index), isolate);
 }
 
 bool FixedArray::is_the_hole(Isolate* isolate, int index) {
-  return get(isolate, index).IsTheHole(isolate);
+  return IsTheHole(get(isolate, index), isolate);
 }
 
-void FixedArray::set(int index, Smi value) {
+void FixedArray::set(int index, Tagged<Smi> value) {
   DCHECK_NE(map(), EarlyGetReadOnlyRoots().unchecked_fixed_cow_array_map());
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
-  DCHECK(Object(value).IsSmi());
+  DCHECK(IsSmi(Object(value)));
   int offset = OffsetOfElementAt(index);
   RELAXED_WRITE_FIELD(*this, offset, value);
 }
 
-void FixedArray::set(int index, Object value) {
+void FixedArray::set(int index, Tagged<Object> value) {
   DCHECK_NE(EarlyGetReadOnlyRoots().unchecked_fixed_cow_array_map(), map());
-  DCHECK(IsFixedArray());
+  DCHECK(IsFixedArray(*this));
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
   int offset = OffsetOfElementAt(index);
   RELAXED_WRITE_FIELD(*this, offset, value);
   WRITE_BARRIER(*this, offset, value);
 }
 
-void FixedArray::set(int index, Object value, WriteBarrierMode mode) {
+void FixedArray::set(int index, Tagged<Object> value, WriteBarrierMode mode) {
   DCHECK_NE(map(), GetReadOnlyRoots().fixed_cow_array_map());
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
   int offset = OffsetOfElementAt(index);
@@ -109,27 +108,28 @@ void FixedArray::set(int index, Object value, WriteBarrierMode mode) {
 }
 
 // static
-void FixedArray::NoWriteBarrierSet(FixedArray array, int index, Object value) {
-  DCHECK_NE(array.map(), array.GetReadOnlyRoots().fixed_cow_array_map());
+void FixedArray::NoWriteBarrierSet(Tagged<FixedArray> array, int index,
+                                   Tagged<Object> value) {
+  DCHECK_NE(array->map(), array->GetReadOnlyRoots().fixed_cow_array_map());
   DCHECK_LT(static_cast<unsigned>(index),
-            static_cast<unsigned>(array.length()));
+            static_cast<unsigned>(array->length()));
   DCHECK(!ObjectInYoungGeneration(value));
   int offset = OffsetOfElementAt(index);
   RELAXED_WRITE_FIELD(array, offset, value);
 }
 
-Object FixedArray::get(int index, RelaxedLoadTag) const {
+Tagged<Object> FixedArray::get(int index, RelaxedLoadTag) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index);
 }
 
-Object FixedArray::get(PtrComprCageBase cage_base, int index,
-                       RelaxedLoadTag) const {
+Tagged<Object> FixedArray::get(PtrComprCageBase cage_base, int index,
+                               RelaxedLoadTag) const {
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
   return RELAXED_READ_FIELD(*this, OffsetOfElementAt(index));
 }
 
-void FixedArray::set(int index, Object value, RelaxedStoreTag,
+void FixedArray::set(int index, Tagged<Object> value, RelaxedStoreTag,
                      WriteBarrierMode mode) {
   DCHECK_NE(map(), GetReadOnlyRoots().fixed_cow_array_map());
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
@@ -137,23 +137,23 @@ void FixedArray::set(int index, Object value, RelaxedStoreTag,
   CONDITIONAL_WRITE_BARRIER(*this, OffsetOfElementAt(index), value, mode);
 }
 
-void FixedArray::set(int index, Smi value, RelaxedStoreTag tag) {
-  DCHECK(Object(value).IsSmi());
+void FixedArray::set(int index, Tagged<Smi> value, RelaxedStoreTag tag) {
+  DCHECK(IsSmi(Object(value)));
   set(index, value, tag, SKIP_WRITE_BARRIER);
 }
 
-Object FixedArray::get(int index, SeqCstAccessTag) const {
+Tagged<Object> FixedArray::get(int index, SeqCstAccessTag) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index);
 }
 
-Object FixedArray::get(PtrComprCageBase cage_base, int index,
-                       SeqCstAccessTag) const {
+Tagged<Object> FixedArray::get(PtrComprCageBase cage_base, int index,
+                               SeqCstAccessTag) const {
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
   return SEQ_CST_READ_FIELD(*this, OffsetOfElementAt(index));
 }
 
-void FixedArray::set(int index, Object value, SeqCstAccessTag,
+void FixedArray::set(int index, Tagged<Object> value, SeqCstAccessTag,
                      WriteBarrierMode mode) {
   DCHECK_NE(map(), GetReadOnlyRoots().fixed_cow_array_map());
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
@@ -161,23 +161,23 @@ void FixedArray::set(int index, Object value, SeqCstAccessTag,
   CONDITIONAL_WRITE_BARRIER(*this, OffsetOfElementAt(index), value, mode);
 }
 
-void FixedArray::set(int index, Smi value, SeqCstAccessTag tag) {
-  DCHECK(Object(value).IsSmi());
+void FixedArray::set(int index, Tagged<Smi> value, SeqCstAccessTag tag) {
+  DCHECK(IsSmi(Object(value)));
   set(index, value, tag, SKIP_WRITE_BARRIER);
 }
 
-Object FixedArray::get(int index, AcquireLoadTag) const {
+Tagged<Object> FixedArray::get(int index, AcquireLoadTag) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index);
 }
 
-Object FixedArray::get(PtrComprCageBase cage_base, int index,
-                       AcquireLoadTag) const {
+Tagged<Object> FixedArray::get(PtrComprCageBase cage_base, int index,
+                               AcquireLoadTag) const {
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
   return ACQUIRE_READ_FIELD(*this, OffsetOfElementAt(index));
 }
 
-void FixedArray::set(int index, Object value, ReleaseStoreTag,
+void FixedArray::set(int index, Tagged<Object> value, ReleaseStoreTag,
                      WriteBarrierMode mode) {
   DCHECK_NE(map(), GetReadOnlyRoots().fixed_cow_array_map());
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
@@ -185,8 +185,8 @@ void FixedArray::set(int index, Object value, ReleaseStoreTag,
   CONDITIONAL_WRITE_BARRIER(*this, OffsetOfElementAt(index), value, mode);
 }
 
-void FixedArray::set(int index, Smi value, ReleaseStoreTag tag) {
-  DCHECK(Object(value).IsSmi());
+void FixedArray::set(int index, Tagged<Smi> value, ReleaseStoreTag tag) {
+  DCHECK(IsSmi(Object(value)));
   set(index, value, tag, SKIP_WRITE_BARRIER);
 }
 
@@ -224,18 +224,33 @@ void FixedArray::set_the_hole(ReadOnlyRoots ro_roots, int index) {
   FixedArray::NoWriteBarrierSet(*this, index, ro_roots.the_hole_value());
 }
 
-Object FixedArray::swap(int index, Object value, SeqCstAccessTag,
-                        WriteBarrierMode mode) {
+Tagged<Object> FixedArray::swap(int index, Tagged<Object> value,
+                                SeqCstAccessTag, WriteBarrierMode mode) {
   DCHECK_NE(map(), GetReadOnlyRoots().fixed_cow_array_map());
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
-  Object previous_value =
+  Tagged<Object> previous_value =
       SEQ_CST_SWAP_FIELD(*this, OffsetOfElementAt(index), value);
   CONDITIONAL_WRITE_BARRIER(*this, OffsetOfElementAt(index), value, mode);
   return previous_value;
 }
 
-Object FixedArray::swap(int index, Smi value, SeqCstAccessTag tag) {
-  DCHECK(Object(value).IsSmi());
+Tagged<Object> FixedArray::compare_and_swap(int index, Tagged<Object> expected,
+                                            Tagged<Object> value,
+                                            SeqCstAccessTag,
+                                            WriteBarrierMode mode) {
+  DCHECK_NE(map(), GetReadOnlyRoots().fixed_cow_array_map());
+  DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
+  Tagged<Object> previous_value = SEQ_CST_COMPARE_AND_SWAP_FIELD(
+      *this, OffsetOfElementAt(index), expected, value);
+  if (previous_value == expected) {
+    CONDITIONAL_WRITE_BARRIER(*this, OffsetOfElementAt(index), value, mode);
+  }
+  return previous_value;
+}
+
+Tagged<Object> FixedArray::swap(int index, Tagged<Smi> value,
+                                SeqCstAccessTag tag) {
+  DCHECK(IsSmi(value));
   return swap(index, value, tag, SKIP_WRITE_BARRIER);
 }
 
@@ -262,15 +277,16 @@ void FixedArray::MoveElements(Isolate* isolate, int dst_index, int src_index,
   isolate->heap()->MoveRange(*this, dst_slot, src_slot, len, mode);
 }
 
-void FixedArray::CopyElements(Isolate* isolate, int dst_index, FixedArray src,
-                              int src_index, int len, WriteBarrierMode mode) {
+void FixedArray::CopyElements(Isolate* isolate, int dst_index,
+                              Tagged<FixedArray> src, int src_index, int len,
+                              WriteBarrierMode mode) {
   if (len == 0) return;
   DCHECK_LE(dst_index + len, length());
-  DCHECK_LE(src_index + len, src.length());
+  DCHECK_LE(src_index + len, src->length());
   DisallowGarbageCollection no_gc;
 
   ObjectSlot dst_slot(RawFieldOfElementAt(dst_index));
-  ObjectSlot src_slot(src.RawFieldOfElementAt(src_index));
+  ObjectSlot src_slot(src->RawFieldOfElementAt(src_index));
   isolate->heap()->CopyRange(*this, dst_slot, src_slot, len, mode);
 }
 
@@ -285,7 +301,7 @@ inline int WeakArrayList::AllocatedSize() { return SizeFor(capacity()); }
 
 // Perform a binary search in a fixed array.
 template <SearchMode search_mode, typename T>
-int BinarySearch(T* array, Name name, int valid_entries,
+int BinarySearch(T* array, Tagged<Name> name, int valid_entries,
                  int* out_insertion_index) {
   DCHECK_IMPLIES(search_mode == VALID_ENTRIES, out_insertion_index == nullptr);
   int low = 0;
@@ -295,15 +311,15 @@ int BinarySearch(T* array, Name name, int valid_entries,
   // index). After doing the binary search and getting the correct internal
   // index we check to have the index lower than valid_entries, if needed.
   int high = array->number_of_entries() - 1;
-  uint32_t hash = name.hash();
+  uint32_t hash = name->hash();
   int limit = high;
 
   DCHECK(low <= high);
 
   while (low != high) {
     int mid = low + (high - low) / 2;
-    Name mid_name = array->GetSortedKey(mid);
-    uint32_t mid_hash = mid_name.hash();
+    Tagged<Name> mid_name = array->GetSortedKey(mid);
+    uint32_t mid_hash = mid_name->hash();
 
     if (mid_hash >= hash) {
       high = mid;
@@ -314,8 +330,8 @@ int BinarySearch(T* array, Name name, int valid_entries,
 
   for (; low <= limit; ++low) {
     int sort_index = array->GetSortedKeyIndex(low);
-    Name entry = array->GetKey(InternalIndex(sort_index));
-    uint32_t current_hash = entry.hash();
+    Tagged<Name> entry = array->GetKey(InternalIndex(sort_index));
+    uint32_t current_hash = entry->hash();
     if (current_hash != hash) {
       // 'search_mode == ALL_ENTRIES' here and below is not needed since
       // 'out_insertion_index != nullptr' implies 'search_mode == ALL_ENTRIES'.
@@ -344,15 +360,15 @@ int BinarySearch(T* array, Name name, int valid_entries,
 // Perform a linear search in this fixed array. len is the number of entry
 // indices that are valid.
 template <SearchMode search_mode, typename T>
-int LinearSearch(T* array, Name name, int valid_entries,
+int LinearSearch(T* array, Tagged<Name> name, int valid_entries,
                  int* out_insertion_index) {
   if (search_mode == ALL_ENTRIES && out_insertion_index != nullptr) {
-    uint32_t hash = name.hash();
+    uint32_t hash = name->hash();
     int len = array->number_of_entries();
     for (int number = 0; number < len; number++) {
       int sorted_index = array->GetSortedKeyIndex(number);
-      Name entry = array->GetKey(InternalIndex(sorted_index));
-      uint32_t current_hash = entry.hash();
+      Tagged<Name> entry = array->GetKey(InternalIndex(sorted_index));
+      uint32_t current_hash = entry->hash();
       if (current_hash > hash) {
         *out_insertion_index = sorted_index;
         return T::kNotFound;
@@ -372,8 +388,8 @@ int LinearSearch(T* array, Name name, int valid_entries,
 }
 
 template <SearchMode search_mode, typename T>
-int Search(T* array, Name name, int valid_entries, int* out_insertion_index,
-           bool concurrent_search) {
+int Search(T* array, Tagged<Name> name, int valid_entries,
+           int* out_insertion_index, bool concurrent_search) {
   SLOW_DCHECK_IMPLIES(!concurrent_search, array->IsSortedNoDuplicates());
 
   if (valid_entries == 0) {
@@ -412,12 +428,12 @@ uint64_t FixedDoubleArray::get_representation(int index) {
   return base::ReadUnalignedValue<uint64_t>(field_address(offset));
 }
 
-Handle<Object> FixedDoubleArray::get(FixedDoubleArray array, int index,
+Handle<Object> FixedDoubleArray::get(Tagged<FixedDoubleArray> array, int index,
                                      Isolate* isolate) {
-  if (array.is_the_hole(index)) {
+  if (array->is_the_hole(index)) {
     return ReadOnlyRoots(isolate).the_hole_value_handle();
   } else {
-    return isolate->factory()->NewNumber(array.get_scalar(index));
+    return isolate->factory()->NewNumber(array->get_scalar(index));
   }
 }
 
@@ -501,15 +517,15 @@ MaybeObjectSlot WeakFixedArray::RawFieldOfElementAt(int index) {
 }
 
 void WeakFixedArray::CopyElements(Isolate* isolate, int dst_index,
-                                  WeakFixedArray src, int src_index, int len,
-                                  WriteBarrierMode mode) {
+                                  Tagged<WeakFixedArray> src, int src_index,
+                                  int len, WriteBarrierMode mode) {
   if (len == 0) return;
   DCHECK_LE(dst_index + len, length());
-  DCHECK_LE(src_index + len, src.length());
+  DCHECK_LE(src_index + len, src->length());
   DisallowGarbageCollection no_gc;
 
   MaybeObjectSlot dst_slot(data_start() + dst_index);
-  MaybeObjectSlot src_slot(src.data_start() + src_index);
+  MaybeObjectSlot src_slot(src->data_start() + src_index);
   isolate->heap()->CopyRange(*this, dst_slot, src_slot, len, mode);
 }
 
@@ -527,7 +543,7 @@ void WeakArrayList::Set(int index, MaybeObject value, WriteBarrierMode mode) {
   set_objects(index, value, mode);
 }
 
-void WeakArrayList::Set(int index, Smi value) {
+void WeakArrayList::Set(int index, Tagged<Smi> value) {
   Set(index, MaybeObject::FromSmi(value), SKIP_WRITE_BARRIER);
 }
 
@@ -536,77 +552,77 @@ MaybeObjectSlot WeakArrayList::data_start() {
 }
 
 void WeakArrayList::CopyElements(Isolate* isolate, int dst_index,
-                                 WeakArrayList src, int src_index, int len,
-                                 WriteBarrierMode mode) {
+                                 Tagged<WeakArrayList> src, int src_index,
+                                 int len, WriteBarrierMode mode) {
   if (len == 0) return;
   DCHECK_LE(dst_index + len, capacity());
-  DCHECK_LE(src_index + len, src.capacity());
+  DCHECK_LE(src_index + len, src->capacity());
   DisallowGarbageCollection no_gc;
 
   MaybeObjectSlot dst_slot(data_start() + dst_index);
-  MaybeObjectSlot src_slot(src.data_start() + src_index);
+  MaybeObjectSlot src_slot(src->data_start() + src_index);
   isolate->heap()->CopyRange(*this, dst_slot, src_slot, len, mode);
 }
 
-HeapObject WeakArrayList::Iterator::Next() {
+Tagged<HeapObject> WeakArrayList::Iterator::Next() {
   if (!array_.is_null()) {
-    while (index_ < array_.length()) {
-      MaybeObject item = array_.Get(index_++);
+    while (index_ < array_->length()) {
+      MaybeObject item = array_->Get(index_++);
       DCHECK(item->IsWeakOrCleared());
-      if (!item->IsCleared()) return item->GetHeapObjectAssumeWeak();
+      if (!item->IsCleared()) return item.GetHeapObjectAssumeWeak();
     }
     array_ = WeakArrayList();
   }
-  return HeapObject();
+  return Tagged<HeapObject>();
 }
 
 int ArrayList::Length() const {
-  if (FixedArray::cast(*this).length() == 0) return 0;
-  return Smi::ToInt(FixedArray::cast(*this).get(kLengthIndex));
+  if (FixedArray::cast(*this)->length() == 0) return 0;
+  return Smi::ToInt(FixedArray::cast(*this)->get(kLengthIndex));
 }
 
 void ArrayList::SetLength(int length) {
-  return FixedArray::cast(*this).set(kLengthIndex, Smi::FromInt(length));
+  return FixedArray::cast(*this)->set(kLengthIndex, Smi::FromInt(length));
 }
 
-Object ArrayList::Get(int index) const {
-  return FixedArray::cast(*this).get(kFirstIndex + index);
+Tagged<Object> ArrayList::Get(int index) const {
+  return FixedArray::cast(*this)->get(kFirstIndex + index);
 }
 
-Object ArrayList::Get(PtrComprCageBase cage_base, int index) const {
-  return FixedArray::cast(*this).get(cage_base, kFirstIndex + index);
+Tagged<Object> ArrayList::Get(PtrComprCageBase cage_base, int index) const {
+  return FixedArray::cast(*this)->get(cage_base, kFirstIndex + index);
 }
 
 ObjectSlot ArrayList::Slot(int index) {
   return RawField(OffsetOfElementAt(kFirstIndex + index));
 }
 
-void ArrayList::Set(int index, Object obj, WriteBarrierMode mode) {
-  FixedArray::cast(*this).set(kFirstIndex + index, obj, mode);
+void ArrayList::Set(int index, Tagged<Object> obj, WriteBarrierMode mode) {
+  FixedArray::cast(*this)->set(kFirstIndex + index, obj, mode);
 }
 
-void ArrayList::Set(int index, Smi value) {
-  DCHECK(Object(value).IsSmi());
+void ArrayList::Set(int index, Tagged<Smi> value) {
+  DCHECK(IsSmi(Object(value)));
   Set(index, value, SKIP_WRITE_BARRIER);
 }
-void ArrayList::Clear(int index, Object undefined) {
-  DCHECK(undefined.IsUndefined());
-  FixedArray::cast(*this).set(kFirstIndex + index, undefined,
-                              SKIP_WRITE_BARRIER);
+void ArrayList::Clear(int index, Tagged<Object> undefined) {
+  DCHECK(IsUndefined(undefined));
+  FixedArray::cast(*this)->set(kFirstIndex + index, undefined,
+                               SKIP_WRITE_BARRIER);
 }
 
 int ByteArray::Size() { return RoundUp(length() + kHeaderSize, kTaggedSize); }
 
-byte ByteArray::get(int offset) const {
+uint8_t ByteArray::get(int offset) const {
   DCHECK_GE(offset, 0);
   DCHECK_LT(offset, length());
-  return ReadField<byte>(kHeaderSize + offset);
+  return ReadField<uint8_t>(kHeaderSize + offset);
 }
 
-void ByteArray::set(int offset, byte value) {
+void ByteArray::set(int offset, uint8_t value) {
   DCHECK_GE(offset, 0);
   DCHECK_LT(offset, length());
-  WriteField<byte>(kHeaderSize + offset, value);
+  WriteField<uint8_t>(kHeaderSize + offset, value);
 }
 
 int ByteArray::get_int(int offset) const {
@@ -621,21 +637,35 @@ void ByteArray::set_int(int offset, int value) {
   WriteField<int>(kHeaderSize + offset, value);
 }
 
-Address ByteArray::get_sandboxed_pointer(int offset) const {
+Address FixedAddressArray::get_sandboxed_pointer(int offset) const {
   DCHECK_GE(offset, 0);
-  DCHECK_LE(offset + sizeof(Address), length());
+  DCHECK_GT(length(), offset);
+  int actual_offset = offset * sizeof(Address);
   PtrComprCageBase sandbox_base = GetPtrComprCageBase(*this);
-  return ReadSandboxedPointerField(kHeaderSize + offset, sandbox_base);
+  return ReadSandboxedPointerField(kHeaderSize + actual_offset, sandbox_base);
 }
 
-void ByteArray::set_sandboxed_pointer(int offset, Address value) {
+void FixedAddressArray::set_sandboxed_pointer(int offset, Address value) {
   DCHECK_GE(offset, 0);
-  DCHECK_LE(offset + sizeof(Address), length());
+  DCHECK_GT(length(), offset);
+  int actual_offset = offset * sizeof(Address);
   PtrComprCageBase sandbox_base = GetPtrComprCageBase(*this);
-  WriteSandboxedPointerField(kHeaderSize + offset, sandbox_base, value);
+  WriteSandboxedPointerField(kHeaderSize + actual_offset, sandbox_base, value);
 }
 
-void ByteArray::copy_in(int offset, const byte* buffer, int slice_length) {
+// static
+Handle<FixedAddressArray> FixedAddressArray::New(Isolate* isolate, int length,
+                                                 AllocationType allocation) {
+  return Handle<FixedAddressArray>::cast(
+      FixedIntegerArray<Address>::New(isolate, length, allocation));
+}
+
+FixedAddressArray::FixedAddressArray(Address ptr)
+    : FixedIntegerArray<Address>(ptr) {}
+
+CAST_ACCESSOR(FixedAddressArray)
+
+void ByteArray::copy_in(int offset, const uint8_t* buffer, int slice_length) {
   DCHECK_GE(offset, 0);
   DCHECK_GE(slice_length, 0);
   DCHECK_LE(slice_length, kMaxInt - offset);
@@ -644,7 +674,7 @@ void ByteArray::copy_in(int offset, const byte* buffer, int slice_length) {
   memcpy(reinterpret_cast<void*>(dst_addr), buffer, slice_length);
 }
 
-void ByteArray::copy_out(int offset, byte* buffer, int slice_length) {
+void ByteArray::copy_out(int offset, uint8_t* buffer, int slice_length) {
   DCHECK_GE(offset, 0);
   DCHECK_GE(slice_length, 0);
   DCHECK_LE(slice_length, kMaxInt - offset);
@@ -658,18 +688,18 @@ void ByteArray::clear_padding() {
   memset(reinterpret_cast<void*>(address() + data_size), 0, Size() - data_size);
 }
 
-ByteArray ByteArray::FromDataStartAddress(Address address) {
+Tagged<ByteArray> ByteArray::FromDataStartAddress(Address address) {
   DCHECK_TAG_ALIGNED(address);
   return ByteArray::cast(Object(address - kHeaderSize + kHeapObjectTag));
 }
 
 int ByteArray::DataSize() const { return RoundUp(length(), kTaggedSize); }
 
-byte* ByteArray::GetDataStartAddress() {
-  return reinterpret_cast<byte*>(address() + kHeaderSize);
+uint8_t* ByteArray::GetDataStartAddress() {
+  return reinterpret_cast<uint8_t*>(address() + kHeaderSize);
 }
 
-byte* ByteArray::GetDataEndAddress() {
+uint8_t* ByteArray::GetDataEndAddress() {
   return GetDataStartAddress() + length();
 }
 
@@ -679,9 +709,7 @@ FixedIntegerArray<T>::FixedIntegerArray(Address ptr) : ByteArray(ptr) {
 }
 
 template <typename T>
-FixedIntegerArray<T> FixedIntegerArray<T>::cast(Object object) {
-  return FixedIntegerArray<T>(object.ptr());
-}
+CAST_ACCESSOR(FixedIntegerArray<T>)
 
 // static
 template <typename T>
@@ -715,13 +743,33 @@ int FixedIntegerArray<T>::length() const {
   return ByteArray::length() / sizeof(T);
 }
 
+template <ExternalPointerTag tag>
+inline Address ExternalPointerArray::get(int index, Isolate* isolate) {
+  return ReadExternalPointerField<tag>(OffsetOfElementAt(index), isolate);
+}
+
+template <ExternalPointerTag tag>
+inline void ExternalPointerArray::set(int index, Isolate* isolate,
+                                      Address value) {
+  WriteLazilyInitializedExternalPointerField<tag>(OffsetOfElementAt(index),
+                                                  isolate, value);
+}
+
+inline void ExternalPointerArray::clear(int index) {
+  ResetLazilyInitializedExternalPointerField(OffsetOfElementAt(index));
+}
+
+// static
+Handle<ExternalPointerArray> ExternalPointerArray::New(
+    Isolate* isolate, int length, AllocationType allocation) {
+  return isolate->factory()->NewExternalPointerArray(length, allocation);
+}
+
 template <class T>
 PodArray<T>::PodArray(Address ptr) : ByteArray(ptr) {}
 
 template <class T>
-PodArray<T> PodArray<T>::cast(Object object) {
-  return PodArray<T>(object.ptr());
-}
+CAST_ACCESSOR(PodArray<T>)
 
 // static
 template <class T>
@@ -733,25 +781,34 @@ Handle<PodArray<T>> PodArray<T>::New(Isolate* isolate, int length,
       isolate->factory()->NewByteArray(byte_length, allocation));
 }
 
+// static
+template <class T>
+Handle<PodArray<T>> PodArray<T>::New(LocalIsolate* isolate, int length) {
+  int byte_length;
+  CHECK(!base::bits::SignedMulOverflow32(length, sizeof(T), &byte_length));
+  return Handle<PodArray<T>>::cast(
+      isolate->factory()->NewByteArray(byte_length, AllocationType::kOld));
+}
+
 template <class T>
 int PodArray<T>::length() const {
   return ByteArray::length() / sizeof(T);
 }
 
 int TemplateList::length() const {
-  return Smi::ToInt(FixedArray::cast(*this).get(kLengthIndex));
+  return Smi::ToInt(FixedArray::cast(*this)->get(kLengthIndex));
 }
 
-Object TemplateList::get(int index) const {
-  return FixedArray::cast(*this).get(kFirstElementIndex + index);
+Tagged<Object> TemplateList::get(int index) const {
+  return FixedArray::cast(*this)->get(kFirstElementIndex + index);
 }
 
-Object TemplateList::get(PtrComprCageBase cage_base, int index) const {
-  return FixedArray::cast(*this).get(cage_base, kFirstElementIndex + index);
+Tagged<Object> TemplateList::get(PtrComprCageBase cage_base, int index) const {
+  return FixedArray::cast(*this)->get(cage_base, kFirstElementIndex + index);
 }
 
-void TemplateList::set(int index, Object value) {
-  FixedArray::cast(*this).set(kFirstElementIndex + index, value);
+void TemplateList::set(int index, Tagged<Object> value) {
+  FixedArray::cast(*this)->set(kFirstElementIndex + index, value);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/fixed-array.cc b/deps/v8/src/objects/fixed-array.cc
new file mode 100644
index 00000000000000..7a6d0e6661f201
--- /dev/null
+++ b/deps/v8/src/objects/fixed-array.cc
@@ -0,0 +1,393 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/objects/fixed-array.h"
+
+#include "src/objects/map-inl.h"
+
+namespace v8 {
+namespace internal {
+
+int FixedArrayBase::GetMaxLengthForNewSpaceAllocation(ElementsKind kind) {
+  return ((kMaxRegularHeapObjectSize - FixedArrayBase::kHeaderSize) >>
+          ElementsKindToShiftSize(kind));
+}
+
+bool FixedArrayBase::IsCowArray() const {
+  return map() == GetReadOnlyRoots().fixed_cow_array_map();
+}
+
+// static
+Handle<TemplateList> TemplateList::New(Isolate* isolate, int size) {
+  Handle<FixedArray> list = isolate->factory()->NewFixedArray(
+      kLengthIndex + size, AllocationType::kOld);
+  list->set(kLengthIndex, Smi::zero());
+  return Handle<TemplateList>::cast(list);
+}
+
+// static
+Handle<TemplateList> TemplateList::Add(Isolate* isolate,
+                                       Handle<TemplateList> list,
+                                       Handle<i::Object> value) {
+  static_assert(kFirstElementIndex == 1);
+  int index = list->length() + 1;
+  Handle<i::FixedArray> fixed_array = Handle<FixedArray>::cast(list);
+  fixed_array = FixedArray::SetAndGrow(isolate, fixed_array, index, value);
+  fixed_array->set(kLengthIndex, Smi::FromInt(index));
+  return Handle<TemplateList>::cast(fixed_array);
+}
+
+Handle<FixedArray> FixedArray::SetAndGrow(Isolate* isolate,
+                                          Handle<FixedArray> array, int index,
+                                          Handle<Object> value) {
+  int src_length = array->length();
+  if (index < src_length) {
+    array->set(index, *value);
+    return array;
+  }
+  int capacity = src_length;
+  do {
+    capacity = JSObject::NewElementsCapacity(capacity);
+  } while (capacity <= index);
+  Handle<FixedArray> new_array = isolate->factory()->NewFixedArray(capacity);
+
+  DisallowGarbageCollection no_gc;
+  Tagged<FixedArray> raw_src = *array;
+  Tagged<FixedArray> raw_dst = *new_array;
+  raw_src->CopyTo(0, raw_dst, 0, src_length);
+  DCHECK_EQ(raw_dst->length(), capacity);
+  raw_dst->FillWithHoles(src_length, capacity);
+  raw_dst->set(index, *value);
+
+  return new_array;
+}
+
+Handle<FixedArray> FixedArray::ShrinkOrEmpty(Isolate* isolate,
+                                             Handle<FixedArray> array,
+                                             int new_length) {
+  if (new_length == 0) {
+    return array->GetReadOnlyRoots().empty_fixed_array_handle();
+  } else {
+    array->Shrink(isolate, new_length);
+    return array;
+  }
+}
+
+void FixedArray::Shrink(Isolate* isolate, int new_length) {
+  DCHECK(0 < new_length && new_length <= length());
+  if (new_length < length()) {
+    isolate->heap()->RightTrimFixedArray(*this, length() - new_length);
+  }
+}
+
+void FixedArray::CopyTo(int pos, Tagged<FixedArray> dest, int dest_pos,
+                        int len) const {
+  DisallowGarbageCollection no_gc;
+  // Return early if len == 0 so that we don't try to read the write barrier off
+  // a canonical read-only empty fixed array.
+  if (len == 0) return;
+  WriteBarrierMode mode = dest->GetWriteBarrierMode(no_gc);
+  for (int index = 0; index < len; index++) {
+    dest->set(dest_pos + index, get(pos + index), mode);
+  }
+}
+
+// static
+Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
+                                 Handle<Object> obj,
+                                 AllocationType allocation) {
+  int length = array->Length();
+  array = EnsureSpace(isolate, array, length + 1, allocation);
+  // Check that GC didn't remove elements from the array.
+  DCHECK_EQ(array->Length(), length);
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<ArrayList> raw_array = *array;
+    raw_array->Set(length, *obj);
+    raw_array->SetLength(length + 1);
+  }
+  return array;
+}
+
+Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
+                                 Tagged<Smi> obj1) {
+  int length = array->Length();
+  array = EnsureSpace(isolate, array, length + 1);
+  // Check that GC didn't remove elements from the array.
+  DCHECK_EQ(array->Length(), length);
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<ArrayList> raw_array = *array;
+    raw_array->Set(length, obj1);
+    raw_array->SetLength(length + 1);
+  }
+  return array;
+}
+
+// static
+Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
+                                 Handle<Object> obj1, Handle<Object> obj2) {
+  int length = array->Length();
+  array = EnsureSpace(isolate, array, length + 2);
+  // Check that GC didn't remove elements from the array.
+  DCHECK_EQ(array->Length(), length);
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<ArrayList> raw_array = *array;
+    raw_array->Set(length, *obj1);
+    raw_array->Set(length + 1, *obj2);
+    raw_array->SetLength(length + 2);
+  }
+  return array;
+}
+
+Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
+                                 Handle<Object> obj1, Tagged<Smi> obj2,
+                                 Tagged<Smi> obj3, Tagged<Smi> obj4) {
+  int length = array->Length();
+  array = EnsureSpace(isolate, array, length + 4);
+  // Check that GC didn't remove elements from the array.
+  DCHECK_EQ(array->Length(), length);
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<ArrayList> raw_array = *array;
+    raw_array->Set(length, *obj1);
+    raw_array->Set(length + 1, obj2);
+    raw_array->Set(length + 2, obj3);
+    raw_array->Set(length + 3, obj4);
+    raw_array->SetLength(length + 4);
+  }
+  return array;
+}
+
+// static
+Handle<ArrayList> ArrayList::New(Isolate* isolate, int size,
+                                 AllocationType allocation) {
+  return isolate->factory()->NewArrayList(size, allocation);
+}
+
+Handle<FixedArray> ArrayList::Elements(Isolate* isolate,
+                                       Handle<ArrayList> array) {
+  int length = array->Length();
+  Handle<FixedArray> result = isolate->factory()->NewFixedArray(length);
+  // Do not copy the first entry, i.e., the length.
+  array->CopyTo(kFirstIndex, *result, 0, length);
+  return result;
+}
+
+namespace {
+
+Handle<FixedArray> EnsureSpaceInFixedArray(Isolate* isolate,
+                                           Handle<FixedArray> array, int length,
+                                           AllocationType allocation) {
+  // Ensure calculation matches CodeStubAssembler::ArrayListEnsureSpace.
+  int capacity = array->length();
+  if (capacity < length) {
+    int new_capacity = length;
+    new_capacity = new_capacity + std::max(new_capacity / 2, 2);
+    int grow_by = new_capacity - capacity;
+    array =
+        isolate->factory()->CopyFixedArrayAndGrow(array, grow_by, allocation);
+  }
+  return array;
+}
+
+}  // namespace
+
+// static
+Handle<ArrayList> ArrayList::EnsureSpace(Isolate* isolate,
+                                         Handle<ArrayList> array, int length,
+                                         AllocationType allocation) {
+  DCHECK_LT(0, length);
+  Handle<ArrayList> new_array = Handle<ArrayList>::cast(EnsureSpaceInFixedArray(
+      isolate, array, kFirstIndex + length, allocation));
+  DCHECK_EQ(array->Length(), new_array->Length());
+  return new_array;
+}
+
+// static
+Handle<WeakArrayList> WeakArrayList::AddToEnd(Isolate* isolate,
+                                              Handle<WeakArrayList> array,
+                                              MaybeObjectHandle value) {
+  int length = array->length();
+  array = EnsureSpace(isolate, array, length + 1);
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<WeakArrayList> raw = *array;
+    // Reload length; GC might have removed elements from the array.
+    length = raw->length();
+    raw->Set(length, *value);
+    raw->set_length(length + 1);
+  }
+  return array;
+}
+
+Handle<WeakArrayList> WeakArrayList::AddToEnd(Isolate* isolate,
+                                              Handle<WeakArrayList> array,
+                                              MaybeObjectHandle value1,
+                                              Tagged<Smi> value2) {
+  int length = array->length();
+  array = EnsureSpace(isolate, array, length + 2);
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<WeakArrayList> raw = *array;
+    // Reload length; GC might have removed elements from the array.
+    length = array->length();
+    raw->Set(length, *value1);
+    raw->Set(length + 1, value2);
+    raw->set_length(length + 2);
+  }
+  return array;
+}
+
+// static
+Handle<WeakArrayList> WeakArrayList::Append(Isolate* isolate,
+                                            Handle<WeakArrayList> array,
+                                            MaybeObjectHandle value,
+                                            AllocationType allocation) {
+  int length = 0;
+  int new_length = 0;
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<WeakArrayList> raw = *array;
+    length = raw->length();
+
+    if (length < raw->capacity()) {
+      raw->Set(length, *value);
+      raw->set_length(length + 1);
+      return array;
+    }
+
+    // Not enough space in the array left, either grow, shrink or
+    // compact the array.
+    new_length = raw->CountLiveElements() + 1;
+  }
+
+  bool shrink = new_length < length / 4;
+  bool grow = 3 * (length / 4) < new_length;
+
+  if (shrink || grow) {
+    // Grow or shrink array and compact out-of-place.
+    int new_capacity = CapacityForLength(new_length);
+    array = isolate->factory()->CompactWeakArrayList(array, new_capacity,
+                                                     allocation);
+
+  } else {
+    // Perform compaction in the current array.
+    array->Compact(isolate);
+  }
+
+  // Now append value to the array, there should always be enough space now.
+  DCHECK_LT(array->length(), array->capacity());
+
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<WeakArrayList> raw = *array;
+    // Reload length, allocation might have killed some weak refs.
+    int index = raw->length();
+    raw->Set(index, *value);
+    raw->set_length(index + 1);
+  }
+  return array;
+}
+
+void WeakArrayList::Compact(Isolate* isolate) {
+  DisallowGarbageCollection no_gc;
+  int length = this->length();
+  int new_length = 0;
+
+  for (int i = 0; i < length; i++) {
+    MaybeObject value = Get(isolate, i);
+
+    if (!value->IsCleared()) {
+      if (new_length != i) {
+        Set(new_length, value);
+      }
+      ++new_length;
+    }
+  }
+
+  set_length(new_length);
+}
+
+bool WeakArrayList::IsFull() const { return length() == capacity(); }
+
+// static
+Handle<WeakArrayList> WeakArrayList::EnsureSpace(Isolate* isolate,
+                                                 Handle<WeakArrayList> array,
+                                                 int length,
+                                                 AllocationType allocation) {
+  int capacity = array->capacity();
+  if (capacity < length) {
+    int grow_by = CapacityForLength(length) - capacity;
+    array = isolate->factory()->CopyWeakArrayListAndGrow(array, grow_by,
+                                                         allocation);
+  }
+  return array;
+}
+
+int WeakArrayList::CountLiveWeakReferences() const {
+  int live_weak_references = 0;
+  for (int i = 0; i < length(); i++) {
+    if (Get(i)->IsWeak()) {
+      ++live_weak_references;
+    }
+  }
+  return live_weak_references;
+}
+
+int WeakArrayList::CountLiveElements() const {
+  int non_cleared_objects = 0;
+  for (int i = 0; i < length(); i++) {
+    if (!Get(i)->IsCleared()) {
+      ++non_cleared_objects;
+    }
+  }
+  return non_cleared_objects;
+}
+
+bool WeakArrayList::RemoveOne(MaybeObjectHandle value) {
+  int last_index = length() - 1;
+  // Optimize for the most recently added element to be removed again.
+  for (int i = last_index; i >= 0; --i) {
+    if (Get(i) != *value) continue;
+    // Move the last element into this slot (or no-op, if this is the last
+    // slot).
+    Set(i, Get(last_index));
+    Set(last_index, HeapObjectReference::ClearedValue(GetIsolate()));
+    set_length(last_index);
+    return true;
+  }
+  return false;
+}
+
+bool WeakArrayList::Contains(MaybeObject value) {
+  for (int i = 0; i < length(); ++i) {
+    if (Get(i) == value) return true;
+  }
+  return false;
+}
+
+Handle<RegExpMatchInfo> RegExpMatchInfo::New(Isolate* isolate,
+                                             int capture_count) {
+  Handle<RegExpMatchInfo> match_info = isolate->factory()->NewRegExpMatchInfo();
+  return ReserveCaptures(isolate, match_info, capture_count);
+}
+
+Handle<RegExpMatchInfo> RegExpMatchInfo::ReserveCaptures(
+    Isolate* isolate, Handle<RegExpMatchInfo> match_info, int capture_count) {
+  DCHECK_GE(match_info->length(), kLastMatchOverhead);
+
+  int capture_register_count =
+      JSRegExp::RegistersForCaptureCount(capture_count);
+  const int required_length = kFirstCaptureIndex + capture_register_count;
+  Handle<RegExpMatchInfo> result =
+      Handle<RegExpMatchInfo>::cast(EnsureSpaceInFixedArray(
+          isolate, match_info, required_length, AllocationType::kYoung));
+  result->SetNumberOfCaptureRegisters(capture_register_count);
+  return result;
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/objects/fixed-array.h b/deps/v8/src/objects/fixed-array.h
index d3d6edda86877a..1c186c4135c5a9 100644
--- a/deps/v8/src/objects/fixed-array.h
+++ b/deps/v8/src/objects/fixed-array.h
@@ -6,6 +6,7 @@
 #define V8_OBJECTS_FIXED_ARRAY_H_
 
 #include "src/handles/maybe-handles.h"
+#include "src/objects/heap-object.h"
 #include "src/objects/instance-type.h"
 #include "src/objects/objects.h"
 #include "src/objects/smi.h"
@@ -16,54 +17,6 @@
 namespace v8 {
 namespace internal {
 
-#define FIXED_ARRAY_SUB_INSTANCE_TYPE_LIST(V)    \
-  V(BYTECODE_ARRAY_CONSTANT_POOL_SUB_TYPE)       \
-  V(BYTECODE_ARRAY_HANDLER_TABLE_SUB_TYPE)       \
-  V(CODE_STUBS_TABLE_SUB_TYPE)                   \
-  V(COMPILATION_CACHE_TABLE_SUB_TYPE)            \
-  V(CONTEXT_SUB_TYPE)                            \
-  V(COPY_ON_WRITE_SUB_TYPE)                      \
-  V(DEOPTIMIZATION_DATA_SUB_TYPE)                \
-  V(DESCRIPTOR_ARRAY_SUB_TYPE)                   \
-  V(EMBEDDED_OBJECT_SUB_TYPE)                    \
-  V(ENUM_CACHE_SUB_TYPE)                         \
-  V(ENUM_INDICES_CACHE_SUB_TYPE)                 \
-  V(DEPENDENT_CODE_SUB_TYPE)                     \
-  V(DICTIONARY_ELEMENTS_SUB_TYPE)                \
-  V(DICTIONARY_PROPERTIES_SUB_TYPE)              \
-  V(EMPTY_PROPERTIES_DICTIONARY_SUB_TYPE)        \
-  V(PACKED_ELEMENTS_SUB_TYPE)                    \
-  V(FAST_PROPERTIES_SUB_TYPE)                    \
-  V(FAST_TEMPLATE_INSTANTIATIONS_CACHE_SUB_TYPE) \
-  V(HANDLER_TABLE_SUB_TYPE)                      \
-  V(JS_COLLECTION_SUB_TYPE)                      \
-  V(JS_WEAK_COLLECTION_SUB_TYPE)                 \
-  V(NOSCRIPT_SHARED_FUNCTION_INFOS_SUB_TYPE)     \
-  V(NUMBER_STRING_CACHE_SUB_TYPE)                \
-  V(OBJECT_TO_CODE_SUB_TYPE)                     \
-  V(OPTIMIZED_CODE_LITERALS_SUB_TYPE)            \
-  V(OPTIMIZED_CODE_MAP_SUB_TYPE)                 \
-  V(PROTOTYPE_USERS_SUB_TYPE)                    \
-  V(REGEXP_MULTIPLE_CACHE_SUB_TYPE)              \
-  V(RETAINED_MAPS_SUB_TYPE)                      \
-  V(SCOPE_INFO_SUB_TYPE)                         \
-  V(SCRIPT_LIST_SUB_TYPE)                        \
-  V(SERIALIZED_OBJECTS_SUB_TYPE)                 \
-  V(SHARED_FUNCTION_INFOS_SUB_TYPE)              \
-  V(SINGLE_CHARACTER_STRING_TABLE_SUB_TYPE)      \
-  V(SLOW_TEMPLATE_INSTANTIATIONS_CACHE_SUB_TYPE) \
-  V(STRING_SPLIT_CACHE_SUB_TYPE)                 \
-  V(TEMPLATE_INFO_SUB_TYPE)                      \
-  V(FEEDBACK_METADATA_SUB_TYPE)                  \
-  V(WEAK_NEW_SPACE_OBJECT_TO_CODE_SUB_TYPE)
-
-enum FixedArraySubInstanceType {
-#define DEFINE_FIXED_ARRAY_SUB_INSTANCE_TYPE(name) name,
-  FIXED_ARRAY_SUB_INSTANCE_TYPE_LIST(DEFINE_FIXED_ARRAY_SUB_INSTANCE_TYPE)
-#undef DEFINE_FIXED_ARRAY_SUB_INSTANCE_TYPE
-      LAST_FIXED_ARRAY_SUB_TYPE = WEAK_NEW_SPACE_OBJECT_TO_CODE_SUB_TYPE
-};
-
 #include "torque-generated/src/objects/fixed-array-tq.inc"
 
 // Common superclass for FixedArrays that allow implementations to share
@@ -76,7 +29,7 @@ class FixedArrayBase
   using TorqueGeneratedFixedArrayBase::set_length;
   DECL_RELEASE_ACQUIRE_INT_ACCESSORS(length)
 
-  inline Object unchecked_length(AcquireLoadTag) const;
+  inline Tagged<Object> unchecked_length(AcquireLoadTag) const;
 
   static int GetMaxLengthForNewSpaceAllocation(ElementsKind kind);
 
@@ -93,8 +46,6 @@ class FixedArrayBase
 
  protected:
   TQ_OBJECT_CONSTRUCTORS(FixedArrayBase)
-  inline FixedArrayBase(Address ptr,
-                        HeapObject::AllowInlineSmiStorage allow_smi);
 };
 
 // FixedArray describes fixed-sized arrays with element type Object.
@@ -102,10 +53,10 @@ class FixedArray
     : public TorqueGeneratedFixedArray<FixedArray, FixedArrayBase> {
  public:
   // Setter and getter for elements.
-  inline Object get(int index) const;
-  inline Object get(PtrComprCageBase cage_base, int index) const;
+  inline Tagged<Object> get(int index) const;
+  inline Tagged<Object> get(PtrComprCageBase cage_base, int index) const;
 
-  static inline Handle<Object> get(FixedArray array, int index,
+  static inline Handle<Object> get(Tagged<FixedArray> array, int index,
                                    Isolate* isolate);
 
   // Return a grown copy if the index is bigger than the array's length.
@@ -114,43 +65,47 @@ class FixedArray
       Handle<Object> value);
 
   // Relaxed accessors.
-  inline Object get(int index, RelaxedLoadTag) const;
-  inline Object get(PtrComprCageBase cage_base, int index,
-                    RelaxedLoadTag) const;
-  inline void set(int index, Object value, RelaxedStoreTag,
+  inline Tagged<Object> get(int index, RelaxedLoadTag) const;
+  inline Tagged<Object> get(PtrComprCageBase cage_base, int index,
+                            RelaxedLoadTag) const;
+  inline void set(int index, Tagged<Object> value, RelaxedStoreTag,
                   WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void set(int index, Smi value, RelaxedStoreTag);
+  inline void set(int index, Tagged<Smi> value, RelaxedStoreTag);
 
   // SeqCst accessors.
-  inline Object get(int index, SeqCstAccessTag) const;
-  inline Object get(PtrComprCageBase cage_base, int index,
-                    SeqCstAccessTag) const;
-  inline void set(int index, Object value, SeqCstAccessTag,
+  inline Tagged<Object> get(int index, SeqCstAccessTag) const;
+  inline Tagged<Object> get(PtrComprCageBase cage_base, int index,
+                            SeqCstAccessTag) const;
+  inline void set(int index, Tagged<Object> value, SeqCstAccessTag,
                   WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void set(int index, Smi value, SeqCstAccessTag);
+  inline void set(int index, Tagged<Smi> value, SeqCstAccessTag);
 
   // Acquire/release accessors.
-  inline Object get(int index, AcquireLoadTag) const;
-  inline Object get(PtrComprCageBase cage_base, int index,
-                    AcquireLoadTag) const;
-  inline void set(int index, Object value, ReleaseStoreTag,
+  inline Tagged<Object> get(int index, AcquireLoadTag) const;
+  inline Tagged<Object> get(PtrComprCageBase cage_base, int index,
+                            AcquireLoadTag) const;
+  inline void set(int index, Tagged<Object> value, ReleaseStoreTag,
                   WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void set(int index, Smi value, ReleaseStoreTag);
+  inline void set(int index, Tagged<Smi> value, ReleaseStoreTag);
 
   // Setter that uses write barrier.
-  inline void set(int index, Object value);
+  inline void set(int index, Tagged<Object> value);
   inline bool is_the_hole(Isolate* isolate, int index);
 
   // Setter that doesn't need write barrier.
-  inline void set(int index, Smi value);
+  inline void set(int index, Tagged<Smi> value);
   // Setter with explicit barrier mode.
-  inline void set(int index, Object value, WriteBarrierMode mode);
+  inline void set(int index, Tagged<Object> value, WriteBarrierMode mode);
 
   // Atomic swap that doesn't need write barrier.
-  inline Object swap(int index, Smi value, SeqCstAccessTag);
+  inline Tagged<Object> swap(int index, Tagged<Smi> value, SeqCstAccessTag);
   // Atomic swap with explicit barrier mode.
-  inline Object swap(int index, Object value, SeqCstAccessTag,
-                     WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
+  inline Tagged<Object> swap(int index, Tagged<Object> value, SeqCstAccessTag,
+                             WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
+
+  inline Tagged<Object> compare_and_swap(
+      int index, Tagged<Object> expected, Tagged<Object> value, SeqCstAccessTag,
+      WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   // Setters for frequently used oddballs located in old space.
   inline void set_undefined(int index);
@@ -172,8 +127,9 @@ class FixedArray
   inline void MoveElements(Isolate* isolate, int dst_index, int src_index,
                            int len, WriteBarrierMode mode);
 
-  inline void CopyElements(Isolate* isolate, int dst_index, FixedArray src,
-                           int src_index, int len, WriteBarrierMode mode);
+  inline void CopyElements(Isolate* isolate, int dst_index,
+                           Tagged<FixedArray> src, int src_index, int len,
+                           WriteBarrierMode mode);
 
   inline void FillWithHoles(int from, int to);
 
@@ -186,7 +142,7 @@ class FixedArray
                                           int new_length);
 
   // Copy a sub array from the receiver to dest.
-  V8_EXPORT_PRIVATE void CopyTo(int pos, FixedArray dest, int dest_pos,
+  V8_EXPORT_PRIVATE void CopyTo(int pos, Tagged<FixedArray> dest, int dest_pos,
                                 int len) const;
 
   // Garbage collection support.
@@ -226,8 +182,8 @@ class FixedArray
  protected:
   // Set operation on FixedArray without using write barriers. Can
   // only be used for storing old space objects or smis.
-  static inline void NoWriteBarrierSet(FixedArray array, int index,
-                                       Object value);
+  static inline void NoWriteBarrierSet(Tagged<FixedArray> array, int index,
+                                       Tagged<Object> value);
 
  private:
   static_assert(kHeaderSize == Internals::kFixedArrayHeaderSize);
@@ -247,7 +203,7 @@ class FixedDoubleArray
   // Setter and getter for elements.
   inline double get_scalar(int index);
   inline uint64_t get_representation(int index);
-  static inline Handle<Object> get(FixedDoubleArray array, int index,
+  static inline Handle<Object> get(Tagged<FixedDoubleArray> array, int index,
                                    Isolate* isolate);
   inline void set(int index, double value);
   inline void set_the_hole(Isolate* isolate, int index);
@@ -313,8 +269,9 @@ class WeakFixedArray
 
   inline MaybeObjectSlot RawFieldOfElementAt(int index);
 
-  inline void CopyElements(Isolate* isolate, int dst_index, WeakFixedArray src,
-                           int src_index, int len, WriteBarrierMode mode);
+  inline void CopyElements(Isolate* isolate, int dst_index,
+                           Tagged<WeakFixedArray> src, int src_index, int len,
+                           WriteBarrierMode mode);
 
   DECL_PRINTER(WeakFixedArray)
   DECL_VERIFIER(WeakFixedArray)
@@ -353,21 +310,19 @@ class WeakArrayList
   DECL_PRINTER(WeakArrayList)
 
   V8_EXPORT_PRIVATE static Handle<WeakArrayList> AddToEnd(
-      Isolate* isolate, Handle<WeakArrayList> array,
-      const MaybeObjectHandle& value);
+      Isolate* isolate, Handle<WeakArrayList> array, MaybeObjectHandle value);
 
   // A version that adds to elements. This ensures that the elements are
   // inserted atomically w.r.t GC.
   V8_EXPORT_PRIVATE static Handle<WeakArrayList> AddToEnd(
-      Isolate* isolate, Handle<WeakArrayList> array,
-      const MaybeObjectHandle& value1, const MaybeObjectHandle& value2);
+      Isolate* isolate, Handle<WeakArrayList> array, MaybeObjectHandle value1,
+      Tagged<Smi> value2);
 
   // Appends an element to the array and possibly compacts and shrinks live weak
   // references to the start of the collection. Only use this method when
   // indices to elements can change.
   static Handle<WeakArrayList> Append(
-      Isolate* isolate, Handle<WeakArrayList> array,
-      const MaybeObjectHandle& value,
+      Isolate* isolate, Handle<WeakArrayList> array, MaybeObjectHandle value,
       AllocationType allocation = AllocationType::kYoung);
 
   // Compact weak references to the beginning of the array.
@@ -381,7 +336,7 @@ class WeakArrayList
   // instead.
   inline void Set(int index, MaybeObject value,
                   WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void Set(int index, Smi value);
+  inline void Set(int index, Tagged<Smi> value);
 
   static constexpr int SizeForCapacity(int capacity) {
     return SizeFor(capacity);
@@ -394,8 +349,9 @@ class WeakArrayList
   // Gives access to raw memory which stores the array's data.
   inline MaybeObjectSlot data_start();
 
-  inline void CopyElements(Isolate* isolate, int dst_index, WeakArrayList src,
-                           int src_index, int len, WriteBarrierMode mode);
+  inline void CopyElements(Isolate* isolate, int dst_index,
+                           Tagged<WeakArrayList> src, int src_index, int len,
+                           WriteBarrierMode mode);
 
   V8_EXPORT_PRIVATE bool IsFull() const;
 
@@ -420,7 +376,7 @@ class WeakArrayList
   // around in the array - this method can only be used in cases where the user
   // doesn't care about the indices! Users should make sure there are no
   // duplicates.
-  V8_EXPORT_PRIVATE bool RemoveOne(const MaybeObjectHandle& value);
+  V8_EXPORT_PRIVATE bool RemoveOne(MaybeObjectHandle value);
 
   // Searches the array (linear time) and returns whether it contains the value.
   V8_EXPORT_PRIVATE bool Contains(MaybeObject value);
@@ -437,11 +393,11 @@ class WeakArrayList
 
 class WeakArrayList::Iterator {
  public:
-  explicit Iterator(WeakArrayList array) : index_(0), array_(array) {}
+  explicit Iterator(Tagged<WeakArrayList> array) : index_(0), array_(array) {}
   Iterator(const Iterator&) = delete;
   Iterator& operator=(const Iterator&) = delete;
 
-  inline HeapObject Next();
+  inline Tagged<HeapObject> Next();
 
  private:
   int index_;
@@ -467,12 +423,13 @@ class ArrayList : public TorqueGeneratedArrayList<ArrayList, FixedArray> {
                                                  Handle<Object> obj2);
   V8_EXPORT_PRIVATE static Handle<ArrayList> Add(Isolate* isolate,
                                                  Handle<ArrayList> array,
-                                                 Smi obj1);
-  V8_EXPORT_PRIVATE static Handle<ArrayList> Add(Isolate* isolate,
-                                                 Handle<ArrayList> array,
-                                                 Handle<Object> obj1, Smi obj2,
-                                                 Smi obj3, Smi obj4);
-  static Handle<ArrayList> New(Isolate* isolate, int size);
+                                                 Tagged<Smi> obj1);
+  V8_EXPORT_PRIVATE static Handle<ArrayList> Add(
+      Isolate* isolate, Handle<ArrayList> array, Handle<Object> obj1,
+      Tagged<Smi> obj2, Tagged<Smi> obj3, Tagged<Smi> obj4);
+  V8_EXPORT_PRIVATE static Handle<ArrayList> New(
+      Isolate* isolate, int size,
+      AllocationType allocation = AllocationType::kOld);
 
   // Returns the number of elements in the list, not the allocated size, which
   // is length(). Lower and upper case length() return different results!
@@ -481,23 +438,24 @@ class ArrayList : public TorqueGeneratedArrayList<ArrayList, FixedArray> {
   // Sets the Length() as used by Elements(). Does not change the underlying
   // storage capacity, i.e., length().
   inline void SetLength(int length);
-  inline Object Get(int index) const;
-  inline Object Get(PtrComprCageBase cage_base, int index) const;
+  inline Tagged<Object> Get(int index) const;
+  inline Tagged<Object> Get(PtrComprCageBase cage_base, int index) const;
   inline ObjectSlot Slot(int index);
 
   // Set the element at index to obj. The underlying array must be large enough.
   // If you need to grow the ArrayList, use the static Add() methods instead.
-  inline void Set(int index, Object obj,
+  inline void Set(int index, Tagged<Object> obj,
                   WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
-  inline void Set(int index, Smi obj);
+  inline void Set(int index, Tagged<Smi> obj);
 
   // Set the element at index to undefined. This does not change the Length().
-  inline void Clear(int index, Object undefined);
+  inline void Clear(int index, Tagged<Object> undefined);
 
   // Return a copy of the list of size Length() without the first entry. The
   // number returned by Length() is stored in the first entry.
-  static Handle<FixedArray> Elements(Isolate* isolate, Handle<ArrayList> array);
+  V8_EXPORT_PRIVATE static Handle<FixedArray> Elements(Isolate* isolate,
+                                                       Handle<ArrayList> array);
 
   static const int kHeaderFields = 1;
 
@@ -517,7 +475,7 @@ class ArrayList : public TorqueGeneratedArrayList<ArrayList, FixedArray> {
 enum SearchMode { ALL_ENTRIES, VALID_ENTRIES };
 
 template <SearchMode search_mode, typename T>
-inline int Search(T* array, Name name, int valid_entries = 0,
+inline int Search(T* array, Tagged<Name> name, int valid_entries = 0,
                   int* out_insertion_index = nullptr,
                   bool concurrent_search = false);
 
@@ -528,18 +486,15 @@ class ByteArray : public TorqueGeneratedByteArray<ByteArray, FixedArrayBase> {
   inline int Size();
 
   // Get/set the contents of this array.
-  inline byte get(int offset) const;
-  inline void set(int offset, byte value);
+  inline uint8_t get(int offset) const;
+  inline void set(int offset, uint8_t value);
 
   inline int get_int(int offset) const;
   inline void set_int(int offset, int value);
 
-  inline Address get_sandboxed_pointer(int offset) const;
-  inline void set_sandboxed_pointer(int offset, Address value);
-
   // Copy in / copy out whole byte slices.
-  inline void copy_out(int index, byte* buffer, int slice_length);
-  inline void copy_in(int index, const byte* buffer, int slice_length);
+  inline void copy_out(int index, uint8_t* buffer, int slice_length);
+  inline void copy_in(int index, const uint8_t* buffer, int slice_length);
 
   // Clear uninitialized padding space. This ensures that the snapshot content
   // is deterministic.
@@ -559,14 +514,14 @@ class ByteArray : public TorqueGeneratedByteArray<ByteArray, FixedArrayBase> {
   }
 
   // Returns data start address.
-  inline byte* GetDataStartAddress();
+  inline uint8_t* GetDataStartAddress();
   // Returns address of the past-the-end element.
-  inline byte* GetDataEndAddress();
+  inline uint8_t* GetDataEndAddress();
 
   inline int DataSize() const;
 
   // Returns a pointer to the ByteArray object for a given data start address.
-  static inline ByteArray FromDataStartAddress(Address address);
+  static inline Tagged<ByteArray> FromDataStartAddress(Address address);
 
   // Code Generation support.
   static int OffsetOfElementAt(int index) { return kHeaderSize + index; }
@@ -586,7 +541,6 @@ class ByteArray : public TorqueGeneratedByteArray<ByteArray, FixedArrayBase> {
 
  protected:
   TQ_OBJECT_CONSTRUCTORS(ByteArray)
-  inline ByteArray(Address ptr, HeapObject::AllowInlineSmiStorage allow_smi);
 };
 
 // Convenience class for treating a ByteArray as array of fixed-size integers.
@@ -623,10 +577,64 @@ using FixedInt32Array = FixedIntegerArray<int32_t>;
 using FixedUInt32Array = FixedIntegerArray<uint32_t>;
 using FixedInt64Array = FixedIntegerArray<int64_t>;
 using FixedUInt64Array = FixedIntegerArray<uint64_t>;
+
 // Use with care! Raw addresses on the heap are not safe in combination with
-// the sandbox. However, this can for example be used to store sandboxed
-// pointers, which is safe.
-using FixedAddressArray = FixedIntegerArray<Address>;
+// the sandbox. Use an ExternalPointerArray instead. However, this can for
+// example be used to store sandboxed pointers, which is safe.
+class FixedAddressArray : public FixedIntegerArray<Address> {
+ public:
+  // Get/set a sandboxed pointer from this array.
+  inline Address get_sandboxed_pointer(int offset) const;
+  inline void set_sandboxed_pointer(int offset, Address value);
+
+  static inline Handle<FixedAddressArray> New(
+      Isolate* isolate, int length,
+      AllocationType allocation = AllocationType::kYoung);
+
+  DECL_CAST(FixedAddressArray)
+
+  OBJECT_CONSTRUCTORS(FixedAddressArray, FixedIntegerArray<Address>);
+};
+
+// An array containing external pointers.
+// When the sandbox is off, this will simply contain system-pointer sized words.
+// Otherwise, it contains external pointer handles, i.e. indices into the
+// external pointer table.
+// This class uses lazily-initialized external pointer slots. As such, its
+// content can simply be zero-initialized, and the external pointer table
+// entries are only allocated when an element is written to for the first time.
+class ExternalPointerArray
+    : public TorqueGeneratedExternalPointerArray<ExternalPointerArray,
+                                                 FixedArrayBase> {
+ public:
+  template <ExternalPointerTag tag>
+  inline Address get(int index, Isolate* isolate);
+  template <ExternalPointerTag tag>
+  inline void set(int index, Isolate* isolate, Address value);
+  inline void clear(int index);
+
+  static inline Handle<ExternalPointerArray> New(
+      Isolate* isolate, int length,
+      AllocationType allocation = AllocationType::kYoung);
+
+  static constexpr int SizeFor(int length) {
+    return kHeaderSize + length * kExternalPointerSlotSize;
+  }
+
+  static constexpr int OffsetOfElementAt(int index) {
+    return kHeaderSize + index * kExternalPointerSlotSize;
+  }
+
+  // Maximal length of a single ExternalPointerArray.
+  static const int kMaxLength = kMaxSize - kHeaderSize;
+  static_assert(Internals::IsValidSmi(kMaxLength),
+                "ExternalPointerArray maxLength not a Smi");
+
+  class BodyDescriptor;
+
+ protected:
+  TQ_OBJECT_CONSTRUCTORS(ExternalPointerArray)
+};
 
 // Wrapper class for ByteArray which can store arbitrary C++ classes, as long
 // as they can be copied with memcpy.
@@ -636,13 +644,16 @@ class PodArray : public ByteArray {
   static Handle<PodArray<T>> New(
       Isolate* isolate, int length,
       AllocationType allocation = AllocationType::kYoung);
+  static Handle<PodArray<T>> New(LocalIsolate* isolate, int length);
+
   void copy_out(int index, T* result, int length) {
-    ByteArray::copy_out(index * sizeof(T), reinterpret_cast<byte*>(result),
+    ByteArray::copy_out(index * sizeof(T), reinterpret_cast<uint8_t*>(result),
                         length * sizeof(T));
   }
 
   void copy_in(int index, const T* buffer, int length) {
-    ByteArray::copy_in(index * sizeof(T), reinterpret_cast<const byte*>(buffer),
+    ByteArray::copy_in(index * sizeof(T),
+                       reinterpret_cast<const uint8_t*>(buffer),
                        length * sizeof(T));
   }
 
@@ -677,9 +688,9 @@ class TemplateList
  public:
   static Handle<TemplateList> New(Isolate* isolate, int size);
   inline int length() const;
-  inline Object get(int index) const;
-  inline Object get(PtrComprCageBase cage_base, int index) const;
-  inline void set(int index, Object value);
+  inline Tagged<Object> get(int index) const;
+  inline Tagged<Object> get(PtrComprCageBase cage_base, int index) const;
+  inline void set(int index, Tagged<Object> value);
   static Handle<TemplateList> Add(Isolate* isolate, Handle<TemplateList> list,
                                   Handle<Object> value);
  private:
diff --git a/deps/v8/src/objects/fixed-array.tq b/deps/v8/src/objects/fixed-array.tq
index 22d261e9e7e5bd..adb27ebe1a2b46 100644
--- a/deps/v8/src/objects/fixed-array.tq
+++ b/deps/v8/src/objects/fixed-array.tq
@@ -29,15 +29,19 @@ extern class ByteArray extends FixedArrayBase {
   bytes[length]: uint8;
 }
 
+extern class ExternalPointerArray extends FixedArrayBase {
+  pointers[length]: ExternalPointer;
+}
+
+extern macro CodeStubAssembler::AllocateByteArray(uintptr): ByteArray;
+
 @hasSameInstanceTypeAsParent
 @doNotGenerateCast
-extern class ArrayList extends FixedArray {
-}
+extern class ArrayList extends FixedArray {}
 
 @hasSameInstanceTypeAsParent
 @doNotGenerateCast
-extern class TemplateList extends FixedArray {
-}
+extern class TemplateList extends FixedArray {}
 
 @generateBodyDescriptor
 extern class WeakArrayList extends HeapObject {
@@ -95,7 +99,8 @@ operator '[]=' macro StoreFixedArrayDirect(
     a: FixedArray, i: Smi, v: Object): void {
   a.objects[i] = v;
 }
-
+extern macro AllocateFixedArray(
+    constexpr ElementsKind, intptr): FixedArrayBase;
 extern macro AllocateFixedArray(
     constexpr ElementsKind, intptr, constexpr AllocationFlag): FixedArrayBase;
 
@@ -109,8 +114,10 @@ extern macro FillFixedArrayWithSmiZero(
 extern macro FillFixedDoubleArrayWithZero(
     FixedDoubleArray, intptr, intptr): void;
 
+extern macro AllocateFixedArrayWithHoles(intptr): FixedArray;
 extern macro AllocateFixedArrayWithHoles(
     intptr, constexpr AllocationFlag): FixedArray;
+extern macro AllocateFixedDoubleArrayWithHoles(intptr): FixedDoubleArray;
 extern macro AllocateFixedDoubleArrayWithHoles(
     intptr, constexpr AllocationFlag): FixedDoubleArray;
 extern macro CopyFixedArrayElements(
@@ -145,7 +152,8 @@ namespace runtime {
 extern runtime FatalProcessOutOfMemoryInvalidArrayLength(NoContext): never;
 }
 
-macro NewFixedArray<Iterator: type>(length: intptr, it: Iterator): FixedArray {
+macro NewFixedArray<Iterator: type>(
+    length: intptr, it: Iterator): FixedArray {
   if (length == 0) return kEmptyFixedArray;
   if (length > kFixedArrayMaxLength) deferred {
       runtime::FatalProcessOutOfMemoryInvalidArrayLength(kNoContext);
diff --git a/deps/v8/src/objects/free-space-inl.h b/deps/v8/src/objects/free-space-inl.h
index f6aa1fde887293..d250ffb7717aa6 100644
--- a/deps/v8/src/objects/free-space-inl.h
+++ b/deps/v8/src/objects/free-space-inl.h
@@ -25,7 +25,7 @@ RELAXED_SMI_ACCESSORS(FreeSpace, size, kSizeOffset)
 
 int FreeSpace::Size() { return size(kRelaxedLoad); }
 
-FreeSpace FreeSpace::next() const {
+Tagged<FreeSpace> FreeSpace::next() const {
   DCHECK(IsValid());
 #ifdef V8_EXTERNAL_CODE_SPACE
   intptr_t diff_to_next =
@@ -41,7 +41,7 @@ FreeSpace FreeSpace::next() const {
 #endif  // V8_EXTERNAL_CODE_SPACE
 }
 
-void FreeSpace::set_next(FreeSpace next) {
+void FreeSpace::set_next(Tagged<FreeSpace> next) {
   DCHECK(IsValid());
 #ifdef V8_EXTERNAL_CODE_SPACE
   if (next.is_null()) {
@@ -57,19 +57,19 @@ void FreeSpace::set_next(FreeSpace next) {
 #endif  // V8_EXTERNAL_CODE_SPACE
 }
 
-FreeSpace FreeSpace::cast(HeapObject o) {
+Tagged<FreeSpace> FreeSpace::cast(Tagged<HeapObject> o) {
   SLOW_DCHECK((!GetHeapFromWritableObject(o)->deserialization_complete()) ||
-              o.IsFreeSpace());
+              IsFreeSpace(o));
   return base::bit_cast<FreeSpace>(o);
 }
 
-FreeSpace FreeSpace::unchecked_cast(const Object o) {
+Tagged<FreeSpace> FreeSpace::unchecked_cast(const Tagged<Object> o) {
   return base::bit_cast<FreeSpace>(o);
 }
 
 bool FreeSpace::IsValid() const {
   Heap* heap = GetHeapFromWritableObject(*this);
-  Object free_space_map =
+  Tagged<Object> free_space_map =
       Isolate::FromHeap(heap)->root(RootIndex::kFreeSpaceMap);
   CHECK(!heap->deserialization_complete() ||
         map_slot().contains_map_value(free_space_map.ptr()));
diff --git a/deps/v8/src/objects/free-space.h b/deps/v8/src/objects/free-space.h
index c9ee47cc8fa73f..cb54915600d7e6 100644
--- a/deps/v8/src/objects/free-space.h
+++ b/deps/v8/src/objects/free-space.h
@@ -38,11 +38,11 @@ class FreeSpace : public TorqueGeneratedFreeSpace<FreeSpace, HeapObject> {
   inline int Size();
 
   // Accessors for the next field.
-  inline FreeSpace next() const;
-  inline void set_next(FreeSpace next);
+  inline Tagged<FreeSpace> next() const;
+  inline void set_next(Tagged<FreeSpace> next);
 
-  inline static FreeSpace cast(HeapObject obj);
-  inline static FreeSpace unchecked_cast(const Object obj);
+  inline static Tagged<FreeSpace> cast(Tagged<HeapObject> obj);
+  inline static Tagged<FreeSpace> unchecked_cast(const Tagged<Object> obj);
 
   // Dispatched behavior.
   DECL_PRINTER(FreeSpace)
diff --git a/deps/v8/src/objects/hash-table-inl.h b/deps/v8/src/objects/hash-table-inl.h
index f47404c575b849..82f0814c7b4a4d 100644
--- a/deps/v8/src/objects/hash-table-inl.h
+++ b/deps/v8/src/objects/hash-table-inl.h
@@ -23,7 +23,7 @@ OBJECT_CONSTRUCTORS_IMPL(HashTableBase, FixedArray)
 
 template <typename Derived, typename Shape>
 HashTable<Derived, Shape>::HashTable(Address ptr) : HashTableBase(ptr) {
-  SLOW_DCHECK(IsHashTable());
+  SLOW_DCHECK(IsHashTable(*this));
 }
 
 template <typename Derived, typename Shape>
@@ -32,27 +32,27 @@ ObjectHashTableBase<Derived, Shape>::ObjectHashTableBase(Address ptr)
 
 ObjectHashTable::ObjectHashTable(Address ptr)
     : ObjectHashTableBase<ObjectHashTable, ObjectHashTableShape>(ptr) {
-  SLOW_DCHECK(IsObjectHashTable());
+  SLOW_DCHECK(IsObjectHashTable(*this));
 }
 
 RegisteredSymbolTable::RegisteredSymbolTable(Address ptr)
     : HashTable<RegisteredSymbolTable, RegisteredSymbolTableShape>(ptr) {
-  SLOW_DCHECK(IsRegisteredSymbolTable());
+  SLOW_DCHECK(IsRegisteredSymbolTable(*this));
 }
 
 EphemeronHashTable::EphemeronHashTable(Address ptr)
     : ObjectHashTableBase<EphemeronHashTable, ObjectHashTableShape>(ptr) {
-  SLOW_DCHECK(IsEphemeronHashTable());
+  SLOW_DCHECK(IsEphemeronHashTable(*this));
 }
 
 ObjectHashSet::ObjectHashSet(Address ptr)
     : HashTable<ObjectHashSet, ObjectHashSetShape>(ptr) {
-  SLOW_DCHECK(IsObjectHashSet());
+  SLOW_DCHECK(IsObjectHashSet(*this));
 }
 
 NameToIndexHashTable::NameToIndexHashTable(Address ptr)
     : HashTable<NameToIndexHashTable, NameToIndexShape>(ptr) {
-  SLOW_DCHECK(IsNameToIndexHashTable());
+  SLOW_DCHECK(IsNameToIndexHashTable(*this));
 }
 
 template <typename Derived, int N>
@@ -61,7 +61,7 @@ ObjectMultiHashTableBase<Derived, N>::ObjectMultiHashTableBase(Address ptr)
 
 ObjectTwoHashTable::ObjectTwoHashTable(Address ptr)
     : ObjectMultiHashTableBase<ObjectTwoHashTable, 2>(ptr) {
-  SLOW_DCHECK(IsObjectTwoHashTable());
+  SLOW_DCHECK(IsObjectTwoHashTable(*this));
 }
 
 CAST_ACCESSOR(ObjectHashTable)
@@ -71,9 +71,9 @@ CAST_ACCESSOR(ObjectHashSet)
 CAST_ACCESSOR(NameToIndexHashTable)
 CAST_ACCESSOR(ObjectTwoHashTable)
 
-void EphemeronHashTable::set_key(int index, Object value) {
+void EphemeronHashTable::set_key(int index, Tagged<Object> value) {
   DCHECK_NE(GetReadOnlyRoots().fixed_cow_array_map(), map());
-  DCHECK(IsEphemeronHashTable());
+  DCHECK(IsEphemeronHashTable(*this));
   DCHECK_GE(index, 0);
   DCHECK_LT(index, this->length());
   int offset = kHeaderSize + index * kTaggedSize;
@@ -81,10 +81,10 @@ void EphemeronHashTable::set_key(int index, Object value) {
   EPHEMERON_KEY_WRITE_BARRIER(*this, offset, value);
 }
 
-void EphemeronHashTable::set_key(int index, Object value,
+void EphemeronHashTable::set_key(int index, Tagged<Object> value,
                                  WriteBarrierMode mode) {
   DCHECK_NE(GetReadOnlyRoots().fixed_cow_array_map(), map());
-  DCHECK(IsEphemeronHashTable());
+  DCHECK(IsEphemeronHashTable(*this));
   DCHECK_GE(index, 0);
   DCHECK_LT(index, this->length());
   int offset = kHeaderSize + index * kTaggedSize;
@@ -181,13 +181,13 @@ InternalIndex HashTable<Derived, Shape>::FindEntry(PtrComprCageBase cage_base,
   DisallowGarbageCollection no_gc;
   uint32_t capacity = Capacity();
   uint32_t count = 1;
-  Object undefined = roots.undefined_value();
-  Object the_hole = roots.the_hole_value();
+  Tagged<Object> undefined = roots.undefined_value();
+  Tagged<Object> the_hole = roots.the_hole_value();
   DCHECK_EQ(Shape::Hash(roots, key), static_cast<uint32_t>(hash));
   // EnsureCapacity will guarantee the hash table is never full.
   for (InternalIndex entry = FirstProbe(hash, capacity);;
        entry = NextProbe(entry, count++, capacity)) {
-    Object element = KeyAt(cage_base, entry);
+    Tagged<Object> element = KeyAt(cage_base, entry);
     // Empty entry. Uses raw unchecked accessors because it is called by the
     // string table during bootstrapping.
     if (element == undefined) return InternalIndex::NotFound();
@@ -205,7 +205,7 @@ InternalIndex HashTable<Derived, Shape>::FindInsertionEntry(IsolateT* isolate,
 
 // static
 template <typename Derived, typename Shape>
-bool HashTable<Derived, Shape>::IsKey(ReadOnlyRoots roots, Object k) {
+bool HashTable<Derived, Shape>::IsKey(ReadOnlyRoots roots, Tagged<Object> k) {
   // TODO(leszeks): Dictionaries that don't delete could skip the hole check.
   return k != roots.unchecked_undefined_value() &&
          k != roots.unchecked_the_hole_value();
@@ -213,8 +213,8 @@ bool HashTable<Derived, Shape>::IsKey(ReadOnlyRoots roots, Object k) {
 
 template <typename Derived, typename Shape>
 bool HashTable<Derived, Shape>::ToKey(ReadOnlyRoots roots, InternalIndex entry,
-                                      Object* out_k) {
-  Object k = KeyAt(entry);
+                                      Tagged<Object>* out_k) {
+  Tagged<Object> k = KeyAt(entry);
   if (!IsKey(roots, k)) return false;
   *out_k = Shape::Unwrap(k);
   return true;
@@ -222,55 +222,57 @@ bool HashTable<Derived, Shape>::ToKey(ReadOnlyRoots roots, InternalIndex entry,
 
 template <typename Derived, typename Shape>
 bool HashTable<Derived, Shape>::ToKey(PtrComprCageBase cage_base,
-                                      InternalIndex entry, Object* out_k) {
-  Object k = KeyAt(cage_base, entry);
+                                      InternalIndex entry,
+                                      Tagged<Object>* out_k) {
+  Tagged<Object> k = KeyAt(cage_base, entry);
   if (!IsKey(GetReadOnlyRoots(cage_base), k)) return false;
   *out_k = Shape::Unwrap(k);
   return true;
 }
 
 template <typename Derived, typename Shape>
-Object HashTable<Derived, Shape>::KeyAt(InternalIndex entry) {
+Tagged<Object> HashTable<Derived, Shape>::KeyAt(InternalIndex entry) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return KeyAt(cage_base, entry);
 }
 
 template <typename Derived, typename Shape>
-Object HashTable<Derived, Shape>::KeyAt(PtrComprCageBase cage_base,
-                                        InternalIndex entry) {
+Tagged<Object> HashTable<Derived, Shape>::KeyAt(PtrComprCageBase cage_base,
+                                                InternalIndex entry) {
   return get(cage_base, EntryToIndex(entry) + kEntryKeyIndex);
 }
 
 template <typename Derived, typename Shape>
-Object HashTable<Derived, Shape>::KeyAt(InternalIndex entry,
-                                        RelaxedLoadTag tag) {
+Tagged<Object> HashTable<Derived, Shape>::KeyAt(InternalIndex entry,
+                                                RelaxedLoadTag tag) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return KeyAt(cage_base, entry, tag);
 }
 
 template <typename Derived, typename Shape>
-Object HashTable<Derived, Shape>::KeyAt(PtrComprCageBase cage_base,
-                                        InternalIndex entry,
-                                        RelaxedLoadTag tag) {
+Tagged<Object> HashTable<Derived, Shape>::KeyAt(PtrComprCageBase cage_base,
+                                                InternalIndex entry,
+                                                RelaxedLoadTag tag) {
   return get(cage_base, EntryToIndex(entry) + kEntryKeyIndex, tag);
 }
 
 template <typename Derived, typename Shape>
-void HashTable<Derived, Shape>::SetKeyAt(InternalIndex entry, Object value,
+void HashTable<Derived, Shape>::SetKeyAt(InternalIndex entry,
+                                         Tagged<Object> value,
                                          WriteBarrierMode mode) {
   set_key(EntryToIndex(entry), value, mode);
 }
 
 template <typename Derived, typename Shape>
-void HashTable<Derived, Shape>::set_key(int index, Object value) {
-  DCHECK(!IsEphemeronHashTable());
+void HashTable<Derived, Shape>::set_key(int index, Tagged<Object> value) {
+  DCHECK(!IsEphemeronHashTable(*this));
   FixedArray::set(index, value);
 }
 
 template <typename Derived, typename Shape>
-void HashTable<Derived, Shape>::set_key(int index, Object value,
+void HashTable<Derived, Shape>::set_key(int index, Tagged<Object> value,
                                         WriteBarrierMode mode) {
-  DCHECK(!IsEphemeronHashTable());
+  DCHECK(!IsEphemeronHashTable(*this));
   FixedArray::set(index, value, mode);
 }
 
@@ -289,18 +291,19 @@ bool ObjectHashSet::Has(Isolate* isolate, Handle<Object> key, int32_t hash) {
 }
 
 bool ObjectHashSet::Has(Isolate* isolate, Handle<Object> key) {
-  Object hash = key->GetHash();
-  if (!hash.IsSmi()) return false;
+  Tagged<Object> hash = Object::GetHash(*key);
+  if (!IsSmi(hash)) return false;
   return FindEntry(isolate, ReadOnlyRoots(isolate), key, Smi::ToInt(hash))
       .is_found();
 }
 
-bool ObjectHashTableShape::IsMatch(Handle<Object> key, Object other) {
-  return key->SameValue(other);
+bool ObjectHashTableShape::IsMatch(Handle<Object> key, Tagged<Object> other) {
+  return Object::SameValue(*key, other);
 }
 
-bool RegisteredSymbolTableShape::IsMatch(Handle<String> key, Object value) {
-  DCHECK(value.IsString());
+bool RegisteredSymbolTableShape::IsMatch(Handle<String> key,
+                                         Tagged<Object> value) {
+  DCHECK(IsString(value));
   return key->Equals(String::cast(value));
 }
 
@@ -310,16 +313,17 @@ uint32_t RegisteredSymbolTableShape::Hash(ReadOnlyRoots roots,
 }
 
 uint32_t RegisteredSymbolTableShape::HashForObject(ReadOnlyRoots roots,
-                                                   Object object) {
-  return String::cast(object).EnsureHash();
+                                                   Tagged<Object> object) {
+  return String::cast(object)->EnsureHash();
 }
 
-bool NameToIndexShape::IsMatch(Handle<Name> key, Object other) {
+bool NameToIndexShape::IsMatch(Handle<Name> key, Tagged<Object> other) {
   return *key == other;
 }
 
-uint32_t NameToIndexShape::HashForObject(ReadOnlyRoots roots, Object other) {
-  return Name::cast(other).hash();
+uint32_t NameToIndexShape::HashForObject(ReadOnlyRoots roots,
+                                         Tagged<Object> other) {
+  return Name::cast(other)->hash();
 }
 
 uint32_t NameToIndexShape::Hash(ReadOnlyRoots roots, Handle<Name> key) {
@@ -327,12 +331,12 @@ uint32_t NameToIndexShape::Hash(ReadOnlyRoots roots, Handle<Name> key) {
 }
 
 uint32_t ObjectHashTableShape::Hash(ReadOnlyRoots roots, Handle<Object> key) {
-  return Smi::ToInt(key->GetHash());
+  return Smi::ToInt(Object::GetHash(*key));
 }
 
 uint32_t ObjectHashTableShape::HashForObject(ReadOnlyRoots roots,
-                                             Object other) {
-  return Smi::ToInt(other.GetHash());
+                                             Tagged<Object> other) {
+  return Smi::ToInt(Object::GetHash(other));
 }
 
 template <typename IsolateT>
@@ -345,12 +349,12 @@ Handle<NameToIndexHashTable> NameToIndexHashTable::Add(
   // Check whether the dictionary should be extended.
   table = EnsureCapacity(isolate, table);
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
+  Tagged<NameToIndexHashTable> raw_table = *table;
   // Compute the key object.
-  InternalIndex entry = raw_table.FindInsertionEntry(isolate, key->hash());
-  raw_table.set(EntryToIndex(entry), *key);
-  raw_table.set(EntryToValueIndex(entry), Smi::FromInt(index));
-  raw_table.ElementAdded();
+  InternalIndex entry = raw_table->FindInsertionEntry(isolate, key->hash());
+  raw_table->set(EntryToIndex(entry), *key);
+  raw_table->set(EntryToValueIndex(entry), Smi::FromInt(index));
+  raw_table->ElementAdded();
   return table;
 }
 
diff --git a/deps/v8/src/objects/hash-table.h b/deps/v8/src/objects/hash-table.h
index 8256102b84a51b..bf52429a715b5d 100644
--- a/deps/v8/src/objects/hash-table.h
+++ b/deps/v8/src/objects/hash-table.h
@@ -64,7 +64,7 @@ template <typename KeyT>
 class V8_EXPORT_PRIVATE BaseShape {
  public:
   using Key = KeyT;
-  static Object Unwrap(Object key) { return key; }
+  static Tagged<Object> Unwrap(Tagged<Object> key) { return key; }
 };
 
 class V8_EXPORT_PRIVATE HashTableBase : public NON_EXPORTED_BASE(FixedArray) {
@@ -156,20 +156,21 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) HashTable
 
   // Returns whether k is a real key.  The hole and undefined are not allowed as
   // keys and can be used to indicate missing or deleted elements.
-  static inline bool IsKey(ReadOnlyRoots roots, Object k);
+  static inline bool IsKey(ReadOnlyRoots roots, Tagged<Object> k);
 
-  inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry, Object* out_k);
+  inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry,
+                    Tagged<Object>* out_k);
   inline bool ToKey(PtrComprCageBase cage_base, InternalIndex entry,
-                    Object* out_k);
+                    Tagged<Object>* out_k);
 
   // Returns the key at entry.
-  inline Object KeyAt(InternalIndex entry);
-  inline Object KeyAt(PtrComprCageBase cage_base, InternalIndex entry);
-  inline Object KeyAt(InternalIndex entry, RelaxedLoadTag tag);
-  inline Object KeyAt(PtrComprCageBase cage_base, InternalIndex entry,
-                      RelaxedLoadTag tag);
+  inline Tagged<Object> KeyAt(InternalIndex entry);
+  inline Tagged<Object> KeyAt(PtrComprCageBase cage_base, InternalIndex entry);
+  inline Tagged<Object> KeyAt(InternalIndex entry, RelaxedLoadTag tag);
+  inline Tagged<Object> KeyAt(PtrComprCageBase cage_base, InternalIndex entry,
+                              RelaxedLoadTag tag);
 
-  inline void SetKeyAt(InternalIndex entry, Object value,
+  inline void SetKeyAt(InternalIndex entry, Tagged<Object> value,
                        WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   static const int kElementsStartIndex = kPrefixStartIndex + Shape::kPrefixSize;
@@ -249,8 +250,8 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) HashTable
   // Rehashes this hash-table into the new table.
   void Rehash(PtrComprCageBase cage_base, Derived new_table);
 
-  inline void set_key(int index, Object value);
-  inline void set_key(int index, Object value, WriteBarrierMode mode);
+  inline void set_key(int index, Tagged<Object> value);
+  inline void set_key(int index, Tagged<Object> value, WriteBarrierMode mode);
 
  private:
   // Ensure that kMaxRegularCapacity yields a non-large object dictionary.
@@ -269,7 +270,7 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) HashTable
   // Returns _expected_ if one of entries given by the first _probe_ probes is
   // equal to  _expected_. Otherwise, returns the entry given by the probe
   // number _probe_.
-  InternalIndex EntryForProbe(ReadOnlyRoots roots, Object k, int probe,
+  InternalIndex EntryForProbe(ReadOnlyRoots roots, Tagged<Object> k, int probe,
                               InternalIndex expected);
 
   void Swap(InternalIndex entry1, InternalIndex entry2, WriteBarrierMode mode);
@@ -301,7 +302,7 @@ class HashTableKey {
   explicit HashTableKey(uint32_t hash) : hash_(hash) {}
 
   // Returns whether the other object matches this key.
-  virtual bool IsMatch(Object other) = 0;
+  virtual bool IsMatch(Tagged<Object> other) = 0;
   // Returns the hash value for this key.
   // Required.
   virtual ~HashTableKey() = default;
@@ -320,9 +321,10 @@ class HashTableKey {
 
 class ObjectHashTableShape : public BaseShape<Handle<Object>> {
  public:
-  static inline bool IsMatch(Handle<Object> key, Object other);
+  static inline bool IsMatch(Handle<Object> key, Tagged<Object> other);
   static inline uint32_t Hash(ReadOnlyRoots roots, Handle<Object> key);
-  static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
+  static inline uint32_t HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object);
   static inline Handle<Object> AsHandle(Handle<Object> key);
   static const int kPrefixSize = 0;
   static const int kEntryValueIndex = 1;
@@ -336,12 +338,13 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) ObjectHashTableBase
  public:
   // Looks up the value associated with the given key. The hole value is
   // returned in case the key is not present.
-  Object Lookup(Handle<Object> key);
-  Object Lookup(Handle<Object> key, int32_t hash);
-  Object Lookup(PtrComprCageBase cage_base, Handle<Object> key, int32_t hash);
+  Tagged<Object> Lookup(Handle<Object> key);
+  Tagged<Object> Lookup(Handle<Object> key, int32_t hash);
+  Tagged<Object> Lookup(PtrComprCageBase cage_base, Handle<Object> key,
+                        int32_t hash);
 
   // Returns the value at entry.
-  Object ValueAt(InternalIndex entry);
+  Tagged<Object> ValueAt(InternalIndex entry);
 
   // Overwrite all keys and values with the hole value.
   static void FillEntriesWithHoles(Handle<Derived>);
@@ -367,7 +370,7 @@ class EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) ObjectHashTableBase
   }
 
  protected:
-  void AddEntry(InternalIndex entry, Object key, Object value);
+  void AddEntry(InternalIndex entry, Tagged<Object> key, Tagged<Object> value);
   void RemoveEntry(InternalIndex entry);
 
   OBJECT_CONSTRUCTORS(ObjectHashTableBase, HashTable<Derived, Shape>);
@@ -410,12 +413,13 @@ class V8_EXPORT_PRIVATE EphemeronHashTable
 
  protected:
   friend class MarkCompactCollector;
+  friend class MinorMarkSweepCollector;
   friend class ScavengerCollector;
   friend class third_party_heap::Impl;
   friend class HashTable<EphemeronHashTable, ObjectHashTableShape>;
   friend class ObjectHashTableBase<EphemeronHashTable, ObjectHashTableShape>;
-  inline void set_key(int index, Object value);
-  inline void set_key(int index, Object value, WriteBarrierMode mode);
+  inline void set_key(int index, Tagged<Object> value);
+  inline void set_key(int index, Tagged<Object> value, WriteBarrierMode mode);
 
   OBJECT_CONSTRUCTORS(
       EphemeronHashTable,
@@ -497,9 +501,10 @@ class V8_EXPORT_PRIVATE ObjectHashSet
 
 class NameToIndexShape : public BaseShape<Handle<Name>> {
  public:
-  static inline bool IsMatch(Handle<Name> key, Object other);
+  static inline bool IsMatch(Handle<Name> key, Tagged<Object> other);
   static inline uint32_t Hash(ReadOnlyRoots roots, Handle<Name> key);
-  static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
+  static inline uint32_t HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object);
   static inline Handle<Object> AsHandle(Handle<Name> key);
   static const int kPrefixSize = 0;
   static const int kEntryValueIndex = 1;
@@ -516,7 +521,7 @@ class V8_EXPORT_PRIVATE NameToIndexHashTable
   int Lookup(Handle<Name> key);
 
   // Returns the value at entry.
-  Object ValueAt(InternalIndex entry);
+  Tagged<Object> ValueAt(InternalIndex entry);
   int IndexAt(InternalIndex entry);
 
   template <typename IsolateT>
@@ -542,9 +547,10 @@ class V8_EXPORT_PRIVATE NameToIndexHashTable
 
 class RegisteredSymbolTableShape : public BaseShape<Handle<String>> {
  public:
-  static inline bool IsMatch(Handle<String> key, Object other);
+  static inline bool IsMatch(Handle<String> key, Tagged<Object> other);
   static inline uint32_t Hash(ReadOnlyRoots roots, Handle<String> key);
-  static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
+  static inline uint32_t HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object);
   static const int kPrefixSize = 0;
   static const int kEntryValueIndex = 1;
   static const int kEntrySize = 2;
@@ -554,10 +560,10 @@ class RegisteredSymbolTableShape : public BaseShape<Handle<String>> {
 class RegisteredSymbolTable
     : public HashTable<RegisteredSymbolTable, RegisteredSymbolTableShape> {
  public:
-  Object SlowReverseLookup(Object value);
+  Tagged<Object> SlowReverseLookup(Tagged<Object> value);
 
   // Returns the value at entry.
-  Object ValueAt(InternalIndex entry);
+  Tagged<Object> ValueAt(InternalIndex entry);
 
   inline static Handle<Map> GetMap(ReadOnlyRoots roots);
 
diff --git a/deps/v8/src/objects/heap-number-inl.h b/deps/v8/src/objects/heap-number-inl.h
index 2c8a3c65067824..469108115bda0e 100644
--- a/deps/v8/src/objects/heap-number-inl.h
+++ b/deps/v8/src/objects/heap-number-inl.h
@@ -6,8 +6,6 @@
 #define V8_OBJECTS_HEAP_NUMBER_INL_H_
 
 #include "src/objects/heap-number.h"
-
-#include "src/objects/objects-inl.h"
 #include "src/objects/primitive-heap-object-inl.h"
 
 // Has to be the last include (doesn't have include guards):
diff --git a/deps/v8/src/objects/heap-object-inl.h b/deps/v8/src/objects/heap-object-inl.h
index 88c0011bdf677b..608152ac9982d4 100644
--- a/deps/v8/src/objects/heap-object-inl.h
+++ b/deps/v8/src/objects/heap-object-inl.h
@@ -5,7 +5,9 @@
 #ifndef V8_OBJECTS_HEAP_OBJECT_INL_H_
 #define V8_OBJECTS_HEAP_OBJECT_INL_H_
 
+#include "src/common/ptr-compr-inl.h"
 #include "src/objects/heap-object.h"
+#include "src/objects/instance-type-inl.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -13,12 +15,22 @@
 namespace v8 {
 namespace internal {
 
-HeapObject::HeapObject(Address ptr, AllowInlineSmiStorage allow_smi)
-    : Object(ptr) {
-  SLOW_DCHECK(
-      (allow_smi == AllowInlineSmiStorage::kAllowBeingASmi && IsSmi()) ||
-      IsHeapObject());
-}
+#define TYPE_CHECKER(type, ...)                                               \
+  bool Is##type(Tagged<HeapObject> obj) {                                     \
+    /* IsBlah() predicates needs to load the map and thus they require the */ \
+    /* main cage base. */                                                     \
+    PtrComprCageBase cage_base = GetPtrComprCageBase();                       \
+    return Is##type(obj, cage_base);                                          \
+  }                                                                           \
+  /* The cage_base passed here must be the base of the main pointer */        \
+  /* compression cage, i.e. the one where the Map space is allocated. */      \
+  bool Is##type(Tagged<HeapObject> obj, PtrComprCageBase cage_base) {         \
+    Map map_object = obj->map(cage_base);                                     \
+    return InstanceTypeChecker::Is##type(map_object);                         \
+  }
+
+INSTANCE_TYPE_CHECKERS(TYPE_CHECKER)
+#undef TYPE_CHECKER
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/heap-object.h b/deps/v8/src/objects/heap-object.h
index 759cda3cabb07b..ba996bd8307b73 100644
--- a/deps/v8/src/objects/heap-object.h
+++ b/deps/v8/src/objects/heap-object.h
@@ -9,9 +9,6 @@
 #include "src/objects/instance-type.h"
 #include "src/objects/objects.h"
 #include "src/objects/tagged-field.h"
-#include "src/roots/roots.h"
-#include "src/torque/runtime-macro-shims.h"
-#include "src/torque/runtime-support.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -21,6 +18,10 @@ namespace internal {
 
 class Heap;
 class PrimitiveHeapObject;
+class ExternalPointerSlot;
+class IndirectPointerSlot;
+template <typename T>
+class Tagged;
 
 // HeapObject is the superclass for all classes describing heap allocated
 // objects.
@@ -32,52 +33,54 @@ class HeapObject : public Object {
 
   // [map]: Contains a map which contains the object's reflective
   // information.
-  DECL_GETTER(map, Map)
-  inline void set_map(Map value);
+  DECL_GETTER(map, Tagged<Map>)
+  inline void set_map(Tagged<Map> value);
 
   // This method behaves the same as `set_map` but marks the map transition as
   // safe for the concurrent marker (object layout doesn't change) during
   // verification.
-  inline void set_map_safe_transition(Map value);
+  inline void set_map_safe_transition(Tagged<Map> value);
 
   inline ObjectSlot map_slot() const;
 
   // The no-write-barrier version.  This is OK if the object is white and in
   // new space, or if the value is an immortal immutable object, like the maps
   // of primitive (non-JS) objects like strings, heap numbers etc.
-  inline void set_map_no_write_barrier(Map value,
+  inline void set_map_no_write_barrier(Tagged<Map> value,
                                        RelaxedStoreTag = kRelaxedStore);
-  inline void set_map_no_write_barrier(Map value, ReleaseStoreTag);
+  inline void set_map_no_write_barrier(Tagged<Map> value, ReleaseStoreTag);
   inline void set_map_safe_transition_no_write_barrier(
-      Map value, RelaxedStoreTag = kRelaxedStore);
-  inline void set_map_safe_transition_no_write_barrier(Map value,
+      Tagged<Map> value, RelaxedStoreTag = kRelaxedStore);
+  inline void set_map_safe_transition_no_write_barrier(Tagged<Map> value,
                                                        ReleaseStoreTag);
 
   // Access the map using acquire load and release store.
-  DECL_ACQUIRE_GETTER(map, Map)
-  inline void set_map(Map value, ReleaseStoreTag);
-  inline void set_map_safe_transition(Map value, ReleaseStoreTag);
+  DECL_ACQUIRE_GETTER(map, Tagged<Map>)
+  inline void set_map(Tagged<Map> value, ReleaseStoreTag);
+  inline void set_map_safe_transition(Tagged<Map> value, ReleaseStoreTag);
 
   // Compare-and-swaps map word using release store, returns true if the map
   // word was actually swapped.
   inline bool release_compare_and_swap_map_word_forwarded(
-      MapWord old_map_word, HeapObject new_target_object);
+      MapWord old_map_word, Tagged<HeapObject> new_target_object);
 
   // Initialize the map immediately after the object is allocated.
   // Do not use this outside Heap.
   inline void set_map_after_allocation(
-      Map value, WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
+      Tagged<Map> value, WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   // During garbage collection, the map word of a heap object does not
   // necessarily contain a map pointer.
   DECL_RELAXED_GETTER(map_word, MapWord)
-  inline void set_map_word(Map map, RelaxedStoreTag);
-  inline void set_map_word_forwarded(HeapObject target_object, RelaxedStoreTag);
+  inline void set_map_word(Tagged<Map> map, RelaxedStoreTag);
+  inline void set_map_word_forwarded(Tagged<HeapObject> target_object,
+                                     RelaxedStoreTag);
 
   // Access the map word using acquire load and release store.
   DECL_ACQUIRE_GETTER(map_word, MapWord)
-  inline void set_map_word(Map map, ReleaseStoreTag);
-  inline void set_map_word_forwarded(HeapObject target_object, ReleaseStoreTag);
+  inline void set_map_word(Tagged<Map> map, ReleaseStoreTag);
+  inline void set_map_word_forwarded(Tagged<HeapObject> target_object,
+                                     ReleaseStoreTag);
 
   // This method exists to help remove GetIsolate/GetHeap from HeapObject, in a
   // way that doesn't require passing Isolate/Heap down huge call chains or to
@@ -97,37 +100,11 @@ class HeapObject : public Object {
 
   V8_INLINE bool InReadOnlySpace() const;
 
-#define IS_TYPE_FUNCTION_DECL(Type) \
-  V8_INLINE bool Is##Type() const;  \
-  V8_INLINE bool Is##Type(PtrComprCageBase cage_base) const;
-  HEAP_OBJECT_TYPE_LIST(IS_TYPE_FUNCTION_DECL)
-  IS_TYPE_FUNCTION_DECL(HashTableBase)
-  IS_TYPE_FUNCTION_DECL(SmallOrderedHashTable)
-#undef IS_TYPE_FUNCTION_DECL
-
-// Oddball checks are faster when they are raw pointer comparisons, so the
-// isolate/read-only roots overloads should be preferred where possible.
-#define IS_TYPE_FUNCTION_DECL(Type, Value, _)           \
-  V8_INLINE bool Is##Type(Isolate* isolate) const;      \
-  V8_INLINE bool Is##Type(LocalIsolate* isolate) const; \
-  V8_INLINE bool Is##Type(ReadOnlyRoots roots) const;   \
-  V8_INLINE bool Is##Type() const;
-  ODDBALL_LIST(IS_TYPE_FUNCTION_DECL)
-  IS_TYPE_FUNCTION_DECL(NullOrUndefined, , /* unused */)
-#undef IS_TYPE_FUNCTION_DECL
-
-#define DECL_STRUCT_PREDICATE(NAME, Name, name) \
-  V8_INLINE bool Is##Name() const;              \
-  V8_INLINE bool Is##Name(PtrComprCageBase cage_base) const;
-  STRUCT_LIST(DECL_STRUCT_PREDICATE)
-#undef DECL_STRUCT_PREDICATE
-
-  V8_INLINE bool IsJSObjectThatCanBeTrackedAsPrototype() const;
-
   // Converts an address to a HeapObject pointer.
-  static inline HeapObject FromAddress(Address address) {
+  static inline Tagged<HeapObject> FromAddress(Address address) {
     DCHECK_TAG_ALIGNED(address);
-    return HeapObject(address + kHeapObjectTag);
+    return Tagged<HeapObject>::unchecked_cast(
+        Tagged<Object>(address + kHeapObjectTag));
   }
 
   // Returns the address of this HeapObject.
@@ -142,7 +119,10 @@ class HeapObject : public Object {
   inline void IterateFast(PtrComprCageBase cage_base, ObjectVisitor* v);
 
   template <typename ObjectVisitor>
-  inline void IterateFast(Map map, int object_size, ObjectVisitor* v);
+  inline void IterateFast(Tagged<Map> map, ObjectVisitor* v);
+
+  template <typename ObjectVisitor>
+  inline void IterateFast(Tagged<Map> map, int object_size, ObjectVisitor* v);
 
   // Iterates over all pointers contained in the object except the
   // first map pointer.  The object type is given in the first
@@ -151,18 +131,14 @@ class HeapObject : public Object {
   // If it's not performance critical iteration use the non-templatized
   // version.
   void IterateBody(PtrComprCageBase cage_base, ObjectVisitor* v);
-  void IterateBody(Map map, int object_size, ObjectVisitor* v);
+  void IterateBody(Tagged<Map> map, int object_size, ObjectVisitor* v);
 
   template <typename ObjectVisitor>
   inline void IterateBodyFast(PtrComprCageBase cage_base, ObjectVisitor* v);
 
   template <typename ObjectVisitor>
-  inline void IterateBodyFast(Map map, int object_size, ObjectVisitor* v);
-
-  // Returns true if the object contains a tagged value at given offset.
-  // It is used for invalid slots filtering. If the offset points outside
-  // of the object or to the map word, the result is UNDEFINED (!!!).
-  V8_EXPORT_PRIVATE bool IsValidSlot(Map map, int offset);
+  inline void IterateBodyFast(Tagged<Map> map, int object_size,
+                              ObjectVisitor* v);
 
   // Returns the heap object's size in bytes
   DECL_GETTER(Size, int)
@@ -170,7 +146,97 @@ class HeapObject : public Object {
   // Given a heap object's map pointer, returns the heap size in bytes
   // Useful when the map pointer field is used for other purposes.
   // GC internal.
-  V8_EXPORT_PRIVATE int SizeFromMap(Map map) const;
+  V8_EXPORT_PRIVATE int SizeFromMap(Tagged<Map> map) const;
+
+  template <class T, typename std::enable_if<std::is_arithmetic<T>::value ||
+                                                 std::is_enum<T>::value,
+                                             int>::type = 0>
+  inline T ReadField(size_t offset) const {
+    return ReadMaybeUnalignedValue<T>(field_address(offset));
+  }
+
+  template <class T, typename std::enable_if<std::is_arithmetic<T>::value ||
+                                                 std::is_enum<T>::value,
+                                             int>::type = 0>
+  inline void WriteField(size_t offset, T value) const {
+    return WriteMaybeUnalignedValue<T>(field_address(offset), value);
+  }
+
+  // Atomically reads a field using relaxed memory ordering. Can only be used
+  // with integral types whose size is <= kTaggedSize (to guarantee alignment).
+  template <class T,
+            typename std::enable_if<(std::is_arithmetic<T>::value ||
+                                     std::is_enum<T>::value) &&
+                                        !std::is_floating_point<T>::value,
+                                    int>::type = 0>
+  inline T Relaxed_ReadField(size_t offset) const;
+
+  // Atomically writes a field using relaxed memory ordering. Can only be used
+  // with integral types whose size is <= kTaggedSize (to guarantee alignment).
+  template <class T,
+            typename std::enable_if<(std::is_arithmetic<T>::value ||
+                                     std::is_enum<T>::value) &&
+                                        !std::is_floating_point<T>::value,
+                                    int>::type = 0>
+  inline void Relaxed_WriteField(size_t offset, T value);
+
+  // Atomically compares and swaps a field using seq cst memory ordering.
+  // Contains the required logic to properly handle number comparison.
+  template <typename CompareAndSwapImpl>
+  static Tagged<Object> SeqCst_CompareAndSwapField(
+      Tagged<Object> expected_value, Tagged<Object> new_value,
+      CompareAndSwapImpl compare_and_swap_impl);
+
+  //
+  // SandboxedPointer_t field accessors.
+  //
+  inline Address ReadSandboxedPointerField(size_t offset,
+                                           PtrComprCageBase cage_base) const;
+  inline void WriteSandboxedPointerField(size_t offset,
+                                         PtrComprCageBase cage_base,
+                                         Address value);
+  inline void WriteSandboxedPointerField(size_t offset, Isolate* isolate,
+                                         Address value);
+
+  //
+  // BoundedSize field accessors.
+  //
+  inline size_t ReadBoundedSizeField(size_t offset) const;
+  inline void WriteBoundedSizeField(size_t offset, size_t value);
+
+  //
+  // ExternalPointer_t field accessors.
+  //
+  template <ExternalPointerTag tag>
+  inline void InitExternalPointerField(size_t offset, Isolate* isolate,
+                                       Address value);
+  template <ExternalPointerTag tag>
+  inline Address ReadExternalPointerField(size_t offset,
+                                          Isolate* isolate) const;
+  template <ExternalPointerTag tag>
+  inline void WriteExternalPointerField(size_t offset, Isolate* isolate,
+                                        Address value);
+
+  template <ExternalPointerTag tag>
+  inline void WriteLazilyInitializedExternalPointerField(size_t offset,
+                                                         Isolate* isolate,
+                                                         Address value);
+
+  inline void ResetLazilyInitializedExternalPointerField(size_t offset);
+
+  //
+  // IndirectPointer field accessors.
+  //
+  inline Tagged<Object> ReadIndirectPointerField(size_t offset) const;
+
+  //
+  // CodePointer field accessors.
+  //
+  inline void InitCodePointerTableEntryField(size_t offset, Isolate* isolate,
+                                             Tagged<Code> owning_code,
+                                             Address entrypoint);
+  inline Address ReadCodeEntrypointField(size_t offset) const;
+  inline void WriteCodeEntrypointField(size_t offset, Address value);
 
   // Returns the field at offset in obj, as a read/write Object reference.
   // Does no checking, and is safe to use during GC, while maps are invalid.
@@ -178,8 +244,9 @@ class HeapObject : public Object {
   // during marking GC.
   inline ObjectSlot RawField(int byte_offset) const;
   inline MaybeObjectSlot RawMaybeWeakField(int byte_offset) const;
-  inline CodeObjectSlot RawCodeField(int byte_offset) const;
+  inline InstructionStreamSlot RawInstructionStreamField(int byte_offset) const;
   inline ExternalPointerSlot RawExternalPointerField(int byte_offset) const;
+  inline IndirectPointerSlot RawIndirectPointerField(int byte_offset) const;
 
   DECL_CAST(HeapObject)
 
@@ -205,11 +272,11 @@ class HeapObject : public Object {
 
   // Verify a pointer is a valid HeapObject pointer that points to object
   // areas in the heap.
-  static void VerifyHeapPointer(Isolate* isolate, Object p);
-  static void VerifyCodePointer(Isolate* isolate, Object p);
+  static void VerifyHeapPointer(Isolate* isolate, Tagged<Object> p);
+  static void VerifyCodePointer(Isolate* isolate, Tagged<Object> p);
 #endif
 
-  static inline AllocationAlignment RequiredAlignment(Map map);
+  static inline AllocationAlignment RequiredAlignment(Tagged<Map> map);
   bool inline CheckRequiredAlignment(PtrComprCageBase cage_base) const;
 
   // Whether the object needs rehashing. That is the case if the object's
@@ -243,13 +310,12 @@ class HeapObject : public Object {
   inline Address GetFieldAddress(int field_offset) const;
 
  protected:
-  // Special-purpose constructor for subclasses that have fast paths where
-  // their ptr() is a Smi.
-  enum class AllowInlineSmiStorage { kRequireHeapObjectTag, kAllowBeingASmi };
-  inline HeapObject(Address ptr, AllowInlineSmiStorage allow_smi);
-
   OBJECT_CONSTRUCTORS(HeapObject, Object);
 
+  inline Address field_address(size_t offset) const {
+    return ptr() + offset - kHeapObjectTag;
+  }
+
  private:
   enum class VerificationMode {
     kSafeMapTransition,
@@ -262,12 +328,61 @@ class HeapObject : public Object {
   };
 
   template <EmitWriteBarrier emit_write_barrier, typename MemoryOrder>
-  V8_INLINE void set_map(Map value, MemoryOrder order, VerificationMode mode);
+  V8_INLINE void set_map(Tagged<Map> value, MemoryOrder order,
+                         VerificationMode mode);
 };
 
 OBJECT_CONSTRUCTORS_IMPL(HeapObject, Object)
 CAST_ACCESSOR(HeapObject)
 
+// Define Tagged<HeapObject> now that HeapObject exists.
+constexpr HeapObject Tagged<HeapObject>::operator*() const {
+  return ToRawPtr();
+}
+constexpr detail::TaggedOperatorArrowRef<HeapObject>
+Tagged<HeapObject>::operator->() const {
+  return detail::TaggedOperatorArrowRef<HeapObject>{ToRawPtr()};
+}
+// Implicit conversions and explicit casts to/from raw pointers
+// TODO(leszeks): Remove once we're using Tagged everywhere.
+// NOLINTNEXTLINE
+constexpr Tagged<HeapObject>::operator HeapObject() {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return ToRawPtr();
+}
+constexpr HeapObject Tagged<HeapObject>::ToRawPtr() const {
+  return HeapObject(this->ptr(), HeapObject::SkipTypeCheckTag{});
+}
+
+// Overload Is* predicates for HeapObject.
+#define IS_TYPE_FUNCTION_DECL(Type)                                            \
+  V8_INLINE bool Is##Type(Tagged<HeapObject> obj);                             \
+  V8_INLINE bool Is##Type(Tagged<HeapObject> obj, PtrComprCageBase cage_base); \
+  V8_INLINE bool Is##Type(HeapObject obj);                                     \
+  V8_INLINE bool Is##Type(HeapObject obj, PtrComprCageBase cage_base);
+HEAP_OBJECT_TYPE_LIST(IS_TYPE_FUNCTION_DECL)
+IS_TYPE_FUNCTION_DECL(HashTableBase)
+IS_TYPE_FUNCTION_DECL(SmallOrderedHashTable)
+#undef IS_TYPE_FUNCTION_DECL
+
+// Most calls to Is<Oddball> should go via the Tagged<Object> overloads, withst
+// an Isolate/LocalIsolate/ReadOnlyRoots parameter.
+#define IS_TYPE_FUNCTION_DECL(Type, Value, _)      \
+  V8_INLINE bool Is##Type(Tagged<HeapObject> obj); \
+  V8_INLINE bool Is##Type(HeapObject obj);
+ODDBALL_LIST(IS_TYPE_FUNCTION_DECL)
+HOLE_LIST(IS_TYPE_FUNCTION_DECL)
+IS_TYPE_FUNCTION_DECL(NullOrUndefined, , /* unused */)
+#undef IS_TYPE_FUNCTION_DECL
+
+#define DECL_STRUCT_PREDICATE(NAME, Name, name)                                \
+  V8_INLINE bool Is##Name(Tagged<HeapObject> obj);                             \
+  V8_INLINE bool Is##Name(Tagged<HeapObject> obj, PtrComprCageBase cage_base); \
+  V8_INLINE bool Is##Name(HeapObject obj);                                     \
+  V8_INLINE bool Is##Name(HeapObject obj, PtrComprCageBase cage_base);
+STRUCT_LIST(DECL_STRUCT_PREDICATE)
+#undef DECL_STRUCT_PREDICATE
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/hole-inl.h b/deps/v8/src/objects/hole-inl.h
new file mode 100644
index 00000000000000..84c3b551d39b4d
--- /dev/null
+++ b/deps/v8/src/objects/hole-inl.h
@@ -0,0 +1,43 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_HOLE_INL_H_
+#define V8_OBJECTS_HOLE_INL_H_
+
+#include "src/handles/handles.h"
+#include "src/heap/heap-write-barrier-inl.h"
+#include "src/objects/heap-number-inl.h"
+#include "src/objects/hole.h"
+#include "src/objects/objects-inl.h"
+#include "src/objects/smi-inl.h"
+#include "src/objects/tagged-field-inl.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+TQ_CPP_OBJECT_DEFINITION_ASSERTS(Hole, HeapObject)
+
+OBJECT_CONSTRUCTORS_IMPL(Hole, HeapObject)
+
+CAST_ACCESSOR(Hole)
+
+void Hole::set_raw_numeric_value(uint64_t bits) {
+  base::WriteUnalignedValue<uint64_t>(field_address(kRawNumericValueOffset),
+                                      bits);
+}
+
+void Hole::Initialize(Isolate* isolate, Handle<Hole> hole,
+                      Handle<HeapNumber> numeric_value) {
+  hole->set_raw_numeric_value(numeric_value->value_as_bits(kRelaxedLoad));
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_HOLE_INL_H_
diff --git a/deps/v8/src/objects/hole.h b/deps/v8/src/objects/hole.h
new file mode 100644
index 00000000000000..4e98b257d6c322
--- /dev/null
+++ b/deps/v8/src/objects/hole.h
@@ -0,0 +1,53 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+//
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_HOLE_H_
+#define V8_OBJECTS_HOLE_H_
+
+#include "src/objects/heap-number.h"
+#include "src/objects/heap-object.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+#include "torque-generated/src/objects/hole-tq.inc"
+
+class Hole : public HeapObject {
+ public:
+  inline void set_raw_numeric_value(uint64_t bits);
+
+  inline uint8_t kind() const;
+
+  DECL_CAST(Hole)
+
+  DECL_VERIFIER(Hole)
+
+  static inline void Initialize(Isolate* isolate, Handle<Hole> hole,
+                                Handle<HeapNumber> numeric_value);
+
+  // Currently, we allow optimized code to treat holes as HeapNumbers to avoid
+  // conditional branching. This works by making Hole::kRawNumericValueOffset
+  // the same as HeapNumber::kValueOffset and storing NaN at that offset in
+  // Holes. This way, a hole will look like a NaN HeapNumber to optimized code.
+  DECL_FIELD_OFFSET_TQ(RawNumericValue, HeapObject::kHeaderSize, "float64")
+  static constexpr int kSize = kRawNumericValueOffset + kDoubleSize;
+  static_assert(HeapNumber::kValueOffset == Hole::kRawNumericValueOffset);
+
+  using BodyDescriptor = FixedBodyDescriptor<kSize, kSize, kSize>;
+
+  DECL_PRINTER(Hole)
+
+  OBJECT_CONSTRUCTORS(Hole, HeapObject);
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_HOLE_H_
diff --git a/deps/v8/src/objects/hole.tq b/deps/v8/src/objects/hole.tq
new file mode 100644
index 00000000000000..2eae51579404c6
--- /dev/null
+++ b/deps/v8/src/objects/hole.tq
@@ -0,0 +1,8 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+@cppObjectDefinition
+extern class Hole extends HeapObject {
+  raw_numeric_value: float64;
+}
diff --git a/deps/v8/src/objects/instance-type-checker.h b/deps/v8/src/objects/instance-type-checker.h
new file mode 100644
index 00000000000000..529bcbc19a6510
--- /dev/null
+++ b/deps/v8/src/objects/instance-type-checker.h
@@ -0,0 +1,88 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_INSTANCE_TYPE_CHECKER_H_
+#define V8_OBJECTS_INSTANCE_TYPE_CHECKER_H_
+
+#include "src/objects/instance-type.h"
+#include "src/roots/roots.h"
+#include "src/roots/static-roots.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+class Map;
+
+// List of object types that have a single unique instance type.
+#define INSTANCE_TYPE_CHECKERS_SINGLE(V)           \
+  TORQUE_INSTANCE_CHECKERS_SINGLE_FULLY_DEFINED(V) \
+  TORQUE_INSTANCE_CHECKERS_SINGLE_ONLY_DECLARED(V) \
+  V(BigInt, BIGINT_TYPE)                           \
+  V(FixedArrayExact, FIXED_ARRAY_TYPE)
+
+#define INSTANCE_TYPE_CHECKERS_RANGE(V)           \
+  TORQUE_INSTANCE_CHECKERS_RANGE_FULLY_DEFINED(V) \
+  TORQUE_INSTANCE_CHECKERS_RANGE_ONLY_DECLARED(V)
+
+#define INSTANCE_TYPE_CHECKERS_CUSTOM(V) \
+  V(AbstractCode)                        \
+  V(ExternalString)                      \
+  V(FreeSpaceOrFiller)                   \
+  V(GcSafeCode)                          \
+  V(InternalizedString)
+
+#define INSTANCE_TYPE_CHECKERS(V)  \
+  INSTANCE_TYPE_CHECKERS_SINGLE(V) \
+  INSTANCE_TYPE_CHECKERS_RANGE(V)  \
+  INSTANCE_TYPE_CHECKERS_CUSTOM(V)
+
+namespace InstanceTypeChecker {
+#define IS_TYPE_FUNCTION_DECL(Type, ...)                         \
+  V8_INLINE constexpr bool Is##Type(InstanceType instance_type); \
+  V8_INLINE bool Is##Type(Tagged<Map> map);
+
+INSTANCE_TYPE_CHECKERS(IS_TYPE_FUNCTION_DECL)
+
+#undef IS_TYPE_FUNCTION_DECL
+
+#if V8_STATIC_ROOTS_BOOL
+
+// Maps for primitive objects and a select few JS objects are allocated in r/o
+// space. All JS_RECEIVER maps must come after primitive object maps, i.e. they
+// have a compressed address above the last primitive object map root. If we
+// have a receiver and need to distinguish whether it is either a primitive
+// object or a JS receiver, it suffices to check if its map is allocated above
+// the following limit address.
+constexpr Tagged_t kNonJsReceiverMapLimit =
+    StaticReadOnlyRootsPointerTable[static_cast<size_t>(
+        RootIndex::kFirstJSReceiverMapRoot)] &
+    ~0xFFF;
+
+// For performance, the limit is chosen to be encodable as an Arm64
+// constant. See Assembler::IsImmAddSub in assembler-arm64.cc.
+//
+// If this assert fails, then you have perturbed the allocation pattern in
+// Heap::CreateReadOnlyHeapObjects. Currently this limit is ensured to exist by
+// allocating the first JSReceiver map in RO space a sufficiently large distance
+// away from the last non-JSReceiver map.
+static_assert(kNonJsReceiverMapLimit != 0 &&
+              is_uint12(kNonJsReceiverMapLimit >> 12) &&
+              ((kNonJsReceiverMapLimit & 0xFFF) == 0));
+
+#else
+
+constexpr Tagged_t kNonJsReceiverMapLimit = 0x0;
+
+#endif  // V8_STATIC_ROOTS_BOOL
+}  // namespace InstanceTypeChecker
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_INSTANCE_TYPE_CHECKER_H_
diff --git a/deps/v8/src/objects/instance-type-inl.h b/deps/v8/src/objects/instance-type-inl.h
index ce57d5d0ffba59..272d30770d0d13 100644
--- a/deps/v8/src/objects/instance-type-inl.h
+++ b/deps/v8/src/objects/instance-type-inl.h
@@ -7,9 +7,9 @@
 
 #include "src/base/bounds.h"
 #include "src/execution/isolate-utils-inl.h"
+#include "src/objects/instance-type-checker.h"
 #include "src/objects/instance-type.h"
 #include "src/objects/map-inl.h"
-#include "src/roots/static-roots.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -77,9 +77,10 @@ constexpr std::array<std::pair<InstanceTypeRange, RootIndexRange>, 6>
           {RootIndex::kAllocationSiteWithWeakNextMap,
            RootIndex::kAllocationSiteWithoutWeakNextMap}},
          {{FIRST_STRING_TYPE, LAST_STRING_TYPE},
-          {RootIndex::kStringMap, RootIndex::kSharedOneByteStringMap}},
+          {RootIndex::kSeqTwoByteStringMap,
+           RootIndex::kSharedSeqOneByteStringMap}},
          {{FIRST_NAME_TYPE, LAST_NAME_TYPE},
-          {RootIndex::kSymbolMap, RootIndex::kSharedOneByteStringMap}},
+          {RootIndex::kSymbolMap, RootIndex::kSharedSeqOneByteStringMap}},
          {{FIRST_SMALL_ORDERED_HASH_TABLE_TYPE,
            LAST_SMALL_ORDERED_HASH_TABLE_TYPE},
           {RootIndex::kSmallOrderedHashMapMap,
@@ -94,11 +95,13 @@ constexpr std::array<std::pair<InstanceTypeRange, RootIndexRange>, 6>
 
 struct kUniqueMapRangeOfStringType {
   static constexpr RootIndexRange kInternalizedString = {
-      RootIndex::kExternalInternalizedStringMap,
-      RootIndex::kOneByteInternalizedStringMap};
+      RootIndex::kExternalInternalizedTwoByteStringMap,
+      RootIndex::kInternalizedOneByteStringMap};
   static constexpr RootIndexRange kExternalString = {
-      RootIndex::kExternalStringMap,
-      RootIndex::kUncachedExternalOneByteInternalizedStringMap};
+      RootIndex::kExternalTwoByteStringMap,
+      RootIndex::kUncachedExternalInternalizedOneByteStringMap};
+  static constexpr RootIndexRange kThinString = {
+      RootIndex::kThinTwoByteStringMap, RootIndex::kThinOneByteStringMap};
 };
 
 #if V8_STATIC_ROOTS_BOOL
@@ -131,12 +134,12 @@ inline bool MayHaveMapCheckFastCase(InstanceType type) {
   return false;
 }
 
-inline bool CheckInstanceMap(RootIndex expected, Map map) {
+inline bool CheckInstanceMap(RootIndex expected, Tagged<Map> map) {
   return V8HeapCompressionScheme::CompressObject(map.ptr()) ==
          StaticReadOnlyRootsPointerTable[static_cast<size_t>(expected)];
 }
 
-inline bool CheckInstanceMapRange(RootIndexRange expected, Map map) {
+inline bool CheckInstanceMapRange(RootIndexRange expected, Tagged<Map> map) {
   Tagged_t ptr = V8HeapCompressionScheme::CompressObject(map.ptr());
   Tagged_t first =
       StaticReadOnlyRootsPointerTable[static_cast<size_t>(expected.first)];
@@ -145,21 +148,9 @@ inline bool CheckInstanceMapRange(RootIndexRange expected, Map map) {
   return ptr >= first && ptr <= last;
 }
 
-// Maps for primitive objects are allocated in r/o space. JS_RECEIVER maps are
-// all allocated later, i.e. they have a compressed address above the last read
-// only root. Thus, if we have a receiver and need to distinguish whether it is
-// either a primitive object or a JS receiver, it suffices to check if its map
-// is allocated above the following limit address.
-// The actual value is chosen such that it can be encoded as arm64 immediate.
-constexpr Tagged_t kNonJsReceiverMapLimit = 0x10000;
-static_assert(kNonJsReceiverMapLimit >
-              StaticReadOnlyRootsPointerTable[static_cast<size_t>(
-                  RootIndex::kLastReadOnlyRoot)]);
-
 #else
 
 inline bool MayHaveMapCheckFastCase(InstanceType type) { return false; }
-constexpr Tagged_t kNonJsReceiverMapLimit = 0x0;
 
 #endif  // V8_STATIC_ROOTS_BOOL
 
@@ -177,7 +168,7 @@ constexpr Tagged_t kNonJsReceiverMapLimit = 0x0;
 #if V8_STATIC_ROOTS_BOOL
 
 #define INSTANCE_TYPE_CHECKER2(type, forinstancetype_)       \
-  V8_INLINE bool Is##type(Map map_object) {                  \
+  V8_INLINE bool Is##type(Tagged<Map> map_object) {          \
     InstanceType forinstancetype =                           \
         static_cast<InstanceType>(forinstancetype_);         \
     if (base::Optional<RootIndex> expected =                 \
@@ -188,14 +179,14 @@ constexpr Tagged_t kNonJsReceiverMapLimit = 0x0;
             UniqueMapRangeOfInstanceType(forinstancetype)) { \
       return CheckInstanceMapRange(*range, map_object);      \
     }                                                        \
-    return Is##type(map_object.instance_type());             \
+    return Is##type(map_object->instance_type());            \
   }
 
 #else
 
 #define INSTANCE_TYPE_CHECKER2(type, forinstancetype) \
-  V8_INLINE bool Is##type(Map map_object) {           \
-    return Is##type(map_object.instance_type());      \
+  V8_INLINE bool Is##type(Tagged<Map> map_object) {   \
+    return Is##type(map_object->instance_type());     \
   }
 
 #endif  // V8_STATIC_ROOTS_BOOL
@@ -245,22 +236,22 @@ struct InstanceRangeChecker<lower_limit, LAST_TYPE> {
 
 #define INSTANCE_TYPE_CHECKER_RANGE2(type, first_instance_type,      \
                                      last_instance_type)             \
-  V8_INLINE bool Is##type(Map map_object) {                          \
+  V8_INLINE bool Is##type(Tagged<Map> map_object) {                  \
     if (base::Optional<RootIndexRange> range =                       \
             UniqueMapRangeOfInstanceTypeRange(first_instance_type,   \
                                               last_instance_type)) { \
       DCHECK(MayHaveMapCheckFastCase(last_instance_type));           \
       return CheckInstanceMapRange(*range, map_object);              \
     }                                                                \
-    return Is##type(map_object.instance_type());                     \
+    return Is##type(map_object->instance_type());                    \
   }
 
 #else
 
 #define INSTANCE_TYPE_CHECKER_RANGE2(type, first_instance_type, \
                                      last_instance_type)        \
-  V8_INLINE bool Is##type(Map map_object) {                     \
-    return Is##type(map_object.instance_type());                \
+  V8_INLINE bool Is##type(Tagged<Map> map_object) {             \
+    return Is##type(map_object->instance_type());               \
   }
 
 #endif  // V8_STATIC_ROOTS_BOOL
@@ -280,12 +271,12 @@ V8_INLINE constexpr bool IsInternalizedString(InstanceType instance_type) {
          (kStringTag | kInternalizedTag);
 }
 
-V8_INLINE bool IsInternalizedString(Map map_object) {
+V8_INLINE bool IsInternalizedString(Tagged<Map> map_object) {
 #if V8_STATIC_ROOTS_BOOL
   return CheckInstanceMapRange(kUniqueMapRangeOfStringType::kInternalizedString,
                                map_object);
 #else
-  return IsInternalizedString(map_object.instance_type());
+  return IsInternalizedString(map_object->instance_type());
 #endif
 }
 
@@ -294,66 +285,62 @@ V8_INLINE constexpr bool IsExternalString(InstanceType instance_type) {
          kExternalStringTag;
 }
 
-V8_INLINE bool IsExternalString(Map map_object) {
+V8_INLINE bool IsExternalString(Tagged<Map> map_object) {
 #if V8_STATIC_ROOTS_BOOL
   return CheckInstanceMapRange(kUniqueMapRangeOfStringType::kExternalString,
                                map_object);
 #else
-  return IsExternalString(map_object.instance_type());
+  return IsExternalString(map_object->instance_type());
 #endif
 }
 
 V8_INLINE constexpr bool IsThinString(InstanceType instance_type) {
-  return instance_type == THIN_STRING_TYPE;
+  return (instance_type & kStringRepresentationMask) == kThinStringTag;
 }
 
-V8_INLINE bool IsThinString(Map map_object) {
+V8_INLINE bool IsThinString(Tagged<Map> map_object) {
 #if V8_STATIC_ROOTS_BOOL
-  return CheckInstanceMap(RootIndex::kThinStringMap, map_object);
+  return CheckInstanceMapRange(kUniqueMapRangeOfStringType::kThinString,
+                               map_object);
 #else
-  return IsThinString(map_object.instance_type());
+  return IsThinString(map_object->instance_type());
 #endif
 }
 
+V8_INLINE constexpr bool IsReferenceComparable(InstanceType instance_type) {
+  return !IsString(instance_type) && !IsBigInt(instance_type) &&
+         instance_type != HEAP_NUMBER_TYPE;
+}
+
 V8_INLINE constexpr bool IsGcSafeCode(InstanceType instance_type) {
   return IsCode(instance_type);
 }
 
-V8_INLINE bool IsGcSafeCode(Map map_object) { return IsCode(map_object); }
+V8_INLINE bool IsGcSafeCode(Tagged<Map> map_object) {
+  return IsCode(map_object);
+}
 
 V8_INLINE constexpr bool IsAbstractCode(InstanceType instance_type) {
   return IsBytecodeArray(instance_type) || IsCode(instance_type);
 }
 
-V8_INLINE bool IsAbstractCode(Map map_object) {
-  return IsAbstractCode(map_object.instance_type());
+V8_INLINE bool IsAbstractCode(Tagged<Map> map_object) {
+  return IsAbstractCode(map_object->instance_type());
 }
 
 V8_INLINE constexpr bool IsFreeSpaceOrFiller(InstanceType instance_type) {
   return instance_type == FREE_SPACE_TYPE || instance_type == FILLER_TYPE;
 }
 
-V8_INLINE bool IsFreeSpaceOrFiller(Map map_object) {
-  return IsFreeSpaceOrFiller(map_object.instance_type());
+V8_INLINE bool IsFreeSpaceOrFiller(Tagged<Map> map_object) {
+  return IsFreeSpaceOrFiller(map_object->instance_type());
 }
 
 }  // namespace InstanceTypeChecker
 
-#define TYPE_CHECKER(type, ...)                                                \
-  bool HeapObject::Is##type() const {                                          \
-    /* In general, parameterless IsBlah() must not be used for objects */      \
-    /* that might be located in external code space. Note that this version */ \
-    /* is still called from Blah::cast() methods but it's fine because in */   \
-    /* production builds these checks are not enabled anyway and debug */      \
-    /* builds are allowed to be a bit slower. */                               \
-    PtrComprCageBase cage_base = GetPtrComprCageBaseSlow(*this);               \
-    return HeapObject::Is##type(cage_base);                                    \
-  }                                                                            \
-  /* The cage_base passed here is must to be the base of the pointer */        \
-  /* compression cage where the Map space is allocated. */                     \
-  bool HeapObject::Is##type(PtrComprCageBase cage_base) const {                \
-    Map map_object = map(cage_base);                                           \
-    return InstanceTypeChecker::Is##type(map_object);                          \
+#define TYPE_CHECKER(type, ...)                \
+  bool Is##type##Map(Tagged<Map> map) {        \
+    return InstanceTypeChecker::Is##type(map); \
   }
 
 INSTANCE_TYPE_CHECKERS(TYPE_CHECKER)
diff --git a/deps/v8/src/objects/instance-type.h b/deps/v8/src/objects/instance-type.h
index 9a051f5e988ba2..1b55108659c1dd 100644
--- a/deps/v8/src/objects/instance-type.h
+++ b/deps/v8/src/objects/instance-type.h
@@ -5,12 +5,12 @@
 #ifndef V8_OBJECTS_INSTANCE_TYPE_H_
 #define V8_OBJECTS_INSTANCE_TYPE_H_
 
-#include "src/objects/elements-kind.h"
+#include "include/v8-internal.h"
 #include "src/objects/objects-definitions.h"
+#include "torque-generated/instance-types.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
-#include "torque-generated/instance-types.h"
 
 namespace v8 {
 namespace internal {
@@ -111,47 +111,52 @@ static inline bool IsShortcutCandidate(int type) {
 
 enum InstanceType : uint16_t {
   // String types.
-  INTERNALIZED_STRING_TYPE =
+  INTERNALIZED_TWO_BYTE_STRING_TYPE =
       kTwoByteStringTag | kSeqStringTag | kInternalizedTag,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE =
+  INTERNALIZED_ONE_BYTE_STRING_TYPE =
       kOneByteStringTag | kSeqStringTag | kInternalizedTag,
-  EXTERNAL_INTERNALIZED_STRING_TYPE =
+  EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE =
       kTwoByteStringTag | kExternalStringTag | kInternalizedTag,
-  EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE =
+  EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE =
       kOneByteStringTag | kExternalStringTag | kInternalizedTag,
-  UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE =
-      EXTERNAL_INTERNALIZED_STRING_TYPE | kUncachedExternalStringTag |
+  UNCACHED_EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE =
+      EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE | kUncachedExternalStringTag |
       kInternalizedTag,
-  UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE =
-      EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE | kUncachedExternalStringTag |
+  UNCACHED_EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE =
+      EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE | kUncachedExternalStringTag |
       kInternalizedTag,
-  STRING_TYPE = INTERNALIZED_STRING_TYPE | kNotInternalizedTag,
-  ONE_BYTE_STRING_TYPE =
-      ONE_BYTE_INTERNALIZED_STRING_TYPE | kNotInternalizedTag,
-  CONS_STRING_TYPE = kTwoByteStringTag | kConsStringTag | kNotInternalizedTag,
+  SEQ_TWO_BYTE_STRING_TYPE =
+      INTERNALIZED_TWO_BYTE_STRING_TYPE | kNotInternalizedTag,
+  SEQ_ONE_BYTE_STRING_TYPE =
+      INTERNALIZED_ONE_BYTE_STRING_TYPE | kNotInternalizedTag,
+  CONS_TWO_BYTE_STRING_TYPE =
+      kTwoByteStringTag | kConsStringTag | kNotInternalizedTag,
   CONS_ONE_BYTE_STRING_TYPE =
       kOneByteStringTag | kConsStringTag | kNotInternalizedTag,
-  SLICED_STRING_TYPE =
+  SLICED_TWO_BYTE_STRING_TYPE =
       kTwoByteStringTag | kSlicedStringTag | kNotInternalizedTag,
   SLICED_ONE_BYTE_STRING_TYPE =
       kOneByteStringTag | kSlicedStringTag | kNotInternalizedTag,
-  EXTERNAL_STRING_TYPE =
-      EXTERNAL_INTERNALIZED_STRING_TYPE | kNotInternalizedTag,
+  EXTERNAL_TWO_BYTE_STRING_TYPE =
+      EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE | kNotInternalizedTag,
   EXTERNAL_ONE_BYTE_STRING_TYPE =
-      EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE | kNotInternalizedTag,
-  UNCACHED_EXTERNAL_STRING_TYPE =
-      UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE | kNotInternalizedTag,
+      EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE | kNotInternalizedTag,
+  UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE =
+      UNCACHED_EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE | kNotInternalizedTag,
   UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE =
-      UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE | kNotInternalizedTag,
-  // Mark thin strings as two-byte just to be on the safe side.
-  THIN_STRING_TYPE = kTwoByteStringTag | kThinStringTag | kNotInternalizedTag,
-  SHARED_STRING_TYPE = STRING_TYPE | kSharedStringTag,
-  SHARED_ONE_BYTE_STRING_TYPE = ONE_BYTE_STRING_TYPE | kSharedStringTag,
-  SHARED_EXTERNAL_STRING_TYPE = EXTERNAL_STRING_TYPE | kSharedStringTag,
+      UNCACHED_EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE | kNotInternalizedTag,
+  THIN_TWO_BYTE_STRING_TYPE =
+      kTwoByteStringTag | kThinStringTag | kNotInternalizedTag,
+  THIN_ONE_BYTE_STRING_TYPE =
+      kOneByteStringTag | kThinStringTag | kNotInternalizedTag,
+  SHARED_SEQ_TWO_BYTE_STRING_TYPE = SEQ_TWO_BYTE_STRING_TYPE | kSharedStringTag,
+  SHARED_SEQ_ONE_BYTE_STRING_TYPE = SEQ_ONE_BYTE_STRING_TYPE | kSharedStringTag,
+  SHARED_EXTERNAL_TWO_BYTE_STRING_TYPE =
+      EXTERNAL_TWO_BYTE_STRING_TYPE | kSharedStringTag,
   SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE =
       EXTERNAL_ONE_BYTE_STRING_TYPE | kSharedStringTag,
-  SHARED_UNCACHED_EXTERNAL_STRING_TYPE =
-      UNCACHED_EXTERNAL_STRING_TYPE | kSharedStringTag,
+  SHARED_UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE =
+      UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE | kSharedStringTag,
   SHARED_UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE =
       UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE | kSharedStringTag,
 
@@ -170,7 +175,7 @@ enum InstanceType : uint16_t {
 #undef MAKE_TORQUE_INSTANCE_TYPE
 
   // Pseudo-types
-  FIRST_UNIQUE_NAME_TYPE = INTERNALIZED_STRING_TYPE,
+  FIRST_UNIQUE_NAME_TYPE = INTERNALIZED_TWO_BYTE_STRING_TYPE,
   LAST_UNIQUE_NAME_TYPE = SYMBOL_TYPE,
   FIRST_NONSTRING_TYPE = SYMBOL_TYPE,
   // Callable JS Functions are all JS Functions except class constructors.
@@ -258,39 +263,6 @@ static_assert(LAST_TYPE < 1 << 15);
 V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream& os,
                                            InstanceType instance_type);
 
-// List of object types that have a single unique instance type.
-#define INSTANCE_TYPE_CHECKERS_SINGLE(V)           \
-  TORQUE_INSTANCE_CHECKERS_SINGLE_FULLY_DEFINED(V) \
-  TORQUE_INSTANCE_CHECKERS_SINGLE_ONLY_DECLARED(V) \
-  V(BigInt, BIGINT_TYPE)                           \
-  V(FixedArrayExact, FIXED_ARRAY_TYPE)
-
-#define INSTANCE_TYPE_CHECKERS_RANGE(V)           \
-  TORQUE_INSTANCE_CHECKERS_RANGE_FULLY_DEFINED(V) \
-  TORQUE_INSTANCE_CHECKERS_RANGE_ONLY_DECLARED(V)
-
-#define INSTANCE_TYPE_CHECKERS_CUSTOM(V) \
-  V(AbstractCode)                        \
-  V(ExternalString)                      \
-  V(FreeSpaceOrFiller)                   \
-  V(GcSafeCode)                          \
-  V(InternalizedString)
-
-#define INSTANCE_TYPE_CHECKERS(V)  \
-  INSTANCE_TYPE_CHECKERS_SINGLE(V) \
-  INSTANCE_TYPE_CHECKERS_RANGE(V)  \
-  INSTANCE_TYPE_CHECKERS_CUSTOM(V)
-
-namespace InstanceTypeChecker {
-#define IS_TYPE_FUNCTION_DECL(Type, ...)                         \
-  V8_INLINE constexpr bool Is##Type(InstanceType instance_type); \
-  V8_INLINE bool Is##Type(Map map);
-
-INSTANCE_TYPE_CHECKERS(IS_TYPE_FUNCTION_DECL)
-
-#undef IS_TYPE_FUNCTION_DECL
-}  // namespace InstanceTypeChecker
-
 // This list must contain only maps that are shared by all objects of their
 // instance type AND respective object must not represent a parent class for
 // multiple instance types (e.g. DescriptorArray has a unique map, but it has
diff --git a/deps/v8/src/objects/instruction-stream-inl.h b/deps/v8/src/objects/instruction-stream-inl.h
new file mode 100644
index 00000000000000..84f2a9f31920f8
--- /dev/null
+++ b/deps/v8/src/objects/instruction-stream-inl.h
@@ -0,0 +1,259 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_INSTRUCTION_STREAM_INL_H_
+#define V8_OBJECTS_INSTRUCTION_STREAM_INL_H_
+
+#include "src/common/ptr-compr-inl.h"
+#include "src/heap/heap-write-barrier-inl.h"
+#include "src/objects/code.h"
+#include "src/objects/instruction-stream.h"
+#include "src/objects/objects-inl.h"  // For HeapObject::IsInstructionStream.
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+CAST_ACCESSOR(InstructionStream)
+OBJECT_CONSTRUCTORS_IMPL(InstructionStream, HeapObject)
+NEVER_READ_ONLY_SPACE_IMPL(InstructionStream)
+DEF_PRIMITIVE_ACCESSORS(InstructionStream, body_size, kBodySizeOffset, uint32_t)
+
+// TODO(sroettger): remove unused setter functions once all code writes go
+// through the WritableJitAllocation, e.g. the body_size setter above.
+
+// static
+Tagged<InstructionStream> InstructionStream::Initialize(
+    Tagged<HeapObject> self, Tagged<Map> map, uint32_t body_size,
+    Tagged<ByteArray> reloc_info) {
+  {
+    ThreadIsolation::WritableJitAllocation writable_allocation =
+        ThreadIsolation::RegisterInstructionStreamAllocation(
+            self.address(), InstructionStream::SizeFor(body_size));
+    CHECK_EQ(InstructionStream::SizeFor(body_size), writable_allocation.size());
+
+    writable_allocation.WriteHeaderSlot<Map, kMapOffset>(map, kRelaxedStore);
+
+    writable_allocation.WriteHeaderSlot<uint32_t, kBodySizeOffset>(body_size);
+
+    // During the Code initialization process, InstructionStream::code is
+    // briefly unset (the Code object has not been allocated yet). In this state
+    // it is only visible through heap iteration.
+    writable_allocation.WriteHeaderSlot<Smi, kCodeOffset>(Smi::zero(),
+                                                          kReleaseStore);
+
+    DCHECK(!ObjectInYoungGeneration(reloc_info));
+    writable_allocation.WriteHeaderSlot<ByteArray, kRelocationInfoOffset>(
+        reloc_info, kRelaxedStore);
+
+    // Clear header padding
+    writable_allocation.ClearBytes(kUnalignedSize,
+                                   kHeaderSize - kUnalignedSize);
+    // Clear trailing padding.
+    writable_allocation.ClearBytes(kHeaderSize + body_size,
+                                   TrailingPaddingSizeFor(body_size));
+  }
+
+  // We want to keep the code minimal that runs with write access to a JIT
+  // allocation, so trigger the write barriers after the WritableJitAllocation
+  // went out of scope.
+  SLOW_DCHECK(!WriteBarrier::IsRequired(self, map));
+  CONDITIONAL_WRITE_BARRIER(self, kRelocationInfoOffset, reloc_info,
+                            UPDATE_WRITE_BARRIER);
+
+  return InstructionStream::cast(self);
+}
+
+// Copy from compilation artifacts stored in CodeDesc to the target on-heap
+// objects.
+//
+// Note this is quite convoluted for historical reasons. The CodeDesc buffer
+// contains instructions, a part of inline metadata, and the relocation info.
+// Additionally, the unwinding_info is stored in a separate buffer
+// `desc.unwinding_info`. In this method, we copy all these parts into the
+// final on-heap representation.
+//
+// The off-heap representation:
+//
+// CodeDesc.buffer:
+//
+// +-------------------
+// | instructions
+// +-------------------
+// | inline metadata
+// | .. safepoint table
+// | .. handler table
+// | .. constant pool
+// | .. code comments
+// +-------------------
+// | reloc info
+// +-------------------
+//
+// CodeDesc.unwinding_info:  .. the unwinding info.
+//
+// This is transformed into the on-heap representation, where
+// InstructionStream contains all instructions and inline metadata, and a
+// pointer to the relocation info byte array.
+void InstructionStream::Finalize(Tagged<Code> code,
+                                 Tagged<ByteArray> reloc_info, CodeDesc desc,
+                                 Heap* heap) {
+  DisallowGarbageCollection no_gc;
+  base::Optional<WriteBarrierPromise> promise;
+
+  // Copy the relocation info first before we unlock the Jit allocation.
+  // TODO(sroettger): reloc info should live in protected memory.
+  DCHECK_EQ(reloc_info->length(), desc.reloc_size);
+  CopyBytes(reloc_info->GetDataStartAddress(), desc.buffer + desc.reloc_offset,
+            static_cast<size_t>(desc.reloc_size));
+
+  {
+    ThreadIsolation::WritableJitAllocation writable_allocation =
+        ThreadIsolation::LookupJitAllocation(
+            address(), InstructionStream::SizeFor(body_size()),
+            ThreadIsolation::JitAllocationType::kInstructionStream);
+
+    // Copy code and inline metadata.
+    static_assert(InstructionStream::kOnHeapBodyIsContiguous);
+    writable_allocation.CopyCode(kHeaderSize, desc.buffer,
+                                 static_cast<size_t>(desc.instr_size));
+    writable_allocation.CopyData(kHeaderSize + desc.instr_size,
+                                 desc.unwinding_info,
+                                 static_cast<size_t>(desc.unwinding_info_size));
+    DCHECK_EQ(desc.body_size(), desc.instr_size + desc.unwinding_info_size);
+    DCHECK_EQ(code->body_size(),
+              code->instruction_size() + code->metadata_size());
+
+    promise.emplace(RelocateFromDesc(heap, desc, code->constant_pool(), no_gc));
+
+    // Publish the code pointer after the istream has been fully initialized.
+    writable_allocation.WriteHeaderSlot<Code, kCodeOffset>(code, kReleaseStore);
+  }
+
+  // Trigger the write barriers after we dropped  the JIT write permissions.
+  RelocateFromDescWriteBarriers(heap, desc, code->constant_pool(), *promise,
+                                no_gc);
+  CONDITIONAL_WRITE_BARRIER(*this, kCodeOffset, code, UPDATE_WRITE_BARRIER);
+
+  code->FlushICache();
+}
+
+Address InstructionStream::body_end() const {
+  static_assert(kOnHeapBodyIsContiguous);
+  return instruction_start() + body_size();
+}
+
+Tagged<Object> InstructionStream::raw_code(AcquireLoadTag tag) const {
+  PtrComprCageBase cage_base = main_cage_base();
+  Tagged<Object> value =
+      TaggedField<Object, kCodeOffset>::Acquire_Load(cage_base, *this);
+  DCHECK(!ObjectInYoungGeneration(value));
+  return value;
+}
+
+Tagged<Code> InstructionStream::code(AcquireLoadTag tag) const {
+  return Code::cast(raw_code(tag));
+}
+
+void InstructionStream::set_code(Tagged<Code> value, ReleaseStoreTag) {
+  DCHECK(!ObjectInYoungGeneration(value));
+  TaggedField<Code, kCodeOffset>::Release_Store(*this, value);
+  CONDITIONAL_WRITE_BARRIER(*this, kCodeOffset, value, UPDATE_WRITE_BARRIER);
+}
+
+bool InstructionStream::TryGetCode(Tagged<Code>* code_out,
+                                   AcquireLoadTag tag) const {
+  Tagged<Object> maybe_code = raw_code(tag);
+  if (maybe_code == Smi::zero()) return false;
+  *code_out = Code::cast(maybe_code);
+  return true;
+}
+
+bool InstructionStream::TryGetCodeUnchecked(Tagged<Code>* code_out,
+                                            AcquireLoadTag tag) const {
+  Tagged<Object> maybe_code = raw_code(tag);
+  if (maybe_code == Smi::zero()) return false;
+  *code_out = Code::unchecked_cast(maybe_code);
+  return true;
+}
+
+Tagged<ByteArray> InstructionStream::relocation_info() const {
+  PtrComprCageBase cage_base = main_cage_base();
+  Tagged<ByteArray> value =
+      TaggedField<ByteArray, kRelocationInfoOffset>::load(cage_base, *this);
+  DCHECK(!ObjectInYoungGeneration(value));
+  return value;
+}
+
+Address InstructionStream::instruction_start() const {
+  return field_address(kHeaderSize);
+}
+
+Tagged<ByteArray> InstructionStream::unchecked_relocation_info() const {
+  PtrComprCageBase cage_base = main_cage_base();
+  return ByteArray::unchecked_cast(
+      TaggedField<HeapObject, kRelocationInfoOffset>::Acquire_Load(cage_base,
+                                                                   *this));
+}
+
+uint8_t* InstructionStream::relocation_start() const {
+  return relocation_info()->GetDataStartAddress();
+}
+
+uint8_t* InstructionStream::relocation_end() const {
+  return relocation_info()->GetDataEndAddress();
+}
+
+int InstructionStream::relocation_size() const {
+  return relocation_info()->length();
+}
+
+int InstructionStream::Size() const { return SizeFor(body_size()); }
+
+// static
+Tagged<InstructionStream> InstructionStream::FromTargetAddress(
+    Address address) {
+  {
+    // TODO(jgruber,v8:6666): Support embedded builtins here. We'd need to pass
+    // in the current isolate.
+    Address start =
+        reinterpret_cast<Address>(Isolate::CurrentEmbeddedBlobCode());
+    Address end = start + Isolate::CurrentEmbeddedBlobCodeSize();
+    CHECK(address < start || address >= end);
+  }
+
+  Tagged<HeapObject> code =
+      HeapObject::FromAddress(address - InstructionStream::kHeaderSize);
+  // Unchecked cast because we can't rely on the map currently not being a
+  // forwarding pointer.
+  return InstructionStream::unchecked_cast(code);
+}
+
+// static
+Tagged<InstructionStream> InstructionStream::FromEntryAddress(
+    Address location_of_address) {
+  Address code_entry = base::Memory<Address>(location_of_address);
+  Tagged<HeapObject> code =
+      HeapObject::FromAddress(code_entry - InstructionStream::kHeaderSize);
+  // Unchecked cast because we can't rely on the map currently not being a
+  // forwarding pointer.
+  return InstructionStream::unchecked_cast(code);
+}
+
+// static
+PtrComprCageBase InstructionStream::main_cage_base() {
+#ifdef V8_COMPRESS_POINTERS
+  return PtrComprCageBase{V8HeapCompressionScheme::base()};
+#else
+  return PtrComprCageBase{};
+#endif
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_INSTRUCTION_STREAM_INL_H_
diff --git a/deps/v8/src/objects/instruction-stream.cc b/deps/v8/src/objects/instruction-stream.cc
new file mode 100644
index 00000000000000..babdede0bec5d2
--- /dev/null
+++ b/deps/v8/src/objects/instruction-stream.cc
@@ -0,0 +1,133 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/objects/instruction-stream.h"
+
+#include "src/codegen/assembler-inl.h"
+#include "src/codegen/flush-instruction-cache.h"
+#include "src/codegen/reloc-info-inl.h"
+#include "src/codegen/reloc-info.h"
+#include "src/objects/instruction-stream-inl.h"
+
+namespace v8 {
+namespace internal {
+
+void InstructionStream::Relocate(intptr_t delta) {
+  Tagged<Code> code;
+  if (!TryGetCodeUnchecked(&code, kAcquireLoad)) return;
+  // This is called during evacuation and code.instruction_stream() will point
+  // to the old object. So pass *this directly to the RelocIterator.
+  for (RelocIterator it(code, *this, unchecked_relocation_info(),
+                        RelocInfo::kApplyMask);
+       !it.done(); it.next()) {
+    it.rinfo()->apply(delta);
+  }
+  FlushInstructionCache(instruction_start(), code->instruction_size());
+}
+
+// This function performs the relocations but doesn't trigger any write barriers
+// yet. We skip the write barriers here with UNSAFE_SKIP_WRITE_BARRIER but the
+// caller needs to call RelocateFromDescWriteBarriers afterwards.
+InstructionStream::WriteBarrierPromise InstructionStream::RelocateFromDesc(
+    Heap* heap, const CodeDesc& desc, Address constant_pool,
+    const DisallowGarbageCollection& no_gc) {
+  WriteBarrierPromise write_barrier_promise;
+  Assembler* origin = desc.origin;
+  const int mode_mask = RelocInfo::PostCodegenRelocationMask();
+  for (RelocIterator it(*this, constant_pool, mode_mask); !it.done();
+       it.next()) {
+    // IMPORTANT:
+    // this code needs be stay in sync with RelocateFromDescWriteBarriers below.
+
+    RelocInfo::Mode mode = it.rinfo()->rmode();
+    if (RelocInfo::IsEmbeddedObjectMode(mode)) {
+      Handle<HeapObject> p = it.rinfo()->target_object_handle(origin);
+      it.rinfo()->set_target_object(*this, *p, UNSAFE_SKIP_WRITE_BARRIER,
+                                    SKIP_ICACHE_FLUSH);
+      write_barrier_promise.RegisterAddress(it.rinfo()->pc());
+    } else if (RelocInfo::IsCodeTargetMode(mode)) {
+      // Rewrite code handles to direct pointers to the first instruction in the
+      // code object.
+      Handle<HeapObject> p = it.rinfo()->target_object_handle(origin);
+      DCHECK(IsCode(*p));
+      Tagged<InstructionStream> target_istream =
+          Code::cast(*p)->instruction_stream();
+      it.rinfo()->set_target_address(*this, target_istream->instruction_start(),
+                                     UNSAFE_SKIP_WRITE_BARRIER,
+                                     SKIP_ICACHE_FLUSH);
+      write_barrier_promise.RegisterAddress(it.rinfo()->pc());
+    } else if (RelocInfo::IsNearBuiltinEntry(mode)) {
+      // Rewrite builtin IDs to PC-relative offset to the builtin entry point.
+      Builtin builtin = it.rinfo()->target_builtin_at(origin);
+      Address p =
+          heap->isolate()->builtin_entry_table()[Builtins::ToInt(builtin)];
+      // This won't trigger a write barrier, but setting mode to
+      // UPDATE_WRITE_BARRIER to make it clear that we didn't forget about it
+      // below.
+      it.rinfo()->set_target_address(*this, p, UPDATE_WRITE_BARRIER,
+                                     SKIP_ICACHE_FLUSH);
+      DCHECK_EQ(p, it.rinfo()->target_address());
+    } else if (RelocInfo::IsWasmStubCall(mode)) {
+#if V8_ENABLE_WEBASSEMBLY
+      // Map wasm stub id to builtin.
+      uint32_t stub_call_tag = it.rinfo()->wasm_call_tag();
+      DCHECK_LT(stub_call_tag, wasm::WasmCode::kRuntimeStubCount);
+      Builtin builtin = wasm::RuntimeStubIdToBuiltinName(
+          static_cast<wasm::WasmCode::RuntimeStubId>(stub_call_tag));
+      // Store the builtin address in relocation info.
+      Address entry =
+          heap->isolate()->builtin_entry_table()[Builtins::ToInt(builtin)];
+      it.rinfo()->set_wasm_stub_call_address(entry, SKIP_ICACHE_FLUSH);
+#else
+      UNREACHABLE();
+#endif
+    } else {
+      intptr_t delta =
+          instruction_start() - reinterpret_cast<Address>(desc.buffer);
+      it.rinfo()->apply(delta);
+    }
+  }
+  return write_barrier_promise;
+}
+
+void InstructionStream::RelocateFromDescWriteBarriers(
+    Heap* heap, const CodeDesc& desc, Address constant_pool,
+    WriteBarrierPromise& write_barrier_promise,
+    const DisallowGarbageCollection& no_gc) {
+  const int mode_mask = RelocInfo::PostCodegenRelocationMask();
+  for (RelocIterator it(*this, constant_pool, mode_mask); !it.done();
+       it.next()) {
+    // IMPORTANT:
+    // this code needs be stay in sync with RelocateFromDesc above.
+
+    RelocInfo::Mode mode = it.rinfo()->rmode();
+    if (RelocInfo::IsEmbeddedObjectMode(mode)) {
+      Tagged<HeapObject> p = it.rinfo()->target_object(heap->isolate());
+      WriteBarrierForCode(*this, it.rinfo(), p, UPDATE_WRITE_BARRIER);
+      write_barrier_promise.ResolveAddress(it.rinfo()->pc());
+    } else if (RelocInfo::IsCodeTargetMode(mode)) {
+      Tagged<InstructionStream> target_istream =
+          InstructionStream::FromTargetAddress(it.rinfo()->target_address());
+      WriteBarrierForCode(*this, it.rinfo(), target_istream,
+                          UPDATE_WRITE_BARRIER);
+      write_barrier_promise.ResolveAddress(it.rinfo()->pc());
+    }
+  }
+}
+
+#ifdef DEBUG
+void InstructionStream::WriteBarrierPromise::RegisterAddress(Address address) {
+  DCHECK(delayed_write_barriers_.insert(address).second);
+}
+
+void InstructionStream::WriteBarrierPromise::ResolveAddress(Address address) {
+  DCHECK_EQ(delayed_write_barriers_.erase(address), 1);
+}
+InstructionStream::WriteBarrierPromise::~WriteBarrierPromise() {
+  DCHECK(delayed_write_barriers_.empty());
+}
+#endif
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/objects/instruction-stream.h b/deps/v8/src/objects/instruction-stream.h
new file mode 100644
index 00000000000000..cb353dad2e91b1
--- /dev/null
+++ b/deps/v8/src/objects/instruction-stream.h
@@ -0,0 +1,195 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_INSTRUCTION_STREAM_H_
+#define V8_OBJECTS_INSTRUCTION_STREAM_H_
+
+#ifdef DEBUG
+#include <set>
+#endif
+
+#include "src/codegen/code-desc.h"
+#include "src/objects/heap-object.h"
+
+// Has to be the last include (doesn't have include guards):
+#include "src/objects/object-macros.h"
+
+namespace v8 {
+namespace internal {
+
+class Code;
+
+// InstructionStream contains the instruction stream for V8-generated code
+// objects.
+//
+// When V8_EXTERNAL_CODE_SPACE is enabled, InstructionStream objects are
+// allocated in a separate pointer compression cage instead of the cage where
+// all the other objects are allocated.
+class InstructionStream : public HeapObject {
+ public:
+  NEVER_READ_ONLY_SPACE
+
+  // All InstructionStream objects have the following layout:
+  //
+  //  +--------------------------+
+  //  |          header          |
+  //  +--------------------------+  <-- body_start()
+  //  |       instructions       |   == instruction_start()
+  //  |           ...            |
+  //  | padded to meta alignment |      see kMetadataAlignment
+  //  +--------------------------+  <-- instruction_end()
+  //  |         metadata         |   == metadata_start() (MS)
+  //  |           ...            |
+  //  |                          |  <-- MS + handler_table_offset()
+  //  |                          |  <-- MS + constant_pool_offset()
+  //  |                          |  <-- MS + code_comments_offset()
+  //  |                          |  <-- MS + unwinding_info_offset()
+  //  | padded to obj alignment  |
+  //  +--------------------------+  <-- metadata_end() == body_end()
+  //  | padded to kCodeAlignmentMinusCodeHeader
+  //  +--------------------------+
+  //
+  // In other words, the variable-size 'body' consists of 'instructions' and
+  // 'metadata'.
+
+  // Constants for use in static asserts, stating whether the body is adjacent,
+  // i.e. instructions and metadata areas are adjacent.
+  static constexpr bool kOnHeapBodyIsContiguous = true;
+  static constexpr bool kOffHeapBodyIsContiguous = false;
+  static constexpr bool kBodyIsContiguous =
+      kOnHeapBodyIsContiguous && kOffHeapBodyIsContiguous;
+
+  inline Address instruction_start() const;
+
+  // The metadata section is aligned to this value.
+  static constexpr int kMetadataAlignment = kIntSize;
+
+  // [code]: The associated Code object.
+  //
+  // Set to Smi::zero() during initialization. Heap iterators may see
+  // InstructionStream objects in this state.
+  inline Tagged<Code> code(AcquireLoadTag tag) const;
+  inline void set_code(Tagged<Code> value, ReleaseStoreTag tag);
+  inline Tagged<Object> raw_code(AcquireLoadTag tag) const;
+  // Use when the InstructionStream may be uninitialized:
+  inline bool TryGetCode(Tagged<Code>* code_out, AcquireLoadTag tag) const;
+  inline bool TryGetCodeUnchecked(Tagged<Code>* code_out,
+                                  AcquireLoadTag tag) const;
+
+  // [relocation_info]: InstructionStream relocation information.
+  inline Tagged<ByteArray> relocation_info() const;
+  // Unchecked accessor to be used during GC.
+  inline Tagged<ByteArray> unchecked_relocation_info() const;
+
+  inline uint8_t* relocation_start() const;
+  inline uint8_t* relocation_end() const;
+  inline int relocation_size() const;
+
+  // The size of the entire body section, containing instructions and inlined
+  // metadata.
+  DECL_PRIMITIVE_ACCESSORS(body_size, uint32_t)
+  inline Address body_end() const;
+
+  static constexpr int TrailingPaddingSizeFor(uint32_t body_size) {
+    return RoundUp<kCodeAlignment>(kHeaderSize + body_size) - kHeaderSize -
+           body_size;
+  }
+  static constexpr int SizeFor(int body_size) {
+    return kHeaderSize + body_size + TrailingPaddingSizeFor(body_size);
+  }
+  inline int Size() const;
+
+  static inline Tagged<InstructionStream> FromTargetAddress(Address address);
+  static inline Tagged<InstructionStream> FromEntryAddress(
+      Address location_of_address);
+
+  // Relocate the code by delta bytes.
+  void Relocate(intptr_t delta);
+
+  static V8_INLINE Tagged<InstructionStream> Initialize(
+      Tagged<HeapObject> self, Tagged<Map> map, uint32_t body_size,
+      Tagged<ByteArray> reloc_info);
+  V8_INLINE void Finalize(Tagged<Code> code, Tagged<ByteArray> reloc_info,
+                          CodeDesc desc, Heap* heap);
+
+  DECL_CAST(InstructionStream)
+  DECL_PRINTER(InstructionStream)
+  DECL_VERIFIER(InstructionStream)
+
+  // Layout description.
+#define ISTREAM_FIELDS(V)                                             \
+  V(kStartOfStrongFieldsOffset, 0)                                    \
+  V(kCodeOffset, kTaggedSize)                                         \
+  V(kRelocationInfoOffset, kTaggedSize)                               \
+  V(kEndOfStrongFieldsOffset, 0)                                      \
+  /* Data or code not directly visited by GC directly starts here. */ \
+  V(kDataStart, 0)                                                    \
+  V(kBodySizeOffset, kUInt32Size)                                     \
+  V(kUnalignedSize, OBJECT_POINTER_PADDING(kUnalignedSize))           \
+  V(kHeaderSize, 0)
+  DEFINE_FIELD_OFFSET_CONSTANTS(HeapObject::kHeaderSize, ISTREAM_FIELDS)
+#undef ISTREAM_FIELDS
+
+  static_assert(kCodeAlignment >= kHeaderSize);
+  // We do two things to ensure kCodeAlignment of the entry address:
+  // 1) Add kCodeAlignmentMinusCodeHeader padding once in the beginning of every
+  //    MemoryChunk.
+  // 2) Round up all IStream allocations to a multiple of kCodeAlignment, see
+  //    TrailingPaddingSizeFor.
+  // Together, the IStream object itself will always start at offset
+  // kCodeAlignmentMinusCodeHeader, which aligns the entry to kCodeAlignment.
+  static constexpr int kCodeAlignmentMinusCodeHeader =
+      kCodeAlignment - kHeaderSize;
+
+  class BodyDescriptor;
+
+ private:
+  friend class Factory;
+
+  class V8_NODISCARD WriteBarrierPromise {
+   public:
+    WriteBarrierPromise() = default;
+    WriteBarrierPromise(WriteBarrierPromise&&) V8_NOEXCEPT = default;
+    WriteBarrierPromise(const WriteBarrierPromise&) = delete;
+    WriteBarrierPromise& operator=(const WriteBarrierPromise&) = delete;
+
+#ifdef DEBUG
+    void RegisterAddress(Address address);
+    void ResolveAddress(Address address);
+    ~WriteBarrierPromise();
+
+   private:
+    std::set<Address> delayed_write_barriers_;
+#else
+    void RegisterAddress(Address address) {}
+    void ResolveAddress(Address address) {}
+#endif
+  };
+
+  // Migrate code from desc without flushing the instruction cache. This
+  // function will not trigger any write barriers and the caller needs to call
+  // RelocateFromDescWriteBarriers afterwards. This is split into two functions,
+  // since the former needs write access to executable memory and we need to
+  // keep this critical section minimal since any memory write poses attack
+  // surface for CFI and will require special validation.
+  WriteBarrierPromise RelocateFromDesc(Heap* heap, const CodeDesc& desc,
+                                       Address constant_pool,
+                                       const DisallowGarbageCollection& no_gc);
+  void RelocateFromDescWriteBarriers(Heap* heap, const CodeDesc& desc,
+                                     Address constant_pool,
+                                     WriteBarrierPromise& promise,
+                                     const DisallowGarbageCollection& no_gc);
+
+  // Must be used when loading any of InstructionStream's tagged fields.
+  static inline PtrComprCageBase main_cage_base();
+
+  OBJECT_CONSTRUCTORS(InstructionStream, HeapObject);
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#include "src/objects/object-macros-undef.h"
+
+#endif  // V8_OBJECTS_INSTRUCTION_STREAM_H_
diff --git a/deps/v8/src/objects/intl-objects.cc b/deps/v8/src/objects/intl-objects.cc
index ab197778b8b78c..d6e63aac76003a 100644
--- a/deps/v8/src/objects/intl-objects.cc
+++ b/deps/v8/src/objects/intl-objects.cc
@@ -102,7 +102,7 @@ inline constexpr uint16_t ToLatin1Upper(uint16_t ch) {
 }
 
 template <typename Char>
-bool ToUpperFastASCII(const base::Vector<const Char>& src,
+bool ToUpperFastASCII(base::Vector<const Char> src,
                       Handle<SeqOneByteString> result) {
   // Do a faster loop for the case where all the characters are ASCII.
   uint16_t ored = 0;
@@ -118,7 +118,7 @@ bool ToUpperFastASCII(const base::Vector<const Char>& src,
 const uint16_t sharp_s = 0xDF;
 
 template <typename Char>
-bool ToUpperOneByte(const base::Vector<const Char>& src, uint8_t* dest,
+bool ToUpperOneByte(base::Vector<const Char> src, uint8_t* dest,
                     int* sharp_s_count) {
   // Still pretty-fast path for the input with non-ASCII Latin-1 characters.
 
@@ -144,7 +144,7 @@ bool ToUpperOneByte(const base::Vector<const Char>& src, uint8_t* dest,
 }
 
 template <typename Char>
-void ToUpperWithSharpS(const base::Vector<const Char>& src,
+void ToUpperWithSharpS(base::Vector<const Char> src,
                        Handle<SeqOneByteString> result) {
   int32_t dest_index = 0;
   for (auto it = src.begin(); it != src.end(); ++it) {
@@ -158,9 +158,9 @@ void ToUpperWithSharpS(const base::Vector<const Char>& src,
   }
 }
 
-inline int FindFirstUpperOrNonAscii(String s, int length) {
+inline int FindFirstUpperOrNonAscii(Tagged<String> s, int length) {
   for (int index = 0; index < length; ++index) {
-    uint16_t ch = s.Get(index);
+    uint16_t ch = s->Get(index);
     if (V8_UNLIKELY(IsAsciiUpper(ch) || ch & ~0x7F)) {
       return index;
     }
@@ -288,17 +288,18 @@ MaybeHandle<String> LocaleConvertCase(Isolate* isolate, Handle<String> s,
 // strings and does not allocate. Note that {src} could still be, e.g., a
 // one-byte sliced string with a two-byte parent string.
 // Called from TF builtins.
-String Intl::ConvertOneByteToLower(String src, String dst) {
-  DCHECK_EQ(src.length(), dst.length());
-  DCHECK(src.IsOneByteRepresentation());
-  DCHECK(src.IsFlat());
-  DCHECK(dst.IsSeqOneByteString());
+Tagged<String> Intl::ConvertOneByteToLower(Tagged<String> src,
+                                           Tagged<String> dst) {
+  DCHECK_EQ(src->length(), dst->length());
+  DCHECK(src->IsOneByteRepresentation());
+  DCHECK(src->IsFlat());
+  DCHECK(IsSeqOneByteString(dst));
 
   DisallowGarbageCollection no_gc;
 
-  const int length = src.length();
-  String::FlatContent src_flat = src.GetFlatContent(no_gc);
-  uint8_t* dst_data = SeqOneByteString::cast(dst).GetChars(no_gc);
+  const int length = src->length();
+  String::FlatContent src_flat = src->GetFlatContent(no_gc);
+  uint8_t* dst_data = SeqOneByteString::cast(dst)->GetChars(no_gc);
 
   if (src_flat.IsOneByte()) {
     const uint8_t* src_data = src_flat.ToOneByteVector().begin();
@@ -450,8 +451,7 @@ Maybe<icu::Locale> CreateICULocale(const std::string& bcp47_locale) {
   UErrorCode status = U_ZERO_ERROR;
 
   icu::Locale icu_locale = icu::Locale::forLanguageTag(bcp47_locale, status);
-  DCHECK(U_SUCCESS(status));
-  if (icu_locale.isBogus()) {
+  if (U_FAILURE(status) || icu_locale.isBogus()) {
     return Nothing<icu::Locale>();
   }
 
@@ -623,7 +623,8 @@ MaybeHandle<Object> Intl::LegacyUnwrapReceiver(Isolate* isolate,
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, obj_ordinary_has_instance,
       Object::OrdinaryHasInstance(isolate, constructor, receiver), Object);
-  bool ordinary_has_instance = obj_ordinary_has_instance->BooleanValue(isolate);
+  bool ordinary_has_instance =
+      Object::BooleanValue(*obj_ordinary_has_instance, isolate);
 
   // 2. If receiver does not have an [[Initialized...]] internal slot
   //    and ? OrdinaryHasInstance(constructor, receiver) is true, then
@@ -749,9 +750,9 @@ Maybe<std::string> CanonicalizeLanguageTag(Isolate* isolate,
   // 7c iv. If IsStructurallyValidLanguageTag(tag) is false, throw a
   // RangeError exception.
 
-  if (locale_in->IsString()) {
+  if (IsString(*locale_in)) {
     locale_str = Handle<String>::cast(locale_in);
-  } else if (locale_in->IsJSReceiver()) {
+  } else if (IsJSReceiver(*locale_in)) {
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, locale_str,
                                      Object::ToString(isolate, locale_in),
                                      Nothing<std::string>());
@@ -775,7 +776,7 @@ Maybe<std::string> CanonicalizeLanguageTag(Isolate* isolate,
 Maybe<std::vector<std::string>> Intl::CanonicalizeLocaleList(
     Isolate* isolate, Handle<Object> locales, bool only_return_one_result) {
   // 1. If locales is undefined, then
-  if (locales->IsUndefined(isolate)) {
+  if (IsUndefined(*locales, isolate)) {
     // 1a. Return a new empty List.
     return Just(std::vector<std::string>());
   }
@@ -783,14 +784,14 @@ Maybe<std::vector<std::string>> Intl::CanonicalizeLocaleList(
   std::vector<std::string> seen;
   // 3. If Type(locales) is String or locales has an [[InitializedLocale]]
   // internal slot,  then
-  if (locales->IsJSLocale()) {
+  if (IsJSLocale(*locales)) {
     // Since this value came from JSLocale, which is already went though the
     // CanonializeLanguageTag process once, therefore there are no need to
     // call CanonializeLanguageTag again.
     seen.push_back(JSLocale::ToString(Handle<JSLocale>::cast(locales)));
     return Just(seen);
   }
-  if (locales->IsString()) {
+  if (IsString(*locales)) {
     // 3a. Let O be CreateArrayFromList(« locales »).
     // Instead of creating a one-element array and then iterating over it,
     // we inline the body of the iteration:
@@ -816,7 +817,7 @@ Maybe<std::vector<std::string>> Intl::CanonicalizeLocaleList(
   // up to 2^53-1 if {length_obj} says so. Since cases above 2^32 probably
   // don't happen in practice (and would be very slow if they do), we'll keep
   // the code simple for now by using a saturating to-uint32 conversion.
-  double raw_length = length_obj->Number();
+  double raw_length = Object::Number(*length_obj);
   uint32_t len =
       raw_length >= kMaxUInt32 ? kMaxUInt32 : static_cast<uint32_t>(raw_length);
   // 6. Let k be 0.
@@ -838,7 +839,7 @@ Maybe<std::vector<std::string>> Intl::CanonicalizeLocaleList(
     // 7c iii. If Type(kValue) is Object and kValue has an [[InitializedLocale]]
     // internal slot, then
     std::string canonicalized_tag;
-    if (k_value->IsJSLocale()) {
+    if (IsJSLocale(*k_value)) {
       // 7c iii. 1. Let tag be kValue.[[Locale]].
       canonicalized_tag = JSLocale::ToString(Handle<JSLocale>::cast(k_value));
       // 7c iv. Else,
@@ -916,7 +917,7 @@ MaybeHandle<String> Intl::StringLocaleConvertCase(Isolate* isolate,
 template <class IsolateT>
 Intl::CompareStringsOptions Intl::CompareStringsOptionsFor(
     IsolateT* isolate, Handle<Object> locales, Handle<Object> options) {
-  if (!options->IsUndefined(isolate)) {
+  if (!IsUndefined(*options, isolate)) {
     return CompareStringsOptions::kNone;
   }
 
@@ -934,7 +935,7 @@ Intl::CompareStringsOptions Intl::CompareStringsOptionsFor(
       "sl",    "sv", "sw", "vi",    "en-DE", "en-GB",
   };
 
-  if (locales->IsUndefined(isolate)) {
+  if (IsUndefined(*locales, isolate)) {
     const std::string& default_locale = isolate->DefaultLocale();
     for (const char* fast_locale : kFastLocales) {
       if (strcmp(fast_locale, default_locale.c_str()) == 0) {
@@ -945,7 +946,7 @@ Intl::CompareStringsOptions Intl::CompareStringsOptionsFor(
     return CompareStringsOptions::kNone;
   }
 
-  if (!locales->IsString()) return CompareStringsOptions::kNone;
+  if (!IsString(*locales)) return CompareStringsOptions::kNone;
 
   Handle<String> locales_string = Handle<String>::cast(locales);
   for (const char* fast_locale : kFastLocales) {
@@ -970,8 +971,8 @@ base::Optional<int> Intl::StringLocaleCompare(
   // options is undefined, as that is the only case when the specified
   // side-effects of examining those arguments are unobservable.
   const bool can_cache =
-      (locales->IsString() || locales->IsUndefined(isolate)) &&
-      options->IsUndefined(isolate);
+      (IsString(*locales) || IsUndefined(*locales, isolate)) &&
+      IsUndefined(*options, isolate);
   // We may be able to take the fast path, depending on the `locales` and
   // `options` arguments.
   const CompareStringsOptions compare_strings_options =
@@ -990,7 +991,7 @@ base::Optional<int> Intl::StringLocaleCompare(
 
   Handle<JSFunction> constructor = Handle<JSFunction>(
       JSFunction::cast(
-          isolate->context().native_context().intl_collator_function()),
+          isolate->context()->native_context()->intl_collator_function()),
       isolate);
 
   Handle<JSCollator> collator;
@@ -1000,9 +1001,10 @@ base::Optional<int> Intl::StringLocaleCompare(
   if (can_cache) {
     isolate->set_icu_object_in_cache(
         Isolate::ICUObjectCacheType::kDefaultCollator, locales,
-        std::static_pointer_cast<icu::UMemory>(collator->icu_collator().get()));
+        std::static_pointer_cast<icu::UMemory>(
+            collator->icu_collator()->get()));
   }
-  icu::Collator* icu_collator = collator->icu_collator().raw();
+  icu::Collator* icu_collator = collator->icu_collator()->raw();
   return Intl::CompareStrings(isolate, *icu_collator, string1, string2,
                               compare_strings_options);
 }
@@ -1466,8 +1468,8 @@ MaybeHandle<String> Intl::NumberToLocaleString(Isolate* isolate,
   // We only cache the instance when locales is a string/undefined and
   // options is undefined, as that is the only case when the specified
   // side-effects of examining those arguments are unobservable.
-  bool can_cache = (locales->IsString() || locales->IsUndefined(isolate)) &&
-                   options->IsUndefined(isolate);
+  bool can_cache = (IsString(*locales) || IsUndefined(*locales, isolate)) &&
+                   IsUndefined(*options, isolate);
   if (can_cache) {
     icu::number::LocalizedNumberFormatter* cached_number_format =
         static_cast<icu::number::LocalizedNumberFormatter*>(
@@ -1482,7 +1484,7 @@ MaybeHandle<String> Intl::NumberToLocaleString(Isolate* isolate,
 
   Handle<JSFunction> constructor = Handle<JSFunction>(
       JSFunction::cast(
-          isolate->context().native_context().intl_number_format_function()),
+          isolate->context()->native_context()->intl_number_format_function()),
       isolate);
   Handle<JSNumberFormat> number_format;
   // 2. Let numberFormat be ? Construct(%NumberFormat%, « locales, options »).
@@ -1502,23 +1504,52 @@ MaybeHandle<String> Intl::NumberToLocaleString(Isolate* isolate,
     isolate->set_icu_object_in_cache(
         Isolate::ICUObjectCacheType::kDefaultNumberFormat, locales,
         std::static_pointer_cast<icu::UMemory>(
-            number_format->icu_number_formatter().get()));
+            number_format->icu_number_formatter()->get()));
   }
 
   // Return FormatNumber(numberFormat, x).
   icu::number::LocalizedNumberFormatter* icu_number_format =
-      number_format->icu_number_formatter().raw();
+      number_format->icu_number_formatter()->raw();
   return JSNumberFormat::FormatNumeric(isolate, *icu_number_format,
                                        numeric_obj);
 }
 
+namespace {
+
+// 22. is in « 1, 2, 5, 10, 20, 25, 50, 100, 200, 250, 500, 1000, 2000, 2500,
+// 5000 »
+bool IsValidRoundingIncrement(int value) {
+  switch (value) {
+    case 1:
+    case 2:
+    case 5:
+    case 10:
+    case 20:
+    case 25:
+    case 50:
+    case 100:
+    case 200:
+    case 250:
+    case 500:
+    case 1000:
+    case 2000:
+    case 2500:
+    case 5000:
+      return true;
+    default:
+      return false;
+  }
+}
+
+}  // namespace
+
 Maybe<Intl::NumberFormatDigitOptions> Intl::SetNumberFormatDigitOptions(
     Isolate* isolate, Handle<JSReceiver> options, int mnfd_default,
-    int mxfd_default, bool notation_is_compact) {
+    int mxfd_default, bool notation_is_compact, const char* service) {
   Factory* factory = isolate->factory();
   Intl::NumberFormatDigitOptions digit_options;
 
-  // 5. Let mnid be ? GetNumberOption(options, "minimumIntegerDigits,", 1, 21,
+  // 1. Let mnid be ? GetNumberOption(options, "minimumIntegerDigits,", 1, 21,
   // 1).
   int mnid = 1;
   if (!GetNumberOption(isolate, options, factory->minimumIntegerDigits_string(),
@@ -1527,7 +1558,7 @@ Maybe<Intl::NumberFormatDigitOptions> Intl::SetNumberFormatDigitOptions(
     return Nothing<NumberFormatDigitOptions>();
   }
 
-  // 6. Let mnfd be ? Get(options, "minimumFractionDigits").
+  // 2. Let mnfd be ? Get(options, "minimumFractionDigits").
   Handle<Object> mnfd_obj;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, mnfd_obj,
@@ -1535,7 +1566,7 @@ Maybe<Intl::NumberFormatDigitOptions> Intl::SetNumberFormatDigitOptions(
                               factory->minimumFractionDigits_string()),
       Nothing<NumberFormatDigitOptions>());
 
-  // 7. Let mxfd be ? Get(options, "maximumFractionDigits").
+  // 3. Let mxfd be ? Get(options, "maximumFractionDigits").
   Handle<Object> mxfd_obj;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, mxfd_obj,
@@ -1543,7 +1574,7 @@ Maybe<Intl::NumberFormatDigitOptions> Intl::SetNumberFormatDigitOptions(
                               factory->maximumFractionDigits_string()),
       Nothing<NumberFormatDigitOptions>());
 
-  // 8.  Let mnsd be ? Get(options, "minimumSignificantDigits").
+  // 4.  Let mnsd be ? Get(options, "minimumSignificantDigits").
   Handle<Object> mnsd_obj;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, mnsd_obj,
@@ -1551,7 +1582,7 @@ Maybe<Intl::NumberFormatDigitOptions> Intl::SetNumberFormatDigitOptions(
                               factory->minimumSignificantDigits_string()),
       Nothing<NumberFormatDigitOptions>());
 
-  // 9. Let mxsd be ? Get(options, "maximumSignificantDigits").
+  // 5. Let mxsd be ? Get(options, "maximumSignificantDigits").
   Handle<Object> mxsd_obj;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, mxsd_obj,
@@ -1563,158 +1594,224 @@ Maybe<Intl::NumberFormatDigitOptions> Intl::SetNumberFormatDigitOptions(
   digit_options.minimum_significant_digits = 0;
   digit_options.maximum_significant_digits = 0;
 
-  // 10. Set intlObj.[[MinimumIntegerDigits]] to mnid.
+  // 6. Set intlObj.[[MinimumIntegerDigits]] to mnid.
   digit_options.minimum_integer_digits = mnid;
 
-  if (v8_flags.harmony_intl_number_format_v3) {
-    // 11. Let roundingPriority be ? GetOption(options, "roundingPriority",
-    // "string", « "auto", "morePrecision", "lessPrecision" », "auto").
-
-    Maybe<RoundingPriority> maybe_rounding_priority =
-        GetStringOption<RoundingPriority>(
-            isolate, options, "roundingPriority", "SetNumberFormatDigitOptions",
-            {"auto", "morePrecision", "lessPrecision"},
-            {RoundingPriority::kAuto, RoundingPriority::kMorePrecision,
-             RoundingPriority::kLessPrecision},
-            RoundingPriority::kAuto);
-    MAYBE_RETURN(maybe_rounding_priority, Nothing<NumberFormatDigitOptions>());
-    digit_options.rounding_priority = maybe_rounding_priority.FromJust();
+  // 7. Let roundingPriority be ? GetOption(options, "roundingPriority",
+  // "string", « "auto", "morePrecision", "lessPrecision" », "auto").
+
+  Maybe<RoundingPriority> maybe_rounding_priority =
+      GetStringOption<RoundingPriority>(
+          isolate, options, "roundingPriority", service,
+          {"auto", "morePrecision", "lessPrecision"},
+          {RoundingPriority::kAuto, RoundingPriority::kMorePrecision,
+           RoundingPriority::kLessPrecision},
+          RoundingPriority::kAuto);
+  MAYBE_RETURN(maybe_rounding_priority, Nothing<NumberFormatDigitOptions>());
+  digit_options.rounding_priority = maybe_rounding_priority.FromJust();
+
+  // 8. Let roundingIncrement be ? GetNumberOption(options, "roundingIncrement",
+  // 1, 5000, 1).
+  Maybe<int> maybe_rounding_increment = GetNumberOption(
+      isolate, options, factory->roundingIncrement_string(), 1, 5000, 1);
+  if (!maybe_rounding_increment.To(&digit_options.rounding_increment)) {
+    return Nothing<NumberFormatDigitOptions>();
   }
-
-  // 12. If mnsd is not undefined or mxsd is not undefined, then
+  // 9. If roundingIncrement is not in « 1, 2, 5, 10, 20, 25, 50, 100, 200, 250,
+  // 500, 1000, 2000, 2500, 5000 », throw a RangeError exception.
+  if (!IsValidRoundingIncrement(digit_options.rounding_increment)) {
+    THROW_NEW_ERROR_RETURN_VALUE(
+        isolate,
+        NewRangeError(MessageTemplate::kPropertyValueOutOfRange,
+                      factory->roundingIncrement_string()),
+        Nothing<NumberFormatDigitOptions>());
+  }
+
+  // 10. Let roundingMode be ? GetOption(options, "roundingMode", string, «
+  // "ceil", "floor", "expand", "trunc", "halfCeil", "halfFloor", "halfExpand",
+  // "halfTrunc", "halfEven" », "halfExpand").
+  Maybe<RoundingMode> maybe_rounding_mode = GetStringOption<RoundingMode>(
+      isolate, options, "roundingMode", service,
+      {"ceil", "floor", "expand", "trunc", "halfCeil", "halfFloor",
+       "halfExpand", "halfTrunc", "halfEven"},
+      {RoundingMode::kCeil, RoundingMode::kFloor, RoundingMode::kExpand,
+       RoundingMode::kTrunc, RoundingMode::kHalfCeil, RoundingMode::kHalfFloor,
+       RoundingMode::kHalfExpand, RoundingMode::kHalfTrunc,
+       RoundingMode::kHalfEven},
+      RoundingMode::kHalfExpand);
+  MAYBE_RETURN(maybe_rounding_mode, Nothing<NumberFormatDigitOptions>());
+  digit_options.rounding_mode = maybe_rounding_mode.FromJust();
+
+  // 11. Let trailingZeroDisplay be ? GetOption(options, "trailingZeroDisplay",
+  // string, « "auto", "stripIfInteger" », "auto").
+  Maybe<TrailingZeroDisplay> maybe_trailing_zero_display =
+      GetStringOption<TrailingZeroDisplay>(
+          isolate, options, "trailingZeroDisplay", service,
+          {"auto", "stripIfInteger"},
+          {TrailingZeroDisplay::kAuto, TrailingZeroDisplay::kStripIfInteger},
+          TrailingZeroDisplay::kAuto);
+  MAYBE_RETURN(maybe_trailing_zero_display,
+               Nothing<NumberFormatDigitOptions>());
+  digit_options.trailing_zero_display = maybe_trailing_zero_display.FromJust();
+
+  // 12. NOTE: All fields required by SetNumberFormatDigitOptions have now been
+  // read from options. The remainder of this AO interprets the options and may
+  // throw exceptions.
+
+  // 17. If mnsd is not undefined or mxsd is not undefined, then
   // a. Set hasSd to true.
-  // 13. Else,
+  // 18. Else,
   // a. Set hasSd to false.
   bool has_sd =
-      (!mnsd_obj->IsUndefined(isolate)) || (!mxsd_obj->IsUndefined(isolate));
+      (!IsUndefined(*mnsd_obj, isolate)) || (!IsUndefined(*mxsd_obj, isolate));
 
-  // 14. If mnfd is not undefined or mxfd is not undefined, then
+  // 19. If mnfd is not undefined or mxfd is not undefined, then
   // a. Set hasFd to true.
-  // 15. Else,
+  // 22. Else,
   // a. Set hasFd to false.
   bool has_fd =
-      (!mnfd_obj->IsUndefined(isolate)) || (!mxfd_obj->IsUndefined(isolate));
-
-  // 17. If hasSd or roundingPriority is not "auto", set needSd to true; else,
-  // set needSd to false.
-  bool need_sd =
-      has_sd || (RoundingPriority::kAuto != digit_options.rounding_priority);
-
-  // 18. If ( not hasSd and (hasFd or notation is not "compact") ) or
-  // roundingPriority is not "auto", then a. Set needFd to true.
-  // 19. Else,
-  // a. Set needFd to false.
-  bool need_fd = ((!has_sd) && (has_fd || !notation_is_compact)) ||
-                 (RoundingPriority::kAuto != digit_options.rounding_priority);
-
-  // 20. If needSd, then
+      (!IsUndefined(*mnfd_obj, isolate)) || (!IsUndefined(*mxfd_obj, isolate));
+
+  // 21. Let needSd be true.
+  bool need_sd = true;
+  // 22. Let needFd be true.
+  bool need_fd = true;
+  // 23. If roundingPriority is "auto", then
+  if (RoundingPriority::kAuto == digit_options.rounding_priority) {
+    // a. Set needSd to hasSd.
+    need_sd = has_sd;
+    // b. If needSd is true, or hasFd is false and notation is "compact", then
+    if (need_sd || ((!has_fd) && notation_is_compact)) {
+      // i. Set needFd to false.
+      need_fd = false;
+    }
+  }
+  // 24. If needSd is true, then
   if (need_sd) {
-    // 20.b If hasSd, then
+    // 24.a If hasSd is true, then
     if (has_sd) {
-      // 20.b.i Let mnsd be ? DefaultNumberOption(mnsd, 1, 21, 1).
+      // i. Set intlObj.[[MinimumSignificantDigits]] to ?
+      // DefaultNumberOption(mnsd, 1, 21, 1).
       int mnsd;
       if (!DefaultNumberOption(isolate, mnsd_obj, 1, 21, 1,
                                factory->minimumSignificantDigits_string())
                .To(&mnsd)) {
         return Nothing<NumberFormatDigitOptions>();
       }
-      // 20.b.ii Let mxsd be ? DefaultNumberOption(mxsd, mnsd, 21, 21).
+      digit_options.minimum_significant_digits = mnsd;
+      // ii. Set intlObj.[[MaximumSignificantDigits]] to ?
+      // DefaultNumberOption(mxsd, intlObj.[[MinimumSignificantDigits]], 21,
+      // 21).
       int mxsd;
       if (!DefaultNumberOption(isolate, mxsd_obj, mnsd, 21, 21,
                                factory->maximumSignificantDigits_string())
                .To(&mxsd)) {
         return Nothing<NumberFormatDigitOptions>();
       }
-      // 20.b.iii Set intlObj.[[MinimumSignificantDigits]] to mnsd.
-      digit_options.minimum_significant_digits = mnsd;
-      // 20.b.iv Set intlObj.[[MaximumSignificantDigits]] to mxsd.
       digit_options.maximum_significant_digits = mxsd;
     } else {
-      // 20.c Else
-      // 20.c.i Set intlObj.[[MinimumSignificantDigits]] to 1.
+      // 24.b Else
+      // 24.b.i Set intlObj.[[MinimumSignificantDigits]] to 1.
       digit_options.minimum_significant_digits = 1;
-      // 20.c.ii Set intlObj.[[MaximumSignificantDigits]] to 21.
+      // 24.b.ii Set intlObj.[[MaximumSignificantDigits]] to 21.
       digit_options.maximum_significant_digits = 21;
     }
   }
 
-  // 21. If needFd, then
+  Handle<String> mxfd_str = factory->maximumFractionDigits_string();
+  // 25. If needFd is true, then
   if (need_fd) {
-    // 21.a If hasFd, then
+    // a. If hasFd is true, then
     if (has_fd) {
       Handle<String> mnfd_str = factory->minimumFractionDigits_string();
-      Handle<String> mxfd_str = factory->maximumFractionDigits_string();
-      // 21.a.i Let mnfd be ? DefaultNumberOption(mnfd, 0, 20, undefined).
+      // i. Let mnfd be ? DefaultNumberOption(mnfd, 0, 100, undefined).
       int mnfd;
-      if (!DefaultNumberOption(isolate, mnfd_obj, 0, 20, -1, mnfd_str)
+      if (!DefaultNumberOption(isolate, mnfd_obj, 0, 100, -1, mnfd_str)
                .To(&mnfd)) {
         return Nothing<NumberFormatDigitOptions>();
       }
-      // 21.a.ii Let mxfd be ? DefaultNumberOption(mxfd, 0, 20, undefined).
+      // ii. Let mxfd be ? DefaultNumberOption(mxfd, 0, 100, undefined).
       int mxfd;
-      if (!DefaultNumberOption(isolate, mxfd_obj, 0, 20, -1, mxfd_str)
+      if (!DefaultNumberOption(isolate, mxfd_obj, 0, 100, -1, mxfd_str)
                .To(&mxfd)) {
         return Nothing<NumberFormatDigitOptions>();
       }
-      // 21.a.iii If mnfd is undefined, set mnfd to min(mnfdDefault, mxfd).
-      if (mnfd_obj->IsUndefined(isolate)) {
+      // iii. If mnfd is undefined, set mnfd to min(mnfdDefault, mxfd).
+      if (IsUndefined(*mnfd_obj, isolate)) {
         mnfd = std::min(mnfd_default, mxfd);
-      } else if (mxfd_obj->IsUndefined(isolate)) {
-        // 21.a.iv Else if mxfd is undefined, set mxfd to max(mxfdDefault,
+      } else if (IsUndefined(*mxfd_obj, isolate)) {
+        // iv. Else if mxfd is undefined, set mxfd to max(mxfdDefault,
         // mnfd).
         mxfd = std::max(mxfd_default, mnfd);
       } else if (mnfd > mxfd) {
-        // 21.a.v Else if mnfd is greater than mxfd, throw a RangeError
+        // v. Else if mnfd is greater than mxfd, throw a RangeError
         // exception.
         THROW_NEW_ERROR_RETURN_VALUE(
             isolate,
             NewRangeError(MessageTemplate::kPropertyValueOutOfRange, mxfd_str),
             Nothing<NumberFormatDigitOptions>());
       }
-      // 21.a.vi Set intlObj.[[MinimumFractionDigits]] to mnfd.
+      // vi. Set intlObj.[[MinimumFractionDigits]] to mnfd.
       digit_options.minimum_fraction_digits = mnfd;
-      // 21.a.vii Set intlObj.[[MaximumFractionDigits]] to mxfd.
+      // vii. Set intlObj.[[MaximumFractionDigits]] to mxfd.
       digit_options.maximum_fraction_digits = mxfd;
-    } else {  // 17.b Else
-      // 21.b.i Set intlObj.[[MinimumFractionDigits]] to mnfdDefault.
+    } else {  // b. Else
+      // i. Set intlObj.[[MinimumFractionDigits]] to mnfdDefault.
       digit_options.minimum_fraction_digits = mnfd_default;
-      // 21.b.ii Set intlObj.[[MaximumFractionDigits]] to mxfdDefault.
+      // ii. Set intlObj.[[MaximumFractionDigits]] to mxfdDefault.
       digit_options.maximum_fraction_digits = mxfd_default;
     }
   }
 
-  // 22. If needSd or needFd, then
-  if (need_sd || need_fd) {
-    // a. If roundingPriority is "morePrecision", then
-    if (digit_options.rounding_priority == RoundingPriority::kMorePrecision) {
-      // i. Set intlObj.[[RoundingType]] to morePrecision.
-      digit_options.rounding_type = RoundingType::kMorePrecision;
-      // b. Else if roundingPriority is "lessPrecision", then
-    } else if (digit_options.rounding_priority ==
-               RoundingPriority::kLessPrecision) {
-      // i. Set intlObj.[[RoundingType]] to lessPrecision.
-      digit_options.rounding_type = RoundingType::kLessPrecision;
-      // c. Else if hasSd, then
-    } else if (has_sd) {
-      // i. Set intlObj.[[RoundingType]] to significantDigits.
-      digit_options.rounding_type = RoundingType::kSignificantDigits;
-      // d. Else,
-    } else {
-      // i.Set intlObj.[[RoundingType]] to fractionDigits.
-      digit_options.rounding_type = RoundingType::kFractionDigits;
-    }
-    // 23. Else
-  } else {
-    // a. Set intlObj.[[RoundingType]] to morePrecision.
-    digit_options.rounding_type = RoundingType::kMorePrecision;
-    // b. Set intlObj.[[MinimumFractionDigits]] to 0.
+  // 26. If needSd is false and needFd is false, then
+  if ((!need_sd) && (!need_fd)) {
+    // a. Set intlObj.[[MinimumFractionDigits]] to 0.
     digit_options.minimum_fraction_digits = 0;
-    // c. Set intlObj.[[MaximumFractionDigits]] to 0.
+    // b. Set intlObj.[[MaximumFractionDigits]] to 0.
     digit_options.maximum_fraction_digits = 0;
-    // d. Set intlObj.[[MinimumSignificantDigits]] to 1.
+    // c. Set intlObj.[[MinimumSignificantDigits]] to 1.
     digit_options.minimum_significant_digits = 1;
-    // e. Set intlObj.[[MaximumSignificantDigits]] to 2.
+    // d. Set intlObj.[[MaximumSignificantDigits]] to 2.
     digit_options.maximum_significant_digits = 2;
+    // e. Set intlObj.[[RoundingType]] to morePrecision.
+    digit_options.rounding_type = RoundingType::kMorePrecision;
+    // 27. Else if roundingPriority is "morePrecision", then
+  } else if (digit_options.rounding_priority ==
+             RoundingPriority::kMorePrecision) {
+    // i. Set intlObj.[[RoundingType]] to morePrecision.
+    digit_options.rounding_type = RoundingType::kMorePrecision;
+    // 28. Else if roundingPriority is "lessPrecision", then
+  } else if (digit_options.rounding_priority ==
+             RoundingPriority::kLessPrecision) {
+    // i. Set intlObj.[[RoundingType]] to lessPrecision.
+    digit_options.rounding_type = RoundingType::kLessPrecision;
+    // 29. Else if hasSd, then
+  } else if (has_sd) {
+    // i. Set intlObj.[[RoundingType]] to significantDigits.
+    digit_options.rounding_type = RoundingType::kSignificantDigits;
+    // 30. Else,
+  } else {
+    // i.Set intlObj.[[RoundingType]] to fractionDigits.
+    digit_options.rounding_type = RoundingType::kFractionDigits;
+  }
+  // 31. If roundingIncrement is not 1, then
+  if (digit_options.rounding_increment != 1) {
+    // a. If intlObj.[[RoundingType]] is not fractionDigits, throw a TypeError
+    // exception.
+    if (digit_options.rounding_type != RoundingType::kFractionDigits) {
+      THROW_NEW_ERROR_RETURN_VALUE(
+          isolate, NewTypeError(MessageTemplate::kBadRoundingType),
+          Nothing<NumberFormatDigitOptions>());
+    }
+    // b. If intlObj.[[MaximumFractionDigits]] is not equal to
+    // intlObj.[[MinimumFractionDigits]], throw a RangeError exception.
+    if (digit_options.maximum_fraction_digits !=
+        digit_options.minimum_fraction_digits) {
+      THROW_NEW_ERROR_RETURN_VALUE(
+          isolate,
+          NewRangeError(MessageTemplate::kPropertyValueOutOfRange, mxfd_str),
+          Nothing<NumberFormatDigitOptions>());
+    }
   }
   return Just(digit_options);
 }
@@ -2483,7 +2580,7 @@ MaybeHandle<String> Intl::Normalize(Isolate* isolate, Handle<String> string,
                                     Handle<Object> form_input) {
   const char* form_name;
   UNormalization2Mode form_mode;
-  if (form_input->IsUndefined(isolate)) {
+  if (IsUndefined(*form_input, isolate)) {
     // default is FNC
     form_name = "nfc";
     form_mode = UNORM2_COMPOSE;
diff --git a/deps/v8/src/objects/intl-objects.h b/deps/v8/src/objects/intl-objects.h
index 4339673d56693a..02b3b2c42566d4 100644
--- a/deps/v8/src/objects/intl-objects.h
+++ b/deps/v8/src/objects/intl-objects.h
@@ -21,7 +21,7 @@
 #include "unicode/locid.h"
 #include "unicode/uversion.h"
 
-#define V8_MINIMUM_ICU_VERSION 71
+#define V8_MINIMUM_ICU_VERSION 73
 
 namespace U_ICU_NAMESPACE {
 class BreakIterator;
@@ -48,8 +48,6 @@ struct NumberFormatSpan {
 V8_EXPORT_PRIVATE std::vector<NumberFormatSpan> FlattenRegionsToParts(
     std::vector<NumberFormatSpan>* regions);
 
-template <typename T>
-class Handle;
 class JSCollator;
 
 class Intl {
@@ -161,6 +159,29 @@ class Intl {
     kLessPrecision,
   };
 
+  // [[RoundingMode]] is one of the String values "ceil", "floor", "expand",
+  // "trunc", "halfCeil", "halfFloor", "halfExpand", "halfTrunc", or "halfEven",
+  // specifying the rounding strategy for the number.
+  enum class RoundingMode {
+    kCeil,
+    kFloor,
+    kExpand,
+    kTrunc,
+    kHalfCeil,
+    kHalfFloor,
+    kHalfExpand,
+    kHalfTrunc,
+    kHalfEven,
+  };
+
+  // [[TrailingZeroDisplay]] is one of the String values "auto" or
+  // "stripIfInteger", specifying the strategy for displaying trailing zeros on
+  // whole number.
+  enum class TrailingZeroDisplay {
+    kAuto,
+    kStripIfInteger,
+  };
+
   // ecma402/#sec-setnfdigitoptions
   struct NumberFormatDigitOptions {
     int minimum_integer_digits;
@@ -170,11 +191,14 @@ class Intl {
     int maximum_significant_digits;
     RoundingPriority rounding_priority;
     RoundingType rounding_type;
+    int rounding_increment;
+    RoundingMode rounding_mode;
+    TrailingZeroDisplay trailing_zero_display;
   };
   V8_WARN_UNUSED_RESULT static Maybe<NumberFormatDigitOptions>
   SetNumberFormatDigitOptions(Isolate* isolate, Handle<JSReceiver> options,
                               int mnfd_default, int mxfd_default,
-                              bool notation_is_compact);
+                              bool notation_is_compact, const char* service);
 
   // Helper function to convert a UnicodeString to a Handle<String>
   V8_WARN_UNUSED_RESULT static MaybeHandle<String> ToString(
@@ -211,6 +235,12 @@ class Intl {
                          Handle<String> additional_property_name,
                          Handle<String> additional_property_value);
 
+  // A helper function to implement formatToParts which add element to array
+  static Maybe<int> AddNumberElements(Isolate* isolate,
+                                      const icu::FormattedValue& formatted,
+                                      Handle<JSArray> result, int start_index,
+                                      Handle<String> unit);
+
   // In ECMA 402 v1, Intl constructors supported a mode of operation
   // where calling them with an existing object as a receiver would
   // transform the receiver into the relevant Intl instance with all
@@ -328,7 +358,8 @@ class Intl {
   static const uint8_t* AsciiCollationWeightsL3();
   static const int kAsciiCollationWeightsLength;
 
-  static String ConvertOneByteToLower(String src, String dst);
+  static Tagged<String> ConvertOneByteToLower(Tagged<String> src,
+                                              Tagged<String> dst);
 
   static const std::set<std::string>& GetAvailableLocales();
 
diff --git a/deps/v8/src/objects/intl-objects.tq b/deps/v8/src/objects/intl-objects.tq
index bd89c2cebd7133..c9e35d69b72640 100644
--- a/deps/v8/src/objects/intl-objects.tq
+++ b/deps/v8/src/objects/intl-objects.tq
@@ -99,9 +99,9 @@ macro LocaleCompareFastPath<T1: type, T2: type>(
   VerifiedUnreachable();
 }
 
-transitioning builtin StringFastLocaleCompare(implicit context: Context)(
-    localeCompareFn: JSFunction, left: JSAny, right: JSAny,
-    locales: JSAny): JSAny {
+transitioning builtin StringFastLocaleCompare(
+    implicit context: Context)(localeCompareFn: JSFunction, left: JSAny,
+    right: JSAny, locales: JSAny): JSAny {
   try {
     const left = Cast<String>(left) otherwise Bailout;
     if (TaggedEqual(left, right)) return SmiConstant(0);
diff --git a/deps/v8/src/objects/js-array-buffer-inl.h b/deps/v8/src/objects/js-array-buffer-inl.h
index 9378060d2d25a9..a9a2a4943a19dd 100644
--- a/deps/v8/src/objects/js-array-buffer-inl.h
+++ b/deps/v8/src/objects/js-array-buffer-inl.h
@@ -25,8 +25,8 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(JSDataViewOrRabGsabDataView)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSDataView)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSRabGsabDataView)
 
-ACCESSORS(JSTypedArray, base_pointer, Object, kBasePointerOffset)
-RELEASE_ACQUIRE_ACCESSORS(JSTypedArray, base_pointer, Object,
+ACCESSORS(JSTypedArray, base_pointer, Tagged<Object>, kBasePointerOffset)
+RELEASE_ACQUIRE_ACCESSORS(JSTypedArray, base_pointer, Tagged<Object>,
                           kBasePointerOffset)
 
 size_t JSArrayBuffer::byte_length() const {
@@ -116,8 +116,8 @@ void JSArrayBuffer::set_extension(ArrayBufferExtension* extension) {
 
     // We need Release semantics here, see above.
     ExternalPointerHandle handle = table.AllocateAndInitializeEntry(
-        isolate, reinterpret_cast<Address>(extension),
-        kArrayBufferExtensionTag);
+        isolate->heap()->external_pointer_space(),
+        reinterpret_cast<Address>(extension), kArrayBufferExtensionTag);
     base::AsAtomic32::Release_Store(extension_handle_location(), handle);
   } else {
     // This special handling of nullptr is required as it is used to initialize
@@ -153,7 +153,7 @@ void JSArrayBuffer::clear_padding() {
   }
 }
 
-ACCESSORS(JSArrayBuffer, detach_key, Object, kDetachKeyOffset)
+ACCESSORS(JSArrayBuffer, detach_key, Tagged<Object>, kDetachKeyOffset)
 
 void JSArrayBuffer::set_bit_field(uint32_t bits) {
   RELAXED_WRITE_UINT32_FIELD(*this, kBitFieldOffset, bits);
@@ -170,8 +170,6 @@ BIT_FIELD_ACCESSORS(JSArrayBuffer, bit_field, is_detachable,
                     JSArrayBuffer::IsDetachableBit)
 BIT_FIELD_ACCESSORS(JSArrayBuffer, bit_field, was_detached,
                     JSArrayBuffer::WasDetachedBit)
-BIT_FIELD_ACCESSORS(JSArrayBuffer, bit_field, is_asmjs_memory,
-                    JSArrayBuffer::IsAsmJsMemoryBit)
 BIT_FIELD_ACCESSORS(JSArrayBuffer, bit_field, is_shared,
                     JSArrayBuffer::IsSharedBit)
 BIT_FIELD_ACCESSORS(JSArrayBuffer, bit_field, is_resizable_by_js,
@@ -201,7 +199,7 @@ void JSArrayBufferView::set_byte_length(size_t value) {
 }
 
 bool JSArrayBufferView::WasDetached() const {
-  return JSArrayBuffer::cast(buffer()).was_detached();
+  return JSArrayBuffer::cast(buffer())->was_detached();
 }
 
 BIT_FIELD_ACCESSORS(JSArrayBufferView, bit_field, is_length_tracking,
@@ -366,7 +364,7 @@ bool JSTypedArray::is_on_heap(AcquireLoadTag tag) const {
 MaybeHandle<JSTypedArray> JSTypedArray::Validate(Isolate* isolate,
                                                  Handle<Object> receiver,
                                                  const char* method_name) {
-  if (V8_UNLIKELY(!receiver->IsJSTypedArray())) {
+  if (V8_UNLIKELY(!IsJSTypedArray(*receiver))) {
     const MessageTemplate message = MessageTemplate::kNotTypedArray;
     THROW_NEW_ERROR(isolate, NewTypeError(message), JSTypedArray);
   }
@@ -409,7 +407,7 @@ size_t JSRabGsabDataView::GetByteLength() const {
   if (is_length_tracking()) {
     // Invariant: byte_length of length tracking DataViews is 0.
     DCHECK_EQ(0, byte_length());
-    return buffer().GetByteLength() - byte_offset();
+    return buffer()->GetByteLength() - byte_offset();
   }
   return byte_length();
 }
@@ -419,9 +417,9 @@ bool JSRabGsabDataView::IsOutOfBounds() const {
     return false;
   }
   if (is_length_tracking()) {
-    return byte_offset() > buffer().GetByteLength();
+    return byte_offset() > buffer()->GetByteLength();
   }
-  return byte_offset() + byte_length() > buffer().GetByteLength();
+  return byte_offset() + byte_length() > buffer()->GetByteLength();
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/js-array-buffer.cc b/deps/v8/src/objects/js-array-buffer.cc
index fc6578d7a496fa..8644f3a28db525 100644
--- a/deps/v8/src/objects/js-array-buffer.cc
+++ b/deps/v8/src/objects/js-array-buffer.cc
@@ -20,7 +20,7 @@ bool CanonicalNumericIndexString(Isolate* isolate,
                                  const PropertyKey& lookup_key,
                                  bool* is_minus_zero) {
   // 1. Assert: Type(argument) is String.
-  DCHECK(lookup_key.is_element() || lookup_key.name()->IsString());
+  DCHECK(lookup_key.is_element() || IsString(*lookup_key.name()));
   *is_minus_zero = false;
   if (lookup_key.is_element()) return true;
 
@@ -28,7 +28,7 @@ bool CanonicalNumericIndexString(Isolate* isolate,
 
   // 3. Let n be ! ToNumber(argument).
   Handle<Object> result = String::ToNumber(isolate, key);
-  if (result->IsMinusZero()) {
+  if (IsMinusZero(*result)) {
     // 2. If argument is "-0", return -0𝔽.
     // We are not performing SaveValue check for -0 because it'll be rejected
     // anyway.
@@ -37,7 +37,7 @@ bool CanonicalNumericIndexString(Isolate* isolate,
     // 4. If SameValue(! ToString(n), argument) is false, return undefined.
     Handle<String> str = Object::ToString(isolate, result).ToHandleChecked();
     // Avoid treating strings like "2E1" and "20" as the same key.
-    if (!str->SameValue(*key)) return false;
+    if (!Object::SameValue(*str, *key)) return false;
   }
   return true;
 }
@@ -80,6 +80,9 @@ void JSArrayBuffer::Attach(std::shared_ptr<BackingStore> backing_store) {
   Isolate* isolate = GetIsolate();
 
   if (backing_store->IsEmpty()) {
+    // Wasm memory always needs a backing store; this is guaranteed by reserving
+    // at least one page for the BackingStore (so {IsEmpty()} is always false).
+    CHECK(!backing_store->is_wasm_memory());
     set_backing_store(isolate, EmptyBackingStoreBuffer());
   } else {
     DCHECK_NE(nullptr, backing_store->buffer_start());
@@ -117,13 +120,14 @@ Maybe<bool> JSArrayBuffer::Detach(Handle<JSArrayBuffer> buffer,
 
   bool key_mismatch = false;
 
-  if (!detach_key->IsUndefined(isolate)) {
-    key_mismatch = maybe_key.is_null() || !maybe_key->StrictEquals(*detach_key);
+  if (!IsUndefined(*detach_key, isolate)) {
+    key_mismatch =
+        maybe_key.is_null() || !Object::StrictEquals(*maybe_key, *detach_key);
   } else {
     // Detach key is undefined; allow not passing maybe_key but disallow passing
     // something else than undefined.
     key_mismatch =
-        !maybe_key.is_null() && !maybe_key->StrictEquals(*detach_key);
+        !maybe_key.is_null() && !Object::StrictEquals(*maybe_key, *detach_key);
   }
   if (key_mismatch) {
     THROW_NEW_ERROR_RETURN_VALUE(
@@ -161,7 +165,6 @@ void JSArrayBuffer::DetachInternal(bool force_for_wasm_memory,
   }
 
   DCHECK(!is_shared());
-  DCHECK(!is_asmjs_memory());
   set_backing_store(isolate, EmptyBackingStoreBuffer());
   set_byte_length(0);
   set_was_detached(true);
@@ -174,10 +177,10 @@ size_t JSArrayBuffer::GsabByteLength(Isolate* isolate,
   DCHECK(v8_flags.harmony_rab_gsab);
   DisallowGarbageCollection no_gc;
   DisallowJavascriptExecution no_js(isolate);
-  JSArrayBuffer buffer = JSArrayBuffer::cast(Object(raw_array_buffer));
-  CHECK(buffer.is_resizable_by_js());
-  CHECK(buffer.is_shared());
-  return buffer.GetBackingStore()->byte_length(std::memory_order_seq_cst);
+  Tagged<JSArrayBuffer> buffer = JSArrayBuffer::cast(Object(raw_array_buffer));
+  CHECK(buffer->is_resizable_by_js());
+  CHECK(buffer->is_shared());
+  return buffer->GetBackingStore()->byte_length(std::memory_order_seq_cst);
 }
 
 // static
@@ -299,14 +302,14 @@ Maybe<bool> JSTypedArray::DefineOwnProperty(Isolate* isolate,
                                             Handle<Object> key,
                                             PropertyDescriptor* desc,
                                             Maybe<ShouldThrow> should_throw) {
-  DCHECK(key->IsName() || key->IsNumber());
+  DCHECK(IsName(*key) || IsNumber(*key));
   // 1. If Type(P) is String, then
   PropertyKey lookup_key(isolate, key);
-  if (lookup_key.is_element() || key->IsSmi() || key->IsString()) {
+  if (lookup_key.is_element() || IsSmi(*key) || IsString(*key)) {
     // 1a. Let numericIndex be ! CanonicalNumericIndexString(P)
     // 1b. If numericIndex is not undefined, then
     bool is_minus_zero = false;
-    if (key->IsSmi() ||  // Smi keys are definitely canonical
+    if (IsSmi(*key) ||  // Smi keys are definitely canonical
         CanonicalNumericIndexString(isolate, lookup_key, &is_minus_zero)) {
       // 1b i. If IsValidIntegerIndex(O, numericIndex) is false, return false.
 
@@ -365,7 +368,7 @@ Maybe<bool> JSTypedArray::DefineOwnProperty(Isolate* isolate,
 }
 
 ExternalArrayType JSTypedArray::type() {
-  switch (map().elements_kind()) {
+  switch (map()->elements_kind()) {
 #define ELEMENTS_KIND_TO_ARRAY_TYPE(Type, type, TYPE, ctype) \
   case TYPE##_ELEMENTS:                                      \
     return kExternal##Type##Array;
@@ -380,7 +383,7 @@ ExternalArrayType JSTypedArray::type() {
 }
 
 size_t JSTypedArray::element_size() const {
-  switch (map().elements_kind()) {
+  switch (map()->elements_kind()) {
 #define ELEMENTS_KIND_TO_ELEMENT_SIZE(Type, type, TYPE, ctype) \
   case TYPE##_ELEMENTS:                                        \
     return sizeof(ctype);
@@ -401,34 +404,35 @@ size_t JSTypedArray::LengthTrackingGsabBackedTypedArrayLength(
   DCHECK(v8_flags.harmony_rab_gsab);
   DisallowGarbageCollection no_gc;
   DisallowJavascriptExecution no_js(isolate);
-  JSTypedArray array = JSTypedArray::cast(Object(raw_array));
-  CHECK(array.is_length_tracking());
-  JSArrayBuffer buffer = array.buffer();
-  CHECK(buffer.is_resizable_by_js());
-  CHECK(buffer.is_shared());
+  Tagged<JSTypedArray> array = JSTypedArray::cast(Object(raw_array));
+  CHECK(array->is_length_tracking());
+  Tagged<JSArrayBuffer> buffer = array->buffer();
+  CHECK(buffer->is_resizable_by_js());
+  CHECK(buffer->is_shared());
   size_t backing_byte_length =
-      buffer.GetBackingStore()->byte_length(std::memory_order_seq_cst);
-  CHECK_GE(backing_byte_length, array.byte_offset());
-  auto element_byte_size = ElementsKindToByteSize(array.GetElementsKind());
-  return (backing_byte_length - array.byte_offset()) / element_byte_size;
+      buffer->GetBackingStore()->byte_length(std::memory_order_seq_cst);
+  CHECK_GE(backing_byte_length, array->byte_offset());
+  auto element_byte_size = ElementsKindToByteSize(array->GetElementsKind());
+  return (backing_byte_length - array->byte_offset()) / element_byte_size;
 }
 
 size_t JSTypedArray::GetVariableLengthOrOutOfBounds(bool& out_of_bounds) const {
   DCHECK(!WasDetached());
   if (is_length_tracking()) {
     if (is_backed_by_rab()) {
-      if (byte_offset() > buffer().byte_length()) {
+      if (byte_offset() > buffer()->byte_length()) {
         out_of_bounds = true;
         return 0;
       }
-      return (buffer().byte_length() - byte_offset()) / element_size();
+      return (buffer()->byte_length() - byte_offset()) / element_size();
     }
     if (byte_offset() >
-        buffer().GetBackingStore()->byte_length(std::memory_order_seq_cst)) {
+        buffer()->GetBackingStore()->byte_length(std::memory_order_seq_cst)) {
       out_of_bounds = true;
       return 0;
     }
-    return (buffer().GetBackingStore()->byte_length(std::memory_order_seq_cst) -
+    return (buffer()->GetBackingStore()->byte_length(
+                std::memory_order_seq_cst) -
             byte_offset()) /
            element_size();
   }
@@ -436,7 +440,7 @@ size_t JSTypedArray::GetVariableLengthOrOutOfBounds(bool& out_of_bounds) const {
   size_t array_length = LengthUnchecked();
   // The sum can't overflow, since we have managed to allocate the
   // JSTypedArray.
-  if (byte_offset() + array_length * element_size() > buffer().byte_length()) {
+  if (byte_offset() + array_length * element_size() > buffer()->byte_length()) {
     out_of_bounds = true;
     return 0;
   }
diff --git a/deps/v8/src/objects/js-array-buffer.h b/deps/v8/src/objects/js-array-buffer.h
index e2950bdfe75feb..4ab0eed9724ce3 100644
--- a/deps/v8/src/objects/js-array-buffer.h
+++ b/deps/v8/src/objects/js-array-buffer.h
@@ -72,9 +72,6 @@ class JSArrayBuffer
   // [was_detached]: true => the buffer was previously detached.
   DECL_BOOLEAN_ACCESSORS(was_detached)
 
-  // [is_asmjs_memory]: true => this buffer was once used as asm.js memory.
-  DECL_BOOLEAN_ACCESSORS(is_asmjs_memory)
-
   // [is_shared]: true if this is a SharedArrayBuffer or a
   // GrowableSharedArrayBuffer.
   DECL_BOOLEAN_ACCESSORS(is_shared)
@@ -90,7 +87,7 @@ class JSArrayBuffer
   // An ArrayBuffer with a size greater than zero is never empty.
   DECL_GETTER(IsEmpty, bool)
 
-  DECL_ACCESSORS(detach_key, Object)
+  DECL_ACCESSORS(detach_key, Tagged<Object>)
 
   // Initializes the fields of the ArrayBuffer. The provided backing_store can
   // be nullptr. If it is not nullptr, then the function registers it with
@@ -290,8 +287,8 @@ class JSTypedArray
   // [length]: length of typed array in elements.
   DECL_PRIMITIVE_GETTER(length, size_t)
 
-  DECL_GETTER(base_pointer, Object)
-  DECL_ACQUIRE_GETTER(base_pointer, Object)
+  DECL_GETTER(base_pointer, Tagged<Object>)
+  DECL_ACQUIRE_GETTER(base_pointer, Tagged<Object>)
 
   // ES6 9.4.5.3
   V8_WARN_UNUSED_RESULT static Maybe<bool> DefineOwnProperty(
@@ -399,8 +396,8 @@ class JSTypedArray
 
   DECL_GETTER(external_pointer, Address)
 
-  DECL_SETTER(base_pointer, Object)
-  DECL_RELEASE_SETTER(base_pointer, Object)
+  DECL_SETTER(base_pointer, Tagged<Object>)
+  DECL_RELEASE_SETTER(base_pointer, Tagged<Object>)
 
   inline void set_external_pointer(Isolate* isolate, Address value);
 
diff --git a/deps/v8/src/objects/js-array-buffer.tq b/deps/v8/src/objects/js-array-buffer.tq
index beb80a3c75bbc5..95a7df1820df9e 100644
--- a/deps/v8/src/objects/js-array-buffer.tq
+++ b/deps/v8/src/objects/js-array-buffer.tq
@@ -135,7 +135,8 @@ extern class JSDataView extends JSDataViewOrRabGsabDataView {}
 extern class JSRabGsabDataView extends JSDataViewOrRabGsabDataView {}
 
 @abstract
-@doNotGenerateCast extern class TypedArrayConstructor extends JSFunction
+@doNotGenerateCast
+extern class TypedArrayConstructor extends JSFunction
     generates 'TNode<JSFunction>';
 @doNotGenerateCast
 extern class Uint8TypedArrayConstructor extends TypedArrayConstructor
diff --git a/deps/v8/src/objects/js-array-inl.h b/deps/v8/src/objects/js-array-inl.h
index f24d113cdca24e..fb0f64648cd628 100644
--- a/deps/v8/src/objects/js-array-inl.h
+++ b/deps/v8/src/objects/js-array-inl.h
@@ -21,23 +21,24 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(JSArray)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSArrayIterator)
 TQ_OBJECT_CONSTRUCTORS_IMPL(TemplateLiteralObject)
 
-DEF_GETTER(JSArray, length, Object) {
+DEF_GETTER(JSArray, length, Tagged<Object>) {
   return TaggedField<Object, kLengthOffset>::load(cage_base, *this);
 }
 
-void JSArray::set_length(Object value, WriteBarrierMode mode) {
+void JSArray::set_length(Tagged<Object> value, WriteBarrierMode mode) {
   // Note the relaxed atomic store.
   TaggedField<Object, kLengthOffset>::Relaxed_Store(*this, value);
   CONDITIONAL_WRITE_BARRIER(*this, kLengthOffset, value, mode);
 }
 
-Object JSArray::length(PtrComprCageBase cage_base, RelaxedLoadTag tag) const {
+Tagged<Object> JSArray::length(PtrComprCageBase cage_base,
+                               RelaxedLoadTag tag) const {
   return TaggedField<Object, kLengthOffset>::Relaxed_Load(cage_base, *this);
 }
 
-void JSArray::set_length(Smi length) {
+void JSArray::set_length(Tagged<Smi> length) {
   // Don't need a write barrier for a Smi.
-  set_length(Object(length.ptr()), SKIP_WRITE_BARRIER);
+  set_length(Tagged<Object>(length.ptr()), SKIP_WRITE_BARRIER);
 }
 
 bool JSArray::SetLengthWouldNormalize(Heap* heap, uint32_t new_length) {
@@ -61,7 +62,7 @@ void JSArray::SetContent(Handle<JSArray> array,
 }
 
 bool JSArray::HasArrayPrototype(Isolate* isolate) {
-  return map().prototype() == *isolate->initial_array_prototype();
+  return map()->prototype() == *isolate->initial_array_prototype();
 }
 
 SMI_ACCESSORS(JSArrayIterator, raw_kind, kKindOffset)
diff --git a/deps/v8/src/objects/js-array.h b/deps/v8/src/objects/js-array.h
index e7e30e499909f0..de71945bb1ec59 100644
--- a/deps/v8/src/objects/js-array.h
+++ b/deps/v8/src/objects/js-array.h
@@ -25,23 +25,24 @@ namespace internal {
 class JSArray : public TorqueGeneratedJSArray<JSArray, JSObject> {
  public:
   // [length]: The length property.
-  DECL_ACCESSORS(length, Object)
-  DECL_RELAXED_GETTER(length, Object)
+  DECL_ACCESSORS(length, Tagged<Object>)
+  DECL_RELAXED_GETTER(length, Tagged<Object>)
 
   // Acquire/release semantics on this field are explicitly forbidden to avoid
   // confusion, since the default setter uses relaxed semantics. If
   // acquire/release semantics ever become necessary, the default setter should
   // be reverted to non-atomic behavior, and setters with explicit tags
   // introduced and used when required.
-  Object length(PtrComprCageBase cage_base, AcquireLoadTag tag) const = delete;
-  void set_length(Object value, ReleaseStoreTag tag,
+  Tagged<Object> length(PtrComprCageBase cage_base,
+                        AcquireLoadTag tag) const = delete;
+  void set_length(Tagged<Object> value, ReleaseStoreTag tag,
                   WriteBarrierMode mode = UPDATE_WRITE_BARRIER) = delete;
 
   // Overload the length setter to skip write barrier when the length
   // is set to a smi. This matches the set function on FixedArray.
-  inline void set_length(Smi length);
+  inline void set_length(Tagged<Smi> length);
 
-  static bool MayHaveReadOnlyLength(Map js_array_map);
+  static bool MayHaveReadOnlyLength(Tagged<Map> js_array_map);
   static bool HasReadOnlyLength(Handle<JSArray> array);
   static bool WouldChangeReadOnlyLength(Handle<JSArray> array, uint32_t index);
 
diff --git a/deps/v8/src/objects/js-array.tq b/deps/v8/src/objects/js-array.tq
index 22c067df694ac9..08cab980630592 100644
--- a/deps/v8/src/objects/js-array.tq
+++ b/deps/v8/src/objects/js-array.tq
@@ -37,9 +37,9 @@ extern class JSArrayIterator extends JSObject {
 
 // Perform CreateArrayIterator (ES #sec-createarrayiterator).
 @export
-macro CreateArrayIterator(implicit context: NativeContext)(
-    array: JSReceiver, kind: constexpr IterationKind, nextIndex: Number):
-    JSArrayIterator {
+macro CreateArrayIterator(
+    implicit context: NativeContext)(array: JSReceiver,
+    kind: constexpr IterationKind, nextIndex: Number): JSArrayIterator {
   return new JSArrayIterator{
     map: *NativeContextSlot(ContextSlot::INITIAL_ARRAY_ITERATOR_MAP_INDEX),
     properties_or_hash: kEmptyFixedArray,
@@ -52,8 +52,9 @@ macro CreateArrayIterator(implicit context: NativeContext)(
 
 // Perform CreateArrayIterator (ES #sec-createarrayiterator).
 @export
-macro CreateArrayIterator(implicit context: NativeContext)(
-    array: JSReceiver, kind: constexpr IterationKind): JSArrayIterator {
+macro CreateArrayIterator(
+    implicit context: NativeContext)(array: JSReceiver,
+    kind: constexpr IterationKind): JSArrayIterator {
   return CreateArrayIterator(array, kind, 0);
 }
 
@@ -76,8 +77,8 @@ extern class TemplateLiteralObject extends JSArray {
 extern class JSArrayConstructor extends JSFunction
     generates 'TNode<JSFunction>';
 
-macro NewJSArray(implicit context: Context)(
-    map: Map, elements: FixedArrayBase): JSArray {
+macro NewJSArray(
+    implicit context: Context)(map: Map, elements: FixedArrayBase): JSArray {
   return new JSArray{
     map,
     properties_or_hash: kEmptyFixedArray,
@@ -95,15 +96,14 @@ macro NewJSArray(implicit context: Context)(): JSArray {
   };
 }
 
-macro NewJSArrayFilledWithZero(implicit context: Context)(length: intptr):
-    JSArray labels Slow {
+macro NewJSArrayFilledWithZero(
+    implicit context: Context)(length: intptr): JSArray labels Slow {
   if (length == 0) return NewJSArray();
   if (length > kMaxFastArrayLength) goto Slow;
 
   const map: Map = GetFastPackedSmiElementsJSArrayMap();
-  const elements: FixedArrayBase = AllocateFixedArray(
-      ElementsKind::PACKED_SMI_ELEMENTS, length,
-      AllocationFlag::kAllowLargeObjectAllocation);
+  const elements: FixedArrayBase =
+      AllocateFixedArray(ElementsKind::PACKED_SMI_ELEMENTS, length);
   FillFixedArrayWithSmiZero(
       ElementsKind::PACKED_SMI_ELEMENTS, UnsafeCast<FixedArray>(elements), 0,
       length);
@@ -137,7 +137,8 @@ transient type FastJSArrayForReadWithNoCustomIteration extends
 extern macro AllocateJSArray(
     constexpr ElementsKind, Map, intptr, Smi,
     constexpr AllocationFlag): JSArray;
-extern macro AllocateJSArray(constexpr ElementsKind, Map, intptr, Smi): JSArray;
+extern macro AllocateJSArray(
+    constexpr ElementsKind, Map, intptr, Smi): JSArray;
 extern macro AllocateJSArray(constexpr ElementsKind, Map, Smi, Smi): JSArray;
 extern macro AllocateJSArray(Map, FixedArrayBase, Smi): JSArray;
 
@@ -145,8 +146,8 @@ macro LoadElementNoHole<T : type extends FixedArrayBase>(
     a: JSArray, index: Smi): JSAny
     labels IfHole;
 
-LoadElementNoHole<FixedArray>(implicit context: Context)(
-    a: JSArray, index: Smi): JSAny
+LoadElementNoHole<FixedArray>(
+    implicit context: Context)(a: JSArray, index: Smi): JSAny
     labels IfHole {
   const elements: FixedArray =
       Cast<FixedArray>(a.elements) otherwise unreachable;
@@ -161,8 +162,8 @@ LoadElementNoHole<FixedArray>(implicit context: Context)(
   }
 }
 
-LoadElementNoHole<FixedDoubleArray>(implicit context: Context)(
-    a: JSArray, index: Smi): JSAny
+LoadElementNoHole<FixedDoubleArray>(
+    implicit context: Context)(a: JSArray, index: Smi): JSAny
     labels IfHole {
   const elements: FixedDoubleArray =
       Cast<FixedDoubleArray>(a.elements) otherwise unreachable;
diff --git a/deps/v8/src/objects/js-atomics-synchronization.cc b/deps/v8/src/objects/js-atomics-synchronization.cc
index 59c08d730ac995..c4e4f22606f6c5 100644
--- a/deps/v8/src/objects/js-atomics-synchronization.cc
+++ b/deps/v8/src/objects/js-atomics-synchronization.cc
@@ -10,7 +10,7 @@
 #include "src/base/platform/time.h"
 #include "src/base/platform/yield-processor.h"
 #include "src/execution/isolate-inl.h"
-#include "src/heap/parked-scope.h"
+#include "src/heap/parked-scope-inl.h"
 #include "src/objects/js-atomics-synchronization-inl.h"
 #include "src/sandbox/external-pointer-inl.h"
 
@@ -217,29 +217,40 @@ class V8_NODISCARD WaiterQueueNode final {
 
   void Wait() {
     AllowGarbageCollection allow_before_parking;
-    ParkedScope parked_scope(requester_->main_thread_local_heap());
-    base::MutexGuard guard(&wait_lock_);
-    while (should_wait) {
-      wait_cond_var_.Wait(&wait_lock_);
-    }
+    requester_->main_thread_local_heap()->BlockWhileParked([this]() {
+      base::MutexGuard guard(&wait_lock_);
+      while (should_wait) {
+        wait_cond_var_.Wait(&wait_lock_);
+      }
+    });
   }
 
   // Returns false if timed out, true otherwise.
   bool WaitFor(const base::TimeDelta& rel_time) {
+    bool result;
     AllowGarbageCollection allow_before_parking;
-    ParkedScope parked_scope(requester_->main_thread_local_heap());
-    base::MutexGuard guard(&wait_lock_);
-    base::TimeTicks current_time = base::TimeTicks::Now();
-    base::TimeTicks timeout_time = current_time + rel_time;
-    for (;;) {
-      if (!should_wait) return true;
-      current_time = base::TimeTicks::Now();
-      if (current_time >= timeout_time) return false;
-      base::TimeDelta time_until_timeout = timeout_time - current_time;
-      bool wait_res = wait_cond_var_.WaitFor(&wait_lock_, time_until_timeout);
-      USE(wait_res);
-      // The wake up may have been spurious, so loop again.
-    }
+    requester_->main_thread_local_heap()->BlockWhileParked([this, rel_time,
+                                                            &result]() {
+      base::MutexGuard guard(&wait_lock_);
+      base::TimeTicks current_time = base::TimeTicks::Now();
+      base::TimeTicks timeout_time = current_time + rel_time;
+      for (;;) {
+        if (!should_wait) {
+          result = true;
+          return;
+        }
+        current_time = base::TimeTicks::Now();
+        if (current_time >= timeout_time) {
+          result = false;
+          return;
+        }
+        base::TimeDelta time_until_timeout = timeout_time - current_time;
+        bool wait_res = wait_cond_var_.WaitFor(&wait_lock_, time_until_timeout);
+        USE(wait_res);
+        // The wake up may have been spurious, so loop again.
+      }
+    });
+    return result;
   }
 
   void Notify() {
@@ -562,7 +573,7 @@ uint32_t JSAtomicsCondition::Notify(Isolate* requester, uint32_t count) {
   return old_head->NotifyAllInList();
 }
 
-Object JSAtomicsCondition::NumWaitersForTesting(Isolate* isolate) {
+Tagged<Object> JSAtomicsCondition::NumWaitersForTesting(Isolate* isolate) {
   DisallowGarbageCollection no_gc;
   std::atomic<StateT>* state = AtomicStatePtr();
   StateT current_state = state->load(std::memory_order_relaxed);
diff --git a/deps/v8/src/objects/js-atomics-synchronization.h b/deps/v8/src/objects/js-atomics-synchronization.h
index d1e7037ddc0f36..a083b3bbfd36bd 100644
--- a/deps/v8/src/objects/js-atomics-synchronization.h
+++ b/deps/v8/src/objects/js-atomics-synchronization.h
@@ -191,7 +191,7 @@ class JSAtomicsCondition
   // Notify {count} waiters. Returns the number of waiters woken up.
   V8_EXPORT_PRIVATE uint32_t Notify(Isolate* requester, uint32_t count);
 
-  Object NumWaitersForTesting(Isolate* isolate);
+  Tagged<Object> NumWaitersForTesting(Isolate* isolate);
 
   TQ_OBJECT_CONSTRUCTORS(JSAtomicsCondition)
 
diff --git a/deps/v8/src/objects/js-break-iterator-inl.h b/deps/v8/src/objects/js-break-iterator-inl.h
index dc85efe3fe6f2c..96d2a6f97fbd67 100644
--- a/deps/v8/src/objects/js-break-iterator-inl.h
+++ b/deps/v8/src/objects/js-break-iterator-inl.h
@@ -22,10 +22,10 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSV8BreakIterator)
 
-ACCESSORS(JSV8BreakIterator, break_iterator, Managed<icu::BreakIterator>,
-          kBreakIteratorOffset)
-ACCESSORS(JSV8BreakIterator, unicode_string, Managed<icu::UnicodeString>,
-          kUnicodeStringOffset)
+ACCESSORS(JSV8BreakIterator, break_iterator,
+          Tagged<Managed<icu::BreakIterator>>, kBreakIteratorOffset)
+ACCESSORS(JSV8BreakIterator, unicode_string,
+          Tagged<Managed<icu::UnicodeString>>, kUnicodeStringOffset)
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/js-break-iterator.cc b/deps/v8/src/objects/js-break-iterator.cc
index c9558d5c78dbbb..20a2c8d8527576 100644
--- a/deps/v8/src/objects/js-break-iterator.cc
+++ b/deps/v8/src/objects/js-break-iterator.cc
@@ -34,7 +34,7 @@ MaybeHandle<JSV8BreakIterator> JSV8BreakIterator::New(
       maybe_requested_locales.FromJust();
 
   Handle<JSReceiver> options;
-  if (options_obj->IsUndefined(isolate)) {
+  if (IsUndefined(*options_obj, isolate)) {
     options = factory->NewJSObjectWithNullProto();
   } else {
     ASSIGN_RETURN_ON_EXCEPTION(isolate, options,
@@ -177,7 +177,7 @@ Handle<JSObject> JSV8BreakIterator::ResolvedOptions(
     Isolate* isolate, Handle<JSV8BreakIterator> break_iterator) {
   Factory* factory = isolate->factory();
 
-  Type type = GetType(break_iterator->break_iterator().raw());
+  Type type = GetType(break_iterator->break_iterator()->raw());
 
   Handle<JSObject> result = factory->NewJSObject(isolate->object_function());
   Handle<String> locale(break_iterator->locale(), isolate);
@@ -193,7 +193,7 @@ void JSV8BreakIterator::AdoptText(
     Isolate* isolate, Handle<JSV8BreakIterator> break_iterator_holder,
     Handle<String> text) {
   icu::BreakIterator* break_iterator =
-      break_iterator_holder->break_iterator().raw();
+      break_iterator_holder->break_iterator()->raw();
   DCHECK_NOT_NULL(break_iterator);
   Handle<Managed<icu::UnicodeString>> unicode_string =
       Intl::SetTextToBreakIterator(isolate, text, break_iterator);
@@ -203,24 +203,24 @@ void JSV8BreakIterator::AdoptText(
 Handle<Object> JSV8BreakIterator::Current(
     Isolate* isolate, Handle<JSV8BreakIterator> break_iterator) {
   return isolate->factory()->NewNumberFromInt(
-      break_iterator->break_iterator().raw()->current());
+      break_iterator->break_iterator()->raw()->current());
 }
 
 Handle<Object> JSV8BreakIterator::First(
     Isolate* isolate, Handle<JSV8BreakIterator> break_iterator) {
   return isolate->factory()->NewNumberFromInt(
-      break_iterator->break_iterator().raw()->first());
+      break_iterator->break_iterator()->raw()->first());
 }
 
 Handle<Object> JSV8BreakIterator::Next(
     Isolate* isolate, Handle<JSV8BreakIterator> break_iterator) {
   return isolate->factory()->NewNumberFromInt(
-      break_iterator->break_iterator().raw()->next());
+      break_iterator->break_iterator()->raw()->next());
 }
 
-String JSV8BreakIterator::BreakType(Isolate* isolate,
-                                    Handle<JSV8BreakIterator> break_iterator) {
-  int32_t status = break_iterator->break_iterator().raw()->getRuleStatus();
+Tagged<String> JSV8BreakIterator::BreakType(
+    Isolate* isolate, Handle<JSV8BreakIterator> break_iterator) {
+  int32_t status = break_iterator->break_iterator()->raw()->getRuleStatus();
   // Keep return values in sync with JavaScript BreakType enum.
   if (status >= UBRK_WORD_NONE && status < UBRK_WORD_NONE_LIMIT) {
     return ReadOnlyRoots(isolate).none_string();
diff --git a/deps/v8/src/objects/js-break-iterator.h b/deps/v8/src/objects/js-break-iterator.h
index 6fc02c856b7e4e..56a8cb561bd740 100644
--- a/deps/v8/src/objects/js-break-iterator.h
+++ b/deps/v8/src/objects/js-break-iterator.h
@@ -50,13 +50,13 @@ class JSV8BreakIterator
                               Handle<JSV8BreakIterator> break_iterator);
   static Handle<Object> Next(Isolate* isolate,
                              Handle<JSV8BreakIterator> break_iterator);
-  static String BreakType(Isolate* isolate,
-                          Handle<JSV8BreakIterator> break_iterator);
+  static Tagged<String> BreakType(Isolate* isolate,
+                                  Handle<JSV8BreakIterator> break_iterator);
 
   DECL_PRINTER(JSV8BreakIterator)
 
-  DECL_ACCESSORS(break_iterator, Managed<icu::BreakIterator>)
-  DECL_ACCESSORS(unicode_string, Managed<icu::UnicodeString>)
+  DECL_ACCESSORS(break_iterator, Tagged<Managed<icu::BreakIterator>>)
+  DECL_ACCESSORS(unicode_string, Tagged<Managed<icu::UnicodeString>>)
 
   TQ_OBJECT_CONSTRUCTORS(JSV8BreakIterator)
 };
diff --git a/deps/v8/src/objects/js-collator-inl.h b/deps/v8/src/objects/js-collator-inl.h
index 81ee95326aefd0..c4d803ad7fa99f 100644
--- a/deps/v8/src/objects/js-collator-inl.h
+++ b/deps/v8/src/objects/js-collator-inl.h
@@ -22,7 +22,8 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSCollator)
 
-ACCESSORS(JSCollator, icu_collator, Managed<icu::Collator>, kIcuCollatorOffset)
+ACCESSORS(JSCollator, icu_collator, Tagged<Managed<icu::Collator>>,
+          kIcuCollatorOffset)
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/js-collator.cc b/deps/v8/src/objects/js-collator.cc
index 5caf8d2ec93bb6..3a7297e344fae6 100644
--- a/deps/v8/src/objects/js-collator.cc
+++ b/deps/v8/src/objects/js-collator.cc
@@ -86,7 +86,7 @@ Handle<JSObject> JSCollator::ResolvedOptions(Isolate* isolate,
   Handle<JSObject> options =
       isolate->factory()->NewJSObject(isolate->object_function());
 
-  icu::Collator* icu_collator = collator->icu_collator().raw();
+  icu::Collator* icu_collator = collator->icu_collator()->raw();
   DCHECK_NOT_NULL(icu_collator);
 
   UErrorCode status = U_ZERO_ERROR;
@@ -202,7 +202,7 @@ Handle<JSObject> JSCollator::ResolvedOptions(Isolate* isolate,
   // If the collator return the locale differ from what got requested, we stored
   // it in the collator->locale. Otherwise, we just use the one from the
   // collator.
-  if (collator->locale().length() != 0) {
+  if (collator->locale()->length() != 0) {
     // Get the locale from collator->locale() since we know in some cases
     // collator won't be able to return the requested one, such as zh_CN.
     Handle<String> locale_from_collator(collator->locale(), isolate);
diff --git a/deps/v8/src/objects/js-collator.h b/deps/v8/src/objects/js-collator.h
index 9dc19ac4ed8e62..a3dea6290ac0b2 100644
--- a/deps/v8/src/objects/js-collator.h
+++ b/deps/v8/src/objects/js-collator.h
@@ -46,7 +46,7 @@ class JSCollator : public TorqueGeneratedJSCollator<JSCollator, JSObject> {
 
   DECL_PRINTER(JSCollator)
 
-  DECL_ACCESSORS(icu_collator, Managed<icu::Collator>)
+  DECL_ACCESSORS(icu_collator, Tagged<Managed<icu::Collator>>)
 
   TQ_OBJECT_CONSTRUCTORS(JSCollator)
 };
diff --git a/deps/v8/src/objects/js-collection-inl.h b/deps/v8/src/objects/js-collection-inl.h
index f2471175aa004e..109de049a5c3f6 100644
--- a/deps/v8/src/objects/js-collection-inl.h
+++ b/deps/v8/src/objects/js-collection-inl.h
@@ -35,24 +35,24 @@ OrderedHashTableIterator<Derived, TableType>::OrderedHashTableIterator(
 
 JSMapIterator::JSMapIterator(Address ptr)
     : OrderedHashTableIterator<JSMapIterator, OrderedHashMap>(ptr) {
-  SLOW_DCHECK(IsJSMapIterator());
+  SLOW_DCHECK(IsJSMapIterator(*this));
 }
 
 JSSetIterator::JSSetIterator(Address ptr)
     : OrderedHashTableIterator<JSSetIterator, OrderedHashSet>(ptr) {
-  SLOW_DCHECK(IsJSSetIterator());
+  SLOW_DCHECK(IsJSSetIterator(*this));
 }
 
 CAST_ACCESSOR(JSSetIterator)
 CAST_ACCESSOR(JSMapIterator)
 
-Object JSMapIterator::CurrentValue() {
-  OrderedHashMap table = OrderedHashMap::cast(this->table());
+Tagged<Object> JSMapIterator::CurrentValue() {
+  Tagged<OrderedHashMap> table = OrderedHashMap::cast(this->table());
   int index = Smi::ToInt(this->index());
   DCHECK_GE(index, 0);
   InternalIndex entry(index);
-  Object value = table.ValueAt(entry);
-  DCHECK(!value.IsTheHole());
+  Tagged<Object> value = table->ValueAt(entry);
+  DCHECK(!IsTheHole(value));
   return value;
 }
 
diff --git a/deps/v8/src/objects/js-collection-iterator.h b/deps/v8/src/objects/js-collection-iterator.h
index feb3da37fa445f..00a674abceb009 100644
--- a/deps/v8/src/objects/js-collection-iterator.h
+++ b/deps/v8/src/objects/js-collection-iterator.h
@@ -51,7 +51,7 @@ class OrderedHashTableIterator : public JSCollectionIterator {
 
   // Returns the current key of the iterator. This should only be called when
   // |HasMore| returns true.
-  inline Object CurrentKey();
+  inline Tagged<Object> CurrentKey();
 
  private:
   // Transitions the iterator to the non obsolete backing store. This is a NOP
diff --git a/deps/v8/src/objects/js-collection.h b/deps/v8/src/objects/js-collection.h
index 8de079e69cfb02..6adc47cb46428a 100644
--- a/deps/v8/src/objects/js-collection.h
+++ b/deps/v8/src/objects/js-collection.h
@@ -79,7 +79,7 @@ class JSMapIterator
 
   // Returns the current value of the iterator. This should only be called when
   // |HasMore| returns true.
-  inline Object CurrentValue();
+  inline Tagged<Object> CurrentValue();
 
   OBJECT_CONSTRUCTORS(JSMapIterator,
                       OrderedHashTableIterator<JSMapIterator, OrderedHashMap>);
diff --git a/deps/v8/src/objects/js-collection.tq b/deps/v8/src/objects/js-collection.tq
index 0dbda990d256db..5ee007501c6543 100644
--- a/deps/v8/src/objects/js-collection.tq
+++ b/deps/v8/src/objects/js-collection.tq
@@ -31,3 +31,6 @@ extern class JSSetKeyValueIterator extends JSSetIterator
     generates 'TNode<JSSetIterator>';
 extern class JSSetValueIterator extends JSSetIterator
     generates 'TNode<JSSetIterator>';
+
+transient type JSSetWithNoCustomIteration extends JSSet;
+transient type JSMapWithNoCustomIteration extends JSMap;
diff --git a/deps/v8/src/objects/js-date-time-format-inl.h b/deps/v8/src/objects/js-date-time-format-inl.h
index 8c93a8eeb63398..e55d50d1ab82e5 100644
--- a/deps/v8/src/objects/js-date-time-format-inl.h
+++ b/deps/v8/src/objects/js-date-time-format-inl.h
@@ -22,13 +22,13 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSDateTimeFormat)
 
-ACCESSORS(JSDateTimeFormat, icu_locale, Managed<icu::Locale>, kIcuLocaleOffset)
+ACCESSORS(JSDateTimeFormat, icu_locale, Tagged<Managed<icu::Locale>>,
+          kIcuLocaleOffset)
 ACCESSORS(JSDateTimeFormat, icu_simple_date_format,
-          Managed<icu::SimpleDateFormat>, kIcuSimpleDateFormatOffset)
+          Tagged<Managed<icu::SimpleDateFormat>>, kIcuSimpleDateFormatOffset)
 ACCESSORS(JSDateTimeFormat, icu_date_interval_format,
-          Managed<icu::DateIntervalFormat>, kIcuDateIntervalFormatOffset)
-
-BOOL_ACCESSORS(JSDateTimeFormat, flags, alt_calendar, AltCalendarBit::kShift)
+          Tagged<Managed<icu::DateIntervalFormat>>,
+          kIcuDateIntervalFormatOffset)
 
 inline void JSDateTimeFormat::set_hour_cycle(HourCycle hour_cycle) {
   int hints = flags();
diff --git a/deps/v8/src/objects/js-date-time-format.cc b/deps/v8/src/objects/js-date-time-format.cc
index eae113ad9a7602..825a66315a8639 100644
--- a/deps/v8/src/objects/js-date-time-format.cc
+++ b/deps/v8/src/objects/js-date-time-format.cc
@@ -15,6 +15,7 @@
 #include <utility>
 #include <vector>
 
+#include "src/base/bit-field.h"
 #include "src/date/date.h"
 #include "src/execution/isolate.h"
 #include "src/heap/factory.h"
@@ -95,15 +96,33 @@ class PatternMap {
   std::string value;
 };
 
+#define BIT_FIELDS(V, _)      \
+  V(Era, bool, 1, _)          \
+  V(Year, bool, 1, _)         \
+  V(Month, bool, 1, _)        \
+  V(Weekday, bool, 1, _)      \
+  V(Day, bool, 1, _)          \
+  V(DayPeriod, bool, 1, _)    \
+  V(Hour, bool, 1, _)         \
+  V(Minute, bool, 1, _)       \
+  V(Second, bool, 1, _)       \
+  V(TimeZoneName, bool, 1, _) \
+  V(FractionalSecondDigits, bool, 1, _)
+DEFINE_BIT_FIELDS(BIT_FIELDS)
+#undef BIT_FIELDS
+
 class PatternItem {
  public:
-  PatternItem(const std::string property, std::vector<PatternMap> pairs,
+  PatternItem(int32_t shift, const std::string property,
+              std::vector<PatternMap> pairs,
               std::vector<const char*> allowed_values)
-      : property(std::move(property)),
+      : bitShift(shift),
+        property(std::move(property)),
         pairs(std::move(pairs)),
         allowed_values(allowed_values) {}
   virtual ~PatternItem() = default;
 
+  int32_t bitShift;
   const std::string property;
   // It is important for the pattern in the pairs from longer one to shorter one
   // if the longer one contains substring of an shorter one.
@@ -118,7 +137,7 @@ static std::vector<PatternItem> BuildPatternItems() {
   const std::vector<const char*> kNarrowLongShort2DigitNumeric = {
       "narrow", "long", "short", "2-digit", "numeric"};
   std::vector<PatternItem> items = {
-      PatternItem("weekday",
+      PatternItem(Weekday::kShift, "weekday",
                   {{"EEEEE", "narrow"},
                    {"EEEE", "long"},
                    {"EEE", "short"},
@@ -126,13 +145,13 @@ static std::vector<PatternItem> BuildPatternItems() {
                    {"cccc", "long"},
                    {"ccc", "short"}},
                   kNarrowLongShort),
-      PatternItem("era",
+      PatternItem(Era::kShift, "era",
                   {{"GGGGG", "narrow"}, {"GGGG", "long"}, {"GGG", "short"}},
                   kNarrowLongShort),
-      PatternItem("year", {{"yy", "2-digit"}, {"y", "numeric"}},
+      PatternItem(Year::kShift, "year", {{"yy", "2-digit"}, {"y", "numeric"}},
                   k2DigitNumeric)};
   // Sometimes we get L instead of M for month - standalone name.
-  items.push_back(PatternItem("month",
+  items.push_back(PatternItem(Month::kShift, "month",
                               {{"MMMMM", "narrow"},
                                {"MMMM", "long"},
                                {"MMM", "short"},
@@ -144,9 +163,10 @@ static std::vector<PatternItem> BuildPatternItems() {
                                {"LL", "2-digit"},
                                {"L", "numeric"}},
                               kNarrowLongShort2DigitNumeric));
-  items.push_back(PatternItem("day", {{"dd", "2-digit"}, {"d", "numeric"}},
+  items.push_back(PatternItem(Day::kShift, "day",
+                              {{"dd", "2-digit"}, {"d", "numeric"}},
                               k2DigitNumeric));
-  items.push_back(PatternItem("dayPeriod",
+  items.push_back(PatternItem(DayPeriod::kShift, "dayPeriod",
                               {{"BBBBB", "narrow"},
                                {"bbbbb", "narrow"},
                                {"BBBB", "long"},
@@ -154,7 +174,7 @@ static std::vector<PatternItem> BuildPatternItems() {
                                {"B", "short"},
                                {"b", "short"}},
                               kNarrowLongShort));
-  items.push_back(PatternItem("hour",
+  items.push_back(PatternItem(Hour::kShift, "hour",
                               {{"HH", "2-digit"},
                                {"H", "numeric"},
                                {"hh", "2-digit"},
@@ -164,23 +184,25 @@ static std::vector<PatternItem> BuildPatternItems() {
                                {"KK", "2-digit"},
                                {"K", "numeric"}},
                               k2DigitNumeric));
-  items.push_back(PatternItem("minute", {{"mm", "2-digit"}, {"m", "numeric"}},
+  items.push_back(PatternItem(Minute::kShift, "minute",
+                              {{"mm", "2-digit"}, {"m", "numeric"}},
                               k2DigitNumeric));
-  items.push_back(PatternItem("second", {{"ss", "2-digit"}, {"s", "numeric"}},
+  items.push_back(PatternItem(Second::kShift, "second",
+                              {{"ss", "2-digit"}, {"s", "numeric"}},
                               k2DigitNumeric));
 
-    const std::vector<const char*> kTimezone = {"long",        "short",
-                                                "longOffset",  "shortOffset",
-                                                "longGeneric", "shortGeneric"};
-    items.push_back(PatternItem("timeZoneName",
-                                {{"zzzz", "long"},
-                                 {"z", "short"},
-                                 {"OOOO", "longOffset"},
-                                 {"O", "shortOffset"},
-                                 {"vvvv", "longGeneric"},
-                                 {"v", "shortGeneric"}},
-                                kTimezone));
-    return items;
+  const std::vector<const char*> kTimezone = {"long",        "short",
+                                              "longOffset",  "shortOffset",
+                                              "longGeneric", "shortGeneric"};
+  items.push_back(PatternItem(TimeZoneName::kShift, "timeZoneName",
+                              {{"zzzz", "long"},
+                               {"z", "short"},
+                               {"OOOO", "longOffset"},
+                               {"O", "shortOffset"},
+                               {"vvvv", "longGeneric"},
+                               {"v", "shortGeneric"}},
+                              kTimezone));
+  return items;
 }
 
 class PatternItems {
@@ -201,15 +223,19 @@ static const std::vector<PatternItem>& GetPatternItems() {
 
 class PatternData {
  public:
-  PatternData(const std::string property, std::vector<PatternMap> pairs,
+  PatternData(int32_t shift, const std::string property,
+              std::vector<PatternMap> pairs,
               std::vector<const char*> allowed_values)
-      : property(std::move(property)), allowed_values(allowed_values) {
+      : bitShift(shift),
+        property(std::move(property)),
+        allowed_values(allowed_values) {
     for (const auto& pair : pairs) {
       map.insert(std::make_pair(pair.value, pair.pattern));
     }
   }
   virtual ~PatternData() = default;
 
+  int32_t bitShift;
   const std::string property;
   std::map<const std::string, const std::string> map;
   std::vector<const char*> allowed_values;
@@ -221,8 +247,8 @@ const std::vector<PatternData> CreateCommonData(const PatternData& hour_data) {
     if (item.property == "hour") {
       build.push_back(hour_data);
     } else {
-      build.push_back(
-          PatternData(item.property, item.pairs, item.allowed_values));
+      build.push_back(PatternData(item.bitShift, item.property, item.pairs,
+                                  item.allowed_values));
     }
   }
   return build;
@@ -230,9 +256,9 @@ const std::vector<PatternData> CreateCommonData(const PatternData& hour_data) {
 
 const std::vector<PatternData> CreateData(const char* digit2,
                                           const char* numeric) {
-  return CreateCommonData(
-      PatternData("hour", {{digit2, "2-digit"}, {numeric, "numeric"}},
-                  {"2-digit", "numeric"}));
+  return CreateCommonData(PatternData(
+      Hour::kShift, "hour", {{digit2, "2-digit"}, {numeric, "numeric"}},
+      {"2-digit", "numeric"}));
 }
 
 // According to "Date Field Symbol Table" in
@@ -530,8 +556,7 @@ Handle<Object> JSDateTimeFormat::TimeZoneId(Isolate* isolate,
 
 namespace {
 Handle<String> GetCalendar(Isolate* isolate,
-                           const icu::SimpleDateFormat& simple_date_format,
-                           bool is_alt_calendar = false) {
+                           const icu::SimpleDateFormat& simple_date_format) {
   // getType() returns legacy calendar type name instead of LDML/BCP47 calendar
   // key values. intl.js maps them to BCP47 values for key "ca".
   // TODO(jshin): Consider doing it here, instead.
@@ -542,17 +567,9 @@ Handle<String> GetCalendar(Isolate* isolate,
   // and
   // http://www.unicode.org/repos/cldr/tags/latest/common/bcp47/calendar.xml
   if (calendar_str == "gregorian") {
-    if (is_alt_calendar) {
-      calendar_str = "iso8601";
-    } else {
-      calendar_str = "gregory";
-    }
+    calendar_str = "gregory";
   } else if (calendar_str == "ethiopic-amete-alem") {
     calendar_str = "ethioaa";
-  } else if (calendar_str == "islamic") {
-    if (is_alt_calendar) {
-      calendar_str = "islamic-rgsa";
-    }
   }
   return isolate->factory()->NewStringFromAsciiChecked(calendar_str.c_str());
 }
@@ -567,14 +584,13 @@ Handle<Object> GetTimeZone(Isolate* isolate,
 Handle<String> JSDateTimeFormat::Calendar(
     Isolate* isolate, Handle<JSDateTimeFormat> date_time_format) {
   return GetCalendar(isolate,
-                     *(date_time_format->icu_simple_date_format().raw()),
-                     date_time_format->alt_calendar());
+                     *(date_time_format->icu_simple_date_format()->raw()));
 }
 
 Handle<Object> JSDateTimeFormat::TimeZone(
     Isolate* isolate, Handle<JSDateTimeFormat> date_time_format) {
   return GetTimeZone(isolate,
-                     *(date_time_format->icu_simple_date_format().raw()));
+                     *(date_time_format->icu_simple_date_format()->raw()));
 }
 
 // ecma402 #sec-intl.datetimeformat.prototype.resolvedoptions
@@ -588,11 +604,11 @@ MaybeHandle<JSObject> JSDateTimeFormat::ResolvedOptions(
 
   Handle<String> locale = Handle<String>(date_time_format->locale(), isolate);
   DCHECK(!date_time_format->icu_locale().is_null());
-  DCHECK_NOT_NULL(date_time_format->icu_locale().raw());
-  icu::Locale* icu_locale = date_time_format->icu_locale().raw();
+  DCHECK_NOT_NULL(date_time_format->icu_locale()->raw());
+  icu::Locale* icu_locale = date_time_format->icu_locale()->raw();
 
   icu::SimpleDateFormat* icu_simple_date_format =
-      date_time_format->icu_simple_date_format().raw();
+      date_time_format->icu_simple_date_format()->raw();
   Handle<Object> timezone =
       JSDateTimeFormat::TimeZone(isolate, date_time_format);
 
@@ -745,7 +761,7 @@ namespace {
 // #sec-temporal-istemporalobject
 bool IsTemporalObject(Handle<Object> value) {
   // 1. If Type(value) is not Object, then
-  if (!value->IsJSReceiver()) {
+  if (!IsJSReceiver(*value)) {
     // a. Return false.
     return false;
   }
@@ -754,11 +770,11 @@ bool IsTemporalObject(Handle<Object> value) {
   // [[InitializedTemporalZonedDateTime]], [[InitializedTemporalYearMonth]],
   // [[InitializedTemporalMonthDay]], or [[InitializedTemporalInstant]] internal
   // slot, then
-  if (!value->IsJSTemporalPlainDate() && !value->IsJSTemporalPlainTime() &&
-      !value->IsJSTemporalPlainDateTime() &&
-      !value->IsJSTemporalZonedDateTime() &&
-      !value->IsJSTemporalPlainYearMonth() &&
-      !value->IsJSTemporalPlainMonthDay() && !value->IsJSTemporalInstant()) {
+  if (!IsJSTemporalPlainDate(*value) && !IsJSTemporalPlainTime(*value) &&
+      !IsJSTemporalPlainDateTime(*value) &&
+      !IsJSTemporalZonedDateTime(*value) &&
+      !IsJSTemporalPlainYearMonth(*value) &&
+      !IsJSTemporalPlainMonthDay(*value) && !IsJSTemporalInstant(*value)) {
     // a. Return false.
     return false;
   }
@@ -774,33 +790,33 @@ bool SameTemporalType(Handle<Object> x, Handle<Object> y) {
   if (!IsTemporalObject(y)) return false;
   // 2. If x has an [[InitializedTemporalDate]] internal slot and y does not,
   // return false.
-  if (x->IsJSTemporalPlainDate() && !y->IsJSTemporalPlainDate()) return false;
+  if (IsJSTemporalPlainDate(*x) && !IsJSTemporalPlainDate(*y)) return false;
   // 3. If x has an [[InitializedTemporalTime]] internal slot and y does not,
   // return false.
-  if (x->IsJSTemporalPlainTime() && !y->IsJSTemporalPlainTime()) return false;
+  if (IsJSTemporalPlainTime(*x) && !IsJSTemporalPlainTime(*y)) return false;
   // 4. If x has an [[InitializedTemporalDateTime]] internal slot and y does
   // not, return false.
-  if (x->IsJSTemporalPlainDateTime() && !y->IsJSTemporalPlainDateTime()) {
+  if (IsJSTemporalPlainDateTime(*x) && !IsJSTemporalPlainDateTime(*y)) {
     return false;
   }
   // 5. If x has an [[InitializedTemporalZonedDateTime]] internal slot and y
   // does not, return false.
-  if (x->IsJSTemporalZonedDateTime() && !y->IsJSTemporalZonedDateTime()) {
+  if (IsJSTemporalZonedDateTime(*x) && !IsJSTemporalZonedDateTime(*y)) {
     return false;
   }
   // 6. If x has an [[InitializedTemporalYearMonth]] internal slot and y does
   // not, return false.
-  if (x->IsJSTemporalPlainYearMonth() && !y->IsJSTemporalPlainYearMonth()) {
+  if (IsJSTemporalPlainYearMonth(*x) && !IsJSTemporalPlainYearMonth(*y)) {
     return false;
   }
   // 7. If x has an [[InitializedTemporalMonthDay]] internal slot and y does
   // not, return false.
-  if (x->IsJSTemporalPlainMonthDay() && !y->IsJSTemporalPlainMonthDay()) {
+  if (IsJSTemporalPlainMonthDay(*x) && !IsJSTemporalPlainMonthDay(*y)) {
     return false;
   }
   // 8. If x has an [[InitializedTemporalInstant]] internal slot and y does not,
   // return false.
-  if (x->IsJSTemporalInstant() && !y->IsJSTemporalInstant()) return false;
+  if (IsJSTemporalInstant(*x) && !IsJSTemporalInstant(*y)) return false;
   // 9. Return true.
   return true;
 }
@@ -839,7 +855,7 @@ Maybe<DateTimeValueRecord> TemporalPlainDateTimeToRecord(
   Handle<Object> time_zone_obj = GetTimeZone(isolate, date_time_format);
   // TODO(ftang): we should change the return type of GetTimeZone() to
   // Handle<String> by ensure it will not return undefined.
-  CHECK(time_zone_obj->IsString());
+  CHECK(IsString(*time_zone_obj));
   Handle<JSTemporalTimeZone> time_zone =
       temporal::CreateTemporalTimeZone(isolate,
                                        Handle<String>::cast(time_zone_obj))
@@ -1002,7 +1018,7 @@ Maybe<DateTimeValueRecord> HandleDateTimeTemporalZonedDateTime(
   // timeZone is not equal to dateTimeFormat.[[TimeZone]], then
   Handle<Object> date_time_format_time_zone =
       GetTimeZone(isolate, date_time_format);
-  DCHECK(date_time_format_time_zone->IsString());
+  DCHECK(IsString(*date_time_format_time_zone));
   Handle<String> date_time_format_time_zone_string =
       Handle<String>::cast(date_time_format_time_zone);
   if (!String::Equals(isolate, date_time_format_time_zone_string,
@@ -1133,7 +1149,7 @@ Maybe<DateTimeValueRecord> HandleDateTimeOthers(
 
   // 4. If x is undefined, then
   double x;
-  if (x_obj->IsUndefined()) {
+  if (IsUndefined(*x_obj)) {
     // a. Set x to ! Call(%Date.now%, undefined).
     x = static_cast<double>(JSDate::CurrentTimeValue(isolate));
     // 5. Else,
@@ -1142,7 +1158,7 @@ Maybe<DateTimeValueRecord> HandleDateTimeOthers(
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, x_obj,
                                      Object::ToNumber(isolate, x_obj),
                                      Nothing<DateTimeValueRecord>());
-    x = x_obj->Number();
+    x = Object::Number(*x_obj);
   }
   // 6. Set x to TimeClip(x).
   x = DateCache::TimeClip(x);
@@ -1167,49 +1183,49 @@ Maybe<DateTimeValueRecord> HandleDateTimeValue(
     const char* method_name) {
   if (IsTemporalObject(x)) {
     // a. If x has an [[InitializedTemporalDate]] internal slot, then
-    if (x->IsJSTemporalPlainDate()) {
+    if (IsJSTemporalPlainDate(*x)) {
       // i. Return ? HandleDateTimeTemporalDate(dateTimeFormat, x).
       return HandleDateTimeTemporalDate(
           isolate, date_time_format, date_time_format_calendar,
           Handle<JSTemporalPlainDate>::cast(x), method_name);
     }
     // b. If x has an [[InitializedTemporalYearMonth]] internal slot, then
-    if (x->IsJSTemporalPlainYearMonth()) {
+    if (IsJSTemporalPlainYearMonth(*x)) {
       // i. Return ? HandleDateTimeTemporalYearMonth(dateTimeFormat, x).
       return HandleDateTimeTemporalYearMonth(
           isolate, date_time_format, date_time_format_calendar,
           Handle<JSTemporalPlainYearMonth>::cast(x), method_name);
     }
     // c. If x has an [[InitializedTemporalMonthDay]] internal slot, then
-    if (x->IsJSTemporalPlainMonthDay()) {
+    if (IsJSTemporalPlainMonthDay(*x)) {
       // i. Return ? HandleDateTimeTemporalMonthDay(dateTimeFormat, x).
       return HandleDateTimeTemporalMonthDay(
           isolate, date_time_format, date_time_format_calendar,
           Handle<JSTemporalPlainMonthDay>::cast(x), method_name);
     }
     // d. If x has an [[InitializedTemporalTime]] internal slot, then
-    if (x->IsJSTemporalPlainTime()) {
+    if (IsJSTemporalPlainTime(*x)) {
       // i. Return ? HandleDateTimeTemporalTime(dateTimeFormat, x).
       return HandleDateTimeTemporalTime(isolate, date_time_format,
                                         Handle<JSTemporalPlainTime>::cast(x),
                                         method_name);
     }
     // e. If x has an [[InitializedTemporalDateTime]] internal slot, then
-    if (x->IsJSTemporalPlainDateTime()) {
+    if (IsJSTemporalPlainDateTime(*x)) {
       // i. Return ? HandleDateTimeTemporalDateTime(dateTimeFormat, x).
       return HandleDateTimeTemporalDateTime(
           isolate, date_time_format, date_time_format_calendar,
           Handle<JSTemporalPlainDateTime>::cast(x), method_name);
     }
     // f. If x has an [[InitializedTemporalInstant]] internal slot, then
-    if (x->IsJSTemporalInstant()) {
+    if (IsJSTemporalInstant(*x)) {
       // i. Return ? HandleDateTimeTemporalInstant(dateTimeFormat, x).
       return HandleDateTimeTemporalInstant(isolate, date_time_format,
                                            Handle<JSTemporalInstant>::cast(x),
                                            method_name);
     }
     // g. Assert: x has an [[InitializedTemporalZonedDateTime]] internal slot.
-    DCHECK(x->IsJSTemporalZonedDateTime());
+    DCHECK(IsJSTemporalZonedDateTime(*x));
     // h. Return ? HandleDateTimeTemporalZonedDateTime(dateTimeFormat, x).
     return HandleDateTimeTemporalZonedDateTime(
         isolate, date_time_format, date_time_format_calendar,
@@ -1431,7 +1447,7 @@ MaybeHandle<String> FormatDateTimeWithTemporalSupport(
     Isolate* isolate, Handle<JSDateTimeFormat> date_time_format,
     Handle<Object> x, const char* method_name) {
   return FormatDateTimeWithTemporalSupport(
-      isolate, *(date_time_format->icu_simple_date_format().raw()),
+      isolate, *(date_time_format->icu_simple_date_format()->raw()),
       JSDateTimeFormat::Calendar(isolate, date_time_format), x, method_name);
 }
 
@@ -1451,7 +1467,7 @@ MaybeHandle<String> JSDateTimeFormat::DateTimeFormat(
 
   // 3. If date is not provided or is undefined, then
   double x;
-  if (date->IsUndefined()) {
+  if (IsUndefined(*date)) {
     // 3.a Let x be Call(%Date_now%, undefined).
     x = static_cast<double>(JSDate::CurrentTimeValue(isolate));
   } else {
@@ -1459,12 +1475,12 @@ MaybeHandle<String> JSDateTimeFormat::DateTimeFormat(
     //    a. Let x be ? ToNumber(date).
     ASSIGN_RETURN_ON_EXCEPTION(isolate, date, Object::ToNumber(isolate, date),
                                String);
-    DCHECK(date->IsNumber());
-    x = date->Number();
+    DCHECK(IsNumber(*date));
+    x = Object::Number(*date);
   }
   // 5. Return FormatDateTime(dtf, x).
   icu::SimpleDateFormat* format =
-      date_time_format->icu_simple_date_format().raw();
+      date_time_format->icu_simple_date_format()->raw();
   return FormatDateTime(isolate, *format, x);
 }
 
@@ -1491,13 +1507,13 @@ MaybeHandle<String> JSDateTimeFormat::ToLocaleDateTime(
 
   Factory* factory = isolate->factory();
   // 1. Let x be ? thisTimeValue(this value);
-  if (!date->IsJSDate()) {
+  if (!IsJSDate(*date)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                                  factory->Date_string()),
                     String);
   }
-  double const x = Handle<JSDate>::cast(date)->value().Number();
+  double const x = Object::Number(Handle<JSDate>::cast(date)->value());
   // 2. If x is NaN, return "Invalid Date"
   if (std::isnan(x)) {
     return factory->Invalid_Date_string();
@@ -1506,8 +1522,8 @@ MaybeHandle<String> JSDateTimeFormat::ToLocaleDateTime(
   // We only cache the instance when locales is a string/undefined and
   // options is undefined, as that is the only case when the specified
   // side-effects of examining those arguments are unobservable.
-  bool can_cache = (locales->IsString() || locales->IsUndefined(isolate)) &&
-                   options->IsUndefined(isolate);
+  bool can_cache = (IsString(*locales) || IsUndefined(*locales, isolate)) &&
+                   IsUndefined(*options, isolate);
   if (can_cache) {
     // Both locales and options are undefined, check the cache.
     icu::SimpleDateFormat* cached_icu_simple_date_format =
@@ -1517,16 +1533,11 @@ MaybeHandle<String> JSDateTimeFormat::ToLocaleDateTime(
       return FormatDateTime(isolate, *cached_icu_simple_date_format, x);
     }
   }
-  // 3. Let options be ? ToDateTimeOptions(options, required, defaults).
-  Handle<JSObject> internal_options;
-  ASSIGN_RETURN_ON_EXCEPTION(
-      isolate, internal_options,
-      ToDateTimeOptions(isolate, options, required, defaults), String);
-
   // 4. Let dateFormat be ? Construct(%DateTimeFormat%, « locales, options »).
   Handle<JSFunction> constructor = Handle<JSFunction>(
-      JSFunction::cast(
-          isolate->context().native_context().intl_date_time_format_function()),
+      JSFunction::cast(isolate->context()
+                           ->native_context()
+                           ->intl_date_time_format_function()),
       isolate);
   Handle<Map> map;
   ASSIGN_RETURN_ON_EXCEPTION(
@@ -1535,19 +1546,19 @@ MaybeHandle<String> JSDateTimeFormat::ToLocaleDateTime(
   Handle<JSDateTimeFormat> date_time_format;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, date_time_format,
-      JSDateTimeFormat::New(isolate, map, locales, internal_options,
-                            method_name),
+      JSDateTimeFormat::CreateDateTimeFormat(isolate, map, locales, options,
+                                             required, defaults, method_name),
       String);
 
   if (can_cache) {
     isolate->set_icu_object_in_cache(
         cache_type, locales,
         std::static_pointer_cast<icu::UMemory>(
-            date_time_format->icu_simple_date_format().get()));
+            date_time_format->icu_simple_date_format()->get()));
   }
   // 5. Return FormatDateTime(dateFormat, x).
   icu::SimpleDateFormat* format =
-      date_time_format->icu_simple_date_format().raw();
+      date_time_format->icu_simple_date_format()->raw();
   return FormatDateTime(isolate, *format, x);
 }
 
@@ -1556,7 +1567,7 @@ MaybeHandle<String> JSDateTimeFormat::TemporalToLocaleString(
     Handle<Object> options, const char* method_name) {
   // 4. Let dateFormat be ? Construct(%DateTimeFormat%, « locales, options »).
   Handle<JSFunction> constructor(
-      isolate->context().native_context().intl_date_time_format_function(),
+      isolate->context()->native_context()->intl_date_time_format_function(),
       isolate);
   Handle<Map> map = JSFunction::GetDerivedMap(isolate, constructor, constructor)
                         .ToHandleChecked();
@@ -1571,162 +1582,10 @@ MaybeHandle<String> JSDateTimeFormat::TemporalToLocaleString(
                                            method_name);
 }
 
-namespace {
-
-Maybe<bool> IsPropertyUndefined(Isolate* isolate, Handle<JSObject> options,
-                                Handle<String> property) {
-  // i. Let prop be the property name.
-  // ii. Let value be ? Get(options, prop).
-  Handle<Object> value;
-  ASSIGN_RETURN_ON_EXCEPTION_VALUE(
-      isolate, value, Object::GetPropertyOrElement(isolate, options, property),
-      Nothing<bool>());
-  return Just(value->IsUndefined(isolate));
-}
-
-Maybe<bool> NeedsDefault(Isolate* isolate, Handle<JSObject> options,
-                         const std::vector<Handle<String>>& props) {
-  bool needs_default = true;
-  for (const auto& prop : props) {
-    //  i. Let prop be the property name.
-    // ii. Let value be ? Get(options, prop)
-    Maybe<bool> maybe_undefined = IsPropertyUndefined(isolate, options, prop);
-    MAYBE_RETURN(maybe_undefined, Nothing<bool>());
-    // iii. If value is not undefined, let needDefaults be false.
-    if (!maybe_undefined.FromJust()) {
-      needs_default = false;
-    }
-  }
-  return Just(needs_default);
-}
-
-Maybe<bool> CreateDefault(Isolate* isolate, Handle<JSObject> options,
-                          const std::vector<std::string>& props) {
-  Factory* factory = isolate->factory();
-  // i. Perform ? CreateDataPropertyOrThrow(options, prop, "numeric").
-  for (const auto& prop : props) {
-    MAYBE_RETURN(
-        JSReceiver::CreateDataProperty(
-            isolate, options, factory->NewStringFromAsciiChecked(prop.c_str()),
-            factory->numeric_string(), Just(kThrowOnError)),
-        Nothing<bool>());
-  }
-  return Just(true);
-}
-
-}  // namespace
-
-// ecma-402/#sec-todatetimeoptions
-MaybeHandle<JSObject> JSDateTimeFormat::ToDateTimeOptions(
-    Isolate* isolate, Handle<Object> input_options, RequiredOption required,
-    DefaultsOption defaults) {
-  Factory* factory = isolate->factory();
-  // 1. If options is undefined, let options be null; otherwise let options be ?
-  //    ToObject(options).
-  Handle<JSObject> options;
-  if (input_options->IsUndefined(isolate)) {
-    options = factory->NewJSObjectWithNullProto();
-  } else {
-    Handle<JSReceiver> options_obj;
-    ASSIGN_RETURN_ON_EXCEPTION(isolate, options_obj,
-                               Object::ToObject(isolate, input_options),
-                               JSObject);
-    // 2. Let options be ObjectCreate(options).
-    ASSIGN_RETURN_ON_EXCEPTION(isolate, options,
-                               JSObject::ObjectCreate(isolate, options_obj),
-                               JSObject);
-  }
-
-  // 3. Let needDefaults be true.
-  bool needs_default = true;
-
-  // 4. If required is "date" or "any", then
-  if (required == RequiredOption::kAny || required == RequiredOption::kDate) {
-    // a. For each of the property names "weekday", "year", "month",
-    // "day", do
-    std::vector<Handle<String>> list(
-        {factory->weekday_string(), factory->year_string()});
-    list.push_back(factory->month_string());
-    list.push_back(factory->day_string());
-    Maybe<bool> maybe_needs_default = NeedsDefault(isolate, options, list);
-    MAYBE_RETURN(maybe_needs_default, Handle<JSObject>());
-    needs_default = maybe_needs_default.FromJust();
-  }
-
-  // 5. If required is "time" or "any", then
-  if (required == RequiredOption::kAny || required == RequiredOption::kTime) {
-    // a. For each of the property names "dayPeriod", "hour", "minute",
-    // "second", "fractionalSecondDigits", do
-    std::vector<Handle<String>> list;
-    list.push_back(factory->dayPeriod_string());
-    list.push_back(factory->hour_string());
-    list.push_back(factory->minute_string());
-    list.push_back(factory->second_string());
-    list.push_back(factory->fractionalSecondDigits_string());
-    Maybe<bool> maybe_needs_default = NeedsDefault(isolate, options, list);
-    MAYBE_RETURN(maybe_needs_default, Handle<JSObject>());
-    needs_default &= maybe_needs_default.FromJust();
-  }
-
-  // 6. Let dateStyle be ? Get(options, "dateStyle").
-  Maybe<bool> maybe_datestyle_undefined =
-      IsPropertyUndefined(isolate, options, factory->dateStyle_string());
-  MAYBE_RETURN(maybe_datestyle_undefined, Handle<JSObject>());
-  // 7. Let timeStyle be ? Get(options, "timeStyle").
-  Maybe<bool> maybe_timestyle_undefined =
-      IsPropertyUndefined(isolate, options, factory->timeStyle_string());
-  MAYBE_RETURN(maybe_timestyle_undefined, Handle<JSObject>());
-  // 8. If dateStyle is not undefined or timeStyle is not undefined, let
-  // needDefaults be false.
-  if (!maybe_datestyle_undefined.FromJust() ||
-      !maybe_timestyle_undefined.FromJust()) {
-    needs_default = false;
-  }
-  // 9. If required is "date" and timeStyle is not undefined,
-  if (required == RequiredOption::kDate &&
-      !maybe_timestyle_undefined.FromJust()) {
-    //  a. Throw a TypeError exception.
-    THROW_NEW_ERROR(
-        isolate,
-        NewTypeError(MessageTemplate::kInvalid,
-                     factory->NewStringFromStaticChars("option"),
-                     factory->NewStringFromStaticChars("timeStyle")),
-        JSObject);
-  }
-  // 10. If required is "time" and dateStyle is not undefined,
-  if (required == RequiredOption::kTime &&
-      !maybe_datestyle_undefined.FromJust()) {
-    //  a. Throw a TypeError exception.
-    THROW_NEW_ERROR(
-        isolate,
-        NewTypeError(MessageTemplate::kInvalid,
-                     factory->NewStringFromStaticChars("option"),
-                     factory->NewStringFromStaticChars("dateStyle")),
-        JSObject);
-  }
-
-  // 11. If needDefaults is true and defaults is either "date" or "all", then
-  if (needs_default) {
-    if (defaults == DefaultsOption::kAll || defaults == DefaultsOption::kDate) {
-      // a. For each of the property names "year", "month", "day", do)
-      const std::vector<std::string> list({"year", "month", "day"});
-      MAYBE_RETURN(CreateDefault(isolate, options, list), Handle<JSObject>());
-    }
-    // 12. If needDefaults is true and defaults is either "time" or "all", then
-    if (defaults == DefaultsOption::kAll || defaults == DefaultsOption::kTime) {
-      // a. For each of the property names "hour", "minute", "second", do
-      const std::vector<std::string> list({"hour", "minute", "second"});
-      MAYBE_RETURN(CreateDefault(isolate, options, list), Handle<JSObject>());
-    }
-  }
-  // 13. Return options.
-  return options;
-}
-
 MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::UnwrapDateTimeFormat(
     Isolate* isolate, Handle<JSReceiver> format_holder) {
   Handle<Context> native_context =
-      Handle<Context>(isolate->context().native_context(), isolate);
+      Handle<Context>(isolate->context()->native_context(), isolate);
   Handle<JSFunction> constructor = Handle<JSFunction>(
       JSFunction::cast(native_context->intl_date_time_format_function()),
       isolate);
@@ -1734,11 +1593,11 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::UnwrapDateTimeFormat(
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, dtf,
       Intl::LegacyUnwrapReceiver(isolate, format_holder, constructor,
-                                 format_holder->IsJSDateTimeFormat()),
+                                 IsJSDateTimeFormat(*format_holder)),
       JSDateTimeFormat);
   // 2. If Type(dtf) is not Object or dtf does not have an
   //    [[InitializedDateTimeFormat]] internal slot, then
-  if (!dtf->IsJSDateTimeFormat()) {
+  if (!IsJSDateTimeFormat(*dtf)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kIncompatibleMethodReceiver,
@@ -1795,7 +1654,8 @@ class CalendarCache {
     DCHECK_NOT_NULL(calendar.get());
 
     if (calendar->getDynamicClassID() ==
-        icu::GregorianCalendar::getStaticClassID()) {
+            icu::GregorianCalendar::getStaticClassID() ||
+        strcmp(calendar->getType(), "iso8601") == 0) {
       icu::GregorianCalendar* gc =
           static_cast<icu::GregorianCalendar*>(calendar.get());
       status = U_ZERO_ERROR;
@@ -1957,15 +1817,15 @@ std::unique_ptr<icu::SimpleDateFormat> CreateICUDateFormatFromCache(
 std::unique_ptr<icu::DateIntervalFormat> LazyCreateDateIntervalFormat(
     Isolate* isolate, Handle<JSDateTimeFormat> date_time_format,
     PatternKind kind) {
-  Managed<icu::DateIntervalFormat> managed_format =
+  Tagged<Managed<icu::DateIntervalFormat>> managed_format =
       date_time_format->icu_date_interval_format();
-  if (kind == PatternKind::kDate && managed_format.get()) {
+  if (kind == PatternKind::kDate && managed_format->get()) {
     return std::unique_ptr<icu::DateIntervalFormat>(
-        managed_format.raw()->clone());
+        managed_format->raw()->clone());
   }
   UErrorCode status = U_ZERO_ERROR;
 
-  icu::Locale loc = *(date_time_format->icu_locale().raw());
+  icu::Locale loc = *(date_time_format->icu_locale()->raw());
   // We need to pass in the hc to DateIntervalFormat by using Unicode 'hc'
   // extension.
   std::string hcString = ToHourCycleString(date_time_format->hour_cycle());
@@ -1974,7 +1834,7 @@ std::unique_ptr<icu::DateIntervalFormat> LazyCreateDateIntervalFormat(
   }
 
   icu::SimpleDateFormat* icu_simple_date_format =
-      date_time_format->icu_simple_date_format().raw();
+      date_time_format->icu_simple_date_format()->raw();
 
   icu::UnicodeString skeleton = GetSkeletonForPatternKind(
       SkeletonFromDateFormat(*icu_simple_date_format), kind);
@@ -1991,7 +1851,7 @@ std::unique_ptr<icu::DateIntervalFormat> LazyCreateDateIntervalFormat(
           isolate, 0, std::move(date_interval_format));
   date_time_format->set_icu_date_interval_format(*managed_interval_format);
   return std::unique_ptr<icu::DateIntervalFormat>(
-      (*managed_interval_format).raw()->clone());
+      managed_interval_format->raw()->clone());
 }
 
 JSDateTimeFormat::HourCycle HourCycleFromPattern(
@@ -2210,6 +2070,15 @@ enum FormatMatcherOption { kBestFit, kBasic };
 MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
     Isolate* isolate, Handle<Map> map, Handle<Object> locales,
     Handle<Object> input_options, const char* service) {
+  return JSDateTimeFormat::CreateDateTimeFormat(
+      isolate, map, locales, input_options, RequiredOption::kAny,
+      DefaultsOption::kDate, service);
+}
+
+MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::CreateDateTimeFormat(
+    Isolate* isolate, Handle<Map> map, Handle<Object> locales,
+    Handle<Object> input_options, RequiredOption required,
+    DefaultsOption defaults, const char* service) {
   Factory* factory = isolate->factory();
   // 1. Let requestedLocales be ? CanonicalizeLocaleList(locales).
   Maybe<std::vector<std::string>> maybe_requested_locales =
@@ -2217,12 +2086,10 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
   MAYBE_RETURN(maybe_requested_locales, Handle<JSDateTimeFormat>());
   std::vector<std::string> requested_locales =
       maybe_requested_locales.FromJust();
-  // 2. Let options be ? ToDateTimeOptions(options, "any", "date").
-  Handle<JSObject> options;
+  // 2. Let options be ? CoerceOptionsToObject(_options_).
+  Handle<JSReceiver> options;
   ASSIGN_RETURN_ON_EXCEPTION(
-      isolate, options,
-      JSDateTimeFormat::ToDateTimeOptions(
-          isolate, input_options, RequiredOption::kAny, DefaultsOption::kDate),
+      isolate, options, CoerceOptionsToObject(isolate, input_options, service),
       JSDateTimeFormat);
 
   // 4. Let matcher be ? GetOption(options, "localeMatcher", "string",
@@ -2327,9 +2194,6 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
     icu_locale.setUnicodeKeywordValue("ca", calendar_str.get(), status);
     DCHECK(U_SUCCESS(status));
   }
-  bool alt_calendar =
-      strstr(icu_locale.getName(), "calendar=iso8601") != nullptr ||
-      strstr(icu_locale.getName(), "calendar=islamic-rgsa") != nullptr;
 
   if (numbering_system_str != nullptr &&
       Intl::IsValidNumberingSystem(numbering_system_str.get())) {
@@ -2423,7 +2287,10 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
   DateTimeStyle time_style = DateTimeStyle::kUndefined;
   std::unique_ptr<icu::SimpleDateFormat> icu_date_format;
 
-  // 28. For each row of Table 1, except the header row, do
+  // 35. Let hasExplicitFormatComponents be false.
+  int32_t explicit_format_components =
+      0;  // The fields which are not undefined.
+  // 36. For each row of Table 1, except the header row, do
   bool has_hour_option = false;
   std::string skeleton;
   for (const PatternData& item : GetPatternData(hc)) {
@@ -2437,6 +2304,10 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
           GetNumberOption(isolate, options,
                           factory->fractionalSecondDigits_string(), 1, 3, 0),
           Handle<JSDateTimeFormat>());
+      if (fsd > 0) {
+        explicit_format_components =
+            FractionalSecondDigits::update(explicit_format_components, true);
+      }
       // Convert fractionalSecondDigits to skeleton.
       for (int i = 0; i < fsd; i++) {
         skeleton += "S";
@@ -2451,12 +2322,16 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
                         item.allowed_values, service, &input);
     MAYBE_RETURN(maybe_get_option, Handle<JSDateTimeFormat>());
     if (maybe_get_option.FromJust()) {
+      // Record which fields are not undefined into explicit_format_components.
       if (item.property == "hour") {
         has_hour_option = true;
       }
       DCHECK_NOT_NULL(input.get());
       // iii. Set opt.[[<prop>]] to value.
       skeleton += item.map.find(input.get())->second;
+      // e. If value is not undefined, then
+      // i. Set hasExplicitFormatComponents to true.
+      explicit_format_components |= 1 << static_cast<int32_t>(item.bitShift);
     }
   }
 
@@ -2510,38 +2385,34 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
   // 37. If dateStyle or timeStyle are not undefined, then
   if (date_style != DateTimeStyle::kUndefined ||
       time_style != DateTimeStyle::kUndefined) {
-    // a. For each row in Table 1, except the header row, do
-    //    i. Let prop be the name given in the Property column of the row.
-    //   ii. Let p be opt.[[<prop>]].
-    //  iii. If p is not undefined, then
-    //      1. Throw a TypeError exception.
-    if (skeleton.length() > 0) {
-      std::string prop;
-      for (const auto& item : GetPatternItems()) {
-        for (const auto& pair : item.pairs) {
-          if (skeleton.find(pair.pattern) != std::string::npos) {
-            prop.assign(item.property);
-            break;
-          }
-        }
-        if (!prop.empty()) {
-          break;
-        }
-      }
-      if (prop.empty() && skeleton.find("S") != std::string::npos) {
-        prop.assign("fractionalSecondDigits");
-      }
-      if (!prop.empty()) {
-        THROW_NEW_ERROR(
-            isolate,
-            NewTypeError(MessageTemplate::kCantSetOptionXWhenYIsUsed,
-                         factory->NewStringFromAsciiChecked(prop.c_str()),
-                         date_style != DateTimeStyle::kUndefined
-                             ? factory->dateStyle_string()
-                             : factory->timeStyle_string()),
-            JSDateTimeFormat);
-      }
-      UNREACHABLE();
+    // a. If hasExplicitFormatComponents is true, then
+    if (explicit_format_components != 0) {
+      // i. Throw a TypeError exception.
+      THROW_NEW_ERROR(isolate,
+                      NewTypeError(MessageTemplate::kInvalid,
+                                   factory->NewStringFromStaticChars("option"),
+                                   factory->NewStringFromStaticChars("option")),
+                      JSDateTimeFormat);
+    }
+    // b. If required is ~date~ and timeStyle is not *undefined*, then
+    if (required == RequiredOption::kDate &&
+        time_style != DateTimeStyle::kUndefined) {
+      // i. Throw a *TypeError* exception.
+      THROW_NEW_ERROR(isolate,
+                      NewTypeError(MessageTemplate::kInvalid,
+                                   factory->NewStringFromStaticChars("option"),
+                                   factory->timeStyle_string()),
+                      JSDateTimeFormat);
+    }
+    // c. If required is ~time~ and dateStyle is not *undefined*, then
+    if (required == RequiredOption::kTime &&
+        date_style != DateTimeStyle::kUndefined) {
+      // i. Throw a *TypeError* exception.
+      THROW_NEW_ERROR(isolate,
+                      NewTypeError(MessageTemplate::kInvalid,
+                                   factory->NewStringFromStaticChars("option"),
+                                   factory->dateStyle_string()),
+                      JSDateTimeFormat);
     }
     // b. Let pattern be DateTimeStylePattern(dateStyle, timeStyle,
     // dataLocaleData, hc).
@@ -2556,6 +2427,66 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
                       JSDateTimeFormat);
     }
   } else {
+    // a. Let needDefaults be *true*.
+    bool needDefaults = true;
+    // b. If required is ~date~ or ~any~, then
+    if (required == RequiredOption::kDate || required == RequiredOption::kAny) {
+      // 1. For each property name prop of << *"weekday"*, *"year"*, *"month"*,
+      // *"day"* >>, do
+      //    1. Let value be formatOptions.[[<prop>]].
+      //    1. If value is not *undefined*, let needDefaults be *false*.
+
+      needDefaults &= !Weekday::decode(explicit_format_components);
+      needDefaults &= !Year::decode(explicit_format_components);
+      needDefaults &= !Month::decode(explicit_format_components);
+      needDefaults &= !Day::decode(explicit_format_components);
+    }
+    // c. If required is ~time~ or ~any~, then
+    if (required == RequiredOption::kTime || required == RequiredOption::kAny) {
+      // 1. For each property name prop of &laquo; *"dayPeriod"*, *"hour"*,
+      // *"minute"*, *"second"*, *"fractionalSecondDigits"* &raquo;, do
+      //    1. Let value be formatOptions.[[&lt;_prop_&gt;]].
+      //    1. If value is not *undefined*, let _needDefaults_ be *false*.
+      needDefaults &= !DayPeriod::decode(explicit_format_components);
+      needDefaults &= !Hour::decode(explicit_format_components);
+      needDefaults &= !Minute::decode(explicit_format_components);
+      needDefaults &= !Second::decode(explicit_format_components);
+      needDefaults &=
+          !FractionalSecondDigits::decode(explicit_format_components);
+    }
+    // 1. If needDefaults is *true* and _defaults_ is either ~date~ or ~all~,
+    // then
+    if (needDefaults && ((DefaultsOption::kDate == defaults) ||
+                         (DefaultsOption::kAll == defaults))) {
+      // 1. For each property name prop of <<*"year"*, *"month"*, *"day"* >>, do
+      // 1. Set formatOptions.[[<<prop>>]] to *"numeric"*.
+      skeleton += "yMd";
+    }
+    // 1. If _needDefaults_ is *true* and defaults is either ~time~ or ~all~,
+    // then
+    if (needDefaults && ((DefaultsOption::kTime == defaults) ||
+                         (DefaultsOption::kAll == defaults))) {
+      // 1. For each property name prop of << *"hour"*, *"minute"*, *"second"*
+      // >>, do
+      // 1. Set _formatOptions_.[[<<prop>>]] to *"numeric"*.
+      // See
+      // https://unicode.org/reports/tr35/tr35.html#UnicodeHourCycleIdentifier
+      switch (hc) {
+        case HourCycle::kH12:
+          skeleton += "hms";
+          break;
+        case HourCycle::kH23:
+        case HourCycle::kUndefined:
+          skeleton += "Hms";
+          break;
+        case HourCycle::kH11:
+          skeleton += "Kms";
+          break;
+        case HourCycle::kH24:
+          skeleton += "kms";
+          break;
+      }
+    }
     // e. If dateTimeFormat.[[Hour]] is not undefined, then
     if (has_hour_option) {
       // v. Set dateTimeFormat.[[HourCycle]] to hc.
@@ -2639,7 +2570,6 @@ MaybeHandle<JSDateTimeFormat> JSDateTimeFormat::New(
     date_time_format->set_time_style(time_style);
   }
   date_time_format->set_hour_cycle(dateTimeFormatHourCycle);
-  date_time_format->set_alt_calendar(alt_calendar);
   date_time_format->set_locale(*locale_str);
   date_time_format->set_icu_locale(*managed_locale);
   date_time_format->set_icu_simple_date_format(*managed_format);
@@ -2734,17 +2664,15 @@ MaybeHandle<JSArray> FormatToPartsWithTemporalSupport(
     Isolate* isolate, Handle<JSDateTimeFormat> date_time_format,
     Handle<Object> x, bool output_source, const char* method_name) {
   icu::SimpleDateFormat* format =
-      date_time_format->icu_simple_date_format().raw();
+      date_time_format->icu_simple_date_format()->raw();
   DCHECK_NOT_NULL(format);
 
   // 1. Let x be ? HandleDateTimeValue(dateTimeFormat, x).
   DateTimeValueRecord x_record;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, x_record,
-      HandleDateTimeValue(
-          isolate, *format,
-          GetCalendar(isolate, *format, date_time_format->alt_calendar()), x,
-          method_name),
+      HandleDateTimeValue(isolate, *format, GetCalendar(isolate, *format), x,
+                          method_name),
       Handle<JSArray>());
 
   return FormatMillisecondsByKindToArray(isolate, *format, x_record.kind,
@@ -2780,20 +2708,20 @@ MaybeHandle<JSArray> JSDateTimeFormat::FormatToParts(
                                             output_source, method_name);
   }
 
-  if (x->IsUndefined(isolate)) {
+  if (IsUndefined(*x, isolate)) {
     x = factory->NewNumberFromInt64(JSDate::CurrentTimeValue(isolate));
   } else {
     ASSIGN_RETURN_ON_EXCEPTION(isolate, x, Object::ToNumber(isolate, x),
                                JSArray);
   }
 
-  double date_value = DateCache::TimeClip(x->Number());
+  double date_value = DateCache::TimeClip(Object::Number(*x));
   if (std::isnan(date_value)) {
     THROW_NEW_ERROR(isolate, NewRangeError(MessageTemplate::kInvalidTimeValue),
                     JSArray);
   }
   return FormatMillisecondsToArray(
-      isolate, *(date_time_format->icu_simple_date_format().raw()), date_value,
+      isolate, *(date_time_format->icu_simple_date_format()->raw()), date_value,
       output_source);
 }
 
@@ -3020,7 +2948,7 @@ base::Optional<MaybeHandle<T>> PartitionDateTimeRangePattern(
   }
 
   icu::SimpleDateFormat* date_format =
-      date_time_format->icu_simple_date_format().raw();
+      date_time_format->icu_simple_date_format()->raw();
   const icu::Calendar* calendar = date_format->getCalendar();
 
   return CallICUFormatRange<T, Format>(isolate, format.get(), calendar, x, y);
@@ -3068,9 +2996,9 @@ MaybeHandle<T> FormatRangeCommonWithTemporalSupport(
   }
   // 6. Let x be ? HandleDateTimeValue(dateTimeFormat, x).
   icu::SimpleDateFormat* icu_simple_date_format =
-      date_time_format->icu_simple_date_format().raw();
-  Handle<String> date_time_format_calendar = GetCalendar(
-      isolate, *icu_simple_date_format, date_time_format->alt_calendar());
+      date_time_format->icu_simple_date_format()->raw();
+  Handle<String> date_time_format_calendar =
+      GetCalendar(isolate, *icu_simple_date_format);
   DateTimeValueRecord x_record;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, x_record,
@@ -3093,7 +3021,7 @@ MaybeHandle<T> FormatRangeCommonWithTemporalSupport(
   }
 
   const icu::Calendar* calendar =
-      date_time_format->icu_simple_date_format().raw()->getCalendar();
+      date_time_format->icu_simple_date_format()->raw()->getCalendar();
 
   base::Optional<MaybeHandle<T>> result = CallICUFormatRange<T, Format>(
       isolate, format.get(), calendar, x_record.epoch_milliseconds,
@@ -3115,17 +3043,17 @@ MaybeHandle<T> FormatRangeCommon(Isolate* isolate,
   // 4. Let x be ? ToNumber(startDate).
   ASSIGN_RETURN_ON_EXCEPTION(isolate, x_obj, Object::ToNumber(isolate, x_obj),
                              T);
-  double x = x_obj->Number();
+  double x = Object::Number(*x_obj);
   // 5. Let y be ? ToNumber(endDate).
   ASSIGN_RETURN_ON_EXCEPTION(isolate, y_obj, Object::ToNumber(isolate, y_obj),
                              T);
-  double y = y_obj->Number();
+  double y = Object::Number(*y_obj);
 
   base::Optional<MaybeHandle<T>> result =
       PartitionDateTimeRangePattern<T, Format>(isolate, date_time_format, x, y,
                                                method_name);
   if (result.has_value()) return *result;
-  return Fallback(isolate, *(date_time_format->icu_simple_date_format().raw()),
+  return Fallback(isolate, *(date_time_format->icu_simple_date_format()->raw()),
                   x);
 }
 
diff --git a/deps/v8/src/objects/js-date-time-format.h b/deps/v8/src/objects/js-date-time-format.h
index cdf87c2268a6b0..ad9be342e0eae7 100644
--- a/deps/v8/src/objects/js-date-time-format.h
+++ b/deps/v8/src/objects/js-date-time-format.h
@@ -36,10 +36,20 @@ namespace internal {
 class JSDateTimeFormat
     : public TorqueGeneratedJSDateTimeFormat<JSDateTimeFormat, JSObject> {
  public:
+  // ecma-402/#sec-todatetimeoptions
+  enum class RequiredOption { kDate, kTime, kAny };
+  enum class DefaultsOption { kDate, kTime, kAll };
+
   V8_WARN_UNUSED_RESULT static MaybeHandle<JSDateTimeFormat> New(
       Isolate* isolate, Handle<Map> map, Handle<Object> locales,
       Handle<Object> options, const char* service);
 
+  V8_WARN_UNUSED_RESULT static MaybeHandle<JSDateTimeFormat>
+  CreateDateTimeFormat(Isolate* isolate, Handle<Map> map,
+                       Handle<Object> locales, Handle<Object> options,
+                       RequiredOption required, DefaultsOption defaults,
+                       const char* service);
+
   V8_WARN_UNUSED_RESULT static MaybeHandle<JSObject> ResolvedOptions(
       Isolate* isolate, Handle<JSDateTimeFormat> date_time_format);
 
@@ -80,13 +90,6 @@ class JSDateTimeFormat
       Handle<Object> x_date_value, Handle<Object> y_date_value,
       const char* method_name);
 
-  // ecma-402/#sec-todatetimeoptions
-  enum class RequiredOption { kDate, kTime, kAny };
-  enum class DefaultsOption { kDate, kTime, kAll };
-  V8_WARN_UNUSED_RESULT static MaybeHandle<JSObject> ToDateTimeOptions(
-      Isolate* isolate, Handle<Object> input_options, RequiredOption required,
-      DefaultsOption defaults);
-
   V8_WARN_UNUSED_RESULT static MaybeHandle<String> ToLocaleDateTime(
       Isolate* isolate, Handle<Object> date, Handle<Object> locales,
       Handle<Object> options, RequiredOption required, DefaultsOption defaults,
@@ -146,11 +149,10 @@ class JSDateTimeFormat
   static_assert(DateTimeStyle::kMedium <= TimeStyleBits::kMax);
   static_assert(DateTimeStyle::kShort <= TimeStyleBits::kMax);
 
-  DECL_ACCESSORS(icu_locale, Managed<icu::Locale>)
-  DECL_ACCESSORS(icu_simple_date_format, Managed<icu::SimpleDateFormat>)
-  DECL_ACCESSORS(icu_date_interval_format, Managed<icu::DateIntervalFormat>)
-
-  DECL_BOOLEAN_ACCESSORS(alt_calendar)
+  DECL_ACCESSORS(icu_locale, Tagged<Managed<icu::Locale>>)
+  DECL_ACCESSORS(icu_simple_date_format, Tagged<Managed<icu::SimpleDateFormat>>)
+  DECL_ACCESSORS(icu_date_interval_format,
+                 Tagged<Managed<icu::DateIntervalFormat>>)
 
   DECL_PRINTER(JSDateTimeFormat)
 
diff --git a/deps/v8/src/objects/js-date-time-format.tq b/deps/v8/src/objects/js-date-time-format.tq
index ef0584e79018e3..a27e0cfa996b57 100644
--- a/deps/v8/src/objects/js-date-time-format.tq
+++ b/deps/v8/src/objects/js-date-time-format.tq
@@ -4,20 +4,13 @@
 
 #include 'src/objects/js-date-time-format.h'
 
-type DateTimeStyle extends int32 constexpr 'JSDateTimeFormat::DateTimeStyle';
+type DateTimeStyle extends int32
+    constexpr 'JSDateTimeFormat::DateTimeStyle';
 type HourCycle extends int32 constexpr 'JSDateTimeFormat::HourCycle';
 bitfield struct JSDateTimeFormatFlags extends uint31 {
   hour_cycle: HourCycle: 3 bit;
   date_style: DateTimeStyle: 3 bit;
   time_style: DateTimeStyle: 3 bit;
-  // ICU report the same type "gregorian" for both "gregorian" calendar and
-  // "iso8601" calendar and the same type "islamic" for both "islamic" and
-  // "islamic-rgsa" calendar. We use the alt_calendar bit to distinguish between
-  // them. When the type is "gregorian" and the alt_calendar bit is set, it is
-  // "iso8601", otherwise the true "gregorian" calendar. While the type is
-  // "islamic" and the alt_calendar bit is set, it is "islamic-rgsa" calendar,
-  // otherwise "islamic" calendar.
-  alt_calendar: bool: 1bit;
 }
 
 extern class JSDateTimeFormat extends JSObject {
diff --git a/deps/v8/src/objects/js-display-names-inl.h b/deps/v8/src/objects/js-display-names-inl.h
index d5c5553cf67def..edca4571a309aa 100644
--- a/deps/v8/src/objects/js-display-names-inl.h
+++ b/deps/v8/src/objects/js-display-names-inl.h
@@ -20,7 +20,7 @@ namespace internal {
 
 #include "torque-generated/src/objects/js-display-names-tq-inl.inc"
 
-ACCESSORS(JSDisplayNames, internal, Managed<DisplayNamesInternal>,
+ACCESSORS(JSDisplayNames, internal, Tagged<Managed<DisplayNamesInternal>>,
           kInternalOffset)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSDisplayNames)
 
diff --git a/deps/v8/src/objects/js-display-names.cc b/deps/v8/src/objects/js-display-names.cc
index ed2b833e39f233..af8c9662ef6a76 100644
--- a/deps/v8/src/objects/js-display-names.cc
+++ b/deps/v8/src/objects/js-display-names.cc
@@ -550,7 +550,7 @@ Handle<JSObject> JSDisplayNames::ResolvedOptions(
   // 4. Let options be ! ObjectCreate(%ObjectPrototype%).
   Handle<JSObject> options = factory->NewJSObject(isolate->object_function());
 
-  DisplayNamesInternal* internal = display_names->internal().raw();
+  DisplayNamesInternal* internal = display_names->internal()->raw();
 
   Maybe<std::string> maybe_locale = Intl::ToLanguageTag(internal->locale());
   DCHECK(maybe_locale.IsJust());
@@ -600,7 +600,7 @@ MaybeHandle<Object> JSDisplayNames::Of(Isolate* isolate,
   Handle<String> code;
   ASSIGN_RETURN_ON_EXCEPTION(isolate, code, Object::ToString(isolate, code_obj),
                              Object);
-  DisplayNamesInternal* internal = display_names->internal().raw();
+  DisplayNamesInternal* internal = display_names->internal()->raw();
   Maybe<icu::UnicodeString> maybe_result =
       internal->of(isolate, code->ToCString().get());
   MAYBE_RETURN(maybe_result, Handle<Object>());
diff --git a/deps/v8/src/objects/js-display-names.h b/deps/v8/src/objects/js-display-names.h
index f637d91292d809..6a352915c4993d 100644
--- a/deps/v8/src/objects/js-display-names.h
+++ b/deps/v8/src/objects/js-display-names.h
@@ -87,7 +87,7 @@ class JSDisplayNames
   static_assert(LanguageDisplay::kDialect <= LanguageDisplayBit::kMax);
   static_assert(LanguageDisplay::kStandard <= LanguageDisplayBit::kMax);
 
-  DECL_ACCESSORS(internal, Managed<DisplayNamesInternal>)
+  DECL_ACCESSORS(internal, Tagged<Managed<DisplayNamesInternal>>)
 
   DECL_PRINTER(JSDisplayNames)
 
diff --git a/deps/v8/src/objects/js-display-names.tq b/deps/v8/src/objects/js-display-names.tq
index d7dcf0ef3970a1..445bd0ed91cc45 100644
--- a/deps/v8/src/objects/js-display-names.tq
+++ b/deps/v8/src/objects/js-display-names.tq
@@ -6,9 +6,9 @@
 
 type JSDisplayNamesStyle extends int32 constexpr 'JSDisplayNames::Style';
 type JSDisplayNamesFallback extends int32
-constexpr 'JSDisplayNames::Fallback';
+    constexpr 'JSDisplayNames::Fallback';
 type JSDisplayNamesLanguageDisplay extends int32
-constexpr 'JSDisplayNames::LanguageDisplay';
+    constexpr 'JSDisplayNames::LanguageDisplay';
 bitfield struct JSDisplayNamesFlags extends uint31 {
   style: JSDisplayNamesStyle: 2 bit;
   fallback: JSDisplayNamesFallback: 1 bit;
diff --git a/deps/v8/src/objects/js-duration-format-inl.h b/deps/v8/src/objects/js-duration-format-inl.h
index 024e1ed7b24faa..3c9c78ff8c5461 100644
--- a/deps/v8/src/objects/js-duration-format-inl.h
+++ b/deps/v8/src/objects/js-duration-format-inl.h
@@ -22,7 +22,8 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSDurationFormat)
 
-ACCESSORS(JSDurationFormat, icu_locale, Managed<icu::Locale>, kIcuLocaleOffset)
+ACCESSORS(JSDurationFormat, icu_locale, Tagged<Managed<icu::Locale>>,
+          kIcuLocaleOffset)
 
 #define IMPL_INLINE_SETTER_GETTER(T, n, B, f, M)           \
   inline void JSDurationFormat::set_##n(T value) {         \
@@ -62,6 +63,8 @@ IMPL_INLINE_DISPLAY_SETTER_GETTER(microseconds, Microseconds)
 IMPL_INLINE_DISPLAY_SETTER_GETTER(nanoseconds, Nanoseconds)
 
 IMPL_INLINE_SETTER_GETTER(Style, style, StyleBits, style_flags, kDigital)
+IMPL_INLINE_SETTER_GETTER(Separator, separator, SeparatorBits, style_flags,
+                          kMax)
 
 IMPL_INLINE_FIELD_STYLE3_SETTER_GETTER(years, Years)
 IMPL_INLINE_FIELD_STYLE3_SETTER_GETTER(months, Months)
@@ -94,7 +97,7 @@ inline int32_t JSDurationFormat::fractional_digits() const {
 }
 
 ACCESSORS(JSDurationFormat, icu_number_formatter,
-          Managed<icu::number::LocalizedNumberFormatter>,
+          Tagged<Managed<icu::number::LocalizedNumberFormatter>>,
           kIcuNumberFormatterOffset)
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/js-duration-format.cc b/deps/v8/src/objects/js-duration-format.cc
index 4b15db7fe3488d..b07868a3bc420d 100644
--- a/deps/v8/src/objects/js-duration-format.cc
+++ b/deps/v8/src/objects/js-duration-format.cc
@@ -22,6 +22,7 @@
 #include "src/objects/managed-inl.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/option-utils.h"
+#include "unicode/dtfmtsym.h"
 #include "unicode/listformatter.h"
 #include "unicode/locid.h"
 #include "unicode/numberformatter.h"
@@ -173,6 +174,26 @@ Maybe<DurationUnitOptions> GetDurationUnitOptions(
   return Just(DurationUnitOptions({style, display}));
 }
 
+JSDurationFormat::Separator GetSeparator(const icu::Locale& l) {
+  UErrorCode status = U_ZERO_ERROR;
+  icu::DateFormatSymbols sym(l, status);
+  if (U_FAILURE(status)) return JSDurationFormat::Separator::kColon;
+  icu::UnicodeString sep;
+  sym.getTimeSeparatorString(sep);
+  if (sep.length() != 1) return JSDurationFormat::Separator::kColon;
+  switch (sep.charAt(0)) {
+    case u'.':
+      return JSDurationFormat::Separator::kFullStop;
+    case u'\uFF1A':
+      return JSDurationFormat::Separator::kFullwidthColon;
+    case u'\u066B':
+      return JSDurationFormat::Separator::kArabicDecimalSeparator;
+    // By default, or if we get anything else, just use ':'.
+    default:
+      return JSDurationFormat::Separator::kColon;
+  }
+}
+
 }  // namespace
 MaybeHandle<JSDurationFormat> JSDurationFormat::New(
     Isolate* isolate, Handle<Map> map, Handle<Object> locales,
@@ -250,6 +271,7 @@ MaybeHandle<JSDurationFormat> JSDurationFormat::New(
     DCHECK(U_SUCCESS(status));
   }
   std::string numbering_system = Intl::GetNumberingSystem(r_locale);
+  Separator separator = GetSeparator(r_locale);
 
   // 13. Let style be ? GetOption(options, "style", "string", « "long", "short",
   // "narrow", "digital" », "long").
@@ -362,6 +384,7 @@ MaybeHandle<JSDurationFormat> JSDurationFormat::New(
   duration_format->set_milliseconds_style(milliseconds_option.style);
   duration_format->set_microseconds_style(microseconds_option.style);
   duration_format->set_nanoseconds_style(nanoseconds_option.style);
+  duration_format->set_separator(separator);
 
   duration_format->set_years_display(years_option.display);
   duration_format->set_months_display(months_option.display);
@@ -433,10 +456,10 @@ Handle<JSObject> JSDurationFormat::ResolvedOptions(
   Handle<JSObject> options = factory->NewJSObject(isolate->object_function());
 
   Handle<String> locale = factory->NewStringFromAsciiChecked(
-      Intl::ToLanguageTag(*format->icu_locale().raw()).FromJust().c_str());
+      Intl::ToLanguageTag(*format->icu_locale()->raw()).FromJust().c_str());
   UErrorCode status = U_ZERO_ERROR;
   icu::UnicodeString skeleton =
-      format->icu_number_formatter().raw()->toSkeleton(status);
+      format->icu_number_formatter()->raw()->toSkeleton(status);
   DCHECK(U_SUCCESS(status));
 
   Handle<String> numbering_system;
@@ -504,82 +527,130 @@ UNumberUnitWidth ToUNumberUnitWidth(JSDurationFormat::FieldStyle style) {
   }
 }
 
-void Output(std::vector<icu::UnicodeString>* out, double value,
-            const icu::number::LocalizedNumberFormatter& fmt) {
+struct Part {
+  enum Type { kFormatted, kSeparator };
+  Type part_type;
+  std::string type;
+  icu::number::FormattedNumber formatted;
+};
+
+char16_t SeparatorToChar(JSDurationFormat::Separator separator) {
+  switch (separator) {
+    case JSDurationFormat::Separator::kColon:
+      return u':';
+    case JSDurationFormat::Separator::kFullStop:
+      return u'.';
+    case JSDurationFormat::Separator::kFullwidthColon:
+      return u'\uFF1A';
+    case JSDurationFormat::Separator::kArabicDecimalSeparator:
+      return u'\u066B';
+  }
+}
+
+void Output(const char* type, double value,
+            const icu::number::LocalizedNumberFormatter& fmt, bool addToLast,
+            JSDurationFormat::Separator separator,
+            std::vector<std::vector<Part>>* parts,
+            std::vector<icu::UnicodeString>* strings) {
   UErrorCode status = U_ZERO_ERROR;
-  out->push_back(fmt.formatDouble(value, status).toString(status));
+  icu::number::FormattedNumber formatted = fmt.formatDouble(value, status);
+  icu::UnicodeString unit_string = formatted.toString(status);
   CHECK(U_SUCCESS(status));
+  Part p = {Part::Type::kFormatted, std::string(type), std::move(formatted)};
+  if (addToLast && !strings->empty()) {
+    strings->back().append(SeparatorToChar(separator));
+    strings->back() += unit_string;
+
+    if (parts != nullptr) {
+      icu::number::FormattedNumber dummy;
+      Part s = {Part::Type::kSeparator, std::string(), std::move(dummy)};
+      parts->back().push_back(std::move(s));
+      parts->back().push_back(std::move(p));
+    }
+    return;
+  }
+  strings->push_back(unit_string);
+  if (parts != nullptr) {
+    std::vector<Part> v;
+    v.push_back(std::move(p));
+    parts->push_back(std::move(v));
+  }
 }
 
-void Output3Styles(std::vector<icu::UnicodeString>* out,
-                   std::vector<std::string>* types, const char* type,
-                   double value, JSDurationFormat::Display display,
-                   const icu::number::LocalizedNumberFormatter& fmt) {
+void Output3Styles(const char* type, double value,
+                   JSDurationFormat::Display display,
+                   const icu::number::LocalizedNumberFormatter& fmt,
+                   bool addToLast, JSDurationFormat::Separator separator,
+                   std::vector<std::vector<Part>>* parts,
+                   std::vector<icu::UnicodeString>* strings) {
   if (value == 0 && display == JSDurationFormat::Display::kAuto) return;
-  types->push_back(type);
-  Output(out, value, fmt);
+  Output(type, value, fmt, addToLast, separator, parts, strings);
 }
 
-void Output4Styles(std::vector<icu::UnicodeString>* out,
-                   std::vector<std::string>* types, const char* type,
-                   double value, JSDurationFormat::Display display,
+void Output4Styles(const char* type, double value,
+                   JSDurationFormat::Display display,
                    JSDurationFormat::FieldStyle style,
                    const icu::number::LocalizedNumberFormatter& fmt,
-                   icu::MeasureUnit unit) {
+                   icu::MeasureUnit unit, bool addToLast,
+                   JSDurationFormat::Separator separator,
+                   std::vector<std::vector<Part>>* parts,
+                   std::vector<icu::UnicodeString>* strings) {
   if (value == 0 && display == JSDurationFormat::Display::kAuto) return;
   if (style == JSDurationFormat::FieldStyle::kNumeric) {
-    types->push_back(type);
-    return Output(out, value, fmt);
+    return Output(type, value, fmt, addToLast, separator, parts, strings);
   }
-  Output3Styles(out, types, type, value, display,
-                fmt.unit(unit).unitWidth(ToUNumberUnitWidth(style)));
+  Output3Styles(type, value, display,
+                fmt.unit(unit).unitWidth(ToUNumberUnitWidth(style)), addToLast,
+                separator, parts, strings);
 }
-void Output5Styles(std::vector<icu::UnicodeString>* out,
-                   std::vector<std::string>* types, const char* type,
-                   double value, JSDurationFormat::Display display,
+void Output5Styles(const char* type, double value,
+                   JSDurationFormat::Display display,
                    JSDurationFormat::FieldStyle style,
                    const icu::number::LocalizedNumberFormatter& fmt,
-                   icu::MeasureUnit unit) {
+                   icu::MeasureUnit unit, bool maybeAddToLast,
+                   JSDurationFormat::Separator separator,
+                   std::vector<std::vector<Part>>* parts,
+                   std::vector<icu::UnicodeString>* strings) {
   if (value == 0 && display == JSDurationFormat::Display::kAuto) return;
   if (style == JSDurationFormat::FieldStyle::k2Digit) {
-    types->push_back(type);
-    return Output(out, value,
-                  fmt.integerWidth(icu::number::IntegerWidth::zeroFillTo(2)));
+    return Output(type, value,
+                  fmt.integerWidth(icu::number::IntegerWidth::zeroFillTo(2)),
+                  maybeAddToLast, separator, parts, strings);
   }
-  Output4Styles(out, types, type, value, display, style, fmt, unit);
+  Output4Styles(
+      type, value, display, style, fmt, unit,
+      (maybeAddToLast && JSDurationFormat::FieldStyle::kNumeric == style),
+      separator, parts, strings);
 }
 
-void DurationRecordToListOfStrings(
-    std::vector<icu::UnicodeString>* out, std::vector<std::string>* types,
+void DurationRecordToListOfFormattedNumber(
     Handle<JSDurationFormat> df,
     const icu::number::LocalizedNumberFormatter& fmt,
-    const DurationRecord& record) {
-  // The handling of "2-digit" or "numeric" style of
-  // step l.i.6.c.i-ii "Let separator be
-  // dataLocaleData.[[digitalFormat]].[[separator]]." and
-  // "Append the new Record { [[Type]]: "literal", [[Value]]: separator} to the
-  // end of result." are not implemented following the spec due to unresolved
-  // issues in
-  // https://github.com/tc39/proposal-intl-duration-format/issues/55
-  Output3Styles(out, types, "years", record.years, df->years_display(),
+    const DurationRecord& record, std::vector<std::vector<Part>>* parts,
+    std::vector<icu::UnicodeString>* strings) {
+  JSDurationFormat::Separator separator = df->separator();
+  Output3Styles("year", record.years, df->years_display(),
                 fmt.unit(icu::MeasureUnit::getYear())
-                    .unitWidth(ToUNumberUnitWidth(df->years_style())));
-  Output3Styles(out, types, "months", record.months, df->months_display(),
+                    .unitWidth(ToUNumberUnitWidth(df->years_style())),
+                false, separator, parts, strings);
+  Output3Styles("month", record.months, df->months_display(),
                 fmt.unit(icu::MeasureUnit::getMonth())
-                    .unitWidth(ToUNumberUnitWidth(df->months_style())));
-  Output3Styles(out, types, "weeks", record.weeks, df->weeks_display(),
+                    .unitWidth(ToUNumberUnitWidth(df->months_style())),
+                false, separator, parts, strings);
+  Output3Styles("week", record.weeks, df->weeks_display(),
                 fmt.unit(icu::MeasureUnit::getWeek())
-                    .unitWidth(ToUNumberUnitWidth(df->weeks_style())));
-  Output3Styles(out, types, "days", record.time_duration.days,
-                df->days_display(),
+                    .unitWidth(ToUNumberUnitWidth(df->weeks_style())),
+                false, separator, parts, strings);
+  Output3Styles("day", record.time_duration.days, df->days_display(),
                 fmt.unit(icu::MeasureUnit::getDay())
-                    .unitWidth(ToUNumberUnitWidth(df->days_style())));
-  Output5Styles(out, types, "hours", record.time_duration.hours,
-                df->hours_display(), df->hours_style(), fmt,
-                icu::MeasureUnit::getHour());
-  Output5Styles(out, types, "minutes", record.time_duration.minutes,
-                df->minutes_display(), df->minutes_style(), fmt,
-                icu::MeasureUnit::getMinute());
+                    .unitWidth(ToUNumberUnitWidth(df->days_style())),
+                false, separator, parts, strings);
+  Output5Styles("hour", record.time_duration.hours, df->hours_display(),
+                df->hours_style(), fmt, icu::MeasureUnit::getHour(), false,
+                separator, parts, strings);
+  Output5Styles("minute", record.time_duration.minutes, df->minutes_display(),
+                df->minutes_style(), fmt, icu::MeasureUnit::getMinute(), true,
+                separator, parts, strings);
   int32_t fractional_digits = df->fractional_digits();
   if (df->milliseconds_style() == JSDurationFormat::FieldStyle::kNumeric) {
     // a. Set value to value + duration.[[Milliseconds]] / 10^3 +
@@ -588,16 +659,16 @@ void DurationRecordToListOfStrings(
                    record.time_duration.milliseconds / 1e3 +
                    record.time_duration.microseconds / 1e6 +
                    record.time_duration.nanoseconds / 1e9;
-    Output5Styles(out, types, "seconds", value, df->seconds_display(),
-                  df->seconds_style(),
+    Output5Styles("second", value, df->seconds_display(), df->seconds_style(),
                   fmt.precision(icu::number::Precision::minMaxFraction(
                       fractional_digits, fractional_digits)),
-                  icu::MeasureUnit::getSecond());
+                  icu::MeasureUnit::getSecond(), true, separator, parts,
+                  strings);
     return;
   }
-  Output5Styles(out, types, "seconds", record.time_duration.seconds,
-                df->seconds_display(), df->seconds_style(), fmt,
-                icu::MeasureUnit::getSecond());
+  Output5Styles("second", record.time_duration.seconds, df->seconds_display(),
+                df->seconds_style(), fmt, icu::MeasureUnit::getSecond(), true,
+                separator, parts, strings);
 
   if (df->microseconds_style() == JSDurationFormat::FieldStyle::kNumeric) {
     // a. Set value to value + duration.[[Microseconds]] / 10^3 +
@@ -605,53 +676,62 @@ void DurationRecordToListOfStrings(
     double value = record.time_duration.milliseconds +
                    record.time_duration.microseconds / 1e3 +
                    record.time_duration.nanoseconds / 1e6;
-    Output4Styles(out, types, "milliseconds", value, df->milliseconds_display(),
+    Output4Styles("millisecond", value, df->milliseconds_display(),
                   df->milliseconds_style(),
                   fmt.precision(icu::number::Precision::minMaxFraction(
                       fractional_digits, fractional_digits)),
-                  icu::MeasureUnit::getMillisecond());
+                  icu::MeasureUnit::getMillisecond(), false, separator, parts,
+                  strings);
     return;
   }
-  Output4Styles(out, types, "milliseconds", record.time_duration.milliseconds,
+  Output4Styles("millisecond", record.time_duration.milliseconds,
                 df->milliseconds_display(), df->milliseconds_style(), fmt,
-                icu::MeasureUnit::getMillisecond());
+                icu::MeasureUnit::getMillisecond(), false, separator, parts,
+                strings);
 
   if (df->nanoseconds_style() == JSDurationFormat::FieldStyle::kNumeric) {
     // a. Set value to value + duration.[[Nanoseconds]] / 10^3.
     double value = record.time_duration.microseconds +
                    record.time_duration.nanoseconds / 1e3;
-    Output4Styles(out, types, "microseconds", value, df->microseconds_display(),
+    Output4Styles("microsecond", value, df->microseconds_display(),
                   df->microseconds_style(),
                   fmt.precision(icu::number::Precision::minMaxFraction(
                       fractional_digits, fractional_digits)),
-                  icu::MeasureUnit::getMicrosecond());
+                  icu::MeasureUnit::getMicrosecond(), false, separator, parts,
+                  strings);
     return;
   }
-  Output4Styles(out, types, "microseconds", record.time_duration.microseconds,
+  Output4Styles("microsecond", record.time_duration.microseconds,
                 df->microseconds_display(), df->microseconds_style(), fmt,
-                icu::MeasureUnit::getMicrosecond());
+                icu::MeasureUnit::getMicrosecond(), false, separator, parts,
+                strings);
 
-  Output4Styles(out, types, "nanoseconds", record.time_duration.nanoseconds,
+  Output4Styles("nanosecond", record.time_duration.nanoseconds,
                 df->nanoseconds_display(), df->nanoseconds_style(), fmt,
-                icu::MeasureUnit::getNanosecond());
+                icu::MeasureUnit::getNanosecond(), false, separator, parts,
+                strings);
 }
 
 UListFormatterWidth StyleToWidth(JSDurationFormat::Style style) {
   switch (style) {
     case JSDurationFormat::Style::kLong:
       return ULISTFMT_WIDTH_WIDE;
-    case JSDurationFormat::Style::kShort:
-      return ULISTFMT_WIDTH_SHORT;
     case JSDurationFormat::Style::kNarrow:
-    case JSDurationFormat::Style::kDigital:
       return ULISTFMT_WIDTH_NARROW;
+    case JSDurationFormat::Style::kShort:
+    case JSDurationFormat::Style::kDigital:
+      return ULISTFMT_WIDTH_SHORT;
   }
   UNREACHABLE();
 }
 
-template <typename T,
+// The last two arguments passed to the  Format function is only needed
+// for Format function to output detail structure and not needed if the
+// Format only needs to output a String.
+template <typename T, bool Details,
           MaybeHandle<T> (*Format)(Isolate*, const icu::FormattedValue&,
-                                   const std::vector<std::string>&)>
+                                   const std::vector<std::vector<Part>>*,
+                                   JSDurationFormat::Separator separator)>
 MaybeHandle<T> PartitionDurationFormatPattern(Isolate* isolate,
                                               Handle<JSDurationFormat> df,
                                               const DurationRecord& record,
@@ -667,21 +747,22 @@ MaybeHandle<T> PartitionDurationFormatPattern(Isolate* isolate,
   // 9. Let lf be ! Construct(%ListFormat%, « durationFormat.[[Locale]], lfOpts
   // »).
   UErrorCode status = U_ZERO_ERROR;
-  icu::Locale icu_locale = *df->icu_locale().raw();
+  icu::Locale icu_locale = *df->icu_locale()->raw();
   std::unique_ptr<icu::ListFormatter> formatter(
       icu::ListFormatter::createInstance(icu_locale, type, list_style, status));
   CHECK(U_SUCCESS(status));
 
-  std::vector<icu::UnicodeString> list;
-  std::vector<std::string> types;
+  std::vector<std::vector<Part>> list;
+  std::vector<std::vector<Part>>* parts = Details ? &list : nullptr;
+  std::vector<icu::UnicodeString> string_list;
 
-  DurationRecordToListOfStrings(&list, &types, df,
-                                *(df->icu_number_formatter().raw()), record);
+  DurationRecordToListOfFormattedNumber(
+      df, *(df->icu_number_formatter()->raw()), record, parts, &string_list);
 
   icu::FormattedList formatted = formatter->formatStringsToValue(
-      list.data(), static_cast<int32_t>(list.size()), status);
+      string_list.data(), static_cast<int32_t>(string_list.size()), status);
   CHECK(U_SUCCESS(status));
-  return Format(isolate, formatted, types);
+  return Format(isolate, formatted, parts, df->separator());
 }
 
 // #sec-todurationrecord
@@ -692,7 +773,7 @@ MaybeHandle<T> PartitionDurationFormatPattern(Isolate* isolate,
 Maybe<DurationRecord> ToDurationRecord(Isolate* isolate, Handle<Object> input,
                                        const DurationRecord& default_value) {
   // 1-a. If Type(input) is String, throw a RangeError exception.
-  if (input->IsString()) {
+  if (IsString(*input)) {
     THROW_NEW_ERROR_RETURN_VALUE(
         isolate,
         NewRangeError(MessageTemplate::kInvalid,
@@ -717,9 +798,10 @@ Maybe<DurationRecord> ToDurationRecord(Isolate* isolate, Handle<Object> input,
   return Just(record);
 }
 
-template <typename T,
+template <typename T, bool Details,
           MaybeHandle<T> (*Format)(Isolate*, const icu::FormattedValue&,
-                                   const std::vector<std::string>&)>
+                                   const std::vector<std::vector<Part>>*,
+                                   JSDurationFormat::Separator)>
 MaybeHandle<T> FormatCommon(Isolate* isolate, Handle<JSDurationFormat> df,
                             Handle<Object> duration, const char* method_name) {
   // 1. Let df be this value.
@@ -731,42 +813,63 @@ MaybeHandle<T> FormatCommon(Isolate* isolate, Handle<JSDurationFormat> df,
       ToDurationRecord(isolate, duration, {0, 0, 0, {0, 0, 0, 0, 0, 0, 0}}),
       Handle<T>());
   // 5. Let parts be ! PartitionDurationFormatPattern(df, record).
-  return PartitionDurationFormatPattern<T, Format>(isolate, df, record,
-                                                   method_name);
+  return PartitionDurationFormatPattern<T, Details, Format>(isolate, df, record,
+                                                            method_name);
 }
 
 }  // namespace
 
-MaybeHandle<String> FormattedToString(Isolate* isolate,
-                                      const icu::FormattedValue& formatted,
-                                      const std::vector<std::string>&) {
+MaybeHandle<String> FormattedToString(
+    Isolate* isolate, const icu::FormattedValue& formatted,
+    const std::vector<std::vector<Part>>* parts, JSDurationFormat::Separator) {
+  DCHECK_NULL(parts);
   return Intl::FormattedToString(isolate, formatted);
 }
 
 MaybeHandle<JSArray> FormattedListToJSArray(
     Isolate* isolate, const icu::FormattedValue& formatted,
-    const std::vector<std::string>& types) {
+    const std::vector<std::vector<Part>>* parts,
+    JSDurationFormat::Separator separator) {
+  DCHECK_NOT_NULL(parts);
   Factory* factory = isolate->factory();
   Handle<JSArray> array = factory->NewJSArray(0);
   icu::ConstrainedFieldPosition cfpos;
   cfpos.constrainCategory(UFIELD_CATEGORY_LIST);
   int index = 0;
-  int type_index = 0;
+  int part_index = 0;
   UErrorCode status = U_ZERO_ERROR;
   icu::UnicodeString string = formatted.toString(status);
-  Handle<String> substring;
   while (formatted.nextPosition(cfpos, status) && U_SUCCESS(status)) {
-    ASSIGN_RETURN_ON_EXCEPTION(
-        isolate, substring,
-        Intl::ToString(isolate, string, cfpos.getStart(), cfpos.getLimit()),
-        JSArray);
-    Handle<String> type_string = factory->literal_string();
     if (cfpos.getField() == ULISTFMT_ELEMENT_FIELD) {
-      type_string =
-          factory->NewStringFromAsciiChecked(types[type_index].c_str());
-      type_index++;
+      for (auto& it : parts->at(part_index++)) {
+        switch (it.part_type) {
+          case Part::Type::kSeparator: {
+            icu::UnicodeString sep(SeparatorToChar(separator));
+            Handle<String> separator_string;
+            ASSIGN_RETURN_ON_EXCEPTION(isolate, separator_string,
+                                       Intl::ToString(isolate, sep), JSArray);
+            Intl::AddElement(isolate, array, index++, factory->literal_string(),
+                             separator_string);
+          } break;
+          case Part::Type::kFormatted:
+            Handle<String> type_string =
+                factory->NewStringFromAsciiChecked(it.type.c_str());
+            Maybe<int> index_after_add = Intl::AddNumberElements(
+                isolate, it.formatted, array, index, type_string);
+            MAYBE_RETURN(index_after_add, MaybeHandle<JSArray>());
+            index = index_after_add.FromJust();
+            break;
+        }
+      }
+    } else {
+      Handle<String> substring;
+      ASSIGN_RETURN_ON_EXCEPTION(
+          isolate, substring,
+          Intl::ToString(isolate, string, cfpos.getStart(), cfpos.getLimit()),
+          JSArray);
+      Intl::AddElement(isolate, array, index++, factory->literal_string(),
+                       substring);
     }
-    Intl::AddElement(isolate, array, index++, type_string, substring);
   }
   if (U_FAILURE(status)) {
     THROW_NEW_ERROR(isolate, NewTypeError(MessageTemplate::kIcuError), JSArray);
@@ -779,15 +882,15 @@ MaybeHandle<String> JSDurationFormat::Format(Isolate* isolate,
                                              Handle<JSDurationFormat> df,
                                              Handle<Object> duration) {
   const char* method_name = "Intl.DurationFormat.prototype.format";
-  return FormatCommon<String, FormattedToString>(isolate, df, duration,
-                                                 method_name);
+  return FormatCommon<String, false, FormattedToString>(isolate, df, duration,
+                                                        method_name);
 }
 
 MaybeHandle<JSArray> JSDurationFormat::FormatToParts(
     Isolate* isolate, Handle<JSDurationFormat> df, Handle<Object> duration) {
   const char* method_name = "Intl.DurationFormat.prototype.formatToParts";
-  return FormatCommon<JSArray, FormattedListToJSArray>(isolate, df, duration,
-                                                       method_name);
+  return FormatCommon<JSArray, true, FormattedListToJSArray>(
+      isolate, df, duration, method_name);
 }
 
 const std::set<std::string>& JSDurationFormat::GetAvailableLocales() {
diff --git a/deps/v8/src/objects/js-duration-format.h b/deps/v8/src/objects/js-duration-format.h
index b91ee47e157bc2..df13e767f9ba0c 100644
--- a/deps/v8/src/objects/js-duration-format.h
+++ b/deps/v8/src/objects/js-duration-format.h
@@ -65,6 +65,18 @@ class JSDurationFormat
     kMax = kDigital
   };
 
+  // To optimize per object memory usage, we use 2 bits
+  // to store one of the four possible time separators encoded in
+  // icu/source/data/locales/$locale/NumberElements/$numberingSystem/timeSeparator
+  enum class Separator {
+    kColon,                   // U+003A
+    kFullStop,                // U+002E
+    kFullwidthColon,          // U+FF1A
+    kArabicDecimalSeparator,  // U+066B
+
+    kMax = kArabicDecimalSeparator
+  };
+
   // The ordering of these values is significant, because sub-ranges are
   // encoded using bitfields.
   enum class FieldStyle {
@@ -81,7 +93,7 @@ class JSDurationFormat
   };
 
 #define DECLARE_INLINE_SETTER_GETTER(T, n) \
-  inline void set_##n(T display);          \
+  inline void set_##n(T);                  \
   inline T n() const;
 
 #define DECLARE_INLINE_DISPLAY_SETTER_GETTER(f) \
@@ -102,6 +114,7 @@ class JSDurationFormat
   DECLARE_INLINE_DISPLAY_SETTER_GETTER(nanoseconds)
 
   DECLARE_INLINE_SETTER_GETTER(Style, style)
+  DECLARE_INLINE_SETTER_GETTER(Separator, separator)
 
   DECLARE_INLINE_FIELD_STYLE_SETTER_GETTER(years)
   DECLARE_INLINE_FIELD_STYLE_SETTER_GETTER(months)
@@ -149,9 +162,9 @@ class JSDurationFormat
   static_assert(MicrosecondsStyleBits::is_valid(FieldStyle::kStyle4Max));
   static_assert(NanosecondsStyleBits::is_valid(FieldStyle::kStyle4Max));
 
-  DECL_ACCESSORS(icu_locale, Managed<icu::Locale>)
+  DECL_ACCESSORS(icu_locale, Tagged<Managed<icu::Locale>>)
   DECL_ACCESSORS(icu_number_formatter,
-                 Managed<icu::number::LocalizedNumberFormatter>)
+                 Tagged<Managed<icu::number::LocalizedNumberFormatter>>)
 
   DECL_PRINTER(JSDurationFormat)
 
diff --git a/deps/v8/src/objects/js-duration-format.tq b/deps/v8/src/objects/js-duration-format.tq
index 55fe354105e3cd..c7c71db0b3fa98 100644
--- a/deps/v8/src/objects/js-duration-format.tq
+++ b/deps/v8/src/objects/js-duration-format.tq
@@ -4,11 +4,14 @@
 
 #include 'src/objects/js-duration-format.h'
 
-type JSDurationFormatStyle extends int32 constexpr 'JSDurationFormat::Style';
+type JSDurationFormatStyle extends int32
+    constexpr 'JSDurationFormat::Style';
+type JSDurationFormatSeparator extends int32
+    constexpr 'JSDurationFormat::Separator';
 type JSDurationFormatFieldStyle extends int32
-constexpr 'JSDurationFormat::FieldStyle';
+    constexpr 'JSDurationFormat::FieldStyle';
 type JSDurationFormatDisplay extends int32
-constexpr 'JSDurationFormat::Display';
+    constexpr 'JSDurationFormat::Display';
 bitfield struct JSDurationFormatStyleFlags extends uint31 {
   style: JSDurationFormatStyle: 2 bit;
   years_style: JSDurationFormatFieldStyle: 2 bit;
@@ -21,6 +24,7 @@ bitfield struct JSDurationFormatStyleFlags extends uint31 {
   milliseconds_style: JSDurationFormatFieldStyle: 2 bit;
   microseconds_style: JSDurationFormatFieldStyle: 2 bit;
   nanoseconds_style: JSDurationFormatFieldStyle: 2 bit;
+  separator: JSDurationFormatSeparator: 2 bit;
 }
 bitfield struct JSDurationFormatDisplayFlags extends uint31 {
   years_display: JSDurationFormatDisplay: 1 bit;
diff --git a/deps/v8/src/objects/js-function-inl.h b/deps/v8/src/objects/js-function-inl.h
index 152c00d1b176ff..1d7967297252ed 100644
--- a/deps/v8/src/objects/js-function-inl.h
+++ b/deps/v8/src/objects/js-function-inl.h
@@ -13,7 +13,9 @@
 #include "src/diagnostics/code-tracer.h"
 #include "src/ic/ic.h"
 #include "src/init/bootstrapper.h"
+#include "src/objects/abstract-code-inl.h"
 #include "src/objects/feedback-cell-inl.h"
+#include "src/objects/instance-type-inl.h"
 #include "src/objects/map-updater.h"
 #include "src/objects/shared-function-info-inl.h"
 
@@ -30,71 +32,117 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(JSBoundFunction)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSWrappedFunction)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSFunction)
 
-ACCESSORS(JSFunction, raw_feedback_cell, FeedbackCell, kFeedbackCellOffset)
-RELEASE_ACQUIRE_ACCESSORS(JSFunction, raw_feedback_cell, FeedbackCell,
+ACCESSORS(JSFunction, raw_feedback_cell, Tagged<FeedbackCell>,
+          kFeedbackCellOffset)
+RELEASE_ACQUIRE_ACCESSORS(JSFunction, raw_feedback_cell, Tagged<FeedbackCell>,
                           kFeedbackCellOffset)
 
-DEF_GETTER(JSFunction, feedback_vector, FeedbackVector) {
+DEF_GETTER(JSFunction, feedback_vector, Tagged<FeedbackVector>) {
   DCHECK(has_feedback_vector(cage_base));
-  return FeedbackVector::cast(raw_feedback_cell(cage_base).value(cage_base));
+  return FeedbackVector::cast(raw_feedback_cell(cage_base)->value(cage_base));
 }
 
-ClosureFeedbackCellArray JSFunction::closure_feedback_cell_array() const {
+Tagged<ClosureFeedbackCellArray> JSFunction::closure_feedback_cell_array()
+    const {
   DCHECK(has_closure_feedback_cell_array());
-  return ClosureFeedbackCellArray::cast(raw_feedback_cell().value());
+  return ClosureFeedbackCellArray::cast(raw_feedback_cell()->value());
 }
 
 void JSFunction::reset_tiering_state() {
   DCHECK(has_feedback_vector());
-  feedback_vector().reset_tiering_state();
+  feedback_vector()->reset_tiering_state();
 }
 
-bool JSFunction::ChecksTieringState() { return code().checks_tiering_state(); }
+bool JSFunction::ChecksTieringState() { return code()->checks_tiering_state(); }
 
 void JSFunction::CompleteInobjectSlackTrackingIfActive() {
   if (!has_prototype_slot()) return;
-  if (has_initial_map() && initial_map().IsInobjectSlackTrackingInProgress()) {
+  if (has_initial_map() && initial_map()->IsInobjectSlackTrackingInProgress()) {
     MapUpdater::CompleteInobjectSlackTracking(GetIsolate(), initial_map());
   }
 }
 
 template <typename IsolateT>
-AbstractCode JSFunction::abstract_code(IsolateT* isolate) {
+Tagged<AbstractCode> JSFunction::abstract_code(IsolateT* isolate) {
   if (ActiveTierIsIgnition()) {
-    return AbstractCode::cast(shared().GetBytecodeArray(isolate));
+    return AbstractCode::cast(shared()->GetBytecodeArray(isolate));
   } else {
     return AbstractCode::cast(code(kAcquireLoad));
   }
 }
 
-int JSFunction::length() { return shared().length(); }
+int JSFunction::length() { return shared()->length(); }
 
-ACCESSORS_RELAXED(JSFunction, code, Code, kCodeOffset)
-RELEASE_ACQUIRE_GETTER_CHECKED(JSFunction, code, Code, kCodeOffset, true)
-void JSFunction::set_code(Code value, ReleaseStoreTag, WriteBarrierMode mode) {
+Tagged<Code> JSFunction::code() const {
+  PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
+  return JSFunction::code(cage_base);
+}
+Tagged<Code> JSFunction::code(PtrComprCageBase cage_base) const {
+  return Code::cast(raw_code());
+}
+
+void JSFunction::set_code(Tagged<Code> value, WriteBarrierMode mode) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  RawIndirectPointerField(kCodeOffset).Relaxed_Store(value);
+  CONDITIONAL_INDIRECT_POINTER_WRITE_BARRIER(*this, kCodeOffset, value, mode);
+#else
+  TaggedField<Code, kCodeOffset>::Relaxed_Store(*this, value);
+  CONDITIONAL_WRITE_BARRIER(*this, kCodeOffset, value, mode);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+Tagged<Code> JSFunction::code(AcquireLoadTag tag) const {
+  return Code::cast(raw_code(tag));
+}
+
+void JSFunction::set_code(Tagged<Code> value, ReleaseStoreTag,
+                          WriteBarrierMode mode) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  RawIndirectPointerField(kCodeOffset).Release_Store(value);
+  CONDITIONAL_INDIRECT_POINTER_WRITE_BARRIER(*this, kCodeOffset, value, mode);
+#else
   TaggedField<Code, kCodeOffset>::Release_Store(*this, value);
   CONDITIONAL_WRITE_BARRIER(*this, kCodeOffset, value, mode);
+#endif  // V8_CODE_POINTER_SANDBOXING
   if (V8_UNLIKELY(v8_flags.log_function_events && has_feedback_vector())) {
-    feedback_vector().set_log_next_execution(true);
+    feedback_vector()->set_log_next_execution(true);
   }
 }
-RELEASE_ACQUIRE_ACCESSORS(JSFunction, context, Context, kContextOffset)
 
-Address JSFunction::code_entry_point() const {
-  return Code::cast(code()).code_entry_point();
+Tagged<Object> JSFunction::raw_code() const {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  return RawIndirectPointerField(kCodeOffset).Relaxed_Load();
+#else
+  return RELAXED_READ_FIELD(*this, JSFunction::kCodeOffset);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+Tagged<Object> JSFunction::raw_code(AcquireLoadTag tag) const {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  return RawIndirectPointerField(kCodeOffset).Acquire_Load();
+#else
+  return ACQUIRE_READ_FIELD(*this, JSFunction::kCodeOffset);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+RELEASE_ACQUIRE_ACCESSORS(JSFunction, context, Tagged<Context>, kContextOffset)
+
+Address JSFunction::instruction_start() const {
+  return Code::cast(code())->instruction_start();
 }
 
 // TODO(ishell): Why relaxed read but release store?
-DEF_GETTER(JSFunction, shared, SharedFunctionInfo) {
+DEF_GETTER(JSFunction, shared, Tagged<SharedFunctionInfo>) {
   return shared(cage_base, kRelaxedLoad);
 }
 
-DEF_RELAXED_GETTER(JSFunction, shared, SharedFunctionInfo) {
+DEF_RELAXED_GETTER(JSFunction, shared, Tagged<SharedFunctionInfo>) {
   return TaggedField<SharedFunctionInfo,
                      kSharedFunctionInfoOffset>::Relaxed_Load(cage_base, *this);
 }
 
-void JSFunction::set_shared(SharedFunctionInfo value, WriteBarrierMode mode) {
+void JSFunction::set_shared(Tagged<SharedFunctionInfo> value,
+                            WriteBarrierMode mode) {
   // Release semantics to support acquire read in NeedsResetDueToFlushedBytecode
   RELEASE_WRITE_FIELD(*this, kSharedFunctionInfoOffset, value);
   CONDITIONAL_WRITE_BARRIER(*this, kSharedFunctionInfoOffset, value, mode);
@@ -102,173 +150,150 @@ void JSFunction::set_shared(SharedFunctionInfo value, WriteBarrierMode mode) {
 
 TieringState JSFunction::tiering_state() const {
   if (!has_feedback_vector()) return TieringState::kNone;
-  return feedback_vector().tiering_state();
+  return feedback_vector()->tiering_state();
 }
 
 void JSFunction::set_tiering_state(TieringState state) {
   DCHECK(has_feedback_vector());
   DCHECK(IsNone(state) || ChecksTieringState());
-  feedback_vector().set_tiering_state(state);
+  feedback_vector()->set_tiering_state(state);
 }
 
 TieringState JSFunction::osr_tiering_state() {
   DCHECK(has_feedback_vector());
-  return feedback_vector().osr_tiering_state();
+  return feedback_vector()->osr_tiering_state();
 }
 
 void JSFunction::set_osr_tiering_state(TieringState marker) {
   DCHECK(has_feedback_vector());
-  feedback_vector().set_osr_tiering_state(marker);
+  feedback_vector()->set_osr_tiering_state(marker);
 }
 
 DEF_GETTER(JSFunction, has_feedback_vector, bool) {
-  return shared(cage_base).is_compiled() &&
-         raw_feedback_cell(cage_base).value(cage_base).IsFeedbackVector(
-             cage_base);
+  return shared(cage_base)->is_compiled() &&
+         IsFeedbackVector(raw_feedback_cell(cage_base)->value(cage_base),
+                          cage_base);
 }
 
 bool JSFunction::has_closure_feedback_cell_array() const {
-  return shared().is_compiled() &&
-         raw_feedback_cell().value().IsClosureFeedbackCellArray();
+  return shared()->is_compiled() &&
+         IsClosureFeedbackCellArray(raw_feedback_cell()->value());
 }
 
-Context JSFunction::context() {
+Tagged<Context> JSFunction::context() {
   return TaggedField<Context, kContextOffset>::load(*this);
 }
 
-DEF_RELAXED_GETTER(JSFunction, context, Context) {
+DEF_RELAXED_GETTER(JSFunction, context, Tagged<Context>) {
   return TaggedField<Context, kContextOffset>::Relaxed_Load(cage_base, *this);
 }
 
 bool JSFunction::has_context() const {
-  return TaggedField<HeapObject, kContextOffset>::load(*this).IsContext();
+  return IsContext(TaggedField<HeapObject, kContextOffset>::load(*this));
 }
 
-JSGlobalProxy JSFunction::global_proxy() { return context().global_proxy(); }
+Tagged<JSGlobalProxy> JSFunction::global_proxy() {
+  return context()->global_proxy();
+}
 
-NativeContext JSFunction::native_context() {
-  return context().native_context();
+Tagged<NativeContext> JSFunction::native_context() {
+  return context()->native_context();
 }
 
 RELEASE_ACQUIRE_ACCESSORS_CHECKED(JSFunction, prototype_or_initial_map,
-                                  HeapObject, kPrototypeOrInitialMapOffset,
-                                  map().has_prototype_slot())
+                                  Tagged<HeapObject>,
+                                  kPrototypeOrInitialMapOffset,
+                                  map()->has_prototype_slot())
 
 DEF_GETTER(JSFunction, has_prototype_slot, bool) {
-  return map(cage_base).has_prototype_slot();
+  return map(cage_base)->has_prototype_slot();
 }
 
-DEF_GETTER(JSFunction, initial_map, Map) {
+DEF_GETTER(JSFunction, initial_map, Tagged<Map>) {
   return Map::cast(prototype_or_initial_map(cage_base, kAcquireLoad));
 }
 
 DEF_GETTER(JSFunction, has_initial_map, bool) {
   DCHECK(has_prototype_slot(cage_base));
-  return prototype_or_initial_map(cage_base, kAcquireLoad).IsMap(cage_base);
+  return IsMap(prototype_or_initial_map(cage_base, kAcquireLoad), cage_base);
 }
 
 DEF_GETTER(JSFunction, has_instance_prototype, bool) {
   DCHECK(has_prototype_slot(cage_base));
   return has_initial_map(cage_base) ||
-         !prototype_or_initial_map(cage_base, kAcquireLoad)
-              .IsTheHole(GetReadOnlyRoots(cage_base));
+         !IsTheHole(prototype_or_initial_map(cage_base, kAcquireLoad),
+                    GetReadOnlyRoots(cage_base));
 }
 
 DEF_GETTER(JSFunction, has_prototype, bool) {
   DCHECK(has_prototype_slot(cage_base));
-  return map(cage_base).has_non_instance_prototype() ||
+  return map(cage_base)->has_non_instance_prototype() ||
          has_instance_prototype(cage_base);
 }
 
 DEF_GETTER(JSFunction, has_prototype_property, bool) {
-  return (has_prototype_slot(cage_base) && IsConstructor(cage_base)) ||
-         IsGeneratorFunction(shared(cage_base).kind());
+  return (has_prototype_slot(cage_base) && IsConstructor(*this, cage_base)) ||
+         IsGeneratorFunction(shared(cage_base)->kind());
 }
 
 DEF_GETTER(JSFunction, PrototypeRequiresRuntimeLookup, bool) {
   return !has_prototype_property(cage_base) ||
-         map(cage_base).has_non_instance_prototype();
+         map(cage_base)->has_non_instance_prototype();
 }
 
-DEF_GETTER(JSFunction, instance_prototype, HeapObject) {
+DEF_GETTER(JSFunction, instance_prototype, Tagged<HeapObject>) {
   DCHECK(has_instance_prototype(cage_base));
   if (has_initial_map(cage_base)) {
-    return initial_map(cage_base).prototype(cage_base);
+    return initial_map(cage_base)->prototype(cage_base);
   }
   // When there is no initial map and the prototype is a JSReceiver, the
   // initial map field is used for the prototype field.
   return HeapObject::cast(prototype_or_initial_map(cage_base, kAcquireLoad));
 }
 
-DEF_GETTER(JSFunction, prototype, Object) {
+DEF_GETTER(JSFunction, prototype, Tagged<Object>) {
   DCHECK(has_prototype(cage_base));
   // If the function's prototype property has been set to a non-JSReceiver
   // value, that value is stored in the constructor field of the map.
-  if (map(cage_base).has_non_instance_prototype()) {
-    Object prototype = map(cage_base).GetConstructor(cage_base);
-    // The map must have a prototype in that field, not a back pointer.
-    DCHECK(!prototype.IsMap(cage_base));
-    DCHECK(!prototype.IsFunctionTemplateInfo(cage_base));
-    return prototype;
+  Tagged<Map> map = this->map(cage_base);
+  if (map->has_non_instance_prototype()) {
+    return map->GetNonInstancePrototype(cage_base);
   }
   return instance_prototype(cage_base);
 }
 
 bool JSFunction::is_compiled() const {
-  return code(kAcquireLoad).builtin_id() != Builtin::kCompileLazy &&
-         shared().is_compiled();
-}
-
-bool JSFunction::ShouldFlushBaselineCode(
-    base::EnumSet<CodeFlushMode> code_flush_mode) {
-  if (!IsBaselineCodeFlushingEnabled(code_flush_mode)) return false;
-  // Do a raw read for shared and code fields here since this function may be
-  // called on a concurrent thread. JSFunction itself should be fully
-  // initialized here but the SharedFunctionInfo, InstructionStream objects may
-  // not be initialized. We read using acquire loads to defend against that.
-  Object maybe_shared = ACQUIRE_READ_FIELD(*this, kSharedFunctionInfoOffset);
-  if (!maybe_shared.IsSharedFunctionInfo()) return false;
-
-  // See crbug.com/v8/11972 for more details on acquire / release semantics for
-  // code field. We don't use release stores when copying code pointers from
-  // SFI / FV to JSFunction but it is safe in practice.
-  Object maybe_code = ACQUIRE_READ_FIELD(*this, kCodeOffset);
-#ifdef THREAD_SANITIZER
-  // This is needed because TSAN does not process the memory fence
-  // emitted after page initialization.
-  BasicMemoryChunk::FromAddress(maybe_code.ptr())->SynchronizedHeapLoad();
-#endif
-  if (!maybe_code.IsCode()) return false;
-  Code code = Code::cast(maybe_code);
-  if (code.kind() != CodeKind::BASELINE) return false;
-
-  SharedFunctionInfo shared = SharedFunctionInfo::cast(maybe_shared);
-  return shared.ShouldFlushCode(code_flush_mode);
+  return code(kAcquireLoad)->builtin_id() != Builtin::kCompileLazy &&
+         shared()->is_compiled();
 }
 
 bool JSFunction::NeedsResetDueToFlushedBytecode() {
   // Do a raw read for shared and code fields here since this function may be
   // called on a concurrent thread. JSFunction itself should be fully
-  // initialized here but the SharedFunctionInfo, InstructionStream objects may
-  // not be initialized. We read using acquire loads to defend against that.
-  Object maybe_shared = ACQUIRE_READ_FIELD(*this, kSharedFunctionInfoOffset);
-  if (!maybe_shared.IsSharedFunctionInfo()) return false;
+  // initialized here but the SharedFunctionInfo, Code objects may not be
+  // initialized. We read using acquire loads to defend against that.
+  // TODO(v8) the branches for !IsSharedFunctionInfo() and !IsCode() are
+  // probably dead code by now. Investigate removing them or replacing them
+  // with CHECKs.
+  Tagged<Object> maybe_shared =
+      ACQUIRE_READ_FIELD(*this, kSharedFunctionInfoOffset);
+  if (!IsSharedFunctionInfo(maybe_shared)) return false;
 
-  Object maybe_code = ACQUIRE_READ_FIELD(*this, kCodeOffset);
-  if (!maybe_code.IsCode()) return false;
-  Code code = Code::cast(maybe_code);
+  Tagged<Object> maybe_code = raw_code(kAcquireLoad);
+  if (!IsCode(maybe_code)) return false;
+  Tagged<Code> code = Code::cast(maybe_code);
 
-  SharedFunctionInfo shared = SharedFunctionInfo::cast(maybe_shared);
-  return !shared.is_compiled() && code.builtin_id() != Builtin::kCompileLazy;
+  Tagged<SharedFunctionInfo> shared = SharedFunctionInfo::cast(maybe_shared);
+  return !shared->is_compiled() && code->builtin_id() != Builtin::kCompileLazy;
 }
 
 bool JSFunction::NeedsResetDueToFlushedBaselineCode() {
-  return code().kind() == CodeKind::BASELINE && !shared().HasBaselineCode();
+  return code()->kind() == CodeKind::BASELINE && !shared()->HasBaselineCode();
 }
 
 void JSFunction::ResetIfCodeFlushed(
-    base::Optional<std::function<void(HeapObject object, ObjectSlot slot,
-                                      HeapObject target)>>
+    base::Optional<std::function<void(
+        Tagged<HeapObject> object, ObjectSlot slot, Tagged<HeapObject> target)>>
         gc_notify_updated_slot) {
   const bool kBytecodeCanFlush =
       v8_flags.flush_bytecode || v8_flags.stress_snapshot;
@@ -281,7 +306,7 @@ void JSFunction::ResetIfCodeFlushed(
     // Bytecode was flushed and function is now uncompiled, reset JSFunction
     // by setting code to CompileLazy and clearing the feedback vector.
     set_code(*BUILTIN_CODE(GetIsolate(), CompileLazy));
-    raw_feedback_cell().reset_feedback_vector(gc_notify_updated_slot);
+    raw_feedback_cell()->reset_feedback_vector(gc_notify_updated_slot);
     return;
   }
 
diff --git a/deps/v8/src/objects/js-function.cc b/deps/v8/src/objects/js-function.cc
index 1640cb0d31529c..64cb8265b93ba1 100644
--- a/deps/v8/src/objects/js-function.cc
+++ b/deps/v8/src/objects/js-function.cc
@@ -4,6 +4,7 @@
 
 #include "src/objects/js-function.h"
 
+#include "src/base/optional.h"
 #include "src/baseline/baseline-batch-compiler.h"
 #include "src/codegen/compiler.h"
 #include "src/common/globals.h"
@@ -23,10 +24,10 @@ namespace v8 {
 namespace internal {
 
 CodeKinds JSFunction::GetAttachedCodeKinds() const {
-  const CodeKind kind = code().kind();
+  const CodeKind kind = code()->kind();
   if (!CodeKindIsJSFunction(kind)) return {};
   if (CodeKindIsOptimizedJSFunction(kind) &&
-      code().marked_for_deoptimization()) {
+      code()->marked_for_deoptimization()) {
     return {};
   }
   return CodeKindToCodeKindFlag(kind);
@@ -37,24 +38,24 @@ CodeKinds JSFunction::GetAvailableCodeKinds() const {
 
   if ((result & CodeKindFlag::INTERPRETED_FUNCTION) == 0) {
     // The SharedFunctionInfo could have attached bytecode.
-    if (shared().HasBytecodeArray()) {
+    if (shared()->HasBytecodeArray()) {
       result |= CodeKindFlag::INTERPRETED_FUNCTION;
     }
   }
 
   if ((result & CodeKindFlag::BASELINE) == 0) {
     // The SharedFunctionInfo could have attached baseline code.
-    if (shared().HasBaselineCode()) {
+    if (shared()->HasBaselineCode()) {
       result |= CodeKindFlag::BASELINE;
     }
   }
 
   // Check the optimized code cache.
-  if (has_feedback_vector() && feedback_vector().has_optimized_code() &&
-      !feedback_vector().optimized_code().marked_for_deoptimization()) {
-    Code code = feedback_vector().optimized_code();
-    DCHECK(CodeKindIsOptimizedJSFunction(code.kind()));
-    result |= CodeKindToCodeKindFlag(code.kind());
+  if (has_feedback_vector() && feedback_vector()->has_optimized_code() &&
+      !feedback_vector()->optimized_code()->marked_for_deoptimization()) {
+    Tagged<Code> code = feedback_vector()->optimized_code();
+    DCHECK(CodeKindIsOptimizedJSFunction(code->kind()));
+    result |= CodeKindToCodeKindFlag(code->kind());
   }
 
   DCHECK_EQ((result & ~kJSFunctionCodeKindsMask), 0);
@@ -121,8 +122,8 @@ base::Optional<CodeKind> JSFunction::GetActiveTier() const {
   // Asm/Wasm functions are currently not supported. For simplicity, this
   // includes invalid asm.js functions whose code hasn't yet been updated to
   // CompileLazy but is still the InstantiateAsmJs builtin.
-  if (shared().HasAsmWasmData() ||
-      code().builtin_id() == Builtin::kInstantiateAsmJs) {
+  if (shared()->HasAsmWasmData() ||
+      code()->builtin_id() == Builtin::kInstantiateAsmJs) {
     return {};
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -137,11 +138,11 @@ base::Optional<CodeKind> JSFunction::GetActiveTier() const {
         highest_tier == CodeKind::INTERPRETED_FUNCTION);
 
   if (highest_tier == CodeKind::INTERPRETED_FUNCTION) {
-    CHECK(code().is_interpreter_trampoline_builtin() ||
-          (CodeKindIsOptimizedJSFunction(code().kind()) &&
-           code().marked_for_deoptimization()) ||
-          (code().builtin_id() == Builtin::kCompileLazy &&
-           shared().HasBytecodeArray() && !shared().HasBaselineCode()));
+    CHECK(code()->is_interpreter_trampoline_builtin() ||
+          (CodeKindIsOptimizedJSFunction(code()->kind()) &&
+           code()->marked_for_deoptimization()) ||
+          (code()->builtin_id() == Builtin::kCompileLazy &&
+           shared()->HasBytecodeArray() && !shared()->HasBaselineCode()));
   }
 #endif  // DEBUG
 
@@ -174,7 +175,7 @@ bool JSFunction::CanDiscardCompiled() const {
   //
   // Note that when the function has not yet been compiled we also return
   // false; that's fine, since nothing must be discarded in that case.
-  if (CodeKindIsOptimizedJSFunction(code().kind())) return true;
+  if (CodeKindIsOptimizedJSFunction(code()->kind())) return true;
   CodeKinds result = GetAvailableCodeKinds();
   return (result & kJSFunctionCodeKindsMask) != 0;
 }
@@ -205,22 +206,22 @@ void JSFunction::MarkForOptimization(Isolate* isolate, CodeKind target_kind,
   DCHECK(!is_compiled() || ActiveTierIsIgnition() || ActiveTierIsBaseline() ||
          ActiveTierIsMaglev());
   DCHECK(!ActiveTierIsTurbofan());
-  DCHECK(shared().HasBytecodeArray());
-  DCHECK(shared().allows_lazy_compilation() ||
-         !shared().optimization_disabled());
+  DCHECK(shared()->HasBytecodeArray());
+  DCHECK(shared()->allows_lazy_compilation() ||
+         !shared()->optimization_disabled());
 
   if (IsConcurrent(mode)) {
     if (IsInProgress(tiering_state())) {
       if (v8_flags.trace_concurrent_recompilation) {
         PrintF("  ** Not marking ");
-        ShortPrint();
+        ShortPrint(*this);
         PrintF(" -- already in optimization queue.\n");
       }
       return;
     }
     if (v8_flags.trace_concurrent_recompilation) {
       PrintF("  ** Marking ");
-      ShortPrint();
+      ShortPrint(*this);
       PrintF(" for concurrent %s recompilation.\n",
              CodeKindToString(target_kind));
     }
@@ -229,9 +230,10 @@ void JSFunction::MarkForOptimization(Isolate* isolate, CodeKind target_kind,
   set_tiering_state(TieringStateFor(target_kind, mode));
 }
 
-void JSFunction::SetInterruptBudget(Isolate* isolate) {
-  raw_feedback_cell().set_interrupt_budget(
-      TieringManager::InterruptBudgetFor(isolate, *this));
+void JSFunction::SetInterruptBudget(
+    Isolate* isolate, base::Optional<CodeKind> override_active_tier) {
+  raw_feedback_cell()->set_interrupt_budget(
+      TieringManager::InterruptBudgetFor(isolate, *this, override_active_tier));
 }
 
 // static
@@ -249,7 +251,7 @@ Maybe<bool> JSFunctionOrBoundFunctionOrWrappedFunction::CopyNameAndLength(
   LookupIterator length_lookup(isolate, target,
                                isolate->factory()->length_string(), target,
                                LookupIterator::OWN);
-  if (!target->IsJSFunction() ||
+  if (!IsJSFunction(*target) ||
       length_lookup.state() != LookupIterator::ACCESSOR ||
       !length_lookup.GetAccessors().is_identical_to(function_length_accessor)) {
     Handle<Object> length(Smi::zero(), isolate);
@@ -261,9 +263,9 @@ Maybe<bool> JSFunctionOrBoundFunctionOrWrappedFunction::CopyNameAndLength(
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, target_length,
                                        Object::GetProperty(&length_lookup),
                                        Nothing<bool>());
-      if (target_length->IsNumber()) {
+      if (IsNumber(*target_length)) {
         length = isolate->factory()->NewNumber(std::max(
-            0.0, DoubleToInteger(target_length->Number()) - arg_count));
+            0.0, DoubleToInteger(Object::Number(*target_length)) - arg_count));
       }
     }
     LookupIterator it(isolate, function, isolate->factory()->length_string(),
@@ -284,7 +286,7 @@ Maybe<bool> JSFunctionOrBoundFunctionOrWrappedFunction::CopyNameAndLength(
       isolate->factory()->function_name_accessor();
   LookupIterator name_lookup(isolate, target, isolate->factory()->name_string(),
                              target);
-  if (!target->IsJSFunction() ||
+  if (!IsJSFunction(*target) ||
       name_lookup.state() != LookupIterator::ACCESSOR ||
       !name_lookup.GetAccessors().is_identical_to(function_name_accessor) ||
       (name_lookup.IsFound() && !name_lookup.HolderIsReceiver())) {
@@ -293,7 +295,7 @@ Maybe<bool> JSFunctionOrBoundFunctionOrWrappedFunction::CopyNameAndLength(
                                      Object::GetProperty(&name_lookup),
                                      Nothing<bool>());
     Handle<String> name;
-    if (target_name->IsString()) {
+    if (IsString(*target_name)) {
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate, name,
           Name::ToFunctionName(isolate, Handle<String>::cast(target_name)),
@@ -326,14 +328,14 @@ MaybeHandle<String> JSBoundFunction::GetName(Isolate* isolate,
   Handle<String> target_name = prefix;
   Factory* factory = isolate->factory();
   // Concatenate the "bound " up to the last non-bound target.
-  while (function->bound_target_function().IsJSBoundFunction()) {
+  while (IsJSBoundFunction(function->bound_target_function())) {
     ASSIGN_RETURN_ON_EXCEPTION(isolate, target_name,
                                factory->NewConsString(prefix, target_name),
                                String);
     function = handle(JSBoundFunction::cast(function->bound_target_function()),
                       isolate);
   }
-  if (function->bound_target_function().IsJSWrappedFunction()) {
+  if (IsJSWrappedFunction(function->bound_target_function())) {
     Handle<JSWrappedFunction> target(
         JSWrappedFunction::cast(function->bound_target_function()), isolate);
     Handle<String> name;
@@ -341,7 +343,7 @@ MaybeHandle<String> JSBoundFunction::GetName(Isolate* isolate,
         isolate, name, JSWrappedFunction::GetName(isolate, target), String);
     return factory->NewConsString(target_name, name);
   }
-  if (function->bound_target_function().IsJSFunction()) {
+  if (IsJSFunction(function->bound_target_function())) {
     Handle<JSFunction> target(
         JSFunction::cast(function->bound_target_function()), isolate);
     Handle<String> name = JSFunction::GetName(isolate, target);
@@ -354,21 +356,21 @@ MaybeHandle<String> JSBoundFunction::GetName(Isolate* isolate,
 // static
 Maybe<int> JSBoundFunction::GetLength(Isolate* isolate,
                                       Handle<JSBoundFunction> function) {
-  int nof_bound_arguments = function->bound_arguments().length();
-  while (function->bound_target_function().IsJSBoundFunction()) {
+  int nof_bound_arguments = function->bound_arguments()->length();
+  while (IsJSBoundFunction(function->bound_target_function())) {
     function = handle(JSBoundFunction::cast(function->bound_target_function()),
                       isolate);
     // Make sure we never overflow {nof_bound_arguments}, the number of
     // arguments of a function is strictly limited by the max length of an
     // JSAarray, Smi::kMaxValue is thus a reasonably good overestimate.
-    int length = function->bound_arguments().length();
+    int length = function->bound_arguments()->length();
     if (V8_LIKELY(Smi::kMaxValue - nof_bound_arguments > length)) {
       nof_bound_arguments += length;
     } else {
       nof_bound_arguments = Smi::kMaxValue;
     }
   }
-  if (function->bound_target_function().IsJSWrappedFunction()) {
+  if (IsJSWrappedFunction(function->bound_target_function())) {
     Handle<JSWrappedFunction> target(
         JSWrappedFunction::cast(function->bound_target_function()), isolate);
     int target_length = 0;
@@ -402,12 +404,12 @@ MaybeHandle<String> JSWrappedFunction::GetName(
   Handle<String> target_name = factory->empty_string();
   Handle<JSReceiver> target =
       handle(function->wrapped_target_function(), isolate);
-  if (target->IsJSBoundFunction()) {
+  if (IsJSBoundFunction(*target)) {
     return JSBoundFunction::GetName(
         isolate,
         handle(JSBoundFunction::cast(function->wrapped_target_function()),
                isolate));
-  } else if (target->IsJSFunction()) {
+  } else if (IsJSFunction(*target)) {
     return JSFunction::GetName(
         isolate,
         handle(JSFunction::cast(function->wrapped_target_function()), isolate));
@@ -422,7 +424,7 @@ Maybe<int> JSWrappedFunction::GetLength(Isolate* isolate,
   STACK_CHECK(isolate, Nothing<int>());
   Handle<JSReceiver> target =
       handle(function->wrapped_target_function(), isolate);
-  if (target->IsJSBoundFunction()) {
+  if (IsJSBoundFunction(*target)) {
     return JSBoundFunction::GetLength(
         isolate,
         handle(JSBoundFunction::cast(function->wrapped_target_function()),
@@ -444,11 +446,11 @@ MaybeHandle<Object> JSWrappedFunction::Create(
     Isolate* isolate, Handle<NativeContext> creation_context,
     Handle<JSReceiver> value) {
   // The value must be a callable according to the specification.
-  DCHECK(value->IsCallable());
+  DCHECK(IsCallable(*value));
   // The intermediate wrapped functions are not user-visible. And calling a
   // wrapped function won't cause a side effect in the creation realm.
   // Unwrap here to avoid nested unwrapping at the call site.
-  if (value->IsJSWrappedFunction()) {
+  if (IsJSWrappedFunction(*value)) {
     Handle<JSWrappedFunction> target_wrapped =
         Handle<JSWrappedFunction>::cast(value);
     value =
@@ -498,24 +500,24 @@ MaybeHandle<Object> JSWrappedFunction::Create(
 // static
 Handle<String> JSFunction::GetName(Isolate* isolate,
                                    Handle<JSFunction> function) {
-  if (function->shared().name_should_print_as_anonymous()) {
+  if (function->shared()->name_should_print_as_anonymous()) {
     return isolate->factory()->anonymous_string();
   }
-  return handle(function->shared().Name(), isolate);
+  return handle(function->shared()->Name(), isolate);
 }
 
 // static
 void JSFunction::EnsureClosureFeedbackCellArray(
     Handle<JSFunction> function, bool reset_budget_for_feedback_allocation) {
   Isolate* const isolate = function->GetIsolate();
-  DCHECK(function->shared().is_compiled());
-  DCHECK(function->shared().HasFeedbackMetadata());
+  DCHECK(function->shared()->is_compiled());
+  DCHECK(function->shared()->HasFeedbackMetadata());
 #if V8_ENABLE_WEBASSEMBLY
-  if (function->shared().HasAsmWasmData()) return;
+  if (function->shared()->HasAsmWasmData()) return;
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   Handle<SharedFunctionInfo> shared(function->shared(), isolate);
-  DCHECK(function->shared().HasBytecodeArray());
+  DCHECK(function->shared()->HasBytecodeArray());
 
   const bool has_closure_feedback_cell_array =
       (function->has_closure_feedback_cell_array() ||
@@ -538,7 +540,7 @@ void JSFunction::EnsureClosureFeedbackCellArray(
       ClosureFeedbackCellArray::New(isolate, shared);
   // Many closure cell is used as a way to specify that there is no
   // feedback cell for this function and a new feedback cell has to be
-  // allocated for this funciton. For ex: for eval functions, we have to create
+  // allocated for this function. For ex: for eval functions, we have to create
   // a feedback cell and cache it along with the code. It is safe to use
   // many_closure_cell to indicate this because in regular cases, it should
   // already have a feedback_vector / feedback cell array allocated.
@@ -548,8 +550,8 @@ void JSFunction::EnsureClosureFeedbackCellArray(
     function->set_raw_feedback_cell(*feedback_cell, kReleaseStore);
     function->SetInterruptBudget(isolate);
   } else {
-    function->raw_feedback_cell().set_value(*feedback_cell_array,
-                                            kReleaseStore);
+    function->raw_feedback_cell()->set_value(*feedback_cell_array,
+                                             kReleaseStore);
   }
 }
 
@@ -558,10 +560,10 @@ void JSFunction::EnsureFeedbackVector(Isolate* isolate,
                                       Handle<JSFunction> function,
                                       IsCompiledScope* compiled_scope) {
   DCHECK(compiled_scope->is_compiled());
-  DCHECK(function->shared().HasFeedbackMetadata());
+  DCHECK(function->shared()->HasFeedbackMetadata());
   if (function->has_feedback_vector()) return;
 #if V8_ENABLE_WEBASSEMBLY
-  if (function->shared().HasAsmWasmData()) return;
+  if (function->shared()->HasAsmWasmData()) return;
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   CreateAndAttachFeedbackVector(isolate, function, compiled_scope);
@@ -572,14 +574,14 @@ void JSFunction::CreateAndAttachFeedbackVector(
     Isolate* isolate, Handle<JSFunction> function,
     IsCompiledScope* compiled_scope) {
   DCHECK(compiled_scope->is_compiled());
-  DCHECK(function->shared().HasFeedbackMetadata());
+  DCHECK(function->shared()->HasFeedbackMetadata());
   DCHECK(!function->has_feedback_vector());
 #if V8_ENABLE_WEBASSEMBLY
-  DCHECK(!function->shared().HasAsmWasmData());
+  DCHECK(!function->shared()->HasAsmWasmData());
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   Handle<SharedFunctionInfo> shared(function->shared(), isolate);
-  DCHECK(function->shared().HasBytecodeArray());
+  DCHECK(function->shared()->HasBytecodeArray());
 
   EnsureClosureFeedbackCellArray(function, false);
   Handle<ClosureFeedbackCellArray> closure_feedback_cell_array =
@@ -593,7 +595,7 @@ void JSFunction::CreateAndAttachFeedbackVector(
   // for more details.
   DCHECK(function->raw_feedback_cell() !=
          isolate->heap()->many_closures_cell());
-  DCHECK_EQ(function->raw_feedback_cell().value(), *feedback_vector);
+  DCHECK_EQ(function->raw_feedback_cell()->value(), *feedback_vector);
   function->SetInterruptBudget(isolate);
 
   DCHECK_EQ(v8_flags.log_function_events,
@@ -611,19 +613,19 @@ void JSFunction::InitializeFeedbackCell(
   // feedback vectors, so a mismatch between the metadata and feedback vector is
   // harmless. The checks could fail for functions that has has_asm_wasm_broken
   // set at runtime (for ex: failed instantiation).
-  if (function->shared().HasAsmWasmData()) return;
+  if (function->shared()->HasAsmWasmData()) return;
 #endif  // V8_ENABLE_WEBASSEMBLY
 
   if (function->has_feedback_vector()) {
-    CHECK_EQ(function->feedback_vector().length(),
-             function->feedback_vector().metadata().slot_count());
+    CHECK_EQ(function->feedback_vector()->length(),
+             function->feedback_vector()->metadata()->slot_count());
     return;
   }
 
   if (function->has_closure_feedback_cell_array()) {
     CHECK_EQ(
-        function->closure_feedback_cell_array().length(),
-        function->shared().feedback_metadata().create_closure_slot_count());
+        function->closure_feedback_cell_array()->length(),
+        function->shared()->feedback_metadata()->create_closure_slot_count());
   }
 
   const bool needs_feedback_vector =
@@ -632,7 +634,7 @@ void JSFunction::InitializeFeedbackCell(
       // profile and more precise code coverage.
       v8_flags.log_function_events ||
       !isolate->is_best_effort_code_coverage() ||
-      function->shared().sparkplug_compiled();
+      function->shared()->sparkplug_compiled();
 
   if (needs_feedback_vector) {
     CreateAndAttachFeedbackVector(isolate, function, is_compiled_scope);
@@ -641,14 +643,14 @@ void JSFunction::InitializeFeedbackCell(
                                    reset_budget_for_feedback_allocation);
   }
   // TODO(jgruber): Unduplicate these conditions from tiering-manager.cc.
-  if (function->shared().sparkplug_compiled() &&
+  if (function->shared()->sparkplug_compiled() &&
       CanCompileWithBaseline(isolate, function->shared()) &&
       function->ActiveTierIsIgnition()) {
     if (v8_flags.baseline_batch_compilation) {
       isolate->baseline_batch_compiler()->EnqueueFunction(function);
     } else {
       IsCompiledScope is_compiled_scope(
-          function->shared().is_compiled_scope(isolate));
+          function->shared()->is_compiled_scope(isolate));
       Compiler::CompileBaseline(isolate, function, Compiler::CLEAR_EXCEPTION,
                                 &is_compiled_scope);
     }
@@ -676,12 +678,16 @@ void SetInstancePrototype(Isolate* isolate, Handle<JSFunction> function,
       // At that point, a new initial map is created and the prototype is put
       // into the initial map where it belongs.
       function->set_prototype_or_initial_map(*value, kReleaseStore);
+      if (IsJSObjectThatCanBeTrackedAsPrototype(*value)) {
+        // Optimize as prototype to detach it from its transition tree.
+        JSObject::OptimizeAsPrototype(Handle<JSObject>::cast(value));
+      }
     } else {
       Handle<Map> new_map =
           Map::Copy(isolate, initial_map, "SetInstancePrototype");
       JSFunction::SetInitialMap(isolate, function, new_map, value);
       DCHECK_IMPLIES(!isolate->bootstrapper()->IsActive(),
-                     *function != function->native_context().array_function());
+                     *function != function->native_context()->array_function());
     }
 
     // Deoptimize all code that embeds the previous initial map.
@@ -692,7 +698,7 @@ void SetInstancePrototype(Isolate* isolate, Handle<JSFunction> function,
     // needed.  At that point, a new initial map is created and the
     // prototype is put into the initial map where it belongs.
     function->set_prototype_or_initial_map(*value, kReleaseStore);
-    if (value->IsJSObjectThatCanBeTrackedAsPrototype()) {
+    if (IsJSObjectThatCanBeTrackedAsPrototype(*value)) {
       // Optimize as prototype to detach it from its transition tree.
       JSObject::OptimizeAsPrototype(Handle<JSObject>::cast(value));
     }
@@ -703,8 +709,8 @@ void SetInstancePrototype(Isolate* isolate, Handle<JSFunction> function,
 
 void JSFunction::SetPrototype(Handle<JSFunction> function,
                               Handle<Object> value) {
-  DCHECK(function->IsConstructor() ||
-         IsGeneratorFunction(function->shared().kind()));
+  DCHECK(IsConstructor(*function) ||
+         IsGeneratorFunction(function->shared()->kind()));
   Isolate* isolate = function->GetIsolate();
   Handle<JSReceiver> construct_prototype;
 
@@ -712,18 +718,25 @@ void JSFunction::SetPrototype(Handle<JSFunction> function,
   // constructor field so it can be accessed.  Also, set the prototype
   // used for constructing objects to the original object prototype.
   // See ECMA-262 13.2.2.
-  if (!value->IsJSReceiver()) {
+  if (!IsJSReceiver(*value)) {
     // Copy the map so this does not affect unrelated functions.
     // Remove map transitions because they point to maps with a
     // different prototype.
     Handle<Map> new_map =
         Map::Copy(isolate, handle(function->map(), isolate), "SetPrototype");
 
-    new_map->SetConstructor(*value);
+    // Create a new {constructor, non-instance_prototype} tuple and store it
+    // in Map::constructor field.
+    Handle<Object> constructor(new_map->GetConstructor(), isolate);
+    Handle<Tuple2> non_instance_prototype_constructor_tuple =
+        isolate->factory()->NewTuple2(constructor, value, AllocationType::kOld);
+
     new_map->set_has_non_instance_prototype(true);
+    new_map->SetConstructor(*non_instance_prototype_constructor_tuple);
+
     JSObject::MigrateToMap(isolate, function, new_map);
 
-    FunctionKind kind = function->shared().kind();
+    FunctionKind kind = function->shared()->kind();
     Handle<Context> native_context(function->native_context(), isolate);
 
     construct_prototype = Handle<JSReceiver>(
@@ -735,7 +748,7 @@ void JSFunction::SetPrototype(Handle<JSFunction> function,
         isolate);
   } else {
     construct_prototype = Handle<JSReceiver>::cast(value);
-    function->map().set_has_non_instance_prototype(false);
+    function->map()->set_has_non_instance_prototype(false);
   }
 
   SetInstancePrototype(isolate, function, construct_prototype);
@@ -748,11 +761,10 @@ void JSFunction::SetInitialMap(Isolate* isolate, Handle<JSFunction> function,
 
 void JSFunction::SetInitialMap(Isolate* isolate, Handle<JSFunction> function,
                                Handle<Map> map, Handle<HeapObject> prototype,
-                               Handle<HeapObject> constructor) {
+                               Handle<JSFunction> constructor) {
   if (map->prototype() != *prototype) {
     Map::SetPrototype(isolate, map, prototype);
   }
-  DCHECK_IMPLIES(!constructor->IsJSFunction(), map->InSharedHeap());
   map->SetConstructor(*constructor);
   function->set_prototype_or_initial_map(*map, kReleaseStore);
   if (v8_flags.log_maps) {
@@ -764,8 +776,8 @@ void JSFunction::SetInitialMap(Isolate* isolate, Handle<JSFunction> function,
 
 void JSFunction::EnsureHasInitialMap(Handle<JSFunction> function) {
   DCHECK(function->has_prototype_slot());
-  DCHECK(function->IsConstructor() ||
-         IsResumableFunction(function->shared().kind()));
+  DCHECK(IsConstructor(*function) ||
+         IsResumableFunction(function->shared()->kind()));
   if (function->has_initial_map()) return;
   Isolate* isolate = function->GetIsolate();
 
@@ -780,8 +792,8 @@ void JSFunction::EnsureHasInitialMap(Handle<JSFunction> function) {
   // Create a new map with the size and number of in-object properties suggested
   // by the function.
   InstanceType instance_type;
-  if (IsResumableFunction(function->shared().kind())) {
-    instance_type = IsAsyncGeneratorFunction(function->shared().kind())
+  if (IsResumableFunction(function->shared()->kind())) {
+    instance_type = IsAsyncGeneratorFunction(function->shared()->kind())
                         ? JS_ASYNC_GENERATOR_OBJECT_TYPE
                         : JS_GENERATOR_OBJECT_TYPE;
   } else {
@@ -801,13 +813,15 @@ void JSFunction::EnsureHasInitialMap(Handle<JSFunction> function) {
   Handle<HeapObject> prototype;
   if (function->has_instance_prototype()) {
     prototype = handle(function->instance_prototype(), isolate);
+    map->set_prototype(*prototype);
   } else {
     prototype = isolate->factory()->NewFunctionPrototype(function);
+    Map::SetPrototype(isolate, map, prototype);
   }
   DCHECK(map->has_fast_object_elements());
 
   // Finally link initial map and constructor function.
-  DCHECK(prototype->IsJSReceiver());
+  DCHECK(IsJSReceiver(*prototype));
   JSFunction::SetInitialMap(isolate, function, map, prototype);
   map->StartInobjectSlackTracking();
 }
@@ -956,8 +970,8 @@ bool FastInitializeDerivedMap(Isolate* isolate, Handle<JSFunction> new_target,
   // Check that |function|'s initial map still in sync with the |constructor|,
   // otherwise we must create a new initial map for |function|.
   if (new_target->has_initial_map() &&
-      new_target->initial_map().GetConstructor() == *constructor) {
-    DCHECK(new_target->instance_prototype().IsJSReceiver());
+      new_target->initial_map()->GetConstructor() == *constructor) {
+    DCHECK(IsJSReceiver(new_target->instance_prototype()));
     return true;
   }
   InstanceType instance_type = constructor_initial_map->instance_type();
@@ -967,7 +981,7 @@ bool FastInitializeDerivedMap(Isolate* isolate, Handle<JSFunction> new_target,
 
   // Link initial map and constructor function if the new.target is actually a
   // subclass constructor.
-  if (!IsDerivedConstructor(new_target->shared().kind())) return false;
+  if (!IsDerivedConstructor(new_target->shared()->kind())) return false;
 
   int instance_size;
   int in_object_properties;
@@ -980,7 +994,7 @@ bool FastInitializeDerivedMap(Isolate* isolate, Handle<JSFunction> new_target,
   // failure occur during prototype chain iteration.
   // So we take the maximum of two values.
   int expected_nof_properties = std::max(
-      static_cast<int>(constructor->shared().expected_nof_properties()),
+      static_cast<int>(constructor->shared()->expected_nof_properties()),
       JSFunction::CalculateExpectedNofProperties(isolate, new_target));
   JSFunction::CalculateInstanceSizeHelper(
       instance_type, constructor_initial_map->has_prototype_slot(),
@@ -997,7 +1011,7 @@ bool FastInitializeDerivedMap(Isolate* isolate, Handle<JSFunction> new_target,
   map->set_new_target_is_base(false);
   Handle<HeapObject> prototype(new_target->instance_prototype(), isolate);
   JSFunction::SetInitialMap(isolate, new_target, map, prototype, constructor);
-  DCHECK(new_target->instance_prototype().IsJSReceiver());
+  DCHECK(IsJSReceiver(new_target->instance_prototype()));
   map->set_construction_counter(Map::kNoSlackTracking);
   map->StartInobjectSlackTracking();
   return true;
@@ -1018,7 +1032,7 @@ MaybeHandle<Map> JSFunction::GetDerivedMap(Isolate* isolate,
   // Fast case, new.target is a subclass of constructor. The map is cacheable
   // (and may already have been cached). new.target.prototype is guaranteed to
   // be a JSReceiver.
-  if (new_target->IsJSFunction()) {
+  if (IsJSFunction(*new_target)) {
     Handle<JSFunction> function = Handle<JSFunction>::cast(new_target);
     if (FastInitializeDerivedMap(isolate, function, constructor,
                                  constructor_initial_map)) {
@@ -1030,7 +1044,7 @@ MaybeHandle<Map> JSFunction::GetDerivedMap(Isolate* isolate,
   // new.target.prototype is not guaranteed to be a JSReceiver, and may need to
   // fall back to the intrinsicDefaultProto.
   Handle<Object> prototype;
-  if (new_target->IsJSFunction()) {
+  if (IsJSFunction(*new_target)) {
     Handle<JSFunction> function = Handle<JSFunction>::cast(new_target);
     if (function->has_prototype_slot()) {
       // Make sure the new.target.prototype is cached.
@@ -1055,27 +1069,27 @@ MaybeHandle<Map> JSFunction::GetDerivedMap(Isolate* isolate,
   // correct realm. Rather than directly fetching the .prototype, we fetch the
   // constructor that points to the .prototype. This relies on
   // constructor.prototype being FROZEN for those constructors.
-  if (!prototype->IsJSReceiver()) {
+  if (!IsJSReceiver(*prototype)) {
     Handle<Context> context;
     ASSIGN_RETURN_ON_EXCEPTION(isolate, context,
                                JSReceiver::GetFunctionRealm(new_target), Map);
-    DCHECK(context->IsNativeContext());
+    DCHECK(IsNativeContext(*context));
     Handle<Object> maybe_index = JSReceiver::GetDataProperty(
         isolate, constructor,
         isolate->factory()->native_context_index_symbol());
-    int index = maybe_index->IsSmi() ? Smi::ToInt(*maybe_index)
-                                     : Context::OBJECT_FUNCTION_INDEX;
+    int index = IsSmi(*maybe_index) ? Smi::ToInt(*maybe_index)
+                                    : Context::OBJECT_FUNCTION_INDEX;
     Handle<JSFunction> realm_constructor(JSFunction::cast(context->get(index)),
                                          isolate);
     prototype = handle(realm_constructor->prototype(), isolate);
   }
+  CHECK(IsJSReceiver(*prototype));
+  DCHECK_EQ(constructor_initial_map->constructor_or_back_pointer(),
+            *constructor);
 
-  Handle<Map> map = Map::CopyInitialMap(isolate, constructor_initial_map);
-  map->set_new_target_is_base(false);
-  CHECK(prototype->IsJSReceiver());
-  if (map->prototype() != *prototype)
-    Map::SetPrototype(isolate, map, Handle<HeapObject>::cast(prototype));
-  map->SetConstructor(*constructor);
+  Handle<Map> map = Map::TransitionToDerivedMap(
+      isolate, constructor_initial_map, Handle<HeapObject>::cast(prototype));
+  DCHECK_EQ(map->constructor_or_back_pointer(), *constructor);
   return map;
 }
 
@@ -1118,13 +1132,13 @@ MaybeHandle<Map> JSFunction::GetDerivedRabGsabTypedArrayMap(
   }
   {
     DisallowHeapAllocation no_alloc;
-    NativeContext context = isolate->context().native_context();
+    Tagged<NativeContext> context = isolate->context()->native_context();
     int ctor_index =
         TypedArrayElementsKindToConstructorIndex(map->elements_kind());
-    if (*new_target == context.get(ctor_index)) {
+    if (*new_target == context->get(ctor_index)) {
       ctor_index =
           TypedArrayElementsKindToRabGsabCtorIndex(map->elements_kind());
-      return handle(Map::cast(context.get(ctor_index)), isolate);
+      return handle(Map::cast(context->get(ctor_index)), isolate);
     }
   }
 
@@ -1140,7 +1154,7 @@ MaybeHandle<Map> JSFunction::GetDerivedRabGsabTypedArrayMap(
 MaybeHandle<Map> JSFunction::GetDerivedRabGsabDataViewMap(
     Isolate* isolate, Handle<JSReceiver> new_target) {
   Handle<Context> context =
-      handle(isolate->context().native_context(), isolate);
+      handle(isolate->context()->native_context(), isolate);
   Handle<JSFunction> constructor = handle(context->data_view_fun(), isolate);
   MaybeHandle<Map> maybe_map = GetDerivedMap(isolate, constructor, new_target);
   Handle<Map> map;
@@ -1161,15 +1175,15 @@ MaybeHandle<Map> JSFunction::GetDerivedRabGsabDataViewMap(
 
 int JSFunction::ComputeInstanceSizeWithMinSlack(Isolate* isolate) {
   CHECK(has_initial_map());
-  if (initial_map().IsInobjectSlackTrackingInProgress()) {
-    int slack = initial_map().ComputeMinObjectSlack(isolate);
-    return initial_map().InstanceSizeFromSlack(slack);
+  if (initial_map()->IsInobjectSlackTrackingInProgress()) {
+    int slack = initial_map()->ComputeMinObjectSlack(isolate);
+    return initial_map()->InstanceSizeFromSlack(slack);
   }
-  return initial_map().instance_size();
+  return initial_map()->instance_size();
 }
 
 std::unique_ptr<char[]> JSFunction::DebugNameCStr() {
-  return shared().DebugNameCStr();
+  return shared()->DebugNameCStr();
 }
 
 void JSFunction::PrintName(FILE* out) {
@@ -1179,22 +1193,22 @@ void JSFunction::PrintName(FILE* out) {
 namespace {
 
 bool UseFastFunctionNameLookup(Isolate* isolate, Map map) {
-  DCHECK(map.IsJSFunctionMap());
-  if (map.NumberOfOwnDescriptors() <
+  DCHECK(IsJSFunctionMap(map));
+  if (map->NumberOfOwnDescriptors() <
       JSFunction::kMinDescriptorsForFastBindAndWrap) {
     return false;
   }
-  DCHECK(!map.is_dictionary_map());
-  HeapObject value;
+  DCHECK(!map->is_dictionary_map());
+  Tagged<HeapObject> value;
   ReadOnlyRoots roots(isolate);
-  auto descriptors = map.instance_descriptors(isolate);
+  auto descriptors = map->instance_descriptors(isolate);
   InternalIndex kNameIndex{JSFunction::kNameDescriptorIndex};
-  if (descriptors.GetKey(kNameIndex) != roots.name_string() ||
-      !descriptors.GetValue(kNameIndex)
+  if (descriptors->GetKey(kNameIndex) != roots.name_string() ||
+      !descriptors->GetValue(kNameIndex)
            .GetHeapObjectIfStrong(isolate, &value)) {
     return false;
   }
-  return value.IsAccessorInfo();
+  return IsAccessorInfo(value);
 }
 
 }  // namespace
@@ -1217,7 +1231,7 @@ Handle<String> JSFunction::GetDebugName(Handle<JSFunction> function) {
     // in case of the fast-path.
     Handle<Object> name =
         GetDataProperty(isolate, function, isolate->factory()->name_string());
-    if (name->IsString()) return Handle<String>::cast(name);
+    if (IsString(*name)) return Handle<String>::cast(name);
   }
   return SharedFunctionInfo::DebugName(isolate,
                                        handle(function->shared(), isolate));
@@ -1273,13 +1287,13 @@ Handle<String> JSFunction::ToString(Handle<JSFunction> function) {
     // Check if we should print {function} as a class.
     Handle<Object> maybe_class_positions = JSReceiver::GetDataProperty(
         isolate, function, isolate->factory()->class_positions_symbol());
-    if (maybe_class_positions->IsClassPositions()) {
+    if (IsClassPositions(*maybe_class_positions)) {
       ClassPositions class_positions =
           ClassPositions::cast(*maybe_class_positions);
-      int start_position = class_positions.start();
-      int end_position = class_positions.end();
+      int start_position = class_positions->start();
+      int end_position = class_positions->end();
       Handle<String> script_source(
-          String::cast(Script::cast(shared_info->script()).source()), isolate);
+          String::cast(Script::cast(shared_info->script())->source()), isolate);
       return isolate->factory()->NewSubString(script_source, start_position,
                                               end_position);
     }
@@ -1296,13 +1310,13 @@ Handle<String> JSFunction::ToString(Handle<JSFunction> function) {
   if (shared_info->HasWasmExportedFunctionData()) {
     Handle<WasmExportedFunctionData> function_data(
         shared_info->wasm_exported_function_data(), isolate);
-    const wasm::WasmModule* module = function_data->instance().module();
+    const wasm::WasmModule* module = function_data->instance()->module();
     if (is_asmjs_module(module)) {
       std::pair<int, int> offsets =
           module->asm_js_offset_information->GetFunctionOffsets(
               declared_function_index(module, function_data->function_index()));
       Handle<String> source(
-          String::cast(Script::cast(shared_info->script()).source()), isolate);
+          String::cast(Script::cast(shared_info->script())->source()), isolate);
       return isolate->factory()->NewSubString(source, offsets.first,
                                               offsets.second);
     }
@@ -1329,7 +1343,7 @@ int JSFunction::CalculateExpectedNofProperties(Isolate* isolate,
        !iter.IsAtEnd(); iter.Advance()) {
     Handle<JSReceiver> current =
         PrototypeIterator::GetCurrent<JSReceiver>(iter);
-    if (!current->IsJSFunction()) break;
+    if (!IsJSFunction(*current)) break;
     Handle<JSFunction> func = Handle<JSFunction>::cast(current);
     // The super constructor should be compiled for the number of expected
     // properties to be available.
@@ -1399,7 +1413,7 @@ void JSFunction::ClearAllTypeFeedbackInfoForTesting() {
   if (has_feedback_vector()) {
     FeedbackVector vector = feedback_vector();
     Isolate* isolate = GetIsolate();
-    if (vector.ClearAllSlotsForTesting(isolate)) {
+    if (vector->ClearAllSlotsForTesting(isolate)) {
       IC::OnFeedbackChanged(isolate, vector, FeedbackSlot::Invalid(),
                             "ClearAllTypeFeedbackInfoForTesting");
     }
diff --git a/deps/v8/src/objects/js-function.h b/deps/v8/src/objects/js-function.h
index da353d2a66ef1e..1238c78f0c204e 100644
--- a/deps/v8/src/objects/js-function.h
+++ b/deps/v8/src/objects/js-function.h
@@ -5,6 +5,7 @@
 #ifndef V8_OBJECTS_JS_FUNCTION_H_
 #define V8_OBJECTS_JS_FUNCTION_H_
 
+#include "src/base/optional.h"
 #include "src/objects/code-kind.h"
 #include "src/objects/js-objects.h"
 
@@ -87,25 +88,25 @@ class JSFunction : public TorqueGeneratedJSFunction<
                        JSFunction, JSFunctionOrBoundFunctionOrWrappedFunction> {
  public:
   // [prototype_or_initial_map]:
-  DECL_RELEASE_ACQUIRE_ACCESSORS(prototype_or_initial_map, HeapObject)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(prototype_or_initial_map, Tagged<HeapObject>)
 
   // [shared]: The information about the function that can be shared by
   // instances.
-  DECL_ACCESSORS(shared, SharedFunctionInfo)
-  DECL_RELAXED_GETTER(shared, SharedFunctionInfo)
+  DECL_ACCESSORS(shared, Tagged<SharedFunctionInfo>)
+  DECL_RELAXED_GETTER(shared, Tagged<SharedFunctionInfo>)
 
   // Fast binding requires length and name accessors.
   static const int kMinDescriptorsForFastBindAndWrap = 2;
 
   // [context]: The context for this function.
-  inline Context context();
-  DECL_RELAXED_GETTER(context, Context)
+  inline Tagged<Context> context();
+  DECL_RELAXED_GETTER(context, Tagged<Context>)
   inline bool has_context() const;
   using TorqueGeneratedClass::context;
   using TorqueGeneratedClass::set_context;
-  DECL_RELEASE_ACQUIRE_ACCESSORS(context, Context)
-  inline JSGlobalProxy global_proxy();
-  inline NativeContext native_context();
+  DECL_RELEASE_ACQUIRE_ACCESSORS(context, Tagged<Context>)
+  inline Tagged<JSGlobalProxy> global_proxy();
+  inline Tagged<NativeContext> native_context();
   inline int length();
 
   static Handle<String> GetName(Isolate* isolate, Handle<JSFunction> function);
@@ -118,16 +119,22 @@ class JSFunction : public TorqueGeneratedJSFunction<
   // optimized code object, or when reading from the background thread.
   // Storing a builtin doesn't require release semantics because these objects
   // are fully initialized.
-  DECL_ACCESSORS(code, Code)
-  DECL_RELEASE_ACQUIRE_ACCESSORS(code, Code)
+  DECL_ACCESSORS(code, Tagged<Code>)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(code, Tagged<Code>)
+
+  // Returns the raw content of the Code field. When reading from a background
+  // thread, the code field may still be uninitialized, in which case the field
+  // contains Smi::zero().
+  inline Tagged<Object> raw_code() const;
+  inline Tagged<Object> raw_code(AcquireLoadTag) const;
 
   // Returns the address of the function code's instruction start.
-  inline Address code_entry_point() const;
+  inline Address instruction_start() const;
 
   // Get the abstract code associated with the function, which will either be
   // a InstructionStream object or a BytecodeArray.
   template <typename IsolateT>
-  inline AbstractCode abstract_code(IsolateT* isolate);
+  inline Tagged<AbstractCode> abstract_code(IsolateT* isolate);
 
   // The predicates for querying code kinds related to this function have
   // specific terminology:
@@ -187,7 +194,8 @@ class JSFunction : public TorqueGeneratedJSFunction<
 
   // Sets the interrupt budget based on whether the function has a feedback
   // vector and any optimized code.
-  void SetInterruptBudget(Isolate* isolate);
+  void SetInterruptBudget(Isolate* isolate,
+                          base::Optional<CodeKind> override_active_tier = {});
 
   // If slack tracking is active, it computes instance size of the initial map
   // with minimum permissible object slack.  If it is not active, it simply
@@ -201,17 +209,17 @@ class JSFunction : public TorqueGeneratedJSFunction<
   /// FeedbackVector eventually. Generally this shouldn't be used to get the
   // feedback_vector, instead use feedback_vector() which correctly deals with
   // the JSFunction's bytecode being flushed.
-  DECL_ACCESSORS(raw_feedback_cell, FeedbackCell)
+  DECL_ACCESSORS(raw_feedback_cell, Tagged<FeedbackCell>)
 
   // [raw_feedback_cell] (synchronized version) When this is initialized from a
   // newly allocated object (instead of a root sentinel), it should
   // be written with release store semantics.
-  DECL_RELEASE_ACQUIRE_ACCESSORS(raw_feedback_cell, FeedbackCell)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(raw_feedback_cell, Tagged<FeedbackCell>)
 
   // Functions related to feedback vector. feedback_vector() can be used once
   // the function has feedback vectors allocated. feedback vectors may not be
   // available after compile when lazily allocating feedback vectors.
-  DECL_GETTER(feedback_vector, FeedbackVector)
+  DECL_GETTER(feedback_vector, Tagged<FeedbackVector>)
   DECL_GETTER(has_feedback_vector, bool)
   V8_EXPORT_PRIVATE static void EnsureFeedbackVector(
       Isolate* isolate, Handle<JSFunction> function,
@@ -225,7 +233,7 @@ class JSFunction : public TorqueGeneratedJSFunction<
   // cell arrays after compile, when we want to allocate feedback vectors
   // lazily.
   inline bool has_closure_feedback_cell_array() const;
-  inline ClosureFeedbackCellArray closure_feedback_cell_array() const;
+  inline Tagged<ClosureFeedbackCellArray> closure_feedback_cell_array() const;
   static void EnsureClosureFeedbackCellArray(
       Handle<JSFunction> function, bool reset_budget_for_feedback_allocation);
 
@@ -244,8 +252,9 @@ class JSFunction : public TorqueGeneratedJSFunction<
   // Resets function to clear compiled data after bytecode has been flushed.
   inline bool NeedsResetDueToFlushedBytecode();
   inline void ResetIfCodeFlushed(
-      base::Optional<std::function<void(HeapObject object, ObjectSlot slot,
-                                        HeapObject target)>>
+      base::Optional<
+          std::function<void(Tagged<HeapObject> object, ObjectSlot slot,
+                             Tagged<HeapObject> target)>>
           gc_notify_updated_slot = base::nullopt);
 
   // Returns if the closure's code field has to be updated because it has
@@ -260,13 +269,14 @@ class JSFunction : public TorqueGeneratedJSFunction<
   DECL_GETTER(has_prototype_slot, bool)
 
   // The initial map for an object created by this constructor.
-  DECL_GETTER(initial_map, Map)
+  DECL_GETTER(initial_map, Tagged<Map>)
 
   static void SetInitialMap(Isolate* isolate, Handle<JSFunction> function,
                             Handle<Map> map, Handle<HeapObject> prototype);
   static void SetInitialMap(Isolate* isolate, Handle<JSFunction> function,
                             Handle<Map> map, Handle<HeapObject> prototype,
-                            Handle<HeapObject> constructor);
+                            Handle<JSFunction> constructor);
+
   DECL_GETTER(has_initial_map, bool)
   V8_EXPORT_PRIVATE static void EnsureHasInitialMap(
       Handle<JSFunction> function);
@@ -294,8 +304,8 @@ class JSFunction : public TorqueGeneratedJSFunction<
   // until an initial map is needed.
   DECL_GETTER(has_prototype, bool)
   DECL_GETTER(has_instance_prototype, bool)
-  DECL_GETTER(prototype, Object)
-  DECL_GETTER(instance_prototype, HeapObject)
+  DECL_GETTER(prototype, Tagged<Object>)
+  DECL_GETTER(instance_prototype, Tagged<HeapObject>)
   DECL_GETTER(has_prototype_property, bool)
   DECL_GETTER(PrototypeRequiresRuntimeLookup, bool)
   static void SetPrototype(Handle<JSFunction> function, Handle<Object> value);
@@ -352,10 +362,10 @@ class JSFunction : public TorqueGeneratedJSFunction<
   static const int kHeaderSize;
 
   // Hide generated accessors; custom accessors are called "shared".
-  DECL_ACCESSORS(shared_function_info, SharedFunctionInfo)
+  DECL_ACCESSORS(shared_function_info, Tagged<SharedFunctionInfo>)
 
   // Hide generated accessors; custom accessors are called "raw_feedback_cell".
-  DECL_ACCESSORS(feedback_cell, FeedbackCell)
+  DECL_ACCESSORS(feedback_cell, Tagged<FeedbackCell>)
 
   // Returns the set of code kinds of compilation artifacts (bytecode,
   // generated code) attached to this JSFunction.
diff --git a/deps/v8/src/objects/js-function.tq b/deps/v8/src/objects/js-function.tq
index abaeac1b560b70..8d233a29efe4f4 100644
--- a/deps/v8/src/objects/js-function.tq
+++ b/deps/v8/src/objects/js-function.tq
@@ -3,8 +3,7 @@
 // found in the LICENSE file.
 
 @abstract
-extern class JSFunctionOrBoundFunctionOrWrappedFunction extends JSObject {
-}
+extern class JSFunctionOrBoundFunctionOrWrappedFunction extends JSObject {}
 
 extern class JSBoundFunction extends
     JSFunctionOrBoundFunctionOrWrappedFunction {
@@ -30,10 +29,13 @@ extern class JSWrappedFunction extends
 // here, please also update JSFunctionVerify in objects-debug.cc.
 @highestInstanceTypeWithinParentClassRange
 extern class JSFunction extends JSFunctionOrBoundFunctionOrWrappedFunction {
+  // When the sandbox is enabled, the Code object is referenced through an
+  // indirect pointer. Otherwise, it is a regular tagged pointer.
+  @if(V8_CODE_POINTER_SANDBOXING) code: IndirectPointer<Code>;
+  @ifnot(V8_CODE_POINTER_SANDBOXING) code: Code;
   shared_function_info: SharedFunctionInfo;
   context: Context;
   feedback_cell: FeedbackCell;
-  code: Code;
   // Space for the following field may or may not be allocated.
   prototype_or_initial_map: JSReceiver|Map;
 }
diff --git a/deps/v8/src/objects/js-iterator-helpers-inl.h b/deps/v8/src/objects/js-iterator-helpers-inl.h
index a9121c6a707475..b9fe02fa14b51f 100644
--- a/deps/v8/src/objects/js-iterator-helpers-inl.h
+++ b/deps/v8/src/objects/js-iterator-helpers-inl.h
@@ -6,7 +6,7 @@
 #define V8_OBJECTS_JS_ITERATOR_HELPERS_INL_H_
 
 #include "src/objects/js-iterator-helpers.h"
-#include "src/objects/objects-inl.h"
+#include "src/objects/oddball-inl.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -21,11 +21,13 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(JSIteratorMapHelper)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSIteratorFilterHelper)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSIteratorTakeHelper)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSIteratorDropHelper)
+TQ_OBJECT_CONSTRUCTORS_IMPL(JSIteratorFlatMapHelper)
 
 CAST_ACCESSOR(JSIteratorMapHelper)
 CAST_ACCESSOR(JSIteratorFilterHelper)
 CAST_ACCESSOR(JSIteratorTakeHelper)
 CAST_ACCESSOR(JSIteratorDropHelper)
+CAST_ACCESSOR(JSIteratorFlatMapHelper)
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/js-iterator-helpers.h b/deps/v8/src/objects/js-iterator-helpers.h
index ff22b5f7d96c26..3b4adb155903d5 100644
--- a/deps/v8/src/objects/js-iterator-helpers.h
+++ b/deps/v8/src/objects/js-iterator-helpers.h
@@ -13,6 +13,8 @@
 namespace v8 {
 namespace internal {
 
+class Boolean;
+
 #include "torque-generated/src/objects/js-iterator-helpers-tq.inc"
 
 // Iterator helpers are iterators that transform an underlying iterator in some
@@ -104,6 +106,18 @@ class JSIteratorDropHelper
   TQ_OBJECT_CONSTRUCTORS(JSIteratorDropHelper)
 };
 
+// The iterator helper returned by Iterator.prototype.flatMap.
+class JSIteratorFlatMapHelper
+    : public TorqueGeneratedJSIteratorFlatMapHelper<JSIteratorFlatMapHelper,
+                                                    JSIteratorHelper> {
+ public:
+  DECL_CAST(JSIteratorFlatMapHelper)
+  DECL_PRINTER(JSIteratorFlatMapHelper)
+  DECL_VERIFIER(JSIteratorFlatMapHelper)
+
+  TQ_OBJECT_CONSTRUCTORS(JSIteratorFlatMapHelper)
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/js-iterator-helpers.tq b/deps/v8/src/objects/js-iterator-helpers.tq
index 8807c4986a569c..88a3e119b6191d 100644
--- a/deps/v8/src/objects/js-iterator-helpers.tq
+++ b/deps/v8/src/objects/js-iterator-helpers.tq
@@ -24,3 +24,10 @@ extern class JSIteratorTakeHelper extends JSIteratorHelper {
 extern class JSIteratorDropHelper extends JSIteratorHelper {
   remaining: Number;
 }
+
+extern class JSIteratorFlatMapHelper extends JSIteratorHelper {
+  mapper: Callable;
+  counter: Number;
+  innerIterator: iterator::IteratorRecord;
+  innerAlive: Boolean;
+}
diff --git a/deps/v8/src/objects/js-list-format-inl.h b/deps/v8/src/objects/js-list-format-inl.h
index e7e0384c99534e..d494ebcf21fa62 100644
--- a/deps/v8/src/objects/js-list-format-inl.h
+++ b/deps/v8/src/objects/js-list-format-inl.h
@@ -23,7 +23,7 @@ namespace internal {
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSListFormat)
 
 // Base list format accessors.
-ACCESSORS(JSListFormat, icu_formatter, Managed<icu::ListFormatter>,
+ACCESSORS(JSListFormat, icu_formatter, Tagged<Managed<icu::ListFormatter>>,
           kIcuFormatterOffset)
 
 inline void JSListFormat::set_style(Style style) {
diff --git a/deps/v8/src/objects/js-list-format.cc b/deps/v8/src/objects/js-list-format.cc
index 5ce722128a4bde..d45208cccc175a 100644
--- a/deps/v8/src/objects/js-list-format.cc
+++ b/deps/v8/src/objects/js-list-format.cc
@@ -204,7 +204,7 @@ Maybe<std::vector<icu::UnicodeString>> ToUnicodeStringArray(
   std::vector<icu::UnicodeString> result;
   for (int i = 0; i < length; i++) {
     Handle<Object> item = FixedArray::get(*array, i, isolate);
-    DCHECK(item->IsString());
+    DCHECK(IsString(*item));
     Handle<String> item_str = Handle<String>::cast(item);
     if (!item_str->IsFlat()) item_str = String::Flatten(isolate, item_str);
     result.push_back(Intl::ToICUUnicodeString(isolate, item_str));
@@ -217,13 +217,13 @@ MaybeHandle<T> FormatListCommon(
     Isolate* isolate, Handle<JSListFormat> format, Handle<FixedArray> list,
     const std::function<MaybeHandle<T>(Isolate*, const icu::FormattedValue&)>&
         formatToResult) {
-  DCHECK(!list->IsUndefined());
+  DCHECK(!IsUndefined(*list));
   Maybe<std::vector<icu::UnicodeString>> maybe_array =
       ToUnicodeStringArray(isolate, list);
   MAYBE_RETURN(maybe_array, Handle<T>());
   std::vector<icu::UnicodeString> array = maybe_array.FromJust();
 
-  icu::ListFormatter* formatter = format->icu_formatter().raw();
+  icu::ListFormatter* formatter = format->icu_formatter()->raw();
   DCHECK_NOT_NULL(formatter);
 
   UErrorCode status = U_ZERO_ERROR;
diff --git a/deps/v8/src/objects/js-list-format.h b/deps/v8/src/objects/js-list-format.h
index ea68a313e24e4f..8f3651e3304525 100644
--- a/deps/v8/src/objects/js-list-format.h
+++ b/deps/v8/src/objects/js-list-format.h
@@ -59,7 +59,7 @@ class JSListFormat
   Handle<String> TypeAsString() const;
 
   // ListFormat accessors.
-  DECL_ACCESSORS(icu_formatter, Managed<icu::ListFormatter>)
+  DECL_ACCESSORS(icu_formatter, Tagged<Managed<icu::ListFormatter>>)
 
   // Style: identifying the relative time format style used.
   //
diff --git a/deps/v8/src/objects/js-locale-inl.h b/deps/v8/src/objects/js-locale-inl.h
index 49c4dc7b4f4b95..8ed7f3afe4712c 100644
--- a/deps/v8/src/objects/js-locale-inl.h
+++ b/deps/v8/src/objects/js-locale-inl.h
@@ -23,7 +23,7 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSLocale)
 
-ACCESSORS(JSLocale, icu_locale, Managed<icu::Locale>, kIcuLocaleOffset)
+ACCESSORS(JSLocale, icu_locale, Tagged<Managed<icu::Locale>>, kIcuLocaleOffset)
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/js-locale.cc b/deps/v8/src/objects/js-locale.cc
index 11eef76f498354..787b52d864640f 100644
--- a/deps/v8/src/objects/js-locale.cc
+++ b/deps/v8/src/objects/js-locale.cc
@@ -100,7 +100,7 @@ Maybe<bool> InsertOptionsIntoLocale(Isolate* isolate,
 
 Handle<Object> UnicodeKeywordValue(Isolate* isolate, Handle<JSLocale> locale,
                                    const char* key) {
-  icu::Locale* icu_locale = locale->icu_locale().raw();
+  icu::Locale* icu_locale = locale->icu_locale()->raw();
   UErrorCode status = U_ZERO_ERROR;
   std::string value =
       icu_locale->getUnicodeKeywordValue<std::string>(key, status);
@@ -411,7 +411,7 @@ MaybeHandle<JSLocale> JSLocale::Maximize(Isolate* isolate,
   // ICU has limitation on the length of the locale while addLikelySubtags
   // is called. Work around the issue by only perform addLikelySubtags
   // on the base locale and merge the extension if needed.
-  icu::Locale source(*(locale->icu_locale().raw()));
+  icu::Locale source(*(locale->icu_locale()->raw()));
   icu::Locale result = icu::Locale::createFromName(source.getBaseName());
   UErrorCode status = U_ZERO_ERROR;
   result.addLikelySubtags(status);
@@ -446,7 +446,7 @@ MaybeHandle<JSLocale> JSLocale::Minimize(Isolate* isolate,
   // ICU has limitation on the length of the locale while minimizeSubtags
   // is called. Work around the issue by only perform addLikelySubtags
   // on the base locale and merge the extension if needed.
-  icu::Locale source(*(locale->icu_locale().raw()));
+  icu::Locale source(*(locale->icu_locale()->raw()));
   icu::Locale result = icu::Locale::createFromName(source.getBaseName());
   UErrorCode status = U_ZERO_ERROR;
   result.minimizeSubtags(status);
@@ -515,9 +515,9 @@ MaybeHandle<JSArray> CalendarsForLocale(Isolate* isolate,
 
 }  // namespace
 
-MaybeHandle<JSArray> JSLocale::Calendars(Isolate* isolate,
-                                         Handle<JSLocale> locale) {
-  icu::Locale icu_locale(*(locale->icu_locale().raw()));
+MaybeHandle<JSArray> JSLocale::GetCalendars(Isolate* isolate,
+                                            Handle<JSLocale> locale) {
+  icu::Locale icu_locale(*(locale->icu_locale()->raw()));
   return CalendarsForLocale(isolate, icu_locale, true, false);
 }
 
@@ -526,19 +526,19 @@ MaybeHandle<JSArray> Intl::AvailableCalendars(Isolate* isolate) {
   return CalendarsForLocale(isolate, icu_locale, false, true);
 }
 
-MaybeHandle<JSArray> JSLocale::Collations(Isolate* isolate,
-                                          Handle<JSLocale> locale) {
-  icu::Locale icu_locale(*(locale->icu_locale().raw()));
+MaybeHandle<JSArray> JSLocale::GetCollations(Isolate* isolate,
+                                             Handle<JSLocale> locale) {
+  icu::Locale icu_locale(*(locale->icu_locale()->raw()));
   return GetKeywordValuesFromLocale<icu::Collator>(
       isolate, "collations", "co", icu_locale, Intl::RemoveCollation, true,
       true);
 }
 
-MaybeHandle<JSArray> JSLocale::HourCycles(Isolate* isolate,
-                                          Handle<JSLocale> locale) {
+MaybeHandle<JSArray> JSLocale::GetHourCycles(Isolate* isolate,
+                                             Handle<JSLocale> locale) {
   // Let preferred be loc.[[HourCycle]].
   // Let locale be loc.[[Locale]].
-  icu::Locale icu_locale(*(locale->icu_locale().raw()));
+  icu::Locale icu_locale(*(locale->icu_locale()->raw()));
   Factory* factory = isolate->factory();
 
   // Assert: locale matches the unicode_locale_id production.
@@ -593,12 +593,12 @@ MaybeHandle<JSArray> JSLocale::HourCycles(Isolate* isolate,
   return factory->NewJSArrayWithElements(fixed_array);
 }
 
-MaybeHandle<JSArray> JSLocale::NumberingSystems(Isolate* isolate,
-                                                Handle<JSLocale> locale) {
+MaybeHandle<JSArray> JSLocale::GetNumberingSystems(Isolate* isolate,
+                                                   Handle<JSLocale> locale) {
   // Let preferred be loc.[[NumberingSystem]].
 
   // Let locale be loc.[[Locale]].
-  icu::Locale icu_locale(*(locale->icu_locale().raw()));
+  icu::Locale icu_locale(*(locale->icu_locale()->raw()));
   Factory* factory = isolate->factory();
 
   // Assert: locale matches the unicode_locale_id production.
@@ -623,14 +623,14 @@ MaybeHandle<JSArray> JSLocale::NumberingSystems(Isolate* isolate,
   return factory->NewJSArrayWithElements(fixed_array);
 }
 
-MaybeHandle<Object> JSLocale::TimeZones(Isolate* isolate,
-                                        Handle<JSLocale> locale) {
+MaybeHandle<Object> JSLocale::GetTimeZones(Isolate* isolate,
+                                           Handle<JSLocale> locale) {
   // Let loc be the this value.
 
   // Perform ? RequireInternalSlot(loc, [[InitializedLocale]])
 
   // Let locale be loc.[[Locale]].
-  icu::Locale icu_locale(*(locale->icu_locale().raw()));
+  icu::Locale icu_locale(*(locale->icu_locale()->raw()));
   Factory* factory = isolate->factory();
 
   // If the unicode_language_id production of locale does not contain the
@@ -663,8 +663,8 @@ MaybeHandle<Object> JSLocale::TimeZones(Isolate* isolate,
   return Intl::ToJSArray(isolate, nullptr, enumeration.get(), nullptr, true);
 }
 
-MaybeHandle<JSObject> JSLocale::TextInfo(Isolate* isolate,
-                                         Handle<JSLocale> locale) {
+MaybeHandle<JSObject> JSLocale::GetTextInfo(Isolate* isolate,
+                                            Handle<JSLocale> locale) {
   // Let loc be the this value.
 
   // Perform ? RequireInternalSlot(loc, [[InitializedLocale]]).
@@ -678,21 +678,9 @@ MaybeHandle<JSObject> JSLocale::TextInfo(Isolate* isolate,
   Handle<JSObject> info = factory->NewJSObject(isolate->object_function());
 
   // Let dir be "ltr".
-  Handle<String> dir = factory->ltr_string();
-
-  // If the default general ordering of characters (characterOrder) within a
-  // line in the locale is right-to-left, then
-  UErrorCode status = U_ZERO_ERROR;
-  ULayoutType orientation = uloc_getCharacterOrientation(
-      (locale->icu_locale().raw())->getName(), &status);
-  if (U_FAILURE(status)) {
-    THROW_NEW_ERROR(isolate, NewRangeError(MessageTemplate::kIcuError),
-                    JSObject);
-  }
-  if (orientation == ULOC_LAYOUT_RTL) {
-    // Let dir be "rtl".
-    dir = factory->rtl_string();
-  }
+  Handle<String> dir = locale->icu_locale()->raw()->isRightToLeft()
+                           ? factory->rtl_string()
+                           : factory->ltr_string();
 
   // Perform ! CreateDataPropertyOrThrow(info, "direction", dir).
   CHECK(JSReceiver::CreateDataProperty(
@@ -703,8 +691,8 @@ MaybeHandle<JSObject> JSLocale::TextInfo(Isolate* isolate,
   return info;
 }
 
-MaybeHandle<JSObject> JSLocale::WeekInfo(Isolate* isolate,
-                                         Handle<JSLocale> locale) {
+MaybeHandle<JSObject> JSLocale::GetWeekInfo(Isolate* isolate,
+                                            Handle<JSLocale> locale) {
   // Let loc be the this value.
 
   // Perform ? RequireInternalSlot(loc, [[InitializedLocale]]).
@@ -718,7 +706,7 @@ MaybeHandle<JSObject> JSLocale::WeekInfo(Isolate* isolate,
   Handle<JSObject> info = factory->NewJSObject(isolate->object_function());
   UErrorCode status = U_ZERO_ERROR;
   std::unique_ptr<icu::Calendar> calendar(
-      icu::Calendar::createInstance(*(locale->icu_locale().raw()), status));
+      icu::Calendar::createInstance(*(locale->icu_locale()->raw()), status));
   if (U_FAILURE(status)) {
     THROW_NEW_ERROR(isolate, NewRangeError(MessageTemplate::kIcuError),
                     JSObject);
@@ -777,28 +765,28 @@ MaybeHandle<JSObject> JSLocale::WeekInfo(Isolate* isolate,
 
 Handle<Object> JSLocale::Language(Isolate* isolate, Handle<JSLocale> locale) {
   Factory* factory = isolate->factory();
-  const char* language = locale->icu_locale().raw()->getLanguage();
+  const char* language = locale->icu_locale()->raw()->getLanguage();
   if (strlen(language) == 0) return factory->undefined_value();
   return factory->NewStringFromAsciiChecked(language);
 }
 
 Handle<Object> JSLocale::Script(Isolate* isolate, Handle<JSLocale> locale) {
   Factory* factory = isolate->factory();
-  const char* script = locale->icu_locale().raw()->getScript();
+  const char* script = locale->icu_locale()->raw()->getScript();
   if (strlen(script) == 0) return factory->undefined_value();
   return factory->NewStringFromAsciiChecked(script);
 }
 
 Handle<Object> JSLocale::Region(Isolate* isolate, Handle<JSLocale> locale) {
   Factory* factory = isolate->factory();
-  const char* region = locale->icu_locale().raw()->getCountry();
+  const char* region = locale->icu_locale()->raw()->getCountry();
   if (strlen(region) == 0) return factory->undefined_value();
   return factory->NewStringFromAsciiChecked(region);
 }
 
 Handle<String> JSLocale::BaseName(Isolate* isolate, Handle<JSLocale> locale) {
   icu::Locale icu_locale =
-      icu::Locale::createFromName(locale->icu_locale().raw()->getBaseName());
+      icu::Locale::createFromName(locale->icu_locale()->raw()->getBaseName());
   std::string base_name = Intl::ToLanguageTag(icu_locale).FromJust();
   return isolate->factory()->NewStringFromAsciiChecked(base_name.c_str());
 }
@@ -821,11 +809,11 @@ Handle<Object> JSLocale::HourCycle(Isolate* isolate, Handle<JSLocale> locale) {
 
 Handle<Object> JSLocale::Numeric(Isolate* isolate, Handle<JSLocale> locale) {
   Factory* factory = isolate->factory();
-  icu::Locale* icu_locale = locale->icu_locale().raw();
+  icu::Locale* icu_locale = locale->icu_locale()->raw();
   UErrorCode status = U_ZERO_ERROR;
   std::string numeric =
       icu_locale->getUnicodeKeywordValue<std::string>("kn", status);
-  return (numeric == "true") ? factory->true_value() : factory->false_value();
+  return factory->ToBoolean(numeric == "true");
 }
 
 Handle<Object> JSLocale::NumberingSystem(Isolate* isolate,
@@ -834,7 +822,7 @@ Handle<Object> JSLocale::NumberingSystem(Isolate* isolate,
 }
 
 std::string JSLocale::ToString(Handle<JSLocale> locale) {
-  icu::Locale* icu_locale = locale->icu_locale().raw();
+  icu::Locale* icu_locale = locale->icu_locale()->raw();
   return Intl::ToLanguageTag(*icu_locale).FromJust();
 }
 
diff --git a/deps/v8/src/objects/js-locale.h b/deps/v8/src/objects/js-locale.h
index 5f57dca51693a0..0aa94a3509c388 100644
--- a/deps/v8/src/objects/js-locale.h
+++ b/deps/v8/src/objects/js-locale.h
@@ -40,19 +40,19 @@ class JSLocale : public TorqueGeneratedJSLocale<JSLocale, JSObject> {
   static MaybeHandle<JSLocale> Minimize(Isolate* isolate,
                                         Handle<JSLocale> locale);
 
-  V8_WARN_UNUSED_RESULT static MaybeHandle<JSArray> Calendars(
+  V8_WARN_UNUSED_RESULT static MaybeHandle<JSArray> GetCalendars(
       Isolate* isolate, Handle<JSLocale> locale);
-  V8_WARN_UNUSED_RESULT static MaybeHandle<JSArray> Collations(
+  V8_WARN_UNUSED_RESULT static MaybeHandle<JSArray> GetCollations(
       Isolate* isolate, Handle<JSLocale> locale);
-  V8_WARN_UNUSED_RESULT static MaybeHandle<JSArray> HourCycles(
+  V8_WARN_UNUSED_RESULT static MaybeHandle<JSArray> GetHourCycles(
       Isolate* isolate, Handle<JSLocale> locale);
-  V8_WARN_UNUSED_RESULT static MaybeHandle<JSArray> NumberingSystems(
+  V8_WARN_UNUSED_RESULT static MaybeHandle<JSArray> GetNumberingSystems(
       Isolate* isolate, Handle<JSLocale> locale);
-  V8_WARN_UNUSED_RESULT static MaybeHandle<JSObject> TextInfo(
+  V8_WARN_UNUSED_RESULT static MaybeHandle<JSObject> GetTextInfo(
       Isolate* isolate, Handle<JSLocale> locale);
-  V8_WARN_UNUSED_RESULT static MaybeHandle<Object> TimeZones(
+  V8_WARN_UNUSED_RESULT static MaybeHandle<Object> GetTimeZones(
       Isolate* isolate, Handle<JSLocale> locale);
-  V8_WARN_UNUSED_RESULT static MaybeHandle<JSObject> WeekInfo(
+  V8_WARN_UNUSED_RESULT static MaybeHandle<JSObject> GetWeekInfo(
       Isolate* isolate, Handle<JSLocale> locale);
 
   static Handle<Object> Language(Isolate* isolate, Handle<JSLocale> locale);
@@ -79,7 +79,7 @@ class JSLocale : public TorqueGeneratedJSLocale<JSLocale, JSObject> {
   // Help function to check well-formed "3alpha"
   static bool Is3Alpha(const std::string& value);
 
-  DECL_ACCESSORS(icu_locale, Managed<icu::Locale>)
+  DECL_ACCESSORS(icu_locale, Tagged<Managed<icu::Locale>>)
 
   DECL_PRINTER(JSLocale)
 
diff --git a/deps/v8/src/objects/js-number-format-inl.h b/deps/v8/src/objects/js-number-format-inl.h
index cddc93afd27408..204d6f331f0a16 100644
--- a/deps/v8/src/objects/js-number-format-inl.h
+++ b/deps/v8/src/objects/js-number-format-inl.h
@@ -23,7 +23,7 @@ namespace internal {
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSNumberFormat)
 
 ACCESSORS(JSNumberFormat, icu_number_formatter,
-          Managed<icu::number::LocalizedNumberFormatter>,
+          Tagged<Managed<icu::number::LocalizedNumberFormatter>>,
           kIcuNumberFormatterOffset)
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/js-number-format.cc b/deps/v8/src/objects/js-number-format.cc
index 42b85cb6624c60..4f0ef31806314b 100644
--- a/deps/v8/src/objects/js-number-format.cc
+++ b/deps/v8/src/objects/js-number-format.cc
@@ -106,31 +106,6 @@ enum class SignDisplay {
   NEGATIVE,
 };
 
-// [[RoundingMode]] is one of the String values "ceil", "floor", "expand",
-// "trunc", "halfCeil", "halfFloor", "halfExpand", "halfTrunc", or "halfEven",
-// specifying the rounding strategy for the number.
-// Note: To avoid name conflict with RoundingMode defined in other places,
-// prefix with Intl as IntlRoundingMode
-enum class IntlRoundingMode {
-  CEIL,
-  FLOOR,
-  EXPAND,
-  TRUNC,
-  HALF_CEIL,
-  HALF_FLOOR,
-  HALF_EXPAND,
-  HALF_TRUNC,
-  HALF_EVEN,
-};
-
-// [[TrailingZeroDisplay]] is one of the String values "auto" or
-// "stripIfInteger", specifying the strategy for displaying trailing zeros on
-// whole number.
-enum class TrailingZeroDisplay {
-  AUTO,
-  STRIP_IF_INTEGER,
-};
-
 // [[UseGrouping]] is ....
 enum class UseGrouping {
   OFF,
@@ -216,25 +191,25 @@ icu::number::Notation ToICUNotation(Notation notation,
 }
 
 UNumberFormatRoundingMode ToUNumberFormatRoundingMode(
-    IntlRoundingMode rounding_mode) {
+    Intl::RoundingMode rounding_mode) {
   switch (rounding_mode) {
-    case IntlRoundingMode::CEIL:
+    case Intl::RoundingMode::kCeil:
       return UNumberFormatRoundingMode::UNUM_ROUND_CEILING;
-    case IntlRoundingMode::FLOOR:
+    case Intl::RoundingMode::kFloor:
       return UNumberFormatRoundingMode::UNUM_ROUND_FLOOR;
-    case IntlRoundingMode::EXPAND:
+    case Intl::RoundingMode::kExpand:
       return UNumberFormatRoundingMode::UNUM_ROUND_UP;
-    case IntlRoundingMode::TRUNC:
+    case Intl::RoundingMode::kTrunc:
       return UNumberFormatRoundingMode::UNUM_ROUND_DOWN;
-    case IntlRoundingMode::HALF_CEIL:
+    case Intl::RoundingMode::kHalfCeil:
       return UNumberFormatRoundingMode::UNUM_ROUND_HALF_CEILING;
-    case IntlRoundingMode::HALF_FLOOR:
+    case Intl::RoundingMode::kHalfFloor:
       return UNumberFormatRoundingMode::UNUM_ROUND_HALF_FLOOR;
-    case IntlRoundingMode::HALF_EXPAND:
+    case Intl::RoundingMode::kHalfExpand:
       return UNumberFormatRoundingMode::UNUM_ROUND_HALFUP;
-    case IntlRoundingMode::HALF_TRUNC:
+    case Intl::RoundingMode::kHalfTrunc:
       return UNumberFormatRoundingMode::UNUM_ROUND_HALFDOWN;
-    case IntlRoundingMode::HALF_EVEN:
+    case Intl::RoundingMode::kHalfEven:
       return UNumberFormatRoundingMode::UNUM_ROUND_HALFEVEN;
   }
 }
@@ -413,11 +388,6 @@ Handle<String> CurrencyDisplayString(Isolate* isolate,
   return ReadOnlyRoots(isolate).symbol_string_handle();
 }
 
-// Return true if there are no "group-off" in the skeleton.
-bool UseGroupingFromSkeleton(const icu::UnicodeString& skeleton) {
-  return skeleton.indexOf("group-off") == -1;
-}
-
 Handle<Object> UseGroupingFromSkeleton(Isolate* isolate,
                                        const icu::UnicodeString& skeleton) {
   Factory* factory = isolate->factory();
@@ -848,35 +818,15 @@ Style StyleFromSkeleton(const icu::UnicodeString& skeleton) {
   return Style::DECIMAL;
 }
 
-icu::number::UnlocalizedNumberFormatter SetDigitOptionsToFormatterV2(
+}  // anonymous namespace
+
+icu::number::UnlocalizedNumberFormatter
+JSNumberFormat::SetDigitOptionsToFormatter(
     const icu::number::UnlocalizedNumberFormatter& settings,
     const Intl::NumberFormatDigitOptions& digit_options) {
-  icu::number::UnlocalizedNumberFormatter result = settings;
-  if (digit_options.minimum_integer_digits > 1) {
-    result = result.integerWidth(icu::number::IntegerWidth::zeroFillTo(
-        digit_options.minimum_integer_digits));
-  }
-
-  if (digit_options.rounding_type == Intl::RoundingType::kMorePrecision) {
-    return result;
-  }
-  icu::number::Precision precision =
-      (digit_options.minimum_significant_digits > 0)
-          ? icu::number::Precision::minMaxSignificantDigits(
-                digit_options.minimum_significant_digits,
-                digit_options.maximum_significant_digits)
-          : icu::number::Precision::minMaxFraction(
-                digit_options.minimum_fraction_digits,
-                digit_options.maximum_fraction_digits);
+  icu::number::UnlocalizedNumberFormatter result = settings.roundingMode(
+      ToUNumberFormatRoundingMode(digit_options.rounding_mode));
 
-  return result.precision(precision);
-}
-
-icu::number::UnlocalizedNumberFormatter SetDigitOptionsToFormatterV3(
-    const icu::number::UnlocalizedNumberFormatter& settings,
-    const Intl::NumberFormatDigitOptions& digit_options, int rounding_increment,
-    JSNumberFormat::ShowTrailingZeros trailing_zeros) {
-  icu::number::UnlocalizedNumberFormatter result = settings;
   if (digit_options.minimum_integer_digits > 1) {
     result = result.integerWidth(icu::number::IntegerWidth::zeroFillTo(
         digit_options.minimum_integer_digits));
@@ -909,32 +859,19 @@ icu::number::UnlocalizedNumberFormatter SetDigitOptionsToFormatterV3(
                                              : UNUM_ROUNDING_PRIORITY_STRICT);
       break;
   }
-  if (rounding_increment != 1) {
+  if (digit_options.rounding_increment != 1) {
     precision = ::icu::number::Precision::incrementExact(
-                    rounding_increment, -digit_options.maximum_fraction_digits)
+                    digit_options.rounding_increment,
+                    -digit_options.maximum_fraction_digits)
                     .withMinFraction(digit_options.minimum_fraction_digits);
   }
-  if (trailing_zeros == JSNumberFormat::ShowTrailingZeros::kHide) {
+  if (digit_options.trailing_zero_display ==
+      Intl::TrailingZeroDisplay::kStripIfInteger) {
     precision = precision.trailingZeroDisplay(UNUM_TRAILING_ZERO_HIDE_IF_WHOLE);
   }
   return result.precision(precision);
 }
 
-}  // anonymous namespace
-
-icu::number::UnlocalizedNumberFormatter
-JSNumberFormat::SetDigitOptionsToFormatter(
-    const icu::number::UnlocalizedNumberFormatter& settings,
-    const Intl::NumberFormatDigitOptions& digit_options, int rounding_increment,
-    JSNumberFormat::ShowTrailingZeros trailing_zeros) {
-  if (v8_flags.harmony_intl_number_format_v3) {
-    return SetDigitOptionsToFormatterV3(settings, digit_options,
-                                        rounding_increment, trailing_zeros);
-  } else {
-    return SetDigitOptionsToFormatterV2(settings, digit_options);
-  }
-}
-
 // static
 // ecma402 #sec-intl.numberformat.prototype.resolvedoptions
 Handle<JSObject> JSNumberFormat::ResolvedOptions(
@@ -943,7 +880,7 @@ Handle<JSObject> JSNumberFormat::ResolvedOptions(
 
   UErrorCode status = U_ZERO_ERROR;
   icu::number::LocalizedNumberFormatter* fmt =
-      number_format->icu_number_formatter().raw();
+      number_format->icu_number_formatter()->raw();
   icu::UnicodeString skeleton = fmt->toSkeleton(status);
   DCHECK(U_SUCCESS(status));
 
@@ -973,8 +910,6 @@ Handle<JSObject> JSNumberFormat::ResolvedOptions(
   //    [[Notation]]                    "notation"
   //    [[CompactDisplay]]              "compactDisplay"
   //    [[SignDisplay]]                 "signDisplay"
-  //
-  // For v3
   //    [[RoundingMode]]                "roundingMode"
   //    [[RoundingIncrement]]           "roundingIncrement"
   //    [[TrailingZeroDisplay]]         "trailingZeroDisplay"
@@ -1049,32 +984,22 @@ Handle<JSObject> JSNumberFormat::ResolvedOptions(
               factory->NewNumberFromInt(mxsd), Just(kDontThrow))
               .FromJust());
   }
-  if ((v8_flags.harmony_intl_number_format_v3 || !has_significant_digits)) {
-    if (FractionDigitsFromSkeleton(skeleton, &mnfd, &mxfd)) {
-      CHECK(JSReceiver::CreateDataProperty(
-                isolate, options, factory->minimumFractionDigits_string(),
-                factory->NewNumberFromInt(mnfd), Just(kDontThrow))
-                .FromJust());
-      CHECK(JSReceiver::CreateDataProperty(
-                isolate, options, factory->maximumFractionDigits_string(),
-                factory->NewNumberFromInt(mxfd), Just(kDontThrow))
-                .FromJust());
-    }
-  }
-
-  if (v8_flags.harmony_intl_number_format_v3) {
+  if (FractionDigitsFromSkeleton(skeleton, &mnfd, &mxfd)) {
     CHECK(JSReceiver::CreateDataProperty(
-              isolate, options, factory->useGrouping_string(),
-              UseGroupingFromSkeleton(isolate, skeleton), Just(kDontThrow))
+              isolate, options, factory->minimumFractionDigits_string(),
+              factory->NewNumberFromInt(mnfd), Just(kDontThrow))
               .FromJust());
-  } else {
     CHECK(JSReceiver::CreateDataProperty(
-              isolate, options, factory->useGrouping_string(),
-              factory->ToBoolean(UseGroupingFromSkeleton(skeleton)),
-              Just(kDontThrow))
+              isolate, options, factory->maximumFractionDigits_string(),
+              factory->NewNumberFromInt(mxfd), Just(kDontThrow))
               .FromJust());
   }
 
+  CHECK(JSReceiver::CreateDataProperty(
+            isolate, options, factory->useGrouping_string(),
+            UseGroupingFromSkeleton(isolate, skeleton), Just(kDontThrow))
+            .FromJust());
+
   Notation notation = NotationFromSkeleton(skeleton);
   CHECK(JSReceiver::CreateDataProperty(
             isolate, options, factory->notation_string(),
@@ -1091,24 +1016,22 @@ Handle<JSObject> JSNumberFormat::ResolvedOptions(
             isolate, options, factory->signDisplay_string(),
             SignDisplayString(isolate, skeleton), Just(kDontThrow))
             .FromJust());
-  if (v8_flags.harmony_intl_number_format_v3) {
-    CHECK(JSReceiver::CreateDataProperty(
-              isolate, options, factory->roundingMode_string(),
-              RoundingModeString(isolate, skeleton), Just(kDontThrow))
-              .FromJust());
-    CHECK(JSReceiver::CreateDataProperty(
-              isolate, options, factory->roundingIncrement_string(),
-              RoundingIncrement(isolate, skeleton), Just(kDontThrow))
-              .FromJust());
-    CHECK(JSReceiver::CreateDataProperty(
-              isolate, options, factory->trailingZeroDisplay_string(),
-              TrailingZeroDisplayString(isolate, skeleton), Just(kDontThrow))
-              .FromJust());
-    CHECK(JSReceiver::CreateDataProperty(
-              isolate, options, factory->roundingPriority_string(),
-              RoundingPriorityString(isolate, skeleton), Just(kDontThrow))
-              .FromJust());
-  }
+  CHECK(JSReceiver::CreateDataProperty(
+            isolate, options, factory->roundingMode_string(),
+            RoundingModeString(isolate, skeleton), Just(kDontThrow))
+            .FromJust());
+  CHECK(JSReceiver::CreateDataProperty(
+            isolate, options, factory->roundingIncrement_string(),
+            RoundingIncrement(isolate, skeleton), Just(kDontThrow))
+            .FromJust());
+  CHECK(JSReceiver::CreateDataProperty(
+            isolate, options, factory->roundingPriority_string(),
+            RoundingPriorityString(isolate, skeleton), Just(kDontThrow))
+            .FromJust());
+  CHECK(JSReceiver::CreateDataProperty(
+            isolate, options, factory->trailingZeroDisplay_string(),
+            TrailingZeroDisplayString(isolate, skeleton), Just(kDontThrow))
+            .FromJust());
   return options;
 }
 
@@ -1118,18 +1041,18 @@ MaybeHandle<JSNumberFormat> JSNumberFormat::UnwrapNumberFormat(
   // old code copy from NumberFormat::Unwrap that has no spec comment and
   // compiled but fail unit tests.
   Handle<Context> native_context =
-      Handle<Context>(isolate->context().native_context(), isolate);
+      Handle<Context>(isolate->context()->native_context(), isolate);
   Handle<JSFunction> constructor = Handle<JSFunction>(
       JSFunction::cast(native_context->intl_number_format_function()), isolate);
   Handle<Object> object;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, object,
       Intl::LegacyUnwrapReceiver(isolate, format_holder, constructor,
-                                 format_holder->IsJSNumberFormat()),
+                                 IsJSNumberFormat(*format_holder)),
       JSNumberFormat);
   // 4. If ... or nf does not have an [[InitializedNumberFormat]] internal slot,
   // then
-  if (!object->IsJSNumberFormat()) {
+  if (!IsJSNumberFormat(*object)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kIncompatibleMethodReceiver,
@@ -1141,14 +1064,6 @@ MaybeHandle<JSNumberFormat> JSNumberFormat::UnwrapNumberFormat(
   return Handle<JSNumberFormat>::cast(object);
 }
 
-// 22. is in « 1, 2, 5, 10, 20, 25, 50, 100, 200, 250, 500, 1000, 2000, 2500,
-// 5000 »
-bool IsValidRoundingIncrement(int value) {
-  return value == 1 || value == 2 || value == 5 || value == 10 || value == 20 ||
-         value == 25 || value == 50 || value == 100 || value == 200 ||
-         value == 250 || value == 500 || value == 1000 || value == 2000 ||
-         value == 2500 || value == 5000;
-}
 // static
 MaybeHandle<JSNumberFormat> JSNumberFormat::New(Isolate* isolate,
                                                 Handle<Map> map,
@@ -1442,30 +1357,6 @@ MaybeHandle<JSNumberFormat> JSNumberFormat::New(Isolate* isolate,
     }
   }
 
-  int rounding_increment = 1;
-  if (v8_flags.harmony_intl_number_format_v3) {
-    // 18. Let roundingIncrement be ? GetNumberOption(options,
-    // "roundingIncrement,", 1, 5000, 1).
-    Maybe<int> maybe_rounding_increment = GetNumberOption(
-        isolate, options, factory->roundingIncrement_string(), 1, 5000, 1);
-    if (!maybe_rounding_increment.To(&rounding_increment)) {
-      return MaybeHandle<JSNumberFormat>();
-    }
-
-    // 19. If roundingIncrement is not in « 1, 2, 5, 10, 20, 25, 50, 100, 200,
-    // 250, 500, 1000, 2000, 2500, 5000 », throw a RangeError exception.
-    if (!IsValidRoundingIncrement(rounding_increment)) {
-      THROW_NEW_ERROR(isolate,
-                      NewRangeError(MessageTemplate::kPropertyValueOutOfRange,
-                                    factory->roundingIncrement_string()),
-                      JSNumberFormat);
-    }
-    // 20. If roundingIncrement is not 1, set mxfdDefault to mnfdDefault.
-    if (rounding_increment != 1) {
-      mxfd_default = mnfd_default;
-    }
-  }
-
   Notation notation = Notation::STANDARD;
   // 21. Let notation be ? GetOption(options, "notation", "string", «
   // "standard", "scientific",  "engineering", "compact" », "standard").
@@ -1485,56 +1376,20 @@ MaybeHandle<JSNumberFormat> JSNumberFormat::New(Isolate* isolate,
   Maybe<Intl::NumberFormatDigitOptions> maybe_digit_options =
       Intl::SetNumberFormatDigitOptions(isolate, options, mnfd_default,
                                         mxfd_default,
-                                        notation == Notation::COMPACT);
+                                        notation == Notation::COMPACT, service);
   MAYBE_RETURN(maybe_digit_options, Handle<JSNumberFormat>());
   Intl::NumberFormatDigitOptions digit_options = maybe_digit_options.FromJust();
 
-  if (v8_flags.harmony_intl_number_format_v3) {
-    // 24. If roundingIncrement is not 1, then
-    if (rounding_increment != 1) {
-      // a. If numberFormat.[[RoundingType]] is not fractionDigits, throw a
-      // TypeError exception.
-      if (digit_options.rounding_type != Intl::RoundingType::kFractionDigits) {
-        THROW_NEW_ERROR(isolate,
-                        NewTypeError(MessageTemplate::kBadRoundingType),
-                        JSNumberFormat);
-      }
-      // b. If numberFormat.[[MaximumFractionDigits]] is not equal to
-      // numberFormat.[[MinimumFractionDigits]], throw a RangeError exception.
-      if (digit_options.maximum_fraction_digits !=
-          digit_options.minimum_fraction_digits) {
-        THROW_NEW_ERROR(
-            isolate,
-            NewRangeError(
-                MessageTemplate::
-                    kMaximumFractionDigitsNotEqualMinimumFractionDigits),
-            JSNumberFormat);
-      }
-    }
-
-    // 25. Set numberFormat.[[RoundingIncrement]] to roundingIncrement.
-
-    // 26. Let trailingZeroDisplay be ? GetOption(options,
-    // "trailingZeroDisplay", "string", « "auto", "stripIfInteger" », "auto").
-    Maybe<TrailingZeroDisplay> maybe_trailing_zero_display =
-        GetStringOption<TrailingZeroDisplay>(
-            isolate, options, "trailingZeroDisplay", service,
-            {"auto", "stripIfInteger"},
-            {TrailingZeroDisplay::AUTO, TrailingZeroDisplay::STRIP_IF_INTEGER},
-            TrailingZeroDisplay::AUTO);
-    MAYBE_RETURN(maybe_trailing_zero_display, MaybeHandle<JSNumberFormat>());
-    TrailingZeroDisplay trailing_zero_display =
-        maybe_trailing_zero_display.FromJust();
-
-    // 27. Set numberFormat.[[TrailingZeroDisplay]] to trailingZeroDisplay.
-    settings = SetDigitOptionsToFormatterV3(
-        settings, digit_options, rounding_increment,
-        trailing_zero_display == TrailingZeroDisplay::STRIP_IF_INTEGER
-            ? ShowTrailingZeros::kHide
-            : ShowTrailingZeros::kShow);
-  } else {
-    settings = SetDigitOptionsToFormatterV2(settings, digit_options);
+  // 13. If roundingIncrement is not 1, set mxfdDefault to mnfdDefault.
+  if (digit_options.rounding_increment != 1) {
+    mxfd_default = mnfd_default;
   }
+  // 14. Set intlObj.[[RoundingIncrement]] to roundingIncrement.
+
+  // 15. Set intlObj.[[RoundingMode]] to roundingMode.
+
+  // 16. Set intlObj.[[TrailingZeroDisplay]] to trailingZeroDisplay.
+  settings = SetDigitOptionsToFormatter(settings, digit_options);
 
   // 28. Let compactDisplay be ? GetOption(options, "compactDisplay",
   // "string", « "short", "long" »,  "short").
@@ -1550,67 +1405,41 @@ MaybeHandle<JSNumberFormat> JSNumberFormat::New(Isolate* isolate,
     settings = settings.notation(ToICUNotation(notation, compact_display));
   }
 
-  if (!v8_flags.harmony_intl_number_format_v3) {
-    // 30. Let useGrouping be ? GetOption(options, "useGrouping", "boolean",
-    // undefined, true).
-    bool use_grouping = true;
-    Maybe<bool> found_use_grouping =
-        GetBoolOption(isolate, options, "useGrouping", service, &use_grouping);
-    MAYBE_RETURN(found_use_grouping, MaybeHandle<JSNumberFormat>());
-    // 31. Set numberFormat.[[UseGrouping]] to useGrouping.
-    if (!use_grouping) {
-      settings = settings.grouping(UNumberGroupingStrategy::UNUM_GROUPING_OFF);
-    }
-    settings = JSNumberFormat::SetDigitOptionsToFormatter(
-        settings, digit_options, 1, ShowTrailingZeros::kShow);
-  } else {
-    // 28. Let defaultUseGrouping be "auto".
-    UseGrouping default_use_grouping = UseGrouping::AUTO;
+  // 28. Let defaultUseGrouping be "auto".
+  UseGrouping default_use_grouping = UseGrouping::AUTO;
 
-    // 29. If notation is "compact", then
-    if (notation == Notation::COMPACT) {
-      // a. Set numberFormat.[[CompactDisplay]] to compactDisplay.
-      // Done in above together
-      // b. Set defaultUseGrouping to "min2".
-      default_use_grouping = UseGrouping::MIN2;
-    }
-
-    // 30. Let useGrouping be ? GetStringOrBooleanOption(options, "useGrouping",
-    // « "min2", "auto", "always" », "always", false, defaultUseGrouping).
-    Maybe<UseGrouping> maybe_use_grouping =
-        GetStringOrBooleanOption<UseGrouping>(
-            isolate, options, "useGrouping", service,
-            {"min2", "auto", "always"},
-            {UseGrouping::MIN2, UseGrouping::AUTO, UseGrouping::ALWAYS},
-            UseGrouping::ALWAYS,    // trueValue
-            UseGrouping::OFF,       // falseValue
-            default_use_grouping);  // fallbackValue
-    MAYBE_RETURN(maybe_use_grouping, MaybeHandle<JSNumberFormat>());
-    UseGrouping use_grouping = maybe_use_grouping.FromJust();
-    // 31. Set numberFormat.[[UseGrouping]] to useGrouping.
-    if (use_grouping != UseGrouping::AUTO) {
-      settings = settings.grouping(ToUNumberGroupingStrategy(use_grouping));
-    }
+  // 29. If notation is "compact", then
+  if (notation == Notation::COMPACT) {
+    // a. Set numberFormat.[[CompactDisplay]] to compactDisplay.
+    // Done in above together
+    // b. Set defaultUseGrouping to "min2".
+    default_use_grouping = UseGrouping::MIN2;
+  }
+
+  // 30. Let useGrouping be ? GetStringOrBooleanOption(options, "useGrouping",
+  // « "min2", "auto", "always" », "always", false, defaultUseGrouping).
+  Maybe<UseGrouping> maybe_use_grouping = GetStringOrBooleanOption<UseGrouping>(
+      isolate, options, "useGrouping", service, {"min2", "auto", "always"},
+      {UseGrouping::MIN2, UseGrouping::AUTO, UseGrouping::ALWAYS},
+      UseGrouping::ALWAYS,    // trueValue
+      UseGrouping::OFF,       // falseValue
+      default_use_grouping);  // fallbackValue
+  MAYBE_RETURN(maybe_use_grouping, MaybeHandle<JSNumberFormat>());
+  UseGrouping use_grouping = maybe_use_grouping.FromJust();
+  // 31. Set numberFormat.[[UseGrouping]] to useGrouping.
+  if (use_grouping != UseGrouping::AUTO) {
+    settings = settings.grouping(ToUNumberGroupingStrategy(use_grouping));
   }
 
   // 32. Let signDisplay be ? GetOption(options, "signDisplay", "string", «
   // "auto", "never", "always",  "exceptZero", "negative" », "auto").
   Maybe<SignDisplay> maybe_sign_display = Nothing<SignDisplay>();
-  if (v8_flags.harmony_intl_number_format_v3) {
-    maybe_sign_display = GetStringOption<SignDisplay>(
-        isolate, options, "signDisplay", service,
-        {"auto", "never", "always", "exceptZero", "negative"},
-        {SignDisplay::AUTO, SignDisplay::NEVER, SignDisplay::ALWAYS,
-         SignDisplay::EXCEPT_ZERO, SignDisplay::NEGATIVE},
-        SignDisplay::AUTO);
-  } else {
-    maybe_sign_display = GetStringOption<SignDisplay>(
-        isolate, options, "signDisplay", service,
-        {"auto", "never", "always", "exceptZero"},
-        {SignDisplay::AUTO, SignDisplay::NEVER, SignDisplay::ALWAYS,
-         SignDisplay::EXCEPT_ZERO},
-        SignDisplay::AUTO);
-  }
+  maybe_sign_display = GetStringOption<SignDisplay>(
+      isolate, options, "signDisplay", service,
+      {"auto", "never", "always", "exceptZero", "negative"},
+      {SignDisplay::AUTO, SignDisplay::NEVER, SignDisplay::ALWAYS,
+       SignDisplay::EXCEPT_ZERO, SignDisplay::NEGATIVE},
+      SignDisplay::AUTO);
   MAYBE_RETURN(maybe_sign_display, MaybeHandle<JSNumberFormat>());
   SignDisplay sign_display = maybe_sign_display.FromJust();
 
@@ -1623,28 +1452,6 @@ MaybeHandle<JSNumberFormat> JSNumberFormat::New(Isolate* isolate,
     settings = settings.sign(ToUNumberSignDisplay(sign_display, currency_sign));
   }
 
-  if (v8_flags.harmony_intl_number_format_v3) {
-    // X. Let roundingMode be ? GetOption(options, "roundingMode", "string",
-    // « "ceil", "floor", "expand", "trunc", "halfCeil", "halfFloor",
-    // "halfExpand", "halfTrunc", "halfEven" »,
-    // "halfExpand").
-    Maybe<IntlRoundingMode> maybe_rounding_mode =
-        GetStringOption<IntlRoundingMode>(
-            isolate, options, "roundingMode", service,
-            {"ceil", "floor", "expand", "trunc", "halfCeil", "halfFloor",
-             "halfExpand", "halfTrunc", "halfEven"},
-            {IntlRoundingMode::CEIL, IntlRoundingMode::FLOOR,
-             IntlRoundingMode::EXPAND, IntlRoundingMode::TRUNC,
-             IntlRoundingMode::HALF_CEIL, IntlRoundingMode::HALF_FLOOR,
-             IntlRoundingMode::HALF_EXPAND, IntlRoundingMode::HALF_TRUNC,
-             IntlRoundingMode::HALF_EVEN},
-            IntlRoundingMode::HALF_EXPAND);
-    MAYBE_RETURN(maybe_rounding_mode, MaybeHandle<JSNumberFormat>());
-    IntlRoundingMode rounding_mode = maybe_rounding_mode.FromJust();
-    settings =
-        settings.roundingMode(ToUNumberFormatRoundingMode(rounding_mode));
-  }
-
   // 25. Let dataLocaleData be localeData.[[<dataLocale>]].
   //
   // 26. Let patterns be dataLocaleData.[[patterns]].
@@ -1700,17 +1507,17 @@ icu::number::FormattedNumber FormatDecimalString(
 
 }  // namespace
 
-bool IntlMathematicalValue::IsNaN() const { return value_->IsNaN(); }
+bool IntlMathematicalValue::IsNaN() const { return i::IsNaN(*value_); }
 
 MaybeHandle<String> IntlMathematicalValue::ToString(Isolate* isolate) const {
   Handle<String> string;
-  if (value_->IsNumber()) {
+  if (IsNumber(*value_)) {
     return isolate->factory()->NumberToString(value_);
   }
-  if (value_->IsBigInt()) {
+  if (IsBigInt(*value_)) {
     return BigInt::ToString(isolate, Handle<BigInt>::cast(value_));
   }
-  DCHECK(value_->IsString());
+  DCHECK(IsString(*value_));
   return Handle<String>::cast(value_);
 }
 
@@ -1722,7 +1529,7 @@ Maybe<icu::number::FormattedNumber> IcuFormatNumber(
   icu::number::FormattedNumber formatted;
   // If it is BigInt, handle it differently.
   UErrorCode status = U_ZERO_ERROR;
-  if (numeric_obj->IsBigInt()) {
+  if (IsBigInt(*numeric_obj)) {
     Handle<BigInt> big_int = Handle<BigInt>::cast(numeric_obj);
     Handle<String> big_int_string;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, big_int_string,
@@ -1737,7 +1544,7 @@ Maybe<icu::number::FormattedNumber> IcuFormatNumber(
         reinterpret_cast<const char*>(flat.ToOneByteVector().begin());
     formatted = number_format.formatDecimal({char_buffer, length}, status);
   } else {
-    if (v8_flags.harmony_intl_number_format_v3 && numeric_obj->IsString()) {
+    if (IsString(*numeric_obj)) {
       // TODO(ftang) Correct the handling of string after the resolution of
       // https://github.com/tc39/proposal-intl-numberformat-v3/pull/82
       Handle<String> string =
@@ -1759,9 +1566,9 @@ Maybe<icu::number::FormattedNumber> IcuFormatNumber(
             {string->ToCString().get(), string->length()}, status);
       }
     } else {
-      double number = numeric_obj->IsNaN()
+      double number = IsNaN(*numeric_obj)
                           ? std::numeric_limits<double>::quiet_NaN()
-                          : numeric_obj->Number();
+                          : Object::Number(*numeric_obj);
       formatted = number_format.formatDouble(number, status);
     }
   }
@@ -1781,7 +1588,7 @@ Maybe<icu::number::FormattedNumber> IntlMathematicalValue::FormatNumeric(
     Isolate* isolate,
     const icu::number::LocalizedNumberFormatter& number_format,
     const IntlMathematicalValue& x) {
-  if (x.value_->IsString()) {
+  if (IsString(*x.value_)) {
     Handle<String> string;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, string, x.ToString(isolate),
                                      Nothing<icu::number::FormattedNumber>());
@@ -1795,7 +1602,7 @@ Maybe<icu::number::FormattedNumber> IntlMathematicalValue::FormatNumeric(
     }
     return Just(std::move(result));
   }
-  CHECK(x.value_->IsNumber() || x.value_->IsBigInt());
+  CHECK(IsNumber(*x.value_) || IsBigInt(*x.value_));
   return IcuFormatNumber(isolate, number_format, x.value_);
 }
 
@@ -1831,7 +1638,7 @@ namespace {
 // and the index of the start of trailing white space or line terminator.
 template <typename Char>
 std::pair<int, int> FindLeadingAndTrailingWhiteSpaceOrLineTerminator(
-    const base::Vector<const Char>& src) {
+    base::Vector<const Char> src) {
   size_t leading_end = 0;
 
   // Find the length of leading StrWhiteSpaceChar.
@@ -1881,7 +1688,7 @@ Maybe<IntlMathematicalValue> IntlMathematicalValue::From(Isolate* isolate,
   Factory* factory = isolate->factory();
   // 1. Let primValue be ? ToPrimitive(value, number).
   Handle<Object> prim_value;
-  if (value->IsJSReceiver()) {
+  if (IsJSReceiver(*value)) {
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, prim_value,
         JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(value),
@@ -1893,25 +1700,25 @@ Maybe<IntlMathematicalValue> IntlMathematicalValue::From(Isolate* isolate,
   IntlMathematicalValue result;
   // 2. If Type(primValue) is BigInt, return the mathematical value of
   // primValue.
-  if (prim_value->IsBigInt()) {
+  if (IsBigInt(*prim_value)) {
     result.value_ = prim_value;
     result.approx_ = Handle<BigInt>::cast(prim_value)->AsInt64();
     return Just(result);
   }
-  if (prim_value->IsOddball()) {
+  if (IsOddball(*prim_value)) {
     prim_value = Oddball::ToNumber(isolate, Handle<Oddball>::cast(prim_value));
   }
-  if (prim_value->IsNumber()) {
+  if (IsNumber(*prim_value)) {
     result.value_ = prim_value;
-    result.approx_ = prim_value->Number();
+    result.approx_ = Object::Number(*prim_value);
     return Just(result);
   }
-  if (!prim_value->IsString()) {
+  if (!IsString(*prim_value)) {
     // No need to convert from Number to String, just call ToNumber.
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, result.value_,
                                      Object::ToNumber(isolate, prim_value),
                                      Nothing<IntlMathematicalValue>());
-    result.approx_ = result.value_->Number();
+    result.approx_ = Object::Number(*result.value_);
     return Just(result);
   }
   Handle<String> string = Handle<String>::cast(prim_value);
@@ -1971,7 +1778,7 @@ Maybe<IntlMathematicalValue> IntlMathematicalValue::From(Isolate* isolate,
 
 Maybe<icu::Formattable> IntlMathematicalValue::ToFormattable(
     Isolate* isolate) const {
-  if (value_->IsNumber()) {
+  if (IsNumber(*value_)) {
     return Just(icu::Formattable(approx_));
   }
   Handle<String> string;
@@ -2110,7 +1917,8 @@ namespace {
 Maybe<int> ConstructParts(Isolate* isolate,
                           const icu::FormattedValue& formatted,
                           Handle<JSArray> result, int start_index,
-                          bool style_is_unit, bool is_nan, bool output_source) {
+                          bool style_is_unit, bool is_nan, bool output_source,
+                          bool output_unit, Handle<String> unit) {
   UErrorCode status = U_ZERO_ERROR;
   icu::UnicodeString formatted_text = formatted.toString(status);
   if (U_FAILURE(status)) {
@@ -2137,7 +1945,6 @@ Maybe<int> ConstructParts(Isolate* isolate,
       int32_t limit = cfpos.getLimit();
       if (category == UFIELD_CATEGORY_NUMBER_RANGE_SPAN) {
         DCHECK_LE(field, 2);
-        DCHECK(v8_flags.harmony_intl_number_format_v3);
         tracker.Add(field, start, limit);
       } else {
         regions.push_back(NumberFormatSpan(field, start, limit));
@@ -2173,7 +1980,12 @@ Maybe<int> ConstructParts(Isolate* isolate,
           Intl::SourceString(isolate,
                              tracker.GetSource(part.begin_pos, part.end_pos)));
     } else {
-      Intl::AddElement(isolate, result, index, field_type_string, substring);
+      if (output_unit) {
+        Intl::AddElement(isolate, result, index, field_type_string, substring,
+                         isolate->factory()->unit_string(), unit);
+      } else {
+        Intl::AddElement(isolate, result, index, field_type_string, substring);
+      }
     }
     ++index;
   }
@@ -2181,6 +1993,18 @@ Maybe<int> ConstructParts(Isolate* isolate,
   return Just(index);
 }
 
+}  // namespace
+
+Maybe<int> Intl::AddNumberElements(Isolate* isolate,
+                                   const icu::FormattedValue& formatted,
+                                   Handle<JSArray> result, int start_index,
+                                   Handle<String> unit) {
+  return ConstructParts(isolate, formatted, result, start_index, true, false,
+                        false, true, unit);
+}
+
+namespace {
+
 // #sec-partitionnumberrangepattern
 template <typename T, MaybeHandle<T> (*F)(
                           Isolate*, const icu::FormattedValue&,
@@ -2220,7 +2044,7 @@ MaybeHandle<T> PartitionNumberRangePattern(Isolate* isolate,
   Maybe<icu::number::LocalizedNumberRangeFormatter> maybe_range_formatter =
       JSNumberFormat::GetRangeFormatter(
           isolate, number_format->locale(),
-          *number_format->icu_number_formatter().raw());
+          *number_format->icu_number_formatter()->raw());
   MAYBE_RETURN(maybe_range_formatter, MaybeHandle<T>());
 
   icu::number::LocalizedNumberRangeFormatter nrfmt =
@@ -2232,7 +2056,7 @@ MaybeHandle<T> PartitionNumberRangePattern(Isolate* isolate,
   icu::number::FormattedNumberRange formatted =
       std::move(maybe_formatted).FromJust();
 
-  return F(isolate, formatted, *(number_format->icu_number_formatter().raw()),
+  return F(isolate, formatted, *(number_format->icu_number_formatter()->raw()),
            false /* is_nan */);
 }
 
@@ -2263,7 +2087,7 @@ MaybeHandle<JSArray> FormatToJSArray(
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, format_to_parts,
       ConstructParts(isolate, formatted, result, 0, is_unit, is_nan,
-                     output_source),
+                     output_source, false, Handle<String>()),
       Handle<JSArray>());
   USE(format_to_parts);
 
@@ -2280,7 +2104,7 @@ MaybeHandle<JSArray> FormatRangeToJSArray(
 
 Maybe<icu::number::LocalizedNumberRangeFormatter>
 JSNumberFormat::GetRangeFormatter(
-    Isolate* isolate, String locale,
+    Isolate* isolate, Tagged<String> locale,
     const icu::number::LocalizedNumberFormatter& number_formatter) {
   UErrorCode status = U_ZERO_ERROR;
   UParseError perror;
@@ -2289,7 +2113,7 @@ JSNumberFormat::GetRangeFormatter(
           .numberFormatterBoth(icu::number::NumberFormatter::forSkeleton(
               number_formatter.toSkeleton(status), perror, status))
           .locale(
-              icu::Locale::forLanguageTag(locale.ToCString().get(), status));
+              icu::Locale::forLanguageTag(locale->ToCString().get(), status));
   if (U_FAILURE(status)) {
     THROW_NEW_ERROR_RETURN_VALUE(
         isolate, NewTypeError(MessageTemplate::kIcuError),
@@ -2302,38 +2126,19 @@ MaybeHandle<String> JSNumberFormat::FormatNumeric(
     Isolate* isolate,
     const icu::number::LocalizedNumberFormatter& number_format,
     Handle<Object> numeric_obj) {
-  DCHECK(numeric_obj->IsNumeric() || v8_flags.harmony_intl_number_format_v3);
-
   Maybe<icu::number::FormattedNumber> maybe_format =
       IcuFormatNumber(isolate, number_format, numeric_obj);
   MAYBE_RETURN(maybe_format, Handle<String>());
   icu::number::FormattedNumber formatted = std::move(maybe_format).FromJust();
 
-  return FormatToString(isolate, formatted, number_format,
-                        numeric_obj->IsNaN());
-}
-
-namespace {
-MaybeHandle<String> NumberFormatFunctionV2(Isolate* isolate,
-                                           Handle<JSNumberFormat> number_format,
-                                           Handle<Object> value) {
-  icu::number::LocalizedNumberFormatter* fmt =
-      number_format->icu_number_formatter().raw();
-  CHECK_NOT_NULL(fmt);
-
-  Handle<Object> x;
-  // 4. Let x be ? ToNumeric(value).
-  ASSIGN_RETURN_ON_EXCEPTION(isolate, x, Object::ToNumeric(isolate, value),
-                             String);
-  // 5. Return FormatNumeric(nf, x).
-  return JSNumberFormat::FormatNumeric(isolate, *fmt, x);
+  return FormatToString(isolate, formatted, number_format, IsNaN(*numeric_obj));
 }
 
-MaybeHandle<String> NumberFormatFunctionV3(Isolate* isolate,
-                                           Handle<JSNumberFormat> number_format,
-                                           Handle<Object> value) {
+MaybeHandle<String> JSNumberFormat::NumberFormatFunction(
+    Isolate* isolate, Handle<JSNumberFormat> number_format,
+    Handle<Object> value) {
   icu::number::LocalizedNumberFormatter* fmt =
-      number_format->icu_number_formatter().raw();
+      number_format->icu_number_formatter()->raw();
   CHECK_NOT_NULL(fmt);
 
   // 4. Let x be ? ToIntlMathematicalValue(value).
@@ -2352,29 +2157,11 @@ MaybeHandle<String> NumberFormatFunctionV3(Isolate* isolate,
   return FormatToString(isolate, formatted, *fmt, x.IsNaN());
 }
 
-MaybeHandle<JSArray> FormatToPartsV2(Isolate* isolate,
-                                     Handle<JSNumberFormat> number_format,
-                                     Handle<Object> numeric_obj) {
-  icu::number::LocalizedNumberFormatter* fmt =
-      number_format->icu_number_formatter().raw();
-  CHECK_NOT_NULL(fmt);
-  ASSIGN_RETURN_ON_EXCEPTION(isolate, numeric_obj,
-                             Object::ToNumeric(isolate, numeric_obj), JSArray);
-
-  Maybe<icu::number::FormattedNumber> maybe_formatted =
-      IcuFormatNumber(isolate, *fmt, numeric_obj);
-  MAYBE_RETURN(maybe_formatted, Handle<JSArray>());
-  icu::number::FormattedNumber formatted =
-      std::move(maybe_formatted).FromJust();
-
-  return FormatToJSArray(isolate, formatted, *fmt, numeric_obj->IsNaN(), false);
-}
-
-MaybeHandle<JSArray> FormatToPartsV3(Isolate* isolate,
-                                     Handle<JSNumberFormat> number_format,
-                                     Handle<Object> numeric_obj) {
+MaybeHandle<JSArray> JSNumberFormat::FormatToParts(
+    Isolate* isolate, Handle<JSNumberFormat> number_format,
+    Handle<Object> numeric_obj) {
   icu::number::LocalizedNumberFormatter* fmt =
-      number_format->icu_number_formatter().raw();
+      number_format->icu_number_formatter()->raw();
   DCHECK_NOT_NULL(fmt);
   IntlMathematicalValue value;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -2390,28 +2177,7 @@ MaybeHandle<JSArray> FormatToPartsV3(Isolate* isolate,
   return FormatToJSArray(isolate, formatted, *fmt, value.IsNaN(), false);
 }
 
-}  // namespace
-
 // #sec-number-format-functions
-MaybeHandle<String> JSNumberFormat::NumberFormatFunction(
-    Isolate* isolate, Handle<JSNumberFormat> number_format,
-    Handle<Object> value) {
-  if (v8_flags.harmony_intl_number_format_v3) {
-    return NumberFormatFunctionV3(isolate, number_format, value);
-  } else {
-    return NumberFormatFunctionV2(isolate, number_format, value);
-  }
-}
-
-MaybeHandle<JSArray> JSNumberFormat::FormatToParts(
-    Isolate* isolate, Handle<JSNumberFormat> number_format,
-    Handle<Object> numeric_obj) {
-  if (v8_flags.harmony_intl_number_format_v3) {
-    return FormatToPartsV3(isolate, number_format, numeric_obj);
-  } else {
-    return FormatToPartsV2(isolate, number_format, numeric_obj);
-  }
-}
 
 MaybeHandle<String> JSNumberFormat::FormatNumericRange(
     Isolate* isolate, Handle<JSNumberFormat> number_format,
diff --git a/deps/v8/src/objects/js-number-format.h b/deps/v8/src/objects/js-number-format.h
index 1b2a0041a9b3e7..085e241571df6a 100644
--- a/deps/v8/src/objects/js-number-format.h
+++ b/deps/v8/src/objects/js-number-format.h
@@ -93,21 +93,20 @@ class JSNumberFormat
 
   static icu::number::UnlocalizedNumberFormatter SetDigitOptionsToFormatter(
       const icu::number::UnlocalizedNumberFormatter& settings,
-      const Intl::NumberFormatDigitOptions& digit_options,
-      int rounding_increment, ShowTrailingZeros show);
+      const Intl::NumberFormatDigitOptions& digit_options);
 
   static const icu::UnicodeString NumberingSystemFromSkeleton(
       const icu::UnicodeString& skeleton);
 
   V8_WARN_UNUSED_RESULT static Maybe<icu::number::LocalizedNumberRangeFormatter>
   GetRangeFormatter(
-      Isolate* isolate, String locale,
+      Isolate* isolate, Tagged<String> locale,
       const icu::number::LocalizedNumberFormatter& number_formatter);
 
   DECL_PRINTER(JSNumberFormat)
 
   DECL_ACCESSORS(icu_number_formatter,
-                 Managed<icu::number::LocalizedNumberFormatter>)
+                 Tagged<Managed<icu::number::LocalizedNumberFormatter>>)
 
   TQ_OBJECT_CONSTRUCTORS(JSNumberFormat)
 };
diff --git a/deps/v8/src/objects/js-objects-inl.h b/deps/v8/src/objects/js-objects-inl.h
index d314c8aaee5a1f..4a8c64848031ac 100644
--- a/deps/v8/src/objects/js-objects-inl.h
+++ b/deps/v8/src/objects/js-objects-inl.h
@@ -7,20 +7,25 @@
 
 #include "src/common/globals.h"
 #include "src/heap/heap-write-barrier.h"
+#include "src/objects/dictionary.h"
 #include "src/objects/elements.h"
 #include "src/objects/embedder-data-slot-inl.h"
 #include "src/objects/feedback-vector.h"
 #include "src/objects/field-index-inl.h"
+#include "src/objects/fixed-array.h"
 #include "src/objects/hash-table-inl.h"
 #include "src/objects/heap-number-inl.h"
+#include "src/objects/instance-type-inl.h"
 #include "src/objects/js-objects.h"
 #include "src/objects/keys.h"
 #include "src/objects/lookup-inl.h"
+#include "src/objects/primitive-heap-object.h"
 #include "src/objects/property-array-inl.h"
 #include "src/objects/prototype-inl.h"
 #include "src/objects/shared-function-info.h"
 #include "src/objects/slots.h"
 #include "src/objects/smi-inl.h"
+#include "src/objects/string.h"
 #include "src/objects/swiss-name-dictionary-inl.h"
 
 // Has to be the last include (doesn't have include guards):
@@ -50,22 +55,23 @@ NEVER_READ_ONLY_SPACE_IMPL(JSReceiver)
 
 CAST_ACCESSOR(JSIteratorResult)
 
-DEF_GETTER(JSObject, elements, FixedArrayBase) {
+DEF_GETTER(JSObject, elements, Tagged<FixedArrayBase>) {
   return TaggedField<FixedArrayBase, kElementsOffset>::load(cage_base, *this);
 }
 
-FixedArrayBase JSObject::elements(RelaxedLoadTag tag) const {
+Tagged<FixedArrayBase> JSObject::elements(RelaxedLoadTag tag) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return elements(cage_base, tag);
 }
 
-FixedArrayBase JSObject::elements(PtrComprCageBase cage_base,
-                                  RelaxedLoadTag) const {
+Tagged<FixedArrayBase> JSObject::elements(PtrComprCageBase cage_base,
+                                          RelaxedLoadTag) const {
   return TaggedField<FixedArrayBase, kElementsOffset>::Relaxed_Load(cage_base,
                                                                     *this);
 }
 
-void JSObject::set_elements(FixedArrayBase value, WriteBarrierMode mode) {
+void JSObject::set_elements(Tagged<FixedArrayBase> value,
+                            WriteBarrierMode mode) {
   // Note the relaxed atomic store.
   TaggedField<FixedArrayBase, kElementsOffset>::Relaxed_Store(*this, value);
   CONDITIONAL_WRITE_BARRIER(*this, kElementsOffset, value, mode);
@@ -99,7 +105,7 @@ Handle<Object> JSReceiver::GetDataProperty(Isolate* isolate,
 MaybeHandle<HeapObject> JSReceiver::GetPrototype(Isolate* isolate,
                                                  Handle<JSReceiver> receiver) {
   // We don't expect access checks to be needed on JSProxy objects.
-  DCHECK(!receiver->IsAccessCheckNeeded() || receiver->IsJSObject());
+  DCHECK(!IsAccessCheckNeeded(*receiver) || IsJSObject(*receiver));
 
   PrototypeIterator iter(isolate, receiver, kStartAtReceiver,
                          PrototypeIterator::END_AT_NON_HIDDEN);
@@ -124,34 +130,36 @@ V8_WARN_UNUSED_RESULT MaybeHandle<FixedArray> JSReceiver::OwnPropertyKeys(
                                  GetKeysConversion::kConvertToString);
 }
 
-bool JSObject::PrototypeHasNoElements(Isolate* isolate, JSObject object) {
+bool JSObject::PrototypeHasNoElements(Isolate* isolate,
+                                      Tagged<JSObject> object) {
   DisallowGarbageCollection no_gc;
-  HeapObject prototype = HeapObject::cast(object.map().prototype());
+  Tagged<HeapObject> prototype = HeapObject::cast(object->map()->prototype());
   ReadOnlyRoots roots(isolate);
-  HeapObject null = roots.null_value();
-  FixedArrayBase empty_fixed_array = roots.empty_fixed_array();
-  FixedArrayBase empty_slow_element_dictionary =
+  Tagged<HeapObject> null = roots.null_value();
+  Tagged<FixedArrayBase> empty_fixed_array = roots.empty_fixed_array();
+  Tagged<FixedArrayBase> empty_slow_element_dictionary =
       roots.empty_slow_element_dictionary();
   while (prototype != null) {
-    Map map = prototype.map();
-    if (map.IsCustomElementsReceiverMap()) return false;
-    FixedArrayBase elements = JSObject::cast(prototype).elements();
+    Tagged<Map> map = prototype->map();
+    if (IsCustomElementsReceiverMap(map)) return false;
+    Tagged<FixedArrayBase> elements = JSObject::cast(prototype)->elements();
     if (elements != empty_fixed_array &&
         elements != empty_slow_element_dictionary) {
       return false;
     }
-    prototype = HeapObject::cast(map.prototype());
+    prototype = HeapObject::cast(map->prototype());
   }
   return true;
 }
 
-ACCESSORS(JSReceiver, raw_properties_or_hash, Object, kPropertiesOrHashOffset)
-RELAXED_ACCESSORS(JSReceiver, raw_properties_or_hash, Object,
+ACCESSORS(JSReceiver, raw_properties_or_hash, Tagged<Object>,
+          kPropertiesOrHashOffset)
+RELAXED_ACCESSORS(JSReceiver, raw_properties_or_hash, Tagged<Object>,
                   kPropertiesOrHashOffset)
 
 void JSObject::EnsureCanContainHeapObjectElements(Handle<JSObject> object) {
   JSObject::ValidateElements(*object);
-  ElementsKind elements_kind = object->map().elements_kind();
+  ElementsKind elements_kind = object->map()->elements_kind();
   if (!IsObjectElementsKind(elements_kind)) {
     if (IsHoleyElementsKind(elements_kind)) {
       TransitionElementsKind(object, HOLEY_ELEMENTS);
@@ -175,14 +183,14 @@ void JSObject::EnsureCanContainElements(Handle<JSObject> object, TSlot objects,
     DCHECK(mode != ALLOW_COPIED_DOUBLE_ELEMENTS);
     bool is_holey = IsHoleyElementsKind(current_kind);
     if (current_kind == HOLEY_ELEMENTS) return;
-    Object the_hole = object->GetReadOnlyRoots().the_hole_value();
+    Tagged<Object> the_hole = object->GetReadOnlyRoots().the_hole_value();
     for (uint32_t i = 0; i < count; ++i, ++objects) {
-      Object current = *objects;
+      Tagged<Object> current = *objects;
       if (current == the_hole) {
         is_holey = true;
         target_kind = GetHoleyElementsKind(target_kind);
-      } else if (!current.IsSmi()) {
-        if (mode == ALLOW_CONVERTED_DOUBLE_ELEMENTS && current.IsNumber()) {
+      } else if (!IsSmi(current)) {
+        if (mode == ALLOW_CONVERTED_DOUBLE_ELEMENTS && IsNumber(current)) {
           if (IsSmiElementsKind(target_kind)) {
             if (is_holey) {
               target_kind = HOLEY_DOUBLE_ELEMENTS;
@@ -241,43 +249,43 @@ void JSObject::SetMapAndElements(Handle<JSObject> object, Handle<Map> new_map,
                                  Handle<FixedArrayBase> value) {
   Isolate* isolate = object->GetIsolate();
   JSObject::MigrateToMap(isolate, object, new_map);
-  DCHECK((object->map().has_fast_smi_or_object_elements() ||
+  DCHECK((object->map()->has_fast_smi_or_object_elements() ||
           (*value == ReadOnlyRoots(isolate).empty_fixed_array()) ||
-          object->map().has_fast_string_wrapper_elements()) ==
+          object->map()->has_fast_string_wrapper_elements()) ==
          (value->map() == ReadOnlyRoots(isolate).fixed_array_map() ||
           value->map() == ReadOnlyRoots(isolate).fixed_cow_array_map()));
   DCHECK((*value == ReadOnlyRoots(isolate).empty_fixed_array()) ||
-         (object->map().has_fast_double_elements() ==
-          value->IsFixedDoubleArray()));
+         (object->map()->has_fast_double_elements() ==
+          IsFixedDoubleArray(*value)));
   object->set_elements(*value);
 }
 
 void JSObject::initialize_elements() {
-  FixedArrayBase elements = map().GetInitialElements();
+  Tagged<FixedArrayBase> elements = map()->GetInitialElements();
   set_elements(elements, SKIP_WRITE_BARRIER);
 }
 
-DEF_GETTER(JSObject, GetIndexedInterceptor, InterceptorInfo) {
-  return map(cage_base).GetIndexedInterceptor(cage_base);
+DEF_GETTER(JSObject, GetIndexedInterceptor, Tagged<InterceptorInfo>) {
+  return map(cage_base)->GetIndexedInterceptor(cage_base);
 }
 
-DEF_GETTER(JSObject, GetNamedInterceptor, InterceptorInfo) {
-  return map(cage_base).GetNamedInterceptor(cage_base);
+DEF_GETTER(JSObject, GetNamedInterceptor, Tagged<InterceptorInfo>) {
+  return map(cage_base)->GetNamedInterceptor(cage_base);
 }
 
 // static
-int JSObject::GetHeaderSize(Map map) {
+int JSObject::GetHeaderSize(Tagged<Map> map) {
   // Check for the most common kind of JavaScript object before
   // falling into the generic switch. This speeds up the internal
   // field operations considerably on average.
-  InstanceType instance_type = map.instance_type();
+  InstanceType instance_type = map->instance_type();
   return instance_type == JS_OBJECT_TYPE
              ? JSObject::kHeaderSize
-             : GetHeaderSize(instance_type, map.has_prototype_slot());
+             : GetHeaderSize(instance_type, map->has_prototype_slot());
 }
 
 // static
-int JSObject::GetEmbedderFieldsStartOffset(Map map) {
+int JSObject::GetEmbedderFieldsStartOffset(Tagged<Map> map) {
   // Embedder fields are located after the object header.
   return GetHeaderSize(map);
 }
@@ -287,8 +295,8 @@ int JSObject::GetEmbedderFieldsStartOffset() {
 }
 
 // static
-bool JSObject::MayHaveEmbedderFields(Map map) {
-  InstanceType instance_type = map.instance_type();
+bool JSObject::MayHaveEmbedderFields(Tagged<Map> map) {
+  InstanceType instance_type = map->instance_type();
   // TODO(v8) It'd be nice if all objects with embedder data slots inherited
   // from JSObjectWithEmbedderSlots, but this is currently not possible due to
   // instance_type constraints.
@@ -301,8 +309,8 @@ bool JSObject::MayHaveEmbedderFields() const {
 }
 
 // static
-int JSObject::GetEmbedderFieldCount(Map map) {
-  int instance_size = map.instance_size();
+int JSObject::GetEmbedderFieldCount(Tagged<Map> map) {
+  int instance_size = map->instance_size();
   if (instance_size == kVariableSizeSentinel) return 0;
   // Embedder fields are located after the object header, whereas in-object
   // properties are located at the end of the object. We don't have to round up
@@ -311,7 +319,7 @@ int JSObject::GetEmbedderFieldCount(Map map) {
   // kSystemPointerSize) anyway.
   return (((instance_size - GetEmbedderFieldsStartOffset(map)) >>
            kTaggedSizeLog2) -
-          map.GetInObjectProperties()) /
+          map->GetInObjectProperties()) /
          kEmbedderDataSlotSizeInTaggedSlots;
 }
 
@@ -325,20 +333,20 @@ int JSObject::GetEmbedderFieldOffset(int index) {
   return GetEmbedderFieldsStartOffset() + (kEmbedderDataSlotSize * index);
 }
 
-Object JSObject::GetEmbedderField(int index) {
-  return EmbedderDataSlot(*this, index).load_tagged();
+Tagged<Object> JSObject::GetEmbedderField(int index) {
+  return EmbedderDataSlot(Tagged(*this), index).load_tagged();
 }
 
-void JSObject::SetEmbedderField(int index, Object value) {
-  EmbedderDataSlot::store_tagged(*this, index, value);
+void JSObject::SetEmbedderField(int index, Tagged<Object> value) {
+  EmbedderDataSlot::store_tagged(Tagged(*this), index, value);
 }
 
-void JSObject::SetEmbedderField(int index, Smi value) {
-  EmbedderDataSlot(*this, index).store_smi(value);
+void JSObject::SetEmbedderField(int index, Tagged<Smi> value) {
+  EmbedderDataSlot(Tagged(*this), index).store_smi(value);
 }
 
 bool JSObject::IsDroppableApiObject() const {
-  auto instance_type = map().instance_type();
+  auto instance_type = map()->instance_type();
   return InstanceTypeChecker::IsJSApiObject(instance_type) ||
          instance_type == JS_SPECIAL_API_OBJECT_TYPE;
 }
@@ -346,41 +354,43 @@ bool JSObject::IsDroppableApiObject() const {
 // Access fast-case object properties at index. The use of these routines
 // is needed to correctly distinguish between properties stored in-object and
 // properties stored in the properties array.
-Object JSObject::RawFastPropertyAt(FieldIndex index) const {
+Tagged<Object> JSObject::RawFastPropertyAt(FieldIndex index) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return RawFastPropertyAt(cage_base, index);
 }
 
-Object JSObject::RawFastPropertyAt(PtrComprCageBase cage_base,
-                                   FieldIndex index) const {
+Tagged<Object> JSObject::RawFastPropertyAt(PtrComprCageBase cage_base,
+                                           FieldIndex index) const {
   if (index.is_inobject()) {
     return TaggedField<Object>::Relaxed_Load(cage_base, *this, index.offset());
   } else {
-    return property_array(cage_base).get(cage_base,
-                                         index.outobject_array_index());
+    return property_array(cage_base)->get(cage_base,
+                                          index.outobject_array_index());
   }
 }
 
 // The SeqCst versions of RawFastPropertyAt are used for atomically accessing
 // shared struct fields.
-Object JSObject::RawFastPropertyAt(FieldIndex index,
-                                   SeqCstAccessTag tag) const {
+Tagged<Object> JSObject::RawFastPropertyAt(FieldIndex index,
+                                           SeqCstAccessTag tag) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return RawFastPropertyAt(cage_base, index, tag);
 }
 
-Object JSObject::RawFastPropertyAt(PtrComprCageBase cage_base, FieldIndex index,
-                                   SeqCstAccessTag tag) const {
+Tagged<Object> JSObject::RawFastPropertyAt(PtrComprCageBase cage_base,
+                                           FieldIndex index,
+                                           SeqCstAccessTag tag) const {
   if (index.is_inobject()) {
     return TaggedField<Object>::SeqCst_Load(cage_base, *this, index.offset());
   } else {
-    return property_array(cage_base).get(cage_base,
-                                         index.outobject_array_index(), tag);
+    return property_array(cage_base)->get(cage_base,
+                                          index.outobject_array_index(), tag);
   }
 }
 
-base::Optional<Object> JSObject::RawInobjectPropertyAt(
-    PtrComprCageBase cage_base, Map original_map, FieldIndex index) const {
+base::Optional<Tagged<Object>> JSObject::RawInobjectPropertyAt(
+    PtrComprCageBase cage_base, Tagged<Map> original_map,
+    FieldIndex index) const {
   CHECK(index.is_inobject());
 
   // This method implements a "snapshot" protocol to protect against reading out
@@ -408,13 +418,14 @@ base::Optional<Object> JSObject::RawInobjectPropertyAt(
   // Only if the maps match can the property be inspected. It may have a "wrong"
   // value, but it will be within the bounds of the objects instance size as
   // given by the map and it will be a valid Smi or object pointer.
-  Object maybe_tagged_object =
+  Tagged<Object> maybe_tagged_object =
       TaggedField<Object>::Acquire_Load(cage_base, *this, index.offset());
   if (original_map != map(cage_base, kAcquireLoad)) return {};
   return maybe_tagged_object;
 }
 
-void JSObject::RawFastInobjectPropertyAtPut(FieldIndex index, Object value,
+void JSObject::RawFastInobjectPropertyAtPut(FieldIndex index,
+                                            Tagged<Object> value,
                                             WriteBarrierMode mode) {
   DCHECK(index.is_inobject());
   int offset = index.offset();
@@ -422,35 +433,36 @@ void JSObject::RawFastInobjectPropertyAtPut(FieldIndex index, Object value,
   CONDITIONAL_WRITE_BARRIER(*this, offset, value, mode);
 }
 
-void JSObject::RawFastInobjectPropertyAtPut(FieldIndex index, Object value,
+void JSObject::RawFastInobjectPropertyAtPut(FieldIndex index,
+                                            Tagged<Object> value,
                                             SeqCstAccessTag tag) {
   DCHECK(index.is_inobject());
-  DCHECK(value.IsShared());
+  DCHECK(IsShared(value));
   SEQ_CST_WRITE_FIELD(*this, index.offset(), value);
   CONDITIONAL_WRITE_BARRIER(*this, index.offset(), value, UPDATE_WRITE_BARRIER);
 }
 
-void JSObject::FastPropertyAtPut(FieldIndex index, Object value,
+void JSObject::FastPropertyAtPut(FieldIndex index, Tagged<Object> value,
                                  WriteBarrierMode mode) {
   if (index.is_inobject()) {
     RawFastInobjectPropertyAtPut(index, value, mode);
   } else {
     DCHECK_EQ(UPDATE_WRITE_BARRIER, mode);
-    property_array().set(index.outobject_array_index(), value);
+    property_array()->set(index.outobject_array_index(), value);
   }
 }
 
-void JSObject::FastPropertyAtPut(FieldIndex index, Object value,
+void JSObject::FastPropertyAtPut(FieldIndex index, Tagged<Object> value,
                                  SeqCstAccessTag tag) {
   if (index.is_inobject()) {
     RawFastInobjectPropertyAtPut(index, value, tag);
   } else {
-    property_array().set(index.outobject_array_index(), value, tag);
+    property_array()->set(index.outobject_array_index(), value, tag);
   }
 }
 
 void JSObject::WriteToField(InternalIndex descriptor, PropertyDetails details,
-                            Object value) {
+                            Tagged<Object> value) {
   DCHECK_EQ(PropertyLocation::kField, details.location());
   DCHECK_EQ(PropertyKind::kData, details.kind());
   DisallowGarbageCollection no_gc;
@@ -462,49 +474,76 @@ void JSObject::WriteToField(InternalIndex descriptor, PropertyDetails details,
     // to return values and stores to the stack silently clear the signalling
     // bit).
     uint64_t bits;
-    if (value.IsSmi()) {
+    if (IsSmi(value)) {
       bits = base::bit_cast<uint64_t>(static_cast<double>(Smi::ToInt(value)));
-    } else if (value.IsUninitialized()) {
+    } else if (IsUninitialized(value)) {
       bits = kHoleNanInt64;
     } else {
-      DCHECK(value.IsHeapNumber());
-      bits = HeapNumber::cast(value).value_as_bits(kRelaxedLoad);
+      DCHECK(IsHeapNumber(value));
+      bits = HeapNumber::cast(value)->value_as_bits(kRelaxedLoad);
     }
     auto box = HeapNumber::cast(RawFastPropertyAt(index));
-    box.set_value_as_bits(bits, kRelaxedStore);
+    box->set_value_as_bits(bits, kRelaxedStore);
   } else {
     FastPropertyAtPut(index, value);
   }
 }
 
-Object JSObject::RawFastPropertyAtSwap(FieldIndex index, Object value,
-                                       SeqCstAccessTag tag) {
-  PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
-  return RawFastPropertyAtSwap(cage_base, index, value, tag);
+Tagged<Object> JSObject::RawFastInobjectPropertyAtSwap(FieldIndex index,
+                                                       Tagged<Object> value,
+                                                       SeqCstAccessTag tag) {
+  DCHECK(index.is_inobject());
+  DCHECK(IsShared(value));
+  int offset = index.offset();
+  Tagged<Object> old_value = SEQ_CST_SWAP_FIELD(*this, offset, value);
+  CONDITIONAL_WRITE_BARRIER(*this, offset, value, UPDATE_WRITE_BARRIER);
+  return old_value;
+}
+
+Tagged<Object> JSObject::RawFastPropertyAtSwap(FieldIndex index,
+                                               Tagged<Object> value,
+                                               SeqCstAccessTag tag) {
+  if (index.is_inobject()) {
+    return RawFastInobjectPropertyAtSwap(index, value, tag);
+  }
+  return property_array()->Swap(index.outobject_array_index(), value, tag);
+}
+
+Tagged<Object> JSObject::RawFastInobjectPropertyAtCompareAndSwap(
+    FieldIndex index, Tagged<Object> expected, Tagged<Object> value,
+    SeqCstAccessTag tag) {
+  DCHECK(index.is_inobject());
+  DCHECK(IsShared(value));
+  Tagged<Object> previous_value =
+      SEQ_CST_COMPARE_AND_SWAP_FIELD(*this, index.offset(), expected, value);
+  if (previous_value == expected) {
+    CONDITIONAL_WRITE_BARRIER(*this, index.offset(), value,
+                              UPDATE_WRITE_BARRIER);
+  }
+  return previous_value;
 }
 
-Object JSObject::RawFastPropertyAtSwap(PtrComprCageBase cage_base,
-                                       FieldIndex index, Object value,
-                                       SeqCstAccessTag tag) {
+Tagged<Object> JSObject::RawFastPropertyAtCompareAndSwapInternal(
+    FieldIndex index, Tagged<Object> expected, Tagged<Object> value,
+    SeqCstAccessTag tag) {
   if (index.is_inobject()) {
-    return TaggedField<Object>::SeqCst_Swap(cage_base, *this, index.offset(),
-                                            value);
+    return RawFastInobjectPropertyAtCompareAndSwap(index, expected, value, tag);
   }
-  return property_array().Swap(cage_base, index.outobject_array_index(), value,
-                               tag);
+  return property_array()->CompareAndSwap(index.outobject_array_index(),
+                                          expected, value, tag);
 }
 
 int JSObject::GetInObjectPropertyOffset(int index) {
-  return map().GetInObjectPropertyOffset(index);
+  return map()->GetInObjectPropertyOffset(index);
 }
 
-Object JSObject::InObjectPropertyAt(int index) {
+Tagged<Object> JSObject::InObjectPropertyAt(int index) {
   int offset = GetInObjectPropertyOffset(index);
   return TaggedField<Object>::load(*this, offset);
 }
 
-Object JSObject::InObjectPropertyAtPut(int index, Object value,
-                                       WriteBarrierMode mode) {
+Tagged<Object> JSObject::InObjectPropertyAtPut(int index, Tagged<Object> value,
+                                               WriteBarrierMode mode) {
   // Adjust for the number of properties stored in the object.
   int offset = GetInObjectPropertyOffset(index);
   WRITE_FIELD(*this, offset, value);
@@ -512,10 +551,11 @@ Object JSObject::InObjectPropertyAtPut(int index, Object value,
   return value;
 }
 
-void JSObject::InitializeBody(Map map, int start_offset,
+void JSObject::InitializeBody(Tagged<Map> map, int start_offset,
                               bool is_slack_tracking_in_progress,
-                              MapWord filler_map, Object undefined_filler) {
-  int size = map.instance_size();
+                              MapWord filler_map,
+                              Tagged<Object> undefined_filler) {
+  int size = map->instance_size();
   int offset = start_offset;
 
   // embedder data slots need to be initialized separately
@@ -534,7 +574,7 @@ void JSObject::InitializeBody(Map map, int start_offset,
     DCHECK_EQ(offset, embedder_field_start);
     for (int i = 0; i < embedder_field_count; i++) {
       // TODO(v8): consider initializing embedded data slots with Smi::zero().
-      EmbedderDataSlot(*this, i).Initialize(undefined_filler);
+      EmbedderDataSlot(Tagged<JSObject>(*this), i).Initialize(undefined_filler);
       offset += kEmbedderDataSlotSize;
     }
   } else {
@@ -544,7 +584,7 @@ void JSObject::InitializeBody(Map map, int start_offset,
   DCHECK_LE(offset, size);
   if (is_slack_tracking_in_progress) {
     int end_of_pre_allocated_offset =
-        size - (map.UnusedPropertyFields() * kTaggedSize);
+        size - (map->UnusedPropertyFields() * kTaggedSize);
     DCHECK_LE(kHeaderSize, end_of_pre_allocated_offset);
     DCHECK_LE(offset, end_of_pre_allocated_offset);
     // fill pre allocated slots with references to the undefined value object
@@ -554,7 +594,7 @@ void JSObject::InitializeBody(Map map, int start_offset,
     }
     // fill the remainder with one word filler objects (ie just a map word)
     while (offset < size) {
-      Object fm = Object(filler_map.ptr());
+      Tagged<Object> fm = Object(filler_map.ptr());
       WRITE_FIELD(*this, offset, fm);
       offset += kTaggedSize;
     }
@@ -572,22 +612,34 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(JSExternalObject)
 EXTERNAL_POINTER_ACCESSORS(JSExternalObject, value, void*, kValueOffset,
                            kExternalObjectValueTag)
 
-DEF_GETTER(JSGlobalObject, native_context_unchecked, Object) {
+DEF_GETTER(JSGlobalObject, native_context_unchecked, Tagged<Object>) {
   return TaggedField<Object, kNativeContextOffset>::Relaxed_Load(cage_base,
                                                                  *this);
 }
 
 bool JSMessageObject::DidEnsureSourcePositionsAvailable() const {
-  return shared_info().IsUndefined();
+  return shared_info() == Smi::zero();
+}
+
+// static
+void JSMessageObject::EnsureSourcePositionsAvailable(
+    Isolate* isolate, Handle<JSMessageObject> message) {
+  if (message->DidEnsureSourcePositionsAvailable()) {
+    DCHECK(message->script()->has_line_ends());
+  } else {
+    JSMessageObject::InitializeSourcePositions(isolate, message);
+  }
 }
 
 int JSMessageObject::GetStartPosition() const {
-  DCHECK(DidEnsureSourcePositionsAvailable());
+  // TODO(cbruni): make this DCHECK stricter (>= 0).
+  DCHECK_LE(-1, start_position());
   return start_position();
 }
 
 int JSMessageObject::GetEndPosition() const {
-  DCHECK(DidEnsureSourcePositionsAvailable());
+  // TODO(cbruni): make this DCHECK stricter (>= 0).
+  DCHECK_LE(-1, end_position());
   return end_position();
 }
 
@@ -599,38 +651,38 @@ void JSMessageObject::set_type(MessageTemplate value) {
   set_raw_type(static_cast<int>(value));
 }
 
-ACCESSORS(JSMessageObject, shared_info, HeapObject, kSharedInfoOffset)
-ACCESSORS(JSMessageObject, bytecode_offset, Smi, kBytecodeOffsetOffset)
+ACCESSORS(JSMessageObject, shared_info, Tagged<Object>, kSharedInfoOffset)
+ACCESSORS(JSMessageObject, bytecode_offset, Tagged<Smi>, kBytecodeOffsetOffset)
 SMI_ACCESSORS(JSMessageObject, start_position, kStartPositionOffset)
 SMI_ACCESSORS(JSMessageObject, end_position, kEndPositionOffset)
 SMI_ACCESSORS(JSMessageObject, error_level, kErrorLevelOffset)
 SMI_ACCESSORS(JSMessageObject, raw_type, kMessageTypeOffset)
 
 DEF_GETTER(JSObject, GetElementsKind, ElementsKind) {
-  ElementsKind kind = map(cage_base).elements_kind();
+  ElementsKind kind = map(cage_base)->elements_kind();
 #if VERIFY_HEAP && DEBUG
-  FixedArrayBase fixed_array = FixedArrayBase::unchecked_cast(
+  Tagged<FixedArrayBase> fixed_array = FixedArrayBase::unchecked_cast(
       TaggedField<HeapObject, kElementsOffset>::load(cage_base, *this));
 
   // If a GC was caused while constructing this object, the elements
   // pointer may point to a one pointer filler map.
   if (ElementsAreSafeToExamine(cage_base)) {
-    Map map = fixed_array.map(cage_base);
+    Tagged<Map> map = fixed_array->map(cage_base);
     if (IsSmiOrObjectElementsKind(kind)) {
       DCHECK(map == GetReadOnlyRoots(cage_base).fixed_array_map() ||
              map == GetReadOnlyRoots(cage_base).fixed_cow_array_map());
     } else if (IsDoubleElementsKind(kind)) {
-      DCHECK(fixed_array.IsFixedDoubleArray(cage_base) ||
+      DCHECK(IsFixedDoubleArray(fixed_array, cage_base) ||
              fixed_array == GetReadOnlyRoots(cage_base).empty_fixed_array());
     } else if (kind == DICTIONARY_ELEMENTS) {
-      DCHECK(fixed_array.IsFixedArray(cage_base));
-      DCHECK(fixed_array.IsNumberDictionary(cage_base));
+      DCHECK(IsFixedArray(fixed_array, cage_base));
+      DCHECK(IsNumberDictionary(fixed_array, cage_base));
     } else {
       DCHECK(kind > DICTIONARY_ELEMENTS ||
              IsAnyNonextensibleElementsKind(kind));
     }
     DCHECK(!IsSloppyArgumentsElementsKind(kind) ||
-           elements(cage_base).IsSloppyArgumentsElements());
+           IsSloppyArgumentsElements(elements(cage_base)));
   }
 #endif
   return kind;
@@ -717,13 +769,13 @@ DEF_GETTER(JSObject, HasSlowStringWrapperElements, bool) {
 }
 
 DEF_GETTER(JSObject, HasTypedArrayOrRabGsabTypedArrayElements, bool) {
-  DCHECK(!elements(cage_base).is_null());
-  return map(cage_base).has_typed_array_or_rab_gsab_typed_array_elements();
+  DCHECK(!elements(cage_base)->is_null());
+  return map(cage_base)->has_typed_array_or_rab_gsab_typed_array_elements();
 }
 
-#define FIXED_TYPED_ELEMENTS_CHECK(Type, type, TYPE, ctype)   \
-  DEF_GETTER(JSObject, HasFixed##Type##Elements, bool) {      \
-    return map(cage_base).elements_kind() == TYPE##_ELEMENTS; \
+#define FIXED_TYPED_ELEMENTS_CHECK(Type, type, TYPE, ctype)    \
+  DEF_GETTER(JSObject, HasFixed##Type##Elements, bool) {       \
+    return map(cage_base)->elements_kind() == TYPE##_ELEMENTS; \
   }
 
 TYPED_ARRAYS(FIXED_TYPED_ELEMENTS_CHECK)
@@ -731,18 +783,19 @@ TYPED_ARRAYS(FIXED_TYPED_ELEMENTS_CHECK)
 #undef FIXED_TYPED_ELEMENTS_CHECK
 
 DEF_GETTER(JSObject, HasNamedInterceptor, bool) {
-  return map(cage_base).has_named_interceptor();
+  return map(cage_base)->has_named_interceptor();
 }
 
 DEF_GETTER(JSObject, HasIndexedInterceptor, bool) {
-  return map(cage_base).has_indexed_interceptor();
+  return map(cage_base)->has_indexed_interceptor();
 }
 
 RELEASE_ACQUIRE_ACCESSORS_CHECKED2(JSGlobalObject, global_dictionary,
-                                   GlobalDictionary, kPropertiesOrHashOffset,
+                                   Tagged<GlobalDictionary>,
+                                   kPropertiesOrHashOffset,
                                    !HasFastProperties(cage_base), true)
 
-DEF_GETTER(JSObject, element_dictionary, NumberDictionary) {
+DEF_GETTER(JSObject, element_dictionary, Tagged<NumberDictionary>) {
   DCHECK(HasDictionaryElements(cage_base) ||
          HasSlowStringWrapperElements(cage_base));
   return NumberDictionary::cast(elements(cage_base));
@@ -753,7 +806,7 @@ void JSReceiver::initialize_properties(Isolate* isolate) {
   DCHECK(!ObjectInYoungGeneration(roots.empty_fixed_array()));
   DCHECK(!ObjectInYoungGeneration(roots.empty_property_dictionary()));
   DCHECK(!ObjectInYoungGeneration(roots.empty_ordered_property_dictionary()));
-  if (map(isolate).is_dictionary_map()) {
+  if (map(isolate)->is_dictionary_map()) {
     if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
       WRITE_FIELD(*this, kPropertiesOrHashOffset,
                   roots.empty_swiss_property_dictionary());
@@ -767,36 +820,36 @@ void JSReceiver::initialize_properties(Isolate* isolate) {
 }
 
 DEF_GETTER(JSReceiver, HasFastProperties, bool) {
-  Object raw_properties_or_hash_obj =
+  Tagged<Object> raw_properties_or_hash_obj =
       raw_properties_or_hash(cage_base, kRelaxedLoad);
-  DCHECK(raw_properties_or_hash_obj.IsSmi() ||
-         ((raw_properties_or_hash_obj.IsGlobalDictionary(cage_base) ||
-           raw_properties_or_hash_obj.IsNameDictionary(cage_base) ||
-           raw_properties_or_hash_obj.IsSwissNameDictionary(cage_base)) ==
-          map(cage_base).is_dictionary_map()));
+  DCHECK(IsSmi(raw_properties_or_hash_obj) ||
+         ((IsGlobalDictionary(raw_properties_or_hash_obj, cage_base) ||
+           IsNameDictionary(raw_properties_or_hash_obj, cage_base) ||
+           IsSwissNameDictionary(raw_properties_or_hash_obj, cage_base)) ==
+          map(cage_base)->is_dictionary_map()));
   USE(raw_properties_or_hash_obj);
-  return !map(cage_base).is_dictionary_map();
+  return !map(cage_base)->is_dictionary_map();
 }
 
-DEF_GETTER(JSReceiver, property_dictionary, NameDictionary) {
-  DCHECK(!IsJSGlobalObject(cage_base));
+DEF_GETTER(JSReceiver, property_dictionary, Tagged<NameDictionary>) {
+  DCHECK(!IsJSGlobalObject(*this, cage_base));
   DCHECK(!HasFastProperties(cage_base));
   DCHECK(!V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL);
 
-  Object prop = raw_properties_or_hash(cage_base);
-  if (prop.IsSmi()) {
+  Tagged<Object> prop = raw_properties_or_hash(cage_base);
+  if (IsSmi(prop)) {
     return GetReadOnlyRoots(cage_base).empty_property_dictionary();
   }
   return NameDictionary::cast(prop);
 }
 
-DEF_GETTER(JSReceiver, property_dictionary_swiss, SwissNameDictionary) {
-  DCHECK(!IsJSGlobalObject(cage_base));
+DEF_GETTER(JSReceiver, property_dictionary_swiss, Tagged<SwissNameDictionary>) {
+  DCHECK(!IsJSGlobalObject(*this, cage_base));
   DCHECK(!HasFastProperties(cage_base));
   DCHECK(V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL);
 
-  Object prop = raw_properties_or_hash(cage_base);
-  if (prop.IsSmi()) {
+  Tagged<Object> prop = raw_properties_or_hash(cage_base);
+  if (IsSmi(prop)) {
     return GetReadOnlyRoots(cage_base).empty_swiss_property_dictionary();
   }
   return SwissNameDictionary::cast(prop);
@@ -804,10 +857,10 @@ DEF_GETTER(JSReceiver, property_dictionary_swiss, SwissNameDictionary) {
 
 // TODO(gsathya): Pass isolate directly to this function and access
 // the heap from this.
-DEF_GETTER(JSReceiver, property_array, PropertyArray) {
+DEF_GETTER(JSReceiver, property_array, Tagged<PropertyArray>) {
   DCHECK(HasFastProperties(cage_base));
-  Object prop = raw_properties_or_hash(cage_base);
-  if (prop.IsSmi() || prop == GetReadOnlyRoots(cage_base).empty_fixed_array()) {
+  Tagged<Object> prop = raw_properties_or_hash(cage_base);
+  if (IsSmi(prop) || prop == GetReadOnlyRoots(cage_base).empty_fixed_array()) {
     return GetReadOnlyRoots(cage_base).empty_property_array();
   }
   return PropertyArray::cast(prop);
@@ -823,7 +876,7 @@ Maybe<bool> JSReceiver::HasProperty(Isolate* isolate, Handle<JSReceiver> object,
 Maybe<bool> JSReceiver::HasOwnProperty(Isolate* isolate,
                                        Handle<JSReceiver> object,
                                        uint32_t index) {
-  if (object->IsJSObject()) {  // Shortcut.
+  if (IsJSObject(*object)) {  // Shortcut.
     LookupIterator it(isolate, object, index, object, LookupIterator::OWN);
     return HasProperty(&it);
   }
@@ -878,11 +931,11 @@ Maybe<PropertyAttributes> JSReceiver::GetOwnElementAttributes(
 }
 
 bool JSGlobalObject::IsDetached() {
-  return global_proxy().IsDetachedFrom(*this);
+  return global_proxy()->IsDetachedFrom(*this);
 }
 
-bool JSGlobalProxy::IsDetachedFrom(JSGlobalObject global) const {
-  const PrototypeIterator iter(this->GetIsolate(), *this);
+bool JSGlobalProxy::IsDetachedFrom(Tagged<JSGlobalObject> global) const {
+  const PrototypeIterator iter(this->GetIsolate(), Tagged<JSReceiver>(*this));
   return iter.GetCurrent() != global;
 }
 
@@ -891,8 +944,8 @@ inline int JSGlobalProxy::SizeWithEmbedderFields(int embedder_field_count) {
   return kHeaderSize + embedder_field_count * kEmbedderDataSlotSize;
 }
 
-ACCESSORS(JSIteratorResult, value, Object, kValueOffset)
-ACCESSORS(JSIteratorResult, done, Object, kDoneOffset)
+ACCESSORS(JSIteratorResult, value, Tagged<Object>, kValueOffset)
+ACCESSORS(JSIteratorResult, done, Tagged<Object>, kDoneOffset)
 
 // If the fast-case backing storage takes up much more memory than a dictionary
 // backing storage would, the object should have slow elements.
@@ -905,7 +958,7 @@ static inline bool ShouldConvertToSlowElements(uint32_t used_elements,
   return size_threshold <= new_capacity;
 }
 
-static inline bool ShouldConvertToSlowElements(JSObject object,
+static inline bool ShouldConvertToSlowElements(Tagged<JSObject> object,
                                                uint32_t capacity,
                                                uint32_t index,
                                                uint32_t* new_capacity) {
@@ -923,7 +976,7 @@ static inline bool ShouldConvertToSlowElements(JSObject object,
        ObjectInYoungGeneration(object))) {
     return false;
   }
-  return ShouldConvertToSlowElements(object.GetFastElementsUsage(),
+  return ShouldConvertToSlowElements(object->GetFastElementsUsage(),
                                      *new_capacity);
 }
 
diff --git a/deps/v8/src/objects/js-objects.cc b/deps/v8/src/objects/js-objects.cc
index 92895221896f32..6094323ee092e1 100644
--- a/deps/v8/src/objects/js-objects.cc
+++ b/deps/v8/src/objects/js-objects.cc
@@ -5,7 +5,9 @@
 #include "src/objects/js-objects.h"
 
 #include "src/api/api-arguments-inl.h"
+#include "src/api/api-natives.h"
 #include "src/base/optional.h"
+#include "src/common/assert-scope.h"
 #include "src/common/globals.h"
 #include "src/date/date.h"
 #include "src/execution/arguments.h"
@@ -36,6 +38,7 @@
 #include "src/objects/lookup.h"
 #include "src/objects/map-updater.h"
 #include "src/objects/objects-inl.h"
+#include "src/objects/tagged.h"
 #ifdef V8_INTL_SUPPORT
 #include "src/objects/js-break-iterator.h"
 #include "src/objects/js-collator.h"
@@ -85,8 +88,8 @@
 #include "src/utils/ostreams.h"
 
 #if V8_ENABLE_WEBASSEMBLY
-#include "src/wasm/wasm-objects.h"
 #include "src/debug/debug-wasm-objects.h"
+#include "src/wasm/wasm-objects.h"
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 namespace v8 {
@@ -133,12 +136,12 @@ Maybe<bool> JSReceiver::HasProperty(LookupIterator* it) {
 Maybe<bool> JSReceiver::HasOwnProperty(Isolate* isolate,
                                        Handle<JSReceiver> object,
                                        Handle<Name> name) {
-  if (object->IsJSModuleNamespace()) {
+  if (IsJSModuleNamespace(*object)) {
     PropertyDescriptor desc;
     return JSReceiver::GetOwnPropertyDescriptor(isolate, object, name, &desc);
   }
 
-  if (object->IsJSObject()) {  // Shortcut.
+  if (IsJSObject(*object)) {  // Shortcut.
     PropertyKey key(isolate, name);
     LookupIterator it(isolate, object, key, LookupIterator::OWN);
     return HasProperty(&it);
@@ -214,10 +217,12 @@ Maybe<bool> JSReceiver::CheckPrivateNameStore(LookupIterator* it,
         UNREACHABLE();
       case LookupIterator::ACCESS_CHECK:
         if (!it->HasAccess()) {
-          isolate->ReportFailedAccessCheck(
-              Handle<JSObject>::cast(it->GetReceiver()));
-          RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<bool>());
-          return Just(false);
+          RETURN_ON_EXCEPTION_VALUE(
+              isolate,
+              isolate->ReportFailedAccessCheck(
+                  Handle<JSObject>::cast(it->GetReceiver())),
+              Nothing<bool>());
+          UNREACHABLE();
         }
         break;
       case LookupIterator::DATA:
@@ -241,7 +246,7 @@ Maybe<bool> JSReceiver::CheckPrivateNameStore(LookupIterator* it,
     RETURN_FAILURE(isolate, GetShouldThrow(isolate, Nothing<ShouldThrow>()),
                    NewTypeError(MessageTemplate::kInvalidPrivateMemberWrite,
                                 name_string, it->GetReceiver()));
-  } else if (it->GetReceiver()->IsAlwaysSharedSpaceJSObject()) {
+  } else if (IsAlwaysSharedSpaceJSObject(*it->GetReceiver())) {
     RETURN_FAILURE(
         isolate, kThrowOnError,
         NewTypeError(MessageTemplate::kDefineDisallowed, name_string));
@@ -249,27 +254,6 @@ Maybe<bool> JSReceiver::CheckPrivateNameStore(LookupIterator* it,
   return Just(true);
 }
 
-// static
-Maybe<bool> JSReceiver::CheckIfCanDefine(Isolate* isolate, LookupIterator* it,
-                                         Handle<Object> value,
-                                         Maybe<ShouldThrow> should_throw) {
-  if (it->IsFound()) {
-    Maybe<PropertyAttributes> attributes = GetPropertyAttributes(it);
-    MAYBE_RETURN(attributes, Nothing<bool>());
-    if ((attributes.FromJust() & DONT_DELETE) != 0) {
-      RETURN_FAILURE(
-          isolate, GetShouldThrow(isolate, should_throw),
-          NewTypeError(MessageTemplate::kRedefineDisallowed, it->GetName()));
-    }
-  } else if (!JSObject::IsExtensible(
-                 isolate, Handle<JSObject>::cast(it->GetReceiver()))) {
-    RETURN_FAILURE(
-        isolate, GetShouldThrow(isolate, should_throw),
-        NewTypeError(MessageTemplate::kDefineDisallowed, it->GetName()));
-  }
-  return Just(true);
-}
-
 namespace {
 
 bool HasExcludedProperty(
@@ -277,7 +261,7 @@ bool HasExcludedProperty(
     Handle<Object> search_element) {
   // TODO(gsathya): Change this to be a hashtable.
   for (int i = 0; i < excluded_properties->length(); i++) {
-    if (search_element->SameValue(*excluded_properties->at(i))) {
+    if (Object::SameValue(*search_element, *excluded_properties->at(i))) {
       return true;
     }
   }
@@ -292,21 +276,21 @@ V8_WARN_UNUSED_RESULT Maybe<bool> FastAssign(
     bool use_set) {
   // Non-empty strings are the only non-JSReceivers that need to be handled
   // explicitly by Object.assign.
-  if (!source->IsJSReceiver()) {
-    return Just(!source->IsString() || String::cast(*source).length() == 0);
+  if (!IsJSReceiver(*source)) {
+    return Just(!IsString(*source) || String::cast(*source)->length() == 0);
   }
 
   // If the target is deprecated, the object will be updated on first store. If
   // the source for that store equals the target, this will invalidate the
   // cached representation of the source. Preventively upgrade the target.
   // Do this on each iteration since any property load could cause deprecation.
-  if (target->map().is_deprecated()) {
+  if (target->map()->is_deprecated()) {
     JSObject::MigrateInstance(isolate, Handle<JSObject>::cast(target));
   }
 
-  Handle<Map> map(JSReceiver::cast(*source).map(), isolate);
+  Handle<Map> map(JSReceiver::cast(*source)->map(), isolate);
 
-  if (!map->IsJSObjectMap()) return Just(false);
+  if (!IsJSObjectMap(*map)) return Just(false);
   if (!map->OnlyHasSimpleProperties()) return Just(false);
 
   Handle<JSObject> from = Handle<JSObject>::cast(source);
@@ -331,7 +315,7 @@ V8_WARN_UNUSED_RESULT Maybe<bool> FastAssign(
 
       Handle<Name> next_key(descriptors->GetKey(i), isolate);
       if (mode == PropertiesEnumerationMode::kEnumerationOrder) {
-        if (next_key->IsSymbol()) {
+        if (IsSymbol(*next_key)) {
           has_symbol = true;
           if (!process_symbol_only) continue;
         } else {
@@ -445,22 +429,22 @@ Maybe<bool> JSReceiver::SetOrCopyDataProperties(
       Nothing<bool>());
 
   if (!from->HasFastProperties() && target->HasFastProperties() &&
-      !target->IsJSGlobalProxy()) {
+      !IsJSGlobalProxy(*target)) {
     // JSProxy is always in slow-mode.
-    DCHECK(!target->IsJSProxy());
+    DCHECK(!IsJSProxy(*target));
     // Convert to slow properties if we're guaranteed to overflow the number of
     // descriptors.
     int source_length;
-    if (from->IsJSGlobalObject()) {
+    if (IsJSGlobalObject(*from)) {
       source_length = JSGlobalObject::cast(*from)
-                          .global_dictionary(kAcquireLoad)
-                          .NumberOfEnumerableProperties();
+                          ->global_dictionary(kAcquireLoad)
+                          ->NumberOfEnumerableProperties();
     } else if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
       source_length =
-          from->property_dictionary_swiss().NumberOfEnumerableProperties();
+          from->property_dictionary_swiss()->NumberOfEnumerableProperties();
     } else {
       source_length =
-          from->property_dictionary().NumberOfEnumerableProperties();
+          from->property_dictionary()->NumberOfEnumerableProperties();
     }
     if (source_length > kMaxNumberOfDescriptors) {
       JSObject::NormalizeProperties(isolate, Handle<JSObject>::cast(target),
@@ -512,56 +496,56 @@ Maybe<bool> JSReceiver::SetOrCopyDataProperties(
   return Just(true);
 }
 
-String JSReceiver::class_name() {
+Tagged<String> JSReceiver::class_name() {
   ReadOnlyRoots roots = GetReadOnlyRoots();
-  if (IsFunction()) return roots.Function_string();
-  if (IsJSArgumentsObject()) return roots.Arguments_string();
-  if (IsJSArray()) return roots.Array_string();
-  if (IsJSArrayBuffer()) {
-    if (JSArrayBuffer::cast(*this).is_shared()) {
+  if (IsFunction(*this)) return roots.Function_string();
+  if (IsJSArgumentsObject(*this)) return roots.Arguments_string();
+  if (IsJSArray(*this)) return roots.Array_string();
+  if (IsJSArrayBuffer(*this)) {
+    if (JSArrayBuffer::cast(*this)->is_shared()) {
       return roots.SharedArrayBuffer_string();
     }
     return roots.ArrayBuffer_string();
   }
-  if (IsJSArrayIterator()) return roots.ArrayIterator_string();
-  if (IsJSDate()) return roots.Date_string();
-  if (IsJSError()) return roots.Error_string();
-  if (IsJSGeneratorObject()) return roots.Generator_string();
-  if (IsJSMap()) return roots.Map_string();
-  if (IsJSMapIterator()) return roots.MapIterator_string();
-  if (IsJSProxy()) {
-    return map().is_callable() ? roots.Function_string()
-                               : roots.Object_string();
-  }
-  if (IsJSRegExp()) return roots.RegExp_string();
-  if (IsJSSet()) return roots.Set_string();
-  if (IsJSSetIterator()) return roots.SetIterator_string();
-  if (IsJSTypedArray()) {
-#define SWITCH_KIND(Type, type, TYPE, ctype)      \
-  if (map().elements_kind() == TYPE##_ELEMENTS) { \
-    return roots.Type##Array_string();            \
+  if (IsJSArrayIterator(*this)) return roots.ArrayIterator_string();
+  if (IsJSDate(*this)) return roots.Date_string();
+  if (IsJSError(*this)) return roots.Error_string();
+  if (IsJSGeneratorObject(*this)) return roots.Generator_string();
+  if (IsJSMap(*this)) return roots.Map_string();
+  if (IsJSMapIterator(*this)) return roots.MapIterator_string();
+  if (IsJSProxy(*this)) {
+    return map()->is_callable() ? roots.Function_string()
+                                : roots.Object_string();
+  }
+  if (IsJSRegExp(*this)) return roots.RegExp_string();
+  if (IsJSSet(*this)) return roots.Set_string();
+  if (IsJSSetIterator(*this)) return roots.SetIterator_string();
+  if (IsJSTypedArray(*this)) {
+#define SWITCH_KIND(Type, type, TYPE, ctype)       \
+  if (map()->elements_kind() == TYPE##_ELEMENTS) { \
+    return roots.Type##Array_string();             \
   }
     TYPED_ARRAYS(SWITCH_KIND)
 #undef SWITCH_KIND
   }
-  if (IsJSPrimitiveWrapper()) {
-    Object value = JSPrimitiveWrapper::cast(*this).value();
-    if (value.IsBoolean()) return roots.Boolean_string();
-    if (value.IsString()) return roots.String_string();
-    if (value.IsNumber()) return roots.Number_string();
-    if (value.IsBigInt()) return roots.BigInt_string();
-    if (value.IsSymbol()) return roots.Symbol_string();
-    if (value.IsScript()) return roots.Script_string();
+  if (IsJSPrimitiveWrapper(*this)) {
+    Tagged<Object> value = JSPrimitiveWrapper::cast(*this)->value();
+    if (IsBoolean(value)) return roots.Boolean_string();
+    if (IsString(value)) return roots.String_string();
+    if (IsNumber(value)) return roots.Number_string();
+    if (IsBigInt(value)) return roots.BigInt_string();
+    if (IsSymbol(value)) return roots.Symbol_string();
+    if (IsScript(value)) return roots.Script_string();
     UNREACHABLE();
   }
-  if (IsJSWeakMap()) return roots.WeakMap_string();
-  if (IsJSWeakSet()) return roots.WeakSet_string();
-  if (IsJSGlobalProxy()) return roots.global_string();
-  if (IsShared()) {
-    if (IsJSSharedStruct()) return roots.SharedStruct_string();
-    if (IsJSSharedArray()) return roots.SharedArray_string();
-    if (IsJSAtomicsMutex()) return roots.AtomicsMutex_string();
-    if (IsJSAtomicsCondition()) return roots.AtomicsCondition_string();
+  if (IsJSWeakMap(*this)) return roots.WeakMap_string();
+  if (IsJSWeakSet(*this)) return roots.WeakSet_string();
+  if (IsJSGlobalProxy(*this)) return roots.global_string();
+  if (IsShared(*this)) {
+    if (IsJSSharedStruct(*this)) return roots.SharedStruct_string();
+    if (IsJSSharedArray(*this)) return roots.SharedArray_string();
+    if (IsJSAtomicsMutex(*this)) return roots.AtomicsMutex_string();
+    if (IsJSAtomicsCondition(*this)) return roots.AtomicsCondition_string();
     // Other shared values are primitives.
     UNREACHABLE();
   }
@@ -576,10 +560,11 @@ std::pair<MaybeHandle<JSFunction>, Handle<String>> GetConstructorHelper(
   // constructor on the map provides the most accurate name.
   // Don't provide the info for prototypes, since their constructors are
   // reclaimed and replaced by Object in OptimizeAsPrototype.
-  if (!receiver->IsJSProxy() && receiver->map().new_target_is_base() &&
-      !receiver->map().is_prototype_map()) {
-    Handle<Object> maybe_constructor(receiver->map().GetConstructor(), isolate);
-    if (maybe_constructor->IsJSFunction()) {
+  if (!IsJSProxy(*receiver) && receiver->map()->new_target_is_base() &&
+      !receiver->map()->is_prototype_map()) {
+    Handle<Object> maybe_constructor(receiver->map()->GetConstructor(),
+                                     isolate);
+    if (IsJSFunction(*maybe_constructor)) {
       Handle<JSFunction> constructor =
           Handle<JSFunction>::cast(maybe_constructor);
       Handle<String> name = SharedFunctionInfo::DebugName(
@@ -600,7 +585,7 @@ std::pair<MaybeHandle<JSFunction>, Handle<String>> GetConstructorHelper(
         LookupIterator::OWN_SKIP_INTERCEPTOR);
     auto maybe_to_string_tag = JSReceiver::GetDataProperty(
         &it_to_string_tag, AllocationPolicy::kAllocationDisallowed);
-    if (maybe_to_string_tag->IsString()) {
+    if (IsString(*maybe_to_string_tag)) {
       return std::make_pair(MaybeHandle<JSFunction>(),
                             Handle<String>::cast(maybe_to_string_tag));
     }
@@ -621,7 +606,7 @@ std::pair<MaybeHandle<JSFunction>, Handle<String>> GetConstructorHelper(
           LookupIterator::OWN_SKIP_INTERCEPTOR);
       auto maybe_constructor = JSReceiver::GetDataProperty(
           &it_constructor, AllocationPolicy::kAllocationDisallowed);
-      if (maybe_constructor->IsJSFunction()) {
+      if (IsJSFunction(*maybe_constructor)) {
         auto constructor = Handle<JSFunction>::cast(maybe_constructor);
         auto name = SharedFunctionInfo::DebugName(
             isolate, handle(constructor->shared(), isolate));
@@ -653,21 +638,21 @@ Handle<String> JSReceiver::GetConstructorName(Isolate* isolate,
 
 base::Optional<NativeContext> JSReceiver::GetCreationContextRaw() {
   DisallowGarbageCollection no_gc;
-  JSFunction function;
+  Tagged<JSFunction> function;
   {
-    JSReceiver receiver = *this;
-    Map receiver_map = receiver.map();
-    InstanceType receiver_instance_type = receiver_map.instance_type();
+    Tagged<JSReceiver> receiver = *this;
+    Tagged<Map> receiver_map = receiver->map();
+    InstanceType receiver_instance_type = receiver_map->instance_type();
     if (V8_LIKELY(InstanceTypeChecker::IsJSFunction(receiver_instance_type))) {
       function = JSFunction::cast(receiver);
     } else if (InstanceTypeChecker::IsJSGeneratorObject(
                    receiver_instance_type)) {
-      function = JSGeneratorObject::cast(receiver).function();
+      function = JSGeneratorObject::cast(receiver)->function();
     } else {
       // Externals are JSObjects with null as a constructor.
-      DCHECK(!receiver.IsJSExternalObject());
-      Object constructor = receiver_map.GetConstructor();
-      if (constructor.IsJSFunction()) {
+      DCHECK(!IsJSExternalObject(receiver));
+      Tagged<Object> constructor = receiver_map->GetConstructor();
+      if (IsJSFunction(constructor)) {
         function = JSFunction::cast(constructor);
       } else {
         // constructor might be a FunctionTemplateInfo but remote objects don't
@@ -677,8 +662,8 @@ base::Optional<NativeContext> JSReceiver::GetCreationContextRaw() {
       }
     }
   }
-  if (function.has_context()) return function.native_context();
-  return {};
+  CHECK(function->has_context());
+  return function->native_context();
 }
 
 MaybeHandle<NativeContext> JSReceiver::GetCreationContext() {
@@ -695,36 +680,36 @@ MaybeHandle<NativeContext> JSReceiver::GetFunctionRealm(
   // long chains of bound functions or proxies where a recursive implementation
   // would run out of stack space.
   DisallowGarbageCollection no_gc;
-  JSReceiver current = *receiver;
+  Tagged<JSReceiver> current = *receiver;
   do {
-    DCHECK(current.map().is_constructor());
-    if (current.IsJSProxy()) {
-      JSProxy proxy = JSProxy::cast(current);
-      if (proxy.IsRevoked()) {
+    DCHECK(current->map()->is_constructor());
+    if (IsJSProxy(current)) {
+      Tagged<JSProxy> proxy = JSProxy::cast(current);
+      if (proxy->IsRevoked()) {
         AllowGarbageCollection allow_allocating_errors;
         THROW_NEW_ERROR(isolate, NewTypeError(MessageTemplate::kProxyRevoked),
                         NativeContext);
       }
-      current = JSReceiver::cast(proxy.target());
+      current = JSReceiver::cast(proxy->target());
       continue;
     }
-    if (current.IsJSFunction()) {
-      JSFunction function = JSFunction::cast(current);
-      return handle(function.native_context(), isolate);
+    if (IsJSFunction(current)) {
+      Tagged<JSFunction> function = JSFunction::cast(current);
+      return handle(function->native_context(), isolate);
     }
-    if (current.IsJSBoundFunction()) {
-      JSBoundFunction function = JSBoundFunction::cast(current);
-      current = function.bound_target_function();
+    if (IsJSBoundFunction(current)) {
+      Tagged<JSBoundFunction> function = JSBoundFunction::cast(current);
+      current = function->bound_target_function();
       continue;
     }
-    if (current.IsJSWrappedFunction()) {
-      JSWrappedFunction function = JSWrappedFunction::cast(current);
-      current = function.wrapped_target_function();
+    if (IsJSWrappedFunction(current)) {
+      Tagged<JSWrappedFunction> function = JSWrappedFunction::cast(current);
+      current = function->wrapped_target_function();
       continue;
     }
-    JSObject object = JSObject::cast(current);
-    DCHECK(!object.IsJSFunction());
-    return object.GetCreationContext();
+    Tagged<JSObject> object = JSObject::cast(current);
+    DCHECK(!IsJSFunction(object));
+    return object->GetCreationContext();
   } while (true);
 }
 
@@ -732,20 +717,20 @@ MaybeHandle<NativeContext> JSReceiver::GetFunctionRealm(
 MaybeHandle<NativeContext> JSReceiver::GetContextForMicrotask(
     Handle<JSReceiver> receiver) {
   Isolate* isolate = receiver->GetIsolate();
-  while (receiver->IsJSBoundFunction() || receiver->IsJSProxy()) {
-    if (receiver->IsJSBoundFunction()) {
+  while (IsJSBoundFunction(*receiver) || IsJSProxy(*receiver)) {
+    if (IsJSBoundFunction(*receiver)) {
       receiver = handle(
           Handle<JSBoundFunction>::cast(receiver)->bound_target_function(),
           isolate);
     } else {
-      DCHECK(receiver->IsJSProxy());
+      DCHECK(IsJSProxy(*receiver));
       Handle<Object> target(Handle<JSProxy>::cast(receiver)->target(), isolate);
-      if (!target->IsJSReceiver()) return MaybeHandle<NativeContext>();
+      if (!IsJSReceiver(*target)) return MaybeHandle<NativeContext>();
       receiver = Handle<JSReceiver>::cast(target);
     }
   }
 
-  if (!receiver->IsJSFunction()) return MaybeHandle<NativeContext>();
+  if (!IsJSFunction(*receiver)) return MaybeHandle<NativeContext>();
   return handle(Handle<JSFunction>::cast(receiver)->native_context(), isolate);
 }
 
@@ -773,7 +758,7 @@ Maybe<PropertyAttributes> JSReceiver::GetPropertyAttributes(
       case LookupIterator::INTEGER_INDEXED_EXOTIC:
         return Just(ABSENT);
       case LookupIterator::ACCESSOR:
-        if (it->GetHolder<Object>()->IsJSModuleNamespace()) {
+        if (IsJSModuleNamespace(*it->GetHolder<Object>())) {
           return JSModuleNamespace::GetPropertyAttributes(it);
         } else {
           return Just(it->property_attributes());
@@ -787,11 +772,12 @@ Maybe<PropertyAttributes> JSReceiver::GetPropertyAttributes(
 
 namespace {
 
-Object SetHashAndUpdateProperties(HeapObject properties, int hash) {
+Tagged<Object> SetHashAndUpdateProperties(Tagged<HeapObject> properties,
+                                          int hash) {
   DCHECK_NE(PropertyArray::kNoHashSentinel, hash);
   DCHECK(PropertyArray::HashField::is_valid(hash));
 
-  ReadOnlyRoots roots = properties.GetReadOnlyRoots();
+  ReadOnlyRoots roots = properties->GetReadOnlyRoots();
   if (properties == roots.empty_fixed_array() ||
       properties == roots.empty_property_array() ||
       properties == roots.empty_property_dictionary() ||
@@ -799,54 +785,54 @@ Object SetHashAndUpdateProperties(HeapObject properties, int hash) {
     return Smi::FromInt(hash);
   }
 
-  if (properties.IsPropertyArray()) {
-    PropertyArray::cast(properties).SetHash(hash);
-    DCHECK_LT(0, PropertyArray::cast(properties).length());
+  if (IsPropertyArray(properties)) {
+    PropertyArray::cast(properties)->SetHash(hash);
+    DCHECK_LT(0, PropertyArray::cast(properties)->length());
     return properties;
   }
 
-  if (properties.IsGlobalDictionary()) {
-    GlobalDictionary::cast(properties).SetHash(hash);
+  if (IsGlobalDictionary(properties)) {
+    GlobalDictionary::cast(properties)->SetHash(hash);
     return properties;
   }
 
   if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-    DCHECK(properties.IsSwissNameDictionary());
-    SwissNameDictionary::cast(properties).SetHash(hash);
+    DCHECK(IsSwissNameDictionary(properties));
+    SwissNameDictionary::cast(properties)->SetHash(hash);
   } else {
-    DCHECK(properties.IsNameDictionary());
-    NameDictionary::cast(properties).SetHash(hash);
+    DCHECK(IsNameDictionary(properties));
+    NameDictionary::cast(properties)->SetHash(hash);
   }
   return properties;
 }
 
-int GetIdentityHashHelper(JSReceiver object) {
+int GetIdentityHashHelper(Tagged<JSReceiver> object) {
   DisallowGarbageCollection no_gc;
-  Object properties = object.raw_properties_or_hash();
-  if (properties.IsSmi()) {
+  Tagged<Object> properties = object->raw_properties_or_hash();
+  if (IsSmi(properties)) {
     return Smi::ToInt(properties);
   }
 
-  if (properties.IsPropertyArray()) {
-    return PropertyArray::cast(properties).Hash();
+  if (IsPropertyArray(properties)) {
+    return PropertyArray::cast(properties)->Hash();
   }
   if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-    if (properties.IsSwissNameDictionary()) {
-      return SwissNameDictionary::cast(properties).Hash();
+    if (IsSwissNameDictionary(properties)) {
+      return SwissNameDictionary::cast(properties)->Hash();
     }
   }
 
-  if (properties.IsNameDictionary()) {
+  if (IsNameDictionary(properties)) {
     DCHECK(!V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL);
-    return NameDictionary::cast(properties).Hash();
+    return NameDictionary::cast(properties)->Hash();
   }
 
-  if (properties.IsGlobalDictionary()) {
-    return GlobalDictionary::cast(properties).Hash();
+  if (IsGlobalDictionary(properties)) {
+    return GlobalDictionary::cast(properties)->Hash();
   }
 
 #ifdef DEBUG
-  ReadOnlyRoots roots = object.GetReadOnlyRoots();
+  ReadOnlyRoots roots = object->GetReadOnlyRoots();
   DCHECK(properties == roots.empty_fixed_array() ||
          properties == roots.empty_property_dictionary() ||
          properties == roots.empty_swiss_property_dictionary());
@@ -861,18 +847,20 @@ void JSReceiver::SetIdentityHash(int hash) {
   DCHECK_NE(PropertyArray::kNoHashSentinel, hash);
   DCHECK(PropertyArray::HashField::is_valid(hash));
 
-  HeapObject existing_properties = HeapObject::cast(raw_properties_or_hash());
-  Object new_properties = SetHashAndUpdateProperties(existing_properties, hash);
+  Tagged<HeapObject> existing_properties =
+      HeapObject::cast(raw_properties_or_hash());
+  Tagged<Object> new_properties =
+      SetHashAndUpdateProperties(existing_properties, hash);
   set_raw_properties_or_hash(new_properties, kRelaxedStore);
 }
 
-void JSReceiver::SetProperties(HeapObject properties) {
-  DCHECK_IMPLIES(properties.IsPropertyArray() &&
-                     PropertyArray::cast(properties).length() == 0,
+void JSReceiver::SetProperties(Tagged<HeapObject> properties) {
+  DCHECK_IMPLIES(IsPropertyArray(properties) &&
+                     PropertyArray::cast(properties)->length() == 0,
                  properties == GetReadOnlyRoots().empty_property_array());
   DisallowGarbageCollection no_gc;
   int hash = GetIdentityHashHelper(*this);
-  Object new_properties = properties;
+  Tagged<Object> new_properties = properties;
 
   // TODO(cbruni): Make GetIdentityHashHelper return a bool so that we
   // don't have to manually compare against kNoHashSentinel.
@@ -883,7 +871,7 @@ void JSReceiver::SetProperties(HeapObject properties) {
   set_raw_properties_or_hash(new_properties, kRelaxedStore);
 }
 
-Object JSReceiver::GetIdentityHash() {
+Tagged<Object> JSReceiver::GetIdentityHash() {
   DisallowGarbageCollection no_gc;
 
   int hash = GetIdentityHashHelper(*this);
@@ -895,16 +883,17 @@ Object JSReceiver::GetIdentityHash() {
 }
 
 // static
-Smi JSReceiver::CreateIdentityHash(Isolate* isolate, JSReceiver key) {
+Tagged<Smi> JSReceiver::CreateIdentityHash(Isolate* isolate,
+                                           Tagged<JSReceiver> key) {
   DisallowGarbageCollection no_gc;
   int hash = isolate->GenerateIdentityHash(PropertyArray::HashField::kMax);
   DCHECK_NE(PropertyArray::kNoHashSentinel, hash);
 
-  key.SetIdentityHash(hash);
+  key->SetIdentityHash(hash);
   return Smi::FromInt(hash);
 }
 
-Smi JSReceiver::GetOrCreateIdentityHash(Isolate* isolate) {
+Tagged<Smi> JSReceiver::GetOrCreateIdentityHash(Isolate* isolate) {
   DisallowGarbageCollection no_gc;
 
   int hash = GetIdentityHashHelper(*this);
@@ -921,18 +910,19 @@ void JSReceiver::DeleteNormalizedProperty(Handle<JSReceiver> object,
   Isolate* isolate = object->GetIsolate();
   DCHECK(entry.is_found());
 
-  if (object->IsJSGlobalObject()) {
+  if (IsJSGlobalObject(*object)) {
     // If we have a global object, invalidate the cell and remove it from the
     // global object's dictionary.
     Handle<GlobalDictionary> dictionary(
-        JSGlobalObject::cast(*object).global_dictionary(kAcquireLoad), isolate);
+        JSGlobalObject::cast(*object)->global_dictionary(kAcquireLoad),
+        isolate);
 
     Handle<PropertyCell> cell(dictionary->CellAt(entry), isolate);
 
     Handle<GlobalDictionary> new_dictionary =
         GlobalDictionary::DeleteEntry(isolate, dictionary, entry);
-    JSGlobalObject::cast(*object).set_global_dictionary(*new_dictionary,
-                                                        kReleaseStore);
+    JSGlobalObject::cast(*object)->set_global_dictionary(*new_dictionary,
+                                                         kReleaseStore);
 
     cell->ClearAndInvalidate(ReadOnlyRoots(isolate));
   } else {
@@ -949,7 +939,7 @@ void JSReceiver::DeleteNormalizedProperty(Handle<JSReceiver> object,
       object->SetProperties(*dictionary);
     }
   }
-  if (object->map().is_prototype_map()) {
+  if (object->map()->is_prototype_map()) {
     // Invalidate prototype validity cell as this may invalidate transitioning
     // store IC handlers.
     JSObject::InvalidatePrototypeChains(object->map());
@@ -967,7 +957,7 @@ Maybe<bool> JSReceiver::DeleteProperty(LookupIterator* it,
                                             it->GetName(), language_mode);
   }
 
-  if (it->GetReceiver()->IsJSProxy()) {
+  if (IsJSProxy(*it->GetReceiver())) {
     if (it->state() != LookupIterator::NOT_FOUND) {
       DCHECK_EQ(LookupIterator::DATA, it->state());
       DCHECK(it->name()->IsPrivate());
@@ -987,9 +977,11 @@ Maybe<bool> JSReceiver::DeleteProperty(LookupIterator* it,
                        NewTypeError(MessageTemplate::kWasmObjectsAreOpaque));
       case LookupIterator::ACCESS_CHECK:
         if (it->HasAccess()) break;
-        isolate->ReportFailedAccessCheck(it->GetHolder<JSObject>());
-        RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<bool>());
-        return Just(false);
+        RETURN_ON_EXCEPTION_VALUE(
+            isolate,
+            isolate->ReportFailedAccessCheck(it->GetHolder<JSObject>()),
+            Nothing<bool>());
+        UNREACHABLE();
       case LookupIterator::INTERCEPTOR: {
         ShouldThrow should_throw =
             is_sloppy(language_mode) ? kDontThrow : kThrowOnError;
@@ -1009,7 +1001,7 @@ Maybe<bool> JSReceiver::DeleteProperty(LookupIterator* it,
       case LookupIterator::ACCESSOR: {
         Handle<JSObject> holder = it->GetHolder<JSObject>();
         if (!it->IsConfigurable() ||
-            (holder->IsJSTypedArray() && it->IsElement(*holder))) {
+            (IsJSTypedArray(*holder) && it->IsElement(*holder))) {
           // Fail if the property is not configurable if the property is a
           // TypedArray element.
           if (is_strict(language_mode)) {
@@ -1057,11 +1049,12 @@ Maybe<bool> JSReceiver::DeletePropertyOrElement(Handle<JSReceiver> object,
 
 // ES6 19.1.2.4
 // static
-Object JSReceiver::DefineProperty(Isolate* isolate, Handle<Object> object,
-                                  Handle<Object> key,
-                                  Handle<Object> attributes) {
+Tagged<Object> JSReceiver::DefineProperty(Isolate* isolate,
+                                          Handle<Object> object,
+                                          Handle<Object> key,
+                                          Handle<Object> attributes) {
   // 1. If Type(O) is not Object, throw a TypeError exception.
-  if (!object->IsJSReceiver()) {
+  if (!IsJSReceiver(*object)) {
     Handle<String> fun_name =
         isolate->factory()->InternalizeUtf8String("Object.defineProperty");
     THROW_NEW_ERROR_RETURN_FAILURE(
@@ -1094,7 +1087,7 @@ MaybeHandle<Object> JSReceiver::DefineProperties(Isolate* isolate,
                                                  Handle<Object> object,
                                                  Handle<Object> properties) {
   // 1. If Type(O) is not Object, throw a TypeError exception.
-  if (!object->IsJSReceiver()) {
+  if (!IsJSReceiver(*object)) {
     Handle<String> fun_name =
         isolate->factory()->InternalizeUtf8String("Object.defineProperties");
     THROW_NEW_ERROR(isolate,
@@ -1170,28 +1163,28 @@ Maybe<bool> JSReceiver::DefineOwnProperty(Isolate* isolate,
                                           Handle<Object> key,
                                           PropertyDescriptor* desc,
                                           Maybe<ShouldThrow> should_throw) {
-  if (object->IsJSArray()) {
+  if (IsJSArray(*object)) {
     return JSArray::DefineOwnProperty(isolate, Handle<JSArray>::cast(object),
                                       key, desc, should_throw);
   }
-  if (object->IsJSProxy()) {
+  if (IsJSProxy(*object)) {
     return JSProxy::DefineOwnProperty(isolate, Handle<JSProxy>::cast(object),
                                       key, desc, should_throw);
   }
-  if (object->IsJSTypedArray()) {
+  if (IsJSTypedArray(*object)) {
     return JSTypedArray::DefineOwnProperty(
         isolate, Handle<JSTypedArray>::cast(object), key, desc, should_throw);
   }
-  if (object->IsJSModuleNamespace()) {
+  if (IsJSModuleNamespace(*object)) {
     return JSModuleNamespace::DefineOwnProperty(
         isolate, Handle<JSModuleNamespace>::cast(object), key, desc,
         should_throw);
   }
-  if (object->IsWasmObject()) {
+  if (IsWasmObject(*object)) {
     RETURN_FAILURE(isolate, kThrowOnError,
                    NewTypeError(MessageTemplate::kWasmObjectsAreOpaque));
   }
-  if (object->IsAlwaysSharedSpaceJSObject()) {
+  if (IsAlwaysSharedSpaceJSObject(*object)) {
     return AlwaysSharedSpaceJSObject::DefineOwnProperty(
         isolate, Handle<AlwaysSharedSpaceJSObject>::cast(object), key, desc,
         should_throw);
@@ -1208,7 +1201,7 @@ Maybe<bool> JSReceiver::DefineOwnProperty(Isolate* isolate,
 Maybe<bool> JSReceiver::OrdinaryDefineOwnProperty(
     Isolate* isolate, Handle<JSObject> object, Handle<Object> key,
     PropertyDescriptor* desc, Maybe<ShouldThrow> should_throw) {
-  DCHECK(key->IsName() || key->IsNumber());  // |key| is a PropertyKey.
+  DCHECK(IsName(*key) || IsNumber(*key));  // |key| is a PropertyKey.
   PropertyKey lookup_key(isolate, key);
   return OrdinaryDefineOwnProperty(isolate, object, lookup_key, desc,
                                    should_throw);
@@ -1222,9 +1215,10 @@ Maybe<bool> JSReceiver::OrdinaryDefineOwnProperty(
   // Deal with access checks first.
   if (it.state() == LookupIterator::ACCESS_CHECK) {
     if (!it.HasAccess()) {
-      isolate->ReportFailedAccessCheck(it.GetHolder<JSObject>());
-      RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<bool>());
-      return Just(true);
+      RETURN_ON_EXCEPTION_VALUE(
+          isolate, isolate->ReportFailedAccessCheck(it.GetHolder<JSObject>()),
+          Nothing<bool>());
+      UNREACHABLE();
     }
     it.Next();
   }
@@ -1242,14 +1236,14 @@ MaybeHandle<Object> GetPropertyWithInterceptorInternal(
   // interceptor calls.
   AssertNoContextChange ncc(isolate);
 
-  if (interceptor->getter().IsUndefined(isolate)) {
+  if (IsUndefined(interceptor->getter(), isolate)) {
     return isolate->factory()->undefined_value();
   }
 
   Handle<JSObject> holder = it->GetHolder<JSObject>();
   Handle<Object> result;
   Handle<Object> receiver = it->GetReceiver();
-  if (!receiver->IsJSReceiver()) {
+  if (!IsJSReceiver(*receiver)) {
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, receiver, Object::ConvertReceiver(isolate, receiver), Object);
   }
@@ -1280,17 +1274,17 @@ Maybe<PropertyAttributes> GetPropertyAttributesWithInterceptorInternal(
   HandleScope scope(isolate);
 
   Handle<JSObject> holder = it->GetHolder<JSObject>();
-  DCHECK_IMPLIES(!it->IsElement(*holder) && it->name()->IsSymbol(),
+  DCHECK_IMPLIES(!it->IsElement(*holder) && IsSymbol(*it->name()),
                  interceptor->can_intercept_symbols());
   Handle<Object> receiver = it->GetReceiver();
-  if (!receiver->IsJSReceiver()) {
+  if (!IsJSReceiver(*receiver)) {
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, receiver,
                                      Object::ConvertReceiver(isolate, receiver),
                                      Nothing<PropertyAttributes>());
   }
   PropertyCallbackArguments args(isolate, interceptor->data(), *receiver,
                                  *holder, Just(kDontThrow));
-  if (!interceptor->query().IsUndefined(isolate)) {
+  if (!IsUndefined(interceptor->query(), isolate)) {
     Handle<Object> result;
     if (it->IsElement(*holder)) {
       result = args.CallIndexedQuery(interceptor, it->array_index());
@@ -1299,7 +1293,7 @@ Maybe<PropertyAttributes> GetPropertyAttributesWithInterceptorInternal(
     }
     if (!result.is_null()) {
       int32_t value;
-      CHECK(result->ToInt32(&value));
+      CHECK(Object::ToInt32(*result, &value));
       DCHECK_IMPLIES((value & ~PropertyAttributes::ALL_ATTRIBUTES_MASK) != 0,
                      value == PropertyAttributes::ABSENT);
       // In case of absent property side effects are not allowed.
@@ -1308,7 +1302,7 @@ Maybe<PropertyAttributes> GetPropertyAttributesWithInterceptorInternal(
       }
       return Just(static_cast<PropertyAttributes>(value));
     }
-  } else if (!interceptor->getter().IsUndefined(isolate)) {
+  } else if (!IsUndefined(interceptor->getter(), isolate)) {
     // TODO(verwaest): Use GetPropertyWithInterceptor?
     Handle<Object> result;
     if (it->IsElement(*holder)) {
@@ -1335,12 +1329,12 @@ Maybe<bool> SetPropertyWithInterceptorInternal(
   // interceptor calls.
   AssertNoContextChange ncc(isolate);
 
-  if (interceptor->setter().IsUndefined(isolate)) return Just(false);
+  if (IsUndefined(interceptor->setter(), isolate)) return Just(false);
 
   Handle<JSObject> holder = it->GetHolder<JSObject>();
   bool result;
   Handle<Object> receiver = it->GetReceiver();
-  if (!receiver->IsJSReceiver()) {
+  if (!IsJSReceiver(*receiver)) {
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, receiver,
                                      Object::ConvertReceiver(isolate, receiver),
                                      Nothing<bool>());
@@ -1371,12 +1365,12 @@ Maybe<bool> DefinePropertyWithInterceptorInternal(
   // interceptor calls.
   AssertNoContextChange ncc(isolate);
 
-  if (interceptor->definer().IsUndefined(isolate)) return Just(false);
+  if (IsUndefined(interceptor->definer(), isolate)) return Just(false);
 
   Handle<JSObject> holder = it->GetHolder<JSObject>();
   bool result;
   Handle<Object> receiver = it->GetReceiver();
-  if (!receiver->IsJSReceiver()) {
+  if (!IsJSReceiver(*receiver)) {
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, receiver,
                                      Object::ConvertReceiver(isolate, receiver),
                                      Nothing<bool>());
@@ -1385,8 +1379,26 @@ Maybe<bool> DefinePropertyWithInterceptorInternal(
   std::unique_ptr<v8::PropertyDescriptor> descriptor(
       new v8::PropertyDescriptor());
   if (PropertyDescriptor::IsAccessorDescriptor(desc)) {
-    descriptor.reset(new v8::PropertyDescriptor(
-        v8::Utils::ToLocal(desc->get()), v8::Utils::ToLocal(desc->set())));
+    Handle<Object> getter = desc->get();
+    if (!getter.is_null() && IsFunctionTemplateInfo(*getter)) {
+      ASSIGN_RETURN_ON_EXCEPTION_VALUE(
+          isolate, getter,
+          ApiNatives::InstantiateFunction(
+              isolate, Handle<FunctionTemplateInfo>::cast(getter),
+              MaybeHandle<Name>()),
+          Nothing<bool>());
+    }
+    Handle<Object> setter = desc->set();
+    if (!setter.is_null() && IsFunctionTemplateInfo(*setter)) {
+      ASSIGN_RETURN_ON_EXCEPTION_VALUE(
+          isolate, setter,
+          ApiNatives::InstantiateFunction(
+              isolate, Handle<FunctionTemplateInfo>::cast(setter),
+              MaybeHandle<Name>()),
+          Nothing<bool>());
+    }
+    descriptor.reset(new v8::PropertyDescriptor(v8::Utils::ToLocal(getter),
+                                                v8::Utils::ToLocal(setter)));
   } else if (PropertyDescriptor::IsDataDescriptor(desc)) {
     if (desc->has_writable()) {
       descriptor.reset(new v8::PropertyDescriptor(
@@ -1540,7 +1552,8 @@ Maybe<bool> JSReceiver::ValidateAndApplyPropertyDescriptor(
                 ? desc->set()
                 : Handle<Object>::cast(isolate->factory()->null_value()));
         MaybeHandle<Object> result =
-            JSObject::DefineAccessor(it, getter, setter, desc->ToAttributes());
+            JSObject::DefineOwnAccessorIgnoreAttributes(it, getter, setter,
+                                                        desc->ToAttributes());
         if (result.is_null()) return Nothing<bool>();
       }
     }
@@ -1557,9 +1570,11 @@ Maybe<bool> JSReceiver::ValidateAndApplyPropertyDescriptor(
       (!desc->has_writable() ||
        (current->has_writable() && current->writable() == desc->writable())) &&
       (!desc->has_get() ||
-       (current->has_get() && current->get()->SameValue(*desc->get()))) &&
+       (current->has_get() &&
+        Object::SameValue(*current->get(), *desc->get()))) &&
       (!desc->has_set() ||
-       (current->has_set() && current->set()->SameValue(*desc->set())))) {
+       (current->has_set() &&
+        Object::SameValue(*current->set(), *desc->set())))) {
     return Just(true);
   }
   // 4. If current.[[Configurable]] is false, then
@@ -1637,7 +1652,8 @@ Maybe<bool> JSReceiver::ValidateAndApplyPropertyDescriptor(
         // We'll succeed applying the property, but the value is already the
         // same and the property is read-only, so skip actually writing the
         // property. Otherwise we may try to e.g., write to frozen elements.
-        if (desc->value()->SameValue(*current->value())) return Just(true);
+        if (Object::SameValue(*desc->value(), *current->value()))
+          return Just(true);
         RETURN_FAILURE(
             isolate, GetShouldThrow(isolate, should_throw),
             NewTypeError(MessageTemplate::kRedefineDisallowed,
@@ -1654,7 +1670,8 @@ Maybe<bool> JSReceiver::ValidateAndApplyPropertyDescriptor(
     if (!current->configurable()) {
       // 8a i. If Desc.[[Set]] is present and SameValue(Desc.[[Set]],
       // current.[[Set]]) is false, return false.
-      if (desc->has_set() && !desc->set()->SameValue(*current->set())) {
+      if (desc->has_set() &&
+          !Object::SameValue(*desc->set(), *current->set())) {
         RETURN_FAILURE(
             isolate, GetShouldThrow(isolate, should_throw),
             NewTypeError(MessageTemplate::kRedefineDisallowed,
@@ -1662,7 +1679,8 @@ Maybe<bool> JSReceiver::ValidateAndApplyPropertyDescriptor(
       }
       // 8a ii. If Desc.[[Get]] is present and SameValue(Desc.[[Get]],
       // current.[[Get]]) is false, return false.
-      if (desc->has_get() && !desc->get()->SameValue(*current->get())) {
+      if (desc->has_get() &&
+          !Object::SameValue(*desc->get(), *current->get())) {
         RETURN_FAILURE(
             isolate, GetShouldThrow(isolate, should_throw),
             NewTypeError(MessageTemplate::kRedefineDisallowed,
@@ -1702,10 +1720,9 @@ Maybe<bool> JSReceiver::ValidateAndApplyPropertyDescriptor(
       }
       Handle<Object> value(
           desc->has_value() ? desc->value()
-                            : current->has_value()
-                                  ? current->value()
-                                  : Handle<Object>::cast(
-                                        isolate->factory()->undefined_value()));
+          : current->has_value()
+              ? current->value()
+              : Handle<Object>::cast(isolate->factory()->undefined_value()));
       return JSObject::DefineOwnPropertyIgnoreAttributes(it, value, attrs,
                                                          should_throw);
     } else {
@@ -1713,19 +1730,17 @@ Maybe<bool> JSReceiver::ValidateAndApplyPropertyDescriptor(
              (desc_is_generic_descriptor &&
               PropertyDescriptor::IsAccessorDescriptor(current)));
       Handle<Object> getter(
-          desc->has_get()
-              ? desc->get()
-              : current->has_get()
-                    ? current->get()
-                    : Handle<Object>::cast(isolate->factory()->null_value()));
+          desc->has_get() ? desc->get()
+          : current->has_get()
+              ? current->get()
+              : Handle<Object>::cast(isolate->factory()->null_value()));
       Handle<Object> setter(
-          desc->has_set()
-              ? desc->set()
-              : current->has_set()
-                    ? current->set()
-                    : Handle<Object>::cast(isolate->factory()->null_value()));
-      MaybeHandle<Object> result =
-          JSObject::DefineAccessor(it, getter, setter, attrs);
+          desc->has_set() ? desc->set()
+          : current->has_set()
+              ? current->set()
+              : Handle<Object>::cast(isolate->factory()->null_value()));
+      MaybeHandle<Object> result = JSObject::DefineOwnAccessorIgnoreAttributes(
+          it, getter, setter, attrs);
       if (result.is_null()) return Nothing<bool>();
     }
   }
@@ -1753,7 +1768,7 @@ Maybe<bool> JSReceiver::CreateDataProperty(LookupIterator* it,
   Handle<JSReceiver> receiver = Handle<JSReceiver>::cast(it->GetReceiver());
   Isolate* isolate = it->isolate();
 
-  if (receiver->IsJSObject()) {
+  if (IsJSObject(*receiver)) {
     return JSObject::CreateDataProperty(it, value, should_throw);  // Shortcut.
   }
 
@@ -1772,7 +1787,7 @@ Maybe<bool> JSReceiver::AddPrivateField(LookupIterator* it,
                                         Handle<Object> value,
                                         Maybe<ShouldThrow> should_throw) {
   Handle<JSReceiver> receiver = Handle<JSReceiver>::cast(it->GetReceiver());
-  DCHECK(!receiver->IsAlwaysSharedSpaceJSObject());
+  DCHECK(!IsAlwaysSharedSpaceJSObject(*receiver));
   Isolate* isolate = it->isolate();
   DCHECK(it->GetName()->IsPrivateName());
   Handle<Symbol> symbol = Handle<Symbol>::cast(it->GetName());
@@ -1798,9 +1813,11 @@ Maybe<bool> JSReceiver::AddPrivateField(LookupIterator* it,
 
     case LookupIterator::ACCESS_CHECK: {
       if (!it->HasAccess()) {
-        it->isolate()->ReportFailedAccessCheck(it->GetHolder<JSObject>());
-        RETURN_VALUE_IF_SCHEDULED_EXCEPTION(it->isolate(), Nothing<bool>());
-        return Just(false);
+        RETURN_ON_EXCEPTION_VALUE(
+            isolate,
+            it->isolate()->ReportFailedAccessCheck(it->GetHolder<JSObject>()),
+            Nothing<bool>());
+        UNREACHABLE();
       }
       break;
     }
@@ -1819,7 +1836,7 @@ Maybe<bool> JSReceiver::GetOwnPropertyDescriptor(Isolate* isolate,
                                                  Handle<JSReceiver> object,
                                                  Handle<Object> key,
                                                  PropertyDescriptor* desc) {
-  DCHECK(key->IsName() || key->IsNumber());  // |key| is a PropertyKey.
+  DCHECK(IsName(*key) || IsNumber(*key));  // |key| is a PropertyKey.
   PropertyKey lookup_key(isolate, key);
   LookupIterator it(isolate, object, lookup_key, LookupIterator::OWN);
   return GetOwnPropertyDescriptor(&it, desc);
@@ -1850,13 +1867,13 @@ Maybe<bool> GetPropertyDescriptorWithInterceptor(LookupIterator* it,
   }
   if (interceptor.is_null()) return Just(false);
   Isolate* isolate = it->isolate();
-  if (interceptor->descriptor().IsUndefined(isolate)) return Just(false);
+  if (IsUndefined(interceptor->descriptor(), isolate)) return Just(false);
 
   Handle<Object> result;
   Handle<JSObject> holder = it->GetHolder<JSObject>();
 
   Handle<Object> receiver = it->GetReceiver();
-  if (!receiver->IsJSReceiver()) {
+  if (!IsJSReceiver(*receiver)) {
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, receiver,
                                      Object::ConvertReceiver(isolate, receiver),
                                      Nothing<bool>());
@@ -1897,7 +1914,7 @@ Maybe<bool> JSReceiver::GetOwnPropertyDescriptor(LookupIterator* it,
                                                  PropertyDescriptor* desc) {
   Isolate* isolate = it->isolate();
   // "Virtual" dispatch.
-  if (it->IsFound() && it->GetHolder<JSReceiver>()->IsJSProxy()) {
+  if (it->IsFound() && IsJSProxy(*it->GetHolder<JSReceiver>())) {
     return JSProxy::GetOwnPropertyDescriptor(isolate, it->GetHolder<JSProxy>(),
                                              it->GetName(), desc);
   }
@@ -1922,7 +1939,7 @@ Maybe<bool> JSReceiver::GetOwnPropertyDescriptor(LookupIterator* it,
   // 4. Let X be O's own property whose key is P.
   // 5. If X is a data property, then
   bool is_accessor_pair = it->state() == LookupIterator::ACCESSOR &&
-                          it->GetAccessors()->IsAccessorPair();
+                          IsAccessorPair(*it->GetAccessors());
   if (!is_accessor_pair) {
     // 5a. Set D.[[Value]] to the value of X's [[Value]] attribute.
     Handle<Object> value;
@@ -1962,11 +1979,11 @@ Maybe<bool> JSReceiver::SetIntegrityLevel(Isolate* isolate,
                                           ShouldThrow should_throw) {
   DCHECK(level == SEALED || level == FROZEN);
 
-  if (receiver->IsJSObject()) {
+  if (IsJSObject(*receiver)) {
     Handle<JSObject> object = Handle<JSObject>::cast(receiver);
 
     if (!object->HasSloppyArgumentsElements() &&
-        !object->IsJSModuleNamespace()) {  // Fast path.
+        !IsJSModuleNamespace(*object)) {  // Fast path.
       // Prevent memory leaks by not adding unnecessary transitions.
       Maybe<bool> test = JSObject::TestIntegrityLevel(isolate, object, level);
       MAYBE_RETURN(test, Nothing<bool>());
@@ -2064,7 +2081,7 @@ Maybe<bool> GenericTestIntegrityLevel(Isolate* isolate,
 Maybe<bool> JSReceiver::TestIntegrityLevel(Isolate* isolate,
                                            Handle<JSReceiver> receiver,
                                            IntegrityLevel level) {
-  if (!receiver->map().IsCustomElementsReceiverMap()) {
+  if (!IsCustomElementsReceiverMap(receiver->map())) {
     return JSObject::TestIntegrityLevel(
         isolate, Handle<JSObject>::cast(receiver), level);
   }
@@ -2074,25 +2091,25 @@ Maybe<bool> JSReceiver::TestIntegrityLevel(Isolate* isolate,
 Maybe<bool> JSReceiver::PreventExtensions(Isolate* isolate,
                                           Handle<JSReceiver> object,
                                           ShouldThrow should_throw) {
-  if (object->IsJSProxy()) {
+  if (IsJSProxy(*object)) {
     return JSProxy::PreventExtensions(Handle<JSProxy>::cast(object),
                                       should_throw);
   }
-  if (object->IsWasmObject()) {
+  if (IsWasmObject(*object)) {
     RETURN_FAILURE(isolate, kThrowOnError,
                    NewTypeError(MessageTemplate::kWasmObjectsAreOpaque));
   }
-  DCHECK(object->IsJSObject());
+  DCHECK(IsJSObject(*object));
   return JSObject::PreventExtensions(isolate, Handle<JSObject>::cast(object),
                                      should_throw);
 }
 
 Maybe<bool> JSReceiver::IsExtensible(Isolate* isolate,
                                      Handle<JSReceiver> object) {
-  if (object->IsJSProxy()) {
+  if (IsJSProxy(*object)) {
     return JSProxy::IsExtensible(Handle<JSProxy>::cast(object));
   }
-  if (object->IsWasmObject()) {
+  if (IsWasmObject(*object)) {
     return Just(false);
   }
   return Just(JSObject::IsExtensible(isolate, Handle<JSObject>::cast(object)));
@@ -2105,9 +2122,10 @@ MaybeHandle<Object> JSReceiver::ToPrimitive(Isolate* isolate,
   Handle<Object> exotic_to_prim;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, exotic_to_prim,
-      Object::GetMethod(receiver, isolate->factory()->to_primitive_symbol()),
+      Object::GetMethod(isolate, receiver,
+                        isolate->factory()->to_primitive_symbol()),
       Object);
-  if (!exotic_to_prim->IsUndefined(isolate)) {
+  if (!IsUndefined(*exotic_to_prim, isolate)) {
     Handle<Object> hint_string =
         isolate->factory()->ToPrimitiveHintString(hint);
     Handle<Object> result;
@@ -2115,7 +2133,7 @@ MaybeHandle<Object> JSReceiver::ToPrimitive(Isolate* isolate,
         isolate, result,
         Execution::Call(isolate, exotic_to_prim, receiver, 1, &hint_string),
         Object);
-    if (result->IsPrimitive()) return result;
+    if (IsPrimitive(*result)) return result;
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kCannotConvertToPrimitive),
                     Object);
@@ -2146,12 +2164,12 @@ MaybeHandle<Object> JSReceiver::OrdinaryToPrimitive(
     ASSIGN_RETURN_ON_EXCEPTION(isolate, method,
                                JSReceiver::GetProperty(isolate, receiver, name),
                                Object);
-    if (method->IsCallable()) {
+    if (IsCallable(*method)) {
       Handle<Object> result;
       ASSIGN_RETURN_ON_EXCEPTION(
           isolate, result,
           Execution::Call(isolate, method, receiver, 0, nullptr), Object);
-      if (result->IsPrimitive()) return result;
+      if (IsPrimitive(*result)) return result;
     }
   }
   THROW_NEW_ERROR(isolate,
@@ -2162,9 +2180,9 @@ MaybeHandle<Object> JSReceiver::OrdinaryToPrimitive(
 V8_WARN_UNUSED_RESULT Maybe<bool> FastGetOwnValuesOrEntries(
     Isolate* isolate, Handle<JSReceiver> receiver, bool get_entries,
     Handle<FixedArray>* result) {
-  Handle<Map> map(JSReceiver::cast(*receiver).map(), isolate);
+  Handle<Map> map(JSReceiver::cast(*receiver)->map(), isolate);
 
-  if (!map->IsJSObjectMap()) return Just(false);
+  if (!IsJSObjectMap(*map)) return Just(false);
   if (!map->OnlyHasSimpleProperties()) return Just(false);
 
   Handle<JSObject> object(JSObject::cast(*receiver), isolate);
@@ -2204,7 +2222,7 @@ V8_WARN_UNUSED_RESULT Maybe<bool> FastGetOwnValuesOrEntries(
     HandleScope inner_scope(isolate);
 
     Handle<Name> next_key(descriptors->GetKey(index), isolate);
-    if (!next_key->IsString()) continue;
+    if (!IsString(*next_key)) continue;
     Handle<Object> prop_value;
 
     // Directly decode from the descriptor array if |from| did not change shape.
@@ -2335,12 +2353,12 @@ Maybe<bool> JSReceiver::SetPrototype(Isolate* isolate,
                                      Handle<JSReceiver> object,
                                      Handle<Object> value, bool from_javascript,
                                      ShouldThrow should_throw) {
-  if (object->IsWasmObject()) {
+  if (IsWasmObject(*object)) {
     RETURN_FAILURE(isolate, should_throw,
                    NewTypeError(MessageTemplate::kWasmObjectsAreOpaque));
   }
 
-  if (object->IsJSProxy()) {
+  if (IsJSProxy(*object)) {
     return JSProxy::SetPrototype(isolate, Handle<JSProxy>::cast(object), value,
                                  from_javascript, should_throw);
   }
@@ -2352,24 +2370,24 @@ bool JSReceiver::HasProxyInPrototype(Isolate* isolate) {
   for (PrototypeIterator iter(isolate, *this, kStartAtReceiver,
                               PrototypeIterator::END_AT_NULL);
        !iter.IsAtEnd(); iter.AdvanceIgnoringProxies()) {
-    if (iter.GetCurrent().IsJSProxy()) return true;
+    if (IsJSProxy(iter.GetCurrent())) return true;
   }
   return false;
 }
 
 bool JSReceiver::IsCodeLike(Isolate* isolate) const {
   DisallowGarbageCollection no_gc;
-  Object maybe_constructor = map().GetConstructor();
-  if (!maybe_constructor.IsJSFunction()) return false;
-  if (!JSFunction::cast(maybe_constructor).shared().IsApiFunction()) {
+  Tagged<Object> maybe_constructor = map()->GetConstructor();
+  if (!IsJSFunction(maybe_constructor)) return false;
+  if (!JSFunction::cast(maybe_constructor)->shared()->IsApiFunction()) {
     return false;
   }
-  Object instance_template = JSFunction::cast(maybe_constructor)
-                                 .shared()
-                                 .get_api_func_data()
-                                 .GetInstanceTemplate();
-  if (instance_template.IsUndefined(isolate)) return false;
-  return ObjectTemplateInfo::cast(instance_template).code_like();
+  Tagged<Object> instance_template = JSFunction::cast(maybe_constructor)
+                                         ->shared()
+                                         ->api_func_data()
+                                         ->GetInstanceTemplate();
+  if (IsUndefined(instance_template, isolate)) return false;
+  return ObjectTemplateInfo::cast(instance_template)->code_like();
 }
 
 // static
@@ -2382,11 +2400,11 @@ MaybeHandle<JSObject> JSObject::New(Handle<JSFunction> constructor,
   // - the constructor itself.
   // If called through Reflect.construct, it's guaranteed to be a constructor.
   Isolate* const isolate = constructor->GetIsolate();
-  DCHECK(constructor->IsConstructor());
-  DCHECK(new_target->IsConstructor());
+  DCHECK(IsConstructor(*constructor));
+  DCHECK(IsConstructor(*new_target));
   DCHECK(!constructor->has_initial_map() ||
          !InstanceTypeChecker::IsJSFunction(
-             constructor->initial_map().instance_type()));
+             constructor->initial_map()->instance_type()));
 
   Handle<Map> initial_map;
   ASSIGN_RETURN_ON_EXCEPTION(
@@ -2431,9 +2449,9 @@ void JSObject::EnsureWritableFastElements(Handle<JSObject> object) {
   DCHECK(object->HasSmiOrObjectElements() ||
          object->HasFastStringWrapperElements() ||
          object->HasAnyNonextensibleElements());
-  FixedArray raw_elems = FixedArray::cast(object->elements());
+  Tagged<FixedArray> raw_elems = FixedArray::cast(object->elements());
   Isolate* isolate = object->GetIsolate();
-  if (raw_elems.map() != ReadOnlyRoots(isolate).fixed_cow_array_map()) return;
+  if (raw_elems->map() != ReadOnlyRoots(isolate).fixed_cow_array_map()) return;
   Handle<FixedArray> elems(raw_elems, isolate);
   Handle<FixedArray> writable_elems = isolate->factory()->CopyFixedArrayWithMap(
       elems, isolate->factory()->fixed_array_map());
@@ -2554,6 +2572,8 @@ int JSObject::GetHeaderSize(InstanceType type,
       return JSIteratorTakeHelper::kHeaderSize;
     case JS_ITERATOR_DROP_HELPER_TYPE:
       return JSIteratorDropHelper::kHeaderSize;
+    case JS_ITERATOR_FLAT_MAP_HELPER_TYPE:
+      return JSIteratorFlatMapHelper::kHeaderSize;
     case JS_MODULE_NAMESPACE_TYPE:
       return JSModuleNamespace::kHeaderSize;
     case JS_SHARED_ARRAY_TYPE:
@@ -2661,8 +2681,8 @@ bool JSObject::AllCanRead(LookupIterator* it) {
   for (it->Next(); it->IsFound(); it->Next()) {
     if (it->state() == LookupIterator::ACCESSOR) {
       auto accessors = it->GetAccessors();
-      if (accessors->IsAccessorInfo()) {
-        if (AccessorInfo::cast(*accessors).all_can_read()) return true;
+      if (IsAccessorInfo(*accessors)) {
+        if (AccessorInfo::cast(*accessors)->all_can_read()) return true;
       }
     } else if (it->state() == LookupIterator::INTERCEPTOR) {
       if (it->GetInterceptor()->all_can_read()) return true;
@@ -2705,13 +2725,13 @@ MaybeHandle<Object> JSObject::GetPropertyWithFailedAccessCheck(
   // Cross-Origin [[Get]] of Well-Known Symbols does not throw, and returns
   // undefined.
   Handle<Name> name = it->GetName();
-  if (name->IsSymbol() && Symbol::cast(*name).is_well_known_symbol()) {
+  if (IsSymbol(*name) && Symbol::cast(*name)->is_well_known_symbol()) {
     return it->factory()->undefined_value();
   }
 
-  isolate->ReportFailedAccessCheck(checked);
-  RETURN_EXCEPTION_IF_SCHEDULED_EXCEPTION(isolate, Object);
-  return it->factory()->undefined_value();
+  RETURN_ON_EXCEPTION(isolate, isolate->ReportFailedAccessCheck(checked),
+                      Object);
+  UNREACHABLE();
 }
 
 Maybe<PropertyAttributes> JSObject::GetPropertyAttributesWithFailedAccessCheck(
@@ -2736,9 +2756,9 @@ Maybe<PropertyAttributes> JSObject::GetPropertyAttributesWithFailedAccessCheck(
     if (isolate->has_pending_exception()) return Nothing<PropertyAttributes>();
     if (result.FromMaybe(ABSENT) != ABSENT) return result;
   }
-  isolate->ReportFailedAccessCheck(checked);
-  RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<PropertyAttributes>());
-  return Just(ABSENT);
+  RETURN_ON_EXCEPTION_VALUE(isolate, isolate->ReportFailedAccessCheck(checked),
+                            Nothing<PropertyAttributes>());
+  UNREACHABLE();
 }
 
 // static
@@ -2749,8 +2769,8 @@ bool JSObject::AllCanWrite(LookupIterator* it) {
   for (; it->IsFound() && it->state() != LookupIterator::JSPROXY; it->Next()) {
     if (it->state() == LookupIterator::ACCESSOR) {
       Handle<Object> accessors = it->GetAccessors();
-      if (accessors->IsAccessorInfo()) {
-        if (AccessorInfo::cast(*accessors).all_can_write()) return true;
+      if (IsAccessorInfo(*accessors)) {
+        if (AccessorInfo::cast(*accessors)->all_can_write()) return true;
       }
     }
   }
@@ -2773,21 +2793,21 @@ Maybe<bool> JSObject::SetPropertyWithFailedAccessCheck(
     if (isolate->has_pending_exception()) return Nothing<bool>();
     if (result.IsJust()) return result;
   }
-  isolate->ReportFailedAccessCheck(checked);
-  RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<bool>());
-  return Just(true);
+  RETURN_ON_EXCEPTION_VALUE(isolate, isolate->ReportFailedAccessCheck(checked),
+                            Nothing<bool>());
+  UNREACHABLE();
 }
 
 void JSObject::SetNormalizedProperty(Handle<JSObject> object, Handle<Name> name,
                                      Handle<Object> value,
                                      PropertyDetails details) {
   DCHECK(!object->HasFastProperties());
-  DCHECK(name->IsUniqueName());
+  DCHECK(IsUniqueName(*name));
   Isolate* isolate = object->GetIsolate();
 
   uint32_t hash = name->hash();
 
-  if (object->IsJSGlobalObject()) {
+  if (IsJSGlobalObject(*object)) {
     Handle<JSGlobalObject> global_obj = Handle<JSGlobalObject>::cast(object);
     Handle<GlobalDictionary> dictionary(
         global_obj->global_dictionary(kAcquireLoad), isolate);
@@ -2795,10 +2815,10 @@ void JSObject::SetNormalizedProperty(Handle<JSObject> object, Handle<Name> name,
     InternalIndex entry = dictionary->FindEntry(isolate, roots, name, hash);
 
     if (entry.is_not_found()) {
-      DCHECK_IMPLIES(global_obj->map().is_prototype_map(),
+      DCHECK_IMPLIES(global_obj->map()->is_prototype_map(),
                      Map::IsPrototypeChainInvalidated(global_obj->map()));
-      auto cell_type = value->IsUndefined(roots) ? PropertyCellType::kUndefined
-                                                 : PropertyCellType::kConstant;
+      auto cell_type = IsUndefined(*value, roots) ? PropertyCellType::kUndefined
+                                                  : PropertyCellType::kConstant;
       details = details.set_cell_type(cell_type);
       auto cell = isolate->factory()->NewPropertyCell(name, details, value);
       dictionary =
@@ -2807,7 +2827,7 @@ void JSObject::SetNormalizedProperty(Handle<JSObject> object, Handle<Name> name,
     } else {
       PropertyCell::PrepareForAndSetValue(isolate, dictionary, entry, value,
                                           details);
-      DCHECK_EQ(dictionary->CellAt(entry).value(), *value);
+      DCHECK_EQ(dictionary->CellAt(entry)->value(), *value);
     }
   } else {
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -2815,7 +2835,7 @@ void JSObject::SetNormalizedProperty(Handle<JSObject> object, Handle<Name> name,
           object->property_dictionary_swiss(), isolate);
       InternalIndex entry = dictionary->FindEntry(isolate, *name);
       if (entry.is_not_found()) {
-        DCHECK_IMPLIES(object->map().is_prototype_map(),
+        DCHECK_IMPLIES(object->map()->is_prototype_map(),
                        Map::IsPrototypeChainInvalidated(object->map()));
         dictionary =
             SwissNameDictionary::Add(isolate, dictionary, name, value, details);
@@ -2828,7 +2848,7 @@ void JSObject::SetNormalizedProperty(Handle<JSObject> object, Handle<Name> name,
       Handle<NameDictionary> dictionary(object->property_dictionary(), isolate);
       InternalIndex entry = dictionary->FindEntry(isolate, name);
       if (entry.is_not_found()) {
-        DCHECK_IMPLIES(object->map().is_prototype_map(),
+        DCHECK_IMPLIES(object->map()->is_prototype_map(),
                        Map::IsPrototypeChainInvalidated(object->map()));
         dictionary =
             NameDictionary::Add(isolate, dictionary, name, value, details);
@@ -2841,8 +2861,8 @@ void JSObject::SetNormalizedProperty(Handle<JSObject> object, Handle<Name> name,
         dictionary->SetEntry(entry, *name, *value, details);
       }
       // TODO(pthier): Add flags to swiss dictionaries.
-      if (name->IsInterestingSymbol()) {
-        dictionary->set_may_have_interesting_symbols(true);
+      if (name->IsInteresting(isolate)) {
+        dictionary->set_may_have_interesting_properties(true);
       }
     }
   }
@@ -2863,20 +2883,20 @@ void JSObject::SetNormalizedElement(Handle<JSObject> object, uint32_t index,
 }
 
 void JSObject::JSObjectShortPrint(StringStream* accumulator) {
-  switch (map().instance_type()) {
+  switch (map()->instance_type()) {
     case JS_ARRAY_TYPE: {
-      double length = JSArray::cast(*this).length().IsUndefined()
+      double length = IsUndefined(JSArray::cast(*this)->length())
                           ? 0
-                          : JSArray::cast(*this).length().Number();
+                          : Object::Number(JSArray::cast(*this)->length());
       accumulator->Add("<JSArray[%u]>", static_cast<uint32_t>(length));
       break;
     }
     case JS_BOUND_FUNCTION_TYPE: {
-      JSBoundFunction bound_function = JSBoundFunction::cast(*this);
+      Tagged<JSBoundFunction> bound_function = JSBoundFunction::cast(*this);
       accumulator->Add("<JSBoundFunction");
       accumulator->Add(" (BoundTargetFunction %p)>",
                        reinterpret_cast<void*>(
-                           bound_function.bound_target_function().ptr()));
+                           bound_function->bound_target_function().ptr()));
       break;
     }
     case JS_WEAK_MAP_TYPE: {
@@ -2889,10 +2909,10 @@ void JSObject::JSObjectShortPrint(StringStream* accumulator) {
     }
     case JS_REG_EXP_TYPE: {
       accumulator->Add("<JSRegExp");
-      JSRegExp regexp = JSRegExp::cast(*this);
-      if (regexp.source().IsString()) {
+      Tagged<JSRegExp> regexp = JSRegExp::cast(*this);
+      if (IsString(regexp->source())) {
         accumulator->Add(" ");
-        String::cast(regexp.source()).StringShortPrint(accumulator);
+        String::cast(regexp->source())->StringShortPrint(accumulator);
       }
       accumulator->Add(">");
 
@@ -2907,8 +2927,8 @@ void JSObject::JSObjectShortPrint(StringStream* accumulator) {
 #undef TYPED_ARRAY_CONSTRUCTORS_SWITCH
     case JS_CLASS_CONSTRUCTOR_TYPE:
     case JS_FUNCTION_TYPE: {
-      JSFunction function = JSFunction::cast(*this);
-      std::unique_ptr<char[]> fun_name = function.shared().DebugNameCStr();
+      Tagged<JSFunction> function = JSFunction::cast(*this);
+      std::unique_ptr<char[]> fun_name = function->shared()->DebugNameCStr();
       if (fun_name[0] != '\0') {
         accumulator->Add("<JSFunction ");
         accumulator->Add(fun_name.get());
@@ -2916,10 +2936,11 @@ void JSObject::JSObjectShortPrint(StringStream* accumulator) {
         accumulator->Add("<JSFunction");
       }
       if (v8_flags.trace_file_names) {
-        Object source_name = Script::cast(function.shared().script()).name();
-        if (source_name.IsString()) {
-          String str = String::cast(source_name);
-          if (str.length() > 0) {
+        Tagged<Object> source_name =
+            Script::cast(function->shared()->script())->name();
+        if (IsString(source_name)) {
+          Tagged<String> str = String::cast(source_name);
+          if (str->length() > 0) {
             accumulator->Add(" <");
             accumulator->Put(str);
             accumulator->Add(">");
@@ -2927,7 +2948,7 @@ void JSObject::JSObjectShortPrint(StringStream* accumulator) {
         }
       }
       accumulator->Add(" (sfi = %p)",
-                       reinterpret_cast<void*>(function.shared().ptr()));
+                       reinterpret_cast<void*>(function->shared().ptr()));
       accumulator->Put('>');
       break;
     }
@@ -2949,35 +2970,41 @@ void JSObject::JSObjectShortPrint(StringStream* accumulator) {
     case JS_SHARED_STRUCT_TYPE:
       accumulator->Add("<JSSharedStruct>");
       break;
+    case JS_MESSAGE_OBJECT_TYPE:
+      accumulator->Add("<JSMessageObject>");
+      break;
+    case JS_EXTERNAL_OBJECT_TYPE:
+      accumulator->Add("<JSExternalObject>");
+      break;
 
-    // All other JSObjects are rather similar to each other (JSObject,
-    // JSGlobalProxy, JSGlobalObject, JSUndetectable, JSPrimitiveWrapper).
     default: {
-      Map map_of_this = map();
+      Tagged<Map> map_of_this = map();
       Heap* heap = GetHeap();
-      Object constructor = map_of_this.GetConstructor();
+      Tagged<Object> constructor = map_of_this->GetConstructor();
       bool printed = false;
-      if (constructor.IsHeapObject() &&
+      if (IsHeapObject(constructor) &&
           !heap->Contains(HeapObject::cast(constructor))) {
         accumulator->Add("!!!INVALID CONSTRUCTOR!!!");
       } else {
-        bool is_global_proxy = IsJSGlobalProxy();
-        if (constructor.IsJSFunction()) {
-          if (!heap->Contains(JSFunction::cast(constructor).shared())) {
+        bool is_global_proxy = IsJSGlobalProxy(*this);
+        if (IsJSFunction(constructor)) {
+          Tagged<SharedFunctionInfo> sfi =
+              JSFunction::cast(constructor)->shared();
+          if (!sfi.InReadOnlySpace() && !heap->Contains(sfi)) {
             accumulator->Add("!!!INVALID SHARED ON CONSTRUCTOR!!!");
           } else {
-            String constructor_name =
-                JSFunction::cast(constructor).shared().Name();
-            if (constructor_name.length() > 0) {
+            Tagged<String> constructor_name = sfi->Name();
+            if (constructor_name->length() > 0) {
               accumulator->Add(is_global_proxy ? "<GlobalObject " : "<");
               accumulator->Put(constructor_name);
-              accumulator->Add(" %smap = %p",
-                               map_of_this.is_deprecated() ? "deprecated-" : "",
-                               map_of_this);
+              accumulator->Add(
+                  " %smap = %p",
+                  map_of_this->is_deprecated() ? "deprecated-" : "",
+                  map_of_this);
               printed = true;
             }
           }
-        } else if (constructor.IsFunctionTemplateInfo()) {
+        } else if (IsFunctionTemplateInfo(constructor)) {
           accumulator->Add("<RemoteObject>");
           printed = true;
         }
@@ -2985,16 +3012,16 @@ void JSObject::JSObjectShortPrint(StringStream* accumulator) {
           accumulator->Add("<JS");
           if (is_global_proxy) {
             accumulator->Add("GlobalProxy");
-          } else if (IsJSGlobalObject()) {
+          } else if (IsJSGlobalObject(*this)) {
             accumulator->Add("GlobalObject");
           } else {
             accumulator->Add("Object");
           }
         }
       }
-      if (IsJSPrimitiveWrapper()) {
+      if (IsJSPrimitiveWrapper(*this)) {
         accumulator->Add(" value = ");
-        JSPrimitiveWrapper::cast(*this).value().ShortPrint(accumulator);
+        ShortPrint(JSPrimitiveWrapper::cast(*this)->value(), accumulator);
       }
       accumulator->Put('>');
       break;
@@ -3013,64 +3040,64 @@ void JSObject::PrintElementsTransition(FILE* file, Handle<JSObject> object,
        << ElementsKindToString(to_kind) << "] in ";
     JavaScriptFrame::PrintTop(object->GetIsolate(), file, false, true);
     PrintF(file, " for ");
-    object->ShortPrint(file);
+    ShortPrint(*object, file);
     PrintF(file, " from ");
-    from_elements->ShortPrint(file);
+    ShortPrint(*from_elements, file);
     PrintF(file, " to ");
-    to_elements->ShortPrint(file);
+    ShortPrint(*to_elements, file);
     PrintF(file, "\n");
   }
 }
 
-void JSObject::PrintInstanceMigration(FILE* file, Map original_map,
-                                      Map new_map) {
-  if (new_map.is_dictionary_map()) {
+void JSObject::PrintInstanceMigration(FILE* file, Tagged<Map> original_map,
+                                      Tagged<Map> new_map) {
+  if (new_map->is_dictionary_map()) {
     PrintF(file, "[migrating to slow]\n");
     return;
   }
   PrintF(file, "[migrating]");
   Isolate* isolate = GetIsolate();
-  DescriptorArray o = original_map.instance_descriptors(isolate);
-  DescriptorArray n = new_map.instance_descriptors(isolate);
-  for (InternalIndex i : original_map.IterateOwnDescriptors()) {
-    Representation o_r = o.GetDetails(i).representation();
-    Representation n_r = n.GetDetails(i).representation();
+  Tagged<DescriptorArray> o = original_map->instance_descriptors(isolate);
+  Tagged<DescriptorArray> n = new_map->instance_descriptors(isolate);
+  for (InternalIndex i : original_map->IterateOwnDescriptors()) {
+    Representation o_r = o->GetDetails(i).representation();
+    Representation n_r = n->GetDetails(i).representation();
     if (!o_r.Equals(n_r)) {
-      String::cast(o.GetKey(i)).PrintOn(file);
+      String::cast(o->GetKey(i))->PrintOn(file);
       PrintF(file, ":%s->%s ", o_r.Mnemonic(), n_r.Mnemonic());
-    } else if (o.GetDetails(i).location() == PropertyLocation::kDescriptor &&
-               n.GetDetails(i).location() == PropertyLocation::kField) {
-      Name name = o.GetKey(i);
-      if (name.IsString()) {
-        String::cast(name).PrintOn(file);
+    } else if (o->GetDetails(i).location() == PropertyLocation::kDescriptor &&
+               n->GetDetails(i).location() == PropertyLocation::kField) {
+      Tagged<Name> name = o->GetKey(i);
+      if (IsString(name)) {
+        String::cast(name)->PrintOn(file);
       } else {
         PrintF(file, "{symbol %p}", reinterpret_cast<void*>(name.ptr()));
       }
       PrintF(file, " ");
     }
   }
-  if (original_map.elements_kind() != new_map.elements_kind()) {
-    PrintF(file, "elements_kind[%i->%i]", original_map.elements_kind(),
-           new_map.elements_kind());
+  if (original_map->elements_kind() != new_map->elements_kind()) {
+    PrintF(file, "elements_kind[%i->%i]", original_map->elements_kind(),
+           new_map->elements_kind());
   }
   PrintF(file, "\n");
 }
 
 bool JSObject::IsUnmodifiedApiObject(FullObjectSlot o) {
-  Object object = *o;
-  if (object.IsSmi()) return false;
-  HeapObject heap_object = HeapObject::cast(object);
-  if (!object.IsJSObject()) return false;
-  JSObject js_object = JSObject::cast(object);
-  if (!js_object.IsDroppableApiObject()) return false;
-  Object maybe_constructor = js_object.map().GetConstructor();
-  if (!maybe_constructor.IsJSFunction()) return false;
-  JSFunction constructor = JSFunction::cast(maybe_constructor);
-  if (js_object.elements().length() != 0) return false;
+  Tagged<Object> object = *o;
+  if (IsSmi(object)) return false;
+  Tagged<HeapObject> heap_object = HeapObject::cast(object);
+  if (!IsJSObject(object)) return false;
+  Tagged<JSObject> js_object = JSObject::cast(object);
+  if (!js_object->IsDroppableApiObject()) return false;
+  Tagged<Object> maybe_constructor = js_object->map()->GetConstructor();
+  if (!IsJSFunction(maybe_constructor)) return false;
+  Tagged<JSFunction> constructor = JSFunction::cast(maybe_constructor);
+  if (js_object->elements()->length() != 0) return false;
   // Check that the object is not a key in a WeakMap (over-approximation).
-  if (!js_object.GetIdentityHash().IsUndefined()) return false;
+  if (!IsUndefined(js_object->GetIdentityHash())) return false;
 
-  return constructor.initial_map() == heap_object.map();
+  return constructor->initial_map() == heap_object->map();
 }
 
 // static
@@ -3093,7 +3120,7 @@ void JSObject::UpdatePrototypeUserRegistration(Handle<Map> old_map,
       // The new map isn't registered with its prototype yet; reflect this fact
       // in the PrototypeInfo it just inherited from the old map.
       PrototypeInfo::cast(new_map->prototype_info())
-          .set_registry_slot(PrototypeInfo::UNREGISTERED);
+          ->set_registry_slot(PrototypeInfo::UNREGISTERED);
     }
     JSObject::LazyRegisterPrototypeUser(new_map, isolate);
   }
@@ -3155,7 +3182,7 @@ void MigrateFastToFast(Isolate* isolate, Handle<JSObject> object,
     // double boxes).
     FieldIndex index = FieldIndex::ForDetails(*new_map, details);
     if (index.is_inobject() || index.outobject_array_index() <
-                                   object->property_array(isolate).length()) {
+                                   object->property_array(isolate)->length()) {
       // Allocate HeapNumbers for double fields.
       if (index.is_double()) {
         auto value = isolate->factory()->NewHeapNumberWithHoleNaN();
@@ -3255,13 +3282,13 @@ void MigrateFastToFast(Isolate* isolate, Handle<JSObject> object,
       value = handle(object->RawFastPropertyAt(isolate, index), isolate);
       if (!old_representation.IsDouble() && representation.IsDouble()) {
         DCHECK_IMPLIES(old_representation.IsNone(),
-                       value->IsUninitialized(isolate));
+                       IsUninitialized(*value, isolate));
         value = Object::NewStorageFor(isolate, value, representation);
       } else if (old_representation.IsDouble() && !representation.IsDouble()) {
         value = Object::WrapForRead(isolate, value, old_representation);
       }
     }
-    DCHECK(!(representation.IsDouble() && value->IsSmi()));
+    DCHECK(!(representation.IsDouble() && IsSmi(*value)));
     int target_index = new_descriptors->GetFieldIndex(i);
     if (target_index < inobject) {
       inobject_props->set(target_index, *value);
@@ -3298,7 +3325,7 @@ void MigrateFastToFast(Isolate* isolate, Handle<JSObject> object,
   int limit = std::min(inobject, number_of_fields);
   for (int i = 0; i < limit; i++) {
     FieldIndex index = FieldIndex::ForPropertyIndex(*new_map, i);
-    Object value = inobject_props->get(isolate, i);
+    Tagged<Object> value = inobject_props->get(isolate, i);
     object->FastPropertyAtPut(index, value);
   }
 
@@ -3324,9 +3351,9 @@ void MigrateFastToSlow(Isolate* isolate, Handle<JSObject> object,
                        Handle<Map> new_map,
                        int expected_additional_properties) {
   // The global object is always normalized.
-  DCHECK(!object->IsJSGlobalObject(isolate));
+  DCHECK(!IsJSGlobalObject(*object, isolate));
   // JSGlobalProxy must never be normalized
-  DCHECK(!object->IsJSGlobalProxy(isolate));
+  DCHECK(!IsJSGlobalProxy(*object, isolate));
 
   DCHECK_IMPLIES(new_map->is_prototype_map(),
                  Map::IsPrototypeChainInvalidated(*new_map));
@@ -3365,7 +3392,7 @@ void MigrateFastToSlow(Isolate* isolate, Handle<JSObject> object,
       if (details.kind() == PropertyKind::kData) {
         value = handle(object->RawFastPropertyAt(isolate, index), isolate);
         if (details.representation().IsDouble()) {
-          DCHECK(value->IsHeapNumber(isolate));
+          DCHECK(IsHeapNumber(*value, isolate));
           double old_value = Handle<HeapNumber>::cast(value)->value();
           value = isolate->factory()->NewHeapNumber(old_value);
         }
@@ -3396,8 +3423,8 @@ void MigrateFastToSlow(Isolate* isolate, Handle<JSObject> object,
     // Copy the next enumeration index from instance descriptor.
     dictionary->set_next_enumeration_index(real_size + 1);
     // TODO(pthier): Add flags to swiss dictionaries.
-    dictionary->set_may_have_interesting_symbols(
-        map->may_have_interesting_symbols());
+    dictionary->set_may_have_interesting_properties(
+        map->may_have_interesting_properties());
   }
 
   // From here on we cannot fail and we shouldn't GC anymore.
@@ -3440,7 +3467,7 @@ void MigrateFastToSlow(Isolate* isolate, Handle<JSObject> object,
   if (v8_flags.trace_normalization) {
     StdoutStream os;
     os << "Object properties have been normalized:\n";
-    object->Print(os);
+    Print(*object, os);
   }
 #endif
 }
@@ -3476,7 +3503,7 @@ void JSObject::MigrateToMap(Isolate* isolate, Handle<JSObject> object,
       // Ensure that no transition was inserted for prototype migrations.
       DCHECK_EQ(0,
                 TransitionsAccessor(isolate, *old_map).NumberOfTransitions());
-      DCHECK(new_map->GetBackPointer(isolate).IsUndefined(isolate));
+      DCHECK(IsUndefined(new_map->GetBackPointer(isolate), isolate));
       DCHECK(object->map(isolate) != *old_map);
     }
   } else {
@@ -3514,8 +3541,9 @@ Handle<Map> JSObject::GetElementsTransitionMap(Handle<JSObject> object,
 }
 
 void JSObject::AllocateStorageForMap(Handle<JSObject> object, Handle<Map> map) {
-  DCHECK(object->map().GetInObjectProperties() == map->GetInObjectProperties());
-  ElementsKind obj_kind = object->map().elements_kind();
+  DCHECK(object->map()->GetInObjectProperties() ==
+         map->GetInObjectProperties());
+  ElementsKind obj_kind = object->map()->elements_kind();
   ElementsKind map_kind = map->elements_kind();
   Isolate* isolate = object->GetIsolate();
   if (map_kind != obj_kind) {
@@ -3561,7 +3589,7 @@ void JSObject::AllocateStorageForMap(Handle<JSObject> object, Handle<Map> map) {
   object->SetProperties(*array);
   for (int i = 0; i < inobject; i++) {
     FieldIndex index = FieldIndex::ForPropertyIndex(*map, i);
-    Object value = storage->get(i);
+    Tagged<Object> value = storage->get(i);
     object->FastPropertyAtPut(index, value);
   }
   object->set_map(*map, kReleaseStore);
@@ -3610,12 +3638,12 @@ void JSObject::AddProperty(Isolate* isolate, Handle<JSObject> object,
   CHECK_NE(LookupIterator::ACCESS_CHECK, it.state());
 #ifdef DEBUG
   uint32_t index;
-  DCHECK(!object->IsJSProxy());
+  DCHECK(!IsJSProxy(*object));
   DCHECK(!name->AsArrayIndex(&index));
   Maybe<PropertyAttributes> maybe = GetPropertyAttributes(&it);
   DCHECK(maybe.IsJust());
   DCHECK(!it.IsFound());
-  DCHECK(object->map().is_extensible() || name->IsPrivate());
+  DCHECK(object->map()->is_extensible() || name->IsPrivate());
 #endif
   CHECK(Object::AddDataProperty(&it, value, attributes,
                                 Just(ShouldThrow::kThrowOnError),
@@ -3660,9 +3688,12 @@ Maybe<bool> JSObject::DefineOwnPropertyIgnoreAttributes(
 
       case LookupIterator::ACCESS_CHECK:
         if (!it->HasAccess()) {
-          it->isolate()->ReportFailedAccessCheck(it->GetHolder<JSObject>());
-          RETURN_VALUE_IF_SCHEDULED_EXCEPTION(it->isolate(), Nothing<bool>());
-          return Just(true);
+          Isolate* isolate = it->isolate();
+          RETURN_ON_EXCEPTION_VALUE(
+              isolate,
+              isolate->ReportFailedAccessCheck(it->GetHolder<JSObject>()),
+              Nothing<bool>());
+          UNREACHABLE();
         }
         break;
 
@@ -3695,7 +3726,7 @@ Maybe<bool> JSObject::DefineOwnPropertyIgnoreAttributes(
 
         if (semantics == EnforceDefineSemantics::kDefine) {
           it->Restart();
-          Maybe<bool> can_define = JSReceiver::CheckIfCanDefine(
+          Maybe<bool> can_define = JSObject::CheckIfCanDefineAsConfigurable(
               it->isolate(), it, value, should_throw);
           if (can_define.IsNothing() || !can_define.FromJust()) {
             return can_define;
@@ -3706,10 +3737,8 @@ Maybe<bool> JSObject::DefineOwnPropertyIgnoreAttributes(
         // own property without the interceptor.
         Isolate* isolate = it->isolate();
         Handle<Object> receiver = it->GetReceiver();
-        LookupIterator::Configuration c = LookupIterator::OWN_SKIP_INTERCEPTOR;
-        LookupIterator own_lookup =
-            it->IsElement() ? LookupIterator(isolate, receiver, it->index(), c)
-                            : LookupIterator(isolate, receiver, it->name(), c);
+        LookupIterator own_lookup(isolate, receiver, it->GetKey(),
+                                  LookupIterator::OWN_SKIP_INTERCEPTOR);
         return JSObject::DefineOwnPropertyIgnoreAttributes(
             &own_lookup, value, attributes, should_throw, handling, semantics,
             store_origin);
@@ -3720,7 +3749,7 @@ Maybe<bool> JSObject::DefineOwnPropertyIgnoreAttributes(
 
         // Special handling for AccessorInfo, which behaves like a data
         // property.
-        if (accessors->IsAccessorInfo() && handling == DONT_FORCE_FIELD) {
+        if (IsAccessorInfo(*accessors) && handling == DONT_FORCE_FIELD) {
           PropertyAttributes current_attributes = it->property_attributes();
           // Ensure the context isn't changed after calling into accessors.
           AssertNoContextChange ncc(it->isolate());
@@ -3767,7 +3796,7 @@ Maybe<bool> JSObject::DefineOwnPropertyIgnoreAttributes(
 MaybeHandle<Object> JSObject::SetOwnPropertyIgnoreAttributes(
     Handle<JSObject> object, Handle<Name> name, Handle<Object> value,
     PropertyAttributes attributes) {
-  DCHECK(!value->IsTheHole());
+  DCHECK(!IsTheHole(*value));
   LookupIterator it(object->GetIsolate(), object, name, object,
                     LookupIterator::OWN);
   return DefineOwnPropertyIgnoreAttributes(&it, value, attributes);
@@ -3776,7 +3805,7 @@ MaybeHandle<Object> JSObject::SetOwnPropertyIgnoreAttributes(
 MaybeHandle<Object> JSObject::SetOwnElementIgnoreAttributes(
     Handle<JSObject> object, size_t index, Handle<Object> value,
     PropertyAttributes attributes) {
-  DCHECK(!object->IsJSTypedArray());
+  DCHECK(!IsJSTypedArray(*object));
   Isolate* isolate = object->GetIsolate();
   LookupIterator it(isolate, object, index, object, LookupIterator::OWN);
   return DefineOwnPropertyIgnoreAttributes(&it, value, attributes);
@@ -3814,7 +3843,7 @@ void JSObject::MigrateSlowToFast(Handle<JSObject> object,
                                  int unused_property_fields,
                                  const char* reason) {
   if (object->HasFastProperties()) return;
-  DCHECK(!object->IsJSGlobalObject());
+  DCHECK(!IsJSGlobalObject(*object));
   Isolate* isolate = object->GetIsolate();
   Factory* factory = isolate->factory();
 
@@ -3851,7 +3880,7 @@ void JSObject::MigrateSlowToFast(Handle<JSObject> object,
     PropertyKind kind;
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
       InternalIndex index(swiss_dictionary->EntryForEnumerationIndex(i));
-      Object key = swiss_dictionary->KeyAt(index);
+      Tagged<Object> key = swiss_dictionary->KeyAt(index);
       if (!SwissNameDictionary::IsKey(roots, key)) {
         // Ignore deleted entries.
         continue;
@@ -3876,8 +3905,8 @@ void JSObject::MigrateSlowToFast(Handle<JSObject> object,
   Handle<Map> new_map = Map::CopyDropDescriptors(isolate, old_map);
   // We should not only set this bit if we need to. We should not retain the
   // old bit because turning a map into dictionary always sets this bit.
-  new_map->set_may_have_interesting_symbols(new_map->has_named_interceptor() ||
-                                            new_map->is_access_check_needed());
+  new_map->set_may_have_interesting_properties(
+      new_map->has_named_interceptor() || new_map->is_access_check_needed());
   new_map->set_is_dictionary_map(false);
 
   NotifyMapChange(old_map, new_map, isolate);
@@ -3920,13 +3949,13 @@ void JSObject::MigrateSlowToFast(Handle<JSObject> object,
   int current_offset = 0;
   int descriptor_index = 0;
   for (int i = 0; i < iteration_length; i++) {
-    Name k;
-    Object value;
+    Tagged<Name> k;
+    Tagged<Object> value;
     PropertyDetails details = PropertyDetails::Empty();
 
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
       InternalIndex index(swiss_dictionary->EntryForEnumerationIndex(i));
-      Object key_obj = swiss_dictionary->KeyAt(index);
+      Tagged<Object> key_obj = swiss_dictionary->KeyAt(index);
       if (!SwissNameDictionary::IsKey(roots, key_obj)) {
         continue;
       }
@@ -3944,12 +3973,12 @@ void JSObject::MigrateSlowToFast(Handle<JSObject> object,
 
     // Dictionary keys are internalized upon insertion.
     // TODO(jkummerow): Turn this into a DCHECK if it's not hit in the wild.
-    CHECK(k.IsUniqueName());
+    CHECK(IsUniqueName(k));
     Handle<Name> key(k, isolate);
 
     // Properly mark the {new_map} if the {key} is an "interesting symbol".
-    if (key->IsInterestingSymbol()) {
-      new_map->set_may_have_interesting_symbols(true);
+    if (key->IsInteresting(isolate)) {
+      new_map->set_may_have_interesting_properties(true);
     }
 
     DCHECK_EQ(PropertyLocation::kField, details.location());
@@ -4009,18 +4038,18 @@ void JSObject::MigrateSlowToFast(Handle<JSObject> object,
   object->set_map(*new_map, kReleaseStore);
 
   object->SetProperties(*fields);
-  DCHECK(object->IsJSObject());
+  DCHECK(IsJSObject(*object));
 
   // Check that it really works.
   DCHECK(object->HasFastProperties());
 }
 
-void JSObject::RequireSlowElements(NumberDictionary dictionary) {
+void JSObject::RequireSlowElements(Tagged<NumberDictionary> dictionary) {
   DCHECK_NE(dictionary,
             ReadOnlyRoots(GetIsolate()).empty_slow_element_dictionary());
-  if (dictionary.requires_slow_elements()) return;
-  dictionary.set_requires_slow_elements();
-  if (map().is_prototype_map()) {
+  if (dictionary->requires_slow_elements()) return;
+  dictionary->set_requires_slow_elements();
+  if (map()->is_prototype_map()) {
     // If this object is a prototype (the callee will check), invalidate any
     // prototype chains involving it.
     InvalidatePrototypeChains(map());
@@ -4033,13 +4062,13 @@ Handle<NumberDictionary> JSObject::NormalizeElements(Handle<JSObject> object) {
   bool is_sloppy_arguments = object->HasSloppyArgumentsElements();
   {
     DisallowGarbageCollection no_gc;
-    FixedArrayBase elements = object->elements();
+    Tagged<FixedArrayBase> elements = object->elements();
 
     if (is_sloppy_arguments) {
-      elements = SloppyArgumentsElements::cast(elements).arguments();
+      elements = SloppyArgumentsElements::cast(elements)->arguments();
     }
 
-    if (elements.IsNumberDictionary()) {
+    if (IsNumberDictionary(elements)) {
       return handle(NumberDictionary::cast(elements), isolate);
     }
   }
@@ -4053,18 +4082,17 @@ Handle<NumberDictionary> JSObject::NormalizeElements(Handle<JSObject> object) {
       object->GetElementsAccessor()->Normalize(object);
 
   // Switch to using the dictionary as the backing storage for elements.
-  ElementsKind target_kind = is_sloppy_arguments
-                                 ? SLOW_SLOPPY_ARGUMENTS_ELEMENTS
-                                 : object->HasFastStringWrapperElements()
-                                       ? SLOW_STRING_WRAPPER_ELEMENTS
-                                       : DICTIONARY_ELEMENTS;
+  ElementsKind target_kind =
+      is_sloppy_arguments                      ? SLOW_SLOPPY_ARGUMENTS_ELEMENTS
+      : object->HasFastStringWrapperElements() ? SLOW_STRING_WRAPPER_ELEMENTS
+                                               : DICTIONARY_ELEMENTS;
   Handle<Map> new_map = JSObject::GetElementsTransitionMap(object, target_kind);
   // Set the new map first to satify the elements type assert in set_elements().
   JSObject::MigrateToMap(isolate, object, new_map);
 
   if (is_sloppy_arguments) {
     SloppyArgumentsElements::cast(object->elements())
-        .set_arguments(*dictionary);
+        ->set_arguments(*dictionary);
   } else {
     object->set_elements(*dictionary);
   }
@@ -4073,7 +4101,7 @@ Handle<NumberDictionary> JSObject::NormalizeElements(Handle<JSObject> object) {
   if (v8_flags.trace_normalization) {
     StdoutStream os;
     os << "Object elements have been normalized:\n";
-    object->Print(os);
+    Print(*object, os);
   }
 #endif
 
@@ -4092,11 +4120,11 @@ Maybe<bool> JSObject::DeletePropertyWithInterceptor(LookupIterator* it,
 
   DCHECK_EQ(LookupIterator::INTERCEPTOR, it->state());
   Handle<InterceptorInfo> interceptor(it->GetInterceptor());
-  if (interceptor->deleter().IsUndefined(isolate)) return Nothing<bool>();
+  if (IsUndefined(interceptor->deleter(), isolate)) return Nothing<bool>();
 
   Handle<JSObject> holder = it->GetHolder<JSObject>();
   Handle<Object> receiver = it->GetReceiver();
-  if (!receiver->IsJSReceiver()) {
+  if (!IsJSReceiver(*receiver)) {
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, receiver,
                                      Object::ConvertReceiver(isolate, receiver),
                                      Nothing<bool>());
@@ -4114,26 +4142,25 @@ Maybe<bool> JSObject::DeletePropertyWithInterceptor(LookupIterator* it,
   RETURN_VALUE_IF_SCHEDULED_EXCEPTION_DETECTOR(isolate, args, Nothing<bool>());
   if (result.is_null()) return Nothing<bool>();
 
-  DCHECK(result->IsBoolean());
+  DCHECK(IsBoolean(*result));
   args.AcceptSideEffects();
   // Rebox CustomArguments::kReturnValueIndex before returning.
-  return Just(result->IsTrue(isolate));
+  return Just(IsTrue(*result, isolate));
 }
 
 Maybe<bool> JSObject::CreateDataProperty(LookupIterator* it,
                                          Handle<Object> value,
                                          Maybe<ShouldThrow> should_throw) {
-  DCHECK(it->GetReceiver()->IsJSObject());
-  MAYBE_RETURN(JSReceiver::GetPropertyAttributes(it), Nothing<bool>());
+  DCHECK(IsJSObject(*it->GetReceiver()));
   Isolate* isolate = it->isolate();
 
-  Maybe<bool> can_define =
-      JSReceiver::CheckIfCanDefine(isolate, it, value, should_throw);
+  Maybe<bool> can_define = JSObject::CheckIfCanDefineAsConfigurable(
+      isolate, it, value, should_throw);
   if (can_define.IsNothing() || !can_define.FromJust()) {
     return can_define;
   }
 
-  RETURN_ON_EXCEPTION_VALUE(it->isolate(),
+  RETURN_ON_EXCEPTION_VALUE(isolate,
                             DefineOwnPropertyIgnoreAttributes(it, value, NONE),
                             Nothing<bool>());
 
@@ -4143,16 +4170,16 @@ Maybe<bool> JSObject::CreateDataProperty(LookupIterator* it,
 namespace {
 
 template <typename Dictionary>
-bool TestDictionaryPropertiesIntegrityLevel(Dictionary dict,
+bool TestDictionaryPropertiesIntegrityLevel(Tagged<Dictionary> dict,
                                             ReadOnlyRoots roots,
                                             PropertyAttributes level) {
   DCHECK(level == SEALED || level == FROZEN);
 
-  for (InternalIndex i : dict.IterateEntries()) {
-    Object key;
-    if (!dict.ToKey(roots, i, &key)) continue;
-    if (key.FilterKey(ALL_PROPERTIES)) continue;
-    PropertyDetails details = dict.DetailsAt(i);
+  for (InternalIndex i : dict->IterateEntries()) {
+    Tagged<Object> key;
+    if (!dict->ToKey(roots, i, &key)) continue;
+    if (Object::FilterKey(key, ALL_PROPERTIES)) continue;
+    PropertyDetails details = dict->DetailsAt(i);
     if (details.IsConfigurable()) return false;
     if (level == FROZEN && details.kind() == PropertyKind::kData &&
         !details.IsReadOnly()) {
@@ -4162,15 +4189,16 @@ bool TestDictionaryPropertiesIntegrityLevel(Dictionary dict,
   return true;
 }
 
-bool TestFastPropertiesIntegrityLevel(Map map, PropertyAttributes level) {
+bool TestFastPropertiesIntegrityLevel(Tagged<Map> map,
+                                      PropertyAttributes level) {
   DCHECK(level == SEALED || level == FROZEN);
-  DCHECK(!map.IsCustomElementsReceiverMap());
-  DCHECK(!map.is_dictionary_map());
+  DCHECK(!IsCustomElementsReceiverMap(map));
+  DCHECK(!map->is_dictionary_map());
 
-  DescriptorArray descriptors = map.instance_descriptors();
-  for (InternalIndex i : map.IterateOwnDescriptors()) {
-    if (descriptors.GetKey(i).IsPrivate()) continue;
-    PropertyDetails details = descriptors.GetDetails(i);
+  Tagged<DescriptorArray> descriptors = map->instance_descriptors();
+  for (InternalIndex i : map->IterateOwnDescriptors()) {
+    if (descriptors->GetKey(i)->IsPrivate()) continue;
+    PropertyDetails details = descriptors->GetDetails(i);
     if (details.IsConfigurable()) return false;
     if (level == FROZEN && details.kind() == PropertyKind::kData &&
         !details.IsReadOnly()) {
@@ -4180,34 +4208,36 @@ bool TestFastPropertiesIntegrityLevel(Map map, PropertyAttributes level) {
   return true;
 }
 
-bool TestPropertiesIntegrityLevel(JSObject object, PropertyAttributes level) {
-  DCHECK(!object.map().IsCustomElementsReceiverMap());
+bool TestPropertiesIntegrityLevel(Tagged<JSObject> object,
+                                  PropertyAttributes level) {
+  DCHECK(!IsCustomElementsReceiverMap(object->map()));
 
-  if (object.HasFastProperties()) {
-    return TestFastPropertiesIntegrityLevel(object.map(), level);
+  if (object->HasFastProperties()) {
+    return TestFastPropertiesIntegrityLevel(object->map(), level);
   }
 
   if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
     return TestDictionaryPropertiesIntegrityLevel(
-        object.property_dictionary_swiss(), object.GetReadOnlyRoots(), level);
+        object->property_dictionary_swiss(), object->GetReadOnlyRoots(), level);
   } else {
     return TestDictionaryPropertiesIntegrityLevel(
-        object.property_dictionary(), object.GetReadOnlyRoots(), level);
+        object->property_dictionary(), object->GetReadOnlyRoots(), level);
   }
 }
 
-bool TestElementsIntegrityLevel(JSObject object, PropertyAttributes level) {
-  DCHECK(!object.HasSloppyArgumentsElements());
+bool TestElementsIntegrityLevel(Tagged<JSObject> object,
+                                PropertyAttributes level) {
+  DCHECK(!object->HasSloppyArgumentsElements());
 
-  ElementsKind kind = object.GetElementsKind();
+  ElementsKind kind = object->GetElementsKind();
 
   if (IsDictionaryElementsKind(kind)) {
     return TestDictionaryPropertiesIntegrityLevel(
-        NumberDictionary::cast(object.elements()), object.GetReadOnlyRoots(),
+        NumberDictionary::cast(object->elements()), object->GetReadOnlyRoots(),
         level);
   }
   if (IsTypedArrayOrRabGsabTypedArrayElementsKind(kind)) {
-    if (level == FROZEN && JSArrayBufferView::cast(object).byte_length() > 0) {
+    if (level == FROZEN && JSArrayBufferView::cast(object)->byte_length() > 0) {
       return false;  // TypedArrays with elements can't be frozen.
     }
     return TestPropertiesIntegrityLevel(object, level);
@@ -4222,10 +4252,10 @@ bool TestElementsIntegrityLevel(JSObject object, PropertyAttributes level) {
   return accessor->NumberOfElements(object) == 0;
 }
 
-bool FastTestIntegrityLevel(JSObject object, PropertyAttributes level) {
-  DCHECK(!object.map().IsCustomElementsReceiverMap());
+bool FastTestIntegrityLevel(Tagged<JSObject> object, PropertyAttributes level) {
+  DCHECK(!IsCustomElementsReceiverMap(object->map()));
 
-  return !object.map().is_extensible() &&
+  return !object->map()->is_extensible() &&
          TestElementsIntegrityLevel(object, level) &&
          TestPropertiesIntegrityLevel(object, level);
 }
@@ -4235,7 +4265,7 @@ bool FastTestIntegrityLevel(JSObject object, PropertyAttributes level) {
 Maybe<bool> JSObject::TestIntegrityLevel(Isolate* isolate,
                                          Handle<JSObject> object,
                                          IntegrityLevel level) {
-  if (!object->map().IsCustomElementsReceiverMap() &&
+  if (!IsCustomElementsReceiverMap(object->map()) &&
       !object->HasSloppyArgumentsElements()) {
     return Just(FastTestIntegrityLevel(*object, level));
   }
@@ -4250,26 +4280,25 @@ Maybe<bool> JSObject::PreventExtensions(Isolate* isolate,
     return PreventExtensionsWithTransition<NONE>(isolate, object, should_throw);
   }
 
-  if (object->IsAccessCheckNeeded() &&
-      !isolate->MayAccess(handle(isolate->context(), isolate), object)) {
-    isolate->ReportFailedAccessCheck(object);
-    RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<bool>());
-    RETURN_FAILURE(isolate, should_throw,
-                   NewTypeError(MessageTemplate::kNoAccess));
+  if (IsAccessCheckNeeded(*object) &&
+      !isolate->MayAccess(isolate->native_context(), object)) {
+    RETURN_ON_EXCEPTION_VALUE(isolate, isolate->ReportFailedAccessCheck(object),
+                              Nothing<bool>());
+    UNREACHABLE();
   }
 
-  if (!object->map().is_extensible()) return Just(true);
+  if (!object->map()->is_extensible()) return Just(true);
 
-  if (object->IsJSGlobalProxy()) {
+  if (IsJSGlobalProxy(*object)) {
     PrototypeIterator iter(isolate, object);
     if (iter.IsAtEnd()) return Just(true);
-    DCHECK(PrototypeIterator::GetCurrent(iter)->IsJSGlobalObject());
+    DCHECK(IsJSGlobalObject(*PrototypeIterator::GetCurrent(iter)));
     return PreventExtensions(
         isolate, PrototypeIterator::GetCurrent<JSObject>(iter), should_throw);
   }
 
-  if (object->map().has_named_interceptor() ||
-      object->map().has_indexed_interceptor()) {
+  if (object->map()->has_named_interceptor() ||
+      object->map()->has_indexed_interceptor()) {
     RETURN_FAILURE(isolate, should_throw,
                    NewTypeError(MessageTemplate::kCannotPreventExt));
   }
@@ -4293,30 +4322,30 @@ Maybe<bool> JSObject::PreventExtensions(Isolate* isolate,
 
   new_map->set_is_extensible(false);
   JSObject::MigrateToMap(isolate, object, new_map);
-  DCHECK(!object->map().is_extensible());
+  DCHECK(!object->map()->is_extensible());
 
   return Just(true);
 }
 
 bool JSObject::IsExtensible(Isolate* isolate, Handle<JSObject> object) {
-  if (object->IsAccessCheckNeeded() &&
-      !isolate->MayAccess(handle(isolate->context(), isolate), object)) {
+  if (IsAccessCheckNeeded(*object) &&
+      !isolate->MayAccess(isolate->native_context(), object)) {
     return true;
   }
-  if (object->IsJSGlobalProxy()) {
+  if (IsJSGlobalProxy(*object)) {
     PrototypeIterator iter(isolate, *object);
     if (iter.IsAtEnd()) return false;
-    DCHECK(iter.GetCurrent().IsJSGlobalObject());
-    return iter.GetCurrent<JSObject>().map().is_extensible();
+    DCHECK(IsJSGlobalObject(iter.GetCurrent()));
+    return iter.GetCurrent<JSObject>()->map()->is_extensible();
   }
-  return object->map().is_extensible();
+  return object->map()->is_extensible();
 }
 
 // static
 MaybeHandle<Object> JSObject::ReadFromOptionsBag(Handle<Object> options,
                                                  Handle<String> option_name,
                                                  Isolate* isolate) {
-  if (options->IsJSReceiver()) {
+  if (IsJSReceiver(*options)) {
     Handle<JSReceiver> js_options = Handle<JSReceiver>::cast(options);
     return JSObject::GetProperty(isolate, js_options, option_name);
   }
@@ -4328,15 +4357,15 @@ void JSObject::ApplyAttributesToDictionary(
     Isolate* isolate, ReadOnlyRoots roots, Handle<Dictionary> dictionary,
     const PropertyAttributes attributes) {
   for (InternalIndex i : dictionary->IterateEntries()) {
-    Object k;
+    Tagged<Object> k;
     if (!dictionary->ToKey(roots, i, &k)) continue;
-    if (k.FilterKey(ALL_PROPERTIES)) continue;
+    if (Object::FilterKey(k, ALL_PROPERTIES)) continue;
     PropertyDetails details = dictionary->DetailsAt(i);
     int attrs = attributes;
     // READ_ONLY is an invalid attribute for JS setters/getters.
     if ((attributes & READ_ONLY) && details.kind() == PropertyKind::kAccessor) {
-      Object v = dictionary->ValueAt(i);
-      if (v.IsAccessorPair()) attrs &= ~READ_ONLY;
+      Tagged<Object> v = dictionary->ValueAt(i);
+      if (IsAccessorPair(v)) attrs &= ~READ_ONLY;
     }
     details = details.CopyAddAttributes(PropertyAttributesFromInt(attrs));
     dictionary->DetailsAtPut(i, details);
@@ -4353,9 +4382,9 @@ Handle<NumberDictionary> CreateElementDictionary(Isolate* isolate,
   if (!object->HasTypedArrayOrRabGsabTypedArrayElements() &&
       !object->HasDictionaryElements() &&
       !object->HasSlowStringWrapperElements()) {
-    int length = object->IsJSArray()
+    int length = IsJSArray(*object)
                      ? Smi::ToInt(Handle<JSArray>::cast(object)->length())
-                     : object->elements().length();
+                     : object->elements()->length();
     new_element_dictionary =
         length == 0 ? isolate->factory()->empty_slow_element_dictionary()
                     : object->GetElementsAccessor()->Normalize(object);
@@ -4371,32 +4400,31 @@ Maybe<bool> JSObject::PreventExtensionsWithTransition(
   // Sealing/freezing sloppy arguments or namespace objects should be handled
   // elsewhere.
   DCHECK(!object->HasSloppyArgumentsElements());
-  DCHECK_IMPLIES(object->IsJSModuleNamespace(), attrs == NONE);
+  DCHECK_IMPLIES(IsJSModuleNamespace(*object), attrs == NONE);
 
-  if (object->IsAccessCheckNeeded() &&
-      !isolate->MayAccess(handle(isolate->context(), isolate), object)) {
-    isolate->ReportFailedAccessCheck(object);
-    RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<bool>());
-    RETURN_FAILURE(isolate, should_throw,
-                   NewTypeError(MessageTemplate::kNoAccess));
+  if (IsAccessCheckNeeded(*object) &&
+      !isolate->MayAccess(isolate->native_context(), object)) {
+    RETURN_ON_EXCEPTION_VALUE(isolate, isolate->ReportFailedAccessCheck(object),
+                              Nothing<bool>());
+    UNREACHABLE();
   }
 
-  if (attrs == NONE && !object->map().is_extensible()) {
+  if (attrs == NONE && !object->map()->is_extensible()) {
     return Just(true);
   }
 
   {
-    ElementsKind old_elements_kind = object->map().elements_kind();
+    ElementsKind old_elements_kind = object->map()->elements_kind();
     if (IsFrozenElementsKind(old_elements_kind)) return Just(true);
     if (attrs != FROZEN && IsSealedElementsKind(old_elements_kind)) {
       return Just(true);
     }
   }
 
-  if (object->IsJSGlobalProxy()) {
+  if (IsJSGlobalProxy(*object)) {
     PrototypeIterator iter(isolate, object);
     if (iter.IsAtEnd()) return Just(true);
-    DCHECK(PrototypeIterator::GetCurrent(iter)->IsJSGlobalObject());
+    DCHECK(IsJSGlobalObject(*PrototypeIterator::GetCurrent(iter)));
     return PreventExtensionsWithTransition<attrs>(
         isolate, PrototypeIterator::GetCurrent<JSObject>(iter), should_throw);
   }
@@ -4405,15 +4433,15 @@ Maybe<bool> JSObject::PreventExtensionsWithTransition(
   // effectively immutable. They are constructed seal, but the semantics of
   // ordinary ECMAScript objects allow sealed to be upgraded to frozen. This
   // upgrade violates the fixed layout invariant and is disallowed.
-  if (object->IsAlwaysSharedSpaceJSObject()) {
+  if (IsAlwaysSharedSpaceJSObject(*object)) {
     DCHECK(FastTestIntegrityLevel(*object, SEALED));
     if (attrs != FROZEN) return Just(true);
     RETURN_FAILURE(isolate, should_throw,
                    NewTypeError(MessageTemplate::kCannotFreeze));
   }
 
-  if (object->map().has_named_interceptor() ||
-      object->map().has_indexed_interceptor()) {
+  if (object->map()->has_named_interceptor() ||
+      object->map()->has_indexed_interceptor()) {
     MessageTemplate message = MessageTemplate::kNone;
     switch (attrs) {
       case NONE:
@@ -4447,7 +4475,7 @@ Maybe<bool> JSObject::PreventExtensionsWithTransition(
   // elements kind, we will transition to Object elements kind first to make
   // sure of valid element access.
   if (v8_flags.enable_sealed_frozen_elements_kind) {
-    switch (object->map().elements_kind()) {
+    switch (object->map()->elements_kind()) {
       case PACKED_SMI_ELEMENTS:
       case PACKED_DOUBLE_ELEMENTS:
         JSObject::TransitionElementsKind(object, PACKED_ELEMENTS);
@@ -4511,9 +4539,9 @@ Maybe<bool> JSObject::PreventExtensionsWithTransition(
 
     if (attrs != NONE) {
       ReadOnlyRoots roots(isolate);
-      if (object->IsJSGlobalObject()) {
+      if (IsJSGlobalObject(*object)) {
         Handle<GlobalDictionary> dictionary(
-            JSGlobalObject::cast(*object).global_dictionary(kAcquireLoad),
+            JSGlobalObject::cast(*object)->global_dictionary(kAcquireLoad),
             isolate);
         JSObject::ApplyAttributesToDictionary(isolate, roots, dictionary,
                                               attrs);
@@ -4531,7 +4559,7 @@ Maybe<bool> JSObject::PreventExtensionsWithTransition(
     }
   }
 
-  if (object->map().has_any_nonextensible_elements()) {
+  if (object->map()->has_any_nonextensible_elements()) {
     DCHECK(new_element_dictionary.is_null());
     return Just(true);
   }
@@ -4540,7 +4568,7 @@ Maybe<bool> JSObject::PreventExtensionsWithTransition(
   // typed array elements. Freeze works only if there are no actual elements.
   if (object->HasTypedArrayOrRabGsabTypedArrayElements()) {
     DCHECK(new_element_dictionary.is_null());
-    if (attrs == FROZEN && JSTypedArray::cast(*object).GetLength() > 0) {
+    if (attrs == FROZEN && JSTypedArray::cast(*object)->GetLength() > 0) {
       isolate->Throw(*isolate->factory()->NewTypeError(
           MessageTemplate::kCannotFreezeArrayBufferView));
       return Nothing<bool>();
@@ -4548,8 +4576,8 @@ Maybe<bool> JSObject::PreventExtensionsWithTransition(
     return Just(true);
   }
 
-  DCHECK(object->map().has_dictionary_elements() ||
-         object->map().elements_kind() == SLOW_STRING_WRAPPER_ELEMENTS);
+  DCHECK(object->map()->has_dictionary_elements() ||
+         object->map()->elements_kind() == SLOW_STRING_WRAPPER_ELEMENTS);
   if (!new_element_dictionary.is_null()) {
     object->set_elements(*new_element_dictionary);
   }
@@ -4590,29 +4618,29 @@ Handle<Object> JSObject::DictionaryPropertyAt(Isolate* isolate,
                                               InternalIndex dict_index) {
   DCHECK_EQ(ThreadId::Current(), isolate->thread_id());
   if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-    SwissNameDictionary dict = object->property_dictionary_swiss();
-    return handle(dict.ValueAt(dict_index), isolate);
+    Tagged<SwissNameDictionary> dict = object->property_dictionary_swiss();
+    return handle(dict->ValueAt(dict_index), isolate);
   } else {
-    NameDictionary dict = object->property_dictionary();
-    return handle(dict.ValueAt(dict_index), isolate);
+    Tagged<NameDictionary> dict = object->property_dictionary();
+    return handle(dict->ValueAt(dict_index), isolate);
   }
 }
 
 // static
-base::Optional<Object> JSObject::DictionaryPropertyAt(Handle<JSObject> object,
-                                                      InternalIndex dict_index,
-                                                      Heap* heap) {
-  Object backing_store = object->raw_properties_or_hash(kRelaxedLoad);
-  if (!backing_store.IsHeapObject()) return {};
+base::Optional<Tagged<Object>> JSObject::DictionaryPropertyAt(
+    Handle<JSObject> object, InternalIndex dict_index, Heap* heap) {
+  Tagged<Object> backing_store = object->raw_properties_or_hash(kRelaxedLoad);
+  if (!IsHeapObject(backing_store)) return {};
   if (heap->IsPendingAllocation(HeapObject::cast(backing_store))) return {};
 
-  base::Optional<Object> maybe_obj;
+  base::Optional<Tagged<Object>> maybe_obj;
   if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-    if (!backing_store.IsSwissNameDictionary()) return {};
-    maybe_obj = SwissNameDictionary::cast(backing_store).TryValueAt(dict_index);
+    if (!IsSwissNameDictionary(backing_store)) return {};
+    maybe_obj =
+        SwissNameDictionary::cast(backing_store)->TryValueAt(dict_index);
   } else {
-    if (!backing_store.IsNameDictionary()) return {};
-    maybe_obj = NameDictionary::cast(backing_store).TryValueAt(dict_index);
+    if (!IsNameDictionary(backing_store)) return {};
+    maybe_obj = NameDictionary::cast(backing_store)->TryValueAt(dict_index);
   }
 
   if (!maybe_obj) return {};
@@ -4622,8 +4650,8 @@ base::Optional<Object> JSObject::DictionaryPropertyAt(Handle<JSObject> object,
 // TODO(cbruni/jkummerow): Consider moving this into elements.cc.
 bool JSObject::HasEnumerableElements() {
   // TODO(cbruni): cleanup
-  JSObject object = *this;
-  switch (object.GetElementsKind()) {
+  Tagged<JSObject> object = *this;
+  switch (object->GetElementsKind()) {
     case PACKED_SMI_ELEMENTS:
     case PACKED_ELEMENTS:
     case PACKED_FROZEN_ELEMENTS:
@@ -4631,9 +4659,9 @@ bool JSObject::HasEnumerableElements() {
     case PACKED_NONEXTENSIBLE_ELEMENTS:
     case PACKED_DOUBLE_ELEMENTS:
     case SHARED_ARRAY_ELEMENTS: {
-      int length = object.IsJSArray()
-                       ? Smi::ToInt(JSArray::cast(object).length())
-                       : object.elements().length();
+      int length = IsJSArray(object)
+                       ? Smi::ToInt(JSArray::cast(object)->length())
+                       : object->elements()->length();
       return length > 0;
     }
     case HOLEY_SMI_ELEMENTS:
@@ -4641,45 +4669,47 @@ bool JSObject::HasEnumerableElements() {
     case HOLEY_SEALED_ELEMENTS:
     case HOLEY_NONEXTENSIBLE_ELEMENTS:
     case HOLEY_ELEMENTS: {
-      FixedArray elements = FixedArray::cast(object.elements());
-      int length = object.IsJSArray()
-                       ? Smi::ToInt(JSArray::cast(object).length())
-                       : elements.length();
+      Tagged<FixedArray> elements = FixedArray::cast(object->elements());
+      int length = IsJSArray(object)
+                       ? Smi::ToInt(JSArray::cast(object)->length())
+                       : elements->length();
       Isolate* isolate = GetIsolate();
       for (int i = 0; i < length; i++) {
-        if (!elements.is_the_hole(isolate, i)) return true;
+        if (!elements->is_the_hole(isolate, i)) return true;
       }
       return false;
     }
     case HOLEY_DOUBLE_ELEMENTS: {
-      int length = object.IsJSArray()
-                       ? Smi::ToInt(JSArray::cast(object).length())
-                       : object.elements().length();
+      int length = IsJSArray(object)
+                       ? Smi::ToInt(JSArray::cast(object)->length())
+                       : object->elements()->length();
       // Zero-length arrays would use the empty FixedArray...
       if (length == 0) return false;
       // ...so only cast to FixedDoubleArray otherwise.
-      FixedDoubleArray elements = FixedDoubleArray::cast(object.elements());
+      Tagged<FixedDoubleArray> elements =
+          FixedDoubleArray::cast(object->elements());
       for (int i = 0; i < length; i++) {
-        if (!elements.is_the_hole(i)) return true;
+        if (!elements->is_the_hole(i)) return true;
       }
       return false;
     }
 #define TYPED_ARRAY_CASE(Type, type, TYPE, ctype) case TYPE##_ELEMENTS:
 
       TYPED_ARRAYS(TYPED_ARRAY_CASE) {
-        size_t length = JSTypedArray::cast(object).length();
+        size_t length = JSTypedArray::cast(object)->length();
         return length > 0;
       }
 
       RAB_GSAB_TYPED_ARRAYS(TYPED_ARRAY_CASE)
 #undef TYPED_ARRAY_CASE
       {
-        size_t length = JSTypedArray::cast(object).GetLength();
+        size_t length = JSTypedArray::cast(object)->GetLength();
         return length > 0;
       }
     case DICTIONARY_ELEMENTS: {
-      NumberDictionary elements = NumberDictionary::cast(object.elements());
-      return elements.NumberOfEnumerableProperties() > 0;
+      Tagged<NumberDictionary> elements =
+          NumberDictionary::cast(object->elements());
+      return elements->NumberOfEnumerableProperties() > 0;
     }
     case FAST_SLOPPY_ARGUMENTS_ELEMENTS:
     case SLOW_SLOPPY_ARGUMENTS_ELEMENTS:
@@ -4687,10 +4717,11 @@ bool JSObject::HasEnumerableElements() {
       return true;
     case FAST_STRING_WRAPPER_ELEMENTS:
     case SLOW_STRING_WRAPPER_ELEMENTS:
-      if (String::cast(JSPrimitiveWrapper::cast(object).value()).length() > 0) {
+      if (String::cast(JSPrimitiveWrapper::cast(object)->value())->length() >
+          0) {
         return true;
       }
-      return object.elements().length() > 0;
+      return object->elements()->length() > 0;
     case WASM_ARRAY_ELEMENTS:
       UNIMPLEMENTED();
 
@@ -4700,31 +4731,29 @@ bool JSObject::HasEnumerableElements() {
   UNREACHABLE();
 }
 
-MaybeHandle<Object> JSObject::DefineAccessor(Handle<JSObject> object,
-                                             Handle<Name> name,
-                                             Handle<Object> getter,
-                                             Handle<Object> setter,
-                                             PropertyAttributes attributes) {
+MaybeHandle<Object> JSObject::DefineOwnAccessorIgnoreAttributes(
+    Handle<JSObject> object, Handle<Name> name, Handle<Object> getter,
+    Handle<Object> setter, PropertyAttributes attributes) {
   Isolate* isolate = object->GetIsolate();
 
   PropertyKey key(isolate, name);
   LookupIterator it(isolate, object, key, LookupIterator::OWN_SKIP_INTERCEPTOR);
-  return DefineAccessor(&it, getter, setter, attributes);
+  return DefineOwnAccessorIgnoreAttributes(&it, getter, setter, attributes);
 }
 
-MaybeHandle<Object> JSObject::DefineAccessor(LookupIterator* it,
-                                             Handle<Object> getter,
-                                             Handle<Object> setter,
-                                             PropertyAttributes attributes) {
+MaybeHandle<Object> JSObject::DefineOwnAccessorIgnoreAttributes(
+    LookupIterator* it, Handle<Object> getter, Handle<Object> setter,
+    PropertyAttributes attributes) {
   Isolate* isolate = it->isolate();
 
   it->UpdateProtector();
 
   if (it->state() == LookupIterator::ACCESS_CHECK) {
     if (!it->HasAccess()) {
-      isolate->ReportFailedAccessCheck(it->GetHolder<JSObject>());
-      RETURN_EXCEPTION_IF_SCHEDULED_EXCEPTION(isolate, Object);
-      return isolate->factory()->undefined_value();
+      RETURN_ON_EXCEPTION(
+          isolate, isolate->ReportFailedAccessCheck(it->GetHolder<JSObject>()),
+          Object);
+      UNREACHABLE();
     }
     it->Next();
   }
@@ -4735,10 +4764,10 @@ MaybeHandle<Object> JSObject::DefineAccessor(LookupIterator* it,
     return it->factory()->undefined_value();
   }
 
-  DCHECK(getter->IsCallable() || getter->IsUndefined(isolate) ||
-         getter->IsNull(isolate) || getter->IsFunctionTemplateInfo());
-  DCHECK(setter->IsCallable() || setter->IsUndefined(isolate) ||
-         setter->IsNull(isolate) || setter->IsFunctionTemplateInfo());
+  DCHECK(IsCallable(*getter) || IsUndefined(*getter, isolate) ||
+         IsNull(*getter, isolate) || IsFunctionTemplateInfo(*getter));
+  DCHECK(IsCallable(*setter) || IsUndefined(*setter, isolate) ||
+         IsNull(*setter, isolate) || IsFunctionTemplateInfo(*setter));
   it->TransitionToAccessorProperty(getter, setter, attributes);
 
   return isolate->factory()->undefined_value();
@@ -4755,14 +4784,11 @@ MaybeHandle<Object> JSObject::SetAccessor(Handle<JSObject> object,
 
   // Duplicate ACCESS_CHECK outside of GetPropertyAttributes for the case that
   // the FailedAccessCheckCallbackFunction doesn't throw an exception.
-  //
-  // TODO(verwaest): Force throw an exception if the callback doesn't, so we can
-  // remove reliance on default return values.
   if (it.state() == LookupIterator::ACCESS_CHECK) {
     if (!it.HasAccess()) {
-      isolate->ReportFailedAccessCheck(object);
-      RETURN_EXCEPTION_IF_SCHEDULED_EXCEPTION(isolate, Object);
-      return it.factory()->undefined_value();
+      RETURN_ON_EXCEPTION(isolate, isolate->ReportFailedAccessCheck(object),
+                          Object);
+      UNREACHABLE();
     }
     it.Next();
   }
@@ -4772,85 +4798,110 @@ MaybeHandle<Object> JSObject::SetAccessor(Handle<JSObject> object,
     return it.factory()->undefined_value();
   }
 
-  CHECK(GetPropertyAttributes(&it).IsJust());
-
-  // ES5 forbids turning a property into an accessor if it's not
-  // configurable. See 8.6.1 (Table 5).
-  if (it.IsFound() && !it.IsConfigurable()) {
-    return it.factory()->undefined_value();
-  }
+  Maybe<bool> can_define = JSObject::CheckIfCanDefineAsConfigurable(
+      isolate, &it, info, Nothing<ShouldThrow>());
+  MAYBE_RETURN_NULL(can_define);
+  if (!can_define.FromJust()) return it.factory()->undefined_value();
 
   it.TransitionToAccessorPair(info, attributes);
 
   return object;
 }
 
-Object JSObject::SlowReverseLookup(Object value) {
+// static
+Maybe<bool> JSObject::CheckIfCanDefineAsConfigurable(
+    Isolate* isolate, LookupIterator* it, Handle<Object> value,
+    Maybe<ShouldThrow> should_throw) {
+  DCHECK(IsJSObject(*it->GetReceiver()));
+  if (it->IsFound()) {
+    Maybe<PropertyAttributes> attributes = GetPropertyAttributes(it);
+    MAYBE_RETURN(attributes, Nothing<bool>());
+    if (attributes.FromJust() != ABSENT) {
+      if ((attributes.FromJust() & DONT_DELETE) != 0) {
+        RETURN_FAILURE(
+            isolate, GetShouldThrow(isolate, should_throw),
+            NewTypeError(MessageTemplate::kRedefineDisallowed, it->GetName()));
+      }
+      return Just(true);
+    }
+    // Property does not exist, check object extensibility.
+  }
+  if (!JSObject::IsExtensible(isolate,
+                              Handle<JSObject>::cast(it->GetReceiver()))) {
+    RETURN_FAILURE(
+        isolate, GetShouldThrow(isolate, should_throw),
+        NewTypeError(MessageTemplate::kDefineDisallowed, it->GetName()));
+  }
+  return Just(true);
+}
+
+Tagged<Object> JSObject::SlowReverseLookup(Tagged<Object> value) {
   if (HasFastProperties()) {
-    DescriptorArray descs = map().instance_descriptors();
-    bool value_is_number = value.IsNumber();
-    for (InternalIndex i : map().IterateOwnDescriptors()) {
-      PropertyDetails details = descs.GetDetails(i);
+    Tagged<DescriptorArray> descs = map()->instance_descriptors();
+    bool value_is_number = IsNumber(value);
+    for (InternalIndex i : map()->IterateOwnDescriptors()) {
+      PropertyDetails details = descs->GetDetails(i);
       if (details.location() == PropertyLocation::kField) {
         DCHECK_EQ(PropertyKind::kData, details.kind());
         FieldIndex field_index = FieldIndex::ForDetails(map(), details);
-        Object property = RawFastPropertyAt(field_index);
+        Tagged<Object> property = RawFastPropertyAt(field_index);
         if (field_index.is_double()) {
-          DCHECK(property.IsHeapNumber());
-          if (value_is_number && property.Number() == value.Number()) {
-            return descs.GetKey(i);
+          DCHECK(IsHeapNumber(property));
+          if (value_is_number &&
+              Object::Number(property) == Object::Number(value)) {
+            return descs->GetKey(i);
           }
         } else if (property == value) {
-          return descs.GetKey(i);
+          return descs->GetKey(i);
         }
       } else {
         DCHECK_EQ(PropertyLocation::kDescriptor, details.location());
         if (details.kind() == PropertyKind::kData) {
-          if (descs.GetStrongValue(i) == value) {
-            return descs.GetKey(i);
+          if (descs->GetStrongValue(i) == value) {
+            return descs->GetKey(i);
           }
         }
       }
     }
     return GetReadOnlyRoots().undefined_value();
-  } else if (IsJSGlobalObject()) {
+  } else if (IsJSGlobalObject(*this)) {
     return JSGlobalObject::cast(*this)
-        .global_dictionary(kAcquireLoad)
-        .SlowReverseLookup(value);
+        ->global_dictionary(kAcquireLoad)
+        ->SlowReverseLookup(value);
   } else if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-    return property_dictionary_swiss().SlowReverseLookup(GetIsolate(), value);
+    return property_dictionary_swiss()->SlowReverseLookup(GetIsolate(), value);
   } else {
-    return property_dictionary().SlowReverseLookup(value);
+    return property_dictionary()->SlowReverseLookup(value);
   }
 }
 
-void JSObject::PrototypeRegistryCompactionCallback(HeapObject value,
+void JSObject::PrototypeRegistryCompactionCallback(Tagged<HeapObject> value,
                                                    int old_index,
                                                    int new_index) {
-  DCHECK(value.IsMap() && Map::cast(value).is_prototype_map());
-  Map map = Map::cast(value);
-  DCHECK(map.prototype_info().IsPrototypeInfo());
-  PrototypeInfo proto_info = PrototypeInfo::cast(map.prototype_info());
-  DCHECK_EQ(old_index, proto_info.registry_slot());
-  proto_info.set_registry_slot(new_index);
+  DCHECK(IsMap(value) && Map::cast(value)->is_prototype_map());
+  Tagged<Map> map = Map::cast(value);
+  DCHECK(IsPrototypeInfo(map->prototype_info()));
+  Tagged<PrototypeInfo> proto_info = PrototypeInfo::cast(map->prototype_info());
+  DCHECK_EQ(old_index, proto_info->registry_slot());
+  proto_info->set_registry_slot(new_index);
 }
 
 // static
 void JSObject::MakePrototypesFast(Handle<Object> receiver,
                                   WhereToStart where_to_start,
                                   Isolate* isolate) {
-  if (!receiver->IsJSReceiver()) return;
+  if (!IsJSReceiver(*receiver)) return;
   for (PrototypeIterator iter(isolate, Handle<JSReceiver>::cast(receiver),
                               where_to_start);
        !iter.IsAtEnd(); iter.Advance()) {
     Handle<Object> current = PrototypeIterator::GetCurrent(iter);
-    if (!current->IsJSObjectThatCanBeTrackedAsPrototype()) return;
+    if (!IsJSObjectThatCanBeTrackedAsPrototype(*current)) return;
     Handle<JSObject> current_obj = Handle<JSObject>::cast(current);
-    Map current_map = current_obj->map();
-    if (current_map.is_prototype_map()) {
+    Tagged<Map> current_map = current_obj->map();
+    if (current_map->is_prototype_map()) {
       // If the map is already marked as should be fast, we're done. Its
       // prototypes will have been marked already as well.
-      if (current_map.should_be_fast_prototype_map()) return;
+      if (current_map->should_be_fast_prototype_map()) return;
       Handle<Map> map(current_map, isolate);
       Map::SetShouldBeFastPrototypeMap(map, true, isolate);
       JSObject::OptimizeAsPrototype(current_obj);
@@ -4858,34 +4909,34 @@ void JSObject::MakePrototypesFast(Handle<Object> receiver,
   }
 }
 
-static bool PrototypeBenefitsFromNormalization(JSObject object) {
+static bool PrototypeBenefitsFromNormalization(Tagged<JSObject> object) {
   DisallowGarbageCollection no_gc;
-  if (!object.HasFastProperties()) return false;
-  if (object.IsJSGlobalProxy()) return false;
+  if (!object->HasFastProperties()) return false;
+  if (IsJSGlobalProxy(object)) return false;
   // TODO(v8:11248) make bootstrapper create dict mode prototypes, too?
-  if (object.GetIsolate()->bootstrapper()->IsActive()) return false;
+  if (object->GetIsolate()->bootstrapper()->IsActive()) return false;
   if (V8_DICT_PROPERTY_CONST_TRACKING_BOOL) return true;
-  return !object.map().is_prototype_map() ||
-         !object.map().should_be_fast_prototype_map();
+  return !object->map()->is_prototype_map() ||
+         !object->map()->should_be_fast_prototype_map();
 }
 
 // static
 void JSObject::OptimizeAsPrototype(Handle<JSObject> object,
                                    bool enable_setup_mode) {
-  DCHECK(object->IsJSObjectThatCanBeTrackedAsPrototype());
-  if (object->IsJSGlobalObject()) return;
+  DCHECK(IsJSObjectThatCanBeTrackedAsPrototype(*object));
+  if (IsJSGlobalObject(*object)) return;
   Isolate* isolate = object->GetIsolate();
-  if (object->map().is_prototype_map()) {
+  if (object->map()->is_prototype_map()) {
     if (enable_setup_mode && PrototypeBenefitsFromNormalization(*object)) {
       // This is the only way PrototypeBenefitsFromNormalization can be true:
-      DCHECK(!object->map().should_be_fast_prototype_map());
+      DCHECK(!object->map()->should_be_fast_prototype_map());
       // First normalize to ensure all JSFunctions are DATA_CONSTANT.
       constexpr bool kUseCache = true;
       JSObject::NormalizeProperties(isolate, object, KEEP_INOBJECT_PROPERTIES,
                                     0, kUseCache, "NormalizeAsPrototype");
     }
     if (!V8_DICT_PROPERTY_CONST_TRACKING_BOOL &&
-        object->map().should_be_fast_prototype_map() &&
+        object->map()->should_be_fast_prototype_map() &&
         !object->HasFastProperties()) {
       JSObject::MigrateSlowToFast(object, 0, "OptimizeAsPrototype");
     }
@@ -4915,13 +4966,24 @@ void JSObject::OptimizeAsPrototype(Handle<JSObject> object,
     // Replace the pointer to the exact constructor with the Object function
     // from the same context if undetectable from JS. This is to avoid keeping
     // memory alive unnecessarily.
-    Object maybe_constructor = new_map->GetConstructor();
-    if (maybe_constructor.IsJSFunction()) {
-      JSFunction constructor = JSFunction::cast(maybe_constructor);
-      if (!constructor.shared().IsApiFunction()) {
-        Context context = constructor.native_context();
-        JSFunction object_function = context.object_function();
-        new_map->SetConstructor(object_function);
+    Tagged<Object> maybe_constructor = new_map->GetConstructorRaw();
+    Tagged<Tuple2> tuple;
+    if (IsTuple2(maybe_constructor)) {
+      // Handle the {constructor, non-instance_prototype} tuple case if the map
+      // has non-instance prototype.
+      tuple = Tuple2::cast(maybe_constructor);
+      maybe_constructor = tuple->value1();
+    }
+    if (IsJSFunction(maybe_constructor)) {
+      Tagged<JSFunction> constructor = JSFunction::cast(maybe_constructor);
+      if (!constructor->shared()->IsApiFunction()) {
+        Tagged<NativeContext> context = constructor->native_context();
+        Tagged<JSFunction> object_function = context->object_function();
+        if (!tuple.is_null()) {
+          tuple->set_value1(object_function);
+        } else {
+          new_map->SetConstructor(object_function);
+        }
       }
     }
     JSObject::MigrateToMap(isolate, object, new_map);
@@ -4931,13 +4993,13 @@ void JSObject::OptimizeAsPrototype(Handle<JSObject> object,
       DisallowHeapAllocation no_gc;
 
       auto make_constant = [&](auto dict) {
-        for (InternalIndex index : dict.IterateEntries()) {
-          Object k;
-          if (!dict.ToKey(roots, index, &k)) continue;
+        for (InternalIndex index : dict->IterateEntries()) {
+          Tagged<Object> k;
+          if (!dict->ToKey(roots, index, &k)) continue;
 
-          PropertyDetails details = dict.DetailsAt(index);
+          PropertyDetails details = dict->DetailsAt(index);
           details = details.CopyWithConstness(PropertyConstness::kConst);
-          dict.DetailsAtPut(index, details);
+          dict->DetailsAtPut(index, details);
         }
       };
       if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -4949,19 +5011,19 @@ void JSObject::OptimizeAsPrototype(Handle<JSObject> object,
   }
 #ifdef DEBUG
   bool should_be_dictionary = V8_DICT_PROPERTY_CONST_TRACKING_BOOL &&
-                              enable_setup_mode && !object->IsJSGlobalProxy() &&
+                              enable_setup_mode && !IsJSGlobalProxy(*object) &&
                               !isolate->bootstrapper()->IsActive();
   DCHECK_IMPLIES(should_be_dictionary,
-                 object->map(isolate).is_dictionary_map());
+                 object->map(isolate)->is_dictionary_map());
 #endif
 }
 
 // static
 void JSObject::ReoptimizeIfPrototype(Handle<JSObject> object) {
   {
-    Map map = object->map();
-    if (!map.is_prototype_map()) return;
-    if (!map.should_be_fast_prototype_map()) return;
+    Tagged<Map> map = object->map();
+    if (!map->is_prototype_map()) return;
+    if (!map->should_be_fast_prototype_map()) return;
   }
   OptimizeAsPrototype(object);
 }
@@ -4990,13 +5052,13 @@ void JSObject::LazyRegisterPrototypeUser(Handle<Map> user, Isolate* isolate) {
     // change, so they don't need to be tracked as prototypes
     // anyway. Additionally, registering users of shared objects is not
     // threadsafe.
-    if (!maybe_proto->IsJSObjectThatCanBeTrackedAsPrototype()) continue;
+    if (!IsJSObjectThatCanBeTrackedAsPrototype(*maybe_proto)) continue;
     Handle<JSObject> proto = Handle<JSObject>::cast(maybe_proto);
     Handle<PrototypeInfo> proto_info =
         Map::GetOrCreatePrototypeInfo(proto, isolate);
     Handle<Object> maybe_registry(proto_info->prototype_users(), isolate);
     Handle<WeakArrayList> registry =
-        maybe_registry->IsSmi()
+        IsSmi(*maybe_registry)
             ? handle(ReadOnlyRoots(isolate->heap()).empty_weak_array_list(),
                      isolate)
             : Handle<WeakArrayList>::cast(maybe_registry);
@@ -5026,23 +5088,23 @@ bool JSObject::UnregisterPrototypeUser(Handle<Map> user, Isolate* isolate) {
   DCHECK(user->is_prototype_map());
   // If it doesn't have a PrototypeInfo, it was never registered.
   if (!user->has_prototype_info()) return false;
-  DCHECK(user->prototype_info().IsPrototypeInfo());
+  DCHECK(IsPrototypeInfo(user->prototype_info()));
   // If it had no prototype before, see if it had users that might expect
   // registration.
-  if (!user->prototype().IsJSObject()) {
-    Object users =
-        PrototypeInfo::cast(user->prototype_info()).prototype_users();
-    return users.IsWeakArrayList();
+  if (!IsJSObject(user->prototype())) {
+    Tagged<Object> users =
+        PrototypeInfo::cast(user->prototype_info())->prototype_users();
+    return IsWeakArrayList(users);
   }
   Handle<JSObject> prototype(JSObject::cast(user->prototype()), isolate);
   Handle<PrototypeInfo> user_info =
       Map::GetOrCreatePrototypeInfo(user, isolate);
   int slot = user_info->registry_slot();
   if (slot == PrototypeInfo::UNREGISTERED) return false;
-  DCHECK(prototype->map().is_prototype_map());
-  Object maybe_proto_info = prototype->map().prototype_info();
+  DCHECK(prototype->map()->is_prototype_map());
+  Tagged<Object> maybe_proto_info = prototype->map()->prototype_info();
   // User knows its registry slot, prototype info and user registry must exist.
-  DCHECK(maybe_proto_info.IsPrototypeInfo());
+  DCHECK(IsPrototypeInfo(maybe_proto_info));
   Handle<PrototypeInfo> proto_info(PrototypeInfo::cast(maybe_proto_info),
                                    isolate);
   Handle<WeakArrayList> prototype_users(
@@ -5062,24 +5124,24 @@ namespace {
 // This function must be kept in sync with
 // AccessorAssembler::InvalidateValidityCellIfPrototype() which does pre-checks
 // before jumping here.
-void InvalidateOnePrototypeValidityCellInternal(Map map) {
-  DCHECK(map.is_prototype_map());
+void InvalidateOnePrototypeValidityCellInternal(Tagged<Map> map) {
+  DCHECK(map->is_prototype_map());
   if (v8_flags.trace_prototype_users) {
     PrintF("Invalidating prototype map %p 's cell\n",
            reinterpret_cast<void*>(map.ptr()));
   }
-  Object maybe_cell = map.prototype_validity_cell(kRelaxedLoad);
-  if (maybe_cell.IsCell()) {
+  Tagged<Object> maybe_cell = map->prototype_validity_cell(kRelaxedLoad);
+  if (IsCell(maybe_cell)) {
     // Just set the value; the cell will be replaced lazily.
-    Cell cell = Cell::cast(maybe_cell);
-    Smi invalid_value = Smi::FromInt(Map::kPrototypeChainInvalid);
-    if (cell.value() != invalid_value) {
-      cell.set_value(invalid_value);
+    Tagged<Cell> cell = Cell::cast(maybe_cell);
+    Tagged<Smi> invalid_value = Smi::FromInt(Map::kPrototypeChainInvalid);
+    if (cell->value() != invalid_value) {
+      cell->set_value(invalid_value);
     }
   }
-  PrototypeInfo prototype_info;
-  if (map.TryGetPrototypeInfo(&prototype_info)) {
-    prototype_info.set_prototype_chain_enum_cache(Object());
+  Tagged<PrototypeInfo> prototype_info;
+  if (map->TryGetPrototypeInfo(&prototype_info)) {
+    prototype_info->set_prototype_chain_enum_cache(Object());
   }
 
   // We may inline accesses to constants stored in dictionary mode prototypes in
@@ -5093,7 +5155,7 @@ void InvalidateOnePrototypeValidityCellInternal(Map map) {
   // whenever the validity cell would be invalidated. However, the actual value
   // of the validity cell is not used. Therefore, we always trigger the de-opt
   // here, even if the cell was already invalid.
-  if (V8_DICT_PROPERTY_CONST_TRACKING_BOOL && map.is_dictionary_map()) {
+  if (V8_DICT_PROPERTY_CONST_TRACKING_BOOL && map->is_dictionary_map()) {
     // TODO(11527): pass Isolate as an argument.
     Isolate* isolate = GetIsolateFromWritableObject(map);
     DependentCode::DeoptimizeDependencyGroups(
@@ -5101,28 +5163,28 @@ void InvalidateOnePrototypeValidityCellInternal(Map map) {
   }
 }
 
-void InvalidatePrototypeChainsInternal(Map map) {
+void InvalidatePrototypeChainsInternal(Tagged<Map> map) {
   // We handle linear prototype chains by looping, and multiple children
   // by recursion, in order to reduce the likelihood of running into stack
   // overflows. So, conceptually, the outer loop iterates the depth of the
   // prototype tree, and the inner loop iterates the breadth of a node.
-  Map next_map;
+  Tagged<Map> next_map;
   for (; !map.is_null(); map = next_map, next_map = Map()) {
     InvalidateOnePrototypeValidityCellInternal(map);
 
-    PrototypeInfo proto_info;
-    if (!map.TryGetPrototypeInfo(&proto_info)) return;
-    if (!proto_info.prototype_users().IsWeakArrayList()) {
+    Tagged<PrototypeInfo> proto_info;
+    if (!map->TryGetPrototypeInfo(&proto_info)) return;
+    if (!IsWeakArrayList(proto_info->prototype_users())) {
       return;
     }
-    WeakArrayList prototype_users =
-        WeakArrayList::cast(proto_info.prototype_users());
+    Tagged<WeakArrayList> prototype_users =
+        WeakArrayList::cast(proto_info->prototype_users());
     // For now, only maps register themselves as users.
-    for (int i = PrototypeUsers::kFirstIndex; i < prototype_users.length();
+    for (int i = PrototypeUsers::kFirstIndex; i < prototype_users->length();
          ++i) {
-      HeapObject heap_object;
-      if (prototype_users.Get(i)->GetHeapObjectIfWeak(&heap_object) &&
-          heap_object.IsMap()) {
+      Tagged<HeapObject> heap_object;
+      if (prototype_users->Get(i).GetHeapObjectIfWeak(&heap_object) &&
+          IsMap(heap_object)) {
         // Walk the prototype chain (backwards, towards leaf objects) if
         // necessary.
         if (next_map.is_null()) {
@@ -5138,7 +5200,7 @@ void InvalidatePrototypeChainsInternal(Map map) {
 }  // namespace
 
 // static
-Map JSObject::InvalidatePrototypeChains(Map map) {
+Tagged<Map> JSObject::InvalidatePrototypeChains(Tagged<Map> map) {
   DisallowGarbageCollection no_gc;
   InvalidatePrototypeChainsInternal(map);
   return map;
@@ -5152,9 +5214,9 @@ Map JSObject::InvalidatePrototypeChains(Map map) {
 // in the prototype chain are not affected by appearance of a new lexical
 // variable and therefore we don't propagate invalidation down.
 // static
-void JSObject::InvalidatePrototypeValidityCell(JSGlobalObject global) {
+void JSObject::InvalidatePrototypeValidityCell(Tagged<JSGlobalObject> global) {
   DisallowGarbageCollection no_gc;
-  InvalidateOnePrototypeValidityCellInternal(global.map());
+  InvalidateOnePrototypeValidityCellInternal(global->map());
 }
 
 Maybe<bool> JSObject::SetPrototype(Isolate* isolate, Handle<JSObject> object,
@@ -5165,22 +5227,21 @@ Maybe<bool> JSObject::SetPrototype(Isolate* isolate, Handle<JSObject> object,
 #endif
 
   if (from_javascript) {
-    if (object->IsAccessCheckNeeded() &&
-        !isolate->MayAccess(handle(isolate->context(), isolate), object)) {
-      isolate->ReportFailedAccessCheck(object);
-      RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<bool>());
-      RETURN_FAILURE(isolate, should_throw,
-                     NewTypeError(MessageTemplate::kNoAccess));
+    if (IsAccessCheckNeeded(*object) &&
+        !isolate->MayAccess(isolate->native_context(), object)) {
+      RETURN_ON_EXCEPTION_VALUE(
+          isolate, isolate->ReportFailedAccessCheck(object), Nothing<bool>());
+      UNREACHABLE();
     }
   } else {
-    DCHECK(!object->IsAccessCheckNeeded());
+    DCHECK(!IsAccessCheckNeeded(*object));
   }
 
   // Silently ignore the change if value is not a JSObject or null.
   // SpiderMonkey behaves this way.
-  if (!value->IsJSReceiver() && !value->IsNull(isolate)) return Just(true);
+  if (!IsJSReceiver(*value) && !IsNull(*value, isolate)) return Just(true);
 
-  bool all_extensible = object->map().is_extensible();
+  bool all_extensible = object->map()->is_extensible();
   Handle<JSObject> real_receiver = object;
   if (from_javascript) {
     // Find the first object in the chain whose prototype object is not
@@ -5192,7 +5253,7 @@ Maybe<bool> JSObject::SetPrototype(Isolate* isolate, Handle<JSObject> object,
       // JSProxies.
       real_receiver = PrototypeIterator::GetCurrent<JSObject>(iter);
       iter.Advance();
-      all_extensible = all_extensible && real_receiver->map().is_extensible();
+      all_extensible = all_extensible && real_receiver->map()->is_extensible();
     }
   }
   Handle<Map> map(real_receiver->map(), isolate);
@@ -5203,7 +5264,7 @@ Maybe<bool> JSObject::SetPrototype(Isolate* isolate, Handle<JSObject> object,
   bool immutable_proto = map->is_immutable_proto();
   if (immutable_proto) {
     Handle<Object> msg;
-    if (object->IsJSObjectPrototype()) {  // is [[Object.prototype]]
+    if (IsJSObjectPrototype(*object)) {  // is [[Object.prototype]]
       msg = isolate->factory()->Object_prototype_string();
     } else {
       msg = object;
@@ -5227,7 +5288,7 @@ Maybe<bool> JSObject::SetPrototype(Isolate* isolate, Handle<JSObject> object,
   // Before we can set the prototype we need to be sure prototype cycles are
   // prevented.  It is sufficient to validate that the receiver is not in the
   // new prototype chain.
-  if (value->IsJSReceiver()) {
+  if (IsJSReceiver(*value)) {
     for (PrototypeIterator iter(isolate, JSReceiver::cast(*value),
                                 kStartAtReceiver);
          !iter.IsAtEnd(); iter.Advance()) {
@@ -5244,7 +5305,7 @@ Maybe<bool> JSObject::SetPrototype(Isolate* isolate, Handle<JSObject> object,
   isolate->UpdateNoElementsProtectorOnSetPrototype(real_receiver);
   isolate->UpdateTypedArraySpeciesLookupChainProtectorOnSetPrototype(
       real_receiver);
-  isolate->UpdateNumberStringPrototypeNoReplaceProtectorOnSetPrototype(
+  isolate->UpdateNumberStringNotRegexpLikeProtectorOnSetPrototype(
       real_receiver);
 
   Handle<Map> new_map =
@@ -5276,69 +5337,69 @@ void JSObject::EnsureCanContainElements(Handle<JSObject> object,
       object, FullObjectSlot(args->address_of_arg_at(0)), arg_count, mode);
 }
 
-void JSObject::ValidateElements(JSObject object) {
+void JSObject::ValidateElements(Tagged<JSObject> object) {
 #ifdef ENABLE_SLOW_DCHECKS
   if (v8_flags.enable_slow_asserts) {
-    object.GetElementsAccessor()->Validate(object);
+    object->GetElementsAccessor()->Validate(object);
   }
 #endif
 }
 
 bool JSObject::WouldConvertToSlowElements(uint32_t index) {
   if (!HasFastElements()) return false;
-  uint32_t capacity = static_cast<uint32_t>(elements().length());
+  uint32_t capacity = static_cast<uint32_t>(elements()->length());
   uint32_t new_capacity;
   return ShouldConvertToSlowElements(*this, capacity, index, &new_capacity);
 }
 
-static bool ShouldConvertToFastElements(JSObject object,
-                                        NumberDictionary dictionary,
+static bool ShouldConvertToFastElements(Tagged<JSObject> object,
+                                        Tagged<NumberDictionary> dictionary,
                                         uint32_t index,
                                         uint32_t* new_capacity) {
   // If properties with non-standard attributes or accessors were added, we
   // cannot go back to fast elements.
-  if (dictionary.requires_slow_elements()) return false;
+  if (dictionary->requires_slow_elements()) return false;
 
   // Adding a property with this index will require slow elements.
   if (index >= static_cast<uint32_t>(Smi::kMaxValue)) return false;
 
-  if (object.IsJSArray()) {
-    Object length = JSArray::cast(object).length();
-    if (!length.IsSmi()) return false;
+  if (IsJSArray(object)) {
+    Tagged<Object> length = JSArray::cast(object)->length();
+    if (!IsSmi(length)) return false;
     *new_capacity = static_cast<uint32_t>(Smi::ToInt(length));
-  } else if (object.IsJSArgumentsObject()) {
+  } else if (IsJSArgumentsObject(object)) {
     return false;
   } else {
-    *new_capacity = dictionary.max_number_key() + 1;
+    *new_capacity = dictionary->max_number_key() + 1;
   }
   *new_capacity = std::max(index + 1, *new_capacity);
 
-  uint32_t dictionary_size = static_cast<uint32_t>(dictionary.Capacity()) *
+  uint32_t dictionary_size = static_cast<uint32_t>(dictionary->Capacity()) *
                              NumberDictionary::kEntrySize;
 
   // Turn fast if the dictionary only saves 50% space.
   return 2 * dictionary_size >= *new_capacity;
 }
 
-static ElementsKind BestFittingFastElementsKind(JSObject object) {
-  if (!object.map().CanHaveFastTransitionableElementsKind()) {
+static ElementsKind BestFittingFastElementsKind(Tagged<JSObject> object) {
+  if (!object->map()->CanHaveFastTransitionableElementsKind()) {
     return HOLEY_ELEMENTS;
   }
-  if (object.HasSloppyArgumentsElements()) {
+  if (object->HasSloppyArgumentsElements()) {
     return FAST_SLOPPY_ARGUMENTS_ELEMENTS;
   }
-  if (object.HasStringWrapperElements()) {
+  if (object->HasStringWrapperElements()) {
     return FAST_STRING_WRAPPER_ELEMENTS;
   }
-  DCHECK(object.HasDictionaryElements());
-  NumberDictionary dictionary = object.element_dictionary();
+  DCHECK(object->HasDictionaryElements());
+  Tagged<NumberDictionary> dictionary = object->element_dictionary();
   ElementsKind kind = HOLEY_SMI_ELEMENTS;
-  for (InternalIndex i : dictionary.IterateEntries()) {
-    Object key = dictionary.KeyAt(i);
-    if (key.IsNumber()) {
-      Object value = dictionary.ValueAt(i);
-      if (!value.IsNumber()) return HOLEY_ELEMENTS;
-      if (!value.IsSmi()) {
+  for (InternalIndex i : dictionary->IterateEntries()) {
+    Tagged<Object> key = dictionary->KeyAt(i);
+    if (IsNumber(key)) {
+      Tagged<Object> value = dictionary->ValueAt(i);
+      if (!IsNumber(value)) return HOLEY_ELEMENTS;
+      if (!IsSmi(value)) {
         if (!v8_flags.unbox_double_arrays) return HOLEY_ELEMENTS;
         kind = HOLEY_DOUBLE_ELEMENTS;
       }
@@ -5353,20 +5414,20 @@ Maybe<bool> JSObject::AddDataElement(Handle<JSObject> object, uint32_t index,
                                      PropertyAttributes attributes) {
   Isolate* isolate = object->GetIsolate();
 
-  DCHECK(object->map(isolate).is_extensible());
+  DCHECK(object->map(isolate)->is_extensible());
 
   uint32_t old_length = 0;
   uint32_t new_capacity = 0;
 
-  if (object->IsJSArray(isolate)) {
-    CHECK(JSArray::cast(*object).length().ToArrayLength(&old_length));
+  if (IsJSArray(*object, isolate)) {
+    CHECK(Object::ToArrayLength(JSArray::cast(*object)->length(), &old_length));
   }
 
   ElementsKind kind = object->GetElementsKind(isolate);
-  FixedArrayBase elements = object->elements(isolate);
+  Tagged<FixedArrayBase> elements = object->elements(isolate);
   ElementsKind dictionary_kind = DICTIONARY_ELEMENTS;
   if (IsSloppyArgumentsElementsKind(kind)) {
-    elements = SloppyArgumentsElements::cast(elements).arguments(isolate);
+    elements = SloppyArgumentsElements::cast(elements)->arguments(isolate);
     dictionary_kind = SLOW_SLOPPY_ARGUMENTS_ELEMENTS;
   } else if (IsStringWrapperElementsKind(kind)) {
     dictionary_kind = SLOW_STRING_WRAPPER_ELEMENTS;
@@ -5374,19 +5435,19 @@ Maybe<bool> JSObject::AddDataElement(Handle<JSObject> object, uint32_t index,
 
   if (attributes != NONE) {
     kind = dictionary_kind;
-  } else if (elements.IsNumberDictionary(isolate)) {
+  } else if (IsNumberDictionary(elements, isolate)) {
     kind = ShouldConvertToFastElements(
                *object, NumberDictionary::cast(elements), index, &new_capacity)
                ? BestFittingFastElementsKind(*object)
                : dictionary_kind;
   } else if (ShouldConvertToSlowElements(
-                 *object, static_cast<uint32_t>(elements.length()), index,
+                 *object, static_cast<uint32_t>(elements->length()), index,
                  &new_capacity)) {
     kind = dictionary_kind;
   }
 
-  ElementsKind to = value->OptimalElementsKind(isolate);
-  if (IsHoleyElementsKind(kind) || !object->IsJSArray(isolate) ||
+  ElementsKind to = Object::OptimalElementsKind(*value, isolate);
+  if (IsHoleyElementsKind(kind) || !IsJSArray(*object, isolate) ||
       index > old_length) {
     to = GetHoleyElementsKind(to);
     kind = GetHoleyElementsKind(kind);
@@ -5396,10 +5457,10 @@ Maybe<bool> JSObject::AddDataElement(Handle<JSObject> object, uint32_t index,
   MAYBE_RETURN(accessor->Add(object, index, value, attributes, new_capacity),
                Nothing<bool>());
 
-  if (object->IsJSArray(isolate) && index >= old_length) {
+  if (IsJSArray(*object, isolate) && index >= old_length) {
     Handle<Object> new_length =
         isolate->factory()->NewNumberFromUint(index + 1);
-    JSArray::cast(*object).set_length(*new_length);
+    JSArray::cast(*object)->set_length(*new_length);
   }
   return Just(true);
 }
@@ -5407,7 +5468,7 @@ Maybe<bool> JSObject::AddDataElement(Handle<JSObject> object, uint32_t index,
 template <AllocationSiteUpdateMode update_or_check>
 bool JSObject::UpdateAllocationSite(Handle<JSObject> object,
                                     ElementsKind to_kind) {
-  if (!object->IsJSArray()) return false;
+  if (!IsJSArray(*object)) return false;
 
   if (!Heap::InYoungGeneration(*object)) return false;
 
@@ -5419,14 +5480,14 @@ bool JSObject::UpdateAllocationSite(Handle<JSObject> object,
 
     Heap* heap = object->GetHeap();
     PretenuringHandler* pretunring_handler = heap->pretenuring_handler();
-    AllocationMemento memento =
+    Tagged<AllocationMemento> memento =
         pretunring_handler
             ->FindAllocationMemento<PretenuringHandler::kForRuntime>(
                 object->map(), *object);
     if (memento.is_null()) return false;
 
     // Walk through to the Allocation Site
-    site = handle(memento.GetAllocationSite(), heap->isolate());
+    site = handle(memento->GetAllocationSite(), heap->isolate());
   }
   return AllocationSite::DigestTransitionFeedback<update_or_check>(site,
                                                                    to_kind);
@@ -5470,7 +5531,7 @@ void JSObject::TransitionElementsKind(Handle<JSObject> object,
   } else {
     DCHECK((IsSmiElementsKind(from_kind) && IsDoubleElementsKind(to_kind)) ||
            (IsDoubleElementsKind(from_kind) && IsObjectElementsKind(to_kind)));
-    uint32_t c = static_cast<uint32_t>(object->elements().length());
+    uint32_t c = static_cast<uint32_t>(object->elements()->length());
     if (ElementsAccessor::ForKind(to_kind)
             ->GrowCapacityAndConvert(object, c)
             .IsNothing()) {
@@ -5486,19 +5547,20 @@ void JSObject::TransitionElementsKind(Handle<JSObject> object,
 }
 
 template <typename BackingStore>
-static int HoleyElementsUsage(JSObject object, BackingStore store) {
-  Isolate* isolate = object.GetIsolate();
-  int limit = object.IsJSArray() ? Smi::ToInt(JSArray::cast(object).length())
-                                 : store.length();
+static int HoleyElementsUsage(Tagged<JSObject> object,
+                              Tagged<BackingStore> store) {
+  Isolate* isolate = object->GetIsolate();
+  int limit = IsJSArray(object) ? Smi::ToInt(JSArray::cast(object)->length())
+                                : store->length();
   int used = 0;
   for (int i = 0; i < limit; ++i) {
-    if (!store.is_the_hole(isolate, i)) ++used;
+    if (!store->is_the_hole(isolate, i)) ++used;
   }
   return used;
 }
 
 int JSObject::GetFastElementsUsage() {
-  FixedArrayBase store = elements();
+  Tagged<FixedArrayBase> store = elements();
   switch (GetElementsKind()) {
     case PACKED_SMI_ELEMENTS:
     case PACKED_DOUBLE_ELEMENTS:
@@ -5507,10 +5569,10 @@ int JSObject::GetFastElementsUsage() {
     case PACKED_SEALED_ELEMENTS:
     case PACKED_NONEXTENSIBLE_ELEMENTS:
     case SHARED_ARRAY_ELEMENTS:
-      return IsJSArray() ? Smi::ToInt(JSArray::cast(*this).length())
-                         : store.length();
+      return IsJSArray(*this) ? Smi::ToInt(JSArray::cast(*this)->length())
+                              : store->length();
     case FAST_SLOPPY_ARGUMENTS_ELEMENTS:
-      store = SloppyArgumentsElements::cast(store).arguments();
+      store = SloppyArgumentsElements::cast(store)->arguments();
       V8_FALLTHROUGH;
     case HOLEY_SMI_ELEMENTS:
     case HOLEY_ELEMENTS:
@@ -5520,7 +5582,7 @@ int JSObject::GetFastElementsUsage() {
     case FAST_STRING_WRAPPER_ELEMENTS:
       return HoleyElementsUsage(*this, FixedArray::cast(store));
     case HOLEY_DOUBLE_ELEMENTS:
-      if (elements().length() == 0) return 0;
+      if (elements()->length() == 0) return 0;
       return HoleyElementsUsage(*this, FixedDoubleArray::cast(store));
 
     case SLOW_SLOPPY_ARGUMENTS_ELEMENTS:
@@ -5570,8 +5632,19 @@ Maybe<bool> JSObject::HasRealNamedCallbackProperty(Isolate* isolate,
                                : Nothing<bool>();
 }
 
+Tagged<Object> JSObject::RawFastPropertyAtCompareAndSwap(
+    FieldIndex index, Tagged<Object> expected, Tagged<Object> value,
+    SeqCstAccessTag tag) {
+  return HeapObject::SeqCst_CompareAndSwapField(
+      expected, value,
+      [=](Tagged<Object> expected_value, Tagged<Object> new_value) {
+        return RawFastPropertyAtCompareAndSwapInternal(index, expected_value,
+                                                       new_value, tag);
+      });
+}
+
 bool JSGlobalProxy::IsDetached() const {
-  return native_context().IsNull(GetIsolate());
+  return IsNull(native_context(), GetIsolate());
 }
 
 void JSGlobalObject::InvalidatePropertyCell(Handle<JSGlobalObject> global,
@@ -5614,7 +5687,7 @@ MaybeHandle<JSDate> JSDate::New(Handle<JSFunction> constructor,
 
 // static
 int64_t JSDate::CurrentTimeValue(Isolate* isolate) {
-  if (v8_flags.log_internal_timer_events) LOG(isolate, CurrentTimeEvent());
+  if (v8_flags.log_timer_events) LOG(isolate, CurrentTimeEvent());
   if (v8_flags.correctness_fuzzer_suppressions) return 4;
 
   // According to ECMA-262, section 15.9.1, page 117, the precision of
@@ -5632,24 +5705,24 @@ Address JSDate::GetField(Isolate* isolate, Address raw_object,
   DisallowHandleAllocation no_handles;
   DisallowJavascriptExecution no_js(isolate);
 
-  Object object(raw_object);
-  Smi index(smi_index);
+  Tagged<Object> object(raw_object);
+  Tagged<Smi> index(smi_index);
   return JSDate::cast(object)
-      .DoGetField(isolate, static_cast<FieldIndex>(index.value()))
+      ->DoGetField(isolate, static_cast<FieldIndex>(index.value()))
       .ptr();
 }
 
-Object JSDate::DoGetField(Isolate* isolate, FieldIndex index) {
+Tagged<Object> JSDate::DoGetField(Isolate* isolate, FieldIndex index) {
   DCHECK_NE(index, kDateValue);
 
   DateCache* date_cache = isolate->date_cache();
 
   if (index < kFirstUncachedField) {
-    Object stamp = cache_stamp();
-    if (stamp != date_cache->stamp() && stamp.IsSmi()) {
+    Tagged<Object> stamp = cache_stamp();
+    if (stamp != date_cache->stamp() && IsSmi(stamp)) {
       // Since the stamp is not NaN, the value is also not NaN.
       int64_t local_time_ms =
-          date_cache->ToLocal(static_cast<int64_t>(value().Number()));
+          date_cache->ToLocal(static_cast<int64_t>(Object::Number(value())));
       SetCachedFields(local_time_ms, date_cache);
     }
     switch (index) {
@@ -5673,10 +5746,10 @@ Object JSDate::DoGetField(Isolate* isolate, FieldIndex index) {
   }
 
   if (index >= kFirstUTCField) {
-    return GetUTCField(index, value().Number(), date_cache);
+    return GetUTCField(index, Object::Number(value()), date_cache);
   }
 
-  double time = value().Number();
+  double time = Object::Number(value());
   if (std::isnan(time)) return GetReadOnlyRoots().nan_value();
 
   int64_t local_time_ms = date_cache->ToLocal(static_cast<int64_t>(time));
@@ -5690,8 +5763,8 @@ Object JSDate::DoGetField(Isolate* isolate, FieldIndex index) {
   return Smi::FromInt(time_in_day_ms);
 }
 
-Object JSDate::GetUTCField(FieldIndex index, double value,
-                           DateCache* date_cache) {
+Tagged<Object> JSDate::GetUTCField(FieldIndex index, double value,
+                                   DateCache* date_cache) {
   DCHECK_GE(index, kFirstUTCField);
 
   if (std::isnan(value)) return GetReadOnlyRoots().nan_value();
@@ -5745,10 +5818,10 @@ Handle<Object> JSDate::SetValue(Handle<JSDate> date, double v) {
   return value;
 }
 
-void JSDate::SetValue(Object value, bool is_value_nan) {
+void JSDate::SetValue(Tagged<Object> value, bool is_value_nan) {
   set_value(value);
   if (is_value_nan) {
-    HeapNumber nan = GetReadOnlyRoots().nan_value();
+    Tagged<HeapNumber> nan = GetReadOnlyRoots().nan_value();
     set_cache_stamp(nan, SKIP_WRITE_BARRIER);
     set_year(nan, SKIP_WRITE_BARRIER);
     set_month(nan, SKIP_WRITE_BARRIER);
@@ -5782,87 +5855,88 @@ void JSDate::SetCachedFields(int64_t local_time_ms, DateCache* date_cache) {
 }
 
 // static
-void JSMessageObject::EnsureSourcePositionsAvailable(
+void JSMessageObject::InitializeSourcePositions(
     Isolate* isolate, Handle<JSMessageObject> message) {
-  if (!message->DidEnsureSourcePositionsAvailable()) {
-    DCHECK_EQ(message->start_position(), -1);
-    DCHECK_GE(message->bytecode_offset().value(), kFunctionEntryBytecodeOffset);
-    Handle<SharedFunctionInfo> shared_info(
-        SharedFunctionInfo::cast(message->shared_info()), isolate);
-    IsCompiledScope is_compiled_scope;
-    SharedFunctionInfo::EnsureBytecodeArrayAvailable(
-        isolate, shared_info, &is_compiled_scope, CreateSourcePositions::kYes);
-    SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, shared_info);
-    DCHECK(shared_info->HasBytecodeArray());
-    int position = shared_info->abstract_code(isolate).SourcePosition(
-        isolate, message->bytecode_offset().value());
-    DCHECK_GE(position, 0);
-    message->set_start_position(position);
-    message->set_end_position(position + 1);
-    message->set_shared_info(ReadOnlyRoots(isolate).undefined_value());
+  DCHECK(!message->DidEnsureSourcePositionsAvailable());
+  Script::InitLineEnds(isolate, handle(message->script(), isolate));
+  if (message->shared_info() == Smi::FromInt(-1)) {
+    message->set_shared_info(Smi::zero());
+    return;
   }
+  DCHECK(IsSharedFunctionInfo(message->shared_info()));
+  DCHECK_GE(message->bytecode_offset().value(), kFunctionEntryBytecodeOffset);
+  Handle<SharedFunctionInfo> shared_info(
+      SharedFunctionInfo::cast(message->shared_info()), isolate);
+  IsCompiledScope is_compiled_scope;
+  SharedFunctionInfo::EnsureBytecodeArrayAvailable(
+      isolate, shared_info, &is_compiled_scope, CreateSourcePositions::kYes);
+  SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, shared_info);
+  DCHECK(shared_info->HasBytecodeArray());
+  int position = shared_info->abstract_code(isolate)->SourcePosition(
+      isolate, message->bytecode_offset().value());
+  DCHECK_GE(position, 0);
+  message->set_start_position(position);
+  message->set_end_position(position + 1);
+  message->set_shared_info(Smi::zero());
 }
 
 int JSMessageObject::GetLineNumber() const {
+  DisallowGarbageCollection no_gc;
   DCHECK(DidEnsureSourcePositionsAvailable());
   if (start_position() == -1) return Message::kNoLineNumberInfo;
 
+  DCHECK(script()->has_line_ends());
   Handle<Script> the_script(script(), GetIsolate());
-
   Script::PositionInfo info;
-  const Script::OffsetFlag offset_flag = Script::WITH_OFFSET;
-  if (!Script::GetPositionInfo(the_script, start_position(), &info,
-                               offset_flag)) {
+  if (!script()->GetPositionInfo(start_position(), &info)) {
     return Message::kNoLineNumberInfo;
   }
-
   return info.line + 1;
 }
 
 int JSMessageObject::GetColumnNumber() const {
+  DisallowGarbageCollection no_gc;
   DCHECK(DidEnsureSourcePositionsAvailable());
   if (start_position() == -1) return -1;
 
+  DCHECK(script()->has_line_ends());
   Handle<Script> the_script(script(), GetIsolate());
-
   Script::PositionInfo info;
-  const Script::OffsetFlag offset_flag = Script::WITH_OFFSET;
-  if (!Script::GetPositionInfo(the_script, start_position(), &info,
-                               offset_flag)) {
+  if (!script()->GetPositionInfo(start_position(), &info)) {
     return -1;
   }
-
   return info.column;  // Note: No '+1' in contrast to GetLineNumber.
 }
 
-String JSMessageObject::GetSource() const {
-  Script script_object = script();
-  if (script_object.HasValidSource()) {
-    Object source = script_object.source();
-    if (source.IsString()) return String::cast(source);
+Tagged<String> JSMessageObject::GetSource() const {
+  DisallowGarbageCollection no_gc;
+  Tagged<Script> script_object = script();
+  if (script_object->HasValidSource()) {
+    Tagged<Object> source = script_object->source();
+    if (IsString(source)) return String::cast(source);
   }
   return ReadOnlyRoots(GetIsolate()).empty_string();
 }
 
 Handle<String> JSMessageObject::GetSourceLine() const {
   Isolate* isolate = GetIsolate();
-  Handle<Script> the_script(script(), isolate);
 
 #if V8_ENABLE_WEBASSEMBLY
-  if (the_script->type() == Script::TYPE_WASM) {
+  if (script()->type() == Script::Type::kWasm) {
     return isolate->factory()->empty_string();
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
-
   Script::PositionInfo info;
-  const Script::OffsetFlag offset_flag = Script::WITH_OFFSET;
-  DCHECK(DidEnsureSourcePositionsAvailable());
-  if (!Script::GetPositionInfo(the_script, start_position(), &info,
-                               offset_flag)) {
-    return isolate->factory()->empty_string();
+  {
+    DisallowGarbageCollection no_gc;
+    DCHECK(DidEnsureSourcePositionsAvailable());
+    DCHECK(script()->has_line_ends());
+    if (!script()->GetPositionInfo(start_position(), &info)) {
+      return isolate->factory()->empty_string();
+    }
   }
 
-  Handle<String> src = handle(String::cast(the_script->source()), isolate);
+  Handle<String> src = handle(String::cast(script()->source()), isolate);
   return isolate->factory()->NewSubString(src, info.line_start, info.line_end);
 }
 
diff --git a/deps/v8/src/objects/js-objects.h b/deps/v8/src/objects/js-objects.h
index 89260488fb8d10..82d367affe3e68 100644
--- a/deps/v8/src/objects/js-objects.h
+++ b/deps/v8/src/objects/js-objects.h
@@ -6,6 +6,7 @@
 #define V8_OBJECTS_JS_OBJECTS_H_
 
 #include "src/base/optional.h"
+#include "src/handles/handles.h"
 #include "src/objects/embedder-data-slot.h"
 // TODO(jkummerow): Consider forward-declaring instead.
 #include "src/objects/internal-index.h"
@@ -29,6 +30,7 @@ class LookupIterator;
 class PropertyKey;
 class NativeContext;
 class IsCompiledScope;
+class SwissNameDictionary;
 
 #include "torque-generated/src/objects/js-objects-tq.inc"
 
@@ -44,20 +46,20 @@ class JSReceiver : public TorqueGeneratedJSReceiver<JSReceiver, HeapObject> {
   // exists. Otherwise, returns an empty_property_array when there's a
   // Smi (hash code) or an empty_fixed_array for a fast properties
   // map.
-  DECL_GETTER(property_array, PropertyArray)
+  DECL_GETTER(property_array, Tagged<PropertyArray>)
 
   // Gets slow properties for non-global objects (if
   // v8_enable_swiss_name_dictionary is not set).
-  DECL_GETTER(property_dictionary, NameDictionary)
+  DECL_GETTER(property_dictionary, Tagged<NameDictionary>)
 
   // Gets slow properties for non-global objects (if
   // v8_enable_swiss_name_dictionary is set).
-  DECL_GETTER(property_dictionary_swiss, SwissNameDictionary)
+  DECL_GETTER(property_dictionary_swiss, Tagged<SwissNameDictionary>)
 
   // Sets the properties backing store and makes sure any existing hash is moved
   // to the new properties store. To clear out the properties store, pass in the
   // empty_fixed_array(), the hash will be maintained in this case as well.
-  void SetProperties(HeapObject properties);
+  void SetProperties(Tagged<HeapObject> properties);
 
   // There are five possible values for the properties offset.
   // 1) EmptyFixedArray/EmptyPropertyDictionary - This is the standard
@@ -76,8 +78,8 @@ class JSReceiver : public TorqueGeneratedJSReceiver<JSReceiver, HeapObject> {
   //
   // This is used only in the deoptimizer and heap. Please use the
   // above typed getters and setters to access the properties.
-  DECL_ACCESSORS(raw_properties_or_hash, Object)
-  DECL_RELAXED_ACCESSORS(raw_properties_or_hash, Object)
+  DECL_ACCESSORS(raw_properties_or_hash, Tagged<Object>)
+  DECL_RELAXED_ACCESSORS(raw_properties_or_hash, Tagged<Object>)
 
   inline void initialize_properties(Isolate* isolate);
 
@@ -150,10 +152,9 @@ class JSReceiver : public TorqueGeneratedJSReceiver<JSReceiver, HeapObject> {
       Handle<JSReceiver> object, uint32_t index,
       LanguageMode language_mode = LanguageMode::kSloppy);
 
-  V8_WARN_UNUSED_RESULT static Object DefineProperty(Isolate* isolate,
-                                                     Handle<Object> object,
-                                                     Handle<Object> name,
-                                                     Handle<Object> attributes);
+  V8_WARN_UNUSED_RESULT static Tagged<Object> DefineProperty(
+      Isolate* isolate, Handle<Object> object, Handle<Object> name,
+      Handle<Object> attributes);
   V8_WARN_UNUSED_RESULT static MaybeHandle<Object> DefineProperties(
       Isolate* isolate, Handle<Object> object, Handle<Object> properties);
 
@@ -168,12 +169,6 @@ class JSReceiver : public TorqueGeneratedJSReceiver<JSReceiver, HeapObject> {
   V8_WARN_UNUSED_RESULT static Maybe<bool> CheckPrivateNameStore(
       LookupIterator* it, bool is_define);
 
-  // Check if a data property can be created on the object. It will fail with
-  // an error when it cannot.
-  V8_WARN_UNUSED_RESULT static Maybe<bool> CheckIfCanDefine(
-      Isolate* isolate, LookupIterator* it, Handle<Object> value,
-      Maybe<ShouldThrow> should_throw);
-
   // ES6 7.3.4 (when passed kDontThrow)
   V8_WARN_UNUSED_RESULT static Maybe<bool> CreateDataProperty(
       Isolate* isolate, Handle<JSReceiver> object, Handle<Name> key,
@@ -239,7 +234,7 @@ class JSReceiver : public TorqueGeneratedJSReceiver<JSReceiver, HeapObject> {
       Isolate* isolate, Handle<JSReceiver> object);
 
   // Returns the class name.
-  V8_EXPORT_PRIVATE String class_name();
+  V8_EXPORT_PRIVATE Tagged<String> class_name();
 
   // Returns the constructor (the function that was used to instantiate the
   // object).
@@ -285,12 +280,13 @@ class JSReceiver : public TorqueGeneratedJSReceiver<JSReceiver, HeapObject> {
 
   // Retrieves a permanent object identity hash code. The undefined value might
   // be returned in case no hash was created yet.
-  V8_EXPORT_PRIVATE Object GetIdentityHash();
+  V8_EXPORT_PRIVATE Tagged<Object> GetIdentityHash();
 
   // Retrieves a permanent object identity hash code. May create and store a
   // hash code if needed and none exists.
-  static Smi CreateIdentityHash(Isolate* isolate, JSReceiver key);
-  V8_EXPORT_PRIVATE Smi GetOrCreateIdentityHash(Isolate* isolate);
+  static Tagged<Smi> CreateIdentityHash(Isolate* isolate,
+                                        Tagged<JSReceiver> key);
+  V8_EXPORT_PRIVATE Tagged<Smi> GetOrCreateIdentityHash(Isolate* isolate);
 
   // Stores the hash code. The hash passed in must be masked with
   // JSReceiver::kHashMask.
@@ -318,7 +314,7 @@ class JSReceiver : public TorqueGeneratedJSReceiver<JSReceiver, HeapObject> {
  private:
   // Hide generated accessors; custom accessors are called
   // "raw_properties_or_hash".
-  DECL_ACCESSORS(properties_or_hash, Object)
+  DECL_ACCESSORS(properties_or_hash, Tagged<Object>)
 
   TQ_OBJECT_CONSTRUCTORS(JSReceiver)
 };
@@ -344,17 +340,17 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   static V8_WARN_UNUSED_RESULT MaybeHandle<JSObject> ObjectCreate(
       Isolate* isolate, Handle<Object> prototype);
 
-  DECL_ACCESSORS(elements, FixedArrayBase)
-  DECL_RELAXED_GETTER(elements, FixedArrayBase)
+  DECL_ACCESSORS(elements, Tagged<FixedArrayBase>)
+  DECL_RELAXED_GETTER(elements, Tagged<FixedArrayBase>)
 
   // Acquire/release semantics on this field are explicitly forbidden to avoid
   // confusion, since the default setter uses relaxed semantics. If
   // acquire/release semantics ever become necessary, the default setter should
   // be reverted to non-atomic behavior, and setters with explicit tags
   // introduced and used when required.
-  FixedArrayBase elements(PtrComprCageBase cage_base,
-                          AcquireLoadTag tag) const = delete;
-  void set_elements(FixedArrayBase value, ReleaseStoreTag tag,
+  Tagged<FixedArrayBase> elements(PtrComprCageBase cage_base,
+                                  AcquireLoadTag tag) const = delete;
+  void set_elements(Tagged<FixedArrayBase> value, ReleaseStoreTag tag,
                     WriteBarrierMode mode = UPDATE_WRITE_BARRIER) = delete;
 
   inline void initialize_elements();
@@ -415,7 +411,7 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   bool HasEnumerableElements();
 
   // Gets slow elements.
-  DECL_GETTER(element_dictionary, NumberDictionary)
+  DECL_GETTER(element_dictionary, Tagged<NumberDictionary>)
 
   // Requires: HasFastElements().
   static void EnsureWritableFastElements(Handle<JSObject> object);
@@ -512,8 +508,8 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
                                               Handle<Map> new_map,
                                               Isolate* isolate);
   static bool UnregisterPrototypeUser(Handle<Map> user, Isolate* isolate);
-  static Map InvalidatePrototypeChains(Map map);
-  static void InvalidatePrototypeValidityCell(JSGlobalObject global);
+  static Tagged<Map> InvalidatePrototypeChains(Tagged<Map> map);
+  static void InvalidatePrototypeValidityCell(Tagged<JSGlobalObject> global);
 
   // Updates prototype chain tracking information when an object changes its
   // map from |old_map| to |new_map|.
@@ -521,15 +517,16 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
                               Isolate* isolate);
 
   // Utility used by many Array builtins and runtime functions
-  static inline bool PrototypeHasNoElements(Isolate* isolate, JSObject object);
+  static inline bool PrototypeHasNoElements(Isolate* isolate,
+                                            Tagged<JSObject> object);
 
   // To be passed to PrototypeUsers::Compact.
-  static void PrototypeRegistryCompactionCallback(HeapObject value,
+  static void PrototypeRegistryCompactionCallback(Tagged<HeapObject> value,
                                                   int old_index, int new_index);
 
   // Retrieve interceptors.
-  DECL_GETTER(GetNamedInterceptor, InterceptorInfo)
-  DECL_GETTER(GetIndexedInterceptor, InterceptorInfo)
+  DECL_GETTER(GetNamedInterceptor, Tagged<InterceptorInfo>)
+  DECL_GETTER(GetIndexedInterceptor, Tagged<InterceptorInfo>)
 
   // Used from JSReceiver.
   V8_WARN_UNUSED_RESULT static Maybe<PropertyAttributes>
@@ -538,26 +535,33 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   GetPropertyAttributesWithFailedAccessCheck(LookupIterator* it);
 
   // Defines an AccessorPair property on the given object.
-  V8_EXPORT_PRIVATE static MaybeHandle<Object> DefineAccessor(
-      Handle<JSObject> object, Handle<Name> name, Handle<Object> getter,
-      Handle<Object> setter, PropertyAttributes attributes);
-  static MaybeHandle<Object> DefineAccessor(LookupIterator* it,
-                                            Handle<Object> getter,
-                                            Handle<Object> setter,
-                                            PropertyAttributes attributes);
+  V8_EXPORT_PRIVATE static MaybeHandle<Object>
+  DefineOwnAccessorIgnoreAttributes(Handle<JSObject> object, Handle<Name> name,
+                                    Handle<Object> getter,
+                                    Handle<Object> setter,
+                                    PropertyAttributes attributes);
+  static MaybeHandle<Object> DefineOwnAccessorIgnoreAttributes(
+      LookupIterator* it, Handle<Object> getter, Handle<Object> setter,
+      PropertyAttributes attributes);
 
   // Defines an AccessorInfo property on the given object.
   V8_WARN_UNUSED_RESULT static MaybeHandle<Object> SetAccessor(
       Handle<JSObject> object, Handle<Name> name, Handle<AccessorInfo> info,
       PropertyAttributes attributes);
 
+  // Check if a data property can be created on the object. It will fail with
+  // an error when it cannot.
+  V8_WARN_UNUSED_RESULT static Maybe<bool> CheckIfCanDefineAsConfigurable(
+      Isolate* isolate, LookupIterator* it, Handle<Object> value,
+      Maybe<ShouldThrow> should_throw);
+
   // The result must be checked first for exceptions. If there's no exception,
   // the output parameter |done| indicates whether the interceptor has a result
   // or not.
   V8_WARN_UNUSED_RESULT static MaybeHandle<Object> GetPropertyWithInterceptor(
       LookupIterator* it, bool* done);
 
-  static void ValidateElements(JSObject object);
+  static void ValidateElements(Tagged<JSObject> object);
 
   // Makes sure that this object can contain HeapObject as elements.
   static inline void EnsureCanContainHeapObjectElements(Handle<JSObject> obj);
@@ -614,20 +618,20 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   // JSFunction objects.
   static V8_EXPORT_PRIVATE int GetHeaderSize(
       InstanceType instance_type, bool function_has_prototype_slot = false);
-  static inline int GetHeaderSize(Map map);
+  static inline int GetHeaderSize(Tagged<Map> map);
 
-  static inline bool MayHaveEmbedderFields(Map map);
+  static inline bool MayHaveEmbedderFields(Tagged<Map> map);
   inline bool MayHaveEmbedderFields() const;
 
-  static inline int GetEmbedderFieldsStartOffset(Map map);
+  static inline int GetEmbedderFieldsStartOffset(Tagged<Map> map);
   inline int GetEmbedderFieldsStartOffset();
 
-  static inline int GetEmbedderFieldCount(Map map);
+  static inline int GetEmbedderFieldCount(Tagged<Map> map);
   inline int GetEmbedderFieldCount() const;
   inline int GetEmbedderFieldOffset(int index);
-  inline Object GetEmbedderField(int index);
-  inline void SetEmbedderField(int index, Object value);
-  inline void SetEmbedderField(int index, Smi value);
+  inline Tagged<Object> GetEmbedderField(int index);
+  inline void SetEmbedderField(int index, Tagged<Object> value);
+  inline void SetEmbedderField(int index, Tagged<Smi> value);
 
   // Returns true if this object is an Api object which can, if unmodified, be
   // dropped during minor GC because the embedder can recreate it again later.
@@ -673,7 +677,7 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   V8_EXPORT_PRIVATE static Handle<NumberDictionary> NormalizeElements(
       Handle<JSObject> object);
 
-  void RequireSlowElements(NumberDictionary dictionary);
+  void RequireSlowElements(Tagged<NumberDictionary> dictionary);
 
   // Transform slow named properties to fast variants.
   V8_EXPORT_PRIVATE static void MigrateSlowToFast(Handle<JSObject> object,
@@ -687,9 +691,8 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   // Same as above, but it will return {} if we would be reading out of the
   // bounds of the object or if the dictionary is pending allocation. Use this
   // version for concurrent access.
-  static base::Optional<Object> DictionaryPropertyAt(Handle<JSObject> object,
-                                                     InternalIndex dict_index,
-                                                     Heap* heap);
+  static base::Optional<Tagged<Object>> DictionaryPropertyAt(
+      Handle<JSObject> object, InternalIndex dict_index, Heap* heap);
 
   // Access fast-case object properties at index.
   static Handle<Object> FastPropertyAt(Isolate* isolate,
@@ -700,43 +703,56 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
                                        Handle<JSObject> object,
                                        Representation representation,
                                        FieldIndex index, SeqCstAccessTag tag);
-  inline Object RawFastPropertyAt(FieldIndex index) const;
-  inline Object RawFastPropertyAt(PtrComprCageBase cage_base,
-                                  FieldIndex index) const;
-  inline Object RawFastPropertyAt(FieldIndex index, SeqCstAccessTag tag) const;
-  inline Object RawFastPropertyAt(PtrComprCageBase cage_base, FieldIndex index,
-                                  SeqCstAccessTag tag) const;
+  inline Tagged<Object> RawFastPropertyAt(FieldIndex index) const;
+  inline Tagged<Object> RawFastPropertyAt(PtrComprCageBase cage_base,
+                                          FieldIndex index) const;
+  inline Tagged<Object> RawFastPropertyAt(FieldIndex index,
+                                          SeqCstAccessTag tag) const;
+  inline Tagged<Object> RawFastPropertyAt(PtrComprCageBase cage_base,
+                                          FieldIndex index,
+                                          SeqCstAccessTag tag) const;
 
   // See comment in the body of the method to understand the conditions
   // in which this method is meant to be used, and what guarantees it
   // provides against invalid reads from another thread during object
   // mutation.
-  inline base::Optional<Object> RawInobjectPropertyAt(
-      PtrComprCageBase cage_base, Map original_map, FieldIndex index) const;
+  inline base::Optional<Tagged<Object>> RawInobjectPropertyAt(
+      PtrComprCageBase cage_base, Tagged<Map> original_map,
+      FieldIndex index) const;
 
-  inline void FastPropertyAtPut(FieldIndex index, Object value,
+  inline void FastPropertyAtPut(FieldIndex index, Tagged<Object> value,
                                 WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void FastPropertyAtPut(FieldIndex index, Object value,
+  inline void FastPropertyAtPut(FieldIndex index, Tagged<Object> value,
                                 SeqCstAccessTag tag);
   inline void RawFastInobjectPropertyAtPut(
-      FieldIndex index, Object value,
+      FieldIndex index, Tagged<Object> value,
       WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  inline void RawFastInobjectPropertyAtPut(FieldIndex index, Object value,
+  inline void RawFastInobjectPropertyAtPut(FieldIndex index,
+                                           Tagged<Object> value,
                                            SeqCstAccessTag tag);
   inline void WriteToField(InternalIndex descriptor, PropertyDetails details,
-                           Object value);
-
-  inline Object RawFastPropertyAtSwap(FieldIndex index, Object value,
-                                      SeqCstAccessTag tag);
-  inline Object RawFastPropertyAtSwap(PtrComprCageBase cage_base,
-                                      FieldIndex index, Object value,
-                                      SeqCstAccessTag tag);
+                           Tagged<Object> value);
+
+  inline Tagged<Object> RawFastInobjectPropertyAtSwap(FieldIndex index,
+                                                      Tagged<Object> value,
+                                                      SeqCstAccessTag tag);
+  inline Tagged<Object> RawFastPropertyAtSwap(FieldIndex index,
+                                              Tagged<Object> value,
+                                              SeqCstAccessTag tag);
+  Tagged<Object> RawFastPropertyAtCompareAndSwap(FieldIndex index,
+                                                 Tagged<Object> expected,
+                                                 Tagged<Object> value,
+                                                 SeqCstAccessTag tag);
+  inline Tagged<Object> RawFastInobjectPropertyAtCompareAndSwap(
+      FieldIndex index, Tagged<Object> expected, Tagged<Object> value,
+      SeqCstAccessTag tag);
 
   // Access to in object properties.
   inline int GetInObjectPropertyOffset(int index);
-  inline Object InObjectPropertyAt(int index);
-  inline Object InObjectPropertyAtPut(
-      int index, Object value, WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
+  inline Tagged<Object> InObjectPropertyAt(int index);
+  inline Tagged<Object> InObjectPropertyAtPut(
+      int index, Tagged<Object> value,
+      WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   // Set the object's prototype (only JSReceiver and null are allowed values).
   V8_WARN_UNUSED_RESULT static Maybe<bool> SetPrototype(
@@ -752,12 +768,13 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   // undefined_value and the rest with filler_map.
   // Note: this call does not update write barrier, the caller is responsible
   // to ensure that |filler_map| can be collected without WB here.
-  inline void InitializeBody(Map map, int start_offset,
+  inline void InitializeBody(Tagged<Map> map, int start_offset,
                              bool is_slack_tracking_in_progress,
-                             MapWord filler_map, Object undefined_value);
+                             MapWord filler_map,
+                             Tagged<Object> undefined_value);
 
   // Check whether this object references another object
-  bool ReferencesObject(Object obj);
+  bool ReferencesObject(Tagged<Object> obj);
 
   V8_WARN_UNUSED_RESULT static Maybe<bool> TestIntegrityLevel(
       Isolate* isolate, Handle<JSObject> object, IntegrityLevel lvl);
@@ -789,7 +806,8 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
                                       ElementsKind to_kind,
                                       Handle<FixedArrayBase> to_elements);
 
-  void PrintInstanceMigration(FILE* file, Map original_map, Map new_map);
+  void PrintInstanceMigration(FILE* file, Tagged<Map> original_map,
+                              Tagged<Map> new_map);
 
 #ifdef DEBUG
   // Structure for collecting spill information about JSObjects.
@@ -821,7 +839,7 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
       PtrComprCageBase cage_base) const;
 #endif
 
-  Object SlowReverseLookup(Object value);
+  Tagged<Object> SlowReverseLookup(Tagged<Object> value);
 
   // Maximal number of elements (numbered 0 .. kMaxElementCount - 1).
   // Also maximal value of JSArray's length property.
@@ -901,8 +919,8 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   V8_WARN_UNUSED_RESULT static Maybe<bool> DeletePropertyWithInterceptor(
       LookupIterator* it, ShouldThrow should_throw);
 
-  bool ReferencesObjectFromElements(FixedArray elements, ElementsKind kind,
-                                    Object object);
+  bool ReferencesObjectFromElements(Tagged<FixedArray> elements,
+                                    ElementsKind kind, Tagged<Object> object);
 
   // Helper for fast versions of preventExtensions, seal, and freeze.
   // attrs is one of NONE, SEALED, or FROZEN (depending on the operation).
@@ -910,6 +928,10 @@ class JSObject : public TorqueGeneratedJSObject<JSObject, JSReceiver> {
   V8_WARN_UNUSED_RESULT static Maybe<bool> PreventExtensionsWithTransition(
       Isolate* isolate, Handle<JSObject> object, ShouldThrow should_throw);
 
+  inline Tagged<Object> RawFastPropertyAtCompareAndSwapInternal(
+      FieldIndex index, Tagged<Object> expected, Tagged<Object> value,
+      SeqCstAccessTag tag);
+
   TQ_OBJECT_CONSTRUCTORS(JSObject)
 };
 
@@ -1028,9 +1050,9 @@ class JSDataPropertyDescriptor : public JSObject {
 // as specified by ES6 section 25.1.1.3 The IteratorResult Interface.
 class JSIteratorResult : public JSObject {
  public:
-  DECL_ACCESSORS(value, Object)
+  DECL_ACCESSORS(value, Tagged<Object>)
 
-  DECL_ACCESSORS(done, Object)
+  DECL_ACCESSORS(done, Tagged<Object>)
 
   // Layout description.
 #define JS_ITERATOR_RESULT_FIELDS(V) \
@@ -1063,7 +1085,7 @@ class JSIteratorResult : public JSObject {
 class JSGlobalProxy
     : public TorqueGeneratedJSGlobalProxy<JSGlobalProxy, JSSpecialObject> {
  public:
-  inline bool IsDetachedFrom(JSGlobalObject global) const;
+  inline bool IsDetachedFrom(Tagged<JSGlobalObject> global) const;
   V8_EXPORT_PRIVATE bool IsDetached() const;
 
   static int SizeWithEmbedderFields(int embedder_field_count);
@@ -1079,7 +1101,7 @@ class JSGlobalProxy
 class JSGlobalObject
     : public TorqueGeneratedJSGlobalObject<JSGlobalObject, JSSpecialObject> {
  public:
-  DECL_RELEASE_ACQUIRE_ACCESSORS(global_dictionary, GlobalDictionary)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(global_dictionary, Tagged<GlobalDictionary>)
 
   static void InvalidatePropertyCell(Handle<JSGlobalObject> object,
                                      Handle<Name> name);
@@ -1088,7 +1110,7 @@ class JSGlobalObject
 
   // May be called by the concurrent GC when the global object is not
   // fully initialized.
-  DECL_GETTER(native_context_unchecked, Object)
+  DECL_GETTER(native_context_unchecked, Tagged<Object>)
 
   // Dispatched behavior.
   DECL_PRINTER(JSGlobalObject)
@@ -1131,7 +1153,7 @@ class JSDate : public TorqueGeneratedJSDate<JSDate, JSObject> {
 
   static Handle<Object> SetValue(Handle<JSDate> date, double v);
 
-  void SetValue(Object value, bool is_value_nan);
+  void SetValue(Tagged<Object> value, bool is_value_nan);
 
   // Dispatched behavior.
   DECL_PRINTER(JSDate)
@@ -1167,8 +1189,9 @@ class JSDate : public TorqueGeneratedJSDate<JSDate, JSObject> {
   };
 
  private:
-  Object DoGetField(Isolate* isolate, FieldIndex index);
-  Object GetUTCField(FieldIndex index, double value, DateCache* date_cache);
+  Tagged<Object> DoGetField(Isolate* isolate, FieldIndex index);
+  Tagged<Object> GetUTCField(FieldIndex index, double value,
+                             DateCache* date_cache);
 
   // Computes and caches the cacheable fields of the date.
   inline void SetCachedFields(int64_t local_time_ms, DateCache* date_cache);
@@ -1193,8 +1216,8 @@ class JSMessageObject
   // called more than once. If called when stack space is exhausted, then the
   // source positions will be not be set and calling it again when there is more
   // stack space will not have any effect.
-  static void EnsureSourcePositionsAvailable(Isolate* isolate,
-                                             Handle<JSMessageObject> message);
+  static inline void EnsureSourcePositionsAvailable(
+      Isolate* isolate, Handle<JSMessageObject> message);
 
   // Gets the start and end positions for the message.
   // EnsureSourcePositionsAvailable must have been called before calling these.
@@ -1211,7 +1234,7 @@ class JSMessageObject
   V8_EXPORT_PRIVATE int GetColumnNumber() const;
 
   // Returns the source code
-  V8_EXPORT_PRIVATE String GetSource() const;
+  V8_EXPORT_PRIVATE Tagged<String> GetSource() const;
 
   // Returns the source code line containing the given source
   // position, or the empty string if the position is invalid.
@@ -1234,14 +1257,16 @@ class JSMessageObject
   friend class Factory;
 
   inline bool DidEnsureSourcePositionsAvailable() const;
+  static void V8_PRESERVE_MOST V8_EXPORT_PRIVATE
+  InitializeSourcePositions(Isolate* isolate, Handle<JSMessageObject> message);
 
   // [shared]: optional SharedFunctionInfo that can be used to reconstruct the
   // source position if not available when the message was generated.
-  DECL_ACCESSORS(shared_info, HeapObject)
+  DECL_ACCESSORS(shared_info, Tagged<Object>)
 
   // [bytecode_offset]: optional offset using along with |shared| to generation
   // source positions.
-  DECL_ACCESSORS(bytecode_offset, Smi)
+  DECL_ACCESSORS(bytecode_offset, Tagged<Smi>)
 
   // [start_position]: the start position in the script for the error message.
   DECL_INT_ACCESSORS(start_position)
@@ -1299,6 +1324,39 @@ class JSValidIteratorWrapper
   TQ_OBJECT_CONSTRUCTORS(JSValidIteratorWrapper)
 };
 
+// JSPromiseWithResolversResult is just a JSObject with a specific initial map.
+// This initial map adds in-object properties for "promise", "resolve", and
+// "reject", in that order.
+class JSPromiseWithResolversResult : public JSObject {
+ public:
+  DECL_ACCESSORS(promise, Tagged<Object>)
+
+  DECL_ACCESSORS(resolve, Tagged<Object>)
+
+  DECL_ACCESSORS(reject, Tagged<Object>)
+
+  // Layout description.
+#define JS_PROMISE_WITHRESOLVERS_RESULT_FIELDS(V) \
+  V(kPromiseOffset, kTaggedSize)                  \
+  V(kResolveOffset, kTaggedSize)                  \
+  V(kRejectOffset, kTaggedSize)                   \
+  /* Total size. */                               \
+  V(kSize, 0)
+
+  DEFINE_FIELD_OFFSET_CONSTANTS(JSObject::kHeaderSize,
+                                JS_PROMISE_WITHRESOLVERS_RESULT_FIELDS)
+#undef JS_PROMISE_WITHRESOLVERS_RESULT_FIELDS
+
+  // Indices of in-object properties.
+  static const int kPromiseIndex = 0;
+  static const int kResolveIndex = 1;
+  static const int kRejectIndex = 2;
+
+  DECL_CAST(JSPromiseWithResolversResult)
+
+  OBJECT_CONSTRUCTORS(JSPromiseWithResolversResult, JSObject);
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/js-objects.tq b/deps/v8/src/objects/js-objects.tq
index 11f375dc505f83..58cfc8f98979da 100644
--- a/deps/v8/src/objects/js-objects.tq
+++ b/deps/v8/src/objects/js-objects.tq
@@ -46,23 +46,21 @@ extern class JSExternalObject extends JSObject {
 
 // A JSObject that may contain EmbedderDataSlots.
 @abstract
-extern class JSObjectWithEmbedderSlots extends JSObject {
-}
+extern class JSObjectWithEmbedderSlots extends JSObject {}
 
 @abstract
 @lowestInstanceTypeWithinParentClassRange
-extern class JSCustomElementsObject extends JSObject {
-}
+extern class JSCustomElementsObject extends JSObject {}
 
 // These may also contain EmbedderDataSlots but can't be a child class of
 // JSObjectWithEmbedderSlots due to type id constraints.
 @abstract
 @lowestInstanceTypeWithinParentClassRange
-extern class JSSpecialObject extends JSCustomElementsObject {
-}
+extern class JSSpecialObject extends JSCustomElementsObject {}
 
-macro GetDerivedMap(implicit context: Context)(
-    target: JSFunction, newTarget: JSReceiver): Map {
+macro GetDerivedMap(
+    implicit context: Context)(target: JSFunction,
+    newTarget: JSReceiver): Map {
   try {
     const constructor =
         Cast<JSFunctionWithPrototypeSlot>(newTarget) otherwise SlowPath;
@@ -79,13 +77,14 @@ macro GetDerivedMap(implicit context: Context)(
   }
 }
 
-macro GetDerivedRabGsabTypedArrayMap(implicit context: Context)(
-    target: JSFunction, newTarget: JSReceiver): Map {
+macro GetDerivedRabGsabTypedArrayMap(
+    implicit context: Context)(target: JSFunction,
+    newTarget: JSReceiver): Map {
   return runtime::GetDerivedMap(context, target, newTarget, TrueConstant());
 }
 
-macro AllocateFastOrSlowJSObjectFromMap(implicit context: Context)(map: Map):
-    JSObject {
+macro AllocateFastOrSlowJSObjectFromMap(
+    implicit context: Context)(map: Map): JSObject {
   let properties: EmptyFixedArray|NameDictionary|SwissNameDictionary =
       kEmptyFixedArray;
   if (IsDictionaryMap(map)) {
@@ -129,7 +128,7 @@ extern class JSMessageObject extends JSObject {
   script: Script;
   // [stack_frames]: an array of stack frames for this error object.
   stack_frames: Object;
-  shared_info: SharedFunctionInfo|Undefined;
+  shared_info: SharedFunctionInfo|Smi;
 
   // Raw data fields.
   // TODO(ishell): store as int32 instead of Smi.
@@ -183,9 +182,8 @@ extern class JSValidIteratorWrapper extends JSObject {
 extern macro AllocateJSObjectFromMap(Map): JSObject;
 extern macro AllocateJSObjectFromMap(
     Map,
-    NameDictionary | SwissNameDictionary | EmptyFixedArray |
-        PropertyArray): JSObject;
+    NameDictionary|SwissNameDictionary|EmptyFixedArray|PropertyArray): JSObject;
 extern macro AllocateJSObjectFromMap(
-    Map, NameDictionary | SwissNameDictionary | EmptyFixedArray | PropertyArray,
+    Map, NameDictionary|SwissNameDictionary|EmptyFixedArray|PropertyArray,
     FixedArray, constexpr AllocationFlag,
     constexpr SlackTrackingMode): JSObject;
diff --git a/deps/v8/src/objects/js-plural-rules-inl.h b/deps/v8/src/objects/js-plural-rules-inl.h
index fb4a97e476317c..0c78418cb0e664 100644
--- a/deps/v8/src/objects/js-plural-rules-inl.h
+++ b/deps/v8/src/objects/js-plural-rules-inl.h
@@ -23,10 +23,10 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSPluralRules)
 
-ACCESSORS(JSPluralRules, icu_plural_rules, Managed<icu::PluralRules>,
+ACCESSORS(JSPluralRules, icu_plural_rules, Tagged<Managed<icu::PluralRules>>,
           kIcuPluralRulesOffset)
 ACCESSORS(JSPluralRules, icu_number_formatter,
-          Managed<icu::number::LocalizedNumberFormatter>,
+          Tagged<Managed<icu::number::LocalizedNumberFormatter>>,
           kIcuNumberFormatterOffset)
 
 inline void JSPluralRules::set_type(Type type) {
diff --git a/deps/v8/src/objects/js-plural-rules.cc b/deps/v8/src/objects/js-plural-rules.cc
index 1eb5b15b7233fc..29ea12307ed461 100644
--- a/deps/v8/src/objects/js-plural-rules.cc
+++ b/deps/v8/src/objects/js-plural-rules.cc
@@ -138,11 +138,11 @@ MaybeHandle<JSPluralRules> JSPluralRules::New(Isolate* isolate, Handle<Map> map,
 
   // 9. Perform ? SetNumberFormatDigitOptions(pluralRules, options, 0, 3).
   Maybe<Intl::NumberFormatDigitOptions> maybe_digit_options =
-      Intl::SetNumberFormatDigitOptions(isolate, options, 0, 3, false);
+      Intl::SetNumberFormatDigitOptions(isolate, options, 0, 3, false, service);
   MAYBE_RETURN(maybe_digit_options, MaybeHandle<JSPluralRules>());
   Intl::NumberFormatDigitOptions digit_options = maybe_digit_options.FromJust();
-  settings = JSNumberFormat::SetDigitOptionsToFormatter(
-      settings, digit_options, 1, JSNumberFormat::ShowTrailingZeros::kShow);
+  settings =
+      JSNumberFormat::SetDigitOptionsToFormatter(settings, digit_options);
 
   icu::number::LocalizedNumberFormatter icu_number_formatter =
       settings.locale(icu_locale);
@@ -178,11 +178,11 @@ MaybeHandle<JSPluralRules> JSPluralRules::New(Isolate* isolate, Handle<Map> map,
 
 MaybeHandle<String> JSPluralRules::ResolvePlural(
     Isolate* isolate, Handle<JSPluralRules> plural_rules, double number) {
-  icu::PluralRules* icu_plural_rules = plural_rules->icu_plural_rules().raw();
+  icu::PluralRules* icu_plural_rules = plural_rules->icu_plural_rules()->raw();
   DCHECK_NOT_NULL(icu_plural_rules);
 
   icu::number::LocalizedNumberFormatter* fmt =
-      plural_rules->icu_number_formatter().raw();
+      plural_rules->icu_number_formatter()->raw();
   DCHECK_NOT_NULL(fmt);
 
   UErrorCode status = U_ZERO_ERROR;
@@ -199,13 +199,13 @@ MaybeHandle<String> JSPluralRules::ResolvePlural(
 
 MaybeHandle<String> JSPluralRules::ResolvePluralRange(
     Isolate* isolate, Handle<JSPluralRules> plural_rules, double x, double y) {
-  icu::PluralRules* icu_plural_rules = plural_rules->icu_plural_rules().raw();
+  icu::PluralRules* icu_plural_rules = plural_rules->icu_plural_rules()->raw();
   DCHECK_NOT_NULL(icu_plural_rules);
 
   Maybe<icu::number::LocalizedNumberRangeFormatter> maybe_range_formatter =
       JSNumberFormat::GetRangeFormatter(
           isolate, plural_rules->locale(),
-          *plural_rules->icu_number_formatter().raw());
+          *plural_rules->icu_number_formatter()->raw());
   MAYBE_RETURN(maybe_range_formatter, MaybeHandle<String>());
 
   icu::number::LocalizedNumberRangeFormatter nrfmt =
@@ -257,7 +257,7 @@ Handle<JSObject> JSPluralRules::ResolvedOptions(
 
   UErrorCode status = U_ZERO_ERROR;
   icu::number::LocalizedNumberFormatter* icu_number_formatter =
-      plural_rules->icu_number_formatter().raw();
+      plural_rules->icu_number_formatter()->raw();
   icu::UnicodeString skeleton = icu_number_formatter->toSkeleton(status);
   DCHECK(U_SUCCESS(status));
 
@@ -282,7 +282,7 @@ Handle<JSObject> JSPluralRules::ResolvedOptions(
 
   // 6. Let pluralCategories be a List of Strings representing the
   // possible results of PluralRuleSelect for the selected locale pr.
-  icu::PluralRules* icu_plural_rules = plural_rules->icu_plural_rules().raw();
+  icu::PluralRules* icu_plural_rules = plural_rules->icu_plural_rules()->raw();
   DCHECK_NOT_NULL(icu_plural_rules);
 
   std::unique_ptr<icu::StringEnumeration> categories(
diff --git a/deps/v8/src/objects/js-plural-rules.h b/deps/v8/src/objects/js-plural-rules.h
index 9cbce2c16c4ca9..eb9c2ce43b7002 100644
--- a/deps/v8/src/objects/js-plural-rules.h
+++ b/deps/v8/src/objects/js-plural-rules.h
@@ -69,9 +69,9 @@ class JSPluralRules
   static_assert(Type::CARDINAL <= TypeBit::kMax);
   static_assert(Type::ORDINAL <= TypeBit::kMax);
 
-  DECL_ACCESSORS(icu_plural_rules, Managed<icu::PluralRules>)
+  DECL_ACCESSORS(icu_plural_rules, Tagged<Managed<icu::PluralRules>>)
   DECL_ACCESSORS(icu_number_formatter,
-                 Managed<icu::number::LocalizedNumberFormatter>)
+                 Tagged<Managed<icu::number::LocalizedNumberFormatter>>)
 
   TQ_OBJECT_CONSTRUCTORS(JSPluralRules)
 };
diff --git a/deps/v8/src/objects/js-promise-inl.h b/deps/v8/src/objects/js-promise-inl.h
index f289b342be1672..e3ab3b98da06b6 100644
--- a/deps/v8/src/objects/js-promise-inl.h
+++ b/deps/v8/src/objects/js-promise-inl.h
@@ -24,12 +24,12 @@ BOOL_ACCESSORS(JSPromise, flags, has_handler, HasHandlerBit::kShift)
 BOOL_ACCESSORS(JSPromise, flags, handled_hint, HandledHintBit::kShift)
 BOOL_ACCESSORS(JSPromise, flags, is_silent, IsSilentBit::kShift)
 
-Object JSPromise::result() const {
+Tagged<Object> JSPromise::result() const {
   DCHECK_NE(Promise::kPending, status());
   return reactions_or_result();
 }
 
-Object JSPromise::reactions() const {
+Tagged<Object> JSPromise::reactions() const {
   DCHECK_EQ(Promise::kPending, status());
   return reactions_or_result();
 }
diff --git a/deps/v8/src/objects/js-promise.h b/deps/v8/src/objects/js-promise.h
index ffaaab60265f74..e4759105a48a3b 100644
--- a/deps/v8/src/objects/js-promise.h
+++ b/deps/v8/src/objects/js-promise.h
@@ -32,10 +32,10 @@ class JSPromise
     : public TorqueGeneratedJSPromise<JSPromise, JSObjectWithEmbedderSlots> {
  public:
   // [result]: Checks that the promise is settled and returns the result.
-  inline Object result() const;
+  inline Tagged<Object> result() const;
 
   // [reactions]: Checks that the promise is pending and returns the reactions.
-  inline Object reactions() const;
+  inline Tagged<Object> reactions() const;
 
   // [has_handler]: Whether this promise has a reject handler or not.
   DECL_BOOLEAN_ACCESSORS(has_handler)
diff --git a/deps/v8/src/objects/js-proxy-inl.h b/deps/v8/src/objects/js-proxy-inl.h
index 336f9e3a495f9c..aa3182065b89bc 100644
--- a/deps/v8/src/objects/js-proxy-inl.h
+++ b/deps/v8/src/objects/js-proxy-inl.h
@@ -20,7 +20,7 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSProxy)
 
-bool JSProxy::IsRevoked() const { return !handler().IsJSReceiver(); }
+bool JSProxy::IsRevoked() const { return !IsJSReceiver(handler()); }
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/js-proxy.tq b/deps/v8/src/objects/js-proxy.tq
index 5d0f51a94f7bb2..3606922be982e1 100644
--- a/deps/v8/src/objects/js-proxy.tq
+++ b/deps/v8/src/objects/js-proxy.tq
@@ -12,8 +12,9 @@ extern shape JSProxyRevocableResult extends JSObject {
   revoke: JSAny;
 }
 
-macro NewJSProxyRevocableResult(implicit context: Context)(
-    proxy: JSProxy, revoke: JSFunction): JSProxyRevocableResult {
+macro NewJSProxyRevocableResult(
+    implicit context: Context)(proxy: JSProxy,
+    revoke: JSFunction): JSProxyRevocableResult {
   return new JSProxyRevocableResult{
     map: GetProxyRevocableResultMap(),
     properties_or_hash: kEmptyFixedArray,
diff --git a/deps/v8/src/objects/js-regexp-inl.h b/deps/v8/src/objects/js-regexp-inl.h
index 0f5c9e71f5c92d..f45ebb0ab61d12 100644
--- a/deps/v8/src/objects/js-regexp-inl.h
+++ b/deps/v8/src/objects/js-regexp-inl.h
@@ -25,12 +25,12 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(JSRegExpResult)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSRegExpResultIndices)
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSRegExpResultWithIndices)
 
-ACCESSORS(JSRegExp, last_index, Object, kLastIndexOffset)
+ACCESSORS(JSRegExp, last_index, Tagged<Object>, kLastIndexOffset)
 
 JSRegExp::Type JSRegExp::type_tag() const {
-  Object data = this->data();
-  if (data.IsUndefined()) return JSRegExp::NOT_COMPILED;
-  Smi smi = Smi::cast(FixedArray::cast(data).get(kTagIndex));
+  Tagged<Object> data = this->data();
+  if (IsUndefined(data)) return JSRegExp::NOT_COMPILED;
+  Tagged<Smi> smi = Smi::cast(FixedArray::cast(data)->get(kTagIndex));
   return static_cast<JSRegExp::Type>(smi.value());
 }
 
@@ -51,17 +51,17 @@ int JSRegExp::max_register_count() const {
   return Smi::ToInt(DataAt(kIrregexpMaxRegisterCountIndex));
 }
 
-String JSRegExp::atom_pattern() const {
+Tagged<String> JSRegExp::atom_pattern() const {
   DCHECK_EQ(type_tag(), ATOM);
   return String::cast(DataAt(JSRegExp::kAtomPatternIndex));
 }
 
-String JSRegExp::source() const {
+Tagged<String> JSRegExp::source() const {
   return String::cast(TorqueGeneratedClass::source());
 }
 
 JSRegExp::Flags JSRegExp::flags() const {
-  Smi smi = Smi::cast(TorqueGeneratedClass::flags());
+  Tagged<Smi> smi = Smi::cast(TorqueGeneratedClass::flags());
   return Flags(smi.value());
 }
 
@@ -77,14 +77,14 @@ const char* JSRegExp::FlagsToString(Flags flags, FlagsBuffer* out_buffer) {
   return buffer.begin();
 }
 
-String JSRegExp::EscapedPattern() {
-  DCHECK(this->source().IsString());
+Tagged<String> JSRegExp::EscapedPattern() {
+  DCHECK(IsString(source()));
   return String::cast(source());
 }
 
-Object JSRegExp::capture_name_map() {
+Tagged<Object> JSRegExp::capture_name_map() {
   DCHECK(TypeSupportsCaptures(type_tag()));
-  Object value = DataAt(kIrregexpCaptureNameMapIndex);
+  Tagged<Object> value = DataAt(kIrregexpCaptureNameMapIndex);
   DCHECK_NE(value, Smi::FromInt(JSRegExp::kUninitializedValue));
   return value;
 }
@@ -97,29 +97,29 @@ void JSRegExp::set_capture_name_map(Handle<FixedArray> capture_name_map) {
   }
 }
 
-Object JSRegExp::DataAt(int index) const {
+Tagged<Object> JSRegExp::DataAt(int index) const {
   DCHECK(type_tag() != NOT_COMPILED);
-  return FixedArray::cast(data()).get(index);
+  return FixedArray::cast(data())->get(index);
 }
 
-void JSRegExp::SetDataAt(int index, Object value) {
+void JSRegExp::SetDataAt(int index, Tagged<Object> value) {
   DCHECK(type_tag() != NOT_COMPILED);
   // Only implementation data can be set this way.
   DCHECK_GE(index, kFirstTypeSpecificIndex);
-  FixedArray::cast(data()).set(index, value);
+  FixedArray::cast(data())->set(index, value);
 }
 
 bool JSRegExp::HasCompiledCode() const {
   if (type_tag() != IRREGEXP) return false;
-  Smi uninitialized = Smi::FromInt(kUninitializedValue);
+  Tagged<Smi> uninitialized = Smi::FromInt(kUninitializedValue);
 #ifdef DEBUG
-  DCHECK(DataAt(kIrregexpLatin1CodeIndex).IsCode() ||
+  DCHECK(IsCode(DataAt(kIrregexpLatin1CodeIndex)) ||
          DataAt(kIrregexpLatin1CodeIndex) == uninitialized);
-  DCHECK(DataAt(kIrregexpUC16CodeIndex).IsCode() ||
+  DCHECK(IsCode(DataAt(kIrregexpUC16CodeIndex)) ||
          DataAt(kIrregexpUC16CodeIndex) == uninitialized);
-  DCHECK(DataAt(kIrregexpLatin1BytecodeIndex).IsByteArray() ||
+  DCHECK(IsByteArray(DataAt(kIrregexpLatin1BytecodeIndex)) ||
          DataAt(kIrregexpLatin1BytecodeIndex) == uninitialized);
-  DCHECK(DataAt(kIrregexpUC16BytecodeIndex).IsByteArray() ||
+  DCHECK(IsByteArray(DataAt(kIrregexpUC16BytecodeIndex)) ||
          DataAt(kIrregexpUC16BytecodeIndex) == uninitialized);
 #endif  // DEBUG
   return (DataAt(kIrregexpLatin1CodeIndex) != uninitialized ||
@@ -128,7 +128,7 @@ bool JSRegExp::HasCompiledCode() const {
 
 void JSRegExp::DiscardCompiledCodeForSerialization() {
   DCHECK(HasCompiledCode());
-  Smi uninitialized = Smi::FromInt(kUninitializedValue);
+  Tagged<Smi> uninitialized = Smi::FromInt(kUninitializedValue);
   SetDataAt(kIrregexpLatin1CodeIndex, uninitialized);
   SetDataAt(kIrregexpUC16CodeIndex, uninitialized);
   SetDataAt(kIrregexpLatin1BytecodeIndex, uninitialized);
diff --git a/deps/v8/src/objects/js-regexp.cc b/deps/v8/src/objects/js-regexp.cc
index 2fc3c9149dbe92..5843a1ca6497c4 100644
--- a/deps/v8/src/objects/js-regexp.cc
+++ b/deps/v8/src/objects/js-regexp.cc
@@ -56,7 +56,7 @@ Handle<JSRegExpResultIndices> JSRegExpResultIndices::BuildIndices(
   // If there are no capture groups, set the groups property to undefined.
   FieldIndex groups_index = FieldIndex::ForDescriptor(
       indices->map(), InternalIndex(kGroupsDescriptorIndex));
-  if (maybe_names->IsUndefined(isolate)) {
+  if (IsUndefined(*maybe_names, isolate)) {
     indices->FastPropertyAtPut(groups_index,
                                ReadOnlyRoots(isolate).undefined_value());
     return indices;
@@ -77,10 +77,10 @@ Handle<JSRegExpResultIndices> JSRegExpResultIndices::BuildIndices(
     int name_offset = base_offset;
     int index_offset = base_offset + 1;
     Handle<String> name(String::cast(names->get(name_offset)), isolate);
-    Handle<Smi> smi_index(Smi::cast(names->get(index_offset)), isolate);
-    Handle<Object> capture_indices(indices_array->get(smi_index->value()),
+    Tagged<Smi> smi_index = Smi::cast(names->get(index_offset));
+    Handle<Object> capture_indices(indices_array->get(smi_index.value()),
                                    isolate);
-    if (!capture_indices->IsUndefined(isolate)) {
+    if (!IsUndefined(*capture_indices, isolate)) {
       capture_indices = Handle<JSArray>::cast(capture_indices);
     }
     if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -150,10 +150,10 @@ MaybeHandle<JSRegExp> JSRegExp::New(Isolate* isolate, Handle<String> pattern,
   return JSRegExp::Initialize(regexp, pattern, flags, backtrack_limit);
 }
 
-Object JSRegExp::code(bool is_latin1) const {
+Tagged<Object> JSRegExp::code(bool is_latin1) const {
   DCHECK_EQ(type_tag(), JSRegExp::IRREGEXP);
-  Object value = DataAt(code_index(is_latin1));
-  DCHECK(value.IsSmi() || value.IsCode());
+  Tagged<Object> value = DataAt(code_index(is_latin1));
+  DCHECK(IsSmi(value) || IsCode(value));
   return value;
 }
 
@@ -161,7 +161,7 @@ void JSRegExp::set_code(bool is_latin1, Handle<Code> code) {
   SetDataAt(code_index(is_latin1), *code);
 }
 
-Object JSRegExp::bytecode(bool is_latin1) const {
+Tagged<Object> JSRegExp::bytecode(bool is_latin1) const {
   DCHECK(type_tag() == JSRegExp::IRREGEXP ||
          type_tag() == JSRegExp::EXPERIMENTAL);
   return DataAt(bytecode_index(is_latin1));
@@ -190,7 +190,7 @@ bool JSRegExp::CanTierUp() {
 // An irregexp is considered to be marked for tier up if the tier-up ticks
 // value reaches zero.
 bool JSRegExp::MarkedForTierUp() {
-  DCHECK(data().IsFixedArray());
+  DCHECK(IsFixedArray(data()));
 
   if (!CanTierUp()) {
     return false;
@@ -203,8 +203,8 @@ void JSRegExp::ResetLastTierUpTick() {
   DCHECK(v8_flags.regexp_tier_up);
   DCHECK_EQ(type_tag(), JSRegExp::IRREGEXP);
   int tier_up_ticks = Smi::ToInt(DataAt(kIrregexpTicksUntilTierUpIndex)) + 1;
-  FixedArray::cast(data()).set(JSRegExp::kIrregexpTicksUntilTierUpIndex,
-                               Smi::FromInt(tier_up_ticks));
+  FixedArray::cast(data())->set(JSRegExp::kIrregexpTicksUntilTierUpIndex,
+                                Smi::FromInt(tier_up_ticks));
 }
 
 void JSRegExp::TierUpTick() {
@@ -214,15 +214,15 @@ void JSRegExp::TierUpTick() {
   if (tier_up_ticks == 0) {
     return;
   }
-  FixedArray::cast(data()).set(JSRegExp::kIrregexpTicksUntilTierUpIndex,
-                               Smi::FromInt(tier_up_ticks - 1));
+  FixedArray::cast(data())->set(JSRegExp::kIrregexpTicksUntilTierUpIndex,
+                                Smi::FromInt(tier_up_ticks - 1));
 }
 
 void JSRegExp::MarkTierUpForNextExec() {
   DCHECK(v8_flags.regexp_tier_up);
   DCHECK_EQ(type_tag(), JSRegExp::IRREGEXP);
-  FixedArray::cast(data()).set(JSRegExp::kIrregexpTicksUntilTierUpIndex,
-                               Smi::zero());
+  FixedArray::cast(data())->set(JSRegExp::kIrregexpTicksUntilTierUpIndex,
+                                Smi::zero());
 }
 
 // static
@@ -413,10 +413,10 @@ MaybeHandle<JSRegExp> JSRegExp::Initialize(Handle<JSRegExp> regexp,
   regexp->set_source(*escaped_source);
   regexp->set_flags(Smi::FromInt(flags));
 
-  Map map = regexp->map();
-  Object constructor = map.GetConstructor();
-  if (constructor.IsJSFunction() &&
-      JSFunction::cast(constructor).initial_map() == map) {
+  Tagged<Map> map = regexp->map();
+  Tagged<Object> constructor = map->GetConstructor();
+  if (IsJSFunction(constructor) &&
+      JSFunction::cast(constructor)->initial_map() == map) {
     // If we still have the original map, set in-object properties directly.
     regexp->InObjectPropertyAtPut(JSRegExp::kLastIndexFieldIndex,
                                   Smi::FromInt(kInitialLastIndexValue),
diff --git a/deps/v8/src/objects/js-regexp.h b/deps/v8/src/objects/js-regexp.h
index b1a8c1336a4983..4315c76ebf3456 100644
--- a/deps/v8/src/objects/js-regexp.h
+++ b/deps/v8/src/objects/js-regexp.h
@@ -56,21 +56,21 @@ class JSRegExp : public TorqueGeneratedJSRegExp<JSRegExp, JSObject> {
                                           Handle<String> source,
                                           Handle<String> flags_string);
 
-  DECL_ACCESSORS(last_index, Object)
+  DECL_ACCESSORS(last_index, Tagged<Object>)
 
   // Instance fields accessors.
-  inline String source() const;
+  inline Tagged<String> source() const;
   inline Flags flags() const;
 
   // Data array field accessors.
 
   inline Type type_tag() const;
-  inline String atom_pattern() const;
+  inline Tagged<String> atom_pattern() const;
   // This could be a Smi kUninitializedValue or InstructionStream.
-  V8_EXPORT_PRIVATE Object code(bool is_latin1) const;
+  V8_EXPORT_PRIVATE Tagged<Object> code(bool is_latin1) const;
   V8_EXPORT_PRIVATE void set_code(bool is_unicode, Handle<Code> code);
   // This could be a Smi kUninitializedValue or ByteArray.
-  V8_EXPORT_PRIVATE Object bytecode(bool is_latin1) const;
+  V8_EXPORT_PRIVATE Tagged<Object> bytecode(bool is_latin1) const;
   // Sets the bytecode as well as initializing trampoline slots to the
   // RegExpInterpreterTrampoline.
   void set_bytecode_and_trampoline(Isolate* isolate,
@@ -78,7 +78,7 @@ class JSRegExp : public TorqueGeneratedJSRegExp<JSRegExp, JSObject> {
   inline int max_register_count() const;
   // Number of captures (without the match itself).
   inline int capture_count() const;
-  inline Object capture_name_map();
+  inline Tagged<Object> capture_name_map();
   inline void set_capture_name_map(Handle<FixedArray> capture_name_map);
   uint32_t backtrack_limit() const;
 
@@ -122,7 +122,7 @@ class JSRegExp : public TorqueGeneratedJSRegExp<JSRegExp, JSObject> {
   V8_EXPORT_PRIVATE static Handle<String> StringFromFlags(Isolate* isolate,
                                                           Flags flags);
 
-  inline String EscapedPattern();
+  inline Tagged<String> EscapedPattern();
 
   bool CanTierUp();
   bool MarkedForTierUp();
@@ -252,8 +252,8 @@ class JSRegExp : public TorqueGeneratedJSRegExp<JSRegExp, JSObject> {
   using FlagsBuffer = base::EmbeddedVector<char, kFlagCount + 1>;
   inline static const char* FlagsToString(Flags flags, FlagsBuffer* out_buffer);
 
-  inline Object DataAt(int index) const;
-  inline void SetDataAt(int index, Object value);
+  inline Tagged<Object> DataAt(int index) const;
+  inline void SetDataAt(int index, Tagged<Object> value);
 
   TQ_OBJECT_CONSTRUCTORS(JSRegExp)
 };
diff --git a/deps/v8/src/objects/js-regexp.tq b/deps/v8/src/objects/js-regexp.tq
index 3888767ecbb462..01ab15272cf35f 100644
--- a/deps/v8/src/objects/js-regexp.tq
+++ b/deps/v8/src/objects/js-regexp.tq
@@ -26,16 +26,16 @@ extern class JSRegExp extends JSObject {
 // validate the lastIndex is positive smi when used in fast paths.
 transient type FastJSRegExp extends JSRegExp;
 
-extern operator '.global' macro
-RegExpBuiltinsAssembler::FastFlagGetterGlobal(FastJSRegExp): bool;
-extern operator '.unicode' macro
-RegExpBuiltinsAssembler::FastFlagGetterUnicode(FastJSRegExp): bool;
+extern operator '.global' macro RegExpBuiltinsAssembler::FastFlagGetterGlobal(
+    FastJSRegExp): bool;
+extern operator '.unicode' macro RegExpBuiltinsAssembler::FastFlagGetterUnicode(
+    FastJSRegExp): bool;
 extern operator '.unicodeSets' macro
-RegExpBuiltinsAssembler::FastFlagGetterUnicodeSets(FastJSRegExp): bool;
-extern operator '.lastIndex' macro
-RegExpBuiltinsAssembler::FastLoadLastIndex(FastJSRegExp): Smi;
-extern operator '.lastIndex=' macro
-RegExpBuiltinsAssembler::FastStoreLastIndex(FastJSRegExp, Smi): void;
+    RegExpBuiltinsAssembler::FastFlagGetterUnicodeSets(FastJSRegExp): bool;
+extern operator '.lastIndex' macro RegExpBuiltinsAssembler::FastLoadLastIndex(
+    FastJSRegExp): Smi;
+extern operator '.lastIndex=' macro RegExpBuiltinsAssembler::FastStoreLastIndex(
+    FastJSRegExp, Smi): void;
 
 @doNotGenerateCast
 extern class JSRegExpConstructor extends JSFunction
diff --git a/deps/v8/src/objects/js-relative-time-format-inl.h b/deps/v8/src/objects/js-relative-time-format-inl.h
index 4afdaa3088e421..953ba584e55d5c 100644
--- a/deps/v8/src/objects/js-relative-time-format-inl.h
+++ b/deps/v8/src/objects/js-relative-time-format-inl.h
@@ -24,7 +24,7 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(JSRelativeTimeFormat)
 
 // Base relative time format accessors.
 ACCESSORS(JSRelativeTimeFormat, icu_formatter,
-          Managed<icu::RelativeDateTimeFormatter>, kIcuFormatterOffset)
+          Tagged<Managed<icu::RelativeDateTimeFormatter>>, kIcuFormatterOffset)
 
 inline void JSRelativeTimeFormat::set_numeric(Numeric numeric) {
   DCHECK_GE(NumericBit::kMax, numeric);
diff --git a/deps/v8/src/objects/js-relative-time-format.cc b/deps/v8/src/objects/js-relative-time-format.cc
index 23dfa9587d2556..2906c766b59ddb 100644
--- a/deps/v8/src/objects/js-relative-time-format.cc
+++ b/deps/v8/src/objects/js-relative-time-format.cc
@@ -253,7 +253,7 @@ Handle<JSObject> JSRelativeTimeFormat::ResolvedOptions(
     Isolate* isolate, Handle<JSRelativeTimeFormat> format_holder) {
   Factory* factory = isolate->factory();
   icu::RelativeDateTimeFormatter* formatter =
-      format_holder->icu_formatter().raw();
+      format_holder->icu_formatter()->raw();
   DCHECK_NOT_NULL(formatter);
   Handle<JSObject> result = factory->NewJSObject(isolate->object_function());
   Handle<String> locale(format_holder->locale(), isolate);
@@ -350,7 +350,7 @@ MaybeHandle<T> FormatCommon(
   Handle<Object> value;
   ASSIGN_RETURN_ON_EXCEPTION(isolate, value,
                              Object::ToNumber(isolate, value_obj), T);
-  double number = value->Number();
+  double number = Object::Number(*value);
   // 4. Let unit be ? ToString(unit).
   Handle<String> unit;
   ASSIGN_RETURN_ON_EXCEPTION(isolate, unit, Object::ToString(isolate, unit_obj),
@@ -363,7 +363,7 @@ MaybeHandle<T> FormatCommon(
                       isolate->factory()->NewStringFromAsciiChecked(func_name)),
         T);
   }
-  icu::RelativeDateTimeFormatter* formatter = format->icu_formatter().raw();
+  icu::RelativeDateTimeFormatter* formatter = format->icu_formatter()->raw();
   DCHECK_NOT_NULL(formatter);
   URelativeDateTimeUnit unit_enum;
   if (!GetURelativeDateTimeUnit(unit, &unit_enum)) {
@@ -383,7 +383,7 @@ MaybeHandle<T> FormatCommon(
     THROW_NEW_ERROR(isolate, NewTypeError(MessageTemplate::kIcuError), T);
   }
   return formatToResult(isolate, formatted, UnitAsString(isolate, unit_enum),
-                        value->IsNaN());
+                        IsNaN(*value));
 }
 
 MaybeHandle<String> FormatToString(
diff --git a/deps/v8/src/objects/js-relative-time-format.h b/deps/v8/src/objects/js-relative-time-format.h
index 77c059fdd67f39..ce84698c864435 100644
--- a/deps/v8/src/objects/js-relative-time-format.h
+++ b/deps/v8/src/objects/js-relative-time-format.h
@@ -59,7 +59,7 @@ class JSRelativeTimeFormat
   V8_EXPORT_PRIVATE static const std::set<std::string>& GetAvailableLocales();
 
   // RelativeTimeFormat accessors.
-  DECL_ACCESSORS(icu_formatter, Managed<icu::RelativeDateTimeFormatter>)
+  DECL_ACCESSORS(icu_formatter, Tagged<Managed<icu::RelativeDateTimeFormatter>>)
 
   // Numeric: identifying whether numerical descriptions are always used, or
   // used only when no more specific version is available (e.g., "1 day ago" vs
diff --git a/deps/v8/src/objects/js-relative-time-format.tq b/deps/v8/src/objects/js-relative-time-format.tq
index 6a88686f4f7f5b..401e067cbd091b 100644
--- a/deps/v8/src/objects/js-relative-time-format.tq
+++ b/deps/v8/src/objects/js-relative-time-format.tq
@@ -5,7 +5,7 @@
 #include 'src/objects/js-relative-time-format.h'
 
 type JSRelativeTimeFormatNumeric extends int32
-constexpr 'JSRelativeTimeFormat::Numeric';
+    constexpr 'JSRelativeTimeFormat::Numeric';
 bitfield struct JSRelativeTimeFormatFlags extends uint31 {
   numeric: JSRelativeTimeFormatNumeric: 1 bit;
 }
diff --git a/deps/v8/src/objects/js-segment-iterator-inl.h b/deps/v8/src/objects/js-segment-iterator-inl.h
index 979a1c796b02da..94e7ef3d6c8b2c 100644
--- a/deps/v8/src/objects/js-segment-iterator-inl.h
+++ b/deps/v8/src/objects/js-segment-iterator-inl.h
@@ -22,10 +22,10 @@ namespace internal {
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSSegmentIterator)
 
 // Base segment iterator accessors.
-ACCESSORS(JSSegmentIterator, icu_break_iterator, Managed<icu::BreakIterator>,
-          kIcuBreakIteratorOffset)
-ACCESSORS(JSSegmentIterator, unicode_string, Managed<icu::UnicodeString>,
-          kUnicodeStringOffset)
+ACCESSORS(JSSegmentIterator, icu_break_iterator,
+          Tagged<Managed<icu::BreakIterator>>, kIcuBreakIteratorOffset)
+ACCESSORS(JSSegmentIterator, unicode_string,
+          Tagged<Managed<icu::UnicodeString>>, kUnicodeStringOffset)
 
 inline void JSSegmentIterator::set_granularity(
     JSSegmenter::Granularity granularity) {
diff --git a/deps/v8/src/objects/js-segment-iterator.cc b/deps/v8/src/objects/js-segment-iterator.cc
index 4fa3f173cc7fac..2d0fed98fa5d71 100644
--- a/deps/v8/src/objects/js-segment-iterator.cc
+++ b/deps/v8/src/objects/js-segment-iterator.cc
@@ -72,7 +72,7 @@ MaybeHandle<JSReceiver> JSSegmentIterator::Next(
     Isolate* isolate, Handle<JSSegmentIterator> segment_iterator) {
   Factory* factory = isolate->factory();
   icu::BreakIterator* icu_break_iterator =
-      segment_iterator->icu_break_iterator().raw();
+      segment_iterator->icu_break_iterator()->raw();
   // 5. Let startIndex be iterator.[[IteratedStringNextSegmentCodeUnitIndex]].
   int32_t start_index = icu_break_iterator->current();
   // 6. Let endIndex be ! FindBoundary(segmenter, string, startIndex, after).
diff --git a/deps/v8/src/objects/js-segment-iterator.h b/deps/v8/src/objects/js-segment-iterator.h
index b8151dc436dbdf..fd9077683e9a15 100644
--- a/deps/v8/src/objects/js-segment-iterator.h
+++ b/deps/v8/src/objects/js-segment-iterator.h
@@ -44,8 +44,8 @@ class JSSegmentIterator
   Handle<String> GranularityAsString(Isolate* isolate) const;
 
   // SegmentIterator accessors.
-  DECL_ACCESSORS(icu_break_iterator, Managed<icu::BreakIterator>)
-  DECL_ACCESSORS(unicode_string, Managed<icu::UnicodeString>)
+  DECL_ACCESSORS(icu_break_iterator, Tagged<Managed<icu::BreakIterator>>)
+  DECL_ACCESSORS(unicode_string, Tagged<Managed<icu::UnicodeString>>)
 
   DECL_PRINTER(JSSegmentIterator)
 
diff --git a/deps/v8/src/objects/js-segmenter-inl.h b/deps/v8/src/objects/js-segmenter-inl.h
index e6744268c4fd81..527d95e894720c 100644
--- a/deps/v8/src/objects/js-segmenter-inl.h
+++ b/deps/v8/src/objects/js-segmenter-inl.h
@@ -22,7 +22,7 @@ namespace internal {
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSSegmenter)
 
 // Base segmenter accessors.
-ACCESSORS(JSSegmenter, icu_break_iterator, Managed<icu::BreakIterator>,
+ACCESSORS(JSSegmenter, icu_break_iterator, Tagged<Managed<icu::BreakIterator>>,
           kIcuBreakIteratorOffset)
 
 inline void JSSegmenter::set_granularity(Granularity granularity) {
diff --git a/deps/v8/src/objects/js-segmenter.h b/deps/v8/src/objects/js-segmenter.h
index f2e21db5fd7336..a67c9aac616487 100644
--- a/deps/v8/src/objects/js-segmenter.h
+++ b/deps/v8/src/objects/js-segmenter.h
@@ -46,7 +46,7 @@ class JSSegmenter : public TorqueGeneratedJSSegmenter<JSSegmenter, JSObject> {
   Handle<String> GranularityAsString(Isolate* isolate) const;
 
   // Segmenter accessors.
-  DECL_ACCESSORS(icu_break_iterator, Managed<icu::BreakIterator>)
+  DECL_ACCESSORS(icu_break_iterator, Tagged<Managed<icu::BreakIterator>>)
 
   // Granularity: identifying the segmenter used.
   //
diff --git a/deps/v8/src/objects/js-segmenter.tq b/deps/v8/src/objects/js-segmenter.tq
index 70853aae72d43e..d642236734f39e 100644
--- a/deps/v8/src/objects/js-segmenter.tq
+++ b/deps/v8/src/objects/js-segmenter.tq
@@ -5,7 +5,7 @@
 #include 'src/objects/js-segmenter.h'
 
 type JSSegmenterGranularity extends int32
-constexpr 'JSSegmenter::Granularity';
+    constexpr 'JSSegmenter::Granularity';
 bitfield struct JSSegmenterFlags extends uint31 {
   granularity: JSSegmenterGranularity: 2 bit;
 }
diff --git a/deps/v8/src/objects/js-segments-inl.h b/deps/v8/src/objects/js-segments-inl.h
index 37fc4964e0c44b..86170eb1d9dbdb 100644
--- a/deps/v8/src/objects/js-segments-inl.h
+++ b/deps/v8/src/objects/js-segments-inl.h
@@ -22,9 +22,9 @@ namespace internal {
 TQ_OBJECT_CONSTRUCTORS_IMPL(JSSegments)
 
 // Base segments accessors.
-ACCESSORS(JSSegments, icu_break_iterator, Managed<icu::BreakIterator>,
+ACCESSORS(JSSegments, icu_break_iterator, Tagged<Managed<icu::BreakIterator>>,
           kIcuBreakIteratorOffset)
-ACCESSORS(JSSegments, unicode_string, Managed<icu::UnicodeString>,
+ACCESSORS(JSSegments, unicode_string, Tagged<Managed<icu::UnicodeString>>,
           kUnicodeStringOffset)
 
 inline void JSSegments::set_granularity(JSSegmenter::Granularity granularity) {
diff --git a/deps/v8/src/objects/js-segments.cc b/deps/v8/src/objects/js-segments.cc
index 84d8197e57d39f..9e70593978a743 100644
--- a/deps/v8/src/objects/js-segments.cc
+++ b/deps/v8/src/objects/js-segments.cc
@@ -30,7 +30,7 @@ MaybeHandle<JSSegments> JSSegments::Create(Isolate* isolate,
                                            Handle<JSSegmenter> segmenter,
                                            Handle<String> string) {
   icu::BreakIterator* break_iterator =
-      segmenter->icu_break_iterator().raw()->clone();
+      segmenter->icu_break_iterator()->raw()->clone();
   DCHECK_NOT_NULL(break_iterator);
 
   Handle<Managed<icu::UnicodeString>> unicode_string =
@@ -62,7 +62,7 @@ MaybeHandle<Object> JSSegments::Containing(Isolate* isolate,
                                            Handle<JSSegments> segments,
                                            double n_double) {
   // 5. Let len be the length of string.
-  int32_t len = segments->unicode_string().raw()->length();
+  int32_t len = segments->unicode_string()->raw()->length();
 
   // 7. If n < 0 or n ≥ len, return undefined.
   if (n_double < 0 || n_double >= len) {
@@ -71,9 +71,9 @@ MaybeHandle<Object> JSSegments::Containing(Isolate* isolate,
 
   int32_t n = static_cast<int32_t>(n_double);
   // n may point to the surrogate tail- adjust it back to the lead.
-  n = segments->unicode_string().raw()->getChar32Start(n);
+  n = segments->unicode_string()->raw()->getChar32Start(n);
 
-  icu::BreakIterator* break_iterator = segments->icu_break_iterator().raw();
+  icu::BreakIterator* break_iterator = segments->icu_break_iterator()->raw();
   // 8. Let startIndex be ! FindBoundary(segmenter, string, n, before).
   int32_t start_index =
       break_iterator->isBoundary(n) ? n : break_iterator->preceding(n);
@@ -85,7 +85,7 @@ MaybeHandle<Object> JSSegments::Containing(Isolate* isolate,
   // endIndex).
   return CreateSegmentDataObject(
       isolate, segments->granularity(), break_iterator,
-      *(segments->unicode_string().raw()), start_index, end_index);
+      *(segments->unicode_string()->raw()), start_index, end_index);
 }
 
 namespace {
@@ -158,9 +158,7 @@ MaybeHandle<Object> JSSegments::CreateSegmentDataObject(
     // a. Let isWordLike be a Boolean value indicating whether the word segment
     //    segment in string is "word-like" according to locale
     //    segmenter.[[Locale]].
-    is_word_like = CurrentSegmentIsWordLike(break_iterator)
-                       ? factory->true_value()
-                       : factory->false_value();
+    is_word_like = factory->ToBoolean(CurrentSegmentIsWordLike(break_iterator));
     // b. Perform ! CreateDataPropertyOrThrow(result, "isWordLike", isWordLike).
     Maybe<bool> maybe_create_is_word_like = JSReceiver::CreateDataProperty(
         isolate, result, factory->isWordLike_string(), is_word_like,
diff --git a/deps/v8/src/objects/js-segments.h b/deps/v8/src/objects/js-segments.h
index aa5759ade8725f..84fc7d46bbf2e5 100644
--- a/deps/v8/src/objects/js-segments.h
+++ b/deps/v8/src/objects/js-segments.h
@@ -48,8 +48,8 @@ class JSSegments : public TorqueGeneratedJSSegments<JSSegments, JSObject> {
   Handle<String> GranularityAsString(Isolate* isolate) const;
 
   // SegmentIterator accessors.
-  DECL_ACCESSORS(icu_break_iterator, Managed<icu::BreakIterator>)
-  DECL_ACCESSORS(unicode_string, Managed<icu::UnicodeString>)
+  DECL_ACCESSORS(icu_break_iterator, Tagged<Managed<icu::BreakIterator>>)
+  DECL_ACCESSORS(unicode_string, Tagged<Managed<icu::UnicodeString>>)
 
   DECL_PRINTER(JSSegments)
 
diff --git a/deps/v8/src/objects/js-struct.cc b/deps/v8/src/objects/js-struct.cc
index f1bb5a84e96f9a..b8a583231ea69b 100644
--- a/deps/v8/src/objects/js-struct.cc
+++ b/deps/v8/src/objects/js-struct.cc
@@ -11,6 +11,43 @@
 namespace v8 {
 namespace internal {
 
+namespace {
+
+void PrepareMapCommon(Map map) {
+  DCHECK(IsAlwaysSharedSpaceJSObjectMap(map));
+  DisallowGarbageCollection no_gc;
+  // Shared objects have fixed layout ahead of time, so there's no slack.
+  map->SetInObjectUnusedPropertyFields(0);
+  // Shared objects are not extensible and have a null prototype.
+  map->set_is_extensible(false);
+  // Shared space objects are not optimizable as prototypes because it is
+  // not threadsafe.
+  map->set_prototype_validity_cell(Smi::FromInt(Map::kPrototypeChainValid),
+                                   kRelaxedStore, SKIP_WRITE_BARRIER);
+}
+
+}  // namespace
+
+// static
+void AlwaysSharedSpaceJSObject::PrepareMapNoEnumerableProperties(
+    Tagged<Map> map) {
+  PrepareMapCommon(map);
+  map->SetEnumLength(0);
+}
+
+// static
+void AlwaysSharedSpaceJSObject::PrepareMapWithEnumerableProperties(
+    Isolate* isolate, Handle<Map> map, Handle<DescriptorArray> descriptors,
+    int enum_length) {
+  PrepareMapCommon(*map);
+  // Shared objects with enumerable own properties need to pre-create the enum
+  // cache, as creating it lazily is racy.
+  map->InitializeDescriptors(isolate, *descriptors);
+  FastKeyAccumulator::InitializeFastPropertyEnumCache(
+      isolate, map, enum_length, AllocationType::kSharedOld);
+  DCHECK_EQ(enum_length, map->EnumLength());
+}
+
 // static
 Maybe<bool> AlwaysSharedSpaceJSObject::DefineOwnProperty(
     Isolate* isolate, Handle<AlwaysSharedSpaceJSObject> shared_obj,
@@ -22,7 +59,7 @@ Maybe<bool> AlwaysSharedSpaceJSObject::DefineOwnProperty(
   // non-writable properties. This upgrade violates the fixed layout invariant
   // and is disallowed.
 
-  DCHECK(key->IsName() || key->IsNumber());  // |key| is a PropertyKey.
+  DCHECK(IsName(*key) || IsNumber(*key));  // |key| is a PropertyKey.
   PropertyKey lookup_key(isolate, key);
   LookupIterator it(isolate, shared_obj, lookup_key, LookupIterator::OWN);
   PropertyDescriptor current;
@@ -33,7 +70,7 @@ Maybe<bool> AlwaysSharedSpaceJSObject::DefineOwnProperty(
       PropertyDescriptor::IsDataDescriptor(desc) !=
           PropertyDescriptor::IsDataDescriptor(&current) ||
       desc->ToAttributes() != current.ToAttributes()) {
-    DCHECK(!shared_obj->map().is_extensible());
+    DCHECK(!shared_obj->map()->is_extensible());
     RETURN_FAILURE(isolate, GetShouldThrow(isolate, should_throw),
                    NewTypeError(MessageTemplate::kDefineDisallowedFixedLayout,
                                 it.GetName()));
@@ -45,5 +82,25 @@ Maybe<bool> AlwaysSharedSpaceJSObject::DefineOwnProperty(
   return Just(true);
 }
 
+Maybe<bool> AlwaysSharedSpaceJSObject::HasInstance(
+    Isolate* isolate, Handle<JSFunction> constructor, Handle<Object> object) {
+  if (!constructor->has_prototype_slot() || !constructor->has_initial_map() ||
+      !IsJSReceiver(*object)) {
+    return Just(false);
+  }
+  Handle<Map> constructor_map = handle(constructor->initial_map(), isolate);
+  PrototypeIterator iter(isolate, Handle<JSReceiver>::cast(object),
+                         kStartAtReceiver);
+  Handle<Map> current_map;
+  while (true) {
+    current_map = handle(PrototypeIterator::GetCurrent(iter)->map(), isolate);
+    if (current_map.is_identical_to(constructor_map)) {
+      return Just(true);
+    }
+    if (!iter.AdvanceFollowingProxies()) return Nothing<bool>();
+    if (iter.IsAtEnd()) return Just(false);
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/js-struct.h b/deps/v8/src/objects/js-struct.h
index 7501650c8a255c..3e0ca6a908e216 100644
--- a/deps/v8/src/objects/js-struct.h
+++ b/deps/v8/src/objects/js-struct.h
@@ -19,11 +19,24 @@ class AlwaysSharedSpaceJSObject
     : public TorqueGeneratedAlwaysSharedSpaceJSObject<AlwaysSharedSpaceJSObject,
                                                       JSObject> {
  public:
+  // Prepare a Map to be used as the instance map for shared JS objects.
+  static void PrepareMapNoEnumerableProperties(Tagged<Map> map);
+  static void PrepareMapWithEnumerableProperties(
+      Isolate* isolate, Handle<Map> map, Handle<DescriptorArray> descriptors,
+      int enum_length);
+
   V8_WARN_UNUSED_RESULT static Maybe<bool> DefineOwnProperty(
       Isolate* isolate, Handle<AlwaysSharedSpaceJSObject> shared_obj,
       Handle<Object> key, PropertyDescriptor* desc,
       Maybe<ShouldThrow> should_throw);
 
+  // This is a generic `HasInstance` that checks the constructor's initial map
+  // against the object's map. It is on `AlwaysSharedSpaceJSObject` because this
+  // kind of instanceof resolution resolution is used only for shared objects.
+  static Maybe<bool> HasInstance(Isolate* isolate,
+                                 Handle<JSFunction> constructor,
+                                 Handle<Object> object);
+
   static_assert(kHeaderSize == JSObject::kHeaderSize);
   TQ_OBJECT_CONSTRUCTORS(AlwaysSharedSpaceJSObject)
 };
diff --git a/deps/v8/src/objects/js-struct.tq b/deps/v8/src/objects/js-struct.tq
index a50c6d75c719f3..5da14a0d94662e 100644
--- a/deps/v8/src/objects/js-struct.tq
+++ b/deps/v8/src/objects/js-struct.tq
@@ -6,7 +6,6 @@
 // shared space. Its instance type range is used to fast path the shared value
 // barrier.
 @abstract
-extern class AlwaysSharedSpaceJSObject extends JSObject {
-}
+extern class AlwaysSharedSpaceJSObject extends JSObject {}
 
 extern class JSSharedStruct extends AlwaysSharedSpaceJSObject {}
diff --git a/deps/v8/src/objects/js-temporal-objects.cc b/deps/v8/src/objects/js-temporal-objects.cc
index 03303935b3cab7..d5e224df6af89f 100644
--- a/deps/v8/src/objects/js-temporal-objects.cc
+++ b/deps/v8/src/objects/js-temporal-objects.cc
@@ -597,10 +597,10 @@ bool ISOYearMonthWithinLimits(int32_t year, int32_t month) {
 #define THROW_INVALID_RANGE(T) \
   THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(), T);
 
-#define CONSTRUCTOR(name)                                                    \
-  Handle<JSFunction>(                                                        \
-      JSFunction::cast(                                                      \
-          isolate->context().native_context().temporal_##name##_function()), \
+#define CONSTRUCTOR(name)                                                      \
+  Handle<JSFunction>(                                                          \
+      JSFunction::cast(                                                        \
+          isolate->context()->native_context()->temporal_##name##_function()), \
       isolate)
 
 // #sec-temporal-systemutcepochnanoseconds
@@ -1716,7 +1716,7 @@ MaybeHandle<FixedArray> GetPossibleInstantsFor(Isolate* isolate,
       Object::GetProperty(isolate, time_zone,
                           isolate->factory()->getPossibleInstantsFor_string()),
       FixedArray);
-  if (!function->IsCallable()) {
+  if (!IsCallable(*function)) {
     THROW_NEW_ERROR(
         isolate,
         NewTypeError(MessageTemplate::kCalledNonCallable,
@@ -1743,7 +1743,7 @@ MaybeHandle<FixedArray> GetPossibleInstantsFor(Isolate* isolate,
             possible_instants, arraysize(argv), argv),
         FixedArray);
   }
-  DCHECK(possible_instants->IsFixedArray());
+  DCHECK(IsFixedArray(*possible_instants));
   // 7. Return list.
   return Handle<FixedArray>::cast(possible_instants);
 }
@@ -1755,7 +1755,7 @@ MaybeHandle<JSTemporalInstant> DisambiguatePossibleInstants(
     Disambiguation disambiguation, const char* method_name) {
   TEMPORAL_ENTER_FUNC();
   // 1. Assert: dateTime has an [[InitializedTemporalDateTime]] internal slot.
-  DCHECK(date_time_obj->IsJSTemporalPlainDateTime());
+  DCHECK(IsJSTemporalPlainDateTime(*date_time_obj));
   Handle<JSTemporalPlainDateTime> date_time =
       Handle<JSTemporalPlainDateTime>::cast(date_time_obj);
 
@@ -1766,7 +1766,7 @@ MaybeHandle<JSTemporalInstant> DisambiguatePossibleInstants(
   if (n == 1) {
     // a. Return possibleInstants[0].
     Handle<Object> ret_obj = FixedArray::get(*possible_instants, 0, isolate);
-    DCHECK(ret_obj->IsJSTemporalInstant());
+    DCHECK(IsJSTemporalInstant(*ret_obj));
     return Handle<JSTemporalInstant>::cast(ret_obj);
   }
   // 4. If n ≠ 0, then
@@ -1776,7 +1776,7 @@ MaybeHandle<JSTemporalInstant> DisambiguatePossibleInstants(
         disambiguation == Disambiguation::kCompatible) {
       // i. Return possibleInstants[0].
       Handle<Object> ret_obj = FixedArray::get(*possible_instants, 0, isolate);
-      DCHECK(ret_obj->IsJSTemporalInstant());
+      DCHECK(IsJSTemporalInstant(*ret_obj));
       return Handle<JSTemporalInstant>::cast(ret_obj);
     }
     // b. If disambiguation is "later", then
@@ -1784,7 +1784,7 @@ MaybeHandle<JSTemporalInstant> DisambiguatePossibleInstants(
       // i. Return possibleInstants[n − 1].
       Handle<Object> ret_obj =
           FixedArray::get(*possible_instants, n - 1, isolate);
-      DCHECK(ret_obj->IsJSTemporalInstant());
+      DCHECK(IsJSTemporalInstant(*ret_obj));
       return Handle<JSTemporalInstant>::cast(ret_obj);
     }
     // c. Assert: disambiguation is "reject".
@@ -1904,7 +1904,7 @@ MaybeHandle<JSTemporalInstant> DisambiguatePossibleInstants(
     }
     // e. Return possibleInstants[0].
     Handle<Object> ret_obj = FixedArray::get(*possible_instants, 0, isolate);
-    DCHECK(ret_obj->IsJSTemporalInstant());
+    DCHECK(IsJSTemporalInstant(*ret_obj));
     return Handle<JSTemporalInstant>::cast(ret_obj);
   }
   // 14. Assert: disambiguation is "compatible" or "later".
@@ -1956,7 +1956,7 @@ MaybeHandle<JSTemporalInstant> DisambiguatePossibleInstants(
   }
   // 20. Return possibleInstants[n − 1].
   Handle<Object> ret_obj = FixedArray::get(*possible_instants, n - 1, isolate);
-  DCHECK(ret_obj->IsJSTemporalInstant());
+  DCHECK(IsJSTemporalInstant(*ret_obj));
   return Handle<JSTemporalInstant>::cast(ret_obj);
 }
 
@@ -1971,25 +1971,25 @@ MaybeHandle<JSReceiver> GetTemporalCalendarWithISODefault(
   // [[InitializedTemporalTime]], [[InitializedTemporalYearMonth]], or
   // [[InitializedTemporalZonedDateTime]] internal slot, then a. Return
   // item.[[Calendar]].
-  if (item->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*item)) {
     return handle(Handle<JSTemporalPlainDate>::cast(item)->calendar(), isolate);
   }
-  if (item->IsJSTemporalPlainDateTime()) {
+  if (IsJSTemporalPlainDateTime(*item)) {
     return handle(Handle<JSTemporalPlainDateTime>::cast(item)->calendar(),
                   isolate);
   }
-  if (item->IsJSTemporalPlainMonthDay()) {
+  if (IsJSTemporalPlainMonthDay(*item)) {
     return handle(Handle<JSTemporalPlainMonthDay>::cast(item)->calendar(),
                   isolate);
   }
-  if (item->IsJSTemporalPlainTime()) {
+  if (IsJSTemporalPlainTime(*item)) {
     return handle(Handle<JSTemporalPlainTime>::cast(item)->calendar(), isolate);
   }
-  if (item->IsJSTemporalPlainYearMonth()) {
+  if (IsJSTemporalPlainYearMonth(*item)) {
     return handle(Handle<JSTemporalPlainYearMonth>::cast(item)->calendar(),
                   isolate);
   }
-  if (item->IsJSTemporalZonedDateTime()) {
+  if (IsJSTemporalZonedDateTime(*item)) {
     return handle(Handle<JSTemporalZonedDateTime>::cast(item)->calendar(),
                   isolate);
   }
@@ -2037,7 +2037,7 @@ V8_WARN_UNUSED_RESULT MaybeHandle<JSReceiver> PrepareTemporalFieldsOrPartial(
         JSObject);
 
     // b. If value is undefined, then
-    if (value->IsUndefined()) {
+    if (IsUndefined(*value)) {
       // This part is only for PrepareTemporalFields
       // Skip for the case of PreparePartialTemporalFields.
       if (partial) continue;
@@ -2149,7 +2149,7 @@ MaybeHandle<T> FromFields(Isolate* isolate, Handle<JSReceiver> calendar,
   Handle<Object> function;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, function, Object::GetProperty(isolate, calendar, property), T);
-  if (!function->IsCallable()) {
+  if (!IsCallable(*function)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kCalledNonCallable, property),
                     T);
@@ -2159,8 +2159,8 @@ MaybeHandle<T> FromFields(Isolate* isolate, Handle<JSReceiver> calendar,
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, result, Execution::Call(isolate, function, calendar, 2, argv),
       T);
-  if ((!result->IsHeapObject()) ||
-      HeapObject::cast(*result).map().instance_type() != type) {
+  if ((!IsHeapObject(*result)) ||
+      HeapObject::cast(*result)->map()->instance_type() != type) {
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(), T);
   }
   return Handle<T>::cast(result);
@@ -2212,8 +2212,8 @@ MaybeHandle<JSTemporalPlainMonthDay> MonthDayFromFields(
 Maybe<ShowOverflow> ToTemporalOverflow(Isolate* isolate, Handle<Object> options,
                                        const char* method_name) {
   // 1. If options is undefined, return "constrain".
-  if (options->IsUndefined()) return Just(ShowOverflow::kConstrain);
-  DCHECK(options->IsJSReceiver());
+  if (IsUndefined(*options)) return Just(ShowOverflow::kConstrain);
+  DCHECK(IsJSReceiver(*options));
   // 2. Return ? GetOption(options, "overflow", « String », « "constrain",
   // "reject" », "constrain").
   return GetStringOption<ShowOverflow>(
@@ -2227,8 +2227,8 @@ Maybe<ShowOverflow> ToTemporalOverflow(Isolate* isolate, Handle<Object> options,
 Maybe<Offset> ToTemporalOffset(Isolate* isolate, Handle<Object> options,
                                Offset fallback, const char* method_name) {
   // 1. If options is undefined, return fallback.
-  if (options->IsUndefined()) return Just(fallback);
-  DCHECK(options->IsJSReceiver());
+  if (IsUndefined(*options)) return Just(fallback);
+  DCHECK(IsJSReceiver(*options));
 
   // 2. Return ? GetOption(options, "offset", « String », « "prefer", "use",
   // "ignore", "reject" », fallback).
@@ -2244,8 +2244,8 @@ Maybe<Disambiguation> ToTemporalDisambiguation(Isolate* isolate,
                                                Handle<Object> options,
                                                const char* method_name) {
   // 1. If options is undefined, return "compatible".
-  if (options->IsUndefined()) return Just(Disambiguation::kCompatible);
-  DCHECK(options->IsJSReceiver());
+  if (IsUndefined(*options)) return Just(Disambiguation::kCompatible);
+  DCHECK(IsJSReceiver(*options));
   // 2. Return ? GetOption(options, "disambiguation", « String », «
   // "compatible", "earlier", "later", "reject" », "compatible").
   return GetStringOption<Disambiguation>(
@@ -2282,15 +2282,15 @@ MaybeHandle<JSTemporalInstant> ToTemporalInstant(Isolate* isolate,
 
   // 1. If Type(item) is Object, then
   // a. If item has an [[InitializedTemporalInstant]] internal slot, then
-  if (item->IsJSTemporalInstant()) {
+  if (IsJSTemporalInstant(*item)) {
     // i. Return item.
     return Handle<JSTemporalInstant>::cast(item);
   }
   // b. If item has an [[InitializedTemporalZonedDateTime]] internal slot, then
-  if (item->IsJSTemporalZonedDateTime()) {
+  if (IsJSTemporalZonedDateTime(*item)) {
     // i. Return ! CreateTemporalInstant(item.[[Nanoseconds]]).
     Handle<BigInt> nanoseconds =
-        handle(JSTemporalZonedDateTime::cast(*item).nanoseconds(), isolate);
+        handle(JSTemporalZonedDateTime::cast(*item)->nanoseconds(), isolate);
     return temporal::CreateTemporalInstant(isolate, nanoseconds)
         .ToHandleChecked();
   }
@@ -2318,7 +2318,7 @@ MaybeHandle<JSReceiver> ToTemporalCalendar(
     const char* method_name) {
   Factory* factory = isolate->factory();
   // 1.If Type(temporalCalendarLike) is Object, then
-  if (temporal_calendar_like->IsJSReceiver()) {
+  if (IsJSReceiver(*temporal_calendar_like)) {
     // a. If temporalCalendarLike has an [[InitializedTemporalDate]],
     // [[InitializedTemporalDateTime]], [[InitializedTemporalMonthDay]],
     // [[InitializedTemporalTime]], [[InitializedTemporalYearMonth]], or
@@ -2326,7 +2326,7 @@ MaybeHandle<JSReceiver> ToTemporalCalendar(
     // temporalCalendarLike.[[Calendar]].
 
 #define EXTRACT_CALENDAR(T, obj)                                          \
-  if (obj->IsJSTemporal##T()) {                                           \
+  if (IsJSTemporal##T(*obj)) {                                            \
     return handle(Handle<JSTemporal##T>::cast(obj)->calendar(), isolate); \
   }
 
@@ -2356,7 +2356,7 @@ MaybeHandle<JSReceiver> ToTemporalCalendar(
         JSReceiver::GetProperty(isolate, obj, factory->calendar_string()),
         JSReceiver);
     // d. If Type(temporalCalendarLike) is Object
-    if (temporal_calendar_like->IsJSReceiver()) {
+    if (IsJSReceiver(*temporal_calendar_like)) {
       obj = Handle<JSReceiver>::cast(temporal_calendar_like);
       // and ? HasProperty(temporalCalendarLike, "calendar") is false,
       MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -2400,7 +2400,7 @@ MaybeHandle<JSReceiver> ToTemporalCalendarWithISODefault(
   TEMPORAL_ENTER_FUNC();
 
   // 1. If temporalCalendarLike is undefined, then
-  if (temporal_calendar_like->IsUndefined()) {
+  if (IsUndefined(*temporal_calendar_like)) {
     // a. Return ? GetISO8601Calendar().
     return temporal::GetISO8601Calendar(isolate);
   }
@@ -2461,18 +2461,18 @@ MaybeHandle<JSTemporalPlainDate> ToTemporalDate(Isolate* isolate,
   TEMPORAL_ENTER_FUNC();
 
   // 2. Assert: Type(options) is Object or Undefined.
-  DCHECK(options->IsJSReceiver() || options->IsUndefined());
+  DCHECK(IsJSReceiver(*options) || IsUndefined(*options));
   // 3. If Type(item) is Object, then
-  if (item_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*item_obj)) {
     Handle<JSReceiver> item = Handle<JSReceiver>::cast(item_obj);
     // a. If item has an [[InitializedTemporalDate]] internal slot, then
     // i. Return item.
-    if (item->IsJSTemporalPlainDate()) {
+    if (IsJSTemporalPlainDate(*item)) {
       return Handle<JSTemporalPlainDate>::cast(item);
     }
     // b. If item has an [[InitializedTemporalZonedDateTime]] internal slot,
     // then
-    if (item->IsJSTemporalZonedDateTime()) {
+    if (IsJSTemporalZonedDateTime(*item)) {
       // i. Perform ? ToTemporalOverflow(options).
       MAYBE_RETURN_ON_EXCEPTION_VALUE(
           isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -2510,7 +2510,7 @@ MaybeHandle<JSTemporalPlainDate> ToTemporalDate(Isolate* isolate,
 
     // c. If item has an [[InitializedTemporalDateTime]] internal slot, then
     // item.[[ISODay]], item.[[Calendar]]).
-    if (item->IsJSTemporalPlainDateTime()) {
+    if (IsJSTemporalPlainDateTime(*item)) {
       // i. Perform ? ToTemporalOverflow(options).
       MAYBE_RETURN_ON_EXCEPTION_VALUE(
           isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -2588,9 +2588,9 @@ MaybeHandle<JSTemporalPlainDate> ToTemporalDate(Isolate* isolate,
 // #sec-isintegralnumber
 bool IsIntegralNumber(Isolate* isolate, Handle<Object> argument) {
   // 1. If Type(argument) is not Number, return false.
-  if (!argument->IsNumber()) return false;
+  if (!IsNumber(*argument)) return false;
   // 2. If argument is NaN, +∞𝔽, or -∞𝔽, return false.
-  double number = argument->Number();
+  double number = Object::Number(*argument);
   if (!std::isfinite(number)) return false;
   // 3. If floor(abs(ℝ(argument))) ≠ abs(ℝ(argument)), return false.
   if (std::floor(std::abs(number)) != std::abs(number)) return false;
@@ -2606,7 +2606,7 @@ Maybe<double> ToIntegerWithoutRounding(Isolate* isolate,
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, number, Object::ToNumber(isolate, argument), Nothing<double>());
   // 2. If number is NaN, +0𝔽, or −0𝔽 return 0.
-  if (number->IsNaN() || number->Number() == 0) {
+  if (IsNaN(*number) || Object::Number(*number) == 0) {
     return Just(static_cast<double>(0));
   }
   // 3. If IsIntegralNumber(number) is false, throw a RangeError exception.
@@ -2615,7 +2615,7 @@ Maybe<double> ToIntegerWithoutRounding(Isolate* isolate,
         isolate, NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(), Nothing<double>());
   }
   // 4. Return ℝ(number).
-  return Just(number->Number());
+  return Just(Object::Number(*number));
 }
 
 }  // namespace
@@ -2668,16 +2668,16 @@ MaybeHandle<JSTemporalPlainTime> ToTemporalTime(
   TimeRecordWithCalendar result;
   // 2. Assert: overflow is either "constrain" or "reject".
   // 3. If Type(item) is Object, then
-  if (item_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*item_obj)) {
     Handle<JSReceiver> item = Handle<JSReceiver>::cast(item_obj);
     // a. If item has an [[InitializedTemporalTime]] internal slot, then
     // i. Return item.
-    if (item->IsJSTemporalPlainTime()) {
+    if (IsJSTemporalPlainTime(*item)) {
       return Handle<JSTemporalPlainTime>::cast(item);
     }
     // b. If item has an [[InitializedTemporalZonedDateTime]] internal slot,
     // then
-    if (item->IsJSTemporalZonedDateTime()) {
+    if (IsJSTemporalZonedDateTime(*item)) {
       // i. Let instant be ! CreateTemporalInstant(item.[[Nanoseconds]]).
       Handle<JSTemporalZonedDateTime> zoned_date_time =
           Handle<JSTemporalZonedDateTime>::cast(item);
@@ -2711,7 +2711,7 @@ MaybeHandle<JSTemporalPlainTime> ToTemporalTime(
           .ToHandleChecked();
     }
     // c. If item has an [[InitializedTemporalDateTime]] internal slot, then
-    if (item->IsJSTemporalPlainDateTime()) {
+    if (IsJSTemporalPlainDateTime(*item)) {
       // i. Return ! CreateTemporalTime(item.[[ISOHour]], item.[[ISOMinute]],
       // item.[[ISOSecond]], item.[[ISOMillisecond]], item.[[ISOMicrosecond]],
       // item.[[ISONanosecond]]).
@@ -2766,8 +2766,8 @@ MaybeHandle<JSTemporalPlainTime> ToTemporalTime(
     // result.[[Nanosecond]]) is true.
     DCHECK(IsValidTime(isolate, result.time));
     // d. If result.[[Calendar]] is not one of undefined or "iso8601", then
-    DCHECK(result.calendar->IsUndefined() || result.calendar->IsString());
-    if (!result.calendar->IsUndefined() &&
+    DCHECK(IsUndefined(*result.calendar) || IsString(*result.calendar));
+    if (!IsUndefined(*result.calendar) &&
         !String::Equals(isolate, Handle<String>::cast(result.calendar),
                         isolate->factory()->iso8601_string())) {
       // i. Throw a RangeError exception.
@@ -2829,7 +2829,7 @@ Maybe<DurationRecord> ToTemporalDurationRecord(
   TEMPORAL_ENTER_FUNC();
 
   // 1. If Type(temporalDurationLike) is not Object, then
-  if (!temporal_duration_like_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*temporal_duration_like_obj)) {
     // a. Let string be ? ToString(temporalDurationLike).
     Handle<String> string;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -2842,7 +2842,7 @@ Maybe<DurationRecord> ToTemporalDurationRecord(
       Handle<JSReceiver>::cast(temporal_duration_like_obj);
   // 2. If temporalDurationLike has an [[InitializedTemporalDuration]] internal
   // slot, then
-  if (temporal_duration_like->IsJSTemporalDuration()) {
+  if (IsJSTemporalDuration(*temporal_duration_like)) {
     // a. Return ! CreateDurationRecord(temporalDurationLike.[[Years]],
     // temporalDurationLike.[[Months]], temporalDurationLike.[[Weeks]],
     // temporalDurationLike.[[Days]], temporalDurationLike.[[Hours]],
@@ -2853,11 +2853,14 @@ Maybe<DurationRecord> ToTemporalDurationRecord(
     Handle<JSTemporalDuration> duration =
         Handle<JSTemporalDuration>::cast(temporal_duration_like);
     return DurationRecord::Create(
-        isolate, duration->years().Number(), duration->months().Number(),
-        duration->weeks().Number(), duration->days().Number(),
-        duration->hours().Number(), duration->minutes().Number(),
-        duration->seconds().Number(), duration->milliseconds().Number(),
-        duration->microseconds().Number(), duration->nanoseconds().Number());
+        isolate, Object::Number(duration->years()),
+        Object::Number(duration->months()), Object::Number(duration->weeks()),
+        Object::Number(duration->days()), Object::Number(duration->hours()),
+        Object::Number(duration->minutes()),
+        Object::Number(duration->seconds()),
+        Object::Number(duration->milliseconds()),
+        Object::Number(duration->microseconds()),
+        Object::Number(duration->nanoseconds()));
   }
   // 3. Let result be a new Record with all the internal slots given in the
   // Internal Slot column in Table 8.
@@ -2881,7 +2884,7 @@ Maybe<DurationRecord> ToTemporalDurationRecord(
                 JSReceiver::GetProperty(isolate, temporal_duration_like, prop),
                 Nothing<bool>());
             // c. If val is undefined, then
-            if (val->IsUndefined()) {
+            if (IsUndefined(*val)) {
               // i. Set result's internal slot whose name is the Internal Slot
               // value of the current row to 0.
               *field = 0;
@@ -2930,7 +2933,7 @@ MaybeHandle<JSTemporalDuration> ToTemporalDuration(Isolate* isolate,
   DurationRecord result;
   // 1. If Type(item) is Object and item has an [[InitializedTemporalDuration]]
   // internal slot, then
-  if (item->IsJSTemporalDuration()) {
+  if (IsJSTemporalDuration(*item)) {
     // a. Return item.
     return Handle<JSTemporalDuration>::cast(item);
   }
@@ -2954,10 +2957,10 @@ MaybeHandle<JSReceiver> ToTemporalTimeZone(
 
   Factory* factory = isolate->factory();
   // 1. If Type(temporalTimeZoneLike) is Object, then
-  if (temporal_time_zone_like->IsJSReceiver()) {
+  if (IsJSReceiver(*temporal_time_zone_like)) {
     // a. If temporalTimeZoneLike has an [[InitializedTemporalZonedDateTime]]
     // internal slot, then
-    if (temporal_time_zone_like->IsJSTemporalZonedDateTime()) {
+    if (IsJSTemporalZonedDateTime(*temporal_time_zone_like)) {
       // i. Return temporalTimeZoneLike.[[TimeZone]].
       Handle<JSTemporalZonedDateTime> zoned_date_time =
           Handle<JSTemporalZonedDateTime>::cast(temporal_time_zone_like);
@@ -2981,7 +2984,7 @@ MaybeHandle<JSReceiver> ToTemporalTimeZone(
         JSReceiver::GetProperty(isolate, obj, factory->timeZone_string()),
         JSReceiver);
     // d. If Type(temporalTimeZoneLike)
-    if (temporal_time_zone_like->IsJSReceiver()) {
+    if (IsJSReceiver(*temporal_time_zone_like)) {
       // is Object and ? HasProperty(temporalTimeZoneLike, "timeZone") is false,
       obj = Handle<JSReceiver>::cast(temporal_time_zone_like);
       MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -3007,8 +3010,8 @@ MaybeHandle<JSReceiver> ToTemporalTimeZone(
       Handle<JSReceiver>());
 
   // 4. If parseResult.[[Name]] is not undefined, then
-  if (!parse_result.name->IsUndefined()) {
-    DCHECK(parse_result.name->IsString());
+  if (!IsUndefined(*parse_result.name)) {
+    DCHECK(IsString(*parse_result.name));
     // a. Let name be parseResult.[[Name]].
     Handle<String> name = Handle<String>::cast(parse_result.name);
     // b. If ParseText(StringToCodePoints(name, TimeZoneNumericUTCOffset)) is
@@ -3033,7 +3036,7 @@ MaybeHandle<JSReceiver> ToTemporalTimeZone(
     return CreateTemporalTimeZoneUTC(isolate);
   }
   // 6. Return ! CreateTemporalTimeZone(parseResult.[[OffsetString]]).
-  DCHECK(parse_result.offset_string->IsString());
+  DCHECK(IsString(*parse_result.offset_string));
   return temporal::CreateTemporalTimeZone(
       isolate, Handle<String>::cast(parse_result.offset_string));
 }
@@ -3049,7 +3052,7 @@ MaybeHandle<JSTemporalPlainDateTime> SystemDateTime(
 
   Handle<JSReceiver> time_zone;
   // 1. 1. If temporalTimeZoneLike is undefined, then
-  if (temporal_time_zone_like->IsUndefined()) {
+  if (IsUndefined(*temporal_time_zone_like)) {
     // a. Let timeZone be ! SystemTimeZone().
     time_zone = SystemTimeZone(isolate);
   } else {
@@ -3082,7 +3085,7 @@ MaybeHandle<JSTemporalZonedDateTime> SystemZonedDateTime(
 
   Handle<JSReceiver> time_zone;
   // 1. 1. If temporalTimeZoneLike is undefined, then
-  if (temporal_time_zone_like->IsUndefined()) {
+  if (IsUndefined(*temporal_time_zone_like)) {
     // a. Let timeZone be ! SystemTimeZone().
     time_zone = SystemTimeZone(isolate);
   } else {
@@ -3660,7 +3663,7 @@ Maybe<InstantRecord> ParseTemporalInstantString(Isolate* isolate,
     offset_string = isolate->factory()->NewStringFromStaticChars("+00:00");
   }
   // 5. Assert: offsetString is not undefined.
-  DCHECK(!offset_string->IsUndefined());
+  DCHECK(!IsUndefined(*offset_string));
 
   // 6. Return the new Record { [[Year]]: result.[[Year]],
   // [[Month]]: result.[[Month]], [[Day]]: result.[[Day]],
@@ -3707,7 +3710,7 @@ MaybeHandle<BigInt> ParseTemporalInstant(Isolate* isolate,
 
   // 3. Let offsetString be result.[[TimeZoneOffsetString]].
   // 4. Assert: offsetString is not undefined.
-  DCHECK(!result.offset_string->IsUndefined());
+  DCHECK(!IsUndefined(*result.offset_string));
 
   // 5. Let utc be ? GetEpochFromISOParts(result.[[Year]], result.[[Month]],
   // result.[[Day]], result.[[Hour]], result.[[Minute]], result.[[Second]],
@@ -3717,7 +3720,7 @@ MaybeHandle<BigInt> ParseTemporalInstant(Isolate* isolate,
 
   // 6. Let offsetNanoseconds be ? ParseTimeZoneOffsetString(offsetString).
   int64_t offset_nanoseconds;
-  DCHECK(result.offset_string->IsString());
+  DCHECK(IsString(*result.offset_string));
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, offset_nanoseconds,
       ParseTimeZoneOffsetString(isolate,
@@ -3947,8 +3950,8 @@ Maybe<TimeZoneRecord> ParseTemporalTimeZoneString(
   // 5. If timeZoneResult.[[Z]] is false, timeZoneResult.[[OffsetString]] is
   // undefined, and timeZoneResult.[[Name]] is undefined, throw a RangeError
   // exception.
-  if (!result.time_zone.z && result.time_zone.offset_string->IsUndefined() &&
-      result.time_zone.name->IsUndefined()) {
+  if (!result.time_zone.z && IsUndefined(*result.time_zone.offset_string) &&
+      IsUndefined(*result.time_zone.name)) {
     THROW_NEW_ERROR_RETURN_VALUE(isolate,
                                  NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(),
                                  Nothing<TimeZoneRecord>());
@@ -4036,11 +4039,11 @@ MaybeHandle<String> ParseTemporalCalendarString(Isolate* isolate,
     // a. Let calendar be parseResult.[[Value]].[[Calendar]].
     Handle<Object> calendar = parse_result.FromJust().calendar;
     // b. If calendar is undefined, return "iso8601".
-    if (calendar->IsUndefined()) {
+    if (IsUndefined(*calendar)) {
       return isolate->factory()->iso8601_string();
       // c. Else, return calendar.
     } else {
-      CHECK(calendar->IsString());
+      CHECK(IsString(*calendar));
       return Handle<String>::cast(calendar);
     }
     // 3. Else,
@@ -4101,13 +4104,13 @@ MaybeHandle<FixedArray> CalendarFields(Isolate* isolate,
   Handle<Object> fields;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, fields,
-      Object::GetMethod(calendar, isolate->factory()->fields_string()),
+      Object::GetMethod(isolate, calendar, isolate->factory()->fields_string()),
       FixedArray);
   // 2. Let fieldsArray be ! CreateArrayFromList(fieldNames).
   Handle<Object> fields_array =
       isolate->factory()->NewJSArrayWithElements(field_names);
   // 3. If fields is not undefined, then
-  if (!fields->IsUndefined()) {
+  if (!IsUndefined(*fields)) {
     // a. Set fieldsArray to ? Call(fields, calendar, « fieldsArray »).
     Handle<Object> argv[] = {fields_array};
     ASSIGN_RETURN_ON_EXCEPTION(
@@ -4122,7 +4125,7 @@ MaybeHandle<FixedArray> CalendarFields(Isolate* isolate,
                              isolate->string_fixed_array_from_iterable(),
                              fields_array, 1, argv),
       FixedArray);
-  DCHECK(fields_array->IsFixedArray());
+  DCHECK(IsFixedArray(*fields_array));
   return Handle<FixedArray>::cast(fields_array);
 }
 
@@ -4144,7 +4147,8 @@ MaybeHandle<JSTemporalPlainDate> CalendarDateAdd(Isolate* isolate,
   // 4. If dateAdd is not present, set dateAdd to ? GetMethod(calendar,
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, date_add,
-      Object::GetMethod(calendar, isolate->factory()->dateAdd_string()),
+      Object::GetMethod(isolate, calendar,
+                        isolate->factory()->dateAdd_string()),
       JSTemporalPlainDate);
   return CalendarDateAdd(isolate, calendar, date, duration, options, date_add);
 }
@@ -4153,7 +4157,7 @@ MaybeHandle<JSTemporalPlainDate> CalendarDateAdd(
     Isolate* isolate, Handle<JSReceiver> calendar, Handle<Object> date,
     Handle<Object> duration, Handle<Object> options, Handle<Object> date_add) {
   // 1. Assert: Type(options) is Object or Undefined.
-  DCHECK(options->IsJSReceiver() || options->IsUndefined());
+  DCHECK(IsJSReceiver(*options) || IsUndefined(*options));
 
   // 3. Let addedDate be ? Call(dateAdd, calendar, « date, duration, options »).
   Handle<Object> argv[] = {date, duration, options};
@@ -4163,7 +4167,7 @@ MaybeHandle<JSTemporalPlainDate> CalendarDateAdd(
       Execution::Call(isolate, date_add, calendar, arraysize(argv), argv),
       JSTemporalPlainDate);
   // 4. Perform ? RequireInternalSlot(addedDate, [[InitializedTemporalDate]]).
-  if (!added_date->IsJSTemporalPlainDate()) {
+  if (!IsJSTemporalPlainDate(*added_date)) {
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalPlainDate);
   }
@@ -4186,10 +4190,11 @@ MaybeHandle<JSTemporalDuration> CalendarDateUntil(
   // 1. Assert: Type(calendar) is Object.
   // 2. If dateUntil is not present, set dateUntil to ? GetMethod(calendar,
   // "dateUntil").
-  if (date_until->IsUndefined()) {
+  if (IsUndefined(*date_until)) {
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, date_until,
-        Object::GetMethod(calendar, isolate->factory()->dateUntil_string()),
+        Object::GetMethod(isolate, calendar,
+                          isolate->factory()->dateUntil_string()),
         JSTemporalDuration);
   }
   // 3. Let duration be ? Call(dateUntil, calendar, « one, two, options »).
@@ -4201,7 +4206,7 @@ MaybeHandle<JSTemporalDuration> CalendarDateUntil(
       JSTemporalDuration);
   // 4. Perform ? RequireInternalSlot(duration,
   // [[InitializedTemporalDuration]]).
-  if (!duration->IsJSTemporalDuration()) {
+  if (!IsJSTemporalDuration(*duration)) {
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalDuration);
   }
@@ -4230,7 +4235,7 @@ MaybeHandle<JSReceiver> DefaultMergeFields(
   for (int i = 0; i < original_keys->length(); i++) {
     // a. If nextKey is not "month" or "monthCode", then
     Handle<Object> next_key(original_keys->get(i), isolate);
-    DCHECK(next_key->IsString());
+    DCHECK(IsString(*next_key));
     Handle<String> next_key_string = Handle<String>::cast(next_key);
     if (!(String::Equals(isolate, factory->month_string(), next_key_string) ||
           String::Equals(isolate, factory->monthCode_string(),
@@ -4242,7 +4247,7 @@ MaybeHandle<JSReceiver> DefaultMergeFields(
           JSReceiver::GetPropertyOrElement(isolate, fields, next_key_string),
           JSReceiver);
       // ii. If propValue is not undefined, then
-      if (!prop_value->IsUndefined()) {
+      if (!IsUndefined(*prop_value)) {
         // 1. Perform ! CreateDataPropertyOrThrow(merged, nextKey,
         // propValue).
         CHECK(JSReceiver::CreateDataProperty(isolate, merged, next_key_string,
@@ -4263,7 +4268,7 @@ MaybeHandle<JSReceiver> DefaultMergeFields(
   // 5. For each element nextKey of newKeys, do
   for (int i = 0; i < new_keys->length(); i++) {
     Handle<Object> next_key(new_keys->get(i), isolate);
-    DCHECK(next_key->IsString());
+    DCHECK(IsString(*next_key));
     Handle<String> next_key_string = Handle<String>::cast(next_key);
     // a. Let propValue be ? Get(additionalFields, nextKey).
     Handle<Object> prop_value;
@@ -4272,7 +4277,7 @@ MaybeHandle<JSReceiver> DefaultMergeFields(
                                    isolate, additional_fields, next_key_string),
                                JSReceiver);
     // b. If propValue is not undefined, then
-    if (!prop_value->IsUndefined()) {
+    if (!IsUndefined(*prop_value)) {
       // 1. Perform ! CreateDataPropertyOrThrow(merged, nextKey, propValue).
       CHECK(JSReceiver::CreateDataProperty(isolate, merged, next_key_string,
                                            prop_value, Just(kDontThrow))
@@ -4291,7 +4296,7 @@ MaybeHandle<JSReceiver> DefaultMergeFields(
         JSReceiver::GetProperty(isolate, fields, factory->month_string()),
         JSReceiver);
     // b. If month is not undefined, then
-    if (!month->IsUndefined()) {
+    if (!IsUndefined(*month)) {
       // i. Perform ! CreateDataPropertyOrThrow(merged, "month", month).
       CHECK(JSReceiver::CreateDataProperty(isolate, merged,
                                            factory->month_string(), month,
@@ -4305,7 +4310,7 @@ MaybeHandle<JSReceiver> DefaultMergeFields(
         JSReceiver::GetProperty(isolate, fields, factory->monthCode_string()),
         JSReceiver);
     // d. If monthCode is not undefined, then
-    if (!month_code->IsUndefined()) {
+    if (!IsUndefined(*month_code)) {
       // i. Perform ! CreateDataPropertyOrThrow(merged, "monthCode", monthCode).
       CHECK(JSReceiver::CreateDataProperty(isolate, merged,
                                            factory->monthCode_string(),
@@ -4328,10 +4333,10 @@ Maybe<int64_t> GetOffsetNanosecondsFor(Isolate* isolate,
   Handle<Object> get_offset_nanoseconds_for;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, get_offset_nanoseconds_for,
-      Object::GetMethod(time_zone_obj,
+      Object::GetMethod(isolate, time_zone_obj,
                         isolate->factory()->getOffsetNanosecondsFor_string()),
       Nothing<int64_t>());
-  if (!get_offset_nanoseconds_for->IsCallable()) {
+  if (!IsCallable(*get_offset_nanoseconds_for)) {
     THROW_NEW_ERROR_RETURN_VALUE(
         isolate,
         NewTypeError(MessageTemplate::kCalledNonCallable,
@@ -4349,7 +4354,7 @@ Maybe<int64_t> GetOffsetNanosecondsFor(Isolate* isolate,
       Nothing<int64_t>());
 
   // 4. If Type(offsetNanoseconds) is not Number, throw a TypeError exception.
-  if (!offset_nanoseconds_obj->IsNumber()) {
+  if (!IsNumber(*offset_nanoseconds_obj)) {
     THROW_NEW_ERROR_RETURN_VALUE(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                                  Nothing<int64_t>());
   }
@@ -4360,7 +4365,7 @@ Maybe<int64_t> GetOffsetNanosecondsFor(Isolate* isolate,
     THROW_NEW_ERROR_RETURN_VALUE(
         isolate, NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(), Nothing<int64_t>());
   }
-  double offset_nanoseconds = offset_nanoseconds_obj->Number();
+  double offset_nanoseconds = Object::Number(*offset_nanoseconds_obj);
 
   // 6. Set offsetNanoseconds to ℝ(offsetNanoseconds).
   int64_t offset_nanoseconds_int = static_cast<int64_t>(offset_nanoseconds);
@@ -4398,12 +4403,12 @@ MaybeHandle<Object> InvokeCalendarMethod(Isolate* isolate,
                                          Handle<JSReceiver> date_like) {
   Handle<Object> result;
   /* 1. Assert: Type(calendar) is Object. */
-  DCHECK(calendar->IsObject());
+  DCHECK(calendar->TaggedImpl::IsObject());
   /* 2. Let result be ? Invoke(calendar, #name, « dateLike »). */
   Handle<Object> function;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, function, Object::GetProperty(isolate, calendar, name), Object);
-  if (!function->IsCallable()) {
+  if (!IsCallable(*function)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kCalledNonCallable, name),
                     Object);
@@ -4429,14 +4434,14 @@ MaybeHandle<Object> InvokeCalendarMethod(Isolate* isolate,
                              isolate->factory()->name##_string(), date_like), \
         Object);                                                              \
     /* 3. If result is undefined, throw a RangeError exception. */            \
-    if (result->IsUndefined()) {                                              \
+    if (IsUndefined(*result)) {                                               \
       THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(),        \
                       Object);                                                \
     }                                                                         \
     /* 4. Return ? Action(result). */                                         \
     ASSIGN_RETURN_ON_EXCEPTION(isolate, result, Action(isolate, result),      \
                                Object);                                       \
-    return handle(Smi::FromInt(result->Number()), isolate);                   \
+    return handle(Smi::FromInt(Object::Number(*result)), isolate);            \
   }
 
 #define CALENDAR_ABSTRACT_OPERATION(Name, property)                      \
@@ -4467,7 +4472,7 @@ MaybeHandle<Object> CalendarMonthCode(Isolate* isolate,
                            isolate->factory()->monthCode_string(), date_like),
       Object);
   /* 3. If result is undefined, throw a RangeError exception. */
-  if (result->IsUndefined()) {
+  if (IsUndefined(*result)) {
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(), Object);
   }
   // 4. Return ? ToString(result).
@@ -4488,7 +4493,7 @@ MaybeHandle<Object> CalendarEraYear(Isolate* isolate,
                            isolate->factory()->eraYear_string(), date_like),
       Object);
   // 3. If result is not undefined, set result to ? ToIntegerOrInfinity(result).
-  if (!result->IsUndefined()) {
+  if (!IsUndefined(*result)) {
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, result, ToIntegerThrowOnInfinity(isolate, result), Object);
   }
@@ -4508,7 +4513,7 @@ MaybeHandle<Object> CalendarEra(Isolate* isolate, Handle<JSReceiver> calendar,
                            date_like),
       Object);
   // 3. If result is not undefined, set result to ? ToString(result).
-  if (!result->IsUndefined()) {
+  if (!IsUndefined(*result)) {
     ASSIGN_RETURN_ON_EXCEPTION(isolate, result,
                                Object::ToString(isolate, result), Object);
   }
@@ -4706,7 +4711,7 @@ Maybe<TimeRecord> ToTemporalTimeRecordOrPartialTime(
         JSReceiver::GetProperty(isolate, temporal_time_like, row.first),
         Nothing<TimeRecord>());
     // c. If value is not undefined, then
-    if (!value->IsUndefined()) {
+    if (!IsUndefined(*value)) {
       // i. Set _any_ to *true*.
       any = true;
       // If it is inside ToPartialTime, we only continue if it is not undefined.
@@ -4719,7 +4724,7 @@ Maybe<TimeRecord> ToTemporalTimeRecordOrPartialTime(
                                      Nothing<TimeRecord>());
     // e. / iii. Set result's internal slot whose name is the Internal Slot
     // value of the current row to value.
-    *(row.second) = value->Number();
+    *(row.second) = Object::Number(*value);
   }
 
   // 5. If _any_ is *false*, then
@@ -4937,7 +4942,7 @@ MaybeHandle<Object> ToIntegerThrowOnInfinity(Isolate* isolate,
   ASSIGN_RETURN_ON_EXCEPTION(isolate, argument,
                              Object::ToInteger(isolate, argument), Object);
   // 2. If integer is +∞ or -∞, throw a RangeError exception.
-  if (!std::isfinite(argument->Number())) {
+  if (!std::isfinite(Object::Number(*argument))) {
     // a. Throw a RangeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(), Object);
   }
@@ -5178,7 +5183,7 @@ Maybe<BalancePossiblyInfiniteDurationResult> BalancePossiblyInfiniteDuration(
 
   // 2. If Type(relativeTo) is Object and relativeTo has an
   // [[InitializedTemporalZonedDateTime]] internal slot, then
-  if (relative_to_obj->IsJSTemporalZonedDateTime()) {
+  if (IsJSTemporalZonedDateTime(*relative_to_obj)) {
     Handle<JSTemporalZonedDateTime> relative_to =
         Handle<JSTemporalZonedDateTime>::cast(relative_to_obj);
     // a. Let endNs be ? AddZonedDateTime(relativeTo.[[Nanoseconds]],
@@ -5377,12 +5382,15 @@ Maybe<BalancePossiblyInfiniteDurationResult> BalancePossiblyInfiniteDuration(
   // 1. Return positive overflow.
   // ii. Else if sign = -1, then
   // 1. Return negative overflow.
-  double hours_value = BigInt::ToNumber(isolate, hours)->Number();
-  double minutes_value = BigInt::ToNumber(isolate, minutes)->Number();
-  double seconds_value = BigInt::ToNumber(isolate, seconds)->Number();
-  double milliseconds_value = BigInt::ToNumber(isolate, milliseconds)->Number();
-  double microseconds_value = BigInt::ToNumber(isolate, microseconds)->Number();
-  double nanoseconds_value = BigInt::ToNumber(isolate, nanoseconds)->Number();
+  double hours_value = Object::Number(*BigInt::ToNumber(isolate, hours));
+  double minutes_value = Object::Number(*BigInt::ToNumber(isolate, minutes));
+  double seconds_value = Object::Number(*BigInt::ToNumber(isolate, seconds));
+  double milliseconds_value =
+      Object::Number(*BigInt::ToNumber(isolate, milliseconds));
+  double microseconds_value =
+      Object::Number(*BigInt::ToNumber(isolate, microseconds));
+  double nanoseconds_value =
+      Object::Number(*BigInt::ToNumber(isolate, nanoseconds));
   if (std::isinf(days) || std::isinf(hours_value) ||
       std::isinf(minutes_value) || std::isinf(seconds_value) ||
       std::isinf(milliseconds_value) || std::isinf(microseconds_value) ||
@@ -5545,7 +5553,7 @@ Maybe<NanosecondsToDaysResult> NanosecondsToDays(Isolate* isolate,
 
   // 4. If Type(relativeTo) is not Object or relativeTo does not have an
   // [[InitializedTemporalZonedDateTime]] internal slot, then
-  if (!relative_to_obj->IsJSTemporalZonedDateTime()) {
+  if (!IsJSTemporalZonedDateTime(*relative_to_obj)) {
     // a. Return the Record { [[Days]]: RoundTowardsZero(nanoseconds /
     // dayLengthNs), [[Nanoseconds]]: (abs(nanoseconds) modulo dayLengthNs) ×
     // sign, [[DayLength]]: dayLengthNs }.
@@ -5566,8 +5574,9 @@ Maybe<NanosecondsToDaysResult> NanosecondsToDays(Isolate* isolate,
       nanoseconds = BigInt::UnaryMinus(isolate, nanoseconds);
     }
     return Just(NanosecondsToDaysResult(
-        {BigInt::ToNumber(isolate, days_bigint)->Number(),
-         BigInt::ToNumber(isolate, nanoseconds)->Number(), kDayLengthNs}));
+        {Object::Number(*BigInt::ToNumber(isolate, days_bigint)),
+         Object::Number(*BigInt::ToNumber(isolate, nanoseconds)),
+         kDayLengthNs}));
   }
   Handle<JSTemporalZonedDateTime> relative_to =
       Handle<JSTemporalZonedDateTime>::cast(relative_to_obj);
@@ -5733,7 +5742,7 @@ Maybe<NanosecondsToDaysResult> NanosecondsToDays(Isolate* isolate,
   // 20. Return the new Record { [[Days]]: days, [[Nanoseconds]]: nanoseconds,
   // [[DayLength]]: abs(dayLengthNs) }.
   NanosecondsToDaysResult result(
-      {days, BigInt::ToNumber(isolate, nanoseconds)->Number(),
+      {days, Object::Number(*BigInt::ToNumber(isolate, nanoseconds)),
        std::abs(day_length_ns->AsInt64())});
   return Just(result);
 }
@@ -5816,7 +5825,7 @@ Maybe<DurationRecord> DifferenceISODateTime(
   // timeDifference.[[Microseconds]], timeDifference.[[Nanoseconds]],
   // largestUnit).
 
-  time_difference.days = date_difference->days().Number();
+  time_difference.days = Object::Number(date_difference->days());
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, time_difference,
       BalanceDuration(isolate, largest_unit, time_difference, method_name),
@@ -5828,11 +5837,12 @@ Maybe<DurationRecord> DifferenceISODateTime(
   // balanceResult.[[Seconds]], balanceResult.[[Milliseconds]],
   // balanceResult.[[Microseconds]], balanceResult.[[Nanoseconds]]).
 
-  return Just(CreateDurationRecord(
-                  isolate, {date_difference->years().Number(),
-                            date_difference->months().Number(),
-                            date_difference->weeks().Number(), time_difference})
-                  .ToChecked());
+  return Just(
+      CreateDurationRecord(
+          isolate, {Object::Number(date_difference->years()),
+                    Object::Number(date_difference->months()),
+                    Object::Number(date_difference->weeks()), time_difference})
+          .ToChecked());
 }
 
 // #sec-temporal-addinstant
@@ -6405,8 +6415,9 @@ Maybe<DateRecord> ISOMonthDayFromFields(Isolate* isolate,
           .ToHandleChecked();
   // 7. If month is not undefined, and monthCode and year are both undefined,
   // then
-  if (!month_obj->IsUndefined(isolate) &&
-      month_code_obj->IsUndefined(isolate) && year_obj->IsUndefined(isolate)) {
+  if (!IsUndefined(*month_obj, isolate) &&
+      IsUndefined(*month_code_obj, isolate) &&
+      IsUndefined(*year_obj, isolate)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR_RETURN_VALUE(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                                  Nothing<DateRecord>());
@@ -6425,14 +6436,14 @@ Maybe<DateRecord> ISOMonthDayFromFields(Isolate* isolate,
   // Note: "day" in fields is always converted by
   // ToIntegerThrowOnInfinity inside the PrepareTemporalFields above.
   // Therefore the day_obj is always an integer.
-  DCHECK(day_obj->IsSmi() || day_obj->IsHeapNumber());
-  result.day = FastD2I(floor(day_obj->Number()));
+  DCHECK(IsSmi(*day_obj) || IsHeapNumber(*day_obj));
+  result.day = FastD2I(floor(Object::Number(*day_obj)));
   // 11. Let referenceISOYear be 1972 (the first leap year after the Unix
   // epoch).
   int32_t reference_iso_year = 1972;
   // 12. If monthCode is undefined, then
-  if (month_code_obj->IsUndefined(isolate)) {
-    result.year = FastD2I(floor(year_obj->Number()));
+  if (IsUndefined(*month_code_obj, isolate)) {
+    result.year = FastD2I(floor(Object::Number(*year_obj)));
     // a. Let result be ? RegulateISODate(year, month, day, overflow).
   } else {
     // 13. Else,
@@ -6460,7 +6471,7 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::Constructor(
     Handle<Object> microseconds, Handle<Object> nanoseconds) {
   const char* method_name = "Temporal.Duration";
   // 1. If NewTarget is undefined, then
-  if (new_target->IsUndefined()) {
+  if (IsUndefined(*new_target)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
@@ -6580,7 +6591,7 @@ Maybe<DurationRecord> AdjustRoundedDurationDays(Isolate* isolate,
   // [[InitializedTemporalZonedDateTime]] internal slot; or unit is one of
   // "year", "month", "week", or "day"; or unit is "nanosecond" and increment is
   // 1, then
-  if (!relative_to_obj->IsJSTemporalZonedDateTime() ||
+  if (!IsJSTemporalZonedDateTime(*relative_to_obj) ||
       (unit == Unit::kYear || unit == Unit::kMonth || unit == Unit::kWeek ||
        unit == Unit::kDay) ||
       (unit == Unit::kNanosecond && increment == 1)) {
@@ -6700,7 +6711,7 @@ Maybe<int64_t> CalculateOffsetShift(Isolate* isolate,
 
   // 1. If Type(relativeTo) is not Object or relativeTo does not have an
   // [[InitializedTemporalZonedDateTime]] internal slot, return 0.
-  if (!relative_to_obj->IsJSTemporalZonedDateTime()) {
+  if (!IsJSTemporalZonedDateTime(*relative_to_obj)) {
     return Just(static_cast<int64_t>(0));
   }
   Handle<JSTemporalZonedDateTime> relative_to =
@@ -6799,7 +6810,7 @@ Maybe<DateDurationRecord> UnbalanceDurationRelative(
   // 7. If relativeTo is not undefined, then
   Handle<JSTemporalPlainDate> relative_to;
   Handle<JSReceiver> calendar;
-  if (!relative_to_obj->IsUndefined()) {
+  if (!IsUndefined(*relative_to_obj)) {
     // a. Set relativeTo to ? ToTemporalDate(relativeTo).
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, relative_to,
@@ -6825,13 +6836,13 @@ Maybe<DateDurationRecord> UnbalanceDurationRelative(
     Handle<Object> date_add;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, date_add,
-        Object::GetMethod(calendar, factory->dateAdd_string()),
+        Object::GetMethod(isolate, calendar, factory->dateAdd_string()),
         Nothing<DateDurationRecord>());
     // c. Let dateUntil be ? GetMethod(calendar, "dateUntil").
     Handle<Object> date_until;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, date_until,
-        Object::GetMethod(calendar, factory->dateUntil_string()),
+        Object::GetMethod(isolate, calendar, factory->dateUntil_string()),
         Nothing<DateDurationRecord>());
     // d. Repeat, while years ≠ 0,
     while (result.years != 0) {
@@ -6860,7 +6871,7 @@ Maybe<DateDurationRecord> UnbalanceDurationRelative(
                             until_options, date_until),
           Nothing<DateDurationRecord>());
       // v. Let oneYearMonths be untilResult.[[Months]].
-      double one_year_months = until_result->months().Number();
+      double one_year_months = Object::Number(until_result->months());
       // vi. Set relativeTo to newRelativeTo.
       relative_to = new_relative_to;
       // vii. Set years to years − sign.
@@ -6998,7 +7009,7 @@ Maybe<DateDurationRecord> BalanceDurationRelative(
                     .ToChecked());
   }
   // 2. If relativeTo is undefined, then
-  if (relative_to_obj->IsUndefined()) {
+  if (IsUndefined(*relative_to_obj)) {
     // a. Throw a RangeError exception.
     THROW_NEW_ERROR_RETURN_VALUE(isolate,
                                  NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(),
@@ -7104,7 +7115,7 @@ Maybe<DateDurationRecord> BalanceDurationRelative(
     Handle<Object> date_add;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, date_add,
-        Object::GetMethod(calendar, factory->dateAdd_string()),
+        Object::GetMethod(isolate, calendar, factory->dateAdd_string()),
         Nothing<DateDurationRecord>());
     // j. Set newRelativeTo be ? CalendarDateAdd(calendar, relativeTo, oneYear,
     // undefined, dateAdd).
@@ -7117,7 +7128,7 @@ Maybe<DateDurationRecord> BalanceDurationRelative(
     Handle<Object> date_until;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, date_until,
-        Object::GetMethod(calendar, factory->dateUntil_string()),
+        Object::GetMethod(isolate, calendar, factory->dateUntil_string()),
         Nothing<DateDurationRecord>());
     // l. Let untilOptions be OrdinaryObjectCreate(null).
     Handle<JSObject> until_options = factory->NewJSObjectWithNullProto();
@@ -7136,7 +7147,7 @@ Maybe<DateDurationRecord> BalanceDurationRelative(
                           until_options, date_until),
         Nothing<DateDurationRecord>());
     // o. Let oneYearMonths be untilResult.[[Months]].
-    double one_year_months = until_result->months().Number();
+    double one_year_months = Object::Number(until_result->months());
     // p. Repeat, while abs(months) ≥ abs(oneYearMonths),
     while (std::abs(result.months) >= std::abs(one_year_months)) {
       // i. Set months to months - oneYearMonths.
@@ -7168,7 +7179,7 @@ Maybe<DateDurationRecord> BalanceDurationRelative(
                             until_options, date_until),
           Nothing<DateDurationRecord>());
       // viii. Set oneYearMonths to untilResult.[[Months]].
-      one_year_months = until_result->months().Number();
+      one_year_months = Object::Number(until_result->months());
     }
     // 11. Else if largestUnit is "month", then
   } else if (largest_unit == Unit::kMonth) {
@@ -7276,27 +7287,30 @@ MaybeHandle<Smi> JSTemporalDuration::Compare(Isolate* isolate,
   int64_t shift1;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, shift1,
-      CalculateOffsetShift(isolate, relative_to,
-                           {one->years().Number(), one->months().Number(),
-                            one->weeks().Number(), one->days().Number()},
-                           method_name),
+      CalculateOffsetShift(
+          isolate, relative_to,
+          {Object::Number(one->years()), Object::Number(one->months()),
+           Object::Number(one->weeks()), Object::Number(one->days())},
+          method_name),
       Handle<Smi>());
   // 6. Let shift2 be ? CalculateOffsetShift(relativeTo, two.[[Years]],
   // two.[[Months]], two.[[Weeks]], two.[[Days]]).
   int64_t shift2;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, shift2,
-      CalculateOffsetShift(isolate, relative_to,
-                           {two->years().Number(), two->months().Number(),
-                            two->weeks().Number(), two->days().Number()},
-                           method_name),
+      CalculateOffsetShift(
+          isolate, relative_to,
+          {Object::Number(two->years()), Object::Number(two->months()),
+           Object::Number(two->weeks()), Object::Number(two->days())},
+          method_name),
       Handle<Smi>());
   // 7. If any of one.[[Years]], two.[[Years]], one.[[Months]], two.[[Months]],
   // one.[[Weeks]], or two.[[Weeks]] are not 0, then
   double days1, days2;
-  if (one->years().Number() != 0 || two->years().Number() != 0 ||
-      one->months().Number() != 0 || two->months().Number() != 0 ||
-      one->weeks().Number() != 0 || two->weeks().Number() != 0) {
+  if (Object::Number(one->years()) != 0 || Object::Number(two->years()) != 0 ||
+      Object::Number(one->months()) != 0 ||
+      Object::Number(two->months()) != 0 || Object::Number(one->weeks()) != 0 ||
+      Object::Number(two->weeks()) != 0) {
     // a. Let unbalanceResult1 be ? UnbalanceDurationRelative(one.[[Years]],
     // one.[[Months]], one.[[Weeks]], one.[[Days]], "day", relativeTo).
     DateDurationRecord unbalance_result1;
@@ -7304,8 +7318,8 @@ MaybeHandle<Smi> JSTemporalDuration::Compare(Isolate* isolate,
         isolate, unbalance_result1,
         UnbalanceDurationRelative(
             isolate,
-            {one->years().Number(), one->months().Number(),
-             one->weeks().Number(), one->days().Number()},
+            {Object::Number(one->years()), Object::Number(one->months()),
+             Object::Number(one->weeks()), Object::Number(one->days())},
             Unit::kDay, relative_to, method_name),
         Handle<Smi>());
     // b. Let unbalanceResult2 be ? UnbalanceDurationRelative(two.[[Years]],
@@ -7315,8 +7329,8 @@ MaybeHandle<Smi> JSTemporalDuration::Compare(Isolate* isolate,
         isolate, unbalance_result2,
         UnbalanceDurationRelative(
             isolate,
-            {two->years().Number(), two->months().Number(),
-             two->weeks().Number(), two->days().Number()},
+            {Object::Number(two->years()), Object::Number(two->months()),
+             Object::Number(two->weeks()), Object::Number(two->days())},
             Unit::kDay, relative_to, method_name),
         Handle<Smi>());
     // c. Let days1 be unbalanceResult1.[[Days]].
@@ -7326,27 +7340,27 @@ MaybeHandle<Smi> JSTemporalDuration::Compare(Isolate* isolate,
     // 8. Else,
   } else {
     // a. Let days1 be one.[[Days]].
-    days1 = one->days().Number();
+    days1 = Object::Number(one->days());
     // b. Let days2 be two.[[Days]].
-    days2 = two->days().Number();
+    days2 = Object::Number(two->days());
   }
   // 9. Let ns1 be ! TotalDurationNanoseconds(days1, one.[[Hours]],
   // one.[[Minutes]], one.[[Seconds]], one.[[Milliseconds]],
   // one.[[Microseconds]], one.[[Nanoseconds]], shift1).
   Handle<BigInt> ns1 = TotalDurationNanoseconds(
       isolate,
-      {days1, one->hours().Number(), one->minutes().Number(),
-       one->seconds().Number(), one->milliseconds().Number(),
-       one->microseconds().Number(), one->nanoseconds().Number()},
+      {days1, Object::Number(one->hours()), Object::Number(one->minutes()),
+       Object::Number(one->seconds()), Object::Number(one->milliseconds()),
+       Object::Number(one->microseconds()), Object::Number(one->nanoseconds())},
       shift1);
   // 10. Let ns2 be ! TotalDurationNanoseconds(days2, two.[[Hours]],
   // two.[[Minutes]], two.[[Seconds]], two.[[Milliseconds]],
   // two.[[Microseconds]], two.[[Nanoseconds]], shift2).
   Handle<BigInt> ns2 = TotalDurationNanoseconds(
       isolate,
-      {days2, two->hours().Number(), two->minutes().Number(),
-       two->seconds().Number(), two->milliseconds().Number(),
-       two->microseconds().Number(), two->nanoseconds().Number()},
+      {days2, Object::Number(two->hours()), Object::Number(two->minutes()),
+       Object::Number(two->seconds()), Object::Number(two->milliseconds()),
+       Object::Number(two->microseconds()), Object::Number(two->nanoseconds())},
       shift2);
   switch (BigInt::CompareToBigInt(ns1, ns2)) {
     // 11. If ns1 > ns2, return 1𝔽.
@@ -7366,7 +7380,7 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::From(Isolate* isolate,
                                                          Handle<Object> item) {
   //  1. If Type(item) is Object and item has an [[InitializedTemporalDuration]]
   //  internal slot, then
-  if (item->IsJSTemporalDuration()) {
+  if (IsJSTemporalDuration(*item)) {
     // a. Return ? CreateTemporalDuration(item.[[Years]], item.[[Months]],
     // item.[[Weeks]], item.[[Days]], item.[[Hours]], item.[[Minutes]],
     // item.[[Seconds]], item.[[Milliseconds]], item.[[Microseconds]],
@@ -7375,13 +7389,15 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::From(Isolate* isolate,
         Handle<JSTemporalDuration>::cast(item);
     return CreateTemporalDuration(
         isolate,
-        {duration->years().Number(),
-         duration->months().Number(),
-         duration->weeks().Number(),
-         {duration->days().Number(), duration->hours().Number(),
-          duration->minutes().Number(), duration->seconds().Number(),
-          duration->milliseconds().Number(), duration->microseconds().Number(),
-          duration->nanoseconds().Number()}});
+        {Object::Number(duration->years()),
+         Object::Number(duration->months()),
+         Object::Number(duration->weeks()),
+         {Object::Number(duration->days()), Object::Number(duration->hours()),
+          Object::Number(duration->minutes()),
+          Object::Number(duration->seconds()),
+          Object::Number(duration->milliseconds()),
+          Object::Number(duration->microseconds()),
+          Object::Number(duration->nanoseconds())}});
   }
   // 2. Return ? ToTemporalDuration(item).
   return temporal::ToTemporalDuration(isolate, item, "Temporal.Duration.from");
@@ -7425,14 +7441,14 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::Round(
   // 2. Perform ? RequireInternalSlot(duration,
   // [[InitializedTemporalDuration]]).
   // 3. If roundTo is undefined, then
-  if (round_to_obj->IsUndefined()) {
+  if (IsUndefined(*round_to_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalDuration);
   }
   Handle<JSReceiver> round_to;
   // 4. If Type(roundTo) is String, then
-  if (round_to_obj->IsString()) {
+  if (IsString(*round_to_obj)) {
     // a. Let paramString be roundTo.
     Handle<String> param_string = Handle<String>::cast(round_to_obj);
     // b. Set roundTo to ! OrdinaryObjectCreate(null).
@@ -7474,13 +7490,15 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::Round(
   // duration.[[Minutes]], duration.[[Seconds]], duration.[[Milliseconds]],
   // duration.[[Microseconds]]).
   Unit default_largest_unit = DefaultTemporalLargestUnit(
-      {duration->years().Number(),
-       duration->months().Number(),
-       duration->weeks().Number(),
-       {duration->days().Number(), duration->hours().Number(),
-        duration->minutes().Number(), duration->seconds().Number(),
-        duration->milliseconds().Number(), duration->microseconds().Number(),
-        duration->nanoseconds().Number()}});
+      {Object::Number(duration->years()),
+       Object::Number(duration->months()),
+       Object::Number(duration->weeks()),
+       {Object::Number(duration->days()), Object::Number(duration->hours()),
+        Object::Number(duration->minutes()),
+        Object::Number(duration->seconds()),
+        Object::Number(duration->milliseconds()),
+        Object::Number(duration->microseconds()),
+        Object::Number(duration->nanoseconds())}});
 
   // 11. Set defaultLargestUnit to !
   // LargerOfTwoTemporalUnits(defaultLargestUnit, smallestUnit).
@@ -7550,8 +7568,9 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::Round(
       isolate, unbalance_result,
       UnbalanceDurationRelative(
           isolate,
-          {duration->years().Number(), duration->months().Number(),
-           duration->weeks().Number(), duration->days().Number()},
+          {Object::Number(duration->years()),
+           Object::Number(duration->months()),
+           Object::Number(duration->weeks()), Object::Number(duration->days())},
           largest_unit, relative_to, method_name),
       Handle<JSTemporalDuration>());
   // 22. Let roundResult be (? RoundDuration(unbalanceResult.[[Years]],
@@ -7563,18 +7582,18 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::Round(
   DurationRecordWithRemainder round_result;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, round_result,
-      RoundDuration(
-          isolate,
-          {unbalance_result.years,
-           unbalance_result.months,
-           unbalance_result.weeks,
-           {unbalance_result.days, duration->hours().Number(),
-            duration->minutes().Number(), duration->seconds().Number(),
-            duration->milliseconds().Number(),
-            duration->microseconds().Number(),
-            duration->nanoseconds().Number()}},
-          rounding_increment, smallest_unit, rounding_mode, relative_to,
-          method_name),
+      RoundDuration(isolate,
+                    {unbalance_result.years,
+                     unbalance_result.months,
+                     unbalance_result.weeks,
+                     {unbalance_result.days, Object::Number(duration->hours()),
+                      Object::Number(duration->minutes()),
+                      Object::Number(duration->seconds()),
+                      Object::Number(duration->milliseconds()),
+                      Object::Number(duration->microseconds()),
+                      Object::Number(duration->nanoseconds())}},
+                    rounding_increment, smallest_unit, rounding_mode,
+                    relative_to, method_name),
       Handle<JSTemporalDuration>());
 
   // 23. Let adjustResult be ? AdjustRoundedDurationDays(roundResult.[[Years]],
@@ -7604,7 +7623,7 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::Round(
       Handle<JSTemporalDuration>());
   // 25. If Type(relativeTo) is Object and relativeTo has an
   // [[InitializedTemporalZonedDateTime]] internal slot, then
-  if (relative_to->IsJSTemporalZonedDateTime()) {
+  if (IsJSTemporalZonedDateTime(*relative_to)) {
     // a. Set relativeTo to ? MoveRelativeZonedDateTime(relativeTo,
     // balanceResult.[[Years]], balanceResult.[[Months]],
     // balanceResult.[[Weeks]], 0).
@@ -7653,13 +7672,13 @@ MaybeHandle<Object> JSTemporalDuration::Total(
   // 2. Perform ? RequireInternalSlot(duration,
   // [[InitializedTemporalDuration]]).
   // 3. If totalOf is undefined, throw a TypeError exception.
-  if (total_of_obj->IsUndefined(isolate)) {
+  if (IsUndefined(*total_of_obj, isolate)) {
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(), Object);
   }
 
   Handle<JSReceiver> total_of;
   // 4. If Type(totalOf) is String, then
-  if (total_of_obj->IsString()) {
+  if (IsString(*total_of_obj)) {
     // a. Let paramString be totalOf.
     Handle<String> param_string = Handle<String>::cast(total_of_obj);
     // b. Set totalOf to ! OrdinaryObjectCreate(null).
@@ -7696,8 +7715,9 @@ MaybeHandle<Object> JSTemporalDuration::Total(
       isolate, unbalance_result,
       UnbalanceDurationRelative(
           isolate,
-          {duration->years().Number(), duration->months().Number(),
-           duration->weeks().Number(), duration->days().Number()},
+          {Object::Number(duration->years()),
+           Object::Number(duration->months()),
+           Object::Number(duration->weeks()), Object::Number(duration->days())},
           unit, relative_to, method_name),
       Handle<Object>());
 
@@ -7706,7 +7726,7 @@ MaybeHandle<Object> JSTemporalDuration::Total(
 
   // 8. If relativeTo has an [[InitializedTemporalZonedDateTime]] internal slot,
   // then
-  if (relative_to->IsJSTemporalZonedDateTime()) {
+  if (IsJSTemporalZonedDateTime(*relative_to)) {
     // a. Set intermediate to ? MoveRelativeZonedDateTime(relativeTo,
     // unbalanceResult.[[Years]], unbalanceResult.[[Months]],
     // unbalanceResult.[[Weeks]], 0).
@@ -7730,10 +7750,12 @@ MaybeHandle<Object> JSTemporalDuration::Total(
       isolate, balance_result,
       BalancePossiblyInfiniteDuration(
           isolate, unit, intermediate,
-          {unbalance_result.days, duration->hours().Number(),
-           duration->minutes().Number(), duration->seconds().Number(),
-           duration->milliseconds().Number(), duration->microseconds().Number(),
-           duration->nanoseconds().Number()},
+          {unbalance_result.days, Object::Number(duration->hours()),
+           Object::Number(duration->minutes()),
+           Object::Number(duration->seconds()),
+           Object::Number(duration->milliseconds()),
+           Object::Number(duration->microseconds()),
+           Object::Number(duration->nanoseconds())},
           method_name),
       Handle<Object>());
   // 12. If balanceResult is positive overflow, return +∞𝔽.
@@ -7828,7 +7850,7 @@ Maybe<DurationRecord> ToPartialDuration(
     Isolate* isolate, Handle<Object> temporal_duration_like_obj,
     const DurationRecord& input) {
   // 1. If Type(temporalDurationLike) is not Object, then
-  if (!temporal_duration_like_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*temporal_duration_like_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR_RETURN_VALUE(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                                  Nothing<DurationRecord>());
@@ -7861,7 +7883,7 @@ Maybe<DurationRecord> ToPartialDuration(
                 JSReceiver::GetProperty(isolate, temporal_duration_like, prop),
                 Nothing<bool>());
             // c. If val is not undefined, then
-            if (!val->IsUndefined()) {
+            if (!IsUndefined(*val)) {
               // i. Set any to true.
               not_undefined = true;
               // ii. Let val be 𝔽(? ToIntegerWithoutRounding(val)).
@@ -7897,14 +7919,15 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::With(
       isolate, partial,
       temporal::ToPartialDuration(
           isolate, temporal_duration_like,
-          {duration->years().Number(),
-           duration->months().Number(),
-           duration->weeks().Number(),
-           {duration->days().Number(), duration->hours().Number(),
-            duration->minutes().Number(), duration->seconds().Number(),
-            duration->milliseconds().Number(),
-            duration->microseconds().Number(),
-            duration->nanoseconds().Number()}}),
+          {Object::Number(duration->years()),
+           Object::Number(duration->months()),
+           Object::Number(duration->weeks()),
+           {Object::Number(duration->days()), Object::Number(duration->hours()),
+            Object::Number(duration->minutes()),
+            Object::Number(duration->seconds()),
+            Object::Number(duration->milliseconds()),
+            Object::Number(duration->microseconds()),
+            Object::Number(duration->nanoseconds())}}),
       Handle<JSTemporalDuration>());
 
   // 24. Return ? CreateTemporalDuration(years, months, weeks, days, hours,
@@ -7922,17 +7945,18 @@ MaybeHandle<Smi> JSTemporalDuration::Sign(Isolate* isolate,
   // duration.[[Weeks]], duration.[[Days]], duration.[[Hours]],
   // duration.[[Minutes]], duration.[[Seconds]], duration.[[Milliseconds]],
   // duration.[[Microseconds]], duration.[[Nanoseconds]]).
-  return handle(
-      Smi::FromInt(DurationSign(
-          isolate, {duration->years().Number(),
-                    duration->months().Number(),
-                    duration->weeks().Number(),
-                    {duration->days().Number(), duration->hours().Number(),
-                     duration->minutes().Number(), duration->seconds().Number(),
-                     duration->milliseconds().Number(),
-                     duration->microseconds().Number(),
-                     duration->nanoseconds().Number()}})),
-      isolate);
+  return handle(Smi::FromInt(DurationSign(
+                    isolate, {Object::Number(duration->years()),
+                              Object::Number(duration->months()),
+                              Object::Number(duration->weeks()),
+                              {Object::Number(duration->days()),
+                               Object::Number(duration->hours()),
+                               Object::Number(duration->minutes()),
+                               Object::Number(duration->seconds()),
+                               Object::Number(duration->milliseconds()),
+                               Object::Number(duration->microseconds()),
+                               Object::Number(duration->nanoseconds())}})),
+                isolate);
 }
 
 // #sec-get-temporal.duration.prototype.blank
@@ -7949,15 +7973,16 @@ MaybeHandle<Oddball> JSTemporalDuration::Blank(
   // 5. Return false.
   int32_t sign = DurationSign(
       isolate,
-      {duration->years().Number(),
-       duration->months().Number(),
-       duration->weeks().Number(),
-       {duration->days().Number(), duration->hours().Number(),
-        duration->minutes().Number(), duration->seconds().Number(),
-        duration->milliseconds().Number(), duration->microseconds().Number(),
-        duration->nanoseconds().Number()}});
-  return sign == 0 ? isolate->factory()->true_value()
-                   : isolate->factory()->false_value();
+      {Object::Number(duration->years()),
+       Object::Number(duration->months()),
+       Object::Number(duration->weeks()),
+       {Object::Number(duration->days()), Object::Number(duration->hours()),
+        Object::Number(duration->minutes()),
+        Object::Number(duration->seconds()),
+        Object::Number(duration->milliseconds()),
+        Object::Number(duration->microseconds()),
+        Object::Number(duration->nanoseconds())}});
+  return isolate->factory()->ToBoolean(sign == 0);
 }
 
 namespace {
@@ -7988,16 +8013,17 @@ MaybeHandle<JSTemporalDuration> CreateNegatedTemporalDuration(
   // −duration.[[Hours]], −duration.[[Minutes]], −duration.[[Seconds]],
   // −duration.[[Milliseconds]], −duration.[[Microseconds]],
   // −duration.[[Nanoseconds]]).
-  return CreateTemporalDuration(
-             isolate,
-             {-duration->years().Number(),
-              -duration->months().Number(),
-              -duration->weeks().Number(),
-              {-duration->days().Number(), -duration->hours().Number(),
-               -duration->minutes().Number(), -duration->seconds().Number(),
-               -duration->milliseconds().Number(),
-               -duration->microseconds().Number(),
-               -duration->nanoseconds().Number()}})
+  return CreateTemporalDuration(isolate,
+                                {-Object::Number(duration->years()),
+                                 -Object::Number(duration->months()),
+                                 -Object::Number(duration->weeks()),
+                                 {-Object::Number(duration->days()),
+                                  -Object::Number(duration->hours()),
+                                  -Object::Number(duration->minutes()),
+                                  -Object::Number(duration->seconds()),
+                                  -Object::Number(duration->milliseconds()),
+                                  -Object::Number(duration->microseconds()),
+                                  -Object::Number(duration->nanoseconds())}})
       .ToHandleChecked();
 }
 
@@ -8025,17 +8051,17 @@ MaybeHandle<JSTemporalDuration> JSTemporalDuration::Abs(
   // abs(duration.[[Hours]]), abs(duration.[[Minutes]]),
   // abs(duration.[[Seconds]]), abs(duration.[[Milliseconds]]),
   // abs(duration.[[Microseconds]]), abs(duration.[[Nanoseconds]])).
-  return CreateTemporalDuration(isolate,
-                                {std::abs(duration->years().Number()),
-                                 std::abs(duration->months().Number()),
-                                 std::abs(duration->weeks().Number()),
-                                 {std::abs(duration->days().Number()),
-                                  std::abs(duration->hours().Number()),
-                                  std::abs(duration->minutes().Number()),
-                                  std::abs(duration->seconds().Number()),
-                                  std::abs(duration->milliseconds().Number()),
-                                  std::abs(duration->microseconds().Number()),
-                                  std::abs(duration->nanoseconds().Number())}});
+  return CreateTemporalDuration(
+      isolate, {std::abs(Object::Number(duration->years())),
+                std::abs(Object::Number(duration->months())),
+                std::abs(Object::Number(duration->weeks())),
+                {std::abs(Object::Number(duration->days())),
+                 std::abs(Object::Number(duration->hours())),
+                 std::abs(Object::Number(duration->minutes())),
+                 std::abs(Object::Number(duration->seconds())),
+                 std::abs(Object::Number(duration->milliseconds())),
+                 std::abs(Object::Number(duration->microseconds())),
+                 std::abs(Object::Number(duration->nanoseconds()))}});
 }
 
 namespace {
@@ -8068,7 +8094,7 @@ MaybeHandle<Object> ToRelativeTemporalObject(Isolate* isolate,
       JSReceiver::GetProperty(isolate, options, factory->relativeTo_string()),
       Object);
   // 3. If value is undefined, then
-  if (value_obj->IsUndefined()) {
+  if (IsUndefined(*value_obj)) {
     // a. Return value.
     return value_obj;
   }
@@ -8083,16 +8109,16 @@ MaybeHandle<Object> ToRelativeTemporalObject(Isolate* isolate,
   temporal::DateTimeRecord result;
   Handle<JSReceiver> calendar;
   // 6. If Type(value) is Object, then
-  if (value_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*value_obj)) {
     Handle<JSReceiver> value = Handle<JSReceiver>::cast(value_obj);
     // a. If value has either an [[InitializedTemporalDate]] or
     // [[InitializedTemporalZonedDateTime]] internal slot, then
-    if (value->IsJSTemporalPlainDate() || value->IsJSTemporalZonedDateTime()) {
+    if (IsJSTemporalPlainDate(*value) || IsJSTemporalZonedDateTime(*value)) {
       // i. Return value.
       return value;
     }
     // b. If value has an [[InitializedTemporalDateTime]] internal slot, then
-    if (value->IsJSTemporalPlainDateTime()) {
+    if (IsJSTemporalPlainDateTime(*value)) {
       Handle<JSTemporalPlainDateTime> date_time_value =
           Handle<JSTemporalPlainDateTime>::cast(value);
       // i. Return ? CreateTemporalDateTime(value.[[ISOYear]],
@@ -8148,7 +8174,7 @@ MaybeHandle<Object> ToRelativeTemporalObject(Isolate* isolate,
         JSReceiver::GetProperty(isolate, value, factory->timeZone_string()),
         Object);
     // k. If timeZone is not undefined, then
-    if (!time_zone_obj->IsUndefined()) {
+    if (!IsUndefined(*time_zone_obj)) {
       // i. Set timeZone to ? ToTemporalTimeZone(timeZone).
       Handle<JSReceiver> time_zone;
       ASSIGN_RETURN_ON_EXCEPTION(
@@ -8159,7 +8185,7 @@ MaybeHandle<Object> ToRelativeTemporalObject(Isolate* isolate,
     }
 
     // l. If offsetString is undefined, then
-    if (offset_string_obj->IsUndefined()) {
+    if (IsUndefined(*offset_string_obj)) {
       // i. Set offsetBehaviour to wall.
       offset_behaviour = OffsetBehaviour::kWall;
     }
@@ -8190,14 +8216,14 @@ MaybeHandle<Object> ToRelativeTemporalObject(Isolate* isolate,
     Handle<Object> time_zone_name_obj = parsed_result.time_zone.name;
 
     // f. If timeZoneName is undefined, then
-    if (time_zone_name_obj->IsUndefined()) {
+    if (IsUndefined(*time_zone_name_obj)) {
       // i. Let timeZone be undefined.
       time_zone_obj = factory->undefined_value();
       // g. Else,
     } else {
       // i. If ParseText(StringToCodePoints(timeZoneName),
       // TimeZoneNumericUTCOffset) is a List of errors, then
-      DCHECK(time_zone_name_obj->IsString());
+      DCHECK(IsString(*time_zone_name_obj));
       Handle<String> time_zone_name = Handle<String>::cast(time_zone_name_obj);
       base::Optional<ParsedISO8601Result> parsed =
           TemporalParser::ParseTimeZoneNumericUTCOffset(isolate,
@@ -8224,7 +8250,7 @@ MaybeHandle<Object> ToRelativeTemporalObject(Isolate* isolate,
         // 1. Set offsetBehaviour to exact.
         offset_behaviour = OffsetBehaviour::kExact;
         // iv. Else if offsetString is undefined, then
-      } else if (offset_string_obj->IsUndefined()) {
+      } else if (IsUndefined(*offset_string_obj)) {
         // 1. Set offsetBehaviour to wall.
         offset_behaviour = OffsetBehaviour::kWall;
       }
@@ -8233,12 +8259,12 @@ MaybeHandle<Object> ToRelativeTemporalObject(Isolate* isolate,
     }
   }
   // 8. If timeZone is undefined, then
-  if (time_zone_obj->IsUndefined()) {
+  if (IsUndefined(*time_zone_obj)) {
     // a. Return ? CreateTemporalDate(result.[[Year]], result.[[Month]],
     // result.[[Day]], calendar).
     return CreateTemporalDate(isolate, result.date, calendar);
   }
-  DCHECK(time_zone_obj->IsJSReceiver());
+  DCHECK(IsJSReceiver(*time_zone_obj));
   Handle<JSReceiver> time_zone = Handle<JSReceiver>::cast(time_zone_obj);
   // 9. If offsetBehaviour is option, then
   int64_t offset_ns = 0;
@@ -8434,7 +8460,7 @@ Maybe<DurationRecord> AddDuration(Isolate* isolate, const DurationRecord& dur1,
   Unit largest_unit = LargerOfTwoTemporalUnits(largest_unit1, largest_unit2);
 
   // 5. If relativeTo is undefined, then
-  if (relative_to_obj->IsUndefined()) {
+  if (IsUndefined(*relative_to_obj)) {
     // a. If largestUnit is one of "year", "month", or "week", then
     if (largest_unit == Unit::kYear || largest_unit == Unit::kMonth ||
         largest_unit == Unit::kWeek) {
@@ -8460,7 +8486,7 @@ Maybe<DurationRecord> AddDuration(Isolate* isolate, const DurationRecord& dur1,
     return Just(CreateDurationRecord(isolate, {0, 0, 0, result.time_duration})
                     .ToChecked());
     // 5. If relativeTo has an [[InitializedTemporalDate]] internal slot, then
-  } else if (relative_to_obj->IsJSTemporalPlainDate()) {
+  } else if (IsJSTemporalPlainDate(*relative_to_obj)) {
     // a. Let calendar be relativeTo.[[Calendar]].
     Handle<JSTemporalPlainDate> relative_to =
         Handle<JSTemporalPlainDate>::cast(relative_to_obj);
@@ -8491,7 +8517,7 @@ Maybe<DurationRecord> AddDuration(Isolate* isolate, const DurationRecord& dur1,
     Handle<Object> date_add;
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, date_add,
-        Object::GetMethod(calendar, factory->dateAdd_string()),
+        Object::GetMethod(isolate, calendar, factory->dateAdd_string()),
         Nothing<DurationRecord>());
     // e. Let intermediate be ? CalendarDateAdd(calendar, relativeTo,
     // dateDuration1, undefined, dateAdd).
@@ -8533,7 +8559,7 @@ Maybe<DurationRecord> AddDuration(Isolate* isolate, const DurationRecord& dur1,
     // Note: We call a special version of BalanceDuration which add two duration
     // internally to avoid overflow the double.
     TimeDurationRecord time_dur1 = dur1.time_duration;
-    time_dur1.days = date_difference->days().Number();
+    time_dur1.days = Object::Number(date_difference->days());
     TimeDurationRecord time_dur2 = dur2.time_duration;
     time_dur2.days = 0;
     MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -8546,16 +8572,16 @@ Maybe<DurationRecord> AddDuration(Isolate* isolate, const DurationRecord& dur1,
     // result.[[Hours]], result.[[Minutes]], result.[[Seconds]],
     // result.[[Milliseconds]], result.[[Microseconds]],
     // result.[[Nanoseconds]]).
-    return Just(
-        CreateDurationRecord(
-            isolate, {date_difference->years().Number(),
-                      date_difference->months().Number(),
-                      date_difference->weeks().Number(), result.time_duration})
-            .ToChecked());
+    return Just(CreateDurationRecord(isolate,
+                                     {Object::Number(date_difference->years()),
+                                      Object::Number(date_difference->months()),
+                                      Object::Number(date_difference->weeks()),
+                                      result.time_duration})
+                    .ToChecked());
   }
   // 6. Assert: relativeTo has an [[InitializedTemporalZonedDateTime]]
   // internal slot.
-  DCHECK(relative_to_obj->IsJSTemporalZonedDateTime());
+  DCHECK(IsJSTemporalZonedDateTime(*relative_to_obj));
   Handle<JSTemporalZonedDateTime> relative_to =
       Handle<JSTemporalZonedDateTime>::cast(relative_to_obj);
   // 7. Let timeZone be relativeTo.[[TimeZone]].
@@ -8641,14 +8667,15 @@ MaybeHandle<JSTemporalDuration> AddDurationToOrSubtractDurationFromDuration(
       isolate, result,
       AddDuration(
           isolate,
-          {duration->years().Number(),
-           duration->months().Number(),
-           duration->weeks().Number(),
-           {duration->days().Number(), duration->hours().Number(),
-            duration->minutes().Number(), duration->seconds().Number(),
-            duration->milliseconds().Number(),
-            duration->microseconds().Number(),
-            duration->nanoseconds().Number()}},
+          {Object::Number(duration->years()),
+           Object::Number(duration->months()),
+           Object::Number(duration->weeks()),
+           {Object::Number(duration->days()), Object::Number(duration->hours()),
+            Object::Number(duration->minutes()),
+            Object::Number(duration->seconds()),
+            Object::Number(duration->milliseconds()),
+            Object::Number(duration->microseconds()),
+            Object::Number(duration->nanoseconds())}},
           {sign * other.years,
            sign * other.months,
            sign * other.weeks,
@@ -8700,13 +8727,14 @@ MaybeHandle<String> JSTemporalDuration::ToJSON(
   // duration.[[Milliseconds]], duration.[[Microseconds]],
   // duration.[[Nanoseconds]], "auto").
   DurationRecord dur = {
-      duration->years().Number(),
-      duration->months().Number(),
-      duration->weeks().Number(),
-      {duration->days().Number(), duration->hours().Number(),
-       duration->minutes().Number(), duration->seconds().Number(),
-       duration->milliseconds().Number(), duration->microseconds().Number(),
-       duration->nanoseconds().Number()}};
+      Object::Number(duration->years()),
+      Object::Number(duration->months()),
+      Object::Number(duration->weeks()),
+      {Object::Number(duration->days()), Object::Number(duration->hours()),
+       Object::Number(duration->minutes()), Object::Number(duration->seconds()),
+       Object::Number(duration->milliseconds()),
+       Object::Number(duration->microseconds()),
+       Object::Number(duration->nanoseconds())}};
   return TemporalDurationToString(isolate, dur, Precision::kAuto);
 }
 
@@ -8723,13 +8751,14 @@ MaybeHandle<String> JSTemporalDuration::ToLocaleString(
   // duration.[[Milliseconds]], duration.[[Microseconds]],
   // duration.[[Nanoseconds]], "auto").
   DurationRecord dur = {
-      duration->years().Number(),
-      duration->months().Number(),
-      duration->weeks().Number(),
-      {duration->days().Number(), duration->hours().Number(),
-       duration->minutes().Number(), duration->seconds().Number(),
-       duration->milliseconds().Number(), duration->microseconds().Number(),
-       duration->nanoseconds().Number()}};
+      Object::Number(duration->years()),
+      Object::Number(duration->months()),
+      Object::Number(duration->weeks()),
+      {Object::Number(duration->days()), Object::Number(duration->hours()),
+       Object::Number(duration->minutes()), Object::Number(duration->seconds()),
+       Object::Number(duration->milliseconds()),
+       Object::Number(duration->microseconds()),
+       Object::Number(duration->nanoseconds())}};
 
   // TODO(ftang) Implement #sup-temporal.duration.prototype.tolocalestring
   return TemporalDurationToString(isolate, dur, Precision::kAuto);
@@ -8808,15 +8837,15 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
   TEMPORAL_ENTER_FUNC();
   // optional argument relativeTo (undefined, a Temporal.PlainDate, or a
   // Temporal.ZonedDateTime)
-  DCHECK(relative_to->IsUndefined() || relative_to->IsJSTemporalPlainDate() ||
-         relative_to->IsJSTemporalZonedDateTime());
+  DCHECK(IsUndefined(*relative_to) || IsJSTemporalPlainDate(*relative_to) ||
+         IsJSTemporalZonedDateTime(*relative_to));
 
   Factory* factory = isolate->factory();
   DurationRecordWithRemainder result;
   result.record = duration;
   // 2. If unit is "year", "month", or "week", and relativeTo is undefined, then
   if ((unit == Unit::kYear || unit == Unit::kMonth || unit == Unit::kWeek) &&
-      relative_to->IsUndefined()) {
+      IsUndefined(*relative_to)) {
     // a. Throw a RangeError exception.
     THROW_NEW_ERROR_RETURN_VALUE(isolate,
                                  NEW_TEMPORAL_INVALID_ARG_RANGE_ERROR(),
@@ -8828,10 +8857,10 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
 
   Handle<JSReceiver> calendar;
   // 5. If relativeTo is not undefined, then
-  if (!relative_to->IsUndefined()) {
+  if (!IsUndefined(*relative_to)) {
     // a. If relativeTo has an [[InitializedTemporalZonedDateTime]] internal
     // slot, then
-    if (relative_to->IsJSTemporalZonedDateTime()) {
+    if (IsJSTemporalZonedDateTime(*relative_to)) {
       // i. Set zonedRelativeTo to relativeTo.
       zoned_relative_to = relative_to;
       // ii. Set relativeTo to ? ToTemporalDate(relativeTo).
@@ -8844,7 +8873,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
     } else {
       // i. Assert: relativeTo has an [[InitializedTemporalDate]] internal
       // slot.
-      DCHECK(relative_to->IsJSTemporalPlainDate());
+      DCHECK(IsJSTemporalPlainDate(*relative_to));
     }
     // c. Let calendar be relativeTo.[[Calendar]].
     calendar = Handle<JSReceiver>(
@@ -8868,8 +8897,8 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
     Handle<Object> intermediate = isolate->factory()->undefined_value();
 
     // c. If zonedRelativeTo is not undefined, then
-    if (!zoned_relative_to->IsUndefined()) {
-      DCHECK(zoned_relative_to->IsJSTemporalZonedDateTime());
+    if (!IsUndefined(*zoned_relative_to)) {
+      DCHECK(IsJSTemporalZonedDateTime(*zoned_relative_to));
       // i. Let intermediate be ? MoveRelativeZonedDateTime(zonedRelativeTo,
       // years, months, weeks, days).
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -8930,7 +8959,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
       Handle<Object> date_add;
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate, date_add,
-          Object::GetMethod(calendar, factory->dateAdd_string()),
+          Object::GetMethod(isolate, calendar, factory->dateAdd_string()),
           Nothing<DurationRecordWithRemainder>());
 
       // c. Let yearsLater be ? CalendarDateAdd(calendar, relativeTo,
@@ -9010,7 +9039,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
           Nothing<DurationRecordWithRemainder>());
 
       // n. Let yearsPassed be timePassed.[[Years]].
-      double years_passed = time_passed->years().Number();
+      double years_passed = Object::Number(time_passed->years());
 
       // o. Set years to years + yearsPassed.
       result.record.years += years_passed;
@@ -9035,8 +9064,8 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
       relative_to = years_added;
 
       // s. Let daysPassed be DaysUntil(oldRelativeTo, relativeTo).
-      DCHECK(old_relative_to->IsJSTemporalPlainDate());
-      DCHECK(relative_to->IsJSTemporalPlainDate());
+      DCHECK(IsJSTemporalPlainDate(*old_relative_to));
+      DCHECK(IsJSTemporalPlainDate(*relative_to));
       double days_passed = DaysUntil(
           isolate, Handle<JSTemporalPlainDate>::cast(old_relative_to),
           Handle<JSTemporalPlainDate>::cast(relative_to), method_name);
@@ -9055,7 +9084,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
 
       // w. Let moveResult be ? MoveRelativeDate(calendar, relativeTo, oneYear).
       MoveRelativeDateResult move_result;
-      DCHECK(relative_to->IsJSTemporalPlainDate());
+      DCHECK(IsJSTemporalPlainDate(*relative_to));
       MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate, move_result,
           MoveRelativeDate(isolate, calendar,
@@ -9093,7 +9122,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
       Handle<Object> date_add;
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate, date_add,
-          Object::GetMethod(calendar, factory->dateAdd_string()),
+          Object::GetMethod(isolate, calendar, factory->dateAdd_string()),
           Nothing<DurationRecordWithRemainder>());
 
       // c. Let yearsMonthsLater be ? CalendarDateAdd(calendar, relativeTo,
@@ -9146,7 +9175,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
       // k. Let moveResult be ? MoveRelativeDate(calendar, relativeTo,
       // oneMonth).
       MoveRelativeDateResult move_result;
-      DCHECK(relative_to->IsJSTemporalPlainDate());
+      DCHECK(IsJSTemporalPlainDate(*relative_to));
       MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate, move_result,
           MoveRelativeDate(isolate, calendar,
@@ -9169,7 +9198,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
         result.record.time_duration.days -= one_month_days;
         // iii. Set moveResult to ? MoveRelativeDate(calendar, relativeTo,
         // oneMonth).
-        DCHECK(relative_to->IsJSTemporalPlainDate());
+        DCHECK(IsJSTemporalPlainDate(*relative_to));
         MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
             isolate, move_result,
             MoveRelativeDate(isolate, calendar,
@@ -9206,7 +9235,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
 
       // c. Let moveResult be ? MoveRelativeDate(calendar, relativeTo, oneWeek).
       MoveRelativeDateResult move_result;
-      DCHECK(relative_to->IsJSTemporalPlainDate());
+      DCHECK(IsJSTemporalPlainDate(*relative_to));
       MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate, move_result,
           MoveRelativeDate(isolate, calendar,
@@ -9229,7 +9258,7 @@ Maybe<DurationRecordWithRemainder> RoundDuration(Isolate* isolate,
         result.record.time_duration.days -= one_week_days;
         // iii. Set moveResult to ? MoveRelativeDate(calendar, relativeTo,
         // oneWeek).
-        DCHECK(relative_to->IsJSTemporalPlainDate());
+        DCHECK(IsJSTemporalPlainDate(*relative_to));
         MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
             isolate, move_result,
             MoveRelativeDate(isolate, calendar,
@@ -9454,13 +9483,14 @@ MaybeHandle<String> JSTemporalDuration::ToString(
   // duration.[[Microseconds]], duration.[[Nanoseconds]],
   // precision.[[Increment]], precision.[[Unit]], roundingMode).
   DurationRecord dur = {
-      duration->years().Number(),
-      duration->months().Number(),
-      duration->weeks().Number(),
-      {duration->days().Number(), duration->hours().Number(),
-       duration->minutes().Number(), duration->seconds().Number(),
-       duration->milliseconds().Number(), duration->microseconds().Number(),
-       duration->nanoseconds().Number()}};
+      Object::Number(duration->years()),
+      Object::Number(duration->months()),
+      Object::Number(duration->weeks()),
+      {Object::Number(duration->days()), Object::Number(duration->hours()),
+       Object::Number(duration->minutes()), Object::Number(duration->seconds()),
+       Object::Number(duration->milliseconds()),
+       Object::Number(duration->microseconds()),
+       Object::Number(duration->nanoseconds())}};
   DurationRecordWithRemainder result;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, result,
@@ -9481,7 +9511,7 @@ MaybeHandle<JSTemporalCalendar> JSTemporalCalendar::Constructor(
     Isolate* isolate, Handle<JSFunction> target, Handle<HeapObject> new_target,
     Handle<Object> identifier_obj) {
   // 1. If NewTarget is undefined, then
-  if (new_target->IsUndefined(isolate)) {
+  if (IsUndefined(*new_target, isolate)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kConstructorNotFunction,
@@ -9523,9 +9553,9 @@ int32_t ToISODayOfYear(Isolate* isolate, const DateRecord& date) {
 
 bool IsPlainDatePlainDateTimeOrPlainYearMonth(
     Handle<Object> temporal_date_like) {
-  return temporal_date_like->IsJSTemporalPlainDate() ||
-         temporal_date_like->IsJSTemporalPlainDateTime() ||
-         temporal_date_like->IsJSTemporalPlainYearMonth();
+  return IsJSTemporalPlainDate(*temporal_date_like) ||
+         IsJSTemporalPlainDateTime(*temporal_date_like) ||
+         IsJSTemporalPlainYearMonth(*temporal_date_like);
 }
 
 // #sec-temporal-toisodayofweek
@@ -9631,9 +9661,9 @@ Maybe<int32_t> ResolveISOMonth(Isolate* isolate, Handle<JSReceiver> fields) {
       JSReceiver::GetProperty(isolate, fields, factory->monthCode_string())
           .ToHandleChecked();
   // 3. If monthCode is undefined, then
-  if (month_code_obj->IsUndefined(isolate)) {
+  if (IsUndefined(*month_code_obj, isolate)) {
     // a. If month is undefined, throw a TypeError exception.
-    if (month_obj->IsUndefined(isolate)) {
+    if (IsUndefined(*month_obj, isolate)) {
       THROW_NEW_ERROR_RETURN_VALUE(
           isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(), Nothing<int32_t>());
     }
@@ -9641,11 +9671,11 @@ Maybe<int32_t> ResolveISOMonth(Isolate* isolate, Handle<JSReceiver> fields) {
     // Note: In Temporal spec, "month" in fields is always converted by
     // ToPositiveInteger inside PrepareTemporalFields before calling
     // ResolveISOMonth. Therefore the month_obj is always a positive integer.
-    DCHECK(month_obj->IsSmi() || month_obj->IsHeapNumber());
-    return Just(FastD2I(month_obj->Number()));
+    DCHECK(IsSmi(*month_obj) || IsHeapNumber(*month_obj));
+    return Just(FastD2I(Object::Number(*month_obj)));
   }
   // 4. Assert: Type(monthCode) is String.
-  DCHECK(month_code_obj->IsString());
+  DCHECK(IsString(*month_code_obj));
   Handle<String> month_code;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, month_code,
                                    Object::ToString(isolate, month_code_obj),
@@ -9681,8 +9711,8 @@ Maybe<int32_t> ResolveISOMonth(Isolate* isolate, Handle<JSReceiver> fields) {
   // Note: In Temporal spec, "month" in fields is always converted by
   // ToPositiveInteger inside PrepareTemporalFields before calling
   // ResolveISOMonth. Therefore the month_obj is always a positive integer.
-  if (!month_obj->IsUndefined() &&
-      FastD2I(month_obj->Number()) != number_part) {
+  if (!IsUndefined(*month_obj) &&
+      FastD2I(Object::Number(*month_obj)) != number_part) {
     // a. Throw a RangeError exception.
     THROW_NEW_ERROR_RETURN_VALUE(
         isolate,
@@ -9724,7 +9754,7 @@ Maybe<DateRecord> ISODateFromFields(Isolate* isolate, Handle<JSReceiver> fields,
   // Note: "year" in fields is always converted by
   // ToIntegerThrowOnInfinity inside the PrepareTemporalFields above.
   // Therefore the year_obj is always an integer.
-  DCHECK(year_obj->IsSmi() || year_obj->IsHeapNumber());
+  DCHECK(IsSmi(*year_obj) || IsHeapNumber(*year_obj));
 
   // 6. Let month be ? ResolveISOMonth(fields).
   int32_t month;
@@ -9739,11 +9769,11 @@ Maybe<DateRecord> ISODateFromFields(Isolate* isolate, Handle<JSReceiver> fields,
   // Note: "day" in fields is always converted by
   // ToIntegerThrowOnInfinity inside the PrepareTemporalFields above.
   // Therefore the day_obj is always an integer.
-  DCHECK(day_obj->IsSmi() || day_obj->IsHeapNumber());
+  DCHECK(IsSmi(*day_obj) || IsHeapNumber(*day_obj));
   // 9. Return ? RegulateISODate(year, month, day, overflow).
-  return RegulateISODate(
-      isolate, overflow,
-      {FastD2I(year_obj->Number()), month, FastD2I(day_obj->Number())});
+  return RegulateISODate(isolate, overflow,
+                         {FastD2I(Object::Number(*year_obj)), month,
+                          FastD2I(Object::Number(*day_obj))});
 }
 
 // #sec-temporal-addisodate
@@ -9995,12 +10025,12 @@ Maybe<DateRecord> ISOYearMonthFromFields(Isolate* isolate,
       JSReceiver::GetProperty(isolate, fields, factory->year_string())
           .ToHandleChecked();
   // 5. If year is undefined, throw a TypeError exception.
-  if (year_obj->IsUndefined(isolate)) {
+  if (IsUndefined(*year_obj, isolate)) {
     THROW_NEW_ERROR_RETURN_VALUE(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                                  Nothing<DateRecord>());
   }
   DateRecord result;
-  result.year = FastD2I(floor(year_obj->Number()));
+  result.year = FastD2I(floor(Object::Number(*year_obj)));
   // 6. Let month be ? ResolveISOMonth(fields).
   int32_t month;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -10123,10 +10153,12 @@ MaybeHandle<JSTemporalPlainDate> JSTemporalCalendar::DateAdd(
       isolate, balance_result,
       BalanceDuration(
           isolate, Unit::kDay,
-          {duration->days().Number(), duration->hours().Number(),
-           duration->minutes().Number(), duration->seconds().Number(),
-           duration->milliseconds().Number(), duration->microseconds().Number(),
-           duration->nanoseconds().Number()},
+          {Object::Number(duration->days()), Object::Number(duration->hours()),
+           Object::Number(duration->minutes()),
+           Object::Number(duration->seconds()),
+           Object::Number(duration->milliseconds()),
+           Object::Number(duration->microseconds()),
+           Object::Number(duration->nanoseconds())},
           method_name),
       Handle<JSTemporalPlainDate>());
 
@@ -10140,8 +10172,9 @@ MaybeHandle<JSTemporalPlainDate> JSTemporalCalendar::DateAdd(
         isolate, result,
         AddISODate(isolate,
                    {date->iso_year(), date->iso_month(), date->iso_day()},
-                   {duration->years().Number(), duration->months().Number(),
-                    duration->weeks().Number(), balance_result.days},
+                   {Object::Number(duration->years()),
+                    Object::Number(duration->months()),
+                    Object::Number(duration->weeks()), balance_result.days},
                    overflow),
         Handle<JSTemporalPlainDate>());
   } else {
@@ -10179,13 +10212,13 @@ MaybeHandle<Smi> JSTemporalCalendar::DaysInYear(
 
   // a. Let daysInYear be ! ISODaysInYear(temporalDateLike.[[ISOYear]]).
   int32_t year;
-  if (temporal_date_like->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*temporal_date_like)) {
     year = Handle<JSTemporalPlainDate>::cast(temporal_date_like)->iso_year();
-  } else if (temporal_date_like->IsJSTemporalPlainDateTime()) {
+  } else if (IsJSTemporalPlainDateTime(*temporal_date_like)) {
     year =
         Handle<JSTemporalPlainDateTime>::cast(temporal_date_like)->iso_year();
   } else {
-    DCHECK(temporal_date_like->IsJSTemporalPlainYearMonth());
+    DCHECK(IsJSTemporalPlainYearMonth(*temporal_date_like));
     year =
         Handle<JSTemporalPlainYearMonth>::cast(temporal_date_like)->iso_year();
   }
@@ -10218,16 +10251,16 @@ MaybeHandle<Smi> JSTemporalCalendar::DaysInMonth(
   // temporalDateLike.[[ISOMonth]])).
   int32_t year;
   int32_t month;
-  if (temporal_date_like->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*temporal_date_like)) {
     year = Handle<JSTemporalPlainDate>::cast(temporal_date_like)->iso_year();
     month = Handle<JSTemporalPlainDate>::cast(temporal_date_like)->iso_month();
-  } else if (temporal_date_like->IsJSTemporalPlainDateTime()) {
+  } else if (IsJSTemporalPlainDateTime(*temporal_date_like)) {
     year =
         Handle<JSTemporalPlainDateTime>::cast(temporal_date_like)->iso_year();
     month =
         Handle<JSTemporalPlainDateTime>::cast(temporal_date_like)->iso_month();
   } else {
-    DCHECK(temporal_date_like->IsJSTemporalPlainYearMonth());
+    DCHECK(IsJSTemporalPlainYearMonth(*temporal_date_like));
     year =
         Handle<JSTemporalPlainYearMonth>::cast(temporal_date_like)->iso_year();
     month =
@@ -10259,13 +10292,13 @@ MaybeHandle<Smi> JSTemporalCalendar::Year(Isolate* isolate,
 
   // a. Let year be ! ISOYear(temporalDateLike).
   int32_t year;
-  if (temporal_date_like->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*temporal_date_like)) {
     year = Handle<JSTemporalPlainDate>::cast(temporal_date_like)->iso_year();
-  } else if (temporal_date_like->IsJSTemporalPlainDateTime()) {
+  } else if (IsJSTemporalPlainDateTime(*temporal_date_like)) {
     year =
         Handle<JSTemporalPlainDateTime>::cast(temporal_date_like)->iso_year();
   } else {
-    DCHECK(temporal_date_like->IsJSTemporalPlainYearMonth());
+    DCHECK(IsJSTemporalPlainYearMonth(*temporal_date_like));
     year =
         Handle<JSTemporalPlainYearMonth>::cast(temporal_date_like)->iso_year();
   }
@@ -10368,13 +10401,13 @@ MaybeHandle<Oddball> JSTemporalCalendar::InLeapYear(
 
   // a. Let inLeapYear be ! IsISOLeapYear(temporalDateLike.[[ISOYear]]).
   int32_t year;
-  if (temporal_date_like->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*temporal_date_like)) {
     year = Handle<JSTemporalPlainDate>::cast(temporal_date_like)->iso_year();
-  } else if (temporal_date_like->IsJSTemporalPlainDateTime()) {
+  } else if (IsJSTemporalPlainDateTime(*temporal_date_like)) {
     year =
         Handle<JSTemporalPlainDateTime>::cast(temporal_date_like)->iso_year();
   } else {
-    DCHECK(temporal_date_like->IsJSTemporalPlainYearMonth());
+    DCHECK(IsJSTemporalPlainYearMonth(*temporal_date_like));
     year =
         Handle<JSTemporalPlainYearMonth>::cast(temporal_date_like)->iso_year();
   }
@@ -10410,7 +10443,7 @@ MaybeHandle<JSTemporalPlainDate> JSTemporalCalendar::DateFromFields(
   // 3. Assert: calendar.[[Identifier]] is "iso8601".
   // 4. If Type(fields) is not Object, throw a TypeError exception.
   const char* method_name = "Temporal.Calendar.prototype.dateFromFields";
-  if (!fields_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*fields_obj)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kCalledOnNonObject,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -10537,9 +10570,9 @@ MaybeHandle<Smi> JSTemporalCalendar::Day(Isolate* isolate,
   // 4. If Type(temporalDateLike) is not Object or temporalDateLike does not
   // have an [[InitializedTemporalDate]] or [[InitializedTemporalMonthDay]]
   // internal slot, then
-  if (!(temporal_date_like->IsJSTemporalPlainDate() ||
-        temporal_date_like->IsJSTemporalPlainDateTime() ||
-        temporal_date_like->IsJSTemporalPlainMonthDay())) {
+  if (!(IsJSTemporalPlainDate(*temporal_date_like) ||
+        IsJSTemporalPlainDateTime(*temporal_date_like) ||
+        IsJSTemporalPlainMonthDay(*temporal_date_like))) {
     // a. Set temporalDateLike to ? ToTemporalDate(temporalDateLike).
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, temporal_date_like,
@@ -10550,12 +10583,12 @@ MaybeHandle<Smi> JSTemporalCalendar::Day(Isolate* isolate,
 
   // 5. Let day be ! ISODay(temporalDateLike).
   int32_t day;
-  if (temporal_date_like->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*temporal_date_like)) {
     day = Handle<JSTemporalPlainDate>::cast(temporal_date_like)->iso_day();
-  } else if (temporal_date_like->IsJSTemporalPlainDateTime()) {
+  } else if (IsJSTemporalPlainDateTime(*temporal_date_like)) {
     day = Handle<JSTemporalPlainDateTime>::cast(temporal_date_like)->iso_day();
   } else {
-    DCHECK(temporal_date_like->IsJSTemporalPlainMonthDay());
+    DCHECK(IsJSTemporalPlainMonthDay(*temporal_date_like));
     day = Handle<JSTemporalPlainMonthDay>::cast(temporal_date_like)->iso_day();
   }
 
@@ -10576,7 +10609,7 @@ MaybeHandle<String> JSTemporalCalendar::MonthCode(
   // [[InitializedTemporalMonthDay]], or
   // [[InitializedTemporalYearMonth]] internal slot, then
   if (!(IsPlainDatePlainDateTimeOrPlainYearMonth(temporal_date_like) ||
-        temporal_date_like->IsJSTemporalPlainMonthDay())) {
+        IsJSTemporalPlainMonthDay(*temporal_date_like))) {
     // a. Set temporalDateLike to ? ToTemporalDate(temporalDateLike).
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, temporal_date_like,
@@ -10587,16 +10620,16 @@ MaybeHandle<String> JSTemporalCalendar::MonthCode(
 
   // 5. Return ! ISOMonthCode(temporalDateLike).
   int32_t month;
-  if (temporal_date_like->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*temporal_date_like)) {
     month = Handle<JSTemporalPlainDate>::cast(temporal_date_like)->iso_month();
-  } else if (temporal_date_like->IsJSTemporalPlainDateTime()) {
+  } else if (IsJSTemporalPlainDateTime(*temporal_date_like)) {
     month =
         Handle<JSTemporalPlainDateTime>::cast(temporal_date_like)->iso_month();
-  } else if (temporal_date_like->IsJSTemporalPlainMonthDay()) {
+  } else if (IsJSTemporalPlainMonthDay(*temporal_date_like)) {
     month =
         Handle<JSTemporalPlainMonthDay>::cast(temporal_date_like)->iso_month();
   } else {
-    DCHECK(temporal_date_like->IsJSTemporalPlainYearMonth());
+    DCHECK(IsJSTemporalPlainYearMonth(*temporal_date_like));
     month =
         Handle<JSTemporalPlainYearMonth>::cast(temporal_date_like)->iso_month();
   }
@@ -10616,7 +10649,7 @@ MaybeHandle<Smi> JSTemporalCalendar::Month(Isolate* isolate,
                                            Handle<Object> temporal_date_like) {
   // 4. If Type(temporalDateLike) is Object and temporalDateLike has an
   // [[InitializedTemporalMonthDay]] internal slot, then
-  if (temporal_date_like->IsJSTemporalPlainMonthDay()) {
+  if (IsJSTemporalPlainMonthDay(*temporal_date_like)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(), Smi);
   }
@@ -10635,13 +10668,13 @@ MaybeHandle<Smi> JSTemporalCalendar::Month(Isolate* isolate,
 
   // 6. Return ! ISOMonth(temporalDateLike).
   int32_t month;
-  if (temporal_date_like->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*temporal_date_like)) {
     month = Handle<JSTemporalPlainDate>::cast(temporal_date_like)->iso_month();
-  } else if (temporal_date_like->IsJSTemporalPlainDateTime()) {
+  } else if (IsJSTemporalPlainDateTime(*temporal_date_like)) {
     month =
         Handle<JSTemporalPlainDateTime>::cast(temporal_date_like)->iso_month();
   } else {
-    DCHECK(temporal_date_like->IsJSTemporalPlainYearMonth());
+    DCHECK(IsJSTemporalPlainYearMonth(*temporal_date_like));
     month =
         Handle<JSTemporalPlainYearMonth>::cast(temporal_date_like)->iso_month();
   }
@@ -10660,7 +10693,7 @@ MaybeHandle<JSTemporalPlainMonthDay> JSTemporalCalendar::MonthDayFromFields(
   // 3. Assert: calendar.[[Identifier]] is "iso8601".
   const char* method_name = "Temporal.Calendar.prototype.monthDayFromFields";
   // 4. If Type(fields) is not Object, throw a TypeError exception.
-  if (!fields_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*fields_obj)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kCalledOnNonObject,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -10699,7 +10732,7 @@ MaybeHandle<JSTemporalPlainYearMonth> JSTemporalCalendar::YearMonthFromFields(
   // 3. Assert: calendar.[[Identifier]] is "iso8601".
   const char* method_name = "Temporal.Calendar.prototype.yearMonthFromFields";
   // 4. If Type(fields) is not Object, throw a TypeError exception.
-  if (!fields_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*fields_obj)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kCalledOnNonObject,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -10833,7 +10866,7 @@ MaybeHandle<JSTemporalTimeZone> JSTemporalTimeZone::Constructor(
     Isolate* isolate, Handle<JSFunction> target, Handle<HeapObject> new_target,
     Handle<Object> identifier_obj) {
   // 1. If NewTarget is undefined, then
-  if (new_target->IsUndefined(isolate)) {
+  if (IsUndefined(*new_target, isolate)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kConstructorNotFunction,
@@ -11038,10 +11071,10 @@ MaybeHandle<Object> GetTransition(Isolate* isolate,
       iana_func(isolate, handle(starting_point->nanoseconds(), isolate),
                 time_zone->time_zone_index());
   // 6. If transition is null, return null.
-  if (transition_obj->IsNull()) {
+  if (IsNull(*transition_obj)) {
     return isolate->factory()->null_value();
   }
-  DCHECK(transition_obj->IsBigInt());
+  DCHECK(IsBigInt(*transition_obj));
   Handle<BigInt> transition = Handle<BigInt>::cast(transition_obj);
   // 7. Return ! CreateTemporalInstant(transition).
   return temporal::CreateTemporalInstant(isolate, transition).ToHandleChecked();
@@ -11300,7 +11333,7 @@ MaybeHandle<JSTemporalPlainDate> JSTemporalPlainDate::Constructor(
     Handle<Object> iso_day_obj, Handle<Object> calendar_like) {
   const char* method_name = "Temporal.PlainDate";
   // 1. If NewTarget is undefined, throw a TypeError exception.
-  if (new_target->IsUndefined()) {
+  if (IsUndefined(*new_target)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -11467,7 +11500,7 @@ MaybeHandle<JSTemporalPlainDateTime> JSTemporalPlainDate::ToPlainDateTime(
   // 2. Perform ? RequireInternalSlot(temporalDate,
   // [[InitializedTemporalDate]]).
   // 3. If temporalTime is undefined, then
-  if (temporal_time_obj->IsUndefined()) {
+  if (IsUndefined(*temporal_time_obj)) {
     // a. Return ? CreateTemporalDateTime(temporalDate.[[ISOYear]],
     // temporalDate.[[ISOMonth]], temporalDate.[[ISODay]], 0, 0, 0, 0, 0, 0,
     // temporalDate.[[Calendar]]).
@@ -11514,10 +11547,10 @@ Maybe<bool> RejectObjectWithCalendarOrTimeZone(Isolate* isolate,
   // [[InitializedTemporalDateTime]], [[InitializedTemporalMonthDay]],
   // [[InitializedTemporalTime]], [[InitializedTemporalYearMonth]], or
   // [[InitializedTemporalZonedDateTime]] internal slot, then
-  if (object->IsJSTemporalPlainDate() || object->IsJSTemporalPlainDateTime() ||
-      object->IsJSTemporalPlainMonthDay() || object->IsJSTemporalPlainTime() ||
-      object->IsJSTemporalPlainYearMonth() ||
-      object->IsJSTemporalZonedDateTime()) {
+  if (IsJSTemporalPlainDate(*object) || IsJSTemporalPlainDateTime(*object) ||
+      IsJSTemporalPlainMonthDay(*object) || IsJSTemporalPlainTime(*object) ||
+      IsJSTemporalPlainYearMonth(*object) ||
+      IsJSTemporalZonedDateTime(*object)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR_RETURN_VALUE(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                                  Nothing<bool>());
@@ -11529,7 +11562,7 @@ Maybe<bool> RejectObjectWithCalendarOrTimeZone(Isolate* isolate,
       JSReceiver::GetProperty(isolate, object, factory->calendar_string()),
       Nothing<bool>());
   // 4. If calendarProperty is not undefined, then
-  if (!calendar_property->IsUndefined()) {
+  if (!IsUndefined(*calendar_property)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR_RETURN_VALUE(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                                  Nothing<bool>());
@@ -11541,7 +11574,7 @@ Maybe<bool> RejectObjectWithCalendarOrTimeZone(Isolate* isolate,
       JSReceiver::GetProperty(isolate, object, factory->timeZone_string()),
       Nothing<bool>());
   // 6. If timeZoneProperty is not undefined, then
-  if (!time_zone_property->IsUndefined()) {
+  if (!IsUndefined(*time_zone_property)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR_RETURN_VALUE(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                                  Nothing<bool>());
@@ -11557,10 +11590,11 @@ MaybeHandle<JSReceiver> CalendarMergeFields(
   Handle<Object> merge_fields;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, merge_fields,
-      Object::GetMethod(calendar, isolate->factory()->mergeFields_string()),
+      Object::GetMethod(isolate, calendar,
+                        isolate->factory()->mergeFields_string()),
       JSReceiver);
   // 2. If mergeFields is undefined, then
-  if (merge_fields->IsUndefined()) {
+  if (IsUndefined(*merge_fields)) {
     // a. Return ? DefaultMergeFields(fields, additionalFields).
     return DefaultMergeFields(isolate, fields, additional_fields);
   }
@@ -11571,7 +11605,7 @@ MaybeHandle<JSReceiver> CalendarMergeFields(
       isolate, result,
       Execution::Call(isolate, merge_fields, calendar, 2, argv), JSReceiver);
   // 4. If Type(result) is not Object, throw a TypeError exception.
-  if (!result->IsJSReceiver()) {
+  if (!IsJSReceiver(*result)) {
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalDuration);
   }
@@ -11590,7 +11624,7 @@ MaybeHandle<T> PlainDateOrYearMonthOrMonthDayWith(
   // 2. Perform ? RequireInternalSlot(temporalDate,
   // [[InitializedTemporalXXX]]).
   // 3. If Type(temporalXXXLike) is not Object, then
-  if (!temporal_like_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*temporal_like_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(), T);
   }
@@ -11663,7 +11697,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalPlainDate::ToZonedDateTime(
   // 3. If Type(item) is Object, then
   Handle<JSReceiver> time_zone;
   Handle<Object> temporal_time_obj;
-  if (item_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*item_obj)) {
     Handle<JSReceiver> item = Handle<JSReceiver>::cast(item_obj);
     // a. Let timeZoneLike be ? Get(item, "timeZone").
     Handle<Object> time_zone_like;
@@ -11672,7 +11706,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalPlainDate::ToZonedDateTime(
         JSReceiver::GetProperty(isolate, item, factory->timeZone_string()),
         JSTemporalZonedDateTime);
     // b. If timeZoneLike is undefined, then
-    if (time_zone_like->IsUndefined()) {
+    if (IsUndefined(*time_zone_like)) {
       // i. Let timeZone be ? ToTemporalTimeZone(item).
       ASSIGN_RETURN_ON_EXCEPTION(
           isolate, time_zone,
@@ -11706,7 +11740,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalPlainDate::ToZonedDateTime(
   // 5. If temporalTime is undefined, then
   Handle<JSTemporalPlainDateTime> temporal_date_time;
   Handle<JSReceiver> calendar(temporal_date->calendar(), isolate);
-  if (temporal_time_obj->IsUndefined()) {
+  if (IsUndefined(*temporal_time_obj)) {
     // a. Let temporalDateTime be ?
     // CreateTemporalDateTime(temporalDate.[[ISOYear]],
     // temporalDate.[[ISOMonth]], temporalDate.[[ISODay]], 0, 0, 0, 0, 0, 0,
@@ -11882,10 +11916,10 @@ MaybeHandle<JSTemporalDuration> DifferenceTemporalPlainDate(
     MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, round_result,
         RoundDuration(isolate,
-                      {result->years().Number(),
-                       result->months().Number(),
-                       result->weeks().Number(),
-                       {result->days().Number(), 0, 0, 0, 0, 0, 0}},
+                      {Object::Number(result->years()),
+                       Object::Number(result->months()),
+                       Object::Number(result->weeks()),
+                       {Object::Number(result->days()), 0, 0, 0, 0, 0, 0}},
                       settings.rounding_increment, settings.smallest_unit,
                       settings.rounding_mode, temporal_date, method_name),
         Handle<JSTemporalDuration>());
@@ -11909,10 +11943,11 @@ MaybeHandle<JSTemporalDuration> DifferenceTemporalPlainDate(
   // result.[[Months]], sign × result.[[Weeks]], sign × result.[[Days]], 0, 0,
   // 0, 0, 0, 0).
   return CreateTemporalDuration(
-             isolate, {sign * result->years().Number(),
-                       sign * result->months().Number(),
-                       sign * result->weeks().Number(),
-                       {sign * result->days().Number(), 0, 0, 0, 0, 0, 0}})
+             isolate,
+             {sign * Object::Number(result->years()),
+              sign * Object::Number(result->months()),
+              sign * Object::Number(result->weeks()),
+              {sign * Object::Number(result->days()), 0, 0, 0, 0, 0, 0}})
       .ToHandleChecked();
 }
 
@@ -11990,7 +12025,7 @@ MaybeHandle<JSTemporalPlainDate> JSTemporalPlainDate::From(
       JSTemporalPlainDate);
   // 2. If Type(item) is Object and item has an [[InitializedTemporalDate]]
   // internal slot, then
-  if (item->IsJSTemporalPlainDate()) {
+  if (IsJSTemporalPlainDate(*item)) {
     // a. Perform ? ToTemporalOverflow(options).
     MAYBE_RETURN_ON_EXCEPTION_VALUE(
         isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -12122,7 +12157,7 @@ MaybeHandle<JSTemporalPlainDateTime> JSTemporalPlainDateTime::Constructor(
     Handle<Object> nanosecond_obj, Handle<Object> calendar_like) {
   const char* method_name = "Temporal.PlainDateTime";
   // 1. If NewTarget is undefined, throw a TypeError exception.
-  if (new_target->IsUndefined()) {
+  if (IsUndefined(*new_target)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -12239,21 +12274,21 @@ MaybeHandle<JSTemporalPlainDateTime> ToTemporalDateTime(
     const char* method_name) {
   TEMPORAL_ENTER_FUNC();
   // 2. Assert: Type(options) is Object or Undefined.
-  DCHECK(options->IsJSReceiver() || options->IsUndefined());
+  DCHECK(IsJSReceiver(*options) || IsUndefined(*options));
 
   Handle<JSReceiver> calendar;
   temporal::DateTimeRecord result;
   // 2. If Type(item) is Object, then
-  if (item_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*item_obj)) {
     Handle<JSReceiver> item = Handle<JSReceiver>::cast(item_obj);
     // a. If item has an [[InitializedTemporalDateTime]] internal slot, then
     // i. Return item.
-    if (item->IsJSTemporalPlainDateTime()) {
+    if (IsJSTemporalPlainDateTime(*item)) {
       return Handle<JSTemporalPlainDateTime>::cast(item);
     }
     // b. If item has an [[InitializedTemporalZonedDateTime]] internal slot,
     // then
-    if (item->IsJSTemporalZonedDateTime()) {
+    if (IsJSTemporalZonedDateTime(*item)) {
       // i. Perform ? ToTemporalOverflow(options).
       MAYBE_RETURN_ON_EXCEPTION_VALUE(
           isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -12273,7 +12308,7 @@ MaybeHandle<JSTemporalPlainDateTime> ToTemporalDateTime(
           handle(zoned_date_time->calendar(), isolate), method_name);
     }
     // c. If item has an [[InitializedTemporalDate]] internal slot, then
-    if (item->IsJSTemporalPlainDate()) {
+    if (IsJSTemporalPlainDate(*item)) {
       // i. Perform ? ToTemporalOverflow(options).
       MAYBE_RETURN_ON_EXCEPTION_VALUE(
           isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -12369,7 +12404,7 @@ MaybeHandle<JSTemporalPlainDateTime> JSTemporalPlainDateTime::From(
       JSTemporalPlainDateTime);
   // 2. If Type(item) is Object and item has an [[InitializedTemporalDateTime]]
   // internal slot, then
-  if (item->IsJSTemporalPlainDateTime()) {
+  if (IsJSTemporalPlainDateTime(*item)) {
     // a. Perform ? ToTemporalOverflow(options).
     MAYBE_RETURN_ON_EXCEPTION_VALUE(
         isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -12479,7 +12514,7 @@ MaybeHandle<JSTemporalPlainDateTime> JSTemporalPlainDateTime::With(
   // 2. Perform ? RequireInternalSlot(dateTime,
   // [[InitializedTemporalDateTime]]).
   // 3. If Type(temporalDateTimeLike) is not Object, then
-  if (!temporal_date_time_like_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*temporal_date_time_like_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalPlainDateTime);
@@ -12563,7 +12598,7 @@ MaybeHandle<JSTemporalPlainDateTime> JSTemporalPlainDateTime::WithPlainTime(
   // 2. Perform ? RequireInternalSlot(temporalDateTime,
   // [[InitializedTemporalDateTime]]).
   // 3. If plainTimeLike is undefined, then
-  if (plain_time_like->IsUndefined()) {
+  if (IsUndefined(*plain_time_like)) {
     // a. Return ? CreateTemporalDateTime(temporalDateTime.[[ISOYear]],
     // temporalDateTime.[[ISOMonth]], temporalDateTime.[[ISODay]], 0, 0, 0, 0,
     // 0, 0, temporalDateTime.[[Calendar]]).
@@ -12997,7 +13032,7 @@ MaybeHandle<JSTemporalPlainDateTime> JSTemporalPlainDateTime::Round(
   // 2. Perform ? RequireInternalSlot(dateTime,
   // [[InitializedTemporalDateTime]]).
   // 3. If roundTo is undefined, then
-  if (round_to_obj->IsUndefined()) {
+  if (IsUndefined(*round_to_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalPlainDateTime);
@@ -13005,7 +13040,7 @@ MaybeHandle<JSTemporalPlainDateTime> JSTemporalPlainDateTime::Round(
 
   Handle<JSReceiver> round_to;
   // 4. If Type(roundTo) is String, then
-  if (round_to_obj->IsString()) {
+  if (IsString(*round_to_obj)) {
     // a. Let paramString be roundTo.
     Handle<String> param_string = Handle<String>::cast(round_to_obj);
     // b. Set roundTo to ! OrdinaryObjectCreate(null).
@@ -13379,7 +13414,7 @@ MaybeHandle<JSTemporalPlainMonthDay> JSTemporalPlainMonthDay::Constructor(
     Handle<Object> calendar_like, Handle<Object> reference_iso_year_obj) {
   const char* method_name = "Temporal.PlainMonthDay";
   // 1. If NewTarget is undefined, throw a TypeError exception.
-  if (new_target->IsUndefined()) {
+  if (IsUndefined(*new_target)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -13403,7 +13438,7 @@ MaybeHandle<JSTemporalPlainMonthDay> JSTemporalPlainMonthDay::Constructor(
   // ...
   // 8. Let ref be ? ToIntegerThrowOnInfinity(referenceISOYear).
   int32_t ref = 1972;
-  if (!reference_iso_year_obj->IsUndefined()) {
+  if (!IsUndefined(*reference_iso_year_obj)) {
     TO_INT_THROW_ON_INFTY(reference_iso_year, JSTemporalPlainMonthDay);
     ref = reference_iso_year;
   }
@@ -13462,16 +13497,16 @@ MaybeHandle<JSTemporalPlainMonthDay> ToTemporalMonthDay(
 
   Factory* factory = isolate->factory();
   // 2. Assert: Type(options) is Object or Undefined.
-  DCHECK(options->IsJSReceiver() || options->IsUndefined());
+  DCHECK(IsJSReceiver(*options) || IsUndefined(*options));
 
   // 3. Let referenceISOYear be 1972 (the first leap year after the Unix epoch).
   constexpr int32_t kReferenceIsoYear = 1972;
   // 4. If Type(item) is Object, then
-  if (item_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*item_obj)) {
     Handle<JSReceiver> item = Handle<JSReceiver>::cast(item_obj);
     // a. If item has an [[InitializedTemporalMonthDay]] internal slot, then
     // i. Return item.
-    if (item_obj->IsJSTemporalPlainMonthDay()) {
+    if (IsJSTemporalPlainMonthDay(*item_obj)) {
       return Handle<JSTemporalPlainMonthDay>::cast(item_obj);
     }
     bool calendar_absent = false;
@@ -13482,20 +13517,20 @@ MaybeHandle<JSTemporalPlainMonthDay> ToTemporalMonthDay(
     // i. Let calendar be item.[[Calendar]].
     // ii. Let calendarAbsent be false.
     Handle<JSReceiver> calendar;
-    if (item_obj->IsJSTemporalPlainDate()) {
+    if (IsJSTemporalPlainDate(*item_obj)) {
       calendar = handle(Handle<JSTemporalPlainDate>::cast(item_obj)->calendar(),
                         isolate);
-    } else if (item_obj->IsJSTemporalPlainDateTime()) {
+    } else if (IsJSTemporalPlainDateTime(*item_obj)) {
       calendar = handle(
           Handle<JSTemporalPlainDateTime>::cast(item_obj)->calendar(), isolate);
-    } else if (item_obj->IsJSTemporalPlainTime()) {
+    } else if (IsJSTemporalPlainTime(*item_obj)) {
       calendar = handle(Handle<JSTemporalPlainTime>::cast(item_obj)->calendar(),
                         isolate);
-    } else if (item_obj->IsJSTemporalPlainYearMonth()) {
+    } else if (IsJSTemporalPlainYearMonth(*item_obj)) {
       calendar =
           handle(Handle<JSTemporalPlainYearMonth>::cast(item_obj)->calendar(),
                  isolate);
-    } else if (item_obj->IsJSTemporalZonedDateTime()) {
+    } else if (IsJSTemporalZonedDateTime(*item_obj)) {
       calendar = handle(
           Handle<JSTemporalZonedDateTime>::cast(item_obj)->calendar(), isolate);
       // c. Else,
@@ -13507,7 +13542,7 @@ MaybeHandle<JSTemporalPlainMonthDay> ToTemporalMonthDay(
           JSReceiver::GetProperty(isolate, item, factory->calendar_string()),
           JSTemporalPlainMonthDay);
       // ii. If calendar is undefined, then
-      if (calendar_obj->IsUndefined()) {
+      if (IsUndefined(*calendar_obj)) {
         // 1. Let calendarAbsent be true.
         calendar_absent = true;
       }
@@ -13549,8 +13584,8 @@ MaybeHandle<JSTemporalPlainMonthDay> ToTemporalMonthDay(
         Handle<JSTemporalPlainMonthDay>());
     // i. If calendarAbsent is true, and month is not undefined, and monthCode
     // is undefined and year is undefined, then
-    if (calendar_absent && !month->IsUndefined() && month_code->IsUndefined() &&
-        year->IsUndefined()) {
+    if (calendar_absent && !IsUndefined(*month) && IsUndefined(*month_code) &&
+        IsUndefined(*year)) {
       // i. Perform ! CreateDataPropertyOrThrow(fields, "year",
       // 𝔽(referenceISOYear)).
       CHECK(JSReceiver::CreateDataProperty(
@@ -13630,7 +13665,7 @@ MaybeHandle<JSTemporalPlainMonthDay> JSTemporalPlainMonthDay::From(
       JSTemporalPlainMonthDay);
   // 2. If Type(item) is Object and item has an [[InitializedTemporalMonthDay]]
   // internal slot, then
-  if (item->IsJSTemporalPlainMonthDay()) {
+  if (IsJSTemporalPlainMonthDay(*item)) {
     // a. Perform ? ToTemporalOverflow(options).
     MAYBE_RETURN_ON_EXCEPTION_VALUE(
         isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -13702,7 +13737,7 @@ MaybeHandle<JSTemporalPlainDate> PlainMonthDayOrYearMonthToPlainDate(
   // 2. Perform ? RequireInternalSlot(monthDay,
   // [[InitializedTemporalXXX]]).
   // 3. If Type(item) is not Object, then
-  if (!item_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*item_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalPlainDate);
@@ -13755,7 +13790,7 @@ MaybeHandle<JSTemporalPlainDate> PlainMonthDayOrYearMonthToPlainDate(
   Handle<StringSet> added = StringSet::New(isolate);
   for (int i = 0; i < receiver_field_names->length(); i++) {
     Handle<Object> item(receiver_field_names->get(i), isolate);
-    DCHECK(item->IsString());
+    DCHECK(IsString(*item));
     Handle<String> string = Handle<String>::cast(item);
     if (!added->Has(isolate, string)) {
       merged_field_names->set(added->NumberOfElements(), *item);
@@ -13764,7 +13799,7 @@ MaybeHandle<JSTemporalPlainDate> PlainMonthDayOrYearMonthToPlainDate(
   }
   for (int i = 0; i < input_field_names->length(); i++) {
     Handle<Object> item(input_field_names->get(i), isolate);
-    DCHECK(item->IsString());
+    DCHECK(IsString(*item));
     Handle<String> string = Handle<String>::cast(item);
     if (!added->Has(isolate, string)) {
       merged_field_names->set(added->NumberOfElements(), *item);
@@ -13870,7 +13905,7 @@ MaybeHandle<JSTemporalPlainYearMonth> JSTemporalPlainYearMonth::Constructor(
     Handle<Object> calendar_like, Handle<Object> reference_iso_day_obj) {
   const char* method_name = "Temporal.PlainYearMonth";
   // 1. If NewTarget is undefined, throw a TypeError exception.
-  if (new_target->IsUndefined()) {
+  if (IsUndefined(*new_target)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -13896,7 +13931,7 @@ MaybeHandle<JSTemporalPlainYearMonth> JSTemporalPlainYearMonth::Constructor(
   // ...
   // 8. Let ref be ? ToIntegerThrowOnInfinity(referenceISODay).
   int32_t ref = 1;
-  if (!reference_iso_day_obj->IsUndefined()) {
+  if (!IsUndefined(*reference_iso_day_obj)) {
     TO_INT_THROW_ON_INFTY(reference_iso_day, JSTemporalPlainYearMonth);
     ref = reference_iso_day;
   }
@@ -13953,13 +13988,13 @@ MaybeHandle<JSTemporalPlainYearMonth> ToTemporalYearMonth(
   TEMPORAL_ENTER_FUNC();
 
   // 2. Assert: Type(options) is Object or Undefined.
-  DCHECK(options->IsJSReceiver() || options->IsUndefined());
+  DCHECK(IsJSReceiver(*options) || IsUndefined(*options));
   // 3. If Type(item) is Object, then
-  if (item_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*item_obj)) {
     Handle<JSReceiver> item = Handle<JSReceiver>::cast(item_obj);
     // a. If item has an [[InitializedTemporalYearMonth]] internal slot, then
     // i. Return item.
-    if (item_obj->IsJSTemporalPlainYearMonth()) {
+    if (IsJSTemporalPlainYearMonth(*item_obj)) {
       return Handle<JSTemporalPlainYearMonth>::cast(item_obj);
     }
 
@@ -14039,7 +14074,7 @@ MaybeHandle<JSTemporalPlainYearMonth> JSTemporalPlainYearMonth::From(
       JSTemporalPlainYearMonth);
   // 2. If Type(item) is Object and item has an [[InitializedTemporalYearMonth]]
   // internal slot, then
-  if (item->IsJSTemporalPlainYearMonth()) {
+  if (IsJSTemporalPlainYearMonth(*item)) {
     // a. Perform ? ToTemporalOverflow(options).
     MAYBE_RETURN_ON_EXCEPTION_VALUE(
         isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -14380,8 +14415,8 @@ MaybeHandle<JSTemporalDuration> DifferenceTemporalPlainYearMonth(
     MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, round_result,
         RoundDuration(isolate,
-                      {result->years().Number(),
-                       result->months().Number(),
+                      {Object::Number(result->years()),
+                       Object::Number(result->months()),
                        0,
                        {0, 0, 0, 0, 0, 0, 0}},
                       settings.rounding_increment, settings.smallest_unit,
@@ -14397,10 +14432,11 @@ MaybeHandle<JSTemporalDuration> DifferenceTemporalPlainYearMonth(
   }
   // 16. Return ! CreateTemporalDuration(sign × result.[[Years]], sign ×
   // result.[[Months]], 0, 0, 0, 0, 0, 0, 0, 0).
-  return CreateTemporalDuration(isolate, {result->years().Number() * sign,
-                                          result->months().Number() * sign,
-                                          0,
-                                          {0, 0, 0, 0, 0, 0, 0}})
+  return CreateTemporalDuration(isolate,
+                                {Object::Number(result->years()) * sign,
+                                 Object::Number(result->months()) * sign,
+                                 0,
+                                 {0, 0, 0, 0, 0, 0, 0}})
       .ToHandleChecked();
 }
 
@@ -14519,7 +14555,7 @@ MaybeHandle<JSTemporalPlainTime> JSTemporalPlainTime::Constructor(
   const char* method_name = "Temporal.PlainTime";
   // 1. If NewTarget is undefined, then
   // a. Throw a TypeError exception.
-  if (new_target->IsUndefined()) {
+  if (IsUndefined(*new_target)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
@@ -14552,7 +14588,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalPlainTime::ToZonedDateTime(
   // 2. Perform ? RequireInternalSlot(temporalTime,
   // [[InitializedTemporalTime]]).
   // 3. If Type(item) is not Object, then
-  if (!item_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*item_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalZonedDateTime);
@@ -14565,7 +14601,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalPlainTime::ToZonedDateTime(
       JSReceiver::GetProperty(isolate, item, factory->plainDate_string()),
       JSTemporalZonedDateTime);
   // 5. If temporalDateLike is undefined, then
-  if (temporal_date_like->IsUndefined()) {
+  if (IsUndefined(*temporal_date_like)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalZonedDateTime);
@@ -14583,7 +14619,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalPlainTime::ToZonedDateTime(
       JSReceiver::GetProperty(isolate, item, factory->timeZone_string()),
       JSTemporalZonedDateTime);
   // 8. If temporalTimeZoneLike is undefined, then
-  if (temporal_time_zone_like->IsUndefined()) {
+  if (IsUndefined(*temporal_time_zone_like)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalZonedDateTime);
@@ -14776,7 +14812,7 @@ MaybeHandle<JSTemporalPlainTime> JSTemporalPlainTime::Round(
   // 2. Perform ? RequireInternalSlot(temporalTime,
   // [[InitializedTemporalTime]]).
   // 3. If roundTo is undefined, then
-  if (round_to_obj->IsUndefined()) {
+  if (IsUndefined(*round_to_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalPlainTime);
@@ -14784,7 +14820,7 @@ MaybeHandle<JSTemporalPlainTime> JSTemporalPlainTime::Round(
 
   Handle<JSReceiver> round_to;
   // 4. If Type(roundTo) is String, then
-  if (round_to_obj->IsString()) {
+  if (IsString(*round_to_obj)) {
     // a. Let paramString be roundTo.
     Handle<String> param_string = Handle<String>::cast(round_to_obj);
     // b. Set roundTo to ! OrdinaryObjectCreate(null).
@@ -14857,7 +14893,7 @@ MaybeHandle<JSTemporalPlainTime> JSTemporalPlainTime::With(
   // 2. Perform ? RequireInternalSlot(temporalTime,
   // [[InitializedTemporalTime]]).
   // 3. If Type(temporalTimeLike) is not Object, then
-  if (!temporal_time_like_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*temporal_time_like_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalPlainTime);
@@ -14941,7 +14977,7 @@ MaybeHandle<JSTemporalPlainTime> JSTemporalPlainTime::From(
       Handle<JSTemporalPlainTime>());
   // 3. If Type(item) is Object and item has an [[InitializedTemporalTime]]
   // internal slot, then
-  if (item_obj->IsJSTemporalPlainTime()) {
+  if (IsJSTemporalPlainTime(*item_obj)) {
     // a. Return ? CreateTemporalTime(item.[[ISOHour]], item.[[ISOMinute]],
     // item.[[ISOSecond]], item.[[ISOMillisecond]], item.[[ISOMicrosecond]],
     // item.[[ISONanosecond]]).
@@ -15609,9 +15645,9 @@ Maybe<StringPrecision> ToSecondsStringPrecision(
       Nothing<StringPrecision>());
 
   // 10. If Type(fractionalDigitsVal) is not Number, then
-  if (!fractional_digits_val->IsNumber()) {
+  if (!IsNumber(*fractional_digits_val)) {
     // a. If fractionalDigitsVal is not undefined, then
-    if (!fractional_digits_val->IsUndefined()) {
+    if (!IsUndefined(*fractional_digits_val)) {
       // i. If ? ToString(fractionalDigitsVal) is not "auto", throw a RangeError
       // exception.
       Handle<String> string;
@@ -15632,8 +15668,8 @@ Maybe<StringPrecision> ToSecondsStringPrecision(
   }
   // 11. If fractionalDigitsVal is NaN, +∞𝔽, or -∞𝔽, throw a RangeError
   // exception.
-  if (fractional_digits_val->IsNaN() ||
-      std::isinf(fractional_digits_val->Number())) {
+  if (IsNaN(*fractional_digits_val) ||
+      std::isinf(Object::Number(*fractional_digits_val))) {
     THROW_NEW_ERROR_RETURN_VALUE(
         isolate,
         NewRangeError(MessageTemplate::kPropertyValueOutOfRange,
@@ -15642,7 +15678,7 @@ Maybe<StringPrecision> ToSecondsStringPrecision(
   }
   // 12. Let fractionalDigitCount be RoundTowardsZero(ℝ(fractionalDigitsVal)).
   int64_t fractional_digit_count =
-      RoundTowardsZero(fractional_digits_val->Number());
+      RoundTowardsZero(Object::Number(*fractional_digits_val));
   // 13. If fractionalDigitCount < 0 or fractionalDigitCount > 9, throw a
   // RangeError exception.
   if (fractional_digit_count < 0 || fractional_digit_count > 9) {
@@ -15760,7 +15796,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalZonedDateTime::Constructor(
     Handle<Object> calendar_like) {
   const char* method_name = "Temporal.ZonedDateTime";
   // 1. If NewTarget is undefined, then
-  if (new_target->IsUndefined()) {
+  if (IsUndefined(*new_target)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
@@ -15904,7 +15940,7 @@ MaybeHandle<JSTemporalZonedDateTime> ToTemporalZonedDateTime(
 
   Factory* factory = isolate->factory();
   // 2. Assert: Type(options) is Object or Undefined.
-  DCHECK(options->IsUndefined() || options->IsJSReceiver());
+  DCHECK(IsUndefined(*options) || IsJSReceiver(*options));
   // 3. Let offsetBehaviour be option.
   OffsetBehaviour offset_behaviour = OffsetBehaviour::kOption;
   // 4. Let matchBehaviour be match exactly.
@@ -15917,11 +15953,11 @@ MaybeHandle<JSTemporalZonedDateTime> ToTemporalZonedDateTime(
   temporal::DateTimeRecord result;
 
   // 5. If Type(item) is Object, then
-  if (item_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*item_obj)) {
     Handle<JSReceiver> item = Handle<JSReceiver>::cast(item_obj);
     // a. If item has an [[InitializedTemporalZonedDateTime]] internal slot,
     // then
-    if (item_obj->IsJSTemporalZonedDateTime()) {
+    if (IsJSTemporalZonedDateTime(*item_obj)) {
       // i. Return item.
       return Handle<JSTemporalZonedDateTime>::cast(item_obj);
     }
@@ -15975,7 +16011,7 @@ MaybeHandle<JSTemporalZonedDateTime> ToTemporalZonedDateTime(
         JSTemporalZonedDateTime);
 
     // j. If offsetString is undefined, then
-    if (offset_string->IsUndefined()) {
+    if (IsUndefined(*offset_string)) {
       // i. Set offsetBehaviour to wall.
       offset_behaviour = OffsetBehaviour::kWall;
       // k. Else,
@@ -16014,7 +16050,7 @@ MaybeHandle<JSTemporalZonedDateTime> ToTemporalZonedDateTime(
 
     // d. Let timeZoneName be result.[[TimeZone]].[[Name]].
     // e. Assert: timeZoneName is not undefined.
-    DCHECK(!parsed_result.time_zone.name->IsUndefined());
+    DCHECK(!IsUndefined(*parsed_result.time_zone.name));
     Handle<String> time_zone_name =
         Handle<String>::cast(parsed_result.time_zone.name);
 
@@ -16041,7 +16077,7 @@ MaybeHandle<JSTemporalZonedDateTime> ToTemporalZonedDateTime(
       // i. Set offsetBehaviour to exact.
       offset_behaviour = OffsetBehaviour::kExact;
       // i. Else if offsetString is undefined, then
-    } else if (offset_string->IsUndefined()) {
+    } else if (IsUndefined(*offset_string)) {
       // i. Set offsetBehaviour to wall.
       offset_behaviour = OffsetBehaviour::kWall;
     }
@@ -16064,7 +16100,7 @@ MaybeHandle<JSTemporalZonedDateTime> ToTemporalZonedDateTime(
   // 6. If offsetBehaviour is option, then
   if (offset_behaviour == OffsetBehaviour::kOption) {
     // a. Set offsetNanoseconds to ? ParseTimeZoneOffsetString(offsetString).
-    DCHECK(offset_string->IsString());
+    DCHECK(IsString(*offset_string));
     MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, offset_nanoseconds,
         ParseTimeZoneOffsetString(isolate, Handle<String>::cast(offset_string)),
@@ -16126,7 +16162,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalZonedDateTime::From(
 
   // 2. If Type(item) is Object and item has an
   // [[InitializedTemporalZonedDateTime]] internal slot, then
-  if (item->IsJSTemporalZonedDateTime()) {
+  if (IsJSTemporalZonedDateTime(*item)) {
     // a. Perform ? ToTemporalOverflow(options).
     MAYBE_RETURN_ON_EXCEPTION_VALUE(
         isolate, ToTemporalOverflow(isolate, options, method_name),
@@ -16321,7 +16357,7 @@ MaybeHandle<BigInt> InterpretISODateTimeOffset(
 
   // 9. For each element candidate of possibleInstants, do
   for (int i = 0; i < possible_instants->length(); i++) {
-    DCHECK(possible_instants->get(i).IsJSTemporalInstant());
+    DCHECK(IsJSTemporalInstant(possible_instants->get(i)));
     Handle<JSTemporalInstant> candidate(
         JSTemporalInstant::cast(possible_instants->get(i)), isolate);
     // a. Let candidateNanoseconds be ? GetOffsetNanosecondsFor(timeZone,
@@ -16379,7 +16415,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalZonedDateTime::With(
   // 2. Perform ? RequireInternalSlot(zonedDateTime,
   // [[InitializedTemporalZonedDateTime]]).
   // 3. If Type(temporalZonedDateTimeLike) is not Object, then
-  if (!temporal_zoned_date_time_like_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*temporal_zoned_date_time_like_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalZonedDateTime);
@@ -16477,7 +16513,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalZonedDateTime::With(
       JSTemporalZonedDateTime);
 
   // 18. Assert: Type(offsetString) is String.
-  DCHECK(offset_string->IsString());
+  DCHECK(IsString(*offset_string));
 
   // 19. Let dateTimeResult be ? InterpretTemporalDateTimeFields(calendar,
   // fields, options).
@@ -16627,7 +16663,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalZonedDateTime::WithPlainTime(
   // [[InitializedTemporalZonedDateTime]]).
   // 3. If plainTimeLike is undefined, then
   Handle<JSTemporalPlainTime> plain_time;
-  if (plain_time_like->IsUndefined()) {
+  if (IsUndefined(*plain_time_like)) {
     // a. Let plainTime be ? CreateTemporalTime(0, 0, 0, 0, 0, 0).
     ASSIGN_RETURN_ON_EXCEPTION(isolate, plain_time,
                                CreateTemporalTime(isolate, {0, 0, 0, 0, 0, 0}),
@@ -17021,7 +17057,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalZonedDateTime::Round(
   // 2. Perform ? RequireInternalSlot(zonedDateTime,
   // [[InitializedTemporalZonedDateTime]]).
   // 3. If roundTo is undefined, then
-  if (round_to_obj->IsUndefined()) {
+  if (IsUndefined(*round_to_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalZonedDateTime);
@@ -17029,7 +17065,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalZonedDateTime::Round(
 
   Handle<JSReceiver> round_to;
   // 4. If Type(roundTo) is String, then
-  if (round_to_obj->IsString()) {
+  if (IsString(*round_to_obj)) {
     // a. Let paramString be roundTo.
     Handle<String> param_string = Handle<String>::cast(round_to_obj);
     // b. Set roundTo to ! OrdinaryObjectCreate(null).
@@ -17148,7 +17184,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalZonedDateTime::Round(
         temporal_date_time->iso_microsecond(),
         temporal_date_time->iso_nanosecond()}},
       rounding_increment, smallest_unit, rounding_mode,
-      BigInt::ToNumber(isolate, day_length_ns)->Number());
+      Object::Number(*BigInt::ToNumber(isolate, day_length_ns)));
   // 21. Let offsetNanoseconds be ? GetOffsetNanosecondsFor(timeZone, instant).
   int64_t offset_nanoseconds;
   MAYBE_ASSIGN_RETURN_ON_EXCEPTION_VALUE(
@@ -17718,7 +17754,7 @@ MaybeHandle<JSTemporalInstant> JSTemporalInstant::Constructor(
     Handle<Object> epoch_nanoseconds_obj) {
   TEMPORAL_ENTER_FUNC();
   // 1. If NewTarget is undefined, then
-  if (new_target->IsUndefined()) {
+  if (IsUndefined(*new_target)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kMethodInvokedOnWrongType,
@@ -17984,14 +18020,14 @@ MaybeHandle<JSTemporalInstant> JSTemporalInstant::Round(
   // 1. Let instant be the this value.
   // 2. Perform ? RequireInternalSlot(instant, [[InitializedTemporalInstant]]).
   // 3. If roundTo is undefined, then
-  if (round_to_obj->IsUndefined()) {
+  if (IsUndefined(*round_to_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalInstant);
   }
   Handle<JSReceiver> round_to;
   // 4. If Type(roundTo) is String, then
-  if (round_to_obj->IsString()) {
+  if (IsString(*round_to_obj)) {
     // a. Let paramString be roundTo.
     Handle<String> param_string = Handle<String>::cast(round_to_obj);
     // b. Set roundTo to ! OrdinaryObjectCreate(null).
@@ -18083,10 +18119,11 @@ MaybeHandle<JSTemporalInstant> JSTemporalInstant::From(Isolate* isolate,
   TEMPORAL_ENTER_FUNC();
   //  1. If Type(item) is Object and item has an [[InitializedTemporalInstant]]
   //  internal slot, then
-  if (item->IsJSTemporalInstant()) {
+  if (IsJSTemporalInstant(*item)) {
     // a. Return ? CreateTemporalInstant(item.[[Nanoseconds]]).
     return temporal::CreateTemporalInstant(
-        isolate, handle(JSTemporalInstant::cast(*item).nanoseconds(), isolate));
+        isolate,
+        handle(JSTemporalInstant::cast(*item)->nanoseconds(), isolate));
   }
   // 2. Return ? ToTemporalInstant(item).
   return ToTemporalInstant(isolate, item, "Temporal.Instant.from");
@@ -18102,7 +18139,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalInstant::ToZonedDateTime(
   // 1. Let instant be the this value.
   // 2. Perform ? RequireInternalSlot(instant, [[InitializedTemporalInstant]]).
   // 3. If Type(item) is not Object, then
-  if (!item_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*item_obj)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalZonedDateTime);
@@ -18115,7 +18152,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalInstant::ToZonedDateTime(
       JSReceiver::GetProperty(isolate, item, factory->calendar_string()),
       JSTemporalZonedDateTime);
   // 5. If calendarLike is undefined, then
-  if (calendar_like->IsUndefined()) {
+  if (IsUndefined(*calendar_like)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalZonedDateTime);
@@ -18134,7 +18171,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalInstant::ToZonedDateTime(
       JSReceiver::GetProperty(isolate, item, factory->timeZone_string()),
       JSTemporalZonedDateTime);
   // 8. If temporalTimeZoneLike is undefined, then
-  if (calendar_like->IsUndefined()) {
+  if (IsUndefined(*calendar_like)) {
     // a. Throw a TypeError exception.
     THROW_NEW_ERROR(isolate, NEW_TEMPORAL_INVALID_ARG_TYPE_ERROR(),
                     JSTemporalZonedDateTime);
@@ -18167,11 +18204,11 @@ MaybeHandle<String> TemporalInstantToString(Isolate* isolate,
   Handle<JSReceiver> output_time_zone;
 
   // 4. If outputTimeZone is undefined, then
-  if (time_zone_obj->IsUndefined()) {
+  if (IsUndefined(*time_zone_obj)) {
     // a. Set outputTimeZone to ! CreateTemporalTimeZone("UTC").
     output_time_zone = CreateTemporalTimeZoneUTC(isolate);
   } else {
-    DCHECK(time_zone_obj->IsJSReceiver());
+    DCHECK(IsJSReceiver(*time_zone_obj));
     output_time_zone = Handle<JSReceiver>::cast(time_zone_obj);
   }
 
@@ -18209,12 +18246,12 @@ MaybeHandle<String> TemporalInstantToString(Isolate* isolate,
   builder.AppendString(date_time_string);
 
   // 8. If timeZone is undefined, then
-  if (time_zone_obj->IsUndefined()) {
+  if (IsUndefined(*time_zone_obj)) {
     // a. Let timeZoneString be "Z".
     builder.AppendCharacter('Z');
   } else {
     // 9. Else,
-    DCHECK(time_zone_obj->IsJSReceiver());
+    DCHECK(IsJSReceiver(*time_zone_obj));
     Handle<JSReceiver> time_zone = Handle<JSReceiver>::cast(time_zone_obj);
 
     // a. Let offsetNs be ? GetOffsetNanosecondsFor(timeZone, instant).
@@ -18283,7 +18320,7 @@ MaybeHandle<String> JSTemporalInstant::ToString(
       String);
 
   // 5. If timeZone is not undefined, then
-  if (!time_zone->IsUndefined()) {
+  if (!IsUndefined(*time_zone)) {
     // a. Set timeZone to ? ToTemporalTimeZone(timeZone).
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, time_zone,
@@ -18328,7 +18365,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalInstant::ToZonedDateTimeISO(
   // 1. Let instant be the this value.
   // 2. Perform ? RequireInternalSlot(instant, [[InitializedTemporalInstant]]).
   // 3. If Type(item) is Object, then
-  if (item_obj->IsJSReceiver()) {
+  if (IsJSReceiver(*item_obj)) {
     Handle<JSReceiver> item = Handle<JSReceiver>::cast(item_obj);
     // a. Let timeZoneProperty be ? Get(item, "timeZone").
     Handle<Object> time_zone_property;
@@ -18337,7 +18374,7 @@ MaybeHandle<JSTemporalZonedDateTime> JSTemporalInstant::ToZonedDateTimeISO(
         JSReceiver::GetProperty(isolate, item, factory->timeZone_string()),
         JSTemporalZonedDateTime);
     // b. If timeZoneProperty is not undefined, then
-    if (!time_zone_property->IsUndefined()) {
+    if (!IsUndefined(*time_zone_property)) {
       // i. Set item to timeZoneProperty.
       item_obj = time_zone_property;
     }
@@ -18554,16 +18591,12 @@ TimeDurationRecord DifferenceInstant(Isolate* isolate, Handle<BigInt> ns1,
   // RoundDuration.
   Handle<BigInt> nanoseconds_in_a_hour =
       BigInt::FromUint64(isolate, 3600000000000);
-  double diff_hours =
-      BigInt::ToNumber(isolate,
-                       BigInt::Divide(isolate, diff, nanoseconds_in_a_hour)
-                           .ToHandleChecked())
-          ->Number();
-  double diff_nanoseconds =
-      BigInt::ToNumber(isolate,
-                       BigInt::Remainder(isolate, diff, nanoseconds_in_a_hour)
-                           .ToHandleChecked())
-          ->Number();
+  double diff_hours = Object::Number(*BigInt::ToNumber(
+      isolate,
+      BigInt::Divide(isolate, diff, nanoseconds_in_a_hour).ToHandleChecked()));
+  double diff_nanoseconds = Object::Number(*BigInt::ToNumber(
+      isolate, BigInt::Remainder(isolate, diff, nanoseconds_in_a_hour)
+                   .ToHandleChecked()));
   DurationRecordWithRemainder round_record =
       RoundDuration(
           isolate, {0, 0, 0, {0, diff_hours, 0, 0, 0, 0, diff_nanoseconds}},
@@ -18675,8 +18708,8 @@ MaybeHandle<Oddball> IsInvalidTemporalCalendarField(
   Factory* factory = isolate->factory();
   // iii. iii. If fieldNames contains nextValue, then
   for (int i = 0; i < fields_name->length(); i++) {
-    Object item = fields_name->get(i);
-    DCHECK(item.IsString());
+    Tagged<Object> item = fields_name->get(i);
+    DCHECK(IsString(item));
     if (String::Equals(isolate, next_value,
                        handle(String::cast(item), isolate))) {
       return isolate->factory()->true_value();
diff --git a/deps/v8/src/objects/js-weak-refs-inl.h b/deps/v8/src/objects/js-weak-refs-inl.h
index 0385d59efb7e56..efb2ed15be19a5 100644
--- a/deps/v8/src/objects/js-weak-refs-inl.h
+++ b/deps/v8/src/objects/js-weak-refs-inl.h
@@ -29,7 +29,7 @@ void JSFinalizationRegistry::RegisterWeakCellWithUnregisterToken(
     Handle<JSFinalizationRegistry> finalization_registry,
     Handle<WeakCell> weak_cell, Isolate* isolate) {
   Handle<SimpleNumberDictionary> key_map;
-  if (finalization_registry->key_map().IsUndefined(isolate)) {
+  if (IsUndefined(finalization_registry->key_map(), isolate)) {
     key_map = SimpleNumberDictionary::New(isolate, 1);
   } else {
     key_map =
@@ -40,12 +40,13 @@ void JSFinalizationRegistry::RegisterWeakCellWithUnregisterToken(
   // Unregister tokens are held weakly as objects are often their own
   // unregister token. To avoid using an ephemeron map, the map for token
   // lookup is keyed on the token's identity hash instead of the token itself.
-  uint32_t key = weak_cell->unregister_token().GetOrCreateHash(isolate).value();
+  uint32_t key =
+      Object::GetOrCreateHash(weak_cell->unregister_token(), isolate).value();
   InternalIndex entry = key_map->FindEntry(isolate, key);
   if (entry.is_found()) {
-    Object value = key_map->ValueAt(entry);
-    WeakCell existing_weak_cell = WeakCell::cast(value);
-    existing_weak_cell.set_key_list_prev(*weak_cell);
+    Tagged<Object> value = key_map->ValueAt(entry);
+    Tagged<WeakCell> existing_weak_cell = WeakCell::cast(value);
+    existing_weak_cell->set_key_list_prev(*weak_cell);
     weak_cell->set_key_list_next(existing_weak_cell);
   }
   key_map = SimpleNumberDictionary::Set(isolate, key_map, key, weak_cell);
@@ -60,105 +61,105 @@ bool JSFinalizationRegistry::Unregister(
   // its FinalizationRegistry; remove it from there.
   return finalization_registry->RemoveUnregisterToken(
       *unregister_token, isolate, kRemoveMatchedCellsFromRegistry,
-      [](HeapObject, ObjectSlot, Object) {});
+      [](Tagged<HeapObject>, ObjectSlot, Tagged<Object>) {});
 }
 
 template <typename GCNotifyUpdatedSlotCallback>
 bool JSFinalizationRegistry::RemoveUnregisterToken(
-    HeapObject unregister_token, Isolate* isolate,
+    Tagged<HeapObject> unregister_token, Isolate* isolate,
     RemoveUnregisterTokenMode removal_mode,
     GCNotifyUpdatedSlotCallback gc_notify_updated_slot) {
   // This method is called from both FinalizationRegistry#unregister and for
   // removing weakly-held dead unregister tokens. The latter is during GC so
   // this function cannot GC.
   DisallowGarbageCollection no_gc;
-  if (key_map().IsUndefined(isolate)) {
+  if (IsUndefined(key_map(), isolate)) {
     return false;
   }
 
-  SimpleNumberDictionary key_map =
+  Tagged<SimpleNumberDictionary> key_map =
       SimpleNumberDictionary::cast(this->key_map());
   // If the token doesn't have a hash, it was not used as a key inside any hash
   // tables.
-  Object hash = unregister_token.GetHash();
-  if (hash.IsUndefined(isolate)) {
+  Tagged<Object> hash = Object::GetHash(unregister_token);
+  if (IsUndefined(hash, isolate)) {
     return false;
   }
   uint32_t key = Smi::ToInt(hash);
-  InternalIndex entry = key_map.FindEntry(isolate, key);
+  InternalIndex entry = key_map->FindEntry(isolate, key);
   if (entry.is_not_found()) {
     return false;
   }
 
-  Object value = key_map.ValueAt(entry);
+  Tagged<Object> value = key_map->ValueAt(entry);
   bool was_present = false;
-  HeapObject undefined = ReadOnlyRoots(isolate).undefined_value();
-  HeapObject new_key_list_head = undefined;
-  HeapObject new_key_list_prev = undefined;
+  Tagged<HeapObject> undefined = ReadOnlyRoots(isolate).undefined_value();
+  Tagged<HeapObject> new_key_list_head = undefined;
+  Tagged<HeapObject> new_key_list_prev = undefined;
   // Compute a new key list that doesn't have unregister_token. Because
   // unregister tokens are held weakly, key_map is keyed using the tokens'
   // identity hashes, and identity hashes may collide.
-  while (!value.IsUndefined(isolate)) {
-    WeakCell weak_cell = WeakCell::cast(value);
+  while (!IsUndefined(value, isolate)) {
+    Tagged<WeakCell> weak_cell = WeakCell::cast(value);
     DCHECK(!ObjectInYoungGeneration(weak_cell));
-    value = weak_cell.key_list_next();
-    if (weak_cell.unregister_token() == unregister_token) {
+    value = weak_cell->key_list_next();
+    if (weak_cell->unregister_token() == unregister_token) {
       // weak_cell has the same unregister token; remove it from the key list.
       switch (removal_mode) {
         case kRemoveMatchedCellsFromRegistry:
-          weak_cell.RemoveFromFinalizationRegistryCells(isolate);
+          weak_cell->RemoveFromFinalizationRegistryCells(isolate);
           break;
         case kKeepMatchedCellsInRegistry:
           // Do nothing.
           break;
       }
       // Clear unregister token-related fields.
-      weak_cell.set_unregister_token(undefined);
-      weak_cell.set_key_list_prev(undefined);
-      weak_cell.set_key_list_next(undefined);
+      weak_cell->set_unregister_token(undefined);
+      weak_cell->set_key_list_prev(undefined);
+      weak_cell->set_key_list_next(undefined);
       was_present = true;
     } else {
       // weak_cell has a different unregister token with the same key (hash
       // collision); fix up the list.
-      weak_cell.set_key_list_prev(new_key_list_prev);
+      weak_cell->set_key_list_prev(new_key_list_prev);
       gc_notify_updated_slot(weak_cell,
-                             weak_cell.RawField(WeakCell::kKeyListPrevOffset),
+                             weak_cell->RawField(WeakCell::kKeyListPrevOffset),
                              new_key_list_prev);
-      weak_cell.set_key_list_next(undefined);
-      if (new_key_list_prev.IsUndefined(isolate)) {
+      weak_cell->set_key_list_next(undefined);
+      if (IsUndefined(new_key_list_prev, isolate)) {
         new_key_list_head = weak_cell;
       } else {
-        DCHECK(new_key_list_head.IsWeakCell());
-        WeakCell prev_cell = WeakCell::cast(new_key_list_prev);
-        prev_cell.set_key_list_next(weak_cell);
-        gc_notify_updated_slot(prev_cell,
-                               prev_cell.RawField(WeakCell::kKeyListNextOffset),
-                               weak_cell);
+        DCHECK(IsWeakCell(new_key_list_head));
+        Tagged<WeakCell> prev_cell = WeakCell::cast(new_key_list_prev);
+        prev_cell->set_key_list_next(weak_cell);
+        gc_notify_updated_slot(
+            prev_cell, prev_cell->RawField(WeakCell::kKeyListNextOffset),
+            weak_cell);
       }
       new_key_list_prev = weak_cell;
     }
   }
-  if (new_key_list_head.IsUndefined(isolate)) {
+  if (IsUndefined(new_key_list_head, isolate)) {
     DCHECK(was_present);
-    key_map.ClearEntry(entry);
-    key_map.ElementRemoved();
+    key_map->ClearEntry(entry);
+    key_map->ElementRemoved();
   } else {
-    key_map.ValueAtPut(entry, new_key_list_head);
-    gc_notify_updated_slot(key_map, key_map.RawFieldOfValueAt(entry),
+    key_map->ValueAtPut(entry, new_key_list_head);
+    gc_notify_updated_slot(key_map, key_map->RawFieldOfValueAt(entry),
                            new_key_list_head);
   }
   return was_present;
 }
 
 bool JSFinalizationRegistry::NeedsCleanup() const {
-  return cleared_cells().IsWeakCell();
+  return IsWeakCell(cleared_cells());
 }
 
-HeapObject WeakCell::relaxed_target() const {
+Tagged<HeapObject> WeakCell::relaxed_target() const {
   return TaggedField<HeapObject>::Relaxed_Load(*this, kTargetOffset);
 }
 
-HeapObject WeakCell::relaxed_unregister_token() const {
+Tagged<HeapObject> WeakCell::relaxed_unregister_token() const {
   return TaggedField<HeapObject>::Relaxed_Load(*this, kUnregisterTokenOffset);
 }
 
@@ -170,44 +171,44 @@ void WeakCell::Nullify(Isolate* isolate,
   // only called for WeakCells which haven't been unregistered yet, so they will
   // be in the active_cells list. (The caller must guard against calling this
   // for unregistered WeakCells by checking that the target is not undefined.)
-  DCHECK(target().CanBeHeldWeakly());
+  DCHECK(Object::CanBeHeldWeakly(target()));
   set_target(ReadOnlyRoots(isolate).undefined_value());
 
-  JSFinalizationRegistry fr =
+  Tagged<JSFinalizationRegistry> fr =
       JSFinalizationRegistry::cast(finalization_registry());
-  if (prev().IsWeakCell()) {
-    DCHECK_NE(fr.active_cells(), *this);
-    WeakCell prev_cell = WeakCell::cast(prev());
-    prev_cell.set_next(next());
-    gc_notify_updated_slot(prev_cell, prev_cell.RawField(WeakCell::kNextOffset),
-                           next());
+  if (IsWeakCell(prev())) {
+    DCHECK_NE(fr->active_cells(), *this);
+    Tagged<WeakCell> prev_cell = WeakCell::cast(prev());
+    prev_cell->set_next(next());
+    gc_notify_updated_slot(prev_cell,
+                           prev_cell->RawField(WeakCell::kNextOffset), next());
   } else {
-    DCHECK_EQ(fr.active_cells(), *this);
-    fr.set_active_cells(next());
+    DCHECK_EQ(fr->active_cells(), *this);
+    fr->set_active_cells(next());
     gc_notify_updated_slot(
-        fr, fr.RawField(JSFinalizationRegistry::kActiveCellsOffset), next());
+        fr, fr->RawField(JSFinalizationRegistry::kActiveCellsOffset), next());
   }
-  if (next().IsWeakCell()) {
-    WeakCell next_cell = WeakCell::cast(next());
-    next_cell.set_prev(prev());
-    gc_notify_updated_slot(next_cell, next_cell.RawField(WeakCell::kPrevOffset),
-                           prev());
+  if (IsWeakCell(next())) {
+    Tagged<WeakCell> next_cell = WeakCell::cast(next());
+    next_cell->set_prev(prev());
+    gc_notify_updated_slot(next_cell,
+                           next_cell->RawField(WeakCell::kPrevOffset), prev());
   }
 
   set_prev(ReadOnlyRoots(isolate).undefined_value());
-  Object cleared_head = fr.cleared_cells();
-  if (cleared_head.IsWeakCell()) {
-    WeakCell cleared_head_cell = WeakCell::cast(cleared_head);
-    cleared_head_cell.set_prev(*this);
+  Tagged<Object> cleared_head = fr->cleared_cells();
+  if (IsWeakCell(cleared_head)) {
+    Tagged<WeakCell> cleared_head_cell = WeakCell::cast(cleared_head);
+    cleared_head_cell->set_prev(*this);
     gc_notify_updated_slot(cleared_head_cell,
-                           cleared_head_cell.RawField(WeakCell::kPrevOffset),
+                           cleared_head_cell->RawField(WeakCell::kPrevOffset),
                            *this);
   }
-  set_next(fr.cleared_cells());
+  set_next(fr->cleared_cells());
   gc_notify_updated_slot(*this, RawField(WeakCell::kNextOffset), next());
-  fr.set_cleared_cells(*this);
+  fr->set_cleared_cells(*this);
   gc_notify_updated_slot(
-      fr, fr.RawField(JSFinalizationRegistry::kClearedCellsOffset), *this);
+      fr, fr->RawField(JSFinalizationRegistry::kClearedCellsOffset), *this);
 }
 
 void WeakCell::RemoveFromFinalizationRegistryCells(Isolate* isolate) {
@@ -216,25 +217,25 @@ void WeakCell::RemoveFromFinalizationRegistryCells(Isolate* isolate) {
 
   // It's important to set_target to undefined here. This guards that we won't
   // call Nullify (which assumes that the WeakCell is in active_cells).
-  DCHECK(target().IsUndefined() || target().CanBeHeldWeakly());
+  DCHECK(IsUndefined(target()) || Object::CanBeHeldWeakly(target()));
   set_target(ReadOnlyRoots(isolate).undefined_value());
 
-  JSFinalizationRegistry fr =
+  Tagged<JSFinalizationRegistry> fr =
       JSFinalizationRegistry::cast(finalization_registry());
-  if (fr.active_cells() == *this) {
-    DCHECK(prev().IsUndefined(isolate));
-    fr.set_active_cells(next());
-  } else if (fr.cleared_cells() == *this) {
-    DCHECK(!prev().IsWeakCell());
-    fr.set_cleared_cells(next());
+  if (fr->active_cells() == *this) {
+    DCHECK(IsUndefined(prev(), isolate));
+    fr->set_active_cells(next());
+  } else if (fr->cleared_cells() == *this) {
+    DCHECK(!IsWeakCell(prev()));
+    fr->set_cleared_cells(next());
   } else {
-    DCHECK(prev().IsWeakCell());
-    WeakCell prev_cell = WeakCell::cast(prev());
-    prev_cell.set_next(next());
+    DCHECK(IsWeakCell(prev()));
+    Tagged<WeakCell> prev_cell = WeakCell::cast(prev());
+    prev_cell->set_next(next());
   }
-  if (next().IsWeakCell()) {
-    WeakCell next_cell = WeakCell::cast(next());
-    next_cell.set_prev(prev());
+  if (IsWeakCell(next())) {
+    Tagged<WeakCell> next_cell = WeakCell::cast(next());
+    next_cell->set_prev(prev());
   }
   set_prev(ReadOnlyRoots(isolate).undefined_value());
   set_next(ReadOnlyRoots(isolate).undefined_value());
diff --git a/deps/v8/src/objects/js-weak-refs.h b/deps/v8/src/objects/js-weak-refs.h
index 64ff9573f6b2df..81b78f046d583e 100644
--- a/deps/v8/src/objects/js-weak-refs.h
+++ b/deps/v8/src/objects/js-weak-refs.h
@@ -49,7 +49,7 @@ class JSFinalizationRegistry
   };
   template <typename GCNotifyUpdatedSlotCallback>
   inline bool RemoveUnregisterToken(
-      HeapObject unregister_token, Isolate* isolate,
+      Tagged<HeapObject> unregister_token, Isolate* isolate,
       RemoveUnregisterTokenMode removal_mode,
       GCNotifyUpdatedSlotCallback gc_notify_updated_slot);
 
@@ -80,10 +80,10 @@ class WeakCell : public TorqueGeneratedWeakCell<WeakCell, HeapObject> {
   class BodyDescriptor;
 
   // Provide relaxed load access to target field.
-  inline HeapObject relaxed_target() const;
+  inline Tagged<HeapObject> relaxed_target() const;
 
   // Provide relaxed load access to the unregister token field.
-  inline HeapObject relaxed_unregister_token() const;
+  inline Tagged<HeapObject> relaxed_unregister_token() const;
 
   // Nullify is called during GC and it modifies the pointers in WeakCell and
   // JSFinalizationRegistry. Thus we need to tell the GC about the modified
diff --git a/deps/v8/src/objects/keys.cc b/deps/v8/src/objects/keys.cc
index 98a39b6b86211a..15a2fcd6077393 100644
--- a/deps/v8/src/objects/keys.cc
+++ b/deps/v8/src/objects/keys.cc
@@ -5,6 +5,7 @@
 #include "src/objects/keys.h"
 
 #include "src/api/api-arguments-inl.h"
+#include "src/api/api.h"
 #include "src/common/assert-scope.h"
 #include "src/common/globals.h"
 #include "src/execution/isolate-inl.h"
@@ -43,13 +44,13 @@ namespace {
 static bool ContainsOnlyValidKeys(Handle<FixedArray> array) {
   int len = array->length();
   for (int i = 0; i < len; i++) {
-    Object e = array->get(i);
-    if (!(e.IsName() || e.IsNumber())) return false;
+    Tagged<Object> e = array->get(i);
+    if (!(IsName(e) || IsNumber(e))) return false;
   }
   return true;
 }
 
-static int AddKey(Object key, Handle<FixedArray> combined_keys,
+static int AddKey(Tagged<Object> key, Handle<FixedArray> combined_keys,
                   Handle<DescriptorArray> descs, int nof_descriptors,
                   int target) {
   for (InternalIndex i : InternalIndex::Range(nof_descriptors)) {
@@ -67,11 +68,11 @@ static Handle<FixedArray> CombineKeys(Isolate* isolate,
   int prototype_chain_keys_length = prototype_chain_keys->length();
   if (prototype_chain_keys_length == 0) return own_keys;
 
-  Map map = receiver->map();
-  int nof_descriptors = map.NumberOfOwnDescriptors();
+  Tagged<Map> map = receiver->map();
+  int nof_descriptors = map->NumberOfOwnDescriptors();
   if (nof_descriptors == 0 && !may_have_elements) return prototype_chain_keys;
 
-  Handle<DescriptorArray> descs(map.instance_descriptors(isolate), isolate);
+  Handle<DescriptorArray> descs(map->instance_descriptors(isolate), isolate);
   int own_keys_length = own_keys.is_null() ? 0 : own_keys->length();
   Handle<FixedArray> combined_keys = isolate->factory()->NewFixedArray(
       own_keys_length + prototype_chain_keys_length);
@@ -109,7 +110,7 @@ Handle<FixedArray> KeyAccumulator::GetKeys(GetKeysConversion convert) {
 
   if (try_prototype_info_cache_ && !first_prototype_map_.is_null()) {
     PrototypeInfo::cast(first_prototype_map_->prototype_info())
-        .set_prototype_chain_enum_cache(*result);
+        ->set_prototype_chain_enum_cache(*result);
     Map::GetOrCreatePrototypeChainValidityCell(
         Handle<Map>(receiver_->map(), isolate_), isolate_);
     DCHECK(first_prototype_map_->IsPrototypeValidityCellValid());
@@ -121,18 +122,20 @@ Handle<OrderedHashSet> KeyAccumulator::keys() {
   return Handle<OrderedHashSet>::cast(keys_);
 }
 
-ExceptionStatus KeyAccumulator::AddKey(Object key, AddKeyConversion convert) {
+ExceptionStatus KeyAccumulator::AddKey(Tagged<Object> key,
+                                       AddKeyConversion convert) {
   return AddKey(handle(key, isolate_), convert);
 }
 
 ExceptionStatus KeyAccumulator::AddKey(Handle<Object> key,
                                        AddKeyConversion convert) {
   if (filter_ == PRIVATE_NAMES_ONLY) {
-    if (!key->IsSymbol()) return ExceptionStatus::kSuccess;
-    if (!Symbol::cast(*key).is_private_name()) return ExceptionStatus::kSuccess;
-  } else if (key->IsSymbol()) {
+    if (!IsSymbol(*key)) return ExceptionStatus::kSuccess;
+    if (!Symbol::cast(*key)->is_private_name())
+      return ExceptionStatus::kSuccess;
+  } else if (IsSymbol(*key)) {
     if (filter_ & SKIP_SYMBOLS) return ExceptionStatus::kSuccess;
-    if (Symbol::cast(*key).is_private()) return ExceptionStatus::kSuccess;
+    if (Symbol::cast(*key)->is_private()) return ExceptionStatus::kSuccess;
   } else if (filter_ & SKIP_STRINGS) {
     return ExceptionStatus::kSuccess;
   }
@@ -142,7 +145,7 @@ ExceptionStatus KeyAccumulator::AddKey(Handle<Object> key,
     keys_ = OrderedHashSet::Allocate(isolate_, 16).ToHandleChecked();
   }
   uint32_t index;
-  if (convert == CONVERT_TO_ARRAY_INDEX && key->IsString() &&
+  if (convert == CONVERT_TO_ARRAY_INDEX && IsString(*key) &&
       Handle<String>::cast(key)->AsArrayIndex(&index)) {
     key = isolate_->factory()->NewNumberFromUint(index);
   }
@@ -175,7 +178,7 @@ ExceptionStatus KeyAccumulator::AddKeys(Handle<FixedArray> array,
 
 ExceptionStatus KeyAccumulator::AddKeys(Handle<JSObject> array_like,
                                         AddKeyConversion convert) {
-  DCHECK(array_like->IsJSArray() || array_like->HasSloppyArgumentsElements());
+  DCHECK(IsJSArray(*array_like) || array_like->HasSloppyArgumentsElements());
   ElementsAccessor* accessor = array_like->GetElementsAccessor();
   return accessor->AddElementsToKeyAccumulator(array_like, this, convert);
 }
@@ -193,7 +196,7 @@ MaybeHandle<FixedArray> FilterProxyKeys(KeyAccumulator* accumulator,
   int store_position = 0;
   for (int i = 0; i < keys->length(); ++i) {
     Handle<Name> key(Name::cast(keys->get(i)), isolate);
-    if (key->FilterKey(filter)) continue;  // Skip this key.
+    if (Object::FilterKey(*key, filter)) continue;  // Skip this key.
     if (skip_indices) {
       uint32_t index;
       if (key->AsArrayIndex(&index)) continue;  // Skip this key.
@@ -241,7 +244,7 @@ Maybe<bool> KeyAccumulator::CollectKeys(Handle<JSReceiver> receiver,
   // Proxies have no hidden prototype and we should not trigger the
   // [[GetPrototypeOf]] trap on the last iteration when using
   // AdvanceFollowingProxies.
-  if (mode_ == KeyCollectionMode::kOwnOnly && object->IsJSProxy()) {
+  if (mode_ == KeyCollectionMode::kOwnOnly && IsJSProxy(*object)) {
     MAYBE_RETURN(CollectOwnJSProxyKeys(receiver, Handle<JSProxy>::cast(object)),
                  Nothing<bool>());
     return Just(true);
@@ -258,9 +261,9 @@ Maybe<bool> KeyAccumulator::CollectKeys(Handle<JSReceiver> receiver,
     Handle<JSReceiver> current =
         PrototypeIterator::GetCurrent<JSReceiver>(iter);
     Maybe<bool> result = Just(false);  // Dummy initialization.
-    if (current->IsJSProxy()) {
+    if (IsJSProxy(*current)) {
       result = CollectOwnJSProxyKeys(receiver, Handle<JSProxy>::cast(current));
-    } else if (current->IsWasmObject()) {
+    } else if (IsWasmObject(*current)) {
       if (mode_ == KeyCollectionMode::kIncludePrototypes) {
         RETURN_FAILURE(isolate_, kThrowOnError,
                        NewTypeError(MessageTemplate::kWasmObjectsAreOpaque));
@@ -269,7 +272,7 @@ Maybe<bool> KeyAccumulator::CollectKeys(Handle<JSReceiver> receiver,
         DCHECK_EQ(result, Just(false));  // Stop iterating.
       }
     } else {
-      DCHECK(current->IsJSObject());
+      DCHECK(IsJSObject(*current));
       result = CollectOwnKeys(receiver, Handle<JSObject>::cast(current));
     }
     MAYBE_RETURN(result, Nothing<bool>());
@@ -294,7 +297,7 @@ bool KeyAccumulator::IsShadowed(Handle<Object> key) {
   return shadowing_keys_->Has(isolate_, key);
 }
 
-void KeyAccumulator::AddShadowingKey(Object key,
+void KeyAccumulator::AddShadowingKey(Tagged<Object> key,
                                      AllowGarbageCollection* allow_gc) {
   if (mode_ == KeyCollectionMode::kOwnOnly) return;
   AddShadowingKey(handle(key, isolate_));
@@ -309,23 +312,23 @@ void KeyAccumulator::AddShadowingKey(Handle<Object> key) {
 
 namespace {
 
-void TrySettingEmptyEnumCache(JSReceiver object) {
-  Map map = object.map();
-  DCHECK_EQ(kInvalidEnumCacheSentinel, map.EnumLength());
-  if (!map.OnlyHasSimpleProperties()) return;
-  if (map.IsJSProxyMap()) return;
-  if (map.NumberOfEnumerableProperties() > 0) return;
-  DCHECK(object.IsJSObject());
-  map.SetEnumLength(0);
+void TrySettingEmptyEnumCache(Tagged<JSReceiver> object) {
+  Tagged<Map> map = object->map();
+  DCHECK_EQ(kInvalidEnumCacheSentinel, map->EnumLength());
+  if (!map->OnlyHasSimpleProperties()) return;
+  if (IsJSProxyMap(map)) return;
+  if (map->NumberOfEnumerableProperties() > 0) return;
+  DCHECK(IsJSObject(object));
+  map->SetEnumLength(0);
 }
 
-bool CheckAndInitializeEmptyEnumCache(JSReceiver object) {
-  if (object.map().EnumLength() == kInvalidEnumCacheSentinel) {
+bool CheckAndInitializeEmptyEnumCache(Tagged<JSReceiver> object) {
+  if (object->map()->EnumLength() == kInvalidEnumCacheSentinel) {
     TrySettingEmptyEnumCache(object);
   }
-  if (object.map().EnumLength() != 0) return false;
-  DCHECK(object.IsJSObject());
-  return !JSObject::cast(object).HasEnumerableElements();
+  if (object->map()->EnumLength() != 0) return false;
+  DCHECK(IsJSObject(object));
+  return !JSObject::cast(object)->HasEnumerableElements();
 }
 }  // namespace
 
@@ -337,12 +340,12 @@ void FastKeyAccumulator::Prepare() {
   is_receiver_simple_enum_ = false;
   has_empty_prototype_ = true;
   only_own_has_simple_elements_ =
-      !receiver_->map().IsCustomElementsReceiverMap();
-  JSReceiver last_prototype;
+      !IsCustomElementsReceiverMap(receiver_->map());
+  Tagged<JSReceiver> last_prototype;
   may_have_elements_ = MayHaveElements(*receiver_);
   for (PrototypeIterator iter(isolate_, *receiver_); !iter.IsAtEnd();
        iter.Advance()) {
-    JSReceiver current = iter.GetCurrent<JSReceiver>();
+    Tagged<JSReceiver> current = iter.GetCurrent<JSReceiver>();
     if (!may_have_elements_ || only_own_has_simple_elements_) {
       if (MayHaveElements(current)) {
         may_have_elements_ = true;
@@ -359,8 +362,8 @@ void FastKeyAccumulator::Prepare() {
   if (has_prototype_info_cache_) return;
   if (has_empty_prototype_) {
     is_receiver_simple_enum_ =
-        receiver_->map().EnumLength() != kInvalidEnumCacheSentinel &&
-        !JSObject::cast(*receiver_).HasEnumerableElements();
+        receiver_->map()->EnumLength() != kInvalidEnumCacheSentinel &&
+        !JSObject::cast(*receiver_)->HasEnumerableElements();
   } else if (!last_prototype.is_null()) {
     last_non_empty_prototype_ = handle(last_prototype, isolate_);
   }
@@ -381,7 +384,7 @@ Handle<FixedArray> GetFastEnumPropertyKeys(Isolate* isolate,
                                            Handle<JSObject> object) {
   Handle<Map> map(object->map(), isolate);
   Handle<FixedArray> keys(
-      map->instance_descriptors(isolate).enum_cache().keys(), isolate);
+      map->instance_descriptors(isolate)->enum_cache()->keys(), isolate);
 
   // Check if the {map} has a valid enum length, which implies that it
   // must have a valid enum cache as well.
@@ -464,21 +467,21 @@ MaybeHandle<FixedArray> FastKeyAccumulator::GetKeys(
 MaybeHandle<FixedArray> FastKeyAccumulator::GetKeysFast(
     GetKeysConversion keys_conversion) {
   bool own_only = has_empty_prototype_ || mode_ == KeyCollectionMode::kOwnOnly;
-  Map map = receiver_->map();
-  if (!own_only || map.IsCustomElementsReceiverMap()) {
+  Tagged<Map> map = receiver_->map();
+  if (!own_only || IsCustomElementsReceiverMap(map)) {
     return MaybeHandle<FixedArray>();
   }
 
   // From this point on we are certain to only collect own keys.
-  DCHECK(receiver_->IsJSObject());
+  DCHECK(IsJSObject(*receiver_));
   Handle<JSObject> object = Handle<JSObject>::cast(receiver_);
 
   // Do not try to use the enum-cache for dict-mode objects.
-  if (map.is_dictionary_map()) {
+  if (map->is_dictionary_map()) {
     return GetOwnKeysWithElements<false>(isolate_, object, keys_conversion,
                                          skip_indices_);
   }
-  int enum_length = receiver_->map().EnumLength();
+  int enum_length = receiver_->map()->EnumLength();
   if (enum_length == kInvalidEnumCacheSentinel) {
     Handle<FixedArray> keys;
     // Try initializing the enum cache and return own properties.
@@ -488,7 +491,7 @@ MaybeHandle<FixedArray> FastKeyAccumulator::GetKeysFast(
                keys->length());
       }
       is_receiver_simple_enum_ =
-          object->map().EnumLength() != kInvalidEnumCacheSentinel;
+          object->map()->EnumLength() != kInvalidEnumCacheSentinel;
       return keys;
     }
   }
@@ -512,7 +515,7 @@ Handle<FixedArray> FastKeyAccumulator::InitializeFastPropertyEnumCache(
 
   // The enum cache should have been a hit if the number of enumerable
   // properties is fewer than what's already in the cache.
-  DCHECK_LT(descriptors->enum_cache().keys().length(), enum_length);
+  DCHECK_LT(descriptors->enum_cache()->keys()->length(), enum_length);
   isolate->counters()->enum_cache_misses()->Increment();
 
   // Create the keys array.
@@ -524,8 +527,8 @@ Handle<FixedArray> FastKeyAccumulator::InitializeFastPropertyEnumCache(
     DisallowGarbageCollection no_gc;
     PropertyDetails details = descriptors->GetDetails(i);
     if (details.IsDontEnum()) continue;
-    Object key = descriptors->GetKey(i);
-    if (key.IsSymbol()) continue;
+    Tagged<Object> key = descriptors->GetKey(i);
+    if (IsSymbol(key)) continue;
     keys->set(index, key);
     if (details.location() != PropertyLocation::kField) fields_only = false;
     index++;
@@ -538,18 +541,18 @@ Handle<FixedArray> FastKeyAccumulator::InitializeFastPropertyEnumCache(
     indices = isolate->factory()->NewFixedArray(enum_length, allocation);
     index = 0;
     DisallowGarbageCollection no_gc;
-    auto raw_map = *map;
-    auto raw_indices = *indices;
-    auto raw_descriptors = *descriptors;
-    for (InternalIndex i : raw_map.IterateOwnDescriptors()) {
-      PropertyDetails details = raw_descriptors.GetDetails(i);
+    Tagged<Map> raw_map = *map;
+    Tagged<FixedArray> raw_indices = *indices;
+    Tagged<DescriptorArray> raw_descriptors = *descriptors;
+    for (InternalIndex i : raw_map->IterateOwnDescriptors()) {
+      PropertyDetails details = raw_descriptors->GetDetails(i);
       if (details.IsDontEnum()) continue;
-      Object key = raw_descriptors.GetKey(i);
-      if (key.IsSymbol()) continue;
+      Tagged<Object> key = raw_descriptors->GetKey(i);
+      if (IsSymbol(key)) continue;
       DCHECK_EQ(PropertyKind::kData, details.kind());
       DCHECK_EQ(PropertyLocation::kField, details.location());
       FieldIndex field_index = FieldIndex::ForDetails(raw_map, details);
-      raw_indices.set(index, Smi::FromInt(field_index.GetLoadByFieldIndex()));
+      raw_indices->set(index, Smi::FromInt(field_index.GetLoadByFieldIndex()));
       index++;
     }
     DCHECK_EQ(index, indices->length());
@@ -565,16 +568,16 @@ MaybeHandle<FixedArray>
 FastKeyAccumulator::GetOwnKeysWithUninitializedEnumLength() {
   Handle<JSObject> object = Handle<JSObject>::cast(receiver_);
   // Uninitialized enum length
-  Map map = object->map();
+  Tagged<Map> map = object->map();
   if (object->elements() != ReadOnlyRoots(isolate_).empty_fixed_array() &&
       object->elements() !=
           ReadOnlyRoots(isolate_).empty_slow_element_dictionary()) {
     // Assume that there are elements.
     return MaybeHandle<FixedArray>();
   }
-  int number_of_own_descriptors = map.NumberOfOwnDescriptors();
+  int number_of_own_descriptors = map->NumberOfOwnDescriptors();
   if (number_of_own_descriptors == 0) {
-    map.SetEnumLength(0);
+    map->SetEnumLength(0);
     return isolate_->factory()->empty_fixed_array();
   }
   // We have no elements but possibly enumerable property keys, hence we can
@@ -605,7 +608,7 @@ MaybeHandle<FixedArray> FastKeyAccumulator::GetKeysWithPrototypeInfoCache(
   Handle<FixedArray> own_keys;
   if (may_have_elements_) {
     MaybeHandle<FixedArray> maybe_own_keys;
-    if (receiver_->map().is_dictionary_map()) {
+    if (receiver_->map()->is_dictionary_map()) {
       maybe_own_keys = GetOwnKeysWithElements<false>(
           isolate_, Handle<JSObject>::cast(receiver_), keys_conversion,
           skip_indices_);
@@ -624,7 +627,7 @@ MaybeHandle<FixedArray> FastKeyAccumulator::GetKeysWithPrototypeInfoCache(
     prototype_chain_keys =
         handle(FixedArray::cast(
                    PrototypeInfo::cast(first_prototype_map_->prototype_info())
-                       .prototype_chain_enum_cache()),
+                       ->prototype_chain_enum_cache()),
                isolate_);
   } else {
     KeyAccumulator accumulator(isolate_, mode_, filter_);
@@ -649,11 +652,11 @@ MaybeHandle<FixedArray> FastKeyAccumulator::GetKeysWithPrototypeInfoCache(
   return result;
 }
 
-bool FastKeyAccumulator::MayHaveElements(JSReceiver receiver) {
-  if (!receiver.IsJSObject()) return true;
-  JSObject object = JSObject::cast(receiver);
-  if (object.HasEnumerableElements()) return true;
-  if (object.HasIndexedInterceptor()) return true;
+bool FastKeyAccumulator::MayHaveElements(Tagged<JSReceiver> receiver) {
+  if (!IsJSObject(receiver)) return true;
+  Tagged<JSObject> object = JSObject::cast(receiver);
+  if (object->HasEnumerableElements()) return true;
+  if (object->HasIndexedInterceptor()) return true;
   return false;
 }
 
@@ -662,23 +665,23 @@ bool FastKeyAccumulator::TryPrototypeInfoCache(Handle<JSReceiver> receiver) {
   Handle<JSObject> object = Handle<JSObject>::cast(receiver);
   if (!object->HasFastProperties()) return false;
   if (object->HasNamedInterceptor()) return false;
-  if (object->IsAccessCheckNeeded() &&
-      !isolate_->MayAccess(handle(isolate_->context(), isolate_), object)) {
+  if (IsAccessCheckNeeded(*object) &&
+      !isolate_->MayAccess(isolate_->native_context(), object)) {
     return false;
   }
   DisallowGarbageCollection no_gc;
-  HeapObject prototype = receiver->map(isolate_).prototype();
+  Tagged<HeapObject> prototype = receiver->map(isolate_)->prototype();
   if (prototype.is_null()) return false;
-  Map maybe_proto_map = prototype.map(isolate_);
-  if (!maybe_proto_map.is_prototype_map()) return false;
-  PrototypeInfo prototype_info;
-  if (!maybe_proto_map.TryGetPrototypeInfo(&prototype_info)) return false;
+  Tagged<Map> maybe_proto_map = prototype->map(isolate_);
+  if (!maybe_proto_map->is_prototype_map()) return false;
+  Tagged<PrototypeInfo> prototype_info;
+  if (!maybe_proto_map->TryGetPrototypeInfo(&prototype_info)) return false;
 
   first_prototype_ = handle(JSReceiver::cast(prototype), isolate_);
   first_prototype_map_ = handle(maybe_proto_map, isolate_);
   has_prototype_info_cache_ =
-      maybe_proto_map.IsPrototypeValidityCellValid() &&
-      prototype_info.prototype_chain_enum_cache().IsFixedArray();
+      maybe_proto_map->IsPrototypeValidityCellValid() &&
+      IsFixedArray(prototype_info->prototype_chain_enum_cache());
   return true;
 }
 
@@ -687,7 +690,7 @@ KeyAccumulator::FilterForEnumerableProperties(
     Handle<JSReceiver> receiver, Handle<JSObject> object,
     Handle<InterceptorInfo> interceptor, Handle<JSObject> result,
     IndexedOrNamed type) {
-  DCHECK(result->IsJSArray() || result->HasSloppyArgumentsElements());
+  DCHECK(IsJSArray(*result) || result->HasSloppyArgumentsElements());
   ElementsAccessor* accessor = result->GetElementsAccessor();
 
   size_t length = accessor->GetCapacity(*result, result->elements());
@@ -698,22 +701,21 @@ KeyAccumulator::FilterForEnumerableProperties(
     // Query callbacks are not expected to have side effects.
     PropertyCallbackArguments args(isolate_, interceptor->data(), *receiver,
                                    *object, Just(kDontThrow));
-
     Handle<Object> element = accessor->Get(isolate_, result, entry);
     Handle<Object> attributes;
     if (type == kIndexed) {
       uint32_t number;
-      CHECK(element->ToUint32(&number));
+      CHECK(Object::ToUint32(*element, &number));
       attributes = args.CallIndexedQuery(interceptor, number);
     } else {
-      CHECK(element->IsName());
+      CHECK(IsName(*element));
       attributes =
           args.CallNamedQuery(interceptor, Handle<Name>::cast(element));
     }
 
     if (!attributes.is_null()) {
       int32_t value;
-      CHECK(attributes->ToInt32(&value));
+      CHECK(Object::ToInt32(*attributes, &value));
       if ((value & DONT_ENUM) == 0) {
         RETURN_FAILURE_IF_NOT_SUCCESSFUL(AddKey(element, DO_NOT_CONVERT));
       }
@@ -730,7 +732,7 @@ Maybe<bool> KeyAccumulator::CollectInterceptorKeysInternal(
                                       *object, Just(kDontThrow));
 
   Handle<JSObject> result;
-  if (!interceptor->enumerator().IsUndefined(isolate_)) {
+  if (!IsUndefined(interceptor->enumerator(), isolate_)) {
     if (type == kIndexed) {
       result = enum_args.CallIndexedEnumerator(interceptor);
     } else {
@@ -747,7 +749,7 @@ Maybe<bool> KeyAccumulator::CollectInterceptorKeysInternal(
   enum_args.AcceptSideEffects();
 
   if ((filter_ & ONLY_ENUMERABLE) &&
-      !interceptor->query().IsUndefined(isolate_)) {
+      !IsUndefined(interceptor->query(), isolate_)) {
     RETURN_NOTHING_IF_NOT_SUCCESSFUL(FilterForEnumerableProperties(
         receiver, object, interceptor, result, type));
   } else {
@@ -809,17 +811,17 @@ base::Optional<int> CollectOwnPropertyNamesInternal(
 
     if (filter & ONLY_ALL_CAN_READ) {
       if (details.kind() != PropertyKind::kAccessor) continue;
-      Object accessors = descs->GetStrongValue(i);
-      if (!accessors.IsAccessorInfo()) continue;
-      if (!AccessorInfo::cast(accessors).all_can_read()) continue;
+      Tagged<Object> accessors = descs->GetStrongValue(i);
+      if (!IsAccessorInfo(accessors)) continue;
+      if (!AccessorInfo::cast(accessors)->all_can_read()) continue;
     }
 
-    Name key = descs->GetKey(i);
-    if (skip_symbols == key.IsSymbol()) {
+    Tagged<Name> key = descs->GetKey(i);
+    if (skip_symbols == IsSymbol(key)) {
       if (first_skipped == -1) first_skipped = i.as_int();
       continue;
     }
-    if (key.FilterKey(keys->filter())) continue;
+    if (Object::FilterKey(key, keys->filter())) continue;
 
     if (is_shadowing_key) {
       // This might allocate, but {key} is not used afterwards.
@@ -846,10 +848,10 @@ void CommonCopyEnumKeysTo(Isolate* isolate, Handle<Dictionary> dictionary,
 
   AllowGarbageCollection allow_gc;
   for (InternalIndex i : dictionary->IterateEntries()) {
-    Object key;
+    Tagged<Object> key;
     if (!dictionary->ToKey(roots, i, &key)) continue;
     bool is_shadowing_key = false;
-    if (key.IsSymbol()) continue;
+    if (IsSymbol(key)) continue;
     PropertyDetails details = dictionary->DetailsAt(i);
     if (details.IsDontEnum()) {
       if (mode == KeyCollectionMode::kIncludePrototypes) {
@@ -896,15 +898,15 @@ void CopyEnumKeysTo(Isolate* isolate, Handle<Dictionary> dictionary,
 
   DisallowGarbageCollection no_gc;
   Dictionary raw_dictionary = *dictionary;
-  FixedArray raw_storage = *storage;
+  Tagged<FixedArray> raw_storage = *storage;
   EnumIndexComparator<Dictionary> cmp(raw_dictionary);
   // Use AtomicSlot wrapper to ensure that std::sort uses atomic load and
   // store operations that are safe for concurrent marking.
   AtomicSlot start(storage->GetFirstElementAddress());
   std::sort(start, start + length, cmp);
   for (int i = 0; i < length; i++) {
-    InternalIndex index(Smi::ToInt(raw_storage.get(i)));
-    raw_storage.set(i, raw_dictionary.NameAt(index));
+    InternalIndex index(Smi::ToInt(raw_storage->get(i)));
+    raw_storage->set(i, raw_dictionary.NameAt(index));
   }
 }
 
@@ -926,7 +928,7 @@ Handle<FixedArray> GetOwnEnumPropertyDictionaryKeys(Isolate* isolate,
                                                     KeyCollectionMode mode,
                                                     KeyAccumulator* accumulator,
                                                     Handle<JSObject> object,
-                                                    T raw_dictionary) {
+                                                    Tagged<T> raw_dictionary) {
   Handle<T> dictionary(raw_dictionary, isolate);
   if (dictionary->NumberOfElements() == 0) {
     return isolate->factory()->empty_fixed_array();
@@ -954,10 +956,10 @@ ExceptionStatus CollectKeysFromDictionary(Handle<Dictionary> dictionary,
   {
     DisallowGarbageCollection no_gc;
     for (InternalIndex i : dictionary->IterateEntries()) {
-      Object key;
+      Tagged<Object> key;
       Dictionary raw_dictionary = *dictionary;
       if (!raw_dictionary.ToKey(roots, i, &key)) continue;
-      if (key.FilterKey(filter)) continue;
+      if (Object::FilterKey(key, filter)) continue;
       PropertyDetails details = raw_dictionary.DetailsAt(i);
       if ((int{details.attributes()} & filter) != 0) {
         AllowGarbageCollection gc;
@@ -967,9 +969,9 @@ ExceptionStatus CollectKeysFromDictionary(Handle<Dictionary> dictionary,
       }
       if (filter & ONLY_ALL_CAN_READ) {
         if (details.kind() != PropertyKind::kAccessor) continue;
-        Object accessors = raw_dictionary.ValueAt(i);
-        if (!accessors.IsAccessorInfo()) continue;
-        if (!AccessorInfo::cast(accessors).all_can_read()) continue;
+        Tagged<Object> accessors = raw_dictionary.ValueAt(i);
+        if (!IsAccessorInfo(accessors)) continue;
+        if (!AccessorInfo::cast(accessors)->all_can_read()) continue;
       }
       // TODO(emrich): consider storing keys instead of indices into the array
       // in case of ordered dictionary type.
@@ -990,8 +992,8 @@ ExceptionStatus CollectKeysFromDictionary(Handle<Dictionary> dictionary,
   bool has_seen_symbol = false;
   for (int i = 0; i < array_size; i++) {
     InternalIndex index(Smi::ToInt(array->get(i)));
-    Object key = dictionary->NameAt(index);
-    if (key.IsSymbol()) {
+    Tagged<Object> key = dictionary->NameAt(index);
+    if (IsSymbol(key)) {
       has_seen_symbol = true;
       continue;
     }
@@ -1001,8 +1003,8 @@ ExceptionStatus CollectKeysFromDictionary(Handle<Dictionary> dictionary,
   if (has_seen_symbol) {
     for (int i = 0; i < array_size; i++) {
       InternalIndex index(Smi::ToInt(array->get(i)));
-      Object key = dictionary->NameAt(index);
-      if (!key.IsSymbol()) continue;
+      Tagged<Object> key = dictionary->NameAt(index);
+      if (!IsSymbol(key)) continue;
       ExceptionStatus status = keys->AddKey(key, DO_NOT_CONVERT);
       if (!status) return status;
     }
@@ -1020,13 +1022,13 @@ Maybe<bool> KeyAccumulator::CollectOwnPropertyNames(Handle<JSReceiver> receiver,
       enum_keys = KeyAccumulator::GetOwnEnumPropertyKeys(isolate_, object);
       // If the number of properties equals the length of enumerable properties
       // we do not have to filter out non-enumerable ones
-      Map map = object->map();
-      int nof_descriptors = map.NumberOfOwnDescriptors();
+      Tagged<Map> map = object->map();
+      int nof_descriptors = map->NumberOfOwnDescriptors();
       if (enum_keys->length() != nof_descriptors) {
-        if (map.prototype(isolate_) != ReadOnlyRoots(isolate_).null_value()) {
+        if (map->prototype(isolate_) != ReadOnlyRoots(isolate_).null_value()) {
           AllowGarbageCollection allow_gc;
           Handle<DescriptorArray> descs = Handle<DescriptorArray>(
-              map.instance_descriptors(isolate_), isolate_);
+              map->instance_descriptors(isolate_), isolate_);
           for (InternalIndex i : InternalIndex::Range(nof_descriptors)) {
             PropertyDetails details = descs->GetDetails(i);
             if (!details.IsDontEnum()) continue;
@@ -1034,10 +1036,10 @@ Maybe<bool> KeyAccumulator::CollectOwnPropertyNames(Handle<JSReceiver> receiver,
           }
         }
       }
-    } else if (object->IsJSGlobalObject()) {
+    } else if (IsJSGlobalObject(*object)) {
       enum_keys = GetOwnEnumPropertyDictionaryKeys(
           isolate_, mode_, this, object,
-          JSGlobalObject::cast(*object).global_dictionary(kAcquireLoad));
+          JSGlobalObject::cast(*object)->global_dictionary(kAcquireLoad));
     } else if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
       enum_keys = GetOwnEnumPropertyDictionaryKeys(
           isolate_, mode_, this, object, object->property_dictionary_swiss());
@@ -1045,7 +1047,7 @@ Maybe<bool> KeyAccumulator::CollectOwnPropertyNames(Handle<JSReceiver> receiver,
       enum_keys = GetOwnEnumPropertyDictionaryKeys(
           isolate_, mode_, this, object, object->property_dictionary());
     }
-    if (object->IsJSModuleNamespace()) {
+    if (IsJSModuleNamespace(*object)) {
       // Simulate [[GetOwnProperty]] for establishing enumerability, which
       // throws for uninitialized exports.
       for (int i = 0, n = enum_keys->length(); i < n; ++i) {
@@ -1060,9 +1062,9 @@ Maybe<bool> KeyAccumulator::CollectOwnPropertyNames(Handle<JSReceiver> receiver,
     RETURN_NOTHING_IF_NOT_SUCCESSFUL(AddKeys(enum_keys, DO_NOT_CONVERT));
   } else {
     if (object->HasFastProperties()) {
-      int limit = object->map().NumberOfOwnDescriptors();
+      int limit = object->map()->NumberOfOwnDescriptors();
       Handle<DescriptorArray> descs(
-          object->map().instance_descriptors(isolate_), isolate_);
+          object->map()->instance_descriptors(isolate_), isolate_);
       // First collect the strings,
       base::Optional<int> first_symbol =
           CollectOwnPropertyNamesInternal<true>(object, this, descs, 0, limit);
@@ -1072,9 +1074,9 @@ Maybe<bool> KeyAccumulator::CollectOwnPropertyNames(Handle<JSReceiver> receiver,
         RETURN_NOTHING_IF_NOT_SUCCESSFUL(CollectOwnPropertyNamesInternal<false>(
             object, this, descs, first_symbol.value(), limit));
       }
-    } else if (object->IsJSGlobalObject()) {
+    } else if (IsJSGlobalObject(*object)) {
       RETURN_NOTHING_IF_NOT_SUCCESSFUL(CollectKeysFromDictionary(
-          handle(JSGlobalObject::cast(*object).global_dictionary(kAcquireLoad),
+          handle(JSGlobalObject::cast(*object)->global_dictionary(kAcquireLoad),
                  isolate_),
           this));
     } else if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -1093,13 +1095,13 @@ ExceptionStatus KeyAccumulator::CollectPrivateNames(Handle<JSReceiver> receiver,
                                                     Handle<JSObject> object) {
   DCHECK_EQ(mode_, KeyCollectionMode::kOwnOnly);
   if (object->HasFastProperties()) {
-    int limit = object->map().NumberOfOwnDescriptors();
-    Handle<DescriptorArray> descs(object->map().instance_descriptors(isolate_),
+    int limit = object->map()->NumberOfOwnDescriptors();
+    Handle<DescriptorArray> descs(object->map()->instance_descriptors(isolate_),
                                   isolate_);
     CollectOwnPropertyNamesInternal<false>(object, this, descs, 0, limit);
-  } else if (object->IsJSGlobalObject()) {
+  } else if (IsJSGlobalObject(*object)) {
     RETURN_FAILURE_IF_NOT_SUCCESSFUL(CollectKeysFromDictionary(
-        handle(JSGlobalObject::cast(*object).global_dictionary(kAcquireLoad),
+        handle(JSGlobalObject::cast(*object)->global_dictionary(kAcquireLoad),
                isolate_),
         this));
   } else if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -1139,8 +1141,8 @@ Maybe<bool> KeyAccumulator::CollectAccessCheckInterceptorKeys(
 Maybe<bool> KeyAccumulator::CollectOwnKeys(Handle<JSReceiver> receiver,
                                            Handle<JSObject> object) {
   // Check access rights if required.
-  if (object->IsAccessCheckNeeded() &&
-      !isolate_->MayAccess(handle(isolate_->context(), isolate_), object)) {
+  if (IsAccessCheckNeeded(*object) &&
+      !isolate_->MayAccess(isolate_->native_context(), object)) {
     // The cross-origin spec says that [[Enumerate]] shall return an empty
     // iterator when it doesn't have access...
     if (mode_ == KeyCollectionMode::kIncludePrototypes) {
@@ -1151,7 +1153,8 @@ Maybe<bool> KeyAccumulator::CollectOwnKeys(Handle<JSReceiver> receiver,
     Handle<AccessCheckInfo> access_check_info;
     {
       DisallowGarbageCollection no_gc;
-      AccessCheckInfo maybe_info = AccessCheckInfo::Get(isolate_, object);
+      Tagged<AccessCheckInfo> maybe_info =
+          AccessCheckInfo::Get(isolate_, object);
       if (!maybe_info.is_null()) {
         access_check_info = handle(maybe_info, isolate_);
       }
@@ -1183,10 +1186,10 @@ Handle<FixedArray> KeyAccumulator::GetOwnEnumPropertyKeys(
     Isolate* isolate, Handle<JSObject> object) {
   if (object->HasFastProperties()) {
     return GetFastEnumPropertyKeys(isolate, object);
-  } else if (object->IsJSGlobalObject()) {
+  } else if (IsJSGlobalObject(*object)) {
     return GetOwnEnumPropertyDictionaryKeys(
         isolate, KeyCollectionMode::kOwnOnly, nullptr, object,
-        JSGlobalObject::cast(*object).global_dictionary(kAcquireLoad));
+        JSGlobalObject::cast(*object)->global_dictionary(kAcquireLoad));
   } else if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
     return GetOwnEnumPropertyDictionaryKeys(
         isolate, KeyCollectionMode::kOwnOnly, nullptr, object,
@@ -1246,11 +1249,11 @@ Maybe<bool> KeyAccumulator::CollectOwnJSProxyKeys(Handle<JSReceiver> receiver,
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate_, trap,
-      Object::GetMethod(Handle<JSReceiver>::cast(handler),
+      Object::GetMethod(isolate_, Handle<JSReceiver>::cast(handler),
                         isolate_->factory()->ownKeys_string()),
       Nothing<bool>());
   // 6. If trap is undefined, then
-  if (trap->IsUndefined(isolate_)) {
+  if (IsUndefined(*trap, isolate_)) {
     // 6a. Return target.[[OwnPropertyKeys]]().
     return CollectOwnJSProxyTargetKeys(proxy, target);
   }
@@ -1343,7 +1346,7 @@ Maybe<bool> KeyAccumulator::CollectOwnJSProxyKeys(Handle<JSReceiver> receiver,
   // 18. (Done in step 9)
   // 19. Repeat, for each key that is an element of targetNonconfigurableKeys:
   for (int i = 0; i < nonconfigurable_keys_length; ++i) {
-    Object raw_key = target_nonconfigurable_keys->get(i);
+    Tagged<Object> raw_key = target_nonconfigurable_keys->get(i);
     Handle<Name> key(Name::cast(raw_key), isolate_);
     // 19a. If key is not an element of uncheckedResultKeys, throw a
     //      TypeError exception.
@@ -1363,8 +1366,8 @@ Maybe<bool> KeyAccumulator::CollectOwnJSProxyKeys(Handle<JSReceiver> receiver,
   }
   // 21. Repeat, for each key that is an element of targetConfigurableKeys:
   for (int i = 0; i < target_configurable_keys->length(); ++i) {
-    Object raw_key = target_configurable_keys->get(i);
-    if (raw_key.IsSmi()) continue;  // Zapped entry, was nonconfigurable.
+    Tagged<Object> raw_key = target_configurable_keys->get(i);
+    if (IsSmi(raw_key)) continue;  // Zapped entry, was nonconfigurable.
     Handle<Name> key(Name::cast(raw_key), isolate_);
     // 21a. If key is not an element of uncheckedResultKeys, throw a
     //      TypeError exception.
diff --git a/deps/v8/src/objects/keys.h b/deps/v8/src/objects/keys.h
index 031c407620b6af..5ff6fe85dc6153 100644
--- a/deps/v8/src/objects/keys.h
+++ b/deps/v8/src/objects/keys.h
@@ -74,7 +74,7 @@ class KeyAccumulator final {
                                                    Handle<JSObject> object);
 
   V8_WARN_UNUSED_RESULT ExceptionStatus
-  AddKey(Object key, AddKeyConversion convert = DO_NOT_CONVERT);
+  AddKey(Tagged<Object> key, AddKeyConversion convert = DO_NOT_CONVERT);
   V8_WARN_UNUSED_RESULT ExceptionStatus
   AddKey(Handle<Object> key, AddKeyConversion convert = DO_NOT_CONVERT);
 
@@ -89,7 +89,7 @@ class KeyAccumulator final {
   void set_skip_indices(bool value) { skip_indices_ = value; }
   // Shadowing keys are used to filter keys. This happens when non-enumerable
   // keys appear again on the prototype chain.
-  void AddShadowingKey(Object key, AllowGarbageCollection* allow_gc);
+  void AddShadowingKey(Tagged<Object> key, AllowGarbageCollection* allow_gc);
   void AddShadowingKey(Handle<Object> key);
 
  private:
@@ -222,7 +222,7 @@ class FastKeyAccumulator {
 
   MaybeHandle<FixedArray> GetOwnKeysWithUninitializedEnumLength();
 
-  bool MayHaveElements(JSReceiver receiver);
+  bool MayHaveElements(Tagged<JSReceiver> receiver);
   bool TryPrototypeInfoCache(Handle<JSReceiver> receiver);
 
   Isolate* isolate_;
diff --git a/deps/v8/src/objects/literal-objects-inl.h b/deps/v8/src/objects/literal-objects-inl.h
index 26c0829f3e5558..a99adc9d9736f7 100644
--- a/deps/v8/src/objects/literal-objects-inl.h
+++ b/deps/v8/src/objects/literal-objects-inl.h
@@ -28,31 +28,31 @@ CAST_ACCESSOR(ObjectBoilerplateDescription)
 SMI_ACCESSORS(ObjectBoilerplateDescription, flags,
               FixedArray::OffsetOfElementAt(kLiteralTypeOffset))
 
-Object ObjectBoilerplateDescription::name(int index) const {
+Tagged<Object> ObjectBoilerplateDescription::name(int index) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return name(cage_base, index);
 }
 
-Object ObjectBoilerplateDescription::name(PtrComprCageBase cage_base,
-                                          int index) const {
+Tagged<Object> ObjectBoilerplateDescription::name(PtrComprCageBase cage_base,
+                                                  int index) const {
   // get() already checks for out of bounds access, but we do not want to allow
   // access to the last element, if it is the number of properties.
   DCHECK_NE(size(), index);
   return get(cage_base, 2 * index + kDescriptionStartIndex);
 }
 
-Object ObjectBoilerplateDescription::value(int index) const {
+Tagged<Object> ObjectBoilerplateDescription::value(int index) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return value(cage_base, index);
 }
 
-Object ObjectBoilerplateDescription::value(PtrComprCageBase cage_base,
-                                           int index) const {
+Tagged<Object> ObjectBoilerplateDescription::value(PtrComprCageBase cage_base,
+                                                   int index) const {
   return get(cage_base, 2 * index + 1 + kDescriptionStartIndex);
 }
 
-void ObjectBoilerplateDescription::set_key_value(int index, Object key,
-                                                 Object value) {
+void ObjectBoilerplateDescription::set_key_value(int index, Tagged<Object> key,
+                                                 Tagged<Object> value) {
   DCHECK_LT(index, size());
   DCHECK_GE(index, 0);
   set(2 * index + kDescriptionStartIndex, key);
@@ -100,22 +100,22 @@ CAST_ACCESSOR(ClassBoilerplate)
 SMI_ACCESSORS(ClassBoilerplate, arguments_count,
               FixedArray::OffsetOfElementAt(kArgumentsCountIndex))
 
-ACCESSORS(ClassBoilerplate, static_properties_template, Object,
+ACCESSORS(ClassBoilerplate, static_properties_template, Tagged<Object>,
           FixedArray::OffsetOfElementAt(kClassPropertiesTemplateIndex))
 
-ACCESSORS(ClassBoilerplate, static_elements_template, Object,
+ACCESSORS(ClassBoilerplate, static_elements_template, Tagged<Object>,
           FixedArray::OffsetOfElementAt(kClassElementsTemplateIndex))
 
-ACCESSORS(ClassBoilerplate, static_computed_properties, FixedArray,
+ACCESSORS(ClassBoilerplate, static_computed_properties, Tagged<FixedArray>,
           FixedArray::OffsetOfElementAt(kClassComputedPropertiesIndex))
 
-ACCESSORS(ClassBoilerplate, instance_properties_template, Object,
+ACCESSORS(ClassBoilerplate, instance_properties_template, Tagged<Object>,
           FixedArray::OffsetOfElementAt(kPrototypePropertiesTemplateIndex))
 
-ACCESSORS(ClassBoilerplate, instance_elements_template, Object,
+ACCESSORS(ClassBoilerplate, instance_elements_template, Tagged<Object>,
           FixedArray::OffsetOfElementAt(kPrototypeElementsTemplateIndex))
 
-ACCESSORS(ClassBoilerplate, instance_computed_properties, FixedArray,
+ACCESSORS(ClassBoilerplate, instance_computed_properties, Tagged<FixedArray>,
           FixedArray::OffsetOfElementAt(kPrototypeComputedPropertiesIndex))
 
 //
@@ -133,7 +133,7 @@ void ArrayBoilerplateDescription::set_elements_kind(ElementsKind kind) {
 }
 
 bool ArrayBoilerplateDescription::is_empty() const {
-  return constant_elements().length() == 0;
+  return constant_elements()->length() == 0;
 }
 
 //
diff --git a/deps/v8/src/objects/literal-objects.cc b/deps/v8/src/objects/literal-objects.cc
index e747de86145267..04f314bdd85b57 100644
--- a/deps/v8/src/objects/literal-objects.cc
+++ b/deps/v8/src/objects/literal-objects.cc
@@ -76,9 +76,10 @@ void AddToDescriptorArrayTemplate(
     } else {
       DCHECK(value_kind == ClassBoilerplate::kGetter ||
              value_kind == ClassBoilerplate::kSetter);
-      Object raw_accessor = descriptor_array_template->GetStrongValue(entry);
-      AccessorPair pair;
-      if (raw_accessor.IsAccessorPair()) {
+      Tagged<Object> raw_accessor =
+          descriptor_array_template->GetStrongValue(entry);
+      Tagged<AccessorPair> pair;
+      if (IsAccessorPair(raw_accessor)) {
         pair = AccessorPair::cast(raw_accessor);
       } else {
         Handle<AccessorPair> new_pair = isolate->factory()->NewAccessorPair();
@@ -87,7 +88,7 @@ void AddToDescriptorArrayTemplate(
         descriptor_array_template->Set(entry, &d);
         pair = *new_pair;
       }
-      pair.set(ToAccessorComponent(value_kind), *value, kReleaseStore);
+      pair->set(ToAccessorComponent(value_kind), *value, kReleaseStore);
     }
   }
 }
@@ -147,15 +148,15 @@ constexpr int ComputeEnumerationIndex(int value_index) {
 
 constexpr int kAccessorNotDefined = -1;
 
-inline int GetExistingValueIndex(Object value) {
-  return value.IsSmi() ? Smi::ToInt(value) : kAccessorNotDefined;
+inline int GetExistingValueIndex(Tagged<Object> value) {
+  return IsSmi(value) ? Smi::ToInt(value) : kAccessorNotDefined;
 }
 
 template <typename IsolateT, typename Dictionary, typename Key>
 void AddToDictionaryTemplate(IsolateT* isolate, Handle<Dictionary> dictionary,
                              Key key, int key_index,
                              ClassBoilerplate::ValueKind value_kind,
-                             Smi value) {
+                             Tagged<Smi> value) {
   InternalIndex entry = dictionary->FindEntry(isolate, key);
 
   const bool is_elements_dictionary =
@@ -204,16 +205,16 @@ void AddToDictionaryTemplate(IsolateT* isolate, Handle<Dictionary> dictionary,
             ? kDummyEnumerationIndex
             : ComputeEnumerationIndex(key_index);
 
-    Object existing_value = dictionary->ValueAt(entry);
+    Tagged<Object> existing_value = dictionary->ValueAt(entry);
     if (value_kind == ClassBoilerplate::kData) {
       // Computed value is a normal method.
-      if (existing_value.IsAccessorPair()) {
-        AccessorPair current_pair = AccessorPair::cast(existing_value);
+      if (IsAccessorPair(existing_value)) {
+        Tagged<AccessorPair> current_pair = AccessorPair::cast(existing_value);
 
         int existing_getter_index =
-            GetExistingValueIndex(current_pair.getter());
+            GetExistingValueIndex(current_pair->getter());
         int existing_setter_index =
-            GetExistingValueIndex(current_pair.setter());
+            GetExistingValueIndex(current_pair->setter());
         // At least one of the accessors must already be defined.
         static_assert(kAccessorNotDefined < 0);
         DCHECK(existing_getter_index >= 0 || existing_setter_index >= 0);
@@ -236,7 +237,7 @@ void AddToDictionaryTemplate(IsolateT* isolate, Handle<Dictionary> dictionary,
           // and then it was overwritten by the current computed method which
           // in turn was later overwritten by the setter method. So we clear
           // the getter.
-          current_pair.set_getter(*isolate->factory()->null_value());
+          current_pair->set_getter(*isolate->factory()->null_value());
 
         } else if (existing_setter_index != kAccessorNotDefined &&
                    existing_setter_index < key_index) {
@@ -245,7 +246,7 @@ void AddToDictionaryTemplate(IsolateT* isolate, Handle<Dictionary> dictionary,
           // and then it was overwritten by the current computed method which
           // in turn was later overwritten by the getter method. So we clear
           // the setter.
-          current_pair.set_setter(*isolate->factory()->null_value());
+          current_pair->set_setter(*isolate->factory()->null_value());
 
         } else {
           // One of the following cases holds:
@@ -273,14 +274,13 @@ void AddToDictionaryTemplate(IsolateT* isolate, Handle<Dictionary> dictionary,
       } else {  // if (existing_value.IsAccessorPair()) ends here
         DCHECK(value_kind == ClassBoilerplate::kData);
 
-        DCHECK_IMPLIES(!existing_value.IsSmi(),
-                       existing_value.IsAccessorInfo());
-        DCHECK_IMPLIES(!existing_value.IsSmi(),
-                       AccessorInfo::cast(existing_value).name() ==
+        DCHECK_IMPLIES(!IsSmi(existing_value), IsAccessorInfo(existing_value));
+        DCHECK_IMPLIES(!IsSmi(existing_value),
+                       AccessorInfo::cast(existing_value)->name() ==
                                *isolate->factory()->length_string() ||
-                           AccessorInfo::cast(existing_value).name() ==
+                           AccessorInfo::cast(existing_value)->name() ==
                                *isolate->factory()->name_string());
-        if (!existing_value.IsSmi() || Smi::ToInt(existing_value) < key_index) {
+        if (!IsSmi(existing_value) || Smi::ToInt(existing_value) < key_index) {
           // Overwrite existing value because it was defined before the computed
           // one (AccessorInfo "length" and "name" properties are always defined
           // before).
@@ -308,14 +308,14 @@ void AddToDictionaryTemplate(IsolateT* isolate, Handle<Dictionary> dictionary,
       }
     } else {  // if (value_kind == ClassBoilerplate::kData) ends here
       AccessorComponent component = ToAccessorComponent(value_kind);
-      if (existing_value.IsAccessorPair()) {
+      if (IsAccessorPair(existing_value)) {
         // Update respective component of existing AccessorPair.
-        AccessorPair current_pair = AccessorPair::cast(existing_value);
+        Tagged<AccessorPair> current_pair = AccessorPair::cast(existing_value);
 
         int existing_component_index =
-            GetExistingValueIndex(current_pair.get(component));
+            GetExistingValueIndex(current_pair->get(component));
         if (existing_component_index < key_index) {
-          current_pair.set(component, value, kReleaseStore);
+          current_pair->set(component, value, kReleaseStore);
         } else {
           // The existing accessor property overwrites the computed one, update
           // its enumeration order accordingly.
@@ -334,10 +334,10 @@ void AddToDictionaryTemplate(IsolateT* isolate, Handle<Dictionary> dictionary,
         }
 
       } else {
-        DCHECK(!existing_value.IsAccessorPair());
+        DCHECK(!IsAccessorPair(existing_value));
         DCHECK(value_kind != ClassBoilerplate::kData);
 
-        if (!existing_value.IsSmi() || Smi::ToInt(existing_value) < key_index) {
+        if (!IsSmi(existing_value) || Smi::ToInt(existing_value) < key_index) {
           // Overwrite the existing data property because it was defined before
           // the computed accessor property.
           Handle<AccessorPair> pair(isolate->factory()->NewAccessorPair());
@@ -447,8 +447,8 @@ class ObjectDescriptor {
 
   void AddConstant(IsolateT* isolate, Handle<Name> name, Handle<Object> value,
                    PropertyAttributes attribs) {
-    bool is_accessor = value->IsAccessorInfo();
-    DCHECK(!value->IsAccessorPair());
+    bool is_accessor = IsAccessorInfo(*value);
+    DCHECK(!IsAccessorPair(*value));
     if (HasDictionaryProperties()) {
       PropertyKind kind =
           is_accessor ? i::PropertyKind::kAccessor : i::PropertyKind::kData;
@@ -479,7 +479,7 @@ class ObjectDescriptor {
   void AddNamedProperty(IsolateT* isolate, Handle<Name> name,
                         ClassBoilerplate::ValueKind value_kind,
                         int value_index) {
-    Smi value = Smi::FromInt(value_index);
+    Tagged<Smi> value = Smi::FromInt(value_index);
     if (HasDictionaryProperties()) {
       UpdateNextEnumerationIndex(value_index);
       if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -500,7 +500,7 @@ class ObjectDescriptor {
   void AddIndexedProperty(IsolateT* isolate, uint32_t element,
                           ClassBoilerplate::ValueKind value_kind,
                           int value_index) {
-    Smi value = Smi::FromInt(value_index);
+    Tagged<Smi> value = Smi::FromInt(value_index);
     AddToDictionaryTemplate(isolate, elements_dictionary_template_, element,
                             value_index, value_kind, value);
   }
@@ -561,33 +561,33 @@ class ObjectDescriptor {
 template <typename IsolateT, typename PropertyDict>
 void ClassBoilerplate::AddToPropertiesTemplate(
     IsolateT* isolate, Handle<PropertyDict> dictionary, Handle<Name> name,
-    int key_index, ClassBoilerplate::ValueKind value_kind, Smi value) {
+    int key_index, ClassBoilerplate::ValueKind value_kind, Tagged<Smi> value) {
   AddToDictionaryTemplate(isolate, dictionary, name, key_index, value_kind,
                           value);
 }
 template void ClassBoilerplate::AddToPropertiesTemplate(
     Isolate* isolate, Handle<NameDictionary> dictionary, Handle<Name> name,
-    int key_index, ClassBoilerplate::ValueKind value_kind, Smi value);
+    int key_index, ClassBoilerplate::ValueKind value_kind, Tagged<Smi> value);
 template void ClassBoilerplate::AddToPropertiesTemplate(
     LocalIsolate* isolate, Handle<NameDictionary> dictionary, Handle<Name> name,
-    int key_index, ClassBoilerplate::ValueKind value_kind, Smi value);
+    int key_index, ClassBoilerplate::ValueKind value_kind, Tagged<Smi> value);
 template void ClassBoilerplate::AddToPropertiesTemplate(
     Isolate* isolate, Handle<SwissNameDictionary> dictionary, Handle<Name> name,
-    int key_index, ClassBoilerplate::ValueKind value_kind, Smi value);
+    int key_index, ClassBoilerplate::ValueKind value_kind, Tagged<Smi> value);
 
 template <typename IsolateT>
 void ClassBoilerplate::AddToElementsTemplate(
     IsolateT* isolate, Handle<NumberDictionary> dictionary, uint32_t key,
-    int key_index, ClassBoilerplate::ValueKind value_kind, Smi value) {
+    int key_index, ClassBoilerplate::ValueKind value_kind, Tagged<Smi> value) {
   AddToDictionaryTemplate(isolate, dictionary, key, key_index, value_kind,
                           value);
 }
 template void ClassBoilerplate::AddToElementsTemplate(
     Isolate* isolate, Handle<NumberDictionary> dictionary, uint32_t key,
-    int key_index, ClassBoilerplate::ValueKind value_kind, Smi value);
+    int key_index, ClassBoilerplate::ValueKind value_kind, Tagged<Smi> value);
 template void ClassBoilerplate::AddToElementsTemplate(
     LocalIsolate* isolate, Handle<NumberDictionary> dictionary, uint32_t key,
-    int key_index, ClassBoilerplate::ValueKind value_kind, Smi value);
+    int key_index, ClassBoilerplate::ValueKind value_kind, Tagged<Smi> value);
 
 template <typename IsolateT>
 Handle<ClassBoilerplate> ClassBoilerplate::BuildClassBoilerplate(
@@ -705,7 +705,7 @@ Handle<ClassBoilerplate> ClassBoilerplate::BuildClassBoilerplate(
 
     } else {
       Handle<String> name = key_literal->AsRawPropertyName()->string();
-      DCHECK(name->IsInternalizedString());
+      DCHECK(IsInternalizedString(*name));
       desc.AddNamedProperty(isolate, name, value_kind, value_index);
     }
   }
diff --git a/deps/v8/src/objects/literal-objects.h b/deps/v8/src/objects/literal-objects.h
index 360c7f6df647be..988e3ec105322b 100644
--- a/deps/v8/src/objects/literal-objects.h
+++ b/deps/v8/src/objects/literal-objects.h
@@ -28,13 +28,14 @@ class StructBodyDescriptor;
 // TODO(ishell): Don't derive from FixedArray as it already has its own map.
 class ObjectBoilerplateDescription : public FixedArray {
  public:
-  inline Object name(int index) const;
-  inline Object name(PtrComprCageBase cage_base, int index) const;
+  inline Tagged<Object> name(int index) const;
+  inline Tagged<Object> name(PtrComprCageBase cage_base, int index) const;
 
-  inline Object value(int index) const;
-  inline Object value(PtrComprCageBase cage_base, int index) const;
+  inline Tagged<Object> value(int index) const;
+  inline Tagged<Object> value(PtrComprCageBase cage_base, int index) const;
 
-  inline void set_key_value(int index, Object key, Object value);
+  inline void set_key_value(int index, Tagged<Object> key,
+                            Tagged<Object> value);
 
   // The number of boilerplate properties.
   inline int size() const;
@@ -119,24 +120,24 @@ class ClassBoilerplate : public FixedArray {
 
   DECL_BOOLEAN_ACCESSORS(install_class_name_accessor)
   DECL_INT_ACCESSORS(arguments_count)
-  DECL_ACCESSORS(static_properties_template, Object)
-  DECL_ACCESSORS(static_elements_template, Object)
-  DECL_ACCESSORS(static_computed_properties, FixedArray)
-  DECL_ACCESSORS(instance_properties_template, Object)
-  DECL_ACCESSORS(instance_elements_template, Object)
-  DECL_ACCESSORS(instance_computed_properties, FixedArray)
+  DECL_ACCESSORS(static_properties_template, Tagged<Object>)
+  DECL_ACCESSORS(static_elements_template, Tagged<Object>)
+  DECL_ACCESSORS(static_computed_properties, Tagged<FixedArray>)
+  DECL_ACCESSORS(instance_properties_template, Tagged<Object>)
+  DECL_ACCESSORS(instance_elements_template, Tagged<Object>)
+  DECL_ACCESSORS(instance_computed_properties, Tagged<FixedArray>)
 
   template <typename IsolateT, typename Dictionary>
   static void AddToPropertiesTemplate(IsolateT* isolate,
                                       Handle<Dictionary> dictionary,
                                       Handle<Name> name, int key_index,
-                                      ValueKind value_kind, Smi value);
+                                      ValueKind value_kind, Tagged<Smi> value);
 
   template <typename IsolateT>
   static void AddToElementsTemplate(IsolateT* isolate,
                                     Handle<NumberDictionary> dictionary,
                                     uint32_t key, int key_index,
-                                    ValueKind value_kind, Smi value);
+                                    ValueKind value_kind, Tagged<Smi> value);
 
   template <typename IsolateT>
   static Handle<ClassBoilerplate> BuildClassBoilerplate(IsolateT* isolate,
diff --git a/deps/v8/src/objects/lookup-cache-inl.h b/deps/v8/src/objects/lookup-cache-inl.h
index 34be8a8a98999a..9865f712e19ce6 100644
--- a/deps/v8/src/objects/lookup-cache-inl.h
+++ b/deps/v8/src/objects/lookup-cache-inl.h
@@ -13,15 +13,15 @@ namespace v8 {
 namespace internal {
 
 // static
-int DescriptorLookupCache::Hash(Map source, Name name) {
-  DCHECK(name.IsUniqueName());
+int DescriptorLookupCache::Hash(Tagged<Map> source, Tagged<Name> name) {
+  DCHECK(IsUniqueName(name));
   // Uses only lower 32 bits if pointers are larger.
   uint32_t source_hash = static_cast<uint32_t>(source.ptr()) >> kTaggedSizeLog2;
-  uint32_t name_hash = name.hash();
+  uint32_t name_hash = name->hash();
   return (source_hash ^ name_hash) % kLength;
 }
 
-int DescriptorLookupCache::Lookup(Map source, Name name) {
+int DescriptorLookupCache::Lookup(Tagged<Map> source, Tagged<Name> name) {
   int index = Hash(source, name);
   Key& key = keys_[index];
   // Pointers in the table might be stale, so use SafeEquals.
@@ -31,7 +31,8 @@ int DescriptorLookupCache::Lookup(Map source, Name name) {
   return kAbsent;
 }
 
-void DescriptorLookupCache::Update(Map source, Name name, int result) {
+void DescriptorLookupCache::Update(Tagged<Map> source, Tagged<Name> name,
+                                   int result) {
   DCHECK_NE(result, kAbsent);
   int index = Hash(source, name);
   Key& key = keys_[index];
diff --git a/deps/v8/src/objects/lookup-cache.h b/deps/v8/src/objects/lookup-cache.h
index 4aa3c5a588fa3a..0949ec90ddb8bd 100644
--- a/deps/v8/src/objects/lookup-cache.h
+++ b/deps/v8/src/objects/lookup-cache.h
@@ -22,10 +22,10 @@ class DescriptorLookupCache {
   DescriptorLookupCache& operator=(const DescriptorLookupCache&) = delete;
   // Lookup descriptor index for (map, name).
   // If absent, kAbsent is returned.
-  inline int Lookup(Map source, Name name);
+  inline int Lookup(Tagged<Map> source, Tagged<Name> name);
 
   // Update an element in the cache.
-  inline void Update(Map source, Name name, int result);
+  inline void Update(Tagged<Map> source, Tagged<Name> name, int result);
 
   // Clear the cache.
   void Clear();
@@ -41,7 +41,7 @@ class DescriptorLookupCache {
     }
   }
 
-  static inline int Hash(Map source, Name name);
+  static inline int Hash(Tagged<Map> source, Tagged<Name> name);
 
   static const int kLength = 64;
   struct Key {
diff --git a/deps/v8/src/objects/lookup-inl.h b/deps/v8/src/objects/lookup-inl.h
index d34f710147ea79..da1e5936256562 100644
--- a/deps/v8/src/objects/lookup-inl.h
+++ b/deps/v8/src/objects/lookup-inl.h
@@ -78,16 +78,16 @@ LookupIterator::LookupIterator(Isolate* isolate, Handle<Object> receiver,
     // If we're not looking at a TypedArray, we will need the key represented
     // as an internalized string.
     if (index_ > JSObject::kMaxElementIndex &&
-        !lookup_start_object->IsJSTypedArray(isolate_)
+        !IsJSTypedArray(*lookup_start_object, isolate_)
 #if V8_ENABLE_WEBASSEMBLY
-        && !lookup_start_object->IsWasmArray(isolate_)
+        && !IsWasmArray(*lookup_start_object, isolate_)
 #endif  // V8_ENABLE_WEBASSEMBLY
     ) {
       if (name_.is_null()) {
         name_ = isolate->factory()->SizeToString(index_);
       }
       name_ = isolate->factory()->InternalizeName(name_);
-    } else if (!name_.is_null() && !name_->IsInternalizedString()) {
+    } else if (!name_.is_null() && !IsInternalizedString(*name_)) {
       // Maintain the invariant that if name_ is present, it is internalized.
       name_ = Handle<Name>();
     }
@@ -100,7 +100,7 @@ LookupIterator::LookupIterator(Isolate* isolate, Handle<Object> receiver,
     // If we're not looking at the prototype chain and the lookup start object
     // is not a typed array, then this means "array index", otherwise we need to
     // ensure the full generality so that typed arrays are handled correctly.
-    if (!check_prototype_chain() && !lookup_start_object->IsJSTypedArray()) {
+    if (!check_prototype_chain() && !IsJSTypedArray(*lookup_start_object)) {
       uint32_t array_index;
       DCHECK(!name_->AsArrayIndex(&array_index));
     } else {
@@ -112,6 +112,22 @@ LookupIterator::LookupIterator(Isolate* isolate, Handle<Object> receiver,
   }
 }
 
+LookupIterator::LookupIterator(Isolate* isolate, Configuration configuration,
+                               Handle<Object> receiver, Handle<Symbol> name)
+    : configuration_(configuration),
+      isolate_(isolate),
+      name_(name),
+      receiver_(receiver),
+      lookup_start_object_(receiver),
+      index_(kInvalidIndex) {
+  // This is the only lookup configuration allowed by this constructor because
+  // it's special case allowing lookup of the private symbols on the prototype
+  // chain. Usually private symbols are limited to OWN_SKIP_INTERCEPTOR lookups.
+  DCHECK_EQ(*name_, *isolate->factory()->error_stack_symbol());
+  DCHECK_EQ(configuration, PROTOTYPE_CHAIN_SKIP_INTERCEPTOR);
+  Start<false>();
+}
+
 PropertyKey::PropertyKey(Isolate* isolate, double index) {
   DCHECK_EQ(index, static_cast<uint64_t>(index));
 #if V8_TARGET_ARCH_32_BIT
@@ -130,6 +146,29 @@ PropertyKey::PropertyKey(Isolate* isolate, double index) {
 #endif
 }
 
+PropertyKey::PropertyKey(Isolate* isolate, Handle<Name> name, size_t index)
+    : name_(name), index_(index) {
+  DCHECK_IMPLIES(index_ == LookupIterator::kInvalidIndex, !name_.is_null());
+#if V8_TARGET_ARCH_32_BIT
+  DCHECK_IMPLIES(index_ != LookupIterator::kInvalidIndex,
+                 index_ <= JSObject::kMaxElementIndex);
+#endif
+#if DEBUG
+  if (index_ != LookupIterator::kInvalidIndex && !name_.is_null()) {
+    // If both valid index and name are given then the name is a string
+    // representation of the same index.
+    size_t integer_index;
+    CHECK(name_->AsIntegerIndex(&integer_index));
+    CHECK_EQ(index_, integer_index);
+  } else if (index_ == LookupIterator::kInvalidIndex) {
+    // If only name is given it must not be a string representing an integer
+    // index.
+    size_t integer_index;
+    CHECK(!name_->AsIntegerIndex(&integer_index));
+  }
+#endif
+}
+
 PropertyKey::PropertyKey(Isolate* isolate, Handle<Name> name) {
   if (name->AsIntegerIndex(&index_)) {
     name_ = name;
@@ -140,13 +179,13 @@ PropertyKey::PropertyKey(Isolate* isolate, Handle<Name> name) {
 }
 
 PropertyKey::PropertyKey(Isolate* isolate, Handle<Object> valid_key) {
-  DCHECK(valid_key->IsName() || valid_key->IsNumber());
-  if (valid_key->ToIntegerIndex(&index_)) return;
-  if (valid_key->IsNumber()) {
+  DCHECK(IsName(*valid_key) || IsNumber(*valid_key));
+  if (Object::ToIntegerIndex(*valid_key, &index_)) return;
+  if (IsNumber(*valid_key)) {
     // Negative or out of range -> treat as named property.
     valid_key = isolate->factory()->NumberToString(valid_key);
   }
-  DCHECK(valid_key->IsName());
+  DCHECK(IsName(*valid_key));
   name_ = Handle<Name>::cast(valid_key);
   if (!name_->AsIntegerIndex(&index_)) {
     index_ = LookupIterator::kInvalidIndex;
@@ -167,7 +206,7 @@ Handle<Name> PropertyKey::GetName(Isolate* isolate) {
 }
 
 Handle<Name> LookupIterator::name() const {
-  DCHECK(!IsElement(*holder_));
+  DCHECK_IMPLIES(!holder_.is_null(), !IsElement(*holder_));
   return name_;
 }
 
@@ -179,10 +218,14 @@ Handle<Name> LookupIterator::GetName() {
   return name_;
 }
 
-bool LookupIterator::IsElement(JSReceiver object) const {
+PropertyKey LookupIterator::GetKey() const {
+  return PropertyKey(isolate_, name_, index_);
+}
+
+bool LookupIterator::IsElement(Tagged<JSReceiver> object) const {
   return index_ <= JSObject::kMaxElementIndex ||
          (index_ != kInvalidIndex &&
-          object.map().has_any_typed_array_or_wasm_array_elements());
+          object->map()->has_any_typed_array_or_wasm_array_elements());
 }
 
 bool LookupIterator::IsPrivateName() const {
@@ -213,24 +256,24 @@ bool LookupIterator::ExtendingNonExtensible(Handle<JSReceiver> receiver) {
   DCHECK(receiver.is_identical_to(GetStoreTarget<JSReceiver>()));
   // Shared objects have fixed layout. No properties may be added to them, not
   // even private symbols.
-  return !receiver->map(isolate_).is_extensible() &&
+  return !receiver->map(isolate_)->is_extensible() &&
          (IsElement() || (!name_->IsPrivate(isolate_) ||
-                          receiver->IsAlwaysSharedSpaceJSObject()));
+                          IsAlwaysSharedSpaceJSObject(*receiver)));
 }
 
 bool LookupIterator::IsCacheableTransition() {
   DCHECK_EQ(TRANSITION, state_);
-  return transition_->IsPropertyCell(isolate_) ||
+  return IsPropertyCell(*transition_, isolate_) ||
          (transition_map()->is_dictionary_map() &&
           !GetStoreTarget<JSReceiver>()->HasFastProperties(isolate_)) ||
-         transition_map()->GetBackPointer(isolate_).IsMap(isolate_);
+         IsMap(transition_map()->GetBackPointer(isolate_), isolate_);
 }
 
 // static
 void LookupIterator::UpdateProtector(Isolate* isolate, Handle<Object> receiver,
                                      Handle<Name> name) {
   RCS_SCOPE(isolate, RuntimeCallCounterId::kUpdateProtector);
-  DCHECK(name->IsInternalizedString() || name->IsSymbol());
+  DCHECK(IsInternalizedString(*name) || IsSymbol(*name));
 
   // This check must be kept in sync with
   // CodeStubAssembler::CheckForAssociatedProtector!
@@ -243,7 +286,8 @@ void LookupIterator::UpdateProtector(Isolate* isolate, Handle<Object> receiver,
       *name == roots.resolve_string() || *name == roots.then_string() ||
       *name == roots.is_concat_spreadable_symbol() ||
       *name == roots.iterator_symbol() || *name == roots.species_symbol() ||
-      *name == roots.replace_symbol();
+      *name == roots.match_all_symbol() || *name == roots.replace_symbol() ||
+      *name == roots.split_symbol();
   DCHECK_EQ(maybe_protector, debug_maybe_protector);
 #endif  // DEBUG
 
@@ -258,6 +302,7 @@ void LookupIterator::UpdateProtector() {
 }
 
 InternalIndex LookupIterator::descriptor_number() const {
+  DCHECK(!holder_.is_null());
   DCHECK(!IsElement(*holder_));
   DCHECK(has_property_);
   DCHECK(holder_->HasFastProperties(isolate_));
@@ -265,6 +310,7 @@ InternalIndex LookupIterator::descriptor_number() const {
 }
 
 InternalIndex LookupIterator::dictionary_entry() const {
+  DCHECK(!holder_.is_null());
   DCHECK(!IsElement(*holder_));
   DCHECK(has_property_);
   DCHECK(!holder_->HasFastProperties(isolate_));
@@ -279,22 +325,23 @@ LookupIterator::Configuration LookupIterator::ComputeConfiguration(
 }
 
 // static
-Handle<JSReceiver> LookupIterator::GetRoot(Isolate* isolate,
-                                           Handle<Object> lookup_start_object,
-                                           size_t index) {
-  if (lookup_start_object->IsJSReceiver(isolate)) {
+MaybeHandle<JSReceiver> LookupIterator::GetRoot(
+    Isolate* isolate, Handle<Object> lookup_start_object, size_t index,
+    Configuration configuration) {
+  if (IsJSReceiver(*lookup_start_object, isolate)) {
     return Handle<JSReceiver>::cast(lookup_start_object);
   }
-  return GetRootForNonJSReceiver(isolate, lookup_start_object, index);
+  return GetRootForNonJSReceiver(isolate, lookup_start_object, index,
+                                 configuration);
 }
 
 template <class T>
 Handle<T> LookupIterator::GetStoreTarget() const {
-  DCHECK(receiver_->IsJSReceiver(isolate_));
-  if (receiver_->IsJSGlobalProxy(isolate_)) {
-    HeapObject prototype =
-        JSGlobalProxy::cast(*receiver_).map(isolate_).prototype(isolate_);
-    if (prototype.IsJSGlobalObject(isolate_)) {
+  DCHECK(IsJSReceiver(*receiver_, isolate_));
+  if (IsJSGlobalProxy(*receiver_, isolate_)) {
+    Tagged<HeapObject> prototype =
+        JSGlobalProxy::cast(*receiver_)->map(isolate_)->prototype(isolate_);
+    if (IsJSGlobalObject(prototype, isolate_)) {
       return handle(JSGlobalObject::cast(prototype), isolate_);
     }
   }
@@ -302,19 +349,21 @@ Handle<T> LookupIterator::GetStoreTarget() const {
 }
 
 template <bool is_element>
-InterceptorInfo LookupIterator::GetInterceptor(JSObject holder) const {
+Tagged<InterceptorInfo> LookupIterator::GetInterceptor(
+    Tagged<JSObject> holder) const {
   if (is_element && index_ <= JSObject::kMaxElementIndex) {
-    return holder.GetIndexedInterceptor(isolate_);
+    return holder->GetIndexedInterceptor(isolate_);
   } else {
-    return holder.GetNamedInterceptor(isolate_);
+    return holder->GetNamedInterceptor(isolate_);
   }
 }
 
 inline Handle<InterceptorInfo> LookupIterator::GetInterceptor() const {
   DCHECK_EQ(INTERCEPTOR, state_);
-  JSObject holder = JSObject::cast(*holder_);
-  InterceptorInfo result = IsElement(holder) ? GetInterceptor<true>(holder)
-                                             : GetInterceptor<false>(holder);
+  Tagged<JSObject> holder = JSObject::cast(*holder_);
+  Tagged<InterceptorInfo> result = IsElement(holder)
+                                       ? GetInterceptor<true>(holder)
+                                       : GetInterceptor<false>(holder);
   return handle(result, isolate_);
 }
 
diff --git a/deps/v8/src/objects/lookup.cc b/deps/v8/src/objects/lookup.cc
index e3bf4794e88e7c..a5fd238767418f 100644
--- a/deps/v8/src/objects/lookup.cc
+++ b/deps/v8/src/objects/lookup.cc
@@ -26,7 +26,7 @@ namespace v8 {
 namespace internal {
 
 PropertyKey::PropertyKey(Isolate* isolate, Handle<Object> key, bool* success) {
-  if (key->ToIntegerIndex(&index_)) {
+  if (Object::ToIntegerIndex(*key, &index_)) {
     *success = true;
     return;
   }
@@ -42,27 +42,20 @@ PropertyKey::PropertyKey(Isolate* isolate, Handle<Object> key, bool* success) {
   }
 }
 
-LookupIterator::LookupIterator(Isolate* isolate, Handle<Object> receiver,
-                               Handle<Name> name, Handle<Map> transition_map,
-                               PropertyDetails details, bool has_property)
-    : configuration_(DEFAULT),
-      state_(TRANSITION),
-      has_property_(has_property),
-      interceptor_state_(InterceptorState::kUninitialized),
-      property_details_(details),
-      isolate_(isolate),
-      name_(name),
-      transition_(transition_map),
-      receiver_(receiver),
-      lookup_start_object_(receiver),
-      index_(kInvalidIndex) {
-  holder_ = GetRoot(isolate, lookup_start_object_);
-}
-
 template <bool is_element>
 void LookupIterator::Start() {
   // GetRoot might allocate if lookup_start_object_ is a string.
-  holder_ = GetRoot(isolate_, lookup_start_object_, index_);
+  MaybeHandle<JSReceiver> maybe_holder =
+      GetRoot(isolate_, lookup_start_object_, index_, configuration_);
+  if (!maybe_holder.ToHandle(&holder_)) {
+    // This is an attempt to perform an own property lookup on a non-JSReceiver
+    // that doesn't have any properties.
+    DCHECK(!IsJSReceiver(*lookup_start_object_));
+    DCHECK(!check_prototype_chain());
+    has_property_ = false;
+    state_ = NOT_FOUND;
+    return;
+  }
 
   {
     DisallowGarbageCollection no_gc;
@@ -70,8 +63,8 @@ void LookupIterator::Start() {
     has_property_ = false;
     state_ = NOT_FOUND;
 
-    JSReceiver holder = *holder_;
-    Map map = holder.map(isolate_);
+    Tagged<JSReceiver> holder = *holder_;
+    Tagged<Map> map = holder->map(isolate_);
 
     state_ = LookupInHolder<is_element>(map, holder);
     if (IsFound()) return;
@@ -89,10 +82,10 @@ void LookupIterator::Next() {
   DisallowGarbageCollection no_gc;
   has_property_ = false;
 
-  JSReceiver holder = *holder_;
-  Map map = holder.map(isolate_);
+  Tagged<JSReceiver> holder = *holder_;
+  Tagged<Map> map = holder->map(isolate_);
 
-  if (map.IsSpecialReceiverMap()) {
+  if (IsSpecialReceiverMap(map)) {
     state_ = IsElement() ? LookupInSpecialHolder<true>(map, holder)
                          : LookupInSpecialHolder<false>(map, holder);
     if (IsFound()) return;
@@ -103,9 +96,9 @@ void LookupIterator::Next() {
 }
 
 template <bool is_element>
-void LookupIterator::NextInternal(Map map, JSReceiver holder) {
+void LookupIterator::NextInternal(Tagged<Map> map, Tagged<JSReceiver> holder) {
   do {
-    JSReceiver maybe_holder = NextHolder(map);
+    Tagged<JSReceiver> maybe_holder = NextHolder(map);
     if (maybe_holder.is_null()) {
       if (interceptor_state_ == InterceptorState::kSkipNonMasking) {
         RestartLookupForNonMaskingInterceptors<is_element>();
@@ -116,7 +109,7 @@ void LookupIterator::NextInternal(Map map, JSReceiver holder) {
       return;
     }
     holder = maybe_holder;
-    map = holder.map(isolate_);
+    map = holder->map(isolate_);
     state_ = LookupInHolder<is_element>(map, holder);
   } while (!IsFound());
 
@@ -135,40 +128,48 @@ template void LookupIterator::RestartInternal<true>(InterceptorState);
 template void LookupIterator::RestartInternal<false>(InterceptorState);
 
 // static
-Handle<JSReceiver> LookupIterator::GetRootForNonJSReceiver(
-    Isolate* isolate, Handle<Object> lookup_start_object, size_t index) {
-  // Strings are the only objects with properties (only elements) directly on
-  // the wrapper. Hence we can skip generating the wrapper for all other cases.
-  if (lookup_start_object->IsString(isolate) &&
-      index <
-          static_cast<size_t>(String::cast(*lookup_start_object).length())) {
-    // TODO(verwaest): Speed this up. Perhaps use a cached wrapper on the native
-    // context, ensuring that we don't leak it into JS?
-    Handle<JSFunction> constructor = isolate->string_function();
-    Handle<JSObject> result = isolate->factory()->NewJSObject(constructor);
-    Handle<JSPrimitiveWrapper>::cast(result)->set_value(*lookup_start_object);
-    return result;
+MaybeHandle<JSReceiver> LookupIterator::GetRootForNonJSReceiver(
+    Isolate* isolate, Handle<Object> lookup_start_object, size_t index,
+    Configuration configuration) {
+  // Strings are the only non-JSReceiver objects with properties (only elements
+  // and 'length') directly on the wrapper. Hence we can skip generating
+  // the wrapper for all other cases.
+  bool own_property_lookup = (configuration & kPrototypeChain) == 0;
+  if (IsString(*lookup_start_object, isolate)) {
+    if (own_property_lookup ||
+        index <
+            static_cast<size_t>(String::cast(*lookup_start_object)->length())) {
+      // TODO(verwaest): Speed this up. Perhaps use a cached wrapper on the
+      // native context, ensuring that we don't leak it into JS?
+      Handle<JSFunction> constructor = isolate->string_function();
+      Handle<JSObject> result = isolate->factory()->NewJSObject(constructor);
+      Handle<JSPrimitiveWrapper>::cast(result)->set_value(*lookup_start_object);
+      return result;
+    }
+  } else if (own_property_lookup) {
+    // Signal that the lookup will not find anything.
+    return {};
   }
   Handle<HeapObject> root(
-      lookup_start_object->GetPrototypeChainRootMap(isolate).prototype(isolate),
+      Object::GetPrototypeChainRootMap(*lookup_start_object, isolate)
+          ->prototype(isolate),
       isolate);
-  if (root->IsNull(isolate)) {
+  if (IsNull(*root, isolate)) {
     isolate->PushStackTraceAndDie(
-        reinterpret_cast<void*>(lookup_start_object->ptr()));
+        reinterpret_cast<void*>((*lookup_start_object).ptr()));
   }
   return Handle<JSReceiver>::cast(root);
 }
 
 Handle<Map> LookupIterator::GetReceiverMap() const {
-  if (receiver_->IsNumber(isolate_)) return factory()->heap_number_map();
+  if (IsNumber(*receiver_, isolate_)) return factory()->heap_number_map();
   return handle(Handle<HeapObject>::cast(receiver_)->map(isolate_), isolate_);
 }
 
 bool LookupIterator::HasAccess() const {
   // TRANSITION is true when being called from DefineNamedOwnIC.
   DCHECK(state_ == ACCESS_CHECK || state_ == TRANSITION);
-  return isolate_->MayAccess(handle(isolate_->context(), isolate_),
-                             GetHolder<JSObject>());
+  return isolate_->MayAccess(isolate_->native_context(), GetHolder<JSObject>());
 }
 
 template <bool is_element>
@@ -184,32 +185,32 @@ void LookupIterator::InternalUpdateProtector(Isolate* isolate,
                                              Handle<Object> receiver_generic,
                                              Handle<Name> name) {
   if (isolate->bootstrapper()->IsActive()) return;
-  if (!receiver_generic->IsHeapObject()) return;
+  if (!IsHeapObject(*receiver_generic)) return;
   Handle<HeapObject> receiver = Handle<HeapObject>::cast(receiver_generic);
 
   ReadOnlyRoots roots(isolate);
   if (*name == roots.constructor_string()) {
     // Setting the constructor property could change an instance's @@species
-    if (receiver->IsJSArray(isolate)) {
+    if (IsJSArray(*receiver, isolate)) {
       if (!Protectors::IsArraySpeciesLookupChainIntact(isolate)) return;
       isolate->CountUsage(
           v8::Isolate::UseCounterFeature::kArrayInstanceConstructorModified);
       Protectors::InvalidateArraySpeciesLookupChain(isolate);
       return;
-    } else if (receiver->IsJSPromise(isolate)) {
+    } else if (IsJSPromise(*receiver, isolate)) {
       if (!Protectors::IsPromiseSpeciesLookupChainIntact(isolate)) return;
       Protectors::InvalidatePromiseSpeciesLookupChain(isolate);
       return;
-    } else if (receiver->IsJSRegExp(isolate)) {
+    } else if (IsJSRegExp(*receiver, isolate)) {
       if (!Protectors::IsRegExpSpeciesLookupChainIntact(isolate)) return;
       Protectors::InvalidateRegExpSpeciesLookupChain(isolate);
       return;
-    } else if (receiver->IsJSTypedArray(isolate)) {
+    } else if (IsJSTypedArray(*receiver, isolate)) {
       if (!Protectors::IsTypedArraySpeciesLookupChainIntact(isolate)) return;
       Protectors::InvalidateTypedArraySpeciesLookupChain(isolate);
       return;
     }
-    if (receiver->map(isolate).is_prototype_map()) {
+    if (receiver->map(isolate)->is_prototype_map()) {
       DisallowGarbageCollection no_gc;
       // Setting the constructor of any prototype with the @@species protector
       // (of any realm) also needs to invalidate the protector.
@@ -219,34 +220,33 @@ void LookupIterator::InternalUpdateProtector(Isolate* isolate,
         isolate->CountUsage(
             v8::Isolate::UseCounterFeature::kArrayPrototypeConstructorModified);
         Protectors::InvalidateArraySpeciesLookupChain(isolate);
-      } else if (receiver->IsJSPromisePrototype()) {
+      } else if (IsJSPromisePrototype(*receiver)) {
         if (!Protectors::IsPromiseSpeciesLookupChainIntact(isolate)) return;
         Protectors::InvalidatePromiseSpeciesLookupChain(isolate);
-      } else if (receiver->IsJSRegExpPrototype()) {
+      } else if (IsJSRegExpPrototype(*receiver)) {
         if (!Protectors::IsRegExpSpeciesLookupChainIntact(isolate)) return;
         Protectors::InvalidateRegExpSpeciesLookupChain(isolate);
-      } else if (receiver->IsJSTypedArrayPrototype()) {
+      } else if (IsJSTypedArrayPrototype(*receiver)) {
         if (!Protectors::IsTypedArraySpeciesLookupChainIntact(isolate)) return;
         Protectors::InvalidateTypedArraySpeciesLookupChain(isolate);
       }
     }
   } else if (*name == roots.next_string()) {
-    if (receiver->IsJSArrayIterator() ||
-        receiver->IsJSArrayIteratorPrototype()) {
+    if (IsJSArrayIterator(*receiver) || IsJSArrayIteratorPrototype(*receiver)) {
       // Setting the next property of %ArrayIteratorPrototype% also needs to
       // invalidate the array iterator protector.
       if (!Protectors::IsArrayIteratorLookupChainIntact(isolate)) return;
       Protectors::InvalidateArrayIteratorLookupChain(isolate);
-    } else if (receiver->IsJSMapIterator() ||
-               receiver->IsJSMapIteratorPrototype()) {
+    } else if (IsJSMapIterator(*receiver) ||
+               IsJSMapIteratorPrototype(*receiver)) {
       if (!Protectors::IsMapIteratorLookupChainIntact(isolate)) return;
       Protectors::InvalidateMapIteratorLookupChain(isolate);
-    } else if (receiver->IsJSSetIterator() ||
-               receiver->IsJSSetIteratorPrototype()) {
+    } else if (IsJSSetIterator(*receiver) ||
+               IsJSSetIteratorPrototype(*receiver)) {
       if (!Protectors::IsSetIteratorLookupChainIntact(isolate)) return;
       Protectors::InvalidateSetIteratorLookupChain(isolate);
-    } else if (receiver->IsJSStringIterator() ||
-               receiver->IsJSStringIteratorPrototype()) {
+    } else if (IsJSStringIterator(*receiver) ||
+               IsJSStringIteratorPrototype(*receiver)) {
       // Setting the next property of %StringIteratorPrototype% invalidates the
       // string iterator protector.
       if (!Protectors::IsStringIteratorLookupChainIntact(isolate)) return;
@@ -255,18 +255,18 @@ void LookupIterator::InternalUpdateProtector(Isolate* isolate,
   } else if (*name == roots.species_symbol()) {
     // Setting the Symbol.species property of any Array, Promise or TypedArray
     // constructor invalidates the @@species protector
-    if (receiver->IsJSArrayConstructor()) {
+    if (IsJSArrayConstructor(*receiver)) {
       if (!Protectors::IsArraySpeciesLookupChainIntact(isolate)) return;
       isolate->CountUsage(
           v8::Isolate::UseCounterFeature::kArraySpeciesModified);
       Protectors::InvalidateArraySpeciesLookupChain(isolate);
-    } else if (receiver->IsJSPromiseConstructor()) {
+    } else if (IsJSPromiseConstructor(*receiver)) {
       if (!Protectors::IsPromiseSpeciesLookupChainIntact(isolate)) return;
       Protectors::InvalidatePromiseSpeciesLookupChain(isolate);
-    } else if (receiver->IsJSRegExpConstructor()) {
+    } else if (IsJSRegExpConstructor(*receiver)) {
       if (!Protectors::IsRegExpSpeciesLookupChainIntact(isolate)) return;
       Protectors::InvalidateRegExpSpeciesLookupChain(isolate);
-    } else if (receiver->IsTypedArrayConstructor()) {
+    } else if (IsTypedArrayConstructor(*receiver)) {
       if (!Protectors::IsTypedArraySpeciesLookupChainIntact(isolate)) return;
       Protectors::InvalidateTypedArraySpeciesLookupChain(isolate);
     }
@@ -274,21 +274,21 @@ void LookupIterator::InternalUpdateProtector(Isolate* isolate,
     if (!Protectors::IsIsConcatSpreadableLookupChainIntact(isolate)) return;
     Protectors::InvalidateIsConcatSpreadableLookupChain(isolate);
   } else if (*name == roots.iterator_symbol()) {
-    if (receiver->IsJSArray(isolate)) {
+    if (IsJSArray(*receiver, isolate)) {
       if (!Protectors::IsArrayIteratorLookupChainIntact(isolate)) return;
       Protectors::InvalidateArrayIteratorLookupChain(isolate);
-    } else if (receiver->IsJSSet(isolate) || receiver->IsJSSetIterator() ||
-               receiver->IsJSSetIteratorPrototype() ||
-               receiver->IsJSSetPrototype()) {
+    } else if (IsJSSet(*receiver, isolate) || IsJSSetIterator(*receiver) ||
+               IsJSSetIteratorPrototype(*receiver) ||
+               IsJSSetPrototype(*receiver)) {
       if (Protectors::IsSetIteratorLookupChainIntact(isolate)) {
         Protectors::InvalidateSetIteratorLookupChain(isolate);
       }
-    } else if (receiver->IsJSMapIterator() ||
-               receiver->IsJSMapIteratorPrototype()) {
+    } else if (IsJSMapIterator(*receiver) ||
+               IsJSMapIteratorPrototype(*receiver)) {
       if (Protectors::IsMapIteratorLookupChainIntact(isolate)) {
         Protectors::InvalidateMapIteratorLookupChain(isolate);
       }
-    } else if (receiver->IsJSIteratorPrototype()) {
+    } else if (IsJSIteratorPrototype(*receiver)) {
       if (Protectors::IsMapIteratorLookupChainIntact(isolate)) {
         Protectors::InvalidateMapIteratorLookupChain(isolate);
       }
@@ -308,7 +308,7 @@ void LookupIterator::InternalUpdateProtector(Isolate* isolate,
     if (!Protectors::IsPromiseResolveLookupChainIntact(isolate)) return;
     // Setting the "resolve" property on any %Promise% intrinsic object
     // invalidates the Promise.resolve protector.
-    if (receiver->IsJSPromiseConstructor()) {
+    if (IsJSPromiseConstructor(*receiver)) {
       Protectors::InvalidatePromiseResolveLookupChain(isolate);
     }
   } else if (*name == roots.then_string()) {
@@ -320,21 +320,22 @@ void LookupIterator::InternalUpdateProtector(Isolate* isolate,
     // to guard the fast-path in AsyncGeneratorResolve, where we can skip
     // the ResolvePromise step and go directly to FulfillPromise if we
     // know that the Object.prototype doesn't contain a "then" method.
-    if (receiver->IsJSPromise(isolate) || receiver->IsJSObjectPrototype() ||
-        receiver->IsJSPromisePrototype()) {
+    if (IsJSPromise(*receiver, isolate) || IsJSObjectPrototype(*receiver) ||
+        IsJSPromisePrototype(*receiver)) {
       Protectors::InvalidatePromiseThenLookupChain(isolate);
     }
-  } else if (*name == roots.replace_symbol()) {
-    if (!Protectors::IsNumberStringPrototypeNoReplaceIntact(isolate)) return;
+  } else if (*name == roots.match_all_symbol() ||
+             *name == roots.replace_symbol() || *name == roots.split_symbol()) {
+    if (!Protectors::IsNumberStringNotRegexpLikeIntact(isolate)) return;
     // We need to protect the prototype chains of `Number.prototype` and
-    // `String.prototype`: that `Symbol.replace` is not added as a property on
-    // any object on these prototype chains.
-    // We detect `Number.prototype` and `String.prototype` by checking for a
-    // prototype that is a JSPrimitiveWrapper. This is a safe approximation.
-    // Using JSPrimitiveWrapper as prototype should be sufficiently rare.
-    if (receiver->map().is_prototype_map() &&
-        (receiver->IsJSPrimitiveWrapper() || receiver->IsJSObjectPrototype())) {
-      Protectors::InvalidateNumberStringPrototypeNoReplace(isolate);
+    // `String.prototype`: that `Symbol.{matchAll|replace|split}` is not added
+    // as a property on any object on these prototype chains. We detect
+    // `Number.prototype` and `String.prototype` by checking for a prototype
+    // that is a JSPrimitiveWrapper. This is a safe approximation. Using
+    // JSPrimitiveWrapper as prototype should be sufficiently rare.
+    if (receiver->map()->is_prototype_map() &&
+        (IsJSPrimitiveWrapper(*receiver) || IsJSObjectPrototype(*receiver))) {
+      Protectors::InvalidateNumberStringNotRegexpLike(isolate);
     }
   }
 }
@@ -342,18 +343,18 @@ void LookupIterator::InternalUpdateProtector(Isolate* isolate,
 void LookupIterator::PrepareForDataProperty(Handle<Object> value) {
   DCHECK(state_ == DATA || state_ == ACCESSOR);
   DCHECK(HolderIsReceiverOrHiddenPrototype());
-  DCHECK(!receiver_->IsWasmObject(isolate_));
+  DCHECK(!IsWasmObject(*receiver_, isolate_));
 
   Handle<JSReceiver> holder = GetHolder<JSReceiver>();
   // We are not interested in tracking constness of a JSProxy's direct
   // properties.
-  DCHECK_IMPLIES(holder->IsJSProxy(isolate_), name()->IsPrivate(isolate_));
-  if (holder->IsJSProxy(isolate_)) return;
+  DCHECK_IMPLIES(IsJSProxy(*holder, isolate_), name()->IsPrivate(isolate_));
+  if (IsJSProxy(*holder, isolate_)) return;
 
   if (IsElement(*holder)) {
     Handle<JSObject> holder_obj = Handle<JSObject>::cast(holder);
     ElementsKind kind = holder_obj->GetElementsKind(isolate_);
-    ElementsKind to = value->OptimalElementsKind(isolate_);
+    ElementsKind to = Object::OptimalElementsKind(*value, isolate_);
     if (IsHoleyElementsKind(kind)) to = GetHoleyElementsKind(to);
     to = GetMoreGeneralElementsKind(kind, to);
 
@@ -369,9 +370,10 @@ void LookupIterator::PrepareForDataProperty(Handle<Object> value) {
     return;
   }
 
-  if (holder->IsJSGlobalObject(isolate_)) {
+  if (IsJSGlobalObject(*holder, isolate_)) {
     Handle<GlobalDictionary> dictionary(
-        JSGlobalObject::cast(*holder).global_dictionary(isolate_, kAcquireLoad),
+        JSGlobalObject::cast(*holder)->global_dictionary(isolate_,
+                                                         kAcquireLoad),
         isolate());
     Handle<PropertyCell> cell(dictionary->CellAt(isolate_, dictionary_entry()),
                               isolate());
@@ -398,15 +400,16 @@ void LookupIterator::PrepareForDataProperty(Handle<Object> value) {
         // Therefore, we need to perform the necessary updates to the property
         // details and the prototype validity cell directly.
         if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-          SwissNameDictionary dict = holder->property_dictionary_swiss();
-          dict.DetailsAtPut(dictionary_entry(), property_details_);
+          Tagged<SwissNameDictionary> dict =
+              holder->property_dictionary_swiss();
+          dict->DetailsAtPut(dictionary_entry(), property_details_);
         } else {
-          NameDictionary dict = holder->property_dictionary();
-          dict.DetailsAtPut(dictionary_entry(), property_details_);
+          Tagged<NameDictionary> dict = holder->property_dictionary();
+          dict->DetailsAtPut(dictionary_entry(), property_details_);
         }
 
-        Map old_map = holder->map(isolate_);
-        if (old_map.is_prototype_map()) {
+        Tagged<Map> old_map = holder->map(isolate_);
+        if (old_map->is_prototype_map()) {
           JSObject::InvalidatePrototypeChains(old_map);
         }
       }
@@ -427,7 +430,7 @@ void LookupIterator::PrepareForDataProperty(Handle<Object> value) {
     if (old_map.is_identical_to(new_map)) {
       // Update the property details if the representation was None.
       if (constness() != new_constness || representation().IsNone()) {
-        property_details_ = new_map->instance_descriptors(isolate_).GetDetails(
+        property_details_ = new_map->instance_descriptors(isolate_)->GetDetails(
             descriptor_number());
       }
       return;
@@ -450,11 +453,12 @@ void LookupIterator::PrepareForDataProperty(Handle<Object> value) {
         property_details_.CopyWithConstness(PropertyConstness::kMutable);
 
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-      SwissNameDictionary dict = holder_obj->property_dictionary_swiss();
-      dict.DetailsAtPut(dictionary_entry(), property_details_);
+      Tagged<SwissNameDictionary> dict =
+          holder_obj->property_dictionary_swiss();
+      dict->DetailsAtPut(dictionary_entry(), property_details_);
     } else {
-      NameDictionary dict = holder_obj->property_dictionary();
-      dict.DetailsAtPut(dictionary_entry(), property_details_);
+      Tagged<NameDictionary> dict = holder_obj->property_dictionary();
+      dict->DetailsAtPut(dictionary_entry(), property_details_);
     }
 
     DCHECK_IMPLIES(new_map->is_prototype_map(),
@@ -468,10 +472,10 @@ void LookupIterator::ReconfigureDataProperty(Handle<Object> value,
   DCHECK(HolderIsReceiverOrHiddenPrototype());
 
   Handle<JSReceiver> holder = GetHolder<JSReceiver>();
-  if (V8_UNLIKELY(holder->IsWasmObject())) UNREACHABLE();
+  if (V8_UNLIKELY(IsWasmObject(*holder))) UNREACHABLE();
 
   // Property details can never change for private properties.
-  if (holder->IsJSProxy(isolate_)) {
+  if (IsJSProxy(*holder, isolate_)) {
     DCHECK(name()->IsPrivate(isolate_));
     return;
   }
@@ -503,7 +507,7 @@ void LookupIterator::ReconfigureDataProperty(Handle<Object> value,
   }
 
   if (!IsElement(*holder) && !holder_obj->HasFastProperties(isolate_)) {
-    if (holder_obj->map(isolate_).is_prototype_map() &&
+    if (holder_obj->map(isolate_)->is_prototype_map() &&
         (((property_details_.attributes() & READ_ONLY) == 0 &&
           (attributes & READ_ONLY) != 0) ||
          (property_details_.attributes() & DONT_ENUM) !=
@@ -515,12 +519,12 @@ void LookupIterator::ReconfigureDataProperty(Handle<Object> value,
       // enumerability to clear the prototype chain enum cache.
       JSObject::InvalidatePrototypeChains(holder->map(isolate_));
     }
-    if (holder_obj->IsJSGlobalObject(isolate_)) {
+    if (IsJSGlobalObject(*holder_obj, isolate_)) {
       PropertyDetails details(PropertyKind::kData, attributes,
                               PropertyCellType::kMutable);
       Handle<GlobalDictionary> dictionary(
           JSGlobalObject::cast(*holder_obj)
-              .global_dictionary(isolate_, kAcquireLoad),
+              ->global_dictionary(isolate_, kAcquireLoad),
           isolate());
 
       Handle<PropertyCell> cell = PropertyCell::PrepareForAndSetValue(
@@ -568,10 +572,10 @@ void LookupIterator::ReconfigureDataProperty(Handle<Object> value,
 void LookupIterator::PrepareTransitionToDataProperty(
     Handle<JSReceiver> receiver, Handle<Object> value,
     PropertyAttributes attributes, StoreOrigin store_origin) {
-  DCHECK_IMPLIES(receiver->IsJSProxy(isolate_), name()->IsPrivate(isolate_));
+  DCHECK_IMPLIES(IsJSProxy(*receiver, isolate_), name()->IsPrivate(isolate_));
   DCHECK_IMPLIES(!receiver.is_identical_to(GetStoreTarget<JSReceiver>()),
                  name()->IsPrivateName());
-  DCHECK(!receiver->IsAlwaysSharedSpaceJSObject());
+  DCHECK(!IsAlwaysSharedSpaceJSObject(*receiver));
   if (state_ == TRANSITION) return;
 
   if (!IsElement() && name()->IsPrivate(isolate_)) {
@@ -579,8 +583,8 @@ void LookupIterator::PrepareTransitionToDataProperty(
   }
 
   DCHECK(state_ != LookupIterator::ACCESSOR ||
-         (GetAccessors()->IsAccessorInfo(isolate_) &&
-          AccessorInfo::cast(*GetAccessors()).is_special_data_property()));
+         (IsAccessorInfo(*GetAccessors(), isolate_) &&
+          AccessorInfo::cast(*GetAccessors())->is_special_data_property()));
   DCHECK_NE(INTEGER_INDEXED_EXOTIC, state_);
   DCHECK(state_ == NOT_FOUND || !HolderIsReceiverOrHiddenPrototype());
 
@@ -589,8 +593,8 @@ void LookupIterator::PrepareTransitionToDataProperty(
   // Dictionary maps can always have additional data properties.
   if (map->is_dictionary_map()) {
     state_ = TRANSITION;
-    if (map->IsJSGlobalObjectMap()) {
-      DCHECK(!value->IsTheHole(isolate_));
+    if (IsJSGlobalObjectMap(*map)) {
+      DCHECK(!IsTheHole(*value, isolate_));
       // Don't set enumeration index (it will be set during value store).
       property_details_ =
           PropertyDetails(PropertyKind::kData, attributes,
@@ -615,7 +619,7 @@ void LookupIterator::PrepareTransitionToDataProperty(
   transition_ = transition;
 
   if (transition->is_dictionary_map()) {
-    DCHECK(!transition->IsJSGlobalObjectMap());
+    DCHECK(!IsJSGlobalObjectMap(*transition));
     // Don't set enumeration index (it will be set during value store).
     property_details_ =
         PropertyDetails(PropertyKind::kData, attributes,
@@ -633,7 +637,7 @@ void LookupIterator::ApplyTransitionToDataProperty(
   DCHECK_IMPLIES(!receiver.is_identical_to(GetStoreTarget<JSReceiver>()),
                  name()->IsPrivateName());
   holder_ = receiver;
-  if (receiver->IsJSGlobalObject(isolate_)) {
+  if (IsJSGlobalObject(*receiver, isolate_)) {
     JSObject::InvalidatePrototypeChains(receiver->map(isolate_));
 
     // Install a property cell.
@@ -666,7 +670,7 @@ void LookupIterator::ApplyTransitionToDataProperty(
     transition->set_prototype_validity_cell(*validity_cell, kRelaxedStore);
   }
 
-  if (!receiver->IsJSProxy(isolate_)) {
+  if (!IsJSProxy(*receiver, isolate_)) {
     JSObject::MigrateToMap(isolate_, Handle<JSObject>::cast(receiver),
                            transition);
   }
@@ -675,9 +679,9 @@ void LookupIterator::ApplyTransitionToDataProperty(
     number_ = transition->LastAdded();
     property_details_ = transition->GetLastDescriptorDetails(isolate_);
     state_ = DATA;
-  } else if (receiver->map(isolate_).is_dictionary_map()) {
-    if (receiver->map(isolate_).is_prototype_map() &&
-        receiver->IsJSObject(isolate_)) {
+  } else if (receiver->map(isolate_)->is_dictionary_map()) {
+    if (receiver->map(isolate_)->is_prototype_map() &&
+        IsJSObject(*receiver, isolate_)) {
       JSObject::InvalidatePrototypeChains(receiver->map(isolate_));
     }
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -699,8 +703,8 @@ void LookupIterator::ApplyTransitionToDataProperty(
                               property_details_, &number_);
       receiver->SetProperties(*dictionary);
       // TODO(pthier): Add flags to swiss dictionaries.
-      if (name()->IsInterestingSymbol()) {
-        dictionary->set_may_have_interesting_symbols(true);
+      if (name()->IsInteresting(isolate())) {
+        dictionary->set_may_have_interesting_properties(true);
       }
       // Reload details containing proper enumeration index value.
       property_details_ = dictionary->DetailsAt(number_);
@@ -721,7 +725,7 @@ void LookupIterator::Delete() {
     accessor->Delete(object, number_);
   } else {
     DCHECK(!name()->IsPrivateName(isolate_));
-    bool is_prototype_map = holder->map(isolate_).is_prototype_map();
+    bool is_prototype_map = holder->map(isolate_)->is_prototype_map();
     RCS_SCOPE(isolate_,
               is_prototype_map
                   ? RuntimeCallCounterId::kPrototypeObject_DeleteProperty
@@ -736,7 +740,7 @@ void LookupIterator::Delete() {
       ReloadPropertyInformation<false>();
     }
     JSReceiver::DeleteNormalizedProperty(holder, dictionary_entry());
-    if (holder->IsJSObject(isolate_)) {
+    if (IsJSObject(*holder, isolate_)) {
       JSObject::ReoptimizeIfPrototype(Handle<JSObject>::cast(holder));
     }
   }
@@ -746,7 +750,7 @@ void LookupIterator::Delete() {
 void LookupIterator::TransitionToAccessorProperty(
     Handle<Object> getter, Handle<Object> setter,
     PropertyAttributes attributes) {
-  DCHECK(!getter->IsNull(isolate_) || !setter->IsNull(isolate_));
+  DCHECK(!IsNull(*getter, isolate_) || !IsNull(*setter, isolate_));
   // Can only be called when the receiver is a JSObject. JSProxy has to be
   // handled via a trap. Adding properties to primitive values is not
   // observable.
@@ -755,7 +759,7 @@ void LookupIterator::TransitionToAccessorProperty(
     attributes = static_cast<PropertyAttributes>(attributes | DONT_ENUM);
   }
 
-  if (!IsElement(*receiver) && !receiver->map(isolate_).is_dictionary_map()) {
+  if (!IsElement(*receiver) && !receiver->map(isolate_)->is_dictionary_map()) {
     Handle<Map> old_map(receiver->map(isolate_), isolate_);
 
     if (!holder_.is_identical_to(receiver)) {
@@ -786,7 +790,7 @@ void LookupIterator::TransitionToAccessorProperty(
   }
 
   Handle<AccessorPair> pair;
-  if (state() == ACCESSOR && GetAccessors()->IsAccessorPair(isolate_)) {
+  if (state() == ACCESSOR && IsAccessorPair(*GetAccessors(), isolate_)) {
     pair = Handle<AccessorPair>::cast(GetAccessors());
     // If the component and attributes are identical, nothing has to be done.
     if (pair->Equals(*getter, *setter)) {
@@ -830,14 +834,14 @@ void LookupIterator::TransitionToAccessorPair(Handle<Object> pair,
     receiver->RequireSlowElements(*dictionary);
 
     if (receiver->HasSlowArgumentsElements(isolate_)) {
-      SloppyArgumentsElements parameter_map =
+      Tagged<SloppyArgumentsElements> parameter_map =
           SloppyArgumentsElements::cast(receiver->elements(isolate_));
-      uint32_t length = parameter_map.length();
+      uint32_t length = parameter_map->length();
       if (number_.is_found() && number_.as_uint32() < length) {
-        parameter_map.set_mapped_entries(
+        parameter_map->set_mapped_entries(
             number_.as_int(), ReadOnlyRoots(isolate_).the_hole_value());
       }
-      parameter_map.set_arguments(*dictionary);
+      parameter_map->set_arguments(*dictionary);
     } else {
       receiver->set_elements(*dictionary);
     }
@@ -845,7 +849,7 @@ void LookupIterator::TransitionToAccessorPair(Handle<Object> pair,
     ReloadPropertyInformation<true>();
   } else {
     PropertyNormalizationMode mode = CLEAR_INOBJECT_PROPERTIES;
-    if (receiver->map(isolate_).is_prototype_map()) {
+    if (receiver->map(isolate_)->is_prototype_map()) {
       JSObject::InvalidatePrototypeChains(receiver->map(isolate_));
       mode = KEEP_INOBJECT_PROPERTIES;
     }
@@ -873,29 +877,29 @@ bool LookupIterator::HolderIsReceiverOrHiddenPrototype() const {
   // Optimization that only works if configuration_ is not mutable.
   if (!check_prototype_chain()) return true;
   if (*receiver_ == *holder_) return true;
-  if (!receiver_->IsJSGlobalProxy(isolate_)) return false;
-  return Handle<JSGlobalProxy>::cast(receiver_)->map(isolate_).prototype(
+  if (!IsJSGlobalProxy(*receiver_, isolate_)) return false;
+  return Handle<JSGlobalProxy>::cast(receiver_)->map(isolate_)->prototype(
              isolate_) == *holder_;
 }
 
 Handle<Object> LookupIterator::FetchValue(
     AllocationPolicy allocation_policy) const {
-  Object result;
-  DCHECK(!holder_->IsWasmObject());
+  Tagged<Object> result;
+  DCHECK(!IsWasmObject(*holder_));
   if (IsElement(*holder_)) {
     Handle<JSObject> holder = GetHolder<JSObject>();
     ElementsAccessor* accessor = holder->GetElementsAccessor(isolate_);
     return accessor->Get(isolate_, holder, number_);
-  } else if (holder_->IsJSGlobalObject(isolate_)) {
+  } else if (IsJSGlobalObject(*holder_, isolate_)) {
     Handle<JSGlobalObject> holder = GetHolder<JSGlobalObject>();
     result = holder->global_dictionary(isolate_, kAcquireLoad)
-                 .ValueAt(isolate_, dictionary_entry());
+                 ->ValueAt(isolate_, dictionary_entry());
   } else if (!holder_->HasFastProperties(isolate_)) {
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-      result = holder_->property_dictionary_swiss(isolate_).ValueAt(
+      result = holder_->property_dictionary_swiss(isolate_)->ValueAt(
           dictionary_entry());
     } else {
-      result = holder_->property_dictionary(isolate_).ValueAt(
+      result = holder_->property_dictionary(isolate_)->ValueAt(
           isolate_, dictionary_entry());
     }
   } else if (property_details_.location() == PropertyLocation::kField) {
@@ -911,18 +915,19 @@ Handle<Object> LookupIterator::FetchValue(
         isolate_, holder, property_details_.representation(), field_index);
   } else {
     result =
-        holder_->map(isolate_).instance_descriptors(isolate_).GetStrongValue(
+        holder_->map(isolate_)->instance_descriptors(isolate_)->GetStrongValue(
             isolate_, descriptor_number());
   }
   return handle(result, isolate_);
 }
 
-bool LookupIterator::CanStayConst(Object value) const {
+bool LookupIterator::CanStayConst(Tagged<Object> value) const {
+  DCHECK(!holder_.is_null());
   DCHECK(!IsElement(*holder_));
   DCHECK(holder_->HasFastProperties(isolate_));
   DCHECK_EQ(PropertyLocation::kField, property_details_.location());
   DCHECK_EQ(PropertyConstness::kConst, property_details_.constness());
-  if (value.IsUninitialized(isolate())) {
+  if (IsUninitialized(value, isolate())) {
     // Storing uninitialized value means that we are preparing for a computed
     // property value in an object literal. The initializing store will follow
     // and it will properly update constness based on the actual value.
@@ -932,11 +937,12 @@ bool LookupIterator::CanStayConst(Object value) const {
   FieldIndex field_index =
       FieldIndex::ForDetails(holder->map(isolate_), property_details_);
   if (property_details_.representation().IsDouble()) {
-    if (!value.IsNumber(isolate_)) return false;
+    if (!IsNumber(value, isolate_)) return false;
     uint64_t bits;
-    Object current_value = holder->RawFastPropertyAt(isolate_, field_index);
-    DCHECK(current_value.IsHeapNumber(isolate_));
-    bits = HeapNumber::cast(current_value).value_as_bits(kRelaxedLoad);
+    Tagged<Object> current_value =
+        holder->RawFastPropertyAt(isolate_, field_index);
+    DCHECK(IsHeapNumber(current_value, isolate_));
+    bits = HeapNumber::cast(current_value)->value_as_bits(kRelaxedLoad);
     // Use bit representation of double to check for hole double, since
     // manipulating the signaling NaN used for the hole in C++, e.g. with
     // base::bit_cast or value(), will change its value on ia32 (the x87
@@ -946,36 +952,38 @@ bool LookupIterator::CanStayConst(Object value) const {
     return bits == kHoleNanInt64;
   }
 
-  Object current_value = holder->RawFastPropertyAt(isolate_, field_index);
-  return current_value.IsUninitialized(isolate());
+  Tagged<Object> current_value =
+      holder->RawFastPropertyAt(isolate_, field_index);
+  return IsUninitialized(current_value, isolate());
 }
 
-bool LookupIterator::DictCanStayConst(Object value) const {
+bool LookupIterator::DictCanStayConst(Tagged<Object> value) const {
+  DCHECK(!holder_.is_null());
   DCHECK(!IsElement(*holder_));
   DCHECK(!holder_->HasFastProperties(isolate_));
-  DCHECK(!holder_->IsJSGlobalObject());
-  DCHECK(!holder_->IsJSProxy());
+  DCHECK(!IsJSGlobalObject(*holder_));
+  DCHECK(!IsJSProxy(*holder_));
   DCHECK_EQ(PropertyConstness::kConst, property_details_.constness());
 
   DisallowHeapAllocation no_gc;
 
-  if (value.IsUninitialized(isolate())) {
+  if (IsUninitialized(value, isolate())) {
     // Storing uninitialized value means that we are preparing for a computed
     // property value in an object literal. The initializing store will follow
     // and it will properly update constness based on the actual value.
     return true;
   }
   Handle<JSReceiver> holder = GetHolder<JSReceiver>();
-  Object current_value;
+  Tagged<Object> current_value;
   if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-    SwissNameDictionary dict = holder->property_dictionary_swiss();
-    current_value = dict.ValueAt(dictionary_entry());
+    Tagged<SwissNameDictionary> dict = holder->property_dictionary_swiss();
+    current_value = dict->ValueAt(dictionary_entry());
   } else {
-    NameDictionary dict = holder->property_dictionary();
-    current_value = dict.ValueAt(dictionary_entry());
+    Tagged<NameDictionary> dict = holder->property_dictionary();
+    current_value = dict->ValueAt(dictionary_entry());
   }
 
-  return current_value.IsUninitialized(isolate());
+  return IsUninitialized(current_value, isolate());
 }
 
 int LookupIterator::GetFieldDescriptorIndex() const {
@@ -997,6 +1005,7 @@ int LookupIterator::GetAccessorIndex() const {
 
 FieldIndex LookupIterator::GetFieldIndex() const {
   DCHECK(has_property_);
+  DCHECK(!holder_.is_null());
   DCHECK(holder_->HasFastProperties(isolate_));
   DCHECK_EQ(PropertyLocation::kField, property_details_.location());
   DCHECK(!IsElement(*holder_));
@@ -1004,10 +1013,11 @@ FieldIndex LookupIterator::GetFieldIndex() const {
 }
 
 Handle<PropertyCell> LookupIterator::GetPropertyCell() const {
+  DCHECK(!holder_.is_null());
   DCHECK(!IsElement(*holder_));
   Handle<JSGlobalObject> holder = GetHolder<JSGlobalObject>();
   return handle(holder->global_dictionary(isolate_, kAcquireLoad)
-                    .CellAt(isolate_, dictionary_entry()),
+                    ->CellAt(isolate_, dictionary_entry()),
                 isolate_);
 }
 
@@ -1027,19 +1037,19 @@ Handle<Object> LookupIterator::GetDataValue(SeqCstAccessTag tag) const {
   DCHECK_EQ(DATA, state_);
   // Currently only shared structs and arrays support sequentially consistent
   // access.
-  if (holder_->IsJSSharedStruct(isolate_)) {
-    DCHECK_EQ(PropertyLocation::kField, property_details_.location());
-    DCHECK_EQ(PropertyKind::kData, property_details_.kind());
-    Handle<JSSharedStruct> holder = GetHolder<JSSharedStruct>();
-    FieldIndex field_index =
-        FieldIndex::ForDetails(holder->map(isolate_), property_details_);
-    return JSObject::FastPropertyAt(
-        isolate_, holder, property_details_.representation(), field_index, tag);
+  DCHECK(IsJSSharedStruct(*holder_, isolate_) ||
+         IsJSSharedArray(*holder_, isolate_));
+  Handle<JSObject> holder = GetHolder<JSObject>();
+  if (IsElement(*holder)) {
+    ElementsAccessor* accessor = holder->GetElementsAccessor(isolate_);
+    return accessor->GetAtomic(isolate_, holder, number_, kSeqCstAccess);
   }
-  DCHECK(holder_->IsJSSharedArray(isolate_));
-  Handle<JSSharedArray> holder = GetHolder<JSSharedArray>();
-  ElementsAccessor* accessor = holder->GetElementsAccessor(isolate_);
-  return accessor->GetAtomic(isolate_, holder, number_, kSeqCstAccess);
+  DCHECK_EQ(PropertyLocation::kField, property_details_.location());
+  DCHECK_EQ(PropertyKind::kData, property_details_.kind());
+  FieldIndex field_index =
+      FieldIndex::ForDetails(holder->map(isolate_), property_details_);
+  return JSObject::FastPropertyAt(
+      isolate_, holder, property_details_.representation(), field_index, tag);
 }
 
 void LookupIterator::WriteDataValue(Handle<Object> value,
@@ -1047,8 +1057,8 @@ void LookupIterator::WriteDataValue(Handle<Object> value,
   DCHECK_EQ(DATA, state_);
   // WriteDataValueToWasmObject() must be used instead for writing to
   // WasmObjects.
-  DCHECK(!holder_->IsWasmObject(isolate_));
-  DCHECK_IMPLIES(holder_->IsJSSharedStruct(), value->IsShared());
+  DCHECK(!IsWasmObject(*holder_, isolate_));
+  DCHECK_IMPLIES(IsJSSharedStruct(*holder_), IsShared(*value));
 
   Handle<JSReceiver> holder = GetHolder<JSReceiver>();
   if (IsElement(*holder)) {
@@ -1056,45 +1066,47 @@ void LookupIterator::WriteDataValue(Handle<Object> value,
     ElementsAccessor* accessor = object->GetElementsAccessor(isolate_);
     accessor->Set(object, number_, *value);
   } else if (holder->HasFastProperties(isolate_)) {
-    DCHECK(holder->IsJSObject(isolate_));
+    DCHECK(IsJSObject(*holder, isolate_));
     if (property_details_.location() == PropertyLocation::kField) {
       // Check that in case of VariableMode::kConst field the existing value is
       // equal to |value|.
       DCHECK_IMPLIES(!initializing_store && property_details_.constness() ==
                                                 PropertyConstness::kConst,
                      CanStayConst(*value));
-      JSObject::cast(*holder).WriteToField(descriptor_number(),
-                                           property_details_, *value);
+      JSObject::cast(*holder)->WriteToField(descriptor_number(),
+                                            property_details_, *value);
     } else {
       DCHECK_EQ(PropertyLocation::kDescriptor, property_details_.location());
       DCHECK_EQ(PropertyConstness::kConst, property_details_.constness());
     }
-  } else if (holder->IsJSGlobalObject(isolate_)) {
+  } else if (IsJSGlobalObject(*holder, isolate_)) {
     // PropertyCell::PrepareForAndSetValue already wrote the value into the
     // cell.
 #ifdef DEBUG
-    GlobalDictionary dictionary =
-        JSGlobalObject::cast(*holder).global_dictionary(isolate_, kAcquireLoad);
-    PropertyCell cell = dictionary.CellAt(isolate_, dictionary_entry());
-    DCHECK(cell.value() == *value ||
-           (cell.value().IsString() && value->IsString() &&
-            String::cast(cell.value()).Equals(String::cast(*value))));
+    Tagged<GlobalDictionary> dictionary =
+        JSGlobalObject::cast(*holder)->global_dictionary(isolate_,
+                                                         kAcquireLoad);
+    Tagged<PropertyCell> cell =
+        dictionary->CellAt(isolate_, dictionary_entry());
+    DCHECK(cell->value() == *value ||
+           (IsString(cell->value()) && IsString(*value) &&
+            String::cast(cell->value())->Equals(String::cast(*value))));
 #endif  // DEBUG
   } else {
-    DCHECK_IMPLIES(holder->IsJSProxy(isolate_), name()->IsPrivate(isolate_));
+    DCHECK_IMPLIES(IsJSProxy(*holder, isolate_), name()->IsPrivate(isolate_));
     // Check similar to fast mode case above.
     DCHECK_IMPLIES(
         V8_DICT_PROPERTY_CONST_TRACKING_BOOL && !initializing_store &&
             property_details_.constness() == PropertyConstness::kConst,
-        holder->IsJSProxy(isolate_) || DictCanStayConst(*value));
+        IsJSProxy(*holder, isolate_) || DictCanStayConst(*value));
 
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-      SwissNameDictionary dictionary =
+      Tagged<SwissNameDictionary> dictionary =
           holder->property_dictionary_swiss(isolate_);
-      dictionary.ValueAtPut(dictionary_entry(), *value);
+      dictionary->ValueAtPut(dictionary_entry(), *value);
     } else {
-      NameDictionary dictionary = holder->property_dictionary(isolate_);
-      dictionary.ValueAtPut(dictionary_entry(), *value);
+      Tagged<NameDictionary> dictionary = holder->property_dictionary(isolate_);
+      dictionary->ValueAtPut(dictionary_entry(), *value);
     }
   }
 }
@@ -1103,20 +1115,20 @@ void LookupIterator::WriteDataValue(Handle<Object> value, SeqCstAccessTag tag) {
   DCHECK_EQ(DATA, state_);
   // Currently only shared structs and arrays support sequentially consistent
   // access.
-  if (holder_->IsJSSharedStruct(isolate_)) {
-    DCHECK_EQ(PropertyLocation::kField, property_details_.location());
-    DCHECK_EQ(PropertyKind::kData, property_details_.kind());
-    Handle<JSSharedStruct> holder = GetHolder<JSSharedStruct>();
-    DisallowGarbageCollection no_gc;
-    FieldIndex field_index =
-        FieldIndex::ForDescriptor(holder->map(isolate_), descriptor_number());
-    holder->FastPropertyAtPut(field_index, *value, tag);
+  DCHECK(IsJSSharedStruct(*holder_, isolate_) ||
+         IsJSSharedArray(*holder_, isolate_));
+  Handle<JSObject> holder = GetHolder<JSObject>();
+  if (IsElement(*holder)) {
+    ElementsAccessor* accessor = holder->GetElementsAccessor(isolate_);
+    accessor->SetAtomic(holder, number_, *value, kSeqCstAccess);
     return;
   }
-  DCHECK(holder_->IsJSSharedArray(isolate_));
-  Handle<JSSharedArray> holder = GetHolder<JSSharedArray>();
-  ElementsAccessor* accessor = holder->GetElementsAccessor(isolate_);
-  accessor->SetAtomic(holder, number_, *value, kSeqCstAccess);
+  DCHECK_EQ(PropertyLocation::kField, property_details_.location());
+  DCHECK_EQ(PropertyKind::kData, property_details_.kind());
+  DisallowGarbageCollection no_gc;
+  FieldIndex field_index =
+      FieldIndex::ForDescriptor(holder->map(isolate_), descriptor_number());
+  holder->FastPropertyAtPut(field_index, *value, tag);
 }
 
 Handle<Object> LookupIterator::SwapDataValue(Handle<Object> value,
@@ -1124,31 +1136,55 @@ Handle<Object> LookupIterator::SwapDataValue(Handle<Object> value,
   DCHECK_EQ(DATA, state_);
   // Currently only shared structs and arrays support sequentially consistent
   // access.
-  if (holder_->IsJSSharedStruct(isolate_)) {
-    DCHECK_EQ(PropertyLocation::kField, property_details_.location());
-    DCHECK_EQ(PropertyKind::kData, property_details_.kind());
-    // Currently only shared structs support sequentially consistent access.
-    Handle<JSSharedStruct> holder = GetHolder<JSSharedStruct>();
-    DisallowGarbageCollection no_gc;
-    FieldIndex field_index =
-        FieldIndex::ForDescriptor(holder->map(isolate_), descriptor_number());
-    return handle(holder->RawFastPropertyAtSwap(field_index, *value, tag),
-                  isolate_);
+  DCHECK(IsJSSharedStruct(*holder_, isolate_) ||
+         IsJSSharedArray(*holder_, isolate_));
+  Handle<JSObject> holder = GetHolder<JSObject>();
+  if (IsElement(*holder)) {
+    ElementsAccessor* accessor = holder->GetElementsAccessor(isolate_);
+    return accessor->SwapAtomic(isolate_, holder, number_, *value,
+                                kSeqCstAccess);
+  }
+  DCHECK_EQ(PropertyLocation::kField, property_details_.location());
+  DCHECK_EQ(PropertyKind::kData, property_details_.kind());
+  DisallowGarbageCollection no_gc;
+  FieldIndex field_index =
+      FieldIndex::ForDescriptor(holder->map(isolate_), descriptor_number());
+  return handle(holder->RawFastPropertyAtSwap(field_index, *value, tag),
+                isolate_);
+}
+
+Handle<Object> LookupIterator::CompareAndSwapDataValue(Handle<Object> expected,
+                                                       Handle<Object> value,
+                                                       SeqCstAccessTag tag) {
+  DCHECK_EQ(DATA, state_);
+  // Currently only shared structs and arrays support sequentially consistent
+  // access.
+  DCHECK(IsJSSharedStruct(*holder_, isolate_) ||
+         IsJSSharedArray(*holder_, isolate_));
+  DisallowGarbageCollection no_gc;
+  Handle<JSObject> holder = GetHolder<JSObject>();
+  if (IsElement(*holder)) {
+    ElementsAccessor* accessor = holder->GetElementsAccessor(isolate_);
+    return accessor->CompareAndSwapAtomic(isolate_, holder, number_, *expected,
+                                          *value, kSeqCstAccess);
   }
-  DCHECK(holder_->IsJSSharedArray(isolate_));
-  Handle<JSSharedArray> holder = GetHolder<JSSharedArray>();
-  ElementsAccessor* accessor = holder->GetElementsAccessor(isolate_);
-  return accessor->SwapAtomic(isolate_, holder, number_, *value, kSeqCstAccess);
+  DCHECK_EQ(PropertyLocation::kField, property_details_.location());
+  DCHECK_EQ(PropertyKind::kData, property_details_.kind());
+  FieldIndex field_index =
+      FieldIndex::ForDescriptor(holder->map(isolate_), descriptor_number());
+  return handle(holder->RawFastPropertyAtCompareAndSwap(field_index, *expected,
+                                                        *value, tag),
+                isolate_);
 }
 
 template <bool is_element>
-bool LookupIterator::SkipInterceptor(JSObject holder) {
-  InterceptorInfo info = GetInterceptor<is_element>(holder);
-  if (!is_element && name_->IsSymbol(isolate_) &&
-      !info.can_intercept_symbols()) {
+bool LookupIterator::SkipInterceptor(Tagged<JSObject> holder) {
+  Tagged<InterceptorInfo> info = GetInterceptor<is_element>(holder);
+  if (!is_element && IsSymbol(*name_, isolate_) &&
+      !info->can_intercept_symbols()) {
     return true;
   }
-  if (info.non_masking()) {
+  if (info->non_masking()) {
     switch (interceptor_state_) {
       case InterceptorState::kUninitialized:
         interceptor_state_ = InterceptorState::kSkipNonMasking;
@@ -1162,21 +1198,22 @@ bool LookupIterator::SkipInterceptor(JSObject holder) {
   return interceptor_state_ == InterceptorState::kProcessNonMasking;
 }
 
-JSReceiver LookupIterator::NextHolder(Map map) {
+Tagged<JSReceiver> LookupIterator::NextHolder(Tagged<Map> map) {
   DisallowGarbageCollection no_gc;
-  if (map.prototype(isolate_) == ReadOnlyRoots(isolate_).null_value()) {
+  if (map->prototype(isolate_) == ReadOnlyRoots(isolate_).null_value()) {
     return JSReceiver();
   }
-  if (!check_prototype_chain() && !map.IsJSGlobalProxyMap()) {
+  if (!check_prototype_chain() && !IsJSGlobalProxyMap(map)) {
     return JSReceiver();
   }
-  return JSReceiver::cast(map.prototype(isolate_));
+  return JSReceiver::cast(map->prototype(isolate_));
 }
 
-LookupIterator::State LookupIterator::NotFound(JSReceiver const holder) const {
-  if (!holder.IsJSTypedArray(isolate_)) return NOT_FOUND;
+LookupIterator::State LookupIterator::NotFound(
+    Tagged<JSReceiver> const holder) const {
+  if (!IsJSTypedArray(holder, isolate_)) return NOT_FOUND;
   if (IsElement()) return INTEGER_INDEXED_EXOTIC;
-  if (!name_->IsString(isolate_)) return NOT_FOUND;
+  if (!IsString(*name_, isolate_)) return NOT_FOUND;
   return IsSpecialIndex(String::cast(*name_)) ? INTEGER_INDEXED_EXOTIC
                                               : NOT_FOUND;
 }
@@ -1184,17 +1221,17 @@ LookupIterator::State LookupIterator::NotFound(JSReceiver const holder) const {
 namespace {
 
 template <bool is_element>
-bool HasInterceptor(Map map, size_t index) {
+bool HasInterceptor(Tagged<Map> map, size_t index) {
   if (is_element) {
     if (index > JSObject::kMaxElementIndex) {
       // There is currently no way to install interceptors on an object with
       // typed array elements.
-      DCHECK(!map.has_typed_array_or_rab_gsab_typed_array_elements());
-      return map.has_named_interceptor();
+      DCHECK(!map->has_typed_array_or_rab_gsab_typed_array_elements());
+      return map->has_named_interceptor();
     }
-    return map.has_indexed_interceptor();
+    return map->has_indexed_interceptor();
   } else {
-    return map.has_named_interceptor();
+    return map->has_named_interceptor();
   }
 }
 
@@ -1202,17 +1239,17 @@ bool HasInterceptor(Map map, size_t index) {
 
 template <bool is_element>
 LookupIterator::State LookupIterator::LookupInSpecialHolder(
-    Map const map, JSReceiver const holder) {
+    Tagged<Map> const map, Tagged<JSReceiver> const holder) {
   static_assert(INTERCEPTOR == BEFORE_PROPERTY);
   switch (state_) {
     case NOT_FOUND:
-      if (map.IsJSProxyMap()) {
+      if (IsJSProxyMap(map)) {
         if (is_element || !name_->IsPrivate(isolate_)) return JSPROXY;
       }
 #if V8_ENABLE_WEBASSEMBLY
-      if (map.IsWasmObjectMap()) return WASM_OBJECT;
+      if (IsWasmObjectMap(map)) return WASM_OBJECT;
 #endif  // V8_ENABLE_WEBASSEMBLY
-      if (map.is_access_check_needed()) {
+      if (map->is_access_check_needed()) {
         if (is_element || !name_->IsPrivate(isolate_) ||
             name_->IsPrivateName(isolate_))
           return ACCESS_CHECK;
@@ -1225,16 +1262,17 @@ LookupIterator::State LookupIterator::LookupInSpecialHolder(
       }
       V8_FALLTHROUGH;
     case INTERCEPTOR:
-      if (map.IsJSGlobalObjectMap() && !is_js_array_element(is_element)) {
-        GlobalDictionary dict = JSGlobalObject::cast(holder).global_dictionary(
-            isolate_, kAcquireLoad);
-        number_ = dict.FindEntry(isolate(), name_);
+      if (IsJSGlobalObjectMap(map) && !is_js_array_element(is_element)) {
+        Tagged<GlobalDictionary> dict =
+            JSGlobalObject::cast(holder)->global_dictionary(isolate_,
+                                                            kAcquireLoad);
+        number_ = dict->FindEntry(isolate(), name_);
         if (number_.is_not_found()) return NOT_FOUND;
-        PropertyCell cell = dict.CellAt(isolate_, number_);
-        if (cell.value(isolate_).IsTheHole(isolate_)) {
+        Tagged<PropertyCell> cell = dict->CellAt(isolate_, number_);
+        if (IsPropertyCellHole(cell->value(isolate_), isolate_)) {
           return NOT_FOUND;
         }
-        property_details_ = cell.property_details();
+        property_details_ = cell->property_details();
         has_property_ = true;
         switch (property_details_.kind()) {
           case v8::internal::PropertyKind::kData:
@@ -1258,45 +1296,46 @@ LookupIterator::State LookupIterator::LookupInSpecialHolder(
 
 template <bool is_element>
 LookupIterator::State LookupIterator::LookupInRegularHolder(
-    Map const map, JSReceiver const holder) {
+    Tagged<Map> const map, Tagged<JSReceiver> const holder) {
   DisallowGarbageCollection no_gc;
   if (interceptor_state_ == InterceptorState::kProcessNonMasking) {
     return NOT_FOUND;
   }
-  DCHECK(!holder.IsWasmObject(isolate_));
+  DCHECK(!IsWasmObject(holder, isolate_));
   if (is_element && IsElement(holder)) {
-    JSObject js_object = JSObject::cast(holder);
-    ElementsAccessor* accessor = js_object.GetElementsAccessor(isolate_);
-    FixedArrayBase backing_store = js_object.elements(isolate_);
+    Tagged<JSObject> js_object = JSObject::cast(holder);
+    ElementsAccessor* accessor = js_object->GetElementsAccessor(isolate_);
+    Tagged<FixedArrayBase> backing_store = js_object->elements(isolate_);
     number_ =
         accessor->GetEntryForIndex(isolate_, js_object, backing_store, index_);
     if (number_.is_not_found()) {
-      return holder.IsJSTypedArray(isolate_) ? INTEGER_INDEXED_EXOTIC
-                                             : NOT_FOUND;
+      return IsJSTypedArray(holder, isolate_) ? INTEGER_INDEXED_EXOTIC
+                                              : NOT_FOUND;
     }
     property_details_ = accessor->GetDetails(js_object, number_);
-    if (map.has_frozen_elements()) {
+    if (map->has_frozen_elements()) {
       property_details_ = property_details_.CopyAddAttributes(FROZEN);
-    } else if (map.has_sealed_elements()) {
+    } else if (map->has_sealed_elements()) {
       property_details_ = property_details_.CopyAddAttributes(SEALED);
     }
-  } else if (!map.is_dictionary_map()) {
-    DescriptorArray descriptors = map.instance_descriptors(isolate_);
-    number_ = descriptors.SearchWithCache(isolate_, *name_, map);
+  } else if (!map->is_dictionary_map()) {
+    Tagged<DescriptorArray> descriptors = map->instance_descriptors(isolate_);
+    number_ = descriptors->SearchWithCache(isolate_, *name_, map);
     if (number_.is_not_found()) return NotFound(holder);
-    property_details_ = descriptors.GetDetails(number_);
+    property_details_ = descriptors->GetDetails(number_);
   } else {
-    DCHECK_IMPLIES(holder.IsJSProxy(isolate_), name()->IsPrivate(isolate_));
+    DCHECK_IMPLIES(IsJSProxy(holder, isolate_), name()->IsPrivate(isolate_));
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-      SwissNameDictionary dict = holder.property_dictionary_swiss(isolate_);
-      number_ = dict.FindEntry(isolate(), *name_);
+      Tagged<SwissNameDictionary> dict =
+          holder->property_dictionary_swiss(isolate_);
+      number_ = dict->FindEntry(isolate(), *name_);
       if (number_.is_not_found()) return NotFound(holder);
-      property_details_ = dict.DetailsAt(number_);
+      property_details_ = dict->DetailsAt(number_);
     } else {
-      NameDictionary dict = holder.property_dictionary(isolate_);
-      number_ = dict.FindEntry(isolate(), name_);
+      Tagged<NameDictionary> dict = holder->property_dictionary(isolate_);
+      number_ = dict->FindEntry(isolate(), name_);
       if (number_.is_not_found()) return NotFound(holder);
-      property_details_ = dict.DetailsAt(number_);
+      property_details_ = dict->DetailsAt(number_);
     }
   }
   has_property_ = true;
@@ -1319,15 +1358,15 @@ Handle<InterceptorInfo> LookupIterator::GetInterceptorForFailedAccessCheck()
   }
 
   DisallowGarbageCollection no_gc;
-  AccessCheckInfo access_check_info =
+  Tagged<AccessCheckInfo> access_check_info =
       AccessCheckInfo::Get(isolate_, Handle<JSObject>::cast(holder_));
   if (!access_check_info.is_null()) {
     // There is currently no way to create objects with typed array elements
     // and access checks.
-    DCHECK(!holder_->map().has_typed_array_or_rab_gsab_typed_array_elements());
-    Object interceptor = is_js_array_element(IsElement())
-                             ? access_check_info.indexed_interceptor()
-                             : access_check_info.named_interceptor();
+    DCHECK(!holder_->map()->has_typed_array_or_rab_gsab_typed_array_elements());
+    Tagged<Object> interceptor = is_js_array_element(IsElement())
+                                     ? access_check_info->indexed_interceptor()
+                                     : access_check_info->named_interceptor();
     if (interceptor != Object()) {
       return handle(InterceptorInfo::cast(interceptor), isolate_);
     }
@@ -1344,7 +1383,7 @@ bool LookupIterator::TryLookupCachedProperty() {
   if (state() != LookupIterator::ACCESSOR) return false;
 
   Handle<Object> accessor_pair = GetAccessors();
-  return accessor_pair->IsAccessorPair(isolate_) &&
+  return IsAccessorPair(*accessor_pair, isolate_) &&
          LookupCachedProperty(Handle<AccessorPair>::cast(accessor_pair));
 }
 
@@ -1356,14 +1395,14 @@ bool LookupIterator::LookupCachedProperty(Handle<AccessorPair> accessor_pair) {
   }
 
   DCHECK_EQ(state(), LookupIterator::ACCESSOR);
-  DCHECK(GetAccessors()->IsAccessorPair(isolate_));
+  DCHECK(IsAccessorPair(*GetAccessors(), isolate_));
 
-  Object getter = accessor_pair->getter(isolate_);
+  Tagged<Object> getter = accessor_pair->getter(isolate_);
   base::Optional<Name> maybe_name =
       FunctionTemplateInfo::TryGetCachedPropertyName(isolate(), getter);
   if (!maybe_name.has_value()) return false;
 
-  if (getter.IsJSFunction()) {
+  if (IsJSFunction(getter)) {
     // If the getter was a JSFunction there's no guarantee that the holder
     // actually has a property with the cached name. In that case look it up to
     // make sure.
@@ -1381,12 +1420,12 @@ bool LookupIterator::LookupCachedProperty(Handle<AccessorPair> accessor_pair) {
 }
 
 // static
-base::Optional<Object> ConcurrentLookupIterator::TryGetOwnCowElement(
-    Isolate* isolate, FixedArray array_elements, ElementsKind elements_kind,
-    int array_length, size_t index) {
+base::Optional<Tagged<Object>> ConcurrentLookupIterator::TryGetOwnCowElement(
+    Isolate* isolate, Tagged<FixedArray> array_elements,
+    ElementsKind elements_kind, int array_length, size_t index) {
   DisallowGarbageCollection no_gc;
 
-  CHECK_EQ(array_elements.map(), ReadOnlyRoots(isolate).fixed_cow_array_map());
+  CHECK_EQ(array_elements->map(), ReadOnlyRoots(isolate).fixed_cow_array_map());
   DCHECK(IsFastElementsKind(elements_kind) &&
          IsSmiOrObjectElementsKind(elements_kind));
   USE(elements_kind);
@@ -1404,9 +1443,9 @@ base::Optional<Object> ConcurrentLookupIterator::TryGetOwnCowElement(
   // The former is the source of truth, but due to concurrent reads it may not
   // match the given `array_elements`.
   if (index >= static_cast<size_t>(array_length)) return {};
-  if (index >= static_cast<size_t>(array_elements.length())) return {};
+  if (index >= static_cast<size_t>(array_elements->length())) return {};
 
-  Object result = array_elements.get(isolate, static_cast<int>(index));
+  Tagged<Object> result = array_elements->get(isolate, static_cast<int>(index));
 
   //  ______________________________________
   // ( Filter out holes irrespective of the )
@@ -1427,9 +1466,9 @@ base::Optional<Object> ConcurrentLookupIterator::TryGetOwnCowElement(
 // static
 ConcurrentLookupIterator::Result
 ConcurrentLookupIterator::TryGetOwnConstantElement(
-    Object* result_out, Isolate* isolate, LocalIsolate* local_isolate,
-    JSObject holder, FixedArrayBase elements, ElementsKind elements_kind,
-    size_t index) {
+    Tagged<Object>* result_out, Isolate* isolate, LocalIsolate* local_isolate,
+    Tagged<JSObject> holder, Tagged<FixedArrayBase> elements,
+    ElementsKind elements_kind, size_t index) {
   DisallowGarbageCollection no_gc;
 
   DCHECK_LE(index, JSObject::kMaxElementIndex);
@@ -1450,12 +1489,13 @@ ConcurrentLookupIterator::TryGetOwnConstantElement(
   // - single_character_string_table()->get().
 
   if (IsFrozenElementsKind(elements_kind)) {
-    if (!elements.IsFixedArray()) return kGaveUp;
-    FixedArray elements_fixed_array = FixedArray::cast(elements);
-    if (index >= static_cast<uint32_t>(elements_fixed_array.length())) {
+    if (!IsFixedArray(elements)) return kGaveUp;
+    Tagged<FixedArray> elements_fixed_array = FixedArray::cast(elements);
+    if (index >= static_cast<uint32_t>(elements_fixed_array->length())) {
       return kGaveUp;
     }
-    Object result = elements_fixed_array.get(isolate, static_cast<int>(index));
+    Tagged<Object> result =
+        elements_fixed_array->get(isolate, static_cast<int>(index));
     if (IsHoleyElementsKindForRead(elements_kind) &&
         result == ReadOnlyRoots(isolate).the_hole_value()) {
       return kNotPresent;
@@ -1463,7 +1503,7 @@ ConcurrentLookupIterator::TryGetOwnConstantElement(
     *result_out = result;
     return kPresent;
   } else if (IsDictionaryElementsKind(elements_kind)) {
-    if (!elements.IsNumberDictionary()) return kGaveUp;
+    if (!IsNumberDictionary(elements)) return kGaveUp;
     // TODO(jgruber, v8:7790): Add support. Dictionary elements require racy
     // NumberDictionary lookups. This should be okay in general (slot iteration
     // depends only on the dict's capacity), but 1. we'd need to update
@@ -1474,10 +1514,10 @@ ConcurrentLookupIterator::TryGetOwnConstantElement(
     // In this case we don't care about the actual `elements`. All in-bounds
     // reads are redirected to the wrapped String.
 
-    JSPrimitiveWrapper js_value = JSPrimitiveWrapper::cast(holder);
-    String wrapped_string = String::cast(js_value.value());
+    Tagged<JSPrimitiveWrapper> js_value = JSPrimitiveWrapper::cast(holder);
+    Tagged<String> wrapped_string = String::cast(js_value->value());
     return ConcurrentLookupIterator::TryGetOwnChar(
-        static_cast<String*>(result_out), isolate, local_isolate,
+        reinterpret_cast<Tagged<String>*>(result_out), isolate, local_isolate,
         wrapped_string, index);
   } else {
     DCHECK(!IsFrozenElementsKind(elements_kind));
@@ -1491,33 +1531,34 @@ ConcurrentLookupIterator::TryGetOwnConstantElement(
 
 // static
 ConcurrentLookupIterator::Result ConcurrentLookupIterator::TryGetOwnChar(
-    String* result_out, Isolate* isolate, LocalIsolate* local_isolate,
-    String string, size_t index) {
+    Tagged<String>* result_out, Isolate* isolate, LocalIsolate* local_isolate,
+    Tagged<String> string, size_t index) {
   DisallowGarbageCollection no_gc;
   // The access guard below protects string accesses related to internalized
   // strings.
   // TODO(jgruber): Support other string kinds.
-  Map string_map = string.map(isolate, kAcquireLoad);
-  InstanceType type = string_map.instance_type();
+  Tagged<Map> string_map = string->map(isolate, kAcquireLoad);
+  InstanceType type = string_map->instance_type();
   if (!(InstanceTypeChecker::IsInternalizedString(type) ||
         InstanceTypeChecker::IsThinString(type))) {
     return kGaveUp;
   }
 
-  const uint32_t length = static_cast<uint32_t>(string.length());
+  const uint32_t length = static_cast<uint32_t>(string->length());
   if (index >= length) return kGaveUp;
 
   uint16_t charcode;
   {
     SharedStringAccessGuardIfNeeded access_guard(local_isolate);
-    charcode = string.Get(static_cast<int>(index), PtrComprCageBase(isolate),
-                          access_guard);
+    charcode = string->Get(static_cast<int>(index), PtrComprCageBase(isolate),
+                           access_guard);
   }
 
   if (charcode > unibrow::Latin1::kMaxChar) return kGaveUp;
 
-  Object value = isolate->factory()->single_character_string_table()->get(
-      charcode, kRelaxedLoad);
+  Tagged<Object> value =
+      isolate->factory()->single_character_string_table()->get(charcode,
+                                                               kRelaxedLoad);
 
   DCHECK_NE(value, ReadOnlyRoots(isolate).undefined_value());
 
@@ -1526,40 +1567,44 @@ ConcurrentLookupIterator::Result ConcurrentLookupIterator::TryGetOwnChar(
 }
 
 // static
-base::Optional<PropertyCell> ConcurrentLookupIterator::TryGetPropertyCell(
-    Isolate* isolate, LocalIsolate* local_isolate,
-    Handle<JSGlobalObject> holder, Handle<Name> name) {
+base::Optional<Tagged<PropertyCell>>
+ConcurrentLookupIterator::TryGetPropertyCell(Isolate* isolate,
+                                             LocalIsolate* local_isolate,
+                                             Handle<JSGlobalObject> holder,
+                                             Handle<Name> name) {
   DisallowGarbageCollection no_gc;
 
-  Map holder_map = holder->map();
-  if (holder_map.is_access_check_needed()) return {};
-  if (holder_map.has_named_interceptor()) return {};
+  Tagged<Map> holder_map = holder->map();
+  if (holder_map->is_access_check_needed()) return {};
+  if (holder_map->has_named_interceptor()) return {};
 
-  GlobalDictionary dict = holder->global_dictionary(kAcquireLoad);
-  base::Optional<PropertyCell> cell =
-      dict.TryFindPropertyCellForConcurrentLookupIterator(isolate, name,
-                                                          kRelaxedLoad);
-  if (!cell.has_value()) return {};
+  Tagged<GlobalDictionary> dict = holder->global_dictionary(kAcquireLoad);
+  base::Optional<Tagged<PropertyCell>> maybe_cell =
+      dict->TryFindPropertyCellForConcurrentLookupIterator(isolate, name,
+                                                           kRelaxedLoad);
+  if (!maybe_cell.has_value()) return {};
+  Tagged<PropertyCell> cell = maybe_cell.value();
 
   if (cell->property_details(kAcquireLoad).kind() == PropertyKind::kAccessor) {
-    Object maybe_accessor_pair = cell->value(kAcquireLoad);
-    if (!maybe_accessor_pair.IsAccessorPair()) return {};
+    Tagged<Object> maybe_accessor_pair = cell->value(kAcquireLoad);
+    if (!IsAccessorPair(maybe_accessor_pair)) return {};
 
     base::Optional<Name> maybe_cached_property_name =
         FunctionTemplateInfo::TryGetCachedPropertyName(
             isolate, AccessorPair::cast(maybe_accessor_pair)
-                         .getter(isolate, kAcquireLoad));
+                         ->getter(isolate, kAcquireLoad));
     if (!maybe_cached_property_name.has_value()) return {};
 
-    cell = dict.TryFindPropertyCellForConcurrentLookupIterator(
+    maybe_cell = dict->TryFindPropertyCellForConcurrentLookupIterator(
         isolate, handle(*maybe_cached_property_name, local_isolate),
         kRelaxedLoad);
-    if (!cell.has_value()) return {};
+    if (!maybe_cell.has_value()) return {};
+    cell = maybe_cell.value();
     if (cell->property_details(kAcquireLoad).kind() != PropertyKind::kData)
       return {};
   }
 
-  DCHECK(cell.has_value());
+  DCHECK(maybe_cell.has_value());
   DCHECK_EQ(cell->property_details(kAcquireLoad).kind(), PropertyKind::kData);
   return cell;
 }
diff --git a/deps/v8/src/objects/lookup.h b/deps/v8/src/objects/lookup.h
index 9adee79b3028c5..4ee8b47f6889f6 100644
--- a/deps/v8/src/objects/lookup.h
+++ b/deps/v8/src/objects/lookup.h
@@ -36,6 +36,11 @@ class PropertyKey {
   inline Handle<Name> GetName(Isolate* isolate);
 
  private:
+  friend LookupIterator;
+
+  // Shortcut for constructing PropertyKey from an active LookupIterator.
+  inline PropertyKey(Isolate* isolate, Handle<Name> name, size_t index);
+
   Handle<Name> name_;
   size_t index_;
 };
@@ -92,6 +97,12 @@ class V8_EXPORT_PRIVATE LookupIterator final {
                         Handle<Object> lookup_start_object,
                         Configuration configuration = DEFAULT);
 
+  // Special case for lookup of the |error_stack_trace| private symbol in
+  // prototype chain (usually private symbols are limited to
+  // OWN_SKIP_INTERCEPTOR lookups).
+  inline LookupIterator(Isolate* isolate, Configuration configuration,
+                        Handle<Object> receiver, Handle<Symbol> name);
+
   void Restart() {
     InterceptorState state = InterceptorState::kUninitialized;
     IsElement() ? RestartInternal<true>(state) : RestartInternal<false>(state);
@@ -108,13 +119,16 @@ class V8_EXPORT_PRIVATE LookupIterator final {
     return static_cast<uint32_t>(index_);
   }
 
+  // Helper method for creating a copy of of the iterator.
+  inline PropertyKey GetKey() const;
+
   // Returns true if this LookupIterator has an index in the range
   // [0, size_t::max).
   bool IsElement() const { return index_ != kInvalidIndex; }
   // Returns true if this LookupIterator has an index that counts as an
   // element for the given object (up to kMaxArrayIndex for JSArrays,
   // any integer for JSTypedArrays).
-  inline bool IsElement(JSReceiver object) const;
+  inline bool IsElement(Tagged<JSReceiver> object) const;
 
   inline bool IsPrivateName() const;
 
@@ -194,6 +208,9 @@ class V8_EXPORT_PRIVATE LookupIterator final {
   Handle<Object> GetDataValue(SeqCstAccessTag tag) const;
   void WriteDataValue(Handle<Object> value, SeqCstAccessTag tag);
   Handle<Object> SwapDataValue(Handle<Object> value, SeqCstAccessTag tag);
+  Handle<Object> CompareAndSwapDataValue(Handle<Object> expected,
+                                         Handle<Object> value,
+                                         SeqCstAccessTag tag);
   inline void UpdateProtector();
   static inline void UpdateProtector(Isolate* isolate, Handle<Object> receiver,
                                      Handle<Name> name);
@@ -214,10 +231,11 @@ class V8_EXPORT_PRIVATE LookupIterator final {
                         Handle<Object> lookup_start_object,
                         Configuration configuration);
 
-  // For |ForTransitionHandler|.
-  LookupIterator(Isolate* isolate, Handle<Object> receiver, Handle<Name> name,
-                 Handle<Map> transition_map, PropertyDetails details,
-                 bool has_property);
+  // Lookup private symbol on the prototype chain. Currently used only for
+  // error_stack_symbol.
+  inline LookupIterator(Isolate* isolate, Configuration configuration,
+                        Handle<Object> receiver, Handle<Symbol> name,
+                        Handle<Object> lookup_start_object);
 
   static void InternalUpdateProtector(Isolate* isolate, Handle<Object> receiver,
                                       Handle<Name> name);
@@ -230,7 +248,7 @@ class V8_EXPORT_PRIVATE LookupIterator final {
 
   Handle<Map> GetReceiverMap() const;
 
-  V8_WARN_UNUSED_RESULT inline JSReceiver NextHolder(Map map);
+  V8_WARN_UNUSED_RESULT inline Tagged<JSReceiver> NextHolder(Tagged<Map> map);
 
   bool is_js_array_element(bool is_element) const {
     return is_element && index_ <= JSArray::kMaxArrayIndex;
@@ -238,17 +256,17 @@ class V8_EXPORT_PRIVATE LookupIterator final {
   template <bool is_element>
   V8_EXPORT_PRIVATE void Start();
   template <bool is_element>
-  void NextInternal(Map map, JSReceiver holder);
+  void NextInternal(Tagged<Map> map, Tagged<JSReceiver> holder);
   template <bool is_element>
-  inline State LookupInHolder(Map map, JSReceiver holder) {
-    return map.IsSpecialReceiverMap()
+  inline State LookupInHolder(Tagged<Map> map, Tagged<JSReceiver> holder) {
+    return IsSpecialReceiverMap(map)
                ? LookupInSpecialHolder<is_element>(map, holder)
                : LookupInRegularHolder<is_element>(map, holder);
   }
   template <bool is_element>
-  State LookupInRegularHolder(Map map, JSReceiver holder);
+  State LookupInRegularHolder(Tagged<Map> map, Tagged<JSReceiver> holder);
   template <bool is_element>
-  State LookupInSpecialHolder(Map map, JSReceiver holder);
+  State LookupInSpecialHolder(Tagged<Map> map, Tagged<JSReceiver> holder);
   template <bool is_element>
   void RestartLookupForNonMaskingInterceptors() {
     RestartInternal<is_element>(InterceptorState::kProcessNonMasking);
@@ -257,16 +275,20 @@ class V8_EXPORT_PRIVATE LookupIterator final {
   void RestartInternal(InterceptorState interceptor_state);
   Handle<Object> FetchValue(AllocationPolicy allocation_policy =
                                 AllocationPolicy::kAllocationAllowed) const;
-  bool CanStayConst(Object value) const;
-  bool DictCanStayConst(Object value) const;
+  bool CanStayConst(Tagged<Object> value) const;
+  bool DictCanStayConst(Tagged<Object> value) const;
+
+  Handle<Object> CompareAndSwapInternal(Handle<Object> desired,
+                                        Handle<Object> value,
+                                        SeqCstAccessTag tag, bool& success);
 
   template <bool is_element>
   void ReloadPropertyInformation();
 
   template <bool is_element>
-  bool SkipInterceptor(JSObject holder);
+  bool SkipInterceptor(Tagged<JSObject> holder);
   template <bool is_element>
-  inline InterceptorInfo GetInterceptor(JSObject holder) const;
+  inline Tagged<InterceptorInfo> GetInterceptor(Tagged<JSObject> holder) const;
 
   bool check_interceptor() const {
     return (configuration_ & kInterceptor) != 0;
@@ -278,14 +300,14 @@ class V8_EXPORT_PRIVATE LookupIterator final {
                                                    Configuration configuration,
                                                    Handle<Name> name);
 
-  static Handle<JSReceiver> GetRootForNonJSReceiver(
-      Isolate* isolate, Handle<Object> lookup_start_object,
-      size_t index = kInvalidIndex);
-  static inline Handle<JSReceiver> GetRoot(Isolate* isolate,
-                                           Handle<Object> lookup_start_object,
-                                           size_t index = kInvalidIndex);
+  static MaybeHandle<JSReceiver> GetRootForNonJSReceiver(
+      Isolate* isolate, Handle<Object> lookup_start_object, size_t index,
+      Configuration configuration);
+  static inline MaybeHandle<JSReceiver> GetRoot(
+      Isolate* isolate, Handle<Object> lookup_start_object, size_t index,
+      Configuration configuration);
 
-  State NotFound(JSReceiver const holder) const;
+  State NotFound(Tagged<JSReceiver> const holder) const;
 
   // If configuration_ becomes mutable, update
   // HolderIsReceiverOrHiddenPrototype.
@@ -332,33 +354,34 @@ class ConcurrentLookupIterator final : public AllStatic {
   // consistent among themselves (e.g. the elements kind may not match the
   // given elements backing store). We are thus extra-careful to handle
   // exceptional situations.
-  V8_EXPORT_PRIVATE static base::Optional<Object> TryGetOwnCowElement(
-      Isolate* isolate, FixedArray array_elements, ElementsKind elements_kind,
-      int array_length, size_t index);
+  V8_EXPORT_PRIVATE static base::Optional<Tagged<Object>> TryGetOwnCowElement(
+      Isolate* isolate, Tagged<FixedArray> array_elements,
+      ElementsKind elements_kind, int array_length, size_t index);
 
   // As above, the contract is that the elements and elements kind should be
   // read from the same holder, but this function is implemented defensively to
   // tolerate concurrency issues.
   V8_EXPORT_PRIVATE static Result TryGetOwnConstantElement(
-      Object* result_out, Isolate* isolate, LocalIsolate* local_isolate,
-      JSObject holder, FixedArrayBase elements, ElementsKind elements_kind,
-      size_t index);
+      Tagged<Object>* result_out, Isolate* isolate, LocalIsolate* local_isolate,
+      Tagged<JSObject> holder, Tagged<FixedArrayBase> elements,
+      ElementsKind elements_kind, size_t index);
 
   // Implements the own data property lookup for the specialized case of
   // strings.
-  V8_EXPORT_PRIVATE static Result TryGetOwnChar(String* result_out,
+  V8_EXPORT_PRIVATE static Result TryGetOwnChar(Tagged<String>* result_out,
                                                 Isolate* isolate,
                                                 LocalIsolate* local_isolate,
-                                                String string, size_t index);
+                                                Tagged<String> string,
+                                                size_t index);
 
   // This method reimplements the following sequence in a concurrent setting:
   //
   // LookupIterator it(holder, isolate, name, LookupIterator::OWN);
   // it.TryLookupCachedProperty();
   // if (it.state() == LookupIterator::DATA) it.GetPropertyCell();
-  V8_EXPORT_PRIVATE static base::Optional<PropertyCell> TryGetPropertyCell(
-      Isolate* isolate, LocalIsolate* local_isolate,
-      Handle<JSGlobalObject> holder, Handle<Name> name);
+  V8_EXPORT_PRIVATE static base::Optional<Tagged<PropertyCell>>
+  TryGetPropertyCell(Isolate* isolate, LocalIsolate* local_isolate,
+                     Handle<JSGlobalObject> holder, Handle<Name> name);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/managed.h b/deps/v8/src/objects/managed.h
index d2bc931e575702..80d18e64ca37dc 100644
--- a/deps/v8/src/objects/managed.h
+++ b/deps/v8/src/objects/managed.h
@@ -50,6 +50,13 @@ class Managed : public Foreign {
  public:
   Managed() : Foreign() {}
   explicit Managed(Address ptr) : Foreign(ptr) {}
+  explicit constexpr Managed(Address ptr, SkipTypeCheckTag)
+      : Foreign(ptr, SkipTypeCheckTag{}) {}
+
+  // For every object, add a `->` operator which returns a pointer to this
+  // object. This will allow smoother transition between T and Tagged<T>.
+  Managed* operator->() { return this; }
+  const Managed* operator->() const { return this; }
 
   // Get a raw pointer to the C++ object.
   V8_INLINE CppType* raw() { return GetSharedPtrPtr()->get(); }
@@ -57,9 +64,11 @@ class Managed : public Foreign {
   // Get a reference to the shared pointer to the C++ object.
   V8_INLINE const std::shared_ptr<CppType>& get() { return *GetSharedPtrPtr(); }
 
-  static Managed cast(Object obj) { return Managed(obj.ptr()); }
-  static Managed unchecked_cast(Object obj) {
-    return base::bit_cast<Managed>(obj);
+  static Tagged<Managed> cast(Tagged<Object> obj) {
+    return Tagged<Managed>(Managed(obj.ptr()).ptr());
+  }
+  static constexpr Tagged<Managed> unchecked_cast(Tagged<Object> obj) {
+    return Tagged<Managed>(obj.ptr());
   }
 
   // Allocate a new {CppType} and wrap it in a {Managed<CppType>}.
@@ -89,6 +98,8 @@ class Managed : public Foreign {
       AllocationType allocation_type = AllocationType::kYoung);
 
  private:
+  friend class Tagged<Managed>;
+
   // Internally this {Foreign} object stores a pointer to a new
   // std::shared_ptr<CppType>.
   std::shared_ptr<CppType>* GetSharedPtrPtr() {
diff --git a/deps/v8/src/objects/map-inl.h b/deps/v8/src/objects/map-inl.h
index 592231d8d58853..4856ecb7a8d19c 100644
--- a/deps/v8/src/objects/map-inl.h
+++ b/deps/v8/src/objects/map-inl.h
@@ -8,7 +8,9 @@
 #include "src/heap/heap-write-barrier-inl.h"
 #include "src/objects/api-callbacks-inl.h"
 #include "src/objects/cell-inl.h"
+#include "src/objects/dependent-code.h"
 #include "src/objects/descriptor-array-inl.h"
+#include "src/objects/dictionary.h"
 #include "src/objects/field-type.h"
 #include "src/objects/instance-type-inl.h"
 #include "src/objects/js-function-inl.h"
@@ -37,11 +39,11 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(Map)
 
-ACCESSORS(Map, instance_descriptors, DescriptorArray,
+ACCESSORS(Map, instance_descriptors, Tagged<DescriptorArray>,
           kInstanceDescriptorsOffset)
-RELAXED_ACCESSORS(Map, instance_descriptors, DescriptorArray,
+RELAXED_ACCESSORS(Map, instance_descriptors, Tagged<DescriptorArray>,
                   kInstanceDescriptorsOffset)
-RELEASE_ACQUIRE_ACCESSORS(Map, instance_descriptors, DescriptorArray,
+RELEASE_ACQUIRE_ACCESSORS(Map, instance_descriptors, Tagged<DescriptorArray>,
                           kInstanceDescriptorsOffset)
 
 // A freshly allocated layout descriptor can be set on an existing map.
@@ -52,23 +54,24 @@ WEAK_ACCESSORS(Map, raw_transitions, kTransitionsOrPrototypeInfoOffset)
 RELEASE_ACQUIRE_WEAK_ACCESSORS(Map, raw_transitions,
                                kTransitionsOrPrototypeInfoOffset)
 
-ACCESSORS_CHECKED2(Map, prototype, HeapObject, kPrototypeOffset, true,
-                   value.IsNull() || value.IsJSProxy() ||
-                       value.IsWasmObject() ||
-                       (value.IsJSObject() && (value.InWritableSharedSpace() ||
-                                               value.map().is_prototype_map())))
+ACCESSORS_CHECKED2(Map, prototype, Tagged<HeapObject>, kPrototypeOffset, true,
+                   IsNull(value) || IsJSProxy(value) || IsWasmObject(value) ||
+                       (IsJSObject(value) &&
+                        (value.InWritableSharedSpace() ||
+                         value->map()->is_prototype_map())))
 
-DEF_GETTER(Map, prototype_info, Object) {
-  Object value = TaggedField<Object, kTransitionsOrPrototypeInfoOffset>::load(
-      cage_base, *this);
+DEF_GETTER(Map, prototype_info, Tagged<Object>) {
+  Tagged<Object> value =
+      TaggedField<Object, kTransitionsOrPrototypeInfoOffset>::load(cage_base,
+                                                                   *this);
   DCHECK(this->is_prototype_map());
   return value;
 }
-RELEASE_ACQUIRE_ACCESSORS(Map, prototype_info, Object,
+RELEASE_ACQUIRE_ACCESSORS(Map, prototype_info, Tagged<Object>,
                           kTransitionsOrPrototypeInfoOffset)
 
 void Map::init_prototype_and_constructor_or_back_pointer(ReadOnlyRoots roots) {
-  HeapObject null = roots.null_value();
+  Tagged<HeapObject> null = roots.null_value();
   TaggedField<HeapObject,
               kConstructorOrBackPointerOrNativeContextOffset>::store(*this,
                                                                      null);
@@ -120,32 +123,32 @@ BIT_FIELD_ACCESSORS(Map, relaxed_bit_field3, is_migration_target,
                     Map::Bits3::IsMigrationTargetBit)
 BIT_FIELD_ACCESSORS2(Map, relaxed_bit_field3, bit_field3, is_extensible,
                      Map::Bits3::IsExtensibleBit)
-BIT_FIELD_ACCESSORS(Map, bit_field3, may_have_interesting_symbols,
-                    Map::Bits3::MayHaveInterestingSymbolsBit)
+BIT_FIELD_ACCESSORS(Map, bit_field3, may_have_interesting_properties,
+                    Map::Bits3::MayHaveInterestingPropertiesBit)
 BIT_FIELD_ACCESSORS(Map, relaxed_bit_field3, construction_counter,
                     Map::Bits3::ConstructionCounterBits)
 
-DEF_GETTER(Map, GetNamedInterceptor, InterceptorInfo) {
+DEF_GETTER(Map, GetNamedInterceptor, Tagged<InterceptorInfo>) {
   DCHECK(has_named_interceptor());
-  FunctionTemplateInfo info = GetFunctionTemplateInfo(cage_base);
-  return InterceptorInfo::cast(info.GetNamedPropertyHandler(cage_base));
+  Tagged<FunctionTemplateInfo> info = GetFunctionTemplateInfo(cage_base);
+  return InterceptorInfo::cast(info->GetNamedPropertyHandler(cage_base));
 }
 
-DEF_GETTER(Map, GetIndexedInterceptor, InterceptorInfo) {
+DEF_GETTER(Map, GetIndexedInterceptor, Tagged<InterceptorInfo>) {
   DCHECK(has_indexed_interceptor());
-  FunctionTemplateInfo info = GetFunctionTemplateInfo(cage_base);
-  return InterceptorInfo::cast(info.GetIndexedPropertyHandler(cage_base));
+  Tagged<FunctionTemplateInfo> info = GetFunctionTemplateInfo(cage_base);
+  return InterceptorInfo::cast(info->GetIndexedPropertyHandler(cage_base));
 }
 
 // static
 bool Map::IsMostGeneralFieldType(Representation representation,
-                                 FieldType field_type) {
-  return !representation.IsHeapObject() || field_type.IsAny();
+                                 Tagged<FieldType> field_type) {
+  return !representation.IsHeapObject() || IsAny(field_type);
 }
 
 // static
-bool Map::FieldTypeIsCleared(Representation rep, FieldType type) {
-  return type.IsNone() && rep.IsHeapObject();
+bool Map::FieldTypeIsCleared(Representation rep, Tagged<FieldType> type) {
+  return IsNone(type) && rep.IsHeapObject();
 }
 
 // static
@@ -162,7 +165,7 @@ bool Map::CanHaveFastTransitionableElementsKind() const {
 bool Map::IsDetached(Isolate* isolate) const {
   if (is_prototype_map()) return true;
   return instance_type() == JS_OBJECT_TYPE && NumberOfOwnDescriptors() > 0 &&
-         GetBackPointer().IsUndefined(isolate);
+         IsUndefined(GetBackPointer(), isolate);
 }
 
 // static
@@ -187,7 +190,7 @@ Handle<Map> Map::Normalize(Isolate* isolate, Handle<Map> fast_map,
                    kUseCache, reason);
 }
 
-bool Map::EquivalentToForNormalization(const Map other,
+bool Map::EquivalentToForNormalization(const Tagged<Map> other,
                                        PropertyNormalizationMode mode) const {
   return EquivalentToForNormalization(other, elements_kind(), mode);
 }
@@ -211,12 +214,12 @@ bool Map::TooManyFastProperties(StoreOrigin store_origin) const {
   }
 }
 
-Name Map::GetLastDescriptorName(Isolate* isolate) const {
-  return instance_descriptors(isolate).GetKey(LastAdded());
+Tagged<Name> Map::GetLastDescriptorName(Isolate* isolate) const {
+  return instance_descriptors(isolate)->GetKey(LastAdded());
 }
 
 PropertyDetails Map::GetLastDescriptorDetails(Isolate* isolate) const {
-  return instance_descriptors(isolate).GetDetails(LastAdded());
+  return instance_descriptors(isolate)->GetDetails(LastAdded());
 }
 
 InternalIndex Map::LastAdded() const {
@@ -231,7 +234,7 @@ int Map::NumberOfOwnDescriptors() const {
 }
 
 void Map::SetNumberOfOwnDescriptors(int number) {
-  DCHECK_LE(number, instance_descriptors().number_of_descriptors());
+  DCHECK_LE(number, instance_descriptors()->number_of_descriptors());
   CHECK_LE(static_cast<unsigned>(number),
            static_cast<unsigned>(kMaxNumberOfDescriptors));
   set_release_acquire_bit_field3(
@@ -255,8 +258,8 @@ void Map::SetEnumLength(int length) {
   set_relaxed_bit_field3(Bits3::EnumLengthBits::update(bit_field3(), length));
 }
 
-FixedArrayBase Map::GetInitialElements() const {
-  FixedArrayBase result;
+Tagged<FixedArrayBase> Map::GetInitialElements() const {
+  Tagged<FixedArrayBase> result;
   if (has_fast_elements() || has_fast_string_wrapper_elements() ||
       has_any_nonextensible_elements()) {
     result = GetReadOnlyRoots().empty_fixed_array();
@@ -278,7 +281,7 @@ VisitorId Map::visitor_id() const {
 
 void Map::set_visitor_id(VisitorId id) {
   CHECK_LT(static_cast<unsigned>(id), 256);
-  RELAXED_WRITE_BYTE_FIELD(*this, kVisitorIdOffset, static_cast<byte>(id));
+  RELAXED_WRITE_BYTE_FIELD(*this, kVisitorIdOffset, static_cast<uint8_t>(id));
 }
 
 int Map::instance_size_in_words() const {
@@ -287,7 +290,7 @@ int Map::instance_size_in_words() const {
 
 void Map::set_instance_size_in_words(int value) {
   RELAXED_WRITE_BYTE_FIELD(*this, kInstanceSizeInWordsOffset,
-                           static_cast<byte>(value));
+                           static_cast<uint8_t>(value));
 }
 
 int Map::instance_size() const {
@@ -313,16 +316,16 @@ void Map::set_inobject_properties_start_or_constructor_function_index(
   CHECK_LT(static_cast<unsigned>(value), 256);
   RELAXED_WRITE_BYTE_FIELD(
       *this, kInobjectPropertiesStartOrConstructorFunctionIndexOffset,
-      static_cast<byte>(value));
+      static_cast<uint8_t>(value));
 }
 
 int Map::GetInObjectPropertiesStartInWords() const {
-  DCHECK(IsJSObjectMap());
+  DCHECK(IsJSObjectMap(*this));
   return inobject_properties_start_or_constructor_function_index();
 }
 
 void Map::SetInObjectPropertiesStartInWords(int value) {
-  CHECK(IsJSObjectMap());
+  CHECK(IsJSObjectMap(*this));
   set_inobject_properties_start_or_constructor_function_index(value);
 }
 
@@ -334,17 +337,24 @@ bool Map::HasOutOfObjectProperties() const {
 }
 
 int Map::GetInObjectProperties() const {
-  DCHECK(IsJSObjectMap());
+  DCHECK(IsJSObjectMap(*this));
   return instance_size_in_words() - GetInObjectPropertiesStartInWords();
 }
 
 int Map::GetConstructorFunctionIndex() const {
-  DCHECK(IsPrimitiveMap());
+#if V8_ENABLE_WEBASSEMBLY
+  // We allow WasmNull here so builtins can produce error messages when
+  // called from Wasm, without having to special-case WasmNull at every
+  // caller of such a builtin.
+  DCHECK(IsPrimitiveMap(*this) || instance_type() == WASM_NULL_TYPE);
+#else
+  DCHECK(IsPrimitiveMap(*this));
+#endif
   return inobject_properties_start_or_constructor_function_index();
 }
 
 void Map::SetConstructorFunctionIndex(int value) {
-  CHECK(IsPrimitiveMap());
+  CHECK(IsPrimitiveMap(*this));
   set_inobject_properties_start_or_constructor_function_index(value);
 }
 
@@ -371,7 +381,7 @@ void Map::set_instance_type(InstanceType value) {
 
 int Map::UnusedPropertyFields() const {
   int value = used_or_unused_instance_size_in_words();
-  DCHECK_IMPLIES(!IsJSObjectMap(), value == 0);
+  DCHECK_IMPLIES(!IsJSObjectMap(*this), value == 0);
   int unused;
   if (value >= JSObject::kFieldsAdded) {
     unused = instance_size_in_words() - value;
@@ -387,7 +397,7 @@ int Map::UnusedInObjectProperties() const {
   // Like Map::UnusedPropertyFields(), but returns 0 for out of object
   // properties.
   int value = used_or_unused_instance_size_in_words();
-  DCHECK_IMPLIES(!IsJSObjectMap(), value == 0);
+  DCHECK_IMPLIES(!IsJSObjectMap(*this), value == 0);
   if (value >= JSObject::kFieldsAdded) {
     return instance_size_in_words() - value;
   }
@@ -401,7 +411,7 @@ int Map::used_or_unused_instance_size_in_words() const {
 void Map::set_used_or_unused_instance_size_in_words(int value) {
   CHECK_LE(static_cast<unsigned>(value), 255);
   RELAXED_WRITE_BYTE_FIELD(*this, kUsedOrUnusedInstanceSizeInWordsOffset,
-                           static_cast<byte>(value));
+                           static_cast<uint8_t>(value));
 }
 
 int Map::UsedInstanceSize() const {
@@ -416,7 +426,7 @@ int Map::UsedInstanceSize() const {
 
 void Map::SetInObjectUnusedPropertyFields(int value) {
   static_assert(JSObject::kFieldsAdded == JSObject::kHeaderSize / kTaggedSize);
-  if (!IsJSObjectMap()) {
+  if (!IsJSObjectMap(*this)) {
     CHECK_EQ(0, value);
     set_used_or_unused_instance_size_in_words(0);
     DCHECK_EQ(0, UnusedPropertyFields());
@@ -439,21 +449,21 @@ void Map::SetOutOfObjectUnusedPropertyFields(int value) {
   DCHECK_EQ(value, UnusedPropertyFields());
 }
 
-void Map::CopyUnusedPropertyFields(Map map) {
+void Map::CopyUnusedPropertyFields(Tagged<Map> map) {
   set_used_or_unused_instance_size_in_words(
-      map.used_or_unused_instance_size_in_words());
-  DCHECK_EQ(UnusedPropertyFields(), map.UnusedPropertyFields());
+      map->used_or_unused_instance_size_in_words());
+  DCHECK_EQ(UnusedPropertyFields(), map->UnusedPropertyFields());
 }
 
-void Map::CopyUnusedPropertyFieldsAdjustedForInstanceSize(Map map) {
-  int value = map.used_or_unused_instance_size_in_words();
+void Map::CopyUnusedPropertyFieldsAdjustedForInstanceSize(Tagged<Map> map) {
+  int value = map->used_or_unused_instance_size_in_words();
   if (value >= JSPrimitiveWrapper::kFieldsAdded) {
     // Unused in-object fields. Adjust the offset from the object’s start
     // so it matches the distance to the object’s end.
-    value += instance_size_in_words() - map.instance_size_in_words();
+    value += instance_size_in_words() - map->instance_size_in_words();
   }
   set_used_or_unused_instance_size_in_words(value);
-  DCHECK_EQ(UnusedPropertyFields(), map.UnusedPropertyFields());
+  DCHECK_EQ(UnusedPropertyFields(), map->UnusedPropertyFields());
 }
 
 void Map::AccountAddedPropertyField() {
@@ -490,50 +500,50 @@ void Map::AccountAddedOutOfObjectPropertyField(int unused_in_property_array) {
 
 #if V8_ENABLE_WEBASSEMBLY
 uint8_t Map::WasmByte1() const {
-  DCHECK(IsWasmObjectMap());
+  DCHECK(IsWasmObjectMap(*this));
   return inobject_properties_start_or_constructor_function_index();
 }
 
 uint8_t Map::WasmByte2() const {
-  DCHECK(IsWasmObjectMap());
+  DCHECK(IsWasmObjectMap(*this));
   return used_or_unused_instance_size_in_words();
 }
 
 void Map::SetWasmByte1(uint8_t value) {
-  CHECK(IsWasmObjectMap());
+  CHECK(IsWasmObjectMap(*this));
   set_inobject_properties_start_or_constructor_function_index(value);
 }
 
 void Map::SetWasmByte2(uint8_t value) {
-  CHECK(IsWasmObjectMap());
+  CHECK(IsWasmObjectMap(*this));
   set_used_or_unused_instance_size_in_words(value);
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-byte Map::bit_field() const {
+uint8_t Map::bit_field() const {
   // TODO(solanes, v8:7790, v8:11353): Make this non-atomic when TSAN sees the
   // map's store synchronization.
   return relaxed_bit_field();
 }
 
-void Map::set_bit_field(byte value) {
+void Map::set_bit_field(uint8_t value) {
   // TODO(solanes, v8:7790, v8:11353): Make this non-atomic when TSAN sees the
   // map's store synchronization.
   set_relaxed_bit_field(value);
 }
 
-byte Map::relaxed_bit_field() const {
+uint8_t Map::relaxed_bit_field() const {
   return RELAXED_READ_BYTE_FIELD(*this, kBitFieldOffset);
 }
 
-void Map::set_relaxed_bit_field(byte value) {
+void Map::set_relaxed_bit_field(uint8_t value) {
   RELAXED_WRITE_BYTE_FIELD(*this, kBitFieldOffset, value);
 }
 
-byte Map::bit_field2() const { return ReadField<byte>(kBitField2Offset); }
+uint8_t Map::bit_field2() const { return ReadField<uint8_t>(kBitField2Offset); }
 
-void Map::set_bit_field2(byte value) {
-  WriteField<byte>(kBitField2Offset, value);
+void Map::set_bit_field2(uint8_t value) {
+  WriteField<uint8_t>(kBitField2Offset, value);
 }
 
 uint32_t Map::bit_field3() const {
@@ -567,7 +577,7 @@ bool Map::is_abandoned_prototype_map() const {
 bool Map::should_be_fast_prototype_map() const {
   DCHECK(is_prototype_map());
   if (!has_prototype_info()) return false;
-  return PrototypeInfo::cast(prototype_info()).should_be_fast_map();
+  return PrototypeInfo::cast(prototype_info())->should_be_fast_map();
 }
 
 bool Map::has_prototype_info() const {
@@ -575,9 +585,9 @@ bool Map::has_prototype_info() const {
   return PrototypeInfo::IsPrototypeInfoFast(prototype_info());
 }
 
-bool Map::TryGetPrototypeInfo(PrototypeInfo* result) const {
+bool Map::TryGetPrototypeInfo(Tagged<PrototypeInfo>* result) const {
   DCHECK(is_prototype_map());
-  Object maybe_proto_info = prototype_info();
+  Tagged<Object> maybe_proto_info = prototype_info();
   if (!PrototypeInfo::IsPrototypeInfoFast(maybe_proto_info)) return false;
   *result = PrototypeInfo::cast(maybe_proto_info);
   return true;
@@ -613,6 +623,10 @@ bool Map::has_fast_elements() const {
   return IsFastElementsKind(elements_kind());
 }
 
+bool Map::has_fast_packed_elements() const {
+  return IsFastPackedElementsKind(elements_kind());
+}
+
 bool Map::has_sloppy_arguments_elements() const {
   return IsSloppyArgumentsElementsKind(elements_kind());
 }
@@ -684,7 +698,7 @@ bool Map::is_stable() const {
 
 bool Map::CanBeDeprecated() const {
   for (InternalIndex i : IterateOwnDescriptors()) {
-    PropertyDetails details = instance_descriptors(kRelaxedLoad).GetDetails(i);
+    PropertyDetails details = instance_descriptors(kRelaxedLoad)->GetDetails(i);
     if (details.representation().MightCauseMapDeprecation()) return true;
     if (details.kind() == PropertyKind::kData &&
         details.location() == PropertyLocation::kDescriptor) {
@@ -704,37 +718,38 @@ void Map::NotifyLeafMapLayoutChange(Isolate* isolate) {
 
 bool Map::CanTransition() const {
   // Only JSObject and subtypes have map transitions and back pointers.
-  return InstanceTypeChecker::IsJSObject(*this);
+  const InstanceType type = instance_type();
+  // Shared JS objects have fixed shapes and do not transition. Their maps are
+  // either in shared space or RO space.
+  DCHECK_IMPLIES(InstanceTypeChecker::IsAlwaysSharedSpaceJSObject(type),
+                 InAnySharedSpace());
+  return InstanceTypeChecker::IsJSObject(type) &&
+         !InstanceTypeChecker::IsAlwaysSharedSpaceJSObject(type);
 }
 
-#define DEF_TESTER(Type, ...)                    \
-  bool Map::Is##Type##Map() const {              \
-    return InstanceTypeChecker::Is##Type(*this); \
-  }
-INSTANCE_TYPE_CHECKERS(DEF_TESTER)
-#undef DEF_TESTER
-
-bool Map::IsBooleanMap() const {
-  return *this == GetReadOnlyRoots().boolean_map();
+bool IsBooleanMap(Tagged<Map> map) {
+  return map == map->GetReadOnlyRoots().boolean_map();
 }
 
-bool Map::IsNullOrUndefinedMap() const {
-  auto roots = GetReadOnlyRoots();
-  return *this == roots.null_map() || *this == roots.undefined_map();
+bool IsNullOrUndefinedMap(Tagged<Map> map) {
+  auto roots = map->GetReadOnlyRoots();
+  return map == roots.null_map() || map == roots.undefined_map();
 }
 
-bool Map::IsPrimitiveMap() const {
-  return instance_type() <= LAST_PRIMITIVE_HEAP_OBJECT_TYPE;
+bool IsPrimitiveMap(Tagged<Map> map) {
+  return map->instance_type() <= LAST_PRIMITIVE_HEAP_OBJECT_TYPE;
 }
 
-void Map::UpdateDescriptors(Isolate* isolate, DescriptorArray descriptors,
+void Map::UpdateDescriptors(Isolate* isolate,
+                            Tagged<DescriptorArray> descriptors,
                             int number_of_own_descriptors) {
   SetInstanceDescriptors(isolate, descriptors, number_of_own_descriptors);
 }
 
-void Map::InitializeDescriptors(Isolate* isolate, DescriptorArray descriptors) {
+void Map::InitializeDescriptors(Isolate* isolate,
+                                Tagged<DescriptorArray> descriptors) {
   SetInstanceDescriptors(isolate, descriptors,
-                         descriptors.number_of_descriptors());
+                         descriptors->number_of_descriptors());
 }
 
 void Map::clear_padding() {
@@ -745,21 +760,21 @@ void Map::clear_padding() {
 }
 
 void Map::AppendDescriptor(Isolate* isolate, Descriptor* desc) {
-  DescriptorArray descriptors = instance_descriptors(isolate);
+  Tagged<DescriptorArray> descriptors = instance_descriptors(isolate);
   int number_of_own_descriptors = NumberOfOwnDescriptors();
-  DCHECK(descriptors.number_of_descriptors() == number_of_own_descriptors);
+  DCHECK(descriptors->number_of_descriptors() == number_of_own_descriptors);
   {
     // The following two operations need to happen before the marking write
     // barrier.
-    descriptors.Append(desc);
+    descriptors->Append(desc);
     SetNumberOfOwnDescriptors(number_of_own_descriptors + 1);
 #ifndef V8_DISABLE_WRITE_BARRIERS
     WriteBarrier::Marking(descriptors, number_of_own_descriptors + 1);
 #endif
   }
   // Properly mark the map if the {desc} is an "interesting symbol".
-  if (desc->GetKey()->IsInterestingSymbol()) {
-    set_may_have_interesting_symbols(true);
+  if (desc->GetKey()->IsInteresting(isolate)) {
+    set_may_have_interesting_properties(true);
   }
   PropertyDetails details = desc->GetDetails();
   if (details.location() == PropertyLocation::kField) {
@@ -777,106 +792,150 @@ void Map::AppendDescriptor(Isolate* isolate, Descriptor* desc) {
 
 bool Map::ConcurrentIsMap(PtrComprCageBase cage_base,
                           const Object& object) const {
-  return object.IsHeapObject() && HeapObject::cast(object).map(cage_base) ==
-                                      GetReadOnlyRoots(cage_base).meta_map();
+  return IsHeapObject(object) && HeapObject::cast(object)->map(cage_base) ==
+                                     GetReadOnlyRoots(cage_base).meta_map();
 }
 
-DEF_GETTER(Map, GetBackPointer, HeapObject) {
-  Object object = constructor_or_back_pointer(cage_base, kRelaxedLoad);
-  if (ConcurrentIsMap(cage_base, object)) {
-    return Map::cast(object);
+DEF_GETTER(Map, GetBackPointer, Tagged<HeapObject>) {
+  Tagged<Map> back_pointer;
+  if (TryGetBackPointer(cage_base, &back_pointer)) {
+    return back_pointer;
   }
   return GetReadOnlyRoots(cage_base).undefined_value();
 }
 
-void Map::SetBackPointer(HeapObject value, WriteBarrierMode mode) {
+bool Map::TryGetBackPointer(PtrComprCageBase cage_base,
+                            Tagged<Map>* back_pointer) const {
+  Tagged<Object> object = constructor_or_back_pointer(cage_base, kRelaxedLoad);
+  if (ConcurrentIsMap(cage_base, object)) {
+    *back_pointer = Map::cast(object);
+    return true;
+  }
+  return false;
+}
+
+void Map::SetBackPointer(Tagged<HeapObject> value, WriteBarrierMode mode) {
   CHECK_GE(instance_type(), FIRST_JS_RECEIVER_TYPE);
-  CHECK(value.IsMap());
-  CHECK(GetBackPointer().IsUndefined());
-  CHECK_EQ(Map::cast(value).GetConstructor(), constructor_or_back_pointer());
+  CHECK(IsMap(value));
+  CHECK(IsUndefined(GetBackPointer()));
+  CHECK_EQ(Map::cast(value)->GetConstructorRaw(),
+           constructor_or_back_pointer());
   set_constructor_or_back_pointer(value, mode);
 }
 
 // static
-Map Map::GetMapFor(ReadOnlyRoots roots, InstanceType type) {
+Tagged<Map> Map::GetMapFor(ReadOnlyRoots roots, InstanceType type) {
   RootIndex map_idx = TryGetMapRootIdxFor(type).value();
   return Map::unchecked_cast(roots.object_at(map_idx));
 }
 
 // static
-Map Map::ElementsTransitionMap(Isolate* isolate, ConcurrencyMode cmode) {
+Tagged<Map> Map::ElementsTransitionMap(Isolate* isolate,
+                                       ConcurrencyMode cmode) {
   return TransitionsAccessor(isolate, *this, IsConcurrent(cmode))
       .SearchSpecial(ReadOnlyRoots(isolate).elements_transition_symbol());
 }
 
-ACCESSORS(Map, dependent_code, DependentCode, kDependentCodeOffset)
-RELAXED_ACCESSORS(Map, prototype_validity_cell, Object,
+ACCESSORS(Map, dependent_code, Tagged<DependentCode>, kDependentCodeOffset)
+RELAXED_ACCESSORS(Map, prototype_validity_cell, Tagged<Object>,
                   kPrototypeValidityCellOffset)
-ACCESSORS_CHECKED2(Map, constructor_or_back_pointer, Object,
+ACCESSORS_CHECKED2(Map, constructor_or_back_pointer, Tagged<Object>,
                    kConstructorOrBackPointerOrNativeContextOffset,
-                   !IsContextMap(), value.IsNull() || !IsContextMap())
-RELAXED_ACCESSORS_CHECKED2(Map, constructor_or_back_pointer, Object,
+                   !IsContextMap(*this), IsNull(value) || !IsContextMap(*this))
+RELAXED_ACCESSORS_CHECKED2(Map, constructor_or_back_pointer, Tagged<Object>,
                            kConstructorOrBackPointerOrNativeContextOffset,
-                           !IsContextMap(), value.IsNull() || !IsContextMap())
-ACCESSORS_CHECKED(Map, native_context, NativeContext,
+                           !IsContextMap(*this),
+                           IsNull(value) || !IsContextMap(*this))
+ACCESSORS_CHECKED(Map, native_context, Tagged<NativeContext>,
                   kConstructorOrBackPointerOrNativeContextOffset,
-                  IsContextMap())
-ACCESSORS_CHECKED(Map, native_context_or_null, Object,
+                  IsContextMap(*this))
+ACCESSORS_CHECKED(Map, native_context_or_null, Tagged<Object>,
                   kConstructorOrBackPointerOrNativeContextOffset,
-                  (value.IsNull() || value.IsNativeContext()) && IsContextMap())
+                  (IsNull(value) || IsNativeContext(value)) &&
+                      IsContextMap(*this))
 #if V8_ENABLE_WEBASSEMBLY
-ACCESSORS_CHECKED(Map, wasm_type_info, WasmTypeInfo,
+ACCESSORS_CHECKED(Map, wasm_type_info, Tagged<WasmTypeInfo>,
                   kConstructorOrBackPointerOrNativeContextOffset,
-                  IsWasmStructMap() || IsWasmArrayMap() ||
-                      IsWasmInternalFunctionMap())
+                  IsWasmStructMap(*this) || IsWasmArrayMap(*this) ||
+                      IsWasmInternalFunctionMap(*this))
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 bool Map::IsPrototypeValidityCellValid() const {
-  Object validity_cell = prototype_validity_cell(kRelaxedLoad);
-  if (validity_cell.IsSmi()) {
+  Tagged<Object> validity_cell = prototype_validity_cell(kRelaxedLoad);
+  if (IsSmi(validity_cell)) {
     // Smi validity cells should always be considered valid.
     DCHECK_EQ(Smi::cast(validity_cell).value(), Map::kPrototypeChainValid);
     return true;
   }
-  Smi cell_value = Smi::cast(Cell::cast(validity_cell).value());
+  Tagged<Smi> cell_value = Smi::cast(Cell::cast(validity_cell)->value());
   return cell_value == Smi::FromInt(Map::kPrototypeChainValid);
 }
 
-DEF_GETTER(Map, GetConstructor, Object) {
-  Object maybe_constructor = constructor_or_back_pointer(cage_base);
+DEF_GETTER(Map, GetConstructorRaw, Tagged<Object>) {
+  Tagged<Object> maybe_constructor = constructor_or_back_pointer(cage_base);
   // Follow any back pointers.
   while (ConcurrentIsMap(cage_base, maybe_constructor)) {
     maybe_constructor =
-        Map::cast(maybe_constructor).constructor_or_back_pointer(cage_base);
+        Map::cast(maybe_constructor)->constructor_or_back_pointer(cage_base);
+  }
+  return maybe_constructor;
+}
+
+DEF_GETTER(Map, GetNonInstancePrototype, Tagged<Object>) {
+  DCHECK(has_non_instance_prototype());
+  Tagged<Object> raw_constructor = GetConstructorRaw(cage_base);
+  CHECK(IsTuple2(raw_constructor));
+  // Get prototype from the {constructor, non-instance_prototype} tuple.
+  Tagged<Tuple2> non_instance_prototype_constructor_tuple =
+      Tuple2::cast(raw_constructor);
+  Tagged<Object> result = non_instance_prototype_constructor_tuple->value2();
+  DCHECK(!IsJSReceiver(result));
+  DCHECK(!IsFunctionTemplateInfo(result));
+  return result;
+}
+
+DEF_GETTER(Map, GetConstructor, Tagged<Object>) {
+  Tagged<Object> maybe_constructor = GetConstructorRaw(cage_base);
+  if (IsTuple2(maybe_constructor)) {
+    // Get constructor from the {constructor, non-instance_prototype} tuple.
+    maybe_constructor = Tuple2::cast(maybe_constructor)->value1();
   }
   return maybe_constructor;
 }
 
-Object Map::TryGetConstructor(Isolate* isolate, int max_steps) {
-  Object maybe_constructor = constructor_or_back_pointer(isolate);
+Tagged<Object> Map::TryGetConstructor(Isolate* isolate, int max_steps) {
+  Tagged<Object> maybe_constructor = constructor_or_back_pointer(isolate);
   // Follow any back pointers.
-  while (maybe_constructor.IsMap(isolate)) {
+  while (IsMap(maybe_constructor, isolate)) {
     if (max_steps-- == 0) return Smi::FromInt(0);
     maybe_constructor =
-        Map::cast(maybe_constructor).constructor_or_back_pointer(isolate);
+        Map::cast(maybe_constructor)->constructor_or_back_pointer(isolate);
+  }
+  if (IsTuple2(maybe_constructor)) {
+    // Get constructor from the {constructor, non-instance_prototype} tuple.
+    maybe_constructor = Tuple2::cast(maybe_constructor)->value1();
   }
   return maybe_constructor;
 }
 
-DEF_GETTER(Map, GetFunctionTemplateInfo, FunctionTemplateInfo) {
-  Object constructor = GetConstructor(cage_base);
-  if (constructor.IsJSFunction(cage_base)) {
-    // TODO(ishell): IsApiFunction(isolate) and get_api_func_data(isolate)
-    DCHECK(JSFunction::cast(constructor).shared(cage_base).IsApiFunction());
-    return JSFunction::cast(constructor).shared(cage_base).get_api_func_data();
+DEF_GETTER(Map, GetFunctionTemplateInfo, Tagged<FunctionTemplateInfo>) {
+  Tagged<Object> constructor = GetConstructor(cage_base);
+  if (IsJSFunction(constructor, cage_base)) {
+    Tagged<SharedFunctionInfo> sfi =
+        JSFunction::cast(constructor)->shared(cage_base);
+    DCHECK(sfi->IsApiFunction());
+    return sfi->api_func_data();
   }
-  DCHECK(constructor.IsFunctionTemplateInfo(cage_base));
+  DCHECK(IsFunctionTemplateInfo(constructor, cage_base));
   return FunctionTemplateInfo::cast(constructor);
 }
 
-void Map::SetConstructor(Object constructor, WriteBarrierMode mode) {
+void Map::SetConstructor(Tagged<Object> constructor, WriteBarrierMode mode) {
   // Never overwrite a back pointer with a constructor.
-  CHECK(!constructor_or_back_pointer().IsMap());
+  CHECK(!IsMap(constructor_or_back_pointer()));
+  // Constructor field must contain {constructor, non-instance_prototype} tuple
+  // for maps with non-instance prototype.
+  DCHECK_EQ(has_non_instance_prototype(), IsTuple2(constructor));
   set_constructor_or_back_pointer(constructor, mode);
 }
 
@@ -893,8 +952,8 @@ bool Map::IsInobjectSlackTrackingInProgress() const {
 void Map::InobjectSlackTrackingStep(Isolate* isolate) {
   DisallowGarbageCollection no_gc;
   // Slack tracking should only be performed on an initial map.
-  DCHECK(GetBackPointer().IsUndefined());
-  if (!IsInobjectSlackTrackingInProgress()) return;
+  DCHECK(IsUndefined(GetBackPointer()));
+  if (!this->IsInobjectSlackTrackingInProgress()) return;
   int counter = construction_counter();
   set_construction_counter(counter - 1);
   if (counter == kSlackTrackingCounterEnd) {
@@ -924,9 +983,9 @@ int NormalizedMapCache::GetIndex(Handle<Map> map) {
   return map->Hash() % NormalizedMapCache::kEntries;
 }
 
-DEF_GETTER(HeapObject, IsNormalizedMapCache, bool) {
-  if (!IsWeakFixedArray(cage_base)) return false;
-  if (WeakFixedArray::cast(*this).length() != NormalizedMapCache::kEntries) {
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsNormalizedMapCache) {
+  if (!IsWeakFixedArray(obj, cage_base)) return false;
+  if (WeakFixedArray::cast(obj)->length() != NormalizedMapCache::kEntries) {
     return false;
   }
   return true;
diff --git a/deps/v8/src/objects/map-updater.cc b/deps/v8/src/objects/map-updater.cc
index be6568aac4730d..613a4921637b11 100644
--- a/deps/v8/src/objects/map-updater.cc
+++ b/deps/v8/src/objects/map-updater.cc
@@ -10,7 +10,9 @@
 #include "src/execution/frames.h"
 #include "src/execution/isolate.h"
 #include "src/handles/handles.h"
+#include "src/heap/parked-scope-inl.h"
 #include "src/objects/field-type.h"
+#include "src/objects/keys.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/objects.h"
 #include "src/objects/property-details.h"
@@ -21,7 +23,7 @@ namespace internal {
 
 namespace {
 
-inline bool EqualImmutableValues(Object obj1, Object obj2) {
+inline bool EqualImmutableValues(Tagged<Object> obj1, Tagged<Object> obj2) {
   if (obj1 == obj2) return true;  // Valid for both kData and kAccessor kinds.
   // TODO(ishell): compare AccessorPairs.
   return false;
@@ -37,8 +39,8 @@ V8_WARN_UNUSED_RESULT Handle<FieldType> GeneralizeFieldType(
       Map::FieldTypeIsCleared(rep2, *type2)) {
     return FieldType::Any(isolate);
   }
-  if (type1->NowIs(type2)) return type2;
-  if (type2->NowIs(type1)) return type1;
+  if ((*type1)->NowIs(type2)) return type2;
+  if ((*type2)->NowIs(type1)) return type1;
   return FieldType::Any(isolate);
 }
 
@@ -52,9 +54,9 @@ void PrintGeneralization(
     MaybeHandle<Object> new_value) {
   OFStream os(file);
   os << "[generalizing]";
-  Name name = map->instance_descriptors(isolate).GetKey(modify_index);
-  if (name.IsString()) {
-    String::cast(name).PrintOn(file);
+  Tagged<Name> name = map->instance_descriptors(isolate)->GetKey(modify_index);
+  if (IsString(name)) {
+    String::cast(name)->PrintOn(file);
   } else {
     os << "{symbol " << reinterpret_cast<void*>(name.ptr()) << "}";
   }
@@ -66,7 +68,7 @@ void PrintGeneralization(
     if (old_field_type.is_null()) {
       os << Brief(*(old_value.ToHandleChecked()));
     } else {
-      old_field_type.ToHandleChecked()->PrintTo(os);
+      (*old_field_type.ToHandleChecked())->PrintTo(os);
     }
     os << ";" << old_constness << "}";
   }
@@ -74,7 +76,7 @@ void PrintGeneralization(
   if (new_field_type.is_null()) {
     os << Brief(*(new_value.ToHandleChecked()));
   } else {
-    new_field_type.ToHandleChecked()->PrintTo(os);
+    (*new_field_type.ToHandleChecked())->PrintTo(os);
   }
   os << ";" << new_constness << "} (";
   if (strlen(reason) > 0) {
@@ -99,10 +101,10 @@ MapUpdater::MapUpdater(Isolate* isolate, Handle<Map> old_map)
           IsTransitionableFastElementsKind(new_elements_kind_)) {
   // We shouldn't try to update remote objects.
   DCHECK(
-      !old_map->FindRootMap(isolate).GetConstructor().IsFunctionTemplateInfo());
+      !IsFunctionTemplateInfo(old_map->FindRootMap(isolate)->GetConstructor()));
 }
 
-Name MapUpdater::GetKey(InternalIndex descriptor) const {
+Tagged<Name> MapUpdater::GetKey(InternalIndex descriptor) const {
   return old_descriptors_->GetKey(descriptor);
 }
 
@@ -127,7 +129,7 @@ PropertyDetails MapUpdater::GetDetails(InternalIndex descriptor) const {
   return old_descriptors_->GetDetails(descriptor);
 }
 
-Object MapUpdater::GetValue(InternalIndex descriptor) const {
+Tagged<Object> MapUpdater::GetValue(InternalIndex descriptor) const {
   DCHECK(descriptor.is_found());
   if (descriptor == modified_descriptor_) {
     DCHECK_EQ(PropertyLocation::kDescriptor, new_location_);
@@ -137,7 +139,7 @@ Object MapUpdater::GetValue(InternalIndex descriptor) const {
   return old_descriptors_->GetStrongValue(descriptor);
 }
 
-FieldType MapUpdater::GetFieldType(InternalIndex descriptor) const {
+Tagged<FieldType> MapUpdater::GetFieldType(InternalIndex descriptor) const {
   DCHECK(descriptor.is_found());
   if (descriptor == modified_descriptor_) {
     DCHECK_EQ(PropertyLocation::kField, new_location_);
@@ -156,7 +158,7 @@ Handle<FieldType> MapUpdater::GetOrComputeFieldType(
   if (location == PropertyLocation::kField) {
     return handle(GetFieldType(descriptor), isolate_);
   } else {
-    return GetValue(descriptor).OptimalType(isolate_, representation);
+    return Object::OptimalType(GetValue(descriptor), isolate_, representation);
   }
 }
 
@@ -168,8 +170,8 @@ Handle<FieldType> MapUpdater::GetOrComputeFieldType(
   if (location == PropertyLocation::kField) {
     return handle(descriptors->GetFieldType(descriptor), isolate_);
   } else {
-    return descriptors->GetStrongValue(descriptor)
-        .OptimalType(isolate_, representation);
+    return Object::OptimalType(descriptors->GetStrongValue(descriptor),
+                               isolate_, representation);
   }
 }
 
@@ -182,8 +184,9 @@ Handle<Map> MapUpdater::ReconfigureToDataField(InternalIndex descriptor,
   DCHECK(descriptor.is_found());
   DCHECK(!old_map_->is_dictionary_map());
 
-  base::SharedMutexGuard<base::kExclusive> mutex_guard(
-      isolate_->map_updater_access());
+  ParkedSharedMutexGuardIf<base::kExclusive> mutex_guard(
+      isolate_->main_thread_local_isolate(), isolate_->map_updater_access(),
+      true);
 
   modified_descriptor_ = descriptor;
   new_kind_ = PropertyKind::kData;
@@ -285,24 +288,24 @@ Handle<Map> MapUpdater::UpdateImpl() {
 namespace {
 
 struct IntegrityLevelTransitionInfo {
-  explicit IntegrityLevelTransitionInfo(Map map)
+  explicit IntegrityLevelTransitionInfo(Tagged<Map> map)
       : integrity_level_source_map(map) {}
 
   bool has_integrity_level_transition = false;
   PropertyAttributes integrity_level = NONE;
-  Map integrity_level_source_map;
-  Symbol integrity_level_symbol;
+  Tagged<Map> integrity_level_source_map;
+  Tagged<Symbol> integrity_level_symbol;
 };
 
 IntegrityLevelTransitionInfo DetectIntegrityLevelTransitions(
-    Map map, Isolate* isolate, DisallowGarbageCollection* no_gc,
+    Tagged<Map> map, Isolate* isolate, DisallowGarbageCollection* no_gc,
     ConcurrencyMode cmode) {
   IntegrityLevelTransitionInfo info(map);
 
   // Figure out the most restrictive integrity level transition (it should
   // be the last one in the transition tree).
-  DCHECK(!map.is_extensible());
-  Map previous = Map::cast(map.GetBackPointer(isolate));
+  DCHECK(!map->is_extensible());
+  Tagged<Map> previous = Map::cast(map->GetBackPointer(isolate));
   TransitionsAccessor last_transitions(isolate, previous, IsConcurrent(cmode));
   if (!last_transitions.HasIntegrityLevelTransitionTo(
           map, &info.integrity_level_symbol, &info.integrity_level)) {
@@ -315,12 +318,12 @@ IntegrityLevelTransitionInfo DetectIntegrityLevelTransitions(
     return info;
   }
 
-  Map source_map = previous;
+  Tagged<Map> source_map = previous;
   // Now walk up the back pointer chain and skip all integrity level
   // transitions. If we encounter any non-integrity level transition interleaved
   // with integrity level transitions, just bail out.
-  while (!source_map.is_extensible()) {
-    previous = Map::cast(source_map.GetBackPointer(isolate));
+  while (!source_map->is_extensible()) {
+    previous = Map::cast(source_map->GetBackPointer(isolate));
     TransitionsAccessor transitions(isolate, previous, IsConcurrent(cmode));
     if (!transitions.HasIntegrityLevelTransitionTo(source_map)) {
       return info;
@@ -329,7 +332,7 @@ IntegrityLevelTransitionInfo DetectIntegrityLevelTransitions(
   }
 
   // Integrity-level transitions never change number of descriptors.
-  CHECK_EQ(map.NumberOfOwnDescriptors(), source_map.NumberOfOwnDescriptors());
+  CHECK_EQ(map->NumberOfOwnDescriptors(), source_map->NumberOfOwnDescriptors());
 
   info.has_integrity_level_transition = true;
   info.integrity_level_source_map = source_map;
@@ -339,30 +342,33 @@ IntegrityLevelTransitionInfo DetectIntegrityLevelTransitions(
 }  // namespace
 
 // static
-base::Optional<Map> MapUpdater::TryUpdateNoLock(Isolate* isolate, Map old_map,
+base::Optional<Map> MapUpdater::TryUpdateNoLock(Isolate* isolate,
+                                                Tagged<Map> old_map,
                                                 ConcurrencyMode cmode) {
   DisallowGarbageCollection no_gc;
 
   // Check the state of the root map.
-  Map root_map = old_map.FindRootMap(isolate);
-  if (root_map.is_deprecated()) {
-    JSFunction constructor = JSFunction::cast(root_map.GetConstructor());
-    DCHECK(constructor.has_initial_map());
-    DCHECK(constructor.initial_map().is_dictionary_map());
-    if (constructor.initial_map().elements_kind() != old_map.elements_kind()) {
+  Tagged<Map> root_map = old_map->FindRootMap(isolate);
+  if (root_map->is_deprecated()) {
+    Tagged<JSFunction> constructor =
+        JSFunction::cast(root_map->GetConstructor());
+    DCHECK(constructor->has_initial_map());
+    DCHECK(constructor->initial_map()->is_dictionary_map());
+    if (constructor->initial_map()->elements_kind() !=
+        old_map->elements_kind()) {
       return {};
     }
-    return constructor.initial_map();
+    return constructor->initial_map();
   }
-  if (!old_map.EquivalentToForTransition(root_map, cmode)) return {};
+  if (!old_map->EquivalentToForTransition(root_map, cmode)) return {};
 
-  ElementsKind from_kind = root_map.elements_kind();
-  ElementsKind to_kind = old_map.elements_kind();
+  ElementsKind from_kind = root_map->elements_kind();
+  ElementsKind to_kind = old_map->elements_kind();
 
   IntegrityLevelTransitionInfo info(old_map);
-  if (root_map.is_extensible() != old_map.is_extensible()) {
-    DCHECK(!old_map.is_extensible());
-    DCHECK(root_map.is_extensible());
+  if (root_map->is_extensible() != old_map->is_extensible()) {
+    DCHECK(!old_map->is_extensible());
+    DCHECK(root_map->is_extensible());
     info = DetectIntegrityLevelTransitions(old_map, isolate, &no_gc, cmode);
     // Bail out if there were some private symbol transitions mixed up
     // with the integrity level transitions.
@@ -373,17 +379,17 @@ base::Optional<Map> MapUpdater::TryUpdateNoLock(Isolate* isolate, Map old_map,
            to_kind == SLOW_STRING_WRAPPER_ELEMENTS ||
            IsTypedArrayOrRabGsabTypedArrayElementsKind(to_kind) ||
            IsAnyHoleyNonextensibleElementsKind(to_kind));
-    to_kind = info.integrity_level_source_map.elements_kind();
+    to_kind = info.integrity_level_source_map->elements_kind();
   }
   if (from_kind != to_kind) {
     // Try to follow existing elements kind transitions.
-    root_map = root_map.LookupElementsTransitionMap(isolate, to_kind, cmode);
+    root_map = root_map->LookupElementsTransitionMap(isolate, to_kind, cmode);
     if (root_map.is_null()) return {};
     // From here on, use the map with correct elements kind as root map.
   }
 
   // Replay the transitions as they were before the integrity level transition.
-  Map result = root_map.TryReplayPropertyTransitions(
+  Tagged<Map> result = root_map->TryReplayPropertyTransitions(
       isolate, info.integrity_level_source_map, cmode);
   if (result.is_null()) return {};
 
@@ -394,8 +400,8 @@ base::Optional<Map> MapUpdater::TryUpdateNoLock(Isolate* isolate, Map old_map,
   }
   if (result.is_null()) return {};
 
-  DCHECK_EQ(old_map.elements_kind(), result.elements_kind());
-  DCHECK_EQ(old_map.instance_type(), result.instance_type());
+  DCHECK_EQ(old_map->elements_kind(), result->elements_kind());
+  DCHECK_EQ(old_map->instance_type(), result->instance_type());
   return result;
 }
 
@@ -420,31 +426,31 @@ MapUpdater::State MapUpdater::Normalize(const char* reason) {
 
 // static
 void MapUpdater::CompleteInobjectSlackTracking(Isolate* isolate,
-                                               Map initial_map) {
+                                               Tagged<Map> initial_map) {
   // Has to be an initial map.
-  DCHECK(initial_map.GetBackPointer().IsUndefined(isolate));
+  DCHECK(IsUndefined(initial_map->GetBackPointer(), isolate));
 
-  const int slack = initial_map.ComputeMinObjectSlack(isolate);
+  const int slack = initial_map->ComputeMinObjectSlack(isolate);
   DCHECK_GE(slack, 0);
 
   TransitionsAccessor transitions(isolate, initial_map);
   TransitionsAccessor::TraverseCallback callback;
   if (slack != 0) {
     // Resize the initial map and all maps in its transition tree.
-    callback = [slack](Map map) {
+    callback = [slack](Tagged<Map> map) {
 #ifdef DEBUG
       int old_visitor_id = Map::GetVisitorId(map);
-      int new_unused = map.UnusedPropertyFields() - slack;
+      int new_unused = map->UnusedPropertyFields() - slack;
 #endif
-      map.set_instance_size(map.InstanceSizeFromSlack(slack));
-      map.set_construction_counter(Map::kNoSlackTracking);
+      map->set_instance_size(map->InstanceSizeFromSlack(slack));
+      map->set_construction_counter(Map::kNoSlackTracking);
       DCHECK_EQ(old_visitor_id, Map::GetVisitorId(map));
-      DCHECK_EQ(new_unused, map.UnusedPropertyFields());
+      DCHECK_EQ(new_unused, map->UnusedPropertyFields());
     };
   } else {
     // Stop slack tracking for this map.
-    callback = [](Map map) {
-      map.set_construction_counter(Map::kNoSlackTracking);
+    callback = [](Tagged<Map> map) {
+      map->set_construction_counter(Map::kNoSlackTracking);
     };
   }
 
@@ -502,7 +508,7 @@ MapUpdater::State MapUpdater::TryReconfigureToDataFieldInplace() {
              .representation()
              .Equals(new_representation_));
   DCHECK(old_descriptors_->GetFieldType(modified_descriptor_)
-             .NowIs(new_field_type_));
+             ->NowIs(new_field_type_));
 
   result_map_ = old_map_;
   state_ = kEnd;
@@ -514,7 +520,7 @@ bool MapUpdater::TrySaveIntegrityLevelTransitions() {
   // be the last one in the transition tree).
   Handle<Map> previous =
       handle(Map::cast(old_map_->GetBackPointer()), isolate_);
-  Symbol integrity_level_symbol;
+  Tagged<Symbol> integrity_level_symbol;
   TransitionsAccessor last_transitions(isolate_, *previous);
   if (!last_transitions.HasIntegrityLevelTransitionTo(
           *old_map_, &integrity_level_symbol, &integrity_level_)) {
@@ -562,7 +568,7 @@ MapUpdater::State MapUpdater::FindRootMap() {
   if (root_map_->is_deprecated()) {
     state_ = kEnd;
     result_map_ = handle(
-        JSFunction::cast(root_map_->GetConstructor()).initial_map(), isolate_);
+        JSFunction::cast(root_map_->GetConstructor())->initial_map(), isolate_);
     result_map_ = Map::AsElementsKind(isolate_, result_map_, to_kind);
     DCHECK(result_map_->is_dictionary_map());
     return state_;
@@ -691,10 +697,10 @@ MapUpdater::State MapUpdater::FindTargetMap() {
   if (target_nof == old_nof_) {
 #ifdef DEBUG
     if (modified_descriptor_.is_found()) {
-      DescriptorArray target_descriptors =
+      Tagged<DescriptorArray> target_descriptors =
           target_map_->instance_descriptors(isolate_);
       PropertyDetails details =
-          target_descriptors.GetDetails(modified_descriptor_);
+          target_descriptors->GetDetails(modified_descriptor_);
       DCHECK_EQ(new_kind_, details.kind());
       DCHECK_EQ(GetDetails(modified_descriptor_).attributes(),
                 details.attributes());
@@ -703,13 +709,14 @@ MapUpdater::State MapUpdater::FindTargetMap() {
       DCHECK(new_representation_.fits_into(details.representation()));
       if (new_location_ == PropertyLocation::kField) {
         DCHECK_EQ(PropertyLocation::kField, details.location());
-        DCHECK(new_field_type_->NowIs(
-            target_descriptors.GetFieldType(modified_descriptor_)));
+        DCHECK((*new_field_type_)
+                   ->NowIs(
+                       target_descriptors->GetFieldType(modified_descriptor_)));
       } else {
         DCHECK(details.location() == PropertyLocation::kField ||
                EqualImmutableValues(
                    *new_value_,
-                   target_descriptors.GetStrongValue(modified_descriptor_)));
+                   target_descriptors->GetStrongValue(modified_descriptor_)));
       }
     }
 #endif
@@ -929,17 +936,18 @@ Handle<DescriptorArray> MapUpdater::BuildDescriptorArray() {
 
 Handle<Map> MapUpdater::FindSplitMap(Handle<DescriptorArray> descriptors) {
   int root_nof = root_map_->NumberOfOwnDescriptors();
-  Map current = *root_map_;
+  Tagged<Map> current = *root_map_;
   for (InternalIndex i : InternalIndex::Range(root_nof, old_nof_)) {
-    Name name = descriptors->GetKey(i);
+    Tagged<Name> name = descriptors->GetKey(i);
     PropertyDetails details = descriptors->GetDetails(i);
-    Map next =
+    Tagged<Map> next =
         TransitionsAccessor(isolate_, current)
             .SearchTransition(name, details.kind(), details.attributes());
     if (next.is_null()) break;
-    DescriptorArray next_descriptors = next.instance_descriptors(isolate_);
+    Tagged<DescriptorArray> next_descriptors =
+        next->instance_descriptors(isolate_);
 
-    PropertyDetails next_details = next_descriptors.GetDetails(i);
+    PropertyDetails next_details = next_descriptors->GetDetails(i);
     DCHECK_EQ(details.kind(), next_details.kind());
     DCHECK_EQ(details.attributes(), next_details.attributes());
     if (details.constness() != next_details.constness()) break;
@@ -947,13 +955,13 @@ Handle<Map> MapUpdater::FindSplitMap(Handle<DescriptorArray> descriptors) {
     if (!details.representation().Equals(next_details.representation())) break;
 
     if (next_details.location() == PropertyLocation::kField) {
-      FieldType next_field_type = next_descriptors.GetFieldType(i);
-      if (!descriptors->GetFieldType(i).NowIs(next_field_type)) {
+      Tagged<FieldType> next_field_type = next_descriptors->GetFieldType(i);
+      if (!descriptors->GetFieldType(i)->NowIs(next_field_type)) {
         break;
       }
     } else {
       if (!EqualImmutableValues(descriptors->GetStrongValue(i),
-                                next_descriptors.GetStrongValue(i))) {
+                                next_descriptors->GetStrongValue(i))) {
         break;
       }
     }
@@ -1035,6 +1043,13 @@ MapUpdater::State MapUpdater::ConstructNewMap() {
   // the new descriptors to maintain descriptors sharing invariant.
   split_map->ReplaceDescriptors(isolate_, *new_descriptors);
 
+  // If the old descriptors had an enum cache, make sure the new ones do too.
+  if (old_descriptors_->enum_cache()->keys()->length() > 0 &&
+      new_map->NumberOfEnumerableProperties() > 0) {
+    FastKeyAccumulator::InitializeFastPropertyEnumCache(
+        isolate_, new_map, new_map->NumberOfEnumerableProperties());
+  }
+
   if (has_integrity_level_transition_) {
     target_map_ = new_map;
     state_ = kAtIntegrityLevelSource;
@@ -1070,9 +1085,9 @@ void PrintReconfiguration(Isolate* isolate, Handle<Map> map, FILE* file,
                           PropertyAttributes attributes) {
   OFStream os(file);
   os << "[reconfiguring]";
-  Name name = map->instance_descriptors(isolate).GetKey(modify_index);
-  if (name.IsString()) {
-    String::cast(name).PrintOn(file);
+  Tagged<Name> name = map->instance_descriptors(isolate)->GetKey(modify_index);
+  if (IsString(name)) {
+    String::cast(name)->PrintOn(file);
   } else {
     os << "{symbol " << reinterpret_cast<void*>(name.ptr()) << "}";
   }
@@ -1094,7 +1109,7 @@ Handle<Map> MapUpdater::ReconfigureExistingProperty(
   DCHECK(!map->is_dictionary_map());
   DCHECK_EQ(PropertyKind::kData, kind);  // Only kData case is supported so far.
 
-  if (!map->GetBackPointer().IsMap()) {
+  if (!IsMap(map->GetBackPointer())) {
     // There is no benefit from reconstructing transition tree for maps without
     // back pointers, normalize and try to hit the map cache instead.
     return Map::Normalize(isolate, map, CLEAR_INOBJECT_PROPERTIES,
@@ -1119,7 +1134,7 @@ void MapUpdater::UpdateFieldType(Isolate* isolate, Handle<Map> map,
   DCHECK(new_wrapped_type->IsSmi() || new_wrapped_type->IsWeak());
   // We store raw pointers in the queue, so no allocations are allowed.
   PropertyDetails details =
-      map->instance_descriptors(isolate).GetDetails(descriptor);
+      map->instance_descriptors(isolate)->GetDetails(descriptor);
   if (details.location() != PropertyLocation::kField) return;
   DCHECK_EQ(PropertyKind::kData, details.kind());
 
@@ -1131,17 +1146,18 @@ void MapUpdater::UpdateFieldType(Isolate* isolate, Handle<Map> map,
   backlog.push(*map);
 
   while (!backlog.empty()) {
-    Map current = backlog.front();
+    Tagged<Map> current = backlog.front();
     backlog.pop();
 
     TransitionsAccessor transitions(isolate, current);
     int num_transitions = transitions.NumberOfTransitions();
     for (int i = 0; i < num_transitions; ++i) {
-      Map target = transitions.GetTarget(i);
+      Tagged<Map> target = transitions.GetTarget(i);
       backlog.push(target);
     }
-    DescriptorArray descriptors = current.instance_descriptors(isolate);
-    details = descriptors.GetDetails(descriptor);
+    Tagged<DescriptorArray> descriptors =
+        current->instance_descriptors(isolate);
+    details = descriptors->GetDetails(descriptor);
 
     // It is allowed to change representation here only from None
     // to something or from Smi or HeapObject to Tagged.
@@ -1151,11 +1167,11 @@ void MapUpdater::UpdateFieldType(Isolate* isolate, Handle<Map> map,
     // Skip if already updated the shared descriptor.
     if (new_constness != details.constness() ||
         !new_representation.Equals(details.representation()) ||
-        descriptors.GetFieldType(descriptor) != *new_wrapped_type.object()) {
+        descriptors->GetFieldType(descriptor) != *new_wrapped_type.object()) {
       Descriptor d = Descriptor::DataField(
-          name, descriptors.GetFieldIndex(descriptor), details.attributes(),
+          name, descriptors->GetFieldIndex(descriptor), details.attributes(),
           new_constness, new_representation, new_wrapped_type);
-      descriptors.Replace(descriptor, &d);
+      descriptors->Replace(descriptor, &d);
     }
   }
 }
@@ -1185,9 +1201,9 @@ void MapUpdater::GeneralizeField(Isolate* isolate, Handle<Map> map,
       !Map::FieldTypeIsCleared(new_representation, *new_field_type) &&
       // Checking old_field_type for being cleared is not necessary because
       // the NowIs check below would fail anyway in that case.
-      new_field_type->NowIs(old_field_type)) {
-    DCHECK(GeneralizeFieldType(old_representation, old_field_type,
-                               new_representation, new_field_type, isolate)
+      (*new_field_type)->NowIs(old_field_type)) {
+    DCHECK((*GeneralizeFieldType(old_representation, old_field_type,
+                                 new_representation, new_field_type, isolate))
                ->NowIs(old_field_type));
     return;
   }
@@ -1215,7 +1231,7 @@ void MapUpdater::GeneralizeField(Isolate* isolate, Handle<Map> map,
   if (new_constness != old_constness) {
     dep_groups |= DependentCode::kFieldConstGroup;
   }
-  if (!new_field_type->Equals(*old_field_type)) {
+  if (!(*new_field_type)->Equals(*old_field_type)) {
     dep_groups |= DependentCode::kFieldTypeGroup;
   }
   if (!new_representation.Equals(old_representation)) {
diff --git a/deps/v8/src/objects/map-updater.h b/deps/v8/src/objects/map-updater.h
index 6b241a8602c106..f590ed38bbbf45 100644
--- a/deps/v8/src/objects/map-updater.h
+++ b/deps/v8/src/objects/map-updater.h
@@ -69,9 +69,9 @@ class V8_EXPORT_PRIVATE MapUpdater {
 
   // As above but does not mutate maps; instead, we attempt to replay existing
   // transitions to find an updated map. No lock is taken.
-  static base::Optional<Map> TryUpdateNoLock(Isolate* isolate, Map old_map,
-                                             ConcurrencyMode cmode)
-      V8_WARN_UNUSED_RESULT;
+  static base::Optional<Map> TryUpdateNoLock(
+      Isolate* isolate, Tagged<Map> old_map,
+      ConcurrencyMode cmode) V8_WARN_UNUSED_RESULT;
 
   static Handle<Map> ReconfigureExistingProperty(Isolate* isolate,
                                                  Handle<Map> map,
@@ -88,7 +88,8 @@ class V8_EXPORT_PRIVATE MapUpdater {
 
   // Completes inobject slack tracking for the transition tree starting at the
   // initial map.
-  static void CompleteInobjectSlackTracking(Isolate* isolate, Map initial_map);
+  static void CompleteInobjectSlackTracking(Isolate* isolate,
+                                            Tagged<Map> initial_map);
 
  private:
   enum State {
@@ -160,7 +161,7 @@ class V8_EXPORT_PRIVATE MapUpdater {
   State Normalize(const char* reason);
 
   // Returns name of a |descriptor| property.
-  inline Name GetKey(InternalIndex descriptor) const;
+  inline Tagged<Name> GetKey(InternalIndex descriptor) const;
 
   // Returns property details of a |descriptor| in "updated" |old_descriptors_|
   // array.
@@ -168,11 +169,11 @@ class V8_EXPORT_PRIVATE MapUpdater {
 
   // Returns value of a |descriptor| with kDescriptor location in "updated"
   // |old_descriptors_| array.
-  inline Object GetValue(InternalIndex descriptor) const;
+  inline Tagged<Object> GetValue(InternalIndex descriptor) const;
 
   // Returns field type for a |descriptor| with kField location in "updated"
   // |old_descriptors_| array.
-  inline FieldType GetFieldType(InternalIndex descriptor) const;
+  inline Tagged<FieldType> GetFieldType(InternalIndex descriptor) const;
 
   // If a |descriptor| property in "updated" |old_descriptors_| has kField
   // location then returns its field type, otherwise computes the optimal field
diff --git a/deps/v8/src/objects/map.cc b/deps/v8/src/objects/map.cc
index 1bde79e84e9692..798c9c595357d3 100644
--- a/deps/v8/src/objects/map.cc
+++ b/deps/v8/src/objects/map.cc
@@ -5,6 +5,7 @@
 #include "src/objects/map.h"
 
 #include "src/common/assert-scope.h"
+#include "src/common/globals.h"
 #include "src/execution/frames.h"
 #include "src/execution/isolate.h"
 #include "src/handles/handles-inl.h"
@@ -31,38 +32,38 @@
 namespace v8 {
 namespace internal {
 
-Map Map::GetPrototypeChainRootMap(Isolate* isolate) const {
+Tagged<Map> Map::GetPrototypeChainRootMap(Isolate* isolate) const {
   DisallowGarbageCollection no_alloc;
-  if (IsJSReceiverMap()) {
+  if (IsJSReceiverMap(*this)) {
     return *this;
   }
   int constructor_function_index = GetConstructorFunctionIndex();
   if (constructor_function_index != Map::kNoConstructorFunctionIndex) {
-    Context native_context = isolate->context().native_context();
-    JSFunction constructor_function =
-        JSFunction::cast(native_context.get(constructor_function_index));
-    return constructor_function.initial_map();
+    Tagged<Context> native_context = isolate->context()->native_context();
+    Tagged<JSFunction> constructor_function =
+        JSFunction::cast(native_context->get(constructor_function_index));
+    return constructor_function->initial_map();
   }
-  return ReadOnlyRoots(isolate).null_value().map();
+  return ReadOnlyRoots(isolate).null_value()->map();
 }
 
 // static
-base::Optional<JSFunction> Map::GetConstructorFunction(Map map,
-                                                       Context native_context) {
+base::Optional<JSFunction> Map::GetConstructorFunction(
+    Tagged<Map> map, Tagged<Context> native_context) {
   DisallowGarbageCollection no_gc;
-  if (map.IsPrimitiveMap()) {
-    int const constructor_function_index = map.GetConstructorFunctionIndex();
+  if (IsPrimitiveMap(map)) {
+    int const constructor_function_index = map->GetConstructorFunctionIndex();
     if (constructor_function_index != kNoConstructorFunctionIndex) {
-      return JSFunction::cast(native_context.get(constructor_function_index));
+      return JSFunction::cast(native_context->get(constructor_function_index));
     }
   }
   return {};
 }
 
-VisitorId Map::GetVisitorId(Map map) {
+VisitorId Map::GetVisitorId(Tagged<Map> map) {
   static_assert(kVisitorIdCount <= 256);
 
-  const int instance_type = map.instance_type();
+  const int instance_type = map->instance_type();
 
   if (instance_type < FIRST_NONSTRING_TYPE) {
     switch (instance_type & kStringRepresentationMask) {
@@ -92,7 +93,7 @@ VisitorId Map::GetVisitorId(Map map) {
     UNREACHABLE();
   }
 
-  if (InstanceTypeChecker::IsJSApiObject(map.instance_type())) {
+  if (InstanceTypeChecker::IsJSApiObject(map->instance_type())) {
     return kVisitJSApiObject;
   }
 
@@ -103,6 +104,9 @@ VisitorId Map::GetVisitorId(Map map) {
     case BYTECODE_ARRAY_TYPE:
       return kVisitBytecodeArray;
 
+    case EXTERNAL_POINTER_ARRAY_TYPE:
+      return kVisitExternalPointerArray;
+
     case FREE_SPACE_TYPE:
       return kVisitFreeSpace;
 
@@ -156,6 +160,9 @@ VisitorId Map::GetVisitorId(Map map) {
     case ODDBALL_TYPE:
       return kVisitOddball;
 
+    case HOLE_TYPE:
+      return kVisitHole;
+
     case MAP_TYPE:
       return kVisitMap;
 
@@ -250,6 +257,7 @@ VisitorId Map::GetVisitorId(Map map) {
     case JS_ITERATOR_MAP_HELPER_TYPE:
     case JS_ITERATOR_TAKE_HELPER_TYPE:
     case JS_ITERATOR_DROP_HELPER_TYPE:
+    case JS_ITERATOR_FLAT_MAP_HELPER_TYPE:
     case JS_ITERATOR_PROTOTYPE_TYPE:
     case JS_MAP_ITERATOR_PROTOTYPE_TYPE:
     case JS_MAP_KEY_ITERATOR_TYPE:
@@ -417,19 +425,19 @@ VisitorId Map::GetVisitorId(Map map) {
 
 // static
 MaybeObjectHandle Map::WrapFieldType(Isolate* isolate, Handle<FieldType> type) {
-  if (type->IsClass()) {
-    return MaybeObjectHandle::Weak(type->AsClass(), isolate);
+  if (IsClass(*type)) {
+    return MaybeObjectHandle::Weak((*type)->AsClass(), isolate);
   }
   return MaybeObjectHandle(type);
 }
 
 // static
-FieldType Map::UnwrapFieldType(MaybeObject wrapped_type) {
+Tagged<FieldType> Map::UnwrapFieldType(MaybeObject wrapped_type) {
   if (wrapped_type->IsCleared()) {
     return FieldType::None();
   }
-  HeapObject heap_object;
-  if (wrapped_type->GetHeapObjectIfWeak(&heap_object)) {
+  Tagged<HeapObject> heap_object;
+  if (wrapped_type.GetHeapObjectIfWeak(&heap_object)) {
     return FieldType::cast(heap_object);
   }
   return wrapped_type->cast<FieldType>();
@@ -442,7 +450,7 @@ MaybeHandle<Map> Map::CopyWithField(Isolate* isolate, Handle<Map> map,
                                     Representation representation,
                                     TransitionFlag flag) {
   DCHECK(map->instance_descriptors(isolate)
-             .Search(*name, map->NumberOfOwnDescriptors())
+             ->Search(*name, map->NumberOfOwnDescriptors())
              .is_not_found());
 
   // Ensure the descriptor array does not get too big.
@@ -481,16 +489,19 @@ MaybeHandle<Map> Map::CopyWithConstant(Isolate* isolate, Handle<Map> map,
     return MaybeHandle<Map>();
   }
 
-  Representation representation = constant->OptimalRepresentation(isolate);
-  Handle<FieldType> type = constant->OptimalType(isolate, representation);
+  Representation representation =
+      Object::OptimalRepresentation(*constant, isolate);
+  Handle<FieldType> type =
+      Object::OptimalType(*constant, isolate, representation);
   return CopyWithField(isolate, map, name, type, attributes,
                        PropertyConstness::kConst, representation, flag);
 }
 
-bool Map::InstancesNeedRewriting(Map target, ConcurrencyMode cmode) const {
-  int target_number_of_fields = target.NumberOfFields(cmode);
-  int target_inobject = target.GetInObjectProperties();
-  int target_unused = target.UnusedPropertyFields();
+bool Map::InstancesNeedRewriting(Tagged<Map> target,
+                                 ConcurrencyMode cmode) const {
+  int target_number_of_fields = target->NumberOfFields(cmode);
+  int target_inobject = target->GetInObjectProperties();
+  int target_unused = target->UnusedPropertyFields();
   int old_number_of_fields;
 
   return InstancesNeedRewriting(target, target_number_of_fields,
@@ -498,7 +509,8 @@ bool Map::InstancesNeedRewriting(Map target, ConcurrencyMode cmode) const {
                                 &old_number_of_fields, cmode);
 }
 
-bool Map::InstancesNeedRewriting(Map target, int target_number_of_fields,
+bool Map::InstancesNeedRewriting(Tagged<Map> target,
+                                 int target_number_of_fields,
                                  int target_inobject, int target_unused,
                                  int* old_number_of_fields,
                                  ConcurrencyMode cmode) const {
@@ -508,15 +520,15 @@ bool Map::InstancesNeedRewriting(Map target, int target_number_of_fields,
   if (target_number_of_fields != *old_number_of_fields) return true;
 
   // If smi descriptors were replaced by double descriptors, rewrite.
-  DescriptorArray old_desc = IsConcurrent(cmode)
-                                 ? instance_descriptors(kAcquireLoad)
-                                 : instance_descriptors();
-  DescriptorArray new_desc = IsConcurrent(cmode)
-                                 ? target.instance_descriptors(kAcquireLoad)
-                                 : target.instance_descriptors();
+  Tagged<DescriptorArray> old_desc = IsConcurrent(cmode)
+                                         ? instance_descriptors(kAcquireLoad)
+                                         : instance_descriptors();
+  Tagged<DescriptorArray> new_desc =
+      IsConcurrent(cmode) ? target->instance_descriptors(kAcquireLoad)
+                          : target->instance_descriptors();
   for (InternalIndex i : IterateOwnDescriptors()) {
-    if (new_desc.GetDetails(i).representation().IsDouble() !=
-        old_desc.GetDetails(i).representation().IsDouble()) {
+    if (new_desc->GetDetails(i).representation().IsDouble() !=
+        old_desc->GetDetails(i).representation().IsDouble()) {
       return true;
     }
   }
@@ -537,23 +549,23 @@ bool Map::InstancesNeedRewriting(Map target, int target_number_of_fields,
 }
 
 int Map::NumberOfFields(ConcurrencyMode cmode) const {
-  DescriptorArray descriptors = IsConcurrent(cmode)
-                                    ? instance_descriptors(kAcquireLoad)
-                                    : instance_descriptors();
+  Tagged<DescriptorArray> descriptors = IsConcurrent(cmode)
+                                            ? instance_descriptors(kAcquireLoad)
+                                            : instance_descriptors();
   int result = 0;
   for (InternalIndex i : IterateOwnDescriptors()) {
-    if (descriptors.GetDetails(i).location() == PropertyLocation::kField)
+    if (descriptors->GetDetails(i).location() == PropertyLocation::kField)
       result++;
   }
   return result;
 }
 
 Map::FieldCounts Map::GetFieldCounts() const {
-  DescriptorArray descriptors = instance_descriptors();
+  Tagged<DescriptorArray> descriptors = instance_descriptors();
   int mutable_count = 0;
   int const_count = 0;
   for (InternalIndex i : IterateOwnDescriptors()) {
-    PropertyDetails details = descriptors.GetDetails(i);
+    PropertyDetails details = descriptors->GetDetails(i);
     if (details.location() == PropertyLocation::kField) {
       switch (details.constness()) {
         case PropertyConstness::kMutable:
@@ -573,9 +585,9 @@ void Map::DeprecateTransitionTree(Isolate* isolate) {
   TransitionsAccessor transitions(isolate, *this);
   int num_transitions = transitions.NumberOfTransitions();
   for (int i = 0; i < num_transitions; ++i) {
-    transitions.GetTarget(i).DeprecateTransitionTree(isolate);
+    transitions.GetTarget(i)->DeprecateTransitionTree(isolate);
   }
-  DCHECK(!constructor_or_back_pointer().IsFunctionTemplateInfo());
+  DCHECK(!IsFunctionTemplateInfo(constructor_or_back_pointer()));
   DCHECK(CanBeDeprecated());
   set_is_deprecated(true);
   if (v8_flags.log_maps) {
@@ -589,62 +601,64 @@ void Map::DeprecateTransitionTree(Isolate* isolate) {
 // Installs |new_descriptors| over the current instance_descriptors to ensure
 // proper sharing of descriptor arrays.
 void Map::ReplaceDescriptors(Isolate* isolate,
-                             DescriptorArray new_descriptors) {
+                             Tagged<DescriptorArray> new_descriptors) {
+  PtrComprCageBase cage_base(isolate);
   // Don't overwrite the empty descriptor array or initial map's descriptors.
   if (NumberOfOwnDescriptors() == 0 ||
-      GetBackPointer(isolate).IsUndefined(isolate)) {
+      IsUndefined(GetBackPointer(cage_base), isolate)) {
     return;
   }
 
-  DescriptorArray to_replace = instance_descriptors(isolate);
+  Tagged<DescriptorArray> to_replace = instance_descriptors(cage_base);
   // Replace descriptors by new_descriptors in all maps that share it. The old
   // descriptors will not be trimmed in the mark-compactor, we need to mark
   // all its elements.
-  Map current = *this;
+  Tagged<Map> current = *this;
 #ifndef V8_DISABLE_WRITE_BARRIERS
-  WriteBarrier::Marking(to_replace, to_replace.number_of_descriptors());
+  WriteBarrier::Marking(to_replace, to_replace->number_of_descriptors());
 #endif
-  while (current.instance_descriptors(isolate) == to_replace) {
-    Object next = current.GetBackPointer(isolate);
-    if (next.IsUndefined(isolate)) break;  // Stop overwriting at initial map.
-    current.SetEnumLength(kInvalidEnumCacheSentinel);
-    current.UpdateDescriptors(isolate, new_descriptors,
-                              current.NumberOfOwnDescriptors());
-    current = Map::cast(next);
+  while (current->instance_descriptors(cage_base) == to_replace) {
+    Tagged<Map> next;
+    if (!current->TryGetBackPointer(cage_base, &next)) {
+      break;  // Stop overwriting at initial map.
+    }
+    current->SetEnumLength(kInvalidEnumCacheSentinel);
+    current->UpdateDescriptors(isolate, new_descriptors,
+                               current->NumberOfOwnDescriptors());
+    current = next;
   }
   set_owns_descriptors(false);
 }
 
-Map Map::FindRootMap(Isolate* isolate) const {
+Tagged<Map> Map::FindRootMap(PtrComprCageBase cage_base) const {
   DisallowGarbageCollection no_gc;
-  Map result = *this;
-  PtrComprCageBase cage_base(isolate);
+  Tagged<Map> result = *this;
   while (true) {
-    Object back = result.GetBackPointer(cage_base);
-    if (back.IsUndefined(isolate)) {
+    Tagged<Map> parent;
+    if (!result->TryGetBackPointer(cage_base, &parent)) {
       // Initial map must not contain descriptors in the descriptors array
       // that do not belong to the map.
-      DCHECK_LE(result.NumberOfOwnDescriptors(),
-                result.instance_descriptors(cage_base, kRelaxedLoad)
-                    .number_of_descriptors());
+      DCHECK_LE(result->NumberOfOwnDescriptors(),
+                result->instance_descriptors(cage_base, kRelaxedLoad)
+                    ->number_of_descriptors());
       return result;
     }
-    result = Map::cast(back);
+    result = parent;
   }
 }
 
-Map Map::FindFieldOwner(Isolate* isolate, InternalIndex descriptor) const {
+Tagged<Map> Map::FindFieldOwner(PtrComprCageBase cage_base,
+                                InternalIndex descriptor) const {
   DisallowGarbageCollection no_gc;
   DCHECK_EQ(PropertyLocation::kField,
-            instance_descriptors(isolate, kRelaxedLoad)
-                .GetDetails(descriptor)
+            instance_descriptors(cage_base, kRelaxedLoad)
+                ->GetDetails(descriptor)
                 .location());
-  Map result = *this;
+  Tagged<Map> result = *this;
   while (true) {
-    Object back = result.GetBackPointer(isolate);
-    if (back.IsUndefined(isolate)) break;
-    const Map parent = Map::cast(back);
-    if (parent.NumberOfOwnDescriptors() <= descriptor.as_int()) break;
+    Tagged<Map> parent;
+    if (!result->TryGetBackPointer(cage_base, &parent)) break;
+    if (parent->NumberOfOwnDescriptors() <= descriptor.as_int()) break;
     result = parent;
   }
   return result;
@@ -652,13 +666,13 @@ Map Map::FindFieldOwner(Isolate* isolate, InternalIndex descriptor) const {
 
 namespace {
 
-Map SearchMigrationTarget(Isolate* isolate, Map old_map) {
+Tagged<Map> SearchMigrationTarget(Isolate* isolate, Tagged<Map> old_map) {
   DisallowGarbageCollection no_gc;
 
-  Map target = old_map;
+  Tagged<Map> target = old_map;
   do {
     target = TransitionsAccessor(isolate, target).GetMigrationTarget();
-  } while (!target.is_null() && target.is_deprecated());
+  } while (!target.is_null() && target->is_deprecated());
   if (target.is_null()) return Map();
 
   // TODO(ishell): if this validation ever become a bottleneck consider adding a
@@ -669,12 +683,13 @@ Map SearchMigrationTarget(Isolate* isolate, Map old_map) {
   // types instead of old_map's types.
   // Go to slow map updating if the old_map has fast properties with cleared
   // field types.
-  DescriptorArray old_descriptors = old_map.instance_descriptors(isolate);
-  for (InternalIndex i : old_map.IterateOwnDescriptors()) {
-    PropertyDetails old_details = old_descriptors.GetDetails(i);
+  Tagged<DescriptorArray> old_descriptors =
+      old_map->instance_descriptors(isolate);
+  for (InternalIndex i : old_map->IterateOwnDescriptors()) {
+    PropertyDetails old_details = old_descriptors->GetDetails(i);
     if (old_details.location() == PropertyLocation::kField &&
         old_details.kind() == PropertyKind::kData) {
-      FieldType old_type = old_descriptors.GetFieldType(i);
+      Tagged<FieldType> old_type = old_descriptors->GetFieldType(i);
       if (Map::FieldTypeIsCleared(old_details.representation(), old_type)) {
         return Map();
       }
@@ -695,7 +710,7 @@ MaybeHandle<Map> Map::TryUpdate(Isolate* isolate, Handle<Map> old_map) {
   if (!old_map->is_deprecated()) return old_map;
 
   if (v8_flags.fast_map_update) {
-    Map target_map = SearchMigrationTarget(isolate, *old_map);
+    Tagged<Map> target_map = SearchMigrationTarget(isolate, *old_map);
     if (!target_map.is_null()) {
       return handle(target_map, isolate);
     }
@@ -710,31 +725,32 @@ MaybeHandle<Map> Map::TryUpdate(Isolate* isolate, Handle<Map> old_map) {
   return handle(new_map.value(), isolate);
 }
 
-Map Map::TryReplayPropertyTransitions(Isolate* isolate, Map old_map,
-                                      ConcurrencyMode cmode) {
+Tagged<Map> Map::TryReplayPropertyTransitions(Isolate* isolate,
+                                              Tagged<Map> old_map,
+                                              ConcurrencyMode cmode) {
   DisallowGarbageCollection no_gc;
 
   const int root_nof = NumberOfOwnDescriptors();
-  const int old_nof = old_map.NumberOfOwnDescriptors();
+  const int old_nof = old_map->NumberOfOwnDescriptors();
   // TODO(jgruber,chromium:1239009): The main thread should use non-atomic
   // reads, but this currently leads to odd behavior (see the linked bug).
   // Investigate and fix this properly. Also below and in called functions.
-  DescriptorArray old_descriptors =
-      old_map.instance_descriptors(isolate, kAcquireLoad);
+  Tagged<DescriptorArray> old_descriptors =
+      old_map->instance_descriptors(isolate, kAcquireLoad);
 
-  Map new_map = *this;
+  Tagged<Map> new_map = *this;
   for (InternalIndex i : InternalIndex::Range(root_nof, old_nof)) {
-    PropertyDetails old_details = old_descriptors.GetDetails(i);
-    Map transition =
+    PropertyDetails old_details = old_descriptors->GetDetails(i);
+    Tagged<Map> transition =
         TransitionsAccessor(isolate, new_map, IsConcurrent(cmode))
-            .SearchTransition(old_descriptors.GetKey(i), old_details.kind(),
+            .SearchTransition(old_descriptors->GetKey(i), old_details.kind(),
                               old_details.attributes());
     if (transition.is_null()) return Map();
     new_map = transition;
-    DescriptorArray new_descriptors =
-        new_map.instance_descriptors(isolate, kAcquireLoad);
+    Tagged<DescriptorArray> new_descriptors =
+        new_map->instance_descriptors(isolate, kAcquireLoad);
 
-    PropertyDetails new_details = new_descriptors.GetDetails(i);
+    PropertyDetails new_details = new_descriptors->GetDetails(i);
     DCHECK_EQ(old_details.kind(), new_details.kind());
     DCHECK_EQ(old_details.attributes(), new_details.attributes());
     if (!IsGeneralizableTo(old_details.constness(), new_details.constness())) {
@@ -746,7 +762,7 @@ Map Map::TryReplayPropertyTransitions(Isolate* isolate, Map old_map,
     }
     if (new_details.location() == PropertyLocation::kField) {
       if (new_details.kind() == PropertyKind::kData) {
-        FieldType new_type = new_descriptors.GetFieldType(i);
+        Tagged<FieldType> new_type = new_descriptors->GetFieldType(i);
         // Cleared field types need special treatment. They represent lost
         // knowledge, so we must first generalize the new_type to "Any".
         if (FieldTypeIsCleared(new_details.representation(), new_type)) {
@@ -754,29 +770,29 @@ Map Map::TryReplayPropertyTransitions(Isolate* isolate, Map old_map,
         }
         DCHECK_EQ(PropertyKind::kData, old_details.kind());
         DCHECK_EQ(PropertyLocation::kField, old_details.location());
-        FieldType old_type = old_descriptors.GetFieldType(i);
+        Tagged<FieldType> old_type = old_descriptors->GetFieldType(i);
         if (FieldTypeIsCleared(old_details.representation(), old_type) ||
-            !old_type.NowIs(new_type)) {
+            !old_type->NowIs(new_type)) {
           return Map();
         }
       } else {
         DCHECK_EQ(PropertyKind::kAccessor, new_details.kind());
 #ifdef DEBUG
-        FieldType new_type = new_descriptors.GetFieldType(i);
-        DCHECK(new_type.IsAny());
+        Tagged<FieldType> new_type = new_descriptors->GetFieldType(i);
+        DCHECK(IsAny(new_type));
 #endif
         UNREACHABLE();
       }
     } else {
       DCHECK_EQ(PropertyLocation::kDescriptor, new_details.location());
       if (old_details.location() == PropertyLocation::kField ||
-          old_descriptors.GetStrongValue(i) !=
-              new_descriptors.GetStrongValue(i)) {
+          old_descriptors->GetStrongValue(i) !=
+              new_descriptors->GetStrongValue(i)) {
         return Map();
       }
     }
   }
-  if (new_map.NumberOfOwnDescriptors() != old_nof) return Map();
+  if (new_map->NumberOfOwnDescriptors() != old_nof) return Map();
   return new_map;
 }
 
@@ -784,7 +800,7 @@ Map Map::TryReplayPropertyTransitions(Isolate* isolate, Map old_map,
 Handle<Map> Map::Update(Isolate* isolate, Handle<Map> map) {
   if (!map->is_deprecated()) return map;
   if (v8_flags.fast_map_update) {
-    Map target_map = SearchMigrationTarget(isolate, *map);
+    Tagged<Map> target_map = SearchMigrationTarget(isolate, *map);
     if (!target_map.is_null()) {
       return handle(target_map, isolate);
     }
@@ -830,15 +846,15 @@ void Map::EnsureDescriptorSlack(Isolate* isolate, Handle<Map> map, int slack) {
   // (exclusive). In the case that {map} is the initial map, update it.
   map->UpdateDescriptors(isolate, *new_descriptors,
                          map->NumberOfOwnDescriptors());
-  Object next = map->GetBackPointer();
-  if (next.IsUndefined(isolate)) return;
-
-  Map current = Map::cast(next);
-  while (current.instance_descriptors(isolate) == *descriptors) {
-    next = current.GetBackPointer();
-    if (next.IsUndefined(isolate)) break;
-    current.UpdateDescriptors(isolate, *new_descriptors,
-                              current.NumberOfOwnDescriptors());
+  Tagged<Object> next = map->GetBackPointer();
+  if (IsUndefined(next, isolate)) return;
+
+  Tagged<Map> current = Map::cast(next);
+  while (current->instance_descriptors(isolate) == *descriptors) {
+    next = current->GetBackPointer();
+    if (IsUndefined(next, isolate)) break;
+    current->UpdateDescriptors(isolate, *new_descriptors,
+                               current->NumberOfOwnDescriptors());
     current = Map::cast(next);
   }
 }
@@ -846,15 +862,15 @@ void Map::EnsureDescriptorSlack(Isolate* isolate, Handle<Map> map, int slack) {
 // static
 Handle<Map> Map::GetObjectCreateMap(Isolate* isolate,
                                     Handle<HeapObject> prototype) {
-  Handle<Map> map(isolate->native_context()->object_function().initial_map(),
+  Handle<Map> map(isolate->native_context()->object_function()->initial_map(),
                   isolate);
   if (map->prototype() == *prototype) return map;
-  if (prototype->IsNull(isolate)) {
+  if (IsNull(*prototype, isolate)) {
     return isolate->slow_object_with_null_prototype_map();
   }
-  if (prototype->IsJSObjectThatCanBeTrackedAsPrototype()) {
+  if (IsJSObjectThatCanBeTrackedAsPrototype(*prototype)) {
     Handle<JSObject> js_prototype = Handle<JSObject>::cast(prototype);
-    if (!js_prototype->map().is_prototype_map()) {
+    if (!js_prototype->map()->is_prototype_map()) {
       JSObject::OptimizeAsPrototype(js_prototype);
     }
     Handle<PrototypeInfo> info =
@@ -873,7 +889,7 @@ Handle<Map> Map::GetObjectCreateMap(Isolate* isolate,
   return Map::TransitionToPrototype(isolate, map, prototype);
 }
 
-static bool ContainsMap(MapHandles const& maps, Map map) {
+static bool ContainsMap(MapHandles const& maps, Tagged<Map> map) {
   DCHECK(!map.is_null());
   for (Handle<Map> current : maps) {
     if (!current.is_null() && *current == map) return true;
@@ -890,9 +906,9 @@ static bool HasElementsKind(MapHandles const& maps,
   return false;
 }
 
-Map Map::FindElementsKindTransitionedMap(Isolate* isolate,
-                                         MapHandles const& candidates,
-                                         ConcurrencyMode cmode) {
+Tagged<Map> Map::FindElementsKindTransitionedMap(Isolate* isolate,
+                                                 MapHandles const& candidates,
+                                                 ConcurrencyMode cmode) {
   DisallowGarbageCollection no_gc;
 
   if (IsDetached(isolate)) return Map();
@@ -900,29 +916,29 @@ Map Map::FindElementsKindTransitionedMap(Isolate* isolate,
   ElementsKind kind = elements_kind();
   bool is_packed = IsFastPackedElementsKind(kind);
 
-  Map transition;
+  Tagged<Map> transition;
   if (IsTransitionableFastElementsKind(kind)) {
     // Check the state of the root map.
-    Map root_map = FindRootMap(isolate);
+    Tagged<Map> root_map = FindRootMap(isolate);
     if (!EquivalentToForElementsKindTransition(root_map, cmode)) return Map();
-    root_map = root_map.LookupElementsTransitionMap(isolate, kind, cmode);
+    root_map = root_map->LookupElementsTransitionMap(isolate, kind, cmode);
     DCHECK(!root_map.is_null());
     // Starting from the next existing elements kind transition try to
     // replay the property transitions that does not involve instance rewriting
     // (ElementsTransitionAndStoreStub does not support that).
-    for (root_map = root_map.ElementsTransitionMap(isolate, cmode);
-         !root_map.is_null() && root_map.has_fast_elements();
-         root_map = root_map.ElementsTransitionMap(isolate, cmode)) {
+    for (root_map = root_map->ElementsTransitionMap(isolate, cmode);
+         !root_map.is_null() && root_map->has_fast_elements();
+         root_map = root_map->ElementsTransitionMap(isolate, cmode)) {
       // If root_map's elements kind doesn't match any of the elements kind in
       // the candidates there is no need to do any additional work.
-      if (!HasElementsKind(candidates, root_map.elements_kind())) continue;
-      Map current =
-          root_map.TryReplayPropertyTransitions(isolate, *this, cmode);
+      if (!HasElementsKind(candidates, root_map->elements_kind())) continue;
+      Tagged<Map> current =
+          root_map->TryReplayPropertyTransitions(isolate, *this, cmode);
       if (current.is_null()) continue;
       if (InstancesNeedRewriting(current, cmode)) continue;
 
       const bool current_is_packed =
-          IsFastPackedElementsKind(current.elements_kind());
+          IsFastPackedElementsKind(current->elements_kind());
       if (ContainsMap(candidates, current) &&
           (is_packed || !current_is_packed)) {
         transition = current;
@@ -933,31 +949,34 @@ Map Map::FindElementsKindTransitionedMap(Isolate* isolate,
   return transition;
 }
 
-static Map FindClosestElementsTransition(Isolate* isolate, Map map,
-                                         ElementsKind to_kind,
-                                         ConcurrencyMode cmode) {
+static Tagged<Map> FindClosestElementsTransition(Isolate* isolate,
+                                                 Tagged<Map> map,
+                                                 ElementsKind to_kind,
+                                                 ConcurrencyMode cmode) {
   DisallowGarbageCollection no_gc;
   // Ensure we are requested to search elements kind transition "near the root".
-  DCHECK_EQ(map.FindRootMap(isolate).NumberOfOwnDescriptors(),
-            map.NumberOfOwnDescriptors());
-  Map current_map = map;
+  DCHECK_EQ(map->FindRootMap(isolate)->NumberOfOwnDescriptors(),
+            map->NumberOfOwnDescriptors());
+  Tagged<Map> current_map = map;
 
-  ElementsKind kind = map.elements_kind();
+  ElementsKind kind = map->elements_kind();
   while (kind != to_kind) {
-    Map next_map = current_map.ElementsTransitionMap(isolate, cmode);
+    Tagged<Map> next_map = current_map->ElementsTransitionMap(isolate, cmode);
     if (next_map.is_null()) return current_map;
-    kind = next_map.elements_kind();
+    kind = next_map->elements_kind();
     current_map = next_map;
   }
 
-  DCHECK_EQ(to_kind, current_map.elements_kind());
+  DCHECK_EQ(to_kind, current_map->elements_kind());
   return current_map;
 }
 
-Map Map::LookupElementsTransitionMap(Isolate* isolate, ElementsKind to_kind,
-                                     ConcurrencyMode cmode) {
-  Map to_map = FindClosestElementsTransition(isolate, *this, to_kind, cmode);
-  if (to_map.elements_kind() == to_kind) return to_map;
+Tagged<Map> Map::LookupElementsTransitionMap(Isolate* isolate,
+                                             ElementsKind to_kind,
+                                             ConcurrencyMode cmode) {
+  Tagged<Map> to_map =
+      FindClosestElementsTransition(isolate, *this, to_kind, cmode);
+  if (to_map->elements_kind() == to_kind) return to_map;
   return Map();
 }
 
@@ -978,35 +997,35 @@ Handle<Map> Map::TransitionElementsTo(Isolate* isolate, Handle<Map> map,
   ElementsKind from_kind = map->elements_kind();
   if (from_kind == to_kind) return map;
 
-  Context native_context = isolate->context().native_context();
+  Tagged<Context> native_context = isolate->context()->native_context();
   if (from_kind == FAST_SLOPPY_ARGUMENTS_ELEMENTS) {
-    if (*map == native_context.fast_aliased_arguments_map()) {
+    if (*map == native_context->fast_aliased_arguments_map()) {
       DCHECK_EQ(SLOW_SLOPPY_ARGUMENTS_ELEMENTS, to_kind);
-      return handle(native_context.slow_aliased_arguments_map(), isolate);
+      return handle(native_context->slow_aliased_arguments_map(), isolate);
     }
   } else if (from_kind == SLOW_SLOPPY_ARGUMENTS_ELEMENTS) {
-    if (*map == native_context.slow_aliased_arguments_map()) {
+    if (*map == native_context->slow_aliased_arguments_map()) {
       DCHECK_EQ(FAST_SLOPPY_ARGUMENTS_ELEMENTS, to_kind);
-      return handle(native_context.fast_aliased_arguments_map(), isolate);
+      return handle(native_context->fast_aliased_arguments_map(), isolate);
     }
   } else if (IsFastElementsKind(from_kind) && IsFastElementsKind(to_kind)) {
     // Reuse map transitions for JSArrays.
     DisallowGarbageCollection no_gc;
-    if (native_context.GetInitialJSArrayMap(from_kind) == *map) {
-      Object maybe_transitioned_map =
-          native_context.get(Context::ArrayMapIndex(to_kind));
-      if (maybe_transitioned_map.IsMap()) {
+    if (native_context->GetInitialJSArrayMap(from_kind) == *map) {
+      Tagged<Object> maybe_transitioned_map =
+          native_context->get(Context::ArrayMapIndex(to_kind));
+      if (IsMap(maybe_transitioned_map)) {
         return handle(Map::cast(maybe_transitioned_map), isolate);
       }
     }
   }
 
-  DCHECK(!map->IsUndefined(isolate));
+  DCHECK(!IsUndefined(*map, isolate));
   // Check if we can go back in the elements kind transition chain.
   if (IsHoleyElementsKind(from_kind) &&
       to_kind == GetPackedElementsKind(from_kind) &&
-      map->GetBackPointer().IsMap() &&
-      Map::cast(map->GetBackPointer()).elements_kind() == to_kind) {
+      IsMap(map->GetBackPointer()) &&
+      Map::cast(map->GetBackPointer())->elements_kind() == to_kind) {
     return handle(Map::cast(map->GetBackPointer()), isolate);
   }
 
@@ -1060,8 +1079,9 @@ static Handle<Map> AddMissingElementsTransitions(Isolate* isolate,
 base::Optional<Map> Map::TryAsElementsKind(Isolate* isolate, Handle<Map> map,
                                            ElementsKind kind,
                                            ConcurrencyMode cmode) {
-  Map closest_map = FindClosestElementsTransition(isolate, *map, kind, cmode);
-  if (closest_map.elements_kind() != kind) return {};
+  Tagged<Map> closest_map =
+      FindClosestElementsTransition(isolate, *map, kind, cmode);
+  if (closest_map->elements_kind() != kind) return {};
   return closest_map;
 }
 
@@ -1082,10 +1102,10 @@ Handle<Map> Map::AsElementsKind(Isolate* isolate, Handle<Map> map,
 
 int Map::NumberOfEnumerableProperties() const {
   int result = 0;
-  DescriptorArray descs = instance_descriptors(kRelaxedLoad);
+  Tagged<DescriptorArray> descs = instance_descriptors(kRelaxedLoad);
   for (InternalIndex i : IterateOwnDescriptors()) {
-    if ((int{descs.GetDetails(i).attributes()} & ONLY_ENUMERABLE) == 0 &&
-        !descs.GetKey(i).FilterKey(ENUMERABLE_STRINGS)) {
+    if ((int{descs->GetDetails(i).attributes()} & ONLY_ENUMERABLE) == 0 &&
+        !Object::FilterKey(descs->GetKey(i), ENUMERABLE_STRINGS)) {
       result++;
     }
   }
@@ -1094,10 +1114,10 @@ int Map::NumberOfEnumerableProperties() const {
 
 int Map::NextFreePropertyIndex() const {
   int number_of_own_descriptors = NumberOfOwnDescriptors();
-  DescriptorArray descs = instance_descriptors(kRelaxedLoad);
+  Tagged<DescriptorArray> descs = instance_descriptors(kRelaxedLoad);
   // Search properties backwards to find the last field.
   for (int i = number_of_own_descriptors - 1; i >= 0; --i) {
-    PropertyDetails details = descs.GetDetails(InternalIndex(i));
+    PropertyDetails details = descs->GetDetails(InternalIndex(i));
     if (details.location() == PropertyLocation::kField) {
       return details.field_index() + details.field_width_in_words();
     }
@@ -1109,7 +1129,7 @@ bool Map::OnlyHasSimpleProperties() const {
   // Wrapped string elements aren't explicitly stored in the elements backing
   // store, but are loaded indirectly from the underlying string.
   return !IsStringWrapperElementsKind(elements_kind()) &&
-         !IsSpecialReceiverMap() && !is_dictionary_map();
+         !IsSpecialReceiverMap(*this) && !is_dictionary_map();
 }
 
 bool Map::MayHaveReadOnlyElementsInPrototypeChain(Isolate* isolate) {
@@ -1118,22 +1138,22 @@ bool Map::MayHaveReadOnlyElementsInPrototypeChain(Isolate* isolate) {
     // Be conservative, don't look into any JSReceivers that may have custom
     // elements. For example, into JSProxies, String wrappers (which have have
     // non-configurable, non-writable elements), API objects, etc.
-    if (iter.GetCurrent().map().IsCustomElementsReceiverMap()) return true;
+    if (IsCustomElementsReceiverMap(iter.GetCurrent()->map())) return true;
 
-    JSObject current = iter.GetCurrent<JSObject>();
-    ElementsKind elements_kind = current.GetElementsKind(isolate);
+    Tagged<JSObject> current = iter.GetCurrent<JSObject>();
+    ElementsKind elements_kind = current->GetElementsKind(isolate);
     if (IsFrozenElementsKind(elements_kind)) return true;
 
     if (IsDictionaryElementsKind(elements_kind) &&
-        current.element_dictionary(isolate).requires_slow_elements()) {
+        current->element_dictionary(isolate)->requires_slow_elements()) {
       return true;
     }
 
     if (IsSlowArgumentsElementsKind(elements_kind)) {
-      SloppyArgumentsElements elements =
-          SloppyArgumentsElements::cast(current.elements(isolate));
-      Object arguments = elements.arguments();
-      if (NumberDictionary::cast(arguments).requires_slow_elements()) {
+      Tagged<SloppyArgumentsElements> elements =
+          SloppyArgumentsElements::cast(current->elements(isolate));
+      Tagged<Object> arguments = elements->arguments();
+      if (NumberDictionary::cast(arguments)->requires_slow_elements()) {
         return true;
       }
     }
@@ -1151,12 +1171,12 @@ Handle<Map> Map::RawCopy(Isolate* isolate, Handle<Map> src_handle,
   // heap verification might fail otherwise.
   {
     DisallowGarbageCollection no_gc;
-    Map src = *src_handle;
-    Map raw = *result;
-    raw.set_constructor_or_back_pointer(src.GetConstructor());
-    raw.set_bit_field(src.bit_field());
-    raw.set_bit_field2(src.bit_field2());
-    int new_bit_field3 = src.bit_field3();
+    Tagged<Map> src = *src_handle;
+    Tagged<Map> raw = *result;
+    raw->set_constructor_or_back_pointer(src->GetConstructorRaw());
+    raw->set_bit_field(src->bit_field());
+    raw->set_bit_field2(src->bit_field2());
+    int new_bit_field3 = src->bit_field3();
     new_bit_field3 = Bits3::OwnsDescriptorsBit::update(new_bit_field3, true);
     new_bit_field3 =
         Bits3::NumberOfOwnDescriptorsBits::update(new_bit_field3, 0);
@@ -1165,12 +1185,12 @@ Handle<Map> Map::RawCopy(Isolate* isolate, Handle<Map> src_handle,
     new_bit_field3 = Bits3::IsDeprecatedBit::update(new_bit_field3, false);
     new_bit_field3 =
         Bits3::IsInRetainedMapListBit::update(new_bit_field3, false);
-    if (!src.is_dictionary_map()) {
+    if (!src->is_dictionary_map()) {
       new_bit_field3 = Bits3::IsUnstableBit::update(new_bit_field3, false);
     }
     // Same as bit_field comment above.
-    raw.set_bit_field3(new_bit_field3);
-    raw.clear_padding();
+    raw->set_bit_field3(new_bit_field3);
+    raw->clear_padding();
   }
   Handle<HeapObject> prototype(src_handle->prototype(), isolate);
   Map::SetPrototype(isolate, result, prototype);
@@ -1185,7 +1205,7 @@ Handle<Map> Map::Normalize(Isolate* isolate, Handle<Map> fast_map,
 
   Handle<Object> maybe_cache(isolate->native_context()->normalized_map_cache(),
                              isolate);
-  if (fast_map->is_prototype_map() || maybe_cache->IsUndefined(isolate)) {
+  if (fast_map->is_prototype_map() || IsUndefined(*maybe_cache, isolate)) {
     use_cache = false;
   }
   Handle<NormalizedMapCache> cache;
@@ -1267,14 +1287,14 @@ Handle<Map> Map::CopyNormalized(Isolate* isolate, Handle<Map> map,
       mode == CLEAR_INOBJECT_PROPERTIES ? 0 : map->GetInObjectProperties());
   {
     DisallowGarbageCollection no_gc;
-    Map raw = *result;
+    Tagged<Map> raw = *result;
     // Clear the unused_property_fields explicitly as this field should not
     // be accessed for normalized maps.
-    raw.SetInObjectUnusedPropertyFields(0);
-    raw.set_is_dictionary_map(true);
-    raw.set_is_migration_target(false);
-    raw.set_may_have_interesting_symbols(true);
-    raw.set_construction_counter(kNoSlackTracking);
+    raw->SetInObjectUnusedPropertyFields(0);
+    raw->set_is_dictionary_map(true);
+    raw->set_is_migration_target(false);
+    raw->set_may_have_interesting_properties(true);
+    raw->set_construction_counter(kNoSlackTracking);
   }
 
 #ifdef VERIFY_HEAP
@@ -1299,25 +1319,27 @@ Handle<Map> Map::TransitionToImmutableProto(Isolate* isolate, Handle<Map> map) {
 namespace {
 void EnsureInitialMap(Isolate* isolate, Handle<Map> map) {
 #ifdef DEBUG
-  Object maybe_constructor = map->GetConstructor();
-  DCHECK((maybe_constructor.IsJSFunction() &&
-          *map == JSFunction::cast(maybe_constructor).initial_map()) ||
+  Tagged<Object> maybe_constructor = map->GetConstructor();
+  DCHECK((IsJSFunction(maybe_constructor) &&
+          *map == JSFunction::cast(maybe_constructor)->initial_map()) ||
          // Below are the exceptions to the check above.
-         // Strict function maps have Function as a constructor but the
-         // Function's initial map is a sloppy function map.
+         // |Function|'s initial map is a |sloppy_function_map| but
+         // other function map variants such as sloppy with name or readonly
+         // prototype or various strict function maps variants, etc. also
+         // have Function as a constructor.
          *map == *isolate->strict_function_map() ||
          *map == *isolate->strict_function_with_name_map() ||
-         // Same holds for GeneratorFunction and its initial map.
-         *map == *isolate->generator_function_map() ||
+         // Same applies to |GeneratorFunction|'s initial map and generator
+         // function map variants.
          *map == *isolate->generator_function_with_name_map() ||
-         // AsyncFunction has Null as a constructor.
-         *map == *isolate->async_function_map() ||
+         // Same applies to |AsyncFunction|'s initial map and other async
+         // function map variants.
          *map == *isolate->async_function_with_name_map());
 #endif
   // Initial maps must not contain descriptors in the descriptors array
   // that do not belong to the map.
   DCHECK_EQ(map->NumberOfOwnDescriptors(),
-            map->instance_descriptors(isolate).number_of_descriptors());
+            map->instance_descriptors(isolate)->number_of_descriptors());
 }
 }  // namespace
 
@@ -1343,7 +1365,7 @@ Handle<Map> Map::CopyInitialMap(Isolate* isolate, Handle<Map> map,
   int number_of_own_descriptors = map->NumberOfOwnDescriptors();
   if (number_of_own_descriptors > 0) {
     // The copy will use the same descriptors array without ownership.
-    DescriptorArray descriptors = map->instance_descriptors(isolate);
+    Tagged<DescriptorArray> descriptors = map->instance_descriptors(isolate);
     result->set_owns_descriptors(false);
     result->UpdateDescriptors(isolate, descriptors, number_of_own_descriptors);
 
@@ -1357,10 +1379,10 @@ Handle<Map> Map::CopyInitialMap(Isolate* isolate, Handle<Map> map,
 Handle<Map> Map::CopyDropDescriptors(Isolate* isolate, Handle<Map> map) {
   Handle<Map> result =
       RawCopy(isolate, map, map->instance_size(),
-              map->IsJSObjectMap() ? map->GetInObjectProperties() : 0);
+              IsJSObjectMap(*map) ? map->GetInObjectProperties() : 0);
 
   // Please note instance_type and instance_size are set when allocated.
-  if (map->IsJSObjectMap()) {
+  if (IsJSObjectMap(*map)) {
     result->CopyUnusedPropertyFields(*map);
   }
   map->NotifyLeafMapLayoutChange(isolate);
@@ -1374,14 +1396,14 @@ Handle<Map> Map::ShareDescriptor(Isolate* isolate, Handle<Map> map,
   // array, implying that its NumberOfOwnDescriptors equals the number of
   // descriptors in the descriptor array.
   DCHECK_EQ(map->NumberOfOwnDescriptors(),
-            map->instance_descriptors(isolate).number_of_descriptors());
+            map->instance_descriptors(isolate)->number_of_descriptors());
 
   Handle<Map> result = CopyDropDescriptors(isolate, map);
   Handle<Name> name = descriptor->GetKey();
 
   // Properly mark the {result} if the {name} is an "interesting symbol".
-  if (name->IsInterestingSymbol()) {
-    result->set_may_have_interesting_symbols(true);
+  if (name->IsInteresting(isolate)) {
+    result->set_may_have_interesting_properties(true);
   }
 
   // Ensure there's space for the new descriptor in the shared descriptor array.
@@ -1411,17 +1433,17 @@ Handle<Map> Map::ShareDescriptor(Isolate* isolate, Handle<Map> map,
 void Map::ConnectTransition(Isolate* isolate, Handle<Map> parent,
                             Handle<Map> child, Handle<Name> name,
                             SimpleTransitionFlag flag) {
-  DCHECK_IMPLIES(name->IsInterestingSymbol(),
-                 child->may_have_interesting_symbols());
-  DCHECK_IMPLIES(parent->may_have_interesting_symbols(),
-                 child->may_have_interesting_symbols());
-  if (!parent->GetBackPointer().IsUndefined(isolate)) {
+  DCHECK_IMPLIES(name->IsInteresting(isolate),
+                 child->may_have_interesting_properties());
+  DCHECK_IMPLIES(parent->may_have_interesting_properties(),
+                 child->may_have_interesting_properties());
+  if (!IsUndefined(parent->GetBackPointer(), isolate)) {
     parent->set_owns_descriptors(false);
   } else if (!parent->IsDetached(isolate)) {
     // |parent| is initial map and it must not contain descriptors in the
     // descriptors array that do not belong to the map.
     DCHECK_EQ(parent->NumberOfOwnDescriptors(),
-              parent->instance_descriptors(isolate).number_of_descriptors());
+              parent->instance_descriptors(isolate)->number_of_descriptors());
   }
   if (parent->IsDetached(isolate)) {
     DCHECK(child->IsDetached(isolate));
@@ -1449,8 +1471,8 @@ Handle<Map> Map::CopyReplaceDescriptors(Isolate* isolate, Handle<Map> map,
 
   // Properly mark the {result} if the {name} is an "interesting symbol".
   Handle<Name> name;
-  if (maybe_name.ToHandle(&name) && name->IsInterestingSymbol()) {
-    result->set_may_have_interesting_symbols(true);
+  if (maybe_name.ToHandle(&name) && name->IsInteresting(isolate)) {
+    result->set_may_have_interesting_properties(true);
   }
 
   if (map->is_prototype_map()) {
@@ -1500,7 +1522,7 @@ Handle<Map> Map::AddMissingTransitions(Isolate* isolate, Handle<Map> split_map,
   Handle<Map> last_map = CopyDropDescriptors(isolate, split_map);
   last_map->InitializeDescriptors(isolate, *descriptors);
   last_map->SetInObjectUnusedPropertyFields(0);
-  last_map->set_may_have_interesting_symbols(true);
+  last_map->set_may_have_interesting_properties(true);
 
   // During creation of intermediate maps we violate descriptors sharing
   // invariant since the last map is not yet connected to the transition tree
@@ -1515,7 +1537,7 @@ Handle<Map> Map::AddMissingTransitions(Isolate* isolate, Handle<Map> split_map,
     map = new_map;
   }
   map->NotifyLeafMapLayoutChange(isolate);
-  last_map->set_may_have_interesting_symbols(false);
+  last_map->set_may_have_interesting_properties(false);
   InstallDescriptors(isolate, map, last_map, InternalIndex(nof_descriptors - 1),
                      descriptors);
   return last_map;
@@ -1537,8 +1559,9 @@ void Map::InstallDescriptors(Isolate* isolate, Handle<Map> parent,
   }
 
   Handle<Name> name = handle(descriptors->GetKey(new_descriptor), isolate);
-  if (parent->may_have_interesting_symbols() || name->IsInterestingSymbol()) {
-    child->set_may_have_interesting_symbols(true);
+  if (parent->may_have_interesting_properties() ||
+      name->IsInteresting(isolate)) {
+    child->set_may_have_interesting_properties(true);
   }
   ConnectTransition(isolate, parent, child, name, SIMPLE_PROPERTY_TRANSITION);
 }
@@ -1547,23 +1570,23 @@ Handle<Map> Map::CopyAsElementsKind(Isolate* isolate, Handle<Map> map,
                                     ElementsKind kind, TransitionFlag flag) {
   // Only certain objects are allowed to have non-terminal fast transitional
   // elements kinds.
-  DCHECK(map->IsJSObjectMap());
+  DCHECK(IsJSObjectMap(*map));
   DCHECK_IMPLIES(
       !map->CanHaveFastTransitionableElementsKind(),
       IsDictionaryElementsKind(kind) || IsTerminalElementsKind(kind));
 
-  Map maybe_elements_transition_map;
+  Tagged<Map> maybe_elements_transition_map;
   if (flag == INSERT_TRANSITION) {
     // Ensure we are requested to add elements kind transition "near the root".
-    DCHECK_EQ(map->FindRootMap(isolate).NumberOfOwnDescriptors(),
+    DCHECK_EQ(map->FindRootMap(isolate)->NumberOfOwnDescriptors(),
               map->NumberOfOwnDescriptors());
 
     maybe_elements_transition_map =
         map->ElementsTransitionMap(isolate, ConcurrencyMode::kSynchronous);
-    DCHECK(
-        maybe_elements_transition_map.is_null() ||
-        (maybe_elements_transition_map.elements_kind() == DICTIONARY_ELEMENTS &&
-         kind == DICTIONARY_ELEMENTS));
+    DCHECK(maybe_elements_transition_map.is_null() ||
+           (maybe_elements_transition_map->elements_kind() ==
+                DICTIONARY_ELEMENTS &&
+            kind == DICTIONARY_ELEMENTS));
     DCHECK(!IsFastElementsKind(kind) ||
            IsMoreGeneralElementsKindTransition(map->elements_kind(), kind));
     DCHECK(kind != map->elements_kind());
@@ -1668,7 +1691,7 @@ Handle<Map> Map::Create(Isolate* isolate, int inobject_properties) {
       Copy(isolate, handle(isolate->object_function()->initial_map(), isolate),
            "MapCreate");
   DisallowGarbageCollection no_gc;
-  Map copy = *copy_handle;
+  Tagged<Map> copy = *copy_handle;
 
   // Check that we do not overflow the instance size when adding the extra
   // inobject properties. If the instance size overflows, we allocate as many
@@ -1681,11 +1704,11 @@ Handle<Map> Map::Create(Isolate* isolate, int inobject_properties) {
       JSObject::kHeaderSize + kTaggedSize * inobject_properties;
 
   // Adjust the map with the extra inobject properties.
-  copy.set_instance_size(new_instance_size);
-  copy.SetInObjectPropertiesStartInWords(JSObject::kHeaderSize / kTaggedSize);
-  DCHECK_EQ(copy.GetInObjectProperties(), inobject_properties);
-  copy.SetInObjectUnusedPropertyFields(inobject_properties);
-  copy.set_visitor_id(Map::GetVisitorId(copy));
+  copy->set_instance_size(new_instance_size);
+  copy->SetInObjectPropertiesStartInWords(JSObject::kHeaderSize / kTaggedSize);
+  DCHECK_EQ(copy->GetInObjectProperties(), inobject_properties);
+  copy->SetInObjectUnusedPropertyFields(inobject_properties);
+  copy->set_visitor_id(Map::GetVisitorId(copy));
 
   return copy_handle;
 }
@@ -1765,14 +1788,14 @@ Handle<Map> Map::CopyForPreventExtensions(
 
 namespace {
 
-bool CanHoldValue(DescriptorArray descriptors, InternalIndex descriptor,
-                  PropertyConstness constness, Object value) {
-  PropertyDetails details = descriptors.GetDetails(descriptor);
+bool CanHoldValue(Tagged<DescriptorArray> descriptors, InternalIndex descriptor,
+                  PropertyConstness constness, Tagged<Object> value) {
+  PropertyDetails details = descriptors->GetDetails(descriptor);
   if (details.location() == PropertyLocation::kField) {
     if (details.kind() == PropertyKind::kData) {
       return IsGeneralizableTo(constness, details.constness()) &&
-             value.FitsRepresentation(details.representation()) &&
-             descriptors.GetFieldType(descriptor).NowContains(value);
+             Object::FitsRepresentation(value, details.representation()) &&
+             descriptors->GetFieldType(descriptor)->NowContains(value);
     } else {
       DCHECK_EQ(PropertyKind::kAccessor, details.kind());
       return false;
@@ -1797,9 +1820,10 @@ Handle<Map> UpdateDescriptorForValue(Isolate* isolate, Handle<Map> map,
   }
 
   PropertyAttributes attributes =
-      map->instance_descriptors(isolate).GetDetails(descriptor).attributes();
-  Representation representation = value->OptimalRepresentation(isolate);
-  Handle<FieldType> type = value->OptimalType(isolate, representation);
+      map->instance_descriptors(isolate)->GetDetails(descriptor).attributes();
+  Representation representation =
+      Object::OptimalRepresentation(*value, isolate);
+  Handle<FieldType> type = Object::OptimalType(*value, isolate, representation);
 
   MapUpdater mu(isolate, map);
   return mu.ReconfigureToDataField(descriptor, attributes, constness,
@@ -1831,7 +1855,7 @@ Handle<Map> Map::TransitionToDataProperty(Isolate* isolate, Handle<Map> map,
                 ? RuntimeCallCounterId::kPrototypeMap_TransitionToDataProperty
                 : RuntimeCallCounterId::kMap_TransitionToDataProperty);
 
-  DCHECK(name->IsUniqueName());
+  DCHECK(IsUniqueName(*name));
   DCHECK(!map->is_dictionary_map());
 
   // Migrate to the newest map before storing the property.
@@ -1844,7 +1868,7 @@ Handle<Map> Map::TransitionToDataProperty(Isolate* isolate, Handle<Map> map,
     InternalIndex descriptor = transition->LastAdded();
 
     DCHECK_EQ(attributes, transition->instance_descriptors(isolate)
-                              .GetDetails(descriptor)
+                              ->GetDetails(descriptor)
                               .attributes());
 
     return UpdateDescriptorForValue(isolate, transition, descriptor, constness,
@@ -1856,8 +1880,10 @@ Handle<Map> Map::TransitionToDataProperty(Isolate* isolate, Handle<Map> map,
       isolate->bootstrapper()->IsActive() ? OMIT_TRANSITION : INSERT_TRANSITION;
   MaybeHandle<Map> maybe_map;
   if (!map->TooManyFastProperties(store_origin)) {
-    Representation representation = value->OptimalRepresentation(isolate);
-    Handle<FieldType> type = value->OptimalType(isolate, representation);
+    Representation representation =
+        Object::OptimalRepresentation(*value, isolate);
+    Handle<FieldType> type =
+        Object::OptimalType(*value, isolate, representation);
     maybe_map = Map::CopyWithField(isolate, map, name, type, attributes,
                                    constness, representation, flag);
   }
@@ -1877,11 +1903,11 @@ Handle<Map> Map::TransitionToDataProperty(Isolate* isolate, Handle<Map> map,
 #endif
     Handle<Object> maybe_constructor(map->GetConstructor(), isolate);
     if (v8_flags.feedback_normalization && map->new_target_is_base() &&
-        maybe_constructor->IsJSFunction() &&
-        !JSFunction::cast(*maybe_constructor).shared().native()) {
+        IsJSFunction(*maybe_constructor) &&
+        !JSFunction::cast(*maybe_constructor)->shared()->native()) {
       Handle<JSFunction> constructor =
           Handle<JSFunction>::cast(maybe_constructor);
-      DCHECK_NE(*constructor, constructor->native_context().object_function());
+      DCHECK_NE(*constructor, constructor->native_context()->object_function());
       Handle<Map> initial_map(constructor->initial_map(), isolate);
       result = Map::Normalize(isolate, initial_map, CLEAR_INOBJECT_PROPERTIES,
                               reason);
@@ -1918,8 +1944,8 @@ Handle<Map> Map::TransitionToAccessorProperty(Isolate* isolate, Handle<Map> map,
           : RuntimeCallCounterId::kMap_TransitionToAccessorProperty);
 
   // At least one of the accessors needs to be a new value.
-  DCHECK(!getter->IsNull(isolate) || !setter->IsNull(isolate));
-  DCHECK(name->IsUniqueName());
+  DCHECK(!IsNull(*getter, isolate) || !IsNull(*setter, isolate));
+  DCHECK(IsUniqueName(*name));
 
   // Migrate to the newest map before transitioning to the new property.
   map = Update(isolate, map);
@@ -1935,17 +1961,19 @@ Handle<Map> Map::TransitionToAccessorProperty(Isolate* isolate, Handle<Map> map,
       isolate, map, *name, PropertyKind::kAccessor, attributes);
   Handle<Map> transition;
   if (maybe_transition.ToHandle(&transition)) {
-    DescriptorArray descriptors = transition->instance_descriptors(isolate);
+    Tagged<DescriptorArray> descriptors =
+        transition->instance_descriptors(isolate);
     InternalIndex last_descriptor = transition->LastAdded();
-    DCHECK(descriptors.GetKey(last_descriptor).Equals(*name));
+    DCHECK(descriptors->GetKey(last_descriptor)->Equals(*name));
 
     DCHECK_EQ(PropertyKind::kAccessor,
-              descriptors.GetDetails(last_descriptor).kind());
-    DCHECK_EQ(attributes, descriptors.GetDetails(last_descriptor).attributes());
+              descriptors->GetDetails(last_descriptor).kind());
+    DCHECK_EQ(attributes,
+              descriptors->GetDetails(last_descriptor).attributes());
 
-    Handle<Object> maybe_pair(descriptors.GetStrongValue(last_descriptor),
+    Handle<Object> maybe_pair(descriptors->GetStrongValue(last_descriptor),
                               isolate);
-    if (!maybe_pair->IsAccessorPair()) {
+    if (!IsAccessorPair(*maybe_pair)) {
       return Map::Normalize(isolate, map, mode,
                             "TransitionToAccessorFromNonPair");
     }
@@ -1960,12 +1988,12 @@ Handle<Map> Map::TransitionToAccessorProperty(Isolate* isolate, Handle<Map> map,
   }
 
   Handle<AccessorPair> pair;
-  DescriptorArray old_descriptors = map->instance_descriptors(isolate);
+  Tagged<DescriptorArray> old_descriptors = map->instance_descriptors(isolate);
   if (descriptor.is_found()) {
     if (descriptor != map->LastAdded()) {
       return Map::Normalize(isolate, map, mode, "AccessorsOverwritingNonLast");
     }
-    PropertyDetails old_details = old_descriptors.GetDetails(descriptor);
+    PropertyDetails old_details = old_descriptors->GetDetails(descriptor);
     if (old_details.kind() != PropertyKind::kAccessor) {
       return Map::Normalize(isolate, map, mode,
                             "AccessorsOverwritingNonAccessors");
@@ -1975,9 +2003,9 @@ Handle<Map> Map::TransitionToAccessorProperty(Isolate* isolate, Handle<Map> map,
       return Map::Normalize(isolate, map, mode, "AccessorsWithAttributes");
     }
 
-    Handle<Object> maybe_pair(old_descriptors.GetStrongValue(descriptor),
+    Handle<Object> maybe_pair(old_descriptors->GetStrongValue(descriptor),
                               isolate);
-    if (!maybe_pair->IsAccessorPair()) {
+    if (!IsAccessorPair(*maybe_pair)) {
       return Map::Normalize(isolate, map, mode, "AccessorsOverwritingNonPair");
     }
 
@@ -1985,13 +2013,13 @@ Handle<Map> Map::TransitionToAccessorProperty(Isolate* isolate, Handle<Map> map,
     if (current_pair->Equals(*getter, *setter)) return map;
 
     bool overwriting_accessor = false;
-    if (!getter->IsNull(isolate) &&
-        !current_pair->get(ACCESSOR_GETTER).IsNull(isolate) &&
+    if (!IsNull(*getter, isolate) &&
+        !IsNull(current_pair->get(ACCESSOR_GETTER), isolate) &&
         current_pair->get(ACCESSOR_GETTER) != *getter) {
       overwriting_accessor = true;
     }
-    if (!setter->IsNull(isolate) &&
-        !current_pair->get(ACCESSOR_SETTER).IsNull(isolate) &&
+    if (!IsNull(*setter, isolate) &&
+        !IsNull(current_pair->get(ACCESSOR_SETTER), isolate) &&
         current_pair->get(ACCESSOR_SETTER) != *setter) {
       overwriting_accessor = true;
     }
@@ -2026,7 +2054,7 @@ Handle<Map> Map::CopyAddDescriptor(Isolate* isolate, Handle<Map> map,
 
   // Share descriptors only if map owns descriptors and it not an initial map.
   if (flag == INSERT_TRANSITION && map->owns_descriptors() &&
-      !map->GetBackPointer().IsUndefined(isolate) &&
+      !IsUndefined(map->GetBackPointer(), isolate) &&
       TransitionsAccessor::CanHaveMoreTransitions(isolate, map)) {
     return ShareDescriptor(isolate, map, descriptors, descriptor);
   }
@@ -2087,16 +2115,16 @@ int Map::Hash() {
   // For performance reasons we only hash the 2 most variable fields of a map:
   // prototype and bit_field2.
 
-  HeapObject prototype = this->prototype();
+  Tagged<HeapObject> prototype = this->prototype();
   int prototype_hash;
 
-  if (prototype.IsNull()) {
+  if (IsNull(prototype)) {
     // No identity hash for null, so just pick a random number.
     prototype_hash = 1;
   } else {
-    JSReceiver receiver = JSReceiver::cast(prototype);
+    Tagged<JSReceiver> receiver = JSReceiver::cast(prototype);
     Isolate* isolate = GetIsolateFromWritableObject(receiver);
-    prototype_hash = receiver.GetOrCreateIdentityHash(isolate).value();
+    prototype_hash = receiver->GetOrCreateIdentityHash(isolate).value();
   }
 
   return prototype_hash ^ bit_field2();
@@ -2104,72 +2132,72 @@ int Map::Hash() {
 
 namespace {
 
-bool CheckEquivalent(const Map first, const Map second) {
-  return first.GetConstructor() == second.GetConstructor() &&
-         first.prototype() == second.prototype() &&
-         first.instance_type() == second.instance_type() &&
-         first.bit_field() == second.bit_field() &&
-         first.is_extensible() == second.is_extensible() &&
-         first.new_target_is_base() == second.new_target_is_base();
+bool CheckEquivalent(const Tagged<Map> first, const Tagged<Map> second) {
+  return first->GetConstructorRaw() == second->GetConstructorRaw() &&
+         first->prototype() == second->prototype() &&
+         first->instance_type() == second->instance_type() &&
+         first->bit_field() == second->bit_field() &&
+         first->is_extensible() == second->is_extensible() &&
+         first->new_target_is_base() == second->new_target_is_base();
 }
 
 }  // namespace
 
-bool Map::EquivalentToForTransition(const Map other,
+bool Map::EquivalentToForTransition(const Tagged<Map> other,
                                     ConcurrencyMode cmode) const {
-  CHECK_EQ(GetConstructor(), other.GetConstructor());
-  CHECK_EQ(instance_type(), other.instance_type());
+  CHECK_EQ(GetConstructor(), other->GetConstructor());
+  CHECK_EQ(instance_type(), other->instance_type());
 
-  if (bit_field() != other.bit_field()) return false;
-  if (new_target_is_base() != other.new_target_is_base()) return false;
-  if (prototype() != other.prototype()) return false;
+  if (bit_field() != other->bit_field()) return false;
+  if (new_target_is_base() != other->new_target_is_base()) return false;
+  if (prototype() != other->prototype()) return false;
   if (InstanceTypeChecker::IsJSFunction(instance_type())) {
     // JSFunctions require more checks to ensure that sloppy function is
     // not equivalent to strict function.
     int nof =
-        std::min(NumberOfOwnDescriptors(), other.NumberOfOwnDescriptors());
-    DescriptorArray this_descriptors = IsConcurrent(cmode)
-                                           ? instance_descriptors(kAcquireLoad)
-                                           : instance_descriptors();
-    DescriptorArray that_descriptors =
-        IsConcurrent(cmode) ? other.instance_descriptors(kAcquireLoad)
-                            : other.instance_descriptors();
-    return this_descriptors.IsEqualUpTo(that_descriptors, nof);
+        std::min(NumberOfOwnDescriptors(), other->NumberOfOwnDescriptors());
+    Tagged<DescriptorArray> this_descriptors =
+        IsConcurrent(cmode) ? instance_descriptors(kAcquireLoad)
+                            : instance_descriptors();
+    Tagged<DescriptorArray> that_descriptors =
+        IsConcurrent(cmode) ? other->instance_descriptors(kAcquireLoad)
+                            : other->instance_descriptors();
+    return this_descriptors->IsEqualUpTo(that_descriptors, nof);
   }
   return true;
 }
 
-bool Map::EquivalentToForElementsKindTransition(const Map other,
+bool Map::EquivalentToForElementsKindTransition(const Tagged<Map> other,
                                                 ConcurrencyMode cmode) const {
   if (!EquivalentToForTransition(other, cmode)) return false;
 #ifdef DEBUG
   // Ensure that we don't try to generate elements kind transitions from maps
   // with fields that may be generalized in-place. This must already be handled
   // during addition of a new field.
-  DescriptorArray descriptors = IsConcurrent(cmode)
-                                    ? instance_descriptors(kAcquireLoad)
-                                    : instance_descriptors();
+  Tagged<DescriptorArray> descriptors = IsConcurrent(cmode)
+                                            ? instance_descriptors(kAcquireLoad)
+                                            : instance_descriptors();
   for (InternalIndex i : IterateOwnDescriptors()) {
-    PropertyDetails details = descriptors.GetDetails(i);
+    PropertyDetails details = descriptors->GetDetails(i);
     if (details.location() == PropertyLocation::kField) {
       DCHECK(IsMostGeneralFieldType(details.representation(),
-                                    descriptors.GetFieldType(i)));
+                                    descriptors->GetFieldType(i)));
     }
   }
 #endif
   return true;
 }
 
-bool Map::EquivalentToForNormalization(const Map other,
+bool Map::EquivalentToForNormalization(const Tagged<Map> other,
                                        ElementsKind elements_kind,
                                        PropertyNormalizationMode mode) const {
   int properties =
-      mode == CLEAR_INOBJECT_PROPERTIES ? 0 : other.GetInObjectProperties();
+      mode == CLEAR_INOBJECT_PROPERTIES ? 0 : other->GetInObjectProperties();
   // Make sure the elements_kind bits are in bit_field2.
   DCHECK_EQ(this->elements_kind(),
             Map::Bits2::ElementsKindBits::decode(bit_field2()));
   int adjusted_other_bit_field2 =
-      Map::Bits2::ElementsKindBits::update(other.bit_field2(), elements_kind);
+      Map::Bits2::ElementsKindBits::update(other->bit_field2(), elements_kind);
   return CheckEquivalent(*this, other) &&
          bit_field2() == adjusted_other_bit_field2 &&
          GetInObjectProperties() == properties &&
@@ -2179,18 +2207,19 @@ bool Map::EquivalentToForNormalization(const Map other,
 
 int Map::ComputeMinObjectSlack(Isolate* isolate) {
   // Has to be an initial map.
-  DCHECK(GetBackPointer().IsUndefined(isolate));
+  DCHECK(IsUndefined(GetBackPointer(), isolate));
 
   int slack = UnusedPropertyFields();
   TransitionsAccessor transitions(isolate, *this);
-  TransitionsAccessor::TraverseCallback callback = [&](Map map) {
-    slack = std::min(slack, map.UnusedPropertyFields());
+  TransitionsAccessor::TraverseCallback callback = [&](Tagged<Map> map) {
+    slack = std::min(slack, map->UnusedPropertyFields());
   };
   transitions.TraverseTransitionTree(callback);
   return slack;
 }
 
-void Map::SetInstanceDescriptors(Isolate* isolate, DescriptorArray descriptors,
+void Map::SetInstanceDescriptors(Isolate* isolate,
+                                 Tagged<DescriptorArray> descriptors,
                                  int number_of_own_descriptors) {
   set_instance_descriptors(descriptors, kReleaseStore);
   SetNumberOfOwnDescriptors(number_of_own_descriptors);
@@ -2202,15 +2231,15 @@ void Map::SetInstanceDescriptors(Isolate* isolate, DescriptorArray descriptors,
 // static
 Handle<PrototypeInfo> Map::GetOrCreatePrototypeInfo(Handle<JSObject> prototype,
                                                     Isolate* isolate) {
-  DCHECK(prototype->IsJSObjectThatCanBeTrackedAsPrototype());
+  DCHECK(IsJSObjectThatCanBeTrackedAsPrototype(*prototype));
   {
-    PrototypeInfo prototype_info;
-    if (prototype->map().TryGetPrototypeInfo(&prototype_info)) {
+    Tagged<PrototypeInfo> prototype_info;
+    if (prototype->map()->TryGetPrototypeInfo(&prototype_info)) {
       return handle(prototype_info, isolate);
     }
   }
   Handle<PrototypeInfo> proto_info = isolate->factory()->NewPrototypeInfo();
-  prototype->map().set_prototype_info(*proto_info, kReleaseStore);
+  prototype->map()->set_prototype_info(*proto_info, kReleaseStore);
   return proto_info;
 }
 
@@ -2218,7 +2247,7 @@ Handle<PrototypeInfo> Map::GetOrCreatePrototypeInfo(Handle<JSObject> prototype,
 Handle<PrototypeInfo> Map::GetOrCreatePrototypeInfo(Handle<Map> prototype_map,
                                                     Isolate* isolate) {
   {
-    Object maybe_proto_info = prototype_map->prototype_info();
+    Tagged<Object> maybe_proto_info = prototype_map->prototype_info();
     if (PrototypeInfo::IsPrototypeInfoFast(maybe_proto_info)) {
       return handle(PrototypeInfo::cast(maybe_proto_info), isolate);
     }
@@ -2243,16 +2272,16 @@ void Map::SetShouldBeFastPrototypeMap(Handle<Map> map, bool value,
 Handle<Object> Map::GetOrCreatePrototypeChainValidityCell(Handle<Map> map,
                                                           Isolate* isolate) {
   Handle<Object> maybe_prototype;
-  if (map->IsJSGlobalObjectMap()) {
+  if (IsJSGlobalObjectMap(*map)) {
     DCHECK(map->is_prototype_map());
     // Global object is prototype of a global proxy and therefore we can
     // use its validity cell for guarding global object's prototype change.
     maybe_prototype = isolate->global_object();
   } else {
     maybe_prototype =
-        handle(map->GetPrototypeChainRootMap(isolate).prototype(), isolate);
+        handle(map->GetPrototypeChainRootMap(isolate)->prototype(), isolate);
   }
-  if (!maybe_prototype->IsJSObjectThatCanBeTrackedAsPrototype()) {
+  if (!IsJSObjectThatCanBeTrackedAsPrototype(*maybe_prototype)) {
     return handle(Smi::FromInt(Map::kPrototypeChainValid), isolate);
   }
   Handle<JSObject> prototype = Handle<JSObject>::cast(maybe_prototype);
@@ -2261,28 +2290,29 @@ Handle<Object> Map::GetOrCreatePrototypeChainValidityCell(Handle<Map> map,
   JSObject::LazyRegisterPrototypeUser(handle(prototype->map(), isolate),
                                       isolate);
 
-  Object maybe_cell = prototype->map().prototype_validity_cell(kRelaxedLoad);
+  Tagged<Object> maybe_cell =
+      prototype->map()->prototype_validity_cell(kRelaxedLoad);
   // Return existing cell if it's still valid.
-  if (maybe_cell.IsCell()) {
-    Cell cell = Cell::cast(maybe_cell);
-    if (cell.value() == Smi::FromInt(Map::kPrototypeChainValid)) {
+  if (IsCell(maybe_cell)) {
+    Tagged<Cell> cell = Cell::cast(maybe_cell);
+    if (cell->value() == Smi::FromInt(Map::kPrototypeChainValid)) {
       return handle(cell, isolate);
     }
   }
   // Otherwise create a new cell.
   Handle<Cell> cell =
       isolate->factory()->NewCell(Smi::FromInt(Map::kPrototypeChainValid));
-  prototype->map().set_prototype_validity_cell(*cell, kRelaxedStore);
+  prototype->map()->set_prototype_validity_cell(*cell, kRelaxedStore);
   return cell;
 }
 
 // static
-bool Map::IsPrototypeChainInvalidated(Map map) {
-  DCHECK(map.is_prototype_map());
-  Object maybe_cell = map.prototype_validity_cell(kRelaxedLoad);
-  if (maybe_cell.IsCell()) {
-    Cell cell = Cell::cast(maybe_cell);
-    return cell.value() != Smi::FromInt(Map::kPrototypeChainValid);
+bool Map::IsPrototypeChainInvalidated(Tagged<Map> map) {
+  DCHECK(map->is_prototype_map());
+  Tagged<Object> maybe_cell = map->prototype_validity_cell(kRelaxedLoad);
+  if (IsCell(maybe_cell)) {
+    Tagged<Cell> cell = Cell::cast(maybe_cell);
+    return cell->value() != Smi::FromInt(Map::kPrototypeChainValid);
   }
   return true;
 }
@@ -2293,34 +2323,52 @@ void Map::SetPrototype(Isolate* isolate, Handle<Map> map,
                        bool enable_prototype_setup_mode) {
   RCS_SCOPE(isolate, RuntimeCallCounterId::kMap_SetPrototype);
 
-  if (prototype->IsJSObjectThatCanBeTrackedAsPrototype()) {
+  if (IsJSObjectThatCanBeTrackedAsPrototype(*prototype)) {
     Handle<JSObject> prototype_jsobj = Handle<JSObject>::cast(prototype);
     JSObject::OptimizeAsPrototype(prototype_jsobj, enable_prototype_setup_mode);
   } else {
-    DCHECK(prototype->IsNull(isolate) || prototype->IsJSProxy() ||
-           prototype->IsWasmObject() || prototype->InWritableSharedSpace());
+    DCHECK(IsNull(*prototype, isolate) || IsJSProxy(*prototype) ||
+           IsWasmObject(*prototype) || prototype->InWritableSharedSpace());
   }
 
   WriteBarrierMode wb_mode =
-      prototype->IsNull(isolate) ? SKIP_WRITE_BARRIER : UPDATE_WRITE_BARRIER;
+      IsNull(*prototype, isolate) ? SKIP_WRITE_BARRIER : UPDATE_WRITE_BARRIER;
   map->set_prototype(*prototype, wb_mode);
 }
 
 void Map::StartInobjectSlackTracking() {
-  DCHECK(!IsInobjectSlackTrackingInProgress());
+  DCHECK(!this->IsInobjectSlackTrackingInProgress());
   if (UnusedPropertyFields() == 0) return;
   set_construction_counter(Map::kSlackTrackingCounterStart);
 }
 
 Handle<Map> Map::TransitionToPrototype(Isolate* isolate, Handle<Map> map,
                                        Handle<HeapObject> prototype) {
-  Handle<Map> new_map =
-      TransitionsAccessor::GetPrototypeTransition(isolate, map, prototype);
+  Handle<Map> new_map = TransitionsAccessor::GetPrototypeTransition(
+      isolate, map, prototype, map->new_target_is_base());
   if (new_map.is_null()) {
     new_map = Copy(isolate, map, "TransitionToPrototype");
     TransitionsAccessor::PutPrototypeTransition(isolate, map, prototype,
                                                 new_map);
-    Map::SetPrototype(isolate, new_map, prototype);
+    if (*prototype != map->prototype()) {
+      Map::SetPrototype(isolate, new_map, prototype);
+    }
+  }
+  return new_map;
+}
+
+Handle<Map> Map::TransitionToDerivedMap(Isolate* isolate, Handle<Map> map,
+                                        Handle<HeapObject> prototype) {
+  Handle<Map> new_map = TransitionsAccessor::GetPrototypeTransition(
+      isolate, map, prototype, /* new_target_is_base */ false);
+  if (new_map.is_null()) {
+    new_map = CopyInitialMap(isolate, map);
+    TransitionsAccessor::PutPrototypeTransition(isolate, map, prototype,
+                                                new_map);
+    if (*prototype != map->prototype()) {
+      Map::SetPrototype(isolate, new_map, prototype);
+    }
+    new_map->set_new_target_is_base(false);
   }
   return new_map;
 }
@@ -2336,14 +2384,14 @@ MaybeHandle<Map> NormalizedMapCache::Get(Handle<Map> fast_map,
                                          PropertyNormalizationMode mode) {
   DisallowGarbageCollection no_gc;
   MaybeObject value = WeakFixedArray::Get(GetIndex(fast_map));
-  HeapObject heap_object;
-  if (!value->GetHeapObjectIfWeak(&heap_object)) {
+  Tagged<HeapObject> heap_object;
+  if (!value.GetHeapObjectIfWeak(&heap_object)) {
     return MaybeHandle<Map>();
   }
 
-  Map normalized_map = Map::cast(heap_object);
-  if (!normalized_map.EquivalentToForNormalization(*fast_map, elements_kind,
-                                                   mode)) {
+  Tagged<Map> normalized_map = Map::cast(heap_object);
+  if (!normalized_map->EquivalentToForNormalization(*fast_map, elements_kind,
+                                                    mode)) {
     return MaybeHandle<Map>();
   }
   return handle(normalized_map, GetIsolate());
diff --git a/deps/v8/src/objects/map.h b/deps/v8/src/objects/map.h
index d9d15c3f5f8e8b..2853bdc738fefd 100644
--- a/deps/v8/src/objects/map.h
+++ b/deps/v8/src/objects/map.h
@@ -9,9 +9,11 @@
 #include "src/common/globals.h"
 #include "src/objects/code.h"
 #include "src/objects/heap-object.h"
+#include "src/objects/instance-type-checker.h"
 #include "src/objects/internal-index.h"
 #include "src/objects/objects.h"
 #include "src/objects/prototype-info.h"
+#include "src/roots/roots.h"
 #include "torque-generated/bit-fields.h"
 #include "torque-generated/visitor-lists.h"
 
@@ -38,6 +40,7 @@ enum InstanceType : uint16_t;
   V(AccessorInfo)                       \
   V(AllocationSite)                     \
   V(BytecodeArray)                      \
+  V(ExternalPointerArray)               \
   V(CallHandlerInfo)                    \
   V(Cell)                               \
   V(InstructionStream)                  \
@@ -63,6 +66,7 @@ enum InstanceType : uint16_t;
   V(Map)                                \
   V(NativeContext)                      \
   V(Oddball)                            \
+  V(Hole)                               \
   V(PreparseData)                       \
   V(PromiseOnStack)                     \
   V(PropertyArray)                      \
@@ -181,7 +185,7 @@ using MapHandles = std::vector<Handle<Map>>;
 // |               |   - is_unstable (bit 25)                        |
 // |               |   - is_migration_target (bit 26)                |
 // |               |   - is_extensible (bit 28)                      |
-// |               |   - may_have_interesting_symbols (bit 28)       |
+// |               |   - may_have_interesting_properties (bit 28)    |
 // |               |   - construction_counter (bit 29..31)           |
 // |               |                                                 |
 // +*****************************************************************+
@@ -231,11 +235,11 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   inline int GetConstructorFunctionIndex() const;
   inline void SetConstructorFunctionIndex(int value);
   static base::Optional<JSFunction> GetConstructorFunction(
-      Map map, Context native_context);
+      Tagged<Map> map, Tagged<Context> native_context);
 
   // Retrieve interceptors.
-  DECL_GETTER(GetNamedInterceptor, InterceptorInfo)
-  DECL_GETTER(GetIndexedInterceptor, InterceptorInfo)
+  DECL_GETTER(GetNamedInterceptor, Tagged<InterceptorInfo>)
+  DECL_GETTER(GetIndexedInterceptor, Tagged<InterceptorInfo>)
 
   // Instance type.
   DECL_PRIMITIVE_ACCESSORS(instance_type, InstanceType)
@@ -256,8 +260,8 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   inline void SetInObjectUnusedPropertyFields(int unused_property_fields);
   // Updates the counters tracking unused fields in the property array.
   inline void SetOutOfObjectUnusedPropertyFields(int unused_property_fields);
-  inline void CopyUnusedPropertyFields(Map map);
-  inline void CopyUnusedPropertyFieldsAdjustedForInstanceSize(Map map);
+  inline void CopyUnusedPropertyFields(Tagged<Map> map);
+  inline void CopyUnusedPropertyFieldsAdjustedForInstanceSize(Tagged<Map> map);
   inline void AccountAddedPropertyField();
   inline void AccountAddedOutOfObjectPropertyField(
       int unused_in_property_array);
@@ -269,10 +273,10 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   // on, or performs the write non-atomically if it's off. The read is always
   // non-atomically. This is done to have wider TSAN coverage on the cases where
   // it's possible.
-  DECL_PRIMITIVE_ACCESSORS(bit_field, byte)
+  DECL_PRIMITIVE_ACCESSORS(bit_field, uint8_t)
 
   // Atomic accessors, used for allowlisting legitimate concurrent accesses.
-  DECL_PRIMITIVE_ACCESSORS(relaxed_bit_field, byte)
+  DECL_PRIMITIVE_ACCESSORS(relaxed_bit_field, uint8_t)
 
   // Bit positions for |bit_field|.
   struct Bits1 {
@@ -282,7 +286,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   //
   // Bit field 2.
   //
-  DECL_PRIMITIVE_ACCESSORS(bit_field2, byte)
+  DECL_PRIMITIVE_ACCESSORS(bit_field2, uint8_t)
 
   // Bit positions for |bit_field2|.
   struct Bits2 {
@@ -383,9 +387,9 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
 
   // Tells whether the instance with this map may have properties for
   // interesting symbols on it.
-  // An "interesting symbol" is one for which Name::IsInterestingSymbol()
+  // An "interesting symbol" is one for which Name::IsInteresting()
   // returns true, i.e. a well-known symbol like @@toStringTag.
-  DECL_BOOLEAN_ACCESSORS(may_have_interesting_symbols)
+  DECL_BOOLEAN_ACCESSORS(may_have_interesting_properties)
 
   DECL_BOOLEAN_ACCESSORS(has_prototype_slot)
 
@@ -412,7 +416,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   DECL_BOOLEAN_ACCESSORS(is_prototype_map)
   inline bool is_abandoned_prototype_map() const;
   inline bool has_prototype_info() const;
-  inline bool TryGetPrototypeInfo(PrototypeInfo* result) const;
+  inline bool TryGetPrototypeInfo(Tagged<PrototypeInfo>* result) const;
 
   // Whether the instance has been added to the retained map list by
   // Heap::AddRetainedMap.
@@ -428,6 +432,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   inline bool has_fast_smi_or_object_elements() const;
   inline bool has_fast_double_elements() const;
   inline bool has_fast_elements() const;
+  inline bool has_fast_packed_elements() const;
   inline bool has_sloppy_arguments_elements() const;
   inline bool has_fast_sloppy_arguments_elements() const;
   inline bool has_fast_string_wrapper_elements() const;
@@ -451,9 +456,10 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   // elements or an object with any frozen elements, or a slow arguments object.
   bool MayHaveReadOnlyElementsInPrototypeChain(Isolate* isolate);
 
-  inline Map ElementsTransitionMap(Isolate* isolate, ConcurrencyMode cmode);
+  inline Tagged<Map> ElementsTransitionMap(Isolate* isolate,
+                                           ConcurrencyMode cmode);
 
-  inline FixedArrayBase GetInitialElements() const;
+  inline Tagged<FixedArrayBase> GetInitialElements() const;
 
   // [raw_transitions]: Provides access to the transitions storage field.
   // Don't call set_raw_transitions() directly to overwrite transitions, use
@@ -462,8 +468,8 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   DECL_RELEASE_ACQUIRE_WEAK_ACCESSORS(raw_transitions)
   // [prototype_info]: Per-prototype metadata. Aliased with transitions
   // (which prototype maps don't have).
-  DECL_GETTER(prototype_info, Object)
-  DECL_RELEASE_ACQUIRE_ACCESSORS(prototype_info, Object)
+  DECL_GETTER(prototype_info, Tagged<Object>)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(prototype_info, Tagged<Object>)
   // PrototypeInfo is created lazily using this helper (which installs it on
   // the given prototype's map).
   static Handle<PrototypeInfo> GetOrCreatePrototypeInfo(
@@ -485,14 +491,14 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   static const int kPrototypeChainValid = 0;
   static const int kPrototypeChainInvalid = 1;
 
-  static bool IsPrototypeChainInvalidated(Map map);
+  static bool IsPrototypeChainInvalidated(Tagged<Map> map);
 
   // Return the map of the root of object's prototype chain.
-  Map GetPrototypeChainRootMap(Isolate* isolate) const;
+  Tagged<Map> GetPrototypeChainRootMap(Isolate* isolate) const;
 
-  V8_EXPORT_PRIVATE Map FindRootMap(Isolate* isolate) const;
-  V8_EXPORT_PRIVATE Map FindFieldOwner(Isolate* isolate,
-                                       InternalIndex descriptor) const;
+  V8_EXPORT_PRIVATE Tagged<Map> FindRootMap(PtrComprCageBase cage_base) const;
+  V8_EXPORT_PRIVATE Tagged<Map> FindFieldOwner(PtrComprCageBase cage_base,
+                                               InternalIndex descriptor) const;
 
   inline int GetInObjectPropertyOffset(int index) const;
 
@@ -515,16 +521,17 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   int NumberOfFields(ConcurrencyMode cmode) const;
 
   // TODO(ishell): candidate with JSObject::MigrateToMap().
-  bool InstancesNeedRewriting(Map target, ConcurrencyMode cmode) const;
-  bool InstancesNeedRewriting(Map target, int target_number_of_fields,
+  bool InstancesNeedRewriting(Tagged<Map> target, ConcurrencyMode cmode) const;
+  bool InstancesNeedRewriting(Tagged<Map> target, int target_number_of_fields,
                               int target_inobject, int target_unused,
                               int* old_number_of_fields,
                               ConcurrencyMode cmode) const;
   // Returns true if the |field_type| is the most general one for
   // given |representation|.
   static inline bool IsMostGeneralFieldType(Representation representation,
-                                            FieldType field_type);
-  static inline bool FieldTypeIsCleared(Representation rep, FieldType type);
+                                            Tagged<FieldType> field_type);
+  static inline bool FieldTypeIsCleared(Representation rep,
+                                        Tagged<FieldType> type);
 
   // Generalizes representation and field_type if objects with given
   // instance type can have fast elements that can be transitioned by
@@ -568,7 +575,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   DECL_BOOLEAN_ACCESSORS(is_access_check_needed)
 
   // [prototype]: implicit prototype object.
-  DECL_ACCESSORS(prototype, HeapObject)
+  DECL_ACCESSORS(prototype, Tagged<HeapObject>)
   // TODO(jkummerow): make set_prototype private.
   V8_EXPORT_PRIVATE static void SetPrototype(
       Isolate* isolate, Handle<Map> map, Handle<HeapObject> prototype,
@@ -588,40 +595,57 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   // FunctionTemplateInfo available.
   // The field also overlaps with the native context pointer for context maps,
   // and with the Wasm type info for WebAssembly object maps.
-  DECL_ACCESSORS(constructor_or_back_pointer, Object)
-  DECL_RELAXED_ACCESSORS(constructor_or_back_pointer, Object)
-  DECL_ACCESSORS(native_context, NativeContext)
-  DECL_ACCESSORS(native_context_or_null, Object)
-  DECL_ACCESSORS(wasm_type_info, WasmTypeInfo)
-  DECL_GETTER(GetConstructor, Object)
-  DECL_GETTER(GetFunctionTemplateInfo, FunctionTemplateInfo)
-  inline void SetConstructor(Object constructor,
+  DECL_ACCESSORS(constructor_or_back_pointer, Tagged<Object>)
+  DECL_RELAXED_ACCESSORS(constructor_or_back_pointer, Tagged<Object>)
+  DECL_ACCESSORS(native_context, Tagged<NativeContext>)
+  DECL_ACCESSORS(native_context_or_null, Tagged<Object>)
+  DECL_ACCESSORS(wasm_type_info, Tagged<WasmTypeInfo>)
+
+  // Gets |constructor_or_back_pointer| field value from the root map.
+  // The result might be null, JSFunction, FunctionTemplateInfo or a Tuple2
+  // for JSFunctions with non-instance prototypes.
+  DECL_GETTER(GetConstructorRaw, Tagged<Object>)
+
+  // Gets constructor value from the root map. Unwraps Tuple2 in case of
+  // JSFunction map with non-instance prototype.
+  // The result returned might be null, JSFunction or FunctionTemplateInfo.
+  DECL_GETTER(GetConstructor, Tagged<Object>)
+  DECL_GETTER(GetFunctionTemplateInfo, Tagged<FunctionTemplateInfo>)
+  inline void SetConstructor(Tagged<Object> constructor,
                              WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
   // Constructor getter that performs at most the given number of steps
   // in the transition tree. Returns either the constructor or the map at
   // which the walk has stopped.
-  inline Object TryGetConstructor(Isolate* isolate, int max_steps);
+  inline Tagged<Object> TryGetConstructor(Isolate* isolate, int max_steps);
+
+  // Gets non-instance prototype value which is stored in Tuple2 in a
+  // root map's |constructor_or_back_pointer| field.
+  DECL_GETTER(GetNonInstancePrototype, Tagged<Object>)
+
   // [back pointer]: points back to the parent map from which a transition
   // leads to this map. The field overlaps with the constructor (see above).
-  DECL_GETTER(GetBackPointer, HeapObject)
-  inline void SetBackPointer(HeapObject value,
+  DECL_GETTER(GetBackPointer, Tagged<HeapObject>)
+  inline void SetBackPointer(Tagged<HeapObject> value,
                              WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
+  inline bool TryGetBackPointer(PtrComprCageBase cage_base,
+                                Tagged<Map>* back_pointer) const;
 
   // [instance descriptors]: describes the object.
-  DECL_ACCESSORS(instance_descriptors, DescriptorArray)
-  DECL_RELAXED_ACCESSORS(instance_descriptors, DescriptorArray)
-  DECL_ACQUIRE_GETTER(instance_descriptors, DescriptorArray)
-  V8_EXPORT_PRIVATE void SetInstanceDescriptors(Isolate* isolate,
-                                                DescriptorArray descriptors,
-                                                int number_of_own_descriptors);
-
-  inline void UpdateDescriptors(Isolate* isolate, DescriptorArray descriptors,
+  DECL_ACCESSORS(instance_descriptors, Tagged<DescriptorArray>)
+  DECL_RELAXED_ACCESSORS(instance_descriptors, Tagged<DescriptorArray>)
+  DECL_ACQUIRE_GETTER(instance_descriptors, Tagged<DescriptorArray>)
+  V8_EXPORT_PRIVATE void SetInstanceDescriptors(
+      Isolate* isolate, Tagged<DescriptorArray> descriptors,
+      int number_of_own_descriptors);
+
+  inline void UpdateDescriptors(Isolate* isolate,
+                                Tagged<DescriptorArray> descriptors,
                                 int number_of_own_descriptors);
   inline void InitializeDescriptors(Isolate* isolate,
-                                    DescriptorArray descriptors);
+                                    Tagged<DescriptorArray> descriptors);
 
   // [dependent code]: list of optimized codes that weakly embed this map.
-  DECL_ACCESSORS(dependent_code, DependentCode)
+  DECL_ACCESSORS(dependent_code, Tagged<DependentCode>)
 
   // [prototype_validity_cell]: Cell containing the validity bit for prototype
   // chains or Smi(0) if uninitialized.
@@ -635,13 +659,13 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   // For non-prototype maps which are used as transitioning store handlers this
   // field contains the validity cell which guards modifications of this map's
   // prototype.
-  DECL_RELAXED_ACCESSORS(prototype_validity_cell, Object)
+  DECL_RELAXED_ACCESSORS(prototype_validity_cell, Tagged<Object>)
 
   // Returns true if prototype validity cell value represents "valid" prototype
   // chain state.
   inline bool IsPrototypeValidityCellValid() const;
 
-  inline Name GetLastDescriptorName(Isolate* isolate) const;
+  inline Tagged<Name> GetLastDescriptorName(Isolate* isolate) const;
   inline PropertyDetails GetLastDescriptorDetails(Isolate* isolate) const;
 
   inline InternalIndex LastAdded() const;
@@ -650,7 +674,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   inline void SetNumberOfOwnDescriptors(int number);
   inline InternalIndex::Range IterateOwnDescriptors() const;
 
-  inline Cell RetrieveDescriptorsPointer();
+  inline Tagged<Cell> RetrieveDescriptorsPointer();
 
   // Checks whether all properties are stored either in the map or on the object
   // (inobject, properties, or elements backing store), requiring no special
@@ -708,7 +732,8 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
 
   static MaybeObjectHandle WrapFieldType(Isolate* isolate,
                                          Handle<FieldType> type);
-  V8_EXPORT_PRIVATE static FieldType UnwrapFieldType(MaybeObject wrapped_type);
+  V8_EXPORT_PRIVATE static Tagged<FieldType> UnwrapFieldType(
+      MaybeObject wrapped_type);
 
   V8_EXPORT_PRIVATE V8_WARN_UNUSED_RESULT static MaybeHandle<Map> CopyWithField(
       Isolate* isolate, Handle<Map> map, Handle<Name> name,
@@ -796,7 +821,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   // Returns the transitioned map for this map with the most generic
   // elements_kind that's found in |candidates|, or |nullptr| if no match is
   // found at all.
-  V8_EXPORT_PRIVATE Map FindElementsKindTransitionedMap(
+  V8_EXPORT_PRIVATE Tagged<Map> FindElementsKindTransitionedMap(
       Isolate* isolate, MapHandles const& candidates, ConcurrencyMode cmode);
 
   inline bool CanTransition() const;
@@ -815,16 +840,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
     }
     return {};
   }
-  static inline Map GetMapFor(ReadOnlyRoots roots, InstanceType type);
-
-#define DECL_TESTER(Type, ...) inline bool Is##Type##Map() const;
-  INSTANCE_TYPE_CHECKERS(DECL_TESTER)
-#undef DECL_TESTER
-  inline bool IsBooleanMap() const;
-  inline bool IsNullOrUndefinedMap() const;
-  inline bool IsPrimitiveMap() const;
-  inline bool IsSpecialReceiverMap() const;
-  inline bool IsCustomElementsReceiverMap() const;
+  static inline Tagged<Map> GetMapFor(ReadOnlyRoots roots, InstanceType type);
 
   bool IsMapInArrayPrototypeChain(Isolate* isolate) const;
 
@@ -838,7 +854,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
 
   DECL_PRIMITIVE_ACCESSORS(visitor_id, VisitorId)
 
-  static ObjectFields ObjectFieldsFrom(VisitorId visitor_id) {
+  static constexpr ObjectFields ObjectFieldsFrom(VisitorId visitor_id) {
     return (visitor_id < kDataOnlyVisitorIdCount)
                ? ObjectFields::kDataOnly
                : ObjectFields::kMaybePointers;
@@ -847,6 +863,9 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   V8_EXPORT_PRIVATE static Handle<Map> TransitionToPrototype(
       Isolate* isolate, Handle<Map> map, Handle<HeapObject> prototype);
 
+  V8_EXPORT_PRIVATE static Handle<Map> TransitionToDerivedMap(
+      Isolate* isolate, Handle<Map> map, Handle<HeapObject> prototype);
+
   static Handle<Map> TransitionToImmutableProto(Isolate* isolate,
                                                 Handle<Map> map);
 
@@ -861,10 +880,11 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   // If |mode| is set to CLEAR_INOBJECT_PROPERTIES, |other| is treated as if
   // it had exactly zero inobject properties.
   // The "shared" flags of both this map and |other| are ignored.
-  bool EquivalentToForNormalization(const Map other, ElementsKind elements_kind,
+  bool EquivalentToForNormalization(const Tagged<Map> other,
+                                    ElementsKind elements_kind,
                                     PropertyNormalizationMode mode) const;
   inline bool EquivalentToForNormalization(
-      const Map other, PropertyNormalizationMode mode) const;
+      const Tagged<Map> other, PropertyNormalizationMode mode) const;
 
   void PrintMapDetails(std::ostream& os);
 
@@ -877,7 +897,7 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
   // the descriptor array.
   inline void NotifyLeafMapLayoutChange(Isolate* isolate);
 
-  V8_EXPORT_PRIVATE static VisitorId GetVisitorId(Map map);
+  V8_EXPORT_PRIVATE static VisitorId GetVisitorId(Tagged<Map> map);
 
   // Returns true if objects with given instance type are allowed to have
   // fast transitionable elements kinds. This predicate is used to ensure
@@ -911,23 +931,25 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
 
   // Returns the map that this (root) map transitions to if its elements_kind
   // is changed to |elements_kind|, or |nullptr| if no such map is cached yet.
-  Map LookupElementsTransitionMap(Isolate* isolate, ElementsKind elements_kind,
-                                  ConcurrencyMode cmode);
+  Tagged<Map> LookupElementsTransitionMap(Isolate* isolate,
+                                          ElementsKind elements_kind,
+                                          ConcurrencyMode cmode);
 
   // Tries to replay property transitions starting from this (root) map using
   // the descriptor array of the |map|. The |root_map| is expected to have
   // proper elements kind and therefore elements kinds transitions are not
   // taken by this function. Returns |nullptr| if matching transition map is
   // not found.
-  Map TryReplayPropertyTransitions(Isolate* isolate, Map map,
-                                   ConcurrencyMode cmode);
+  Tagged<Map> TryReplayPropertyTransitions(Isolate* isolate, Tagged<Map> map,
+                                           ConcurrencyMode cmode);
 
   static void ConnectTransition(Isolate* isolate, Handle<Map> parent,
                                 Handle<Map> child, Handle<Name> name,
                                 SimpleTransitionFlag flag);
 
-  bool EquivalentToForTransition(const Map other, ConcurrencyMode cmode) const;
-  bool EquivalentToForElementsKindTransition(const Map other,
+  bool EquivalentToForTransition(const Tagged<Map> other,
+                                 ConcurrencyMode cmode) const;
+  bool EquivalentToForElementsKindTransition(const Tagged<Map> other,
                                              ConcurrencyMode cmode) const;
   static Handle<Map> RawCopy(Isolate* isolate, Handle<Map> map,
                              int instance_size, int inobject_properties);
@@ -960,7 +982,8 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
 
   void DeprecateTransitionTree(Isolate* isolate);
 
-  void ReplaceDescriptors(Isolate* isolate, DescriptorArray new_descriptors);
+  void ReplaceDescriptors(Isolate* isolate,
+                          Tagged<DescriptorArray> new_descriptors);
 
   // This is the equivalent of IsMap() but avoids reading the instance type so
   // it can be used concurrently without acquire load.
@@ -968,17 +991,17 @@ class Map : public TorqueGeneratedMap<Map, HeapObject> {
                                  const Object& object) const;
 
   // Use the high-level instance_descriptors/SetInstanceDescriptors instead.
-  DECL_RELEASE_SETTER(instance_descriptors, DescriptorArray)
+  DECL_RELEASE_SETTER(instance_descriptors, Tagged<DescriptorArray>)
 
   // Hide inherited accessors from the generated superclass.
-  DECL_ACCESSORS(constructor_or_back_pointer_or_native_context, Object)
-  DECL_ACCESSORS(transitions_or_prototype_info, Object)
+  DECL_ACCESSORS(constructor_or_back_pointer_or_native_context, Tagged<Object>)
+  DECL_ACCESSORS(transitions_or_prototype_info, Tagged<Object>)
 
   static const int kFastPropertiesSoftLimit = 12;
   static const int kMaxFastProperties = 128;
 
   friend class MapUpdater;
-  template <typename ConcreteVisitor, typename MarkingState>
+  template <typename ConcreteVisitor>
   friend class MarkingVisitorBase;
 
   TQ_OBJECT_CONSTRUCTORS(Map)
@@ -1001,20 +1024,29 @@ class NormalizedMapCache : public WeakFixedArray {
   DECL_VERIFIER(NormalizedMapCache)
 
  private:
-  friend bool HeapObject::IsNormalizedMapCache(
-      PtrComprCageBase cage_base) const;
+  friend bool IsNormalizedMapCache(Tagged<HeapObject> obj,
+                                   PtrComprCageBase cage_base);
 
   static const int kEntries = 64;
 
   static inline int GetIndex(Handle<Map> map);
 
   // The following declarations hide base class methods.
-  Object get(int index);
-  void set(int index, Object value);
+  Tagged<Object> get(int index);
+  void set(int index, Tagged<Object> value);
 
   OBJECT_CONSTRUCTORS(NormalizedMapCache, WeakFixedArray);
 };
 
+#define DECL_TESTER(Type, ...) inline bool Is##Type##Map(Tagged<Map> map);
+INSTANCE_TYPE_CHECKERS(DECL_TESTER)
+#undef DECL_TESTER
+inline bool IsBooleanMap(Tagged<Map> map);
+inline bool IsNullOrUndefinedMap(Tagged<Map> map);
+inline bool IsPrimitiveMap(Tagged<Map> map);
+inline bool IsSpecialReceiverMap(Tagged<Map> map);
+inline bool IsCustomElementsReceiverMap(Tagged<Map> map);
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/map.tq b/deps/v8/src/objects/map.tq
index a8b367ff82321a..590fac8d969fa6 100644
--- a/deps/v8/src/objects/map.tq
+++ b/deps/v8/src/objects/map.tq
@@ -30,7 +30,7 @@ bitfield struct MapBitFields3 extends uint32 {
   is_unstable: bool: 1 bit;
   is_migration_target: bool: 1 bit;
   is_extensible: bool: 1 bit;
-  may_have_interesting_symbols: bool: 1 bit;
+  may_have_interesting_properties: bool: 1 bit;
   construction_counter: int32: 3 bit;
 }
 
diff --git a/deps/v8/src/objects/maybe-object-inl.h b/deps/v8/src/objects/maybe-object-inl.h
index 2e3616a6ebfd68..6acb5daae56e39 100644
--- a/deps/v8/src/objects/maybe-object-inl.h
+++ b/deps/v8/src/objects/maybe-object-inl.h
@@ -18,13 +18,13 @@ namespace internal {
 //
 
 // static
-MaybeObject MaybeObject::FromSmi(Smi smi) {
+MaybeObject MaybeObject::FromSmi(Tagged<Smi> smi) {
   DCHECK(HAS_SMI_TAG(smi.ptr()));
   return MaybeObject(smi.ptr());
 }
 
 // static
-MaybeObject MaybeObject::FromObject(Object object) {
+MaybeObject MaybeObject::FromObject(Tagged<Object> object) {
   DCHECK(!HAS_WEAK_HEAP_OBJECT_TAG(object.ptr()));
   return MaybeObject(object.ptr());
 }
@@ -38,34 +38,34 @@ MaybeObject MaybeObject::MakeWeak(MaybeObject object) {
 MaybeObject MaybeObject::Create(MaybeObject o) { return o; }
 
 // static
-MaybeObject MaybeObject::Create(Object o) { return FromObject(o); }
+MaybeObject MaybeObject::Create(Tagged<Object> o) { return FromObject(o); }
 
 // static
-MaybeObject MaybeObject::Create(Smi smi) { return FromSmi(smi); }
+MaybeObject MaybeObject::Create(Tagged<Smi> smi) { return FromSmi(smi); }
 
 //
 // HeapObjectReference implementation.
 //
 
-HeapObjectReference::HeapObjectReference(Object object)
+HeapObjectReference::HeapObjectReference(Tagged<Object> object)
     : MaybeObject(object.ptr()) {}
 
 // static
-HeapObjectReference HeapObjectReference::Strong(Object object) {
+HeapObjectReference HeapObjectReference::Strong(Tagged<Object> object) {
   DCHECK(!object.IsSmi());
   DCHECK(!HasWeakHeapObjectTag(object));
   return HeapObjectReference(object);
 }
 
 // static
-HeapObjectReference HeapObjectReference::Weak(Object object) {
+HeapObjectReference HeapObjectReference::Weak(Tagged<Object> object) {
   DCHECK(!object.IsSmi());
   DCHECK(!HasWeakHeapObjectTag(object));
   return HeapObjectReference(object.ptr() | kWeakHeapObjectMask);
 }
 
 // static
-HeapObjectReference HeapObjectReference::From(Object object,
+HeapObjectReference HeapObjectReference::From(Tagged<Object> object,
                                               HeapObjectReferenceType type) {
   DCHECK(!object.IsSmi());
   DCHECK(!HasWeakHeapObjectTag(object));
@@ -95,7 +95,8 @@ HeapObjectReference HeapObjectReference::ClearedValue(
 }
 
 template <typename THeapObjectSlot>
-void HeapObjectReference::Update(THeapObjectSlot slot, HeapObject value) {
+void HeapObjectReference::Update(THeapObjectSlot slot,
+                                 Tagged<HeapObject> value) {
   static_assert(std::is_same<THeapObjectSlot, FullHeapObjectSlot>::value ||
                     std::is_same<THeapObjectSlot, HeapObjectSlot>::value,
                 "Only FullHeapObjectSlot and HeapObjectSlot are expected here");
diff --git a/deps/v8/src/objects/maybe-object.h b/deps/v8/src/objects/maybe-object.h
index 1005693ae1d8bc..3266abb790f70b 100644
--- a/deps/v8/src/objects/maybe-object.h
+++ b/deps/v8/src/objects/maybe-object.h
@@ -21,15 +21,15 @@ class MaybeObject : public TaggedImpl<HeapObjectReferenceType::WEAK, Address> {
   // These operator->() overloads are required for handlified code.
   constexpr const MaybeObject* operator->() const { return this; }
 
-  V8_INLINE static MaybeObject FromSmi(Smi smi);
+  V8_INLINE static MaybeObject FromSmi(Tagged<Smi> smi);
 
-  V8_INLINE static MaybeObject FromObject(Object object);
+  V8_INLINE static MaybeObject FromObject(Tagged<Object> object);
 
   V8_INLINE static MaybeObject MakeWeak(MaybeObject object);
 
   V8_INLINE static MaybeObject Create(MaybeObject o);
-  V8_INLINE static MaybeObject Create(Object o);
-  V8_INLINE static MaybeObject Create(Smi smi);
+  V8_INLINE static MaybeObject Create(Tagged<Object> o);
+  V8_INLINE static MaybeObject Create(Tagged<Smi> smi);
 
 #ifdef VERIFY_HEAP
   static void VerifyMaybeObjectPointer(Isolate* isolate, MaybeObject p);
@@ -45,19 +45,19 @@ class MaybeObject : public TaggedImpl<HeapObjectReferenceType::WEAK, Address> {
 class HeapObjectReference : public MaybeObject {
  public:
   explicit HeapObjectReference(Address address) : MaybeObject(address) {}
-  V8_INLINE explicit HeapObjectReference(Object object);
+  V8_INLINE explicit HeapObjectReference(Tagged<Object> object);
 
-  V8_INLINE static HeapObjectReference Strong(Object object);
+  V8_INLINE static HeapObjectReference Strong(Tagged<Object> object);
 
-  V8_INLINE static HeapObjectReference Weak(Object object);
+  V8_INLINE static HeapObjectReference Weak(Tagged<Object> object);
 
-  V8_INLINE static HeapObjectReference From(Object object,
+  V8_INLINE static HeapObjectReference From(Tagged<Object> object,
                                             HeapObjectReferenceType type);
 
   V8_INLINE static HeapObjectReference ClearedValue(PtrComprCageBase cage_base);
 
   template <typename THeapObjectSlot>
-  V8_INLINE static void Update(THeapObjectSlot slot, HeapObject value);
+  V8_INLINE static void Update(THeapObjectSlot slot, Tagged<HeapObject> value);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/microtask.tq b/deps/v8/src/objects/microtask.tq
index 1e7f1525c4011b..2fbbf6b4934031 100644
--- a/deps/v8/src/objects/microtask.tq
+++ b/deps/v8/src/objects/microtask.tq
@@ -3,8 +3,7 @@
 // found in the LICENSE file.
 
 @abstract
-extern class Microtask extends Struct {
-}
+extern class Microtask extends Struct {}
 
 extern class CallbackTask extends Microtask {
   callback: Foreign;
diff --git a/deps/v8/src/objects/module-inl.h b/deps/v8/src/objects/module-inl.h
index fee2c07f186a0a..347ccdc33a8380 100644
--- a/deps/v8/src/objects/module-inl.h
+++ b/deps/v8/src/objects/module-inl.h
@@ -32,49 +32,49 @@ NEVER_READ_ONLY_SPACE_IMPL(SyntheticModule)
 BOOL_ACCESSORS(SourceTextModule, flags, async, AsyncBit::kShift)
 BIT_FIELD_ACCESSORS(SourceTextModule, flags, async_evaluating_ordinal,
                     SourceTextModule::AsyncEvaluatingOrdinalBits)
-ACCESSORS(SourceTextModule, async_parent_modules, ArrayList,
+ACCESSORS(SourceTextModule, async_parent_modules, Tagged<ArrayList>,
           kAsyncParentModulesOffset)
 
 struct Module::Hash {
   V8_INLINE size_t operator()(Module const& module) const {
-    return module.hash();
+    return module->hash();
   }
 };
 
-SourceTextModuleInfo SourceTextModule::info() const {
-  return GetSharedFunctionInfo().scope_info().ModuleDescriptorInfo();
+Tagged<SourceTextModuleInfo> SourceTextModule::info() const {
+  return GetSharedFunctionInfo()->scope_info()->ModuleDescriptorInfo();
 }
 
 OBJECT_CONSTRUCTORS_IMPL(SourceTextModuleInfo, FixedArray)
 CAST_ACCESSOR(SourceTextModuleInfo)
 
-FixedArray SourceTextModuleInfo::module_requests() const {
+Tagged<FixedArray> SourceTextModuleInfo::module_requests() const {
   return FixedArray::cast(get(kModuleRequestsIndex));
 }
 
-FixedArray SourceTextModuleInfo::special_exports() const {
+Tagged<FixedArray> SourceTextModuleInfo::special_exports() const {
   return FixedArray::cast(get(kSpecialExportsIndex));
 }
 
-FixedArray SourceTextModuleInfo::regular_exports() const {
+Tagged<FixedArray> SourceTextModuleInfo::regular_exports() const {
   return FixedArray::cast(get(kRegularExportsIndex));
 }
 
-FixedArray SourceTextModuleInfo::regular_imports() const {
+Tagged<FixedArray> SourceTextModuleInfo::regular_imports() const {
   return FixedArray::cast(get(kRegularImportsIndex));
 }
 
-FixedArray SourceTextModuleInfo::namespace_imports() const {
+Tagged<FixedArray> SourceTextModuleInfo::namespace_imports() const {
   return FixedArray::cast(get(kNamespaceImportsIndex));
 }
 
 #ifdef DEBUG
-bool SourceTextModuleInfo::Equals(SourceTextModuleInfo other) const {
-  return regular_exports() == other.regular_exports() &&
-         regular_imports() == other.regular_imports() &&
-         special_exports() == other.special_exports() &&
-         namespace_imports() == other.namespace_imports() &&
-         module_requests() == other.module_requests();
+bool SourceTextModuleInfo::Equals(Tagged<SourceTextModuleInfo> other) const {
+  return regular_exports() == other->regular_exports() &&
+         regular_imports() == other->regular_imports() &&
+         special_exports() == other->special_exports() &&
+         namespace_imports() == other->namespace_imports() &&
+         module_requests() == other->module_requests();
 }
 #endif
 
@@ -105,7 +105,7 @@ class UnorderedModuleSet
 Handle<SourceTextModule> SourceTextModule::GetCycleRoot(
     Isolate* isolate) const {
   CHECK_GE(status(), kEvaluated);
-  DCHECK(!cycle_root().IsTheHole(isolate));
+  DCHECK(!IsTheHole(cycle_root(), isolate));
   Handle<SourceTextModule> root(SourceTextModule::cast(cycle_root()), isolate);
   return root;
 }
@@ -123,12 +123,12 @@ void SourceTextModule::AddAsyncParentModule(Isolate* isolate,
 Handle<SourceTextModule> SourceTextModule::GetAsyncParentModule(
     Isolate* isolate, int index) {
   Handle<SourceTextModule> module(
-      SourceTextModule::cast(async_parent_modules().Get(index)), isolate);
+      SourceTextModule::cast(async_parent_modules()->Get(index)), isolate);
   return module;
 }
 
 int SourceTextModule::AsyncParentModuleCount() {
-  return async_parent_modules().Length();
+  return async_parent_modules()->Length();
 }
 
 bool SourceTextModule::IsAsyncEvaluating() const {
diff --git a/deps/v8/src/objects/module.cc b/deps/v8/src/objects/module.cc
index fccb1c238db19a..d4b170e2f63ff3 100644
--- a/deps/v8/src/objects/module.cc
+++ b/deps/v8/src/objects/module.cc
@@ -27,26 +27,27 @@ namespace internal {
 
 namespace {
 #ifdef DEBUG
-void PrintModuleName(Module module, std::ostream& os) {
-  if (module.IsSourceTextModule()) {
-    SourceTextModule::cast(module).GetScript().GetNameOrSourceURL().Print(os);
+void PrintModuleName(Tagged<Module> module, std::ostream& os) {
+  if (IsSourceTextModule(module)) {
+    Print(SourceTextModule::cast(module)->GetScript()->GetNameOrSourceURL(),
+          os);
   } else {
-    SyntheticModule::cast(module).name().Print(os);
+    Print(SyntheticModule::cast(module)->name(), os);
   }
 #ifndef OBJECT_PRINT
   os << "\n";
 #endif  // OBJECT_PRINT
 }
 
-void PrintStatusTransition(Module module, Module::Status old_status) {
+void PrintStatusTransition(Tagged<Module> module, Module::Status old_status) {
   if (!v8_flags.trace_module_status) return;
   StdoutStream os;
   os << "Changing module status from " << old_status << " to "
-     << module.status() << " for ";
+     << module->status() << " for ";
   PrintModuleName(module, os);
 }
 
-void PrintStatusMessage(Module module, const char* message) {
+void PrintStatusMessage(Tagged<Module> module, const char* message) {
   if (!v8_flags.trace_module_status) return;
   StdoutStream os;
   os << "Instantiating module ";
@@ -54,14 +55,14 @@ void PrintStatusMessage(Module module, const char* message) {
 }
 #endif  // DEBUG
 
-void SetStatusInternal(Module module, Module::Status new_status) {
+void SetStatusInternal(Tagged<Module> module, Module::Status new_status) {
   DisallowGarbageCollection no_gc;
 #ifdef DEBUG
-  Module::Status old_status = static_cast<Module::Status>(module.status());
-  module.set_status(new_status);
+  Module::Status old_status = static_cast<Module::Status>(module->status());
+  module->set_status(new_status);
   PrintStatusTransition(module, old_status);
 #else
-  module.set_status(new_status);
+  module->set_status(new_status);
 #endif  // DEBUG
 }
 
@@ -74,17 +75,17 @@ void Module::SetStatus(Status new_status) {
   SetStatusInternal(*this, new_status);
 }
 
-void Module::RecordError(Isolate* isolate, Object error) {
+void Module::RecordError(Isolate* isolate, Tagged<Object> error) {
   DisallowGarbageCollection no_gc;
   // Allow overriding exceptions with termination exceptions.
   DCHECK_IMPLIES(isolate->is_catchable_by_javascript(error),
-                 exception().IsTheHole(isolate));
-  DCHECK(!error.IsTheHole(isolate));
-  if (IsSourceTextModule()) {
+                 IsTheHole(exception(), isolate));
+  DCHECK(!IsTheHole(error, isolate));
+  if (IsSourceTextModule(*this)) {
     // Revert to minmal SFI in case we have already been instantiating or
     // evaluating.
     auto self = SourceTextModule::cast(*this);
-    self.set_code(self.GetSharedFunctionInfo());
+    self->set_code(self->GetSharedFunctionInfo());
   }
   SetStatusInternal(*this, Module::kErrored);
   if (isolate->is_catchable_by_javascript(error)) {
@@ -102,40 +103,40 @@ void Module::ResetGraph(Isolate* isolate, Handle<Module> module) {
   }
 
   Handle<FixedArray> requested_modules =
-      module->IsSourceTextModule()
+      IsSourceTextModule(*module)
           ? Handle<FixedArray>(
-                SourceTextModule::cast(*module).requested_modules(), isolate)
+                SourceTextModule::cast(*module)->requested_modules(), isolate)
           : Handle<FixedArray>();
   Reset(isolate, module);
 
-  if (!module->IsSourceTextModule()) {
-    DCHECK(module->IsSyntheticModule());
+  if (!IsSourceTextModule(*module)) {
+    DCHECK(IsSyntheticModule(*module));
     return;
   }
   for (int i = 0; i < requested_modules->length(); ++i) {
     Handle<Object> descendant(requested_modules->get(i), isolate);
-    if (descendant->IsModule()) {
+    if (IsModule(*descendant)) {
       ResetGraph(isolate, Handle<Module>::cast(descendant));
     } else {
-      DCHECK(descendant->IsUndefined(isolate));
+      DCHECK(IsUndefined(*descendant, isolate));
     }
   }
 }
 
 void Module::Reset(Isolate* isolate, Handle<Module> module) {
   DCHECK(module->status() == kPreLinking || module->status() == kLinking);
-  DCHECK(module->exception().IsTheHole(isolate));
+  DCHECK(IsTheHole(module->exception(), isolate));
   // The namespace object cannot exist, because it would have been created
   // by RunInitializationCode, which is called only after this module's SCC
   // succeeds instantiation.
-  DCHECK(!module->module_namespace().IsJSModuleNamespace());
+  DCHECK(!IsJSModuleNamespace(module->module_namespace()));
   const int export_count =
-      module->IsSourceTextModule()
-          ? SourceTextModule::cast(*module).regular_exports().length()
-          : SyntheticModule::cast(*module).export_names().length();
+      IsSourceTextModule(*module)
+          ? SourceTextModule::cast(*module)->regular_exports()->length()
+          : SyntheticModule::cast(*module)->export_names()->length();
   Handle<ObjectHashTable> exports = ObjectHashTable::New(isolate, export_count);
 
-  if (module->IsSourceTextModule()) {
+  if (IsSourceTextModule(*module)) {
     SourceTextModule::Reset(isolate, Handle<SourceTextModule>::cast(module));
   }
 
@@ -143,10 +144,10 @@ void Module::Reset(Isolate* isolate, Handle<Module> module) {
   SetStatusInternal(*module, kUnlinked);
 }
 
-Object Module::GetException() {
+Tagged<Object> Module::GetException() {
   DisallowGarbageCollection no_gc;
   DCHECK_EQ(status(), Module::kErrored);
-  DCHECK(!exception().IsTheHole());
+  DCHECK(!IsTheHole(exception()));
   return exception();
 }
 
@@ -158,7 +159,7 @@ MaybeHandle<Cell> Module::ResolveExport(Isolate* isolate, Handle<Module> module,
   DCHECK_GE(module->status(), kPreLinking);
   DCHECK_NE(module->status(), kEvaluating);
 
-  if (module->IsSourceTextModule()) {
+  if (IsSourceTextModule(*module)) {
     return SourceTextModule::ResolveExport(
         isolate, Handle<SourceTextModule>::cast(module), module_specifier,
         export_name, loc, must_resolve, resolve_set);
@@ -207,7 +208,7 @@ bool Module::PrepareInstantiate(
   module->SetStatus(kPreLinking);
   STACK_CHECK(isolate, false);
 
-  if (module->IsSourceTextModule()) {
+  if (IsSourceTextModule(*module)) {
     return SourceTextModule::PrepareInstantiate(
         isolate, Handle<SourceTextModule>::cast(module), context, callback,
         callback_without_import_assertions);
@@ -225,7 +226,7 @@ bool Module::FinishInstantiate(Isolate* isolate, Handle<Module> module,
   DCHECK_EQ(module->status(), kPreLinking);
   STACK_CHECK(isolate, false);
 
-  if (module->IsSourceTextModule()) {
+  if (IsSourceTextModule(*module)) {
     return SourceTextModule::FinishInstantiate(
         isolate, Handle<SourceTextModule>::cast(module), stack, dfs_index,
         zone);
@@ -246,7 +247,7 @@ MaybeHandle<Object> Module::Evaluate(Isolate* isolate, Handle<Module> module) {
     // If we have a top level capability we assume it has already been
     // rejected, and return it here. Otherwise create a new promise and
     // reject it with the module's exception.
-    if (module->top_level_capability().IsJSPromise()) {
+    if (IsJSPromise(module->top_level_capability())) {
       Handle<JSPromise> top_level_capability(
           JSPromise::cast(module->top_level_capability()), isolate);
       DCHECK(top_level_capability->status() == Promise::kRejected &&
@@ -265,18 +266,18 @@ MaybeHandle<Object> Module::Evaluate(Isolate* isolate, Handle<Module> module) {
   // 3. If module.[[Status]] is "evaluated", set module to
   //    module.[[CycleRoot]].
   // A Synthetic Module has no children so it is its own cycle root.
-  if (module_status == kEvaluated && module->IsSourceTextModule()) {
+  if (module_status == kEvaluated && IsSourceTextModule(*module)) {
     module = Handle<SourceTextModule>::cast(module)->GetCycleRoot(isolate);
   }
 
   // 4. If module.[[TopLevelCapability]] is not undefined, then
   //    a. Return module.[[TopLevelCapability]].[[Promise]].
-  if (module->top_level_capability().IsJSPromise()) {
+  if (IsJSPromise(module->top_level_capability())) {
     return handle(JSPromise::cast(module->top_level_capability()), isolate);
   }
-  DCHECK(module->top_level_capability().IsUndefined());
+  DCHECK(IsUndefined(module->top_level_capability()));
 
-  if (module->IsSourceTextModule()) {
+  if (IsSourceTextModule(*module)) {
     return SourceTextModule::Evaluate(isolate,
                                       Handle<SourceTextModule>::cast(module));
   } else {
@@ -289,7 +290,7 @@ Handle<JSModuleNamespace> Module::GetModuleNamespace(Isolate* isolate,
                                                      Handle<Module> module) {
   Handle<HeapObject> object(module->module_namespace(), isolate);
   ReadOnlyRoots roots(isolate);
-  if (!object->IsUndefined(roots)) {
+  if (!IsUndefined(*object, roots)) {
     // Namespace object already exists.
     return Handle<JSModuleNamespace>::cast(object);
   }
@@ -298,7 +299,7 @@ Handle<JSModuleNamespace> Module::GetModuleNamespace(Isolate* isolate,
   Zone zone(isolate->allocator(), ZONE_NAME);
   UnorderedModuleSet visited(&zone);
 
-  if (module->IsSourceTextModule()) {
+  if (IsSourceTextModule(*module)) {
     SourceTextModule::FetchStarExports(
         isolate, Handle<SourceTextModule>::cast(module), &zone, &visited);
   }
@@ -307,7 +308,7 @@ Handle<JSModuleNamespace> Module::GetModuleNamespace(Isolate* isolate,
   ZoneVector<Handle<String>> names(&zone);
   names.reserve(exports->NumberOfElements());
   for (InternalIndex i : exports->IterateEntries()) {
-    Object key;
+    Tagged<Object> key;
     if (!exports->ToKey(roots, i, &key)) continue;
     names.push_back(handle(String::cast(key), isolate));
   }
@@ -361,19 +362,19 @@ Handle<JSModuleNamespace> Module::GetModuleNamespace(Isolate* isolate,
 }
 
 bool JSModuleNamespace::HasExport(Isolate* isolate, Handle<String> name) {
-  Handle<Object> object(module().exports().Lookup(name), isolate);
-  return !object->IsTheHole(isolate);
+  Handle<Object> object(module()->exports()->Lookup(name), isolate);
+  return !IsTheHole(*object, isolate);
 }
 
 MaybeHandle<Object> JSModuleNamespace::GetExport(Isolate* isolate,
                                                  Handle<String> name) {
-  Handle<Object> object(module().exports().Lookup(name), isolate);
-  if (object->IsTheHole(isolate)) {
+  Handle<Object> object(module()->exports()->Lookup(name), isolate);
+  if (IsTheHole(*object, isolate)) {
     return isolate->factory()->undefined_value();
   }
 
-  Handle<Object> value(Cell::cast(*object).value(), isolate);
-  if (value->IsTheHole(isolate)) {
+  Handle<Object> value(Cell::cast(*object)->value(), isolate);
+  if (IsTheHole(*value, isolate)) {
     // According to https://tc39.es/ecma262/#sec-InnerModuleLinking
     // step 10 and
     // https://tc39.es/ecma262/#sec-source-text-module-record-initialize-environment
@@ -397,11 +398,11 @@ Maybe<PropertyAttributes> JSModuleNamespace::GetPropertyAttributes(
 
   Isolate* isolate = it->isolate();
 
-  Handle<Object> lookup(object->module().exports().Lookup(name), isolate);
-  if (lookup->IsTheHole(isolate)) return Just(ABSENT);
+  Handle<Object> lookup(object->module()->exports()->Lookup(name), isolate);
+  if (IsTheHole(*lookup, isolate)) return Just(ABSENT);
 
   Handle<Object> value(Handle<Cell>::cast(lookup)->value(), isolate);
-  if (value->IsTheHole(isolate)) {
+  if (IsTheHole(*value, isolate)) {
     isolate->Throw(*isolate->factory()->NewReferenceError(
         MessageTemplate::kNotDefined, name));
     return Nothing<PropertyAttributes>();
@@ -417,7 +418,7 @@ Maybe<bool> JSModuleNamespace::DefineOwnProperty(
     Isolate* isolate, Handle<JSModuleNamespace> object, Handle<Object> key,
     PropertyDescriptor* desc, Maybe<ShouldThrow> should_throw) {
   // 1. If Type(P) is Symbol, return OrdinaryDefineOwnProperty(O, P, Desc).
-  if (key->IsSymbol()) {
+  if (IsSymbol(*key)) {
     return OrdinaryDefineOwnProperty(isolate, object, key, desc, should_throw);
   }
 
@@ -440,7 +441,8 @@ Maybe<bool> JSModuleNamespace::DefineOwnProperty(
       (desc->has_enumerable() && !desc->enumerable()) ||
       PropertyDescriptor::IsAccessorDescriptor(desc) ||
       (desc->has_writable() && !desc->writable()) ||
-      (desc->has_value() && !desc->value()->SameValue(*current.value()))) {
+      (desc->has_value() &&
+       !Object::SameValue(*desc->value(), *current.value()))) {
     RETURN_FAILURE(isolate, GetShouldThrow(isolate, should_throw),
                    NewTypeError(MessageTemplate::kRedefineDisallowed, key));
   }
@@ -452,8 +454,8 @@ bool Module::IsGraphAsync(Isolate* isolate) const {
   DisallowGarbageCollection no_gc;
 
   // Only SourceTextModules may be async.
-  if (!IsSourceTextModule()) return false;
-  SourceTextModule root = SourceTextModule::cast(*this);
+  if (!IsSourceTextModule(*this)) return false;
+  Tagged<SourceTextModule> root = SourceTextModule::cast(*this);
 
   Zone zone(isolate->allocator(), ZONE_NAME);
   const size_t bucket_count = 2;
@@ -463,15 +465,15 @@ bool Module::IsGraphAsync(Isolate* isolate) const {
   worklist.push_back(root);
 
   do {
-    SourceTextModule current = worklist.back();
+    Tagged<SourceTextModule> current = worklist.back();
     worklist.pop_back();
-    DCHECK_GE(current.status(), kLinked);
+    DCHECK_GE(current->status(), kLinked);
 
-    if (current.async()) return true;
-    FixedArray requested_modules = current.requested_modules();
-    for (int i = 0, length = requested_modules.length(); i < length; ++i) {
-      Module descendant = Module::cast(requested_modules.get(i));
-      if (descendant.IsSourceTextModule()) {
+    if (current->async()) return true;
+    Tagged<FixedArray> requested_modules = current->requested_modules();
+    for (int i = 0, length = requested_modules->length(); i < length; ++i) {
+      Tagged<Module> descendant = Module::cast(requested_modules->get(i));
+      if (IsSourceTextModule(descendant)) {
         const bool cycle = !visited.insert(descendant).second;
         if (!cycle) worklist.push_back(SourceTextModule::cast(descendant));
       }
diff --git a/deps/v8/src/objects/module.h b/deps/v8/src/objects/module.h
index b09474d50bcac4..4c47c9d0ae88df 100644
--- a/deps/v8/src/objects/module.h
+++ b/deps/v8/src/objects/module.h
@@ -17,14 +17,10 @@
 namespace v8 {
 namespace internal {
 
-template <typename T>
-class Handle;
-class Isolate;
 class JSModuleNamespace;
 class SourceTextModuleDescriptor;
 class SourceTextModuleInfo;
 class SourceTextModuleInfoEntry;
-class String;
 class Zone;
 
 #include "torque-generated/src/objects/module-tq.inc"
@@ -51,7 +47,7 @@ class Module : public TorqueGeneratedModule<Module, HeapObject> {
   };
 
   // The exception in the case {status} is kErrored.
-  Object GetException();
+  Tagged<Object> GetException();
 
   // Returns if this module or any transitively requested module is [[Async]],
   // i.e. has a top-level await.
@@ -123,7 +119,7 @@ class Module : public TorqueGeneratedModule<Module, HeapObject> {
 
   // To set status to kErrored, RecordError should be used.
   void SetStatus(Status status);
-  void RecordError(Isolate* isolate, Object error);
+  void RecordError(Isolate* isolate, Tagged<Object> error);
 
   TQ_OBJECT_CONSTRUCTORS(Module)
 };
diff --git a/deps/v8/src/objects/name-inl.h b/deps/v8/src/objects/name-inl.h
index ee3585eb6a031d..a9d92a5ebda399 100644
--- a/deps/v8/src/objects/name-inl.h
+++ b/deps/v8/src/objects/name-inl.h
@@ -7,6 +7,7 @@
 
 #include "src/base/logging.h"
 #include "src/heap/heap-write-barrier-inl.h"
+#include "src/objects/instance-type-inl.h"
 #include "src/objects/map-inl.h"
 #include "src/objects/name.h"
 #include "src/objects/primitive-heap-object-inl.h"
@@ -57,28 +58,28 @@ void Symbol::set_is_private_name() {
   set_flags(Symbol::IsPrivateNameBit::update(flags(), true));
 }
 
-DEF_GETTER(Name, IsUniqueName, bool) {
-  uint32_t type = map(cage_base).instance_type();
+DEF_HEAP_OBJECT_PREDICATE(Name, IsUniqueName) {
+  uint32_t type = obj->map(cage_base)->instance_type();
   bool result = (type & (kIsNotStringMask | kIsNotInternalizedMask)) !=
                 (kStringTag | kNotInternalizedTag);
-  SLOW_DCHECK(result == HeapObject::IsUniqueName());
-  DCHECK_IMPLIES(result, HasHashCode());
+  SLOW_DCHECK(result == IsUniqueName(Tagged<HeapObject>::cast(obj)));
+  DCHECK_IMPLIES(result, obj->HasHashCode());
   return result;
 }
 
-bool Name::Equals(Name other) {
+bool Name::Equals(Tagged<Name> other) {
   if (other == *this) return true;
-  if ((this->IsInternalizedString() && other.IsInternalizedString()) ||
-      this->IsSymbol() || other.IsSymbol()) {
+  if ((IsInternalizedString(*this) && IsInternalizedString(other)) ||
+      IsSymbol(*this) || IsSymbol(other)) {
     return false;
   }
-  return String::cast(*this).SlowEquals(String::cast(other));
+  return String::cast(*this)->SlowEquals(String::cast(other));
 }
 
 bool Name::Equals(Isolate* isolate, Handle<Name> one, Handle<Name> two) {
   if (one.is_identical_to(two)) return true;
-  if ((one->IsInternalizedString() && two->IsInternalizedString()) ||
-      one->IsSymbol() || two->IsSymbol()) {
+  if ((IsInternalizedString(*one) && IsInternalizedString(*two)) ||
+      IsSymbol(*one) || IsSymbol(*two)) {
     return false;
   }
   return String::SlowEquals(isolate, Handle<String>::cast(one),
@@ -174,7 +175,7 @@ uint32_t Name::EnsureRawHash() {
     return GetRawHashFromForwardingTable(field);
   }
   // Slow case: compute hash code and set it. Has to be a string.
-  return String::cast(*this).ComputeAndSetRawHash();
+  return String::cast(*this)->ComputeAndSetRawHash();
 }
 
 uint32_t Name::EnsureRawHash(
@@ -187,7 +188,7 @@ uint32_t Name::EnsureRawHash(
     return GetRawHashFromForwardingTable(field);
   }
   // Slow case: compute hash code and set it. Has to be a string.
-  return String::cast(*this).ComputeAndSetRawHash(access_guard);
+  return String::cast(*this)->ComputeAndSetRawHash(access_guard);
 }
 
 uint32_t Name::RawHash() {
@@ -215,7 +216,7 @@ void Name::set_raw_hash_field_if_empty(uint32_t hash) {
   // In all cases we don't want overwrite the old value, so we don't handle the
   // failure case.
   DCHECK_IMPLIES(result != kEmptyHashField,
-                 (String::cast(*this).IsShared() ||
+                 (String::cast(*this)->IsShared() ||
                   v8_flags.always_use_string_forwarding_table) &&
                      (result == hash || IsForwardingIndex(hash)));
 }
@@ -242,34 +243,38 @@ bool Name::TryGetHash(uint32_t* hash) const {
   return false;
 }
 
-DEF_GETTER(Name, IsInterestingSymbol, bool) {
-  return IsSymbol(cage_base) && Symbol::cast(*this).is_interesting_symbol();
+bool Name::IsInteresting(Isolate* isolate) {
+  // TODO(ishell): consider using ReadOnlyRoots::IsNameForProtector() trick for
+  // these strings and interesting symbols.
+  return (IsSymbol(*this) && Symbol::cast(*this)->is_interesting_symbol()) ||
+         *this == *isolate->factory()->toJSON_string() ||
+         *this == *isolate->factory()->get_string();
 }
 
 DEF_GETTER(Name, IsPrivate, bool) {
-  return this->IsSymbol(cage_base) && Symbol::cast(*this).is_private();
+  return IsSymbol(*this, cage_base) && Symbol::cast(*this)->is_private();
 }
 
 DEF_GETTER(Name, IsPrivateName, bool) {
   bool is_private_name =
-      this->IsSymbol(cage_base) && Symbol::cast(*this).is_private_name();
+      IsSymbol(*this, cage_base) && Symbol::cast(*this)->is_private_name();
   DCHECK_IMPLIES(is_private_name, IsPrivate());
   return is_private_name;
 }
 
 DEF_GETTER(Name, IsPrivateBrand, bool) {
   bool is_private_brand =
-      this->IsSymbol(cage_base) && Symbol::cast(*this).is_private_brand();
+      IsSymbol(*this, cage_base) && Symbol::cast(*this)->is_private_brand();
   DCHECK_IMPLIES(is_private_brand, IsPrivateName());
   return is_private_brand;
 }
 
 bool Name::AsArrayIndex(uint32_t* index) {
-  return IsString() && String::cast(*this).AsArrayIndex(index);
+  return IsString(*this) && String::cast(*this)->AsArrayIndex(index);
 }
 
 bool Name::AsIntegerIndex(size_t* index) {
-  return IsString() && String::cast(*this).AsIntegerIndex(index);
+  return IsString(*this) && String::cast(*this)->AsIntegerIndex(index);
 }
 
 // static
diff --git a/deps/v8/src/objects/name.h b/deps/v8/src/objects/name.h
index c2816d04c20f85..6793f4976e779d 100644
--- a/deps/v8/src/objects/name.h
+++ b/deps/v8/src/objects/name.h
@@ -62,7 +62,7 @@ class Name : public TorqueGeneratedName<Name, PrimitiveHeapObject> {
   inline bool TryGetHash(uint32_t* hash) const;
 
   // Equality operations.
-  inline bool Equals(Name other);
+  inline bool Equals(Tagged<Name> other);
   inline static bool Equals(Isolate* isolate, Handle<Name> one,
                             Handle<Name> two);
 
@@ -70,12 +70,12 @@ class Name : public TorqueGeneratedName<Name, PrimitiveHeapObject> {
   inline bool AsArrayIndex(uint32_t* index);
   inline bool AsIntegerIndex(size_t* index);
 
-  // An "interesting symbol" is a well-known symbol, like @@toStringTag,
-  // that's often looked up on random objects but is usually not present.
-  // We optimize this by setting a flag on the object's map when such
+  // An "interesting" is a well-known symbol or string, like @@toStringTag,
+  // @@toJSON, that's often looked up on random objects but is usually not
+  // present. We optimize this by setting a flag on the object's map when such
   // symbol properties are added, so we can optimize lookups on objects
   // that don't have the flag.
-  DECL_GETTER(IsInterestingSymbol, bool)
+  inline bool IsInteresting(Isolate* isolate);
 
   // If the name is private, it can only name own properties.
   DECL_GETTER(IsPrivate, bool)
@@ -88,8 +88,6 @@ class Name : public TorqueGeneratedName<Name, PrimitiveHeapObject> {
   // symbol but is filtered out when generating list of private fields.
   DECL_GETTER(IsPrivateBrand, bool)
 
-  DECL_GETTER(IsUniqueName, bool)
-
   static inline bool ContainsCachedArrayIndex(uint32_t hash);
 
   // Return a string version of this name that is converted according to the
@@ -210,6 +208,9 @@ class Name : public TorqueGeneratedName<Name, PrimitiveHeapObject> {
   inline uint32_t GetRawHashFromForwardingTable(uint32_t raw_hash) const;
 };
 
+inline bool IsUniqueName(Tagged<Name> obj);
+inline bool IsUniqueName(Tagged<Name> obj, PtrComprCageBase cage_base);
+
 // ES6 symbols.
 class Symbol : public TorqueGeneratedSymbol<Symbol, Name> {
  public:
diff --git a/deps/v8/src/objects/object-list-macros.h b/deps/v8/src/objects/object-list-macros.h
index 23eb1adfc07439..50b20e339acfd7 100644
--- a/deps/v8/src/objects/object-list-macros.h
+++ b/deps/v8/src/objects/object-list-macros.h
@@ -15,6 +15,7 @@ class AccessorPair;
 class AccessCheckInfo;
 class AllocationSite;
 class ByteArray;
+class ExternalPointerArray;
 class Cell;
 class ClosureFeedbackCellArray;
 class ConsString;
@@ -87,6 +88,7 @@ class ZoneForwardList;
   V(Boolean)                                    \
   V(BooleanWrapper)                             \
   V(ByteArray)                                  \
+  V(ExternalPointerArray)                       \
   V(BytecodeArray)                              \
   V(CallHandlerInfo)                            \
   V(Callable)                                   \
@@ -156,6 +158,7 @@ class ZoneForwardList;
   V(JSIteratorMapHelper)                        \
   V(JSIteratorTakeHelper)                       \
   V(JSIteratorDropHelper)                       \
+  V(JSIteratorFlatMapHelper)                    \
   V(JSMap)                                      \
   V(JSMapIterator)                              \
   V(JSMessageObject)                            \
@@ -212,6 +215,7 @@ class ZoneForwardList;
   V(ObjectHashTable)                            \
   V(ObjectTwoHashTable)                         \
   V(Oddball)                                    \
+  V(Hole)                                       \
   V(OrderedHashMap)                             \
   V(OrderedHashSet)                             \
   V(OrderedNameDictionary)                      \
@@ -377,7 +381,6 @@ class ZoneForwardList;
 #define ODDBALL_LIST(V)                                     \
   V(Undefined, undefined_value, UndefinedValue)             \
   V(Null, null_value, NullValue)                            \
-  V(TheHole, the_hole_value, TheHoleValue)                  \
   V(Exception, exception, Exception)                        \
   V(Uninitialized, uninitialized_value, UninitializedValue) \
   V(True, true_value, TrueValue)                            \
@@ -386,6 +389,10 @@ class ZoneForwardList;
   V(OptimizedOut, optimized_out, OptimizedOut)              \
   V(StaleRegister, stale_register, StaleRegister)
 
+#define HOLE_LIST(V)                       \
+  V(TheHole, the_hole_value, TheHoleValue) \
+  V(PropertyCellHole, property_cell_hole_value, PropertyCellHoleValue)
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/object-macros-undef.h b/deps/v8/src/objects/object-macros-undef.h
index 8449f130e6927c..0613bde7de6154 100644
--- a/deps/v8/src/objects/object-macros-undef.h
+++ b/deps/v8/src/objects/object-macros-undef.h
@@ -79,6 +79,8 @@
 #undef BOOL_ACCESSORS
 #undef DECL_RELAXED_BOOL_ACCESSORS
 #undef RELAXED_BOOL_ACCESSORS
+#undef DECL_EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST
+#undef EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST
 #undef DECL_EXTERNAL_POINTER_ACCESSORS
 #undef EXTERNAL_POINTER_ACCESSORS
 #undef BIT_FIELD_ACCESSORS2
@@ -132,3 +134,4 @@
 #undef TQ_OBJECT_CONSTRUCTORS
 #undef TQ_OBJECT_CONSTRUCTORS_IMPL
 #undef TQ_CPP_OBJECT_DEFINITION_ASSERTS
+#undef DEF_HEAP_OBJECT_PREDICATE
diff --git a/deps/v8/src/objects/object-macros.h b/deps/v8/src/objects/object-macros.h
index 46eee497bce367..c7902b603d3e04 100644
--- a/deps/v8/src/objects/object-macros.h
+++ b/deps/v8/src/objects/object-macros.h
@@ -22,14 +22,25 @@
  public:                                                                       \
   constexpr Type() : __VA_ARGS__() {}                                          \
                                                                                \
+  /* For every object, add a `->` operator which returns a pointer to this     \
+     object. This will allow smoother transition between T and Tagged<T>. */   \
+  Type* operator->() { return this; }                                          \
+  const Type* operator->() const { return this; }                              \
+                                                                               \
  protected:                                                                    \
   template <typename TFieldType, int kFieldOffset, typename CompressionScheme> \
   friend class TaggedField;                                                    \
+  friend class Tagged<Type>;                                                   \
+                                                                               \
+  /* Special constructor for constexpr construction which allows skipping type \
+   * checks. */                                                                \
+  explicit constexpr inline Type(Address ptr, Object::SkipTypeCheckTag)        \
+      : __VA_ARGS__(ptr, Object::SkipTypeCheckTag()) {}                        \
                                                                                \
   explicit inline Type(Address ptr)
 
 #define OBJECT_CONSTRUCTORS_IMPL(Type, Super) \
-  inline Type::Type(Address ptr) : Super(ptr) { SLOW_DCHECK(Is##Type()); }
+  inline Type::Type(Address ptr) : Super(ptr) { SLOW_DCHECK(Is##Type(*this)); }
 
 #define NEVER_READ_ONLY_SPACE   \
   inline Heap* GetHeap() const; \
@@ -108,6 +119,13 @@
   }                                                          \
   type holder::name(PtrComprCageBase cage_base, AcquireLoadTag) const
 
+#define DEF_HEAP_OBJECT_PREDICATE(holder, name)            \
+  bool name(Tagged<holder> obj) {                          \
+    PtrComprCageBase cage_base = GetPtrComprCageBase(obj); \
+    return name(obj, cage_base);                           \
+  }                                                        \
+  bool name(Tagged<holder> obj, PtrComprCageBase cage_base)
+
 #define TQ_FIELD_TYPE(name, tq_type) \
   static constexpr const char* k##name##TqFieldType = tq_type;
 
@@ -155,14 +173,17 @@
   DECL_ACQUIRE_GETTER(name, MaybeObject)          \
   DECL_RELEASE_SETTER(name, MaybeObject)
 
-#define DECL_CAST(Type)                                 \
-  V8_INLINE static Type cast(Object object);            \
-  V8_INLINE static Type unchecked_cast(Object object) { \
-    return base::bit_cast<Type>(object);                \
+#define DECL_CAST(Type)                                      \
+  V8_INLINE static Tagged<Type> cast(Tagged<Object> object); \
+  V8_INLINE static constexpr Tagged<Type> unchecked_cast(    \
+      Tagged<Object> object) {                               \
+    return Tagged<Type>::unchecked_cast(object);             \
   }
 
-#define CAST_ACCESSOR(Type) \
-  Type Type::cast(Object object) { return Type(object.ptr()); }
+#define CAST_ACCESSOR(Type)                        \
+  Tagged<Type> Type::cast(Tagged<Object> object) { \
+    return Tagged<Type>(Type(object.ptr()));       \
+  }
 
 #define DEF_PRIMITIVE_ACCESSORS(holder, name, offset, type)     \
   type holder::name() const { return ReadField<type>(offset); } \
@@ -227,6 +248,9 @@
   inline type holder::name() const {                                  \
     return TorqueGeneratedClass::torque_name();                       \
   }                                                                   \
+  inline type holder::name(PtrComprCageBase cage_base) const {        \
+    return TorqueGeneratedClass::torque_name(cage_base);              \
+  }                                                                   \
   inline void holder::set_##name(type value, WriteBarrierMode mode) { \
     TorqueGeneratedClass::set_##torque_name(value, mode);             \
   }
@@ -417,23 +441,21 @@
                 kRelaxedStore);                                      \
   }
 
-#define DECL_EXTERNAL_POINTER_ACCESSORS(name, type)                       \
-  inline type name() const;                                               \
+// Host objects in ReadOnlySpace can't define the isolate-less accessor.
+#define DECL_EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(name, type)  \
   inline type name(i::Isolate* isolate_for_sandbox) const;                \
   inline void init_##name(i::Isolate* isolate, const type initial_value); \
   inline void set_##name(i::Isolate* isolate, const type value);
 
-#define EXTERNAL_POINTER_ACCESSORS(holder, name, type, offset, tag)         \
-  type holder::name() const {                                               \
-    i::Isolate* isolate_for_sandbox = GetIsolateForSandbox(*this);          \
-    return holder::name(isolate_for_sandbox);                               \
-  }                                                                         \
+// Host objects in ReadOnlySpace can't define the isolate-less accessor.
+#define EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(holder, name, type, \
+                                                        offset, tag)        \
   type holder::name(i::Isolate* isolate_for_sandbox) const {                \
     /* This is a workaround for MSVC error C2440 not allowing  */           \
     /* reinterpret casts to the same type. */                               \
     struct C2440 {};                                                        \
-    Address result =                                                        \
-        Object::ReadExternalPointerField<tag>(offset, isolate_for_sandbox); \
+    Address result = HeapObject::ReadExternalPointerField<tag>(             \
+        offset, isolate_for_sandbox);                                       \
     return reinterpret_cast<type>(reinterpret_cast<C2440*>(result));        \
   }                                                                         \
   void holder::init_##name(i::Isolate* isolate, const type initial_value) { \
@@ -442,7 +464,7 @@
     struct C2440 {};                                                        \
     Address the_value = reinterpret_cast<Address>(                          \
         reinterpret_cast<const C2440*>(initial_value));                     \
-    Object::InitExternalPointerField<tag>(offset, isolate, the_value);      \
+    HeapObject::InitExternalPointerField<tag>(offset, isolate, the_value);  \
   }                                                                         \
   void holder::set_##name(i::Isolate* isolate, const type value) {          \
     /* This is a workaround for MSVC error C2440 not allowing  */           \
@@ -450,9 +472,21 @@
     struct C2440 {};                                                        \
     Address the_value =                                                     \
         reinterpret_cast<Address>(reinterpret_cast<const C2440*>(value));   \
-    Object::WriteExternalPointerField<tag>(offset, isolate, the_value);     \
+    HeapObject::WriteExternalPointerField<tag>(offset, isolate, the_value); \
   }
 
+#define DECL_EXTERNAL_POINTER_ACCESSORS(name, type) \
+  inline type name() const;                         \
+  DECL_EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(name, type)
+
+#define EXTERNAL_POINTER_ACCESSORS(holder, name, type, offset, tag)           \
+  type holder::name() const {                                                 \
+    i::Isolate* isolate_for_sandbox = GetIsolateForSandbox(*this);            \
+    return holder::name(isolate_for_sandbox);                                 \
+  }                                                                           \
+  EXTERNAL_POINTER_ACCESSORS_MAYBE_READ_ONLY_HOST(holder, name, type, offset, \
+                                                  tag)
+
 #define BIT_FIELD_ACCESSORS2(holder, get_field, set_field, name, BitField) \
   typename BitField::FieldType holder::name() const {                      \
     return BitField::decode(get_field());                                  \
@@ -504,25 +538,30 @@
 #define SEQ_CST_SWAP_FIELD(p, offset, value) \
   TaggedField<Object>::SeqCst_Swap(p, offset, value)
 
+#define SEQ_CST_COMPARE_AND_SWAP_FIELD(p, offset, expected, value) \
+  TaggedField<Object>::SeqCst_CompareAndSwap(p, offset, expected, value)
+
 #ifdef V8_DISABLE_WRITE_BARRIERS
 #define WRITE_BARRIER(object, offset, value)
 #else
-#define WRITE_BARRIER(object, offset, value)                       \
-  do {                                                             \
-    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));            \
-    CombinedWriteBarrier(object, (object).RawField(offset), value, \
-                         UPDATE_WRITE_BARRIER);                    \
+#define WRITE_BARRIER(object, offset, value)                        \
+  do {                                                              \
+    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));             \
+    static_assert(kTaggedCanConvertToRawObjects);                   \
+    CombinedWriteBarrier(object, (object)->RawField(offset), value, \
+                         UPDATE_WRITE_BARRIER);                     \
   } while (false)
 #endif
 
 #ifdef V8_DISABLE_WRITE_BARRIERS
 #define WEAK_WRITE_BARRIER(object, offset, value)
 #else
-#define WEAK_WRITE_BARRIER(object, offset, value)                           \
-  do {                                                                      \
-    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                     \
-    CombinedWriteBarrier(object, (object).RawMaybeWeakField(offset), value, \
-                         UPDATE_WRITE_BARRIER);                             \
+#define WEAK_WRITE_BARRIER(object, offset, value)                            \
+  do {                                                                       \
+    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                      \
+    static_assert(kTaggedCanConvertToRawObjects);                            \
+    CombinedWriteBarrier(object, (object)->RawMaybeWeakField(offset), value, \
+                         UPDATE_WRITE_BARRIER);                              \
   } while (false)
 #endif
 
@@ -532,12 +571,24 @@
 #define EPHEMERON_KEY_WRITE_BARRIER(object, offset, value) \
   WRITE_BARRIER(object, offset, value)
 #else
-#define EPHEMERON_KEY_WRITE_BARRIER(object, offset, value)          \
-  do {                                                              \
-    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));             \
-    CombinedEphemeronWriteBarrier(EphemeronHashTable::cast(object), \
-                                  (object).RawField(offset), value, \
-                                  UPDATE_WRITE_BARRIER);            \
+#define EPHEMERON_KEY_WRITE_BARRIER(object, offset, value)           \
+  do {                                                               \
+    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));              \
+    CombinedEphemeronWriteBarrier(EphemeronHashTable::cast(object),  \
+                                  (object)->RawField(offset), value, \
+                                  UPDATE_WRITE_BARRIER);             \
+  } while (false)
+#endif
+
+#ifdef V8_DISABLE_WRITE_BARRIERS
+#define INDIRECT_POINTER_WRITE_BARRIER(object, offset, value)
+#else
+#define INDIRECT_POINTER_WRITE_BARRIER(object, offset, value)           \
+  do {                                                                  \
+    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                 \
+    IndirectPointerWriteBarrier(                                        \
+        object, Tagged(object)->RawIndirectPointerField(offset), value, \
+        UPDATE_WRITE_BARRIER);                                          \
   } while (false)
 #endif
 
@@ -547,10 +598,10 @@
 #define CONDITIONAL_WRITE_BARRIER(object, offset, value, mode) \
   WRITE_BARRIER(object, offset, value)
 #else
-#define CONDITIONAL_WRITE_BARRIER(object, offset, value, mode)            \
-  do {                                                                    \
-    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                   \
-    CombinedWriteBarrier(object, (object).RawField(offset), value, mode); \
+#define CONDITIONAL_WRITE_BARRIER(object, offset, value, mode)             \
+  do {                                                                     \
+    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                    \
+    CombinedWriteBarrier(object, (object)->RawField(offset), value, mode); \
   } while (false)
 #endif
 
@@ -560,11 +611,11 @@
 #define CONDITIONAL_WEAK_WRITE_BARRIER(object, offset, value, mode) \
   WRITE_BARRIER(object, offset, value)
 #else
-#define CONDITIONAL_WEAK_WRITE_BARRIER(object, offset, value, mode)         \
-  do {                                                                      \
-    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                     \
-    CombinedWriteBarrier(object, (object).RawMaybeWeakField(offset), value, \
-                         mode);                                             \
+#define CONDITIONAL_WEAK_WRITE_BARRIER(object, offset, value, mode)          \
+  do {                                                                       \
+    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                      \
+    CombinedWriteBarrier(object, (object)->RawMaybeWeakField(offset), value, \
+                         mode);                                              \
   } while (false)
 #endif
 
@@ -575,7 +626,19 @@
   do {                                                                       \
     DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                      \
     CombinedEphemeronWriteBarrier(EphemeronHashTable::cast(object),          \
-                                  (object).RawField(offset), value, mode);   \
+                                  (object)->RawField(offset), value, mode);  \
+  } while (false)
+#endif
+
+#ifdef V8_DISABLE_WRITE_BARRIERS
+#define CONDITIONAL_INDIRECT_POINTER_WRITE_BARRIER(object, offset, value, mode)
+#else
+#define CONDITIONAL_INDIRECT_POINTER_WRITE_BARRIER(object, offset, value, \
+                                                   mode)                  \
+  do {                                                                    \
+    DCHECK_NOT_NULL(GetHeapFromWritableObject(object));                   \
+    IndirectPointerWriteBarrier(                                          \
+        object, (object).RawIndirectPointerField(offset), value, mode);   \
   } while (false)
 #endif
 
@@ -638,6 +701,12 @@
   static_cast<int32_t>(base::Relaxed_Load(  \
       reinterpret_cast<const base::Atomic32*>(FIELD_ADDR(p, offset))))
 
+#if defined(V8_HOST_ARCH_64_BIT)
+#define RELAXED_READ_INT64_FIELD(p, offset) \
+  static_cast<int64_t>(base::Relaxed_Load(  \
+      reinterpret_cast<const base::Atomic64*>(FIELD_ADDR(p, offset))))
+#endif
+
 #define RELEASE_WRITE_INT32_FIELD(p, offset, value)             \
   base::Release_Store(                                          \
       reinterpret_cast<base::Atomic32*>(FIELD_ADDR(p, offset)), \
@@ -665,11 +734,11 @@ static_assert(sizeof(unsigned) == sizeof(uint32_t),
   RELAXED_WRITE_UINT32_FIELD(p, offset, value)
 
 #define RELAXED_READ_BYTE_FIELD(p, offset) \
-  static_cast<byte>(base::Relaxed_Load(    \
+  static_cast<uint8_t>(base::Relaxed_Load( \
       reinterpret_cast<const base::Atomic8*>(FIELD_ADDR(p, offset))))
 
 #define ACQUIRE_READ_BYTE_FIELD(p, offset) \
-  static_cast<byte>(base::Acquire_Load(    \
+  static_cast<uint8_t>(base::Acquire_Load( \
       reinterpret_cast<const base::Atomic8*>(FIELD_ADDR(p, offset))))
 
 #define RELAXED_WRITE_BYTE_FIELD(p, offset, value)                             \
@@ -690,9 +759,16 @@ static_assert(sizeof(unsigned) == sizeof(uint32_t),
 #define DECL_VERIFIER(Name) void Name##Verify(Isolate* isolate);
 #define EXPORT_DECL_VERIFIER(Name) \
   V8_EXPORT_PRIVATE void Name##Verify(Isolate* isolate);
+#define DECL_STATIC_VERIFIER(Name) \
+  static void Name##Verify(Tagged<Name> obj, Isolate* isolate);
+#define EXPORT_DECL_STATIC_VERIFIER(Name)                      \
+  V8_EXPORT_PRIVATE static void Name##Verify(Tagged<Name> obj, \
+                                             Isolate* isolate);
 #else
 #define DECL_VERIFIER(Name)
 #define EXPORT_DECL_VERIFIER(Name)
+#define DECL_STATIC_VERIFIER(Name)
+#define EXPORT_DECL_STATIC_VERIFIER(Name)
 #endif
 
 #define DEFINE_DEOPT_ELEMENT_ACCESSORS(name, type) \
@@ -709,15 +785,8 @@ static_assert(sizeof(unsigned) == sizeof(uint32_t),
     set(IndexForEntry(i) + k##name##Offset, value);             \
   }
 
-#define TQ_OBJECT_CONSTRUCTORS(Type)                                           \
- public:                                                                       \
-  constexpr Type() = default;                                                  \
-                                                                               \
- protected:                                                                    \
-  template <typename TFieldType, int kFieldOffset, typename CompressionScheme> \
-  friend class TaggedField;                                                    \
-                                                                               \
-  inline explicit Type(Address ptr);                                           \
+#define TQ_OBJECT_CONSTRUCTORS(Type)                             \
+  OBJECT_CONSTRUCTORS(Type, TorqueGenerated##Type<Type, Super>); \
   friend class TorqueGenerated##Type<Type, Super>;
 
 #define TQ_OBJECT_CONSTRUCTORS_IMPL(Type) \
diff --git a/deps/v8/src/objects/object-type.cc b/deps/v8/src/objects/object-type.cc
index 0983ed510a6292..954dcbfc35608d 100644
--- a/deps/v8/src/objects/object-type.cc
+++ b/deps/v8/src/objects/object-type.cc
@@ -47,38 +47,39 @@ Address CheckObjectType(Address raw_value, Address raw_type,
     Object value(raw_value);
     switch (type) {
       case ObjectType::kHeapObjectReference:
-        if (!value.IsSmi()) return Smi::FromInt(0).ptr();
+        if (!IsSmi(value)) return Smi::FromInt(0).ptr();
         expected = "HeapObjectReference";
         break;
-#define TYPE_CASE(Name)                                 \
-  case ObjectType::k##Name:                             \
-    if (value.Is##Name()) return Smi::FromInt(0).ptr(); \
-    expected = #Name;                                   \
+      case ObjectType::kObject:
+        return Smi::FromInt(0).ptr();
+#define TYPE_CASE(Name)                                \
+  case ObjectType::k##Name:                            \
+    if (Is##Name(value)) return Smi::FromInt(0).ptr(); \
+    expected = #Name;                                  \
     break;
-#define TYPE_STRUCT_CASE(NAME, Name, name)              \
-  case ObjectType::k##Name:                             \
-    if (value.Is##Name()) return Smi::FromInt(0).ptr(); \
-    expected = #Name;                                   \
+#define TYPE_STRUCT_CASE(NAME, Name, name)             \
+  case ObjectType::k##Name:                            \
+    if (Is##Name(value)) return Smi::FromInt(0).ptr(); \
+    expected = #Name;                                  \
     break;
 
-    TYPE_CASE(Object)
-    TYPE_CASE(Smi)
-    TYPE_CASE(TaggedIndex)
-    TYPE_CASE(HeapObject)
-    OBJECT_TYPE_LIST(TYPE_CASE)
-    HEAP_OBJECT_TYPE_LIST(TYPE_CASE)
-    STRUCT_LIST(TYPE_STRUCT_CASE)
+        TYPE_CASE(Smi)
+        TYPE_CASE(TaggedIndex)
+        TYPE_CASE(HeapObject)
+        OBJECT_TYPE_LIST(TYPE_CASE)
+        HEAP_OBJECT_TYPE_LIST(TYPE_CASE)
+        STRUCT_LIST(TYPE_STRUCT_CASE)
 #undef TYPE_CASE
 #undef TYPE_STRUCT_CASE
     }
   }
   MaybeObject maybe_value(raw_value);
   std::stringstream value_description;
-  maybe_value.Print(value_description);
+  Print(maybe_value, value_description);
   FATAL(
       "Type cast failed in %s\n"
       "  Expected %s but found %s",
-      location.ToAsciiArray(), expected, value_description.str().c_str());
+      location->ToAsciiArray(), expected, value_description.str().c_str());
 #else
   UNREACHABLE();
 #endif
diff --git a/deps/v8/src/objects/objects-body-descriptors-inl.h b/deps/v8/src/objects/objects-body-descriptors-inl.h
index 5df31698bce84d..9b1d7b00a8b72f 100644
--- a/deps/v8/src/objects/objects-body-descriptors-inl.h
+++ b/deps/v8/src/objects/objects-body-descriptors-inl.h
@@ -48,49 +48,27 @@ namespace v8 {
 namespace internal {
 
 template <int start_offset>
-int FlexibleBodyDescriptor<start_offset>::SizeOf(Map map, HeapObject object) {
-  return object.SizeFromMap(map);
+int FlexibleBodyDescriptor<start_offset>::SizeOf(Tagged<Map> map,
+                                                 Tagged<HeapObject> object) {
+  return object->SizeFromMap(map);
 }
 
 template <int start_offset>
-int FlexibleWeakBodyDescriptor<start_offset>::SizeOf(Map map,
-                                                     HeapObject object) {
-  return object.SizeFromMap(map);
-}
-
-bool BodyDescriptorBase::IsValidJSObjectSlotImpl(Map map, HeapObject obj,
-                                                 int offset) {
-#ifdef V8_COMPRESS_POINTERS
-  static_assert(kEmbedderDataSlotSize == 2 * kTaggedSize);
-  int embedder_fields_offset = JSObject::GetEmbedderFieldsStartOffset(map);
-  int inobject_fields_offset = map.GetInObjectPropertyOffset(0);
-  // |embedder_fields_offset| may be greater than |inobject_fields_offset| if
-  // the object does not have embedder fields but the check handles this
-  // case properly.
-  if (embedder_fields_offset <= offset && offset < inobject_fields_offset) {
-    // offset points to embedder fields area:
-    // [embedder_fields_offset, inobject_fields_offset).
-    static_assert(base::bits::IsPowerOfTwo(kEmbedderDataSlotSize));
-    return ((offset - embedder_fields_offset) & (kEmbedderDataSlotSize - 1)) ==
-           EmbedderDataSlot::kTaggedPayloadOffset;
-  }
-#else
-  // We store raw aligned pointers as Smis, so it's safe to treat the whole
-  // embedder field area as tagged slots.
-  static_assert(kEmbedderDataSlotSize == kTaggedSize);
-#endif
-  return true;
+int FlexibleWeakBodyDescriptor<start_offset>::SizeOf(
+    Tagged<Map> map, Tagged<HeapObject> object) {
+  return object->SizeFromMap(map);
 }
 
 template <typename ObjectVisitor>
-void BodyDescriptorBase::IterateJSObjectBodyImpl(Map map, HeapObject obj,
+void BodyDescriptorBase::IterateJSObjectBodyImpl(Tagged<Map> map,
+                                                 Tagged<HeapObject> obj,
                                                  int start_offset,
                                                  int end_offset,
                                                  ObjectVisitor* v) {
 #ifdef V8_COMPRESS_POINTERS
   static_assert(kEmbedderDataSlotSize == 2 * kTaggedSize);
   int header_end_offset = JSObject::GetHeaderSize(map);
-  int inobject_fields_start_offset = map.GetInObjectPropertyOffset(0);
+  int inobject_fields_start_offset = map->GetInObjectPropertyOffset(0);
   // We are always requested to process header and embedder fields.
   DCHECK_LE(inobject_fields_start_offset, end_offset);
   // Embedder fields are located between header and inobject properties.
@@ -103,8 +81,8 @@ void BodyDescriptorBase::IterateJSObjectBodyImpl(Map map, HeapObject obj,
       IteratePointer(obj, offset + EmbedderDataSlot::kTaggedPayloadOffset, v);
       v->VisitExternalPointer(
           obj,
-          obj.RawExternalPointerField(offset +
-                                      EmbedderDataSlot::kExternalPointerOffset),
+          obj->RawExternalPointerField(
+              offset + EmbedderDataSlot::kExternalPointerOffset),
           kEmbedderDataSlotPayloadTag);
     }
     // Proceed processing inobject properties.
@@ -119,70 +97,84 @@ void BodyDescriptorBase::IterateJSObjectBodyImpl(Map map, HeapObject obj,
 }
 
 template <typename ObjectVisitor>
-DISABLE_CFI_PERF void BodyDescriptorBase::IteratePointers(HeapObject obj,
-                                                          int start_offset,
-                                                          int end_offset,
-                                                          ObjectVisitor* v) {
+DISABLE_CFI_PERF void BodyDescriptorBase::IteratePointers(
+    Tagged<HeapObject> obj, int start_offset, int end_offset,
+    ObjectVisitor* v) {
   if (start_offset == HeapObject::kMapOffset) {
     v->VisitMapPointer(obj);
     start_offset += kTaggedSize;
   }
-  v->VisitPointers(obj, obj.RawField(start_offset), obj.RawField(end_offset));
+  v->VisitPointers(obj, obj->RawField(start_offset), obj->RawField(end_offset));
 }
 
 template <typename ObjectVisitor>
-void BodyDescriptorBase::IteratePointer(HeapObject obj, int offset,
+void BodyDescriptorBase::IteratePointer(Tagged<HeapObject> obj, int offset,
                                         ObjectVisitor* v) {
   DCHECK_NE(offset, HeapObject::kMapOffset);
-  v->VisitPointer(obj, obj.RawField(offset));
+  v->VisitPointer(obj, obj->RawField(offset));
 }
 
 template <typename ObjectVisitor>
 DISABLE_CFI_PERF void BodyDescriptorBase::IterateMaybeWeakPointers(
-    HeapObject obj, int start_offset, int end_offset, ObjectVisitor* v) {
-  v->VisitPointers(obj, obj.RawMaybeWeakField(start_offset),
-                   obj.RawMaybeWeakField(end_offset));
+    Tagged<HeapObject> obj, int start_offset, int end_offset,
+    ObjectVisitor* v) {
+  v->VisitPointers(obj, obj->RawMaybeWeakField(start_offset),
+                   obj->RawMaybeWeakField(end_offset));
 }
 
 template <typename ObjectVisitor>
-void BodyDescriptorBase::IterateMaybeWeakPointer(HeapObject obj, int offset,
-                                                 ObjectVisitor* v) {
+void BodyDescriptorBase::IterateMaybeWeakPointer(Tagged<HeapObject> obj,
+                                                 int offset, ObjectVisitor* v) {
   DCHECK_NE(offset, HeapObject::kMapOffset);
-  v->VisitPointer(obj, obj.RawMaybeWeakField(offset));
+  v->VisitPointer(obj, obj->RawMaybeWeakField(offset));
 }
 
 template <typename ObjectVisitor>
 DISABLE_CFI_PERF void BodyDescriptorBase::IterateCustomWeakPointers(
-    HeapObject obj, int start_offset, int end_offset, ObjectVisitor* v) {
-  v->VisitCustomWeakPointers(obj, obj.RawField(start_offset),
-                             obj.RawField(end_offset));
+    Tagged<HeapObject> obj, int start_offset, int end_offset,
+    ObjectVisitor* v) {
+  v->VisitCustomWeakPointers(obj, obj->RawField(start_offset),
+                             obj->RawField(end_offset));
 }
 
 template <typename ObjectVisitor>
-DISABLE_CFI_PERF void BodyDescriptorBase::IterateEphemeron(HeapObject obj,
-                                                           int index,
-                                                           int key_offset,
-                                                           int value_offset,
-                                                           ObjectVisitor* v) {
-  v->VisitEphemeron(obj, index, obj.RawField(key_offset),
-                    obj.RawField(value_offset));
+DISABLE_CFI_PERF void BodyDescriptorBase::IterateEphemeron(
+    Tagged<HeapObject> obj, int index, int key_offset, int value_offset,
+    ObjectVisitor* v) {
+  v->VisitEphemeron(obj, index, obj->RawField(key_offset),
+                    obj->RawField(value_offset));
 }
 
 template <typename ObjectVisitor>
-void BodyDescriptorBase::IterateCustomWeakPointer(HeapObject obj, int offset,
+void BodyDescriptorBase::IterateCustomWeakPointer(Tagged<HeapObject> obj,
+                                                  int offset,
                                                   ObjectVisitor* v) {
-  v->VisitCustomWeakPointer(obj, obj.RawField(offset));
+  v->VisitCustomWeakPointer(obj, obj->RawField(offset));
+}
+
+template <typename ObjectVisitor>
+void BodyDescriptorBase::IterateMaybeIndirectPointer(Tagged<HeapObject> obj,
+                                                     int offset,
+                                                     ObjectVisitor* v,
+                                                     IndirectPointerMode mode) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  v->VisitIndirectPointer(obj, obj->RawIndirectPointerField(offset), mode);
+#else
+  if (mode == IndirectPointerMode::kStrong) {
+    IteratePointer(obj, offset, v);
+  } else {
+    IterateCustomWeakPointer(obj, offset, v);
+  }
+#endif
 }
 
 class HeapNumber::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {}
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {}
 
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     return HeapNumber::kSize;
   }
 };
@@ -190,15 +182,15 @@ class HeapNumber::BodyDescriptor final : public BodyDescriptorBase {
 // This is a descriptor for one/two pointer fillers.
 class FreeSpaceFillerBodyDescriptor final : public DataOnlyBodyDescriptor {
  public:
-  static inline int SizeOf(Map map, HeapObject raw_object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> raw_object) {
+    return map->instance_size();
   }
 };
 
 class FreeSpace::BodyDescriptor final : public DataOnlyBodyDescriptor {
  public:
-  static inline int SizeOf(Map map, HeapObject raw_object) {
-    return FreeSpace::unchecked_cast(raw_object).Size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> raw_object) {
+    return FreeSpace::unchecked_cast(raw_object)->Size();
   }
 };
 
@@ -206,19 +198,14 @@ class JSObject::BodyDescriptor final : public BodyDescriptorBase {
  public:
   static const int kStartOffset = JSReceiver::kPropertiesOrHashOffset;
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    if (offset < kStartOffset) return false;
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IterateJSObjectBodyImpl(map, obj, kStartOffset, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
@@ -226,70 +213,54 @@ class JSObject::FastBodyDescriptor final : public BodyDescriptorBase {
  public:
   static const int kStartOffset = JSReceiver::kPropertiesOrHashOffset;
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= kStartOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, kStartOffset, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class WeakCell::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= HeapObject::kHeaderSize;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, HeapObject::kHeaderSize, kTargetOffset, v);
     IterateCustomWeakPointer(obj, kTargetOffset, v);
     IterateCustomWeakPointer(obj, kUnregisterTokenOffset, v);
     IteratePointers(obj, kUnregisterTokenOffset + kTaggedSize, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class JSWeakRef::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, JSReceiver::kPropertiesOrHashOffset, kTargetOffset, v);
     IterateCustomWeakPointer(obj, kTargetOffset, v);
     IterateJSObjectBodyImpl(map, obj, kTargetOffset + kTaggedSize, object_size,
                             v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class JSFinalizationRegistry::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, JSObject::BodyDescriptor::kStartOffset,
                     kNextDirtyOffset, v);
     IterateCustomWeakPointer(obj, kNextDirtyOffset, v);
@@ -297,8 +268,8 @@ class JSFinalizationRegistry::BodyDescriptor final : public BodyDescriptorBase {
                             object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
@@ -311,22 +282,9 @@ class AllocationSite::BodyDescriptor final : public BodyDescriptorBase {
   static_assert(AllocationSite::kPretenureCreateCountOffset + kInt32Size ==
                 AllocationSite::kWeakNextOffset);
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    if (offset >= AllocationSite::kStartOffset &&
-        offset < AllocationSite::kCommonPointerFieldEndOffset) {
-      return true;
-    }
-    // check for weak_next offset
-    if (map.instance_size() == AllocationSite::kSizeWithWeakNext &&
-        offset == AllocationSite::kWeakNextOffset) {
-      return true;
-    }
-    return false;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     // Iterate over all the common pointer fields
     IteratePointers(obj, AllocationSite::kStartOffset,
                     AllocationSite::kCommonPointerFieldEndOffset, v);
@@ -338,8 +296,8 @@ class AllocationSite::BodyDescriptor final : public BodyDescriptorBase {
     }
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
@@ -347,71 +305,59 @@ class JSFunction::BodyDescriptor final : public BodyDescriptorBase {
  public:
   static const int kStartOffset = JSObject::BodyDescriptor::kStartOffset;
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    if (offset < kStartOffset) return false;
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     // Iterate JSFunction header fields first.
-    int header_size = JSFunction::GetHeaderSize(map.has_prototype_slot());
+    int header_size = JSFunction::GetHeaderSize(map->has_prototype_slot());
     DCHECK_GE(object_size, header_size);
     IteratePointers(obj, kStartOffset, kCodeOffset, v);
-    // Code field is treated as a custom weak pointer. This field
+
+    // Iterate the code object pointer.
+    // When the sandbox is enabled, Code objects are referenced via indirect
+    // pointers through the code pointer table. Otherwise, the slot contains a
+    // regular tagged pointer.
+    // The code field is treated as a custom weak pointer. This field
     // is visited as a weak pointer if the Code is baseline code
     // and the bytecode array corresponding to this function is old. In the rest
     // of the cases this field is treated as strong pointer.
-    IterateCustomWeakPointer(obj, kCodeOffset, v);
-    // Iterate rest of the header fields
+    // See MarkingVisitorBase::VisitJSFunction.
+    IterateMaybeIndirectPointer(obj, kCodeOffset, v,
+                                IndirectPointerMode::kCustom);
     DCHECK_GE(header_size, kCodeOffset);
+    // Iterate rest of the header fields
     IteratePointers(obj, kCodeOffset + kTaggedSize, header_size, v);
     // Iterate rest of the fields starting after the header.
     IterateJSObjectBodyImpl(map, obj, header_size, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class JSArrayBuffer::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    if (offset < kEndOfTaggedFieldsOffset) return true;
-    if (offset < kHeaderSize) return false;
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     // JSArrayBuffer instances contain raw data that the GC does not know about.
     IteratePointers(obj, kPropertiesOrHashOffset, kEndOfTaggedFieldsOffset, v);
     IterateJSObjectBodyImpl(map, obj, kHeaderSize, object_size, v);
-    v->VisitExternalPointer(map, obj.RawExternalPointerField(kExtensionOffset),
+    v->VisitExternalPointer(map, obj->RawExternalPointerField(kExtensionOffset),
                             kArrayBufferExtensionTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class JSTypedArray::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    if (offset < kEndOfTaggedFieldsOffset) return true;
-    // TODO(v8:4153): Remove this.
-    if (offset == kBasePointerOffset) return true;
-    if (offset < kHeaderSize) return false;
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     // JSTypedArray contains raw data that the GC does not know about.
     IteratePointers(obj, kPropertiesOrHashOffset, kEndOfTaggedFieldsOffset, v);
     // TODO(v8:4153): Remove this.
@@ -419,48 +365,40 @@ class JSTypedArray::BodyDescriptor final : public BodyDescriptorBase {
     IterateJSObjectBodyImpl(map, obj, kHeaderSize, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class JSDataViewOrRabGsabDataView::BodyDescriptor final
     : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    if (offset < kEndOfTaggedFieldsOffset) return true;
-    if (offset < kHeaderSize) return false;
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     // JSDataViewOrRabGsabDataView contains raw data that the GC does not know
     // about.
     IteratePointers(obj, kPropertiesOrHashOffset, kEndOfTaggedFieldsOffset, v);
     IterateJSObjectBodyImpl(map, obj, kHeaderSize, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class JSExternalObject::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, kPropertiesOrHashOffset, kEndOfTaggedFieldsOffset, v);
-    v->VisitExternalPointer(obj, obj.RawExternalPointerField(kValueOffset),
+    v->VisitExternalPointer(obj, obj->RawExternalPointerField(kValueOffset),
                             kExternalObjectValueTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
@@ -468,23 +406,16 @@ template <typename Derived>
 class V8_EXPORT_PRIVATE SmallOrderedHashTable<Derived>::BodyDescriptor final
     : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    Derived table = Derived::cast(obj);
-    // Only data table part contains tagged values.
-    return (offset >= DataTableStartOffset()) &&
-           (offset < table.GetBucketsStartOffset());
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     Derived table = Derived::cast(obj);
     int start_offset = DataTableStartOffset();
     int end_offset = table.GetBucketsStartOffset();
     IteratePointers(obj, start_offset, end_offset, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject obj) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
     Derived table = Derived::cast(obj);
     return Derived::SizeFor(table.Capacity());
   }
@@ -493,185 +424,175 @@ class V8_EXPORT_PRIVATE SmallOrderedHashTable<Derived>::BodyDescriptor final
 class V8_EXPORT_PRIVATE SwissNameDictionary::BodyDescriptor final
     : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    // Using |unchecked_cast| here and elsewhere in this class because the
-    // Scavenger may be calling us while the map word contains the forwarding
-    // address (a Smi) rather than a map.
-
-    SwissNameDictionary table = SwissNameDictionary::unchecked_cast(obj);
-    static_assert(MetaTablePointerOffset() + kTaggedSize ==
-                  DataTableStartOffset());
-    return offset >= MetaTablePointerOffset() &&
-           (offset < table.DataTableEndOffset(table.Capacity()));
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
-    SwissNameDictionary table = SwissNameDictionary::unchecked_cast(obj);
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
+    Tagged<SwissNameDictionary> table =
+        SwissNameDictionary::unchecked_cast(obj);
     static_assert(MetaTablePointerOffset() + kTaggedSize ==
                   DataTableStartOffset());
     int start_offset = MetaTablePointerOffset();
-    int end_offset = table.DataTableEndOffset(table.Capacity());
+    int end_offset = table->DataTableEndOffset(table->Capacity());
     IteratePointers(obj, start_offset, end_offset, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject obj) {
-    SwissNameDictionary table = SwissNameDictionary::unchecked_cast(obj);
-    return SwissNameDictionary::SizeFor(table.Capacity());
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    Tagged<SwissNameDictionary> table =
+        SwissNameDictionary::unchecked_cast(obj);
+    return SwissNameDictionary::SizeFor(table->Capacity());
   }
 };
 
 class ByteArray::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {}
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {}
 
-  static inline int SizeOf(Map map, HeapObject obj) {
-    return ByteArray::SizeFor(ByteArray::cast(obj).length(kAcquireLoad));
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    return ByteArray::SizeFor(
+        ByteArray::unchecked_cast(obj)->length(kAcquireLoad));
   }
 };
 
 class BytecodeArray::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= kConstantPoolOffset &&
-           offset <= kSourcePositionTableOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointer(obj, kConstantPoolOffset, v);
     IteratePointer(obj, kHandlerTableOffset, v);
     IteratePointer(obj, kSourcePositionTableOffset, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject obj) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
     return BytecodeArray::SizeFor(
-        BytecodeArray::cast(obj).length(kAcquireLoad));
+        BytecodeArray::cast(obj)->length(kAcquireLoad));
   }
 };
 
-class BigInt::BodyDescriptor final : public BodyDescriptorBase {
+class ExternalPointerArray::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
+  template <typename ObjectVisitor>
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
+    Tagged<ExternalPointerArray> array =
+        ExternalPointerArray::unchecked_cast(obj);
+    for (int i = 0; i < array->length(); i++) {
+      // We don't currently track the (expected) tag of the elements of this
+      // array, so we have to use the generic tag here. This is ok as long as
+      // the visitor does not try to dereference the pointer (which it never
+      // should). The alternative would probably be to store the tag as
+      // additional metadata in the array itself, but then we also need to be
+      // careful since an attacker could then modify the tag.
+      v->VisitExternalPointer(array,
+                              array->RawExternalPointerField(
+                                  ExternalPointerArray::OffsetOfElementAt(i)),
+                              kAnyExternalPointerTag);
+    }
+  }
 
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    return ExternalPointerArray::SizeFor(
+        ExternalPointerArray::cast(obj)->length(kAcquireLoad));
+  }
+};
+
+class BigInt::BodyDescriptor final : public BodyDescriptorBase {
+ public:
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {}
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {}
 
-  static inline int SizeOf(Map map, HeapObject obj) {
-    return BigInt::SizeFor(BigInt::cast(obj).length(kAcquireLoad));
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    return BigInt::SizeFor(BigInt::unchecked_cast(obj)->length(kAcquireLoad));
   }
 };
 
 class FixedDoubleArray::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {}
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {}
 
-  static inline int SizeOf(Map map, HeapObject obj) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
     return FixedDoubleArray::SizeFor(
-        FixedDoubleArray::cast(obj).length(kAcquireLoad));
+        FixedDoubleArray::unchecked_cast(obj)->length(kAcquireLoad));
   }
 };
 
 class FeedbackMetadata::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {}
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {}
 
-  static inline int SizeOf(Map map, HeapObject obj) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
     return FeedbackMetadata::SizeFor(
-        FeedbackMetadata::cast(obj).slot_count(kAcquireLoad));
+        FeedbackMetadata::unchecked_cast(obj)->slot_count(kAcquireLoad));
   }
 };
 
 class PreparseData::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= PreparseData::cast(obj).inner_start_offset();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
-    PreparseData data = PreparseData::cast(obj);
-    int start_offset = data.inner_start_offset();
-    int end_offset = start_offset + data.children_length() * kTaggedSize;
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
+    Tagged<PreparseData> data = PreparseData::unchecked_cast(obj);
+    int start_offset = data->inner_start_offset();
+    int end_offset = start_offset + data->children_length() * kTaggedSize;
     IteratePointers(obj, start_offset, end_offset, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject obj) {
-    PreparseData data = PreparseData::cast(obj);
-    return PreparseData::SizeFor(data.data_length(), data.children_length());
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    Tagged<PreparseData> data = PreparseData::unchecked_cast(obj);
+    return PreparseData::SizeFor(data->data_length(), data->children_length());
   }
 };
 
 class SharedFunctionInfo::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= HeapObject::kHeaderSize &&
-           offset < kEndOfStrongFieldsOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IterateCustomWeakPointers(obj, kStartOfWeakFieldsOffset,
                               kEndOfWeakFieldsOffset, v);
     IteratePointers(obj, kStartOfStrongFieldsOffset, kEndOfStrongFieldsOffset,
                     v);
   }
 
-  static inline int SizeOf(Map map, HeapObject raw_object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> raw_object) {
+    return kSize;
+  }
 };
 
 class PromiseOnStack::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= HeapObject::kHeaderSize;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, Struct::kHeaderSize, kPromiseOffset, v);
     IterateMaybeWeakPointer(obj, kPromiseOffset, v);
     static_assert(kPromiseOffset + kTaggedSize == kHeaderSize);
   }
 
-  static inline int SizeOf(Map map, HeapObject obj) {
-    return obj.SizeFromMap(map);
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    return obj->SizeFromMap(map);
   }
 };
 
 class PrototypeInfo::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= HeapObject::kHeaderSize;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, HeapObject::kHeaderSize, kObjectCreateMapOffset, v);
     IterateMaybeWeakPointer(obj, kObjectCreateMapOffset, v);
     static_assert(kObjectCreateMapOffset + kTaggedSize == kHeaderSize);
   }
 
-  static inline int SizeOf(Map map, HeapObject obj) {
-    return obj.SizeFromMap(map);
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    return obj->SizeFromMap(map);
   }
 };
 
@@ -679,152 +600,121 @@ class JSWeakCollection::BodyDescriptorImpl final : public BodyDescriptorBase {
  public:
   static_assert(kTableOffset + kTaggedSize == kHeaderSizeOfAllWeakCollections);
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IterateJSObjectBodyImpl(map, obj, kPropertiesOrHashOffset, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class JSSynchronizationPrimitive::BodyDescriptor final
     : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    if (offset < kEndOfTaggedFieldsOffset) return true;
-    if (offset < kHeaderSize) return false;
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, kPropertiesOrHashOffset, kEndOfTaggedFieldsOffset, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class Foreign::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     v->VisitExternalPointer(obj,
-                            obj.RawExternalPointerField(kForeignAddressOffset),
+                            obj->RawExternalPointerField(kForeignAddressOffset),
                             kForeignForeignAddressTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return kSize;
+  }
 };
 
 #if V8_ENABLE_WEBASSEMBLY
 class WasmTypeInfo::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    UNREACHABLE();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointer(obj, kInstanceOffset, v);
     IteratePointers(obj, kSupertypesOffset, SizeOf(map, obj), v);
 
-    v->VisitExternalPointer(obj, obj.RawExternalPointerField(kNativeTypeOffset),
+    v->VisitExternalPointer(obj,
+                            obj->RawExternalPointerField(kNativeTypeOffset),
                             kWasmTypeInfoNativeTypeTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     return kSupertypesOffset +
-           WasmTypeInfo::cast(object).supertypes_length() * kTaggedSize;
+           WasmTypeInfo::cast(object)->supertypes_length() * kTaggedSize;
   }
 };
 
 class WasmApiFunctionRef::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    UNREACHABLE();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, kStartOfStrongFieldsOffset, kEndOfStrongFieldsOffset,
                     v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return kSize;
+  }
 };
 
 class WasmExportedFunctionData::BodyDescriptor final
     : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    UNREACHABLE();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     WasmFunctionData::BodyDescriptor::IterateBody<ObjectVisitor>(
         map, obj, object_size, v);
     IteratePointers(obj, kStartOfStrongFieldsOffset, kEndOfStrongFieldsOffset,
                     v);
-    v->VisitExternalPointer(obj, obj.RawExternalPointerField(kSigOffset),
+    v->VisitExternalPointer(obj, obj->RawExternalPointerField(kSigOffset),
                             kWasmExportedFunctionDataSignatureTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return kSize;
+  }
 };
 
 class WasmInternalFunction::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    UNREACHABLE();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, kStartOfStrongFieldsOffset, kEndOfStrongFieldsOffset,
                     v);
-    v->VisitExternalPointer(obj, obj.RawExternalPointerField(kCallTargetOffset),
+    v->VisitExternalPointer(obj,
+                            obj->RawExternalPointerField(kCallTargetOffset),
                             kWasmInternalFunctionCallTargetTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return kSize;
+  }
 };
 
 class WasmInstanceObject::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    SLOW_DCHECK(std::is_sorted(std::begin(kTaggedFieldOffsets),
-                               std::end(kTaggedFieldOffsets)));
-    static_assert(sizeof(*kTaggedFieldOffsets) == sizeof(uint16_t));
-    if (offset < int{8 * sizeof(*kTaggedFieldOffsets)} &&
-        std::binary_search(std::begin(kTaggedFieldOffsets),
-                           std::end(kTaggedFieldOffsets),
-                           static_cast<uint16_t>(offset))) {
-      return true;
-    }
-    return IsValidJSObjectSlotImpl(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, kPropertiesOrHashOffset, JSObject::kHeaderSize, v);
     for (uint16_t offset : kTaggedFieldOffsets) {
       IteratePointer(obj, offset, v);
@@ -832,112 +722,93 @@ class WasmInstanceObject::BodyDescriptor final : public BodyDescriptorBase {
     IterateJSObjectBodyImpl(map, obj, kHeaderSize, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return map.instance_size();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return map->instance_size();
   }
 };
 
 class WasmArray::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    // Fields in WasmArrays never change their types in place, so
-    // there should never be a need to call this function.
-    UNREACHABLE();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     // The type is safe to use because it's kept alive by the {map}'s
     // WasmTypeInfo.
     if (!WasmArray::GcSafeType(map)->element_type().is_reference()) return;
     IteratePointers(obj, WasmArray::kHeaderSize, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return WasmArray::SizeFor(map, WasmArray::cast(object).length());
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return WasmArray::SizeFor(map, WasmArray::unchecked_cast(object)->length());
   }
 };
 
 class WasmContinuationObject::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    UNREACHABLE();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, kStartOfStrongFieldsOffset, kEndOfStrongFieldsOffset,
                     v);
-    v->VisitExternalPointer(obj, obj.RawExternalPointerField(kJmpbufOffset),
+    v->VisitExternalPointer(obj, obj->RawExternalPointerField(kJmpbufOffset),
                             kWasmContinuationJmpbufTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return kSize;
+  }
 };
 
 class WasmStruct::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    // Fields in WasmStructs never change their types in place, so
-    // there should never be a need to call this function.
-    UNREACHABLE();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
-    WasmStruct wasm_struct = WasmStruct::cast(obj);
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
+    Tagged<WasmStruct> wasm_struct = WasmStruct::unchecked_cast(obj);
     // The {type} is safe to use because it's kept alive by the {map}'s
     // WasmTypeInfo.
     wasm::StructType* type = WasmStruct::GcSafeType(map);
     for (uint32_t i = 0; i < type->field_count(); i++) {
       if (!type->field(i).is_reference()) continue;
       int offset = static_cast<int>(type->field_offset(i));
-      v->VisitPointer(wasm_struct, wasm_struct.RawField(offset));
+      v->VisitPointer(wasm_struct, wasm_struct->RawField(offset));
     }
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     return WasmStruct::GcSafeSize(map);
   }
 };
 
 class WasmNull::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    UNREACHABLE();
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {}
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {}
 
-  static inline int SizeOf(Map map, HeapObject obj) { return WasmNull::kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    return WasmNull::kSize;
+  }
 };
-
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 class ExternalString::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
-    ExternalString string = ExternalString::unchecked_cast(obj);
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
+    Tagged<ExternalString> string = ExternalString::unchecked_cast(obj);
     v->VisitExternalPointer(obj,
-                            string.RawExternalPointerField(kResourceOffset),
+                            string->RawExternalPointerField(kResourceOffset),
                             kExternalStringResourceTag);
-    if (string.is_uncached()) return;
-    v->VisitExternalPointer(obj,
-                            string.RawExternalPointerField(kResourceDataOffset),
-                            kExternalStringResourceDataTag);
+    if (string->is_uncached()) return;
+    v->VisitExternalPointer(
+        obj, string->RawExternalPointerField(kResourceDataOffset),
+        kExternalStringResourceDataTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    InstanceType type = map.instance_type();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    InstanceType type = map->instance_type();
     const auto is_uncached =
         (type & kUncachedExternalStringMask) == kUncachedExternalStringTag;
     return is_uncached ? kUncachedSize : kSizeOfAllExternalStrings;
@@ -946,15 +817,13 @@ class ExternalString::BodyDescriptor final : public BodyDescriptorBase {
 
 class CoverageInfo::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {}
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {}
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    CoverageInfo info = CoverageInfo::cast(object);
-    return CoverageInfo::SizeFor(info.slot_count());
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    Tagged<CoverageInfo> info = CoverageInfo::cast(object);
+    return CoverageInfo::SizeFor(info->slot_count());
   }
 };
 
@@ -962,12 +831,8 @@ class InstructionStream::BodyDescriptor final : public BodyDescriptorBase {
  public:
   static_assert(static_cast<int>(HeapObject::kHeaderSize) ==
                 static_cast<int>(kCodeOffset));
-  static_assert(kCodeOffset + kTaggedSize == kDataStart);
-
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    // Slots in code can't be invalid because we never trim code objects.
-    return true;
-  }
+  static_assert(kCodeOffset + kTaggedSize == kRelocationInfoOffset);
+  static_assert(kRelocationInfoOffset + kTaggedSize == kDataStart);
 
   static constexpr int kRelocModeMask =
       RelocInfo::ModeMask(RelocInfo::CODE_TARGET) |
@@ -981,59 +846,52 @@ class InstructionStream::BodyDescriptor final : public BodyDescriptorBase {
       RelocInfo::ModeMask(RelocInfo::WASM_STUB_CALL);
 
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 ObjectVisitor* v) {
     // GC does not visit data/code in the header and in the body directly.
-    IteratePointers(obj, kCodeOffset, kDataStart, v);
+    IteratePointers(obj, kStartOfStrongFieldsOffset, kEndOfStrongFieldsOffset,
+                    v);
 
-    InstructionStream istream = InstructionStream::cast(obj);
-    Code code = istream.unchecked_code();
-    RelocIterator it(code, istream, code.unchecked_relocation_info(),
-                     code.constant_pool(), kRelocModeMask);
-    v->VisitRelocInfo(&it);
+    Tagged<InstructionStream> istream = InstructionStream::unchecked_cast(obj);
+    Tagged<Code> code;
+    if (istream->TryGetCodeUnchecked(&code, kAcquireLoad)) {
+      RelocIterator it(code, istream, istream->unchecked_relocation_info(),
+                       kRelocModeMask);
+      v->VisitRelocInfo(istream, &it);
+    }
   }
 
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IterateBody(map, obj, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return InstructionStream::unchecked_cast(object).CodeSize();
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return InstructionStream::unchecked_cast(object)->Size();
   }
 };
 
 class Map::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    static_assert(
-        Map::kEndOfStrongFieldsOffset == Map::kStartOfWeakFieldsOffset,
-        "Leverage that weak fields directly follow strong fields for the "
-        "check below");
-    return offset >= Map::kStartOfStrongFieldsOffset &&
-           offset < Map::kEndOfWeakFieldsOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, Map::kStartOfStrongFieldsOffset,
                     Map::kEndOfStrongFieldsOffset, v);
     IterateMaybeWeakPointer(obj, kTransitionsOrPrototypeInfoOffset, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject obj) { return Map::kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> obj) {
+    return Map::kSize;
+  }
 };
 
 class DataHandler::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= HeapObject::kHeaderSize;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     static_assert(kSmiHandlerOffset < kData1Offset,
                   "Field order must be in sync with this iteration code");
     static_assert(kData1Offset < kSizeWithData1,
@@ -1042,75 +900,61 @@ class DataHandler::BodyDescriptor final : public BodyDescriptorBase {
     IterateMaybeWeakPointers(obj, kData1Offset, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return object.SizeFromMap(map);
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return object->SizeFromMap(map);
   }
 };
 
 class NativeContext::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset < NativeContext::kEndOfTaggedFieldsOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, NativeContext::kStartOfStrongFieldsOffset,
                     NativeContext::kEndOfStrongFieldsOffset, v);
     IterateCustomWeakPointers(obj, NativeContext::kStartOfWeakFieldsOffset,
                               NativeContext::kEndOfWeakFieldsOffset, v);
     v->VisitExternalPointer(obj,
-                            obj.RawExternalPointerField(kMicrotaskQueueOffset),
+                            obj->RawExternalPointerField(kMicrotaskQueueOffset),
                             kNativeContextMicrotaskQueueTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     return NativeContext::kSize;
   }
 };
 
 class Code::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= HeapObject::kHeaderSize &&
-           offset <= Code::kPointerFieldsStrongEndOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
-    IteratePointers(obj, HeapObject::kHeaderSize,
-                    Code::kPointerFieldsStrongEndOffset, v);
-
-    v->VisitCodePointer(Code::cast(obj),
-                        obj.RawCodeField(kInstructionStreamOffset));
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
+    IteratePointers(obj, Code::kStartOfStrongFieldsOffset,
+                    Code::kEndOfStrongFieldsWithMainCageBaseOffset, v);
+
+    static_assert(Code::kEndOfStrongFieldsWithMainCageBaseOffset ==
+                  Code::kInstructionStreamOffset);
+    static_assert(Code::kInstructionStreamOffset + kTaggedSize ==
+                  Code::kEndOfStrongFieldsOffset);
+    v->VisitInstructionStreamPointer(
+        Code::cast(obj),
+        obj->RawInstructionStreamField(kInstructionStreamOffset));
+#ifdef V8_CODE_POINTER_SANDBOXING
+    v->VisitIndirectPointerTableEntry(
+        obj, obj->RawIndirectPointerField(kCodePointerTableEntryOffset));
+#endif
   }
 
-  static inline int SizeOf(Map map, HeapObject object) { return Code::kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return Code::kSize;
+  }
 };
 
 class EmbedderDataArray::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-#ifdef V8_COMPRESS_POINTERS
-    static_assert(kEmbedderDataSlotSize == 2 * kTaggedSize);
-    static_assert(base::bits::IsPowerOfTwo(kEmbedderDataSlotSize));
-    return (offset < EmbedderDataArray::kHeaderSize) ||
-           (((offset - EmbedderDataArray::kHeaderSize) &
-             (kEmbedderDataSlotSize - 1)) ==
-            EmbedderDataSlot::kTaggedPayloadOffset);
-#else
-    static_assert(kEmbedderDataSlotSize == kTaggedSize);
-    // We store raw aligned pointers as Smis, so it's safe to iterate the whole
-    // array.
-    return true;
-#endif
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
 #ifdef V8_COMPRESS_POINTERS
     static_assert(kEmbedderDataSlotSize == 2 * kTaggedSize);
     for (int offset = EmbedderDataArray::OffsetOfElementAt(0);
@@ -1118,8 +962,8 @@ class EmbedderDataArray::BodyDescriptor final : public BodyDescriptorBase {
       IteratePointer(obj, offset + EmbedderDataSlot::kTaggedPayloadOffset, v);
       v->VisitExternalPointer(
           obj,
-          obj.RawExternalPointerField(offset +
-                                      EmbedderDataSlot::kExternalPointerOffset),
+          obj->RawExternalPointerField(
+              offset + EmbedderDataSlot::kExternalPointerOffset),
           kEmbedderDataSlotPayloadTag);
     }
 
@@ -1131,8 +975,8 @@ class EmbedderDataArray::BodyDescriptor final : public BodyDescriptorBase {
 #endif
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return object.SizeFromMap(map);
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return object->SizeFromMap(map);
   }
 };
 
@@ -1234,6 +1078,8 @@ auto BodyDescriptorApply(InstanceType type, Args&&... args) {
       return CALL_APPLY(WasmStruct);
     case WASM_TYPE_INFO_TYPE:
       return CALL_APPLY(WasmTypeInfo);
+    case WASM_SUSPENDER_OBJECT_TYPE:
+      return CALL_APPLY(WasmSuspenderObject);
 #endif  // V8_ENABLE_WEBASSEMBLY
     case JS_API_OBJECT_TYPE:
     case JS_ARGUMENTS_OBJECT_TYPE:
@@ -1255,6 +1101,7 @@ auto BodyDescriptorApply(InstanceType type, Args&&... args) {
     case JS_ITERATOR_MAP_HELPER_TYPE:
     case JS_ITERATOR_TAKE_HELPER_TYPE:
     case JS_ITERATOR_DROP_HELPER_TYPE:
+    case JS_ITERATOR_FLAT_MAP_HELPER_TYPE:
     case JS_ITERATOR_PROTOTYPE_TYPE:
     case JS_MAP_ITERATOR_PROTOTYPE_TYPE:
     case JS_MAP_KEY_ITERATOR_TYPE:
@@ -1293,17 +1140,8 @@ auto BodyDescriptorApply(InstanceType type, Args&&... args) {
     case JS_TEMPORAL_TIME_ZONE_TYPE:
     case JS_TEMPORAL_ZONED_DATE_TIME_TYPE:
     case JS_TYPED_ARRAY_PROTOTYPE_TYPE:
-    case JS_FUNCTION_TYPE:
-    case JS_CLASS_CONSTRUCTOR_TYPE:
-    case JS_PROMISE_CONSTRUCTOR_TYPE:
-    case JS_REG_EXP_CONSTRUCTOR_TYPE:
     case JS_VALID_ITERATOR_WRAPPER_TYPE:
     case JS_WRAPPED_FUNCTION_TYPE:
-    case JS_ARRAY_CONSTRUCTOR_TYPE:
-#define TYPED_ARRAY_CONSTRUCTORS_SWITCH(Type, type, TYPE, Ctype) \
-  case TYPE##_TYPED_ARRAY_CONSTRUCTOR_TYPE:
-      TYPED_ARRAYS(TYPED_ARRAY_CONSTRUCTORS_SWITCH)
-#undef TYPED_ARRAY_CONSTRUCTORS_SWITCH
     case JS_RAW_JSON_TYPE:
 #ifdef V8_INTL_SUPPORT
     case JS_V8_BREAK_ITERATOR_TYPE:
@@ -1324,12 +1162,21 @@ auto BodyDescriptorApply(InstanceType type, Args&&... args) {
     case WASM_GLOBAL_OBJECT_TYPE:
     case WASM_MEMORY_OBJECT_TYPE:
     case WASM_MODULE_OBJECT_TYPE:
-    case WASM_SUSPENDER_OBJECT_TYPE:
     case WASM_TABLE_OBJECT_TYPE:
     case WASM_TAG_OBJECT_TYPE:
     case WASM_VALUE_OBJECT_TYPE:
 #endif  // V8_ENABLE_WEBASSEMBLY
       return CALL_APPLY(JSObject);
+    case JS_FUNCTION_TYPE:
+    case JS_CLASS_CONSTRUCTOR_TYPE:
+    case JS_PROMISE_CONSTRUCTOR_TYPE:
+    case JS_REG_EXP_CONSTRUCTOR_TYPE:
+    case JS_ARRAY_CONSTRUCTOR_TYPE:
+#define TYPED_ARRAY_CONSTRUCTORS_SWITCH(Type, type, TYPE, Ctype) \
+  case TYPE##_TYPED_ARRAY_CONSTRUCTOR_TYPE:
+      TYPED_ARRAYS(TYPED_ARRAY_CONSTRUCTORS_SWITCH)
+#undef TYPED_ARRAY_CONSTRUCTORS_SWITCH
+      return CALL_APPLY(JSFunction);
 #if V8_ENABLE_WEBASSEMBLY
     case WASM_INSTANCE_OBJECT_TYPE:
       return CALL_APPLY(WasmInstanceObject);
@@ -1390,12 +1237,16 @@ auto BodyDescriptorApply(InstanceType type, Args&&... args) {
       return CALL_APPLY(HeapNumber);
     case BYTE_ARRAY_TYPE:
       return CALL_APPLY(ByteArray);
+    case EXTERNAL_POINTER_ARRAY_TYPE:
+      return CALL_APPLY(ExternalPointerArray);
     case BIGINT_TYPE:
       return CALL_APPLY(BigInt);
     case ALLOCATION_SITE_TYPE:
       return CALL_APPLY(AllocationSite);
     case ODDBALL_TYPE:
       return CALL_APPLY(Oddball);
+    case HOLE_TYPE:
+      return CALL_APPLY(Hole);
 
 #define MAKE_STRUCT_CASE(TYPE, Name, name) \
   case TYPE:                               \
@@ -1444,45 +1295,49 @@ void HeapObject::IterateFast(PtrComprCageBase cage_base, ObjectVisitor* v) {
 }
 
 template <typename ObjectVisitor>
-void HeapObject::IterateFast(Map map, int object_size, ObjectVisitor* v) {
+void HeapObject::IterateFast(Tagged<Map> map, ObjectVisitor* v) {
+  v->VisitMapPointer(*this);
+  IterateBodyFast(map, SizeFromMap(map), v);
+}
+
+template <typename ObjectVisitor>
+void HeapObject::IterateFast(Tagged<Map> map, int object_size,
+                             ObjectVisitor* v) {
   v->VisitMapPointer(*this);
   IterateBodyFast(map, object_size, v);
 }
 
 template <typename ObjectVisitor>
 void HeapObject::IterateBodyFast(PtrComprCageBase cage_base, ObjectVisitor* v) {
-  Map m = map(cage_base);
+  Tagged<Map> m = map(cage_base);
   IterateBodyFast(m, SizeFromMap(m), v);
 }
 
 struct CallIterateBody {
   template <typename BodyDescriptor, typename ObjectVisitor>
-  static void apply(Map map, HeapObject obj, int object_size,
+  static void apply(Tagged<Map> map, Tagged<HeapObject> obj, int object_size,
                     ObjectVisitor* v) {
     BodyDescriptor::IterateBody(map, obj, object_size, v);
   }
 };
 
 template <typename ObjectVisitor>
-void HeapObject::IterateBodyFast(Map map, int object_size, ObjectVisitor* v) {
-  BodyDescriptorApply<CallIterateBody>(map.instance_type(), map, *this,
+void HeapObject::IterateBodyFast(Tagged<Map> map, int object_size,
+                                 ObjectVisitor* v) {
+  BodyDescriptorApply<CallIterateBody>(map->instance_type(), map, *this,
                                        object_size, v);
 }
 
 class EphemeronHashTable::BodyDescriptor final : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return (offset >= EphemeronHashTable::kHeaderSize);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     int entries_start = EphemeronHashTable::kHeaderSize +
                         EphemeronHashTable::kElementsStartIndex * kTaggedSize;
     IteratePointers(obj, EphemeronHashTable::kHeaderSize, entries_start, v);
-    EphemeronHashTable table = EphemeronHashTable::unchecked_cast(obj);
-    for (InternalIndex i : table.IterateEntries()) {
+    Tagged<EphemeronHashTable> table = EphemeronHashTable::unchecked_cast(obj);
+    for (InternalIndex i : table->IterateEntries()) {
       const int key_index = EphemeronHashTable::EntryToIndex(i);
       const int value_index = EphemeronHashTable::EntryToValueIndex(i);
       IterateEphemeron(obj, i.as_int(), OffsetOfElementAt(key_index),
@@ -1490,8 +1345,8 @@ class EphemeronHashTable::BodyDescriptor final : public BodyDescriptorBase {
     }
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
-    return object.SizeFromMap(map);
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return object->SizeFromMap(map);
   }
 };
 
@@ -1504,25 +1359,23 @@ class AccessorInfo::BodyDescriptor final : public BodyDescriptorBase {
   static_assert(AccessorInfo::kSetterOffset < AccessorInfo::kFlagsOffset);
   static_assert(AccessorInfo::kFlagsOffset < AccessorInfo::kSize);
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset < AccessorInfo::kEndOfStrongFieldsOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, HeapObject::kHeaderSize,
                     AccessorInfo::kEndOfStrongFieldsOffset, v);
+    v->VisitExternalPointer(obj,
+                            obj->RawExternalPointerField(
+                                AccessorInfo::kMaybeRedirectedGetterOffset),
+                            kAccessorInfoGetterTag);
     v->VisitExternalPointer(
-        obj,
-        obj.RawExternalPointerField(AccessorInfo::kMaybeRedirectedGetterOffset),
-        kAccessorInfoGetterTag);
-    v->VisitExternalPointer(
-        obj, obj.RawExternalPointerField(AccessorInfo::kSetterOffset),
+        obj, obj->RawExternalPointerField(AccessorInfo::kSetterOffset),
         kAccessorInfoSetterTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return kSize;
+  }
 };
 
 class CallHandlerInfo::BodyDescriptor final : public BodyDescriptorBase {
@@ -1530,23 +1383,21 @@ class CallHandlerInfo::BodyDescriptor final : public BodyDescriptorBase {
   static_assert(CallHandlerInfo::kEndOfStrongFieldsOffset ==
                 CallHandlerInfo::kMaybeRedirectedCallbackOffset);
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset < CallHandlerInfo::kEndOfStrongFieldsOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, HeapObject::kHeaderSize,
                     CallHandlerInfo::kEndOfStrongFieldsOffset, v);
     v->VisitExternalPointer(
         obj,
-        obj.RawExternalPointerField(
+        obj->RawExternalPointerField(
             CallHandlerInfo::kMaybeRedirectedCallbackOffset),
         kCallHandlerInfoCallbackTag);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return kSize;
+  }
 };
 
 #include "torque-generated/objects-body-descriptors-inl.inc"
diff --git a/deps/v8/src/objects/objects-body-descriptors.h b/deps/v8/src/objects/objects-body-descriptors.h
index 9c863a065f8f6a..eaeca1e5a3b782 100644
--- a/deps/v8/src/objects/objects-body-descriptors.h
+++ b/deps/v8/src/objects/objects-body-descriptors.h
@@ -15,14 +15,7 @@ namespace internal {
 //
 // Each BodyDescriptor subclass must provide the following methods:
 //
-// 1) Returns true if the object contains a tagged value at given offset.
-//    It is used for invalid slots filtering. If the offset points outside
-//    of the object or to the map word, the result is UNDEFINED (!!!).
-//
-//   static bool IsValidSlot(Map map, HeapObject obj, int offset);
-//
-//
-// 2) Iterate object's body using stateful object visitor.
+// 1) Iterate object's body using stateful object visitor.
 //
 //   template <typename ObjectVisitor>
 //   static inline void IterateBody(Map map, HeapObject obj, int object_size,
@@ -30,46 +23,53 @@ namespace internal {
 class BodyDescriptorBase {
  public:
   template <typename ObjectVisitor>
-  static inline void IteratePointers(HeapObject obj, int start_offset,
+  static inline void IteratePointers(Tagged<HeapObject> obj, int start_offset,
                                      int end_offset, ObjectVisitor* v);
 
   template <typename ObjectVisitor>
-  static inline void IteratePointer(HeapObject obj, int offset,
+  static inline void IteratePointer(Tagged<HeapObject> obj, int offset,
                                     ObjectVisitor* v);
 
   template <typename ObjectVisitor>
-  static inline void IterateCustomWeakPointers(HeapObject obj, int start_offset,
-                                               int end_offset,
+  static inline void IterateCustomWeakPointers(Tagged<HeapObject> obj,
+                                               int start_offset, int end_offset,
                                                ObjectVisitor* v);
 
   template <typename ObjectVisitor>
-  static inline void IterateCustomWeakPointer(HeapObject obj, int offset,
-                                              ObjectVisitor* v);
+  static inline void IterateCustomWeakPointer(Tagged<HeapObject> obj,
+                                              int offset, ObjectVisitor* v);
 
   template <typename ObjectVisitor>
-  static inline void IterateEphemeron(HeapObject obj, int index, int key_offset,
-                                      int value_offset, ObjectVisitor* v);
+  static inline void IterateEphemeron(Tagged<HeapObject> obj, int index,
+                                      int key_offset, int value_offset,
+                                      ObjectVisitor* v);
 
   template <typename ObjectVisitor>
-  static inline void IterateMaybeWeakPointers(HeapObject obj, int start_offset,
-                                              int end_offset, ObjectVisitor* v);
+  static inline void IterateMaybeWeakPointers(Tagged<HeapObject> obj,
+                                              int start_offset, int end_offset,
+                                              ObjectVisitor* v);
 
   template <typename ObjectVisitor>
-  static inline void IterateMaybeWeakPointer(HeapObject obj, int offset,
+  static inline void IterateMaybeWeakPointer(Tagged<HeapObject> obj, int offset,
                                              ObjectVisitor* v);
 
- protected:
-  // Returns true for all header and embedder fields.
-  static inline bool IsValidJSObjectSlotImpl(Map map, HeapObject obj,
-                                             int offset);
+  // Visits a field that contains either an indirect pointer (if the sandbox is
+  // enabled) or a regular/tagged pointer (otherwise).
+  template <typename ObjectVisitor>
+  static void IterateMaybeIndirectPointer(Tagged<HeapObject> obj, int offset,
+                                          ObjectVisitor* visitor,
+                                          IndirectPointerMode mode);
 
+ protected:
   // Returns true for all header and embedder fields.
-  static inline bool IsValidEmbedderJSObjectSlotImpl(Map map, HeapObject obj,
+  static inline bool IsValidEmbedderJSObjectSlotImpl(Tagged<Map> map,
+                                                     Tagged<HeapObject> obj,
                                                      int offset);
 
   // Treats all header and embedder fields in the range as tagged.
   template <typename ObjectVisitor>
-  static inline void IterateJSObjectBodyImpl(Map map, HeapObject obj,
+  static inline void IterateJSObjectBodyImpl(Tagged<Map> map,
+                                             Tagged<HeapObject> obj,
                                              int start_offset, int end_offset,
                                              ObjectVisitor* v);
 };
@@ -83,23 +83,20 @@ class FixedRangeBodyDescriptor : public BodyDescriptorBase {
   static const int kStartOffset = start_offset;
   static const int kEndOffset = end_offset;
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return offset >= kStartOffset && offset < kEndOffset;
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 ObjectVisitor* v) {
     IteratePointers(obj, start_offset, end_offset, v);
   }
 
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IterateBody(map, obj, v);
   }
 
  private:
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     // Has to be implemented by the subclass.
     UNREACHABLE();
   }
@@ -114,7 +111,9 @@ class FixedBodyDescriptor
     : public FixedRangeBodyDescriptor<start_offset, end_offset> {
  public:
   static const int kSize = size;
-  static inline int SizeOf(Map map, HeapObject object) { return kSize; }
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
+    return kSize;
+  }
 };
 
 // This class describes a body of an object in which all pointer fields are
@@ -125,18 +124,14 @@ class SuffixRangeBodyDescriptor : public BodyDescriptorBase {
  public:
   static const int kStartOffset = start_offset;
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return (offset >= kStartOffset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IteratePointers(obj, start_offset, object_size, v);
   }
 
  private:
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     // Has to be implemented by the subclass.
     UNREACHABLE();
   }
@@ -149,7 +144,7 @@ class SuffixRangeBodyDescriptor : public BodyDescriptorBase {
 template <int start_offset>
 class FlexibleBodyDescriptor : public SuffixRangeBodyDescriptor<start_offset> {
  public:
-  static inline int SizeOf(Map map, HeapObject object);
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object);
 };
 
 // A forward-declacable descriptor body alias for most of the Struct successors.
@@ -166,18 +161,14 @@ class SuffixRangeWeakBodyDescriptor : public BodyDescriptorBase {
  public:
   static const int kStartOffset = start_offset;
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return (offset >= kStartOffset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     IterateMaybeWeakPointers(obj, start_offset, object_size, v);
   }
 
  private:
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     // Has to be implemented by the subclass.
     UNREACHABLE();
   }
@@ -191,20 +182,18 @@ template <int start_offset>
 class FlexibleWeakBodyDescriptor
     : public SuffixRangeWeakBodyDescriptor<start_offset> {
  public:
-  static inline int SizeOf(Map map, HeapObject object);
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object);
 };
 
 // This class describes a body of an object without any pointers.
 class DataOnlyBodyDescriptor : public BodyDescriptorBase {
  public:
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) { return false; }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {}
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {}
 
  private:
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     // Has to be implemented by the subclass.
     UNREACHABLE();
   }
@@ -223,25 +212,21 @@ class SubclassBodyDescriptor final : public BodyDescriptorBase {
   static_assert(ParentBodyDescriptor::kSize <=
                 ChildBodyDescriptor::kStartOffset);
 
-  static bool IsValidSlot(Map map, HeapObject obj, int offset) {
-    return ParentBodyDescriptor::IsValidSlot(map, obj, offset) ||
-           ChildBodyDescriptor::IsValidSlot(map, obj, offset);
-  }
-
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 ObjectVisitor* v) {
     ParentBodyDescriptor::IterateBody(map, obj, v);
     ChildBodyDescriptor::IterateBody(map, obj, v);
   }
 
   template <typename ObjectVisitor>
-  static inline void IterateBody(Map map, HeapObject obj, int object_size,
-                                 ObjectVisitor* v) {
+  static inline void IterateBody(Tagged<Map> map, Tagged<HeapObject> obj,
+                                 int object_size, ObjectVisitor* v) {
     ParentBodyDescriptor::IterateBody(map, obj, object_size, v);
     ChildBodyDescriptor::IterateBody(map, obj, object_size, v);
   }
 
-  static inline int SizeOf(Map map, HeapObject object) {
+  static inline int SizeOf(Tagged<Map> map, Tagged<HeapObject> object) {
     // The child should know its full size.
     return ChildBodyDescriptor::SizeOf(map, object);
   }
diff --git a/deps/v8/src/objects/objects-definitions.h b/deps/v8/src/objects/objects-definitions.h
index 1a0a7ad670c248..935c94803e65c2 100644
--- a/deps/v8/src/objects/objects-definitions.h
+++ b/deps/v8/src/objects/objects-definitions.h
@@ -32,28 +32,29 @@ namespace internal {
 // HeapObject::Size, HeapObject::IterateBody, the typeof operator, and
 // Object::IsString.
 #define INSTANCE_TYPE_LIST_BASE(V)                       \
-  V(INTERNALIZED_STRING_TYPE)                            \
-  V(EXTERNAL_INTERNALIZED_STRING_TYPE)                   \
-  V(ONE_BYTE_INTERNALIZED_STRING_TYPE)                   \
-  V(EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE)          \
-  V(UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE)          \
-  V(UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE) \
-  V(STRING_TYPE)                                         \
-  V(CONS_STRING_TYPE)                                    \
-  V(EXTERNAL_STRING_TYPE)                                \
-  V(SLICED_STRING_TYPE)                                  \
-  V(THIN_STRING_TYPE)                                    \
-  V(ONE_BYTE_STRING_TYPE)                                \
+  V(INTERNALIZED_TWO_BYTE_STRING_TYPE)                   \
+  V(EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE)          \
+  V(INTERNALIZED_ONE_BYTE_STRING_TYPE)                   \
+  V(EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE)          \
+  V(UNCACHED_EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE) \
+  V(UNCACHED_EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE) \
+  V(SEQ_TWO_BYTE_STRING_TYPE)                            \
+  V(CONS_TWO_BYTE_STRING_TYPE)                           \
+  V(EXTERNAL_TWO_BYTE_STRING_TYPE)                       \
+  V(SLICED_TWO_BYTE_STRING_TYPE)                         \
+  V(THIN_TWO_BYTE_STRING_TYPE)                           \
+  V(SEQ_ONE_BYTE_STRING_TYPE)                            \
   V(CONS_ONE_BYTE_STRING_TYPE)                           \
   V(EXTERNAL_ONE_BYTE_STRING_TYPE)                       \
   V(SLICED_ONE_BYTE_STRING_TYPE)                         \
-  V(UNCACHED_EXTERNAL_STRING_TYPE)                       \
+  V(THIN_ONE_BYTE_STRING_TYPE)                           \
+  V(UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE)              \
   V(UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE)              \
-  V(SHARED_STRING_TYPE)                                  \
-  V(SHARED_EXTERNAL_STRING_TYPE)                         \
-  V(SHARED_ONE_BYTE_STRING_TYPE)                         \
+  V(SHARED_SEQ_TWO_BYTE_STRING_TYPE)                     \
+  V(SHARED_EXTERNAL_TWO_BYTE_STRING_TYPE)                \
+  V(SHARED_SEQ_ONE_BYTE_STRING_TYPE)                     \
   V(SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE)                \
-  V(SHARED_UNCACHED_EXTERNAL_STRING_TYPE)                \
+  V(SHARED_UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE)       \
   V(SHARED_UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE)
 
 #define INSTANCE_TYPE_LIST(V) \
@@ -63,59 +64,69 @@ namespace internal {
 // Since string types are not consecutive, this macro is used to iterate over
 // them. The order matters for read only heap layout. The maps are placed such
 // that string types map to address ranges of maps.
-#define STRING_TYPE_LIST(V)                                                    \
-  V(STRING_TYPE, kVariableSizeSentinel, string, String)                        \
-  V(ONE_BYTE_STRING_TYPE, kVariableSizeSentinel, one_byte_string,              \
-    OneByteString)                                                             \
-  V(CONS_STRING_TYPE, ConsString::kSize, cons_string, ConsString)              \
-  V(CONS_ONE_BYTE_STRING_TYPE, ConsString::kSize, cons_one_byte_string,        \
-    ConsOneByteString)                                                         \
-  V(SLICED_STRING_TYPE, SlicedString::kSize, sliced_string, SlicedString)      \
-  V(SLICED_ONE_BYTE_STRING_TYPE, SlicedString::kSize, sliced_one_byte_string,  \
-    SlicedOneByteString)                                                       \
-  V(EXTERNAL_STRING_TYPE, ExternalTwoByteString::kSize, external_string,       \
-    ExternalString)                                                            \
-  V(EXTERNAL_ONE_BYTE_STRING_TYPE, ExternalOneByteString::kSize,               \
-    external_one_byte_string, ExternalOneByteString)                           \
-  V(UNCACHED_EXTERNAL_STRING_TYPE, ExternalTwoByteString::kUncachedSize,       \
-    uncached_external_string, UncachedExternalString)                          \
-  V(UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE,                                    \
-    ExternalOneByteString::kUncachedSize, uncached_external_one_byte_string,   \
-    UncachedExternalOneByteString)                                             \
-                                                                               \
-  V(SHARED_EXTERNAL_STRING_TYPE, ExternalTwoByteString::kSize,                 \
-    shared_external_string, SharedExternalString)                              \
-  V(SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE, ExternalOneByteString::kSize,        \
-    shared_external_one_byte_string, SharedExternalOneByteString)              \
-  V(SHARED_UNCACHED_EXTERNAL_STRING_TYPE,                                      \
-    ExternalTwoByteString::kUncachedSize, shared_uncached_external_string,     \
-    SharedUncachedExternalString)                                              \
-  V(SHARED_UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE,                             \
-    ExternalOneByteString::kUncachedSize,                                      \
-    shared_uncached_external_one_byte_string,                                  \
-    SharedUncachedExternalOneByteString)                                       \
-                                                                               \
-  V(EXTERNAL_INTERNALIZED_STRING_TYPE, ExternalTwoByteString::kSize,           \
-    external_internalized_string, ExternalInternalizedString)                  \
-  V(EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE, ExternalOneByteString::kSize,  \
-    external_one_byte_internalized_string, ExternalOneByteInternalizedString)  \
-  V(UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE,                                \
-    ExternalTwoByteString::kUncachedSize,                                      \
-    uncached_external_internalized_string, UncachedExternalInternalizedString) \
-  V(UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE,                       \
-    ExternalOneByteString::kUncachedSize,                                      \
-    uncached_external_one_byte_internalized_string,                            \
-    UncachedExternalOneByteInternalizedString)                                 \
-                                                                               \
-  V(INTERNALIZED_STRING_TYPE, kVariableSizeSentinel, internalized_string,      \
-    InternalizedString)                                                        \
-  V(ONE_BYTE_INTERNALIZED_STRING_TYPE, kVariableSizeSentinel,                  \
-    one_byte_internalized_string, OneByteInternalizedString)                   \
-                                                                               \
-  V(THIN_STRING_TYPE, ThinString::kSize, thin_string, ThinString)              \
-  V(SHARED_STRING_TYPE, kVariableSizeSentinel, shared_string, SharedString)    \
-  V(SHARED_ONE_BYTE_STRING_TYPE, kVariableSizeSentinel,                        \
-    shared_one_byte_string, SharedOneByteString)
+#define STRING_TYPE_LIST(V)                                                   \
+  V(SEQ_TWO_BYTE_STRING_TYPE, kVariableSizeSentinel, seq_two_byte_string,     \
+    SeqTwoByteString)                                                         \
+  V(SEQ_ONE_BYTE_STRING_TYPE, kVariableSizeSentinel, seq_one_byte_string,     \
+    SeqOneByteString)                                                         \
+  V(CONS_TWO_BYTE_STRING_TYPE, ConsString::kSize, cons_two_byte_string,       \
+    ConsTwoByteString)                                                        \
+  V(CONS_ONE_BYTE_STRING_TYPE, ConsString::kSize, cons_one_byte_string,       \
+    ConsOneByteString)                                                        \
+  V(SLICED_TWO_BYTE_STRING_TYPE, SlicedString::kSize, sliced_two_byte_string, \
+    SlicedTwoByteString)                                                      \
+  V(SLICED_ONE_BYTE_STRING_TYPE, SlicedString::kSize, sliced_one_byte_string, \
+    SlicedOneByteString)                                                      \
+  V(EXTERNAL_TWO_BYTE_STRING_TYPE, ExternalTwoByteString::kSize,              \
+    external_two_byte_string, ExternalTwoByteString)                          \
+  V(EXTERNAL_ONE_BYTE_STRING_TYPE, ExternalOneByteString::kSize,              \
+    external_one_byte_string, ExternalOneByteString)                          \
+  V(UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE,                                   \
+    ExternalTwoByteString::kUncachedSize, uncached_external_two_byte_string,  \
+    UncachedExternalTwoByteString)                                            \
+  V(UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE,                                   \
+    ExternalOneByteString::kUncachedSize, uncached_external_one_byte_string,  \
+    UncachedExternalOneByteString)                                            \
+                                                                              \
+  V(SHARED_EXTERNAL_TWO_BYTE_STRING_TYPE, ExternalTwoByteString::kSize,       \
+    shared_external_two_byte_string, SharedExternalTwoByteString)             \
+  V(SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE, ExternalOneByteString::kSize,       \
+    shared_external_one_byte_string, SharedExternalOneByteString)             \
+  V(SHARED_UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE,                            \
+    ExternalTwoByteString::kUncachedSize,                                     \
+    shared_uncached_external_two_byte_string,                                 \
+    SharedUncachedExternalTwoByteString)                                      \
+  V(SHARED_UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE,                            \
+    ExternalOneByteString::kUncachedSize,                                     \
+    shared_uncached_external_one_byte_string,                                 \
+    SharedUncachedExternalOneByteString)                                      \
+                                                                              \
+  V(EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE, ExternalTwoByteString::kSize, \
+    external_internalized_two_byte_string, ExternalInternalizedTwoByteString) \
+  V(EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE, ExternalOneByteString::kSize, \
+    external_internalized_one_byte_string, ExternalInternalizedOneByteString) \
+  V(UNCACHED_EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE,                      \
+    ExternalTwoByteString::kUncachedSize,                                     \
+    uncached_external_internalized_two_byte_string,                           \
+    UncachedExternalInternalizedTwoByteString)                                \
+  V(UNCACHED_EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE,                      \
+    ExternalOneByteString::kUncachedSize,                                     \
+    uncached_external_internalized_one_byte_string,                           \
+    UncachedExternalInternalizedOneByteString)                                \
+                                                                              \
+  V(INTERNALIZED_TWO_BYTE_STRING_TYPE, kVariableSizeSentinel,                 \
+    internalized_two_byte_string, InternalizedTwoByteString)                  \
+  V(INTERNALIZED_ONE_BYTE_STRING_TYPE, kVariableSizeSentinel,                 \
+    internalized_one_byte_string, InternalizedOneByteString)                  \
+                                                                              \
+  V(THIN_TWO_BYTE_STRING_TYPE, ThinString::kSize, thin_two_byte_string,       \
+    ThinTwoByteString)                                                        \
+  V(THIN_ONE_BYTE_STRING_TYPE, ThinString::kSize, thin_one_byte_string,       \
+    ThinOneByteString)                                                        \
+  V(SHARED_SEQ_TWO_BYTE_STRING_TYPE, kVariableSizeSentinel,                   \
+    shared_seq_two_byte_string, SharedSeqTwoByteString)                       \
+  V(SHARED_SEQ_ONE_BYTE_STRING_TYPE, kVariableSizeSentinel,                   \
+    shared_seq_one_byte_string, SharedSeqOneByteString)
 
 // A struct is a simple object a set of object-valued fields.  Including an
 // object type in this causes the compiler to generate most of the boilerplate
diff --git a/deps/v8/src/objects/objects-inl.h b/deps/v8/src/objects/objects-inl.h
index afd86c3856615f..0fa883e3340f43 100644
--- a/deps/v8/src/objects/objects-inl.h
+++ b/deps/v8/src/objects/objects-inl.h
@@ -25,8 +25,10 @@
 #include "src/heap/read-only-heap-inl.h"
 #include "src/numbers/conversions-inl.h"
 #include "src/objects/bigint.h"
+#include "src/objects/deoptimization-data.h"
 #include "src/objects/heap-number-inl.h"
 #include "src/objects/heap-object.h"
+#include "src/objects/hole-inl.h"
 #include "src/objects/js-proxy-inl.h"  // TODO(jkummerow): Drop.
 #include "src/objects/keys.h"
 #include "src/objects/literal-objects.h"
@@ -45,7 +47,9 @@
 #include "src/objects/templates.h"
 #include "src/roots/roots.h"
 #include "src/sandbox/bounded-size-inl.h"
+#include "src/sandbox/code-pointer-inl.h"
 #include "src/sandbox/external-pointer-inl.h"
+#include "src/sandbox/indirect-pointer-inl.h"
 #include "src/sandbox/sandboxed-pointer-inl.h"
 
 // Has to be the last include (doesn't have include guards):
@@ -54,9 +58,9 @@
 namespace v8 {
 namespace internal {
 
-PropertyDetails::PropertyDetails(Smi smi) { value_ = smi.value(); }
+PropertyDetails::PropertyDetails(Tagged<Smi> smi) { value_ = smi.value(); }
 
-Smi PropertyDetails::AsSmi() const {
+Tagged<Smi> PropertyDetails::AsSmi() const {
   // Ensure the upper 2 bits have the same value by sign extending it. This is
   // necessary to be able to use the 31st bit of the property details.
   int value = value_ << 1;
@@ -68,105 +72,123 @@ int PropertyDetails::field_width_in_words() const {
   return 1;
 }
 
-DEF_GETTER(HeapObject, IsClassBoilerplate, bool) {
-  return IsFixedArrayExact(cage_base);
+bool IsTaggedIndex(Tagged<Object> obj) {
+  return IsSmi(obj) && TaggedIndex::IsValid(TaggedIndex(obj.ptr()).value());
 }
 
-bool Object::IsTaggedIndex() const {
-  return IsSmi() && TaggedIndex::IsValid(TaggedIndex(ptr()).value());
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsClassBoilerplate) {
+  return IsFixedArrayExact(obj, cage_base);
 }
 
-bool Object::InSharedHeap() const {
-  return IsHeapObject() && HeapObject::cast(*this).InAnySharedSpace();
+// static
+bool Object::InSharedHeap(Tagged<Object> obj) {
+  return IsHeapObject(obj) && HeapObject::cast(obj).InAnySharedSpace();
 }
 
-bool Object::InWritableSharedSpace() const {
-  return IsHeapObject() && HeapObject::cast(*this).InWritableSharedSpace();
+// static
+bool Object::InWritableSharedSpace(Tagged<Object> obj) {
+  return IsHeapObject(obj) && HeapObject::cast(obj).InWritableSharedSpace();
 }
 
-bool Object::IsJSObjectThatCanBeTrackedAsPrototype() const {
-  return IsHeapObject() &&
-         HeapObject::cast(*this).IsJSObjectThatCanBeTrackedAsPrototype();
+bool IsJSObjectThatCanBeTrackedAsPrototype(Tagged<Object> obj) {
+  return IsHeapObject(obj) &&
+         IsJSObjectThatCanBeTrackedAsPrototype(Tagged<HeapObject>::cast(obj));
 }
 
-#define IS_TYPE_FUNCTION_DEF(type_)                                        \
-  bool Object::Is##type_() const {                                         \
-    return IsHeapObject() && HeapObject::cast(*this).Is##type_();          \
-  }                                                                        \
-  bool Object::Is##type_(PtrComprCageBase cage_base) const {               \
-    return IsHeapObject() && HeapObject::cast(*this).Is##type_(cage_base); \
+#define IS_TYPE_FUNCTION_DEF(type_)                                       \
+  bool Is##type_(Tagged<Object> obj) {                                    \
+    return IsHeapObject(obj) && Is##type_(Tagged<HeapObject>::cast(obj)); \
+  }                                                                       \
+  bool Is##type_(Tagged<Object> obj, PtrComprCageBase cage_base) {        \
+    return IsHeapObject(obj) &&                                           \
+           Is##type_(Tagged<HeapObject>::cast(obj), cage_base);           \
+  }                                                                       \
+  bool Is##type_(HeapObject obj) {                                        \
+    static_assert(kTaggedCanConvertToRawObjects);                         \
+    return Is##type_(Tagged<HeapObject>(obj));                            \
+  }                                                                       \
+  bool Is##type_(HeapObject obj, PtrComprCageBase cage_base) {            \
+    static_assert(kTaggedCanConvertToRawObjects);                         \
+    return Is##type_(Tagged<HeapObject>(obj), cage_base);                 \
   }
 HEAP_OBJECT_TYPE_LIST(IS_TYPE_FUNCTION_DEF)
 IS_TYPE_FUNCTION_DEF(HashTableBase)
 IS_TYPE_FUNCTION_DEF(SmallOrderedHashTable)
 #undef IS_TYPE_FUNCTION_DEF
 
-#define IS_TYPE_FUNCTION_DEF(Type, Value, _)                     \
-  bool Object::Is##Type(Isolate* isolate) const {                \
-    return Is##Type(ReadOnlyRoots(isolate));                     \
-  }                                                              \
-  bool Object::Is##Type(LocalIsolate* isolate) const {           \
-    return Is##Type(ReadOnlyRoots(isolate));                     \
-  }                                                              \
-  bool Object::Is##Type() const {                                \
-    return IsHeapObject() && HeapObject::cast(*this).Is##Type(); \
-  }                                                              \
-  bool HeapObject::Is##Type(Isolate* isolate) const {            \
-    return Object::Is##Type(isolate);                            \
-  }                                                              \
-  bool HeapObject::Is##Type(LocalIsolate* isolate) const {       \
-    return Object::Is##Type(isolate);                            \
-  }                                                              \
-  bool HeapObject::Is##Type(ReadOnlyRoots roots) const {         \
-    return Object::Is##Type(roots);                              \
-  }                                                              \
-  bool HeapObject::Is##Type() const { return Is##Type(GetReadOnlyRoots()); }
+bool IsAnyHole(Tagged<Object> obj, PtrComprCageBase cage_base) {
+  return IsHole(obj, cage_base);
+}
+
+#define IS_TYPE_FUNCTION_DEF(Type, Value, _)                             \
+  bool Is##Type(Tagged<Object> obj, Isolate* isolate) {                  \
+    return Is##Type(obj, ReadOnlyRoots(isolate));                        \
+  }                                                                      \
+  bool Is##Type(Tagged<Object> obj, LocalIsolate* isolate) {             \
+    return Is##Type(obj, ReadOnlyRoots(isolate));                        \
+  }                                                                      \
+  bool Is##Type(Tagged<Object> obj) {                                    \
+    return IsHeapObject(obj) && Is##Type(Tagged<HeapObject>::cast(obj)); \
+  }                                                                      \
+  bool Is##Type(Tagged<HeapObject> obj) {                                \
+    return Is##Type(obj, obj->GetReadOnlyRoots());                       \
+  }                                                                      \
+  bool Is##Type(HeapObject obj) {                                        \
+    static_assert(kTaggedCanConvertToRawObjects);                        \
+    return Is##Type(Tagged<HeapObject>(obj));                            \
+  }
 ODDBALL_LIST(IS_TYPE_FUNCTION_DEF)
+HOLE_LIST(IS_TYPE_FUNCTION_DEF)
 #undef IS_TYPE_FUNCTION_DEF
 
 #if V8_STATIC_ROOTS_BOOL
-#define IS_TYPE_FUNCTION_DEF(Type, Value, CamelName)                       \
-  bool Object::Is##Type(ReadOnlyRoots roots) const {                       \
-    SLOW_DCHECK(CheckObjectComparisonAllowed(ptr(), roots.Value().ptr())); \
-    return V8HeapCompressionScheme::CompressObject(ptr()) ==               \
-           StaticReadOnlyRoot::k##CamelName;                               \
+#define IS_TYPE_FUNCTION_DEF(Type, Value, CamelName)                           \
+  bool Is##Type(Tagged<Object> obj, ReadOnlyRoots roots) {                     \
+    SLOW_DCHECK(CheckObjectComparisonAllowed(obj.ptr(), roots.Value().ptr())); \
+    return V8HeapCompressionScheme::CompressObject(obj.ptr()) ==               \
+           StaticReadOnlyRoot::k##CamelName;                                   \
   }
 #else
-#define IS_TYPE_FUNCTION_DEF(Type, Value, _)         \
-  bool Object::Is##Type(ReadOnlyRoots roots) const { \
-    return (*this) == roots.Value();                 \
+#define IS_TYPE_FUNCTION_DEF(Type, Value, _)               \
+  bool Is##Type(Tagged<Object> obj, ReadOnlyRoots roots) { \
+    return obj == roots.Value();                           \
   }
 #endif
 ODDBALL_LIST(IS_TYPE_FUNCTION_DEF)
+HOLE_LIST(IS_TYPE_FUNCTION_DEF)
 #undef IS_TYPE_FUNCTION_DEF
 
-bool Object::IsNullOrUndefined(Isolate* isolate) const {
-  return IsNullOrUndefined(ReadOnlyRoots(isolate));
+bool IsNullOrUndefined(Tagged<Object> obj, Isolate* isolate) {
+  return IsNullOrUndefined(obj, ReadOnlyRoots(isolate));
+}
+
+bool IsNullOrUndefined(Tagged<Object> obj, LocalIsolate* local_isolate) {
+  return IsNullOrUndefined(obj, ReadOnlyRoots(local_isolate));
 }
 
-bool Object::IsNullOrUndefined(LocalIsolate* local_isolate) const {
-  return IsNullOrUndefined(ReadOnlyRoots(local_isolate));
+bool IsNullOrUndefined(Tagged<Object> obj, ReadOnlyRoots roots) {
+  return IsNull(obj, roots) || IsUndefined(obj, roots);
 }
 
-bool Object::IsNullOrUndefined(ReadOnlyRoots roots) const {
-  return IsNull(roots) || IsUndefined(roots);
+bool IsNullOrUndefined(Tagged<Object> obj) {
+  return IsHeapObject(obj) && IsNullOrUndefined(Tagged<HeapObject>::cast(obj));
 }
 
-bool Object::IsNullOrUndefined() const {
-  return IsHeapObject() && HeapObject::cast(*this).IsNullOrUndefined();
+bool IsNullOrUndefined(Tagged<HeapObject> obj) {
+  return IsNullOrUndefined(obj, obj->GetReadOnlyRoots());
 }
 
-bool Object::IsZero() const { return *this == Smi::zero(); }
+bool IsZero(Tagged<Object> obj) { return obj == Smi::zero(); }
 
-bool Object::IsPublicSymbol() const {
-  return IsSymbol() && !Symbol::cast(*this).is_private();
+bool IsPublicSymbol(Tagged<Object> obj) {
+  return IsSymbol(obj) && !Symbol::cast(obj)->is_private();
 }
-bool Object::IsPrivateSymbol() const {
-  return IsSymbol() && Symbol::cast(*this).is_private();
+bool IsPrivateSymbol(Tagged<Object> obj) {
+  return IsSymbol(obj) && Symbol::cast(obj)->is_private();
 }
 
-bool Object::IsNoSharedNameSentinel() const {
-  return *this == SharedFunctionInfo::kNoSharedNameSentinel;
+bool IsNoSharedNameSentinel(Tagged<Object> obj) {
+  return obj == SharedFunctionInfo::kNoSharedNameSentinel;
 }
 
 template <class T,
@@ -174,7 +196,7 @@ template <class T,
                                    std::is_enum<T>::value) &&
                                       !std::is_floating_point<T>::value,
                                   int>::type>
-T Object::Relaxed_ReadField(size_t offset) const {
+T HeapObject::Relaxed_ReadField(size_t offset) const {
   // Pointer compression causes types larger than kTaggedSize to be
   // unaligned. Atomic loads must be aligned.
   DCHECK_IMPLIES(COMPRESS_POINTERS_BOOL, sizeof(T) <= kTaggedSize);
@@ -188,7 +210,7 @@ template <class T,
                                    std::is_enum<T>::value) &&
                                       !std::is_floating_point<T>::value,
                                   int>::type>
-void Object::Relaxed_WriteField(size_t offset, T value) {
+void HeapObject::Relaxed_WriteField(size_t offset, T value) {
   // Pointer compression causes types larger than kTaggedSize to be
   // unaligned. Atomic stores must be aligned.
   DCHECK_IMPLIES(COMPRESS_POINTERS_BOOL, sizeof(T) <= kTaggedSize);
@@ -198,277 +220,325 @@ void Object::Relaxed_WriteField(size_t offset, T value) {
       static_cast<AtomicT>(value));
 }
 
+// static
+template <typename CompareAndSwapImpl>
+Tagged<Object> HeapObject::SeqCst_CompareAndSwapField(
+    Tagged<Object> expected, Tagged<Object> value,
+    CompareAndSwapImpl compare_and_swap_impl) {
+  Tagged<Object> actual_expected = expected;
+  do {
+    Tagged<Object> old_value = compare_and_swap_impl(actual_expected, value);
+    if (old_value == actual_expected || !IsNumber(old_value) ||
+        !IsNumber(actual_expected)) {
+      return old_value;
+    }
+    if (!Object::SameNumberValue(Object::Number(old_value),
+                                 Object::Number(actual_expected))) {
+      return old_value;
+    }
+    // The pointer comparison failed, but the numbers are equal. This can
+    // happen even if both numbers are HeapNumbers with the same value.
+    // Try again in the next iteration.
+    actual_expected = old_value;
+  } while (true);
+}
+
 bool HeapObject::InAnySharedSpace() const {
-  if (IsReadOnlyHeapObject(*this)) return V8_SHARED_RO_HEAP_BOOL;
-  return InWritableSharedSpace();
+  return Tagged<HeapObject>(*this).InAnySharedSpace();
 }
 
 bool HeapObject::InWritableSharedSpace() const {
-  return BasicMemoryChunk::FromHeapObject(*this)->InWritableSharedSpace();
+  return Tagged<HeapObject>(*this).InWritableSharedSpace();
 }
 
-bool HeapObject::InReadOnlySpace() const { return IsReadOnlyHeapObject(*this); }
+bool HeapObject::InReadOnlySpace() const {
+  return Tagged<HeapObject>(*this).InReadOnlySpace();
+}
 
-bool HeapObject::IsJSObjectThatCanBeTrackedAsPrototype() const {
-  // Do not optimize objects in the shared heap because it is not
-  // threadsafe. Objects in the shared heap have fixed layouts and their maps
-  // never change.
-  return IsJSObject() && !InWritableSharedSpace();
+bool Tagged<HeapObject>::InAnySharedSpace() const {
+  if (IsReadOnlyHeapObject(*this)) return V8_SHARED_RO_HEAP_BOOL;
+  return InWritableSharedSpace();
 }
 
-bool HeapObject::IsNullOrUndefined(Isolate* isolate) const {
-  return IsNullOrUndefined(ReadOnlyRoots(isolate));
+bool Tagged<HeapObject>::InWritableSharedSpace() const {
+  return BasicMemoryChunk::FromHeapObject(*this)->InWritableSharedSpace();
 }
 
-bool HeapObject::IsNullOrUndefined(ReadOnlyRoots roots) const {
-  return Object::IsNullOrUndefined(roots);
+bool Tagged<HeapObject>::InReadOnlySpace() const {
+  return IsReadOnlyHeapObject(*this);
 }
 
-bool HeapObject::IsNullOrUndefined() const {
-  return IsNullOrUndefined(GetReadOnlyRoots());
+bool IsJSObjectThatCanBeTrackedAsPrototype(Tagged<HeapObject> obj) {
+  // Do not optimize objects in the shared heap because it is not
+  // threadsafe. Objects in the shared heap have fixed layouts and their maps
+  // never change.
+  return IsJSObject(obj) && !obj->InWritableSharedSpace();
 }
 
-DEF_GETTER(HeapObject, IsUniqueName, bool) {
-  return IsInternalizedString(cage_base) || IsSymbol(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsUniqueName) {
+  return IsInternalizedString(obj, cage_base) || IsSymbol(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsFunction, bool) {
-  return IsJSFunctionOrBoundFunctionOrWrappedFunction();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsFunction) {
+  return IsJSFunctionOrBoundFunctionOrWrappedFunction(obj);
 }
 
-DEF_GETTER(HeapObject, IsCallable, bool) {
-  return map(cage_base).is_callable();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsCallable) {
+  return obj->map(cage_base)->is_callable();
 }
 
-DEF_GETTER(HeapObject, IsCallableJSProxy, bool) {
-  return IsCallable(cage_base) && IsJSProxy(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsCallableJSProxy) {
+  return IsCallable(obj, cage_base) && IsJSProxy(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsCallableApiObject, bool) {
-  InstanceType type = map(cage_base).instance_type();
-  return IsCallable(cage_base) &&
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsCallableApiObject) {
+  InstanceType type = obj->map(cage_base)->instance_type();
+  return IsCallable(obj, cage_base) &&
          (type == JS_API_OBJECT_TYPE || type == JS_SPECIAL_API_OBJECT_TYPE);
 }
 
-DEF_GETTER(HeapObject, IsNonNullForeign, bool) {
-  return IsForeign(cage_base) &&
-         Foreign::cast(*this).foreign_address() != kNullAddress;
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsNonNullForeign) {
+  return IsForeign(obj, cage_base) &&
+         Foreign::cast(obj)->foreign_address() != kNullAddress;
 }
 
-DEF_GETTER(HeapObject, IsConstructor, bool) {
-  return map(cage_base).is_constructor();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsConstructor) {
+  return obj->map(cage_base)->is_constructor();
 }
 
-DEF_GETTER(HeapObject, IsSourceTextModuleInfo, bool) {
-  return map(cage_base) == GetReadOnlyRoots(cage_base).module_info_map();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsSourceTextModuleInfo) {
+  return obj->map(cage_base) == obj->GetReadOnlyRoots().module_info_map();
 }
 
-DEF_GETTER(HeapObject, IsConsString, bool) {
-  if (!IsString(cage_base)) return false;
-  return StringShape(String::cast(*this).map(cage_base)).IsCons();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsConsString) {
+  if (!IsString(obj, cage_base)) return false;
+  return StringShape(Tagged<String>::cast(obj)->map(cage_base)).IsCons();
 }
 
-DEF_GETTER(HeapObject, IsThinString, bool) {
-  InstanceType type = map(cage_base).instance_type();
-  return type == THIN_STRING_TYPE;
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsThinString) {
+  if (!IsString(obj, cage_base)) return false;
+  return StringShape(String::cast(obj)->map(cage_base)).IsThin();
 }
 
-DEF_GETTER(HeapObject, IsSlicedString, bool) {
-  if (!IsString(cage_base)) return false;
-  return StringShape(String::cast(*this).map(cage_base)).IsSliced();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsSlicedString) {
+  if (!IsString(obj, cage_base)) return false;
+  return StringShape(String::cast(obj)->map(cage_base)).IsSliced();
 }
 
-DEF_GETTER(HeapObject, IsSeqString, bool) {
-  if (!IsString(cage_base)) return false;
-  return StringShape(String::cast(*this).map(cage_base)).IsSequential();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsSeqString) {
+  if (!IsString(obj, cage_base)) return false;
+  return StringShape(String::cast(obj)->map(cage_base)).IsSequential();
 }
 
-DEF_GETTER(HeapObject, IsSeqOneByteString, bool) {
-  if (!IsString(cage_base)) return false;
-  return StringShape(String::cast(*this).map(cage_base)).IsSequentialOneByte();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsSeqOneByteString) {
+  if (!IsString(obj, cage_base)) return false;
+  return StringShape(String::cast(obj)->map(cage_base)).IsSequentialOneByte();
 }
 
-DEF_GETTER(HeapObject, IsSeqTwoByteString, bool) {
-  if (!IsString(cage_base)) return false;
-  return StringShape(String::cast(*this).map(cage_base)).IsSequentialTwoByte();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsSeqTwoByteString) {
+  if (!IsString(obj, cage_base)) return false;
+  return StringShape(String::cast(obj)->map(cage_base)).IsSequentialTwoByte();
 }
 
-DEF_GETTER(HeapObject, IsExternalOneByteString, bool) {
-  if (!IsString(cage_base)) return false;
-  return StringShape(String::cast(*this).map(cage_base)).IsExternalOneByte();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsExternalOneByteString) {
+  if (!IsString(obj, cage_base)) return false;
+  return StringShape(String::cast(obj)->map(cage_base)).IsExternalOneByte();
 }
 
-DEF_GETTER(HeapObject, IsExternalTwoByteString, bool) {
-  if (!IsString(cage_base)) return false;
-  return StringShape(String::cast(*this).map(cage_base)).IsExternalTwoByte();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsExternalTwoByteString) {
+  if (!IsString(obj, cage_base)) return false;
+  return StringShape(String::cast(obj)->map(cage_base)).IsExternalTwoByte();
 }
 
-bool Object::IsNumber() const {
-  if (IsSmi()) return true;
-  HeapObject this_heap_object = HeapObject::cast(*this);
-  PtrComprCageBase cage_base = GetPtrComprCageBase(this_heap_object);
-  return this_heap_object.IsHeapNumber(cage_base);
+bool IsNumber(Tagged<Object> obj) {
+  if (IsSmi(obj)) return true;
+  Tagged<HeapObject> heap_object = Tagged<HeapObject>::cast(obj);
+  PtrComprCageBase cage_base = GetPtrComprCageBase(heap_object);
+  return IsHeapNumber(heap_object, cage_base);
 }
 
-bool Object::IsNumber(PtrComprCageBase cage_base) const {
-  return IsSmi() || IsHeapNumber(cage_base);
+bool IsNumber(Tagged<Object> obj, PtrComprCageBase cage_base) {
+  return obj.IsSmi() || IsHeapNumber(obj, cage_base);
 }
 
-bool Object::IsNumeric() const {
-  if (IsSmi()) return true;
-  HeapObject this_heap_object = HeapObject::cast(*this);
-  PtrComprCageBase cage_base = GetPtrComprCageBase(this_heap_object);
-  return this_heap_object.IsHeapNumber(cage_base) ||
-         this_heap_object.IsBigInt(cage_base);
+bool IsNumeric(Tagged<Object> obj) {
+  if (IsSmi(obj)) return true;
+  Tagged<HeapObject> heap_object = Tagged<HeapObject>::cast(obj);
+  PtrComprCageBase cage_base = GetPtrComprCageBase(heap_object);
+  return IsHeapNumber(heap_object, cage_base) ||
+         IsBigInt(heap_object, cage_base);
 }
 
-bool Object::IsNumeric(PtrComprCageBase cage_base) const {
-  return IsNumber(cage_base) || IsBigInt(cage_base);
+bool IsNumeric(Tagged<Object> obj, PtrComprCageBase cage_base) {
+  return IsNumber(obj, cage_base) || IsBigInt(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsTemplateLiteralObject, bool) {
-  return IsJSArray(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsTemplateLiteralObject) {
+  return IsJSArray(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsArrayList, bool) {
-  return map(cage_base) ==
-         GetReadOnlyRoots(cage_base).unchecked_array_list_map();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsArrayList) {
+  return obj->map(cage_base) ==
+         obj->GetReadOnlyRoots().unchecked_array_list_map();
 }
 
-DEF_GETTER(HeapObject, IsRegExpMatchInfo, bool) {
-  return IsFixedArrayExact(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsRegExpMatchInfo) {
+  return IsFixedArrayExact(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsDeoptimizationData, bool) {
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsDeoptimizationData) {
   // Must be a fixed array.
-  if (!IsFixedArrayExact(cage_base)) return false;
+  if (!IsFixedArrayExact(obj, cage_base)) return false;
 
   // There's no sure way to detect the difference between a fixed array and
   // a deoptimization data array.  Since this is used for asserts we can
   // check that the length is zero or else the fixed size plus a multiple of
   // the entry size.
-  int length = FixedArray::cast(*this).length();
+  int length = FixedArray::cast(obj)->length();
   if (length == 0) return true;
 
   length -= DeoptimizationData::kFirstDeoptEntryIndex;
   return length >= 0 && length % DeoptimizationData::kDeoptEntrySize == 0;
 }
 
-DEF_GETTER(HeapObject, IsHandlerTable, bool) {
-  return IsFixedArrayExact(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsHandlerTable) {
+  return IsFixedArrayExact(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsTemplateList, bool) {
-  if (!IsFixedArrayExact(cage_base)) return false;
-  if (FixedArray::cast(*this).length() < 1) return false;
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsTemplateList) {
+  if (!IsFixedArrayExact(obj, cage_base)) return false;
+  if (FixedArray::cast(obj)->length() < 1) return false;
   return true;
 }
 
-DEF_GETTER(HeapObject, IsDependentCode, bool) {
-  return IsWeakArrayList(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsDependentCode) {
+  return IsWeakArrayList(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsOSROptimizedCodeCache, bool) {
-  return IsWeakFixedArray(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsOSROptimizedCodeCache) {
+  return IsWeakFixedArray(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsStringWrapper, bool) {
-  return IsJSPrimitiveWrapper(cage_base) &&
-         JSPrimitiveWrapper::cast(*this).value().IsString(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsStringWrapper) {
+  return IsJSPrimitiveWrapper(obj, cage_base) &&
+         IsString(JSPrimitiveWrapper::cast(obj)->value(), cage_base);
 }
 
-DEF_GETTER(HeapObject, IsBooleanWrapper, bool) {
-  return IsJSPrimitiveWrapper(cage_base) &&
-         JSPrimitiveWrapper::cast(*this).value().IsBoolean(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsBooleanWrapper) {
+  return IsJSPrimitiveWrapper(obj, cage_base) &&
+         IsBoolean(JSPrimitiveWrapper::cast(obj)->value(), cage_base);
 }
 
-DEF_GETTER(HeapObject, IsScriptWrapper, bool) {
-  return IsJSPrimitiveWrapper(cage_base) &&
-         JSPrimitiveWrapper::cast(*this).value().IsScript(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsScriptWrapper) {
+  return IsJSPrimitiveWrapper(obj, cage_base) &&
+         IsScript(JSPrimitiveWrapper::cast(obj)->value(), cage_base);
 }
 
-DEF_GETTER(HeapObject, IsNumberWrapper, bool) {
-  return IsJSPrimitiveWrapper(cage_base) &&
-         JSPrimitiveWrapper::cast(*this).value().IsNumber(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsNumberWrapper) {
+  return IsJSPrimitiveWrapper(obj, cage_base) &&
+         IsNumber(JSPrimitiveWrapper::cast(obj)->value(), cage_base);
 }
 
-DEF_GETTER(HeapObject, IsBigIntWrapper, bool) {
-  return IsJSPrimitiveWrapper(cage_base) &&
-         JSPrimitiveWrapper::cast(*this).value().IsBigInt(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsBigIntWrapper) {
+  return IsJSPrimitiveWrapper(obj, cage_base) &&
+         IsBigInt(JSPrimitiveWrapper::cast(obj)->value(), cage_base);
 }
 
-DEF_GETTER(HeapObject, IsSymbolWrapper, bool) {
-  return IsJSPrimitiveWrapper(cage_base) &&
-         JSPrimitiveWrapper::cast(*this).value().IsSymbol(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsSymbolWrapper) {
+  return IsJSPrimitiveWrapper(obj, cage_base) &&
+         IsSymbol(JSPrimitiveWrapper::cast(obj)->value(), cage_base);
 }
 
-DEF_GETTER(HeapObject, IsStringSet, bool) { return IsHashTable(cage_base); }
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsStringSet) {
+  return IsHashTable(obj, cage_base);
+}
 
-DEF_GETTER(HeapObject, IsObjectHashSet, bool) { return IsHashTable(cage_base); }
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsObjectHashSet) {
+  return IsHashTable(obj, cage_base);
+}
 
-DEF_GETTER(HeapObject, IsCompilationCacheTable, bool) {
-  return IsHashTable(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsCompilationCacheTable) {
+  return IsHashTable(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsMapCache, bool) { return IsHashTable(cage_base); }
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsMapCache) {
+  return IsHashTable(obj, cage_base);
+}
 
-DEF_GETTER(HeapObject, IsObjectHashTable, bool) {
-  return IsHashTable(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsObjectHashTable) {
+  return IsHashTable(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsObjectTwoHashTable, bool) {
-  return IsHashTable(cage_base);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsObjectTwoHashTable) {
+  return IsHashTable(obj, cage_base);
 }
 
-DEF_GETTER(HeapObject, IsHashTableBase, bool) { return IsHashTable(cage_base); }
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsHashTableBase) {
+  return IsHashTable(obj, cage_base);
+}
 
-bool Object::IsPrimitive() const {
-  if (IsSmi()) return true;
-  HeapObject this_heap_object = HeapObject::cast(*this);
+// static
+bool IsPrimitive(Tagged<Object> obj) {
+  if (obj.IsSmi()) return true;
+  Tagged<HeapObject> this_heap_object = HeapObject::cast(obj);
   PtrComprCageBase cage_base = GetPtrComprCageBase(this_heap_object);
-  return this_heap_object.map(cage_base).IsPrimitiveMap();
+  return IsPrimitiveMap(this_heap_object->map(cage_base));
 }
 
-bool Object::IsPrimitive(PtrComprCageBase cage_base) const {
-  return IsSmi() || HeapObject::cast(*this).map(cage_base).IsPrimitiveMap();
+// static
+bool IsPrimitive(Tagged<Object> obj, PtrComprCageBase cage_base) {
+  return obj.IsSmi() || IsPrimitiveMap(HeapObject::cast(obj)->map(cage_base));
 }
 
 // static
 Maybe<bool> Object::IsArray(Handle<Object> object) {
-  if (object->IsSmi()) return Just(false);
+  if (IsSmi(*object)) return Just(false);
   Handle<HeapObject> heap_object = Handle<HeapObject>::cast(object);
-  if (heap_object->IsJSArray()) return Just(true);
-  if (!heap_object->IsJSProxy()) return Just(false);
+  if (IsJSArray(*heap_object)) return Just(true);
+  if (!IsJSProxy(*heap_object)) return Just(false);
   return JSProxy::IsArray(Handle<JSProxy>::cast(object));
 }
 
-DEF_GETTER(HeapObject, IsUndetectable, bool) {
-  return map(cage_base).is_undetectable();
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsUndetectable) {
+  return obj->map(cage_base)->is_undetectable();
 }
 
-DEF_GETTER(HeapObject, IsAccessCheckNeeded, bool) {
-  if (IsJSGlobalProxy(cage_base)) {
-    const JSGlobalProxy proxy = JSGlobalProxy::cast(*this);
-    JSGlobalObject global = proxy.GetIsolate()->context().global_object();
-    return proxy.IsDetachedFrom(global);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsAccessCheckNeeded) {
+  if (IsJSGlobalProxy(obj, cage_base)) {
+    const Tagged<JSGlobalProxy> proxy = JSGlobalProxy::cast(obj);
+    Tagged<JSGlobalObject> global =
+        proxy->GetIsolate()->context()->global_object();
+    return proxy->IsDetachedFrom(global);
   }
-  return map(cage_base).is_access_check_needed();
-}
-
-#define MAKE_STRUCT_PREDICATE(NAME, Name, name)                           \
-  bool Object::Is##Name() const {                                         \
-    return IsHeapObject() && HeapObject::cast(*this).Is##Name();          \
-  }                                                                       \
-  bool Object::Is##Name(PtrComprCageBase cage_base) const {               \
-    return IsHeapObject() && HeapObject::cast(*this).Is##Name(cage_base); \
+  return obj->map(cage_base)->is_access_check_needed();
+}
+
+#define MAKE_STRUCT_PREDICATE(NAME, Name, name)                          \
+  bool Is##Name(Tagged<Object> obj) {                                    \
+    return IsHeapObject(obj) && Is##Name(Tagged<HeapObject>::cast(obj)); \
+  }                                                                      \
+  bool Is##Name(Tagged<Object> obj, PtrComprCageBase cage_base) {        \
+    return IsHeapObject(obj) &&                                          \
+           Is##Name(Tagged<HeapObject>::cast(obj), cage_base);           \
+  }                                                                      \
+  bool Is##Name(HeapObject obj) {                                        \
+    static_assert(kTaggedCanConvertToRawObjects);                        \
+    return Is##Name(Tagged<HeapObject>(obj));                            \
+  }                                                                      \
+  bool Is##Name(HeapObject obj, PtrComprCageBase cage_base) {            \
+    static_assert(kTaggedCanConvertToRawObjects);                        \
+    return Is##Name(Tagged<HeapObject>(obj), cage_base);                 \
   }
+// static
 STRUCT_LIST(MAKE_STRUCT_PREDICATE)
 #undef MAKE_STRUCT_PREDICATE
 
-double Object::Number() const {
-  DCHECK(IsNumber());
-  return IsSmi() ? static_cast<double>(Smi(this->ptr()).value())
-                 : HeapNumber::unchecked_cast(*this).value();
+// static
+double Object::Number(Tagged<Object> obj) {
+  DCHECK(IsNumber(obj));
+  return IsSmi(obj)
+             ? static_cast<double>(Tagged<Smi>::unchecked_cast(obj).value())
+             : HeapNumber::unchecked_cast(obj)->value();
 }
 
 // static
@@ -481,13 +551,14 @@ bool Object::SameNumberValue(double value1, double value2) {
   return (std::signbit(value1) == std::signbit(value2));
 }
 
-bool Object::IsNaN() const {
-  return this->IsHeapNumber() && std::isnan(HeapNumber::cast(*this).value());
+// static
+bool IsNaN(Tagged<Object> obj) {
+  return IsHeapNumber(obj) && std::isnan(HeapNumber::cast(obj)->value());
 }
 
-bool Object::IsMinusZero() const {
-  return this->IsHeapNumber() &&
-         i::IsMinusZero(HeapNumber::cast(*this).value());
+// static
+bool IsMinusZero(Tagged<Object> obj) {
+  return IsHeapNumber(obj) && i::IsMinusZero(HeapNumber::cast(obj)->value());
 }
 
 OBJECT_CONSTRUCTORS_IMPL(BigIntBase, PrimitiveHeapObject)
@@ -500,70 +571,79 @@ OBJECT_CONSTRUCTORS_IMPL(FreshlyAllocatedBigInt, BigIntBase)
 CAST_ACCESSOR(BigIntBase)
 CAST_ACCESSOR(BigInt)
 
-bool Object::HasValidElements() {
+// static
+bool Object::HasValidElements(Tagged<Object> obj) {
   // Dictionary is covered under FixedArray. ByteArray is used
   // for the JSTypedArray backing stores.
-  return IsFixedArray() || IsFixedDoubleArray() || IsByteArray();
+  return IsFixedArray(obj) || IsFixedDoubleArray(obj) || IsByteArray(obj);
 }
 
-bool Object::FilterKey(PropertyFilter filter) {
-  DCHECK(!IsPropertyCell());
+// static
+bool Object::FilterKey(Tagged<Object> obj, PropertyFilter filter) {
+  DCHECK(!IsPropertyCell(obj));
   if (filter == PRIVATE_NAMES_ONLY) {
-    if (!IsSymbol()) return true;
-    return !Symbol::cast(*this).is_private_name();
-  } else if (IsSymbol()) {
+    if (!IsSymbol(obj)) return true;
+    return !Symbol::cast(obj)->is_private_name();
+  } else if (IsSymbol(obj)) {
     if (filter & SKIP_SYMBOLS) return true;
 
-    if (Symbol::cast(*this).is_private()) return true;
+    if (Symbol::cast(obj)->is_private()) return true;
   } else {
     if (filter & SKIP_STRINGS) return true;
   }
   return false;
 }
 
-Representation Object::OptimalRepresentation(PtrComprCageBase cage_base) const {
-  if (IsSmi()) {
+// static
+Representation Object::OptimalRepresentation(Tagged<Object> obj,
+                                             PtrComprCageBase cage_base) {
+  if (IsSmi(obj)) {
     return Representation::Smi();
   }
-  HeapObject heap_object = HeapObject::cast(*this);
-  if (heap_object.IsHeapNumber(cage_base)) {
+  Tagged<HeapObject> heap_object = HeapObject::cast(obj);
+  if (IsHeapNumber(heap_object, cage_base)) {
     return Representation::Double();
-  } else if (heap_object.IsUninitialized(
-                 heap_object.GetReadOnlyRoots(cage_base))) {
+  } else if (IsUninitialized(heap_object,
+                             heap_object->GetReadOnlyRoots(cage_base))) {
     return Representation::None();
   }
   return Representation::HeapObject();
 }
 
-ElementsKind Object::OptimalElementsKind(PtrComprCageBase cage_base) const {
-  if (IsSmi()) return PACKED_SMI_ELEMENTS;
-  if (IsNumber(cage_base)) return PACKED_DOUBLE_ELEMENTS;
+// static
+ElementsKind Object::OptimalElementsKind(Tagged<Object> obj,
+                                         PtrComprCageBase cage_base) {
+  if (IsSmi(obj)) return PACKED_SMI_ELEMENTS;
+  if (IsNumber(obj, cage_base)) return PACKED_DOUBLE_ELEMENTS;
   return PACKED_ELEMENTS;
 }
 
-bool Object::FitsRepresentation(Representation representation,
-                                bool allow_coercion) const {
+// static
+bool Object::FitsRepresentation(Tagged<Object> obj,
+                                Representation representation,
+                                bool allow_coercion) {
   if (representation.IsSmi()) {
-    return IsSmi();
+    return IsSmi(obj);
   } else if (representation.IsDouble()) {
-    return allow_coercion ? IsNumber() : IsHeapNumber();
+    return allow_coercion ? IsNumber(obj) : IsHeapNumber(obj);
   } else if (representation.IsHeapObject()) {
-    return IsHeapObject();
+    return IsHeapObject(obj);
   } else if (representation.IsNone()) {
     return false;
   }
   return true;
 }
 
-bool Object::ToUint32(uint32_t* value) const {
-  if (IsSmi()) {
-    int num = Smi::ToInt(*this);
+// static
+bool Object::ToUint32(Tagged<Object> obj, uint32_t* value) {
+  if (IsSmi(obj)) {
+    int num = Smi::ToInt(obj);
     if (num < 0) return false;
     *value = static_cast<uint32_t>(num);
     return true;
   }
-  if (IsHeapNumber()) {
-    double num = HeapNumber::cast(*this).value();
+  if (IsHeapNumber(obj)) {
+    double num = HeapNumber::cast(obj)->value();
     return DoubleToUint32IfEqualToSelf(num, value);
   }
   return false;
@@ -573,70 +653,72 @@ bool Object::ToUint32(uint32_t* value) const {
 MaybeHandle<JSReceiver> Object::ToObject(Isolate* isolate,
                                          Handle<Object> object,
                                          const char* method_name) {
-  if (object->IsJSReceiver()) return Handle<JSReceiver>::cast(object);
+  if (IsJSReceiver(*object)) return Handle<JSReceiver>::cast(object);
   return ToObjectImpl(isolate, object, method_name);
 }
 
 // static
 MaybeHandle<Name> Object::ToName(Isolate* isolate, Handle<Object> input) {
-  if (input->IsName()) return Handle<Name>::cast(input);
+  if (IsName(*input)) return Handle<Name>::cast(input);
   return ConvertToName(isolate, input);
 }
 
 // static
 MaybeHandle<Object> Object::ToPropertyKey(Isolate* isolate,
                                           Handle<Object> value) {
-  if (value->IsSmi() || HeapObject::cast(*value).IsName()) return value;
+  if (IsSmi(*value) || IsName(HeapObject::cast(*value))) return value;
   return ConvertToPropertyKey(isolate, value);
 }
 
 // static
 MaybeHandle<Object> Object::ToPrimitive(Isolate* isolate, Handle<Object> input,
                                         ToPrimitiveHint hint) {
-  if (input->IsPrimitive()) return input;
+  if (IsPrimitive(*input)) return input;
   return JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(input),
                                  hint);
 }
 
 // static
 MaybeHandle<Object> Object::ToNumber(Isolate* isolate, Handle<Object> input) {
-  if (input->IsNumber()) return input;  // Shortcut.
+  if (IsNumber(*input)) return input;  // Shortcut.
   return ConvertToNumberOrNumeric(isolate, input, Conversion::kToNumber);
 }
 
 // static
 MaybeHandle<Object> Object::ToNumeric(Isolate* isolate, Handle<Object> input) {
-  if (input->IsNumber() || input->IsBigInt()) return input;  // Shortcut.
+  if (IsNumber(*input) || IsBigInt(*input)) return input;  // Shortcut.
   return ConvertToNumberOrNumeric(isolate, input, Conversion::kToNumeric);
 }
 
 // static
 MaybeHandle<Object> Object::ToInteger(Isolate* isolate, Handle<Object> input) {
-  if (input->IsSmi()) return input;
+  if (IsSmi(*input)) return input;
   return ConvertToInteger(isolate, input);
 }
 
 // static
 MaybeHandle<Object> Object::ToInt32(Isolate* isolate, Handle<Object> input) {
-  if (input->IsSmi()) return input;
+  if (IsSmi(*input)) return input;
   return ConvertToInt32(isolate, input);
 }
 
 // static
 MaybeHandle<Object> Object::ToUint32(Isolate* isolate, Handle<Object> input) {
-  if (input->IsSmi()) return handle(Smi::cast(*input).ToUint32Smi(), isolate);
+  if (IsSmi(*input)) {
+    return handle(Smi::ToUint32Smi(Smi::cast(*input)), isolate);
+  }
   return ConvertToUint32(isolate, input);
 }
 
 // static
 MaybeHandle<String> Object::ToString(Isolate* isolate, Handle<Object> input) {
-  if (input->IsString()) return Handle<String>::cast(input);
+  if (IsString(*input)) return Handle<String>::cast(input);
   return ConvertToString(isolate, input);
 }
 
 // static
 MaybeHandle<Object> Object::ToLength(Isolate* isolate, Handle<Object> input) {
-  if (input->IsSmi()) {
+  if (IsSmi(*input)) {
     int value = std::max(Smi::ToInt(*input), 0);
     return handle(Smi::FromInt(value), isolate);
   }
@@ -646,7 +728,7 @@ MaybeHandle<Object> Object::ToLength(Isolate* isolate, Handle<Object> input) {
 // static
 MaybeHandle<Object> Object::ToIndex(Isolate* isolate, Handle<Object> input,
                                     MessageTemplate error_index) {
-  if (input->IsSmi() && Smi::ToInt(*input) >= 0) return input;
+  if (IsSmi(*input) && Smi::ToInt(*input) >= 0) return input;
   return ConvertToIndex(isolate, input, error_index);
 }
 
@@ -673,49 +755,80 @@ MaybeHandle<Object> Object::SetElement(Isolate* isolate, Handle<Object> object,
   return value;
 }
 
-Address Object::ReadSandboxedPointerField(size_t offset,
-                                          PtrComprCageBase cage_base) const {
+Address HeapObject::ReadSandboxedPointerField(
+    size_t offset, PtrComprCageBase cage_base) const {
   return i::ReadSandboxedPointerField(field_address(offset), cage_base);
 }
 
-void Object::WriteSandboxedPointerField(size_t offset,
-                                        PtrComprCageBase cage_base,
-                                        Address value) {
+void HeapObject::WriteSandboxedPointerField(size_t offset,
+                                            PtrComprCageBase cage_base,
+                                            Address value) {
   i::WriteSandboxedPointerField(field_address(offset), cage_base, value);
 }
 
-void Object::WriteSandboxedPointerField(size_t offset, Isolate* isolate,
-                                        Address value) {
+void HeapObject::WriteSandboxedPointerField(size_t offset, Isolate* isolate,
+                                            Address value) {
   i::WriteSandboxedPointerField(field_address(offset),
                                 PtrComprCageBase(isolate), value);
 }
 
-size_t Object::ReadBoundedSizeField(size_t offset) const {
+size_t HeapObject::ReadBoundedSizeField(size_t offset) const {
   return i::ReadBoundedSizeField(field_address(offset));
 }
 
-void Object::WriteBoundedSizeField(size_t offset, size_t value) {
+void HeapObject::WriteBoundedSizeField(size_t offset, size_t value) {
   i::WriteBoundedSizeField(field_address(offset), value);
 }
 
 template <ExternalPointerTag tag>
-void Object::InitExternalPointerField(size_t offset, Isolate* isolate,
-                                      Address value) {
+void HeapObject::InitExternalPointerField(size_t offset, Isolate* isolate,
+                                          Address value) {
   i::InitExternalPointerField<tag>(field_address(offset), isolate, value);
 }
 
 template <ExternalPointerTag tag>
-Address Object::ReadExternalPointerField(size_t offset,
-                                         Isolate* isolate) const {
+Address HeapObject::ReadExternalPointerField(size_t offset,
+                                             Isolate* isolate) const {
   return i::ReadExternalPointerField<tag>(field_address(offset), isolate);
 }
 
 template <ExternalPointerTag tag>
-void Object::WriteExternalPointerField(size_t offset, Isolate* isolate,
-                                       Address value) {
+void HeapObject::WriteExternalPointerField(size_t offset, Isolate* isolate,
+                                           Address value) {
   i::WriteExternalPointerField<tag>(field_address(offset), isolate, value);
 }
 
+template <ExternalPointerTag tag>
+void HeapObject::WriteLazilyInitializedExternalPointerField(size_t offset,
+                                                            Isolate* isolate,
+                                                            Address value) {
+  i::WriteLazilyInitializedExternalPointerField<tag>(field_address(offset),
+                                                     isolate, value);
+}
+
+void HeapObject::ResetLazilyInitializedExternalPointerField(size_t offset) {
+  i::ResetLazilyInitializedExternalPointerField(field_address(offset));
+}
+
+Tagged<Object> HeapObject::ReadIndirectPointerField(size_t offset) const {
+  return i::ReadIndirectPointerField(field_address(offset));
+}
+
+void HeapObject::InitCodePointerTableEntryField(size_t offset, Isolate* isolate,
+                                                Tagged<Code> owning_code,
+                                                Address entrypoint) {
+  i::InitCodePointerTableEntryField(field_address(offset), isolate, owning_code,
+                                    entrypoint);
+}
+
+Address HeapObject::ReadCodeEntrypointField(size_t offset) const {
+  return i::ReadCodeEntrypointField(field_address(offset));
+}
+
+void HeapObject::WriteCodeEntrypointField(size_t offset, Address value) {
+  i::WriteCodeEntrypointField(field_address(offset), value);
+}
+
 ObjectSlot HeapObject::RawField(int byte_offset) const {
   return ObjectSlot(field_address(byte_offset));
 }
@@ -724,15 +837,20 @@ MaybeObjectSlot HeapObject::RawMaybeWeakField(int byte_offset) const {
   return MaybeObjectSlot(field_address(byte_offset));
 }
 
-CodeObjectSlot HeapObject::RawCodeField(int byte_offset) const {
-  return CodeObjectSlot(field_address(byte_offset));
+InstructionStreamSlot HeapObject::RawInstructionStreamField(
+    int byte_offset) const {
+  return InstructionStreamSlot(field_address(byte_offset));
 }
 
 ExternalPointerSlot HeapObject::RawExternalPointerField(int byte_offset) const {
   return ExternalPointerSlot(field_address(byte_offset));
 }
 
-MapWord MapWord::FromMap(const Map map) {
+IndirectPointerSlot HeapObject::RawIndirectPointerField(int byte_offset) const {
+  return IndirectPointerSlot(field_address(byte_offset));
+}
+
+MapWord MapWord::FromMap(const Tagged<Map> map) {
   DCHECK(map.is_null() || !MapWord::IsPacked(map.ptr()));
 #ifdef V8_MAP_PACKING
   return MapWord(Pack(map.ptr()));
@@ -741,7 +859,7 @@ MapWord MapWord::FromMap(const Map map) {
 #endif
 }
 
-Map MapWord::ToMap() const {
+Tagged<Map> MapWord::ToMap() const {
 #ifdef V8_MAP_PACKING
   return Map::unchecked_cast(Object(Unpack(value_)));
 #else
@@ -760,8 +878,8 @@ bool MapWord::IsForwardingAddress() const {
 #endif  // V8_EXTERNAL_CODE_SPACE
 }
 
-MapWord MapWord::FromForwardingAddress(HeapObject map_word_host,
-                                       HeapObject object) {
+MapWord MapWord::FromForwardingAddress(Tagged<HeapObject> map_word_host,
+                                       Tagged<HeapObject> object) {
 #ifdef V8_EXTERNAL_CODE_SPACE
   // When external code space is enabled forwarding pointers are encoded as
   // Smi representing a diff from the source object address in kObjectAlignment
@@ -776,7 +894,8 @@ MapWord MapWord::FromForwardingAddress(HeapObject map_word_host,
 #endif  // V8_EXTERNAL_CODE_SPACE
 }
 
-HeapObject MapWord::ToForwardingAddress(HeapObject map_word_host) {
+Tagged<HeapObject> MapWord::ToForwardingAddress(
+    Tagged<HeapObject> map_word_host) {
   DCHECK(IsForwardingAddress());
 #ifdef V8_EXTERNAL_CODE_SPACE
   // When external code space is enabled forwarding pointers are encoded as
@@ -803,7 +922,7 @@ void HeapObject::VerifyMaybeObjectField(Isolate* isolate, int offset) {
 }
 
 void HeapObject::VerifySmiField(int offset) {
-  CHECK(TaggedField<Object>::load(*this, offset).IsSmi());
+  CHECK(IsSmi(TaggedField<Object>::load(*this, offset)));
   static_assert(!COMPRESS_POINTERS_BOOL || kTaggedSize == kInt32Size);
 }
 
@@ -822,7 +941,7 @@ ReadOnlyRoots HeapObject::GetReadOnlyRoots(PtrComprCageBase cage_base) const {
   return GetReadOnlyRoots();
 }
 
-Map HeapObject::map() const {
+Tagged<Map> HeapObject::map() const {
   // This method is never used for objects located in code space
   // (InstructionStream and free space fillers) and thus it is fine to use
   // auto-computed cage base value.
@@ -830,59 +949,64 @@ Map HeapObject::map() const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return HeapObject::map(cage_base);
 }
-Map HeapObject::map(PtrComprCageBase cage_base) const {
+
+Tagged<Map> HeapObject::map(PtrComprCageBase cage_base) const {
   return map_word(cage_base, kRelaxedLoad).ToMap();
 }
 
-void HeapObject::set_map(Map value) {
+void HeapObject::set_map(Tagged<Map> value) {
   set_map<EmitWriteBarrier::kYes>(value, kRelaxedStore,
                                   VerificationMode::kPotentialLayoutChange);
 }
 
-void HeapObject::set_map(Map value, ReleaseStoreTag tag) {
+void HeapObject::set_map(Tagged<Map> value, ReleaseStoreTag tag) {
   set_map<EmitWriteBarrier::kYes>(value, kReleaseStore,
                                   VerificationMode::kPotentialLayoutChange);
 }
 
-void HeapObject::set_map_safe_transition(Map value) {
+void HeapObject::set_map_safe_transition(Tagged<Map> value) {
   set_map<EmitWriteBarrier::kYes>(value, kRelaxedStore,
                                   VerificationMode::kSafeMapTransition);
 }
 
-void HeapObject::set_map_safe_transition(Map value, ReleaseStoreTag tag) {
+void HeapObject::set_map_safe_transition(Tagged<Map> value,
+                                         ReleaseStoreTag tag) {
   set_map<EmitWriteBarrier::kYes>(value, kReleaseStore,
                                   VerificationMode::kSafeMapTransition);
 }
 
-void HeapObject::set_map_safe_transition_no_write_barrier(Map value,
+void HeapObject::set_map_safe_transition_no_write_barrier(Tagged<Map> value,
                                                           RelaxedStoreTag tag) {
   set_map<EmitWriteBarrier::kNo>(value, kRelaxedStore,
                                  VerificationMode::kSafeMapTransition);
 }
 
-void HeapObject::set_map_safe_transition_no_write_barrier(Map value,
+void HeapObject::set_map_safe_transition_no_write_barrier(Tagged<Map> value,
                                                           ReleaseStoreTag tag) {
   set_map<EmitWriteBarrier::kNo>(value, kReleaseStore,
                                  VerificationMode::kSafeMapTransition);
 }
 
 // Unsafe accessor omitting write barrier.
-void HeapObject::set_map_no_write_barrier(Map value, RelaxedStoreTag tag) {
+void HeapObject::set_map_no_write_barrier(Tagged<Map> value,
+                                          RelaxedStoreTag tag) {
   set_map<EmitWriteBarrier::kNo>(value, kRelaxedStore,
                                  VerificationMode::kPotentialLayoutChange);
 }
 
-void HeapObject::set_map_no_write_barrier(Map value, ReleaseStoreTag tag) {
+void HeapObject::set_map_no_write_barrier(Tagged<Map> value,
+                                          ReleaseStoreTag tag) {
   set_map<EmitWriteBarrier::kNo>(value, kReleaseStore,
                                  VerificationMode::kPotentialLayoutChange);
 }
 
 template <HeapObject::EmitWriteBarrier emit_write_barrier, typename MemoryOrder>
-void HeapObject::set_map(Map value, MemoryOrder order, VerificationMode mode) {
+void HeapObject::set_map(Tagged<Map> value, MemoryOrder order,
+                         VerificationMode mode) {
 #if V8_ENABLE_WEBASSEMBLY
   // In {WasmGraphBuilder::SetMap} and {WasmGraphBuilder::LoadMap}, we treat
   // maps as immutable. Therefore we are not allowed to mutate them here.
-  DCHECK(!value.IsWasmStructMap() && !value.IsWasmArrayMap());
+  DCHECK(!IsWasmStructMap(value) && !IsWasmArrayMap(value));
 #endif
   // Object layout changes are currently not supported on background threads.
   // This method might change object layout and therefore can't be used on
@@ -912,19 +1036,25 @@ void HeapObject::set_map(Map value, MemoryOrder order, VerificationMode mode) {
 #endif
 }
 
-void HeapObject::set_map_after_allocation(Map value, WriteBarrierMode mode) {
+void HeapObject::set_map_after_allocation(Tagged<Map> value,
+                                          WriteBarrierMode mode) {
   set_map_word(value, kRelaxedStore);
 #ifndef V8_DISABLE_WRITE_BARRIERS
   if (mode != SKIP_WRITE_BARRIER) {
     DCHECK(!value.is_null());
     CombinedWriteBarrier(*this, map_slot(), value, mode);
   } else {
-    SLOW_DCHECK(!WriteBarrier::IsRequired(*this, value));
+    SLOW_DCHECK(
+        // We allow writes of a null map before root initialisation.
+        value->is_null() ? !GetIsolateFromWritableObject(*this)
+                                ->read_only_heap()
+                                ->roots_init_complete()
+                         : !WriteBarrier::IsRequired(*this, value));
   }
 #endif
 }
 
-DEF_ACQUIRE_GETTER(HeapObject, map, Map) {
+DEF_ACQUIRE_GETTER(HeapObject, map, Tagged<Map>) {
   return map_word(cage_base, kAcquireLoad).ToMap();
 }
 
@@ -945,11 +1075,11 @@ MapWord HeapObject::map_word(PtrComprCageBase cage_base,
   return MapField::Relaxed_Load_Map_Word(cage_base, *this);
 }
 
-void HeapObject::set_map_word(Map map, RelaxedStoreTag) {
+void HeapObject::set_map_word(Tagged<Map> map, RelaxedStoreTag) {
   MapField::Relaxed_Store_Map_Word(*this, MapWord::FromMap(map));
 }
 
-void HeapObject::set_map_word_forwarded(HeapObject target_object,
+void HeapObject::set_map_word_forwarded(Tagged<HeapObject> target_object,
                                         RelaxedStoreTag) {
   MapField::Relaxed_Store_Map_Word(
       *this, MapWord::FromForwardingAddress(*this, target_object));
@@ -968,18 +1098,18 @@ MapWord HeapObject::map_word(PtrComprCageBase cage_base,
   return MapField::Acquire_Load_No_Unpack(cage_base, *this);
 }
 
-void HeapObject::set_map_word(Map map, ReleaseStoreTag) {
+void HeapObject::set_map_word(Tagged<Map> map, ReleaseStoreTag) {
   MapField::Release_Store_Map_Word(*this, MapWord::FromMap(map));
 }
 
-void HeapObject::set_map_word_forwarded(HeapObject target_object,
+void HeapObject::set_map_word_forwarded(Tagged<HeapObject> target_object,
                                         ReleaseStoreTag) {
   MapField::Release_Store_Map_Word(
       *this, MapWord::FromForwardingAddress(*this, target_object));
 }
 
 bool HeapObject::release_compare_and_swap_map_word_forwarded(
-    MapWord old_map_word, HeapObject new_target_object) {
+    MapWord old_map_word, Tagged<HeapObject> new_target_object) {
   Tagged_t result = MapField::Release_CompareAndSwap(
       *this, old_map_word,
       MapWord::FromForwardingAddress(*this, new_target_object));
@@ -1002,10 +1132,10 @@ inline bool IsSpecialReceiverInstanceType(InstanceType instance_type) {
 
 // This should be in objects/map-inl.h, but can't, because of a cyclic
 // dependency.
-bool Map::IsSpecialReceiverMap() const {
-  bool result = IsSpecialReceiverInstanceType(instance_type());
-  DCHECK_IMPLIES(!result,
-                 !has_named_interceptor() && !is_access_check_needed());
+bool IsSpecialReceiverMap(Tagged<Map> map) {
+  bool result = IsSpecialReceiverInstanceType(map->instance_type());
+  DCHECK_IMPLIES(
+      !result, !map->has_named_interceptor() && !map->is_access_check_needed());
   return result;
 }
 
@@ -1015,27 +1145,30 @@ inline bool IsCustomElementsReceiverInstanceType(InstanceType instance_type) {
 
 // This should be in objects/map-inl.h, but can't, because of a cyclic
 // dependency.
-bool Map::IsCustomElementsReceiverMap() const {
-  return IsCustomElementsReceiverInstanceType(instance_type());
+bool IsCustomElementsReceiverMap(Tagged<Map> map) {
+  return IsCustomElementsReceiverInstanceType(map->instance_type());
 }
 
-bool Object::ToArrayLength(uint32_t* index) const {
-  return Object::ToUint32(index);
+// static
+bool Object::ToArrayLength(Tagged<Object> obj, uint32_t* index) {
+  return Object::ToUint32(obj, index);
 }
 
-bool Object::ToArrayIndex(uint32_t* index) const {
-  return Object::ToUint32(index) && *index != kMaxUInt32;
+// static
+bool Object::ToArrayIndex(Tagged<Object> obj, uint32_t* index) {
+  return Object::ToUint32(obj, index) && *index != kMaxUInt32;
 }
 
-bool Object::ToIntegerIndex(size_t* index) const {
-  if (IsSmi()) {
-    int num = Smi::ToInt(*this);
+// static
+bool Object::ToIntegerIndex(Tagged<Object> obj, size_t* index) {
+  if (IsSmi(obj)) {
+    int num = Smi::ToInt(obj);
     if (num < 0) return false;
     *index = static_cast<size_t>(num);
     return true;
   }
-  if (IsHeapNumber()) {
-    double num = HeapNumber::cast(*this).value();
+  if (IsHeapNumber(obj)) {
+    double num = HeapNumber::cast(obj)->value();
     if (!(num >= 0)) return false;  // Negation to catch NaNs.
     constexpr double max =
         std::min(kMaxSafeInteger,
@@ -1056,13 +1189,13 @@ WriteBarrierMode HeapObject::GetWriteBarrierMode(
 }
 
 // static
-AllocationAlignment HeapObject::RequiredAlignment(Map map) {
+AllocationAlignment HeapObject::RequiredAlignment(Tagged<Map> map) {
   // TODO(v8:4153): We should think about requiring double alignment
   // in general for ByteArray, since they are used as backing store for typed
   // arrays now.
   // TODO(ishell, v8:8875): Consider using aligned allocations for BigInt.
   if (USE_ALLOCATION_ALIGNMENT_BOOL) {
-    int instance_type = map.instance_type();
+    int instance_type = map->instance_type();
     if (instance_type == FIXED_DOUBLE_ARRAY_TYPE) return kDoubleAligned;
     if (instance_type == HEAP_NUMBER_TYPE) return kDoubleUnaligned;
   }
@@ -1175,15 +1308,15 @@ MaybeHandle<Object> Object::GetPropertyOrElement(Handle<Object> receiver,
 }
 
 // static
-Object Object::GetSimpleHash(Object object) {
+Tagged<Object> Object::GetSimpleHash(Tagged<Object> object) {
   DisallowGarbageCollection no_gc;
-  if (object.IsSmi()) {
+  if (IsSmi(object)) {
     uint32_t hash = ComputeUnseededHash(Smi::ToInt(object));
     return Smi::FromInt(hash & Smi::kMaxValue);
   }
-  auto instance_type = HeapObject::cast(object).map().instance_type();
+  auto instance_type = HeapObject::cast(object)->map()->instance_type();
   if (InstanceTypeChecker::IsHeapNumber(instance_type)) {
-    double num = HeapNumber::cast(object).value();
+    double num = HeapNumber::cast(object)->value();
     if (std::isnan(num)) return Smi::FromInt(Smi::kMaxValue);
     // Use ComputeUnseededHash for all values in Signed32 range, including -0,
     // which is considered equal to 0 because collections use SameValueZero.
@@ -1196,46 +1329,47 @@ Object Object::GetSimpleHash(Object object) {
     }
     return Smi::FromInt(hash & Smi::kMaxValue);
   } else if (InstanceTypeChecker::IsName(instance_type)) {
-    uint32_t hash = Name::cast(object).EnsureHash();
+    uint32_t hash = Name::cast(object)->EnsureHash();
     return Smi::FromInt(hash);
   } else if (InstanceTypeChecker::IsOddball(instance_type)) {
-    uint32_t hash = Oddball::cast(object).to_string().EnsureHash();
+    uint32_t hash = Oddball::cast(object)->to_string()->EnsureHash();
     return Smi::FromInt(hash);
   } else if (InstanceTypeChecker::IsBigInt(instance_type)) {
-    uint32_t hash = BigInt::cast(object).Hash();
+    uint32_t hash = BigInt::cast(object)->Hash();
     return Smi::FromInt(hash & Smi::kMaxValue);
   } else if (InstanceTypeChecker::IsSharedFunctionInfo(instance_type)) {
-    uint32_t hash = SharedFunctionInfo::cast(object).Hash();
+    uint32_t hash = SharedFunctionInfo::cast(object)->Hash();
     return Smi::FromInt(hash & Smi::kMaxValue);
   } else if (InstanceTypeChecker::IsScopeInfo(instance_type)) {
-    uint32_t hash = ScopeInfo::cast(object).Hash();
+    uint32_t hash = ScopeInfo::cast(object)->Hash();
     return Smi::FromInt(hash & Smi::kMaxValue);
   } else if (InstanceTypeChecker::IsScript(instance_type)) {
-    int id = Script::cast(object).id();
+    int id = Script::cast(object)->id();
     return Smi::FromInt(ComputeUnseededHash(id) & Smi::kMaxValue);
   }
-  DCHECK(object.IsJSReceiver());
+  DCHECK(IsJSReceiver(object));
   return object;
 }
 
-Object Object::GetHash() {
+// static
+Tagged<Object> Object::GetHash(Tagged<Object> obj) {
   DisallowGarbageCollection no_gc;
-  Object hash = GetSimpleHash(*this);
-  if (hash.IsSmi()) return hash;
+  Tagged<Object> hash = GetSimpleHash(obj);
+  if (IsSmi(hash)) return hash;
 
-  DCHECK(IsJSReceiver());
-  JSReceiver receiver = JSReceiver::cast(*this);
-  return receiver.GetIdentityHash();
+  DCHECK(IsJSReceiver(obj));
+  Tagged<JSReceiver> receiver = JSReceiver::cast(obj);
+  return receiver->GetIdentityHash();
 }
 
-bool Object::IsShared() const {
+bool IsShared(Tagged<Object> obj) {
   // This logic should be kept in sync with fast paths in
   // CodeStubAssembler::SharedValueBarrier.
 
   // Smis are trivially shared.
-  if (IsSmi()) return true;
+  if (IsSmi(obj)) return true;
 
-  HeapObject object = HeapObject::cast(*this);
+  Tagged<HeapObject> object = Tagged<HeapObject>::cast(obj);
 
   // RO objects are shared when the RO space is shared.
   if (IsReadOnlyHeapObject(object)) {
@@ -1243,26 +1377,26 @@ bool Object::IsShared() const {
   }
 
   // Check if this object is already shared.
-  InstanceType instance_type = object.map().instance_type();
+  InstanceType instance_type = object->map()->instance_type();
   if (InstanceTypeChecker::IsAlwaysSharedSpaceJSObject(instance_type)) {
     DCHECK(object.InAnySharedSpace());
     return true;
   }
   switch (instance_type) {
-    case SHARED_STRING_TYPE:
-    case SHARED_ONE_BYTE_STRING_TYPE:
-    case SHARED_EXTERNAL_STRING_TYPE:
+    case SHARED_SEQ_TWO_BYTE_STRING_TYPE:
+    case SHARED_SEQ_ONE_BYTE_STRING_TYPE:
+    case SHARED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE:
-    case SHARED_UNCACHED_EXTERNAL_STRING_TYPE:
+    case SHARED_UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case SHARED_UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE:
       DCHECK(object.InAnySharedSpace());
       return true;
-    case INTERNALIZED_STRING_TYPE:
-    case ONE_BYTE_INTERNALIZED_STRING_TYPE:
-    case EXTERNAL_INTERNALIZED_STRING_TYPE:
-    case EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE:
-    case UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE:
-    case UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE:
+    case INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case INTERNALIZED_ONE_BYTE_STRING_TYPE:
+    case EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE:
+    case UNCACHED_EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE:
+    case UNCACHED_EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE:
       if (v8_flags.shared_string_table) {
         DCHECK(object.InAnySharedSpace());
         return true;
@@ -1280,26 +1414,24 @@ MaybeHandle<Object> Object::Share(Isolate* isolate, Handle<Object> value,
                                   ShouldThrow throw_if_cannot_be_shared) {
   // Sharing values requires the RO space be shared.
   DCHECK(ReadOnlyHeap::IsReadOnlySpaceShared());
-  if (value->IsShared()) return value;
+  if (IsShared(*value)) return value;
   return ShareSlow(isolate, Handle<HeapObject>::cast(value),
                    throw_if_cannot_be_shared);
 }
 
-// https://tc39.es/proposal-symbols-as-weakmap-keys/#sec-canbeheldweakly-abstract-operation
-bool Object::CanBeHeldWeakly() const {
-  if (IsJSReceiver()) {
+// https://tc39.es/ecma262/#sec-canbeheldweakly
+// static
+bool Object::CanBeHeldWeakly(Tagged<Object> obj) {
+  if (IsJSReceiver(obj)) {
     // TODO(v8:12547) Shared structs and arrays should only be able to point
     // to shared values in weak collections. For now, disallow them as weak
     // collection keys.
     if (v8_flags.harmony_struct) {
-      return !IsJSSharedStruct() && !IsJSSharedArray();
+      return !IsJSSharedStruct(obj) && !IsJSSharedArray(obj);
     }
     return true;
   }
-  if (v8_flags.harmony_symbol_as_weakmap_key) {
-    return IsSymbol() && !Symbol::cast(*this).is_in_public_symbol_table();
-  }
-  return false;
+  return IsSymbol(obj) && !Symbol::cast(obj)->is_in_public_symbol_table();
 }
 
 Handle<Object> ObjectHashTableShape::AsHandle(Handle<Object> key) {
@@ -1347,8 +1479,9 @@ static inline Handle<Object> MakeEntryPair(Isolate* isolate, Handle<Object> key,
                                                     PACKED_ELEMENTS, 2);
 }
 
-FreshlyAllocatedBigInt FreshlyAllocatedBigInt::cast(Object object) {
-  SLOW_DCHECK(object.IsBigInt());
+Tagged<FreshlyAllocatedBigInt> FreshlyAllocatedBigInt::cast(
+    Tagged<Object> object) {
+  SLOW_DCHECK(IsBigInt(object));
   return FreshlyAllocatedBigInt(object.ptr());
 }
 
diff --git a/deps/v8/src/objects/objects.cc b/deps/v8/src/objects/objects.cc
index 43ea4a73502f41..d55f192de8489e 100644
--- a/deps/v8/src/objects/objects.cc
+++ b/deps/v8/src/objects/objects.cc
@@ -17,6 +17,7 @@
 #include "src/ast/scopes.h"
 #include "src/base/bits.h"
 #include "src/base/debug/stack_trace.h"
+#include "src/base/logging.h"
 #include "src/base/overflowing-math.h"
 #include "src/base/utils/random-number-generator.h"
 #include "src/builtins/accessors.h"
@@ -54,6 +55,7 @@
 #include "src/objects/code-inl.h"
 #include "src/objects/compilation-cache-table-inl.h"
 #include "src/objects/debug-objects-inl.h"
+#include "src/objects/dictionary.h"
 #include "src/objects/elements.h"
 #include "src/objects/embedder-data-array-inl.h"
 #include "src/objects/field-index-inl.h"
@@ -63,6 +65,7 @@
 #include "src/objects/free-space-inl.h"
 #include "src/objects/function-kind.h"
 #include "src/objects/hash-table-inl.h"
+#include "src/objects/heap-object-inl.h"
 #include "src/objects/instance-type.h"
 #include "src/objects/js-array-buffer-inl.h"
 #include "src/objects/js-array-inl.h"
@@ -139,7 +142,7 @@ namespace internal {
 ShouldThrow GetShouldThrow(Isolate* isolate, Maybe<ShouldThrow> should_throw) {
   if (should_throw.IsJust()) return should_throw.FromJust();
 
-  LanguageMode mode = isolate->context().scope_info().language_mode();
+  LanguageMode mode = isolate->context()->scope_info()->language_mode();
   if (mode == LanguageMode::kStrict) return kThrowOnError;
 
   for (StackFrameIterator it(isolate); !it.done(); it.Advance()) {
@@ -210,14 +213,15 @@ std::ostream& operator<<(std::ostream& os, PropertyCellType type) {
   UNREACHABLE();
 }
 
-Handle<FieldType> Object::OptimalType(Isolate* isolate,
+// static
+Handle<FieldType> Object::OptimalType(Tagged<Object> obj, Isolate* isolate,
                                       Representation representation) {
   if (representation.IsNone()) return FieldType::None(isolate);
   if (v8_flags.track_field_types) {
-    if (representation.IsHeapObject() && IsHeapObject()) {
+    if (representation.IsHeapObject() && IsHeapObject(obj)) {
       // We can track only JavaScript objects with stable maps.
-      Handle<Map> map(HeapObject::cast(*this).map(), isolate);
-      if (map->is_stable() && map->IsJSReceiverMap()) {
+      Handle<Map> map(HeapObject::cast(obj)->map(), isolate);
+      if (map->is_stable() && IsJSReceiverMap(*map)) {
         return FieldType::Class(map, isolate);
       }
     }
@@ -228,15 +232,15 @@ Handle<FieldType> Object::OptimalType(Isolate* isolate,
 Handle<Object> Object::NewStorageFor(Isolate* isolate, Handle<Object> object,
                                      Representation representation) {
   if (!representation.IsDouble()) return object;
-  auto result = isolate->factory()->NewHeapNumberWithHoleNaN();
-  if (object->IsUninitialized(isolate)) {
+  Handle<HeapNumber> result = isolate->factory()->NewHeapNumberWithHoleNaN();
+  if (IsUninitialized(*object, isolate)) {
     result->set_value_as_bits(kHoleNanInt64, kRelaxedStore);
-  } else if (object->IsHeapNumber()) {
+  } else if (IsHeapNumber(*object)) {
     // Ensure that all bits of the double value are preserved.
     result->set_value_as_bits(
-        HeapNumber::cast(*object).value_as_bits(kRelaxedLoad), kRelaxedStore);
+        HeapNumber::cast(*object)->value_as_bits(kRelaxedLoad), kRelaxedStore);
   } else {
-    result->set_value(object->Number(), kRelaxedStore);
+    result->set_value(Object::Number(*object), kRelaxedStore);
   }
   return result;
 }
@@ -244,13 +248,13 @@ Handle<Object> Object::NewStorageFor(Isolate* isolate, Handle<Object> object,
 template <AllocationType allocation_type, typename IsolateT>
 Handle<Object> Object::WrapForRead(IsolateT* isolate, Handle<Object> object,
                                    Representation representation) {
-  DCHECK(!object->IsUninitialized(isolate));
+  DCHECK(!IsUninitialized(*object, isolate));
   if (!representation.IsDouble()) {
-    DCHECK(object->FitsRepresentation(representation));
+    DCHECK(Object::FitsRepresentation(*object, representation));
     return object;
   }
   return isolate->factory()->template NewHeapNumberFromBits<allocation_type>(
-      HeapNumber::cast(*object).value_as_bits(kRelaxedLoad));
+      HeapNumber::cast(*object)->value_as_bits(kRelaxedLoad));
 }
 
 template Handle<Object> Object::WrapForRead<AllocationType::kYoung>(
@@ -262,14 +266,14 @@ template Handle<Object> Object::WrapForRead<AllocationType::kOld>(
 MaybeHandle<JSReceiver> Object::ToObjectImpl(Isolate* isolate,
                                              Handle<Object> object,
                                              const char* method_name) {
-  DCHECK(!object->IsJSReceiver());  // Use ToObject() for fast path.
+  DCHECK(!IsJSReceiver(*object));  // Use ToObject() for fast path.
   Handle<Context> native_context = isolate->native_context();
   Handle<JSFunction> constructor;
-  if (object->IsSmi()) {
+  if (IsSmi(*object)) {
     constructor = handle(native_context->number_function(), isolate);
   } else {
     int constructor_function_index =
-        Handle<HeapObject>::cast(object)->map().GetConstructorFunctionIndex();
+        Handle<HeapObject>::cast(object)->map()->GetConstructorFunctionIndex();
     if (constructor_function_index == Map::kNoConstructorFunctionIndex) {
       if (method_name != nullptr) {
         THROW_NEW_ERROR(
@@ -296,8 +300,8 @@ MaybeHandle<JSReceiver> Object::ToObjectImpl(Isolate* isolate,
 // static
 MaybeHandle<JSReceiver> Object::ConvertReceiver(Isolate* isolate,
                                                 Handle<Object> object) {
-  if (object->IsJSReceiver()) return Handle<JSReceiver>::cast(object);
-  if (object->IsNullOrUndefined(isolate)) {
+  if (IsJSReceiver(*object)) return Handle<JSReceiver>::cast(object);
+  if (IsNullOrUndefined(*object, isolate)) {
     return isolate->global_proxy();
   }
   return Object::ToObject(isolate, object);
@@ -308,20 +312,20 @@ MaybeHandle<Object> Object::ConvertToNumberOrNumeric(Isolate* isolate,
                                                      Handle<Object> input,
                                                      Conversion mode) {
   while (true) {
-    if (input->IsNumber()) {
+    if (IsNumber(*input)) {
       return input;
     }
-    if (input->IsString()) {
+    if (IsString(*input)) {
       return String::ToNumber(isolate, Handle<String>::cast(input));
     }
-    if (input->IsOddball()) {
+    if (IsOddball(*input)) {
       return Oddball::ToNumber(isolate, Handle<Oddball>::cast(input));
     }
-    if (input->IsSymbol()) {
+    if (IsSymbol(*input)) {
       THROW_NEW_ERROR(isolate, NewTypeError(MessageTemplate::kSymbolToNumber),
                       Object);
     }
-    if (input->IsBigInt()) {
+    if (IsBigInt(*input)) {
       if (mode == Conversion::kToNumeric) return input;
       DCHECK_EQ(mode, Conversion::kToNumber);
       THROW_NEW_ERROR(isolate, NewTypeError(MessageTemplate::kBigIntToNumber),
@@ -341,8 +345,8 @@ MaybeHandle<Object> Object::ConvertToInteger(Isolate* isolate,
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, input,
       ConvertToNumberOrNumeric(isolate, input, Conversion::kToNumber), Object);
-  if (input->IsSmi()) return input;
-  return isolate->factory()->NewNumber(DoubleToInteger(input->Number()));
+  if (IsSmi(*input)) return input;
+  return isolate->factory()->NewNumber(DoubleToInteger(Object::Number(*input)));
 }
 
 // static
@@ -351,8 +355,9 @@ MaybeHandle<Object> Object::ConvertToInt32(Isolate* isolate,
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, input,
       ConvertToNumberOrNumeric(isolate, input, Conversion::kToNumber), Object);
-  if (input->IsSmi()) return input;
-  return isolate->factory()->NewNumberFromInt(DoubleToInt32(input->Number()));
+  if (IsSmi(*input)) return input;
+  return isolate->factory()->NewNumberFromInt(
+      DoubleToInt32(Object::Number(*input)));
 }
 
 // static
@@ -361,8 +366,10 @@ MaybeHandle<Object> Object::ConvertToUint32(Isolate* isolate,
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, input,
       ConvertToNumberOrNumeric(isolate, input, Conversion::kToNumber), Object);
-  if (input->IsSmi()) return handle(Smi::cast(*input).ToUint32Smi(), isolate);
-  return isolate->factory()->NewNumberFromUint(DoubleToUint32(input->Number()));
+  if (IsSmi(*input))
+    return handle(Smi::ToUint32Smi(Smi::cast(*input)), isolate);
+  return isolate->factory()->NewNumberFromUint(
+      DoubleToUint32(Object::Number(*input)));
 }
 
 // static
@@ -371,7 +378,7 @@ MaybeHandle<Name> Object::ConvertToName(Isolate* isolate,
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, input,
       Object::ToPrimitive(isolate, input, ToPrimitiveHint::kString), Name);
-  if (input->IsName()) return Handle<Name>::cast(input);
+  if (IsName(*input)) return Handle<Name>::cast(input);
   return ToString(isolate, input);
 }
 
@@ -386,13 +393,13 @@ MaybeHandle<Object> Object::ConvertToPropertyKey(Isolate* isolate,
   Handle<Object> key;
   if (!maybe_key.ToHandle(&key)) return key;
   // 3. If Type(key) is Symbol, then return key.
-  if (key->IsSymbol()) return key;
+  if (IsSymbol(*key)) return key;
   // 4. Return ToString(key).
   // Extending spec'ed behavior, we'd be happy to return an element index.
-  if (key->IsSmi()) return key;
-  if (key->IsHeapNumber()) {
+  if (IsSmi(*key)) return key;
+  if (IsHeapNumber(*key)) {
     uint32_t uint_value;
-    if (value->ToArrayLength(&uint_value) &&
+    if (Object::ToArrayLength(*value, &uint_value) &&
         uint_value <= static_cast<uint32_t>(Smi::kMaxValue)) {
       return handle(Smi::FromInt(static_cast<int>(uint_value)), isolate);
     }
@@ -404,19 +411,26 @@ MaybeHandle<Object> Object::ConvertToPropertyKey(Isolate* isolate,
 MaybeHandle<String> Object::ConvertToString(Isolate* isolate,
                                             Handle<Object> input) {
   while (true) {
-    if (input->IsOddball()) {
+    if (IsOddball(*input)) {
       return handle(Handle<Oddball>::cast(input)->to_string(), isolate);
     }
-    if (input->IsNumber()) {
+    if (IsNumber(*input)) {
       return isolate->factory()->NumberToString(input);
     }
-    if (input->IsSymbol()) {
+    if (IsSymbol(*input)) {
       THROW_NEW_ERROR(isolate, NewTypeError(MessageTemplate::kSymbolToString),
                       String);
     }
-    if (input->IsBigInt()) {
+    if (IsBigInt(*input)) {
       return BigInt::ToString(isolate, Handle<BigInt>::cast(input));
     }
+#if V8_ENABLE_WEBASSEMBLY
+    // We generally don't let the WasmNull escape into the JavaScript world,
+    // but some builtins may encounter it when called directly from Wasm code.
+    if (IsWasmNull(*input)) {
+      return isolate->factory()->null_string();
+    }
+#endif
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, input,
         JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(input),
@@ -424,7 +438,7 @@ MaybeHandle<String> Object::ConvertToString(Isolate* isolate,
         String);
     // The previous isString() check happened in Object::ToString and thus we
     // put it at the end of the loop in this helper.
-    if (input->IsString()) {
+    if (IsString(*input)) {
       return Handle<String>::cast(input);
     }
   }
@@ -433,16 +447,14 @@ MaybeHandle<String> Object::ConvertToString(Isolate* isolate,
 namespace {
 
 bool IsErrorObject(Isolate* isolate, Handle<Object> object) {
-  if (!object->IsJSReceiver()) return false;
-  Handle<Symbol> symbol = isolate->factory()->error_stack_symbol();
-  return JSReceiver::HasOwnProperty(isolate, Handle<JSReceiver>::cast(object),
-                                    symbol)
-      .FromMaybe(false);
+  if (!IsJSObject(*object)) return false;
+  return ErrorUtils::HasErrorStackSymbolOwnProperty(
+      isolate, Handle<JSObject>::cast(object));
 }
 
 Handle<String> AsStringOrEmpty(Isolate* isolate, Handle<Object> object) {
-  return object->IsString() ? Handle<String>::cast(object)
-                            : isolate->factory()->empty_string();
+  return IsString(*object) ? Handle<String>::cast(object)
+                           : isolate->factory()->empty_string();
 }
 
 Handle<String> NoSideEffectsErrorToString(Isolate* isolate,
@@ -478,27 +490,28 @@ MaybeHandle<String> Object::NoSideEffectsToMaybeString(Isolate* isolate,
                                                        Handle<Object> input) {
   DisallowJavascriptExecution no_js(isolate);
 
-  if (input->IsString() || input->IsNumber() || input->IsOddball()) {
+  if (IsString(*input) || IsNumber(*input) || IsOddball(*input)) {
     return Object::ToString(isolate, input).ToHandleChecked();
-  } else if (input->IsJSProxy()) {
+  } else if (IsJSProxy(*input)) {
     Handle<Object> currInput = input;
     do {
-      HeapObject target = Handle<JSProxy>::cast(currInput)->target(isolate);
+      Tagged<HeapObject> target =
+          Handle<JSProxy>::cast(currInput)->target(isolate);
       currInput = Handle<Object>(target, isolate);
-    } while (currInput->IsJSProxy());
+    } while (IsJSProxy(*currInput));
     return NoSideEffectsToString(isolate, currInput);
-  } else if (input->IsBigInt()) {
+  } else if (IsBigInt(*input)) {
     return BigInt::NoSideEffectsToString(isolate, Handle<BigInt>::cast(input));
-  } else if (input->IsFunction()) {
+  } else if (IsFunction(*input)) {
     // -- F u n c t i o n
     Handle<String> fun_str;
-    if (input->IsJSBoundFunction()) {
+    if (IsJSBoundFunction(*input)) {
       fun_str = JSBoundFunction::ToString(Handle<JSBoundFunction>::cast(input));
-    } else if (input->IsJSWrappedFunction()) {
+    } else if (IsJSWrappedFunction(*input)) {
       fun_str =
           JSWrappedFunction::ToString(Handle<JSWrappedFunction>::cast(input));
     } else {
-      DCHECK(input->IsJSFunction());
+      DCHECK(IsJSFunction(*input));
       fun_str = JSFunction::ToString(Handle<JSFunction>::cast(input));
     }
 
@@ -512,7 +525,7 @@ MaybeHandle<String> Object::NoSideEffectsToMaybeString(Isolate* isolate,
       return builder.Finish().ToHandleChecked();
     }
     return fun_str;
-  } else if (input->IsSymbol()) {
+  } else if (IsSymbol(*input)) {
     // -- S y m b o l
     Handle<Symbol> symbol = Handle<Symbol>::cast(input);
 
@@ -522,14 +535,23 @@ MaybeHandle<String> Object::NoSideEffectsToMaybeString(Isolate* isolate,
 
     IncrementalStringBuilder builder(isolate);
     builder.AppendCStringLiteral("Symbol(");
-    if (symbol->description().IsString()) {
-      builder.AppendString(
-          handle(String::cast(symbol->description()), isolate));
+    if (IsString(symbol->description())) {
+      Handle<String> description =
+          handle(String::cast(symbol->description()), isolate);
+      if (description->length() > 128) {
+        builder.AppendString(
+            isolate->factory()->NewSubString(description, 0, 56));
+        builder.AppendCStringLiteral("...<omitted>...");
+        builder.AppendString(isolate->factory()->NewSubString(
+            description, description->length() - 56, description->length()));
+      } else {
+        builder.AppendString(description);
+      }
     }
     builder.AppendCharacter(')');
 
     return builder.Finish().ToHandleChecked();
-  } else if (input->IsJSReceiver()) {
+  } else if (IsJSReceiver(*input)) {
     // -- J S R e c e i v e r
     Handle<JSReceiver> receiver = Handle<JSReceiver>::cast(input);
     Handle<Object> to_string = JSReceiver::GetDataProperty(
@@ -545,13 +567,13 @@ MaybeHandle<String> Object::NoSideEffectsToMaybeString(Isolate* isolate,
     } else if (*to_string == *isolate->object_to_string()) {
       Handle<Object> ctor = JSReceiver::GetDataProperty(
           isolate, receiver, isolate->factory()->constructor_string());
-      if (ctor->IsFunction()) {
+      if (IsFunction(*ctor)) {
         Handle<String> ctor_name;
-        if (ctor->IsJSBoundFunction()) {
+        if (IsJSBoundFunction(*ctor)) {
           ctor_name = JSBoundFunction::GetName(
                           isolate, Handle<JSBoundFunction>::cast(ctor))
                           .ToHandleChecked();
-        } else if (ctor->IsJSFunction()) {
+        } else if (IsJSFunction(*ctor)) {
           ctor_name =
               JSFunction::GetName(isolate, Handle<JSFunction>::cast(ctor));
         }
@@ -585,13 +607,13 @@ Handle<String> Object::NoSideEffectsToString(Isolate* isolate,
   // At this point, input is either none of the above or a JSReceiver.
 
   Handle<JSReceiver> receiver;
-  if (input->IsJSReceiver()) {
+  if (IsJSReceiver(*input)) {
     receiver = Handle<JSReceiver>::cast(input);
   } else {
     // This is the only case where Object::ToObject throws.
-    DCHECK(!input->IsSmi());
+    DCHECK(!IsSmi(*input));
     int constructor_function_index =
-        Handle<HeapObject>::cast(input)->map().GetConstructorFunctionIndex();
+        Handle<HeapObject>::cast(input)->map()->GetConstructorFunctionIndex();
     if (constructor_function_index == Map::kNoConstructorFunctionIndex) {
       return isolate->factory()->NewStringFromAsciiChecked("[object Unknown]");
     }
@@ -603,7 +625,7 @@ Handle<String> Object::NoSideEffectsToString(Isolate* isolate,
   Handle<Object> tag_obj = JSReceiver::GetDataProperty(
       isolate, receiver, isolate->factory()->to_string_tag_symbol());
   Handle<String> tag =
-      tag_obj->IsString() ? Handle<String>::cast(tag_obj) : builtin_tag;
+      IsString(*tag_obj) ? Handle<String>::cast(tag_obj) : builtin_tag;
 
   IncrementalStringBuilder builder(isolate);
   builder.AppendCStringLiteral("[object ");
@@ -617,11 +639,11 @@ Handle<String> Object::NoSideEffectsToString(Isolate* isolate,
 MaybeHandle<Object> Object::ConvertToLength(Isolate* isolate,
                                             Handle<Object> input) {
   ASSIGN_RETURN_ON_EXCEPTION(isolate, input, ToNumber(isolate, input), Object);
-  if (input->IsSmi()) {
+  if (IsSmi(*input)) {
     int value = std::max(Smi::ToInt(*input), 0);
     return handle(Smi::FromInt(value), isolate);
   }
-  double len = DoubleToInteger(input->Number());
+  double len = DoubleToInteger(Object::Number(*input));
   if (len <= 0.0) {
     return handle(Smi::zero(), isolate);
   } else if (len >= kMaxSafeInteger) {
@@ -634,11 +656,11 @@ MaybeHandle<Object> Object::ConvertToLength(Isolate* isolate,
 MaybeHandle<Object> Object::ConvertToIndex(Isolate* isolate,
                                            Handle<Object> input,
                                            MessageTemplate error_index) {
-  if (input->IsUndefined(isolate)) return handle(Smi::zero(), isolate);
+  if (IsUndefined(*input, isolate)) return handle(Smi::zero(), isolate);
   ASSIGN_RETURN_ON_EXCEPTION(isolate, input, ToNumber(isolate, input), Object);
-  if (input->IsSmi() && Smi::ToInt(*input) >= 0) return input;
-  double len = DoubleToInteger(input->Number());
-  auto js_len = isolate->factory()->NewNumber(len);
+  if (IsSmi(*input) && Smi::ToInt(*input) >= 0) return input;
+  double len = DoubleToInteger(Object::Number(*input));
+  Handle<Object> js_len = isolate->factory()->NewNumber(len);
   if (len < 0.0 || len > kMaxSafeInteger) {
     THROW_NEW_ERROR(isolate, NewRangeError(error_index, js_len), Object);
   }
@@ -646,26 +668,28 @@ MaybeHandle<Object> Object::ConvertToIndex(Isolate* isolate,
 }
 
 template <typename IsolateT>
-bool Object::BooleanValue(IsolateT* isolate) {
-  if (IsSmi()) return Smi::ToInt(*this) != 0;
-  DCHECK(IsHeapObject());
-  if (IsBoolean()) return IsTrue(isolate);
-  if (IsNullOrUndefined(isolate)) return false;
+// static
+bool Object::BooleanValue(Tagged<Object> obj, IsolateT* isolate) {
+  if (IsSmi(obj)) return Smi::ToInt(obj) != 0;
+  DCHECK(IsHeapObject(obj));
+  if (IsBoolean(obj)) return IsTrue(obj, isolate);
+  if (IsNullOrUndefined(obj, isolate)) return false;
 #ifdef V8_ENABLE_WEBASSEMBLY
-  if (IsWasmNull()) return false;
+  if (IsWasmNull(obj)) return false;
 #endif
-  if (IsUndetectable()) return false;  // Undetectable object is false.
-  if (IsString()) return String::cast(*this).length() != 0;
-  if (IsHeapNumber()) return DoubleToBoolean(HeapNumber::cast(*this).value());
-  if (IsBigInt()) return BigInt::cast(*this).ToBoolean();
+  if (IsUndetectable(obj)) return false;  // Undetectable object is false.
+  if (IsString(obj)) return String::cast(obj)->length() != 0;
+  if (IsHeapNumber(obj)) return DoubleToBoolean(HeapNumber::cast(obj)->value());
+  if (IsBigInt(obj)) return BigInt::cast(obj)->ToBoolean();
   return true;
 }
-template bool Object::BooleanValue(Isolate*);
-template bool Object::BooleanValue(LocalIsolate*);
+template bool Object::BooleanValue(Tagged<Object>, Isolate*);
+template bool Object::BooleanValue(Tagged<Object>, LocalIsolate*);
 
-Object Object::ToBoolean(Isolate* isolate) {
-  if (IsBoolean()) return *this;
-  return isolate->heap()->ToBoolean(BooleanValue(isolate));
+// static
+Tagged<Object> Object::ToBoolean(Tagged<Object> obj, Isolate* isolate) {
+  if (IsBoolean(obj)) return obj;
+  return isolate->heap()->ToBoolean(Object::BooleanValue(obj, isolate));
 }
 
 namespace {
@@ -692,8 +716,8 @@ bool StrictNumberEquals(double x, double y) {
   return x == y;
 }
 
-bool StrictNumberEquals(const Object x, const Object y) {
-  return StrictNumberEquals(x.Number(), y.Number());
+bool StrictNumberEquals(const Tagged<Object> x, const Tagged<Object> y) {
+  return StrictNumberEquals(Object::Number(x), Object::Number(y));
 }
 
 bool StrictNumberEquals(Handle<Object> x, Handle<Object> y) {
@@ -720,16 +744,16 @@ Maybe<ComparisonResult> Object::Compare(Isolate* isolate, Handle<Object> x,
       !Object::ToPrimitive(isolate, y, ToPrimitiveHint::kNumber).ToHandle(&y)) {
     return Nothing<ComparisonResult>();
   }
-  if (x->IsString() && y->IsString()) {
+  if (IsString(*x) && IsString(*y)) {
     // ES6 section 7.2.11 Abstract Relational Comparison step 5.
     return Just(String::Compare(isolate, Handle<String>::cast(x),
                                 Handle<String>::cast(y)));
   }
-  if (x->IsBigInt() && y->IsString()) {
+  if (IsBigInt(*x) && IsString(*y)) {
     return BigInt::CompareToString(isolate, Handle<BigInt>::cast(x),
                                    Handle<String>::cast(y));
   }
-  if (x->IsString() && y->IsBigInt()) {
+  if (IsString(*x) && IsBigInt(*y)) {
     Maybe<ComparisonResult> maybe_result = BigInt::CompareToString(
         isolate, Handle<BigInt>::cast(y), Handle<String>::cast(x));
     ComparisonResult result;
@@ -745,10 +769,10 @@ Maybe<ComparisonResult> Object::Compare(Isolate* isolate, Handle<Object> x,
     return Nothing<ComparisonResult>();
   }
 
-  bool x_is_number = x->IsNumber();
-  bool y_is_number = y->IsNumber();
+  bool x_is_number = IsNumber(*x);
+  bool y_is_number = IsNumber(*y);
   if (x_is_number && y_is_number) {
-    return Just(StrictNumberCompare(x->Number(), y->Number()));
+    return Just(StrictNumberCompare(Object::Number(*x), Object::Number(*y)));
   } else if (!x_is_number && !y_is_number) {
     return Just(BigInt::CompareToBigInt(Handle<BigInt>::cast(x),
                                         Handle<BigInt>::cast(y)));
@@ -765,18 +789,18 @@ Maybe<bool> Object::Equals(Isolate* isolate, Handle<Object> x,
   // This is the generic version of Abstract Equality Comparison. Must be in
   // sync with CodeStubAssembler::Equal.
   while (true) {
-    if (x->IsNumber()) {
-      if (y->IsNumber()) {
+    if (IsNumber(*x)) {
+      if (IsNumber(*y)) {
         return Just(StrictNumberEquals(x, y));
-      } else if (y->IsBoolean()) {
+      } else if (IsBoolean(*y)) {
         return Just(
             StrictNumberEquals(*x, Handle<Oddball>::cast(y)->to_number()));
-      } else if (y->IsString()) {
+      } else if (IsString(*y)) {
         return Just(StrictNumberEquals(
             x, String::ToNumber(isolate, Handle<String>::cast(y))));
-      } else if (y->IsBigInt()) {
+      } else if (IsBigInt(*y)) {
         return Just(BigInt::EqualToNumber(Handle<BigInt>::cast(y), x));
-      } else if (y->IsJSReceiver()) {
+      } else if (IsJSReceiver(*y)) {
         if (!JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(y))
                  .ToHandle(&y)) {
           return Nothing<bool>();
@@ -784,21 +808,21 @@ Maybe<bool> Object::Equals(Isolate* isolate, Handle<Object> x,
       } else {
         return Just(false);
       }
-    } else if (x->IsString()) {
-      if (y->IsString()) {
+    } else if (IsString(*x)) {
+      if (IsString(*y)) {
         return Just(String::Equals(isolate, Handle<String>::cast(x),
                                    Handle<String>::cast(y)));
-      } else if (y->IsNumber()) {
+      } else if (IsNumber(*y)) {
         x = String::ToNumber(isolate, Handle<String>::cast(x));
         return Just(StrictNumberEquals(x, y));
-      } else if (y->IsBoolean()) {
+      } else if (IsBoolean(*y)) {
         x = String::ToNumber(isolate, Handle<String>::cast(x));
         return Just(
             StrictNumberEquals(*x, Handle<Oddball>::cast(y)->to_number()));
-      } else if (y->IsBigInt()) {
+      } else if (IsBigInt(*y)) {
         return BigInt::EqualToString(isolate, Handle<BigInt>::cast(y),
                                      Handle<String>::cast(x));
-      } else if (y->IsJSReceiver()) {
+      } else if (IsJSReceiver(*y)) {
         if (!JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(y))
                  .ToHandle(&y)) {
           return Nothing<bool>();
@@ -806,20 +830,20 @@ Maybe<bool> Object::Equals(Isolate* isolate, Handle<Object> x,
       } else {
         return Just(false);
       }
-    } else if (x->IsBoolean()) {
-      if (y->IsOddball()) {
+    } else if (IsBoolean(*x)) {
+      if (IsOddball(*y)) {
         return Just(x.is_identical_to(y));
-      } else if (y->IsNumber()) {
+      } else if (IsNumber(*y)) {
         return Just(
             StrictNumberEquals(Handle<Oddball>::cast(x)->to_number(), *y));
-      } else if (y->IsString()) {
+      } else if (IsString(*y)) {
         y = String::ToNumber(isolate, Handle<String>::cast(y));
         return Just(
             StrictNumberEquals(Handle<Oddball>::cast(x)->to_number(), *y));
-      } else if (y->IsBigInt()) {
+      } else if (IsBigInt(*y)) {
         x = Oddball::ToNumber(isolate, Handle<Oddball>::cast(x));
         return Just(BigInt::EqualToNumber(Handle<BigInt>::cast(y), x));
-      } else if (y->IsJSReceiver()) {
+      } else if (IsJSReceiver(*y)) {
         if (!JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(y))
                  .ToHandle(&y)) {
           return Nothing<bool>();
@@ -828,10 +852,10 @@ Maybe<bool> Object::Equals(Isolate* isolate, Handle<Object> x,
       } else {
         return Just(false);
       }
-    } else if (x->IsSymbol()) {
-      if (y->IsSymbol()) {
+    } else if (IsSymbol(*x)) {
+      if (IsSymbol(*y)) {
         return Just(x.is_identical_to(y));
-      } else if (y->IsJSReceiver()) {
+      } else if (IsJSReceiver(*y)) {
         if (!JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(y))
                  .ToHandle(&y)) {
           return Nothing<bool>();
@@ -839,63 +863,65 @@ Maybe<bool> Object::Equals(Isolate* isolate, Handle<Object> x,
       } else {
         return Just(false);
       }
-    } else if (x->IsBigInt()) {
-      if (y->IsBigInt()) {
+    } else if (IsBigInt(*x)) {
+      if (IsBigInt(*y)) {
         return Just(BigInt::EqualToBigInt(BigInt::cast(*x), BigInt::cast(*y)));
       }
       return Equals(isolate, y, x);
-    } else if (x->IsJSReceiver()) {
-      if (y->IsJSReceiver()) {
+    } else if (IsJSReceiver(*x)) {
+      if (IsJSReceiver(*y)) {
         return Just(x.is_identical_to(y));
-      } else if (y->IsUndetectable()) {
-        return Just(x->IsUndetectable());
-      } else if (y->IsBoolean()) {
+      } else if (IsUndetectable(*y)) {
+        return Just(IsUndetectable(*x));
+      } else if (IsBoolean(*y)) {
         y = Oddball::ToNumber(isolate, Handle<Oddball>::cast(y));
       } else if (!JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(x))
                       .ToHandle(&x)) {
         return Nothing<bool>();
       }
     } else {
-      return Just(x->IsUndetectable() && y->IsUndetectable());
+      return Just(IsUndetectable(*x) && IsUndetectable(*y));
     }
   }
 }
 
-bool Object::StrictEquals(Object that) {
-  if (this->IsNumber()) {
-    if (!that.IsNumber()) return false;
-    return StrictNumberEquals(*this, that);
-  } else if (this->IsString()) {
-    if (!that.IsString()) return false;
-    return String::cast(*this).Equals(String::cast(that));
-  } else if (this->IsBigInt()) {
-    if (!that.IsBigInt()) return false;
-    return BigInt::EqualToBigInt(BigInt::cast(*this), BigInt::cast(that));
+// static
+bool Object::StrictEquals(Tagged<Object> obj, Tagged<Object> that) {
+  if (IsNumber(obj)) {
+    if (!IsNumber(that)) return false;
+    return StrictNumberEquals(obj, that);
+  } else if (IsString(obj)) {
+    if (!IsString(that)) return false;
+    return String::cast(obj)->Equals(String::cast(that));
+  } else if (IsBigInt(obj)) {
+    if (!IsBigInt(that)) return false;
+    return BigInt::EqualToBigInt(BigInt::cast(obj), BigInt::cast(that));
   }
-  return *this == that;
+  return obj == that;
 }
 
 // static
 Handle<String> Object::TypeOf(Isolate* isolate, Handle<Object> object) {
-  if (object->IsNumber()) return isolate->factory()->number_string();
-  if (object->IsOddball())
-    return handle(Oddball::cast(*object).type_of(), isolate);
-  if (object->IsUndetectable()) {
+  if (IsNumber(*object)) return isolate->factory()->number_string();
+  if (IsOddball(*object))
+    return handle(Oddball::cast(*object)->type_of(), isolate);
+  if (IsUndetectable(*object)) {
     return isolate->factory()->undefined_string();
   }
-  if (object->IsString()) return isolate->factory()->string_string();
-  if (object->IsSymbol()) return isolate->factory()->symbol_string();
-  if (object->IsBigInt()) return isolate->factory()->bigint_string();
-  if (object->IsCallable()) return isolate->factory()->function_string();
+  if (IsString(*object)) return isolate->factory()->string_string();
+  if (IsSymbol(*object)) return isolate->factory()->symbol_string();
+  if (IsBigInt(*object)) return isolate->factory()->bigint_string();
+  if (IsCallable(*object)) return isolate->factory()->function_string();
   return isolate->factory()->object_string();
 }
 
 // static
 MaybeHandle<Object> Object::Add(Isolate* isolate, Handle<Object> lhs,
                                 Handle<Object> rhs) {
-  if (lhs->IsNumber() && rhs->IsNumber()) {
-    return isolate->factory()->NewNumber(lhs->Number() + rhs->Number());
-  } else if (lhs->IsString() && rhs->IsString()) {
+  if (IsNumber(*lhs) && IsNumber(*rhs)) {
+    return isolate->factory()->NewNumber(Object::Number(*lhs) +
+                                         Object::Number(*rhs));
+  } else if (IsString(*lhs) && IsString(*rhs)) {
     return isolate->factory()->NewConsString(Handle<String>::cast(lhs),
                                              Handle<String>::cast(rhs));
   }
@@ -903,7 +929,7 @@ MaybeHandle<Object> Object::Add(Isolate* isolate, Handle<Object> lhs,
                              Object);
   ASSIGN_RETURN_ON_EXCEPTION(isolate, rhs, Object::ToPrimitive(isolate, rhs),
                              Object);
-  if (lhs->IsString() || rhs->IsString()) {
+  if (IsString(*lhs) || IsString(*rhs)) {
     ASSIGN_RETURN_ON_EXCEPTION(isolate, rhs, Object::ToString(isolate, rhs),
                                Object);
     ASSIGN_RETURN_ON_EXCEPTION(isolate, lhs, Object::ToString(isolate, lhs),
@@ -915,7 +941,8 @@ MaybeHandle<Object> Object::Add(Isolate* isolate, Handle<Object> lhs,
                              Object);
   ASSIGN_RETURN_ON_EXCEPTION(isolate, lhs, Object::ToNumber(isolate, lhs),
                              Object);
-  return isolate->factory()->NewNumber(lhs->Number() + rhs->Number());
+  return isolate->factory()->NewNumber(Object::Number(*lhs) +
+                                       Object::Number(*rhs));
 }
 
 // static
@@ -923,11 +950,11 @@ MaybeHandle<Object> Object::OrdinaryHasInstance(Isolate* isolate,
                                                 Handle<Object> callable,
                                                 Handle<Object> object) {
   // The {callable} must have a [[Call]] internal method.
-  if (!callable->IsCallable()) return isolate->factory()->false_value();
+  if (!IsCallable(*callable)) return isolate->factory()->false_value();
 
   // Check if {callable} is a bound function, and if so retrieve its
   // [[BoundTargetFunction]] and use that instead of {callable}.
-  if (callable->IsJSBoundFunction()) {
+  if (IsJSBoundFunction(*callable)) {
     // Since there is a mutual recursion here, we might run out of stack
     // space for long chains of bound functions.
     STACK_CHECK(isolate, MaybeHandle<Object>());
@@ -938,7 +965,7 @@ MaybeHandle<Object> Object::OrdinaryHasInstance(Isolate* isolate,
   }
 
   // If {object} is not a receiver, return false.
-  if (!object->IsJSReceiver()) return isolate->factory()->false_value();
+  if (!IsJSReceiver(*object)) return isolate->factory()->false_value();
 
   // Get the "prototype" of {callable}; raise an error if it's not a receiver.
   Handle<Object> prototype;
@@ -947,7 +974,7 @@ MaybeHandle<Object> Object::OrdinaryHasInstance(Isolate* isolate,
       Object::GetProperty(isolate, callable,
                           isolate->factory()->prototype_string()),
       Object);
-  if (!prototype->IsJSReceiver()) {
+  if (!IsJSReceiver(*prototype)) {
     THROW_NEW_ERROR(
         isolate,
         NewTypeError(MessageTemplate::kInstanceofNonobjectProto, prototype),
@@ -965,7 +992,7 @@ MaybeHandle<Object> Object::OrdinaryHasInstance(Isolate* isolate,
 MaybeHandle<Object> Object::InstanceOf(Isolate* isolate, Handle<Object> object,
                                        Handle<Object> callable) {
   // The {callable} must be a receiver.
-  if (!callable->IsJSReceiver()) {
+  if (!IsJSReceiver(*callable)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kNonObjectInInstanceOfCheck),
                     Object);
@@ -975,21 +1002,22 @@ MaybeHandle<Object> Object::InstanceOf(Isolate* isolate, Handle<Object> object,
   Handle<Object> inst_of_handler;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, inst_of_handler,
-      Object::GetMethod(Handle<JSReceiver>::cast(callable),
+      Object::GetMethod(isolate, Handle<JSReceiver>::cast(callable),
                         isolate->factory()->has_instance_symbol()),
       Object);
-  if (!inst_of_handler->IsUndefined(isolate)) {
+  if (!IsUndefined(*inst_of_handler, isolate)) {
     // Call the {inst_of_handler} on the {callable}.
     Handle<Object> result;
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, result,
         Execution::Call(isolate, inst_of_handler, callable, 1, &object),
         Object);
-    return isolate->factory()->ToBoolean(result->BooleanValue(isolate));
+    return isolate->factory()->ToBoolean(
+        Object::BooleanValue(*result, isolate));
   }
 
   // The {callable} must have a [[Call]] internal method.
-  if (!callable->IsCallable()) {
+  if (!IsCallable(*callable)) {
     THROW_NEW_ERROR(
         isolate, NewTypeError(MessageTemplate::kNonCallableInInstanceOfCheck),
         Object);
@@ -1004,16 +1032,16 @@ MaybeHandle<Object> Object::InstanceOf(Isolate* isolate, Handle<Object> object,
 }
 
 // static
-MaybeHandle<Object> Object::GetMethod(Handle<JSReceiver> receiver,
+MaybeHandle<Object> Object::GetMethod(Isolate* isolate,
+                                      Handle<JSReceiver> receiver,
                                       Handle<Name> name) {
   Handle<Object> func;
-  Isolate* isolate = receiver->GetIsolate();
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, func, JSReceiver::GetProperty(isolate, receiver, name), Object);
-  if (func->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*func, isolate)) {
     return isolate->factory()->undefined_value();
   }
-  if (!func->IsCallable()) {
+  if (!IsCallable(*func)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kPropertyNotFunction, func,
                                  name, receiver),
@@ -1027,17 +1055,18 @@ namespace {
 MaybeHandle<FixedArray> CreateListFromArrayLikeFastPath(
     Isolate* isolate, Handle<Object> object, ElementTypes element_types) {
   if (element_types == ElementTypes::kAll) {
-    if (object->IsJSArray()) {
+    if (IsJSArray(*object)) {
       Handle<JSArray> array = Handle<JSArray>::cast(object);
       uint32_t length;
       if (!array->HasArrayPrototype(isolate) ||
-          !array->length().ToUint32(&length) || !array->HasFastElements() ||
+          !Object::ToUint32(array->length(), &length) ||
+          !array->HasFastElements() ||
           !JSObject::PrototypeHasNoElements(isolate, *array)) {
         return MaybeHandle<FixedArray>();
       }
       return array->GetElementsAccessor()->CreateListFromArrayLike(
           isolate, array, length);
-    } else if (object->IsJSTypedArray()) {
+    } else if (IsJSTypedArray(*object)) {
       Handle<JSTypedArray> array = Handle<JSTypedArray>::cast(object);
       size_t length = array->GetLength();
       if (array->IsDetachedOrOutOfBounds() ||
@@ -1065,7 +1094,7 @@ MaybeHandle<FixedArray> Object::CreateListFromArrayLike(
   // 1. ReturnIfAbrupt(object).
   // 2. (default elementTypes -- not applicable.)
   // 3. If Type(obj) is not Object, throw a TypeError exception.
-  if (!object->IsJSReceiver()) {
+  if (!IsJSReceiver(*object)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kCalledOnNonObject,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -1080,7 +1109,7 @@ MaybeHandle<FixedArray> Object::CreateListFromArrayLike(
                              Object::GetLengthFromArrayLike(isolate, receiver),
                              FixedArray);
   uint32_t len;
-  if (!raw_length_number->ToUint32(&len) ||
+  if (!Object::ToUint32(*raw_length_number, &len) ||
       len > static_cast<uint32_t>(FixedArray::kMaxLength)) {
     THROW_NEW_ERROR(isolate,
                     NewRangeError(MessageTemplate::kInvalidArrayLength),
@@ -1104,7 +1133,7 @@ MaybeHandle<FixedArray> Object::CreateListFromArrayLike(
       case ElementTypes::kStringAndSymbol: {
         // 7c. If Type(next) is not an element of elementTypes, throw a
         //     TypeError exception.
-        if (!next->IsName()) {
+        if (!IsName(*next)) {
           THROW_NEW_ERROR(isolate,
                           NewTypeError(MessageTemplate::kNotPropertyName, next),
                           FixedArray);
@@ -1145,8 +1174,8 @@ MaybeHandle<Object> Object::GetProperty(LookupIterator* it,
         Handle<Object> receiver = it->GetReceiver();
         // In case of global IC, the receiver is the global object. Replace by
         // the global proxy.
-        if (receiver->IsJSGlobalObject()) {
-          receiver = handle(JSGlobalObject::cast(*receiver).global_proxy(),
+        if (IsJSGlobalObject(*receiver)) {
+          receiver = handle(JSGlobalObject::cast(*receiver)->global_proxy(),
                             it->isolate());
         }
         if (is_global_reference) {
@@ -1187,6 +1216,27 @@ MaybeHandle<Object> Object::GetProperty(LookupIterator* it,
     }
   }
 
+  if (it->IsPrivateName()) {
+    Handle<Symbol> private_symbol = Handle<Symbol>::cast(it->name());
+    Handle<String> name_string(String::cast(private_symbol->description()),
+                               it->isolate());
+    if (private_symbol->is_private_brand()) {
+      Handle<String> class_name =
+          (name_string->length() == 0)
+              ? it->isolate()->factory()->anonymous_string()
+              : name_string;
+      THROW_NEW_ERROR(
+          it->isolate(),
+          NewTypeError(MessageTemplate::kInvalidPrivateBrandInstance,
+                       class_name),
+          Object);
+    }
+    THROW_NEW_ERROR(
+        it->isolate(),
+        NewTypeError(MessageTemplate::kInvalidPrivateMemberRead, name_string),
+        Object);
+  }
+
   return it->isolate()->factory()->undefined_value();
 }
 
@@ -1217,9 +1267,10 @@ MaybeHandle<Object> JSProxy::GetProperty(Isolate* isolate,
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION(
       isolate, trap,
-      Object::GetMethod(Handle<JSReceiver>::cast(handler), trap_name), Object);
+      Object::GetMethod(isolate, Handle<JSReceiver>::cast(handler), trap_name),
+      Object);
   // 7. If trap is undefined, then
-  if (trap->IsUndefined(isolate)) {
+  if (IsUndefined(*trap, isolate)) {
     // 7.a Return target.[[Get]](P, Receiver).
     PropertyKey key(isolate, name);
     LookupIterator it(isolate, receiver, key, target);
@@ -1264,7 +1315,7 @@ MaybeHandle<Object> JSProxy::CheckGetSetTrapResult(Isolate* isolate,
     bool inconsistent = PropertyDescriptor::IsDataDescriptor(&target_desc) &&
                         !target_desc.configurable() &&
                         !target_desc.writable() &&
-                        !trap_result->SameValue(*target_desc.value());
+                        !Object::SameValue(*trap_result, *target_desc.value());
     if (inconsistent) {
       if (access_kind == kGet) {
         THROW_NEW_ERROR(
@@ -1284,12 +1335,12 @@ MaybeHandle<Object> JSProxy::CheckGetSetTrapResult(Isolate* isolate,
     if (access_kind == kGet) {
       inconsistent = PropertyDescriptor::IsAccessorDescriptor(&target_desc) &&
                      !target_desc.configurable() &&
-                     target_desc.get()->IsUndefined(isolate) &&
-                     !trap_result->IsUndefined(isolate);
+                     IsUndefined(*target_desc.get(), isolate) &&
+                     !IsUndefined(*trap_result, isolate);
     } else {
       inconsistent = PropertyDescriptor::IsAccessorDescriptor(&target_desc) &&
                      !target_desc.configurable() &&
-                     target_desc.set()->IsUndefined(isolate);
+                     IsUndefined(*target_desc.set(), isolate);
     }
     if (inconsistent) {
       if (access_kind == kGet) {
@@ -1308,13 +1359,14 @@ MaybeHandle<Object> JSProxy::CheckGetSetTrapResult(Isolate* isolate,
   return isolate->factory()->undefined_value();
 }
 
-bool Object::ToInt32(int32_t* value) {
-  if (IsSmi()) {
-    *value = Smi::ToInt(*this);
+// static
+bool Object::ToInt32(Tagged<Object> obj, int32_t* value) {
+  if (IsSmi(obj)) {
+    *value = Smi::ToInt(obj);
     return true;
   }
-  if (IsHeapNumber()) {
-    double num = HeapNumber::cast(*this).value();
+  if (IsHeapNumber(obj)) {
+    double num = HeapNumber::cast(obj)->value();
     // Check range before conversion to avoid undefined behavior.
     if (num >= kMinInt && num <= kMaxInt && FastI2D(FastD2I(num)) == num) {
       *value = FastD2I(num);
@@ -1324,26 +1376,6 @@ bool Object::ToInt32(int32_t* value) {
   return false;
 }
 
-// static
-Handle<TemplateList> TemplateList::New(Isolate* isolate, int size) {
-  Handle<FixedArray> list = isolate->factory()->NewFixedArray(
-      kLengthIndex + size, AllocationType::kOld);
-  list->set(kLengthIndex, Smi::zero());
-  return Handle<TemplateList>::cast(list);
-}
-
-// static
-Handle<TemplateList> TemplateList::Add(Isolate* isolate,
-                                       Handle<TemplateList> list,
-                                       Handle<i::Object> value) {
-  static_assert(kFirstElementIndex == 1);
-  int index = list->length() + 1;
-  Handle<i::FixedArray> fixed_array = Handle<FixedArray>::cast(list);
-  fixed_array = FixedArray::SetAndGrow(isolate, fixed_array, index, value);
-  fixed_array->set(kLengthIndex, Smi::FromInt(index));
-  return Handle<TemplateList>::cast(fixed_array);
-}
-
 // ES6 9.5.1
 // static
 MaybeHandle<HeapObject> JSProxy::GetPrototype(Handle<JSProxy> proxy) {
@@ -1367,9 +1399,10 @@ MaybeHandle<HeapObject> JSProxy::GetPrototype(Handle<JSProxy> proxy) {
   // 5. Let trap be ? GetMethod(handler, "getPrototypeOf").
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION(isolate, trap,
-                             Object::GetMethod(handler, trap_name), HeapObject);
+                             Object::GetMethod(isolate, handler, trap_name),
+                             HeapObject);
   // 6. If trap is undefined, then return target.[[GetPrototypeOf]]().
-  if (trap->IsUndefined(isolate)) {
+  if (IsUndefined(*trap, isolate)) {
     return JSReceiver::GetPrototype(isolate, target);
   }
   // 7. Let handlerProto be ? Call(trap, handler, «target»).
@@ -1380,7 +1413,7 @@ MaybeHandle<HeapObject> JSProxy::GetPrototype(Handle<JSProxy> proxy) {
       Execution::Call(isolate, trap, handler, arraysize(argv), argv),
       HeapObject);
   // 8. If Type(handlerProto) is neither Object nor Null, throw a TypeError.
-  if (!(handler_proto->IsJSReceiver() || handler_proto->IsNull(isolate))) {
+  if (!(IsJSReceiver(*handler_proto) || IsNull(*handler_proto, isolate))) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kProxyGetPrototypeOfInvalid),
                     HeapObject);
@@ -1396,7 +1429,7 @@ MaybeHandle<HeapObject> JSProxy::GetPrototype(Handle<JSProxy> proxy) {
                              JSReceiver::GetPrototype(isolate, target),
                              HeapObject);
   // 12. If SameValue(handlerProto, targetProto) is false, throw a TypeError.
-  if (!handler_proto->SameValue(*target_proto)) {
+  if (!Object::SameValue(*handler_proto, *target_proto)) {
     THROW_NEW_ERROR(
         isolate,
         NewTypeError(MessageTemplate::kProxyGetPrototypeOfNonExtensible),
@@ -1412,23 +1445,25 @@ MaybeHandle<Object> Object::GetPropertyWithAccessor(LookupIterator* it) {
   Handle<Object> receiver = it->GetReceiver();
   // In case of global IC, the receiver is the global object. Replace by the
   // global proxy.
-  if (receiver->IsJSGlobalObject()) {
-    receiver = handle(JSGlobalObject::cast(*receiver).global_proxy(), isolate);
+  if (IsJSGlobalObject(*receiver)) {
+    receiver = handle(JSGlobalObject::cast(*receiver)->global_proxy(), isolate);
   }
 
   // We should never get here to initialize a const with the hole value since a
   // const declaration would conflict with the getter.
-  DCHECK(!structure->IsForeign());
+  DCHECK(!IsForeign(*structure));
 
   // API style callbacks.
   Handle<JSObject> holder = it->GetHolder<JSObject>();
-  if (structure->IsAccessorInfo()) {
+  if (IsAccessorInfo(*structure)) {
     Handle<Name> name = it->GetName();
     Handle<AccessorInfo> info = Handle<AccessorInfo>::cast(structure);
 
-    if (!info->has_getter()) return isolate->factory()->undefined_value();
+    if (!info->has_getter(isolate)) {
+      return isolate->factory()->undefined_value();
+    }
 
-    if (info->is_sloppy() && !receiver->IsJSReceiver()) {
+    if (info->is_sloppy() && !IsJSReceiver(*receiver)) {
       ASSIGN_RETURN_ON_EXCEPTION(isolate, receiver,
                                  Object::ConvertReceiver(isolate, receiver),
                                  Object);
@@ -1440,7 +1475,7 @@ MaybeHandle<Object> Object::GetPropertyWithAccessor(LookupIterator* it) {
     RETURN_EXCEPTION_IF_SCHEDULED_EXCEPTION(isolate, Object);
     if (result.is_null()) return isolate->factory()->undefined_value();
     Handle<Object> reboxed_result = handle(*result, isolate);
-    if (info->replace_on_access() && receiver->IsJSReceiver()) {
+    if (info->replace_on_access() && IsJSReceiver(*receiver)) {
       RETURN_ON_EXCEPTION(isolate,
                           Accessors::ReplaceAccessorWithDataProperty(
                               isolate, receiver, holder, name, result),
@@ -1457,13 +1492,13 @@ MaybeHandle<Object> Object::GetPropertyWithAccessor(LookupIterator* it) {
 
   // Regular accessor.
   Handle<Object> getter(accessor_pair->getter(), isolate);
-  if (getter->IsFunctionTemplateInfo()) {
+  if (IsFunctionTemplateInfo(*getter)) {
     SaveAndSwitchContext save(isolate,
                               *holder->GetCreationContext().ToHandleChecked());
     return Builtins::InvokeApiFunction(
         isolate, false, Handle<FunctionTemplateInfo>::cast(getter), receiver, 0,
         nullptr, isolate->factory()->undefined_value());
-  } else if (getter->IsCallable()) {
+  } else if (IsCallable(*getter)) {
     // TODO(rossberg): nicer would be to cast to some JSCallable here...
     return Object::GetPropertyWithDefinedGetter(
         receiver, Handle<JSReceiver>::cast(getter));
@@ -1480,28 +1515,28 @@ Maybe<bool> Object::SetPropertyWithAccessor(
   Handle<Object> receiver = it->GetReceiver();
   // In case of global IC, the receiver is the global object. Replace by the
   // global proxy.
-  if (receiver->IsJSGlobalObject()) {
-    receiver = handle(JSGlobalObject::cast(*receiver).global_proxy(), isolate);
+  if (IsJSGlobalObject(*receiver)) {
+    receiver = handle(JSGlobalObject::cast(*receiver)->global_proxy(), isolate);
   }
 
   // We should never get here to initialize a const with the hole value since a
   // const declaration would conflict with the setter.
-  DCHECK(!structure->IsForeign());
+  DCHECK(!IsForeign(*structure));
 
   // API style callbacks.
   Handle<JSObject> holder = it->GetHolder<JSObject>();
-  if (structure->IsAccessorInfo()) {
+  if (IsAccessorInfo(*structure)) {
     Handle<Name> name = it->GetName();
     Handle<AccessorInfo> info = Handle<AccessorInfo>::cast(structure);
 
-    if (!info->has_setter()) {
+    if (!info->has_setter(isolate)) {
       // TODO(verwaest): We should not get here anymore once all AccessorInfos
       // are marked as special_data_property. They cannot both be writable and
       // not have a setter.
       return Just(true);
     }
 
-    if (info->is_sloppy() && !receiver->IsJSReceiver()) {
+    if (info->is_sloppy() && !IsJSReceiver(*receiver)) {
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate, receiver, Object::ConvertReceiver(isolate, receiver),
           Nothing<bool>());
@@ -1522,14 +1557,14 @@ Maybe<bool> Object::SetPropertyWithAccessor(
     // (signalling an exception) or a boolean Oddball.
     RETURN_VALUE_IF_SCHEDULED_EXCEPTION(isolate, Nothing<bool>());
     if (result.is_null()) return Just(true);
-    DCHECK(result->BooleanValue(isolate) ||
+    DCHECK(Object::BooleanValue(*result, isolate) ||
            GetShouldThrow(isolate, maybe_should_throw) == kDontThrow);
-    return Just(result->BooleanValue(isolate));
+    return Just(Object::BooleanValue(*result, isolate));
   }
 
   // Regular accessor.
-  Handle<Object> setter(AccessorPair::cast(*structure).setter(), isolate);
-  if (setter->IsFunctionTemplateInfo()) {
+  Handle<Object> setter(AccessorPair::cast(*structure)->setter(), isolate);
+  if (IsFunctionTemplateInfo(*setter)) {
     SaveAndSwitchContext save(isolate,
                               *holder->GetCreationContext().ToHandleChecked());
     Handle<Object> argv[] = {value};
@@ -1541,7 +1576,7 @@ Maybe<bool> Object::SetPropertyWithAccessor(
                                     isolate->factory()->undefined_value()),
         Nothing<bool>());
     return Just(true);
-  } else if (setter->IsCallable()) {
+  } else if (IsCallable(*setter)) {
     // TODO(rossberg): nicer would be to cast to some JSCallable here...
     return SetPropertyWithDefinedSetter(
         receiver, Handle<JSReceiver>::cast(setter), value, maybe_should_throw);
@@ -1586,56 +1621,61 @@ Maybe<bool> Object::SetPropertyWithDefinedSetter(
   return Just(true);
 }
 
-Map Object::GetPrototypeChainRootMap(Isolate* isolate) const {
+// static
+Tagged<Map> Object::GetPrototypeChainRootMap(Tagged<Object> obj,
+                                             Isolate* isolate) {
   DisallowGarbageCollection no_alloc;
-  if (IsSmi()) {
-    Context native_context = isolate->context().native_context();
-    return native_context.number_function().initial_map();
+  if (IsSmi(obj)) {
+    Tagged<Context> native_context = isolate->context()->native_context();
+    return native_context->number_function()->initial_map();
   }
 
-  const HeapObject heap_object = HeapObject::cast(*this);
-  return heap_object.map().GetPrototypeChainRootMap(isolate);
+  const Tagged<HeapObject> heap_object = HeapObject::cast(obj);
+  return heap_object->map()->GetPrototypeChainRootMap(isolate);
 }
 
-Smi Object::GetOrCreateHash(Isolate* isolate) {
+// static
+Tagged<Smi> Object::GetOrCreateHash(Tagged<Object> obj, Isolate* isolate) {
   DisallowGarbageCollection no_gc;
-  Object hash = Object::GetSimpleHash(*this);
-  if (hash.IsSmi()) return Smi::cast(hash);
+  Tagged<Object> hash = Object::GetSimpleHash(obj);
+  if (IsSmi(hash)) return Smi::cast(hash);
 
-  DCHECK(IsJSReceiver());
-  return JSReceiver::cast(*this).GetOrCreateIdentityHash(isolate);
+  DCHECK(IsJSReceiver(obj));
+  return JSReceiver::cast(obj)->GetOrCreateIdentityHash(isolate);
 }
 
-bool Object::SameValue(Object other) {
-  if (other == *this) return true;
+// static
+bool Object::SameValue(Tagged<Object> obj, Tagged<Object> other) {
+  if (other == obj) return true;
 
-  if (IsNumber() && other.IsNumber()) {
-    return SameNumberValue(Number(), other.Number());
+  if (IsNumber(obj) && IsNumber(other)) {
+    return SameNumberValue(Object::Number(obj), Object::Number(other));
   }
-  if (IsString() && other.IsString()) {
-    return String::cast(*this).Equals(String::cast(other));
+  if (IsString(obj) && IsString(other)) {
+    return String::cast(obj)->Equals(String::cast(other));
   }
-  if (IsBigInt() && other.IsBigInt()) {
-    return BigInt::EqualToBigInt(BigInt::cast(*this), BigInt::cast(other));
+  if (IsBigInt(obj) && IsBigInt(other)) {
+    return BigInt::EqualToBigInt(BigInt::cast(obj), BigInt::cast(other));
   }
   return false;
 }
 
-bool Object::SameValueZero(Object other) {
-  if (other == *this) return true;
+// static
+bool Object::SameValueZero(Tagged<Object> obj, Tagged<Object> other) {
+  if (other == obj) return true;
 
-  if (IsNumber() && other.IsNumber()) {
-    double this_value = Number();
-    double other_value = other.Number();
+  if (IsNumber(obj) && IsNumber(other)) {
+    double this_value = Object::Number(obj);
+    double other_value = Object::Number(other);
     // +0 == -0 is true
     return this_value == other_value ||
            (std::isnan(this_value) && std::isnan(other_value));
   }
-  if (IsString() && other.IsString()) {
-    return String::cast(*this).Equals(String::cast(other));
+  if (IsString(obj) && IsString(other)) {
+    return String::cast(obj)->Equals(String::cast(other));
   }
-  if (IsBigInt() && other.IsBigInt()) {
-    return BigInt::EqualToBigInt(BigInt::cast(*this), BigInt::cast(other));
+  if (IsBigInt(obj) && IsBigInt(other)) {
+    return BigInt::EqualToBigInt(BigInt::cast(obj), BigInt::cast(other));
   }
   return false;
 }
@@ -1644,13 +1684,13 @@ MaybeHandle<Object> Object::ArraySpeciesConstructor(
     Isolate* isolate, Handle<Object> original_array) {
   Handle<Object> default_species = isolate->array_function();
   if (!v8_flags.builtin_subclassing) return default_species;
-  if (original_array->IsJSArray() &&
+  if (IsJSArray(*original_array) &&
       Handle<JSArray>::cast(original_array)->HasArrayPrototype(isolate) &&
       Protectors::IsArraySpeciesLookupChainIntact(isolate)) {
     return default_species;
   }
   Handle<Object> constructor = isolate->factory()->undefined_value();
-  Maybe<bool> is_array = Object::IsArray(original_array);
+  Maybe<bool> is_array = IsArray(original_array);
   MAYBE_RETURN_NULL(is_array);
   if (is_array.FromJust()) {
     ASSIGN_RETURN_ON_EXCEPTION(
@@ -1658,7 +1698,7 @@ MaybeHandle<Object> Object::ArraySpeciesConstructor(
         Object::GetProperty(isolate, original_array,
                             isolate->factory()->constructor_string()),
         Object);
-    if (constructor->IsConstructor()) {
+    if (IsConstructor(*constructor)) {
       Handle<Context> constructor_context;
       ASSIGN_RETURN_ON_EXCEPTION(
           isolate, constructor_context,
@@ -1669,22 +1709,22 @@ MaybeHandle<Object> Object::ArraySpeciesConstructor(
         constructor = isolate->factory()->undefined_value();
       }
     }
-    if (constructor->IsJSReceiver()) {
+    if (IsJSReceiver(*constructor)) {
       ASSIGN_RETURN_ON_EXCEPTION(
           isolate, constructor,
           JSReceiver::GetProperty(isolate,
                                   Handle<JSReceiver>::cast(constructor),
                                   isolate->factory()->species_symbol()),
           Object);
-      if (constructor->IsNull(isolate)) {
+      if (IsNull(*constructor, isolate)) {
         constructor = isolate->factory()->undefined_value();
       }
     }
   }
-  if (constructor->IsUndefined(isolate)) {
+  if (IsUndefined(*constructor, isolate)) {
     return default_species;
   } else {
-    if (!constructor->IsConstructor()) {
+    if (!IsConstructor(*constructor)) {
       THROW_NEW_ERROR(isolate,
                       NewTypeError(MessageTemplate::kSpeciesNotConstructor),
                       Object);
@@ -1704,9 +1744,9 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Object::SpeciesConstructor(
                             isolate->factory()->constructor_string()),
       Object);
 
-  if (ctor_obj->IsUndefined(isolate)) return default_ctor;
+  if (IsUndefined(*ctor_obj, isolate)) return default_ctor;
 
-  if (!ctor_obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*ctor_obj)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kConstructorNotReceiver),
                     Object);
@@ -1721,30 +1761,31 @@ V8_WARN_UNUSED_RESULT MaybeHandle<Object> Object::SpeciesConstructor(
                             isolate->factory()->species_symbol()),
       Object);
 
-  if (species->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*species, isolate)) {
     return default_ctor;
   }
 
-  if (species->IsConstructor()) return species;
+  if (IsConstructor(*species)) return species;
 
   THROW_NEW_ERROR(
       isolate, NewTypeError(MessageTemplate::kSpeciesNotConstructor), Object);
 }
 
-bool Object::IterationHasObservableEffects() {
+// static
+bool Object::IterationHasObservableEffects(Tagged<Object> obj) {
   // Check that this object is an array.
-  if (!IsJSArray()) return true;
-  JSArray array = JSArray::cast(*this);
-  Isolate* isolate = array.GetIsolate();
+  if (!IsJSArray(obj)) return true;
+  Tagged<JSArray> array = JSArray::cast(obj);
+  Isolate* isolate = array->GetIsolate();
 
   // Check that we have the original ArrayPrototype.
   i::HandleScope handle_scope(isolate);
   i::Handle<i::Context> context;
-  if (!array.GetCreationContext().ToHandle(&context)) return false;
-  if (!array.map().prototype().IsJSObject()) return true;
-  JSObject array_proto = JSObject::cast(array.map().prototype());
+  if (!array->GetCreationContext().ToHandle(&context)) return false;
+  if (!IsJSObject(array->map()->prototype())) return true;
+  Tagged<JSObject> array_proto = JSObject::cast(array->map()->prototype());
   auto initial_array_prototype =
-      context->native_context().initial_array_prototype();
+      context->native_context()->initial_array_prototype();
   if (initial_array_prototype != array_proto) return true;
 
   // Check that the ArrayPrototype hasn't been modified in a way that would
@@ -1753,7 +1794,7 @@ bool Object::IterationHasObservableEffects() {
 
   // For FastPacked kinds, iteration will have the same effect as simply
   // accessing each property in order.
-  ElementsKind array_kind = array.GetElementsKind();
+  ElementsKind array_kind = array->GetElementsKind();
   if (IsFastPackedElementsKind(array_kind)) return false;
 
   // For FastHoley kinds, an element access on a hole would cause a lookup on
@@ -1766,372 +1807,51 @@ bool Object::IterationHasObservableEffects() {
   return true;
 }
 
-bool Object::IsCodeLike(Isolate* isolate) const {
+// static
+bool Object::IsCodeLike(Tagged<Object> obj, Isolate* isolate) {
   DisallowGarbageCollection no_gc;
-  return IsJSReceiver() && JSReceiver::cast(*this).IsCodeLike(isolate);
+  return IsJSReceiver(obj) && JSReceiver::cast(obj)->IsCodeLike(isolate);
 }
 
-void Object::ShortPrint(FILE* out) const {
+void ShortPrint(Tagged<Object> obj, FILE* out) {
   OFStream os(out);
-  os << Brief(*this);
+  os << Brief(obj);
 }
 
-void Object::ShortPrint(StringStream* accumulator) const {
+void ShortPrint(Tagged<Object> obj, StringStream* accumulator) {
   std::ostringstream os;
-  os << Brief(*this);
+  os << Brief(obj);
   accumulator->Add(os.str().c_str());
 }
 
-void Object::ShortPrint(std::ostream& os) const { os << Brief(*this); }
+void ShortPrint(Tagged<Object> obj, std::ostream& os) { os << Brief(obj); }
 
-std::ostream& operator<<(std::ostream& os, const Object& obj) {
-  obj.ShortPrint(os);
+std::ostream& operator<<(std::ostream& os, Tagged<Object> obj) {
+  ShortPrint(obj, os);
   return os;
 }
 
 std::ostream& operator<<(std::ostream& os, const Brief& v) {
   MaybeObject maybe_object(v.value);
-  Smi smi;
-  HeapObject heap_object;
+  Tagged<Smi> smi;
+  Tagged<HeapObject> heap_object;
   if (maybe_object->ToSmi(&smi)) {
-    smi.SmiPrint(os);
+    Smi::SmiPrint(smi, os);
   } else if (maybe_object->IsCleared()) {
     os << "[cleared]";
-  } else if (maybe_object->GetHeapObjectIfWeak(&heap_object)) {
+  } else if (maybe_object.GetHeapObjectIfWeak(&heap_object)) {
     os << "[weak] ";
-    heap_object.HeapObjectShortPrint(os);
-  } else if (maybe_object->GetHeapObjectIfStrong(&heap_object)) {
-    heap_object.HeapObjectShortPrint(os);
+    heap_object->HeapObjectShortPrint(os);
+  } else if (maybe_object.GetHeapObjectIfStrong(&heap_object)) {
+    heap_object->HeapObjectShortPrint(os);
   } else {
     UNREACHABLE();
   }
   return os;
 }
 
-void Smi::SmiPrint(std::ostream& os) const { os << value(); }
-
-void HeapObject::HeapObjectShortPrint(std::ostream& os) {
-  PtrComprCageBase cage_base = GetPtrComprCageBaseSlow(*this);
-  os << AsHex::Address(this->ptr()) << " ";
-
-  if (IsString(cage_base)) {
-    HeapStringAllocator allocator;
-    StringStream accumulator(&allocator);
-    String::cast(*this).StringShortPrint(&accumulator);
-    os << accumulator.ToCString().get();
-    return;
-  }
-  if (IsJSObject(cage_base)) {
-    HeapStringAllocator allocator;
-    StringStream accumulator(&allocator);
-    JSObject::cast(*this).JSObjectShortPrint(&accumulator);
-    os << accumulator.ToCString().get();
-    return;
-  }
-  switch (map(cage_base).instance_type()) {
-    case MAP_TYPE: {
-      os << "<Map";
-      Map mapInstance = Map::cast(*this);
-      if (mapInstance.instance_size() != kVariableSizeSentinel) {
-        os << "[" << mapInstance.instance_size() << "]";
-      }
-      os << "(";
-      if (mapInstance.IsJSObjectMap()) {
-        os << ElementsKindToString(mapInstance.elements_kind());
-      } else {
-        os << mapInstance.instance_type();
-      }
-      os << ")>";
-    } break;
-    case AWAIT_CONTEXT_TYPE: {
-      os << "<AwaitContext generator= ";
-      HeapStringAllocator allocator;
-      StringStream accumulator(&allocator);
-      Context::cast(*this).extension().ShortPrint(&accumulator);
-      os << accumulator.ToCString().get();
-      os << '>';
-      break;
-    }
-    case BLOCK_CONTEXT_TYPE:
-      os << "<BlockContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case CATCH_CONTEXT_TYPE:
-      os << "<CatchContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case DEBUG_EVALUATE_CONTEXT_TYPE:
-      os << "<DebugEvaluateContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case EVAL_CONTEXT_TYPE:
-      os << "<EvalContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case FUNCTION_CONTEXT_TYPE:
-      os << "<FunctionContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case MODULE_CONTEXT_TYPE:
-      os << "<ModuleContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case NATIVE_CONTEXT_TYPE:
-      os << "<NativeContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case SCRIPT_CONTEXT_TYPE:
-      os << "<ScriptContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case WITH_CONTEXT_TYPE:
-      os << "<WithContext[" << Context::cast(*this).length() << "]>";
-      break;
-    case SCRIPT_CONTEXT_TABLE_TYPE:
-      os << "<ScriptContextTable[" << FixedArray::cast(*this).length() << "]>";
-      break;
-    case HASH_TABLE_TYPE:
-      os << "<HashTable[" << FixedArray::cast(*this).length() << "]>";
-      break;
-    case ORDERED_HASH_MAP_TYPE:
-      os << "<OrderedHashMap[" << FixedArray::cast(*this).length() << "]>";
-      break;
-    case ORDERED_HASH_SET_TYPE:
-      os << "<OrderedHashSet[" << FixedArray::cast(*this).length() << "]>";
-      break;
-    case ORDERED_NAME_DICTIONARY_TYPE:
-      os << "<OrderedNameDictionary[" << FixedArray::cast(*this).length()
-         << "]>";
-      break;
-    case NAME_DICTIONARY_TYPE:
-      os << "<NameDictionary[" << FixedArray::cast(*this).length() << "]>";
-      break;
-    case SWISS_NAME_DICTIONARY_TYPE:
-      os << "<SwissNameDictionary["
-         << SwissNameDictionary::cast(*this).Capacity() << "]>";
-      break;
-    case GLOBAL_DICTIONARY_TYPE:
-      os << "<GlobalDictionary[" << FixedArray::cast(*this).length() << "]>";
-      break;
-    case NUMBER_DICTIONARY_TYPE:
-      os << "<NumberDictionary[" << FixedArray::cast(*this).length() << "]>";
-      break;
-    case SIMPLE_NUMBER_DICTIONARY_TYPE:
-      os << "<SimpleNumberDictionary[" << FixedArray::cast(*this).length()
-         << "]>";
-      break;
-    case FIXED_ARRAY_TYPE:
-      os << "<FixedArray[" << FixedArray::cast(*this).length() << "]>";
-      break;
-    case OBJECT_BOILERPLATE_DESCRIPTION_TYPE:
-      os << "<ObjectBoilerplateDescription[" << FixedArray::cast(*this).length()
-         << "]>";
-      break;
-    case FIXED_DOUBLE_ARRAY_TYPE:
-      os << "<FixedDoubleArray[" << FixedDoubleArray::cast(*this).length()
-         << "]>";
-      break;
-    case BYTE_ARRAY_TYPE:
-      os << "<ByteArray[" << ByteArray::cast(*this).length() << "]>";
-      break;
-    case BYTECODE_ARRAY_TYPE:
-      os << "<BytecodeArray[" << BytecodeArray::cast(*this).length() << "]>";
-      break;
-    case DESCRIPTOR_ARRAY_TYPE:
-      os << "<DescriptorArray["
-         << DescriptorArray::cast(*this).number_of_descriptors() << "]>";
-      break;
-    case TRANSITION_ARRAY_TYPE:
-      os << "<TransitionArray[" << TransitionArray::cast(*this).length()
-         << "]>";
-      break;
-    case PROPERTY_ARRAY_TYPE:
-      os << "<PropertyArray[" << PropertyArray::cast(*this).length() << "]>";
-      break;
-    case FEEDBACK_CELL_TYPE: {
-      {
-        ReadOnlyRoots roots = GetReadOnlyRoots();
-        os << "<FeedbackCell[";
-        if (map() == roots.no_closures_cell_map()) {
-          os << "no feedback";
-        } else if (map() == roots.one_closure_cell_map()) {
-          os << "one closure";
-        } else if (map() == roots.many_closures_cell_map()) {
-          os << "many closures";
-        } else {
-          os << "!!!INVALID MAP!!!";
-        }
-        os << "]>";
-      }
-      break;
-    }
-    case CLOSURE_FEEDBACK_CELL_ARRAY_TYPE:
-      os << "<ClosureFeedbackCellArray["
-         << ClosureFeedbackCellArray::cast(*this).length() << "]>";
-      break;
-    case FEEDBACK_VECTOR_TYPE:
-      os << "<FeedbackVector[" << FeedbackVector::cast(*this).length() << "]>";
-      break;
-    case FREE_SPACE_TYPE:
-      os << "<FreeSpace[" << FreeSpace::cast(*this).size(kRelaxedLoad) << "]>";
-      break;
-
-    case PREPARSE_DATA_TYPE: {
-      PreparseData data = PreparseData::cast(*this);
-      os << "<PreparseData[data=" << data.data_length()
-         << " children=" << data.children_length() << "]>";
-      break;
-    }
-
-    case UNCOMPILED_DATA_WITHOUT_PREPARSE_DATA_TYPE: {
-      UncompiledDataWithoutPreparseData data =
-          UncompiledDataWithoutPreparseData::cast(*this);
-      os << "<UncompiledDataWithoutPreparseData (" << data.start_position()
-         << ", " << data.end_position() << ")]>";
-      break;
-    }
-
-    case UNCOMPILED_DATA_WITH_PREPARSE_DATA_TYPE: {
-      UncompiledDataWithPreparseData data =
-          UncompiledDataWithPreparseData::cast(*this);
-      os << "<UncompiledDataWithPreparseData (" << data.start_position() << ", "
-         << data.end_position() << ") preparsed=" << Brief(data.preparse_data())
-         << ">";
-      break;
-    }
-
-    case SHARED_FUNCTION_INFO_TYPE: {
-      SharedFunctionInfo shared = SharedFunctionInfo::cast(*this);
-      std::unique_ptr<char[]> debug_name = shared.DebugNameCStr();
-      if (debug_name[0] != '\0') {
-        os << "<SharedFunctionInfo " << debug_name.get() << ">";
-      } else {
-        os << "<SharedFunctionInfo>";
-      }
-      break;
-    }
-    case JS_MESSAGE_OBJECT_TYPE:
-      os << "<JSMessageObject>";
-      break;
-#define MAKE_STRUCT_CASE(TYPE, Name, name)   \
-  case TYPE:                                 \
-    os << "<" #Name;                         \
-    Name::cast(*this).BriefPrintDetails(os); \
-    os << ">";                               \
-    break;
-      STRUCT_LIST(MAKE_STRUCT_CASE)
-#undef MAKE_STRUCT_CASE
-    case ALLOCATION_SITE_TYPE: {
-      os << "<AllocationSite";
-      AllocationSite::cast(*this).BriefPrintDetails(os);
-      os << ">";
-      break;
-    }
-    case SCOPE_INFO_TYPE: {
-      ScopeInfo scope = ScopeInfo::cast(*this);
-      os << "<ScopeInfo";
-      if (!scope.IsEmpty()) os << " " << scope.scope_type();
-      os << ">";
-      break;
-    }
-    case CODE_TYPE: {
-      Code code = Code::cast(*this);
-      os << "<Code " << CodeKindToString(code.kind());
-      if (code.is_builtin()) {
-        os << " " << Builtins::name(code.builtin_id());
-      }
-      os << ">";
-      break;
-    }
-    case INSTRUCTION_STREAM_TYPE: {
-      InstructionStream istream = InstructionStream::cast(*this);
-      Code code = istream.code(kAcquireLoad);
-      os << "<InstructionStream " << CodeKindToString(code.kind());
-      if (code.is_builtin()) {
-        os << " " << Builtins::name(code.builtin_id());
-      }
-      os << ">";
-      break;
-    }
-    case ODDBALL_TYPE: {
-      if (IsUndefined()) {
-        os << "<undefined>";
-      } else if (IsTheHole()) {
-        os << "<the_hole>";
-      } else if (IsNull()) {
-        os << "<null>";
-      } else if (IsTrue()) {
-        os << "<true>";
-      } else if (IsFalse()) {
-        os << "<false>";
-      } else {
-        os << "<Odd Oddball: ";
-        os << Oddball::cast(*this).to_string().ToCString().get();
-        os << ">";
-      }
-      break;
-    }
-    case SYMBOL_TYPE: {
-      Symbol symbol = Symbol::cast(*this);
-      symbol.SymbolShortPrint(os);
-      break;
-    }
-    case HEAP_NUMBER_TYPE: {
-      os << "<HeapNumber ";
-      HeapNumber::cast(*this).HeapNumberShortPrint(os);
-      os << ">";
-      break;
-    }
-    case BIGINT_TYPE: {
-      os << "<BigInt ";
-      BigInt::cast(*this).BigIntShortPrint(os);
-      os << ">";
-      break;
-    }
-    case JS_PROXY_TYPE:
-      os << "<JSProxy>";
-      break;
-    case FOREIGN_TYPE:
-      os << "<Foreign>";
-      break;
-    case CELL_TYPE: {
-      os << "<Cell value= ";
-      HeapStringAllocator allocator;
-      StringStream accumulator(&allocator);
-      Cell::cast(*this).value().ShortPrint(&accumulator);
-      os << accumulator.ToCString().get();
-      os << '>';
-      break;
-    }
-    case PROPERTY_CELL_TYPE: {
-      PropertyCell cell = PropertyCell::cast(*this);
-      os << "<PropertyCell name=";
-      cell.name().ShortPrint(os);
-      os << " value=";
-      HeapStringAllocator allocator;
-      StringStream accumulator(&allocator);
-      cell.value(kAcquireLoad).ShortPrint(&accumulator);
-      os << accumulator.ToCString().get();
-      os << '>';
-      break;
-    }
-    case ACCESSOR_INFO_TYPE: {
-      AccessorInfo info = AccessorInfo::cast(*this);
-      os << "<AccessorInfo ";
-      os << "name= " << Brief(info.name());
-      os << ", data= " << Brief(info.data());
-      os << ">";
-      break;
-    }
-    case CALL_HANDLER_INFO_TYPE: {
-      CallHandlerInfo info = CallHandlerInfo::cast(*this);
-      os << "<CallHandlerInfo ";
-      os << "callback= " << reinterpret_cast<void*>(info.callback());
-      os << ", data= " << Brief(info.data());
-      if (info.IsSideEffectFreeCallHandlerInfo()) {
-        os << ", side_effect_free= true>";
-      } else {
-        os << ", side_effect_free= false>";
-      }
-      break;
-    }
-    default:
-      os << "<Other heap object (" << map().instance_type() << ")>";
-      break;
-  }
-}
+// static
+void Smi::SmiPrint(Tagged<Smi> smi, std::ostream& os) { os << smi.value(); }
 
 void Struct::BriefPrintDetails(std::ostream& os) {}
 
@@ -2156,145 +1876,137 @@ void HeapObject::Iterate(PtrComprCageBase cage_base, ObjectVisitor* v) {
 }
 
 void HeapObject::IterateBody(PtrComprCageBase cage_base, ObjectVisitor* v) {
-  Map m = map(cage_base);
+  Tagged<Map> m = map(cage_base);
   IterateBodyFast<ObjectVisitor>(m, SizeFromMap(m), v);
 }
 
-void HeapObject::IterateBody(Map map, int object_size, ObjectVisitor* v) {
+void HeapObject::IterateBody(Tagged<Map> map, int object_size,
+                             ObjectVisitor* v) {
   IterateBodyFast<ObjectVisitor>(map, object_size, v);
 }
 
-struct CallIsValidSlot {
-  template <typename BodyDescriptor>
-  static bool apply(Map map, HeapObject obj, int offset) {
-    return BodyDescriptor::IsValidSlot(map, obj, offset);
-  }
-};
-
-bool HeapObject::IsValidSlot(Map map, int offset) {
-  DCHECK_NE(0, offset);
-  return BodyDescriptorApply<CallIsValidSlot>(map.instance_type(), map, *this,
-                                              offset);
-}
-
-int HeapObject::SizeFromMap(Map map) const {
-  int instance_size = map.instance_size();
+int HeapObject::SizeFromMap(Tagged<Map> map) const {
+  int instance_size = map->instance_size();
   if (instance_size != kVariableSizeSentinel) return instance_size;
   // Only inline the most frequent cases.
-  InstanceType instance_type = map.instance_type();
+  InstanceType instance_type = map->instance_type();
   if (base::IsInRange(instance_type, FIRST_FIXED_ARRAY_TYPE,
                       LAST_FIXED_ARRAY_TYPE)) {
     return FixedArray::SizeFor(
-        FixedArray::unchecked_cast(*this).length(kAcquireLoad));
+        FixedArray::unchecked_cast(*this)->length(kAcquireLoad));
   }
   if (base::IsInRange(instance_type, FIRST_CONTEXT_TYPE, LAST_CONTEXT_TYPE)) {
     if (instance_type == NATIVE_CONTEXT_TYPE) return NativeContext::kSize;
-    return Context::SizeFor(Context::unchecked_cast(*this).length());
+    return Context::SizeFor(Context::unchecked_cast(*this)->length());
   }
-  if (instance_type == ONE_BYTE_STRING_TYPE ||
-      instance_type == ONE_BYTE_INTERNALIZED_STRING_TYPE ||
-      instance_type == SHARED_ONE_BYTE_STRING_TYPE) {
+  if (instance_type == SEQ_ONE_BYTE_STRING_TYPE ||
+      instance_type == INTERNALIZED_ONE_BYTE_STRING_TYPE ||
+      instance_type == SHARED_SEQ_ONE_BYTE_STRING_TYPE) {
     // Strings may get concurrently truncated, hence we have to access its
     // length synchronized.
     return SeqOneByteString::SizeFor(
-        SeqOneByteString::unchecked_cast(*this).length(kAcquireLoad));
+        SeqOneByteString::unchecked_cast(*this)->length(kAcquireLoad));
   }
   if (instance_type == BYTE_ARRAY_TYPE) {
     return ByteArray::SizeFor(
-        ByteArray::unchecked_cast(*this).length(kAcquireLoad));
+        ByteArray::unchecked_cast(*this)->length(kAcquireLoad));
   }
   if (instance_type == BYTECODE_ARRAY_TYPE) {
     return BytecodeArray::SizeFor(
-        BytecodeArray::unchecked_cast(*this).length(kAcquireLoad));
+        BytecodeArray::unchecked_cast(*this)->length(kAcquireLoad));
+  }
+  if (instance_type == EXTERNAL_POINTER_ARRAY_TYPE) {
+    return ExternalPointerArray::SizeFor(
+        ExternalPointerArray::unchecked_cast(*this)->length(kAcquireLoad));
   }
   if (instance_type == FREE_SPACE_TYPE) {
-    return FreeSpace::unchecked_cast(*this).size(kRelaxedLoad);
+    return FreeSpace::unchecked_cast(*this)->size(kRelaxedLoad);
   }
-  if (instance_type == STRING_TYPE ||
-      instance_type == INTERNALIZED_STRING_TYPE ||
-      instance_type == SHARED_STRING_TYPE) {
+  if (instance_type == SEQ_TWO_BYTE_STRING_TYPE ||
+      instance_type == INTERNALIZED_TWO_BYTE_STRING_TYPE ||
+      instance_type == SHARED_SEQ_TWO_BYTE_STRING_TYPE) {
     // Strings may get concurrently truncated, hence we have to access its
     // length synchronized.
     return SeqTwoByteString::SizeFor(
-        SeqTwoByteString::unchecked_cast(*this).length(kAcquireLoad));
+        SeqTwoByteString::unchecked_cast(*this)->length(kAcquireLoad));
   }
   if (instance_type == FIXED_DOUBLE_ARRAY_TYPE) {
     return FixedDoubleArray::SizeFor(
-        FixedDoubleArray::unchecked_cast(*this).length(kAcquireLoad));
+        FixedDoubleArray::unchecked_cast(*this)->length(kAcquireLoad));
   }
   if (instance_type == FEEDBACK_METADATA_TYPE) {
     return FeedbackMetadata::SizeFor(
-        FeedbackMetadata::unchecked_cast(*this).slot_count(kAcquireLoad));
+        FeedbackMetadata::unchecked_cast(*this)->slot_count(kAcquireLoad));
   }
   if (base::IsInRange(instance_type, FIRST_DESCRIPTOR_ARRAY_TYPE,
                       LAST_DESCRIPTOR_ARRAY_TYPE)) {
     return DescriptorArray::SizeFor(
-        DescriptorArray::unchecked_cast(*this).number_of_all_descriptors());
+        DescriptorArray::unchecked_cast(*this)->number_of_all_descriptors());
   }
   if (base::IsInRange(instance_type, FIRST_WEAK_FIXED_ARRAY_TYPE,
                       LAST_WEAK_FIXED_ARRAY_TYPE)) {
     return WeakFixedArray::SizeFor(
-        WeakFixedArray::unchecked_cast(*this).length(kAcquireLoad));
+        WeakFixedArray::unchecked_cast(*this)->length(kAcquireLoad));
   }
   if (instance_type == WEAK_ARRAY_LIST_TYPE) {
     return WeakArrayList::SizeForCapacity(
-        WeakArrayList::unchecked_cast(*this).capacity());
+        WeakArrayList::unchecked_cast(*this)->capacity());
   }
   if (instance_type == SMALL_ORDERED_HASH_SET_TYPE) {
     return SmallOrderedHashSet::SizeFor(
-        SmallOrderedHashSet::unchecked_cast(*this).Capacity());
+        SmallOrderedHashSet::unchecked_cast(*this)->Capacity());
   }
   if (instance_type == SMALL_ORDERED_HASH_MAP_TYPE) {
     return SmallOrderedHashMap::SizeFor(
-        SmallOrderedHashMap::unchecked_cast(*this).Capacity());
+        SmallOrderedHashMap::unchecked_cast(*this)->Capacity());
   }
   if (instance_type == SMALL_ORDERED_NAME_DICTIONARY_TYPE) {
     return SmallOrderedNameDictionary::SizeFor(
-        SmallOrderedNameDictionary::unchecked_cast(*this).Capacity());
+        SmallOrderedNameDictionary::unchecked_cast(*this)->Capacity());
   }
   if (instance_type == SWISS_NAME_DICTIONARY_TYPE) {
     return SwissNameDictionary::SizeFor(
-        SwissNameDictionary::unchecked_cast(*this).Capacity());
+        SwissNameDictionary::unchecked_cast(*this)->Capacity());
   }
   if (instance_type == PROPERTY_ARRAY_TYPE) {
     return PropertyArray::SizeFor(
-        PropertyArray::cast(*this).length(kAcquireLoad));
+        PropertyArray::cast(*this)->length(kAcquireLoad));
   }
   if (instance_type == FEEDBACK_VECTOR_TYPE) {
     return FeedbackVector::SizeFor(
-        FeedbackVector::unchecked_cast(*this).length());
+        FeedbackVector::unchecked_cast(*this)->length());
   }
   if (instance_type == BIGINT_TYPE) {
-    return BigInt::SizeFor(BigInt::unchecked_cast(*this).length());
+    return BigInt::SizeFor(BigInt::unchecked_cast(*this)->length());
   }
   if (instance_type == PREPARSE_DATA_TYPE) {
-    PreparseData data = PreparseData::unchecked_cast(*this);
-    return PreparseData::SizeFor(data.data_length(), data.children_length());
+    Tagged<PreparseData> data = PreparseData::unchecked_cast(*this);
+    return PreparseData::SizeFor(data->data_length(), data->children_length());
   }
-#define MAKE_TORQUE_SIZE_FOR(TYPE, TypeName)                \
-  if (instance_type == TYPE) {                              \
-    return TypeName::unchecked_cast(*this).AllocatedSize(); \
+#define MAKE_TORQUE_SIZE_FOR(TYPE, TypeName)                 \
+  if (instance_type == TYPE) {                               \
+    return TypeName::unchecked_cast(*this)->AllocatedSize(); \
   }
   TORQUE_INSTANCE_TYPE_TO_BODY_DESCRIPTOR_LIST(MAKE_TORQUE_SIZE_FOR)
 #undef MAKE_TORQUE_SIZE_FOR
 
   if (instance_type == INSTRUCTION_STREAM_TYPE) {
-    return InstructionStream::unchecked_cast(*this).CodeSize();
+    return InstructionStream::unchecked_cast(*this)->Size();
   }
   if (instance_type == COVERAGE_INFO_TYPE) {
     return CoverageInfo::SizeFor(
-        CoverageInfo::unchecked_cast(*this).slot_count());
+        CoverageInfo::unchecked_cast(*this)->slot_count());
   }
 #if V8_ENABLE_WEBASSEMBLY
   if (instance_type == WASM_TYPE_INFO_TYPE) {
     return WasmTypeInfo::SizeFor(
-        WasmTypeInfo::unchecked_cast(*this).supertypes_length());
+        WasmTypeInfo::unchecked_cast(*this)->supertypes_length());
   }
   if (instance_type == WASM_STRUCT_TYPE) {
     return WasmStruct::GcSafeSize(map);
   }
   if (instance_type == WASM_ARRAY_TYPE) {
-    return WasmArray::SizeFor(map, WasmArray::unchecked_cast(*this).length());
+    return WasmArray::SizeFor(map, WasmArray::unchecked_cast(*this)->length());
   }
   if (instance_type == WASM_NULL_TYPE) {
     return WasmNull::kSize;
@@ -2302,11 +2014,11 @@ int HeapObject::SizeFromMap(Map map) const {
 #endif  // V8_ENABLE_WEBASSEMBLY
   DCHECK_EQ(instance_type, EMBEDDER_DATA_ARRAY_TYPE);
   return EmbedderDataArray::SizeFor(
-      EmbedderDataArray::unchecked_cast(*this).length());
+      EmbedderDataArray::unchecked_cast(*this)->length());
 }
 
 bool HeapObject::NeedsRehashing(PtrComprCageBase cage_base) const {
-  return NeedsRehashing(map(cage_base).instance_type());
+  return NeedsRehashing(map(cage_base)->instance_type());
 }
 
 bool HeapObject::NeedsRehashing(InstanceType instance_type) const {
@@ -2314,16 +2026,16 @@ bool HeapObject::NeedsRehashing(InstanceType instance_type) const {
     // Use map() only when it's guaranteed that it's not a InstructionStream
     // object.
     DCHECK_IMPLIES(instance_type != INSTRUCTION_STREAM_TYPE,
-                   instance_type == map().instance_type());
+                   instance_type == map()->instance_type());
   } else {
-    DCHECK_EQ(instance_type, map().instance_type());
+    DCHECK_EQ(instance_type, map()->instance_type());
   }
   switch (instance_type) {
     case DESCRIPTOR_ARRAY_TYPE:
     case STRONG_DESCRIPTOR_ARRAY_TYPE:
-      return DescriptorArray::cast(*this).number_of_descriptors() > 1;
+      return DescriptorArray::cast(*this)->number_of_descriptors() > 1;
     case TRANSITION_ARRAY_TYPE:
-      return TransitionArray::cast(*this).number_of_entries() > 1;
+      return TransitionArray::cast(*this)->number_of_entries() > 1;
     case ORDERED_HASH_MAP_TYPE:
     case ORDERED_HASH_SET_TYPE:
       return false;  // We'll rehash from the JSMap or JSSet referencing them.
@@ -2348,7 +2060,7 @@ bool HeapObject::NeedsRehashing(InstanceType instance_type) const {
 
 bool HeapObject::CanBeRehashed(PtrComprCageBase cage_base) const {
   DCHECK(NeedsRehashing(cage_base));
-  switch (map(cage_base).instance_type()) {
+  switch (map(cage_base)->instance_type()) {
     case JS_MAP_TYPE:
     case JS_SET_TYPE:
       return true;
@@ -2371,11 +2083,11 @@ bool HeapObject::CanBeRehashed(PtrComprCageBase cage_base) const {
     case TRANSITION_ARRAY_TYPE:
       return true;
     case SMALL_ORDERED_HASH_MAP_TYPE:
-      return SmallOrderedHashMap::cast(*this).NumberOfElements() == 0;
+      return SmallOrderedHashMap::cast(*this)->NumberOfElements() == 0;
     case SMALL_ORDERED_HASH_SET_TYPE:
-      return SmallOrderedHashMap::cast(*this).NumberOfElements() == 0;
+      return SmallOrderedHashMap::cast(*this)->NumberOfElements() == 0;
     case SMALL_ORDERED_NAME_DICTIONARY_TYPE:
-      return SmallOrderedNameDictionary::cast(*this).NumberOfElements() == 0;
+      return SmallOrderedNameDictionary::cast(*this)->NumberOfElements() == 0;
     default:
       return false;
   }
@@ -2383,63 +2095,63 @@ bool HeapObject::CanBeRehashed(PtrComprCageBase cage_base) const {
 
 template <typename IsolateT>
 void HeapObject::RehashBasedOnMap(IsolateT* isolate) {
-  switch (map(isolate).instance_type()) {
+  switch (map(isolate)->instance_type()) {
     case HASH_TABLE_TYPE:
       UNREACHABLE();
     case NAME_DICTIONARY_TYPE:
-      NameDictionary::cast(*this).Rehash(isolate);
+      NameDictionary::cast(*this)->Rehash(isolate);
       break;
     case NAME_TO_INDEX_HASH_TABLE_TYPE:
-      NameToIndexHashTable::cast(*this).Rehash(isolate);
+      NameToIndexHashTable::cast(*this)->Rehash(isolate);
       break;
     case REGISTERED_SYMBOL_TABLE_TYPE:
-      RegisteredSymbolTable::cast(*this).Rehash(isolate);
+      RegisteredSymbolTable::cast(*this)->Rehash(isolate);
       break;
     case SWISS_NAME_DICTIONARY_TYPE:
-      SwissNameDictionary::cast(*this).Rehash(isolate);
+      SwissNameDictionary::cast(*this)->Rehash(isolate);
       break;
     case GLOBAL_DICTIONARY_TYPE:
-      GlobalDictionary::cast(*this).Rehash(isolate);
+      GlobalDictionary::cast(*this)->Rehash(isolate);
       break;
     case NUMBER_DICTIONARY_TYPE:
-      NumberDictionary::cast(*this).Rehash(isolate);
+      NumberDictionary::cast(*this)->Rehash(isolate);
       break;
     case SIMPLE_NUMBER_DICTIONARY_TYPE:
-      SimpleNumberDictionary::cast(*this).Rehash(isolate);
+      SimpleNumberDictionary::cast(*this)->Rehash(isolate);
       break;
     case DESCRIPTOR_ARRAY_TYPE:
     case STRONG_DESCRIPTOR_ARRAY_TYPE:
-      DCHECK_LE(1, DescriptorArray::cast(*this).number_of_descriptors());
-      DescriptorArray::cast(*this).Sort();
+      DCHECK_LE(1, DescriptorArray::cast(*this)->number_of_descriptors());
+      DescriptorArray::cast(*this)->Sort();
       break;
     case TRANSITION_ARRAY_TYPE:
-      TransitionArray::cast(*this).Sort();
+      TransitionArray::cast(*this)->Sort();
       break;
     case SMALL_ORDERED_HASH_MAP_TYPE:
-      DCHECK_EQ(0, SmallOrderedHashMap::cast(*this).NumberOfElements());
+      DCHECK_EQ(0, SmallOrderedHashMap::cast(*this)->NumberOfElements());
       break;
     case SMALL_ORDERED_HASH_SET_TYPE:
-      DCHECK_EQ(0, SmallOrderedHashSet::cast(*this).NumberOfElements());
+      DCHECK_EQ(0, SmallOrderedHashSet::cast(*this)->NumberOfElements());
       break;
     case ORDERED_HASH_MAP_TYPE:
     case ORDERED_HASH_SET_TYPE:
       UNREACHABLE();  // We'll rehash from the JSMap or JSSet referencing them.
     case JS_MAP_TYPE: {
-      JSMap::cast(*this).Rehash(isolate->AsIsolate());
+      JSMap::cast(*this)->Rehash(isolate->AsIsolate());
       break;
     }
     case JS_SET_TYPE: {
-      JSSet::cast(*this).Rehash(isolate->AsIsolate());
+      JSSet::cast(*this)->Rehash(isolate->AsIsolate());
       break;
     }
     case SMALL_ORDERED_NAME_DICTIONARY_TYPE:
-      DCHECK_EQ(0, SmallOrderedNameDictionary::cast(*this).NumberOfElements());
+      DCHECK_EQ(0, SmallOrderedNameDictionary::cast(*this)->NumberOfElements());
       break;
-    case ONE_BYTE_INTERNALIZED_STRING_TYPE:
-    case INTERNALIZED_STRING_TYPE:
+    case INTERNALIZED_ONE_BYTE_STRING_TYPE:
+    case INTERNALIZED_TWO_BYTE_STRING_TYPE:
       // Rare case, rehash read-only space strings before they are sealed.
       DCHECK(ReadOnlyHeap::Contains(*this));
-      String::cast(*this).EnsureHash();
+      String::cast(*this)->EnsureHash();
       break;
     default:
       UNREACHABLE();
@@ -2497,8 +2209,8 @@ Maybe<bool> Object::SetPropertyInternal(LookupIterator* it,
         Handle<Object> receiver = it->GetReceiver();
         // In case of global IC, the receiver is the global object. Replace by
         // the global proxy.
-        if (receiver->IsJSGlobalObject()) {
-          receiver = handle(JSGlobalObject::cast(*receiver).global_proxy(),
+        if (IsJSGlobalObject(*receiver)) {
+          receiver = handle(JSGlobalObject::cast(*receiver)->global_proxy(),
                             it->isolate());
         }
         return JSProxy::SetProperty(it->GetHolder<JSProxy>(), it->GetName(),
@@ -2549,9 +2261,9 @@ Maybe<bool> Object::SetPropertyInternal(LookupIterator* it,
           return WriteToReadOnlyProperty(it, value, should_throw);
         }
         Handle<Object> accessors = it->GetAccessors();
-        if (accessors->IsAccessorInfo() &&
+        if (IsAccessorInfo(*accessors) &&
             !it->HolderIsReceiverOrHiddenPrototype() &&
-            AccessorInfo::cast(*accessors).is_special_data_property()) {
+            AccessorInfo::cast(*accessors)->is_special_data_property()) {
           *found = false;
           return Nothing<bool>();
         }
@@ -2562,7 +2274,7 @@ Maybe<bool> Object::SetPropertyInternal(LookupIterator* it,
         // the bounds check. The bounds check has already happened here, but
         // perform the possibly effectful ToNumber (or ToBigInt) operation
         // anyways.
-        auto holder = it->GetHolder<JSTypedArray>();
+        Handle<JSTypedArray> holder = it->GetHolder<JSTypedArray>();
         Handle<Object> throwaway_value;
         if (holder->type() == kExternalBigInt64Array ||
             holder->type() == kExternalBigUint64Array) {
@@ -2608,7 +2320,7 @@ bool Object::CheckContextualStoreToJSGlobalObject(
     LookupIterator* it, Maybe<ShouldThrow> should_throw) {
   Isolate* isolate = it->isolate();
 
-  if (it->GetReceiver()->IsJSGlobalObject(isolate) &&
+  if (IsJSGlobalObject(*it->GetReceiver(), isolate) &&
       (GetShouldThrow(isolate, should_throw) == ShouldThrow::kThrowOnError)) {
     if (it->state() == LookupIterator::TRANSITION) {
       // The property cell that we have created is garbage because we are going
@@ -2657,18 +2369,15 @@ Maybe<bool> Object::SetSuperProperty(LookupIterator* it, Handle<Object> value,
   // The property either doesn't exist on the holder or exists there as a data
   // property.
 
-  if (!it->GetReceiver()->IsJSReceiver()) {
+  if (!IsJSReceiver(*it->GetReceiver())) {
     return WriteToReadOnlyProperty(it, value, should_throw);
   }
   Handle<JSReceiver> receiver = Handle<JSReceiver>::cast(it->GetReceiver());
 
   // Note, the callers rely on the fact that this code is redoing the full own
   // lookup from scratch.
-  LookupIterator::Configuration c = LookupIterator::OWN;
-  LookupIterator own_lookup =
-      it->IsElement() ? LookupIterator(isolate, receiver, it->index(), c)
-                      : LookupIterator(isolate, receiver, it->name(), c);
-
+  LookupIterator own_lookup(isolate, receiver, it->GetKey(),
+                            LookupIterator::OWN);
   for (; own_lookup.IsFound(); own_lookup.Next()) {
     switch (own_lookup.state()) {
       case LookupIterator::ACCESS_CHECK:
@@ -2679,7 +2388,7 @@ Maybe<bool> Object::SetSuperProperty(LookupIterator* it, Handle<Object> value,
         break;
 
       case LookupIterator::ACCESSOR:
-        if (own_lookup.GetAccessors()->IsAccessorInfo()) {
+        if (IsAccessorInfo(*own_lookup.GetAccessors())) {
           if (own_lookup.IsReadOnly()) {
             return WriteToReadOnlyProperty(&own_lookup, value, should_throw);
           }
@@ -2705,6 +2414,8 @@ Maybe<bool> Object::SetSuperProperty(LookupIterator* it, Handle<Object> value,
             JSReceiver::GetOwnPropertyDescriptor(&own_lookup, &desc);
         MAYBE_RETURN(owned, Nothing<bool>());
         if (!owned.FromJust()) {
+          // |own_lookup| might become outdated at this point anyway.
+          own_lookup.Restart();
           if (!CheckContextualStoreToJSGlobalObject(&own_lookup,
                                                     should_throw)) {
             return Nothing<bool>();
@@ -2784,7 +2495,7 @@ Maybe<bool> Object::RedefineIncompatibleProperty(
 
 Maybe<bool> Object::SetDataProperty(LookupIterator* it, Handle<Object> value) {
   Isolate* isolate = it->isolate();
-  DCHECK_IMPLIES(it->GetReceiver()->IsJSProxy(isolate),
+  DCHECK_IMPLIES(IsJSProxy(*it->GetReceiver(), isolate),
                  it->GetName()->IsPrivateName(isolate));
   DCHECK_IMPLIES(!it->IsElement() && it->GetName()->IsPrivateName(isolate),
                  it->state() == LookupIterator::DATA);
@@ -2795,11 +2506,11 @@ Maybe<bool> Object::SetDataProperty(LookupIterator* it, Handle<Object> value) {
 
   Handle<Object> to_assign = value;
   // Convert the incoming value to a number for storing into typed arrays.
-  if (it->IsElement() && receiver->IsJSObject(isolate) &&
-      JSObject::cast(*receiver).HasTypedArrayOrRabGsabTypedArrayElements(
+  if (it->IsElement() && IsJSObject(*receiver, isolate) &&
+      JSObject::cast(*receiver)->HasTypedArrayOrRabGsabTypedArrayElements(
           isolate)) {
-    auto receiver_ta = Handle<JSTypedArray>::cast(receiver);
-    ElementsKind elements_kind = JSObject::cast(*receiver).GetElementsKind();
+    Handle<JSTypedArray> receiver_ta = Handle<JSTypedArray>::cast(receiver);
+    ElementsKind elements_kind = JSObject::cast(*receiver)->GetElementsKind();
     if (IsBigIntTypedArrayElementsKind(elements_kind)) {
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, to_assign,
                                        BigInt::FromObject(isolate, value),
@@ -2808,7 +2519,7 @@ Maybe<bool> Object::SetDataProperty(LookupIterator* it, Handle<Object> value) {
                       it->index() >= receiver_ta->GetLength())) {
         return Just(true);
       }
-    } else if (!value->IsNumber() && !value->IsUndefined(isolate)) {
+    } else if (!IsNumber(*value) && !IsUndefined(*value, isolate)) {
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(isolate, to_assign,
                                        Object::ToNumber(isolate, value),
                                        Nothing<bool>());
@@ -2819,9 +2530,9 @@ Maybe<bool> Object::SetDataProperty(LookupIterator* it, Handle<Object> value) {
     }
   }
 
-  DCHECK(!receiver->IsWasmObject(isolate));
-  if (V8_UNLIKELY(receiver->IsJSSharedStruct(isolate) ||
-                  receiver->IsJSSharedArray(isolate))) {
+  DCHECK(!IsWasmObject(*receiver, isolate));
+  if (V8_UNLIKELY(IsJSSharedStruct(*receiver, isolate) ||
+                  IsJSSharedArray(*receiver, isolate))) {
     // Shared structs can only point to primitives or shared values.
     ASSIGN_RETURN_ON_EXCEPTION_VALUE(
         isolate, to_assign, Object::Share(isolate, to_assign, kThrowOnError),
@@ -2849,14 +2560,14 @@ Maybe<bool> Object::AddDataProperty(LookupIterator* it, Handle<Object> value,
                                     Maybe<ShouldThrow> should_throw,
                                     StoreOrigin store_origin,
                                     EnforceDefineSemantics semantics) {
-  if (!it->GetReceiver()->IsJSReceiver()) {
+  if (!IsJSReceiver(*it->GetReceiver())) {
     return CannotCreateProperty(it->isolate(), it->GetReceiver(), it->GetName(),
                                 value, should_throw);
   }
 
   // Private symbols should be installed on JSProxy using
   // JSProxy::SetPrivateSymbol.
-  if (it->GetReceiver()->IsJSProxy() && it->GetName()->IsPrivate() &&
+  if (IsJSProxy(*it->GetReceiver()) && it->GetName()->IsPrivate() &&
       !it->GetName()->IsPrivateName()) {
     RETURN_FAILURE(it->isolate(), GetShouldThrow(it->isolate(), should_throw),
                    NewTypeError(MessageTemplate::kProxyPrivate));
@@ -2865,26 +2576,32 @@ Maybe<bool> Object::AddDataProperty(LookupIterator* it, Handle<Object> value,
   DCHECK_NE(LookupIterator::INTEGER_INDEXED_EXOTIC, it->state());
 
   Handle<JSReceiver> receiver = it->GetStoreTarget<JSReceiver>();
-  DCHECK_IMPLIES(receiver->IsJSProxy(), it->GetName()->IsPrivateName());
-  DCHECK_IMPLIES(receiver->IsJSProxy(),
+  DCHECK_IMPLIES(IsJSProxy(*receiver), it->GetName()->IsPrivateName());
+  DCHECK_IMPLIES(IsJSProxy(*receiver),
                  it->state() == LookupIterator::NOT_FOUND);
 
   // If the receiver is a JSGlobalProxy, store on the prototype (JSGlobalObject)
   // instead. If the prototype is Null, the proxy is detached.
-  if (receiver->IsJSGlobalProxy()) return Just(true);
+  if (IsJSGlobalProxy(*receiver)) return Just(true);
 
   Isolate* isolate = it->isolate();
 
   if (it->ExtendingNonExtensible(receiver)) {
-    RETURN_FAILURE(isolate, GetShouldThrow(it->isolate(), should_throw),
-                   NewTypeError(semantics == EnforceDefineSemantics::kDefine
-                                    ? MessageTemplate::kDefineDisallowed
-                                    : MessageTemplate::kObjectNotExtensible,
-                                it->GetName()));
+    bool is_shared_object = IsAlwaysSharedSpaceJSObject(*receiver);
+    RETURN_FAILURE(
+        isolate, GetShouldThrow(it->isolate(), should_throw),
+        NewTypeError(
+            semantics == EnforceDefineSemantics::kDefine
+                ? (is_shared_object
+                       ? MessageTemplate::kDefineDisallowedFixedLayout
+                       : MessageTemplate::kDefineDisallowed)
+                : (is_shared_object ? MessageTemplate::kObjectFixedLayout
+                                    : MessageTemplate::kObjectNotExtensible),
+            it->GetName()));
   }
 
   if (it->IsElement(*receiver)) {
-    if (receiver->IsJSArray()) {
+    if (IsJSArray(*receiver)) {
       Handle<JSArray> array = Handle<JSArray>::cast(receiver);
       if (JSArray::WouldChangeReadOnlyLength(array, it->array_index())) {
         RETURN_FAILURE(isolate, GetShouldThrow(it->isolate(), should_throw),
@@ -2928,23 +2645,23 @@ Maybe<bool> Object::TransitionAndWriteDataProperty(
   }
 #endif
 
-    return Just(true);
+  return Just(true);
 }
 // static
 MaybeHandle<Object> Object::ShareSlow(Isolate* isolate,
                                       Handle<HeapObject> value,
                                       ShouldThrow throw_if_cannot_be_shared) {
   // Use Object::Share() if value might already be shared.
-  DCHECK(!value->IsShared());
+  DCHECK(!IsShared(*value));
 
   SharedObjectSafePublishGuard publish_guard;
 
-  if (value->IsString()) {
+  if (IsString(*value)) {
     return String::Share(isolate, Handle<String>::cast(value));
   }
 
-  if (value->IsHeapNumber()) {
-    uint64_t bits = HeapNumber::cast(*value).value_as_bits(kRelaxedLoad);
+  if (IsHeapNumber(*value)) {
+    uint64_t bits = HeapNumber::cast(*value)->value_as_bits(kRelaxedLoad);
     return isolate->factory()
         ->NewHeapNumberFromBits<AllocationType::kSharedOld>(bits);
   }
@@ -2969,7 +2686,7 @@ static int AppendUniqueCallbacks(Isolate* isolate,
   for (int i = nof_callbacks - 1; i >= 0; i--) {
     Handle<AccessorInfo> entry(AccessorInfo::cast(callbacks->get(i)), isolate);
     Handle<Name> key(Name::cast(entry->name()), isolate);
-    DCHECK(key->IsUniqueName());
+    DCHECK(IsUniqueName(*key));
     // Check if a descriptor with this name already exists before writing.
     if (!T::Contains(key, entry, valid_descriptors, array)) {
       T::Insert(key, entry, valid_descriptors, array);
@@ -2985,7 +2702,7 @@ struct FixedArrayAppender {
   static bool Contains(Handle<Name> key, Handle<AccessorInfo> entry,
                        int valid_descriptors, Handle<FixedArray> array) {
     for (int i = 0; i < valid_descriptors; i++) {
-      if (*key == AccessorInfo::cast(array->get(i)).name()) return true;
+      if (*key == AccessorInfo::cast(array->get(i))->name()) return true;
     }
     return false;
   }
@@ -3030,8 +2747,8 @@ Maybe<bool> JSProxy::IsArray(Handle<JSProxy> proxy) {
       return Nothing<bool>();
     }
     object = handle(JSReceiver::cast(proxy->target()), isolate);
-    if (object->IsJSArray()) return Just(true);
-    if (!object->IsJSProxy()) return Just(false);
+    if (IsJSArray(*object)) return Just(true);
+    if (!IsJSProxy(*object)) return Just(false);
   }
 
   // Too deep recursion, throw a RangeError.
@@ -3059,11 +2776,11 @@ Maybe<bool> JSProxy::HasProperty(Isolate* isolate, Handle<JSProxy> proxy,
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, trap,
-      Object::GetMethod(Handle<JSReceiver>::cast(handler),
+      Object::GetMethod(isolate, Handle<JSReceiver>::cast(handler),
                         isolate->factory()->has_string()),
       Nothing<bool>());
   // 7. If trap is undefined, then
-  if (trap->IsUndefined(isolate)) {
+  if (IsUndefined(*trap, isolate)) {
     // 7a. Return target.[[HasProperty]](P).
     return JSReceiver::HasProperty(isolate, target, name);
   }
@@ -3074,7 +2791,7 @@ Maybe<bool> JSProxy::HasProperty(Isolate* isolate, Handle<JSProxy> proxy,
       isolate, trap_result_obj,
       Execution::Call(isolate, trap, handler, arraysize(args), args),
       Nothing<bool>());
-  bool boolean_trap_result = trap_result_obj->BooleanValue(isolate);
+  bool boolean_trap_result = Object::BooleanValue(*trap_result_obj, isolate);
   // 9. If booleanTrapResult is false, then:
   if (!boolean_trap_result) {
     MAYBE_RETURN(JSProxy::CheckHasTrap(isolate, name, target), Nothing<bool>());
@@ -3131,8 +2848,9 @@ Maybe<bool> JSProxy::SetProperty(Handle<JSProxy> proxy, Handle<Name> name,
 
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
-      isolate, trap, Object::GetMethod(handler, trap_name), Nothing<bool>());
-  if (trap->IsUndefined(isolate)) {
+      isolate, trap, Object::GetMethod(isolate, handler, trap_name),
+      Nothing<bool>());
+  if (IsUndefined(*trap, isolate)) {
     PropertyKey key(isolate, name);
     LookupIterator it(isolate, receiver, key, target);
 
@@ -3146,7 +2864,7 @@ Maybe<bool> JSProxy::SetProperty(Handle<JSProxy> proxy, Handle<Name> name,
       isolate, trap_result,
       Execution::Call(isolate, trap, handler, arraysize(args), args),
       Nothing<bool>());
-  if (!trap_result->BooleanValue(isolate)) {
+  if (!Object::BooleanValue(*trap_result, isolate)) {
     RETURN_FAILURE(isolate, GetShouldThrow(isolate, should_throw),
                    NewTypeError(MessageTemplate::kProxyTrapReturnedFalsishFor,
                                 trap_name, name));
@@ -3182,8 +2900,9 @@ Maybe<bool> JSProxy::DeletePropertyOrElement(Handle<JSProxy> proxy,
 
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
-      isolate, trap, Object::GetMethod(handler, trap_name), Nothing<bool>());
-  if (trap->IsUndefined(isolate)) {
+      isolate, trap, Object::GetMethod(isolate, handler, trap_name),
+      Nothing<bool>());
+  if (IsUndefined(*trap, isolate)) {
     return JSReceiver::DeletePropertyOrElement(target, name, language_mode);
   }
 
@@ -3193,7 +2912,7 @@ Maybe<bool> JSProxy::DeletePropertyOrElement(Handle<JSProxy> proxy,
       isolate, trap_result,
       Execution::Call(isolate, trap, handler, arraysize(args), args),
       Nothing<bool>());
-  if (!trap_result->BooleanValue(isolate)) {
+  if (!Object::BooleanValue(*trap_result, isolate)) {
     RETURN_FAILURE(isolate, should_throw,
                    NewTypeError(MessageTemplate::kProxyTrapReturnedFalsishFor,
                                 trap_name, name));
@@ -3234,11 +2953,11 @@ Maybe<bool> JSProxy::CheckDeleteTrap(Isolate* isolate, Handle<Name> name,
 // static
 MaybeHandle<JSProxy> JSProxy::New(Isolate* isolate, Handle<Object> target,
                                   Handle<Object> handler) {
-  if (!target->IsJSReceiver()) {
+  if (!IsJSReceiver(*target)) {
     THROW_NEW_ERROR(isolate, NewTypeError(MessageTemplate::kProxyNonObject),
                     JSProxy);
   }
-  if (!handler->IsJSReceiver()) {
+  if (!IsJSReceiver(*handler)) {
     THROW_NEW_ERROR(isolate, NewTypeError(MessageTemplate::kProxyNonObject),
                     JSProxy);
   }
@@ -3258,9 +2977,9 @@ Maybe<PropertyAttributes> JSProxy::GetPropertyAttributes(LookupIterator* it) {
 // TODO(jkummerow): Consider unification with FastAsArrayLength() in
 // accessors.cc.
 bool PropertyKeyToArrayLength(Handle<Object> value, uint32_t* length) {
-  DCHECK(value->IsNumber() || value->IsName());
-  if (value->ToArrayLength(length)) return true;
-  if (value->IsString()) return String::cast(*value).AsArrayIndex(length);
+  DCHECK(IsNumber(*value) || IsName(*value));
+  if (Object::ToArrayLength(*value, length)) return true;
+  if (IsString(*value)) return String::cast(*value)->AsArrayIndex(length);
   return false;
 }
 
@@ -3293,7 +3012,7 @@ Maybe<bool> JSArray::DefineOwnProperty(Isolate* isolate, Handle<JSArray> o,
     USE(success);
     // 3c. Let oldLen be oldLenDesc.[[Value]].
     uint32_t old_len = 0;
-    CHECK(old_len_desc.value()->ToArrayLength(&old_len));
+    CHECK(Object::ToArrayLength(*old_len_desc.value(), &old_len));
     // 3d. Let index be ToUint32(P).
     // (Already done above.)
     // 3e. (Assert)
@@ -3339,8 +3058,8 @@ bool JSArray::AnythingToArrayLength(Isolate* isolate,
                                     uint32_t* output) {
   // Fast path: check numbers and strings that can be converted directly
   // and unobservably.
-  if (length_object->ToArrayLength(output)) return true;
-  if (length_object->IsString() &&
+  if (Object::ToArrayLength(*length_object, output)) return true;
+  if (IsString(*length_object) &&
       Handle<String>::cast(length_object)->AsArrayIndex(output)) {
     return true;
   }
@@ -3358,13 +3077,13 @@ bool JSArray::AnythingToArrayLength(Isolate* isolate,
     return false;
   }
   // 7. If newLen != numberLen, throw a RangeError exception.
-  if (uint32_v->Number() != number_v->Number()) {
+  if (Object::Number(*uint32_v) != Object::Number(*number_v)) {
     Handle<Object> exception =
         isolate->factory()->NewRangeError(MessageTemplate::kInvalidArrayLength);
     isolate->Throw(*exception);
     return false;
   }
-  CHECK(uint32_v->ToArrayLength(output));
+  CHECK(Object::ToArrayLength(*uint32_v, output));
   return true;
 }
 
@@ -3399,7 +3118,7 @@ Maybe<bool> JSArray::ArraySetLength(Isolate* isolate, Handle<JSArray> a,
   USE(success);
   // 11. Let oldLen be oldLenDesc.[[Value]].
   uint32_t old_len = 0;
-  CHECK(old_len_desc.value()->ToArrayLength(&old_len));
+  CHECK(Object::ToArrayLength(*old_len_desc.value(), &old_len));
   // 12. If newLen >= oldLen, then
   if (new_len >= old_len) {
     // 8. Set newLenDesc.[[Value]] to newLen.
@@ -3448,7 +3167,7 @@ Maybe<bool> JSArray::ArraySetLength(Isolate* isolate, Handle<JSArray> a,
     USE(success);
   }
   uint32_t actual_new_len = 0;
-  CHECK(a->length().ToArrayLength(&actual_new_len));
+  CHECK(Object::ToArrayLength(a->length(), &actual_new_len));
   // Steps 19d-v, 21. Return false if there were non-deletable elements.
   bool result = actual_new_len == new_len;
   if (!result) {
@@ -3468,14 +3187,14 @@ Maybe<bool> JSProxy::DefineOwnProperty(Isolate* isolate, Handle<JSProxy> proxy,
                                        PropertyDescriptor* desc,
                                        Maybe<ShouldThrow> should_throw) {
   STACK_CHECK(isolate, Nothing<bool>());
-  if (key->IsSymbol() && Handle<Symbol>::cast(key)->IsPrivate()) {
+  if (IsSymbol(*key) && Handle<Symbol>::cast(key)->IsPrivate()) {
     DCHECK(!Handle<Symbol>::cast(key)->IsPrivateName());
     return JSProxy::SetPrivateSymbol(isolate, proxy, Handle<Symbol>::cast(key),
                                      desc, should_throw);
   }
   Handle<String> trap_name = isolate->factory()->defineProperty_string();
   // 1. Assert: IsPropertyKey(P) is true.
-  DCHECK(key->IsName() || key->IsNumber());
+  DCHECK(IsName(*key) || IsNumber(*key));
   // 2. Let handler be the value of the [[ProxyHandler]] internal slot of O.
   Handle<Object> handler(proxy->handler(), isolate);
   // 3. If handler is null, throw a TypeError exception.
@@ -3491,10 +3210,10 @@ Maybe<bool> JSProxy::DefineOwnProperty(Isolate* isolate, Handle<JSProxy> proxy,
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, trap,
-      Object::GetMethod(Handle<JSReceiver>::cast(handler), trap_name),
+      Object::GetMethod(isolate, Handle<JSReceiver>::cast(handler), trap_name),
       Nothing<bool>());
   // 7. If trap is undefined, then:
-  if (trap->IsUndefined(isolate)) {
+  if (IsUndefined(*trap, isolate)) {
     // 7a. Return target.[[DefineOwnProperty]](P, Desc).
     return JSReceiver::DefineOwnProperty(isolate, target, key, desc,
                                          should_throw);
@@ -3504,7 +3223,7 @@ Maybe<bool> JSProxy::DefineOwnProperty(Isolate* isolate, Handle<JSProxy> proxy,
   // 9. Let booleanTrapResult be
   //    ToBoolean(? Call(trap, handler, «target, P, descObj»)).
   Handle<Name> property_name =
-      key->IsName()
+      IsName(*key)
           ? Handle<Name>::cast(key)
           : Handle<Name>::cast(isolate->factory()->NumberToString(key));
   // Do not leak private property names.
@@ -3516,7 +3235,7 @@ Maybe<bool> JSProxy::DefineOwnProperty(Isolate* isolate, Handle<JSProxy> proxy,
       Execution::Call(isolate, trap, handler, arraysize(args), args),
       Nothing<bool>());
   // 10. If booleanTrapResult is false, return false.
-  if (!trap_result_obj->BooleanValue(isolate)) {
+  if (!Object::BooleanValue(*trap_result_obj, isolate)) {
     RETURN_FAILURE(isolate, GetShouldThrow(isolate, should_throw),
                    NewTypeError(MessageTemplate::kProxyTrapReturnedFalsishFor,
                                 trap_name, property_name));
@@ -3599,7 +3318,7 @@ Maybe<bool> JSProxy::SetPrivateSymbol(Isolate* isolate, Handle<JSProxy> proxy,
     RETURN_FAILURE(isolate, GetShouldThrow(isolate, should_throw),
                    NewTypeError(MessageTemplate::kProxyPrivate));
   }
-  DCHECK(proxy->map().is_dictionary_map());
+  DCHECK(proxy->map()->is_dictionary_map());
   Handle<Object> value =
       desc->has_value()
           ? desc->value()
@@ -3661,10 +3380,10 @@ Maybe<bool> JSProxy::GetOwnPropertyDescriptor(Isolate* isolate,
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, trap,
-      Object::GetMethod(Handle<JSReceiver>::cast(handler), trap_name),
+      Object::GetMethod(isolate, Handle<JSReceiver>::cast(handler), trap_name),
       Nothing<bool>());
   // 7. If trap is undefined, then
-  if (trap->IsUndefined(isolate)) {
+  if (IsUndefined(*trap, isolate)) {
     // 7a. Return target.[[GetOwnProperty]](P).
     return JSReceiver::GetOwnPropertyDescriptor(isolate, target, name, desc);
   }
@@ -3677,8 +3396,8 @@ Maybe<bool> JSProxy::GetOwnPropertyDescriptor(Isolate* isolate,
       Nothing<bool>());
   // 9. If Type(trapResultObj) is neither Object nor Undefined, throw a
   //    TypeError exception.
-  if (!trap_result_obj->IsJSReceiver() &&
-      !trap_result_obj->IsUndefined(isolate)) {
+  if (!IsJSReceiver(*trap_result_obj) &&
+      !IsUndefined(*trap_result_obj, isolate)) {
     isolate->Throw(*isolate->factory()->NewTypeError(
         MessageTemplate::kProxyGetOwnPropertyDescriptorInvalid, name));
     return Nothing<bool>();
@@ -3689,7 +3408,7 @@ Maybe<bool> JSProxy::GetOwnPropertyDescriptor(Isolate* isolate,
       JSReceiver::GetOwnPropertyDescriptor(isolate, target, name, &target_desc);
   MAYBE_RETURN(found, Nothing<bool>());
   // 11. If trapResultObj is undefined, then
-  if (trap_result_obj->IsUndefined(isolate)) {
+  if (IsUndefined(*trap_result_obj, isolate)) {
     // 11a. If targetDesc is undefined, return undefined.
     if (!found.FromJust()) return Just(false);
     // 11b. If targetDesc.[[Configurable]] is false, throw a TypeError
@@ -3779,8 +3498,9 @@ Maybe<bool> JSProxy::PreventExtensions(Handle<JSProxy> proxy,
 
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
-      isolate, trap, Object::GetMethod(handler, trap_name), Nothing<bool>());
-  if (trap->IsUndefined(isolate)) {
+      isolate, trap, Object::GetMethod(isolate, handler, trap_name),
+      Nothing<bool>());
+  if (IsUndefined(*trap, isolate)) {
     return JSReceiver::PreventExtensions(isolate, target, should_throw);
   }
 
@@ -3790,7 +3510,7 @@ Maybe<bool> JSProxy::PreventExtensions(Handle<JSProxy> proxy,
       isolate, trap_result,
       Execution::Call(isolate, trap, handler, arraysize(args), args),
       Nothing<bool>());
-  if (!trap_result->BooleanValue(isolate)) {
+  if (!Object::BooleanValue(*trap_result, isolate)) {
     RETURN_FAILURE(
         isolate, should_throw,
         NewTypeError(MessageTemplate::kProxyTrapReturnedFalsish, trap_name));
@@ -3823,8 +3543,9 @@ Maybe<bool> JSProxy::IsExtensible(Handle<JSProxy> proxy) {
 
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
-      isolate, trap, Object::GetMethod(handler, trap_name), Nothing<bool>());
-  if (trap->IsUndefined(isolate)) {
+      isolate, trap, Object::GetMethod(isolate, handler, trap_name),
+      Nothing<bool>());
+  if (IsUndefined(*trap, isolate)) {
     return JSReceiver::IsExtensible(isolate, target);
   }
 
@@ -3838,7 +3559,7 @@ Maybe<bool> JSProxy::IsExtensible(Handle<JSProxy> proxy) {
   // Enforce the invariant.
   Maybe<bool> target_result = JSReceiver::IsExtensible(isolate, target);
   MAYBE_RETURN(target_result, Nothing<bool>());
-  if (target_result.FromJust() != trap_result->BooleanValue(isolate)) {
+  if (target_result.FromJust() != Object::BooleanValue(*trap_result, isolate)) {
     isolate->Throw(
         *factory->NewTypeError(MessageTemplate::kProxyIsExtensibleInconsistent,
                                factory->ToBoolean(target_result.FromJust())));
@@ -3867,100 +3588,48 @@ Handle<DescriptorArray> DescriptorArray::CopyUpToAddAttributes(
       DescriptorArray::Allocate(isolate, size, slack);
 
   DisallowGarbageCollection no_gc;
-  auto source = *source_handle;
-  auto copy = *copy_handle;
+  Tagged<DescriptorArray> source = *source_handle;
+  Tagged<DescriptorArray> copy = *copy_handle;
 
   if (attributes != NONE) {
     for (InternalIndex i : InternalIndex::Range(size)) {
-      MaybeObject value_or_field_type = source.GetValue(i);
-      Name key = source.GetKey(i);
-      PropertyDetails details = source.GetDetails(i);
+      MaybeObject value_or_field_type = source->GetValue(i);
+      Tagged<Name> key = source->GetKey(i);
+      PropertyDetails details = source->GetDetails(i);
       // Bulk attribute changes never affect private properties.
-      if (!key.IsPrivate()) {
+      if (!key->IsPrivate()) {
         int mask = DONT_DELETE | DONT_ENUM;
         // READ_ONLY is an invalid attribute for JS setters/getters.
-        HeapObject heap_object;
+        Tagged<HeapObject> heap_object;
         if (details.kind() != PropertyKind::kAccessor ||
-            !(value_or_field_type->GetHeapObjectIfStrong(&heap_object) &&
-              heap_object.IsAccessorPair())) {
+            !(value_or_field_type.GetHeapObjectIfStrong(&heap_object) &&
+              IsAccessorPair(heap_object))) {
           mask |= READ_ONLY;
         }
         details = details.CopyAddAttributes(
             static_cast<PropertyAttributes>(attributes & mask));
       }
-      copy.Set(i, key, value_or_field_type, details);
+      copy->Set(i, key, value_or_field_type, details);
     }
   } else {
     for (InternalIndex i : InternalIndex::Range(size)) {
-      copy.CopyFrom(i, source);
+      copy->CopyFrom(i, source);
     }
   }
 
-  if (source.number_of_descriptors() != enumeration_index) copy.Sort();
+  if (source->number_of_descriptors() != enumeration_index) copy->Sort();
 
   return copy_handle;
 }
 
-// Create a new descriptor array with only enumerable, configurable, writeable
-// data properties, but identical field locations.
-Handle<DescriptorArray> DescriptorArray::CopyForFastObjectClone(
-    Isolate* isolate, Handle<DescriptorArray> src_handle, int enumeration_index,
-    int slack) {
-  if (enumeration_index + slack == 0) {
-    return isolate->factory()->empty_descriptor_array();
-  }
-
-  int size = enumeration_index;
-  Handle<DescriptorArray> descriptors_handle =
-      DescriptorArray::Allocate(isolate, size, slack);
-
-  DisallowGarbageCollection no_gc;
-  auto src = *src_handle;
-  auto descriptors = *descriptors_handle;
-
-  for (InternalIndex i : InternalIndex::Range(size)) {
-    Name key = src.GetKey(i);
-    PropertyDetails details = src.GetDetails(i);
-    Representation new_representation = details.representation();
-
-    DCHECK(!key.IsPrivateName());
-    DCHECK(details.IsEnumerable());
-    DCHECK_EQ(details.kind(), PropertyKind::kData);
-    // If the new representation is an in-place changeable field, make it
-    // generic as possible (under in-place changes) to avoid type confusion if
-    // the source representation changes after this feedback has been collected.
-    MaybeObject type = src.GetValue(i);
-    if (details.location() == PropertyLocation::kField) {
-      type = MaybeObject::FromObject(FieldType::Any());
-      // TODO(bmeurer,ishell): Igor suggested to use some kind of dynamic
-      // checks in the fast-path for CloneObjectIC instead to avoid the
-      // need to generalize the descriptors here. That will also enable
-      // us to skip the defensive copying of the target map whenever a
-      // CloneObjectIC misses.
-      new_representation = new_representation.MostGenericInPlaceChange();
-    }
-
-    // Ensure the ObjectClone property details are NONE, and that all source
-    // details did not contain DONT_ENUM.
-    PropertyDetails new_details(PropertyKind::kData, NONE, details.location(),
-                                details.constness(), new_representation,
-                                details.field_index());
-
-    descriptors.Set(i, key, type, new_details);
-  }
-
-  descriptors.Sort();
-
-  return descriptors_handle;
-}
-
-bool DescriptorArray::IsEqualUpTo(DescriptorArray desc, int nof_descriptors) {
+bool DescriptorArray::IsEqualUpTo(Tagged<DescriptorArray> desc,
+                                  int nof_descriptors) {
   for (InternalIndex i : InternalIndex::Range(nof_descriptors)) {
-    if (GetKey(i) != desc.GetKey(i) || GetValue(i) != desc.GetValue(i)) {
+    if (GetKey(i) != desc->GetKey(i) || GetValue(i) != desc->GetValue(i)) {
       return false;
     }
     PropertyDetails details = GetDetails(i);
-    PropertyDetails other_details = desc.GetDetails(i);
+    PropertyDetails other_details = desc->GetDetails(i);
     if (details.kind() != other_details.kind() ||
         details.location() != other_details.location() ||
         !details.representation().Equals(other_details.representation())) {
@@ -3970,338 +3639,6 @@ bool DescriptorArray::IsEqualUpTo(DescriptorArray desc, int nof_descriptors) {
   return true;
 }
 
-Handle<FixedArray> FixedArray::SetAndGrow(Isolate* isolate,
-                                          Handle<FixedArray> array, int index,
-                                          Handle<Object> value) {
-  int src_length = array->length();
-  if (index < src_length) {
-    array->set(index, *value);
-    return array;
-  }
-  int capacity = src_length;
-  do {
-    capacity = JSObject::NewElementsCapacity(capacity);
-  } while (capacity <= index);
-  Handle<FixedArray> new_array = isolate->factory()->NewFixedArray(capacity);
-
-  DisallowGarbageCollection no_gc;
-  auto raw_src = *array;
-  auto raw_dst = *new_array;
-  raw_src.CopyTo(0, raw_dst, 0, src_length);
-  DCHECK_EQ(raw_dst.length(), capacity);
-  raw_dst.FillWithHoles(src_length, capacity);
-  raw_dst.set(index, *value);
-
-  return new_array;
-}
-
-Handle<FixedArray> FixedArray::ShrinkOrEmpty(Isolate* isolate,
-                                             Handle<FixedArray> array,
-                                             int new_length) {
-  if (new_length == 0) {
-    return array->GetReadOnlyRoots().empty_fixed_array_handle();
-  } else {
-    array->Shrink(isolate, new_length);
-    return array;
-  }
-}
-
-void FixedArray::Shrink(Isolate* isolate, int new_length) {
-  DCHECK(0 < new_length && new_length <= length());
-  if (new_length < length()) {
-    isolate->heap()->RightTrimFixedArray(*this, length() - new_length);
-  }
-}
-
-void FixedArray::CopyTo(int pos, FixedArray dest, int dest_pos, int len) const {
-  DisallowGarbageCollection no_gc;
-  // Return early if len == 0 so that we don't try to read the write barrier off
-  // a canonical read-only empty fixed array.
-  if (len == 0) return;
-  WriteBarrierMode mode = dest.GetWriteBarrierMode(no_gc);
-  for (int index = 0; index < len; index++) {
-    dest.set(dest_pos + index, get(pos + index), mode);
-  }
-}
-
-// static
-Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
-                                 Handle<Object> obj,
-                                 AllocationType allocation) {
-  int length = array->Length();
-  array = EnsureSpace(isolate, array, length + 1, allocation);
-  // Check that GC didn't remove elements from the array.
-  DCHECK_EQ(array->Length(), length);
-  {
-    DisallowGarbageCollection no_gc;
-    ArrayList raw_array = *array;
-    raw_array.Set(length, *obj);
-    raw_array.SetLength(length + 1);
-  }
-  return array;
-}
-
-Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
-                                 Smi obj1) {
-  int length = array->Length();
-  array = EnsureSpace(isolate, array, length + 1);
-  // Check that GC didn't remove elements from the array.
-  DCHECK_EQ(array->Length(), length);
-  {
-    DisallowGarbageCollection no_gc;
-    ArrayList raw_array = *array;
-    raw_array.Set(length, obj1);
-    raw_array.SetLength(length + 1);
-  }
-  return array;
-}
-
-// static
-Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
-                                 Handle<Object> obj1, Handle<Object> obj2) {
-  int length = array->Length();
-  array = EnsureSpace(isolate, array, length + 2);
-  // Check that GC didn't remove elements from the array.
-  DCHECK_EQ(array->Length(), length);
-  {
-    DisallowGarbageCollection no_gc;
-    ArrayList raw_array = *array;
-    raw_array.Set(length, *obj1);
-    raw_array.Set(length + 1, *obj2);
-    raw_array.SetLength(length + 2);
-  }
-  return array;
-}
-
-Handle<ArrayList> ArrayList::Add(Isolate* isolate, Handle<ArrayList> array,
-                                 Handle<Object> obj1, Smi obj2, Smi obj3,
-                                 Smi obj4) {
-  int length = array->Length();
-  array = EnsureSpace(isolate, array, length + 4);
-  // Check that GC didn't remove elements from the array.
-  DCHECK_EQ(array->Length(), length);
-  {
-    DisallowGarbageCollection no_gc;
-    ArrayList raw_array = *array;
-    raw_array.Set(length, *obj1);
-    raw_array.Set(length + 1, obj2);
-    raw_array.Set(length + 2, obj3);
-    raw_array.Set(length + 3, obj4);
-    raw_array.SetLength(length + 4);
-  }
-  return array;
-}
-
-// static
-Handle<ArrayList> ArrayList::New(Isolate* isolate, int size) {
-  return isolate->factory()->NewArrayList(size);
-}
-
-Handle<FixedArray> ArrayList::Elements(Isolate* isolate,
-                                       Handle<ArrayList> array) {
-  int length = array->Length();
-  Handle<FixedArray> result = isolate->factory()->NewFixedArray(length);
-  // Do not copy the first entry, i.e., the length.
-  array->CopyTo(kFirstIndex, *result, 0, length);
-  return result;
-}
-
-namespace {
-
-Handle<FixedArray> EnsureSpaceInFixedArray(Isolate* isolate,
-                                           Handle<FixedArray> array, int length,
-                                           AllocationType allocation) {
-  int capacity = array->length();
-  if (capacity < length) {
-    int new_capacity = length;
-    new_capacity = new_capacity + std::max(new_capacity / 2, 2);
-    int grow_by = new_capacity - capacity;
-    array =
-        isolate->factory()->CopyFixedArrayAndGrow(array, grow_by, allocation);
-  }
-  return array;
-}
-
-}  // namespace
-
-// static
-Handle<ArrayList> ArrayList::EnsureSpace(Isolate* isolate,
-                                         Handle<ArrayList> array, int length,
-                                         AllocationType allocation) {
-  DCHECK_LT(0, length);
-  auto new_array = Handle<ArrayList>::cast(EnsureSpaceInFixedArray(
-      isolate, array, kFirstIndex + length, allocation));
-  DCHECK_EQ(array->Length(), new_array->Length());
-  return new_array;
-}
-
-// static
-Handle<WeakArrayList> WeakArrayList::AddToEnd(Isolate* isolate,
-                                              Handle<WeakArrayList> array,
-                                              const MaybeObjectHandle& value) {
-  int length = array->length();
-  array = EnsureSpace(isolate, array, length + 1);
-  {
-    DisallowGarbageCollection no_gc;
-    WeakArrayList raw = *array;
-    // Reload length; GC might have removed elements from the array.
-    length = raw.length();
-    raw.Set(length, *value);
-    raw.set_length(length + 1);
-  }
-  return array;
-}
-
-Handle<WeakArrayList> WeakArrayList::AddToEnd(Isolate* isolate,
-                                              Handle<WeakArrayList> array,
-                                              const MaybeObjectHandle& value1,
-                                              const MaybeObjectHandle& value2) {
-  int length = array->length();
-  array = EnsureSpace(isolate, array, length + 2);
-  {
-    DisallowGarbageCollection no_gc;
-    WeakArrayList raw = *array;
-    // Reload length; GC might have removed elements from the array.
-    length = array->length();
-    raw.Set(length, *value1);
-    raw.Set(length + 1, *value2);
-    raw.set_length(length + 2);
-  }
-  return array;
-}
-
-// static
-Handle<WeakArrayList> WeakArrayList::Append(Isolate* isolate,
-                                            Handle<WeakArrayList> array,
-                                            const MaybeObjectHandle& value,
-                                            AllocationType allocation) {
-  int length = 0;
-  int new_length = 0;
-  {
-    DisallowGarbageCollection no_gc;
-    WeakArrayList raw = *array;
-    length = raw.length();
-
-    if (length < raw.capacity()) {
-      raw.Set(length, *value);
-      raw.set_length(length + 1);
-      return array;
-    }
-
-    // Not enough space in the array left, either grow, shrink or
-    // compact the array.
-    new_length = raw.CountLiveElements() + 1;
-  }
-
-  bool shrink = new_length < length / 4;
-  bool grow = 3 * (length / 4) < new_length;
-
-  if (shrink || grow) {
-    // Grow or shrink array and compact out-of-place.
-    int new_capacity = CapacityForLength(new_length);
-    array = isolate->factory()->CompactWeakArrayList(array, new_capacity,
-                                                     allocation);
-
-  } else {
-    // Perform compaction in the current array.
-    array->Compact(isolate);
-  }
-
-  // Now append value to the array, there should always be enough space now.
-  DCHECK_LT(array->length(), array->capacity());
-
-  {
-    DisallowGarbageCollection no_gc;
-    WeakArrayList raw = *array;
-    // Reload length, allocation might have killed some weak refs.
-    int index = raw.length();
-    raw.Set(index, *value);
-    raw.set_length(index + 1);
-  }
-  return array;
-}
-
-void WeakArrayList::Compact(Isolate* isolate) {
-  DisallowGarbageCollection no_gc;
-  int length = this->length();
-  int new_length = 0;
-
-  for (int i = 0; i < length; i++) {
-    MaybeObject value = Get(isolate, i);
-
-    if (!value->IsCleared()) {
-      if (new_length != i) {
-        Set(new_length, value);
-      }
-      ++new_length;
-    }
-  }
-
-  set_length(new_length);
-}
-
-bool WeakArrayList::IsFull() const { return length() == capacity(); }
-
-// static
-Handle<WeakArrayList> WeakArrayList::EnsureSpace(Isolate* isolate,
-                                                 Handle<WeakArrayList> array,
-                                                 int length,
-                                                 AllocationType allocation) {
-  int capacity = array->capacity();
-  if (capacity < length) {
-    int grow_by = CapacityForLength(length) - capacity;
-    array = isolate->factory()->CopyWeakArrayListAndGrow(array, grow_by,
-                                                         allocation);
-  }
-  return array;
-}
-
-int WeakArrayList::CountLiveWeakReferences() const {
-  int live_weak_references = 0;
-  for (int i = 0; i < length(); i++) {
-    if (Get(i)->IsWeak()) {
-      ++live_weak_references;
-    }
-  }
-  return live_weak_references;
-}
-
-int WeakArrayList::CountLiveElements() const {
-  int non_cleared_objects = 0;
-  for (int i = 0; i < length(); i++) {
-    if (!Get(i)->IsCleared()) {
-      ++non_cleared_objects;
-    }
-  }
-  return non_cleared_objects;
-}
-
-bool WeakArrayList::RemoveOne(const MaybeObjectHandle& value) {
-  if (length() == 0) return false;
-  // Optimize for the most recently added element to be removed again.
-  MaybeObject cleared_weak_ref =
-      HeapObjectReference::ClearedValue(GetIsolate());
-  int last_index = length() - 1;
-  for (int i = last_index; i >= 0; --i) {
-    if (Get(i) == *value) {
-      // Move the last element into the this slot (or no-op, if this is the
-      // last slot).
-      Set(i, Get(last_index));
-      Set(last_index, cleared_weak_ref);
-      set_length(last_index);
-      return true;
-    }
-  }
-  return false;
-}
-
-bool WeakArrayList::Contains(MaybeObject value) {
-  for (int i = 0; i < length(); ++i) {
-    if (Get(i) == value) return true;
-  }
-  return false;
-}
-
 // static
 Handle<WeakArrayList> PrototypeUsers::Add(Isolate* isolate,
                                           Handle<WeakArrayList> array,
@@ -4358,17 +3695,18 @@ Handle<WeakArrayList> PrototypeUsers::Add(Isolate* isolate,
 }
 
 // static
-void PrototypeUsers::ScanForEmptySlots(WeakArrayList array) {
-  for (int i = kFirstIndex; i < array.length(); i++) {
-    if (array.Get(i)->IsCleared()) {
+void PrototypeUsers::ScanForEmptySlots(Tagged<WeakArrayList> array) {
+  for (int i = kFirstIndex; i < array->length(); i++) {
+    if (array->Get(i)->IsCleared()) {
       PrototypeUsers::MarkSlotEmpty(array, i);
     }
   }
 }
 
-WeakArrayList PrototypeUsers::Compact(Handle<WeakArrayList> array, Heap* heap,
-                                      CompactionCallback callback,
-                                      AllocationType allocation) {
+Tagged<WeakArrayList> PrototypeUsers::Compact(Handle<WeakArrayList> array,
+                                              Heap* heap,
+                                              CompactionCallback callback,
+                                              AllocationType allocation) {
   if (array->length() == 0) {
     return *array;
   }
@@ -4386,8 +3724,8 @@ WeakArrayList PrototypeUsers::Compact(Handle<WeakArrayList> array, Heap* heap,
   int copy_to = kFirstIndex;
   for (int i = kFirstIndex; i < array->length(); i++) {
     MaybeObject element = array->Get(i);
-    HeapObject value;
-    if (element->GetHeapObjectIfWeak(&value)) {
+    Tagged<HeapObject> value;
+    if (element.GetHeapObjectIfWeak(&value)) {
       callback(value, i, copy_to);
       new_array->Set(copy_to++, element);
     } else {
@@ -4399,26 +3737,6 @@ WeakArrayList PrototypeUsers::Compact(Handle<WeakArrayList> array, Heap* heap,
   return *new_array;
 }
 
-Handle<RegExpMatchInfo> RegExpMatchInfo::New(Isolate* isolate,
-                                             int capture_count) {
-  Handle<RegExpMatchInfo> match_info = isolate->factory()->NewRegExpMatchInfo();
-  return ReserveCaptures(isolate, match_info, capture_count);
-}
-
-Handle<RegExpMatchInfo> RegExpMatchInfo::ReserveCaptures(
-    Isolate* isolate, Handle<RegExpMatchInfo> match_info, int capture_count) {
-  DCHECK_GE(match_info->length(), kLastMatchOverhead);
-
-  int capture_register_count =
-      JSRegExp::RegistersForCaptureCount(capture_count);
-  const int required_length = kFirstCaptureIndex + capture_register_count;
-  Handle<RegExpMatchInfo> result =
-      Handle<RegExpMatchInfo>::cast(EnsureSpaceInFixedArray(
-          isolate, match_info, required_length, AllocationType::kYoung));
-  result->SetNumberOfCaptureRegisters(capture_register_count);
-  return result;
-}
-
 template <typename IsolateT>
 Handle<DescriptorArray> DescriptorArray::Allocate(IsolateT* isolate,
                                                   int nof_descriptors,
@@ -4436,8 +3754,8 @@ template Handle<DescriptorArray> DescriptorArray::Allocate(
     LocalIsolate* isolate, int nof_descriptors, int slack,
     AllocationType allocation);
 
-void DescriptorArray::Initialize(EnumCache empty_enum_cache,
-                                 HeapObject undefined_value,
+void DescriptorArray::Initialize(Tagged<EnumCache> empty_enum_cache,
+                                 Tagged<HeapObject> undefined_value,
                                  int nof_descriptors, int slack,
                                  uint32_t raw_gc_state) {
   DCHECK_GE(nof_descriptors, 0);
@@ -4465,20 +3783,21 @@ void DescriptorArray::InitializeOrChangeEnumCache(
     Handle<DescriptorArray> descriptors, Isolate* isolate,
     Handle<FixedArray> keys, Handle<FixedArray> indices,
     AllocationType allocation_if_initialize) {
-  EnumCache enum_cache = descriptors->enum_cache();
+  Tagged<EnumCache> enum_cache = descriptors->enum_cache();
   if (enum_cache == ReadOnlyRoots(isolate).empty_enum_cache()) {
     enum_cache = *isolate->factory()->NewEnumCache(keys, indices,
                                                    allocation_if_initialize);
     descriptors->set_enum_cache(enum_cache);
   } else {
-    enum_cache.set_keys(*keys);
-    enum_cache.set_indices(*indices);
+    enum_cache->set_keys(*keys);
+    enum_cache->set_indices(*indices);
   }
 }
 
-void DescriptorArray::CopyFrom(InternalIndex index, DescriptorArray src) {
-  PropertyDetails details = src.GetDetails(index);
-  Set(index, src.GetKey(index), src.GetValue(index), details);
+void DescriptorArray::CopyFrom(InternalIndex index,
+                               Tagged<DescriptorArray> src) {
+  PropertyDetails details = src->GetDetails(index);
+  Set(index, src->GetKey(index), src->GetValue(index), details);
 }
 
 void DescriptorArray::Sort() {
@@ -4491,12 +3810,12 @@ void DescriptorArray::Sort() {
   int max_parent_index = (len / 2) - 1;
   for (int i = max_parent_index; i >= 0; --i) {
     int parent_index = i;
-    const uint32_t parent_hash = GetSortedKey(i).hash();
+    const uint32_t parent_hash = GetSortedKey(i)->hash();
     while (parent_index <= max_parent_index) {
       int child_index = 2 * parent_index + 1;
-      uint32_t child_hash = GetSortedKey(child_index).hash();
+      uint32_t child_hash = GetSortedKey(child_index)->hash();
       if (child_index + 1 < len) {
-        uint32_t right_child_hash = GetSortedKey(child_index + 1).hash();
+        uint32_t right_child_hash = GetSortedKey(child_index + 1)->hash();
         if (right_child_hash > child_hash) {
           child_index++;
           child_hash = right_child_hash;
@@ -4515,13 +3834,13 @@ void DescriptorArray::Sort() {
     SwapSortedKeys(0, i);
     // Shift down the new top element.
     int parent_index = 0;
-    const uint32_t parent_hash = GetSortedKey(parent_index).hash();
+    const uint32_t parent_hash = GetSortedKey(parent_index)->hash();
     max_parent_index = (i / 2) - 1;
     while (parent_index <= max_parent_index) {
       int child_index = parent_index * 2 + 1;
-      uint32_t child_hash = GetSortedKey(child_index).hash();
+      uint32_t child_hash = GetSortedKey(child_index)->hash();
       if (child_index + 1 < i) {
-        uint32_t right_child_hash = GetSortedKey(child_index + 1).hash();
+        uint32_t right_child_hash = GetSortedKey(child_index + 1)->hash();
         if (right_child_hash > child_hash) {
           child_index++;
           child_hash = right_child_hash;
@@ -4544,8 +3863,8 @@ void DescriptorArray::CheckNameCollisionDuringInsertion(Descriptor* desc,
   if (insertion_index <= 0) return;
 
   for (int i = insertion_index; i > 0; --i) {
-    Name current_key = GetSortedKey(i - 1);
-    if (current_key.hash() != desc_hash) return;
+    Tagged<Name> current_key = GetSortedKey(i - 1);
+    if (current_key->hash() != desc_hash) return;
     CHECK(current_key != *desc->GetKey());
   }
 }
@@ -4554,10 +3873,10 @@ Handle<AccessorPair> AccessorPair::Copy(Isolate* isolate,
                                         Handle<AccessorPair> pair) {
   Handle<AccessorPair> copy = isolate->factory()->NewAccessorPair();
   DisallowGarbageCollection no_gc;
-  auto raw_src = *pair;
-  auto raw_copy = *copy;
-  raw_copy.set_getter(raw_src.getter());
-  raw_copy.set_setter(raw_src.setter());
+  Tagged<AccessorPair> raw_src = *pair;
+  Tagged<AccessorPair> raw_copy = *copy;
+  raw_copy->set_getter(raw_src->getter());
+  raw_copy->set_setter(raw_src->setter());
   return copy;
 }
 
@@ -4566,29 +3885,31 @@ Handle<Object> AccessorPair::GetComponent(Isolate* isolate,
                                           Handle<AccessorPair> accessor_pair,
                                           AccessorComponent component) {
   Handle<Object> accessor(accessor_pair->get(component), isolate);
-  if (accessor->IsFunctionTemplateInfo()) {
-    auto function = ApiNatives::InstantiateFunction(
-                        isolate, native_context,
-                        Handle<FunctionTemplateInfo>::cast(accessor))
-                        .ToHandleChecked();
+  if (IsFunctionTemplateInfo(*accessor)) {
+    // TODO(v8:5962): pass the right name here: "get "/"set " + prop.
+    Handle<JSFunction> function =
+        ApiNatives::InstantiateFunction(
+            isolate, native_context,
+            Handle<FunctionTemplateInfo>::cast(accessor))
+            .ToHandleChecked();
     accessor_pair->set(component, *function, kReleaseStore);
     return function;
   }
-  if (accessor->IsNull(isolate)) {
+  if (IsNull(*accessor, isolate)) {
     return isolate->factory()->undefined_value();
   }
   return accessor;
 }
 
 #ifdef DEBUG
-bool DescriptorArray::IsEqualTo(DescriptorArray other) {
-  if (number_of_all_descriptors() != other.number_of_all_descriptors()) {
+bool DescriptorArray::IsEqualTo(Tagged<DescriptorArray> other) {
+  if (number_of_all_descriptors() != other->number_of_all_descriptors()) {
     return false;
   }
   for (InternalIndex i : InternalIndex::Range(number_of_descriptors())) {
-    if (GetKey(i) != other.GetKey(i)) return false;
-    if (GetDetails(i).AsSmi() != other.GetDetails(i).AsSmi()) return false;
-    if (GetValue(i) != other.GetValue(i)) return false;
+    if (GetKey(i) != other->GetKey(i)) return false;
+    if (GetDetails(i).AsSmi() != other->GetDetails(i).AsSmi()) return false;
+    if (GetValue(i) != other->GetValue(i)) return false;
   }
   return true;
 }
@@ -4596,11 +3917,11 @@ bool DescriptorArray::IsEqualTo(DescriptorArray other) {
 
 // static
 MaybeHandle<String> Name::ToFunctionName(Isolate* isolate, Handle<Name> name) {
-  if (name->IsString()) return Handle<String>::cast(name);
+  if (IsString(*name)) return Handle<String>::cast(name);
   // ES6 section 9.2.11 SetFunctionName, step 4.
   Handle<Object> description(Handle<Symbol>::cast(name)->description(),
                              isolate);
-  if (description->IsUndefined(isolate)) {
+  if (IsUndefined(*description, isolate)) {
     return isolate->factory()->empty_string();
   }
   IncrementalStringBuilder builder(isolate);
@@ -4668,38 +3989,39 @@ void Relocatable::Iterate(RootVisitor* v, Relocatable* top) {
 namespace {
 
 template <typename sinkchar>
-void WriteFixedArrayToFlat(FixedArray fixed_array, int length, String separator,
-                           sinkchar* sink, int sink_length) {
+void WriteFixedArrayToFlat(Tagged<FixedArray> fixed_array, int length,
+                           Tagged<String> separator, sinkchar* sink,
+                           int sink_length) {
   DisallowGarbageCollection no_gc;
   CHECK_GT(length, 0);
-  CHECK_LE(length, fixed_array.length());
+  CHECK_LE(length, fixed_array->length());
 #ifdef DEBUG
   sinkchar* sink_end = sink + sink_length;
 #endif
 
-  const int separator_length = separator.length();
+  const int separator_length = separator->length();
   const bool use_one_byte_separator_fast_path =
       separator_length == 1 && sizeof(sinkchar) == 1 &&
       StringShape(separator).IsSequentialOneByte();
   uint8_t separator_one_char;
   if (use_one_byte_separator_fast_path) {
     CHECK(StringShape(separator).IsSequentialOneByte());
-    CHECK_EQ(separator.length(), 1);
-    separator_one_char = SeqOneByteString::cast(separator).GetChars(no_gc)[0];
+    CHECK_EQ(separator->length(), 1);
+    separator_one_char = SeqOneByteString::cast(separator)->GetChars(no_gc)[0];
   }
 
   uint32_t num_separators = 0;
   uint32_t repeat_last = 0;
   for (int i = 0; i < length; i++) {
-    Object element = fixed_array.get(i);
-    const bool element_is_special = element.IsSmi();
+    Tagged<Object> element = fixed_array->get(i);
+    const bool element_is_special = IsSmi(element);
 
     // If element is a positive Smi, it represents the number of separators to
     // write. If it is a negative Smi, it reprsents the number of times the last
     // string is repeated.
     if (V8_UNLIKELY(element_is_special)) {
       int count;
-      CHECK(element.ToInt32(&count));
+      CHECK(Object::ToInt32(element, &count));
       if (count > 0) {
         num_separators = count;
         //  Verify that Smis (number of separators) only occur when necessary:
@@ -4714,7 +4036,7 @@ void WriteFixedArrayToFlat(FixedArray fixed_array, int length, String separator,
         repeat_last = -count;
         // Repeat is only possible when the previous element is not special.
         DCHECK_GT(i, 0);
-        DCHECK(fixed_array.get(i - 1).IsString());
+        DCHECK(IsString(fixed_array->get(i - 1)));
       }
     }
 
@@ -4741,8 +4063,8 @@ void WriteFixedArrayToFlat(FixedArray fixed_array, int length, String separator,
     // Repeat the last written string |repeat_last| times (including
     // separators).
     if (V8_UNLIKELY(repeat_last > 0)) {
-      Object last_element = fixed_array.get(i - 1);
-      int string_length = String::cast(last_element).length();
+      Tagged<Object> last_element = fixed_array->get(i - 1);
+      int string_length = String::cast(last_element)->length();
       // The implemented logic requires that string length is > 0. Empty strings
       // are handled by repeating the separator (positive smi in the fixed
       // array) already.
@@ -4770,9 +4092,9 @@ void WriteFixedArrayToFlat(FixedArray fixed_array, int length, String separator,
     }
 
     if (V8_LIKELY(!element_is_special)) {
-      DCHECK(element.IsString());
-      String string = String::cast(element);
-      const int string_length = string.length();
+      DCHECK(IsString(element));
+      Tagged<String> string = String::cast(element);
+      const int string_length = string->length();
 
       DCHECK(string_length == 0 || sink < sink_end);
       String::WriteToFlat(string, sink, 0, string_length);
@@ -4797,22 +4119,22 @@ Address JSArray::ArrayJoinConcatToSequentialString(Isolate* isolate,
                                                    Address raw_dest) {
   DisallowGarbageCollection no_gc;
   DisallowJavascriptExecution no_js(isolate);
-  FixedArray fixed_array = FixedArray::cast(Object(raw_fixed_array));
-  String separator = String::cast(Object(raw_separator));
-  String dest = String::cast(Object(raw_dest));
-  DCHECK(fixed_array.IsFixedArray());
+  Tagged<FixedArray> fixed_array = FixedArray::cast(Object(raw_fixed_array));
+  Tagged<String> separator = String::cast(Object(raw_separator));
+  Tagged<String> dest = String::cast(Object(raw_dest));
+  DCHECK(IsFixedArray(fixed_array));
   DCHECK(StringShape(dest).IsSequentialOneByte() ||
          StringShape(dest).IsSequentialTwoByte());
 
   if (StringShape(dest).IsSequentialOneByte()) {
     WriteFixedArrayToFlat(fixed_array, static_cast<int>(length), separator,
-                          SeqOneByteString::cast(dest).GetChars(no_gc),
-                          dest.length());
+                          SeqOneByteString::cast(dest)->GetChars(no_gc),
+                          dest->length());
   } else {
     DCHECK(StringShape(dest).IsSequentialTwoByte());
     WriteFixedArrayToFlat(fixed_array, static_cast<int>(length), separator,
-                          SeqTwoByteString::cast(dest).GetChars(no_gc),
-                          dest.length());
+                          SeqTwoByteString::cast(dest)->GetChars(no_gc),
+                          dest->length());
   }
   return dest.ptr();
 }
@@ -4839,16 +4161,16 @@ STATIC_ASSERT_FIELD_OFFSETS_EQUAL(HeapNumber::kValueOffset,
 
 void Oddball::Initialize(Isolate* isolate, Handle<Oddball> oddball,
                          const char* to_string, Handle<Object> to_number,
-                         const char* type_of, byte kind) {
+                         const char* type_of, uint8_t kind) {
   Handle<String> internalized_to_string =
       isolate->factory()->InternalizeUtf8String(to_string);
   Handle<String> internalized_type_of =
       isolate->factory()->InternalizeUtf8String(type_of);
-  if (to_number->IsHeapNumber()) {
+  if (IsHeapNumber(*to_number)) {
     oddball->set_to_number_raw_as_bits(
         Handle<HeapNumber>::cast(to_number)->value_as_bits(kRelaxedLoad));
   } else {
-    oddball->set_to_number_raw(to_number->Number());
+    oddball->set_to_number_raw(Object::Number(*to_number));
   }
   oddball->set_to_number(*to_number);
   oddball->set_to_string(*internalized_to_string);
@@ -4858,7 +4180,7 @@ void Oddball::Initialize(Isolate* isolate, Handle<Oddball> oddball,
 
 // static
 int Script::GetEvalPosition(Isolate* isolate, Handle<Script> script) {
-  DCHECK(script->compilation_type() == Script::COMPILATION_TYPE_EVAL);
+  DCHECK(script->compilation_type() == Script::CompilationType::kEval);
   int position = script->eval_from_position();
   if (position < 0) {
     // Due to laziness, the position may not have been translated from code
@@ -4871,7 +4193,7 @@ int Script::GetEvalPosition(Isolate* isolate, Handle<Script> script) {
           handle(script->eval_from_shared(), isolate);
       SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, shared);
       position =
-          shared->abstract_code(isolate).SourcePosition(isolate, -position);
+          shared->abstract_code(isolate)->SourcePosition(isolate, -position);
     }
     DCHECK_GE(position, 0);
     script->set_eval_from_position(position);
@@ -4881,64 +4203,78 @@ int Script::GetEvalPosition(Isolate* isolate, Handle<Script> script) {
 
 template <typename IsolateT>
 // static
-void Script::InitLineEnds(IsolateT* isolate, Handle<Script> script) {
-  if (!script->line_ends().IsUndefined(isolate)) return;
-#if V8_ENABLE_WEBASSEMBLY
-  DCHECK(script->type() != Script::TYPE_WASM ||
-         script->source_mapping_url().IsString());
-#endif  // V8_ENABLE_WEBASSEMBLY
-
-  Object src_obj = script->source();
-  if (!src_obj.IsString()) {
-    DCHECK(src_obj.IsUndefined(isolate));
+void Script::InitLineEndsInternal(IsolateT* isolate, Handle<Script> script) {
+  DCHECK(!script->has_line_ends());
+  DCHECK(script->CanHaveLineEnds());
+  Tagged<Object> src_obj = script->source();
+  if (!IsString(src_obj)) {
+    DCHECK(IsUndefined(src_obj, isolate));
     script->set_line_ends(ReadOnlyRoots(isolate).empty_fixed_array());
   } else {
-    DCHECK(src_obj.IsString());
+    DCHECK(IsString(src_obj));
     Handle<String> src(String::cast(src_obj), isolate);
     Handle<FixedArray> array = String::CalculateLineEnds(isolate, src, true);
     script->set_line_ends(*array);
   }
+  DCHECK(IsFixedArray(script->line_ends()));
+  DCHECK(script->has_line_ends());
+}
 
-  DCHECK(script->line_ends().IsFixedArray());
+void Script::SetSource(Isolate* isolate, Handle<Script> script,
+                       Handle<String> source) {
+  script->set_source(*source);
+  if (isolate->NeedsSourcePositions()) InitLineEnds(isolate, script);
 }
 
-template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Script::InitLineEnds(
-    Isolate* isolate, Handle<Script> script);
-template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Script::InitLineEnds(
-    LocalIsolate* isolate, Handle<Script> script);
+template EXPORT_TEMPLATE_DEFINE(
+    V8_EXPORT_PRIVATE) void Script::InitLineEndsInternal(Isolate* isolate,
+                                                         Handle<Script> script);
+template EXPORT_TEMPLATE_DEFINE(
+    V8_EXPORT_PRIVATE) void Script::InitLineEndsInternal(LocalIsolate* isolate,
+                                                         Handle<Script> script);
 
 bool Script::GetPositionInfo(Handle<Script> script, int position,
                              PositionInfo* info, OffsetFlag offset_flag) {
-  bool init_line_ends = true;
 #if V8_ENABLE_WEBASSEMBLY
   // For wasm, we do not create an artificial line_ends array, but do the
   // translation directly.
-  init_line_ends = script->type() != Script::TYPE_WASM;
+#ifdef DEBUG
+  if (script->type() == Type::kWasm) {
+    DCHECK(script->has_line_ends());
+    DCHECK_EQ(FixedArray::cast(script->line_ends())->length(), 0);
+  }
+#endif  // DEBUG
 #endif  // V8_ENABLE_WEBASSEMBLY
-  if (init_line_ends) InitLineEnds(script->GetIsolate(), script);
+  InitLineEnds(script->GetIsolate(), script);
   return script->GetPositionInfo(position, info, offset_flag);
 }
 
 bool Script::IsSubjectToDebugging() const {
   switch (type()) {
-    case TYPE_NORMAL:
+    case Type::kNormal:
 #if V8_ENABLE_WEBASSEMBLY
-    case TYPE_WASM:
+    case Type::kWasm:
 #endif  // V8_ENABLE_WEBASSEMBLY
       return true;
+    case Type::kNative:
+    case Type::kInspector:
+    case Type::kExtension:
+      return false;
   }
-  return false;
+  UNREACHABLE();
 }
 
-bool Script::IsUserJavaScript() const { return type() == Script::TYPE_NORMAL; }
+bool Script::IsUserJavaScript() const {
+  return type() == Script::Type::kNormal;
+}
 
 #if V8_ENABLE_WEBASSEMBLY
 bool Script::ContainsAsmModule() {
   DisallowGarbageCollection no_gc;
   SharedFunctionInfo::ScriptIterator iter(this->GetIsolate(), *this);
-  for (SharedFunctionInfo info = iter.Next(); !info.is_null();
-       info = iter.Next()) {
-    if (info.HasAsmWasmData()) return true;
+  for (Tagged<SharedFunctionInfo> sfi = iter.Next(); !sfi.is_null();
+       sfi = iter.Next()) {
+    if (sfi->HasAsmWasmData()) return true;
   }
   return false;
 }
@@ -4947,7 +4283,7 @@ bool Script::ContainsAsmModule() {
 namespace {
 
 template <typename Char>
-bool GetPositionInfoSlowImpl(const base::Vector<Char>& source, int position,
+bool GetPositionInfoSlowImpl(base::Vector<Char> source, int position,
                              Script::PositionInfo* info) {
   if (position < 0) {
     position = 0;
@@ -4969,14 +4305,14 @@ bool GetPositionInfoSlowImpl(const base::Vector<Char>& source, int position,
   }
   return false;
 }
-bool GetPositionInfoSlow(const Script script, int position,
+bool GetPositionInfoSlow(const Tagged<Script> script, int position,
                          const DisallowGarbageCollection& no_gc,
                          Script::PositionInfo* info) {
-  if (!script.source().IsString()) {
+  if (!IsString(script->source())) {
     return false;
   }
-  auto source = String::cast(script.source());
-  const auto flat = source.GetFlatContent(no_gc);
+  auto source = String::cast(script->source());
+  const auto flat = source->GetFlatContent(no_gc);
   return flat.IsOneByte()
              ? GetPositionInfoSlowImpl(flat.ToOneByteVector(), position, info)
              : GetPositionInfoSlowImpl(flat.ToUC16Vector(), position, info);
@@ -4990,7 +4326,7 @@ bool Script::GetPositionInfo(int position, PositionInfo* info,
 
 #if V8_ENABLE_WEBASSEMBLY
   // For wasm, we use the byte offset as the column.
-  if (type() == Script::TYPE_WASM) {
+  if (type() == Script::Type::kWasm) {
     DCHECK_LE(0, position);
     wasm::NativeModule* native_module = wasm_native_module();
     const wasm::WasmModule* module = native_module->module();
@@ -5003,28 +4339,28 @@ bool Script::GetPositionInfo(int position, PositionInfo* info,
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-  if (line_ends().IsUndefined()) {
+  if (!has_line_ends()) {
     // Slow mode: we do not have line_ends. We have to iterate through source.
     if (!GetPositionInfoSlow(*this, position, no_gc, info)) {
       return false;
     }
   } else {
-    DCHECK(line_ends().IsFixedArray());
-    FixedArray ends = FixedArray::cast(line_ends());
+    DCHECK(has_line_ends());
+    Tagged<FixedArray> ends = FixedArray::cast(line_ends());
 
-    const int ends_len = ends.length();
+    const int ends_len = ends->length();
     if (ends_len == 0) return false;
 
     // Return early on invalid positions. Negative positions behave as if 0 was
     // passed, and positions beyond the end of the script return as failure.
     if (position < 0) {
       position = 0;
-    } else if (position > Smi::ToInt(ends.get(ends_len - 1))) {
+    } else if (position > Smi::ToInt(ends->get(ends_len - 1))) {
       return false;
     }
 
     // Determine line number by doing a binary search on the line ends array.
-    if (Smi::ToInt(ends.get(0)) >= position) {
+    if (Smi::ToInt(ends->get(0)) >= position) {
       info->line = 0;
       info->line_start = 0;
       info->column = position;
@@ -5035,39 +4371,41 @@ bool Script::GetPositionInfo(int position, PositionInfo* info,
       while (right > 0) {
         DCHECK_LE(left, right);
         const int mid = (left + right) / 2;
-        if (position > Smi::ToInt(ends.get(mid))) {
+        if (position > Smi::ToInt(ends->get(mid))) {
           left = mid + 1;
-        } else if (position <= Smi::ToInt(ends.get(mid - 1))) {
+        } else if (position <= Smi::ToInt(ends->get(mid - 1))) {
           right = mid - 1;
         } else {
           info->line = mid;
           break;
         }
       }
-      DCHECK(Smi::ToInt(ends.get(info->line)) >= position &&
-             Smi::ToInt(ends.get(info->line - 1)) < position);
-      info->line_start = Smi::ToInt(ends.get(info->line - 1)) + 1;
+      DCHECK(Smi::ToInt(ends->get(info->line)) >= position &&
+             Smi::ToInt(ends->get(info->line - 1)) < position);
+      info->line_start = Smi::ToInt(ends->get(info->line - 1)) + 1;
       info->column = position - info->line_start;
     }
 
     // Line end is position of the linebreak character.
-    info->line_end = Smi::ToInt(ends.get(info->line));
+    info->line_end = Smi::ToInt(ends->get(info->line));
     if (info->line_end > 0) {
-      DCHECK(source().IsString());
-      String src = String::cast(source());
-      if (src.length() >= info->line_end &&
-          src.Get(info->line_end - 1) == '\r') {
+      DCHECK(IsString(source()));
+      Tagged<String> src = String::cast(source());
+      if (src->length() >= info->line_end &&
+          src->Get(info->line_end - 1) == '\r') {
         info->line_end--;
       }
     }
   }
 
   // Add offsets if requested.
-  if (offset_flag == WITH_OFFSET) {
+  if (offset_flag == OffsetFlag::kWithOffset) {
     if (info->line == 0) {
       info->column += column_offset();
     }
     info->line += line_offset();
+  } else {
+    DCHECK_EQ(offset_flag, OffsetFlag::kNoOffset);
   }
 
   return true;
@@ -5075,31 +4413,31 @@ bool Script::GetPositionInfo(int position, PositionInfo* info,
 
 int Script::GetColumnNumber(Handle<Script> script, int code_pos) {
   PositionInfo info;
-  GetPositionInfo(script, code_pos, &info, WITH_OFFSET);
+  GetPositionInfo(script, code_pos, &info);
   return info.column;
 }
 
 int Script::GetColumnNumber(int code_pos) const {
   PositionInfo info;
-  GetPositionInfo(code_pos, &info, WITH_OFFSET);
+  GetPositionInfo(code_pos, &info);
   return info.column;
 }
 
 int Script::GetLineNumber(Handle<Script> script, int code_pos) {
   PositionInfo info;
-  GetPositionInfo(script, code_pos, &info, WITH_OFFSET);
+  GetPositionInfo(script, code_pos, &info);
   return info.line;
 }
 
 int Script::GetLineNumber(int code_pos) const {
   PositionInfo info;
-  GetPositionInfo(code_pos, &info, WITH_OFFSET);
+  GetPositionInfo(code_pos, &info);
   return info.line;
 }
 
-Object Script::GetNameOrSourceURL() {
+Tagged<Object> Script::GetNameOrSourceURL() {
   // Keep in sync with ScriptNameOrSourceURL in messages.js.
-  if (!source_url().IsUndefined()) return source_url();
+  if (!IsUndefined(source_url())) return source_url();
   return name();
 }
 
@@ -5112,8 +4450,8 @@ Handle<String> Script::GetScriptHash(Isolate* isolate, Handle<Script> script,
 
   PtrComprCageBase cage_base(isolate);
   {
-    Object maybe_source_hash = script->source_hash(cage_base);
-    if (maybe_source_hash.IsString(cage_base)) {
+    Tagged<Object> maybe_source_hash = script->source_hash(cage_base);
+    if (IsString(maybe_source_hash, cage_base)) {
       Handle<String> precomputed(String::cast(maybe_source_hash), isolate);
       if (precomputed->length() > 0) {
         return precomputed;
@@ -5123,9 +4461,9 @@ Handle<String> Script::GetScriptHash(Isolate* isolate, Handle<Script> script,
 
   Handle<String> src_text;
   {
-    Object maybe_script_source = script->source(cage_base);
+    Tagged<Object> maybe_script_source = script->source(cage_base);
 
-    if (!maybe_script_source.IsString(cage_base)) {
+    if (!IsString(maybe_script_source, cage_base)) {
       return isolate->factory()->empty_string();
     }
     src_text = handle(String::cast(maybe_script_source), isolate);
@@ -5159,10 +4497,11 @@ MaybeHandle<SharedFunctionInfo> Script::FindSharedFunctionInfo(
   // AstTraversalVisitor doesn't recurse properly in the construct which
   // triggers the mismatch.
   CHECK_LT(function_literal_id, script->shared_function_info_count());
-  MaybeObject shared = script->shared_function_infos().Get(function_literal_id);
-  HeapObject heap_object;
-  if (!shared->GetHeapObject(&heap_object) ||
-      heap_object.IsUndefined(isolate)) {
+  MaybeObject shared =
+      script->shared_function_infos()->Get(function_literal_id);
+  Tagged<HeapObject> heap_object;
+  if (!shared.GetHeapObject(&heap_object) ||
+      IsUndefined(heap_object, isolate)) {
     return MaybeHandle<SharedFunctionInfo>();
   }
   return handle(SharedFunctionInfo::cast(heap_object), isolate);
@@ -5176,8 +4515,8 @@ template MaybeHandle<SharedFunctionInfo> Script::FindSharedFunctionInfo(
 Script::Iterator::Iterator(Isolate* isolate)
     : iterator_(isolate->heap()->script_list()) {}
 
-Script Script::Iterator::Next() {
-  Object o = iterator_.Next();
+Tagged<Script> Script::Iterator::Next() {
+  Tagged<Object> o = iterator_.Next();
   if (o != Object()) {
     return Script::cast(o);
   }
@@ -5188,7 +4527,8 @@ Script Script::Iterator::Next() {
 void JSArray::Initialize(Handle<JSArray> array, int capacity, int length) {
   DCHECK_GE(capacity, 0);
   array->GetIsolate()->factory()->NewJSArrayStorage(
-      array, length, capacity, INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
+      array, length, capacity,
+      ArrayStorageAllocationMode::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
 }
 
 Maybe<bool> JSArray::SetLength(Handle<JSArray> array, uint32_t new_length) {
@@ -5206,7 +4546,7 @@ Maybe<bool> JSProxy::SetPrototype(Isolate* isolate, Handle<JSProxy> proxy,
   STACK_CHECK(isolate, Nothing<bool>());
   Handle<Name> trap_name = isolate->factory()->setPrototypeOf_string();
   // 1. Assert: Either Type(V) is Object or Type(V) is Null.
-  DCHECK(value->IsJSReceiver() || value->IsNull(isolate));
+  DCHECK(IsJSReceiver(*value) || IsNull(*value, isolate));
   // 2. Let handler be the value of the [[ProxyHandler]] internal slot of O.
   Handle<Object> handler(proxy->handler(), isolate);
   // 3. If handler is null, throw a TypeError exception.
@@ -5222,10 +4562,10 @@ Maybe<bool> JSProxy::SetPrototype(Isolate* isolate, Handle<JSProxy> proxy,
   Handle<Object> trap;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, trap,
-      Object::GetMethod(Handle<JSReceiver>::cast(handler), trap_name),
+      Object::GetMethod(isolate, Handle<JSReceiver>::cast(handler), trap_name),
       Nothing<bool>());
   // 7. If trap is undefined, then return target.[[SetPrototypeOf]]().
-  if (trap->IsUndefined(isolate)) {
+  if (IsUndefined(*trap, isolate)) {
     return JSReceiver::SetPrototype(isolate, target, value, from_javascript,
                                     should_throw);
   }
@@ -5236,7 +4576,7 @@ Maybe<bool> JSProxy::SetPrototype(Isolate* isolate, Handle<JSProxy> proxy,
       isolate, trap_result,
       Execution::Call(isolate, trap, handler, arraysize(argv), argv),
       Nothing<bool>());
-  bool bool_trap_result = trap_result->BooleanValue(isolate);
+  bool bool_trap_result = Object::BooleanValue(*trap_result, isolate);
   // 9. If booleanTrapResult is false, return false.
   if (!bool_trap_result) {
     RETURN_FAILURE(
@@ -5259,7 +4599,7 @@ Maybe<bool> JSProxy::SetPrototype(Isolate* isolate, Handle<JSProxy> proxy,
                                    JSReceiver::GetPrototype(isolate, target),
                                    Nothing<bool>());
   // 13. If SameValue(V, targetProto) is false, throw a TypeError exception.
-  if (bool_trap_result && !value->SameValue(*target_proto)) {
+  if (bool_trap_result && !Object::SameValue(*value, *target_proto)) {
     isolate->Throw(*isolate->factory()->NewTypeError(
         MessageTemplate::kProxySetPrototypeOfNonExtensible));
     return Nothing<bool>();
@@ -5270,15 +4610,13 @@ Maybe<bool> JSProxy::SetPrototype(Isolate* isolate, Handle<JSProxy> proxy,
 
 bool JSArray::SetLengthWouldNormalize(uint32_t new_length) {
   if (!HasFastElements()) return false;
-  uint32_t capacity = static_cast<uint32_t>(elements().length());
+  uint32_t capacity = static_cast<uint32_t>(elements()->length());
   uint32_t new_capacity;
   return JSArray::SetLengthWouldNormalize(GetHeap(), new_length) &&
          ShouldConvertToSlowElements(*this, capacity, new_length - 1,
                                      &new_capacity);
 }
 
-const double AllocationSite::kPretenureRatio = 0.85;
-
 void AllocationSite::ResetPretenureDecision() {
   set_pretenure_decision(kUndecided);
   set_memento_found_count(0);
@@ -5293,13 +4631,13 @@ AllocationType AllocationSite::GetAllocationType() const {
 
 bool AllocationSite::IsNested() {
   DCHECK(v8_flags.trace_track_allocation_sites);
-  Object current = boilerplate().GetHeap()->allocation_sites_list();
-  while (current.IsAllocationSite()) {
-    AllocationSite current_site = AllocationSite::cast(current);
-    if (current_site.nested_site() == *this) {
+  Tagged<Object> current = boilerplate()->GetHeap()->allocation_sites_list();
+  while (IsAllocationSite(current)) {
+    Tagged<AllocationSite> current_site = AllocationSite::cast(current);
+    if (current_site->nested_site() == *this) {
       return true;
     }
-    current = current_site.weak_next();
+    current = current_site->weak_next();
   }
   return false;
 }
@@ -5327,21 +4665,21 @@ const char* AllocationSite::PretenureDecisionName(PretenureDecision decision) {
 }
 
 // static
-bool JSArray::MayHaveReadOnlyLength(Map js_array_map) {
-  DCHECK(js_array_map.IsJSArrayMap());
-  if (js_array_map.is_dictionary_map()) return true;
+bool JSArray::MayHaveReadOnlyLength(Tagged<Map> js_array_map) {
+  DCHECK(IsJSArrayMap(js_array_map));
+  if (js_array_map->is_dictionary_map()) return true;
 
   // Fast path: "length" is the first fast property of arrays with non
   // dictionary properties. Since it's not configurable, it's guaranteed to be
   // the first in the descriptor array.
   InternalIndex first(0);
-  DCHECK(js_array_map.instance_descriptors().GetKey(first) ==
-         js_array_map.GetReadOnlyRoots().length_string());
-  return js_array_map.instance_descriptors().GetDetails(first).IsReadOnly();
+  DCHECK(js_array_map->instance_descriptors()->GetKey(first) ==
+         js_array_map->GetReadOnlyRoots().length_string());
+  return js_array_map->instance_descriptors()->GetDetails(first).IsReadOnly();
 }
 
 bool JSArray::HasReadOnlyLength(Handle<JSArray> array) {
-  Map map = array->map();
+  Tagged<Map> map = array->map();
 
   // If map guarantees that there can't be a read-only length, we are done.
   if (!MayHaveReadOnlyLength(map)) return false;
@@ -5356,20 +4694,11 @@ bool JSArray::HasReadOnlyLength(Handle<JSArray> array) {
 
 bool JSArray::WouldChangeReadOnlyLength(Handle<JSArray> array, uint32_t index) {
   uint32_t length = 0;
-  CHECK(array->length().ToArrayLength(&length));
+  CHECK(Object::ToArrayLength(array->length(), &length));
   if (length <= index) return HasReadOnlyLength(array);
   return false;
 }
 
-int FixedArrayBase::GetMaxLengthForNewSpaceAllocation(ElementsKind kind) {
-  return ((kMaxRegularHeapObjectSize - FixedArrayBase::kHeaderSize) >>
-          ElementsKindToShiftSize(kind));
-}
-
-bool FixedArrayBase::IsCowArray() const {
-  return map() == GetReadOnlyRoots().fixed_cow_array_map();
-}
-
 const char* Symbol::PrivateSymbolToName() const {
   ReadOnlyRoots roots = GetReadOnlyRoots();
 #define SYMBOL_CHECK_AND_PRINT(_, name) \
@@ -5379,18 +4708,6 @@ const char* Symbol::PrivateSymbolToName() const {
   return "UNKNOWN";
 }
 
-void Symbol::SymbolShortPrint(std::ostream& os) {
-  os << "<Symbol:";
-  if (!description().IsUndefined()) {
-    os << " ";
-    String description_as_string = String::cast(description());
-    description_as_string.PrintUC16(os, 0, description_as_string.length());
-  } else {
-    os << " (" << PrivateSymbolToName() << ")";
-  }
-  os << ">";
-}
-
 v8::Promise::PromiseState JSPromise::status() const {
   int value = flags() & StatusBits::kMask;
   DCHECK(value == 0 || value == 1 || value == 2);
@@ -5430,7 +4747,7 @@ Handle<Object> JSPromise::Fulfill(Handle<JSPromise> promise,
 
 #ifdef V8_ENABLE_JAVASCRIPT_PROMISE_HOOKS
   if (isolate->HasContextPromiseHooks()) {
-    isolate->raw_native_context().RunPromiseHook(
+    isolate->raw_native_context()->RunPromiseHook(
         PromiseHookType::kResolve, promise,
         isolate->factory()->undefined_value());
   }
@@ -5458,11 +4775,14 @@ Handle<Object> JSPromise::Fulfill(Handle<JSPromise> promise,
 static void MoveMessageToPromise(Isolate* isolate, Handle<JSPromise> promise) {
   if (!isolate->has_pending_message()) return;
 
-  Handle<Object> message = handle(isolate->pending_message(), isolate);
-  Handle<Symbol> key = isolate->factory()->promise_debug_message_symbol();
-  Object::SetProperty(isolate, promise, key, message, StoreOrigin::kMaybeKeyed,
-                      Just(ShouldThrow::kThrowOnError))
-      .Assert();
+  if (isolate->debug()->is_active()) {
+    Handle<Object> message = handle(isolate->pending_message(), isolate);
+    Handle<Symbol> key = isolate->factory()->promise_debug_message_symbol();
+    Object::SetProperty(isolate, promise, key, message,
+                        StoreOrigin::kMaybeKeyed,
+                        Just(ShouldThrow::kThrowOnError))
+        .Assert();
+  }
 
   // The message object for a rejected promise was only stored for this purpose.
   // Clear it, otherwise we might leak memory.
@@ -5476,7 +4796,7 @@ Handle<Object> JSPromise::Reject(Handle<JSPromise> promise,
   DCHECK(
       !reinterpret_cast<v8::Isolate*>(isolate)->GetCurrentContext().IsEmpty());
 
-  if (isolate->debug()->is_active()) MoveMessageToPromise(isolate, promise);
+  MoveMessageToPromise(isolate, promise);
 
   if (debug_event) isolate->debug()->OnPromiseReject(promise, reason);
   isolate->RunAllPromiseHooks(PromiseHookType::kResolve, promise,
@@ -5528,7 +4848,7 @@ MaybeHandle<Object> JSPromise::Resolve(Handle<JSPromise> promise,
   }
 
   // 8. If Type(resolution) is not Object, then
-  if (!resolution->IsJSReceiver()) {
+  if (!IsJSReceiver(*resolution)) {
     // a. Return FulfillPromise(promise, resolution).
     return Fulfill(promise, resolution);
   }
@@ -5542,8 +4862,8 @@ MaybeHandle<Object> JSPromise::Resolve(Handle<JSPromise> promise,
   // protector also guards the negative lookup of "then" on the intrinsic
   // %ObjectPrototype%, meaning that such lookups are guaranteed to yield
   // undefined without triggering any side-effects.
-  if (receiver->IsJSPromise() &&
-      isolate->IsInAnyContext(receiver->map().prototype(),
+  if (IsJSPromise(*receiver) &&
+      isolate->IsInAnyContext(receiver->map()->prototype(),
                               Context::PROMISE_PROTOTYPE_INDEX) &&
       Protectors::IsPromiseThenLookupChainIntact(isolate)) {
     // We can skip the "then" lookup on {resolution} if its [[Prototype]]
@@ -5572,7 +4892,7 @@ MaybeHandle<Object> JSPromise::Resolve(Handle<JSPromise> promise,
 
   // 11. Let thenAction be then.[[Value]].
   // 12. If IsCallable(thenAction) is false, then
-  if (!then_action->IsCallable()) {
+  if (!IsCallable(*then_action)) {
     // a. Return FulfillPromise(promise, resolution).
     return Fulfill(promise, resolution);
   }
@@ -5589,7 +4909,7 @@ MaybeHandle<Object> JSPromise::Resolve(Handle<JSPromise> promise,
       isolate->factory()->NewPromiseResolveThenableJobTask(
           promise, Handle<JSReceiver>::cast(resolution),
           Handle<JSReceiver>::cast(then_action), then_context);
-  if (isolate->debug()->is_active() && resolution->IsJSPromise()) {
+  if (isolate->debug()->is_active() && IsJSPromise(*resolution)) {
     // Mark the dependency of the new {promise} on the {resolution}.
     Object::SetProperty(isolate, resolution,
                         isolate->factory()->promise_handled_by_symbol(),
@@ -5608,17 +4928,17 @@ Handle<Object> JSPromise::TriggerPromiseReactions(Isolate* isolate,
                                                   Handle<Object> reactions,
                                                   Handle<Object> argument,
                                                   PromiseReaction::Type type) {
-  CHECK(reactions->IsSmi() || reactions->IsPromiseReaction());
+  CHECK(IsSmi(*reactions) || IsPromiseReaction(*reactions));
 
   // We need to reverse the {reactions} here, since we record them
   // on the JSPromise in the reverse order.
   {
     DisallowGarbageCollection no_gc;
-    Object current = *reactions;
-    Object reversed = Smi::zero();
-    while (!current.IsSmi()) {
-      Object next = PromiseReaction::cast(current).next();
-      PromiseReaction::cast(current).set_next(reversed);
+    Tagged<Object> current = *reactions;
+    Tagged<Object> reversed = Smi::zero();
+    while (!IsSmi(current)) {
+      Tagged<Object> next = PromiseReaction::cast(current)->next();
+      PromiseReaction::cast(current)->set_next(reversed);
       reversed = current;
       current = next;
     }
@@ -5627,7 +4947,7 @@ Handle<Object> JSPromise::TriggerPromiseReactions(Isolate* isolate,
 
   // Morph the {reactions} into PromiseReactionJobTasks
   // and push them onto the microtask queue.
-  while (!reactions->IsSmi()) {
+  while (!IsSmi(*reactions)) {
     Handle<HeapObject> task = Handle<HeapObject>::cast(reactions);
     Handle<PromiseReaction> reaction = Handle<PromiseReaction>::cast(task);
     reactions = handle(reaction->next(), isolate);
@@ -5648,12 +4968,12 @@ Handle<Object> JSPromise::TriggerPromiseReactions(Isolate* isolate,
     }
 
     bool has_handler_context = false;
-    if (primary_handler->IsJSReceiver()) {
+    if (IsJSReceiver(*primary_handler)) {
       has_handler_context = JSReceiver::GetContextForMicrotask(
                                 Handle<JSReceiver>::cast(primary_handler))
                                 .ToHandle(&handler_context);
     }
-    if (!has_handler_context && secondary_handler->IsJSReceiver()) {
+    if (!has_handler_context && IsJSReceiver(*secondary_handler)) {
       has_handler_context = JSReceiver::GetContextForMicrotask(
                                 Handle<JSReceiver>::cast(secondary_handler))
                                 .ToHandle(&handler_context);
@@ -5754,10 +5074,10 @@ Handle<Derived> HashTable<Derived, Shape>::NewInternal(
       Derived::GetMap(ReadOnlyRoots(isolate)), length, allocation);
   Handle<Derived> table = Handle<Derived>::cast(array);
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
-  raw_table.SetNumberOfElements(0);
-  raw_table.SetNumberOfDeletedElements(0);
-  raw_table.SetCapacity(capacity);
+  Tagged<Derived> raw_table = *table;
+  raw_table->SetNumberOfElements(0);
+  raw_table->SetNumberOfDeletedElements(0);
+  raw_table->SetCapacity(capacity);
   return table;
 }
 
@@ -5778,7 +5098,7 @@ void HashTable<Derived, Shape>::Rehash(PtrComprCageBase cage_base,
   ReadOnlyRoots roots = GetReadOnlyRoots(cage_base);
   for (InternalIndex i : this->IterateEntries()) {
     uint32_t from_index = EntryToIndex(i);
-    Object k = this->get(cage_base, from_index);
+    Tagged<Object> k = this->get(cage_base, from_index);
     if (!IsKey(roots, k)) continue;
     uint32_t hash = Shape::HashForObject(roots, k);
     uint32_t insertion_index =
@@ -5794,7 +5114,8 @@ void HashTable<Derived, Shape>::Rehash(PtrComprCageBase cage_base,
 
 template <typename Derived, typename Shape>
 InternalIndex HashTable<Derived, Shape>::EntryForProbe(ReadOnlyRoots roots,
-                                                       Object k, int probe,
+                                                       Tagged<Object> k,
+                                                       int probe,
                                                        InternalIndex expected) {
   uint32_t hash = Shape::HashForObject(roots, k);
   uint32_t capacity = this->Capacity();
@@ -5839,7 +5160,7 @@ void HashTable<Derived, Shape>::Rehash(PtrComprCageBase cage_base) {
     done = true;
     for (InternalIndex current(0); current.raw_value() < capacity;
          /* {current} is advanced manually below, when appropriate.*/) {
-      Object current_key = KeyAt(cage_base, current);
+      Tagged<Object> current_key = KeyAt(cage_base, current);
       if (!IsKey(roots, current_key)) {
         ++current;  // Advance to next entry.
         continue;
@@ -5849,7 +5170,7 @@ void HashTable<Derived, Shape>::Rehash(PtrComprCageBase cage_base) {
         ++current;  // Advance to next entry.
         continue;
       }
-      Object target_key = KeyAt(cage_base, target);
+      Tagged<Object> target_key = KeyAt(cage_base, target);
       if (!IsKey(roots, target_key) ||
           EntryForProbe(roots, target_key, probe, target) != target) {
         // Put the current element into the correct position.
@@ -5865,8 +5186,8 @@ void HashTable<Derived, Shape>::Rehash(PtrComprCageBase cage_base) {
     }
   }
   // Wipe deleted entries.
-  Object the_hole = roots.the_hole_value();
-  HeapObject undefined = roots.undefined_value();
+  Tagged<Object> the_hole = roots.the_hole_value();
+  Tagged<HeapObject> undefined = roots.undefined_value();
   Derived* self = static_cast<Derived*>(this);
   for (InternalIndex current : InternalIndex::Range(capacity)) {
     if (KeyAt(cage_base, current) == the_hole) {
@@ -5971,7 +5292,7 @@ InternalIndex HashTable<Derived, Shape>::FindInsertionEntry(
   }
 }
 
-base::Optional<PropertyCell>
+base::Optional<Tagged<PropertyCell>>
 GlobalDictionary::TryFindPropertyCellForConcurrentLookupIterator(
     Isolate* isolate, Handle<Name> name, RelaxedLoadTag tag) {
   // This reimplements HashTable::FindEntry for use in a concurrent setting.
@@ -5986,17 +5307,17 @@ GlobalDictionary::TryFindPropertyCellForConcurrentLookupIterator(
   const int32_t hash = ShapeT::Hash(roots, name);
   const uint32_t capacity = Capacity();
   uint32_t count = 1;
-  Object undefined = roots.undefined_value();
-  Object the_hole = roots.the_hole_value();
+  Tagged<Object> undefined = roots.undefined_value();
+  Tagged<Object> the_hole = roots.the_hole_value();
   // EnsureCapacity will guarantee the hash table is never full.
   for (InternalIndex entry = FirstProbe(hash, capacity);;
        entry = NextProbe(entry, count++, capacity)) {
-    Object element = KeyAt(cage_base, entry, kRelaxedLoad);
+    Tagged<Object> element = KeyAt(cage_base, entry, kRelaxedLoad);
     if (isolate->heap()->IsPendingAllocation(element)) return {};
     if (element == undefined) return {};
     if (ShapeT::kMatchNeedsHoleCheck && element == the_hole) continue;
     if (!ShapeT::IsMatch(name, element)) continue;
-    CHECK(element.IsPropertyCell(cage_base));
+    CHECK(IsPropertyCell(element, cage_base));
     return PropertyCell::cast(element);
   }
 }
@@ -6054,8 +5375,9 @@ Handle<NameDictionary> NameDictionary::New(IsolateT* isolate,
                                            int at_least_space_for,
                                            AllocationType allocation,
                                            MinimumCapacity capacity_option) {
-  auto dict = BaseNameDictionary<NameDictionary, NameDictionaryShape>::New(
-      isolate, at_least_space_for, allocation, capacity_option);
+  Handle<NameDictionary> dict =
+      BaseNameDictionary<NameDictionary, NameDictionaryShape>::New(
+          isolate, at_least_space_for, allocation, capacity_option);
   dict->set_flags(kFlagsDefault);
   return dict;
 }
@@ -6168,7 +5490,7 @@ Handle<Derived> BaseNameDictionary<Derived, Shape>::Add(
 }
 
 template <typename Derived, typename Shape>
-template <typename IsolateT>
+template <typename IsolateT, AllocationType key_allocation>
 Handle<Derived> Dictionary<Derived, Shape>::Add(IsolateT* isolate,
                                                 Handle<Derived> dictionary,
                                                 Key key, Handle<Object> value,
@@ -6182,19 +5504,19 @@ Handle<Derived> Dictionary<Derived, Shape>::Add(IsolateT* isolate,
   dictionary = Derived::EnsureCapacity(isolate, dictionary);
 
   // Compute the key object.
-  Handle<Object> k = Shape::AsHandle(isolate, key);
+  Handle<Object> k = Shape::template AsHandle<key_allocation>(isolate, key);
 
   InternalIndex entry = dictionary->FindInsertionEntry(isolate, roots, hash);
   dictionary->SetEntry(entry, *k, *value, details);
-  DCHECK(dictionary->KeyAt(isolate, entry).IsNumber() ||
-         Shape::Unwrap(dictionary->KeyAt(isolate, entry)).IsUniqueName());
+  DCHECK(IsNumber(dictionary->KeyAt(isolate, entry)) ||
+         IsUniqueName(Shape::Unwrap(dictionary->KeyAt(isolate, entry))));
   dictionary->ElementAdded();
   if (entry_out) *entry_out = entry;
   return dictionary;
 }
 
 template <typename Derived, typename Shape>
-template <typename IsolateT>
+template <typename IsolateT, AllocationType key_allocation>
 void Dictionary<Derived, Shape>::UncheckedAdd(IsolateT* isolate,
                                               Handle<Derived> dictionary,
                                               Key key, Handle<Object> value,
@@ -6206,19 +5528,19 @@ void Dictionary<Derived, Shape>::UncheckedAdd(IsolateT* isolate,
   DCHECK(dictionary->HasSufficientCapacityToAdd(1));
 
   // Compute the key object.
-  Handle<Object> k = Shape::AsHandle(isolate, key);
+  Handle<Object> k = Shape::template AsHandle<key_allocation>(isolate, key);
 
   InternalIndex entry = dictionary->FindInsertionEntry(isolate, roots, hash);
   dictionary->SetEntry(entry, *k, *value, details);
-  DCHECK(dictionary->KeyAt(isolate, entry).IsNumber() ||
-         Shape::Unwrap(dictionary->KeyAt(isolate, entry)).IsUniqueName());
+  DCHECK(IsNumber(dictionary->KeyAt(isolate, entry)) ||
+         IsUniqueName(Shape::Unwrap(dictionary->KeyAt(isolate, entry))));
 }
 
 template <typename Derived, typename Shape>
 Handle<Derived> Dictionary<Derived, Shape>::ShallowCopy(
-    Isolate* isolate, Handle<Derived> dictionary) {
+    Isolate* isolate, Handle<Derived> dictionary, AllocationType allocation) {
   return Handle<Derived>::cast(isolate->factory()->CopyFixedArrayWithMap(
-      dictionary, Derived::GetMap(ReadOnlyRoots(isolate))));
+      dictionary, Derived::GetMap(ReadOnlyRoots(isolate)), allocation));
 }
 
 // static
@@ -6244,8 +5566,8 @@ void NumberDictionary::UpdateMaxNumberKey(uint32_t key,
     return;
   }
   // Update max key value.
-  Object max_index_object = get(kMaxNumberKeyIndex);
-  if (!max_index_object.IsSmi() || max_number_key() < key) {
+  Tagged<Object> max_index_object = get(kMaxNumberKeyIndex);
+  if (!IsSmi(max_index_object) || max_number_key() < key) {
     FixedArray::set(kMaxNumberKeyIndex,
                     Smi::FromInt(key << kRequiresSlowElementsTagSize));
   }
@@ -6271,18 +5593,18 @@ void NumberDictionary::UncheckedSet(Isolate* isolate,
   UncheckedAtPut(isolate, dictionary, key, value, PropertyDetails::Empty());
 }
 
-void NumberDictionary::CopyValuesTo(FixedArray elements) {
+void NumberDictionary::CopyValuesTo(Tagged<FixedArray> elements) {
   ReadOnlyRoots roots = GetReadOnlyRoots();
   int pos = 0;
   DisallowGarbageCollection no_gc;
-  WriteBarrierMode mode = elements.GetWriteBarrierMode(no_gc);
+  WriteBarrierMode mode = elements->GetWriteBarrierMode(no_gc);
   for (InternalIndex i : this->IterateEntries()) {
-    Object k;
+    Tagged<Object> k;
     if (this->ToKey(roots, i, &k)) {
-      elements.set(pos++, this->ValueAt(i), mode);
+      elements->set(pos++, this->ValueAt(i), mode);
     }
   }
-  DCHECK_EQ(pos, elements.length());
+  DCHECK_EQ(pos, elements->length());
 }
 
 template <typename Derived, typename Shape>
@@ -6290,9 +5612,9 @@ int Dictionary<Derived, Shape>::NumberOfEnumerableProperties() {
   ReadOnlyRoots roots = this->GetReadOnlyRoots();
   int result = 0;
   for (InternalIndex i : this->IterateEntries()) {
-    Object k;
+    Tagged<Object> k;
     if (!this->ToKey(roots, i, &k)) continue;
-    if (k.FilterKey(ENUMERABLE_STRINGS)) continue;
+    if (Object::FilterKey(k, ENUMERABLE_STRINGS)) continue;
     PropertyDetails details = this->DetailsAt(i);
     PropertyAttributes attr = details.attributes();
     if ((int{attr} & ONLY_ENUMERABLE) == 0) result++;
@@ -6309,10 +5631,10 @@ Handle<FixedArray> BaseNameDictionary<Derived, Shape>::IterationIndices(
   int array_size = 0;
   {
     DisallowGarbageCollection no_gc;
-    Derived raw_dictionary = *dictionary;
+    Tagged<Derived> raw_dictionary = *dictionary;
     for (InternalIndex i : dictionary->IterateEntries()) {
-      Object k;
-      if (!raw_dictionary.ToKey(roots, i, &k)) continue;
+      Tagged<Object> k;
+      if (!raw_dictionary->ToKey(roots, i, &k)) continue;
       array->set(array_size++, Smi::FromInt(i.as_int()));
     }
 
@@ -6335,13 +5657,14 @@ Handle<FixedArray> BaseNameDictionary<Derived, Shape>::IterationIndices(
 
 // Backwards lookup (slow).
 template <typename Derived, typename Shape>
-Object Dictionary<Derived, Shape>::SlowReverseLookup(Object value) {
+Tagged<Object> Dictionary<Derived, Shape>::SlowReverseLookup(
+    Tagged<Object> value) {
   Derived dictionary = Derived::cast(*this);
   ReadOnlyRoots roots = dictionary.GetReadOnlyRoots();
   for (InternalIndex i : dictionary.IterateEntries()) {
-    Object k;
+    Tagged<Object> k;
     if (!dictionary.ToKey(roots, i, &k)) continue;
-    Object e = dictionary.ValueAt(i);
+    Tagged<Object> e = dictionary.ValueAt(i);
     if (e == value) return k;
   }
   return roots.undefined_value();
@@ -6357,9 +5680,8 @@ void ObjectHashTableBase<Derived, Shape>::FillEntriesWithHoles(
 }
 
 template <typename Derived, typename Shape>
-Object ObjectHashTableBase<Derived, Shape>::Lookup(PtrComprCageBase cage_base,
-                                                   Handle<Object> key,
-                                                   int32_t hash) {
+Tagged<Object> ObjectHashTableBase<Derived, Shape>::Lookup(
+    PtrComprCageBase cage_base, Handle<Object> key, int32_t hash) {
   DisallowGarbageCollection no_gc;
   ReadOnlyRoots roots = this->GetReadOnlyRoots(cage_base);
   DCHECK(this->IsKey(roots, *key));
@@ -6382,7 +5704,7 @@ int NameToIndexHashTable::Lookup(Handle<Name> key) {
 }
 
 template <typename Derived, typename Shape>
-Object ObjectHashTableBase<Derived, Shape>::Lookup(Handle<Object> key) {
+Tagged<Object> ObjectHashTableBase<Derived, Shape>::Lookup(Handle<Object> key) {
   DisallowGarbageCollection no_gc;
 
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
@@ -6390,35 +5712,36 @@ Object ObjectHashTableBase<Derived, Shape>::Lookup(Handle<Object> key) {
   DCHECK(this->IsKey(roots, *key));
 
   // If the object does not have an identity hash, it was never used as a key.
-  Object hash = key->GetHash();
-  if (hash.IsUndefined(roots)) {
+  Tagged<Object> hash = Object::GetHash(*key);
+  if (IsUndefined(hash, roots)) {
     return roots.the_hole_value();
   }
   return Lookup(cage_base, key, Smi::ToInt(hash));
 }
 
 template <typename Derived, typename Shape>
-Object ObjectHashTableBase<Derived, Shape>::Lookup(Handle<Object> key,
-                                                   int32_t hash) {
+Tagged<Object> ObjectHashTableBase<Derived, Shape>::Lookup(Handle<Object> key,
+                                                           int32_t hash) {
   return Lookup(GetPtrComprCageBase(*this), key, hash);
 }
 
 template <typename Derived, typename Shape>
-Object ObjectHashTableBase<Derived, Shape>::ValueAt(InternalIndex entry) {
+Tagged<Object> ObjectHashTableBase<Derived, Shape>::ValueAt(
+    InternalIndex entry) {
   return this->get(EntryToValueIndex(entry));
 }
 
-Object RegisteredSymbolTable::ValueAt(InternalIndex entry) {
+Tagged<Object> RegisteredSymbolTable::ValueAt(InternalIndex entry) {
   return this->get(EntryToValueIndex(entry));
 }
 
-Object NameToIndexHashTable::ValueAt(InternalIndex entry) {
+Tagged<Object> NameToIndexHashTable::ValueAt(InternalIndex entry) {
   return this->get(EntryToValueIndex(entry));
 }
 
 int NameToIndexHashTable::IndexAt(InternalIndex entry) {
-  Object value = ValueAt(entry);
-  if (value.IsSmi()) {
+  Tagged<Object> value = ValueAt(entry);
+  if (IsSmi(value)) {
     int index = Smi::ToInt(value);
     DCHECK_LE(0, index);
     return index;
@@ -6432,10 +5755,10 @@ Handle<Derived> ObjectHashTableBase<Derived, Shape>::Put(Handle<Derived> table,
                                                          Handle<Object> value) {
   Isolate* isolate = Heap::FromWritableHeapObject(*table)->isolate();
   DCHECK(table->IsKey(ReadOnlyRoots(isolate), *key));
-  DCHECK(!value->IsTheHole(ReadOnlyRoots(isolate)));
+  DCHECK(!IsTheHole(*value, ReadOnlyRoots(isolate)));
 
   // Make sure the key object has an identity hash code.
-  int32_t hash = key->GetOrCreateHash(isolate).value();
+  int32_t hash = Object::GetOrCreateHash(*key, isolate).value();
 
   return ObjectHashTableBase<Derived, Shape>::Put(isolate, table, key, value,
                                                   hash);
@@ -6458,7 +5781,7 @@ void RehashObjectHashTableAndGCIfNeeded(Isolate* isolate, Handle<T> table) {
     if (capacity > T::kMaxCapacity) {
       for (size_t i = 0; i < 2; ++i) {
         isolate->heap()->CollectAllGarbage(
-            Heap::kNoGCFlags, GarbageCollectionReason::kFullHashtable);
+            GCFlag::kNoFlags, GarbageCollectionReason::kFullHashtable);
       }
       table->Rehash(isolate);
     }
@@ -6475,7 +5798,7 @@ Handle<Derived> ObjectHashTableBase<Derived, Shape>::Put(Isolate* isolate,
                                                          int32_t hash) {
   ReadOnlyRoots roots(isolate);
   DCHECK(table->IsKey(roots, *key));
-  DCHECK(!value->IsTheHole(roots));
+  DCHECK(!IsTheHole(*value, roots));
 
   InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
 
@@ -6499,8 +5822,8 @@ Handle<Derived> ObjectHashTableBase<Derived, Shape>::Remove(
     bool* was_present) {
   DCHECK(table->IsKey(table->GetReadOnlyRoots(), *key));
 
-  Object hash = key->GetHash();
-  if (hash.IsUndefined()) {
+  Tagged<Object> hash = Object::GetHash(*key);
+  if (IsUndefined(hash)) {
     *was_present = false;
     return table;
   }
@@ -6528,7 +5851,8 @@ Handle<Derived> ObjectHashTableBase<Derived, Shape>::Remove(
 
 template <typename Derived, typename Shape>
 void ObjectHashTableBase<Derived, Shape>::AddEntry(InternalIndex entry,
-                                                   Object key, Object value) {
+                                                   Tagged<Object> key,
+                                                   Tagged<Object> value) {
   Derived* self = static_cast<Derived*>(this);
   self->set_key(Derived::EntryToIndex(entry), key);
   self->set(Derived::EntryToValueIndex(entry), value);
@@ -6556,8 +5880,8 @@ std::array<Object, N> ObjectMultiHashTableBase<Derived, N>::Lookup(
   ReadOnlyRoots roots = this->GetReadOnlyRoots(cage_base);
   DCHECK(this->IsKey(roots, *key));
 
-  Object hash_obj = key->GetHash();
-  if (hash_obj.IsUndefined(roots)) {
+  Tagged<Object> hash_obj = Object::GetHash(*key);
+  if (IsUndefined(hash_obj, roots)) {
     return {roots.the_hole_value(), roots.the_hole_value()};
   }
   int32_t hash = Smi::ToInt(hash_obj);
@@ -6572,7 +5896,7 @@ std::array<Object, N> ObjectMultiHashTableBase<Derived, N>::Lookup(
   std::array<Object, N> values;
   for (int i = 0; i < N; i++) {
     values[i] = this->get(start_index + i);
-    DCHECK(!values[i].IsTheHole());
+    DCHECK(!IsTheHole(values[i]));
   }
   return values;
 }
@@ -6585,7 +5909,7 @@ Handle<Derived> ObjectMultiHashTableBase<Derived, N>::Put(
   ReadOnlyRoots roots(isolate);
   DCHECK(table->IsKey(roots, *key));
 
-  int32_t hash = key->GetOrCreateHash(isolate).value();
+  int32_t hash = Object::GetOrCreateHash(*key, isolate).value();
   InternalIndex entry = table->FindEntry(isolate, roots, key, hash);
 
   // Overwrite values if entry is found.
@@ -6616,7 +5940,7 @@ void ObjectMultiHashTableBase<Derived, N>::SetEntryValues(
 Handle<ObjectHashSet> ObjectHashSet::Add(Isolate* isolate,
                                          Handle<ObjectHashSet> set,
                                          Handle<Object> key) {
-  int32_t hash = key->GetOrCreateHash(isolate).value();
+  int32_t hash = Object::GetOrCreateHash(*key, isolate).value();
   if (!set->Has(isolate, key, hash)) {
     set = EnsureCapacity(isolate, set);
     InternalIndex entry = set->FindInsertionEntry(isolate, hash);
@@ -6671,7 +5995,7 @@ void JSWeakCollection::Initialize(Handle<JSWeakCollection> weak_collection,
 void JSWeakCollection::Set(Handle<JSWeakCollection> weak_collection,
                            Handle<Object> key, Handle<Object> value,
                            int32_t hash) {
-  DCHECK(key->IsJSReceiver() || key->IsSymbol());
+  DCHECK(IsJSReceiver(*key) || IsSymbol(*key));
   Handle<EphemeronHashTable> table(
       EphemeronHashTable::cast(weak_collection->table()),
       weak_collection->GetIsolate());
@@ -6687,7 +6011,7 @@ void JSWeakCollection::Set(Handle<JSWeakCollection> weak_collection,
 
 bool JSWeakCollection::Delete(Handle<JSWeakCollection> weak_collection,
                               Handle<Object> key, int32_t hash) {
-  DCHECK(key->IsJSReceiver() || key->IsSymbol());
+  DCHECK(IsJSReceiver(*key) || IsSymbol(*key));
   Handle<EphemeronHashTable> table(
       EphemeronHashTable::cast(weak_collection->table()),
       weak_collection->GetIsolate());
@@ -6711,7 +6035,7 @@ Handle<JSArray> JSWeakCollection::GetEntries(Handle<JSWeakCollection> holder,
   if (max_entries == 0 || max_entries > table->NumberOfElements()) {
     max_entries = table->NumberOfElements();
   }
-  int values_per_entry = holder->IsJSWeakMap() ? 2 : 1;
+  int values_per_entry = IsJSWeakMap(*holder) ? 2 : 1;
   Handle<FixedArray> entries =
       isolate->factory()->NewFixedArray(max_entries * values_per_entry);
   // Recompute max_values because GC could have removed elements from the table.
@@ -6725,11 +6049,11 @@ Handle<JSArray> JSWeakCollection::GetEntries(Handle<JSWeakCollection> holder,
     int count = 0;
     for (int i = 0;
          count / values_per_entry < max_entries && i < table->Capacity(); i++) {
-      Object key;
+      Tagged<Object> key;
       if (table->ToKey(roots, InternalIndex(i), &key)) {
         entries->set(count++, key);
         if (values_per_entry > 1) {
-          Object value = table->Lookup(handle(key, isolate));
+          Tagged<Object> value = table->Lookup(handle(key, isolate));
           entries->set(count++, value);
         }
       }
@@ -6740,10 +6064,10 @@ Handle<JSArray> JSWeakCollection::GetEntries(Handle<JSWeakCollection> holder,
 }
 
 void PropertyCell::ClearAndInvalidate(ReadOnlyRoots roots) {
-  DCHECK(!value().IsTheHole(roots));
+  DCHECK(!IsTheHole(value(), roots));
   PropertyDetails details = property_details();
   details = details.set_cell_type(PropertyCellType::kConstant);
-  Transition(details, roots.the_hole_value_handle());
+  Transition(details, roots.property_cell_hole_value_handle());
   // TODO(11527): pass Isolate as an argument.
   Isolate* isolate = GetIsolateFromWritableObject(*this);
   DependentCode::DeoptimizeDependencyGroups(
@@ -6757,7 +6081,7 @@ Handle<PropertyCell> PropertyCell::InvalidateAndReplaceEntry(
   Handle<PropertyCell> cell(dictionary->CellAt(entry), isolate);
   Handle<Name> name(cell->name(), isolate);
   DCHECK(cell->property_details().IsConfigurable());
-  DCHECK(!cell->value().IsTheHole(isolate));
+  DCHECK(!IsAnyHole(cell->value(), isolate));
 
   // Swap with a new property cell.
   Handle<PropertyCell> new_cell =
@@ -6768,36 +6092,39 @@ Handle<PropertyCell> PropertyCell::InvalidateAndReplaceEntry(
   return new_cell;
 }
 
-static bool RemainsConstantType(PropertyCell cell, Object value) {
+static bool RemainsConstantType(Tagged<PropertyCell> cell,
+                                Tagged<Object> value) {
   DisallowGarbageCollection no_gc;
   // TODO(dcarney): double->smi and smi->double transition from kConstant
-  if (cell.value().IsSmi() && value.IsSmi()) {
+  if (IsSmi(cell->value()) && IsSmi(value)) {
     return true;
-  } else if (cell.value().IsHeapObject() && value.IsHeapObject()) {
-    Map map = HeapObject::cast(value).map();
-    return HeapObject::cast(cell.value()).map() == map && map.is_stable();
+  } else if (IsHeapObject(cell->value()) && IsHeapObject(value)) {
+    Tagged<Map> map = HeapObject::cast(value)->map();
+    return HeapObject::cast(cell->value())->map() == map && map->is_stable();
   }
   return false;
 }
 
 // static
-PropertyCellType PropertyCell::InitialType(Isolate* isolate, Object value) {
-  return value.IsUndefined(isolate) ? PropertyCellType::kUndefined
-                                    : PropertyCellType::kConstant;
+PropertyCellType PropertyCell::InitialType(Isolate* isolate,
+                                           Tagged<Object> value) {
+  return IsUndefined(value, isolate) ? PropertyCellType::kUndefined
+                                     : PropertyCellType::kConstant;
 }
 
 // static
-PropertyCellType PropertyCell::UpdatedType(Isolate* isolate, PropertyCell cell,
-                                           Object value,
+PropertyCellType PropertyCell::UpdatedType(Isolate* isolate,
+                                           Tagged<PropertyCell> cell,
+                                           Tagged<Object> value,
                                            PropertyDetails details) {
   DisallowGarbageCollection no_gc;
-  DCHECK(!value.IsTheHole(isolate));
-  DCHECK(!cell.value().IsTheHole(isolate));
+  DCHECK(!IsAnyHole(value, isolate));
+  DCHECK(!IsAnyHole(cell->value(), isolate));
   switch (details.cell_type()) {
     case PropertyCellType::kUndefined:
       return PropertyCellType::kConstant;
     case PropertyCellType::kConstant:
-      if (value == cell.value()) return PropertyCellType::kConstant;
+      if (value == cell->value()) return PropertyCellType::kConstant;
       V8_FALLTHROUGH;
     case PropertyCellType::kConstantType:
       if (RemainsConstantType(cell, value)) {
@@ -6814,10 +6141,10 @@ PropertyCellType PropertyCell::UpdatedType(Isolate* isolate, PropertyCell cell,
 Handle<PropertyCell> PropertyCell::PrepareForAndSetValue(
     Isolate* isolate, Handle<GlobalDictionary> dictionary, InternalIndex entry,
     Handle<Object> value, PropertyDetails details) {
-  DCHECK(!value->IsTheHole(isolate));
-  PropertyCell raw_cell = dictionary->CellAt(entry);
-  CHECK(!raw_cell.value().IsTheHole(isolate));
-  const PropertyDetails original_details = raw_cell.property_details();
+  DCHECK(!IsAnyHole(*value, isolate));
+  Tagged<PropertyCell> raw_cell = dictionary->CellAt(entry);
+  CHECK(!IsAnyHole(raw_cell->value(), isolate));
+  const PropertyDetails original_details = raw_cell->property_details();
   // Data accesses could be cached in ics or optimized code.
   bool invalidate = original_details.kind() == PropertyKind::kData &&
                     details.kind() == PropertyKind::kAccessor;
@@ -6864,24 +6191,24 @@ void PropertyCell::InvalidateProtector() {
 
 // static
 bool PropertyCell::CheckDataIsCompatible(PropertyDetails details,
-                                         Object value) {
+                                         Tagged<Object> value) {
   DisallowGarbageCollection no_gc;
   PropertyCellType cell_type = details.cell_type();
   CHECK_NE(cell_type, PropertyCellType::kInTransition);
-  if (value.IsTheHole()) {
+  if (IsPropertyCellHole(value)) {
     CHECK_EQ(cell_type, PropertyCellType::kConstant);
   } else {
-    CHECK_EQ(value.IsAccessorInfo() || value.IsAccessorPair(),
+    CHECK_EQ(IsAccessorInfo(value) || IsAccessorPair(value),
              details.kind() == PropertyKind::kAccessor);
     DCHECK_IMPLIES(cell_type == PropertyCellType::kUndefined,
-                   value.IsUndefined());
+                   IsUndefined(value));
   }
   return true;
 }
 
 #ifdef DEBUG
 bool PropertyCell::CanTransitionTo(PropertyDetails new_details,
-                                   Object new_value) const {
+                                   Tagged<Object> new_value) const {
   // Extending the implementation of PropertyCells with additional states
   // and/or transitions likely requires changes to PropertyCellData::Serialize.
   DisallowGarbageCollection no_gc;
@@ -6890,17 +6217,17 @@ bool PropertyCell::CanTransitionTo(PropertyDetails new_details,
     case PropertyCellType::kUndefined:
       return new_details.cell_type() != PropertyCellType::kUndefined;
     case PropertyCellType::kConstant:
-      return !value().IsTheHole() &&
+      return !IsPropertyCellHole(value()) &&
              new_details.cell_type() != PropertyCellType::kUndefined;
     case PropertyCellType::kConstantType:
       return new_details.cell_type() == PropertyCellType::kConstantType ||
              new_details.cell_type() == PropertyCellType::kMutable ||
              (new_details.cell_type() == PropertyCellType::kConstant &&
-              new_value.IsTheHole());
+              IsPropertyCellHole(new_value));
     case PropertyCellType::kMutable:
       return new_details.cell_type() == PropertyCellType::kMutable ||
              (new_details.cell_type() == PropertyCellType::kConstant &&
-              new_value.IsTheHole());
+              IsPropertyCellHole(new_value));
     case PropertyCellType::kInTransition:
       UNREACHABLE();
   }
@@ -6908,7 +6235,7 @@ bool PropertyCell::CanTransitionTo(PropertyDetails new_details,
 #endif  // DEBUG
 
 int JSGeneratorObject::code_offset() const {
-  DCHECK(input_or_debug_pos().IsSmi());
+  DCHECK(IsSmi(input_or_debug_pos()));
   int code_offset = Smi::ToInt(input_or_debug_pos());
 
   // The stored bytecode offset is relative to a different base than what
@@ -6919,41 +6246,44 @@ int JSGeneratorObject::code_offset() const {
 
 int JSGeneratorObject::source_position() const {
   CHECK(is_suspended());
-  DCHECK(function().shared().HasBytecodeArray());
+  DCHECK(function()->shared()->HasBytecodeArray());
   Isolate* isolate = GetIsolate();
-  DCHECK(
-      function().shared().GetBytecodeArray(isolate).HasSourcePositionTable());
-  AbstractCode code =
-      AbstractCode::cast(function().shared().GetBytecodeArray(isolate));
-  return code.SourcePosition(isolate, code_offset());
+  DCHECK(function()
+             ->shared()
+             ->GetBytecodeArray(isolate)
+             ->HasSourcePositionTable());
+  Tagged<AbstractCode> code =
+      AbstractCode::cast(function()->shared()->GetBytecodeArray(isolate));
+  return code->SourcePosition(isolate, code_offset());
 }
 
 // static
-AccessCheckInfo AccessCheckInfo::Get(Isolate* isolate,
-                                     Handle<JSObject> receiver) {
+Tagged<AccessCheckInfo> AccessCheckInfo::Get(Isolate* isolate,
+                                             Handle<JSObject> receiver) {
   DisallowGarbageCollection no_gc;
-  DCHECK(receiver->map().is_access_check_needed());
-  Object maybe_constructor = receiver->map().GetConstructor();
-  if (maybe_constructor.IsFunctionTemplateInfo()) {
-    Object data_obj =
-        FunctionTemplateInfo::cast(maybe_constructor).GetAccessCheckInfo();
-    if (data_obj.IsUndefined(isolate)) return AccessCheckInfo();
+  DCHECK(receiver->map()->is_access_check_needed());
+  Tagged<Object> maybe_constructor = receiver->map()->GetConstructor();
+  if (IsFunctionTemplateInfo(maybe_constructor)) {
+    Tagged<Object> data_obj =
+        FunctionTemplateInfo::cast(maybe_constructor)->GetAccessCheckInfo();
+    if (IsUndefined(data_obj, isolate)) return AccessCheckInfo();
     return AccessCheckInfo::cast(data_obj);
   }
   // Might happen for a detached context.
-  if (!maybe_constructor.IsJSFunction()) return AccessCheckInfo();
-  JSFunction constructor = JSFunction::cast(maybe_constructor);
+  if (!IsJSFunction(maybe_constructor)) return AccessCheckInfo();
+  Tagged<JSFunction> constructor = JSFunction::cast(maybe_constructor);
   // Might happen for the debug context.
-  if (!constructor.shared().IsApiFunction()) return AccessCheckInfo();
+  if (!constructor->shared()->IsApiFunction()) return AccessCheckInfo();
 
-  Object data_obj =
-      constructor.shared().get_api_func_data().GetAccessCheckInfo();
-  if (data_obj.IsUndefined(isolate)) return AccessCheckInfo();
+  Tagged<Object> data_obj =
+      constructor->shared()->api_func_data()->GetAccessCheckInfo();
+  if (IsUndefined(data_obj, isolate)) return AccessCheckInfo();
 
   return AccessCheckInfo::cast(data_obj);
 }
 
-Address Smi::LexicographicCompare(Isolate* isolate, Smi x, Smi y) {
+Address Smi::LexicographicCompare(Isolate* isolate, Tagged<Smi> x,
+                                  Tagged<Smi> y) {
   DisallowGarbageCollection no_gc;
   DisallowJavascriptExecution no_js(isolate);
 
@@ -7038,52 +6368,64 @@ void JSFinalizationRegistry::RemoveCellFromUnregisterTokenMap(
     Isolate* isolate, Address raw_finalization_registry,
     Address raw_weak_cell) {
   DisallowGarbageCollection no_gc;
-  JSFinalizationRegistry finalization_registry =
+  Tagged<JSFinalizationRegistry> finalization_registry =
       JSFinalizationRegistry::cast(Object(raw_finalization_registry));
-  WeakCell weak_cell = WeakCell::cast(Object(raw_weak_cell));
-  DCHECK(!weak_cell.unregister_token().IsUndefined(isolate));
-  HeapObject undefined = ReadOnlyRoots(isolate).undefined_value();
+  Tagged<WeakCell> weak_cell = WeakCell::cast(Object(raw_weak_cell));
+  DCHECK(!IsUndefined(weak_cell->unregister_token(), isolate));
+  Tagged<HeapObject> undefined = ReadOnlyRoots(isolate).undefined_value();
 
   // Remove weak_cell from the linked list of other WeakCells with the same
   // unregister token and remove its unregister token from key_map if necessary
   // without shrinking it. Since shrinking may allocate, it is performed by the
   // caller after looping, or on exception.
-  if (weak_cell.key_list_prev().IsUndefined(isolate)) {
-    SimpleNumberDictionary key_map =
-        SimpleNumberDictionary::cast(finalization_registry.key_map());
-    HeapObject unregister_token = weak_cell.unregister_token();
-    uint32_t key = Smi::ToInt(unregister_token.GetHash());
-    InternalIndex entry = key_map.FindEntry(isolate, key);
+  if (IsUndefined(weak_cell->key_list_prev(), isolate)) {
+    Tagged<SimpleNumberDictionary> key_map =
+        SimpleNumberDictionary::cast(finalization_registry->key_map());
+    Tagged<HeapObject> unregister_token = weak_cell->unregister_token();
+    uint32_t key = Smi::ToInt(Object::GetHash(unregister_token));
+    InternalIndex entry = key_map->FindEntry(isolate, key);
     DCHECK(entry.is_found());
 
-    if (weak_cell.key_list_next().IsUndefined(isolate)) {
+    if (IsUndefined(weak_cell->key_list_next(), isolate)) {
       // weak_cell is the only one associated with its key; remove the key
       // from the hash table.
-      key_map.ClearEntry(entry);
-      key_map.ElementRemoved();
+      key_map->ClearEntry(entry);
+      key_map->ElementRemoved();
     } else {
       // weak_cell is the list head for its key; we need to change the value
       // of the key in the hash table.
-      WeakCell next = WeakCell::cast(weak_cell.key_list_next());
-      DCHECK_EQ(next.key_list_prev(), weak_cell);
-      next.set_key_list_prev(undefined);
-      key_map.ValueAtPut(entry, next);
+      Tagged<WeakCell> next = WeakCell::cast(weak_cell->key_list_next());
+      DCHECK_EQ(next->key_list_prev(), weak_cell);
+      next->set_key_list_prev(undefined);
+      key_map->ValueAtPut(entry, next);
     }
   } else {
     // weak_cell is somewhere in the middle of its key list.
-    WeakCell prev = WeakCell::cast(weak_cell.key_list_prev());
-    prev.set_key_list_next(weak_cell.key_list_next());
-    if (!weak_cell.key_list_next().IsUndefined()) {
-      WeakCell next = WeakCell::cast(weak_cell.key_list_next());
-      next.set_key_list_prev(weak_cell.key_list_prev());
+    Tagged<WeakCell> prev = WeakCell::cast(weak_cell->key_list_prev());
+    prev->set_key_list_next(weak_cell->key_list_next());
+    if (!IsUndefined(weak_cell->key_list_next())) {
+      Tagged<WeakCell> next = WeakCell::cast(weak_cell->key_list_next());
+      next->set_key_list_prev(weak_cell->key_list_prev());
     }
   }
 
   // weak_cell is now removed from the unregister token map, so clear its
   // unregister token-related fields.
-  weak_cell.set_unregister_token(undefined);
-  weak_cell.set_key_list_prev(undefined);
-  weak_cell.set_key_list_next(undefined);
+  weak_cell->set_unregister_token(undefined);
+  weak_cell->set_key_list_prev(undefined);
+  weak_cell->set_key_list_next(undefined);
+}
+
+// static
+bool MapWord::IsMapOrForwarded(Tagged<Map> map) {
+  MapWord map_word = map->map_word(kRelaxedLoad);
+
+  if (map_word.IsForwardingAddress()) {
+    // During GC we can't access forwarded maps without synchronization.
+    return true;
+  } else {
+    return IsMap(map_word.ToMap());
+  }
 }
 
 // Force instantiation of template instances class.
@@ -7165,6 +6507,12 @@ EXTERN_DEFINE_MULTI_OBJECT_BASE_HASH_TABLE(ObjectTwoHashTable, 2)
 EXTERN_DEFINE_DICTIONARY(SimpleNumberDictionary, SimpleNumberDictionaryShape)
 EXTERN_DEFINE_DICTIONARY(NumberDictionary, NumberDictionaryShape)
 
+template V8_EXPORT_PRIVATE void
+Dictionary<NumberDictionary, NumberDictionaryShape>::UncheckedAdd<
+    Isolate, AllocationType::kSharedOld>(Isolate*, Handle<NumberDictionary>,
+                                         uint32_t, Handle<Object>,
+                                         PropertyDetails);
+
 EXTERN_DEFINE_BASE_NAME_DICTIONARY(NameDictionary, NameDictionaryShape)
 template V8_EXPORT_PRIVATE Handle<NameDictionary> NameDictionary::New(
     Isolate*, int, AllocationType, MinimumCapacity);
diff --git a/deps/v8/src/objects/objects.h b/deps/v8/src/objects/objects.h
index eb0b3d61ddc74f..31f7766930a23e 100644
--- a/deps/v8/src/objects/objects.h
+++ b/deps/v8/src/objects/objects.h
@@ -28,6 +28,7 @@
 #include "src/objects/objects-definitions.h"
 #include "src/objects/property-details.h"
 #include "src/objects/tagged-impl.h"
+#include "src/objects/tagged.h"
 #include "src/utils/utils.h"
 
 // Has to be the last include (doesn't have include guards):
@@ -151,6 +152,11 @@
 //               - ExternalTwoByteInternalizedString
 //         - Symbol
 //       - Oddball
+//         - Null
+//         - Undefined
+//         - Boolean
+//           - True
+//           - False
 //     - Context
 //       - NativeContext
 //     - Cell
@@ -302,80 +308,40 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
   constexpr Object() : TaggedImpl(kNullAddress) {}
   explicit constexpr Object(Address ptr) : TaggedImpl(ptr) {}
 
-  V8_INLINE bool IsTaggedIndex() const;
-
   // Whether the object is in the RO heap and the RO heap is shared, or in the
   // writable shared heap.
-  V8_INLINE bool InSharedHeap() const;
-
-  V8_INLINE bool InWritableSharedSpace() const;
-
-#define IS_TYPE_FUNCTION_DECL(Type) \
-  V8_INLINE bool Is##Type() const;  \
-  V8_INLINE bool Is##Type(PtrComprCageBase cage_base) const;
-  OBJECT_TYPE_LIST(IS_TYPE_FUNCTION_DECL)
-  HEAP_OBJECT_TYPE_LIST(IS_TYPE_FUNCTION_DECL)
-  IS_TYPE_FUNCTION_DECL(HashTableBase)
-  IS_TYPE_FUNCTION_DECL(SmallOrderedHashTable)
-#undef IS_TYPE_FUNCTION_DECL
-  V8_INLINE bool IsNumber(ReadOnlyRoots roots) const;
-
-// Oddball checks are faster when they are raw pointer comparisons, so the
-// isolate/read-only roots overloads should be preferred where possible.
-#define IS_TYPE_FUNCTION_DECL(Type, Value, _)           \
-  V8_INLINE bool Is##Type(Isolate* isolate) const;      \
-  V8_INLINE bool Is##Type(LocalIsolate* isolate) const; \
-  V8_INLINE bool Is##Type(ReadOnlyRoots roots) const;   \
-  V8_INLINE bool Is##Type() const;
-  ODDBALL_LIST(IS_TYPE_FUNCTION_DECL)
-  IS_TYPE_FUNCTION_DECL(NullOrUndefined, , /* unused */)
-#undef IS_TYPE_FUNCTION_DECL
-
-  V8_INLINE bool IsZero() const;
-  V8_INLINE bool IsNoSharedNameSentinel() const;
-  V8_INLINE bool IsPrivateSymbol() const;
-  V8_INLINE bool IsPublicSymbol() const;
-
-#if !V8_ENABLE_WEBASSEMBLY
-  // Dummy implementation on builds without WebAssembly.
-  bool IsWasmObject(Isolate* = nullptr) const { return false; }
-#endif
+  static V8_INLINE bool InSharedHeap(Tagged<Object> obj);
 
-  V8_INLINE bool IsJSObjectThatCanBeTrackedAsPrototype() const;
+  static V8_INLINE bool InWritableSharedSpace(Tagged<Object> obj);
 
   enum class Conversion { kToNumber, kToNumeric };
 
-#define DECL_STRUCT_PREDICATE(NAME, Name, name) \
-  V8_INLINE bool Is##Name() const;              \
-  V8_INLINE bool Is##Name(PtrComprCageBase cage_base) const;
-  STRUCT_LIST(DECL_STRUCT_PREDICATE)
-#undef DECL_STRUCT_PREDICATE
-
   // ES6, #sec-isarray.  NOT to be confused with %_IsArray.
   V8_INLINE
   V8_WARN_UNUSED_RESULT static Maybe<bool> IsArray(Handle<Object> object);
 
   // Extract the number.
-  inline double Number() const;
-  V8_INLINE bool IsNaN() const;
-  V8_INLINE bool IsMinusZero() const;
-  V8_EXPORT_PRIVATE bool ToInt32(int32_t* value);
-  inline bool ToUint32(uint32_t* value) const;
+  static inline double Number(Tagged<Object> obj);
+  V8_EXPORT_PRIVATE static bool ToInt32(Tagged<Object> obj, int32_t* value);
+  static inline bool ToUint32(Tagged<Object> obj, uint32_t* value);
 
-  inline Representation OptimalRepresentation(PtrComprCageBase cage_base) const;
+  static inline Representation OptimalRepresentation(
+      Tagged<Object> obj, PtrComprCageBase cage_base);
 
-  inline ElementsKind OptimalElementsKind(PtrComprCageBase cage_base) const;
+  static inline ElementsKind OptimalElementsKind(Tagged<Object> obj,
+                                                 PtrComprCageBase cage_base);
 
   // If {allow_coercion} is true, then a Smi will be considered to fit
   // a Double representation, since it can be converted to a HeapNumber
   // and stored.
-  inline bool FitsRepresentation(Representation representation,
-                                 bool allow_coercion = true) const;
+  static inline bool FitsRepresentation(Tagged<Object> obj,
+                                        Representation representation,
+                                        bool allow_coercion = true);
 
-  inline bool FilterKey(PropertyFilter filter);
+  static inline bool FilterKey(Tagged<Object> obj, PropertyFilter filter);
 
-  Handle<FieldType> OptimalType(Isolate* isolate,
-                                Representation representation);
+  static Handle<FieldType> OptimalType(Tagged<Object> obj, Isolate* isolate,
+                                       Representation representation);
 
   V8_EXPORT_PRIVATE static Handle<Object> NewStorageFor(
       Isolate* isolate, Handle<Object> object, Representation representation);
@@ -387,12 +353,13 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
 
   // Returns true if the object is of the correct type to be used as a
   // implementation of a JSObject's elements.
-  inline bool HasValidElements();
+  static inline bool HasValidElements(Tagged<Object> obj);
 
   // ECMA-262 9.2.
   template <typename IsolateT>
-  V8_EXPORT_PRIVATE bool BooleanValue(IsolateT* isolate);
-  Object ToBoolean(Isolate* isolate);
+  V8_EXPORT_PRIVATE static bool BooleanValue(Tagged<Object> obj,
+                                             IsolateT* isolate);
+  static Tagged<Object> ToBoolean(Tagged<Object> obj, Isolate* isolate);
 
   // ES6 section 7.2.11 Abstract Relational Comparison
   V8_EXPORT_PRIVATE V8_WARN_UNUSED_RESULT static Maybe<ComparisonResult>
@@ -403,7 +370,8 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
       Isolate* isolate, Handle<Object> x, Handle<Object> y);
 
   // ES6 section 7.2.13 Strict Equality Comparison
-  V8_EXPORT_PRIVATE bool StrictEquals(Object that);
+  V8_EXPORT_PRIVATE static bool StrictEquals(Tagged<Object> obj,
+                                             Tagged<Object> that);
 
   // ES6 section 7.1.13 ToObject
   // Convert to a JSObject if needed.
@@ -475,7 +443,7 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
 
   // ES6 section 7.3.9 GetMethod
   V8_WARN_UNUSED_RESULT static MaybeHandle<Object> GetMethod(
-      Handle<JSReceiver> receiver, Handle<Name> name);
+      Isolate* isolate, Handle<JSReceiver> receiver, Handle<Name> name);
 
   // ES6 section 7.3.17 CreateListFromArrayLike
   V8_WARN_UNUSED_RESULT static MaybeHandle<FixedArray> CreateListFromArrayLike(
@@ -592,17 +560,19 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
 
   // Returns the permanent hash code associated with this object. May return
   // undefined if not yet created.
-  inline Object GetHash();
+  static inline Tagged<Object> GetHash(Tagged<Object> obj);
 
   // Returns the permanent hash code associated with this object depending on
   // the actual object type. May create and store a hash code if needed and none
   // exists.
-  V8_EXPORT_PRIVATE Smi GetOrCreateHash(Isolate* isolate);
+  V8_EXPORT_PRIVATE static Tagged<Smi> GetOrCreateHash(Tagged<Object> obj,
+                                                       Isolate* isolate);
 
   // Checks whether this object has the same value as the given one.  This
   // function is implemented according to ES5, section 9.12 and can be used
   // to implement the Object.is function.
-  V8_EXPORT_PRIVATE bool SameValue(Object other);
+  V8_EXPORT_PRIVATE static bool SameValue(Tagged<Object> obj,
+                                          Tagged<Object> other);
 
   // A part of SameValue which handles Number vs. Number case.
   // Treats NaN == NaN and +0 != -0.
@@ -612,7 +582,7 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
   // +0 and -0 are treated equal. Everything else is the same as SameValue.
   // This function is implemented according to ES6, section 7.2.4 and is used
   // by ES6 Map and Set.
-  bool SameValueZero(Object other);
+  static bool SameValueZero(Tagged<Object> obj, Tagged<Object> other);
 
   // ES6 section 9.4.2.3 ArraySpeciesCreate (part of it)
   V8_WARN_UNUSED_RESULT static MaybeHandle<Object> ArraySpeciesConstructor(
@@ -625,70 +595,53 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
 
   // Tries to convert an object to an array length. Returns true and sets the
   // output parameter if it succeeds.
-  inline bool ToArrayLength(uint32_t* index) const;
+  static inline bool ToArrayLength(Tagged<Object> obj, uint32_t* index);
 
   // Tries to convert an object to an array index. Returns true and sets the
   // output parameter if it succeeds. Equivalent to ToArrayLength, but does not
   // allow kMaxUInt32.
-  V8_WARN_UNUSED_RESULT inline bool ToArrayIndex(uint32_t* index) const;
+  static V8_WARN_UNUSED_RESULT inline bool ToArrayIndex(Tagged<Object> obj,
+                                                        uint32_t* index);
 
   // Tries to convert an object to an index (in the range 0..size_t::max).
   // Returns true and sets the output parameter if it succeeds.
-  inline bool ToIntegerIndex(size_t* index) const;
+  static inline bool ToIntegerIndex(Tagged<Object> obj, size_t* index);
 
   // Returns true if the result of iterating over the object is the same
   // (including observable effects) as simply accessing the properties between 0
   // and length.
-  V8_EXPORT_PRIVATE bool IterationHasObservableEffects();
+  V8_EXPORT_PRIVATE static bool IterationHasObservableEffects(
+      Tagged<Object> obj);
 
   // TC39 "Dynamic Code Brand Checks"
-  bool IsCodeLike(Isolate* isolate) const;
+  static bool IsCodeLike(Tagged<Object> obj, Isolate* isolate);
 
-  EXPORT_DECL_VERIFIER(Object)
+  EXPORT_DECL_STATIC_VERIFIER(Object)
 
 #ifdef VERIFY_HEAP
   // Verify a pointer is a valid (non-InstructionStream) object pointer.
-  // When V8_EXTERNAL_CODE_SPACE is enabled InstructionStream objects are not
-  // allowed.
-  static void VerifyPointer(Isolate* isolate, Object p);
+  // When V8_EXTERNAL_CODE_SPACE is enabled InstructionStream objects are
+  // not allowed.
+  static void VerifyPointer(Isolate* isolate, Tagged<Object> p);
   // Verify a pointer is a valid object pointer.
   // InstructionStream objects are allowed regardless of the
   // V8_EXTERNAL_CODE_SPACE mode.
-  static void VerifyAnyTagged(Isolate* isolate, Object p);
+  static void VerifyAnyTagged(Isolate* isolate, Tagged<Object> p);
 #endif
 
-#ifdef DEBUG
-  inline bool IsApiCallResultType() const;
-#endif  // DEBUG
-
-  // Prints this object without details.
-  V8_EXPORT_PRIVATE void ShortPrint(FILE* out = stdout) const;
-
-  // Prints this object without details to a message accumulator.
-  V8_EXPORT_PRIVATE void ShortPrint(StringStream* accumulator) const;
-
-  V8_EXPORT_PRIVATE void ShortPrint(std::ostream& os) const;
-
-  inline static Object cast(Object object) { return object; }
-  inline static Object unchecked_cast(Object object) { return object; }
+  inline static constexpr Tagged<Object> cast(Tagged<Object> object) {
+    return object;
+  }
+  inline static constexpr Tagged<Object> unchecked_cast(Tagged<Object> object) {
+    return object;
+  }
 
   // Layout description.
   static const int kHeaderSize = 0;  // Object does not take up any space.
 
-#ifdef OBJECT_PRINT
-  // For our gdb macros, we should perhaps change these in the future.
-  V8_EXPORT_PRIVATE void Print() const;
-
-  // Prints this object with details.
-  V8_EXPORT_PRIVATE void Print(std::ostream& os) const;
-#else
-  void Print() const { ShortPrint(); }
-  void Print(std::ostream& os) const { ShortPrint(os); }
-#endif
-
   // For use with std::unordered_set.
   struct Hasher {
-    size_t operator()(const Object o) const {
+    size_t operator()(const Tagged<Object> o) const {
       return std::hash<v8::internal::Address>{}(static_cast<Tagged_t>(o.ptr()));
     }
   };
@@ -696,78 +649,18 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
   // For use with std::unordered_set/unordered_map when using both
   // InstructionStream and non-InstructionStream objects as keys.
   struct KeyEqualSafe {
-    bool operator()(const Object a, const Object b) const {
+    bool operator()(const Tagged<Object> a, const Tagged<Object> b) const {
       return a.SafeEquals(b);
     }
   };
 
   // For use with std::map.
   struct Comparer {
-    bool operator()(const Object a, const Object b) const { return a < b; }
+    bool operator()(const Tagged<Object> a, const Tagged<Object> b) const {
+      return a < b;
+    }
   };
 
-  template <class T, typename std::enable_if<std::is_arithmetic<T>::value ||
-                                                 std::is_enum<T>::value,
-                                             int>::type = 0>
-  inline T ReadField(size_t offset) const {
-    return ReadMaybeUnalignedValue<T>(field_address(offset));
-  }
-
-  template <class T, typename std::enable_if<std::is_arithmetic<T>::value ||
-                                                 std::is_enum<T>::value,
-                                             int>::type = 0>
-  inline void WriteField(size_t offset, T value) const {
-    return WriteMaybeUnalignedValue<T>(field_address(offset), value);
-  }
-
-  // Atomically reads a field using relaxed memory ordering. Can only be used
-  // with integral types whose size is <= kTaggedSize (to guarantee alignment).
-  template <class T,
-            typename std::enable_if<(std::is_arithmetic<T>::value ||
-                                     std::is_enum<T>::value) &&
-                                        !std::is_floating_point<T>::value,
-                                    int>::type = 0>
-  inline T Relaxed_ReadField(size_t offset) const;
-
-  // Atomically writes a field using relaxed memory ordering. Can only be used
-  // with integral types whose size is <= kTaggedSize (to guarantee alignment).
-  template <class T,
-            typename std::enable_if<(std::is_arithmetic<T>::value ||
-                                     std::is_enum<T>::value) &&
-                                        !std::is_floating_point<T>::value,
-                                    int>::type = 0>
-  inline void Relaxed_WriteField(size_t offset, T value);
-
-  //
-  // SandboxedPointer_t field accessors.
-  //
-  inline Address ReadSandboxedPointerField(size_t offset,
-                                           PtrComprCageBase cage_base) const;
-  inline void WriteSandboxedPointerField(size_t offset,
-                                         PtrComprCageBase cage_base,
-                                         Address value);
-  inline void WriteSandboxedPointerField(size_t offset, Isolate* isolate,
-                                         Address value);
-
-  //
-  // BoundedSize field accessors.
-  //
-  inline size_t ReadBoundedSizeField(size_t offset) const;
-  inline void WriteBoundedSizeField(size_t offset, size_t value);
-
-  //
-  // ExternalPointer_t field accessors.
-  //
-  template <ExternalPointerTag tag>
-  inline void InitExternalPointerField(size_t offset, Isolate* isolate,
-                                       Address value);
-  template <ExternalPointerTag tag>
-  inline Address ReadExternalPointerField(size_t offset,
-                                          Isolate* isolate) const;
-  template <ExternalPointerTag tag>
-  inline void WriteExternalPointerField(size_t offset, Isolate* isolate,
-                                        Address value);
-
   // If the receiver is the JSGlobalObject, the store was contextual. In case
   // the property did not exist yet on the global object itself, we have to
   // throw a reference error in strict mode.  In sloppy mode, we continue.
@@ -775,18 +668,6 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
   static bool CheckContextualStoreToJSGlobalObject(
       LookupIterator* it, Maybe<ShouldThrow> should_throw);
 
-  // Returns whether the object is safe to share across Isolates.
-  //
-  // Currently, the following kinds of values can be safely shared across
-  // Isolates:
-  // - Smis
-  // - Objects in RO space when the RO space is shared
-  // - HeapNumbers in the shared old space
-  // - Strings for which String::IsShared() is true
-  // - JSSharedStructs
-  // - JSSharedArrays
-  inline bool IsShared() const;
-
   // Returns an equivalent value that's safe to share across Isolates if
   // possible. Acts as the identity function when value->IsShared().
   static inline MaybeHandle<Object> Share(
@@ -800,12 +681,18 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
   // Whether this Object can be held weakly, i.e. whether it can be used as a
   // key in WeakMap, as a key in WeakSet, as the target of a WeakRef, or as a
   // target or unregister token of a FinalizationRegistry.
-  inline bool CanBeHeldWeakly() const;
+  static inline bool CanBeHeldWeakly(Tagged<Object> obj);
 
  protected:
-  inline Address field_address(size_t offset) const {
-    return ptr() + offset - kHeapObjectTag;
-  }
+  struct SkipTypeCheckTag {};
+  explicit constexpr Object(Address ptr, SkipTypeCheckTag) : Object(ptr) {}
+
+  // Static overwrites of TaggedImpl's IsSmi/IsHeapObject, to avoid conflicts
+  // with IsSmi(Tagged<Object>) inside Object subclasses' methods.
+  template <typename T>
+  static bool IsSmi(T obj);
+  template <typename T>
+  static bool IsHeapObject(T obj);
 
  private:
   friend class CompressedObjectSlot;
@@ -814,16 +701,17 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
   friend class StringStream;
 
   // Return the map of the root of object's prototype chain.
-  Map GetPrototypeChainRootMap(Isolate* isolate) const;
+  static Tagged<Map> GetPrototypeChainRootMap(Tagged<Object> obj,
+                                              Isolate* isolate);
 
-  // Returns a non-SMI for JSReceivers, but returns the hash code for
+  // Returns a non-SMI for JSReceivers, but returns the hash code forp
   // simple objects.  This avoids a double lookup in the cases where
   // we know we will add the hash to the JSReceiver if it does not
   // already exist.
   //
   // Despite its size, this needs to be inlined for performance
   // reasons.
-  static inline Object GetSimpleHash(Object object);
+  static inline Tagged<Object> GetSimpleHash(Tagged<Object> object);
 
   // Helper for SetProperty and SetSuperProperty.
   // Return value is only meaningful if [found] is set to true on return.
@@ -852,7 +740,23 @@ class Object : public TaggedImpl<HeapObjectReferenceType::STRONG, Address> {
                  MessageTemplate error_index);
 };
 
-V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream& os, const Object& obj);
+// Implicit conversions to/from raw pointers
+// TODO(leszeks): Remove once we're using Tagged everywhere.
+// NOLINTNEXTLINE
+constexpr Tagged<Object>::Tagged(Object raw) : TaggedBase(raw.ptr()) {
+  static_assert(kTaggedCanConvertToRawObjects);
+}
+template <typename U, typename>
+// NOLINTNEXTLINE
+constexpr Tagged<Object>::operator U() {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return ToRawPtr();
+}
+
+constexpr Object Tagged<Object>::ToRawPtr() const { return Object(ptr()); }
+
+V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream& os,
+                                           Tagged<Object> obj);
 
 struct Brief {
   template <typename TObject>
@@ -867,10 +771,136 @@ V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream& os, const Brief& v);
 
 // Objects should never have the weak tag; this variant is for overzealous
 // checking.
-V8_INLINE static bool HasWeakHeapObjectTag(const Object value) {
+V8_INLINE static bool HasWeakHeapObjectTag(const Tagged<Object> value) {
   return HAS_WEAK_HEAP_OBJECT_TAG(value.ptr());
 }
 
+// For compatibility with TaggedImpl, and users of this header that don't pull
+// in objects-inl.h
+// TODO(leszeks): Remove once no longer needed.
+template <HeapObjectReferenceType kRefType, typename StorageType>
+V8_INLINE constexpr bool IsObject(TaggedImpl<kRefType, StorageType> obj) {
+  return obj.IsObject();
+}
+template <HeapObjectReferenceType kRefType, typename StorageType>
+V8_INLINE constexpr bool IsSmi(TaggedImpl<kRefType, StorageType> obj) {
+  return obj.IsSmi();
+}
+template <HeapObjectReferenceType kRefType, typename StorageType>
+V8_INLINE constexpr bool IsHeapObject(TaggedImpl<kRefType, StorageType> obj) {
+  return obj.IsHeapObject();
+}
+
+// TODO(leszeks): These exist both as free functions and members of Tagged. They
+// probably want to be cleaned up at some point.
+V8_INLINE bool IsSmi(Tagged<Object> obj) { return obj.IsSmi(); }
+V8_INLINE bool IsSmi(Tagged<HeapObject> obj) { return false; }
+V8_INLINE bool IsSmi(Tagged<Smi> obj) { return true; }
+
+V8_INLINE bool IsHeapObject(Tagged<Object> obj) { return obj.IsHeapObject(); }
+V8_INLINE bool IsHeapObject(Tagged<HeapObject> obj) { return true; }
+V8_INLINE bool IsHeapObject(Tagged<Smi> obj) { return false; }
+
+template <typename T>
+// static
+bool Object::IsSmi(T obj) {
+  return i::IsSmi(obj);
+}
+template <typename T>
+// static
+bool Object::IsHeapObject(T obj) {
+  return i::IsHeapObject(obj);
+}
+
+V8_INLINE bool IsTaggedIndex(Tagged<Object> obj);
+
+#define IS_TYPE_FUNCTION_DECL(Type)            \
+  V8_INLINE bool Is##Type(Tagged<Object> obj); \
+  V8_INLINE bool Is##Type(Tagged<Object> obj, PtrComprCageBase cage_base);
+OBJECT_TYPE_LIST(IS_TYPE_FUNCTION_DECL)
+HEAP_OBJECT_TYPE_LIST(IS_TYPE_FUNCTION_DECL)
+IS_TYPE_FUNCTION_DECL(HashTableBase)
+IS_TYPE_FUNCTION_DECL(SmallOrderedHashTable)
+#undef IS_TYPE_FUNCTION_DECL
+V8_INLINE bool IsNumber(Tagged<Object> obj, ReadOnlyRoots roots);
+
+// A wrapper around IsHole to make it easier to distinguish from specific hole
+// checks (e.g. IsTheHole).
+V8_INLINE bool IsAnyHole(Tagged<Object> obj, PtrComprCageBase cage_base);
+
+// Oddball checks are faster when they are raw pointer comparisons, so the
+// isolate/read-only roots overloads should be preferred where possible.
+#define IS_TYPE_FUNCTION_DECL(Type, Value, _)                         \
+  V8_INLINE bool Is##Type(Tagged<Object> obj, Isolate* isolate);      \
+  V8_INLINE bool Is##Type(Tagged<Object> obj, LocalIsolate* isolate); \
+  V8_INLINE bool Is##Type(Tagged<Object> obj, ReadOnlyRoots roots);   \
+  V8_INLINE bool Is##Type(Tagged<Object> obj);
+ODDBALL_LIST(IS_TYPE_FUNCTION_DECL)
+HOLE_LIST(IS_TYPE_FUNCTION_DECL)
+IS_TYPE_FUNCTION_DECL(NullOrUndefined, , /* unused */)
+#undef IS_TYPE_FUNCTION_DECL
+
+V8_INLINE bool IsZero(Tagged<Object> obj);
+V8_INLINE bool IsNoSharedNameSentinel(Tagged<Object> obj);
+V8_INLINE bool IsPrivateSymbol(Tagged<Object> obj);
+V8_INLINE bool IsPublicSymbol(Tagged<Object> obj);
+#if !V8_ENABLE_WEBASSEMBLY
+// Dummy implementation on builds without WebAssembly.
+template <typename T>
+V8_INLINE bool IsWasmObject(T obj, Isolate* = nullptr) {
+  return false;
+}
+#endif
+
+V8_INLINE bool IsJSObjectThatCanBeTrackedAsPrototype(Tagged<Object> obj);
+V8_INLINE bool IsJSObjectThatCanBeTrackedAsPrototype(Tagged<HeapObject> obj);
+
+#define DECL_STRUCT_PREDICATE(NAME, Name, name) \
+  V8_INLINE bool Is##Name(Tagged<Object> obj);  \
+  V8_INLINE bool Is##Name(Tagged<Object> obj, PtrComprCageBase cage_base);
+STRUCT_LIST(DECL_STRUCT_PREDICATE)
+#undef DECL_STRUCT_PREDICATE
+
+V8_INLINE bool IsNaN(Tagged<Object> obj);
+V8_INLINE bool IsMinusZero(Tagged<Object> obj);
+
+// Returns whether the object is safe to share across Isolates.
+//
+// Currently, the following kinds of values can be safely shared across
+// Isolates:
+// - Smis
+// - Objects in RO space when the RO space is shared
+// - HeapNumbers in the shared old space
+// - Strings for which String::IsShared() is true
+// - JSSharedStructs
+// - JSSharedArrays
+inline bool IsShared(Tagged<Object> obj);
+
+#ifdef DEBUG
+inline bool IsApiCallResultType(Tagged<Object> obj);
+#endif  // DEBUG
+
+// Prints this object without details.
+V8_EXPORT_PRIVATE void ShortPrint(Tagged<Object> obj, FILE* out = stdout);
+
+// Prints this object without details to a message accumulator.
+V8_EXPORT_PRIVATE void ShortPrint(Tagged<Object> obj,
+                                  StringStream* accumulator);
+
+V8_EXPORT_PRIVATE void ShortPrint(Tagged<Object> obj, std::ostream& os);
+
+#ifdef OBJECT_PRINT
+// For our gdb macros, we should perhaps change these in the future.
+V8_EXPORT_PRIVATE void Print(Tagged<Object> obj);
+
+// Prints this object with details.
+V8_EXPORT_PRIVATE void Print(Tagged<Object> obj, std::ostream& os);
+
+#else
+inline void Print(Object obj) { ShortPrint(obj); }
+inline void Print(Object obj, std::ostream& os) { ShortPrint(obj, os); }
+#endif
+
 // Heap objects typically have a map pointer in their first word.  However,
 // during GC other data (e.g. mark bits, forwarding addresses) is sometimes
 // encoded in the first word.  The class MapWord is an abstraction of the
@@ -890,10 +920,10 @@ class MapWord {
   // Normal state: the map word contains a map pointer.
 
   // Create a map word from a map pointer.
-  static inline MapWord FromMap(const Map map);
+  static inline MapWord FromMap(const Tagged<Map> map);
 
   // View this map word as a map pointer.
-  inline Map ToMap() const;
+  inline Tagged<Map> ToMap() const;
 
   // Scavenge collection: the map word of live objects in the from space
   // contains a forwarding address (a heap object pointer in the to space).
@@ -903,12 +933,15 @@ class MapWord {
   // when all map words are heap object pointers, i.e. not during a full GC).
   inline bool IsForwardingAddress() const;
 
+  V8_EXPORT_PRIVATE static bool IsMapOrForwarded(Tagged<Map> map);
+
   // Create a map word from a forwarding address.
-  static inline MapWord FromForwardingAddress(HeapObject map_word_host,
-                                              HeapObject object);
+  static inline MapWord FromForwardingAddress(Tagged<HeapObject> map_word_host,
+                                              Tagged<HeapObject> object);
 
   // View this map word as a forwarding address.
-  inline HeapObject ToForwardingAddress(HeapObject map_word_host);
+  inline Tagged<HeapObject> ToForwardingAddress(
+      Tagged<HeapObject> map_word_host);
 
   constexpr inline Address ptr() const { return value_; }
 
diff --git a/deps/v8/src/objects/oddball-inl.h b/deps/v8/src/objects/oddball-inl.h
index ec05b7dae32dc6..6d5dd04d1c9697 100644
--- a/deps/v8/src/objects/oddball-inl.h
+++ b/deps/v8/src/objects/oddball-inl.h
@@ -5,11 +5,11 @@
 #ifndef V8_OBJECTS_ODDBALL_INL_H_
 #define V8_OBJECTS_ODDBALL_INL_H_
 
-#include "src/objects/oddball.h"
-
 #include "src/handles/handles.h"
 #include "src/heap/heap-write-barrier-inl.h"
 #include "src/objects/objects-inl.h"
+#include "src/objects/oddball.h"
+#include "src/objects/primitive-heap-object-inl.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -30,15 +30,15 @@ void Oddball::set_to_number_raw_as_bits(uint64_t bits) {
   base::WriteUnalignedValue<uint64_t>(field_address(kToNumberRawOffset), bits);
 }
 
-ACCESSORS(Oddball, to_string, String, kToStringOffset)
-ACCESSORS(Oddball, to_number, Object, kToNumberOffset)
-ACCESSORS(Oddball, type_of, String, kTypeOfOffset)
+ACCESSORS(Oddball, to_string, Tagged<String>, kToStringOffset)
+ACCESSORS(Oddball, to_number, Tagged<Object>, kToNumberOffset)
+ACCESSORS(Oddball, type_of, Tagged<String>, kTypeOfOffset)
 
-byte Oddball::kind() const {
+uint8_t Oddball::kind() const {
   return Smi::ToInt(TaggedField<Smi>::load(*this, kKindOffset));
 }
 
-void Oddball::set_kind(byte value) {
+void Oddball::set_kind(uint8_t value) {
   WRITE_FIELD(*this, kKindOffset, Smi::FromInt(value));
 }
 
@@ -47,16 +47,36 @@ Handle<Object> Oddball::ToNumber(Isolate* isolate, Handle<Oddball> input) {
   return Handle<Object>(input->to_number(), isolate);
 }
 
-DEF_GETTER(HeapObject, IsBoolean, bool) {
-  return IsOddball(cage_base) &&
-         ((Oddball::cast(*this).kind() & Oddball::kNotBooleanMask) == 0);
+DEF_HEAP_OBJECT_PREDICATE(HeapObject, IsBoolean) {
+  return IsOddball(obj, cage_base) &&
+         ((Oddball::cast(obj)->kind() & Oddball::kNotBooleanMask) == 0);
 }
 
-bool Oddball::ToBool(Isolate* isolate) const {
-  DCHECK(IsBoolean(isolate));
-  return IsTrue(isolate);
+TQ_CPP_OBJECT_DEFINITION_ASSERTS(Null, Oddball)
+OBJECT_CONSTRUCTORS_IMPL(Null, Oddball)
+CAST_ACCESSOR(Null)
+
+TQ_CPP_OBJECT_DEFINITION_ASSERTS(Undefined, Oddball)
+OBJECT_CONSTRUCTORS_IMPL(Undefined, Oddball)
+CAST_ACCESSOR(Undefined)
+
+TQ_CPP_OBJECT_DEFINITION_ASSERTS(Boolean, Oddball)
+OBJECT_CONSTRUCTORS_IMPL(Boolean, Oddball)
+CAST_ACCESSOR(Boolean)
+
+bool Boolean::ToBool(Isolate* isolate) const {
+  DCHECK(IsBoolean(*this, isolate));
+  return IsTrue(*this, isolate);
 }
 
+TQ_CPP_OBJECT_DEFINITION_ASSERTS(True, Boolean)
+OBJECT_CONSTRUCTORS_IMPL(True, Boolean)
+CAST_ACCESSOR(True)
+
+TQ_CPP_OBJECT_DEFINITION_ASSERTS(False, Boolean)
+OBJECT_CONSTRUCTORS_IMPL(False, Boolean)
+CAST_ACCESSOR(False)
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/oddball.h b/deps/v8/src/objects/oddball.h
index 2be38f4521518c..75533c65e45bfe 100644
--- a/deps/v8/src/objects/oddball.h
+++ b/deps/v8/src/objects/oddball.h
@@ -23,23 +23,21 @@ class Oddball : public PrimitiveHeapObject {
   inline void set_to_number_raw_as_bits(uint64_t bits);
 
   // [to_string]: Cached to_string computed at startup.
-  DECL_ACCESSORS(to_string, String)
+  DECL_ACCESSORS(to_string, Tagged<String>)
 
   // [to_number]: Cached to_number computed at startup.
-  DECL_ACCESSORS(to_number, Object)
+  DECL_ACCESSORS(to_number, Tagged<Object>)
 
   // [typeof]: Cached type_of computed at startup.
-  DECL_ACCESSORS(type_of, String)
+  DECL_ACCESSORS(type_of, Tagged<String>)
 
-  inline byte kind() const;
-  inline void set_kind(byte kind);
+  inline uint8_t kind() const;
+  inline void set_kind(uint8_t kind);
 
   // ES6 section 7.1.3 ToNumber for Boolean, Null, Undefined.
   V8_WARN_UNUSED_RESULT static inline Handle<Object> ToNumber(
       Isolate* isolate, Handle<Oddball> input);
 
-  V8_INLINE bool ToBool(Isolate* isolate) const;
-
   DECL_CAST(Oddball)
 
   // Dispatched behavior.
@@ -48,7 +46,7 @@ class Oddball : public PrimitiveHeapObject {
   // Initialize the fields.
   static void Initialize(Isolate* isolate, Handle<Oddball> oddball,
                          const char* to_string, Handle<Object> to_number,
-                         const char* type_of, byte kind);
+                         const char* type_of, uint8_t kind);
 
   // Layout description.
   DECL_FIELD_OFFSET_TQ(ToNumberRaw, HeapObject::kHeaderSize, "float64")
@@ -57,21 +55,21 @@ class Oddball : public PrimitiveHeapObject {
   DECL_FIELD_OFFSET_TQ(TypeOf, kToNumberOffset + kTaggedSize, "String")
   DECL_FIELD_OFFSET_TQ(Kind, kTypeOfOffset + kTaggedSize, "Smi")
   static const int kSize = kKindOffset + kTaggedSize;
-
-  static const byte kFalse = 0;
-  static const byte kTrue = 1;
-  static const byte kNotBooleanMask = static_cast<byte>(~1);
-  static const byte kTheHole = 2;
-  static const byte kNull = 3;
-  static const byte kArgumentsMarker = 4;
-  static const byte kUndefined = 5;
-  static const byte kUninitialized = 6;
-  static const byte kOther = 7;
-  static const byte kException = 8;
-  static const byte kOptimizedOut = 9;
-  static const byte kStaleRegister = 10;
-  static const byte kSelfReferenceMarker = 10;
-  static const byte kBasicBlockCountersMarker = 11;
+  static const int kHeaderSize = kSize;
+
+  static const uint8_t kFalse = 0;
+  static const uint8_t kTrue = 1;
+  static const uint8_t kNotBooleanMask = static_cast<uint8_t>(~1);
+  static const uint8_t kNull = 3;
+  static const uint8_t kArgumentsMarker = 4;
+  static const uint8_t kUndefined = 5;
+  static const uint8_t kUninitialized = 6;
+  static const uint8_t kOther = 7;
+  static const uint8_t kException = 8;
+  static const uint8_t kOptimizedOut = 9;
+  static const uint8_t kStaleRegister = 10;
+  static const uint8_t kSelfReferenceMarker = 10;
+  static const uint8_t kBasicBlockCountersMarker = 11;
 
   using BodyDescriptor =
       FixedBodyDescriptor<kToStringOffset, kKindOffset, kSize>;
@@ -85,6 +83,39 @@ class Oddball : public PrimitiveHeapObject {
   OBJECT_CONSTRUCTORS(Oddball, PrimitiveHeapObject);
 };
 
+class Null : public Oddball {
+ public:
+  DECL_CAST(Null)
+  OBJECT_CONSTRUCTORS(Null, Oddball);
+};
+
+class Undefined : public Oddball {
+ public:
+  DECL_CAST(Undefined)
+  OBJECT_CONSTRUCTORS(Undefined, Oddball);
+};
+
+class Boolean : public Oddball {
+ public:
+  DECL_CAST(Boolean)
+
+  V8_INLINE bool ToBool(Isolate* isolate) const;
+
+  OBJECT_CONSTRUCTORS(Boolean, Oddball);
+};
+
+class True : public Boolean {
+ public:
+  DECL_CAST(True)
+  OBJECT_CONSTRUCTORS(True, Boolean);
+};
+
+class False : public Boolean {
+ public:
+  DECL_CAST(False)
+  OBJECT_CONSTRUCTORS(False, Boolean);
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/oddball.tq b/deps/v8/src/objects/oddball.tq
index 749c156ddd0dae..b0f952ea485a5b 100644
--- a/deps/v8/src/objects/oddball.tq
+++ b/deps/v8/src/objects/oddball.tq
@@ -12,3 +12,28 @@ extern class Oddball extends PrimitiveHeapObject {
   type_of: String;
   kind: Smi;
 }
+
+@cppObjectDefinition
+@hasSameInstanceTypeAsParent
+@doNotGenerateCast
+extern class Null extends Oddball {}
+
+@cppObjectDefinition
+@hasSameInstanceTypeAsParent
+@doNotGenerateCast
+extern class Undefined extends Oddball {}
+
+@cppObjectDefinition
+@hasSameInstanceTypeAsParent
+@doNotGenerateCast
+extern class Boolean extends Oddball {}
+
+@cppObjectDefinition
+@hasSameInstanceTypeAsParent
+@doNotGenerateCast
+extern class True extends Boolean {}
+
+@cppObjectDefinition
+@hasSameInstanceTypeAsParent
+@doNotGenerateCast
+extern class False extends Boolean {}
diff --git a/deps/v8/src/objects/option-utils.cc b/deps/v8/src/objects/option-utils.cc
index 234dcdb172a749..8d5b893df8e1ca 100644
--- a/deps/v8/src/objects/option-utils.cc
+++ b/deps/v8/src/objects/option-utils.cc
@@ -15,12 +15,12 @@ MaybeHandle<JSReceiver> GetOptionsObject(Isolate* isolate,
                                          Handle<Object> options,
                                          const char* method_name) {
   // 1. If options is undefined, then
-  if (options->IsUndefined(isolate)) {
+  if (IsUndefined(*options, isolate)) {
     // a. Return ! ObjectCreate(null).
     return isolate->factory()->NewJSObjectWithNullProto();
   }
   // 2. If Type(options) is Object, then
-  if (options->IsJSReceiver()) {
+  if (IsJSReceiver(*options)) {
     // a. Return options.
     return Handle<JSReceiver>::cast(options);
   }
@@ -34,7 +34,7 @@ MaybeHandle<JSReceiver> CoerceOptionsToObject(Isolate* isolate,
                                               Handle<Object> options,
                                               const char* method_name) {
   // 1. If options is undefined, then
-  if (options->IsUndefined(isolate)) {
+  if (IsUndefined(*options, isolate)) {
     // a. Return ! ObjectCreate(null).
     return isolate->factory()->NewJSObjectWithNullProto();
   }
@@ -60,7 +60,7 @@ Maybe<bool> GetStringOption(Isolate* isolate, Handle<JSReceiver> options,
       Object::GetPropertyOrElement(isolate, options, property_str),
       Nothing<bool>());
 
-  if (value->IsUndefined(isolate)) {
+  if (IsUndefined(*value, isolate)) {
     return Just(false);
   }
 
@@ -112,9 +112,9 @@ V8_WARN_UNUSED_RESULT Maybe<bool> GetBoolOption(Isolate* isolate,
       Nothing<bool>());
 
   // 2. If value is not undefined, then
-  if (!value->IsUndefined(isolate)) {
+  if (!IsUndefined(*value, isolate)) {
     // 2. b. i. Let value be ToBoolean(value).
-    *result = value->BooleanValue(isolate);
+    *result = Object::BooleanValue(*value, isolate);
 
     // 2. e. return value
     return Just(true);
@@ -127,19 +127,19 @@ V8_WARN_UNUSED_RESULT Maybe<bool> GetBoolOption(Isolate* isolate,
 Maybe<int> DefaultNumberOption(Isolate* isolate, Handle<Object> value, int min,
                                int max, int fallback, Handle<String> property) {
   // 2. Else, return fallback.
-  if (value->IsUndefined()) return Just(fallback);
+  if (IsUndefined(*value)) return Just(fallback);
 
   // 1. If value is not undefined, then
   // a. Let value be ? ToNumber(value).
   Handle<Object> value_num;
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, value_num, Object::ToNumber(isolate, value), Nothing<int>());
-  DCHECK(value_num->IsNumber());
+  DCHECK(IsNumber(*value_num));
 
   // b. If value is NaN or less than minimum or greater than maximum, throw a
   // RangeError exception.
-  if (value_num->IsNaN() || value_num->Number() < min ||
-      value_num->Number() > max) {
+  if (IsNaN(*value_num) || Object::Number(*value_num) < min ||
+      Object::Number(*value_num) > max) {
     THROW_NEW_ERROR_RETURN_VALUE(
         isolate,
         NewRangeError(MessageTemplate::kPropertyValueOutOfRange, property),
@@ -151,7 +151,7 @@ Maybe<int> DefaultNumberOption(Isolate* isolate, Handle<Object> value, int min,
   // int conversion safe.
   //
   // c. Return floor(value).
-  return Just(FastD2I(floor(value_num->Number())));
+  return Just(FastD2I(floor(Object::Number(*value_num))));
 }
 
 // ecma402/#sec-getnumberoption
@@ -179,7 +179,7 @@ Maybe<double> GetNumberOptionAsDouble(Isolate* isolate,
       isolate, value, JSReceiver::GetProperty(isolate, options, property),
       Nothing<double>());
   // 2. If value is undefined, then
-  if (value->IsUndefined()) {
+  if (IsUndefined(*value)) {
     // b. Return default.
     return Just(default_value);
   }
@@ -188,7 +188,7 @@ Maybe<double> GetNumberOptionAsDouble(Isolate* isolate,
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, value, Object::ToNumber(isolate, value), Nothing<double>());
   // b. If value is NaN, throw a RangeError exception.
-  if (value->IsNaN()) {
+  if (IsNaN(*value)) {
     THROW_NEW_ERROR_RETURN_VALUE(
         isolate,
         NewRangeError(MessageTemplate::kPropertyValueOutOfRange, property),
@@ -196,7 +196,7 @@ Maybe<double> GetNumberOptionAsDouble(Isolate* isolate,
   }
 
   // 7. Return value.
-  return Just(value->Number());
+  return Just(Object::Number(*value));
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/option-utils.h b/deps/v8/src/objects/option-utils.h
index 1b7d81704f61bb..2b542051efacb8 100644
--- a/deps/v8/src/objects/option-utils.h
+++ b/deps/v8/src/objects/option-utils.h
@@ -5,8 +5,10 @@
 #ifndef V8_OBJECTS_OPTION_UTILS_H_
 #define V8_OBJECTS_OPTION_UTILS_H_
 
+#include "src/common/globals.h"
 #include "src/execution/isolate.h"
-#include "src/objects/objects.h"
+#include "src/objects/js-objects.h"
+#include "src/objects/string.h"
 
 namespace v8 {
 namespace internal {
@@ -86,15 +88,15 @@ V8_WARN_UNUSED_RESULT static Maybe<T> GetStringOrBooleanOption(
       Object::GetPropertyOrElement(isolate, options, property_str),
       Nothing<T>());
   // 2. If value is undefined, then return fallback.
-  if (value->IsUndefined(isolate)) {
+  if (IsUndefined(*value, isolate)) {
     return Just(fallback_value);
   }
   // 3. If value is true, then return trueValue.
-  if (value->IsTrue(isolate)) {
+  if (IsTrue(*value, isolate)) {
     return Just(true_value);
   }
   // 4. Let valueBoolean be ToBoolean(value).
-  bool valueBoolean = value->BooleanValue(isolate);
+  bool valueBoolean = Object::BooleanValue(*value, isolate);
   // 5. If valueBoolean is false, then return valueBoolean.
   if (!valueBoolean) {
     return Just(false_value);
diff --git a/deps/v8/src/objects/ordered-hash-table-inl.h b/deps/v8/src/objects/ordered-hash-table-inl.h
index 3aef224e57ef51..84fb8a49d40e79 100644
--- a/deps/v8/src/objects/ordered-hash-table-inl.h
+++ b/deps/v8/src/objects/ordered-hash-table-inl.h
@@ -35,23 +35,23 @@ OrderedHashTable<Derived, entrysize>::OrderedHashTable(Address ptr)
 
 template <class Derived, int entrysize>
 bool OrderedHashTable<Derived, entrysize>::IsKey(ReadOnlyRoots roots,
-                                                 Object k) {
+                                                 Tagged<Object> k) {
   return k != roots.the_hole_value();
 }
 
 OrderedHashSet::OrderedHashSet(Address ptr)
     : OrderedHashTable<OrderedHashSet, 1>(ptr) {
-  SLOW_DCHECK(IsOrderedHashSet());
+  SLOW_DCHECK(IsOrderedHashSet(*this));
 }
 
 OrderedHashMap::OrderedHashMap(Address ptr)
     : OrderedHashTable<OrderedHashMap, 2>(ptr) {
-  SLOW_DCHECK(IsOrderedHashMap());
+  SLOW_DCHECK(IsOrderedHashMap(*this));
 }
 
 OrderedNameDictionary::OrderedNameDictionary(Address ptr)
     : OrderedHashTable<OrderedNameDictionary, 3>(ptr) {
-  SLOW_DCHECK(IsOrderedNameDictionary());
+  SLOW_DCHECK(IsOrderedNameDictionary(*this));
 }
 
 template <class Derived>
@@ -59,15 +59,16 @@ SmallOrderedHashTable<Derived>::SmallOrderedHashTable(Address ptr)
     : HeapObject(ptr) {}
 
 template <class Derived>
-Object SmallOrderedHashTable<Derived>::KeyAt(InternalIndex entry) const {
+Tagged<Object> SmallOrderedHashTable<Derived>::KeyAt(
+    InternalIndex entry) const {
   DCHECK_LT(entry.as_int(), Capacity());
   Offset entry_offset = GetDataEntryOffset(entry.as_int(), Derived::kKeyIndex);
   return TaggedField<Object>::load(*this, entry_offset);
 }
 
 template <class Derived>
-Object SmallOrderedHashTable<Derived>::GetDataEntry(int entry,
-                                                    int relative_index) {
+Tagged<Object> SmallOrderedHashTable<Derived>::GetDataEntry(
+    int entry, int relative_index) {
   DCHECK_LT(entry, Capacity());
   DCHECK_LE(static_cast<unsigned>(relative_index), Derived::kEntrySize);
   Offset entry_offset = GetDataEntryOffset(entry, relative_index);
@@ -105,17 +106,17 @@ Handle<Map> SmallOrderedHashSet::GetMap(ReadOnlyRoots roots) {
   return roots.small_ordered_hash_set_map_handle();
 }
 
-inline Object OrderedHashMap::ValueAt(InternalIndex entry) {
+inline Tagged<Object> OrderedHashMap::ValueAt(InternalIndex entry) {
   DCHECK_LT(entry.as_int(), UsedCapacity());
   return get(EntryToIndex(entry) + kValueOffset);
 }
 
-inline Object OrderedNameDictionary::ValueAt(InternalIndex entry) {
+inline Tagged<Object> OrderedNameDictionary::ValueAt(InternalIndex entry) {
   DCHECK_LT(entry.as_int(), UsedCapacity());
   return get(EntryToIndex(entry) + kValueOffset);
 }
 
-Name OrderedNameDictionary::NameAt(InternalIndex entry) {
+Tagged<Name> OrderedNameDictionary::NameAt(InternalIndex entry) {
   return Name::cast(KeyAt(entry));
 }
 
@@ -123,8 +124,8 @@ Name OrderedNameDictionary::NameAt(InternalIndex entry) {
 template <class Derived, int entrysize>
 bool OrderedHashTable<Derived, entrysize>::ToKey(ReadOnlyRoots roots,
                                                  InternalIndex entry,
-                                                 Object* out_key) {
-  Object k = KeyAt(entry);
+                                                 Tagged<Object>* out_key) {
+  Tagged<Object> k = KeyAt(entry);
   if (!IsKey(roots, k)) return false;
   *out_key = k;
   return true;
@@ -132,7 +133,7 @@ bool OrderedHashTable<Derived, entrysize>::ToKey(ReadOnlyRoots roots,
 
 // Set the value for entry.
 inline void OrderedNameDictionary::ValueAtPut(InternalIndex entry,
-                                              Object value) {
+                                              Tagged<Object> value) {
   DCHECK_LT(entry.as_int(), UsedCapacity());
   this->set(EntryToIndex(entry) + kValueOffset, value);
 }
@@ -152,13 +153,13 @@ inline void OrderedNameDictionary::DetailsAtPut(InternalIndex entry,
   this->set(EntryToIndex(entry) + kPropertyDetailsOffset, value.AsSmi());
 }
 
-inline Object SmallOrderedNameDictionary::ValueAt(InternalIndex entry) {
+inline Tagged<Object> SmallOrderedNameDictionary::ValueAt(InternalIndex entry) {
   return this->GetDataEntry(entry.as_int(), kValueIndex);
 }
 
 // Set the value for entry.
 inline void SmallOrderedNameDictionary::ValueAtPut(InternalIndex entry,
-                                                   Object value) {
+                                                   Tagged<Object> value) {
   this->SetDataEntry(entry.as_int(), kValueIndex, value);
 }
 
@@ -178,32 +179,32 @@ inline void SmallOrderedNameDictionary::DetailsAtPut(InternalIndex entry,
 }
 
 inline bool OrderedHashSet::Is(Handle<HeapObject> table) {
-  return table->IsOrderedHashSet();
+  return IsOrderedHashSet(*table);
 }
 
 inline bool OrderedHashMap::Is(Handle<HeapObject> table) {
-  return table->IsOrderedHashMap();
+  return IsOrderedHashMap(*table);
 }
 
 inline bool OrderedNameDictionary::Is(Handle<HeapObject> table) {
-  return table->IsOrderedNameDictionary();
+  return IsOrderedNameDictionary(*table);
 }
 
 inline bool SmallOrderedHashSet::Is(Handle<HeapObject> table) {
-  return table->IsSmallOrderedHashSet();
+  return IsSmallOrderedHashSet(*table);
 }
 
 inline bool SmallOrderedNameDictionary::Is(Handle<HeapObject> table) {
-  return table->IsSmallOrderedNameDictionary();
+  return IsSmallOrderedNameDictionary(*table);
 }
 
 inline bool SmallOrderedHashMap::Is(Handle<HeapObject> table) {
-  return table->IsSmallOrderedHashMap();
+  return IsSmallOrderedHashMap(*table);
 }
 
 template <class Derived>
 void SmallOrderedHashTable<Derived>::SetDataEntry(int entry, int relative_index,
-                                                  Object value) {
+                                                  Tagged<Object> value) {
   DCHECK_NE(kNotFound, entry);
   int entry_offset = GetDataEntryOffset(entry, relative_index);
   RELAXED_WRITE_FIELD(*this, entry_offset, value);
@@ -211,13 +212,13 @@ void SmallOrderedHashTable<Derived>::SetDataEntry(int entry, int relative_index,
 }
 
 template <class Derived, class TableType>
-Object OrderedHashTableIterator<Derived, TableType>::CurrentKey() {
+Tagged<Object> OrderedHashTableIterator<Derived, TableType>::CurrentKey() {
   TableType table = TableType::cast(this->table());
   int index = Smi::ToInt(this->index());
   DCHECK_LE(0, index);
   InternalIndex entry(index);
-  Object key = table.KeyAt(entry);
-  DCHECK(!key.IsTheHole());
+  Tagged<Object> key = table.KeyAt(entry);
+  DCHECK(!IsTheHole(key));
   return key;
 }
 
@@ -238,7 +239,7 @@ inline void OrderedNameDictionary::SetHash(int hash) {
 }
 
 inline int OrderedNameDictionary::Hash() {
-  Object hash_obj = this->get(HashIndex());
+  Tagged<Object> hash_obj = this->get(HashIndex());
   int hash = Smi::ToInt(hash_obj);
   DCHECK(PropertyArray::HashField::is_valid(hash));
   return hash;
diff --git a/deps/v8/src/objects/ordered-hash-table.cc b/deps/v8/src/objects/ordered-hash-table.cc
index e21f21d2f3aba7..a190277583494e 100644
--- a/deps/v8/src/objects/ordered-hash-table.cc
+++ b/deps/v8/src/objects/ordered-hash-table.cc
@@ -36,13 +36,13 @@ MaybeHandle<Derived> OrderedHashTable<Derived, entrysize>::Allocate(
       allocation);
   Handle<Derived> table = Handle<Derived>::cast(backing_store);
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
+  Tagged<Derived> raw_table = *table;
   for (int i = 0; i < num_buckets; ++i) {
-    raw_table.set(HashTableStartIndex() + i, Smi::FromInt(kNotFound));
+    raw_table->set(HashTableStartIndex() + i, Smi::FromInt(kNotFound));
   }
-  raw_table.SetNumberOfBuckets(num_buckets);
-  raw_table.SetNumberOfElements(0);
-  raw_table.SetNumberOfDeletedElements(0);
+  raw_table->SetNumberOfBuckets(num_buckets);
+  raw_table->SetNumberOfElements(0);
+  raw_table->SetNumberOfDeletedElements(0);
   return table;
 }
 
@@ -59,15 +59,16 @@ MaybeHandle<Derived> OrderedHashTable<Derived, entrysize>::AllocateEmpty(
       allocation);
   Handle<Derived> table = Handle<Derived>::cast(backing_store);
   DisallowHandleAllocation no_gc;
-  auto raw_table = *table;
-  raw_table.SetNumberOfBuckets(0);
-  raw_table.SetNumberOfElements(0);
-  raw_table.SetNumberOfDeletedElements(0);
+  Tagged<Derived> raw_table = *table;
+  raw_table->SetNumberOfBuckets(0);
+  raw_table->SetNumberOfElements(0);
+  raw_table->SetNumberOfDeletedElements(0);
   return table;
 }
 
 template <class Derived, int entrysize>
-MaybeHandle<Derived> OrderedHashTable<Derived, entrysize>::EnsureGrowable(
+MaybeHandle<Derived>
+OrderedHashTable<Derived, entrysize>::EnsureCapacityForAdding(
     Isolate* isolate, Handle<Derived> table) {
   DCHECK(!table->IsObsolete());
 
@@ -126,17 +127,18 @@ Handle<Derived> OrderedHashTable<Derived, entrysize>::Clear(
 
 template <class Derived, int entrysize>
 bool OrderedHashTable<Derived, entrysize>::HasKey(Isolate* isolate,
-                                                  Derived table, Object key) {
-  DCHECK_IMPLIES(entrysize == 1, table.IsOrderedHashSet());
-  DCHECK_IMPLIES(entrysize == 2, table.IsOrderedHashMap());
+                                                  Tagged<Derived> table,
+                                                  Tagged<Object> key) {
+  DCHECK_IMPLIES(entrysize == 1, IsOrderedHashSet(table));
+  DCHECK_IMPLIES(entrysize == 2, IsOrderedHashMap(table));
   DisallowGarbageCollection no_gc;
-  InternalIndex entry = table.FindEntry(isolate, key);
+  InternalIndex entry = table->FindEntry(isolate, key);
   return entry.is_found();
 }
 
 template <class Derived, int entrysize>
-InternalIndex OrderedHashTable<Derived, entrysize>::FindEntry(Isolate* isolate,
-                                                              Object key) {
+InternalIndex OrderedHashTable<Derived, entrysize>::FindEntry(
+    Isolate* isolate, Tagged<Object> key) {
   if (NumberOfElements() == 0) {
     // This is not just an optimization but also ensures that we do the right
     // thing if Capacity() == 0
@@ -146,21 +148,22 @@ InternalIndex OrderedHashTable<Derived, entrysize>::FindEntry(Isolate* isolate,
   int raw_entry;
   // This special cases for Smi, so that we avoid the HandleScope
   // creation below.
-  if (key.IsSmi()) {
+  if (IsSmi(key)) {
     uint32_t hash = ComputeUnseededHash(Smi::ToInt(key));
     raw_entry = HashToEntryRaw(hash & Smi::kMaxValue);
   } else {
     HandleScope scope(isolate);
-    Object hash = key.GetHash();
+    Tagged<Object> hash = Object::GetHash(key);
     // If the object does not have an identity hash, it was never used as a key
-    if (hash.IsUndefined(isolate)) return InternalIndex::NotFound();
+    if (IsUndefined(hash, isolate)) return InternalIndex::NotFound();
     raw_entry = HashToEntryRaw(Smi::ToInt(hash));
   }
 
   // Walk the chain in the bucket to find the key.
   while (raw_entry != kNotFound) {
-    Object candidate_key = KeyAt(InternalIndex(raw_entry));
-    if (candidate_key.SameValueZero(key)) return InternalIndex(raw_entry);
+    Tagged<Object> candidate_key = KeyAt(InternalIndex(raw_entry));
+    if (Object::SameValueZero(candidate_key, key))
+      return InternalIndex(raw_entry);
     raw_entry = NextChainEntryRaw(raw_entry);
   }
 
@@ -173,41 +176,42 @@ MaybeHandle<OrderedHashSet> OrderedHashSet::Add(Isolate* isolate,
   int hash;
   {
     DisallowGarbageCollection no_gc;
-    auto raw_key = *key;
-    auto raw_table = *table;
-    hash = raw_key.GetOrCreateHash(isolate).value();
-    if (raw_table.NumberOfElements() > 0) {
-      int raw_entry = raw_table.HashToEntryRaw(hash);
+    Tagged<Object> raw_key = *key;
+    Tagged<OrderedHashSet> raw_table = *table;
+    hash = Object::GetOrCreateHash(raw_key, isolate).value();
+    if (raw_table->NumberOfElements() > 0) {
+      int raw_entry = raw_table->HashToEntryRaw(hash);
       // Walk the chain of the bucket and try finding the key.
       while (raw_entry != kNotFound) {
-        Object candidate_key = raw_table.KeyAt(InternalIndex(raw_entry));
+        Tagged<Object> candidate_key =
+            raw_table->KeyAt(InternalIndex(raw_entry));
         // Do not add if we have the key already
-        if (candidate_key.SameValueZero(raw_key)) return table;
-        raw_entry = raw_table.NextChainEntryRaw(raw_entry);
+        if (Object::SameValueZero(candidate_key, raw_key)) return table;
+        raw_entry = raw_table->NextChainEntryRaw(raw_entry);
       }
     }
   }
 
   MaybeHandle<OrderedHashSet> table_candidate =
-      OrderedHashSet::EnsureGrowable(isolate, table);
+      OrderedHashSet::EnsureCapacityForAdding(isolate, table);
   if (!table_candidate.ToHandle(&table)) {
     CHECK(isolate->has_pending_exception());
     return table_candidate;
   }
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
+  Tagged<OrderedHashSet> raw_table = *table;
   // Read the existing bucket values.
-  int bucket = raw_table.HashToBucket(hash);
-  int previous_entry = raw_table.HashToEntryRaw(hash);
-  int nof = raw_table.NumberOfElements();
+  int bucket = raw_table->HashToBucket(hash);
+  int previous_entry = raw_table->HashToEntryRaw(hash);
+  int nof = raw_table->NumberOfElements();
   // Insert a new entry at the end,
-  int new_entry = nof + raw_table.NumberOfDeletedElements();
-  int new_index = raw_table.EntryToIndexRaw(new_entry);
-  raw_table.set(new_index, *key);
-  raw_table.set(new_index + kChainOffset, Smi::FromInt(previous_entry));
+  int new_entry = nof + raw_table->NumberOfDeletedElements();
+  int new_index = raw_table->EntryToIndexRaw(new_entry);
+  raw_table->set(new_index, *key);
+  raw_table->set(new_index + kChainOffset, Smi::FromInt(previous_entry));
   // and point the bucket to the new entry.
-  raw_table.set(HashTableStartIndex() + bucket, Smi::FromInt(new_entry));
-  raw_table.SetNumberOfElements(nof + 1);
+  raw_table->set(HashTableStartIndex() + bucket, Smi::FromInt(new_entry));
+  raw_table->SetNumberOfElements(nof + 1);
   return table;
 }
 
@@ -223,29 +227,29 @@ Handle<FixedArray> OrderedHashSet::ConvertToKeysArray(
       isolate->heap()->MaxNumberToStringCacheSize();
   for (int i = 0; i < length; i++) {
     int index = HashTableStartIndex() + nof_buckets + (i * kEntrySize);
-    Object key = table->get(index);
+    Tagged<Object> key = table->get(index);
     uint32_t index_value;
     if (convert == GetKeysConversion::kConvertToString) {
-      if (key.ToArrayIndex(&index_value)) {
+      if (Object::ToArrayIndex(key, &index_value)) {
         // Avoid trashing the Number2String cache if indices get very large.
         bool use_cache = i < kMaxStringTableEntries;
         key = *isolate->factory()->Uint32ToString(index_value, use_cache);
       } else {
-        CHECK(key.IsName());
+        CHECK(IsName(key));
       }
     } else if (convert == GetKeysConversion::kNoNumbers) {
-      DCHECK(!key.ToArrayIndex(&index_value));
+      DCHECK(!Object::ToArrayIndex(key, &index_value));
     }
     result->set(i, key);
   }
   return FixedArray::ShrinkOrEmpty(isolate, result, length);
 }
 
-HeapObject OrderedHashSet::GetEmpty(ReadOnlyRoots ro_roots) {
+Tagged<HeapObject> OrderedHashSet::GetEmpty(ReadOnlyRoots ro_roots) {
   return ro_roots.empty_ordered_hash_set();
 }
 
-HeapObject OrderedHashMap::GetEmpty(ReadOnlyRoots ro_roots) {
+Tagged<HeapObject> OrderedHashMap::GetEmpty(ReadOnlyRoots ro_roots) {
   return ro_roots.empty_ordered_hash_map();
 }
 
@@ -277,20 +281,20 @@ MaybeHandle<Derived> OrderedHashTable<Derived, entrysize>::Rehash(
 
   for (InternalIndex old_entry : table->IterateEntries()) {
     int old_entry_raw = old_entry.as_int();
-    Object key = table->KeyAt(old_entry);
-    if (key.IsTheHole(isolate)) {
+    Tagged<Object> key = table->KeyAt(old_entry);
+    if (IsTheHole(key, isolate)) {
       table->SetRemovedIndexAt(removed_holes_index++, old_entry_raw);
       continue;
     }
 
-    Object hash = key.GetHash();
+    Tagged<Object> hash = Object::GetHash(key);
     int bucket = Smi::ToInt(hash) & (new_buckets - 1);
-    Object chain_entry = new_table->get(HashTableStartIndex() + bucket);
+    Tagged<Object> chain_entry = new_table->get(HashTableStartIndex() + bucket);
     new_table->set(HashTableStartIndex() + bucket, Smi::FromInt(new_entry));
     int new_index = new_table->EntryToIndexRaw(new_entry);
     int old_index = table->EntryToIndexRaw(old_entry_raw);
     for (int i = 0; i < entrysize; ++i) {
-      Object value = table->get(old_index + i);
+      Tagged<Object> value = table->get(old_index + i);
       new_table->set(new_index + i, value);
     }
     new_table->set(new_index + kChainOffset, chain_entry);
@@ -343,33 +347,34 @@ MaybeHandle<OrderedNameDictionary> OrderedNameDictionary::Rehash(
 
 template <class Derived, int entrysize>
 bool OrderedHashTable<Derived, entrysize>::Delete(Isolate* isolate,
-                                                  Derived table, Object key) {
+                                                  Tagged<Derived> table,
+                                                  Tagged<Object> key) {
   DisallowGarbageCollection no_gc;
-  InternalIndex entry = table.FindEntry(isolate, key);
+  InternalIndex entry = table->FindEntry(isolate, key);
   if (entry.is_not_found()) return false;
 
-  int nof = table.NumberOfElements();
-  int nod = table.NumberOfDeletedElements();
-  int index = table.EntryToIndex(entry);
+  int nof = table->NumberOfElements();
+  int nod = table->NumberOfDeletedElements();
+  int index = table->EntryToIndex(entry);
 
-  Object hole = ReadOnlyRoots(isolate).the_hole_value();
+  Tagged<Object> hole = ReadOnlyRoots(isolate).the_hole_value();
   for (int i = 0; i < entrysize; ++i) {
-    table.set(index + i, hole);
+    table->set(index + i, hole);
   }
 
-  table.SetNumberOfElements(nof - 1);
-  table.SetNumberOfDeletedElements(nod + 1);
+  table->SetNumberOfElements(nof - 1);
+  table->SetNumberOfDeletedElements(nod + 1);
 
   return true;
 }
 
 Address OrderedHashMap::GetHash(Isolate* isolate, Address raw_key) {
   DisallowGarbageCollection no_gc;
-  Object key(raw_key);
-  Object hash = key.GetHash();
+  Tagged<Object> key(raw_key);
+  Tagged<Object> hash = Object::GetHash(key);
   // If the object does not have an identity hash, it was never used as a key
-  if (hash.IsUndefined(isolate)) return Smi::FromInt(-1).ptr();
-  DCHECK(hash.IsSmi());
+  if (IsUndefined(hash, isolate)) return Smi::FromInt(-1).ptr();
+  DCHECK(IsSmi(hash));
   DCHECK_GE(Smi::cast(hash).value(), 0);
   return hash.ptr();
 }
@@ -378,46 +383,47 @@ MaybeHandle<OrderedHashMap> OrderedHashMap::Add(Isolate* isolate,
                                                 Handle<OrderedHashMap> table,
                                                 Handle<Object> key,
                                                 Handle<Object> value) {
-  int hash = key->GetOrCreateHash(isolate).value();
+  int hash = Object::GetOrCreateHash(*key, isolate).value();
   if (table->NumberOfElements() > 0) {
     int raw_entry = table->HashToEntryRaw(hash);
     // Walk the chain of the bucket and try finding the key.
     {
       DisallowGarbageCollection no_gc;
-      Object raw_key = *key;
+      Tagged<Object> raw_key = *key;
       while (raw_entry != kNotFound) {
-        Object candidate_key = table->KeyAt(InternalIndex(raw_entry));
+        Tagged<Object> candidate_key = table->KeyAt(InternalIndex(raw_entry));
         // Do not add if we have the key already
-        if (candidate_key.SameValueZero(raw_key)) return table;
+        if (Object::SameValueZero(candidate_key, raw_key)) return table;
         raw_entry = table->NextChainEntryRaw(raw_entry);
       }
     }
   }
 
   MaybeHandle<OrderedHashMap> table_candidate =
-      OrderedHashMap::EnsureGrowable(isolate, table);
+      OrderedHashMap::EnsureCapacityForAdding(isolate, table);
   if (!table_candidate.ToHandle(&table)) {
     return table_candidate;
   }
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
+  Tagged<OrderedHashMap> raw_table = *table;
   // Read the existing bucket values.
-  int bucket = raw_table.HashToBucket(hash);
-  int previous_entry = raw_table.HashToEntryRaw(hash);
-  int nof = raw_table.NumberOfElements();
+  int bucket = raw_table->HashToBucket(hash);
+  int previous_entry = raw_table->HashToEntryRaw(hash);
+  int nof = raw_table->NumberOfElements();
   // Insert a new entry at the end,
-  int new_entry = nof + raw_table.NumberOfDeletedElements();
-  int new_index = raw_table.EntryToIndexRaw(new_entry);
-  raw_table.set(new_index, *key);
-  raw_table.set(new_index + kValueOffset, *value);
-  raw_table.set(new_index + kChainOffset, Smi::FromInt(previous_entry));
+  int new_entry = nof + raw_table->NumberOfDeletedElements();
+  int new_index = raw_table->EntryToIndexRaw(new_entry);
+  raw_table->set(new_index, *key);
+  raw_table->set(new_index + kValueOffset, *value);
+  raw_table->set(new_index + kChainOffset, Smi::FromInt(previous_entry));
   // and point the bucket to the new entry.
-  raw_table.set(HashTableStartIndex() + bucket, Smi::FromInt(new_entry));
-  raw_table.SetNumberOfElements(nof + 1);
+  raw_table->set(HashTableStartIndex() + bucket, Smi::FromInt(new_entry));
+  raw_table->SetNumberOfElements(nof + 1);
   return table;
 }
 
-void OrderedHashMap::SetEntry(InternalIndex entry, Object key, Object value) {
+void OrderedHashMap::SetEntry(InternalIndex entry, Tagged<Object> key,
+                              Tagged<Object> value) {
   DisallowGarbageCollection no_gc;
   int index = EntryToIndex(entry);
   this->set(index, key);
@@ -425,11 +431,12 @@ void OrderedHashMap::SetEntry(InternalIndex entry, Object key, Object value) {
 }
 
 template <typename IsolateT>
-InternalIndex OrderedNameDictionary::FindEntry(IsolateT* isolate, Object key) {
+InternalIndex OrderedNameDictionary::FindEntry(IsolateT* isolate,
+                                               Tagged<Object> key) {
   DisallowGarbageCollection no_gc;
 
-  DCHECK(key.IsUniqueName());
-  Name raw_key = Name::cast(key);
+  DCHECK(IsUniqueName(key));
+  Tagged<Name> raw_key = Name::cast(key);
 
   if (NumberOfElements() == 0) {
     // This is not just an optimization but also ensures that we do the right
@@ -437,12 +444,11 @@ InternalIndex OrderedNameDictionary::FindEntry(IsolateT* isolate, Object key) {
     return InternalIndex::NotFound();
   }
 
-  int raw_entry = HashToEntryRaw(raw_key.hash());
+  int raw_entry = HashToEntryRaw(raw_key->hash());
   while (raw_entry != kNotFound) {
     InternalIndex entry(raw_entry);
-    Object candidate_key = KeyAt(entry);
-    DCHECK(candidate_key.IsTheHole() ||
-           Name::cast(candidate_key).IsUniqueName());
+    Tagged<Object> candidate_key = KeyAt(entry);
+    DCHECK(IsTheHole(candidate_key) || IsUniqueName(Name::cast(candidate_key)));
     if (candidate_key == raw_key) return entry;
 
     // TODO(gsathya): This is loading the bucket count from the hash
@@ -457,43 +463,44 @@ InternalIndex OrderedNameDictionary::FindEntry(IsolateT* isolate, Object key) {
 MaybeHandle<OrderedNameDictionary> OrderedNameDictionary::Add(
     Isolate* isolate, Handle<OrderedNameDictionary> table, Handle<Name> key,
     Handle<Object> value, PropertyDetails details) {
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   DCHECK(table->FindEntry(isolate, *key).is_not_found());
 
   MaybeHandle<OrderedNameDictionary> table_candidate =
-      OrderedNameDictionary::EnsureGrowable(isolate, table);
+      OrderedNameDictionary::EnsureCapacityForAdding(isolate, table);
   if (!table_candidate.ToHandle(&table)) {
     return table_candidate;
   }
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
+  Tagged<OrderedNameDictionary> raw_table = *table;
   // Read the existing bucket values.
   int hash = key->hash();
-  int bucket = raw_table.HashToBucket(hash);
-  int previous_entry = raw_table.HashToEntryRaw(hash);
-  int nof = raw_table.NumberOfElements();
+  int bucket = raw_table->HashToBucket(hash);
+  int previous_entry = raw_table->HashToEntryRaw(hash);
+  int nof = raw_table->NumberOfElements();
   // Insert a new entry at the end,
-  int new_entry = nof + raw_table.NumberOfDeletedElements();
-  int new_index = raw_table.EntryToIndexRaw(new_entry);
-  raw_table.set(new_index, *key);
-  raw_table.set(new_index + kValueOffset, *value);
+  int new_entry = nof + raw_table->NumberOfDeletedElements();
+  int new_index = raw_table->EntryToIndexRaw(new_entry);
+  raw_table->set(new_index, *key);
+  raw_table->set(new_index + kValueOffset, *value);
 
   // TODO(gsathya): Optimize how PropertyDetails are stored in this
   // dictionary to save memory (by reusing padding?) and performance
   // (by not doing the Smi conversion).
-  raw_table.set(new_index + kPropertyDetailsOffset, details.AsSmi());
+  raw_table->set(new_index + kPropertyDetailsOffset, details.AsSmi());
 
-  raw_table.set(new_index + kChainOffset, Smi::FromInt(previous_entry));
+  raw_table->set(new_index + kChainOffset, Smi::FromInt(previous_entry));
   // and point the bucket to the new entry.
-  raw_table.set(HashTableStartIndex() + bucket, Smi::FromInt(new_entry));
-  raw_table.SetNumberOfElements(nof + 1);
+  raw_table->set(HashTableStartIndex() + bucket, Smi::FromInt(new_entry));
+  raw_table->SetNumberOfElements(nof + 1);
   return table;
 }
 
-void OrderedNameDictionary::SetEntry(InternalIndex entry, Object key,
-                                     Object value, PropertyDetails details) {
+void OrderedNameDictionary::SetEntry(InternalIndex entry, Tagged<Object> key,
+                                     Tagged<Object> value,
+                                     PropertyDetails details) {
   DisallowGarbageCollection gc;
-  DCHECK_IMPLIES(!key.IsName(), key.IsTheHole());
+  DCHECK_IMPLIES(!IsName(key), IsTheHole(key));
   DisallowGarbageCollection no_gc;
   int index = EntryToIndex(entry);
   this->set(index, key);
@@ -510,7 +517,7 @@ Handle<OrderedNameDictionary> OrderedNameDictionary::DeleteEntry(
     InternalIndex entry) {
   DCHECK(entry.is_found());
 
-  Object hole = ReadOnlyRoots(isolate).the_hole_value();
+  Tagged<Object> hole = ReadOnlyRoots(isolate).the_hole_value();
   PropertyDetails details = PropertyDetails::Empty();
   table->SetEntry(entry, hole, hole, details);
 
@@ -571,7 +578,7 @@ MaybeHandle<OrderedNameDictionary> OrderedNameDictionary::AllocateEmpty(
 }
 
 template V8_EXPORT_PRIVATE MaybeHandle<OrderedHashSet>
-OrderedHashTable<OrderedHashSet, 1>::EnsureGrowable(
+OrderedHashTable<OrderedHashSet, 1>::EnsureCapacityForAdding(
     Isolate* isolate, Handle<OrderedHashSet> table);
 
 template V8_EXPORT_PRIVATE Handle<OrderedHashSet>
@@ -586,16 +593,17 @@ template V8_EXPORT_PRIVATE MaybeHandle<OrderedHashSet> OrderedHashSet::Allocate(
     Isolate* isolate, int capacity, AllocationType allocation);
 
 template V8_EXPORT_PRIVATE bool OrderedHashTable<OrderedHashSet, 1>::HasKey(
-    Isolate* isolate, OrderedHashSet table, Object key);
+    Isolate* isolate, Tagged<OrderedHashSet> table, Tagged<Object> key);
 
 template V8_EXPORT_PRIVATE bool OrderedHashTable<OrderedHashSet, 1>::Delete(
-    Isolate* isolate, OrderedHashSet table, Object key);
+    Isolate* isolate, Tagged<OrderedHashSet> table, Tagged<Object> key);
 
 template V8_EXPORT_PRIVATE InternalIndex
-OrderedHashTable<OrderedHashSet, 1>::FindEntry(Isolate* isolate, Object key);
+OrderedHashTable<OrderedHashSet, 1>::FindEntry(Isolate* isolate,
+                                               Tagged<Object> key);
 
 template V8_EXPORT_PRIVATE MaybeHandle<OrderedHashMap>
-OrderedHashTable<OrderedHashMap, 2>::EnsureGrowable(
+OrderedHashTable<OrderedHashMap, 2>::EnsureCapacityForAdding(
     Isolate* isolate, Handle<OrderedHashMap> table);
 
 template V8_EXPORT_PRIVATE Handle<OrderedHashMap>
@@ -610,27 +618,28 @@ template V8_EXPORT_PRIVATE MaybeHandle<OrderedHashMap> OrderedHashMap::Allocate(
     Isolate* isolate, int capacity, AllocationType allocation);
 
 template V8_EXPORT_PRIVATE bool OrderedHashTable<OrderedHashMap, 2>::HasKey(
-    Isolate* isolate, OrderedHashMap table, Object key);
+    Isolate* isolate, Tagged<OrderedHashMap> table, Tagged<Object> key);
 
 template V8_EXPORT_PRIVATE bool OrderedHashTable<OrderedHashMap, 2>::Delete(
-    Isolate* isolate, OrderedHashMap table, Object key);
+    Isolate* isolate, Tagged<OrderedHashMap> table, Tagged<Object> key);
 
 template V8_EXPORT_PRIVATE InternalIndex
-OrderedHashTable<OrderedHashMap, 2>::FindEntry(Isolate* isolate, Object key);
+OrderedHashTable<OrderedHashMap, 2>::FindEntry(Isolate* isolate,
+                                               Tagged<Object> key);
 
 template V8_EXPORT_PRIVATE Handle<OrderedNameDictionary>
 OrderedHashTable<OrderedNameDictionary, 3>::Shrink(
     Isolate* isolate, Handle<OrderedNameDictionary> table);
 
 template MaybeHandle<OrderedNameDictionary>
-OrderedHashTable<OrderedNameDictionary, 3>::EnsureGrowable(
+OrderedHashTable<OrderedNameDictionary, 3>::EnsureCapacityForAdding(
     Isolate* isolate, Handle<OrderedNameDictionary> table);
 
 template V8_EXPORT_PRIVATE InternalIndex
-OrderedNameDictionary::FindEntry(Isolate* isolate, Object key);
+OrderedNameDictionary::FindEntry(Isolate* isolate, Tagged<Object> key);
 
 template V8_EXPORT_PRIVATE InternalIndex
-OrderedNameDictionary::FindEntry(LocalIsolate* isolate, Object key);
+OrderedNameDictionary::FindEntry(LocalIsolate* isolate, Tagged<Object> key);
 
 template <>
 Handle<SmallOrderedHashSet>
@@ -668,7 +677,7 @@ void SmallOrderedHashTable<Derived>::Initialize(Isolate* isolate,
          PaddingSize());
 
   Address hashtable_start = GetHashTableStartAddress(capacity);
-  memset(reinterpret_cast<byte*>(hashtable_start), kNotFound,
+  memset(reinterpret_cast<uint8_t*>(hashtable_start), kNotFound,
          num_buckets + num_chains);
 
   MemsetTagged(RawField(DataTableStartOffset()),
@@ -705,29 +714,30 @@ MaybeHandle<SmallOrderedHashSet> SmallOrderedHashSet::Add(
   }
 
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
-  int hash = key->GetOrCreateHash(isolate).value();
-  int nof = raw_table.NumberOfElements();
+  Tagged<SmallOrderedHashSet> raw_table = *table;
+  int hash = Object::GetOrCreateHash(*key, isolate).value();
+  int nof = raw_table->NumberOfElements();
 
   // Read the existing bucket values.
-  int bucket = raw_table.HashToBucket(hash);
-  int previous_entry = raw_table.HashToFirstEntry(hash);
+  int bucket = raw_table->HashToBucket(hash);
+  int previous_entry = raw_table->HashToFirstEntry(hash);
 
   // Insert a new entry at the end,
-  int new_entry = nof + raw_table.NumberOfDeletedElements();
+  int new_entry = nof + raw_table->NumberOfDeletedElements();
 
-  raw_table.SetDataEntry(new_entry, SmallOrderedHashSet::kKeyIndex, *key);
-  raw_table.SetFirstEntry(bucket, new_entry);
-  raw_table.SetNextEntry(new_entry, previous_entry);
+  raw_table->SetDataEntry(new_entry, SmallOrderedHashSet::kKeyIndex, *key);
+  raw_table->SetFirstEntry(bucket, new_entry);
+  raw_table->SetNextEntry(new_entry, previous_entry);
 
   // and update book keeping.
-  raw_table.SetNumberOfElements(nof + 1);
+  raw_table->SetNumberOfElements(nof + 1);
 
   return table;
 }
 
-bool SmallOrderedHashSet::Delete(Isolate* isolate, SmallOrderedHashSet table,
-                                 Object key) {
+bool SmallOrderedHashSet::Delete(Isolate* isolate,
+                                 Tagged<SmallOrderedHashSet> table,
+                                 Tagged<Object> key) {
   return SmallOrderedHashTable<SmallOrderedHashSet>::Delete(isolate, table,
                                                             key);
 }
@@ -749,30 +759,31 @@ MaybeHandle<SmallOrderedHashMap> SmallOrderedHashMap::Add(
     }
   }
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
-  int hash = key->GetOrCreateHash(isolate).value();
-  int nof = raw_table.NumberOfElements();
+  Tagged<SmallOrderedHashMap> raw_table = *table;
+  int hash = Object::GetOrCreateHash(*key, isolate).value();
+  int nof = raw_table->NumberOfElements();
 
   // Read the existing bucket values.
-  int bucket = raw_table.HashToBucket(hash);
-  int previous_entry = raw_table.HashToFirstEntry(hash);
+  int bucket = raw_table->HashToBucket(hash);
+  int previous_entry = raw_table->HashToFirstEntry(hash);
 
   // Insert a new entry at the end,
-  int new_entry = nof + raw_table.NumberOfDeletedElements();
+  int new_entry = nof + raw_table->NumberOfDeletedElements();
 
-  raw_table.SetDataEntry(new_entry, SmallOrderedHashMap::kValueIndex, *value);
-  raw_table.SetDataEntry(new_entry, SmallOrderedHashMap::kKeyIndex, *key);
-  raw_table.SetFirstEntry(bucket, new_entry);
-  raw_table.SetNextEntry(new_entry, previous_entry);
+  raw_table->SetDataEntry(new_entry, SmallOrderedHashMap::kValueIndex, *value);
+  raw_table->SetDataEntry(new_entry, SmallOrderedHashMap::kKeyIndex, *key);
+  raw_table->SetFirstEntry(bucket, new_entry);
+  raw_table->SetNextEntry(new_entry, previous_entry);
 
   // and update book keeping.
-  raw_table.SetNumberOfElements(nof + 1);
+  raw_table->SetNumberOfElements(nof + 1);
 
   return table;
 }
 
-bool SmallOrderedHashMap::Delete(Isolate* isolate, SmallOrderedHashMap table,
-                                 Object key) {
+bool SmallOrderedHashMap::Delete(Isolate* isolate,
+                                 Tagged<SmallOrderedHashMap> table,
+                                 Tagged<Object> key) {
   return SmallOrderedHashTable<SmallOrderedHashMap>::Delete(isolate, table,
                                                             key);
 }
@@ -783,18 +794,18 @@ bool SmallOrderedHashMap::HasKey(Isolate* isolate, Handle<Object> key) {
 
 template <>
 InternalIndex V8_EXPORT_PRIVATE
-SmallOrderedHashTable<SmallOrderedNameDictionary>::FindEntry(Isolate* isolate,
-                                                             Object key) {
+SmallOrderedHashTable<SmallOrderedNameDictionary>::FindEntry(
+    Isolate* isolate, Tagged<Object> key) {
   DisallowGarbageCollection no_gc;
-  DCHECK(key.IsUniqueName());
-  Name raw_key = Name::cast(key);
+  DCHECK(IsUniqueName(key));
+  Tagged<Name> raw_key = Name::cast(key);
 
-  int raw_entry = HashToFirstEntry(raw_key.hash());
+  int raw_entry = HashToFirstEntry(raw_key->hash());
 
   // Walk the chain in the bucket to find the key.
   while (raw_entry != kNotFound) {
     InternalIndex entry(raw_entry);
-    Object candidate_key = KeyAt(entry);
+    Tagged<Object> candidate_key = KeyAt(entry);
     if (candidate_key == key) return entry;
     raw_entry = GetNextEntry(raw_entry);
   }
@@ -805,7 +816,7 @@ SmallOrderedHashTable<SmallOrderedNameDictionary>::FindEntry(Isolate* isolate,
 MaybeHandle<SmallOrderedNameDictionary> SmallOrderedNameDictionary::Add(
     Isolate* isolate, Handle<SmallOrderedNameDictionary> table,
     Handle<Name> key, Handle<Object> value, PropertyDetails details) {
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   DCHECK(table->FindEntry(isolate, *key).is_not_found());
 
   if (table->UsedCapacity() >= table->Capacity()) {
@@ -844,11 +855,12 @@ MaybeHandle<SmallOrderedNameDictionary> SmallOrderedNameDictionary::Add(
   return table;
 }
 
-void SmallOrderedNameDictionary::SetEntry(InternalIndex entry, Object key,
-                                          Object value,
+void SmallOrderedNameDictionary::SetEntry(InternalIndex entry,
+                                          Tagged<Object> key,
+                                          Tagged<Object> value,
                                           PropertyDetails details) {
   int raw_entry = entry.as_int();
-  DCHECK_IMPLIES(!key.IsName(), key.IsTheHole());
+  DCHECK_IMPLIES(!IsName(key), IsTheHole(key));
   SetDataEntry(raw_entry, SmallOrderedNameDictionary::kValueIndex, value);
   SetDataEntry(raw_entry, SmallOrderedNameDictionary::kKeyIndex, key);
 
@@ -866,22 +878,23 @@ bool SmallOrderedHashTable<Derived>::HasKey(Isolate* isolate,
 }
 
 template <class Derived>
-bool SmallOrderedHashTable<Derived>::Delete(Isolate* isolate, Derived table,
-                                            Object key) {
+bool SmallOrderedHashTable<Derived>::Delete(Isolate* isolate,
+                                            Tagged<Derived> table,
+                                            Tagged<Object> key) {
   DisallowGarbageCollection no_gc;
-  InternalIndex entry = table.FindEntry(isolate, key);
+  InternalIndex entry = table->FindEntry(isolate, key);
   if (entry.is_not_found()) return false;
 
-  int nof = table.NumberOfElements();
-  int nod = table.NumberOfDeletedElements();
+  int nof = table->NumberOfElements();
+  int nod = table->NumberOfDeletedElements();
 
-  Object hole = ReadOnlyRoots(isolate).the_hole_value();
+  Tagged<Object> hole = ReadOnlyRoots(isolate).the_hole_value();
   for (int j = 0; j < Derived::kEntrySize; j++) {
-    table.SetDataEntry(entry.as_int(), j, hole);
+    table->SetDataEntry(entry.as_int(), j, hole);
   }
 
-  table.SetNumberOfElements(nof - 1);
-  table.SetNumberOfDeletedElements(nod + 1);
+  table->SetNumberOfElements(nof - 1);
+  table->SetNumberOfDeletedElements(nod + 1);
 
   return true;
 }
@@ -892,7 +905,7 @@ Handle<SmallOrderedNameDictionary> SmallOrderedNameDictionary::DeleteEntry(
   DCHECK(entry.is_found());
   {
     DisallowGarbageCollection no_gc;
-    Object hole = ReadOnlyRoots(isolate).the_hole_value();
+    Tagged<Object> hole = ReadOnlyRoots(isolate).the_hole_value();
     PropertyDetails details = PropertyDetails::Empty();
     table->SetEntry(entry, hole, hole, details);
 
@@ -919,10 +932,10 @@ Handle<Derived> SmallOrderedHashTable<Derived>::Rehash(Isolate* isolate,
   {
     DisallowGarbageCollection no_gc;
     for (InternalIndex old_entry : table->IterateEntries()) {
-      Object key = table->KeyAt(old_entry);
-      if (key.IsTheHole(isolate)) continue;
+      Tagged<Object> key = table->KeyAt(old_entry);
+      if (IsTheHole(key, isolate)) continue;
 
-      int hash = Smi::ToInt(key.GetHash());
+      int hash = Smi::ToInt(Object::GetHash(key));
       int bucket = new_table->HashToBucket(hash);
       int chain = new_table->GetFirstEntry(bucket);
 
@@ -930,7 +943,7 @@ Handle<Derived> SmallOrderedHashTable<Derived>::Rehash(Isolate* isolate,
       new_table->SetNextEntry(new_entry, chain);
 
       for (int i = 0; i < Derived::kEntrySize; ++i) {
-        Object value = table->GetDataEntry(old_entry.as_int(), i);
+        Tagged<Object> value = table->GetDataEntry(old_entry.as_int(), i);
         new_table->SetDataEntry(new_entry, i, value);
       }
 
@@ -1002,18 +1015,18 @@ MaybeHandle<Derived> SmallOrderedHashTable<Derived>::Grow(
 
 template <class Derived>
 InternalIndex SmallOrderedHashTable<Derived>::FindEntry(Isolate* isolate,
-                                                        Object key) {
+                                                        Tagged<Object> key) {
   DisallowGarbageCollection no_gc;
-  Object hash = key.GetHash();
+  Tagged<Object> hash = Object::GetHash(key);
 
-  if (hash.IsUndefined(isolate)) return InternalIndex::NotFound();
+  if (IsUndefined(hash, isolate)) return InternalIndex::NotFound();
   int raw_entry = HashToFirstEntry(Smi::ToInt(hash));
 
   // Walk the chain in the bucket to find the key.
   while (raw_entry != kNotFound) {
     InternalIndex entry(raw_entry);
-    Object candidate_key = KeyAt(entry);
-    if (candidate_key.SameValueZero(key)) return entry;
+    Tagged<Object> candidate_key = KeyAt(entry);
+    if (Object::SameValueZero(candidate_key, key)) return entry;
     raw_entry = GetNextEntry(raw_entry);
   }
   return InternalIndex::NotFound();
@@ -1035,9 +1048,8 @@ template V8_EXPORT_PRIVATE void
 SmallOrderedHashTable<SmallOrderedHashSet>::Initialize(Isolate* isolate,
                                                        int capacity);
 template V8_EXPORT_PRIVATE bool
-SmallOrderedHashTable<SmallOrderedHashSet>::Delete(Isolate* isolate,
-                                                   SmallOrderedHashSet table,
-                                                   Object key);
+SmallOrderedHashTable<SmallOrderedHashSet>::Delete(
+    Isolate* isolate, Tagged<SmallOrderedHashSet> table, Tagged<Object> key);
 
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) bool SmallOrderedHashTable<
     SmallOrderedHashMap>::HasKey(Isolate* isolate, Handle<Object> key);
@@ -1055,9 +1067,8 @@ SmallOrderedHashTable<SmallOrderedHashMap>::Initialize(Isolate* isolate,
                                                        int capacity);
 
 template V8_EXPORT_PRIVATE bool
-SmallOrderedHashTable<SmallOrderedHashMap>::Delete(Isolate* isolate,
-                                                   SmallOrderedHashMap table,
-                                                   Object key);
+SmallOrderedHashTable<SmallOrderedHashMap>::Delete(
+    Isolate* isolate, Tagged<SmallOrderedHashMap> table, Tagged<Object> key);
 
 template V8_EXPORT_PRIVATE void
 SmallOrderedHashTable<SmallOrderedNameDictionary>::Initialize(Isolate* isolate,
@@ -1145,7 +1156,7 @@ MaybeHandle<OrderedHashMap> OrderedHashMapHandler::AdjustRepresentation(
   // the proper capacity.
   for (InternalIndex entry : table->IterateEntries()) {
     Handle<Object> key = handle(table->KeyAt(entry), isolate);
-    if (key->IsTheHole(isolate)) continue;
+    if (IsTheHole(*key, isolate)) continue;
     Handle<Object> value = handle(
         table->GetDataEntry(entry.as_int(), SmallOrderedHashMap::kValueIndex),
         isolate);
@@ -1172,7 +1183,7 @@ MaybeHandle<OrderedHashSet> OrderedHashSetHandler::AdjustRepresentation(
   // the proper capacity.
   for (InternalIndex entry : table->IterateEntries()) {
     Handle<Object> key = handle(table->KeyAt(entry), isolate);
-    if (key->IsTheHole(isolate)) continue;
+    if (IsTheHole(*key, isolate)) continue;
     new_table_candidate = OrderedHashSet::Add(isolate, new_table, key);
     if (!new_table_candidate.ToHandle(&new_table)) {
       return new_table_candidate;
@@ -1197,7 +1208,7 @@ OrderedNameDictionaryHandler::AdjustRepresentation(
   // the proper capacity.
   for (InternalIndex entry : table->IterateEntries()) {
     Handle<Name> key(Name::cast(table->KeyAt(entry)), isolate);
-    if (key->IsTheHole(isolate)) continue;
+    if (IsTheHole(*key, isolate)) continue;
     Handle<Object> value(table->ValueAt(entry), isolate);
     PropertyDetails details = table->DetailsAt(entry);
     new_table_candidate =
@@ -1214,7 +1225,7 @@ MaybeHandle<HeapObject> OrderedHashMapHandler::Add(Isolate* isolate,
                                                    Handle<HeapObject> table,
                                                    Handle<Object> key,
                                                    Handle<Object> value) {
-  if (table->IsSmallOrderedHashMap()) {
+  if (IsSmallOrderedHashMap(*table)) {
     Handle<SmallOrderedHashMap> small_map =
         Handle<SmallOrderedHashMap>::cast(table);
     MaybeHandle<SmallOrderedHashMap> new_map =
@@ -1230,7 +1241,7 @@ MaybeHandle<HeapObject> OrderedHashMapHandler::Add(Isolate* isolate,
     }
   }
 
-  DCHECK(table->IsOrderedHashMap());
+  DCHECK(IsOrderedHashMap(*table));
   return OrderedHashMap::Add(isolate, Handle<OrderedHashMap>::cast(table), key,
                              value);
 }
@@ -1238,7 +1249,7 @@ MaybeHandle<HeapObject> OrderedHashMapHandler::Add(Isolate* isolate,
 MaybeHandle<HeapObject> OrderedHashSetHandler::Add(Isolate* isolate,
                                                    Handle<HeapObject> table,
                                                    Handle<Object> key) {
-  if (table->IsSmallOrderedHashSet()) {
+  if (IsSmallOrderedHashSet(*table)) {
     Handle<SmallOrderedHashSet> small_set =
         Handle<SmallOrderedHashSet>::cast(table);
     MaybeHandle<SmallOrderedHashSet> new_set =
@@ -1254,14 +1265,14 @@ MaybeHandle<HeapObject> OrderedHashSetHandler::Add(Isolate* isolate,
     }
   }
 
-  DCHECK(table->IsOrderedHashSet());
+  DCHECK(IsOrderedHashSet(*table));
   return OrderedHashSet::Add(isolate, Handle<OrderedHashSet>::cast(table), key);
 }
 
 MaybeHandle<HeapObject> OrderedNameDictionaryHandler::Add(
     Isolate* isolate, Handle<HeapObject> table, Handle<Name> key,
     Handle<Object> value, PropertyDetails details) {
-  if (table->IsSmallOrderedNameDictionary()) {
+  if (IsSmallOrderedNameDictionary(*table)) {
     Handle<SmallOrderedNameDictionary> small_dict =
         Handle<SmallOrderedNameDictionary>::cast(table);
     MaybeHandle<SmallOrderedNameDictionary> new_dict =
@@ -1278,127 +1289,129 @@ MaybeHandle<HeapObject> OrderedNameDictionaryHandler::Add(
     }
   }
 
-  DCHECK(table->IsOrderedNameDictionary());
+  DCHECK(IsOrderedNameDictionary(*table));
   return OrderedNameDictionary::Add(
       isolate, Handle<OrderedNameDictionary>::cast(table), key, value, details);
 }
 
-void OrderedNameDictionaryHandler::SetEntry(HeapObject table,
-                                            InternalIndex entry, Object key,
-                                            Object value,
+void OrderedNameDictionaryHandler::SetEntry(Tagged<HeapObject> table,
+                                            InternalIndex entry,
+                                            Tagged<Object> key,
+                                            Tagged<Object> value,
                                             PropertyDetails details) {
   DisallowGarbageCollection no_gc;
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).SetEntry(entry, key, value,
-                                                            details);
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->SetEntry(entry, key, value,
+                                                             details);
   }
 
-  DCHECK(table.IsOrderedNameDictionary());
-  return OrderedNameDictionary::cast(table).SetEntry(InternalIndex(entry), key,
-                                                     value, details);
+  DCHECK(IsOrderedNameDictionary(table));
+  return OrderedNameDictionary::cast(table)->SetEntry(InternalIndex(entry), key,
+                                                      value, details);
 }
 
 InternalIndex OrderedNameDictionaryHandler::FindEntry(Isolate* isolate,
-                                                      HeapObject table,
-                                                      Name key) {
+                                                      Tagged<HeapObject> table,
+                                                      Tagged<Name> key) {
   DisallowGarbageCollection no_gc;
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).FindEntry(isolate, key);
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->FindEntry(isolate, key);
   }
 
-  DCHECK(table.IsOrderedNameDictionary());
-  return OrderedNameDictionary::cast(table).FindEntry(isolate, key);
+  DCHECK(IsOrderedNameDictionary(table));
+  return OrderedNameDictionary::cast(table)->FindEntry(isolate, key);
 }
 
-Object OrderedNameDictionaryHandler::ValueAt(HeapObject table,
-                                             InternalIndex entry) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).ValueAt(entry);
+Tagged<Object> OrderedNameDictionaryHandler::ValueAt(Tagged<HeapObject> table,
+                                                     InternalIndex entry) {
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->ValueAt(entry);
   }
 
-  DCHECK(table.IsOrderedNameDictionary());
-  return OrderedNameDictionary::cast(table).ValueAt(entry);
+  DCHECK(IsOrderedNameDictionary(table));
+  return OrderedNameDictionary::cast(table)->ValueAt(entry);
 }
 
-void OrderedNameDictionaryHandler::ValueAtPut(HeapObject table,
+void OrderedNameDictionaryHandler::ValueAtPut(Tagged<HeapObject> table,
                                               InternalIndex entry,
-                                              Object value) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).ValueAtPut(entry, value);
+                                              Tagged<Object> value) {
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->ValueAtPut(entry, value);
   }
 
-  DCHECK(table.IsOrderedNameDictionary());
-  OrderedNameDictionary::cast(table).ValueAtPut(entry, value);
+  DCHECK(IsOrderedNameDictionary(table));
+  OrderedNameDictionary::cast(table)->ValueAtPut(entry, value);
 }
 
-PropertyDetails OrderedNameDictionaryHandler::DetailsAt(HeapObject table,
-                                                        InternalIndex entry) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).DetailsAt(entry);
+PropertyDetails OrderedNameDictionaryHandler::DetailsAt(
+    Tagged<HeapObject> table, InternalIndex entry) {
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->DetailsAt(entry);
   }
 
-  DCHECK(table.IsOrderedNameDictionary());
-  return OrderedNameDictionary::cast(table).DetailsAt(entry);
+  DCHECK(IsOrderedNameDictionary(table));
+  return OrderedNameDictionary::cast(table)->DetailsAt(entry);
 }
 
-void OrderedNameDictionaryHandler::DetailsAtPut(HeapObject table,
+void OrderedNameDictionaryHandler::DetailsAtPut(Tagged<HeapObject> table,
                                                 InternalIndex entry,
                                                 PropertyDetails details) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).DetailsAtPut(entry, details);
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->DetailsAtPut(entry,
+                                                                 details);
   }
 
-  DCHECK(table.IsOrderedNameDictionary());
-  OrderedNameDictionary::cast(table).DetailsAtPut(entry, details);
+  DCHECK(IsOrderedNameDictionary(table));
+  OrderedNameDictionary::cast(table)->DetailsAtPut(entry, details);
 }
 
-int OrderedNameDictionaryHandler::Hash(HeapObject table) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).Hash();
+int OrderedNameDictionaryHandler::Hash(Tagged<HeapObject> table) {
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->Hash();
   }
 
-  DCHECK(table.IsOrderedNameDictionary());
-  return OrderedNameDictionary::cast(table).Hash();
+  DCHECK(IsOrderedNameDictionary(table));
+  return OrderedNameDictionary::cast(table)->Hash();
 }
 
-void OrderedNameDictionaryHandler::SetHash(HeapObject table, int hash) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).SetHash(hash);
+void OrderedNameDictionaryHandler::SetHash(Tagged<HeapObject> table, int hash) {
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->SetHash(hash);
   }
 
-  DCHECK(table.IsOrderedNameDictionary());
-  OrderedNameDictionary::cast(table).SetHash(hash);
+  DCHECK(IsOrderedNameDictionary(table));
+  OrderedNameDictionary::cast(table)->SetHash(hash);
 }
 
-Name OrderedNameDictionaryHandler::KeyAt(HeapObject table,
-                                         InternalIndex entry) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return Name::cast(SmallOrderedNameDictionary::cast(table).KeyAt(entry));
+Tagged<Name> OrderedNameDictionaryHandler::KeyAt(Tagged<HeapObject> table,
+                                                 InternalIndex entry) {
+  if (IsSmallOrderedNameDictionary(table)) {
+    return Name::cast(SmallOrderedNameDictionary::cast(table)->KeyAt(entry));
   }
 
   return Name::cast(
-      OrderedNameDictionary::cast(table).KeyAt(InternalIndex(entry)));
+      OrderedNameDictionary::cast(table)->KeyAt(InternalIndex(entry)));
 }
 
-int OrderedNameDictionaryHandler::NumberOfElements(HeapObject table) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).NumberOfElements();
+int OrderedNameDictionaryHandler::NumberOfElements(Tagged<HeapObject> table) {
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->NumberOfElements();
   }
 
-  return OrderedNameDictionary::cast(table).NumberOfElements();
+  return OrderedNameDictionary::cast(table)->NumberOfElements();
 }
 
-int OrderedNameDictionaryHandler::Capacity(HeapObject table) {
-  if (table.IsSmallOrderedNameDictionary()) {
-    return SmallOrderedNameDictionary::cast(table).Capacity();
+int OrderedNameDictionaryHandler::Capacity(Tagged<HeapObject> table) {
+  if (IsSmallOrderedNameDictionary(table)) {
+    return SmallOrderedNameDictionary::cast(table)->Capacity();
   }
 
-  return OrderedNameDictionary::cast(table).Capacity();
+  return OrderedNameDictionary::cast(table)->Capacity();
 }
 
 Handle<HeapObject> OrderedNameDictionaryHandler::Shrink(
     Isolate* isolate, Handle<HeapObject> table) {
-  if (table->IsSmallOrderedNameDictionary()) {
+  if (IsSmallOrderedNameDictionary(*table)) {
     Handle<SmallOrderedNameDictionary> small_dict =
         Handle<SmallOrderedNameDictionary>::cast(table);
     return SmallOrderedNameDictionary::Shrink(isolate, small_dict);
@@ -1412,7 +1425,7 @@ Handle<HeapObject> OrderedNameDictionaryHandler::Shrink(
 Handle<HeapObject> OrderedNameDictionaryHandler::DeleteEntry(
     Isolate* isolate, Handle<HeapObject> table, InternalIndex entry) {
   DisallowGarbageCollection no_gc;
-  if (table->IsSmallOrderedNameDictionary()) {
+  if (IsSmallOrderedNameDictionary(*table)) {
     Handle<SmallOrderedNameDictionary> small_dict =
         Handle<SmallOrderedNameDictionary>::cast(table);
     return SmallOrderedNameDictionary::DeleteEntry(isolate, small_dict, entry);
@@ -1427,23 +1440,23 @@ Handle<HeapObject> OrderedNameDictionaryHandler::DeleteEntry(
 template <class Derived, class TableType>
 void OrderedHashTableIterator<Derived, TableType>::Transition() {
   DisallowGarbageCollection no_gc;
-  TableType table = TableType::cast(this->table());
-  if (!table.IsObsolete()) return;
+  Tagged<TableType> table = TableType::cast(this->table());
+  if (!table->IsObsolete()) return;
 
   int index = Smi::ToInt(this->index());
   DCHECK_LE(0, index);
-  while (table.IsObsolete()) {
-    TableType next_table = table.NextTable();
+  while (table->IsObsolete()) {
+    Tagged<TableType> next_table = table->NextTable();
 
     if (index > 0) {
-      int nod = table.NumberOfDeletedElements();
+      int nod = table->NumberOfDeletedElements();
 
       if (nod == TableType::kClearedTableSentinel) {
         index = 0;
       } else {
         int old_index = index;
         for (int i = 0; i < nod; ++i) {
-          int removed_index = table.RemovedIndexAt(i);
+          int removed_index = table->RemovedIndexAt(i);
           if (removed_index >= old_index) break;
           --index;
         }
@@ -1466,10 +1479,10 @@ bool OrderedHashTableIterator<Derived, TableType>::HasMore() {
 
   TableType table = TableType::cast(this->table());
   int index = Smi::ToInt(this->index());
-  int used_capacity = table.UsedCapacity();
+  int used_capacity = table->UsedCapacity();
 
   while (index < used_capacity &&
-         table.KeyAt(InternalIndex(index)).IsTheHole(ro_roots)) {
+         IsTheHole(table->KeyAt(InternalIndex(index)), ro_roots)) {
     index++;
   }
 
@@ -1487,7 +1500,7 @@ OrderedHashTableIterator<JSSetIterator, OrderedHashSet>::HasMore();
 template void
 OrderedHashTableIterator<JSSetIterator, OrderedHashSet>::MoveNext();
 
-template Object
+template Tagged<Object>
 OrderedHashTableIterator<JSSetIterator, OrderedHashSet>::CurrentKey();
 
 template void
@@ -1499,7 +1512,7 @@ OrderedHashTableIterator<JSMapIterator, OrderedHashMap>::HasMore();
 template void
 OrderedHashTableIterator<JSMapIterator, OrderedHashMap>::MoveNext();
 
-template Object
+template Tagged<Object>
 OrderedHashTableIterator<JSMapIterator, OrderedHashMap>::CurrentKey();
 
 template void
diff --git a/deps/v8/src/objects/ordered-hash-table.h b/deps/v8/src/objects/ordered-hash-table.h
index 41cb6cf6e271ad..d07c7d631b8a6c 100644
--- a/deps/v8/src/objects/ordered-hash-table.h
+++ b/deps/v8/src/objects/ordered-hash-table.h
@@ -68,8 +68,8 @@ class OrderedHashTable : public FixedArray {
  public:
   // Returns an OrderedHashTable (possibly |table|) with enough space
   // to add at least one new element.
-  static MaybeHandle<Derived> EnsureGrowable(Isolate* isolate,
-                                             Handle<Derived> table);
+  static MaybeHandle<Derived> EnsureCapacityForAdding(Isolate* isolate,
+                                                      Handle<Derived> table);
 
   // Returns an OrderedHashTable (possibly |table|) that's shrunken
   // if possible.
@@ -80,17 +80,19 @@ class OrderedHashTable : public FixedArray {
   static Handle<Derived> Clear(Isolate* isolate, Handle<Derived> table);
 
   // Returns true if the OrderedHashTable contains the key
-  static bool HasKey(Isolate* isolate, Derived table, Object key);
+  static bool HasKey(Isolate* isolate, Tagged<Derived> table,
+                     Tagged<Object> key);
 
   // Returns whether a potential key |k| returned by KeyAt is a real
   // key (meaning that it is not a hole).
-  static inline bool IsKey(ReadOnlyRoots roots, Object k);
+  static inline bool IsKey(ReadOnlyRoots roots, Tagged<Object> k);
 
   // Returns a true value if the OrderedHashTable contains the key and
   // the key has been deleted. This does not shrink the table.
-  static bool Delete(Isolate* isolate, Derived table, Object key);
+  static bool Delete(Isolate* isolate, Tagged<Derived> table,
+                     Tagged<Object> key);
 
-  InternalIndex FindEntry(Isolate* isolate, Object key);
+  InternalIndex FindEntry(Isolate* isolate, Tagged<Object> key);
 
   int NumberOfElements() const {
     return Smi::ToInt(get(NumberOfElementsIndex()));
@@ -117,19 +119,20 @@ class OrderedHashTable : public FixedArray {
   }
 
   // use IsKey to check if this is a deleted entry.
-  Object KeyAt(InternalIndex entry) {
+  Tagged<Object> KeyAt(InternalIndex entry) {
     DCHECK_LT(entry.as_int(), this->UsedCapacity());
     return get(EntryToIndex(entry));
   }
 
   // Similar to KeyAt, but indicates whether the given entry is valid
   // (not deleted one)
-  inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry, Object* out_key);
+  inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry,
+                    Tagged<Object>* out_key);
 
-  bool IsObsolete() { return !get(NextTableIndex()).IsSmi(); }
+  bool IsObsolete() { return !IsSmi(get(NextTableIndex())); }
 
   // The next newer table. This is only valid if the table is obsolete.
-  Derived NextTable() { return Derived::cast(get(NextTableIndex())); }
+  Tagged<Derived> NextTable() { return Derived::cast(get(NextTableIndex())); }
 
   // When the table is obsolete we store the indexes of the removed holes.
   int RemovedIndexAt(int index) {
@@ -214,7 +217,7 @@ class OrderedHashTable : public FixedArray {
 
   int HashToEntryRaw(int hash) {
     int bucket = HashToBucket(hash);
-    Object entry = this->get(HashTableStartIndex() + bucket);
+    Tagged<Object> entry = this->get(HashTableStartIndex() + bucket);
     int entry_int = Smi::ToInt(entry);
     DCHECK(entry_int == kNotFound || entry_int >= 0);
     return entry_int;
@@ -222,7 +225,7 @@ class OrderedHashTable : public FixedArray {
 
   int NextChainEntryRaw(int entry) {
     DCHECK_LT(entry, this->UsedCapacity());
-    Object next_entry = get(EntryToIndexRaw(entry) + kChainOffset);
+    Tagged<Object> next_entry = get(EntryToIndexRaw(entry) + kChainOffset);
     int next_entry_int = Smi::ToInt(next_entry);
     DCHECK(next_entry_int == kNotFound || next_entry_int >= 0);
     return next_entry_int;
@@ -291,7 +294,7 @@ class V8_EXPORT_PRIVATE OrderedHashSet
   static MaybeHandle<OrderedHashSet> AllocateEmpty(
       Isolate* isolate, AllocationType allocation = AllocationType::kReadOnly);
 
-  static HeapObject GetEmpty(ReadOnlyRoots ro_roots);
+  static Tagged<HeapObject> GetEmpty(ReadOnlyRoots ro_roots);
   static inline Handle<Map> GetMap(ReadOnlyRoots roots);
   static inline bool Is(Handle<HeapObject> table);
   static const int kPrefixSize = 0;
@@ -328,15 +331,15 @@ class V8_EXPORT_PRIVATE OrderedHashMap
   static MaybeHandle<OrderedHashMap> Rehash(Isolate* isolate,
                                             Handle<OrderedHashMap> table);
 
-  void SetEntry(InternalIndex entry, Object key, Object value);
+  void SetEntry(InternalIndex entry, Tagged<Object> key, Tagged<Object> value);
 
-  Object ValueAt(InternalIndex entry);
+  Tagged<Object> ValueAt(InternalIndex entry);
 
   // This takes and returns raw Address values containing tagged Object
   // pointers because it is called via ExternalReference.
   static Address GetHash(Isolate* isolate, Address raw_key);
 
-  static HeapObject GetEmpty(ReadOnlyRoots ro_roots);
+  static Tagged<HeapObject> GetEmpty(ReadOnlyRoots ro_roots);
   static inline Handle<Map> GetMap(ReadOnlyRoots roots);
   static inline bool Is(Handle<HeapObject> table);
 
@@ -414,14 +417,15 @@ class SmallOrderedHashTable : public HeapObject {
 
   // Returns a true value if the table contains the key and
   // the key has been deleted. This does not shrink the table.
-  static bool Delete(Isolate* isolate, Derived table, Object key);
+  static bool Delete(Isolate* isolate, Tagged<Derived> table,
+                     Tagged<Object> key);
 
   // Returns an SmallOrderedHashTable (possibly |table|) with enough
   // space to add at least one new element. Returns empty handle if
   // we've already reached MaxCapacity.
   static MaybeHandle<Derived> Grow(Isolate* isolate, Handle<Derived> table);
 
-  InternalIndex FindEntry(Isolate* isolate, Object key);
+  InternalIndex FindEntry(Isolate* isolate, Tagged<Object> key);
   static Handle<Derived> Shrink(Isolate* isolate, Handle<Derived> table);
 
   // Iterates only fields in the DataTable.
@@ -468,16 +472,17 @@ class SmallOrderedHashTable : public HeapObject {
 
   int NumberOfBuckets() const { return getByte(NumberOfBucketsOffset(), 0); }
 
-  V8_INLINE Object KeyAt(InternalIndex entry) const;
+  V8_INLINE Tagged<Object> KeyAt(InternalIndex entry) const;
 
   InternalIndex::Range IterateEntries() {
     return InternalIndex::Range(UsedCapacity());
   }
 
+  DECL_CAST(SmallOrderedHashTable)
   DECL_VERIFIER(SmallOrderedHashTable)
 
   static const int kMinCapacity = 4;
-  static const byte kNotFound = 0xFF;
+  static const uint8_t kNotFound = 0xFF;
 
   // We use the value 255 to indicate kNotFound for chain and bucket
   // values, which means that this value can't be used a valid
@@ -503,7 +508,7 @@ class SmallOrderedHashTable : public HeapObject {
   static Handle<Derived> Rehash(Isolate* isolate, Handle<Derived> table,
                                 int new_capacity);
 
-  void SetDataEntry(int entry, int relative_index, Object value);
+  void SetDataEntry(int entry, int relative_index, Tagged<Object> value);
 
   // TODO(gsathya): Calculate all the various possible values for this
   // at compile time since capacity can only be 4 different values.
@@ -517,7 +522,7 @@ class SmallOrderedHashTable : public HeapObject {
     return field_address(DataTableStartOffset() + DataTableSizeFor(capacity));
   }
 
-  void SetFirstEntry(int bucket, byte value) {
+  void SetFirstEntry(int bucket, uint8_t value) {
     DCHECK_LE(static_cast<unsigned>(bucket), NumberOfBuckets());
     setByte(GetBucketsStartOffset(), bucket, value);
   }
@@ -551,7 +556,7 @@ class SmallOrderedHashTable : public HeapObject {
     return getByte(GetChainTableOffset(), entry);
   }
 
-  V8_INLINE Object GetDataEntry(int entry, int relative_index);
+  V8_INLINE Tagged<Object> GetDataEntry(int entry, int relative_index);
 
   int HashToBucket(int hash) const { return hash & (NumberOfBuckets() - 1); }
 
@@ -606,16 +611,16 @@ class SmallOrderedHashTable : public HeapObject {
 
   // This is used for accessing the non |DataTable| part of the
   // structure.
-  byte getByte(Offset offset, ByteIndex index) const {
+  uint8_t getByte(Offset offset, ByteIndex index) const {
     DCHECK(offset < DataTableStartOffset() ||
            offset >= GetBucketsStartOffset());
-    return ReadField<byte>(offset + (index * kOneByteSize));
+    return ReadField<uint8_t>(offset + (index * kOneByteSize));
   }
 
-  void setByte(Offset offset, ByteIndex index, byte value) {
+  void setByte(Offset offset, ByteIndex index, uint8_t value) {
     DCHECK(offset < DataTableStartOffset() ||
            offset >= GetBucketsStartOffset());
-    WriteField<byte>(offset + (index * kOneByteSize), value);
+    WriteField<uint8_t>(offset + (index * kOneByteSize), value);
   }
 
   Offset GetDataEntryOffset(int entry, int relative_index) const {
@@ -658,7 +663,8 @@ class SmallOrderedHashSet : public SmallOrderedHashTable<SmallOrderedHashSet> {
   V8_EXPORT_PRIVATE static MaybeHandle<SmallOrderedHashSet> Add(
       Isolate* isolate, Handle<SmallOrderedHashSet> table, Handle<Object> key);
   V8_EXPORT_PRIVATE static bool Delete(Isolate* isolate,
-                                       SmallOrderedHashSet table, Object key);
+                                       Tagged<SmallOrderedHashSet> table,
+                                       Tagged<Object> key);
   V8_EXPORT_PRIVATE bool HasKey(Isolate* isolate, Handle<Object> key);
 
   static inline bool Is(Handle<HeapObject> table);
@@ -692,7 +698,8 @@ class SmallOrderedHashMap : public SmallOrderedHashTable<SmallOrderedHashMap> {
       Isolate* isolate, Handle<SmallOrderedHashMap> table, Handle<Object> key,
       Handle<Object> value);
   V8_EXPORT_PRIVATE static bool Delete(Isolate* isolate,
-                                       SmallOrderedHashMap table, Object key);
+                                       Tagged<SmallOrderedHashMap> table,
+                                       Tagged<Object> key);
   V8_EXPORT_PRIVATE bool HasKey(Isolate* isolate, Handle<Object> key);
   static inline bool Is(Handle<HeapObject> table);
   static inline Handle<Map> GetMap(ReadOnlyRoots roots);
@@ -764,11 +771,11 @@ class V8_EXPORT_PRIVATE OrderedNameDictionary
       Isolate* isolate, Handle<OrderedNameDictionary> table, Handle<Name> key,
       Handle<Object> value, PropertyDetails details);
 
-  void SetEntry(InternalIndex entry, Object key, Object value,
+  void SetEntry(InternalIndex entry, Tagged<Object> key, Tagged<Object> value,
                 PropertyDetails details);
 
   template <typename IsolateT>
-  InternalIndex FindEntry(IsolateT* isolate, Object key);
+  InternalIndex FindEntry(IsolateT* isolate, Tagged<Object> key);
 
   // This is to make the interfaces of NameDictionary::FindEntry and
   // OrderedNameDictionary::FindEntry compatible.
@@ -795,13 +802,13 @@ class V8_EXPORT_PRIVATE OrderedNameDictionary
       Isolate* isolate, Handle<OrderedNameDictionary> table, int new_capacity);
 
   // Returns the value for entry.
-  inline Object ValueAt(InternalIndex entry);
+  inline Tagged<Object> ValueAt(InternalIndex entry);
 
   // Like KeyAt, but casts to Name
-  inline Name NameAt(InternalIndex entry);
+  inline Tagged<Name> NameAt(InternalIndex entry);
 
   // Set the value for entry.
-  inline void ValueAtPut(InternalIndex entry, Object value);
+  inline void ValueAtPut(InternalIndex entry, Tagged<Object> value);
 
   // Returns the property details for the property at entry.
   inline PropertyDetails DetailsAt(InternalIndex entry);
@@ -812,7 +819,7 @@ class V8_EXPORT_PRIVATE OrderedNameDictionary
   inline void SetHash(int hash);
   inline int Hash();
 
-  static HeapObject GetEmpty(ReadOnlyRoots ro_roots);
+  static Tagged<HeapObject> GetEmpty(ReadOnlyRoots ro_roots);
   static inline Handle<Map> GetMap(ReadOnlyRoots roots);
   static inline bool Is(Handle<HeapObject> table);
 
@@ -843,30 +850,34 @@ class V8_EXPORT_PRIVATE OrderedNameDictionaryHandler
   static Handle<HeapObject> DeleteEntry(Isolate* isolate,
                                         Handle<HeapObject> table,
                                         InternalIndex entry);
-  static InternalIndex FindEntry(Isolate* isolate, HeapObject table, Name key);
-  static void SetEntry(HeapObject table, InternalIndex entry, Object key,
-                       Object value, PropertyDetails details);
+  static InternalIndex FindEntry(Isolate* isolate, Tagged<HeapObject> table,
+                                 Tagged<Name> key);
+  static void SetEntry(Tagged<HeapObject> table, InternalIndex entry,
+                       Tagged<Object> key, Tagged<Object> value,
+                       PropertyDetails details);
 
   // Returns the value for entry.
-  static Object ValueAt(HeapObject table, InternalIndex entry);
+  static Tagged<Object> ValueAt(Tagged<HeapObject> table, InternalIndex entry);
 
   // Set the value for entry.
-  static void ValueAtPut(HeapObject table, InternalIndex entry, Object value);
+  static void ValueAtPut(Tagged<HeapObject> table, InternalIndex entry,
+                         Tagged<Object> value);
 
   // Returns the property details for the property at entry.
-  static PropertyDetails DetailsAt(HeapObject table, InternalIndex entry);
+  static PropertyDetails DetailsAt(Tagged<HeapObject> table,
+                                   InternalIndex entry);
 
   // Set the details for entry.
-  static void DetailsAtPut(HeapObject table, InternalIndex entry,
+  static void DetailsAtPut(Tagged<HeapObject> table, InternalIndex entry,
                            PropertyDetails value);
 
-  static Name KeyAt(HeapObject table, InternalIndex entry);
+  static Tagged<Name> KeyAt(Tagged<HeapObject> table, InternalIndex entry);
 
-  static void SetHash(HeapObject table, int hash);
-  static int Hash(HeapObject table);
+  static void SetHash(Tagged<HeapObject> table, int hash);
+  static int Hash(Tagged<HeapObject> table);
 
-  static int NumberOfElements(HeapObject table);
-  static int Capacity(HeapObject table);
+  static int NumberOfElements(Tagged<HeapObject> table);
+  static int Capacity(Tagged<HeapObject> table);
 
  protected:
   static MaybeHandle<OrderedNameDictionary> AdjustRepresentation(
@@ -882,7 +893,7 @@ class SmallOrderedNameDictionary
   DECL_VERIFIER(SmallOrderedNameDictionary)
 
   // Returns the value for entry.
-  inline Object ValueAt(InternalIndex entry);
+  inline Tagged<Object> ValueAt(InternalIndex entry);
 
   static Handle<SmallOrderedNameDictionary> Rehash(
       Isolate* isolate, Handle<SmallOrderedNameDictionary> table,
@@ -893,7 +904,7 @@ class SmallOrderedNameDictionary
       InternalIndex entry);
 
   // Set the value for entry.
-  inline void ValueAtPut(InternalIndex entry, Object value);
+  inline void ValueAtPut(InternalIndex entry, Tagged<Object> value);
 
   // Returns the property details for the property at entry.
   inline PropertyDetails DetailsAt(InternalIndex entry);
@@ -917,7 +928,8 @@ class SmallOrderedNameDictionary
       Isolate* isolate, Handle<SmallOrderedNameDictionary> table,
       Handle<Name> key, Handle<Object> value, PropertyDetails details);
 
-  V8_EXPORT_PRIVATE void SetEntry(InternalIndex entry, Object key, Object value,
+  V8_EXPORT_PRIVATE void SetEntry(InternalIndex entry, Tagged<Object> key,
+                                  Tagged<Object> value,
                                   PropertyDetails details);
 
   static inline Handle<Map> GetMap(ReadOnlyRoots roots);
diff --git a/deps/v8/src/objects/ordered-hash-table.tq b/deps/v8/src/objects/ordered-hash-table.tq
index b37b03e850354d..e94b334be5d4f7 100644
--- a/deps/v8/src/objects/ordered-hash-table.tq
+++ b/deps/v8/src/objects/ordered-hash-table.tq
@@ -17,8 +17,7 @@ const kSmallOrderedHashTableLoadFactor: constexpr int31
 @abstract
 @doNotGenerateCppClass
 extern class SmallOrderedHashTable extends HeapObject
-    generates 'TNode<HeapObject>' {
-}
+    generates 'TNode<HeapObject>' {}
 
 extern macro SmallOrderedHashSetMapConstant(): Map;
 const kSmallOrderedHashSetMap: Map = SmallOrderedHashSetMapConstant();
diff --git a/deps/v8/src/objects/primitive-heap-object.tq b/deps/v8/src/objects/primitive-heap-object.tq
index 49ea6a5c892a2c..3b6d077719367e 100644
--- a/deps/v8/src/objects/primitive-heap-object.tq
+++ b/deps/v8/src/objects/primitive-heap-object.tq
@@ -3,5 +3,4 @@
 // found in the LICENSE file.
 
 @abstract
-extern class PrimitiveHeapObject extends HeapObject {
-}
+extern class PrimitiveHeapObject extends HeapObject {}
diff --git a/deps/v8/src/objects/promise.tq b/deps/v8/src/objects/promise.tq
index 972988acf57ac9..22bc1be4169e8a 100644
--- a/deps/v8/src/objects/promise.tq
+++ b/deps/v8/src/objects/promise.tq
@@ -4,9 +4,13 @@
 
 extern class PromiseCapability extends Struct {
   promise: JSReceiver|Undefined;
-  // TODO(joshualitt): Can these be typed more specifically.
-  resolve: Object;
-  reject: Object;
+  // Ideally, resolve and reject would be typed as Callable|Undefined. However,
+  // the executor that creates the capability can be called in an arbitrary way
+  // by user-provided thenable constructors, and these resolver functions are
+  // not checked to be callable until after the user-provided thenable
+  // constructor returns. IOW, the callable check timing is observable.
+  resolve: JSAny;
+  reject: JSAny;
 }
 
 // PromiseReaction constants
diff --git a/deps/v8/src/objects/property-array-inl.h b/deps/v8/src/objects/property-array-inl.h
index 241cd6d0a3d49e..439a2d38fa1927 100644
--- a/deps/v8/src/objects/property-array-inl.h
+++ b/deps/v8/src/objects/property-array-inl.h
@@ -26,33 +26,33 @@ SMI_ACCESSORS(PropertyArray, length_and_hash, kLengthAndHashOffset)
 RELEASE_ACQUIRE_SMI_ACCESSORS(PropertyArray, length_and_hash,
                               kLengthAndHashOffset)
 
-Object PropertyArray::get(int index) const {
+Tagged<Object> PropertyArray::get(int index) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index);
 }
 
-Object PropertyArray::get(PtrComprCageBase cage_base, int index) const {
+Tagged<Object> PropertyArray::get(PtrComprCageBase cage_base, int index) const {
   DCHECK_LT(static_cast<unsigned>(index),
             static_cast<unsigned>(this->length(kAcquireLoad)));
   return TaggedField<Object>::Relaxed_Load(cage_base, *this,
                                            OffsetOfElementAt(index));
 }
 
-Object PropertyArray::get(int index, SeqCstAccessTag tag) const {
+Tagged<Object> PropertyArray::get(int index, SeqCstAccessTag tag) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index, tag);
 }
 
-Object PropertyArray::get(PtrComprCageBase cage_base, int index,
-                          SeqCstAccessTag tag) const {
+Tagged<Object> PropertyArray::get(PtrComprCageBase cage_base, int index,
+                                  SeqCstAccessTag tag) const {
   DCHECK_LT(static_cast<unsigned>(index),
             static_cast<unsigned>(this->length(kAcquireLoad)));
   return TaggedField<Object>::SeqCst_Load(cage_base, *this,
                                           OffsetOfElementAt(index));
 }
 
-void PropertyArray::set(int index, Object value) {
-  DCHECK(IsPropertyArray());
+void PropertyArray::set(int index, Tagged<Object> value) {
+  DCHECK(IsPropertyArray(*this));
   DCHECK_LT(static_cast<unsigned>(index),
             static_cast<unsigned>(this->length(kAcquireLoad)));
   int offset = OffsetOfElementAt(index);
@@ -60,7 +60,8 @@ void PropertyArray::set(int index, Object value) {
   WRITE_BARRIER(*this, offset, value);
 }
 
-void PropertyArray::set(int index, Object value, WriteBarrierMode mode) {
+void PropertyArray::set(int index, Tagged<Object> value,
+                        WriteBarrierMode mode) {
   DCHECK_LT(static_cast<unsigned>(index),
             static_cast<unsigned>(this->length(kAcquireLoad)));
   int offset = OffsetOfElementAt(index);
@@ -68,34 +69,51 @@ void PropertyArray::set(int index, Object value, WriteBarrierMode mode) {
   CONDITIONAL_WRITE_BARRIER(*this, offset, value, mode);
 }
 
-void PropertyArray::set(int index, Object value, SeqCstAccessTag tag) {
-  DCHECK(IsPropertyArray());
+void PropertyArray::set(int index, Tagged<Object> value, SeqCstAccessTag tag) {
+  DCHECK(IsPropertyArray(*this));
   DCHECK_LT(static_cast<unsigned>(index),
             static_cast<unsigned>(this->length(kAcquireLoad)));
-  DCHECK(value.IsShared());
+  DCHECK(IsShared(value));
   int offset = OffsetOfElementAt(index);
   SEQ_CST_WRITE_FIELD(*this, offset, value);
   CONDITIONAL_WRITE_BARRIER(*this, offset, value, UPDATE_WRITE_BARRIER);
 }
 
-Object PropertyArray::Swap(int index, Object value, SeqCstAccessTag tag) {
+Tagged<Object> PropertyArray::Swap(int index, Tagged<Object> value,
+                                   SeqCstAccessTag tag) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return Swap(cage_base, index, value, tag);
 }
 
-Object PropertyArray::Swap(PtrComprCageBase cage_base, int index, Object value,
-                           SeqCstAccessTag tag) {
-  DCHECK(IsPropertyArray());
+Tagged<Object> PropertyArray::Swap(PtrComprCageBase cage_base, int index,
+                                   Tagged<Object> value, SeqCstAccessTag tag) {
+  DCHECK(IsPropertyArray(*this));
   DCHECK_LT(static_cast<unsigned>(index),
             static_cast<unsigned>(this->length(kAcquireLoad)));
-  DCHECK(value.IsShared());
-  Object result = TaggedField<Object>::SeqCst_Swap(
+  DCHECK(IsShared(value));
+  Tagged<Object> result = TaggedField<Object>::SeqCst_Swap(
       cage_base, *this, OffsetOfElementAt(index), value);
   CONDITIONAL_WRITE_BARRIER(*this, OffsetOfElementAt(index), value,
                             UPDATE_WRITE_BARRIER);
   return result;
 }
 
+Tagged<Object> PropertyArray::CompareAndSwap(int index, Tagged<Object> expected,
+                                             Tagged<Object> value,
+                                             SeqCstAccessTag tag) {
+  DCHECK(IsPropertyArray(*this));
+  DCHECK_LT(static_cast<unsigned>(index),
+            static_cast<unsigned>(this->length(kAcquireLoad)));
+  DCHECK(IsShared(value));
+  Tagged<Object> result = TaggedField<Object>::SeqCst_CompareAndSwap(
+      *this, OffsetOfElementAt(index), expected, value);
+  if (result == expected) {
+    CONDITIONAL_WRITE_BARRIER(*this, OffsetOfElementAt(index), value,
+                              UPDATE_WRITE_BARRIER);
+  }
+  return result;
+}
+
 ObjectSlot PropertyArray::data_start() { return RawField(kHeaderSize); }
 
 int PropertyArray::length() const {
@@ -120,13 +138,13 @@ void PropertyArray::SetHash(int hash) {
 }
 
 void PropertyArray::CopyElements(Isolate* isolate, int dst_index,
-                                 PropertyArray src, int src_index, int len,
-                                 WriteBarrierMode mode) {
+                                 Tagged<PropertyArray> src, int src_index,
+                                 int len, WriteBarrierMode mode) {
   if (len == 0) return;
   DisallowGarbageCollection no_gc;
 
   ObjectSlot dst_slot(data_start() + dst_index);
-  ObjectSlot src_slot(src.data_start() + src_index);
+  ObjectSlot src_slot(src->data_start() + src_index);
   isolate->heap()->CopyRange(*this, dst_slot, src_slot, len, mode);
 }
 
diff --git a/deps/v8/src/objects/property-array.h b/deps/v8/src/objects/property-array.h
index 9a5c5f85085ca0..3791c4853acc08 100644
--- a/deps/v8/src/objects/property-array.h
+++ b/deps/v8/src/objects/property-array.h
@@ -29,24 +29,30 @@ class PropertyArray
   inline void SetHash(int hash);
   inline int Hash() const;
 
-  inline Object get(int index) const;
-  inline Object get(PtrComprCageBase cage_base, int index) const;
-  inline Object get(int index, SeqCstAccessTag tag) const;
-  inline Object get(PtrComprCageBase cage_base, int index,
-                    SeqCstAccessTag tag) const;
-
-  inline void set(int index, Object value);
-  inline void set(int index, Object value, SeqCstAccessTag tag);
+  inline Tagged<Object> get(int index) const;
+  inline Tagged<Object> get(PtrComprCageBase cage_base, int index) const;
+  inline Tagged<Object> get(int index, SeqCstAccessTag tag) const;
+  inline Tagged<Object> get(PtrComprCageBase cage_base, int index,
+                            SeqCstAccessTag tag) const;
+
+  inline void set(int index, Tagged<Object> value);
+  inline void set(int index, Tagged<Object> value, SeqCstAccessTag tag);
   // Setter with explicit barrier mode.
-  inline void set(int index, Object value, WriteBarrierMode mode);
+  inline void set(int index, Tagged<Object> value, WriteBarrierMode mode);
 
-  inline Object Swap(int index, Object value, SeqCstAccessTag tag);
-  inline Object Swap(PtrComprCageBase cage_base, int index, Object value,
-                     SeqCstAccessTag tag);
+  inline Tagged<Object> Swap(int index, Tagged<Object> value,
+                             SeqCstAccessTag tag);
+  inline Tagged<Object> Swap(PtrComprCageBase cage_base, int index,
+                             Tagged<Object> value, SeqCstAccessTag tag);
+
+  inline Tagged<Object> CompareAndSwap(int index, Tagged<Object> expected,
+                                       Tagged<Object> value,
+                                       SeqCstAccessTag tag);
 
   // Signature must be in sync with FixedArray::CopyElements().
-  inline void CopyElements(Isolate* isolate, int dst_index, PropertyArray src,
-                           int src_index, int len, WriteBarrierMode mode);
+  inline void CopyElements(Isolate* isolate, int dst_index,
+                           Tagged<PropertyArray> src, int src_index, int len,
+                           WriteBarrierMode mode);
 
   // Gives access to raw memory which stores the array's data.
   inline ObjectSlot data_start();
diff --git a/deps/v8/src/objects/property-cell-inl.h b/deps/v8/src/objects/property-cell-inl.h
index 7f9908237c66f6..c5cb5c4f933fef 100644
--- a/deps/v8/src/objects/property-cell-inl.h
+++ b/deps/v8/src/objects/property-cell-inl.h
@@ -5,10 +5,10 @@
 #ifndef V8_OBJECTS_PROPERTY_CELL_INL_H_
 #define V8_OBJECTS_PROPERTY_CELL_INL_H_
 
-#include "src/objects/property-cell.h"
-
 #include "src/heap/heap-write-barrier-inl.h"
-#include "src/objects/code-inl.h"
+#include "src/objects/dependent-code-inl.h"
+#include "src/objects/objects-inl.h"
+#include "src/objects/property-cell.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -20,13 +20,15 @@ namespace internal {
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(PropertyCell)
 
-ACCESSORS(PropertyCell, dependent_code, DependentCode, kDependentCodeOffset)
-ACCESSORS(PropertyCell, name, Name, kNameOffset)
-ACCESSORS(PropertyCell, property_details_raw, Smi, kPropertyDetailsRawOffset)
-RELEASE_ACQUIRE_ACCESSORS(PropertyCell, property_details_raw, Smi,
+ACCESSORS(PropertyCell, dependent_code, Tagged<DependentCode>,
+          kDependentCodeOffset)
+ACCESSORS(PropertyCell, name, Tagged<Name>, kNameOffset)
+ACCESSORS(PropertyCell, property_details_raw, Tagged<Smi>,
+          kPropertyDetailsRawOffset)
+RELEASE_ACQUIRE_ACCESSORS(PropertyCell, property_details_raw, Tagged<Smi>,
                           kPropertyDetailsRawOffset)
-ACCESSORS(PropertyCell, value, Object, kValueOffset)
-RELEASE_ACQUIRE_ACCESSORS(PropertyCell, value, Object, kValueOffset)
+ACCESSORS(PropertyCell, value, Tagged<Object>, kValueOffset)
+RELEASE_ACQUIRE_ACCESSORS(PropertyCell, value, Tagged<Object>, kValueOffset)
 
 PropertyDetails PropertyCell::property_details() const {
   return PropertyDetails(Smi::cast(property_details_raw()));
diff --git a/deps/v8/src/objects/property-cell.h b/deps/v8/src/objects/property-cell.h
index 7b607cd90be959..697a3403c8ae11 100644
--- a/deps/v8/src/objects/property-cell.h
+++ b/deps/v8/src/objects/property-cell.h
@@ -13,27 +13,30 @@
 namespace v8 {
 namespace internal {
 
+class FixedArray;
+class WeakFixedArray;
+
 #include "torque-generated/src/objects/property-cell-tq.inc"
 
 class PropertyCell
     : public TorqueGeneratedPropertyCell<PropertyCell, HeapObject> {
  public:
   // [name]: the name of the global property.
-  DECL_GETTER(name, Name)
+  DECL_GETTER(name, Tagged<Name>)
 
   // [property_details]: details of the global property.
-  DECL_GETTER(property_details_raw, Smi)
-  DECL_ACQUIRE_GETTER(property_details_raw, Smi)
+  DECL_GETTER(property_details_raw, Tagged<Smi>)
+  DECL_ACQUIRE_GETTER(property_details_raw, Tagged<Smi>)
   inline PropertyDetails property_details() const;
   inline PropertyDetails property_details(AcquireLoadTag tag) const;
   inline void UpdatePropertyDetailsExceptCellType(PropertyDetails details);
 
   // [value]: value of the global property.
-  DECL_GETTER(value, Object)
-  DECL_ACQUIRE_GETTER(value, Object)
+  DECL_GETTER(value, Tagged<Object>)
+  DECL_ACQUIRE_GETTER(value, Tagged<Object>)
 
   // [dependent_code]: code that depends on the type of the global property.
-  DECL_ACCESSORS(dependent_code, DependentCode)
+  DECL_ACCESSORS(dependent_code, Tagged<DependentCode>)
 
   // Changes the value and/or property details.
   // For global properties:
@@ -41,12 +44,14 @@ class PropertyCell
   // For protectors:
   void InvalidateProtector();
 
-  static PropertyCellType InitialType(Isolate* isolate, Object value);
+  static PropertyCellType InitialType(Isolate* isolate, Tagged<Object> value);
 
   // Computes the new type of the cell's contents for the given value, but
   // without actually modifying the details.
-  static PropertyCellType UpdatedType(Isolate* isolate, PropertyCell cell,
-                                      Object value, PropertyDetails details);
+  static PropertyCellType UpdatedType(Isolate* isolate,
+                                      Tagged<PropertyCell> cell,
+                                      Tagged<Object> value,
+                                      PropertyDetails details);
 
   // Prepares property cell at given entry for receiving given value and sets
   // that value.  As a result the old cell could be invalidated and/or dependent
@@ -63,7 +68,8 @@ class PropertyCell
 
   // Whether or not the {details} and {value} fit together. This is an
   // approximation with false positives.
-  static bool CheckDataIsCompatible(PropertyDetails details, Object value);
+  static bool CheckDataIsCompatible(PropertyDetails details,
+                                    Tagged<Object> value);
 
   DECL_PRINTER(PropertyCell)
   DECL_VERIFIER(PropertyCell)
@@ -75,16 +81,17 @@ class PropertyCell
  private:
   friend class Factory;
 
-  DECL_SETTER(name, Name)
-  DECL_SETTER(value, Object)
-  DECL_RELEASE_SETTER(value, Object)
-  DECL_SETTER(property_details_raw, Smi)
-  DECL_RELEASE_SETTER(property_details_raw, Smi)
+  DECL_SETTER(name, Tagged<Name>)
+  DECL_SETTER(value, Tagged<Object>)
+  DECL_RELEASE_SETTER(value, Tagged<Object>)
+  DECL_SETTER(property_details_raw, Tagged<Smi>)
+  DECL_RELEASE_SETTER(property_details_raw, Tagged<Smi>)
 
 #ifdef DEBUG
   // Whether the property cell can transition to the given state. This is an
   // approximation with false positives.
-  bool CanTransitionTo(PropertyDetails new_details, Object new_value) const;
+  bool CanTransitionTo(PropertyDetails new_details,
+                       Tagged<Object> new_value) const;
 #endif  // DEBUG
 };
 
diff --git a/deps/v8/src/objects/property-descriptor.cc b/deps/v8/src/objects/property-descriptor.cc
index 3c8aecfe8b24a8..1a5d4e9657eb2f 100644
--- a/deps/v8/src/objects/property-descriptor.cc
+++ b/deps/v8/src/objects/property-descriptor.cc
@@ -45,22 +45,22 @@ bool ToPropertyDescriptorFastPath(Isolate* isolate, Handle<JSReceiver> obj,
                                   PropertyDescriptor* desc) {
   {
     DisallowGarbageCollection no_gc;
-    auto raw_obj = *obj;
-    if (!raw_obj.IsJSObject()) return false;
-    Map raw_map = raw_obj.map(isolate);
-    if (raw_map.instance_type() != JS_OBJECT_TYPE) return false;
-    if (raw_map.is_access_check_needed()) return false;
-    if (raw_map.prototype() != *isolate->initial_object_prototype())
+    Tagged<JSReceiver> raw_obj = *obj;
+    if (!IsJSObject(*raw_obj)) return false;
+    Tagged<Map> raw_map = raw_obj->map(isolate);
+    if (raw_map->instance_type() != JS_OBJECT_TYPE) return false;
+    if (raw_map->is_access_check_needed()) return false;
+    if (raw_map->prototype() != *isolate->initial_object_prototype())
       return false;
     // During bootstrapping, the object_function_prototype_map hasn't been
     // set up yet.
     if (isolate->bootstrapper()->IsActive()) return false;
-    if (JSObject::cast(raw_map.prototype()).map() !=
-        isolate->raw_native_context().object_function_prototype_map()) {
+    if (JSObject::cast(raw_map->prototype())->map() !=
+        isolate->raw_native_context()->object_function_prototype_map()) {
       return false;
     }
     // TODO(jkummerow): support dictionary properties?
-    if (raw_map.is_dictionary_map()) return false;
+    if (raw_map->is_dictionary_map()) return false;
   }
 
   Handle<Map> map(obj->map(isolate), isolate);
@@ -92,22 +92,22 @@ bool ToPropertyDescriptorFastPath(Isolate* isolate, Handle<JSReceiver> obj,
         return false;
       }
     }
-    Name key = descs->GetKey(i);
+    Tagged<Name> key = descs->GetKey(i);
     if (key == roots.enumerable_string()) {
-      desc->set_enumerable(value->BooleanValue(isolate));
+      desc->set_enumerable(Object::BooleanValue(*value, isolate));
     } else if (key == roots.configurable_string()) {
-      desc->set_configurable(value->BooleanValue(isolate));
+      desc->set_configurable(Object::BooleanValue(*value, isolate));
     } else if (key == roots.value_string()) {
       desc->set_value(value);
     } else if (key == roots.writable_string()) {
-      desc->set_writable(value->BooleanValue(isolate));
+      desc->set_writable(Object::BooleanValue(*value, isolate));
     } else if (key == roots.get_string()) {
       // Bail out to slow path to throw an exception if necessary.
-      if (!value->IsCallable()) return false;
+      if (!IsCallable(*value)) return false;
       desc->set_get(value);
     } else if (key == roots.set_string()) {
       // Bail out to slow path to throw an exception if necessary.
-      if (!value->IsCallable()) return false;
+      if (!IsCallable(*value)) return false;
       desc->set_set(value);
     }
   }
@@ -197,7 +197,7 @@ bool PropertyDescriptor::ToPropertyDescriptor(Isolate* isolate,
                                               PropertyDescriptor* desc) {
   // 1. ReturnIfAbrupt(Obj).
   // 2. If Type(Obj) is not Object, throw a TypeError exception.
-  if (!obj->IsJSReceiver()) {
+  if (!IsJSReceiver(*obj)) {
     isolate->Throw(*isolate->factory()->NewTypeError(
         MessageTemplate::kPropertyDescObject, obj));
     return false;
@@ -219,7 +219,7 @@ bool PropertyDescriptor::ToPropertyDescriptor(Isolate* isolate,
   }
   // 6c. Set the [[Enumerable]] field of desc to enum.
   if (!enumerable.is_null()) {
-    desc->set_enumerable(enumerable->BooleanValue(isolate));
+    desc->set_enumerable(Object::BooleanValue(*enumerable, isolate));
   }
 
   // configurable?
@@ -231,7 +231,7 @@ bool PropertyDescriptor::ToPropertyDescriptor(Isolate* isolate,
   }
   // 9c. Set the [[Configurable]] field of desc to conf.
   if (!configurable.is_null()) {
-    desc->set_configurable(configurable->BooleanValue(isolate));
+    desc->set_configurable(Object::BooleanValue(*configurable, isolate));
   }
 
   // value?
@@ -252,7 +252,8 @@ bool PropertyDescriptor::ToPropertyDescriptor(Isolate* isolate,
     return false;
   }
   // 15c. Set the [[Writable]] field of desc to writable.
-  if (!writable.is_null()) desc->set_writable(writable->BooleanValue(isolate));
+  if (!writable.is_null())
+    desc->set_writable(Object::BooleanValue(*writable, isolate));
 
   // getter?
   Handle<Object> getter;
@@ -264,7 +265,7 @@ bool PropertyDescriptor::ToPropertyDescriptor(Isolate* isolate,
   if (!getter.is_null()) {
     // 18c. If IsCallable(getter) is false and getter is not undefined,
     // throw a TypeError exception.
-    if (!getter->IsCallable() && !getter->IsUndefined(isolate)) {
+    if (!IsCallable(*getter) && !IsUndefined(*getter, isolate)) {
       isolate->Throw(*isolate->factory()->NewTypeError(
           MessageTemplate::kObjectGetterCallable, getter));
       return false;
@@ -282,7 +283,7 @@ bool PropertyDescriptor::ToPropertyDescriptor(Isolate* isolate,
   if (!setter.is_null()) {
     // 21c. If IsCallable(setter) is false and setter is not undefined,
     // throw a TypeError exception.
-    if (!setter->IsCallable() && !setter->IsUndefined(isolate)) {
+    if (!IsCallable(*setter) && !IsUndefined(*setter, isolate)) {
       isolate->Throw(*isolate->factory()->NewTypeError(
           MessageTemplate::kObjectSetterCallable, setter));
       return false;
diff --git a/deps/v8/src/objects/property-details.h b/deps/v8/src/objects/property-details.h
index 517c166961923b..4cf715ac50c4a8 100644
--- a/deps/v8/src/objects/property-details.h
+++ b/deps/v8/src/objects/property-details.h
@@ -345,8 +345,8 @@ class PropertyDetails {
   }
 
   // Conversion for storing details as Object.
-  explicit inline PropertyDetails(Smi smi);
-  inline Smi AsSmi() const;
+  explicit inline PropertyDetails(Tagged<Smi> smi);
+  inline Tagged<Smi> AsSmi() const;
 
   static constexpr uint8_t EncodeRepresentation(Representation representation) {
     return representation.kind();
diff --git a/deps/v8/src/objects/property.cc b/deps/v8/src/objects/property.cc
index 42f1ea1276cb4d..576a397006070b 100644
--- a/deps/v8/src/objects/property.cc
+++ b/deps/v8/src/objects/property.cc
@@ -65,14 +65,14 @@ Descriptor::Descriptor(Handle<Name> key, const MaybeObjectHandle& value,
       value_(value),
       details_(kind, attributes, location, constness, representation,
                field_index) {
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   DCHECK_IMPLIES(key->IsPrivate(), !details_.IsEnumerable());
 }
 
 Descriptor::Descriptor(Handle<Name> key, const MaybeObjectHandle& value,
                        PropertyDetails details)
     : key_(key), value_(value), details_(details) {
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   DCHECK_IMPLIES(key->IsPrivate(), !details_.IsEnumerable());
 }
 
@@ -101,7 +101,7 @@ Descriptor Descriptor::DataConstant(Handle<Name> key, Handle<Object> value,
   return Descriptor(key, MaybeObjectHandle(value), PropertyKind::kData,
                     attributes, PropertyLocation::kDescriptor,
                     PropertyConstness::kConst,
-                    value->OptimalRepresentation(cage_base), 0);
+                    Object::OptimalRepresentation(*value, cage_base), 0);
 }
 
 Descriptor Descriptor::DataConstant(Isolate* isolate, Handle<Name> key,
diff --git a/deps/v8/src/objects/prototype-info-inl.h b/deps/v8/src/objects/prototype-info-inl.h
index 0208e03d60d774..168c4a9d130900 100644
--- a/deps/v8/src/objects/prototype-info-inl.h
+++ b/deps/v8/src/objects/prototype-info-inl.h
@@ -31,8 +31,8 @@ DEF_GETTER(PrototypeInfo, object_create_map, MaybeObject) {
 RELEASE_ACQUIRE_WEAK_ACCESSORS(PrototypeInfo, object_create_map,
                                kObjectCreateMapOffset)
 
-Map PrototypeInfo::ObjectCreateMap() {
-  return Map::cast(object_create_map()->GetHeapObjectAssumeWeak());
+Tagged<Map> PrototypeInfo::ObjectCreateMap() {
+  return Map::cast(object_create_map().GetHeapObjectAssumeWeak());
 }
 
 // static
@@ -46,30 +46,31 @@ bool PrototypeInfo::HasObjectCreateMap() {
   return cache->IsWeak();
 }
 
-bool PrototypeInfo::IsPrototypeInfoFast(Object object) {
+bool PrototypeInfo::IsPrototypeInfoFast(Tagged<Object> object) {
   bool is_proto_info = object != Smi::zero();
-  DCHECK_EQ(is_proto_info, object.IsPrototypeInfo());
+  DCHECK_EQ(is_proto_info, IsPrototypeInfo(object));
   return is_proto_info;
 }
 
 BOOL_ACCESSORS(PrototypeInfo, bit_field, should_be_fast_map,
                ShouldBeFastBit::kShift)
 
-void PrototypeUsers::MarkSlotEmpty(WeakArrayList array, int index) {
+void PrototypeUsers::MarkSlotEmpty(Tagged<WeakArrayList> array, int index) {
   DCHECK_GT(index, 0);
-  DCHECK_LT(index, array.length());
+  DCHECK_LT(index, array->length());
   // Chain the empty slots into a linked list (each empty slot contains the
   // index of the next empty slot).
-  array.Set(index, MaybeObject::FromObject(empty_slot_index(array)));
+  array->Set(index, MaybeObject::FromObject(empty_slot_index(array)));
   set_empty_slot_index(array, index);
 }
 
-Smi PrototypeUsers::empty_slot_index(WeakArrayList array) {
-  return array.Get(kEmptySlotIndex).ToSmi();
+Tagged<Smi> PrototypeUsers::empty_slot_index(Tagged<WeakArrayList> array) {
+  return array->Get(kEmptySlotIndex).ToSmi();
 }
 
-void PrototypeUsers::set_empty_slot_index(WeakArrayList array, int index) {
-  array.Set(kEmptySlotIndex, MaybeObject::FromObject(Smi::FromInt(index)));
+void PrototypeUsers::set_empty_slot_index(Tagged<WeakArrayList> array,
+                                          int index) {
+  array->Set(kEmptySlotIndex, MaybeObject::FromObject(Smi::FromInt(index)));
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/prototype-info.h b/deps/v8/src/objects/prototype-info.h
index 5284584a8ab5cc..5a4440dd60aa0a 100644
--- a/deps/v8/src/objects/prototype-info.h
+++ b/deps/v8/src/objects/prototype-info.h
@@ -30,10 +30,10 @@ class PrototypeInfo
 
   static inline void SetObjectCreateMap(Handle<PrototypeInfo> info,
                                         Handle<Map> map);
-  inline Map ObjectCreateMap();
+  inline Tagged<Map> ObjectCreateMap();
   inline bool HasObjectCreateMap();
 
-  static inline bool IsPrototypeInfoFast(Object object);
+  static inline bool IsPrototypeInfoFast(Tagged<Object> object);
 
   DECL_BOOLEAN_ACCESSORS(should_be_fast_map)
 
@@ -57,19 +57,19 @@ class V8_EXPORT_PRIVATE PrototypeUsers : public WeakArrayList {
                                    Handle<WeakArrayList> array,
                                    Handle<Map> value, int* assigned_index);
 
-  static inline void MarkSlotEmpty(WeakArrayList array, int index);
+  static inline void MarkSlotEmpty(Tagged<WeakArrayList> array, int index);
 
   // The callback is called when a weak pointer to HeapObject "object" is moved
   // from index "from_index" to index "to_index" during compaction. The callback
   // must not cause GC.
-  using CompactionCallback = void (*)(HeapObject object, int from_index,
+  using CompactionCallback = void (*)(Tagged<HeapObject> object, int from_index,
                                       int to_index);
-  static WeakArrayList Compact(
+  static Tagged<WeakArrayList> Compact(
       Handle<WeakArrayList> array, Heap* heap, CompactionCallback callback,
       AllocationType allocation = AllocationType::kYoung);
 
 #ifdef VERIFY_HEAP
-  static void Verify(WeakArrayList array);
+  static void Verify(Tagged<WeakArrayList> array);
 #endif  // VERIFY_HEAP
 
   static const int kEmptySlotIndex = 0;
@@ -78,10 +78,11 @@ class V8_EXPORT_PRIVATE PrototypeUsers : public WeakArrayList {
   static const int kNoEmptySlotsMarker = 0;
 
  private:
-  static inline Smi empty_slot_index(WeakArrayList array);
-  static inline void set_empty_slot_index(WeakArrayList array, int index);
+  static inline Tagged<Smi> empty_slot_index(Tagged<WeakArrayList> array);
+  static inline void set_empty_slot_index(Tagged<WeakArrayList> array,
+                                          int index);
 
-  static void ScanForEmptySlots(WeakArrayList array);
+  static void ScanForEmptySlots(Tagged<WeakArrayList> array);
 
   DISALLOW_IMPLICIT_CONSTRUCTORS(PrototypeUsers);
 };
diff --git a/deps/v8/src/objects/prototype-inl.h b/deps/v8/src/objects/prototype-inl.h
index 2836186b125e3f..acfe1a21db402b 100644
--- a/deps/v8/src/objects/prototype-inl.h
+++ b/deps/v8/src/objects/prototype-inl.h
@@ -27,7 +27,8 @@ PrototypeIterator::PrototypeIterator(Isolate* isolate,
   if (where_to_start == kStartAtPrototype) Advance();
 }
 
-PrototypeIterator::PrototypeIterator(Isolate* isolate, JSReceiver receiver,
+PrototypeIterator::PrototypeIterator(Isolate* isolate,
+                                     Tagged<JSReceiver> receiver,
                                      WhereToStart where_to_start,
                                      WhereToEnd where_to_end)
     : isolate_(isolate),
@@ -38,32 +39,32 @@ PrototypeIterator::PrototypeIterator(Isolate* isolate, JSReceiver receiver,
   if (where_to_start == kStartAtPrototype) Advance();
 }
 
-PrototypeIterator::PrototypeIterator(Isolate* isolate, Map receiver_map,
+PrototypeIterator::PrototypeIterator(Isolate* isolate, Tagged<Map> receiver_map,
                                      WhereToEnd where_to_end)
     : isolate_(isolate),
-      object_(receiver_map.GetPrototypeChainRootMap(isolate_).prototype()),
+      object_(receiver_map->GetPrototypeChainRootMap(isolate_)->prototype()),
       where_to_end_(where_to_end),
-      is_at_end_(object_.IsNull(isolate_)),
+      is_at_end_(IsNull(object_, isolate_)),
       seen_proxies_(0) {
   if (!is_at_end_ && where_to_end_ == END_AT_NON_HIDDEN) {
-    DCHECK(object_.IsJSReceiver());
-    Map map = JSReceiver::cast(object_).map();
-    is_at_end_ = !map.IsJSGlobalProxyMap();
+    DCHECK(IsJSReceiver(object_));
+    Tagged<Map> map = JSReceiver::cast(object_)->map();
+    is_at_end_ = !IsJSGlobalProxyMap(map);
   }
 }
 
 PrototypeIterator::PrototypeIterator(Isolate* isolate, Handle<Map> receiver_map,
                                      WhereToEnd where_to_end)
     : isolate_(isolate),
-      handle_(receiver_map->GetPrototypeChainRootMap(isolate_).prototype(),
+      handle_(receiver_map->GetPrototypeChainRootMap(isolate_)->prototype(),
               isolate_),
       where_to_end_(where_to_end),
-      is_at_end_(handle_->IsNull(isolate_)),
+      is_at_end_(IsNull(*handle_, isolate_)),
       seen_proxies_(0) {
   if (!is_at_end_ && where_to_end_ == END_AT_NON_HIDDEN) {
-    DCHECK(handle_->IsJSReceiver());
-    Map map = JSReceiver::cast(*handle_).map();
-    is_at_end_ = !map.IsJSGlobalProxyMap();
+    DCHECK(IsJSReceiver(*handle_));
+    Tagged<Map> map = JSReceiver::cast(*handle_)->map();
+    is_at_end_ = !IsJSGlobalProxyMap(map);
   }
 }
 
@@ -71,19 +72,19 @@ bool PrototypeIterator::HasAccess() const {
   // We can only perform access check in the handlified version of the
   // PrototypeIterator.
   DCHECK(!handle_.is_null());
-  if (handle_->IsAccessCheckNeeded()) {
-    return isolate_->MayAccess(handle(isolate_->context(), isolate_),
+  if (IsAccessCheckNeeded(*handle_)) {
+    return isolate_->MayAccess(isolate_->native_context(),
                                Handle<JSObject>::cast(handle_));
   }
   return true;
 }
 
 void PrototypeIterator::Advance() {
-  if (handle_.is_null() && object_.IsJSProxy()) {
+  if (handle_.is_null() && IsJSProxy(object_)) {
     is_at_end_ = true;
     object_ = ReadOnlyRoots(isolate_).null_value();
     return;
-  } else if (!handle_.is_null() && handle_->IsJSProxy()) {
+  } else if (!handle_.is_null() && IsJSProxy(*handle_)) {
     is_at_end_ = true;
     handle_ = isolate_->factory()->null_value();
     return;
@@ -92,13 +93,12 @@ void PrototypeIterator::Advance() {
 }
 
 void PrototypeIterator::AdvanceIgnoringProxies() {
-  Object object = handle_.is_null() ? object_ : *handle_;
-  Map map = HeapObject::cast(object).map();
+  Tagged<Object> object = handle_.is_null() ? object_ : *handle_;
+  Tagged<Map> map = HeapObject::cast(object)->map();
 
-  HeapObject prototype = map.prototype();
-  is_at_end_ =
-      prototype.IsNull(isolate_) ||
-      (where_to_end_ == END_AT_NON_HIDDEN && !map.IsJSGlobalProxyMap());
+  Tagged<HeapObject> prototype = map->prototype();
+  is_at_end_ = IsNull(prototype, isolate_) ||
+               (where_to_end_ == END_AT_NON_HIDDEN && !IsJSGlobalProxyMap(map));
 
   if (handle_.is_null()) {
     object_ = prototype;
@@ -108,7 +108,7 @@ void PrototypeIterator::AdvanceIgnoringProxies() {
 }
 
 V8_WARN_UNUSED_RESULT bool PrototypeIterator::AdvanceFollowingProxies() {
-  DCHECK(!(handle_.is_null() && object_.IsJSProxy()));
+  DCHECK(!(handle_.is_null() && IsJSProxy(object_)));
   if (!HasAccess()) {
     // Abort the lookup if we do not have access to the current object.
     handle_ = isolate_->factory()->null_value();
@@ -120,7 +120,7 @@ V8_WARN_UNUSED_RESULT bool PrototypeIterator::AdvanceFollowingProxies() {
 
 V8_WARN_UNUSED_RESULT bool
 PrototypeIterator::AdvanceFollowingProxiesIgnoringAccessChecks() {
-  if (handle_.is_null() || !handle_->IsJSProxy()) {
+  if (handle_.is_null() || !IsJSProxy(*handle_)) {
     AdvanceIgnoringProxies();
     return true;
   }
@@ -135,7 +135,7 @@ PrototypeIterator::AdvanceFollowingProxiesIgnoringAccessChecks() {
   MaybeHandle<HeapObject> proto =
       JSProxy::GetPrototype(Handle<JSProxy>::cast(handle_));
   if (!proto.ToHandle(&handle_)) return false;
-  is_at_end_ = where_to_end_ == END_AT_NON_HIDDEN || handle_->IsNull(isolate_);
+  is_at_end_ = where_to_end_ == END_AT_NON_HIDDEN || IsNull(*handle_, isolate_);
   return true;
 }
 
diff --git a/deps/v8/src/objects/prototype.h b/deps/v8/src/objects/prototype.h
index 0a8f21819ac17f..d526c33e9ca597 100644
--- a/deps/v8/src/objects/prototype.h
+++ b/deps/v8/src/objects/prototype.h
@@ -31,11 +31,11 @@ class PrototypeIterator {
                            WhereToStart where_to_start = kStartAtPrototype,
                            WhereToEnd where_to_end = END_AT_NULL);
 
-  inline PrototypeIterator(Isolate* isolate, JSReceiver receiver,
+  inline PrototypeIterator(Isolate* isolate, Tagged<JSReceiver> receiver,
                            WhereToStart where_to_start = kStartAtPrototype,
                            WhereToEnd where_to_end = END_AT_NULL);
 
-  inline explicit PrototypeIterator(Isolate* isolate, Map receiver_map,
+  inline explicit PrototypeIterator(Isolate* isolate, Tagged<Map> receiver_map,
                                     WhereToEnd where_to_end = END_AT_NULL);
 
   inline explicit PrototypeIterator(Isolate* isolate, Handle<Map> receiver_map,
diff --git a/deps/v8/src/objects/regexp-match-info-inl.h b/deps/v8/src/objects/regexp-match-info-inl.h
index 463bcf9326eb4f..9bca9e7f284ac7 100644
--- a/deps/v8/src/objects/regexp-match-info-inl.h
+++ b/deps/v8/src/objects/regexp-match-info-inl.h
@@ -20,7 +20,7 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(RegExpMatchInfo)
 
 int RegExpMatchInfo::NumberOfCaptureRegisters() {
   DCHECK_GE(length(), kLastMatchOverhead);
-  Object obj = get(kNumberOfCapturesIndex);
+  Tagged<Object> obj = get(kNumberOfCapturesIndex);
   return Smi::ToInt(obj);
 }
 
@@ -29,29 +29,31 @@ void RegExpMatchInfo::SetNumberOfCaptureRegisters(int value) {
   set(kNumberOfCapturesIndex, Smi::FromInt(value));
 }
 
-String RegExpMatchInfo::LastSubject() {
+Tagged<String> RegExpMatchInfo::LastSubject() {
   DCHECK_GE(length(), kLastMatchOverhead);
   return String::cast(get(kLastSubjectIndex));
 }
 
-void RegExpMatchInfo::SetLastSubject(String value, WriteBarrierMode mode) {
+void RegExpMatchInfo::SetLastSubject(Tagged<String> value,
+                                     WriteBarrierMode mode) {
   DCHECK_GE(length(), kLastMatchOverhead);
   set(kLastSubjectIndex, value, mode);
 }
 
-Object RegExpMatchInfo::LastInput() {
+Tagged<Object> RegExpMatchInfo::LastInput() {
   DCHECK_GE(length(), kLastMatchOverhead);
   return get(kLastInputIndex);
 }
 
-void RegExpMatchInfo::SetLastInput(Object value, WriteBarrierMode mode) {
+void RegExpMatchInfo::SetLastInput(Tagged<Object> value,
+                                   WriteBarrierMode mode) {
   DCHECK_GE(length(), kLastMatchOverhead);
   set(kLastInputIndex, value, mode);
 }
 
 int RegExpMatchInfo::Capture(int i) {
   DCHECK_LT(i, NumberOfCaptureRegisters());
-  Object obj = get(kFirstCaptureIndex + i);
+  Tagged<Object> obj = get(kFirstCaptureIndex + i);
   return Smi::ToInt(obj);
 }
 
diff --git a/deps/v8/src/objects/regexp-match-info.h b/deps/v8/src/objects/regexp-match-info.h
index 3ce08262b1b5dd..f1d9ef9fb5c861 100644
--- a/deps/v8/src/objects/regexp-match-info.h
+++ b/deps/v8/src/objects/regexp-match-info.h
@@ -36,13 +36,13 @@ class RegExpMatchInfo
   inline void SetNumberOfCaptureRegisters(int value);
 
   // Returns the subject string of the last match.
-  inline String LastSubject();
-  inline void SetLastSubject(String value,
+  inline Tagged<String> LastSubject();
+  inline void SetLastSubject(Tagged<String> value,
                              WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   // Like LastSubject, but modifiable by the user.
-  inline Object LastInput();
-  inline void SetLastInput(Object value,
+  inline Tagged<Object> LastInput();
+  inline void SetLastInput(Tagged<Object> value,
                            WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   // Returns the i'th capture index, 0 <= i < NumberOfCaptures(). Capture(0) and
diff --git a/deps/v8/src/objects/regexp-match-info.tq b/deps/v8/src/objects/regexp-match-info.tq
index 33825c7c8a978b..52430a1a6e9094 100644
--- a/deps/v8/src/objects/regexp-match-info.tq
+++ b/deps/v8/src/objects/regexp-match-info.tq
@@ -5,13 +5,13 @@
 @hasSameInstanceTypeAsParent
 @doNotGenerateCast
 extern class RegExpMatchInfo extends FixedArray {
-  macro GetStartOfCapture(implicit context: Context)(captureIndex:
-                                                         constexpr int31): Smi {
+  macro GetStartOfCapture(
+      implicit context: Context)(captureIndex: constexpr int31): Smi {
     const index: constexpr int31 = GetStartOfCaptureIndex(captureIndex);
     return UnsafeCast<Smi>(this.objects[index]);
   }
-  macro GetEndOfCapture(implicit context: Context)(captureIndex:
-                                                       constexpr int31): Smi {
+  macro GetEndOfCapture(
+      implicit context: Context)(captureIndex: constexpr int31): Smi {
     const index: constexpr int31 = GetStartOfCaptureIndex(captureIndex) + 1;
     return UnsafeCast<Smi>(this.objects[index]);
   }
@@ -25,6 +25,7 @@ const kRegExpMatchInfoFirstCaptureIndex:
 const kRegExpMatchInfoNumberOfCapturesIndex:
     constexpr int31 generates 'RegExpMatchInfo::kNumberOfCapturesIndex';
 
-macro GetStartOfCaptureIndex(captureIndex: constexpr int31): constexpr int31 {
+macro GetStartOfCaptureIndex(captureIndex: constexpr int31):
+    constexpr int31 {
   return kRegExpMatchInfoFirstCaptureIndex + (captureIndex * 2);
 }
diff --git a/deps/v8/src/objects/scope-info-inl.h b/deps/v8/src/objects/scope-info-inl.h
index ae8c60129fda39..35dbe1f2c658b5 100644
--- a/deps/v8/src/objects/scope-info-inl.h
+++ b/deps/v8/src/objects/scope-info-inl.h
@@ -10,6 +10,8 @@
 #include "src/objects/scope-info.h"
 #include "src/objects/string.h"
 #include "src/roots/roots-inl.h"
+#include "src/torque/runtime-macro-shims.h"
+#include "src/torque/runtime-support.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -64,16 +66,16 @@ class ScopeInfo::LocalNamesRange {
       return !(a == b);
     }
 
-    String name(PtrComprCageBase cage_base) const {
+    Tagged<String> name(PtrComprCageBase cage_base) const {
       DCHECK_LT(index_, range_->max_index());
       if (range_->inlined()) {
         return scope_info()->ContextInlinedLocalName(cage_base,
                                                      index_.as_int());
       }
-      return String::cast(table().KeyAt(cage_base, index_));
+      return String::cast(table()->KeyAt(cage_base, index_));
     }
 
-    String name() const {
+    Tagged<String> name() const {
       PtrComprCageBase cage_base = GetPtrComprCageBase(*scope_info());
       return name(cage_base);
     }
@@ -82,7 +84,7 @@ class ScopeInfo::LocalNamesRange {
 
     int index() const {
       if (range_->inlined()) return index_.as_int();
-      return table().IndexAt(index_);
+      return table()->IndexAt(index_);
     }
 
    private:
@@ -91,7 +93,7 @@ class ScopeInfo::LocalNamesRange {
 
     ScopeInfoPtr scope_info() const { return range_->scope_info_; }
 
-    NameToIndexHashTable table() const {
+    Tagged<NameToIndexHashTable> table() const {
       return scope_info()->context_local_names_hashtable();
     }
 
@@ -101,8 +103,8 @@ class ScopeInfo::LocalNamesRange {
       InternalIndex max = range_->max_index();
       // Increment until iterator points to a valid key or max.
       while (index_ < max) {
-        Object key = table().KeyAt(index_);
-        if (table().IsKey(roots, key)) break;
+        Tagged<Object> key = table()->KeyAt(index_);
+        if (table()->IsKey(roots, key)) break;
         ++index_;
       }
     }
@@ -115,7 +117,7 @@ class ScopeInfo::LocalNamesRange {
   InternalIndex max_index() const {
     int max = inlined()
                   ? scope_info_->ContextLocalCount()
-                  : scope_info_->context_local_names_hashtable().Capacity();
+                  : scope_info_->context_local_names_hashtable()->Capacity();
     return InternalIndex(max);
   }
 
@@ -136,10 +138,10 @@ ScopeInfo::LocalNamesRange<Handle<ScopeInfo>> ScopeInfo::IterateLocalNames(
 }
 
 // static
-ScopeInfo::LocalNamesRange<ScopeInfo*> ScopeInfo::IterateLocalNames(
-    ScopeInfo* scope_info, const DisallowGarbageCollection& no_gc) {
+ScopeInfo::LocalNamesRange<Tagged<ScopeInfo>> ScopeInfo::IterateLocalNames(
+    Tagged<ScopeInfo> scope_info, const DisallowGarbageCollection& no_gc) {
   USE(no_gc);
-  return LocalNamesRange<ScopeInfo*>(scope_info);
+  return LocalNamesRange<Tagged<ScopeInfo>>(scope_info);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/scope-info.cc b/deps/v8/src/objects/scope-info.cc
index 1b6083f5275312..586c7a5d16f46b 100644
--- a/deps/v8/src/objects/scope-info.cc
+++ b/deps/v8/src/objects/scope-info.cc
@@ -22,39 +22,41 @@ namespace v8 {
 namespace internal {
 
 #ifdef DEBUG
-bool ScopeInfo::Equals(ScopeInfo other, bool is_live_edit_compare) const {
-  if (length() != other.length()) return false;
+bool ScopeInfo::Equals(Tagged<ScopeInfo> other,
+                       bool is_live_edit_compare) const {
+  if (length() != other->length()) return false;
   for (int index = 0; index < length(); ++index) {
     if (is_live_edit_compare && HasPositionInfo() &&
         index >= PositionInfoIndex() && index <= PositionInfoIndex() + 1) {
       continue;
     }
-    Object entry = get(index);
-    Object other_entry = other.get(index);
-    if (entry.IsSmi()) {
+    Tagged<Object> entry = get(index);
+    Tagged<Object> other_entry = other->get(index);
+    if (IsSmi(entry)) {
       if (entry != other_entry) return false;
     } else {
-      if (HeapObject::cast(entry).map().instance_type() !=
-          HeapObject::cast(other_entry).map().instance_type()) {
+      if (HeapObject::cast(entry)->map()->instance_type() !=
+          HeapObject::cast(other_entry)->map()->instance_type()) {
         return false;
       }
-      if (entry.IsString()) {
-        if (!String::cast(entry).Equals(String::cast(other_entry))) {
+      if (IsString(entry)) {
+        if (!String::cast(entry)->Equals(String::cast(other_entry))) {
           return false;
         }
-      } else if (entry.IsScopeInfo()) {
-        if (!is_live_edit_compare && !ScopeInfo::cast(entry).Equals(
+      } else if (IsScopeInfo(entry)) {
+        if (!is_live_edit_compare && !ScopeInfo::cast(entry)->Equals(
                                          ScopeInfo::cast(other_entry), false)) {
           return false;
         }
-      } else if (entry.IsSourceTextModuleInfo()) {
+      } else if (IsSourceTextModuleInfo(entry)) {
         if (!is_live_edit_compare &&
-            !SourceTextModuleInfo::cast(entry).Equals(
+            !SourceTextModuleInfo::cast(entry)->Equals(
                 SourceTextModuleInfo::cast(other_entry))) {
           return false;
         }
-      } else if (entry.IsOddball()) {
-        if (Oddball::cast(entry).kind() != Oddball::cast(other_entry).kind()) {
+      } else if (IsOddball(entry)) {
+        if (Oddball::cast(entry)->kind() !=
+            Oddball::cast(other_entry)->kind()) {
           return false;
         }
       } else {
@@ -204,8 +206,8 @@ Handle<ScopeInfo> ScopeInfo::Create(IsolateT* isolate, Zone* zone, Scope* scope,
   int index = kVariablePartIndex;
   {
     DisallowGarbageCollection no_gc;
-    ScopeInfo scope_info = *scope_info_handle;
-    WriteBarrierMode mode = scope_info.GetWriteBarrierMode(no_gc);
+    Tagged<ScopeInfo> scope_info = *scope_info_handle;
+    WriteBarrierMode mode = scope_info->GetWriteBarrierMode(no_gc);
 
     bool has_simple_parameters = false;
     bool is_asm_module = false;
@@ -248,18 +250,18 @@ Handle<ScopeInfo> ScopeInfo::Create(IsolateT* isolate, Zone* zone, Scope* scope,
         HasContextExtensionSlotBit::encode(scope->HasContextExtensionSlot()) |
         IsReplModeScopeBit::encode(scope->is_repl_mode_scope()) |
         HasLocalsBlockListBit::encode(false);
-    scope_info.set_flags(flags);
+    scope_info->set_flags(flags);
 
-    scope_info.set_parameter_count(parameter_count);
-    scope_info.set_context_local_count(context_local_count);
+    scope_info->set_parameter_count(parameter_count);
+    scope_info->set_context_local_count(context_local_count);
 
     // Jump ahead to set the number of module variables so that we can use range
     // DCHECKs in future steps.
     if (scope->is_module_scope()) {
-      scope_info.set_module_variable_count(module_vars_count);
+      scope_info->set_module_variable_count(module_vars_count);
     }
     if (!has_inlined_local_names) {
-      scope_info.set_context_local_names_hashtable(*local_names_hashtable);
+      scope_info->set_context_local_names_hashtable(*local_names_hashtable);
     }
 
     // Add context locals' names and info, module variables' names and info.
@@ -267,7 +269,7 @@ Handle<ScopeInfo> ScopeInfo::Create(IsolateT* isolate, Zone* zone, Scope* scope,
     int context_local_base = index;
     int context_local_info_base =
         context_local_base + local_names_container_size;
-    int module_var_entry = scope_info.ModuleVariableCountIndex() + 1;
+    int module_var_entry = scope_info->ModuleVariableCountIndex() + 1;
 
     for (Variable* var : *scope->locals()) {
       switch (var->location()) {
@@ -285,24 +287,25 @@ Handle<ScopeInfo> ScopeInfo::Create(IsolateT* isolate, Zone* zone, Scope* scope,
               ParameterNumberBits::encode(ParameterNumberBits::kMax) |
               IsStaticFlagBit::encode(var->is_static_flag());
           if (has_inlined_local_names) {
-            scope_info.set(context_local_base + local_index, *var->name(),
-                           mode);
+            scope_info->set(context_local_base + local_index, *var->name(),
+                            mode);
           } else {
             Handle<NameToIndexHashTable> new_table = NameToIndexHashTable::Add(
                 isolate, local_names_hashtable, var->name(), local_index);
             DCHECK_EQ(*new_table, *local_names_hashtable);
             USE(new_table);
           }
-          scope_info.set(context_local_info_base + local_index,
-                         Smi::FromInt(info));
+          scope_info->set(context_local_info_base + local_index,
+                          Smi::FromInt(info));
           break;
         }
         case VariableLocation::MODULE: {
-          scope_info.set(module_var_entry +
-                             TorqueGeneratedModuleVariableOffsets::kNameOffset /
-                                 kTaggedSize,
-                         *var->name(), mode);
-          scope_info.set(
+          scope_info->set(
+              module_var_entry +
+                  TorqueGeneratedModuleVariableOffsets::kNameOffset /
+                      kTaggedSize,
+              *var->name(), mode);
+          scope_info->set(
               module_var_entry +
                   TorqueGeneratedModuleVariableOffsets::kIndexOffset /
                       kTaggedSize,
@@ -313,7 +316,7 @@ Handle<ScopeInfo> ScopeInfo::Create(IsolateT* isolate, Zone* zone, Scope* scope,
               MaybeAssignedFlagBit::encode(var->maybe_assigned()) |
               ParameterNumberBits::encode(ParameterNumberBits::kMax) |
               IsStaticFlagBit::encode(var->is_static_flag());
-          scope_info.set(
+          scope_info->set(
               module_var_entry +
                   TorqueGeneratedModuleVariableOffsets::kPropertiesOffset /
                       kTaggedSize,
@@ -339,16 +342,16 @@ Handle<ScopeInfo> ScopeInfo::Create(IsolateT* isolate, Zone* zone, Scope* scope,
         if (parameter->location() != VariableLocation::CONTEXT) continue;
         int param_index = parameter->index() - scope->ContextHeaderLength();
         int info_index = context_local_info_base + param_index;
-        int info = Smi::ToInt(scope_info.get(info_index));
+        int info = Smi::ToInt(scope_info->get(info_index));
         info = ParameterNumberBits::update(info, i);
-        scope_info.set(info_index, Smi::FromInt(info));
+        scope_info->set(info_index, Smi::FromInt(info));
       }
     }
 
     // Advance past local names and local names info.
     index += local_names_container_size + context_local_count;
 
-    DCHECK_EQ(index, scope_info.SavedClassVariableInfoIndex());
+    DCHECK_EQ(index, scope_info->SavedClassVariableInfoIndex());
     // If the scope is a class scope and has used static private methods, save
     // the context slot index of the class variable.
     // Store the class variable index.
@@ -363,51 +366,51 @@ Handle<ScopeInfo> ScopeInfo::Create(IsolateT* isolate, Zone* zone, Scope* scope,
         InternalIndex entry = local_names_hashtable->FindEntry(isolate, name);
         local_index = entry.as_int();
       }
-      scope_info.set(index++, Smi::FromInt(local_index));
+      scope_info->set(index++, Smi::FromInt(local_index));
     }
 
     // If present, add the function variable name and its index.
-    DCHECK_EQ(index, scope_info.FunctionVariableInfoIndex());
+    DCHECK_EQ(index, scope_info->FunctionVariableInfoIndex());
     if (has_function_name) {
       Variable* var = scope->AsDeclarationScope()->function_var();
       int var_index = -1;
-      Object name = Smi::zero();
+      Tagged<Object> name = Smi::zero();
       if (var != nullptr) {
         var_index = var->index();
         name = *var->name();
       }
-      scope_info.set(index++, name, mode);
-      scope_info.set(index++, Smi::FromInt(var_index));
+      scope_info->set(index++, name, mode);
+      scope_info->set(index++, Smi::FromInt(var_index));
       DCHECK(function_name_info != VariableAllocationInfo::CONTEXT ||
-             var_index == scope_info.ContextLength() - 1);
+             var_index == scope_info->ContextLength() - 1);
     }
 
-    DCHECK_EQ(index, scope_info.InferredFunctionNameIndex());
+    DCHECK_EQ(index, scope_info->InferredFunctionNameIndex());
     if (has_inferred_function_name) {
       // The inferred function name is taken from the SFI.
       index++;
     }
 
-    DCHECK_EQ(index, scope_info.PositionInfoIndex());
+    DCHECK_EQ(index, scope_info->PositionInfoIndex());
     if (has_position_info) {
-      scope_info.set(index++, Smi::FromInt(scope->start_position()));
-      scope_info.set(index++, Smi::FromInt(scope->end_position()));
+      scope_info->set(index++, Smi::FromInt(scope->start_position()));
+      scope_info->set(index++, Smi::FromInt(scope->end_position()));
     }
 
     // If present, add the outer scope info.
-    DCHECK(index == scope_info.OuterScopeInfoIndex());
+    DCHECK(index == scope_info->OuterScopeInfoIndex());
     if (has_outer_scope_info) {
-      scope_info.set(index++, *outer_scope.ToHandleChecked(), mode);
+      scope_info->set(index++, *outer_scope.ToHandleChecked(), mode);
     }
 
     // Module-specific information (only for module scopes).
     if (scope->is_module_scope()) {
-      DCHECK_EQ(index, scope_info.ModuleInfoIndex());
-      scope_info.set(index++, *module_info);
-      DCHECK_EQ(index, scope_info.ModuleVariableCountIndex());
+      DCHECK_EQ(index, scope_info->ModuleInfoIndex());
+      scope_info->set(index++, *module_info);
+      DCHECK_EQ(index, scope_info->ModuleVariableCountIndex());
       // Module variable count was already written above.
       index++;
-      DCHECK_EQ(index, scope_info.ModuleVariablesIndex());
+      DCHECK_EQ(index, scope_info->ModuleVariablesIndex());
       // The variable entries themselves have already been written above.
       index += kModuleVariableEntryLength * module_vars_count;
     }
@@ -546,20 +549,20 @@ Handle<ScopeInfo> ScopeInfo::CreateForBootstrapping(Isolate* isolate,
       PrivateNameLookupSkipsOuterClassBit::encode(false) |
       HasContextExtensionSlotBit::encode(is_native_context) |
       IsReplModeScopeBit::encode(false) | HasLocalsBlockListBit::encode(false);
-  auto raw_scope_info = *scope_info;
-  raw_scope_info.set_flags(flags);
-  raw_scope_info.set_parameter_count(parameter_count);
-  raw_scope_info.set_context_local_count(context_local_count);
+  Tagged<ScopeInfo> raw_scope_info = *scope_info;
+  raw_scope_info->set_flags(flags);
+  raw_scope_info->set_parameter_count(parameter_count);
+  raw_scope_info->set_context_local_count(context_local_count);
 
   int index = kVariablePartIndex;
 
   // Here we add info for context-allocated "this".
-  DCHECK_EQ(index, raw_scope_info.ContextLocalNamesIndex());
+  DCHECK_EQ(index, raw_scope_info->ContextLocalNamesIndex());
   ReadOnlyRoots roots(isolate);
   if (context_local_count) {
-    raw_scope_info.set(index++, roots.this_string());
+    raw_scope_info->set(index++, roots.this_string());
   }
-  DCHECK_EQ(index, raw_scope_info.ContextLocalInfosIndex());
+  DCHECK_EQ(index, raw_scope_info->ContextLocalInfosIndex());
   if (context_local_count > 0) {
     const uint32_t value =
         VariableModeBits::encode(VariableMode::kConst) |
@@ -567,68 +570,69 @@ Handle<ScopeInfo> ScopeInfo::CreateForBootstrapping(Isolate* isolate,
         MaybeAssignedFlagBit::encode(kNotAssigned) |
         ParameterNumberBits::encode(ParameterNumberBits::kMax) |
         IsStaticFlagBit::encode(IsStaticFlag::kNotStatic);
-    raw_scope_info.set(index++, Smi::FromInt(value));
+    raw_scope_info->set(index++, Smi::FromInt(value));
   }
 
-  DCHECK_EQ(index, raw_scope_info.FunctionVariableInfoIndex());
+  DCHECK_EQ(index, raw_scope_info->FunctionVariableInfoIndex());
   if (is_empty_function) {
-    raw_scope_info.set(index++, roots.empty_string());
-    raw_scope_info.set(index++, Smi::zero());
+    raw_scope_info->set(index++, roots.empty_string());
+    raw_scope_info->set(index++, Smi::zero());
   }
-  DCHECK_EQ(index, raw_scope_info.InferredFunctionNameIndex());
+  DCHECK_EQ(index, raw_scope_info->InferredFunctionNameIndex());
   if (has_inferred_function_name) {
-    raw_scope_info.set(index++, roots.empty_string());
+    raw_scope_info->set(index++, roots.empty_string());
   }
-  DCHECK_EQ(index, raw_scope_info.PositionInfoIndex());
+  DCHECK_EQ(index, raw_scope_info->PositionInfoIndex());
   // Store dummy position to be in sync with the {scope_type}.
-  raw_scope_info.set(index++, Smi::zero());
-  raw_scope_info.set(index++, Smi::zero());
-  DCHECK_EQ(index, raw_scope_info.OuterScopeInfoIndex());
-  DCHECK_EQ(index, raw_scope_info.length());
-  DCHECK_EQ(raw_scope_info.ParameterCount(), parameter_count);
+  raw_scope_info->set(index++, Smi::zero());
+  raw_scope_info->set(index++, Smi::zero());
+  DCHECK_EQ(index, raw_scope_info->OuterScopeInfoIndex());
+  DCHECK_EQ(index, raw_scope_info->length());
+  DCHECK_EQ(raw_scope_info->ParameterCount(), parameter_count);
   if (is_empty_function || is_native_context) {
-    DCHECK_EQ(raw_scope_info.ContextLength(), 0);
+    DCHECK_EQ(raw_scope_info->ContextLength(), 0);
   } else {
-    DCHECK_EQ(raw_scope_info.ContextLength(),
-              raw_scope_info.ContextHeaderLength() + 1);
+    DCHECK_EQ(raw_scope_info->ContextLength(),
+              raw_scope_info->ContextHeaderLength() + 1);
   }
 
   return scope_info;
 }
 
-Object ScopeInfo::get(int index) const {
+Tagged<Object> ScopeInfo::get(int index) const {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   return get(cage_base, index);
 }
 
-Object ScopeInfo::get(PtrComprCageBase cage_base, int index) const {
+Tagged<Object> ScopeInfo::get(PtrComprCageBase cage_base, int index) const {
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
   return TaggedField<Object>::Relaxed_Load(cage_base, *this,
                                            OffsetOfElementAt(index));
 }
 
-void ScopeInfo::set(int index, Smi value) {
+void ScopeInfo::set(int index, Tagged<Smi> value) {
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
-  DCHECK(Object(value).IsSmi());
+  DCHECK(IsSmi(Object(value)));
   int offset = OffsetOfElementAt(index);
   RELAXED_WRITE_FIELD(*this, offset, value);
 }
 
-void ScopeInfo::set(int index, Object value, WriteBarrierMode mode) {
+void ScopeInfo::set(int index, Tagged<Object> value, WriteBarrierMode mode) {
   DCHECK_LT(static_cast<unsigned>(index), static_cast<unsigned>(length()));
   int offset = OffsetOfElementAt(index);
   RELAXED_WRITE_FIELD(*this, offset, value);
   CONDITIONAL_WRITE_BARRIER(*this, offset, value, mode);
 }
 
-void ScopeInfo::CopyElements(Isolate* isolate, int dst_index, ScopeInfo src,
-                             int src_index, int len, WriteBarrierMode mode) {
+void ScopeInfo::CopyElements(Isolate* isolate, int dst_index,
+                             Tagged<ScopeInfo> src, int src_index, int len,
+                             WriteBarrierMode mode) {
   if (len == 0) return;
-  DCHECK_LE(src_index + len, src.length());
+  DCHECK_LE(src_index + len, src->length());
   DisallowGarbageCollection no_gc;
 
   ObjectSlot dst_slot(RawFieldOfElementAt(dst_index));
-  ObjectSlot src_slot(src.RawFieldOfElementAt(src_index));
+  ObjectSlot src_slot(src->RawFieldOfElementAt(src_index));
   isolate->heap()->CopyRange(*this, dst_slot, src_slot, len, mode);
 }
 
@@ -675,19 +679,19 @@ Handle<ScopeInfo> ScopeInfo::RecreateWithBlockList(
   return scope_info;
 }
 
-ScopeInfo ScopeInfo::Empty(Isolate* isolate) {
+Tagged<ScopeInfo> ScopeInfo::Empty(Isolate* isolate) {
   return ReadOnlyRoots(isolate).empty_scope_info();
 }
 
 bool ScopeInfo::IsEmpty() const { return IsEmptyBit::decode(Flags()); }
 
 ScopeType ScopeInfo::scope_type() const {
-  DCHECK(!IsEmpty());
+  DCHECK(!this->IsEmpty());
   return ScopeTypeBits::decode(Flags());
 }
 
 bool ScopeInfo::is_script_scope() const {
-  return !IsEmpty() && scope_type() == SCRIPT_SCOPE;
+  return !this->IsEmpty() && scope_type() == SCRIPT_SCOPE;
 }
 
 bool ScopeInfo::SloppyEvalCanExtendVars() const {
@@ -707,7 +711,7 @@ bool ScopeInfo::is_declaration_scope() const {
 }
 
 int ScopeInfo::ContextLength() const {
-  if (IsEmpty()) return 0;
+  if (this->IsEmpty()) return 0;
   int context_locals = ContextLocalCount();
   bool function_name_context_slot = HasContextAllocatedFunctionName();
   bool force_context = ForceContextAllocationBit::decode(Flags());
@@ -770,7 +774,7 @@ bool ScopeInfo::HasInferredFunctionName() const {
 }
 
 bool ScopeInfo::HasPositionInfo() const {
-  if (IsEmpty()) return false;
+  if (this->IsEmpty()) return false;
   return NeedsPositionInfo(scope_type());
 }
 
@@ -784,15 +788,14 @@ bool ScopeInfo::HasSharedFunctionName() const {
   return FunctionName() != SharedFunctionInfo::kNoSharedNameSentinel;
 }
 
-void ScopeInfo::SetFunctionName(Object name) {
+void ScopeInfo::SetFunctionName(Tagged<Object> name) {
   DCHECK(HasFunctionName());
-  DCHECK(name.IsString() || name == SharedFunctionInfo::kNoSharedNameSentinel);
-  DCHECK_IMPLIES(HasContextAllocatedFunctionName(),
-                 name.IsInternalizedString());
+  DCHECK(IsString(name) || name == SharedFunctionInfo::kNoSharedNameSentinel);
+  DCHECK_IMPLIES(HasContextAllocatedFunctionName(), IsInternalizedString(name));
   set_function_variable_info_name(name);
 }
 
-void ScopeInfo::SetInferredFunctionName(String name) {
+void ScopeInfo::SetInferredFunctionName(Tagged<String> name) {
   DCHECK(HasInferredFunctionName());
   set_inferred_function_name(name);
 }
@@ -806,7 +809,7 @@ bool ScopeInfo::IsDebugEvaluateScope() const {
 }
 
 void ScopeInfo::SetIsDebugEvaluateScope() {
-  CHECK(!IsEmpty());
+  CHECK(!this->IsEmpty());
   DCHECK_EQ(scope_type(), WITH_SCOPE);
   set_flags(Flags() | IsDebugEvaluateScopeBit::encode(true));
 }
@@ -823,32 +826,32 @@ bool ScopeInfo::HasLocalsBlockList() const {
   return HasLocalsBlockListBit::decode(Flags());
 }
 
-StringSet ScopeInfo::LocalsBlockList() const {
+Tagged<StringSet> ScopeInfo::LocalsBlockList() const {
   DCHECK(HasLocalsBlockList());
   return StringSet::cast(locals_block_list());
 }
 
 bool ScopeInfo::HasContext() const { return ContextLength() > 0; }
 
-Object ScopeInfo::FunctionName() const {
+Tagged<Object> ScopeInfo::FunctionName() const {
   DCHECK(HasFunctionName());
   return function_variable_info_name();
 }
 
-Object ScopeInfo::InferredFunctionName() const {
+Tagged<Object> ScopeInfo::InferredFunctionName() const {
   DCHECK(HasInferredFunctionName());
   return inferred_function_name();
 }
 
-String ScopeInfo::FunctionDebugName() const {
+Tagged<String> ScopeInfo::FunctionDebugName() const {
   if (!HasFunctionName()) return GetReadOnlyRoots().empty_string();
-  Object name = FunctionName();
-  if (name.IsString() && String::cast(name).length() > 0) {
+  Tagged<Object> name = FunctionName();
+  if (IsString(name) && String::cast(name)->length() > 0) {
     return String::cast(name);
   }
   if (HasInferredFunctionName()) {
     name = InferredFunctionName();
-    if (name.IsString()) return String::cast(name);
+    if (IsString(name)) return String::cast(name);
   }
   return GetReadOnlyRoots().empty_string();
 }
@@ -870,23 +873,23 @@ void ScopeInfo::SetPositionInfo(int start, int end) {
   set_position_info_end(end);
 }
 
-ScopeInfo ScopeInfo::OuterScopeInfo() const {
+Tagged<ScopeInfo> ScopeInfo::OuterScopeInfo() const {
   DCHECK(HasOuterScopeInfo());
   return ScopeInfo::cast(outer_scope_info());
 }
 
-SourceTextModuleInfo ScopeInfo::ModuleDescriptorInfo() const {
+Tagged<SourceTextModuleInfo> ScopeInfo::ModuleDescriptorInfo() const {
   DCHECK(scope_type() == MODULE_SCOPE);
   return SourceTextModuleInfo::cast(module_info());
 }
 
-String ScopeInfo::ContextInlinedLocalName(int var) const {
+Tagged<String> ScopeInfo::ContextInlinedLocalName(int var) const {
   DCHECK(HasInlinedLocalNames());
   return context_local_names(var);
 }
 
-String ScopeInfo::ContextInlinedLocalName(PtrComprCageBase cage_base,
-                                          int var) const {
+Tagged<String> ScopeInfo::ContextInlinedLocalName(PtrComprCageBase cage_base,
+                                                  int var) const {
   DCHECK(HasInlinedLocalNames());
   return context_local_names(cage_base, var);
 }
@@ -923,13 +926,13 @@ MaybeAssignedFlag ScopeInfo::ContextLocalMaybeAssignedFlag(int var) const {
 }
 
 // static
-bool ScopeInfo::VariableIsSynthetic(String name) {
+bool ScopeInfo::VariableIsSynthetic(Tagged<String> name) {
   // There's currently no flag stored on the ScopeInfo to indicate that a
   // variable is a compiler-introduced temporary. However, to avoid conflict
   // with user declarations, the current temporaries like .generator_object and
   // .result start with a dot, so we can use that as a flag. It's a hack!
-  return name.length() == 0 || name.Get(0) == '.' || name.Get(0) == '#' ||
-         name.Equals(name.GetReadOnlyRoots().this_string());
+  return name->length() == 0 || name->Get(0) == '.' || name->Get(0) == '#' ||
+         name->Equals(name->GetReadOnlyRoots().this_string());
 }
 
 int ScopeInfo::ModuleVariableCount() const {
@@ -937,11 +940,11 @@ int ScopeInfo::ModuleVariableCount() const {
   return module_variable_count();
 }
 
-int ScopeInfo::ModuleIndex(String name, VariableMode* mode,
+int ScopeInfo::ModuleIndex(Tagged<String> name, VariableMode* mode,
                            InitializationFlag* init_flag,
                            MaybeAssignedFlag* maybe_assigned_flag) {
   DisallowGarbageCollection no_gc;
-  DCHECK(name.IsInternalizedString());
+  DCHECK(IsInternalizedString(name));
   DCHECK_EQ(scope_type(), MODULE_SCOPE);
   DCHECK_NOT_NULL(mode);
   DCHECK_NOT_NULL(init_flag);
@@ -949,8 +952,8 @@ int ScopeInfo::ModuleIndex(String name, VariableMode* mode,
 
   int module_vars_count = module_variable_count();
   for (int i = 0; i < module_vars_count; ++i) {
-    String var_name = module_variables_name(i);
-    if (name.Equals(var_name)) {
+    Tagged<String> var_name = module_variables_name(i);
+    if (name->Equals(var_name)) {
       int index;
       ModuleVariable(i, nullptr, &index, mode, init_flag, maybe_assigned_flag);
       return index;
@@ -960,7 +963,7 @@ int ScopeInfo::ModuleIndex(String name, VariableMode* mode,
   return 0;
 }
 
-int ScopeInfo::InlinedLocalNamesLookup(String name) {
+int ScopeInfo::InlinedLocalNamesLookup(Tagged<String> name) {
   DisallowGarbageCollection no_gc;
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
   int local_count = context_local_count();
@@ -975,14 +978,14 @@ int ScopeInfo::InlinedLocalNamesLookup(String name) {
 int ScopeInfo::ContextSlotIndex(Handle<String> name,
                                 VariableLookupResult* lookup_result) {
   DisallowGarbageCollection no_gc;
-  DCHECK(name->IsInternalizedString());
+  DCHECK(IsInternalizedString(*name));
   DCHECK_NOT_NULL(lookup_result);
 
-  if (IsEmpty()) return -1;
+  if (this->IsEmpty()) return -1;
 
   int index = HasInlinedLocalNames()
                   ? InlinedLocalNamesLookup(*name)
-                  : context_local_names_hashtable().Lookup(name);
+                  : context_local_names_hashtable()->Lookup(name);
 
   if (index != -1) {
     lookup_result->mode = ContextLocalMode(index);
@@ -1010,16 +1013,16 @@ std::pair<String, int> ScopeInfo::SavedClassVariable() const {
     int index = saved_class_variable_info() - Context::MIN_CONTEXT_SLOTS;
     DCHECK_GE(index, 0);
     DCHECK_LT(index, ContextLocalCount());
-    String name = ContextInlinedLocalName(index);
+    Tagged<String> name = ContextInlinedLocalName(index);
     return std::make_pair(name, index);
   } else {
     // The saved class variable info corresponds to the offset in the hash
     // table storage.
     InternalIndex entry(saved_class_variable_info());
     NameToIndexHashTable table = context_local_names_hashtable();
-    Object name = table.KeyAt(entry);
-    DCHECK(name.IsString());
-    return std::make_pair(String::cast(name), table.IndexAt(entry));
+    Tagged<Object> name = table->KeyAt(entry);
+    DCHECK(IsString(name));
+    return std::make_pair(String::cast(name), table->IndexAt(entry));
   }
 }
 
@@ -1039,10 +1042,10 @@ int ScopeInfo::ParametersStartIndex() const {
   return ContextHeaderLength();
 }
 
-int ScopeInfo::FunctionContextSlotIndex(String name) const {
-  DCHECK(name.IsInternalizedString());
+int ScopeInfo::FunctionContextSlotIndex(Tagged<String> name) const {
+  DCHECK(IsInternalizedString(name));
   if (HasContextAllocatedFunctionName()) {
-    DCHECK_IMPLIES(HasFunctionName(), FunctionName().IsInternalizedString());
+    DCHECK_IMPLIES(HasFunctionName(), IsInternalizedString(FunctionName()));
     if (FunctionName() == name) {
       return function_variable_info_context_or_stack_slot_index();
     }
@@ -1098,7 +1101,7 @@ int ScopeInfo::ModuleVariablesIndex() const {
   return ConvertOffsetToIndex(ModuleVariablesOffset());
 }
 
-void ScopeInfo::ModuleVariable(int i, String* name, int* index,
+void ScopeInfo::ModuleVariable(int i, Tagged<String>* name, int* index,
                                VariableMode* mode,
                                InitializationFlag* init_flag,
                                MaybeAssignedFlag* maybe_assigned_flag) {
@@ -1157,10 +1160,10 @@ Handle<ModuleRequest> ModuleRequest::New(IsolateT* isolate,
   Handle<ModuleRequest> result = Handle<ModuleRequest>::cast(
       isolate->factory()->NewStruct(MODULE_REQUEST_TYPE, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  auto raw = *result;
-  raw.set_specifier(*specifier);
-  raw.set_import_assertions(*import_assertions);
-  raw.set_position(position);
+  Tagged<ModuleRequest> raw = *result;
+  raw->set_specifier(*specifier);
+  raw->set_import_assertions(*import_assertions);
+  raw->set_position(position);
   return result;
 }
 
@@ -1181,14 +1184,14 @@ Handle<SourceTextModuleInfoEntry> SourceTextModuleInfoEntry::New(
       Handle<SourceTextModuleInfoEntry>::cast(isolate->factory()->NewStruct(
           SOURCE_TEXT_MODULE_INFO_ENTRY_TYPE, AllocationType::kOld));
   DisallowGarbageCollection no_gc;
-  auto raw = *result;
-  raw.set_export_name(*export_name);
-  raw.set_local_name(*local_name);
-  raw.set_import_name(*import_name);
-  raw.set_module_request(module_request);
-  raw.set_cell_index(cell_index);
-  raw.set_beg_pos(beg_pos);
-  raw.set_end_pos(end_pos);
+  Tagged<SourceTextModuleInfoEntry> raw = *result;
+  raw->set_export_name(*export_name);
+  raw->set_local_name(*local_name);
+  raw->set_import_name(*import_name);
+  raw->set_module_request(module_request);
+  raw->set_cell_index(cell_index);
+  raw->set_beg_pos(beg_pos);
+  raw->set_end_pos(end_pos);
   return result;
 }
 
@@ -1271,22 +1274,22 @@ template Handle<SourceTextModuleInfo> SourceTextModuleInfo::New(
     LocalIsolate* isolate, Zone* zone, SourceTextModuleDescriptor* descr);
 
 int SourceTextModuleInfo::RegularExportCount() const {
-  DCHECK_EQ(regular_exports().length() % kRegularExportLength, 0);
-  return regular_exports().length() / kRegularExportLength;
+  DCHECK_EQ(regular_exports()->length() % kRegularExportLength, 0);
+  return regular_exports()->length() / kRegularExportLength;
 }
 
-String SourceTextModuleInfo::RegularExportLocalName(int i) const {
-  return String::cast(regular_exports().get(i * kRegularExportLength +
-                                            kRegularExportLocalNameOffset));
+Tagged<String> SourceTextModuleInfo::RegularExportLocalName(int i) const {
+  return String::cast(regular_exports()->get(i * kRegularExportLength +
+                                             kRegularExportLocalNameOffset));
 }
 
 int SourceTextModuleInfo::RegularExportCellIndex(int i) const {
-  return Smi::ToInt(regular_exports().get(i * kRegularExportLength +
-                                          kRegularExportCellIndexOffset));
+  return Smi::ToInt(regular_exports()->get(i * kRegularExportLength +
+                                           kRegularExportCellIndexOffset));
 }
 
-FixedArray SourceTextModuleInfo::RegularExportExportNames(int i) const {
-  return FixedArray::cast(regular_exports().get(
+Tagged<FixedArray> SourceTextModuleInfo::RegularExportExportNames(int i) const {
+  return FixedArray::cast(regular_exports()->get(
       i * kRegularExportLength + kRegularExportExportNamesOffset));
 }
 
diff --git a/deps/v8/src/objects/scope-info.h b/deps/v8/src/objects/scope-info.h
index 1593a720c13a10..6cb045709a9cf6 100644
--- a/deps/v8/src/objects/scope-info.h
+++ b/deps/v8/src/objects/scope-info.h
@@ -24,13 +24,7 @@ class NameToIndexHashTable;
 
 #include "torque-generated/src/objects/scope-info-tq.inc"
 
-template <typename T>
-class Handle;
-class Isolate;
-template <typename T>
-class MaybeHandle;
 class SourceTextModuleInfo;
-class Scope;
 class StringSet;
 class Zone;
 
@@ -114,8 +108,8 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
 
   V8_EXPORT_PRIVATE bool HasInferredFunctionName() const;
 
-  void SetFunctionName(Object name);
-  void SetInferredFunctionName(String name);
+  void SetFunctionName(Tagged<Object> name);
+  void SetInferredFunctionName(Tagged<String> name);
 
   // Does this scope belong to a function?
   bool HasPositionInfo() const;
@@ -129,22 +123,22 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   inline bool HasSimpleParameters() const;
 
   // Return the function_name if present.
-  V8_EXPORT_PRIVATE Object FunctionName() const;
+  V8_EXPORT_PRIVATE Tagged<Object> FunctionName() const;
 
   // The function's name if it is non-empty, otherwise the inferred name or an
   // empty string.
-  String FunctionDebugName() const;
+  Tagged<String> FunctionDebugName() const;
 
   // Return the function's inferred name if present.
   // See SharedFunctionInfo::function_identifier.
-  V8_EXPORT_PRIVATE Object InferredFunctionName() const;
+  V8_EXPORT_PRIVATE Tagged<Object> InferredFunctionName() const;
 
   // Position information accessors.
   int StartPosition() const;
   int EndPosition() const;
   void SetPositionInfo(int start, int end);
 
-  SourceTextModuleInfo ModuleDescriptorInfo() const;
+  Tagged<SourceTextModuleInfo> ModuleDescriptorInfo() const;
 
   // Return true if the local names are inlined in the scope info object.
   inline bool HasInlinedLocalNames() const;
@@ -155,13 +149,14 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   static inline LocalNamesRange<Handle<ScopeInfo>> IterateLocalNames(
       Handle<ScopeInfo> scope_info);
 
-  static inline LocalNamesRange<ScopeInfo*> IterateLocalNames(
-      ScopeInfo* scope_info, const DisallowGarbageCollection& no_gc);
+  static inline LocalNamesRange<Tagged<ScopeInfo>> IterateLocalNames(
+      Tagged<ScopeInfo> scope_info, const DisallowGarbageCollection& no_gc);
 
   // Return the name of a given context local.
   // It should only be used if inlined local names.
-  String ContextInlinedLocalName(int var) const;
-  String ContextInlinedLocalName(PtrComprCageBase cage_base, int var) const;
+  Tagged<String> ContextInlinedLocalName(int var) const;
+  Tagged<String> ContextInlinedLocalName(PtrComprCageBase cage_base,
+                                         int var) const;
 
   // Return the mode of the given context local.
   VariableMode ContextLocalMode(int var) const;
@@ -180,7 +175,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
 
   // Return true if this local was introduced by the compiler, and should not be
   // exposed to the user in a debugger.
-  static bool VariableIsSynthetic(String name);
+  static bool VariableIsSynthetic(Tagged<String> name);
 
   // Lookup support for serialized scope info. Returns the local context slot
   // index for a given slot name if the slot is present; otherwise
@@ -194,7 +189,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   // Lookup metadata of a MODULE-allocated variable.  Return 0 if there is no
   // module variable with the given name (the index value of a MODULE variable
   // is never 0).
-  int ModuleIndex(String name, VariableMode* mode,
+  int ModuleIndex(Tagged<String> name, VariableMode* mode,
                   InitializationFlag* init_flag,
                   MaybeAssignedFlag* maybe_assigned_flag);
 
@@ -204,7 +199,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   // slot index if the function name is present and context-allocated (named
   // function expressions, only), otherwise returns a value < 0. The name
   // must be an internalized string.
-  int FunctionContextSlotIndex(String name) const;
+  int FunctionContextSlotIndex(Tagged<String> name) const;
 
   // Lookup support for serialized scope info.  Returns the receiver context
   // slot index if scope has a "this" binding, and the binding is
@@ -232,7 +227,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   void SetIsDebugEvaluateScope();
 
   // Return the outer ScopeInfo if present.
-  ScopeInfo OuterScopeInfo() const;
+  Tagged<ScopeInfo> OuterScopeInfo() const;
 
   bool is_script_scope() const;
 
@@ -242,7 +237,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   // Returns a list of stack-allocated locals of parent scopes.
   // Used during local debug-evalute to decide whether a context lookup
   // can continue upwards after checking this scope.
-  V8_EXPORT_PRIVATE StringSet LocalsBlockList() const;
+  V8_EXPORT_PRIVATE Tagged<StringSet> LocalsBlockList() const;
 
   // Returns true if this ScopeInfo was created for a scope that skips the
   // closest outer class when resolving private names.
@@ -260,7 +255,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   //   - outer scope info: LiveEdit already analyses outer scopes of unchanged
   //     functions. Also checking it here will break in really subtle cases
   //     e.g. changing a let to a const in an outer function, which is fine.
-  bool Equals(ScopeInfo other, bool is_live_edit_compare = false) const;
+  bool Equals(Tagged<ScopeInfo> other, bool is_live_edit_compare = false) const;
 #endif
 
   template <typename IsolateT>
@@ -282,7 +277,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
       Handle<StringSet> blocklist);
 
   // Serializes empty scope info.
-  V8_EXPORT_PRIVATE static ScopeInfo Empty(Isolate* isolate);
+  V8_EXPORT_PRIVATE static Tagged<ScopeInfo> Empty(Isolate* isolate);
 
 #define FOR_EACH_SCOPE_INFO_NUMERIC_FIELD(V) \
   V(Flags)                                   \
@@ -316,7 +311,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   V8_EXPORT_PRIVATE uint32_t Hash();
 
  private:
-  int InlinedLocalNamesLookup(String name);
+  int InlinedLocalNamesLookup(Tagged<String> name);
 
   int ContextLocalNamesIndex() const;
   int ContextLocalInfosIndex() const;
@@ -336,14 +331,14 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   // in ScopeInfo is tagged. Each slot is tagged-pointer sized. Slot 0 is
   // 'flags', the first field defined by ScopeInfo after the standard-size
   // HeapObject header.
-  V8_EXPORT_PRIVATE Object get(int index) const;
-  Object get(PtrComprCageBase cage_base, int index) const;
+  V8_EXPORT_PRIVATE Tagged<Object> get(int index) const;
+  Tagged<Object> get(PtrComprCageBase cage_base, int index) const;
   // Setter that doesn't need write barrier.
-  void set(int index, Smi value);
+  void set(int index, Tagged<Smi> value);
   // Setter with explicit barrier mode.
-  void set(int index, Object value,
+  void set(int index, Tagged<Object> value,
            WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
-  void CopyElements(Isolate* isolate, int dst_index, ScopeInfo src,
+  void CopyElements(Isolate* isolate, int dst_index, Tagged<ScopeInfo> src,
                     int src_index, int len, WriteBarrierMode mode);
   ObjectSlot RawFieldOfElementAt(int index);
   // The number of tagged-pointer-sized slots in the ScopeInfo after its
@@ -373,7 +368,7 @@ class ScopeInfo : public TorqueGeneratedScopeInfo<ScopeInfo, HeapObject> {
   // Get metadata of i-th MODULE-allocated variable, where 0 <= i <
   // ModuleVariableCount.  The metadata is returned via out-arguments, which may
   // be nullptr if the corresponding information is not requested
-  void ModuleVariable(int i, String* name, int* index,
+  void ModuleVariable(int i, Tagged<String>* name, int* index,
                       VariableMode* mode = nullptr,
                       InitializationFlag* init_flag = nullptr,
                       MaybeAssignedFlag* maybe_assigned_flag = nullptr);
diff --git a/deps/v8/src/objects/scope-info.tq b/deps/v8/src/objects/scope-info.tq
index e58db3f4963d66..555b7a9463ddfb 100644
--- a/deps/v8/src/objects/scope-info.tq
+++ b/deps/v8/src/objects/scope-info.tq
@@ -198,8 +198,8 @@ macro IndexOfInlinedLocalName(
 // Returns the index of the named local in a ScopeInfo.
 // Assumes that the given name is internalized; uses pointer comparisons.
 @export
-macro IndexOfLocalName(scopeInfo: ScopeInfo, name: Name):
-    intptr labels NotFound {
+macro IndexOfLocalName(
+    scopeInfo: ScopeInfo, name: Name): intptr labels NotFound {
   const count: intptr = Convert<intptr>(scopeInfo.context_local_count);
   if (count < kMaxInlinedLocalNamesSize) {
     return IndexOfInlinedLocalName(scopeInfo, name) otherwise goto NotFound;
diff --git a/deps/v8/src/objects/script-inl.h b/deps/v8/src/objects/script-inl.h
index 6e40e796d307bb..c8e28128a95f2b 100644
--- a/deps/v8/src/objects/script-inl.h
+++ b/deps/v8/src/objects/script-inl.h
@@ -6,10 +6,12 @@
 #define V8_OBJECTS_SCRIPT_INL_H_
 
 #include "src/objects/managed.h"
+#include "src/objects/objects.h"
 #include "src/objects/script.h"
 #include "src/objects/shared-function-info.h"
 #include "src/objects/smi-inl.h"
 #include "src/objects/string-inl.h"
+#include "src/objects/string.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -24,87 +26,96 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(Script)
 NEVER_READ_ONLY_SPACE_IMPL(Script)
 
 #if V8_ENABLE_WEBASSEMBLY
-ACCESSORS_CHECKED(Script, wasm_breakpoint_infos, FixedArray,
+ACCESSORS_CHECKED(Script, wasm_breakpoint_infos, Tagged<FixedArray>,
                   kEvalFromSharedOrWrappedArgumentsOffset,
-                  this->type() == TYPE_WASM)
-ACCESSORS_CHECKED(Script, wasm_managed_native_module, Object,
-                  kEvalFromPositionOffset, this->type() == TYPE_WASM)
-ACCESSORS_CHECKED(Script, wasm_weak_instance_list, WeakArrayList,
-                  kSharedFunctionInfosOffset, this->type() == TYPE_WASM)
-#define CHECK_SCRIPT_NOT_WASM this->type() != TYPE_WASM
+                  this->type() == Type::kWasm)
+ACCESSORS_CHECKED(Script, wasm_managed_native_module, Tagged<Object>,
+                  kEvalFromPositionOffset, this->type() == Type::kWasm)
+ACCESSORS_CHECKED(Script, wasm_weak_instance_list, Tagged<WeakArrayList>,
+                  kSharedFunctionInfosOffset, this->type() == Type::kWasm)
+#define CHECK_SCRIPT_NOT_WASM this->type() != Type::kWasm
 #else
 #define CHECK_SCRIPT_NOT_WASM true
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-SMI_ACCESSORS(Script, type, kScriptTypeOffset)
-ACCESSORS_CHECKED(Script, eval_from_shared_or_wrapped_arguments, Object,
+Script::Type Script::type() const {
+  Tagged<Smi> value = TaggedField<Smi, kScriptTypeOffset>::load(*this);
+  return static_cast<Type>(value.value());
+}
+void Script::set_type(Type value) {
+  TaggedField<Smi, kScriptTypeOffset>::store(
+      *this, Smi::FromInt(static_cast<int>(value)));
+}
+
+ACCESSORS_CHECKED(Script, eval_from_shared_or_wrapped_arguments, Tagged<Object>,
                   kEvalFromSharedOrWrappedArgumentsOffset,
                   CHECK_SCRIPT_NOT_WASM)
 SMI_ACCESSORS_CHECKED(Script, eval_from_position, kEvalFromPositionOffset,
                       CHECK_SCRIPT_NOT_WASM)
 #undef CHECK_SCRIPT_NOT_WASM
 
-ACCESSORS(Script, compiled_lazy_function_positions, Object,
+ACCESSORS(Script, compiled_lazy_function_positions, Tagged<Object>,
           kCompiledLazyFunctionPositionsOffset)
 
 bool Script::is_wrapped() const {
-  return eval_from_shared_or_wrapped_arguments().IsFixedArray();
+  return IsFixedArray(eval_from_shared_or_wrapped_arguments());
 }
 
 bool Script::has_eval_from_shared() const {
-  return eval_from_shared_or_wrapped_arguments().IsSharedFunctionInfo();
+  return IsSharedFunctionInfo(eval_from_shared_or_wrapped_arguments());
 }
 
-void Script::set_eval_from_shared(SharedFunctionInfo shared,
+void Script::set_eval_from_shared(Tagged<SharedFunctionInfo> shared,
                                   WriteBarrierMode mode) {
   DCHECK(!is_wrapped());
   set_eval_from_shared_or_wrapped_arguments(shared, mode);
 }
 
-SharedFunctionInfo Script::eval_from_shared() const {
+Tagged<SharedFunctionInfo> Script::eval_from_shared() const {
   DCHECK(has_eval_from_shared());
   return SharedFunctionInfo::cast(eval_from_shared_or_wrapped_arguments());
 }
 
-void Script::set_wrapped_arguments(FixedArray value, WriteBarrierMode mode) {
+void Script::set_wrapped_arguments(Tagged<FixedArray> value,
+                                   WriteBarrierMode mode) {
   DCHECK(!has_eval_from_shared());
   set_eval_from_shared_or_wrapped_arguments(value, mode);
 }
 
-FixedArray Script::wrapped_arguments() const {
+Tagged<FixedArray> Script::wrapped_arguments() const {
   DCHECK(is_wrapped());
   return FixedArray::cast(eval_from_shared_or_wrapped_arguments());
 }
 
-DEF_GETTER(Script, shared_function_infos, WeakFixedArray) {
+DEF_GETTER(Script, shared_function_infos, Tagged<WeakFixedArray>) {
 #if V8_ENABLE_WEBASSEMBLY
-  if (type() == TYPE_WASM) {
+  if (type() == Type::kWasm) {
     return ReadOnlyRoots(GetHeap()).empty_weak_fixed_array();
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
   return TaggedField<WeakFixedArray, kSharedFunctionInfosOffset>::load(*this);
 }
 
-void Script::set_shared_function_infos(WeakFixedArray value,
+void Script::set_shared_function_infos(Tagged<WeakFixedArray> value,
                                        WriteBarrierMode mode) {
 #if V8_ENABLE_WEBASSEMBLY
-  DCHECK_NE(TYPE_WASM, type());
+  DCHECK_NE(Type::kWasm, type());
 #endif  // V8_ENABLE_WEBASSEMBLY
   TaggedField<WeakFixedArray, kSharedFunctionInfosOffset>::store(*this, value);
   CONDITIONAL_WRITE_BARRIER(*this, kSharedFunctionInfosOffset, value, mode);
 }
 
 int Script::shared_function_info_count() const {
-  return shared_function_infos().length();
+  return shared_function_infos()->length();
 }
 
 #if V8_ENABLE_WEBASSEMBLY
 bool Script::has_wasm_breakpoint_infos() const {
-  return type() == TYPE_WASM && wasm_breakpoint_infos().length() > 0;
+  return type() == Type::kWasm && wasm_breakpoint_infos()->length() > 0;
 }
 
 wasm::NativeModule* Script::wasm_native_module() const {
-  return Managed<wasm::NativeModule>::cast(wasm_managed_native_module()).raw();
+  return Managed<wasm::NativeModule>::cast(wasm_managed_native_module())->raw();
 }
 
 bool Script::break_on_entry() const { return BreakOnEntryBit::decode(flags()); }
@@ -150,26 +161,48 @@ void Script::set_origin_options(ScriptOriginOptions origin_options) {
 }
 
 bool Script::HasValidSource() {
-  Object src = this->source();
-  if (!src.IsString()) return true;
-  String src_str = String::cast(src);
+  Tagged<Object> src = this->source();
+  if (!IsString(src)) return true;
+  Tagged<String> src_str = Tagged<String>::cast(src);
   if (!StringShape(src_str).IsExternal()) return true;
-  if (src_str.IsOneByteRepresentation()) {
-    return ExternalOneByteString::cast(src).resource() != nullptr;
-  } else if (src_str.IsTwoByteRepresentation()) {
-    return ExternalTwoByteString::cast(src).resource() != nullptr;
+  if (src_str->IsOneByteRepresentation()) {
+    return ExternalOneByteString::cast(src)->resource() != nullptr;
+  } else if (src_str->IsTwoByteRepresentation()) {
+    return ExternalTwoByteString::cast(src)->resource() != nullptr;
   }
   return true;
 }
 
+bool Script::has_line_ends() const { return line_ends() != Smi::zero(); }
+
+bool Script::CanHaveLineEnds() const {
+#if V8_ENABLE_WEBASSEMBLY
+  return type() != Script::Type::kWasm;
+#else
+  return true;
+#endif  // V8_ENABLE_WEBASSEMBLY
+}
+
+// static
+void Script::InitLineEnds(Isolate* isolate, Handle<Script> script) {
+  if (script->has_line_ends()) return;
+  Script::InitLineEndsInternal(isolate, script);
+}
+// static
+void Script::InitLineEnds(LocalIsolate* isolate, Handle<Script> script) {
+  if (script->has_line_ends()) return;
+  Script::InitLineEndsInternal(isolate, script);
+}
+
 bool Script::HasSourceURLComment() const {
-  return source_url().IsString() && String::cast(source_url()).length() != 0;
+  return IsString(source_url()) && String::cast(source_url())->length() != 0;
 }
 
 bool Script::IsMaybeUnfinalized(Isolate* isolate) const {
   // TODO(v8:12051): A more robust detection, e.g. with a dedicated sentinel
   // value.
-  return source().IsUndefined(isolate) || String::cast(source()).length() == 0;
+  return IsUndefined(source(), isolate) ||
+         String::cast(source())->length() == 0;
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/script.h b/deps/v8/src/objects/script.h
index fea0014f6dd69d..8ef4f302cf07ee 100644
--- a/deps/v8/src/objects/script.h
+++ b/deps/v8/src/objects/script.h
@@ -9,6 +9,9 @@
 
 #include "include/v8-script.h"
 #include "src/base/export-template.h"
+#include "src/heap/factory-base.h"
+#include "src/heap/factory.h"
+#include "src/heap/local-factory.h"
 #include "src/objects/fixed-array.h"
 #include "src/objects/objects.h"
 #include "src/objects/struct.h"
@@ -39,36 +42,33 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
 
   NEVER_READ_ONLY_SPACE
   // Script types.
-  enum Type {
-    TYPE_NATIVE = 0,
-    TYPE_EXTENSION = 1,
-    TYPE_NORMAL = 2,
+  enum class Type {
+    kNative = 0,
+    kExtension = 1,
+    kNormal = 2,
 #if V8_ENABLE_WEBASSEMBLY
-    TYPE_WASM = 3,
+    kWasm = 3,
 #endif  // V8_ENABLE_WEBASSEMBLY
-    TYPE_INSPECTOR = 4
+    kInspector = 4
   };
 
   // Script compilation types.
-  enum CompilationType { COMPILATION_TYPE_HOST = 0, COMPILATION_TYPE_EVAL = 1 };
+  enum class CompilationType { kHost = 0, kEval = 1 };
 
   // Script compilation state.
-  enum CompilationState {
-    COMPILATION_STATE_INITIAL = 0,
-    COMPILATION_STATE_COMPILED = 1
-  };
+  enum class CompilationState { kInitial = 0, kCompiled = 1 };
 
   // [type]: the script type.
-  DECL_INT_ACCESSORS(type)
+  DECL_PRIMITIVE_ACCESSORS(type, Type)
 
-  DECL_ACCESSORS(eval_from_shared_or_wrapped_arguments, Object)
+  DECL_ACCESSORS(eval_from_shared_or_wrapped_arguments, Tagged<Object>)
 
   // [eval_from_shared]: for eval scripts the shared function info for the
   // function from which eval was called.
-  DECL_ACCESSORS(eval_from_shared, SharedFunctionInfo)
+  DECL_ACCESSORS(eval_from_shared, Tagged<SharedFunctionInfo>)
 
   // [wrapped_arguments]: for the list of arguments in a wrapped script.
-  DECL_ACCESSORS(wrapped_arguments, FixedArray)
+  DECL_ACCESSORS(wrapped_arguments, Tagged<FixedArray>)
 
   // Whether the script is implicitly wrapped in a function.
   inline bool is_wrapped() const;
@@ -84,7 +84,7 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
 
   // [shared_function_infos]: weak fixed array containing all shared
   // function infos created from this script.
-  DECL_ACCESSORS(shared_function_infos, WeakFixedArray)
+  DECL_ACCESSORS(shared_function_infos, Tagged<WeakFixedArray>)
 
   inline int shared_function_info_count() const;
 
@@ -92,18 +92,18 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
   // [wasm_breakpoint_infos]: the list of {BreakPointInfo} objects describing
   // all WebAssembly breakpoints for modules/instances managed via this script.
   // This must only be called if the type of this script is TYPE_WASM.
-  DECL_ACCESSORS(wasm_breakpoint_infos, FixedArray)
+  DECL_ACCESSORS(wasm_breakpoint_infos, Tagged<FixedArray>)
   inline bool has_wasm_breakpoint_infos() const;
 
   // [wasm_native_module]: the wasm {NativeModule} this script belongs to.
   // This must only be called if the type of this script is TYPE_WASM.
-  DECL_ACCESSORS(wasm_managed_native_module, Object)
+  DECL_ACCESSORS(wasm_managed_native_module, Tagged<Object>)
   inline wasm::NativeModule* wasm_native_module() const;
 
   // [wasm_weak_instance_list]: the list of all {WasmInstanceObject} being
   // affected by breakpoints that are managed via this script.
   // This must only be called if the type of this script is TYPE_WASM.
-  DECL_ACCESSORS(wasm_weak_instance_list, WeakArrayList)
+  DECL_ACCESSORS(wasm_weak_instance_list, Tagged<WeakArrayList>)
 
   // [break_on_entry] (wasm only): whether an instrumentation breakpoint is set
   // for this script; this information will be transferred to existing and
@@ -140,7 +140,7 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
   inline v8::ScriptOriginOptions origin_options();
   inline void set_origin_options(ScriptOriginOptions origin_options);
 
-  DECL_ACCESSORS(compiled_lazy_function_positions, Object)
+  DECL_ACCESSORS(compiled_lazy_function_positions, Tagged<Object>)
 
   // If script source is an external string, check that the underlying
   // resource is accessible. Otherwise, always return true.
@@ -154,17 +154,25 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
   // unfinalized.
   inline bool IsMaybeUnfinalized(Isolate* isolate) const;
 
-  Object GetNameOrSourceURL();
+  Tagged<Object> GetNameOrSourceURL();
   static Handle<String> GetScriptHash(Isolate* isolate, Handle<Script> script,
                                       bool forceForInspector);
 
   // Retrieve source position from where eval was called.
   static int GetEvalPosition(Isolate* isolate, Handle<Script> script);
 
-  // Init line_ends array with source code positions of line ends.
-  template <typename IsolateT>
-  EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-  static void InitLineEnds(IsolateT* isolate, Handle<Script> script);
+  // Initialize line_ends array with source code positions of line ends if
+  // it doesn't exist yet.
+  static inline void InitLineEnds(Isolate* isolate, Handle<Script> script);
+  static inline void InitLineEnds(LocalIsolate* isolate, Handle<Script> script);
+
+  inline bool has_line_ends() const;
+
+  // Will initialize the line ends if required.
+  static void SetSource(Isolate* isolate, Handle<Script> script,
+                        Handle<String> source);
+
+  bool inline CanHaveLineEnds() const;
 
   // Carries information about a source position.
   struct PositionInfo {
@@ -177,7 +185,7 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
   };
 
   // Specifies whether to add offsets to position infos.
-  enum OffsetFlag { NO_OFFSET = 0, WITH_OFFSET = 1 };
+  enum class OffsetFlag { kNoOffset, kWithOffset };
 
   // Retrieves information about the given position, optionally with an offset.
   // Returns false on failure, and otherwise writes into the given info object
@@ -187,9 +195,11 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
   // The non-static version is not allocating and safe for unhandlified
   // callsites.
   static bool GetPositionInfo(Handle<Script> script, int position,
-                              PositionInfo* info, OffsetFlag offset_flag);
-  V8_EXPORT_PRIVATE bool GetPositionInfo(int position, PositionInfo* info,
-                                         OffsetFlag offset_flag) const;
+                              PositionInfo* info,
+                              OffsetFlag offset_flag = OffsetFlag::kWithOffset);
+  V8_EXPORT_PRIVATE bool GetPositionInfo(
+      int position, PositionInfo* info,
+      OffsetFlag offset_flag = OffsetFlag::kWithOffset) const;
 
   // Tells whether this script should be subject to debugging, e.g. for
   // - scope inspection
@@ -220,7 +230,7 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
     explicit Iterator(Isolate* isolate);
     Iterator(const Iterator&) = delete;
     Iterator& operator=(const Iterator&) = delete;
-    Script Next();
+    Tagged<Script> Next();
 
    private:
     WeakArrayList::Iterator iterator_;
@@ -233,10 +243,22 @@ class Script : public TorqueGeneratedScript<Script, Struct> {
   using BodyDescriptor = StructBodyDescriptor;
 
  private:
+  friend Factory;
+  friend FactoryBase<Factory>;
+  friend FactoryBase<LocalFactory>;
+
+  // Hide torque-generated accessor, use Script::SetSource instead.
+  using TorqueGeneratedScript::set_source;
+
   // Bit positions in the flags field.
   DEFINE_TORQUE_GENERATED_SCRIPT_FLAGS()
 
   TQ_OBJECT_CONSTRUCTORS(Script)
+
+  template <typename IsolateT>
+  EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
+  static void V8_PRESERVE_MOST
+      InitLineEndsInternal(IsolateT* isolate, Handle<Script> script);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/script.tq b/deps/v8/src/objects/script.tq
index a0e0c9dc463847..8b887dce4800bf 100644
--- a/deps/v8/src/objects/script.tq
+++ b/deps/v8/src/objects/script.tq
@@ -35,7 +35,7 @@ extern class Script extends Struct {
   script_type: Smi;
 
   // [line_ends]: FixedArray of line ends positions.
-  line_ends: FixedArray|Undefined;
+  line_ends: FixedArray|Smi;
 
   // [id]: the script id.
   id: Smi;
diff --git a/deps/v8/src/objects/shared-function-info-inl.h b/deps/v8/src/objects/shared-function-info-inl.h
index 5621b15d987644..c5a7cb6e29ed7f 100644
--- a/deps/v8/src/objects/shared-function-info-inl.h
+++ b/deps/v8/src/objects/shared-function-info-inl.h
@@ -11,11 +11,16 @@
 #include "src/common/globals.h"
 #include "src/handles/handles-inl.h"
 #include "src/heap/heap-write-barrier-inl.h"
+#include "src/objects/abstract-code-inl.h"
 #include "src/objects/debug-objects-inl.h"
 #include "src/objects/feedback-vector-inl.h"
+#include "src/objects/heap-object-inl.h"
+#include "src/objects/instance-type-inl.h"
+#include "src/objects/objects-inl.h"
 #include "src/objects/scope-info-inl.h"
 #include "src/objects/script-inl.h"
 #include "src/objects/shared-function-info.h"
+#include "src/objects/string.h"
 #include "src/objects/templates-inl.h"
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -49,39 +54,39 @@ void PreparseData::clear_padding() {
   memset(reinterpret_cast<void*>(address() + data_end_offset), 0, padding_size);
 }
 
-byte PreparseData::get(int index) const {
+uint8_t PreparseData::get(int index) const {
   DCHECK_LE(0, index);
   DCHECK_LT(index, data_length());
   int offset = kDataStartOffset + index * kByteSize;
-  return ReadField<byte>(offset);
+  return ReadField<uint8_t>(offset);
 }
 
-void PreparseData::set(int index, byte value) {
+void PreparseData::set(int index, uint8_t value) {
   DCHECK_LE(0, index);
   DCHECK_LT(index, data_length());
   int offset = kDataStartOffset + index * kByteSize;
-  WriteField<byte>(offset, value);
+  WriteField<uint8_t>(offset, value);
 }
 
-void PreparseData::copy_in(int index, const byte* buffer, int length) {
+void PreparseData::copy_in(int index, const uint8_t* buffer, int length) {
   DCHECK(index >= 0 && length >= 0 && length <= kMaxInt - index &&
          index + length <= this->data_length());
   Address dst_addr = field_address(kDataStartOffset + index * kByteSize);
   memcpy(reinterpret_cast<void*>(dst_addr), buffer, length);
 }
 
-PreparseData PreparseData::get_child(int index) const {
+Tagged<PreparseData> PreparseData::get_child(int index) const {
   return PreparseData::cast(get_child_raw(index));
 }
 
-Object PreparseData::get_child_raw(int index) const {
+Tagged<Object> PreparseData::get_child_raw(int index) const {
   DCHECK_LE(0, index);
   DCHECK_LT(index, this->children_length());
   int offset = inner_start_offset() + index * kTaggedSize;
   return RELAXED_READ_FIELD(*this, offset);
 }
 
-void PreparseData::set_child(int index, PreparseData value,
+void PreparseData::set_child(int index, Tagged<PreparseData> value,
                              WriteBarrierMode mode) {
   DCHECK_LE(0, index);
   DCHECK_LT(index, this->children_length());
@@ -98,21 +103,32 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(UncompiledDataWithPreparseDataAndJob)
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(InterpreterData)
 TQ_OBJECT_CONSTRUCTORS_IMPL(SharedFunctionInfo)
-DEFINE_DEOPT_ELEMENT_ACCESSORS(SharedFunctionInfo, Object)
+DEFINE_DEOPT_ELEMENT_ACCESSORS(SharedFunctionInfo, Tagged<Object>)
 
-RELEASE_ACQUIRE_ACCESSORS(SharedFunctionInfo, function_data, Object,
+RELEASE_ACQUIRE_ACCESSORS(SharedFunctionInfo, function_data, Tagged<Object>,
                           kFunctionDataOffset)
-RELEASE_ACQUIRE_ACCESSORS(SharedFunctionInfo, name_or_scope_info, Object,
-                          kNameOrScopeInfoOffset)
-RELEASE_ACQUIRE_ACCESSORS(SharedFunctionInfo, script_or_debug_info, HeapObject,
-                          kScriptOrDebugInfoOffset)
+RELEASE_ACQUIRE_ACCESSORS(SharedFunctionInfo, name_or_scope_info,
+                          Tagged<Object>, kNameOrScopeInfoOffset)
+RELEASE_ACQUIRE_ACCESSORS(SharedFunctionInfo, script, Tagged<HeapObject>,
+                          kScriptOffset)
+RELEASE_ACQUIRE_ACCESSORS(SharedFunctionInfo, raw_script, Tagged<Object>,
+                          kScriptOffset)
+
+DEF_GETTER(SharedFunctionInfo, script, Tagged<HeapObject>) {
+  return script(cage_base, kAcquireLoad);
+}
+bool SharedFunctionInfo::has_script(AcquireLoadTag tag) const {
+  return IsScript(script(tag));
+}
 
 RENAME_TORQUE_ACCESSORS(SharedFunctionInfo,
                         raw_outer_scope_info_or_feedback_metadata,
-                        outer_scope_info_or_feedback_metadata, HeapObject)
+                        outer_scope_info_or_feedback_metadata,
+                        Tagged<HeapObject>)
 DEF_ACQUIRE_GETTER(SharedFunctionInfo,
-                   raw_outer_scope_info_or_feedback_metadata, HeapObject) {
-  HeapObject value =
+                   raw_outer_scope_info_or_feedback_metadata,
+                   Tagged<HeapObject>) {
+  Tagged<HeapObject> value =
       TaggedField<HeapObject, kOuterScopeInfoOrFeedbackMetadataOffset>::
           Acquire_Load(cage_base, *this);
   return value;
@@ -151,31 +167,31 @@ void SharedFunctionInfo::set_relaxed_flags(int32_t flags) {
 UINT8_ACCESSORS(SharedFunctionInfo, flags2, kFlags2Offset)
 
 bool SharedFunctionInfo::HasSharedName() const {
-  Object value = name_or_scope_info(kAcquireLoad);
-  if (value.IsScopeInfo()) {
-    return ScopeInfo::cast(value).HasSharedFunctionName();
+  Tagged<Object> value = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(value)) {
+    return ScopeInfo::cast(value)->HasSharedFunctionName();
   }
   return value != kNoSharedNameSentinel;
 }
 
-String SharedFunctionInfo::Name() const {
+Tagged<String> SharedFunctionInfo::Name() const {
   if (!HasSharedName()) return GetReadOnlyRoots().empty_string();
-  Object value = name_or_scope_info(kAcquireLoad);
-  if (value.IsScopeInfo()) {
-    if (ScopeInfo::cast(value).HasFunctionName()) {
-      return String::cast(ScopeInfo::cast(value).FunctionName());
+  Tagged<Object> value = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(value)) {
+    if (ScopeInfo::cast(value)->HasFunctionName()) {
+      return String::cast(ScopeInfo::cast(value)->FunctionName());
     }
     return GetReadOnlyRoots().empty_string();
   }
   return String::cast(value);
 }
 
-void SharedFunctionInfo::SetName(String name) {
-  Object maybe_scope_info = name_or_scope_info(kAcquireLoad);
-  if (maybe_scope_info.IsScopeInfo()) {
-    ScopeInfo::cast(maybe_scope_info).SetFunctionName(name);
+void SharedFunctionInfo::SetName(Tagged<String> name) {
+  Tagged<Object> maybe_scope_info = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(maybe_scope_info)) {
+    ScopeInfo::cast(maybe_scope_info)->SetFunctionName(name);
   } else {
-    DCHECK(maybe_scope_info.IsString() ||
+    DCHECK(IsString(maybe_scope_info) ||
            maybe_scope_info == kNoSharedNameSentinel);
     set_name_or_scope_info(name, kReleaseStore);
   }
@@ -183,16 +199,16 @@ void SharedFunctionInfo::SetName(String name) {
 }
 
 bool SharedFunctionInfo::is_script() const {
-  return scope_info(kAcquireLoad).is_script_scope() &&
-         Script::cast(script()).compilation_type() ==
-             Script::COMPILATION_TYPE_HOST;
+  return scope_info(kAcquireLoad)->is_script_scope() &&
+         Script::cast(script())->compilation_type() ==
+             Script::CompilationType::kHost;
 }
 
 bool SharedFunctionInfo::needs_script_context() const {
-  return is_script() && scope_info(kAcquireLoad).ContextLocalCount() > 0;
+  return is_script() && scope_info(kAcquireLoad)->ContextLocalCount() > 0;
 }
 
-AbstractCode SharedFunctionInfo::abstract_code(Isolate* isolate) {
+Tagged<AbstractCode> SharedFunctionInfo::abstract_code(Isolate* isolate) {
   // TODO(v8:11429): Decide if this return bytecode or baseline code, when the
   // latter is present.
   if (HasBytecodeArray(isolate)) {
@@ -215,7 +231,7 @@ template <typename IsolateT>
 bool SharedFunctionInfo::AreSourcePositionsAvailable(IsolateT* isolate) const {
   if (v8_flags.enable_lazy_source_positions) {
     return !HasBytecodeArray() ||
-           GetBytecodeArray(isolate).HasSourcePositionTable();
+           GetBytecodeArray(isolate)->HasSourcePositionTable();
   }
   return true;
 }
@@ -223,7 +239,7 @@ bool SharedFunctionInfo::AreSourcePositionsAvailable(IsolateT* isolate) const {
 template <typename IsolateT>
 SharedFunctionInfo::Inlineability SharedFunctionInfo::GetInlineability(
     IsolateT* isolate) const {
-  if (!script().IsScript()) return kHasNoScript;
+  if (!IsScript(script())) return kHasNoScript;
 
   if (isolate->is_precise_binary_code_coverage() &&
       !has_reported_binary_coverage()) {
@@ -241,11 +257,18 @@ SharedFunctionInfo::Inlineability SharedFunctionInfo::GetInlineability(
   // inline.
   if (!HasBytecodeArray()) return kHasNoBytecode;
 
-  if (GetBytecodeArray(isolate).length() > v8_flags.max_inlined_bytecode_size) {
+  if (GetBytecodeArray(isolate)->length() >
+      v8_flags.max_inlined_bytecode_size) {
     return kExceedsBytecodeLimit;
   }
 
-  if (HasBreakInfo()) return kMayContainBreakPoints;
+  {
+    SharedMutexGuardIfOffThread<IsolateT, base::kShared> mutex_guard(
+        isolate->shared_function_info_access(), isolate);
+    if (HasBreakInfo(isolate->GetMainThreadIsolateUnsafe())) {
+      return kMayContainBreakPoints;
+    }
+  }
 
   if (optimization_disabled()) return kHasOptimizationDisabled;
 
@@ -362,6 +385,21 @@ void SharedFunctionInfo::CalculateConstructAsBuiltin() {
   set_flags(f, kRelaxedStore);
 }
 
+uint16_t SharedFunctionInfo::age() const {
+  return RELAXED_READ_UINT16_FIELD(*this, kAgeOffset);
+}
+
+void SharedFunctionInfo::set_age(uint16_t value) {
+  RELAXED_WRITE_UINT16_FIELD(*this, kAgeOffset, value);
+}
+
+uint16_t SharedFunctionInfo::CompareExchangeAge(uint16_t expected_age,
+                                                uint16_t new_age) {
+  Address age_addr = address() + kAgeOffset;
+  return base::AsAtomic16::Relaxed_CompareAndSwap(
+      reinterpret_cast<base::Atomic16*>(age_addr), expected_age, new_age);
+}
+
 int SharedFunctionInfo::function_map_index() const {
   // Note: Must be kept in sync with the FastNewClosure builtin.
   int index = Context::FIRST_FUNCTION_MAP_INDEX +
@@ -380,11 +418,7 @@ void SharedFunctionInfo::set_function_map_index(int index) {
             kRelaxedStore);
 }
 
-void SharedFunctionInfo::clear_padding() {
-#if V8_SFI_NEEDS_PADDING
-  set_optional_padding(0);
-#endif  // V8_SFI_NEEDS_PADDING
-}
+void SharedFunctionInfo::clear_padding() { set_padding(0); }
 
 void SharedFunctionInfo::UpdateFunctionMapIndex() {
   int map_index =
@@ -405,97 +439,108 @@ bool SharedFunctionInfo::IsDontAdaptArguments() const {
          kDontAdaptArgumentsSentinel;
 }
 
-DEF_ACQUIRE_GETTER(SharedFunctionInfo, scope_info, ScopeInfo) {
-  Object maybe_scope_info = name_or_scope_info(cage_base, kAcquireLoad);
-  if (maybe_scope_info.IsScopeInfo(cage_base)) {
+DEF_ACQUIRE_GETTER(SharedFunctionInfo, scope_info, Tagged<ScopeInfo>) {
+  Tagged<Object> maybe_scope_info = name_or_scope_info(cage_base, kAcquireLoad);
+  if (IsScopeInfo(maybe_scope_info, cage_base)) {
     return ScopeInfo::cast(maybe_scope_info);
   }
   return GetReadOnlyRoots().empty_scope_info();
 }
 
-DEF_GETTER(SharedFunctionInfo, scope_info, ScopeInfo) {
+DEF_GETTER(SharedFunctionInfo, scope_info, Tagged<ScopeInfo>) {
   return scope_info(cage_base, kAcquireLoad);
 }
 
-void SharedFunctionInfo::SetScopeInfo(ScopeInfo scope_info,
+Tagged<ScopeInfo> SharedFunctionInfo::EarlyScopeInfo(AcquireLoadTag tag) {
+  // Keep in sync with the scope_info getter above.
+  PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
+  Tagged<Object> maybe_scope_info = name_or_scope_info(cage_base, tag);
+  if (IsScopeInfo(maybe_scope_info, cage_base)) {
+    return ScopeInfo::cast(maybe_scope_info);
+  }
+  return EarlyGetReadOnlyRoots().empty_scope_info();
+}
+
+void SharedFunctionInfo::SetScopeInfo(Tagged<ScopeInfo> scope_info,
                                       WriteBarrierMode mode) {
   // Move the existing name onto the ScopeInfo.
-  Object name = name_or_scope_info(kAcquireLoad);
-  if (name.IsScopeInfo()) {
-    name = ScopeInfo::cast(name).FunctionName();
+  Tagged<Object> name = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(name)) {
+    name = ScopeInfo::cast(name)->FunctionName();
   }
-  DCHECK(name.IsString() || name == kNoSharedNameSentinel);
+  DCHECK(IsString(name) || name == kNoSharedNameSentinel);
   // Only set the function name for function scopes.
-  scope_info.SetFunctionName(name);
-  if (HasInferredName() && inferred_name().length() != 0) {
-    scope_info.SetInferredFunctionName(inferred_name());
+  scope_info->SetFunctionName(name);
+  if (HasInferredName() && inferred_name()->length() != 0) {
+    scope_info->SetInferredFunctionName(inferred_name());
   }
   set_name_or_scope_info(scope_info, kReleaseStore, mode);
 }
 
-void SharedFunctionInfo::set_raw_scope_info(ScopeInfo scope_info,
+void SharedFunctionInfo::set_raw_scope_info(Tagged<ScopeInfo> scope_info,
                                             WriteBarrierMode mode) {
   WRITE_FIELD(*this, kNameOrScopeInfoOffset, scope_info);
   CONDITIONAL_WRITE_BARRIER(*this, kNameOrScopeInfoOffset, scope_info, mode);
 }
 
-HeapObject SharedFunctionInfo::outer_scope_info() const {
+DEF_GETTER(SharedFunctionInfo, outer_scope_info, Tagged<HeapObject>) {
   DCHECK(!is_compiled());
   DCHECK(!HasFeedbackMetadata());
-  return raw_outer_scope_info_or_feedback_metadata();
+  return raw_outer_scope_info_or_feedback_metadata(cage_base);
 }
 
 bool SharedFunctionInfo::HasOuterScopeInfo() const {
-  ScopeInfo outer_info;
+  Tagged<ScopeInfo> outer_info;
   if (!is_compiled()) {
-    if (!outer_scope_info().IsScopeInfo()) return false;
+    if (!IsScopeInfo(outer_scope_info())) return false;
     outer_info = ScopeInfo::cast(outer_scope_info());
   } else {
-    ScopeInfo info = scope_info(kAcquireLoad);
-    if (!info.HasOuterScopeInfo()) return false;
-    outer_info = info.OuterScopeInfo();
+    Tagged<ScopeInfo> info = scope_info(kAcquireLoad);
+    if (!info->HasOuterScopeInfo()) return false;
+    outer_info = info->OuterScopeInfo();
   }
-  return !outer_info.IsEmpty();
+  return !outer_info->IsEmpty();
 }
 
-ScopeInfo SharedFunctionInfo::GetOuterScopeInfo() const {
+Tagged<ScopeInfo> SharedFunctionInfo::GetOuterScopeInfo() const {
   DCHECK(HasOuterScopeInfo());
   if (!is_compiled()) return ScopeInfo::cast(outer_scope_info());
-  return scope_info(kAcquireLoad).OuterScopeInfo();
+  return scope_info(kAcquireLoad)->OuterScopeInfo();
 }
 
-void SharedFunctionInfo::set_outer_scope_info(HeapObject value,
+void SharedFunctionInfo::set_outer_scope_info(Tagged<HeapObject> value,
                                               WriteBarrierMode mode) {
   DCHECK(!is_compiled());
-  DCHECK(raw_outer_scope_info_or_feedback_metadata().IsTheHole());
-  DCHECK(value.IsScopeInfo() || value.IsTheHole());
+  DCHECK(IsTheHole(raw_outer_scope_info_or_feedback_metadata()));
+  DCHECK(IsScopeInfo(value) || IsTheHole(value));
   set_raw_outer_scope_info_or_feedback_metadata(value, mode);
 }
 
 bool SharedFunctionInfo::HasFeedbackMetadata() const {
-  return raw_outer_scope_info_or_feedback_metadata().IsFeedbackMetadata();
+  return IsFeedbackMetadata(raw_outer_scope_info_or_feedback_metadata());
 }
 
 bool SharedFunctionInfo::HasFeedbackMetadata(AcquireLoadTag tag) const {
-  return raw_outer_scope_info_or_feedback_metadata(tag).IsFeedbackMetadata();
+  return IsFeedbackMetadata(raw_outer_scope_info_or_feedback_metadata(tag));
 }
 
-FeedbackMetadata SharedFunctionInfo::feedback_metadata() const {
+DEF_GETTER(SharedFunctionInfo, feedback_metadata, Tagged<FeedbackMetadata>) {
   DCHECK(HasFeedbackMetadata());
-  return FeedbackMetadata::cast(raw_outer_scope_info_or_feedback_metadata());
+  return FeedbackMetadata::cast(
+      raw_outer_scope_info_or_feedback_metadata(cage_base));
 }
 
 RELEASE_ACQUIRE_ACCESSORS_CHECKED2(SharedFunctionInfo, feedback_metadata,
-                                   FeedbackMetadata,
+                                   Tagged<FeedbackMetadata>,
                                    kOuterScopeInfoOrFeedbackMetadataOffset,
                                    HasFeedbackMetadata(kAcquireLoad),
                                    !HasFeedbackMetadata(kAcquireLoad) &&
-                                       value.IsFeedbackMetadata())
+                                       IsFeedbackMetadata(value))
 
 bool SharedFunctionInfo::is_compiled() const {
-  Object data = function_data(kAcquireLoad);
+  Tagged<Object> data = function_data(kAcquireLoad);
   return data != Smi::FromEnum(Builtin::kCompileLazy) &&
-         !data.IsUncompiledData();
+         !IsUncompiledData(data);
 }
 
 template <typename IsolateT>
@@ -503,13 +548,13 @@ IsCompiledScope SharedFunctionInfo::is_compiled_scope(IsolateT* isolate) const {
   return IsCompiledScope(*this, isolate);
 }
 
-IsCompiledScope::IsCompiledScope(const SharedFunctionInfo shared,
+IsCompiledScope::IsCompiledScope(const Tagged<SharedFunctionInfo> shared,
                                  Isolate* isolate)
-    : is_compiled_(shared.is_compiled()) {
-  if (shared.HasBaselineCode()) {
-    retain_code_ = handle(shared.baseline_code(kAcquireLoad), isolate);
-  } else if (shared.HasBytecodeArray()) {
-    retain_code_ = handle(shared.GetBytecodeArray(isolate), isolate);
+    : is_compiled_(shared->is_compiled()) {
+  if (shared->HasBaselineCode()) {
+    retain_code_ = handle(shared->baseline_code(kAcquireLoad), isolate);
+  } else if (shared->HasBytecodeArray()) {
+    retain_code_ = handle(shared->GetBytecodeArray(isolate), isolate);
   } else {
     retain_code_ = MaybeHandle<HeapObject>();
   }
@@ -517,15 +562,15 @@ IsCompiledScope::IsCompiledScope(const SharedFunctionInfo shared,
   DCHECK_IMPLIES(!retain_code_.is_null(), is_compiled());
 }
 
-IsCompiledScope::IsCompiledScope(const SharedFunctionInfo shared,
+IsCompiledScope::IsCompiledScope(const Tagged<SharedFunctionInfo> shared,
                                  LocalIsolate* isolate)
-    : is_compiled_(shared.is_compiled()) {
-  if (shared.HasBaselineCode()) {
+    : is_compiled_(shared->is_compiled()) {
+  if (shared->HasBaselineCode()) {
     retain_code_ = isolate->heap()->NewPersistentHandle(
-        shared.baseline_code(kAcquireLoad));
-  } else if (shared.HasBytecodeArray()) {
+        shared->baseline_code(kAcquireLoad));
+  } else if (shared->HasBytecodeArray()) {
     retain_code_ =
-        isolate->heap()->NewPersistentHandle(shared.GetBytecodeArray(isolate));
+        isolate->heap()->NewPersistentHandle(shared->GetBytecodeArray(isolate));
   } else {
     retain_code_ = MaybeHandle<HeapObject>();
   }
@@ -534,238 +579,238 @@ IsCompiledScope::IsCompiledScope(const SharedFunctionInfo shared,
 }
 
 bool SharedFunctionInfo::has_simple_parameters() {
-  return scope_info(kAcquireLoad).HasSimpleParameters();
+  return scope_info(kAcquireLoad)->HasSimpleParameters();
 }
 
 bool SharedFunctionInfo::CanCollectSourcePosition(Isolate* isolate) {
   return v8_flags.enable_lazy_source_positions && HasBytecodeArray() &&
-         !GetBytecodeArray(isolate).HasSourcePositionTable();
+         !GetBytecodeArray(isolate)->HasSourcePositionTable();
 }
 
 bool SharedFunctionInfo::IsApiFunction() const {
-  return function_data(kAcquireLoad).IsFunctionTemplateInfo();
+  return IsFunctionTemplateInfo(function_data(kAcquireLoad));
 }
 
-FunctionTemplateInfo SharedFunctionInfo::get_api_func_data() const {
+DEF_GETTER(SharedFunctionInfo, api_func_data, Tagged<FunctionTemplateInfo>) {
   DCHECK(IsApiFunction());
   return FunctionTemplateInfo::cast(function_data(kAcquireLoad));
 }
 
 DEF_GETTER(SharedFunctionInfo, HasBytecodeArray, bool) {
-  Object data = function_data(cage_base, kAcquireLoad);
-  if (!data.IsHeapObject()) return false;
+  Tagged<Object> data = function_data(cage_base, kAcquireLoad);
+  if (!IsHeapObject(data)) return false;
   InstanceType instance_type =
-      HeapObject::cast(data).map(cage_base).instance_type();
+      HeapObject::cast(data)->map(cage_base)->instance_type();
   return InstanceTypeChecker::IsBytecodeArray(instance_type) ||
          InstanceTypeChecker::IsInterpreterData(instance_type) ||
          InstanceTypeChecker::IsCode(instance_type);
 }
 
 template <typename IsolateT>
-BytecodeArray SharedFunctionInfo::GetBytecodeArray(IsolateT* isolate) const {
+Tagged<BytecodeArray> SharedFunctionInfo::GetBytecodeArray(
+    IsolateT* isolate) const {
   SharedMutexGuardIfOffThread<IsolateT, base::kShared> mutex_guard(
       isolate->shared_function_info_access(), isolate);
 
   DCHECK(HasBytecodeArray());
-  if (HasDebugInfo() && GetDebugInfo().HasInstrumentedBytecodeArray()) {
-    return GetDebugInfo().OriginalBytecodeArray();
+
+  base::Optional<DebugInfo> debug_info =
+      TryGetDebugInfo(isolate->GetMainThreadIsolateUnsafe());
+  if (debug_info.has_value() && debug_info->HasInstrumentedBytecodeArray()) {
+    return debug_info->OriginalBytecodeArray();
   }
 
   return GetActiveBytecodeArray();
 }
 
-BytecodeArray SharedFunctionInfo::GetActiveBytecodeArray() const {
-  Object data = function_data(kAcquireLoad);
-  if (data.IsCode()) {
-    Code baseline_code = Code::cast(data);
-    data = baseline_code.bytecode_or_interpreter_data();
+DEF_GETTER(SharedFunctionInfo, GetActiveBytecodeArray, Tagged<BytecodeArray>) {
+  Tagged<Object> data = function_data(kAcquireLoad);
+  if (IsCode(data)) {
+    Tagged<Code> baseline_code = Code::cast(data);
+    data = baseline_code->bytecode_or_interpreter_data(cage_base);
   }
-  if (data.IsBytecodeArray()) {
+  if (IsBytecodeArray(data)) {
     return BytecodeArray::cast(data);
   } else {
-    DCHECK(data.IsInterpreterData());
-    return InterpreterData::cast(data).bytecode_array();
+    DCHECK(IsInterpreterData(data));
+    return InterpreterData::cast(data)->bytecode_array();
   }
 }
 
-void SharedFunctionInfo::SetActiveBytecodeArray(BytecodeArray bytecode) {
+void SharedFunctionInfo::SetActiveBytecodeArray(
+    Tagged<BytecodeArray> bytecode) {
   // We don't allow setting the active bytecode array on baseline-optimized
   // functions. They should have been flushed earlier.
   DCHECK(!HasBaselineCode());
 
-  Object data = function_data(kAcquireLoad);
-  if (data.IsBytecodeArray()) {
+  Tagged<Object> data = function_data(kAcquireLoad);
+  if (IsBytecodeArray(data)) {
     set_function_data(bytecode, kReleaseStore);
   } else {
-    DCHECK(data.IsInterpreterData());
-    interpreter_data().set_bytecode_array(bytecode);
+    DCHECK(IsInterpreterData(data));
+    interpreter_data()->set_bytecode_array(bytecode);
   }
 }
 
-void SharedFunctionInfo::set_bytecode_array(BytecodeArray bytecode) {
+void SharedFunctionInfo::set_bytecode_array(Tagged<BytecodeArray> bytecode) {
   DCHECK(function_data(kAcquireLoad) == Smi::FromEnum(Builtin::kCompileLazy) ||
          HasUncompiledData());
   set_function_data(bytecode, kReleaseStore);
 }
 
-bool SharedFunctionInfo::ShouldFlushCode(
-    base::EnumSet<CodeFlushMode> code_flush_mode) {
-  if (IsFlushingDisabled(code_flush_mode)) return false;
-
-  // TODO(rmcilroy): Enable bytecode flushing for resumable functions.
-  if (IsResumableFunction(kind()) || !allows_lazy_compilation()) {
-    return false;
-  }
-
-  // Get a snapshot of the function data field, and if it is a bytecode array,
-  // check if it is old. Note, this is done this way since this function can be
-  // called by the concurrent marker.
-  Object data = function_data(kAcquireLoad);
-  if (data.IsCode()) {
-    Code baseline_code = Code::cast(data);
-    DCHECK_EQ(baseline_code.kind(), CodeKind::BASELINE);
-    // If baseline code flushing isn't enabled and we have baseline data on SFI
-    // we cannot flush baseline / bytecode.
-    if (!IsBaselineCodeFlushingEnabled(code_flush_mode)) return false;
-    data = baseline_code.bytecode_or_interpreter_data();
-  } else if (!IsByteCodeFlushingEnabled(code_flush_mode)) {
-    // If bytecode flushing isn't enabled and there is no baseline code there is
-    // nothing to flush.
-    return false;
-  }
-  if (!data.IsBytecodeArray()) return false;
-
-  if (IsStressFlushingEnabled(code_flush_mode)) return true;
-
-  BytecodeArray bytecode = BytecodeArray::cast(data);
-
-  return bytecode.IsOld();
-}
-
-DEF_GETTER(SharedFunctionInfo, InterpreterTrampoline, Code) {
+DEF_GETTER(SharedFunctionInfo, InterpreterTrampoline, Tagged<Code>) {
   DCHECK(HasInterpreterData(cage_base));
-  return interpreter_data(cage_base).interpreter_trampoline(cage_base);
+  return interpreter_data(cage_base)->interpreter_trampoline(cage_base);
 }
 
 DEF_GETTER(SharedFunctionInfo, HasInterpreterData, bool) {
-  Object data = function_data(cage_base, kAcquireLoad);
-  if (data.IsCode(cage_base)) {
-    Code baseline_code = Code::cast(data);
-    DCHECK_EQ(baseline_code.kind(), CodeKind::BASELINE);
-    data = baseline_code.bytecode_or_interpreter_data(cage_base);
+  Tagged<Object> data = function_data(cage_base, kAcquireLoad);
+  if (IsCode(data, cage_base)) {
+    Tagged<Code> baseline_code = Code::cast(data);
+    DCHECK_EQ(baseline_code->kind(), CodeKind::BASELINE);
+    data = baseline_code->bytecode_or_interpreter_data(cage_base);
   }
-  return data.IsInterpreterData(cage_base);
+  return IsInterpreterData(data, cage_base);
 }
 
-DEF_GETTER(SharedFunctionInfo, interpreter_data, InterpreterData) {
+DEF_GETTER(SharedFunctionInfo, interpreter_data, Tagged<InterpreterData>) {
   DCHECK(HasInterpreterData(cage_base));
-  Object data = function_data(cage_base, kAcquireLoad);
-  if (data.IsCode(cage_base)) {
-    Code baseline_code = Code::cast(data);
-    DCHECK_EQ(baseline_code.kind(), CodeKind::BASELINE);
-    data = baseline_code.bytecode_or_interpreter_data(cage_base);
+  Tagged<Object> data = function_data(cage_base, kAcquireLoad);
+  if (IsCode(data, cage_base)) {
+    Tagged<Code> baseline_code = Code::cast(data);
+    DCHECK_EQ(baseline_code->kind(), CodeKind::BASELINE);
+    data = baseline_code->bytecode_or_interpreter_data(cage_base);
   }
   return InterpreterData::cast(data);
 }
 
 void SharedFunctionInfo::set_interpreter_data(
-    InterpreterData interpreter_data) {
+    Tagged<InterpreterData> interpreter_data, WriteBarrierMode mode) {
   DCHECK(v8_flags.interpreted_frames_native_stack);
   DCHECK(!HasBaselineCode());
-  set_function_data(interpreter_data, kReleaseStore);
+  set_function_data(interpreter_data, kReleaseStore, mode);
 }
 
 DEF_GETTER(SharedFunctionInfo, HasBaselineCode, bool) {
-  Object data = function_data(cage_base, kAcquireLoad);
-  if (data.IsCode(cage_base)) {
-    DCHECK_EQ(Code::cast(data).kind(), CodeKind::BASELINE);
+  Tagged<Object> data = function_data(cage_base, kAcquireLoad);
+  if (IsCode(data, cage_base)) {
+    DCHECK_EQ(Code::cast(data)->kind(), CodeKind::BASELINE);
     return true;
   }
   return false;
 }
 
-DEF_ACQUIRE_GETTER(SharedFunctionInfo, baseline_code, Code) {
+DEF_ACQUIRE_GETTER(SharedFunctionInfo, baseline_code, Tagged<Code>) {
   DCHECK(HasBaselineCode(cage_base));
   return Code::cast(function_data(cage_base, kAcquireLoad));
 }
 
-void SharedFunctionInfo::set_baseline_code(Code baseline_code,
+void SharedFunctionInfo::set_baseline_code(Tagged<Code> baseline_code,
                                            ReleaseStoreTag tag,
                                            WriteBarrierMode mode) {
-  DCHECK_EQ(baseline_code.kind(), CodeKind::BASELINE);
+  DCHECK_EQ(baseline_code->kind(), CodeKind::BASELINE);
   set_function_data(baseline_code, tag, mode);
 }
 
 void SharedFunctionInfo::FlushBaselineCode() {
   DCHECK(HasBaselineCode());
-  set_function_data(baseline_code(kAcquireLoad).bytecode_or_interpreter_data(),
+  set_function_data(baseline_code(kAcquireLoad)->bytecode_or_interpreter_data(),
                     kReleaseStore);
 }
 
 #if V8_ENABLE_WEBASSEMBLY
 bool SharedFunctionInfo::HasAsmWasmData() const {
-  return function_data(kAcquireLoad).IsAsmWasmData();
+  return IsAsmWasmData(function_data(kAcquireLoad));
 }
 
 bool SharedFunctionInfo::HasWasmFunctionData() const {
-  return function_data(kAcquireLoad).IsWasmFunctionData();
+  return IsWasmFunctionData(function_data(kAcquireLoad));
 }
 
 bool SharedFunctionInfo::HasWasmExportedFunctionData() const {
-  return function_data(kAcquireLoad).IsWasmExportedFunctionData();
+  return IsWasmExportedFunctionData(function_data(kAcquireLoad));
 }
 
 bool SharedFunctionInfo::HasWasmJSFunctionData() const {
-  return function_data(kAcquireLoad).IsWasmJSFunctionData();
+  return IsWasmJSFunctionData(function_data(kAcquireLoad));
 }
 
 bool SharedFunctionInfo::HasWasmCapiFunctionData() const {
-  return function_data(kAcquireLoad).IsWasmCapiFunctionData();
+  return IsWasmCapiFunctionData(function_data(kAcquireLoad));
 }
 
 bool SharedFunctionInfo::HasWasmResumeData() const {
-  return function_data(kAcquireLoad).IsWasmResumeData();
+  return IsWasmResumeData(function_data(kAcquireLoad));
 }
 
-AsmWasmData SharedFunctionInfo::asm_wasm_data() const {
+DEF_GETTER(SharedFunctionInfo, asm_wasm_data, Tagged<AsmWasmData>) {
   DCHECK(HasAsmWasmData());
   return AsmWasmData::cast(function_data(kAcquireLoad));
 }
 
-void SharedFunctionInfo::set_asm_wasm_data(AsmWasmData data) {
+void SharedFunctionInfo::set_asm_wasm_data(Tagged<AsmWasmData> data,
+                                           WriteBarrierMode mode) {
   DCHECK(function_data(kAcquireLoad) == Smi::FromEnum(Builtin::kCompileLazy) ||
          HasUncompiledData() || HasAsmWasmData());
-  set_function_data(data, kReleaseStore);
+  set_function_data(data, kReleaseStore, mode);
 }
 
 const wasm::WasmModule* SharedFunctionInfo::wasm_module() const {
   if (!HasWasmExportedFunctionData()) return nullptr;
   const WasmExportedFunctionData& function_data = wasm_exported_function_data();
-  const WasmInstanceObject& wasm_instance = function_data.instance();
-  const WasmModuleObject& wasm_module_object = wasm_instance.module_object();
-  return wasm_module_object.module();
+  const WasmInstanceObject& wasm_instance = function_data->instance();
+  const WasmModuleObject& wasm_module_object = wasm_instance->module_object();
+  return wasm_module_object->module();
 }
 
 const wasm::FunctionSig* SharedFunctionInfo::wasm_function_signature() const {
   const wasm::WasmModule* module = wasm_module();
   if (!module) return nullptr;
   const WasmExportedFunctionData& function_data = wasm_exported_function_data();
-  DCHECK_LT(function_data.function_index(), module->functions.size());
-  return module->functions[function_data.function_index()].sig;
+  DCHECK_LT(function_data->function_index(), module->functions.size());
+  return module->functions[function_data->function_index()].sig;
 }
 
 int SharedFunctionInfo::wasm_function_index() const {
   if (!HasWasmExportedFunctionData()) return -1;
   const WasmExportedFunctionData& function_data = wasm_exported_function_data();
-  DCHECK_GE(function_data.function_index(), 0);
-  DCHECK_LT(function_data.function_index(), wasm_module()->functions.size());
-  return function_data.function_index();
+  DCHECK_GE(function_data->function_index(), 0);
+  DCHECK_LT(function_data->function_index(), wasm_module()->functions.size());
+  return function_data->function_index();
+}
+
+DEF_GETTER(SharedFunctionInfo, wasm_function_data, Tagged<WasmFunctionData>) {
+  DCHECK(HasWasmFunctionData());
+  return WasmFunctionData::cast(function_data(cage_base, kAcquireLoad));
+}
+
+DEF_GETTER(SharedFunctionInfo, wasm_exported_function_data,
+           Tagged<WasmExportedFunctionData>) {
+  DCHECK(HasWasmExportedFunctionData());
+  return WasmExportedFunctionData::cast(function_data(cage_base, kAcquireLoad));
+}
+
+DEF_GETTER(SharedFunctionInfo, wasm_js_function_data,
+           Tagged<WasmJSFunctionData>) {
+  DCHECK(HasWasmJSFunctionData());
+  return WasmJSFunctionData::cast(function_data(cage_base, kAcquireLoad));
+}
+
+DEF_GETTER(SharedFunctionInfo, wasm_capi_function_data,
+           Tagged<WasmCapiFunctionData>) {
+  DCHECK(HasWasmCapiFunctionData());
+  return WasmCapiFunctionData::cast(function_data(cage_base, kAcquireLoad));
+}
+
+DEF_GETTER(SharedFunctionInfo, wasm_resume_data, Tagged<WasmResumeData>) {
+  DCHECK(HasWasmResumeData());
+  return WasmResumeData::cast(function_data(cage_base, kAcquireLoad));
 }
 
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 bool SharedFunctionInfo::HasBuiltinId() const {
-  return function_data(kAcquireLoad).IsSmi();
+  return IsSmi(function_data(kAcquireLoad));
 }
 
 Builtin SharedFunctionInfo::builtin_id() const {
@@ -782,56 +827,59 @@ void SharedFunctionInfo::set_builtin_id(Builtin builtin) {
 }
 
 bool SharedFunctionInfo::HasUncompiledData() const {
-  return function_data(kAcquireLoad).IsUncompiledData();
+  return IsUncompiledData(function_data(kAcquireLoad));
 }
 
-UncompiledData SharedFunctionInfo::uncompiled_data() const {
+DEF_GETTER(SharedFunctionInfo, uncompiled_data, Tagged<UncompiledData>) {
   DCHECK(HasUncompiledData());
-  return UncompiledData::cast(function_data(kAcquireLoad));
+  return UncompiledData::cast(function_data(cage_base, kAcquireLoad));
 }
 
-void SharedFunctionInfo::set_uncompiled_data(UncompiledData uncompiled_data) {
+void SharedFunctionInfo::set_uncompiled_data(
+    Tagged<UncompiledData> uncompiled_data, WriteBarrierMode mode) {
   DCHECK(function_data(kAcquireLoad) == Smi::FromEnum(Builtin::kCompileLazy) ||
          HasUncompiledData());
-  DCHECK(uncompiled_data.IsUncompiledData());
+  DCHECK(IsUncompiledData(uncompiled_data));
   set_function_data(uncompiled_data, kReleaseStore);
 }
 
 bool SharedFunctionInfo::HasUncompiledDataWithPreparseData() const {
-  return function_data(kAcquireLoad).IsUncompiledDataWithPreparseData();
+  return IsUncompiledDataWithPreparseData(function_data(kAcquireLoad));
 }
 
-UncompiledDataWithPreparseData
+Tagged<UncompiledDataWithPreparseData>
 SharedFunctionInfo::uncompiled_data_with_preparse_data() const {
   DCHECK(HasUncompiledDataWithPreparseData());
   return UncompiledDataWithPreparseData::cast(function_data(kAcquireLoad));
 }
 
 void SharedFunctionInfo::set_uncompiled_data_with_preparse_data(
-    UncompiledDataWithPreparseData uncompiled_data_with_preparse_data) {
+    Tagged<UncompiledDataWithPreparseData> uncompiled_data_with_preparse_data,
+    WriteBarrierMode mode) {
   DCHECK(function_data(kAcquireLoad) == Smi::FromEnum(Builtin::kCompileLazy));
-  DCHECK(uncompiled_data_with_preparse_data.IsUncompiledDataWithPreparseData());
+  DCHECK(IsUncompiledDataWithPreparseData(uncompiled_data_with_preparse_data));
   set_function_data(uncompiled_data_with_preparse_data, kReleaseStore);
 }
 
 bool SharedFunctionInfo::HasUncompiledDataWithoutPreparseData() const {
-  return function_data(kAcquireLoad).IsUncompiledDataWithoutPreparseData();
+  return IsUncompiledDataWithoutPreparseData(function_data(kAcquireLoad));
 }
 
 void SharedFunctionInfo::ClearUncompiledDataJobPointer() {
-  UncompiledData uncompiled_data = this->uncompiled_data();
-  if (uncompiled_data.IsUncompiledDataWithPreparseDataAndJob()) {
+  Tagged<UncompiledData> uncompiled_data = this->uncompiled_data();
+  if (IsUncompiledDataWithPreparseDataAndJob(uncompiled_data)) {
     UncompiledDataWithPreparseDataAndJob::cast(uncompiled_data)
-        .set_job(kNullAddress);
-  } else if (uncompiled_data.IsUncompiledDataWithoutPreparseDataWithJob()) {
+        ->set_job(kNullAddress);
+  } else if (IsUncompiledDataWithoutPreparseDataWithJob(uncompiled_data)) {
     UncompiledDataWithoutPreparseDataWithJob::cast(uncompiled_data)
-        .set_job(kNullAddress);
+        ->set_job(kNullAddress);
   }
 }
 
 void SharedFunctionInfo::ClearPreparseData() {
   DCHECK(HasUncompiledDataWithPreparseData());
-  UncompiledDataWithPreparseData data = uncompiled_data_with_preparse_data();
+  Tagged<UncompiledDataWithPreparseData> data =
+      uncompiled_data_with_preparse_data();
 
   // Trim off the pre-parsed scope data from the uncompiled data by swapping the
   // map, leaving only an uncompiled data without pre-parsed scope.
@@ -852,16 +900,17 @@ void SharedFunctionInfo::ClearPreparseData() {
                                ClearRecordedSlots::kYes);
 
   // Swap the map.
-  data.set_map(GetReadOnlyRoots().uncompiled_data_without_preparse_data_map(),
-               kReleaseStore);
+  data->set_map(GetReadOnlyRoots().uncompiled_data_without_preparse_data_map(),
+                kReleaseStore);
 
   // Ensure that the clear was successful.
   DCHECK(HasUncompiledDataWithoutPreparseData());
 }
 
 void UncompiledData::InitAfterBytecodeFlush(
-    String inferred_name, int start_position, int end_position,
-    std::function<void(HeapObject object, ObjectSlot slot, HeapObject target)>
+    Tagged<String> inferred_name, int start_position, int end_position,
+    std::function<void(Tagged<HeapObject> object, ObjectSlot slot,
+                       Tagged<HeapObject> target)>
         gc_notify_updated_slot) {
   set_inferred_name(inferred_name);
   gc_notify_updated_slot(*this, RawField(UncompiledData::kInferredNameOffset),
@@ -870,75 +919,43 @@ void UncompiledData::InitAfterBytecodeFlush(
   set_end_position(end_position);
 }
 
-DEF_GETTER(SharedFunctionInfo, script, HeapObject) {
-  HeapObject maybe_script = script_or_debug_info(cage_base, kAcquireLoad);
-  if (maybe_script.IsDebugInfo(cage_base)) {
-    return DebugInfo::cast(maybe_script).script();
-  }
-  return maybe_script;
-}
-
-void SharedFunctionInfo::set_script(HeapObject script) {
-  HeapObject maybe_debug_info = script_or_debug_info(kAcquireLoad);
-  if (maybe_debug_info.IsDebugInfo()) {
-    DebugInfo::cast(maybe_debug_info).set_script(script);
-  } else {
-    set_script_or_debug_info(script, kReleaseStore);
-  }
-}
-
 bool SharedFunctionInfo::is_repl_mode() const {
-  return script().IsScript() && Script::cast(script()).is_repl_mode();
-}
-
-DEF_GETTER(SharedFunctionInfo, HasDebugInfo, bool) {
-  return script_or_debug_info(cage_base, kAcquireLoad).IsDebugInfo(cage_base);
-}
-
-DEF_GETTER(SharedFunctionInfo, GetDebugInfo, DebugInfo) {
-  auto debug_info = script_or_debug_info(cage_base, kAcquireLoad);
-  DCHECK(debug_info.IsDebugInfo(cage_base));
-  return DebugInfo::cast(debug_info);
-}
-
-void SharedFunctionInfo::SetDebugInfo(DebugInfo debug_info) {
-  DCHECK(!HasDebugInfo());
-  DCHECK_EQ(debug_info.script(), script_or_debug_info(kAcquireLoad));
-  set_script_or_debug_info(debug_info, kReleaseStore);
+  return IsScript(script()) && Script::cast(script())->is_repl_mode();
 }
 
 bool SharedFunctionInfo::HasInferredName() {
-  Object scope_info = name_or_scope_info(kAcquireLoad);
-  if (scope_info.IsScopeInfo()) {
-    return ScopeInfo::cast(scope_info).HasInferredFunctionName();
+  Tagged<Object> scope_info = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(scope_info)) {
+    return ScopeInfo::cast(scope_info)->HasInferredFunctionName();
   }
   return HasUncompiledData();
 }
 
-String SharedFunctionInfo::inferred_name() const {
-  Object maybe_scope_info = name_or_scope_info(kAcquireLoad);
-  if (maybe_scope_info.IsScopeInfo()) {
-    ScopeInfo scope_info = ScopeInfo::cast(maybe_scope_info);
-    if (scope_info.HasInferredFunctionName()) {
-      Object name = scope_info.InferredFunctionName();
-      if (name.IsString()) return String::cast(name);
+DEF_GETTER(SharedFunctionInfo, inferred_name, Tagged<String>) {
+  Tagged<Object> maybe_scope_info = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(maybe_scope_info)) {
+    Tagged<ScopeInfo> scope_info = ScopeInfo::cast(maybe_scope_info);
+    if (scope_info->HasInferredFunctionName()) {
+      Tagged<Object> name = scope_info->InferredFunctionName();
+      if (IsString(name)) return String::cast(name);
     }
   } else if (HasUncompiledData()) {
-    return uncompiled_data().inferred_name();
+    return uncompiled_data(cage_base)->inferred_name(cage_base);
   }
   return GetReadOnlyRoots().empty_string();
 }
 
 bool SharedFunctionInfo::IsUserJavaScript() const {
-  Object script_obj = script();
-  if (script_obj.IsUndefined()) return false;
-  Script script = Script::cast(script_obj);
-  return script.IsUserJavaScript();
+  Tagged<Object> script_obj = script();
+  if (IsUndefined(script_obj)) return false;
+  Tagged<Script> script = Script::cast(script_obj);
+  return script->IsUserJavaScript();
 }
 
 bool SharedFunctionInfo::IsSubjectToDebugging() const {
 #if V8_ENABLE_WEBASSEMBLY
   if (HasAsmWasmData()) return false;
+  if (HasWasmExportedFunctionData()) return false;
 #endif  // V8_ENABLE_WEBASSEMBLY
   return IsUserJavaScript();
 }
diff --git a/deps/v8/src/objects/shared-function-info.cc b/deps/v8/src/objects/shared-function-info.cc
index 60e6f42c754fac..a2eedb0fc73ac6 100644
--- a/deps/v8/src/objects/shared-function-info.cc
+++ b/deps/v8/src/objects/shared-function-info.cc
@@ -8,23 +8,27 @@
 #include "src/ast/scopes.h"
 #include "src/codegen/compilation-cache.h"
 #include "src/codegen/compiler.h"
+#include "src/codegen/optimized-compilation-info.h"
 #include "src/common/globals.h"
+#include "src/debug/debug.h"
 #include "src/diagnostics/code-tracer.h"
 #include "src/execution/isolate-utils.h"
+#include "src/heap/combined-heap.h"
 #include "src/objects/shared-function-info-inl.h"
 #include "src/strings/string-builder-inl.h"
 
 namespace v8 {
 namespace internal {
 
-V8_EXPORT_PRIVATE constexpr Smi SharedFunctionInfo::kNoSharedNameSentinel;
+V8_EXPORT_PRIVATE constexpr Tagged<Smi>
+    SharedFunctionInfo::kNoSharedNameSentinel;
 
 uint32_t SharedFunctionInfo::Hash() {
   // Hash SharedFunctionInfo based on its start position and script id. Note: we
   // don't use the function's literal id since getting that is slow for compiled
-  // funcitons.
+  // functions.
   int start_pos = StartPosition();
-  int script_id = script().IsScript() ? Script::cast(script()).id() : 0;
+  int script_id = IsScript(script()) ? Script::cast(script())->id() : 0;
   return static_cast<uint32_t>(base::hash_combine(start_pos, script_id));
 }
 
@@ -45,12 +49,9 @@ void SharedFunctionInfo::Init(ReadOnlyRoots ro_roots, int unique_id) {
   // SharedFunctionInfo in a consistent state.
   set_raw_outer_scope_info_or_feedback_metadata(ro_roots.the_hole_value(),
                                                 SKIP_WRITE_BARRIER);
-  set_script_or_debug_info(ro_roots.undefined_value(), kReleaseStore,
-                           SKIP_WRITE_BARRIER);
+  set_script(ro_roots.undefined_value(), kReleaseStore, SKIP_WRITE_BARRIER);
   set_function_literal_id(kFunctionLiteralIdInvalid);
-#if V8_SFI_HAS_UNIQUE_ID
   set_unique_id(unique_id);
-#endif
 
   // Set integer fields (smi or int, depending on the architecture).
   set_length(0);
@@ -65,50 +66,52 @@ void SharedFunctionInfo::Init(ReadOnlyRoots ro_roots, int unique_id) {
 
   UpdateFunctionMapIndex();
 
+  set_age(0);
+
   clear_padding();
 }
 
-Code SharedFunctionInfo::GetCode(Isolate* isolate) const {
+Tagged<Code> SharedFunctionInfo::GetCode(Isolate* isolate) const {
   // ======
   // NOTE: This chain of checks MUST be kept in sync with the equivalent CSA
   // GetSharedFunctionInfoCode method in code-stub-assembler.cc.
   // ======
 
-  Object data = function_data(kAcquireLoad);
-  if (data.IsSmi()) {
+  Tagged<Object> data = function_data(kAcquireLoad);
+  if (IsSmi(data)) {
     // Holding a Smi means we are a builtin.
     DCHECK(HasBuiltinId());
     return isolate->builtins()->code(builtin_id());
   }
-  if (data.IsBytecodeArray()) {
+  if (IsBytecodeArray(data)) {
     // Having a bytecode array means we are a compiled, interpreted function.
     DCHECK(HasBytecodeArray());
     return isolate->builtins()->code(Builtin::kInterpreterEntryTrampoline);
   }
-  if (data.IsCode()) {
+  if (IsCode(data)) {
     // Having baseline Code means we are a compiled, baseline function.
     DCHECK(HasBaselineCode());
     return Code::cast(data);
   }
 #if V8_ENABLE_WEBASSEMBLY
-  if (data.IsAsmWasmData()) {
+  if (IsAsmWasmData(data)) {
     // Having AsmWasmData means we are an asm.js/wasm function.
     DCHECK(HasAsmWasmData());
     return isolate->builtins()->code(Builtin::kInstantiateAsmJs);
   }
-  if (data.IsWasmExportedFunctionData()) {
+  if (IsWasmExportedFunctionData(data)) {
     // Having a WasmExportedFunctionData means the code is in there.
     DCHECK(HasWasmExportedFunctionData());
-    return wasm_exported_function_data().wrapper_code();
+    return wasm_exported_function_data()->wrapper_code();
   }
-  if (data.IsWasmJSFunctionData()) {
-    return wasm_js_function_data().wrapper_code();
+  if (IsWasmJSFunctionData(data)) {
+    return wasm_js_function_data()->wrapper_code();
   }
-  if (data.IsWasmCapiFunctionData()) {
-    return wasm_capi_function_data().wrapper_code();
+  if (IsWasmCapiFunctionData(data)) {
+    return wasm_capi_function_data()->wrapper_code();
   }
-  if (data.IsWasmResumeData()) {
-    if (static_cast<wasm::OnResume>(wasm_resume_data().on_resume()) ==
+  if (IsWasmResumeData(data)) {
+    if (static_cast<wasm::OnResume>(wasm_resume_data()->on_resume()) ==
         wasm::OnResume::kContinue) {
       return isolate->builtins()->code(Builtin::kWasmResume);
     } else {
@@ -116,66 +119,38 @@ Code SharedFunctionInfo::GetCode(Isolate* isolate) const {
     }
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
-  if (data.IsUncompiledData()) {
+  if (IsUncompiledData(data)) {
     // Having uncompiled data (with or without scope) means we need to compile.
     DCHECK(HasUncompiledData());
     return isolate->builtins()->code(Builtin::kCompileLazy);
   }
-  if (data.IsFunctionTemplateInfo()) {
+  if (IsFunctionTemplateInfo(data)) {
     // Having a function template info means we are an API function.
     DCHECK(IsApiFunction());
-    return isolate->builtins()->code(Builtin::kHandleApiCall);
+    return isolate->builtins()->code(Builtin::kHandleApiCallOrConstruct);
   }
-  if (data.IsInterpreterData()) {
-    Code code = InterpreterTrampoline();
-    DCHECK(code.IsCode());
-    DCHECK(code.is_interpreter_trampoline_builtin());
+  if (IsInterpreterData(data)) {
+    Tagged<Code> code = InterpreterTrampoline();
+    DCHECK(IsCode(code));
+    DCHECK(code->is_interpreter_trampoline_builtin());
     return code;
   }
   UNREACHABLE();
 }
 
-#if V8_ENABLE_WEBASSEMBLY
-WasmFunctionData SharedFunctionInfo::wasm_function_data() const {
-  DCHECK(HasWasmFunctionData());
-  return WasmFunctionData::cast(function_data(kAcquireLoad));
-}
-
-WasmExportedFunctionData SharedFunctionInfo::wasm_exported_function_data()
-    const {
-  DCHECK(HasWasmExportedFunctionData());
-  return WasmExportedFunctionData::cast(function_data(kAcquireLoad));
-}
-
-WasmJSFunctionData SharedFunctionInfo::wasm_js_function_data() const {
-  DCHECK(HasWasmJSFunctionData());
-  return WasmJSFunctionData::cast(function_data(kAcquireLoad));
-}
-
-WasmCapiFunctionData SharedFunctionInfo::wasm_capi_function_data() const {
-  DCHECK(HasWasmCapiFunctionData());
-  return WasmCapiFunctionData::cast(function_data(kAcquireLoad));
-}
-
-WasmResumeData SharedFunctionInfo::wasm_resume_data() const {
-  DCHECK(HasWasmResumeData());
-  return WasmResumeData::cast(function_data(kAcquireLoad));
-}
-#endif  // V8_ENABLE_WEBASSEMBLY
-
 SharedFunctionInfo::ScriptIterator::ScriptIterator(Isolate* isolate,
-                                                   Script script)
-    : ScriptIterator(handle(script.shared_function_infos(), isolate)) {}
+                                                   Tagged<Script> script)
+    : ScriptIterator(handle(script->shared_function_infos(), isolate)) {}
 
 SharedFunctionInfo::ScriptIterator::ScriptIterator(
     Handle<WeakFixedArray> shared_function_infos)
     : shared_function_infos_(shared_function_infos), index_(0) {}
 
-SharedFunctionInfo SharedFunctionInfo::ScriptIterator::Next() {
+Tagged<SharedFunctionInfo> SharedFunctionInfo::ScriptIterator::Next() {
   while (index_ < shared_function_infos_->length()) {
     MaybeObject raw = shared_function_infos_->Get(index_++);
-    HeapObject heap_object;
-    if (!raw->GetHeapObject(&heap_object) || heap_object.IsUndefined()) {
+    Tagged<HeapObject> heap_object;
+    if (!raw.GetHeapObject(&heap_object) || IsUndefined(heap_object)) {
       continue;
     }
     return SharedFunctionInfo::cast(heap_object);
@@ -184,13 +159,13 @@ SharedFunctionInfo SharedFunctionInfo::ScriptIterator::Next() {
 }
 
 void SharedFunctionInfo::ScriptIterator::Reset(Isolate* isolate,
-                                               Script script) {
-  shared_function_infos_ = handle(script.shared_function_infos(), isolate);
+                                               Tagged<Script> script) {
+  shared_function_infos_ = handle(script->shared_function_infos(), isolate);
   index_ = 0;
 }
 
 void SharedFunctionInfo::SetScript(ReadOnlyRoots roots,
-                                   HeapObject script_object,
+                                   Tagged<HeapObject> script_object,
                                    int function_literal_id,
                                    bool reset_preparsed_scope_data) {
   DisallowGarbageCollection no_gc;
@@ -205,34 +180,34 @@ void SharedFunctionInfo::SetScript(ReadOnlyRoots roots,
   // the shared function info may be temporarily in two lists.
   // This is okay because the gc-time processing of these lists can tolerate
   // duplicates.
-  if (script_object.IsScript()) {
-    DCHECK(!script().IsScript());
-    Script script = Script::cast(script_object);
-    WeakFixedArray list = script.shared_function_infos();
+  if (IsScript(script_object)) {
+    DCHECK(!IsScript(script()));
+    Tagged<Script> script = Script::cast(script_object);
+    Tagged<WeakFixedArray> list = script->shared_function_infos();
 #ifdef DEBUG
-    DCHECK_LT(function_literal_id, list.length());
-    MaybeObject maybe_object = list.Get(function_literal_id);
-    HeapObject heap_object;
-    if (maybe_object->GetHeapObjectIfWeak(&heap_object)) {
+    DCHECK_LT(function_literal_id, list->length());
+    MaybeObject maybe_object = list->Get(function_literal_id);
+    Tagged<HeapObject> heap_object;
+    if (maybe_object.GetHeapObjectIfWeak(&heap_object)) {
       DCHECK_EQ(heap_object, *this);
     }
 #endif
-    list.Set(function_literal_id, HeapObjectReference::Weak(*this));
+    list->Set(function_literal_id, HeapObjectReference::Weak(*this));
   } else {
-    DCHECK(script().IsScript());
+    DCHECK(IsScript(script()));
 
     // Remove shared function info from old script's list.
-    Script old_script = Script::cast(script());
+    Tagged<Script> old_script = Script::cast(script());
 
     // Due to liveedit, it might happen that the old_script doesn't know
     // about the SharedFunctionInfo, so we have to guard against that.
-    WeakFixedArray infos = old_script.shared_function_infos();
-    if (function_literal_id < infos.length()) {
+    Tagged<WeakFixedArray> infos = old_script->shared_function_infos();
+    if (function_literal_id < infos->length()) {
       MaybeObject raw =
-          old_script.shared_function_infos().Get(function_literal_id);
-      HeapObject heap_object;
-      if (raw->GetHeapObjectIfWeak(&heap_object) && heap_object == *this) {
-        old_script.shared_function_infos().Set(
+          old_script->shared_function_infos()->Get(function_literal_id);
+      Tagged<HeapObject> heap_object;
+      if (raw.GetHeapObjectIfWeak(&heap_object) && heap_object == *this) {
+        old_script->shared_function_infos()->Set(
             function_literal_id,
             HeapObjectReference::Strong(roots.undefined_value()));
       }
@@ -240,75 +215,84 @@ void SharedFunctionInfo::SetScript(ReadOnlyRoots roots,
   }
 
   // Finally set new script.
-  set_script(script_object);
+  set_script(script_object, kReleaseStore);
 }
 
-void SharedFunctionInfo::CopyFrom(SharedFunctionInfo other) {
+void SharedFunctionInfo::CopyFrom(Tagged<SharedFunctionInfo> other) {
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
-  set_function_data(other.function_data(cage_base, kAcquireLoad),
+  set_function_data(other->function_data(cage_base, kAcquireLoad),
                     kReleaseStore);
-  set_name_or_scope_info(other.name_or_scope_info(cage_base, kAcquireLoad),
+  set_name_or_scope_info(other->name_or_scope_info(cage_base, kAcquireLoad),
                          kReleaseStore);
   set_outer_scope_info_or_feedback_metadata(
-      other.outer_scope_info_or_feedback_metadata(cage_base));
-  set_script_or_debug_info(other.script_or_debug_info(cage_base, kAcquireLoad),
-                           kReleaseStore);
-
-  set_length(other.length());
-  set_formal_parameter_count(other.formal_parameter_count());
-  set_function_token_offset(other.function_token_offset());
-  set_expected_nof_properties(other.expected_nof_properties());
-  set_flags2(other.flags2());
-  set_flags(other.flags(kRelaxedLoad), kRelaxedStore);
-  set_function_literal_id(other.function_literal_id());
-#if V8_SFI_HAS_UNIQUE_ID
-  set_unique_id(other.unique_id());
-#endif
+      other->outer_scope_info_or_feedback_metadata(cage_base));
+  set_script(other->script(cage_base, kAcquireLoad), kReleaseStore);
+
+  set_length(other->length());
+  set_formal_parameter_count(other->formal_parameter_count());
+  set_function_token_offset(other->function_token_offset());
+  set_expected_nof_properties(other->expected_nof_properties());
+  set_flags2(other->flags2());
+  set_flags(other->flags(kRelaxedLoad), kRelaxedStore);
+  set_function_literal_id(other->function_literal_id());
+  set_unique_id(other->unique_id());
+
+#if DEBUG
+  // Copy age just for the following memcmp-check.
+  set_age(other->age());
 
   // This should now be byte-for-byte identical to the input.
   DCHECK_EQ(memcmp(reinterpret_cast<void*>(address()),
                    reinterpret_cast<void*>(other.address()),
                    SharedFunctionInfo::kSize),
             0);
+#endif
+
+  set_age(0);
+}
+
+bool SharedFunctionInfo::HasDebugInfo(Isolate* isolate) const {
+  return isolate->debug()->HasDebugInfo(*this);
+}
+
+Tagged<DebugInfo> SharedFunctionInfo::GetDebugInfo(Isolate* isolate) const {
+  return isolate->debug()->TryGetDebugInfo(*this).value();
 }
 
-bool SharedFunctionInfo::HasBreakInfo() const {
-  if (!HasDebugInfo()) return false;
-  DebugInfo info = GetDebugInfo();
-  bool has_break_info = info.HasBreakInfo();
-  return has_break_info;
+base::Optional<Tagged<DebugInfo>> SharedFunctionInfo::TryGetDebugInfo(
+    Isolate* isolate) const {
+  return isolate->debug()->TryGetDebugInfo(*this);
 }
 
-bool SharedFunctionInfo::BreakAtEntry() const {
-  if (!HasDebugInfo()) return false;
-  DebugInfo info = GetDebugInfo();
-  bool break_at_entry = info.BreakAtEntry();
-  return break_at_entry;
+bool SharedFunctionInfo::HasBreakInfo(Isolate* isolate) const {
+  return isolate->debug()->HasBreakInfo(*this);
 }
 
-bool SharedFunctionInfo::HasCoverageInfo() const {
-  if (!HasDebugInfo()) return false;
-  DebugInfo info = GetDebugInfo();
-  bool has_coverage_info = info.HasCoverageInfo();
-  return has_coverage_info;
+bool SharedFunctionInfo::BreakAtEntry(Isolate* isolate) const {
+  return isolate->debug()->BreakAtEntry(*this);
 }
 
-CoverageInfo SharedFunctionInfo::GetCoverageInfo() const {
-  DCHECK(HasCoverageInfo());
-  return CoverageInfo::cast(GetDebugInfo().coverage_info());
+bool SharedFunctionInfo::HasCoverageInfo(Isolate* isolate) const {
+  return isolate->debug()->HasCoverageInfo(*this);
+}
+
+Tagged<CoverageInfo> SharedFunctionInfo::GetCoverageInfo(
+    Isolate* isolate) const {
+  DCHECK(HasCoverageInfo(isolate));
+  return CoverageInfo::cast(GetDebugInfo(isolate)->coverage_info());
 }
 
 std::unique_ptr<char[]> SharedFunctionInfo::DebugNameCStr() const {
 #if V8_ENABLE_WEBASSEMBLY
   if (HasWasmExportedFunctionData()) {
     return WasmExportedFunction::GetDebugName(
-        wasm_exported_function_data().sig());
+        wasm_exported_function_data()->sig());
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
   DisallowGarbageCollection no_gc;
-  String function_name = Name();
-  if (function_name.length() == 0) function_name = inferred_name();
-  return function_name.ToCString();
+  Tagged<String> function_name = Name();
+  if (function_name->length() == 0) function_name = inferred_name();
+  return function_name->ToCString();
 }
 
 // static
@@ -321,9 +305,15 @@ Handle<String> SharedFunctionInfo::DebugName(
         .ToHandleChecked();
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
+  FunctionKind function_kind = shared->kind();
+  if (IsClassMembersInitializerFunction(function_kind)) {
+    return function_kind == FunctionKind::kClassMembersInitializerFunction
+               ? isolate->factory()->instance_members_initializer_string()
+               : isolate->factory()->static_initializer_string();
+  }
   DisallowHeapAllocation no_gc;
-  String function_name = shared->Name();
-  if (function_name.length() == 0) function_name = shared->inferred_name();
+  Tagged<String> function_name = shared->Name();
+  if (function_name->length() == 0) function_name = shared->inferred_name();
   return handle(function_name, isolate);
 }
 
@@ -335,27 +325,28 @@ bool SharedFunctionInfo::PassesFilter(const char* raw_filter) {
 
 bool SharedFunctionInfo::HasSourceCode() const {
   ReadOnlyRoots roots = GetReadOnlyRoots();
-  return !script().IsUndefined(roots) &&
-         !Script::cast(script()).source().IsUndefined(roots) &&
-         String::cast(Script::cast(script()).source()).length() > 0;
+  return !IsUndefined(script(), roots) &&
+         !IsUndefined(Script::cast(script())->source(), roots) &&
+         String::cast(Script::cast(script())->source())->length() > 0;
 }
 
 void SharedFunctionInfo::DiscardCompiledMetadata(
     Isolate* isolate,
-    std::function<void(HeapObject object, ObjectSlot slot, HeapObject target)>
+    std::function<void(Tagged<HeapObject> object, ObjectSlot slot,
+                       Tagged<HeapObject> target)>
         gc_notify_updated_slot) {
   DisallowGarbageCollection no_gc;
   if (HasFeedbackMetadata()) {
-    if (v8_flags.trace_flush_bytecode) {
+    if (v8_flags.trace_flush_code) {
       CodeTracer::Scope scope(isolate->GetCodeTracer());
       PrintF(scope.file(), "[discarding compiled metadata for ");
-      ShortPrint(scope.file());
+      ShortPrint(*this, scope.file());
       PrintF(scope.file(), "]\n");
     }
 
-    HeapObject outer_scope_info;
-    if (scope_info().HasOuterScopeInfo()) {
-      outer_scope_info = scope_info().OuterScopeInfo();
+    Tagged<HeapObject> outer_scope_info;
+    if (scope_info()->HasOuterScopeInfo()) {
+      outer_scope_info = scope_info()->OuterScopeInfo();
     } else {
       outer_scope_info = ReadOnlyRoots(isolate).the_hole_value();
     }
@@ -368,7 +359,7 @@ void SharedFunctionInfo::DiscardCompiledMetadata(
         RawField(SharedFunctionInfo::kOuterScopeInfoOrFeedbackMetadataOffset),
         outer_scope_info);
   } else {
-    DCHECK(outer_scope_info().IsScopeInfo() || outer_scope_info().IsTheHole());
+    DCHECK(IsScopeInfo(outer_scope_info()) || IsTheHole(outer_scope_info()));
   }
 
   // TODO(rmcilroy): Possibly discard ScopeInfo here as well.
@@ -415,7 +406,7 @@ void SharedFunctionInfo::DiscardCompiled(
 Handle<Object> SharedFunctionInfo::GetSourceCode(
     Isolate* isolate, Handle<SharedFunctionInfo> shared) {
   if (!shared->HasSourceCode()) return isolate->factory()->undefined_value();
-  Handle<String> source(String::cast(Script::cast(shared->script()).source()),
+  Handle<String> source(String::cast(Script::cast(shared->script())->source()),
                         isolate);
   return isolate->factory()->NewSubString(source, shared->StartPosition(),
                                           shared->EndPosition());
@@ -426,7 +417,7 @@ Handle<Object> SharedFunctionInfo::GetSourceCodeHarmony(
     Isolate* isolate, Handle<SharedFunctionInfo> shared) {
   if (!shared->HasSourceCode()) return isolate->factory()->undefined_value();
   Handle<String> script_source(
-      String::cast(Script::cast(shared->script()).source()), isolate);
+      String::cast(Script::cast(shared->script())->source()), isolate);
   int start_pos = shared->function_token_position();
   DCHECK_NE(start_pos, kNoSourcePosition);
   Handle<String> source = isolate->factory()->NewSubString(
@@ -438,7 +429,7 @@ Handle<Object> SharedFunctionInfo::GetSourceCodeHarmony(
   builder.AppendCStringLiteral("function ");
   builder.AppendString(Handle<String>(shared->Name(), isolate));
   builder.AppendCharacter('(');
-  Handle<FixedArray> args(Script::cast(shared->script()).wrapped_arguments(),
+  Handle<FixedArray> args(Script::cast(shared->script())->wrapped_arguments(),
                           isolate);
   int argc = args->length();
   for (int i = 0; i < argc; i++) {
@@ -455,33 +446,33 @@ int SharedFunctionInfo::SourceSize() { return EndPosition() - StartPosition(); }
 
 // Output the source code without any allocation in the heap.
 std::ostream& operator<<(std::ostream& os, const SourceCodeOf& v) {
-  const SharedFunctionInfo s = v.value;
+  const Tagged<SharedFunctionInfo> s = v.value;
   // For some native functions there is no source.
-  if (!s.HasSourceCode()) return os << "<No Source>";
+  if (!s->HasSourceCode()) return os << "<No Source>";
 
   // Get the source for the script which this function came from.
   // Don't use String::cast because we don't want more assertion errors while
   // we are already creating a stack dump.
-  String script_source =
-      String::unchecked_cast(Script::cast(s.script()).source());
+  Tagged<String> script_source =
+      String::unchecked_cast(Script::cast(s->script())->source());
 
-  if (!script_source.LooksValid()) return os << "<Invalid Source>";
+  if (!script_source->LooksValid()) return os << "<Invalid Source>";
 
-  if (!s.is_toplevel()) {
+  if (!s->is_toplevel()) {
     os << "function ";
-    String name = s.Name();
-    if (name.length() > 0) {
-      name.PrintUC16(os);
+    Tagged<String> name = s->Name();
+    if (name->length() > 0) {
+      name->PrintUC16(os);
     }
   }
 
-  int len = s.EndPosition() - s.StartPosition();
+  int len = s->EndPosition() - s->StartPosition();
   if (len <= v.max_length || v.max_length < 0) {
-    script_source.PrintUC16(os, s.StartPosition(), s.EndPosition());
+    script_source->PrintUC16(os, s->StartPosition(), s->EndPosition());
     return os;
   } else {
-    script_source.PrintUC16(os, s.StartPosition(),
-                            s.StartPosition() + v.max_length);
+    script_source->PrintUC16(os, s->StartPosition(),
+                             s->StartPosition() + v.max_length);
     return os << "...\n";
   }
 }
@@ -494,7 +485,7 @@ void SharedFunctionInfo::DisableOptimization(Isolate* isolate,
             kRelaxedStore);
   // Code should be the lazy compilation stub or else interpreted.
   if constexpr (DEBUG_BOOL) {
-    CodeKind kind = abstract_code(isolate).kind(isolate);
+    CodeKind kind = abstract_code(isolate)->kind(isolate);
     CHECK(kind == CodeKind::INTERPRETED_FUNCTION || kind == CodeKind::BUILTIN);
   }
   PROFILE(isolate, CodeDisableOptEvent(handle(abstract_code(isolate), isolate),
@@ -502,7 +493,7 @@ void SharedFunctionInfo::DisableOptimization(Isolate* isolate,
   if (v8_flags.trace_opt) {
     CodeTracer::Scope scope(isolate->GetCodeTracer());
     PrintF(scope.file(), "[disabled optimization for ");
-    ShortPrint(scope.file());
+    ShortPrint(*this, scope.file());
     PrintF(scope.file(), ", reason: %s]\n", GetBailoutReason(reason));
   }
 }
@@ -512,55 +503,55 @@ template <typename IsolateT>
 void SharedFunctionInfo::InitFromFunctionLiteral(
     IsolateT* isolate, Handle<SharedFunctionInfo> shared_info,
     FunctionLiteral* lit, bool is_toplevel) {
-  DCHECK(!shared_info->name_or_scope_info(kAcquireLoad).IsScopeInfo());
+  DCHECK(!IsScopeInfo(shared_info->name_or_scope_info(kAcquireLoad)));
   {
     DisallowGarbageCollection no_gc;
-    auto raw_sfi = *shared_info;
+    Tagged<SharedFunctionInfo> raw_sfi = *shared_info;
     // When adding fields here, make sure DeclarationScope::AnalyzePartially is
     // updated accordingly.
-    raw_sfi.set_internal_formal_parameter_count(
+    raw_sfi->set_internal_formal_parameter_count(
         JSParameterCount(lit->parameter_count()));
-    raw_sfi.SetFunctionTokenPosition(lit->function_token_position(),
-                                     lit->start_position());
-    raw_sfi.set_syntax_kind(lit->syntax_kind());
-    raw_sfi.set_allows_lazy_compilation(lit->AllowsLazyCompilation());
-    raw_sfi.set_language_mode(lit->language_mode());
-    raw_sfi.set_function_literal_id(lit->function_literal_id());
+    raw_sfi->SetFunctionTokenPosition(lit->function_token_position(),
+                                      lit->start_position());
+    raw_sfi->set_syntax_kind(lit->syntax_kind());
+    raw_sfi->set_allows_lazy_compilation(lit->AllowsLazyCompilation());
+    raw_sfi->set_language_mode(lit->language_mode());
+    raw_sfi->set_function_literal_id(lit->function_literal_id());
     // FunctionKind must have already been set.
-    DCHECK(lit->kind() == raw_sfi.kind());
+    DCHECK(lit->kind() == raw_sfi->kind());
     DCHECK_IMPLIES(lit->requires_instance_members_initializer(),
                    IsClassConstructor(lit->kind()));
-    raw_sfi.set_requires_instance_members_initializer(
+    raw_sfi->set_requires_instance_members_initializer(
         lit->requires_instance_members_initializer());
     DCHECK_IMPLIES(lit->class_scope_has_private_brand(),
                    IsClassConstructor(lit->kind()));
-    raw_sfi.set_class_scope_has_private_brand(
+    raw_sfi->set_class_scope_has_private_brand(
         lit->class_scope_has_private_brand());
     DCHECK_IMPLIES(lit->has_static_private_methods_or_accessors(),
                    IsClassConstructor(lit->kind()));
-    raw_sfi.set_has_static_private_methods_or_accessors(
+    raw_sfi->set_has_static_private_methods_or_accessors(
         lit->has_static_private_methods_or_accessors());
 
-    raw_sfi.set_is_toplevel(is_toplevel);
-    DCHECK(raw_sfi.outer_scope_info().IsTheHole());
+    raw_sfi->set_is_toplevel(is_toplevel);
+    DCHECK(IsTheHole(raw_sfi->outer_scope_info()));
     if (!is_toplevel) {
       Scope* outer_scope = lit->scope()->GetOuterScopeWithContext();
       if (outer_scope) {
-        raw_sfi.set_outer_scope_info(*outer_scope->scope_info());
-        raw_sfi.set_private_name_lookup_skips_outer_class(
+        raw_sfi->set_outer_scope_info(*outer_scope->scope_info());
+        raw_sfi->set_private_name_lookup_skips_outer_class(
             lit->scope()->private_name_lookup_skips_outer_class());
       }
     }
 
-    raw_sfi.set_length(lit->function_length());
+    raw_sfi->set_length(lit->function_length());
 
     // For lazy parsed functions, the following flags will be inaccurate since
     // we don't have the information yet. They're set later in
     // UpdateSharedFunctionFlagsAfterCompilation (compiler.cc), when the
     // function is really parsed and compiled.
     if (lit->ShouldEagerCompile()) {
-      raw_sfi.set_has_duplicate_parameters(lit->has_duplicate_parameters());
-      raw_sfi.UpdateAndFinalizeExpectedNofPropertiesFromEstimate(lit);
+      raw_sfi->set_has_duplicate_parameters(lit->has_duplicate_parameters());
+      raw_sfi->UpdateAndFinalizeExpectedNofPropertiesFromEstimate(lit);
       DCHECK_NULL(lit->produced_preparse_data());
 
       // If we're about to eager compile, we'll have the function literal
@@ -569,11 +560,17 @@ void SharedFunctionInfo::InitFromFunctionLiteral(
       return;
     }
 
-    raw_sfi.UpdateExpectedNofPropertiesFromEstimate(lit);
+    raw_sfi->UpdateExpectedNofPropertiesFromEstimate(lit);
   }
+  CreateAndSetUncompiledData(isolate, shared_info, lit);
+}
 
+template <typename IsolateT>
+void SharedFunctionInfo::CreateAndSetUncompiledData(
+    IsolateT* isolate, Handle<SharedFunctionInfo> shared_info,
+    FunctionLiteral* lit) {
+  DCHECK(!shared_info->HasUncompiledData());
   Handle<UncompiledData> data;
-
   ProducedPreparseData* scope_data = lit->produced_preparse_data();
   if (scope_data != nullptr) {
     Handle<PreparseData> preparse_data = scope_data->Serialize(isolate);
@@ -611,6 +608,15 @@ template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void SharedFunctionInfo::
         LocalIsolate* isolate, Handle<SharedFunctionInfo> shared_info,
         FunctionLiteral* lit, bool is_toplevel);
 
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void SharedFunctionInfo::
+    CreateAndSetUncompiledData<Isolate>(Isolate* isolate,
+                                        Handle<SharedFunctionInfo> shared_info,
+                                        FunctionLiteral* lit);
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void SharedFunctionInfo::
+    CreateAndSetUncompiledData<LocalIsolate>(
+        LocalIsolate* isolate, Handle<SharedFunctionInfo> shared_info,
+        FunctionLiteral* lit);
+
 uint16_t SharedFunctionInfo::get_property_estimate_from_literal(
     FunctionLiteral* literal) {
   int estimate = literal->expected_property_count();
@@ -668,16 +674,16 @@ void SharedFunctionInfo::SetFunctionTokenPosition(int function_token_position,
 }
 
 int SharedFunctionInfo::StartPosition() const {
-  Object maybe_scope_info = name_or_scope_info(kAcquireLoad);
-  if (maybe_scope_info.IsScopeInfo()) {
-    ScopeInfo info = ScopeInfo::cast(maybe_scope_info);
-    if (info.HasPositionInfo()) {
-      return info.StartPosition();
+  Tagged<Object> maybe_scope_info = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(maybe_scope_info)) {
+    Tagged<ScopeInfo> info = ScopeInfo::cast(maybe_scope_info);
+    if (info->HasPositionInfo()) {
+      return info->StartPosition();
     }
   }
   if (HasUncompiledData()) {
     // Works with or without scope.
-    return uncompiled_data().start_position();
+    return uncompiled_data()->start_position();
   }
   if (IsApiFunction() || HasBuiltinId()) {
     DCHECK_IMPLIES(HasBuiltinId(), builtin_id() != Builtin::kCompileLazy);
@@ -685,9 +691,10 @@ int SharedFunctionInfo::StartPosition() const {
   }
 #if V8_ENABLE_WEBASSEMBLY
   if (HasWasmExportedFunctionData()) {
-    WasmInstanceObject instance = wasm_exported_function_data().instance();
-    int func_index = wasm_exported_function_data().function_index();
-    auto& function = instance.module()->functions[func_index];
+    Tagged<WasmInstanceObject> instance =
+        wasm_exported_function_data()->instance();
+    int func_index = wasm_exported_function_data()->function_index();
+    auto& function = instance->module()->functions[func_index];
     return static_cast<int>(function.code.offset());
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -695,16 +702,16 @@ int SharedFunctionInfo::StartPosition() const {
 }
 
 int SharedFunctionInfo::EndPosition() const {
-  Object maybe_scope_info = name_or_scope_info(kAcquireLoad);
-  if (maybe_scope_info.IsScopeInfo()) {
-    ScopeInfo info = ScopeInfo::cast(maybe_scope_info);
-    if (info.HasPositionInfo()) {
-      return info.EndPosition();
+  Tagged<Object> maybe_scope_info = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(maybe_scope_info)) {
+    Tagged<ScopeInfo> info = ScopeInfo::cast(maybe_scope_info);
+    if (info->HasPositionInfo()) {
+      return info->EndPosition();
     }
   }
   if (HasUncompiledData()) {
     // Works with or without scope.
-    return uncompiled_data().end_position();
+    return uncompiled_data()->end_position();
   }
   if (IsApiFunction() || HasBuiltinId()) {
     DCHECK_IMPLIES(HasBuiltinId(), builtin_id() != Builtin::kCompileLazy);
@@ -712,9 +719,10 @@ int SharedFunctionInfo::EndPosition() const {
   }
 #if V8_ENABLE_WEBASSEMBLY
   if (HasWasmExportedFunctionData()) {
-    WasmInstanceObject instance = wasm_exported_function_data().instance();
-    int func_index = wasm_exported_function_data().function_index();
-    auto& function = instance.module()->functions[func_index];
+    Tagged<WasmInstanceObject> instance =
+        wasm_exported_function_data()->instance();
+    int func_index = wasm_exported_function_data()->function_index();
+    auto& function = instance->module()->functions[func_index];
     return static_cast<int>(function.code.end_offset());
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -723,20 +731,20 @@ int SharedFunctionInfo::EndPosition() const {
 
 void SharedFunctionInfo::UpdateFromFunctionLiteralForLiveEdit(
     FunctionLiteral* lit) {
-  Object maybe_scope_info = name_or_scope_info(kAcquireLoad);
-  if (maybe_scope_info.IsScopeInfo()) {
+  Tagged<Object> maybe_scope_info = name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(maybe_scope_info)) {
     // Updating the ScopeInfo is safe since they are identical modulo
     // source positions.
-    ScopeInfo new_scope_info = *lit->scope()->scope_info();
-    DCHECK(new_scope_info.Equals(ScopeInfo::cast(maybe_scope_info), true));
+    Tagged<ScopeInfo> new_scope_info = *lit->scope()->scope_info();
+    DCHECK(new_scope_info->Equals(ScopeInfo::cast(maybe_scope_info), true));
     SetScopeInfo(new_scope_info);
   } else if (!is_compiled()) {
     CHECK(HasUncompiledData());
     if (HasUncompiledDataWithPreparseData()) {
       ClearPreparseData();
     }
-    uncompiled_data().set_start_position(lit->start_position());
-    uncompiled_data().set_end_position(lit->end_position());
+    uncompiled_data()->set_start_position(lit->start_position());
+    uncompiled_data()->set_end_position(lit->end_position());
 
     if (!is_toplevel()) {
       Scope* outer_scope = lit->scope()->GetOuterScopeWithContext();
@@ -761,7 +769,7 @@ void SharedFunctionInfo::EnsureBytecodeArrayAvailable(
                            is_compiled_scope, flag)) {
       FATAL("Failed to compile shared info that was already compiled before");
     }
-    DCHECK(shared_info->GetBytecodeArray(isolate).HasSourcePositionTable());
+    DCHECK(shared_info->GetBytecodeArray(isolate)->HasSourcePositionTable());
   } else {
     *is_compiled_scope = shared_info->is_compiled_scope(isolate);
   }
@@ -788,29 +796,55 @@ void SharedFunctionInfo::InstallDebugBytecode(Handle<SharedFunctionInfo> shared,
     DisallowGarbageCollection no_gc;
     base::SharedMutexGuard<base::kExclusive> mutex_guard(
         isolate->shared_function_info_access());
-    DebugInfo debug_info = shared->GetDebugInfo();
-    debug_info.set_original_bytecode_array(*original_bytecode_array,
-                                           kReleaseStore);
-    debug_info.set_debug_bytecode_array(*debug_bytecode_array, kReleaseStore);
+    Tagged<DebugInfo> debug_info = shared->GetDebugInfo(isolate);
+    debug_info->set_original_bytecode_array(*original_bytecode_array,
+                                            kReleaseStore);
+    debug_info->set_debug_bytecode_array(*debug_bytecode_array, kReleaseStore);
     shared->SetActiveBytecodeArray(*debug_bytecode_array);
   }
 }
 
 // static
-void SharedFunctionInfo::UninstallDebugBytecode(SharedFunctionInfo shared,
-                                                Isolate* isolate) {
+void SharedFunctionInfo::UninstallDebugBytecode(
+    Tagged<SharedFunctionInfo> shared, Isolate* isolate) {
   DisallowGarbageCollection no_gc;
   base::SharedMutexGuard<base::kExclusive> mutex_guard(
       isolate->shared_function_info_access());
-  DebugInfo debug_info = shared.GetDebugInfo();
-  BytecodeArray original_bytecode_array = debug_info.OriginalBytecodeArray();
-  DCHECK(!shared.HasBaselineCode());
-  shared.SetActiveBytecodeArray(original_bytecode_array);
-  debug_info.set_original_bytecode_array(
+  Tagged<DebugInfo> debug_info = shared->GetDebugInfo(isolate);
+  Tagged<BytecodeArray> original_bytecode_array =
+      debug_info->OriginalBytecodeArray();
+  DCHECK(!shared->HasBaselineCode());
+  shared->SetActiveBytecodeArray(original_bytecode_array);
+  debug_info->set_original_bytecode_array(
       ReadOnlyRoots(isolate).undefined_value(), kReleaseStore);
-  debug_info.set_debug_bytecode_array(ReadOnlyRoots(isolate).undefined_value(),
-                                      kReleaseStore);
+  debug_info->set_debug_bytecode_array(ReadOnlyRoots(isolate).undefined_value(),
+                                       kReleaseStore);
+}
+
+// static
+void SharedFunctionInfo::EnsureOldForTesting(Tagged<SharedFunctionInfo> sfi) {
+  if (v8_flags.flush_code_based_on_time ||
+      v8_flags.flush_code_based_on_tab_visibility) {
+    sfi->set_age(kMaxAge);
+  } else {
+    sfi->set_age(v8_flags.bytecode_old_age);
+  }
 }
 
+#ifdef DEBUG
+// static
+bool SharedFunctionInfo::UniqueIdsAreUnique(Isolate* isolate) {
+  std::unordered_set<uint32_t> ids({isolate->next_unique_sfi_id()});
+  CombinedHeapObjectIterator it(isolate->heap());
+  for (Tagged<HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
+    if (!IsSharedFunctionInfo(o)) continue;
+    auto result = ids.emplace(SharedFunctionInfo::cast(o)->unique_id());
+    // If previously inserted...
+    if (!result.second) return false;
+  }
+  return true;
+}
+#endif  // DEBUG
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/shared-function-info.h b/deps/v8/src/objects/shared-function-info.h
index 2b642fa8862a60..fd4a93d7bce610 100644
--- a/deps/v8/src/objects/shared-function-info.h
+++ b/deps/v8/src/objects/shared-function-info.h
@@ -43,11 +43,13 @@ class WasmExportedFunctionData;
 class WasmJSFunctionData;
 class WasmResumeData;
 
+#if V8_ENABLE_WEBASSEMBLY
 namespace wasm {
 struct WasmModule;
 class ValueType;
 using FunctionSig = Signature<ValueType>;
 }  // namespace wasm
+#endif
 
 #include "torque-generated/src/objects/shared-function-info-tq.inc"
 
@@ -79,12 +81,12 @@ class PreparseData
   inline int inner_start_offset() const;
   inline ObjectSlot inner_data_start() const;
 
-  inline byte get(int index) const;
-  inline void set(int index, byte value);
-  inline void copy_in(int index, const byte* buffer, int length);
+  inline uint8_t get(int index) const;
+  inline void set(int index, uint8_t value);
+  inline void copy_in(int index, const uint8_t* buffer, int length);
 
-  inline PreparseData get_child(int index) const;
-  inline void set_child(int index, PreparseData value,
+  inline Tagged<PreparseData> get_child(int index) const;
+  inline void set_child(int index, Tagged<PreparseData> value,
                         WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   // Clear uninitialized padding space.
@@ -108,7 +110,7 @@ class PreparseData
   TQ_OBJECT_CONSTRUCTORS(PreparseData)
 
  private:
-  inline Object get_child_raw(int index) const;
+  inline Tagged<Object> get_child_raw(int index) const;
 };
 
 // Abstract class representing extra data for an uncompiled function, which is
@@ -117,8 +119,9 @@ class UncompiledData
     : public TorqueGeneratedUncompiledData<UncompiledData, HeapObject> {
  public:
   inline void InitAfterBytecodeFlush(
-      String inferred_name, int start_position, int end_position,
-      std::function<void(HeapObject object, ObjectSlot slot, HeapObject target)>
+      Tagged<String> inferred_name, int start_position, int end_position,
+      std::function<void(Tagged<HeapObject> object, ObjectSlot slot,
+                         Tagged<HeapObject> target)>
           gc_notify_updated_slot);
 
   TQ_OBJECT_CONSTRUCTORS(UncompiledData)
@@ -196,31 +199,31 @@ class SharedFunctionInfo
   // Important: This function MUST not allocate.
   void Init(ReadOnlyRoots roots, int unique_id);
 
-  V8_EXPORT_PRIVATE static constexpr Smi const kNoSharedNameSentinel =
+  V8_EXPORT_PRIVATE static constexpr Tagged<Smi> const kNoSharedNameSentinel =
       Smi::zero();
 
   // [name]: Returns shared name if it exists or an empty string otherwise.
-  inline String Name() const;
-  inline void SetName(String name);
+  inline Tagged<String> Name() const;
+  inline void SetName(Tagged<String> name);
 
   // Get the code object which represents the execution of this function.
-  V8_EXPORT_PRIVATE Code GetCode(Isolate* isolate) const;
+  V8_EXPORT_PRIVATE Tagged<Code> GetCode(Isolate* isolate) const;
 
   // Get the abstract code associated with the function, which will either be
   // a Code object or a BytecodeArray.
-  inline AbstractCode abstract_code(Isolate* isolate);
+  inline Tagged<AbstractCode> abstract_code(Isolate* isolate);
 
   // Set up the link between shared function info and the script. The shared
   // function info is added to the list on the script.
   V8_EXPORT_PRIVATE void SetScript(ReadOnlyRoots roots,
-                                   HeapObject script_object,
+                                   Tagged<HeapObject> script_object,
                                    int function_literal_id,
                                    bool reset_preparsed_scope_data = true);
 
   // Copy the data from another SharedFunctionInfo. Used for copying data into
   // and out of a placeholder SharedFunctionInfo, for off-thread compilation
   // which is not allowed to touch a main-thread-visible SharedFunctionInfo.
-  void CopyFrom(SharedFunctionInfo other);
+  void CopyFrom(Tagged<SharedFunctionInfo> other);
 
   // Layout description of the optimized code map.
   static const int kEntriesStart = 0;
@@ -231,15 +234,20 @@ class SharedFunctionInfo
 
   static const int kNotFound = -1;
 
-  DECL_ACQUIRE_GETTER(scope_info, ScopeInfo)
+  static constexpr int kAgeSize = kAgeOffsetEnd - kAgeOffset + 1;
+  static constexpr uint16_t kMaxAge = UINT16_MAX;
+
+  DECL_ACQUIRE_GETTER(scope_info, Tagged<ScopeInfo>)
   // Deprecated, use the ACQUIRE version instead.
-  DECL_GETTER(scope_info, ScopeInfo)
+  DECL_GETTER(scope_info, Tagged<ScopeInfo>)
+  // Slow but safe:
+  inline Tagged<ScopeInfo> EarlyScopeInfo(AcquireLoadTag tag);
 
   // Set scope_info without moving the existing name onto the ScopeInfo.
-  inline void set_raw_scope_info(ScopeInfo scope_info,
+  inline void set_raw_scope_info(Tagged<ScopeInfo> scope_info,
                                  WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
-  inline void SetScopeInfo(ScopeInfo scope_info,
+  inline void SetScopeInfo(Tagged<ScopeInfo> scope_info,
                            WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
 
   inline bool is_script() const;
@@ -256,8 +264,9 @@ class SharedFunctionInfo
 
   // [outer scope info | feedback metadata] Shared storage for outer scope info
   // (on uncompiled functions) and feedback metadata (on compiled functions).
-  DECL_ACCESSORS(raw_outer_scope_info_or_feedback_metadata, HeapObject)
-  DECL_ACQUIRE_GETTER(raw_outer_scope_info_or_feedback_metadata, HeapObject)
+  DECL_ACCESSORS(raw_outer_scope_info_or_feedback_metadata, Tagged<HeapObject>)
+  DECL_ACQUIRE_GETTER(raw_outer_scope_info_or_feedback_metadata,
+                      Tagged<HeapObject>)
  private:
   using TorqueGeneratedSharedFunctionInfo::
       outer_scope_info_or_feedback_metadata;
@@ -267,14 +276,14 @@ class SharedFunctionInfo
  public:
   // Get the outer scope info whether this function is compiled or not.
   inline bool HasOuterScopeInfo() const;
-  inline ScopeInfo GetOuterScopeInfo() const;
+  inline Tagged<ScopeInfo> GetOuterScopeInfo() const;
 
   // [feedback metadata] Metadata template for feedback vectors of instances of
   // this function.
   inline bool HasFeedbackMetadata() const;
   inline bool HasFeedbackMetadata(AcquireLoadTag tag) const;
-  inline FeedbackMetadata feedback_metadata() const;
-  DECL_RELEASE_ACQUIRE_ACCESSORS(feedback_metadata, FeedbackMetadata)
+  DECL_GETTER(feedback_metadata, Tagged<FeedbackMetadata>)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(feedback_metadata, Tagged<FeedbackMetadata>)
 
   // Returns if this function has been compiled yet. Note: with bytecode
   // flushing, any GC after this call is made could cause the function
@@ -319,26 +328,24 @@ class SharedFunctionInfo
   //  - a UncompiledDataWithPreparseData for lazy compilation
   //    [HasUncompiledDataWithPreparseData()]
   //  - a WasmExportedFunctionData for Wasm [HasWasmExportedFunctionData()]
-  DECL_RELEASE_ACQUIRE_ACCESSORS(function_data, Object)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(function_data, Tagged<Object>)
 
   inline bool IsApiFunction() const;
   inline bool is_class_constructor() const;
-  inline FunctionTemplateInfo get_api_func_data() const;
-  inline void set_api_func_data(FunctionTemplateInfo data);
+  DECL_ACCESSORS(api_func_data, Tagged<FunctionTemplateInfo>)
   DECL_GETTER(HasBytecodeArray, bool)
   template <typename IsolateT>
-  inline BytecodeArray GetBytecodeArray(IsolateT* isolate) const;
+  inline Tagged<BytecodeArray> GetBytecodeArray(IsolateT* isolate) const;
 
-  inline void set_bytecode_array(BytecodeArray bytecode);
-  DECL_GETTER(InterpreterTrampoline, Code)
+  inline void set_bytecode_array(Tagged<BytecodeArray> bytecode);
+  DECL_GETTER(InterpreterTrampoline, Tagged<Code>)
   DECL_GETTER(HasInterpreterData, bool)
-  DECL_GETTER(interpreter_data, InterpreterData)
-  inline void set_interpreter_data(InterpreterData interpreter_data);
+  DECL_ACCESSORS(interpreter_data, Tagged<InterpreterData>)
   DECL_GETTER(HasBaselineCode, bool)
-  DECL_RELEASE_ACQUIRE_ACCESSORS(baseline_code, Code)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(baseline_code, Tagged<Code>)
   inline void FlushBaselineCode();
-  inline BytecodeArray GetActiveBytecodeArray() const;
-  inline void SetActiveBytecodeArray(BytecodeArray bytecode);
+  DECL_GETTER(GetActiveBytecodeArray, Tagged<BytecodeArray>)
+  inline void SetActiveBytecodeArray(Tagged<BytecodeArray> bytecode);
 
 #if V8_ENABLE_WEBASSEMBLY
   inline bool HasAsmWasmData() const;
@@ -347,15 +354,13 @@ class SharedFunctionInfo
   inline bool HasWasmJSFunctionData() const;
   inline bool HasWasmCapiFunctionData() const;
   inline bool HasWasmResumeData() const;
-  inline AsmWasmData asm_wasm_data() const;
-  inline void set_asm_wasm_data(AsmWasmData data);
+  DECL_ACCESSORS(asm_wasm_data, Tagged<AsmWasmData>)
 
-  V8_EXPORT_PRIVATE WasmExportedFunctionData
-  wasm_exported_function_data() const;
-  WasmFunctionData wasm_function_data() const;
-  WasmJSFunctionData wasm_js_function_data() const;
-  WasmCapiFunctionData wasm_capi_function_data() const;
-  WasmResumeData wasm_resume_data() const;
+  DECL_GETTER(wasm_exported_function_data, Tagged<WasmExportedFunctionData>)
+  DECL_GETTER(wasm_function_data, Tagged<WasmFunctionData>)
+  DECL_GETTER(wasm_js_function_data, Tagged<WasmJSFunctionData>)
+  DECL_GETTER(wasm_capi_function_data, Tagged<WasmCapiFunctionData>)
+  DECL_GETTER(wasm_resume_data, Tagged<WasmResumeData>)
 
   inline const wasm::WasmModule* wasm_module() const;
   inline const wasm::FunctionSig* wasm_function_signature() const;
@@ -364,16 +369,12 @@ class SharedFunctionInfo
 
   // builtin corresponds to the auto-generated Builtin enum.
   inline bool HasBuiltinId() const;
-  inline Builtin builtin_id() const;
-  inline void set_builtin_id(Builtin builtin);
+  DECL_PRIMITIVE_ACCESSORS(builtin_id, Builtin)
   inline bool HasUncompiledData() const;
-  inline UncompiledData uncompiled_data() const;
-  inline void set_uncompiled_data(UncompiledData data);
+  DECL_ACCESSORS(uncompiled_data, Tagged<UncompiledData>)
   inline bool HasUncompiledDataWithPreparseData() const;
-  inline UncompiledDataWithPreparseData uncompiled_data_with_preparse_data()
-      const;
-  inline void set_uncompiled_data_with_preparse_data(
-      UncompiledDataWithPreparseData data);
+  DECL_ACCESSORS(uncompiled_data_with_preparse_data,
+                 Tagged<UncompiledDataWithPreparseData>)
   inline bool HasUncompiledDataWithoutPreparseData() const;
   inline void ClearUncompiledDataJobPointer();
 
@@ -386,17 +387,18 @@ class SharedFunctionInfo
   // code written in OO style, where almost all functions are anonymous but are
   // assigned to object properties.
   inline bool HasInferredName();
-  inline String inferred_name() const;
-
-  // Break infos are contained in DebugInfo, this is a convenience method
-  // to simplify access.
-  V8_EXPORT_PRIVATE bool HasBreakInfo() const;
-  bool BreakAtEntry() const;
-
-  // Coverage infos are contained in DebugInfo, this is a convenience method
-  // to simplify access.
-  bool HasCoverageInfo() const;
-  CoverageInfo GetCoverageInfo() const;
+  DECL_GETTER(inferred_name, Tagged<String>)
+
+  // All DebugInfo accessors forward to the Debug object which stores DebugInfo
+  // objects in a sidetable.
+  bool HasDebugInfo(Isolate* isolate) const;
+  V8_EXPORT_PRIVATE Tagged<DebugInfo> GetDebugInfo(Isolate* isolate) const;
+  V8_EXPORT_PRIVATE base::Optional<Tagged<DebugInfo>> TryGetDebugInfo(
+      Isolate* isolate) const;
+  V8_EXPORT_PRIVATE bool HasBreakInfo(Isolate* isolate) const;
+  bool BreakAtEntry(Isolate* isolate) const;
+  bool HasCoverageInfo(Isolate* isolate) const;
+  Tagged<CoverageInfo> GetCoverageInfo(Isolate* isolate) const;
 
   // The function's name if it is non-empty, otherwise the inferred name.
   std::unique_ptr<char[]> DebugNameCStr() const;
@@ -406,22 +408,21 @@ class SharedFunctionInfo
   // Used for flags such as --turbo-filter.
   bool PassesFilter(const char* raw_filter);
 
-  // [script_or_debug_info]: One of:
-  //  - Script from which the function originates.
-  //  - a DebugInfo which holds the actual script [HasDebugInfo()].
-  DECL_RELEASE_ACQUIRE_ACCESSORS(script_or_debug_info, HeapObject)
-
-  DECL_GETTER(script, HeapObject)
-  inline void set_script(HeapObject script);
+  // [script]: the Script from which the function originates, or undefined.
+  DECL_RELEASE_ACQUIRE_ACCESSORS(script, Tagged<HeapObject>)
+  // Use `raw_script` if deserialization of this SharedFunctionInfo may still
+  // be in progress and thus the `script` field still equal to
+  // Smi::uninitialized_deserialization_value.
+  DECL_RELEASE_ACQUIRE_ACCESSORS(raw_script, Tagged<Object>)
+  // TODO(jgruber): Remove these overloads and pass the kAcquireLoad tag
+  // explicitly.
+  inline Tagged<HeapObject> script() const;
+  inline Tagged<HeapObject> script(PtrComprCageBase cage_base) const;
+  inline bool has_script(AcquireLoadTag tag) const;
 
   // True if the underlying script was parsed and compiled in REPL mode.
   inline bool is_repl_mode() const;
 
-  // The function is subject to debugging if a debug info is attached.
-  DECL_GETTER(HasDebugInfo, bool)
-  DECL_GETTER(GetDebugInfo, DebugInfo)
-  inline void SetDebugInfo(DebugInfo debug_info);
-
   // The offset of the 'function' token in the script source relative to the
   // start position. Can return kFunctionTokenOutOfRange if offset doesn't
   // fit in 16 bits.
@@ -443,8 +444,10 @@ class SharedFunctionInfo
   DECL_RELAXED_INT32_ACCESSORS(flags)
   DECL_UINT8_ACCESSORS(flags2)
 
+  DECL_UINT16_ACCESSORS(age)
+
   // True if the outer class scope contains a private brand for
-  // private instance methdos.
+  // private instance methods.
   DECL_BOOLEAN_ACCESSORS(class_scope_has_private_brand)
   DECL_BOOLEAN_ACCESSORS(has_static_private_methods_or_accessors)
 
@@ -560,9 +563,11 @@ class SharedFunctionInfo
   // |gc_notify_updated_slot| should be used to record any slot updates.
   void DiscardCompiledMetadata(
       Isolate* isolate,
-      std::function<void(HeapObject object, ObjectSlot slot, HeapObject target)>
-          gc_notify_updated_slot =
-              [](HeapObject object, ObjectSlot slot, HeapObject target) {});
+      std::function<void(Tagged<HeapObject> object, ObjectSlot slot,
+                         Tagged<HeapObject> target)>
+          gc_notify_updated_slot = [](Tagged<HeapObject> object,
+                                      ObjectSlot slot,
+                                      Tagged<HeapObject> target) {});
 
   // Returns true if the function has old bytecode that could be flushed. This
   // function shouldn't access any flags as it is used by concurrent marker.
@@ -601,6 +606,11 @@ class SharedFunctionInfo
                                       Handle<SharedFunctionInfo> shared_info,
                                       FunctionLiteral* lit, bool is_toplevel);
 
+  template <typename IsolateT>
+  static void CreateAndSetUncompiledData(IsolateT* isolate,
+                                         Handle<SharedFunctionInfo> shared_info,
+                                         FunctionLiteral* lit);
+
   // Updates the expected number of properties based on estimate from parser.
   void UpdateExpectedNofPropertiesFromEstimate(FunctionLiteral* literal);
   void UpdateAndFinalizeExpectedNofPropertiesFromEstimate(
@@ -635,6 +645,14 @@ class SharedFunctionInfo
   // construct this function.
   inline void CalculateConstructAsBuiltin();
 
+  // Replaces the current age with a new value if the current value matches the
+  // one expected. Returns the value before this operation.
+  inline uint16_t CompareExchangeAge(uint16_t expected_age, uint16_t new_age);
+
+  // Bytecode aging
+  V8_EXPORT_PRIVATE static void EnsureOldForTesting(
+      Tagged<SharedFunctionInfo> sfu);
+
   // Dispatched behavior.
   DECL_PRINTER(SharedFunctionInfo)
   DECL_VERIFIER(SharedFunctionInfo)
@@ -648,15 +666,15 @@ class SharedFunctionInfo
   // Iterate over all shared function infos in a given script.
   class ScriptIterator {
    public:
-    V8_EXPORT_PRIVATE ScriptIterator(Isolate* isolate, Script script);
+    V8_EXPORT_PRIVATE ScriptIterator(Isolate* isolate, Tagged<Script> script);
     explicit ScriptIterator(Handle<WeakFixedArray> shared_function_infos);
     ScriptIterator(const ScriptIterator&) = delete;
     ScriptIterator& operator=(const ScriptIterator&) = delete;
-    V8_EXPORT_PRIVATE SharedFunctionInfo Next();
+    V8_EXPORT_PRIVATE Tagged<SharedFunctionInfo> Next();
     int CurrentIndex() const { return index_ - 1; }
 
     // Reset the iterator to run on |script|.
-    void Reset(Isolate* isolate, Script script);
+    void Reset(Isolate* isolate, Tagged<Script> script);
 
    private:
     Handle<WeakFixedArray> shared_function_infos_;
@@ -687,9 +705,15 @@ class SharedFunctionInfo
                                    Isolate* isolate);
   // Removes the debug bytecode and restores the original bytecode to be
   // returned by following calls to GetActiveBytecodeArray.
-  static void UninstallDebugBytecode(SharedFunctionInfo shared,
+  static void UninstallDebugBytecode(Tagged<SharedFunctionInfo> shared,
                                      Isolate* isolate);
 
+#ifdef DEBUG
+  // Verifies that all SFI::unique_id values on the heap are unique, including
+  // Isolate::new_unique_sfi_id_.
+  static bool UniqueIdsAreUnique(Isolate* isolate);
+#endif  // DEBUG
+
  private:
 #ifdef VERIFY_HEAP
   void SharedFunctionInfoVerify(ReadOnlyRoots roots);
@@ -697,11 +721,11 @@ class SharedFunctionInfo
 
   // [name_or_scope_info]: Function name string, kNoSharedNameSentinel or
   // ScopeInfo.
-  DECL_RELEASE_ACQUIRE_ACCESSORS(name_or_scope_info, Object)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(name_or_scope_info, Tagged<Object>)
 
   // [outer scope info] The outer scope info, needed to lazily parse this
   // function.
-  DECL_ACCESSORS(outer_scope_info, HeapObject)
+  DECL_ACCESSORS(outer_scope_info, Tagged<HeapObject>)
 
   // [properties_are_final]: This bit is used to track if we have finished
   // parsing its properties. The properties final bit is only used by
@@ -724,9 +748,14 @@ class SharedFunctionInfo
   TQ_OBJECT_CONSTRUCTORS(SharedFunctionInfo)
 };
 
+static constexpr int kStaticRootsSFISize = 44;
+#ifdef V8_STATIC_ROOTS
+static_assert(SharedFunctionInfo::kSize == kStaticRootsSFISize);
+#endif  // V8_STATIC_ROOTS
+
 // Printing support.
 struct SourceCodeOf {
-  explicit SourceCodeOf(SharedFunctionInfo v, int max = -1)
+  explicit SourceCodeOf(Tagged<SharedFunctionInfo> v, int max = -1)
       : value(v), max_length(max) {}
   const SharedFunctionInfo value;
   int max_length;
@@ -737,8 +766,9 @@ struct SourceCodeOf {
 // the scope is retained.
 class V8_NODISCARD IsCompiledScope {
  public:
-  inline IsCompiledScope(const SharedFunctionInfo shared, Isolate* isolate);
-  inline IsCompiledScope(const SharedFunctionInfo shared,
+  inline IsCompiledScope(const Tagged<SharedFunctionInfo> shared,
+                         Isolate* isolate);
+  inline IsCompiledScope(const Tagged<SharedFunctionInfo> shared,
                          LocalIsolate* isolate);
   inline IsCompiledScope() : retain_code_(), is_compiled_(false) {}
 
diff --git a/deps/v8/src/objects/shared-function-info.tq b/deps/v8/src/objects/shared-function-info.tq
index 98045efaaba940..4a15a76818e3b8 100644
--- a/deps/v8/src/objects/shared-function-info.tq
+++ b/deps/v8/src/objects/shared-function-info.tq
@@ -54,7 +54,7 @@ extern class SharedFunctionInfo extends HeapObject {
   @customWeakMarking function_data: Object;
   name_or_scope_info: String|NoSharedNameSentinel|ScopeInfo;
   outer_scope_info_or_feedback_metadata: HeapObject;
-  script_or_debug_info: Script|DebugInfo|Undefined;
+  script: Script|Undefined;
   // [length]: The function length - usually the number of declared parameters
   // (always without the receiver).
   // Use up to 2^16-2 parameters (16 bits of values, where one is reserved for
@@ -76,12 +76,14 @@ extern class SharedFunctionInfo extends HeapObject {
   // SharedFunctionInfo represents within its script, or -1 if this
   // SharedFunctionInfo object doesn't correspond to a parsed FunctionLiteral.
   function_literal_id: int32;
-  // [unique_id] - For --log-maps purposes, an identifier that's persistent
-  // even if the GC moves this SharedFunctionInfo.
-  @if(V8_SFI_HAS_UNIQUE_ID) unique_id: int32;
-
-  @if(V8_SFI_NEEDS_PADDING) optional_padding: uint32;
-  @ifnot(V8_SFI_NEEDS_PADDING) optional_padding: void;
+  // [unique_id] - An identifier that's persistent even across GC.
+  // TODO(jgruber): Merge with function_literal_id by storing the base id on
+  // Script (since the literal id is used for table lookups).
+  unique_id: int32;
+  // Age used for code flushing.
+  // TODO(dinfuehr): Merge this field with function_literal_id to save memory.
+  age: uint16;
+  padding: uint16;
 }
 
 const kDontAdaptArgumentsSentinel: constexpr int32
@@ -120,8 +122,7 @@ extern class UncompiledData extends HeapObject {
 @generateBodyDescriptor
 @generateUniqueMap
 @generateFactoryFunction
-extern class UncompiledDataWithoutPreparseData extends UncompiledData {
-}
+extern class UncompiledDataWithoutPreparseData extends UncompiledData {}
 
 @generateBodyDescriptor
 @generateUniqueMap
diff --git a/deps/v8/src/objects/simd.cc b/deps/v8/src/objects/simd.cc
index d64b4411682ed2..9c2244558bc7c6 100644
--- a/deps/v8/src/objects/simd.cc
+++ b/deps/v8/src/objects/simd.cc
@@ -359,17 +359,18 @@ Address ArrayIndexOfIncludes(Address array_start, uintptr_t array_len,
   }
 
   if constexpr (kind == ArrayIndexOfIncludesKind::DOUBLE) {
-    FixedDoubleArray fixed_array = FixedDoubleArray::cast(Object(array_start));
+    Tagged<FixedDoubleArray> fixed_array =
+        FixedDoubleArray::cast(Object(array_start));
     double* array = static_cast<double*>(
-        fixed_array.RawField(FixedDoubleArray::OffsetOfElementAt(0))
+        fixed_array->RawField(FixedDoubleArray::OffsetOfElementAt(0))
             .ToVoidPtr());
 
     double search_num;
-    if (Object(search_element).IsSmi()) {
+    if (IsSmi(Object(search_element))) {
       search_num = Object(search_element).ToSmi().value();
     } else {
-      DCHECK(Object(search_element).IsHeapNumber());
-      search_num = HeapNumber::cast(Object(search_element)).value();
+      DCHECK(IsHeapNumber(Object(search_element)));
+      search_num = HeapNumber::cast(Object(search_element))->value();
     }
 
     DCHECK(!std::isnan(search_num));
@@ -377,12 +378,12 @@ Address ArrayIndexOfIncludes(Address array_start, uintptr_t array_len,
     if (reinterpret_cast<uintptr_t>(array) % sizeof(double) != 0) {
       // Slow scalar search for unaligned double array.
       for (; from_index < array_len; from_index++) {
-        if (fixed_array.is_the_hole(static_cast<int>(from_index))) {
+        if (fixed_array->is_the_hole(static_cast<int>(from_index))) {
           // |search_num| cannot be NaN, so there is no need to check against
           // holes.
           continue;
         }
-        if (fixed_array.get_scalar(static_cast<int>(from_index)) ==
+        if (fixed_array->get_scalar(static_cast<int>(from_index)) ==
             search_num) {
           return from_index;
         }
@@ -394,13 +395,13 @@ Address ArrayIndexOfIncludes(Address array_start, uintptr_t array_len,
   }
 
   if constexpr (kind == ArrayIndexOfIncludesKind::OBJECTORSMI) {
-    FixedArray fixed_array = FixedArray::cast(Object(array_start));
+    Tagged<FixedArray> fixed_array = FixedArray::cast(Object(array_start));
     Tagged_t* array =
-        static_cast<Tagged_t*>(fixed_array.data_start().ToVoidPtr());
+        static_cast<Tagged_t*>(fixed_array->data_start().ToVoidPtr());
 
-    DCHECK(!Object(search_element).IsHeapNumber());
-    DCHECK(!Object(search_element).IsBigInt());
-    DCHECK(!Object(search_element).IsString());
+    DCHECK(!IsHeapNumber(Object(search_element)));
+    DCHECK(!IsBigInt(Object(search_element)));
+    DCHECK(!IsString(Object(search_element)));
 
     return search<Tagged_t>(array, array_len, from_index,
                             static_cast<Tagged_t>(search_element));
diff --git a/deps/v8/src/objects/slots-inl.h b/deps/v8/src/objects/slots-inl.h
index 1759c7927cb47e..fee88062b35566 100644
--- a/deps/v8/src/objects/slots-inl.h
+++ b/deps/v8/src/objects/slots-inl.h
@@ -14,7 +14,9 @@
 #include "src/objects/maybe-object.h"
 #include "src/objects/objects.h"
 #include "src/objects/slots.h"
+#include "src/objects/tagged.h"
 #include "src/sandbox/external-pointer-inl.h"
+#include "src/sandbox/indirect-pointer-inl.h"
 #include "src/utils/memcopy.h"
 
 namespace v8 {
@@ -24,24 +26,28 @@ namespace internal {
 // FullObjectSlot implementation.
 //
 
-FullObjectSlot::FullObjectSlot(Object* object)
+FullObjectSlot::FullObjectSlot(TaggedBase* object)
     : SlotBase(reinterpret_cast<Address>(&object->ptr_)) {}
 
-bool FullObjectSlot::contains_value(Address raw_value) const {
-  return base::AsAtomicPointer::Relaxed_Load(location()) == raw_value;
-}
-
 bool FullObjectSlot::contains_map_value(Address raw_value) const {
   return load_map().ptr() == raw_value;
 }
 
-Object FullObjectSlot::operator*() const { return Object(*location()); }
+bool FullObjectSlot::Relaxed_ContainsMapValue(Address raw_value) const {
+  return base::AsAtomicPointer::Relaxed_Load(location()) == raw_value;
+}
 
-Object FullObjectSlot::load(PtrComprCageBase cage_base) const { return **this; }
+Tagged<Object> FullObjectSlot::operator*() const { return Object(*location()); }
 
-void FullObjectSlot::store(Object value) const { *location() = value.ptr(); }
+Tagged<Object> FullObjectSlot::load(PtrComprCageBase cage_base) const {
+  return **this;
+}
 
-void FullObjectSlot::store_map(Map map) const {
+void FullObjectSlot::store(Tagged<Object> value) const {
+  *location() = value.ptr();
+}
+
+void FullObjectSlot::store_map(Tagged<Map> map) const {
 #ifdef V8_MAP_PACKING
   *location() = MapWord::Pack(map.ptr());
 #else
@@ -49,7 +55,7 @@ void FullObjectSlot::store_map(Map map) const {
 #endif
 }
 
-Map FullObjectSlot::load_map() const {
+Tagged<Map> FullObjectSlot::load_map() const {
 #ifdef V8_MAP_PACKING
   return Map::unchecked_cast(Object(MapWord::Unpack(*location())));
 #else
@@ -57,37 +63,39 @@ Map FullObjectSlot::load_map() const {
 #endif
 }
 
-Object FullObjectSlot::Acquire_Load() const {
+Tagged<Object> FullObjectSlot::Acquire_Load() const {
   return Object(base::AsAtomicPointer::Acquire_Load(location()));
 }
 
-Object FullObjectSlot::Acquire_Load(PtrComprCageBase cage_base) const {
+Tagged<Object> FullObjectSlot::Acquire_Load(PtrComprCageBase cage_base) const {
   return Acquire_Load();
 }
 
-Object FullObjectSlot::Relaxed_Load() const {
+Tagged<Object> FullObjectSlot::Relaxed_Load() const {
   return Object(base::AsAtomicPointer::Relaxed_Load(location()));
 }
 
-Object FullObjectSlot::Relaxed_Load(PtrComprCageBase cage_base) const {
+Tagged<Object> FullObjectSlot::Relaxed_Load(PtrComprCageBase cage_base) const {
   return Relaxed_Load();
 }
 
-void FullObjectSlot::Relaxed_Store(Object value) const {
+void FullObjectSlot::Relaxed_Store(Tagged<Object> value) const {
   base::AsAtomicPointer::Relaxed_Store(location(), value.ptr());
 }
 
-void FullObjectSlot::Release_Store(Object value) const {
+void FullObjectSlot::Release_Store(Tagged<Object> value) const {
   base::AsAtomicPointer::Release_Store(location(), value.ptr());
 }
 
-Object FullObjectSlot::Relaxed_CompareAndSwap(Object old, Object target) const {
+Tagged<Object> FullObjectSlot::Relaxed_CompareAndSwap(
+    Tagged<Object> old, Tagged<Object> target) const {
   Address result = base::AsAtomicPointer::Relaxed_CompareAndSwap(
       location(), old.ptr(), target.ptr());
   return Object(result);
 }
 
-Object FullObjectSlot::Release_CompareAndSwap(Object old, Object target) const {
+Tagged<Object> FullObjectSlot::Release_CompareAndSwap(
+    Tagged<Object> old, Tagged<Object> target) const {
   Address result = base::AsAtomicPointer::Release_CompareAndSwap(
       location(), old.ptr(), target.ptr());
   return Object(result);
@@ -144,13 +152,13 @@ void FullHeapObjectSlot::store(HeapObjectReference value) const {
   *location() = value.ptr();
 }
 
-HeapObject FullHeapObjectSlot::ToHeapObject() const {
+Tagged<HeapObject> FullHeapObjectSlot::ToHeapObject() const {
   TData value = *location();
   DCHECK(HAS_STRONG_HEAP_OBJECT_TAG(value));
   return HeapObject::cast(Object(value));
 }
 
-void FullHeapObjectSlot::StoreHeapObject(HeapObject value) const {
+void FullHeapObjectSlot::StoreHeapObject(Tagged<HeapObject> value) const {
   *location() = value.ptr();
 }
 
@@ -159,8 +167,8 @@ void ExternalPointerSlot::init(Isolate* isolate, Address value,
 #ifdef V8_ENABLE_SANDBOX
   DCHECK_NE(tag, kExternalPointerNullTag);
   ExternalPointerTable& table = GetExternalPointerTableForTag(isolate, tag);
-  ExternalPointerHandle handle =
-      table.AllocateAndInitializeEntry(isolate, value, tag);
+  ExternalPointerHandle handle = table.AllocateAndInitializeEntry(
+      GetDefaultExternalPointerSpace(isolate, tag), value, tag);
   // Use a Release_Store to ensure that the store of the pointer into the
   // table is not reordered after the store of the handle. Otherwise, other
   // threads may access an uninitialized table entry and crash.
@@ -234,6 +242,26 @@ void ExternalPointerSlot::RestoreContentAfterSerialization(
 #endif
 }
 
+void ExternalPointerSlot::ReplaceContentWithIndexForSerialization(
+    const DisallowGarbageCollection& no_gc, uint32_t index) {
+#ifdef V8_ENABLE_SANDBOX
+  static_assert(sizeof(ExternalPointerHandle) == sizeof(uint32_t));
+  Relaxed_StoreHandle(index);
+#else
+  WriteMaybeUnalignedValue<Address>(address(), static_cast<Address>(index));
+#endif
+}
+
+uint32_t ExternalPointerSlot::GetContentAsIndexAfterDeserialization(
+    const DisallowGarbageCollection& no_gc) {
+#ifdef V8_ENABLE_SANDBOX
+  static_assert(sizeof(ExternalPointerHandle) == sizeof(uint32_t));
+  return Relaxed_LoadHandle();
+#else
+  return static_cast<uint32_t>(ReadMaybeUnalignedValue<Address>(address()));
+#endif
+}
+
 #ifdef V8_ENABLE_SANDBOX
 const ExternalPointerTable& ExternalPointerSlot::GetExternalPointerTableForTag(
     const Isolate* isolate, ExternalPointerTag tag) {
@@ -248,8 +276,95 @@ ExternalPointerTable& ExternalPointerSlot::GetExternalPointerTableForTag(
              ? isolate->shared_external_pointer_table()
              : isolate->external_pointer_table();
 }
+
+ExternalPointerTable::Space*
+ExternalPointerSlot::GetDefaultExternalPointerSpace(Isolate* isolate,
+                                                    ExternalPointerTag tag) {
+  if (V8_UNLIKELY(IsSharedExternalPointerType(tag))) {
+    DCHECK(!ReadOnlyHeap::Contains(address()));
+    return isolate->shared_external_pointer_space();
+  }
+  if (V8_UNLIKELY(ReadOnlyHeap::Contains(address()))) {
+    DCHECK(tag == kAccessorInfoGetterTag || tag == kAccessorInfoSetterTag ||
+           tag == kCallHandlerInfoCallbackTag);
+    return isolate->heap()->read_only_external_pointer_space();
+  }
+  return isolate->heap()->external_pointer_space();
+}
 #endif  // V8_ENABLE_SANDBOX
 
+Tagged<Object> IndirectPointerSlot::load() const { return Relaxed_Load(); }
+
+void IndirectPointerSlot::store(Tagged<Code> code) const {
+  return Relaxed_Store(code);
+}
+
+Tagged<Object> IndirectPointerSlot::Relaxed_Load() const {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  IndirectPointerHandle handle = Relaxed_LoadHandle();
+  // TODO(saelo) Maybe come up with a different CPT encoding scheme that returns
+  // Smi::zero for kNullCodePointerHandle?
+  if (!handle) return Smi::zero();
+  Address addr = GetProcessWideCodePointerTable()->GetCodeObject(handle);
+  return Object(addr);
+#else
+  UNREACHABLE();
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+Tagged<Object> IndirectPointerSlot::Acquire_Load() const {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  IndirectPointerHandle handle = Acquire_LoadHandle();
+  // TODO(saelo) Maybe come up with a different CPT encoding scheme that returns
+  // Smi::zero for kNullCodePointerHandle?
+  if (!handle) return Smi::zero();
+  Address addr = GetProcessWideCodePointerTable()->GetCodeObject(handle);
+  return Object(addr);
+#else
+  UNREACHABLE();
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+void IndirectPointerSlot::Relaxed_Store(Tagged<Code> value) const {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // The Code objects owns its entry in the CodePointerTable, so here we only
+  // need to copy the handle.
+  IndirectPointerHandle handle =
+      value->ReadField<IndirectPointerHandle>(Code::kInstructionStartOffset);
+  Relaxed_StoreHandle(handle);
+#else
+  UNREACHABLE();
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+void IndirectPointerSlot::Release_Store(Tagged<Code> value) const {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  IndirectPointerHandle handle =
+      value->ReadField<IndirectPointerHandle>(Code::kInstructionStartOffset);
+  Release_StoreHandle(handle);
+#else
+  UNREACHABLE();
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+IndirectPointerHandle IndirectPointerSlot::Relaxed_LoadHandle() const {
+  return base::AsAtomic32::Relaxed_Load(location());
+}
+
+IndirectPointerHandle IndirectPointerSlot::Acquire_LoadHandle() const {
+  return base::AsAtomic32::Acquire_Load(location());
+}
+
+void IndirectPointerSlot::Relaxed_StoreHandle(
+    IndirectPointerHandle handle) const {
+  return base::AsAtomic32::Relaxed_Store(location(), handle);
+}
+
+void IndirectPointerSlot::Release_StoreHandle(
+    IndirectPointerHandle handle) const {
+  return base::AsAtomic32::Release_Store(location(), handle);
+}
+
 //
 // Utils.
 //
@@ -263,7 +378,8 @@ inline void CopyTagged(Address dst, const Address src, size_t num_tagged) {
 }
 
 // Sets |counter| number of kTaggedSize-sized values starting at |start| slot.
-inline void MemsetTagged(Tagged_t* start, Object value, size_t counter) {
+inline void MemsetTagged(Tagged_t* start, Tagged<Object> value,
+                         size_t counter) {
 #ifdef V8_COMPRESS_POINTERS
   // CompressAny since many callers pass values which are not valid objects.
   Tagged_t raw_value = V8HeapCompressionScheme::CompressAny(value.ptr());
@@ -276,14 +392,15 @@ inline void MemsetTagged(Tagged_t* start, Object value, size_t counter) {
 
 // Sets |counter| number of kTaggedSize-sized values starting at |start| slot.
 template <typename T>
-inline void MemsetTagged(SlotBase<T, Tagged_t> start, Object value,
+inline void MemsetTagged(SlotBase<T, Tagged_t> start, Tagged<Object> value,
                          size_t counter) {
   MemsetTagged(start.location(), value, counter);
 }
 
 // Sets |counter| number of kSystemPointerSize-sized values starting at |start|
 // slot.
-inline void MemsetPointer(FullObjectSlot start, Object value, size_t counter) {
+inline void MemsetPointer(FullObjectSlot start, Tagged<Object> value,
+                          size_t counter) {
   MemsetPointer(start.location(), value.ptr(), counter);
 }
 
diff --git a/deps/v8/src/objects/slots.h b/deps/v8/src/objects/slots.h
index cf965b10a8e716..867b610c6cf1b6 100644
--- a/deps/v8/src/objects/slots.h
+++ b/deps/v8/src/objects/slots.h
@@ -14,6 +14,7 @@ namespace v8 {
 namespace internal {
 
 class Object;
+using TaggedBase = TaggedImpl<HeapObjectReferenceType::STRONG, Address>;
 
 template <typename Subclass, typename Data,
           size_t SlotDataAlignment = sizeof(Data)>
@@ -92,7 +93,7 @@ class SlotBase {
 // The slot's contents can be read and written using operator* and store().
 class FullObjectSlot : public SlotBase<FullObjectSlot, Address> {
  public:
-  using TObject = Object;
+  using TObject = Tagged<Object>;
   using THeapObjectSlot = FullHeapObjectSlot;
 
   // Tagged value stored in this slot is guaranteed to never be a weak pointer.
@@ -102,31 +103,33 @@ class FullObjectSlot : public SlotBase<FullObjectSlot, Address> {
   explicit FullObjectSlot(Address ptr) : SlotBase(ptr) {}
   explicit FullObjectSlot(const Address* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
-  inline explicit FullObjectSlot(Object* object);
+  inline explicit FullObjectSlot(TaggedBase* object);
   template <typename T>
   explicit FullObjectSlot(SlotBase<T, TData, kSlotDataAlignment> slot)
       : SlotBase(slot.address()) {}
 
   // Compares memory representation of a value stored in the slot with given
   // raw value.
-  inline bool contains_value(Address raw_value) const;
   inline bool contains_map_value(Address raw_value) const;
-
-  inline Object operator*() const;
-  inline Object load(PtrComprCageBase cage_base) const;
-  inline void store(Object value) const;
-  inline void store_map(Map map) const;
-
-  inline Map load_map() const;
-
-  inline Object Acquire_Load() const;
-  inline Object Acquire_Load(PtrComprCageBase cage_base) const;
-  inline Object Relaxed_Load() const;
-  inline Object Relaxed_Load(PtrComprCageBase cage_base) const;
-  inline void Relaxed_Store(Object value) const;
-  inline void Release_Store(Object value) const;
-  inline Object Relaxed_CompareAndSwap(Object old, Object target) const;
-  inline Object Release_CompareAndSwap(Object old, Object target) const;
+  inline bool Relaxed_ContainsMapValue(Address raw_value) const;
+
+  inline Tagged<Object> operator*() const;
+  inline Tagged<Object> load(PtrComprCageBase cage_base) const;
+  inline void store(Tagged<Object> value) const;
+  inline void store_map(Tagged<Map> map) const;
+
+  inline Tagged<Map> load_map() const;
+
+  inline Tagged<Object> Acquire_Load() const;
+  inline Tagged<Object> Acquire_Load(PtrComprCageBase cage_base) const;
+  inline Tagged<Object> Relaxed_Load() const;
+  inline Tagged<Object> Relaxed_Load(PtrComprCageBase cage_base) const;
+  inline void Relaxed_Store(Tagged<Object> value) const;
+  inline void Release_Store(Tagged<Object> value) const;
+  inline Tagged<Object> Relaxed_CompareAndSwap(Tagged<Object> old,
+                                               Tagged<Object> target) const;
+  inline Tagged<Object> Release_CompareAndSwap(Tagged<Object> old,
+                                               Tagged<Object> target) const;
 };
 
 // A FullMaybeObjectSlot instance describes a kSystemPointerSize-sized field
@@ -144,7 +147,7 @@ class FullMaybeObjectSlot
 
   FullMaybeObjectSlot() : SlotBase(kNullAddress) {}
   explicit FullMaybeObjectSlot(Address ptr) : SlotBase(ptr) {}
-  explicit FullMaybeObjectSlot(Object* ptr)
+  explicit FullMaybeObjectSlot(TaggedBase* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
   explicit FullMaybeObjectSlot(MaybeObject* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
@@ -173,7 +176,7 @@ class FullHeapObjectSlot : public SlotBase<FullHeapObjectSlot, Address> {
  public:
   FullHeapObjectSlot() : SlotBase(kNullAddress) {}
   explicit FullHeapObjectSlot(Address ptr) : SlotBase(ptr) {}
-  explicit FullHeapObjectSlot(Object* ptr)
+  explicit FullHeapObjectSlot(TaggedBase* ptr)
       : SlotBase(reinterpret_cast<Address>(ptr)) {}
   template <typename T>
   explicit FullHeapObjectSlot(SlotBase<T, TData, kSlotDataAlignment> slot)
@@ -183,9 +186,9 @@ class FullHeapObjectSlot : public SlotBase<FullHeapObjectSlot, Address> {
   inline HeapObjectReference load(PtrComprCageBase cage_base) const;
   inline void store(HeapObjectReference value) const;
 
-  inline HeapObject ToHeapObject() const;
+  inline Tagged<HeapObject> ToHeapObject() const;
 
-  inline void StoreHeapObject(HeapObject value) const;
+  inline void StoreHeapObject(Tagged<HeapObject> value) const;
 };
 
 // TODO(ishell, v8:8875): When pointer compression is enabled the [u]intptr_t
@@ -274,10 +277,10 @@ class OffHeapFullObjectSlot : public FullObjectSlot {
   explicit OffHeapFullObjectSlot(Address ptr) : FullObjectSlot(ptr) {}
   explicit OffHeapFullObjectSlot(const Address* ptr) : FullObjectSlot(ptr) {}
 
-  inline Object operator*() const = delete;
+  inline Tagged<Object> operator*() const = delete;
 
   using FullObjectSlot::Relaxed_Load;
-  inline Object Relaxed_Load() const = delete;
+  inline Tagged<Object> Relaxed_Load() const = delete;
 };
 
 // An ExternalPointerSlot instance describes a kExternalPointerSlotSize-sized
@@ -323,6 +326,11 @@ class ExternalPointerSlot
       const DisallowGarbageCollection& no_gc);
   inline void RestoreContentAfterSerialization(
       RawContent content, const DisallowGarbageCollection& no_gc);
+  // The ReadOnlySerializer replaces the RawContent in-place.
+  inline void ReplaceContentWithIndexForSerialization(
+      const DisallowGarbageCollection& no_gc, uint32_t index);
+  inline uint32_t GetContentAsIndexAfterDeserialization(
+      const DisallowGarbageCollection& no_gc);
 
  private:
 #ifdef V8_ENABLE_SANDBOX
@@ -330,9 +338,46 @@ class ExternalPointerSlot
       const Isolate* isolate, ExternalPointerTag tag);
   inline ExternalPointerTable& GetExternalPointerTableForTag(
       Isolate* isolate, ExternalPointerTag tag);
+  inline ExternalPointerTable::Space* GetDefaultExternalPointerSpace(
+      Isolate* isolate, ExternalPointerTag tag);
 #endif  // V8_ENABLE_SANDBOX
 };
 
+// An IndirectPointerSlot instance describes a 32-bit field ("slot") containing
+// an IndirectPointerHandle, i.e. an index to an entry in a pointer table which
+// contains the "real" pointer to the referenced HeapObject. These slots are
+// used when the sandbox is enabled to securely reference HeapObjects outside
+// of the sandbox.
+// If we ever have multiple tables for indirect pointers, this class would
+// probably also contain a reference to the pointer table.
+class IndirectPointerSlot
+    : public SlotBase<IndirectPointerSlot, IndirectPointerHandle,
+                      kTaggedSize /* slot alignment */> {
+ public:
+  IndirectPointerSlot() : SlotBase(kNullAddress) {}
+  explicit IndirectPointerSlot(Address ptr) : SlotBase(ptr) {}
+
+  // Even though only HeapObjects (TODO(saelo) or some ExternalObject class,
+  // see below) can be stored into an IndirectPointerSlot, these slots can be
+  // empty (containing kNullIndirectPointerHandle), in which case load() will
+  // return Smi::zero().
+  inline Tagged<Object> load() const;
+  // TODO(saelo) currently, Code objects are the only objects that can be
+  // referenced through an indirect pointer. Once we have more, we should
+  // generalize this to take ExternalObject or another appropriate base class.
+  inline void store(Tagged<Code> value) const;
+
+  inline Tagged<Object> Relaxed_Load() const;
+  inline Tagged<Object> Acquire_Load() const;
+  inline void Relaxed_Store(Tagged<Code> value) const;
+  inline void Release_Store(Tagged<Code> value) const;
+
+  inline IndirectPointerHandle Relaxed_LoadHandle() const;
+  inline IndirectPointerHandle Acquire_LoadHandle() const;
+  inline void Relaxed_StoreHandle(IndirectPointerHandle handle) const;
+  inline void Release_StoreHandle(IndirectPointerHandle handle) const;
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/smi.h b/deps/v8/src/objects/smi.h
index e04f6ac05011c7..39357f0faa0f13 100644
--- a/deps/v8/src/objects/smi.h
+++ b/deps/v8/src/objects/smi.h
@@ -6,7 +6,7 @@
 #define V8_OBJECTS_SMI_H_
 
 #include "src/common/globals.h"
-#include "src/objects/heap-object.h"
+#include "src/objects/objects.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
@@ -25,44 +25,47 @@ class Smi : public Object {
   // This replaces the OBJECT_CONSTRUCTORS macro, because Smis are special
   // in that we want them to be constexprs.
   constexpr Smi() : Object() {}
+  explicit constexpr Smi(Address ptr, SkipTypeCheckTag)
+      : Object(ptr, SkipTypeCheckTag()) {}
   explicit constexpr Smi(Address ptr) : Object(ptr) {
     DCHECK(HAS_SMI_TAG(ptr));
   }
 
   // Returns the integer value.
-  inline int value() const { return Internals::SmiValue(ptr()); }
-  inline Smi ToUint32Smi() {
-    if (value() <= 0) return Smi::FromInt(0);
-    return Smi::FromInt(static_cast<uint32_t>(value()));
+  inline constexpr int value() const { return Internals::SmiValue(ptr()); }
+  static inline constexpr Tagged<Smi> ToUint32Smi(Tagged<Smi> smi) {
+    if (smi.value() <= 0) return Smi::FromInt(0);
+    return Smi::FromInt(static_cast<uint32_t>(smi.value()));
   }
 
   // Convert a Smi object to an int.
-  static inline int ToInt(const Object object) {
-    return Smi::cast(object).value();
+  static inline constexpr int ToInt(const Tagged<Object> object) {
+    return Tagged<Smi>(object.ptr()).value();
   }
 
   // Convert a value to a Smi object.
-  static inline constexpr Smi FromInt(int value) {
+  static inline constexpr Tagged<Smi> FromInt(int value) {
     DCHECK(Smi::IsValid(value));
-    return Smi(Internals::IntToSmi(value));
+    return Tagged<Smi>(Internals::IntToSmi(value));
   }
 
-  static inline Smi FromIntptr(intptr_t value) {
+  static inline constexpr Tagged<Smi> FromIntptr(intptr_t value) {
     DCHECK(Smi::IsValid(value));
     int smi_shift_bits = kSmiTagSize + kSmiShiftSize;
-    return Smi((static_cast<Address>(value) << smi_shift_bits) | kSmiTag);
+    return Tagged<Smi>((static_cast<Address>(value) << smi_shift_bits) |
+                       kSmiTag);
   }
 
   // Given {value} in [0, 2^31-1], force it into Smi range by changing at most
   // the MSB (leaving the lower 31 bit unchanged).
-  static inline Smi From31BitPattern(int value) {
+  static inline constexpr Tagged<Smi> From31BitPattern(int value) {
     return Smi::FromInt((value << (32 - kSmiValueSize)) >>
                         (32 - kSmiValueSize));
   }
 
   template <typename E,
             typename = typename std::enable_if<std::is_enum<E>::value>::type>
-  static inline Smi FromEnum(E value) {
+  static inline constexpr Tagged<Smi> FromEnum(E value) {
     static_assert(sizeof(E) <= sizeof(int));
     return FromInt(static_cast<int>(value));
   }
@@ -81,18 +84,19 @@ class Smi : public Object {
   //  1 if x > y.
   // Returns the result (a tagged Smi) as a raw Address for ExternalReference
   // usage.
-  V8_EXPORT_PRIVATE static Address LexicographicCompare(Isolate* isolate, Smi x,
-                                                        Smi y);
+  V8_EXPORT_PRIVATE static Address LexicographicCompare(Isolate* isolate,
+                                                        Tagged<Smi> x,
+                                                        Tagged<Smi> y);
 
   DECL_CAST(Smi)
 
   // Dispatched behavior.
-  V8_EXPORT_PRIVATE void SmiPrint(std::ostream& os) const;
-  DECL_VERIFIER(Smi)
+  V8_EXPORT_PRIVATE static void SmiPrint(Tagged<Smi> smi, std::ostream& os);
+  DECL_STATIC_VERIFIER(Smi)
 
   // Since this is a constexpr, "calling" it is just as efficient
   // as reading a constant.
-  static inline constexpr Smi zero() { return Smi::FromInt(0); }
+  static inline constexpr Tagged<Smi> zero() { return Smi::FromInt(0); }
   static constexpr int kMinValue = kSmiMinValue;
   static constexpr int kMaxValue = kSmiMaxValue;
 
@@ -107,13 +111,27 @@ class Smi : public Object {
   // of embedder tracing (and similar mechanisms), as nullptrs are skipped for
   // those cases and otherwise the embedder would try to dereference the
   // uninitialized pointer value.
-  static constexpr Smi uninitialized_deserialization_value() {
-    return Smi(kNullAddress);
+  static constexpr Tagged<Smi> uninitialized_deserialization_value() {
+    return Tagged<Smi>(kNullAddress);
   }
 };
 
 CAST_ACCESSOR(Smi)
 
+// Defined Tagged<Smi> now that Smi exists.
+
+// Implicit conversions to/from raw pointers
+// TODO(leszeks): Remove once we're using Tagged everywhere.
+// NOLINTNEXTLINE
+constexpr Tagged<Smi>::Tagged(Smi raw) : TaggedBase(raw.ptr()) {
+  static_assert(kTaggedCanConvertToRawObjects);
+}
+// NOLINTNEXTLINE
+constexpr Tagged<Smi>::operator Smi() {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return Smi(ptr());
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/source-text-module.cc b/deps/v8/src/objects/source-text-module.cc
index 7baf362b30f130..6d391b2bebcc1c 100644
--- a/deps/v8/src/objects/source-text-module.cc
+++ b/deps/v8/src/objects/source-text-module.cc
@@ -86,28 +86,28 @@ struct SourceTextModule::AsyncEvaluatingOrdinalCompare {
   }
 };
 
-SharedFunctionInfo SourceTextModule::GetSharedFunctionInfo() const {
+Tagged<SharedFunctionInfo> SourceTextModule::GetSharedFunctionInfo() const {
   DisallowGarbageCollection no_gc;
   switch (status()) {
     case kUnlinked:
     case kPreLinking:
       return SharedFunctionInfo::cast(code());
     case kLinking:
-      return JSFunction::cast(code()).shared();
+      return JSFunction::cast(code())->shared();
     case kLinked:
     case kEvaluating:
     case kEvaluatingAsync:
     case kEvaluated:
-      return JSGeneratorObject::cast(code()).function().shared();
+      return JSGeneratorObject::cast(code())->function()->shared();
     case kErrored:
       return SharedFunctionInfo::cast(code());
   }
   UNREACHABLE();
 }
 
-Script SourceTextModule::GetScript() const {
+Tagged<Script> SourceTextModule::GetScript() const {
   DisallowGarbageCollection no_gc;
-  return Script::cast(GetSharedFunctionInfo().script());
+  return Script::cast(GetSharedFunctionInfo()->script());
 }
 
 int SourceTextModule::ExportIndex(int cell_index) {
@@ -126,7 +126,7 @@ void SourceTextModule::CreateIndirectExport(
     Isolate* isolate, Handle<SourceTextModule> module, Handle<String> name,
     Handle<SourceTextModuleInfoEntry> entry) {
   Handle<ObjectHashTable> exports(module->exports(), isolate);
-  DCHECK(exports->Lookup(name).IsTheHole(isolate));
+  DCHECK(IsTheHole(exports->Lookup(name), isolate));
   exports = ObjectHashTable::Put(exports, name, entry);
   module->set_exports(*exports);
 }
@@ -136,26 +136,26 @@ void SourceTextModule::CreateExport(Isolate* isolate,
                                     int cell_index, Handle<FixedArray> names) {
   DCHECK_LT(0, names->length());
   Handle<Cell> cell = isolate->factory()->NewCell();
-  module->regular_exports().set(ExportIndex(cell_index), *cell);
+  module->regular_exports()->set(ExportIndex(cell_index), *cell);
 
   Handle<ObjectHashTable> exports(module->exports(), isolate);
   for (int i = 0, n = names->length(); i < n; ++i) {
     Handle<String> name(String::cast(names->get(i)), isolate);
-    DCHECK(exports->Lookup(name).IsTheHole(isolate));
+    DCHECK(IsTheHole(exports->Lookup(name), isolate));
     exports = ObjectHashTable::Put(exports, name, cell);
   }
   module->set_exports(*exports);
 }
 
-Cell SourceTextModule::GetCell(int cell_index) {
+Tagged<Cell> SourceTextModule::GetCell(int cell_index) {
   DisallowGarbageCollection no_gc;
-  Object cell;
+  Tagged<Object> cell;
   switch (SourceTextModuleDescriptor::GetCellIndexKind(cell_index)) {
     case SourceTextModuleDescriptor::kImport:
-      cell = regular_imports().get(ImportIndex(cell_index));
+      cell = regular_imports()->get(ImportIndex(cell_index));
       break;
     case SourceTextModuleDescriptor::kExport:
-      cell = regular_exports().get(ExportIndex(cell_index));
+      cell = regular_exports()->get(ExportIndex(cell_index));
       break;
     case SourceTextModuleDescriptor::kInvalid:
       UNREACHABLE();
@@ -166,7 +166,7 @@ Cell SourceTextModule::GetCell(int cell_index) {
 Handle<Object> SourceTextModule::LoadVariable(Isolate* isolate,
                                               Handle<SourceTextModule> module,
                                               int cell_index) {
-  return handle(module->GetCell(cell_index).value(), isolate);
+  return handle(module->GetCell(cell_index)->value(), isolate);
 }
 
 void SourceTextModule::StoreVariable(Handle<SourceTextModule> module,
@@ -174,15 +174,15 @@ void SourceTextModule::StoreVariable(Handle<SourceTextModule> module,
   DisallowGarbageCollection no_gc;
   DCHECK_EQ(SourceTextModuleDescriptor::GetCellIndexKind(cell_index),
             SourceTextModuleDescriptor::kExport);
-  module->GetCell(cell_index).set_value(*value);
+  module->GetCell(cell_index)->set_value(*value);
 }
 
 MaybeHandle<Cell> SourceTextModule::ResolveExport(
     Isolate* isolate, Handle<SourceTextModule> module,
     Handle<String> module_specifier, Handle<String> export_name,
     MessageLocation loc, bool must_resolve, Module::ResolveSet* resolve_set) {
-  Handle<Object> object(module->exports().Lookup(export_name), isolate);
-  if (object->IsCell()) {
+  Handle<Object> object(module->exports()->Lookup(export_name), isolate);
+  if (IsCell(*object)) {
     // Already resolved (e.g. because it's a local export).
     return Handle<Cell>::cast(object);
   }
@@ -210,7 +210,7 @@ MaybeHandle<Cell> SourceTextModule::ResolveExport(
     name_set->insert(export_name);
   }
 
-  if (object->IsSourceTextModuleInfoEntry()) {
+  if (IsSourceTextModuleInfoEntry(*object)) {
     // Not yet resolved indirect export.
     Handle<SourceTextModuleInfoEntry> entry =
         Handle<SourceTextModuleInfoEntry>::cast(object);
@@ -229,14 +229,14 @@ MaybeHandle<Cell> SourceTextModule::ResolveExport(
     // The export table may have changed but the entry in question should be
     // unchanged.
     Handle<ObjectHashTable> exports(module->exports(), isolate);
-    DCHECK(exports->Lookup(export_name).IsSourceTextModuleInfoEntry());
+    DCHECK(IsSourceTextModuleInfoEntry(exports->Lookup(export_name)));
 
     exports = ObjectHashTable::Put(exports, export_name, cell);
     module->set_exports(*exports);
     return cell;
   }
 
-  DCHECK(object->IsTheHole(isolate));
+  DCHECK(IsTheHole(*object, isolate));
   return SourceTextModule::ResolveExportUsingStarExports(
       isolate, module, module_specifier, export_name, loc, must_resolve,
       resolve_set);
@@ -247,11 +247,11 @@ MaybeHandle<Cell> SourceTextModule::ResolveImport(
     int module_request_index, MessageLocation loc, bool must_resolve,
     Module::ResolveSet* resolve_set) {
   Handle<Module> requested_module(
-      Module::cast(module->requested_modules().get(module_request_index)),
+      Module::cast(module->requested_modules()->get(module_request_index)),
       isolate);
   Handle<ModuleRequest> module_request(
       ModuleRequest::cast(
-          module->info().module_requests().get(module_request_index)),
+          module->info()->module_requests()->get(module_request_index)),
       isolate);
   Handle<String> module_specifier(String::cast(module_request->specifier()),
                                   isolate);
@@ -270,12 +270,12 @@ MaybeHandle<Cell> SourceTextModule::ResolveExportUsingStarExports(
     // Go through all star exports looking for the given name.  If multiple star
     // exports provide the name, make sure they all map it to the same cell.
     Handle<Cell> unique_cell;
-    Handle<FixedArray> special_exports(module->info().special_exports(),
+    Handle<FixedArray> special_exports(module->info()->special_exports(),
                                        isolate);
     for (int i = 0, n = special_exports->length(); i < n; ++i) {
       i::Handle<i::SourceTextModuleInfoEntry> entry(
           i::SourceTextModuleInfoEntry::cast(special_exports->get(i)), isolate);
-      if (!entry->export_name().IsUndefined(isolate)) {
+      if (!IsUndefined(entry->export_name(), isolate)) {
         continue;  // Indirect export.
       }
 
@@ -301,7 +301,7 @@ MaybeHandle<Cell> SourceTextModule::ResolveExportUsingStarExports(
     if (!unique_cell.is_null()) {
       // Found a unique star export for this name.
       Handle<ObjectHashTable> exports(module->exports(), isolate);
-      DCHECK(exports->Lookup(export_name).IsTheHole(isolate));
+      DCHECK(IsTheHole(exports->Lookup(export_name), isolate));
       exports = ObjectHashTable::Put(exports, export_name, unique_cell);
       module->set_exports(*exports);
       return unique_cell;
@@ -385,7 +385,7 @@ bool SourceTextModule::PrepareInstantiate(
     Handle<SourceTextModuleInfoEntry> entry(
         SourceTextModuleInfoEntry::cast(special_exports->get(i)), isolate);
     Handle<Object> export_name(entry->export_name(), isolate);
-    if (export_name->IsUndefined(isolate)) continue;  // Star export.
+    if (IsUndefined(*export_name, isolate)) continue;  // Star export.
     CreateIndirectExport(isolate, module, Handle<String>::cast(export_name),
                          entry);
   }
@@ -398,10 +398,10 @@ bool SourceTextModule::RunInitializationCode(Isolate* isolate,
                                              Handle<SourceTextModule> module) {
   DCHECK_EQ(module->status(), kLinking);
   Handle<JSFunction> function(JSFunction::cast(module->code()), isolate);
-  DCHECK_EQ(MODULE_SCOPE, function->shared().scope_info().scope_type());
+  DCHECK_EQ(MODULE_SCOPE, function->shared()->scope_info()->scope_type());
   Handle<Object> receiver = isolate->factory()->undefined_value();
 
-  Handle<ScopeInfo> scope_info(function->shared().scope_info(), isolate);
+  Handle<ScopeInfo> scope_info(function->shared()->scope_info(), isolate);
   Handle<Context> context = isolate->factory()->NewModuleContext(
       module, isolate->native_context(), scope_info);
   function->set_context(*context);
@@ -440,7 +440,7 @@ bool SourceTextModule::MaybeTransitionComponent(
         if (!SourceTextModule::RunInitializationCode(isolate, ancestor))
           return false;
       } else if (new_status == kEvaluated) {
-        DCHECK(ancestor->cycle_root().IsTheHole(isolate));
+        DCHECK(IsTheHole(ancestor->cycle_root(), isolate));
         ancestor->set_cycle_root(*cycle_root);
       }
       ancestor->SetStatus(new_status);
@@ -491,7 +491,7 @@ bool SourceTextModule::FinishInstantiate(
       // SourceTextModule
       module->set_dfs_ancestor_index(std::min(
           module->dfs_ancestor_index(),
-          SourceTextModule::cast(*requested_module).dfs_ancestor_index()));
+          SourceTextModule::cast(*requested_module)->dfs_ancestor_index()));
     }
   }
 
@@ -512,7 +512,7 @@ bool SourceTextModule::FinishInstantiate(
              .ToHandle(&cell)) {
       return false;
     }
-    module->regular_imports().set(ImportIndex(entry->cell_index()), *cell);
+    module->regular_imports()->set(ImportIndex(entry->cell_index()), *cell);
   }
 
   // Resolve indirect exports.
@@ -521,7 +521,7 @@ bool SourceTextModule::FinishInstantiate(
     Handle<SourceTextModuleInfoEntry> entry(
         SourceTextModuleInfoEntry::cast(special_exports->get(i)), isolate);
     Handle<Object> name(entry->export_name(), isolate);
-    if (name->IsUndefined(isolate)) continue;  // Star export.
+    if (IsUndefined(*name, isolate)) continue;  // Star export.
     MessageLocation loc(script, entry->beg_pos(), entry->end_pos());
     ResolveSet resolve_set(zone);
     if (ResolveExport(isolate, module, Handle<String>(),
@@ -540,7 +540,7 @@ void SourceTextModule::FetchStarExports(Isolate* isolate,
                                         UnorderedModuleSet* visited) {
   DCHECK_GE(module->status(), Module::kLinking);
 
-  if (module->module_namespace().IsJSModuleNamespace()) return;  // Shortcut.
+  if (IsJSModuleNamespace(module->module_namespace())) return;  // Shortcut.
 
   bool cycle = !visited->insert(module).second;
   if (cycle) return;
@@ -551,20 +551,21 @@ void SourceTextModule::FetchStarExports(Isolate* isolate,
   // Maybe split special_exports into indirect_exports and star_exports.
 
   ReadOnlyRoots roots(isolate);
-  Handle<FixedArray> special_exports(module->info().special_exports(), isolate);
+  Handle<FixedArray> special_exports(module->info()->special_exports(),
+                                     isolate);
   for (int i = 0, n = special_exports->length(); i < n; ++i) {
     Handle<SourceTextModuleInfoEntry> entry(
         SourceTextModuleInfoEntry::cast(special_exports->get(i)), isolate);
-    if (!entry->export_name().IsUndefined(roots)) {
+    if (!IsUndefined(entry->export_name(), roots)) {
       continue;  // Indirect export.
     }
 
     Handle<Module> requested_module(
-        Module::cast(module->requested_modules().get(entry->module_request())),
+        Module::cast(module->requested_modules()->get(entry->module_request())),
         isolate);
 
     // Recurse.
-    if (requested_module->IsSourceTextModule())
+    if (IsSourceTextModule(*requested_module))
       FetchStarExports(isolate,
                        Handle<SourceTextModule>::cast(requested_module), zone,
                        visited);
@@ -576,22 +577,22 @@ void SourceTextModule::FetchStarExports(Isolate* isolate,
     Handle<ObjectHashTable> requested_exports(requested_module->exports(),
                                               isolate);
     for (InternalIndex index : requested_exports->IterateEntries()) {
-      Object key;
+      Tagged<Object> key;
       if (!requested_exports->ToKey(roots, index, &key)) continue;
       Handle<String> name(String::cast(key), isolate);
 
       if (name->Equals(roots.default_string())) continue;
-      if (!exports->Lookup(name).IsTheHole(roots)) continue;
+      if (!IsTheHole(exports->Lookup(name), roots)) continue;
 
       Handle<Cell> cell(Cell::cast(requested_exports->ValueAt(index)), isolate);
       auto insert_result = more_exports.insert(std::make_pair(name, cell));
       if (!insert_result.second) {
         auto it = insert_result.first;
-        if (*it->second == *cell || it->second->IsUndefined(roots)) {
+        if (*it->second == *cell || IsUndefined(*it->second, roots)) {
           // We already recorded this mapping before, or the name is already
           // known to be ambiguous.  In either case, there's nothing to do.
         } else {
-          DCHECK(it->second->IsCell());
+          DCHECK(IsCell(*it->second));
           // Different star exports provide different cells for this name, hence
           // mark the name as ambiguous.
           it->second = roots.undefined_value_handle();
@@ -602,9 +603,9 @@ void SourceTextModule::FetchStarExports(Isolate* isolate,
 
   // Copy [more_exports] into [exports].
   for (const auto& elem : more_exports) {
-    if (elem.second->IsUndefined(isolate)) continue;  // Ambiguous export.
+    if (IsUndefined(*elem.second, isolate)) continue;  // Ambiguous export.
     DCHECK(!elem.first->Equals(ReadOnlyRoots(isolate).default_string()));
-    DCHECK(elem.second->IsCell());
+    DCHECK(IsCell(*elem.second));
     exports = ObjectHashTable::Put(exports, elem.first, elem.second);
   }
   module->set_exports(*exports);
@@ -665,14 +666,14 @@ void SourceTextModule::GatherAsyncParentCompletions(
 Handle<JSModuleNamespace> SourceTextModule::GetModuleNamespace(
     Isolate* isolate, Handle<SourceTextModule> module, int module_request) {
   Handle<Module> requested_module(
-      Module::cast(module->requested_modules().get(module_request)), isolate);
+      Module::cast(module->requested_modules()->get(module_request)), isolate);
   return Module::GetModuleNamespace(isolate, requested_module);
 }
 
 MaybeHandle<JSObject> SourceTextModule::GetImportMeta(
     Isolate* isolate, Handle<SourceTextModule> module) {
   Handle<HeapObject> import_meta(module->import_meta(kAcquireLoad), isolate);
-  if (import_meta->IsTheHole(isolate)) {
+  if (IsTheHole(*import_meta, isolate)) {
     if (!isolate->RunHostInitializeImportMetaObjectCallback(module).ToHandle(
             &import_meta)) {
       return {};
@@ -685,7 +686,7 @@ MaybeHandle<JSObject> SourceTextModule::GetImportMeta(
 bool SourceTextModule::MaybeHandleEvaluationException(
     Isolate* isolate, ZoneForwardList<Handle<SourceTextModule>>* stack) {
   DisallowGarbageCollection no_gc;
-  Object pending_exception = isolate->pending_exception();
+  Tagged<Object> pending_exception = isolate->pending_exception();
   if (isolate->is_catchable_by_javascript(pending_exception)) {
     //  a. For each Cyclic Module Record m in stack, do
     for (Handle<SourceTextModule>& descendant : *stack) {
@@ -724,7 +725,7 @@ MaybeHandle<Object> SourceTextModule::Evaluate(
 
   // 7. Set module.[[TopLevelCapability]] to capability.
   module->set_top_level_capability(*capability);
-  DCHECK(module->top_level_capability().IsJSPromise());
+  DCHECK(IsJSPromise(module->top_level_capability()));
 
   // 8. Let result be InnerModuleEvaluation(module, stack, 0).
   // 9. If result is an abrupt completion, then
@@ -763,7 +764,7 @@ Maybe<bool> SourceTextModule::AsyncModuleExecutionFulfilled(
   // 1. If module.[[Status]] is evaluated, then
   if (module->status() == kErrored) {
     // a. Assert: module.[[EvaluationError]] is not empty.
-    DCHECK(!module->exception().IsTheHole(isolate));
+    DCHECK(!IsTheHole(module->exception(), isolate));
     // b. Return.
     return Just(true);
   }
@@ -776,7 +777,7 @@ Maybe<bool> SourceTextModule::AsyncModuleExecutionFulfilled(
   module->set_async_evaluating_ordinal(kAsyncEvaluateDidFinish);
   // TODO(cbruni): update to match spec.
   // 7. If module.[[TopLevelCapability]] is not empty, then
-  if (!module->top_level_capability().IsUndefined(isolate)) {
+  if (!IsUndefined(module->top_level_capability(), isolate)) {
     //  a. Assert: module.[[CycleRoot]] is equal to module.
     DCHECK_EQ(*module->GetCycleRoot(isolate), *module);
     //   i. Perform ! Call(module.[[TopLevelCapability]].[[Resolve]], undefined,
@@ -841,7 +842,7 @@ Maybe<bool> SourceTextModule::AsyncModuleExecutionFulfilled(
         m->set_async_evaluating_ordinal(kAsyncEvaluateDidFinish);
 
         //    2. If m.[[TopLevelCapability]] is not empty, then
-        if (!m->top_level_capability().IsUndefined(isolate)) {
+        if (!IsUndefined(m->top_level_capability(), isolate)) {
           //  i. Assert: m.[[CycleRoot]] is equal to m.
           DCHECK_EQ(*m->GetCycleRoot(isolate), *m);
 
@@ -866,7 +867,7 @@ void SourceTextModule::AsyncModuleExecutionRejected(
   // 1. If module.[[Status]] is evaluated, then
   if (module->status() == kErrored) {
     // a. Assert: module.[[EvaluationError]] is not empty.
-    DCHECK(!module->exception().IsTheHole(isolate));
+    DCHECK(!IsTheHole(module->exception(), isolate));
     // b. Return.
     return;
   }
@@ -906,7 +907,7 @@ void SourceTextModule::AsyncModuleExecutionRejected(
   }
 
   // 8. If module.[[TopLevelCapability]] is not empty, then
-  if (!module->top_level_capability().IsUndefined(isolate)) {
+  if (!IsUndefined(module->top_level_capability(), isolate)) {
     //  a. Assert: module.[[CycleRoot]] is equal to module.
     DCHECK_EQ(*module->GetCycleRoot(isolate), *module);
     //  b. Perform ! Call(module.[[TopLevelCapability]].[[Reject]],
@@ -1024,8 +1025,9 @@ MaybeHandle<Object> SourceTextModule::ExecuteModule(
                          Execution::MessageHandling::kKeepPending, nullptr,
                          false),
       Object);
-  DCHECK(JSIteratorResult::cast(*result).done().BooleanValue(isolate));
-  return handle(JSIteratorResult::cast(*result).value(), isolate);
+  DCHECK(
+      Object::BooleanValue(JSIteratorResult::cast(*result)->done(), isolate));
+  return handle(JSIteratorResult::cast(*result)->value(), isolate);
 }
 
 MaybeHandle<Object> SourceTextModule::InnerModuleEvaluation(
@@ -1056,21 +1058,21 @@ MaybeHandle<Object> SourceTextModule::InnerModuleEvaluation(
 
   {
     DisallowGarbageCollection no_gc;
-    SourceTextModule raw_module = *module;
+    Tagged<SourceTextModule> raw_module = *module;
     // 5. Set module.[[Status]] to "evaluating".
-    raw_module.SetStatus(kEvaluating);
+    raw_module->SetStatus(kEvaluating);
 
     // 6. Set module.[[DFSIndex]] to index.
-    raw_module.set_dfs_index(*dfs_index);
+    raw_module->set_dfs_index(*dfs_index);
 
     // 7. Set module.[[DFSAncestorIndex]] to index.
-    raw_module.set_dfs_ancestor_index(*dfs_index);
+    raw_module->set_dfs_ancestor_index(*dfs_index);
 
     // 8. Set module.[[PendingAsyncDependencies]] to 0.
-    DCHECK(!raw_module.HasPendingAsyncDependencies());
+    DCHECK(!raw_module->HasPendingAsyncDependencies());
 
     // 9. Set module.[[AsyncParentModules]] to a new empty List.
-    raw_module.set_async_parent_modules(
+    raw_module->set_async_parent_modules(
         ReadOnlyRoots(isolate).empty_array_list());
 
     // 10. Set index to index + 1.
@@ -1080,7 +1082,7 @@ MaybeHandle<Object> SourceTextModule::InnerModuleEvaluation(
     stack->push_front(module);
 
     // Recursion.
-    requested_modules = handle(raw_module.requested_modules(), isolate);
+    requested_modules = handle(raw_module->requested_modules(), isolate);
   }
 
   // 12. For each String required that is an element of
@@ -1089,7 +1091,7 @@ MaybeHandle<Object> SourceTextModule::InnerModuleEvaluation(
     Handle<Module> requested_module(Module::cast(requested_modules->get(i)),
                                     isolate);
     //   d. If requiredModule is a Cyclic Module Record, then
-    if (requested_module->IsSourceTextModule()) {
+    if (IsSourceTextModule(*requested_module)) {
       Handle<SourceTextModule> required_module(
           SourceTextModule::cast(*requested_module), isolate);
       RETURN_ON_EXCEPTION(
@@ -1201,25 +1203,25 @@ void SourceTextModule::Reset(Isolate* isolate,
                              Handle<SourceTextModule> module) {
   Factory* factory = isolate->factory();
 
-  DCHECK(module->import_meta(kAcquireLoad).IsTheHole(isolate));
+  DCHECK(IsTheHole(module->import_meta(kAcquireLoad), isolate));
 
   Handle<FixedArray> regular_exports =
-      factory->NewFixedArray(module->regular_exports().length());
+      factory->NewFixedArray(module->regular_exports()->length());
   Handle<FixedArray> regular_imports =
-      factory->NewFixedArray(module->regular_imports().length());
+      factory->NewFixedArray(module->regular_imports()->length());
   Handle<FixedArray> requested_modules =
-      factory->NewFixedArray(module->requested_modules().length());
+      factory->NewFixedArray(module->requested_modules()->length());
 
   DisallowGarbageCollection no_gc;
-  auto raw_module = *module;
-  if (raw_module.status() == kLinking) {
-    raw_module.set_code(JSFunction::cast(raw_module.code()).shared());
+  Tagged<SourceTextModule> raw_module = *module;
+  if (raw_module->status() == kLinking) {
+    raw_module->set_code(JSFunction::cast(raw_module->code())->shared());
   }
-  raw_module.set_regular_exports(*regular_exports);
-  raw_module.set_regular_imports(*regular_imports);
-  raw_module.set_requested_modules(*requested_modules);
-  raw_module.set_dfs_index(-1);
-  raw_module.set_dfs_ancestor_index(-1);
+  raw_module->set_regular_exports(*regular_exports);
+  raw_module->set_regular_imports(*regular_imports);
+  raw_module->set_requested_modules(*requested_modules);
+  raw_module->set_dfs_index(-1);
+  raw_module->set_dfs_ancestor_index(-1);
 }
 
 std::vector<std::tuple<Handle<SourceTextModule>, Handle<JSMessageObject>>>
@@ -1236,7 +1238,7 @@ SourceTextModule::GetStalledTopLevelAwaitMessage(Isolate* isolate) {
   result.reserve(stalled_modules_size);
   for (size_t i = 0; i < stalled_modules_size; ++i) {
     Handle<SourceTextModule> found = stalled_modules[i];
-    CHECK(found->code().IsJSGeneratorObject());
+    CHECK(IsJSGeneratorObject(found->code()));
     Handle<JSGeneratorObject> code(JSGeneratorObject::cast(found->code()),
                                    isolate);
     Handle<SharedFunctionInfo> shared(found->GetSharedFunctionInfo(), isolate);
@@ -1262,16 +1264,16 @@ void SourceTextModule::InnerGetStalledTopLevelAwaitModule(
     return;
   }
   // The module isn't what we are looking for, continue looking in the graph.
-  FixedArray requested = requested_modules();
-  int length = requested.length();
+  Tagged<FixedArray> requested = requested_modules();
+  int length = requested->length();
   for (int i = 0; i < length; ++i) {
-    Module requested_module = Module::cast(requested.get(i));
-    if (requested_module.IsSourceTextModule() &&
+    Tagged<Module> requested_module = Module::cast(requested->get(i));
+    if (IsSourceTextModule(requested_module) &&
         visited->insert(handle(requested_module, isolate)).second) {
-      SourceTextModule source_text_module =
+      Tagged<SourceTextModule> source_text_module =
           SourceTextModule::cast(requested_module);
-      source_text_module.InnerGetStalledTopLevelAwaitModule(isolate, visited,
-                                                            result);
+      source_text_module->InnerGetStalledTopLevelAwaitModule(isolate, visited,
+                                                             result);
     }
   }
 }
diff --git a/deps/v8/src/objects/source-text-module.h b/deps/v8/src/objects/source-text-module.h
index 05a1cef551a199..55754c0a7d4bfc 100644
--- a/deps/v8/src/objects/source-text-module.h
+++ b/deps/v8/src/objects/source-text-module.h
@@ -33,18 +33,18 @@ class SourceTextModule
 
   // The shared function info in case {status} is not kEvaluating, kEvaluated or
   // kErrored.
-  SharedFunctionInfo GetSharedFunctionInfo() const;
+  Tagged<SharedFunctionInfo> GetSharedFunctionInfo() const;
 
-  Script GetScript() const;
+  Tagged<Script> GetScript() const;
 
   // Whether or not this module is an async module. Set during module creation
   // and does not change afterwards.
   DECL_BOOLEAN_ACCESSORS(async)
 
   // Get the SourceTextModuleInfo associated with the code.
-  inline SourceTextModuleInfo info() const;
+  inline Tagged<SourceTextModuleInfo> info() const;
 
-  Cell GetCell(int cell_index);
+  Tagged<Cell> GetCell(int cell_index);
   static Handle<Object> LoadVariable(Isolate* isolate,
                                      Handle<SourceTextModule> module,
                                      int cell_index);
@@ -145,7 +145,7 @@ class SourceTextModule
 
   // The parent modules of a given async dependency, use async_parent_modules()
   // to retrieve the ArrayList representation.
-  DECL_ACCESSORS(async_parent_modules, ArrayList)
+  DECL_ACCESSORS(async_parent_modules, Tagged<ArrayList>)
 
   // Helpers for Instantiate and Evaluate.
   static void CreateExport(Isolate* isolate, Handle<SourceTextModule> module,
@@ -241,20 +241,20 @@ class SourceTextModuleInfo : public FixedArray {
   static Handle<SourceTextModuleInfo> New(IsolateT* isolate, Zone* zone,
                                           SourceTextModuleDescriptor* descr);
 
-  inline FixedArray module_requests() const;
-  inline FixedArray special_exports() const;
-  inline FixedArray regular_exports() const;
-  inline FixedArray regular_imports() const;
-  inline FixedArray namespace_imports() const;
+  inline Tagged<FixedArray> module_requests() const;
+  inline Tagged<FixedArray> special_exports() const;
+  inline Tagged<FixedArray> regular_exports() const;
+  inline Tagged<FixedArray> regular_imports() const;
+  inline Tagged<FixedArray> namespace_imports() const;
 
   // Accessors for [regular_exports].
   int RegularExportCount() const;
-  String RegularExportLocalName(int i) const;
+  Tagged<String> RegularExportLocalName(int i) const;
   int RegularExportCellIndex(int i) const;
-  FixedArray RegularExportExportNames(int i) const;
+  Tagged<FixedArray> RegularExportExportNames(int i) const;
 
 #ifdef DEBUG
-  inline bool Equals(SourceTextModuleInfo other) const;
+  inline bool Equals(Tagged<SourceTextModuleInfo> other) const;
 #endif
 
  private:
diff --git a/deps/v8/src/objects/string-comparator.cc b/deps/v8/src/objects/string-comparator.cc
index 70d47b36f31074..0ca4debfb87642 100644
--- a/deps/v8/src/objects/string-comparator.cc
+++ b/deps/v8/src/objects/string-comparator.cc
@@ -10,8 +10,10 @@ namespace v8 {
 namespace internal {
 
 void StringComparator::State::Init(
-    String string, const SharedStringAccessGuardIfNeeded& access_guard) {
-  ConsString cons_string = String::VisitFlat(this, string, 0, access_guard);
+    Tagged<String> string,
+    const SharedStringAccessGuardIfNeeded& access_guard) {
+  Tagged<ConsString> cons_string =
+      String::VisitFlat(this, string, 0, access_guard);
   iter_.Reset(cons_string);
   if (!cons_string.is_null()) {
     int offset;
@@ -38,16 +40,16 @@ void StringComparator::State::Advance(
   }
   // Advance state.
   int offset;
-  String next = iter_.Next(&offset);
+  Tagged<String> next = iter_.Next(&offset);
   DCHECK_EQ(0, offset);
   DCHECK(!next.is_null());
   String::VisitFlat(this, next, 0, access_guard);
 }
 
 bool StringComparator::Equals(
-    String string_1, String string_2,
+    Tagged<String> string_1, Tagged<String> string_2,
     const SharedStringAccessGuardIfNeeded& access_guard) {
-  int length = string_1.length();
+  int length = string_1->length();
   state_1_.Init(string_1, access_guard);
   state_2_.Init(string_2, access_guard);
   while (true) {
diff --git a/deps/v8/src/objects/string-comparator.h b/deps/v8/src/objects/string-comparator.h
index 8f3420945a4166..953afafe6e2469 100644
--- a/deps/v8/src/objects/string-comparator.h
+++ b/deps/v8/src/objects/string-comparator.h
@@ -20,7 +20,7 @@ class StringComparator {
     State(const State&) = delete;
     State& operator=(const State&) = delete;
 
-    void Init(String string,
+    void Init(Tagged<String> string,
               const SharedStringAccessGuardIfNeeded& access_guard);
 
     inline void VisitOneByteString(const uint8_t* chars, int length) {
@@ -59,7 +59,7 @@ class StringComparator {
     return CompareCharsEqual(a, b, to_check);
   }
 
-  bool Equals(String string_1, String string_2,
+  bool Equals(Tagged<String> string_1, Tagged<String> string_2,
               const SharedStringAccessGuardIfNeeded& access_guard);
 
  private:
diff --git a/deps/v8/src/objects/string-forwarding-table-inl.h b/deps/v8/src/objects/string-forwarding-table-inl.h
index b50104bd09261a..7da8dc15680440 100644
--- a/deps/v8/src/objects/string-forwarding-table-inl.h
+++ b/deps/v8/src/objects/string-forwarding-table-inl.h
@@ -21,11 +21,11 @@ namespace internal {
 
 class StringForwardingTable::Record final {
  public:
-  String original_string(PtrComprCageBase cage_base) const {
+  Tagged<String> original_string(PtrComprCageBase cage_base) const {
     return String::cast(OriginalStringObject(cage_base));
   }
 
-  String forward_string(PtrComprCageBase cage_base) const {
+  Tagged<String> forward_string(PtrComprCageBase cage_base) const {
     return String::cast(ForwardStringObjectOrHash(cage_base));
   }
 
@@ -33,11 +33,11 @@ class StringForwardingTable::Record final {
   inline v8::String::ExternalStringResourceBase* external_resource(
       bool* is_one_byte) const;
 
-  Object OriginalStringObject(PtrComprCageBase cage_base) const {
+  Tagged<Object> OriginalStringObject(PtrComprCageBase cage_base) const {
     return OriginalStringSlot().Acquire_Load(cage_base);
   }
 
-  Object ForwardStringObjectOrHash(PtrComprCageBase cage_base) const {
+  Tagged<Object> ForwardStringObjectOrHash(PtrComprCageBase cage_base) const {
     return ForwardStringOrHashSlot().Acquire_Load(cage_base);
   }
 
@@ -45,11 +45,11 @@ class StringForwardingTable::Record final {
     return base::AsAtomicPointer::Acquire_Load(&external_resource_);
   }
 
-  void set_original_string(Object object) {
+  void set_original_string(Tagged<Object> object) {
     OriginalStringSlot().Release_Store(object);
   }
 
-  void set_forward_string(Object object) {
+  void set_forward_string(Tagged<Object> object) {
     ForwardStringOrHashSlot().Release_Store(object);
   }
 
@@ -60,8 +60,8 @@ class StringForwardingTable::Record final {
     base::AsAtomicPointer::Release_Store(&external_resource_, address);
   }
 
-  inline void SetInternalized(String string, String forward_to);
-  inline void SetExternal(String string,
+  inline void SetInternalized(Tagged<String> string, Tagged<String> forward_to);
+  inline void SetExternal(Tagged<String> string,
                           v8::String::ExternalStringResourceBase*,
                           bool is_one_byte, uint32_t raw_hash);
   inline bool TryUpdateExternalResource(
@@ -71,7 +71,7 @@ class StringForwardingTable::Record final {
   // Dispose the external resource if the original string has transitioned
   // to an external string and the resource used for the transition is different
   // than the one in the record.
-  inline void DisposeUnusedExternalResource(String original_string);
+  inline void DisposeUnusedExternalResource(Tagged<String> original_string);
 
  private:
   OffHeapObjectSlot OriginalStringSlot() const {
@@ -127,10 +127,10 @@ class StringForwardingTable::Record final {
 
 uint32_t StringForwardingTable::Record::raw_hash(
     PtrComprCageBase cage_base) const {
-  Object hash_or_string = ForwardStringObjectOrHash(cage_base);
+  Tagged<Object> hash_or_string = ForwardStringObjectOrHash(cage_base);
   uint32_t raw_hash;
-  if (hash_or_string.IsHeapObject()) {
-    raw_hash = String::cast(hash_or_string).RawHash();
+  if (IsHeapObject(hash_or_string)) {
+    raw_hash = String::cast(hash_or_string)->RawHash();
   } else {
     raw_hash = static_cast<uint32_t>(hash_or_string.ptr());
   }
@@ -166,15 +166,15 @@ void StringForwardingTable::Record::set_external_resource(
   set_external_resource(address);
 }
 
-void StringForwardingTable::Record::SetInternalized(String string,
-                                                    String forward_to) {
+void StringForwardingTable::Record::SetInternalized(Tagged<String> string,
+                                                    Tagged<String> forward_to) {
   set_original_string(string);
   set_forward_string(forward_to);
   set_external_resource(kNullExternalPointer);
 }
 
 void StringForwardingTable::Record::SetExternal(
-    String string, v8::String::ExternalStringResourceBase* resource,
+    Tagged<String> string, v8::String::ExternalStringResourceBase* resource,
     bool is_one_byte, uint32_t raw_hash) {
   set_original_string(string);
   set_raw_hash_if_empty(raw_hash);
@@ -208,18 +208,18 @@ void StringForwardingTable::Record::DisposeExternalResource() {
 }
 
 void StringForwardingTable::Record::DisposeUnusedExternalResource(
-    String original) {
+    Tagged<String> original) {
 #ifdef DEBUG
-  String stored_original =
+  Tagged<String> stored_original =
       original_string(GetIsolateFromWritableObject(original));
-  if (stored_original.IsThinString()) {
-    stored_original = ThinString::cast(stored_original).actual();
+  if (IsThinString(stored_original)) {
+    stored_original = ThinString::cast(stored_original)->actual();
   }
   DCHECK_EQ(original, stored_original);
 #endif
-  if (!original.IsExternalString()) return;
+  if (!IsExternalString(original)) return;
   Address original_resource =
-      ExternalString::cast(original).resource_as_address();
+      ExternalString::cast(original)->resource_as_address();
   bool is_one_byte;
   auto resource = external_resource(&is_one_byte);
   if (resource != nullptr &&
diff --git a/deps/v8/src/objects/string-forwarding-table.cc b/deps/v8/src/objects/string-forwarding-table.cc
index 15733ef7e4b50c..692b317d146708 100644
--- a/deps/v8/src/objects/string-forwarding-table.cc
+++ b/deps/v8/src/objects/string-forwarding-table.cc
@@ -70,18 +70,18 @@ void StringForwardingTable::Block::UpdateAfterFullEvacuation(
 
 namespace {
 
-bool UpdateForwardedSlot(HeapObject object, OffHeapObjectSlot slot) {
-  MapWord map_word = object.map_word(kRelaxedLoad);
+bool UpdateForwardedSlot(Tagged<HeapObject> object, OffHeapObjectSlot slot) {
+  MapWord map_word = object->map_word(kRelaxedLoad);
   if (map_word.IsForwardingAddress()) {
-    HeapObject forwarded_object = map_word.ToForwardingAddress(object);
+    Tagged<HeapObject> forwarded_object = map_word.ToForwardingAddress(object);
     slot.Release_Store(forwarded_object);
     return true;
   }
   return false;
 }
 
-bool UpdateForwardedSlot(Object object, OffHeapObjectSlot slot) {
-  if (!object.IsHeapObject()) return false;
+bool UpdateForwardedSlot(Tagged<Object> object, OffHeapObjectSlot slot) {
+  if (!IsHeapObject(object)) return false;
   return UpdateForwardedSlot(HeapObject::cast(object), slot);
 }
 
@@ -91,9 +91,9 @@ void StringForwardingTable::Block::UpdateAfterYoungEvacuation(
     PtrComprCageBase cage_base, int up_to_index) {
   for (int index = 0; index < up_to_index; ++index) {
     OffHeapObjectSlot slot = record(index)->OriginalStringSlot();
-    Object original = slot.Acquire_Load(cage_base);
-    if (!original.IsHeapObject()) continue;
-    HeapObject object = HeapObject::cast(original);
+    Tagged<Object> original = slot.Acquire_Load(cage_base);
+    if (!IsHeapObject(original)) continue;
+    Tagged<HeapObject> object = HeapObject::cast(original);
     if (Heap::InFromPage(object)) {
       DCHECK(!object.InWritableSharedSpace());
       const bool was_forwarded = UpdateForwardedSlot(object, slot);
@@ -102,13 +102,14 @@ void StringForwardingTable::Block::UpdateAfterYoungEvacuation(
         slot.Release_Store(deleted_element());
       }
     } else {
-      DCHECK(!object.map_word(kRelaxedLoad).IsForwardingAddress());
+      DCHECK(!object->map_word(kRelaxedLoad).IsForwardingAddress());
     }
 // No need to update forwarded (internalized) strings as they are never
 // in young space.
 #ifdef DEBUG
-    Object forward = record(index)->ForwardStringObjectOrHash(cage_base);
-    if (forward.IsHeapObject()) {
+    Tagged<Object> forward =
+        record(index)->ForwardStringObjectOrHash(cage_base);
+    if (IsHeapObject(forward)) {
       DCHECK(!Heap::InYoungGeneration(HeapObject::cast(forward)));
     }
 #endif
@@ -119,13 +120,13 @@ void StringForwardingTable::Block::UpdateAfterFullEvacuation(
     PtrComprCageBase cage_base, int up_to_index) {
   for (int index = 0; index < up_to_index; ++index) {
     OffHeapObjectSlot original_slot = record(index)->OriginalStringSlot();
-    Object original = original_slot.Acquire_Load(cage_base);
-    if (!original.IsHeapObject()) continue;
+    Tagged<Object> original = original_slot.Acquire_Load(cage_base);
+    if (!IsHeapObject(original)) continue;
     UpdateForwardedSlot(HeapObject::cast(original), original_slot);
     // During mark compact the forwarded (internalized) string may have been
     // evacuated.
     OffHeapObjectSlot forward_slot = record(index)->ForwardStringOrHashSlot();
-    Object forward = forward_slot.Acquire_Load(cage_base);
+    Tagged<Object> forward = forward_slot.Acquire_Load(cage_base);
     UpdateForwardedSlot(forward, forward_slot);
   }
 }
@@ -202,11 +203,12 @@ StringForwardingTable::BlockVector* StringForwardingTable::EnsureCapacity(
   return blocks;
 }
 
-int StringForwardingTable::AddForwardString(String string, String forward_to) {
+int StringForwardingTable::AddForwardString(Tagged<String> string,
+                                            Tagged<String> forward_to) {
   DCHECK_IMPLIES(!v8_flags.always_use_string_forwarding_table,
-                 string.InSharedHeap());
+                 Object::InSharedHeap(string));
   DCHECK_IMPLIES(!v8_flags.always_use_string_forwarding_table,
-                 forward_to.InSharedHeap());
+                 Object::InSharedHeap(forward_to));
   int index = next_free_index_++;
   uint32_t index_in_block;
   const uint32_t block_index = BlockForIndex(index, &index_in_block);
@@ -217,7 +219,8 @@ int StringForwardingTable::AddForwardString(String string, String forward_to) {
   return index;
 }
 
-void StringForwardingTable::UpdateForwardString(int index, String forward_to) {
+void StringForwardingTable::UpdateForwardString(int index,
+                                                Tagged<String> forward_to) {
   CHECK_LT(index, size());
   uint32_t index_in_block;
   const uint32_t block_index = BlockForIndex(index, &index_in_block);
@@ -227,14 +230,14 @@ void StringForwardingTable::UpdateForwardString(int index, String forward_to) {
 }
 
 template <typename T>
-int StringForwardingTable::AddExternalResourceAndHash(String string,
+int StringForwardingTable::AddExternalResourceAndHash(Tagged<String> string,
                                                       T* resource,
                                                       uint32_t raw_hash) {
   constexpr bool is_one_byte =
       std::is_base_of_v<v8::String::ExternalOneByteStringResource, T>;
 
   DCHECK_IMPLIES(!v8_flags.always_use_string_forwarding_table,
-                 string.InSharedHeap());
+                 Object::InSharedHeap(string));
   int index = next_free_index_++;
   uint32_t index_in_block;
   const uint32_t block_index = BlockForIndex(index, &index_in_block);
@@ -247,11 +250,11 @@ int StringForwardingTable::AddExternalResourceAndHash(String string,
 }
 
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) int StringForwardingTable::
-    AddExternalResourceAndHash(String string,
+    AddExternalResourceAndHash(Tagged<String> string,
                                v8::String::ExternalOneByteStringResource*,
                                uint32_t raw_hash);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) int StringForwardingTable::
-    AddExternalResourceAndHash(String string,
+    AddExternalResourceAndHash(Tagged<String> string,
                                v8::String::ExternalStringResource*,
                                uint32_t raw_hash);
 
@@ -276,8 +279,8 @@ template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) bool StringForwardingTable::
     TryUpdateExternalResource(int index,
                               v8::String::ExternalStringResource* resource);
 
-String StringForwardingTable::GetForwardString(PtrComprCageBase cage_base,
-                                               int index) const {
+Tagged<String> StringForwardingTable::GetForwardString(
+    PtrComprCageBase cage_base, int index) const {
   CHECK_LT(index, size());
   uint32_t index_in_block;
   const uint32_t block_index = BlockForIndex(index, &index_in_block);
@@ -349,7 +352,7 @@ void StringForwardingTable::Reset() {
 
 void StringForwardingTable::UpdateAfterYoungEvacuation() {
   // This is only used for the Scavenger.
-  DCHECK(!v8_flags.minor_mc);
+  DCHECK(!v8_flags.minor_ms);
   DCHECK(v8_flags.always_use_string_forwarding_table);
 
   if (empty()) return;
diff --git a/deps/v8/src/objects/string-forwarding-table.h b/deps/v8/src/objects/string-forwarding-table.h
index a2c2093df7857d..f92120dd467321 100644
--- a/deps/v8/src/objects/string-forwarding-table.h
+++ b/deps/v8/src/objects/string-forwarding-table.h
@@ -32,8 +32,8 @@ class StringForwardingTable {
       kBitsPerInt - base::bits::CountLeadingZeros32(kInitialBlockSize) - 1;
   // Initial capacity in the block vector.
   static constexpr int kInitialBlockVectorCapacity = 4;
-  static constexpr Smi unused_element() { return Smi::FromInt(0); }
-  static constexpr Smi deleted_element() { return Smi::FromInt(1); }
+  static constexpr Tagged<Smi> unused_element() { return Smi::FromInt(0); }
+  static constexpr Tagged<Smi> deleted_element() { return Smi::FromInt(1); }
 
   explicit StringForwardingTable(Isolate* isolate);
   ~StringForwardingTable();
@@ -41,18 +41,19 @@ class StringForwardingTable {
   inline int size() const;
   inline bool empty() const;
   // Returns the index of the added record.
-  int AddForwardString(String string, String forward_to);
+  int AddForwardString(Tagged<String> string, Tagged<String> forward_to);
   template <typename T>
   EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-  int AddExternalResourceAndHash(String string, T* resource, uint32_t raw_hash);
-  void UpdateForwardString(int index, String forward_to);
+  int AddExternalResourceAndHash(Tagged<String> string, T* resource,
+                                 uint32_t raw_hash);
+  void UpdateForwardString(int index, Tagged<String> forward_to);
   // Returns true when the resource was set. When an external resource is
   // already set for the record, false is returned and the resource not stored.
   // The caller is responsible for disposing the resource.
   template <typename T>
   EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
   bool TryUpdateExternalResource(int index, T* resource);
-  String GetForwardString(PtrComprCageBase cage_base, int index) const;
+  Tagged<String> GetForwardString(PtrComprCageBase cage_base, int index) const;
   static Address GetForwardStringAddress(Isolate* isolate, int index);
   V8_EXPORT_PRIVATE uint32_t GetRawHash(PtrComprCageBase cage_base,
                                         int index) const;
diff --git a/deps/v8/src/objects/string-inl.h b/deps/v8/src/objects/string-inl.h
index 41bba35d8d0604..cf47e6fbda78f0 100644
--- a/deps/v8/src/objects/string-inl.h
+++ b/deps/v8/src/objects/string-inl.h
@@ -11,6 +11,7 @@
 #include "src/handles/handles-inl.h"
 #include "src/heap/factory.h"
 #include "src/numbers/hash-seed-inl.h"
+#include "src/objects/instance-type-inl.h"
 #include "src/objects/name-inl.h"
 #include "src/objects/smi-inl.h"
 #include "src/objects/string-table-inl.h"
@@ -19,6 +20,8 @@
 #include "src/sandbox/external-pointer.h"
 #include "src/strings/string-hasher-inl.h"
 #include "src/strings/unicode-inl.h"
+#include "src/torque/runtime-macro-shims.h"
+#include "src/torque/runtime-support.h"
 #include "src/utils/utils.h"
 
 // Has to be the last include (doesn't have include guards):
@@ -44,7 +47,7 @@ class V8_NODISCARD SharedStringAccessGuardIfNeeded {
   }
 
   // Slow version which gets the isolate from the String.
-  explicit SharedStringAccessGuardIfNeeded(String str) {
+  explicit SharedStringAccessGuardIfNeeded(Tagged<String> str) {
     Isolate* isolate = GetIsolateIfNeeded(str);
     if (isolate != nullptr) {
       mutex_guard.emplace(isolate->internalized_string_access());
@@ -55,11 +58,11 @@ class V8_NODISCARD SharedStringAccessGuardIfNeeded {
     return SharedStringAccessGuardIfNeeded();
   }
 
-  static bool IsNeeded(String str, LocalIsolate* local_isolate) {
+  static bool IsNeeded(Tagged<String> str, LocalIsolate* local_isolate) {
     return IsNeeded(local_isolate) && IsNeeded(str, false);
   }
 
-  static bool IsNeeded(String str, bool check_local_heap = true) {
+  static bool IsNeeded(Tagged<String> str, bool check_local_heap = true) {
     if (check_local_heap) {
       LocalHeap* local_heap = LocalHeap::Current();
       if (!local_heap || local_heap->is_main_thread()) {
@@ -91,7 +94,7 @@ class V8_NODISCARD SharedStringAccessGuardIfNeeded {
   }
 
   // Returns the Isolate from the String if we need it for the lock.
-  static Isolate* GetIsolateIfNeeded(String str) {
+  static Isolate* GetIsolateIfNeeded(Tagged<String> str) {
     if (!IsNeeded(str)) return nullptr;
 
     Isolate* isolate;
@@ -128,19 +131,21 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(ExternalString)
 TQ_OBJECT_CONSTRUCTORS_IMPL(ExternalOneByteString)
 TQ_OBJECT_CONSTRUCTORS_IMPL(ExternalTwoByteString)
 
-StringShape::StringShape(const String str)
-    : type_(str.map(kAcquireLoad).instance_type()) {
+static_assert(kTaggedCanConvertToRawObjects);
+
+StringShape::StringShape(const Tagged<String> str)
+    : type_(str->map(kAcquireLoad)->instance_type()) {
   set_valid();
   DCHECK_EQ(type_ & kIsNotStringMask, kStringTag);
 }
 
-StringShape::StringShape(const String str, PtrComprCageBase cage_base)
-    : type_(str.map(cage_base, kAcquireLoad).instance_type()) {
+StringShape::StringShape(const Tagged<String> str, PtrComprCageBase cage_base)
+    : type_(str->map(cage_base, kAcquireLoad)->instance_type()) {
   set_valid();
   DCHECK_EQ(type_ & kIsNotStringMask, kStringTag);
 }
 
-StringShape::StringShape(Map map) : type_(map.instance_type()) {
+StringShape::StringShape(Tagged<Map> map) : type_(map->instance_type()) {
   set_valid();
   DCHECK_EQ(type_ & kIsNotStringMask, kStringTag);
 }
@@ -262,7 +267,8 @@ inline TResult StringShape::DispatchToSpecificTypeWithoutCast(TArgs&&... args) {
     case kSlicedStringTag | kOneByteStringTag:
     case kSlicedStringTag | kTwoByteStringTag:
       return TDispatcher::HandleSlicedString(std::forward<TArgs>(args)...);
-    case kThinStringTag:
+    case kThinStringTag | kOneByteStringTag:
+    case kThinStringTag | kTwoByteStringTag:
       return TDispatcher::HandleThinString(std::forward<TArgs>(args)...);
     default:
       return TDispatcher::HandleInvalidString(std::forward<TArgs>(args)...);
@@ -280,7 +286,7 @@ inline TResult StringShape::DispatchToSpecificTypeWithoutCast(TArgs&&... args) {
   V(ThinString)
 
 template <typename TDispatcher, typename TResult, typename... TArgs>
-inline TResult StringShape::DispatchToSpecificType(String str,
+inline TResult StringShape::DispatchToSpecificType(Tagged<String> str,
                                                    TArgs&&... args) {
   class CastingDispatcher : public AllStatic {
    public:
@@ -291,7 +297,8 @@ inline TResult StringShape::DispatchToSpecificType(String str,
   }
     STRING_CLASS_TYPES(DEFINE_METHOD)
 #undef DEFINE_METHOD
-    static inline TResult HandleInvalidString(String str, TArgs&&... args) {
+    static inline TResult HandleInvalidString(Tagged<String> str,
+                                              TArgs&&... args) {
       return TDispatcher::HandleInvalidString(str,
                                               std::forward<TArgs>(args)...);
     }
@@ -302,31 +309,29 @@ inline TResult StringShape::DispatchToSpecificType(String str,
 }
 
 DEF_GETTER(String, IsOneByteRepresentation, bool) {
-  String string = IsThinString() ? ThinString::cast(*this).actual() : *this;
-  uint32_t type = string.map(cage_base).instance_type();
+  uint32_t type = map(cage_base)->instance_type();
   return (type & kStringEncodingMask) == kOneByteStringTag;
 }
 
 DEF_GETTER(String, IsTwoByteRepresentation, bool) {
-  String string = IsThinString() ? ThinString::cast(*this).actual() : *this;
-  uint32_t type = string.map(cage_base).instance_type();
+  uint32_t type = map(cage_base)->instance_type();
   return (type & kStringEncodingMask) == kTwoByteStringTag;
 }
 
 // static
-bool String::IsOneByteRepresentationUnderneath(String string) {
+bool String::IsOneByteRepresentationUnderneath(Tagged<String> string) {
   while (true) {
-    uint32_t type = string.map().instance_type();
+    uint32_t type = string->map()->instance_type();
     static_assert(kIsIndirectStringTag != 0);
     static_assert((kIsIndirectStringMask & kStringEncodingMask) == 0);
-    DCHECK(string.IsFlat());
+    DCHECK(string->IsFlat());
     switch (type & (kIsIndirectStringMask | kStringEncodingMask)) {
       case kOneByteStringTag:
         return true;
       case kTwoByteStringTag:
         return false;
       default:  // Cons, sliced, thin, strings need to go deeper.
-        string = string.GetUnderlying();
+        string = string->GetUnderlying();
     }
   }
 }
@@ -353,21 +358,21 @@ Char FlatStringReader::Get(int index) const {
 template <typename Char>
 class SequentialStringKey final : public StringTableKey {
  public:
-  SequentialStringKey(const base::Vector<const Char>& chars, uint64_t seed,
+  SequentialStringKey(base::Vector<const Char> chars, uint64_t seed,
                       bool convert = false)
       : SequentialStringKey(StringHasher::HashSequentialString<Char>(
                                 chars.begin(), chars.length(), seed),
                             chars, convert) {}
 
-  SequentialStringKey(int raw_hash_field, const base::Vector<const Char>& chars,
+  SequentialStringKey(int raw_hash_field, base::Vector<const Char> chars,
                       bool convert = false)
       : StringTableKey(raw_hash_field, chars.length()),
         chars_(chars),
         convert_(convert) {}
 
   template <typename IsolateT>
-  bool IsMatch(IsolateT* isolate, String s) {
-    return s.IsEqualTo<String::EqualityType::kNoLengthCheck>(chars_, isolate);
+  bool IsMatch(IsolateT* isolate, Tagged<String> s) {
+    return s->IsEqualTo<String::EqualityType::kNoLengthCheck>(chars_, isolate);
   }
 
   template <typename IsolateT>
@@ -425,18 +430,18 @@ class SeqSubStringKey final : public StringTableKey {
 
     DCHECK_LE(0, length());
     DCHECK_LE(from_ + length(), string_->length());
-    DCHECK_EQ(string_->IsSeqOneByteString(), sizeof(Char) == 1);
-    DCHECK_EQ(string_->IsSeqTwoByteString(), sizeof(Char) == 2);
+    DCHECK_EQ(IsSeqOneByteString(*string_), sizeof(Char) == 1);
+    DCHECK_EQ(IsSeqTwoByteString(*string_), sizeof(Char) == 2);
   }
 #if defined(V8_CC_MSVC)
 #pragma warning(pop)
 #endif
 
-  bool IsMatch(Isolate* isolate, String string) {
+  bool IsMatch(Isolate* isolate, Tagged<String> string) {
     DCHECK(!SharedStringAccessGuardIfNeeded::IsNeeded(string));
     DCHECK(!SharedStringAccessGuardIfNeeded::IsNeeded(*string_));
     DisallowGarbageCollection no_gc;
-    return string.IsEqualTo<String::EqualityType::kNoLengthCheck>(
+    return string->IsEqualTo<String::EqualityType::kNoLengthCheck>(
         base::Vector<const Char>(string_->GetChars(no_gc) + from_, length()),
         isolate);
   }
@@ -476,9 +481,9 @@ class SeqSubStringKey final : public StringTableKey {
 using SeqOneByteSubStringKey = SeqSubStringKey<SeqOneByteString>;
 using SeqTwoByteSubStringKey = SeqSubStringKey<SeqTwoByteString>;
 
-bool String::Equals(String other) const {
+bool String::Equals(Tagged<String> other) const {
   if (other == *this) return true;
-  if (this->IsInternalizedString() && other.IsInternalizedString()) {
+  if (IsInternalizedString(*this) && IsInternalizedString(other)) {
     return false;
   }
   return SlowEquals(other);
@@ -487,7 +492,7 @@ bool String::Equals(String other) const {
 // static
 bool String::Equals(Isolate* isolate, Handle<String> one, Handle<String> two) {
   if (one.is_identical_to(two)) return true;
-  if (one->IsInternalizedString() && two->IsInternalizedString()) {
+  if (IsInternalizedString(*one) && IsInternalizedString(*two)) {
     return false;
   }
   return SlowEquals(isolate, one, two);
@@ -534,37 +539,37 @@ bool String::IsEqualToImpl(
   DisallowGarbageCollection no_gc;
 
   int slice_offset = 0;
-  String string = *this;
+  Tagged<String> string = *this;
   const Char* data = str.data();
   while (true) {
-    int32_t type = string.map(cage_base).instance_type();
+    int32_t type = string->map(cage_base)->instance_type();
     switch (type & kStringRepresentationAndEncodingMask) {
       case kSeqOneByteStringTag:
         return CompareCharsEqual(
-            SeqOneByteString::cast(string).GetChars(no_gc, access_guard) +
+            SeqOneByteString::cast(string)->GetChars(no_gc, access_guard) +
                 slice_offset,
             data, len);
       case kSeqTwoByteStringTag:
         return CompareCharsEqual(
-            SeqTwoByteString::cast(string).GetChars(no_gc, access_guard) +
+            SeqTwoByteString::cast(string)->GetChars(no_gc, access_guard) +
                 slice_offset,
             data, len);
       case kExternalOneByteStringTag:
         return CompareCharsEqual(
-            ExternalOneByteString::cast(string).GetChars(cage_base) +
+            ExternalOneByteString::cast(string)->GetChars(cage_base) +
                 slice_offset,
             data, len);
       case kExternalTwoByteStringTag:
         return CompareCharsEqual(
-            ExternalTwoByteString::cast(string).GetChars(cage_base) +
+            ExternalTwoByteString::cast(string)->GetChars(cage_base) +
                 slice_offset,
             data, len);
 
       case kSlicedStringTag | kOneByteStringTag:
       case kSlicedStringTag | kTwoByteStringTag: {
-        SlicedString slicedString = SlicedString::cast(string);
-        slice_offset += slicedString.offset();
-        string = slicedString.parent(cage_base);
+        Tagged<SlicedString> slicedString = SlicedString::cast(string);
+        slice_offset += slicedString->offset();
+        string = slicedString->parent(cage_base);
         continue;
       }
 
@@ -579,8 +584,9 @@ bool String::IsEqualToImpl(
                                              cage_base, access_guard);
       }
 
-      case kThinStringTag:
-        string = ThinString::cast(string).actual(cage_base);
+      case kThinStringTag | kOneByteStringTag:
+      case kThinStringTag | kTwoByteStringTag:
+        string = ThinString::cast(string)->actual(cage_base);
         continue;
 
       default:
@@ -592,26 +598,27 @@ bool String::IsEqualToImpl(
 // static
 template <typename Char>
 bool String::IsConsStringEqualToImpl(
-    ConsString string, base::Vector<const Char> str, PtrComprCageBase cage_base,
+    Tagged<ConsString> string, base::Vector<const Char> str,
+    PtrComprCageBase cage_base,
     const SharedStringAccessGuardIfNeeded& access_guard) {
   // Already checked the len in IsEqualToImpl. Check GE rather than EQ in case
   // this is a prefix check.
-  DCHECK_GE(string.length(), str.size());
+  DCHECK_GE(string->length(), str.size());
 
   ConsStringIterator iter(ConsString::cast(string));
   base::Vector<const Char> remaining_str = str;
   int offset;
-  for (String segment = iter.Next(&offset); !segment.is_null();
+  for (Tagged<String> segment = iter.Next(&offset); !segment.is_null();
        segment = iter.Next(&offset)) {
     // We create the iterator without an offset, so we should never have a
     // per-segment offset.
     DCHECK_EQ(offset, 0);
     // Compare the individual segment against the appropriate subvector of the
     // remaining string.
-    size_t len = std::min<size_t>(segment.length(), remaining_str.size());
+    size_t len = std::min<size_t>(segment->length(), remaining_str.size());
     base::Vector<const Char> sub_str = remaining_str.SubVector(0, len);
-    if (!segment.IsEqualToImpl<EqualityType::kNoLengthCheck>(sub_str, cage_base,
-                                                             access_guard)) {
+    if (!segment->IsEqualToImpl<EqualityType::kNoLengthCheck>(
+            sub_str, cage_base, access_guard)) {
       return false;
     }
     remaining_str += len;
@@ -642,9 +649,10 @@ const Char* String::GetDirectStringChars(
     const SharedStringAccessGuardIfNeeded& access_guard) const {
   DCHECK(StringShape(*this).IsDirect());
   return StringShape(*this, cage_base).IsExternal()
-             ? CharTraits<Char>::ExternalString::cast(*this).GetChars(cage_base)
-             : CharTraits<Char>::String::cast(*this).GetChars(no_gc,
-                                                              access_guard);
+             ? CharTraits<Char>::ExternalString::cast(*this)->GetChars(
+                   cage_base)
+             : CharTraits<Char>::String::cast(*this)->GetChars(no_gc,
+                                                               access_guard);
 }
 
 // static
@@ -652,26 +660,26 @@ Handle<String> String::Flatten(Isolate* isolate, Handle<String> string,
                                AllocationType allocation) {
   DisallowGarbageCollection no_gc;  // Unhandlified code.
   PtrComprCageBase cage_base(isolate);
-  String s = *string;
+  Tagged<String> s = *string;
   StringShape shape(s, cage_base);
 
   // Shortcut already-flat strings.
   if (V8_LIKELY(shape.IsDirect())) return string;
 
   if (shape.IsCons()) {
-    DCHECK(!s.InSharedHeap());
-    ConsString cons = ConsString::cast(s);
-    if (!cons.IsFlat(isolate)) {
+    DCHECK(!Object::InSharedHeap(s));
+    Tagged<ConsString> cons = ConsString::cast(s);
+    if (!cons->IsFlat(isolate)) {
       AllowGarbageCollection yes_gc;
       return SlowFlatten(isolate, handle(cons, isolate), allocation);
     }
-    s = cons.first(cage_base);
+    s = cons->first(cage_base);
     shape = StringShape(s, cage_base);
   }
 
   if (shape.IsThin()) {
-    s = ThinString::cast(s).actual(cage_base);
-    DCHECK(!s.IsConsString());
+    s = ThinString::cast(s)->actual(cage_base);
+    DCHECK(!IsConsString(s));
   }
 
   return handle(s, isolate);
@@ -688,27 +696,29 @@ Handle<String> String::Flatten(LocalIsolate* isolate, Handle<String> string,
 // static
 base::Optional<String::FlatContent> String::TryGetFlatContentFromDirectString(
     PtrComprCageBase cage_base, const DisallowGarbageCollection& no_gc,
-    String string, int offset, int length,
+    Tagged<String> string, int offset, int length,
     const SharedStringAccessGuardIfNeeded& access_guard) {
   DCHECK_GE(offset, 0);
   DCHECK_GE(length, 0);
-  DCHECK_LE(offset + length, string.length());
+  DCHECK_LE(offset + length, string->length());
   switch (StringShape{string, cage_base}.representation_and_encoding_tag()) {
     case kSeqOneByteStringTag:
       return FlatContent(
-          SeqOneByteString::cast(string).GetChars(no_gc, access_guard) + offset,
+          SeqOneByteString::cast(string)->GetChars(no_gc, access_guard) +
+              offset,
           length, no_gc);
     case kSeqTwoByteStringTag:
       return FlatContent(
-          SeqTwoByteString::cast(string).GetChars(no_gc, access_guard) + offset,
+          SeqTwoByteString::cast(string)->GetChars(no_gc, access_guard) +
+              offset,
           length, no_gc);
     case kExternalOneByteStringTag:
       return FlatContent(
-          ExternalOneByteString::cast(string).GetChars(cage_base) + offset,
+          ExternalOneByteString::cast(string)->GetChars(cage_base) + offset,
           length, no_gc);
     case kExternalTwoByteStringTag:
       return FlatContent(
-          ExternalTwoByteString::cast(string).GetChars(cage_base) + offset,
+          ExternalTwoByteString::cast(string)->GetChars(cage_base) + offset,
           length, no_gc);
     default:
       return {};
@@ -718,19 +728,6 @@ base::Optional<String::FlatContent> String::TryGetFlatContentFromDirectString(
 
 String::FlatContent String::GetFlatContent(
     const DisallowGarbageCollection& no_gc) {
-#if DEBUG
-  // Check that this method is called only from the main thread.
-  {
-    Isolate* isolate;
-    // We don't have to check read only strings as those won't move.
-    //
-    // TODO(v8:12007): Currently character data is never overwritten for
-    // shared strings.
-    DCHECK_IMPLIES(GetIsolateFromHeapObject(*this, &isolate) && !InSharedHeap(),
-                   ThreadId::Current() == isolate->thread_id());
-  }
-#endif
-
   return GetFlatContent(no_gc, SharedStringAccessGuardIfNeeded::NotNeeded());
 }
 
@@ -799,7 +796,7 @@ Handle<String> String::Share(Isolate* isolate, Handle<String> string) {
     case StringTransitionStrategy::kInPlace:
       // A relaxed write is sufficient here, because at this point the string
       // has not yet escaped the current thread.
-      DCHECK(string->InSharedHeap());
+      DCHECK(Object::InSharedHeap(*string));
       string->set_map_no_write_barrier(*new_map.ToHandleChecked());
       return string;
     case StringTransitionStrategy::kAlreadyTransitioned:
@@ -840,18 +837,18 @@ uint16_t String::GetImpl(
   static inline uint16_t Handle##Type(                       \
       Type str, int index, PtrComprCageBase cage_base,       \
       const SharedStringAccessGuardIfNeeded& access_guard) { \
-    return str.Get(index, cage_base, access_guard);          \
+    return str->Get(index, cage_base, access_guard);         \
   }
     STRING_CLASS_TYPES(DEFINE_METHOD)
 #undef DEFINE_METHOD
     static inline uint16_t HandleInvalidString(
-        String str, int index, PtrComprCageBase cage_base,
+        Tagged<String> str, int index, PtrComprCageBase cage_base,
         const SharedStringAccessGuardIfNeeded& access_guard) {
       UNREACHABLE();
     }
   };
 
-  return StringShape(*this)
+  return StringShape(Tagged<String>(*this))
       .DispatchToSpecificType<StringGetDispatcher, uint16_t>(
           *this, index, cage_base, access_guard);
 }
@@ -861,26 +858,26 @@ void String::Set(int index, uint16_t value) {
   DCHECK(StringShape(*this).IsSequential());
 
   return IsOneByteRepresentation()
-             ? SeqOneByteString::cast(*this).SeqOneByteStringSet(index, value)
-             : SeqTwoByteString::cast(*this).SeqTwoByteStringSet(index, value);
+             ? SeqOneByteString::cast(*this)->SeqOneByteStringSet(index, value)
+             : SeqTwoByteString::cast(*this)->SeqTwoByteStringSet(index, value);
 }
 
 bool String::IsFlat() const { return IsFlat(GetPtrComprCageBase(*this)); }
 
 bool String::IsFlat(PtrComprCageBase cage_base) const {
   if (!StringShape(*this, cage_base).IsCons()) return true;
-  return ConsString::cast(*this).IsFlat(cage_base);
+  return ConsString::cast(*this)->IsFlat(cage_base);
 }
 
 bool String::IsShared() const { return IsShared(GetPtrComprCageBase(*this)); }
 
 bool String::IsShared(PtrComprCageBase cage_base) const {
   const bool result = StringShape(*this, cage_base).IsShared();
-  DCHECK_IMPLIES(result, InSharedHeap());
+  DCHECK_IMPLIES(result, Object::InSharedHeap(*this));
   return result;
 }
 
-String String::GetUnderlying() const {
+Tagged<String> String::GetUnderlying() const {
   // Giving direct access to underlying string only makes sense if the
   // wrapping string is already flattened.
   DCHECK(IsFlat());
@@ -894,20 +891,20 @@ String String::GetUnderlying() const {
 }
 
 template <class Visitor>
-ConsString String::VisitFlat(Visitor* visitor, String string,
-                             const int offset) {
+Tagged<ConsString> String::VisitFlat(Visitor* visitor, Tagged<String> string,
+                                     const int offset) {
   DCHECK(!SharedStringAccessGuardIfNeeded::IsNeeded(string));
   return VisitFlat(visitor, string, offset,
                    SharedStringAccessGuardIfNeeded::NotNeeded());
 }
 
 template <class Visitor>
-ConsString String::VisitFlat(
-    Visitor* visitor, String string, const int offset,
+Tagged<ConsString> String::VisitFlat(
+    Visitor* visitor, Tagged<String> string, const int offset,
     const SharedStringAccessGuardIfNeeded& access_guard) {
   DisallowGarbageCollection no_gc;
   int slice_offset = offset;
-  const int length = string.length();
+  const int length = string->length();
   DCHECK(offset <= length);
   PtrComprCageBase cage_base = GetPtrComprCageBase(string);
   while (true) {
@@ -916,37 +913,37 @@ ConsString String::VisitFlat(
     switch (tag) {
       case kSeqOneByteStringTag:
         visitor->VisitOneByteString(
-            SeqOneByteString::cast(string).GetChars(no_gc, access_guard) +
+            SeqOneByteString::cast(string)->GetChars(no_gc, access_guard) +
                 slice_offset,
             length - offset);
         return ConsString();
 
       case kSeqTwoByteStringTag:
         visitor->VisitTwoByteString(
-            SeqTwoByteString::cast(string).GetChars(no_gc, access_guard) +
+            SeqTwoByteString::cast(string)->GetChars(no_gc, access_guard) +
                 slice_offset,
             length - offset);
         return ConsString();
 
       case kExternalOneByteStringTag:
         visitor->VisitOneByteString(
-            ExternalOneByteString::cast(string).GetChars(cage_base) +
+            ExternalOneByteString::cast(string)->GetChars(cage_base) +
                 slice_offset,
             length - offset);
         return ConsString();
 
       case kExternalTwoByteStringTag:
         visitor->VisitTwoByteString(
-            ExternalTwoByteString::cast(string).GetChars(cage_base) +
+            ExternalTwoByteString::cast(string)->GetChars(cage_base) +
                 slice_offset,
             length - offset);
         return ConsString();
 
       case kSlicedStringTag | kOneByteStringTag:
       case kSlicedStringTag | kTwoByteStringTag: {
-        SlicedString slicedString = SlicedString::cast(string);
-        slice_offset += slicedString.offset();
-        string = slicedString.parent(cage_base);
+        Tagged<SlicedString> slicedString = SlicedString::cast(string);
+        slice_offset += slicedString->offset();
+        string = slicedString->parent(cage_base);
         continue;
       }
 
@@ -954,8 +951,9 @@ ConsString String::VisitFlat(
       case kConsStringTag | kTwoByteStringTag:
         return ConsString::cast(string);
 
-      case kThinStringTag:
-        string = ThinString::cast(string).actual(cage_base);
+      case kThinStringTag | kOneByteStringTag:
+      case kThinStringTag | kTwoByteStringTag:
+        string = ThinString::cast(string)->actual(cage_base);
         continue;
 
       default:
@@ -967,14 +965,6 @@ ConsString String::VisitFlat(
 bool String::IsWellFormedUnicode(Isolate* isolate, Handle<String> string) {
   // One-byte strings are definitionally well formed and cannot have unpaired
   // surrogates.
-  //
-  // Note that an indirect string's 1-byte flag can differ from their underlying
-  // string's 1-byte flag, because the underlying string may have been
-  // externalized from 1-byte to 2-byte. That is, the 1-byte flag is the
-  // 1-byteness at time of creation. However, this is sufficient to determine
-  // well-formedness. String::MakeExternal requires that the external resource's
-  // content is equal to the original string's content, even if 1-byteness
-  // differs.
   if (string->IsOneByteRepresentation()) return true;
 
   // TODO(v8:13557): The two-byte case can be optimized by extending the
@@ -1016,14 +1006,15 @@ uint8_t SeqOneByteString::Get(
     const SharedStringAccessGuardIfNeeded& access_guard) const {
   USE(access_guard);
   DCHECK(index >= 0 && index < length());
-  return ReadField<byte>(kHeaderSize + index * kCharSize);
+  return ReadField<uint8_t>(kHeaderSize + index * kCharSize);
 }
 
 void SeqOneByteString::SeqOneByteStringSet(int index, uint16_t value) {
   DCHECK_GE(index, 0);
   DCHECK_LT(index, length());
   DCHECK_LE(value, kMaxOneByteCharCode);
-  WriteField<byte>(kHeaderSize + index * kCharSize, static_cast<byte>(value));
+  WriteField<uint8_t>(kHeaderSize + index * kCharSize,
+                      static_cast<uint8_t>(value));
 }
 
 void SeqOneByteString::SeqOneByteStringSetChars(int index,
@@ -1097,39 +1088,40 @@ inline int SeqTwoByteString::AllocatedSize() {
 }
 
 // static
-bool SeqOneByteString::IsCompatibleMap(Map map, ReadOnlyRoots roots) {
-  return map == roots.one_byte_string_map() ||
-         map == roots.shared_one_byte_string_map();
+bool SeqOneByteString::IsCompatibleMap(Tagged<Map> map, ReadOnlyRoots roots) {
+  return map == roots.seq_one_byte_string_map() ||
+         map == roots.shared_seq_one_byte_string_map();
 }
 
 // static
-bool SeqTwoByteString::IsCompatibleMap(Map map, ReadOnlyRoots roots) {
-  return map == roots.string_map() || map == roots.shared_string_map();
+bool SeqTwoByteString::IsCompatibleMap(Tagged<Map> map, ReadOnlyRoots roots) {
+  return map == roots.seq_two_byte_string_map() ||
+         map == roots.shared_seq_two_byte_string_map();
 }
 
-void SlicedString::set_parent(String parent, WriteBarrierMode mode) {
-  DCHECK(parent.IsSeqString() || parent.IsExternalString());
+void SlicedString::set_parent(Tagged<String> parent, WriteBarrierMode mode) {
+  DCHECK(IsSeqString(parent) || IsExternalString(parent));
   TorqueGeneratedSlicedString<SlicedString, Super>::set_parent(parent, mode);
 }
 
-Object ConsString::unchecked_first() const {
+Tagged<Object> ConsString::unchecked_first() const {
   return TaggedField<Object, kFirstOffset>::load(*this);
 }
 
-Object ConsString::unchecked_second() const {
+Tagged<Object> ConsString::unchecked_second() const {
   return RELAXED_READ_FIELD(*this, kSecondOffset);
 }
 
 bool ConsString::IsFlat(PtrComprCageBase cage_base) const {
-  return second(cage_base).length() == 0;
+  return second(cage_base)->length() == 0;
 }
 
-DEF_GETTER(ThinString, unchecked_actual, HeapObject) {
+DEF_GETTER(ThinString, unchecked_actual, Tagged<HeapObject>) {
   return TaggedField<HeapObject, kActualOffset>::load(cage_base, *this);
 }
 
 bool ExternalString::is_uncached() const {
-  InstanceType type = map().instance_type();
+  InstanceType type = map()->instance_type();
   return (type & kUncachedExternalStringMask) == kUncachedExternalStringTag;
 }
 
@@ -1159,10 +1151,10 @@ DEF_GETTER(ExternalString, resource_as_address, Address) {
 void ExternalString::set_address_as_resource(Isolate* isolate, Address value) {
   WriteExternalPointerField<kExternalStringResourceTag>(kResourceOffset,
                                                         isolate, value);
-  if (IsExternalOneByteString()) {
-    ExternalOneByteString::cast(*this).update_data_cache(isolate);
+  if (IsExternalOneByteString(*this)) {
+    ExternalOneByteString::cast(*this)->update_data_cache(isolate);
   } else {
-    ExternalTwoByteString::cast(*this).update_data_cache(isolate);
+    ExternalTwoByteString::cast(*this)->update_data_cache(isolate);
   }
 }
 
@@ -1340,11 +1332,11 @@ const uint16_t* ExternalTwoByteString::ExternalTwoByteStringGetData(
 
 int ConsStringIterator::OffsetForDepth(int depth) { return depth & kDepthMask; }
 
-void ConsStringIterator::PushLeft(ConsString string) {
+void ConsStringIterator::PushLeft(Tagged<ConsString> string) {
   frames_[depth_++ & kDepthMask] = string;
 }
 
-void ConsStringIterator::PushRight(ConsString string) {
+void ConsStringIterator::PushRight(Tagged<ConsString> string) {
   // Inplace update.
   frames_[(depth_ - 1) & kDepthMask] = string;
 }
@@ -1361,12 +1353,12 @@ void ConsStringIterator::Pop() {
 
 class StringCharacterStream {
  public:
-  inline explicit StringCharacterStream(String string, int offset = 0);
+  inline explicit StringCharacterStream(Tagged<String> string, int offset = 0);
   StringCharacterStream(const StringCharacterStream&) = delete;
   StringCharacterStream& operator=(const StringCharacterStream&) = delete;
   inline uint16_t GetNext();
   inline bool HasMore();
-  inline void Reset(String string, int offset = 0);
+  inline void Reset(Tagged<String> string, int offset = 0);
   inline void VisitOneByteString(const uint8_t* chars, int length);
   inline void VisitTwoByteString(const uint16_t* chars, int length);
 
@@ -1392,16 +1384,16 @@ uint16_t StringCharacterStream::GetNext() {
 // TODO(solanes, v8:7790, chromium:1166095): Assess if we need to use
 // Isolate/LocalIsolate and pipe them through, instead of using the slow
 // version of the SharedStringAccessGuardIfNeeded.
-StringCharacterStream::StringCharacterStream(String string, int offset)
+StringCharacterStream::StringCharacterStream(Tagged<String> string, int offset)
     : is_one_byte_(false), access_guard_(string) {
   Reset(string, offset);
 }
 
-void StringCharacterStream::Reset(String string, int offset) {
+void StringCharacterStream::Reset(Tagged<String> string, int offset) {
   buffer8_ = nullptr;
   end_ = nullptr;
 
-  ConsString cons_string =
+  Tagged<ConsString> cons_string =
       String::VisitFlat(this, string, offset, access_guard_);
   iter_.Reset(cons_string, offset);
   if (!cons_string.is_null()) {
@@ -1414,7 +1406,7 @@ void StringCharacterStream::Reset(String string, int offset) {
 bool StringCharacterStream::HasMore() {
   if (buffer8_ != end_) return true;
   int offset;
-  String string = iter_.Next(&offset);
+  Tagged<String> string = iter_.Next(&offset);
   DCHECK_EQ(offset, 0);
   if (string.is_null()) return false;
   String::VisitFlat(this, string, 0, access_guard_);
@@ -1461,12 +1453,12 @@ bool String::AsIntegerIndex(size_t* index) {
   return SlowAsIntegerIndex(index);
 }
 
-SubStringRange::SubStringRange(String string,
+SubStringRange::SubStringRange(Tagged<String> string,
                                const DisallowGarbageCollection& no_gc,
                                int first, int length)
     : string_(string),
       first_(first),
-      length_(length == -1 ? string.length() : length),
+      length_(length == -1 ? string->length() : length),
       no_gc_(no_gc) {}
 
 class SubStringRange::iterator final {
@@ -1495,8 +1487,9 @@ class SubStringRange::iterator final {
  private:
   friend class String;
   friend class SubStringRange;
-  iterator(String from, int offset, const DisallowGarbageCollection& no_gc)
-      : content_(from.GetFlatContent(no_gc)), offset_(offset) {}
+  iterator(Tagged<String> from, int offset,
+           const DisallowGarbageCollection& no_gc)
+      : content_(from->GetFlatContent(no_gc)), offset_(offset) {}
   String::FlatContent content_;
   int offset_;
 };
@@ -1526,20 +1519,20 @@ void SeqTwoByteString::clear_padding_destructively(int length) {
 }
 
 // static
-bool String::IsInPlaceInternalizable(String string) {
-  return IsInPlaceInternalizable(string.map().instance_type());
+bool String::IsInPlaceInternalizable(Tagged<String> string) {
+  return IsInPlaceInternalizable(string->map()->instance_type());
 }
 
 // static
 bool String::IsInPlaceInternalizable(InstanceType instance_type) {
   switch (instance_type) {
-    case STRING_TYPE:
-    case ONE_BYTE_STRING_TYPE:
-    case SHARED_STRING_TYPE:
-    case SHARED_ONE_BYTE_STRING_TYPE:
-    case EXTERNAL_STRING_TYPE:
+    case SEQ_TWO_BYTE_STRING_TYPE:
+    case SEQ_ONE_BYTE_STRING_TYPE:
+    case SHARED_SEQ_TWO_BYTE_STRING_TYPE:
+    case SHARED_SEQ_ONE_BYTE_STRING_TYPE:
+    case EXTERNAL_TWO_BYTE_STRING_TYPE:
     case EXTERNAL_ONE_BYTE_STRING_TYPE:
-    case SHARED_EXTERNAL_STRING_TYPE:
+    case SHARED_EXTERNAL_TWO_BYTE_STRING_TYPE:
     case SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE:
       return true;
     default:
diff --git a/deps/v8/src/objects/string-set-inl.h b/deps/v8/src/objects/string-set-inl.h
index ff35fe085aac61..088675c9b785a5 100644
--- a/deps/v8/src/objects/string-set-inl.h
+++ b/deps/v8/src/objects/string-set-inl.h
@@ -17,20 +17,21 @@ namespace internal {
 CAST_ACCESSOR(StringSet)
 
 StringSet::StringSet(Address ptr) : HashTable<StringSet, StringSetShape>(ptr) {
-  SLOW_DCHECK(IsStringSet());
+  SLOW_DCHECK(IsStringSet(*this));
 }
 
-bool StringSetShape::IsMatch(String key, Object value) {
-  DCHECK(value.IsString());
-  return key.Equals(String::cast(value));
+bool StringSetShape::IsMatch(Tagged<String> key, Tagged<Object> value) {
+  DCHECK(IsString(value));
+  return key->Equals(String::cast(value));
 }
 
-uint32_t StringSetShape::Hash(ReadOnlyRoots roots, String key) {
-  return key.EnsureHash();
+uint32_t StringSetShape::Hash(ReadOnlyRoots roots, Tagged<String> key) {
+  return key->EnsureHash();
 }
 
-uint32_t StringSetShape::HashForObject(ReadOnlyRoots roots, Object object) {
-  return String::cast(object).EnsureHash();
+uint32_t StringSetShape::HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object) {
+  return String::cast(object)->EnsureHash();
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/string-set.h b/deps/v8/src/objects/string-set.h
index a4d589f11cdfef..7edfa8fd39cefd 100644
--- a/deps/v8/src/objects/string-set.h
+++ b/deps/v8/src/objects/string-set.h
@@ -15,9 +15,10 @@ namespace internal {
 
 class StringSetShape : public BaseShape<String> {
  public:
-  static inline bool IsMatch(String key, Object value);
-  static inline uint32_t Hash(ReadOnlyRoots roots, String key);
-  static inline uint32_t HashForObject(ReadOnlyRoots roots, Object object);
+  static inline bool IsMatch(Tagged<String> key, Tagged<Object> value);
+  static inline uint32_t Hash(ReadOnlyRoots roots, Tagged<String> key);
+  static inline uint32_t HashForObject(ReadOnlyRoots roots,
+                                       Tagged<Object> object);
 
   static const int kPrefixSize = 0;
   static const int kEntrySize = 1;
diff --git a/deps/v8/src/objects/string-table.cc b/deps/v8/src/objects/string-table.cc
index bf0f9fceb3b016..83dc059d9925d0 100644
--- a/deps/v8/src/objects/string-table.cc
+++ b/deps/v8/src/objects/string-table.cc
@@ -71,8 +71,8 @@ int ComputeStringTableCapacityWithShrink(int current_capacity,
 
 template <typename IsolateT, typename StringTableKey>
 bool KeyIsMatch(IsolateT* isolate, StringTableKey* key, String string) {
-  if (string.hash() != key->hash()) return false;
-  if (string.length() != key->length()) return false;
+  if (string->hash() != key->hash()) return false;
+  if (string->length() != key->length()) return false;
   return key->IsMatch(isolate, string);
 }
 
@@ -238,7 +238,7 @@ std::unique_ptr<StringTable::Data> StringTable::Data::Resize(
     Object element = data->Get(cage_base, i);
     if (element == empty_element() || element == deleted_element()) continue;
     String string = String::cast(element);
-    uint32_t hash = string.hash();
+    uint32_t hash = string->hash();
     InternalIndex insertion_index =
         new_data->FindInsertionEntry(cage_base, hash);
     new_data->Set(insertion_index, string);
@@ -350,7 +350,7 @@ class InternalizedStringKey final : public StringTableKey {
     // internalized the key, in which case StringTable::LookupKey will perform a
     // redundant lookup and return the already internalized copy.
     DCHECK_IMPLIES(!v8_flags.shared_string_table,
-                   !string->IsInternalizedString());
+                   !IsInternalizedString(*string));
     DCHECK(string->IsFlat());
     DCHECK(String::IsHashFieldComputed(hash));
   }
@@ -426,7 +426,7 @@ class InternalizedStringKey final : public StringTableKey {
       // Migrations to thin are impossible, as we only call this method on table
       // misses inside the critical section.
       string_->set_map_safe_transition_no_write_barrier(*internalized_map);
-      DCHECK(string_->IsInternalizedString());
+      DCHECK(IsInternalizedString(*string_));
       return string_;
     }
     // We prepared an internalized copy for the string or the string was already
@@ -454,12 +454,12 @@ namespace {
 
 void SetInternalizedReference(Isolate* isolate, String string,
                               String internalized) {
-  DCHECK(!string.IsThinString());
-  DCHECK(!string.IsInternalizedString());
-  DCHECK(internalized.IsInternalizedString());
-  DCHECK(!internalized.HasInternalizedForwardingIndex(kAcquireLoad));
-  if (string.IsShared() || v8_flags.always_use_string_forwarding_table) {
-    uint32_t field = string.raw_hash_field(kAcquireLoad);
+  DCHECK(!IsThinString(string));
+  DCHECK(!IsInternalizedString(string));
+  DCHECK(IsInternalizedString(internalized));
+  DCHECK(!internalized->HasInternalizedForwardingIndex(kAcquireLoad));
+  if (string->IsShared() || v8_flags.always_use_string_forwarding_table) {
+    uint32_t field = string->raw_hash_field(kAcquireLoad);
     // Don't use the forwarding table for strings that have an integer index.
     // Using the hash field for the integer index is more beneficial than
     // using it to store the forwarding index to the internalized string.
@@ -479,18 +479,18 @@ void SetInternalizedReference(Isolate* isolate, String string,
                                                               internalized);
       // Update the forwarding index type to include internalized.
       field = Name::IsInternalizedForwardingIndexBit::update(field, true);
-      string.set_raw_hash_field(field, kReleaseStore);
+      string->set_raw_hash_field(field, kReleaseStore);
     } else {
       const int forwarding_index =
           isolate->string_forwarding_table()->AddForwardString(string,
                                                                internalized);
-      string.set_raw_hash_field(
+      string->set_raw_hash_field(
           String::CreateInternalizedForwardingIndex(forwarding_index),
           kReleaseStore);
     }
   } else {
-    DCHECK(!string.HasForwardingIndex(kAcquireLoad));
-    string.MakeThin(isolate, internalized);
+    DCHECK(!string->HasForwardingIndex(kAcquireLoad));
+    string->MakeThin(isolate, internalized);
   }
 }
 
@@ -527,7 +527,7 @@ Handle<String> StringTable::LookupString(Isolate* isolate,
   // For lookup hits, we use the StringForwardingTable for shared strings to
   // delay the transition into a ThinString to the next stop-the-world GC.
   Handle<String> result = String::Flatten(isolate, string);
-  if (!result->IsInternalizedString()) {
+  if (!IsInternalizedString(*result)) {
     uint32_t raw_hash_field = result->raw_hash_field(kAcquireLoad);
 
     if (String::IsInternalizedForwardingIndex(raw_hash_field)) {
@@ -544,7 +544,7 @@ Handle<String> StringTable::LookupString(Isolate* isolate,
       result = LookupKey(isolate, &key);
     }
   }
-  if (*string != *result && !string->IsThinString()) {
+  if (*string != *result && !IsThinString(*string)) {
     SetInternalizedReference(isolate, *string, *result);
   }
   return result;
@@ -599,7 +599,7 @@ Handle<String> StringTable::LookupKey(IsolateT* isolate, StringTableKey* key) {
   if (entry.is_found()) {
     Handle<String> result(String::cast(current_data->Get(isolate, entry)),
                           isolate);
-    DCHECK_IMPLIES(v8_flags.shared_string_table, result->InSharedHeap());
+    DCHECK_IMPLIES(v8_flags.shared_string_table, Object::InSharedHeap(*result));
     return result;
   }
 
@@ -712,14 +712,14 @@ Address StringTable::Data::TryStringToIndexOrLookupExisting(Isolate* isolate,
 
   DisallowGarbageCollection no_gc;
 
-  int length = string.length();
+  int length = string->length();
   // The source hash is usable if it is not from a sliced string.
   // For sliced strings we need to recalculate the hash from the given offset
   // with the correct length.
-  const bool is_source_hash_usable = start == 0 && length == source.length();
+  const bool is_source_hash_usable = start == 0 && length == source->length();
 
   // First check if the string constains a forwarding index.
-  uint32_t raw_hash_field = source.raw_hash_field(kAcquireLoad);
+  uint32_t raw_hash_field = source->raw_hash_field(kAcquireLoad);
   if (Name::IsInternalizedForwardingIndex(raw_hash_field) &&
       is_source_hash_usable) {
     const int index = Name::ForwardingIndexValueBits::decode(raw_hash_field);
@@ -734,8 +734,8 @@ Address StringTable::Data::TryStringToIndexOrLookupExisting(Isolate* isolate,
   const Char* chars;
 
   SharedStringAccessGuardIfNeeded access_guard(isolate);
-  if (source.IsConsString(isolate)) {
-    DCHECK(!source.IsFlat(isolate));
+  if (IsConsString(source, isolate)) {
+    DCHECK(!source->IsFlat(isolate));
     buffer.reset(new Char[length]);
     String::WriteToFlat(source, buffer.get(), 0, length, isolate, access_guard);
     chars = buffer.get();
@@ -778,7 +778,7 @@ Address StringTable::Data::TryStringToIndexOrLookupExisting(Isolate* isolate,
   // If we found and entry in the string table and string is not internalized,
   // there is no way that it can transition to internalized later on. So a last
   // check here is sufficient.
-  if (!string.IsInternalizedString()) {
+  if (!IsInternalizedString(string)) {
     SetInternalizedReference(isolate, string, internalized);
   } else {
     DCHECK(v8_flags.shared_string_table);
@@ -790,7 +790,7 @@ Address StringTable::Data::TryStringToIndexOrLookupExisting(Isolate* isolate,
 Address StringTable::TryStringToIndexOrLookupExisting(Isolate* isolate,
                                                       Address raw_string) {
   String string = String::cast(Object(raw_string));
-  if (string.IsInternalizedString()) {
+  if (IsInternalizedString(string)) {
     // string could be internalized, if the string table is shared and another
     // thread internalized it.
     DCHECK(v8_flags.shared_string_table);
@@ -806,21 +806,21 @@ Address StringTable::TryStringToIndexOrLookupExisting(Isolate* isolate,
 
   size_t start = 0;
   String source = string;
-  if (source.IsSlicedString()) {
+  if (IsSlicedString(source)) {
     SlicedString sliced = SlicedString::cast(source);
-    start = sliced.offset();
-    source = sliced.parent();
-  } else if (source.IsConsString() && source.IsFlat()) {
-    source = ConsString::cast(source).first();
-  }
-  if (source.IsThinString()) {
-    source = ThinString::cast(source).actual();
-    if (string.length() == source.length()) {
+    start = sliced->offset();
+    source = sliced->parent();
+  } else if (IsConsString(source) && source->IsFlat()) {
+    source = ConsString::cast(source)->first();
+  }
+  if (IsThinString(source)) {
+    source = ThinString::cast(source)->actual();
+    if (string->length() == source->length()) {
       return source.ptr();
     }
   }
 
-  if (source.IsOneByteRepresentation()) {
+  if (source->IsOneByteRepresentation()) {
     return StringTable::Data::TryStringToIndexOrLookupExisting<uint8_t>(
         isolate, string, source, start);
   }
diff --git a/deps/v8/src/objects/string-table.h b/deps/v8/src/objects/string-table.h
index 9c1f0d1a975c57..69998c1a3adc69 100644
--- a/deps/v8/src/objects/string-table.h
+++ b/deps/v8/src/objects/string-table.h
@@ -47,8 +47,8 @@ class SeqOneByteString;
 // StringTable::Data for details.
 class V8_EXPORT_PRIVATE StringTable {
  public:
-  static constexpr Smi empty_element() { return Smi::FromInt(0); }
-  static constexpr Smi deleted_element() { return Smi::FromInt(1); }
+  static constexpr Tagged<Smi> empty_element() { return Smi::FromInt(0); }
+  static constexpr Tagged<Smi> deleted_element() { return Smi::FromInt(1); }
 
   explicit StringTable(Isolate* isolate);
   ~StringTable();
diff --git a/deps/v8/src/objects/string.cc b/deps/v8/src/objects/string.cc
index e2f18a6e8495d8..0e8b6ffb721624 100644
--- a/deps/v8/src/objects/string.cc
+++ b/deps/v8/src/objects/string.cc
@@ -4,6 +4,7 @@
 
 #include "src/objects/string.h"
 
+#include "src/base/small-vector.h"
 #include "src/common/assert-scope.h"
 #include "src/common/globals.h"
 #include "src/execution/isolate-utils.h"
@@ -33,15 +34,15 @@ namespace internal {
 
 Handle<String> String::SlowFlatten(Isolate* isolate, Handle<ConsString> cons,
                                    AllocationType allocation) {
-  DCHECK_NE(cons->second().length(), 0);
-  DCHECK(!cons->InSharedHeap());
+  DCHECK_NE(cons->second()->length(), 0);
+  DCHECK(!Object::InSharedHeap(*cons));
 
   // TurboFan can create cons strings with empty first parts.
-  while (cons->first().length() == 0) {
+  while (cons->first()->length() == 0) {
     // We do not want to call this function recursively. Therefore we call
     // String::Flatten only in those cases where String::SlowFlatten is not
     // called again.
-    if (cons->second().IsConsString() && !cons->second().IsFlat()) {
+    if (IsConsString(cons->second()) && !cons->second()->IsFlat()) {
       cons = handle(ConsString::cast(cons->second()), isolate);
     } else {
       return String::Flatten(isolate, handle(cons->second(), isolate),
@@ -65,8 +66,8 @@ Handle<String> String::SlowFlatten(Isolate* isolate, Handle<ConsString> cons,
     // transitioned to a ThinString (and eventually shortcutted to
     // InternalizedString) during GC.
     if (V8_UNLIKELY(v8_flags.always_use_string_forwarding_table &&
-                    !cons->IsConsString())) {
-      DCHECK(cons->IsInternalizedString() || cons->IsThinString());
+                    !IsConsString(*cons))) {
+      DCHECK(IsInternalizedString(*cons) || IsThinString(*cons));
       return String::Flatten(isolate, cons, allocation);
     }
     DisallowGarbageCollection no_gc;
@@ -81,8 +82,8 @@ Handle<String> String::SlowFlatten(Isolate* isolate, Handle<ConsString> cons,
     // transitioned to a ThinString (and eventually shortcutted to
     // InternalizedString) during GC.
     if (V8_UNLIKELY(v8_flags.always_use_string_forwarding_table &&
-                    !cons->IsConsString())) {
-      DCHECK(cons->IsInternalizedString() || cons->IsThinString());
+                    !IsConsString(*cons))) {
+      DCHECK(IsInternalizedString(*cons) || IsThinString(*cons));
       return String::Flatten(isolate, cons, allocation);
     }
     DisallowGarbageCollection no_gc;
@@ -91,9 +92,9 @@ Handle<String> String::SlowFlatten(Isolate* isolate, Handle<ConsString> cons,
   }
   {
     DisallowGarbageCollection no_gc;
-    auto raw_cons = *cons;
-    raw_cons.set_first(*result);
-    raw_cons.set_second(ReadOnlyRoots(isolate).empty_string());
+    Tagged<ConsString> raw_cons = *cons;
+    raw_cons->set_first(*result);
+    raw_cons->set_second(ReadOnlyRoots(isolate).empty_string());
   }
   DCHECK(result->IsFlat());
   return result;
@@ -113,7 +114,7 @@ Handle<String> String::SlowShare(Isolate* isolate, Handle<String> source) {
     case StringTransitionStrategy::kInPlace:
       // A relaxed write is sufficient here, because at this point the string
       // has not yet escaped the current thread.
-      DCHECK(flat->InSharedHeap());
+      DCHECK(Object::InSharedHeap(*flat));
       flat->set_map_no_write_barrier(*new_map.ToHandleChecked());
       return flat;
     case StringTransitionStrategy::kAlreadyTransitioned:
@@ -138,30 +139,31 @@ Handle<String> String::SlowShare(Isolate* isolate, Handle<String> source) {
 namespace {
 
 template <class StringClass>
-void MigrateExternalStringResource(Isolate* isolate, ExternalString from,
-                                   StringClass to) {
-  Address to_resource_address = to.resource_as_address();
+void MigrateExternalStringResource(Isolate* isolate,
+                                   Tagged<ExternalString> from,
+                                   Tagged<StringClass> to) {
+  Address to_resource_address = to->resource_as_address();
   if (to_resource_address == kNullAddress) {
-    StringClass cast_from = StringClass::cast(from);
+    Tagged<StringClass> cast_from = StringClass::cast(from);
     // |to| is a just-created internalized copy of |from|. Migrate the resource.
-    to.SetResource(isolate, cast_from.resource());
+    to->SetResource(isolate, cast_from->resource());
     // Zap |from|'s resource pointer to reflect the fact that |from| has
     // relinquished ownership of its resource.
     isolate->heap()->UpdateExternalString(
-        from, ExternalString::cast(from).ExternalPayloadSize(), 0);
-    cast_from.SetResource(isolate, nullptr);
-  } else if (to_resource_address != from.resource_as_address()) {
+        from, ExternalString::cast(from)->ExternalPayloadSize(), 0);
+    cast_from->SetResource(isolate, nullptr);
+  } else if (to_resource_address != from->resource_as_address()) {
     // |to| already existed and has its own resource. Finalize |from|.
     isolate->heap()->FinalizeExternalString(from);
   }
 }
 
-void MigrateExternalString(Isolate* isolate, String string,
-                           String internalized) {
-  if (internalized.IsExternalOneByteString()) {
+void MigrateExternalString(Isolate* isolate, Tagged<String> string,
+                           Tagged<String> internalized) {
+  if (IsExternalOneByteString(internalized)) {
     MigrateExternalStringResource(isolate, ExternalString::cast(string),
                                   ExternalOneByteString::cast(internalized));
-  } else if (internalized.IsExternalTwoByteString()) {
+  } else if (IsExternalTwoByteString(internalized)) {
     MigrateExternalStringResource(isolate, ExternalString::cast(string),
                                   ExternalTwoByteString::cast(internalized));
   } else {
@@ -172,14 +174,15 @@ void MigrateExternalString(Isolate* isolate, String string,
   }
 }
 
-void InitExternalPointerFieldsDuringExternalization(String string, Map new_map,
+void InitExternalPointerFieldsDuringExternalization(Tagged<String> string,
+                                                    Tagged<Map> new_map,
                                                     Isolate* isolate) {
-  string.InitExternalPointerField<kExternalStringResourceTag>(
+  string->InitExternalPointerField<kExternalStringResourceTag>(
       ExternalString::kResourceOffset, isolate, kNullAddress);
-  bool is_uncached = (new_map.instance_type() & kUncachedExternalStringMask) ==
+  bool is_uncached = (new_map->instance_type() & kUncachedExternalStringMask) ==
                      kUncachedExternalStringTag;
   if (!is_uncached) {
-    string.InitExternalPointerField<kExternalStringResourceDataTag>(
+    string->InitExternalPointerField<kExternalStringResourceDataTag>(
         ExternalString::kResourceDataOffset, isolate, kNullAddress);
   }
 }
@@ -187,14 +190,12 @@ void InitExternalPointerFieldsDuringExternalization(String string, Map new_map,
 }  // namespace
 
 template <typename IsolateT>
-void String::MakeThin(
-    IsolateT* isolate, String internalized,
-    UpdateInvalidatedObjectSize update_invalidated_object_size) {
+void String::MakeThin(IsolateT* isolate, Tagged<String> internalized) {
   DisallowGarbageCollection no_gc;
   DCHECK_NE(*this, internalized);
-  DCHECK(internalized.IsInternalizedString());
+  DCHECK(IsInternalizedString(internalized));
 
-  Map initial_map = map(kAcquireLoad);
+  Tagged<Map> initial_map = map(kAcquireLoad);
   StringShape initial_shape(initial_map);
 
   DCHECK(!initial_shape.IsThin());
@@ -211,23 +212,11 @@ void String::MakeThin(
 
   bool may_contain_recorded_slots = initial_shape.IsIndirect();
   int old_size = SizeFromMap(initial_map);
-  Map target_map = ReadOnlyRoots(isolate).thin_string_map();
-  const bool in_shared_heap = InWritableSharedSpace();
-  if (in_shared_heap) {
-    // Objects in the shared heap are always direct, therefore they can't have
-    // any invalidated slots.
-    update_invalidated_object_size = UpdateInvalidatedObjectSize::kNo;
-  }
+  ReadOnlyRoots roots(isolate);
+  Tagged<Map> target_map = internalized->IsOneByteRepresentation()
+                               ? roots.thin_one_byte_string_map()
+                               : roots.thin_two_byte_string_map();
   if (initial_shape.IsExternal()) {
-    // Conservatively assume ExternalStrings may have recorded slots if they
-    // don't reside in shared heap, because they could have been transitioned
-    // from ConsStrings without having had the recorded slots cleared.
-    // In the shared heap no such transitions are possible, as it can't contain
-    // indirect strings.
-    // Indirect strings also don't get large enough to be in LO space.
-    // TODO(v8:13374): Fix this more uniformly.
-    may_contain_recorded_slots = !in_shared_heap && !Heap::IsLargeObject(*this);
-
     // Notify GC about the layout change before the transition to avoid
     // concurrent marking from observing any in-between state (e.g.
     // ExternalString map where the resource external pointer is overwritten
@@ -235,23 +224,15 @@ void String::MakeThin(
     // ExternalString -> ThinString transitions can only happen on the
     // main-thread.
     isolate->AsIsolate()->heap()->NotifyObjectLayoutChange(
-        *this, no_gc,
-        may_contain_recorded_slots ? InvalidateRecordedSlots::kYes
-                                   : InvalidateRecordedSlots::kNo,
-        ThinString::kSize);
+        *this, no_gc, InvalidateRecordedSlots::kYes, ThinString::kSize);
     MigrateExternalString(isolate->AsIsolate(), *this, internalized);
   }
 
   // Update actual first and then do release store on the map word. This ensures
   // that the concurrent marker will read the pointer when visiting a
   // ThinString.
-  ThinString thin = ThinString::unchecked_cast(*this);
-  thin.set_actual(internalized);
-  if (initial_shape.IsExternal()) {
-    set_map(target_map, kReleaseStore);
-  } else {
-    set_map_safe_transition(target_map, kReleaseStore);
-  }
+  Tagged<ThinString> thin = ThinString::unchecked_cast(*this);
+  thin->set_actual(internalized);
 
   DCHECK_GE(old_size, ThinString::kSize);
   int size_delta = old_size - ThinString::kSize;
@@ -260,8 +241,7 @@ void String::MakeThin(
       isolate->heap()->NotifyObjectSizeChange(thin, old_size, ThinString::kSize,
                                               may_contain_recorded_slots
                                                   ? ClearRecordedSlots::kYes
-                                                  : ClearRecordedSlots::kNo,
-                                              update_invalidated_object_size);
+                                                  : ClearRecordedSlots::kNo);
     } else {
       // We don't need special handling for the combination IsLargeObject &&
       // may_contain_recorded_slots, because indirect strings never get that
@@ -269,14 +249,18 @@ void String::MakeThin(
       DCHECK(!may_contain_recorded_slots);
     }
   }
+
+  if (initial_shape.IsExternal()) {
+    set_map(target_map, kReleaseStore);
+  } else {
+    set_map_safe_transition(target_map, kReleaseStore);
+  }
 }
 
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void String::MakeThin(
-    Isolate* isolate, String internalized,
-    UpdateInvalidatedObjectSize update_invalidated_object_size);
+    Isolate* isolate, Tagged<String> internalized);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void String::MakeThin(
-    LocalIsolate* isolate, String internalized,
-    UpdateInvalidatedObjectSize update_invalidated_object_size);
+    LocalIsolate* isolate, Tagged<String> internalized);
 
 template <typename T>
 bool String::MarkForExternalizationDuringGC(Isolate* isolate, T* resource) {
@@ -314,7 +298,8 @@ bool String::MarkForExternalizationDuringGC(Isolate* isolate, T* resource) {
 namespace {
 
 template <bool is_one_byte>
-Map ComputeExternalStringMap(Isolate* isolate, String string, int size) {
+Tagged<Map> ComputeExternalStringMap(Isolate* isolate, Tagged<String> string,
+                                     int size) {
   ReadOnlyRoots roots(isolate);
   StringShape shape(string, isolate);
   const bool is_internalized = shape.IsInternalized();
@@ -322,14 +307,14 @@ Map ComputeExternalStringMap(Isolate* isolate, String string, int size) {
   if constexpr (is_one_byte) {
     if (size < ExternalString::kSizeOfAllExternalStrings) {
       if (is_internalized) {
-        return roots.uncached_external_one_byte_internalized_string_map();
+        return roots.uncached_external_internalized_one_byte_string_map();
       } else {
         return is_shared ? roots.shared_uncached_external_one_byte_string_map()
                          : roots.uncached_external_one_byte_string_map();
       }
     } else {
       if (is_internalized) {
-        return roots.external_one_byte_internalized_string_map();
+        return roots.external_internalized_one_byte_string_map();
       } else {
         return is_shared ? roots.shared_external_one_byte_string_map()
                          : roots.external_one_byte_string_map();
@@ -338,17 +323,17 @@ Map ComputeExternalStringMap(Isolate* isolate, String string, int size) {
   } else {
     if (size < ExternalString::kSizeOfAllExternalStrings) {
       if (is_internalized) {
-        return roots.uncached_external_internalized_string_map();
+        return roots.uncached_external_internalized_two_byte_string_map();
       } else {
-        return is_shared ? roots.shared_uncached_external_string_map()
-                         : roots.uncached_external_string_map();
+        return is_shared ? roots.shared_uncached_external_two_byte_string_map()
+                         : roots.uncached_external_two_byte_string_map();
       }
     } else {
       if (is_internalized) {
-        return roots.external_internalized_string_map();
+        return roots.external_internalized_two_byte_string_map();
       } else {
-        return is_shared ? roots.shared_external_string_map()
-                         : roots.external_string_map();
+        return is_shared ? roots.shared_external_two_byte_string_map()
+                         : roots.external_two_byte_string_map();
       }
     }
   }
@@ -372,7 +357,8 @@ void String::MakeExternalDuringGC(Isolate* isolate, T* resource) {
   // resort to an uncached external string instead, omitting the field caching
   // the address of the backing store.  When we encounter uncached external
   // strings in generated code, we need to bailout to runtime.
-  Map new_map = ComputeExternalStringMap<is_one_byte>(isolate, *this, size);
+  Tagged<Map> new_map =
+      ComputeExternalStringMap<is_one_byte>(isolate, *this, size);
 
   // Byte size of the external String object.
   int new_size = this->SizeFromMap(new_map);
@@ -382,8 +368,7 @@ void String::MakeExternalDuringGC(Isolate* isolate, T* resource) {
 
   if (!isolate->heap()->IsLargeObject(*this)) {
     isolate->heap()->NotifyObjectSizeChange(*this, size, new_size,
-                                            ClearRecordedSlots::kNo,
-                                            UpdateInvalidatedObjectSize::kNo);
+                                            ClearRecordedSlots::kNo);
   }
 
   // The external pointer slots must be initialized before the new map is
@@ -398,11 +383,11 @@ void String::MakeExternalDuringGC(Isolate* isolate, T* resource) {
   this->set_map(new_map, kReleaseStore);
 
   if constexpr (is_one_byte) {
-    ExternalOneByteString self = ExternalOneByteString::cast(*this);
-    self.SetResource(isolate, resource);
+    Tagged<ExternalOneByteString> self = ExternalOneByteString::cast(*this);
+    self->SetResource(isolate, resource);
   } else {
-    ExternalTwoByteString self = ExternalTwoByteString::cast(*this);
-    self.SetResource(isolate, resource);
+    Tagged<ExternalTwoByteString> self = ExternalTwoByteString::cast(*this);
+    self->SetResource(isolate, resource);
   }
   isolate->heap()->RegisterExternalString(*this);
 }
@@ -419,7 +404,8 @@ bool String::MakeExternal(v8::String::ExternalStringResource* resource) {
 
   // Externalizing twice leaks the external resource, so it's
   // prohibited by the API.
-  DCHECK(this->SupportsExternalization());
+  DCHECK(
+      this->SupportsExternalization(v8::String::Encoding::TWO_BYTE_ENCODING));
   DCHECK(resource->IsCacheable());
 #ifdef ENABLE_SLOW_DCHECKS
   if (v8_flags.enable_slow_asserts) {
@@ -439,13 +425,15 @@ bool String::MakeExternal(v8::String::ExternalStringResource* resource) {
   if (IsReadOnlyHeapObject(*this)) return false;
   Isolate* isolate = GetIsolateFromWritableObject(*this);
   if (IsShared(isolate)) {
+    DCHECK(isolate->is_shared_space_isolate());
     return MarkForExternalizationDuringGC(isolate, resource);
   }
-  bool is_internalized = this->IsInternalizedString();
+  DCHECK_IMPLIES(InWritableSharedSpace(), isolate->is_shared_space_isolate());
+  bool is_internalized = IsInternalizedString(*this);
   bool has_pointers = StringShape(*this).IsIndirect();
 
-  base::SharedMutexGuard<base::kExclusive> shared_mutex_guard(
-      isolate->internalized_string_access());
+  base::SharedMutexGuardIf<base::kExclusive> shared_mutex_guard(
+      isolate->internalized_string_access(), is_internalized);
   // Morph the string to an external string by replacing the map and
   // reinitializing the fields.  This won't work if the space the existing
   // string occupies is too small for a regular external string.  Instead, we
@@ -453,7 +441,8 @@ bool String::MakeExternal(v8::String::ExternalStringResource* resource) {
   // the address of the backing store.  When we encounter uncached external
   // strings in generated code, we need to bailout to runtime.
   constexpr bool is_one_byte = false;
-  Map new_map = ComputeExternalStringMap<is_one_byte>(isolate, *this, size);
+  Tagged<Map> new_map =
+      ComputeExternalStringMap<is_one_byte>(isolate, *this, size);
 
   // Byte size of the external String object.
   int new_size = this->SizeFromMap(new_map);
@@ -464,15 +453,9 @@ bool String::MakeExternal(v8::String::ExternalStringResource* resource) {
   }
 
   if (!isolate->heap()->IsLargeObject(*this)) {
-    // Strings in the shared heap are never indirect and thus cannot have any
-    // invalidated slots.
-    const auto update_invalidated_object_size =
-        InWritableSharedSpace() ? UpdateInvalidatedObjectSize::kNo
-                                : UpdateInvalidatedObjectSize::kYes;
     isolate->heap()->NotifyObjectSizeChange(
         *this, size, new_size,
-        has_pointers ? ClearRecordedSlots::kYes : ClearRecordedSlots::kNo,
-        update_invalidated_object_size);
+        has_pointers ? ClearRecordedSlots::kYes : ClearRecordedSlots::kNo);
   } else {
     // We don't need special handling for the combination IsLargeObject &&
     // has_pointers, because indirect strings never get that large.
@@ -490,11 +473,11 @@ bool String::MakeExternal(v8::String::ExternalStringResource* resource) {
   // the sweeper thread.
   this->set_map(new_map, kReleaseStore);
 
-  ExternalTwoByteString self = ExternalTwoByteString::cast(*this);
-  self.SetResource(isolate, resource);
+  Tagged<ExternalTwoByteString> self = ExternalTwoByteString::cast(*this);
+  self->SetResource(isolate, resource);
   isolate->heap()->RegisterExternalString(*this);
   // Force regeneration of the hash value.
-  if (is_internalized) self.EnsureHash();
+  if (is_internalized) self->EnsureHash();
   return true;
 }
 
@@ -504,7 +487,8 @@ bool String::MakeExternal(v8::String::ExternalOneByteStringResource* resource) {
 
   // Externalizing twice leaks the external resource, so it's
   // prohibited by the API.
-  DCHECK(this->SupportsExternalization());
+  DCHECK(
+      this->SupportsExternalization(v8::String::Encoding::ONE_BYTE_ENCODING));
   DCHECK(resource->IsCacheable());
 #ifdef ENABLE_SLOW_DCHECKS
   if (v8_flags.enable_slow_asserts) {
@@ -529,13 +513,15 @@ bool String::MakeExternal(v8::String::ExternalOneByteStringResource* resource) {
   if (IsReadOnlyHeapObject(*this)) return false;
   Isolate* isolate = GetIsolateFromWritableObject(*this);
   if (IsShared(isolate)) {
+    DCHECK(isolate->is_shared_space_isolate());
     return MarkForExternalizationDuringGC(isolate, resource);
   }
-  bool is_internalized = this->IsInternalizedString();
+  DCHECK_IMPLIES(InWritableSharedSpace(), isolate->is_shared_space_isolate());
+  bool is_internalized = IsInternalizedString(*this);
   bool has_pointers = StringShape(*this).IsIndirect();
 
-  base::SharedMutexGuard<base::kExclusive> shared_mutex_guard(
-      isolate->internalized_string_access());
+  base::SharedMutexGuardIf<base::kExclusive> shared_mutex_guard(
+      isolate->internalized_string_access(), is_internalized);
   // Morph the string to an external string by replacing the map and
   // reinitializing the fields.  This won't work if the space the existing
   // string occupies is too small for a regular external string.  Instead, we
@@ -543,7 +529,8 @@ bool String::MakeExternal(v8::String::ExternalOneByteStringResource* resource) {
   // the address of the backing store.  When we encounter uncached external
   // strings in generated code, we need to bailout to runtime.
   constexpr bool is_one_byte = true;
-  Map new_map = ComputeExternalStringMap<is_one_byte>(isolate, *this, size);
+  Tagged<Map> new_map =
+      ComputeExternalStringMap<is_one_byte>(isolate, *this, size);
 
   if (!isolate->heap()->IsLargeObject(*this)) {
     // Byte size of the external String object.
@@ -554,15 +541,9 @@ bool String::MakeExternal(v8::String::ExternalOneByteStringResource* resource) {
       isolate->heap()->NotifyObjectLayoutChange(
           *this, no_gc, InvalidateRecordedSlots::kYes, new_size);
     }
-    // Strings in the shared heap are never indirect and thus cannot have any
-    // invalidated slots.
-    const auto update_invalidated_object_size =
-        InWritableSharedSpace() ? UpdateInvalidatedObjectSize::kNo
-                                : UpdateInvalidatedObjectSize::kYes;
     isolate->heap()->NotifyObjectSizeChange(
         *this, size, new_size,
-        has_pointers ? ClearRecordedSlots::kYes : ClearRecordedSlots::kNo,
-        update_invalidated_object_size);
+        has_pointers ? ClearRecordedSlots::kYes : ClearRecordedSlots::kNo);
   } else {
     // We don't need special handling for the combination IsLargeObject &&
     // has_pointers, because indirect strings never get that large.
@@ -580,42 +561,17 @@ bool String::MakeExternal(v8::String::ExternalOneByteStringResource* resource) {
   // the sweeper thread.
   this->set_map(new_map, kReleaseStore);
 
-  ExternalOneByteString self = ExternalOneByteString::cast(*this);
-  self.SetResource(isolate, resource);
+  Tagged<ExternalOneByteString> self = ExternalOneByteString::cast(*this);
+  self->SetResource(isolate, resource);
   isolate->heap()->RegisterExternalString(*this);
   // Force regeneration of the hash value.
-  if (is_internalized) self.EnsureHash();
-  return true;
-}
-
-bool String::SupportsExternalization() {
-  if (this->IsThinString()) {
-    return i::ThinString::cast(*this).actual().SupportsExternalization();
-  }
-
-  // RO_SPACE strings cannot be externalized.
-  if (IsReadOnlyHeapObject(*this)) {
-    return false;
-  }
-
-  // Already an external string.
-  if (StringShape(*this).IsExternal()) {
-    return false;
-  }
-
-#ifdef V8_COMPRESS_POINTERS
-  // Small strings may not be in-place externalizable.
-  if (this->Size() < ExternalString::kUncachedSize) return false;
-#else
-  DCHECK_LE(ExternalString::kUncachedSize, this->Size());
-#endif
-
+  if (is_internalized) self->EnsureHash();
   return true;
 }
 
 bool String::SupportsExternalization(v8::String::Encoding encoding) {
-  if (this->IsThinString()) {
-    return i::ThinString::cast(*this).actual().SupportsExternalization(
+  if (IsThinString(*this)) {
+    return i::ThinString::cast(*this)->actual()->SupportsExternalization(
         encoding);
   }
 
@@ -638,6 +594,11 @@ bool String::SupportsExternalization(v8::String::Encoding encoding) {
     return false;
   }
 
+  // Only strings in old space can be externalized.
+  if (Heap::InYoungGeneration(Tagged(*this))) {
+    return false;
+  }
+
   // Encoding changes are not supported.
   static_assert(kStringEncodingMask == 1 << 3);
   static_assert(v8::String::Encoding::ONE_BYTE_ENCODING == 1 << 3);
@@ -732,10 +693,10 @@ void String::PrintUC16(StringStream* accumulator, int start, int end) {
 
 int32_t String::ToArrayIndex(Address addr) {
   DisallowGarbageCollection no_gc;
-  String key(addr);
+  Tagged<String> key(addr);
 
   uint32_t index;
-  if (!key.AsArrayIndex(&index)) return -1;
+  if (!key->AsArrayIndex(&index)) return -1;
   if (index <= INT_MAX) return index;
   return -1;
 }
@@ -787,7 +748,7 @@ Handle<Object> String::ToNumber(Isolate* isolate, Handle<String> subject) {
   }
 
   // Fast case: short integer or some sorts of junk values.
-  if (subject->IsSeqOneByteString()) {
+  if (IsSeqOneByteString(*subject)) {
     int len = subject->length();
     if (len == 0) return handle(Smi::zero(), isolate);
 
@@ -839,20 +800,20 @@ String::FlatContent String::SlowGetFlatContent(
     const SharedStringAccessGuardIfNeeded& access_guard) {
   USE(no_gc);
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
-  String string = *this;
+  Tagged<String> string = *this;
   StringShape shape(string, cage_base);
   int offset = 0;
 
   // Extract cons- and sliced strings.
   if (shape.IsCons()) {
-    ConsString cons = ConsString::cast(string);
-    if (!cons.IsFlat(cage_base)) return FlatContent(no_gc);
-    string = cons.first(cage_base);
+    Tagged<ConsString> cons = ConsString::cast(string);
+    if (!cons->IsFlat(cage_base)) return FlatContent(no_gc);
+    string = cons->first(cage_base);
     shape = StringShape(string, cage_base);
   } else if (shape.IsSliced()) {
-    SlicedString slice = SlicedString::cast(string);
-    offset = slice.offset();
-    string = slice.parent(cage_base);
+    Tagged<SlicedString> slice = SlicedString::cast(string);
+    offset = slice->offset();
+    string = slice->parent(cage_base);
     shape = StringShape(string, cage_base);
   }
 
@@ -861,8 +822,8 @@ String::FlatContent String::SlowGetFlatContent(
 
   // Extract thin strings.
   if (shape.IsThin()) {
-    ThinString thin = ThinString::cast(string);
-    string = thin.actual(cage_base);
+    Tagged<ThinString> thin = ThinString::cast(string);
+    string = thin->actual(cage_base);
     shape = StringShape(string, cage_base);
   }
 
@@ -925,7 +886,8 @@ std::unique_ptr<char[]> String::ToCString(AllowNullsFlag allow_nulls,
 
 // static
 template <typename sinkchar>
-void String::WriteToFlat(String source, sinkchar* sink, int start, int length) {
+void String::WriteToFlat(Tagged<String> source, sinkchar* sink, int start,
+                         int length) {
   DCHECK(!SharedStringAccessGuardIfNeeded::IsNeeded(source));
   return WriteToFlat(source, sink, start, length, GetPtrComprCageBase(source),
                      SharedStringAccessGuardIfNeeded::NotNeeded());
@@ -933,45 +895,47 @@ void String::WriteToFlat(String source, sinkchar* sink, int start, int length) {
 
 // static
 template <typename sinkchar>
-void String::WriteToFlat(String source, sinkchar* sink, int start, int length,
-                         PtrComprCageBase cage_base,
+void String::WriteToFlat(Tagged<String> source, sinkchar* sink, int start,
+                         int length, PtrComprCageBase cage_base,
                          const SharedStringAccessGuardIfNeeded& access_guard) {
   DisallowGarbageCollection no_gc;
   if (length == 0) return;
   while (true) {
     DCHECK_LT(0, length);
     DCHECK_LE(0, start);
-    DCHECK_LE(length, source.length());
+    DCHECK_LE(length, source->length());
     switch (StringShape(source, cage_base).representation_and_encoding_tag()) {
       case kOneByteStringTag | kExternalStringTag:
         CopyChars(
             sink,
-            ExternalOneByteString::cast(source).GetChars(cage_base) + start,
+            ExternalOneByteString::cast(source)->GetChars(cage_base) + start,
             length);
         return;
       case kTwoByteStringTag | kExternalStringTag:
         CopyChars(
             sink,
-            ExternalTwoByteString::cast(source).GetChars(cage_base) + start,
+            ExternalTwoByteString::cast(source)->GetChars(cage_base) + start,
             length);
         return;
       case kOneByteStringTag | kSeqStringTag:
-        CopyChars(sink,
-                  SeqOneByteString::cast(source).GetChars(no_gc, access_guard) +
-                      start,
-                  length);
+        CopyChars(
+            sink,
+            SeqOneByteString::cast(source)->GetChars(no_gc, access_guard) +
+                start,
+            length);
         return;
       case kTwoByteStringTag | kSeqStringTag:
-        CopyChars(sink,
-                  SeqTwoByteString::cast(source).GetChars(no_gc, access_guard) +
-                      start,
-                  length);
+        CopyChars(
+            sink,
+            SeqTwoByteString::cast(source)->GetChars(no_gc, access_guard) +
+                start,
+            length);
         return;
       case kOneByteStringTag | kConsStringTag:
       case kTwoByteStringTag | kConsStringTag: {
-        ConsString cons_string = ConsString::cast(source);
-        String first = cons_string.first(cage_base);
-        int boundary = first.length();
+        Tagged<ConsString> cons_string = ConsString::cast(source);
+        Tagged<String> first = cons_string->first(cage_base);
+        int boundary = first->length();
         int first_length = boundary - start;
         int second_length = start + length - boundary;
         if (second_length >= first_length) {
@@ -979,7 +943,7 @@ void String::WriteToFlat(String source, sinkchar* sink, int start, int length,
           if (first_length > 0) {
             WriteToFlat(first, sink, start, first_length, cage_base,
                         access_guard);
-            if (start == 0 && cons_string.second(cage_base) == first) {
+            if (start == 0 && cons_string->second(cage_base) == first) {
               CopyChars(sink + boundary, sink, boundary);
               return;
             }
@@ -989,21 +953,21 @@ void String::WriteToFlat(String source, sinkchar* sink, int start, int length,
           } else {
             start -= boundary;
           }
-          source = cons_string.second(cage_base);
+          source = cons_string->second(cage_base);
         } else {
           // Left hand side is longer.  Recurse over right.
           if (second_length > 0) {
-            String second = cons_string.second(cage_base);
+            Tagged<String> second = cons_string->second(cage_base);
             // When repeatedly appending to a string, we get a cons string that
             // is unbalanced to the left, a list, essentially.  We inline the
             // common case of sequential one-byte right child.
             if (second_length == 1) {
-              sink[boundary - start] =
-                  static_cast<sinkchar>(second.Get(0, cage_base, access_guard));
-            } else if (second.IsSeqOneByteString(cage_base)) {
+              sink[boundary - start] = static_cast<sinkchar>(
+                  second->Get(0, cage_base, access_guard));
+            } else if (IsSeqOneByteString(second, cage_base)) {
               CopyChars(
                   sink + boundary - start,
-                  SeqOneByteString::cast(second).GetChars(no_gc, access_guard),
+                  SeqOneByteString::cast(second)->GetChars(no_gc, access_guard),
                   second_length);
             } else {
               WriteToFlat(second, sink + boundary - start, 0, second_length,
@@ -1018,14 +982,15 @@ void String::WriteToFlat(String source, sinkchar* sink, int start, int length,
       }
       case kOneByteStringTag | kSlicedStringTag:
       case kTwoByteStringTag | kSlicedStringTag: {
-        SlicedString slice = SlicedString::cast(source);
-        unsigned offset = slice.offset();
-        source = slice.parent(cage_base);
+        Tagged<SlicedString> slice = SlicedString::cast(source);
+        unsigned offset = slice->offset();
+        source = slice->parent(cage_base);
         start += offset;
         continue;
       }
-      case kThinStringTag:
-        source = ThinString::cast(source).actual(cage_base);
+      case kOneByteStringTag | kThinStringTag:
+      case kTwoByteStringTag | kThinStringTag:
+        source = ThinString::cast(source)->actual(cage_base);
         continue;
     }
     UNREACHABLE();
@@ -1033,10 +998,14 @@ void String::WriteToFlat(String source, sinkchar* sink, int start, int length,
   UNREACHABLE();
 }
 
+namespace {
+static int constexpr kInlineLineEndsSize = 32;
+}
+
 template <typename SourceChar>
-static void CalculateLineEndsImpl(std::vector<int>* line_ends,
-                                  base::Vector<const SourceChar> src,
-                                  bool include_ending_line) {
+static void CalculateLineEndsImpl(
+    base::SmallVector<int32_t, kInlineLineEndsSize>* line_ends,
+    base::Vector<const SourceChar> src, bool include_ending_line) {
   const int src_len = src.length();
   for (int i = 0; i < src_len - 1; i++) {
     SourceChar current = src[i];
@@ -1060,12 +1029,12 @@ Handle<FixedArray> String::CalculateLineEnds(IsolateT* isolate,
                                              bool include_ending_line) {
   src = Flatten(isolate, src);
   // Rough estimate of line count based on a roughly estimated average
-  // length of (unpacked) code.
-  int line_count_estimate = src->length() >> 4;
-  std::vector<int> line_ends;
-  line_ends.reserve(line_count_estimate);
+  // length of packed code. Most scripts have < 32 lines.
+  int line_count_estimate = (src->length() >> 6) + 16;
+  base::SmallVector<int32_t, kInlineLineEndsSize> line_ends;
+  line_ends.reserve_no_init(line_count_estimate);
   {
-    DisallowGarbageCollection no_gc;  // ensure vectors stay valid.
+    DisallowGarbageCollection no_gc;
     // Dispatch on type of strings.
     String::FlatContent content = src->GetFlatContent(no_gc);
     DCHECK(content.IsFlat());
@@ -1080,8 +1049,12 @@ Handle<FixedArray> String::CalculateLineEnds(IsolateT* isolate,
   int line_count = static_cast<int>(line_ends.size());
   Handle<FixedArray> array =
       isolate->factory()->NewFixedArray(line_count, AllocationType::kOld);
-  for (int i = 0; i < line_count; i++) {
-    array->set(i, Smi::FromInt(line_ends[i]));
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<FixedArray> raw_array = *array;
+    for (int i = 0; i < line_count; i++) {
+      raw_array->set(i, Smi::FromInt(line_ends[i]));
+    }
   }
   return array;
 }
@@ -1093,29 +1066,30 @@ template Handle<FixedArray> String::CalculateLineEnds(LocalIsolate* isolate,
                                                       Handle<String> src,
                                                       bool include_ending_line);
 
-bool String::SlowEquals(String other) const {
+bool String::SlowEquals(Tagged<String> other) const {
   DCHECK(!SharedStringAccessGuardIfNeeded::IsNeeded(*this));
   DCHECK(!SharedStringAccessGuardIfNeeded::IsNeeded(other));
   return SlowEquals(other, SharedStringAccessGuardIfNeeded::NotNeeded());
 }
 
 bool String::SlowEquals(
-    String other, const SharedStringAccessGuardIfNeeded& access_guard) const {
+    Tagged<String> other,
+    const SharedStringAccessGuardIfNeeded& access_guard) const {
   DisallowGarbageCollection no_gc;
   // Fast check: negative check with lengths.
   int len = length();
-  if (len != other.length()) return false;
+  if (len != other->length()) return false;
   if (len == 0) return true;
 
   PtrComprCageBase cage_base = GetPtrComprCageBase(*this);
 
   // Fast check: if at least one ThinString is involved, dereference it/them
   // and restart.
-  if (this->IsThinString(cage_base) || other.IsThinString(cage_base)) {
-    if (other.IsThinString(cage_base))
-      other = ThinString::cast(other).actual(cage_base);
-    if (this->IsThinString(cage_base)) {
-      return ThinString::cast(*this).actual(cage_base).Equals(other);
+  if (IsThinString(*this, cage_base) || IsThinString(other, cage_base)) {
+    if (IsThinString(other, cage_base))
+      other = ThinString::cast(other)->actual(cage_base);
+    if (IsThinString(*this, cage_base)) {
+      return ThinString::cast(*this)->actual(cage_base)->Equals(other);
     } else {
       return this->Equals(other);
     }
@@ -1125,13 +1099,13 @@ bool String::SlowEquals(
   // a fast negative check can be performed.
   uint32_t this_hash;
   uint32_t other_hash;
-  if (TryGetHash(&this_hash) && other.TryGetHash(&other_hash)) {
+  if (TryGetHash(&this_hash) && other->TryGetHash(&other_hash)) {
 #ifdef ENABLE_SLOW_DCHECKS
     if (v8_flags.enable_slow_asserts) {
       if (this_hash != other_hash) {
         bool found_difference = false;
         for (int i = 0; i < len; i++) {
-          if (Get(i) != other.Get(i)) {
+          if (Get(i) != other->Get(i)) {
             found_difference = true;
             break;
           }
@@ -1146,14 +1120,14 @@ bool String::SlowEquals(
   // We know the strings are both non-empty. Compare the first chars
   // before we try to flatten the strings.
   if (this->Get(0, cage_base, access_guard) !=
-      other.Get(0, cage_base, access_guard))
+      other->Get(0, cage_base, access_guard))
     return false;
 
-  if (IsSeqOneByteString() && other.IsSeqOneByteString()) {
+  if (IsSeqOneByteString(*this) && IsSeqOneByteString(other)) {
     const uint8_t* str1 =
-        SeqOneByteString::cast(*this).GetChars(no_gc, access_guard);
+        SeqOneByteString::cast(*this)->GetChars(no_gc, access_guard);
     const uint8_t* str2 =
-        SeqOneByteString::cast(other).GetChars(no_gc, access_guard);
+        SeqOneByteString::cast(other)->GetChars(no_gc, access_guard);
     return CompareCharsEqual(str1, str2, len);
   }
 
@@ -1171,12 +1145,12 @@ bool String::SlowEquals(Isolate* isolate, Handle<String> one,
 
   // Fast check: if at least one ThinString is involved, dereference it/them
   // and restart.
-  if (one->IsThinString() || two->IsThinString()) {
-    if (one->IsThinString()) {
-      one = handle(ThinString::cast(*one).actual(), isolate);
+  if (IsThinString(*one) || IsThinString(*two)) {
+    if (IsThinString(*one)) {
+      one = handle(ThinString::cast(*one)->actual(), isolate);
     }
-    if (two->IsThinString()) {
-      two = handle(ThinString::cast(*two).actual(), isolate);
+    if (IsThinString(*two)) {
+      two = handle(ThinString::cast(*two)->actual(), isolate);
     }
     return String::Equals(isolate, one, two);
   }
@@ -1295,18 +1269,18 @@ ComparisonResult String::Compare(Isolate* isolate, Handle<String> x,
 
 namespace {
 
-uint32_t ToValidIndex(String str, Object number) {
+uint32_t ToValidIndex(Tagged<String> str, Tagged<Object> number) {
   uint32_t index = PositiveNumberToUint32(number);
-  uint32_t length_value = static_cast<uint32_t>(str.length());
+  uint32_t length_value = static_cast<uint32_t>(str->length());
   if (index > length_value) return length_value;
   return index;
 }
 
 }  // namespace
 
-Object String::IndexOf(Isolate* isolate, Handle<Object> receiver,
-                       Handle<Object> search, Handle<Object> position) {
-  if (receiver->IsNullOrUndefined(isolate)) {
+Tagged<Object> String::IndexOf(Isolate* isolate, Handle<Object> receiver,
+                               Handle<Object> search, Handle<Object> position) {
+  if (IsNullOrUndefined(*receiver, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kCalledOnNullOrUndefined,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -1570,9 +1544,10 @@ int StringMatchBackwards(base::Vector<const schar> subject,
 
 }  // namespace
 
-Object String::LastIndexOf(Isolate* isolate, Handle<Object> receiver,
-                           Handle<Object> search, Handle<Object> position) {
-  if (receiver->IsNullOrUndefined(isolate)) {
+Tagged<Object> String::LastIndexOf(Isolate* isolate, Handle<Object> receiver,
+                                   Handle<Object> search,
+                                   Handle<Object> position) {
+  if (IsNullOrUndefined(*receiver, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kCalledOnNullOrUndefined,
                               isolate->factory()->NewStringFromAsciiChecked(
@@ -1591,7 +1566,7 @@ Object String::LastIndexOf(Isolate* isolate, Handle<Object> receiver,
 
   uint32_t start_index;
 
-  if (position->IsNaN()) {
+  if (IsNaN(*position)) {
     start_index = receiver_string->length();
   } else {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, position,
@@ -1651,7 +1626,7 @@ bool String::HasOneBytePrefix(base::Vector<const char> str) {
 namespace {
 
 template <typename Char>
-bool IsIdentifierVector(const base::Vector<Char>& vec) {
+bool IsIdentifierVector(base::Vector<Char> vec) {
   if (vec.empty()) {
     return false;
   }
@@ -1680,8 +1655,8 @@ bool String::IsIdentifier(Isolate* isolate, Handle<String> str) {
 namespace {
 
 template <typename Char>
-uint32_t HashString(String string, size_t start, int length, uint64_t seed,
-                    PtrComprCageBase cage_base,
+uint32_t HashString(Tagged<String> string, size_t start, int length,
+                    uint64_t seed, PtrComprCageBase cage_base,
                     const SharedStringAccessGuardIfNeeded& access_guard) {
   DisallowGarbageCollection no_gc;
 
@@ -1692,15 +1667,15 @@ uint32_t HashString(String string, size_t start, int length, uint64_t seed,
   std::unique_ptr<Char[]> buffer;
   const Char* chars;
 
-  if (string.IsConsString(cage_base)) {
+  if (IsConsString(string, cage_base)) {
     DCHECK_EQ(0, start);
-    DCHECK(!string.IsFlat());
+    DCHECK(!string->IsFlat());
     buffer.reset(new Char[length]);
     String::WriteToFlat(string, buffer.get(), 0, length, cage_base,
                         access_guard);
     chars = buffer.get();
   } else {
-    chars = string.GetDirectStringChars<Char>(cage_base, no_gc, access_guard) +
+    chars = string->GetDirectStringChars<Char>(cage_base, no_gc, access_guard) +
             start;
   }
 
@@ -1728,24 +1703,24 @@ uint32_t String::ComputeAndSetRawHash(
   // Store the hash code in the object.
   uint64_t seed = HashSeed(EarlyGetReadOnlyRoots());
   size_t start = 0;
-  String string = *this;
+  Tagged<String> string = *this;
   PtrComprCageBase cage_base = GetPtrComprCageBase(string);
   StringShape shape(string, cage_base);
   if (shape.IsSliced()) {
-    SlicedString sliced = SlicedString::cast(string);
-    start = sliced.offset();
-    string = sliced.parent(cage_base);
+    Tagged<SlicedString> sliced = SlicedString::cast(string);
+    start = sliced->offset();
+    string = sliced->parent(cage_base);
     shape = StringShape(string, cage_base);
   }
-  if (shape.IsCons() && string.IsFlat(cage_base)) {
-    string = ConsString::cast(string).first(cage_base);
+  if (shape.IsCons() && string->IsFlat(cage_base)) {
+    string = ConsString::cast(string)->first(cage_base);
     shape = StringShape(string, cage_base);
   }
   if (shape.IsThin()) {
-    string = ThinString::cast(string).actual(cage_base);
+    string = ThinString::cast(string)->actual(cage_base);
     shape = StringShape(string, cage_base);
-    if (length() == string.length()) {
-      uint32_t raw_hash = string.RawHash();
+    if (length() == string->length()) {
+      uint32_t raw_hash = string->RawHash();
       DCHECK(IsHashFieldComputed(raw_hash));
       set_raw_hash_field(raw_hash);
       return raw_hash;
@@ -1817,11 +1792,11 @@ Handle<String> SeqString::Truncate(Isolate* isolate, Handle<SeqString> string,
   int old_length = string->length();
   if (old_length <= new_length) return string;
 
-  if (string->IsSeqOneByteString()) {
+  if (IsSeqOneByteString(*string)) {
     old_size = SeqOneByteString::SizeFor(old_length);
     new_size = SeqOneByteString::SizeFor(new_length);
   } else {
-    DCHECK(string->IsSeqTwoByteString());
+    DCHECK(IsSeqTwoByteString(*string));
     old_size = SeqTwoByteString::SizeFor(old_length);
     new_size = SeqTwoByteString::SizeFor(new_length);
   }
@@ -1839,8 +1814,7 @@ Handle<String> SeqString::Truncate(Isolate* isolate, Handle<SeqString> string,
     // No slot invalidation needed since this method is only used on freshly
     // allocated strings.
     heap->NotifyObjectSizeChange(*string, old_size, new_size,
-                                 ClearRecordedSlots::kNo,
-                                 UpdateInvalidatedObjectSize::kNo);
+                                 ClearRecordedSlots::kNo);
   }
   // We are storing the new length using release store after creating a filler
   // for the left-over space to avoid races with the sweeper thread.
@@ -1851,10 +1825,10 @@ Handle<String> SeqString::Truncate(Isolate* isolate, Handle<SeqString> string,
 }
 
 SeqString::DataAndPaddingSizes SeqString::GetDataAndPaddingSizes() const {
-  if (IsSeqOneByteString()) {
-    return SeqOneByteString::cast(*this).GetDataAndPaddingSizes();
+  if (IsSeqOneByteString(*this)) {
+    return SeqOneByteString::cast(*this)->GetDataAndPaddingSizes();
   }
-  return SeqTwoByteString::cast(*this).GetDataAndPaddingSizes();
+  return SeqTwoByteString::cast(*this)->GetDataAndPaddingSizes();
 }
 
 SeqString::DataAndPaddingSizes SeqOneByteString::GetDataAndPaddingSizes()
@@ -1896,25 +1870,25 @@ uint16_t ConsString::Get(
   DCHECK(index >= 0 && index < this->length());
 
   // Check for a flattened cons string
-  if (second(cage_base).length() == 0) {
-    String left = first(cage_base);
-    return left.Get(index);
+  if (second(cage_base)->length() == 0) {
+    Tagged<String> left = first(cage_base);
+    return left->Get(index);
   }
 
-  String string = String::cast(*this);
+  Tagged<String> string = String::cast(*this);
 
   while (true) {
     if (StringShape(string, cage_base).IsCons()) {
-      ConsString cons_string = ConsString::cast(string);
-      String left = cons_string.first();
-      if (left.length() > index) {
+      Tagged<ConsString> cons_string = ConsString::cast(string);
+      Tagged<String> left = cons_string->first();
+      if (left->length() > index) {
         string = left;
       } else {
-        index -= left.length();
-        string = cons_string.second(cage_base);
+        index -= left->length();
+        string = cons_string->second(cage_base);
       }
     } else {
-      return string.Get(index, cage_base, access_guard);
+      return string->Get(index, cage_base, access_guard);
     }
   }
 
@@ -1924,13 +1898,13 @@ uint16_t ConsString::Get(
 uint16_t ThinString::Get(
     int index, PtrComprCageBase cage_base,
     const SharedStringAccessGuardIfNeeded& access_guard) const {
-  return actual(cage_base).Get(index, cage_base, access_guard);
+  return actual(cage_base)->Get(index, cage_base, access_guard);
 }
 
 uint16_t SlicedString::Get(
     int index, PtrComprCageBase cage_base,
     const SharedStringAccessGuardIfNeeded& access_guard) const {
-  return parent(cage_base).Get(offset() + index, cage_base, access_guard);
+  return parent(cage_base)->Get(offset() + index, cage_base, access_guard);
 }
 
 int ExternalString::ExternalPayloadSize() const {
@@ -1961,7 +1935,8 @@ void FlatStringReader::PostGarbageCollection() {
   }
 }
 
-void ConsStringIterator::Initialize(ConsString cons_string, int offset) {
+void ConsStringIterator::Initialize(Tagged<ConsString> cons_string,
+                                    int offset) {
   DCHECK(!cons_string.is_null());
   root_ = cons_string;
   consumed_ = offset;
@@ -1971,11 +1946,11 @@ void ConsStringIterator::Initialize(ConsString cons_string, int offset) {
   DCHECK(StackBlown());
 }
 
-String ConsStringIterator::Continue(int* offset_out) {
+Tagged<String> ConsStringIterator::Continue(int* offset_out) {
   DCHECK_NE(depth_, 0);
   DCHECK_EQ(0, *offset_out);
   bool blew_stack = StackBlown();
-  String string;
+  Tagged<String> string;
   // Get the next leaf if there is one.
   if (!blew_stack) string = NextLeaf(&blew_stack);
   // Restart search from root.
@@ -1988,8 +1963,8 @@ String ConsStringIterator::Continue(int* offset_out) {
   return string;
 }
 
-String ConsStringIterator::Search(int* offset_out) {
-  ConsString cons_string = root_;
+Tagged<String> ConsStringIterator::Search(int* offset_out) {
+  Tagged<ConsString> cons_string = root_;
   // Reset the stack, pushing the root string.
   depth_ = 1;
   maximum_depth_ = 1;
@@ -1998,13 +1973,13 @@ String ConsStringIterator::Search(int* offset_out) {
   int offset = 0;
   while (true) {
     // Loop until the string is found which contains the target offset.
-    String string = cons_string.first();
-    int length = string.length();
+    Tagged<String> string = cons_string->first();
+    int length = string->length();
     int32_t type;
     if (consumed < offset + length) {
       // Target offset is in the left branch.
       // Keep going if we're still in a ConString.
-      type = string.map().instance_type();
+      type = string->map()->instance_type();
       if ((type & kStringRepresentationMask) == kConsStringTag) {
         cons_string = ConsString::cast(string);
         PushLeft(cons_string);
@@ -2017,15 +1992,15 @@ String ConsStringIterator::Search(int* offset_out) {
       // Update progress through the string.
       offset += length;
       // Keep going if we're still in a ConString.
-      string = cons_string.second();
-      type = string.map().instance_type();
+      string = cons_string->second();
+      type = string->map()->instance_type();
       if ((type & kStringRepresentationMask) == kConsStringTag) {
         cons_string = ConsString::cast(string);
         PushRight(cons_string);
         continue;
       }
       // Need this to be updated for the current string.
-      length = string.length();
+      length = string->length();
       // Account for the possibility of an empty right leaf.
       // This happens only if we have asked for an offset outside the string.
       if (length == 0) {
@@ -2047,7 +2022,7 @@ String ConsStringIterator::Search(int* offset_out) {
   UNREACHABLE();
 }
 
-String ConsStringIterator::NextLeaf(bool* blew_stack) {
+Tagged<String> ConsStringIterator::NextLeaf(bool* blew_stack) {
   while (true) {
     // Tree traversal complete.
     if (depth_ == 0) {
@@ -2060,13 +2035,13 @@ String ConsStringIterator::NextLeaf(bool* blew_stack) {
       return String();
     }
     // Go right.
-    ConsString cons_string = frames_[OffsetForDepth(depth_ - 1)];
-    String string = cons_string.second();
-    int32_t type = string.map().instance_type();
+    Tagged<ConsString> cons_string = frames_[OffsetForDepth(depth_ - 1)];
+    Tagged<String> string = cons_string->second();
+    int32_t type = string->map()->instance_type();
     if ((type & kStringRepresentationMask) != kConsStringTag) {
       // Pop stack so next iteration is in correct place.
       Pop();
-      int length = string.length();
+      int length = string->length();
       // Could be a flattened ConsString.
       if (length == 0) continue;
       consumed_ += length;
@@ -2077,11 +2052,11 @@ String ConsStringIterator::NextLeaf(bool* blew_stack) {
     // Need to traverse all the way left.
     while (true) {
       // Continue left.
-      string = cons_string.first();
-      type = string.map().instance_type();
+      string = cons_string->first();
+      type = string->map()->instance_type();
       if ((type & kStringRepresentationMask) != kConsStringTag) {
         AdjustMaximumDepth();
-        int length = string.length();
+        int length = string->length();
         if (length == 0) break;  // Skip empty left-hand sides of ConsStrings.
         consumed_ += length;
         return string;
@@ -2093,40 +2068,40 @@ String ConsStringIterator::NextLeaf(bool* blew_stack) {
   UNREACHABLE();
 }
 
-const byte* String::AddressOfCharacterAt(
+const uint8_t* String::AddressOfCharacterAt(
     int start_index, const DisallowGarbageCollection& no_gc) {
   DCHECK(IsFlat());
-  String subject = *this;
+  Tagged<String> subject = *this;
   PtrComprCageBase cage_base = GetPtrComprCageBase(subject);
   StringShape shape(subject, cage_base);
-  if (subject.IsConsString(cage_base)) {
-    subject = ConsString::cast(subject).first(cage_base);
+  if (IsConsString(subject, cage_base)) {
+    subject = ConsString::cast(subject)->first(cage_base);
     shape = StringShape(subject, cage_base);
-  } else if (subject.IsSlicedString(cage_base)) {
-    start_index += SlicedString::cast(subject).offset();
-    subject = SlicedString::cast(subject).parent(cage_base);
+  } else if (IsSlicedString(subject, cage_base)) {
+    start_index += SlicedString::cast(subject)->offset();
+    subject = SlicedString::cast(subject)->parent(cage_base);
     shape = StringShape(subject, cage_base);
   }
-  if (subject.IsThinString(cage_base)) {
-    subject = ThinString::cast(subject).actual(cage_base);
+  if (IsThinString(subject, cage_base)) {
+    subject = ThinString::cast(subject)->actual(cage_base);
     shape = StringShape(subject, cage_base);
   }
   CHECK_LE(0, start_index);
-  CHECK_LE(start_index, subject.length());
+  CHECK_LE(start_index, subject->length());
   switch (shape.representation_and_encoding_tag()) {
     case kOneByteStringTag | kSeqStringTag:
-      return reinterpret_cast<const byte*>(
-          SeqOneByteString::cast(subject).GetChars(no_gc) + start_index);
+      return reinterpret_cast<const uint8_t*>(
+          SeqOneByteString::cast(subject)->GetChars(no_gc) + start_index);
     case kTwoByteStringTag | kSeqStringTag:
-      return reinterpret_cast<const byte*>(
-          SeqTwoByteString::cast(subject).GetChars(no_gc) + start_index);
+      return reinterpret_cast<const uint8_t*>(
+          SeqTwoByteString::cast(subject)->GetChars(no_gc) + start_index);
     case kOneByteStringTag | kExternalStringTag:
-      return reinterpret_cast<const byte*>(
-          ExternalOneByteString::cast(subject).GetChars(cage_base) +
+      return reinterpret_cast<const uint8_t*>(
+          ExternalOneByteString::cast(subject)->GetChars(cage_base) +
           start_index);
     case kTwoByteStringTag | kExternalStringTag:
-      return reinterpret_cast<const byte*>(
-          ExternalTwoByteString::cast(subject).GetChars(cage_base) +
+      return reinterpret_cast<const uint8_t*>(
+          ExternalTwoByteString::cast(subject)->GetChars(cage_base) +
           start_index);
     default:
       UNREACHABLE();
@@ -2134,15 +2109,15 @@ const byte* String::AddressOfCharacterAt(
 }
 
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void String::WriteToFlat(
-    String source, uint16_t* sink, int from, int to);
+    Tagged<String> source, uint16_t* sink, int from, int to);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void String::WriteToFlat(
-    String source, uint8_t* sink, int from, int to);
+    Tagged<String> source, uint8_t* sink, int from, int to);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void String::WriteToFlat(
-    String source, uint16_t* sink, int from, int to, PtrComprCageBase cage_base,
-    const SharedStringAccessGuardIfNeeded&);
+    Tagged<String> source, uint16_t* sink, int from, int to,
+    PtrComprCageBase cage_base, const SharedStringAccessGuardIfNeeded&);
 template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void String::WriteToFlat(
-    String source, uint8_t* sink, int from, int to, PtrComprCageBase cage_base,
-    const SharedStringAccessGuardIfNeeded&);
+    Tagged<String> source, uint8_t* sink, int from, int to,
+    PtrComprCageBase cage_base, const SharedStringAccessGuardIfNeeded&);
 
 namespace {
 // Check that the constants defined in src/objects/instance-type.h coincides
diff --git a/deps/v8/src/objects/string.h b/deps/v8/src/objects/string.h
index aacc6c994fe691..3d04b0dae7ad89 100644
--- a/deps/v8/src/objects/string.h
+++ b/deps/v8/src/objects/string.h
@@ -16,6 +16,7 @@
 #include "src/objects/map.h"
 #include "src/objects/name.h"
 #include "src/objects/smi.h"
+#include "src/objects/tagged.h"
 #include "src/strings/unicode-decoder.h"
 
 // Has to be the last include (doesn't have include guards):
@@ -44,9 +45,10 @@ enum RobustnessFlag { ROBUST_STRING_TRAVERSAL, FAST_STRING_TRAVERSAL };
 // concrete performance benefit at that particular point in the code.
 class StringShape {
  public:
-  V8_INLINE explicit StringShape(const String s);
-  V8_INLINE explicit StringShape(const String s, PtrComprCageBase cage_base);
-  V8_INLINE explicit StringShape(Map s);
+  V8_INLINE explicit StringShape(const Tagged<String> s);
+  V8_INLINE explicit StringShape(const Tagged<String> s,
+                                 PtrComprCageBase cage_base);
+  V8_INLINE explicit StringShape(Tagged<Map> s);
   V8_INLINE explicit StringShape(InstanceType t);
   V8_INLINE bool IsSequential() const;
   V8_INLINE bool IsExternal() const;
@@ -79,7 +81,7 @@ class StringShape {
   template <typename TDispatcher, typename TResult, typename... TArgs>
   inline TResult DispatchToSpecificTypeWithoutCast(TArgs&&... args);
   template <typename TDispatcher, typename TResult, typename... TArgs>
-  inline TResult DispatchToSpecificType(String str, TArgs&&... args);
+  inline TResult DispatchToSpecificType(Tagged<String> str, TArgs&&... args);
 
  private:
   uint32_t type_;
@@ -195,9 +197,7 @@ class String : public TorqueGeneratedString<String, Name> {
 
   template <typename IsolateT>
   EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-  void MakeThin(IsolateT* isolate, String canonical,
-                UpdateInvalidatedObjectSize update_invalidated_object_size =
-                    UpdateInvalidatedObjectSize::kYes);
+  void MakeThin(IsolateT* isolate, Tagged<String> canonical);
 
   template <typename Char>
   V8_INLINE base::Vector<const Char> GetCharVector(
@@ -218,8 +218,8 @@ class String : public TorqueGeneratedString<String, Name> {
 
   // Returns the address of the character at an offset into this string.
   // Requires: this->IsFlat()
-  const byte* AddressOfCharacterAt(int start_index,
-                                   const DisallowGarbageCollection& no_gc);
+  const uint8_t* AddressOfCharacterAt(int start_index,
+                                      const DisallowGarbageCollection& no_gc);
 
   // Forward declare the non-atomic (set_)length defined in torque.
   using TorqueGeneratedString::length;
@@ -237,7 +237,7 @@ class String : public TorqueGeneratedString<String, Name> {
   // encoding of the underlying string.  This is taken into account here.
   // This function is static because that helps it get inlined.
   // Requires: string.IsFlat()
-  static inline bool IsOneByteRepresentationUnderneath(String string);
+  static inline bool IsOneByteRepresentationUnderneath(Tagged<String> string);
 
   // Get and set individual two byte chars in the string.
   inline void Set(int index, uint16_t value);
@@ -293,7 +293,7 @@ class String : public TorqueGeneratedString<String, Name> {
 
   // Returns the parent of a sliced string or first part of a flat cons string.
   // Requires: StringShape(this).IsIndirect() && this->IsFlat()
-  inline String GetUnderlying() const;
+  inline Tagged<String> GetUnderlying() const;
 
   // Shares the string. Checks inline if the string is already shared or can be
   // shared by transitioning its map in-place. If neither is possible, flattens
@@ -316,16 +316,17 @@ class String : public TorqueGeneratedString<String, Name> {
                                                         Handle<String> y);
 
   // Perform ES6 21.1.3.8, including checking arguments.
-  static Object IndexOf(Isolate* isolate, Handle<Object> receiver,
-                        Handle<Object> search, Handle<Object> position);
+  static Tagged<Object> IndexOf(Isolate* isolate, Handle<Object> receiver,
+                                Handle<Object> search, Handle<Object> position);
   // Perform string match of pattern on subject, starting at start index.
   // Caller must ensure that 0 <= start_index <= sub->length(), as this does not
   // check any arguments.
   static int IndexOf(Isolate* isolate, Handle<String> receiver,
                      Handle<String> search, int start_index);
 
-  static Object LastIndexOf(Isolate* isolate, Handle<Object> receiver,
-                            Handle<Object> search, Handle<Object> position);
+  static Tagged<Object> LastIndexOf(Isolate* isolate, Handle<Object> receiver,
+                                    Handle<Object> search,
+                                    Handle<Object> position);
 
   // Encapsulates logic related to a match and its capture groups as required
   // by GetSubstitution.
@@ -359,7 +360,7 @@ class String : public TorqueGeneratedString<String, Name> {
       int start_index = 0);
 
   // String equality operations.
-  inline bool Equals(String other) const;
+  inline bool Equals(Tagged<String> other) const;
   inline static bool Equals(Isolate* isolate, Handle<String> one,
                             Handle<String> two);
 
@@ -422,9 +423,6 @@ class String : public TorqueGeneratedString<String, Name> {
       v8::String::ExternalStringResource* resource);
   V8_EXPORT_PRIVATE bool MakeExternal(
       v8::String::ExternalOneByteStringResource* resource);
-  // TODO(pthier, v8:13785): Remove once v8::String::CanMakeExternal without
-  // encoding is removed.
-  bool SupportsExternalization();
   bool SupportsExternalization(v8::String::Encoding);
 
   // Conversion.
@@ -523,10 +521,11 @@ class String : public TorqueGeneratedString<String, Name> {
   // Helper function for flattening strings.
   template <typename sinkchar>
   EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-  static void WriteToFlat(String source, sinkchar* sink, int from, int to);
+  static void WriteToFlat(Tagged<String> source, sinkchar* sink, int from,
+                          int to);
   template <typename sinkchar>
-  static void WriteToFlat(String source, sinkchar* sink, int from, int to,
-                          PtrComprCageBase cage_base,
+  static void WriteToFlat(Tagged<String> source, sinkchar* sink, int from,
+                          int to, PtrComprCageBase cage_base,
                           const SharedStringAccessGuardIfNeeded&);
 
   // Returns true if this string has no unpaired surrogates and false otherwise.
@@ -588,12 +587,13 @@ class String : public TorqueGeneratedString<String, Name> {
   // May only be called when a SharedStringAccessGuard is not needed (i.e. on
   // the main thread or on read-only strings).
   template <class Visitor>
-  static inline ConsString VisitFlat(Visitor* visitor, String string,
-                                     int offset = 0);
+  static inline Tagged<ConsString> VisitFlat(Visitor* visitor,
+                                             Tagged<String> string,
+                                             int offset = 0);
 
   template <class Visitor>
-  static inline ConsString VisitFlat(
-      Visitor* visitor, String string, int offset,
+  static inline Tagged<ConsString> VisitFlat(
+      Visitor* visitor, Tagged<String> string, int offset,
       const SharedStringAccessGuardIfNeeded& access_guard);
 
   template <typename IsolateT>
@@ -604,7 +604,7 @@ class String : public TorqueGeneratedString<String, Name> {
   // Returns true if string can be internalized without copying. In such cases
   // the string is inserted into the string table and its map is changed to an
   // internalized equivalent.
-  static inline bool IsInPlaceInternalizable(String string);
+  static inline bool IsInPlaceInternalizable(Tagged<String> string);
   static inline bool IsInPlaceInternalizable(InstanceType instance_type);
 
   static inline bool IsInPlaceInternalizableExcludingExternal(
@@ -630,7 +630,7 @@ class String : public TorqueGeneratedString<String, Name> {
   // Out-of-line IsEqualToImpl for ConsString.
   template <typename Char>
   V8_NOINLINE static bool IsConsStringEqualToImpl(
-      ConsString string, base::Vector<const Char> str,
+      Tagged<ConsString> string, base::Vector<const Char> str,
       PtrComprCageBase cage_base,
       const SharedStringAccessGuardIfNeeded& access_guard);
 
@@ -640,7 +640,8 @@ class String : public TorqueGeneratedString<String, Name> {
   V8_EXPORT_PRIVATE V8_INLINE static base::Optional<FlatContent>
   TryGetFlatContentFromDirectString(PtrComprCageBase cage_base,
                                     const DisallowGarbageCollection& no_gc,
-                                    String string, int offset, int length,
+                                    Tagged<String> string, int offset,
+                                    int length,
                                     const SharedStringAccessGuardIfNeeded&);
   V8_EXPORT_PRIVATE FlatContent
   SlowGetFlatContent(const DisallowGarbageCollection& no_gc,
@@ -651,9 +652,9 @@ class String : public TorqueGeneratedString<String, Name> {
 
   // Slow case of String::Equals.  This implementation works on any strings
   // but it is most efficient on strings that are almost flat.
-  V8_EXPORT_PRIVATE bool SlowEquals(String other) const;
+  V8_EXPORT_PRIVATE bool SlowEquals(Tagged<String> other) const;
   V8_EXPORT_PRIVATE bool SlowEquals(
-      String other, const SharedStringAccessGuardIfNeeded&) const;
+      Tagged<String> other, const SharedStringAccessGuardIfNeeded&) const;
 
   V8_EXPORT_PRIVATE static bool SlowEquals(Isolate* isolate, Handle<String> one,
                                            Handle<String> two);
@@ -673,24 +674,26 @@ class String : public TorqueGeneratedString<String, Name> {
 };
 
 // clang-format off
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void String::WriteToFlat(String source, uint8_t* sink, int from, int to);
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void String::WriteToFlat(String source, uint16_t* sink, int from, int to);
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void String::WriteToFlat(String source, uint8_t* sink, int from, int to,
-                         PtrComprCageBase cage_base,
-                         const SharedStringAccessGuardIfNeeded&);
-extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
-void String::WriteToFlat(String source, uint16_t* sink, int from, int to,
-                         PtrComprCageBase cage_base,
-                         const SharedStringAccessGuardIfNeeded&);
+extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) void
+    String::WriteToFlat(Tagged<String> source, uint8_t* sink, int from, int to);
+extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) void
+    String::WriteToFlat(Tagged<String> source, uint16_t* sink, int from,
+                        int to);
+extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) void
+    String::WriteToFlat(Tagged<String> source, uint8_t* sink, int from, int to,
+                        PtrComprCageBase cage_base,
+                        const SharedStringAccessGuardIfNeeded&);
+extern template EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE) void
+    String::WriteToFlat(Tagged<String> source, uint16_t* sink, int from, int to,
+                        PtrComprCageBase cage_base,
+                        const SharedStringAccessGuardIfNeeded&);
 // clang-format on
 
 class SubStringRange {
  public:
-  inline SubStringRange(String string, const DisallowGarbageCollection& no_gc,
-                        int first = 0, int length = -1);
+  inline SubStringRange(Tagged<String> string,
+                        const DisallowGarbageCollection& no_gc, int first = 0,
+                        int length = -1);
   class iterator;
   inline iterator begin();
   inline iterator end();
@@ -783,7 +786,7 @@ class SeqOneByteString
   int AllocatedSize();
 
   // A SeqOneByteString have different maps depending on whether it is shared.
-  static inline bool IsCompatibleMap(Map map, ReadOnlyRoots roots);
+  static inline bool IsCompatibleMap(Tagged<Map> map, ReadOnlyRoots roots);
 
   class BodyDescriptor;
 
@@ -831,7 +834,7 @@ class SeqTwoByteString
   int AllocatedSize();
 
   // A SeqTwoByteString have different maps depending on whether it is shared.
-  static inline bool IsCompatibleMap(Map map, ReadOnlyRoots roots);
+  static inline bool IsCompatibleMap(Tagged<Map> map, ReadOnlyRoots roots);
 
   class BodyDescriptor;
 
@@ -850,11 +853,11 @@ class ConsString : public TorqueGeneratedConsString<ConsString, String> {
  public:
   // Doesn't check that the result is a string, even in debug mode.  This is
   // useful during GC where the mark bits confuse the checks.
-  inline Object unchecked_first() const;
+  inline Tagged<Object> unchecked_first() const;
 
   // Doesn't check that the result is a string, even in debug mode.  This is
   // useful during GC where the mark bits confuse the checks.
-  inline Object unchecked_second() const;
+  inline Tagged<Object> unchecked_second() const;
 
   V8_INLINE bool IsFlat(PtrComprCageBase cage_base) const;
 
@@ -882,7 +885,7 @@ class ConsString : public TorqueGeneratedConsString<ConsString, String> {
 // ThinStrings can be thought of as "one-part cons strings".
 class ThinString : public TorqueGeneratedThinString<ThinString, String> {
  public:
-  DECL_GETTER(unchecked_actual, HeapObject)
+  DECL_GETTER(unchecked_actual, Tagged<HeapObject>)
 
   V8_EXPORT_PRIVATE uint16_t
   Get(int index, PtrComprCageBase cage_base,
@@ -907,7 +910,7 @@ class ThinString : public TorqueGeneratedThinString<ThinString, String> {
 //  - truncating sliced string to enable otherwise unneeded parent to be GC'ed.
 class SlicedString : public TorqueGeneratedSlicedString<SlicedString, String> {
  public:
-  inline void set_parent(String parent,
+  inline void set_parent(Tagged<String> parent,
                          WriteBarrierMode mode = UPDATE_WRITE_BARRIER);
   // Dispatched behavior.
   V8_EXPORT_PRIVATE uint16_t
@@ -1084,12 +1087,13 @@ class V8_EXPORT_PRIVATE FlatStringReader : public Relocatable {
 class ConsStringIterator {
  public:
   inline ConsStringIterator() = default;
-  inline explicit ConsStringIterator(ConsString cons_string, int offset = 0) {
+  inline explicit ConsStringIterator(Tagged<ConsString> cons_string,
+                                     int offset = 0) {
     Reset(cons_string, offset);
   }
   ConsStringIterator(const ConsStringIterator&) = delete;
   ConsStringIterator& operator=(const ConsStringIterator&) = delete;
-  inline void Reset(ConsString cons_string, int offset = 0) {
+  inline void Reset(Tagged<ConsString> cons_string, int offset = 0) {
     depth_ = 0;
     // Next will always return nullptr.
     if (cons_string.is_null()) return;
@@ -1100,7 +1104,7 @@ class ConsStringIterator {
   // to match the offset passed into the constructor or Reset -- this will only
   // be non-zero immediately after construction or Reset, and only if those had
   // a non-zero offset.
-  inline String Next(int* offset_out) {
+  inline Tagged<String> Next(int* offset_out) {
     *offset_out = 0;
     if (depth_ == 0) return String();
     return Continue(offset_out);
@@ -1114,15 +1118,15 @@ class ConsStringIterator {
                 "kStackSize must be power of two");
   static inline int OffsetForDepth(int depth);
 
-  inline void PushLeft(ConsString string);
-  inline void PushRight(ConsString string);
+  inline void PushLeft(Tagged<ConsString> string);
+  inline void PushRight(Tagged<ConsString> string);
   inline void AdjustMaximumDepth();
   inline void Pop();
   inline bool StackBlown() { return maximum_depth_ - depth_ == kStackSize; }
-  V8_EXPORT_PRIVATE void Initialize(ConsString cons_string, int offset);
-  V8_EXPORT_PRIVATE String Continue(int* offset_out);
-  String NextLeaf(bool* blew_stack);
-  String Search(int* offset_out);
+  V8_EXPORT_PRIVATE void Initialize(Tagged<ConsString> cons_string, int offset);
+  V8_EXPORT_PRIVATE Tagged<String> Continue(int* offset_out);
+  Tagged<String> NextLeaf(bool* blew_stack);
+  Tagged<String> Search(int* offset_out);
 
   // Stack must always contain only frames for which right traversal
   // has not yet been performed.
diff --git a/deps/v8/src/objects/string.tq b/deps/v8/src/objects/string.tq
index 3a9ae8382c21bf..5cbddc7a0f6d33 100644
--- a/deps/v8/src/objects/string.tq
+++ b/deps/v8/src/objects/string.tq
@@ -16,18 +16,6 @@ extern class String extends Name {
     return this.StringInstanceType().is_not_internalized;
   }
 
-  // Keep this in sync with the C++ String::IsOneByteRepresentation.
-  macro IsOneByteRepresentation(): bool {
-    let s: String;
-    try {
-      const thin = Cast<ThinString>(this) otherwise NotThin;
-      s = thin.actual;
-    } label NotThin {
-      s = this;
-    }
-    return s.StringInstanceType().is_one_byte;
-  }
-
   // Keep this in sync with the C++ String::IsOneByteRepresentationUnderneath.
   macro IsOneByteRepresentationUnderneath(): bool {
     let string = this;
@@ -38,7 +26,11 @@ extern class String extends Name {
           string = cons.first;
         }
         case (thin: ThinString): {
-          string = thin.actual;
+          // Internalized strings can't change representation.
+          dcheck(
+              thin.StringInstanceType().is_one_byte ==
+              thin.actual.StringInstanceType().is_one_byte);
+          return thin.StringInstanceType().is_one_byte;
         }
         case (slice: SlicedString): {
           string = slice.parent;
@@ -131,13 +123,11 @@ extern class ExternalTwoByteString extends ExternalString {
 }
 
 @doNotGenerateCast
-extern class InternalizedString extends String {
-}
+extern class InternalizedString extends String {}
 
 @abstract
 @doNotGenerateCast
-extern class SeqString extends String {
-}
+extern class SeqString extends String {}
 @generateBodyDescriptor
 @doNotGenerateCast
 extern class SeqOneByteString extends SeqString {
@@ -170,7 +160,7 @@ macro AllocateNonEmptySeqOneByteString<Iterator: type>(
     length: uint32, content: Iterator): SeqOneByteString {
   dcheck(length != 0 && length <= kStringMaxLength);
   return new (ClearPadding) SeqOneByteString{
-    map: kOneByteStringMap,
+    map: kSeqOneByteStringMap,
     raw_hash_field: kNameEmptyHashField,
     length: Signed(length),
     chars: ...content
@@ -181,7 +171,7 @@ macro AllocateNonEmptySeqTwoByteString<Iterator: type>(
     length: uint32, content: Iterator): SeqTwoByteString {
   dcheck(length > 0 && length <= kStringMaxLength);
   return new (ClearPadding) SeqTwoByteString{
-    map: kStringMap,
+    map: kSeqTwoByteStringMap,
     raw_hash_field: kNameEmptyHashField,
     length: Signed(length),
     chars: ...content
@@ -208,12 +198,14 @@ macro AllocateSeqTwoByteString<Iterator: type>(
 }
 
 @export
-macro AllocateSeqOneByteString(length: uint32): SeqOneByteString|EmptyString {
+macro AllocateSeqOneByteString(length: uint32): SeqOneByteString|
+    EmptyString {
   return AllocateSeqOneByteString(length, UninitializedIterator{});
 }
 
 @export
-macro AllocateSeqTwoByteString(length: uint32): SeqTwoByteString|EmptyString {
+macro AllocateSeqTwoByteString(length: uint32): SeqTwoByteString|
+    EmptyString {
   return AllocateSeqTwoByteString(length, UninitializedIterator{});
 }
 
@@ -402,8 +394,9 @@ macro Call<A: type, B: type>(
       Convert<intptr>(self.fromIndex)));
 }
 
-macro AbstractStringIndexOf(implicit context: Context)(
-    string: String, searchString: String, fromIndex: Smi): Smi {
+macro AbstractStringIndexOf(
+    implicit context: Context)(string: String, searchString: String,
+    fromIndex: Smi): Smi {
   // Special case the empty string.
   const searchStringLength = searchString.length_intptr;
   const stringLength = string.length_intptr;
diff --git a/deps/v8/src/objects/struct-inl.h b/deps/v8/src/objects/struct-inl.h
index e0e5e1cd5a4022..61fe0eb91e29c2 100644
--- a/deps/v8/src/objects/struct-inl.h
+++ b/deps/v8/src/objects/struct-inl.h
@@ -28,11 +28,11 @@ NEVER_READ_ONLY_SPACE_IMPL(AccessorPair)
 
 TQ_OBJECT_CONSTRUCTORS_IMPL(ClassPositions)
 
-Object AccessorPair::get(AccessorComponent component) {
+Tagged<Object> AccessorPair::get(AccessorComponent component) {
   return component == ACCESSOR_GETTER ? getter() : setter();
 }
 
-void AccessorPair::set(AccessorComponent component, Object value) {
+void AccessorPair::set(AccessorComponent component, Tagged<Object> value) {
   if (component == ACCESSOR_GETTER) {
     set_getter(value);
   } else {
@@ -40,7 +40,7 @@ void AccessorPair::set(AccessorComponent component, Object value) {
   }
 }
 
-void AccessorPair::set(AccessorComponent component, Object value,
+void AccessorPair::set(AccessorComponent component, Tagged<Object> value,
                        ReleaseStoreTag tag) {
   if (component == ACCESSOR_GETTER) {
     set_getter(value, tag);
@@ -49,15 +49,16 @@ void AccessorPair::set(AccessorComponent component, Object value,
   }
 }
 
-RELEASE_ACQUIRE_ACCESSORS(AccessorPair, getter, Object, kGetterOffset)
-RELEASE_ACQUIRE_ACCESSORS(AccessorPair, setter, Object, kSetterOffset)
+RELEASE_ACQUIRE_ACCESSORS(AccessorPair, getter, Tagged<Object>, kGetterOffset)
+RELEASE_ACQUIRE_ACCESSORS(AccessorPair, setter, Tagged<Object>, kSetterOffset)
 
-void AccessorPair::SetComponents(Object getter, Object setter) {
-  if (!getter.IsNull()) set_getter(getter);
-  if (!setter.IsNull()) set_setter(setter);
+void AccessorPair::SetComponents(Tagged<Object> getter, Tagged<Object> setter) {
+  if (!IsNull(getter)) set_getter(getter);
+  if (!IsNull(setter)) set_setter(setter);
 }
 
-bool AccessorPair::Equals(Object getter_value, Object setter_value) {
+bool AccessorPair::Equals(Tagged<Object> getter_value,
+                          Tagged<Object> setter_value) {
   return (getter() == getter_value) && (setter() == setter_value);
 }
 
diff --git a/deps/v8/src/objects/struct.h b/deps/v8/src/objects/struct.h
index ac7498af1ca04e..4fc00fe45b1280 100644
--- a/deps/v8/src/objects/struct.h
+++ b/deps/v8/src/objects/struct.h
@@ -49,18 +49,18 @@ class AccessorPair : public TorqueGeneratedAccessorPair<AccessorPair, Struct> {
   NEVER_READ_ONLY_SPACE
   static Handle<AccessorPair> Copy(Isolate* isolate, Handle<AccessorPair> pair);
 
-  inline Object get(AccessorComponent component);
-  inline void set(AccessorComponent component, Object value);
-  inline void set(AccessorComponent component, Object value,
+  inline Tagged<Object> get(AccessorComponent component);
+  inline void set(AccessorComponent component, Tagged<Object> value);
+  inline void set(AccessorComponent component, Tagged<Object> value,
                   ReleaseStoreTag tag);
 
   using TorqueGeneratedAccessorPair::getter;
   using TorqueGeneratedAccessorPair::set_getter;
-  DECL_RELEASE_ACQUIRE_ACCESSORS(getter, Object)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(getter, Tagged<Object>)
 
   using TorqueGeneratedAccessorPair::set_setter;
   using TorqueGeneratedAccessorPair::setter;
-  DECL_RELEASE_ACQUIRE_ACCESSORS(setter, Object)
+  DECL_RELEASE_ACQUIRE_ACCESSORS(setter, Tagged<Object>)
 
   // Note: Returns undefined if the component is not set.
   static Handle<Object> GetComponent(Isolate* isolate,
@@ -69,9 +69,9 @@ class AccessorPair : public TorqueGeneratedAccessorPair<AccessorPair, Struct> {
                                      AccessorComponent component);
 
   // Set both components, skipping arguments which are a JavaScript null.
-  inline void SetComponents(Object getter, Object setter);
+  inline void SetComponents(Tagged<Object> getter, Tagged<Object> setter);
 
-  inline bool Equals(Object getter_value, Object setter_value);
+  inline bool Equals(Tagged<Object> getter_value, Tagged<Object> setter_value);
 
   using BodyDescriptor = StructBodyDescriptor;
 
diff --git a/deps/v8/src/objects/struct.tq b/deps/v8/src/objects/struct.tq
index 9c87663fd221a1..d91ce535b2a762 100644
--- a/deps/v8/src/objects/struct.tq
+++ b/deps/v8/src/objects/struct.tq
@@ -3,8 +3,7 @@
 // found in the LICENSE file.
 
 @abstract
-extern class Struct extends HeapObject {
-}
+extern class Struct extends HeapObject {}
 
 extern class Tuple2 extends Struct {
   value1: Object;
diff --git a/deps/v8/src/objects/swiss-name-dictionary-inl.h b/deps/v8/src/objects/swiss-name-dictionary-inl.h
index b0f2c2e6b5054d..ac5ac969e085ef 100644
--- a/deps/v8/src/objects/swiss-name-dictionary-inl.h
+++ b/deps/v8/src/objects/swiss-name-dictionary-inl.h
@@ -148,10 +148,11 @@ void SwissNameDictionary::SetEntryForEnumerationIndex(int enumeration_index,
 }
 
 template <typename IsolateT>
-InternalIndex SwissNameDictionary::FindEntry(IsolateT* isolate, Object key) {
-  Name name = Name::cast(key);
-  DCHECK(name.IsUniqueName());
-  uint32_t hash = name.hash();
+InternalIndex SwissNameDictionary::FindEntry(IsolateT* isolate,
+                                             Tagged<Object> key) {
+  Tagged<Name> name = Name::cast(key);
+  DCHECK(IsUniqueName(name));
+  uint32_t hash = name->hash();
 
   // We probe the hash table in groups of |kGroupWidth| buckets. One bucket
   // corresponds to a 1-byte entry in the control table.
@@ -180,7 +181,7 @@ InternalIndex SwissNameDictionary::FindEntry(IsolateT* isolate, Object key) {
     Group g{ctrl + seq.offset()};
     for (int i : g.Match(swiss_table::H2(hash))) {
       int candidate_entry = seq.offset(i);
-      Object candidate_key = KeyAt(candidate_entry);
+      Tagged<Object> candidate_key = KeyAt(candidate_entry);
       // This key matching is SwissNameDictionary specific!
       if (candidate_key == key) return InternalIndex(candidate_entry);
     }
@@ -218,12 +219,13 @@ InternalIndex SwissNameDictionary::FindEntry(IsolateT* isolate,
   return FindEntry(isolate, *key);
 }
 
-Object SwissNameDictionary::LoadFromDataTable(int entry, int data_offset) {
+Tagged<Object> SwissNameDictionary::LoadFromDataTable(int entry,
+                                                      int data_offset) {
   return LoadFromDataTable(GetPtrComprCageBase(*this), entry, data_offset);
 }
 
-Object SwissNameDictionary::LoadFromDataTable(PtrComprCageBase cage_base,
-                                              int entry, int data_offset) {
+Tagged<Object> SwissNameDictionary::LoadFromDataTable(
+    PtrComprCageBase cage_base, int entry, int data_offset) {
   DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(Capacity()));
   int offset = DataTableStartOffset() +
                (entry * kDataTableEntryCount + data_offset) * kTaggedSize;
@@ -231,7 +233,7 @@ Object SwissNameDictionary::LoadFromDataTable(PtrComprCageBase cage_base,
 }
 
 void SwissNameDictionary::StoreToDataTable(int entry, int data_offset,
-                                           Object data) {
+                                           Tagged<Object> data) {
   DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(Capacity()));
 
   int offset = DataTableStartOffset() +
@@ -242,7 +244,7 @@ void SwissNameDictionary::StoreToDataTable(int entry, int data_offset,
 }
 
 void SwissNameDictionary::StoreToDataTableNoBarrier(int entry, int data_offset,
-                                                    Object data) {
+                                                    Tagged<Object> data) {
   DCHECK_LT(static_cast<unsigned>(entry), static_cast<unsigned>(Capacity()));
 
   int offset = DataTableStartOffset() +
@@ -258,17 +260,18 @@ void SwissNameDictionary::ClearDataTableEntry(Isolate* isolate, int entry) {
   StoreToDataTable(entry, kDataTableValueEntryIndex, roots.the_hole_value());
 }
 
-void SwissNameDictionary::ValueAtPut(int entry, Object value) {
-  DCHECK(!value.IsTheHole());
+void SwissNameDictionary::ValueAtPut(int entry, Tagged<Object> value) {
+  DCHECK(!IsTheHole(value));
   StoreToDataTable(entry, kDataTableValueEntryIndex, value);
 }
 
-void SwissNameDictionary::ValueAtPut(InternalIndex entry, Object value) {
+void SwissNameDictionary::ValueAtPut(InternalIndex entry,
+                                     Tagged<Object> value) {
   ValueAtPut(entry.as_int(), value);
 }
 
-void SwissNameDictionary::SetKey(int entry, Object key) {
-  DCHECK(!key.IsTheHole());
+void SwissNameDictionary::SetKey(int entry, Tagged<Object> key) {
+  DCHECK(!IsTheHole(key));
   StoreToDataTable(entry, kDataTableKeyEntryIndex, key);
 }
 
@@ -283,34 +286,35 @@ void SwissNameDictionary::DetailsAtPut(InternalIndex entry,
   DetailsAtPut(entry.as_int(), details);
 }
 
-Object SwissNameDictionary::KeyAt(int entry) {
+Tagged<Object> SwissNameDictionary::KeyAt(int entry) {
   return LoadFromDataTable(entry, kDataTableKeyEntryIndex);
 }
 
-Object SwissNameDictionary::KeyAt(InternalIndex entry) {
+Tagged<Object> SwissNameDictionary::KeyAt(InternalIndex entry) {
   return KeyAt(entry.as_int());
 }
 
-Name SwissNameDictionary::NameAt(InternalIndex entry) {
+Tagged<Name> SwissNameDictionary::NameAt(InternalIndex entry) {
   return Name::cast(KeyAt(entry));
 }
 
 // This version can be called on empty buckets.
-Object SwissNameDictionary::ValueAtRaw(int entry) {
+Tagged<Object> SwissNameDictionary::ValueAtRaw(int entry) {
   return LoadFromDataTable(entry, kDataTableValueEntryIndex);
 }
 
-Object SwissNameDictionary::ValueAt(InternalIndex entry) {
+Tagged<Object> SwissNameDictionary::ValueAt(InternalIndex entry) {
   DCHECK(IsFull(GetCtrl(entry.as_int())));
   return ValueAtRaw(entry.as_int());
 }
 
-base::Optional<Object> SwissNameDictionary::TryValueAt(InternalIndex entry) {
+base::Optional<Tagged<Object>> SwissNameDictionary::TryValueAt(
+    InternalIndex entry) {
 #if DEBUG
   Isolate* isolate;
   GetIsolateFromHeapObject(*this, &isolate);
   DCHECK_NE(isolate, nullptr);
-  SLOW_DCHECK(!isolate->heap()->IsPendingAllocation(*this));
+  SLOW_DCHECK(!isolate->heap()->IsPendingAllocation(Tagged(*this)));
 #endif  // DEBUG
   // We can read Capacity() in a non-atomic way since we are reading an
   // initialized object which is not pending allocation.
@@ -407,7 +411,7 @@ void SwissNameDictionary::SetMetaTableField(int field_index, int value) {
   // |kMax2ByteMetaTableCapacity| in the .cc file for an explanation of these
   // constants.
   int capacity = Capacity();
-  ByteArray meta_table = this->meta_table();
+  Tagged<ByteArray> meta_table = this->meta_table();
   if (capacity <= kMax1ByteMetaTableCapacity) {
     SetMetaTableField<uint8_t>(meta_table, field_index, value);
   } else if (capacity <= kMax2ByteMetaTableCapacity) {
@@ -422,7 +426,7 @@ int SwissNameDictionary::GetMetaTableField(int field_index) {
   // |kMax2ByteMetaTableCapacity| in the .cc file for an explanation of these
   // constants.
   int capacity = Capacity();
-  ByteArray meta_table = this->meta_table();
+  Tagged<ByteArray> meta_table = this->meta_table();
   if (capacity <= kMax1ByteMetaTableCapacity) {
     return GetMetaTableField<uint8_t>(meta_table, field_index);
   } else if (capacity <= kMax2ByteMetaTableCapacity) {
@@ -434,28 +438,28 @@ int SwissNameDictionary::GetMetaTableField(int field_index) {
 
 // static
 template <typename T>
-void SwissNameDictionary::SetMetaTableField(ByteArray meta_table,
+void SwissNameDictionary::SetMetaTableField(Tagged<ByteArray> meta_table,
                                             int field_index, int value) {
   static_assert((std::is_same<T, uint8_t>::value) ||
                 (std::is_same<T, uint16_t>::value) ||
                 (std::is_same<T, uint32_t>::value));
   DCHECK_LE(value, std::numeric_limits<T>::max());
-  DCHECK_LT(meta_table.GetDataStartAddress() + field_index * sizeof(T),
-            meta_table.GetDataEndAddress());
-  T* raw_data = reinterpret_cast<T*>(meta_table.GetDataStartAddress());
+  DCHECK_LT(meta_table->GetDataStartAddress() + field_index * sizeof(T),
+            meta_table->GetDataEndAddress());
+  T* raw_data = reinterpret_cast<T*>(meta_table->GetDataStartAddress());
   raw_data[field_index] = value;
 }
 
 // static
 template <typename T>
-int SwissNameDictionary::GetMetaTableField(ByteArray meta_table,
+int SwissNameDictionary::GetMetaTableField(Tagged<ByteArray> meta_table,
                                            int field_index) {
   static_assert((std::is_same<T, uint8_t>::value) ||
                 (std::is_same<T, uint16_t>::value) ||
                 (std::is_same<T, uint32_t>::value));
-  DCHECK_LT(meta_table.GetDataStartAddress() + field_index * sizeof(T),
-            meta_table.GetDataEndAddress());
-  T* raw_data = reinterpret_cast<T*>(meta_table.GetDataStartAddress());
+  DCHECK_LT(meta_table->GetDataStartAddress() + field_index * sizeof(T),
+            meta_table->GetDataEndAddress());
+  T* raw_data = reinterpret_cast<T*>(meta_table->GetDataStartAddress());
   return raw_data[field_index];
 }
 
@@ -486,20 +490,21 @@ constexpr int SwissNameDictionary::MetaTableSizeFor(int capacity) {
   return per_entry_size * (MaxUsableCapacity(capacity) + 2);
 }
 
-bool SwissNameDictionary::IsKey(ReadOnlyRoots roots, Object key_candidate) {
+bool SwissNameDictionary::IsKey(ReadOnlyRoots roots,
+                                Tagged<Object> key_candidate) {
   return key_candidate != roots.the_hole_value();
 }
 
 bool SwissNameDictionary::ToKey(ReadOnlyRoots roots, int entry,
-                                Object* out_key) {
-  Object k = KeyAt(entry);
+                                Tagged<Object>* out_key) {
+  Tagged<Object> k = KeyAt(entry);
   if (!IsKey(roots, k)) return false;
   *out_key = k;
   return true;
 }
 
 bool SwissNameDictionary::ToKey(ReadOnlyRoots roots, InternalIndex entry,
-                                Object* out_key) {
+                                Tagged<Object>* out_key) {
   return ToKey(roots, entry.as_int(), out_key);
 }
 
@@ -513,15 +518,15 @@ Handle<SwissNameDictionary> SwissNameDictionary::Add(
 
   Handle<SwissNameDictionary> table = EnsureGrowable(isolate, original_table);
   DisallowGarbageCollection no_gc;
-  auto raw_table = *table;
-  int nof = raw_table.NumberOfElements();
-  int nod = raw_table.NumberOfDeletedElements();
+  Tagged<SwissNameDictionary> raw_table = *table;
+  int nof = raw_table->NumberOfElements();
+  int nod = raw_table->NumberOfDeletedElements();
   int new_enum_index = nof + nod;
 
-  int new_entry = raw_table.AddInternal(*key, *value, details);
+  int new_entry = raw_table->AddInternal(*key, *value, details);
 
-  raw_table.SetNumberOfElements(nof + 1);
-  raw_table.SetEntryForEnumerationIndex(new_enum_index, new_entry);
+  raw_table->SetNumberOfElements(nof + 1);
+  raw_table->SetEntryForEnumerationIndex(new_enum_index, new_entry);
 
   if (entry_out) {
     *entry_out = InternalIndex(new_entry);
@@ -530,14 +535,14 @@ Handle<SwissNameDictionary> SwissNameDictionary::Add(
   return table;
 }
 
-int SwissNameDictionary::AddInternal(Name key, Object value,
+int SwissNameDictionary::AddInternal(Tagged<Name> key, Tagged<Object> value,
                                      PropertyDetails details) {
   DisallowHeapAllocation no_gc;
 
-  DCHECK(key.IsUniqueName());
+  DCHECK(IsUniqueName(key));
   DCHECK_LE(UsedCapacity(), MaxUsableCapacity(Capacity()));
 
-  uint32_t hash = key.hash();
+  uint32_t hash = key->hash();
 
   // For now we don't re-use deleted buckets (due to enumeration table
   // complications), which is why we only look for empty buckets here, not
@@ -556,7 +561,8 @@ int SwissNameDictionary::AddInternal(Name key, Object value,
 }
 
 template <typename IsolateT>
-void SwissNameDictionary::Initialize(IsolateT* isolate, ByteArray meta_table,
+void SwissNameDictionary::Initialize(IsolateT* isolate,
+                                     Tagged<ByteArray> meta_table,
                                      int capacity) {
   DCHECK(IsValidCapacity(capacity));
   DisallowHeapAllocation no_gc;
@@ -752,9 +758,9 @@ SwissNameDictionary::probe(uint32_t hash, int capacity) {
       swiss_table::H1(hash), static_cast<uint32_t>(non_zero_capacity - 1));
 }
 
-ACCESSORS_CHECKED2(SwissNameDictionary, meta_table, ByteArray,
+ACCESSORS_CHECKED2(SwissNameDictionary, meta_table, Tagged<ByteArray>,
                    MetaTablePointerOffset(), true,
-                   value.length() >= kMetaTableEnumerationDataStartIndex)
+                   value->length() >= kMetaTableEnumerationDataStartIndex)
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/objects/swiss-name-dictionary.cc b/deps/v8/src/objects/swiss-name-dictionary.cc
index 5ecdb3a3f79cdd..58cea8313659b7 100644
--- a/deps/v8/src/objects/swiss-name-dictionary.cc
+++ b/deps/v8/src/objects/swiss-name-dictionary.cc
@@ -57,10 +57,10 @@ Handle<SwissNameDictionary> SwissNameDictionary::Rehash(
   for (int enum_index = 0; enum_index < table->UsedCapacity(); ++enum_index) {
     int entry = table->EntryForEnumerationIndex(enum_index);
 
-    Object key;
+    Tagged<Object> key;
 
     if (table->ToKey(roots, entry, &key)) {
-      Object value = table->ValueAtRaw(entry);
+      Tagged<Object> value = table->ValueAtRaw(entry);
       PropertyDetails details = table->DetailsAt(entry);
 
       int new_entry = new_table->AddInternal(Name::cast(key), value, details);
@@ -77,29 +77,29 @@ Handle<SwissNameDictionary> SwissNameDictionary::Rehash(
   return new_table;
 }
 
-bool SwissNameDictionary::EqualsForTesting(SwissNameDictionary other) {
-  if (Capacity() != other.Capacity() ||
-      NumberOfElements() != other.NumberOfElements() ||
-      NumberOfDeletedElements() != other.NumberOfDeletedElements() ||
-      Hash() != other.Hash()) {
+bool SwissNameDictionary::EqualsForTesting(Tagged<SwissNameDictionary> other) {
+  if (Capacity() != other->Capacity() ||
+      NumberOfElements() != other->NumberOfElements() ||
+      NumberOfDeletedElements() != other->NumberOfDeletedElements() ||
+      Hash() != other->Hash()) {
     return false;
   }
 
   for (int i = 0; i < Capacity() + kGroupWidth; i++) {
-    if (CtrlTable()[i] != other.CtrlTable()[i]) {
+    if (CtrlTable()[i] != other->CtrlTable()[i]) {
       return false;
     }
   }
   for (int i = 0; i < Capacity(); i++) {
-    if (KeyAt(i) != other.KeyAt(i) || ValueAtRaw(i) != other.ValueAtRaw(i)) {
+    if (KeyAt(i) != other->KeyAt(i) || ValueAtRaw(i) != other->ValueAtRaw(i)) {
       return false;
     }
     if (IsFull(GetCtrl(i))) {
-      if (DetailsAt(i) != other.DetailsAt(i)) return false;
+      if (DetailsAt(i) != other->DetailsAt(i)) return false;
     }
   }
   for (int i = 0; i < UsedCapacity(); i++) {
-    if (EntryForEnumerationIndex(i) != other.EntryForEnumerationIndex(i)) {
+    if (EntryForEnumerationIndex(i) != other->EntryForEnumerationIndex(i)) {
       return false;
     }
   }
@@ -145,8 +145,8 @@ Handle<SwissNameDictionary> SwissNameDictionary::ShallowCopy(
 
     // We may have to trigger write barriers when copying the data table.
     for (int i = 0; i < capacity; ++i) {
-      Object key = table->KeyAt(i);
-      Object value = table->ValueAtRaw(i);
+      Tagged<Object> key = table->KeyAt(i);
+      Tagged<Object> value = table->ValueAtRaw(i);
 
       // Cannot use SetKey/ValueAtPut because they don't accept the hole as data
       // to store.
@@ -170,8 +170,8 @@ Handle<SwissNameDictionary> SwissNameDictionary::ShallowCopy(
   // where size of each entry depends on table capacity.
   int size_per_meta_table_entry = MetaTableSizePerEntryFor(capacity);
   int meta_table_used_bytes = (2 + used_capacity) * size_per_meta_table_entry;
-  new_table->meta_table().copy_in(0, table->meta_table().GetDataStartAddress(),
-                                  meta_table_used_bytes);
+  new_table->meta_table()->copy_in(
+      0, table->meta_table()->GetDataStartAddress(), meta_table_used_bytes);
 
   return new_table;
 }
@@ -226,7 +226,7 @@ void SwissNameDictionary::Rehash(IsolateT* isolate) {
   int data_index = 0;
   for (int enum_index = 0; enum_index < UsedCapacity(); ++enum_index) {
     int entry = EntryForEnumerationIndex(enum_index);
-    Object key;
+    Tagged<Object> key;
     if (!ToKey(roots, entry, &key)) continue;
 
     data[data_index++] =
@@ -255,9 +255,9 @@ int SwissNameDictionary::NumberOfEnumerableProperties() {
   ReadOnlyRoots roots = this->GetReadOnlyRoots();
   int result = 0;
   for (InternalIndex i : this->IterateEntries()) {
-    Object k;
+    Tagged<Object> k;
     if (!this->ToKey(roots, i, &k)) continue;
-    if (k.FilterKey(ENUMERABLE_STRINGS)) continue;
+    if (Object::FilterKey(k, ENUMERABLE_STRINGS)) continue;
     PropertyDetails details = this->DetailsAt(i);
     PropertyAttributes attr = details.attributes();
     if ((int{attr} & ONLY_ENUMERABLE) == 0) result++;
@@ -268,12 +268,13 @@ int SwissNameDictionary::NumberOfEnumerableProperties() {
 // TODO(emrich, v8:11388): This is almost an identical copy of
 // Dictionary<..>::SlowReverseLookup. Consolidate both versions elsewhere (e.g.,
 // hash-table-utils)?
-Object SwissNameDictionary::SlowReverseLookup(Isolate* isolate, Object value) {
+Tagged<Object> SwissNameDictionary::SlowReverseLookup(Isolate* isolate,
+                                                      Tagged<Object> value) {
   ReadOnlyRoots roots(isolate);
   for (InternalIndex i : IterateEntries()) {
-    Object k;
+    Tagged<Object> k;
     if (!ToKey(roots, i, &k)) continue;
-    Object e = this->ValueAt(i);
+    Tagged<Object> e = this->ValueAt(i);
     if (e == value) return k;
   }
   return roots.undefined_value();
@@ -296,9 +297,9 @@ static_assert(SwissNameDictionary::MaxUsableCapacity(
               std::numeric_limits<uint16_t>::max());
 
 template V8_EXPORT_PRIVATE void SwissNameDictionary::Initialize(
-    Isolate* isolate, ByteArray meta_table, int capacity);
+    Isolate* isolate, Tagged<ByteArray> meta_table, int capacity);
 template V8_EXPORT_PRIVATE void SwissNameDictionary::Initialize(
-    LocalIsolate* isolate, ByteArray meta_table, int capacity);
+    LocalIsolate* isolate, Tagged<ByteArray> meta_table, int capacity);
 
 template V8_EXPORT_PRIVATE Handle<SwissNameDictionary>
 SwissNameDictionary::Rehash(LocalIsolate* isolate,
diff --git a/deps/v8/src/objects/swiss-name-dictionary.h b/deps/v8/src/objects/swiss-name-dictionary.h
index d2588942a0f109..12976026d880aa 100644
--- a/deps/v8/src/objects/swiss-name-dictionary.h
+++ b/deps/v8/src/objects/swiss-name-dictionary.h
@@ -86,7 +86,7 @@ class V8_EXPORT_PRIVATE SwissNameDictionary : public HeapObject {
       Isolate* isolate, Handle<SwissNameDictionary> table, InternalIndex entry);
 
   template <typename IsolateT>
-  inline InternalIndex FindEntry(IsolateT* isolate, Object key);
+  inline InternalIndex FindEntry(IsolateT* isolate, Tagged<Object> key);
 
   // This is to make the interfaces of NameDictionary::FindEntry and
   // OrderedNameDictionary::FindEntry compatible.
@@ -96,17 +96,18 @@ class V8_EXPORT_PRIVATE SwissNameDictionary : public HeapObject {
   template <typename IsolateT>
   inline InternalIndex FindEntry(IsolateT* isolate, Handle<Object> key);
 
-  static inline bool IsKey(ReadOnlyRoots roots, Object key_candidate);
-  inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry, Object* out_key);
+  static inline bool IsKey(ReadOnlyRoots roots, Tagged<Object> key_candidate);
+  inline bool ToKey(ReadOnlyRoots roots, InternalIndex entry,
+                    Tagged<Object>* out_key);
 
-  inline Object KeyAt(InternalIndex entry);
-  inline Name NameAt(InternalIndex entry);
-  inline Object ValueAt(InternalIndex entry);
+  inline Tagged<Object> KeyAt(InternalIndex entry);
+  inline Tagged<Name> NameAt(InternalIndex entry);
+  inline Tagged<Object> ValueAt(InternalIndex entry);
   // Returns {} if we would be reading out of the bounds of the object.
-  inline base::Optional<Object> TryValueAt(InternalIndex entry);
+  inline base::Optional<Tagged<Object>> TryValueAt(InternalIndex entry);
   inline PropertyDetails DetailsAt(InternalIndex entry);
 
-  inline void ValueAtPut(InternalIndex entry, Object value);
+  inline void ValueAtPut(InternalIndex entry, Tagged<Object> value);
   inline void DetailsAtPut(InternalIndex entry, PropertyDetails value);
 
   inline int NumberOfElements();
@@ -118,8 +119,8 @@ class V8_EXPORT_PRIVATE SwissNameDictionary : public HeapObject {
   int NumberOfEnumerableProperties();
 
   // TODO(pthier): Add flags (similar to NamedDictionary) also for swiss dicts.
-  inline bool may_have_interesting_symbols() { UNREACHABLE(); }
-  inline void set_may_have_interesting_symbols(bool value) { UNREACHABLE(); }
+  inline bool may_have_interesting_properties() { UNREACHABLE(); }
+  inline void set_may_have_interesting_properties(bool value) { UNREACHABLE(); }
 
   static Handle<SwissNameDictionary> ShallowCopy(
       Isolate* isolate, Handle<SwissNameDictionary> table);
@@ -128,10 +129,11 @@ class V8_EXPORT_PRIVATE SwissNameDictionary : public HeapObject {
   // |this| and |other| is the same. The only exceptions are the meta table
   // pointer (which must differ  between the two tables) and PropertyDetails of
   // deleted entries (which reside in initialized memory, but are not compared).
-  bool EqualsForTesting(SwissNameDictionary other);
+  bool EqualsForTesting(Tagged<SwissNameDictionary> other);
 
   template <typename IsolateT>
-  void Initialize(IsolateT* isolate, ByteArray meta_table, int capacity);
+  void Initialize(IsolateT* isolate, Tagged<ByteArray> meta_table,
+                  int capacity);
 
   template <typename IsolateT>
   static Handle<SwissNameDictionary> Rehash(IsolateT* isolate,
@@ -143,7 +145,7 @@ class V8_EXPORT_PRIVATE SwissNameDictionary : public HeapObject {
   inline void SetHash(int hash);
   inline int Hash();
 
-  Object SlowReverseLookup(Isolate* isolate, Object value);
+  Tagged<Object> SlowReverseLookup(Isolate* isolate, Tagged<Object> value);
 
   class IndexIterator {
    public:
@@ -280,23 +282,24 @@ class V8_EXPORT_PRIVATE SwissNameDictionary : public HeapObject {
 
   // Sets key and value to the hole for the given entry.
   inline void ClearDataTableEntry(Isolate* isolate, int entry);
-  inline void SetKey(int entry, Object key);
+  inline void SetKey(int entry, Tagged<Object> key);
 
   inline void DetailsAtPut(int entry, PropertyDetails value);
-  inline void ValueAtPut(int entry, Object value);
+  inline void ValueAtPut(int entry, Tagged<Object> value);
 
   inline PropertyDetails DetailsAt(int entry);
-  inline Object ValueAtRaw(int entry);
-  inline Object KeyAt(int entry);
+  inline Tagged<Object> ValueAtRaw(int entry);
+  inline Tagged<Object> KeyAt(int entry);
 
-  inline bool ToKey(ReadOnlyRoots roots, int entry, Object* out_key);
+  inline bool ToKey(ReadOnlyRoots roots, int entry, Tagged<Object>* out_key);
 
   inline int FindFirstEmpty(uint32_t hash);
   // Adds |key| ->  (|value|, |details|) as a new mapping to the table, which
   // must have sufficient room. Returns the entry (= bucket) used by the new
   // mapping. Does not update the number of present entries or the
   // enumeration table.
-  inline int AddInternal(Name key, Object value, PropertyDetails details);
+  inline int AddInternal(Tagged<Name> key, Tagged<Object> value,
+                         PropertyDetails details);
 
   // Use |set_ctrl| for modifications whenever possible, since that function
   // correctly maintains the copy of the first group at the end of the ctrl
@@ -313,12 +316,12 @@ class V8_EXPORT_PRIVATE SwissNameDictionary : public HeapObject {
   inline void SetCtrl(int entry, ctrl_t h);
   inline ctrl_t GetCtrl(int entry);
 
-  inline Object LoadFromDataTable(int entry, int data_offset);
-  inline Object LoadFromDataTable(PtrComprCageBase cage_base, int entry,
-                                  int data_offset);
-  inline void StoreToDataTable(int entry, int data_offset, Object data);
+  inline Tagged<Object> LoadFromDataTable(int entry, int data_offset);
+  inline Tagged<Object> LoadFromDataTable(PtrComprCageBase cage_base, int entry,
+                                          int data_offset);
+  inline void StoreToDataTable(int entry, int data_offset, Tagged<Object> data);
   inline void StoreToDataTableNoBarrier(int entry, int data_offset,
-                                        Object data);
+                                        Tagged<Object> data);
 
   inline void SetCapacity(int capacity);
   inline void SetNumberOfElements(int elements);
@@ -331,15 +334,16 @@ class V8_EXPORT_PRIVATE SwissNameDictionary : public HeapObject {
   // given bucket of the data table.
   inline void SetEntryForEnumerationIndex(int enumeration_index, int entry);
 
-  DECL_ACCESSORS(meta_table, ByteArray)
+  DECL_ACCESSORS(meta_table, Tagged<ByteArray>)
   inline void SetMetaTableField(int field_index, int value);
   inline int GetMetaTableField(int field_index);
 
   template <typename T>
-  inline static void SetMetaTableField(ByteArray meta_table, int field_index,
-                                       int value);
+  inline static void SetMetaTableField(Tagged<ByteArray> meta_table,
+                                       int field_index, int value);
   template <typename T>
-  inline static int GetMetaTableField(ByteArray meta_table, int field_index);
+  inline static int GetMetaTableField(Tagged<ByteArray> meta_table,
+                                      int field_index);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/swiss-name-dictionary.tq b/deps/v8/src/objects/swiss-name-dictionary.tq
index 4f7e2e550065fa..cc9b765500e1b8 100644
--- a/deps/v8/src/objects/swiss-name-dictionary.tq
+++ b/deps/v8/src/objects/swiss-name-dictionary.tq
@@ -39,25 +39,23 @@ extern macro SwissNameDictionarySetCtrl(
 extern macro StoreSwissNameDictionaryPropertyDetails(
     SwissNameDictionary, intptr, intptr, uint8): void;
 
-extern macro
-SwissNameDictionaryIncreaseElementCountOrBailout(
+extern macro SwissNameDictionaryIncreaseElementCountOrBailout(
     ByteArray, intptr, uint32): uint32 labels Bailout;
 
-extern macro
-StoreSwissNameDictionaryEnumToEntryMapping(
+extern macro StoreSwissNameDictionaryEnumToEntryMapping(
     SwissNameDictionary, intptr, intptr, int32): void;
 
-extern macro
-SwissNameDictionaryUpdateCountsForDeletion(ByteArray, intptr): uint32;
+extern macro SwissNameDictionaryUpdateCountsForDeletion(ByteArray, intptr):
+    uint32;
 
 namespace runtime {
 extern runtime SwissTableFindEntry(NoContext, SwissNameDictionary, Name): Smi;
 
-extern runtime SwissTableAdd(
-    NoContext, SwissNameDictionary, Name, Object, Smi): SwissNameDictionary;
+extern runtime SwissTableAdd(NoContext, SwissNameDictionary, Name, Object, Smi):
+    SwissNameDictionary;
 
-extern runtime ShrinkSwissNameDictionary(
-    NoContext, SwissNameDictionary): SwissNameDictionary;
+extern runtime ShrinkSwissNameDictionary(NoContext, SwissNameDictionary):
+    SwissNameDictionary;
 }
 
 // Counterpart for SwissNameDictionary::CapacityFor in C++.
@@ -151,8 +149,8 @@ macro Probe(hash: uint32, mask: uint32): ProbeSequence {
   return ProbeSequence{mask: mask, offset: H1(hash) & mask, index: 0};
 }
 
-macro FindEntry<GroupLoader: type>(
-    table: SwissNameDictionary, key: Name): never labels
+macro FindEntry<GroupLoader: type>(table: SwissNameDictionary, key: Name):
+    never labels
 Found(intptr), NotFound {
   const hash: uint32 = LoadNameHash(key);
   const capacity: int32 = table.capacity;
@@ -277,8 +275,9 @@ macro SwissNameDictionaryDelete(table: SwissNameDictionary, entry: intptr):
 // not generated, even if the branch can be resolved at compile time. This means
 // that we end up trying to generate unused code using unsupported instructions.
 @export
-macro SwissNameDictionaryFindEntrySIMD(table: SwissNameDictionary, key: Name):
-    never labels Found(intptr), NotFound {
+macro SwissNameDictionaryFindEntrySIMD(
+    table: SwissNameDictionary, key: Name): never labels Found(intptr),
+    NotFound {
   FindEntry<GroupSse2Loader>(table, key)
       otherwise Found, NotFound;
 }
diff --git a/deps/v8/src/objects/symbol-table.cc b/deps/v8/src/objects/symbol-table.cc
index 4dcce78d6da8f9..41200b68ced805 100644
--- a/deps/v8/src/objects/symbol-table.cc
+++ b/deps/v8/src/objects/symbol-table.cc
@@ -7,12 +7,12 @@
 namespace v8 {
 namespace internal {
 
-Object RegisteredSymbolTable::SlowReverseLookup(Object value) {
+Tagged<Object> RegisteredSymbolTable::SlowReverseLookup(Tagged<Object> value) {
   ReadOnlyRoots roots = this->GetReadOnlyRoots();
   for (InternalIndex i : this->IterateEntries()) {
-    Object k;
+    Tagged<Object> k;
     if (!this->ToKey(roots, i, &k)) continue;
-    Object e = this->ValueAt(i);
+    Tagged<Object> e = this->ValueAt(i);
     if (e == value) return k;
   }
   return roots.undefined_value();
diff --git a/deps/v8/src/objects/synthetic-module.cc b/deps/v8/src/objects/synthetic-module.cc
index b5951d10f6132e..ba611449a23563 100644
--- a/deps/v8/src/objects/synthetic-module.cc
+++ b/deps/v8/src/objects/synthetic-module.cc
@@ -25,14 +25,14 @@ Maybe<bool> SyntheticModule::SetExport(Isolate* isolate,
   Handle<ObjectHashTable> exports(module->exports(), isolate);
   Handle<Object> export_object(exports->Lookup(export_name), isolate);
 
-  if (!export_object->IsCell()) {
+  if (!IsCell(*export_object)) {
     isolate->Throw(*isolate->factory()->NewReferenceError(
         MessageTemplate::kModuleExportUndefined, export_name));
     return Nothing<bool>();
   }
 
   // Spec step 2: Set the mutable binding of export_name to export_value
-  Cell::cast(*export_object).set_value(*export_value);
+  Cell::cast(*export_object)->set_value(*export_value);
 
   return Just(true);
 }
@@ -43,7 +43,7 @@ void SyntheticModule::SetExportStrict(Isolate* isolate,
                                       Handle<Object> export_value) {
   Handle<ObjectHashTable> exports(module->exports(), isolate);
   Handle<Object> export_object(exports->Lookup(export_name), isolate);
-  CHECK(export_object->IsCell());
+  CHECK(IsCell(*export_object));
   Maybe<bool> set_export_result =
       SetExport(isolate, module, export_name, export_value);
   CHECK(set_export_result.FromJust());
@@ -55,8 +55,8 @@ MaybeHandle<Cell> SyntheticModule::ResolveExport(
     Isolate* isolate, Handle<SyntheticModule> module,
     Handle<String> module_specifier, Handle<String> export_name,
     MessageLocation loc, bool must_resolve) {
-  Handle<Object> object(module->exports().Lookup(export_name), isolate);
-  if (object->IsCell()) return Handle<Cell>::cast(object);
+  Handle<Object> object(module->exports()->Lookup(export_name), isolate);
+  if (IsCell(*object)) return Handle<Cell>::cast(object);
 
   if (!must_resolve) return MaybeHandle<Cell>();
 
@@ -79,7 +79,7 @@ bool SyntheticModule::PrepareInstantiate(Isolate* isolate,
     // Spec step 7.2: Initialize the new mutable binding to undefined.
     Handle<Cell> cell = isolate->factory()->NewCell();
     Handle<String> name(String::cast(export_names->get(i)), isolate);
-    CHECK(exports->Lookup(name).IsTheHole(isolate));
+    CHECK(IsTheHole(exports->Lookup(name), isolate));
     exports = ObjectHashTable::Put(exports, name, cell);
   }
   module->set_exports(*exports);
@@ -103,11 +103,10 @@ MaybeHandle<Object> SyntheticModule::Evaluate(Isolate* isolate,
 
   v8::Module::SyntheticModuleEvaluationSteps evaluation_steps =
       FUNCTION_CAST<v8::Module::SyntheticModuleEvaluationSteps>(
-          module->evaluation_steps().foreign_address());
+          module->evaluation_steps()->foreign_address());
   v8::Local<v8::Value> result;
-  if (!evaluation_steps(
-           Utils::ToLocal(Handle<Context>::cast(isolate->native_context())),
-           Utils::ToLocal(Handle<Module>::cast(module)))
+  if (!evaluation_steps(Utils::ToLocal(isolate->native_context()),
+                        Utils::ToLocal(Handle<Module>::cast(module)))
            .ToLocal(&result)) {
     isolate->PromoteScheduledException();
     module->RecordError(isolate, isolate->pending_exception());
@@ -119,7 +118,7 @@ MaybeHandle<Object> SyntheticModule::Evaluate(Isolate* isolate,
   Handle<Object> result_from_callback = Utils::OpenHandle(*result);
 
   Handle<JSPromise> capability;
-  if (result_from_callback->IsJSPromise()) {
+  if (IsJSPromise(*result_from_callback)) {
     capability = Handle<JSPromise>::cast(result_from_callback);
   } else {
     // The host's evaluation steps should have returned a resolved Promise,
diff --git a/deps/v8/src/objects/tagged-field-inl.h b/deps/v8/src/objects/tagged-field-inl.h
index 7f2af6d89a6c6e..065fe83c6cd77c 100644
--- a/deps/v8/src/objects/tagged-field-inl.h
+++ b/deps/v8/src/objects/tagged-field-inl.h
@@ -14,14 +14,14 @@ namespace internal {
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 Address TaggedField<T, kFieldOffset, CompressionScheme>::address(
-    HeapObject host, int offset) {
+    Tagged<HeapObject> host, int offset) {
   return host.address() + kFieldOffset + offset;
 }
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 Tagged_t* TaggedField<T, kFieldOffset, CompressionScheme>::location(
-    HeapObject host, int offset) {
+    Tagged<HeapObject> host, int offset) {
   return reinterpret_cast<Tagged_t*>(address(host, offset));
 }
 
@@ -59,8 +59,9 @@ Tagged_t TaggedField<T, kFieldOffset, CompressionScheme>::full_to_tagged(
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::load(HeapObject host,
-                                                        int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::load(Tagged<HeapObject> host,
+                                                      int offset) {
   Tagged_t value = *location(host, offset);
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   return T(tagged_to_full(host.ptr(), value));
@@ -68,8 +69,9 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::load(HeapObject host,
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::load(
-    PtrComprCageBase cage_base, HeapObject host, int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::load(
+    PtrComprCageBase cage_base, Tagged<HeapObject> host, int offset) {
   Tagged_t value = *location(host, offset);
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   return T(tagged_to_full(cage_base, value));
@@ -77,8 +79,8 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::load(
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-void TaggedField<T, kFieldOffset, CompressionScheme>::store(HeapObject host,
-                                                            T value) {
+void TaggedField<T, kFieldOffset, CompressionScheme>::store(
+    Tagged<HeapObject> host, PtrType value) {
 #ifdef V8_ATOMIC_OBJECT_FIELD_WRITES
   Relaxed_Store(host, value);
 #else
@@ -90,9 +92,8 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::store(HeapObject host,
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-void TaggedField<T, kFieldOffset, CompressionScheme>::store(HeapObject host,
-                                                            int offset,
-                                                            T value) {
+void TaggedField<T, kFieldOffset, CompressionScheme>::store(
+    Tagged<HeapObject> host, int offset, PtrType value) {
 #ifdef V8_ATOMIC_OBJECT_FIELD_WRITES
   Relaxed_Store(host, offset, value);
 #else
@@ -104,8 +105,9 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::store(HeapObject host,
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load(HeapObject host,
-                                                                int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load(
+    Tagged<HeapObject> host, int offset) {
   AtomicTagged_t value = AsAtomicTagged::Relaxed_Load(location(host, offset));
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   return T(tagged_to_full(host.ptr(), value));
@@ -113,8 +115,9 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load(HeapObject host,
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load(
-    PtrComprCageBase cage_base, HeapObject host, int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load(
+    PtrComprCageBase cage_base, Tagged<HeapObject> host, int offset) {
   AtomicTagged_t value = AsAtomicTagged::Relaxed_Load(location(host, offset));
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   return T(tagged_to_full(cage_base, value));
@@ -122,8 +125,9 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load(
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load_Map_Word(
-    PtrComprCageBase cage_base, HeapObject host) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load_Map_Word(
+    PtrComprCageBase cage_base, Tagged<HeapObject> host) {
   AtomicTagged_t value = AsAtomicTagged::Relaxed_Load(location(host, 0));
   return T(tagged_to_full(cage_base, value));
 }
@@ -131,14 +135,14 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Load_Map_Word(
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 void TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Store_Map_Word(
-    HeapObject host, T value) {
+    Tagged<HeapObject> host, PtrType value) {
   AsAtomicTagged::Relaxed_Store(location(host), full_to_tagged(value.ptr()));
 }
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 void TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Store(
-    HeapObject host, T value) {
+    Tagged<HeapObject> host, PtrType value) {
   Address ptr = value.ptr();
   DCHECK_NE(kFieldOffset, HeapObject::kMapOffset);
   AsAtomicTagged::Relaxed_Store(location(host), full_to_tagged(ptr));
@@ -147,7 +151,7 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Store(
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 void TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Store(
-    HeapObject host, int offset, T value) {
+    Tagged<HeapObject> host, int offset, PtrType value) {
   Address ptr = value.ptr();
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   AsAtomicTagged::Relaxed_Store(location(host, offset), full_to_tagged(ptr));
@@ -155,8 +159,9 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::Relaxed_Store(
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::Acquire_Load(HeapObject host,
-                                                                int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::Acquire_Load(
+    Tagged<HeapObject> host, int offset) {
   AtomicTagged_t value = AsAtomicTagged::Acquire_Load(location(host, offset));
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   return T(tagged_to_full(host.ptr(), value));
@@ -164,15 +169,17 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::Acquire_Load(HeapObject host,
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::Acquire_Load_No_Unpack(
-    PtrComprCageBase cage_base, HeapObject host, int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::Acquire_Load_No_Unpack(
+    PtrComprCageBase cage_base, Tagged<HeapObject> host, int offset) {
   AtomicTagged_t value = AsAtomicTagged::Acquire_Load(location(host, offset));
   return T(tagged_to_full(cage_base, value));
 }
 
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::Acquire_Load(
-    PtrComprCageBase cage_base, HeapObject host, int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::Acquire_Load(
+    PtrComprCageBase cage_base, Tagged<HeapObject> host, int offset) {
   AtomicTagged_t value = AsAtomicTagged::Acquire_Load(location(host, offset));
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   return T(tagged_to_full(cage_base, value));
@@ -181,7 +188,7 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::Acquire_Load(
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 void TaggedField<T, kFieldOffset, CompressionScheme>::Release_Store(
-    HeapObject host, T value) {
+    Tagged<HeapObject> host, PtrType value) {
   Address ptr = value.ptr();
   DCHECK_NE(kFieldOffset, HeapObject::kMapOffset);
   AsAtomicTagged::Release_Store(location(host), full_to_tagged(ptr));
@@ -190,7 +197,7 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::Release_Store(
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 void TaggedField<T, kFieldOffset, CompressionScheme>::Release_Store_Map_Word(
-    HeapObject host, T value) {
+    Tagged<HeapObject> host, PtrType value) {
   Address ptr = value.ptr();
   AsAtomicTagged::Release_Store(location(host), full_to_tagged(ptr));
 }
@@ -198,7 +205,7 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::Release_Store_Map_Word(
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 void TaggedField<T, kFieldOffset, CompressionScheme>::Release_Store(
-    HeapObject host, int offset, T value) {
+    Tagged<HeapObject> host, int offset, PtrType value) {
   Address ptr = value.ptr();
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   AsAtomicTagged::Release_Store(location(host, offset), full_to_tagged(ptr));
@@ -206,10 +213,9 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::Release_Store(
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-Tagged_t TaggedField<T, kFieldOffset,
-                     CompressionScheme>::Release_CompareAndSwap(HeapObject host,
-                                                                T old,
-                                                                T value) {
+Tagged_t
+TaggedField<T, kFieldOffset, CompressionScheme>::Release_CompareAndSwap(
+    Tagged<HeapObject> host, PtrType old, PtrType value) {
   Tagged_t old_value = full_to_tagged(old.ptr());
   Tagged_t new_value = full_to_tagged(value.ptr());
   Tagged_t result = AsAtomicTagged::Release_CompareAndSwap(
@@ -219,8 +225,9 @@ Tagged_t TaggedField<T, kFieldOffset,
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Load(HeapObject host,
-                                                               int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Load(
+    Tagged<HeapObject> host, int offset) {
   AtomicTagged_t value = AsAtomicTagged::SeqCst_Load(location(host, offset));
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   return T(tagged_to_full(host.ptr(), value));
@@ -228,8 +235,9 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Load(HeapObject host,
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Load(
-    PtrComprCageBase cage_base, HeapObject host, int offset) {
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Load(
+    PtrComprCageBase cage_base, Tagged<HeapObject> host, int offset) {
   AtomicTagged_t value = AsAtomicTagged::SeqCst_Load(location(host, offset));
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   return T(tagged_to_full(cage_base, value));
@@ -238,7 +246,7 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Load(
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 void TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Store(
-    HeapObject host, T value) {
+    Tagged<HeapObject> host, PtrType value) {
   Address ptr = value.ptr();
   DCHECK_NE(kFieldOffset, HeapObject::kMapOffset);
   AsAtomicTagged::SeqCst_Store(location(host), full_to_tagged(ptr));
@@ -247,7 +255,7 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Store(
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
 void TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Store(
-    HeapObject host, int offset, T value) {
+    Tagged<HeapObject> host, int offset, PtrType value) {
   Address ptr = value.ptr();
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   AsAtomicTagged::SeqCst_Store(location(host, offset), full_to_tagged(ptr));
@@ -255,9 +263,10 @@ void TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Store(
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Swap(HeapObject host,
-                                                               int offset,
-                                                               T value) {
+
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Swap(
+    Tagged<HeapObject> host, int offset, PtrType value) {
   Address ptr = value.ptr();
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   AtomicTagged_t old_value =
@@ -267,8 +276,11 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Swap(HeapObject host,
 
 // static
 template <typename T, int kFieldOffset, typename CompressionScheme>
-T TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Swap(
-    PtrComprCageBase cage_base, HeapObject host, int offset, T value) {
+
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Swap(
+    PtrComprCageBase cage_base, Tagged<HeapObject> host, int offset,
+    PtrType value) {
   Address ptr = value.ptr();
   DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
   AtomicTagged_t old_value =
@@ -276,6 +288,20 @@ T TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_Swap(
   return T(tagged_to_full(cage_base, old_value));
 }
 
+// static
+template <typename T, int kFieldOffset, typename CompressionScheme>
+typename TaggedField<T, kFieldOffset, CompressionScheme>::PtrType
+TaggedField<T, kFieldOffset, CompressionScheme>::SeqCst_CompareAndSwap(
+    Tagged<HeapObject> host, int offset, PtrType old, PtrType value) {
+  Address ptr = value.ptr();
+  Address old_ptr = old.ptr();
+  DCHECK_NE(kFieldOffset + offset, HeapObject::kMapOffset);
+  AtomicTagged_t old_value = AsAtomicTagged::SeqCst_CompareAndSwap(
+      location(host, offset), full_to_tagged(old_ptr), full_to_tagged(ptr));
+  return TaggedField<T, kFieldOffset, CompressionScheme>::PtrType(
+      tagged_to_full(host.ptr(), old_value));
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/tagged-field.h b/deps/v8/src/objects/tagged-field.h
index d42ba5c70c0138..b303b8f673d1ae 100644
--- a/deps/v8/src/objects/tagged-field.h
+++ b/deps/v8/src/objects/tagged-field.h
@@ -35,54 +35,70 @@ class TaggedField : public AllStatic {
   static constexpr bool kIsHeapObject =
       std::is_base_of<HeapObject, T>::value || std::is_same<MapWord, T>::value;
 
-  static inline Address address(HeapObject host, int offset = 0);
-
-  static inline T load(HeapObject host, int offset = 0);
-  static inline T load(PtrComprCageBase cage_base, HeapObject host,
-                       int offset = 0);
-
-  static inline void store(HeapObject host, T value);
-  static inline void store(HeapObject host, int offset, T value);
-
-  static inline T Relaxed_Load(HeapObject host, int offset = 0);
-  static inline T Relaxed_Load(PtrComprCageBase cage_base, HeapObject host,
-                               int offset = 0);
-
-  static inline void Relaxed_Store(HeapObject host, T value);
-  static inline void Relaxed_Store(HeapObject host, int offset, T value);
-
-  static inline T Acquire_Load(HeapObject host, int offset = 0);
-  static inline T Acquire_Load_No_Unpack(PtrComprCageBase cage_base,
-                                         HeapObject host, int offset = 0);
-  static inline T Acquire_Load(PtrComprCageBase cage_base, HeapObject host,
-                               int offset = 0);
-
-  static inline T SeqCst_Load(HeapObject host, int offset = 0);
-  static inline T SeqCst_Load(PtrComprCageBase cage_base, HeapObject host,
-                              int offset = 0);
-
-  static inline void Release_Store(HeapObject host, T value);
-  static inline void Release_Store(HeapObject host, int offset, T value);
-
-  static inline void SeqCst_Store(HeapObject host, T value);
-  static inline void SeqCst_Store(HeapObject host, int offset, T value);
-
-  static inline T SeqCst_Swap(HeapObject host, int offset, T value);
-  static inline T SeqCst_Swap(PtrComprCageBase cage_base, HeapObject host,
-                              int offset, T value);
-
-  static inline Tagged_t Release_CompareAndSwap(HeapObject host, T old,
-                                                T value);
+  // Object subclasses should be wrapped in Tagged<>, otherwise use T directly.
+  // TODO(leszeks): Clean this up to be more uniform.
+  using PtrType =
+      std::conditional_t<std::is_base_of<Object, T>::value, Tagged<T>, T>;
+
+  static inline Address address(Tagged<HeapObject> host, int offset = 0);
+
+  static inline PtrType load(Tagged<HeapObject> host, int offset = 0);
+  static inline PtrType load(PtrComprCageBase cage_base,
+                             Tagged<HeapObject> host, int offset = 0);
+
+  static inline void store(Tagged<HeapObject> host, PtrType value);
+  static inline void store(Tagged<HeapObject> host, int offset, PtrType value);
+
+  static inline PtrType Relaxed_Load(Tagged<HeapObject> host, int offset = 0);
+  static inline PtrType Relaxed_Load(PtrComprCageBase cage_base,
+                                     Tagged<HeapObject> host, int offset = 0);
+
+  static inline void Relaxed_Store(Tagged<HeapObject> host, PtrType value);
+  static inline void Relaxed_Store(Tagged<HeapObject> host, int offset,
+                                   PtrType value);
+
+  static inline PtrType Acquire_Load(Tagged<HeapObject> host, int offset = 0);
+  static inline PtrType Acquire_Load_No_Unpack(PtrComprCageBase cage_base,
+                                               Tagged<HeapObject> host,
+                                               int offset = 0);
+  static inline PtrType Acquire_Load(PtrComprCageBase cage_base,
+                                     Tagged<HeapObject> host, int offset = 0);
+
+  static inline PtrType SeqCst_Load(Tagged<HeapObject> host, int offset = 0);
+  static inline PtrType SeqCst_Load(PtrComprCageBase cage_base,
+                                    Tagged<HeapObject> host, int offset = 0);
+
+  static inline void Release_Store(Tagged<HeapObject> host, PtrType value);
+  static inline void Release_Store(Tagged<HeapObject> host, int offset,
+                                   PtrType value);
+
+  static inline void SeqCst_Store(Tagged<HeapObject> host, PtrType value);
+  static inline void SeqCst_Store(Tagged<HeapObject> host, int offset,
+                                  PtrType value);
+
+  static inline PtrType SeqCst_Swap(Tagged<HeapObject> host, int offset,
+                                    PtrType value);
+  static inline PtrType SeqCst_Swap(PtrComprCageBase cage_base,
+                                    Tagged<HeapObject> host, int offset,
+                                    PtrType value);
+
+  static inline Tagged_t Release_CompareAndSwap(Tagged<HeapObject> host,
+                                                PtrType old, PtrType value);
+  static inline PtrType SeqCst_CompareAndSwap(Tagged<HeapObject> host,
+                                              int offset, PtrType old,
+                                              PtrType value);
 
   // Note: Use these *_Map_Word methods only when loading a MapWord from a
   // MapField.
-  static inline T Relaxed_Load_Map_Word(PtrComprCageBase cage_base,
-                                        HeapObject host);
-  static inline void Relaxed_Store_Map_Word(HeapObject host, T value);
-  static inline void Release_Store_Map_Word(HeapObject host, T value);
+  static inline PtrType Relaxed_Load_Map_Word(PtrComprCageBase cage_base,
+                                              Tagged<HeapObject> host);
+  static inline void Relaxed_Store_Map_Word(Tagged<HeapObject> host,
+                                            PtrType value);
+  static inline void Release_Store_Map_Word(Tagged<HeapObject> host,
+                                            PtrType value);
 
  private:
-  static inline Tagged_t* location(HeapObject host, int offset = 0);
+  static inline Tagged_t* location(Tagged<HeapObject> host, int offset = 0);
 
   template <typename TOnHeapAddress>
   static inline Address tagged_to_full(TOnHeapAddress on_heap_addr,
@@ -91,6 +107,10 @@ class TaggedField : public AllStatic {
   static inline Tagged_t full_to_tagged(Address value);
 };
 
+template <typename T, int kFieldOffset, typename CompressionScheme>
+class TaggedField<Tagged<T>, kFieldOffset, CompressionScheme>
+    : public TaggedField<T, kFieldOffset, CompressionScheme> {};
+
 }  // namespace v8::internal
 
 #endif  // V8_OBJECTS_TAGGED_FIELD_H_
diff --git a/deps/v8/src/objects/tagged-impl-inl.h b/deps/v8/src/objects/tagged-impl-inl.h
index 9a447499498b32..af99089bc7b95e 100644
--- a/deps/v8/src/objects/tagged-impl-inl.h
+++ b/deps/v8/src/objects/tagged-impl-inl.h
@@ -19,7 +19,7 @@ namespace v8 {
 namespace internal {
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-bool TaggedImpl<kRefType, StorageType>::ToSmi(Smi* value) const {
+bool TaggedImpl<kRefType, StorageType>::ToSmi(Tagged<Smi>* value) const {
   if (HAS_SMI_TAG(ptr_)) {
     *value = ToSmi();
     return true;
@@ -28,23 +28,23 @@ bool TaggedImpl<kRefType, StorageType>::ToSmi(Smi* value) const {
 }
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-Smi TaggedImpl<kRefType, StorageType>::ToSmi() const {
+Tagged<Smi> TaggedImpl<kRefType, StorageType>::ToSmi() const {
   DCHECK(HAS_SMI_TAG(ptr_));
   if (kIsFull) {
-    return Smi(ptr_);
+    return Tagged<Smi>(ptr_);
   }
   // Implementation for compressed pointers.
-  return Smi(
+  return Tagged<Smi>(
       CompressionScheme::DecompressTaggedSigned(static_cast<Tagged_t>(ptr_)));
 }
 
 //
-// TaggedImpl::GetHeapObject(HeapObject* result) implementation.
+// TaggedImpl::GetHeapObject(Tagged<HeapObject>* result) implementation.
 //
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
 bool TaggedImpl<kRefType, StorageType>::GetHeapObject(
-    HeapObject* result) const {
+    Tagged<HeapObject>* result) const {
   CHECK(kIsFull);
   if (!IsStrongOrWeak()) return false;
   *result = GetHeapObject();
@@ -53,7 +53,7 @@ bool TaggedImpl<kRefType, StorageType>::GetHeapObject(
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
 bool TaggedImpl<kRefType, StorageType>::GetHeapObject(
-    Isolate* isolate, HeapObject* result) const {
+    Isolate* isolate, Tagged<HeapObject>* result) const {
   if (kIsFull) return GetHeapObject(result);
   // Implementation for compressed pointers.
   if (!IsStrongOrWeak()) return false;
@@ -62,14 +62,14 @@ bool TaggedImpl<kRefType, StorageType>::GetHeapObject(
 }
 
 //
-// TaggedImpl::GetHeapObject(HeapObject* result,
+// TaggedImpl::GetHeapObject(Tagged<HeapObject>* result,
 //                           HeapObjectReferenceType* reference_type)
 // implementation.
 //
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
 bool TaggedImpl<kRefType, StorageType>::GetHeapObject(
-    HeapObject* result, HeapObjectReferenceType* reference_type) const {
+    Tagged<HeapObject>* result, HeapObjectReferenceType* reference_type) const {
   CHECK(kIsFull);
   if (!IsStrongOrWeak()) return false;
   *reference_type = IsWeakOrCleared() ? HeapObjectReferenceType::WEAK
@@ -80,7 +80,7 @@ bool TaggedImpl<kRefType, StorageType>::GetHeapObject(
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
 bool TaggedImpl<kRefType, StorageType>::GetHeapObject(
-    Isolate* isolate, HeapObject* result,
+    Isolate* isolate, Tagged<HeapObject>* result,
     HeapObjectReferenceType* reference_type) const {
   if (kIsFull) return GetHeapObject(result, reference_type);
   // Implementation for compressed pointers.
@@ -92,12 +92,12 @@ bool TaggedImpl<kRefType, StorageType>::GetHeapObject(
 }
 
 //
-// TaggedImpl::GetHeapObjectIfStrong(HeapObject* result) implementation.
+// TaggedImpl::GetHeapObjectIfStrong(Tagged<HeapObject>* result) implementation.
 //
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
 bool TaggedImpl<kRefType, StorageType>::GetHeapObjectIfStrong(
-    HeapObject* result) const {
+    Tagged<HeapObject>* result) const {
   CHECK(kIsFull);
   if (IsStrong()) {
     *result = HeapObject::cast(Object(ptr_));
@@ -108,7 +108,7 @@ bool TaggedImpl<kRefType, StorageType>::GetHeapObjectIfStrong(
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
 bool TaggedImpl<kRefType, StorageType>::GetHeapObjectIfStrong(
-    Isolate* isolate, HeapObject* result) const {
+    Isolate* isolate, Tagged<HeapObject>* result) const {
   if (kIsFull) return GetHeapObjectIfStrong(result);
   // Implementation for compressed pointers.
   if (IsStrong()) {
@@ -124,15 +124,15 @@ bool TaggedImpl<kRefType, StorageType>::GetHeapObjectIfStrong(
 //
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeStrong()
-    const {
+Tagged<HeapObject>
+TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeStrong() const {
   CHECK(kIsFull);
   DCHECK(IsStrong());
   return HeapObject::cast(Object(ptr_));
 }
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeStrong(
+Tagged<HeapObject> TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeStrong(
     Isolate* isolate) const {
   if (kIsFull) return GetHeapObjectAssumeStrong();
   // Implementation for compressed pointers.
@@ -142,12 +142,12 @@ HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeStrong(
 }
 
 //
-// TaggedImpl::GetHeapObjectIfWeak(HeapObject* result) implementation
+// TaggedImpl::GetHeapObjectIfWeak(Tagged<HeapObject>* result) implementation
 //
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
 bool TaggedImpl<kRefType, StorageType>::GetHeapObjectIfWeak(
-    HeapObject* result) const {
+    Tagged<HeapObject>* result) const {
   CHECK(kIsFull);
   if (kCanBeWeak) {
     if (IsWeak()) {
@@ -163,7 +163,7 @@ bool TaggedImpl<kRefType, StorageType>::GetHeapObjectIfWeak(
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
 bool TaggedImpl<kRefType, StorageType>::GetHeapObjectIfWeak(
-    Isolate* isolate, HeapObject* result) const {
+    Isolate* isolate, Tagged<HeapObject>* result) const {
   if (kIsFull) return GetHeapObjectIfWeak(result);
   // Implementation for compressed pointers.
   if (kCanBeWeak) {
@@ -183,14 +183,15 @@ bool TaggedImpl<kRefType, StorageType>::GetHeapObjectIfWeak(
 //
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeWeak() const {
+Tagged<HeapObject> TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeWeak()
+    const {
   CHECK(kIsFull);
   DCHECK(IsWeak());
   return GetHeapObject();
 }
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeWeak(
+Tagged<HeapObject> TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeWeak(
     Isolate* isolate) const {
   if (kIsFull) return GetHeapObjectAssumeWeak();
   // Implementation for compressed pointers.
@@ -203,7 +204,7 @@ HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObjectAssumeWeak(
 //
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObject() const {
+Tagged<HeapObject> TaggedImpl<kRefType, StorageType>::GetHeapObject() const {
   CHECK(kIsFull);
   DCHECK(!IsSmi());
   if (kCanBeWeak) {
@@ -216,7 +217,7 @@ HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObject() const {
 }
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObject(
+Tagged<HeapObject> TaggedImpl<kRefType, StorageType>::GetHeapObject(
     Isolate* isolate) const {
   if (kIsFull) return GetHeapObject();
   // Implementation for compressed pointers.
@@ -237,7 +238,7 @@ HeapObject TaggedImpl<kRefType, StorageType>::GetHeapObject(
 //
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-Object TaggedImpl<kRefType, StorageType>::GetHeapObjectOrSmi() const {
+Tagged<Object> TaggedImpl<kRefType, StorageType>::GetHeapObjectOrSmi() const {
   CHECK(kIsFull);
   if (IsSmi()) {
     return Object(ptr_);
@@ -246,7 +247,7 @@ Object TaggedImpl<kRefType, StorageType>::GetHeapObjectOrSmi() const {
 }
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-Object TaggedImpl<kRefType, StorageType>::GetHeapObjectOrSmi(
+Tagged<Object> TaggedImpl<kRefType, StorageType>::GetHeapObjectOrSmi(
     Isolate* isolate) const {
   if (kIsFull) return GetHeapObjectOrSmi();
   // Implementation for compressed pointers.
diff --git a/deps/v8/src/objects/tagged-impl.cc b/deps/v8/src/objects/tagged-impl.cc
index c4ccf34e811a8c..58c639a62f9a13 100644
--- a/deps/v8/src/objects/tagged-impl.cc
+++ b/deps/v8/src/objects/tagged-impl.cc
@@ -38,49 +38,72 @@ bool CheckObjectComparisonAllowed(Address a, Address b) {
 #endif  // V8_EXTERNAL_CODE_SPACE
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-void TaggedImpl<kRefType, StorageType>::ShortPrint(FILE* out) {
+void ShortPrint(TaggedImpl<kRefType, StorageType> ptr, FILE* out) {
   OFStream os(out);
-  os << Brief(*this);
+  os << Brief(ptr);
 }
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void ShortPrint(
+    TaggedImpl<HeapObjectReferenceType::STRONG, Address> ptr, FILE* out);
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void ShortPrint(
+    TaggedImpl<HeapObjectReferenceType::WEAK, Address> ptr, FILE* out);
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-void TaggedImpl<kRefType, StorageType>::ShortPrint(StringStream* accumulator) {
+void ShortPrint(TaggedImpl<kRefType, StorageType> ptr,
+                StringStream* accumulator) {
   std::ostringstream os;
-  os << Brief(*this);
+  os << Brief(ptr);
   accumulator->Add(os.str().c_str());
 }
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void ShortPrint(
+    TaggedImpl<HeapObjectReferenceType::STRONG, Address> ptr,
+    StringStream* accumulator);
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void ShortPrint(
+    TaggedImpl<HeapObjectReferenceType::WEAK, Address> ptr,
+    StringStream* accumulator);
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-void TaggedImpl<kRefType, StorageType>::ShortPrint(std::ostream& os) {
-  os << Brief(*this);
+void ShortPrint(TaggedImpl<kRefType, StorageType> ptr, std::ostream& os) {
+  os << Brief(ptr);
 }
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void ShortPrint(
+    TaggedImpl<HeapObjectReferenceType::STRONG, Address> ptr, std::ostream& os);
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void ShortPrint(
+    TaggedImpl<HeapObjectReferenceType::WEAK, Address> ptr, std::ostream& os);
 
 #ifdef OBJECT_PRINT
 template <HeapObjectReferenceType kRefType, typename StorageType>
-void TaggedImpl<kRefType, StorageType>::Print() {
+void Print(TaggedImpl<kRefType, StorageType> ptr) {
   StdoutStream os;
-  this->Print(os);
+  Print(ptr, os);
   os << std::flush;
 }
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Print(
+    TaggedImpl<HeapObjectReferenceType::STRONG, Address> ptr);
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Print(
+    TaggedImpl<HeapObjectReferenceType::WEAK, Address> ptr);
 
 template <HeapObjectReferenceType kRefType, typename StorageType>
-void TaggedImpl<kRefType, StorageType>::Print(std::ostream& os) {
-  Smi smi(0);
-  HeapObject heap_object;
-  if (ToSmi(&smi)) {
+void Print(TaggedImpl<kRefType, StorageType> ptr, std::ostream& os) {
+  Tagged<Smi> smi;
+  Tagged<HeapObject> heap_object;
+  if (ptr.ToSmi(&smi)) {
     os << "Smi: " << std::hex << "0x" << smi.value();
     os << std::dec << " (" << smi.value() << ")\n";
-  } else if (IsCleared()) {
+  } else if (ptr.IsCleared()) {
     os << "[cleared]";
-  } else if (GetHeapObjectIfWeak(&heap_object)) {
+  } else if (ptr.GetHeapObjectIfWeak(&heap_object)) {
     os << "[weak] ";
-    heap_object.HeapObjectPrint(os);
-  } else if (GetHeapObjectIfStrong(&heap_object)) {
-    heap_object.HeapObjectPrint(os);
+    heap_object->HeapObjectPrint(os);
+  } else if (ptr.GetHeapObjectIfStrong(&heap_object)) {
+    heap_object->HeapObjectPrint(os);
   } else {
     UNREACHABLE();
   }
 }
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Print(
+    TaggedImpl<HeapObjectReferenceType::STRONG, Address> ptr, std::ostream& os);
+template EXPORT_TEMPLATE_DEFINE(V8_EXPORT_PRIVATE) void Print(
+    TaggedImpl<HeapObjectReferenceType::WEAK, Address> ptr, std::ostream& os);
 #endif  // OBJECT_PRINT
 
 // Explicit instantiation declarations.
diff --git a/deps/v8/src/objects/tagged-impl.h b/deps/v8/src/objects/tagged-impl.h
index 2505c153ba7099..5666035e20399a 100644
--- a/deps/v8/src/objects/tagged-impl.h
+++ b/deps/v8/src/objects/tagged-impl.h
@@ -6,6 +6,8 @@
 #define V8_OBJECTS_TAGGED_IMPL_H_
 
 #include "include/v8-internal.h"
+#include "src/base/export-template.h"
+#include "src/base/macros.h"
 #include "src/common/checks.h"
 #include "src/common/globals.h"
 
@@ -50,7 +52,7 @@ class TaggedImpl {
   explicit constexpr TaggedImpl(StorageType ptr) : ptr_(ptr) {}
 
   // Make clang on Linux catch what MSVC complains about on Windows:
-  operator bool() const = delete;
+  explicit operator bool() const = delete;
 
   // Don't use this operator for comparing with stale or invalid pointers
   // because CheckObjectComparisonAllowed() might crash when trying to access
@@ -119,8 +121,8 @@ class TaggedImpl {
 
   // Returns true if this tagged value is a Smi.
   constexpr bool IsSmi() const { return HAS_SMI_TAG(ptr_); }
-  inline bool ToSmi(Smi* value) const;
-  inline Smi ToSmi() const;
+  inline bool ToSmi(Tagged<Smi>* value) const;
+  inline Tagged<Smi> ToSmi() const;
 
   // Returns true if this tagged value is a strong pointer to a HeapObject.
   constexpr inline bool IsHeapObject() const { return IsStrong(); }
@@ -164,43 +166,45 @@ class TaggedImpl {
 
   // If this tagged value is a strong pointer to a HeapObject, returns true and
   // sets *result. Otherwise returns false.
-  inline bool GetHeapObjectIfStrong(HeapObject* result) const;
-  inline bool GetHeapObjectIfStrong(Isolate* isolate, HeapObject* result) const;
+  inline bool GetHeapObjectIfStrong(Tagged<HeapObject>* result) const;
+  inline bool GetHeapObjectIfStrong(Isolate* isolate,
+                                    Tagged<HeapObject>* result) const;
 
   // DCHECKs that this tagged value is a strong pointer to a HeapObject and
   // returns the HeapObject.
-  inline HeapObject GetHeapObjectAssumeStrong() const;
-  inline HeapObject GetHeapObjectAssumeStrong(Isolate* isolate) const;
+  inline Tagged<HeapObject> GetHeapObjectAssumeStrong() const;
+  inline Tagged<HeapObject> GetHeapObjectAssumeStrong(Isolate* isolate) const;
 
   // If this tagged value is a weak pointer to a HeapObject, returns true and
   // sets *result. Otherwise returns false.
-  inline bool GetHeapObjectIfWeak(HeapObject* result) const;
-  inline bool GetHeapObjectIfWeak(Isolate* isolate, HeapObject* result) const;
+  inline bool GetHeapObjectIfWeak(Tagged<HeapObject>* result) const;
+  inline bool GetHeapObjectIfWeak(Isolate* isolate,
+                                  Tagged<HeapObject>* result) const;
 
   // DCHECKs that this tagged value is a weak pointer to a HeapObject and
   // returns the HeapObject.
-  inline HeapObject GetHeapObjectAssumeWeak() const;
-  inline HeapObject GetHeapObjectAssumeWeak(Isolate* isolate) const;
+  inline Tagged<HeapObject> GetHeapObjectAssumeWeak() const;
+  inline Tagged<HeapObject> GetHeapObjectAssumeWeak(Isolate* isolate) const;
 
   // If this tagged value is a strong or weak pointer to a HeapObject, returns
   // true and sets *result. Otherwise returns false.
-  inline bool GetHeapObject(HeapObject* result) const;
-  inline bool GetHeapObject(Isolate* isolate, HeapObject* result) const;
+  inline bool GetHeapObject(Tagged<HeapObject>* result) const;
+  inline bool GetHeapObject(Isolate* isolate, Tagged<HeapObject>* result) const;
 
-  inline bool GetHeapObject(HeapObject* result,
+  inline bool GetHeapObject(Tagged<HeapObject>* result,
                             HeapObjectReferenceType* reference_type) const;
-  inline bool GetHeapObject(Isolate* isolate, HeapObject* result,
+  inline bool GetHeapObject(Isolate* isolate, Tagged<HeapObject>* result,
                             HeapObjectReferenceType* reference_type) const;
 
   // DCHECKs that this tagged value is a strong or a weak pointer to a
   // HeapObject and returns the HeapObject.
-  inline HeapObject GetHeapObject() const;
-  inline HeapObject GetHeapObject(Isolate* isolate) const;
+  inline Tagged<HeapObject> GetHeapObject() const;
+  inline Tagged<HeapObject> GetHeapObject(Isolate* isolate) const;
 
   // DCHECKs that this tagged value is a strong or a weak pointer to a
   // HeapObject or a Smi and returns the HeapObject or Smi.
-  inline Object GetHeapObjectOrSmi() const;
-  inline Object GetHeapObjectOrSmi(Isolate* isolate) const;
+  inline Tagged<Object> GetHeapObjectOrSmi() const;
+  inline Tagged<Object> GetHeapObjectOrSmi(Isolate* isolate) const;
 
   // Cast operation is available only for full non-weak tagged values.
   template <typename T>
@@ -210,22 +214,6 @@ class TaggedImpl {
     return T::cast(Object(ptr_));
   }
 
-  // Prints this object without details.
-  void ShortPrint(FILE* out = stdout);
-
-  // Prints this object without details to a message accumulator.
-  void ShortPrint(StringStream* accumulator);
-
-  void ShortPrint(std::ostream& os);
-
-#ifdef OBJECT_PRINT
-  void Print();
-  void Print(std::ostream& os);
-#else
-  void Print() { ShortPrint(); }
-  void Print(std::ostream& os) { ShortPrint(os); }
-#endif
-
  private:
   friend class CompressedObjectSlot;
   friend class FullObjectSlot;
@@ -233,6 +221,39 @@ class TaggedImpl {
   StorageType ptr_;
 };
 
+// Prints this object without details.
+template <HeapObjectReferenceType kRefType, typename StorageType>
+EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
+void ShortPrint(TaggedImpl<kRefType, StorageType> ptr, FILE* out = stdout);
+
+// Prints this object without details to a message accumulator.
+template <HeapObjectReferenceType kRefType, typename StorageType>
+EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
+void ShortPrint(TaggedImpl<kRefType, StorageType> ptr,
+                StringStream* accumulator);
+
+template <HeapObjectReferenceType kRefType, typename StorageType>
+EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
+void ShortPrint(TaggedImpl<kRefType, StorageType> ptr, std::ostream& os);
+
+#ifdef OBJECT_PRINT
+template <HeapObjectReferenceType kRefType, typename StorageType>
+EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
+void Print(TaggedImpl<kRefType, StorageType> ptr);
+template <HeapObjectReferenceType kRefType, typename StorageType>
+EXPORT_TEMPLATE_DECLARE(V8_EXPORT_PRIVATE)
+void Print(TaggedImpl<kRefType, StorageType> ptr, std::ostream& os);
+#else
+template <HeapObjectReferenceType kRefType, typename StorageType>
+void Print(TaggedImpl<kRefType, StorageType> ptr) {
+  ShortPrint(ptr);
+}
+template <HeapObjectReferenceType kRefType, typename StorageType>
+void Print(TaggedImpl<kRefType, StorageType> ptr, std::ostream& os) {
+  ShortPrint(ptr, os);
+}
+#endif
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/tagged-index.h b/deps/v8/src/objects/tagged-index.h
index eb5992d4776ff4..c1d1a250a1664b 100644
--- a/deps/v8/src/objects/tagged-index.h
+++ b/deps/v8/src/objects/tagged-index.h
@@ -37,6 +37,8 @@ class TaggedIndex : public Object {
   // This replaces the OBJECT_CONSTRUCTORS macro, because TaggedIndex are
   // special in that we want them to be constexprs.
   constexpr TaggedIndex() : Object() {}
+  explicit constexpr TaggedIndex(Address ptr, SkipTypeCheckTag)
+      : Object(ptr, SkipTypeCheckTag()) {}
   explicit constexpr TaggedIndex(Address ptr) : Object(ptr) {
     DCHECK(HAS_SMI_TAG(ptr));
   }
@@ -48,9 +50,10 @@ class TaggedIndex : public Object {
   }
 
   // Convert a value to a TaggedIndex object.
-  static inline TaggedIndex FromIntptr(intptr_t value) {
+  static inline Tagged<TaggedIndex> FromIntptr(intptr_t value) {
     DCHECK(TaggedIndex::IsValid(value));
-    return TaggedIndex((static_cast<Address>(value) << kSmiTagSize) | kSmiTag);
+    return Tagged<TaggedIndex>((static_cast<Address>(value) << kSmiTagSize) |
+                               kSmiTag);
   }
 
   // Returns whether value can be represented in a TaggedIndex.
@@ -61,7 +64,7 @@ class TaggedIndex : public Object {
   DECL_CAST(TaggedIndex)
 
   // Dispatched behavior.
-  DECL_VERIFIER(TaggedIndex)
+  DECL_STATIC_VERIFIER(TaggedIndex)
 
   static_assert(kSmiTagSize == 1);
   static constexpr int kTaggedValueSize = 31;
@@ -72,6 +75,20 @@ class TaggedIndex : public Object {
 
 CAST_ACCESSOR(TaggedIndex)
 
+// Defined Tagged<TaggedIndex> now that TaggedIndex exists.
+
+// Implicit conversions to/from raw pointers
+// TODO(leszeks): Remove once we're using Tagged everywhere.
+// NOLINTNEXTLINE
+constexpr Tagged<TaggedIndex>::Tagged(TaggedIndex raw) : TaggedBase(raw.ptr()) {
+  static_assert(kTaggedCanConvertToRawObjects);
+}
+// NOLINTNEXTLINE
+constexpr Tagged<TaggedIndex>::operator TaggedIndex() {
+  static_assert(kTaggedCanConvertToRawObjects);
+  return TaggedIndex(ptr());
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/tagged-value-inl.h b/deps/v8/src/objects/tagged-value-inl.h
index 7cdebdf700be81..c729aa3988d6ca 100644
--- a/deps/v8/src/objects/tagged-value-inl.h
+++ b/deps/v8/src/objects/tagged-value-inl.h
@@ -18,7 +18,7 @@
 namespace v8 {
 namespace internal {
 
-inline StrongTaggedValue::StrongTaggedValue(Object o)
+inline StrongTaggedValue::StrongTaggedValue(Tagged<Object> o)
     :
 #ifdef V8_COMPRESS_POINTERS
       TaggedImpl(CompressionScheme::CompressObject(o.ptr()))
@@ -28,7 +28,8 @@ inline StrongTaggedValue::StrongTaggedValue(Object o)
 {
 }
 
-Object StrongTaggedValue::ToObject(Isolate* isolate, StrongTaggedValue object) {
+Tagged<Object> StrongTaggedValue::ToObject(Isolate* isolate,
+                                           StrongTaggedValue object) {
 #ifdef V8_COMPRESS_POINTERS
   return Object(CompressionScheme::DecompressTagged(isolate, object.ptr()));
 #else
diff --git a/deps/v8/src/objects/tagged-value.h b/deps/v8/src/objects/tagged-value.h
index 7b6192204a463c..7a479638113bbd 100644
--- a/deps/v8/src/objects/tagged-value.h
+++ b/deps/v8/src/objects/tagged-value.h
@@ -21,9 +21,10 @@ class StrongTaggedValue
  public:
   constexpr StrongTaggedValue() : TaggedImpl() {}
   explicit constexpr StrongTaggedValue(Tagged_t ptr) : TaggedImpl(ptr) {}
-  explicit StrongTaggedValue(Object o);
+  explicit StrongTaggedValue(Tagged<Object> o);
 
-  inline static Object ToObject(Isolate* isolate, StrongTaggedValue object);
+  inline static Tagged<Object> ToObject(Isolate* isolate,
+                                        StrongTaggedValue object);
 };
 
 // Almost same as MaybeObject but this one deals with in-heap and potentially
diff --git a/deps/v8/src/objects/tagged.h b/deps/v8/src/objects/tagged.h
new file mode 100644
index 00000000000000..ce955b538e2dc0
--- /dev/null
+++ b/deps/v8/src/objects/tagged.h
@@ -0,0 +1,450 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_OBJECTS_TAGGED_H_
+#define V8_OBJECTS_TAGGED_H_
+
+#include <type_traits>
+
+#include "src/common/checks.h"
+#include "src/common/globals.h"
+#include "src/objects/tagged-impl.h"
+
+namespace v8 {
+namespace internal {
+
+class Object;
+class Smi;
+class HeapObject;
+class TaggedIndex;
+class FieldType;
+
+// Tagged<T> represents an uncompressed V8 tagged pointer.
+//
+// The tagged pointer is a pointer-sized value with a tag in the LSB. The value
+// is either:
+//
+//   * A pointer to an object on the V8 heap, with the tag set to 1
+//   * A small integer (Smi), shifted right, with the tag set to 0
+//
+// The exact encoding differs depending on 32- vs 64-bit architectures, and in
+// the latter case, whether or not pointer compression is enabled.
+//
+// On 32-bit architectures, this is:
+//             |----- 32 bits -----|
+// Pointer:    |______address____01|
+//    Smi:     |____int31_value___0|
+//
+// On 64-bit architectures with pointer compression:
+//             |----- 32 bits -----|----- 32 bits -----|
+// Pointer:    |________base_______|______offset_____01|
+//    Smi:     |......garbage......|____int31_value___0|
+//
+// On 64-bit architectures without pointer compression:
+//             |----- 32 bits -----|----- 32 bits -----|
+// Pointer:    |________________address______________01|
+//    Smi:     |____int32_value____|00...............00|
+//
+// We specialise Tagged separately for Object, Smi and HeapObject, and then all
+// other types T, so that:
+//
+//                    Tagged<Object> -> TaggedBase
+//                       Tagged<Smi> -> TaggedBase
+//   Tagged<T> -> Tagged<HeapObject> -> TaggedBase
+template <typename T>
+class Tagged;
+
+// TODO(leszeks): Remove this once there are no more conversions between
+// Tagged<Foo> and Foo.
+static constexpr bool kTaggedCanConvertToRawObjects = true;
+
+// Base class for all Tagged<T> classes.
+// TODO(leszeks): Merge with TaggedImpl.
+using TaggedBase = TaggedImpl<HeapObjectReferenceType::STRONG, Address>;
+
+namespace detail {
+
+// {TaggedOperatorArrowRef} is returned by {Tagged::operator->}. It should never
+// be stored anywhere or used in any other code; no one should ever have to
+// spell out {TaggedOperatorArrowRef} in code. Its only purpose is to be
+// dereferenced immediately by "operator-> chaining". Returning the address of
+// the field is valid because this objects lifetime only ends at the end of the
+// full statement.
+template <typename T>
+class TaggedOperatorArrowRef {
+ public:
+  constexpr T* operator->() { return &object_; }
+
+ private:
+  friend class Tagged<T>;
+  constexpr explicit TaggedOperatorArrowRef(T object) : object_(object) {}
+  T object_;
+};
+
+template <typename T>
+struct BaseForTagged {
+  using type = Tagged<HeapObject>;
+};
+
+// FieldType is special, since it can be Smi or Map. It could probably even be
+// its own specialization, to avoid exposing an operator->.
+template <>
+struct BaseForTagged<FieldType> {
+  using type = Tagged<Object>;
+};
+
+// TaggedIndex is special, since it's a more strict Smi. It could probably even
+// be its own specialization, to avoid exposing an operator->.
+template <>
+struct BaseForTagged<TaggedIndex> {
+  using type = Tagged<Object>;
+};
+
+}  // namespace detail
+
+template <typename T>
+class Tagged;
+
+// Specialization for Object, where it's unknown whether this is a Smi or a
+// HeapObject.
+template <>
+class Tagged<Object> : public TaggedBase {
+ public:
+  // Allow all casts -- all classes are subclasses of Object, nothing to check
+  // here.
+  static constexpr Tagged<Object> cast(TaggedBase other) {
+    return Tagged<Object>(other);
+  }
+  static constexpr Tagged<Object> unchecked_cast(TaggedBase other) {
+    return Tagged<Object>(other);
+  }
+
+  // Tagged<Object> doesn't provide a default constructor on purpose.
+  // It depends on the use case if default initializing with Smi::Zero() or a
+  // tagged null makes more sense.
+
+  // Allow Tagged<Object> to be created from any address.
+  constexpr explicit Tagged(Address o) : TaggedBase(o) {}
+
+  // Allow explicit uninitialized initialization. In debug mode this is zapped.
+  // TODO(leszeks): Mark this somehow as uninitialized, so that we get some
+  // warning if it is used before initialization.
+  constexpr Tagged()
+      : TaggedBase(
+#ifdef DEBUG
+            kZapValue
+#endif
+        ) {
+  }
+
+  // Implicit conversion for subclasses -- all classes are subclasses of Object,
+  // so allow all tagged pointers.
+  // NOLINTNEXTLINE
+  constexpr Tagged(TaggedBase other) : TaggedBase(other.ptr()) {}
+  constexpr Tagged& operator=(TaggedBase other) {
+    return *this = Tagged(other);
+  }
+
+  // Implicit conversions to/from raw pointers
+  // TODO(leszeks): Remove once we're using Tagged everywhere.
+  // NOLINTNEXTLINE
+  inline constexpr Tagged(Object raw);
+  template <typename U,
+            typename = std::enable_if_t<std::is_base_of_v<U, Object> ||
+                                        std::is_convertible_v<Object*, U*>>>
+  // NOLINTNEXTLINE
+  inline constexpr operator U();
+
+ private:
+  friend class Object;
+  inline constexpr Object ToRawPtr() const;
+};
+
+// Specialization for Smi disallowing any implicit creation or access via ->,
+// but offering instead a cast from Object and an int32_t value() method.
+template <>
+class Tagged<Smi> : public TaggedBase {
+ public:
+  // Explicit cast for sub- and superclasses (in practice, only Object will pass
+  // this static assert).
+  template <typename U>
+  static constexpr Tagged<Smi> cast(Tagged<U> other) {
+    static_assert(std::is_base_of_v<Smi, U> ||
+                  std::is_convertible_v<U*, Smi*> ||
+                  std::is_base_of_v<U, Smi> || std::is_convertible_v<Smi*, U*>);
+    DCHECK(other.IsSmi());
+    return Tagged<Smi>(other.ptr());
+  }
+  static constexpr Tagged<Smi> unchecked_cast(TaggedBase other) {
+    return Tagged<Smi>(other.ptr());
+  }
+
+  constexpr Tagged() = default;
+  constexpr explicit Tagged(Address ptr) : TaggedBase(ptr) {}
+
+  // No implicit conversions from other tagged pointers.
+
+  constexpr bool IsHeapObject() const { return false; }
+  constexpr bool IsSmi() const { return true; }
+
+  constexpr int32_t value() const { return Internals::SmiValue(ptr()); }
+
+  // Implicit conversions to/from raw pointers
+  // TODO(leszeks): Remove once we're using Tagged everywhere.
+  // NOLINTNEXTLINE
+  inline constexpr Tagged(Smi raw);
+  // NOLINTNEXTLINE
+  inline constexpr operator Smi();
+
+ private:
+  friend class Smi;
+  // Handles of the same type are allowed to access the Address constructor.
+  friend class Handle<Smi>;
+#ifdef V8_ENABLE_DIRECT_HANDLE
+  friend class DirectHandle<Smi>;
+#endif
+};
+
+// Specialization for TaggedIndex disallowing any implicit creation or access
+// via ->, but offering instead a cast from Object and an intptr_t value()
+// method.
+template <>
+class Tagged<TaggedIndex> : public TaggedBase {
+ public:
+  // Explicit cast for sub- and superclasses (in practice, only Object will pass
+  // this static assert).
+  template <typename U>
+  static constexpr Tagged<TaggedIndex> cast(Tagged<U> other) {
+    static_assert(std::is_base_of_v<TaggedIndex, U> ||
+                  std::is_convertible_v<U*, TaggedIndex*> ||
+                  std::is_base_of_v<U, TaggedIndex> ||
+                  std::is_convertible_v<TaggedIndex*, U*>);
+    DCHECK(IsTaggedIndex(other));
+    return Tagged<TaggedIndex>(other.ptr());
+  }
+  static constexpr Tagged<TaggedIndex> unchecked_cast(TaggedBase other) {
+    return Tagged<TaggedIndex>(other.ptr());
+  }
+
+  constexpr Tagged() = default;
+  constexpr explicit Tagged(Address ptr) : TaggedBase(ptr) {}
+
+  // No implicit conversions from other tagged pointers.
+
+  constexpr bool IsHeapObject() const { return false; }
+  constexpr bool IsSmi() const { return true; }
+
+  // Returns the integer value.
+  constexpr intptr_t value() const {
+    // Truncate and shift down (requires >> to be sign extending).
+    return static_cast<intptr_t>(ptr()) >> kSmiTagSize;
+  }
+
+  // Implicit conversions to/from raw pointers
+  // TODO(leszeks): Remove once we're using Tagged everywhere.
+  // NOLINTNEXTLINE
+  inline constexpr Tagged(TaggedIndex raw);
+  // NOLINTNEXTLINE
+  inline constexpr operator TaggedIndex();
+
+ private:
+  friend class TaggedIndex;
+  // Handles of the same type are allowed to access the Address constructor.
+  friend class Handle<TaggedIndex>;
+#ifdef V8_ENABLE_DIRECT_HANDLE
+  friend class DirectHandle<TaggedIndex>;
+#endif
+};
+
+// Specialization for HeapObject, to group together functions shared between all
+// HeapObjects
+template <>
+class Tagged<HeapObject> : public TaggedBase {
+  using Base = TaggedBase;
+
+ public:
+  // Explicit cast for sub- and superclasses.
+  template <typename U>
+  static constexpr Tagged<HeapObject> cast(Tagged<U> other) {
+    static_assert(std::is_base_of_v<HeapObject, U> ||
+                  std::is_convertible_v<U*, HeapObject*> ||
+                  std::is_base_of_v<U, HeapObject> ||
+                  std::is_convertible_v<HeapObject*, U*>);
+    DCHECK(other.IsHeapObject());
+    return Tagged<HeapObject>(other.ptr());
+  }
+  static constexpr Tagged<HeapObject> unchecked_cast(TaggedBase other) {
+    // Don't check incoming type for unchecked casts, in case the object
+    // definitions are not available.
+    return Tagged<HeapObject>(other.ptr());
+  }
+
+  constexpr Tagged() = default;
+
+  // Implicit conversion for subclasses.
+  template <typename U,
+            typename = std::enable_if_t<std::is_base_of_v<HeapObject, U> ||
+                                        std::is_convertible_v<U*, HeapObject*>>>
+  constexpr Tagged& operator=(Tagged<U> other) {
+    return *this = Tagged(other);
+  }
+
+  // Implicit conversion for subclasses.
+  template <typename U,
+            typename = std::enable_if_t<std::is_base_of_v<HeapObject, U> ||
+                                        std::is_convertible_v<U*, HeapObject*>>>
+  // NOLINTNEXTLINE
+  constexpr Tagged(Tagged<U> other) : Base(other) {}
+
+  constexpr HeapObject operator*() const;
+  constexpr detail::TaggedOperatorArrowRef<HeapObject> operator->() const;
+
+  constexpr bool is_null() const {
+    return static_cast<Tagged_t>(this->ptr()) ==
+           static_cast<Tagged_t>(kNullAddress);
+  }
+
+  constexpr bool IsHeapObject() const { return true; }
+  constexpr bool IsSmi() const { return false; }
+
+  inline bool InAnySharedSpace() const;
+  inline bool InWritableSharedSpace() const;
+  inline bool InReadOnlySpace() const;
+
+  // Implicit conversions and explicit casts to/from raw pointers
+  // TODO(leszeks): Remove once we're using Tagged everywhere.
+  template <typename U,
+            typename = std::enable_if_t<std::is_base_of_v<HeapObject, U> ||
+                                        std::is_convertible_v<U*, HeapObject*>>>
+  // NOLINTNEXTLINE
+  constexpr Tagged(U raw) : Base(raw.ptr()) {
+    static_assert(kTaggedCanConvertToRawObjects);
+  }
+  // NOLINTNEXTLINE
+  constexpr operator HeapObject();
+  template <typename U>
+  static constexpr Tagged<HeapObject> cast(U other) {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return Tagged<HeapObject>::cast(Tagged<U>(other));
+  }
+
+  Address address() const { return this->ptr() - kHeapObjectTag; }
+
+ protected:
+  constexpr explicit Tagged(Address ptr) : Base(ptr) {}
+
+ private:
+  friend class HeapObject;
+  // Handles of the same type are allowed to access the Address constructor.
+  friend class Handle<HeapObject>;
+#ifdef V8_ENABLE_DIRECT_HANDLE
+  friend class DirectHandle<HeapObject>;
+#endif
+
+  constexpr HeapObject ToRawPtr() const;
+};
+
+static_assert(Tagged<HeapObject>().is_null());
+
+// Generic Tagged<T> for any T that is a subclass of HeapObject. There are
+// separate Tagged<T> specializations for T==Smi and T==Object, so we know that
+// all other Tagged<T> are definitely pointers and not Smis.
+template <typename T>
+class Tagged : public detail::BaseForTagged<T>::type {
+  using Base = typename detail::BaseForTagged<T>::type;
+
+ public:
+  // Explicit cast for sub- and superclasses.
+  template <typename U>
+  static constexpr Tagged<T> cast(Tagged<U> other) {
+    static_assert(std::is_base_of_v<T, U> || std::is_convertible_v<U*, T*> ||
+                  std::is_base_of_v<U, T> || std::is_convertible_v<T*, U*>);
+    return T::cast(other);
+  }
+  static constexpr Tagged<T> unchecked_cast(TaggedBase other) {
+    // Don't check incoming type for unchecked casts, in case the object
+    // definitions are not available.
+    return Tagged<T>(other.ptr());
+  }
+
+  constexpr Tagged() = default;
+
+  // Implicit conversion for subclasses.
+  template <typename U,
+            typename = std::enable_if_t<std::is_base_of_v<T, U> ||
+                                        std::is_convertible_v<U*, T*>>>
+  constexpr Tagged& operator=(Tagged<U> other) {
+    *this = Tagged(other);
+    return *this;
+  }
+
+  // Implicit conversion for subclasses.
+  template <typename U,
+            typename = std::enable_if_t<std::is_base_of_v<T, U> ||
+                                        std::is_convertible_v<U*, T*>>>
+  // NOLINTNEXTLINE
+  constexpr Tagged(Tagged<U> other) : Base(other) {}
+
+  constexpr T operator*() const { return ToRawPtr(); }
+  constexpr detail::TaggedOperatorArrowRef<T> operator->() const {
+    return detail::TaggedOperatorArrowRef<T>{ToRawPtr()};
+  }
+
+  // Implicit conversions and explicit casts to/from raw pointers
+  // TODO(leszeks): Remove once we're using Tagged everywhere.
+  template <typename U,
+            typename = std::enable_if_t<std::is_base_of_v<T, U> ||
+                                        std::is_convertible_v<U*, T*>>>
+  // NOLINTNEXTLINE
+  constexpr Tagged(U raw) : Base(raw.ptr()) {
+    static_assert(kTaggedCanConvertToRawObjects);
+  }
+  template <typename U,
+            typename = std::enable_if_t<std::is_base_of_v<U, T> ||
+                                        std::is_convertible_v<T*, U*>>>
+  // NOLINTNEXTLINE
+  constexpr operator U() const {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return ToRawPtr();
+  }
+  template <typename U>
+  static constexpr Tagged<T> cast(U other) {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return Tagged<T>::cast(Tagged<U>(other));
+  }
+
+ private:
+  friend T;
+  // Handles of the same type are allowed to access the Address constructor.
+  friend class Handle<T>;
+#ifdef V8_ENABLE_DIRECT_HANDLE
+  friend class DirectHandle<T>;
+#endif
+
+  constexpr explicit Tagged(Address ptr) : Base(ptr) {}
+  constexpr T ToRawPtr() const {
+    return T(this->ptr(), typename T::SkipTypeCheckTag{});
+  }
+};
+
+// Deduction guide to simplify Foo->Tagged<Foo> transition.
+// TODO(leszeks): Remove once we're using Tagged everywhere.
+static_assert(kTaggedCanConvertToRawObjects);
+template <class T>
+Tagged(T object) -> Tagged<T>;
+
+template <typename T>
+struct RemoveTagged {
+  using type = T;
+};
+
+template <typename T>
+struct RemoveTagged<Tagged<T>> {
+  using type = T;
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_OBJECTS_TAGGED_H_
diff --git a/deps/v8/src/objects/template-objects.cc b/deps/v8/src/objects/template-objects.cc
index a833ff9c2531f7..06e18695dde980 100644
--- a/deps/v8/src/objects/template-objects.cc
+++ b/deps/v8/src/objects/template-objects.cc
@@ -16,23 +16,26 @@ namespace v8 {
 namespace internal {
 
 namespace {
-bool CachedTemplateMatches(Isolate* isolate, NativeContext native_context,
-                           JSArray entry, int function_literal_id, int slot_id,
-                           DisallowGarbageCollection& no_gc) {
-  if (native_context.is_js_array_template_literal_object_map(
-          entry.map(isolate))) {
-    TemplateLiteralObject template_object = TemplateLiteralObject::cast(entry);
-    return template_object.function_literal_id() == function_literal_id &&
-           template_object.slot_id() == slot_id;
+bool CachedTemplateMatches(Isolate* isolate,
+                           Tagged<NativeContext> native_context,
+                           Tagged<JSArray> entry, int function_literal_id,
+                           int slot_id, DisallowGarbageCollection& no_gc) {
+  if (native_context->is_js_array_template_literal_object_map(
+          entry->map(isolate))) {
+    Tagged<TemplateLiteralObject> template_object =
+        TemplateLiteralObject::cast(entry);
+    return template_object->function_literal_id() == function_literal_id &&
+           template_object->slot_id() == slot_id;
   }
 
   Handle<JSArray> entry_handle(entry, isolate);
-  Smi cached_function_literal_id = Smi::cast(*JSReceiver::GetDataProperty(
-      isolate, entry_handle,
-      isolate->factory()->template_literal_function_literal_id_symbol()));
+  Tagged<Smi> cached_function_literal_id =
+      Smi::cast(*JSReceiver::GetDataProperty(
+          isolate, entry_handle,
+          isolate->factory()->template_literal_function_literal_id_symbol()));
   if (cached_function_literal_id.value() != function_literal_id) return false;
 
-  Smi cached_slot_id = Smi::cast(*JSReceiver::GetDataProperty(
+  Tagged<Smi> cached_slot_id = Smi::cast(*JSReceiver::GetDataProperty(
       isolate, entry_handle,
       isolate->factory()->template_literal_slot_id_symbol()));
   if (cached_slot_id.value() != slot_id) return false;
@@ -54,25 +57,27 @@ Handle<JSArray> TemplateObjectDescription::GetTemplateObject(
       EphemeronHashTable::ShapeT::Hash(ReadOnlyRoots(isolate), script);
   MaybeHandle<ArrayList> maybe_cached_templates;
 
-  if (!native_context->template_weakmap().IsUndefined(isolate)) {
+  if (!IsUndefined(native_context->template_weakmap(), isolate)) {
     DisallowGarbageCollection no_gc;
     // The no_gc keeps this safe, and gcmole is confused because
     // CachedTemplateMatches calls JSReceiver::GetDataProperty.
     DisableGCMole no_gcmole;
     ReadOnlyRoots roots(isolate);
-    EphemeronHashTable template_weakmap =
+    Tagged<EphemeronHashTable> template_weakmap =
         EphemeronHashTable::cast(native_context->template_weakmap());
-    Object cached_templates_lookup =
-        template_weakmap.Lookup(isolate, script, hash);
-    if (!cached_templates_lookup.IsTheHole(roots)) {
-      ArrayList cached_templates = ArrayList::cast(cached_templates_lookup);
+    Tagged<Object> cached_templates_lookup =
+        template_weakmap->Lookup(isolate, script, hash);
+    if (!IsTheHole(cached_templates_lookup, roots)) {
+      Tagged<ArrayList> cached_templates =
+          ArrayList::cast(cached_templates_lookup);
       maybe_cached_templates = handle(cached_templates, isolate);
 
       // Linear search over the cached template array list for a template
       // object matching the given function_literal_id + slot_id.
       // TODO(leszeks): Consider keeping this list sorted for faster lookup.
-      for (int i = 0; i < cached_templates.Length(); i++) {
-        JSArray template_object = JSArray::cast(cached_templates.Get(i));
+      for (int i = 0; i < cached_templates->Length(); i++) {
+        Tagged<JSArray> template_object =
+            JSArray::cast(cached_templates->Get(i));
         if (CachedTemplateMatches(isolate, *native_context, template_object,
                                   function_literal_id, slot_id, no_gc)) {
           return handle(template_object, isolate);
@@ -100,9 +105,10 @@ Handle<JSArray> TemplateObjectDescription::GetTemplateObject(
   Handle<ArrayList> old_cached_templates;
   if (!maybe_cached_templates.ToHandle(&old_cached_templates) ||
       *old_cached_templates != *cached_templates) {
-    HeapObject maybe_template_weakmap = native_context->template_weakmap();
+    Tagged<HeapObject> maybe_template_weakmap =
+        native_context->template_weakmap();
     Handle<EphemeronHashTable> template_weakmap;
-    if (maybe_template_weakmap.IsUndefined()) {
+    if (IsUndefined(maybe_template_weakmap)) {
       template_weakmap = EphemeronHashTable::New(isolate, 1);
     } else {
       template_weakmap =
@@ -116,7 +122,7 @@ Handle<JSArray> TemplateObjectDescription::GetTemplateObject(
   // Check that the list is in the appropriate location on the weakmap, and
   // that the appropriate entry is in the right location in this list.
   DCHECK_EQ(EphemeronHashTable::cast(native_context->template_weakmap())
-                .Lookup(isolate, script, hash),
+                ->Lookup(isolate, script, hash),
             *cached_templates);
   DCHECK_EQ(cached_templates->Get(cached_templates->Length() - 1),
             *template_object);
diff --git a/deps/v8/src/objects/template-objects.h b/deps/v8/src/objects/template-objects.h
index 0908a20b52faf0..00908bc972abd1 100644
--- a/deps/v8/src/objects/template-objects.h
+++ b/deps/v8/src/objects/template-objects.h
@@ -15,6 +15,7 @@
 namespace v8 {
 namespace internal {
 
+class Oddball;
 class StructBodyDescriptor;
 
 #include "torque-generated/src/objects/template-objects-tq.inc"
diff --git a/deps/v8/src/objects/templates-inl.h b/deps/v8/src/objects/templates-inl.h
index bb0d6a8dc6dc6d..afa42afc4e669d 100644
--- a/deps/v8/src/objects/templates-inl.h
+++ b/deps/v8/src/objects/templates-inl.h
@@ -24,51 +24,64 @@ TQ_OBJECT_CONSTRUCTORS_IMPL(FunctionTemplateInfo)
 TQ_OBJECT_CONSTRUCTORS_IMPL(ObjectTemplateInfo)
 TQ_OBJECT_CONSTRUCTORS_IMPL(FunctionTemplateRareData)
 
-NEVER_READ_ONLY_SPACE_IMPL(TemplateInfo)
+NEVER_READ_ONLY_SPACE_IMPL(ObjectTemplateInfo)
 
-BOOL_ACCESSORS(FunctionTemplateInfo, flag, undetectable,
+BOOL_ACCESSORS(FunctionTemplateInfo, relaxed_flag, undetectable,
                UndetectableBit::kShift)
-BOOL_ACCESSORS(FunctionTemplateInfo, flag, needs_access_check,
+BOOL_ACCESSORS(FunctionTemplateInfo, relaxed_flag, needs_access_check,
                NeedsAccessCheckBit::kShift)
-BOOL_ACCESSORS(FunctionTemplateInfo, flag, read_only_prototype,
+BOOL_ACCESSORS(FunctionTemplateInfo, relaxed_flag, read_only_prototype,
                ReadOnlyPrototypeBit::kShift)
-BOOL_ACCESSORS(FunctionTemplateInfo, flag, remove_prototype,
+BOOL_ACCESSORS(FunctionTemplateInfo, relaxed_flag, remove_prototype,
                RemovePrototypeBit::kShift)
-BOOL_ACCESSORS(FunctionTemplateInfo, flag, accept_any_receiver,
+BOOL_ACCESSORS(FunctionTemplateInfo, relaxed_flag, accept_any_receiver,
                AcceptAnyReceiverBit::kShift)
-BOOL_ACCESSORS(FunctionTemplateInfo, flag, published, PublishedBit::kShift)
+BOOL_ACCESSORS(FunctionTemplateInfo, relaxed_flag, published,
+               PublishedBit::kShift)
 
 BIT_FIELD_ACCESSORS(
-    FunctionTemplateInfo, flag, allowed_receiver_instance_type_range_start,
+    FunctionTemplateInfo, relaxed_flag,
+    allowed_receiver_instance_type_range_start,
     FunctionTemplateInfo::AllowedReceiverInstanceTypeRangeStartBits)
 BIT_FIELD_ACCESSORS(
-    FunctionTemplateInfo, flag, allowed_receiver_instance_type_range_end,
+    FunctionTemplateInfo, relaxed_flag,
+    allowed_receiver_instance_type_range_end,
     FunctionTemplateInfo::AllowedReceiverInstanceTypeRangeEndBits)
 
+int32_t FunctionTemplateInfo::relaxed_flag() const {
+  return flag(kRelaxedLoad);
+}
+void FunctionTemplateInfo::set_relaxed_flag(int32_t flags) {
+  return set_flag(flags, kRelaxedStore);
+}
+
 // static
-FunctionTemplateRareData FunctionTemplateInfo::EnsureFunctionTemplateRareData(
+Tagged<FunctionTemplateRareData>
+FunctionTemplateInfo::EnsureFunctionTemplateRareData(
     Isolate* isolate, Handle<FunctionTemplateInfo> function_template_info) {
-  HeapObject extra = function_template_info->rare_data(isolate, kAcquireLoad);
-  if (extra.IsUndefined(isolate)) {
+  Tagged<HeapObject> extra =
+      function_template_info->rare_data(isolate, kAcquireLoad);
+  if (IsUndefined(extra, isolate)) {
     return AllocateFunctionTemplateRareData(isolate, function_template_info);
   } else {
     return FunctionTemplateRareData::cast(extra);
   }
 }
 
-#define RARE_ACCESSORS(Name, CamelName, Type, Default)                        \
-  DEF_GETTER(FunctionTemplateInfo, Get##CamelName, Type) {                    \
-    HeapObject extra = rare_data(cage_base, kAcquireLoad);                    \
-    HeapObject undefined = GetReadOnlyRoots(cage_base).undefined_value();     \
-    return extra == undefined ? Default                                       \
-                              : FunctionTemplateRareData::cast(extra).Name(); \
-  }                                                                           \
-  inline void FunctionTemplateInfo::Set##CamelName(                           \
-      Isolate* isolate, Handle<FunctionTemplateInfo> function_template_info,  \
-      Handle<Type> Name) {                                                    \
-    FunctionTemplateRareData rare_data =                                      \
-        EnsureFunctionTemplateRareData(isolate, function_template_info);      \
-    rare_data.set_##Name(*Name);                                              \
+#define RARE_ACCESSORS(Name, CamelName, Type, Default)                         \
+  DEF_GETTER(FunctionTemplateInfo, Get##CamelName, Tagged<Type>) {             \
+    Tagged<HeapObject> extra = rare_data(cage_base, kAcquireLoad);             \
+    Tagged<Undefined> undefined =                                              \
+        GetReadOnlyRoots(cage_base).undefined_value();                         \
+    return extra == undefined ? Default                                        \
+                              : FunctionTemplateRareData::cast(extra)->Name(); \
+  }                                                                            \
+  inline void FunctionTemplateInfo::Set##CamelName(                            \
+      Isolate* isolate, Handle<FunctionTemplateInfo> function_template_info,   \
+      Handle<Type> Name) {                                                     \
+    Tagged<FunctionTemplateRareData> rare_data =                               \
+        EnsureFunctionTemplateRareData(isolate, function_template_info);       \
+    rare_data->set_##Name(*Name);                                              \
   }
 
 RARE_ACCESSORS(prototype_template, PrototypeTemplate, HeapObject, undefined)
@@ -112,37 +125,38 @@ bool TemplateInfo::should_cache() const {
 bool TemplateInfo::is_cached() const { return serial_number() > kUncached; }
 
 bool FunctionTemplateInfo::instantiated() {
-  return shared_function_info().IsSharedFunctionInfo();
+  return IsSharedFunctionInfo(shared_function_info());
 }
 
-inline bool FunctionTemplateInfo::BreakAtEntry() {
-  Object maybe_shared = shared_function_info();
-  if (maybe_shared.IsSharedFunctionInfo()) {
-    SharedFunctionInfo shared = SharedFunctionInfo::cast(maybe_shared);
-    return shared.BreakAtEntry();
+inline bool FunctionTemplateInfo::BreakAtEntry(Isolate* isolate) {
+  Tagged<Object> maybe_shared = shared_function_info();
+  if (IsSharedFunctionInfo(maybe_shared)) {
+    Tagged<SharedFunctionInfo> shared = SharedFunctionInfo::cast(maybe_shared);
+    return shared->BreakAtEntry(isolate);
   }
   return false;
 }
 
-FunctionTemplateInfo FunctionTemplateInfo::GetParent(Isolate* isolate) {
-  Object parent = GetParentTemplate();
-  return parent.IsUndefined(isolate) ? FunctionTemplateInfo()
-                                     : FunctionTemplateInfo::cast(parent);
+Tagged<FunctionTemplateInfo> FunctionTemplateInfo::GetParent(Isolate* isolate) {
+  Tagged<Object> parent = GetParentTemplate();
+  return IsUndefined(parent, isolate) ? Tagged<FunctionTemplateInfo>{}
+                                      : FunctionTemplateInfo::cast(parent);
 }
 
-ObjectTemplateInfo ObjectTemplateInfo::GetParent(Isolate* isolate) {
-  Object maybe_ctor = constructor();
-  if (maybe_ctor.IsUndefined(isolate)) return ObjectTemplateInfo();
-  FunctionTemplateInfo constructor = FunctionTemplateInfo::cast(maybe_ctor);
+Tagged<ObjectTemplateInfo> ObjectTemplateInfo::GetParent(Isolate* isolate) {
+  Tagged<Object> maybe_ctor = constructor();
+  if (IsUndefined(maybe_ctor, isolate)) return ObjectTemplateInfo();
+  Tagged<FunctionTemplateInfo> constructor =
+      FunctionTemplateInfo::cast(maybe_ctor);
   while (true) {
-    constructor = constructor.GetParent(isolate);
+    constructor = constructor->GetParent(isolate);
     if (constructor.is_null()) return ObjectTemplateInfo();
-    Object maybe_obj = constructor.GetInstanceTemplate();
-    if (!maybe_obj.IsUndefined(isolate)) {
+    Tagged<Object> maybe_obj = constructor->GetInstanceTemplate();
+    if (!IsUndefined(maybe_obj, isolate)) {
       return ObjectTemplateInfo::cast(maybe_obj);
     }
   }
-  return ObjectTemplateInfo();
+  return Tagged<ObjectTemplateInfo>();
 }
 
 int ObjectTemplateInfo::embedder_field_count() const {
@@ -170,8 +184,24 @@ void ObjectTemplateInfo::set_code_like(bool is_code_like) {
   return set_data(IsCodeKindBit::update(data(), is_code_like));
 }
 
-bool FunctionTemplateInfo::IsTemplateFor(JSObject object) {
-  return IsTemplateFor(object.map());
+bool FunctionTemplateInfo::IsTemplateFor(Tagged<JSObject> object) const {
+  return IsTemplateFor(object->map());
+}
+
+bool TemplateInfo::TryGetIsolate(Isolate** isolate) const {
+  if (GetIsolateFromHeapObject(*this, isolate)) return true;
+  Isolate* isolate_value = Isolate::TryGetCurrent();
+  if (isolate_value != nullptr) {
+    *isolate = isolate_value;
+    return true;
+  }
+  return false;
+}
+
+Isolate* TemplateInfo::GetIsolateChecked() const {
+  Isolate* isolate;
+  CHECK(TryGetIsolate(&isolate));
+  return isolate;
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/templates.cc b/deps/v8/src/objects/templates.cc
index b708a89dbf341a..c197cde6d4564d 100644
--- a/deps/v8/src/objects/templates.cc
+++ b/deps/v8/src/objects/templates.cc
@@ -25,15 +25,15 @@ bool FunctionTemplateInfo::HasInstanceType() {
 Handle<SharedFunctionInfo> FunctionTemplateInfo::GetOrCreateSharedFunctionInfo(
     Isolate* isolate, Handle<FunctionTemplateInfo> info,
     MaybeHandle<Name> maybe_name) {
-  Object current_info = info->shared_function_info();
-  if (current_info.IsSharedFunctionInfo()) {
+  Tagged<Object> current_info = info->shared_function_info();
+  if (IsSharedFunctionInfo(current_info)) {
     return handle(SharedFunctionInfo::cast(current_info), isolate);
   }
   Handle<Name> name;
   Handle<String> name_string;
-  if (maybe_name.ToHandle(&name) && name->IsString()) {
+  if (maybe_name.ToHandle(&name) && IsString(*name)) {
     name_string = Handle<String>::cast(name);
-  } else if (info->class_name().IsString()) {
+  } else if (IsString(info->class_name())) {
     name_string = handle(String::cast(info->class_name()), isolate);
   } else {
     name_string = isolate->factory()->empty_string();
@@ -49,30 +49,30 @@ Handle<SharedFunctionInfo> FunctionTemplateInfo::GetOrCreateSharedFunctionInfo(
                                                               function_kind);
   {
     DisallowGarbageCollection no_gc;
-    auto raw_sfi = *sfi;
-    auto raw_template = *info;
-    raw_sfi.set_length(raw_template.length());
-    raw_sfi.DontAdaptArguments();
-    DCHECK(raw_sfi.IsApiFunction());
-    raw_template.set_shared_function_info(raw_sfi);
+    Tagged<SharedFunctionInfo> raw_sfi = *sfi;
+    Tagged<FunctionTemplateInfo> raw_template = *info;
+    raw_sfi->set_length(raw_template->length());
+    raw_sfi->DontAdaptArguments();
+    DCHECK(raw_sfi->IsApiFunction());
+    raw_template->set_shared_function_info(raw_sfi);
   }
   return sfi;
 }
 
-bool FunctionTemplateInfo::IsTemplateFor(Map map) const {
+bool FunctionTemplateInfo::IsTemplateFor(Tagged<Map> map) const {
   RCS_SCOPE(
       LocalHeap::Current() == nullptr
-          ? GetIsolate()->counters()->runtime_call_stats()
+          ? GetIsolateChecked()->counters()->runtime_call_stats()
           : LocalIsolate::FromHeap(LocalHeap::Current())->runtime_call_stats(),
       RuntimeCallCounterId::kIsTemplateFor);
 
   // There is a constraint on the object; check.
-  if (!map.IsJSObjectMap()) return false;
+  if (!IsJSObjectMap(map)) return false;
 
   if (v8_flags.embedder_instance_types) {
     DCHECK_IMPLIES(allowed_receiver_instance_type_range_start() == 0,
                    allowed_receiver_instance_type_range_end() == 0);
-    if (base::IsInRange(map.instance_type(),
+    if (base::IsInRange(map->instance_type(),
                         allowed_receiver_instance_type_range_start(),
                         allowed_receiver_instance_type_range_end())) {
       return true;
@@ -80,40 +80,41 @@ bool FunctionTemplateInfo::IsTemplateFor(Map map) const {
   }
 
   // Fetch the constructor function of the object.
-  Object cons_obj = map.GetConstructor();
-  Object type;
-  if (cons_obj.IsJSFunction()) {
-    JSFunction fun = JSFunction::cast(cons_obj);
-    type = fun.shared().function_data(kAcquireLoad);
-  } else if (cons_obj.IsFunctionTemplateInfo()) {
+  Tagged<Object> cons_obj = map->GetConstructor();
+  Tagged<Object> type;
+  if (IsJSFunction(cons_obj)) {
+    Tagged<JSFunction> fun = JSFunction::cast(cons_obj);
+    type = fun->shared()->function_data(kAcquireLoad);
+  } else if (IsFunctionTemplateInfo(cons_obj)) {
     type = FunctionTemplateInfo::cast(cons_obj);
   } else {
     return false;
   }
   // Iterate through the chain of inheriting function templates to
   // see if the required one occurs.
-  while (type.IsFunctionTemplateInfo()) {
+  while (IsFunctionTemplateInfo(type)) {
     if (type == *this) return true;
-    type = FunctionTemplateInfo::cast(type).GetParentTemplate();
+    type = FunctionTemplateInfo::cast(type)->GetParentTemplate();
   }
   // Didn't find the required type in the inheritance chain.
   return false;
 }
 
-bool FunctionTemplateInfo::IsLeafTemplateForApiObject(Object object) const {
+bool FunctionTemplateInfo::IsLeafTemplateForApiObject(
+    Tagged<Object> object) const {
   i::DisallowGarbageCollection no_gc;
 
-  if (!object.IsJSApiObject()) {
+  if (!IsJSApiObject(object)) {
     return false;
   }
 
   bool result = false;
-  Map map = HeapObject::cast(object).map();
-  Object constructor_obj = map.GetConstructor();
-  if (constructor_obj.IsJSFunction()) {
+  Tagged<Map> map = HeapObject::cast(object)->map();
+  Tagged<Object> constructor_obj = map->GetConstructor();
+  if (IsJSFunction(constructor_obj)) {
     JSFunction fun = JSFunction::cast(constructor_obj);
-    result = (*this == fun.shared().function_data(kAcquireLoad));
-  } else if (constructor_obj.IsFunctionTemplateInfo()) {
+    result = (*this == fun->shared()->function_data(kAcquireLoad));
+  } else if (IsFunctionTemplateInfo(constructor_obj)) {
     result = (*this == constructor_obj);
   }
   DCHECK_IMPLIES(result, IsTemplateFor(map));
@@ -121,47 +122,49 @@ bool FunctionTemplateInfo::IsLeafTemplateForApiObject(Object object) const {
 }
 
 // static
-FunctionTemplateRareData FunctionTemplateInfo::AllocateFunctionTemplateRareData(
+Tagged<FunctionTemplateRareData>
+FunctionTemplateInfo::AllocateFunctionTemplateRareData(
     Isolate* isolate, Handle<FunctionTemplateInfo> function_template_info) {
-  DCHECK(function_template_info->rare_data(kAcquireLoad).IsUndefined(isolate));
+  DCHECK(IsUndefined(function_template_info->rare_data(kAcquireLoad), isolate));
   Handle<FunctionTemplateRareData> rare_data =
       isolate->factory()->NewFunctionTemplateRareData();
   function_template_info->set_rare_data(*rare_data, kReleaseStore);
   return *rare_data;
 }
 
-base::Optional<Name> FunctionTemplateInfo::TryGetCachedPropertyName(
-    Isolate* isolate, Object getter) {
+base::Optional<Tagged<Name>> FunctionTemplateInfo::TryGetCachedPropertyName(
+    Isolate* isolate, Tagged<Object> getter) {
   DisallowGarbageCollection no_gc;
-  if (!getter.IsFunctionTemplateInfo()) {
-    if (!getter.IsJSFunction()) return {};
-    SharedFunctionInfo info = JSFunction::cast(getter).shared();
-    if (!info.IsApiFunction()) return {};
-    getter = info.get_api_func_data();
+  if (!IsFunctionTemplateInfo(getter)) {
+    if (!IsJSFunction(getter)) return {};
+    SharedFunctionInfo info = JSFunction::cast(getter)->shared();
+    if (!info->IsApiFunction()) return {};
+    getter = info->api_func_data();
   }
   // Check if the accessor uses a cached property.
-  Object maybe_name = FunctionTemplateInfo::cast(getter).cached_property_name();
-  if (maybe_name.IsTheHole(isolate)) return {};
+  Tagged<Object> maybe_name =
+      FunctionTemplateInfo::cast(getter)->cached_property_name();
+  if (IsTheHole(maybe_name, isolate)) return {};
   return Name::cast(maybe_name);
 }
 
 int FunctionTemplateInfo::GetCFunctionsCount() const {
   i::DisallowHeapAllocation no_gc;
-  return FixedArray::cast(GetCFunctionOverloads()).length() /
+  return FixedArray::cast(GetCFunctionOverloads())->length() /
          kFunctionOverloadEntrySize;
 }
 
 Address FunctionTemplateInfo::GetCFunction(int index) const {
   i::DisallowHeapAllocation no_gc;
   return v8::ToCData<Address>(FixedArray::cast(GetCFunctionOverloads())
-                                  .get(index * kFunctionOverloadEntrySize));
+                                  ->get(index * kFunctionOverloadEntrySize));
 }
 
 const CFunctionInfo* FunctionTemplateInfo::GetCSignature(int index) const {
   i::DisallowHeapAllocation no_gc;
   return v8::ToCData<CFunctionInfo*>(
       FixedArray::cast(GetCFunctionOverloads())
-          .get(index * kFunctionOverloadEntrySize + 1));
+          ->get(index * kFunctionOverloadEntrySize + 1));
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/templates.h b/deps/v8/src/objects/templates.h
index 8ab006ab9743e9..1683a7cb0bcf87 100644
--- a/deps/v8/src/objects/templates.h
+++ b/deps/v8/src/objects/templates.h
@@ -5,6 +5,7 @@
 #ifndef V8_OBJECTS_TEMPLATES_H_
 #define V8_OBJECTS_TEMPLATES_H_
 
+#include "src/handles/handles.h"
 #include "src/objects/struct.h"
 #include "torque-generated/bit-fields.h"
 
@@ -22,8 +23,6 @@ namespace internal {
 
 class TemplateInfo : public TorqueGeneratedTemplateInfo<TemplateInfo, Struct> {
  public:
-  NEVER_READ_ONLY_SPACE
-
   static const int kFastTemplateInstantiationsCacheSize = 1 * KB;
 
   // While we could grow the slow cache until we run out of memory, we put
@@ -41,6 +40,9 @@ class TemplateInfo : public TorqueGeneratedTemplateInfo<TemplateInfo, Struct> {
   inline bool should_cache() const;
   inline bool is_cached() const;
 
+  inline bool TryGetIsolate(Isolate** isolate) const;
+  inline Isolate* GetIsolateChecked() const;
+
   using BodyDescriptor = StructBodyDescriptor;
 
   TQ_OBJECT_CONSTRUCTORS(TemplateInfo)
@@ -64,7 +66,7 @@ class FunctionTemplateInfo
                                                  TemplateInfo> {
  public:
 #define DECL_RARE_ACCESSORS(Name, CamelName, Type)                           \
-  DECL_GETTER(Get##CamelName, Type)                                          \
+  DECL_GETTER(Get##CamelName, Tagged<Type>)                                  \
   static inline void Set##CamelName(                                         \
       Isolate* isolate, Handle<FunctionTemplateInfo> function_template_info, \
       Handle<Type> Name);
@@ -135,9 +137,6 @@ class FunctionTemplateInfo
   DECL_INT16_ACCESSORS(allowed_receiver_instance_type_range_end)
   // End flag bits ---------------------
 
-  // Dispatched behavior.
-  DECL_PRINTER(FunctionTemplateInfo)
-
   inline int InstanceType() const;
   inline void SetInstanceType(int instance_type);
 
@@ -154,22 +153,22 @@ class FunctionTemplateInfo
   }
 
   // Returns parent function template or a null FunctionTemplateInfo.
-  inline FunctionTemplateInfo GetParent(Isolate* isolate);
+  inline Tagged<FunctionTemplateInfo> GetParent(Isolate* isolate);
   // Returns true if |object| is an instance of this function template.
-  inline bool IsTemplateFor(JSObject object);
-  bool IsTemplateFor(Map map) const;
+  inline bool IsTemplateFor(Tagged<JSObject> object) const;
+  bool IsTemplateFor(Tagged<Map> map) const;
   // Returns true if |object| is an API object and is constructed by this
   // particular function template (skips walking up the chain of inheriting
   // functions that is done by IsTemplateFor).
-  bool IsLeafTemplateForApiObject(Object object) const;
+  bool IsLeafTemplateForApiObject(Tagged<Object> object) const;
   inline bool instantiated();
 
-  bool BreakAtEntry();
+  bool BreakAtEntry(Isolate* isolate);
   bool HasInstanceType();
 
   // Helper function for cached accessors.
-  static base::Optional<Name> TryGetCachedPropertyName(Isolate* isolate,
-                                                       Object getter);
+  static base::Optional<Tagged<Name>> TryGetCachedPropertyName(
+      Isolate* isolate, Tagged<Object> getter);
   // Fast API overloads.
   int GetCFunctionsCount() const;
   Address GetCFunction(int index) const;
@@ -185,11 +184,15 @@ class FunctionTemplateInfo
   using BodyDescriptor = StructBodyDescriptor;
 
  private:
+  // For ease of use of the BITFIELD macro.
+  inline int32_t relaxed_flag() const;
+  inline void set_relaxed_flag(int32_t flags);
+
   static constexpr int kNoJSApiObjectType = 0;
-  static inline FunctionTemplateRareData EnsureFunctionTemplateRareData(
+  static inline Tagged<FunctionTemplateRareData> EnsureFunctionTemplateRareData(
       Isolate* isolate, Handle<FunctionTemplateInfo> function_template_info);
 
-  static FunctionTemplateRareData AllocateFunctionTemplateRareData(
+  static Tagged<FunctionTemplateRareData> AllocateFunctionTemplateRareData(
       Isolate* isolate, Handle<FunctionTemplateInfo> function_template_info);
 
   TQ_OBJECT_CONSTRUCTORS(FunctionTemplateInfo)
@@ -199,16 +202,15 @@ class ObjectTemplateInfo
     : public TorqueGeneratedObjectTemplateInfo<ObjectTemplateInfo,
                                                TemplateInfo> {
  public:
+  NEVER_READ_ONLY_SPACE
+
   DECL_INT_ACCESSORS(embedder_field_count)
   DECL_BOOLEAN_ACCESSORS(immutable_proto)
   DECL_BOOLEAN_ACCESSORS(code_like)
 
-  // Dispatched behavior.
-  DECL_PRINTER(ObjectTemplateInfo)
-
   // Starting from given object template's constructor walk up the inheritance
   // chain till a function template that has an instance template is found.
-  inline ObjectTemplateInfo GetParent(Isolate* isolate);
+  inline Tagged<ObjectTemplateInfo> GetParent(Isolate* isolate);
 
   using BodyDescriptor = StructBodyDescriptor;
 
diff --git a/deps/v8/src/objects/templates.tq b/deps/v8/src/objects/templates.tq
index a3bb7a9e3576fa..fec43b195e7c96 100644
--- a/deps/v8/src/objects/templates.tq
+++ b/deps/v8/src/objects/templates.tq
@@ -56,7 +56,7 @@ extern class FunctionTemplateInfo extends TemplateInfo {
   rare_data: FunctionTemplateRareData|Undefined;
   shared_function_info: SharedFunctionInfo|Undefined;
   // Internal field to store a flag bitfield.
-  flag: SmiTagged<FunctionTemplateInfoFlags>;
+  @cppRelaxedLoad @cppRelaxedStore flag: SmiTagged<FunctionTemplateInfoFlags>;
   // "length" property of the final JSFunction.
   length: Smi;
   // Either the_hole or a private symbol. Used to cache the result on
diff --git a/deps/v8/src/objects/torque-defined-classes.h b/deps/v8/src/objects/torque-defined-classes.h
index 4273d3471174be..e0a604f1626972 100644
--- a/deps/v8/src/objects/torque-defined-classes.h
+++ b/deps/v8/src/objects/torque-defined-classes.h
@@ -16,6 +16,8 @@
 namespace v8 {
 namespace internal {
 
+class Oddball;
+
 #include "torque-generated/src/objects/torque-defined-classes-tq.inc"
 
 }  // namespace internal
diff --git a/deps/v8/src/objects/transitions-inl.h b/deps/v8/src/objects/transitions-inl.h
index cfed97da44ad18..f092d55d34aa4a 100644
--- a/deps/v8/src/objects/transitions-inl.h
+++ b/deps/v8/src/objects/transitions-inl.h
@@ -18,7 +18,7 @@ namespace v8 {
 namespace internal {
 
 // static
-TransitionArray TransitionsAccessor::GetTransitionArray(
+Tagged<TransitionArray> TransitionsAccessor::GetTransitionArray(
     Isolate* isolate, MaybeObject raw_transitions) {
   DCHECK_EQ(kFullTransitionArray, GetEncoding(isolate, raw_transitions));
   USE(isolate);
@@ -26,13 +26,13 @@ TransitionArray TransitionsAccessor::GetTransitionArray(
 }
 
 // static
-TransitionArray TransitionsAccessor::GetTransitionArray(Isolate* isolate,
-                                                        Handle<Map> map) {
+Tagged<TransitionArray> TransitionsAccessor::GetTransitionArray(
+    Isolate* isolate, Handle<Map> map) {
   MaybeObject raw_transitions = map->raw_transitions(isolate, kAcquireLoad);
   return GetTransitionArray(isolate, raw_transitions);
 }
 
-TransitionArray TransitionsAccessor::transitions() {
+Tagged<TransitionArray> TransitionsAccessor::transitions() {
   return GetTransitionArray(isolate_, raw_transitions_);
 }
 
@@ -44,10 +44,10 @@ bool TransitionArray::HasPrototypeTransitions() {
   return Get(kPrototypeTransitionsIndex) != MaybeObject::FromSmi(Smi::zero());
 }
 
-WeakFixedArray TransitionArray::GetPrototypeTransitions() {
+Tagged<WeakFixedArray> TransitionArray::GetPrototypeTransitions() {
   DCHECK(HasPrototypeTransitions());  // Callers must check first.
-  Object prototype_transitions =
-      Get(kPrototypeTransitionsIndex)->GetHeapObjectAssumeStrong();
+  Tagged<Object> prototype_transitions =
+      Get(kPrototypeTransitionsIndex).GetHeapObjectAssumeStrong();
   return WeakFixedArray::cast(prototype_transitions);
 }
 
@@ -56,31 +56,32 @@ HeapObjectSlot TransitionArray::GetKeySlot(int transition_number) {
   return HeapObjectSlot(RawFieldOfElementAt(ToKeyIndex(transition_number)));
 }
 
-void TransitionArray::SetPrototypeTransitions(WeakFixedArray transitions) {
-  DCHECK(transitions.IsWeakFixedArray());
+void TransitionArray::SetPrototypeTransitions(
+    Tagged<WeakFixedArray> transitions) {
+  DCHECK(IsWeakFixedArray(transitions));
   WeakFixedArray::Set(kPrototypeTransitionsIndex,
                       HeapObjectReference::Strong(transitions));
 }
 
 int TransitionArray::NumberOfPrototypeTransitions(
-    WeakFixedArray proto_transitions) {
-  if (proto_transitions.length() == 0) return 0;
+    Tagged<WeakFixedArray> proto_transitions) {
+  if (proto_transitions->length() == 0) return 0;
   MaybeObject raw =
-      proto_transitions.Get(kProtoTransitionNumberOfEntriesOffset);
+      proto_transitions->Get(kProtoTransitionNumberOfEntriesOffset);
   return raw.ToSmi().value();
 }
 
-Name TransitionArray::GetKey(int transition_number) {
+Tagged<Name> TransitionArray::GetKey(int transition_number) {
   DCHECK(transition_number < number_of_transitions());
   return Name::cast(
-      Get(ToKeyIndex(transition_number))->GetHeapObjectAssumeStrong());
+      Get(ToKeyIndex(transition_number)).GetHeapObjectAssumeStrong());
 }
 
-Name TransitionArray::GetKey(InternalIndex index) {
+Tagged<Name> TransitionArray::GetKey(InternalIndex index) {
   return GetKey(index.as_int());
 }
 
-Name TransitionsAccessor::GetKey(int transition_number) {
+Tagged<Name> TransitionsAccessor::GetKey(int transition_number) {
   switch (encoding()) {
     case kPrototypeInfo:
     case kUninitialized:
@@ -88,16 +89,16 @@ Name TransitionsAccessor::GetKey(int transition_number) {
       UNREACHABLE();
       return Name();
     case kWeakRef: {
-      Map map = Map::cast(raw_transitions_->GetHeapObjectAssumeWeak());
+      Tagged<Map> map = Map::cast(raw_transitions_.GetHeapObjectAssumeWeak());
       return GetSimpleTransitionKey(map);
     }
     case kFullTransitionArray:
-      return transitions().GetKey(transition_number);
+      return transitions()->GetKey(transition_number);
   }
   UNREACHABLE();
 }
 
-void TransitionArray::SetKey(int transition_number, Name key) {
+void TransitionArray::SetKey(int transition_number, Tagged<Name> key) {
   DCHECK(transition_number < number_of_transitions());
   WeakFixedArray::Set(ToKeyIndex(transition_number),
                       HeapObjectReference::Strong(key));
@@ -109,28 +110,32 @@ HeapObjectSlot TransitionArray::GetTargetSlot(int transition_number) {
 }
 
 // static
-PropertyDetails TransitionsAccessor::GetTargetDetails(Name name, Map target) {
-  DCHECK(!IsSpecialTransition(name.GetReadOnlyRoots(), name));
-  InternalIndex descriptor = target.LastAdded();
-  DescriptorArray descriptors = target.instance_descriptors(kRelaxedLoad);
+PropertyDetails TransitionsAccessor::GetTargetDetails(Tagged<Name> name,
+                                                      Tagged<Map> target) {
+  DCHECK(!IsSpecialTransition(name->GetReadOnlyRoots(), name));
+  InternalIndex descriptor = target->LastAdded();
+  Tagged<DescriptorArray> descriptors =
+      target->instance_descriptors(kRelaxedLoad);
   // Transitions are allowed only for the last added property.
-  DCHECK(descriptors.GetKey(descriptor).Equals(name));
-  return descriptors.GetDetails(descriptor);
+  DCHECK(descriptors->GetKey(descriptor)->Equals(name));
+  return descriptors->GetDetails(descriptor);
 }
 
-PropertyDetails TransitionsAccessor::GetSimpleTargetDetails(Map transition) {
-  return transition.GetLastDescriptorDetails(isolate_);
+PropertyDetails TransitionsAccessor::GetSimpleTargetDetails(
+    Tagged<Map> transition) {
+  return transition->GetLastDescriptorDetails(isolate_);
 }
 
 // static
-Name TransitionsAccessor::GetSimpleTransitionKey(Map transition) {
-  InternalIndex descriptor = transition.LastAdded();
-  return transition.instance_descriptors().GetKey(descriptor);
+Tagged<Name> TransitionsAccessor::GetSimpleTransitionKey(
+    Tagged<Map> transition) {
+  InternalIndex descriptor = transition->LastAdded();
+  return transition->instance_descriptors()->GetKey(descriptor);
 }
 
 // static
-Map TransitionsAccessor::GetTargetFromRaw(MaybeObject raw) {
-  return Map::cast(raw->GetHeapObjectAssumeWeak());
+Tagged<Map> TransitionsAccessor::GetTargetFromRaw(MaybeObject raw) {
+  return Map::cast(raw.GetHeapObjectAssumeWeak());
 }
 
 MaybeObject TransitionArray::GetRawTarget(int transition_number) {
@@ -138,12 +143,12 @@ MaybeObject TransitionArray::GetRawTarget(int transition_number) {
   return Get(ToTargetIndex(transition_number));
 }
 
-Map TransitionArray::GetTarget(int transition_number) {
+Tagged<Map> TransitionArray::GetTarget(int transition_number) {
   MaybeObject raw = GetRawTarget(transition_number);
   return TransitionsAccessor::GetTargetFromRaw(raw);
 }
 
-Map TransitionsAccessor::GetTarget(int transition_number) {
+Tagged<Map> TransitionsAccessor::GetTarget(int transition_number) {
   switch (encoding()) {
     case kPrototypeInfo:
     case kUninitialized:
@@ -151,9 +156,9 @@ Map TransitionsAccessor::GetTarget(int transition_number) {
       UNREACHABLE();
       return Map();
     case kWeakRef:
-      return Map::cast(raw_transitions_->GetHeapObjectAssumeWeak());
+      return Map::cast(raw_transitions_.GetHeapObjectAssumeWeak());
     case kFullTransitionArray:
-      return transitions().GetTarget(transition_number);
+      return transitions()->GetTarget(transition_number);
   }
   UNREACHABLE();
 }
@@ -161,14 +166,14 @@ Map TransitionsAccessor::GetTarget(int transition_number) {
 void TransitionArray::SetRawTarget(int transition_number, MaybeObject value) {
   DCHECK(transition_number < number_of_transitions());
   DCHECK(value->IsWeak());
-  DCHECK(value->GetHeapObjectAssumeWeak().IsMap());
+  DCHECK(IsMap(value.GetHeapObjectAssumeWeak()));
   WeakFixedArray::Set(ToTargetIndex(transition_number), value);
 }
 
 bool TransitionArray::GetTargetIfExists(int transition_number, Isolate* isolate,
-                                        Map* target) {
+                                        Tagged<Map>* target) {
   MaybeObject raw = GetRawTarget(transition_number);
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
   // If the raw target is a Smi, then this TransitionArray is in the process of
   // being deserialized, and doesn't yet have an initialized entry for this
   // transition.
@@ -177,62 +182,64 @@ bool TransitionArray::GetTargetIfExists(int transition_number, Isolate* isolate,
     DCHECK_EQ(raw.ToSmi(), Smi::uninitialized_deserialization_value());
     return false;
   }
-  if (raw->GetHeapObjectIfStrong(&heap_object) &&
-      heap_object.IsUndefined(isolate)) {
+  if (raw.GetHeapObjectIfStrong(&heap_object) &&
+      IsUndefined(heap_object, isolate)) {
     return false;
   }
   *target = TransitionsAccessor::GetTargetFromRaw(raw);
   return true;
 }
 
-int TransitionArray::SearchNameForTesting(Name name, int* out_insertion_index) {
+int TransitionArray::SearchNameForTesting(Tagged<Name> name,
+                                          int* out_insertion_index) {
   return SearchName(name, out_insertion_index);
 }
 
-Map TransitionArray::SearchAndGetTargetForTesting(
-    PropertyKind kind, Name name, PropertyAttributes attributes) {
+Tagged<Map> TransitionArray::SearchAndGetTargetForTesting(
+    PropertyKind kind, Tagged<Name> name, PropertyAttributes attributes) {
   return SearchAndGetTarget(kind, name, attributes);
 }
 
-int TransitionArray::SearchSpecial(Symbol symbol, bool concurrent_search,
+int TransitionArray::SearchSpecial(Tagged<Symbol> symbol,
+                                   bool concurrent_search,
                                    int* out_insertion_index) {
   return SearchName(symbol, concurrent_search, out_insertion_index);
 }
 
-int TransitionArray::SearchName(Name name, bool concurrent_search,
+int TransitionArray::SearchName(Tagged<Name> name, bool concurrent_search,
                                 int* out_insertion_index) {
-  DCHECK(name.IsUniqueName());
+  DCHECK(IsUniqueName(name));
   return internal::Search<ALL_ENTRIES>(this, name, number_of_entries(),
                                        out_insertion_index, concurrent_search);
 }
 
-TransitionsAccessor::TransitionsAccessor(Isolate* isolate, Map map,
+TransitionsAccessor::TransitionsAccessor(Isolate* isolate, Tagged<Map> map,
                                          bool concurrent_access)
     : isolate_(isolate),
       map_(map),
-      raw_transitions_(map.raw_transitions(isolate_, kAcquireLoad)),
+      raw_transitions_(map->raw_transitions(isolate_, kAcquireLoad)),
       encoding_(GetEncoding(isolate_, raw_transitions_)),
       concurrent_access_(concurrent_access) {
-  DCHECK_IMPLIES(encoding_ == kMigrationTarget, map_.is_deprecated());
+  DCHECK_IMPLIES(encoding_ == kMigrationTarget, map_->is_deprecated());
 }
 
-int TransitionsAccessor::Capacity() { return transitions().Capacity(); }
+int TransitionsAccessor::Capacity() { return transitions()->Capacity(); }
 
 // static
 TransitionsAccessor::Encoding TransitionsAccessor::GetEncoding(
     Isolate* isolate, MaybeObject raw_transitions) {
-  HeapObject heap_object;
+  Tagged<HeapObject> heap_object;
   if (raw_transitions->IsSmi() || raw_transitions->IsCleared()) {
     return kUninitialized;
   } else if (raw_transitions->IsWeak()) {
     return kWeakRef;
-  } else if (raw_transitions->GetHeapObjectIfStrong(isolate, &heap_object)) {
-    if (heap_object.IsTransitionArray()) {
+  } else if (raw_transitions.GetHeapObjectIfStrong(isolate, &heap_object)) {
+    if (IsTransitionArray(heap_object)) {
       return kFullTransitionArray;
-    } else if (heap_object.IsPrototypeInfo()) {
+    } else if (IsPrototypeInfo(heap_object)) {
       return kPrototypeInfo;
     } else {
-      DCHECK(heap_object.IsMap());
+      DCHECK(IsMap(heap_object));
       return kMigrationTarget;
     }
   } else {
@@ -242,7 +249,7 @@ TransitionsAccessor::Encoding TransitionsAccessor::GetEncoding(
 
 // static
 TransitionsAccessor::Encoding TransitionsAccessor::GetEncoding(
-    Isolate* isolate, TransitionArray array) {
+    Isolate* isolate, Tagged<TransitionArray> array) {
   return GetEncoding(isolate, MaybeObject::FromObject(array));
 }
 
@@ -255,10 +262,10 @@ TransitionsAccessor::Encoding TransitionsAccessor::GetEncoding(
 
 // static
 MaybeHandle<Map> TransitionsAccessor::SearchTransition(
-    Isolate* isolate, Handle<Map> map, Name name, PropertyKind kind,
+    Isolate* isolate, Handle<Map> map, Tagged<Name> name, PropertyKind kind,
     PropertyAttributes attributes) {
-  Map result = TransitionsAccessor(isolate, *map)
-                   .SearchTransition(name, kind, attributes);
+  Tagged<Map> result = TransitionsAccessor(isolate, *map)
+                           .SearchTransition(name, kind, attributes);
   if (result.is_null()) return MaybeHandle<Map>();
   return MaybeHandle<Map>(result, isolate);
 }
@@ -266,8 +273,8 @@ MaybeHandle<Map> TransitionsAccessor::SearchTransition(
 // static
 MaybeHandle<Map> TransitionsAccessor::SearchSpecial(Isolate* isolate,
                                                     Handle<Map> map,
-                                                    Symbol name) {
-  Map result = TransitionsAccessor(isolate, *map).SearchSpecial(name);
+                                                    Tagged<Symbol> name) {
+  Tagged<Map> result = TransitionsAccessor(isolate, *map).SearchSpecial(name);
   if (result.is_null()) return MaybeHandle<Map>();
   return MaybeHandle<Map>(result, isolate);
 }
@@ -277,9 +284,11 @@ int TransitionArray::number_of_transitions() const {
   return Get(kTransitionLengthIndex).ToSmi().value();
 }
 
-int TransitionArray::CompareKeys(Name key1, uint32_t hash1, PropertyKind kind1,
-                                 PropertyAttributes attributes1, Name key2,
-                                 uint32_t hash2, PropertyKind kind2,
+int TransitionArray::CompareKeys(Tagged<Name> key1, uint32_t hash1,
+                                 PropertyKind kind1,
+                                 PropertyAttributes attributes1,
+                                 Tagged<Name> key2, uint32_t hash2,
+                                 PropertyKind kind2,
                                  PropertyAttributes attributes2) {
   int cmp = CompareNames(key1, hash1, key2, hash2);
   if (cmp != 0) return cmp;
@@ -287,8 +296,8 @@ int TransitionArray::CompareKeys(Name key1, uint32_t hash1, PropertyKind kind1,
   return CompareDetails(kind1, attributes1, kind2, attributes2);
 }
 
-int TransitionArray::CompareNames(Name key1, uint32_t hash1, Name key2,
-                                  uint32_t hash2) {
+int TransitionArray::CompareNames(Tagged<Name> key1, uint32_t hash1,
+                                  Tagged<Name> key2, uint32_t hash2) {
   if (key1 != key2) {
     // In case of hash collisions key1 is always "less" than key2.
     return hash1 <= hash2 ? -1 : 1;
@@ -313,13 +322,14 @@ int TransitionArray::CompareDetails(PropertyKind kind1,
   return 0;
 }
 
-void TransitionArray::Set(int transition_number, Name key, MaybeObject target) {
+void TransitionArray::Set(int transition_number, Tagged<Name> key,
+                          MaybeObject target) {
   WeakFixedArray::Set(ToKeyIndex(transition_number),
                       MaybeObject::FromObject(key));
   WeakFixedArray::Set(ToTargetIndex(transition_number), target);
 }
 
-Name TransitionArray::GetSortedKey(int transition_number) {
+Tagged<Name> TransitionArray::GetSortedKey(int transition_number) {
   return GetKey(transition_number);
 }
 
@@ -348,14 +358,15 @@ Handle<String> TransitionsAccessor::ExpectedTransitionKey() {
     case kFullTransitionArray:
       return Handle<String>::null();
     case kWeakRef: {
-      Map target = Map::cast(raw_transitions_->GetHeapObjectAssumeWeak());
+      Tagged<Map> target =
+          Map::cast(raw_transitions_.GetHeapObjectAssumeWeak());
       PropertyDetails details = GetSimpleTargetDetails(target);
       if (details.location() != PropertyLocation::kField)
         return Handle<String>::null();
       DCHECK_EQ(PropertyKind::kData, details.kind());
       if (details.attributes() != NONE) return Handle<String>::null();
-      Name name = GetSimpleTransitionKey(target);
-      if (!name.IsString()) return Handle<String>::null();
+      Tagged<Name> name = GetSimpleTransitionKey(target);
+      if (!IsString(name)) return Handle<String>::null();
       return handle(String::cast(name), isolate_);
     }
   }
diff --git a/deps/v8/src/objects/transitions.cc b/deps/v8/src/objects/transitions.cc
index 22a7a741da8efb..a1bfb38c41438d 100644
--- a/deps/v8/src/objects/transitions.cc
+++ b/deps/v8/src/objects/transitions.cc
@@ -13,21 +13,21 @@ namespace v8 {
 namespace internal {
 
 // static
-Map TransitionsAccessor::GetSimpleTransition(Isolate* isolate,
-                                             Handle<Map> map) {
+Tagged<Map> TransitionsAccessor::GetSimpleTransition(Isolate* isolate,
+                                                     Handle<Map> map) {
   MaybeObject raw_transitions = map->raw_transitions(isolate, kAcquireLoad);
   switch (GetEncoding(isolate, raw_transitions)) {
     case kWeakRef:
-      return Map::cast(raw_transitions->GetHeapObjectAssumeWeak());
+      return Map::cast(raw_transitions.GetHeapObjectAssumeWeak());
     default:
-      return Map();
+      return Tagged<Map>();
   }
 }
 
-bool TransitionsAccessor::HasSimpleTransitionTo(Map map) {
+bool TransitionsAccessor::HasSimpleTransitionTo(Tagged<Map> map) {
   switch (encoding()) {
     case kWeakRef:
-      return raw_transitions_->GetHeapObjectAssumeWeak() == map;
+      return raw_transitions_.GetHeapObjectAssumeWeak() == map;
     case kPrototypeInfo:
     case kUninitialized:
     case kMigrationTarget:
@@ -61,15 +61,15 @@ void TransitionsAccessor::Insert(Isolate* isolate, Handle<Map> map,
   }
 
   if (encoding == kWeakRef) {
-    Map simple_transition = GetSimpleTransition(isolate, map);
+    Tagged<Map> simple_transition = GetSimpleTransition(isolate, map);
     DCHECK(!simple_transition.is_null());
 
     if (flag == SIMPLE_PROPERTY_TRANSITION) {
-      Name key = GetSimpleTransitionKey(simple_transition);
+      Tagged<Name> key = GetSimpleTransitionKey(simple_transition);
       PropertyDetails old_details =
-          simple_transition.GetLastDescriptorDetails(isolate);
+          simple_transition->GetLastDescriptorDetails(isolate);
       PropertyDetails new_details = GetTargetDetails(*name, *target);
-      if (key.Equals(*name) && old_details.kind() == new_details.kind() &&
+      if (key->Equals(*name) && old_details.kind() == new_details.kind() &&
           old_details.attributes() == new_details.attributes()) {
         ReplaceTransitions(isolate, map, HeapObjectReference::Weak(*target));
         return;
@@ -140,18 +140,18 @@ void TransitionsAccessor::Insert(Isolate* isolate, Handle<Map> map,
   {
     DisallowGarbageCollection no_gc;
     TransitionArray array = GetTransitionArray(isolate, map);
-    number_of_transitions = array.number_of_transitions();
+    number_of_transitions = array->number_of_transitions();
 
     int index =
         is_special_transition
-            ? array.SearchSpecial(Symbol::cast(*name), false, &insertion_index)
-            : array.Search(details.kind(), *name, details.attributes(),
-                           &insertion_index);
+            ? array->SearchSpecial(Symbol::cast(*name), false, &insertion_index)
+            : array->Search(details.kind(), *name, details.attributes(),
+                            &insertion_index);
     // If an existing entry was found, overwrite it and return.
     if (index != kNotFound) {
       base::SharedMutexGuard<base::kExclusive> shared_mutex_guard(
           isolate->full_transition_array_access());
-      array.SetRawTarget(index, HeapObjectReference::Weak(*target));
+      array->SetRawTarget(index, HeapObjectReference::Weak(*target));
       return;
     }
 
@@ -161,16 +161,16 @@ void TransitionsAccessor::Insert(Isolate* isolate, Handle<Map> map,
     DCHECK_LE(insertion_index, number_of_transitions);
 
     // If there is enough capacity, insert new entry into the existing array.
-    if (new_nof <= array.Capacity()) {
+    if (new_nof <= array->Capacity()) {
       base::SharedMutexGuard<base::kExclusive> shared_mutex_guard(
           isolate->full_transition_array_access());
-      array.SetNumberOfTransitions(new_nof);
+      array->SetNumberOfTransitions(new_nof);
       for (int i = number_of_transitions; i > insertion_index; --i) {
-        array.SetKey(i, array.GetKey(i - 1));
-        array.SetRawTarget(i, array.GetRawTarget(i - 1));
+        array->SetKey(i, array->GetKey(i - 1));
+        array->SetRawTarget(i, array->GetRawTarget(i - 1));
       }
-      array.SetKey(insertion_index, *name);
-      array.SetRawTarget(insertion_index, HeapObjectReference::Weak(*target));
+      array->SetKey(insertion_index, *name);
+      array->SetRawTarget(insertion_index, HeapObjectReference::Weak(*target));
       SLOW_DCHECK(array.IsSortedNoDuplicates());
       return;
     }
@@ -186,75 +186,76 @@ void TransitionsAccessor::Insert(Isolate* isolate, Handle<Map> map,
   // result copy if needed, and recompute variables.
   DisallowGarbageCollection no_gc;
   TransitionArray array = GetTransitionArray(isolate, map);
-  if (array.number_of_transitions() != number_of_transitions) {
-    DCHECK_LT(array.number_of_transitions(), number_of_transitions);
+  if (array->number_of_transitions() != number_of_transitions) {
+    DCHECK_LT(array->number_of_transitions(), number_of_transitions);
 
     int index =
         is_special_transition
-            ? array.SearchSpecial(Symbol::cast(*name), false, &insertion_index)
-            : array.Search(details.kind(), *name, details.attributes(),
-                           &insertion_index);
+            ? array->SearchSpecial(Symbol::cast(*name), false, &insertion_index)
+            : array->Search(details.kind(), *name, details.attributes(),
+                            &insertion_index);
     CHECK_EQ(index, kNotFound);
     USE(index);
     DCHECK_GE(insertion_index, 0);
     DCHECK_LE(insertion_index, number_of_transitions);
 
-    number_of_transitions = array.number_of_transitions();
+    number_of_transitions = array->number_of_transitions();
     new_nof = number_of_transitions + 1;
     result->SetNumberOfTransitions(new_nof);
   }
 
-  if (array.HasPrototypeTransitions()) {
-    result->SetPrototypeTransitions(array.GetPrototypeTransitions());
+  if (array->HasPrototypeTransitions()) {
+    result->SetPrototypeTransitions(array->GetPrototypeTransitions());
   }
 
   DCHECK_NE(kNotFound, insertion_index);
   for (int i = 0; i < insertion_index; ++i) {
-    result->Set(i, array.GetKey(i), array.GetRawTarget(i));
+    result->Set(i, array->GetKey(i), array->GetRawTarget(i));
   }
   result->Set(insertion_index, *name, HeapObjectReference::Weak(*target));
   for (int i = insertion_index; i < number_of_transitions; ++i) {
-    result->Set(i + 1, array.GetKey(i), array.GetRawTarget(i));
+    result->Set(i + 1, array->GetKey(i), array->GetRawTarget(i));
   }
 
   SLOW_DCHECK(result->IsSortedNoDuplicates());
   ReplaceTransitions(isolate, map, result);
 }
 
-Map TransitionsAccessor::SearchTransition(Name name, PropertyKind kind,
-                                          PropertyAttributes attributes) {
-  DCHECK(name.IsUniqueName());
+Tagged<Map> TransitionsAccessor::SearchTransition(
+    Tagged<Name> name, PropertyKind kind, PropertyAttributes attributes) {
+  DCHECK(IsUniqueName(name));
   switch (encoding()) {
     case kPrototypeInfo:
     case kUninitialized:
     case kMigrationTarget:
-      return Map();
+      return Tagged<Map>();
     case kWeakRef: {
-      Map map = Map::cast(raw_transitions_->GetHeapObjectAssumeWeak());
-      if (!IsMatchingMap(map, name, kind, attributes)) return Map();
+      Tagged<Map> map = Map::cast(raw_transitions_.GetHeapObjectAssumeWeak());
+      if (!IsMatchingMap(map, name, kind, attributes)) return Tagged<Map>();
       return map;
     }
     case kFullTransitionArray: {
       base::SharedMutexGuardIf<base::kShared> scope(
           isolate_->full_transition_array_access(), concurrent_access_);
-      return transitions().SearchAndGetTarget(kind, name, attributes);
+      return transitions()->SearchAndGetTarget(kind, name, attributes);
     }
   }
   UNREACHABLE();
 }
 
-Map TransitionsAccessor::SearchSpecial(Symbol name) {
-  if (encoding() != kFullTransitionArray) return Map();
+Tagged<Map> TransitionsAccessor::SearchSpecial(Tagged<Symbol> name) {
+  if (encoding() != kFullTransitionArray) return Tagged<Map>();
   base::SharedMutexGuardIf<base::kShared> scope(
       isolate_->full_transition_array_access(), concurrent_access_);
-  int transition = transitions().SearchSpecial(name, concurrent_access_);
-  if (transition == kNotFound) return Map();
-  return transitions().GetTarget(transition);
+  int transition = transitions()->SearchSpecial(name, concurrent_access_);
+  if (transition == kNotFound) return Tagged<Map>();
+  return transitions()->GetTarget(transition);
 }
 
 // static
-bool TransitionsAccessor::IsSpecialTransition(ReadOnlyRoots roots, Name name) {
-  if (!name.IsSymbol()) return false;
+bool TransitionsAccessor::IsSpecialTransition(ReadOnlyRoots roots,
+                                              Tagged<Name> name) {
+  if (!IsSymbol(name)) return false;
   return name == roots.nonextensible_symbol() ||
          name == roots.sealed_symbol() || name == roots.frozen_symbol() ||
          name == roots.elements_transition_symbol() ||
@@ -263,12 +264,12 @@ bool TransitionsAccessor::IsSpecialTransition(ReadOnlyRoots roots, Name name) {
 
 MaybeHandle<Map> TransitionsAccessor::FindTransitionToDataProperty(
     Handle<Name> name, RequestedLocation requested_location) {
-  DCHECK(name->IsUniqueName());
+  DCHECK(IsUniqueName(*name));
   DisallowGarbageCollection no_gc;
   PropertyAttributes attributes = name->IsPrivate() ? DONT_ENUM : NONE;
-  Map target = SearchTransition(*name, PropertyKind::kData, attributes);
+  Tagged<Map> target = SearchTransition(*name, PropertyKind::kData, attributes);
   if (target.is_null()) return MaybeHandle<Map>();
-  PropertyDetails details = target.GetLastDescriptorDetails(isolate_);
+  PropertyDetails details = target->GetLastDescriptorDetails(isolate_);
   DCHECK_EQ(attributes, details.attributes());
   DCHECK_EQ(PropertyKind::kData, details.kind());
   if (requested_location == kFieldOnly &&
@@ -279,19 +280,20 @@ MaybeHandle<Map> TransitionsAccessor::FindTransitionToDataProperty(
 }
 
 void TransitionsAccessor::ForEachTransitionTo(
-    Name name, const ForEachTransitionCallback& callback,
+    Tagged<Name> name, const ForEachTransitionCallback& callback,
     DisallowGarbageCollection* no_gc) {
-  DCHECK(name.IsUniqueName());
+  DCHECK(IsUniqueName(name));
   switch (encoding()) {
     case kPrototypeInfo:
     case kUninitialized:
     case kMigrationTarget:
       return;
     case kWeakRef: {
-      Map target = Map::cast(raw_transitions_->GetHeapObjectAssumeWeak());
-      InternalIndex descriptor = target.LastAdded();
-      DescriptorArray descriptors = target.instance_descriptors(kRelaxedLoad);
-      Name key = descriptors.GetKey(descriptor);
+      Tagged<Map> target =
+          Map::cast(raw_transitions_.GetHeapObjectAssumeWeak());
+      InternalIndex descriptor = target->LastAdded();
+      DescriptorArray descriptors = target->instance_descriptors(kRelaxedLoad);
+      Tagged<Name> key = descriptors->GetKey(descriptor);
       if (key == name) {
         callback(target);
       }
@@ -300,7 +302,7 @@ void TransitionsAccessor::ForEachTransitionTo(
     case kFullTransitionArray: {
       base::SharedMutexGuardIf<base::kShared> scope(
           isolate_->full_transition_array_access(), concurrent_access_);
-      return transitions().ForEachTransitionTo(name, callback);
+      return transitions()->ForEachTransitionTo(name, callback);
     }
   }
   UNREACHABLE();
@@ -313,26 +315,26 @@ bool TransitionsAccessor::CanHaveMoreTransitions(Isolate* isolate,
   MaybeObject raw_transitions = map->raw_transitions(isolate, kAcquireLoad);
   if (GetEncoding(isolate, raw_transitions) == kFullTransitionArray) {
     return GetTransitionArray(isolate, raw_transitions)
-               .number_of_transitions() < kMaxNumberOfTransitions;
+               ->number_of_transitions() < kMaxNumberOfTransitions;
   }
   return true;
 }
 
 // static
-bool TransitionsAccessor::IsMatchingMap(Map target, Name name,
+bool TransitionsAccessor::IsMatchingMap(Tagged<Map> target, Tagged<Name> name,
                                         PropertyKind kind,
                                         PropertyAttributes attributes) {
-  InternalIndex descriptor = target.LastAdded();
-  DescriptorArray descriptors = target.instance_descriptors(kRelaxedLoad);
-  Name key = descriptors.GetKey(descriptor);
+  InternalIndex descriptor = target->LastAdded();
+  DescriptorArray descriptors = target->instance_descriptors(kRelaxedLoad);
+  Tagged<Name> key = descriptors->GetKey(descriptor);
   if (key != name) return false;
-  return descriptors.GetDetails(descriptor)
+  return descriptors->GetDetails(descriptor)
       .HasKindAndAttributes(kind, attributes);
 }
 
 // static
-bool TransitionArray::CompactPrototypeTransitionArray(Isolate* isolate,
-                                                      WeakFixedArray array) {
+bool TransitionArray::CompactPrototypeTransitionArray(
+    Isolate* isolate, Tagged<WeakFixedArray> array) {
   const int header = kProtoTransitionHeaderSize;
   int number_of_transitions = NumberOfPrototypeTransitions(array);
   if (number_of_transitions == 0) {
@@ -341,12 +343,12 @@ bool TransitionArray::CompactPrototypeTransitionArray(Isolate* isolate,
   }
   int new_number_of_transitions = 0;
   for (int i = 0; i < number_of_transitions; i++) {
-    MaybeObject target = array.Get(header + i);
+    MaybeObject target = array->Get(header + i);
     DCHECK(target->IsCleared() ||
-           (target->IsWeak() && target->GetHeapObject().IsMap()));
+           (target->IsWeak() && IsMap(target.GetHeapObject())));
     if (!target->IsCleared()) {
       if (new_number_of_transitions != i) {
-        array.Set(header + new_number_of_transitions, target);
+        array->Set(header + new_number_of_transitions, target);
       }
       new_number_of_transitions++;
     }
@@ -355,7 +357,7 @@ bool TransitionArray::CompactPrototypeTransitionArray(Isolate* isolate,
   MaybeObject undefined =
       MaybeObject::FromObject(*isolate->factory()->undefined_value());
   for (int i = new_number_of_transitions; i < number_of_transitions; i++) {
-    array.Set(header + i, undefined);
+    array->Set(header + i, undefined);
   }
   if (number_of_transitions != new_number_of_transitions) {
     SetNumberOfPrototypeTransitions(array, new_number_of_transitions);
@@ -386,7 +388,7 @@ void TransitionsAccessor::PutPrototypeTransition(Isolate* isolate,
                                                  Handle<Map> map,
                                                  Handle<Object> prototype,
                                                  Handle<Map> target_map) {
-  DCHECK(HeapObject::cast(*prototype).map().IsMap());
+  DCHECK(IsMap(HeapObject::cast(*prototype)->map()));
   // Don't cache prototype transition if this map is either shared, or a map of
   // a prototype.
   if (map->is_prototype_map()) return;
@@ -441,18 +443,21 @@ void TransitionsAccessor::PutPrototypeTransition(Isolate* isolate,
 
 // static
 Handle<Map> TransitionsAccessor::GetPrototypeTransition(
-    Isolate* isolate, Handle<Map> map, Handle<Object> prototype) {
+    Isolate* isolate, Handle<Map> map, Handle<Object> prototype_handle,
+    bool new_target_is_base) {
   DisallowGarbageCollection no_gc;
-  WeakFixedArray cache = GetPrototypeTransitions(isolate, map);
+  Object prototype = *prototype_handle;
+  Tagged<WeakFixedArray> cache = GetPrototypeTransitions(isolate, map);
   int length = TransitionArray::NumberOfPrototypeTransitions(cache);
   for (int i = 0; i < length; i++) {
     MaybeObject target =
-        cache.Get(TransitionArray::kProtoTransitionHeaderSize + i);
+        cache->Get(TransitionArray::kProtoTransitionHeaderSize + i);
     DCHECK(target->IsWeakOrCleared());
-    HeapObject heap_object;
-    if (target->GetHeapObjectIfWeak(&heap_object)) {
-      Map target_map = Map::cast(heap_object);
-      if (target_map.prototype() == *prototype) {
+    Tagged<HeapObject> heap_object;
+    if (target.GetHeapObjectIfWeak(&heap_object)) {
+      Tagged<Map> target_map = Map::cast(heap_object);
+      if (target_map->prototype() == prototype &&
+          target_map->new_target_is_base() == new_target_is_base) {
         return handle(target_map, isolate);
       }
     }
@@ -461,26 +466,26 @@ Handle<Map> TransitionsAccessor::GetPrototypeTransition(
 }
 
 // static
-WeakFixedArray TransitionsAccessor::GetPrototypeTransitions(Isolate* isolate,
-                                                            Handle<Map> map) {
+Tagged<WeakFixedArray> TransitionsAccessor::GetPrototypeTransitions(
+    Isolate* isolate, Handle<Map> map) {
   MaybeObject raw_transitions = map->raw_transitions(isolate, kAcquireLoad);
   if (GetEncoding(isolate, raw_transitions) != kFullTransitionArray) {
     return ReadOnlyRoots(isolate).empty_weak_fixed_array();
   }
   TransitionArray transition_array =
       GetTransitionArray(isolate, raw_transitions);
-  if (!transition_array.HasPrototypeTransitions()) {
+  if (!transition_array->HasPrototypeTransitions()) {
     return ReadOnlyRoots(isolate).empty_weak_fixed_array();
   }
-  return transition_array.GetPrototypeTransitions();
+  return transition_array->GetPrototypeTransitions();
 }
 
 // static
 void TransitionArray::SetNumberOfPrototypeTransitions(
-    WeakFixedArray proto_transitions, int value) {
-  DCHECK_NE(proto_transitions.length(), 0);
-  proto_transitions.Set(kProtoTransitionNumberOfEntriesOffset,
-                        MaybeObject::FromSmi(Smi::FromInt(value)));
+    Tagged<WeakFixedArray> proto_transitions, int value) {
+  DCHECK_NE(proto_transitions->length(), 0);
+  proto_transitions->Set(kProtoTransitionNumberOfEntriesOffset,
+                         MaybeObject::FromSmi(Smi::FromInt(value)));
 }
 
 int TransitionsAccessor::NumberOfTransitions() {
@@ -492,14 +497,14 @@ int TransitionsAccessor::NumberOfTransitions() {
     case kWeakRef:
       return 1;
     case kFullTransitionArray:
-      return transitions().number_of_transitions();
+      return transitions()->number_of_transitions();
   }
   UNREACHABLE();
 }
 
 // static
 void TransitionsAccessor::SetMigrationTarget(Isolate* isolate, Handle<Map> map,
-                                             Map migration_target) {
+                                             Tagged<Map> migration_target) {
   // We only cache the migration target for maps with empty transitions for GC's
   // sake.
   if (GetEncoding(isolate, map) != kUninitialized) return;
@@ -508,11 +513,11 @@ void TransitionsAccessor::SetMigrationTarget(Isolate* isolate, Handle<Map> map,
                            kReleaseStore);
 }
 
-Map TransitionsAccessor::GetMigrationTarget() {
+Tagged<Map> TransitionsAccessor::GetMigrationTarget() {
   if (encoding() == kMigrationTarget) {
-    return map_.raw_transitions(kAcquireLoad)->cast<Map>();
+    return map_->raw_transitions(kAcquireLoad)->cast<Map>();
   }
-  return Map();
+  return Tagged<Map>();
 }
 
 // static
@@ -521,9 +526,9 @@ void TransitionsAccessor::ReplaceTransitions(Isolate* isolate, Handle<Map> map,
 #if DEBUG
   if (GetEncoding(isolate, map) == kFullTransitionArray) {
     CheckNewTransitionsAreConsistent(
-        isolate, map, new_transitions->GetHeapObjectAssumeStrong());
+        isolate, map, new_transitions.GetHeapObjectAssumeStrong());
     DCHECK_NE(GetTransitionArray(isolate, map),
-              new_transitions->GetHeapObjectAssumeStrong());
+              new_transitions.GetHeapObjectAssumeStrong());
   }
 #endif
   map->set_raw_transitions(new_transitions, kReleaseStore);
@@ -543,7 +548,7 @@ void TransitionsAccessor::SetPrototypeTransitions(
     Handle<WeakFixedArray> proto_transitions) {
   EnsureHasFullTransitionArray(isolate, map);
   GetTransitionArray(isolate, map->raw_transitions(isolate, kAcquireLoad))
-      .SetPrototypeTransitions(*proto_transitions);
+      ->SetPrototypeTransitions(*proto_transitions);
 }
 
 // static
@@ -563,8 +568,8 @@ void TransitionsAccessor::EnsureHasFullTransitionArray(Isolate* isolate,
       result->SetNumberOfTransitions(0);
     } else {
       // Otherwise populate the new array.
-      Map target = GetSimpleTransition(isolate, map);
-      Name key = GetSimpleTransitionKey(target);
+      Tagged<Map> target = GetSimpleTransition(isolate, map);
+      Tagged<Name> key = GetSimpleTransitionKey(target);
       result->Set(0, key, HeapObjectReference::Weak(target));
     }
   }
@@ -581,13 +586,13 @@ void TransitionsAccessor::TraverseTransitionTreeInternal(
 
   // Pre-order iterative depth-first-search.
   while (!stack.empty()) {
-    Map current_map = stack.back();
+    Tagged<Map> current_map = stack.back();
     stack.pop_back();
 
     callback(current_map);
 
     MaybeObject raw_transitions =
-        current_map.raw_transitions(isolate_, kAcquireLoad);
+        current_map->raw_transitions(isolate_, kAcquireLoad);
     Encoding encoding = GetEncoding(isolate_, raw_transitions);
 
     switch (encoding) {
@@ -597,29 +602,30 @@ void TransitionsAccessor::TraverseTransitionTreeInternal(
         break;
       case kWeakRef: {
         stack.emplace_back(
-            Map::cast(raw_transitions->GetHeapObjectAssumeWeak()));
+            Map::cast(raw_transitions.GetHeapObjectAssumeWeak()));
         break;
       }
       case kFullTransitionArray: {
         TransitionArray transitions =
-            TransitionArray::cast(raw_transitions->GetHeapObjectAssumeStrong());
-        if (transitions.HasPrototypeTransitions()) {
-          WeakFixedArray proto_trans = transitions.GetPrototypeTransitions();
+            TransitionArray::cast(raw_transitions.GetHeapObjectAssumeStrong());
+        if (transitions->HasPrototypeTransitions()) {
+          Tagged<WeakFixedArray> proto_trans =
+              transitions->GetPrototypeTransitions();
           int length =
               TransitionArray::NumberOfPrototypeTransitions(proto_trans);
           for (int i = 0; i < length; ++i) {
             int index = TransitionArray::kProtoTransitionHeaderSize + i;
-            MaybeObject target = proto_trans.Get(index);
-            HeapObject heap_object;
-            if (target->GetHeapObjectIfWeak(&heap_object)) {
+            MaybeObject target = proto_trans->Get(index);
+            Tagged<HeapObject> heap_object;
+            if (target.GetHeapObjectIfWeak(&heap_object)) {
               stack.emplace_back(Map::cast(heap_object));
             } else {
               DCHECK(target->IsCleared());
             }
           }
         }
-        for (int i = 0; i < transitions.number_of_transitions(); ++i) {
-          stack.emplace_back(transitions.GetTarget(i));
+        for (int i = 0; i < transitions->number_of_transitions(); ++i) {
+          stack.emplace_back(transitions->GetTarget(i));
         }
         break;
       }
@@ -629,28 +635,27 @@ void TransitionsAccessor::TraverseTransitionTreeInternal(
 
 #ifdef DEBUG
 // static
-void TransitionsAccessor::CheckNewTransitionsAreConsistent(Isolate* isolate,
-                                                           Handle<Map> map,
-                                                           Object transitions) {
+void TransitionsAccessor::CheckNewTransitionsAreConsistent(
+    Isolate* isolate, Handle<Map> map, Tagged<Object> transitions) {
   // This function only handles full transition arrays.
   TransitionArray old_transitions = GetTransitionArray(isolate, map);
   DCHECK_EQ(kFullTransitionArray, GetEncoding(isolate, old_transitions));
   TransitionArray new_transitions = TransitionArray::cast(transitions);
-  for (int i = 0; i < old_transitions.number_of_transitions(); i++) {
-    Map target = old_transitions.GetTarget(i);
-    if (target.instance_descriptors(isolate) ==
+  for (int i = 0; i < old_transitions->number_of_transitions(); i++) {
+    Tagged<Map> target = old_transitions->GetTarget(i);
+    if (target->instance_descriptors(isolate) ==
         map->instance_descriptors(isolate)) {
-      Name key = old_transitions.GetKey(i);
+      Tagged<Name> key = old_transitions->GetKey(i);
       int new_target_index;
       if (IsSpecialTransition(ReadOnlyRoots(isolate), key)) {
-        new_target_index = new_transitions.SearchSpecial(Symbol::cast(key));
+        new_target_index = new_transitions->SearchSpecial(Symbol::cast(key));
       } else {
         PropertyDetails details = GetTargetDetails(key, target);
         new_target_index =
-            new_transitions.Search(details.kind(), key, details.attributes());
+            new_transitions->Search(details.kind(), key, details.attributes());
       }
       DCHECK_NE(TransitionArray::kNotFound, new_target_index);
-      DCHECK_EQ(target, new_transitions.GetTarget(new_target_index));
+      DCHECK_EQ(target, new_transitions->GetTarget(new_target_index));
     }
   }
 }
@@ -663,10 +668,10 @@ int TransitionArray::SearchDetails(int transition, PropertyKind kind,
                                    int* out_insertion_index) {
   int nof_transitions = number_of_transitions();
   DCHECK(transition < nof_transitions);
-  Name key = GetKey(transition);
+  Tagged<Name> key = GetKey(transition);
   for (; transition < nof_transitions && GetKey(transition) == key;
        transition++) {
-    Map target = GetTarget(transition);
+    Tagged<Map> target = GetTarget(transition);
     PropertyDetails target_details =
         TransitionsAccessor::GetTargetDetails(key, target);
 
@@ -682,15 +687,14 @@ int TransitionArray::SearchDetails(int transition, PropertyKind kind,
   return kNotFound;
 }
 
-Map TransitionArray::SearchDetailsAndGetTarget(int transition,
-                                               PropertyKind kind,
-                                               PropertyAttributes attributes) {
+Tagged<Map> TransitionArray::SearchDetailsAndGetTarget(
+    int transition, PropertyKind kind, PropertyAttributes attributes) {
   int nof_transitions = number_of_transitions();
   DCHECK(transition < nof_transitions);
-  Name key = GetKey(transition);
+  Tagged<Name> key = GetKey(transition);
   for (; transition < nof_transitions && GetKey(transition) == key;
        transition++) {
-    Map target = GetTarget(transition);
+    Tagged<Map> target = GetTarget(transition);
     PropertyDetails target_details =
         TransitionsAccessor::GetTargetDetails(key, target);
 
@@ -702,10 +706,10 @@ Map TransitionArray::SearchDetailsAndGetTarget(int transition,
       break;
     }
   }
-  return Map();
+  return Tagged<Map>();
 }
 
-int TransitionArray::Search(PropertyKind kind, Name name,
+int TransitionArray::Search(PropertyKind kind, Tagged<Name> name,
                             PropertyAttributes attributes,
                             int* out_insertion_index) {
   int transition = SearchName(name, false, out_insertion_index);
@@ -713,26 +717,27 @@ int TransitionArray::Search(PropertyKind kind, Name name,
   return SearchDetails(transition, kind, attributes, out_insertion_index);
 }
 
-Map TransitionArray::SearchAndGetTarget(PropertyKind kind, Name name,
-                                        PropertyAttributes attributes) {
+Tagged<Map> TransitionArray::SearchAndGetTarget(PropertyKind kind,
+                                                Tagged<Name> name,
+                                                PropertyAttributes attributes) {
   int transition = SearchName(name);
   if (transition == kNotFound) {
-    return Map();
+    return Tagged<Map>();
   }
   return SearchDetailsAndGetTarget(transition, kind, attributes);
 }
 
 void TransitionArray::ForEachTransitionTo(
-    Name name, const ForEachTransitionCallback& callback) {
+    Tagged<Name> name, const ForEachTransitionCallback& callback) {
   int transition = SearchName(name);
   if (transition == kNotFound) return;
 
   int nof_transitions = number_of_transitions();
   DCHECK(transition < nof_transitions);
-  Name key = GetKey(transition);
+  Tagged<Name> key = GetKey(transition);
   for (; transition < nof_transitions && GetKey(transition) == key;
        transition++) {
-    Map target = GetTarget(transition);
+    Tagged<Map> target = GetTarget(transition);
     callback(target);
   }
 }
@@ -743,12 +748,12 @@ void TransitionArray::Sort() {
   int length = number_of_transitions();
   ReadOnlyRoots roots = GetReadOnlyRoots();
   for (int i = 1; i < length; i++) {
-    Name key = GetKey(i);
+    Tagged<Name> key = GetKey(i);
     MaybeObject target = GetRawTarget(i);
     PropertyKind kind = PropertyKind::kData;
     PropertyAttributes attributes = NONE;
     if (!TransitionsAccessor::IsSpecialTransition(roots, key)) {
-      Map target_map = TransitionsAccessor::GetTargetFromRaw(target);
+      Tagged<Map> target_map = TransitionsAccessor::GetTargetFromRaw(target);
       PropertyDetails details =
           TransitionsAccessor::GetTargetDetails(key, target_map);
       kind = details.kind();
@@ -756,20 +761,21 @@ void TransitionArray::Sort() {
     }
     int j;
     for (j = i - 1; j >= 0; j--) {
-      Name temp_key = GetKey(j);
+      Tagged<Name> temp_key = GetKey(j);
       MaybeObject temp_target = GetRawTarget(j);
       PropertyKind temp_kind = PropertyKind::kData;
       PropertyAttributes temp_attributes = NONE;
       if (!TransitionsAccessor::IsSpecialTransition(roots, temp_key)) {
-        Map temp_target_map =
+        Tagged<Map> temp_target_map =
             TransitionsAccessor::GetTargetFromRaw(temp_target);
         PropertyDetails details =
             TransitionsAccessor::GetTargetDetails(temp_key, temp_target_map);
         temp_kind = details.kind();
         temp_attributes = details.attributes();
       }
-      int cmp = CompareKeys(temp_key, temp_key.hash(), temp_kind,
-                            temp_attributes, key, key.hash(), kind, attributes);
+      int cmp =
+          CompareKeys(temp_key, temp_key->hash(), temp_kind, temp_attributes,
+                      key, key->hash(), kind, attributes);
       if (cmp > 0) {
         SetKey(j + 1, temp_key);
         SetRawTarget(j + 1, temp_target);
@@ -784,7 +790,8 @@ void TransitionArray::Sort() {
 }
 
 bool TransitionsAccessor::HasIntegrityLevelTransitionTo(
-    Map to, Symbol* out_symbol, PropertyAttributes* out_integrity_level) {
+    Tagged<Map> to, Tagged<Symbol>* out_symbol,
+    PropertyAttributes* out_integrity_level) {
   ReadOnlyRoots roots(isolate_);
   if (SearchSpecial(roots.frozen_symbol()) == to) {
     if (out_integrity_level) *out_integrity_level = FROZEN;
diff --git a/deps/v8/src/objects/transitions.h b/deps/v8/src/objects/transitions.h
index 8ff3cfddc75191..66e80f1704bccb 100644
--- a/deps/v8/src/objects/transitions.h
+++ b/deps/v8/src/objects/transitions.h
@@ -25,7 +25,7 @@ class Impl;
 }
 
 // Find all transitions with given name and calls the callback.
-using ForEachTransitionCallback = std::function<void(Map)>;
+using ForEachTransitionCallback = std::function<void(Tagged<Map>)>;
 
 // TransitionsAccessor is a helper class to encapsulate access to the various
 // ways a Map can store transitions to other maps in its respective field at
@@ -49,7 +49,7 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
   // {concurrent_access} signals that the TransitionsAccessor will only be used
   // in background threads. It acquires a reader lock for critical paths, as
   // well as blocking the accessor from modifying the TransitionsArray.
-  inline TransitionsAccessor(Isolate* isolate, Map map,
+  inline TransitionsAccessor(Isolate* isolate, Tagged<Map> map,
                              bool concurrent_access = false);
 
   // Insert a new transition into |map|'s transition array, extending it
@@ -57,19 +57,20 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
   static void Insert(Isolate* isolate, Handle<Map> map, Handle<Name> name,
                      Handle<Map> target, SimpleTransitionFlag flag);
 
-  Map SearchTransition(Name name, PropertyKind kind,
-                       PropertyAttributes attributes);
+  Tagged<Map> SearchTransition(Tagged<Name> name, PropertyKind kind,
+                               PropertyAttributes attributes);
   static inline MaybeHandle<Map> SearchTransition(
-      Isolate* isolate, Handle<Map> map, Name name, PropertyKind kind,
+      Isolate* isolate, Handle<Map> map, Tagged<Name> name, PropertyKind kind,
       PropertyAttributes attributes);
 
-  Map SearchSpecial(Symbol name);
+  Tagged<Map> SearchSpecial(Tagged<Symbol> name);
   static inline MaybeHandle<Map> SearchSpecial(Isolate* isolate,
-                                               Handle<Map> map, Symbol name);
+                                               Handle<Map> map,
+                                               Tagged<Symbol> name);
 
   // Returns true for non-property transitions like elements kind, or
   // or frozen/sealed transitions.
-  static bool IsSpecialTransition(ReadOnlyRoots roots, Name name);
+  static bool IsSpecialTransition(ReadOnlyRoots roots, Tagged<Name> name);
 
   enum RequestedLocation { kAnyLocation, kFieldOnly };
   MaybeHandle<Map> FindTransitionToDataProperty(
@@ -84,7 +85,8 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
   // lock are allowed inside the callback.
   // If any of the GC- or lock-requiring processing is necessary, it has to be
   // done outside of the callback.
-  void ForEachTransitionTo(Name name, const ForEachTransitionCallback& callback,
+  void ForEachTransitionTo(Tagged<Name> name,
+                           const ForEachTransitionCallback& callback,
                            DisallowGarbageCollection* no_gc);
 
   inline Handle<String> ExpectedTransitionKey();
@@ -95,21 +97,22 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
   // object space. Otherwise ClearNonLiveReferences would leak memory while
   // applying in-place right trimming.
   static const int kMaxNumberOfTransitions = 1024 + 512;
-  inline Name GetKey(int transition_number);
-  inline Map GetTarget(int transition_number);
-  static inline PropertyDetails GetTargetDetails(Name name, Map target);
+  inline Tagged<Name> GetKey(int transition_number);
+  inline Tagged<Map> GetTarget(int transition_number);
+  static inline PropertyDetails GetTargetDetails(Tagged<Name> name,
+                                                 Tagged<Map> target);
 
   static bool CanHaveMoreTransitions(Isolate* isolate, Handle<Map> map);
 
-  static bool IsMatchingMap(Map target, Name name, PropertyKind kind,
-                            PropertyAttributes attributes);
+  static bool IsMatchingMap(Tagged<Map> target, Tagged<Name> name,
+                            PropertyKind kind, PropertyAttributes attributes);
 
   bool HasIntegrityLevelTransitionTo(
-      Map to, Symbol* out_symbol = nullptr,
+      Tagged<Map> to, Tagged<Symbol>* out_symbol = nullptr,
       PropertyAttributes* out_integrity_level = nullptr);
 
   // ===== ITERATION =====
-  using TraverseCallback = std::function<void(Map)>;
+  using TraverseCallback = std::function<void(Tagged<Map>)>;
 
   // Traverse the transition tree in preorder.
   void TraverseTransitionTree(const TraverseCallback& callback) {
@@ -121,19 +124,20 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
   }
 
   // ===== PROTOTYPE TRANSITIONS =====
-  // When you set the prototype of an object using the __proto__ accessor you
-  // need a new map for the object (the prototype is stored in the map).  In
-  // order not to multiply maps unnecessarily we store these as transitions in
-  // the original map.  That way we can transition to the same map if the same
-  // prototype is set, rather than creating a new map every time.  The
-  // transitions are in the form of a map where the keys are prototype objects
-  // and the values are the maps they transition to.
-  // PutPrototypeTransition can trigger GC.
+  // When you set the prototype of an object using the __proto__ accessor, or if
+  // an unrelated new.target is passed to a constructor you need a new map for
+  // the object (the prototype is stored in the map).  In order not to multiply
+  // maps unnecessarily we store these as transitions in the original map.  That
+  // way we can transition to the same map if the same prototype is set, rather
+  // than creating a new map every time.  The transitions are in the form of a
+  // map where the keys are prototype objects and the values are the maps they
+  // transition to. PutPrototypeTransition can trigger GC.
   static void PutPrototypeTransition(Isolate* isolate, Handle<Map>,
                                      Handle<Object> prototype,
                                      Handle<Map> target_map);
   static Handle<Map> GetPrototypeTransition(Isolate* isolate, Handle<Map> map,
-                                            Handle<Object> prototype);
+                                            Handle<Object> prototype,
+                                            bool new_target_is_base);
 
   // During the first-time Map::Update and Map::TryUpdate, the migration target
   // map could be cached in the raw_transitions slot of the old map that is
@@ -141,12 +145,13 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
   // we will check this cache slot as a shortcut to get the migration target
   // map.
   static void SetMigrationTarget(Isolate* isolate, Handle<Map> map,
-                                 Map migration_target);
-  Map GetMigrationTarget();
+                                 Tagged<Map> migration_target);
+  Tagged<Map> GetMigrationTarget();
 
 #if DEBUG || OBJECT_PRINT
   void PrintTransitions(std::ostream& os);
-  static void PrintOneTransition(std::ostream& os, Name key, Map target);
+  static void PrintOneTransition(std::ostream& os, Tagged<Name> key,
+                                 Tagged<Map> target);
   void PrintTransitionTree();
   void PrintTransitionTree(std::ostream& os, int level,
                            DisallowGarbageCollection* no_gc);
@@ -154,7 +159,7 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
 #if DEBUG
   static void CheckNewTransitionsAreConsistent(Isolate* isolate,
                                                Handle<Map> map,
-                                               Object transitions);
+                                               Tagged<Object> transitions);
   bool IsConsistentWithBackPointers();
   bool IsSortedNoDuplicates();
 #endif
@@ -173,7 +178,7 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
 
   inline int Capacity();
 
-  inline TransitionArray transitions();
+  inline Tagged<TransitionArray> transitions();
 
   DISALLOW_GARBAGE_COLLECTION(no_gc_)
 
@@ -184,25 +189,27 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
 
   static inline Encoding GetEncoding(Isolate* isolate,
                                      MaybeObject raw_transitions);
-  static inline Encoding GetEncoding(Isolate* isolate, TransitionArray array);
+  static inline Encoding GetEncoding(Isolate* isolate,
+                                     Tagged<TransitionArray> array);
   static inline Encoding GetEncoding(Isolate* isolate, Handle<Map> map);
 
-  static inline TransitionArray GetTransitionArray(Isolate* isolate,
-                                                   MaybeObject raw_transitions);
-  static inline TransitionArray GetTransitionArray(Isolate* isolate,
-                                                   Handle<Map> map);
+  static inline Tagged<TransitionArray> GetTransitionArray(
+      Isolate* isolate, MaybeObject raw_transitions);
+  static inline Tagged<TransitionArray> GetTransitionArray(Isolate* isolate,
+                                                           Handle<Map> map);
 
-  static inline Map GetSimpleTransition(Isolate* isolate, Handle<Map> map);
-  static inline Name GetSimpleTransitionKey(Map transition);
-  inline PropertyDetails GetSimpleTargetDetails(Map transition);
+  static inline Tagged<Map> GetSimpleTransition(Isolate* isolate,
+                                                Handle<Map> map);
+  static inline Tagged<Name> GetSimpleTransitionKey(Tagged<Map> transition);
+  inline PropertyDetails GetSimpleTargetDetails(Tagged<Map> transition);
 
-  static inline Map GetTargetFromRaw(MaybeObject raw);
+  static inline Tagged<Map> GetTargetFromRaw(MaybeObject raw);
 
   static void EnsureHasFullTransitionArray(Isolate* isolate, Handle<Map> map);
   static void SetPrototypeTransitions(Isolate* isolate, Handle<Map> map,
                                       Handle<WeakFixedArray> proto_transitions);
-  static WeakFixedArray GetPrototypeTransitions(Isolate* isolate,
-                                                Handle<Map> map);
+  static Tagged<WeakFixedArray> GetPrototypeTransitions(Isolate* isolate,
+                                                        Handle<Map> map);
 
   static inline void ReplaceTransitions(Isolate* isolate, Handle<Map> map,
                                         MaybeObject new_transitions);
@@ -210,9 +217,9 @@ class V8_EXPORT_PRIVATE TransitionsAccessor {
       Isolate* isolate, Handle<Map> map,
       Handle<TransitionArray> new_transitions);
 
-  bool HasSimpleTransitionTo(Map map);
+  bool HasSimpleTransitionTo(Tagged<Map> map);
 
-  inline Map GetTargetMapFromWeakRef();
+  inline Tagged<Map> GetTargetMapFromWeakRef();
 
   void TraverseTransitionTreeInternal(const TraverseCallback& callback,
                                       DisallowGarbageCollection* no_gc);
@@ -242,26 +249,26 @@ class TransitionArray : public WeakFixedArray {
  public:
   DECL_CAST(TransitionArray)
 
-  inline WeakFixedArray GetPrototypeTransitions();
+  inline Tagged<WeakFixedArray> GetPrototypeTransitions();
   inline bool HasPrototypeTransitions();
 
   // Accessors for fetching instance transition at transition number.
-  inline void SetKey(int transition_number, Name value);
-  inline Name GetKey(int transition_number);
+  inline void SetKey(int transition_number, Tagged<Name> value);
+  inline Tagged<Name> GetKey(int transition_number);
   inline HeapObjectSlot GetKeySlot(int transition_number);
 
-  inline Map GetTarget(int transition_number);
+  inline Tagged<Map> GetTarget(int transition_number);
   inline void SetRawTarget(int transition_number, MaybeObject target);
   inline MaybeObject GetRawTarget(int transition_number);
   inline HeapObjectSlot GetTargetSlot(int transition_number);
   inline bool GetTargetIfExists(int transition_number, Isolate* isolate,
-                                Map* target);
+                                Tagged<Map>* target);
 
   // Required for templatized Search interface.
-  inline Name GetKey(InternalIndex index);
+  inline Tagged<Name> GetKey(InternalIndex index);
   static constexpr int kNotFound = -1;
 
-  inline Name GetSortedKey(int transition_number);
+  inline Tagged<Name> GetSortedKey(int transition_number);
   int GetSortedKeyIndex(int transition_number) { return transition_number; }
   inline int number_of_entries() const;
 #ifdef DEBUG
@@ -294,11 +301,11 @@ class TransitionArray : public WeakFixedArray {
     return kFirstIndex + (transition_number * kEntrySize) + kEntryTargetIndex;
   }
 
-  inline int SearchNameForTesting(Name name,
+  inline int SearchNameForTesting(Tagged<Name> name,
                                   int* out_insertion_index = nullptr);
 
-  inline Map SearchAndGetTargetForTesting(PropertyKind kind, Name name,
-                                          PropertyAttributes attributes);
+  inline Tagged<Map> SearchAndGetTargetForTesting(
+      PropertyKind kind, Tagged<Name> name, PropertyAttributes attributes);
 
  private:
   friend class Factory;
@@ -317,12 +324,13 @@ class TransitionArray : public WeakFixedArray {
   static const int kProtoTransitionHeaderSize = 1;
   static const int kMaxCachedPrototypeTransitions = 256;
 
-  inline void SetPrototypeTransitions(WeakFixedArray prototype_transitions);
+  inline void SetPrototypeTransitions(
+      Tagged<WeakFixedArray> prototype_transitions);
 
   static inline int NumberOfPrototypeTransitions(
-      WeakFixedArray proto_transitions);
-  static void SetNumberOfPrototypeTransitions(WeakFixedArray proto_transitions,
-                                              int value);
+      Tagged<WeakFixedArray> proto_transitions);
+  static void SetNumberOfPrototypeTransitions(
+      Tagged<WeakFixedArray> proto_transitions, int value);
 
   static const int kProtoTransitionNumberOfEntriesOffset = 0;
   static_assert(kProtoTransitionHeaderSize == 1);
@@ -334,47 +342,50 @@ class TransitionArray : public WeakFixedArray {
   }
 
   // Search a  transition for a given kind, property name and attributes.
-  int Search(PropertyKind kind, Name name, PropertyAttributes attributes,
-             int* out_insertion_index = nullptr);
+  int Search(PropertyKind kind, Tagged<Name> name,
+             PropertyAttributes attributes, int* out_insertion_index = nullptr);
 
-  V8_EXPORT_PRIVATE Map SearchAndGetTarget(PropertyKind kind, Name name,
-                                           PropertyAttributes attributes);
+  V8_EXPORT_PRIVATE Tagged<Map> SearchAndGetTarget(
+      PropertyKind kind, Tagged<Name> name, PropertyAttributes attributes);
 
   // Search a non-property transition (like elements kind, observe or frozen
   // transitions).
-  inline int SearchSpecial(Symbol symbol, bool concurrent_search = false,
+  inline int SearchSpecial(Tagged<Symbol> symbol,
+                           bool concurrent_search = false,
                            int* out_insertion_index = nullptr);
   // Search a first transition for a given property name.
-  inline int SearchName(Name name, bool concurrent_search = false,
+  inline int SearchName(Tagged<Name> name, bool concurrent_search = false,
                         int* out_insertion_index = nullptr);
   int SearchDetails(int transition, PropertyKind kind,
                     PropertyAttributes attributes, int* out_insertion_index);
-  Map SearchDetailsAndGetTarget(int transition, PropertyKind kind,
-                                PropertyAttributes attributes);
+  Tagged<Map> SearchDetailsAndGetTarget(int transition, PropertyKind kind,
+                                        PropertyAttributes attributes);
 
   // Find all transitions with given name and calls the callback.
-  void ForEachTransitionTo(Name name,
+  void ForEachTransitionTo(Tagged<Name> name,
                            const ForEachTransitionCallback& callback);
 
   inline int number_of_transitions() const;
 
   static bool CompactPrototypeTransitionArray(Isolate* isolate,
-                                              WeakFixedArray array);
+                                              Tagged<WeakFixedArray> array);
 
   static Handle<WeakFixedArray> GrowPrototypeTransitionArray(
       Handle<WeakFixedArray> array, int new_capacity, Isolate* isolate);
 
   // Compares two tuples <key, kind, attributes>, returns -1 if
   // tuple1 is "less" than tuple2, 0 if tuple1 equal to tuple2 and 1 otherwise.
-  static inline int CompareKeys(Name key1, uint32_t hash1, PropertyKind kind1,
-                                PropertyAttributes attributes1, Name key2,
-                                uint32_t hash2, PropertyKind kind2,
+  static inline int CompareKeys(Tagged<Name> key1, uint32_t hash1,
+                                PropertyKind kind1,
+                                PropertyAttributes attributes1,
+                                Tagged<Name> key2, uint32_t hash2,
+                                PropertyKind kind2,
                                 PropertyAttributes attributes2);
 
   // Compares keys, returns -1 if key1 is "less" than key2,
   // 0 if key1 equal to key2 and 1 otherwise.
-  static inline int CompareNames(Name key1, uint32_t hash1, Name key2,
-                                 uint32_t hash2);
+  static inline int CompareNames(Tagged<Name> key1, uint32_t hash1,
+                                 Tagged<Name> key2, uint32_t hash2);
 
   // Compares two details, returns -1 if details1 is "less" than details2,
   // 0 if details1 equal to details2 and 1 otherwise.
@@ -383,7 +394,7 @@ class TransitionArray : public WeakFixedArray {
                                    PropertyKind kind2,
                                    PropertyAttributes attributes2);
 
-  inline void Set(int transition_number, Name key, MaybeObject target);
+  inline void Set(int transition_number, Tagged<Name> key, MaybeObject target);
 
   OBJECT_CONSTRUCTORS(TransitionArray, WeakFixedArray);
 };
diff --git a/deps/v8/src/objects/turbofan-types.h b/deps/v8/src/objects/turbofan-types.h
index 409645a2d2a170..7aad37bc5fa636 100644
--- a/deps/v8/src/objects/turbofan-types.h
+++ b/deps/v8/src/objects/turbofan-types.h
@@ -7,6 +7,8 @@
 
 #include "src/common/globals.h"
 #include "src/objects/heap-object.h"
+#include "src/objects/objects.h"
+#include "src/objects/tagged.h"
 #include "torque-generated/bit-fields.h"
 
 // Has to be the last include (doesn't have include guards):
diff --git a/deps/v8/src/objects/turbofan-types.tq b/deps/v8/src/objects/turbofan-types.tq
index 46041c4b0a184a..d7f36dfbec559a 100644
--- a/deps/v8/src/objects/turbofan-types.tq
+++ b/deps/v8/src/objects/turbofan-types.tq
@@ -11,8 +11,7 @@ const kMinIntPtr: constexpr IntegerLiteral
 
 @export
 @abstract
-class TurbofanType extends HeapObject {
-}
+class TurbofanType extends HeapObject {}
 
 // TurbofanBitsetType is 64 bit.
 // We use two separate 32 bit bitsets in Torque, due to limitted support
@@ -41,7 +40,6 @@ bitfield struct TurbofanTypeLowBits extends uint32 {
   callable_function: bool: 1 bit;
   class_constructor: bool: 1 bit;
   bound_function: bool: 1 bit;
-  hole: bool: 1 bit;
   other_internal: bool: 1 bit;
   external_pointer: bool: 1 bit;
   array: bool: 1 bit;
@@ -50,11 +48,13 @@ bitfield struct TurbofanTypeLowBits extends uint32 {
   negative_big_int_63: bool: 1 bit;
   other_big_int: bool: 1 bit;
   wasm_object: bool: 1 bit;
+  sandboxed_pointer: bool: 1 bit;
 }
 
 bitfield struct TurbofanTypeHighBits extends uint32 {
-  sandboxed_pointer: bool: 1 bit;
   machine: bool: 1 bit;
+  the_hole: bool: 1 bit;
+  property_cell_hole: bool: 1 bit;
 }
 
 @export
@@ -155,7 +155,7 @@ macro TestTurbofanBitsetType(
       return bitsetLow.bound_function;
     }
     case (TheHole): {
-      return bitsetLow.hole;
+      return bitsetHigh.the_hole;
     }
     case (JSArray): {
       return bitsetLow.array;
@@ -202,17 +202,18 @@ macro TestTurbofanBitsetType(
       }
     }
     @if(V8_ENABLE_WEBASSEMBLY)
-    case (WasmObject): {
-      return bitsetLow.wasm_object;
-    }
+      case (WasmObject): {
+        return bitsetLow.wasm_object;
+      }
     case (Object): {
       return false;
     }
   }
 }
 
-builtin TestTurbofanType(implicit context: Context)(
-    value: Object, expectedType: TurbofanType): Boolean {
+builtin TestTurbofanType(
+    implicit context: Context)(value: Object,
+    expectedType: TurbofanType): Boolean {
   typeswitch (expectedType) {
     case (t: TurbofanBitsetType): {
       return Convert<Boolean>(
@@ -244,8 +245,9 @@ builtin TestTurbofanType(implicit context: Context)(
   }
 }
 
-builtin CheckTurbofanType(implicit context: Context)(
-    value: Object, expectedType: TurbofanType, nodeId: Smi): Undefined {
+builtin CheckTurbofanType(
+    implicit context: Context)(value: Object, expectedType: TurbofanType,
+    nodeId: Smi): Undefined {
   if (TestTurbofanType(value, expectedType) == True) {
     return Undefined;
   }
diff --git a/deps/v8/src/objects/turboshaft-types-inl.h b/deps/v8/src/objects/turboshaft-types-inl.h
index 3dc379a2e6a6d1..b7178f11979c5d 100644
--- a/deps/v8/src/objects/turboshaft-types-inl.h
+++ b/deps/v8/src/objects/turboshaft-types-inl.h
@@ -7,6 +7,8 @@
 
 #include "src/heap/heap-write-barrier.h"
 #include "src/objects/turboshaft-types.h"
+#include "src/torque/runtime-macro-shims.h"
+#include "src/torque/runtime-support.h"
 
 // Has to be the last include (doesn't have include guards):
 #include "src/objects/object-macros.h"
diff --git a/deps/v8/src/objects/turboshaft-types.tq b/deps/v8/src/objects/turboshaft-types.tq
index f860cc4dda2fc4..a6b182fe1ca9bf 100644
--- a/deps/v8/src/objects/turboshaft-types.tq
+++ b/deps/v8/src/objects/turboshaft-types.tq
@@ -11,14 +11,12 @@ bitfield struct TurboshaftFloatSpecialValues extends uint32 {
 }
 
 @abstract
-extern class TurboshaftType extends HeapObject {
-}
+extern class TurboshaftType extends HeapObject {}
 
 @generateBodyDescriptor
 @generateUniqueMap
 @generateFactoryFunction
-extern class TurboshaftWord32Type extends TurboshaftType {
-}
+extern class TurboshaftWord32Type extends TurboshaftType {}
 
 @generateBodyDescriptor
 @generateUniqueMap
@@ -39,8 +37,7 @@ extern class TurboshaftWord32SetType extends TurboshaftWord32Type {
 @generateBodyDescriptor
 @generateUniqueMap
 @generateFactoryFunction
-extern class TurboshaftWord64Type extends TurboshaftType {
-}
+extern class TurboshaftWord64Type extends TurboshaftType {}
 
 @generateBodyDescriptor
 @generateUniqueMap
@@ -153,16 +150,19 @@ macro TestTurboshaftFloat64Type(
     value: float64, expected: TurboshaftFloat64Type): bool {
   if (Float64IsNaN(value)) return expected.special_values.nan;
   if (IsMinusZero(value)) return expected.special_values.minus_zero;
+  const kMaxRelativeError = 0.0000001;
   typeswitch (expected) {
     case (range: TurboshaftFloat64RangeType): {
-      return range.min <= value && value <= range.max;
+      return (range.min < value ||
+              Float64AlmostEqual(range.min, value, kMaxRelativeError)) &&
+          (value < range.max ||
+           Float64AlmostEqual(value, range.max, kMaxRelativeError));
     }
     case (set: TurboshaftFloat64SetType): {
-      const delta = 0.000001;
       for (let i: uint32 = 0; i < set.set_size; ++i) {
-        if (set.elements[i] - delta <= value &&
-            value <= set.elements[i] + delta)
+        if (Float64AlmostEqual(set.elements[i], value, kMaxRelativeError)) {
           return true;
+        }
       }
       return false;
     }
@@ -172,8 +172,9 @@ macro TestTurboshaftFloat64Type(
   }
 }
 
-builtin CheckTurboshaftWord32Type(implicit context: Context)(
-    value: uint32, expectedType: TurboshaftWord32Type, nodeId: Smi): Undefined {
+builtin CheckTurboshaftWord32Type(
+    implicit context: Context)(value: uint32,
+    expectedType: TurboshaftWord32Type, nodeId: Smi): Undefined {
   if (TestTurboshaftWord32Type(value, expectedType)) {
     return Undefined;
   }
@@ -185,9 +186,9 @@ builtin CheckTurboshaftWord32Type(implicit context: Context)(
   unreachable;
 }
 
-builtin CheckTurboshaftWord64Type(implicit context: Context)(
-    valueHigh: uint32, valueLow: uint32, expectedType: TurboshaftWord64Type,
-    nodeId: Smi): Undefined {
+builtin CheckTurboshaftWord64Type(
+    implicit context: Context)(valueHigh: uint32, valueLow: uint32,
+    expectedType: TurboshaftWord64Type, nodeId: Smi): Undefined {
   if (TestTurboshaftWord64Type(valueHigh, valueLow, expectedType)) {
     return Undefined;
   }
@@ -202,9 +203,9 @@ builtin CheckTurboshaftWord64Type(implicit context: Context)(
 
 // Builtin needs custom interface descriptor to allow float32 argument type.
 @customInterfaceDescriptor
-builtin CheckTurboshaftFloat32Type(implicit context: Context)(
-    value: float32, expectedType: TurboshaftFloat64Type, nodeId: Smi):
-    Undefined {
+builtin CheckTurboshaftFloat32Type(
+    implicit context: Context)(value: float32,
+    expectedType: TurboshaftFloat64Type, nodeId: Smi): Undefined {
   const v = Convert<float64>(value);
   if (TestTurboshaftFloat64Type(v, expectedType)) {
     return Undefined;
@@ -212,23 +213,37 @@ builtin CheckTurboshaftFloat32Type(implicit context: Context)(
 
   Print('Type assertion failed!');
   Print('Node id', nodeId);
-  Print('Actual value', Convert<Number>(v));
+  Print('Actual value', v);
   Print('Expected type', expectedType);
   unreachable;
 }
 
 // Builtin needs custom interface descriptor to allow float64 argument type.
 @customInterfaceDescriptor
-builtin CheckTurboshaftFloat64Type(implicit context: Context)(
-    value: float64, expectedType: TurboshaftFloat64Type, nodeId: Smi):
-    Undefined {
+builtin CheckTurboshaftFloat64Type(
+    implicit context: Context)(value: float64,
+    expectedType: TurboshaftFloat64Type, nodeId: Smi): Undefined {
   if (TestTurboshaftFloat64Type(value, expectedType)) {
     return Undefined;
   }
 
   Print('Type assertion failed!');
   Print('Node id', nodeId);
-  Print('Actual value', Convert<Number>(value));
+  Print('Actual value', value);
   Print('Expected type', expectedType);
   unreachable;
 }
+
+@customInterfaceDescriptor
+builtin DebugPrintWordPtr(
+    implicit context: Context)(value: uintptr): Undefined {
+  Print('DebugPrint (word): ', value);
+  return Undefined;
+}
+
+@customInterfaceDescriptor
+builtin DebugPrintFloat64(
+    implicit context: Context)(value: float64): Undefined {
+  Print('DebugPrint (float64): ', value);
+  return Undefined;
+}
diff --git a/deps/v8/src/objects/value-serializer.cc b/deps/v8/src/objects/value-serializer.cc
index 2efca82aaaa00d..1058f9c8a62c6d 100644
--- a/deps/v8/src/objects/value-serializer.cc
+++ b/deps/v8/src/objects/value-serializer.cc
@@ -350,13 +350,13 @@ void ValueSerializer::WriteTwoByteString(base::Vector<const base::uc16> chars) {
   WriteRawBytes(chars.begin(), chars.length() * sizeof(base::uc16));
 }
 
-void ValueSerializer::WriteBigIntContents(BigInt bigint) {
-  uint32_t bitfield = bigint.GetBitfieldForSerialization();
+void ValueSerializer::WriteBigIntContents(Tagged<BigInt> bigint) {
+  uint32_t bitfield = bigint->GetBitfieldForSerialization();
   int bytelength = BigInt::DigitsByteLengthForBitfield(bitfield);
   WriteVarint<uint32_t>(bitfield);
   uint8_t* dest;
   if (ReserveRawBytes(bytelength).To(&dest)) {
-    bigint.SerializeDigits(dest);
+    bigint->SerializeDigits(dest);
   }
 }
 
@@ -440,14 +440,14 @@ Maybe<bool> ValueSerializer::WriteObject(Handle<Object> object) {
   // previously failed and so the buffer is corrupt.
   if (V8_UNLIKELY(out_of_memory_)) return ThrowIfOutOfMemory();
 
-  if (object->IsSmi()) {
+  if (IsSmi(*object)) {
     WriteSmi(Smi::cast(*object));
     return ThrowIfOutOfMemory();
   }
 
-  DCHECK(object->IsHeapObject());
+  DCHECK(IsHeapObject(*object));
   InstanceType instance_type =
-      HeapObject::cast(*object).map(isolate_).instance_type();
+      HeapObject::cast(*object)->map(isolate_)->instance_type();
   switch (instance_type) {
     case ODDBALL_TYPE:
       WriteOddball(Oddball::cast(*object));
@@ -488,9 +488,9 @@ Maybe<bool> ValueSerializer::WriteObject(Handle<Object> object) {
   }
 }
 
-void ValueSerializer::WriteOddball(Oddball oddball) {
+void ValueSerializer::WriteOddball(Tagged<Oddball> oddball) {
   SerializationTag tag = SerializationTag::kUndefined;
-  switch (oddball.kind()) {
+  switch (oddball->kind()) {
     case Oddball::kUndefined:
       tag = SerializationTag::kUndefined;
       break;
@@ -509,18 +509,18 @@ void ValueSerializer::WriteOddball(Oddball oddball) {
   WriteTag(tag);
 }
 
-void ValueSerializer::WriteSmi(Smi smi) {
+void ValueSerializer::WriteSmi(Tagged<Smi> smi) {
   static_assert(kSmiValueSize <= 32, "Expected SMI <= 32 bits.");
   WriteTag(SerializationTag::kInt32);
   WriteZigZag<int32_t>(smi.value());
 }
 
-void ValueSerializer::WriteHeapNumber(HeapNumber number) {
+void ValueSerializer::WriteHeapNumber(Tagged<HeapNumber> number) {
   WriteTag(SerializationTag::kDouble);
-  WriteDouble(number.value());
+  WriteDouble(number->value());
 }
 
-void ValueSerializer::WriteBigInt(BigInt bigint) {
+void ValueSerializer::WriteBigInt(Tagged<BigInt> bigint) {
   WriteTag(SerializationTag::kBigInt);
   WriteBigIntContents(bigint);
 }
@@ -561,9 +561,9 @@ Maybe<bool> ValueSerializer::WriteJSReceiver(Handle<JSReceiver> receiver) {
   *find_result.entry = id + 1;
 
   // Eliminate callable and exotic objects, which should not be serialized.
-  InstanceType instance_type = receiver->map().instance_type();
-  if (receiver->IsCallable() || (IsSpecialReceiverInstanceType(instance_type) &&
-                                 instance_type != JS_SPECIAL_API_OBJECT_TYPE)) {
+  InstanceType instance_type = receiver->map()->instance_type();
+  if (IsCallable(*receiver) || (IsSpecialReceiverInstanceType(instance_type) &&
+                                instance_type != JS_SPECIAL_API_OBJECT_TYPE)) {
     return ThrowDataCloneError(MessageTemplate::kDataCloneError, receiver);
   }
 
@@ -641,9 +641,9 @@ Maybe<bool> ValueSerializer::WriteJSReceiver(Handle<JSReceiver> receiver) {
 }
 
 Maybe<bool> ValueSerializer::WriteJSObject(Handle<JSObject> object) {
-  DCHECK(!object->map().IsCustomElementsReceiverMap());
+  DCHECK(!IsCustomElementsReceiverMap(object->map()));
   const bool can_serialize_fast =
-      object->HasFastProperties(isolate_) && object->elements().length() == 0;
+      object->HasFastProperties(isolate_) && object->elements()->length() == 0;
   if (!can_serialize_fast) return WriteJSObjectSlow(object);
 
   Handle<Map> map(object->map(), isolate_);
@@ -654,9 +654,10 @@ Maybe<bool> ValueSerializer::WriteJSObject(Handle<JSObject> object) {
   uint32_t properties_written = 0;
   bool map_changed = false;
   for (InternalIndex i : map->IterateOwnDescriptors()) {
-    Handle<Name> key(map->instance_descriptors(isolate_).GetKey(i), isolate_);
-    if (!key->IsString(isolate_)) continue;
-    PropertyDetails details = map->instance_descriptors(isolate_).GetDetails(i);
+    Handle<Name> key(map->instance_descriptors(isolate_)->GetKey(i), isolate_);
+    if (!IsString(*key, isolate_)) continue;
+    PropertyDetails details =
+        map->instance_descriptors(isolate_)->GetDetails(i);
     if (details.IsDontEnum()) continue;
 
     Handle<Object> value;
@@ -706,7 +707,7 @@ Maybe<bool> ValueSerializer::WriteJSObjectSlow(Handle<JSObject> object) {
 Maybe<bool> ValueSerializer::WriteJSArray(Handle<JSArray> array) {
   PtrComprCageBase cage_base(isolate_);
   uint32_t length = 0;
-  bool valid_length = array->length().ToArrayLength(&length);
+  bool valid_length = Object::ToArrayLength(array->length(), &length);
   DCHECK(valid_length);
   USE(valid_length);
 
@@ -729,9 +730,9 @@ Maybe<bool> ValueSerializer::WriteJSArray(Handle<JSArray> array) {
     switch (array->GetElementsKind(cage_base)) {
       case PACKED_SMI_ELEMENTS: {
         DisallowGarbageCollection no_gc;
-        FixedArray elements = FixedArray::cast(array->elements());
+        Tagged<FixedArray> elements = FixedArray::cast(array->elements());
         for (i = 0; i < length; i++)
-          WriteSmi(Smi::cast(elements.get(cage_base, i)));
+          WriteSmi(Smi::cast(elements->get(cage_base, i)));
         break;
       }
       case PACKED_DOUBLE_ELEMENTS: {
@@ -739,10 +740,11 @@ Maybe<bool> ValueSerializer::WriteJSArray(Handle<JSArray> array) {
         // is empty. No elements to encode in this case anyhow.
         if (length == 0) break;
         DisallowGarbageCollection no_gc;
-        FixedDoubleArray elements = FixedDoubleArray::cast(array->elements());
+        Tagged<FixedDoubleArray> elements =
+            FixedDoubleArray::cast(array->elements());
         for (i = 0; i < length; i++) {
           WriteTag(SerializationTag::kDouble);
-          WriteDouble(elements.get_scalar(i));
+          WriteDouble(elements->get_scalar(i));
         }
         break;
       }
@@ -755,7 +757,7 @@ Maybe<bool> ValueSerializer::WriteJSArray(Handle<JSArray> array) {
             break;
           }
           Handle<Object> element(
-              FixedArray::cast(array->elements()).get(cage_base, i), isolate_);
+              FixedArray::cast(array->elements())->get(cage_base, i), isolate_);
           if (!WriteObject(element).FromMaybe(false)) return Nothing<bool>();
         }
         break;
@@ -817,9 +819,9 @@ Maybe<bool> ValueSerializer::WriteJSArray(Handle<JSArray> array) {
   return ThrowIfOutOfMemory();
 }
 
-void ValueSerializer::WriteJSDate(JSDate date) {
+void ValueSerializer::WriteJSDate(Tagged<JSDate> date) {
   WriteTag(SerializationTag::kDate);
-  WriteDouble(date.value().Number());
+  WriteDouble(Object::Number(date->value()));
 }
 
 Maybe<bool> ValueSerializer::WriteJSPrimitiveWrapper(
@@ -827,23 +829,23 @@ Maybe<bool> ValueSerializer::WriteJSPrimitiveWrapper(
   PtrComprCageBase cage_base(isolate_);
   {
     DisallowGarbageCollection no_gc;
-    Object inner_value = value->value();
-    if (inner_value.IsTrue(isolate_)) {
+    Tagged<Object> inner_value = value->value();
+    if (IsTrue(inner_value, isolate_)) {
       WriteTag(SerializationTag::kTrueObject);
-    } else if (inner_value.IsFalse(isolate_)) {
+    } else if (IsFalse(inner_value, isolate_)) {
       WriteTag(SerializationTag::kFalseObject);
-    } else if (inner_value.IsNumber(cage_base)) {
+    } else if (IsNumber(inner_value, cage_base)) {
       WriteTag(SerializationTag::kNumberObject);
-      WriteDouble(inner_value.Number());
-    } else if (inner_value.IsBigInt(cage_base)) {
+      WriteDouble(Object::Number(inner_value));
+    } else if (IsBigInt(inner_value, cage_base)) {
       WriteTag(SerializationTag::kBigIntObject);
       WriteBigIntContents(BigInt::cast(inner_value));
-    } else if (inner_value.IsString(cage_base)) {
+    } else if (IsString(inner_value, cage_base)) {
       WriteTag(SerializationTag::kStringObject);
       WriteString(handle(String::cast(inner_value), isolate_));
     } else {
       AllowGarbageCollection allow_gc;
-      DCHECK(inner_value.IsSymbol());
+      DCHECK(IsSymbol(inner_value));
       return ThrowDataCloneError(MessageTemplate::kDataCloneError, value);
     }
   }
@@ -863,15 +865,15 @@ Maybe<bool> ValueSerializer::WriteJSMap(Handle<JSMap> js_map) {
   Handle<FixedArray> entries = isolate_->factory()->NewFixedArray(length);
   {
     DisallowGarbageCollection no_gc;
-    OrderedHashMap raw_table = *table;
-    FixedArray raw_entries = *entries;
-    Oddball the_hole = ReadOnlyRoots(isolate_).the_hole_value();
+    Tagged<OrderedHashMap> raw_table = *table;
+    Tagged<FixedArray> raw_entries = *entries;
+    Tagged<Hole> the_hole = ReadOnlyRoots(isolate_).the_hole_value();
     int result_index = 0;
-    for (InternalIndex entry : raw_table.IterateEntries()) {
-      Object key = raw_table.KeyAt(entry);
+    for (InternalIndex entry : raw_table->IterateEntries()) {
+      Tagged<Object> key = raw_table->KeyAt(entry);
       if (key == the_hole) continue;
-      raw_entries.set(result_index++, key);
-      raw_entries.set(result_index++, raw_table.ValueAt(entry));
+      raw_entries->set(result_index++, key);
+      raw_entries->set(result_index++, raw_table->ValueAt(entry));
     }
     DCHECK_EQ(result_index, length);
   }
@@ -895,14 +897,14 @@ Maybe<bool> ValueSerializer::WriteJSSet(Handle<JSSet> js_set) {
   Handle<FixedArray> entries = isolate_->factory()->NewFixedArray(length);
   {
     DisallowGarbageCollection no_gc;
-    OrderedHashSet raw_table = *table;
-    FixedArray raw_entries = *entries;
-    Oddball the_hole = ReadOnlyRoots(isolate_).the_hole_value();
+    Tagged<OrderedHashSet> raw_table = *table;
+    Tagged<FixedArray> raw_entries = *entries;
+    Tagged<Hole> the_hole = ReadOnlyRoots(isolate_).the_hole_value();
     int result_index = 0;
-    for (InternalIndex entry : raw_table.IterateEntries()) {
-      Object key = raw_table.KeyAt(entry);
+    for (InternalIndex entry : raw_table->IterateEntries()) {
+      Tagged<Object> key = raw_table->KeyAt(entry);
       if (key == the_hole) continue;
-      raw_entries.set(result_index++, key);
+      raw_entries->set(result_index++, key);
     }
     DCHECK_EQ(result_index, length);
   }
@@ -970,19 +972,20 @@ Maybe<bool> ValueSerializer::WriteJSArrayBuffer(
   return ThrowIfOutOfMemory();
 }
 
-Maybe<bool> ValueSerializer::WriteJSArrayBufferView(JSArrayBufferView view) {
+Maybe<bool> ValueSerializer::WriteJSArrayBufferView(
+    Tagged<JSArrayBufferView> view) {
   if (treat_array_buffer_views_as_host_objects_) {
     return WriteHostObject(handle(view, isolate_));
   }
   WriteTag(SerializationTag::kArrayBufferView);
   ArrayBufferViewTag tag = ArrayBufferViewTag::kInt8Array;
-  if (view.IsJSTypedArray()) {
-    if (JSTypedArray::cast(view).IsOutOfBounds()) {
+  if (IsJSTypedArray(view)) {
+    if (JSTypedArray::cast(view)->IsOutOfBounds()) {
       DCHECK(v8_flags.harmony_rab_gsab);
       return ThrowDataCloneError(MessageTemplate::kDataCloneError,
                                  handle(view, isolate_));
     }
-    switch (JSTypedArray::cast(view).type()) {
+    switch (JSTypedArray::cast(view)->type()) {
 #define TYPED_ARRAY_CASE(Type, type, TYPE, ctype) \
   case kExternal##Type##Array:                    \
     tag = ArrayBufferViewTag::k##Type##Array;     \
@@ -991,9 +994,9 @@ Maybe<bool> ValueSerializer::WriteJSArrayBufferView(JSArrayBufferView view) {
 #undef TYPED_ARRAY_CASE
     }
   } else {
-    DCHECK(view.IsJSDataViewOrRabGsabDataView());
-    if (view.IsJSRabGsabDataView() &&
-        JSRabGsabDataView::cast(view).IsOutOfBounds()) {
+    DCHECK(IsJSDataViewOrRabGsabDataView(view));
+    if (IsJSRabGsabDataView(view) &&
+        JSRabGsabDataView::cast(view)->IsOutOfBounds()) {
       DCHECK(v8_flags.harmony_rab_gsab);
       return ThrowDataCloneError(MessageTemplate::kDataCloneError,
                                  handle(view, isolate_));
@@ -1002,11 +1005,11 @@ Maybe<bool> ValueSerializer::WriteJSArrayBufferView(JSArrayBufferView view) {
     tag = ArrayBufferViewTag::kDataView;
   }
   WriteVarint(static_cast<uint8_t>(tag));
-  WriteVarint(static_cast<uint32_t>(view.byte_offset()));
-  WriteVarint(static_cast<uint32_t>(view.byte_length()));
+  WriteVarint(static_cast<uint32_t>(view->byte_offset()));
+  WriteVarint(static_cast<uint32_t>(view->byte_length()));
   uint32_t flags =
-      JSArrayBufferViewIsLengthTracking::encode(view.is_length_tracking()) |
-      JSArrayBufferViewIsBackedByRab::encode(view.is_backed_by_rab());
+      JSArrayBufferViewIsLengthTracking::encode(view->is_length_tracking()) |
+      JSArrayBufferViewIsBackedByRab::encode(view->is_backed_by_rab());
   WriteVarint(flags);
   return ThrowIfOutOfMemory();
 }
@@ -1072,7 +1075,7 @@ Maybe<bool> ValueSerializer::WriteJSError(Handle<JSObject> error) {
            .ToHandle(&stack)) {
     return Nothing<bool>();
   }
-  if (stack->IsString()) {
+  if (IsString(*stack)) {
     WriteVarint(static_cast<uint8_t>(ErrorTag::kStack));
     WriteString(Handle<String>::cast(stack));
   }
@@ -1114,15 +1117,16 @@ Maybe<bool> ValueSerializer::WriteWasmModule(Handle<WasmModuleObject> object) {
 }
 
 Maybe<bool> ValueSerializer::WriteWasmMemory(Handle<WasmMemoryObject> object) {
-  if (!object->array_buffer().is_shared()) {
+  if (!object->array_buffer()->is_shared()) {
     return ThrowDataCloneError(MessageTemplate::kDataCloneError, object);
   }
 
   GlobalBackingStoreRegistry::Register(
-      object->array_buffer().GetBackingStore());
+      object->array_buffer()->GetBackingStore());
 
   WriteTag(SerializationTag::kWasmMemoryTransfer);
   WriteZigZag<int32_t>(object->maximum_pages());
+  WriteByte(object->is_memory64() ? 1 : 0);
   return WriteJSReceiver(Handle<JSReceiver>(object->array_buffer(), isolate_));
 }
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -1132,7 +1136,7 @@ Maybe<bool> ValueSerializer::WriteSharedObject(Handle<HeapObject> object) {
     return ThrowDataCloneError(MessageTemplate::kDataCloneError, object);
   }
 
-  DCHECK(object->IsShared());
+  DCHECK(IsShared(*object));
 
   // The first time a shared object is serialized, a new conveyor is made. This
   // conveyor is used for every shared object in this serialization and
@@ -1515,7 +1519,7 @@ MaybeHandle<Object> ValueDeserializer::ReadObject() {
   // after format version 0.
   Handle<Object> object;
   SerializationTag tag;
-  if (result.ToHandle(&object) && V8_UNLIKELY(object->IsJSArrayBuffer()) &&
+  if (result.ToHandle(&object) && V8_UNLIKELY(IsJSArrayBuffer(*object)) &&
       PeekTag().To(&tag) && tag == SerializationTag::kArrayBufferView) {
     ConsumeTag(SerializationTag::kArrayBufferView);
     result = ReadJSArrayBufferView(Handle<JSArrayBuffer>::cast(object));
@@ -1529,7 +1533,7 @@ MaybeHandle<Object> ValueDeserializer::ReadObject() {
 #if defined(DEBUG) && defined(VERIFY_HEAP)
   if (!result.is_null() && v8_flags.enable_slow_asserts &&
       v8_flags.verify_heap) {
-    object->ObjectVerify(isolate_);
+    Object::ObjectVerify(*object, isolate_);
   }
 #endif
 
@@ -1647,7 +1651,7 @@ MaybeHandle<Object> ValueDeserializer::ReadObjectInternal() {
 MaybeHandle<String> ValueDeserializer::ReadString() {
   if (version_ < 12) return ReadUtf8String();
   Handle<Object> object;
-  if (!ReadObject().ToHandle(&object) || !object->IsString(isolate_)) {
+  if (!ReadObject().ToHandle(&object) || !IsString(*object, isolate_)) {
     return MaybeHandle<String>();
   }
   return Handle<String>::cast(object);
@@ -1833,7 +1837,8 @@ MaybeHandle<JSArray> ValueDeserializer::ReadDenseJSArray() {
   uint32_t id = next_id_++;
   HandleScope scope(isolate_);
   Handle<JSArray> array = isolate_->factory()->NewJSArray(
-      HOLEY_ELEMENTS, length, length, INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
+      HOLEY_ELEMENTS, length, length,
+      ArrayStorageAllocationMode::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
   AddObjectWithID(id, array);
 
   Handle<FixedArray> elements(FixedArray::cast(array->elements()), isolate_);
@@ -1851,7 +1856,7 @@ MaybeHandle<JSArray> ValueDeserializer::ReadDenseJSArray() {
     // Serialization versions less than 11 encode the hole the same as
     // undefined. For consistency with previous behavior, store these as the
     // hole. Past version 11, undefined means undefined.
-    if (version_ < 11 && element->IsUndefined(isolate_)) continue;
+    if (version_ < 11 && IsUndefined(*element, isolate_)) continue;
 
     // Safety check.
     if (i >= elements_length) return MaybeHandle<JSArray>();
@@ -2184,8 +2189,8 @@ MaybeHandle<JSArrayBufferView> ValueDeserializer::ReadJSArrayBufferView(
 }
 
 bool ValueDeserializer::ValidateJSArrayBufferViewFlags(
-    JSArrayBuffer buffer, uint32_t serialized_flags, bool& is_length_tracking,
-    bool& is_backed_by_rab) {
+    Tagged<JSArrayBuffer> buffer, uint32_t serialized_flags,
+    bool& is_length_tracking, bool& is_backed_by_rab) {
   is_length_tracking =
       JSArrayBufferViewIsLengthTracking::decode(serialized_flags);
   is_backed_by_rab = JSArrayBufferViewIsBackedByRab::decode(serialized_flags);
@@ -2200,20 +2205,21 @@ bool ValueDeserializer::ValidateJSArrayBufferViewFlags(
     is_length_tracking = false;
     is_backed_by_rab = false;
     // The resizability of the buffer was already disabled.
-    CHECK(!buffer.is_resizable_by_js());
+    CHECK(!buffer->is_resizable_by_js());
   }
 
   if (is_backed_by_rab || is_length_tracking) {
-    if (!buffer.is_resizable_by_js()) {
+    if (!buffer->is_resizable_by_js()) {
       return false;
     }
-    if (is_backed_by_rab && buffer.is_shared()) {
+    if (is_backed_by_rab && buffer->is_shared()) {
       return false;
     }
   }
   // The RAB-ness of the buffer and the TA's "is_backed_by_rab" need to be in
   // sync.
-  if (buffer.is_resizable_by_js() && !buffer.is_shared() && !is_backed_by_rab) {
+  if (buffer->is_resizable_by_js() && !buffer->is_shared() &&
+      !is_backed_by_rab) {
     return false;
   }
   return true;
@@ -2327,23 +2333,23 @@ MaybeHandle<WasmMemoryObject> ValueDeserializer::ReadWasmMemory() {
   uint32_t id = next_id_++;
 
   int32_t maximum_pages;
-  if (!ReadZigZag<int32_t>().To(&maximum_pages)) {
-    return MaybeHandle<WasmMemoryObject>();
-  }
+  if (!ReadZigZag<int32_t>().To(&maximum_pages)) return {};
+  uint8_t memory64_byte;
+  if (!ReadByte(&memory64_byte)) return {};
+  if (memory64_byte > 1) return {};
+  bool is_memory64 = memory64_byte;
 
   Handle<Object> buffer_object;
-  if (!ReadObject().ToHandle(&buffer_object) ||
-      !buffer_object->IsJSArrayBuffer()) {
-    return MaybeHandle<WasmMemoryObject>();
-  }
+  if (!ReadObject().ToHandle(&buffer_object)) return {};
+  if (!IsJSArrayBuffer(*buffer_object)) return {};
 
   Handle<JSArrayBuffer> buffer = Handle<JSArrayBuffer>::cast(buffer_object);
-  if (!buffer->is_shared()) {
-    return MaybeHandle<WasmMemoryObject>();
-  }
+  if (!buffer->is_shared()) return {};
 
   Handle<WasmMemoryObject> result =
-      WasmMemoryObject::New(isolate_, buffer, maximum_pages).ToHandleChecked();
+      WasmMemoryObject::New(isolate_, buffer, maximum_pages,
+                            is_memory64 ? WasmMemoryFlag::kWasmMemory64
+                                        : WasmMemoryFlag::kWasmMemory32);
 
   AddObjectWithID(id, result);
   return result;
@@ -2391,7 +2397,7 @@ MaybeHandle<HeapObject> ValueDeserializer::ReadSharedObject() {
 
   Handle<HeapObject> shared_object(
       shared_object_conveyor_->GetPersisted(shared_object_id), isolate_);
-  DCHECK(shared_object->IsShared());
+  DCHECK(IsShared(*shared_object));
   return shared_object;
 }
 
@@ -2416,20 +2422,20 @@ MaybeHandle<JSObject> ValueDeserializer::ReadHostObject() {
 static void CommitProperties(Handle<JSObject> object, Handle<Map> map,
                              const std::vector<Handle<Object>>& properties) {
   JSObject::AllocateStorageForMap(object, map);
-  DCHECK(!object->map().is_dictionary_map());
+  DCHECK(!object->map()->is_dictionary_map());
 
   DisallowGarbageCollection no_gc;
-  DescriptorArray descriptors = object->map().instance_descriptors();
+  Tagged<DescriptorArray> descriptors = object->map()->instance_descriptors();
   for (InternalIndex i : InternalIndex::Range(properties.size())) {
     // Initializing store.
-    object->WriteToField(i, descriptors.GetDetails(i),
+    object->WriteToField(i, descriptors->GetDetails(i),
                          *properties[i.raw_value()]);
   }
 }
 
-static bool IsValidObjectKey(Object value, Isolate* isolate) {
-  if (value.IsSmi()) return true;
-  auto instance_type = HeapObject::cast(value).map(isolate).instance_type();
+static bool IsValidObjectKey(Tagged<Object> value, Isolate* isolate) {
+  if (IsSmi(value)) return true;
+  auto instance_type = HeapObject::cast(value)->map(isolate)->instance_type();
   return InstanceTypeChecker::IsName(instance_type) ||
          InstanceTypeChecker::IsHeapNumber(instance_type);
 }
@@ -2444,7 +2450,7 @@ Maybe<uint32_t> ValueDeserializer::ReadJSObjectProperties(
     bool transitioning = true;
     Handle<Map> map(object->map(), isolate_);
     DCHECK(!map->is_dictionary_map());
-    DCHECK_EQ(0, map->instance_descriptors(isolate_).number_of_descriptors());
+    DCHECK_EQ(0, map->instance_descriptors(isolate_)->number_of_descriptors());
     std::vector<Handle<Object>> properties;
     properties.reserve(8);
 
@@ -2478,7 +2484,7 @@ Maybe<uint32_t> ValueDeserializer::ReadJSObjectProperties(
         if (!ReadObject().ToHandle(&key) || !IsValidObjectKey(*key, isolate_)) {
           return Nothing<uint32_t>();
         }
-        if (key->IsString(isolate_)) {
+        if (IsString(*key, isolate_)) {
           key =
               isolate_->factory()->InternalizeString(Handle<String>::cast(key));
           // Don't reuse |transitions| because it could be stale.
@@ -2504,22 +2510,22 @@ Maybe<uint32_t> ValueDeserializer::ReadJSObjectProperties(
         if (!target->is_dictionary_map()) {
           InternalIndex descriptor(properties.size());
           PropertyDetails details =
-              target->instance_descriptors(isolate_).GetDetails(descriptor);
+              target->instance_descriptors(isolate_)->GetDetails(descriptor);
           Representation expected_representation = details.representation();
-          if (value->FitsRepresentation(expected_representation)) {
+          if (Object::FitsRepresentation(*value, expected_representation)) {
             if (expected_representation.IsHeapObject() &&
                 !target->instance_descriptors(isolate_)
-                     .GetFieldType(descriptor)
-                     .NowContains(value)) {
-              Handle<FieldType> value_type =
-                  value->OptimalType(isolate_, expected_representation);
+                     ->GetFieldType(descriptor)
+                     ->NowContains(value)) {
+              Handle<FieldType> value_type = Object::OptimalType(
+                  *value, isolate_, expected_representation);
               MapUpdater::GeneralizeField(isolate_, target, descriptor,
                                           details.constness(),
                                           expected_representation, value_type);
             }
             DCHECK(target->instance_descriptors(isolate_)
-                       .GetFieldType(descriptor)
-                       .NowContains(value));
+                       ->GetFieldType(descriptor)
+                       ->NowContains(value));
             properties.push_back(value);
             map = target;
             continue;
@@ -2583,16 +2589,16 @@ Maybe<uint32_t> ValueDeserializer::ReadJSObjectProperties(
 
 bool ValueDeserializer::HasObjectWithID(uint32_t id) {
   return id < static_cast<unsigned>(id_map_->length()) &&
-         !id_map_->get(id).IsTheHole(isolate_);
+         !IsTheHole(id_map_->get(id), isolate_);
 }
 
 MaybeHandle<JSReceiver> ValueDeserializer::GetObjectWithID(uint32_t id) {
   if (id >= static_cast<unsigned>(id_map_->length())) {
     return MaybeHandle<JSReceiver>();
   }
-  Object value = id_map_->get(id);
-  if (value.IsTheHole(isolate_)) return MaybeHandle<JSReceiver>();
-  DCHECK(value.IsJSReceiver());
+  Tagged<Object> value = id_map_->get(id);
+  if (IsTheHole(value, isolate_)) return MaybeHandle<JSReceiver>();
+  DCHECK(IsJSReceiver(value));
   return Handle<JSReceiver>(JSReceiver::cast(value), isolate_);
 }
 
diff --git a/deps/v8/src/objects/value-serializer.h b/deps/v8/src/objects/value-serializer.h
index f5ccdcbf0a5f0c..9b2d97cf79a21f 100644
--- a/deps/v8/src/objects/value-serializer.h
+++ b/deps/v8/src/objects/value-serializer.h
@@ -109,21 +109,21 @@ class ValueSerializer {
   void WriteZigZag(T value);
   void WriteOneByteString(base::Vector<const uint8_t> chars);
   void WriteTwoByteString(base::Vector<const base::uc16> chars);
-  void WriteBigIntContents(BigInt bigint);
+  void WriteBigIntContents(Tagged<BigInt> bigint);
   Maybe<uint8_t*> ReserveRawBytes(size_t bytes);
 
   // Writing V8 objects of various kinds.
-  void WriteOddball(Oddball oddball);
-  void WriteSmi(Smi smi);
-  void WriteHeapNumber(HeapNumber number);
-  void WriteBigInt(BigInt bigint);
+  void WriteOddball(Tagged<Oddball> oddball);
+  void WriteSmi(Tagged<Smi> smi);
+  void WriteHeapNumber(Tagged<HeapNumber> number);
+  void WriteBigInt(Tagged<BigInt> bigint);
   void WriteString(Handle<String> string);
   Maybe<bool> WriteJSReceiver(Handle<JSReceiver> receiver)
       V8_WARN_UNUSED_RESULT;
   Maybe<bool> WriteJSObject(Handle<JSObject> object) V8_WARN_UNUSED_RESULT;
   Maybe<bool> WriteJSObjectSlow(Handle<JSObject> object) V8_WARN_UNUSED_RESULT;
   Maybe<bool> WriteJSArray(Handle<JSArray> array) V8_WARN_UNUSED_RESULT;
-  void WriteJSDate(JSDate date);
+  void WriteJSDate(Tagged<JSDate> date);
   Maybe<bool> WriteJSPrimitiveWrapper(Handle<JSPrimitiveWrapper> value)
       V8_WARN_UNUSED_RESULT;
   void WriteJSRegExp(Handle<JSRegExp> regexp);
@@ -131,7 +131,7 @@ class ValueSerializer {
   Maybe<bool> WriteJSSet(Handle<JSSet> map) V8_WARN_UNUSED_RESULT;
   Maybe<bool> WriteJSArrayBuffer(Handle<JSArrayBuffer> array_buffer)
       V8_WARN_UNUSED_RESULT;
-  Maybe<bool> WriteJSArrayBufferView(JSArrayBufferView array_buffer);
+  Maybe<bool> WriteJSArrayBufferView(Tagged<JSArrayBufferView> array_buffer);
   Maybe<bool> WriteJSError(Handle<JSObject> error) V8_WARN_UNUSED_RESULT;
   Maybe<bool> WriteJSSharedArray(Handle<JSSharedArray> shared_array)
       V8_WARN_UNUSED_RESULT;
@@ -303,8 +303,8 @@ class ValueDeserializer {
   MaybeHandle<JSArrayBufferView> ReadJSArrayBufferView(
       Handle<JSArrayBuffer> buffer) V8_WARN_UNUSED_RESULT;
   bool ValidateJSArrayBufferViewFlags(
-      JSArrayBuffer buffer, uint32_t serialized_flags, bool& is_length_tracking,
-      bool& is_backed_by_rab) V8_WARN_UNUSED_RESULT;
+      Tagged<JSArrayBuffer> buffer, uint32_t serialized_flags,
+      bool& is_length_tracking, bool& is_backed_by_rab) V8_WARN_UNUSED_RESULT;
   MaybeHandle<Object> ReadJSError() V8_WARN_UNUSED_RESULT;
 #if V8_ENABLE_WEBASSEMBLY
   MaybeHandle<JSObject> ReadWasmModuleTransfer() V8_WARN_UNUSED_RESULT;
diff --git a/deps/v8/src/objects/visitors-inl.h b/deps/v8/src/objects/visitors-inl.h
index 25186ac7f9a8de..954dde64636a00 100644
--- a/deps/v8/src/objects/visitors-inl.h
+++ b/deps/v8/src/objects/visitors-inl.h
@@ -5,8 +5,10 @@
 #ifndef V8_OBJECTS_VISITORS_INL_H_
 #define V8_OBJECTS_VISITORS_INL_H_
 
+#include "src/codegen/reloc-info.h"
 #include "src/common/globals.h"
 #include "src/execution/isolate.h"
+#include "src/objects/map.h"
 #include "src/objects/visitors.h"
 
 namespace v8 {
@@ -37,6 +39,41 @@ ObjectVisitorWithCageBases::ObjectVisitorWithCageBases(Isolate* isolate)
 ObjectVisitorWithCageBases::ObjectVisitorWithCageBases(Heap* heap)
     : ObjectVisitorWithCageBases(Isolate::FromHeap(heap)) {}
 
+template <typename Visitor>
+inline void ClientRootVisitor<Visitor>::VisitRunningCode(
+    FullObjectSlot code_slot, FullObjectSlot maybe_istream_slot) {
+#if DEBUG
+  DCHECK(!HeapObject::cast(*code_slot).InWritableSharedSpace());
+  Tagged<Object> maybe_istream = *maybe_istream_slot;
+  DCHECK(maybe_istream == Smi::zero() ||
+         !HeapObject::cast(maybe_istream).InWritableSharedSpace());
+#endif
+}
+
+template <typename Visitor>
+inline void ClientObjectVisitor<Visitor>::VisitMapPointer(
+    Tagged<HeapObject> host) {
+  if (!IsSharedHeapObject(host->map(cage_base()))) return;
+  actual_visitor_->VisitMapPointer(host);
+}
+
+template <typename Visitor>
+inline void ClientObjectVisitor<Visitor>::VisitCodeTarget(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
+#if DEBUG
+  Tagged<InstructionStream> target =
+      InstructionStream::FromTargetAddress(rinfo->target_address());
+  DCHECK(!target.InWritableSharedSpace());
+#endif
+}
+
+template <typename Visitor>
+inline void ClientObjectVisitor<Visitor>::VisitEmbeddedPointer(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
+  if (!IsSharedHeapObject(rinfo->target_object(cage_base()))) return;
+  actual_visitor_->VisitEmbeddedPointer(host, rinfo);
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/objects/visitors.cc b/deps/v8/src/objects/visitors.cc
index 434255b08da7a4..71f3299bc28007 100644
--- a/deps/v8/src/objects/visitors.cc
+++ b/deps/v8/src/objects/visitors.cc
@@ -6,6 +6,11 @@
 
 #include "src/codegen/reloc-info.h"
 
+#ifdef DEBUG
+#include "src/objects/instruction-stream-inl.h"
+#include "src/objects/smi.h"
+#endif  // DEBUG
+
 namespace v8 {
 namespace internal {
 
@@ -22,9 +27,13 @@ const char* RootVisitor::RootName(Root root) {
   UNREACHABLE();
 }
 
-void ObjectVisitor::VisitRelocInfo(RelocIterator* it) {
+void ObjectVisitor::VisitRelocInfo(Tagged<InstructionStream> host,
+                                   RelocIterator* it) {
+  // RelocInfo iteration is only valid for fully-initialized InstructionStream
+  // objects. Callers must ensure this.
+  DCHECK_NE(host->raw_code(kAcquireLoad), Smi::zero());
   for (; !it->done(); it->next()) {
-    it->rinfo()->Visit(this);
+    it->rinfo()->Visit(host, this);
   }
 }
 
diff --git a/deps/v8/src/objects/visitors.h b/deps/v8/src/objects/visitors.h
index ab16adf31d80be..ac7ef40241d239 100644
--- a/deps/v8/src/objects/visitors.h
+++ b/deps/v8/src/objects/visitors.h
@@ -9,6 +9,7 @@
 #include "src/objects/code.h"
 #include "src/objects/compressed-slots.h"
 #include "src/objects/foreign.h"
+#include "src/objects/instruction-stream.h"
 #include "src/objects/slots.h"
 
 namespace v8 {
@@ -17,34 +18,31 @@ namespace internal {
 class Code;
 
 #define ROOT_ID_LIST(V)                                 \
-  V(kStringTable, "(Internalized strings)")             \
+  V(kBootstrapper, "(Bootstrapper)")                    \
+  V(kBuiltins, "(Builtins)")                            \
+  V(kClientHeap, "(Client heap)")                       \
+  V(kCodeFlusher, "(Code flusher)")                     \
+  V(kCompilationCache, "(Compilation cache)")           \
+  V(kDebug, "(Debugger)")                               \
+  V(kExtensions, "(Extensions)")                        \
+  V(kEternalHandles, "(Eternal handles)")               \
   V(kExternalStringsTable, "(External strings)")        \
+  V(kGlobalHandles, "(Global handles)")                 \
+  V(kHandleScope, "(Handle scope)")                     \
+  V(kMicroTasks, "(Micro tasks)")                       \
   V(kReadOnlyRootList, "(Read-only roots)")             \
-  V(kStrongRootList, "(Strong roots)")                  \
+  V(kRelocatable, "(Relocatable)")                      \
+  V(kRetainMaps, "(Retain maps)")                       \
+  V(kSharedHeapObjectCache, "(Shareable object cache)") \
   V(kSmiRootList, "(Smi roots)")                        \
-  V(kBootstrapper, "(Bootstrapper)")                    \
   V(kStackRoots, "(Stack roots)")                       \
-  V(kRelocatable, "(Relocatable)")                      \
-  V(kDebug, "(Debugger)")                               \
-  V(kCompilationCache, "(Compilation cache)")           \
-  V(kHandleScope, "(Handle scope)")                     \
-  V(kBuiltins, "(Builtins)")                            \
-  V(kGlobalHandles, "(Global handles)")                 \
-  V(kTracedHandles, "(Traced handles)")                 \
-  V(kEternalHandles, "(Eternal handles)")               \
-  V(kThreadManager, "(Thread manager)")                 \
-  V(kStrongRoots, "(Strong roots)")                     \
-  V(kExtensions, "(Extensions)")                        \
-  V(kCodeFlusher, "(Code flusher)")                     \
   V(kStartupObjectCache, "(Startup object cache)")      \
-  V(kReadOnlyObjectCache, "(Read-only object cache)")   \
-  V(kSharedHeapObjectCache, "(Shareable object cache)") \
-  V(kWeakCollections, "(Weak collections)")             \
-  V(kWrapperTracing, "(Wrapper tracing)")               \
-  V(kWriteBarrier, "(Write barrier)")                   \
-  V(kRetainMaps, "(Retain maps)")                       \
-  V(kClientHeap, "(Client heap)")                       \
-  V(kUnknown, "(Unknown)")
+  V(kStringTable, "(Internalized strings)")             \
+  V(kStrongRootList, "(Strong root list)")              \
+  V(kStrongRoots, "(Strong roots)")                     \
+  V(kThreadManager, "(Thread manager)")                 \
+  V(kTracedHandles, "(Traced handles)")                 \
+  V(kWriteBarrier, "(Write barrier)")
 
 class VisitorSynchronization : public AllStatic {
  public:
@@ -128,60 +126,70 @@ class ObjectVisitor {
 
   // Visits a contiguous arrays of pointers in the half-open range
   // [start, end). Any or all of the values may be modified on return.
-  virtual void VisitPointers(HeapObject host, ObjectSlot start,
+  virtual void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                              ObjectSlot end) = 0;
-  virtual void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  virtual void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                              MaybeObjectSlot end) = 0;
   // When V8_EXTERNAL_CODE_SPACE is enabled, visits a InstructionStream pointer
   // slot. The values may be modified on return. Not used when
   // V8_EXTERNAL_CODE_SPACE is not enabled (the InstructionStream pointer slots
   // are visited as a part of on-heap slot visitation - via VisitPointers()).
-  virtual void VisitCodePointer(Code host, CodeObjectSlot slot) = 0;
+  virtual void VisitInstructionStreamPointer(Tagged<Code> host,
+                                             InstructionStreamSlot slot) = 0;
 
   // Custom weak pointers must be ignored by the GC but not other
   // visitors. They're used for e.g., lists that are recreated after GC. The
   // default implementation treats them as strong pointers. Visitors who want to
   // ignore them must override this function with empty.
-  virtual void VisitCustomWeakPointers(HeapObject host, ObjectSlot start,
-                                       ObjectSlot end) {
+  virtual void VisitCustomWeakPointers(Tagged<HeapObject> host,
+                                       ObjectSlot start, ObjectSlot end) {
     VisitPointers(host, start, end);
   }
 
   // Handy shorthand for visiting a single pointer.
-  virtual void VisitPointer(HeapObject host, ObjectSlot p) {
+  virtual void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) {
     VisitPointers(host, p, p + 1);
   }
-  virtual void VisitPointer(HeapObject host, MaybeObjectSlot p) {
+  virtual void VisitPointer(Tagged<HeapObject> host, MaybeObjectSlot p) {
     VisitPointers(host, p, p + 1);
   }
-  virtual void VisitCustomWeakPointer(HeapObject host, ObjectSlot p) {
+  virtual void VisitCustomWeakPointer(Tagged<HeapObject> host, ObjectSlot p) {
     VisitCustomWeakPointers(host, p, p + 1);
   }
 
-  virtual void VisitEphemeron(HeapObject host, int index, ObjectSlot key,
-                              ObjectSlot value) {
+  virtual void VisitEphemeron(Tagged<HeapObject> host, int index,
+                              ObjectSlot key, ObjectSlot value) {
     VisitPointer(host, key);
     VisitPointer(host, value);
   }
 
-  virtual void VisitCodeTarget(RelocInfo* rinfo) = 0;
-
-  virtual void VisitEmbeddedPointer(RelocInfo* rinfo) = 0;
-
-  virtual void VisitExternalReference(RelocInfo* rinfo) {}
+  // Visits the relocation info using the given iterator.
+  void VisitRelocInfo(Tagged<InstructionStream> host, RelocIterator* it);
+
+  virtual void VisitCodeTarget(Tagged<InstructionStream> host,
+                               RelocInfo* rinfo) {}
+  virtual void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                                    RelocInfo* rinfo) {}
+  virtual void VisitExternalReference(Tagged<InstructionStream> host,
+                                      RelocInfo* rinfo) {}
+  virtual void VisitInternalReference(Tagged<InstructionStream> host,
+                                      RelocInfo* rinfo) {}
+  // TODO(ishell): rename to VisitBuiltinEntry.
+  virtual void VisitOffHeapTarget(Tagged<InstructionStream> host,
+                                  RelocInfo* rinfo) {}
 
-  virtual void VisitExternalPointer(HeapObject host, ExternalPointerSlot slot,
+  virtual void VisitExternalPointer(Tagged<HeapObject> host,
+                                    ExternalPointerSlot slot,
                                     ExternalPointerTag tag) {}
 
-  virtual void VisitInternalReference(RelocInfo* rinfo) {}
+  virtual void VisitIndirectPointer(Tagged<HeapObject> host,
+                                    IndirectPointerSlot slot,
+                                    IndirectPointerMode mode) {}
 
-  // TODO(ishell): rename to VisitBuiltinEntry.
-  virtual void VisitOffHeapTarget(RelocInfo* rinfo) {}
-
-  // Visits the relocation info using the given iterator.
-  void VisitRelocInfo(RelocIterator* it);
+  virtual void VisitIndirectPointerTableEntry(Tagged<HeapObject> host,
+                                              IndirectPointerSlot slot) {}
 
-  virtual void VisitMapPointer(HeapObject host) { UNREACHABLE(); }
+  virtual void VisitMapPointer(Tagged<HeapObject> host) { UNREACHABLE(); }
 };
 
 // Helper version of ObjectVisitor that also takes care of caching base values
@@ -222,6 +230,108 @@ class ObjectVisitorWithCageBases : public ObjectVisitor {
 #endif  // V8_COMPRESS_POINTERS
 };
 
+// A wrapper class for root visitors that are used by client isolates during a
+// shared garbage collection. The wrapped visitor only visits heap objects in
+// the shared spaces and ignores everything else. The type parameter `Visitor`
+// should be a subclass of `RootVisitor`, or a similar class that provides the
+// required interface.
+template <typename Visitor = RootVisitor>
+class ClientRootVisitor final : public RootVisitor {
+ public:
+  explicit ClientRootVisitor(Visitor* actual_visitor)
+      : actual_visitor_(actual_visitor) {}
+
+  void VisitRootPointers(Root root, const char* description,
+                         FullObjectSlot start, FullObjectSlot end) final {
+    for (FullObjectSlot p = start; p < end; ++p) {
+      if (!IsSharedHeapObject(*p)) continue;
+      actual_visitor_->VisitRootPointer(root, description, p);
+    }
+  }
+
+  void VisitRootPointers(Root root, const char* description,
+                         OffHeapObjectSlot start, OffHeapObjectSlot end) final {
+    actual_visitor_->VisitRootPointers(root, description, start, end);
+  }
+
+  inline void VisitRunningCode(FullObjectSlot code_slot,
+                               FullObjectSlot maybe_istream_slot) final;
+
+  void Synchronize(VisitorSynchronization::SyncTag tag) final {
+    actual_visitor_->Synchronize(tag);
+  }
+
+ private:
+  V8_INLINE static bool IsSharedHeapObject(Tagged<Object> object) {
+    return IsHeapObject(object) &&
+           HeapObject::cast(object).InWritableSharedSpace();
+  }
+
+  Visitor* const actual_visitor_;
+};
+
+// A wrapper class for object visitors that are used by client isolates during a
+// shared garbage collection. The wrapped visitor only visits heap objects in
+// the shared spaces and ignores everything else. The type parameter `Visitor`
+// should be a subclass of `ObjectVisitorWithCageBases`, or a similar class that
+// provides the required interface.
+template <typename Visitor = ObjectVisitorWithCageBases>
+class ClientObjectVisitor final : public ObjectVisitorWithCageBases {
+ public:
+  explicit ClientObjectVisitor(Visitor* actual_visitor)
+      : ObjectVisitorWithCageBases(actual_visitor->cage_base(),
+                                   actual_visitor->code_cage_base()),
+        actual_visitor_(actual_visitor) {}
+
+  void VisitPointer(Tagged<HeapObject> host, ObjectSlot p) final {
+    if (!IsSharedHeapObject(p.load(cage_base()))) return;
+    actual_visitor_->VisitPointer(host, p);
+  }
+
+  inline void VisitMapPointer(Tagged<HeapObject> host) final;
+
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                     ObjectSlot end) final {
+    for (ObjectSlot p = start; p < end; ++p) {
+      // The map slot should be handled in VisitMapPointer.
+      DCHECK_NE(host->map_slot(), p);
+      DCHECK(!HasWeakHeapObjectTag(p.load(cage_base())));
+      VisitPointer(host, p);
+    }
+  }
+
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) final {
+#if DEBUG
+    Tagged<Object> istream_object = slot.load(code_cage_base());
+    Tagged<InstructionStream> istream;
+    if (istream_object.GetHeapObject(&istream)) {
+      DCHECK(!istream.InWritableSharedSpace());
+    }
+#endif
+  }
+
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
+                     MaybeObjectSlot end) final {
+    // At the moment, custom roots cannot contain weak pointers.
+    UNREACHABLE();
+  }
+
+  inline void VisitCodeTarget(Tagged<InstructionStream> host,
+                              RelocInfo* rinfo) final;
+
+  inline void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                                   RelocInfo* rinfo) final;
+
+ private:
+  V8_INLINE static bool IsSharedHeapObject(Tagged<Object> object) {
+    return IsHeapObject(object) &&
+           HeapObject::cast(object).InWritableSharedSpace();
+  }
+
+  Visitor* const actual_visitor_;
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/parsing/OWNERS b/deps/v8/src/parsing/OWNERS
index 069e31491c5183..fcfb3ac0a89016 100644
--- a/deps/v8/src/parsing/OWNERS
+++ b/deps/v8/src/parsing/OWNERS
@@ -1,3 +1,4 @@
 leszeks@chromium.org
 marja@chromium.org
+syg@chromium.org
 verwaest@chromium.org
diff --git a/deps/v8/src/parsing/literal-buffer.cc b/deps/v8/src/parsing/literal-buffer.cc
index 25388e938a9393..44909d388bcb04 100644
--- a/deps/v8/src/parsing/literal-buffer.cc
+++ b/deps/v8/src/parsing/literal-buffer.cc
@@ -32,8 +32,8 @@ int LiteralBuffer::NewCapacity(int min_capacity) {
 
 void LiteralBuffer::ExpandBuffer() {
   int min_capacity = std::max({kInitialCapacity, backing_store_.length()});
-  base::Vector<byte> new_store =
-      base::Vector<byte>::New(NewCapacity(min_capacity));
+  base::Vector<uint8_t> new_store =
+      base::Vector<uint8_t>::New(NewCapacity(min_capacity));
   if (position_ > 0) {
     MemCopy(new_store.begin(), backing_store_.begin(), position_);
   }
@@ -43,12 +43,12 @@ void LiteralBuffer::ExpandBuffer() {
 
 void LiteralBuffer::ConvertToTwoByte() {
   DCHECK(is_one_byte());
-  base::Vector<byte> new_store;
+  base::Vector<uint8_t> new_store;
   int new_content_size = position_ * base::kUC16Size;
   if (new_content_size >= backing_store_.length()) {
     // Ensure room for all currently read code units as UC16 as well
     // as the code unit about to be stored.
-    new_store = base::Vector<byte>::New(NewCapacity(new_content_size));
+    new_store = base::Vector<uint8_t>::New(NewCapacity(new_content_size));
   } else {
     new_store = backing_store_;
   }
diff --git a/deps/v8/src/parsing/literal-buffer.h b/deps/v8/src/parsing/literal-buffer.h
index 408c11381e8493..104289b9a1374a 100644
--- a/deps/v8/src/parsing/literal-buffer.h
+++ b/deps/v8/src/parsing/literal-buffer.h
@@ -5,6 +5,7 @@
 #ifndef V8_PARSING_LITERAL_BUFFER_H_
 #define V8_PARSING_LITERAL_BUFFER_H_
 
+#include "include/v8config.h"
 #include "src/base/strings.h"
 #include "src/base/vector.h"
 #include "src/strings/unicode-decoder.h"
@@ -15,8 +16,7 @@ namespace internal {
 // LiteralBuffer -  Collector of chars of literals.
 class LiteralBuffer final {
  public:
-  LiteralBuffer() : backing_store_(), position_(0), is_one_byte_(true) {}
-
+  LiteralBuffer() = default;
   ~LiteralBuffer() { backing_store_.Dispose(); }
 
   LiteralBuffer(const LiteralBuffer&) = delete;
@@ -24,13 +24,13 @@ class LiteralBuffer final {
 
   V8_INLINE void AddChar(char code_unit) {
     DCHECK(IsValidAscii(code_unit));
-    AddOneByteChar(static_cast<byte>(code_unit));
+    AddOneByteChar(static_cast<uint8_t>(code_unit));
   }
 
   V8_INLINE void AddChar(base::uc32 code_unit) {
     if (is_one_byte()) {
       if (code_unit <= static_cast<base::uc32>(unibrow::Latin1::kMaxChar)) {
-        AddOneByteChar(static_cast<byte>(code_unit));
+        AddOneByteChar(static_cast<uint8_t>(code_unit));
         return;
       }
       ConvertToTwoByte();
@@ -73,9 +73,9 @@ class LiteralBuffer final {
   Handle<String> Internalize(IsolateT* isolate) const;
 
  private:
-  static const int kInitialCapacity = 16;
-  static const int kGrowthFactor = 4;
-  static const int kMaxGrowth = 1 * MB;
+  static constexpr int kInitialCapacity = 256;
+  static constexpr int kGrowthFactor = 4;
+  static constexpr int kMaxGrowth = 1 * MB;
 
   inline bool IsValidAscii(char code_unit) {
     // Control characters and printable characters span the range of
@@ -85,7 +85,7 @@ class LiteralBuffer final {
     return iscntrl(code_unit) || isprint(code_unit);
   }
 
-  V8_INLINE void AddOneByteChar(byte one_byte_char) {
+  V8_INLINE void AddOneByteChar(uint8_t one_byte_char) {
     DCHECK(is_one_byte());
     if (position_ >= backing_store_.length()) ExpandBuffer();
     backing_store_[position_] = one_byte_char;
@@ -94,13 +94,12 @@ class LiteralBuffer final {
 
   void AddTwoByteChar(base::uc32 code_unit);
   int NewCapacity(int min_capacity);
-  void ExpandBuffer();
+  V8_NOINLINE V8_PRESERVE_MOST void ExpandBuffer();
   void ConvertToTwoByte();
 
-  base::Vector<byte> backing_store_;
-  int position_;
-
-  bool is_one_byte_;
+  base::Vector<uint8_t> backing_store_;
+  int position_ = 0;
+  bool is_one_byte_ = true;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/parsing/parse-info.cc b/deps/v8/src/parsing/parse-info.cc
index 47b883069b2912..aba8e188b8a828 100644
--- a/deps/v8/src/parsing/parse-info.cc
+++ b/deps/v8/src/parsing/parse-info.cc
@@ -44,40 +44,40 @@ UnoptimizedCompileFlags::UnoptimizedCompileFlags(Isolate* isolate,
 
 // static
 UnoptimizedCompileFlags UnoptimizedCompileFlags::ForFunctionCompile(
-    Isolate* isolate, SharedFunctionInfo shared) {
-  Script script = Script::cast(shared.script());
+    Isolate* isolate, Tagged<SharedFunctionInfo> shared) {
+  Tagged<Script> script = Script::cast(shared->script());
 
-  UnoptimizedCompileFlags flags(isolate, script.id());
+  UnoptimizedCompileFlags flags(isolate, script->id());
 
-  flags.SetFlagsFromFunction(&shared);
   flags.SetFlagsForFunctionFromScript(script);
+  flags.SetFlagsFromFunction(shared);
   flags.set_allow_lazy_parsing(true);
   flags.set_is_lazy_compile(true);
 
 #if V8_ENABLE_WEBASSEMBLY
-  flags.set_is_asm_wasm_broken(shared.is_asm_wasm_broken());
+  flags.set_is_asm_wasm_broken(shared->is_asm_wasm_broken());
 #endif  // V8_ENABLE_WEBASSEMBLY
-  flags.set_is_repl_mode(shared.is_repl_mode());
+  flags.set_is_repl_mode(shared->is_repl_mode());
 
   // Do not support re-parsing top-level function of a wrapped script.
-  DCHECK_IMPLIES(flags.is_toplevel(), !script.is_wrapped());
+  DCHECK_IMPLIES(flags.is_toplevel(), !script->is_wrapped());
 
   return flags;
 }
 
 // static
 UnoptimizedCompileFlags UnoptimizedCompileFlags::ForScriptCompile(
-    Isolate* isolate, Script script) {
-  UnoptimizedCompileFlags flags(isolate, script.id());
+    Isolate* isolate, Tagged<Script> script) {
+  UnoptimizedCompileFlags flags(isolate, script->id());
 
   flags.SetFlagsForFunctionFromScript(script);
   flags.SetFlagsForToplevelCompile(
-      script.IsUserJavaScript(), flags.outer_language_mode(),
-      construct_repl_mode(script.is_repl_mode()),
-      script.origin_options().IsModule() ? ScriptType::kModule
-                                         : ScriptType::kClassic,
+      script->IsUserJavaScript(), flags.outer_language_mode(),
+      construct_repl_mode(script->is_repl_mode()),
+      script->origin_options().IsModule() ? ScriptType::kModule
+                                          : ScriptType::kClassic,
       v8_flags.lazy);
-  if (script.is_wrapped()) {
+  if (script->is_wrapped()) {
     flags.set_function_syntax_kind(FunctionSyntaxKind::kWrapped);
   }
 
@@ -91,6 +91,8 @@ UnoptimizedCompileFlags UnoptimizedCompileFlags::ForToplevelCompile(
   UnoptimizedCompileFlags flags(isolate, isolate->GetNextScriptId());
   flags.SetFlagsForToplevelCompile(is_user_javascript, language_mode, repl_mode,
                                    type, lazy);
+  flags.set_compile_hints_magic_enabled(v8_flags.compile_hints_magic ||
+                                        isolate->allow_compile_hints_magic());
 
   LOG(isolate, ScriptEvent(ScriptEventType::kReserveId, flags.script_id()));
   return flags;
@@ -145,15 +147,20 @@ void UnoptimizedCompileFlags::SetFlagsForToplevelCompile(
   set_block_coverage_enabled(block_coverage_enabled() && is_user_javascript);
 }
 
-void UnoptimizedCompileFlags::SetFlagsForFunctionFromScript(Script script) {
-  DCHECK_EQ(script_id(), script.id());
+void UnoptimizedCompileFlags::SetFlagsForFunctionFromScript(
+    Tagged<Script> script) {
+  DCHECK_EQ(script_id(), script->id());
 
-  set_is_eval(script.compilation_type() == Script::COMPILATION_TYPE_EVAL);
-  set_is_module(script.origin_options().IsModule());
+  set_is_eval(script->compilation_type() == Script::CompilationType::kEval);
+  if (is_eval()) {
+    DCHECK(script->has_eval_from_shared());
+    set_outer_language_mode(script->eval_from_shared()->language_mode());
+  }
+  set_is_module(script->origin_options().IsModule());
   DCHECK_IMPLIES(is_eval(), !is_module());
 
   set_block_coverage_enabled(block_coverage_enabled() &&
-                             script.IsUserJavaScript());
+                             script->IsUserJavaScript());
 }
 
 ReusableUnoptimizedCompileState::ReusableUnoptimizedCompileState(
@@ -253,26 +260,26 @@ Handle<Script> ParseInfo::CreateScript(
   Handle<Script> script =
       isolate->factory()->NewScriptWithId(source, flags().script_id(), event);
   DisallowGarbageCollection no_gc;
-  auto raw_script = *script;
+  Tagged<Script> raw_script = *script;
   switch (natives) {
     case EXTENSION_CODE:
-      raw_script.set_type(Script::TYPE_EXTENSION);
+      raw_script->set_type(Script::Type::kExtension);
       break;
     case INSPECTOR_CODE:
-      raw_script.set_type(Script::TYPE_INSPECTOR);
+      raw_script->set_type(Script::Type::kInspector);
       break;
     case NOT_NATIVES_CODE:
       break;
   }
-  raw_script.set_origin_options(origin_options);
-  raw_script.set_is_repl_mode(flags().is_repl_mode());
+  raw_script->set_origin_options(origin_options);
+  raw_script->set_is_repl_mode(flags().is_repl_mode());
 
   DCHECK_EQ(is_wrapped_as_function(), !maybe_wrapped_arguments.is_null());
   if (is_wrapped_as_function()) {
-    raw_script.set_wrapped_arguments(
+    raw_script->set_wrapped_arguments(
         *maybe_wrapped_arguments.ToHandleChecked());
   } else if (flags().is_eval()) {
-    raw_script.set_compilation_type(Script::COMPILATION_TYPE_EVAL);
+    raw_script->set_compilation_type(Script::CompilationType::kEval);
   }
   CheckFlagsForToplevelCompileFromScript(raw_script);
 
@@ -304,24 +311,24 @@ void ParseInfo::set_character_stream(
   character_stream_.swap(character_stream);
 }
 
-void ParseInfo::CheckFlagsForToplevelCompileFromScript(Script script) {
+void ParseInfo::CheckFlagsForToplevelCompileFromScript(Tagged<Script> script) {
   CheckFlagsForFunctionFromScript(script);
   DCHECK(flags().is_toplevel());
-  DCHECK_EQ(flags().is_repl_mode(), script.is_repl_mode());
+  DCHECK_EQ(flags().is_repl_mode(), script->is_repl_mode());
 
-  if (script.is_wrapped()) {
+  if (script->is_wrapped()) {
     DCHECK_EQ(flags().function_syntax_kind(), FunctionSyntaxKind::kWrapped);
   }
 }
 
-void ParseInfo::CheckFlagsForFunctionFromScript(Script script) {
-  DCHECK_EQ(flags().script_id(), script.id());
+void ParseInfo::CheckFlagsForFunctionFromScript(Tagged<Script> script) {
+  DCHECK_EQ(flags().script_id(), script->id());
   // We set "is_eval" for wrapped scripts to get an outer declaration scope.
   // This is a bit hacky, but ok since we can't be both eval and wrapped.
-  DCHECK_EQ(flags().is_eval() && !script.is_wrapped(),
-            script.compilation_type() == Script::COMPILATION_TYPE_EVAL);
-  DCHECK_EQ(flags().is_module(), script.origin_options().IsModule());
-  DCHECK_IMPLIES(flags().block_coverage_enabled() && script.IsUserJavaScript(),
+  DCHECK_EQ(flags().is_eval() && !script->is_wrapped(),
+            script->compilation_type() == Script::CompilationType::kEval);
+  DCHECK_EQ(flags().is_module(), script->origin_options().IsModule());
+  DCHECK_IMPLIES(flags().block_coverage_enabled() && script->IsUserJavaScript(),
                  source_range_map() != nullptr);
 }
 
diff --git a/deps/v8/src/parsing/parse-info.h b/deps/v8/src/parsing/parse-info.h
index 404fbf9ac81671..59de7059190c23 100644
--- a/deps/v8/src/parsing/parse-info.h
+++ b/deps/v8/src/parsing/parse-info.h
@@ -7,6 +7,7 @@
 
 #include <memory>
 
+#include "include/v8-callbacks.h"
 #include "src/base/bit-field.h"
 #include "src/base/export-template.h"
 #include "src/base/logging.h"
@@ -62,7 +63,8 @@ class Zone;
   V(post_parallel_compile_tasks_for_lazy, bool, 1, _)           \
   V(collect_source_positions, bool, 1, _)                       \
   V(is_repl_mode, bool, 1, _)                                   \
-  V(produce_compile_hints, bool, 1, _)
+  V(produce_compile_hints, bool, 1, _)                          \
+  V(compile_hints_magic_enabled, bool, 1, _)
 
 class V8_EXPORT_PRIVATE UnoptimizedCompileFlags {
  public:
@@ -75,12 +77,12 @@ class V8_EXPORT_PRIVATE UnoptimizedCompileFlags {
 
   // Set-up flags for a compiling a particular function (either a lazy compile
   // or a recompile).
-  static UnoptimizedCompileFlags ForFunctionCompile(Isolate* isolate,
-                                                    SharedFunctionInfo shared);
+  static UnoptimizedCompileFlags ForFunctionCompile(
+      Isolate* isolate, Tagged<SharedFunctionInfo> shared);
 
   // Set-up flags for a full compilation of a given script.
   static UnoptimizedCompileFlags ForScriptCompile(Isolate* isolate,
-                                                  Script script);
+                                                  Tagged<Script> script);
 
   // Set-up flags for a parallel toplevel function compilation, based on the
   // flags of an existing toplevel compilation.
@@ -144,7 +146,7 @@ class V8_EXPORT_PRIVATE UnoptimizedCompileFlags {
                                   LanguageMode language_mode,
                                   REPLMode repl_mode, ScriptType type,
                                   bool lazy);
-  void SetFlagsForFunctionFromScript(Script script);
+  void SetFlagsForFunctionFromScript(Tagged<Script> script);
 
   uint32_t flags_;
   int script_id_;
@@ -337,7 +339,7 @@ class V8_EXPORT_PRIVATE ParseInfo {
     source_range_map_ = source_range_map;
   }
 
-  void CheckFlagsForFunctionFromScript(Script script);
+  void CheckFlagsForFunctionFromScript(Tagged<Script> script);
 
   bool is_background_compilation() const { return is_background_compilation_; }
 
@@ -347,6 +349,13 @@ class V8_EXPORT_PRIVATE ParseInfo {
 
   void set_is_streaming_compilation() { is_streaming_compilation_ = true; }
 
+  void SetCompileHintCallbackAndData(CompileHintCallback callback, void* data) {
+    DCHECK_NULL(compile_hint_callback_);
+    DCHECK_NULL(compile_hint_callback_data_);
+    compile_hint_callback_ = callback;
+    compile_hint_callback_data_ = data;
+  }
+
   CompileHintCallback compile_hint_callback() const {
     return compile_hint_callback_;
   }
@@ -360,7 +369,7 @@ class V8_EXPORT_PRIVATE ParseInfo {
             ReusableUnoptimizedCompileState* reusable_state,
             uintptr_t stack_limit, RuntimeCallStats* runtime_call_stats);
 
-  void CheckFlagsForToplevelCompileFromScript(Script script);
+  void CheckFlagsForToplevelCompileFromScript(Tagged<Script> script);
 
   //------------- Inputs to parsing and scope analysis -----------------------
   const UnoptimizedCompileFlags flags_;
diff --git a/deps/v8/src/parsing/parser-base.h b/deps/v8/src/parsing/parser-base.h
index ff5af7dfec9204..66e531dfe786dd 100644
--- a/deps/v8/src/parsing/parser-base.h
+++ b/deps/v8/src/parsing/parser-base.h
@@ -597,19 +597,7 @@ class ParserBase {
           private_members(parser->impl()->NewClassPropertyList(4)),
           static_elements(parser->impl()->NewClassStaticElementList(4)),
           instance_fields(parser->impl()->NewClassPropertyList(4)),
-          constructor(parser->impl()->NullExpression()),
-          has_seen_constructor(false),
-          has_static_computed_names(false),
-          has_static_elements(false),
-          has_static_private_methods(false),
-          has_static_blocks(false),
-          has_instance_members(false),
-          requires_brand(false),
-          is_anonymous(false),
-          has_private_methods(false),
-          static_elements_scope(nullptr),
-          instance_members_scope(nullptr),
-          computed_field_count(0) {}
+          constructor(parser->impl()->NullExpression()) {}
     ExpressionT extends;
     ClassPropertyListT public_members;
     ClassPropertyListT private_members;
@@ -617,18 +605,18 @@ class ParserBase {
     ClassPropertyListT instance_fields;
     FunctionLiteralT constructor;
 
-    bool has_seen_constructor;
-    bool has_static_computed_names;
-    bool has_static_elements;
-    bool has_static_private_methods;
-    bool has_static_blocks;
-    bool has_instance_members;
-    bool requires_brand;
-    bool is_anonymous;
-    bool has_private_methods;
-    DeclarationScope* static_elements_scope;
-    DeclarationScope* instance_members_scope;
-    int computed_field_count;
+    bool has_seen_constructor = false;
+    bool has_static_computed_names = false;
+    bool has_static_elements = false;
+    bool has_static_private_methods = false;
+    bool has_static_blocks = false;
+    bool has_instance_members = false;
+    bool requires_brand = false;
+    bool is_anonymous = false;
+    bool has_private_methods = false;
+    DeclarationScope* static_elements_scope = nullptr;
+    DeclarationScope* instance_members_scope = nullptr;
+    int computed_field_count = 0;
     Variable* home_object_variable = nullptr;
     Variable* static_home_object_variable = nullptr;
   };
@@ -1242,6 +1230,9 @@ class ParserBase {
                                 Scanner::Location class_name_location,
                                 bool name_is_strict_reserved,
                                 int class_token_pos);
+  ExpressionT ParseClassLiteralBody(ClassScope* class_scope,
+                                    ClassInfo& class_info, IdentifierT name,
+                                    int class_token_pos);
 
   ExpressionT ParseTemplateLiteral(ExpressionT tag, int start, bool tagged);
   ExpressionT ParseSuperExpression();
@@ -2580,12 +2571,7 @@ typename ParserBase<Impl>::ExpressionT ParserBase<Impl>::ParseMemberInitializer(
   }
 
   if (is_static) {
-    // For the instance initializer, we will save the positions
-    // later with the positions of the class body so that we can reparse
-    // it later.
     // TODO(joyee): Make scopes be non contiguous.
-    initializer_scope->set_start_position(beg_pos);
-    initializer_scope->set_end_position(end_position());
     class_info->static_elements_scope = initializer_scope;
     class_info->has_static_elements = true;
   } else {
@@ -2605,7 +2591,6 @@ typename ParserBase<Impl>::BlockT ParserBase<Impl>::ParseClassStaticBlock(
   if (initializer_scope == nullptr) {
     initializer_scope =
         NewFunctionScope(FunctionKind::kClassStaticInitializerFunction);
-    initializer_scope->set_start_position(position());
     initializer_scope->SetLanguageMode(LanguageMode::kStrict);
     class_info->static_elements_scope = initializer_scope;
   }
@@ -2617,7 +2602,6 @@ typename ParserBase<Impl>::BlockT ParserBase<Impl>::ParseClassStaticBlock(
   // block scope instead of using the synthetic members initializer function
   // scope.
   BlockT static_block = ParseBlock(nullptr, NewVarblockScope());
-  initializer_scope->set_end_position(end_position());
   class_info->has_static_elements = true;
   return static_block;
 }
@@ -2864,8 +2848,7 @@ typename ParserBase<Impl>::ExpressionT ParserBase<Impl>::ParseObjectLiteral() {
   // this runtime function. Here, we make sure that the number of
   // properties is less than number of arguments allowed for a runtime
   // call.
-  if (has_rest_property &&
-      properties.length() > InstructionStream::kMaxArguments) {
+  if (has_rest_property && properties.length() > Code::kMaxArguments) {
     expression_scope()->RecordPatternError(Scanner::Location(pos, position()),
                                            MessageTemplate::kTooManyArguments);
   }
@@ -2921,7 +2904,7 @@ void ParserBase<Impl>::ParseArguments(
     if (!Check(Token::COMMA)) break;
   }
 
-  if (args->length() > InstructionStream::kMaxArguments) {
+  if (args->length() > Code::kMaxArguments) {
     ReportMessage(MessageTemplate::kTooManyArguments);
     return;
   }
@@ -3774,7 +3757,9 @@ ParserBase<Impl>::ParseImportExpressions() {
   AcceptINScope scope(this, true);
   ExpressionT specifier = ParseAssignmentExpressionCoverGrammar();
 
-  if (v8_flags.harmony_import_assertions && Check(Token::COMMA)) {
+  if ((v8_flags.harmony_import_assertions ||
+       v8_flags.harmony_import_attributes) &&
+      Check(Token::COMMA)) {
     if (Check(Token::RPAREN)) {
       // A trailing comma allowed after the specifier.
       return factory()->NewImportCallExpression(specifier, pos);
@@ -3968,7 +3953,7 @@ void ParserBase<Impl>::ParseFormalParameterList(FormalParametersT* parameters) {
   if (peek() != Token::RPAREN) {
     while (true) {
       // Add one since we're going to be adding a parameter.
-      if (parameters->arity + 1 > InstructionStream::kMaxArguments) {
+      if (parameters->arity + 1 > Code::kMaxArguments) {
         ReportMessage(MessageTemplate::kTooManyParameters);
         return;
       }
@@ -4575,6 +4560,11 @@ ParserBase<Impl>::ParseArrowFunctionLiteral(
   FunctionKind kind = formal_parameters.scope->function_kind();
   FunctionLiteral::EagerCompileHint eager_compile_hint =
       default_eager_compile_hint_;
+
+  int compile_hint_position = formal_parameters.scope->start_position();
+  eager_compile_hint =
+      impl()->GetEmbedderCompileHint(eager_compile_hint, compile_hint_position);
+
   bool can_preparse = impl()->parse_lazily() &&
                       eager_compile_hint == FunctionLiteral::kShouldLazyCompile;
   // TODO(marja): consider lazy-parsing inner arrow functions too. is_this
@@ -4770,10 +4760,18 @@ typename ParserBase<Impl>::ExpressionT ParserBase<Impl>::ParseClassLiteral(
     class_info.extends = ParseLeftHandSideExpression();
     scope.ValidateExpression();
   }
+  return ParseClassLiteralBody(class_scope, class_info, name, class_token_pos);
+}
+
+template <typename Impl>
+typename ParserBase<Impl>::ExpressionT ParserBase<Impl>::ParseClassLiteralBody(
+    ClassScope* class_scope, ClassInfo& class_info, IdentifierT name,
+    int class_token_pos) {
+  bool has_extends = !impl()->IsNull(class_info.extends);
 
   Expect(Token::LBRACE);
+  int start_pos = position();
 
-  const bool has_extends = !impl()->IsNull(class_info.extends);
   while (peek() != Token::RBRACE) {
     if (Check(Token::SEMICOLON)) continue;
 
@@ -4839,10 +4837,16 @@ typename ParserBase<Impl>::ExpressionT ParserBase<Impl>::ParseClassLiteral(
   Expect(Token::RBRACE);
   int end_pos = end_position();
   class_scope->set_end_position(end_pos);
+  if (class_info.static_elements_scope != nullptr) {
+    // Use the positions of the class body for the static initializer
+    // function so that we can reparse it later.
+    class_info.static_elements_scope->set_start_position(start_pos);
+    class_info.static_elements_scope->set_end_position(end_pos);
+  }
   if (class_info.instance_members_scope != nullptr) {
     // Use the positions of the class body for the instance initializer
     // function so that we can reparse it later.
-    class_info.instance_members_scope->set_start_position(class_token_pos);
+    class_info.instance_members_scope->set_start_position(start_pos);
     class_info.instance_members_scope->set_end_position(end_pos);
   }
 
@@ -4869,7 +4873,7 @@ typename ParserBase<Impl>::ExpressionT ParserBase<Impl>::ParseClassLiteral(
 
   bool should_save_class_variable_index =
       class_scope->should_save_class_variable_index();
-  if (!is_anonymous || should_save_class_variable_index) {
+  if (!class_info.is_anonymous || should_save_class_variable_index) {
     impl()->DeclareClassVariable(class_scope, name, &class_info,
                                  class_token_pos);
     if (should_save_class_variable_index) {
diff --git a/deps/v8/src/parsing/parser.cc b/deps/v8/src/parsing/parser.cc
index 6886e037ac2f97..da16f85234d7c0 100644
--- a/deps/v8/src/parsing/parser.cc
+++ b/deps/v8/src/parsing/parser.cc
@@ -507,7 +507,9 @@ void Parser::DeserializeScopeChain(
     original_scope_ = Scope::DeserializeScopeChain(
         isolate, zone(), *outer_scope_info, info->script_scope(),
         ast_value_factory(), mode);
-    if (flags().is_eval() || IsArrowFunction(flags().function_kind())) {
+    if (flags().is_eval() || IsArrowFunction(flags().function_kind()) ||
+        flags().function_kind() ==
+            FunctionKind::kClassStaticInitializerFunction) {
       original_scope_->GetReceiverScope()->DeserializeReceiver(
           ast_value_factory());
     }
@@ -575,7 +577,7 @@ void Parser::ParseProgram(Isolate* isolate, Handle<Script> script,
     if (!flags().is_eval()) {
       event_name = "parse-script";
       start = 0;
-      end = String::cast(script->source()).length();
+      end = String::cast(script->source())->length();
     }
     LOG(isolate,
         FunctionEvent(event_name, flags().script_id(), ms, start, end, "", 0));
@@ -858,12 +860,10 @@ void Parser::ParseFunction(Isolate* isolate, ParseInfo* info,
   // If the function is a class member initializer and there isn't a
   // scope mismatch, we will only deserialize up to the outer scope of
   // the class scope, and regenerate the class scope during reparsing.
-  if (flags().function_kind() ==
-          FunctionKind::kClassMembersInitializerFunction &&
+  if (IsClassMembersInitializerFunction(flags().function_kind()) &&
       shared_info->HasOuterScopeInfo() &&
       maybe_outer_scope_info.ToHandleChecked()->scope_type() == CLASS_SCOPE &&
-      maybe_outer_scope_info.ToHandleChecked()->StartPosition() ==
-          start_position) {
+      maybe_outer_scope_info.ToHandleChecked()->EndPosition() == end_position) {
     Handle<ScopeInfo> outer_scope_info =
         maybe_outer_scope_info.ToHandleChecked();
     if (outer_scope_info->HasOuterScopeInfo()) {
@@ -898,20 +898,28 @@ void Parser::ParseFunction(Isolate* isolate, ParseInfo* info,
       shared_info->Name(), SharedStringAccessGuardIfNeeded(isolate)));
   scanner_.Initialize();
 
+  FunctionKind function_kind = flags().function_kind();
   FunctionLiteral* result;
-  if (V8_UNLIKELY(shared_info->private_name_lookup_skips_outer_class() &&
-                  original_scope_->is_class_scope())) {
+  if (V8_UNLIKELY(IsClassMembersInitializerFunction(function_kind))) {
+    // Reparsing of class member initializer functions has to be handled
+    // specially because they require reparsing of the whole class body,
+    // function start/end positions correspond to the class literal body
+    // positions.
+    result = ParseClassForMemberInitialization(
+        isolate, maybe_outer_scope_info, function_kind, start_position,
+        function_literal_id, end_position, info->function_name());
+
+  } else if (V8_UNLIKELY(shared_info->private_name_lookup_skips_outer_class() &&
+                         original_scope_->is_class_scope())) {
     // If the function skips the outer class and the outer scope is a class, the
     // function is in heritage position. Otherwise the function scope's skip bit
     // will be correctly inherited from the outer scope.
     ClassScope::HeritageParsingScope heritage(original_scope_->AsClassScope());
-    result = DoParseDeserializedFunction(
-        isolate, maybe_outer_scope_info, info, start_position, end_position,
-        function_literal_id, info->function_name());
+    result = DoParseFunction(isolate, info, start_position, end_position,
+                             function_literal_id, info->function_name());
   } else {
-    result = DoParseDeserializedFunction(
-        isolate, maybe_outer_scope_info, info, start_position, end_position,
-        function_literal_id, info->function_name());
+    result = DoParseFunction(isolate, info, start_position, end_position,
+                             function_literal_id, info->function_name());
   }
   MaybeProcessSourceRanges(info, result, stack_limit_);
   if (result != nullptr) {
@@ -1074,29 +1082,15 @@ FunctionLiteral* Parser::DoParseFunction(Isolate* isolate, ParseInfo* info,
   return result;
 }
 
-FunctionLiteral* Parser::DoParseDeserializedFunction(
-    Isolate* isolate, MaybeHandle<ScopeInfo> maybe_outer_scope_info,
-    ParseInfo* info, int start_position, int end_position,
-    int function_literal_id, const AstRawString* raw_name) {
-  if (flags().function_kind() ==
-      FunctionKind::kClassMembersInitializerFunction) {
-    return ParseClassForInstanceMemberInitialization(
-        isolate, maybe_outer_scope_info, start_position, function_literal_id,
-        end_position);
-  }
-
-  return DoParseFunction(isolate, info, start_position, end_position,
-                         function_literal_id, raw_name);
-}
-
-FunctionLiteral* Parser::ParseClassForInstanceMemberInitialization(
+FunctionLiteral* Parser::ParseClassForMemberInitialization(
     Isolate* isolate, MaybeHandle<ScopeInfo> maybe_class_scope_info,
-    int initializer_pos, int initializer_id, int initializer_end_pos) {
-  // When the function is a kClassMembersInitializerFunction, we record the
-  // source range of the entire class as its positions in its SFI, so at this
-  // point the scanner should be rewound to the position of the class token.
-  int class_token_pos = initializer_pos;
-  DCHECK_EQ(peek_position(), class_token_pos);
+    FunctionKind initalizer_kind, int initializer_pos, int initializer_id,
+    int initializer_end_pos, const AstRawString* class_name) {
+  // When the function is a class members initializer function, we record the
+  // source range of the entire class body as its positions in its SFI, so at
+  // this point the scanner should be rewound to the position of the class
+  // token.
+  DCHECK_EQ(peek_position(), initializer_pos);
 
   // Insert a FunctionState with the closest outer Declaration scope
   DeclarationScope* nearest_decl_scope = original_scope_->GetDeclarationScope();
@@ -1111,15 +1105,53 @@ FunctionLiteral* Parser::ParseClassForInstanceMemberInitialization(
 
   ExpressionParsingScope no_expression_scope(impl());
 
-  // Reparse the class as an expression to build the instance member
-  // initializer function.
-  Expression* expr = ParseClassExpression(original_scope_);
+  // Reparse the whole class body to build member initializer functions.
+  Expression* expr;
+  {
+    bool is_anonymous = IsNull(class_name);
+    ClassScope* class_scope = NewClassScope(original_scope_, is_anonymous);
+    BlockState block_state(&scope_, class_scope);
+    RaiseLanguageMode(LanguageMode::kStrict);
+
+    BlockState object_literal_scope_state(&object_literal_scope_, nullptr);
+
+    ClassInfo class_info(this);
+    class_info.is_anonymous = is_anonymous;
+
+    // Create an arbitrary non-Null expression to indicate that the class
+    // extends something. Doing so unconditionally is fine because:
+    //  - the fact whether the class extends something affects parsing of
+    //    'super' expressions which cause parse-time SyntaxError if the class
+    //    is not a derived one. However, all such errors must have been
+    //    reported during initial parse of the class declaration.
+    //  - "extends" clause affects class constructor's FunctionKind, but here
+    //    we are interested only in the member initializer functions and thus
+    //    we can ignore the constructor function details.
+    //
+    // Given all the above we can simplify things and for the purpose of class
+    // member initializers reparsing don't bother propagating the existence of
+    // the "extends" clause through scope serialization/deserialization.
+    class_info.extends = factory()->NewNullLiteral(kNoSourcePosition);
+
+    // Note that we don't recheck class_name for strict-reserved words or eval
+    // because all such checks have already been done during initial paring and
+    // respective SyntaxErrors must have been thrown if necessary.
+
+    // Class initializers don't care about position of the class token.
+    int class_token_pos = kNoSourcePosition;
+    expr = ParseClassLiteralBody(class_scope, class_info, class_name,
+                                 class_token_pos);
+  }
+
   if (has_error()) return nullptr;
 
   DCHECK(expr->IsClassLiteral());
+  DCHECK(IsClassMembersInitializerFunction(initalizer_kind));
   ClassLiteral* literal = expr->AsClassLiteral();
   FunctionLiteral* initializer =
-      literal->instance_members_initializer_function();
+      initalizer_kind == FunctionKind::kClassMembersInitializerFunction
+          ? literal->instance_members_initializer_function()
+          : literal->static_initializer();
 
   // Reindex so that the function literal ids match.
   AstFunctionLiteralIdReindexer reindexer(
@@ -1133,8 +1165,8 @@ FunctionLiteral* Parser::ParseClassForInstanceMemberInitialization(
   bool needs_allocation_fixup =
       !maybe_class_scope_info.is_null() &&
       maybe_class_scope_info.ToHandleChecked()->scope_type() == CLASS_SCOPE &&
-      maybe_class_scope_info.ToHandleChecked()->StartPosition() ==
-          class_token_pos;
+      maybe_class_scope_info.ToHandleChecked()->EndPosition() ==
+          initializer_end_pos;
 
   ClassScope* reparsed_scope = literal->scope();
   reparsed_scope->FinalizeReparsedClassScope(isolate, maybe_class_scope_info,
@@ -1142,8 +1174,7 @@ FunctionLiteral* Parser::ParseClassForInstanceMemberInitialization(
                                              needs_allocation_fixup);
   original_scope_ = reparsed_scope;
 
-  DCHECK_EQ(initializer->kind(),
-            FunctionKind::kClassMembersInitializerFunction);
+  DCHECK_EQ(initializer->kind(), initalizer_kind);
   DCHECK_EQ(initializer->function_literal_id(), initializer_id);
   DCHECK_EQ(initializer->end_position(), initializer_end_pos);
 
@@ -1344,27 +1375,32 @@ ZonePtrList<const Parser::NamedImport>* Parser::ParseNamedImports(int pos) {
 }
 
 ImportAssertions* Parser::ParseImportAssertClause() {
-  // AssertClause :
-  //    assert '{' '}'
-  //    assert '{' AssertEntries '}'
+  // WithClause :
+  //    with '{' '}'
+  //    with '{' WithEntries ','? '}'
 
-  // AssertEntries :
-  //    IdentifierName: AssertionKey
-  //    IdentifierName: AssertionKey , AssertEntries
+  // WithEntries :
+  //    LiteralPropertyName
+  //    LiteralPropertyName ':' StringLiteral , WithEntries
 
-  // AssertionKey :
-  //     IdentifierName
-  //     StringLiteral
+  // (DEPRECATED)
+  // AssertClause :
+  //    assert '{' '}'
+  //    assert '{' WithEntries ','? '}'
 
   auto import_assertions = zone()->New<ImportAssertions>(zone());
 
-  if (!v8_flags.harmony_import_assertions) {
-    return import_assertions;
-  }
-
-  // Assert clause is optional, and cannot be preceded by a LineTerminator.
-  if (scanner()->HasLineTerminatorBeforeNext() ||
-      !CheckContextualKeyword(ast_value_factory()->assert_string())) {
+  if (v8_flags.harmony_import_attributes && Check(Token::WITH)) {
+    // 'with' keyword consumed
+  } else if (v8_flags.harmony_import_assertions &&
+             !scanner()->HasLineTerminatorBeforeNext() &&
+             CheckContextualKeyword(ast_value_factory()->assert_string())) {
+    // The 'assert' contextual keyword is deprecated in favor of 'with', and we
+    // need to investigate feasibility of unshipping.
+    //
+    // TODO(v8:13856): Remove once decision is made to unship 'assert' or keep.
+    ++use_counts_[v8::Isolate::kImportAssertionDeprecatedSyntax];
+  } else {
     return import_assertions;
   }
 
@@ -1372,8 +1408,12 @@ ImportAssertions* Parser::ParseImportAssertClause() {
 
   while (peek() != Token::RBRACE) {
     const AstRawString* attribute_key = nullptr;
-    if (Check(Token::STRING)) {
+    if (Check(Token::STRING) || Check(Token::SMI)) {
       attribute_key = GetSymbol();
+    } else if (Check(Token::NUMBER)) {
+      attribute_key = GetNumberAsSymbol();
+    } else if (Check(Token::BIGINT)) {
+      attribute_key = GetBigIntAsSymbol();
     } else {
       attribute_key = ParsePropertyName();
     }
@@ -1698,7 +1738,7 @@ Statement* Parser::ParseExportDeclaration() {
         const ImportAssertions* import_assertions = ParseImportAssertClause();
         ExpectSemicolon();
 
-        if (export_data->is_empty()) {
+        if (export_data->empty()) {
           module()->AddEmptyImport(module_specifier, import_assertions,
                                    specifier_loc, zone());
         } else {
@@ -2590,7 +2630,7 @@ void Parser::DeclareArrowFunctionFormalParameters(
 
   AddArrowFunctionFormalParameters(parameters, expr, params_loc.end_pos);
 
-  if (parameters->arity > InstructionStream::kMaxArguments) {
+  if (parameters->arity > Code::kMaxArguments) {
     ReportMessageAt(params_loc, MessageTemplate::kMalformedArrowFunParamList);
     return;
   }
@@ -2646,7 +2686,9 @@ FunctionLiteral* Parser::ParseFunctionLiteral(
 
   FunctionLiteral::EagerCompileHint eager_compile_hint =
       function_state_->next_function_is_likely_called() || is_wrapped ||
-              params_need_validation
+              params_need_validation ||
+              (info()->flags().compile_hints_magic_enabled() &&
+               scanner()->SawMagicCommentCompileHintsAll())
           ? FunctionLiteral::kShouldEagerCompile
           : default_eager_compile_hint();
 
@@ -2685,15 +2727,10 @@ FunctionLiteral* Parser::ParseFunctionLiteral(
   DCHECK_IMPLIES(parse_lazily(), info()->flags().allow_lazy_compile());
   DCHECK_IMPLIES(parse_lazily(), has_error() || allow_lazy_);
   DCHECK_IMPLIES(parse_lazily(), extension() == nullptr);
-  if (eager_compile_hint == FunctionLiteral::kShouldLazyCompile) {
-    // Apply compile hints from the embedder.
-    int compile_hint_position = peek_position();
-    v8::CompileHintCallback callback = info()->compile_hint_callback();
-    if (callback != nullptr &&
-        callback(compile_hint_position, info()->compile_hint_callback_data())) {
-      eager_compile_hint = FunctionLiteral::kShouldEagerCompile;
-    }
-  }
+
+  int compile_hint_position = peek_position();
+  eager_compile_hint =
+      GetEmbedderCompileHint(eager_compile_hint, compile_hint_position);
 
   const bool is_lazy =
       eager_compile_hint == FunctionLiteral::kShouldLazyCompile;
@@ -3242,19 +3279,20 @@ void Parser::AddClassStaticBlock(Block* block, ClassInfo* class_info) {
 }
 
 FunctionLiteral* Parser::CreateInitializerFunction(
-    const char* name, DeclarationScope* scope, Statement* initializer_stmt) {
+    const AstRawString* class_name, DeclarationScope* scope,
+    Statement* initializer_stmt) {
   DCHECK(IsClassMembersInitializerFunction(scope->function_kind()));
   // function() { .. class fields initializer .. }
   ScopedPtrList<Statement> statements(pointer_buffer());
   statements.Add(initializer_stmt);
   FunctionLiteral* result = factory()->NewFunctionLiteral(
-      ast_value_factory()->GetOneByteString(name), scope, statements, 0, 0, 0,
+      class_name, scope, statements, 0, 0, 0,
       FunctionLiteral::kNoDuplicateParameters,
       FunctionSyntaxKind::kAccessorOrMethod,
       FunctionLiteral::kShouldEagerCompile, scope->start_position(), false,
       GetNextFunctionLiteralId());
 #ifdef DEBUG
-  scope->SetScopeName(ast_value_factory()->GetOneByteString(name));
+  scope->SetScopeName(class_name);
 #endif
   RecordFunctionLiteralSourceRange(result);
 
@@ -3291,7 +3329,7 @@ Expression* Parser::RewriteClassLiteral(ClassScope* block_scope,
   FunctionLiteral* static_initializer = nullptr;
   if (class_info->has_static_elements) {
     static_initializer = CreateInitializerFunction(
-        "<static_initializer>", class_info->static_elements_scope,
+        name, class_info->static_elements_scope,
         factory()->NewInitializeClassStaticElementsStatement(
             class_info->static_elements, kNoSourcePosition));
   }
@@ -3299,7 +3337,7 @@ Expression* Parser::RewriteClassLiteral(ClassScope* block_scope,
   FunctionLiteral* instance_members_initializer_function = nullptr;
   if (class_info->has_instance_members) {
     instance_members_initializer_function = CreateInitializerFunction(
-        "<instance_members_initializer>", class_info->instance_members_scope,
+        name, class_info->instance_members_scope,
         factory()->NewInitializeClassMembersStatement(
             class_info->instance_fields, kNoSourcePosition));
     class_info->constructor->set_requires_instance_members_initializer(true);
@@ -3388,7 +3426,10 @@ void Parser::HandleSourceURLComments(IsolateT* isolate, Handle<Script> script) {
     script->set_source_url(*source_url);
   }
   Handle<String> source_mapping_url = scanner_.SourceMappingUrl(isolate);
-  if (!source_mapping_url.is_null()) {
+  // The API can provide a source map URL and the API should take precedence.
+  // Let's make sure we do not override the API with the magic comment.
+  if (!source_mapping_url.is_null() &&
+      IsUndefined(script->source_mapping_url(isolate), isolate)) {
     script->set_source_mapping_url(*source_mapping_url);
   }
 }
@@ -3414,6 +3455,9 @@ void Parser::UpdateStatistics(Isolate* isolate, Handle<Script> script) {
       isolate->CountUsage(v8::Isolate::kHtmlCommentInExternalScript);
     }
   }
+  if (scanner_.SawMagicCommentCompileHintsAll()) {
+    isolate->CountUsage(v8::Isolate::kCompileHintsMagicAll);
+  }
 }
 
 void Parser::UpdateStatistics(
@@ -3433,6 +3477,10 @@ void Parser::UpdateStatistics(
       use_counts->emplace_back(v8::Isolate::kHtmlCommentInExternalScript);
     }
   }
+  if (scanner_.SawMagicCommentCompileHintsAll()) {
+    use_counts->emplace_back(v8::Isolate::kCompileHintsMagicAll);
+  }
+
   *preparse_skipped = total_preparse_skipped_;
 }
 
diff --git a/deps/v8/src/parsing/parser.h b/deps/v8/src/parsing/parser.h
index 8f1c5f44721835..8aede5d6a2cd38 100644
--- a/deps/v8/src/parsing/parser.h
+++ b/deps/v8/src/parsing/parser.h
@@ -237,14 +237,10 @@ class V8_EXPORT_PRIVATE Parser : public NON_EXPORTED_BASE(ParserBase<Parser>) {
                                    int function_literal_id,
                                    const AstRawString* raw_name);
 
-  FunctionLiteral* DoParseDeserializedFunction(
-      Isolate* isolate, MaybeHandle<ScopeInfo> maybe_outer_scope_info,
-      ParseInfo* info, int start_position, int end_position,
-      int function_literal_id, const AstRawString* raw_name);
-
-  FunctionLiteral* ParseClassForInstanceMemberInitialization(
+  FunctionLiteral* ParseClassForMemberInitialization(
       Isolate* isolate, MaybeHandle<ScopeInfo> maybe_class_scope_info,
-      int initializer_pos, int initializer_id, int initializer_end_pos);
+      FunctionKind initalizer_kind, int initializer_pos, int initializer_id,
+      int initializer_end_pos, const AstRawString* class_name);
 
   // Called by ParseProgram after setting up the scanner.
   FunctionLiteral* DoParseProgram(Isolate* isolate, ParseInfo* info);
@@ -332,7 +328,7 @@ class V8_EXPORT_PRIVATE Parser : public NON_EXPORTED_BASE(ParserBase<Parser>) {
   Variable* CreatePrivateNameVariable(ClassScope* scope, VariableMode mode,
                                       IsStaticFlag is_static_flag,
                                       const AstRawString* name);
-  FunctionLiteral* CreateInitializerFunction(const char* name,
+  FunctionLiteral* CreateInitializerFunction(const AstRawString* class_name,
                                              DeclarationScope* scope,
                                              Statement* initializer_stmt);
 
@@ -1059,6 +1055,18 @@ class V8_EXPORT_PRIVATE Parser : public NON_EXPORTED_BASE(ParserBase<Parser>) {
         node, zone()->New<TryFinallyStatementSourceRanges>(body_range));
   }
 
+  V8_INLINE FunctionLiteral::EagerCompileHint GetEmbedderCompileHint(
+      FunctionLiteral::EagerCompileHint current_compile_hint, int position) {
+    if (current_compile_hint == FunctionLiteral::kShouldLazyCompile) {
+      v8::CompileHintCallback callback = info_->compile_hint_callback();
+      if (callback != nullptr &&
+          callback(position, info_->compile_hint_callback_data())) {
+        return FunctionLiteral::kShouldEagerCompile;
+      }
+    }
+    return current_compile_hint;
+  }
+
   // Generate the next internal variable name for binding an exported namespace
   // object (used to implement the "export * as" syntax).
   const AstRawString* NextInternalNamespaceExportName();
diff --git a/deps/v8/src/parsing/preparse-data-impl.h b/deps/v8/src/parsing/preparse-data-impl.h
index 3e271844a5ff61..733c5aea2f943c 100644
--- a/deps/v8/src/parsing/preparse-data-impl.h
+++ b/deps/v8/src/parsing/preparse-data-impl.h
@@ -17,18 +17,28 @@ namespace internal {
 // a header for tests.
 
 // Wraps a ZoneVector<uint8_t> to have with functions named the same as
-// PodArray<uint8_t>.
+// Tagged<PodArray<uint8_t>>.
 class ZoneVectorWrapper {
  public:
-  ZoneVectorWrapper() = default;
-  explicit ZoneVectorWrapper(ZoneVector<uint8_t>* data) : data_(data) {}
+  class Inner {
+   public:
+    Inner() = default;
+    explicit Inner(ZoneVector<uint8_t>* data) : data_(data) {}
 
-  int data_length() const { return static_cast<int>(data_->size()); }
+    int data_length() const { return static_cast<int>(data_->size()); }
+    uint8_t get(int index) const { return data_->at(index); }
+
+   private:
+    ZoneVector<uint8_t>* data_ = nullptr;
+  };
+
+  ZoneVectorWrapper() = default;
+  explicit ZoneVectorWrapper(ZoneVector<uint8_t>* data) : inner_(data) {}
 
-  uint8_t get(int index) const { return data_->at(index); }
+  const Inner* operator->() const { return &inner_; }
 
  private:
-  ZoneVector<uint8_t>* data_ = nullptr;
+  Inner inner_;
 };
 
 template <class Data>
@@ -62,29 +72,29 @@ class BaseConsumedPreparseData : public ConsumedPreparseData {
     };
 
     void SetPosition(int position) {
-      DCHECK_LE(position, data_.data_length());
+      DCHECK_LE(position, data_->data_length());
       index_ = position;
     }
 
     size_t RemainingBytes() const {
       DCHECK(has_data_);
-      DCHECK_LE(index_, data_.data_length());
-      return data_.data_length() - index_;
+      DCHECK_LE(index_, data_->data_length());
+      return data_->data_length() - index_;
     }
 
     bool HasRemainingBytes(size_t bytes) const {
       DCHECK(has_data_);
-      return index_ <= data_.data_length() && bytes <= RemainingBytes();
+      return index_ <= data_->data_length() && bytes <= RemainingBytes();
     }
 
     int32_t ReadUint32() {
       DCHECK(has_data_);
       DCHECK(HasRemainingBytes(kUint32Size));
       // Check that there indeed is an integer following.
-      DCHECK_EQ(data_.get(index_++), kUint32Size);
-      int32_t result = data_.get(index_) + (data_.get(index_ + 1) << 8) +
-                       (data_.get(index_ + 2) << 16) +
-                       (data_.get(index_ + 3) << 24);
+      DCHECK_EQ(data_->get(index_++), kUint32Size);
+      int32_t result = data_->get(index_) + (data_->get(index_ + 1) << 8) +
+                       (data_->get(index_ + 2) << 16) +
+                       (data_->get(index_ + 3) << 24);
       index_ += 4;
       stored_quarters_ = 0;
       return result;
@@ -92,17 +102,17 @@ class BaseConsumedPreparseData : public ConsumedPreparseData {
 
     int32_t ReadVarint32() {
       DCHECK(HasRemainingBytes(kVarint32MinSize));
-      DCHECK_EQ(data_.get(index_++), kVarint32MinSize);
+      DCHECK_EQ(data_->get(index_++), kVarint32MinSize);
       int32_t value = 0;
       bool has_another_byte;
       unsigned shift = 0;
       do {
-        uint8_t byte = data_.get(index_++);
+        uint8_t byte = data_->get(index_++);
         value |= static_cast<int32_t>(byte & 0x7F) << shift;
         shift += 7;
         has_another_byte = byte & 0x80;
       } while (has_another_byte);
-      DCHECK_EQ(data_.get(index_++), kVarint32EndMarker);
+      DCHECK_EQ(data_->get(index_++), kVarint32EndMarker);
       stored_quarters_ = 0;
       return value;
     }
@@ -111,9 +121,9 @@ class BaseConsumedPreparseData : public ConsumedPreparseData {
       DCHECK(has_data_);
       DCHECK(HasRemainingBytes(kUint8Size));
       // Check that there indeed is a byte following.
-      DCHECK_EQ(data_.get(index_++), kUint8Size);
+      DCHECK_EQ(data_->get(index_++), kUint8Size);
       stored_quarters_ = 0;
-      return data_.get(index_++);
+      return data_->get(index_++);
     }
 
     uint8_t ReadQuarter() {
@@ -121,8 +131,8 @@ class BaseConsumedPreparseData : public ConsumedPreparseData {
       if (stored_quarters_ == 0) {
         DCHECK(HasRemainingBytes(kUint8Size));
         // Check that there indeed are quarters following.
-        DCHECK_EQ(data_.get(index_++), kQuarterMarker);
-        stored_byte_ = data_.get(index_++);
+        DCHECK_EQ(data_->get(index_++), kQuarterMarker);
+        stored_byte_ = data_->get(index_++);
         stored_quarters_ = 4;
       }
       // Read the first 2 bits from stored_byte_.
@@ -180,11 +190,11 @@ class BaseConsumedPreparseData : public ConsumedPreparseData {
 
 // Implementation of ConsumedPreparseData for on-heap data.
 class OnHeapConsumedPreparseData final
-    : public BaseConsumedPreparseData<PreparseData> {
+    : public BaseConsumedPreparseData<Tagged<PreparseData>> {
  public:
   OnHeapConsumedPreparseData(LocalIsolate* isolate, Handle<PreparseData> data);
 
-  PreparseData GetScopeData() final;
+  Tagged<PreparseData> GetScopeData() final;
   ProducedPreparseData* GetChildData(Zone* zone, int child_index) final;
 
  private:
diff --git a/deps/v8/src/parsing/preparse-data.cc b/deps/v8/src/parsing/preparse-data.cc
index 7ebdb4e925a3a6..acc520be0e408a 100644
--- a/deps/v8/src/parsing/preparse-data.cc
+++ b/deps/v8/src/parsing/preparse-data.cc
@@ -133,7 +133,8 @@ void PreparseDataBuilder::ByteData::Start(std::vector<uint8_t>* buffer) {
 struct RawPreparseData {};
 
 void PreparseDataBuilder::ByteData::Finalize(Zone* zone) {
-  uint8_t* raw_zone_data = zone->NewArray<uint8_t, RawPreparseData>(index_);
+  uint8_t* raw_zone_data =
+      zone->AllocateArray<uint8_t, RawPreparseData>(index_);
   memcpy(raw_zone_data, byte_data_->data(), index_);
   byte_data_->resize(0);
   zone_byte_data_ = base::Vector<uint8_t>(raw_zone_data, index_);
@@ -401,10 +402,10 @@ void PreparseDataBuilder::SaveDataForVariable(Variable* var) {
   }
 #endif
 
-  byte variable_data = VariableMaybeAssignedField::encode(
-                           var->maybe_assigned() == kMaybeAssigned) |
-                       VariableContextAllocatedField::encode(
-                           var->has_forced_context_allocation());
+  uint8_t variable_data = VariableMaybeAssignedField::encode(
+                              var->maybe_assigned() == kMaybeAssigned) |
+                          VariableContextAllocatedField::encode(
+                              var->has_forced_context_allocation());
   byte_data_.Reserve(kUint8Size);
   byte_data_.WriteQuarter(variable_data);
 }
@@ -761,7 +762,9 @@ bool BaseConsumedPreparseData<Data>::VerifyDataStart() {
 }
 #endif
 
-PreparseData OnHeapConsumedPreparseData::GetScopeData() { return *data_; }
+Tagged<PreparseData> OnHeapConsumedPreparseData::GetScopeData() {
+  return *data_;
+}
 
 ProducedPreparseData* OnHeapConsumedPreparseData::GetChildData(Zone* zone,
                                                                int index) {
@@ -772,9 +775,11 @@ ProducedPreparseData* OnHeapConsumedPreparseData::GetChildData(Zone* zone,
 
 OnHeapConsumedPreparseData::OnHeapConsumedPreparseData(
     LocalIsolate* isolate, Handle<PreparseData> data)
-    : BaseConsumedPreparseData<PreparseData>(), isolate_(isolate), data_(data) {
+    : BaseConsumedPreparseData<Tagged<PreparseData>>(),
+      isolate_(isolate),
+      data_(data) {
   DCHECK_NOT_NULL(isolate);
-  DCHECK(data->IsPreparseData());
+  DCHECK(IsPreparseData(*data));
   DCHECK(VerifyDataStart());
 }
 
diff --git a/deps/v8/src/parsing/preparser.h b/deps/v8/src/parsing/preparser.h
index ea3308fc326294..6c4996bd06be78 100644
--- a/deps/v8/src/parsing/preparser.h
+++ b/deps/v8/src/parsing/preparser.h
@@ -1652,6 +1652,11 @@ class PreParser : public ParserBase<PreParser> {
 
   V8_INLINE bool ParsingDynamicFunctionDeclaration() const { return false; }
 
+  V8_INLINE FunctionLiteral::EagerCompileHint GetEmbedderCompileHint(
+      FunctionLiteral::EagerCompileHint current_compile_hint, int position) {
+    return current_compile_hint;
+  }
+
 // Generate empty functions here as the preparser does not collect source
 // ranges for block coverage.
 #define DEFINE_RECORD_SOURCE_RANGE(Name) \
diff --git a/deps/v8/src/parsing/rewriter.cc b/deps/v8/src/parsing/rewriter.cc
index d20fea9d481829..24e6607df938c2 100644
--- a/deps/v8/src/parsing/rewriter.cc
+++ b/deps/v8/src/parsing/rewriter.cc
@@ -12,6 +12,12 @@
 #include "src/parsing/parser.h"
 #include "src/zone/zone-list-inl.h"
 
+// Use this macro when `replacement_` or other data produced by Visit() is used
+// in a non-trivial way (needs to be valid) after calling Visit().
+#define VISIT_AND_RETURN_IF_STACK_OVERFLOW(param) \
+  Visit(param);                                   \
+  if (CheckStackOverflow()) return;
+
 namespace v8 {
 namespace internal {
 
@@ -226,12 +232,12 @@ void Processor::VisitTryCatchStatement(TryCatchStatement* node) {
   // Rewrite both try and catch block.
   bool set_after = is_set_;
 
-  Visit(node->try_block());
+  VISIT_AND_RETURN_IF_STACK_OVERFLOW(node->try_block());
   node->set_try_block(static_cast<Block*>(replacement_));
   bool set_in_try = is_set_;
 
   is_set_ = set_after;
-  Visit(node->catch_block());
+  VISIT_AND_RETURN_IF_STACK_OVERFLOW(node->catch_block());
   node->set_catch_block(static_cast<Block*>(replacement_));
 
   replacement_ = is_set_ && set_in_try ? node : AssignUndefinedBefore(node);
@@ -245,7 +251,7 @@ void Processor::VisitTryFinallyStatement(TryFinallyStatement* node) {
   if (breakable_) {
     // Only set result before a 'break' or 'continue'.
     is_set_ = true;
-    Visit(node->finally_block());
+    VISIT_AND_RETURN_IF_STACK_OVERFLOW(node->finally_block());
     node->set_finally_block(replacement_->AsBlock());
     CHECK_NOT_NULL(closure_scope());
     if (is_set_) {
@@ -285,7 +291,7 @@ void Processor::VisitTryFinallyStatement(TryFinallyStatement* node) {
     // reset is_set_ before visiting the try-block.
     is_set_ = false;
   }
-  Visit(node->try_block());
+  VISIT_AND_RETURN_IF_STACK_OVERFLOW(node->try_block());
   node->set_try_block(replacement_->AsBlock());
 
   replacement_ = is_set_ ? node : AssignUndefinedBefore(node);
@@ -438,5 +444,7 @@ base::Optional<VariableProxy*> Rewriter::RewriteBody(
   return nullptr;
 }
 
+#undef VISIT_AND_RETURN_IF_STACK_OVERFLOW
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/parsing/scanner-character-streams.cc b/deps/v8/src/parsing/scanner-character-streams.cc
index 69f1d6728c905d..245d7684875e5d 100644
--- a/deps/v8/src/parsing/scanner-character-streams.cc
+++ b/deps/v8/src/parsing/scanner-character-streams.cc
@@ -23,13 +23,13 @@ namespace internal {
 
 class V8_NODISCARD ScopedExternalStringLock {
  public:
-  explicit ScopedExternalStringLock(ExternalString string) {
+  explicit ScopedExternalStringLock(Tagged<ExternalString> string) {
     DCHECK(!string.is_null());
-    if (string.IsExternalOneByteString()) {
-      resource_ = ExternalOneByteString::cast(string).resource();
+    if (IsExternalOneByteString(string)) {
+      resource_ = ExternalOneByteString::cast(string)->resource();
     } else {
-      DCHECK(string.IsExternalTwoByteString());
-      resource_ = ExternalTwoByteString::cast(string).resource();
+      DCHECK(IsExternalTwoByteString(string));
+      resource_ = ExternalTwoByteString::cast(string)->resource();
     }
     DCHECK(resource_);
     resource_->Lock();
@@ -347,8 +347,7 @@ class RelocatingCharacterStream final
         UpdateBufferPointersCallback, this);
   }
 
-  static void UpdateBufferPointersCallback(LocalIsolate*, GCType,
-                                           GCCallbackFlags, void* stream) {
+  static void UpdateBufferPointersCallback(void* stream) {
     reinterpret_cast<RelocatingCharacterStream*>(stream)
         ->UpdateBufferPointers();
   }
@@ -866,28 +865,28 @@ Utf16CharacterStream* ScannerStream::For(Isolate* isolate, Handle<String> data,
   DCHECK_LE(start_pos, end_pos);
   DCHECK_LE(end_pos, data->length());
   size_t start_offset = 0;
-  if (data->IsSlicedString()) {
-    SlicedString string = SlicedString::cast(*data);
-    start_offset = string.offset();
-    String parent = string.parent();
-    if (parent.IsThinString()) parent = ThinString::cast(parent).actual();
+  if (IsSlicedString(*data)) {
+    Tagged<SlicedString> string = SlicedString::cast(*data);
+    start_offset = string->offset();
+    Tagged<String> parent = string->parent();
+    if (IsThinString(parent)) parent = ThinString::cast(parent)->actual();
     data = handle(parent, isolate);
   } else {
     data = String::Flatten(isolate, data);
   }
-  if (data->IsExternalOneByteString()) {
+  if (IsExternalOneByteString(*data)) {
     return new BufferedCharacterStream<ExternalStringStream>(
         static_cast<size_t>(start_pos), ExternalOneByteString::cast(*data),
         start_offset, static_cast<size_t>(end_pos));
-  } else if (data->IsExternalTwoByteString()) {
+  } else if (IsExternalTwoByteString(*data)) {
     return new UnbufferedCharacterStream<ExternalStringStream>(
         static_cast<size_t>(start_pos), ExternalTwoByteString::cast(*data),
         start_offset, static_cast<size_t>(end_pos));
-  } else if (data->IsSeqOneByteString()) {
+  } else if (IsSeqOneByteString(*data)) {
     return new BufferedCharacterStream<OnHeapStream>(
         static_cast<size_t>(start_pos), Handle<SeqOneByteString>::cast(data),
         start_offset, static_cast<size_t>(end_pos));
-  } else if (data->IsSeqTwoByteString()) {
+  } else if (IsSeqTwoByteString(*data)) {
     return new RelocatingCharacterStream(
         isolate, static_cast<size_t>(start_pos),
         Handle<SeqTwoByteString>::cast(data), start_offset,
diff --git a/deps/v8/src/parsing/scanner-character-streams.h b/deps/v8/src/parsing/scanner-character-streams.h
index 8665ea0b4bdd1c..6557351cf6191f 100644
--- a/deps/v8/src/parsing/scanner-character-streams.h
+++ b/deps/v8/src/parsing/scanner-character-streams.h
@@ -13,11 +13,8 @@
 namespace v8 {
 namespace internal {
 
-template <typename T>
-class Handle;
 class Utf16CharacterStream;
 class RuntimeCallStats;
-class String;
 
 class V8_EXPORT_PRIVATE ScannerStream {
  public:
diff --git a/deps/v8/src/parsing/scanner-inl.h b/deps/v8/src/parsing/scanner-inl.h
index 0a8c6343d193a5..afa14f06924eed 100644
--- a/deps/v8/src/parsing/scanner-inl.h
+++ b/deps/v8/src/parsing/scanner-inl.h
@@ -459,7 +459,7 @@ V8_INLINE Token::Value Scanner::ScanSingleToken() {
             if (c == '#' || c == '@') {
               Advance();
               Advance();
-              token = SkipSourceURLComment();
+              token = SkipMagicComment();
               continue;
             }
             token = SkipSingleLineComment();
diff --git a/deps/v8/src/parsing/scanner.cc b/deps/v8/src/parsing/scanner.cc
index ea1c2ba257cde4..a77a9ab8ef20af 100644
--- a/deps/v8/src/parsing/scanner.cc
+++ b/deps/v8/src/parsing/scanner.cc
@@ -215,15 +215,15 @@ Token::Value Scanner::SkipSingleLineComment() {
   return Token::WHITESPACE;
 }
 
-Token::Value Scanner::SkipSourceURLComment() {
-  TryToParseSourceURLComment();
+Token::Value Scanner::SkipMagicComment() {
+  TryToParseMagicComment();
   if (unibrow::IsLineTerminator(c0_) || c0_ == kEndOfInput) {
     return Token::WHITESPACE;
   }
   return SkipSingleLineComment();
 }
 
-void Scanner::TryToParseSourceURLComment() {
+void Scanner::TryToParseMagicComment() {
   // Magic comments are of the form: //[#@]\s<name>=\s*<value>\s*.* and this
   // function will just return if it cannot parse a magic comment.
   DCHECK(!IsWhiteSpaceOrLineTerminator(kEndOfInput));
@@ -240,10 +240,14 @@ void Scanner::TryToParseSourceURLComment() {
   if (!name.is_one_byte()) return;
   base::Vector<const uint8_t> name_literal = name.one_byte_literal();
   LiteralBuffer* value;
+  LiteralBuffer compile_hints_value;
   if (name_literal == base::StaticOneByteVector("sourceURL")) {
     value = &source_url_;
   } else if (name_literal == base::StaticOneByteVector("sourceMappingURL")) {
     value = &source_mapping_url_;
+  } else if (name_literal ==
+             base::StaticOneByteVector("experimentalChromiumCompileHints")) {
+    value = &compile_hints_value;
   } else {
     return;
   }
@@ -269,6 +273,13 @@ void Scanner::TryToParseSourceURLComment() {
     }
     Advance();
   }
+  if (value == &compile_hints_value) {
+    base::Vector<const uint8_t> value_literal =
+        compile_hints_value.one_byte_literal();
+    if (value_literal == base::StaticOneByteVector("all")) {
+      saw_magic_comment_compile_hints_all_ = true;
+    }
+  }
 }
 
 Token::Value Scanner::SkipMultiLineComment() {
@@ -1045,7 +1056,7 @@ const char* Scanner::CurrentLiteralAsCString(Zone* zone) const {
   DCHECK(is_literal_one_byte());
   base::Vector<const uint8_t> vector = literal_one_byte_string();
   int length = vector.length();
-  char* buffer = zone->NewArray<char>(length + 1);
+  char* buffer = zone->AllocateArray<char>(length + 1);
   memcpy(buffer, vector.begin(), length);
   buffer[length] = '\0';
   return buffer;
diff --git a/deps/v8/src/parsing/scanner.h b/deps/v8/src/parsing/scanner.h
index 2e035b2976424f..42d338bb508617 100644
--- a/deps/v8/src/parsing/scanner.h
+++ b/deps/v8/src/parsing/scanner.h
@@ -422,6 +422,10 @@ class V8_EXPORT_PRIVATE Scanner {
   template <typename IsolateT>
   Handle<String> SourceMappingUrl(IsolateT* isolate) const;
 
+  bool SawMagicCommentCompileHintsAll() const {
+    return saw_magic_comment_compile_hints_all_;
+  }
+
   bool FoundHtmlComment() const { return found_html_comment_; }
 
   const Utf16CharacterStream* stream() const { return source_; }
@@ -654,8 +658,8 @@ class V8_EXPORT_PRIVATE Scanner {
   V8_INLINE Token::Value SkipWhiteSpace();
   Token::Value SkipSingleHTMLComment();
   Token::Value SkipSingleLineComment();
-  Token::Value SkipSourceURLComment();
-  void TryToParseSourceURLComment();
+  Token::Value SkipMagicComment();
+  void TryToParseMagicComment();
   Token::Value SkipMultiLineComment();
   // Scans a possible HTML comment -- begins with '<!'.
   Token::Value ScanHtmlComment();
@@ -741,6 +745,7 @@ class V8_EXPORT_PRIVATE Scanner {
   // Values parsed from magic comments.
   LiteralBuffer source_url_;
   LiteralBuffer source_mapping_url_;
+  bool saw_magic_comment_compile_hints_all_ = false;
 
   // Last-seen positions of potentially problematic tokens.
   Location octal_pos_;
diff --git a/deps/v8/src/profiler/allocation-tracker.cc b/deps/v8/src/profiler/allocation-tracker.cc
index 7b155b407d63be..eac8c082aee0a1 100644
--- a/deps/v8/src/profiler/allocation-tracker.cc
+++ b/deps/v8/src/profiler/allocation-tracker.cc
@@ -76,9 +76,9 @@ AllocationTraceTree::AllocationTraceTree()
 }
 
 AllocationTraceNode* AllocationTraceTree::AddPathFromEnd(
-    const base::Vector<unsigned>& path) {
+    base::Vector<const unsigned> path) {
   AllocationTraceNode* node = root();
-  for (unsigned* entry = path.begin() + path.length() - 1;
+  for (const unsigned* entry = path.begin() + path.length() - 1;
        entry != path.begin() - 1; --entry) {
     node = node->FindOrAddChild(*entry);
   }
@@ -211,9 +211,10 @@ void AllocationTracker::AllocationEvent(Address addr, int size) {
   JavaScriptStackFrameIterator it(isolate);
   while (!it.done() && length < kMaxAllocationTraceLength) {
     JavaScriptFrame* frame = it.frame();
-    SharedFunctionInfo shared = frame->function().shared();
+    Tagged<SharedFunctionInfo> shared = frame->function()->shared();
     SnapshotObjectId id =
-        ids_->FindOrAddEntry(shared.address(), shared.Size(), false);
+        ids_->FindOrAddEntry(shared.address(), shared->Size(),
+                             HeapObjectsMap::MarkEntryAccessed::kNo);
     allocation_trace_buffer_[length++] = AddFunctionInfo(shared, id);
     it.Advance();
   }
@@ -235,25 +236,25 @@ static uint32_t SnapshotObjectIdHash(SnapshotObjectId id) {
   return ComputeUnseededHash(static_cast<uint32_t>(id));
 }
 
-unsigned AllocationTracker::AddFunctionInfo(SharedFunctionInfo shared,
+unsigned AllocationTracker::AddFunctionInfo(Tagged<SharedFunctionInfo> shared,
                                             SnapshotObjectId id) {
   base::HashMap::Entry* entry = id_to_function_info_index_.LookupOrInsert(
       reinterpret_cast<void*>(id), SnapshotObjectIdHash(id));
   if (entry->value == nullptr) {
     FunctionInfo* info = new FunctionInfo();
-    info->name = names_->GetCopy(shared.DebugNameCStr().get());
+    info->name = names_->GetCopy(shared->DebugNameCStr().get());
     info->function_id = id;
-    if (shared.script().IsScript()) {
-      Script script = Script::cast(shared.script());
-      if (script.name().IsName()) {
-        Name name = Name::cast(script.name());
+    if (IsScript(shared->script())) {
+      Tagged<Script> script = Script::cast(shared->script());
+      if (IsName(script->name())) {
+        Tagged<Name> name = Name::cast(script->name());
         info->script_name = names_->GetName(name);
       }
-      info->script_id = script.id();
+      info->script_id = script->id();
       // Converting start offset into line and column may cause heap
       // allocations so we postpone them until snapshot serialization.
       unresolved_locations_.push_back(
-          new UnresolvedLocation(script, shared.StartPosition(), info));
+          new UnresolvedLocation(script, shared->StartPosition(), info));
     }
     entry->value = reinterpret_cast<void*>(function_info_list_.size());
     function_info_list_.push_back(info);
@@ -273,11 +274,11 @@ unsigned AllocationTracker::functionInfoIndexForVMState(StateTag state) {
   return info_index_for_other_state_;
 }
 
-AllocationTracker::UnresolvedLocation::UnresolvedLocation(Script script,
+AllocationTracker::UnresolvedLocation::UnresolvedLocation(Tagged<Script> script,
                                                           int start,
                                                           FunctionInfo* info)
     : start_position_(start), info_(info) {
-  script_ = script.GetIsolate()->global_handles()->Create(script);
+  script_ = script->GetIsolate()->global_handles()->Create(script);
   GlobalHandles::MakeWeak(script_.location(), this, &HandleWeakScript,
                           v8::WeakCallbackType::kParameter);
 }
@@ -292,8 +293,10 @@ AllocationTracker::UnresolvedLocation::~UnresolvedLocation() {
 void AllocationTracker::UnresolvedLocation::Resolve() {
   if (script_.is_null()) return;
   HandleScope scope(script_->GetIsolate());
-  info_->line = Script::GetLineNumber(script_, start_position_);
-  info_->column = Script::GetColumnNumber(script_, start_position_);
+  Script::PositionInfo pos_info;
+  Script::GetPositionInfo(script_, start_position_, &pos_info);
+  info_->line = pos_info.line;
+  info_->column = pos_info.column;
 }
 
 void AllocationTracker::UnresolvedLocation::HandleWeakScript(
diff --git a/deps/v8/src/profiler/allocation-tracker.h b/deps/v8/src/profiler/allocation-tracker.h
index a33f08c0d0e47a..bb59c92a780160 100644
--- a/deps/v8/src/profiler/allocation-tracker.h
+++ b/deps/v8/src/profiler/allocation-tracker.h
@@ -62,7 +62,7 @@ class AllocationTraceTree {
   ~AllocationTraceTree() = default;
   AllocationTraceTree(const AllocationTraceTree&) = delete;
   AllocationTraceTree& operator=(const AllocationTraceTree&) = delete;
-  AllocationTraceNode* AddPathFromEnd(const base::Vector<unsigned>& path);
+  AllocationTraceNode* AddPathFromEnd(base::Vector<const unsigned> path);
   AllocationTraceNode* root() { return &root_; }
   unsigned next_node_id() { return next_node_id_++; }
   V8_EXPORT_PRIVATE void Print(AllocationTracker* tracker);
@@ -123,12 +123,13 @@ class AllocationTracker {
   AddressToTraceMap* address_to_trace() { return &address_to_trace_; }
 
  private:
-  unsigned AddFunctionInfo(SharedFunctionInfo info, SnapshotObjectId id);
+  unsigned AddFunctionInfo(Tagged<SharedFunctionInfo> info,
+                           SnapshotObjectId id);
   unsigned functionInfoIndexForVMState(StateTag state);
 
   class UnresolvedLocation {
    public:
-    UnresolvedLocation(Script script, int start, FunctionInfo* info);
+    UnresolvedLocation(Tagged<Script> script, int start, FunctionInfo* info);
     ~UnresolvedLocation();
     void Resolve();
 
diff --git a/deps/v8/src/profiler/cpu-profiler-inl.h b/deps/v8/src/profiler/cpu-profiler-inl.h
index c3c76b842d630f..78d040928205fc 100644
--- a/deps/v8/src/profiler/cpu-profiler-inl.h
+++ b/deps/v8/src/profiler/cpu-profiler-inl.h
@@ -52,11 +52,18 @@ void ReportBuiltinEventRecord::UpdateCodeMap(
     return;
   }
 #if V8_ENABLE_WEBASSEMBLY
-  if (builtin == Builtin::kGenericJSToWasmWrapper) {
+  if (builtin == Builtin::kJSToWasmWrapper) {
     // Make sure to add the generic js-to-wasm wrapper builtin, because that
     // one is supposed to show up in profiles.
     entry = instruction_stream_map->code_entries().Create(
-        LogEventListener::CodeTag::kBuiltin, Builtins::name(builtin));
+        LogEventListener::CodeTag::kBuiltin, "js-to-wasm");
+    instruction_stream_map->AddCode(instruction_start, entry, instruction_size);
+  }
+  if (builtin == Builtin::kWasmToJsWrapperCSA) {
+    // Make sure to add the generic wasm-to-js wrapper builtin, because that
+    // one is supposed to show up in profiles.
+    entry = instruction_stream_map->code_entries().Create(
+        LogEventListener::CodeTag::kBuiltin, "wasm-to-js");
     instruction_stream_map->AddCode(instruction_start, entry, instruction_size);
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
diff --git a/deps/v8/src/profiler/cpu-profiler.cc b/deps/v8/src/profiler/cpu-profiler.cc
index 5972ef6cba0a00..6bcba08f5bf319 100644
--- a/deps/v8/src/profiler/cpu-profiler.cc
+++ b/deps/v8/src/profiler/cpu-profiler.cc
@@ -129,6 +129,10 @@ SamplingEventsProcessor::SamplingEventsProcessor(
       sampler_(new CpuSampler(isolate, this)),
       period_(period),
       use_precise_sampling_(use_precise_sampling) {
+#if V8_OS_WIN
+  precise_sleep_timer_.TryInit();
+#endif  // V8_OS_WIN
+
   sampler_->Start();
 }
 
@@ -290,9 +294,13 @@ void SamplingEventsProcessor::Run() {
 #if V8_OS_WIN
       if (use_precise_sampling_ &&
           nextSampleTime - now < base::TimeDelta::FromMilliseconds(100)) {
-        // Do not use Sleep on Windows as it is very imprecise, with up to 16ms
-        // jitter, which is unacceptable for short profile intervals.
-        while (base::TimeTicks::Now() < nextSampleTime) {
+        if (precise_sleep_timer_.IsInitialized()) {
+          precise_sleep_timer_.Sleep(nextSampleTime - now);
+        } else {
+          // Do not use Sleep on Windows as it is very imprecise, with up to
+          // 16ms jitter, which is unacceptable for short profile intervals.
+          while (base::TimeTicks::Now() < nextSampleTime) {
+          }
         }
       } else  // NOLINT
 #else
@@ -415,9 +423,9 @@ void ProfilerCodeObserver::LogBuiltins() {
        ++builtin) {
     CodeEventsContainer evt_rec(CodeEventRecord::Type::kReportBuiltin);
     ReportBuiltinEventRecord* rec = &evt_rec.ReportBuiltinEventRecord_;
-    Code code = builtins->code(builtin);
-    rec->instruction_start = code.InstructionStart();
-    rec->instruction_size = code.InstructionSize();
+    Tagged<Code> code = builtins->code(builtin);
+    rec->instruction_start = code->instruction_start();
+    rec->instruction_size = code->instruction_size();
     rec->builtin = builtin;
     CodeEventHandlerInternal(evt_rec);
   }
@@ -627,7 +635,7 @@ CpuProfilingResult CpuProfiler::StartProfiling(
 }
 
 CpuProfilingResult CpuProfiler::StartProfiling(
-    String title, CpuProfilingOptions options,
+    Tagged<String> title, CpuProfilingOptions options,
     std::unique_ptr<DiscardedSamplesDelegate> delegate) {
   return StartProfiling(profiles_->GetName(title), std::move(options),
                         std::move(delegate));
@@ -685,7 +693,7 @@ CpuProfile* CpuProfiler::StopProfiling(ProfilerId id) {
   return profile;
 }
 
-CpuProfile* CpuProfiler::StopProfiling(String title) {
+CpuProfile* CpuProfiler::StopProfiling(Tagged<String> title) {
   return StopProfiling(profiles_->GetName(title));
 }
 
diff --git a/deps/v8/src/profiler/cpu-profiler.h b/deps/v8/src/profiler/cpu-profiler.h
index 5bd8fe804cb362..9a3ad6759af7e7 100644
--- a/deps/v8/src/profiler/cpu-profiler.h
+++ b/deps/v8/src/profiler/cpu-profiler.h
@@ -16,6 +16,10 @@
 #include "src/profiler/tick-sample.h"
 #include "src/utils/locked-queue.h"
 
+#if V8_OS_WIN
+#include "src/base/platform/platform-win32.h"
+#endif
+
 namespace v8 {
 namespace sampler {
 class Sampler;
@@ -254,6 +258,9 @@ class V8_EXPORT_PRIVATE SamplingEventsProcessor
   base::TimeDelta period_;           // Samples & code events processing period.
   const bool use_precise_sampling_;  // Whether or not busy-waiting is used for
                                      // low sampling intervals on Windows.
+#if V8_OS_WIN
+  base::PreciseSleepTimer precise_sleep_timer_;
+#endif  // V8_OS_WIN
 };
 
 // Builds and maintains a InstructionStreamMap tracking code objects on the VM
@@ -353,11 +360,11 @@ class V8_EXPORT_PRIVATE CpuProfiler {
       const char* title, CpuProfilingOptions options = {},
       std::unique_ptr<DiscardedSamplesDelegate> delegate = nullptr);
   CpuProfilingResult StartProfiling(
-      String title, CpuProfilingOptions options = {},
+      Tagged<String> title, CpuProfilingOptions options = {},
       std::unique_ptr<DiscardedSamplesDelegate> delegate = nullptr);
 
   CpuProfile* StopProfiling(const char* title);
-  CpuProfile* StopProfiling(String title);
+  CpuProfile* StopProfiling(Tagged<String> title);
   CpuProfile* StopProfiling(ProfilerId id);
 
   int GetProfilesCount();
diff --git a/deps/v8/src/profiler/heap-profiler.cc b/deps/v8/src/profiler/heap-profiler.cc
index 7a1317ab4f0c8f..a23e6d94d1717e 100644
--- a/deps/v8/src/profiler/heap-profiler.cc
+++ b/deps/v8/src/profiler/heap-profiler.cc
@@ -86,28 +86,33 @@ HeapSnapshot* HeapProfiler::TakeSnapshot(
   is_taking_snapshot_ = true;
   HeapSnapshot* result =
       new HeapSnapshot(this, options.snapshot_mode, options.numerics_mode);
-  {
+
+  // We need a stack marker here to allow deterministic passes over the stack.
+  // The garbage collection and the filling of references in GenerateSnapshot
+  // should scan the same part of the stack.
+  heap()->stack().SetMarkerIfNeededAndCallback([this, &options, &result]() {
     base::Optional<CppClassNamesAsHeapObjectNameScope> use_cpp_class_name;
     if (result->expose_internals() && heap()->cpp_heap())
       use_cpp_class_name.emplace(heap()->cpp_heap());
 
-    HeapSnapshotGenerator generator(
-        result, options.control, options.global_object_name_resolver, heap());
+    HeapSnapshotGenerator generator(result, options.control,
+                                    options.global_object_name_resolver, heap(),
+                                    options.stack_state);
     if (!generator.GenerateSnapshot()) {
       delete result;
       result = nullptr;
     } else {
       snapshots_.emplace_back(result);
     }
-  }
+  });
   ids_->RemoveDeadEntries();
+  if (native_move_listener_) {
+    native_move_listener_->StartListening();
+  }
   is_tracking_object_moves_ = true;
   heap()->isolate()->UpdateLogObjectRelocation();
   is_taking_snapshot_ = false;
 
-  heap()->isolate()->debug()->feature_tracker()->Track(
-      DebugFeatureTracker::kHeapSnapshot);
-
   return result;
 }
 
@@ -122,13 +127,11 @@ bool HeapProfiler::StartSamplingHeapProfiler(
   return true;
 }
 
-
 void HeapProfiler::StopSamplingHeapProfiler() {
   sampling_heap_profiler_.reset();
   MaybeClearStringsStorage();
 }
 
-
 v8::AllocationProfile* HeapProfiler::GetAllocationProfile() {
   if (sampling_heap_profiler_.get()) {
     return sampling_heap_profiler_->GetAllocationProfile();
@@ -137,17 +140,17 @@ v8::AllocationProfile* HeapProfiler::GetAllocationProfile() {
   }
 }
 
-
 void HeapProfiler::StartHeapObjectsTracking(bool track_allocations) {
   ids_->UpdateHeapObjectsMap();
+  if (native_move_listener_) {
+    native_move_listener_->StartListening();
+  }
   is_tracking_object_moves_ = true;
   heap()->isolate()->UpdateLogObjectRelocation();
   DCHECK(!allocation_tracker_);
   if (track_allocations) {
     allocation_tracker_.reset(new AllocationTracker(ids_.get(), names_.get()));
     heap()->AddHeapObjectAllocationTracker(this);
-    heap()->isolate()->debug()->feature_tracker()->Track(
-        DebugFeatureTracker::kAllocationTracking);
   }
 }
 
@@ -176,8 +179,7 @@ HeapSnapshot* HeapProfiler::GetSnapshot(int index) {
 }
 
 SnapshotObjectId HeapProfiler::GetSnapshotObjectId(Handle<Object> obj) {
-  if (!obj->IsHeapObject())
-    return v8::HeapProfiler::kUnknownObjectId;
+  if (!IsHeapObject(*obj)) return v8::HeapProfiler::kUnknownObjectId;
   return ids_->FindEntry(HeapObject::cast(*obj).address());
 }
 
@@ -192,10 +194,16 @@ SnapshotObjectId HeapProfiler::GetSnapshotObjectId(NativeObject obj) {
   return id;
 }
 
-void HeapProfiler::ObjectMoveEvent(Address from, Address to, int size) {
+void HeapProfilerNativeMoveListener::ObjectMoveEvent(Address from, Address to,
+                                                     int size) {
+  profiler_->ObjectMoveEvent(from, to, size, /*is_native_object=*/true);
+}
+
+void HeapProfiler::ObjectMoveEvent(Address from, Address to, int size,
+                                   bool is_native_object) {
   base::MutexGuard guard(&profiler_mutex_);
   bool known_object = ids_->MoveObject(from, to, size);
-  if (!known_object && allocation_tracker_) {
+  if (!known_object && allocation_tracker_ && !is_native_object) {
     allocation_tracker_->address_to_trace()->MoveObject(from, to, size);
   }
 }
@@ -207,39 +215,33 @@ void HeapProfiler::AllocationEvent(Address addr, int size) {
   }
 }
 
-
 void HeapProfiler::UpdateObjectSizeEvent(Address addr, int size) {
   ids_->UpdateObjectSize(addr, size);
 }
 
 Handle<HeapObject> HeapProfiler::FindHeapObjectById(SnapshotObjectId id) {
-  HeapObject object;
   CombinedHeapObjectIterator iterator(heap(),
                                       HeapObjectIterator::kFilterUnreachable);
-  // Make sure that object with the given id is still reachable.
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  // Make sure that the object with the given id is still reachable.
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (ids_->FindEntry(obj.address()) == id) {
-      DCHECK(object.is_null());
-      object = obj;
-      // Can't break -- kFilterUnreachable requires full heap traversal.
-    }
+    if (ids_->FindEntry(obj.address()) == id)
+      return Handle<HeapObject>(obj, isolate());
   }
-
-  return !object.is_null() ? Handle<HeapObject>(object, isolate())
-                           : Handle<HeapObject>();
+  return Handle<HeapObject>();
 }
 
-
 void HeapProfiler::ClearHeapObjectMap() {
   ids_.reset(new HeapObjectsMap(heap()));
   if (!allocation_tracker_) {
+    if (native_move_listener_) {
+      native_move_listener_->StopListening();
+    }
     is_tracking_object_moves_ = false;
     heap()->isolate()->UpdateLogObjectRelocation();
   }
 }
 
-
 Heap* HeapProfiler::heap() const { return ids_->heap(); }
 
 Isolate* HeapProfiler::isolate() const { return heap()->isolate(); }
@@ -247,45 +249,50 @@ Isolate* HeapProfiler::isolate() const { return heap()->isolate(); }
 void HeapProfiler::QueryObjects(Handle<Context> context,
                                 debug::QueryObjectPredicate* predicate,
                                 std::vector<v8::Global<v8::Object>>* objects) {
-  {
-    HandleScope handle_scope(isolate());
-    std::vector<Handle<JSTypedArray>> on_heap_typed_arrays;
-    CombinedHeapObjectIterator heap_iterator(
-        heap(), HeapObjectIterator::kFilterUnreachable);
-    for (HeapObject heap_obj = heap_iterator.Next(); !heap_obj.is_null();
-         heap_obj = heap_iterator.Next()) {
-      if (heap_obj.IsFeedbackVector()) {
-        FeedbackVector::cast(heap_obj).ClearSlots(isolate());
-      } else if (heap_obj.IsJSTypedArray() &&
-                 JSTypedArray::cast(heap_obj).is_on_heap()) {
-        // Cannot call typed_array->GetBuffer() here directly because it may
-        // trigger GC. Defer that call by collecting the object in a vector.
-        on_heap_typed_arrays.push_back(
-            handle(JSTypedArray::cast(heap_obj), isolate()));
+  // We need a stack marker here to allow deterministic passes over the stack.
+  // The garbage collection and the two object heap iterators should scan the
+  // same part of the stack.
+  heap()->stack().SetMarkerIfNeededAndCallback([this, predicate, objects]() {
+    {
+      HandleScope handle_scope(isolate());
+      std::vector<Handle<JSTypedArray>> on_heap_typed_arrays;
+      CombinedHeapObjectIterator heap_iterator(
+          heap(), HeapObjectIterator::kFilterUnreachable);
+      for (Tagged<HeapObject> heap_obj = heap_iterator.Next();
+           !heap_obj.is_null(); heap_obj = heap_iterator.Next()) {
+        if (IsFeedbackVector(heap_obj)) {
+          FeedbackVector::cast(heap_obj)->ClearSlots(isolate());
+        } else if (IsJSTypedArray(heap_obj) &&
+                   JSTypedArray::cast(heap_obj)->is_on_heap()) {
+          // Cannot call typed_array->GetBuffer() here directly because it may
+          // trigger GC. Defer that call by collecting the object in a vector.
+          on_heap_typed_arrays.push_back(
+              handle(JSTypedArray::cast(heap_obj), isolate()));
+        }
+      }
+      for (auto& typed_array : on_heap_typed_arrays) {
+        // Convert the on-heap typed array into off-heap typed array, so that
+        // its ArrayBuffer becomes valid and can be returned in the result.
+        typed_array->GetBuffer();
       }
     }
-    for (auto& typed_array : on_heap_typed_arrays) {
-      // Convert the on-heap typed array into off-heap typed array, so that
-      // its ArrayBuffer becomes valid and can be returned in the result.
-      typed_array->GetBuffer();
+    // We should return accurate information about live objects, so we need to
+    // collect all garbage first.
+    heap()->CollectAllAvailableGarbage(GarbageCollectionReason::kHeapProfiler);
+    CombinedHeapObjectIterator heap_iterator(
+        heap(), HeapObjectIterator::kFilterUnreachable);
+    PtrComprCageBase cage_base(isolate());
+    for (Tagged<HeapObject> heap_obj = heap_iterator.Next();
+         !heap_obj.is_null(); heap_obj = heap_iterator.Next()) {
+      if (!IsJSObject(heap_obj, cage_base) ||
+          IsJSExternalObject(heap_obj, cage_base))
+        continue;
+      v8::Local<v8::Object> v8_obj(
+          Utils::ToLocal(handle(JSObject::cast(heap_obj), isolate())));
+      if (!predicate->Filter(v8_obj)) continue;
+      objects->emplace_back(reinterpret_cast<v8::Isolate*>(isolate()), v8_obj);
     }
-  }
-  // We should return accurate information about live objects, so we need to
-  // collect all garbage first.
-  heap()->CollectAllAvailableGarbage(GarbageCollectionReason::kHeapProfiler);
-  CombinedHeapObjectIterator heap_iterator(
-      heap(), HeapObjectIterator::kFilterUnreachable);
-  PtrComprCageBase cage_base(isolate());
-  for (HeapObject heap_obj = heap_iterator.Next(); !heap_obj.is_null();
-       heap_obj = heap_iterator.Next()) {
-    if (!heap_obj.IsJSObject(cage_base) ||
-        heap_obj.IsJSExternalObject(cage_base))
-      continue;
-    v8::Local<v8::Object> v8_obj(
-        Utils::ToLocal(handle(JSObject::cast(heap_obj), isolate())));
-    if (!predicate->Filter(v8_obj)) continue;
-    objects->emplace_back(reinterpret_cast<v8::Isolate*>(isolate()), v8_obj);
-  }
+  });
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/profiler/heap-profiler.h b/deps/v8/src/profiler/heap-profiler.h
index 6a919dbddff24c..2756ade8141531 100644
--- a/deps/v8/src/profiler/heap-profiler.h
+++ b/deps/v8/src/profiler/heap-profiler.h
@@ -20,10 +20,37 @@ namespace internal {
 // Forward declarations.
 class AllocationTracker;
 class HeapObjectsMap;
+class HeapProfiler;
 class HeapSnapshot;
 class SamplingHeapProfiler;
 class StringsStorage;
 
+// A class which can notify the corresponding HeapProfiler when the embedder
+// heap moves its objects to different locations, so that heap snapshots can
+// generate consistent IDs for moved objects.
+class HeapProfilerNativeMoveListener {
+ public:
+  HeapProfilerNativeMoveListener(HeapProfiler* profiler)
+      : profiler_(profiler) {}
+  HeapProfilerNativeMoveListener(const HeapProfilerNativeMoveListener& other) =
+      delete;
+  HeapProfilerNativeMoveListener& operator=(
+      const HeapProfilerNativeMoveListener& other) = delete;
+
+  // The subclass's destructor implementation should stop listening.
+  virtual ~HeapProfilerNativeMoveListener() = default;
+
+  // Functionality required in concrete subclass:
+  virtual void StartListening() = 0;
+  virtual void StopListening() = 0;
+
+ protected:
+  void ObjectMoveEvent(Address from, Address to, int size);
+
+ private:
+  HeapProfiler* profiler_;
+};
+
 class HeapProfiler : public HeapObjectAllocationTracker {
  public:
   explicit HeapProfiler(Heap* heap);
@@ -58,7 +85,8 @@ class HeapProfiler : public HeapObjectAllocationTracker {
   void DeleteAllSnapshots();
   void RemoveSnapshot(HeapSnapshot* snapshot);
 
-  void ObjectMoveEvent(Address from, Address to, int size);
+  void ObjectMoveEvent(Address from, Address to, int size,
+                       bool is_native_object);
 
   void AllocationEvent(Address addr, int size) override;
 
@@ -91,6 +119,13 @@ class HeapProfiler : public HeapObjectAllocationTracker {
   void QueryObjects(Handle<Context> context,
                     debug::QueryObjectPredicate* predicate,
                     std::vector<v8::Global<v8::Object>>* objects);
+  void set_native_move_listener(
+      std::unique_ptr<HeapProfilerNativeMoveListener> listener) {
+    native_move_listener_ = std::move(listener);
+    if (is_tracking_object_moves() && native_move_listener_) {
+      native_move_listener_->StartListening();
+    }
+  }
 
  private:
   void MaybeClearStringsStorage();
@@ -110,6 +145,7 @@ class HeapProfiler : public HeapObjectAllocationTracker {
       build_embedder_graph_callbacks_;
   std::pair<v8::HeapProfiler::GetDetachednessCallback, void*>
       get_detachedness_callback_;
+  std::unique_ptr<HeapProfilerNativeMoveListener> native_move_listener_;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/profiler/heap-snapshot-generator.cc b/deps/v8/src/profiler/heap-snapshot-generator.cc
index 37d807ed8743a5..b25e59552b7066 100644
--- a/deps/v8/src/profiler/heap-snapshot-generator.cc
+++ b/deps/v8/src/profiler/heap-snapshot-generator.cc
@@ -10,6 +10,7 @@
 #include "src/base/optional.h"
 #include "src/base/vector.h"
 #include "src/codegen/assembler-inl.h"
+#include "src/common/assert-scope.h"
 #include "src/common/globals.h"
 #include "src/debug/debug.h"
 #include "src/handles/global-handles.h"
@@ -26,6 +27,7 @@
 #include "src/objects/js-array-inl.h"
 #include "src/objects/js-collection-inl.h"
 #include "src/objects/js-generator-inl.h"
+#include "src/objects/js-objects.h"
 #include "src/objects/js-promise-inl.h"
 #include "src/objects/js-regexp-inl.h"
 #include "src/objects/js-weak-refs-inl.h"
@@ -53,7 +55,7 @@ namespace internal {
 #ifdef V8_ENABLE_HEAP_SNAPSHOT_VERIFY
 class HeapEntryVerifier {
  public:
-  HeapEntryVerifier(HeapSnapshotGenerator* generator, HeapObject obj)
+  HeapEntryVerifier(HeapSnapshotGenerator* generator, Tagged<HeapObject> obj)
       : generator_(generator),
         primary_object_(obj),
         reference_summary_(
@@ -68,7 +70,8 @@ class HeapEntryVerifier {
   // Checks that `host` retains `target`, according to the marking visitor. This
   // allows us to verify, when adding edges to the snapshot, that they
   // correspond to real retaining relationships.
-  void CheckStrongReference(HeapObject host, HeapObject target) {
+  void CheckStrongReference(Tagged<HeapObject> host,
+                            Tagged<HeapObject> target) {
     // All references should be from the current primary object.
     CHECK_EQ(host, primary_object_);
 
@@ -98,7 +101,7 @@ class HeapEntryVerifier {
 
   // Checks that `host` has a weak reference to `target`, according to the
   // marking visitor.
-  void CheckWeakReference(HeapObject host, HeapObject target) {
+  void CheckWeakReference(Tagged<HeapObject> host, Tagged<HeapObject> target) {
     // All references should be from the current primary object.
     CHECK_EQ(host, primary_object_);
 
@@ -111,7 +114,8 @@ class HeapEntryVerifier {
   // marking visitor found no such relationship. This is necessary for
   // ephemerons, where a pair of objects is required to retain the target.
   // Use this function with care, since it bypasses verification.
-  void MarkReferenceCheckedWithoutChecking(HeapObject host, HeapObject target) {
+  void MarkReferenceCheckedWithoutChecking(Tagged<HeapObject> host,
+                                           Tagged<HeapObject> target) {
     if (host == primary_object_) {
       checked_objects_.insert(target);
     }
@@ -127,12 +131,12 @@ class HeapEntryVerifier {
     // snapshot deliberately omits many of those (see IsEssentialObject).
     // Read-only objects can't ever retain normal read-write objects, so these
     // are fine to skip.
-    for (HeapObject obj : reference_summary_.strong_references()) {
+    for (Tagged<HeapObject> obj : reference_summary_.strong_references()) {
       if (!BasicMemoryChunk::FromHeapObject(obj)->InReadOnlySpace()) {
         CHECK_NE(checked_objects_.find(obj), checked_objects_.end());
       }
     }
-    for (HeapObject obj : reference_summary_.weak_references()) {
+    for (Tagged<HeapObject> obj : reference_summary_.weak_references()) {
       if (!BasicMemoryChunk::FromHeapObject(obj)->InReadOnlySpace()) {
         CHECK_NE(checked_objects_.find(obj), checked_objects_.end());
       }
@@ -152,7 +156,7 @@ class HeapEntryVerifier {
       const UnorderedHeapObjectSet& previous =
           level == 0 ? reference_summary_.strong_references()
                      : indirect_strong_references_[level - 1];
-      for (HeapObject obj : previous) {
+      for (Tagged<HeapObject> obj : previous) {
         if (BasicMemoryChunk::FromHeapObject(obj)->InReadOnlySpace()) {
           // Marking visitors don't expect to visit objects in read-only space,
           // and will fail DCHECKs if they are used on those objects. Read-only
@@ -163,7 +167,7 @@ class HeapEntryVerifier {
 
         // Indirect references should only bypass internal structures, not
         // user-visible objects or contexts.
-        if (obj.IsJSReceiver() || obj.IsString() || obj.IsContext()) {
+        if (IsJSReceiver(obj) || IsString(obj) || IsContext(obj)) {
           continue;
         }
 
@@ -204,11 +208,8 @@ HeapGraphEdge::HeapGraphEdge(Type type, const char* name, HeapEntry* from,
                  FromIndexField::encode(from->index())),
       to_entry_(to),
       name_(name) {
-  DCHECK(type == kContextVariable
-      || type == kProperty
-      || type == kInternal
-      || type == kShortcut
-      || type == kWeak);
+  DCHECK(type == kContextVariable || type == kProperty || type == kInternal ||
+         type == kShortcut || type == kWeak);
 }
 
 HeapGraphEdge::HeapGraphEdge(Type type, int index, HeapEntry* from,
@@ -260,8 +261,8 @@ void HeapEntry::VerifyReference(HeapGraphEdge::Type type, HeapEntry* entry,
     // Verification is not possible.
     return;
   }
-  HeapObject from_obj = HeapObject::cast(Object(from_address));
-  HeapObject to_obj = HeapObject::cast(Object(to_address));
+  Tagged<HeapObject> from_obj = HeapObject::cast(Object(from_address));
+  Tagged<HeapObject> to_obj = HeapObject::cast(Object(to_address));
   if (BasicMemoryChunk::FromHeapObject(to_obj)->InReadOnlySpace()) {
     // We can't verify pointers into read-only space, because marking visitors
     // might not mark those. For example, every Map has a pointer to the
@@ -375,26 +376,38 @@ void HeapEntry::Print(const char* prefix, const char* edge_name, int max_depth,
 
 const char* HeapEntry::TypeAsString() const {
   switch (type()) {
-    case kHidden: return "/hidden/";
-    case kObject: return "/object/";
-    case kClosure: return "/closure/";
-    case kString: return "/string/";
-    case kCode: return "/code/";
-    case kArray: return "/array/";
-    case kRegExp: return "/regexp/";
-    case kHeapNumber: return "/number/";
-    case kNative: return "/native/";
-    case kSynthetic: return "/synthetic/";
-    case kConsString: return "/concatenated string/";
-    case kSlicedString: return "/sliced string/";
-    case kSymbol: return "/symbol/";
+    case kHidden:
+      return "/hidden/";
+    case kObject:
+      return "/object/";
+    case kClosure:
+      return "/closure/";
+    case kString:
+      return "/string/";
+    case kCode:
+      return "/code/";
+    case kArray:
+      return "/array/";
+    case kRegExp:
+      return "/regexp/";
+    case kHeapNumber:
+      return "/number/";
+    case kNative:
+      return "/native/";
+    case kSynthetic:
+      return "/synthetic/";
+    case kConsString:
+      return "/concatenated string/";
+    case kSlicedString:
+      return "/sliced string/";
+    case kSymbol:
+      return "/symbol/";
     case kBigInt:
       return "/bigint/";
     case kObjectShape:
       return "/object shape/";
-    case kWasmObject:
-      return "/wasm object/";
-    default: return "???";
+    default:
+      return "???";
   }
 }
 
@@ -417,9 +430,7 @@ HeapSnapshot::HeapSnapshot(HeapProfiler* profiler,
   memset(&gc_subroot_entries_, 0, sizeof(gc_subroot_entries_));
 }
 
-void HeapSnapshot::Delete() {
-  profiler_->RemoveSnapshot(this);
-}
+void HeapSnapshot::Delete() { profiler_->RemoveSnapshot(this); }
 
 void HeapSnapshot::RememberLastJSObjectId() {
   max_snapshot_js_object_id_ = profiler_->heap_object_map()->last_assigned_id();
@@ -462,10 +473,8 @@ void HeapSnapshot::AddLocation(HeapEntry* entry, int scriptId, int line,
   locations_.emplace_back(entry->index(), scriptId, line, col);
 }
 
-HeapEntry* HeapSnapshot::AddEntry(HeapEntry::Type type,
-                                  const char* name,
-                                  SnapshotObjectId id,
-                                  size_t size,
+HeapEntry* HeapSnapshot::AddEntry(HeapEntry::Type type, const char* name,
+                                  SnapshotObjectId id, size_t size,
                                   unsigned trace_node_id) {
   DCHECK(!is_complete());
   entries_.emplace_back(this, static_cast<int>(entries_.size()), type, name, id,
@@ -498,9 +507,7 @@ HeapEntry* HeapSnapshot::GetEntryById(SnapshotObjectId id) {
   return it != entries_by_id_cache_.end() ? it->second : nullptr;
 }
 
-void HeapSnapshot::Print(int max_depth) {
-  root()->Print("", "", max_depth, 0);
-}
+void HeapSnapshot::Print(int max_depth) { root()->Print("", "", max_depth, 0); }
 
 // We split IDs on evens for embedder objects (see
 // HeapObjectsMap::GenerateId) and odds for native objects.
@@ -512,9 +519,12 @@ const SnapshotObjectId HeapObjectsMap::kGcRootsFirstSubrootId =
 const SnapshotObjectId HeapObjectsMap::kFirstAvailableObjectId =
     HeapObjectsMap::kGcRootsFirstSubrootId +
     static_cast<int>(Root::kNumberOfRoots) * HeapObjectsMap::kObjectIdStep;
+const SnapshotObjectId HeapObjectsMap::kFirstAvailableNativeId = 2;
 
 HeapObjectsMap::HeapObjectsMap(Heap* heap)
-    : next_id_(kFirstAvailableObjectId), heap_(heap) {
+    : next_id_(kFirstAvailableObjectId),
+      next_native_id_(kFirstAvailableNativeId),
+      heap_(heap) {
   // The dummy element at zero index is needed as entries_map_ cannot hold
   // an entry with zero value. Otherwise it's impossible to tell if
   // LookupOrInsert has added a new item or just returning exisiting one
@@ -569,12 +579,10 @@ bool HeapObjectsMap::MoveObject(Address from, Address to, int object_size) {
   return from_value != nullptr;
 }
 
-
 void HeapObjectsMap::UpdateObjectSize(Address addr, int size) {
-  FindOrAddEntry(addr, size, false);
+  FindOrAddEntry(addr, size, MarkEntryAccessed::kNo);
 }
 
-
 SnapshotObjectId HeapObjectsMap::FindEntry(Address addr) {
   base::HashMap::Entry* entry = entries_map_.Lookup(
       reinterpret_cast<void*>(addr), ComputeAddressHash(addr));
@@ -585,10 +593,11 @@ SnapshotObjectId HeapObjectsMap::FindEntry(Address addr) {
   return entry_info.id;
 }
 
-
-SnapshotObjectId HeapObjectsMap::FindOrAddEntry(Address addr,
-                                                unsigned int size,
-                                                bool accessed) {
+SnapshotObjectId HeapObjectsMap::FindOrAddEntry(
+    Address addr, unsigned int size, MarkEntryAccessed accessed,
+    IsNativeObject is_native_object) {
+  bool accessed_bool = accessed == MarkEntryAccessed::kYes;
+  bool is_native_object_bool = is_native_object == IsNativeObject::kYes;
   DCHECK(static_cast<uint32_t>(entries_.size()) > entries_map_.occupancy());
   base::HashMap::Entry* entry = entries_map_.LookupOrInsert(
       reinterpret_cast<void*>(addr), ComputeAddressHash(addr));
@@ -596,17 +605,19 @@ SnapshotObjectId HeapObjectsMap::FindOrAddEntry(Address addr,
     int entry_index =
         static_cast<int>(reinterpret_cast<intptr_t>(entry->value));
     EntryInfo& entry_info = entries_.at(entry_index);
-    entry_info.accessed = accessed;
+    entry_info.accessed = accessed_bool;
     if (v8_flags.heap_profiler_trace_objects) {
       PrintF("Update object size : %p with old size %d and new size %d\n",
              reinterpret_cast<void*>(addr), entry_info.size, size);
     }
     entry_info.size = size;
+    DCHECK_EQ(is_native_object_bool, entry_info.id % 2 == 0);
     return entry_info.id;
   }
   entry->value = reinterpret_cast<void*>(entries_.size());
-  SnapshotObjectId id = get_next_id();
-  entries_.push_back(EntryInfo(id, addr, size, accessed));
+  SnapshotObjectId id =
+      is_native_object_bool ? get_next_native_id() : get_next_id();
+  entries_.push_back(EntryInfo(id, addr, size, accessed_bool));
   DCHECK(static_cast<uint32_t>(entries_.size()) > entries_map_.occupancy());
   return id;
 }
@@ -637,13 +648,13 @@ void HeapObjectsMap::UpdateHeapObjectsMap() {
     PrintF("Begin HeapObjectsMap::UpdateHeapObjectsMap. map has %d entries.\n",
            entries_map_.occupancy());
   }
-  heap_->PreciseCollectAllGarbage(Heap::kNoGCFlags,
+  heap_->PreciseCollectAllGarbage(GCFlag::kNoFlags,
                                   GarbageCollectionReason::kHeapProfiler);
   PtrComprCageBase cage_base(heap_->isolate());
   CombinedHeapObjectIterator iterator(heap_);
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    int object_size = obj.Size(cage_base);
+    int object_size = obj->Size(cage_base);
     FindOrAddEntry(obj.address(), object_size);
     if (v8_flags.heap_profiler_trace_objects) {
       PrintF("Update object      : %p %6d. Next address is %p\n",
@@ -707,7 +718,6 @@ SnapshotObjectId HeapObjectsMap::PushHeapObjectsStats(OutputStream* stream,
   return last_assigned_id();
 }
 
-
 void HeapObjectsMap::RemoveDeadEntries() {
   DCHECK(entries_.size() > 0 && entries_.at(0).id == 0 &&
          entries_.at(0).addr == kNullAddress);
@@ -772,7 +782,7 @@ HeapEntry* V8HeapExplorer::AllocateEntry(HeapThing ptr) {
   return AddEntry(HeapObject::cast(Object(reinterpret_cast<Address>(ptr))));
 }
 
-HeapEntry* V8HeapExplorer::AllocateEntry(Smi smi) {
+HeapEntry* V8HeapExplorer::AllocateEntry(Tagged<Smi> smi) {
   SnapshotObjectId id = heap_object_map_->get_next_id();
   HeapEntry* entry =
       snapshot_->AddEntry(HeapEntry::kHeapNumber, "smi number", id, 0, 0);
@@ -782,52 +792,64 @@ HeapEntry* V8HeapExplorer::AllocateEntry(Smi smi) {
   return entry;
 }
 
-void V8HeapExplorer::ExtractLocation(HeapEntry* entry, HeapObject object) {
-  if (object.IsJSFunction()) {
-    JSFunction func = JSFunction::cast(object);
-    ExtractLocationForJSFunction(entry, func);
+Tagged<JSFunction> V8HeapExplorer::GetLocationFunction(
+    Tagged<HeapObject> object) {
+  DisallowHeapAllocation no_gc;
 
-  } else if (object.IsJSGeneratorObject()) {
-    JSGeneratorObject gen = JSGeneratorObject::cast(object);
-    ExtractLocationForJSFunction(entry, gen.function());
+  if (IsJSFunction(object)) {
+    return JSFunction::cast(object);
+  } else if (IsJSGeneratorObject(object)) {
+    Tagged<JSGeneratorObject> gen = JSGeneratorObject::cast(object);
+    return gen->function();
+  } else if (IsJSObject(object)) {
+    Tagged<JSObject> obj = JSObject::cast(object);
+    Tagged<JSFunction> maybe_constructor =
+        GetConstructor(heap_->isolate(), obj);
 
-  } else if (object.IsJSObject()) {
-    JSObject obj = JSObject::cast(object);
-    JSFunction maybe_constructor = GetConstructor(heap_->isolate(), obj);
+    return maybe_constructor;
+  }
 
-    if (!maybe_constructor.is_null()) {
-      ExtractLocationForJSFunction(entry, maybe_constructor);
-    }
+  return JSFunction();
+}
+
+void V8HeapExplorer::ExtractLocation(HeapEntry* entry,
+                                     Tagged<HeapObject> object) {
+  DisallowHeapAllocation no_gc;
+  Tagged<JSFunction> func = GetLocationFunction(object);
+  if (!func.is_null()) {
+    ExtractLocationForJSFunction(entry, func);
   }
 }
 
 void V8HeapExplorer::ExtractLocationForJSFunction(HeapEntry* entry,
-                                                  JSFunction func) {
-  if (!func.shared().script().IsScript()) return;
-  Script script = Script::cast(func.shared().script());
-  int scriptId = script.id();
-  int start = func.shared().StartPosition();
+                                                  Tagged<JSFunction> func) {
+  if (!IsScript(func->shared()->script())) return;
+  Tagged<Script> script = Script::cast(func->shared()->script());
+  int scriptId = script->id();
+  int start = func->shared()->StartPosition();
+  DCHECK(script->has_line_ends());
   Script::PositionInfo info;
-  script.GetPositionInfo(start, &info, Script::WITH_OFFSET);
+  script->GetPositionInfo(start, &info);
   snapshot_->AddLocation(entry, scriptId, info.line, info.column);
 }
 
-HeapEntry* V8HeapExplorer::AddEntry(HeapObject object) {
+HeapEntry* V8HeapExplorer::AddEntry(Tagged<HeapObject> object) {
   PtrComprCageBase cage_base(isolate());
-  InstanceType instance_type = object.map(cage_base).instance_type();
+  InstanceType instance_type = object->map(cage_base)->instance_type();
   if (InstanceTypeChecker::IsJSObject(instance_type)) {
     if (InstanceTypeChecker::IsJSFunction(instance_type)) {
-      JSFunction func = JSFunction::cast(object);
-      SharedFunctionInfo shared = func.shared();
-      const char* name = names_->GetName(shared.Name());
+      Tagged<JSFunction> func = JSFunction::cast(object);
+      Tagged<SharedFunctionInfo> shared = func->shared();
+      const char* name = names_->GetName(shared->Name());
       return AddEntry(object, HeapEntry::kClosure, name);
 
     } else if (InstanceTypeChecker::IsJSBoundFunction(instance_type)) {
       return AddEntry(object, HeapEntry::kClosure, "native_bind");
     }
     if (InstanceTypeChecker::IsJSRegExp(instance_type)) {
-      JSRegExp re = JSRegExp::cast(object);
-      return AddEntry(object, HeapEntry::kRegExp, names_->GetName(re.source()));
+      Tagged<JSRegExp> re = JSRegExp::cast(object);
+      return AddEntry(object, HeapEntry::kRegExp,
+                      names_->GetName(re->source()));
     }
     // TODO(v8:12674) Fix and run full gcmole.
     DisableGCMole no_gcmole;
@@ -842,17 +864,17 @@ HeapEntry* V8HeapExplorer::AddEntry(HeapObject object) {
     return AddEntry(object, HeapEntry::kObject, name);
 
   } else if (InstanceTypeChecker::IsString(instance_type)) {
-    String string = String::cast(object);
-    if (string.IsConsString(cage_base)) {
+    Tagged<String> string = String::cast(object);
+    if (IsConsString(string, cage_base)) {
       return AddEntry(object, HeapEntry::kConsString, "(concatenated string)");
-    } else if (string.IsSlicedString(cage_base)) {
+    } else if (IsSlicedString(string, cage_base)) {
       return AddEntry(object, HeapEntry::kSlicedString, "(sliced string)");
     } else {
       return AddEntry(object, HeapEntry::kString,
                       names_->GetName(String::cast(object)));
     }
   } else if (InstanceTypeChecker::IsSymbol(instance_type)) {
-    if (Symbol::cast(object).is_private())
+    if (Symbol::cast(object)->is_private())
       return AddEntry(object, HeapEntry::kHidden, "private symbol");
     else
       return AddEntry(object, HeapEntry::kSymbol, "symbol");
@@ -865,13 +887,13 @@ HeapEntry* V8HeapExplorer::AddEntry(HeapObject object) {
     return AddEntry(object, HeapEntry::kCode, "");
 
   } else if (InstanceTypeChecker::IsSharedFunctionInfo(instance_type)) {
-    String name = SharedFunctionInfo::cast(object).Name();
+    Tagged<String> name = SharedFunctionInfo::cast(object)->Name();
     return AddEntry(object, HeapEntry::kCode, names_->GetName(name));
 
   } else if (InstanceTypeChecker::IsScript(instance_type)) {
-    Object name = Script::cast(object).name();
+    Tagged<Object> name = Script::cast(object)->name();
     return AddEntry(object, HeapEntry::kCode,
-                    name.IsString() ? names_->GetName(String::cast(name)) : "");
+                    IsString(name) ? names_->GetName(String::cast(name)) : "");
 
   } else if (InstanceTypeChecker::IsNativeContext(instance_type)) {
     return AddEntry(object, HeapEntry::kHidden, "system / NativeContext");
@@ -884,62 +906,72 @@ HeapEntry* V8HeapExplorer::AddEntry(HeapObject object) {
   }
 #if V8_ENABLE_WEBASSEMBLY
   if (InstanceTypeChecker::IsWasmObject(instance_type)) {
-    WasmTypeInfo info = object.map().wasm_type_info();
-    wasm::NamesProvider* names =
-        info.instance().module_object().native_module()->GetNamesProvider();
+    Tagged<WasmTypeInfo> info = object->map()->wasm_type_info();
+    // The cast is safe; structs and arrays always have their instance defined.
+    wasm::NamesProvider* names = WasmInstanceObject::cast(info->instance())
+                                     ->module_object()
+                                     ->native_module()
+                                     ->GetNamesProvider();
     wasm::StringBuilder sb;
-    if (InstanceTypeChecker::IsWasmStruct(instance_type)) {
-      sb << "wasm struct / ";
-    } else {
-      sb << "wasm array / ";
-    }
-    names->PrintTypeName(sb, info.type_index());
-    sb << '\0';
+    names->PrintTypeName(sb, info->type_index());
+    sb << " (wasm)" << '\0';
     const char* name = names_->GetCopy(sb.start());
-    return AddEntry(object, HeapEntry::kWasmObject, name);
+    return AddEntry(object, HeapEntry::kObject, name);
+  }
+  if (InstanceTypeChecker::IsWasmNull(instance_type)) {
+    // Inlined copies of {GetSystemEntryType}, {GetSystemEntryName}, and
+    // {AddEntry}, allowing us to override the size.
+    // The actual object's size is fairly large (at the time of this writing,
+    // just over 64 KB) and mostly includes a guard region. We report it as
+    // much smaller to avoid confusion.
+    static constexpr size_t kSize = WasmNull::kHeaderSize;
+    HeapEntry::Type type = v8_flags.heap_profiler_show_hidden_objects
+                               ? HeapEntry::kNative
+                               : HeapEntry::kHidden;
+    return AddEntry(object.address(), type, "system / WasmNull", kSize);
   }
 #endif  // V8_ENABLE_WEBASSEMBLY
   return AddEntry(object, GetSystemEntryType(object),
                   GetSystemEntryName(object));
 }
 
-HeapEntry* V8HeapExplorer::AddEntry(HeapObject object, HeapEntry::Type type,
-                                    const char* name) {
+HeapEntry* V8HeapExplorer::AddEntry(Tagged<HeapObject> object,
+                                    HeapEntry::Type type, const char* name) {
   if (v8_flags.heap_profiler_show_hidden_objects &&
       type == HeapEntry::kHidden) {
     type = HeapEntry::kNative;
   }
   PtrComprCageBase cage_base(isolate());
-  return AddEntry(object.address(), type, name, object.Size(cage_base));
+  return AddEntry(object.address(), type, name, object->Size(cage_base));
 }
 
-HeapEntry* V8HeapExplorer::AddEntry(Address address,
-                                    HeapEntry::Type type,
-                                    const char* name,
-                                    size_t size) {
+HeapEntry* V8HeapExplorer::AddEntry(Address address, HeapEntry::Type type,
+                                    const char* name, size_t size) {
   SnapshotObjectId object_id = heap_object_map_->FindOrAddEntry(
       address, static_cast<unsigned int>(size));
   unsigned trace_node_id = 0;
   if (AllocationTracker* allocation_tracker =
-      snapshot_->profiler()->allocation_tracker()) {
+          snapshot_->profiler()->allocation_tracker()) {
     trace_node_id =
         allocation_tracker->address_to_trace()->GetTraceNodeId(address);
   }
   return snapshot_->AddEntry(type, name, object_id, size, trace_node_id);
 }
 
-const char* V8HeapExplorer::GetSystemEntryName(HeapObject object) {
-  if (object.IsMap()) {
-    switch (Map::cast(object).instance_type()) {
+const char* V8HeapExplorer::GetSystemEntryName(Tagged<HeapObject> object) {
+  if (IsMap(object)) {
+    switch (Map::cast(object)->instance_type()) {
 #define MAKE_STRING_MAP_CASE(instance_type, size, name, Name) \
-        case instance_type: return "system / Map (" #Name ")";
+  case instance_type:                                         \
+    return "system / Map (" #Name ")";
       STRING_TYPE_LIST(MAKE_STRING_MAP_CASE)
 #undef MAKE_STRING_MAP_CASE
-        default: return "system / Map";
+      default:
+        return "system / Map";
     }
   }
 
-  InstanceType type = object.map().instance_type();
+  InstanceType type = object->map()->instance_type();
 
   // Empty string names are special: TagObject can overwrite them, and devtools
   // will report them as "(internal array)".
@@ -971,8 +1003,8 @@ const char* V8HeapExplorer::GetSystemEntryName(HeapObject object) {
   }
 }
 
-HeapEntry::Type V8HeapExplorer::GetSystemEntryType(HeapObject object) {
-  InstanceType type = object.map().instance_type();
+HeapEntry::Type V8HeapExplorer::GetSystemEntryType(Tagged<HeapObject> object) {
+  InstanceType type = object->map()->instance_type();
   if (InstanceTypeChecker::IsAllocationSite(type) ||
       InstanceTypeChecker::IsArrayBoilerplateDescription(type) ||
       InstanceTypeChecker::IsBytecodeArray(type) ||
@@ -981,6 +1013,7 @@ HeapEntry::Type V8HeapExplorer::GetSystemEntryType(HeapObject object) {
       InstanceTypeChecker::IsFeedbackCell(type) ||
       InstanceTypeChecker::IsFeedbackMetadata(type) ||
       InstanceTypeChecker::IsFeedbackVector(type) ||
+      InstanceTypeChecker::IsInstructionStream(type) ||
       InstanceTypeChecker::IsInterpreterData(type) ||
       InstanceTypeChecker::IsLoadHandler(type) ||
       InstanceTypeChecker::IsObjectBoilerplateDescription(type) ||
@@ -1016,6 +1049,26 @@ HeapEntry::Type V8HeapExplorer::GetSystemEntryType(HeapObject object) {
   return HeapEntry::kHidden;
 }
 
+void V8HeapExplorer::PopulateLineEnds() {
+  std::vector<Handle<Script>> scripts;
+  HandleScope scope(isolate());
+
+  {
+    Script::Iterator iterator(isolate());
+    for (Tagged<Script> script = iterator.Next(); !script.is_null();
+         script = iterator.Next()) {
+      if (!script->has_line_ends()) {
+        scripts.push_back(handle(script, isolate()));
+      }
+    }
+  }
+
+  DCHECK(AllowHeapAllocation::IsAllowed());
+  for (auto& script : scripts) {
+    Script::InitLineEnds(isolate(), script);
+  }
+}
+
 uint32_t V8HeapExplorer::EstimateObjectsCount() {
   CombinedHeapObjectIterator it(heap_, HeapObjectIterator::kFilterUnreachable);
   uint32_t objects_count = 0;
@@ -1048,24 +1101,24 @@ int AdjustEmbedderFieldIndex(HeapObject heap_obj, int field_index) {
 #endif  // V8_TARGET_BIG_ENDIAN
 class IndexedReferencesExtractor : public ObjectVisitorWithCageBases {
  public:
-  IndexedReferencesExtractor(V8HeapExplorer* generator, HeapObject parent_obj,
-                             HeapEntry* parent)
+  IndexedReferencesExtractor(V8HeapExplorer* generator,
+                             Tagged<HeapObject> parent_obj, HeapEntry* parent)
       : ObjectVisitorWithCageBases(generator->isolate()),
         generator_(generator),
         parent_obj_(parent_obj),
-        parent_start_(parent_obj_.RawMaybeWeakField(0)),
+        parent_start_(parent_obj_->RawMaybeWeakField(0)),
         parent_end_(
-            parent_obj_.RawMaybeWeakField(parent_obj_.Size(cage_base()))),
+            parent_obj_->RawMaybeWeakField(parent_obj_->Size(cage_base()))),
         parent_(parent),
         next_index_(0) {}
-  void VisitPointers(HeapObject host, ObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                      ObjectSlot end) override {
     VisitPointers(host, MaybeObjectSlot(start), MaybeObjectSlot(end));
   }
-  void VisitMapPointer(HeapObject object) override {
-    VisitSlotImpl(cage_base(), object.map_slot());
+  void VisitMapPointer(Tagged<HeapObject> object) override {
+    VisitSlotImpl(cage_base(), object->map_slot());
   }
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) override {
     // [start,end) must be a sub-region of [parent_start_, parent_end), i.e.
     // all the slots must point inside the object.
@@ -1076,25 +1129,40 @@ class IndexedReferencesExtractor : public ObjectVisitorWithCageBases {
     }
   }
 
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override {
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
     VisitSlotImpl(code_cage_base(), slot);
   }
 
-  void VisitCodeTarget(RelocInfo* rinfo) override {
-    InstructionStream target =
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* rinfo) override {
+    Tagged<InstructionStream> target =
         InstructionStream::FromTargetAddress(rinfo->target_address());
     VisitHeapObjectImpl(target, -1);
   }
 
-  void VisitEmbeddedPointer(RelocInfo* rinfo) override {
-    HeapObject object = rinfo->target_object(cage_base());
-    if (rinfo->code().IsWeakObject(object)) {
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* rinfo) override {
+    Tagged<HeapObject> object = rinfo->target_object(cage_base());
+    Tagged<Code> code = Code::unchecked_cast(host->raw_code(kAcquireLoad));
+    if (code->IsWeakObject(object)) {
       generator_->SetWeakReference(parent_, next_index_++, object, {});
     } else {
       VisitHeapObjectImpl(object, -1);
     }
   }
 
+  void VisitIndirectPointer(Tagged<HeapObject> host, IndirectPointerSlot slot,
+                            IndirectPointerMode mode) override {
+    // The JSFunction::Code field is handled separately in
+    // ExtractJSObjectReferences but here we have to mark it as visited.
+    if (IsJSFunction(host)) {
+      int field_index = JSFunction::kCodeOffset / kTaggedSize;
+      DCHECK(generator_->visited_fields_[field_index]);
+      generator_->visited_fields_[field_index] = false;
+    }
+  }
+
  private:
   template <typename TSlot>
   V8_INLINE void VisitSlotImpl(PtrComprCageBase cage_base, TSlot slot) {
@@ -1107,7 +1175,7 @@ class IndexedReferencesExtractor : public ObjectVisitorWithCageBases {
     if (generator_->visited_fields_[field_index]) {
       generator_->visited_fields_[field_index] = false;
     } else {
-      HeapObject heap_object;
+      Tagged<HeapObject> heap_object;
       auto loaded_value = slot.load(cage_base);
       if (loaded_value.GetHeapObjectIfStrong(&heap_object)) {
         VisitHeapObjectImpl(heap_object, field_index);
@@ -1117,7 +1185,8 @@ class IndexedReferencesExtractor : public ObjectVisitorWithCageBases {
     }
   }
 
-  V8_INLINE void VisitHeapObjectImpl(HeapObject heap_object, int field_index) {
+  V8_INLINE void VisitHeapObjectImpl(Tagged<HeapObject> heap_object,
+                                     int field_index) {
     DCHECK_LE(-1, field_index);
     // The last parameter {field_offset} is only used to check some well-known
     // skipped references, so passing -1 * kTaggedSize for objects embedded
@@ -1134,108 +1203,115 @@ class IndexedReferencesExtractor : public ObjectVisitorWithCageBases {
   int next_index_;
 };
 
-void V8HeapExplorer::ExtractReferences(HeapEntry* entry, HeapObject obj) {
-  if (obj.IsJSGlobalProxy()) {
+void V8HeapExplorer::ExtractReferences(HeapEntry* entry,
+                                       Tagged<HeapObject> obj) {
+  if (IsJSGlobalProxy(obj)) {
     ExtractJSGlobalProxyReferences(entry, JSGlobalProxy::cast(obj));
-  } else if (obj.IsJSArrayBuffer()) {
+  } else if (IsJSArrayBuffer(obj)) {
     ExtractJSArrayBufferReferences(entry, JSArrayBuffer::cast(obj));
-  } else if (obj.IsJSObject()) {
-    if (obj.IsJSWeakSet()) {
+  } else if (IsJSObject(obj)) {
+    if (IsJSWeakSet(obj)) {
       ExtractJSWeakCollectionReferences(entry, JSWeakSet::cast(obj));
-    } else if (obj.IsJSWeakMap()) {
+    } else if (IsJSWeakMap(obj)) {
       ExtractJSWeakCollectionReferences(entry, JSWeakMap::cast(obj));
-    } else if (obj.IsJSSet()) {
+    } else if (IsJSSet(obj)) {
       ExtractJSCollectionReferences(entry, JSSet::cast(obj));
-    } else if (obj.IsJSMap()) {
+    } else if (IsJSMap(obj)) {
       ExtractJSCollectionReferences(entry, JSMap::cast(obj));
-    } else if (obj.IsJSPromise()) {
+    } else if (IsJSPromise(obj)) {
       ExtractJSPromiseReferences(entry, JSPromise::cast(obj));
-    } else if (obj.IsJSGeneratorObject()) {
+    } else if (IsJSGeneratorObject(obj)) {
       ExtractJSGeneratorObjectReferences(entry, JSGeneratorObject::cast(obj));
-    } else if (obj.IsJSWeakRef()) {
+    } else if (IsJSWeakRef(obj)) {
       ExtractJSWeakRefReferences(entry, JSWeakRef::cast(obj));
+#if V8_ENABLE_WEBASSEMBLY
+    } else if (IsWasmInstanceObject(obj)) {
+      ExtractWasmInstanceObjectReference(WasmInstanceObject::cast(obj), entry);
+#endif  // V8_ENABLE_WEBASSEMBLY
     }
     ExtractJSObjectReferences(entry, JSObject::cast(obj));
-  } else if (obj.IsString()) {
+  } else if (IsString(obj)) {
     ExtractStringReferences(entry, String::cast(obj));
-  } else if (obj.IsSymbol()) {
+  } else if (IsSymbol(obj)) {
     ExtractSymbolReferences(entry, Symbol::cast(obj));
-  } else if (obj.IsMap()) {
+  } else if (IsMap(obj)) {
     ExtractMapReferences(entry, Map::cast(obj));
-  } else if (obj.IsSharedFunctionInfo()) {
+  } else if (IsSharedFunctionInfo(obj)) {
     ExtractSharedFunctionInfoReferences(entry, SharedFunctionInfo::cast(obj));
-  } else if (obj.IsScript()) {
+  } else if (IsScript(obj)) {
     ExtractScriptReferences(entry, Script::cast(obj));
-  } else if (obj.IsAccessorInfo()) {
+  } else if (IsAccessorInfo(obj)) {
     ExtractAccessorInfoReferences(entry, AccessorInfo::cast(obj));
-  } else if (obj.IsAccessorPair()) {
+  } else if (IsAccessorPair(obj)) {
     ExtractAccessorPairReferences(entry, AccessorPair::cast(obj));
-  } else if (obj.IsCode()) {
+  } else if (IsCode(obj)) {
     ExtractCodeReferences(entry, Code::cast(obj));
-  } else if (obj.IsCell()) {
+  } else if (IsInstructionStream(obj)) {
+    ExtractInstructionStreamReferences(entry, InstructionStream::cast(obj));
+  } else if (IsCell(obj)) {
     ExtractCellReferences(entry, Cell::cast(obj));
-  } else if (obj.IsFeedbackCell()) {
+  } else if (IsFeedbackCell(obj)) {
     ExtractFeedbackCellReferences(entry, FeedbackCell::cast(obj));
-  } else if (obj.IsPropertyCell()) {
+  } else if (IsPropertyCell(obj)) {
     ExtractPropertyCellReferences(entry, PropertyCell::cast(obj));
-  } else if (obj.IsPrototypeInfo()) {
+  } else if (IsPrototypeInfo(obj)) {
     ExtractPrototypeInfoReferences(entry, PrototypeInfo::cast(obj));
-  } else if (obj.IsAllocationSite()) {
+  } else if (IsAllocationSite(obj)) {
     ExtractAllocationSiteReferences(entry, AllocationSite::cast(obj));
-  } else if (obj.IsArrayBoilerplateDescription()) {
+  } else if (IsArrayBoilerplateDescription(obj)) {
     ExtractArrayBoilerplateDescriptionReferences(
         entry, ArrayBoilerplateDescription::cast(obj));
-  } else if (obj.IsRegExpBoilerplateDescription()) {
+  } else if (IsRegExpBoilerplateDescription(obj)) {
     ExtractRegExpBoilerplateDescriptionReferences(
         entry, RegExpBoilerplateDescription::cast(obj));
-  } else if (obj.IsFeedbackVector()) {
+  } else if (IsFeedbackVector(obj)) {
     ExtractFeedbackVectorReferences(entry, FeedbackVector::cast(obj));
-  } else if (obj.IsDescriptorArray()) {
+  } else if (IsDescriptorArray(obj)) {
     ExtractDescriptorArrayReferences(entry, DescriptorArray::cast(obj));
-  } else if (obj.IsEnumCache()) {
+  } else if (IsEnumCache(obj)) {
     ExtractEnumCacheReferences(entry, EnumCache::cast(obj));
-  } else if (obj.IsTransitionArray()) {
+  } else if (IsTransitionArray(obj)) {
     ExtractTransitionArrayReferences(entry, TransitionArray::cast(obj));
-  } else if (obj.IsWeakFixedArray()) {
+  } else if (IsWeakFixedArray(obj)) {
     ExtractWeakArrayReferences(WeakFixedArray::kHeaderSize, entry,
                                WeakFixedArray::cast(obj));
-  } else if (obj.IsWeakArrayList()) {
+  } else if (IsWeakArrayList(obj)) {
     ExtractWeakArrayReferences(WeakArrayList::kHeaderSize, entry,
                                WeakArrayList::cast(obj));
-  } else if (obj.IsContext()) {
+  } else if (IsContext(obj)) {
     ExtractContextReferences(entry, Context::cast(obj));
-  } else if (obj.IsEphemeronHashTable()) {
+  } else if (IsEphemeronHashTable(obj)) {
     ExtractEphemeronHashTableReferences(entry, EphemeronHashTable::cast(obj));
-  } else if (obj.IsFixedArray()) {
+  } else if (IsFixedArray(obj)) {
     ExtractFixedArrayReferences(entry, FixedArray::cast(obj));
-  } else if (obj.IsWeakCell()) {
+  } else if (IsWeakCell(obj)) {
     ExtractWeakCellReferences(entry, WeakCell::cast(obj));
-  } else if (obj.IsHeapNumber()) {
+  } else if (IsHeapNumber(obj)) {
     if (snapshot_->capture_numeric_value()) {
       ExtractNumberReference(entry, obj);
     }
-  } else if (obj.IsBytecodeArray()) {
+  } else if (IsBytecodeArray(obj)) {
     ExtractBytecodeArrayReferences(entry, BytecodeArray::cast(obj));
-  } else if (obj.IsScopeInfo()) {
+  } else if (IsScopeInfo(obj)) {
     ExtractScopeInfoReferences(entry, ScopeInfo::cast(obj));
 #if V8_ENABLE_WEBASSEMBLY
-  } else if (obj.IsWasmStruct()) {
+  } else if (IsWasmStruct(obj)) {
     ExtractWasmStructReferences(WasmStruct::cast(obj), entry);
-  } else if (obj.IsWasmArray()) {
+  } else if (IsWasmArray(obj)) {
     ExtractWasmArrayReferences(WasmArray::cast(obj), entry);
 #endif  // V8_ENABLE_WEBASSEMBLY
   }
 }
 
-void V8HeapExplorer::ExtractJSGlobalProxyReferences(HeapEntry* entry,
-                                                    JSGlobalProxy proxy) {
-  SetInternalReference(entry, "native_context", proxy.native_context(),
+void V8HeapExplorer::ExtractJSGlobalProxyReferences(
+    HeapEntry* entry, Tagged<JSGlobalProxy> proxy) {
+  SetInternalReference(entry, "native_context", proxy->native_context(),
                        JSGlobalProxy::kNativeContextOffset);
 }
 
 void V8HeapExplorer::ExtractJSObjectReferences(HeapEntry* entry,
-                                               JSObject js_obj) {
-  HeapObject obj = js_obj;
+                                               Tagged<JSObject> js_obj) {
+  Tagged<HeapObject> obj = js_obj;
   ExtractPropertyReferences(js_obj, entry);
   ExtractElementReferences(js_obj, entry);
   ExtractInternalReferences(js_obj, entry);
@@ -1243,121 +1319,126 @@ void V8HeapExplorer::ExtractJSObjectReferences(HeapEntry* entry,
   PrototypeIterator iter(isolate, js_obj);
   ReadOnlyRoots roots(isolate);
   SetPropertyReference(entry, roots.proto_string(), iter.GetCurrent());
-  if (obj.IsJSBoundFunction()) {
-    JSBoundFunction js_fun = JSBoundFunction::cast(obj);
-    TagObject(js_fun.bound_arguments(), "(bound arguments)");
-    SetInternalReference(entry, "bindings", js_fun.bound_arguments(),
+  if (IsJSBoundFunction(obj)) {
+    Tagged<JSBoundFunction> js_fun = JSBoundFunction::cast(obj);
+    TagObject(js_fun->bound_arguments(), "(bound arguments)");
+    SetInternalReference(entry, "bindings", js_fun->bound_arguments(),
                          JSBoundFunction::kBoundArgumentsOffset);
-    SetInternalReference(entry, "bound_this", js_fun.bound_this(),
+    SetInternalReference(entry, "bound_this", js_fun->bound_this(),
                          JSBoundFunction::kBoundThisOffset);
     SetInternalReference(entry, "bound_function",
-                         js_fun.bound_target_function(),
+                         js_fun->bound_target_function(),
                          JSBoundFunction::kBoundTargetFunctionOffset);
-    FixedArray bindings = js_fun.bound_arguments();
-    for (int i = 0; i < bindings.length(); i++) {
+    Tagged<FixedArray> bindings = js_fun->bound_arguments();
+    for (int i = 0; i < bindings->length(); i++) {
       const char* reference_name = names_->GetFormatted("bound_argument_%d", i);
-      SetNativeBindReference(entry, reference_name, bindings.get(i));
-    }
-  } else if (obj.IsJSFunction()) {
-    JSFunction js_fun = JSFunction::cast(js_obj);
-    if (js_fun.has_prototype_slot()) {
-      Object proto_or_map = js_fun.prototype_or_initial_map(kAcquireLoad);
-      if (!proto_or_map.IsTheHole(isolate)) {
-        if (!proto_or_map.IsMap()) {
+      SetNativeBindReference(entry, reference_name, bindings->get(i));
+    }
+  } else if (IsJSFunction(obj)) {
+    Tagged<JSFunction> js_fun = JSFunction::cast(js_obj);
+    if (js_fun->has_prototype_slot()) {
+      Tagged<Object> proto_or_map =
+          js_fun->prototype_or_initial_map(kAcquireLoad);
+      if (!IsTheHole(proto_or_map, isolate)) {
+        if (!IsMap(proto_or_map)) {
           SetPropertyReference(entry, roots.prototype_string(), proto_or_map,
                                nullptr,
                                JSFunction::kPrototypeOrInitialMapOffset);
         } else {
           SetPropertyReference(entry, roots.prototype_string(),
-                               js_fun.prototype());
+                               js_fun->prototype());
           SetInternalReference(entry, "initial_map", proto_or_map,
                                JSFunction::kPrototypeOrInitialMapOffset);
         }
       }
     }
-    SharedFunctionInfo shared_info = js_fun.shared();
-    TagObject(js_fun.raw_feedback_cell(), "(function feedback cell)");
-    SetInternalReference(entry, "feedback_cell", js_fun.raw_feedback_cell(),
+    Tagged<SharedFunctionInfo> shared_info = js_fun->shared();
+    TagObject(js_fun->raw_feedback_cell(), "(function feedback cell)");
+    SetInternalReference(entry, "feedback_cell", js_fun->raw_feedback_cell(),
                          JSFunction::kFeedbackCellOffset);
     TagObject(shared_info, "(shared function info)");
     SetInternalReference(entry, "shared", shared_info,
                          JSFunction::kSharedFunctionInfoOffset);
-    TagObject(js_fun.context(), "(context)");
-    SetInternalReference(entry, "context", js_fun.context(),
+    TagObject(js_fun->context(), "(context)");
+    SetInternalReference(entry, "context", js_fun->context(),
                          JSFunction::kContextOffset);
-    SetInternalReference(entry, "code", js_fun.code(), JSFunction::kCodeOffset);
-  } else if (obj.IsJSGlobalObject()) {
-    JSGlobalObject global_obj = JSGlobalObject::cast(obj);
-    SetInternalReference(entry, "native_context", global_obj.native_context(),
+    SetInternalReference(entry, "code", js_fun->code(),
+                         JSFunction::kCodeOffset);
+  } else if (IsJSGlobalObject(obj)) {
+    Tagged<JSGlobalObject> global_obj = JSGlobalObject::cast(obj);
+    SetInternalReference(entry, "native_context", global_obj->native_context(),
                          JSGlobalObject::kNativeContextOffset);
-    SetInternalReference(entry, "global_proxy", global_obj.global_proxy(),
+    SetInternalReference(entry, "global_proxy", global_obj->global_proxy(),
                          JSGlobalObject::kGlobalProxyOffset);
     static_assert(JSGlobalObject::kHeaderSize - JSObject::kHeaderSize ==
                   2 * kTaggedSize);
-  } else if (obj.IsJSArrayBufferView()) {
-    JSArrayBufferView view = JSArrayBufferView::cast(obj);
-    SetInternalReference(entry, "buffer", view.buffer(),
+  } else if (IsJSArrayBufferView(obj)) {
+    Tagged<JSArrayBufferView> view = JSArrayBufferView::cast(obj);
+    SetInternalReference(entry, "buffer", view->buffer(),
                          JSArrayBufferView::kBufferOffset);
   }
 
-  TagObject(js_obj.raw_properties_or_hash(), "(object properties)");
-  SetInternalReference(entry, "properties", js_obj.raw_properties_or_hash(),
+  TagObject(js_obj->raw_properties_or_hash(), "(object properties)");
+  SetInternalReference(entry, "properties", js_obj->raw_properties_or_hash(),
                        JSObject::kPropertiesOrHashOffset);
 
-  TagObject(js_obj.elements(), "(object elements)");
-  SetInternalReference(entry, "elements", js_obj.elements(),
+  TagObject(js_obj->elements(), "(object elements)");
+  SetInternalReference(entry, "elements", js_obj->elements(),
                        JSObject::kElementsOffset);
 }
 
-void V8HeapExplorer::ExtractStringReferences(HeapEntry* entry, String string) {
-  if (string.IsConsString()) {
-    ConsString cs = ConsString::cast(string);
-    SetInternalReference(entry, "first", cs.first(), ConsString::kFirstOffset);
-    SetInternalReference(entry, "second", cs.second(),
+void V8HeapExplorer::ExtractStringReferences(HeapEntry* entry,
+                                             Tagged<String> string) {
+  if (IsConsString(string)) {
+    Tagged<ConsString> cs = ConsString::cast(string);
+    SetInternalReference(entry, "first", cs->first(), ConsString::kFirstOffset);
+    SetInternalReference(entry, "second", cs->second(),
                          ConsString::kSecondOffset);
-  } else if (string.IsSlicedString()) {
-    SlicedString ss = SlicedString::cast(string);
-    SetInternalReference(entry, "parent", ss.parent(),
+  } else if (IsSlicedString(string)) {
+    Tagged<SlicedString> ss = SlicedString::cast(string);
+    SetInternalReference(entry, "parent", ss->parent(),
                          SlicedString::kParentOffset);
-  } else if (string.IsThinString()) {
-    ThinString ts = ThinString::cast(string);
-    SetInternalReference(entry, "actual", ts.actual(),
+  } else if (IsThinString(string)) {
+    Tagged<ThinString> ts = ThinString::cast(string);
+    SetInternalReference(entry, "actual", ts->actual(),
                          ThinString::kActualOffset);
   }
 }
 
-void V8HeapExplorer::ExtractSymbolReferences(HeapEntry* entry, Symbol symbol) {
-  SetInternalReference(entry, "name", symbol.description(),
+void V8HeapExplorer::ExtractSymbolReferences(HeapEntry* entry,
+                                             Tagged<Symbol> symbol) {
+  SetInternalReference(entry, "name", symbol->description(),
                        Symbol::kDescriptionOffset);
 }
 
-void V8HeapExplorer::ExtractJSCollectionReferences(HeapEntry* entry,
-                                                   JSCollection collection) {
-  SetInternalReference(entry, "table", collection.table(),
+void V8HeapExplorer::ExtractJSCollectionReferences(
+    HeapEntry* entry, Tagged<JSCollection> collection) {
+  SetInternalReference(entry, "table", collection->table(),
                        JSCollection::kTableOffset);
 }
 
-void V8HeapExplorer::ExtractJSWeakCollectionReferences(HeapEntry* entry,
-                                                       JSWeakCollection obj) {
-  SetInternalReference(entry, "table", obj.table(),
+void V8HeapExplorer::ExtractJSWeakCollectionReferences(
+    HeapEntry* entry, Tagged<JSWeakCollection> obj) {
+  SetInternalReference(entry, "table", obj->table(),
                        JSWeakCollection::kTableOffset);
 }
 
 void V8HeapExplorer::ExtractEphemeronHashTableReferences(
-    HeapEntry* entry, EphemeronHashTable table) {
-  for (InternalIndex i : table.IterateEntries()) {
+    HeapEntry* entry, Tagged<EphemeronHashTable> table) {
+  for (InternalIndex i : table->IterateEntries()) {
     int key_index = EphemeronHashTable::EntryToIndex(i) +
                     EphemeronHashTable::kEntryKeyIndex;
     int value_index = EphemeronHashTable::EntryToValueIndex(i);
-    Object key = table.get(key_index);
-    Object value = table.get(value_index);
-    SetWeakReference(entry, key_index, key, table.OffsetOfElementAt(key_index));
+    Tagged<Object> key = table->get(key_index);
+    Tagged<Object> value = table->get(value_index);
+    SetWeakReference(entry, key_index, key,
+                     table->OffsetOfElementAt(key_index));
     SetWeakReference(entry, value_index, value,
-                     table.OffsetOfElementAt(value_index));
+                     table->OffsetOfElementAt(value_index));
     HeapEntry* key_entry = GetEntry(key);
     HeapEntry* value_entry = GetEntry(value);
     HeapEntry* table_entry = GetEntry(table);
-    if (key_entry && value_entry && !key.IsUndefined()) {
+    if (key_entry && value_entry && !IsUndefined(key)) {
       const char* edge_name = names_->GetFormatted(
           "part of key (%s @%u) -> value (%s @%u) pair in WeakMap (table @%u)",
           key_entry->name(), key_entry->id(), value_entry->name(),
@@ -1385,44 +1466,44 @@ static const struct {
 };
 
 void V8HeapExplorer::ExtractContextReferences(HeapEntry* entry,
-                                              Context context) {
+                                              Tagged<Context> context) {
   DisallowGarbageCollection no_gc;
-  if (!context.IsNativeContext() && context.is_declaration_context()) {
-    ScopeInfo scope_info = context.scope_info();
+  if (!IsNativeContext(context) && context->is_declaration_context()) {
+    Tagged<ScopeInfo> scope_info = context->scope_info();
     // Add context allocated locals.
-    for (auto it : ScopeInfo::IterateLocalNames(&scope_info, no_gc)) {
-      int idx = scope_info.ContextHeaderLength() + it->index();
-      SetContextReference(entry, it->name(), context.get(idx),
+    for (auto it : ScopeInfo::IterateLocalNames(scope_info, no_gc)) {
+      int idx = scope_info->ContextHeaderLength() + it->index();
+      SetContextReference(entry, it->name(), context->get(idx),
                           Context::OffsetOfElementAt(idx));
     }
-    if (scope_info.HasContextAllocatedFunctionName()) {
-      String name = String::cast(scope_info.FunctionName());
-      int idx = scope_info.FunctionContextSlotIndex(name);
+    if (scope_info->HasContextAllocatedFunctionName()) {
+      Tagged<String> name = String::cast(scope_info->FunctionName());
+      int idx = scope_info->FunctionContextSlotIndex(name);
       if (idx >= 0) {
-        SetContextReference(entry, name, context.get(idx),
+        SetContextReference(entry, name, context->get(idx),
                             Context::OffsetOfElementAt(idx));
       }
     }
   }
 
   SetInternalReference(
-      entry, "scope_info", context.get(Context::SCOPE_INFO_INDEX),
+      entry, "scope_info", context->get(Context::SCOPE_INFO_INDEX),
       FixedArray::OffsetOfElementAt(Context::SCOPE_INFO_INDEX));
-  SetInternalReference(entry, "previous", context.get(Context::PREVIOUS_INDEX),
+  SetInternalReference(entry, "previous", context->get(Context::PREVIOUS_INDEX),
                        FixedArray::OffsetOfElementAt(Context::PREVIOUS_INDEX));
-  if (context.has_extension()) {
+  if (context->has_extension()) {
     SetInternalReference(
-        entry, "extension", context.get(Context::EXTENSION_INDEX),
+        entry, "extension", context->get(Context::EXTENSION_INDEX),
         FixedArray::OffsetOfElementAt(Context::EXTENSION_INDEX));
   }
 
-  if (context.IsNativeContext()) {
-    TagObject(context.normalized_map_cache(), "(context norm. map cache)");
-    TagObject(context.embedder_data(), "(context data)");
+  if (IsNativeContext(context)) {
+    TagObject(context->normalized_map_cache(), "(context norm. map cache)");
+    TagObject(context->embedder_data(), "(context data)");
     for (size_t i = 0; i < arraysize(native_context_names); i++) {
       int index = native_context_names[i].index;
       const char* name = native_context_names[i].name;
-      SetInternalReference(entry, name, context.get(index),
+      SetInternalReference(entry, name, context->get(index),
                            FixedArray::OffsetOfElementAt(index));
     }
 
@@ -1432,56 +1513,57 @@ void V8HeapExplorer::ExtractContextReferences(HeapEntry* entry,
   }
 }
 
-void V8HeapExplorer::ExtractMapReferences(HeapEntry* entry, Map map) {
-  MaybeObject maybe_raw_transitions_or_prototype_info = map.raw_transitions();
-  HeapObject raw_transitions_or_prototype_info;
-  if (maybe_raw_transitions_or_prototype_info->GetHeapObjectIfWeak(
+void V8HeapExplorer::ExtractMapReferences(HeapEntry* entry, Tagged<Map> map) {
+  MaybeObject maybe_raw_transitions_or_prototype_info = map->raw_transitions();
+  Tagged<HeapObject> raw_transitions_or_prototype_info;
+  if (maybe_raw_transitions_or_prototype_info.GetHeapObjectIfWeak(
           &raw_transitions_or_prototype_info)) {
-    DCHECK(raw_transitions_or_prototype_info.IsMap());
+    DCHECK(IsMap(raw_transitions_or_prototype_info));
     SetWeakReference(entry, "transition", raw_transitions_or_prototype_info,
                      Map::kTransitionsOrPrototypeInfoOffset);
-  } else if (maybe_raw_transitions_or_prototype_info->GetHeapObjectIfStrong(
+  } else if (maybe_raw_transitions_or_prototype_info.GetHeapObjectIfStrong(
                  &raw_transitions_or_prototype_info)) {
-    if (raw_transitions_or_prototype_info.IsTransitionArray()) {
-      TransitionArray transitions =
+    if (IsTransitionArray(raw_transitions_or_prototype_info)) {
+      Tagged<TransitionArray> transitions =
           TransitionArray::cast(raw_transitions_or_prototype_info);
-      if (map.CanTransition() && transitions.HasPrototypeTransitions()) {
-        TagObject(transitions.GetPrototypeTransitions(),
+      if (map->CanTransition() && transitions->HasPrototypeTransitions()) {
+        TagObject(transitions->GetPrototypeTransitions(),
                   "(prototype transitions)");
       }
       TagObject(transitions, "(transition array)");
       SetInternalReference(entry, "transitions", transitions,
                            Map::kTransitionsOrPrototypeInfoOffset);
-    } else if (raw_transitions_or_prototype_info.IsFixedArray()) {
+    } else if (IsFixedArray(raw_transitions_or_prototype_info)) {
       TagObject(raw_transitions_or_prototype_info, "(transition)");
       SetInternalReference(entry, "transition",
                            raw_transitions_or_prototype_info,
                            Map::kTransitionsOrPrototypeInfoOffset);
-    } else if (map.is_prototype_map()) {
+    } else if (map->is_prototype_map()) {
       TagObject(raw_transitions_or_prototype_info, "prototype_info");
       SetInternalReference(entry, "prototype_info",
                            raw_transitions_or_prototype_info,
                            Map::kTransitionsOrPrototypeInfoOffset);
     }
   }
-  DescriptorArray descriptors = map.instance_descriptors();
+  Tagged<DescriptorArray> descriptors = map->instance_descriptors();
   TagObject(descriptors, "(map descriptors)");
   SetInternalReference(entry, "descriptors", descriptors,
                        Map::kInstanceDescriptorsOffset);
-  SetInternalReference(entry, "prototype", map.prototype(),
+  SetInternalReference(entry, "prototype", map->prototype(),
                        Map::kPrototypeOffset);
-  if (map.IsContextMap()) {
-    Object native_context = map.native_context();
+  if (IsContextMap(map)) {
+    Tagged<Object> native_context = map->native_context();
     TagObject(native_context, "(native context)");
     SetInternalReference(entry, "native_context", native_context,
                          Map::kConstructorOrBackPointerOrNativeContextOffset);
   } else {
-    Object constructor_or_back_pointer = map.constructor_or_back_pointer();
-    if (constructor_or_back_pointer.IsMap()) {
+    Tagged<Object> constructor_or_back_pointer =
+        map->constructor_or_back_pointer();
+    if (IsMap(constructor_or_back_pointer)) {
       TagObject(constructor_or_back_pointer, "(back pointer)");
       SetInternalReference(entry, "back_pointer", constructor_or_back_pointer,
                            Map::kConstructorOrBackPointerOrNativeContextOffset);
-    } else if (constructor_or_back_pointer.IsFunctionTemplateInfo()) {
+    } else if (IsFunctionTemplateInfo(constructor_or_back_pointer)) {
       TagObject(constructor_or_back_pointer, "(constructor function data)");
       SetInternalReference(entry, "constructor_function_data",
                            constructor_or_back_pointer,
@@ -1491,200 +1573,221 @@ void V8HeapExplorer::ExtractMapReferences(HeapEntry* entry, Map map) {
                            Map::kConstructorOrBackPointerOrNativeContextOffset);
     }
   }
-  TagObject(map.dependent_code(), "(dependent code)");
-  SetInternalReference(entry, "dependent_code", map.dependent_code(),
+  TagObject(map->dependent_code(), "(dependent code)");
+  SetInternalReference(entry, "dependent_code", map->dependent_code(),
                        Map::kDependentCodeOffset);
-  TagObject(map.prototype_validity_cell(kRelaxedLoad),
+  TagObject(map->prototype_validity_cell(kRelaxedLoad),
             "(prototype validity cell)", HeapEntry::kObjectShape);
 }
 
 void V8HeapExplorer::ExtractSharedFunctionInfoReferences(
-    HeapEntry* entry, SharedFunctionInfo shared) {
-  std::unique_ptr<char[]> name = shared.DebugNameCStr();
-  Code code = shared.GetCode(isolate());
-  HeapObject maybe_code_obj =
-      code.has_instruction_stream() ? FromCode(code) : HeapObject::cast(code);
-  if (name[0] != '\0') {
-    TagObject(maybe_code_obj,
-              names_->GetFormatted("(code for %s)", name.get()));
-  } else {
-    TagObject(maybe_code_obj,
-              names_->GetFormatted("(%s code)", CodeKindToString(code.kind())));
-  }
-
-  Object name_or_scope_info = shared.name_or_scope_info(kAcquireLoad);
-  if (name_or_scope_info.IsScopeInfo()) {
+    HeapEntry* entry, Tagged<SharedFunctionInfo> shared) {
+  TagObject(shared, "(shared function info)");
+  {
+    std::unique_ptr<char[]> name = shared->DebugNameCStr();
+    Tagged<Code> code = shared->GetCode(isolate());
+    TagObject(code, name[0] != '\0'
+                        ? names_->GetFormatted("(code for %s)", name.get())
+                        : names_->GetFormatted("(%s code)",
+                                               CodeKindToString(code->kind())));
+    if (code->has_instruction_stream()) {
+      TagObject(
+          code->instruction_stream(),
+          name[0] != '\0'
+              ? names_->GetFormatted("(instruction stream for %s)", name.get())
+              : names_->GetFormatted("(%s instruction stream)",
+                                     CodeKindToString(code->kind())));
+    }
+  }
+
+  Tagged<Object> name_or_scope_info = shared->name_or_scope_info(kAcquireLoad);
+  if (IsScopeInfo(name_or_scope_info)) {
     TagObject(name_or_scope_info, "(function scope info)");
   }
   SetInternalReference(entry, "name_or_scope_info", name_or_scope_info,
                        SharedFunctionInfo::kNameOrScopeInfoOffset);
-  SetInternalReference(entry, "script_or_debug_info",
-                       shared.script_or_debug_info(kAcquireLoad),
-                       SharedFunctionInfo::kScriptOrDebugInfoOffset);
+  SetInternalReference(entry, "script", shared->script(kAcquireLoad),
+                       SharedFunctionInfo::kScriptOffset);
   SetInternalReference(entry, "function_data",
-                       shared.function_data(kAcquireLoad),
+                       shared->function_data(kAcquireLoad),
                        SharedFunctionInfo::kFunctionDataOffset);
   SetInternalReference(
       entry, "raw_outer_scope_info_or_feedback_metadata",
-      shared.raw_outer_scope_info_or_feedback_metadata(),
+      shared->raw_outer_scope_info_or_feedback_metadata(),
       SharedFunctionInfo::kOuterScopeInfoOrFeedbackMetadataOffset);
 }
 
-void V8HeapExplorer::ExtractScriptReferences(HeapEntry* entry, Script script) {
-  SetInternalReference(entry, "source", script.source(), Script::kSourceOffset);
-  SetInternalReference(entry, "name", script.name(), Script::kNameOffset);
-  SetInternalReference(entry, "context_data", script.context_data(),
+void V8HeapExplorer::ExtractScriptReferences(HeapEntry* entry,
+                                             Tagged<Script> script) {
+  SetInternalReference(entry, "source", script->source(),
+                       Script::kSourceOffset);
+  SetInternalReference(entry, "name", script->name(), Script::kNameOffset);
+  SetInternalReference(entry, "context_data", script->context_data(),
                        Script::kContextDataOffset);
-  TagObject(script.line_ends(), "(script line ends)", HeapEntry::kCode);
-  SetInternalReference(entry, "line_ends", script.line_ends(),
+  TagObject(script->line_ends(), "(script line ends)", HeapEntry::kCode);
+  SetInternalReference(entry, "line_ends", script->line_ends(),
                        Script::kLineEndsOffset);
-  TagObject(script.shared_function_infos(), "(shared function infos)",
+  TagObject(script->shared_function_infos(), "(shared function infos)",
             HeapEntry::kCode);
-  TagObject(script.host_defined_options(), "(host-defined options)",
+  TagObject(script->host_defined_options(), "(host-defined options)",
             HeapEntry::kCode);
 }
 
-void V8HeapExplorer::ExtractAccessorInfoReferences(HeapEntry* entry,
-                                                   AccessorInfo accessor_info) {
-  SetInternalReference(entry, "name", accessor_info.name(),
+void V8HeapExplorer::ExtractAccessorInfoReferences(
+    HeapEntry* entry, Tagged<AccessorInfo> accessor_info) {
+  SetInternalReference(entry, "name", accessor_info->name(),
                        AccessorInfo::kNameOffset);
-  SetInternalReference(entry, "data", accessor_info.data(),
+  SetInternalReference(entry, "data", accessor_info->data(),
                        AccessorInfo::kDataOffset);
 }
 
-void V8HeapExplorer::ExtractAccessorPairReferences(HeapEntry* entry,
-                                                   AccessorPair accessors) {
-  SetInternalReference(entry, "getter", accessors.getter(),
+void V8HeapExplorer::ExtractAccessorPairReferences(
+    HeapEntry* entry, Tagged<AccessorPair> accessors) {
+  SetInternalReference(entry, "getter", accessors->getter(),
                        AccessorPair::kGetterOffset);
-  SetInternalReference(entry, "setter", accessors.setter(),
+  SetInternalReference(entry, "setter", accessors->setter(),
                        AccessorPair::kSetterOffset);
 }
 
 void V8HeapExplorer::ExtractJSWeakRefReferences(HeapEntry* entry,
-                                                JSWeakRef js_weak_ref) {
-  SetWeakReference(entry, "target", js_weak_ref.target(),
+                                                Tagged<JSWeakRef> js_weak_ref) {
+  SetWeakReference(entry, "target", js_weak_ref->target(),
                    JSWeakRef::kTargetOffset);
 }
 
 void V8HeapExplorer::ExtractWeakCellReferences(HeapEntry* entry,
-                                               WeakCell weak_cell) {
-  SetWeakReference(entry, "target", weak_cell.target(),
+                                               Tagged<WeakCell> weak_cell) {
+  SetWeakReference(entry, "target", weak_cell->target(),
                    WeakCell::kTargetOffset);
-  SetWeakReference(entry, "unregister_token", weak_cell.unregister_token(),
+  SetWeakReference(entry, "unregister_token", weak_cell->unregister_token(),
                    WeakCell::kUnregisterTokenOffset);
 }
 
-void V8HeapExplorer::TagBuiltinCodeObject(Code code, const char* name) {
-  TagObject(code, names_->GetFormatted("(%s builtin handle)", name));
-  if (code.has_instruction_stream()) {
-    TagObject(FromCode(code), names_->GetFormatted("(%s builtin)", name));
+void V8HeapExplorer::TagBuiltinCodeObject(Tagged<Code> code, const char* name) {
+  TagObject(code, names_->GetFormatted("(%s builtin code)", name));
+  if (code->has_instruction_stream()) {
+    TagObject(code->instruction_stream(),
+              names_->GetFormatted("(%s builtin instruction stream)", name));
   }
 }
 
-void V8HeapExplorer::ExtractCodeReferences(HeapEntry* entry, Code code) {
-  if (!code.has_instruction_stream()) return;
+void V8HeapExplorer::ExtractCodeReferences(HeapEntry* entry,
+                                           Tagged<Code> code) {
+  if (!code->has_instruction_stream()) return;
 
-  TagObject(code.relocation_info(), "(code relocation info)", HeapEntry::kCode);
-  SetInternalReference(entry, "relocation_info", code.relocation_info(),
-                       Code::kRelocationInfoOffset);
+  SetInternalReference(entry, "instruction_stream", code->instruction_stream(),
+                       Code::kInstructionStreamOffset);
 
-  if (code.kind() == CodeKind::BASELINE) {
-    TagObject(code.bytecode_or_interpreter_data(), "(interpreter data)");
+  if (code->kind() == CodeKind::BASELINE) {
+    TagObject(code->bytecode_or_interpreter_data(), "(interpreter data)");
     SetInternalReference(entry, "interpreter_data",
-                         code.bytecode_or_interpreter_data(),
+                         code->bytecode_or_interpreter_data(),
                          Code::kDeoptimizationDataOrInterpreterDataOffset);
-    TagObject(code.bytecode_offset_table(), "(bytecode offset table)",
+    TagObject(code->bytecode_offset_table(), "(bytecode offset table)",
               HeapEntry::kCode);
     SetInternalReference(entry, "bytecode_offset_table",
-                         code.bytecode_offset_table(),
+                         code->bytecode_offset_table(),
                          Code::kPositionTableOffset);
   } else {
-    DeoptimizationData deoptimization_data =
-        DeoptimizationData::cast(code.deoptimization_data());
+    Tagged<DeoptimizationData> deoptimization_data =
+        DeoptimizationData::cast(code->deoptimization_data());
     TagObject(deoptimization_data, "(code deopt data)", HeapEntry::kCode);
     SetInternalReference(entry, "deoptimization_data", deoptimization_data,
                          Code::kDeoptimizationDataOrInterpreterDataOffset);
-    if (deoptimization_data.length() > 0) {
-      TagObject(deoptimization_data.TranslationByteArray(), "(code deopt data)",
+    if (deoptimization_data->length() > 0) {
+      TagObject(deoptimization_data->FrameTranslation(), "(code deopt data)",
                 HeapEntry::kCode);
-      TagObject(deoptimization_data.LiteralArray(), "(code deopt data)",
+      TagObject(deoptimization_data->LiteralArray(), "(code deopt data)",
                 HeapEntry::kCode);
-      TagObject(deoptimization_data.InliningPositions(), "(code deopt data)",
+      TagObject(deoptimization_data->InliningPositions(), "(code deopt data)",
                 HeapEntry::kCode);
     }
-    TagObject(code.source_position_table(), "(source position table)",
+    TagObject(code->source_position_table(), "(source position table)",
               HeapEntry::kCode);
     SetInternalReference(entry, "source_position_table",
-                         code.source_position_table(),
+                         code->source_position_table(),
                          Code::kPositionTableOffset);
   }
 }
 
-void V8HeapExplorer::ExtractCellReferences(HeapEntry* entry, Cell cell) {
-  SetInternalReference(entry, "value", cell.value(), Cell::kValueOffset);
+void V8HeapExplorer::ExtractInstructionStreamReferences(
+    HeapEntry* entry, Tagged<InstructionStream> istream) {
+  Tagged<Code> code;
+  if (!istream->TryGetCode(&code, kAcquireLoad))
+    return;  // Not yet initialized.
+  TagObject(code, "(code)", HeapEntry::kCode);
+  SetInternalReference(entry, "code", code, InstructionStream::kCodeOffset);
+
+  TagObject(istream->relocation_info(), "(code relocation info)",
+            HeapEntry::kCode);
+  SetInternalReference(entry, "relocation_info", istream->relocation_info(),
+                       InstructionStream::kRelocationInfoOffset);
 }
 
-void V8HeapExplorer::ExtractFeedbackCellReferences(HeapEntry* entry,
-                                                   FeedbackCell feedback_cell) {
+void V8HeapExplorer::ExtractCellReferences(HeapEntry* entry,
+                                           Tagged<Cell> cell) {
+  SetInternalReference(entry, "value", cell->value(), Cell::kValueOffset);
+}
+
+void V8HeapExplorer::ExtractFeedbackCellReferences(
+    HeapEntry* entry, Tagged<FeedbackCell> feedback_cell) {
   TagObject(feedback_cell, "(feedback cell)");
-  SetInternalReference(entry, "value", feedback_cell.value(),
+  SetInternalReference(entry, "value", feedback_cell->value(),
                        FeedbackCell::kValueOffset);
 }
 
 void V8HeapExplorer::ExtractPropertyCellReferences(HeapEntry* entry,
-                                                   PropertyCell cell) {
-  SetInternalReference(entry, "value", cell.value(),
+                                                   Tagged<PropertyCell> cell) {
+  SetInternalReference(entry, "value", cell->value(),
                        PropertyCell::kValueOffset);
-  TagObject(cell.dependent_code(), "(dependent code)");
-  SetInternalReference(entry, "dependent_code", cell.dependent_code(),
+  TagObject(cell->dependent_code(), "(dependent code)");
+  SetInternalReference(entry, "dependent_code", cell->dependent_code(),
                        PropertyCell::kDependentCodeOffset);
 }
 
-void V8HeapExplorer::ExtractPrototypeInfoReferences(HeapEntry* entry,
-                                                    PrototypeInfo info) {
-  TagObject(info.prototype_chain_enum_cache(), "(prototype chain enum cache)",
+void V8HeapExplorer::ExtractPrototypeInfoReferences(
+    HeapEntry* entry, Tagged<PrototypeInfo> info) {
+  TagObject(info->prototype_chain_enum_cache(), "(prototype chain enum cache)",
             HeapEntry::kObjectShape);
-  TagObject(info.prototype_users(), "(prototype users)",
+  TagObject(info->prototype_users(), "(prototype users)",
             HeapEntry::kObjectShape);
 }
 
-void V8HeapExplorer::ExtractAllocationSiteReferences(HeapEntry* entry,
-                                                     AllocationSite site) {
+void V8HeapExplorer::ExtractAllocationSiteReferences(
+    HeapEntry* entry, Tagged<AllocationSite> site) {
   SetInternalReference(entry, "transition_info",
-                       site.transition_info_or_boilerplate(),
+                       site->transition_info_or_boilerplate(),
                        AllocationSite::kTransitionInfoOrBoilerplateOffset);
-  SetInternalReference(entry, "nested_site", site.nested_site(),
+  SetInternalReference(entry, "nested_site", site->nested_site(),
                        AllocationSite::kNestedSiteOffset);
-  TagObject(site.dependent_code(), "(dependent code)", HeapEntry::kCode);
-  SetInternalReference(entry, "dependent_code", site.dependent_code(),
+  TagObject(site->dependent_code(), "(dependent code)", HeapEntry::kCode);
+  SetInternalReference(entry, "dependent_code", site->dependent_code(),
                        AllocationSite::kDependentCodeOffset);
 }
 
 void V8HeapExplorer::ExtractArrayBoilerplateDescriptionReferences(
-    HeapEntry* entry, ArrayBoilerplateDescription value) {
-  FixedArrayBase constant_elements = value.constant_elements();
+    HeapEntry* entry, Tagged<ArrayBoilerplateDescription> value) {
+  Tagged<FixedArrayBase> constant_elements = value->constant_elements();
   SetInternalReference(entry, "constant_elements", constant_elements,
                        ArrayBoilerplateDescription::kConstantElementsOffset);
   TagObject(constant_elements, "(constant elements)", HeapEntry::kCode);
 }
 
 void V8HeapExplorer::ExtractRegExpBoilerplateDescriptionReferences(
-    HeapEntry* entry, RegExpBoilerplateDescription value) {
-  TagObject(value.data(), "(RegExp data)", HeapEntry::kCode);
+    HeapEntry* entry, Tagged<RegExpBoilerplateDescription> value) {
+  TagObject(value->data(), "(RegExp data)", HeapEntry::kCode);
 }
 
 class JSArrayBufferDataEntryAllocator : public HeapEntriesAllocator {
  public:
   JSArrayBufferDataEntryAllocator(size_t size, V8HeapExplorer* explorer)
-      : size_(size)
-      , explorer_(explorer) {
-  }
+      : size_(size), explorer_(explorer) {}
   HeapEntry* AllocateEntry(HeapThing ptr) override {
     return explorer_->AddEntry(reinterpret_cast<Address>(ptr),
                                HeapEntry::kNative, "system / JSArrayBufferData",
                                size_);
   }
-  HeapEntry* AllocateEntry(Smi smi) override {
+  HeapEntry* AllocateEntry(Tagged<Smi> smi) override {
     DCHECK(false);
     return nullptr;
   }
@@ -1694,59 +1797,60 @@ class JSArrayBufferDataEntryAllocator : public HeapEntriesAllocator {
   V8HeapExplorer* explorer_;
 };
 
-void V8HeapExplorer::ExtractJSArrayBufferReferences(HeapEntry* entry,
-                                                    JSArrayBuffer buffer) {
+void V8HeapExplorer::ExtractJSArrayBufferReferences(
+    HeapEntry* entry, Tagged<JSArrayBuffer> buffer) {
   // Setup a reference to a native memory backing_store object.
-  if (!buffer.backing_store()) return;
-  size_t data_size = buffer.byte_length();
+  if (!buffer->backing_store()) return;
+  size_t data_size = buffer->byte_length();
   JSArrayBufferDataEntryAllocator allocator(data_size, this);
   HeapEntry* data_entry =
-      generator_->FindOrAddEntry(buffer.backing_store(), &allocator);
+      generator_->FindOrAddEntry(buffer->backing_store(), &allocator);
   entry->SetNamedReference(HeapGraphEdge::kInternal, "backing_store",
                            data_entry, generator_, HeapEntry::kOffHeapPointer);
 }
 
 void V8HeapExplorer::ExtractJSPromiseReferences(HeapEntry* entry,
-                                                JSPromise promise) {
+                                                Tagged<JSPromise> promise) {
   SetInternalReference(entry, "reactions_or_result",
-                       promise.reactions_or_result(),
+                       promise->reactions_or_result(),
                        JSPromise::kReactionsOrResultOffset);
 }
 
 void V8HeapExplorer::ExtractJSGeneratorObjectReferences(
-    HeapEntry* entry, JSGeneratorObject generator) {
-  SetInternalReference(entry, "function", generator.function(),
+    HeapEntry* entry, Tagged<JSGeneratorObject> generator) {
+  SetInternalReference(entry, "function", generator->function(),
                        JSGeneratorObject::kFunctionOffset);
-  SetInternalReference(entry, "context", generator.context(),
+  SetInternalReference(entry, "context", generator->context(),
                        JSGeneratorObject::kContextOffset);
-  SetInternalReference(entry, "receiver", generator.receiver(),
+  SetInternalReference(entry, "receiver", generator->receiver(),
                        JSGeneratorObject::kReceiverOffset);
   SetInternalReference(entry, "parameters_and_registers",
-                       generator.parameters_and_registers(),
+                       generator->parameters_and_registers(),
                        JSGeneratorObject::kParametersAndRegistersOffset);
 }
 
 void V8HeapExplorer::ExtractFixedArrayReferences(HeapEntry* entry,
-                                                 FixedArray array) {
-  for (int i = 0, l = array.length(); i < l; ++i) {
-    DCHECK(!HasWeakHeapObjectTag(array.get(i)));
-    SetInternalReference(entry, i, array.get(i), array.OffsetOfElementAt(i));
+                                                 Tagged<FixedArray> array) {
+  for (int i = 0, l = array->length(); i < l; ++i) {
+    DCHECK(!HasWeakHeapObjectTag(array->get(i)));
+    SetInternalReference(entry, i, array->get(i), array->OffsetOfElementAt(i));
   }
 }
 
-void V8HeapExplorer::ExtractNumberReference(HeapEntry* entry, Object number) {
-  DCHECK(number.IsNumber());
+void V8HeapExplorer::ExtractNumberReference(HeapEntry* entry,
+                                            Tagged<Object> number) {
+  DCHECK(IsNumber(number));
 
   // Must be large enough to fit any double, int, or size_t.
   char arr[32];
   base::Vector<char> buffer(arr, arraysize(arr));
 
   const char* string;
-  if (number.IsSmi()) {
+  if (IsSmi(number)) {
     int int_value = Smi::ToInt(number);
     string = IntToCString(int_value, buffer);
   } else {
-    double double_value = HeapNumber::cast(number).value();
+    double double_value = HeapNumber::cast(number)->value();
     string = DoubleToCString(double_value, buffer);
   }
 
@@ -1759,98 +1863,100 @@ void V8HeapExplorer::ExtractNumberReference(HeapEntry* entry, Object number) {
                            generator_);
 }
 
-void V8HeapExplorer::ExtractBytecodeArrayReferences(HeapEntry* entry,
-                                                    BytecodeArray bytecode) {
-  RecursivelyTagConstantPool(bytecode.constant_pool(), "(constant pool)",
+void V8HeapExplorer::ExtractBytecodeArrayReferences(
+    HeapEntry* entry, Tagged<BytecodeArray> bytecode) {
+  RecursivelyTagConstantPool(bytecode->constant_pool(), "(constant pool)",
                              HeapEntry::kCode, 3);
-  TagObject(bytecode.handler_table(), "(handler table)", HeapEntry::kCode);
-  TagObject(bytecode.source_position_table(kAcquireLoad),
+  TagObject(bytecode->handler_table(), "(handler table)", HeapEntry::kCode);
+  TagObject(bytecode->source_position_table(kAcquireLoad),
             "(source position table)", HeapEntry::kCode);
 }
 
 void V8HeapExplorer::ExtractScopeInfoReferences(HeapEntry* entry,
-                                                ScopeInfo info) {
-  if (!info.HasInlinedLocalNames()) {
-    TagObject(info.context_local_names_hashtable(), "(context local names)",
+                                                Tagged<ScopeInfo> info) {
+  if (!info->HasInlinedLocalNames()) {
+    TagObject(info->context_local_names_hashtable(), "(context local names)",
               HeapEntry::kCode);
   }
 }
 
 void V8HeapExplorer::ExtractFeedbackVectorReferences(
-    HeapEntry* entry, FeedbackVector feedback_vector) {
-  MaybeObject code = feedback_vector.maybe_optimized_code();
-  HeapObject code_heap_object;
-  if (code->GetHeapObjectIfWeak(&code_heap_object)) {
+    HeapEntry* entry, Tagged<FeedbackVector> feedback_vector) {
+  MaybeObject code = feedback_vector->maybe_optimized_code();
+  Tagged<HeapObject> code_heap_object;
+  if (code.GetHeapObjectIfWeak(&code_heap_object)) {
     SetWeakReference(entry, "optimized code", code_heap_object,
                      FeedbackVector::kMaybeOptimizedCodeOffset);
   }
-  for (int i = 0; i < feedback_vector.length(); ++i) {
-    MaybeObject maybe_entry = *(feedback_vector.slots_start() + i);
-    HeapObject entry;
+  for (int i = 0; i < feedback_vector->length(); ++i) {
+    MaybeObject maybe_entry = *(feedback_vector->slots_start() + i);
+    Tagged<HeapObject> entry;
     if (maybe_entry.GetHeapObjectIfStrong(&entry) &&
-        (entry.map(isolate()).instance_type() == WEAK_FIXED_ARRAY_TYPE ||
-         entry.IsFixedArrayExact())) {
+        (entry->map(isolate())->instance_type() == WEAK_FIXED_ARRAY_TYPE ||
+         IsFixedArrayExact(entry))) {
       TagObject(entry, "(feedback)", HeapEntry::kCode);
     }
   }
 }
 
-void V8HeapExplorer::ExtractDescriptorArrayReferences(HeapEntry* entry,
-                                                      DescriptorArray array) {
-  SetInternalReference(entry, "enum_cache", array.enum_cache(),
+void V8HeapExplorer::ExtractDescriptorArrayReferences(
+    HeapEntry* entry, Tagged<DescriptorArray> array) {
+  SetInternalReference(entry, "enum_cache", array->enum_cache(),
                        DescriptorArray::kEnumCacheOffset);
-  MaybeObjectSlot start = MaybeObjectSlot(array.GetDescriptorSlot(0));
+  MaybeObjectSlot start = MaybeObjectSlot(array->GetDescriptorSlot(0));
   MaybeObjectSlot end = MaybeObjectSlot(
-      array.GetDescriptorSlot(array.number_of_all_descriptors()));
+      array->GetDescriptorSlot(array->number_of_all_descriptors()));
   for (int i = 0; start + i < end; ++i) {
     MaybeObjectSlot slot = start + i;
     int offset = static_cast<int>(slot.address() - array.address());
     MaybeObject object = *slot;
-    HeapObject heap_object;
-    if (object->GetHeapObjectIfWeak(&heap_object)) {
+    Tagged<HeapObject> heap_object;
+    if (object.GetHeapObjectIfWeak(&heap_object)) {
       SetWeakReference(entry, i, heap_object, offset);
-    } else if (object->GetHeapObjectIfStrong(&heap_object)) {
+    } else if (object.GetHeapObjectIfStrong(&heap_object)) {
       SetInternalReference(entry, i, heap_object, offset);
     }
   }
 }
 
 void V8HeapExplorer::ExtractEnumCacheReferences(HeapEntry* entry,
-                                                EnumCache cache) {
-  TagObject(cache.keys(), "(enum cache)", HeapEntry::kObjectShape);
-  TagObject(cache.indices(), "(enum cache)", HeapEntry::kObjectShape);
+                                                Tagged<EnumCache> cache) {
+  TagObject(cache->keys(), "(enum cache)", HeapEntry::kObjectShape);
+  TagObject(cache->indices(), "(enum cache)", HeapEntry::kObjectShape);
 }
 
 void V8HeapExplorer::ExtractTransitionArrayReferences(
-    HeapEntry* entry, TransitionArray transitions) {
-  if (transitions.HasPrototypeTransitions()) {
-    TagObject(transitions.GetPrototypeTransitions(), "(prototype transitions)",
+    HeapEntry* entry, Tagged<TransitionArray> transitions) {
+  if (transitions->HasPrototypeTransitions()) {
+    TagObject(transitions->GetPrototypeTransitions(), "(prototype transitions)",
               HeapEntry::kObjectShape);
   }
 }
 
 template <typename T>
 void V8HeapExplorer::ExtractWeakArrayReferences(int header_size,
-                                                HeapEntry* entry, T array) {
-  for (int i = 0; i < array.length(); ++i) {
-    MaybeObject object = array.Get(i);
-    HeapObject heap_object;
-    if (object->GetHeapObjectIfWeak(&heap_object)) {
+                                                HeapEntry* entry,
+                                                Tagged<T> array) {
+  for (int i = 0; i < array->length(); ++i) {
+    MaybeObject object = array->Get(i);
+    Tagged<HeapObject> heap_object;
+    if (object.GetHeapObjectIfWeak(&heap_object)) {
       SetWeakReference(entry, i, heap_object, header_size + i * kTaggedSize);
-    } else if (object->GetHeapObjectIfStrong(&heap_object)) {
+    } else if (object.GetHeapObjectIfStrong(&heap_object)) {
       SetInternalReference(entry, i, heap_object,
                            header_size + i * kTaggedSize);
     }
   }
 }
 
-void V8HeapExplorer::ExtractPropertyReferences(JSObject js_obj,
+void V8HeapExplorer::ExtractPropertyReferences(Tagged<JSObject> js_obj,
                                                HeapEntry* entry) {
-  Isolate* isolate = js_obj.GetIsolate();
-  if (js_obj.HasFastProperties()) {
-    DescriptorArray descs = js_obj.map().instance_descriptors(isolate);
-    for (InternalIndex i : js_obj.map().IterateOwnDescriptors()) {
-      PropertyDetails details = descs.GetDetails(i);
+  Isolate* isolate = js_obj->GetIsolate();
+  if (js_obj->HasFastProperties()) {
+    Tagged<DescriptorArray> descs =
+        js_obj->map()->instance_descriptors(isolate);
+    for (InternalIndex i : js_obj->map()->IterateOwnDescriptors()) {
+      PropertyDetails details = descs->GetDetails(i);
       switch (details.location()) {
         case PropertyLocation::kField: {
           if (!snapshot_->capture_numeric_value()) {
@@ -1858,10 +1964,10 @@ void V8HeapExplorer::ExtractPropertyReferences(JSObject js_obj,
             if (r.IsSmi() || r.IsDouble()) break;
           }
 
-          Name k = descs.GetKey(i);
+          Tagged<Name> k = descs->GetKey(i);
           FieldIndex field_index =
-              FieldIndex::ForDetails(js_obj.map(), details);
-          Object value = js_obj.RawFastPropertyAt(field_index);
+              FieldIndex::ForDetails(js_obj->map(), details);
+          Tagged<Object> value = js_obj->RawFastPropertyAt(field_index);
           int field_offset =
               field_index.is_inobject() ? field_index.offset() : -1;
 
@@ -1870,22 +1976,23 @@ void V8HeapExplorer::ExtractPropertyReferences(JSObject js_obj,
           break;
         }
         case PropertyLocation::kDescriptor:
-          SetDataOrAccessorPropertyReference(
-              details.kind(), entry, descs.GetKey(i), descs.GetStrongValue(i));
+          SetDataOrAccessorPropertyReference(details.kind(), entry,
+                                             descs->GetKey(i),
+                                             descs->GetStrongValue(i));
           break;
       }
     }
-  } else if (js_obj.IsJSGlobalObject()) {
+  } else if (IsJSGlobalObject(js_obj)) {
     // We assume that global objects can only have slow properties.
-    GlobalDictionary dictionary =
-        JSGlobalObject::cast(js_obj).global_dictionary(kAcquireLoad);
+    Tagged<GlobalDictionary> dictionary =
+        JSGlobalObject::cast(js_obj)->global_dictionary(kAcquireLoad);
     ReadOnlyRoots roots(isolate);
-    for (InternalIndex i : dictionary.IterateEntries()) {
-      if (!dictionary.IsKey(roots, dictionary.KeyAt(i))) continue;
-      PropertyCell cell = dictionary.CellAt(i);
-      Name name = cell.name();
-      Object value = cell.value();
-      PropertyDetails details = cell.property_details();
+    for (InternalIndex i : dictionary->IterateEntries()) {
+      if (!dictionary->IsKey(roots, dictionary->KeyAt(i))) continue;
+      Tagged<PropertyCell> cell = dictionary->CellAt(i);
+      Tagged<Name> name = cell->name();
+      Tagged<Object> value = cell->value();
+      PropertyDetails details = cell->property_details();
       SetDataOrAccessorPropertyReference(details.kind(), entry, name, value);
     }
   } else if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -1893,114 +2000,131 @@ void V8HeapExplorer::ExtractPropertyReferences(JSObject js_obj,
     // leak out of here.
     HandleScope scope(isolate);
 
-    SwissNameDictionary dictionary = js_obj.property_dictionary_swiss();
+    Tagged<SwissNameDictionary> dictionary =
+        js_obj->property_dictionary_swiss();
     ReadOnlyRoots roots(isolate);
-    for (InternalIndex i : dictionary.IterateEntries()) {
-      Object k = dictionary.KeyAt(i);
-      if (!dictionary.IsKey(roots, k)) continue;
-      Object value = dictionary.ValueAt(i);
-      PropertyDetails details = dictionary.DetailsAt(i);
+    for (InternalIndex i : dictionary->IterateEntries()) {
+      Tagged<Object> k = dictionary->KeyAt(i);
+      if (!dictionary->IsKey(roots, k)) continue;
+      Tagged<Object> value = dictionary->ValueAt(i);
+      PropertyDetails details = dictionary->DetailsAt(i);
       SetDataOrAccessorPropertyReference(details.kind(), entry, Name::cast(k),
                                          value);
     }
   } else {
-    NameDictionary dictionary = js_obj.property_dictionary();
+    Tagged<NameDictionary> dictionary = js_obj->property_dictionary();
     ReadOnlyRoots roots(isolate);
-    for (InternalIndex i : dictionary.IterateEntries()) {
-      Object k = dictionary.KeyAt(i);
-      if (!dictionary.IsKey(roots, k)) continue;
-      Object value = dictionary.ValueAt(i);
-      PropertyDetails details = dictionary.DetailsAt(i);
+    for (InternalIndex i : dictionary->IterateEntries()) {
+      Tagged<Object> k = dictionary->KeyAt(i);
+      if (!dictionary->IsKey(roots, k)) continue;
+      Tagged<Object> value = dictionary->ValueAt(i);
+      PropertyDetails details = dictionary->DetailsAt(i);
       SetDataOrAccessorPropertyReference(details.kind(), entry, Name::cast(k),
                                          value);
     }
   }
 }
 
-void V8HeapExplorer::ExtractAccessorPairProperty(HeapEntry* entry, Name key,
-                                                 Object callback_obj,
+void V8HeapExplorer::ExtractAccessorPairProperty(HeapEntry* entry,
+                                                 Tagged<Name> key,
+                                                 Tagged<Object> callback_obj,
                                                  int field_offset) {
-  if (!callback_obj.IsAccessorPair()) return;
-  AccessorPair accessors = AccessorPair::cast(callback_obj);
+  if (!IsAccessorPair(callback_obj)) return;
+  Tagged<AccessorPair> accessors = AccessorPair::cast(callback_obj);
   SetPropertyReference(entry, key, accessors, nullptr, field_offset);
-  Object getter = accessors.getter();
-  if (!getter.IsOddball()) {
+  Tagged<Object> getter = accessors->getter();
+  if (!IsOddball(getter)) {
     SetPropertyReference(entry, key, getter, "get %s");
   }
-  Object setter = accessors.setter();
-  if (!setter.IsOddball()) {
+  Tagged<Object> setter = accessors->setter();
+  if (!IsOddball(setter)) {
     SetPropertyReference(entry, key, setter, "set %s");
   }
 }
 
-void V8HeapExplorer::ExtractElementReferences(JSObject js_obj,
+void V8HeapExplorer::ExtractElementReferences(Tagged<JSObject> js_obj,
                                               HeapEntry* entry) {
-  ReadOnlyRoots roots = js_obj.GetReadOnlyRoots();
-  if (js_obj.HasObjectElements()) {
-    FixedArray elements = FixedArray::cast(js_obj.elements());
-    int length = js_obj.IsJSArray() ? Smi::ToInt(JSArray::cast(js_obj).length())
-                                    : elements.length();
+  ReadOnlyRoots roots = js_obj->GetReadOnlyRoots();
+  if (js_obj->HasObjectElements()) {
+    Tagged<FixedArray> elements = FixedArray::cast(js_obj->elements());
+    int length = IsJSArray(js_obj) ? Smi::ToInt(JSArray::cast(js_obj)->length())
+                                   : elements->length();
     for (int i = 0; i < length; ++i) {
-      if (!elements.get(i).IsTheHole(roots)) {
-        SetElementReference(entry, i, elements.get(i));
+      if (!IsTheHole(elements->get(i), roots)) {
+        SetElementReference(entry, i, elements->get(i));
       }
     }
-  } else if (js_obj.HasDictionaryElements()) {
-    NumberDictionary dictionary = js_obj.element_dictionary();
-    for (InternalIndex i : dictionary.IterateEntries()) {
-      Object k = dictionary.KeyAt(i);
-      if (!dictionary.IsKey(roots, k)) continue;
-      DCHECK(k.IsNumber());
-      uint32_t index = static_cast<uint32_t>(k.Number());
-      SetElementReference(entry, index, dictionary.ValueAt(i));
+  } else if (js_obj->HasDictionaryElements()) {
+    Tagged<NumberDictionary> dictionary = js_obj->element_dictionary();
+    for (InternalIndex i : dictionary->IterateEntries()) {
+      Tagged<Object> k = dictionary->KeyAt(i);
+      if (!dictionary->IsKey(roots, k)) continue;
+      DCHECK(IsNumber(k));
+      uint32_t index = static_cast<uint32_t>(Object::Number(k));
+      SetElementReference(entry, index, dictionary->ValueAt(i));
     }
   }
 }
 
-void V8HeapExplorer::ExtractInternalReferences(JSObject js_obj,
+void V8HeapExplorer::ExtractInternalReferences(Tagged<JSObject> js_obj,
                                                HeapEntry* entry) {
-  int length = js_obj.GetEmbedderFieldCount();
+  int length = js_obj->GetEmbedderFieldCount();
   for (int i = 0; i < length; ++i) {
-    Object o = js_obj.GetEmbedderField(i);
-    SetInternalReference(entry, i, o, js_obj.GetEmbedderFieldOffset(i));
+    Tagged<Object> o = js_obj->GetEmbedderField(i);
+    SetInternalReference(entry, i, o, js_obj->GetEmbedderFieldOffset(i));
   }
 }
 
 #if V8_ENABLE_WEBASSEMBLY
 
-void V8HeapExplorer::ExtractWasmStructReferences(WasmStruct obj,
+void V8HeapExplorer::ExtractWasmStructReferences(Tagged<WasmStruct> obj,
                                                  HeapEntry* entry) {
-  wasm::StructType* type = obj.type();
-  WasmTypeInfo info = obj.map().wasm_type_info();
-  wasm::NamesProvider* names =
-      info.instance().module_object().native_module()->GetNamesProvider();
+  wasm::StructType* type = obj->type();
+  Tagged<WasmTypeInfo> info = obj->map()->wasm_type_info();
+  // The cast is safe; structs always have their instance defined.
+  wasm::NamesProvider* names = WasmInstanceObject::cast(info->instance())
+                                   ->module_object()
+                                   ->native_module()
+                                   ->GetNamesProvider();
   for (uint32_t i = 0; i < type->field_count(); i++) {
     if (!type->field(i).is_reference()) continue;
     wasm::StringBuilder sb;
-    names->PrintFieldName(sb, info.type_index(), i);
+    names->PrintFieldName(sb, info->type_index(), i);
     sb << '\0';
     const char* field_name = names_->GetCopy(sb.start());
     int field_offset = type->field_offset(i);
-    Object value = obj.RawField(field_offset).load(entry->isolate());
+    Tagged<Object> value = obj->RawField(field_offset).load(entry->isolate());
     HeapEntry* value_entry = GetEntry(value);
     entry->SetNamedReference(HeapGraphEdge::kProperty, field_name, value_entry,
                              generator_);
     MarkVisitedField(WasmStruct::kHeaderSize + field_offset);
   }
 }
-void V8HeapExplorer::ExtractWasmArrayReferences(WasmArray obj,
+
+void V8HeapExplorer::ExtractWasmArrayReferences(Tagged<WasmArray> obj,
                                                 HeapEntry* entry) {
-  if (!obj.type()->element_type().is_reference()) return;
-  for (uint32_t i = 0; i < obj.length(); i++) {
-    SetElementReference(entry, i, obj.ElementSlot(i).load(entry->isolate()));
-    MarkVisitedField(obj.element_offset(i));
+  if (!obj->type()->element_type().is_reference()) return;
+  for (uint32_t i = 0; i < obj->length(); i++) {
+    SetElementReference(entry, i, obj->ElementSlot(i).load(entry->isolate()));
+    MarkVisitedField(obj->element_offset(i));
+  }
+}
+
+void V8HeapExplorer::ExtractWasmInstanceObjectReference(
+    Tagged<WasmInstanceObject> obj, HeapEntry* entry) {
+  PtrComprCageBase cage_base(heap_->isolate());
+  for (size_t i = 0; i < WasmInstanceObject::kTaggedFieldOffsets.size(); i++) {
+    const uint16_t offset = WasmInstanceObject::kTaggedFieldOffsets[i];
+    SetInternalReference(entry, WasmInstanceObject::kTaggedFieldNames[i],
+                         TaggedField<Object>::load(cage_base, obj, offset),
+                         offset);
   }
 }
 
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-JSFunction V8HeapExplorer::GetConstructor(Isolate* isolate,
-                                          JSReceiver receiver) {
+Tagged<JSFunction> V8HeapExplorer::GetConstructor(Isolate* isolate,
+                                                  Tagged<JSReceiver> receiver) {
   DisallowGarbageCollection no_gc;
   HandleScope scope(isolate);
   MaybeHandle<JSFunction> maybe_constructor =
@@ -2011,19 +2135,20 @@ JSFunction V8HeapExplorer::GetConstructor(Isolate* isolate,
   return *maybe_constructor.ToHandleChecked();
 }
 
-String V8HeapExplorer::GetConstructorName(Isolate* isolate, JSObject object) {
-  if (object.IsJSFunction()) return ReadOnlyRoots(isolate).closure_string();
+Tagged<String> V8HeapExplorer::GetConstructorName(Isolate* isolate,
+                                                  Tagged<JSObject> object) {
+  if (IsJSFunction(object)) return ReadOnlyRoots(isolate).closure_string();
   DisallowGarbageCollection no_gc;
   HandleScope scope(isolate);
   return *JSReceiver::GetConstructorName(isolate, handle(object, isolate));
 }
 
-HeapEntry* V8HeapExplorer::GetEntry(Object obj) {
-  if (obj.IsHeapObject()) {
+HeapEntry* V8HeapExplorer::GetEntry(Tagged<Object> obj) {
+  if (IsHeapObject(obj)) {
     return generator_->FindOrAddEntry(reinterpret_cast<void*>(obj.ptr()), this);
   }
 
-  DCHECK(obj.IsSmi());
+  DCHECK(IsSmi(obj));
   if (!snapshot_->capture_numeric_value()) {
     return nullptr;
   }
@@ -2069,10 +2194,10 @@ class RootsReferencesExtractor : public RootVisitor {
   // MarkCompactCollector::RootMarkingVisitor::VisitRunningCode.
   void VisitRunningCode(FullObjectSlot code_slot,
                         FullObjectSlot istream_or_smi_zero_slot) final {
-    Object istream_or_smi_zero = *istream_or_smi_zero_slot;
+    Tagged<Object> istream_or_smi_zero = *istream_or_smi_zero_slot;
     if (istream_or_smi_zero != Smi::zero()) {
-      Code code = Code::cast(*code_slot);
-      code.IterateDeoptimizationLiterals(this);
+      Tagged<Code> code = Code::cast(*code_slot);
+      code->IterateDeoptimizationLiterals(this);
       VisitRootPointer(Root::kStackRoots, nullptr, istream_or_smi_zero_slot);
     }
     VisitRootPointer(Root::kStackRoots, nullptr, code_slot);
@@ -2098,7 +2223,9 @@ bool V8HeapExplorer::IterateAndExtractReferences(
   // its custom name to a generic builtin.
   RootsReferencesExtractor extractor(this);
   ReadOnlyRoots(heap_).Iterate(&extractor);
-  heap_->IterateRoots(&extractor, base::EnumSet<SkipRoot>{SkipRoot::kWeak});
+  heap_->IterateRoots(
+      &extractor,
+      base::EnumSet<SkipRoot>{SkipRoot::kWeak, SkipRoot::kTracedHandles});
   // TODO(v8:11800): The heap snapshot generator incorrectly considers the weak
   // string tables as strong retainers. Move IterateWeakRoots after
   // SetVisitingWeakRoots.
@@ -2108,15 +2235,15 @@ bool V8HeapExplorer::IterateAndExtractReferences(
 
   bool interrupted = false;
 
-  CombinedHeapObjectIterator iterator(heap_,
-                                      HeapObjectIterator::kFilterUnreachable);
+  CombinedHeapObjectIterator iterator(heap_);
   PtrComprCageBase cage_base(heap_->isolate());
-  // Heap iteration with filtering must be finished in any case.
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  // Heap iteration need not be finished but progress reporting may depend on
+  // it being finished.
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next(), progress_->ProgressStep()) {
     if (interrupted) continue;
 
-    size_t max_pointer = obj.Size(cage_base) / kTaggedSize;
+    size_t max_pointer = obj->Size(cage_base) / kTaggedSize;
     if (max_pointer > visited_fields_.size()) {
       // Clear the current bits.
       std::vector<bool>().swap(visited_fields_);
@@ -2138,12 +2265,12 @@ bool V8HeapExplorer::IterateAndExtractReferences(
 
     HeapEntry* entry = GetEntry(obj);
     ExtractReferences(entry, obj);
-    SetInternalReference(entry, "map", obj.map(cage_base),
+    SetInternalReference(entry, "map", obj->map(cage_base),
                          HeapObject::kMapOffset);
     // Extract unvisited fields as hidden references and restore tags
     // of visited fields.
     IndexedReferencesExtractor refs_extractor(this, obj, entry);
-    obj.Iterate(cage_base, &refs_extractor);
+    obj->Iterate(cage_base, &refs_extractor);
 
     // Ensure visited_fields_ doesn't leak to the next object.
     for (size_t i = 0; i < max_pointer; ++i) {
@@ -2160,8 +2287,8 @@ bool V8HeapExplorer::IterateAndExtractReferences(
   return interrupted ? false : progress_->ProgressReport(true);
 }
 
-bool V8HeapExplorer::IsEssentialObject(Object object) {
-  if (!object.IsHeapObject()) return false;
+bool V8HeapExplorer::IsEssentialObject(Tagged<Object> object) {
+  if (!IsHeapObject(object)) return false;
   // Avoid comparing InstructionStream objects with non-InstructionStream
   // objects below.
   if (IsCodeSpaceObject(HeapObject::cast(object))) {
@@ -2169,7 +2296,8 @@ bool V8HeapExplorer::IsEssentialObject(Object object) {
   }
   Isolate* isolate = heap_->isolate();
   ReadOnlyRoots roots(isolate);
-  return !object.IsOddball(isolate) && object != roots.empty_byte_array() &&
+  return !IsOddball(object, isolate) && object != roots.the_hole_value() &&
+         object != roots.empty_byte_array() &&
          object != roots.empty_fixed_array() &&
          object != roots.empty_weak_fixed_array() &&
          object != roots.empty_descriptor_array() &&
@@ -2181,23 +2309,24 @@ bool V8HeapExplorer::IsEssentialObject(Object object) {
          object != roots.two_pointer_filler_map();
 }
 
-bool V8HeapExplorer::IsEssentialHiddenReference(Object parent,
+bool V8HeapExplorer::IsEssentialHiddenReference(Tagged<Object> parent,
                                                 int field_offset) {
-  if (parent.IsAllocationSite() &&
+  if (IsAllocationSite(parent) &&
       field_offset == AllocationSite::kWeakNextOffset)
     return false;
-  if (parent.IsContext() &&
+  if (IsContext(parent) &&
       field_offset == Context::OffsetOfElementAt(Context::NEXT_CONTEXT_LINK))
     return false;
-  if (parent.IsJSFinalizationRegistry() &&
+  if (IsJSFinalizationRegistry(parent) &&
       field_offset == JSFinalizationRegistry::kNextDirtyOffset)
     return false;
   return true;
 }
 
 void V8HeapExplorer::SetContextReference(HeapEntry* parent_entry,
-                                         String reference_name,
-                                         Object child_obj, int field_offset) {
+                                         Tagged<String> reference_name,
+                                         Tagged<Object> child_obj,
+                                         int field_offset) {
   HeapEntry* child_entry = GetEntry(child_obj);
   if (child_entry == nullptr) return;
   parent_entry->SetNamedReference(HeapGraphEdge::kContextVariable,
@@ -2215,7 +2344,7 @@ void V8HeapExplorer::MarkVisitedField(int offset) {
 
 void V8HeapExplorer::SetNativeBindReference(HeapEntry* parent_entry,
                                             const char* reference_name,
-                                            Object child_obj) {
+                                            Tagged<Object> child_obj) {
   HeapEntry* child_entry = GetEntry(child_obj);
   if (child_entry == nullptr) return;
   parent_entry->SetNamedReference(HeapGraphEdge::kShortcut, reference_name,
@@ -2223,7 +2352,7 @@ void V8HeapExplorer::SetNativeBindReference(HeapEntry* parent_entry,
 }
 
 void V8HeapExplorer::SetElementReference(HeapEntry* parent_entry, int index,
-                                         Object child_obj) {
+                                         Tagged<Object> child_obj) {
   HeapEntry* child_entry = GetEntry(child_obj);
   if (child_entry == nullptr) return;
   parent_entry->SetIndexedReference(HeapGraphEdge::kElement, index, child_entry,
@@ -2232,7 +2361,8 @@ void V8HeapExplorer::SetElementReference(HeapEntry* parent_entry, int index,
 
 void V8HeapExplorer::SetInternalReference(HeapEntry* parent_entry,
                                           const char* reference_name,
-                                          Object child_obj, int field_offset) {
+                                          Tagged<Object> child_obj,
+                                          int field_offset) {
   if (!IsEssentialObject(child_obj)) {
     return;
   }
@@ -2244,7 +2374,8 @@ void V8HeapExplorer::SetInternalReference(HeapEntry* parent_entry,
 }
 
 void V8HeapExplorer::SetInternalReference(HeapEntry* parent_entry, int index,
-                                          Object child_obj, int field_offset) {
+                                          Tagged<Object> child_obj,
+                                          int field_offset) {
   if (!IsEssentialObject(child_obj)) {
     return;
   }
@@ -2256,9 +2387,10 @@ void V8HeapExplorer::SetInternalReference(HeapEntry* parent_entry, int index,
   MarkVisitedField(field_offset);
 }
 
-void V8HeapExplorer::SetHiddenReference(HeapObject parent_obj,
+void V8HeapExplorer::SetHiddenReference(Tagged<HeapObject> parent_obj,
                                         HeapEntry* parent_entry, int index,
-                                        Object child_obj, int field_offset) {
+                                        Tagged<Object> child_obj,
+                                        int field_offset) {
   DCHECK_EQ(parent_entry, GetEntry(parent_obj));
   DCHECK(!MapWord::IsPacked(child_obj.ptr()));
   if (!IsEssentialObject(child_obj)) {
@@ -2273,8 +2405,9 @@ void V8HeapExplorer::SetHiddenReference(HeapObject parent_obj,
 }
 
 void V8HeapExplorer::SetWeakReference(
-    HeapEntry* parent_entry, const char* reference_name, Object child_obj,
-    int field_offset, HeapEntry::ReferenceVerification verification) {
+    HeapEntry* parent_entry, const char* reference_name,
+    Tagged<Object> child_obj, int field_offset,
+    HeapEntry::ReferenceVerification verification) {
   if (!IsEssentialObject(child_obj)) {
     return;
   }
@@ -2286,7 +2419,7 @@ void V8HeapExplorer::SetWeakReference(
 }
 
 void V8HeapExplorer::SetWeakReference(HeapEntry* parent_entry, int index,
-                                      Object child_obj,
+                                      Tagged<Object> child_obj,
                                       base::Optional<int> field_offset) {
   if (!IsEssentialObject(child_obj)) {
     return;
@@ -2302,8 +2435,9 @@ void V8HeapExplorer::SetWeakReference(HeapEntry* parent_entry, int index,
 }
 
 void V8HeapExplorer::SetDataOrAccessorPropertyReference(
-    PropertyKind kind, HeapEntry* parent_entry, Name reference_name,
-    Object child_obj, const char* name_format_string, int field_offset) {
+    PropertyKind kind, HeapEntry* parent_entry, Tagged<Name> reference_name,
+    Tagged<Object> child_obj, const char* name_format_string,
+    int field_offset) {
   if (kind == PropertyKind::kAccessor) {
     ExtractAccessorPairProperty(parent_entry, reference_name, child_obj,
                                 field_offset);
@@ -2314,21 +2448,22 @@ void V8HeapExplorer::SetDataOrAccessorPropertyReference(
 }
 
 void V8HeapExplorer::SetPropertyReference(HeapEntry* parent_entry,
-                                          Name reference_name, Object child_obj,
+                                          Tagged<Name> reference_name,
+                                          Tagged<Object> child_obj,
                                           const char* name_format_string,
                                           int field_offset) {
   HeapEntry* child_entry = GetEntry(child_obj);
   if (child_entry == nullptr) return;
   HeapGraphEdge::Type type =
-      reference_name.IsSymbol() || String::cast(reference_name).length() > 0
+      IsSymbol(reference_name) || String::cast(reference_name)->length() > 0
           ? HeapGraphEdge::kProperty
           : HeapGraphEdge::kInternal;
   const char* name =
-      name_format_string != nullptr && reference_name.IsString()
+      name_format_string != nullptr && IsString(reference_name)
           ? names_->GetFormatted(
                 name_format_string,
                 String::cast(reference_name)
-                    .ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL)
+                    ->ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL)
                     .get())
           : names_->GetName(reference_name);
 
@@ -2341,7 +2476,7 @@ void V8HeapExplorer::SetRootGcRootsReference() {
       HeapGraphEdge::kElement, snapshot_->gc_roots(), generator_);
 }
 
-void V8HeapExplorer::SetUserGlobalReference(Object child_obj) {
+void V8HeapExplorer::SetUserGlobalReference(Tagged<Object> child_obj) {
   HeapEntry* child_entry = GetEntry(child_obj);
   DCHECK_NOT_NULL(child_entry);
   snapshot_->root()->SetNamedAutoIndexReference(
@@ -2354,8 +2489,9 @@ void V8HeapExplorer::SetGcRootsReference(Root root) {
 }
 
 void V8HeapExplorer::SetGcSubrootReference(Root root, const char* description,
-                                           bool is_weak, Object child_obj) {
-  if (child_obj.IsSmi()) {
+                                           bool is_weak,
+                                           Tagged<Object> child_obj) {
+  if (IsSmi(child_obj)) {
     // TODO(arenevier): if we handle smis here, the snapshot gets 2 to 3 times
     // slower on large heaps. According to perf, The bulk of the extra works
     // happens in TemplateHashMapImpl::Probe method, when tyring to get
@@ -2383,24 +2519,25 @@ void V8HeapExplorer::SetGcSubrootReference(Root root, const char* description,
   // Add a shortcut to JS global object reference at snapshot root.
   // That allows the user to easily find global objects. They are
   // also used as starting points in distance calculations.
-  if (is_weak || !child_heap_obj.IsNativeContext()) return;
+  if (is_weak || !IsNativeContext(child_heap_obj)) return;
 
-  JSGlobalObject global = Context::cast(child_heap_obj).global_object();
-  if (!global.IsJSGlobalObject()) return;
+  Tagged<JSGlobalObject> global =
+      Context::cast(child_heap_obj)->global_object();
+  if (!IsJSGlobalObject(global)) return;
 
   if (!user_roots_.insert(global).second) return;
 
   SetUserGlobalReference(global);
 }
 
-const char* V8HeapExplorer::GetStrongGcSubrootName(HeapObject object) {
+const char* V8HeapExplorer::GetStrongGcSubrootName(Tagged<HeapObject> object) {
   if (strong_gc_subroot_names_.empty()) {
     Isolate* isolate = Isolate::FromHeap(heap_);
     for (RootIndex root_index = RootIndex::kFirstStrongOrReadOnlyRoot;
          root_index <= RootIndex::kLastStrongOrReadOnlyRoot; ++root_index) {
       const char* name = RootsTable::name(root_index);
-      Object root = isolate->root(root_index);
-      CHECK(!root.IsSmi());
+      Tagged<Object> root = isolate->root(root_index);
+      CHECK(!IsSmi(root));
       strong_gc_subroot_names_.emplace(HeapObject::cast(root), name);
     }
     CHECK(!strong_gc_subroot_names_.empty());
@@ -2409,7 +2546,7 @@ const char* V8HeapExplorer::GetStrongGcSubrootName(HeapObject object) {
   return it != strong_gc_subroot_names_.end() ? it->second : nullptr;
 }
 
-void V8HeapExplorer::TagObject(Object obj, const char* tag,
+void V8HeapExplorer::TagObject(Tagged<Object> obj, const char* tag,
                                base::Optional<HeapEntry::Type> type) {
   if (IsEssentialObject(obj)) {
     HeapEntry* entry = GetEntry(obj);
@@ -2422,26 +2559,29 @@ void V8HeapExplorer::TagObject(Object obj, const char* tag,
   }
 }
 
-void V8HeapExplorer::RecursivelyTagConstantPool(Object obj, const char* tag,
+void V8HeapExplorer::RecursivelyTagConstantPool(Tagged<Object> obj,
+                                                const char* tag,
                                                 HeapEntry::Type type,
                                                 int recursion_limit) {
   --recursion_limit;
-  if (obj.IsFixedArrayExact(isolate())) {
-    FixedArray arr = FixedArray::cast(obj);
+  if (IsFixedArrayExact(obj, isolate())) {
+    Tagged<FixedArray> arr = FixedArray::cast(obj);
     TagObject(arr, tag, type);
     if (recursion_limit <= 0) return;
-    for (int i = 0; i < arr.length(); ++i) {
-      RecursivelyTagConstantPool(arr.get(i), tag, type, recursion_limit);
+    for (int i = 0; i < arr->length(); ++i) {
+      RecursivelyTagConstantPool(arr->get(i), tag, type, recursion_limit);
     }
-  } else if (obj.IsNameDictionary(isolate()) ||
-             obj.IsNumberDictionary(isolate())) {
+  } else if (IsNameDictionary(obj, isolate()) ||
+             IsNumberDictionary(obj, isolate())) {
     TagObject(obj, tag, type);
   }
 }
 
 class GlobalObjectsEnumerator : public RootVisitor {
  public:
-  explicit GlobalObjectsEnumerator(Isolate* isolate) : isolate_(isolate) {}
+  GlobalObjectsEnumerator(Isolate* isolate,
+                          std::function<void(Handle<JSGlobalObject>)> handler)
+      : isolate_(isolate), handler_(handler) {}
 
   void VisitRootPointers(Root root, const char* description,
                          FullObjectSlot start, FullObjectSlot end) override {
@@ -2454,52 +2594,60 @@ class GlobalObjectsEnumerator : public RootVisitor {
     VisitRootPointersImpl(root, description, start, end);
   }
 
-  int count() const { return static_cast<int>(objects_.size()); }
-  Handle<JSGlobalObject>& at(int i) { return objects_[i]; }
-
  private:
   template <typename TSlot>
   void VisitRootPointersImpl(Root root, const char* description, TSlot start,
                              TSlot end) {
     for (TSlot p = start; p < end; ++p) {
       DCHECK(!MapWord::IsPacked(p.Relaxed_Load(isolate_).ptr()));
-      Object o = p.load(isolate_);
-      if (!o.IsNativeContext(isolate_)) continue;
-      JSObject proxy = Context::cast(o).global_proxy();
-      if (!proxy.IsJSGlobalProxy(isolate_)) continue;
-      Object global = proxy.map(isolate_).prototype(isolate_);
-      if (!global.IsJSGlobalObject(isolate_)) continue;
-      objects_.push_back(handle(JSGlobalObject::cast(global), isolate_));
+      Tagged<Object> o = p.load(isolate_);
+      if (!IsNativeContext(o, isolate_)) continue;
+      Tagged<JSObject> proxy = Context::cast(o)->global_proxy();
+      if (!IsJSGlobalProxy(proxy, isolate_)) continue;
+      Tagged<Object> global = proxy->map(isolate_)->prototype(isolate_);
+      if (!IsJSGlobalObject(global, isolate_)) continue;
+      handler_(handle(JSGlobalObject::cast(global), isolate_));
     }
   }
 
   Isolate* isolate_;
-  std::vector<Handle<JSGlobalObject>> objects_;
+  std::function<void(Handle<JSGlobalObject>)> handler_;
 };
 
+V8HeapExplorer::TemporaryGlobalObjectTags
+V8HeapExplorer::CollectTemporaryGlobalObjectsTags() {
+  if (!global_object_name_resolver_) return {};
 
-// Modifies heap. Must not be run during heap traversal.
-void V8HeapExplorer::CollectGlobalObjectsTags() {
-  if (!global_object_name_resolver_) return;
-
-  Isolate* isolate = Isolate::FromHeap(heap_);
-  GlobalObjectsEnumerator enumerator(isolate);
+  Isolate* isolate = heap_->isolate();
+  TemporaryGlobalObjectTags global_object_tags;
+  HandleScope scope(isolate);
+  GlobalObjectsEnumerator enumerator(
+      isolate, [this, isolate,
+                &global_object_tags](Handle<JSGlobalObject> global_object) {
+        if (const char* tag = global_object_name_resolver_->GetName(
+                Utils::ToLocal(Handle<JSObject>::cast(global_object)))) {
+          global_object_tags.emplace_back(
+              Global<v8::Object>(
+                  reinterpret_cast<v8::Isolate*>(isolate),
+                  Utils::ToLocal(Handle<JSObject>::cast(global_object))),
+              tag);
+          global_object_tags.back().first.SetWeak();
+        }
+      });
   isolate->global_handles()->IterateAllRoots(&enumerator);
   isolate->traced_handles()->Iterate(&enumerator);
-  for (int i = 0, l = enumerator.count(); i < l; ++i) {
-    Handle<JSGlobalObject> obj = enumerator.at(i);
-    const char* tag = global_object_name_resolver_->GetName(
-        Utils::ToLocal(Handle<JSObject>::cast(obj)));
-    if (tag) {
-      global_object_tag_pairs_.emplace_back(obj, tag);
-    }
-  }
+  return global_object_tags;
 }
 
 void V8HeapExplorer::MakeGlobalObjectTagMap(
-    const IsolateSafepointScope& safepoint_scope) {
-  for (const auto& pair : global_object_tag_pairs_) {
-    global_object_tag_map_.emplace(*pair.first, pair.second);
+    TemporaryGlobalObjectTags&& global_object_tags) {
+  HandleScope scope(heap_->isolate());
+  for (const auto& pair : global_object_tags) {
+    if (!pair.first.IsEmpty()) {
+      // Temporary local.
+      auto local = Utils::OpenPersistent(pair.first);
+      global_object_tag_map_.emplace(JSGlobalObject::cast(*local), pair.second);
+    }
   }
 }
 
@@ -2513,8 +2661,8 @@ class EmbedderGraphImpl : public EmbedderGraph {
 
   class V8NodeImpl : public Node {
    public:
-    explicit V8NodeImpl(Object object) : object_(object) {}
-    Object GetObject() { return object_; }
+    explicit V8NodeImpl(Tagged<Object> object) : object_(object) {}
+    Tagged<Object> GetObject() { return object_; }
 
     // Node overrides.
     bool IsEmbedderNode() override { return false; }
@@ -2562,7 +2710,7 @@ class EmbedderGraphEntriesAllocator : public HeapEntriesAllocator {
         names_(snapshot_->profiler()->names()),
         heap_object_map_(snapshot_->profiler()->heap_object_map()) {}
   HeapEntry* AllocateEntry(HeapThing ptr) override;
-  HeapEntry* AllocateEntry(Smi smi) override;
+  HeapEntry* AllocateEntry(Tagged<Smi> smi) override;
 
  private:
   HeapSnapshot* snapshot_;
@@ -2602,10 +2750,27 @@ HeapEntry* EmbedderGraphEntriesAllocator::AllocateEntry(HeapThing ptr) {
   DCHECK(node->IsEmbedderNode());
   size_t size = node->SizeInBytes();
   Address lookup_address = reinterpret_cast<Address>(node->GetNativeObject());
-  SnapshotObjectId id =
-      (lookup_address) ? heap_object_map_->FindOrAddEntry(lookup_address, 0)
-                       : static_cast<SnapshotObjectId>(
-                             reinterpret_cast<uintptr_t>(node) << 1);
+  HeapObjectsMap::MarkEntryAccessed accessed =
+      HeapObjectsMap::MarkEntryAccessed::kYes;
+  HeapObjectsMap::IsNativeObject is_native_object =
+      HeapObjectsMap::IsNativeObject::kNo;
+  if (!lookup_address) {
+    // If there is not a native object associated with this embedder object,
+    // then request the address of the embedder object.
+    lookup_address = reinterpret_cast<Address>(node->GetAddress());
+    is_native_object = HeapObjectsMap::IsNativeObject::kYes;
+  }
+  if (!lookup_address) {
+    // If the Node implementation did not provide either a native address or an
+    // embedder address, then use the address of the Node itself for the lookup.
+    // In this case, we'll set the "accessed" flag on the newly created
+    // HeapEntry to false, to indicate that this entry should not persist for
+    // future snapshots.
+    lookup_address = reinterpret_cast<Address>(node);
+    accessed = HeapObjectsMap::MarkEntryAccessed::kNo;
+  }
+  SnapshotObjectId id = heap_object_map_->FindOrAddEntry(
+      lookup_address, 0, accessed, is_native_object);
   auto* heap_entry = snapshot_->AddEntry(EmbedderGraphNodeType(node),
                                          EmbedderGraphNodeName(names_, node),
                                          id, static_cast<int>(size), 0);
@@ -2613,7 +2778,7 @@ HeapEntry* EmbedderGraphEntriesAllocator::AllocateEntry(HeapThing ptr) {
   return heap_entry;
 }
 
-HeapEntry* EmbedderGraphEntriesAllocator::AllocateEntry(Smi smi) {
+HeapEntry* EmbedderGraphEntriesAllocator::AllocateEntry(Tagged<Smi> smi) {
   DCHECK(false);
   return nullptr;
 }
@@ -2637,10 +2802,10 @@ void NativeObjectsExplorer::MergeNodeIntoEntry(
     // For V8 nodes only we can add a lookup.
     EmbedderGraphImpl::V8NodeImpl* v8_node =
         static_cast<EmbedderGraphImpl::V8NodeImpl*>(wrapper_node);
-    Object object = v8_node->GetObject();
-    DCHECK(!object.IsSmi());
+    Tagged<Object> object = v8_node->GetObject();
+    DCHECK(!IsSmi(object));
     if (original_node->GetNativeObject()) {
-      HeapObject heap_object = HeapObject::cast(object);
+      Tagged<HeapObject> heap_object = HeapObject::cast(object);
       heap_object_map_->AddMergedNativeEntry(original_node->GetNativeObject(),
                                              heap_object.address());
       DCHECK_EQ(entry->id(), heap_object_map_->FindMergedNativeEntry(
@@ -2668,9 +2833,9 @@ HeapEntry* NativeObjectsExplorer::EntryForEmbedderGraphNode(
                                       embedder_graph_entries_allocator_.get());
   }
   // Node is V8NodeImpl.
-  Object object =
+  Tagged<Object> object =
       static_cast<EmbedderGraphImpl::V8NodeImpl*>(node)->GetObject();
-  if (object.IsSmi()) return nullptr;
+  if (IsSmi(object)) return nullptr;
   auto* entry = generator_->FindEntry(
       reinterpret_cast<void*>(Object::cast(object).ptr()));
   return entry;
@@ -2727,12 +2892,14 @@ bool NativeObjectsExplorer::IterateAndExtractReferences(
 
 HeapSnapshotGenerator::HeapSnapshotGenerator(
     HeapSnapshot* snapshot, v8::ActivityControl* control,
-    v8::HeapProfiler::ObjectNameResolver* resolver, Heap* heap)
+    v8::HeapProfiler::ObjectNameResolver* resolver, Heap* heap,
+    cppgc::EmbedderStackState stack_state)
     : snapshot_(snapshot),
       control_(control),
       v8_heap_explorer_(snapshot_, this, resolver),
       dom_explorer_(snapshot_, this),
-      heap_(heap) {}
+      heap_(heap),
+      stack_state_(stack_state) {}
 
 namespace {
 class V8_NODISCARD NullContextForSnapshotScope {
@@ -2750,32 +2917,32 @@ class V8_NODISCARD NullContextForSnapshotScope {
 }  // namespace
 
 bool HeapSnapshotGenerator::GenerateSnapshot() {
-  Isolate* isolate = Isolate::FromHeap(heap_);
-  base::Optional<HandleScope> handle_scope(base::in_place, isolate);
-  v8_heap_explorer_.CollectGlobalObjectsTags();
+  v8::base::ElapsedTimer timer;
+  timer.Start();
 
+  IsolateSafepointScope scope(heap_);
+
+  Isolate* isolate = heap_->isolate();
+  v8_heap_explorer_.PopulateLineEnds();
+  auto temporary_global_object_tags =
+      v8_heap_explorer_.CollectTemporaryGlobalObjectsTags();
+
+  EmbedderStackStateScope stack_scope(
+      heap_, EmbedderStackStateScope::kImplicitThroughTask, stack_state_);
   heap_->CollectAllAvailableGarbage(GarbageCollectionReason::kHeapProfiler);
 
+  // No allocation that could trigger GC from here onwards. We cannot use a
+  // DisallowGarbageCollection scope as the HeapObjectIterator used during
+  // snapshot creation enters a safepoint as well. However, in practice we
+  // already enter a safepoint above so that should never trigger a GC.
+
   NullContextForSnapshotScope null_context_scope(isolate);
-  IsolateSafepointScope scope(heap_);
-  v8_heap_explorer_.MakeGlobalObjectTagMap(scope);
-  handle_scope.reset();
 
-#ifdef VERIFY_HEAP
-  Heap* debug_heap = heap_;
-  if (v8_flags.verify_heap) {
-    HeapVerifier::VerifyHeap(debug_heap);
-  }
-#endif
+  v8_heap_explorer_.MakeGlobalObjectTagMap(
+      std::move(temporary_global_object_tags));
 
   InitProgressCounter();
 
-#ifdef VERIFY_HEAP
-  if (v8_flags.verify_heap) {
-    HeapVerifier::VerifyHeap(debug_heap);
-  }
-#endif
-
   snapshot_->AddSyntheticRootEntries();
 
   if (!FillReferences()) return false;
@@ -2784,6 +2951,12 @@ bool HeapSnapshotGenerator::GenerateSnapshot() {
   snapshot_->RememberLastJSObjectId();
 
   progress_counter_ = progress_total_;
+
+  if (i::v8_flags.profile_heap_snapshot) {
+    base::OS::PrintError("[Heap snapshot took %0.3f ms]\n",
+                         timer.Elapsed().InMillisecondsF());
+  }
+  timer.Stop();
   if (!ProgressReport(true)) return false;
   return true;
 }
@@ -2827,8 +3000,10 @@ bool HeapSnapshotGenerator::FillReferences() {
 const int HeapSnapshotJSONSerializer::kNodeFieldsCount = 7;
 
 void HeapSnapshotJSONSerializer::Serialize(v8::OutputStream* stream) {
+  v8::base::ElapsedTimer timer;
+  timer.Start();
   if (AllocationTracker* allocation_tracker =
-      snapshot_->profiler()->allocation_tracker()) {
+          snapshot_->profiler()->allocation_tracker()) {
     allocation_tracker->PrepareForSerialization();
   }
   DCHECK_NULL(writer_);
@@ -2836,8 +3011,13 @@ void HeapSnapshotJSONSerializer::Serialize(v8::OutputStream* stream) {
   SerializeImpl();
   delete writer_;
   writer_ = nullptr;
-}
 
+  if (i::v8_flags.profile_heap_snapshot) {
+    base::OS::PrintError("[Serialization of heap snapshot took %0.3f ms]\n",
+                         timer.Elapsed().InMillisecondsF());
+  }
+  timer.Stop();
+}
 
 void HeapSnapshotJSONSerializer::SerializeImpl() {
   DCHECK_EQ(0, snapshot_->root()->index());
@@ -2882,7 +3062,6 @@ void HeapSnapshotJSONSerializer::SerializeImpl() {
   writer_->Finalize();
 }
 
-
 int HeapSnapshotJSONSerializer::GetStringId(const char* s) {
   base::HashMap::Entry* cache_entry =
       strings_.LookupOrInsert(const_cast<char*>(s), StringHash(s));
@@ -2892,29 +3071,30 @@ int HeapSnapshotJSONSerializer::GetStringId(const char* s) {
   return static_cast<int>(reinterpret_cast<intptr_t>(cache_entry->value));
 }
 
-
 namespace {
 
-template<size_t size> struct ToUnsigned;
+template <size_t size>
+struct ToUnsigned;
 
 template <>
 struct ToUnsigned<1> {
   using Type = uint8_t;
 };
 
-template<> struct ToUnsigned<4> {
+template <>
+struct ToUnsigned<4> {
   using Type = uint32_t;
 };
 
-template<> struct ToUnsigned<8> {
+template <>
+struct ToUnsigned<8> {
   using Type = uint64_t;
 };
 
 }  // namespace
 
 template <typename T>
-static int utoa_impl(T value, const base::Vector<char>& buffer,
-                     int buffer_pos) {
+static int utoa_impl(T value, base::Vector<char> buffer, int buffer_pos) {
   static_assert(static_cast<T>(-1) > 0);  // Check that T is unsigned
   int number_of_digits = 0;
   T t = value;
@@ -2933,7 +3113,7 @@ static int utoa_impl(T value, const base::Vector<char>& buffer,
 }
 
 template <typename T>
-static int utoa(T value, const base::Vector<char>& buffer, int buffer_pos) {
+static int utoa(T value, base::Vector<char> buffer, int buffer_pos) {
   typename ToUnsigned<sizeof(value)>::Type unsigned_value = value;
   static_assert(sizeof(value) == sizeof(unsigned_value));
   return utoa_impl(unsigned_value, buffer, buffer_pos);
@@ -2945,9 +3125,10 @@ void HeapSnapshotJSONSerializer::SerializeEdge(HeapGraphEdge* edge,
   static const int kBufferSize =
       MaxDecimalDigitsIn<sizeof(unsigned)>::kUnsigned * 3 + 3 + 2;
   base::EmbeddedVector<char, kBufferSize> buffer;
-  int edge_name_or_index = edge->type() == HeapGraphEdge::kElement
-      || edge->type() == HeapGraphEdge::kHidden
-      ? edge->index() : GetStringId(edge->name());
+  int edge_name_or_index = edge->type() == HeapGraphEdge::kElement ||
+                                   edge->type() == HeapGraphEdge::kHidden
+                               ? edge->index()
+                               : GetStringId(edge->name());
   int buffer_pos = 0;
   if (!first_edge) {
     buffer[buffer_pos++] = ',';
@@ -3015,7 +3196,7 @@ void HeapSnapshotJSONSerializer::SerializeSnapshot() {
   // The object describing node serialization layout.
   // We use a set of macros to improve readability.
 
-// clang-format off
+  // clang-format off
 #define JSON_A(s) "[" s "]"
 #define JSON_O(s) "{" s "}"
 #define JSON_S(s) "\"" s "\""
@@ -3044,8 +3225,7 @@ void HeapSnapshotJSONSerializer::SerializeSnapshot() {
             JSON_S("sliced string") ","
             JSON_S("symbol") ","
             JSON_S("bigint") ","
-            JSON_S("object shape") ","
-            JSON_S("wasm object")) ","
+            JSON_S("object shape")) ","
         JSON_S("string") ","
         JSON_S("number") ","
         JSON_S("number") ","
@@ -3105,7 +3285,6 @@ void HeapSnapshotJSONSerializer::SerializeSnapshot() {
   writer_->AddNumber(count);
 }
 
-
 static void WriteUChar(OutputStreamWriter* w, unibrow::uchar u) {
   static const char hex_chars[] = "0123456789ABCDEF";
   w->AddString("\\u");
@@ -3115,7 +3294,6 @@ static void WriteUChar(OutputStreamWriter* w, unibrow::uchar u) {
   w->AddCharacter(hex_chars[u & 0xF]);
 }
 
-
 void HeapSnapshotJSONSerializer::SerializeTraceTree() {
   AllocationTracker* tracker = snapshot_->profiler()->allocation_tracker();
   if (!tracker) return;
@@ -3123,7 +3301,6 @@ void HeapSnapshotJSONSerializer::SerializeTraceTree() {
   SerializeTraceNode(traces->root());
 }
 
-
 void HeapSnapshotJSONSerializer::SerializeTraceNode(AllocationTraceNode* node) {
   // The buffer needs space for 4 unsigned ints, 4 commas, [ and \0
   const int kBufferSize =
@@ -3152,9 +3329,8 @@ void HeapSnapshotJSONSerializer::SerializeTraceNode(AllocationTraceNode* node) {
   writer_->AddCharacter(']');
 }
 
-
 // 0-based position is converted to 1-based during the serialization.
-static int SerializePosition(int position, const base::Vector<char>& buffer,
+static int SerializePosition(int position, base::Vector<char> buffer,
                              int buffer_pos) {
   if (position == -1) {
     buffer[buffer_pos++] = '0';
@@ -3185,8 +3361,8 @@ void HeapSnapshotJSONSerializer::SerializeTraceNodeInfos() {
     buffer_pos = utoa(GetStringId(info->script_name), buffer, buffer_pos);
     buffer[buffer_pos++] = ',';
     // The cast is safe because script id is a non-negative Smi.
-    buffer_pos = utoa(static_cast<unsigned>(info->script_id), buffer,
-        buffer_pos);
+    buffer_pos =
+        utoa(static_cast<unsigned>(info->script_id), buffer, buffer_pos);
     buffer[buffer_pos++] = ',';
     buffer_pos = SerializePosition(info->line, buffer, buffer_pos);
     buffer[buffer_pos++] = ',';
@@ -3197,7 +3373,6 @@ void HeapSnapshotJSONSerializer::SerializeTraceNodeInfos() {
   }
 }
 
-
 void HeapSnapshotJSONSerializer::SerializeSamples() {
   const std::vector<HeapObjectsMap::TimeInterval>& samples =
       snapshot_->profiler()->heap_object_map()->samples();
@@ -3225,11 +3400,10 @@ void HeapSnapshotJSONSerializer::SerializeSamples() {
   }
 }
 
-
 void HeapSnapshotJSONSerializer::SerializeString(const unsigned char* s) {
   writer_->AddCharacter('\n');
   writer_->AddCharacter('\"');
-  for ( ; *s != '\0'; ++s) {
+  for (; *s != '\0'; ++s) {
     switch (*s) {
       case '\b':
         writer_->AddString("\\b");
@@ -3260,7 +3434,8 @@ void HeapSnapshotJSONSerializer::SerializeString(const unsigned char* s) {
         } else {
           // Convert UTF-8 into \u UTF-16 literal.
           size_t length = 1, cursor = 0;
-          for ( ; length <= 4 && *(s + length) != '\0'; ++length) { }
+          for (; length <= 4 && *(s + length) != '\0'; ++length) {
+          }
           unibrow::uchar c = unibrow::Utf8::CalculateValue(s, length, &cursor);
           if (c != unibrow::Utf8::kBadChar) {
             WriteUChar(writer_, c);
@@ -3275,7 +3450,6 @@ void HeapSnapshotJSONSerializer::SerializeString(const unsigned char* s) {
   writer_->AddCharacter('\"');
 }
 
-
 void HeapSnapshotJSONSerializer::SerializeStrings() {
   base::ScopedVector<const unsigned char*> sorted_strings(strings_.occupancy() +
                                                           1);
diff --git a/deps/v8/src/profiler/heap-snapshot-generator.h b/deps/v8/src/profiler/heap-snapshot-generator.h
index 5680e669a4a204..ef5241d0fb13d9 100644
--- a/deps/v8/src/profiler/heap-snapshot-generator.h
+++ b/deps/v8/src/profiler/heap-snapshot-generator.h
@@ -120,7 +120,6 @@ class HeapEntry {
     kSymbol = v8::HeapGraphNode::kSymbol,
     kBigInt = v8::HeapGraphNode::kBigInt,
     kObjectShape = v8::HeapGraphNode::kObjectShape,
-    kWasmObject = v8::HeapGraphNode::kWasmObject,
     kNumTypes,
   };
 
@@ -299,6 +298,14 @@ class HeapObjectsMap {
     uint32_t count;
     base::TimeTicks timestamp;
   };
+  enum class MarkEntryAccessed {
+    kNo,
+    kYes,
+  };
+  enum class IsNativeObject {
+    kNo,
+    kYes,
+  };
 
   explicit HeapObjectsMap(Heap* heap);
   HeapObjectsMap(const HeapObjectsMap&) = delete;
@@ -307,9 +314,10 @@ class HeapObjectsMap {
   Heap* heap() const { return heap_; }
 
   SnapshotObjectId FindEntry(Address addr);
-  SnapshotObjectId FindOrAddEntry(Address addr,
-                                  unsigned int size,
-                                  bool accessed = true);
+  SnapshotObjectId FindOrAddEntry(
+      Address addr, unsigned int size,
+      MarkEntryAccessed accessed = MarkEntryAccessed::kYes,
+      IsNativeObject is_native_object = IsNativeObject::kNo);
   SnapshotObjectId FindMergedNativeEntry(NativeObject addr);
   void AddMergedNativeEntry(NativeObject addr, Address canonical_addr);
   bool MoveObject(Address from, Address to, int size);
@@ -321,6 +329,10 @@ class HeapObjectsMap {
     next_id_ += kObjectIdStep;
     return next_id_ - kObjectIdStep;
   }
+  SnapshotObjectId get_next_native_id() {
+    next_native_id_ += kObjectIdStep;
+    return next_native_id_ - kObjectIdStep;
+  }
 
   void StopHeapObjectsTracking();
   SnapshotObjectId PushHeapObjectsStats(OutputStream* stream,
@@ -332,6 +344,7 @@ class HeapObjectsMap {
   static const SnapshotObjectId kGcRootsObjectId;
   static const SnapshotObjectId kGcRootsFirstSubrootId;
   static const SnapshotObjectId kFirstAvailableObjectId;
+  static const SnapshotObjectId kFirstAvailableNativeId;
 
   void UpdateHeapObjectsMap();
   void RemoveDeadEntries();
@@ -348,6 +361,7 @@ class HeapObjectsMap {
   };
 
   SnapshotObjectId next_id_;
+  SnapshotObjectId next_native_id_;
   // TODO(jkummerow): Use a map that uses {Address} as the key type.
   base::HashMap entries_map_;
   std::vector<EntryInfo> entries_;
@@ -366,7 +380,7 @@ class HeapEntriesAllocator {
  public:
   virtual ~HeapEntriesAllocator() = default;
   virtual HeapEntry* AllocateEntry(HeapThing ptr) = 0;
-  virtual HeapEntry* AllocateEntry(Smi smi) = 0;
+  virtual HeapEntry* AllocateEntry(Tagged<Smi> smi) = 0;
 };
 
 class SnapshottingProgressReportingInterface {
@@ -389,132 +403,164 @@ class V8_EXPORT_PRIVATE V8HeapExplorer : public HeapEntriesAllocator {
   V8_INLINE Isolate* isolate() { return Isolate::FromHeap(heap_); }
 
   HeapEntry* AllocateEntry(HeapThing ptr) override;
-  HeapEntry* AllocateEntry(Smi smi) override;
+  HeapEntry* AllocateEntry(Tagged<Smi> smi) override;
   uint32_t EstimateObjectsCount();
+  void PopulateLineEnds();
   bool IterateAndExtractReferences(HeapSnapshotGenerator* generator);
-  void CollectGlobalObjectsTags();
-  void MakeGlobalObjectTagMap(const IsolateSafepointScope& safepoint_scope);
-  void TagBuiltinCodeObject(Code code, const char* name);
+
+  using TemporaryGlobalObjectTags =
+      std::vector<std::pair<v8::Global<v8::Object>, const char*>>;
+  // Modifies heap. Must not be run during heap traversal. Collects a temporary
+  // list of global objects and their tags. The list may be invalidated after
+  // running GC.
+  TemporaryGlobalObjectTags CollectTemporaryGlobalObjectsTags();
+  // Converts the temporary list of global objects and their tags into a map
+  // that can be used throughout snapshot generation.
+  void MakeGlobalObjectTagMap(TemporaryGlobalObjectTags&&);
+
+  void TagBuiltinCodeObject(Tagged<Code> code, const char* name);
   HeapEntry* AddEntry(Address address,
                       HeapEntry::Type type,
                       const char* name,
                       size_t size);
 
-  static JSFunction GetConstructor(Isolate* isolate, JSReceiver receiver);
-  static String GetConstructorName(Isolate* isolate, JSObject object);
+  static Tagged<JSFunction> GetConstructor(Isolate* isolate,
+                                           Tagged<JSReceiver> receiver);
+  static Tagged<String> GetConstructorName(Isolate* isolate,
+                                           Tagged<JSObject> object);
 
  private:
   void MarkVisitedField(int offset);
 
-  HeapEntry* AddEntry(HeapObject object);
-  HeapEntry* AddEntry(HeapObject object, HeapEntry::Type type,
+  HeapEntry* AddEntry(Tagged<HeapObject> object);
+  HeapEntry* AddEntry(Tagged<HeapObject> object, HeapEntry::Type type,
                       const char* name);
 
-  const char* GetSystemEntryName(HeapObject object);
-  HeapEntry::Type GetSystemEntryType(HeapObject object);
-
-  void ExtractLocation(HeapEntry* entry, HeapObject object);
-  void ExtractLocationForJSFunction(HeapEntry* entry, JSFunction func);
-  void ExtractReferences(HeapEntry* entry, HeapObject obj);
-  void ExtractJSGlobalProxyReferences(HeapEntry* entry, JSGlobalProxy proxy);
-  void ExtractJSObjectReferences(HeapEntry* entry, JSObject js_obj);
-  void ExtractStringReferences(HeapEntry* entry, String obj);
-  void ExtractSymbolReferences(HeapEntry* entry, Symbol symbol);
-  void ExtractJSCollectionReferences(HeapEntry* entry, JSCollection collection);
+  const char* GetSystemEntryName(Tagged<HeapObject> object);
+  HeapEntry::Type GetSystemEntryType(Tagged<HeapObject> object);
+
+  Tagged<JSFunction> GetLocationFunction(Tagged<HeapObject> object);
+  void ExtractLocation(HeapEntry* entry, Tagged<HeapObject> object);
+  void ExtractLocationForJSFunction(HeapEntry* entry, Tagged<JSFunction> func);
+  void ExtractReferences(HeapEntry* entry, Tagged<HeapObject> obj);
+  void ExtractJSGlobalProxyReferences(HeapEntry* entry,
+                                      Tagged<JSGlobalProxy> proxy);
+  void ExtractJSObjectReferences(HeapEntry* entry, Tagged<JSObject> js_obj);
+  void ExtractStringReferences(HeapEntry* entry, Tagged<String> obj);
+  void ExtractSymbolReferences(HeapEntry* entry, Tagged<Symbol> symbol);
+  void ExtractJSCollectionReferences(HeapEntry* entry,
+                                     Tagged<JSCollection> collection);
   void ExtractJSWeakCollectionReferences(HeapEntry* entry,
-                                         JSWeakCollection collection);
+                                         Tagged<JSWeakCollection> collection);
   void ExtractEphemeronHashTableReferences(HeapEntry* entry,
-                                           EphemeronHashTable table);
-  void ExtractContextReferences(HeapEntry* entry, Context context);
-  void ExtractMapReferences(HeapEntry* entry, Map map);
+                                           Tagged<EphemeronHashTable> table);
+  void ExtractContextReferences(HeapEntry* entry, Tagged<Context> context);
+  void ExtractMapReferences(HeapEntry* entry, Tagged<Map> map);
   void ExtractSharedFunctionInfoReferences(HeapEntry* entry,
-                                           SharedFunctionInfo shared);
-  void ExtractScriptReferences(HeapEntry* entry, Script script);
+                                           Tagged<SharedFunctionInfo> shared);
+  void ExtractScriptReferences(HeapEntry* entry, Tagged<Script> script);
   void ExtractAccessorInfoReferences(HeapEntry* entry,
-                                     AccessorInfo accessor_info);
-  void ExtractAccessorPairReferences(HeapEntry* entry, AccessorPair accessors);
-  void ExtractCodeReferences(HeapEntry* entry, Code code);
-  void ExtractCellReferences(HeapEntry* entry, Cell cell);
-  void ExtractJSWeakRefReferences(HeapEntry* entry, JSWeakRef js_weak_ref);
-  void ExtractWeakCellReferences(HeapEntry* entry, WeakCell weak_cell);
+                                     Tagged<AccessorInfo> accessor_info);
+  void ExtractAccessorPairReferences(HeapEntry* entry,
+                                     Tagged<AccessorPair> accessors);
+  void ExtractCodeReferences(HeapEntry* entry, Tagged<Code> code);
+  void ExtractInstructionStreamReferences(HeapEntry* entry,
+                                          Tagged<InstructionStream> code);
+  void ExtractCellReferences(HeapEntry* entry, Tagged<Cell> cell);
+  void ExtractJSWeakRefReferences(HeapEntry* entry,
+                                  Tagged<JSWeakRef> js_weak_ref);
+  void ExtractWeakCellReferences(HeapEntry* entry, Tagged<WeakCell> weak_cell);
   void ExtractFeedbackCellReferences(HeapEntry* entry,
-                                     FeedbackCell feedback_cell);
-  void ExtractPropertyCellReferences(HeapEntry* entry, PropertyCell cell);
-  void ExtractPrototypeInfoReferences(HeapEntry* entry, PrototypeInfo info);
-  void ExtractAllocationSiteReferences(HeapEntry* entry, AllocationSite site);
+                                     Tagged<FeedbackCell> feedback_cell);
+  void ExtractPropertyCellReferences(HeapEntry* entry,
+                                     Tagged<PropertyCell> cell);
+  void ExtractPrototypeInfoReferences(HeapEntry* entry,
+                                      Tagged<PrototypeInfo> info);
+  void ExtractAllocationSiteReferences(HeapEntry* entry,
+                                       Tagged<AllocationSite> site);
   void ExtractArrayBoilerplateDescriptionReferences(
-      HeapEntry* entry, ArrayBoilerplateDescription value);
+      HeapEntry* entry, Tagged<ArrayBoilerplateDescription> value);
   void ExtractRegExpBoilerplateDescriptionReferences(
-      HeapEntry* entry, RegExpBoilerplateDescription value);
-  void ExtractJSArrayBufferReferences(HeapEntry* entry, JSArrayBuffer buffer);
-  void ExtractJSPromiseReferences(HeapEntry* entry, JSPromise promise);
+      HeapEntry* entry, Tagged<RegExpBoilerplateDescription> value);
+  void ExtractJSArrayBufferReferences(HeapEntry* entry,
+                                      Tagged<JSArrayBuffer> buffer);
+  void ExtractJSPromiseReferences(HeapEntry* entry, Tagged<JSPromise> promise);
   void ExtractJSGeneratorObjectReferences(HeapEntry* entry,
-                                          JSGeneratorObject generator);
-  void ExtractFixedArrayReferences(HeapEntry* entry, FixedArray array);
-  void ExtractNumberReference(HeapEntry* entry, Object number);
-  void ExtractBytecodeArrayReferences(HeapEntry* entry, BytecodeArray bytecode);
-  void ExtractScopeInfoReferences(HeapEntry* entry, ScopeInfo info);
+                                          Tagged<JSGeneratorObject> generator);
+  void ExtractFixedArrayReferences(HeapEntry* entry, Tagged<FixedArray> array);
+  void ExtractNumberReference(HeapEntry* entry, Tagged<Object> number);
+  void ExtractBytecodeArrayReferences(HeapEntry* entry,
+                                      Tagged<BytecodeArray> bytecode);
+  void ExtractScopeInfoReferences(HeapEntry* entry, Tagged<ScopeInfo> info);
   void ExtractFeedbackVectorReferences(HeapEntry* entry,
-                                       FeedbackVector feedback_vector);
+                                       Tagged<FeedbackVector> feedback_vector);
   void ExtractDescriptorArrayReferences(HeapEntry* entry,
-                                        DescriptorArray array);
-  void ExtractEnumCacheReferences(HeapEntry* entry, EnumCache cache);
+                                        Tagged<DescriptorArray> array);
+  void ExtractEnumCacheReferences(HeapEntry* entry, Tagged<EnumCache> cache);
   void ExtractTransitionArrayReferences(HeapEntry* entry,
-                                        TransitionArray transitions);
+                                        Tagged<TransitionArray> transitions);
   template <typename T>
-  void ExtractWeakArrayReferences(int header_size, HeapEntry* entry, T array);
-  void ExtractPropertyReferences(JSObject js_obj, HeapEntry* entry);
-  void ExtractAccessorPairProperty(HeapEntry* entry, Name key,
-                                   Object callback_obj, int field_offset = -1);
-  void ExtractElementReferences(JSObject js_obj, HeapEntry* entry);
-  void ExtractInternalReferences(JSObject js_obj, HeapEntry* entry);
+  void ExtractWeakArrayReferences(int header_size, HeapEntry* entry,
+                                  Tagged<T> array);
+  void ExtractPropertyReferences(Tagged<JSObject> js_obj, HeapEntry* entry);
+  void ExtractAccessorPairProperty(HeapEntry* entry, Tagged<Name> key,
+                                   Tagged<Object> callback_obj,
+                                   int field_offset = -1);
+  void ExtractElementReferences(Tagged<JSObject> js_obj, HeapEntry* entry);
+  void ExtractInternalReferences(Tagged<JSObject> js_obj, HeapEntry* entry);
 
 #if V8_ENABLE_WEBASSEMBLY
-  void ExtractWasmStructReferences(WasmStruct obj, HeapEntry* entry);
-  void ExtractWasmArrayReferences(WasmArray obj, HeapEntry* entry);
+  void ExtractWasmStructReferences(Tagged<WasmStruct> obj, HeapEntry* entry);
+  void ExtractWasmArrayReferences(Tagged<WasmArray> obj, HeapEntry* entry);
+  void ExtractWasmInstanceObjectReference(Tagged<WasmInstanceObject> obj,
+                                          HeapEntry* entry);
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-  bool IsEssentialObject(Object object);
-  bool IsEssentialHiddenReference(Object parent, int field_offset);
+  bool IsEssentialObject(Tagged<Object> object);
+  bool IsEssentialHiddenReference(Tagged<Object> parent, int field_offset);
 
-  void SetContextReference(HeapEntry* parent_entry, String reference_name,
-                           Object child, int field_offset);
+  void SetContextReference(HeapEntry* parent_entry,
+                           Tagged<String> reference_name, Tagged<Object> child,
+                           int field_offset);
   void SetNativeBindReference(HeapEntry* parent_entry,
-                              const char* reference_name, Object child);
-  void SetElementReference(HeapEntry* parent_entry, int index, Object child);
+                              const char* reference_name, Tagged<Object> child);
+  void SetElementReference(HeapEntry* parent_entry, int index,
+                           Tagged<Object> child);
   void SetInternalReference(HeapEntry* parent_entry, const char* reference_name,
-                            Object child, int field_offset = -1);
-  void SetInternalReference(HeapEntry* parent_entry, int index, Object child,
-                            int field_offset = -1);
-  void SetHiddenReference(HeapObject parent_obj, HeapEntry* parent_entry,
-                          int index, Object child, int field_offset);
+                            Tagged<Object> child, int field_offset = -1);
+  void SetInternalReference(HeapEntry* parent_entry, int index,
+                            Tagged<Object> child, int field_offset = -1);
+  void SetHiddenReference(Tagged<HeapObject> parent_obj,
+                          HeapEntry* parent_entry, int index,
+                          Tagged<Object> child, int field_offset);
   void SetWeakReference(
-      HeapEntry* parent_entry, const char* reference_name, Object child_obj,
-      int field_offset,
+      HeapEntry* parent_entry, const char* reference_name,
+      Tagged<Object> child_obj, int field_offset,
       HeapEntry::ReferenceVerification verification = HeapEntry::kVerify);
-  void SetWeakReference(HeapEntry* parent_entry, int index, Object child_obj,
+  void SetWeakReference(HeapEntry* parent_entry, int index,
+                        Tagged<Object> child_obj,
                         base::Optional<int> field_offset);
-  void SetPropertyReference(HeapEntry* parent_entry, Name reference_name,
-                            Object child,
+  void SetPropertyReference(HeapEntry* parent_entry,
+                            Tagged<Name> reference_name, Tagged<Object> child,
                             const char* name_format_string = nullptr,
                             int field_offset = -1);
   void SetDataOrAccessorPropertyReference(
-      PropertyKind kind, HeapEntry* parent_entry, Name reference_name,
-      Object child, const char* name_format_string = nullptr,
+      PropertyKind kind, HeapEntry* parent_entry, Tagged<Name> reference_name,
+      Tagged<Object> child, const char* name_format_string = nullptr,
       int field_offset = -1);
 
-  void SetUserGlobalReference(Object user_global);
+  void SetUserGlobalReference(Tagged<Object> user_global);
   void SetRootGcRootsReference();
   void SetGcRootsReference(Root root);
   void SetGcSubrootReference(Root root, const char* description, bool is_weak,
-                             Object child);
-  const char* GetStrongGcSubrootName(HeapObject object);
-  void TagObject(Object obj, const char* tag,
+                             Tagged<Object> child);
+  const char* GetStrongGcSubrootName(Tagged<HeapObject> object);
+  void TagObject(Tagged<Object> obj, const char* tag,
                  base::Optional<HeapEntry::Type> type = {});
-  void RecursivelyTagConstantPool(Object obj, const char* tag,
+  void RecursivelyTagConstantPool(Tagged<Object> obj, const char* tag,
                                   HeapEntry::Type type, int recursion_limit);
 
-  HeapEntry* GetEntry(Object obj);
+  HeapEntry* GetEntry(Tagged<Object> obj);
 
   Heap* heap_;
   HeapSnapshot* snapshot_;
@@ -522,8 +568,6 @@ class V8_EXPORT_PRIVATE V8HeapExplorer : public HeapEntriesAllocator {
   HeapObjectsMap* heap_object_map_;
   SnapshottingProgressReportingInterface* progress_;
   HeapSnapshotGenerator* generator_ = nullptr;
-  std::vector<std::pair<Handle<JSGlobalObject>, const char*>>
-      global_object_tag_pairs_;
   std::unordered_map<JSGlobalObject, const char*, Object::Hasher>
       global_object_tag_map_;
   UnorderedHeapObjectMap<const char*> strong_gc_subroot_names_;
@@ -576,10 +620,9 @@ class HeapSnapshotGenerator : public SnapshottingProgressReportingInterface {
   // their representations in heap snapshots.
   using SmiEntriesMap = std::unordered_map<int, HeapEntry*>;
 
-  HeapSnapshotGenerator(HeapSnapshot* snapshot,
-                        v8::ActivityControl* control,
+  HeapSnapshotGenerator(HeapSnapshot* snapshot, v8::ActivityControl* control,
                         v8::HeapProfiler::ObjectNameResolver* resolver,
-                        Heap* heap);
+                        Heap* heap, cppgc::EmbedderStackState stack_state);
   HeapSnapshotGenerator(const HeapSnapshotGenerator&) = delete;
   HeapSnapshotGenerator& operator=(const HeapSnapshotGenerator&) = delete;
   bool GenerateSnapshot();
@@ -589,7 +632,7 @@ class HeapSnapshotGenerator : public SnapshottingProgressReportingInterface {
     return it != entries_map_.end() ? it->second : nullptr;
   }
 
-  HeapEntry* FindEntry(Smi smi) {
+  HeapEntry* FindEntry(Tagged<Smi> smi) {
     auto it = smis_map_.find(smi.value());
     return it != smis_map_.end() ? it->second : nullptr;
   }
@@ -622,7 +665,7 @@ class HeapSnapshotGenerator : public SnapshottingProgressReportingInterface {
   }
 #endif
 
-  HeapEntry* AddEntry(Smi smi, HeapEntriesAllocator* allocator) {
+  HeapEntry* AddEntry(Tagged<Smi> smi, HeapEntriesAllocator* allocator) {
     return smis_map_.emplace(smi.value(), allocator->AllocateEntry(smi))
         .first->second;
   }
@@ -632,7 +675,7 @@ class HeapSnapshotGenerator : public SnapshottingProgressReportingInterface {
     return entry != nullptr ? entry : AddEntry(ptr, allocator);
   }
 
-  HeapEntry* FindOrAddEntry(Smi smi, HeapEntriesAllocator* allocator) {
+  HeapEntry* FindOrAddEntry(Tagged<Smi> smi, HeapEntriesAllocator* allocator) {
     HeapEntry* entry = FindEntry(smi);
     return entry != nullptr ? entry : AddEntry(smi, allocator);
   }
@@ -656,6 +699,7 @@ class HeapSnapshotGenerator : public SnapshottingProgressReportingInterface {
   uint32_t progress_counter_;
   uint32_t progress_total_;
   Heap* heap_;
+  cppgc::EmbedderStackState stack_state_;
 
 #ifdef V8_ENABLE_HEAP_SNAPSHOT_VERIFY
   std::unordered_map<HeapEntry*, HeapThing> reverse_entries_map_;
diff --git a/deps/v8/src/profiler/profile-generator.cc b/deps/v8/src/profiler/profile-generator.cc
index 06edfa029e14e6..498cabf4f9d872 100644
--- a/deps/v8/src/profiler/profile-generator.cc
+++ b/deps/v8/src/profiler/profile-generator.cc
@@ -205,13 +205,14 @@ void CodeEntry::set_deopt_info(
   rare_data->deopt_inlined_frames_ = std::move(inlined_frames);
 }
 
-void CodeEntry::FillFunctionInfo(SharedFunctionInfo shared) {
-  if (!shared.script().IsScript()) return;
-  Script script = Script::cast(shared.script());
-  set_script_id(script.id());
-  set_position(shared.StartPosition());
-  if (shared.optimization_disabled()) {
-    set_bailout_reason(GetBailoutReason(shared.disabled_optimization_reason()));
+void CodeEntry::FillFunctionInfo(Tagged<SharedFunctionInfo> shared) {
+  if (!IsScript(shared->script())) return;
+  Tagged<Script> script = Script::cast(shared->script());
+  set_script_id(script->id());
+  set_position(shared->StartPosition());
+  if (shared->optimization_disabled()) {
+    set_bailout_reason(
+        GetBailoutReason(shared->disabled_optimization_reason()));
   }
 }
 
diff --git a/deps/v8/src/profiler/profile-generator.h b/deps/v8/src/profiler/profile-generator.h
index bf2e95b88c5702..f23de46ea96f35 100644
--- a/deps/v8/src/profiler/profile-generator.h
+++ b/deps/v8/src/profiler/profile-generator.h
@@ -131,7 +131,7 @@ class CodeEntry {
 
   Address** heap_object_location_address() { return &heap_object_location_; }
 
-  void FillFunctionInfo(SharedFunctionInfo shared);
+  void FillFunctionInfo(Tagged<SharedFunctionInfo> shared);
 
   void SetBuiltinId(Builtin id);
   Builtin builtin() const { return BuiltinField::decode(bit_field_); }
@@ -559,7 +559,9 @@ class V8_EXPORT_PRIVATE CpuProfilesCollection {
   std::vector<std::unique_ptr<CpuProfile>>* profiles() {
     return &finished_profiles_;
   }
-  const char* GetName(Name name) { return resource_names_.GetName(name); }
+  const char* GetName(Tagged<Name> name) {
+    return resource_names_.GetName(name);
+  }
   void RemoveProfile(CpuProfile* profile);
 
   // Finds a common sampling interval dividing each CpuProfile's interval,
diff --git a/deps/v8/src/profiler/profiler-listener.cc b/deps/v8/src/profiler/profiler-listener.cc
index 688bdc1027f82f..adc620557af30a 100644
--- a/deps/v8/src/profiler/profiler-listener.cc
+++ b/deps/v8/src/profiler/profiler-listener.cc
@@ -119,7 +119,7 @@ void ProfilerListener::CodeCreateEvent(CodeTag tag,
   std::unordered_set<CodeEntry*, CodeEntry::Hasher, CodeEntry::Equals>
       cached_inline_entries;
   bool is_shared_cross_origin = false;
-  if (shared->script(cage_base).IsScript(cage_base)) {
+  if (IsScript(shared->script(cage_base), cage_base)) {
     Handle<Script> script =
         handle(Script::cast(shared->script(cage_base)), isolate_);
     line_table.reset(new SourcePositionTable());
@@ -134,7 +134,7 @@ void ProfilerListener::CodeCreateEvent(CodeTag tag,
       Handle<BytecodeArray> bytecodes(shared->GetBytecodeArray(isolate_),
                                       isolate_);
       Handle<ByteArray> bytecode_offsets(
-          abstract_code->GetCode().bytecode_offset_table(cage_base), isolate_);
+          abstract_code->GetCode()->bytecode_offset_table(cage_base), isolate_);
       baseline_iterator = std::make_unique<baseline::BytecodeOffsetIterator>(
           bytecode_offsets, bytecodes);
     }
@@ -160,7 +160,7 @@ void ProfilerListener::CodeCreateEvent(CodeTag tag,
         line_table->SetPosition(code_offset, line_number, inlining_id);
       } else {
         DCHECK(!is_baseline);
-        DCHECK(abstract_code->IsCode(cage_base));
+        DCHECK(IsCode(*abstract_code, cage_base));
         std::vector<SourcePositionInfo> stack =
             it.source_position().InliningStack(isolate_,
                                                abstract_code->GetCode());
@@ -182,7 +182,7 @@ void ProfilerListener::CodeCreateEvent(CodeTag tag,
               1;
 
           const char* resource_name =
-              (pos_info.script->name().IsName())
+              (IsName(pos_info.script->name()))
                   ? GetName(Name::cast(pos_info.script->name()))
                   : CodeEntry::kEmptyResourceName;
 
@@ -294,22 +294,23 @@ void ProfilerListener::RegExpCodeCreateEvent(Handle<AbstractCode> code,
   DispatchCodeEvent(evt_rec);
 }
 
-void ProfilerListener::CodeMoveEvent(InstructionStream from,
-                                     InstructionStream to) {
+void ProfilerListener::CodeMoveEvent(Tagged<InstructionStream> from,
+                                     Tagged<InstructionStream> to) {
   DisallowGarbageCollection no_gc;
   CodeEventsContainer evt_rec(CodeEventRecord::Type::kCodeMove);
   CodeMoveEventRecord* rec = &evt_rec.CodeMoveEventRecord_;
-  rec->from_instruction_start = from.instruction_start();
-  rec->to_instruction_start = to.instruction_start();
+  rec->from_instruction_start = from->instruction_start();
+  rec->to_instruction_start = to->instruction_start();
   DispatchCodeEvent(evt_rec);
 }
 
-void ProfilerListener::BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) {
+void ProfilerListener::BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                                         Tagged<BytecodeArray> to) {
   DisallowGarbageCollection no_gc;
   CodeEventsContainer evt_rec(CodeEventRecord::Type::kCodeMove);
   CodeMoveEventRecord* rec = &evt_rec.CodeMoveEventRecord_;
-  rec->from_instruction_start = from.GetFirstBytecodeAddress();
-  rec->to_instruction_start = to.GetFirstBytecodeAddress();
+  rec->from_instruction_start = from->GetFirstBytecodeAddress();
+  rec->to_instruction_start = to->GetFirstBytecodeAddress();
   DispatchCodeEvent(evt_rec);
 }
 
@@ -336,7 +337,7 @@ void ProfilerListener::CodeDeoptEvent(Handle<Code> code, DeoptimizeKind kind,
   CodeEventsContainer evt_rec(CodeEventRecord::Type::kCodeDeopt);
   CodeDeoptEventRecord* rec = &evt_rec.CodeDeoptEventRecord_;
   Deoptimizer::DeoptInfo info = Deoptimizer::GetDeoptInfo(*code, pc);
-  rec->instruction_start = code->InstructionStart();
+  rec->instruction_start = code->instruction_start();
   rec->deopt_reason = DeoptimizeReasonToString(info.deopt_reason);
   rec->deopt_id = info.deopt_id;
   rec->pc = pc;
@@ -367,19 +368,21 @@ const char* ProfilerListener::GetName(base::Vector<const char> name) {
   return GetName(null_terminated.begin());
 }
 
-Name ProfilerListener::InferScriptName(Name name, SharedFunctionInfo info) {
-  if (name.IsString() && String::cast(name).length()) return name;
-  if (!info.script().IsScript()) return name;
-  Object source_url = Script::cast(info.script()).source_url();
-  return source_url.IsName() ? Name::cast(source_url) : name;
+Tagged<Name> ProfilerListener::InferScriptName(
+    Tagged<Name> name, Tagged<SharedFunctionInfo> info) {
+  if (IsString(name) && String::cast(name)->length()) return name;
+  if (!IsScript(info->script())) return name;
+  Tagged<Object> source_url = Script::cast(info->script())->source_url();
+  return IsName(source_url) ? Name::cast(source_url) : name;
 }
 
-const char* ProfilerListener::GetFunctionName(SharedFunctionInfo shared) {
+const char* ProfilerListener::GetFunctionName(
+    Tagged<SharedFunctionInfo> shared) {
   switch (naming_mode_) {
     case kDebugNaming:
-      return GetName(shared.DebugNameCStr().get());
+      return GetName(shared->DebugNameCStr().get());
     case kStandardNaming:
-      return GetName(shared.Name());
+      return GetName(shared->Name());
     default:
       UNREACHABLE();
   }
diff --git a/deps/v8/src/profiler/profiler-listener.h b/deps/v8/src/profiler/profiler-listener.h
index eec7b08bfa82a9..a3dab7ea929dd1 100644
--- a/deps/v8/src/profiler/profiler-listener.h
+++ b/deps/v8/src/profiler/profiler-listener.h
@@ -56,8 +56,10 @@ class V8_EXPORT_PRIVATE ProfilerListener : public LogEventListener,
   void SetterCallbackEvent(Handle<Name> name, Address entry_point) override;
   void RegExpCodeCreateEvent(Handle<AbstractCode> code,
                              Handle<String> source) override;
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) override;
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) override;
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) override;
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                         Tagged<BytecodeArray> to) override;
   void SharedFunctionInfoMoveEvent(Address from, Address to) override {}
   void NativeContextMoveEvent(Address from, Address to) override;
   void CodeMovingGCEvent() override {}
@@ -92,10 +94,11 @@ class V8_EXPORT_PRIVATE ProfilerListener : public LogEventListener,
   void set_observer(CodeEventObserver* observer) { observer_ = observer; }
 
  private:
-  const char* GetFunctionName(SharedFunctionInfo);
+  const char* GetFunctionName(Tagged<SharedFunctionInfo>);
 
   void AttachDeoptInlinedFrames(Handle<Code> code, CodeDeoptEventRecord* rec);
-  Name InferScriptName(Name name, SharedFunctionInfo info);
+  Tagged<Name> InferScriptName(Tagged<Name> name,
+                               Tagged<SharedFunctionInfo> info);
   V8_INLINE void DispatchCodeEvent(const CodeEventsContainer& evt_rec) {
     observer_->CodeEventHandler(evt_rec);
   }
diff --git a/deps/v8/src/profiler/sampling-heap-profiler.cc b/deps/v8/src/profiler/sampling-heap-profiler.cc
index c06395125b4176..9da56aa3ea51b6 100644
--- a/deps/v8/src/profiler/sampling-heap-profiler.cc
+++ b/deps/v8/src/profiler/sampling-heap-profiler.cc
@@ -75,18 +75,18 @@ void SamplingHeapProfiler::SampleObject(Address soon_object, size_t size) {
   DisallowGarbageCollection no_gc;
 
   // Check if the area is iterable by confirming that it starts with a map.
-  DCHECK(HeapObject::FromAddress(soon_object).map(isolate_).IsMap(isolate_));
+  DCHECK(IsMap(HeapObject::FromAddress(soon_object)->map(isolate_), isolate_));
 
   HandleScope scope(isolate_);
-  HeapObject heap_object = HeapObject::FromAddress(soon_object);
+  Tagged<HeapObject> heap_object = HeapObject::FromAddress(soon_object);
   Handle<Object> obj(heap_object, isolate_);
 
   // Since soon_object can be in code space we can't use v8::Utils::ToLocal.
   DCHECK(obj.is_null() ||
-         (obj->IsSmi() ||
+         (IsSmi(*obj) ||
           (V8_EXTERNAL_CODE_SPACE_BOOL && IsCodeSpaceObject(heap_object)) ||
-          !obj->IsTheHole()));
-  Local<v8::Value> loc(reinterpret_cast<v8::Value*>(obj.location()));
+          !IsTheHole(*obj)));
+  auto loc = Local<v8::Value>::FromSlot(obj.location());
 
   AllocationNode* node = AddStack();
   node->allocations_[size]++;
@@ -160,8 +160,8 @@ SamplingHeapProfiler::AllocationNode* SamplingHeapProfiler::AddStack() {
     // closure on the stack. Skip over any such frames (they'll be
     // in the top frames of the stack). The allocations made in this
     // sensitive moment belong to the formerly optimized frame anyway.
-    if (frame->unchecked_function().IsJSFunction()) {
-      SharedFunctionInfo shared = frame->function().shared();
+    if (IsJSFunction(frame->unchecked_function())) {
+      Tagged<SharedFunctionInfo> shared = frame->function()->shared();
       stack.push_back(shared);
       frames_captured++;
     } else {
@@ -207,14 +207,14 @@ SamplingHeapProfiler::AllocationNode* SamplingHeapProfiler::AddStack() {
   // We need to process the stack in reverse order as the top of the stack is
   // the first element in the list.
   for (auto it = stack.rbegin(); it != stack.rend(); ++it) {
-    SharedFunctionInfo shared = *it;
-    const char* name = this->names()->GetCopy(shared.DebugNameCStr().get());
+    Tagged<SharedFunctionInfo> shared = *it;
+    const char* name = this->names()->GetCopy(shared->DebugNameCStr().get());
     int script_id = v8::UnboundScript::kNoScriptId;
-    if (shared.script().IsScript()) {
-      Script script = Script::cast(shared.script());
-      script_id = script.id();
+    if (IsScript(shared->script())) {
+      Tagged<Script> script = Script::cast(shared->script());
+      script_id = script->id();
     }
-    node = FindOrAddChildNode(node, name, script_id, shared.StartPosition());
+    node = FindOrAddChildNode(node, name, script_id, shared->StartPosition());
   }
 
   if (found_arguments_marker_frames) {
@@ -241,13 +241,15 @@ v8::AllocationProfile::Node* SamplingHeapProfiler::TranslateAllocationNode(
     auto script_iterator = scripts.find(node->script_id_);
     if (script_iterator != scripts.end()) {
       Handle<Script> script = script_iterator->second;
-      if (script->name().IsName()) {
-        Name name = Name::cast(script->name());
+      if (IsName(script->name())) {
+        Tagged<Name> name = Name::cast(script->name());
         script_name = ToApiHandle<v8::String>(
             isolate_->factory()->InternalizeUtf8String(names_->GetName(name)));
       }
-      line = 1 + Script::GetLineNumber(script, node->script_position_);
-      column = 1 + Script::GetColumnNumber(script, node->script_position_);
+      Script::PositionInfo pos_info;
+      Script::GetPositionInfo(script, node->script_position_, &pos_info);
+      line = pos_info.line + 1;
+      column = pos_info.column + 1;
     }
   }
   for (auto alloc : node->allocations_) {
@@ -275,16 +277,16 @@ v8::AllocationProfile::Node* SamplingHeapProfiler::TranslateAllocationNode(
 v8::AllocationProfile* SamplingHeapProfiler::GetAllocationProfile() {
   if (flags_ & v8::HeapProfiler::kSamplingForceGC) {
     isolate_->heap()->CollectAllGarbage(
-        Heap::kNoGCFlags, GarbageCollectionReason::kSamplingProfiler);
+        GCFlag::kNoFlags, GarbageCollectionReason::kSamplingProfiler);
   }
   // To resolve positions to line/column numbers, we will need to look up
   // scripts. Build a map to allow fast mapping from script id to script.
   std::map<int, Handle<Script>> scripts;
   {
     Script::Iterator iterator(isolate_);
-    for (Script script = iterator.Next(); !script.is_null();
+    for (Tagged<Script> script = iterator.Next(); !script.is_null();
          script = iterator.Next()) {
-      scripts[script.id()] = handle(script, isolate_);
+      scripts[script->id()] = handle(script, isolate_);
     }
   }
   auto profile = new v8::internal::AllocationProfile();
diff --git a/deps/v8/src/profiler/strings-storage.cc b/deps/v8/src/profiler/strings-storage.cc
index a1bae849bcb878..c9b4e44874c725 100644
--- a/deps/v8/src/profiler/strings-storage.cc
+++ b/deps/v8/src/profiler/strings-storage.cc
@@ -6,6 +6,7 @@
 
 #include <memory>
 
+#include "src/base/bits.h"
 #include "src/base/strings.h"
 #include "src/objects/objects-inl.h"
 #include "src/utils/allocation.h"
@@ -76,16 +77,16 @@ const char* StringsStorage::GetVFormatted(const char* format, va_list args) {
   return AddOrDisposeString(str.begin(), len);
 }
 
-const char* StringsStorage::GetSymbol(Symbol sym) {
-  if (!sym.description().IsString()) {
+const char* StringsStorage::GetSymbol(Tagged<Symbol> sym) {
+  if (!IsString(sym->description())) {
     return "<symbol>";
   }
-  String description = String::cast(sym.description());
+  Tagged<String> description = String::cast(sym->description());
   int length = std::min(v8_flags.heap_snapshot_string_limit.value(),
-                        description.length());
-  auto data = description.ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL, 0,
-                                    length, &length);
-  if (sym.is_private_name()) {
+                        description->length());
+  auto data = description->ToCString(DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL, 0,
+                                     length, &length);
+  if (sym->is_private_name()) {
     return AddOrDisposeString(data.release(), length);
   }
   auto str_length = 8 + length + 1 + 1;
@@ -94,16 +95,16 @@ const char* StringsStorage::GetSymbol(Symbol sym) {
   return AddOrDisposeString(str_result, str_length - 1);
 }
 
-const char* StringsStorage::GetName(Name name) {
-  if (name.IsString()) {
-    String str = String::cast(name);
+const char* StringsStorage::GetName(Tagged<Name> name) {
+  if (IsString(name)) {
+    Tagged<String> str = String::cast(name);
     int length =
-        std::min(v8_flags.heap_snapshot_string_limit.value(), str.length());
+        std::min(v8_flags.heap_snapshot_string_limit.value(), str->length());
     int actual_length = 0;
-    std::unique_ptr<char[]> data = str.ToCString(
+    std::unique_ptr<char[]> data = str->ToCString(
         DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL, 0, length, &actual_length);
     return AddOrDisposeString(data.release(), actual_length);
-  } else if (name.IsSymbol()) {
+  } else if (IsSymbol(name)) {
     return GetSymbol(Symbol::cast(name));
   }
   return "";
@@ -113,13 +114,13 @@ const char* StringsStorage::GetName(int index) {
   return GetFormatted("%d", index);
 }
 
-const char* StringsStorage::GetConsName(const char* prefix, Name name) {
-  if (name.IsString()) {
-    String str = String::cast(name);
+const char* StringsStorage::GetConsName(const char* prefix, Tagged<Name> name) {
+  if (IsString(name)) {
+    Tagged<String> str = String::cast(name);
     int length =
-        std::min(v8_flags.heap_snapshot_string_limit.value(), str.length());
+        std::min(v8_flags.heap_snapshot_string_limit.value(), str->length());
     int actual_length = 0;
-    std::unique_ptr<char[]> data = str.ToCString(
+    std::unique_ptr<char[]> data = str->ToCString(
         DISALLOW_NULLS, ROBUST_STRING_TRAVERSAL, 0, length, &actual_length);
 
     int cons_length = actual_length + static_cast<int>(strlen(prefix)) + 1;
@@ -127,7 +128,7 @@ const char* StringsStorage::GetConsName(const char* prefix, Name name) {
     snprintf(cons_result, cons_length, "%s%s", prefix, data.get());
 
     return AddOrDisposeString(cons_result, cons_length - 1);
-  } else if (name.IsSymbol()) {
+  } else if (IsSymbol(name)) {
     return GetSymbol(Symbol::cast(name));
   }
   return "";
@@ -136,8 +137,8 @@ const char* StringsStorage::GetConsName(const char* prefix, Name name) {
 namespace {
 
 inline uint32_t ComputeStringHash(const char* str, int len) {
-  uint32_t raw_hash_field =
-      StringHasher::HashSequentialString(str, len, kZeroHashSeed);
+  uint32_t raw_hash_field = base::bits::RotateLeft32(
+      StringHasher::HashSequentialString(str, len, kZeroHashSeed), 2);
   return Name::HashBits::decode(raw_hash_field);
 }
 
diff --git a/deps/v8/src/profiler/strings-storage.h b/deps/v8/src/profiler/strings-storage.h
index 1d4c2e44d2a914..e5f7749aa25e58 100644
--- a/deps/v8/src/profiler/strings-storage.h
+++ b/deps/v8/src/profiler/strings-storage.h
@@ -33,12 +33,12 @@ class V8_EXPORT_PRIVATE StringsStorage {
   // Returns a formatted string, de-duplicated via the storage.
   PRINTF_FORMAT(2, 3) const char* GetFormatted(const char* format, ...);
   // Returns a stored string resulting from name, or "<symbol>" for a symbol.
-  const char* GetName(Name name);
+  const char* GetName(Tagged<Name> name);
   // Returns the string representation of the int from the store.
   const char* GetName(int index);
   // Appends string resulting from name to prefix, then returns the stored
   // result.
-  const char* GetConsName(const char* prefix, Name name);
+  const char* GetConsName(const char* prefix, Tagged<Name> name);
   // Reduces the refcount of the given string, freeing it if no other
   // references are made to it. Returns true if the string was successfully
   // unref'd, or false if the string was not present in the table.
@@ -61,7 +61,7 @@ class V8_EXPORT_PRIVATE StringsStorage {
   base::CustomMatcherHashMap::Entry* GetEntry(const char* str, int len);
   PRINTF_FORMAT(2, 0)
   const char* GetVFormatted(const char* format, va_list args);
-  const char* GetSymbol(Symbol sym);
+  const char* GetSymbol(Tagged<Symbol> sym);
 
   base::CustomMatcherHashMap names_;
   base::Mutex mutex_;
diff --git a/deps/v8/src/profiler/tick-sample.cc b/deps/v8/src/profiler/tick-sample.cc
index 172b004ef5c739..85546e215e5a06 100644
--- a/deps/v8/src/profiler/tick-sample.cc
+++ b/deps/v8/src/profiler/tick-sample.cc
@@ -32,7 +32,7 @@ bool IsSamePage(i::Address ptr1, i::Address ptr2) {
 bool IsNoFrameRegion(i::Address address) {
   struct Pattern {
     int bytes_count;
-    i::byte bytes[8];
+    uint8_t bytes[8];
     int offsets[4];
   };
   static Pattern patterns[] = {
@@ -59,7 +59,7 @@ bool IsNoFrameRegion(i::Address address) {
 #endif
     {0, {}, {}}
   };
-  i::byte* pc = reinterpret_cast<i::byte*>(address);
+  uint8_t* pc = reinterpret_cast<uint8_t*>(address);
   for (Pattern* pattern = patterns; pattern->bytes_count; ++pattern) {
     for (int* offset_ptr = pattern->offsets; *offset_ptr != -1; ++offset_ptr) {
       int offset = *offset_ptr;
@@ -210,6 +210,10 @@ DISABLE_ASAN void TickSample::Init(Isolate* v8_isolate,
   timestamp = base::TimeTicks::Now();
 }
 
+// IMPORTANT: 'GetStackSample' is sensitive to stack overflows. For this reason
+// we try not to use any function/method marked as V8_EXPORT_PRIVATE with their
+// only use-site in 'GetStackSample': The resulting linker stub needs quite
+// a bit of stack space and has caused stack overflow crashes in the past.
 bool TickSample::GetStackSample(Isolate* v8_isolate, RegisterState* regs,
                                 RecordCEntryFrame record_c_entry_frame,
                                 void** frames, size_t frames_limit,
@@ -233,10 +237,10 @@ bool TickSample::GetStackSample(Isolate* v8_isolate, RegisterState* regs,
     sample_info->embedder_state = embedder_state->GetState();
   }
 
-  Context top_context = isolate->context();
+  Tagged<Context> top_context = isolate->context();
   if (top_context.ptr() != i::Context::kNoContext &&
       top_context.ptr() != i::Context::kInvalidContext) {
-    NativeContext top_native_context = top_context.native_context();
+    Tagged<NativeContext> top_native_context = top_context->native_context();
     sample_info->context = reinterpret_cast<void*>(top_native_context.ptr());
   }
 
@@ -313,8 +317,16 @@ bool TickSample::GetStackSample(Isolate* v8_isolate, RegisterState* regs,
   if (record_c_entry_frame == kIncludeCEntryFrame &&
       (it.top_frame_type() == internal::StackFrame::EXIT ||
        it.top_frame_type() == internal::StackFrame::BUILTIN_EXIT)) {
-    frames[i] = reinterpret_cast<void*>(isolate->c_function());
-    i++;
+    // While BUILTIN_EXIT definitely represents a call to CEntry the EXIT frame
+    // might represent either a call to CEntry or an optimized call to
+    // Api callback. In the latter case the ExternalCallbackScope points to
+    // the same function, so skip adding a frame in that case in order to avoid
+    // double-reporting.
+    void* c_function = reinterpret_cast<void*>(isolate->c_function());
+    if (sample_info->external_callback_entry != c_function) {
+      frames[i] = c_function;
+      i++;
+    }
   }
 #ifdef V8_RUNTIME_CALL_STATS
   i::RuntimeCallTimer* timer =
diff --git a/deps/v8/src/profiler/tick-sample.h b/deps/v8/src/profiler/tick-sample.h
index 236e4a2f865e94..381737aa389a87 100644
--- a/deps/v8/src/profiler/tick-sample.h
+++ b/deps/v8/src/profiler/tick-sample.h
@@ -21,14 +21,7 @@ struct V8_EXPORT TickSample {
   // samples don't care.
   enum RecordCEntryFrame { kIncludeCEntryFrame, kSkipCEntryFrame };
 
-  TickSample()
-      : state(OTHER),
-        embedder_state(EmbedderStateTag::EMPTY),
-        pc(nullptr),
-        external_callback_entry(nullptr),
-        frames_count(0),
-        has_external_callback(false),
-        update_stats_(true) {}
+  TickSample() {}
 
   /**
    * Initialize a tick sample from the isolate.
@@ -82,24 +75,30 @@ struct V8_EXPORT TickSample {
 
   void print() const;
 
-  StateTag state;  // The state of the VM.
-  EmbedderStateTag embedder_state;
-  void* pc;        // Instruction pointer.
+  static constexpr unsigned kMaxFramesCountLog2 = 8;
+  static constexpr unsigned kMaxFramesCount = (1 << kMaxFramesCountLog2) - 1;
+
+  void* pc = nullptr;  // Instruction pointer.
   union {
     void* tos;  // Top stack value (*sp).
-    void* external_callback_entry;
+    void* external_callback_entry = nullptr;
   };
-  static const unsigned kMaxFramesCountLog2 = 8;
-  static const unsigned kMaxFramesCount = (1 << kMaxFramesCountLog2) - 1;
-  void* stack[kMaxFramesCount];     // Call stack.
   void* context = nullptr;          // Address of the incumbent native context.
   void* embedder_context = nullptr;  // Address of the embedder native context.
-  unsigned frames_count : kMaxFramesCountLog2;  // Number of captured frames.
-  bool has_external_callback : 1;
-  bool update_stats_ : 1;  // Whether the sample should update aggregated stats.
 
   base::TimeTicks timestamp;
   base::TimeDelta sampling_interval_;  // Sampling interval used to capture.
+
+  StateTag state = OTHER;  // The state of the VM.
+  EmbedderStateTag embedder_state = EmbedderStateTag::EMPTY;
+
+  uint16_t frames_count = 0;  // Number of captured frames.
+  static_assert(sizeof(frames_count) * kBitsPerByte >= kMaxFramesCountLog2);
+  bool has_external_callback = false;
+  // Whether the sample should update aggregated stats.
+  bool update_stats_ = true;
+
+  void* stack[kMaxFramesCount];  // Call stack.
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/profiler/tracing-cpu-profiler.cc b/deps/v8/src/profiler/tracing-cpu-profiler.cc
index 6d341282e437b8..766222f4019356 100644
--- a/deps/v8/src/profiler/tracing-cpu-profiler.cc
+++ b/deps/v8/src/profiler/tracing-cpu-profiler.cc
@@ -51,6 +51,18 @@ void TracingCpuProfilerImpl::OnTraceEnabled() {
       this);
 }
 
+namespace {
+class RunInterruptsTask : public v8::Task {
+ public:
+  explicit RunInterruptsTask(v8::internal::Isolate* isolate)
+      : isolate_(isolate) {}
+  void Run() override { isolate_->stack_guard()->HandleInterrupts(); }
+
+ private:
+  v8::internal::Isolate* isolate_;
+};
+}  // namespace
+
 #if defined(V8_USE_PERFETTO)
 void TracingCpuProfilerImpl::OnStop(const perfetto::DataSourceBase::StopArgs&) {
 #else
@@ -64,6 +76,12 @@ void TracingCpuProfilerImpl::OnTraceDisabled() {
         reinterpret_cast<TracingCpuProfilerImpl*>(data)->StopProfiling();
       },
       this);
+  // It could be a long time until the Isolate next runs any JS which could be
+  // interrupted, and we'd rather not leave the sampler thread running during
+  // that time, so also post a task to run any interrupts.
+  V8::GetCurrentPlatform()
+      ->GetForegroundTaskRunner(reinterpret_cast<v8::Isolate*>(isolate_))
+      ->PostTask(std::make_unique<RunInterruptsTask>(isolate_));
 }
 
 void TracingCpuProfilerImpl::StartProfiling() {
diff --git a/deps/v8/src/regexp/arm/regexp-macro-assembler-arm.cc b/deps/v8/src/regexp/arm/regexp-macro-assembler-arm.cc
index 89d3ea62529e53..fa2e345c53e2f6 100644
--- a/deps/v8/src/regexp/arm/regexp-macro-assembler-arm.cc
+++ b/deps/v8/src/regexp/arm/regexp-macro-assembler-arm.cc
@@ -892,19 +892,18 @@ Handle<HeapObject> RegExpMacroAssemblerARM::GetCode(Handle<String> source) {
       __ add(r2, r2, Operand(num_saved_registers_ * kSystemPointerSize));
       __ str(r2, MemOperand(frame_pointer(), kRegisterOutputOffset));
 
-      // Prepare r0 to initialize registers with its value in the next run.
-      __ ldr(r0, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
-
       // Restore the original regexp stack pointer value (effectively, pop the
       // stored base pointer).
       PopRegExpBasePointer(backtrack_stackpointer(), r2);
 
+      Label reload_string_start_minus_one;
+
       if (global_with_zero_length_check()) {
         // Special case for zero-length matches.
         // r4: capture start index
         __ cmp(current_input_offset(), r4);
         // Not a zero-length match, restart.
-        __ b(ne, &load_char_start_regexp);
+        __ b(ne, &reload_string_start_minus_one);
         // Offset from the end is zero if we already reached the end.
         __ cmp(current_input_offset(), Operand::Zero());
         __ b(eq, &exit_label_);
@@ -916,6 +915,11 @@ Handle<HeapObject> RegExpMacroAssemblerARM::GetCode(Handle<String> source) {
         if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
       }
 
+      __ bind(&reload_string_start_minus_one);
+      // Prepare r0 to initialize registers with its value in the next run.
+      // Must be immediately before the jump to avoid clobbering.
+      __ ldr(r0, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
+
       __ b(&load_char_start_regexp);
     } else {
       __ mov(r0, Operand(SUCCESS));
@@ -1177,7 +1181,7 @@ void RegExpMacroAssemblerARM::CallCheckStackGuardState() {
   __ mov(ip, Operand(stack_guard_check));
 
   EmbeddedData d = EmbeddedData::FromBlob();
-  Address entry = d.InstructionStartOfBuiltin(Builtin::kDirectCEntry);
+  Address entry = d.InstructionStartOf(Builtin::kDirectCEntry);
   __ mov(lr, Operand(entry, RelocInfo::OFF_HEAP_TARGET));
   __ Call(lr);
 
@@ -1206,7 +1210,7 @@ static T* frame_entry_address(Address re_frame, int frame_offset) {
 int RegExpMacroAssemblerARM::CheckStackGuardState(Address* return_address,
                                                   Address raw_code,
                                                   Address re_frame) {
-  InstructionStream re_code = InstructionStream::cast(Object(raw_code));
+  Tagged<InstructionStream> re_code = InstructionStream::cast(Object(raw_code));
   return NativeRegExpMacroAssembler::CheckStackGuardState(
       frame_entry<Isolate*>(re_frame, kIsolateOffset),
       frame_entry<int>(re_frame, kStartIndexOffset),
@@ -1214,8 +1218,8 @@ int RegExpMacroAssemblerARM::CheckStackGuardState(Address* return_address,
           frame_entry<int>(re_frame, kDirectCallOffset)),
       return_address, re_code,
       frame_entry_address<Address>(re_frame, kInputStringOffset),
-      frame_entry_address<const byte*>(re_frame, kInputStartOffset),
-      frame_entry_address<const byte*>(re_frame, kInputEndOffset));
+      frame_entry_address<const uint8_t*>(re_frame, kInputStartOffset),
+      frame_entry_address<const uint8_t*>(re_frame, kInputEndOffset));
 }
 
 
diff --git a/deps/v8/src/regexp/arm64/regexp-macro-assembler-arm64.cc b/deps/v8/src/regexp/arm64/regexp-macro-assembler-arm64.cc
index fe1b0f6e041125..566b3f0ba7ba98 100644
--- a/deps/v8/src/regexp/arm64/regexp-macro-assembler-arm64.cc
+++ b/deps/v8/src/regexp/arm64/regexp-macro-assembler-arm64.cc
@@ -794,8 +794,8 @@ Handle<HeapObject> RegExpMacroAssemblerARM64::GetCode(Handle<String> source) {
   // Arguments on entry:
   // x0:  String   input
   // x1:  int      start_offset
-  // x2:  byte*    input_start
-  // x3:  byte*    input_end
+  // x2:  uint8_t*    input_start
+  // x3:  uint8_t*    input_end
   // x4:  int*     output array
   // x5:  int      output array size
   // x6:  int      direct_call
@@ -1432,8 +1432,8 @@ static T* frame_entry_address(Address re_frame, int frame_offset) {
 
 int RegExpMacroAssemblerARM64::CheckStackGuardState(
     Address* return_address, Address raw_code, Address re_frame,
-    int start_index, const byte** input_start, const byte** input_end) {
-  InstructionStream re_code = InstructionStream::cast(Object(raw_code));
+    int start_index, const uint8_t** input_start, const uint8_t** input_end) {
+  Tagged<InstructionStream> re_code = InstructionStream::cast(Object(raw_code));
   return NativeRegExpMacroAssembler::CheckStackGuardState(
       frame_entry<Isolate*>(re_frame, kIsolateOffset), start_index,
       static_cast<RegExp::CallOrigin>(
@@ -1443,7 +1443,6 @@ int RegExpMacroAssemblerARM64::CheckStackGuardState(
       input_end);
 }
 
-
 void RegExpMacroAssemblerARM64::CheckPosition(int cp_offset,
                                               Label* on_outside_input) {
   if (cp_offset >= 0) {
diff --git a/deps/v8/src/regexp/arm64/regexp-macro-assembler-arm64.h b/deps/v8/src/regexp/arm64/regexp-macro-assembler-arm64.h
index a5164472b71f90..86f4a6e20cacd1 100644
--- a/deps/v8/src/regexp/arm64/regexp-macro-assembler-arm64.h
+++ b/deps/v8/src/regexp/arm64/regexp-macro-assembler-arm64.h
@@ -94,8 +94,8 @@ class V8_EXPORT_PRIVATE RegExpMacroAssemblerARM64
   // {raw_code} is an Address because this is called via ExternalReference.
   static int CheckStackGuardState(Address* return_address, Address raw_code,
                                   Address re_frame, int start_offset,
-                                  const byte** input_start,
-                                  const byte** input_end);
+                                  const uint8_t** input_start,
+                                  const uint8_t** input_end);
 
  private:
   static constexpr int kFramePointerOffset = 0;
diff --git a/deps/v8/src/regexp/experimental/experimental-interpreter.cc b/deps/v8/src/regexp/experimental/experimental-interpreter.cc
index 095cbd3a103c13..f200b78f19466e 100644
--- a/deps/v8/src/regexp/experimental/experimental-interpreter.cc
+++ b/deps/v8/src/regexp/experimental/experimental-interpreter.cc
@@ -56,32 +56,32 @@ bool SatisfiesAssertion(RegExpAssertion::Type type,
 }
 
 base::Vector<RegExpInstruction> ToInstructionVector(
-    ByteArray raw_bytes, const DisallowGarbageCollection& no_gc) {
+    Tagged<ByteArray> raw_bytes, const DisallowGarbageCollection& no_gc) {
   RegExpInstruction* inst_begin =
-      reinterpret_cast<RegExpInstruction*>(raw_bytes.GetDataStartAddress());
-  int inst_num = raw_bytes.length() / sizeof(RegExpInstruction);
-  DCHECK_EQ(sizeof(RegExpInstruction) * inst_num, raw_bytes.length());
+      reinterpret_cast<RegExpInstruction*>(raw_bytes->GetDataStartAddress());
+  int inst_num = raw_bytes->length() / sizeof(RegExpInstruction);
+  DCHECK_EQ(sizeof(RegExpInstruction) * inst_num, raw_bytes->length());
   return base::Vector<RegExpInstruction>(inst_begin, inst_num);
 }
 
 template <class Character>
 base::Vector<const Character> ToCharacterVector(
-    String str, const DisallowGarbageCollection& no_gc);
+    Tagged<String> str, const DisallowGarbageCollection& no_gc);
 
 template <>
 base::Vector<const uint8_t> ToCharacterVector<uint8_t>(
-    String str, const DisallowGarbageCollection& no_gc) {
-  DCHECK(str.IsFlat());
-  String::FlatContent content = str.GetFlatContent(no_gc);
+    Tagged<String> str, const DisallowGarbageCollection& no_gc) {
+  DCHECK(str->IsFlat());
+  String::FlatContent content = str->GetFlatContent(no_gc);
   DCHECK(content.IsOneByte());
   return content.ToOneByteVector();
 }
 
 template <>
 base::Vector<const base::uc16> ToCharacterVector<base::uc16>(
-    String str, const DisallowGarbageCollection& no_gc) {
-  DCHECK(str.IsFlat());
-  String::FlatContent content = str.GetFlatContent(no_gc);
+    Tagged<String> str, const DisallowGarbageCollection& no_gc) {
+  DCHECK(str->IsFlat());
+  String::FlatContent content = str->GetFlatContent(no_gc);
   DCHECK(content.IsTwoByte());
   return content.ToUC16Vector();
 }
@@ -137,8 +137,8 @@ class NfaInterpreter {
   // ACCEPTing thread with highest priority.
  public:
   NfaInterpreter(Isolate* isolate, RegExp::CallOrigin call_origin,
-                 ByteArray bytecode, int register_count_per_match, String input,
-                 int32_t input_index, Zone* zone)
+                 Tagged<ByteArray> bytecode, int register_count_per_match,
+                 Tagged<String> input, int32_t input_index, Zone* zone)
       : isolate_(isolate),
         call_origin_(call_origin),
         bytecode_object_(bytecode),
@@ -147,8 +147,8 @@ class NfaInterpreter {
         input_object_(input),
         input_(ToCharacterVector<Character>(input, no_gc_)),
         input_index_(input_index),
-        pc_last_input_index_(zone->NewArray<int>(bytecode.length()),
-                             bytecode.length()),
+        pc_last_input_index_(zone->AllocateArray<int>(bytecode->length()),
+                             bytecode->length()),
         active_threads_(0, zone),
         blocked_threads_(0, zone),
         register_array_allocator_(zone),
@@ -256,12 +256,12 @@ class NfaInterpreter {
         const bool was_one_byte =
             String::IsOneByteRepresentationUnderneath(input_object_);
 
-        Object result;
+        Tagged<Object> result;
         {
           AllowGarbageCollection yes_gc;
           result = isolate_->stack_guard()->HandleInterrupts();
         }
-        if (result.IsException(isolate_)) {
+        if (IsException(result, isolate_)) {
           return RegExp::kInternalRegExpException;
         }
 
@@ -557,19 +557,20 @@ class NfaInterpreter {
 }  // namespace
 
 int ExperimentalRegExpInterpreter::FindMatches(
-    Isolate* isolate, RegExp::CallOrigin call_origin, ByteArray bytecode,
-    int register_count_per_match, String input, int start_index,
-    int32_t* output_registers, int output_register_count, Zone* zone) {
-  DCHECK(input.IsFlat());
+    Isolate* isolate, RegExp::CallOrigin call_origin,
+    Tagged<ByteArray> bytecode, int register_count_per_match,
+    Tagged<String> input, int start_index, int32_t* output_registers,
+    int output_register_count, Zone* zone) {
+  DCHECK(input->IsFlat());
   DisallowGarbageCollection no_gc;
 
-  if (input.GetFlatContent(no_gc).IsOneByte()) {
+  if (input->GetFlatContent(no_gc).IsOneByte()) {
     NfaInterpreter<uint8_t> interpreter(isolate, call_origin, bytecode,
                                         register_count_per_match, input,
                                         start_index, zone);
     return interpreter.FindMatches(output_registers, output_register_count);
   } else {
-    DCHECK(input.GetFlatContent(no_gc).IsTwoByte());
+    DCHECK(input->GetFlatContent(no_gc).IsTwoByte());
     NfaInterpreter<base::uc16> interpreter(isolate, call_origin, bytecode,
                                            register_count_per_match, input,
                                            start_index, zone);
diff --git a/deps/v8/src/regexp/experimental/experimental-interpreter.h b/deps/v8/src/regexp/experimental/experimental-interpreter.h
index a21b01639a45ee..6fa4f04334a142 100644
--- a/deps/v8/src/regexp/experimental/experimental-interpreter.h
+++ b/deps/v8/src/regexp/experimental/experimental-interpreter.h
@@ -24,9 +24,10 @@ class ExperimentalRegExpInterpreter final : public AllStatic {
   // are written to `matches_out`.  Provided in variants for one-byte and
   // two-byte strings.
   static int FindMatches(Isolate* isolate, RegExp::CallOrigin call_origin,
-                         ByteArray bytecode, int capture_count, String input,
-                         int start_index, int32_t* output_registers,
-                         int output_register_count, Zone* zone);
+                         Tagged<ByteArray> bytecode, int capture_count,
+                         Tagged<String> input, int start_index,
+                         int32_t* output_registers, int output_register_count,
+                         Zone* zone);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/regexp/experimental/experimental.cc b/deps/v8/src/regexp/experimental/experimental.cc
index 8bbf32265e7d64..83b64b62840b53 100644
--- a/deps/v8/src/regexp/experimental/experimental.cc
+++ b/deps/v8/src/regexp/experimental/experimental.cc
@@ -123,20 +123,21 @@ bool ExperimentalRegExp::Compile(Isolate* isolate, Handle<JSRegExp> re) {
   return true;
 }
 
-base::Vector<RegExpInstruction> AsInstructionSequence(ByteArray raw_bytes) {
+base::Vector<RegExpInstruction> AsInstructionSequence(
+    Tagged<ByteArray> raw_bytes) {
   RegExpInstruction* inst_begin =
-      reinterpret_cast<RegExpInstruction*>(raw_bytes.GetDataStartAddress());
-  int inst_num = raw_bytes.length() / sizeof(RegExpInstruction);
-  DCHECK_EQ(sizeof(RegExpInstruction) * inst_num, raw_bytes.length());
+      reinterpret_cast<RegExpInstruction*>(raw_bytes->GetDataStartAddress());
+  int inst_num = raw_bytes->length() / sizeof(RegExpInstruction);
+  DCHECK_EQ(sizeof(RegExpInstruction) * inst_num, raw_bytes->length());
   return base::Vector<RegExpInstruction>(inst_begin, inst_num);
 }
 
 namespace {
 
 int32_t ExecRawImpl(Isolate* isolate, RegExp::CallOrigin call_origin,
-                    ByteArray bytecode, String subject, int capture_count,
-                    int32_t* output_registers, int32_t output_register_count,
-                    int32_t subject_index) {
+                    Tagged<ByteArray> bytecode, Tagged<String> subject,
+                    int capture_count, int32_t* output_registers,
+                    int32_t output_register_count, int32_t subject_index) {
   DisallowGarbageCollection no_gc;
   // TODO(cbruni): remove once gcmole is fixed.
   DisableGCMole no_gc_mole;
@@ -145,39 +146,34 @@ int32_t ExecRawImpl(Isolate* isolate, RegExp::CallOrigin call_origin,
       JSRegExp::RegistersForCaptureCount(capture_count);
 
   int32_t result;
-  do {
-    DCHECK(subject.IsFlat());
-    Zone zone(isolate->allocator(), ZONE_NAME);
-    result = ExperimentalRegExpInterpreter::FindMatches(
-        isolate, call_origin, bytecode, register_count_per_match, subject,
-        subject_index, output_registers, output_register_count, &zone);
-  } while (result == RegExp::kInternalRegExpRetry &&
-           call_origin == RegExp::kFromRuntime);
+  DCHECK(subject->IsFlat());
+  Zone zone(isolate->allocator(), ZONE_NAME);
+  result = ExperimentalRegExpInterpreter::FindMatches(
+      isolate, call_origin, bytecode, register_count_per_match, subject,
+      subject_index, output_registers, output_register_count, &zone);
   return result;
 }
 
 }  // namespace
 
 // Returns the number of matches.
-int32_t ExperimentalRegExp::ExecRaw(Isolate* isolate,
-                                    RegExp::CallOrigin call_origin,
-                                    JSRegExp regexp, String subject,
-                                    int32_t* output_registers,
-                                    int32_t output_register_count,
-                                    int32_t subject_index) {
+int32_t ExperimentalRegExp::ExecRaw(
+    Isolate* isolate, RegExp::CallOrigin call_origin, Tagged<JSRegExp> regexp,
+    Tagged<String> subject, int32_t* output_registers,
+    int32_t output_register_count, int32_t subject_index) {
   DCHECK(v8_flags.enable_experimental_regexp_engine);
   DisallowGarbageCollection no_gc;
 
   if (v8_flags.trace_experimental_regexp_engine) {
-    StdoutStream{} << "Executing experimental regexp " << regexp.source()
+    StdoutStream{} << "Executing experimental regexp " << regexp->source()
                    << std::endl;
   }
 
   static constexpr bool kIsLatin1 = true;
-  ByteArray bytecode = ByteArray::cast(regexp.bytecode(kIsLatin1));
+  Tagged<ByteArray> bytecode = ByteArray::cast(regexp->bytecode(kIsLatin1));
 
   return ExecRawImpl(isolate, call_origin, bytecode, subject,
-                     regexp.capture_count(), output_registers,
+                     regexp->capture_count(), output_registers,
                      output_register_count, subject_index);
 }
 
@@ -195,9 +191,9 @@ int32_t ExperimentalRegExp::MatchForCallFromJs(
   DisallowHandleAllocation no_handles;
   DisallowHandleDereference no_deref;
 
-  String subject_string = String::cast(Object(subject));
+  Tagged<String> subject_string = String::cast(Object(subject));
 
-  JSRegExp regexp_obj = JSRegExp::cast(Object(regexp));
+  Tagged<JSRegExp> regexp_obj = JSRegExp::cast(Object(regexp));
 
   return ExecRaw(isolate, RegExp::kFromJs, regexp_obj, subject_string,
                  output_registers, output_register_count, start_position);
@@ -234,26 +230,33 @@ MaybeHandle<Object> ExperimentalRegExp::Exec(
     output_registers_release.reset(output_registers);
   }
 
-  int num_matches =
-      ExecRaw(isolate, RegExp::kFromRuntime, *regexp, *subject,
-              output_registers, output_register_count, subject_index);
-
-  if (num_matches > 0) {
-    DCHECK_EQ(num_matches, 1);
-    if (exec_quirks == RegExp::ExecQuirks::kTreatMatchAtEndAsFailure) {
-      if (output_registers[0] >= subject->length()) {
-        return isolate->factory()->null_value();
+  do {
+    int num_matches =
+        ExecRaw(isolate, RegExp::kFromRuntime, *regexp, *subject,
+                output_registers, output_register_count, subject_index);
+
+    if (num_matches > 0) {
+      DCHECK_EQ(num_matches, 1);
+      if (exec_quirks == RegExp::ExecQuirks::kTreatMatchAtEndAsFailure) {
+        if (output_registers[0] >= subject->length()) {
+          return isolate->factory()->null_value();
+        }
       }
+      return RegExp::SetLastMatchInfo(isolate, last_match_info, subject,
+                                      capture_count, output_registers);
+    } else if (num_matches == 0) {
+      return isolate->factory()->null_value();
+    } else {
+      DCHECK_LT(num_matches, 0);
+      if (num_matches == RegExp::kInternalRegExpRetry) {
+        // Re-run execution.
+        continue;
+      }
+      DCHECK(isolate->has_pending_exception());
+      return MaybeHandle<Object>();
     }
-    return RegExp::SetLastMatchInfo(isolate, last_match_info, subject,
-                                    capture_count, output_registers);
-  } else if (num_matches == 0) {
-    return isolate->factory()->null_value();
-  } else {
-    DCHECK_LT(num_matches, 0);
-    DCHECK(isolate->has_pending_exception());
-    return MaybeHandle<Object>();
-  }
+  } while (true);
+  UNREACHABLE();
 }
 
 int32_t ExperimentalRegExp::OneshotExecRaw(Isolate* isolate,
@@ -299,25 +302,32 @@ MaybeHandle<Object> ExperimentalRegExp::OneshotExec(
     output_registers_release.reset(output_registers);
   }
 
-  int num_matches = OneshotExecRaw(isolate, regexp, subject, output_registers,
-                                   output_register_count, subject_index);
-
-  if (num_matches > 0) {
-    DCHECK_EQ(num_matches, 1);
-    if (exec_quirks == RegExp::ExecQuirks::kTreatMatchAtEndAsFailure) {
-      if (output_registers[0] >= subject->length()) {
-        return isolate->factory()->null_value();
+  do {
+    int num_matches = OneshotExecRaw(isolate, regexp, subject, output_registers,
+                                     output_register_count, subject_index);
+
+    if (num_matches > 0) {
+      DCHECK_EQ(num_matches, 1);
+      if (exec_quirks == RegExp::ExecQuirks::kTreatMatchAtEndAsFailure) {
+        if (output_registers[0] >= subject->length()) {
+          return isolate->factory()->null_value();
+        }
+      }
+      return RegExp::SetLastMatchInfo(isolate, last_match_info, subject,
+                                      capture_count, output_registers);
+    } else if (num_matches == 0) {
+      return isolate->factory()->null_value();
+    } else {
+      DCHECK_LT(num_matches, 0);
+      if (num_matches == RegExp::kInternalRegExpRetry) {
+        // Re-run execution.
+        continue;
       }
+      DCHECK(isolate->has_pending_exception());
+      return MaybeHandle<Object>();
     }
-    return RegExp::SetLastMatchInfo(isolate, last_match_info, subject,
-                                    capture_count, output_registers);
-  } else if (num_matches == 0) {
-    return isolate->factory()->null_value();
-  } else {
-    DCHECK_LT(num_matches, 0);
-    DCHECK(isolate->has_pending_exception());
-    return MaybeHandle<Object>();
-  }
+  } while (true);
+  UNREACHABLE();
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/regexp/experimental/experimental.h b/deps/v8/src/regexp/experimental/experimental.h
index cdc683e97e901b..ede9e6b2a25fb9 100644
--- a/deps/v8/src/regexp/experimental/experimental.h
+++ b/deps/v8/src/regexp/experimental/experimental.h
@@ -41,7 +41,7 @@ class ExperimentalRegExp final : public AllStatic {
       int index, Handle<RegExpMatchInfo> last_match_info,
       RegExp::ExecQuirks exec_quirks = RegExp::ExecQuirks::kNone);
   static int32_t ExecRaw(Isolate* isolate, RegExp::CallOrigin call_origin,
-                         JSRegExp regexp, String subject,
+                         Tagged<JSRegExp> regexp, Tagged<String> subject,
                          int32_t* output_registers,
                          int32_t output_register_count, int32_t subject_index);
 
diff --git a/deps/v8/src/regexp/gen-regexp-special-case.cc b/deps/v8/src/regexp/gen-regexp-special-case.cc
index 55618f1178358e..86f6b212c93cee 100644
--- a/deps/v8/src/regexp/gen-regexp-special-case.cc
+++ b/deps/v8/src/regexp/gen-regexp-special-case.cc
@@ -9,7 +9,6 @@
 
 #include "src/base/strings.h"
 #include "src/regexp/special-case.h"
-#include "unicode/usetiter.h"
 
 namespace v8 {
 namespace internal {
@@ -127,52 +126,6 @@ void PrintSpecial(std::ofstream& out) {
   PrintSet(out, "SpecialAddSet", special_add);
 }
 
-void PrintUnicodeSpecial(std::ofstream& out) {
-  icu::UnicodeSet non_simple_folding;
-  icu::UnicodeSet current;
-  UErrorCode status = U_ZERO_ERROR;
-  // Look at all characters except white spaces.
-  icu::UnicodeSet interestingCP(u"[^[:White_Space:]]", status);
-  CHECK_EQ(status, U_ZERO_ERROR);
-  icu::UnicodeSetIterator iter(interestingCP);
-  while (iter.next()) {
-    UChar32 c = iter.getCodepoint();
-    current.set(c, c);
-    current.closeOver(USET_CASE_INSENSITIVE).removeAllStrings();
-    CHECK(!current.isBogus());
-    // Remove characters from the closeover that have a simple case folding.
-    icu::UnicodeSet toRemove;
-    icu::UnicodeSetIterator closeOverIter(current);
-    while (closeOverIter.next()) {
-      UChar32 closeOverChar = closeOverIter.getCodepoint();
-      UChar32 closeOverSCF = u_foldCase(closeOverChar, U_FOLD_CASE_DEFAULT);
-      if (closeOverChar != closeOverSCF) {
-        toRemove.add(closeOverChar);
-      }
-    }
-    CHECK(!toRemove.isBogus());
-    current.removeAll(toRemove);
-
-    // The current character and its simple case folding are also always OK.
-    UChar32 scf = u_foldCase(c, U_FOLD_CASE_DEFAULT);
-    current.remove(c);
-    current.remove(scf);
-
-    // If there are any characters remaining, they were added due to full case
-    // foldings and shouldn't match the current charcter according to the spec.
-    if (!current.isEmpty()) {
-      // Ensure that the character doesn't have a simple case folding.
-      // Otherwise the current approach of simply removing the character from
-      // the set before calling closeOver won't work.
-      CHECK_EQ(c, scf);
-      non_simple_folding.add(c);
-    }
-  }
-  CHECK(!non_simple_folding.isBogus());
-
-  PrintSet(out, "UnicodeNonSimpleCloseOverSet", non_simple_folding);
-}
-
 void WriteHeader(const char* header_filename) {
   std::ofstream out(header_filename);
   out << std::hex << std::setfill('0') << std::setw(4);
@@ -193,7 +146,6 @@ void WriteHeader(const char* header_filename) {
       << "namespace internal {\n\n";
 
   PrintSpecial(out);
-  PrintUnicodeSpecial(out);
 
   out << "\n"
       << "}  // namespace internal\n"
diff --git a/deps/v8/src/regexp/ia32/regexp-macro-assembler-ia32.cc b/deps/v8/src/regexp/ia32/regexp-macro-assembler-ia32.cc
index 33f79d305026e8..6ca07a8ebff53c 100644
--- a/deps/v8/src/regexp/ia32/regexp-macro-assembler-ia32.cc
+++ b/deps/v8/src/regexp/ia32/regexp-macro-assembler-ia32.cc
@@ -937,19 +937,18 @@ Handle<HeapObject> RegExpMacroAssemblerIA32::GetCode(Handle<String> source) {
       __ add(Operand(ebp, kRegisterOutputOffset),
              Immediate(num_saved_registers_ * kSystemPointerSize));
 
-      // Prepare eax to initialize registers with its value in the next run.
-      __ mov(eax, Operand(ebp, kStringStartMinusOneOffset));
-
       // Restore the original regexp stack pointer value (effectively, pop the
       // stored base pointer).
       PopRegExpBasePointer(backtrack_stackpointer(), ebx);
 
+      Label reload_string_start_minus_one;
+
       if (global_with_zero_length_check()) {
         // Special case for zero-length matches.
         // edx: capture start index
         __ cmp(edi, edx);
         // Not a zero-length match, restart.
-        __ j(not_equal, &load_char_start_regexp);
+        __ j(not_equal, &reload_string_start_minus_one);
         // edi (offset from the end) is zero if we already reached the end.
         __ test(edi, edi);
         __ j(zero, &exit_label_, Label::kNear);
@@ -963,6 +962,12 @@ Handle<HeapObject> RegExpMacroAssemblerIA32::GetCode(Handle<String> source) {
         }
         if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
       }
+
+      __ bind(&reload_string_start_minus_one);
+      // Prepare eax to initialize registers with its value in the next run.
+      // Must be immediately before the jump to avoid clobbering.
+      __ mov(eax, Operand(ebp, kStringStartMinusOneOffset));
+
       __ jmp(&load_char_start_regexp);
     } else {
       __ mov(eax, Immediate(SUCCESS));
@@ -1242,7 +1247,7 @@ static T* frame_entry_address(Address re_frame, int frame_offset) {
 int RegExpMacroAssemblerIA32::CheckStackGuardState(Address* return_address,
                                                    Address raw_code,
                                                    Address re_frame) {
-  InstructionStream re_code = InstructionStream::cast(Object(raw_code));
+  Tagged<InstructionStream> re_code = InstructionStream::cast(Object(raw_code));
   return NativeRegExpMacroAssembler::CheckStackGuardState(
       frame_entry<Isolate*>(re_frame, kIsolateOffset),
       frame_entry<int>(re_frame, kStartIndexOffset),
@@ -1250,8 +1255,8 @@ int RegExpMacroAssemblerIA32::CheckStackGuardState(Address* return_address,
           frame_entry<int>(re_frame, kDirectCallOffset)),
       return_address, re_code,
       frame_entry_address<Address>(re_frame, kInputStringOffset),
-      frame_entry_address<const byte*>(re_frame, kInputStartOffset),
-      frame_entry_address<const byte*>(re_frame, kInputEndOffset));
+      frame_entry_address<const uint8_t*>(re_frame, kInputStartOffset),
+      frame_entry_address<const uint8_t*>(re_frame, kInputEndOffset));
 }
 
 
diff --git a/deps/v8/src/regexp/loong64/regexp-macro-assembler-loong64.cc b/deps/v8/src/regexp/loong64/regexp-macro-assembler-loong64.cc
index 472d513b97a068..bc7657c051caa5 100644
--- a/deps/v8/src/regexp/loong64/regexp-macro-assembler-loong64.cc
+++ b/deps/v8/src/regexp/loong64/regexp-macro-assembler-loong64.cc
@@ -865,18 +865,17 @@ Handle<HeapObject> RegExpMacroAssemblerLOONG64::GetCode(Handle<String> source) {
         __ Add_d(a2, a2, num_saved_registers_ * kIntSize);
         __ St_d(a2, MemOperand(frame_pointer(), kRegisterOutputOffset));
 
-        // Prepare a0 to initialize registers with its value in the next run.
-        __ Ld_d(a0, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
-
         // Restore the original regexp stack pointer value (effectively, pop the
         // stored base pointer).
         PopRegExpBasePointer(backtrack_stackpointer(), a2);
 
+        Label reload_string_start_minus_one;
+
         if (global_with_zero_length_check()) {
           // Special case for zero-length matches.
           // t3: capture start index
           // Not a zero-length match, restart.
-          __ Branch(&load_char_start_regexp, ne, current_input_offset(),
+          __ Branch(&reload_string_start_minus_one, ne, current_input_offset(),
                     Operand(t3));
           // Offset from the end is zero if we already reached the end.
           __ Branch(&exit_label_, eq, current_input_offset(),
@@ -889,6 +888,11 @@ Handle<HeapObject> RegExpMacroAssemblerLOONG64::GetCode(Handle<String> source) {
           if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
         }
 
+        __ bind(&reload_string_start_minus_one);
+        // Prepare a0 to initialize registers with its value in the next run.
+        // Must be immediately before the jump to avoid clobbering.
+        __ Ld_d(a0, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
+
         __ Branch(&load_char_start_regexp);
       } else {
         __ li(a0, Operand(SUCCESS));
@@ -1167,7 +1171,7 @@ void RegExpMacroAssemblerLOONG64::CallCheckStackGuardState(Register scratch) {
 
   EmbeddedData d = EmbeddedData::FromBlob();
   CHECK(Builtins::IsIsolateIndependent(Builtin::kDirectCEntry));
-  Address entry = d.InstructionStartOfBuiltin(Builtin::kDirectCEntry);
+  Address entry = d.InstructionStartOf(Builtin::kDirectCEntry);
   __ li(kScratchReg, Operand(entry, RelocInfo::OFF_HEAP_TARGET));
   __ Call(kScratchReg);
 
@@ -1208,8 +1212,8 @@ int64_t RegExpMacroAssemblerLOONG64::CheckStackGuardState(
           frame_entry<int64_t>(re_frame, kDirectCallOffset)),
       return_address, re_code,
       frame_entry_address<Address>(re_frame, kInputStringOffset),
-      frame_entry_address<const byte*>(re_frame, kInputStartOffset),
-      frame_entry_address<const byte*>(re_frame, kInputEndOffset));
+      frame_entry_address<const uint8_t*>(re_frame, kInputStartOffset),
+      frame_entry_address<const uint8_t*>(re_frame, kInputEndOffset));
 }
 
 MemOperand RegExpMacroAssemblerLOONG64::register_location(int register_index) {
diff --git a/deps/v8/src/regexp/mips64/regexp-macro-assembler-mips64.cc b/deps/v8/src/regexp/mips64/regexp-macro-assembler-mips64.cc
index 46f009480b2108..7e8a2646df517a 100644
--- a/deps/v8/src/regexp/mips64/regexp-macro-assembler-mips64.cc
+++ b/deps/v8/src/regexp/mips64/regexp-macro-assembler-mips64.cc
@@ -911,19 +911,18 @@ Handle<HeapObject> RegExpMacroAssemblerMIPS::GetCode(Handle<String> source) {
         __ Daddu(a2, a2, num_saved_registers_ * kIntSize);
         __ Sd(a2, MemOperand(frame_pointer(), kRegisterOutputOffset));
 
-        // Prepare a0 to initialize registers with its value in the next run.
-        __ Ld(a0, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
-
         // Restore the original regexp stack pointer value (effectively, pop the
         // stored base pointer).
         PopRegExpBasePointer(backtrack_stackpointer(), a2);
 
+        Label reload_string_start_minus_one;
+
         if (global_with_zero_length_check()) {
           // Special case for zero-length matches.
           // t3: capture start index
           // Not a zero-length match, restart.
-          __ Branch(
-              &load_char_start_regexp, ne, current_input_offset(), Operand(t3));
+          __ Branch(&reload_string_start_minus_one, ne, current_input_offset(),
+                    Operand(t3));
           // Offset from the end is zero if we already reached the end.
           __ Branch(&exit_label_, eq, current_input_offset(),
                     Operand(zero_reg));
@@ -935,6 +934,11 @@ Handle<HeapObject> RegExpMacroAssemblerMIPS::GetCode(Handle<String> source) {
           if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
         }
 
+        __ bind(&reload_string_start_minus_one);
+        // Prepare a0 to initialize registers with its value in the next run.
+        // Must be immediately before the jump to avoid clobbering.
+        __ Ld(a0, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
+
         __ Branch(&load_char_start_regexp);
       } else {
         __ li(v0, Operand(SUCCESS));
@@ -1217,7 +1221,7 @@ void RegExpMacroAssemblerMIPS::CallCheckStackGuardState(Register scratch) {
 
   EmbeddedData d = EmbeddedData::FromBlob();
   CHECK(Builtins::IsIsolateIndependent(Builtin::kDirectCEntry));
-  Address entry = d.InstructionStartOfBuiltin(Builtin::kDirectCEntry);
+  Address entry = d.InstructionStartOf(Builtin::kDirectCEntry);
   __ li(kScratchReg, Operand(entry, RelocInfo::OFF_HEAP_TARGET));
   __ Call(kScratchReg);
 
@@ -1259,8 +1263,8 @@ int64_t RegExpMacroAssemblerMIPS::CheckStackGuardState(Address* return_address,
           frame_entry<int64_t>(re_frame, kDirectCallOffset)),
       return_address, re_code,
       frame_entry_address<Address>(re_frame, kInputStringOffset),
-      frame_entry_address<const byte*>(re_frame, kInputStartOffset),
-      frame_entry_address<const byte*>(re_frame, kInputEndOffset));
+      frame_entry_address<const uint8_t*>(re_frame, kInputStartOffset),
+      frame_entry_address<const uint8_t*>(re_frame, kInputEndOffset));
 }
 
 MemOperand RegExpMacroAssemblerMIPS::register_location(int register_index) {
diff --git a/deps/v8/src/regexp/ppc/regexp-macro-assembler-ppc.cc b/deps/v8/src/regexp/ppc/regexp-macro-assembler-ppc.cc
index 3576f318fed57d..d6ac210e8d4f56 100644
--- a/deps/v8/src/regexp/ppc/regexp-macro-assembler-ppc.cc
+++ b/deps/v8/src/regexp/ppc/regexp-macro-assembler-ppc.cc
@@ -85,7 +85,7 @@ namespace internal {
  *              Address end,
  *              int* capture_output_array,
  *              int num_capture_registers,
- *              byte* stack_area_base,
+ *              uint8_t* stack_area_base,
  *              bool direct_call = false,
  *              Isolate* isolate,
  *              Address regexp);
@@ -946,19 +946,18 @@ Handle<HeapObject> RegExpMacroAssemblerPPC::GetCode(Handle<String> source) {
         __ addi(r5, r5, Operand(num_saved_registers_ * kIntSize));
         __ StoreU64(r5, MemOperand(frame_pointer(), kRegisterOutputOffset));
 
-        // Prepare r3 to initialize registers with its value in the next run.
-        __ LoadU64(r3, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
-
         // Restore the original regexp stack pointer value (effectively, pop the
         // stored base pointer).
         PopRegExpBasePointer(backtrack_stackpointer(), r5);
 
+        Label reload_string_start_minus_one;
+
         if (global_with_zero_length_check()) {
           // Special case for zero-length matches.
           // r25: capture start index
           __ CmpS64(current_input_offset(), r25);
           // Not a zero-length match, restart.
-          __ bne(&load_char_start_regexp);
+          __ bne(&reload_string_start_minus_one);
           // Offset from the end is zero if we already reached the end.
           __ cmpi(current_input_offset(), Operand::Zero());
           __ beq(&exit_label_);
@@ -970,6 +969,11 @@ Handle<HeapObject> RegExpMacroAssemblerPPC::GetCode(Handle<String> source) {
           if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
         }
 
+        __ bind(&reload_string_start_minus_one);
+        // Prepare r3 to initialize registers with its value in the next run.
+        // Must be immediately before the jump to avoid clobbering.
+        __ LoadU64(r3, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
+
         __ b(&load_char_start_regexp);
       } else {
         __ li(r3, Operand(SUCCESS));
@@ -1249,7 +1253,7 @@ void RegExpMacroAssemblerPPC::CallCheckStackGuardState(Register scratch) {
   __ mov(ip, Operand(stack_guard_check));
 
   EmbeddedData d = EmbeddedData::FromBlob();
-  Address entry = d.InstructionStartOfBuiltin(Builtin::kDirectCEntry);
+  Address entry = d.InstructionStartOf(Builtin::kDirectCEntry);
   __ mov(r0, Operand(entry, RelocInfo::OFF_HEAP_TARGET));
   __ Call(r0);
 
@@ -1280,7 +1284,7 @@ static T* frame_entry_address(Address re_frame, int frame_offset) {
 int RegExpMacroAssemblerPPC::CheckStackGuardState(Address* return_address,
                                                   Address raw_code,
                                                   Address re_frame) {
-  InstructionStream re_code = InstructionStream::cast(Object(raw_code));
+  Tagged<InstructionStream> re_code = InstructionStream::cast(Object(raw_code));
   return NativeRegExpMacroAssembler::CheckStackGuardState(
       frame_entry<Isolate*>(re_frame, kIsolateOffset),
       frame_entry<intptr_t>(re_frame, kStartIndexOffset),
@@ -1288,8 +1292,8 @@ int RegExpMacroAssemblerPPC::CheckStackGuardState(Address* return_address,
           frame_entry<intptr_t>(re_frame, kDirectCallOffset)),
       return_address, re_code,
       frame_entry_address<Address>(re_frame, kInputStringOffset),
-      frame_entry_address<const byte*>(re_frame, kInputStartOffset),
-      frame_entry_address<const byte*>(re_frame, kInputEndOffset));
+      frame_entry_address<const uint8_t*>(re_frame, kInputStartOffset),
+      frame_entry_address<const uint8_t*>(re_frame, kInputEndOffset));
 }
 
 
diff --git a/deps/v8/src/regexp/regexp-ast.h b/deps/v8/src/regexp/regexp-ast.h
index 34f59f6c314613..56ece7ca51e66f 100644
--- a/deps/v8/src/regexp/regexp-ast.h
+++ b/deps/v8/src/regexp/regexp-ast.h
@@ -134,12 +134,6 @@ class CharacterRange {
   static void AddUnicodeCaseEquivalents(ZoneList<CharacterRange>* ranges,
                                         Zone* zone);
 
-#ifdef V8_INTL_SUPPORT
-  // Creates the closeOver of the given UnicodeSet, removing all
-  // characters/strings that can't be derived via simple case folding.
-  static void UnicodeSimpleCloseOver(icu::UnicodeSet& set);
-#endif  // V8_INTL_SUPPORT
-
   bool Contains(base::uc32 i) const { return from_ <= i && i <= to_; }
   base::uc32 from() const { return from_; }
   base::uc32 to() const { return to_; }
@@ -315,9 +309,12 @@ class RegExpClassRanges final : public RegExpTree {
   //     the specified ranges.
   // CONTAINS_SPLIT_SURROGATE: The character class contains part of a split
   //     surrogate and should not be unicode-desugared (crbug.com/641091).
+  // IS_CASE_FOLDED: If case folding is required (/i), it was already
+  //     performed on individual ranges and should not be applied again.
   enum Flag {
     NEGATED = 1 << 0,
     CONTAINS_SPLIT_SURROGATE = 1 << 1,
+    IS_CASE_FOLDED = 1 << 2,
   };
   using ClassRangesFlags = base::Flags<Flag>;
 
@@ -360,6 +357,9 @@ class RegExpClassRanges final : public RegExpTree {
   bool contains_split_surrogate() const {
     return (class_ranges_flags_ & CONTAINS_SPLIT_SURROGATE) != 0;
   }
+  bool is_case_folded() const {
+    return (class_ranges_flags_ & IS_CASE_FOLDED) != 0;
+  }
 
  private:
   CharacterSet set_;
@@ -367,8 +367,8 @@ class RegExpClassRanges final : public RegExpTree {
 };
 
 struct CharacterClassStringLess {
-  bool operator()(const base::Vector<const base::uc32>& lhs,
-                  const base::Vector<const base::uc32>& rhs) const {
+  bool operator()(base::Vector<const base::uc32> lhs,
+                  base::Vector<const base::uc32> rhs) const {
     // Longer strings first so we generate matches for the largest string
     // possible.
     if (lhs.length() != rhs.length()) {
@@ -464,7 +464,7 @@ class RegExpClassSetExpression final : public RegExpTree {
       RegExpTree* root, ZoneList<CharacterRange>* temp_ranges, Zone* zone);
 
   const OperationType operation_;
-  const bool is_negated_;
+  bool is_negated_;
   const bool may_contain_strings_;
   ZoneList<RegExpTree*>* operands_ = nullptr;
   int max_match_;
diff --git a/deps/v8/src/regexp/regexp-bytecode-generator.cc b/deps/v8/src/regexp/regexp-bytecode-generator.cc
index 61225642e23e36..c3813219ddaffc 100644
--- a/deps/v8/src/regexp/regexp-bytecode-generator.cc
+++ b/deps/v8/src/regexp/regexp-bytecode-generator.cc
@@ -393,7 +393,7 @@ Handle<HeapObject> RegExpBytecodeGenerator::GetCode(Handle<String> source) {
 
 int RegExpBytecodeGenerator::length() { return pc_; }
 
-void RegExpBytecodeGenerator::Copy(byte* a) {
+void RegExpBytecodeGenerator::Copy(uint8_t* a) {
   MemCopy(a, buffer_.data(), length());
 }
 
diff --git a/deps/v8/src/regexp/regexp-bytecode-generator.h b/deps/v8/src/regexp/regexp-bytecode-generator.h
index d3ed62b8850c6f..2ac09991c4b9f6 100644
--- a/deps/v8/src/regexp/regexp-bytecode-generator.h
+++ b/deps/v8/src/regexp/regexp-bytecode-generator.h
@@ -109,11 +109,11 @@ class V8_EXPORT_PRIVATE RegExpBytecodeGenerator : public RegExpMacroAssembler {
   inline void Emit(uint32_t bc, int32_t arg);
   // Bytecode buffer.
   int length();
-  void Copy(byte* a);
+  void Copy(uint8_t* a);
 
   // The buffer into which code and relocation info are generated.
   static constexpr int kInitialBufferSize = 1024;
-  ZoneVector<byte> buffer_;
+  ZoneVector<uint8_t> buffer_;
 
   // The program counter.
   int pc_;
diff --git a/deps/v8/src/regexp/regexp-bytecode-peephole.cc b/deps/v8/src/regexp/regexp-bytecode-peephole.cc
index e29e7ee0aff828..add0dba7384728 100644
--- a/deps/v8/src/regexp/regexp-bytecode-peephole.cc
+++ b/deps/v8/src/regexp/regexp-bytecode-peephole.cc
@@ -115,7 +115,7 @@ class BytecodeSequenceNode {
   // Checks if the current node is valid for the sequence. I.e. all conditions
   // set by IfArgumentEqualsOffset and IfArgumentEquals are fulfilled by this
   // node for the actual bytecode sequence.
-  bool CheckArguments(const byte* bytecode, int pc);
+  bool CheckArguments(const uint8_t* bytecode, int pc);
   // Returns whether this node marks the end of a valid sequence (i.e. can be
   // replaced with an optimized bytecode).
   bool IsSequence() const;
@@ -176,10 +176,10 @@ class RegExpBytecodePeephole {
   // Parses bytecode and fills the internal buffer with the potentially
   // optimized bytecode. Returns true when optimizations were performed, false
   // otherwise.
-  bool OptimizeBytecode(const byte* bytecode, int length);
+  bool OptimizeBytecode(const uint8_t* bytecode, int length);
   // Copies the internal bytecode buffer to another buffer. The caller is
   // responsible for allocating/freeing the memory.
-  void CopyOptimizedBytecode(byte* to_address) const;
+  void CopyOptimizedBytecode(uint8_t* to_address) const;
   int Length() const;
 
  private:
@@ -189,12 +189,12 @@ class RegExpBytecodePeephole {
   BytecodeSequenceNode& CreateSequence(int bytecode);
   // Checks for optimization candidates at pc and emits optimized bytecode to
   // the internal buffer. Returns the length of replaced bytecodes in bytes.
-  int TryOptimizeSequence(const byte* bytecode, int bytecode_length,
+  int TryOptimizeSequence(const uint8_t* bytecode, int bytecode_length,
                           int start_pc);
   // Emits optimized bytecode to the internal buffer. start_pc points to the
   // start of the sequence in bytecode and last_node is the last
   // BytecodeSequenceNode of the matching sequence found.
-  void EmitOptimization(int start_pc, const byte* bytecode,
+  void EmitOptimization(int start_pc, const uint8_t* bytecode,
                         const BytecodeSequenceNode& last_node);
   // Adds a relative jump source fixup at pos.
   // Jump source fixups are used to find offsets in the new bytecode that
@@ -217,14 +217,14 @@ class RegExpBytecodePeephole {
   void EmitValue(T value);
   template <typename T>
   void OverwriteValue(int offset, T value);
-  void CopyRangeToOutput(const byte* orig_bytecode, int start, int length);
-  void SetRange(byte value, int count);
-  void EmitArgument(int start_pc, const byte* bytecode,
+  void CopyRangeToOutput(const uint8_t* orig_bytecode, int start, int length);
+  void SetRange(uint8_t value, int count);
+  void EmitArgument(int start_pc, const uint8_t* bytecode,
                     BytecodeArgumentMapping arg);
   int pc() const;
   Zone* zone() const;
 
-  ZoneVector<byte> optimized_bytecode_buffer_;
+  ZoneVector<uint8_t> optimized_bytecode_buffer_;
   BytecodeSequenceNode* sequences_;
   // Jumps used in old bytecode.
   // Key: Jump source (offset where destination is stored in old bytecode)
@@ -255,15 +255,15 @@ class RegExpBytecodePeephole {
 };
 
 template <typename T>
-T GetValue(const byte* buffer, int pos) {
+T GetValue(const uint8_t* buffer, int pos) {
   DCHECK(IsAligned(reinterpret_cast<Address>(buffer + pos), alignof(T)));
   return *reinterpret_cast<const T*>(buffer + pos);
 }
 
-int32_t GetArgumentValue(const byte* bytecode, int offset, int length) {
+int32_t GetArgumentValue(const uint8_t* bytecode, int offset, int length) {
   switch (length) {
     case 1:
-      return GetValue<byte>(bytecode, offset);
+      return GetValue<uint8_t>(bytecode, offset);
     case 2:
       return GetValue<int16_t>(bytecode, offset);
     case 4:
@@ -386,7 +386,7 @@ BytecodeSequenceNode& BytecodeSequenceNode::IgnoreArgument(
   return *this;
 }
 
-bool BytecodeSequenceNode::CheckArguments(const byte* bytecode, int pc) {
+bool BytecodeSequenceNode::CheckArguments(const uint8_t* bytecode, int pc) {
   bool is_valid = true;
   for (auto check_iter = argument_check_->begin();
        check_iter != argument_check_->end() && is_valid; check_iter++) {
@@ -616,7 +616,7 @@ void RegExpBytecodePeephole::DefineStandardSequences() {
       .IgnoreArgument(4, 4, 4);  // loop jump
 }
 
-bool RegExpBytecodePeephole::OptimizeBytecode(const byte* bytecode,
+bool RegExpBytecodePeephole::OptimizeBytecode(const uint8_t* bytecode,
                                               int length) {
   int old_pc = 0;
   bool did_optimize = false;
@@ -641,7 +641,7 @@ bool RegExpBytecodePeephole::OptimizeBytecode(const byte* bytecode,
   return did_optimize;
 }
 
-void RegExpBytecodePeephole::CopyOptimizedBytecode(byte* to_address) const {
+void RegExpBytecodePeephole::CopyOptimizedBytecode(uint8_t* to_address) const {
   MemCopy(to_address, &(*optimized_bytecode_buffer_.begin()), Length());
 }
 
@@ -654,7 +654,7 @@ BytecodeSequenceNode& RegExpBytecodePeephole::CreateSequence(int bytecode) {
   return sequences_->FollowedBy(bytecode);
 }
 
-int RegExpBytecodePeephole::TryOptimizeSequence(const byte* bytecode,
+int RegExpBytecodePeephole::TryOptimizeSequence(const uint8_t* bytecode,
                                                 int bytecode_length,
                                                 int start_pc) {
   BytecodeSequenceNode* seq_node = sequences_;
@@ -682,7 +682,8 @@ int RegExpBytecodePeephole::TryOptimizeSequence(const byte* bytecode,
 }
 
 void RegExpBytecodePeephole::EmitOptimization(
-    int start_pc, const byte* bytecode, const BytecodeSequenceNode& last_node) {
+    int start_pc, const uint8_t* bytecode,
+    const BytecodeSequenceNode& last_node) {
 #ifdef DEBUG
   int optimized_start_pc = pc();
 #endif
@@ -882,7 +883,7 @@ void RegExpBytecodePeephole::FixJump(int jump_source, int jump_destination) {
 #ifdef DEBUG
   // TODO(pthier): This check could be better if we track the bytecodes
   // actually used and check if we jump to one of them.
-  byte jump_bc = optimized_bytecode_buffer_[fixed_jump_destination];
+  uint8_t jump_bc = optimized_bytecode_buffer_[fixed_jump_destination];
   DCHECK_GT(jump_bc, 0);
   DCHECK_LT(jump_bc, kRegExpBytecodeCount);
 #endif
@@ -901,7 +902,7 @@ template <typename T>
 void RegExpBytecodePeephole::EmitValue(T value) {
   DCHECK(optimized_bytecode_buffer_.begin() + pc() ==
          optimized_bytecode_buffer_.end());
-  byte* value_byte_iter = reinterpret_cast<byte*>(&value);
+  uint8_t* value_byte_iter = reinterpret_cast<uint8_t*>(&value);
   optimized_bytecode_buffer_.insert(optimized_bytecode_buffer_.end(),
                                     value_byte_iter,
                                     value_byte_iter + sizeof(T));
@@ -909,14 +910,14 @@ void RegExpBytecodePeephole::EmitValue(T value) {
 
 template <typename T>
 void RegExpBytecodePeephole::OverwriteValue(int offset, T value) {
-  byte* value_byte_iter = reinterpret_cast<byte*>(&value);
-  byte* value_byte_iter_end = value_byte_iter + sizeof(T);
+  uint8_t* value_byte_iter = reinterpret_cast<uint8_t*>(&value);
+  uint8_t* value_byte_iter_end = value_byte_iter + sizeof(T);
   while (value_byte_iter < value_byte_iter_end) {
     optimized_bytecode_buffer_[offset++] = *value_byte_iter++;
   }
 }
 
-void RegExpBytecodePeephole::CopyRangeToOutput(const byte* orig_bytecode,
+void RegExpBytecodePeephole::CopyRangeToOutput(const uint8_t* orig_bytecode,
                                                int start, int length) {
   DCHECK(optimized_bytecode_buffer_.begin() + pc() ==
          optimized_bytecode_buffer_.end());
@@ -925,20 +926,20 @@ void RegExpBytecodePeephole::CopyRangeToOutput(const byte* orig_bytecode,
                                     orig_bytecode + start + length);
 }
 
-void RegExpBytecodePeephole::SetRange(byte value, int count) {
+void RegExpBytecodePeephole::SetRange(uint8_t value, int count) {
   DCHECK(optimized_bytecode_buffer_.begin() + pc() ==
          optimized_bytecode_buffer_.end());
   optimized_bytecode_buffer_.insert(optimized_bytecode_buffer_.end(), count,
                                     value);
 }
 
-void RegExpBytecodePeephole::EmitArgument(int start_pc, const byte* bytecode,
+void RegExpBytecodePeephole::EmitArgument(int start_pc, const uint8_t* bytecode,
                                           BytecodeArgumentMapping arg) {
   int arg_pos = start_pc + arg.offset;
   switch (arg.length) {
     case 1:
       DCHECK_EQ(arg.new_length, arg.length);
-      EmitValue(GetValue<byte>(bytecode, arg_pos));
+      EmitValue(GetValue<uint8_t>(bytecode, arg_pos));
       break;
     case 2:
       DCHECK_EQ(arg.new_length, arg.length);
@@ -1011,8 +1012,9 @@ Zone* RegExpBytecodePeephole::zone() const { return zone_; }
 
 // static
 Handle<ByteArray> RegExpBytecodePeepholeOptimization::OptimizeBytecode(
-    Isolate* isolate, Zone* zone, Handle<String> source, const byte* bytecode,
-    int length, const ZoneUnorderedMap<int, int>& jump_edges) {
+    Isolate* isolate, Zone* zone, Handle<String> source,
+    const uint8_t* bytecode, int length,
+    const ZoneUnorderedMap<int, int>& jump_edges) {
   RegExpBytecodePeephole peephole(zone, length, jump_edges);
   bool did_optimize = peephole.OptimizeBytecode(bytecode, length);
   Handle<ByteArray> array = isolate->factory()->NewByteArray(peephole.Length());
diff --git a/deps/v8/src/regexp/regexp-bytecode-peephole.h b/deps/v8/src/regexp/regexp-bytecode-peephole.h
index f116e1ac4184f6..d73068c2143c72 100644
--- a/deps/v8/src/regexp/regexp-bytecode-peephole.h
+++ b/deps/v8/src/regexp/regexp-bytecode-peephole.h
@@ -21,8 +21,9 @@ class RegExpBytecodePeepholeOptimization : public AllStatic {
   // Performs peephole optimization on the given bytecode and returns the
   // optimized bytecode.
   static Handle<ByteArray> OptimizeBytecode(
-      Isolate* isolate, Zone* zone, Handle<String> source, const byte* bytecode,
-      int length, const ZoneUnorderedMap<int, int>& jump_edges);
+      Isolate* isolate, Zone* zone, Handle<String> source,
+      const uint8_t* bytecode, int length,
+      const ZoneUnorderedMap<int, int>& jump_edges);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/regexp/regexp-bytecodes.cc b/deps/v8/src/regexp/regexp-bytecodes.cc
index 3eeceb2b141bd1..6f90d5d620fa71 100644
--- a/deps/v8/src/regexp/regexp-bytecodes.cc
+++ b/deps/v8/src/regexp/regexp-bytecodes.cc
@@ -11,7 +11,8 @@
 namespace v8 {
 namespace internal {
 
-void RegExpBytecodeDisassembleSingle(const byte* code_base, const byte* pc) {
+void RegExpBytecodeDisassembleSingle(const uint8_t* code_base,
+                                     const uint8_t* pc) {
   int bytecode = *reinterpret_cast<const int32_t*>(pc) & BYTECODE_MASK;
   PrintF("%s", RegExpBytecodeName(bytecode));
 
@@ -29,14 +30,14 @@ void RegExpBytecodeDisassembleSingle(const byte* code_base, const byte* pc) {
   PrintF("\n");
 }
 
-void RegExpBytecodeDisassemble(const byte* code_base, int length,
+void RegExpBytecodeDisassemble(const uint8_t* code_base, int length,
                                const char* pattern) {
   PrintF("[generated bytecode for regexp pattern: '%s']\n", pattern);
 
   ptrdiff_t offset = 0;
 
   while (offset < length) {
-    const byte* const pc = code_base + offset;
+    const uint8_t* const pc = code_base + offset;
     PrintF("%p  %4" V8PRIxPTRDIFF "  ", pc, offset);
     RegExpBytecodeDisassembleSingle(code_base, pc);
     offset += RegExpBytecodeLength(*pc);
diff --git a/deps/v8/src/regexp/regexp-bytecodes.h b/deps/v8/src/regexp/regexp-bytecodes.h
index 8479b30bd8779e..3d51f116f277b6 100644
--- a/deps/v8/src/regexp/regexp-bytecodes.h
+++ b/deps/v8/src/regexp/regexp-bytecodes.h
@@ -250,8 +250,9 @@ inline constexpr const char* RegExpBytecodeName(int bytecode) {
   return kRegExpBytecodeNames[bytecode];
 }
 
-void RegExpBytecodeDisassembleSingle(const byte* code_base, const byte* pc);
-void RegExpBytecodeDisassemble(const byte* code_base, int length,
+void RegExpBytecodeDisassembleSingle(const uint8_t* code_base,
+                                     const uint8_t* pc);
+void RegExpBytecodeDisassemble(const uint8_t* code_base, int length,
                                const char* pattern);
 
 }  // namespace internal
diff --git a/deps/v8/src/regexp/regexp-compiler-tonode.cc b/deps/v8/src/regexp/regexp-compiler-tonode.cc
index 3258bb51492aaa..dd26f61d9974e3 100644
--- a/deps/v8/src/regexp/regexp-compiler-tonode.cc
+++ b/deps/v8/src/regexp/regexp-compiler-tonode.cc
@@ -2,9 +2,10 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include "src/regexp/regexp-compiler.h"
-
+#include "src/common/globals.h"
 #include "src/execution/isolate.h"
+#include "src/objects/string.h"
+#include "src/regexp/regexp-compiler.h"
 #include "src/regexp/regexp.h"
 #include "src/strings/unicode-inl.h"
 #include "src/zone/zone-list-inl.h"
@@ -422,27 +423,6 @@ RegExpNode* UnanchoredAdvance(RegExpCompiler* compiler,
 
 }  // namespace
 
-#ifdef V8_INTL_SUPPORT
-// static
-void CharacterRange::UnicodeSimpleCloseOver(icu::UnicodeSet& set) {
-  // Remove characters for which closeOver() adds full-case-folding equivalents
-  // because we should work only with simple case folding mappings.
-  icu::UnicodeSet non_simple = icu::UnicodeSet(set);
-  non_simple.retainAll(RegExpCaseFolding::UnicodeNonSimpleCloseOverSet());
-  set.removeAll(non_simple);
-
-  set.closeOver(USET_CASE_INSENSITIVE);
-  // Full case folding maps single characters to multiple characters.
-  // Those are represented as strings in the set. Remove them so that
-  // we end up with only simple and common case mappings.
-  set.removeAllStrings();
-
-  // Add characters that have non-simple case foldings again (they match
-  // themselves).
-  set.addAll(non_simple);
-}
-#endif  // V8_INTL_SUPPORT
-
 // static
 void CharacterRange::AddUnicodeCaseEquivalents(ZoneList<CharacterRange>* ranges,
                                                Zone* zone) {
@@ -464,8 +444,7 @@ void CharacterRange::AddUnicodeCaseEquivalents(ZoneList<CharacterRange>* ranges,
   }
   // Clear the ranges list without freeing the backing store.
   ranges->Rewind(0);
-
-  UnicodeSimpleCloseOver(set);
+  set.closeOver(USET_SIMPLE_CASE_INSENSITIVE);
   for (int i = 0; i < set.getRangeCount(); i++) {
     ranges->Add(Range(set.getRangeStart(i), set.getRangeEnd(i)), zone);
   }
@@ -480,7 +459,9 @@ RegExpNode* RegExpClassRanges::ToNode(RegExpCompiler* compiler,
   Zone* const zone = compiler->zone();
   ZoneList<CharacterRange>* ranges = this->ranges(zone);
 
-  if (NeedsUnicodeCaseEquivalents(compiler->flags())) {
+  const bool needs_case_folding =
+      NeedsUnicodeCaseEquivalents(compiler->flags()) && !is_case_folded();
+  if (needs_case_folding) {
     CharacterRange::AddUnicodeCaseEquivalents(ranges, zone);
   }
 
@@ -491,8 +472,7 @@ RegExpNode* RegExpClassRanges::ToNode(RegExpCompiler* compiler,
 
   if (is_negated()) {
     // With /v, character classes are never negated.
-    // TODO(v8:11935): Change permalink once proposal is in stage 4.
-    // https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#sec-compileatom
+    // https://tc39.es/ecma262/#sec-compileatom
     // Atom :: CharacterClass
     //   4. Assert: cc.[[Invert]] is false.
     // Instead the complement is created when evaluating the class set.
@@ -565,7 +545,12 @@ RegExpNode* RegExpClassSetOperand::ToNode(RegExpCompiler* compiler,
     }
   }
   if (!ranges()->is_empty()) {
-    alternatives->Add(zone->template New<RegExpClassRanges>(zone, ranges()),
+    // In unicode sets mode case folding has to be done at precise locations
+    // (e.g. before building complements).
+    // It is therefore the parsers responsibility to case fold (sub-) ranges
+    // before creating ClassSetOperands.
+    alternatives->Add(zone->template New<RegExpClassRanges>(
+                          zone, ranges(), RegExpClassRanges::IS_CASE_FOLDED),
                       zone);
   }
   if (empty_string != nullptr) {
@@ -682,6 +667,7 @@ RegExpClassSetOperand* RegExpClassSetExpression::ComputeExpression(
     CharacterRange::Negate(result->ranges(), temp_ranges, zone);
     std::swap(*result->ranges(), *temp_ranges);
     temp_ranges->Rewind(0);
+    node->is_negated_ = false;
   }
   // Store the result as single operand of the current node.
   node->operands()->Set(0, result);
diff --git a/deps/v8/src/regexp/regexp-interpreter.cc b/deps/v8/src/regexp/regexp-interpreter.cc
index 57eff39e7daed9..33a75b7e76db9c 100644
--- a/deps/v8/src/regexp/regexp-interpreter.cc
+++ b/deps/v8/src/regexp/regexp-interpreter.cc
@@ -74,7 +74,7 @@ bool BackRefMatchesNoCase(Isolate* isolate, int from, int current, int len,
 }
 
 #ifdef DEBUG
-void MaybeTraceInterpreter(const byte* code_base, const byte* pc,
+void MaybeTraceInterpreter(const uint8_t* code_base, const uint8_t* pc,
                            int stack_depth, int current_position,
                            uint32_t current_char, int bytecode_length,
                            const char* bytecode_name) {
@@ -92,18 +92,18 @@ void MaybeTraceInterpreter(const byte* code_base, const byte* pc,
 }
 #endif  // DEBUG
 
-int32_t Load32Aligned(const byte* pc) {
+int32_t Load32Aligned(const uint8_t* pc) {
   DCHECK_EQ(0, reinterpret_cast<intptr_t>(pc) & 3);
   return *reinterpret_cast<const int32_t*>(pc);
 }
 
 // TODO(jgruber): Rename to Load16AlignedUnsigned.
-uint32_t Load16Aligned(const byte* pc) {
+uint32_t Load16Aligned(const uint8_t* pc) {
   DCHECK_EQ(0, reinterpret_cast<intptr_t>(pc) & 1);
   return *reinterpret_cast<const uint16_t*>(pc);
 }
 
-int32_t Load16AlignedSigned(const byte* pc) {
+int32_t Load16AlignedSigned(const uint8_t* pc) {
   DCHECK_EQ(0, reinterpret_cast<intptr_t>(pc) & 1);
   return *reinterpret_cast<const int16_t*>(pc);
 }
@@ -230,8 +230,9 @@ IrregexpInterpreter::Result MaybeThrowStackOverflow(
 template <typename Char>
 void UpdateCodeAndSubjectReferences(
     Isolate* isolate, Handle<ByteArray> code_array,
-    Handle<String> subject_string, ByteArray* code_array_out,
-    const byte** code_base_out, const byte** pc_out, String* subject_string_out,
+    Handle<String> subject_string, Tagged<ByteArray>* code_array_out,
+    const uint8_t** code_base_out, const uint8_t** pc_out,
+    Tagged<String>* subject_string_out,
     base::Vector<const Char>* subject_string_vector_out) {
   DisallowGarbageCollection no_gc;
 
@@ -252,9 +253,11 @@ void UpdateCodeAndSubjectReferences(
 // necessary.
 template <typename Char>
 IrregexpInterpreter::Result HandleInterrupts(
-    Isolate* isolate, RegExp::CallOrigin call_origin, ByteArray* code_array_out,
-    String* subject_string_out, const byte** code_base_out,
-    base::Vector<const Char>* subject_string_vector_out, const byte** pc_out) {
+    Isolate* isolate, RegExp::CallOrigin call_origin,
+    Tagged<ByteArray>* code_array_out, Tagged<String>* subject_string_out,
+    const uint8_t** code_base_out,
+    base::Vector<const Char>* subject_string_vector_out,
+    const uint8_t** pc_out) {
   DisallowGarbageCollection no_gc;
 
   StackLimitCheck check(isolate);
@@ -288,7 +291,7 @@ IrregexpInterpreter::Result HandleInterrupts(
         AllowGarbageCollection yes_gc;
         result = isolate->stack_guard()->HandleInterrupts();
       }
-      if (result.IsException(isolate)) {
+      if (IsException(result, isolate)) {
         return IrregexpInterpreter::EXCEPTION;
       }
 
@@ -309,7 +312,7 @@ IrregexpInterpreter::Result HandleInterrupts(
   return IrregexpInterpreter::SUCCESS;
 }
 
-bool CheckBitInTable(const uint32_t current_char, const byte* const table) {
+bool CheckBitInTable(const uint32_t current_char, const uint8_t* const table) {
   int mask = RegExpMacroAssembler::kTableMask;
   int b = table[(current_char & mask) >> kBitsPerByteLog2];
   int bit = (current_char & (kBitsPerByte - 1));
@@ -382,10 +385,10 @@ bool IndexIsInBounds(int index, int length) {
 
 template <typename Char>
 IrregexpInterpreter::Result RawMatch(
-    Isolate* isolate, ByteArray code_array, String subject_string,
-    base::Vector<const Char> subject, int* output_registers,
-    int output_register_count, int total_register_count, int current,
-    uint32_t current_char, RegExp::CallOrigin call_origin,
+    Isolate* isolate, Tagged<ByteArray> code_array,
+    Tagged<String> subject_string, base::Vector<const Char> subject,
+    int* output_registers, int output_register_count, int total_register_count,
+    int current, uint32_t current_char, RegExp::CallOrigin call_origin,
     const uint32_t backtrack_limit) {
   DisallowGarbageCollection no_gc;
 
@@ -437,8 +440,8 @@ IrregexpInterpreter::Result RawMatch(
 
 #endif  // V8_USE_COMPUTED_GOTO
 
-  const byte* pc = code_array.GetDataStartAddress();
-  const byte* code_base = pc;
+  const uint8_t* pc = code_array->GetDataStartAddress();
+  const uint8_t* code_base = pc;
 
   InterpreterRegisters registers(total_register_count, output_registers,
                                  output_register_count);
@@ -453,7 +456,7 @@ IrregexpInterpreter::Result RawMatch(
 #endif
 
   while (true) {
-    const byte* next_pc = pc;
+    const uint8_t* next_pc = pc;
     int32_t insn;
     int32_t next_insn;
 #if V8_USE_COMPUTED_GOTO
@@ -971,7 +974,7 @@ IrregexpInterpreter::Result RawMatch(
     BYTECODE(SKIP_UNTIL_BIT_IN_TABLE) {
       int32_t load_offset = LoadPacked24Signed(insn);
       int32_t advance = Load16AlignedSigned(pc + 4);
-      const byte* table = pc + 8;
+      const uint8_t* table = pc + 8;
       while (IndexIsInBounds(current + load_offset, subject.length())) {
         current_char = subject[current + load_offset];
         if (CheckBitInTable(current_char, table)) {
@@ -987,7 +990,7 @@ IrregexpInterpreter::Result RawMatch(
       int32_t load_offset = LoadPacked24Signed(insn);
       int32_t advance = Load16AlignedSigned(pc + 4);
       uint16_t limit = Load16Aligned(pc + 6);
-      const byte* table = pc + 8;
+      const uint8_t* table = pc + 8;
       while (IndexIsInBounds(current + load_offset, subject.length())) {
         current_char = subject[current + load_offset];
         if (current_char > limit) {
@@ -1054,29 +1057,29 @@ IrregexpInterpreter::Result RawMatch(
 
 // static
 IrregexpInterpreter::Result IrregexpInterpreter::Match(
-    Isolate* isolate, JSRegExp regexp, String subject_string,
+    Isolate* isolate, Tagged<JSRegExp> regexp, Tagged<String> subject_string,
     int* output_registers, int output_register_count, int start_position,
     RegExp::CallOrigin call_origin) {
-  if (v8_flags.regexp_tier_up) regexp.TierUpTick();
+  if (v8_flags.regexp_tier_up) regexp->TierUpTick();
 
   bool is_one_byte = String::IsOneByteRepresentationUnderneath(subject_string);
-  ByteArray code_array = ByteArray::cast(regexp.bytecode(is_one_byte));
-  int total_register_count = regexp.max_register_count();
+  Tagged<ByteArray> code_array = ByteArray::cast(regexp->bytecode(is_one_byte));
+  int total_register_count = regexp->max_register_count();
 
   return MatchInternal(isolate, code_array, subject_string, output_registers,
                        output_register_count, total_register_count,
-                       start_position, call_origin, regexp.backtrack_limit());
+                       start_position, call_origin, regexp->backtrack_limit());
 }
 
 IrregexpInterpreter::Result IrregexpInterpreter::MatchInternal(
-    Isolate* isolate, ByteArray code_array, String subject_string,
-    int* output_registers, int output_register_count, int total_register_count,
-    int start_position, RegExp::CallOrigin call_origin,
-    uint32_t backtrack_limit) {
-  DCHECK(subject_string.IsFlat());
+    Isolate* isolate, Tagged<ByteArray> code_array,
+    Tagged<String> subject_string, int* output_registers,
+    int output_register_count, int total_register_count, int start_position,
+    RegExp::CallOrigin call_origin, uint32_t backtrack_limit) {
+  DCHECK(subject_string->IsFlat());
 
   // TODO(chromium:1262676): Remove this CHECK once fixed.
-  CHECK(code_array.IsByteArray());
+  CHECK(IsByteArray(code_array));
 
   // Note: Heap allocation *is* allowed in two situations if calling from
   // Runtime:
@@ -1087,7 +1090,7 @@ IrregexpInterpreter::Result IrregexpInterpreter::MatchInternal(
   DisallowGarbageCollection no_gc;
 
   base::uc16 previous_char = '\n';
-  String::FlatContent subject_content = subject_string.GetFlatContent(no_gc);
+  String::FlatContent subject_content = subject_string->GetFlatContent(no_gc);
   // Because interrupts can result in GC and string content relocation, the
   // checksum verification in FlatContent may fail even though this code is
   // safe. See (2) above.
@@ -1129,10 +1132,10 @@ IrregexpInterpreter::Result IrregexpInterpreter::MatchForCallFromJs(
   DisallowHandleAllocation no_handles;
   DisallowHandleDereference no_deref;
 
-  String subject_string = String::cast(Object(subject));
-  JSRegExp regexp_obj = JSRegExp::cast(Object(regexp));
+  Tagged<String> subject_string = String::cast(Object(subject));
+  Tagged<JSRegExp> regexp_obj = JSRegExp::cast(Object(regexp));
 
-  if (regexp_obj.MarkedForTierUp()) {
+  if (regexp_obj->MarkedForTierUp()) {
     // Returning RETRY will re-enter through runtime, where actual recompilation
     // for tier-up takes place.
     return IrregexpInterpreter::RETRY;
diff --git a/deps/v8/src/regexp/regexp-interpreter.h b/deps/v8/src/regexp/regexp-interpreter.h
index e9dedd781b5b83..a1fe895a1b006c 100644
--- a/deps/v8/src/regexp/regexp-interpreter.h
+++ b/deps/v8/src/regexp/regexp-interpreter.h
@@ -49,17 +49,18 @@ class V8_EXPORT_PRIVATE IrregexpInterpreter : public AllStatic {
                                    RegExp::CallOrigin call_origin,
                                    Isolate* isolate, Address regexp);
 
-  static Result MatchInternal(Isolate* isolate, ByteArray code_array,
-                              String subject_string, int* output_registers,
-                              int output_register_count,
+  static Result MatchInternal(Isolate* isolate, Tagged<ByteArray> code_array,
+                              Tagged<String> subject_string,
+                              int* output_registers, int output_register_count,
                               int total_register_count, int start_position,
                               RegExp::CallOrigin call_origin,
                               uint32_t backtrack_limit);
 
  private:
-  static Result Match(Isolate* isolate, JSRegExp regexp, String subject_string,
-                      int* output_registers, int output_register_count,
-                      int start_position, RegExp::CallOrigin call_origin);
+  static Result Match(Isolate* isolate, Tagged<JSRegExp> regexp,
+                      Tagged<String> subject_string, int* output_registers,
+                      int output_register_count, int start_position,
+                      RegExp::CallOrigin call_origin);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/regexp/regexp-macro-assembler.cc b/deps/v8/src/regexp/regexp-macro-assembler.cc
index 26c405cd693f64..dea1568829cfc7 100644
--- a/deps/v8/src/regexp/regexp-macro-assembler.cc
+++ b/deps/v8/src/regexp/regexp-macro-assembler.cc
@@ -283,12 +283,12 @@ bool NativeRegExpMacroAssembler::CanReadUnaligned() const {
 // static
 int NativeRegExpMacroAssembler::CheckStackGuardState(
     Isolate* isolate, int start_index, RegExp::CallOrigin call_origin,
-    Address* return_address, InstructionStream re_code, Address* subject,
-    const byte** input_start, const byte** input_end) {
+    Address* return_address, Tagged<InstructionStream> re_code,
+    Address* subject, const uint8_t** input_start, const uint8_t** input_end) {
   DisallowGarbageCollection no_gc;
   Address old_pc = PointerAuthentication::AuthenticatePC(return_address, 0);
-  DCHECK_LE(re_code.instruction_start(), old_pc);
-  DCHECK_LE(old_pc, re_code.code(kAcquireLoad).InstructionEnd());
+  DCHECK_LE(re_code->instruction_start(), old_pc);
+  DCHECK_LE(old_pc, re_code->code(kAcquireLoad)->instruction_end());
 
   StackLimitCheck check(isolate);
   bool js_has_overflowed = check.JsHasOverflowed();
@@ -328,8 +328,8 @@ int NativeRegExpMacroAssembler::CheckStackGuardState(
       return_value = EXCEPTION;
     } else if (check.InterruptRequested()) {
       AllowGarbageCollection yes_gc;
-      Object result = isolate->stack_guard()->HandleInterrupts();
-      if (result.IsException(isolate)) return_value = EXCEPTION;
+      Tagged<Object> result = isolate->stack_guard()->HandleInterrupts();
+      if (IsException(result, isolate)) return_value = EXCEPTION;
     }
 
     // We are not using operator == here because it does a slow DCHECK
@@ -377,45 +377,45 @@ int NativeRegExpMacroAssembler::Match(Handle<JSRegExp> regexp,
   // DisallowGarbageCollection, since regexps might be preempted, and another
   // thread might do allocation anyway.
 
-  String subject_ptr = *subject;
+  Tagged<String> subject_ptr = *subject;
   // Character offsets into string.
   int start_offset = previous_index;
-  int char_length = subject_ptr.length() - start_offset;
+  int char_length = subject_ptr->length() - start_offset;
   int slice_offset = 0;
 
   // The string has been flattened, so if it is a cons string it contains the
   // full string in the first part.
   if (StringShape(subject_ptr).IsCons()) {
-    DCHECK_EQ(0, ConsString::cast(subject_ptr).second().length());
-    subject_ptr = ConsString::cast(subject_ptr).first();
+    DCHECK_EQ(0, ConsString::cast(subject_ptr)->second()->length());
+    subject_ptr = ConsString::cast(subject_ptr)->first();
   } else if (StringShape(subject_ptr).IsSliced()) {
-    SlicedString slice = SlicedString::cast(subject_ptr);
-    subject_ptr = slice.parent();
-    slice_offset = slice.offset();
+    Tagged<SlicedString> slice = SlicedString::cast(subject_ptr);
+    subject_ptr = slice->parent();
+    slice_offset = slice->offset();
   }
   if (StringShape(subject_ptr).IsThin()) {
-    subject_ptr = ThinString::cast(subject_ptr).actual();
+    subject_ptr = ThinString::cast(subject_ptr)->actual();
   }
   // Ensure that an underlying string has the same representation.
-  bool is_one_byte = subject_ptr.IsOneByteRepresentation();
-  DCHECK(subject_ptr.IsExternalString() || subject_ptr.IsSeqString());
+  bool is_one_byte = subject_ptr->IsOneByteRepresentation();
+  DCHECK(IsExternalString(subject_ptr) || IsSeqString(subject_ptr));
   // String is now either Sequential or External
   int char_size_shift = is_one_byte ? 0 : 1;
 
   DisallowGarbageCollection no_gc;
-  const byte* input_start =
-      subject_ptr.AddressOfCharacterAt(start_offset + slice_offset, no_gc);
+  const uint8_t* input_start =
+      subject_ptr->AddressOfCharacterAt(start_offset + slice_offset, no_gc);
   int byte_length = char_length << char_size_shift;
-  const byte* input_end = input_start + byte_length;
+  const uint8_t* input_end = input_start + byte_length;
   return Execute(*subject, start_offset, input_start, input_end, offsets_vector,
                  offsets_vector_length, isolate, *regexp);
 }
 
 // static
 int NativeRegExpMacroAssembler::ExecuteForTesting(
-    String input, int start_offset, const byte* input_start,
-    const byte* input_end, int* output, int output_size, Isolate* isolate,
-    JSRegExp regexp) {
+    Tagged<String> input, int start_offset, const uint8_t* input_start,
+    const uint8_t* input_end, int* output, int output_size, Isolate* isolate,
+    Tagged<JSRegExp> regexp) {
   return Execute(input, start_offset, input_start, input_end, output,
                  output_size, isolate, regexp);
 }
@@ -425,20 +425,21 @@ int NativeRegExpMacroAssembler::ExecuteForTesting(
 // the signature of the interpreter. We should get rid of JS objects passed to
 // internal methods.
 int NativeRegExpMacroAssembler::Execute(
-    String input,  // This needs to be the unpacked (sliced, cons) string.
-    int start_offset, const byte* input_start, const byte* input_end,
-    int* output, int output_size, Isolate* isolate, JSRegExp regexp) {
+    Tagged<String>
+        input,  // This needs to be the unpacked (sliced, cons) string.
+    int start_offset, const uint8_t* input_start, const uint8_t* input_end,
+    int* output, int output_size, Isolate* isolate, Tagged<JSRegExp> regexp) {
   RegExpStackScope stack_scope(isolate);
 
   bool is_one_byte = String::IsOneByteRepresentationUnderneath(input);
-  Code code = Code::cast(regexp.code(is_one_byte));
+  Tagged<Code> code = Code::cast(regexp->code(is_one_byte));
   RegExp::CallOrigin call_origin = RegExp::CallOrigin::kFromRuntime;
 
   using RegexpMatcherSig =
       // NOLINTNEXTLINE(readability/casting)
-      int(Address input_string, int start_offset, const byte* input_start,
-          const byte* input_end, int* output, int output_size, int call_origin,
-          Isolate* isolate, Address regexp);
+      int(Address input_string, int start_offset, const uint8_t* input_start,
+          const uint8_t* input_end, int* output, int output_size,
+          int call_origin, Isolate* isolate, Address regexp);
 
   auto fn = GeneratedCode<RegexpMatcherSig>::FromCode(isolate, code);
   int result = fn.Call(input.ptr(), start_offset, input_start, input_end,
@@ -459,7 +460,7 @@ int NativeRegExpMacroAssembler::Execute(
 #endif  // !COMPILING_IRREGEXP_FOR_EXTERNAL_EMBEDDER
 
 // clang-format off
-const byte NativeRegExpMacroAssembler::word_character_map[] = {
+const uint8_t NativeRegExpMacroAssembler::word_character_map[] = {
     0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u,
     0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u,
     0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u, 0x00u,
diff --git a/deps/v8/src/regexp/regexp-macro-assembler.h b/deps/v8/src/regexp/regexp-macro-assembler.h
index 2ba9e2d28d0bc8..932c90a7e119f7 100644
--- a/deps/v8/src/regexp/regexp-macro-assembler.h
+++ b/deps/v8/src/regexp/regexp-macro-assembler.h
@@ -303,12 +303,10 @@ class NativeRegExpMacroAssembler: public RegExpMacroAssembler {
                    int* offsets_vector, int offsets_vector_length,
                    int previous_index, Isolate* isolate);
 
-  V8_EXPORT_PRIVATE static int ExecuteForTesting(String input, int start_offset,
-                                                 const byte* input_start,
-                                                 const byte* input_end,
-                                                 int* output, int output_size,
-                                                 Isolate* isolate,
-                                                 JSRegExp regexp);
+  V8_EXPORT_PRIVATE static int ExecuteForTesting(
+      Tagged<String> input, int start_offset, const uint8_t* input_start,
+      const uint8_t* input_end, int* output, int output_size, Isolate* isolate,
+      Tagged<JSRegExp> regexp);
 
   bool CanReadUnaligned() const override;
 
@@ -332,9 +330,9 @@ class NativeRegExpMacroAssembler: public RegExpMacroAssembler {
   static int CheckStackGuardState(Isolate* isolate, int start_index,
                                   RegExp::CallOrigin call_origin,
                                   Address* return_address,
-                                  InstructionStream re_code, Address* subject,
-                                  const byte** input_start,
-                                  const byte** input_end);
+                                  Tagged<InstructionStream> re_code,
+                                  Address* subject, const uint8_t** input_start,
+                                  const uint8_t** input_end);
 
   static Address word_character_map_address() {
     return reinterpret_cast<Address>(&word_character_map[0]);
@@ -344,15 +342,16 @@ class NativeRegExpMacroAssembler: public RegExpMacroAssembler {
   // Byte map of one byte characters with a 0xff if the character is a word
   // character (digit, letter or underscore) and 0x00 otherwise.
   // Used by generated RegExp code.
-  static const byte word_character_map[256];
+  static const uint8_t word_character_map[256];
 
   Handle<ByteArray> GetOrAddRangeArray(const ZoneList<CharacterRange>* ranges);
 
  private:
   // Returns a {Result} sentinel, or the number of successful matches.
-  static int Execute(String input, int start_offset, const byte* input_start,
-                     const byte* input_end, int* output, int output_size,
-                     Isolate* isolate, JSRegExp regexp);
+  static int Execute(Tagged<String> input, int start_offset,
+                     const uint8_t* input_start, const uint8_t* input_end,
+                     int* output, int output_size, Isolate* isolate,
+                     Tagged<JSRegExp> regexp);
 
   ZoneUnorderedMap<uint32_t, Handle<FixedUInt16Array>> range_array_cache_;
 };
diff --git a/deps/v8/src/regexp/regexp-parser.cc b/deps/v8/src/regexp/regexp-parser.cc
index ef7ae24e273db1..de05f7a8ce9b6e 100644
--- a/deps/v8/src/regexp/regexp-parser.cc
+++ b/deps/v8/src/regexp/regexp-parser.cc
@@ -4,7 +4,6 @@
 
 #include "src/regexp/regexp-parser.h"
 
-#include "src/base/small-vector.h"
 #include "src/execution/isolate.h"
 #include "src/objects/string-inl.h"
 #include "src/regexp/regexp-ast.h"
@@ -47,15 +46,11 @@ enum class ClassSetOperandType {
 
 class RegExpTextBuilder {
  public:
-  using SmallRegExpTreeVector =
-      base::SmallVector<RegExpTree*, 8, ZoneAllocator<RegExpTree*>>;
+  using SmallRegExpTreeVector = SmallZoneVector<RegExpTree*, 8>;
 
   RegExpTextBuilder(Zone* zone, SmallRegExpTreeVector* terms_storage,
                     RegExpFlags flags)
-      : zone_(zone),
-        flags_(flags),
-        terms_(terms_storage),
-        text_(ZoneAllocator<RegExpTree*>{zone}) {}
+      : zone_(zone), flags_(flags), terms_(terms_storage), text_(zone) {}
   void AddCharacter(base::uc16 character);
   void AddUnicodeCharacter(base::uc32 character);
   void AddEscapedUnicodeCharacter(base::uc32 character);
@@ -79,8 +74,7 @@ class RegExpTextBuilder {
   bool ignore_case() const { return IsIgnoreCase(flags_); }
   bool IsUnicodeMode() const {
     // Either /v or /u enable UnicodeMode
-    // TODO(v8:11935): Change permalink once proposal is in stage 4.
-    // https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#sec-parsepattern
+    // https://tc39.es/ecma262/#sec-parsepattern
     return IsUnicode(flags_) || IsUnicodeSets(flags_);
   }
   Zone* zone() const { return zone_; }
@@ -299,8 +293,8 @@ class RegExpBuilder {
   RegExpBuilder(Zone* zone, RegExpFlags flags)
       : zone_(zone),
         flags_(flags),
-        terms_(ZoneAllocator<RegExpTree*>{zone}),
-        alternatives_(ZoneAllocator<RegExpTree*>{zone}),
+        terms_(zone),
+        alternatives_(zone),
         text_builder_(RegExpTextBuilder{zone, &terms_, flags}) {}
   void AddCharacter(base::uc16 character);
   void AddUnicodeCharacter(base::uc32 character);
@@ -327,8 +321,7 @@ class RegExpBuilder {
   void FlushTerms();
   bool IsUnicodeMode() const {
     // Either /v or /u enable UnicodeMode
-    // TODO(v8:11935): Change permalink once proposal is in stage 4.
-    // https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#sec-parsepattern
+    // https://tc39.es/ecma262/#sec-parsepattern
     return IsUnicode(flags_) || IsUnicodeSets(flags_);
   }
   Zone* zone() const { return zone_; }
@@ -338,8 +331,7 @@ class RegExpBuilder {
   bool pending_empty_ = false;
   const RegExpFlags flags_;
 
-  using SmallRegExpTreeVector =
-      base::SmallVector<RegExpTree*, 8, ZoneAllocator<RegExpTree*>>;
+  using SmallRegExpTreeVector = SmallZoneVector<RegExpTree*, 8>;
   SmallRegExpTreeVector terms_;
   SmallRegExpTreeVector alternatives_;
   RegExpTextBuilder text_builder_;
@@ -476,17 +468,22 @@ class RegExpParserImpl final {
   RegExpTree* ParseClassSetOperand(const RegExpBuilder* builder,
                                    ClassSetOperandType* type_out,
                                    ZoneList<CharacterRange>* ranges,
-                                   CharacterClassStrings* strings);
+                                   CharacterClassStrings* strings,
+                                   base::uc32* character);
   base::uc32 ParseClassSetCharacter();
   // Parses and returns a single escaped character.
   base::uc32 ParseCharacterEscape(InClassEscapeState in_class_escape_state,
                                   bool* is_escaped_unicode_character);
 
+  void AddMaybeSimpleCaseFoldedRange(ZoneList<CharacterRange>* ranges,
+                                     CharacterRange new_range);
+
   RegExpTree* ParseClassUnion(const RegExpBuilder* builder, bool is_negated,
                               RegExpTree* first_operand,
                               ClassSetOperandType first_operand_type,
                               ZoneList<CharacterRange>* ranges,
-                              CharacterClassStrings* strings);
+                              CharacterClassStrings* strings,
+                              base::uc32 first_character);
   RegExpTree* ParseClassIntersection(const RegExpBuilder* builder,
                                      bool is_negated, RegExpTree* first_operand,
                                      ClassSetOperandType first_operand_type);
@@ -520,8 +517,7 @@ class RegExpParserImpl final {
   RegExpFlags flags() const { return top_level_flags_; }
   bool IsUnicodeMode() const {
     // Either /v or /u enable UnicodeMode
-    // TODO(v8:11935): Change permalink once proposal is in stage 4.
-    // https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#sec-parsepattern
+    // https://tc39.es/ecma262/#sec-parsepattern
     return IsUnicode(flags()) || IsUnicodeSets(flags()) || force_unicode_;
   }
   bool unicode_sets() const { return IsUnicodeSets(flags()); }
@@ -608,6 +604,7 @@ class RegExpParserImpl final {
   ZoneList<RegExpCapture*>* captures_;
   ZoneSet<RegExpCapture*, RegExpCaptureNameLess>* named_captures_;
   ZoneList<RegExpBackReference*>* named_back_references_;
+  ZoneList<CharacterRange>* temp_ranges_;
   const CharT* const input_;
   const int input_length_;
   base::uc32 current_;
@@ -1846,8 +1843,7 @@ void ExtractStringsFromUnicodeSet(const icu::UnicodeSet& set,
   DCHECK(IsUnicodeSets(flags));
   DCHECK_NOT_NULL(strings);
 
-  RegExpTextBuilder::SmallRegExpTreeVector string_storage(
-      ZoneAllocator<RegExpTree*>{zone});
+  RegExpTextBuilder::SmallRegExpTreeVector string_storage(zone);
   RegExpTextBuilder string_builder(zone, &string_storage, flags);
   const bool needs_case_folding = IsIgnoreCase(flags);
   icu::UnicodeSetIterator iter(set);
@@ -1904,7 +1900,7 @@ bool LookupPropertyValueName(UProperty property,
       ExtractStringsFromUnicodeSet(set, result_strings, flags, zone);
     }
     const bool needs_case_folding = IsUnicodeSets(flags) && IsIgnoreCase(flags);
-    if (needs_case_folding) CharacterRange::UnicodeSimpleCloseOver(set);
+    if (needs_case_folding) set.closeOver(USET_SIMPLE_CASE_INSENSITIVE);
     set.removeAllStrings();
     if (negate) set.complement();
     for (int i = 0; i < set.getRangeCount(); i++) {
@@ -2110,13 +2106,22 @@ bool RegExpParserImpl<CharT>::AddPropertyClassRange(
     if (!IsSupportedBinaryProperty(property, unicode_sets())) return false;
     if (!IsExactPropertyAlias(name, property)) return false;
     // Negation of properties with strings is not allowed.
-    // TODO(v8:11935): Change permalink once proposal is in stage 4.
     // See
-    // https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#sec-static-semantics-maycontainstrings
+    // https://tc39.es/ecma262/#sec-static-semantics-maycontainstrings
     if (negate && IsBinaryPropertyOfStrings(property)) return false;
-    return LookupPropertyValueName(property, negate ? "N" : "Y", false,
-                                   add_to_ranges, add_to_strings, flags(),
-                                   zone());
+    if (unicode_sets()) {
+      // In /v mode we can't simple lookup the "false" binary property values,
+      // as the spec requires us to perform case folding before calculating the
+      // complement.
+      // See https://tc39.es/ecma262/#sec-compiletocharset
+      // UnicodePropertyValueExpression :: LoneUnicodePropertyNameOrValue
+      return LookupPropertyValueName(property, "Y", negate, add_to_ranges,
+                                     add_to_strings, flags(), zone());
+    } else {
+      return LookupPropertyValueName(property, negate ? "N" : "Y", false,
+                                     add_to_ranges, add_to_strings, flags(),
+                                     zone());
+    }
   } else {
     // Both property name and value name are specified. Attempt to interpret
     // the property name as enumerated property.
@@ -2339,8 +2344,7 @@ base::uc32 RegExpParserImpl<CharT>::ParseCharacterEscape(
   return c;
 }
 
-// TODO(v8:11935): Change permalink once proposal is in stage 4.
-// https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#prod-ClassRanges
+// https://tc39.es/ecma262/#prod-ClassRanges
 template <class CharT>
 RegExpTree* RegExpParserImpl<CharT>::ParseClassRanges(
     ZoneList<CharacterRange>* ranges, bool add_unicode_case_equivalents) {
@@ -2489,8 +2493,7 @@ void AddClassString(ZoneList<base::uc32>* normalized_string,
 
 }  // namespace
 
-// TODO(v8:11935): Change permalink once proposal is in stage 4.
-// https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#prod-ClassStringDisjunction
+// https://tc39.es/ecma262/#prod-ClassStringDisjunction
 template <class CharT>
 RegExpTree* RegExpParserImpl<CharT>::ParseClassStringDisjunction(
     ZoneList<CharacterRange>* ranges, CharacterClassStrings* strings) {
@@ -2506,8 +2509,7 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassStringDisjunction(
 
   ZoneList<base::uc32>* string =
       zone()->template New<ZoneList<base::uc32>>(4, zone());
-  RegExpTextBuilder::SmallRegExpTreeVector string_storage(
-      ZoneAllocator<RegExpTree*>{zone()});
+  RegExpTextBuilder::SmallRegExpTreeVector string_storage(zone());
   RegExpTextBuilder string_builder(zone(), &string_storage, flags());
 
   while (has_more() && current() != '}') {
@@ -2532,6 +2534,7 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassStringDisjunction(
   }
 
   AddClassString(string, string_builder.ToRegExp(), ranges, strings, zone());
+  CharacterRange::Canonicalize(ranges);
 
   // We don't need to handle missing closing '}' here.
   // If the character class is correctly closed, ParseClassSetCharacter will
@@ -2540,8 +2543,7 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassStringDisjunction(
   return nullptr;
 }
 
-// TODO(v8:11935): Change permalink once proposal is in stage 4.
-// https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#prod-ClassSetOperand
+// https://tc39.es/ecma262/#prod-ClassSetOperand
 // Tree returned based on type_out:
 //  * kNestedClass: RegExpClassSetExpression
 //  * For all other types: RegExpClassSetOperand
@@ -2552,12 +2554,13 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassSetOperand(
       zone()->template New<ZoneList<CharacterRange>>(1, zone());
   CharacterClassStrings* strings =
       zone()->template New<CharacterClassStrings>(zone());
-  RegExpTree* tree =
-      ParseClassSetOperand(builder, type_out, ranges, strings CHECK_FAILED);
+  base::uc32 character;
+  RegExpTree* tree = ParseClassSetOperand(builder, type_out, ranges, strings,
+                                          &character CHECK_FAILED);
   DCHECK_IMPLIES(*type_out != ClassSetOperandType::kNestedClass,
                  tree == nullptr);
   DCHECK_IMPLIES(*type_out == ClassSetOperandType::kClassSetCharacter,
-                 ranges->length() == 1);
+                 ranges->is_empty());
   DCHECK_IMPLIES(*type_out == ClassSetOperandType::kClassSetCharacter,
                  strings->empty());
   DCHECK_IMPLIES(*type_out == ClassSetOperandType::kNestedClass,
@@ -2572,21 +2575,27 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassSetOperand(
   // CharacterClassEscape includes \p{}, which can contain ranges, strings or
   // both and \P{}, which could contain nothing (i.e. \P{Any}).
   if (tree == nullptr) {
+    if (*type_out == ClassSetOperandType::kClassSetCharacter) {
+      AddMaybeSimpleCaseFoldedRange(ranges,
+                                    CharacterRange::Singleton(character));
+    }
     tree = zone()->template New<RegExpClassSetOperand>(ranges, strings);
   }
   return tree;
 }
 
-// TODO(v8:11935): Change permalink once proposal is in stage 4.
-// https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#prod-ClassSetOperand
-// Based on |type_out| either a tree is returned or ranges/strings modified.
-// If a tree is returned, ranges/strings are not modified.
-// If |type_out| is kNestedClass, a tree of type RegExpClassSetExpression is
-// returned. For all other types, ranges is modified and nullptr is returned.
+// https://tc39.es/ecma262/#prod-ClassSetOperand
+// Based on |type_out| either a tree is returned or
+// |ranges|/|strings|/|character| modified. If a tree is returned,
+// ranges/strings are not modified. If |type_out| is kNestedClass, a tree of
+// type RegExpClassSetExpression is returned. If | type_out| is
+// kClassSetCharacter, |character| is set and nullptr returned. For all other
+// types, |ranges|/|strings|/|character| is modified and nullptr is returned.
 template <class CharT>
 RegExpTree* RegExpParserImpl<CharT>::ParseClassSetOperand(
     const RegExpBuilder* builder, ClassSetOperandType* type_out,
-    ZoneList<CharacterRange>* ranges, CharacterClassStrings* strings) {
+    ZoneList<CharacterRange>* ranges, CharacterClassStrings* strings,
+    base::uc32* character) {
   DCHECK(unicode_sets());
   base::uc32 c = current();
   if (c == '\\') {
@@ -2613,7 +2622,7 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassSetOperand(
 
   *type_out = ClassSetOperandType::kClassSetCharacter;
   c = ParseClassSetCharacter(CHECK_FAILED);
-  ranges->Add(CharacterRange::Singleton(c), zone());
+  *character = c;
   return nullptr;
 }
 
@@ -2667,13 +2676,28 @@ bool MayContainStrings(ClassSetOperandType type, RegExpTree* operand) {
 
 }  // namespace
 
-// TODO(v8:11935): Change permalink once proposal is in stage 4.
-// https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#prod-ClassUnion
+template <class CharT>
+void RegExpParserImpl<CharT>::AddMaybeSimpleCaseFoldedRange(
+    ZoneList<CharacterRange>* ranges, CharacterRange new_range) {
+  DCHECK(unicode_sets());
+  if (ignore_case()) {
+    ZoneList<CharacterRange>* new_ranges =
+        zone()->template New<ZoneList<CharacterRange>>(2, zone());
+    new_ranges->Add(new_range, zone());
+    CharacterRange::AddUnicodeCaseEquivalents(new_ranges, zone());
+    ranges->AddAll(*new_ranges, zone());
+  } else {
+    ranges->Add(new_range, zone());
+  }
+  CharacterRange::Canonicalize(ranges);
+}
+
+// https://tc39.es/ecma262/#prod-ClassUnion
 template <class CharT>
 RegExpTree* RegExpParserImpl<CharT>::ParseClassUnion(
     const RegExpBuilder* builder, bool is_negated, RegExpTree* first_operand,
     ClassSetOperandType first_operand_type, ZoneList<CharacterRange>* ranges,
-    CharacterClassStrings* strings) {
+    CharacterClassStrings* strings, base::uc32 character) {
   DCHECK(unicode_sets());
   ZoneList<RegExpTree*>* operands =
       zone()->template New<ZoneList<RegExpTree*>>(2, zone());
@@ -2687,7 +2711,6 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassUnion(
     operands->Add(first_operand, zone());
   }
   ClassSetOperandType last_type = first_operand_type;
-  const bool needs_case_folding = ignore_case();
   while (has_more() && current() != ']') {
     if (current() == '-') {
       // Mix of ClassSetRange and ClassSubtraction is not allowed.
@@ -2704,42 +2727,36 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassUnion(
       // represent a character range.
       // In case one of them is not a ClassSetCharacter, it is a syntax error,
       // as '-' can not be used unescaped within a class with /v.
-      // TODO(v8:11935): Change permalink once proposal is in stage 4.
       // See
-      // https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#prod-ClassSetRange
+      // https://tc39.es/ecma262/#prod-ClassSetRange
       if (last_type != ClassSetOperandType::kClassSetCharacter) {
         return ReportError(RegExpError::kInvalidCharacterClass);
       }
-      ParseClassSetOperand(builder, &last_type, ranges, strings CHECK_FAILED);
+      base::uc32 from = character;
+      ParseClassSetOperand(builder, &last_type, ranges, strings,
+                           &character CHECK_FAILED);
       if (last_type != ClassSetOperandType::kClassSetCharacter) {
         return ReportError(RegExpError::kInvalidCharacterClass);
       }
-      // Remove the last two singleton characters added to ranges, and combine
-      // them into a range.
-      auto rhs_ranges = ranges->RemoveLast();
-      auto lhs_ranges = ranges->RemoveLast();
-      DCHECK(lhs_ranges.IsSingleton());
-      DCHECK(rhs_ranges.IsSingleton());
-      base::uc32 from = lhs_ranges.from();
-      base::uc32 to = rhs_ranges.from();
-      if (from > to) {
+      if (from > character) {
         return ReportError(RegExpError::kOutOfOrderCharacterClass);
       }
-      ranges->Add(CharacterRange::Range(from, to), zone());
+      AddMaybeSimpleCaseFoldedRange(ranges,
+                                    CharacterRange::Range(from, character));
       last_type = ClassSetOperandType::kClassSetRange;
     } else {
       DCHECK_NE(current(), '-');
-      RegExpTree* operand = ParseClassSetOperand(builder, &last_type, ranges,
-                                                 strings CHECK_FAILED);
+      if (last_type == ClassSetOperandType::kClassSetCharacter) {
+        AddMaybeSimpleCaseFoldedRange(ranges,
+                                      CharacterRange::Singleton(character));
+      }
+      RegExpTree* operand = ParseClassSetOperand(
+          builder, &last_type, ranges, strings, &character CHECK_FAILED);
       if (operand != nullptr) {
         may_contain_strings |= MayContainStrings(last_type, operand);
         // Add the range we started building as operand and reset the current
         // range.
         if (!ranges->is_empty() || !strings->empty()) {
-          if (needs_case_folding) {
-            CharacterRange::Canonicalize(ranges);
-            CharacterRange::AddUnicodeCaseEquivalents(ranges, zone());
-          }
           may_contain_strings |= !strings->empty();
           operands->Add(
               zone()->template New<RegExpClassSetOperand>(ranges, strings),
@@ -2756,12 +2773,12 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassUnion(
     return ReportError(RegExpError::kUnterminatedCharacterClass);
   }
 
+  if (last_type == ClassSetOperandType::kClassSetCharacter) {
+    AddMaybeSimpleCaseFoldedRange(ranges, CharacterRange::Singleton(character));
+  }
+
   // Add the range we started building as operand.
   if (!ranges->is_empty() || !strings->empty()) {
-    if (needs_case_folding) {
-      CharacterRange::Canonicalize(ranges);
-      CharacterRange::AddUnicodeCaseEquivalents(ranges, zone());
-    }
     may_contain_strings |= !strings->empty();
     operands->Add(zone()->template New<RegExpClassSetOperand>(ranges, strings),
                   zone());
@@ -2774,13 +2791,20 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassUnion(
     return ReportError(RegExpError::kNegatedCharacterClassWithStrings);
   }
 
+  if (operands->is_empty()) {
+    // Return empty expression if no operands were added (e.g. [\P{Any}]
+    // produces an empty range).
+    DCHECK(ranges->is_empty());
+    DCHECK(strings->empty());
+    return RegExpClassSetExpression::Empty(zone(), is_negated);
+  }
+
   return zone()->template New<RegExpClassSetExpression>(
       RegExpClassSetExpression::OperationType::kUnion, is_negated,
       may_contain_strings, operands);
 }
 
-// TODO(v8:11935): Change permalink once proposal is in stage 4.
-// https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#prod-ClassIntersection
+// https://tc39.es/ecma262/#prod-ClassIntersection
 template <class CharT>
 RegExpTree* RegExpParserImpl<CharT>::ParseClassIntersection(
     const RegExpBuilder* builder, bool is_negated, RegExpTree* first_operand,
@@ -2821,8 +2845,7 @@ RegExpTree* RegExpParserImpl<CharT>::ParseClassIntersection(
       may_contain_strings, operands);
 }
 
-// TODO(v8:11935): Change permalink once proposal is in stage 4.
-// https://arai-a.github.io/ecma262-compare/snapshot.html?pr=2418#prod-ClassSubtraction
+// https://tc39.es/ecma262/#prod-ClassSubtraction
 template <class CharT>
 RegExpTree* RegExpParserImpl<CharT>::ParseClassSubtraction(
     const RegExpBuilder* builder, bool is_negated, RegExpTree* first_operand,
@@ -2897,12 +2920,16 @@ RegExpTree* RegExpParserImpl<CharT>::ParseCharacterClass(
     ClassSetOperandType operand_type;
     CharacterClassStrings* strings =
         zone()->template New<CharacterClassStrings>(zone());
-    RegExpTree* operand = ParseClassSetOperand(builder, &operand_type, ranges,
-                                               strings CHECK_FAILED);
+    base::uc32 character;
+    RegExpTree* operand = ParseClassSetOperand(
+        builder, &operand_type, ranges, strings, &character CHECK_FAILED);
     switch (current()) {
       case '-':
         if (Next() == '-') {
           if (operand == nullptr) {
+            if (operand_type == ClassSetOperandType::kClassSetCharacter) {
+              ranges->Add(CharacterRange::Singleton(character), zone());
+            }
             operand =
                 zone()->template New<RegExpClassSetOperand>(ranges, strings);
           }
@@ -2914,6 +2941,9 @@ RegExpTree* RegExpParserImpl<CharT>::ParseCharacterClass(
       case '&':
         if (Next() == '&') {
           if (operand == nullptr) {
+            if (operand_type == ClassSetOperandType::kClassSetCharacter) {
+              ranges->Add(CharacterRange::Singleton(character), zone());
+            }
             operand =
                 zone()->template New<RegExpClassSetOperand>(ranges, strings);
           }
@@ -2922,7 +2952,7 @@ RegExpTree* RegExpParserImpl<CharT>::ParseCharacterClass(
         }
     }
     return ParseClassUnion(builder, is_negated, operand, operand_type, ranges,
-                           strings);
+                           strings, character);
   }
 }
 
diff --git a/deps/v8/src/regexp/regexp-stack.cc b/deps/v8/src/regexp/regexp-stack.cc
index 9c403eed089c89..bf1edfae294193 100644
--- a/deps/v8/src/regexp/regexp-stack.cc
+++ b/deps/v8/src/regexp/regexp-stack.cc
@@ -74,7 +74,7 @@ Address RegExpStack::EnsureCapacity(size_t size) {
   if (size > kMaximumStackSize) return kNullAddress;
   if (thread_local_.memory_size_ < size) {
     if (size < kMinimumDynamicStackSize) size = kMinimumDynamicStackSize;
-    byte* new_memory = NewArray<byte>(size);
+    uint8_t* new_memory = NewArray<uint8_t>(size);
     if (thread_local_.memory_size_ > 0) {
       // Copy original memory into top of new memory.
       MemCopy(new_memory + size - thread_local_.memory_size_,
diff --git a/deps/v8/src/regexp/regexp-stack.h b/deps/v8/src/regexp/regexp-stack.h
index 5711f7736db7d7..dadd0105e0b716 100644
--- a/deps/v8/src/regexp/regexp-stack.h
+++ b/deps/v8/src/regexp/regexp-stack.h
@@ -95,7 +95,7 @@ class RegExpStack final {
   // before NativeRegExpMacroAssembler::GrowStack must be called.
   static constexpr size_t kStaticStackSize =
       2 * kStackLimitSlack * kSystemPointerSize;
-  byte static_stack_[kStaticStackSize] = {0};
+  uint8_t static_stack_[kStaticStackSize] = {0};
 
   static_assert(kStaticStackSize <= kMaximumStackSize);
 
@@ -110,10 +110,10 @@ class RegExpStack final {
     //  - memory_, memory_top_, stack_pointer_ must be non-nullptr
     //  - memory_top_ = memory_ + memory_size_
     //  - memory_ <= stack_pointer_ <= memory_top_
-    byte* memory_ = nullptr;
-    byte* memory_top_ = nullptr;
+    uint8_t* memory_ = nullptr;
+    uint8_t* memory_top_ = nullptr;
     size_t memory_size_ = 0;
-    byte* stack_pointer_ = nullptr;
+    uint8_t* stack_pointer_ = nullptr;
     Address limit_ = kNullAddress;
     bool owns_memory_ = false;  // Whether memory_ is owned and must be freed.
 
diff --git a/deps/v8/src/regexp/regexp-utils.cc b/deps/v8/src/regexp/regexp-utils.cc
index b26007191d3dbe..bf58d114ecd77a 100644
--- a/deps/v8/src/regexp/regexp-utils.cc
+++ b/deps/v8/src/regexp/regexp-utils.cc
@@ -38,7 +38,7 @@ Handle<String> RegExpUtils::GenericCaptureGetter(
 namespace {
 
 V8_INLINE bool HasInitialRegExpMap(Isolate* isolate, JSReceiver recv) {
-  return recv.map() == isolate->regexp_function()->initial_map();
+  return recv->map() == isolate->regexp_function()->initial_map();
 }
 
 }  // namespace
@@ -49,8 +49,8 @@ MaybeHandle<Object> RegExpUtils::SetLastIndex(Isolate* isolate,
   Handle<Object> value_as_object =
       isolate->factory()->NewNumberFromInt64(value);
   if (HasInitialRegExpMap(isolate, *recv)) {
-    JSRegExp::cast(*recv).set_last_index(*value_as_object,
-                                         UPDATE_WRITE_BARRIER);
+    JSRegExp::cast(*recv)->set_last_index(*value_as_object,
+                                          UPDATE_WRITE_BARRIER);
     return recv;
   } else {
     return Object::SetProperty(
@@ -62,7 +62,7 @@ MaybeHandle<Object> RegExpUtils::SetLastIndex(Isolate* isolate,
 MaybeHandle<Object> RegExpUtils::GetLastIndex(Isolate* isolate,
                                               Handle<JSReceiver> recv) {
   if (HasInitialRegExpMap(isolate, *recv)) {
-    return handle(JSRegExp::cast(*recv).last_index(), isolate);
+    return handle(JSRegExp::cast(*recv)->last_index(), isolate);
   } else {
     return Object::GetProperty(isolate, recv,
                                isolate->factory()->lastIndex_string());
@@ -76,14 +76,14 @@ MaybeHandle<Object> RegExpUtils::RegExpExec(Isolate* isolate,
                                             Handle<JSReceiver> regexp,
                                             Handle<String> string,
                                             Handle<Object> exec) {
-  if (exec->IsUndefined(isolate)) {
+  if (IsUndefined(*exec, isolate)) {
     ASSIGN_RETURN_ON_EXCEPTION(
         isolate, exec,
         Object::GetProperty(isolate, regexp, isolate->factory()->exec_string()),
         Object);
   }
 
-  if (exec->IsCallable()) {
+  if (IsCallable(*exec)) {
     const int argc = 1;
     base::ScopedVector<Handle<Object>> argv(argc);
     argv[0] = string;
@@ -93,7 +93,7 @@ MaybeHandle<Object> RegExpUtils::RegExpExec(Isolate* isolate,
         isolate, result,
         Execution::Call(isolate, exec, regexp, argc, argv.begin()), Object);
 
-    if (!result->IsJSReceiver() && !result->IsNull(isolate)) {
+    if (!IsJSReceiver(*result) && !IsNull(*result, isolate)) {
       THROW_NEW_ERROR(isolate,
                       NewTypeError(MessageTemplate::kInvalidRegExpExecResult),
                       Object);
@@ -101,7 +101,7 @@ MaybeHandle<Object> RegExpUtils::RegExpExec(Isolate* isolate,
     return result;
   }
 
-  if (!regexp->IsJSRegExp()) {
+  if (!IsJSRegExp(*regexp)) {
     THROW_NEW_ERROR(isolate,
                     NewTypeError(MessageTemplate::kIncompatibleMethodReceiver,
                                  isolate->factory()->NewStringFromAsciiChecked(
@@ -126,18 +126,18 @@ bool RegExpUtils::IsUnmodifiedRegExp(Isolate* isolate, Handle<Object> obj) {
   if (isolate->force_slow_path()) return false;
 #endif
 
-  if (!obj->IsJSReceiver()) return false;
+  if (!IsJSReceiver(*obj)) return false;
 
   JSReceiver recv = JSReceiver::cast(*obj);
 
   if (!HasInitialRegExpMap(isolate, recv)) return false;
 
   // Check the receiver's prototype's map.
-  Object proto = recv.map().prototype();
-  if (!proto.IsJSReceiver()) return false;
+  Object proto = recv->map()->prototype();
+  if (!IsJSReceiver(proto)) return false;
 
   Handle<Map> initial_proto_initial_map = isolate->regexp_prototype_map();
-  Map proto_map = JSReceiver::cast(proto).map();
+  Map proto_map = JSReceiver::cast(proto)->map();
   if (proto_map != *initial_proto_initial_map) {
     return false;
   }
@@ -147,9 +147,9 @@ bool RegExpUtils::IsUnmodifiedRegExp(Isolate* isolate, Handle<Object> obj) {
   // with the init order in the bootstrapper).
   InternalIndex kExecIndex(JSRegExp::kExecFunctionDescriptorIndex);
   DCHECK_EQ(*(isolate->factory()->exec_string()),
-            proto_map.instance_descriptors(isolate).GetKey(kExecIndex));
-  if (proto_map.instance_descriptors(isolate)
-          .GetDetails(kExecIndex)
+            proto_map->instance_descriptors(isolate)->GetKey(kExecIndex));
+  if (proto_map->instance_descriptors(isolate)
+          ->GetDetails(kExecIndex)
           .constness() != PropertyConstness::kConst) {
     return false;
   }
@@ -164,8 +164,8 @@ bool RegExpUtils::IsUnmodifiedRegExp(Isolate* isolate, Handle<Object> obj) {
 
   // The smi check is required to omit ToLength(lastIndex) calls with possible
   // user-code execution on the fast path.
-  Object last_index = JSRegExp::cast(recv).last_index();
-  return last_index.IsSmi() && Smi::ToInt(last_index) >= 0;
+  Object last_index = JSRegExp::cast(recv)->last_index();
+  return IsSmi(last_index) && Smi::ToInt(last_index) >= 0;
 }
 
 uint64_t RegExpUtils::AdvanceStringIndex(Handle<String> string, uint64_t index,
diff --git a/deps/v8/src/regexp/regexp.cc b/deps/v8/src/regexp/regexp.cc
index e6e7d140a7a285..b3610922b49ce5 100644
--- a/deps/v8/src/regexp/regexp.cc
+++ b/deps/v8/src/regexp/regexp.cc
@@ -95,11 +95,13 @@ class RegExpImpl final : public AllStatic {
                       uint32_t& backtrack_limit);
 
   // For acting on the JSRegExp data FixedArray.
-  static int IrregexpMaxRegisterCount(FixedArray re);
-  static void SetIrregexpMaxRegisterCount(FixedArray re, int value);
-  static int IrregexpNumberOfCaptures(FixedArray re);
-  static ByteArray IrregexpByteCode(FixedArray re, bool is_one_byte);
-  static Code IrregexpNativeCode(FixedArray re, bool is_one_byte);
+  static int IrregexpMaxRegisterCount(Tagged<FixedArray> re);
+  static void SetIrregexpMaxRegisterCount(Tagged<FixedArray> re, int value);
+  static int IrregexpNumberOfCaptures(Tagged<FixedArray> re);
+  static Tagged<ByteArray> IrregexpByteCode(Tagged<FixedArray> re,
+                                            bool is_one_byte);
+  static Tagged<Code> IrregexpNativeCode(Tagged<FixedArray> re,
+                                         bool is_one_byte);
 };
 
 // static
@@ -271,7 +273,7 @@ MaybeHandle<Object> RegExp::Compile(Isolate* isolate, Handle<JSRegExp> re,
     RegExpImpl::IrregexpInitialize(isolate, re, pattern, flags,
                                    parse_result.capture_count, backtrack_limit);
   }
-  DCHECK(re->data().IsFixedArray());
+  DCHECK(IsFixedArray(re->data()));
   // Compilation succeeded so the data is set on the regexp
   // and we can store it in the cache.
   Handle<FixedArray> data(FixedArray::cast(re->data()), isolate);
@@ -348,8 +350,8 @@ void RegExpImpl::AtomCompile(Isolate* isolate, Handle<JSRegExp> re,
 namespace {
 
 void SetAtomLastCapture(Isolate* isolate,
-                        Handle<RegExpMatchInfo> last_match_info, String subject,
-                        int from, int to) {
+                        Handle<RegExpMatchInfo> last_match_info,
+                        Tagged<String> subject, int from, int to) {
   SealHandleScope shs(isolate);
   last_match_info->SetNumberOfCaptureRegisters(2);
   last_match_info->SetLastSubject(subject);
@@ -369,9 +371,9 @@ int RegExpImpl::AtomExecRaw(Isolate* isolate, Handle<JSRegExp> regexp,
   subject = String::Flatten(isolate, subject);
   DisallowGarbageCollection no_gc;  // ensure vectors stay valid
 
-  String needle = regexp->atom_pattern();
-  int needle_len = needle.length();
-  DCHECK(needle.IsFlat());
+  Tagged<String> needle = regexp->atom_pattern();
+  int needle_len = needle->length();
+  DCHECK(needle->IsFlat());
   DCHECK_LT(0, needle_len);
 
   if (index + needle_len > subject->length()) {
@@ -379,7 +381,7 @@ int RegExpImpl::AtomExecRaw(Isolate* isolate, Handle<JSRegExp> regexp,
   }
 
   for (int i = 0; i < output_size; i += 2) {
-    String::FlatContent needle_content = needle.GetFlatContent(no_gc);
+    String::FlatContent needle_content = needle->GetFlatContent(no_gc);
     String::FlatContent subject_content = subject->GetFlatContent(no_gc);
     DCHECK(needle_content.IsFlat());
     DCHECK(subject_content.IsFlat());
@@ -437,15 +439,15 @@ Handle<Object> RegExpImpl::AtomExec(Isolate* isolate, Handle<JSRegExp> re,
 bool RegExpImpl::EnsureCompiledIrregexp(Isolate* isolate, Handle<JSRegExp> re,
                                         Handle<String> sample_subject,
                                         bool is_one_byte) {
-  Object compiled_code = re->code(is_one_byte);
-  Object bytecode = re->bytecode(is_one_byte);
+  Tagged<Object> compiled_code = re->code(is_one_byte);
+  Tagged<Object> bytecode = re->bytecode(is_one_byte);
   bool needs_initial_compilation =
       compiled_code == Smi::FromInt(JSRegExp::kUninitializedValue);
   // Recompile is needed when we're dealing with the first execution of the
   // regexp after the decision to tier up has been made. If the tiering up
   // strategy is not in use, this value is always false.
   bool needs_tier_up_compilation =
-      re->MarkedForTierUp() && bytecode.IsByteArray();
+      re->MarkedForTierUp() && IsByteArray(bytecode);
 
   if (v8_flags.trace_regexp_tier_up && needs_tier_up_compilation) {
     PrintF("JSRegExp object %p needs tier-up compilation\n",
@@ -453,12 +455,12 @@ bool RegExpImpl::EnsureCompiledIrregexp(Isolate* isolate, Handle<JSRegExp> re,
   }
 
   if (!needs_initial_compilation && !needs_tier_up_compilation) {
-    DCHECK(compiled_code.IsCode());
-    DCHECK_IMPLIES(v8_flags.regexp_interpret_all, bytecode.IsByteArray());
+    DCHECK(IsCode(compiled_code));
+    DCHECK_IMPLIES(v8_flags.regexp_interpret_all, IsByteArray(bytecode));
     return true;
   }
 
-  DCHECK_IMPLIES(needs_tier_up_compilation, bytecode.IsByteArray());
+  DCHECK_IMPLIES(needs_tier_up_compilation, IsByteArray(bytecode));
 
   return CompileIrregexp(isolate, re, sample_subject, is_one_byte);
 }
@@ -467,8 +469,8 @@ namespace {
 
 #ifdef DEBUG
 bool RegExpCodeIsValidForPreCompilation(Handle<JSRegExp> re, bool is_one_byte) {
-  Object entry = re->code(is_one_byte);
-  Object bytecode = re->bytecode(is_one_byte);
+  Tagged<Object> entry = re->code(is_one_byte);
+  Tagged<Object> bytecode = re->bytecode(is_one_byte);
   // If we're not using the tier-up strategy, entry can only be a smi
   // representing an uncompiled regexp here. If we're using the tier-up
   // strategy, entry can still be a smi representing an uncompiled regexp, when
@@ -479,14 +481,14 @@ bool RegExpCodeIsValidForPreCompilation(Handle<JSRegExp> re, bool is_one_byte) {
   // representing an uncompiled regexp, even though we're "recompiling" after
   // the tier-up.
   if (re->ShouldProduceBytecode()) {
-    DCHECK(entry.IsSmi());
-    DCHECK(bytecode.IsSmi());
+    DCHECK(IsSmi(entry));
+    DCHECK(IsSmi(bytecode));
     int entry_value = Smi::ToInt(entry);
     int bytecode_value = Smi::ToInt(bytecode);
     DCHECK_EQ(JSRegExp::kUninitializedValue, entry_value);
     DCHECK_EQ(JSRegExp::kUninitializedValue, bytecode_value);
   } else {
-    DCHECK(entry.IsSmi() || (entry.IsCode() && bytecode.IsByteArray()));
+    DCHECK(IsSmi(entry) || (IsCode(entry) && IsByteArray(bytecode)));
   }
 
   return true;
@@ -579,7 +581,7 @@ bool RegExpImpl::CompileIrregexp(Isolate* isolate, Handle<JSRegExp> re,
   Handle<FixedArray> data =
       Handle<FixedArray>(FixedArray::cast(re->data()), isolate);
   if (compile_data.compilation_target == RegExpCompilationTarget::kNative) {
-    Code code = Code::cast(*compile_data.code);
+    Tagged<Code> code = Code::cast(*compile_data.code);
     data->set(JSRegExp::code_index(is_one_byte), code);
 
     // Reset bytecode to uninitialized. In case we use tier-up we know that
@@ -610,31 +612,33 @@ bool RegExpImpl::CompileIrregexp(Isolate* isolate, Handle<JSRegExp> re,
            reinterpret_cast<void*>(re->ptr()),
            re->ShouldProduceBytecode() ? "bytecode" : "native code",
            re->ShouldProduceBytecode()
-               ? IrregexpByteCode(*data, is_one_byte).Size()
-               : IrregexpNativeCode(*data, is_one_byte).Size());
+               ? IrregexpByteCode(*data, is_one_byte)->Size()
+               : IrregexpNativeCode(*data, is_one_byte)->Size());
   }
 
   return true;
 }
 
-int RegExpImpl::IrregexpMaxRegisterCount(FixedArray re) {
-  return Smi::ToInt(re.get(JSRegExp::kIrregexpMaxRegisterCountIndex));
+int RegExpImpl::IrregexpMaxRegisterCount(Tagged<FixedArray> re) {
+  return Smi::ToInt(re->get(JSRegExp::kIrregexpMaxRegisterCountIndex));
 }
 
-void RegExpImpl::SetIrregexpMaxRegisterCount(FixedArray re, int value) {
-  re.set(JSRegExp::kIrregexpMaxRegisterCountIndex, Smi::FromInt(value));
+void RegExpImpl::SetIrregexpMaxRegisterCount(Tagged<FixedArray> re, int value) {
+  re->set(JSRegExp::kIrregexpMaxRegisterCountIndex, Smi::FromInt(value));
 }
 
-int RegExpImpl::IrregexpNumberOfCaptures(FixedArray re) {
-  return Smi::ToInt(re.get(JSRegExp::kIrregexpCaptureCountIndex));
+int RegExpImpl::IrregexpNumberOfCaptures(Tagged<FixedArray> re) {
+  return Smi::ToInt(re->get(JSRegExp::kIrregexpCaptureCountIndex));
 }
 
-ByteArray RegExpImpl::IrregexpByteCode(FixedArray re, bool is_one_byte) {
-  return ByteArray::cast(re.get(JSRegExp::bytecode_index(is_one_byte)));
+Tagged<ByteArray> RegExpImpl::IrregexpByteCode(Tagged<FixedArray> re,
+                                               bool is_one_byte) {
+  return ByteArray::cast(re->get(JSRegExp::bytecode_index(is_one_byte)));
 }
 
-Code RegExpImpl::IrregexpNativeCode(FixedArray re, bool is_one_byte) {
-  return Code::cast(re.get(JSRegExp::code_index(is_one_byte)));
+Tagged<Code> RegExpImpl::IrregexpNativeCode(Tagged<FixedArray> re,
+                                            bool is_one_byte) {
+  return Code::cast(re->get(JSRegExp::code_index(is_one_byte)));
 }
 
 void RegExpImpl::IrregexpInitialize(Isolate* isolate, Handle<JSRegExp> re,
@@ -744,7 +748,7 @@ MaybeHandle<Object> RegExpImpl::IrregexpExec(
 
 #ifdef DEBUG
   if (v8_flags.trace_regexp_bytecodes && regexp->ShouldProduceBytecode()) {
-    PrintF("\n\nRegexp match:   /%s/\n\n", regexp->source().ToCString().get());
+    PrintF("\n\nRegexp match:   /%s/\n\n", regexp->source()->ToCString().get());
     PrintF("\n\nSubject string: '%s'\n\n", subject->ToCString().get());
   }
 #endif
@@ -1217,37 +1221,37 @@ int32_t* RegExpGlobalCache::LastSuccessfulMatch() {
   return &register_array_[index];
 }
 
-Object RegExpResultsCache::Lookup(Heap* heap, String key_string,
-                                  Object key_pattern,
-                                  FixedArray* last_match_cache,
-                                  ResultsCacheType type) {
-  FixedArray cache;
-  if (!key_string.IsInternalizedString()) return Smi::zero();
+Tagged<Object> RegExpResultsCache::Lookup(Heap* heap, Tagged<String> key_string,
+                                          Tagged<Object> key_pattern,
+                                          FixedArray* last_match_cache,
+                                          ResultsCacheType type) {
+  Tagged<FixedArray> cache;
+  if (!IsInternalizedString(key_string)) return Smi::zero();
   if (type == STRING_SPLIT_SUBSTRINGS) {
-    DCHECK(key_pattern.IsString());
-    if (!key_pattern.IsInternalizedString()) return Smi::zero();
+    DCHECK(IsString(key_pattern));
+    if (!IsInternalizedString(key_pattern)) return Smi::zero();
     cache = heap->string_split_cache();
   } else {
     DCHECK(type == REGEXP_MULTIPLE_INDICES);
-    DCHECK(key_pattern.IsFixedArray());
+    DCHECK(IsFixedArray(key_pattern));
     cache = heap->regexp_multiple_cache();
   }
 
-  uint32_t hash = key_string.hash();
+  uint32_t hash = key_string->hash();
   uint32_t index = ((hash & (kRegExpResultsCacheSize - 1)) &
                     ~(kArrayEntriesPerCacheEntry - 1));
-  if (cache.get(index + kStringOffset) != key_string ||
-      cache.get(index + kPatternOffset) != key_pattern) {
+  if (cache->get(index + kStringOffset) != key_string ||
+      cache->get(index + kPatternOffset) != key_pattern) {
     index =
         ((index + kArrayEntriesPerCacheEntry) & (kRegExpResultsCacheSize - 1));
-    if (cache.get(index + kStringOffset) != key_string ||
-        cache.get(index + kPatternOffset) != key_pattern) {
+    if (cache->get(index + kStringOffset) != key_string ||
+        cache->get(index + kPatternOffset) != key_pattern) {
       return Smi::zero();
     }
   }
 
-  *last_match_cache = FixedArray::cast(cache.get(index + kLastMatchOffset));
-  return cache.get(index + kArrayOffset);
+  *last_match_cache = FixedArray::cast(cache->get(index + kLastMatchOffset));
+  return cache->get(index + kArrayOffset);
 }
 
 void RegExpResultsCache::Enter(Isolate* isolate, Handle<String> key_string,
@@ -1257,14 +1261,14 @@ void RegExpResultsCache::Enter(Isolate* isolate, Handle<String> key_string,
                                ResultsCacheType type) {
   Factory* factory = isolate->factory();
   Handle<FixedArray> cache;
-  if (!key_string->IsInternalizedString()) return;
+  if (!IsInternalizedString(*key_string)) return;
   if (type == STRING_SPLIT_SUBSTRINGS) {
-    DCHECK(key_pattern->IsString());
-    if (!key_pattern->IsInternalizedString()) return;
+    DCHECK(IsString(*key_pattern));
+    if (!IsInternalizedString(*key_pattern)) return;
     cache = factory->string_split_cache();
   } else {
     DCHECK(type == REGEXP_MULTIPLE_INDICES);
-    DCHECK(key_pattern->IsFixedArray());
+    DCHECK(IsFixedArray(*key_pattern));
     cache = factory->regexp_multiple_cache();
   }
 
@@ -1309,9 +1313,9 @@ void RegExpResultsCache::Enter(Isolate* isolate, Handle<String> key_string,
       ReadOnlyRoots(isolate).fixed_cow_array_map());
 }
 
-void RegExpResultsCache::Clear(FixedArray cache) {
+void RegExpResultsCache::Clear(Tagged<FixedArray> cache) {
   for (int i = 0; i < kRegExpResultsCacheSize; i++) {
-    cache.set(i, Smi::zero());
+    cache->set(i, Smi::zero());
   }
 }
 
diff --git a/deps/v8/src/regexp/regexp.h b/deps/v8/src/regexp/regexp.h
index 2d9435d7051bab..b82b1b6fe808ca 100644
--- a/deps/v8/src/regexp/regexp.h
+++ b/deps/v8/src/regexp/regexp.h
@@ -214,14 +214,16 @@ class RegExpResultsCache final : public AllStatic {
 
   // Attempt to retrieve a cached result.  On failure, 0 is returned as a Smi.
   // On success, the returned result is guaranteed to be a COW-array.
-  static Object Lookup(Heap* heap, String key_string, Object key_pattern,
-                       FixedArray* last_match_out, ResultsCacheType type);
+  static Tagged<Object> Lookup(Heap* heap, Tagged<String> key_string,
+                               Tagged<Object> key_pattern,
+                               FixedArray* last_match_out,
+                               ResultsCacheType type);
   // Attempt to add value_array to the cache specified by type.  On success,
   // value_array is turned into a COW-array.
   static void Enter(Isolate* isolate, Handle<String> key_string,
                     Handle<Object> key_pattern, Handle<FixedArray> value_array,
                     Handle<FixedArray> last_match_cache, ResultsCacheType type);
-  static void Clear(FixedArray cache);
+  static void Clear(Tagged<FixedArray> cache);
 
   static constexpr int kRegExpResultsCacheSize = 0x100;
 
diff --git a/deps/v8/src/regexp/riscv/regexp-macro-assembler-riscv.cc b/deps/v8/src/regexp/riscv/regexp-macro-assembler-riscv.cc
index 4063b4b3d21948..3b57e613eefc15 100644
--- a/deps/v8/src/regexp/riscv/regexp-macro-assembler-riscv.cc
+++ b/deps/v8/src/regexp/riscv/regexp-macro-assembler-riscv.cc
@@ -681,8 +681,8 @@ Handle<HeapObject> RegExpMacroAssemblerRISCV::GetCode(Handle<String> source) {
     //
     // *int(*match)(String input_string,      // a0
     //             int start_offset,          // a1
-    //             byte* input_start,         // a2
-    //             byte* input_end,           // a3
+    //             uint8_t* input_start,      // a2
+    //             uint8_t* input_end,        // a3
     //             int* output,               // a4
     //             int output_size,           // a5
     //             int call_origin,           // a6
@@ -736,7 +736,8 @@ Handle<HeapObject> RegExpMacroAssemblerRISCV::GetCode(Handle<String> source) {
       __ Branch(&stack_limit_hit, le, a0, Operand(zero_reg));
       // Check if there is room for the variable number of registers above
       // the stack limit.
-      __ Branch(&stack_ok, uge, a0, Operand(num_registers_ * kPointerSize));
+      __ Branch(&stack_ok, uge, a0,
+                Operand(num_registers_ * kSystemPointerSize));
       // Exit with OutOfMemory exception. There is not enough space on the stack
       // for our working registers.
       __ li(a0, Operand(EXCEPTION));
@@ -876,19 +877,17 @@ Handle<HeapObject> RegExpMacroAssemblerRISCV::GetCode(Handle<String> source) {
         __ AddWord(a2, a2, num_saved_registers_ * kIntSize);
         __ StoreWord(a2, MemOperand(frame_pointer(), kRegisterOutputOffset));
 
-        // Prepare a0 to initialize registers with its value in the next run.
-        __ LoadWord(a0,
-                    MemOperand(frame_pointer(), kStringStartMinusOneOffset));
-
         // Restore the original regexp stack pointer value (effectively, pop the
         // stored base pointer).
         PopRegExpBasePointer(backtrack_stackpointer(), a2);
 
+        Label reload_string_start_minus_one;
+
         if (global_with_zero_length_check()) {
           // Special case for zero-length matches.
           // s3: capture start index
           // Not a zero-length match, restart.
-          __ Branch(&load_char_start_regexp, ne, current_input_offset(),
+          __ Branch(&reload_string_start_minus_one, ne, current_input_offset(),
                     Operand(s3));
           // Offset from the end is zero if we already reached the end.
           __ Branch(&exit_label_, eq, current_input_offset(),
@@ -901,6 +900,12 @@ Handle<HeapObject> RegExpMacroAssemblerRISCV::GetCode(Handle<String> source) {
           if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
         }
 
+        __ bind(&reload_string_start_minus_one);
+        // Prepare a0 to initialize registers with its value in the next run.
+        // Must be immediately before the jump to avoid clobbering.
+        __ LoadWord(a0,
+                    MemOperand(frame_pointer(), kStringStartMinusOneOffset));
+
         __ Branch(&load_char_start_regexp);
       } else {
         __ li(a0, Operand(SUCCESS));
@@ -1177,7 +1182,7 @@ void RegExpMacroAssemblerRISCV::CallCheckStackGuardState(Register scratch) {
 
   EmbeddedData d = EmbeddedData::FromBlob();
   CHECK(Builtins::IsIsolateIndependent(Builtin::kDirectCEntry));
-  Address entry = d.InstructionStartOfBuiltin(Builtin::kDirectCEntry);
+  Address entry = d.InstructionStartOf(Builtin::kDirectCEntry);
   __ li(kScratchReg, Operand(entry, RelocInfo::OFF_HEAP_TARGET));
   __ Call(kScratchReg);
 
@@ -1219,8 +1224,8 @@ int64_t RegExpMacroAssemblerRISCV::CheckStackGuardState(Address* return_address,
           frame_entry<int64_t>(re_frame, kDirectCallOffset)),
       return_address, re_code,
       frame_entry_address<Address>(re_frame, kInputStringOffset),
-      frame_entry_address<const byte*>(re_frame, kInputStartOffset),
-      frame_entry_address<const byte*>(re_frame, kInputEndOffset));
+      frame_entry_address<const uint8_t*>(re_frame, kInputStartOffset),
+      frame_entry_address<const uint8_t*>(re_frame, kInputEndOffset));
 }
 
 MemOperand RegExpMacroAssemblerRISCV::register_location(int register_index) {
diff --git a/deps/v8/src/regexp/s390/regexp-macro-assembler-s390.cc b/deps/v8/src/regexp/s390/regexp-macro-assembler-s390.cc
index 525fc32e99df68..3a111c59f240bd 100644
--- a/deps/v8/src/regexp/s390/regexp-macro-assembler-s390.cc
+++ b/deps/v8/src/regexp/s390/regexp-macro-assembler-s390.cc
@@ -87,7 +87,7 @@ namespace internal {
  *              Address end,
  *              int* capture_output_array,
  *              int num_capture_registers,
- *              byte* stack_area_base,
+ *              uint8_t* stack_area_base,
  *              bool direct_call = false,
  *              Isolate* isolate,
  *              Address regexp);
@@ -953,19 +953,18 @@ Handle<HeapObject> RegExpMacroAssemblerS390::GetCode(Handle<String> source) {
       __ AddS64(r4, Operand(num_saved_registers_ * kIntSize));
       __ StoreU64(r4, MemOperand(frame_pointer(), kRegisterOutputOffset));
 
-      // Prepare r2 to initialize registers with its value in the next run.
-      __ LoadU64(r2, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
-
       // Restore the original regexp stack pointer value (effectively, pop the
       // stored base pointer).
       PopRegExpBasePointer(backtrack_stackpointer(), r4);
 
+      Label reload_string_start_minus_one;
+
       if (global_with_zero_length_check()) {
         // Special case for zero-length matches.
         // r6: capture start index
         __ CmpS64(current_input_offset(), r6);
         // Not a zero-length match, restart.
-        __ bne(&load_char_start_regexp);
+        __ bne(&reload_string_start_minus_one);
         // Offset from the end is zero if we already reached the end.
         __ CmpS64(current_input_offset(), Operand::Zero());
         __ beq(&exit_label_);
@@ -976,6 +975,11 @@ Handle<HeapObject> RegExpMacroAssemblerS390::GetCode(Handle<String> source) {
         if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
       }
 
+      __ bind(&reload_string_start_minus_one);
+      // Prepare r2 to initialize registers with its value in the next run.
+      // Must be immediately before the jump to avoid clobbering.
+      __ LoadU64(r2, MemOperand(frame_pointer(), kStringStartMinusOneOffset));
+
       __ b(&load_char_start_regexp);
     } else {
       __ mov(r2, Operand(SUCCESS));
@@ -1249,7 +1253,7 @@ static T* frame_entry_address(Address re_frame, int frame_offset) {
 int RegExpMacroAssemblerS390::CheckStackGuardState(Address* return_address,
                                                    Address raw_code,
                                                    Address re_frame) {
-  InstructionStream re_code = InstructionStream::cast(Object(raw_code));
+  Tagged<InstructionStream> re_code = InstructionStream::cast(Object(raw_code));
   return NativeRegExpMacroAssembler::CheckStackGuardState(
       frame_entry<Isolate*>(re_frame, kIsolateOffset),
       frame_entry<intptr_t>(re_frame, kStartIndexOffset),
@@ -1257,8 +1261,8 @@ int RegExpMacroAssemblerS390::CheckStackGuardState(Address* return_address,
           frame_entry<intptr_t>(re_frame, kDirectCallOffset)),
       return_address, re_code,
       frame_entry_address<Address>(re_frame, kInputStringOffset),
-      frame_entry_address<const byte*>(re_frame, kInputStartOffset),
-      frame_entry_address<const byte*>(re_frame, kInputEndOffset));
+      frame_entry_address<const uint8_t*>(re_frame, kInputStartOffset),
+      frame_entry_address<const uint8_t*>(re_frame, kInputEndOffset));
 }
 
 MemOperand RegExpMacroAssemblerS390::register_location(int register_index) {
diff --git a/deps/v8/src/regexp/special-case.h b/deps/v8/src/regexp/special-case.h
index c80b94e976ab4c..753c9231ede397 100644
--- a/deps/v8/src/regexp/special-case.h
+++ b/deps/v8/src/regexp/special-case.h
@@ -71,21 +71,11 @@ namespace internal {
 // another character. Characters that match no other characters in
 // their equivalence class are added to IgnoreSet. Characters that
 // match at least one other character are added to SpecialAddSet.
-//
-// For unicode ignoreCase ("iu" and "iv"),
-// UnicodeSet::closeOver(USET_CASE_INSENSITIVE) adds all characters that are in
-// the same equivalence class. This includes characaters that are in the same
-// equivalence class using full case folding. According to the spec, only
-// simple case folding shall be considered. We therefore create
-// UnicodeNonSimpleCloseOverSet containing all characters for which
-// UnicodeSet::closeOver adds characters that are not simple case folds. This
-// set should be used similar to IgnoreSet described above.
 
 class RegExpCaseFolding final : public AllStatic {
  public:
   static const icu::UnicodeSet& IgnoreSet();
   static const icu::UnicodeSet& SpecialAddSet();
-  static const icu::UnicodeSet& UnicodeNonSimpleCloseOverSet();
 
   // This implements ECMAScript 2020 21.2.2.8.2 (Runtime Semantics:
   // Canonicalize) step 3, which is used to determine whether
diff --git a/deps/v8/src/regexp/x64/regexp-macro-assembler-x64.cc b/deps/v8/src/regexp/x64/regexp-macro-assembler-x64.cc
index 90ff2696a50d03..7c881f72b2584c 100644
--- a/deps/v8/src/regexp/x64/regexp-macro-assembler-x64.cc
+++ b/deps/v8/src/regexp/x64/regexp-macro-assembler-x64.cc
@@ -976,19 +976,18 @@ Handle<HeapObject> RegExpMacroAssemblerX64::GetCode(Handle<String> source) {
       __ addq(Operand(rbp, kRegisterOutputOffset),
               Immediate(num_saved_registers_ * kIntSize));
 
-      // Prepare rax to initialize registers with its value in the next run.
-      __ movq(rax, Operand(rbp, kStringStartMinusOneOffset));
-
       // Restore the original regexp stack pointer value (effectively, pop the
       // stored base pointer).
       PopRegExpBasePointer(backtrack_stackpointer(), kScratchRegister);
 
+      Label reload_string_start_minus_one;
+
       if (global_with_zero_length_check()) {
         // Special case for zero-length matches.
         // rdx: capture start index
         __ cmpq(rdi, rdx);
         // Not a zero-length match, restart.
-        __ j(not_equal, &load_char_start_regexp);
+        __ j(not_equal, &reload_string_start_minus_one);
         // rdi (offset from the end) is zero if we already reached the end.
         __ testq(rdi, rdi);
         __ j(zero, &exit_label_, Label::kNear);
@@ -1003,6 +1002,11 @@ Handle<HeapObject> RegExpMacroAssemblerX64::GetCode(Handle<String> source) {
         if (global_unicode()) CheckNotInSurrogatePair(0, &advance);
       }
 
+      __ bind(&reload_string_start_minus_one);
+      // Prepare rax to initialize registers with its value in the next run.
+      // Must be immediately before the jump to avoid clobbering.
+      __ movq(rax, Operand(rbp, kStringStartMinusOneOffset));
+
       __ jmp(&load_char_start_regexp);
     } else {
       __ Move(rax, SUCCESS);
@@ -1306,7 +1310,7 @@ static T* frame_entry_address(Address re_frame, int frame_offset) {
 int RegExpMacroAssemblerX64::CheckStackGuardState(Address* return_address,
                                                   Address raw_code,
                                                   Address re_frame) {
-  InstructionStream re_code = InstructionStream::cast(Object(raw_code));
+  Tagged<InstructionStream> re_code = InstructionStream::cast(Object(raw_code));
   return NativeRegExpMacroAssembler::CheckStackGuardState(
       frame_entry<Isolate*>(re_frame, kIsolateOffset),
       frame_entry<int>(re_frame, kStartIndexOffset),
@@ -1314,8 +1318,8 @@ int RegExpMacroAssemblerX64::CheckStackGuardState(Address* return_address,
           frame_entry<int>(re_frame, kDirectCallOffset)),
       return_address, re_code,
       frame_entry_address<Address>(re_frame, kInputStringOffset),
-      frame_entry_address<const byte*>(re_frame, kInputStartOffset),
-      frame_entry_address<const byte*>(re_frame, kInputEndOffset));
+      frame_entry_address<const uint8_t*>(re_frame, kInputStartOffset),
+      frame_entry_address<const uint8_t*>(re_frame, kInputEndOffset));
 }
 
 
diff --git a/deps/v8/src/roots/roots-inl.h b/deps/v8/src/roots/roots-inl.h
index 9c1748754a7cb0..11fb3392107dfb 100644
--- a/deps/v8/src/roots/roots-inl.h
+++ b/deps/v8/src/roots/roots-inl.h
@@ -15,6 +15,7 @@
 #include "src/objects/descriptor-array.h"
 #include "src/objects/feedback-vector.h"
 #include "src/objects/heap-number.h"
+#include "src/objects/hole.h"
 #include "src/objects/literal-objects.h"
 #include "src/objects/map.h"
 #include "src/objects/oddball.h"
@@ -24,6 +25,7 @@
 #include "src/objects/slots.h"
 #include "src/objects/string.h"
 #include "src/objects/swiss-name-dictionary.h"
+#include "src/objects/tagged.h"
 #include "src/roots/roots.h"
 #include "src/roots/static-roots.h"
 
@@ -79,23 +81,31 @@ ReadOnlyRoots::ReadOnlyRoots(LocalIsolate* isolate)
 // have the right type, and to avoid the heavy #includes that would be
 // required for checked casts.
 
-#define ROOT_ACCESSOR(Type, name, CamelName)                         \
-  Type ReadOnlyRoots::name() const {                                 \
-    DCHECK(CheckType_##name());                                      \
-    return unchecked_##name();                                       \
-  }                                                                  \
-  Type ReadOnlyRoots::unchecked_##name() const {                     \
-    return Type::unchecked_cast(object_at(RootIndex::k##CamelName)); \
-  }                                                                  \
-  Handle<Type> ReadOnlyRoots::name##_handle() const {                \
-    DCHECK(CheckType_##name());                                      \
-    Address* location = GetLocation(RootIndex::k##CamelName);        \
-    return Handle<Type>(location);                                   \
+#define ROOT_ACCESSOR(Type, name, CamelName)                                 \
+  Tagged<Type> ReadOnlyRoots::name() const {                                 \
+    DCHECK(CheckType_##name());                                              \
+    return unchecked_##name();                                               \
+  }                                                                          \
+  Tagged<Type> ReadOnlyRoots::unchecked_##name() const {                     \
+    return Tagged<Type>::unchecked_cast(object_at(RootIndex::k##CamelName)); \
+  }                                                                          \
+  Handle<Type> ReadOnlyRoots::name##_handle() const {                        \
+    DCHECK(CheckType_##name());                                              \
+    Address* location = GetLocation(RootIndex::k##CamelName);                \
+    return Handle<Type>(location);                                           \
   }
 
 READ_ONLY_ROOT_LIST(ROOT_ACCESSOR)
 #undef ROOT_ACCESSOR
 
+Tagged<Boolean> ReadOnlyRoots::boolean_value(bool value) const {
+  return value ? Tagged<Boolean>(true_value()) : Tagged<Boolean>(false_value());
+}
+Handle<Boolean> ReadOnlyRoots::boolean_value_handle(bool value) const {
+  return value ? Handle<Boolean>(true_value_handle())
+               : Handle<Boolean>(false_value_handle());
+}
+
 Address* ReadOnlyRoots::GetLocation(RootIndex root_index) const {
   size_t index = static_cast<size_t>(root_index);
   DCHECK_LT(index, kEntriesCount);
@@ -115,7 +125,7 @@ Address ReadOnlyRoots::last_name_for_protector() const {
   return address_at(RootIndex::kLastNameForProtector);
 }
 
-bool ReadOnlyRoots::IsNameForProtector(HeapObject object) const {
+bool ReadOnlyRoots::IsNameForProtector(Tagged<HeapObject> object) const {
   return base::IsInRange(object.ptr(), first_name_for_protector(),
                          last_name_for_protector());
 }
@@ -131,8 +141,8 @@ Handle<Object> ReadOnlyRoots::handle_at(RootIndex root_index) const {
   return Handle<Object>(GetLocation(root_index));
 }
 
-Object ReadOnlyRoots::object_at(RootIndex root_index) const {
-  return Object(address_at(root_index));
+Tagged<Object> ReadOnlyRoots::object_at(RootIndex root_index) const {
+  return Tagged<Object>(address_at(root_index));
 }
 
 Address ReadOnlyRoots::address_at(RootIndex root_index) const {
diff --git a/deps/v8/src/roots/roots.cc b/deps/v8/src/roots/roots.cc
index d76360f97a98f9..c5df21c3fae075 100644
--- a/deps/v8/src/roots/roots.cc
+++ b/deps/v8/src/roots/roots.cc
@@ -4,6 +4,8 @@
 
 #include "src/roots/roots.h"
 
+#include <type_traits>
+
 #include "src/common/globals.h"
 #include "src/objects/elements-kind.h"
 #include "src/objects/objects-inl.h"
@@ -13,6 +15,19 @@
 namespace v8 {
 namespace internal {
 
+static_assert(static_cast<int>(RootIndex::kUndefinedValue) ==
+              Internals::kUndefinedValueRootIndex);
+static_assert(static_cast<int>(RootIndex::kTheHoleValue) ==
+              Internals::kTheHoleValueRootIndex);
+static_assert(static_cast<int>(RootIndex::kNullValue) ==
+              Internals::kNullValueRootIndex);
+static_assert(static_cast<int>(RootIndex::kTrueValue) ==
+              Internals::kTrueValueRootIndex);
+static_assert(static_cast<int>(RootIndex::kFalseValue) ==
+              Internals::kFalseValueRootIndex);
+static_assert(static_cast<int>(RootIndex::kempty_string) ==
+              Internals::kEmptyStringRootIndex);
+
 const char* RootsTable::root_names_[RootsTable::kEntriesCount] = {
 #define ROOT_NAME(type, name, CamelName) #name,
     ROOT_LIST(ROOT_NAME)
@@ -33,25 +48,44 @@ void ReadOnlyRoots::Iterate(RootVisitor* visitor) {
 #ifdef DEBUG
 void ReadOnlyRoots::VerifyNameForProtectors() {
   DisallowGarbageCollection no_gc;
-  Name prev;
+  Tagged<Name> prev;
   for (RootIndex root_index = RootIndex::kFirstNameForProtector;
        root_index <= RootIndex::kLastNameForProtector; ++root_index) {
-    Name current = Name::cast(object_at(root_index));
+    Tagged<Name> current = Name::cast(object_at(root_index));
     DCHECK(IsNameForProtector(current));
     if (root_index != RootIndex::kFirstNameForProtector) {
       // Make sure the objects are adjacent in memory.
       CHECK_LT(prev.address(), current.address());
       Address computed_address =
-          prev.address() + ALIGN_TO_ALLOCATION_ALIGNMENT(prev.Size());
+          prev.address() + ALIGN_TO_ALLOCATION_ALIGNMENT(prev->Size());
       CHECK_EQ(computed_address, current.address());
     }
     prev = current;
   }
 }
 
-#define ROOT_TYPE_CHECK(Type, name, CamelName)   \
-  bool ReadOnlyRoots::CheckType_##name() const { \
-    return unchecked_##name().Is##Type();        \
+#define ROOT_TYPE_CHECK(Type, name, CamelName)                                \
+  bool ReadOnlyRoots::CheckType_##name() const {                              \
+    Tagged<Type> value = unchecked_##name();                                  \
+    /* For the oddball subtypes, the "IsFoo" checks only check for address in \
+     * the RORoots, which is trivially true here. So, do a slow check of the  \
+     * oddball kind instead. Do the casts via Tagged<Object> to satisfy cast  \
+     * compatibility static_asserts in the Tagged class. */                   \
+    if (std::is_same_v<Type, Undefined>) {                                    \
+      return Tagged<Oddball>::cast(Tagged<Object>(value))->kind() ==          \
+             Oddball::kUndefined;                                             \
+    } else if (std::is_same_v<Type, Null>) {                                  \
+      return Tagged<Oddball>::cast(Tagged<Object>(value))->kind() ==          \
+             Oddball::kNull;                                                  \
+    } else if (std::is_same_v<Type, True>) {                                  \
+      return Tagged<Oddball>::cast(Tagged<Object>(value))->kind() ==          \
+             Oddball::kTrue;                                                  \
+    } else if (std::is_same_v<Type, False>) {                                 \
+      return Tagged<Oddball>::cast(Tagged<Object>(value))->kind() ==          \
+             Oddball::kFalse;                                                 \
+    } else {                                                                  \
+      return Is##Type(value);                                                 \
+    }                                                                         \
   }
 
 READ_ONLY_ROOT_LIST(ROOT_TYPE_CHECK)
@@ -63,7 +97,7 @@ Handle<HeapNumber> ReadOnlyRoots::FindHeapNumber(double value) {
   for (auto pos = RootIndex::kFirstHeapNumberRoot;
        pos <= RootIndex::kLastHeapNumberRoot; ++pos) {
     auto root = HeapNumber::cast(object_at(pos));
-    if (base::bit_cast<uint64_t>(root.value()) == bits) {
+    if (base::bit_cast<uint64_t>(root->value()) == bits) {
       return Handle<HeapNumber>(GetLocation(pos));
     }
   }
diff --git a/deps/v8/src/roots/roots.h b/deps/v8/src/roots/roots.h
index 4beb2f218b134d..c3fbd291879710 100644
--- a/deps/v8/src/roots/roots.h
+++ b/deps/v8/src/roots/roots.h
@@ -13,26 +13,21 @@
 #include "src/objects/objects-definitions.h"
 #include "src/objects/objects.h"
 #include "src/objects/slots.h"
+#include "src/objects/tagged.h"
 
 namespace v8 {
 namespace internal {
 
 // Forward declarations.
+class Boolean;
 enum ElementsKind : uint8_t;
-template <typename T>
-class Handle;
-class Heap;
-class Isolate;
 class Factory;
 template <typename Impl>
 class FactoryBase;
 class LocalFactory;
-class Map;
 class PropertyCell;
 class ReadOnlyHeap;
 class RootVisitor;
-class String;
-class Symbol;
 
 #define STRONG_READ_ONLY_HEAP_NUMBER_ROOT_LIST(V)         \
   /* Special numbers */                                   \
@@ -64,11 +59,11 @@ class Symbol;
   V(Map, one_pointer_filler_map, OnePointerFillerMap)                          \
   V(Map, two_pointer_filler_map, TwoPointerFillerMap)                          \
   V(Oddball, uninitialized_value, UninitializedValue)                          \
-  V(Oddball, undefined_value, UndefinedValue)                                  \
-  V(Oddball, the_hole_value, TheHoleValue)                                     \
-  V(Oddball, null_value, NullValue)                                            \
-  V(Oddball, true_value, TrueValue)                                            \
-  V(Oddball, false_value, FalseValue)                                          \
+  V(Undefined, undefined_value, UndefinedValue)                                \
+  V(Hole, the_hole_value, TheHoleValue)                                        \
+  V(Null, null_value, NullValue)                                               \
+  V(True, true_value, TrueValue)                                               \
+  V(False, false_value, FalseValue)                                            \
   EXTRA_IMPORTANT_INTERNALIZED_STRING_ROOT_LIST(V)                             \
   V(Map, meta_map, MetaMap)                                                    \
   V(Map, byte_array_map, ByteArrayMap)                                         \
@@ -77,8 +72,8 @@ class Symbol;
   V(Map, fixed_double_array_map, FixedDoubleArrayMap)                          \
   V(Map, hash_table_map, HashTableMap)                                         \
   V(Map, symbol_map, SymbolMap)                                                \
-  V(Map, one_byte_string_map, OneByteStringMap)                                \
-  V(Map, one_byte_internalized_string_map, OneByteInternalizedStringMap)       \
+  V(Map, seq_one_byte_string_map, SeqOneByteStringMap)                         \
+  V(Map, internalized_one_byte_string_map, InternalizedOneByteStringMap)       \
   V(Map, scope_info_map, ScopeInfoMap)                                         \
   V(Map, shared_function_info_map, SharedFunctionInfoMap)                      \
   V(Map, instruction_stream_map, InstructionStreamMap)                         \
@@ -100,6 +95,8 @@ class Symbol;
   V(Oddball, termination_exception, TerminationException)                      \
   V(Oddball, optimized_out, OptimizedOut)                                      \
   V(Oddball, stale_register, StaleRegister)                                    \
+  /* Holes */                                                                  \
+  V(Hole, property_cell_hole_value, PropertyCellHoleValue)                     \
   /* Maps */                                                                   \
   V(Map, script_context_table_map, ScriptContextTableMap)                      \
   V(Map, closure_feedback_cell_array_map, ClosureFeedbackCellArrayMap)         \
@@ -129,8 +126,6 @@ class Symbol;
   V(Map, side_effect_call_handler_info_map, SideEffectCallHandlerInfoMap)      \
   V(Map, side_effect_free_call_handler_info_map,                               \
     SideEffectFreeCallHandlerInfoMap)                                          \
-  V(Map, next_call_side_effect_free_call_handler_info_map,                     \
-    NextCallSideEffectFreeCallHandlerInfoMap)                                  \
   V(Map, simple_number_dictionary_map, SimpleNumberDictionaryMap)              \
   V(Map, small_ordered_hash_map_map, SmallOrderedHashMapMap)                   \
   V(Map, small_ordered_hash_set_map, SmallOrderedHashSetMap)                   \
@@ -153,36 +148,41 @@ class Symbol;
   V(Map, ephemeron_hash_table_map, EphemeronHashTableMap)                      \
   V(Map, embedder_data_array_map, EmbedderDataArrayMap)                        \
   V(Map, weak_cell_map, WeakCellMap)                                           \
+  V(Map, external_pointer_array_map, ExternalPointerArrayMap)                  \
   /* String maps */                                                            \
-  V(Map, string_map, StringMap)                                                \
+  V(Map, seq_two_byte_string_map, SeqTwoByteStringMap)                         \
+  V(Map, cons_two_byte_string_map, ConsTwoByteStringMap)                       \
   V(Map, cons_one_byte_string_map, ConsOneByteStringMap)                       \
-  V(Map, cons_string_map, ConsStringMap)                                       \
-  V(Map, thin_string_map, ThinStringMap)                                       \
-  V(Map, sliced_string_map, SlicedStringMap)                                   \
+  V(Map, thin_two_byte_string_map, ThinTwoByteStringMap)                       \
+  V(Map, thin_one_byte_string_map, ThinOneByteStringMap)                       \
+  V(Map, sliced_two_byte_string_map, SlicedTwoByteStringMap)                   \
   V(Map, sliced_one_byte_string_map, SlicedOneByteStringMap)                   \
-  V(Map, external_string_map, ExternalStringMap)                               \
+  V(Map, external_two_byte_string_map, ExternalTwoByteStringMap)               \
   V(Map, external_one_byte_string_map, ExternalOneByteStringMap)               \
-  V(Map, uncached_external_string_map, UncachedExternalStringMap)              \
-  V(Map, internalized_string_map, InternalizedStringMap)                       \
-  V(Map, external_internalized_string_map, ExternalInternalizedStringMap)      \
-  V(Map, external_one_byte_internalized_string_map,                            \
-    ExternalOneByteInternalizedStringMap)                                      \
-  V(Map, uncached_external_internalized_string_map,                            \
-    UncachedExternalInternalizedStringMap)                                     \
-  V(Map, uncached_external_one_byte_internalized_string_map,                   \
-    UncachedExternalOneByteInternalizedStringMap)                              \
+  V(Map, internalized_two_byte_string_map, InternalizedTwoByteStringMap)       \
+  V(Map, external_internalized_two_byte_string_map,                            \
+    ExternalInternalizedTwoByteStringMap)                                      \
+  V(Map, external_internalized_one_byte_string_map,                            \
+    ExternalInternalizedOneByteStringMap)                                      \
+  V(Map, uncached_external_internalized_two_byte_string_map,                   \
+    UncachedExternalInternalizedTwoByteStringMap)                              \
+  V(Map, uncached_external_internalized_one_byte_string_map,                   \
+    UncachedExternalInternalizedOneByteStringMap)                              \
+  V(Map, uncached_external_two_byte_string_map,                                \
+    UncachedExternalTwoByteStringMap)                                          \
   V(Map, uncached_external_one_byte_string_map,                                \
     UncachedExternalOneByteStringMap)                                          \
-  V(Map, shared_one_byte_string_map, SharedOneByteStringMap)                   \
-  V(Map, shared_string_map, SharedStringMap)                                   \
+  V(Map, shared_seq_one_byte_string_map, SharedSeqOneByteStringMap)            \
+  V(Map, shared_seq_two_byte_string_map, SharedSeqTwoByteStringMap)            \
   V(Map, shared_external_one_byte_string_map, SharedExternalOneByteStringMap)  \
-  V(Map, shared_external_string_map, SharedExternalStringMap)                  \
+  V(Map, shared_external_two_byte_string_map, SharedExternalTwoByteStringMap)  \
   V(Map, shared_uncached_external_one_byte_string_map,                         \
     SharedUncachedExternalOneByteStringMap)                                    \
-  V(Map, shared_uncached_external_string_map, SharedUncachedExternalStringMap) \
+  V(Map, shared_uncached_external_two_byte_string_map,                         \
+    SharedUncachedExternalTwoByteStringMap)                                    \
   /* Oddball maps */                                                           \
   V(Map, undefined_map, UndefinedMap)                                          \
-  V(Map, the_hole_map, TheHoleMap)                                             \
+  V(Map, hole_map, HoleMap)                                                    \
   V(Map, null_map, NullMap)                                                    \
   V(Map, boolean_map, BooleanMap)                                              \
   V(Map, uninitialized_map, UninitializedMap)                                  \
@@ -193,10 +193,16 @@ class Symbol;
   V(Map, stale_register_map, StaleRegisterMap)                                 \
   V(Map, self_reference_marker_map, SelfReferenceMarkerMap)                    \
   V(Map, basic_block_counters_marker_map, BasicBlockCountersMarkerMap)         \
+  /* Shared space object maps */                                               \
+  V(Map, js_shared_array_map, JSSharedArrayMap)                                \
+  V(Map, js_atomics_mutex_map, JSAtomicsMutexMap)                              \
+  V(Map, js_atomics_condition_map, JSAtomicsConditionMap)                      \
   /* Canonical empty values */                                                 \
   V(EnumCache, empty_enum_cache, EmptyEnumCache)                               \
   V(PropertyArray, empty_property_array, EmptyPropertyArray)                   \
   V(ByteArray, empty_byte_array, EmptyByteArray)                               \
+  V(ExternalPointerArray, empty_external_pointer_array,                        \
+    EmptyExternalPointerArray)                                                 \
   V(ObjectBoilerplateDescription, empty_object_boilerplate_description,        \
     EmptyObjectBoilerplateDescription)                                         \
   V(ArrayBoilerplateDescription, empty_array_boilerplate_description,          \
@@ -233,6 +239,7 @@ class Symbol;
   V(RegisteredSymbolTable, empty_symbol_table, EmptySymbolTable)               \
   /* Hash seed */                                                              \
   V(ByteArray, hash_seed, HashSeed)                                            \
+  IF_WASM(V, HeapObject, wasm_null_padding, WasmNullPadding)                   \
   IF_WASM(V, WasmNull, wasm_null, WasmNull)
 
 // Mutable roots that are known to be immortal immovable, for which we can
@@ -249,6 +256,7 @@ class Symbol;
   V(PropertyCell, array_constructor_protector, ArrayConstructorProtector)      \
   V(PropertyCell, no_elements_protector, NoElementsProtector)                  \
   V(PropertyCell, mega_dom_protector, MegaDOMProtector)                        \
+  V(PropertyCell, no_profiling_protector, NoProfilingProtector)                \
   V(PropertyCell, is_concat_spreadable_protector, IsConcatSpreadableProtector) \
   V(PropertyCell, array_species_protector, ArraySpeciesProtector)              \
   V(PropertyCell, typed_array_species_protector, TypedArraySpeciesProtector)   \
@@ -264,8 +272,8 @@ class Symbol;
   V(PropertyCell, promise_then_protector, PromiseThenProtector)                \
   V(PropertyCell, set_iterator_protector, SetIteratorProtector)                \
   V(PropertyCell, string_iterator_protector, StringIteratorProtector)          \
-  V(PropertyCell, number_string_prototype_no_replace_protector,                \
-    NumberStringPrototypeNoReplaceProtector)                                   \
+  V(PropertyCell, number_string_not_regexp_like_protector,                     \
+    NumberStringNotRegexpLikeProtector)                                        \
   /* Caches */                                                                 \
   V(FixedArray, string_split_cache, StringSplitCache)                          \
   V(FixedArray, regexp_multiple_cache, RegExpMultipleCache)                    \
@@ -337,7 +345,7 @@ class Symbol;
     FeedbackVectorsForProfilingTools)                                       \
   V(FixedArray, serialized_objects, SerializedObjects)                      \
   V(FixedArray, serialized_global_proxy_sizes, SerializedGlobalProxySizes)  \
-  V(TemplateList, message_listeners, MessageListeners)                      \
+  V(ArrayList, message_listeners, MessageListeners)                         \
   /* Support for async stack traces */                                      \
   V(HeapObject, current_microtask, CurrentMicrotask)                        \
   /* KeepDuringJob set for JS WeakRefs */                                   \
@@ -351,7 +359,12 @@ class Symbol;
   IF_WASM(V, HeapObject, active_continuation, ActiveContinuation)           \
   IF_WASM(V, HeapObject, active_suspender, ActiveSuspender)                 \
   IF_WASM(V, WeakArrayList, js_to_wasm_wrappers, JSToWasmWrappers)          \
-  IF_WASM(V, WeakArrayList, wasm_canonical_rtts, WasmCanonicalRtts)
+  IF_WASM(V, WeakArrayList, wasm_canonical_rtts, WasmCanonicalRtts)         \
+  /* Internal SharedFunctionInfos */                                        \
+  V(FunctionTemplateInfo, error_stack_getter_fun_template,                  \
+    ErrorStackGetterSharedFun)                                              \
+  V(FunctionTemplateInfo, error_stack_setter_fun_template,                  \
+    ErrorStackSetterSharedFun)
 
 // Entries in this list are limited to Smis and are not visited during GC.
 #define SMI_ROOT_LIST(V)                                                       \
@@ -412,9 +425,9 @@ class Symbol;
   NAME_FOR_PROTECTOR_ROOT_LIST(V)  \
   DATA_HANDLER_MAPS_LIST(V)
 
-#define MUTABLE_ROOT_LIST(V)                \
-  STRONG_MUTABLE_IMMOVABLE_ROOT_LIST(V)     \
-  STRONG_MUTABLE_MOVABLE_ROOT_LIST(V)       \
+#define MUTABLE_ROOT_LIST(V)            \
+  STRONG_MUTABLE_IMMOVABLE_ROOT_LIST(V) \
+  STRONG_MUTABLE_MOVABLE_ROOT_LIST(V)   \
   SMI_ROOT_LIST(V)
 
 #define ROOT_LIST(V)     \
@@ -445,6 +458,10 @@ enum class RootIndex : uint16_t {
   kFirstHeapNumberRoot = kNanValue,
   kLastHeapNumberRoot = kSmiMaxValuePlusOne,
 
+  // Keep this in sync with the first map allocated by
+  // Heap::CreateLateReadOnlyJSReceiverMaps.
+  kFirstJSReceiverMapRoot = kJSSharedArrayMap,
+
   // Use for fast protector update checks
   kFirstNameForProtector = kconstructor_string,
   kNameForProtectorCount = 0 NAME_FOR_PROTECTOR_ROOT_LIST(COUNT_ROOT),
@@ -607,6 +624,10 @@ class RootsTable {
   friend class SoleReadOnlyHeap;
 };
 
+#define ROOT_TYPE_FWD_DECL(Type, name, CamelName) class Type;
+READ_ONLY_ROOT_LIST(ROOT_TYPE_FWD_DECL)
+#undef ROOT_TYPE_FWD_DECL
+
 class ReadOnlyRoots {
  public:
   static constexpr size_t kEntriesCount =
@@ -620,26 +641,29 @@ class ReadOnlyRoots {
   // map-word instead of a tagged heap pointer.
   MapWord one_pointer_filler_map_word();
 
-#define ROOT_ACCESSOR(Type, name, CamelName)     \
-  V8_INLINE class Type name() const;             \
-  V8_INLINE class Type unchecked_##name() const; \
+#define ROOT_ACCESSOR(Type, name, CamelName)       \
+  V8_INLINE Tagged<Type> name() const;             \
+  V8_INLINE Tagged<Type> unchecked_##name() const; \
   V8_INLINE Handle<Type> name##_handle() const;
 
   READ_ONLY_ROOT_LIST(ROOT_ACCESSOR)
 #undef ROOT_ACCESSOR
 
-  V8_INLINE bool IsNameForProtector(HeapObject object) const;
+  V8_INLINE bool IsNameForProtector(Tagged<HeapObject> object) const;
   V8_INLINE void VerifyNameForProtectorsPages() const;
 #ifdef DEBUG
   void VerifyNameForProtectors();
 #endif
 
+  V8_INLINE Tagged<Boolean> boolean_value(bool value) const;
+  V8_INLINE Handle<Boolean> boolean_value_handle(bool value) const;
+
   // Returns heap number with identical value if it already exists or the empty
   // handle otherwise.
   Handle<HeapNumber> FindHeapNumber(double value);
 
   V8_INLINE Address address_at(RootIndex root_index) const;
-  V8_INLINE Object object_at(RootIndex root_index) const;
+  V8_INLINE Tagged<Object> object_at(RootIndex root_index) const;
   V8_INLINE Handle<Object> handle_at(RootIndex root_index) const;
 
   // Check if a slot is initialized yet. Should only be neccessary for code
@@ -675,6 +699,7 @@ class ReadOnlyRoots {
 
   friend class ReadOnlyHeap;
   friend class DeserializerAllocator;
+  friend class ReadOnlyHeapImageDeserializer;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/roots/static-roots.h b/deps/v8/src/roots/static-roots.h
index df53f43736888f..1be1f3a753f62f 100644
--- a/deps/v8/src/roots/static-roots.h
+++ b/deps/v8/src/roots/static-roots.h
@@ -12,7 +12,6 @@
 
 #if V8_STATIC_ROOTS_BOOL
 
-#include "src/objects/instance-type.h"
 #include "src/roots/roots.h"
 
 // Disabling Wasm or Intl invalidates the contents of static-roots.h.
@@ -33,7 +32,7 @@ struct StaticReadOnlyRoot {
   static constexpr Tagged_t kDescriptorArrayMap = 0x129;
   static constexpr Tagged_t kUndefinedMap = 0x151;
   static constexpr Tagged_t kNullMap = 0x179;
-  static constexpr Tagged_t kTheHoleMap = 0x1a1;
+  static constexpr Tagged_t kHoleMap = 0x1a1;
   static constexpr Tagged_t kCallSiteInfoMap = 0x1c9;
   static constexpr Tagged_t kEnumCacheMap = 0x1f1;
   static constexpr Tagged_t kEmptyFixedArray = 0x219;
@@ -42,733 +41,748 @@ struct StaticReadOnlyRoot {
   static constexpr Tagged_t kNullValue = 0x235;
   static constexpr Tagged_t kUndefinedValue = 0x251;
   static constexpr Tagged_t kTheHoleValue = 0x26d;
-  static constexpr Tagged_t kEmptyEnumCache = 0x289;
-  static constexpr Tagged_t kEmptyDescriptorArray = 0x295;
-  static constexpr Tagged_t kScopeInfoMap = 0x2a5;
-  static constexpr Tagged_t kModuleInfoMap = 0x2cd;
-  static constexpr Tagged_t kClosureFeedbackCellArrayMap = 0x2f5;
-  static constexpr Tagged_t kFeedbackVectorMap = 0x31d;
-  static constexpr Tagged_t kHeapNumberMap = 0x345;
-  static constexpr Tagged_t kForeignMap = 0x36d;
-  static constexpr Tagged_t kMegaDomHandlerMap = 0x395;
-  static constexpr Tagged_t kBooleanMap = 0x3bd;
-  static constexpr Tagged_t kUninitializedMap = 0x3e5;
-  static constexpr Tagged_t kArgumentsMarkerMap = 0x40d;
-  static constexpr Tagged_t kExceptionMap = 0x435;
-  static constexpr Tagged_t kTerminationExceptionMap = 0x45d;
-  static constexpr Tagged_t kOptimizedOutMap = 0x485;
-  static constexpr Tagged_t kStaleRegisterMap = 0x4ad;
-  static constexpr Tagged_t kSelfReferenceMarkerMap = 0x4d5;
-  static constexpr Tagged_t kBasicBlockCountersMarkerMap = 0x4fd;
-  static constexpr Tagged_t kBigIntMap = 0x525;
-  static constexpr Tagged_t kSymbolMap = 0x54d;
-  static constexpr Tagged_t kStringMap = 0x575;
-  static constexpr Tagged_t kOneByteStringMap = 0x59d;
-  static constexpr Tagged_t kConsStringMap = 0x5c5;
-  static constexpr Tagged_t kConsOneByteStringMap = 0x5ed;
-  static constexpr Tagged_t kSlicedStringMap = 0x615;
-  static constexpr Tagged_t kSlicedOneByteStringMap = 0x63d;
-  static constexpr Tagged_t kExternalStringMap = 0x665;
-  static constexpr Tagged_t kExternalOneByteStringMap = 0x68d;
-  static constexpr Tagged_t kUncachedExternalStringMap = 0x6b5;
-  static constexpr Tagged_t kUncachedExternalOneByteStringMap = 0x6dd;
-  static constexpr Tagged_t kSharedExternalStringMap = 0x705;
-  static constexpr Tagged_t kSharedExternalOneByteStringMap = 0x72d;
-  static constexpr Tagged_t kSharedUncachedExternalStringMap = 0x755;
-  static constexpr Tagged_t kSharedUncachedExternalOneByteStringMap = 0x77d;
-  static constexpr Tagged_t kExternalInternalizedStringMap = 0x7a5;
-  static constexpr Tagged_t kExternalOneByteInternalizedStringMap = 0x7cd;
-  static constexpr Tagged_t kUncachedExternalInternalizedStringMap = 0x7f5;
-  static constexpr Tagged_t kUncachedExternalOneByteInternalizedStringMap =
-      0x81d;
-  static constexpr Tagged_t kInternalizedStringMap = 0x845;
-  static constexpr Tagged_t kOneByteInternalizedStringMap = 0x86d;
-  static constexpr Tagged_t kThinStringMap = 0x895;
-  static constexpr Tagged_t kSharedStringMap = 0x8bd;
-  static constexpr Tagged_t kSharedOneByteStringMap = 0x8e5;
-  static constexpr Tagged_t kFixedDoubleArrayMap = 0x90d;
-  static constexpr Tagged_t kFeedbackMetadataArrayMap = 0x935;
-  static constexpr Tagged_t kByteArrayMap = 0x95d;
-  static constexpr Tagged_t kBytecodeArrayMap = 0x985;
-  static constexpr Tagged_t kFreeSpaceMap = 0x9ad;
-  static constexpr Tagged_t kPropertyArrayMap = 0x9d5;
-  static constexpr Tagged_t kSmallOrderedHashMapMap = 0x9fd;
-  static constexpr Tagged_t kSmallOrderedHashSetMap = 0xa25;
-  static constexpr Tagged_t kSmallOrderedNameDictionaryMap = 0xa4d;
-  static constexpr Tagged_t kInstructionStreamMap = 0xa75;
-  static constexpr Tagged_t kCellMap = 0xa9d;
-  static constexpr Tagged_t kInvalidPrototypeValidityCell = 0xac5;
-  static constexpr Tagged_t kGlobalPropertyCellMap = 0xacd;
-  static constexpr Tagged_t kOnePointerFillerMap = 0xaf5;
-  static constexpr Tagged_t kTwoPointerFillerMap = 0xb1d;
-  static constexpr Tagged_t kNoClosuresCellMap = 0xb45;
-  static constexpr Tagged_t kOneClosureCellMap = 0xb6d;
-  static constexpr Tagged_t kManyClosuresCellMap = 0xb95;
-  static constexpr Tagged_t kTransitionArrayMap = 0xbbd;
-  static constexpr Tagged_t kHashTableMap = 0xbe5;
-  static constexpr Tagged_t kOrderedNameDictionaryMap = 0xc0d;
-  static constexpr Tagged_t kNameDictionaryMap = 0xc35;
-  static constexpr Tagged_t kSwissNameDictionaryMap = 0xc5d;
-  static constexpr Tagged_t kGlobalDictionaryMap = 0xc85;
-  static constexpr Tagged_t kNumberDictionaryMap = 0xcad;
-  static constexpr Tagged_t kRegisteredSymbolTableMap = 0xcd5;
-  static constexpr Tagged_t kArrayListMap = 0xcfd;
-  static constexpr Tagged_t kAccessorInfoMap = 0xd25;
-  static constexpr Tagged_t kPreparseDataMap = 0xd4d;
-  static constexpr Tagged_t kSharedFunctionInfoMap = 0xd75;
-  static constexpr Tagged_t kCodeMap = 0xd9d;
-  static constexpr Tagged_t kTrueValue = 0xdc5;
-  static constexpr Tagged_t kFalseValue = 0xde1;
-  static constexpr Tagged_t kHashSeed = 0xdfd;
-  static constexpr Tagged_t kempty_string = 0xe0d;
-  static constexpr Tagged_t klength_string = 0xe19;
-  static constexpr Tagged_t kprototype_string = 0xe2d;
-  static constexpr Tagged_t kname_string = 0xe45;
-  static constexpr Tagged_t kenumerable_string = 0xe55;
-  static constexpr Tagged_t kconfigurable_string = 0xe6d;
-  static constexpr Tagged_t kvalue_string = 0xe85;
-  static constexpr Tagged_t kwritable_string = 0xe99;
-  static constexpr Tagged_t knot_mapped_symbol = 0xead;
-  static constexpr Tagged_t kuninitialized_symbol = 0xebd;
-  static constexpr Tagged_t kmegamorphic_symbol = 0xecd;
-  static constexpr Tagged_t kelements_transition_symbol = 0xedd;
-  static constexpr Tagged_t kmega_dom_symbol = 0xeed;
-  static constexpr Tagged_t kEmptyPropertyDictionary = 0xefd;
-  static constexpr Tagged_t kEmptyOrderedPropertyDictionary = 0xf29;
-  static constexpr Tagged_t kEmptySwissPropertyDictionary = 0xf4d;
-  static constexpr Tagged_t kEmptyByteArray = 0xf6d;
-  static constexpr Tagged_t kEmptyScopeInfo = 0xf75;
-  static constexpr Tagged_t kEmptyPropertyArray = 0xf85;
-  static constexpr Tagged_t kMinusZeroValue = 0xf8d;
-  static constexpr Tagged_t kNanValue = 0xf99;
-  static constexpr Tagged_t kHoleNanValue = 0xfa5;
-  static constexpr Tagged_t kInfinityValue = 0xfb1;
-  static constexpr Tagged_t kMinusInfinityValue = 0xfbd;
-  static constexpr Tagged_t kMaxSafeInteger = 0xfc9;
-  static constexpr Tagged_t kMaxUInt32 = 0xfd5;
-  static constexpr Tagged_t kSmiMinValue = 0xfe1;
-  static constexpr Tagged_t kSmiMaxValuePlusOne = 0xfed;
-  static constexpr Tagged_t kPromiseFulfillReactionJobTaskMap = 0xff9;
-  static constexpr Tagged_t kPromiseRejectReactionJobTaskMap = 0x1021;
-  static constexpr Tagged_t kCallableTaskMap = 0x1049;
-  static constexpr Tagged_t kCallbackTaskMap = 0x1071;
-  static constexpr Tagged_t kPromiseResolveThenableJobTaskMap = 0x1099;
-  static constexpr Tagged_t kFunctionTemplateInfoMap = 0x10c1;
-  static constexpr Tagged_t kObjectTemplateInfoMap = 0x10e9;
-  static constexpr Tagged_t kAccessCheckInfoMap = 0x1111;
-  static constexpr Tagged_t kAccessorPairMap = 0x1139;
-  static constexpr Tagged_t kAliasedArgumentsEntryMap = 0x1161;
-  static constexpr Tagged_t kAllocationMementoMap = 0x1189;
-  static constexpr Tagged_t kArrayBoilerplateDescriptionMap = 0x11b1;
-  static constexpr Tagged_t kAsmWasmDataMap = 0x11d9;
-  static constexpr Tagged_t kAsyncGeneratorRequestMap = 0x1201;
-  static constexpr Tagged_t kBreakPointMap = 0x1229;
-  static constexpr Tagged_t kBreakPointInfoMap = 0x1251;
-  static constexpr Tagged_t kClassPositionsMap = 0x1279;
-  static constexpr Tagged_t kDebugInfoMap = 0x12a1;
-  static constexpr Tagged_t kErrorStackDataMap = 0x12c9;
-  static constexpr Tagged_t kFunctionTemplateRareDataMap = 0x12f1;
-  static constexpr Tagged_t kInterceptorInfoMap = 0x1319;
-  static constexpr Tagged_t kInterpreterDataMap = 0x1341;
-  static constexpr Tagged_t kModuleRequestMap = 0x1369;
-  static constexpr Tagged_t kPromiseCapabilityMap = 0x1391;
-  static constexpr Tagged_t kPromiseOnStackMap = 0x13b9;
-  static constexpr Tagged_t kPromiseReactionMap = 0x13e1;
-  static constexpr Tagged_t kPropertyDescriptorObjectMap = 0x1409;
-  static constexpr Tagged_t kPrototypeInfoMap = 0x1431;
-  static constexpr Tagged_t kRegExpBoilerplateDescriptionMap = 0x1459;
-  static constexpr Tagged_t kScriptMap = 0x1481;
-  static constexpr Tagged_t kScriptOrModuleMap = 0x14a9;
-  static constexpr Tagged_t kSourceTextModuleInfoEntryMap = 0x14d1;
-  static constexpr Tagged_t kStackFrameInfoMap = 0x14f9;
-  static constexpr Tagged_t kTemplateObjectDescriptionMap = 0x1521;
-  static constexpr Tagged_t kTuple2Map = 0x1549;
-  static constexpr Tagged_t kWasmExceptionTagMap = 0x1571;
-  static constexpr Tagged_t kWasmIndirectFunctionTableMap = 0x1599;
-  static constexpr Tagged_t kAllocationSiteWithWeakNextMap = 0x15c1;
-  static constexpr Tagged_t kAllocationSiteWithoutWeakNextMap = 0x15e9;
-  static constexpr Tagged_t kLoadHandler1Map = 0x1611;
-  static constexpr Tagged_t kLoadHandler2Map = 0x1639;
-  static constexpr Tagged_t kLoadHandler3Map = 0x1661;
-  static constexpr Tagged_t kStoreHandler0Map = 0x1689;
-  static constexpr Tagged_t kStoreHandler1Map = 0x16b1;
-  static constexpr Tagged_t kStoreHandler2Map = 0x16d9;
-  static constexpr Tagged_t kStoreHandler3Map = 0x1701;
-  static constexpr Tagged_t kUncompiledDataWithoutPreparseDataMap = 0x1729;
-  static constexpr Tagged_t kUncompiledDataWithPreparseDataMap = 0x1751;
+  static constexpr Tagged_t kEmptyEnumCache = 0x279;
+  static constexpr Tagged_t kEmptyDescriptorArray = 0x285;
+  static constexpr Tagged_t kScopeInfoMap = 0x295;
+  static constexpr Tagged_t kModuleInfoMap = 0x2bd;
+  static constexpr Tagged_t kClosureFeedbackCellArrayMap = 0x2e5;
+  static constexpr Tagged_t kFeedbackVectorMap = 0x30d;
+  static constexpr Tagged_t kHeapNumberMap = 0x335;
+  static constexpr Tagged_t kForeignMap = 0x35d;
+  static constexpr Tagged_t kMegaDomHandlerMap = 0x385;
+  static constexpr Tagged_t kBooleanMap = 0x3ad;
+  static constexpr Tagged_t kUninitializedMap = 0x3d5;
+  static constexpr Tagged_t kArgumentsMarkerMap = 0x3fd;
+  static constexpr Tagged_t kExceptionMap = 0x425;
+  static constexpr Tagged_t kTerminationExceptionMap = 0x44d;
+  static constexpr Tagged_t kOptimizedOutMap = 0x475;
+  static constexpr Tagged_t kStaleRegisterMap = 0x49d;
+  static constexpr Tagged_t kSelfReferenceMarkerMap = 0x4c5;
+  static constexpr Tagged_t kBasicBlockCountersMarkerMap = 0x4ed;
+  static constexpr Tagged_t kBigIntMap = 0x515;
+  static constexpr Tagged_t kSymbolMap = 0x53d;
+  static constexpr Tagged_t kSeqTwoByteStringMap = 0x565;
+  static constexpr Tagged_t kSeqOneByteStringMap = 0x58d;
+  static constexpr Tagged_t kConsTwoByteStringMap = 0x5b5;
+  static constexpr Tagged_t kConsOneByteStringMap = 0x5dd;
+  static constexpr Tagged_t kSlicedTwoByteStringMap = 0x605;
+  static constexpr Tagged_t kSlicedOneByteStringMap = 0x62d;
+  static constexpr Tagged_t kExternalTwoByteStringMap = 0x655;
+  static constexpr Tagged_t kExternalOneByteStringMap = 0x67d;
+  static constexpr Tagged_t kUncachedExternalTwoByteStringMap = 0x6a5;
+  static constexpr Tagged_t kUncachedExternalOneByteStringMap = 0x6cd;
+  static constexpr Tagged_t kSharedExternalTwoByteStringMap = 0x6f5;
+  static constexpr Tagged_t kSharedExternalOneByteStringMap = 0x71d;
+  static constexpr Tagged_t kSharedUncachedExternalTwoByteStringMap = 0x745;
+  static constexpr Tagged_t kSharedUncachedExternalOneByteStringMap = 0x76d;
+  static constexpr Tagged_t kExternalInternalizedTwoByteStringMap = 0x795;
+  static constexpr Tagged_t kExternalInternalizedOneByteStringMap = 0x7bd;
+  static constexpr Tagged_t kUncachedExternalInternalizedTwoByteStringMap =
+      0x7e5;
+  static constexpr Tagged_t kUncachedExternalInternalizedOneByteStringMap =
+      0x80d;
+  static constexpr Tagged_t kInternalizedTwoByteStringMap = 0x835;
+  static constexpr Tagged_t kInternalizedOneByteStringMap = 0x85d;
+  static constexpr Tagged_t kThinTwoByteStringMap = 0x885;
+  static constexpr Tagged_t kThinOneByteStringMap = 0x8ad;
+  static constexpr Tagged_t kSharedSeqTwoByteStringMap = 0x8d5;
+  static constexpr Tagged_t kSharedSeqOneByteStringMap = 0x8fd;
+  static constexpr Tagged_t kFixedDoubleArrayMap = 0x925;
+  static constexpr Tagged_t kFeedbackMetadataArrayMap = 0x94d;
+  static constexpr Tagged_t kByteArrayMap = 0x975;
+  static constexpr Tagged_t kBytecodeArrayMap = 0x99d;
+  static constexpr Tagged_t kFreeSpaceMap = 0x9c5;
+  static constexpr Tagged_t kPropertyArrayMap = 0x9ed;
+  static constexpr Tagged_t kSmallOrderedHashMapMap = 0xa15;
+  static constexpr Tagged_t kSmallOrderedHashSetMap = 0xa3d;
+  static constexpr Tagged_t kSmallOrderedNameDictionaryMap = 0xa65;
+  static constexpr Tagged_t kInstructionStreamMap = 0xa8d;
+  static constexpr Tagged_t kCellMap = 0xab5;
+  static constexpr Tagged_t kInvalidPrototypeValidityCell = 0xadd;
+  static constexpr Tagged_t kGlobalPropertyCellMap = 0xae5;
+  static constexpr Tagged_t kOnePointerFillerMap = 0xb0d;
+  static constexpr Tagged_t kTwoPointerFillerMap = 0xb35;
+  static constexpr Tagged_t kNoClosuresCellMap = 0xb5d;
+  static constexpr Tagged_t kOneClosureCellMap = 0xb85;
+  static constexpr Tagged_t kManyClosuresCellMap = 0xbad;
+  static constexpr Tagged_t kTransitionArrayMap = 0xbd5;
+  static constexpr Tagged_t kHashTableMap = 0xbfd;
+  static constexpr Tagged_t kOrderedNameDictionaryMap = 0xc25;
+  static constexpr Tagged_t kNameDictionaryMap = 0xc4d;
+  static constexpr Tagged_t kSwissNameDictionaryMap = 0xc75;
+  static constexpr Tagged_t kGlobalDictionaryMap = 0xc9d;
+  static constexpr Tagged_t kNumberDictionaryMap = 0xcc5;
+  static constexpr Tagged_t kRegisteredSymbolTableMap = 0xced;
+  static constexpr Tagged_t kArrayListMap = 0xd15;
+  static constexpr Tagged_t kAccessorInfoMap = 0xd3d;
+  static constexpr Tagged_t kPreparseDataMap = 0xd65;
+  static constexpr Tagged_t kSharedFunctionInfoMap = 0xd8d;
+  static constexpr Tagged_t kCodeMap = 0xdb5;
+  static constexpr Tagged_t kTrueValue = 0xddd;
+  static constexpr Tagged_t kFalseValue = 0xdf9;
+  static constexpr Tagged_t kHashSeed = 0xe15;
+  static constexpr Tagged_t kempty_string = 0xe25;
+  static constexpr Tagged_t klength_string = 0xe31;
+  static constexpr Tagged_t kprototype_string = 0xe45;
+  static constexpr Tagged_t kname_string = 0xe5d;
+  static constexpr Tagged_t kenumerable_string = 0xe6d;
+  static constexpr Tagged_t kconfigurable_string = 0xe85;
+  static constexpr Tagged_t kvalue_string = 0xe9d;
+  static constexpr Tagged_t kwritable_string = 0xeb1;
+  static constexpr Tagged_t knot_mapped_symbol = 0xec5;
+  static constexpr Tagged_t kuninitialized_symbol = 0xed5;
+  static constexpr Tagged_t kmegamorphic_symbol = 0xee5;
+  static constexpr Tagged_t kelements_transition_symbol = 0xef5;
+  static constexpr Tagged_t kmega_dom_symbol = 0xf05;
+  static constexpr Tagged_t kEmptyPropertyDictionary = 0xf15;
+  static constexpr Tagged_t kEmptyOrderedPropertyDictionary = 0xf41;
+  static constexpr Tagged_t kEmptyByteArray = 0xf59;
+  static constexpr Tagged_t kEmptyScopeInfo = 0xf61;
+  static constexpr Tagged_t kEmptyPropertyArray = 0xf71;
+  static constexpr Tagged_t kMinusZeroValue = 0xf79;
+  static constexpr Tagged_t kNanValue = 0xf85;
+  static constexpr Tagged_t kHoleNanValue = 0xf91;
+  static constexpr Tagged_t kInfinityValue = 0xf9d;
+  static constexpr Tagged_t kMinusInfinityValue = 0xfa9;
+  static constexpr Tagged_t kMaxSafeInteger = 0xfb5;
+  static constexpr Tagged_t kMaxUInt32 = 0xfc1;
+  static constexpr Tagged_t kSmiMinValue = 0xfcd;
+  static constexpr Tagged_t kSmiMaxValuePlusOne = 0xfd9;
+  static constexpr Tagged_t kPromiseFulfillReactionJobTaskMap = 0xfe5;
+  static constexpr Tagged_t kPromiseRejectReactionJobTaskMap = 0x100d;
+  static constexpr Tagged_t kCallableTaskMap = 0x1035;
+  static constexpr Tagged_t kCallbackTaskMap = 0x105d;
+  static constexpr Tagged_t kPromiseResolveThenableJobTaskMap = 0x1085;
+  static constexpr Tagged_t kFunctionTemplateInfoMap = 0x10ad;
+  static constexpr Tagged_t kObjectTemplateInfoMap = 0x10d5;
+  static constexpr Tagged_t kAccessCheckInfoMap = 0x10fd;
+  static constexpr Tagged_t kAccessorPairMap = 0x1125;
+  static constexpr Tagged_t kAliasedArgumentsEntryMap = 0x114d;
+  static constexpr Tagged_t kAllocationMementoMap = 0x1175;
+  static constexpr Tagged_t kArrayBoilerplateDescriptionMap = 0x119d;
+  static constexpr Tagged_t kAsmWasmDataMap = 0x11c5;
+  static constexpr Tagged_t kAsyncGeneratorRequestMap = 0x11ed;
+  static constexpr Tagged_t kBreakPointMap = 0x1215;
+  static constexpr Tagged_t kBreakPointInfoMap = 0x123d;
+  static constexpr Tagged_t kClassPositionsMap = 0x1265;
+  static constexpr Tagged_t kDebugInfoMap = 0x128d;
+  static constexpr Tagged_t kErrorStackDataMap = 0x12b5;
+  static constexpr Tagged_t kFunctionTemplateRareDataMap = 0x12dd;
+  static constexpr Tagged_t kInterceptorInfoMap = 0x1305;
+  static constexpr Tagged_t kInterpreterDataMap = 0x132d;
+  static constexpr Tagged_t kModuleRequestMap = 0x1355;
+  static constexpr Tagged_t kPromiseCapabilityMap = 0x137d;
+  static constexpr Tagged_t kPromiseOnStackMap = 0x13a5;
+  static constexpr Tagged_t kPromiseReactionMap = 0x13cd;
+  static constexpr Tagged_t kPropertyDescriptorObjectMap = 0x13f5;
+  static constexpr Tagged_t kPrototypeInfoMap = 0x141d;
+  static constexpr Tagged_t kRegExpBoilerplateDescriptionMap = 0x1445;
+  static constexpr Tagged_t kScriptMap = 0x146d;
+  static constexpr Tagged_t kScriptOrModuleMap = 0x1495;
+  static constexpr Tagged_t kSourceTextModuleInfoEntryMap = 0x14bd;
+  static constexpr Tagged_t kStackFrameInfoMap = 0x14e5;
+  static constexpr Tagged_t kTemplateObjectDescriptionMap = 0x150d;
+  static constexpr Tagged_t kTuple2Map = 0x1535;
+  static constexpr Tagged_t kWasmExceptionTagMap = 0x155d;
+  static constexpr Tagged_t kWasmIndirectFunctionTableMap = 0x1585;
+  static constexpr Tagged_t kAllocationSiteWithWeakNextMap = 0x15ad;
+  static constexpr Tagged_t kAllocationSiteWithoutWeakNextMap = 0x15d5;
+  static constexpr Tagged_t kLoadHandler1Map = 0x15fd;
+  static constexpr Tagged_t kLoadHandler2Map = 0x1625;
+  static constexpr Tagged_t kLoadHandler3Map = 0x164d;
+  static constexpr Tagged_t kStoreHandler0Map = 0x1675;
+  static constexpr Tagged_t kStoreHandler1Map = 0x169d;
+  static constexpr Tagged_t kStoreHandler2Map = 0x16c5;
+  static constexpr Tagged_t kStoreHandler3Map = 0x16ed;
+  static constexpr Tagged_t kUncompiledDataWithoutPreparseDataMap = 0x1715;
+  static constexpr Tagged_t kUncompiledDataWithPreparseDataMap = 0x173d;
   static constexpr Tagged_t kUncompiledDataWithoutPreparseDataWithJobMap =
-      0x1779;
-  static constexpr Tagged_t kUncompiledDataWithPreparseDataAndJobMap = 0x17a1;
-  static constexpr Tagged_t kOnHeapBasicBlockProfilerDataMap = 0x17c9;
-  static constexpr Tagged_t kTurbofanBitsetTypeMap = 0x17f1;
-  static constexpr Tagged_t kTurbofanUnionTypeMap = 0x1819;
-  static constexpr Tagged_t kTurbofanRangeTypeMap = 0x1841;
-  static constexpr Tagged_t kTurbofanHeapConstantTypeMap = 0x1869;
-  static constexpr Tagged_t kTurbofanOtherNumberConstantTypeMap = 0x1891;
-  static constexpr Tagged_t kTurboshaftWord32TypeMap = 0x18b9;
-  static constexpr Tagged_t kTurboshaftWord32RangeTypeMap = 0x18e1;
-  static constexpr Tagged_t kTurboshaftWord64TypeMap = 0x1909;
-  static constexpr Tagged_t kTurboshaftWord64RangeTypeMap = 0x1931;
-  static constexpr Tagged_t kTurboshaftFloat64TypeMap = 0x1959;
-  static constexpr Tagged_t kTurboshaftFloat64RangeTypeMap = 0x1981;
-  static constexpr Tagged_t kInternalClassMap = 0x19a9;
-  static constexpr Tagged_t kSmiPairMap = 0x19d1;
-  static constexpr Tagged_t kSmiBoxMap = 0x19f9;
-  static constexpr Tagged_t kExportedSubClassBaseMap = 0x1a21;
-  static constexpr Tagged_t kExportedSubClassMap = 0x1a49;
-  static constexpr Tagged_t kAbstractInternalClassSubclass1Map = 0x1a71;
-  static constexpr Tagged_t kAbstractInternalClassSubclass2Map = 0x1a99;
-  static constexpr Tagged_t kExportedSubClass2Map = 0x1ac1;
-  static constexpr Tagged_t kSortStateMap = 0x1ae9;
-  static constexpr Tagged_t kWasmStringViewIterMap = 0x1b11;
-  static constexpr Tagged_t kSloppyArgumentsElementsMap = 0x1b39;
-  static constexpr Tagged_t kStrongDescriptorArrayMap = 0x1b61;
-  static constexpr Tagged_t kTurboshaftWord32SetTypeMap = 0x1b89;
-  static constexpr Tagged_t kTurboshaftWord64SetTypeMap = 0x1bb1;
-  static constexpr Tagged_t kTurboshaftFloat64SetTypeMap = 0x1bd9;
-  static constexpr Tagged_t kInternalClassWithSmiElementsMap = 0x1c01;
-  static constexpr Tagged_t kInternalClassWithStructElementsMap = 0x1c29;
-  static constexpr Tagged_t kOrderedHashMapMap = 0x1c51;
-  static constexpr Tagged_t kOrderedHashSetMap = 0x1c79;
-  static constexpr Tagged_t kSimpleNumberDictionaryMap = 0x1ca1;
-  static constexpr Tagged_t kNameToIndexHashTableMap = 0x1cc9;
-  static constexpr Tagged_t kEmbedderDataArrayMap = 0x1cf1;
-  static constexpr Tagged_t kEphemeronHashTableMap = 0x1d19;
-  static constexpr Tagged_t kScriptContextTableMap = 0x1d41;
-  static constexpr Tagged_t kObjectBoilerplateDescriptionMap = 0x1d69;
-  static constexpr Tagged_t kCoverageInfoMap = 0x1d91;
-  static constexpr Tagged_t kSideEffectCallHandlerInfoMap = 0x1db9;
-  static constexpr Tagged_t kSideEffectFreeCallHandlerInfoMap = 0x1de1;
-  static constexpr Tagged_t kNextCallSideEffectFreeCallHandlerInfoMap = 0x1e09;
-  static constexpr Tagged_t kSourceTextModuleMap = 0x1e31;
-  static constexpr Tagged_t kSyntheticModuleMap = 0x1e59;
-  static constexpr Tagged_t kWasmApiFunctionRefMap = 0x1e81;
-  static constexpr Tagged_t kWasmCapiFunctionDataMap = 0x1ea9;
-  static constexpr Tagged_t kWasmExportedFunctionDataMap = 0x1ed1;
-  static constexpr Tagged_t kWasmInternalFunctionMap = 0x1ef9;
-  static constexpr Tagged_t kWasmJSFunctionDataMap = 0x1f21;
-  static constexpr Tagged_t kWasmResumeDataMap = 0x1f49;
-  static constexpr Tagged_t kWasmTypeInfoMap = 0x1f71;
-  static constexpr Tagged_t kWasmContinuationObjectMap = 0x1f99;
-  static constexpr Tagged_t kWasmNullMap = 0x1fc1;
-  static constexpr Tagged_t kWeakCellMap = 0x1fe9;
-  static constexpr Tagged_t kNoOpInterceptorInfo = 0x2011;
-  static constexpr Tagged_t kEmptyArrayList = 0x2039;
-  static constexpr Tagged_t kEmptyObjectBoilerplateDescription = 0x2045;
-  static constexpr Tagged_t kEmptyArrayBoilerplateDescription = 0x2051;
-  static constexpr Tagged_t kEmptyClosureFeedbackCellArray = 0x205d;
-  static constexpr Tagged_t kSingleCharacterStringTable = 0x2065;
-  static constexpr Tagged_t kdot_string = 0x274d;
-  static constexpr Tagged_t kzero_string = 0x276d;
-  static constexpr Tagged_t kone_string = 0x277d;
-  static constexpr Tagged_t kadoptText_string = 0x346d;
-  static constexpr Tagged_t kapproximatelySign_string = 0x3485;
-  static constexpr Tagged_t kbaseName_string = 0x34a5;
-  static constexpr Tagged_t kaccounting_string = 0x34b9;
-  static constexpr Tagged_t kbreakType_string = 0x34d1;
-  static constexpr Tagged_t kcalendars_string = 0x34e9;
-  static constexpr Tagged_t kcardinal_string = 0x3501;
-  static constexpr Tagged_t kcaseFirst_string = 0x3515;
-  static constexpr Tagged_t kceil_string = 0x352d;
-  static constexpr Tagged_t kcompare_string = 0x353d;
-  static constexpr Tagged_t kcollation_string = 0x3551;
-  static constexpr Tagged_t kcollations_string = 0x3569;
-  static constexpr Tagged_t kcompact_string = 0x3581;
-  static constexpr Tagged_t kcompactDisplay_string = 0x3595;
-  static constexpr Tagged_t kcurrency_string = 0x35b1;
-  static constexpr Tagged_t kcurrencyDisplay_string = 0x35c5;
-  static constexpr Tagged_t kcurrencySign_string = 0x35e1;
-  static constexpr Tagged_t kdateStyle_string = 0x35f9;
-  static constexpr Tagged_t kdateTimeField_string = 0x3611;
-  static constexpr Tagged_t kdayPeriod_string = 0x362d;
-  static constexpr Tagged_t kdaysDisplay_string = 0x3645;
-  static constexpr Tagged_t kdecimal_string = 0x365d;
-  static constexpr Tagged_t kdialect_string = 0x3671;
-  static constexpr Tagged_t kdigital_string = 0x3685;
-  static constexpr Tagged_t kdirection_string = 0x3699;
-  static constexpr Tagged_t kendRange_string = 0x36b1;
-  static constexpr Tagged_t kengineering_string = 0x36c5;
-  static constexpr Tagged_t kexceptZero_string = 0x36dd;
-  static constexpr Tagged_t kexpand_string = 0x36f5;
-  static constexpr Tagged_t kexponentInteger_string = 0x3709;
-  static constexpr Tagged_t kexponentMinusSign_string = 0x3725;
-  static constexpr Tagged_t kexponentSeparator_string = 0x3745;
-  static constexpr Tagged_t kfallback_string = 0x3765;
-  static constexpr Tagged_t kfirst_string = 0x3779;
-  static constexpr Tagged_t kfirstDay_string = 0x378d;
-  static constexpr Tagged_t kfloor_string = 0x37a1;
-  static constexpr Tagged_t kformat_string = 0x37b5;
-  static constexpr Tagged_t kfraction_string = 0x37c9;
-  static constexpr Tagged_t kfractionalDigits_string = 0x37dd;
-  static constexpr Tagged_t kfractionalSecond_string = 0x37f9;
-  static constexpr Tagged_t kfull_string = 0x3815;
-  static constexpr Tagged_t kgranularity_string = 0x3825;
-  static constexpr Tagged_t kgrapheme_string = 0x383d;
-  static constexpr Tagged_t kgroup_string = 0x3851;
-  static constexpr Tagged_t kh11_string = 0x3865;
-  static constexpr Tagged_t kh12_string = 0x3875;
-  static constexpr Tagged_t kh23_string = 0x3885;
-  static constexpr Tagged_t kh24_string = 0x3895;
-  static constexpr Tagged_t khalfCeil_string = 0x38a5;
-  static constexpr Tagged_t khalfEven_string = 0x38b9;
-  static constexpr Tagged_t khalfExpand_string = 0x38cd;
-  static constexpr Tagged_t khalfFloor_string = 0x38e5;
-  static constexpr Tagged_t khalfTrunc_string = 0x38fd;
-  static constexpr Tagged_t khour12_string = 0x3915;
-  static constexpr Tagged_t khourCycle_string = 0x3929;
-  static constexpr Tagged_t khourCycles_string = 0x3941;
-  static constexpr Tagged_t khoursDisplay_string = 0x3959;
-  static constexpr Tagged_t kideo_string = 0x3971;
-  static constexpr Tagged_t kignorePunctuation_string = 0x3981;
-  static constexpr Tagged_t kInvalid_Date_string = 0x39a1;
-  static constexpr Tagged_t kinteger_string = 0x39b9;
-  static constexpr Tagged_t kisWordLike_string = 0x39cd;
-  static constexpr Tagged_t kkana_string = 0x39e5;
-  static constexpr Tagged_t klanguage_string = 0x39f5;
-  static constexpr Tagged_t klanguageDisplay_string = 0x3a09;
-  static constexpr Tagged_t klessPrecision_string = 0x3a25;
-  static constexpr Tagged_t kletter_string = 0x3a41;
-  static constexpr Tagged_t klist_string = 0x3a55;
-  static constexpr Tagged_t kliteral_string = 0x3a65;
-  static constexpr Tagged_t klocale_string = 0x3a79;
-  static constexpr Tagged_t kloose_string = 0x3a8d;
-  static constexpr Tagged_t klower_string = 0x3aa1;
-  static constexpr Tagged_t kltr_string = 0x3ab5;
-  static constexpr Tagged_t kmaximumFractionDigits_string = 0x3ac5;
-  static constexpr Tagged_t kmaximumSignificantDigits_string = 0x3ae9;
-  static constexpr Tagged_t kmicrosecondsDisplay_string = 0x3b0d;
-  static constexpr Tagged_t kmillisecondsDisplay_string = 0x3b2d;
-  static constexpr Tagged_t kmin2_string = 0x3b4d;
-  static constexpr Tagged_t kminimalDays_string = 0x3b5d;
-  static constexpr Tagged_t kminimumFractionDigits_string = 0x3b75;
-  static constexpr Tagged_t kminimumIntegerDigits_string = 0x3b99;
-  static constexpr Tagged_t kminimumSignificantDigits_string = 0x3bb9;
-  static constexpr Tagged_t kminus_0 = 0x3bdd;
-  static constexpr Tagged_t kminusSign_string = 0x3bed;
-  static constexpr Tagged_t kminutesDisplay_string = 0x3c05;
-  static constexpr Tagged_t kmonthsDisplay_string = 0x3c21;
-  static constexpr Tagged_t kmorePrecision_string = 0x3c3d;
-  static constexpr Tagged_t knan_string = 0x3c59;
-  static constexpr Tagged_t knanosecondsDisplay_string = 0x3c69;
-  static constexpr Tagged_t knarrowSymbol_string = 0x3c89;
-  static constexpr Tagged_t knegative_string = 0x3ca1;
-  static constexpr Tagged_t knever_string = 0x3cb5;
-  static constexpr Tagged_t knone_string = 0x3cc9;
-  static constexpr Tagged_t knotation_string = 0x3cd9;
-  static constexpr Tagged_t knormal_string = 0x3ced;
-  static constexpr Tagged_t knumberingSystem_string = 0x3d01;
-  static constexpr Tagged_t knumberingSystems_string = 0x3d1d;
-  static constexpr Tagged_t knumeric_string = 0x3d39;
-  static constexpr Tagged_t kordinal_string = 0x3d4d;
-  static constexpr Tagged_t kpercentSign_string = 0x3d61;
-  static constexpr Tagged_t kplusSign_string = 0x3d79;
-  static constexpr Tagged_t kquarter_string = 0x3d8d;
-  static constexpr Tagged_t kregion_string = 0x3da1;
-  static constexpr Tagged_t krelatedYear_string = 0x3db5;
-  static constexpr Tagged_t kroundingMode_string = 0x3dcd;
-  static constexpr Tagged_t kroundingPriority_string = 0x3de5;
-  static constexpr Tagged_t krtl_string = 0x3e01;
-  static constexpr Tagged_t kscientific_string = 0x3e11;
-  static constexpr Tagged_t ksecondsDisplay_string = 0x3e29;
-  static constexpr Tagged_t ksegment_string = 0x3e45;
-  static constexpr Tagged_t kSegmentIterator_string = 0x3e59;
-  static constexpr Tagged_t kSegments_string = 0x3e75;
-  static constexpr Tagged_t ksensitivity_string = 0x3e89;
-  static constexpr Tagged_t ksep_string = 0x3ea1;
-  static constexpr Tagged_t kshared_string = 0x3eb1;
-  static constexpr Tagged_t ksignDisplay_string = 0x3ec5;
-  static constexpr Tagged_t kstandard_string = 0x3edd;
-  static constexpr Tagged_t kstartRange_string = 0x3ef1;
-  static constexpr Tagged_t kstrict_string = 0x3f09;
-  static constexpr Tagged_t kstripIfInteger_string = 0x3f1d;
-  static constexpr Tagged_t kstyle_string = 0x3f39;
-  static constexpr Tagged_t kterm_string = 0x3f4d;
-  static constexpr Tagged_t ktextInfo_string = 0x3f5d;
-  static constexpr Tagged_t ktimeStyle_string = 0x3f71;
-  static constexpr Tagged_t ktimeZones_string = 0x3f89;
-  static constexpr Tagged_t ktimeZoneName_string = 0x3fa1;
-  static constexpr Tagged_t ktrailingZeroDisplay_string = 0x3fb9;
-  static constexpr Tagged_t ktrunc_string = 0x3fd9;
-  static constexpr Tagged_t ktwo_digit_string = 0x3fed;
-  static constexpr Tagged_t ktype_string = 0x4001;
-  static constexpr Tagged_t kunknown_string = 0x4011;
-  static constexpr Tagged_t kupper_string = 0x4025;
-  static constexpr Tagged_t kusage_string = 0x4039;
-  static constexpr Tagged_t kuseGrouping_string = 0x404d;
-  static constexpr Tagged_t kunitDisplay_string = 0x4065;
-  static constexpr Tagged_t kweekday_string = 0x407d;
-  static constexpr Tagged_t kweekend_string = 0x4091;
-  static constexpr Tagged_t kweeksDisplay_string = 0x40a5;
-  static constexpr Tagged_t kweekInfo_string = 0x40bd;
-  static constexpr Tagged_t kyearName_string = 0x40d1;
-  static constexpr Tagged_t kyearsDisplay_string = 0x40e5;
-  static constexpr Tagged_t kadd_string = 0x40fd;
-  static constexpr Tagged_t kAggregateError_string = 0x410d;
-  static constexpr Tagged_t kalways_string = 0x4129;
-  static constexpr Tagged_t kanonymous_function_string = 0x413d;
-  static constexpr Tagged_t kanonymous_string = 0x415d;
-  static constexpr Tagged_t kapply_string = 0x4175;
-  static constexpr Tagged_t kArguments_string = 0x4189;
-  static constexpr Tagged_t karguments_string = 0x41a1;
-  static constexpr Tagged_t karguments_to_string = 0x41b9;
-  static constexpr Tagged_t kArray_string = 0x41d9;
-  static constexpr Tagged_t karray_to_string = 0x41ed;
-  static constexpr Tagged_t kArrayBuffer_string = 0x4209;
-  static constexpr Tagged_t kArrayIterator_string = 0x4221;
-  static constexpr Tagged_t kas_string = 0x423d;
-  static constexpr Tagged_t kassert_string = 0x424d;
-  static constexpr Tagged_t kasync_string = 0x4261;
-  static constexpr Tagged_t kAtomicsCondition_string = 0x4275;
-  static constexpr Tagged_t kAtomicsMutex_string = 0x4295;
-  static constexpr Tagged_t kauto_string = 0x42b1;
-  static constexpr Tagged_t kawait_string = 0x42c1;
-  static constexpr Tagged_t kBigInt_string = 0x42d5;
-  static constexpr Tagged_t kbigint_string = 0x42e9;
-  static constexpr Tagged_t kBigInt64Array_string = 0x42fd;
-  static constexpr Tagged_t kBigUint64Array_string = 0x4319;
-  static constexpr Tagged_t kbind_string = 0x4335;
-  static constexpr Tagged_t kblank_string = 0x4345;
-  static constexpr Tagged_t kBoolean_string = 0x4359;
-  static constexpr Tagged_t kboolean_string = 0x436d;
-  static constexpr Tagged_t kboolean_to_string = 0x4381;
-  static constexpr Tagged_t kbound__string = 0x439d;
-  static constexpr Tagged_t kbuffer_string = 0x43b1;
-  static constexpr Tagged_t kbyte_length_string = 0x43c5;
-  static constexpr Tagged_t kbyte_offset_string = 0x43dd;
-  static constexpr Tagged_t kCompileError_string = 0x43f5;
-  static constexpr Tagged_t kcalendar_string = 0x440d;
-  static constexpr Tagged_t kcallee_string = 0x4421;
-  static constexpr Tagged_t kcaller_string = 0x4435;
-  static constexpr Tagged_t kcause_string = 0x4449;
-  static constexpr Tagged_t kcharacter_string = 0x445d;
-  static constexpr Tagged_t kclosure_string = 0x4475;
-  static constexpr Tagged_t kcode_string = 0x448d;
-  static constexpr Tagged_t kcolumn_string = 0x449d;
-  static constexpr Tagged_t kcomputed_string = 0x44b1;
-  static constexpr Tagged_t kconjunction_string = 0x44c9;
-  static constexpr Tagged_t kconsole_string = 0x44e1;
-  static constexpr Tagged_t kconstrain_string = 0x44f5;
-  static constexpr Tagged_t kconstruct_string = 0x450d;
-  static constexpr Tagged_t kcurrent_string = 0x4525;
-  static constexpr Tagged_t kDate_string = 0x4539;
-  static constexpr Tagged_t kdate_to_string = 0x4549;
-  static constexpr Tagged_t kdateAdd_string = 0x4565;
-  static constexpr Tagged_t kdateFromFields_string = 0x4579;
-  static constexpr Tagged_t kdateUntil_string = 0x4595;
-  static constexpr Tagged_t kday_string = 0x45ad;
-  static constexpr Tagged_t kdayOfWeek_string = 0x45bd;
-  static constexpr Tagged_t kdayOfYear_string = 0x45d5;
-  static constexpr Tagged_t kdays_string = 0x45ed;
-  static constexpr Tagged_t kdaysInMonth_string = 0x45fd;
-  static constexpr Tagged_t kdaysInWeek_string = 0x4615;
-  static constexpr Tagged_t kdaysInYear_string = 0x462d;
-  static constexpr Tagged_t kdefault_string = 0x4645;
-  static constexpr Tagged_t kdefineProperty_string = 0x4659;
-  static constexpr Tagged_t kdeleteProperty_string = 0x4675;
-  static constexpr Tagged_t kdetached_string = 0x4691;
-  static constexpr Tagged_t kdisjunction_string = 0x46a5;
-  static constexpr Tagged_t kdone_string = 0x46bd;
-  static constexpr Tagged_t kdot_brand_string = 0x46cd;
-  static constexpr Tagged_t kdot_catch_string = 0x46e1;
-  static constexpr Tagged_t kdot_default_string = 0x46f5;
-  static constexpr Tagged_t kdot_for_string = 0x4709;
-  static constexpr Tagged_t kdot_generator_object_string = 0x4719;
-  static constexpr Tagged_t kdot_home_object_string = 0x4739;
-  static constexpr Tagged_t kdot_new_target_string = 0x4751;
-  static constexpr Tagged_t knew_target_string = 0x4751;
-  static constexpr Tagged_t kdot_result_string = 0x4769;
-  static constexpr Tagged_t kdot_repl_result_string = 0x477d;
-  static constexpr Tagged_t kdot_static_home_object_string = 0x4795;
-  static constexpr Tagged_t kdot_switch_tag_string = 0x47b5;
-  static constexpr Tagged_t kdotAll_string = 0x47cd;
-  static constexpr Tagged_t kError_string = 0x47e1;
-  static constexpr Tagged_t kEvalError_string = 0x47f5;
-  static constexpr Tagged_t kelement_string = 0x480d;
-  static constexpr Tagged_t kepochMicroseconds_string = 0x4821;
-  static constexpr Tagged_t kepochMilliseconds_string = 0x4841;
-  static constexpr Tagged_t kepochNanoseconds_string = 0x4861;
-  static constexpr Tagged_t kepochSeconds_string = 0x487d;
-  static constexpr Tagged_t kera_string = 0x4895;
-  static constexpr Tagged_t keraYear_string = 0x48a5;
-  static constexpr Tagged_t kerrors_string = 0x48b9;
-  static constexpr Tagged_t kerror_to_string = 0x48cd;
-  static constexpr Tagged_t keval_string = 0x48e9;
-  static constexpr Tagged_t kexception_string = 0x48f9;
-  static constexpr Tagged_t kexec_string = 0x4911;
-  static constexpr Tagged_t kfalse_string = 0x4921;
-  static constexpr Tagged_t kfields_string = 0x4935;
-  static constexpr Tagged_t kFinalizationRegistry_string = 0x4949;
-  static constexpr Tagged_t kflags_string = 0x4969;
-  static constexpr Tagged_t kFloat32Array_string = 0x497d;
-  static constexpr Tagged_t kFloat64Array_string = 0x4995;
-  static constexpr Tagged_t kfractionalSecondDigits_string = 0x49ad;
-  static constexpr Tagged_t kfrom_string = 0x49d1;
-  static constexpr Tagged_t kFunction_string = 0x49e1;
-  static constexpr Tagged_t kfunction_native_code_string = 0x49f5;
-  static constexpr Tagged_t kfunction_string = 0x4a21;
-  static constexpr Tagged_t kfunction_to_string = 0x4a35;
-  static constexpr Tagged_t kGenerator_string = 0x4a55;
-  static constexpr Tagged_t kget_space_string = 0x4a6d;
-  static constexpr Tagged_t kget_string = 0x4a7d;
-  static constexpr Tagged_t kgetOffsetNanosecondsFor_string = 0x4a8d;
-  static constexpr Tagged_t kgetOwnPropertyDescriptor_string = 0x4ab1;
-  static constexpr Tagged_t kgetPossibleInstantsFor_string = 0x4ad5;
-  static constexpr Tagged_t kgetPrototypeOf_string = 0x4af9;
-  static constexpr Tagged_t kglobal_string = 0x4b15;
-  static constexpr Tagged_t kglobalThis_string = 0x4b29;
-  static constexpr Tagged_t kgroups_string = 0x4b41;
-  static constexpr Tagged_t kgrowable_string = 0x4b55;
-  static constexpr Tagged_t khas_string = 0x4b69;
-  static constexpr Tagged_t khasIndices_string = 0x4b79;
-  static constexpr Tagged_t khour_string = 0x4b91;
-  static constexpr Tagged_t khours_string = 0x4ba1;
-  static constexpr Tagged_t khoursInDay_string = 0x4bb5;
-  static constexpr Tagged_t kignoreCase_string = 0x4bcd;
-  static constexpr Tagged_t kid_string = 0x4be5;
-  static constexpr Tagged_t killegal_access_string = 0x4bf5;
-  static constexpr Tagged_t killegal_argument_string = 0x4c11;
-  static constexpr Tagged_t kinLeapYear_string = 0x4c2d;
-  static constexpr Tagged_t kindex_string = 0x4c45;
-  static constexpr Tagged_t kindices_string = 0x4c59;
-  static constexpr Tagged_t kInfinity_string = 0x4c6d;
-  static constexpr Tagged_t kinfinity_string = 0x4c81;
-  static constexpr Tagged_t kinput_string = 0x4c95;
-  static constexpr Tagged_t kInt16Array_string = 0x4ca9;
-  static constexpr Tagged_t kInt32Array_string = 0x4cc1;
-  static constexpr Tagged_t kInt8Array_string = 0x4cd9;
-  static constexpr Tagged_t kisExtensible_string = 0x4cf1;
-  static constexpr Tagged_t kiso8601_string = 0x4d09;
-  static constexpr Tagged_t kisoDay_string = 0x4d1d;
-  static constexpr Tagged_t kisoHour_string = 0x4d31;
-  static constexpr Tagged_t kisoMicrosecond_string = 0x4d45;
-  static constexpr Tagged_t kisoMillisecond_string = 0x4d61;
-  static constexpr Tagged_t kisoMinute_string = 0x4d7d;
-  static constexpr Tagged_t kisoMonth_string = 0x4d95;
-  static constexpr Tagged_t kisoNanosecond_string = 0x4da9;
-  static constexpr Tagged_t kisoSecond_string = 0x4dc5;
-  static constexpr Tagged_t kisoYear_string = 0x4ddd;
-  static constexpr Tagged_t kjsMemoryEstimate_string = 0x4df1;
-  static constexpr Tagged_t kjsMemoryRange_string = 0x4e0d;
-  static constexpr Tagged_t kkeys_string = 0x4e29;
-  static constexpr Tagged_t klargestUnit_string = 0x4e39;
-  static constexpr Tagged_t klastIndex_string = 0x4e51;
-  static constexpr Tagged_t klet_string = 0x4e69;
-  static constexpr Tagged_t kline_string = 0x4e79;
-  static constexpr Tagged_t klinear_string = 0x4e89;
-  static constexpr Tagged_t kLinkError_string = 0x4e9d;
-  static constexpr Tagged_t klong_string = 0x4eb5;
-  static constexpr Tagged_t kMap_string = 0x4ec5;
-  static constexpr Tagged_t kMapIterator_string = 0x4ed5;
-  static constexpr Tagged_t kmax_byte_length_string = 0x4eed;
-  static constexpr Tagged_t kmedium_string = 0x4f09;
-  static constexpr Tagged_t kmergeFields_string = 0x4f1d;
-  static constexpr Tagged_t kmessage_string = 0x4f35;
-  static constexpr Tagged_t kmeta_string = 0x4f49;
-  static constexpr Tagged_t kminus_Infinity_string = 0x4f59;
-  static constexpr Tagged_t kmicrosecond_string = 0x4f71;
-  static constexpr Tagged_t kmicroseconds_string = 0x4f89;
-  static constexpr Tagged_t kmillisecond_string = 0x4fa1;
-  static constexpr Tagged_t kmilliseconds_string = 0x4fb9;
-  static constexpr Tagged_t kminute_string = 0x4fd1;
-  static constexpr Tagged_t kminutes_string = 0x4fe5;
-  static constexpr Tagged_t kModule_string = 0x4ff9;
-  static constexpr Tagged_t kmonth_string = 0x500d;
-  static constexpr Tagged_t kmonthDayFromFields_string = 0x5021;
-  static constexpr Tagged_t kmonths_string = 0x5041;
-  static constexpr Tagged_t kmonthsInYear_string = 0x5055;
-  static constexpr Tagged_t kmonthCode_string = 0x506d;
-  static constexpr Tagged_t kmultiline_string = 0x5085;
-  static constexpr Tagged_t kNaN_string = 0x509d;
-  static constexpr Tagged_t knanosecond_string = 0x50ad;
-  static constexpr Tagged_t knanoseconds_string = 0x50c5;
-  static constexpr Tagged_t knarrow_string = 0x50dd;
-  static constexpr Tagged_t knative_string = 0x50f1;
-  static constexpr Tagged_t kNFC_string = 0x5105;
-  static constexpr Tagged_t kNFD_string = 0x5115;
-  static constexpr Tagged_t kNFKC_string = 0x5125;
-  static constexpr Tagged_t kNFKD_string = 0x5135;
-  static constexpr Tagged_t knot_equal_string = 0x5145;
-  static constexpr Tagged_t knull_string = 0x515d;
-  static constexpr Tagged_t knull_to_string = 0x516d;
-  static constexpr Tagged_t kNumber_string = 0x5189;
-  static constexpr Tagged_t knumber_string = 0x519d;
-  static constexpr Tagged_t knumber_to_string = 0x51b1;
-  static constexpr Tagged_t kObject_string = 0x51cd;
-  static constexpr Tagged_t kobject_string = 0x51e1;
-  static constexpr Tagged_t kobject_to_string = 0x51f5;
-  static constexpr Tagged_t kObject_prototype_string = 0x5211;
-  static constexpr Tagged_t kof_string = 0x522d;
-  static constexpr Tagged_t koffset_string = 0x523d;
-  static constexpr Tagged_t koffsetNanoseconds_string = 0x5251;
-  static constexpr Tagged_t kok_string = 0x5271;
-  static constexpr Tagged_t kother_string = 0x5281;
-  static constexpr Tagged_t koverflow_string = 0x5295;
-  static constexpr Tagged_t kownKeys_string = 0x52a9;
-  static constexpr Tagged_t kpercent_string = 0x52bd;
-  static constexpr Tagged_t kplainDate_string = 0x52d1;
-  static constexpr Tagged_t kplainTime_string = 0x52e9;
-  static constexpr Tagged_t kposition_string = 0x5301;
-  static constexpr Tagged_t kpreventExtensions_string = 0x5315;
-  static constexpr Tagged_t kprivate_constructor_string = 0x5335;
-  static constexpr Tagged_t kPromise_string = 0x534d;
-  static constexpr Tagged_t kproto_string = 0x5361;
-  static constexpr Tagged_t kproxy_string = 0x5379;
-  static constexpr Tagged_t kProxy_string = 0x538d;
-  static constexpr Tagged_t kquery_colon_string = 0x53a1;
-  static constexpr Tagged_t kRangeError_string = 0x53b1;
-  static constexpr Tagged_t kraw_json_string = 0x53c9;
-  static constexpr Tagged_t kraw_string = 0x53dd;
-  static constexpr Tagged_t kReferenceError_string = 0x53ed;
-  static constexpr Tagged_t kReflectGet_string = 0x5409;
-  static constexpr Tagged_t kReflectHas_string = 0x5421;
-  static constexpr Tagged_t kRegExp_string = 0x5439;
-  static constexpr Tagged_t kregexp_to_string = 0x544d;
-  static constexpr Tagged_t kreject_string = 0x5469;
-  static constexpr Tagged_t krelativeTo_string = 0x547d;
-  static constexpr Tagged_t kresizable_string = 0x5495;
-  static constexpr Tagged_t kResizableArrayBuffer_string = 0x54ad;
-  static constexpr Tagged_t kreturn_string = 0x54cd;
-  static constexpr Tagged_t krevoke_string = 0x54e1;
-  static constexpr Tagged_t kroundingIncrement_string = 0x54f5;
-  static constexpr Tagged_t kRuntimeError_string = 0x5515;
-  static constexpr Tagged_t kWebAssemblyException_string = 0x552d;
-  static constexpr Tagged_t kScript_string = 0x5551;
-  static constexpr Tagged_t kscript_string = 0x5565;
-  static constexpr Tagged_t ksecond_string = 0x5579;
-  static constexpr Tagged_t kseconds_string = 0x558d;
-  static constexpr Tagged_t kshort_string = 0x55a1;
-  static constexpr Tagged_t kSet_string = 0x55b5;
-  static constexpr Tagged_t ksentence_string = 0x55c5;
-  static constexpr Tagged_t kset_space_string = 0x55d9;
-  static constexpr Tagged_t kset_string = 0x55e9;
-  static constexpr Tagged_t kSetIterator_string = 0x55f9;
-  static constexpr Tagged_t ksetPrototypeOf_string = 0x5611;
-  static constexpr Tagged_t kShadowRealm_string = 0x562d;
-  static constexpr Tagged_t kSharedArray_string = 0x5645;
-  static constexpr Tagged_t kSharedArrayBuffer_string = 0x565d;
-  static constexpr Tagged_t kSharedStruct_string = 0x567d;
-  static constexpr Tagged_t ksign_string = 0x5695;
-  static constexpr Tagged_t ksmallestUnit_string = 0x56a5;
-  static constexpr Tagged_t ksource_string = 0x56bd;
-  static constexpr Tagged_t ksourceText_string = 0x56d1;
-  static constexpr Tagged_t kstack_string = 0x56e9;
-  static constexpr Tagged_t kstackTraceLimit_string = 0x56fd;
-  static constexpr Tagged_t ksticky_string = 0x5719;
-  static constexpr Tagged_t kString_string = 0x572d;
-  static constexpr Tagged_t kstring_string = 0x5741;
-  static constexpr Tagged_t kstring_to_string = 0x5755;
-  static constexpr Tagged_t kSymbol_iterator_string = 0x5771;
-  static constexpr Tagged_t kSymbol_replace_string = 0x578d;
-  static constexpr Tagged_t ksymbol_species_string = 0x57a9;
-  static constexpr Tagged_t kSymbol_species_string = 0x57c5;
-  static constexpr Tagged_t kSymbol_string = 0x57e1;
-  static constexpr Tagged_t ksymbol_string = 0x57f5;
-  static constexpr Tagged_t kSyntaxError_string = 0x5809;
-  static constexpr Tagged_t ktarget_string = 0x5821;
-  static constexpr Tagged_t kthis_function_string = 0x5835;
-  static constexpr Tagged_t kthis_string = 0x5851;
-  static constexpr Tagged_t kthrow_string = 0x5861;
-  static constexpr Tagged_t ktimed_out_string = 0x5875;
-  static constexpr Tagged_t ktimeZone_string = 0x588d;
-  static constexpr Tagged_t ktoJSON_string = 0x58a1;
-  static constexpr Tagged_t ktoString_string = 0x58b5;
-  static constexpr Tagged_t ktrue_string = 0x58c9;
-  static constexpr Tagged_t ktotal_string = 0x58d9;
-  static constexpr Tagged_t kTypeError_string = 0x58ed;
-  static constexpr Tagged_t kUint16Array_string = 0x5905;
-  static constexpr Tagged_t kUint32Array_string = 0x591d;
-  static constexpr Tagged_t kUint8Array_string = 0x5935;
-  static constexpr Tagged_t kUint8ClampedArray_string = 0x594d;
-  static constexpr Tagged_t kundefined_string = 0x596d;
-  static constexpr Tagged_t kundefined_to_string = 0x5985;
-  static constexpr Tagged_t kunicode_string = 0x59a5;
-  static constexpr Tagged_t kunicodeSets_string = 0x59b9;
-  static constexpr Tagged_t kunit_string = 0x59d1;
-  static constexpr Tagged_t kURIError_string = 0x59e1;
-  static constexpr Tagged_t kUTC_string = 0x59f5;
-  static constexpr Tagged_t kvalueOf_string = 0x5a05;
-  static constexpr Tagged_t kWeakMap_string = 0x5a19;
-  static constexpr Tagged_t kWeakRef_string = 0x5a2d;
-  static constexpr Tagged_t kWeakSet_string = 0x5a41;
-  static constexpr Tagged_t kweek_string = 0x5a55;
-  static constexpr Tagged_t kweeks_string = 0x5a65;
-  static constexpr Tagged_t kweekOfYear_string = 0x5a79;
-  static constexpr Tagged_t kword_string = 0x5a91;
-  static constexpr Tagged_t kyearMonthFromFields_string = 0x5aa1;
-  static constexpr Tagged_t kyear_string = 0x5ac1;
-  static constexpr Tagged_t kyears_string = 0x5ad1;
-  static constexpr Tagged_t kUninitializedValue = 0x5af5;
-  static constexpr Tagged_t kArgumentsMarker = 0x5b2d;
-  static constexpr Tagged_t kTerminationException = 0x5b65;
-  static constexpr Tagged_t kException = 0x5ba5;
-  static constexpr Tagged_t kOptimizedOut = 0x5bc1;
-  static constexpr Tagged_t kStaleRegister = 0x5bf9;
-  static constexpr Tagged_t kSelfReferenceMarker = 0x5c31;
-  static constexpr Tagged_t kBasicBlockCountersMarker = 0x5c71;
-  static constexpr Tagged_t karray_buffer_wasm_memory_symbol = 0x5cb5;
-  static constexpr Tagged_t kcall_site_info_symbol = 0x5cc5;
-  static constexpr Tagged_t kconsole_context_id_symbol = 0x5cd5;
-  static constexpr Tagged_t kconsole_context_name_symbol = 0x5ce5;
-  static constexpr Tagged_t kclass_fields_symbol = 0x5cf5;
-  static constexpr Tagged_t kclass_positions_symbol = 0x5d05;
-  static constexpr Tagged_t kerror_end_pos_symbol = 0x5d15;
-  static constexpr Tagged_t kerror_script_symbol = 0x5d25;
-  static constexpr Tagged_t kerror_stack_symbol = 0x5d35;
-  static constexpr Tagged_t kerror_start_pos_symbol = 0x5d45;
-  static constexpr Tagged_t kfrozen_symbol = 0x5d55;
-  static constexpr Tagged_t kinterpreter_trampoline_symbol = 0x5d65;
-  static constexpr Tagged_t knative_context_index_symbol = 0x5d75;
-  static constexpr Tagged_t knonextensible_symbol = 0x5d85;
-  static constexpr Tagged_t kpromise_debug_marker_symbol = 0x5d95;
-  static constexpr Tagged_t kpromise_debug_message_symbol = 0x5da5;
-  static constexpr Tagged_t kpromise_forwarding_handler_symbol = 0x5db5;
-  static constexpr Tagged_t kpromise_handled_by_symbol = 0x5dc5;
-  static constexpr Tagged_t kpromise_awaited_by_symbol = 0x5dd5;
-  static constexpr Tagged_t kregexp_result_names_symbol = 0x5de5;
-  static constexpr Tagged_t kregexp_result_regexp_input_symbol = 0x5df5;
-  static constexpr Tagged_t kregexp_result_regexp_last_index_symbol = 0x5e05;
-  static constexpr Tagged_t ksealed_symbol = 0x5e15;
-  static constexpr Tagged_t kstrict_function_transition_symbol = 0x5e25;
+      0x1765;
+  static constexpr Tagged_t kUncompiledDataWithPreparseDataAndJobMap = 0x178d;
+  static constexpr Tagged_t kOnHeapBasicBlockProfilerDataMap = 0x17b5;
+  static constexpr Tagged_t kTurbofanBitsetTypeMap = 0x17dd;
+  static constexpr Tagged_t kTurbofanUnionTypeMap = 0x1805;
+  static constexpr Tagged_t kTurbofanRangeTypeMap = 0x182d;
+  static constexpr Tagged_t kTurbofanHeapConstantTypeMap = 0x1855;
+  static constexpr Tagged_t kTurbofanOtherNumberConstantTypeMap = 0x187d;
+  static constexpr Tagged_t kTurboshaftWord32TypeMap = 0x18a5;
+  static constexpr Tagged_t kTurboshaftWord32RangeTypeMap = 0x18cd;
+  static constexpr Tagged_t kTurboshaftWord64TypeMap = 0x18f5;
+  static constexpr Tagged_t kTurboshaftWord64RangeTypeMap = 0x191d;
+  static constexpr Tagged_t kTurboshaftFloat64TypeMap = 0x1945;
+  static constexpr Tagged_t kTurboshaftFloat64RangeTypeMap = 0x196d;
+  static constexpr Tagged_t kInternalClassMap = 0x1995;
+  static constexpr Tagged_t kSmiPairMap = 0x19bd;
+  static constexpr Tagged_t kSmiBoxMap = 0x19e5;
+  static constexpr Tagged_t kExportedSubClassBaseMap = 0x1a0d;
+  static constexpr Tagged_t kExportedSubClassMap = 0x1a35;
+  static constexpr Tagged_t kAbstractInternalClassSubclass1Map = 0x1a5d;
+  static constexpr Tagged_t kAbstractInternalClassSubclass2Map = 0x1a85;
+  static constexpr Tagged_t kExportedSubClass2Map = 0x1aad;
+  static constexpr Tagged_t kSortStateMap = 0x1ad5;
+  static constexpr Tagged_t kWasmStringViewIterMap = 0x1afd;
+  static constexpr Tagged_t kSloppyArgumentsElementsMap = 0x1b25;
+  static constexpr Tagged_t kStrongDescriptorArrayMap = 0x1b4d;
+  static constexpr Tagged_t kTurboshaftWord32SetTypeMap = 0x1b75;
+  static constexpr Tagged_t kTurboshaftWord64SetTypeMap = 0x1b9d;
+  static constexpr Tagged_t kTurboshaftFloat64SetTypeMap = 0x1bc5;
+  static constexpr Tagged_t kInternalClassWithSmiElementsMap = 0x1bed;
+  static constexpr Tagged_t kInternalClassWithStructElementsMap = 0x1c15;
+  static constexpr Tagged_t kOrderedHashMapMap = 0x1c3d;
+  static constexpr Tagged_t kOrderedHashSetMap = 0x1c65;
+  static constexpr Tagged_t kSimpleNumberDictionaryMap = 0x1c8d;
+  static constexpr Tagged_t kNameToIndexHashTableMap = 0x1cb5;
+  static constexpr Tagged_t kEmbedderDataArrayMap = 0x1cdd;
+  static constexpr Tagged_t kEphemeronHashTableMap = 0x1d05;
+  static constexpr Tagged_t kScriptContextTableMap = 0x1d2d;
+  static constexpr Tagged_t kObjectBoilerplateDescriptionMap = 0x1d55;
+  static constexpr Tagged_t kCoverageInfoMap = 0x1d7d;
+  static constexpr Tagged_t kSideEffectCallHandlerInfoMap = 0x1da5;
+  static constexpr Tagged_t kSideEffectFreeCallHandlerInfoMap = 0x1dcd;
+  static constexpr Tagged_t kSourceTextModuleMap = 0x1df5;
+  static constexpr Tagged_t kSyntheticModuleMap = 0x1e1d;
+  static constexpr Tagged_t kWasmApiFunctionRefMap = 0x1e45;
+  static constexpr Tagged_t kWasmCapiFunctionDataMap = 0x1e6d;
+  static constexpr Tagged_t kWasmExportedFunctionDataMap = 0x1e95;
+  static constexpr Tagged_t kWasmInternalFunctionMap = 0x1ebd;
+  static constexpr Tagged_t kWasmJSFunctionDataMap = 0x1ee5;
+  static constexpr Tagged_t kWasmResumeDataMap = 0x1f0d;
+  static constexpr Tagged_t kWasmTypeInfoMap = 0x1f35;
+  static constexpr Tagged_t kWasmContinuationObjectMap = 0x1f5d;
+  static constexpr Tagged_t kWasmNullMap = 0x1f85;
+  static constexpr Tagged_t kWeakCellMap = 0x1fad;
+  static constexpr Tagged_t kExternalPointerArrayMap = 0x1fd5;
+  static constexpr Tagged_t kNoOpInterceptorInfo = 0x1ffd;
+  static constexpr Tagged_t kEmptyArrayList = 0x2025;
+  static constexpr Tagged_t kEmptyObjectBoilerplateDescription = 0x2031;
+  static constexpr Tagged_t kEmptyArrayBoilerplateDescription = 0x203d;
+  static constexpr Tagged_t kEmptyClosureFeedbackCellArray = 0x2049;
+  static constexpr Tagged_t kEmptySwissPropertyDictionary = 0x205d;
+  static constexpr Tagged_t kSingleCharacterStringTable = 0x207d;
+  static constexpr Tagged_t kdot_string = 0x2765;
+  static constexpr Tagged_t kzero_string = 0x2785;
+  static constexpr Tagged_t kone_string = 0x2795;
+  static constexpr Tagged_t kadoptText_string = 0x3485;
+  static constexpr Tagged_t kapproximatelySign_string = 0x349d;
+  static constexpr Tagged_t kbaseName_string = 0x34bd;
+  static constexpr Tagged_t kaccounting_string = 0x34d1;
+  static constexpr Tagged_t kbreakType_string = 0x34e9;
+  static constexpr Tagged_t kcalendars_string = 0x3501;
+  static constexpr Tagged_t kcardinal_string = 0x3519;
+  static constexpr Tagged_t kcaseFirst_string = 0x352d;
+  static constexpr Tagged_t kceil_string = 0x3545;
+  static constexpr Tagged_t kcompare_string = 0x3555;
+  static constexpr Tagged_t kcollation_string = 0x3569;
+  static constexpr Tagged_t kcollations_string = 0x3581;
+  static constexpr Tagged_t kcompact_string = 0x3599;
+  static constexpr Tagged_t kcompactDisplay_string = 0x35ad;
+  static constexpr Tagged_t kcurrency_string = 0x35c9;
+  static constexpr Tagged_t kcurrencyDisplay_string = 0x35dd;
+  static constexpr Tagged_t kcurrencySign_string = 0x35f9;
+  static constexpr Tagged_t kdateStyle_string = 0x3611;
+  static constexpr Tagged_t kdateTimeField_string = 0x3629;
+  static constexpr Tagged_t kdayPeriod_string = 0x3645;
+  static constexpr Tagged_t kdaysDisplay_string = 0x365d;
+  static constexpr Tagged_t kdecimal_string = 0x3675;
+  static constexpr Tagged_t kdialect_string = 0x3689;
+  static constexpr Tagged_t kdigital_string = 0x369d;
+  static constexpr Tagged_t kdirection_string = 0x36b1;
+  static constexpr Tagged_t kendRange_string = 0x36c9;
+  static constexpr Tagged_t kengineering_string = 0x36dd;
+  static constexpr Tagged_t kexceptZero_string = 0x36f5;
+  static constexpr Tagged_t kexpand_string = 0x370d;
+  static constexpr Tagged_t kexponentInteger_string = 0x3721;
+  static constexpr Tagged_t kexponentMinusSign_string = 0x373d;
+  static constexpr Tagged_t kexponentSeparator_string = 0x375d;
+  static constexpr Tagged_t kfallback_string = 0x377d;
+  static constexpr Tagged_t kfirst_string = 0x3791;
+  static constexpr Tagged_t kfirstDay_string = 0x37a5;
+  static constexpr Tagged_t kfloor_string = 0x37b9;
+  static constexpr Tagged_t kformat_string = 0x37cd;
+  static constexpr Tagged_t kfraction_string = 0x37e1;
+  static constexpr Tagged_t kfractionalDigits_string = 0x37f5;
+  static constexpr Tagged_t kfractionalSecond_string = 0x3811;
+  static constexpr Tagged_t kfull_string = 0x382d;
+  static constexpr Tagged_t kgranularity_string = 0x383d;
+  static constexpr Tagged_t kgrapheme_string = 0x3855;
+  static constexpr Tagged_t kgroup_string = 0x3869;
+  static constexpr Tagged_t kh11_string = 0x387d;
+  static constexpr Tagged_t kh12_string = 0x388d;
+  static constexpr Tagged_t kh23_string = 0x389d;
+  static constexpr Tagged_t kh24_string = 0x38ad;
+  static constexpr Tagged_t khalfCeil_string = 0x38bd;
+  static constexpr Tagged_t khalfEven_string = 0x38d1;
+  static constexpr Tagged_t khalfExpand_string = 0x38e5;
+  static constexpr Tagged_t khalfFloor_string = 0x38fd;
+  static constexpr Tagged_t khalfTrunc_string = 0x3915;
+  static constexpr Tagged_t khour12_string = 0x392d;
+  static constexpr Tagged_t khourCycle_string = 0x3941;
+  static constexpr Tagged_t khourCycles_string = 0x3959;
+  static constexpr Tagged_t khoursDisplay_string = 0x3971;
+  static constexpr Tagged_t kideo_string = 0x3989;
+  static constexpr Tagged_t kignorePunctuation_string = 0x3999;
+  static constexpr Tagged_t kInvalid_Date_string = 0x39b9;
+  static constexpr Tagged_t kinteger_string = 0x39d1;
+  static constexpr Tagged_t kisWordLike_string = 0x39e5;
+  static constexpr Tagged_t kkana_string = 0x39fd;
+  static constexpr Tagged_t klanguage_string = 0x3a0d;
+  static constexpr Tagged_t klanguageDisplay_string = 0x3a21;
+  static constexpr Tagged_t klessPrecision_string = 0x3a3d;
+  static constexpr Tagged_t kletter_string = 0x3a59;
+  static constexpr Tagged_t klist_string = 0x3a6d;
+  static constexpr Tagged_t kliteral_string = 0x3a7d;
+  static constexpr Tagged_t klocale_string = 0x3a91;
+  static constexpr Tagged_t kloose_string = 0x3aa5;
+  static constexpr Tagged_t klower_string = 0x3ab9;
+  static constexpr Tagged_t kltr_string = 0x3acd;
+  static constexpr Tagged_t kmaximumFractionDigits_string = 0x3add;
+  static constexpr Tagged_t kmaximumSignificantDigits_string = 0x3b01;
+  static constexpr Tagged_t kmicrosecondsDisplay_string = 0x3b25;
+  static constexpr Tagged_t kmillisecondsDisplay_string = 0x3b45;
+  static constexpr Tagged_t kmin2_string = 0x3b65;
+  static constexpr Tagged_t kminimalDays_string = 0x3b75;
+  static constexpr Tagged_t kminimumFractionDigits_string = 0x3b8d;
+  static constexpr Tagged_t kminimumIntegerDigits_string = 0x3bb1;
+  static constexpr Tagged_t kminimumSignificantDigits_string = 0x3bd1;
+  static constexpr Tagged_t kminus_0 = 0x3bf5;
+  static constexpr Tagged_t kminusSign_string = 0x3c05;
+  static constexpr Tagged_t kminutesDisplay_string = 0x3c1d;
+  static constexpr Tagged_t kmonthsDisplay_string = 0x3c39;
+  static constexpr Tagged_t kmorePrecision_string = 0x3c55;
+  static constexpr Tagged_t knan_string = 0x3c71;
+  static constexpr Tagged_t knanosecondsDisplay_string = 0x3c81;
+  static constexpr Tagged_t knarrowSymbol_string = 0x3ca1;
+  static constexpr Tagged_t knegative_string = 0x3cb9;
+  static constexpr Tagged_t knever_string = 0x3ccd;
+  static constexpr Tagged_t knone_string = 0x3ce1;
+  static constexpr Tagged_t knotation_string = 0x3cf1;
+  static constexpr Tagged_t knormal_string = 0x3d05;
+  static constexpr Tagged_t knumberingSystem_string = 0x3d19;
+  static constexpr Tagged_t knumberingSystems_string = 0x3d35;
+  static constexpr Tagged_t knumeric_string = 0x3d51;
+  static constexpr Tagged_t kordinal_string = 0x3d65;
+  static constexpr Tagged_t kpercentSign_string = 0x3d79;
+  static constexpr Tagged_t kplusSign_string = 0x3d91;
+  static constexpr Tagged_t kquarter_string = 0x3da5;
+  static constexpr Tagged_t kregion_string = 0x3db9;
+  static constexpr Tagged_t krelatedYear_string = 0x3dcd;
+  static constexpr Tagged_t kroundingMode_string = 0x3de5;
+  static constexpr Tagged_t kroundingPriority_string = 0x3dfd;
+  static constexpr Tagged_t krtl_string = 0x3e19;
+  static constexpr Tagged_t kscientific_string = 0x3e29;
+  static constexpr Tagged_t ksecondsDisplay_string = 0x3e41;
+  static constexpr Tagged_t ksegment_string = 0x3e5d;
+  static constexpr Tagged_t kSegmentIterator_string = 0x3e71;
+  static constexpr Tagged_t kSegments_string = 0x3e8d;
+  static constexpr Tagged_t ksensitivity_string = 0x3ea1;
+  static constexpr Tagged_t ksep_string = 0x3eb9;
+  static constexpr Tagged_t kshared_string = 0x3ec9;
+  static constexpr Tagged_t ksignDisplay_string = 0x3edd;
+  static constexpr Tagged_t kstandard_string = 0x3ef5;
+  static constexpr Tagged_t kstartRange_string = 0x3f09;
+  static constexpr Tagged_t kstrict_string = 0x3f21;
+  static constexpr Tagged_t kstripIfInteger_string = 0x3f35;
+  static constexpr Tagged_t kstyle_string = 0x3f51;
+  static constexpr Tagged_t kterm_string = 0x3f65;
+  static constexpr Tagged_t ktextInfo_string = 0x3f75;
+  static constexpr Tagged_t ktimeStyle_string = 0x3f89;
+  static constexpr Tagged_t ktimeZones_string = 0x3fa1;
+  static constexpr Tagged_t ktimeZoneName_string = 0x3fb9;
+  static constexpr Tagged_t ktrailingZeroDisplay_string = 0x3fd1;
+  static constexpr Tagged_t ktrunc_string = 0x3ff1;
+  static constexpr Tagged_t ktwo_digit_string = 0x4005;
+  static constexpr Tagged_t ktype_string = 0x4019;
+  static constexpr Tagged_t kunknown_string = 0x4029;
+  static constexpr Tagged_t kupper_string = 0x403d;
+  static constexpr Tagged_t kusage_string = 0x4051;
+  static constexpr Tagged_t kuseGrouping_string = 0x4065;
+  static constexpr Tagged_t kunitDisplay_string = 0x407d;
+  static constexpr Tagged_t kweekday_string = 0x4095;
+  static constexpr Tagged_t kweekend_string = 0x40a9;
+  static constexpr Tagged_t kweeksDisplay_string = 0x40bd;
+  static constexpr Tagged_t kweekInfo_string = 0x40d5;
+  static constexpr Tagged_t kyearName_string = 0x40e9;
+  static constexpr Tagged_t kyearsDisplay_string = 0x40fd;
+  static constexpr Tagged_t kadd_string = 0x4115;
+  static constexpr Tagged_t kAggregateError_string = 0x4125;
+  static constexpr Tagged_t kalways_string = 0x4141;
+  static constexpr Tagged_t kanonymous_function_string = 0x4155;
+  static constexpr Tagged_t kanonymous_string = 0x4175;
+  static constexpr Tagged_t kapply_string = 0x418d;
+  static constexpr Tagged_t kArguments_string = 0x41a1;
+  static constexpr Tagged_t karguments_string = 0x41b9;
+  static constexpr Tagged_t karguments_to_string = 0x41d1;
+  static constexpr Tagged_t kArray_string = 0x41f1;
+  static constexpr Tagged_t karray_to_string = 0x4205;
+  static constexpr Tagged_t kArrayBuffer_string = 0x4221;
+  static constexpr Tagged_t kArrayIterator_string = 0x4239;
+  static constexpr Tagged_t kas_string = 0x4255;
+  static constexpr Tagged_t kassert_string = 0x4265;
+  static constexpr Tagged_t kasync_string = 0x4279;
+  static constexpr Tagged_t kAtomicsCondition_string = 0x428d;
+  static constexpr Tagged_t kAtomicsMutex_string = 0x42ad;
+  static constexpr Tagged_t kauto_string = 0x42c9;
+  static constexpr Tagged_t kawait_string = 0x42d9;
+  static constexpr Tagged_t kBigInt_string = 0x42ed;
+  static constexpr Tagged_t kbigint_string = 0x4301;
+  static constexpr Tagged_t kBigInt64Array_string = 0x4315;
+  static constexpr Tagged_t kBigUint64Array_string = 0x4331;
+  static constexpr Tagged_t kbind_string = 0x434d;
+  static constexpr Tagged_t kblank_string = 0x435d;
+  static constexpr Tagged_t kBoolean_string = 0x4371;
+  static constexpr Tagged_t kboolean_string = 0x4385;
+  static constexpr Tagged_t kboolean_to_string = 0x4399;
+  static constexpr Tagged_t kbound__string = 0x43b5;
+  static constexpr Tagged_t kbuffer_string = 0x43c9;
+  static constexpr Tagged_t kbyte_length_string = 0x43dd;
+  static constexpr Tagged_t kbyte_offset_string = 0x43f5;
+  static constexpr Tagged_t kCompileError_string = 0x440d;
+  static constexpr Tagged_t kcalendar_string = 0x4425;
+  static constexpr Tagged_t kcallee_string = 0x4439;
+  static constexpr Tagged_t kcaller_string = 0x444d;
+  static constexpr Tagged_t kcause_string = 0x4461;
+  static constexpr Tagged_t kcharacter_string = 0x4475;
+  static constexpr Tagged_t kclosure_string = 0x448d;
+  static constexpr Tagged_t kcode_string = 0x44a5;
+  static constexpr Tagged_t kcolumn_string = 0x44b5;
+  static constexpr Tagged_t kcomputed_string = 0x44c9;
+  static constexpr Tagged_t kconjunction_string = 0x44e1;
+  static constexpr Tagged_t kconsole_string = 0x44f9;
+  static constexpr Tagged_t kconstrain_string = 0x450d;
+  static constexpr Tagged_t kconstruct_string = 0x4525;
+  static constexpr Tagged_t kcurrent_string = 0x453d;
+  static constexpr Tagged_t kDate_string = 0x4551;
+  static constexpr Tagged_t kdate_to_string = 0x4561;
+  static constexpr Tagged_t kdateAdd_string = 0x457d;
+  static constexpr Tagged_t kdateFromFields_string = 0x4591;
+  static constexpr Tagged_t kdateUntil_string = 0x45ad;
+  static constexpr Tagged_t kday_string = 0x45c5;
+  static constexpr Tagged_t kdayOfWeek_string = 0x45d5;
+  static constexpr Tagged_t kdayOfYear_string = 0x45ed;
+  static constexpr Tagged_t kdays_string = 0x4605;
+  static constexpr Tagged_t kdaysInMonth_string = 0x4615;
+  static constexpr Tagged_t kdaysInWeek_string = 0x462d;
+  static constexpr Tagged_t kdaysInYear_string = 0x4645;
+  static constexpr Tagged_t kdefault_string = 0x465d;
+  static constexpr Tagged_t kdefineProperty_string = 0x4671;
+  static constexpr Tagged_t kdeleteProperty_string = 0x468d;
+  static constexpr Tagged_t kdetached_string = 0x46a9;
+  static constexpr Tagged_t kdisjunction_string = 0x46bd;
+  static constexpr Tagged_t kdone_string = 0x46d5;
+  static constexpr Tagged_t kdot_brand_string = 0x46e5;
+  static constexpr Tagged_t kdot_catch_string = 0x46f9;
+  static constexpr Tagged_t kdot_default_string = 0x470d;
+  static constexpr Tagged_t kdot_for_string = 0x4721;
+  static constexpr Tagged_t kdot_generator_object_string = 0x4731;
+  static constexpr Tagged_t kdot_home_object_string = 0x4751;
+  static constexpr Tagged_t kdot_new_target_string = 0x4769;
+  static constexpr Tagged_t knew_target_string = 0x4769;
+  static constexpr Tagged_t kdot_result_string = 0x4781;
+  static constexpr Tagged_t kdot_repl_result_string = 0x4795;
+  static constexpr Tagged_t kdot_static_home_object_string = 0x47ad;
+  static constexpr Tagged_t kdot_switch_tag_string = 0x47cd;
+  static constexpr Tagged_t kdotAll_string = 0x47e5;
+  static constexpr Tagged_t kError_string = 0x47f9;
+  static constexpr Tagged_t kEvalError_string = 0x480d;
+  static constexpr Tagged_t kelement_string = 0x4825;
+  static constexpr Tagged_t kepochMicroseconds_string = 0x4839;
+  static constexpr Tagged_t kepochMilliseconds_string = 0x4859;
+  static constexpr Tagged_t kepochNanoseconds_string = 0x4879;
+  static constexpr Tagged_t kepochSeconds_string = 0x4895;
+  static constexpr Tagged_t kera_string = 0x48ad;
+  static constexpr Tagged_t keraYear_string = 0x48bd;
+  static constexpr Tagged_t kerrors_string = 0x48d1;
+  static constexpr Tagged_t kerror_to_string = 0x48e5;
+  static constexpr Tagged_t keval_string = 0x4901;
+  static constexpr Tagged_t kexception_string = 0x4911;
+  static constexpr Tagged_t kexec_string = 0x4929;
+  static constexpr Tagged_t kfalse_string = 0x4939;
+  static constexpr Tagged_t kfields_string = 0x494d;
+  static constexpr Tagged_t kFinalizationRegistry_string = 0x4961;
+  static constexpr Tagged_t kflags_string = 0x4981;
+  static constexpr Tagged_t kFloat32Array_string = 0x4995;
+  static constexpr Tagged_t kFloat64Array_string = 0x49ad;
+  static constexpr Tagged_t kfractionalSecondDigits_string = 0x49c5;
+  static constexpr Tagged_t kfrom_string = 0x49e9;
+  static constexpr Tagged_t kFunction_string = 0x49f9;
+  static constexpr Tagged_t kfunction_native_code_string = 0x4a0d;
+  static constexpr Tagged_t kfunction_string = 0x4a39;
+  static constexpr Tagged_t kfunction_to_string = 0x4a4d;
+  static constexpr Tagged_t kGenerator_string = 0x4a6d;
+  static constexpr Tagged_t kget_space_string = 0x4a85;
+  static constexpr Tagged_t kget_string = 0x4a95;
+  static constexpr Tagged_t kgetOffsetNanosecondsFor_string = 0x4aa5;
+  static constexpr Tagged_t kgetOwnPropertyDescriptor_string = 0x4ac9;
+  static constexpr Tagged_t kgetPossibleInstantsFor_string = 0x4aed;
+  static constexpr Tagged_t kgetPrototypeOf_string = 0x4b11;
+  static constexpr Tagged_t kglobal_string = 0x4b2d;
+  static constexpr Tagged_t kglobalThis_string = 0x4b41;
+  static constexpr Tagged_t kgroups_string = 0x4b59;
+  static constexpr Tagged_t kgrowable_string = 0x4b6d;
+  static constexpr Tagged_t khas_string = 0x4b81;
+  static constexpr Tagged_t khasIndices_string = 0x4b91;
+  static constexpr Tagged_t khour_string = 0x4ba9;
+  static constexpr Tagged_t khours_string = 0x4bb9;
+  static constexpr Tagged_t khoursInDay_string = 0x4bcd;
+  static constexpr Tagged_t kignoreCase_string = 0x4be5;
+  static constexpr Tagged_t kid_string = 0x4bfd;
+  static constexpr Tagged_t killegal_access_string = 0x4c0d;
+  static constexpr Tagged_t killegal_argument_string = 0x4c29;
+  static constexpr Tagged_t kinLeapYear_string = 0x4c45;
+  static constexpr Tagged_t kindex_string = 0x4c5d;
+  static constexpr Tagged_t kindices_string = 0x4c71;
+  static constexpr Tagged_t kInfinity_string = 0x4c85;
+  static constexpr Tagged_t kinfinity_string = 0x4c99;
+  static constexpr Tagged_t kinput_string = 0x4cad;
+  static constexpr Tagged_t kinstance_members_initializer_string = 0x4cc1;
+  static constexpr Tagged_t kInt16Array_string = 0x4ced;
+  static constexpr Tagged_t kInt32Array_string = 0x4d05;
+  static constexpr Tagged_t kInt8Array_string = 0x4d1d;
+  static constexpr Tagged_t kisExtensible_string = 0x4d35;
+  static constexpr Tagged_t kiso8601_string = 0x4d4d;
+  static constexpr Tagged_t kisoDay_string = 0x4d61;
+  static constexpr Tagged_t kisoHour_string = 0x4d75;
+  static constexpr Tagged_t kisoMicrosecond_string = 0x4d89;
+  static constexpr Tagged_t kisoMillisecond_string = 0x4da5;
+  static constexpr Tagged_t kisoMinute_string = 0x4dc1;
+  static constexpr Tagged_t kisoMonth_string = 0x4dd9;
+  static constexpr Tagged_t kisoNanosecond_string = 0x4ded;
+  static constexpr Tagged_t kisoSecond_string = 0x4e09;
+  static constexpr Tagged_t kisoYear_string = 0x4e21;
+  static constexpr Tagged_t kjsMemoryEstimate_string = 0x4e35;
+  static constexpr Tagged_t kjsMemoryRange_string = 0x4e51;
+  static constexpr Tagged_t kkeys_string = 0x4e6d;
+  static constexpr Tagged_t klargestUnit_string = 0x4e7d;
+  static constexpr Tagged_t klastIndex_string = 0x4e95;
+  static constexpr Tagged_t klet_string = 0x4ead;
+  static constexpr Tagged_t kline_string = 0x4ebd;
+  static constexpr Tagged_t klinear_string = 0x4ecd;
+  static constexpr Tagged_t kLinkError_string = 0x4ee1;
+  static constexpr Tagged_t klong_string = 0x4ef9;
+  static constexpr Tagged_t kMap_string = 0x4f09;
+  static constexpr Tagged_t kMapIterator_string = 0x4f19;
+  static constexpr Tagged_t kmax_byte_length_string = 0x4f31;
+  static constexpr Tagged_t kmedium_string = 0x4f4d;
+  static constexpr Tagged_t kmergeFields_string = 0x4f61;
+  static constexpr Tagged_t kmessage_string = 0x4f79;
+  static constexpr Tagged_t kmeta_string = 0x4f8d;
+  static constexpr Tagged_t kminus_Infinity_string = 0x4f9d;
+  static constexpr Tagged_t kmicrosecond_string = 0x4fb5;
+  static constexpr Tagged_t kmicroseconds_string = 0x4fcd;
+  static constexpr Tagged_t kmillisecond_string = 0x4fe5;
+  static constexpr Tagged_t kmilliseconds_string = 0x4ffd;
+  static constexpr Tagged_t kminute_string = 0x5015;
+  static constexpr Tagged_t kminutes_string = 0x5029;
+  static constexpr Tagged_t kModule_string = 0x503d;
+  static constexpr Tagged_t kmonth_string = 0x5051;
+  static constexpr Tagged_t kmonthDayFromFields_string = 0x5065;
+  static constexpr Tagged_t kmonths_string = 0x5085;
+  static constexpr Tagged_t kmonthsInYear_string = 0x5099;
+  static constexpr Tagged_t kmonthCode_string = 0x50b1;
+  static constexpr Tagged_t kmultiline_string = 0x50c9;
+  static constexpr Tagged_t kNaN_string = 0x50e1;
+  static constexpr Tagged_t knanosecond_string = 0x50f1;
+  static constexpr Tagged_t knanoseconds_string = 0x5109;
+  static constexpr Tagged_t knarrow_string = 0x5121;
+  static constexpr Tagged_t knative_string = 0x5135;
+  static constexpr Tagged_t kNFC_string = 0x5149;
+  static constexpr Tagged_t kNFD_string = 0x5159;
+  static constexpr Tagged_t kNFKC_string = 0x5169;
+  static constexpr Tagged_t kNFKD_string = 0x5179;
+  static constexpr Tagged_t knot_equal_string = 0x5189;
+  static constexpr Tagged_t knull_string = 0x51a1;
+  static constexpr Tagged_t knull_to_string = 0x51b1;
+  static constexpr Tagged_t kNumber_string = 0x51cd;
+  static constexpr Tagged_t knumber_string = 0x51e1;
+  static constexpr Tagged_t knumber_to_string = 0x51f5;
+  static constexpr Tagged_t kObject_string = 0x5211;
+  static constexpr Tagged_t kobject_string = 0x5225;
+  static constexpr Tagged_t kobject_to_string = 0x5239;
+  static constexpr Tagged_t kObject_prototype_string = 0x5255;
+  static constexpr Tagged_t kof_string = 0x5271;
+  static constexpr Tagged_t koffset_string = 0x5281;
+  static constexpr Tagged_t koffsetNanoseconds_string = 0x5295;
+  static constexpr Tagged_t kok_string = 0x52b5;
+  static constexpr Tagged_t kother_string = 0x52c5;
+  static constexpr Tagged_t koverflow_string = 0x52d9;
+  static constexpr Tagged_t kownKeys_string = 0x52ed;
+  static constexpr Tagged_t kpercent_string = 0x5301;
+  static constexpr Tagged_t kplainDate_string = 0x5315;
+  static constexpr Tagged_t kplainTime_string = 0x532d;
+  static constexpr Tagged_t kposition_string = 0x5345;
+  static constexpr Tagged_t kpreventExtensions_string = 0x5359;
+  static constexpr Tagged_t kprivate_constructor_string = 0x5379;
+  static constexpr Tagged_t kPromise_string = 0x5391;
+  static constexpr Tagged_t kpromise_string = 0x53a5;
+  static constexpr Tagged_t kproto_string = 0x53b9;
+  static constexpr Tagged_t kproxy_string = 0x53d1;
+  static constexpr Tagged_t kProxy_string = 0x53e5;
+  static constexpr Tagged_t kquery_colon_string = 0x53f9;
+  static constexpr Tagged_t kRangeError_string = 0x5409;
+  static constexpr Tagged_t kraw_json_string = 0x5421;
+  static constexpr Tagged_t kraw_string = 0x5435;
+  static constexpr Tagged_t kReferenceError_string = 0x5445;
+  static constexpr Tagged_t kReflectGet_string = 0x5461;
+  static constexpr Tagged_t kReflectHas_string = 0x5479;
+  static constexpr Tagged_t kRegExp_string = 0x5491;
+  static constexpr Tagged_t kregexp_to_string = 0x54a5;
+  static constexpr Tagged_t kreject_string = 0x54c1;
+  static constexpr Tagged_t krelativeTo_string = 0x54d5;
+  static constexpr Tagged_t kresizable_string = 0x54ed;
+  static constexpr Tagged_t kResizableArrayBuffer_string = 0x5505;
+  static constexpr Tagged_t kreturn_string = 0x5525;
+  static constexpr Tagged_t krevoke_string = 0x5539;
+  static constexpr Tagged_t kroundingIncrement_string = 0x554d;
+  static constexpr Tagged_t kRuntimeError_string = 0x556d;
+  static constexpr Tagged_t kWebAssemblyException_string = 0x5585;
+  static constexpr Tagged_t kScript_string = 0x55a9;
+  static constexpr Tagged_t kscript_string = 0x55bd;
+  static constexpr Tagged_t ksecond_string = 0x55d1;
+  static constexpr Tagged_t kseconds_string = 0x55e5;
+  static constexpr Tagged_t kshort_string = 0x55f9;
+  static constexpr Tagged_t kSet_string = 0x560d;
+  static constexpr Tagged_t ksentence_string = 0x561d;
+  static constexpr Tagged_t kset_space_string = 0x5631;
+  static constexpr Tagged_t kset_string = 0x5641;
+  static constexpr Tagged_t kSetIterator_string = 0x5651;
+  static constexpr Tagged_t ksetPrototypeOf_string = 0x5669;
+  static constexpr Tagged_t kShadowRealm_string = 0x5685;
+  static constexpr Tagged_t kSharedArray_string = 0x569d;
+  static constexpr Tagged_t kSharedArrayBuffer_string = 0x56b5;
+  static constexpr Tagged_t kSharedStruct_string = 0x56d5;
+  static constexpr Tagged_t ksign_string = 0x56ed;
+  static constexpr Tagged_t ksize_string = 0x56fd;
+  static constexpr Tagged_t ksmallestUnit_string = 0x570d;
+  static constexpr Tagged_t ksource_string = 0x5725;
+  static constexpr Tagged_t ksourceText_string = 0x5739;
+  static constexpr Tagged_t kstack_string = 0x5751;
+  static constexpr Tagged_t kstackTraceLimit_string = 0x5765;
+  static constexpr Tagged_t kstatic_initializer_string = 0x5781;
+  static constexpr Tagged_t ksticky_string = 0x57a1;
+  static constexpr Tagged_t kString_string = 0x57b5;
+  static constexpr Tagged_t kstring_string = 0x57c9;
+  static constexpr Tagged_t kstring_to_string = 0x57dd;
+  static constexpr Tagged_t kSymbol_iterator_string = 0x57f9;
+  static constexpr Tagged_t kSymbol_match_all_string = 0x5815;
+  static constexpr Tagged_t kSymbol_replace_string = 0x5831;
+  static constexpr Tagged_t ksymbol_species_string = 0x584d;
+  static constexpr Tagged_t kSymbol_species_string = 0x5869;
+  static constexpr Tagged_t kSymbol_split_string = 0x5885;
+  static constexpr Tagged_t kSymbol_string = 0x589d;
+  static constexpr Tagged_t ksymbol_string = 0x58b1;
+  static constexpr Tagged_t kSyntaxError_string = 0x58c5;
+  static constexpr Tagged_t ktarget_string = 0x58dd;
+  static constexpr Tagged_t kthis_function_string = 0x58f1;
+  static constexpr Tagged_t kthis_string = 0x590d;
+  static constexpr Tagged_t kthrow_string = 0x591d;
+  static constexpr Tagged_t ktimed_out_string = 0x5931;
+  static constexpr Tagged_t ktimeZone_string = 0x5949;
+  static constexpr Tagged_t ktoJSON_string = 0x595d;
+  static constexpr Tagged_t ktoString_string = 0x5971;
+  static constexpr Tagged_t ktrue_string = 0x5985;
+  static constexpr Tagged_t ktotal_string = 0x5995;
+  static constexpr Tagged_t kTypeError_string = 0x59a9;
+  static constexpr Tagged_t kUint16Array_string = 0x59c1;
+  static constexpr Tagged_t kUint32Array_string = 0x59d9;
+  static constexpr Tagged_t kUint8Array_string = 0x59f1;
+  static constexpr Tagged_t kUint8ClampedArray_string = 0x5a09;
+  static constexpr Tagged_t kundefined_string = 0x5a29;
+  static constexpr Tagged_t kundefined_to_string = 0x5a41;
+  static constexpr Tagged_t kunicode_string = 0x5a61;
+  static constexpr Tagged_t kunicodeSets_string = 0x5a75;
+  static constexpr Tagged_t kunit_string = 0x5a8d;
+  static constexpr Tagged_t kURIError_string = 0x5a9d;
+  static constexpr Tagged_t kUTC_string = 0x5ab1;
+  static constexpr Tagged_t kvalueOf_string = 0x5ac1;
+  static constexpr Tagged_t kWeakMap_string = 0x5ad5;
+  static constexpr Tagged_t kWeakRef_string = 0x5ae9;
+  static constexpr Tagged_t kWeakSet_string = 0x5afd;
+  static constexpr Tagged_t kweek_string = 0x5b11;
+  static constexpr Tagged_t kweeks_string = 0x5b21;
+  static constexpr Tagged_t kweekOfYear_string = 0x5b35;
+  static constexpr Tagged_t kwith_string = 0x5b4d;
+  static constexpr Tagged_t kword_string = 0x5b5d;
+  static constexpr Tagged_t kyearMonthFromFields_string = 0x5b6d;
+  static constexpr Tagged_t kyear_string = 0x5b8d;
+  static constexpr Tagged_t kyears_string = 0x5b9d;
+  static constexpr Tagged_t kPropertyCellHoleValue = 0x5bb1;
+  static constexpr Tagged_t kUninitializedValue = 0x5bbd;
+  static constexpr Tagged_t kArgumentsMarker = 0x5bf5;
+  static constexpr Tagged_t kTerminationException = 0x5c2d;
+  static constexpr Tagged_t kException = 0x5c6d;
+  static constexpr Tagged_t kOptimizedOut = 0x5c89;
+  static constexpr Tagged_t kStaleRegister = 0x5cc1;
+  static constexpr Tagged_t kSelfReferenceMarker = 0x5cf9;
+  static constexpr Tagged_t kBasicBlockCountersMarker = 0x5d39;
+  static constexpr Tagged_t karray_buffer_wasm_memory_symbol = 0x5d7d;
+  static constexpr Tagged_t kcall_site_info_symbol = 0x5d8d;
+  static constexpr Tagged_t kconsole_context_id_symbol = 0x5d9d;
+  static constexpr Tagged_t kconsole_context_name_symbol = 0x5dad;
+  static constexpr Tagged_t kclass_fields_symbol = 0x5dbd;
+  static constexpr Tagged_t kclass_positions_symbol = 0x5dcd;
+  static constexpr Tagged_t kerror_end_pos_symbol = 0x5ddd;
+  static constexpr Tagged_t kerror_script_symbol = 0x5ded;
+  static constexpr Tagged_t kerror_stack_symbol = 0x5dfd;
+  static constexpr Tagged_t kerror_start_pos_symbol = 0x5e0d;
+  static constexpr Tagged_t kfrozen_symbol = 0x5e1d;
+  static constexpr Tagged_t kinterpreter_trampoline_symbol = 0x5e2d;
+  static constexpr Tagged_t knative_context_index_symbol = 0x5e3d;
+  static constexpr Tagged_t knonextensible_symbol = 0x5e4d;
+  static constexpr Tagged_t kpromise_debug_marker_symbol = 0x5e5d;
+  static constexpr Tagged_t kpromise_debug_message_symbol = 0x5e6d;
+  static constexpr Tagged_t kpromise_forwarding_handler_symbol = 0x5e7d;
+  static constexpr Tagged_t kpromise_handled_by_symbol = 0x5e8d;
+  static constexpr Tagged_t kpromise_awaited_by_symbol = 0x5e9d;
+  static constexpr Tagged_t kregexp_result_names_symbol = 0x5ead;
+  static constexpr Tagged_t kregexp_result_regexp_input_symbol = 0x5ebd;
+  static constexpr Tagged_t kregexp_result_regexp_last_index_symbol = 0x5ecd;
+  static constexpr Tagged_t ksealed_symbol = 0x5edd;
+  static constexpr Tagged_t kstrict_function_transition_symbol = 0x5eed;
   static constexpr Tagged_t ktemplate_literal_function_literal_id_symbol =
-      0x5e35;
-  static constexpr Tagged_t ktemplate_literal_slot_id_symbol = 0x5e45;
-  static constexpr Tagged_t kwasm_exception_tag_symbol = 0x5e55;
-  static constexpr Tagged_t kwasm_exception_values_symbol = 0x5e65;
-  static constexpr Tagged_t kwasm_uncatchable_symbol = 0x5e75;
-  static constexpr Tagged_t kwasm_wrapped_object_symbol = 0x5e85;
-  static constexpr Tagged_t kwasm_debug_proxy_cache_symbol = 0x5e95;
-  static constexpr Tagged_t kwasm_debug_proxy_names_symbol = 0x5ea5;
-  static constexpr Tagged_t kasync_iterator_symbol = 0x5eb5;
-  static constexpr Tagged_t kintl_fallback_symbol = 0x5ee5;
-  static constexpr Tagged_t kmatch_all_symbol = 0x5f1d;
-  static constexpr Tagged_t kmatch_symbol = 0x5f49;
-  static constexpr Tagged_t ksearch_symbol = 0x5f71;
-  static constexpr Tagged_t ksplit_symbol = 0x5f9d;
-  static constexpr Tagged_t kto_primitive_symbol = 0x5fc5;
-  static constexpr Tagged_t kunscopables_symbol = 0x5ff5;
-  static constexpr Tagged_t khas_instance_symbol = 0x6025;
-  static constexpr Tagged_t kto_string_tag_symbol = 0x6055;
-  static constexpr Tagged_t kconstructor_string = 0x60ad;
-  static constexpr Tagged_t knext_string = 0x60c5;
-  static constexpr Tagged_t kresolve_string = 0x60d5;
-  static constexpr Tagged_t kthen_string = 0x60e9;
-  static constexpr Tagged_t kiterator_symbol = 0x60f9;
-  static constexpr Tagged_t kreplace_symbol = 0x6109;
-  static constexpr Tagged_t kspecies_symbol = 0x6119;
-  static constexpr Tagged_t kis_concat_spreadable_symbol = 0x6129;
-  static constexpr Tagged_t kEmptySlowElementDictionary = 0x6139;
-  static constexpr Tagged_t kEmptySymbolTable = 0x615d;
-  static constexpr Tagged_t kEmptyOrderedHashMap = 0x6179;
-  static constexpr Tagged_t kEmptyOrderedHashSet = 0x618d;
-  static constexpr Tagged_t kEmptyFeedbackMetadata = 0x61a1;
-  static constexpr Tagged_t kGlobalThisBindingScopeInfo = 0x61ad;
-  static constexpr Tagged_t kEmptyFunctionScopeInfo = 0x61cd;
-  static constexpr Tagged_t kNativeScopeInfo = 0x61f1;
-  static constexpr Tagged_t kShadowRealmScopeInfo = 0x6209;
+      0x5efd;
+  static constexpr Tagged_t ktemplate_literal_slot_id_symbol = 0x5f0d;
+  static constexpr Tagged_t kwasm_exception_tag_symbol = 0x5f1d;
+  static constexpr Tagged_t kwasm_exception_values_symbol = 0x5f2d;
+  static constexpr Tagged_t kwasm_uncatchable_symbol = 0x5f3d;
+  static constexpr Tagged_t kwasm_wrapped_object_symbol = 0x5f4d;
+  static constexpr Tagged_t kwasm_debug_proxy_cache_symbol = 0x5f5d;
+  static constexpr Tagged_t kwasm_debug_proxy_names_symbol = 0x5f6d;
+  static constexpr Tagged_t kasync_iterator_symbol = 0x5f7d;
+  static constexpr Tagged_t kintl_fallback_symbol = 0x5fad;
+  static constexpr Tagged_t kmatch_symbol = 0x5fe5;
+  static constexpr Tagged_t ksearch_symbol = 0x600d;
+  static constexpr Tagged_t kto_primitive_symbol = 0x6039;
+  static constexpr Tagged_t kunscopables_symbol = 0x6069;
+  static constexpr Tagged_t khas_instance_symbol = 0x6099;
+  static constexpr Tagged_t kto_string_tag_symbol = 0x60c9;
+  static constexpr Tagged_t kconstructor_string = 0x6121;
+  static constexpr Tagged_t knext_string = 0x6139;
+  static constexpr Tagged_t kresolve_string = 0x6149;
+  static constexpr Tagged_t kthen_string = 0x615d;
+  static constexpr Tagged_t kiterator_symbol = 0x616d;
+  static constexpr Tagged_t kmatch_all_symbol = 0x617d;
+  static constexpr Tagged_t kreplace_symbol = 0x618d;
+  static constexpr Tagged_t kspecies_symbol = 0x619d;
+  static constexpr Tagged_t ksplit_symbol = 0x61ad;
+  static constexpr Tagged_t kis_concat_spreadable_symbol = 0x61bd;
+  static constexpr Tagged_t kEmptySlowElementDictionary = 0x61cd;
+  static constexpr Tagged_t kEmptySymbolTable = 0x61f1;
+  static constexpr Tagged_t kEmptyOrderedHashMap = 0x620d;
+  static constexpr Tagged_t kEmptyOrderedHashSet = 0x6221;
+  static constexpr Tagged_t kEmptyFeedbackMetadata = 0x6235;
+  static constexpr Tagged_t kGlobalThisBindingScopeInfo = 0x6241;
+  static constexpr Tagged_t kEmptyFunctionScopeInfo = 0x6261;
+  static constexpr Tagged_t kNativeScopeInfo = 0x6285;
+  static constexpr Tagged_t kShadowRealmScopeInfo = 0x629d;
+  static constexpr Tagged_t kEmptyExternalPointerArray = 0x62b5;
+  static constexpr Tagged_t kWasmNullPadding = 0x62bd;
   static constexpr Tagged_t kWasmNull = 0xfffd;
+  static constexpr Tagged_t kJSSharedArrayMap = 0x20001;
+  static constexpr Tagged_t kJSAtomicsMutexMap = 0x20045;
+  static constexpr Tagged_t kJSAtomicsConditionMap = 0x2006d;
 };
 
-static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
+static constexpr std::array<Tagged_t, 752> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kFreeSpaceMap,
     StaticReadOnlyRoot::kOnePointerFillerMap,
     StaticReadOnlyRoot::kTwoPointerFillerMap,
@@ -786,8 +800,8 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kFixedDoubleArrayMap,
     StaticReadOnlyRoot::kHashTableMap,
     StaticReadOnlyRoot::kSymbolMap,
-    StaticReadOnlyRoot::kOneByteStringMap,
-    StaticReadOnlyRoot::kOneByteInternalizedStringMap,
+    StaticReadOnlyRoot::kSeqOneByteStringMap,
+    StaticReadOnlyRoot::kInternalizedOneByteStringMap,
     StaticReadOnlyRoot::kScopeInfoMap,
     StaticReadOnlyRoot::kSharedFunctionInfoMap,
     StaticReadOnlyRoot::kInstructionStreamMap,
@@ -805,6 +819,7 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kTerminationException,
     StaticReadOnlyRoot::kOptimizedOut,
     StaticReadOnlyRoot::kStaleRegister,
+    StaticReadOnlyRoot::kPropertyCellHoleValue,
     StaticReadOnlyRoot::kScriptContextTableMap,
     StaticReadOnlyRoot::kClosureFeedbackCellArrayMap,
     StaticReadOnlyRoot::kFeedbackMetadataArrayMap,
@@ -832,7 +847,6 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kAccessorInfoMap,
     StaticReadOnlyRoot::kSideEffectCallHandlerInfoMap,
     StaticReadOnlyRoot::kSideEffectFreeCallHandlerInfoMap,
-    StaticReadOnlyRoot::kNextCallSideEffectFreeCallHandlerInfoMap,
     StaticReadOnlyRoot::kSimpleNumberDictionaryMap,
     StaticReadOnlyRoot::kSmallOrderedHashMapMap,
     StaticReadOnlyRoot::kSmallOrderedHashSetMap,
@@ -854,29 +868,31 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kEphemeronHashTableMap,
     StaticReadOnlyRoot::kEmbedderDataArrayMap,
     StaticReadOnlyRoot::kWeakCellMap,
-    StaticReadOnlyRoot::kStringMap,
+    StaticReadOnlyRoot::kExternalPointerArrayMap,
+    StaticReadOnlyRoot::kSeqTwoByteStringMap,
+    StaticReadOnlyRoot::kConsTwoByteStringMap,
     StaticReadOnlyRoot::kConsOneByteStringMap,
-    StaticReadOnlyRoot::kConsStringMap,
-    StaticReadOnlyRoot::kThinStringMap,
-    StaticReadOnlyRoot::kSlicedStringMap,
+    StaticReadOnlyRoot::kThinTwoByteStringMap,
+    StaticReadOnlyRoot::kThinOneByteStringMap,
+    StaticReadOnlyRoot::kSlicedTwoByteStringMap,
     StaticReadOnlyRoot::kSlicedOneByteStringMap,
-    StaticReadOnlyRoot::kExternalStringMap,
+    StaticReadOnlyRoot::kExternalTwoByteStringMap,
     StaticReadOnlyRoot::kExternalOneByteStringMap,
-    StaticReadOnlyRoot::kUncachedExternalStringMap,
-    StaticReadOnlyRoot::kInternalizedStringMap,
-    StaticReadOnlyRoot::kExternalInternalizedStringMap,
-    StaticReadOnlyRoot::kExternalOneByteInternalizedStringMap,
-    StaticReadOnlyRoot::kUncachedExternalInternalizedStringMap,
-    StaticReadOnlyRoot::kUncachedExternalOneByteInternalizedStringMap,
+    StaticReadOnlyRoot::kInternalizedTwoByteStringMap,
+    StaticReadOnlyRoot::kExternalInternalizedTwoByteStringMap,
+    StaticReadOnlyRoot::kExternalInternalizedOneByteStringMap,
+    StaticReadOnlyRoot::kUncachedExternalInternalizedTwoByteStringMap,
+    StaticReadOnlyRoot::kUncachedExternalInternalizedOneByteStringMap,
+    StaticReadOnlyRoot::kUncachedExternalTwoByteStringMap,
     StaticReadOnlyRoot::kUncachedExternalOneByteStringMap,
-    StaticReadOnlyRoot::kSharedOneByteStringMap,
-    StaticReadOnlyRoot::kSharedStringMap,
+    StaticReadOnlyRoot::kSharedSeqOneByteStringMap,
+    StaticReadOnlyRoot::kSharedSeqTwoByteStringMap,
     StaticReadOnlyRoot::kSharedExternalOneByteStringMap,
-    StaticReadOnlyRoot::kSharedExternalStringMap,
+    StaticReadOnlyRoot::kSharedExternalTwoByteStringMap,
     StaticReadOnlyRoot::kSharedUncachedExternalOneByteStringMap,
-    StaticReadOnlyRoot::kSharedUncachedExternalStringMap,
+    StaticReadOnlyRoot::kSharedUncachedExternalTwoByteStringMap,
     StaticReadOnlyRoot::kUndefinedMap,
-    StaticReadOnlyRoot::kTheHoleMap,
+    StaticReadOnlyRoot::kHoleMap,
     StaticReadOnlyRoot::kNullMap,
     StaticReadOnlyRoot::kBooleanMap,
     StaticReadOnlyRoot::kUninitializedMap,
@@ -887,9 +903,13 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kStaleRegisterMap,
     StaticReadOnlyRoot::kSelfReferenceMarkerMap,
     StaticReadOnlyRoot::kBasicBlockCountersMarkerMap,
+    StaticReadOnlyRoot::kJSSharedArrayMap,
+    StaticReadOnlyRoot::kJSAtomicsMutexMap,
+    StaticReadOnlyRoot::kJSAtomicsConditionMap,
     StaticReadOnlyRoot::kEmptyEnumCache,
     StaticReadOnlyRoot::kEmptyPropertyArray,
     StaticReadOnlyRoot::kEmptyByteArray,
+    StaticReadOnlyRoot::kEmptyExternalPointerArray,
     StaticReadOnlyRoot::kEmptyObjectBoilerplateDescription,
     StaticReadOnlyRoot::kEmptyArrayBoilerplateDescription,
     StaticReadOnlyRoot::kEmptyClosureFeedbackCellArray,
@@ -923,6 +943,7 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kShadowRealmScopeInfo,
     StaticReadOnlyRoot::kEmptySymbolTable,
     StaticReadOnlyRoot::kHashSeed,
+    StaticReadOnlyRoot::kWasmNullPadding,
     StaticReadOnlyRoot::kWasmNull,
     StaticReadOnlyRoot::klength_string,
     StaticReadOnlyRoot::kprototype_string,
@@ -1203,6 +1224,7 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kInfinity_string,
     StaticReadOnlyRoot::kinfinity_string,
     StaticReadOnlyRoot::kinput_string,
+    StaticReadOnlyRoot::kinstance_members_initializer_string,
     StaticReadOnlyRoot::kInt16Array_string,
     StaticReadOnlyRoot::kInt32Array_string,
     StaticReadOnlyRoot::kInt8Array_string,
@@ -1283,6 +1305,7 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kpreventExtensions_string,
     StaticReadOnlyRoot::kprivate_constructor_string,
     StaticReadOnlyRoot::kPromise_string,
+    StaticReadOnlyRoot::kpromise_string,
     StaticReadOnlyRoot::kproto_string,
     StaticReadOnlyRoot::kproxy_string,
     StaticReadOnlyRoot::kProxy_string,
@@ -1320,19 +1343,23 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kSharedArrayBuffer_string,
     StaticReadOnlyRoot::kSharedStruct_string,
     StaticReadOnlyRoot::ksign_string,
+    StaticReadOnlyRoot::ksize_string,
     StaticReadOnlyRoot::ksmallestUnit_string,
     StaticReadOnlyRoot::ksource_string,
     StaticReadOnlyRoot::ksourceText_string,
     StaticReadOnlyRoot::kstack_string,
     StaticReadOnlyRoot::kstackTraceLimit_string,
+    StaticReadOnlyRoot::kstatic_initializer_string,
     StaticReadOnlyRoot::ksticky_string,
     StaticReadOnlyRoot::kString_string,
     StaticReadOnlyRoot::kstring_string,
     StaticReadOnlyRoot::kstring_to_string,
     StaticReadOnlyRoot::kSymbol_iterator_string,
+    StaticReadOnlyRoot::kSymbol_match_all_string,
     StaticReadOnlyRoot::kSymbol_replace_string,
     StaticReadOnlyRoot::ksymbol_species_string,
     StaticReadOnlyRoot::kSymbol_species_string,
+    StaticReadOnlyRoot::kSymbol_split_string,
     StaticReadOnlyRoot::kSymbol_string,
     StaticReadOnlyRoot::ksymbol_string,
     StaticReadOnlyRoot::kSyntaxError_string,
@@ -1365,6 +1392,7 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kweek_string,
     StaticReadOnlyRoot::kweeks_string,
     StaticReadOnlyRoot::kweekOfYear_string,
+    StaticReadOnlyRoot::kwith_string,
     StaticReadOnlyRoot::kword_string,
     StaticReadOnlyRoot::kyearMonthFromFields_string,
     StaticReadOnlyRoot::kyear_string,
@@ -1409,10 +1437,8 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kwasm_debug_proxy_names_symbol,
     StaticReadOnlyRoot::kasync_iterator_symbol,
     StaticReadOnlyRoot::kintl_fallback_symbol,
-    StaticReadOnlyRoot::kmatch_all_symbol,
     StaticReadOnlyRoot::kmatch_symbol,
     StaticReadOnlyRoot::ksearch_symbol,
-    StaticReadOnlyRoot::ksplit_symbol,
     StaticReadOnlyRoot::kto_primitive_symbol,
     StaticReadOnlyRoot::kunscopables_symbol,
     StaticReadOnlyRoot::khas_instance_symbol,
@@ -1497,8 +1523,10 @@ static constexpr std::array<Tagged_t, 738> StaticReadOnlyRootsPointerTable = {
     StaticReadOnlyRoot::kresolve_string,
     StaticReadOnlyRoot::kthen_string,
     StaticReadOnlyRoot::kiterator_symbol,
+    StaticReadOnlyRoot::kmatch_all_symbol,
     StaticReadOnlyRoot::kreplace_symbol,
     StaticReadOnlyRoot::kspecies_symbol,
+    StaticReadOnlyRoot::ksplit_symbol,
     StaticReadOnlyRoot::kis_concat_spreadable_symbol,
     StaticReadOnlyRoot::kLoadHandler1Map,
     StaticReadOnlyRoot::kLoadHandler2Map,
diff --git a/deps/v8/src/runtime/runtime-array.cc b/deps/v8/src/runtime/runtime-array.cc
index 11cb61eeefbda7..88e481303c5009 100644
--- a/deps/v8/src/runtime/runtime-array.cc
+++ b/deps/v8/src/runtime/runtime-array.cc
@@ -51,7 +51,7 @@ RUNTIME_FUNCTION(Runtime_NewArray) {
   Handle<JSReceiver> new_target = args.at<JSReceiver>(argc + 1);
   Handle<HeapObject> type_info = args.at<HeapObject>(argc + 2);
   // TODO(bmeurer): Use MaybeHandle to pass around the AllocationSite.
-  Handle<AllocationSite> site = type_info->IsAllocationSite()
+  Handle<AllocationSite> site = IsAllocationSite(*type_info)
                                     ? Handle<AllocationSite>::cast(type_info)
                                     : Handle<AllocationSite>::null();
 
@@ -63,15 +63,15 @@ RUNTIME_FUNCTION(Runtime_NewArray) {
   // - the constructor itself.
   // If called through Reflect.construct, it's guaranteed to be a constructor by
   // REFLECT_CONSTRUCT_PREPARE.
-  DCHECK(new_target->IsConstructor());
+  DCHECK(IsConstructor(*new_target));
 
   bool holey = false;
   bool can_use_type_feedback = !site.is_null();
   bool can_inline_array_constructor = true;
   if (argv.length() == 1) {
     Handle<Object> argument_one = argv.at<Object>(0);
-    if (argument_one->IsSmi()) {
-      int value = Handle<Smi>::cast(argument_one)->value();
+    if (IsSmi(*argument_one)) {
+      int value = Smi::cast(*argument_one).value();
       if (value < 0 ||
           JSArray::SetLengthWouldNormalize(isolate->heap(), value)) {
         // the array is a dictionary in this case.
@@ -116,7 +116,8 @@ RUNTIME_FUNCTION(Runtime_NewArray) {
   Handle<JSArray> array = Handle<JSArray>::cast(factory->NewJSObjectFromMap(
       initial_map, AllocationType::kYoung, allocation_site));
 
-  factory->NewJSArrayStorage(array, 0, 0, DONT_INITIALIZE_ARRAY_ELEMENTS);
+  factory->NewJSArrayStorage(
+      array, 0, 0, ArrayStorageAllocationMode::DONT_INITIALIZE_ARRAY_ELEMENTS);
 
   ElementsKind old_kind = array->GetElementsKind();
   RETURN_FAILURE_ON_EXCEPTION(isolate,
@@ -150,7 +151,7 @@ RUNTIME_FUNCTION(Runtime_NormalizeElements) {
   DCHECK_EQ(1, args.length());
   Handle<JSObject> array = args.at<JSObject>(0);
   CHECK(!array->HasTypedArrayOrRabGsabTypedArrayElements());
-  CHECK(!array->IsJSGlobalProxy());
+  CHECK(!IsJSGlobalProxy(*array));
   JSObject::NormalizeElements(array);
   return *array;
 }
@@ -164,24 +165,21 @@ RUNTIME_FUNCTION(Runtime_GrowArrayElements) {
   Handle<Object> key = args.at(1);
   ElementsKind kind = object->GetElementsKind();
   CHECK(IsFastElementsKind(kind));
-  const intptr_t kMaxLength = IsDoubleElementsKind(kind)
-                                  ? FixedDoubleArray::kMaxLength
-                                  : FixedArray::kMaxLength;
   uint32_t index;
-  if (key->IsSmi()) {
+  if (IsSmi(*key)) {
     int value = Smi::ToInt(*key);
     if (value < 0) return Smi::zero();
     index = static_cast<uint32_t>(value);
   } else {
-    CHECK(key->IsHeapNumber());
-    double value = HeapNumber::cast(*key).value();
-    if (value < 0 || value > kMaxLength) {
+    CHECK(IsHeapNumber(*key));
+    double value = HeapNumber::cast(*key)->value();
+    if (value < 0 || value > std::numeric_limits<uint32_t>::max()) {
       return Smi::zero();
     }
     index = static_cast<uint32_t>(value);
   }
 
-  uint32_t capacity = static_cast<uint32_t>(object->elements().length());
+  uint32_t capacity = static_cast<uint32_t>(object->elements()->length());
 
   if (index >= capacity) {
     bool has_grown;
@@ -209,8 +207,8 @@ RUNTIME_FUNCTION(Runtime_ArrayIsArray) {
 RUNTIME_FUNCTION(Runtime_IsArray) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
-  Object obj = args[0];
-  return isolate->heap()->ToBoolean(obj.IsJSArray());
+  Tagged<Object> obj = args[0];
+  return isolate->heap()->ToBoolean(IsJSArray(obj));
 }
 
 RUNTIME_FUNCTION(Runtime_ArraySpeciesConstructor) {
@@ -237,9 +235,10 @@ RUNTIME_FUNCTION(Runtime_ArrayIncludes_Slow) {
   // Let len be ? ToLength(? Get(O, "length")).
   int64_t len;
   {
-    if (object->map().instance_type() == JS_ARRAY_TYPE) {
+    if (object->map()->instance_type() == JS_ARRAY_TYPE) {
       uint32_t len32 = 0;
-      bool success = JSArray::cast(*object).length().ToArrayLength(&len32);
+      bool success =
+          Object::ToArrayLength(JSArray::cast(*object)->length(), &len32);
       DCHECK(success);
       USE(success);
       len = len32;
@@ -252,8 +251,8 @@ RUNTIME_FUNCTION(Runtime_ArrayIncludes_Slow) {
 
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, len_,
                                          Object::ToLength(isolate, len_));
-      len = static_cast<int64_t>(len_->Number());
-      DCHECK_EQ(len, len_->Number());
+      len = static_cast<int64_t>(Object::Number(*len_));
+      DCHECK_EQ(len, Object::Number(*len_));
     }
   }
 
@@ -262,11 +261,11 @@ RUNTIME_FUNCTION(Runtime_ArrayIncludes_Slow) {
   // Let n be ? ToInteger(fromIndex). (If fromIndex is undefined, this step
   // produces the value 0.)
   int64_t index = 0;
-  if (!from_index->IsUndefined(isolate)) {
+  if (!IsUndefined(*from_index, isolate)) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, from_index,
                                        Object::ToInteger(isolate, from_index));
 
-    if (V8_LIKELY(from_index->IsSmi())) {
+    if (V8_LIKELY(IsSmi(*from_index))) {
       int start_from = Smi::ToInt(*from_index);
       if (start_from < 0) {
         index = std::max<int64_t>(len + start_from, 0);
@@ -274,8 +273,8 @@ RUNTIME_FUNCTION(Runtime_ArrayIncludes_Slow) {
         index = start_from;
       }
     } else {
-      DCHECK(from_index->IsHeapNumber());
-      double start_from = from_index->Number();
+      DCHECK(IsHeapNumber(*from_index));
+      double start_from = Object::Number(*from_index);
       if (start_from >= len) return ReadOnlyRoots(isolate).false_value();
       if (V8_LIKELY(std::isfinite(start_from))) {
         if (start_from < 0) {
@@ -291,7 +290,7 @@ RUNTIME_FUNCTION(Runtime_ArrayIncludes_Slow) {
 
   // If the receiver is not a special receiver type, and the length is a valid
   // element index, perform fast operation tailored to specific ElementsKinds.
-  if (!object->map().IsSpecialReceiverMap() &&
+  if (!IsSpecialReceiverMap(object->map()) &&
       len <= JSObject::kMaxElementCount &&
       JSObject::PrototypeHasNoElements(isolate, JSObject::cast(*object))) {
     Handle<JSObject> obj = Handle<JSObject>::cast(object);
@@ -316,7 +315,7 @@ RUNTIME_FUNCTION(Runtime_ArrayIncludes_Slow) {
     }
 
     // If SameValueZero(searchElement, elementK) is true, return true.
-    if (search_element->SameValueZero(*element_k)) {
+    if (Object::SameValueZero(*search_element, *element_k)) {
       return ReadOnlyRoots(isolate).true_value();
     }
   }
@@ -338,9 +337,10 @@ RUNTIME_FUNCTION(Runtime_ArrayIndexOf) {
   // Let len be ? ToLength(? Get(O, "length")).
   int64_t len;
   {
-    if (object->IsJSArray()) {
+    if (IsJSArray(*object)) {
       uint32_t len32 = 0;
-      bool success = JSArray::cast(*object).length().ToArrayLength(&len32);
+      bool success =
+          Object::ToArrayLength(JSArray::cast(*object)->length(), &len32);
       DCHECK(success);
       USE(success);
       len = len32;
@@ -353,8 +353,8 @@ RUNTIME_FUNCTION(Runtime_ArrayIndexOf) {
 
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, len_,
                                          Object::ToLength(isolate, len_));
-      len = static_cast<int64_t>(len_->Number());
-      DCHECK_EQ(len, len_->Number());
+      len = static_cast<int64_t>(Object::Number(*len_));
+      DCHECK_EQ(len, Object::Number(*len_));
     }
   }
 
@@ -366,7 +366,7 @@ RUNTIME_FUNCTION(Runtime_ArrayIndexOf) {
   {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, from_index,
                                        Object::ToInteger(isolate, from_index));
-    double fp = from_index->Number();
+    double fp = Object::Number(*from_index);
     if (fp > len) return Smi::FromInt(-1);
     if (V8_LIKELY(fp >=
                   static_cast<double>(std::numeric_limits<int64_t>::min()))) {
@@ -389,7 +389,7 @@ RUNTIME_FUNCTION(Runtime_ArrayIndexOf) {
 
   // If the receiver is not a special receiver type, and the length fits
   // uint32_t, perform fast operation tailored to specific ElementsKinds.
-  if (!object->map().IsSpecialReceiverMap() && len <= kMaxUInt32 &&
+  if (!IsSpecialReceiverMap(object->map()) && len <= kMaxUInt32 &&
       JSObject::PrototypeHasNoElements(isolate, JSObject::cast(*object))) {
     Handle<JSObject> obj = Handle<JSObject>::cast(object);
     ElementsAccessor* elements = obj->GetElementsAccessor();
@@ -413,7 +413,7 @@ RUNTIME_FUNCTION(Runtime_ArrayIndexOf) {
       if (!present.FromJust()) continue;
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, element_k,
                                          Object::GetProperty(&it));
-      if (search_element->StrictEquals(*element_k)) {
+      if (Object::StrictEquals(*search_element, *element_k)) {
         return *isolate->factory()->NewNumberFromInt64(index);
       }
     }
diff --git a/deps/v8/src/runtime/runtime-atomics.cc b/deps/v8/src/runtime/runtime-atomics.cc
index d2b371efb31f71..e72f6ef3bf17dd 100644
--- a/deps/v8/src/runtime/runtime-atomics.cc
+++ b/deps/v8/src/runtime/runtime-atomics.cc
@@ -629,6 +629,36 @@ RUNTIME_FUNCTION(Runtime_AtomicsLoadSharedStructOrArray) {
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
+namespace {
+
+template <typename WriteOperation>
+Object AtomicFieldWrite(Isolate* isolate, Handle<JSObject> object,
+                        Handle<Name> field_name, Handle<Object> value,
+                        WriteOperation write_operation) {
+  LookupIterator it(isolate, object, PropertyKey(isolate, field_name),
+                    LookupIterator::OWN);
+  Maybe<bool> result = Nothing<bool>();
+  if (it.IsFound()) {
+    if (!it.IsReadOnly()) {
+      return write_operation(it);
+    }
+    // Shared structs and arrays are non-extensible and have non-configurable,
+    // writable, enumerable properties. The only exception is SharedArrays'
+    // "length" property, which is non-writable.
+    result = Object::WriteToReadOnlyProperty(&it, value, Just(kThrowOnError));
+  } else {
+    // Shared structs are non-extensible. Instead of duplicating logic, call
+    // Object::AddDataProperty to handle the error case.
+    result = Object::AddDataProperty(&it, value, NONE, Just(kThrowOnError),
+                                     StoreOrigin::kMaybeKeyed);
+  }
+  // Treat as strict code and always throw an error.
+  DCHECK(result.IsNothing());
+  USE(result);
+  return ReadOnlyRoots(isolate).exception();
+}
+}  // namespace
+
 RUNTIME_FUNCTION(Runtime_AtomicsStoreSharedStructOrArray) {
   HandleScope scope(isolate);
   DCHECK_EQ(3, args.length());
@@ -639,21 +669,12 @@ RUNTIME_FUNCTION(Runtime_AtomicsStoreSharedStructOrArray) {
   Handle<Object> shared_value;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, shared_value, Object::Share(isolate, args.at(2), kThrowOnError));
-  // Shared structs are prototypeless.
-  LookupIterator it(isolate, shared_struct_or_shared_array,
-                    PropertyKey(isolate, field_name), LookupIterator::OWN);
-  if (it.IsFound()) {
-    it.WriteDataValue(shared_value, kSeqCstAccess);
-    return *shared_value;
-  }
-  // Shared structs are non-extensible. Instead of duplicating logic, call
-  // Object::AddDataProperty to handle the error case.
-  Maybe<bool> result =
-      Object::AddDataProperty(&it, shared_value, NONE, Nothing<ShouldThrow>(),
-                              StoreOrigin::kMaybeKeyed);
-  DCHECK(result.IsNothing());
-  USE(result);
-  return ReadOnlyRoots(isolate).exception();
+
+  return AtomicFieldWrite(isolate, shared_struct_or_shared_array, field_name,
+                          shared_value, [=](LookupIterator it) {
+                            it.WriteDataValue(shared_value, kSeqCstAccess);
+                            return *shared_value;
+                          });
 }
 
 RUNTIME_FUNCTION(Runtime_AtomicsExchangeSharedStructOrArray) {
@@ -666,18 +687,35 @@ RUNTIME_FUNCTION(Runtime_AtomicsExchangeSharedStructOrArray) {
   Handle<Object> shared_value;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, shared_value, Object::Share(isolate, args.at(2), kThrowOnError));
-  // Shared structs are prototypeless.
-  LookupIterator it(isolate, shared_struct_or_shared_array,
-                    PropertyKey(isolate, field_name), LookupIterator::OWN);
-  if (it.IsFound()) return *it.SwapDataValue(shared_value, kSeqCstAccess);
-  // Shared structs are non-extensible. Instead of duplicating logic, call
-  // Object::AddDataProperty to handle the error case.
-  Maybe<bool> result =
-      Object::AddDataProperty(&it, shared_value, NONE, Nothing<ShouldThrow>(),
-                              StoreOrigin::kMaybeKeyed);
-  DCHECK(result.IsNothing());
-  USE(result);
-  return ReadOnlyRoots(isolate).exception();
+
+  return AtomicFieldWrite(isolate, shared_struct_or_shared_array, field_name,
+                          shared_value, [=](LookupIterator it) {
+                            return *it.SwapDataValue(shared_value,
+                                                     kSeqCstAccess);
+                          });
 }
+
+RUNTIME_FUNCTION(Runtime_AtomicsCompareExchangeSharedStructOrArray) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(4, args.length());
+  Handle<JSObject> shared_struct_or_shared_array = args.at<JSObject>(0);
+  Handle<Name> field_name;
+  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, field_name,
+                                     Object::ToName(isolate, args.at(1)));
+  Handle<Object> shared_expected;
+  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
+      isolate, shared_expected,
+      Object::Share(isolate, args.at(2), kThrowOnError));
+  Handle<Object> shared_value;
+  ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
+      isolate, shared_value, Object::Share(isolate, args.at(3), kThrowOnError));
+
+  return AtomicFieldWrite(isolate, shared_struct_or_shared_array, field_name,
+                          shared_value, [=](LookupIterator it) {
+                            return *it.CompareAndSwapDataValue(
+                                shared_expected, shared_value, kSeqCstAccess);
+                          });
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/runtime/runtime-bigint.cc b/deps/v8/src/runtime/runtime-bigint.cc
index f64d9e5b1a2e42..3a34ec3a01dce0 100644
--- a/deps/v8/src/runtime/runtime-bigint.cc
+++ b/deps/v8/src/runtime/runtime-bigint.cc
@@ -99,14 +99,14 @@ RUNTIME_FUNCTION(Runtime_ToBigIntConvertNumber) {
   DCHECK_EQ(1, args.length());
   Handle<Object> x = args.at(0);
 
-  if (x->IsJSReceiver()) {
+  if (IsJSReceiver(*x)) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
         isolate, x,
         JSReceiver::ToPrimitive(isolate, Handle<JSReceiver>::cast(x),
                                 ToPrimitiveHint::kNumber));
   }
 
-  if (x->IsNumber()) {
+  if (IsNumber(*x)) {
     RETURN_RESULT_OR_FAILURE(isolate, BigInt::FromNumber(isolate, x));
   } else {
     RETURN_RESULT_OR_FAILURE(isolate, BigInt::FromObject(isolate, x));
@@ -121,7 +121,7 @@ RUNTIME_FUNCTION(Runtime_BigIntBinaryOp) {
   int opcode = args.smi_value_at(2);
   Operation op = static_cast<Operation>(opcode);
 
-  if (!left_obj->IsBigInt() || !right_obj->IsBigInt()) {
+  if (!IsBigInt(*left_obj) || !IsBigInt(*right_obj)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kBigIntMixedTypes));
   }
diff --git a/deps/v8/src/runtime/runtime-classes.cc b/deps/v8/src/runtime/runtime-classes.cc
index f52cf3a6bd1398..4154730f9fa8ae 100644
--- a/deps/v8/src/runtime/runtime-classes.cc
+++ b/deps/v8/src/runtime/runtime-classes.cc
@@ -34,10 +34,10 @@ RUNTIME_FUNCTION(Runtime_ThrowConstructorNonCallableError) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSFunction> constructor = args.at<JSFunction>(0);
-  Handle<String> name(constructor->shared().Name(), isolate);
+  Handle<String> name(constructor->shared()->Name(), isolate);
 
   Handle<Context> context = handle(constructor->native_context(), isolate);
-  DCHECK(context->IsNativeContext());
+  DCHECK(IsNativeContext(*context));
   Handle<JSFunction> realm_type_error_function(
       JSFunction::cast(context->get(Context::TYPE_ERROR_FUNCTION_INDEX)),
       isolate);
@@ -78,11 +78,11 @@ namespace {
 Object ThrowNotSuperConstructor(Isolate* isolate, Handle<Object> constructor,
                                 Handle<JSFunction> function) {
   Handle<String> super_name;
-  if (constructor->IsJSFunction()) {
-    super_name =
-        handle(Handle<JSFunction>::cast(constructor)->shared().Name(), isolate);
-  } else if (constructor->IsOddball()) {
-    DCHECK(constructor->IsNull(isolate));
+  if (IsJSFunction(*constructor)) {
+    super_name = handle(Handle<JSFunction>::cast(constructor)->shared()->Name(),
+                        isolate);
+  } else if (IsOddball(*constructor)) {
+    DCHECK(IsNull(*constructor, isolate));
     super_name = isolate->factory()->null_string();
   } else {
     super_name = Object::NoSideEffectsToString(isolate, constructor);
@@ -91,7 +91,7 @@ Object ThrowNotSuperConstructor(Isolate* isolate, Handle<Object> constructor,
   if (super_name->length() == 0) {
     super_name = isolate->factory()->null_string();
   }
-  Handle<String> function_name(function->shared().Name(), isolate);
+  Handle<String> function_name(function->shared()->Name(), isolate);
   // anonymous class
   if (function_name->length() == 0) {
     THROW_NEW_ERROR_RETURN_FAILURE(
@@ -120,13 +120,13 @@ template <typename Dictionary>
 Handle<Name> KeyToName(Isolate* isolate, Handle<Object> key) {
   static_assert((std::is_same<Dictionary, SwissNameDictionary>::value ||
                  std::is_same<Dictionary, NameDictionary>::value));
-  DCHECK(key->IsName());
+  DCHECK(IsName(*key));
   return Handle<Name>::cast(key);
 }
 
 template <>
 Handle<Name> KeyToName<NumberDictionary>(Isolate* isolate, Handle<Object> key) {
-  DCHECK(key->IsNumber());
+  DCHECK(IsNumber(*key));
   return isolate->factory()->NumberToString(key);
 }
 
@@ -150,7 +150,7 @@ MaybeHandle<Object> GetMethodAndSetName(Isolate* isolate,
 
   Handle<JSFunction> method = args.at<JSFunction>(int_index);
 
-  if (!method->shared().HasSharedName()) {
+  if (!method->shared()->HasSharedName()) {
     // TODO(ishell): method does not have a shared name at this point only if
     // the key is a computed property name. However, the bytecode generator
     // explicitly generates ToName bytecodes to ensure that the computed
@@ -180,7 +180,7 @@ Object GetMethodWithSharedName(Isolate* isolate, RuntimeArguments& args,
   }
 
   Handle<JSFunction> method = args.at<JSFunction>(int_index);
-  DCHECK(method->shared().HasSharedName());
+  DCHECK(method->shared()->HasSharedName());
   return *method;
 }
 
@@ -192,7 +192,7 @@ Handle<Dictionary> ShallowCopyDictionaryTemplate(
   // Clone all AccessorPairs in the dictionary.
   for (InternalIndex i : dictionary->IterateEntries()) {
     Object value = dictionary->ValueAt(i);
-    if (value.IsAccessorPair()) {
+    if (IsAccessorPair(value)) {
       Handle<AccessorPair> pair(AccessorPair::cast(value), isolate);
       pair = AccessorPair::Copy(isolate, pair);
       dictionary->ValueAtPut(i, *pair);
@@ -211,10 +211,10 @@ bool SubstituteValues(Isolate* isolate, Handle<Dictionary> dictionary,
     if (!Dictionary::IsKey(roots, maybe_key)) continue;
     Handle<Object> key(maybe_key, isolate);
     Handle<Object> value(dictionary->ValueAt(i), isolate);
-    if (value->IsAccessorPair()) {
+    if (IsAccessorPair(*value)) {
       Handle<AccessorPair> pair = Handle<AccessorPair>::cast(value);
       Object tmp = pair->getter();
-      if (tmp.IsSmi()) {
+      if (IsSmi(tmp)) {
         Handle<Object> result;
         ASSIGN_RETURN_ON_EXCEPTION_VALUE(
             isolate, result,
@@ -225,7 +225,7 @@ bool SubstituteValues(Isolate* isolate, Handle<Dictionary> dictionary,
         pair->set_getter(*result);
       }
       tmp = pair->setter();
-      if (tmp.IsSmi()) {
+      if (IsSmi(tmp)) {
         Handle<Object> result;
         ASSIGN_RETURN_ON_EXCEPTION_VALUE(
             isolate, result,
@@ -235,7 +235,7 @@ bool SubstituteValues(Isolate* isolate, Handle<Dictionary> dictionary,
             false);
         pair->set_setter(*result);
       }
-    } else if (value->IsSmi()) {
+    } else if (IsSmi(*value)) {
       Handle<Object> result;
       ASSIGN_RETURN_ON_EXCEPTION_VALUE(
           isolate, result,
@@ -305,40 +305,45 @@ bool AddDescriptorsByTemplate(
   int field_index = 0;
   for (InternalIndex i : InternalIndex::Range(nof_descriptors)) {
     Object value = descriptors_template->GetStrongValue(i);
-    if (value.IsAccessorPair()) {
+    if (IsAccessorPair(value)) {
       Handle<AccessorPair> pair = AccessorPair::Copy(
           isolate, handle(AccessorPair::cast(value), isolate));
       value = *pair;
     }
     DisallowGarbageCollection no_gc;
     Name name = descriptors_template->GetKey(i);
-    DCHECK(name.IsUniqueName());
+    // TODO(v8:5799): consider adding a ClassBoilerplate flag
+    // "has_interesting_properties".
+    if (name->IsInteresting(isolate)) {
+      map->set_may_have_interesting_properties(true);
+    }
+    DCHECK(IsUniqueName(name));
     PropertyDetails details = descriptors_template->GetDetails(i);
     if (details.location() == PropertyLocation::kDescriptor) {
       if (details.kind() == PropertyKind::kData) {
-        if (value.IsSmi()) {
+        if (IsSmi(value)) {
           value = GetMethodWithSharedName(isolate, args, value);
         }
         details = details.CopyWithRepresentation(
-            value.OptimalRepresentation(isolate));
+            Object::OptimalRepresentation(value, isolate));
       } else {
         DCHECK_EQ(PropertyKind::kAccessor, details.kind());
-        if (value.IsAccessorPair()) {
+        if (IsAccessorPair(value)) {
           AccessorPair pair = AccessorPair::cast(value);
-          Object tmp = pair.getter();
-          if (tmp.IsSmi()) {
-            pair.set_getter(GetMethodWithSharedName(isolate, args, tmp));
+          Object tmp = pair->getter();
+          if (IsSmi(tmp)) {
+            pair->set_getter(GetMethodWithSharedName(isolate, args, tmp));
           }
-          tmp = pair.setter();
-          if (tmp.IsSmi()) {
-            pair.set_setter(GetMethodWithSharedName(isolate, args, tmp));
+          tmp = pair->setter();
+          if (IsSmi(tmp)) {
+            pair->set_setter(GetMethodWithSharedName(isolate, args, tmp));
           }
         }
       }
     } else {
       UNREACHABLE();
     }
-    DCHECK(value.FitsRepresentation(details.representation()));
+    DCHECK(Object::FitsRepresentation(value, details.representation()));
     if (details.location() == PropertyLocation::kDescriptor &&
         details.kind() == PropertyKind::kData) {
       details =
@@ -420,7 +425,7 @@ bool AddDescriptorsByTemplate(
     Smi value = Smi::FromInt(key_index + 1);  // Value follows name.
 
     Handle<Object> key = args.at(key_index);
-    DCHECK(key->IsName());
+    DCHECK(IsName(*key));
     uint32_t element;
     Handle<Name> name = Handle<Name>::cast(key);
     if (name->AsArrayIndex(&element)) {
@@ -431,10 +436,10 @@ bool AddDescriptorsByTemplate(
       name = isolate->factory()->InternalizeName(name);
       ClassBoilerplate::AddToPropertiesTemplate(
           isolate, properties_dictionary, name, key_index, value_kind, value);
-      if (name->IsInterestingSymbol()) {
+      if (name->IsInteresting(isolate)) {
         // TODO(pthier): Add flags to swiss dictionaries.
         if constexpr (!V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-          properties_dictionary->set_may_have_interesting_symbols(true);
+          properties_dictionary->set_may_have_interesting_properties(true);
         }
       }
     }
@@ -496,7 +501,7 @@ bool InitClassPrototype(Isolate* isolate,
   Handle<Object> properties_template(
       class_boilerplate->instance_properties_template(), isolate);
 
-  if (properties_template->IsDescriptorArray()) {
+  if (IsDescriptorArray(*properties_template)) {
     Handle<DescriptorArray> descriptors_template =
         Handle<DescriptorArray>::cast(properties_template);
 
@@ -509,7 +514,7 @@ bool InitClassPrototype(Isolate* isolate,
   } else {
     map->set_is_dictionary_map(true);
     map->set_is_migration_target(false);
-    map->set_may_have_interesting_symbols(true);
+    map->set_may_have_interesting_properties(true);
     map->set_construction_counter(Map::kNoSlackTracking);
 
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -554,7 +559,7 @@ bool InitClassConstructor(Isolate* isolate,
   Handle<Object> properties_template(
       class_boilerplate->static_properties_template(), isolate);
 
-  if (properties_template->IsDescriptorArray()) {
+  if (IsDescriptorArray(*properties_template)) {
     Handle<DescriptorArray> descriptors_template =
         Handle<DescriptorArray>::cast(properties_template);
 
@@ -566,7 +571,7 @@ bool InitClassConstructor(Isolate* isolate,
     map->InitializeDescriptors(isolate,
                                ReadOnlyRoots(isolate).empty_descriptor_array());
     map->set_is_migration_target(false);
-    map->set_may_have_interesting_symbols(true);
+    map->set_may_have_interesting_properties(true);
     map->set_construction_counter(Map::kNoSlackTracking);
 
     if constexpr (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
@@ -594,22 +599,22 @@ MaybeHandle<Object> DefineClass(Isolate* isolate,
   Handle<Object> prototype_parent;
   Handle<HeapObject> constructor_parent;
 
-  if (super_class->IsTheHole(isolate)) {
+  if (IsTheHole(*super_class, isolate)) {
     prototype_parent = isolate->initial_object_prototype();
   } else {
-    if (super_class->IsNull(isolate)) {
+    if (IsNull(*super_class, isolate)) {
       prototype_parent = isolate->factory()->null_value();
-    } else if (super_class->IsConstructor()) {
-      DCHECK(!super_class->IsJSFunction() ||
+    } else if (IsConstructor(*super_class)) {
+      DCHECK(!IsJSFunction(*super_class) ||
              !IsResumableFunction(
-                 Handle<JSFunction>::cast(super_class)->shared().kind()));
+                 Handle<JSFunction>::cast(super_class)->shared()->kind()));
       ASSIGN_RETURN_ON_EXCEPTION(
           isolate, prototype_parent,
           Runtime::GetObjectProperty(isolate, super_class,
                                      isolate->factory()->prototype_string()),
           Object);
-      if (!prototype_parent->IsNull(isolate) &&
-          !prototype_parent->IsJSReceiver()) {
+      if (!IsNull(*prototype_parent, isolate) &&
+          !IsJSReceiver(*prototype_parent)) {
         THROW_NEW_ERROR(
             isolate, NewTypeError(MessageTemplate::kPrototypeParentNotAnObject,
                                   prototype_parent),
@@ -681,15 +686,16 @@ enum class SuperMode { kLoad, kStore };
 MaybeHandle<JSReceiver> GetSuperHolder(Isolate* isolate,
                                        Handle<JSObject> home_object,
                                        SuperMode mode, PropertyKey* key) {
-  if (home_object->IsAccessCheckNeeded() &&
-      !isolate->MayAccess(handle(isolate->context(), isolate), home_object)) {
-    isolate->ReportFailedAccessCheck(home_object);
-    RETURN_EXCEPTION_IF_SCHEDULED_EXCEPTION(isolate, JSReceiver);
+  if (IsAccessCheckNeeded(*home_object) &&
+      !isolate->MayAccess(isolate->native_context(), home_object)) {
+    RETURN_ON_EXCEPTION(isolate, isolate->ReportFailedAccessCheck(home_object),
+                        JSReceiver);
+    UNREACHABLE();
   }
 
   PrototypeIterator iter(isolate, home_object);
   Handle<Object> proto = PrototypeIterator::GetCurrent(iter);
-  if (!proto->IsJSReceiver()) {
+  if (!IsJSReceiver(*proto)) {
     MessageTemplate message =
         mode == SuperMode::kLoad
             ? MessageTemplate::kNonObjectPropertyLoadWithProperty
diff --git a/deps/v8/src/runtime/runtime-collections.cc b/deps/v8/src/runtime/runtime-collections.cc
index a326efaa5e7505..aebb8a3ac6e866 100644
--- a/deps/v8/src/runtime/runtime-collections.cc
+++ b/deps/v8/src/runtime/runtime-collections.cc
@@ -17,13 +17,27 @@ RUNTIME_FUNCTION(Runtime_TheHole) {
   return ReadOnlyRoots(isolate).the_hole_value();
 }
 
+RUNTIME_FUNCTION(Runtime_OrderedHashSetGrow) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(2, args.length());
+  Handle<OrderedHashSet> table = args.at<OrderedHashSet>(0);
+  Handle<String> method_name = args.at<String>(1);
+  MaybeHandle<OrderedHashSet> table_candidate =
+      OrderedHashSet::EnsureCapacityForAdding(isolate, table);
+  if (!table_candidate.ToHandle(&table)) {
+    THROW_NEW_ERROR_RETURN_FAILURE(
+        isolate, NewRangeError(MessageTemplate::kOutOfMemory, method_name));
+  }
+  return *table;
+}
+
 RUNTIME_FUNCTION(Runtime_SetGrow) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSSet> holder = args.at<JSSet>(0);
   Handle<OrderedHashSet> table(OrderedHashSet::cast(holder->table()), isolate);
   MaybeHandle<OrderedHashSet> table_candidate =
-      OrderedHashSet::EnsureGrowable(isolate, table);
+      OrderedHashSet::EnsureCapacityForAdding(isolate, table);
   if (!table_candidate.ToHandle(&table)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
@@ -44,6 +58,14 @@ RUNTIME_FUNCTION(Runtime_SetShrink) {
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
+RUNTIME_FUNCTION(Runtime_OrderedHashSetShrink) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(1, args.length());
+  Handle<OrderedHashSet> table = args.at<OrderedHashSet>(0);
+  table = OrderedHashSet::Shrink(isolate, table);
+  return *table;
+}
+
 RUNTIME_FUNCTION(Runtime_MapShrink) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
@@ -60,7 +82,7 @@ RUNTIME_FUNCTION(Runtime_MapGrow) {
   Handle<JSMap> holder = args.at<JSMap>(0);
   Handle<OrderedHashMap> table(OrderedHashMap::cast(holder->table()), isolate);
   MaybeHandle<OrderedHashMap> table_candidate =
-      OrderedHashMap::EnsureGrowable(isolate, table);
+      OrderedHashMap::EnsureCapacityForAdding(isolate, table);
   if (!table_candidate.ToHandle(&table)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
@@ -71,6 +93,20 @@ RUNTIME_FUNCTION(Runtime_MapGrow) {
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
+RUNTIME_FUNCTION(Runtime_OrderedHashMapGrow) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(2, args.length());
+  Handle<OrderedHashMap> table = args.at<OrderedHashMap>(0);
+  Handle<String> methodName = args.at<String>(1);
+  MaybeHandle<OrderedHashMap> table_candidate =
+      OrderedHashMap::EnsureCapacityForAdding(isolate, table);
+  if (!table_candidate.ToHandle(&table)) {
+    THROW_NEW_ERROR_RETURN_FAILURE(
+        isolate, NewRangeError(MessageTemplate::kOutOfMemory, methodName));
+  }
+  return *table;
+}
+
 RUNTIME_FUNCTION(Runtime_WeakCollectionDelete) {
   HandleScope scope(isolate);
   DCHECK_EQ(3, args.length());
@@ -79,7 +115,7 @@ RUNTIME_FUNCTION(Runtime_WeakCollectionDelete) {
   int hash = args.smi_value_at(2);
 
 #ifdef DEBUG
-  DCHECK(key->CanBeHeldWeakly());
+  DCHECK(Object::CanBeHeldWeakly(*key));
   DCHECK(EphemeronHashTable::IsKey(ReadOnlyRoots(isolate), *key));
   Handle<EphemeronHashTable> table(
       EphemeronHashTable::cast(weak_collection->table()), isolate);
@@ -102,7 +138,7 @@ RUNTIME_FUNCTION(Runtime_WeakCollectionSet) {
   int hash = args.smi_value_at(3);
 
 #ifdef DEBUG
-  DCHECK(key->CanBeHeldWeakly());
+  DCHECK(Object::CanBeHeldWeakly(*key));
   DCHECK(EphemeronHashTable::IsKey(ReadOnlyRoots(isolate), *key));
   Handle<EphemeronHashTable> table(
       EphemeronHashTable::cast(weak_collection->table()), isolate);
diff --git a/deps/v8/src/runtime/runtime-compiler.cc b/deps/v8/src/runtime/runtime-compiler.cc
index 591f5c8d9d5b91..f2d3fb50582a70 100644
--- a/deps/v8/src/runtime/runtime-compiler.cc
+++ b/deps/v8/src/runtime/runtime-compiler.cc
@@ -23,22 +23,22 @@ namespace {
 void LogExecution(Isolate* isolate, Handle<JSFunction> function) {
   DCHECK(v8_flags.log_function_events);
   if (!function->has_feedback_vector()) return;
-  if (!function->feedback_vector().log_next_execution()) return;
+  if (!function->feedback_vector()->log_next_execution()) return;
   Handle<SharedFunctionInfo> sfi(function->shared(), isolate);
   Handle<String> name = SharedFunctionInfo::DebugName(isolate, sfi);
   DisallowGarbageCollection no_gc;
-  auto raw_sfi = *sfi;
+  Tagged<SharedFunctionInfo> raw_sfi = *sfi;
   std::string event_name = "first-execution";
-  CodeKind kind = function->abstract_code(isolate).kind(isolate);
+  CodeKind kind = function->abstract_code(isolate)->kind(isolate);
   // Not adding "-interpreter" for tooling backwards compatiblity.
   if (kind != CodeKind::INTERPRETED_FUNCTION) {
     event_name += "-";
     event_name += CodeKindToString(kind);
   }
-  LOG(isolate,
-      FunctionEvent(event_name.c_str(), Script::cast(raw_sfi.script()).id(), 0,
-                    raw_sfi.StartPosition(), raw_sfi.EndPosition(), *name));
-  function->feedback_vector().set_log_next_execution(false);
+  LOG(isolate, FunctionEvent(
+                   event_name.c_str(), Script::cast(raw_sfi->script())->id(), 0,
+                   raw_sfi->StartPosition(), raw_sfi->EndPosition(), *name));
+  function->feedback_vector()->set_log_next_execution(false);
 }
 }  // namespace
 
@@ -85,7 +85,7 @@ RUNTIME_FUNCTION(Runtime_InstallBaselineCode) {
                                             &is_compiled_scope);
   {
     DisallowGarbageCollection no_gc;
-    Code baseline_code = sfi->baseline_code(kAcquireLoad);
+    Tagged<Code> baseline_code = sfi->baseline_code(kAcquireLoad);
     function->set_code(baseline_code);
     if V8_LIKELY (!v8_flags.log_function_events) return baseline_code;
   }
@@ -160,28 +160,35 @@ RUNTIME_FUNCTION(Runtime_HealOptimizedCodeSlot) {
   DCHECK_EQ(1, args.length());
   Handle<JSFunction> function = args.at<JSFunction>(0);
 
-  DCHECK(function->shared().is_compiled());
+  DCHECK(function->shared()->is_compiled());
 
-  function->feedback_vector().EvictOptimizedCodeMarkedForDeoptimization(
+  function->feedback_vector()->EvictOptimizedCodeMarkedForDeoptimization(
       isolate, function->shared(), "Runtime_HealOptimizedCodeSlot");
   return function->code();
 }
 
+// The enum values need to match "AsmJsInstantiateResult" in
+// tools/metrics/histograms/enums.xml.
+enum AsmJsInstantiateResult {
+  kAsmJsInstantiateSuccess = 0,
+  kAsmJsInstantiateFail = 1,
+};
+
 RUNTIME_FUNCTION(Runtime_InstantiateAsmJs) {
   HandleScope scope(isolate);
   DCHECK_EQ(args.length(), 4);
   Handle<JSFunction> function = args.at<JSFunction>(0);
 
   Handle<JSReceiver> stdlib;
-  if (args[1].IsJSReceiver()) {
+  if (IsJSReceiver(args[1])) {
     stdlib = args.at<JSReceiver>(1);
   }
   Handle<JSReceiver> foreign;
-  if (args[2].IsJSReceiver()) {
+  if (IsJSReceiver(args[2])) {
     foreign = args.at<JSReceiver>(2);
   }
   Handle<JSArrayBuffer> memory;
-  if (args[3].IsJSArrayBuffer()) {
+  if (IsJSArrayBuffer(args[3])) {
     memory = args.at<JSArrayBuffer>(3);
   }
   Handle<SharedFunctionInfo> shared(function->shared(), isolate);
@@ -190,7 +197,14 @@ RUNTIME_FUNCTION(Runtime_InstantiateAsmJs) {
     Handle<AsmWasmData> data(shared->asm_wasm_data(), isolate);
     MaybeHandle<Object> result = AsmJs::InstantiateAsmWasm(
         isolate, shared, data, stdlib, foreign, memory);
-    if (!result.is_null()) return *result.ToHandleChecked();
+    if (!result.is_null()) {
+      isolate->counters()->asmjs_instantiate_result()->AddSample(
+          kAsmJsInstantiateSuccess);
+      return *result.ToHandleChecked();
+    }
+    isolate->counters()->asmjs_instantiate_result()->AddSample(
+        kAsmJsInstantiateFail);
+
     // Remove wasm data, mark as broken for asm->wasm, replace function code
     // with UncompiledData, and return a smi 0 to indicate failure.
     SharedFunctionInfo::DiscardCompiled(isolate, shared);
@@ -205,55 +219,11 @@ RUNTIME_FUNCTION(Runtime_InstantiateAsmJs) {
 
 namespace {
 
-// Whether the deopt exit is contained by the outermost loop containing the
-// osr'd loop. For example:
-//
-//  for (;;) {
-//    for (;;) {
-//    }  // OSR is triggered on this backedge.
-//  }  // This is the outermost loop containing the osr'd loop.
-bool DeoptExitIsInsideOsrLoop(Isolate* isolate, JSFunction function,
-                              BytecodeOffset deopt_exit_offset,
-                              BytecodeOffset osr_offset) {
-  DisallowGarbageCollection no_gc;
-  DCHECK(!deopt_exit_offset.IsNone());
-  DCHECK(!osr_offset.IsNone());
-
-  Handle<BytecodeArray> bytecode_array(
-      function.shared().GetBytecodeArray(isolate), isolate);
-  DCHECK(interpreter::BytecodeArrayIterator::IsValidOffset(
-      bytecode_array, deopt_exit_offset.ToInt()));
-
-  interpreter::BytecodeArrayIterator it(bytecode_array, osr_offset.ToInt());
-  DCHECK_EQ(it.current_bytecode(), interpreter::Bytecode::kJumpLoop);
-
-  for (; !it.done(); it.Advance()) {
-    const int current_offset = it.current_offset();
-    // If we've reached the deopt exit, it's contained in the current loop
-    // (this is covered by IsInRange below, but this check lets us avoid
-    // useless iteration).
-    if (current_offset == deopt_exit_offset.ToInt()) return true;
-    // We're only interested in loop ranges.
-    if (it.current_bytecode() != interpreter::Bytecode::kJumpLoop) continue;
-    // Is the deopt exit contained in the current loop?
-    if (base::IsInRange(deopt_exit_offset.ToInt(), it.GetJumpTargetOffset(),
-                        current_offset)) {
-      return true;
-    }
-    // We've reached nesting level 0, i.e. the current JumpLoop concludes a
-    // top-level loop.
-    const int loop_nesting_level = it.GetImmediateOperand(1);
-    if (loop_nesting_level == 0) return false;
-  }
-
-  UNREACHABLE();
-}
-
-bool TryGetOptimizedOsrCode(Isolate* isolate, FeedbackVector vector,
+bool TryGetOptimizedOsrCode(Isolate* isolate, Tagged<FeedbackVector> vector,
                             const interpreter::BytecodeArrayIterator& it,
-                            Code* code_out) {
-  base::Optional<Code> maybe_code =
-      vector.GetOptimizedOsrCode(isolate, it.GetSlotOperand(2));
+                            Tagged<Code>* code_out) {
+  base::Optional<Tagged<Code>> maybe_code =
+      vector->GetOptimizedOsrCode(isolate, it.GetSlotOperand(2));
   if (maybe_code.has_value()) {
     *code_out = maybe_code.value();
     return true;
@@ -272,25 +242,26 @@ bool TryGetOptimizedOsrCode(Isolate* isolate, FeedbackVector vector,
 //      }  // Type b: deopt exit < loop start < OSR backedge
 //    } // Type c: loop start < deopt exit < OSR backedge
 //  }  // The outermost loop
-void DeoptAllOsrLoopsContainingDeoptExit(Isolate* isolate, JSFunction function,
+void DeoptAllOsrLoopsContainingDeoptExit(Isolate* isolate,
+                                         Tagged<JSFunction> function,
                                          BytecodeOffset deopt_exit_offset) {
   DisallowGarbageCollection no_gc;
   DCHECK(!deopt_exit_offset.IsNone());
 
   if (!v8_flags.use_ic ||
-      !function.feedback_vector().maybe_has_optimized_osr_code()) {
+      !function->feedback_vector()->maybe_has_optimized_osr_code()) {
     return;
   }
   Handle<BytecodeArray> bytecode_array(
-      function.shared().GetBytecodeArray(isolate), isolate);
+      function->shared()->GetBytecodeArray(isolate), isolate);
   DCHECK(interpreter::BytecodeArrayIterator::IsValidOffset(
       bytecode_array, deopt_exit_offset.ToInt()));
 
   interpreter::BytecodeArrayIterator it(bytecode_array,
                                         deopt_exit_offset.ToInt());
 
-  FeedbackVector vector = function.feedback_vector();
-  Code code;
+  Tagged<FeedbackVector> vector = function->feedback_vector();
+  Tagged<Code> code;
   base::SmallVector<Code, 8> osr_codes;
   // Visit before the first loop-with-deopt is found
   for (; !it.done(); it.Advance()) {
@@ -417,8 +388,9 @@ RUNTIME_FUNCTION(Runtime_NotifyDeoptimized) {
   if (osr_offset.IsNone()) {
     Deoptimizer::DeoptimizeFunction(*function, *optimized_code);
     DeoptAllOsrLoopsContainingDeoptExit(isolate, *function, deopt_exit_offset);
-  } else if (DeoptExitIsInsideOsrLoop(isolate, *function, deopt_exit_offset,
-                                      osr_offset)) {
+  } else if (deopt_reason != DeoptimizeReason::kOSREarlyExit &&
+             Deoptimizer::DeoptExitIsInsideOsrLoop(
+                 isolate, *function, deopt_exit_offset, osr_offset)) {
     Deoptimizer::DeoptimizeFunction(*function, *optimized_code);
   }
 
@@ -461,19 +433,21 @@ void GetOsrOffsetAndFunctionForOSR(Isolate* isolate, BytecodeOffset* osr_offset,
   JavaScriptStackFrameIterator it(isolate);
   UnoptimizedFrame* frame = UnoptimizedFrame::cast(it.frame());
   DCHECK_IMPLIES(frame->is_interpreted(),
-                 frame->LookupCode().is_interpreter_trampoline_builtin());
+                 frame->LookupCode()->is_interpreter_trampoline_builtin());
   DCHECK_IMPLIES(frame->is_baseline(),
-                 frame->LookupCode().kind() == CodeKind::BASELINE);
+                 frame->LookupCode()->kind() == CodeKind::BASELINE);
 
   *osr_offset = BytecodeOffset(frame->GetBytecodeOffset());
   *function = handle(frame->function(), isolate);
 
   DCHECK(!osr_offset->IsNone());
-  DCHECK((*function)->shared().HasBytecodeArray());
+  DCHECK((*function)->shared()->HasBytecodeArray());
 }
 
-Object CompileOptimizedOSR(Isolate* isolate, Handle<JSFunction> function,
-                           BytecodeOffset osr_offset) {
+Tagged<Object> CompileOptimizedOSR(Isolate* isolate,
+                                   Handle<JSFunction> function,
+                                   CodeKind min_opt_level,
+                                   BytecodeOffset osr_offset) {
   const ConcurrencyMode mode =
       V8_LIKELY(isolate->concurrent_recompilation_enabled() &&
                 v8_flags.concurrent_osr)
@@ -481,44 +455,35 @@ Object CompileOptimizedOSR(Isolate* isolate, Handle<JSFunction> function,
           : ConcurrencyMode::kSynchronous;
 
   Handle<Code> result;
-  if (!Compiler::CompileOptimizedOSR(isolate, function, osr_offset, mode)
-           .ToHandle(&result)) {
+  if (!Compiler::CompileOptimizedOSR(
+           isolate, function, osr_offset, mode,
+           (maglev::IsMaglevOsrEnabled() && min_opt_level == CodeKind::MAGLEV)
+               ? CodeKind::MAGLEV
+               : CodeKind::TURBOFAN)
+           .ToHandle(&result) ||
+      result->marked_for_deoptimization()) {
     // An empty result can mean one of two things:
     // 1) we've started a concurrent compilation job - everything is fine.
     // 2) synchronous compilation failed for some reason.
 
     if (!function->HasAttachedOptimizedCode()) {
-      function->set_code(function->shared().GetCode(isolate));
+      function->set_code(function->shared()->GetCode(isolate));
     }
 
-    return {};
+    return Smi::zero();
   }
 
   DCHECK(!result.is_null());
-  DCHECK(result->is_turbofanned());  // TODO(v8:7700): Support Maglev.
+  DCHECK(result->is_turbofanned() || result->is_maglevved());
   DCHECK(CodeKindIsOptimizedJSFunction(result->kind()));
 
 #ifdef DEBUG
-  DeoptimizationData data =
+  Tagged<DeoptimizationData> data =
       DeoptimizationData::cast(result->deoptimization_data());
-  DCHECK_EQ(BytecodeOffset(data.OsrBytecodeOffset().value()), osr_offset);
-  DCHECK_GE(data.OsrPcOffset().value(), 0);
+  DCHECK_EQ(BytecodeOffset(data->OsrBytecodeOffset().value()), osr_offset);
+  DCHECK_GE(data->OsrPcOffset().value(), 0);
 #endif  // DEBUG
 
-  if (function->feedback_vector().invocation_count() <= 1 &&
-      !IsNone(function->tiering_state()) &&
-      !IsInProgress(function->tiering_state())) {
-    // With lazy feedback allocation we may not have feedback for the
-    // initial part of the function that was executed before we allocated a
-    // feedback vector. Reset any tiering states for such functions.
-    //
-    // TODO(mythria): Instead of resetting the tiering state here we
-    // should only mark a function for optimization if it has sufficient
-    // feedback. We cannot do this currently since we OSR only after we mark
-    // a function for optimization. We should instead change it to be based
-    // based on number of ticks.
-    function->reset_tiering_state();
-  }
   // First execution logging happens in LogOrTraceOptimizedOSREntry
   return *result;
 }
@@ -534,21 +499,14 @@ RUNTIME_FUNCTION(Runtime_CompileOptimizedOSR) {
   Handle<JSFunction> function;
   GetOsrOffsetAndFunctionForOSR(isolate, &osr_offset, &function);
 
-  return CompileOptimizedOSR(isolate, function, osr_offset);
+  return CompileOptimizedOSR(isolate, function, CodeKind::MAGLEV, osr_offset);
 }
 
-RUNTIME_FUNCTION(Runtime_CompileOptimizedOSRFromMaglev) {
-  HandleScope handle_scope(isolate);
-  DCHECK_EQ(1, args.length());
-  DCHECK(v8_flags.use_osr);
-
-  const BytecodeOffset osr_offset(args.positive_smi_value_at(0));
-
-  JavaScriptStackFrameIterator it(isolate);
-  MaglevFrame* frame = MaglevFrame::cast(it.frame());
-  DCHECK_EQ(frame->LookupCode().kind(), CodeKind::MAGLEV);
-  Handle<JSFunction> function = handle(frame->function(), isolate);
+namespace {
 
+Tagged<Object> CompileOptimizedOSRFromMaglev(Isolate* isolate,
+                                             Handle<JSFunction> function,
+                                             BytecodeOffset osr_offset) {
   // This path is only relevant for tests (all production configurations enable
   // concurrent OSR). It's quite subtle, if interested read on:
   if (V8_UNLIKELY(!isolate->concurrent_recompilation_enabled() ||
@@ -567,10 +525,58 @@ RUNTIME_FUNCTION(Runtime_CompileOptimizedOSRFromMaglev) {
     // letting it handle OSR. How do we trigger the early bailout? Returning
     // any non-null InstructionStream from this function triggers the deopt in
     // JumpLoop.
+    if (v8_flags.trace_osr) {
+      CodeTracer::Scope scope(isolate->GetCodeTracer());
+      PrintF(scope.file(),
+             "[OSR - Tiering from Maglev to Turbofan failed because "
+             "concurrent_osr is disabled. function: %s, osr offset: %d]\n",
+             function->DebugNameCStr().get(), osr_offset.ToInt());
+    }
     return function->code();
   }
 
-  return CompileOptimizedOSR(isolate, function, osr_offset);
+  return CompileOptimizedOSR(isolate, function, CodeKind::TURBOFAN, osr_offset);
+}
+
+}  // namespace
+
+RUNTIME_FUNCTION(Runtime_CompileOptimizedOSRFromMaglev) {
+  HandleScope handle_scope(isolate);
+  DCHECK_EQ(1, args.length());
+  DCHECK(v8_flags.use_osr);
+
+  const BytecodeOffset osr_offset(args.positive_smi_value_at(0));
+
+  JavaScriptStackFrameIterator it(isolate);
+  MaglevFrame* frame = MaglevFrame::cast(it.frame());
+  DCHECK_EQ(frame->LookupCode()->kind(), CodeKind::MAGLEV);
+  Handle<JSFunction> function = handle(frame->function(), isolate);
+
+  return CompileOptimizedOSRFromMaglev(isolate, function, osr_offset);
+}
+
+RUNTIME_FUNCTION(Runtime_CompileOptimizedOSRFromMaglevInlined) {
+  HandleScope handle_scope(isolate);
+  DCHECK_EQ(2, args.length());
+  DCHECK(v8_flags.use_osr);
+
+  const BytecodeOffset osr_offset(args.positive_smi_value_at(0));
+  Handle<JSFunction> function = args.at<JSFunction>(1);
+
+  JavaScriptStackFrameIterator it(isolate);
+  MaglevFrame* frame = MaglevFrame::cast(it.frame());
+  DCHECK_EQ(frame->LookupCode()->kind(), CodeKind::MAGLEV);
+
+  if (*function != frame->function()) {
+    // We are OSRing an inlined function. Mark the top frame one for
+    // optimization.
+    if (!frame->function()->ActiveTierIsTurbofan()) {
+      isolate->tiering_manager()->MarkForTurboFanOptimization(
+          frame->function());
+    }
+  }
+
+  return CompileOptimizedOSRFromMaglev(isolate, function, osr_offset);
 }
 
 RUNTIME_FUNCTION(Runtime_LogOrTraceOptimizedOSREntry) {
@@ -593,13 +599,13 @@ RUNTIME_FUNCTION(Runtime_LogOrTraceOptimizedOSREntry) {
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
-static Object CompileGlobalEval(Isolate* isolate,
-                                Handle<i::Object> source_object,
-                                Handle<SharedFunctionInfo> outer_info,
-                                LanguageMode language_mode,
-                                int eval_scope_position, int eval_position) {
-  Handle<Context> context(isolate->context(), isolate);
-  Handle<Context> native_context(context->native_context(), isolate);
+static Tagged<Object> CompileGlobalEval(Isolate* isolate,
+                                        Handle<i::Object> source_object,
+                                        Handle<SharedFunctionInfo> outer_info,
+                                        LanguageMode language_mode,
+                                        int eval_scope_position,
+                                        int eval_position) {
+  Handle<NativeContext> native_context = isolate->native_context();
 
   // Check if native context allows code generation from
   // strings. Throw an exception if it doesn't.
@@ -625,6 +631,7 @@ static Object CompileGlobalEval(Isolate* isolate,
   // and return the compiled function bound in the local context.
   static const ParseRestriction restriction = NO_PARSE_RESTRICTION;
   Handle<JSFunction> compiled;
+  Handle<Context> context(isolate->context(), isolate);
   ASSIGN_RETURN_ON_EXCEPTION_VALUE(
       isolate, compiled,
       Compiler::GetFunctionFromEval(
diff --git a/deps/v8/src/runtime/runtime-debug.cc b/deps/v8/src/runtime/runtime-debug.cc
index 22bdd354f83aed..029f447fc4eb2e 100644
--- a/deps/v8/src/runtime/runtime-debug.cc
+++ b/deps/v8/src/runtime/runtime-debug.cc
@@ -57,7 +57,7 @@ RUNTIME_FUNCTION_RETURN_PAIR(Runtime_DebugBreakOnBytecode) {
   // If the user requested to restart a frame, there is no need
   // to get the return value or check the bytecode for side-effects.
   if (isolate->debug()->IsRestartFrameScheduled()) {
-    Object exception = isolate->TerminateExecution();
+    Tagged<Object> exception = isolate->TerminateExecution();
     return MakePair(exception,
                     Smi::FromInt(static_cast<uint8_t>(Bytecode::kIllegal)));
   }
@@ -75,10 +75,10 @@ RUNTIME_FUNCTION_RETURN_PAIR(Runtime_DebugBreakOnBytecode) {
 
   // Make sure to only access these objects after the side effect check, as the
   // check can allocate on failure.
-  SharedFunctionInfo shared = interpreted_frame->function().shared();
-  BytecodeArray bytecode_array = shared.GetBytecodeArray(isolate);
+  Tagged<SharedFunctionInfo> shared = interpreted_frame->function()->shared();
+  Tagged<BytecodeArray> bytecode_array = shared->GetBytecodeArray(isolate);
   int bytecode_offset = interpreted_frame->GetBytecodeOffset();
-  Bytecode bytecode = Bytecodes::FromByte(bytecode_array.get(bytecode_offset));
+  Bytecode bytecode = Bytecodes::FromByte(bytecode_array->get(bytecode_offset));
 
   if (Bytecodes::Returns(bytecode)) {
     // If we are returning (or suspending), reset the bytecode array on the
@@ -100,8 +100,8 @@ RUNTIME_FUNCTION_RETURN_PAIR(Runtime_DebugBreakOnBytecode) {
     return MakePair(ReadOnlyRoots(isolate).exception(),
                     Smi::FromInt(static_cast<uint8_t>(bytecode)));
   }
-  Object interrupt_object = isolate->stack_guard()->HandleInterrupts();
-  if (interrupt_object.IsException(isolate)) {
+  Tagged<Object> interrupt_object = isolate->stack_guard()->HandleInterrupts();
+  if (IsException(interrupt_object, isolate)) {
     return MakePair(interrupt_object,
                     Smi::FromInt(static_cast<uint8_t>(bytecode)));
   }
@@ -113,10 +113,8 @@ RUNTIME_FUNCTION(Runtime_DebugBreakAtEntry) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSFunction> function = args.at<JSFunction>(0);
-  USE(function);
 
-  DCHECK(function->shared().HasDebugInfo());
-  DCHECK(function->shared().GetDebugInfo().BreakAtEntry());
+  DCHECK(function->shared()->BreakAtEntry(isolate));
 
   // Get the top-most JavaScript frame. This is the debug target function.
   JavaScriptStackFrameIterator it(isolate);
@@ -166,7 +164,7 @@ template <class IteratorType>
 static Handle<ArrayList> AddIteratorInternalProperties(
     Isolate* isolate, Handle<ArrayList> result, Handle<IteratorType> iterator) {
   const char* kind = nullptr;
-  switch (iterator->map().instance_type()) {
+  switch (iterator->map()->instance_type()) {
     case JS_MAP_KEY_ITERATOR_TYPE:
       kind = "keys";
       break;
@@ -202,19 +200,19 @@ static Handle<ArrayList> AddIteratorInternalProperties(
 MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
                                                     Handle<Object> object) {
   auto result = ArrayList::New(isolate, 8 * 2);
-  if (object->IsJSObject()) {
+  if (IsJSObject(*object)) {
     PrototypeIterator iter(isolate, Handle<JSObject>::cast(object),
                            kStartAtReceiver);
     if (iter.HasAccess()) {
       iter.Advance();
       Handle<Object> prototype = PrototypeIterator::GetCurrent(iter);
-      if (!iter.IsAtEnd() && iter.HasAccess() && object->IsJSGlobalProxy()) {
+      if (!iter.IsAtEnd() && iter.HasAccess() && IsJSGlobalProxy(*object)) {
         // Skip JSGlobalObject as the [[Prototype]].
-        DCHECK(prototype->IsJSGlobalObject());
+        DCHECK(IsJSGlobalObject(*prototype));
         iter.Advance();
         prototype = PrototypeIterator::GetCurrent(iter);
       }
-      if (!prototype->IsNull(isolate)) {
+      if (!IsNull(*prototype, isolate)) {
         result = ArrayList::Add(
             isolate, result,
             isolate->factory()->NewStringFromStaticChars("[[Prototype]]"),
@@ -222,7 +220,7 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
       }
     }
   }
-  if (object->IsJSBoundFunction()) {
+  if (IsJSBoundFunction(*object)) {
     Handle<JSBoundFunction> function = Handle<JSBoundFunction>::cast(object);
 
     result = ArrayList::Add(
@@ -239,13 +237,13 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
         isolate->factory()->NewJSArrayWithElements(
             isolate->factory()->CopyFixedArray(
                 handle(function->bound_arguments(), isolate))));
-  } else if (object->IsJSMapIterator()) {
+  } else if (IsJSMapIterator(*object)) {
     Handle<JSMapIterator> iterator = Handle<JSMapIterator>::cast(object);
     result = AddIteratorInternalProperties(isolate, result, iterator);
-  } else if (object->IsJSSetIterator()) {
+  } else if (IsJSSetIterator(*object)) {
     Handle<JSSetIterator> iterator = Handle<JSSetIterator>::cast(object);
     result = AddIteratorInternalProperties(isolate, result, iterator);
-  } else if (object->IsJSGeneratorObject()) {
+  } else if (IsJSGeneratorObject(*object)) {
     Handle<JSGeneratorObject> generator =
         Handle<JSGeneratorObject>::cast(object);
 
@@ -270,7 +268,7 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
         isolate, result,
         isolate->factory()->NewStringFromAsciiChecked("[[GeneratorReceiver]]"),
         handle(generator->receiver(), isolate));
-  } else if (object->IsJSPromise()) {
+  } else if (IsJSPromise(*object)) {
     Handle<JSPromise> promise = Handle<JSPromise>::cast(object);
 
     result = ArrayList::Add(
@@ -284,7 +282,7 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
         promise->status() == Promise::kPending
             ? isolate->factory()->undefined_value()
             : handle(promise->result(), isolate));
-  } else if (object->IsJSProxy()) {
+  } else if (IsJSProxy(*object)) {
     Handle<JSProxy> js_proxy = Handle<JSProxy>::cast(object);
 
     result = ArrayList::Add(
@@ -299,7 +297,7 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
         isolate, result,
         isolate->factory()->NewStringFromAsciiChecked("[[IsRevoked]]"),
         isolate->factory()->ToBoolean(js_proxy->IsRevoked()));
-  } else if (object->IsJSPrimitiveWrapper()) {
+  } else if (IsJSPrimitiveWrapper(*object)) {
     Handle<JSPrimitiveWrapper> js_value =
         Handle<JSPrimitiveWrapper>::cast(object);
 
@@ -307,14 +305,14 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
         isolate, result,
         isolate->factory()->NewStringFromAsciiChecked("[[PrimitiveValue]]"),
         handle(js_value->value(), isolate));
-  } else if (object->IsJSWeakRef()) {
+  } else if (IsJSWeakRef(*object)) {
     Handle<JSWeakRef> js_weak_ref = Handle<JSWeakRef>::cast(object);
 
     result = ArrayList::Add(
         isolate, result,
         isolate->factory()->NewStringFromAsciiChecked("[[WeakRefTarget]]"),
         handle(js_weak_ref->target(), isolate));
-  } else if (object->IsJSArrayBuffer()) {
+  } else if (IsJSArrayBuffer(*object)) {
     Handle<JSArrayBuffer> js_array_buffer = Handle<JSArrayBuffer>::cast(object);
     if (js_array_buffer->was_detached()) {
       // Mark a detached JSArrayBuffer and such and don't even try to
@@ -326,30 +324,24 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
           isolate->factory()->true_value());
     } else {
       const size_t byte_length = js_array_buffer->byte_length();
-      static const ExternalArrayType kTypes[] = {
-          kExternalInt8Array,
-          kExternalUint8Array,
-          kExternalInt16Array,
-          kExternalInt32Array,
-      };
-      for (auto type : kTypes) {
-        switch (type) {
-#define TYPED_ARRAY_CASE(Type, type, TYPE, ctype)                           \
-  case kExternal##Type##Array: {                                            \
-    if ((byte_length % sizeof(ctype)) != 0) continue;                       \
-    result = ArrayList::Add(                                                \
-        isolate, result,                                                    \
-        isolate->factory()->NewStringFromStaticChars("[[" #Type "Array]]"), \
-        isolate->factory()->NewJSTypedArray(kExternal##Type##Array,         \
-                                            js_array_buffer, 0,             \
-                                            byte_length / sizeof(ctype)));  \
-    break;                                                                  \
-  }
-          TYPED_ARRAYS(TYPED_ARRAY_CASE)
-#undef TYPED_ARRAY_CASE
-        default:
-          UNREACHABLE();
-        }
+      // TODO(v8:4153): Remove this code once the maximum lengths are equal (and
+      // add a static assertion that it stays that way).
+      static_assert(JSTypedArray::kMaxLength < JSArrayBuffer::kMaxByteLength);
+      CHECK_LE(byte_length, JSArrayBuffer::kMaxByteLength);
+      using DataView = std::tuple<const char*, ExternalArrayType, size_t>;
+      for (auto [name, type, elem_size] :
+           {DataView{"[[Int8Array]]", kExternalInt8Array, 1},
+            DataView{"[[Uint8Array]]", kExternalUint8Array, 1},
+            DataView{"[[Int16Array]]", kExternalInt16Array, 2},
+            DataView{"[[Int32Array]]", kExternalInt32Array, 4}}) {
+        if ((byte_length % elem_size) != 0) continue;
+        size_t length = byte_length / elem_size;
+        if (length > JSTypedArray::kMaxLength) continue;
+        result =
+            ArrayList::Add(isolate, result,
+                           isolate->factory()->NewStringFromAsciiChecked(name),
+                           isolate->factory()->NewJSTypedArray(
+                               type, js_array_buffer, 0, length));
       }
       result =
           ArrayList::Add(isolate, result,
@@ -371,7 +363,7 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
           isolate->factory()->array_buffer_wasm_memory_symbol();
       Handle<Object> memory_object =
           JSObject::GetDataProperty(isolate, js_array_buffer, memory_symbol);
-      if (!memory_object->IsUndefined(isolate)) {
+      if (!IsUndefined(*memory_object, isolate)) {
         result = ArrayList::Add(isolate, result,
                                 isolate->factory()->NewStringFromAsciiChecked(
                                     "[[WebAssemblyMemory]]"),
@@ -379,13 +371,13 @@ MaybeHandle<JSArray> Runtime::GetInternalProperties(Isolate* isolate,
       }
     }
 #if V8_ENABLE_WEBASSEMBLY
-  } else if (object->IsWasmInstanceObject()) {
+  } else if (IsWasmInstanceObject(*object)) {
     result = AddWasmInstanceObjectInternalProperties(
         isolate, result, Handle<WasmInstanceObject>::cast(object));
-  } else if (object->IsWasmModuleObject()) {
+  } else if (IsWasmModuleObject(*object)) {
     result = AddWasmModuleObjectInternalProperties(
         isolate, result, Handle<WasmModuleObject>::cast(object));
-  } else if (object->IsWasmTableObject()) {
+  } else if (IsWasmTableObject(*object)) {
     result = AddWasmTableObjectInternalProperties(
         isolate, result, Handle<WasmTableObject>::cast(object));
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -398,7 +390,7 @@ RUNTIME_FUNCTION(Runtime_GetGeneratorScopeCount) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
 
-  if (!args[0].IsJSGeneratorObject()) return Smi::zero();
+  if (!IsJSGeneratorObject(args[0])) return Smi::zero();
 
   // Check arguments.
   Handle<JSGeneratorObject> gen = args.at<JSGeneratorObject>(0);
@@ -421,7 +413,7 @@ RUNTIME_FUNCTION(Runtime_GetGeneratorScopeDetails) {
   HandleScope scope(isolate);
   DCHECK_EQ(2, args.length());
 
-  if (!args[0].IsJSGeneratorObject()) {
+  if (!IsJSGeneratorObject(args[0])) {
     return ReadOnlyRoots(isolate).undefined_value();
   }
 
@@ -489,7 +481,7 @@ RUNTIME_FUNCTION(Runtime_GetBreakLocations) {
   // Find the number of break points
   Handle<Object> break_locations =
       Debug::GetSourceBreakLocations(isolate, shared);
-  if (break_locations->IsUndefined(isolate)) {
+  if (IsUndefined(*break_locations, isolate)) {
     return ReadOnlyRoots(isolate).undefined_value();
   }
   // Return array as JS array
@@ -545,9 +537,9 @@ RUNTIME_FUNCTION(Runtime_FunctionGetInferredName) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
 
-  Object f = args[0];
-  if (f.IsJSFunction()) {
-    return JSFunction::cast(f).shared().inferred_name();
+  Tagged<Object> f = args[0];
+  if (IsJSFunction(f)) {
+    return JSFunction::cast(f)->shared()->inferred_name();
   }
   return ReadOnlyRoots(isolate).empty_string();
 }
@@ -558,7 +550,7 @@ RUNTIME_FUNCTION(Runtime_FunctionGetInferredName) {
 RUNTIME_FUNCTION(Runtime_CollectGarbage) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
-  isolate->heap()->PreciseCollectAllGarbage(Heap::kNoGCFlags,
+  isolate->heap()->PreciseCollectAllGarbage(GCFlag::kNoFlags,
                                             GarbageCollectionReason::kRuntime);
   return ReadOnlyRoots(isolate).undefined_value();
 }
@@ -569,7 +561,7 @@ int ScriptLinePosition(Handle<Script> script, int line) {
   if (line < 0) return -1;
 
 #if V8_ENABLE_WEBASSEMBLY
-  if (script->type() == Script::TYPE_WASM) {
+  if (script->type() == Script::Type::kWasm) {
     // Wasm positions are relative to the start of the module.
     return 0;
   }
@@ -577,14 +569,14 @@ int ScriptLinePosition(Handle<Script> script, int line) {
 
   Script::InitLineEnds(script->GetIsolate(), script);
 
-  FixedArray line_ends_array = FixedArray::cast(script->line_ends());
-  const int line_count = line_ends_array.length();
+  Tagged<FixedArray> line_ends_array = FixedArray::cast(script->line_ends());
+  const int line_count = line_ends_array->length();
   DCHECK_LT(0, line_count);
 
   if (line == 0) return 0;
   // If line == line_count, we return the first position beyond the last line.
   if (line > line_count) return -1;
-  return Smi::ToInt(line_ends_array.get(line - 1)) + 1;
+  return Smi::ToInt(line_ends_array->get(line - 1)) + 1;
 }
 
 int ScriptLinePositionWithOffset(Handle<Script> script, int line, int offset) {
@@ -594,7 +586,8 @@ int ScriptLinePositionWithOffset(Handle<Script> script, int line, int offset) {
     return ScriptLinePosition(script, line) + offset;
 
   Script::PositionInfo info;
-  if (!Script::GetPositionInfo(script, offset, &info, Script::NO_OFFSET)) {
+  if (!Script::GetPositionInfo(script, offset, &info,
+                               Script::OffsetFlag::kNoOffset)) {
     return -1;
   }
 
@@ -611,7 +604,7 @@ Handle<Object> GetJSPositionInfo(Handle<Script> script, int position,
   }
 
 #if V8_ENABLE_WEBASSEMBLY
-  const bool is_wasm_script = script->type() == Script::TYPE_WASM;
+  const bool is_wasm_script = script->type() == Script::Type::kWasm;
 #else
   const bool is_wasm_script = false;
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -647,14 +640,14 @@ Handle<Object> ScriptLocationFromLine(Isolate* isolate, Handle<Script> script,
   // additionally subtracting corresponding offsets.
 
   int32_t line = 0;
-  if (!opt_line->IsNullOrUndefined(isolate)) {
-    CHECK(opt_line->IsNumber());
+  if (!IsNullOrUndefined(*opt_line, isolate)) {
+    CHECK(IsNumber(*opt_line));
     line = NumberToInt32(*opt_line) - script->line_offset();
   }
 
   int32_t column = 0;
-  if (!opt_column->IsNullOrUndefined(isolate)) {
-    CHECK(opt_column->IsNumber());
+  if (!IsNullOrUndefined(*opt_column, isolate)) {
+    CHECK(IsNumber(*opt_column));
     column = NumberToInt32(*opt_column);
     if (line == 0) column -= script->column_offset();
   }
@@ -662,16 +655,16 @@ Handle<Object> ScriptLocationFromLine(Isolate* isolate, Handle<Script> script,
   int line_position = ScriptLinePositionWithOffset(script, line, offset);
   if (line_position < 0 || column < 0) return isolate->factory()->null_value();
 
-  return GetJSPositionInfo(script, line_position + column, Script::NO_OFFSET,
-                           isolate);
+  return GetJSPositionInfo(script, line_position + column,
+                           Script::OffsetFlag::kNoOffset, isolate);
 }
 
 // Slow traversal over all scripts on the heap.
 bool GetScriptById(Isolate* isolate, int needle, Handle<Script>* result) {
   Script::Iterator iterator(isolate);
-  for (Script script = iterator.Next(); !script.is_null();
+  for (Tagged<Script> script = iterator.Next(); !script.is_null();
        script = iterator.Next()) {
-    if (script.id() == needle) {
+    if (script->id() == needle) {
       *result = handle(script, isolate);
       return true;
     }
@@ -816,7 +809,7 @@ RUNTIME_FUNCTION(Runtime_DebugCollectCoverage) {
 
 RUNTIME_FUNCTION(Runtime_DebugTogglePreciseCoverage) {
   SealHandleScope shs(isolate);
-  bool enable = Oddball::cast(args[0]).ToBool(isolate);
+  bool enable = Boolean::cast(args[0])->ToBool(isolate);
   Coverage::SelectMode(isolate, enable ? debug::CoverageMode::kPreciseCount
                                        : debug::CoverageMode::kBestEffort);
   return ReadOnlyRoots(isolate).undefined_value();
@@ -824,7 +817,7 @@ RUNTIME_FUNCTION(Runtime_DebugTogglePreciseCoverage) {
 
 RUNTIME_FUNCTION(Runtime_DebugToggleBlockCoverage) {
   SealHandleScope shs(isolate);
-  bool enable = Oddball::cast(args[0]).ToBool(isolate);
+  bool enable = Boolean::cast(args[0])->ToBool(isolate);
   Coverage::SelectMode(isolate, enable ? debug::CoverageMode::kBlockCount
                                        : debug::CoverageMode::kBestEffort);
   return ReadOnlyRoots(isolate).undefined_value();
@@ -841,7 +834,7 @@ RUNTIME_FUNCTION(Runtime_DebugAsyncFunctionSuspended) {
   Handle<JSPromise> outer_promise = args.at<JSPromise>(1);
   Handle<JSFunction> reject_handler = args.at<JSFunction>(2);
   Handle<JSGeneratorObject> generator = args.at<JSGeneratorObject>(3);
-  bool is_predicted_as_caught = Oddball::cast(args[4]).ToBool(isolate);
+  bool is_predicted_as_caught = Boolean::cast(args[4])->ToBool(isolate);
 
   // Allocate the throwaway promise and fire the appropriate init
   // hook for the throwaway promise (passing the {promise} as its
@@ -871,9 +864,14 @@ RUNTIME_FUNCTION(Runtime_DebugAsyncFunctionSuspended) {
                         Just(ShouldThrow::kThrowOnError))
         .Check();
 
-    Object::SetProperty(
-        isolate, promise, isolate->factory()->promise_awaited_by_symbol(),
-        generator, StoreOrigin::kMaybeKeyed, Just(ShouldThrow::kThrowOnError))
+    Handle<WeakFixedArray> awaited_by_holder(
+        isolate->factory()->NewWeakFixedArray(1));
+    awaited_by_holder->Set(
+        0, MaybeObject::MakeWeak(MaybeObject::FromObject(*generator)));
+    Object::SetProperty(isolate, promise,
+                        isolate->factory()->promise_awaited_by_symbol(),
+                        awaited_by_holder, StoreOrigin::kMaybeKeyed,
+                        Just(ShouldThrow::kThrowOnError))
         .Check();
   }
 
@@ -884,7 +882,7 @@ RUNTIME_FUNCTION(Runtime_DebugPromiseThen) {
   DCHECK_EQ(1, args.length());
   HandleScope scope(isolate);
   Handle<JSReceiver> promise = args.at<JSReceiver>(0);
-  if (promise->IsJSPromise()) {
+  if (IsJSPromise(*promise)) {
     isolate->OnPromiseThen(Handle<JSPromise>::cast(promise));
   }
   return *promise;
@@ -896,7 +894,7 @@ RUNTIME_FUNCTION(Runtime_LiveEditPatchScript) {
   Handle<JSFunction> script_function = args.at<JSFunction>(0);
   Handle<String> new_source = args.at<String>(1);
 
-  Handle<Script> script(Script::cast(script_function->shared().script()),
+  Handle<Script> script(Script::cast(script_function->shared()->script()),
                         isolate);
   v8::debug::LiveEditResult result;
   LiveEdit::PatchScript(isolate, script, new_source, /* preview */ false,
@@ -931,8 +929,16 @@ RUNTIME_FUNCTION(Runtime_ProfileCreateSnapshotDataBlob) {
 
   DisableEmbeddedBlobRefcounting();
 
+  static constexpr char* kNoEmbeddedSource = nullptr;
+  // Have the SnapshotCreator create a new Isolate from scratch.
+  static constexpr Isolate* kNoIsolate = nullptr;
+  // We use this flag to tell the serializer not to finalize/seal RO space -
+  // this already happened after deserializing the main Isolate.
+  static constexpr Snapshot::SerializerFlags kSerializerFlags =
+      Snapshot::SerializerFlag::kAllowActiveIsolateForTesting;
   v8::StartupData blob = CreateSnapshotDataBlobInternal(
-      v8::SnapshotCreator::FunctionCodeHandling::kClear, nullptr);
+      v8::SnapshotCreator::FunctionCodeHandling::kClear, kNoEmbeddedSource,
+      kNoIsolate, kSerializerFlags);
   delete[] blob.data;
 
   // Track the embedded blob size as well.
diff --git a/deps/v8/src/runtime/runtime-forin.cc b/deps/v8/src/runtime/runtime-forin.cc
index 8ae6898555b094..027ee795f57624 100644
--- a/deps/v8/src/runtime/runtime-forin.cc
+++ b/deps/v8/src/runtime/runtime-forin.cc
@@ -36,7 +36,7 @@ MaybeHandle<HeapObject> Enumerate(Isolate* isolate,
     // Test again, since cache may have been built by GetKeys() calls above.
     if (!accumulator.is_receiver_simple_enum()) return keys;
   }
-  DCHECK(!receiver->IsJSModuleNamespace());
+  DCHECK(!IsJSModuleNamespace(*receiver));
   return handle(receiver->map(), isolate);
 }
 
@@ -65,7 +65,7 @@ MaybeHandle<Object> HasEnumerableProperty(Isolate* isolate,
           Handle<Object> prototype;
           ASSIGN_RETURN_ON_EXCEPTION(isolate, prototype,
                                      JSProxy::GetPrototype(proxy), Object);
-          if (prototype->IsNull(isolate)) {
+          if (IsNull(*prototype, isolate)) {
             return isolate->factory()->undefined_value();
           }
           // We already have a stack-check in JSProxy::GetPrototype.
@@ -98,7 +98,7 @@ MaybeHandle<Object> HasEnumerableProperty(Isolate* isolate,
         // TypedArray out-of-bounds access.
         return isolate->factory()->undefined_value();
       case LookupIterator::ACCESSOR: {
-        if (it.GetHolder<Object>()->IsJSModuleNamespace()) {
+        if (IsJSModuleNamespace(*it.GetHolder<Object>())) {
           result = JSModuleNamespace::GetPropertyAttributes(&it);
           if (result.IsNothing()) return MaybeHandle<Object>();
           DCHECK_EQ(0, result.FromJust() & DONT_ENUM);
@@ -131,7 +131,7 @@ RUNTIME_FUNCTION(Runtime_ForInHasProperty) {
   Handle<Object> result;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, result, HasEnumerableProperty(isolate, receiver, key));
-  return isolate->heap()->ToBoolean(!result->IsUndefined(isolate));
+  return isolate->heap()->ToBoolean(!IsUndefined(*result, isolate));
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/runtime/runtime-function.cc b/deps/v8/src/runtime/runtime-function.cc
index 3587a827c9d106..2ea763ed1da456 100644
--- a/deps/v8/src/runtime/runtime-function.cc
+++ b/deps/v8/src/runtime/runtime-function.cc
@@ -15,10 +15,10 @@ RUNTIME_FUNCTION(Runtime_FunctionGetScriptSource) {
   DCHECK_EQ(1, args.length());
   Handle<JSReceiver> function = args.at<JSReceiver>(0);
 
-  if (function->IsJSFunction()) {
-    Handle<Object> script(Handle<JSFunction>::cast(function)->shared().script(),
-                          isolate);
-    if (script->IsScript()) return Handle<Script>::cast(script)->source();
+  if (IsJSFunction(*function)) {
+    Handle<Object> script(
+        Handle<JSFunction>::cast(function)->shared()->script(), isolate);
+    if (IsScript(*script)) return Handle<Script>::cast(script)->source();
   }
   return ReadOnlyRoots(isolate).undefined_value();
 }
@@ -28,10 +28,10 @@ RUNTIME_FUNCTION(Runtime_FunctionGetScriptId) {
   DCHECK_EQ(1, args.length());
   Handle<JSReceiver> function = args.at<JSReceiver>(0);
 
-  if (function->IsJSFunction()) {
-    Handle<Object> script(Handle<JSFunction>::cast(function)->shared().script(),
-                          isolate);
-    if (script->IsScript()) {
+  if (IsJSFunction(*function)) {
+    Handle<Object> script(
+        Handle<JSFunction>::cast(function)->shared()->script(), isolate);
+    if (IsScript(*script)) {
       return Smi::FromInt(Handle<Script>::cast(script)->id());
     }
   }
@@ -42,7 +42,7 @@ RUNTIME_FUNCTION(Runtime_FunctionGetSourceCode) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSReceiver> function = args.at<JSReceiver>(0);
-  if (function->IsJSFunction()) {
+  if (IsJSFunction(*function)) {
     Handle<SharedFunctionInfo> shared(
         Handle<JSFunction>::cast(function)->shared(), isolate);
     return *SharedFunctionInfo::GetSourceCode(isolate, shared);
@@ -56,7 +56,7 @@ RUNTIME_FUNCTION(Runtime_FunctionGetScriptSourcePosition) {
   DCHECK_EQ(1, args.length());
 
   auto fun = JSFunction::cast(args[0]);
-  int pos = fun.shared().StartPosition();
+  int pos = fun->shared()->StartPosition();
   return Smi::FromInt(pos);
 }
 
@@ -66,7 +66,7 @@ RUNTIME_FUNCTION(Runtime_FunctionIsAPIFunction) {
   DCHECK_EQ(1, args.length());
 
   auto f = JSFunction::cast(args[0]);
-  return isolate->heap()->ToBoolean(f.shared().IsApiFunction());
+  return isolate->heap()->ToBoolean(f->shared()->IsApiFunction());
 }
 
 
@@ -88,8 +88,8 @@ RUNTIME_FUNCTION(Runtime_Call) {
 RUNTIME_FUNCTION(Runtime_IsFunction) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
-  Object object = args[0];
-  return isolate->heap()->ToBoolean(object.IsFunction());
+  Tagged<Object> object = args[0];
+  return isolate->heap()->ToBoolean(IsFunction(object));
 }
 
 
diff --git a/deps/v8/src/runtime/runtime-futex.cc b/deps/v8/src/runtime/runtime-futex.cc
index 33e436be99635d..15f8f4fe038ce1 100644
--- a/deps/v8/src/runtime/runtime-futex.cc
+++ b/deps/v8/src/runtime/runtime-futex.cc
@@ -55,7 +55,7 @@ RUNTIME_FUNCTION(Runtime_AtomicsNumUnresolvedAsyncPromisesForTesting) {
 RUNTIME_FUNCTION(Runtime_SetAllowAtomicsWait) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
-  bool set = Oddball::cast(args[0]).ToBool(isolate);
+  bool set = Boolean::cast(args[0])->ToBool(isolate);
 
   isolate->set_allow_atomics_wait(set);
   return ReadOnlyRoots(isolate).undefined_value();
diff --git a/deps/v8/src/runtime/runtime-generator.cc b/deps/v8/src/runtime/runtime-generator.cc
index 555367c47baafd..8e867c5f21ed10 100644
--- a/deps/v8/src/runtime/runtime-generator.cc
+++ b/deps/v8/src/runtime/runtime-generator.cc
@@ -44,30 +44,30 @@ RUNTIME_FUNCTION(Runtime_CreateJSGeneratorObject) {
   DCHECK_EQ(2, args.length());
   Handle<JSFunction> function = args.at<JSFunction>(0);
   Handle<Object> receiver = args.at(1);
-  CHECK_IMPLIES(IsAsyncFunction(function->shared().kind()),
-                IsAsyncGeneratorFunction(function->shared().kind()));
-  CHECK(IsResumableFunction(function->shared().kind()));
+  CHECK_IMPLIES(IsAsyncFunction(function->shared()->kind()),
+                IsAsyncGeneratorFunction(function->shared()->kind()));
+  CHECK(IsResumableFunction(function->shared()->kind()));
 
   // Underlying function needs to have bytecode available.
-  DCHECK(function->shared().HasBytecodeArray());
+  DCHECK(function->shared()->HasBytecodeArray());
   int size =
-      function->shared().internal_formal_parameter_count_without_receiver() +
-      function->shared().GetBytecodeArray(isolate).register_count();
+      function->shared()->internal_formal_parameter_count_without_receiver() +
+      function->shared()->GetBytecodeArray(isolate)->register_count();
   Handle<FixedArray> parameters_and_registers =
       isolate->factory()->NewFixedArray(size);
 
   Handle<JSGeneratorObject> generator =
       isolate->factory()->NewJSGeneratorObject(function);
   DisallowGarbageCollection no_gc;
-  auto raw_generator = *generator;
-  raw_generator.set_function(*function);
-  raw_generator.set_context(isolate->context());
-  raw_generator.set_receiver(*receiver);
-  raw_generator.set_parameters_and_registers(*parameters_and_registers);
-  raw_generator.set_resume_mode(JSGeneratorObject::ResumeMode::kNext);
-  raw_generator.set_continuation(JSGeneratorObject::kGeneratorExecuting);
-  if (raw_generator.IsJSAsyncGeneratorObject()) {
-    JSAsyncGeneratorObject::cast(raw_generator).set_is_awaiting(0);
+  Tagged<JSGeneratorObject> raw_generator = *generator;
+  raw_generator->set_function(*function);
+  raw_generator->set_context(isolate->context());
+  raw_generator->set_receiver(*receiver);
+  raw_generator->set_parameters_and_registers(*parameters_and_registers);
+  raw_generator->set_resume_mode(JSGeneratorObject::ResumeMode::kNext);
+  raw_generator->set_continuation(JSGeneratorObject::kGeneratorExecuting);
+  if (IsJSAsyncGeneratorObject(*raw_generator)) {
+    JSAsyncGeneratorObject::cast(raw_generator)->set_is_awaiting(0);
   }
   return raw_generator;
 }
@@ -129,7 +129,7 @@ RUNTIME_FUNCTION(Runtime_AsyncGeneratorHasCatchHandlerForPC) {
   DCHECK_EQ(1, args.length());
   auto generator = JSAsyncGeneratorObject::cast(args[0]);
 
-  int state = generator.continuation();
+  int state = generator->continuation();
   DCHECK_NE(state, JSAsyncGeneratorObject::kGeneratorExecuting);
 
   // If state is 0 ("suspendedStart"), there is guaranteed to be no catch
@@ -137,11 +137,11 @@ RUNTIME_FUNCTION(Runtime_AsyncGeneratorHasCatchHandlerForPC) {
   // not reach a catch handler.
   if (state < 1) return ReadOnlyRoots(isolate).false_value();
 
-  SharedFunctionInfo shared = generator.function().shared();
-  DCHECK(shared.HasBytecodeArray());
-  HandlerTable handler_table(shared.GetBytecodeArray(isolate));
+  SharedFunctionInfo shared = generator->function()->shared();
+  DCHECK(shared->HasBytecodeArray());
+  HandlerTable handler_table(shared->GetBytecodeArray(isolate));
 
-  int pc = Smi::cast(generator.input_or_debug_pos()).value();
+  int pc = Smi::cast(generator->input_or_debug_pos()).value();
   HandlerTable::CatchPrediction catch_prediction = HandlerTable::ASYNC_AWAIT;
   handler_table.LookupRange(pc, nullptr, &catch_prediction);
   return isolate->heap()->ToBoolean(catch_prediction == HandlerTable::CAUGHT);
diff --git a/deps/v8/src/runtime/runtime-internal.cc b/deps/v8/src/runtime/runtime-internal.cc
index c54debfed7cb9a..7fccc74c8f7238 100644
--- a/deps/v8/src/runtime/runtime-internal.cc
+++ b/deps/v8/src/runtime/runtime-internal.cc
@@ -31,9 +31,10 @@ RUNTIME_FUNCTION(Runtime_AccessCheck) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSObject> object = args.at<JSObject>(0);
-  if (!isolate->MayAccess(handle(isolate->context(), isolate), object)) {
-    isolate->ReportFailedAccessCheck(object);
-    RETURN_FAILURE_IF_SCHEDULED_EXCEPTION(isolate);
+  if (!isolate->MayAccess(isolate->native_context(), object)) {
+    RETURN_FAILURE_ON_EXCEPTION(isolate,
+                                isolate->ReportFailedAccessCheck(object));
+    UNREACHABLE();
   }
   return ReadOnlyRoots(isolate).undefined_value();
 }
@@ -52,6 +53,13 @@ RUNTIME_FUNCTION(Runtime_FatalProcessOutOfMemoryInvalidArrayLength) {
   UNREACHABLE();
 }
 
+RUNTIME_FUNCTION(Runtime_FatalInvalidSize) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(0, args.length());
+  FATAL("Invalid size");
+  UNREACHABLE();
+}
+
 RUNTIME_FUNCTION(Runtime_Throw) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
@@ -318,7 +326,7 @@ RUNTIME_FUNCTION(Runtime_ThrowApplyNonFunction) {
   Handle<Object> object = args.at(0);
   Handle<String> type = Object::TypeOf(isolate, object);
   Handle<String> msg;
-  if (object->IsNull()) {
+  if (IsNull(*object)) {
     // "which is null"
     msg = isolate->factory()->NewStringFromAsciiChecked("null");
   } else if (isolate->factory()->object_string()->Equals(*type)) {
@@ -346,7 +354,23 @@ RUNTIME_FUNCTION(Runtime_StackGuard) {
     return isolate->StackOverflow();
   }
 
-  return isolate->stack_guard()->HandleInterrupts();
+  return isolate->stack_guard()->HandleInterrupts(
+      StackGuard::InterruptLevel::kAnyEffect);
+}
+
+RUNTIME_FUNCTION(Runtime_HandleNoHeapWritesInterrupts) {
+  SealHandleScope shs(isolate);
+  DCHECK_EQ(0, args.length());
+  TRACE_EVENT0("v8.execute", "V8.StackGuard");
+
+  // First check if this is a real stack overflow.
+  StackLimitCheck check(isolate);
+  if (check.JsHasOverflowed()) {
+    return isolate->StackOverflow();
+  }
+
+  return isolate->stack_guard()->HandleInterrupts(
+      StackGuard::InterruptLevel::kNoHeapWrites);
 }
 
 RUNTIME_FUNCTION(Runtime_StackGuardWithGap) {
@@ -361,14 +385,15 @@ RUNTIME_FUNCTION(Runtime_StackGuardWithGap) {
     return isolate->StackOverflow();
   }
 
-  return isolate->stack_guard()->HandleInterrupts();
+  return isolate->stack_guard()->HandleInterrupts(
+      StackGuard::InterruptLevel::kAnyEffect);
 }
 
 namespace {
 
-Object BytecodeBudgetInterruptWithStackCheck(Isolate* isolate,
-                                             RuntimeArguments& args,
-                                             CodeKind code_kind) {
+Tagged<Object> BytecodeBudgetInterruptWithStackCheck(Isolate* isolate,
+                                                     RuntimeArguments& args,
+                                                     CodeKind code_kind) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSFunction> function = args.at<JSFunction>(0);
@@ -383,8 +408,8 @@ Object BytecodeBudgetInterruptWithStackCheck(Isolate* isolate,
     // the runtime function call being what overflows the stack.
     return isolate->StackOverflow();
   } else if (check.InterruptRequested()) {
-    Object return_value = isolate->stack_guard()->HandleInterrupts();
-    if (!return_value.IsUndefined(isolate)) {
+    Tagged<Object> return_value = isolate->stack_guard()->HandleInterrupts();
+    if (!IsUndefined(return_value, isolate)) {
       return return_value;
     }
   }
@@ -393,8 +418,8 @@ Object BytecodeBudgetInterruptWithStackCheck(Isolate* isolate,
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
-Object BytecodeBudgetInterrupt(Isolate* isolate, RuntimeArguments& args,
-                               CodeKind code_kind) {
+Tagged<Object> BytecodeBudgetInterrupt(Isolate* isolate, RuntimeArguments& args,
+                                       CodeKind code_kind) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSFunction> function = args.at<JSFunction>(0);
@@ -468,13 +493,8 @@ RUNTIME_FUNCTION(Runtime_AllocateInYoungGeneration) {
   int flags = args.smi_value_at(1);
   AllocationAlignment alignment =
       AllocateDoubleAlignFlag::decode(flags) ? kDoubleAligned : kTaggedAligned;
-  bool allow_large_object_allocation =
-      AllowLargeObjectAllocationFlag::decode(flags);
   CHECK(IsAligned(size, kTaggedSize));
   CHECK_GT(size, 0);
-  if (!allow_large_object_allocation) {
-    CHECK(size <= kMaxRegularHeapObjectSize);
-  }
 
 #if V8_ENABLE_WEBASSEMBLY
   // When this is called from WasmGC code, clear the "thread in wasm" flag,
@@ -501,13 +521,8 @@ RUNTIME_FUNCTION(Runtime_AllocateInOldGeneration) {
   int flags = args.smi_value_at(1);
   AllocationAlignment alignment =
       AllocateDoubleAlignFlag::decode(flags) ? kDoubleAligned : kTaggedAligned;
-  bool allow_large_object_allocation =
-      AllowLargeObjectAllocationFlag::decode(flags);
   CHECK(IsAligned(size, kTaggedSize));
   CHECK_GT(size, 0);
-  if (!allow_large_object_allocation) {
-    CHECK(size <= kMaxRegularHeapObjectSize);
-  }
   return *isolate->factory()->NewFillerObject(
       size, alignment, AllocationType::kOld, AllocationOrigin::kGeneratedCode);
 }
@@ -657,7 +672,7 @@ RUNTIME_FUNCTION(Runtime_GetAndResetRuntimeCallStats) {
   }
 
   std::FILE* f;
-  if (args[0].IsString()) {
+  if (IsString(args[0])) {
     // With a string argument, the results are appended to that file.
     Handle<String> filename = args.at<String>(0);
     f = std::fopen(filename->ToCString().get(), "a");
@@ -678,7 +693,7 @@ RUNTIME_FUNCTION(Runtime_GetAndResetRuntimeCallStats) {
   OFStream stats_stream(f);
   isolate->counters()->runtime_call_stats()->Print(stats_stream);
   isolate->counters()->runtime_call_stats()->Reset();
-  if (args[0].IsString()) {
+  if (IsString(args[0])) {
     std::fclose(f);
   } else {
     std::fflush(f);
@@ -725,7 +740,7 @@ RUNTIME_FUNCTION(Runtime_CreateAsyncFromSyncIterator) {
 
   Handle<Object> sync_iterator = args.at(0);
 
-  if (!sync_iterator->IsJSReceiver()) {
+  if (!IsJSReceiver(*sync_iterator)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kSymbolIteratorInvalid));
   }
@@ -748,7 +763,7 @@ RUNTIME_FUNCTION(Runtime_GetTemplateObject) {
   Handle<SharedFunctionInfo> shared_info = args.at<SharedFunctionInfo>(1);
   int slot_id = args.smi_value_at(2);
 
-  Handle<NativeContext> native_context(isolate->context().native_context(),
+  Handle<NativeContext> native_context(isolate->context()->native_context(),
                                        isolate);
   return *TemplateObjectDescription::GetTemplateObject(
       isolate, native_context, description, shared_info, slot_id);
@@ -789,7 +804,7 @@ RUNTIME_FUNCTION(Runtime_DoubleToStringWithRadix) {
   DCHECK_EQ(2, args.length());
   double number = args.number_value_at(0);
   int32_t radix = 0;
-  CHECK(args[1].ToInt32(&radix));
+  CHECK(Object::ToInt32(args[1], &radix));
 
   char* const str = DoubleToRadixCString(number, radix);
   Handle<String> result = isolate->factory()->NewStringFromAsciiChecked(str);
diff --git a/deps/v8/src/runtime/runtime-literals.cc b/deps/v8/src/runtime/runtime-literals.cc
index bb698867c88f20..962e5e3f7abd51 100644
--- a/deps/v8/src/runtime/runtime-literals.cc
+++ b/deps/v8/src/runtime/runtime-literals.cc
@@ -18,12 +18,12 @@ namespace internal {
 
 namespace {
 
-bool IsUninitializedLiteralSite(Object literal_site) {
+bool IsUninitializedLiteralSite(Tagged<Object> literal_site) {
   return literal_site == Smi::zero();
 }
 
 bool HasBoilerplate(Handle<Object> literal_site) {
-  return !literal_site->IsSmi();
+  return !IsSmi(*literal_site);
 }
 
 void PreInitializeLiteralSite(Handle<FeedbackVector> vector,
@@ -44,7 +44,7 @@ class JSObjectWalkVisitor {
   V8_WARN_UNUSED_RESULT inline MaybeHandle<JSObject> VisitElementOrProperty(
       Handle<JSObject> object, Handle<JSObject> value) {
     // Dont create allocation sites for nested object literals
-    if (!value->IsJSArray()) {
+    if (!IsJSArray(*value)) {
       return StructureWalk(value);
     }
 
@@ -76,7 +76,7 @@ MaybeHandle<JSObject> JSObjectWalkVisitor<ContextObject>::StructureWalk(
     }
   }
 
-  if (object->map(isolate).is_deprecated()) {
+  if (object->map(isolate)->is_deprecated()) {
     base::SharedMutexGuard<base::kExclusive> mutex_guard(
         isolate->boilerplate_migration_access());
     JSObject::MigrateInstance(isolate, object);
@@ -85,7 +85,7 @@ MaybeHandle<JSObject> JSObjectWalkVisitor<ContextObject>::StructureWalk(
   Handle<JSObject> copy;
   if (copying) {
     // JSFunction objects are not allowed to be in normal boilerplates at all.
-    DCHECK(!object->IsJSFunction(isolate));
+    DCHECK(!IsJSFunction(*object, isolate));
     Handle<AllocationSite> site_to_pass;
     if (site_context()->ShouldCreateMemento(object)) {
       site_to_pass = site_context()->current();
@@ -101,26 +101,26 @@ MaybeHandle<JSObject> JSObjectWalkVisitor<ContextObject>::StructureWalk(
   HandleScope scope(isolate);
 
   // Deep copy own properties. Arrays only have 1 property "length".
-  if (!copy->IsJSArray(isolate)) {
+  if (!IsJSArray(*copy, isolate)) {
     if (copy->HasFastProperties(isolate)) {
       Handle<DescriptorArray> descriptors(
-          copy->map(isolate).instance_descriptors(isolate), isolate);
-      for (InternalIndex i : copy->map(isolate).IterateOwnDescriptors()) {
+          copy->map(isolate)->instance_descriptors(isolate), isolate);
+      for (InternalIndex i : copy->map(isolate)->IterateOwnDescriptors()) {
         PropertyDetails details = descriptors->GetDetails(i);
         DCHECK_EQ(PropertyLocation::kField, details.location());
         DCHECK_EQ(PropertyKind::kData, details.kind());
         FieldIndex index = FieldIndex::ForPropertyIndex(
             copy->map(isolate), details.field_index(),
             details.representation());
-        Object raw = copy->RawFastPropertyAt(isolate, index);
-        if (raw.IsJSObject(isolate)) {
+        Tagged<Object> raw = copy->RawFastPropertyAt(isolate, index);
+        if (IsJSObject(raw, isolate)) {
           Handle<JSObject> value(JSObject::cast(raw), isolate);
           ASSIGN_RETURN_ON_EXCEPTION(
               isolate, value, VisitElementOrProperty(copy, value), JSObject);
           if (copying) copy->FastPropertyAtPut(index, *value);
         } else if (copying && details.representation().IsDouble()) {
           uint64_t double_value =
-              HeapNumber::cast(raw).value_as_bits(kRelaxedLoad);
+              HeapNumber::cast(raw)->value_as_bits(kRelaxedLoad);
           auto value = isolate->factory()->NewHeapNumberFromBits(double_value);
           copy->FastPropertyAtPut(index, *value);
         }
@@ -130,9 +130,9 @@ MaybeHandle<JSObject> JSObjectWalkVisitor<ContextObject>::StructureWalk(
         Handle<SwissNameDictionary> dict(
             copy->property_dictionary_swiss(isolate), isolate);
         for (InternalIndex i : dict->IterateEntries()) {
-          Object raw = dict->ValueAt(i);
-          if (!raw.IsJSObject(isolate)) continue;
-          DCHECK(dict->KeyAt(i).IsName());
+          Tagged<Object> raw = dict->ValueAt(i);
+          if (!IsJSObject(raw, isolate)) continue;
+          DCHECK(IsName(dict->KeyAt(i)));
           Handle<JSObject> value(JSObject::cast(raw), isolate);
           ASSIGN_RETURN_ON_EXCEPTION(
               isolate, value, VisitElementOrProperty(copy, value), JSObject);
@@ -142,9 +142,9 @@ MaybeHandle<JSObject> JSObjectWalkVisitor<ContextObject>::StructureWalk(
         Handle<NameDictionary> dict(copy->property_dictionary(isolate),
                                     isolate);
         for (InternalIndex i : dict->IterateEntries()) {
-          Object raw = dict->ValueAt(isolate, i);
-          if (!raw.IsJSObject(isolate)) continue;
-          DCHECK(dict->KeyAt(isolate, i).IsName());
+          Tagged<Object> raw = dict->ValueAt(isolate, i);
+          if (!IsJSObject(raw, isolate)) continue;
+          DCHECK(IsName(dict->KeyAt(isolate, i)));
           Handle<JSObject> value(JSObject::cast(raw), isolate);
           ASSIGN_RETURN_ON_EXCEPTION(
               isolate, value, VisitElementOrProperty(copy, value), JSObject);
@@ -154,7 +154,7 @@ MaybeHandle<JSObject> JSObjectWalkVisitor<ContextObject>::StructureWalk(
     }
 
     // Assume non-arrays don't end up having elements.
-    if (copy->elements(isolate).length() == 0) return copy;
+    if (copy->elements(isolate)->length() == 0) return copy;
   }
 
   // Deep copy own elements.
@@ -174,13 +174,13 @@ MaybeHandle<JSObject> JSObjectWalkVisitor<ContextObject>::StructureWalk(
           ReadOnlyRoots(isolate).fixed_cow_array_map()) {
 #ifdef DEBUG
         for (int i = 0; i < elements->length(); i++) {
-          DCHECK(!elements->get(i).IsJSObject());
+          DCHECK(!IsJSObject(elements->get(i)));
         }
 #endif
       } else {
         for (int i = 0; i < elements->length(); i++) {
-          Object raw = elements->get(isolate, i);
-          if (!raw.IsJSObject(isolate)) continue;
+          Tagged<Object> raw = elements->get(isolate, i);
+          if (!IsJSObject(raw, isolate)) continue;
           Handle<JSObject> value(JSObject::cast(raw), isolate);
           ASSIGN_RETURN_ON_EXCEPTION(
               isolate, value, VisitElementOrProperty(copy, value), JSObject);
@@ -193,8 +193,8 @@ MaybeHandle<JSObject> JSObjectWalkVisitor<ContextObject>::StructureWalk(
       Handle<NumberDictionary> element_dictionary(
           copy->element_dictionary(isolate), isolate);
       for (InternalIndex i : element_dictionary->IterateEntries()) {
-        Object raw = element_dictionary->ValueAt(isolate, i);
-        if (!raw.IsJSObject(isolate)) continue;
+        Tagged<Object> raw = element_dictionary->ValueAt(isolate, i);
+        if (!IsJSObject(raw, isolate)) continue;
         Handle<JSObject> value(JSObject::cast(raw), isolate);
         ASSIGN_RETURN_ON_EXCEPTION(
             isolate, value, VisitElementOrProperty(copy, value), JSObject);
@@ -406,14 +406,14 @@ Handle<JSObject> CreateObjectLiteral(
     Handle<Object> value(object_boilerplate_description->value(isolate, index),
                          isolate);
 
-    if (value->IsHeapObject()) {
-      if (HeapObject::cast(*value).IsArrayBoilerplateDescription(isolate)) {
+    if (IsHeapObject(*value)) {
+      if (IsArrayBoilerplateDescription(HeapObject::cast(*value), isolate)) {
         Handle<ArrayBoilerplateDescription> array_boilerplate =
             Handle<ArrayBoilerplateDescription>::cast(value);
         value = CreateArrayLiteral(isolate, array_boilerplate, allocation);
 
-      } else if (HeapObject::cast(*value).IsObjectBoilerplateDescription(
-                     isolate)) {
+      } else if (IsObjectBoilerplateDescription(HeapObject::cast(*value),
+                                                isolate)) {
         Handle<ObjectBoilerplateDescription> object_boilerplate =
             Handle<ObjectBoilerplateDescription>::cast(value);
         value = CreateObjectLiteral(isolate, object_boilerplate,
@@ -422,9 +422,9 @@ Handle<JSObject> CreateObjectLiteral(
     }
 
     uint32_t element_index = 0;
-    if (key->ToArrayIndex(&element_index)) {
+    if (Object::ToArrayIndex(*key, &element_index)) {
       // Array index (uint32).
-      if (value->IsUninitialized(isolate)) {
+      if (IsUninitialized(*value, isolate)) {
         value = handle(Smi::zero(), isolate);
       }
       JSObject::SetOwnElementIgnoreAttributes(boilerplate, element_index, value,
@@ -442,7 +442,7 @@ Handle<JSObject> CreateObjectLiteral(
     // TODO(cbruni): avoid making the boilerplate fast again, the clone stub
     // supports dict-mode objects directly.
     JSObject::MigrateSlowToFast(
-        boilerplate, boilerplate->map().UnusedPropertyFields(), "FastLiteral");
+        boilerplate, boilerplate->map()->UnusedPropertyFields(), "FastLiteral");
   }
   return boilerplate;
 }
@@ -472,7 +472,7 @@ Handle<JSObject> CreateArrayLiteral(
         Handle<FixedArray> fixed_array_values =
             Handle<FixedArray>::cast(copied_elements_values);
         for (int i = 0; i < fixed_array_values->length(); i++) {
-          DCHECK(!fixed_array_values->get(i).IsFixedArray());
+          DCHECK(!IsFixedArray(fixed_array_values->get(i)));
         }
       }
     } else {
@@ -482,10 +482,10 @@ Handle<JSObject> CreateArrayLiteral(
           isolate->factory()->CopyFixedArray(fixed_array_values);
       copied_elements_values = fixed_array_values_copy;
       for (int i = 0; i < fixed_array_values->length(); i++) {
-        Object value = fixed_array_values_copy->get(isolate, i);
-        HeapObject value_heap_object;
+        Tagged<Object> value = fixed_array_values_copy->get(isolate, i);
+        Tagged<HeapObject> value_heap_object;
         if (value.GetHeapObject(isolate, &value_heap_object)) {
-          if (value_heap_object.IsArrayBoilerplateDescription(isolate)) {
+          if (IsArrayBoilerplateDescription(value_heap_object, isolate)) {
             HandleScope sub_scope(isolate);
             Handle<ArrayBoilerplateDescription> boilerplate(
                 ArrayBoilerplateDescription::cast(value_heap_object), isolate);
@@ -493,8 +493,8 @@ Handle<JSObject> CreateArrayLiteral(
                 CreateArrayLiteral(isolate, boilerplate, allocation);
             fixed_array_values_copy->set(i, *result);
 
-          } else if (value_heap_object.IsObjectBoilerplateDescription(
-                         isolate)) {
+          } else if (IsObjectBoilerplateDescription(value_heap_object,
+                                                    isolate)) {
             HandleScope sub_scope(isolate);
             Handle<ObjectBoilerplateDescription> boilerplate(
                 ObjectBoilerplateDescription::cast(value_heap_object), isolate);
@@ -523,15 +523,15 @@ MaybeHandle<JSObject> CreateLiteralWithoutAllocationSite(
 
 template <typename LiteralHelper>
 MaybeHandle<JSObject> CreateLiteral(Isolate* isolate,
-                                    MaybeHandle<FeedbackVector> maybe_vector,
+                                    Handle<HeapObject> maybe_vector,
                                     int literals_index,
                                     Handle<HeapObject> description, int flags) {
-  if (maybe_vector.is_null()) {
+  if (!IsFeedbackVector(*maybe_vector)) {
+    DCHECK(IsUndefined(*maybe_vector));
     return CreateLiteralWithoutAllocationSite<LiteralHelper>(
         isolate, description, flags);
   }
-
-  Handle<FeedbackVector> vector = maybe_vector.ToHandleChecked();
+  Handle<FeedbackVector> vector = Handle<FeedbackVector>::cast(maybe_vector);
   FeedbackSlot literals_slot(FeedbackVector::ToSlot(literals_index));
   CHECK(literals_slot.ToInt() < vector->length());
   Handle<Object> literal_site(vector->Get(literals_slot)->cast<Object>(),
@@ -587,37 +587,9 @@ RUNTIME_FUNCTION(Runtime_CreateObjectLiteral) {
   Handle<ObjectBoilerplateDescription> description =
       args.at<ObjectBoilerplateDescription>(2);
   int flags = args.smi_value_at(3);
-  Handle<FeedbackVector> vector;
-  if (maybe_vector->IsFeedbackVector()) {
-    vector = Handle<FeedbackVector>::cast(maybe_vector);
-  } else {
-    DCHECK(maybe_vector->IsUndefined());
-  }
   RETURN_RESULT_OR_FAILURE(
       isolate, CreateLiteral<ObjectLiteralHelper>(
-                   isolate, vector, literals_index, description, flags));
-}
-
-RUNTIME_FUNCTION(Runtime_CreateObjectLiteralWithoutAllocationSite) {
-  HandleScope scope(isolate);
-  DCHECK_EQ(2, args.length());
-  Handle<ObjectBoilerplateDescription> description =
-      args.at<ObjectBoilerplateDescription>(0);
-  int flags = args.smi_value_at(1);
-  RETURN_RESULT_OR_FAILURE(
-      isolate, CreateLiteralWithoutAllocationSite<ObjectLiteralHelper>(
-                   isolate, description, flags));
-}
-
-RUNTIME_FUNCTION(Runtime_CreateArrayLiteralWithoutAllocationSite) {
-  HandleScope scope(isolate);
-  DCHECK_EQ(2, args.length());
-  Handle<ArrayBoilerplateDescription> description =
-      args.at<ArrayBoilerplateDescription>(0);
-  int flags = args.smi_value_at(1);
-  RETURN_RESULT_OR_FAILURE(
-      isolate, CreateLiteralWithoutAllocationSite<ArrayLiteralHelper>(
-                   isolate, description, flags));
+                   isolate, maybe_vector, literals_index, description, flags));
 }
 
 RUNTIME_FUNCTION(Runtime_CreateArrayLiteral) {
@@ -628,15 +600,9 @@ RUNTIME_FUNCTION(Runtime_CreateArrayLiteral) {
   Handle<ArrayBoilerplateDescription> elements =
       args.at<ArrayBoilerplateDescription>(2);
   int flags = args.smi_value_at(3);
-  Handle<FeedbackVector> vector;
-  if (maybe_vector->IsFeedbackVector()) {
-    vector = Handle<FeedbackVector>::cast(maybe_vector);
-  } else {
-    DCHECK(maybe_vector->IsUndefined());
-  }
   RETURN_RESULT_OR_FAILURE(
       isolate, CreateLiteral<ArrayLiteralHelper>(
-                   isolate, vector, literals_index, elements, flags));
+                   isolate, maybe_vector, literals_index, elements, flags));
 }
 
 RUNTIME_FUNCTION(Runtime_CreateRegExpLiteral) {
@@ -647,7 +613,7 @@ RUNTIME_FUNCTION(Runtime_CreateRegExpLiteral) {
   Handle<String> pattern = args.at<String>(2);
   int flags = args.smi_value_at(3);
 
-  if (maybe_vector->IsUndefined()) {
+  if (IsUndefined(*maybe_vector)) {
     // We don't have a vector; don't create a boilerplate, simply construct a
     // plain JSRegExp instance and return it.
     RETURN_RESULT_OR_FAILURE(
diff --git a/deps/v8/src/runtime/runtime-module.cc b/deps/v8/src/runtime/runtime-module.cc
index c3f06993b40868..2d31ac847d640e 100644
--- a/deps/v8/src/runtime/runtime-module.cc
+++ b/deps/v8/src/runtime/runtime-module.cc
@@ -12,9 +12,9 @@ namespace internal {
 namespace {
 Handle<Script> GetEvalOrigin(Isolate* isolate, Script origin_script) {
   DisallowGarbageCollection no_gc;
-  while (origin_script.has_eval_from_shared()) {
-    HeapObject maybe_script = origin_script.eval_from_shared().script();
-    CHECK(maybe_script.IsScript());
+  while (origin_script->has_eval_from_shared()) {
+    HeapObject maybe_script = origin_script->eval_from_shared()->script();
+    CHECK(IsScript(maybe_script));
     origin_script = Script::cast(maybe_script);
   }
   return handle(origin_script, isolate);
@@ -34,7 +34,7 @@ RUNTIME_FUNCTION(Runtime_DynamicImportCall) {
   }
 
   Handle<Script> referrer_script =
-      GetEvalOrigin(isolate, Script::cast(function->shared().script()));
+      GetEvalOrigin(isolate, Script::cast(function->shared()->script()));
   RETURN_RESULT_OR_FAILURE(isolate,
                            isolate->RunHostImportModuleDynamicallyCallback(
                                referrer_script, specifier, import_assertions));
@@ -44,14 +44,14 @@ RUNTIME_FUNCTION(Runtime_GetModuleNamespace) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   int module_request = args.smi_value_at(0);
-  Handle<SourceTextModule> module(isolate->context().module(), isolate);
+  Handle<SourceTextModule> module(isolate->context()->module(), isolate);
   return *SourceTextModule::GetModuleNamespace(isolate, module, module_request);
 }
 
 RUNTIME_FUNCTION(Runtime_GetImportMetaObject) {
   HandleScope scope(isolate);
   DCHECK_EQ(0, args.length());
-  Handle<SourceTextModule> module(isolate->context().module(), isolate);
+  Handle<SourceTextModule> module(isolate->context()->module(), isolate);
   RETURN_RESULT_OR_FAILURE(isolate,
                            SourceTextModule::GetImportMeta(isolate, module));
 }
diff --git a/deps/v8/src/runtime/runtime-numbers.cc b/deps/v8/src/runtime/runtime-numbers.cc
index 0233dea6509087..eee0b01d8910cb 100644
--- a/deps/v8/src/runtime/runtime-numbers.cc
+++ b/deps/v8/src/runtime/runtime-numbers.cc
@@ -31,11 +31,11 @@ RUNTIME_FUNCTION(Runtime_StringParseInt) {
   subject = String::Flatten(isolate, subject);
 
   // Convert {radix} to Int32.
-  if (!radix->IsNumber()) {
+  if (!IsNumber(*radix)) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, radix,
                                        Object::ToNumber(isolate, radix));
   }
-  int radix32 = DoubleToInt32(radix->Number());
+  int radix32 = DoubleToInt32(Object::Number(*radix));
   if (radix32 != 0 && (radix32 < 2 || radix32 > 36)) {
     return ReadOnlyRoots(isolate).nan_value();
   }
@@ -75,7 +75,7 @@ RUNTIME_FUNCTION(Runtime_IsSmi) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
   Object obj = args[0];
-  return isolate->heap()->ToBoolean(obj.IsSmi());
+  return isolate->heap()->ToBoolean(IsSmi(obj));
 }
 
 
diff --git a/deps/v8/src/runtime/runtime-object.cc b/deps/v8/src/runtime/runtime-object.cc
index ff1f1d0c9a5c6f..770f8efa8f9c0f 100644
--- a/deps/v8/src/runtime/runtime-object.cc
+++ b/deps/v8/src/runtime/runtime-object.cc
@@ -28,7 +28,7 @@ MaybeHandle<Object> Runtime::GetObjectProperty(
   if (receiver.is_null()) {
     receiver = lookup_start_object;
   }
-  if (lookup_start_object->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*lookup_start_object, isolate)) {
     ErrorUtils::ThrowLoadFromNullOrUndefined(isolate, lookup_start_object, key);
     return MaybeHandle<Object>();
   }
@@ -45,15 +45,6 @@ MaybeHandle<Object> Runtime::GetObjectProperty(
   }
   if (is_found) *is_found = it.IsFound();
 
-  if (!it.IsFound() && key->IsSymbol() &&
-      Symbol::cast(*key).is_private_name()) {
-    MessageTemplate message =
-        Symbol::cast(*key).IsPrivateBrand()
-            ? MessageTemplate::kInvalidPrivateBrandInstance
-            : MessageTemplate::kInvalidPrivateMemberRead;
-    THROW_NEW_ERROR(isolate, NewTypeError(message, key, lookup_start_object),
-                    Object);
-  }
   return result;
 }
 
@@ -61,7 +52,7 @@ MaybeHandle<Object> Runtime::HasProperty(Isolate* isolate,
                                          Handle<Object> object,
                                          Handle<Object> key) {
   // Check that {object} is actually a receiver.
-  if (!object->IsJSReceiver()) {
+  if (!IsJSReceiver(*object)) {
     THROW_NEW_ERROR(
         isolate,
         NewTypeError(MessageTemplate::kInvalidInOperatorUse, key, object),
@@ -77,8 +68,7 @@ MaybeHandle<Object> Runtime::HasProperty(Isolate* isolate,
   // Lookup the {name} on {receiver}.
   Maybe<bool> maybe = JSReceiver::HasProperty(isolate, receiver, name);
   if (maybe.IsNothing()) return MaybeHandle<Object>();
-  return maybe.FromJust() ? ReadOnlyRoots(isolate).true_value_handle()
-                          : ReadOnlyRoots(isolate).false_value_handle();
+  return ReadOnlyRoots(isolate).boolean_value_handle(maybe.FromJust());
 }
 
 namespace {
@@ -99,7 +89,7 @@ inline void ClearField(Isolate* isolate, JSObject object, FieldIndex index) {
     int offset = index.offset();
     TaggedField<MapWord>::Release_Store(object, offset, filler_map_word);
   } else {
-    object.property_array().set(
+    object->property_array()->set(
         index.outobject_array_index(),
         ReadOnlyRoots(isolate).one_pointer_filler_map());
   }
@@ -119,9 +109,9 @@ void GeneralizeAllTransitionsToFieldAsMutable(Isolate* isolate, Handle<Map> map,
     transitions.ForEachTransitionTo(
         *name,
         [&](Map target) {
-          DCHECK_EQ(descriptor, target.LastAdded());
-          DCHECK_EQ(*name, target.GetLastDescriptorName(isolate));
-          PropertyDetails details = target.GetLastDescriptorDetails(isolate);
+          DCHECK_EQ(descriptor, target->LastAdded());
+          DCHECK_EQ(*name, target->GetLastDescriptorName(isolate));
+          PropertyDetails details = target->GetLastDescriptorDetails(isolate);
           // Currently, we track constness only for fields.
           if (details.kind() == PropertyKind::kData &&
               details.constness() == PropertyConstness::kConst) {
@@ -137,15 +127,15 @@ void GeneralizeAllTransitionsToFieldAsMutable(Isolate* isolate, Handle<Map> map,
   for (int i = 0; i < target_maps_count; i++) {
     Handle<Map> target = target_maps[i];
     PropertyDetails details =
-        target->instance_descriptors(isolate).GetDetails(descriptor);
+        target->instance_descriptors(isolate)->GetDetails(descriptor);
     Handle<FieldType> field_type(
-        target->instance_descriptors(isolate).GetFieldType(descriptor),
+        target->instance_descriptors(isolate)->GetFieldType(descriptor),
         isolate);
     MapUpdater::GeneralizeField(isolate, target, descriptor,
                                 PropertyConstness::kMutable,
                                 details.representation(), field_type);
     DCHECK_EQ(PropertyConstness::kMutable, target->instance_descriptors(isolate)
-                                               .GetDetails(descriptor)
+                                               ->GetDetails(descriptor)
                                                .constness());
   }
 }
@@ -158,10 +148,10 @@ bool DeleteObjectPropertyFast(Isolate* isolate, Handle<JSReceiver> receiver,
   // prerequisites:
   // (1) The receiver must be a regular object and the key a unique name.
   Handle<Map> receiver_map(receiver->map(), isolate);
-  if (receiver_map->IsSpecialReceiverMap()) return false;
-  DCHECK(receiver_map->IsJSObjectMap());
+  if (IsSpecialReceiverMap(*receiver_map)) return false;
+  DCHECK(IsJSObjectMap(*receiver_map));
 
-  if (!raw_key->IsUniqueName()) return false;
+  if (!IsUniqueName(*raw_key)) return false;
   Handle<Name> key = Handle<Name>::cast(raw_key);
   // (2) The property to be deleted must be the last property.
   int nof = receiver_map->NumberOfOwnDescriptors();
@@ -175,7 +165,7 @@ bool DeleteObjectPropertyFast(Isolate* isolate, Handle<JSReceiver> receiver,
   if (!details.IsConfigurable()) return false;
   // (4) The map must have a back pointer.
   Handle<Object> backpointer(receiver_map->GetBackPointer(), isolate);
-  if (!backpointer->IsMap()) return false;
+  if (!IsMap(*backpointer)) return false;
   Handle<Map> parent_map = Handle<Map>::cast(backpointer);
   // (5) The last transition must have been caused by adding a property
   // (and not any kind of special transition).
@@ -221,7 +211,7 @@ bool DeleteObjectPropertyFast(Isolate* isolate, Handle<JSReceiver> receiver,
 #if VERIFY_HEAP
   if (v8_flags.verify_heap) {
     receiver->HeapObjectVerify(isolate);
-    receiver->property_array().PropertyArrayVerify(isolate);
+    receiver->property_array()->PropertyArrayVerify(isolate);
   }
 #endif
 
@@ -352,14 +342,14 @@ RUNTIME_FUNCTION(Runtime_ObjectHasOwnProperty) {
 
   Handle<Object> object = args.at(0);
 
-  if (object->IsJSModuleNamespace()) {
+  if (IsJSModuleNamespace(*object)) {
     LookupIterator it(isolate, object, key, LookupIterator::OWN);
     PropertyDescriptor desc;
     Maybe<bool> result = JSReceiver::GetOwnPropertyDescriptor(&it, &desc);
     if (!result.IsJust()) return ReadOnlyRoots(isolate).exception();
     return isolate->heap()->ToBoolean(result.FromJust());
 
-  } else if (object->IsJSObject()) {
+  } else if (IsJSObject(*object)) {
     Handle<JSObject> js_obj = Handle<JSObject>::cast(object);
     // Fast case: either the key is a real named property or it is not
     // an array index and there are no interceptors or hidden
@@ -376,10 +366,10 @@ RUNTIME_FUNCTION(Runtime_ObjectHasOwnProperty) {
     }
 
     Map map = js_obj->map();
-    if (!map.IsJSGlobalProxyMap() &&
+    if (!IsJSGlobalProxyMap(map) &&
         (key.is_element() && key.index() <= JSObject::kMaxElementIndex
-             ? !map.has_indexed_interceptor()
-             : !map.has_named_interceptor())) {
+             ? !map->has_indexed_interceptor()
+             : !map->has_named_interceptor())) {
       return ReadOnlyRoots(isolate).false_value();
     }
 
@@ -390,7 +380,7 @@ RUNTIME_FUNCTION(Runtime_ObjectHasOwnProperty) {
     DCHECK(!isolate->has_pending_exception());
     return isolate->heap()->ToBoolean(maybe.FromJust());
 
-  } else if (object->IsJSProxy()) {
+  } else if (IsJSProxy(*object)) {
     LookupIterator it(isolate, object, key, Handle<JSProxy>::cast(object),
                       LookupIterator::OWN);
     Maybe<PropertyAttributes> attributes =
@@ -398,12 +388,12 @@ RUNTIME_FUNCTION(Runtime_ObjectHasOwnProperty) {
     if (attributes.IsNothing()) return ReadOnlyRoots(isolate).exception();
     return isolate->heap()->ToBoolean(attributes.FromJust() != ABSENT);
 
-  } else if (object->IsString()) {
+  } else if (IsString(*object)) {
     return isolate->heap()->ToBoolean(
         key.is_element()
-            ? key.index() < static_cast<size_t>(String::cast(*object).length())
+            ? key.index() < static_cast<size_t>(String::cast(*object)->length())
             : key.name()->Equals(ReadOnlyRoots(isolate).length_string()));
-  } else if (object->IsNullOrUndefined(isolate)) {
+  } else if (IsNullOrUndefined(*object, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kUndefinedOrNullToObject));
   }
@@ -421,7 +411,7 @@ RUNTIME_FUNCTION(Runtime_HasOwnConstDataProperty) {
   PropertyKey key(isolate, property, &success);
   if (!success) return ReadOnlyRoots(isolate).undefined_value();
 
-  if (object->IsJSObject()) {
+  if (IsJSObject(*object)) {
     Handle<JSObject> js_obj = Handle<JSObject>::cast(object);
     LookupIterator it(isolate, js_obj, key, js_obj, LookupIterator::OWN);
 
@@ -449,7 +439,7 @@ RUNTIME_FUNCTION(Runtime_AddDictionaryProperty) {
   Handle<Name> name = args.at<Name>(1);
   Handle<Object> value = args.at(2);
 
-  DCHECK(name->IsUniqueName());
+  DCHECK(IsUniqueName(*name));
 
   PropertyDetails property_details(
       PropertyKind::kData, NONE,
@@ -459,11 +449,16 @@ RUNTIME_FUNCTION(Runtime_AddDictionaryProperty) {
         receiver->property_dictionary_swiss(), isolate);
     dictionary = SwissNameDictionary::Add(isolate, dictionary, name, value,
                                           property_details);
+    // TODO(pthier): Add flags to swiss dictionaries and track interesting
+    // symbols.
     receiver->SetProperties(*dictionary);
   } else {
     Handle<NameDictionary> dictionary(receiver->property_dictionary(), isolate);
     dictionary =
         NameDictionary::Add(isolate, dictionary, name, value, property_details);
+    if (name->IsInteresting(isolate)) {
+      dictionary->set_may_have_interesting_properties(true);
+    }
     receiver->SetProperties(*dictionary);
   }
 
@@ -499,10 +494,16 @@ RUNTIME_FUNCTION(Runtime_AddPrivateBrand) {
     context =
         handle(Context::cast(context->get(Context::PREVIOUS_INDEX)), isolate);
   }
-  DCHECK_EQ(context->scope_info().scope_type(), ScopeType::CLASS_SCOPE);
-  CHECK(Object::AddDataProperty(&it, context, attributes, Just(kDontThrow),
-                                StoreOrigin::kMaybeKeyed)
-            .FromJust());
+  DCHECK_EQ(context->scope_info()->scope_type(), ScopeType::CLASS_SCOPE);
+  Maybe<bool> added_brand = Object::AddDataProperty(
+      &it, context, attributes, Just(kThrowOnError), StoreOrigin::kMaybeKeyed);
+  // Objects in shared space are fixed shape, so private symbols cannot be
+  // added.
+  if (V8_UNLIKELY(IsAlwaysSharedSpaceJSObject(*receiver))) {
+    CHECK(added_brand.IsNothing());
+    return ReadOnlyRoots(isolate).exception();
+  }
+  CHECK(added_brand.IsJust());
   return *receiver;
 }
 
@@ -515,7 +516,7 @@ RUNTIME_FUNCTION(Runtime_ObjectCreate) {
   Handle<Object> properties = args.at(1);
   Handle<JSObject> obj;
   // 1. If Type(O) is neither Object nor Null, throw a TypeError exception.
-  if (!prototype->IsNull(isolate) && !prototype->IsJSReceiver()) {
+  if (!IsNull(*prototype, isolate) && !IsJSReceiver(*prototype)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kProtoObjectOrNull, prototype));
   }
@@ -525,7 +526,7 @@ RUNTIME_FUNCTION(Runtime_ObjectCreate) {
       isolate, obj, JSObject::ObjectCreate(isolate, prototype));
 
   // 3. If Properties is not undefined, then
-  if (!properties->IsUndefined(isolate)) {
+  if (!IsUndefined(*properties, isolate)) {
     // a. Return ? ObjectDefineProperties(obj, Properties).
     // Define the properties if properties was specified and is not undefined.
     RETURN_RESULT_OR_FAILURE(
@@ -539,7 +540,7 @@ MaybeHandle<Object> Runtime::SetObjectProperty(
     Isolate* isolate, Handle<Object> object, Handle<Object> key,
     Handle<Object> value, StoreOrigin store_origin,
     Maybe<ShouldThrow> should_throw) {
-  if (object->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*object, isolate)) {
     MaybeHandle<String> maybe_property =
         Object::NoSideEffectsToMaybeString(isolate, key);
     Handle<String> property_name;
@@ -562,7 +563,7 @@ MaybeHandle<Object> Runtime::SetObjectProperty(
   PropertyKey lookup_key(isolate, key, &success);
   if (!success) return MaybeHandle<Object>();
   LookupIterator it(isolate, object, lookup_key);
-  if (key->IsSymbol() && Symbol::cast(*key).is_private_name()) {
+  if (IsSymbol(*key) && Symbol::cast(*key)->is_private_name()) {
     Maybe<bool> can_store = JSReceiver::CheckPrivateNameStore(&it, false);
     MAYBE_RETURN_NULL(can_store);
     if (!can_store.FromJust()) {
@@ -581,7 +582,7 @@ MaybeHandle<Object> Runtime::DefineObjectOwnProperty(Isolate* isolate,
                                                      Handle<Object> key,
                                                      Handle<Object> value,
                                                      StoreOrigin store_origin) {
-  if (object->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*object, isolate)) {
     THROW_NEW_ERROR(
         isolate,
         NewTypeError(MessageTemplate::kNonObjectPropertyStore, key, object),
@@ -594,7 +595,7 @@ MaybeHandle<Object> Runtime::DefineObjectOwnProperty(Isolate* isolate,
   if (!success) return MaybeHandle<Object>();
   LookupIterator it(isolate, object, lookup_key, LookupIterator::OWN);
 
-  if (key->IsSymbol() && Symbol::cast(*key).is_private_name()) {
+  if (IsSymbol(*key) && Symbol::cast(*key)->is_private_name()) {
     Maybe<bool> can_store = JSReceiver::CheckPrivateNameStore(&it, true);
     MAYBE_RETURN_NULL(can_store);
     // If the state is ACCESS_CHECK, the faliled access check callback
@@ -632,7 +633,7 @@ RUNTIME_FUNCTION(Runtime_OptimizeObjectForAddingMultipleProperties) {
   int properties = args.smi_value_at(1);
   // Conservative upper limit to prevent fuzz tests from going OOM.
   if (properties > 100000) return isolate->ThrowIllegalOperation();
-  if (object->HasFastProperties() && !object->IsJSGlobalProxy()) {
+  if (object->HasFastProperties() && !IsJSGlobalProxy(*object)) {
     JSObject::NormalizeProperties(isolate, object, KEEP_INOBJECT_PROPERTIES,
                                   properties, "OptimizeForAdding");
   }
@@ -701,7 +702,7 @@ RUNTIME_FUNCTION(Runtime_ObjectIsExtensible) {
   Handle<Object> object = args.at(0);
 
   Maybe<bool> result =
-      object->IsJSReceiver()
+      IsJSReceiver(*object)
           ? JSReceiver::IsExtensible(isolate, Handle<JSReceiver>::cast(object))
           : Just(false);
   MAYBE_RETURN(result, ReadOnlyRoots(isolate).exception());
@@ -791,28 +792,28 @@ RUNTIME_FUNCTION(Runtime_GetProperty) {
   // Convert string-index keys to their number variant to avoid internalization
   // below; and speed up subsequent conversion to index.
   uint32_t index;
-  if (key_obj->IsString() && String::cast(*key_obj).AsArrayIndex(&index)) {
+  if (IsString(*key_obj) && String::cast(*key_obj)->AsArrayIndex(&index)) {
     key_obj = isolate->factory()->NewNumberFromUint(index);
   }
-  if (lookup_start_obj->IsJSObject()) {
+  if (IsJSObject(*lookup_start_obj)) {
     Handle<JSObject> lookup_start_object =
         Handle<JSObject>::cast(lookup_start_obj);
-    if (!lookup_start_object->IsJSGlobalProxy() &&
-        !lookup_start_object->IsAccessCheckNeeded() && key_obj->IsName()) {
+    if (!IsJSGlobalProxy(*lookup_start_object) &&
+        !IsAccessCheckNeeded(*lookup_start_object) && IsName(*key_obj)) {
       Handle<Name> key = Handle<Name>::cast(key_obj);
       key_obj = key = isolate->factory()->InternalizeName(key);
 
       DisallowGarbageCollection no_gc;
-      if (lookup_start_object->IsJSGlobalObject()) {
+      if (IsJSGlobalObject(*lookup_start_object)) {
         // Attempt dictionary lookup.
         GlobalDictionary dictionary = JSGlobalObject::cast(*lookup_start_object)
-                                          .global_dictionary(kAcquireLoad);
-        InternalIndex entry = dictionary.FindEntry(isolate, key);
+                                          ->global_dictionary(kAcquireLoad);
+        InternalIndex entry = dictionary->FindEntry(isolate, key);
         if (entry.is_found()) {
-          PropertyCell cell = dictionary.CellAt(entry);
-          if (cell.property_details().kind() == PropertyKind::kData) {
-            Object value = cell.value();
-            if (!value.IsTheHole(isolate)) return value;
+          PropertyCell cell = dictionary->CellAt(entry);
+          if (cell->property_details().kind() == PropertyKind::kData) {
+            Object value = cell->value();
+            if (!IsPropertyCellHole(value, isolate)) return value;
             // If value is the hole (meaning, absent) do the general lookup.
           }
         }
@@ -821,22 +822,22 @@ RUNTIME_FUNCTION(Runtime_GetProperty) {
         if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
           SwissNameDictionary dictionary =
               lookup_start_object->property_dictionary_swiss();
-          InternalIndex entry = dictionary.FindEntry(isolate, *key);
+          InternalIndex entry = dictionary->FindEntry(isolate, *key);
           if (entry.is_found() &&
-              (dictionary.DetailsAt(entry).kind() == PropertyKind::kData)) {
-            return dictionary.ValueAt(entry);
+              (dictionary->DetailsAt(entry).kind() == PropertyKind::kData)) {
+            return dictionary->ValueAt(entry);
           }
         } else {
           NameDictionary dictionary =
               lookup_start_object->property_dictionary();
-          InternalIndex entry = dictionary.FindEntry(isolate, key);
+          InternalIndex entry = dictionary->FindEntry(isolate, key);
           if ((entry.is_found()) &&
-              (dictionary.DetailsAt(entry).kind() == PropertyKind::kData)) {
-            return dictionary.ValueAt(entry);
+              (dictionary->DetailsAt(entry).kind() == PropertyKind::kData)) {
+            return dictionary->ValueAt(entry);
           }
         }
       }
-    } else if (key_obj->IsSmi()) {
+    } else if (IsSmi(*key_obj)) {
       // JSObject without a name key. If the key is a Smi, check for a
       // definite out-of-bounds access to elements, which is a strong indicator
       // that subsequent accesses will also call the runtime. Proactively
@@ -845,7 +846,7 @@ RUNTIME_FUNCTION(Runtime_GetProperty) {
       // become PACKED_DOUBLE_ELEMENTS.
       ElementsKind elements_kind = lookup_start_object->GetElementsKind();
       if (IsDoubleElementsKind(elements_kind)) {
-        if (Smi::ToInt(*key_obj) >= lookup_start_object->elements().length()) {
+        if (Smi::ToInt(*key_obj) >= lookup_start_object->elements()->length()) {
           elements_kind = IsHoleyElementsKind(elements_kind) ? HOLEY_ELEMENTS
                                                              : PACKED_ELEMENTS;
           JSObject::TransitionElementsKind(lookup_start_object, elements_kind);
@@ -855,10 +856,10 @@ RUNTIME_FUNCTION(Runtime_GetProperty) {
                !IsFastElementsKind(elements_kind));
       }
     }
-  } else if (lookup_start_obj->IsString() && key_obj->IsSmi()) {
+  } else if (IsString(*lookup_start_obj) && IsSmi(*key_obj)) {
     // Fast case for string indexing using [] with a smi index.
     Handle<String> str = Handle<String>::cast(lookup_start_obj);
-    int smi_index = Handle<Smi>::cast(key_obj)->value();
+    int smi_index = Smi::cast(*key_obj).value();
     if (smi_index >= 0 && smi_index < str->length()) {
       Factory* factory = isolate->factory();
       return *factory->LookupSingleCharacterStringFromCode(
@@ -961,7 +962,7 @@ RUNTIME_FUNCTION(Runtime_HasProperty) {
   Handle<Object> key = args.at(1);
 
   // Check that {object} is actually a receiver.
-  if (!object->IsJSReceiver()) {
+  if (!IsJSReceiver(*object)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate,
         NewTypeError(MessageTemplate::kInvalidInOperatorUse, key, object));
@@ -999,7 +1000,7 @@ RUNTIME_FUNCTION(Runtime_ToFastProperties) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<Object> object = args.at(0);
-  if (object->IsJSObject() && !object->IsJSGlobalObject()) {
+  if (IsJSObject(*object) && !IsJSGlobalObject(*object)) {
     JSObject::MigrateSlowToFast(Handle<JSObject>::cast(object), 0,
                                 "RuntimeToFastProperties");
   }
@@ -1028,7 +1029,7 @@ RUNTIME_FUNCTION(Runtime_GetDerivedMap) {
   Handle<JSFunction> target = args.at<JSFunction>(0);
   Handle<JSReceiver> new_target = args.at<JSReceiver>(1);
   Handle<Object> rab_gsab = args.at(2);
-  if (rab_gsab->IsTrue()) {
+  if (IsTrue(*rab_gsab)) {
     RETURN_RESULT_OR_FAILURE(
         isolate, JSFunction::GetDerivedRabGsabTypedArrayMap(isolate, target,
                                                             new_target));
@@ -1054,7 +1055,7 @@ RUNTIME_FUNCTION(Runtime_TryMigrateInstance) {
   DCHECK_EQ(1, args.length());
   Handle<JSObject> js_object = args.at<JSObject>(0);
   // It could have been a DCHECK but we call this function directly from tests.
-  if (!js_object->map().is_deprecated()) return Smi::zero();
+  if (!js_object->map()->is_deprecated()) return Smi::zero();
   // This call must not cause lazy deopts, because it's called from deferred
   // code where we can't handle lazy deopts for lack of a suitable bailout
   // ID. So we just try migration and signal failure if necessary,
@@ -1064,7 +1065,7 @@ RUNTIME_FUNCTION(Runtime_TryMigrateInstance) {
 }
 
 static bool IsValidAccessor(Isolate* isolate, Handle<Object> obj) {
-  return obj->IsNullOrUndefined(isolate) || obj->IsCallable();
+  return IsNullOrUndefined(*obj, isolate) || IsCallable(*obj);
 }
 
 // Implements part of 8.12.9 DefineOwnProperty.
@@ -1077,7 +1078,7 @@ RUNTIME_FUNCTION(Runtime_DefineAccessorPropertyUnchecked) {
   HandleScope scope(isolate);
   DCHECK_EQ(5, args.length());
   Handle<JSObject> obj = args.at<JSObject>(0);
-  CHECK(!obj->IsNull(isolate));
+  CHECK(!IsNull(*obj, isolate));
   Handle<Name> name = args.at<Name>(1);
   Handle<Object> getter = args.at(2);
   CHECK(IsValidAccessor(isolate, getter));
@@ -1086,7 +1087,8 @@ RUNTIME_FUNCTION(Runtime_DefineAccessorPropertyUnchecked) {
   auto attrs = PropertyAttributesFromInt(args.smi_value_at(4));
 
   RETURN_FAILURE_ON_EXCEPTION(
-      isolate, JSObject::DefineAccessor(obj, name, getter, setter, attrs));
+      isolate, JSObject::DefineOwnAccessorIgnoreAttributes(obj, name, getter,
+                                                           setter, attrs));
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
@@ -1095,16 +1097,16 @@ RUNTIME_FUNCTION(Runtime_SetFunctionName) {
   DCHECK_EQ(2, args.length());
   Handle<Object> value = args.at(0);
   Handle<Name> name = args.at<Name>(1);
-  DCHECK(value->IsJSFunction());
+  DCHECK(IsJSFunction(*value));
   Handle<JSFunction> function = Handle<JSFunction>::cast(value);
-  DCHECK(!function->shared().HasSharedName());
+  DCHECK(!function->shared()->HasSharedName());
   Handle<Map> function_map(function->map(), isolate);
   if (!JSFunction::SetName(function, name,
                            isolate->factory()->empty_string())) {
     return ReadOnlyRoots(isolate).exception();
   }
   // Class constructors do not reserve in-object space for name field.
-  DCHECK_IMPLIES(!IsClassConstructor(function->shared().kind()),
+  DCHECK_IMPLIES(!IsClassConstructor(function->shared()->kind()),
                  *function_map == function->map());
   return *value;
 }
@@ -1118,14 +1120,14 @@ RUNTIME_FUNCTION(Runtime_DefineKeyedOwnPropertyInLiteral) {
   int flag = args.smi_value_at(3);
   Handle<HeapObject> maybe_vector = args.at<HeapObject>(4);
 
-  if (!maybe_vector->IsUndefined()) {
+  if (!IsUndefined(*maybe_vector)) {
     int index = args.tagged_index_value_at(5);
-    DCHECK(name->IsName());
-    DCHECK(maybe_vector->IsFeedbackVector());
+    DCHECK(IsName(*name));
+    DCHECK(IsFeedbackVector(*maybe_vector));
     Handle<FeedbackVector> vector = Handle<FeedbackVector>::cast(maybe_vector);
     FeedbackNexus nexus(vector, FeedbackVector::ToSlot(index));
     if (nexus.ic_state() == InlineCacheState::UNINITIALIZED) {
-      if (name->IsUniqueName()) {
+      if (IsUniqueName(*name)) {
         nexus.ConfigureMonomorphic(Handle<Name>::cast(name),
                                    handle(object->map(), isolate),
                                    MaybeObjectHandle());
@@ -1142,17 +1144,17 @@ RUNTIME_FUNCTION(Runtime_DefineKeyedOwnPropertyInLiteral) {
   DefineKeyedOwnPropertyInLiteralFlags flags(flag);
 
   if (flags & DefineKeyedOwnPropertyInLiteralFlag::kSetFunctionName) {
-    DCHECK(name->IsName());
-    DCHECK(value->IsJSFunction());
+    DCHECK(IsName(*name));
+    DCHECK(IsJSFunction(*value));
     Handle<JSFunction> function = Handle<JSFunction>::cast(value);
-    DCHECK(!function->shared().HasSharedName());
+    DCHECK(!function->shared()->HasSharedName());
     Handle<Map> function_map(function->map(), isolate);
     if (!JSFunction::SetName(function, Handle<Name>::cast(name),
                              isolate->factory()->empty_string())) {
       return ReadOnlyRoots(isolate).exception();
     }
     // Class constructors do not reserve in-object space for name field.
-    DCHECK_IMPLIES(!IsClassConstructor(function->shared().kind()),
+    DCHECK_IMPLIES(!IsClassConstructor(function->shared()->kind()),
                    *function_map == function->map());
   }
 
@@ -1178,14 +1180,14 @@ RUNTIME_FUNCTION(Runtime_HasFastPackedElements) {
   DCHECK_EQ(1, args.length());
   auto obj = HeapObject::cast(args[0]);
   return isolate->heap()->ToBoolean(
-      IsFastPackedElementsKind(obj.map().elements_kind()));
+      IsFastPackedElementsKind(obj->map()->elements_kind()));
 }
 
 RUNTIME_FUNCTION(Runtime_IsJSReceiver) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
   Object obj = args[0];
-  return isolate->heap()->ToBoolean(obj.IsJSReceiver());
+  return isolate->heap()->ToBoolean(IsJSReceiver(obj));
 }
 
 RUNTIME_FUNCTION(Runtime_GetFunctionName) {
@@ -1203,7 +1205,7 @@ RUNTIME_FUNCTION(Runtime_DefineGetterPropertyUnchecked) {
   Handle<JSFunction> getter = args.at<JSFunction>(2);
   auto attrs = PropertyAttributesFromInt(args.smi_value_at(3));
 
-  if (String::cast(getter->shared().Name()).length() == 0) {
+  if (String::cast(getter->shared()->Name())->length() == 0) {
     Handle<Map> getter_map(getter->map(), isolate);
     if (!JSFunction::SetName(getter, name, isolate->factory()->get_string())) {
       return ReadOnlyRoots(isolate).exception();
@@ -1213,8 +1215,8 @@ RUNTIME_FUNCTION(Runtime_DefineGetterPropertyUnchecked) {
 
   RETURN_FAILURE_ON_EXCEPTION(
       isolate,
-      JSObject::DefineAccessor(object, name, getter,
-                               isolate->factory()->null_value(), attrs));
+      JSObject::DefineOwnAccessorIgnoreAttributes(
+          object, name, getter, isolate->factory()->null_value(), attrs));
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
@@ -1225,7 +1227,7 @@ RUNTIME_FUNCTION(Runtime_SetDataProperties) {
   Handle<Object> source = args.at(1);
 
   // 2. If source is undefined or null, let keys be an empty List.
-  if (source->IsUndefined(isolate) || source->IsNull(isolate)) {
+  if (IsUndefined(*source, isolate) || IsNull(*source, isolate)) {
     return ReadOnlyRoots(isolate).undefined_value();
   }
 
@@ -1243,7 +1245,7 @@ RUNTIME_FUNCTION(Runtime_CopyDataProperties) {
   Handle<Object> source = args.at(1);
 
   // 2. If source is undefined or null, let keys be an empty List.
-  if (source->IsUndefined(isolate) || source->IsNull(isolate)) {
+  if (IsUndefined(*source, isolate) || IsNull(*source, isolate)) {
     return ReadOnlyRoots(isolate).undefined_value();
   }
 
@@ -1306,7 +1308,7 @@ RUNTIME_FUNCTION(Runtime_CopyDataPropertiesWithExcludedPropertiesOnStack) {
       excluded_property_count);
 
   // If source is undefined or null, throw a non-coercible error.
-  if (source->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*source, isolate)) {
     return ErrorUtils::ThrowLoadFromNullOrUndefined(isolate, source,
                                                     MaybeHandle<Object>());
   }
@@ -1322,8 +1324,8 @@ RUNTIME_FUNCTION(Runtime_CopyDataPropertiesWithExcludedPropertiesOnStack) {
     // properties resolving to numbers, which would've been strings
     // instead because of our call to %ToName() in the desugaring for
     // computed properties.
-    if (property->IsString() &&
-        String::cast(*property).AsArrayIndex(&property_num)) {
+    if (IsString(*property) &&
+        String::cast(*property)->AsArrayIndex(&property_num)) {
       property = isolate->factory()->NewNumberFromUint(property_num);
     }
 
@@ -1348,7 +1350,7 @@ RUNTIME_FUNCTION(Runtime_DefineSetterPropertyUnchecked) {
   Handle<JSFunction> setter = args.at<JSFunction>(2);
   auto attrs = PropertyAttributesFromInt(args.smi_value_at(3));
 
-  if (String::cast(setter->shared().Name()).length() == 0) {
+  if (String::cast(setter->shared()->Name())->length() == 0) {
     Handle<Map> setter_map(setter->map(), isolate);
     if (!JSFunction::SetName(setter, name, isolate->factory()->set_string())) {
       return ReadOnlyRoots(isolate).exception();
@@ -1358,8 +1360,8 @@ RUNTIME_FUNCTION(Runtime_DefineSetterPropertyUnchecked) {
 
   RETURN_FAILURE_ON_EXCEPTION(
       isolate,
-      JSObject::DefineAccessor(object, name, isolate->factory()->null_value(),
-                               setter, attrs));
+      JSObject::DefineOwnAccessorIgnoreAttributes(
+          object, name, isolate->factory()->null_value(), setter, attrs));
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
@@ -1409,7 +1411,7 @@ RUNTIME_FUNCTION(Runtime_HasInPrototypeChain) {
   DCHECK_EQ(2, args.length());
   Handle<Object> object = args.at(0);
   Handle<Object> prototype = args.at(1);
-  if (!object->IsJSReceiver()) return ReadOnlyRoots(isolate).false_value();
+  if (!IsJSReceiver(*object)) return ReadOnlyRoots(isolate).false_value();
   Maybe<bool> result = JSReceiver::HasInPrototypeChain(
       isolate, Handle<JSReceiver>::cast(object), prototype);
   MAYBE_RETURN(result, ReadOnlyRoots(isolate).exception());
@@ -1422,8 +1424,8 @@ RUNTIME_FUNCTION(Runtime_CreateIterResultObject) {
   DCHECK_EQ(2, args.length());
   Handle<Object> value = args.at(0);
   Handle<Object> done = args.at(1);
-  return *isolate->factory()->NewJSIteratorResult(value,
-                                                  done->BooleanValue(isolate));
+  return *isolate->factory()->NewJSIteratorResult(
+      value, Object::BooleanValue(*done, isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_CreateDataProperty) {
@@ -1518,9 +1520,9 @@ void CollectPrivateMethodsAndAccessorsFromContext(
 
   Handle<Object> slot_value(context->get(context_index), isolate);
   DCHECK_IMPLIES(lookup_result.mode == VariableMode::kPrivateMethod,
-                 slot_value->IsJSFunction());
+                 IsJSFunction(*slot_value));
   DCHECK_IMPLIES(lookup_result.mode != VariableMode::kPrivateMethod,
-                 slot_value->IsAccessorPair());
+                 IsAccessorPair(*slot_value));
   results->push_back({
       lookup_result.mode == VariableMode::kPrivateMethod
           ? PrivateMemberType::kPrivateMethod
@@ -1542,12 +1544,12 @@ Maybe<bool> CollectPrivateMembersFromReceiver(
                               key_filter, GetKeysConversion::kConvertToString),
       Nothing<bool>());
 
-  if (receiver->IsJSFunction()) {
+  if (IsJSFunction(*receiver)) {
     Handle<JSFunction> func(JSFunction::cast(*receiver), isolate);
     Handle<SharedFunctionInfo> shared(func->shared(), isolate);
     if (shared->is_class_constructor() &&
         shared->has_static_private_methods_or_accessors()) {
-      Handle<Context> recevier_context(JSFunction::cast(*receiver).context(),
+      Handle<Context> recevier_context(JSFunction::cast(*receiver)->context(),
                                        isolate);
       CollectPrivateMethodsAndAccessorsFromContext(
           isolate, recevier_context, desc, func, IsStaticFlag::kStatic,
@@ -1625,13 +1627,13 @@ MaybeHandle<Object> Runtime::GetPrivateMember(Isolate* isolate,
       // The accessors are collected from the contexts, so there is no need to
       // perform brand checks.
       Handle<AccessorPair> pair = Handle<AccessorPair>::cast(result.value);
-      if (pair->getter().IsNull()) {
+      if (IsNull(pair->getter())) {
         THROW_NEW_ERROR(
             isolate,
             NewError(MessageTemplate::kInvalidPrivateGetterAccess, desc),
             Object);
       }
-      DCHECK(pair->getter().IsJSFunction());
+      DCHECK(IsJSFunction(pair->getter()));
       Handle<JSFunction> getter(JSFunction::cast(pair->getter()), isolate);
       return Execution::Call(isolate, getter, receiver, 0, nullptr);
     }
@@ -1663,13 +1665,13 @@ MaybeHandle<Object> Runtime::SetPrivateMember(Isolate* isolate,
       // The accessors are collected from the contexts, so there is no need to
       // perform brand checks.
       Handle<AccessorPair> pair = Handle<AccessorPair>::cast(result.value);
-      if (pair->setter().IsNull()) {
+      if (IsNull(pair->setter())) {
         THROW_NEW_ERROR(
             isolate,
             NewError(MessageTemplate::kInvalidPrivateSetterAccess, desc),
             Object);
       }
-      DCHECK(pair->setter().IsJSFunction());
+      DCHECK(IsJSFunction(pair->setter()));
       Handle<Object> argv[] = {value};
       Handle<JSFunction> setter(JSFunction::cast(pair->setter()), isolate);
       return Execution::Call(isolate, setter, receiver, arraysize(argv), argv);
@@ -1684,7 +1686,7 @@ RUNTIME_FUNCTION(Runtime_GetPrivateMember) {
   DCHECK_EQ(args.length(), 2);
   Handle<Object> receiver = args.at<Object>(0);
   Handle<String> desc = args.at<String>(1);
-  if (receiver->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*receiver, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNonObjectPrivateNameAccess,
                               desc, receiver));
@@ -1701,7 +1703,7 @@ RUNTIME_FUNCTION(Runtime_SetPrivateMember) {
   DCHECK_EQ(args.length(), 3);
   Handle<Object> receiver = args.at<Object>(0);
   Handle<String> desc = args.at<String>(1);
-  if (receiver->IsNullOrUndefined(isolate)) {
+  if (IsNullOrUndefined(*receiver, isolate)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNonObjectPrivateNameAccess,
                               desc, receiver));
@@ -1716,7 +1718,7 @@ RUNTIME_FUNCTION(Runtime_LoadPrivateSetter) {
   HandleScope scope(isolate);
   DCHECK_EQ(args.length(), 1);
   Handle<AccessorPair> pair = args.at<AccessorPair>(0);
-  DCHECK(pair->setter().IsJSFunction());
+  DCHECK(IsJSFunction(pair->setter()));
   return pair->setter();
 }
 
@@ -1724,15 +1726,15 @@ RUNTIME_FUNCTION(Runtime_LoadPrivateGetter) {
   HandleScope scope(isolate);
   DCHECK_EQ(args.length(), 1);
   Handle<AccessorPair> pair = args.at<AccessorPair>(0);
-  DCHECK(pair->getter().IsJSFunction());
+  DCHECK(IsJSFunction(pair->getter()));
   return pair->getter();
 }
 
 RUNTIME_FUNCTION(Runtime_CreatePrivateAccessors) {
   HandleScope scope(isolate);
   DCHECK_EQ(args.length(), 2);
-  DCHECK(args[0].IsNull() || args[0].IsJSFunction());
-  DCHECK(args[1].IsNull() || args[1].IsJSFunction());
+  DCHECK(IsNull(args[0]) || IsJSFunction(args[0]));
+  DCHECK(IsNull(args[1]) || IsJSFunction(args[1]));
   Handle<AccessorPair> pair = isolate->factory()->NewAccessorPair();
   pair->SetComponents(args[0], args[1]);
   return *pair;
@@ -1757,7 +1759,7 @@ RUNTIME_FUNCTION(Runtime_SwissTableAdd) {
   Handle<Object> value = args.at(2);
   PropertyDetails details(Smi::cast(args[3]));
 
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
 
   return *SwissNameDictionary::Add(isolate, table, key, value, details);
 }
@@ -1769,7 +1771,7 @@ RUNTIME_FUNCTION(Runtime_SwissTableFindEntry) {
   DisallowGarbageCollection no_gc;
   auto table = SwissNameDictionary::cast(args[0]);
   Name key = Name::cast(args[1]);
-  InternalIndex index = table.FindEntry(isolate, key);
+  InternalIndex index = table->FindEntry(isolate, key);
   return Smi::FromInt(index.is_found()
                           ? index.as_int()
                           : SwissNameDictionary::kNotFoundSentinel);
@@ -1783,10 +1785,10 @@ RUNTIME_FUNCTION(Runtime_SwissTableUpdate) {
   auto table = SwissNameDictionary::cast(args[0]);
   InternalIndex index(args.smi_value_at(1));
   Object value = args[2];
-  table.ValueAtPut(index, value);
+  table->ValueAtPut(index, value);
 
   PropertyDetails details(Smi::cast(args[3]));
-  table.DetailsAtPut(index, details);
+  table->DetailsAtPut(index, details);
 
   return ReadOnlyRoots(isolate).undefined_value();
 }
@@ -1808,7 +1810,7 @@ RUNTIME_FUNCTION(Runtime_SwissTableEquals) {
   DisallowGarbageCollection no_gc;
   auto table = SwissNameDictionary::cast(args[0]);
   auto other = SwissNameDictionary::cast(args[0]);
-  return Smi::FromInt(table.EqualsForTesting(other));
+  return Smi::FromInt(table->EqualsForTesting(other));
 }
 
 // TODO(v8:11330) This is only here while the CSA/Torque implementaton of
@@ -1817,7 +1819,7 @@ RUNTIME_FUNCTION(Runtime_SwissTableElementsCount) {
   HandleScope scope(isolate);
   DisallowGarbageCollection no_gc;
   auto table = SwissNameDictionary::cast(args[0]);
-  return Smi::FromInt(table.NumberOfElements());
+  return Smi::FromInt(table->NumberOfElements());
 }
 
 // TODO(v8:11330) This is only here while the CSA/Torque implementaton of
@@ -1827,7 +1829,7 @@ RUNTIME_FUNCTION(Runtime_SwissTableKeyAt) {
   DisallowGarbageCollection no_gc;
   auto table = SwissNameDictionary::cast(args[0]);
   InternalIndex index(args.smi_value_at(1));
-  return table.KeyAt(index);
+  return table->KeyAt(index);
 }
 
 // TODO(v8:11330) This is only here while the CSA/Torque implementaton of
@@ -1837,7 +1839,7 @@ RUNTIME_FUNCTION(Runtime_SwissTableValueAt) {
   DisallowGarbageCollection no_gc;
   auto table = SwissNameDictionary::cast(args[0]);
   InternalIndex index(args.smi_value_at(1));
-  return table.ValueAt(index);
+  return table->ValueAt(index);
 }
 
 // TODO(v8:11330) This is only here while the CSA/Torque implementaton of
@@ -1847,7 +1849,7 @@ RUNTIME_FUNCTION(Runtime_SwissTableDetailsAt) {
   DisallowGarbageCollection no_gc;
   auto table = SwissNameDictionary::cast(args[0]);
   InternalIndex index(args.smi_value_at(1));
-  PropertyDetails d = table.DetailsAt(index);
+  PropertyDetails d = table->DetailsAt(index);
   return d.AsSmi();
 }
 
diff --git a/deps/v8/src/runtime/runtime-operators.cc b/deps/v8/src/runtime/runtime-operators.cc
index 1d44f671b20b4e..d009f770da6320 100644
--- a/deps/v8/src/runtime/runtime-operators.cc
+++ b/deps/v8/src/runtime/runtime-operators.cc
@@ -43,7 +43,7 @@ RUNTIME_FUNCTION(Runtime_StrictEqual) {
   DCHECK_EQ(2, args.length());
   Object x = args[0];
   Object y = args[1];
-  return isolate->heap()->ToBoolean(x.StrictEquals(y));
+  return isolate->heap()->ToBoolean(Object::StrictEquals(x, y));
 }
 
 RUNTIME_FUNCTION(Runtime_StrictNotEqual) {
@@ -51,7 +51,7 @@ RUNTIME_FUNCTION(Runtime_StrictNotEqual) {
   DCHECK_EQ(2, args.length());
   Object x = args[0];
   Object y = args[1];
-  return isolate->heap()->ToBoolean(!x.StrictEquals(y));
+  return isolate->heap()->ToBoolean(!Object::StrictEquals(x, y));
 }
 
 RUNTIME_FUNCTION(Runtime_ReferenceEqual) {
diff --git a/deps/v8/src/runtime/runtime-promise.cc b/deps/v8/src/runtime/runtime-promise.cc
index 5fa806068b5185..c8e030d9bc12b0 100644
--- a/deps/v8/src/runtime/runtime-promise.cc
+++ b/deps/v8/src/runtime/runtime-promise.cc
@@ -74,7 +74,7 @@ RUNTIME_FUNCTION(Runtime_EnqueueMicrotask) {
   Handle<CallableTask> microtask = isolate->factory()->NewCallableTask(
       function, handle(function->native_context(), isolate));
   MicrotaskQueue* microtask_queue =
-      function->native_context().microtask_queue();
+      function->native_context()->microtask_queue();
   if (microtask_queue) microtask_queue->EnqueueMicrotask(*microtask);
   return ReadOnlyRoots(isolate).undefined_value();
 }
@@ -89,8 +89,8 @@ RUNTIME_FUNCTION(Runtime_PerformMicrotaskCheckpoint) {
 RUNTIME_FUNCTION(Runtime_RunMicrotaskCallback) {
   HandleScope scope(isolate);
   DCHECK_EQ(2, args.length());
-  Object microtask_callback = args[0];
-  Object microtask_data = args[1];
+  Tagged<Object> microtask_callback = args[0];
+  Tagged<Object> microtask_data = args[1];
   MicrotaskCallback callback = ToCData<MicrotaskCallback>(microtask_callback);
   void* data = ToCData<void*>(microtask_data);
   callback(data);
@@ -119,7 +119,7 @@ RUNTIME_FUNCTION(Runtime_PromiseHookBefore) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSReceiver> promise = args.at<JSReceiver>(0);
-  if (promise->IsJSPromise()) {
+  if (IsJSPromise(*promise)) {
     isolate->OnPromiseBefore(Handle<JSPromise>::cast(promise));
   }
   return ReadOnlyRoots(isolate).undefined_value();
@@ -129,7 +129,7 @@ RUNTIME_FUNCTION(Runtime_PromiseHookAfter) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<JSReceiver> promise = args.at<JSReceiver>(0);
-  if (promise->IsJSPromise()) {
+  if (IsJSPromise(*promise)) {
     isolate->OnPromiseAfter(Handle<JSPromise>::cast(promise));
   }
   return ReadOnlyRoots(isolate).undefined_value();
@@ -140,9 +140,9 @@ RUNTIME_FUNCTION(Runtime_RejectPromise) {
   DCHECK_EQ(3, args.length());
   Handle<JSPromise> promise = args.at<JSPromise>(0);
   Handle<Object> reason = args.at(1);
-  Handle<Oddball> debug_event = args.at<Oddball>(2);
+  Handle<Boolean> debug_event = args.at<Boolean>(2);
   return *JSPromise::Reject(promise, reason,
-                            debug_event->BooleanValue(isolate));
+                            Object::BooleanValue(*debug_event, isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_ResolvePromise) {
diff --git a/deps/v8/src/runtime/runtime-proxy.cc b/deps/v8/src/runtime/runtime-proxy.cc
index 19151abc9c1df6..627f405f28d8f0 100644
--- a/deps/v8/src/runtime/runtime-proxy.cc
+++ b/deps/v8/src/runtime/runtime-proxy.cc
@@ -14,22 +14,22 @@ namespace internal {
 RUNTIME_FUNCTION(Runtime_IsJSProxy) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
-  Object obj = args[0];
-  return isolate->heap()->ToBoolean(obj.IsJSProxy());
+  Tagged<Object> obj = args[0];
+  return isolate->heap()->ToBoolean(IsJSProxy(obj));
 }
 
 RUNTIME_FUNCTION(Runtime_JSProxyGetHandler) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
   auto proxy = JSProxy::cast(args[0]);
-  return proxy.handler();
+  return proxy->handler();
 }
 
 RUNTIME_FUNCTION(Runtime_JSProxyGetTarget) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
   auto proxy = JSProxy::cast(args[0]);
-  return proxy.target();
+  return proxy->target();
 }
 
 RUNTIME_FUNCTION(Runtime_GetPropertyWithReceiver) {
diff --git a/deps/v8/src/runtime/runtime-regexp.cc b/deps/v8/src/runtime/runtime-regexp.cc
index 52cc7f653a5db1..0095b6f2b5491f 100644
--- a/deps/v8/src/runtime/runtime-regexp.cc
+++ b/deps/v8/src/runtime/runtime-regexp.cc
@@ -38,14 +38,13 @@ uint32_t GetArgcForReplaceCallable(uint32_t num_captures,
                                    bool has_named_captures) {
   const uint32_t kAdditionalArgsWithoutNamedCaptures = 2;
   const uint32_t kAdditionalArgsWithNamedCaptures = 3;
-  if (num_captures > InstructionStream::kMaxArguments) return -1;
+  if (num_captures > Code::kMaxArguments) return -1;
   uint32_t argc = has_named_captures
                       ? num_captures + kAdditionalArgsWithNamedCaptures
                       : num_captures + kAdditionalArgsWithoutNamedCaptures;
-  static_assert(InstructionStream::kMaxArguments <
-                std::numeric_limits<uint32_t>::max() -
-                    kAdditionalArgsWithNamedCaptures);
-  return (argc > InstructionStream::kMaxArguments) ? -1 : argc;
+  static_assert(Code::kMaxArguments < std::numeric_limits<uint32_t>::max() -
+                                          kAdditionalArgsWithNamedCaptures);
+  return (argc > Code::kMaxArguments) ? -1 : argc;
 }
 
 // Looks up the capture of the given name. Returns the (1-based) numbered
@@ -56,17 +55,17 @@ int LookupNamedCapture(const std::function<bool(String)>& name_matches,
   // internalized strings.
 
   int maybe_capture_index = -1;
-  const int named_capture_count = capture_name_map.length() >> 1;
+  const int named_capture_count = capture_name_map->length() >> 1;
   for (int j = 0; j < named_capture_count; j++) {
     // The format of {capture_name_map} is documented at
     // JSRegExp::kIrregexpCaptureNameMapIndex.
     const int name_ix = j * 2;
     const int index_ix = j * 2 + 1;
 
-    String capture_name = String::cast(capture_name_map.get(name_ix));
+    String capture_name = String::cast(capture_name_map->get(name_ix));
     if (!name_matches(capture_name)) continue;
 
-    maybe_capture_index = Smi::ToInt(capture_name_map.get(index_ix));
+    maybe_capture_index = Smi::ToInt(capture_name_map->get(index_ix));
     break;
   }
 
@@ -335,7 +334,7 @@ bool CompiledReplacement::Compile(Isolate* isolate, Handle<JSRegExp> regexp,
     if (capture_count > 0) {
       DCHECK(JSRegExp::TypeSupportsCaptures(regexp->type_tag()));
       Object maybe_capture_name_map = regexp->capture_name_map();
-      if (maybe_capture_name_map.IsFixedArray()) {
+      if (IsFixedArray(maybe_capture_name_map)) {
         capture_name_map = FixedArray::cast(maybe_capture_name_map);
       }
     }
@@ -469,8 +468,8 @@ void FindStringIndicesDispatch(Isolate* isolate, String subject, String pattern,
                                std::vector<int>* indices, unsigned int limit) {
   {
     DisallowGarbageCollection no_gc;
-    String::FlatContent subject_content = subject.GetFlatContent(no_gc);
-    String::FlatContent pattern_content = pattern.GetFlatContent(no_gc);
+    String::FlatContent subject_content = subject->GetFlatContent(no_gc);
+    String::FlatContent pattern_content = pattern->GetFlatContent(no_gc);
     DCHECK(subject_content.IsFlat());
     DCHECK(pattern_content.IsFlat());
     if (subject_content.IsOneByte()) {
@@ -553,7 +552,7 @@ V8_WARN_UNUSED_RESULT static Object StringReplaceGlobalAtomRegExpWithString(
   DCHECK_EQ(JSRegExp::ATOM, pattern_regexp->type_tag());
   String pattern = pattern_regexp->atom_pattern();
   int subject_len = subject->length();
-  int pattern_len = pattern.length();
+  int pattern_len = pattern->length();
   int replacement_len = replacement->length();
 
   FindStringIndicesDispatch(isolate, *subject, pattern, indices, 0xFFFFFFFF);
@@ -846,9 +845,9 @@ RUNTIME_FUNCTION(Runtime_StringSplit) {
   // Create JSArray of substrings separated by separator.
   int part_count = static_cast<int>(indices->size());
 
-  Handle<JSArray> result =
-      isolate->factory()->NewJSArray(PACKED_ELEMENTS, part_count, part_count,
-                                     INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
+  Handle<JSArray> result = isolate->factory()->NewJSArray(
+      PACKED_ELEMENTS, part_count, part_count,
+      ArrayStorageAllocationMode::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
 
   DCHECK(result->HasObjectElements());
 
@@ -916,7 +915,7 @@ RUNTIME_FUNCTION(Runtime_RegExpExec) {
   Handle<JSRegExp> regexp = args.at<JSRegExp>(0);
   Handle<String> subject = args.at<String>(1);
   int32_t index = 0;
-  CHECK(args[2].ToInt32(&index));
+  CHECK(Object::ToInt32(args[2], &index));
   Handle<RegExpMatchInfo> last_match_info = args.at<RegExpMatchInfo>(3);
   RETURN_RESULT_OR_FAILURE(
       isolate, RegExpExec(isolate, regexp, subject, index, last_match_info,
@@ -929,7 +928,7 @@ RUNTIME_FUNCTION(Runtime_RegExpExecTreatMatchAtEndAsFailure) {
   Handle<JSRegExp> regexp = args.at<JSRegExp>(0);
   Handle<String> subject = args.at<String>(1);
   int32_t index = 0;
-  CHECK(args[2].ToInt32(&index));
+  CHECK(Object::ToInt32(args[2], &index));
   Handle<RegExpMatchInfo> last_match_info = args.at<RegExpMatchInfo>(3);
   RETURN_RESULT_OR_FAILURE(
       isolate, RegExpExec(isolate, regexp, subject, index, last_match_info,
@@ -942,7 +941,7 @@ RUNTIME_FUNCTION(Runtime_RegExpExperimentalOneshotExec) {
   Handle<JSRegExp> regexp = args.at<JSRegExp>(0);
   Handle<String> subject = args.at<String>(1);
   int32_t index = 0;
-  CHECK(args[2].ToInt32(&index));
+  CHECK(Object::ToInt32(args[2], &index));
   Handle<RegExpMatchInfo> last_match_info = args.at<RegExpMatchInfo>(3);
   RETURN_RESULT_OR_FAILURE(
       isolate,
@@ -957,7 +956,7 @@ RUNTIME_FUNCTION(
   Handle<JSRegExp> regexp = args.at<JSRegExp>(0);
   Handle<String> subject = args.at<String>(1);
   int32_t index = 0;
-  CHECK(args[2].ToInt32(&index));
+  CHECK(Object::ToInt32(args[2], &index));
   Handle<RegExpMatchInfo> last_match_info = args.at<RegExpMatchInfo>(3);
   RETURN_RESULT_OR_FAILURE(
       isolate,
@@ -990,7 +989,7 @@ class MatchInfoBackedMatch : public String::Match {
 
     if (JSRegExp::TypeSupportsCaptures(regexp->type_tag())) {
       Object o = regexp->capture_name_map();
-      has_named_captures_ = o.IsFixedArray();
+      has_named_captures_ = IsFixedArray(o);
       if (has_named_captures_) {
         capture_name_map_ = handle(FixedArray::cast(o), isolate);
       }
@@ -1031,7 +1030,7 @@ class MatchInfoBackedMatch : public String::Match {
                                       CaptureState* state) override {
     DCHECK(has_named_captures_);
     const int capture_index = LookupNamedCapture(
-        [=](String capture_name) { return capture_name.Equals(*name); },
+        [=](String capture_name) { return capture_name->Equals(*name); },
         *capture_name_map_);
 
     if (capture_index == -1) {
@@ -1077,8 +1076,8 @@ class VectorBackedMatch : public String::Match {
         captures_(captures) {
     subject_ = String::Flatten(isolate, subject);
 
-    DCHECK(groups_obj->IsUndefined(isolate) || groups_obj->IsJSReceiver());
-    has_named_captures_ = !groups_obj->IsUndefined(isolate);
+    DCHECK(IsUndefined(*groups_obj, isolate) || IsJSReceiver(*groups_obj));
+    has_named_captures_ = !IsUndefined(*groups_obj, isolate);
     if (has_named_captures_) groups_obj_ = Handle<JSReceiver>::cast(groups_obj);
   }
 
@@ -1100,7 +1099,7 @@ class VectorBackedMatch : public String::Match {
 
   MaybeHandle<String> GetCapture(int i, bool* capture_exists) override {
     Handle<Object> capture_obj = captures_[i];
-    if (capture_obj->IsUndefined(isolate_)) {
+    if (IsUndefined(*capture_obj, isolate_)) {
       *capture_exists = false;
       return isolate_->factory()->empty_string();
     }
@@ -1116,7 +1115,7 @@ class VectorBackedMatch : public String::Match {
     ASSIGN_RETURN_ON_EXCEPTION(isolate_, capture_obj,
                                Object::GetProperty(isolate_, groups_obj_, name),
                                String);
-    if (capture_obj->IsUndefined(isolate_)) {
+    if (IsUndefined(*capture_obj, isolate_)) {
       *state = UNMATCHED;
       return isolate_->factory()->empty_string();
     } else {
@@ -1154,7 +1153,7 @@ Handle<JSObject> ConstructNamedCaptureGroupsObject(
     DCHECK_GE(capture_ix, 1);  // Explicit groups start at index 1.
 
     Handle<Object> capture_value(f_get_capture(capture_ix), isolate);
-    DCHECK(capture_value->IsUndefined(isolate) || capture_value->IsString());
+    DCHECK(IsUndefined(*capture_value, isolate) || IsString(*capture_value));
 
     JSObject::AddProperty(isolate, groups, capture_name, capture_value, NONE);
   }
@@ -1195,12 +1194,12 @@ static Object SearchRegExpMultiple(Isolate* isolate, Handle<String> subject,
     Object cached_answer = RegExpResultsCache::Lookup(
         isolate->heap(), *subject, regexp->data(), &last_match_cache,
         RegExpResultsCache::REGEXP_MULTIPLE_INDICES);
-    if (cached_answer.IsFixedArray()) {
+    if (IsFixedArray(cached_answer)) {
       int capture_registers = JSRegExp::RegistersForCaptureCount(capture_count);
       std::unique_ptr<int32_t[]> last_match(new int32_t[capture_registers]);
       int32_t* raw_last_match = last_match.get();
       for (int i = 0; i < capture_registers; i++) {
-        raw_last_match[i] = Smi::ToInt(last_match_cache.get(i));
+        raw_last_match[i] = Smi::ToInt(last_match_cache->get(i));
       }
       Handle<FixedArray> cached_fixed_array =
           Handle<FixedArray>(FixedArray::cast(cached_answer), isolate);
@@ -1256,7 +1255,7 @@ static Object SearchRegExpMultiple(Isolate* isolate, Handle<String> subject,
         // named captures, they are also passed as the last argument.
 
         Handle<Object> maybe_capture_map(regexp->capture_name_map(), isolate);
-        const bool has_named_captures = maybe_capture_map->IsFixedArray();
+        const bool has_named_captures = IsFixedArray(*maybe_capture_map);
 
         const int argc =
             has_named_captures ? 4 + capture_count : 3 + capture_count;
@@ -1377,7 +1376,7 @@ V8_WARN_UNUSED_RESULT MaybeHandle<String> RegExpReplace(
           String);
     }
 
-    if (match_indices_obj->IsNull(isolate)) {
+    if (IsNull(*match_indices_obj, isolate)) {
       if (sticky) regexp->set_last_index(Smi::zero(), SKIP_WRITE_BARRIER);
       return string;
     }
@@ -1441,7 +1440,7 @@ V8_WARN_UNUSED_RESULT MaybeHandle<String> RegExpReplace(
 
     Object result = StringReplaceGlobalRegExpWithString(
         isolate, string, regexp, replace, last_match_info);
-    if (result.IsString()) {
+    if (IsString(result)) {
       return handle(String::cast(result), isolate);
     } else {
       return MaybeHandle<String>();
@@ -1487,7 +1486,7 @@ RUNTIME_FUNCTION(Runtime_StringReplaceNonGlobalRegExpWithFunction) {
   Handle<JSReceiver> replace_obj = args.at<JSReceiver>(2);
 
   DCHECK(RegExpUtils::IsUnmodifiedRegExp(isolate, regexp));
-  DCHECK(replace_obj->map().is_callable());
+  DCHECK(replace_obj->map()->is_callable());
 
   Factory* factory = isolate->factory();
   Handle<RegExpMatchInfo> last_match_info = isolate->regexp_last_match_info();
@@ -1517,7 +1516,7 @@ RUNTIME_FUNCTION(Runtime_StringReplaceNonGlobalRegExpWithFunction) {
         RegExp::Exec(isolate, regexp, subject, last_index, last_match_info));
   }
 
-  if (match_indices_obj->IsNull(isolate)) {
+  if (IsNull(*match_indices_obj, isolate)) {
     if (sticky) regexp->set_last_index(Smi::zero(), SKIP_WRITE_BARRIER);
     return *subject;
   }
@@ -1548,7 +1547,7 @@ RUNTIME_FUNCTION(Runtime_StringReplaceNonGlobalRegExpWithFunction) {
     DCHECK(JSRegExp::TypeSupportsCaptures(regexp->type_tag()));
 
     Object maybe_capture_map = regexp->capture_name_map();
-    if (maybe_capture_map.IsFixedArray()) {
+    if (IsFixedArray(maybe_capture_map)) {
       has_named_captures = true;
       capture_map = handle(FixedArray::cast(maybe_capture_map), isolate);
     }
@@ -1605,7 +1604,7 @@ namespace {
 V8_WARN_UNUSED_RESULT MaybeHandle<Object> ToUint32(Isolate* isolate,
                                                    Handle<Object> object,
                                                    uint32_t* out) {
-  if (object->IsUndefined(isolate)) {
+  if (IsUndefined(*object, isolate)) {
     *out = kMaxUInt32;
     return object;
   }
@@ -1694,7 +1693,7 @@ RUNTIME_FUNCTION(Runtime_RegExpSplit) {
         isolate, result, RegExpUtils::RegExpExec(isolate, splitter, string,
                                                  factory->undefined_value()));
 
-    if (!result->IsNull(isolate)) return *factory->NewJSArray(0);
+    if (!IsNull(*result, isolate)) return *factory->NewJSArray(0);
 
     Handle<FixedArray> elems = factory->NewFixedArray(1);
     elems->set(0, *string);
@@ -1716,7 +1715,7 @@ RUNTIME_FUNCTION(Runtime_RegExpSplit) {
         isolate, result, RegExpUtils::RegExpExec(isolate, splitter, string,
                                                  factory->undefined_value()));
 
-    if (result->IsNull(isolate)) {
+    if (IsNull(*result, isolate)) {
       string_index = static_cast<uint32_t>(
           RegExpUtils::AdvanceStringIndex(string, string_index, unicode));
       continue;
@@ -1795,7 +1794,7 @@ RUNTIME_FUNCTION(Runtime_RegExpReplaceRT) {
 
   string = String::Flatten(isolate, string);
 
-  const bool functional_replace = replace_obj->IsCallable();
+  const bool functional_replace = IsCallable(*replace_obj);
 
   Handle<String> replace;
   if (!functional_replace) {
@@ -1822,7 +1821,7 @@ RUNTIME_FUNCTION(Runtime_RegExpReplaceRT) {
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
       isolate, global_obj,
       JSReceiver::GetProperty(isolate, recv, factory->global_string()));
-  const bool global = global_obj->BooleanValue(isolate);
+  const bool global = Object::BooleanValue(*global_obj, isolate);
 
   bool unicode = false;
   if (global) {
@@ -1830,7 +1829,7 @@ RUNTIME_FUNCTION(Runtime_RegExpReplaceRT) {
     ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
         isolate, unicode_obj,
         JSReceiver::GetProperty(isolate, recv, factory->unicode_string()));
-    unicode = unicode_obj->BooleanValue(isolate);
+    unicode = Object::BooleanValue(*unicode_obj, isolate);
 
     RETURN_FAILURE_ON_EXCEPTION(isolate,
                                 RegExpUtils::SetLastIndex(isolate, recv, 0));
@@ -1844,7 +1843,7 @@ RUNTIME_FUNCTION(Runtime_RegExpReplaceRT) {
         isolate, result, RegExpUtils::RegExpExec(isolate, recv, string,
                                                  factory->undefined_value()));
 
-    if (result->IsNull(isolate)) break;
+    if (IsNull(*result, isolate)) break;
 
     results.emplace_back(result);
     if (!global) break;
@@ -1908,7 +1907,7 @@ RUNTIME_FUNCTION(Runtime_RegExpReplaceRT) {
       ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
           isolate, capture, Object::GetElement(isolate, result, n));
 
-      if (!capture->IsUndefined(isolate)) {
+      if (!IsUndefined(*capture, isolate)) {
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(isolate, capture,
                                            Object::ToString(isolate, capture));
       }
@@ -1920,7 +1919,7 @@ RUNTIME_FUNCTION(Runtime_RegExpReplaceRT) {
         isolate, groups_obj,
         Object::GetProperty(isolate, result, factory->groups_string()));
 
-    const bool has_named_captures = !groups_obj->IsUndefined(isolate);
+    const bool has_named_captures = !IsUndefined(*groups_obj, isolate);
 
     Handle<String> replacement;
     if (functional_replace) {
@@ -1954,7 +1953,7 @@ RUNTIME_FUNCTION(Runtime_RegExpReplaceRT) {
           isolate, replacement, Object::ToString(isolate, replacement_obj));
     } else {
       DCHECK(!functional_replace);
-      if (!groups_obj->IsUndefined(isolate)) {
+      if (!IsUndefined(*groups_obj, isolate)) {
         ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
             isolate, groups_obj, Object::ToObject(isolate, groups_obj));
       }
@@ -2001,14 +2000,14 @@ RUNTIME_FUNCTION(Runtime_IsRegExp) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
   Object obj = args[0];
-  return isolate->heap()->ToBoolean(obj.IsJSRegExp());
+  return isolate->heap()->ToBoolean(IsJSRegExp(obj));
 }
 
 RUNTIME_FUNCTION(Runtime_RegExpStringFromFlags) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   auto regexp = JSRegExp::cast(args[0]);
-  Handle<String> flags = JSRegExp::StringFromFlags(isolate, regexp.flags());
+  Handle<String> flags = JSRegExp::StringFromFlags(isolate, regexp->flags());
   return *flags;
 }
 
diff --git a/deps/v8/src/runtime/runtime-scopes.cc b/deps/v8/src/runtime/runtime-scopes.cc
index 6be19892e9710c..589faad0f42a64 100644
--- a/deps/v8/src/runtime/runtime-scopes.cc
+++ b/deps/v8/src/runtime/runtime-scopes.cc
@@ -47,7 +47,7 @@ Object DeclareGlobal(Isolate* isolate, Handle<JSGlobalObject> global,
                      PropertyAttributes attr, bool is_var,
                      RedeclarationType redeclaration_type) {
   Handle<ScriptContextTable> script_contexts(
-      global->native_context().script_context_table(), isolate);
+      global->native_context()->script_context_table(), isolate);
   VariableLookupResult lookup;
   if (script_contexts->Lookup(name, &lookup) &&
       IsLexicalVariableMode(lookup.mode)) {
@@ -127,7 +127,7 @@ RUNTIME_FUNCTION(Runtime_DeclareModuleExports) {
       Handle<ClosureFeedbackCellArray>::null();
   if (closure->has_feedback_vector()) {
     closure_feedback_cell_array = Handle<ClosureFeedbackCellArray>(
-        closure->feedback_vector().closure_feedback_cell_array(), isolate);
+        closure->feedback_vector()->closure_feedback_cell_array(), isolate);
   } else {
     closure_feedback_cell_array = Handle<ClosureFeedbackCellArray>(
         closure->closure_feedback_cell_array(), isolate);
@@ -136,14 +136,14 @@ RUNTIME_FUNCTION(Runtime_DeclareModuleExports) {
   Handle<Context> context(isolate->context(), isolate);
   DCHECK(context->IsModuleContext());
   Handle<FixedArray> exports(
-      SourceTextModule::cast(context->extension()).regular_exports(), isolate);
+      SourceTextModule::cast(context->extension())->regular_exports(), isolate);
 
   int length = declarations->length();
   FOR_WITH_HANDLE_SCOPE(isolate, int, i = 0, i, i < length, i++, {
     Object decl = declarations->get(i);
     int index;
     Object value;
-    if (decl.IsSmi()) {
+    if (IsSmi(decl)) {
       index = Smi::ToInt(decl);
       value = ReadOnlyRoots(isolate).the_hole_value();
     } else {
@@ -158,7 +158,7 @@ RUNTIME_FUNCTION(Runtime_DeclareModuleExports) {
                    .Build();
     }
 
-    Cell::cast(exports->get(index - 1)).set_value(value);
+    Cell::cast(exports->get(index - 1))->set_value(value);
   });
 
   return ReadOnlyRoots(isolate).undefined_value();
@@ -178,7 +178,7 @@ RUNTIME_FUNCTION(Runtime_DeclareGlobals) {
       Handle<ClosureFeedbackCellArray>::null();
   if (closure->has_feedback_vector()) {
     closure_feedback_cell_array = Handle<ClosureFeedbackCellArray>(
-        closure->feedback_vector().closure_feedback_cell_array(), isolate);
+        closure->feedback_vector()->closure_feedback_cell_array(), isolate);
   } else {
     closure_feedback_cell_array = Handle<ClosureFeedbackCellArray>(
         closure->closure_feedback_cell_array(), isolate);
@@ -190,7 +190,7 @@ RUNTIME_FUNCTION(Runtime_DeclareGlobals) {
     Handle<Object> decl(declarations->get(i), isolate);
     Handle<String> name;
     Handle<Object> value;
-    bool is_var = decl->IsString();
+    bool is_var = IsString(*decl);
 
     if (is_var) {
       name = Handle<String>::cast(decl);
@@ -208,9 +208,9 @@ RUNTIME_FUNCTION(Runtime_DeclareGlobals) {
 
     // Compute the property attributes. According to ECMA-262,
     // the property must be non-configurable except in eval.
-    Script script = Script::cast(closure->shared().script());
+    Script script = Script::cast(closure->shared()->script());
     PropertyAttributes attr =
-        script.compilation_type() == Script::COMPILATION_TYPE_EVAL
+        script->compilation_type() == Script::CompilationType::kEval
             ? NONE
             : DONT_DELETE;
 
@@ -232,22 +232,23 @@ Object DeclareEvalHelper(Isolate* isolate, Handle<String> name,
   // context, or a declaration block scope. Since this is called from eval, the
   // context passed is the context of the caller, which may be some nested
   // context and not the declaration context.
-  Handle<Context> context(isolate->context().declaration_context(), isolate);
+  Handle<Context> context(isolate->context()->declaration_context(), isolate);
 
   // For debug-evaluate we always use sloppy eval, in which case context could
   // also be a module context. As module contexts re-use the extension slot
   // we need to check for this.
   const bool is_debug_evaluate_in_module =
-      isolate->context().IsDebugEvaluateContext() && context->IsModuleContext();
+      isolate->context()->IsDebugEvaluateContext() &&
+      context->IsModuleContext();
 
-  DCHECK(context->IsFunctionContext() || context->IsNativeContext() ||
+  DCHECK(context->IsFunctionContext() || IsNativeContext(*context) ||
          context->IsScriptContext() || context->IsEvalContext() ||
          (context->IsBlockContext() &&
-          context->scope_info().is_declaration_scope()) ||
+          context->scope_info()->is_declaration_scope()) ||
          is_debug_evaluate_in_module);
 
-  bool is_var = value->IsUndefined(isolate);
-  DCHECK_IMPLIES(!is_var, value->IsJSFunction());
+  bool is_var = IsUndefined(*value, isolate);
+  DCHECK_IMPLIES(!is_var, IsJSFunction(*value));
 
   int index;
   PropertyAttributes attributes;
@@ -257,24 +258,24 @@ Object DeclareEvalHelper(Isolate* isolate, Handle<String> name,
   Handle<Object> holder =
       Context::Lookup(context, name, DONT_FOLLOW_CHAINS, &index, &attributes,
                       &init_flag, &mode);
-  DCHECK(holder.is_null() || !holder->IsSourceTextModule());
+  DCHECK(holder.is_null() || !IsSourceTextModule(*holder));
   DCHECK(!isolate->has_pending_exception());
 
   Handle<JSObject> object;
 
-  if (attributes != ABSENT && holder->IsJSGlobalObject()) {
+  if (attributes != ABSENT && IsJSGlobalObject(*holder)) {
     // ES#sec-evaldeclarationinstantiation 8.a.iv.1.b:
     // If fnDefinable is false, throw a TypeError exception.
     return DeclareGlobal(isolate, Handle<JSGlobalObject>::cast(holder), name,
                          value, NONE, is_var, RedeclarationType::kTypeError);
   }
-  if (context->has_extension() && context->extension().IsJSGlobalObject()) {
+  if (context->has_extension() && IsJSGlobalObject(context->extension())) {
     Handle<JSGlobalObject> global(JSGlobalObject::cast(context->extension()),
                                   isolate);
     return DeclareGlobal(isolate, global, name, value, NONE, is_var,
                          RedeclarationType::kTypeError);
   } else if (context->IsScriptContext()) {
-    DCHECK(context->global_object().IsJSGlobalObject());
+    DCHECK(IsJSGlobalObject(context->global_object()));
     Handle<JSGlobalObject> global(
         JSGlobalObject::cast(context->global_object()), isolate);
     return DeclareGlobal(isolate, global, name, value, NONE, is_var,
@@ -297,14 +298,14 @@ Object DeclareEvalHelper(Isolate* isolate, Handle<String> name,
 
   } else if (context->has_extension() && !is_debug_evaluate_in_module) {
     object = handle(context->extension_object(), isolate);
-    DCHECK(object->IsJSContextExtensionObject());
-  } else if (context->scope_info().HasContextExtensionSlot() &&
+    DCHECK(IsJSContextExtensionObject(*object));
+  } else if (context->scope_info()->HasContextExtensionSlot() &&
              !is_debug_evaluate_in_module) {
     // Sloppy varblock and function contexts might not have an extension object
     // yet. Sloppy eval will never have an extension object, as vars are hoisted
     // out, and lets are known statically.
     DCHECK((context->IsBlockContext() &&
-            context->scope_info().is_declaration_scope()) ||
+            context->scope_info()->is_declaration_scope()) ||
            context->IsFunctionContext());
     object =
         isolate->factory()->NewJSObject(isolate->context_extension_function());
@@ -403,14 +404,14 @@ std::unique_ptr<Handle<Object>[]> GetCallerArguments(Isolate* isolate,
 template <typename T>
 Handle<JSObject> NewSloppyArguments(Isolate* isolate, Handle<JSFunction> callee,
                                     T parameters, int argument_count) {
-  CHECK(!IsDerivedConstructor(callee->shared().kind()));
-  DCHECK(callee->shared().has_simple_parameters());
+  CHECK(!IsDerivedConstructor(callee->shared()->kind()));
+  DCHECK(callee->shared()->has_simple_parameters());
   Handle<JSObject> result =
       isolate->factory()->NewArgumentsObject(callee, argument_count);
 
   // Allocate the elements if needed.
   int parameter_count =
-      callee->shared().internal_formal_parameter_count_without_receiver();
+      callee->shared()->internal_formal_parameter_count_without_receiver();
   if (argument_count > 0) {
     if (parameter_count > 0) {
       int mapped_count = std::min(argument_count, parameter_count);
@@ -437,7 +438,7 @@ Handle<JSObject> NewSloppyArguments(Isolate* isolate, Handle<JSFunction> callee,
         --index;
       }
 
-      Handle<ScopeInfo> scope_info(callee->shared().scope_info(), isolate);
+      Handle<ScopeInfo> scope_info(callee->shared()->scope_info(), isolate);
 
       // First mark all mappable slots as unmapped and copy the values into the
       // arguments object.
@@ -536,7 +537,7 @@ RUNTIME_FUNCTION(Runtime_NewRestParameter) {
   DCHECK_EQ(1, args.length());
   Handle<JSFunction> callee = args.at<JSFunction>(0);
   int start_index =
-      callee->shared().internal_formal_parameter_count_without_receiver();
+      callee->shared()->internal_formal_parameter_count_without_receiver();
   // This generic runtime function can also be used when the caller has been
   // inlined, we use the slow but accurate {GetCallerArguments}.
   int argument_count = 0;
@@ -545,13 +546,13 @@ RUNTIME_FUNCTION(Runtime_NewRestParameter) {
   int num_elements = std::max(0, argument_count - start_index);
   Handle<JSObject> result = isolate->factory()->NewJSArray(
       PACKED_ELEMENTS, num_elements, num_elements,
-      DONT_INITIALIZE_ARRAY_ELEMENTS);
+      ArrayStorageAllocationMode::DONT_INITIALIZE_ARRAY_ELEMENTS);
   {
     DisallowGarbageCollection no_gc;
     FixedArray elements = FixedArray::cast(result->elements());
-    WriteBarrierMode mode = elements.GetWriteBarrierMode(no_gc);
+    WriteBarrierMode mode = elements->GetWriteBarrierMode(no_gc);
     for (int i = 0; i < num_elements; i++) {
-      elements.set(i, *arguments[i + start_index], mode);
+      elements->set(i, *arguments[i + start_index], mode);
     }
   }
   return *result;
@@ -648,7 +649,7 @@ RUNTIME_FUNCTION(Runtime_DeleteLookupSlot) {
 
   // If the slot was found in a context or in module imports and exports it
   // should be DONT_DELETE.
-  if (holder->IsContext() || holder->IsSourceTextModule()) {
+  if (IsContext(*holder) || IsSourceTextModule(*holder)) {
     return ReadOnlyRoots(isolate).false_value();
   }
 
@@ -676,25 +677,25 @@ MaybeHandle<Object> LoadLookupSlot(Isolate* isolate, Handle<String> name,
                                           &attributes, &flag, &mode);
   if (isolate->has_pending_exception()) return MaybeHandle<Object>();
 
-  if (!holder.is_null() && holder->IsSourceTextModule()) {
+  if (!holder.is_null() && IsSourceTextModule(*holder)) {
     Handle<Object> receiver = isolate->factory()->undefined_value();
     if (receiver_return) *receiver_return = receiver;
     return SourceTextModule::LoadVariable(
         isolate, Handle<SourceTextModule>::cast(holder), index);
   }
   if (index != Context::kNotFound) {
-    DCHECK(holder->IsContext());
+    DCHECK(IsContext(*holder));
     // If the "property" we were looking for is a local variable, the
     // receiver is the global object; see ECMA-262, 3rd., 10.1.6 and 10.2.3.
     Handle<Object> receiver = isolate->factory()->undefined_value();
-    Handle<Object> value = handle(Context::cast(*holder).get(index), isolate);
+    Handle<Object> value = handle(Context::cast(*holder)->get(index), isolate);
     // Check for uninitialized bindings.
-    if (flag == kNeedsInitialization && value->IsTheHole(isolate)) {
+    if (flag == kNeedsInitialization && IsTheHole(*value, isolate)) {
       THROW_NEW_ERROR(isolate,
                       NewReferenceError(MessageTemplate::kNotDefined, name),
                       Object);
     }
-    DCHECK(!value->IsTheHole(isolate));
+    DCHECK(!IsTheHole(*value, isolate));
     if (receiver_return) *receiver_return = receiver;
     return value;
   }
@@ -710,7 +711,7 @@ MaybeHandle<Object> LoadLookupSlot(Isolate* isolate, Handle<String> name,
         isolate, value, Object::GetProperty(isolate, holder, name), Object);
     if (receiver_return) {
       *receiver_return =
-          (holder->IsJSGlobalObject() || holder->IsJSContextExtensionObject())
+          (IsJSGlobalObject(*holder) || IsJSContextExtensionObject(*holder))
               ? Handle<Object>::cast(isolate->factory()->undefined_value())
               : holder;
     }
@@ -760,6 +761,26 @@ RUNTIME_FUNCTION_RETURN_PAIR(Runtime_LoadLookupSlotForCall) {
   return MakePair(*value, *receiver);
 }
 
+RUNTIME_FUNCTION(Runtime_LoadLookupSlotForCall_Baseline) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(2, args.length());
+  Handle<String> name = args.at<String>(0);
+  // Output pair is returned into two consecutive stack slots.
+  FullObjectSlot value_ret = args.slot_from_address_at(1, 0);
+  FullObjectSlot receiver_ret = args.slot_from_address_at(1, -1);
+  Handle<Object> receiver;
+  Handle<Object> value;
+  if (!LoadLookupSlot(isolate, name, kThrowOnError, &receiver)
+           .ToHandle(&value)) {
+    DCHECK((isolate)->has_pending_exception());
+    value_ret.store(ReadOnlyRoots(isolate).exception());
+    receiver_ret.store(Object());
+    return ReadOnlyRoots(isolate).exception();
+  }
+  value_ret.store(*value);
+  receiver_ret.store(*receiver);
+  return ReadOnlyRoots(isolate).undefined_value();
+}
 
 namespace {
 
@@ -778,7 +799,7 @@ MaybeHandle<Object> StoreLookupSlot(
   if (holder.is_null()) {
     // In case of JSProxy, an exception might have been thrown.
     if (isolate->has_pending_exception()) return MaybeHandle<Object>();
-  } else if (holder->IsSourceTextModule()) {
+  } else if (IsSourceTextModule(*holder)) {
     if ((attributes & READ_ONLY) == 0) {
       SourceTextModule::StoreVariable(Handle<SourceTextModule>::cast(holder),
                                       index, value);
@@ -791,7 +812,7 @@ MaybeHandle<Object> StoreLookupSlot(
   // The property was found in a context slot.
   if (index != Context::kNotFound) {
     if (flag == kNeedsInitialization &&
-        Handle<Context>::cast(holder)->get(index).IsTheHole(isolate)) {
+        IsTheHole(Handle<Context>::cast(holder)->get(index), isolate)) {
       THROW_NEW_ERROR(isolate,
                       NewReferenceError(MessageTemplate::kNotDefined, name),
                       Object);
@@ -861,7 +882,7 @@ RUNTIME_FUNCTION(Runtime_StoreLookupSlot_SloppyHoisting) {
   Handle<Object> value = args.at(1);
   const ContextLookupFlags lookup_flags =
       static_cast<ContextLookupFlags>(DONT_FOLLOW_CHAINS);
-  Handle<Context> declaration_context(isolate->context().declaration_context(),
+  Handle<Context> declaration_context(isolate->context()->declaration_context(),
                                       isolate);
   RETURN_RESULT_OR_FAILURE(
       isolate, StoreLookupSlot(isolate, declaration_context, name, value,
diff --git a/deps/v8/src/runtime/runtime-strings.cc b/deps/v8/src/runtime/runtime-strings.cc
index ac3f8da1b4db5c..eb798b12b7ceae 100644
--- a/deps/v8/src/runtime/runtime-strings.cc
+++ b/deps/v8/src/runtime/runtime-strings.cc
@@ -108,10 +108,10 @@ MaybeHandle<String> StringReplaceOneCharWithString(
     return MaybeHandle<String>();
   }
   recursion_limit--;
-  if (subject->IsConsString()) {
+  if (IsConsString(*subject)) {
     ConsString cons = ConsString::cast(*subject);
-    Handle<String> first = handle(cons.first(), isolate);
-    Handle<String> second = handle(cons.second(), isolate);
+    Handle<String> first = handle(cons->first(), isolate);
+    Handle<String> second = handle(cons->second(), isolate);
     Handle<String> new_first;
     if (!StringReplaceOneCharWithString(isolate, first, search, replace, found,
                                         recursion_limit).ToHandle(&new_first)) {
@@ -288,8 +288,8 @@ RUNTIME_FUNCTION(Runtime_StringBuilderConcat) {
     if (array_length == 0) {
       return ReadOnlyRoots(isolate).empty_string();
     } else if (array_length == 1) {
-      Object first = fixed_array.get(0);
-      if (first.IsString()) return first;
+      Object first = fixed_array->get(0);
+      if (IsString(first)) return first;
     }
     length = StringBuilderConcatLength(special_length, fixed_array,
                                        array_length, &one_byte);
@@ -348,8 +348,8 @@ RUNTIME_FUNCTION(Runtime_StringToArray) {
       FixedArray one_byte_table =
           isolate->heap()->single_character_string_table();
       for (int i = 0; i < length; ++i) {
-        Object value = one_byte_table.get(chars[i]);
-        DCHECK(value.IsString());
+        Object value = one_byte_table->get(chars[i]);
+        DCHECK(IsString(value));
         DCHECK(ReadOnlyHeap::Contains(HeapObject::cast(value)));
         // The single-character strings are in RO space so it should
         // be safe to skip the write barriers.
@@ -369,7 +369,7 @@ RUNTIME_FUNCTION(Runtime_StringToArray) {
 
 #ifdef DEBUG
   for (int i = 0; i < length; ++i) {
-    DCHECK_EQ(String::cast(elements->get(i)).length(), 1);
+    DCHECK_EQ(String::cast(elements->get(i))->length(), 1);
   }
 #endif
 
diff --git a/deps/v8/src/runtime/runtime-symbol.cc b/deps/v8/src/runtime/runtime-symbol.cc
index fe6134560b9fa6..1fbd0e991d388d 100644
--- a/deps/v8/src/runtime/runtime-symbol.cc
+++ b/deps/v8/src/runtime/runtime-symbol.cc
@@ -17,8 +17,8 @@ RUNTIME_FUNCTION(Runtime_CreatePrivateSymbol) {
   Handle<Symbol> symbol = isolate->factory()->NewPrivateSymbol();
   if (args.length() == 1) {
     Handle<Object> description = args.at(0);
-    CHECK(description->IsString() || description->IsUndefined(isolate));
-    if (description->IsString())
+    CHECK(IsString(*description) || IsUndefined(*description, isolate));
+    if (IsString(*description))
       symbol->set_description(String::cast(*description));
   }
   return *symbol;
@@ -47,7 +47,7 @@ RUNTIME_FUNCTION(Runtime_SymbolDescriptiveString) {
   Handle<Symbol> symbol = args.at<Symbol>(0);
   IncrementalStringBuilder builder(isolate);
   builder.AppendCStringLiteral("Symbol(");
-  if (symbol->description().IsString()) {
+  if (IsString(symbol->description())) {
     builder.AppendString(handle(String::cast(symbol->description()), isolate));
   }
   builder.AppendCharacter(')');
@@ -59,7 +59,7 @@ RUNTIME_FUNCTION(Runtime_SymbolIsPrivate) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
   auto symbol = Symbol::cast(args[0]);
-  return isolate->heap()->ToBoolean(symbol.is_private());
+  return isolate->heap()->ToBoolean(symbol->is_private());
 }
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/runtime/runtime-test-wasm.cc b/deps/v8/src/runtime/runtime-test-wasm.cc
index 1e4130903edb92..90a6656d9884f0 100644
--- a/deps/v8/src/runtime/runtime-test-wasm.cc
+++ b/deps/v8/src/runtime/runtime-test-wasm.cc
@@ -80,15 +80,17 @@ void ThrowRangeException(v8::Isolate* isolate, const char* message) {
   isolate->ThrowException(NewRangeException(isolate, message));
 }
 
-bool WasmModuleOverride(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (IsWasmCompileAllowed(args.GetIsolate(), args[0], false)) return false;
-  ThrowRangeException(args.GetIsolate(), "Sync compile not allowed");
+bool WasmModuleOverride(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  if (IsWasmCompileAllowed(info.GetIsolate(), info[0], false)) return false;
+  ThrowRangeException(info.GetIsolate(), "Sync compile not allowed");
   return true;
 }
 
-bool WasmInstanceOverride(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (IsWasmInstantiateAllowed(args.GetIsolate(), args[0], false)) return false;
-  ThrowRangeException(args.GetIsolate(), "Sync instantiate not allowed");
+bool WasmInstanceOverride(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  if (IsWasmInstantiateAllowed(info.GetIsolate(), info[0], false)) return false;
+  ThrowRangeException(info.GetIsolate(), "Sync instantiate not allowed");
   return true;
 }
 
@@ -101,7 +103,7 @@ RUNTIME_FUNCTION(Runtime_SetWasmCompileControls) {
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
   CHECK_EQ(args.length(), 2);
   int block_size = args.smi_value_at(0);
-  bool allow_async = Oddball::cast(args[1]).ToBool(isolate);
+  bool allow_async = Boolean::cast(args[1])->ToBool(isolate);
   base::MutexGuard guard(g_PerIsolateWasmControlsMutex.Pointer());
   WasmCompileControls& ctrl = (*GetPerIsolateWasmControls())[v8_isolate];
   ctrl.AllowAnySizeForAsync = allow_async;
@@ -141,6 +143,66 @@ int WasmStackSize(Isolate* isolate) {
 
 }  // namespace
 
+RUNTIME_FUNCTION(Runtime_CountUnoptimizedWasmToJSWrapper) {
+  HandleScope shs(isolate);
+  DCHECK_EQ(1, args.length());
+  Handle<WasmInstanceObject> instance = args.at<WasmInstanceObject>(0);
+  Address wrapper_start = isolate->builtins()
+                              ->code(Builtin::kWasmToJsWrapperAsm)
+                              ->instruction_start();
+  int result = 0;
+  int import_count = instance->imported_function_targets()->length();
+  for (int i = 0; i < import_count; ++i) {
+    if (instance->imported_function_targets()->get(i) == wrapper_start) {
+      ++result;
+    }
+  }
+  int table_count = instance->tables()->length();
+  for (int table_index = 0; table_index < table_count; ++table_index) {
+    if (!IsWasmIndirectFunctionTable(
+            instance->indirect_function_tables()->get(table_index))) {
+      continue;
+    }
+    Tagged<WasmIndirectFunctionTable> table = WasmIndirectFunctionTable::cast(
+        instance->indirect_function_tables()->get(table_index));
+
+    for (int entry_index = 0; entry_index < static_cast<int>(table->size());
+         ++entry_index) {
+      Address entry =
+          table->targets()
+              ->get<ExternalPointerTag::kWasmIndirectFunctionTargetTag>(
+                  entry_index, isolate);
+      if (entry == wrapper_start) ++result;
+    }
+  }
+  return Smi::FromInt(result);
+}
+
+RUNTIME_FUNCTION(Runtime_HasUnoptimizedWasmToJSWrapper) {
+  HandleScope shs(isolate);
+  DCHECK_EQ(1, args.length());
+  Tagged<WasmInternalFunction> internal;
+  Handle<Object> param = args.at<Object>(0);
+  if (WasmExportedFunction::IsWasmExportedFunction(*param)) {
+    Handle<WasmExportedFunction> exported =
+        Handle<WasmExportedFunction>::cast(param);
+    internal = exported->shared()->wasm_exported_function_data()->internal();
+  } else {
+    DCHECK(WasmJSFunction::IsWasmJSFunction(*param));
+    Handle<WasmJSFunction> wasm_js_function =
+        Handle<WasmJSFunction>::cast(param);
+    internal = wasm_js_function->shared()->wasm_js_function_data()->internal();
+  }
+
+  Tagged<Code> wrapper =
+      isolate->builtins()->code(Builtin::kWasmToJsWrapperAsm);
+  if (!internal->call_target()) {
+    return isolate->heap()->ToBoolean(internal->code() == wrapper);
+  }
+  return isolate->heap()->ToBoolean(internal->call_target() ==
+                                    wrapper->instruction_start());
+}
+
 RUNTIME_FUNCTION(Runtime_WasmTraceEnter) {
   HandleScope shs(isolate);
   DCHECK_EQ(0, args.length());
@@ -155,7 +217,7 @@ RUNTIME_FUNCTION(Runtime_WasmTraceEnter) {
 
   // Find the function name.
   int func_index = frame->function_index();
-  const wasm::WasmModule* module = frame->wasm_instance().module();
+  const wasm::WasmModule* module = frame->wasm_instance()->module();
   wasm::ModuleWireBytes wire_bytes =
       wasm::ModuleWireBytes(frame->native_module()->wire_bytes());
   wasm::WireBytesRef name_ref =
@@ -178,7 +240,7 @@ RUNTIME_FUNCTION(Runtime_WasmTraceEnter) {
 RUNTIME_FUNCTION(Runtime_WasmTraceExit) {
   HandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
-  Smi return_addr_smi = Smi::cast(args[0]);
+  Tagged<Smi> return_addr_smi = Smi::cast(args[0]);
 
   PrintIndentation(WasmStackSize(isolate));
   PrintF("}");
@@ -191,11 +253,11 @@ RUNTIME_FUNCTION(Runtime_WasmTraceExit) {
   WasmFrame* frame = WasmFrame::cast(it.frame());
   int func_index = frame->function_index();
   const wasm::FunctionSig* sig =
-      frame->wasm_instance().module()->functions[func_index].sig;
+      frame->wasm_instance()->module()->functions[func_index].sig;
 
   size_t num_returns = sig->return_count();
   // If we have no returns, we should have passed {Smi::zero()}.
-  DCHECK_IMPLIES(num_returns == 0, return_addr_smi.IsZero());
+  DCHECK_IMPLIES(num_returns == 0, IsZero(return_addr_smi));
   if (num_returns == 1) {
     wasm::ValueType return_type = sig->GetReturn(0);
     switch (return_type.kind()) {
@@ -237,11 +299,11 @@ RUNTIME_FUNCTION(Runtime_IsAsmWasmCode) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
   auto function = JSFunction::cast(args[0]);
-  if (!function.shared().HasAsmWasmData()) {
+  if (!function->shared()->HasAsmWasmData()) {
     return ReadOnlyRoots(isolate).false_value();
   }
-  if (function.shared().HasBuiltinId() &&
-      function.shared().builtin_id() == Builtin::kInstantiateAsmJs) {
+  if (function->shared()->HasBuiltinId() &&
+      function->shared()->builtin_id() == Builtin::kInstantiateAsmJs) {
     // Hasn't been compiled yet.
     return ReadOnlyRoots(isolate).false_value();
   }
@@ -260,7 +322,7 @@ bool DisallowWasmCodegenFromStringsCallback(v8::Local<v8::Context> context,
 RUNTIME_FUNCTION(Runtime_DisallowWasmCodegen) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
-  bool flag = Oddball::cast(args[0]).ToBool(isolate);
+  bool flag = Boolean::cast(args[0])->ToBool(isolate);
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
   v8_isolate->SetAllowWasmCodeGenerationCallback(
       flag ? DisallowWasmCodegenFromStringsCallback : nullptr);
@@ -271,9 +333,9 @@ RUNTIME_FUNCTION(Runtime_IsWasmCode) {
   SealHandleScope shs(isolate);
   DCHECK_EQ(1, args.length());
   auto function = JSFunction::cast(args[0]);
-  Code code = function.code();
-  bool is_js_to_wasm = code.kind() == CodeKind::JS_TO_WASM_FUNCTION ||
-                       (code.builtin_id() == Builtin::kGenericJSToWasmWrapper);
+  Tagged<Code> code = function->code();
+  bool is_js_to_wasm = code->kind() == CodeKind::JS_TO_WASM_FUNCTION ||
+                       (code->builtin_id() == Builtin::kJSToWasmWrapper);
   return isolate->heap()->ToBoolean(is_js_to_wasm);
 }
 
@@ -283,6 +345,12 @@ RUNTIME_FUNCTION(Runtime_IsWasmTrapHandlerEnabled) {
   return isolate->heap()->ToBoolean(trap_handler::IsTrapHandlerEnabled());
 }
 
+RUNTIME_FUNCTION(Runtime_IsWasmPartialOOBWriteNoop) {
+  DisallowGarbageCollection no_gc;
+  DCHECK_EQ(0, args.length());
+  return isolate->heap()->ToBoolean(wasm::kPartialOOBWritesAreNoops);
+}
+
 RUNTIME_FUNCTION(Runtime_IsThreadInWasm) {
   DisallowGarbageCollection no_gc;
   DCHECK_EQ(0, args.length());
@@ -303,7 +371,7 @@ RUNTIME_FUNCTION(Runtime_GetWasmExceptionTagId) {
   Handle<WasmInstanceObject> instance = args.at<WasmInstanceObject>(1);
   Handle<Object> tag =
       WasmExceptionPackage::GetExceptionTag(isolate, exception);
-  CHECK(tag->IsWasmExceptionTag());
+  CHECK(IsWasmExceptionTag(*tag));
   Handle<FixedArray> tags_table(instance->tags_table(), isolate);
   for (int index = 0; index < tags_table->length(); ++index) {
     if (tags_table->get(index) == *tag) return Smi::FromInt(index);
@@ -317,9 +385,20 @@ RUNTIME_FUNCTION(Runtime_GetWasmExceptionValues) {
   Handle<WasmExceptionPackage> exception = args.at<WasmExceptionPackage>(0);
   Handle<Object> values_obj =
       WasmExceptionPackage::GetExceptionValues(isolate, exception);
-  CHECK(values_obj->IsFixedArray());  // Only called with correct input.
+  CHECK(IsFixedArray(*values_obj));  // Only called with correct input.
   Handle<FixedArray> values = Handle<FixedArray>::cast(values_obj);
-  return *isolate->factory()->NewJSArrayWithElements(values);
+  Handle<FixedArray> externalized_values =
+      isolate->factory()->NewFixedArray(values->length());
+  for (int i = 0; i < values->length(); i++) {
+    Handle<Object> value = handle(values->get(i), isolate);
+    if (!IsSmi(*value)) {
+      // Note: This will leak string views to JS. This should be fine for a
+      // debugging function.
+      value = wasm::WasmToJSObject(isolate, value);
+    }
+    externalized_values->set(i, *value);
+  }
+  return *isolate->factory()->NewJSArrayWithElements(externalized_values);
 }
 
 RUNTIME_FUNCTION(Runtime_SerializeWasmModule) {
@@ -379,10 +458,10 @@ RUNTIME_FUNCTION(Runtime_WasmGetNumberOfInstances) {
   DCHECK_EQ(1, args.length());
   Handle<WasmModuleObject> module_obj = args.at<WasmModuleObject>(0);
   int instance_count = 0;
-  WeakArrayList weak_instance_list =
-      module_obj->script().wasm_weak_instance_list();
-  for (int i = 0; i < weak_instance_list.length(); ++i) {
-    if (weak_instance_list.Get(i)->IsWeak()) instance_count++;
+  Tagged<WeakArrayList> weak_instance_list =
+      module_obj->script()->wasm_weak_instance_list();
+  for (int i = 0; i < weak_instance_list->length(); ++i) {
+    if (weak_instance_list->Get(i)->IsWeak()) instance_count++;
   }
   return Smi::FromInt(instance_count);
 }
@@ -392,10 +471,10 @@ RUNTIME_FUNCTION(Runtime_WasmNumCodeSpaces) {
   HandleScope scope(isolate);
   Handle<JSObject> argument = args.at<JSObject>(0);
   Handle<WasmModuleObject> module;
-  if (argument->IsWasmInstanceObject()) {
+  if (IsWasmInstanceObject(*argument)) {
     module = handle(Handle<WasmInstanceObject>::cast(argument)->module_object(),
                     isolate);
-  } else if (argument->IsWasmModuleObject()) {
+  } else if (IsWasmModuleObject(*argument)) {
     module = Handle<WasmModuleObject>::cast(argument);
   }
   size_t num_spaces =
@@ -404,7 +483,8 @@ RUNTIME_FUNCTION(Runtime_WasmNumCodeSpaces) {
 }
 
 RUNTIME_FUNCTION(Runtime_WasmTraceMemory) {
-  HandleScope scope(isolate);
+  SealHandleScope scope(isolate);
+  DisallowGarbageCollection no_gc;
   DCHECK_EQ(1, args.length());
   auto info_addr = Smi::cast(args[0]);
 
@@ -418,8 +498,10 @@ RUNTIME_FUNCTION(Runtime_WasmTraceMemory) {
   DCHECK(it.is_wasm());
   WasmFrame* frame = WasmFrame::cast(it.frame());
 
+  // TODO(14259): Fix for multi-memory.
+  auto memory_object = frame->wasm_instance()->memory_object(0);
   uint8_t* mem_start = reinterpret_cast<uint8_t*>(
-      frame->wasm_instance().memory_object().array_buffer().backing_store());
+      memory_object->array_buffer()->backing_store());
   int func_index = frame->function_index();
   int pos = frame->position();
   wasm::ExecutionTier tier = frame->wasm_code()->is_liftoff()
@@ -436,7 +518,7 @@ RUNTIME_FUNCTION(Runtime_WasmTierUpFunction) {
   CHECK(WasmExportedFunction::IsWasmExportedFunction(*function));
   Handle<WasmExportedFunction> exp_fun =
       Handle<WasmExportedFunction>::cast(function);
-  WasmInstanceObject instance = exp_fun->instance();
+  Tagged<WasmInstanceObject> instance = exp_fun->instance();
   int func_index = exp_fun->function_index();
   wasm::TierUpNowForTesting(isolate, instance, func_index);
   return ReadOnlyRoots(isolate).undefined_value();
@@ -464,7 +546,7 @@ RUNTIME_FUNCTION(Runtime_IsWasmDebugFunction) {
   Handle<WasmExportedFunction> exp_fun =
       Handle<WasmExportedFunction>::cast(function);
   wasm::NativeModule* native_module =
-      exp_fun->instance().module_object().native_module();
+      exp_fun->instance()->module_object()->native_module();
   uint32_t func_index = exp_fun->function_index();
   wasm::WasmCodeRefScope code_ref_scope;
   wasm::WasmCode* code = native_module->GetCode(func_index);
@@ -480,7 +562,7 @@ RUNTIME_FUNCTION(Runtime_IsLiftoffFunction) {
   Handle<WasmExportedFunction> exp_fun =
       Handle<WasmExportedFunction>::cast(function);
   wasm::NativeModule* native_module =
-      exp_fun->instance().module_object().native_module();
+      exp_fun->instance()->module_object()->native_module();
   uint32_t func_index = exp_fun->function_index();
   wasm::WasmCodeRefScope code_ref_scope;
   wasm::WasmCode* code = native_module->GetCode(func_index);
@@ -495,7 +577,7 @@ RUNTIME_FUNCTION(Runtime_IsTurboFanFunction) {
   Handle<WasmExportedFunction> exp_fun =
       Handle<WasmExportedFunction>::cast(function);
   wasm::NativeModule* native_module =
-      exp_fun->instance().module_object().native_module();
+      exp_fun->instance()->module_object()->native_module();
   uint32_t func_index = exp_fun->function_index();
   wasm::WasmCodeRefScope code_ref_scope;
   wasm::WasmCode* code = native_module->GetCode(func_index);
@@ -510,7 +592,7 @@ RUNTIME_FUNCTION(Runtime_IsUncompiledWasmFunction) {
   Handle<WasmExportedFunction> exp_fun =
       Handle<WasmExportedFunction>::cast(function);
   wasm::NativeModule* native_module =
-      exp_fun->instance().module_object().native_module();
+      exp_fun->instance()->module_object()->native_module();
   uint32_t func_index = exp_fun->function_index();
   return isolate->heap()->ToBoolean(!native_module->HasCode(func_index));
 }
@@ -520,7 +602,7 @@ RUNTIME_FUNCTION(Runtime_FreezeWasmLazyCompilation) {
   DisallowGarbageCollection no_gc;
   auto instance = WasmInstanceObject::cast(args[0]);
 
-  instance.module_object().native_module()->set_lazy_compile_frozen(true);
+  instance->module_object()->native_module()->set_lazy_compile_frozen(true);
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
@@ -528,7 +610,7 @@ RUNTIME_FUNCTION(Runtime_FreezeWasmLazyCompilation) {
 // callback and thereby bypasses the value in v8_flags.
 RUNTIME_FUNCTION(Runtime_SetWasmGCEnabled) {
   DCHECK_EQ(1, args.length());
-  bool enable = args.at(0)->BooleanValue(isolate);
+  bool enable = Object::BooleanValue(*args.at(0), isolate);
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
   WasmGCEnabledCallback enabled = [](v8::Local<v8::Context>) { return true; };
   WasmGCEnabledCallback disabled = [](v8::Local<v8::Context>) { return false; };
@@ -549,5 +631,10 @@ RUNTIME_FUNCTION(Runtime_WasmCompiledExportWrappersCount) {
   return Smi::FromInt(count);
 }
 
+RUNTIME_FUNCTION(Runtime_WasmSwitchToTheCentralStackCount) {
+  int count = isolate->wasm_switch_to_the_central_stack_counter();
+  return Smi::FromInt(count);
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/runtime/runtime-test.cc b/deps/v8/src/runtime/runtime-test.cc
index 79aa8ccb40a9b8..a7d97b37dad805 100644
--- a/deps/v8/src/runtime/runtime-test.cc
+++ b/deps/v8/src/runtime/runtime-test.cc
@@ -5,11 +5,13 @@
 #include <stdio.h>
 
 #include <fstream>
+#include <iomanip>
 #include <memory>
 
 #include "include/v8-function.h"
 #include "include/v8-profiler.h"
 #include "src/api/api-inl.h"
+#include "src/base/macros.h"
 #include "src/base/numbers/double.h"
 #include "src/codegen/compiler.h"
 #include "src/codegen/pending-optimization-table.h"
@@ -19,6 +21,7 @@
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/execution/arguments-inl.h"
 #include "src/execution/frames-inl.h"
+#include "src/execution/frames.h"
 #include "src/execution/isolate-inl.h"
 #include "src/execution/protectors-inl.h"
 #include "src/execution/tiering-manager.h"
@@ -26,7 +29,9 @@
 #include "src/heap/heap-write-barrier-inl.h"
 #include "src/heap/pretenuring-handler-inl.h"
 #include "src/ic/stub-cache.h"
+#include "src/objects/bytecode-array.h"
 #include "src/objects/js-collection-inl.h"
+#include "src/utils/utils.h"
 #ifdef V8_ENABLE_MAGLEV
 #include "src/maglev/maglev-concurrent-dispatcher.h"
 #endif  // V8_ENABLE_MAGLEV
@@ -50,7 +55,7 @@ namespace v8 {
 namespace internal {
 
 namespace {
-V8_WARN_UNUSED_RESULT Object CrashUnlessFuzzing(Isolate* isolate) {
+V8_WARN_UNUSED_RESULT Tagged<Object> CrashUnlessFuzzing(Isolate* isolate) {
   CHECK(v8_flags.fuzzing);
   return ReadOnlyRoots(isolate).undefined_value();
 }
@@ -62,7 +67,8 @@ V8_WARN_UNUSED_RESULT bool CrashUnlessFuzzingReturnFalse(Isolate* isolate) {
 
 // Returns |value| unless correctness-fuzzer-supressions is enabled,
 // otherwise returns undefined_value.
-V8_WARN_UNUSED_RESULT Object ReturnFuzzSafe(Object value, Isolate* isolate) {
+V8_WARN_UNUSED_RESULT Tagged<Object> ReturnFuzzSafe(Tagged<Object> value,
+                                                    Isolate* isolate) {
   return v8_flags.correctness_fuzzer_suppressions
              ? ReadOnlyRoots(isolate).undefined_value()
              : value;
@@ -71,25 +77,25 @@ V8_WARN_UNUSED_RESULT Object ReturnFuzzSafe(Object value, Isolate* isolate) {
 // Assert that the given argument is a number within the Int32 range
 // and convert it to int32_t.  If the argument is not an Int32 we crash if not
 // in fuzzing mode.
-#define CONVERT_INT32_ARG_FUZZ_SAFE(name, index)                   \
-  if (!args[index].IsNumber()) return CrashUnlessFuzzing(isolate); \
-  int32_t name = 0;                                                \
-  if (!args[index].ToInt32(&name)) return CrashUnlessFuzzing(isolate);
+#define CONVERT_INT32_ARG_FUZZ_SAFE(name, index)                  \
+  if (!IsNumber(args[index])) return CrashUnlessFuzzing(isolate); \
+  int32_t name = 0;                                               \
+  if (!Object::ToInt32(args[index], &name)) return CrashUnlessFuzzing(isolate);
 
 // Cast the given object to a boolean and store it in a variable with
 // the given name.  If the object is not a boolean we crash if not in
 // fuzzing mode.
-#define CONVERT_BOOLEAN_ARG_FUZZ_SAFE(name, index)                  \
-  if (!args[index].IsBoolean()) return CrashUnlessFuzzing(isolate); \
-  bool name = args[index].IsTrue(isolate);
+#define CONVERT_BOOLEAN_ARG_FUZZ_SAFE(name, index)                 \
+  if (!IsBoolean(args[index])) return CrashUnlessFuzzing(isolate); \
+  bool name = IsTrue(args[index], isolate);
 
-bool IsAsmWasmFunction(Isolate* isolate, JSFunction function) {
+bool IsAsmWasmFunction(Isolate* isolate, Tagged<JSFunction> function) {
   DisallowGarbageCollection no_gc;
 #if V8_ENABLE_WEBASSEMBLY
   // For simplicity we include invalid asm.js functions whose code hasn't yet
   // been updated to CompileLazy but is still the InstantiateAsmJs builtin.
-  return function.shared().HasAsmWasmData() ||
-         function.code().builtin_id() == Builtin::kInstantiateAsmJs;
+  return function->shared()->HasAsmWasmData() ||
+         function->code()->builtin_id() == Builtin::kInstantiateAsmJs;
 #else
   return false;
 #endif  // V8_ENABLE_WEBASSEMBLY
@@ -99,7 +105,9 @@ bool IsAsmWasmFunction(Isolate* isolate, JSFunction function) {
 
 RUNTIME_FUNCTION(Runtime_ClearMegamorphicStubCache) {
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   isolate->load_stub_cache()->Clear();
   isolate->store_stub_cache()->Clear();
   return ReadOnlyRoots(isolate).undefined_value();
@@ -107,7 +115,9 @@ RUNTIME_FUNCTION(Runtime_ClearMegamorphicStubCache) {
 
 RUNTIME_FUNCTION(Runtime_ConstructDouble) {
   HandleScope scope(isolate);
-  DCHECK_EQ(2, args.length());
+  if (args.length() != 2) {
+    return CrashUnlessFuzzing(isolate);
+  }
   uint32_t hi = NumberToUint32(args[0]);
   uint32_t lo = NumberToUint32(args[1]);
   uint64_t result = (static_cast<uint64_t>(hi) << 32) | lo;
@@ -116,7 +126,9 @@ RUNTIME_FUNCTION(Runtime_ConstructDouble) {
 
 RUNTIME_FUNCTION(Runtime_ConstructConsString) {
   HandleScope scope(isolate);
-  DCHECK_EQ(2, args.length());
+  if (args.length() != 2) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<String> left = args.at<String>(0);
   Handle<String> right = args.at<String>(1);
 
@@ -130,7 +142,9 @@ RUNTIME_FUNCTION(Runtime_ConstructConsString) {
 
 RUNTIME_FUNCTION(Runtime_ConstructSlicedString) {
   HandleScope scope(isolate);
-  DCHECK_EQ(2, args.length());
+  if (args.length() != 2) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<String> string = args.at<String>(0);
   int index = args.smi_value_at(1);
 
@@ -139,44 +153,50 @@ RUNTIME_FUNCTION(Runtime_ConstructSlicedString) {
 
   Handle<String> sliced_string =
       isolate->factory()->NewSubString(string, index, string->length());
-  CHECK(sliced_string->IsSlicedString());
+  CHECK(IsSlicedString(*sliced_string));
   return *sliced_string;
 }
 
 RUNTIME_FUNCTION(Runtime_ConstructInternalizedString) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<String> string = args.at<String>(0);
   CHECK(string->IsOneByteRepresentation());
   Handle<String> internalized = isolate->factory()->InternalizeString(string);
-  CHECK(string->IsInternalizedString());
+  CHECK(IsInternalizedString(*string));
   return *internalized;
 }
 
 RUNTIME_FUNCTION(Runtime_ConstructThinString) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<String> string = args.at<String>(0);
   CHECK(string->IsOneByteRepresentation());
-  if (!string->IsConsString()) {
+  if (!IsConsString(*string)) {
     const bool kIsOneByte = true;
     string =
         isolate->factory()->NewConsString(isolate->factory()->empty_string(),
                                           string, string->length(), kIsOneByte);
   }
-  CHECK(string->IsConsString());
+  CHECK(IsConsString(*string));
   Handle<String> internalized = isolate->factory()->InternalizeString(string);
   CHECK_NE(*internalized, *string);
-  CHECK(string->IsThinString());
+  CHECK(IsThinString(*string));
   return *string;
 }
 
 RUNTIME_FUNCTION(Runtime_DeoptimizeFunction) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
 
   Handle<Object> function_object = args.at(0);
-  if (!function_object->IsJSFunction()) return CrashUnlessFuzzing(isolate);
+  if (!IsJSFunction(*function_object)) return CrashUnlessFuzzing(isolate);
   Handle<JSFunction> function = Handle<JSFunction>::cast(function_object);
 
   if (function->HasAttachedOptimizedCode()) {
@@ -188,7 +208,9 @@ RUNTIME_FUNCTION(Runtime_DeoptimizeFunction) {
 
 RUNTIME_FUNCTION(Runtime_DeoptimizeNow) {
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
 
   Handle<JSFunction> function;
 
@@ -204,9 +226,23 @@ RUNTIME_FUNCTION(Runtime_DeoptimizeNow) {
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
+RUNTIME_FUNCTION(Runtime_LeakHole) {
+  HandleScope scope(isolate);
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
+
+  // TODO(chromium:1445008): once we have multiple different hole values, we
+  // could make this function take a number as argument and return the nth hole
+  // value, or a random hole if the argument is undefined.
+  return ReadOnlyRoots(isolate).the_hole_value();
+}
+
 RUNTIME_FUNCTION(Runtime_RunningInSimulator) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
 #if defined(USE_SIMULATOR)
   return ReadOnlyRoots(isolate).true_value();
 #else
@@ -216,7 +252,9 @@ RUNTIME_FUNCTION(Runtime_RunningInSimulator) {
 
 RUNTIME_FUNCTION(Runtime_RuntimeEvaluateREPL) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<String> source = args.at<String>(0);
   Handle<Object> result;
   ASSIGN_RETURN_FAILURE_ON_EXCEPTION(
@@ -230,20 +268,26 @@ RUNTIME_FUNCTION(Runtime_RuntimeEvaluateREPL) {
 
 RUNTIME_FUNCTION(Runtime_ICsAreEnabled) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(v8_flags.use_ic);
 }
 
 RUNTIME_FUNCTION(Runtime_IsConcurrentRecompilationSupported) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       isolate->concurrent_recompilation_enabled());
 }
 
 RUNTIME_FUNCTION(Runtime_IsAtomicsWaitAllowed) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(isolate->allow_atomics_wait());
 }
 
@@ -254,7 +298,7 @@ bool CanOptimizeFunction(CodeKind target_kind, Handle<JSFunction> function,
   // The following conditions were lifted (in part) from the DCHECK inside
   // JSFunction::MarkForOptimization().
 
-  if (!function->shared().allows_lazy_compilation()) {
+  if (!function->shared()->allows_lazy_compilation()) {
     return CrashUnlessFuzzingReturnFalse(isolate);
   }
 
@@ -266,10 +310,12 @@ bool CanOptimizeFunction(CodeKind target_kind, Handle<JSFunction> function,
   }
 
   if (target_kind == CodeKind::TURBOFAN && !v8_flags.turbofan) return false;
-  if (target_kind == CodeKind::MAGLEV && !v8_flags.maglev) return false;
+  if (target_kind == CodeKind::MAGLEV && !maglev::IsMaglevEnabled()) {
+    return false;
+  }
 
-  if (function->shared().optimization_disabled() &&
-      function->shared().disabled_optimization_reason() ==
+  if (function->shared()->optimization_disabled() &&
+      function->shared()->disabled_optimization_reason() ==
           BailoutReason::kNeverOptimize) {
     return CrashUnlessFuzzingReturnFalse(isolate);
   }
@@ -294,18 +340,19 @@ bool CanOptimizeFunction(CodeKind target_kind, Handle<JSFunction> function,
   return true;
 }
 
-Object OptimizeFunctionOnNextCall(RuntimeArguments& args, Isolate* isolate,
-                                  CodeKind target_kind) {
+Tagged<Object> OptimizeFunctionOnNextCall(RuntimeArguments& args,
+                                          Isolate* isolate,
+                                          CodeKind target_kind) {
   if (args.length() != 1 && args.length() != 2) {
     return CrashUnlessFuzzing(isolate);
   }
 
   Handle<Object> function_object = args.at(0);
-  if (!function_object->IsJSFunction()) return CrashUnlessFuzzing(isolate);
+  if (!IsJSFunction(*function_object)) return CrashUnlessFuzzing(isolate);
   Handle<JSFunction> function = Handle<JSFunction>::cast(function_object);
 
   IsCompiledScope is_compiled_scope(
-      function->shared().is_compiled_scope(isolate));
+      function->shared()->is_compiled_scope(isolate));
   if (!CanOptimizeFunction(target_kind, function, isolate,
                            &is_compiled_scope)) {
     return ReadOnlyRoots(isolate).undefined_value();
@@ -314,7 +361,7 @@ Object OptimizeFunctionOnNextCall(RuntimeArguments& args, Isolate* isolate,
   ConcurrencyMode concurrency_mode = ConcurrencyMode::kSynchronous;
   if (args.length() == 2) {
     Handle<Object> type = args.at(1);
-    if (!type->IsString()) return CrashUnlessFuzzing(isolate);
+    if (!IsString(*type)) return CrashUnlessFuzzing(isolate);
     if (Handle<String>::cast(type)->IsOneByteEqualTo(
             base::StaticCharVector("concurrent")) &&
         isolate->concurrent_recompilation_enabled()) {
@@ -325,10 +372,10 @@ Object OptimizeFunctionOnNextCall(RuntimeArguments& args, Isolate* isolate,
   // This function may not have been lazily compiled yet, even though its shared
   // function has.
   if (!function->is_compiled()) {
-    DCHECK(function->shared().HasBytecodeArray());
-    Code code = *BUILTIN_CODE(isolate, InterpreterEntryTrampoline);
-    if (function->shared().HasBaselineCode()) {
-      code = function->shared().baseline_code(kAcquireLoad);
+    DCHECK(function->shared()->HasBytecodeArray());
+    Tagged<Code> code = *BUILTIN_CODE(isolate, InterpreterEntryTrampoline);
+    if (function->shared()->HasBaselineCode()) {
+      code = function->shared()->baseline_code(kAcquireLoad);
     }
     function->set_code(code);
   }
@@ -344,11 +391,11 @@ bool EnsureCompiledAndFeedbackVector(Isolate* isolate,
                                      Handle<JSFunction> function,
                                      IsCompiledScope* is_compiled_scope) {
   // Check function allows lazy compilation.
-  if (!function->shared().allows_lazy_compilation()) return false;
+  if (!function->shared()->allows_lazy_compilation()) return false;
 
   // If function isn't compiled, compile it now.
   *is_compiled_scope =
-      function->shared().is_compiled_scope(function->GetIsolate());
+      function->shared()->is_compiled_scope(function->GetIsolate());
   if (!is_compiled_scope->is_compiled() &&
       !Compiler::Compile(isolate, function, Compiler::CLEAR_EXCEPTION,
                          is_compiled_scope)) {
@@ -369,13 +416,13 @@ RUNTIME_FUNCTION(Runtime_CompileBaseline) {
     return CrashUnlessFuzzing(isolate);
   }
   Handle<Object> function_object = args.at(0);
-  if (!function_object->IsJSFunction()) return CrashUnlessFuzzing(isolate);
+  if (!IsJSFunction(*function_object)) return CrashUnlessFuzzing(isolate);
   Handle<JSFunction> function = Handle<JSFunction>::cast(function_object);
 
   IsCompiledScope is_compiled_scope =
-      function->shared(isolate).is_compiled_scope(isolate);
+      function->shared(isolate)->is_compiled_scope(isolate);
 
-  if (!function->shared(isolate).IsUserJavaScript()) {
+  if (!function->shared(isolate)->IsUserJavaScript()) {
     return CrashUnlessFuzzing(isolate);
   }
 
@@ -407,10 +454,11 @@ RUNTIME_FUNCTION(Runtime_BenchMaglev) {
   Handle<Code> code;
   base::ElapsedTimer timer;
   timer.Start();
-  code = Maglev::Compile(isolate, function).ToHandleChecked();
+  code = Maglev::Compile(isolate, function, BytecodeOffset::None())
+             .ToHandleChecked();
   for (int i = 1; i < count; ++i) {
     HandleScope handle_scope(isolate);
-    Maglev::Compile(isolate, function);
+    Maglev::Compile(isolate, function, BytecodeOffset::None());
   }
   PrintF("Maglev compile time: %g ms!\n",
          timer.Elapsed().InMillisecondsF() / count);
@@ -461,7 +509,7 @@ RUNTIME_FUNCTION(Runtime_IsSparkplugEnabled) {
 
 RUNTIME_FUNCTION(Runtime_IsMaglevEnabled) {
   DCHECK_EQ(args.length(), 0);
-  return isolate->heap()->ToBoolean(v8_flags.maglev);
+  return isolate->heap()->ToBoolean(maglev::IsMaglevEnabled());
 }
 
 RUNTIME_FUNCTION(Runtime_IsTurbofanEnabled) {
@@ -499,7 +547,9 @@ RUNTIME_FUNCTION(Runtime_OptimizeFunctionOnNextCall) {
 
 RUNTIME_FUNCTION(Runtime_EnsureFeedbackVectorForFunction) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<JSFunction> function = args.at<JSFunction>(0);
   if (function->has_feedback_vector()) {
     return ReadOnlyRoots(isolate).undefined_value();
@@ -512,7 +562,7 @@ RUNTIME_FUNCTION(Runtime_EnsureFeedbackVectorForFunction) {
 
 RUNTIME_FUNCTION(Runtime_PrepareFunctionForOptimization) {
   HandleScope scope(isolate);
-  if ((args.length() != 1 && args.length() != 2) || !args[0].IsJSFunction()) {
+  if ((args.length() != 1 && args.length() != 2) || !IsJSFunction(args[0])) {
     return CrashUnlessFuzzing(isolate);
   }
   Handle<JSFunction> function = args.at<JSFunction>(0);
@@ -524,8 +574,8 @@ RUNTIME_FUNCTION(Runtime_PrepareFunctionForOptimization) {
 
   // If optimization is disabled for the function, return without marking it for
   // manual optimization
-  if (function->shared().optimization_disabled() &&
-      function->shared().disabled_optimization_reason() ==
+  if (function->shared()->optimization_disabled() &&
+      function->shared()->disabled_optimization_reason() ==
           BailoutReason::kNeverOptimize) {
     return CrashUnlessFuzzing(isolate);
   }
@@ -534,7 +584,7 @@ RUNTIME_FUNCTION(Runtime_PrepareFunctionForOptimization) {
 
   // Hold onto the bytecode array between marking and optimization to ensure
   // it's not flushed.
-  if (v8_flags.testing_d8_test_runner) {
+  if (v8_flags.testing_d8_test_runner || v8_flags.allow_natives_syntax) {
     ManualOptimizationTable::MarkFunctionForManualOptimization(
         isolate, function, &is_compiled_scope);
   }
@@ -591,33 +641,51 @@ BytecodeOffset OffsetOfNextJumpLoop(Isolate* isolate,
 
 RUNTIME_FUNCTION(Runtime_OptimizeOsr) {
   HandleScope handle_scope(isolate);
-  DCHECK(args.length() == 0 || args.length() == 1);
+  if (args.length() != 0 && args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
 
   Handle<JSFunction> function;
 
   // The optional parameter determines the frame being targeted.
   int stack_depth = 0;
   if (args.length() == 1) {
-    if (!args[0].IsSmi()) return CrashUnlessFuzzing(isolate);
+    if (!IsSmi(args[0])) return CrashUnlessFuzzing(isolate);
     stack_depth = args.smi_value_at(0);
   }
 
   // Find the JavaScript function on the top of the stack.
   JavaScriptStackFrameIterator it(isolate);
   while (!it.done() && stack_depth--) it.Advance();
-  if (!it.done()) function = handle(it.frame()->function(), isolate);
+  if (!it.done()) {
+    if (it.frame()->is_turbofan()) {
+      if (v8_flags.trace_osr) {
+        CodeTracer::Scope scope(isolate->GetCodeTracer());
+        PrintF(scope.file(),
+               "[OSR - %%OptimizeOsr failed because the current function could "
+               "not be found.]\n");
+      }
+      // This can happen if %OptimizeOsr is in inlined function.
+      return ReadOnlyRoots(isolate).undefined_value();
+    } else if (it.frame()->is_maglev()) {
+      function = MaglevFrame::cast(it.frame())->GetInnermostFunction();
+    } else {
+      function = handle(it.frame()->function(), isolate);
+    }
+  }
   if (function.is_null()) return CrashUnlessFuzzing(isolate);
 
-  if (V8_UNLIKELY(!v8_flags.turbofan) || V8_UNLIKELY(!v8_flags.use_osr)) {
+  if (V8_UNLIKELY((!v8_flags.turbofan && !maglev::IsMaglevEnabled()) ||
+                  (!v8_flags.use_osr && !maglev::IsMaglevOsrEnabled()))) {
     return ReadOnlyRoots(isolate).undefined_value();
   }
 
-  if (!function->shared().allows_lazy_compilation()) {
+  if (!function->shared()->allows_lazy_compilation()) {
     return CrashUnlessFuzzing(isolate);
   }
 
-  if (function->shared().optimization_disabled() &&
-      function->shared().disabled_optimization_reason() ==
+  if (function->shared()->optimization_disabled() &&
+      function->shared()->disabled_optimization_reason() ==
           BailoutReason::kNeverOptimize) {
     return CrashUnlessFuzzing(isolate);
   }
@@ -628,20 +696,21 @@ RUNTIME_FUNCTION(Runtime_OptimizeOsr) {
   }
 
   if (function->HasAvailableOptimizedCode() &&
-      !function->code().is_maglevved()) {
+      (!function->code()->is_maglevved() || !v8_flags.osr_from_maglev)) {
     DCHECK(function->HasAttachedOptimizedCode() ||
            function->ChecksTieringState());
     // If function is already optimized, return.
     return ReadOnlyRoots(isolate).undefined_value();
   }
 
-  if (!it.frame()->is_unoptimized() && !it.frame()->is_maglev()) {
+  if (!it.frame()->is_unoptimized() &&
+      (!it.frame()->is_maglev() || !v8_flags.osr_from_maglev)) {
     // Nothing to be done.
     return ReadOnlyRoots(isolate).undefined_value();
   }
 
   IsCompiledScope is_compiled_scope(
-      function->shared().is_compiled_scope(isolate));
+      function->shared()->is_compiled_scope(isolate));
   JSFunction::EnsureFeedbackVector(isolate, function, &is_compiled_scope);
   isolate->tiering_manager()->RequestOsrAtNextOpportunity(*function);
 
@@ -655,7 +724,13 @@ RUNTIME_FUNCTION(Runtime_OptimizeOsr) {
   // If not (e.g. because we enter a nested loop first), the next JumpLoop will
   // see the cached OSR code with a mismatched offset, and trigger
   // non-concurrent OSR compilation and installation.
-  if (isolate->concurrent_recompilation_enabled() && v8_flags.concurrent_osr) {
+  // To tier up from Maglev to TF we always do this, because the non-concurrent
+  // recompilation in `CompileOptimizedOSRFromMaglev` is broken. See the comment
+  // in `runtime-compiler.cc`.
+  bool concurrent_osr =
+      isolate->concurrent_recompilation_enabled() && v8_flags.concurrent_osr;
+  bool is_maglev = false;
+  if (it.frame()->is_maglev() || concurrent_osr) {
     BytecodeOffset osr_offset = BytecodeOffset::None();
     if (it.frame()->is_unoptimized()) {
       UnoptimizedFrame* frame = UnoptimizedFrame::cast(it.frame());
@@ -666,31 +741,50 @@ RUNTIME_FUNCTION(Runtime_OptimizeOsr) {
     } else {
       MaglevFrame* frame = MaglevFrame::cast(it.frame());
       Handle<BytecodeArray> bytecode_array(
-          frame->function().shared().GetBytecodeArray(isolate), isolate);
-      const int current_offset = frame->GetBytecodeOffsetForOSR().ToInt();
-      osr_offset =
-          OffsetOfNextJumpLoop(isolate, bytecode_array, current_offset);
+          function->shared()->GetBytecodeArray(isolate), isolate);
+      const BytecodeOffset current_offset = frame->GetBytecodeOffsetForOSR();
+      osr_offset = OffsetOfNextJumpLoop(
+          isolate, bytecode_array,
+          current_offset.IsNone() ? 0 : current_offset.ToInt());
+      is_maglev = true;
     }
 
     if (osr_offset.IsNone()) {
       // The loop may have been elided by bytecode generation (e.g. for
-      // patterns such as `do { ... } while (false);`.
+      // patterns such as `do { ... } while (false);` or we are in an inlined
+      // constructor stub.
       return ReadOnlyRoots(isolate).undefined_value();
     }
 
     // Finalize first to ensure all pending tasks are done (since we can't
     // queue more than one OSR job for each function).
-    FinalizeOptimization(isolate);
+    if (concurrent_osr) {
+      FinalizeOptimization(isolate);
+    }
 
     // Queue the job.
     auto unused_result = Compiler::CompileOptimizedOSR(
-        isolate, function, osr_offset, ConcurrencyMode::kConcurrent);
+        isolate, function, osr_offset,
+        concurrent_osr ? ConcurrencyMode::kConcurrent
+                       : ConcurrencyMode::kSynchronous,
+        (maglev::IsMaglevOsrEnabled() && !it.frame()->is_maglev())
+            ? CodeKind::MAGLEV
+            : CodeKind::TURBOFAN);
     USE(unused_result);
 
     // Finalize again to finish the queued job. The next call into
     // Runtime::kCompileOptimizedOSR will pick up the cached InstructionStream
     // object.
-    FinalizeOptimization(isolate);
+    if (concurrent_osr) {
+      FinalizeOptimization(isolate);
+    }
+
+    if (is_maglev) {
+      // Maglev ignores the maybe_has_optimized_osr_code flag, thus we also need
+      // to set a maximum urgency.
+      function->feedback_vector()->set_osr_urgency(
+          FeedbackVector::kMaxOsrUrgency);
+    }
   }
 
   return ReadOnlyRoots(isolate).undefined_value();
@@ -698,7 +792,9 @@ RUNTIME_FUNCTION(Runtime_OptimizeOsr) {
 
 RUNTIME_FUNCTION(Runtime_BaselineOsr) {
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
 
   // Find the JavaScript function on the top of the stack.
   JavaScriptStackFrameIterator it(isolate);
@@ -712,7 +808,7 @@ RUNTIME_FUNCTION(Runtime_BaselineOsr) {
   }
 
   IsCompiledScope is_compiled_scope(
-      function->shared().is_compiled_scope(isolate));
+      function->shared()->is_compiled_scope(isolate));
   Compiler::CompileBaseline(isolate, function, Compiler::CLEAR_EXCEPTION,
                             &is_compiled_scope);
 
@@ -721,19 +817,31 @@ RUNTIME_FUNCTION(Runtime_BaselineOsr) {
 
 RUNTIME_FUNCTION(Runtime_NeverOptimizeFunction) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<Object> function_object = args.at(0);
   PtrComprCageBase cage_base(isolate);
-  if (!function_object->IsJSFunction(cage_base)) {
+  if (!IsJSFunction(*function_object, cage_base)) {
     return CrashUnlessFuzzing(isolate);
   }
   Handle<JSFunction> function = Handle<JSFunction>::cast(function_object);
   Handle<SharedFunctionInfo> sfi(function->shared(cage_base), isolate);
-  CodeKind code_kind = sfi->abstract_code(isolate).kind(cage_base);
-  if (code_kind != CodeKind::INTERPRETED_FUNCTION &&
-      code_kind != CodeKind::BUILTIN) {
-    return CrashUnlessFuzzing(isolate);
+  CodeKind code_kind = sfi->abstract_code(isolate)->kind(cage_base);
+  switch (code_kind) {
+    case CodeKind::INTERPRETED_FUNCTION:
+      break;
+    case CodeKind::BUILTIN:
+      if (sfi->InReadOnlySpace()) {
+        // SFIs for builtin functions are in RO space and thus we cannot set
+        // the never-optimize bit. But such SFIs cannot be optimized anyways.
+        return CrashUnlessFuzzing(isolate);
+      }
+      break;
+    default:
+      return CrashUnlessFuzzing(isolate);
   }
+
   // Make sure to finish compilation if there is a parallel lazy compilation in
   // progress, to make sure that the compilation finalization doesn't clobber
   // the SharedFunctionInfo's disable_optimization field.
@@ -771,8 +879,8 @@ RUNTIME_FUNCTION(Runtime_GetOptimizationStatus) {
   }
 
   Handle<Object> function_object = args.at(0);
-  if (function_object->IsUndefined()) return Smi::FromInt(status);
-  if (!function_object->IsJSFunction()) return CrashUnlessFuzzing(isolate);
+  if (IsUndefined(*function_object)) return Smi::FromInt(status);
+  if (!IsJSFunction(*function_object)) return CrashUnlessFuzzing(isolate);
 
   Handle<JSFunction> function = Handle<JSFunction>::cast(function_object);
   status |= static_cast<int>(OptimizationStatus::kIsFunction);
@@ -796,15 +904,15 @@ RUNTIME_FUNCTION(Runtime_GetOptimizationStatus) {
   }
 
   if (function->HasAttachedOptimizedCode()) {
-    Code code = function->code();
-    if (code.marked_for_deoptimization()) {
+    Tagged<Code> code = function->code();
+    if (code->marked_for_deoptimization()) {
       status |= static_cast<int>(OptimizationStatus::kMarkedForDeoptimization);
     } else {
       status |= static_cast<int>(OptimizationStatus::kOptimized);
     }
-    if (code.is_maglevved()) {
+    if (code->is_maglevved()) {
       status |= static_cast<int>(OptimizationStatus::kMaglevved);
-    } else if (code.is_turbofanned()) {
+    } else if (code->is_turbofanned()) {
       status |= static_cast<int>(OptimizationStatus::kTurboFanned);
     }
   }
@@ -848,7 +956,9 @@ RUNTIME_FUNCTION(Runtime_GetOptimizationStatus) {
 }
 
 RUNTIME_FUNCTION(Runtime_DisableOptimizationFinalization) {
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   if (isolate->concurrent_recompilation_enabled()) {
     isolate->optimizing_compile_dispatcher()->AwaitCompileTasks();
     isolate->optimizing_compile_dispatcher()->InstallOptimizedFunctions();
@@ -859,7 +969,9 @@ RUNTIME_FUNCTION(Runtime_DisableOptimizationFinalization) {
 }
 
 RUNTIME_FUNCTION(Runtime_WaitForBackgroundOptimization) {
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   if (isolate->concurrent_recompilation_enabled()) {
     isolate->optimizing_compile_dispatcher()->AwaitCompileTasks();
 #if V8_ENABLE_MAGLEV
@@ -872,7 +984,9 @@ RUNTIME_FUNCTION(Runtime_WaitForBackgroundOptimization) {
 }
 
 RUNTIME_FUNCTION(Runtime_FinalizeOptimization) {
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   if (isolate->concurrent_recompilation_enabled()) {
     FinalizeOptimization(isolate);
   }
@@ -884,7 +998,7 @@ RUNTIME_FUNCTION(Runtime_ForceFlush) {
   if (args.length() != 1) return CrashUnlessFuzzing(isolate);
 
   Handle<Object> function_object = args.at(0);
-  if (!function_object->IsJSFunction()) return CrashUnlessFuzzing(isolate);
+  if (!IsJSFunction(*function_object)) return CrashUnlessFuzzing(isolate);
   Handle<JSFunction> function = Handle<JSFunction>::cast(function_object);
 
   SharedFunctionInfo::DiscardCompiled(
@@ -893,13 +1007,16 @@ RUNTIME_FUNCTION(Runtime_ForceFlush) {
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
-static void ReturnNull(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().SetNull();
+static void ReturnNull(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  info.GetReturnValue().SetNull();
 }
 
 RUNTIME_FUNCTION(Runtime_GetUndetectable) {
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
   Local<v8::ObjectTemplate> desc = v8::ObjectTemplate::New(v8_isolate);
   desc->MarkAsUndetectable();
@@ -909,19 +1026,22 @@ RUNTIME_FUNCTION(Runtime_GetUndetectable) {
   return *Utils::OpenHandle(*obj);
 }
 
-static void call_as_function(const v8::FunctionCallbackInfo<v8::Value>& args) {
+static void call_as_function(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
   double v1 =
-      args[0]->NumberValue(args.GetIsolate()->GetCurrentContext()).ToChecked();
+      info[0]->NumberValue(info.GetIsolate()->GetCurrentContext()).ToChecked();
   double v2 =
-      args[1]->NumberValue(args.GetIsolate()->GetCurrentContext()).ToChecked();
-  args.GetReturnValue().Set(v8::Number::New(args.GetIsolate(), v1 - v2));
+      info[1]->NumberValue(info.GetIsolate()->GetCurrentContext()).ToChecked();
+  info.GetReturnValue().Set(v8::Number::New(info.GetIsolate(), v1 - v2));
 }
 
 // Returns a callable object. The object returns the difference of its two
 // parameters when it is called.
 RUNTIME_FUNCTION(Runtime_GetCallable) {
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
   Local<v8::FunctionTemplate> t = v8::FunctionTemplate::New(v8_isolate);
   Local<ObjectTemplate> instance_template = t->InstanceTemplate();
@@ -937,7 +1057,9 @@ RUNTIME_FUNCTION(Runtime_GetCallable) {
 
 RUNTIME_FUNCTION(Runtime_ClearFunctionFeedback) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<JSFunction> function = args.at<JSFunction>(0);
   function->ClearAllTypeFeedbackInfoForTesting();
   return ReadOnlyRoots(isolate).undefined_value();
@@ -945,14 +1067,18 @@ RUNTIME_FUNCTION(Runtime_ClearFunctionFeedback) {
 
 RUNTIME_FUNCTION(Runtime_NotifyContextDisposed) {
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   isolate->heap()->NotifyContextDisposed(true);
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
 RUNTIME_FUNCTION(Runtime_SetAllocationTimeout) {
   SealHandleScope shs(isolate);
-  DCHECK(args.length() == 2 || args.length() == 3);
+  if (args.length() != 2 && args.length() != 3) {
+    return CrashUnlessFuzzing(isolate);
+  }
 #ifdef V8_ENABLE_ALLOCATION_TIMEOUT
   CONVERT_INT32_ARG_FUZZ_SAFE(interval, 0);
   HeapAllocator::SetAllocationGcInterval(interval);
@@ -994,11 +1120,6 @@ void FillUpOneNewSpacePage(Isolate* isolate, Heap* heap) {
   DCHECK(!v8_flags.single_generation);
   PauseAllocationObserversScope pause_observers(heap);
   NewSpace* space = heap->new_space();
-  // We cannot rely on `space->limit()` to point to the end of the current page
-  // in the case where inline allocations are disabled, it actually points to
-  // the current allocation pointer.
-  DCHECK_IMPLIES(!heap->IsInlineAllocationEnabled(),
-                 space->limit() == space->top());
   int space_remaining = GetSpaceRemainingOnCurrentPage(space);
   while (space_remaining > 0) {
     int length = FixedArrayLenFromSize(space_remaining);
@@ -1021,18 +1142,30 @@ void FillUpOneNewSpacePage(Isolate* isolate, Heap* heap) {
 RUNTIME_FUNCTION(Runtime_SimulateNewspaceFull) {
   HandleScope scope(isolate);
   Heap* heap = isolate->heap();
-  NewSpace* space = heap->new_space();
   AlwaysAllocateScopeForTesting always_allocate(heap);
-  do {
-    FillUpOneNewSpacePage(isolate, heap);
-  } while (space->AddFreshPage());
-
+  if (v8_flags.minor_ms) {
+    if (heap->minor_sweeping_in_progress()) {
+      heap->EnsureYoungSweepingCompleted();
+    }
+    auto* space = heap->paged_new_space()->paged_space();
+    while (space->AddFreshPage()) {
+    }
+    space->FreeLinearAllocationArea();
+    space->ResetFreeList();
+  } else {
+    NewSpace* space = heap->new_space();
+    do {
+      FillUpOneNewSpacePage(isolate, heap);
+    } while (space->AddFreshPage());
+  }
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
 RUNTIME_FUNCTION(Runtime_ScheduleGCInStackCheck) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   isolate->RequestInterrupt(
       [](v8::Isolate* isolate, void*) {
         isolate->RequestGarbageCollectionForTesting(
@@ -1090,15 +1223,15 @@ static void DebugPrintImpl(MaybeObject maybe_object, std::ostream& os) {
   if (maybe_object->IsCleared()) {
     os << "[weak cleared]";
   } else {
-    Object object = maybe_object.GetHeapObjectOrSmi();
+    Tagged<Object> object = maybe_object.GetHeapObjectOrSmi();
     bool weak = maybe_object.IsWeak();
 
 #ifdef OBJECT_PRINT
     os << "DebugPrint: ";
     if (weak) os << "[weak] ";
-    object.Print(os);
-    if (object.IsHeapObject()) {
-      HeapObject::cast(object).map().Print(os);
+    Print(object, os);
+    if (IsHeapObject(object)) {
+      Print(HeapObject::cast(object)->map(), os);
     }
 #else
     if (weak) os << "[weak] ";
@@ -1116,7 +1249,7 @@ RUNTIME_FUNCTION(Runtime_DebugPrint) {
   std::unique_ptr<std::ostream> output_stream(new StdoutStream());
   if (args.length() >= 2) {
     // Args: object, stream.
-    if (args[1].IsSmi()) {
+    if (IsSmi(args[1])) {
       int output_int = Smi::cast(args[1]).value();
       if (output_int == fileno(stderr)) {
         output_stream.reset(new StderrStream());
@@ -1132,13 +1265,15 @@ RUNTIME_FUNCTION(Runtime_DebugPrint) {
 RUNTIME_FUNCTION(Runtime_DebugPrintPtr) {
   SealHandleScope shs(isolate);
   StdoutStream os;
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
 
   MaybeObject maybe_object(*args.address_of_arg_at(0));
   if (!maybe_object.IsCleared()) {
-    Object object = maybe_object.GetHeapObjectOrSmi();
+    Tagged<Object> object = maybe_object.GetHeapObjectOrSmi();
     size_t pointer;
-    if (object.ToIntegerIndex(&pointer)) {
+    if (Object::ToIntegerIndex(object, &pointer)) {
       MaybeObject from_pointer(static_cast<Address>(pointer));
       DebugPrintImpl(from_pointer, os);
     }
@@ -1147,9 +1282,73 @@ RUNTIME_FUNCTION(Runtime_DebugPrintPtr) {
   return args[0];
 }
 
+RUNTIME_FUNCTION(Runtime_DebugPrintWord) {
+  static constexpr int kNum16BitChunks = 4;
+  SealHandleScope shs(isolate);
+
+  // Args are: <bits 63-48>, <bits 47-32>, <bits 31-16>, <bits 15-0>, stream.
+  if (args.length() != kNum16BitChunks + 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
+
+  uint64_t value = 0;
+  for (int i = 0; i < kNum16BitChunks; ++i) {
+    value <<= 16;
+    CHECK(IsSmi(args[i]));
+    uint32_t chunk = Smi::cast(args[i]).value();
+    // We encode 16 bit per chunk only!
+    CHECK_EQ(chunk & 0xFFFF0000, 0);
+    value |= chunk;
+  }
+
+  if (!IsSmi(args[4]) || (Smi::cast(args[4]).value() == fileno(stderr))) {
+    StderrStream os;
+    os << "0x" << std::hex << value << std::dec << std::endl;
+  } else {
+    StdoutStream os;
+    os << "0x" << std::hex << value << std::dec << std::endl;
+  }
+  return ReadOnlyRoots(isolate).undefined_value();
+}
+
+RUNTIME_FUNCTION(Runtime_DebugPrintFloat) {
+  static constexpr int kNum16BitChunks = 4;
+  SealHandleScope shs(isolate);
+
+  // Args are: <bits 63-48>, <bits 47-32>, <bits 31-16>, <bits 15-0>, stream.
+  if (args.length() != kNum16BitChunks + 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
+
+  uint64_t value = 0;
+  for (int i = 0; i < kNum16BitChunks; ++i) {
+    value <<= 16;
+    CHECK(IsSmi(args[i]));
+    uint32_t chunk = Smi::cast(args[i]).value();
+    // We encode 16 bit per chunk only!
+    CHECK_EQ(chunk & 0xFFFF0000, 0);
+    value |= chunk;
+  }
+
+  if (!IsSmi(args[4]) || (Smi::cast(args[4]).value() == fileno(stderr))) {
+    StderrStream os;
+    std::streamsize precision = os.precision();
+    os << std::setprecision(20) << base::bit_cast<double>(value) << std::endl;
+    os.precision(precision);
+  } else {
+    StdoutStream os;
+    std::streamsize precision = os.precision();
+    os << std::setprecision(20) << base::bit_cast<double>(value) << std::endl;
+    os.precision(precision);
+  }
+  return ReadOnlyRoots(isolate).undefined_value();
+}
+
 RUNTIME_FUNCTION(Runtime_PrintWithNameForAssert) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(2, args.length());
+  if (args.length() != 2) {
+    return CrashUnlessFuzzing(isolate);
+  }
 
   auto name = String::cast(args[0]);
 
@@ -1160,7 +1359,7 @@ RUNTIME_FUNCTION(Runtime_PrintWithNameForAssert) {
     PrintF("%c", character);
   }
   PrintF(": ");
-  args[1].ShortPrint();
+  ShortPrint(args[1]);
   PrintF("\n");
 
   return ReadOnlyRoots(isolate).undefined_value();
@@ -1168,7 +1367,9 @@ RUNTIME_FUNCTION(Runtime_PrintWithNameForAssert) {
 
 RUNTIME_FUNCTION(Runtime_DebugTrace) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   isolate->PrintStack(stdout);
   return ReadOnlyRoots(isolate).undefined_value();
 }
@@ -1202,7 +1403,7 @@ RUNTIME_FUNCTION(Runtime_GlobalPrint) {
   FILE* output_stream = stdout;
   if (args.length() >= 2) {
     // Args: object, stream.
-    if (args[1].IsSmi()) {
+    if (IsSmi(args[1])) {
       int output_int = Smi::cast(args[1]).value();
       if (output_int == fileno(stderr)) {
         output_stream = stderr;
@@ -1210,7 +1411,7 @@ RUNTIME_FUNCTION(Runtime_GlobalPrint) {
     }
   }
 
-  if (!args[0].IsString()) {
+  if (!IsString(args[0])) {
     return args[0];
   }
 
@@ -1228,19 +1429,23 @@ RUNTIME_FUNCTION(Runtime_SystemBreak) {
   // The code below doesn't create handles, but when breaking here in GDB
   // having a handle scope might be useful.
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   base::OS::DebugBreak();
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
 RUNTIME_FUNCTION(Runtime_SetForceSlowPath) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
-  Object arg = args[0];
-  if (arg.IsTrue(isolate)) {
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
+  Tagged<Object> arg = args[0];
+  if (IsTrue(arg, isolate)) {
     isolate->set_force_slow_path(true);
   } else {
-    DCHECK(arg.IsFalse(isolate));
+    DCHECK(IsFalse(arg, isolate));
     isolate->set_force_slow_path(false);
   }
   return ReadOnlyRoots(isolate).undefined_value();
@@ -1248,7 +1453,9 @@ RUNTIME_FUNCTION(Runtime_SetForceSlowPath) {
 
 RUNTIME_FUNCTION(Runtime_Abort) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   int message_id = args.smi_value_at(0);
   const char* message = GetAbortReason(static_cast<AbortReason>(message_id));
   base::OS::PrintError("abort: %s\n", message);
@@ -1259,7 +1466,9 @@ RUNTIME_FUNCTION(Runtime_Abort) {
 
 RUNTIME_FUNCTION(Runtime_AbortJS) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<String> message = args.at<String>(0);
   if (v8_flags.disable_abortjs) {
     base::OS::PrintError("[disabled] abort: %s\n", message->ToCString().get());
@@ -1273,7 +1482,9 @@ RUNTIME_FUNCTION(Runtime_AbortJS) {
 
 RUNTIME_FUNCTION(Runtime_AbortCSADcheck) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<String> message = args.at<String>(0);
   base::OS::PrintError("abort: CSA_DCHECK failed: %s\n",
                        message->ToCString().get());
@@ -1285,18 +1496,20 @@ RUNTIME_FUNCTION(Runtime_AbortCSADcheck) {
 RUNTIME_FUNCTION(Runtime_DisassembleFunction) {
   HandleScope scope(isolate);
 #ifdef DEBUG
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   // Get the function and make sure it is compiled.
   Handle<JSFunction> func = args.at<JSFunction>(0);
   IsCompiledScope is_compiled_scope;
   if (!func->is_compiled() && func->HasAvailableOptimizedCode()) {
-    func->set_code(func->feedback_vector().optimized_code());
+    func->set_code(func->feedback_vector()->optimized_code());
   }
-  CHECK(func->is_compiled() ||
+  CHECK(func->shared()->is_compiled() ||
         Compiler::Compile(isolate, func, Compiler::KEEP_EXCEPTION,
                           &is_compiled_scope));
   StdoutStream os;
-  func->code().Print(os);
+  Print(func->code(), os);
   os << std::endl;
 #endif  // DEBUG
   return ReadOnlyRoots(isolate).undefined_value();
@@ -1323,7 +1536,9 @@ void PrintIndentation(int stack_size) {
 
 RUNTIME_FUNCTION(Runtime_TraceEnter) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   PrintIndentation(StackSize(isolate));
   JavaScriptFrame::PrintTop(isolate, stdout, true, false);
   PrintF(" {\n");
@@ -1332,26 +1547,32 @@ RUNTIME_FUNCTION(Runtime_TraceEnter) {
 
 RUNTIME_FUNCTION(Runtime_TraceExit) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
-  Object obj = args[0];
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
+  Tagged<Object> obj = args[0];
   PrintIndentation(StackSize(isolate));
   PrintF("} -> ");
-  obj.ShortPrint();
+  ShortPrint(obj);
   PrintF("\n");
   return obj;  // return TOS
 }
 
 RUNTIME_FUNCTION(Runtime_HaveSameMap) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(2, args.length());
+  if (args.length() != 2) {
+    return CrashUnlessFuzzing(isolate);
+  }
   auto obj1 = HeapObject::cast(args[0]);
   auto obj2 = HeapObject::cast(args[1]);
-  return isolate->heap()->ToBoolean(obj1.map() == obj2.map());
+  return isolate->heap()->ToBoolean(obj1->map() == obj2->map());
 }
 
 RUNTIME_FUNCTION(Runtime_InLargeObjectSpace) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   auto obj = HeapObject::cast(args[0]);
   return isolate->heap()->ToBoolean(
       isolate->heap()->new_lo_space()->Contains(obj) ||
@@ -1361,9 +1582,11 @@ RUNTIME_FUNCTION(Runtime_InLargeObjectSpace) {
 
 RUNTIME_FUNCTION(Runtime_HasElementsInALargeObjectSpace) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   auto array = JSArray::cast(args[0]);
-  FixedArrayBase elements = array.elements();
+  Tagged<FixedArrayBase> elements = array->elements();
   return isolate->heap()->ToBoolean(
       isolate->heap()->new_lo_space()->Contains(elements) ||
       isolate->heap()->lo_space()->Contains(elements));
@@ -1371,8 +1594,10 @@ RUNTIME_FUNCTION(Runtime_HasElementsInALargeObjectSpace) {
 
 RUNTIME_FUNCTION(Runtime_InYoungGeneration) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
-  Object obj = args[0];
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
+  Tagged<Object> obj = args[0];
   return isolate->heap()->ToBoolean(ObjectInYoungGeneration(obj));
 }
 
@@ -1381,24 +1606,24 @@ RUNTIME_FUNCTION(Runtime_PretenureAllocationSite) {
   DisallowGarbageCollection no_gc;
 
   if (args.length() != 1) return CrashUnlessFuzzing(isolate);
-  Object arg = args[0];
-  if (!arg.IsJSObject()) return CrashUnlessFuzzing(isolate);
-  JSObject object = JSObject::cast(arg);
+  Tagged<Object> arg = args[0];
+  if (!IsJSObject(arg)) return CrashUnlessFuzzing(isolate);
+  Tagged<JSObject> object = JSObject::cast(arg);
 
-  Heap* heap = object.GetHeap();
+  Heap* heap = object->GetHeap();
   if (!heap->InYoungGeneration(object)) {
     // Object is not in new space, thus there is no memento and nothing to do.
     return ReturnFuzzSafe(ReadOnlyRoots(isolate).false_value(), isolate);
   }
 
   PretenuringHandler* pretenuring_handler = heap->pretenuring_handler();
-  AllocationMemento memento =
+  Tagged<AllocationMemento> memento =
       pretenuring_handler
-          ->FindAllocationMemento<PretenuringHandler::kForRuntime>(object.map(),
-                                                                   object);
+          ->FindAllocationMemento<PretenuringHandler::kForRuntime>(
+              object->map(), object);
   if (memento.is_null())
     return ReturnFuzzSafe(ReadOnlyRoots(isolate).false_value(), isolate);
-  AllocationSite site = memento.GetAllocationSite();
+  Tagged<AllocationSite> site = memento->GetAllocationSite();
   pretenuring_handler->PretenureAllocationSiteOnNextCollection(site);
   return ReturnFuzzSafe(ReadOnlyRoots(isolate).true_value(), isolate);
 }
@@ -1415,8 +1640,10 @@ v8::ModifyCodeGenerationFromStringsResult DisallowCodegenFromStringsCallback(
 
 RUNTIME_FUNCTION(Runtime_DisallowCodegenFromStrings) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
-  bool flag = Oddball::cast(args[0]).ToBool(isolate);
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
+  bool flag = Boolean::cast(args[0])->ToBool(isolate);
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
   v8_isolate->SetModifyCodeGenerationFromStringsCallback(
       flag ? DisallowCodegenFromStringsCallback : nullptr);
@@ -1425,12 +1652,14 @@ RUNTIME_FUNCTION(Runtime_DisallowCodegenFromStrings) {
 
 RUNTIME_FUNCTION(Runtime_RegexpHasBytecode) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(2, args.length());
+  if (args.length() != 2) {
+    return CrashUnlessFuzzing(isolate);
+  }
   auto regexp = JSRegExp::cast(args[0]);
-  bool is_latin1 = Oddball::cast(args[1]).ToBool(isolate);
+  bool is_latin1 = Boolean::cast(args[1])->ToBool(isolate);
   bool result;
-  if (regexp.type_tag() == JSRegExp::IRREGEXP) {
-    result = regexp.bytecode(is_latin1).IsByteArray();
+  if (regexp->type_tag() == JSRegExp::IRREGEXP) {
+    result = IsByteArray(regexp->bytecode(is_latin1));
   } else {
     result = false;
   }
@@ -1439,12 +1668,14 @@ RUNTIME_FUNCTION(Runtime_RegexpHasBytecode) {
 
 RUNTIME_FUNCTION(Runtime_RegexpHasNativeCode) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(2, args.length());
+  if (args.length() != 2) {
+    return CrashUnlessFuzzing(isolate);
+  }
   auto regexp = JSRegExp::cast(args[0]);
-  bool is_latin1 = Oddball::cast(args[1]).ToBool(isolate);
+  bool is_latin1 = Boolean::cast(args[1])->ToBool(isolate);
   bool result;
-  if (regexp.type_tag() == JSRegExp::IRREGEXP) {
-    result = regexp.code(is_latin1).IsCode();
+  if (regexp->type_tag() == JSRegExp::IRREGEXP) {
+    result = IsCode(regexp->code(is_latin1));
   } else {
     result = false;
   }
@@ -1453,10 +1684,12 @@ RUNTIME_FUNCTION(Runtime_RegexpHasNativeCode) {
 
 RUNTIME_FUNCTION(Runtime_RegexpTypeTag) {
   HandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   auto regexp = JSRegExp::cast(args[0]);
   const char* type_str;
-  switch (regexp.type_tag()) {
+  switch (regexp->type_tag()) {
     case JSRegExp::NOT_COMPILED:
       type_str = "NOT_COMPILED";
       break;
@@ -1475,16 +1708,18 @@ RUNTIME_FUNCTION(Runtime_RegexpTypeTag) {
 
 RUNTIME_FUNCTION(Runtime_RegexpIsUnmodified) {
   HandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<JSRegExp> regexp = args.at<JSRegExp>(0);
   return isolate->heap()->ToBoolean(
       RegExp::IsUnmodifiedRegExp(isolate, regexp));
 }
 
-#define ELEMENTS_KIND_CHECK_RUNTIME_FUNCTION(Name) \
-  RUNTIME_FUNCTION(Runtime_##Name) {               \
-    auto obj = JSObject::cast(args[0]);            \
-    return isolate->heap()->ToBoolean(obj.Name()); \
+#define ELEMENTS_KIND_CHECK_RUNTIME_FUNCTION(Name)  \
+  RUNTIME_FUNCTION(Runtime_##Name) {                \
+    auto obj = JSObject::cast(args[0]);             \
+    return isolate->heap()->ToBoolean(obj->Name()); \
   }
 
 ELEMENTS_KIND_CHECK_RUNTIME_FUNCTION(HasFastElements)
@@ -1504,7 +1739,7 @@ ELEMENTS_KIND_CHECK_RUNTIME_FUNCTION(HasFastProperties)
 #define FIXED_TYPED_ARRAYS_CHECK_RUNTIME_FUNCTION(Type, type, TYPE, ctype) \
   RUNTIME_FUNCTION(Runtime_HasFixed##Type##Elements) {                     \
     auto obj = JSObject::cast(args[0]);                                    \
-    return isolate->heap()->ToBoolean(obj.HasFixed##Type##Elements());     \
+    return isolate->heap()->ToBoolean(obj->HasFixed##Type##Elements());    \
   }
 
 TYPED_ARRAYS(FIXED_TYPED_ARRAYS_CHECK_RUNTIME_FUNCTION)
@@ -1513,66 +1748,93 @@ TYPED_ARRAYS(FIXED_TYPED_ARRAYS_CHECK_RUNTIME_FUNCTION)
 
 RUNTIME_FUNCTION(Runtime_IsConcatSpreadableProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsIsConcatSpreadableLookupChainIntact(isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_TypedArraySpeciesProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsTypedArraySpeciesLookupChainIntact(isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_RegExpSpeciesProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsRegExpSpeciesLookupChainIntact(isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_PromiseSpeciesProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsPromiseSpeciesLookupChainIntact(isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_ArraySpeciesProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsArraySpeciesLookupChainIntact(isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_MapIteratorProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsMapIteratorLookupChainIntact(isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_SetIteratorProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsSetIteratorLookupChainIntact(isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_StringIteratorProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsStringIteratorLookupChainIntact(isolate));
 }
 
 RUNTIME_FUNCTION(Runtime_ArrayIteratorProtector) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(
       Protectors::IsArrayIteratorLookupChainIntact(isolate));
 }
+
+RUNTIME_FUNCTION(Runtime_NoElementsProtector) {
+  SealHandleScope shs(isolate);
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
+  return isolate->heap()->ToBoolean(Protectors::IsNoElementsIntact(isolate));
+}
+
 // For use by tests and fuzzers. It
 //
 // 1. serializes a snapshot of the current isolate,
@@ -1583,7 +1845,9 @@ RUNTIME_FUNCTION(Runtime_ArrayIteratorProtector) {
 // once it completes.
 RUNTIME_FUNCTION(Runtime_SerializeDeserializeNow) {
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Snapshot::SerializeDeserializeAndVerifyForTesting(isolate,
                                                     isolate->native_context());
   return ReadOnlyRoots(isolate).undefined_value();
@@ -1591,16 +1855,18 @@ RUNTIME_FUNCTION(Runtime_SerializeDeserializeNow) {
 
 RUNTIME_FUNCTION(Runtime_HeapObjectVerify) {
   HandleScope shs(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<Object> object = args.at(0);
 #ifdef VERIFY_HEAP
-  object->ObjectVerify(isolate);
+  Object::ObjectVerify(*object, isolate);
 #else
-  CHECK(object->IsObject());
-  if (object->IsHeapObject()) {
-    CHECK(HeapObject::cast(*object).map().IsMap());
+  CHECK(IsObject(*object));
+  if (IsHeapObject(*object)) {
+    CHECK(IsMap(HeapObject::cast(*object)->map()));
   } else {
-    CHECK(object->IsSmi());
+    CHECK(IsSmi(*object));
   }
 #endif
   return isolate->heap()->ToBoolean(true);
@@ -1608,19 +1874,25 @@ RUNTIME_FUNCTION(Runtime_HeapObjectVerify) {
 
 RUNTIME_FUNCTION(Runtime_ArrayBufferMaxByteLength) {
   HandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return *isolate->factory()->NewNumber(JSArrayBuffer::kMaxByteLength);
 }
 
 RUNTIME_FUNCTION(Runtime_TypedArrayMaxLength) {
   HandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return *isolate->factory()->NewNumber(JSTypedArray::kMaxLength);
 }
 
 RUNTIME_FUNCTION(Runtime_CompleteInobjectSlackTracking) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
 
   Handle<JSObject> object = args.at<JSObject>(0);
   MapUpdater::CompleteInobjectSlackTracking(isolate, object->map());
@@ -1668,8 +1940,10 @@ RUNTIME_FUNCTION(Runtime_EnableCodeLoggingForTesting) {
     void SetterCallbackEvent(Handle<Name> name, Address entry_point) final {}
     void RegExpCodeCreateEvent(Handle<AbstractCode> code,
                                Handle<String> source) final {}
-    void CodeMoveEvent(InstructionStream from, InstructionStream to) final {}
-    void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) final {}
+    void CodeMoveEvent(Tagged<InstructionStream> from,
+                       Tagged<InstructionStream> to) final {}
+    void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                           Tagged<BytecodeArray> to) final {}
     void SharedFunctionInfoMoveEvent(Address from, Address to) final {}
     void NativeContextMoveEvent(Address from, Address to) final {}
     void CodeMovingGCEvent() final {}
@@ -1694,7 +1968,9 @@ RUNTIME_FUNCTION(Runtime_EnableCodeLoggingForTesting) {
 
 RUNTIME_FUNCTION(Runtime_NewRegExpWithBacktrackLimit) {
   HandleScope scope(isolate);
-  DCHECK_EQ(3, args.length());
+  if (args.length() != 3) {
+    return CrashUnlessFuzzing(isolate);
+  }
 
   Handle<String> pattern = args.at<String>(0);
   Handle<String> flags_string = args.at<String>(1);
@@ -1709,19 +1985,25 @@ RUNTIME_FUNCTION(Runtime_NewRegExpWithBacktrackLimit) {
 
 RUNTIME_FUNCTION(Runtime_Is64Bit) {
   SealHandleScope shs(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return isolate->heap()->ToBoolean(kSystemPointerSize == 8);
 }
 
 RUNTIME_FUNCTION(Runtime_BigIntMaxLengthBits) {
   HandleScope scope(isolate);
-  DCHECK_EQ(0, args.length());
+  if (args.length() != 0) {
+    return CrashUnlessFuzzing(isolate);
+  }
   return *isolate->factory()->NewNumber(BigInt::kMaxLengthBits);
 }
 
 RUNTIME_FUNCTION(Runtime_IsSameHeapObject) {
   HandleScope scope(isolate);
-  DCHECK_EQ(2, args.length());
+  if (args.length() != 2) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<HeapObject> obj1 = args.at<HeapObject>(0);
   Handle<HeapObject> obj2 = args.at<HeapObject>(1);
   return isolate->heap()->ToBoolean(obj1->address() == obj2->address());
@@ -1729,25 +2011,31 @@ RUNTIME_FUNCTION(Runtime_IsSameHeapObject) {
 
 RUNTIME_FUNCTION(Runtime_IsSharedString) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<HeapObject> obj = args.at<HeapObject>(0);
-  return isolate->heap()->ToBoolean(obj->IsString() &&
+  return isolate->heap()->ToBoolean(IsString(*obj) &&
                                     Handle<String>::cast(obj)->IsShared());
 }
 
 RUNTIME_FUNCTION(Runtime_IsInPlaceInternalizableString) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<HeapObject> obj = args.at<HeapObject>(0);
   return isolate->heap()->ToBoolean(
-      obj->IsString() && String::IsInPlaceInternalizable(String::cast(*obj)));
+      IsString(*obj) && String::IsInPlaceInternalizable(String::cast(*obj)));
 }
 
 RUNTIME_FUNCTION(Runtime_IsInternalizedString) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<HeapObject> obj = args.at<HeapObject>(0);
-  return isolate->heap()->ToBoolean(obj->IsInternalizedString());
+  return isolate->heap()->ToBoolean(IsInternalizedString(*obj));
 }
 
 RUNTIME_FUNCTION(Runtime_SharedGC) {
@@ -1759,18 +2047,22 @@ RUNTIME_FUNCTION(Runtime_SharedGC) {
 
 RUNTIME_FUNCTION(Runtime_AtomicsConditionNumWaitersForTesting) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<JSAtomicsCondition> cv = args.at<JSAtomicsCondition>(0);
   return cv->NumWaitersForTesting(isolate);
 }
 
 RUNTIME_FUNCTION(Runtime_GetWeakCollectionSize) {
   HandleScope scope(isolate);
-  DCHECK_EQ(1, args.length());
+  if (args.length() != 1) {
+    return CrashUnlessFuzzing(isolate);
+  }
   Handle<JSWeakCollection> collection = args.at<JSWeakCollection>(0);
 
   return Smi::FromInt(
-      EphemeronHashTable::cast(collection->table()).NumberOfElements());
+      EphemeronHashTable::cast(collection->table())->NumberOfElements());
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/runtime/runtime-trace.cc b/deps/v8/src/runtime/runtime-trace.cc
index 07641b3d4a6d9d..bd92269fd7d3fe 100644
--- a/deps/v8/src/runtime/runtime-trace.cc
+++ b/deps/v8/src/runtime/runtime-trace.cc
@@ -44,10 +44,10 @@ void PrintRegisterRange(UnoptimizedFrame* frame, std::ostream& os,
                         interpreter::Register first_reg, int range) {
   for (int reg_index = first_reg.index(); reg_index < first_reg.index() + range;
        reg_index++) {
-    Object reg_object = frame->ReadInterpreterRegister(reg_index);
+    Tagged<Object> reg_object = frame->ReadInterpreterRegister(reg_index);
     os << "      [ " << std::setw(reg_field_width)
        << interpreter::Register(reg_index).ToString() << arrow_direction;
-    reg_object.ShortPrint(os);
+    ShortPrint(reg_object, os);
     os << " ]" << std::endl;
   }
 }
@@ -72,7 +72,7 @@ void PrintRegisters(UnoptimizedFrame* frame, std::ostream& os, bool is_input,
       (!is_input &&
        interpreter::Bytecodes::WritesOrClobbersAccumulator(bytecode))) {
     os << "      [ " << kAccumulator << kArrowDirection;
-    accumulator->ShortPrint(os);
+    ShortPrint(*accumulator, os);
     os << " ]" << std::endl;
   }
 
@@ -210,13 +210,13 @@ RUNTIME_FUNCTION(Runtime_TraceUpdateFeedback) {
   int slot = args.smi_value_at(1);
   auto reason = String::cast(args[2]);
 
-  int slot_count = function->feedback_vector().metadata().slot_count();
+  int slot_count = function->feedback_vector()->metadata()->slot_count();
 
   StdoutStream os;
   os << "[Feedback slot " << slot << "/" << slot_count << " in ";
-  function->shared().ShortPrint(os);
+  ShortPrint(function->shared(), os);
   os << " updated to ";
-  function->feedback_vector().FeedbackSlotPrint(os, FeedbackSlot(slot));
+  function->feedback_vector()->FeedbackSlotPrint(os, FeedbackSlot(slot));
   os << " - ";
 
   StringCharacterStream stream(reason);
diff --git a/deps/v8/src/runtime/runtime-typedarray.cc b/deps/v8/src/runtime/runtime-typedarray.cc
index 989d1a2579293c..577f85f35d57ee 100644
--- a/deps/v8/src/runtime/runtime-typedarray.cc
+++ b/deps/v8/src/runtime/runtime-typedarray.cc
@@ -18,7 +18,7 @@ RUNTIME_FUNCTION(Runtime_ArrayBufferDetach) {
   HandleScope scope(isolate);
   // This runtime function is exposed in ClusterFuzz and as such has to
   // support arbitrary arguments.
-  if (args.length() < 1 || !args.at(0)->IsJSArrayBuffer()) {
+  if (args.length() < 1 || !IsJSArrayBuffer(*args.at(0))) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotTypedArray));
   }
@@ -37,7 +37,7 @@ RUNTIME_FUNCTION(Runtime_ArrayBufferSetDetachKey) {
   Handle<Object> key = args.at(1);
   // This runtime function is exposed in ClusterFuzz and as such has to
   // support arbitrary arguments.
-  if (!argument->IsJSArrayBuffer()) {
+  if (!IsJSArrayBuffer(*argument)) {
     THROW_NEW_ERROR_RETURN_FAILURE(
         isolate, NewTypeError(MessageTemplate::kNotTypedArray));
   }
@@ -120,7 +120,7 @@ RUNTIME_FUNCTION(Runtime_TypedArraySortFast) {
   // In case of a SAB, the data is copied into temporary memory, as
   // std::sort might crash in case the underlying data is concurrently
   // modified while sorting.
-  CHECK(array->buffer().IsJSArrayBuffer());
+  CHECK(IsJSArrayBuffer(array->buffer()));
   Handle<JSArrayBuffer> buffer(JSArrayBuffer::cast(array->buffer()), isolate);
   const bool copy_data = buffer->is_shared();
 
diff --git a/deps/v8/src/runtime/runtime-utils.h b/deps/v8/src/runtime/runtime-utils.h
index 1b8526c6904abb..345e326eed8d56 100644
--- a/deps/v8/src/runtime/runtime-utils.h
+++ b/deps/v8/src/runtime/runtime-utils.h
@@ -24,7 +24,7 @@ struct ObjectPair {
   Address y;
 };
 
-static inline ObjectPair MakePair(Object x, Object y) {
+static inline ObjectPair MakePair(Tagged<Object> x, Tagged<Object> y) {
   ObjectPair result = {x.ptr(), y.ptr()};
   // Pointers x and y returned in rax and rdx, in AMD-x64-abi.
   // In Win64 they are assigned to a hidden first argument.
@@ -32,7 +32,7 @@ static inline ObjectPair MakePair(Object x, Object y) {
 }
 #else
 using ObjectPair = uint64_t;
-static inline ObjectPair MakePair(Object x, Object y) {
+static inline ObjectPair MakePair(Tagged<Object> x, Tagged<Object> y) {
 #if defined(V8_TARGET_LITTLE_ENDIAN)
   return x.ptr() | (static_cast<ObjectPair>(y.ptr()) << 32);
 #elif defined(V8_TARGET_BIG_ENDIAN)
diff --git a/deps/v8/src/runtime/runtime-wasm.cc b/deps/v8/src/runtime/runtime-wasm.cc
index 8a772a3def0ba2..60d9e0516847bb 100644
--- a/deps/v8/src/runtime/runtime-wasm.cc
+++ b/deps/v8/src/runtime/runtime-wasm.cc
@@ -14,6 +14,7 @@
 #include "src/strings/unicode-inl.h"
 #include "src/trap-handler/trap-handler.h"
 #include "src/wasm/module-compiler.h"
+#include "src/wasm/serialized-signature-inl.h"
 #include "src/wasm/value-type.h"
 #include "src/wasm/wasm-code-manager.h"
 #include "src/wasm/wasm-constants.h"
@@ -82,7 +83,7 @@ WasmInstanceObject GetWasmInstanceOnStackTop(
 }
 
 Context GetNativeContextFromWasmInstanceOnStackTop(Isolate* isolate) {
-  return GetWasmInstanceOnStackTop(isolate).native_context();
+  return GetWasmInstanceOnStackTop(isolate)->native_context();
 }
 
 class V8_NODISCARD ClearThreadInWasmScope {
@@ -121,6 +122,52 @@ Object ThrowWasmError(Isolate* isolate, MessageTemplate message,
 }
 }  // namespace
 
+RUNTIME_FUNCTION(Runtime_WasmGenericWasmToJSObject) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(1, args.length());
+  Handle<Object> value(args[0], isolate);
+  if (IsWasmInternalFunction(*value)) {
+    Handle<WasmInternalFunction> internal =
+        Handle<WasmInternalFunction>::cast(value);
+    return *WasmInternalFunction::GetOrCreateExternal(internal);
+  }
+  if (IsWasmNull(*value)) return ReadOnlyRoots(isolate).null_value();
+  return *value;
+}
+
+// Takes a JS object and a wasm type as Smi. Type checks the object against the
+// type; if the check succeeds, returns the object in its wasm representation;
+// otherwise throws a type error.
+RUNTIME_FUNCTION(Runtime_WasmGenericJSToWasmObject) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(3, args.length());
+  Handle<Object> value(args[1], isolate);
+  // Make sure ValueType fits properly in a Smi.
+  static_assert(wasm::ValueType::kLastUsedBit + 1 <= kSmiValueSize);
+  int raw_type = args.smi_value_at(2);
+
+  wasm::ValueType type = wasm::ValueType::FromRawBitField(raw_type);
+  if (type.has_index()) {
+    Handle<WasmInstanceObject> instance(WasmInstanceObject::cast(args[0]),
+                                        isolate);
+    const wasm::WasmModule* module = instance->module();
+    DCHECK_NOT_NULL(module);
+    uint32_t canonical_index =
+        module->isorecursive_canonical_type_ids[type.ref_index()];
+    type = wasm::ValueType::RefMaybeNull(canonical_index, type.nullability());
+  }
+  const char* error_message;
+  {
+    Handle<Object> result;
+    if (JSToWasmObject(isolate, value, type, &error_message)
+            .ToHandle(&result)) {
+      return *result;
+    }
+  }
+  return isolate->Throw(
+      *isolate->factory()->NewTypeError(MessageTemplate::kWasmTrapJSTypeError));
+}
+
 // Takes a JS object and a wasm type as Smi. Type checks the object against the
 // type; if the check succeeds, returns the object in its wasm representation;
 // otherwise throws a type error.
@@ -140,11 +187,10 @@ RUNTIME_FUNCTION(Runtime_WasmJSToWasmObject) {
   wasm::ValueType expected_canonical =
       wasm::ValueType::FromRawBitField(raw_type);
   const char* error_message;
-
   Handle<Object> result;
-  bool success = internal::wasm::JSToWasmObject(
-                     isolate, value, expected_canonical, &error_message)
-                     .ToHandle(&result);
+  bool success =
+      JSToWasmObject(isolate, value, expected_canonical, &error_message)
+          .ToHandle(&result);
   Object ret = success ? *result
                        : isolate->Throw(*isolate->factory()->NewTypeError(
                              MessageTemplate::kWasmTrapJSTypeError));
@@ -157,14 +203,16 @@ RUNTIME_FUNCTION(Runtime_WasmJSToWasmObject) {
 RUNTIME_FUNCTION(Runtime_WasmMemoryGrow) {
   ClearThreadInWasmScope flag_scope(isolate);
   HandleScope scope(isolate);
-  DCHECK_EQ(2, args.length());
+  DCHECK_EQ(3, args.length());
   WasmInstanceObject instance = WasmInstanceObject::cast(args[0]);
-  // {delta_pages} is checked to be a positive smi in the WasmMemoryGrow builtin
-  // which calls this runtime function.
-  uint32_t delta_pages = args.positive_smi_value_at(1);
-
-  int ret = WasmMemoryObject::Grow(
-      isolate, handle(instance.memory_object(), isolate), delta_pages);
+  // {memory_index} and {delta_pages} are checked to be positive Smis in the
+  // WasmMemoryGrow builtin which calls this runtime function.
+  uint32_t memory_index = args.positive_smi_value_at(1);
+  uint32_t delta_pages = args.positive_smi_value_at(2);
+
+  Handle<WasmMemoryObject> memory_object{instance->memory_object(memory_index),
+                                         isolate};
+  int ret = WasmMemoryObject::Grow(isolate, memory_object, delta_pages);
   // The WasmMemoryGrow builtin which calls this runtime function expects us to
   // always return a Smi.
   DCHECK(!isolate->has_pending_exception());
@@ -244,32 +292,35 @@ RUNTIME_FUNCTION(Runtime_WasmStackGuard) {
 
   // Check if this is a real stack overflow.
   StackLimitCheck check(isolate);
-  if (check.JsHasOverflowed()) return isolate->StackOverflow();
+  if (check.WasmHasOverflowed()) return isolate->StackOverflow();
 
-  return isolate->stack_guard()->HandleInterrupts();
+  return isolate->stack_guard()->HandleInterrupts(
+      StackGuard::InterruptLevel::kAnyEffect);
 }
 
 RUNTIME_FUNCTION(Runtime_WasmCompileLazy) {
   ClearThreadInWasmScope wasm_flag(isolate);
-  DisallowHeapAllocation no_gc;
-  HandleScope scope(isolate);
   DCHECK_EQ(2, args.length());
   WasmInstanceObject instance = WasmInstanceObject::cast(args[0]);
   int func_index = args.smi_value_at(1);
 
+  TRACE_EVENT1("v8.wasm", "wasm.CompileLazy", "func_index", func_index);
+  DisallowHeapAllocation no_gc;
+  SealHandleScope scope(isolate);
+
   DCHECK(isolate->context().is_null());
-  isolate->set_context(instance.native_context());
+  isolate->set_context(instance->native_context());
   bool success = wasm::CompileLazy(isolate, instance, func_index);
   if (!success) {
     DCHECK(v8_flags.wasm_lazy_validation);
     AllowHeapAllocation throwing_unwinds_the_stack;
     wasm::ThrowLazyCompilationError(
-        isolate, instance.module_object().native_module(), func_index);
+        isolate, instance->module_object()->native_module(), func_index);
     DCHECK(isolate->has_pending_exception());
     return ReadOnlyRoots{isolate}.exception();
   }
 
-  return Smi::FromInt(wasm::JumpTableOffset(instance.module(), func_index));
+  return Smi::FromInt(wasm::JumpTableOffset(instance->module(), func_index));
 }
 
 RUNTIME_FUNCTION(Runtime_WasmAllocateFeedbackVector) {
@@ -281,7 +332,8 @@ RUNTIME_FUNCTION(Runtime_WasmAllocateFeedbackVector) {
   int declared_func_index = args.smi_value_at(1);
   wasm::NativeModule** native_module_stack_slot =
       reinterpret_cast<wasm::NativeModule**>(args.address_of_arg_at(2));
-  wasm::NativeModule* native_module = instance->module_object().native_module();
+  wasm::NativeModule* native_module =
+      instance->module_object()->native_module();
   DCHECK(native_module->enabled_features().has_inlining());
   // We have to save the native_module on the stack, in case the allocation
   // triggers a GC and we need the module to scan LiftoffSetupFrame stack frame.
@@ -297,8 +349,9 @@ RUNTIME_FUNCTION(Runtime_WasmAllocateFeedbackVector) {
                       : 0;
   Handle<FixedArray> vector =
       isolate->factory()->NewFixedArrayWithZeroes(num_slots);
-  DCHECK_EQ(instance->feedback_vectors().get(declared_func_index), Smi::zero());
-  instance->feedback_vectors().set(declared_func_index, *vector);
+  DCHECK_EQ(instance->feedback_vectors()->get(declared_func_index),
+            Smi::zero());
+  instance->feedback_vectors()->set(declared_func_index, *vector);
   return *vector;
 }
 
@@ -309,22 +362,21 @@ void ReplaceWrapper(Isolate* isolate, Handle<WasmInstanceObject> instance,
       WasmInstanceObject::GetWasmInternalFunction(isolate, instance,
                                                   function_index)
           .ToHandleChecked();
-  Handle<WasmExternalFunction> exported_function =
-      handle(WasmExternalFunction::cast(internal->external()), isolate);
+  Handle<JSFunction> exported_function =
+      WasmInternalFunction::GetOrCreateExternal(internal);
   exported_function->set_code(*wrapper_code);
-  WasmExportedFunctionData function_data =
-      exported_function->shared().wasm_exported_function_data();
-  function_data.set_wrapper_code(*wrapper_code);
+  Tagged<WasmExportedFunctionData> function_data =
+      exported_function->shared()->wasm_exported_function_data();
+  function_data->set_wrapper_code(*wrapper_code);
 }
 }  // namespace
 
 RUNTIME_FUNCTION(Runtime_WasmCompileWrapper) {
   HandleScope scope(isolate);
-  DCHECK_EQ(2, args.length());
-  Handle<WasmInstanceObject> instance(WasmInstanceObject::cast(args[0]),
-                                      isolate);
+  DCHECK_EQ(1, args.length());
   Handle<WasmExportedFunctionData> function_data(
-      WasmExportedFunctionData::cast(args[1]), isolate);
+      WasmExportedFunctionData::cast(args[0]), isolate);
+  Handle<WasmInstanceObject> instance(function_data->instance(), isolate);
   DCHECK(isolate->context().is_null());
   isolate->set_context(instance->native_context());
 
@@ -371,10 +423,143 @@ RUNTIME_FUNCTION(Runtime_WasmCompileWrapper) {
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
+RUNTIME_FUNCTION(Runtime_TierUpWasmToJSWrapper) {
+  HandleScope scope(isolate);
+  DCHECK_EQ(1, args.length());
+  Handle<WasmApiFunctionRef> ref(WasmApiFunctionRef::cast(args[0]), isolate);
+
+  DCHECK(isolate->context().is_null());
+  isolate->set_context(ref->native_context());
+
+  std::unique_ptr<wasm::ValueType[]> reps;
+  wasm::FunctionSig sig =
+      wasm::SerializedSignatureHelper::DeserializeSignature(ref->sig(), &reps);
+  Handle<Object> origin = handle(ref->call_origin(), isolate);
+
+  if (IsWasmInternalFunction(*origin)) {
+    // The tierup for `WasmInternalFunction is special, as there is no instance.
+    DCHECK(wasm::WasmFeatures::FromIsolate(isolate).has_typed_funcref());
+    size_t expected_arity = sig.parameter_count();
+    wasm::ImportCallKind kind = wasm::kDefaultImportCallKind;
+    if (IsJSFunction(ref->callable())) {
+      SharedFunctionInfo shared = JSFunction::cast(ref->callable())->shared();
+      expected_arity =
+          shared->internal_formal_parameter_count_without_receiver();
+      if (expected_arity != sig.parameter_count()) {
+        kind = wasm::ImportCallKind::kJSFunctionArityMismatch;
+      }
+    }
+    Handle<Code> wasm_to_js_wrapper_code =
+        compiler::CompileWasmToJSWrapper(
+            isolate, &sig, kind, static_cast<int>(expected_arity),
+            static_cast<wasm::Suspend>(ref->suspend()))
+            .ToHandleChecked();
+    // We have to install the optimized wrapper as `code`, as the generated
+    // code may move. `call_target` would become stale then.
+    Handle<WasmInternalFunction>::cast(origin)->set_code(
+        *wasm_to_js_wrapper_code);
+    // Reset a possibly existing generic wrapper in the call target.
+    Handle<WasmInternalFunction>::cast(origin)->init_call_target(isolate, 0);
+    return ReadOnlyRoots(isolate).undefined_value();
+  }
+
+  Handle<WasmInstanceObject> instance(WasmInstanceObject::cast(ref->instance()),
+                                      isolate);
+  if (IsTuple2(*origin)) {
+    Handle<Tuple2> tuple = Handle<Tuple2>::cast(origin);
+    instance = handle(WasmInstanceObject::cast(tuple->value1()), isolate);
+    origin = handle(tuple->value2(), isolate);
+  }
+  // Get the function's canonical signature index. Note that the function's
+  // signature may not be present in the importing module.
+  uint32_t canonical_sig_index =
+      wasm::GetTypeCanonicalizer()->AddRecursiveGroup(&sig);
+
+  // Compile a wrapper for the target callable.
+  Handle<JSReceiver> callable(JSReceiver::cast(ref->callable()), isolate);
+  wasm::Suspend suspend = static_cast<wasm::Suspend>(ref->suspend());
+  wasm::WasmCodeRefScope code_ref_scope;
+
+  wasm::NativeModule* native_module =
+      instance->module_object()->native_module();
+
+  wasm::WasmImportData resolved({}, -1, callable, &sig, canonical_sig_index);
+  wasm::ImportCallKind kind = resolved.kind();
+  callable = resolved.callable();  // Update to ultimate target.
+  DCHECK_NE(wasm::ImportCallKind::kLinkError, kind);
+  wasm::CompilationEnv env = native_module->CreateCompilationEnv();
+  // {expected_arity} should only be used if kind != kJSFunctionArityMismatch.
+  int expected_arity = -1;
+  if (kind == wasm::ImportCallKind ::kJSFunctionArityMismatch) {
+    expected_arity = Handle<JSFunction>::cast(callable)
+                         ->shared()
+                         ->internal_formal_parameter_count_without_receiver();
+  }
+
+  wasm::WasmImportWrapperCache* cache = native_module->import_wrapper_cache();
+  wasm::WasmCode* wasm_code =
+      cache->MaybeGet(kind, canonical_sig_index, expected_arity, suspend);
+  if (!wasm_code) {
+    wasm::WasmCompilationResult result = compiler::CompileWasmImportCallWrapper(
+        &env, kind, &sig, false, expected_arity, suspend);
+    std::unique_ptr<wasm::WasmCode> compiled_code = native_module->AddCode(
+        result.func_index, result.code_desc, result.frame_slot_count,
+        result.tagged_parameter_slots,
+        result.protected_instructions_data.as_vector(),
+        result.source_positions.as_vector(), GetCodeKind(result),
+        wasm::ExecutionTier::kNone, wasm::kNotForDebugging);
+    wasm_code = native_module->PublishCode(std::move(compiled_code));
+    isolate->counters()->wasm_generated_code_size()->Increment(
+        wasm_code->instructions().length());
+    isolate->counters()->wasm_reloc_size()->Increment(
+        wasm_code->reloc_info().length());
+
+    wasm::WasmImportWrapperCache::ModificationScope cache_scope(cache);
+    wasm::WasmImportWrapperCache::CacheKey key(kind, canonical_sig_index,
+                                               expected_arity, suspend);
+    cache_scope[key] = wasm_code;
+  }
+
+  if (WasmApiFunctionRef::CallOriginIsImportIndex(origin)) {
+    int func_index = WasmApiFunctionRef::CallOriginAsIndex(origin);
+    ImportedFunctionEntry entry(instance, func_index);
+    entry.set_target(wasm_code->instruction_start());
+  } else {
+    // Indirect function table index.
+    int entry_index = WasmApiFunctionRef::CallOriginAsIndex(origin);
+    int table_count = instance->indirect_function_tables()->length();
+    // We have to find the table which contains the correct entry.
+    for (int table_index = 0; table_index < table_count; ++table_index) {
+      Handle<WasmIndirectFunctionTable> table =
+          instance->GetIndirectFunctionTable(isolate, table_index);
+      if (table->refs()->get(entry_index) == *ref) {
+        table->targets()
+            ->set<ExternalPointerTag::kWasmIndirectFunctionTargetTag>(
+                entry_index, isolate, wasm_code->instruction_start());
+        // {ref} is used in at most one table.
+        break;
+      }
+    }
+  }
+  return ReadOnlyRoots(isolate).undefined_value();
+}
+
 RUNTIME_FUNCTION(Runtime_WasmTriggerTierUp) {
   ClearThreadInWasmScope clear_wasm_flag(isolate);
   SealHandleScope shs(isolate);
 
+  {
+    DisallowGarbageCollection no_gc;
+    DCHECK_EQ(1, args.length());
+    WasmInstanceObject instance = WasmInstanceObject::cast(args[0]);
+
+    FrameFinder<WasmFrame> frame_finder(isolate);
+    int func_index = frame_finder.frame()->function_index();
+    DCHECK_EQ(instance, frame_finder.frame()->wasm_instance());
+
+    wasm::TriggerTierUp(instance, func_index);
+  }
+
   // We're reusing this interrupt mechanism to interrupt long-running loops.
   StackLimitCheck check(isolate);
   // We don't need to handle stack overflows here, because the function that
@@ -384,33 +569,27 @@ RUNTIME_FUNCTION(Runtime_WasmTriggerTierUp) {
   // itself might have pushed us above the limit where a stack check would
   // fail.
   if (check.InterruptRequested()) {
+    // Note: This might trigger a GC, which invalidates the {args} object (see
+    // https://crbug.com/v8/13036#2).
     Object result = isolate->stack_guard()->HandleInterrupts();
-    if (result.IsException()) return result;
+    if (IsException(result)) return result;
   }
 
-  DisallowGarbageCollection no_gc;
-  DCHECK_EQ(1, args.length());
-  WasmInstanceObject instance = WasmInstanceObject::cast(args[0]);
-
-  FrameFinder<WasmFrame> frame_finder(isolate);
-  int func_index = frame_finder.frame()->function_index();
-  DCHECK_EQ(instance, frame_finder.frame()->wasm_instance());
-
-  wasm::TriggerTierUp(instance, func_index);
-
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
 RUNTIME_FUNCTION(Runtime_WasmAtomicNotify) {
   ClearThreadInWasmScope clear_wasm_flag(isolate);
   HandleScope scope(isolate);
-  DCHECK_EQ(3, args.length());
+  DCHECK_EQ(4, args.length());
   WasmInstanceObject instance = WasmInstanceObject::cast(args[0]);
-  double offset_double = args.number_value_at(1);
+  int memory_index = args.smi_value_at(1);
+  double offset_double = args.number_value_at(2);
   uintptr_t offset = static_cast<uintptr_t>(offset_double);
-  uint32_t count = NumberToUint32(args[2]);
-  Handle<JSArrayBuffer> array_buffer{instance.memory_object().array_buffer(),
-                                     isolate};
+  uint32_t count = NumberToUint32(args[3]);
+
+  Handle<JSArrayBuffer> array_buffer{
+      instance->memory_object(memory_index)->array_buffer(), isolate};
   // Should have trapped if address was OOB.
   DCHECK_LT(offset, array_buffer->byte_length());
   if (!array_buffer->is_shared()) return Smi::FromInt(0);
@@ -420,15 +599,16 @@ RUNTIME_FUNCTION(Runtime_WasmAtomicNotify) {
 RUNTIME_FUNCTION(Runtime_WasmI32AtomicWait) {
   ClearThreadInWasmScope clear_wasm_flag(isolate);
   HandleScope scope(isolate);
-  DCHECK_EQ(4, args.length());
+  DCHECK_EQ(5, args.length());
   WasmInstanceObject instance = WasmInstanceObject::cast(args[0]);
-  double offset_double = args.number_value_at(1);
+  int memory_index = args.smi_value_at(1);
+  double offset_double = args.number_value_at(2);
   uintptr_t offset = static_cast<uintptr_t>(offset_double);
-  int32_t expected_value = NumberToInt32(args[2]);
-  BigInt timeout_ns = BigInt::cast(args[3]);
+  int32_t expected_value = NumberToInt32(args[3]);
+  BigInt timeout_ns = BigInt::cast(args[4]);
 
-  Handle<JSArrayBuffer> array_buffer{instance.memory_object().array_buffer(),
-                                     isolate};
+  Handle<JSArrayBuffer> array_buffer{
+      instance->memory_object(memory_index)->array_buffer(), isolate};
   // Should have trapped if address was OOB.
   DCHECK_LT(offset, array_buffer->byte_length());
 
@@ -439,21 +619,22 @@ RUNTIME_FUNCTION(Runtime_WasmI32AtomicWait) {
         isolate->factory()->NewStringFromAsciiChecked("Atomics.wait"));
   }
   return FutexEmulation::WaitWasm32(isolate, array_buffer, offset,
-                                    expected_value, timeout_ns.AsInt64());
+                                    expected_value, timeout_ns->AsInt64());
 }
 
 RUNTIME_FUNCTION(Runtime_WasmI64AtomicWait) {
   ClearThreadInWasmScope clear_wasm_flag(isolate);
   HandleScope scope(isolate);
-  DCHECK_EQ(4, args.length());
+  DCHECK_EQ(5, args.length());
   WasmInstanceObject instance = WasmInstanceObject::cast(args[0]);
-  double offset_double = args.number_value_at(1);
+  int memory_index = args.smi_value_at(1);
+  double offset_double = args.number_value_at(2);
   uintptr_t offset = static_cast<uintptr_t>(offset_double);
-  BigInt expected_value = BigInt::cast(args[2]);
-  BigInt timeout_ns = BigInt::cast(args[3]);
+  BigInt expected_value = BigInt::cast(args[3]);
+  BigInt timeout_ns = BigInt::cast(args[4]);
 
-  Handle<JSArrayBuffer> array_buffer{instance.memory_object().array_buffer(),
-                                     isolate};
+  Handle<JSArrayBuffer> array_buffer{
+      instance->memory_object(memory_index)->array_buffer(), isolate};
   // Should have trapped if address was OOB.
   DCHECK_LT(offset, array_buffer->byte_length());
 
@@ -464,8 +645,8 @@ RUNTIME_FUNCTION(Runtime_WasmI64AtomicWait) {
         isolate->factory()->NewStringFromAsciiChecked("Atomics.wait"));
   }
   return FutexEmulation::WaitWasm64(isolate, array_buffer, offset,
-                                    expected_value.AsInt64(),
-                                    timeout_ns.AsInt64());
+                                    expected_value->AsInt64(),
+                                    timeout_ns->AsInt64());
 }
 
 namespace {
@@ -492,6 +673,15 @@ RUNTIME_FUNCTION(Runtime_WasmRefFunc) {
                                                               function_index);
 }
 
+RUNTIME_FUNCTION(Runtime_WasmInternalFunctionCreateExternal) {
+  ClearThreadInWasmScope flag_scope(isolate);
+  HandleScope scope(isolate);
+  DCHECK_EQ(1, args.length());
+  Handle<WasmInternalFunction> internal(WasmInternalFunction::cast(args[0]),
+                                        isolate);
+  return *WasmInternalFunction::GetOrCreateExternal(internal);
+}
+
 RUNTIME_FUNCTION(Runtime_WasmFunctionTableGet) {
   ClearThreadInWasmScope flag_scope(isolate);
   HandleScope scope(isolate);
@@ -499,17 +689,17 @@ RUNTIME_FUNCTION(Runtime_WasmFunctionTableGet) {
   WasmInstanceObject instance = WasmInstanceObject::cast(args[0]);
   uint32_t table_index = args.positive_smi_value_at(1);
   uint32_t entry_index = args.positive_smi_value_at(2);
-  DCHECK_LT(table_index, instance.tables().length());
-  auto table = handle(WasmTableObject::cast(instance.tables().get(table_index)),
-                      isolate);
+  DCHECK_LT(table_index, instance->tables()->length());
+  auto table = handle(
+      WasmTableObject::cast(instance->tables()->get(table_index)), isolate);
   // We only use the runtime call for lazily initialized function references.
   DCHECK(
-      table->instance().IsUndefined()
+      IsUndefined(table->instance())
           ? table->type() == wasm::kWasmFuncRef
           : IsSubtypeOf(table->type(), wasm::kWasmFuncRef,
-                        WasmInstanceObject::cast(table->instance()).module()));
+                        WasmInstanceObject::cast(table->instance())->module()));
 
-  if (!WasmTableObject::IsInBounds(isolate, table, entry_index)) {
+  if (!table->is_in_bounds(entry_index)) {
     return ThrowWasmError(isolate, MessageTemplate::kWasmTrapTableOutOfBounds);
   }
 
@@ -524,17 +714,17 @@ RUNTIME_FUNCTION(Runtime_WasmFunctionTableSet) {
   uint32_t table_index = args.positive_smi_value_at(1);
   uint32_t entry_index = args.positive_smi_value_at(2);
   Handle<Object> element(args[3], isolate);
-  DCHECK_LT(table_index, instance.tables().length());
-  auto table = handle(WasmTableObject::cast(instance.tables().get(table_index)),
-                      isolate);
+  DCHECK_LT(table_index, instance->tables()->length());
+  auto table = handle(
+      WasmTableObject::cast(instance->tables()->get(table_index)), isolate);
   // We only use the runtime call for lazily initialized function references.
   DCHECK(
-      table->instance().IsUndefined()
+      IsUndefined(table->instance())
           ? table->type() == wasm::kWasmFuncRef
           : IsSubtypeOf(table->type(), wasm::kWasmFuncRef,
-                        WasmInstanceObject::cast(table->instance()).module()));
+                        WasmInstanceObject::cast(table->instance())->module()));
 
-  if (!WasmTableObject::IsInBounds(isolate, table, entry_index)) {
+  if (!table->is_in_bounds(entry_index)) {
     return ThrowWasmError(isolate, MessageTemplate::kWasmTrapTableOutOfBounds);
   }
   WasmTableObject::Set(isolate, table, entry_index, element);
@@ -600,7 +790,7 @@ RUNTIME_FUNCTION(Runtime_WasmTableGrow) {
   uint32_t delta = args.positive_smi_value_at(3);
 
   Handle<WasmTableObject> table(
-      WasmTableObject::cast(instance.tables().get(table_index)), isolate);
+      WasmTableObject::cast(instance->tables()->get(table_index)), isolate);
   int result = WasmTableObject::Grow(isolate, table, delta, value);
 
   return Smi::FromInt(result);
@@ -618,7 +808,7 @@ RUNTIME_FUNCTION(Runtime_WasmTableFill) {
   uint32_t count = args.positive_smi_value_at(4);
 
   Handle<WasmTableObject> table(
-      WasmTableObject::cast(instance->tables().get(table_index)), isolate);
+      WasmTableObject::cast(instance->tables()->get(table_index)), isolate);
 
   uint32_t table_size = table->current_length();
 
@@ -642,8 +832,8 @@ namespace {
 bool ExecuteWasmDebugBreaks(Isolate* isolate,
                             Handle<WasmInstanceObject> instance,
                             WasmFrame* frame) {
-  Handle<Script> script{instance->module_object().script(), isolate};
-  auto* debug_info = instance->module_object().native_module()->GetDebugInfo();
+  Handle<Script> script{instance->module_object()->script(), isolate};
+  auto* debug_info = instance->module_object()->native_module()->GetDebugInfo();
 
   // Enter the debugger.
   DebugScope debug_scope(isolate->debug());
@@ -660,10 +850,10 @@ bool ExecuteWasmDebugBreaks(Isolate* isolate,
     script->set_break_on_entry(false);
     // Update the "break_on_entry" flag on all live instances.
     i::WeakArrayList weak_instance_list = script->wasm_weak_instance_list();
-    for (int i = 0; i < weak_instance_list.length(); ++i) {
-      if (weak_instance_list.Get(i)->IsCleared()) continue;
-      i::WasmInstanceObject::cast(weak_instance_list.Get(i)->GetHeapObject())
-          .set_break_on_entry(false);
+    for (int i = 0; i < weak_instance_list->length(); ++i) {
+      if (weak_instance_list->Get(i)->IsCleared()) continue;
+      i::WasmInstanceObject::cast(weak_instance_list->Get(i).GetHeapObject())
+          ->set_break_on_entry(false);
     }
     DCHECK(!instance->break_on_entry());
     if (!maybe_on_entry_breakpoints.is_null()) {
@@ -715,7 +905,7 @@ RUNTIME_FUNCTION(Runtime_WasmDebugBreak) {
     // not request stepping, clear this (to save further calls into this runtime
     // function).
     auto* debug_info =
-        instance->module_object().native_module()->GetDebugInfo();
+        instance->module_object()->native_module()->GetDebugInfo();
     debug_info->ClearStepping(frame);
   }
 
@@ -727,14 +917,16 @@ RUNTIME_FUNCTION(Runtime_WasmDebugBreak) {
     Object interrupt_object = isolate->stack_guard()->HandleInterrupts();
     // Interrupt handling can create an exception, including the
     // termination exception.
-    if (interrupt_object.IsException(isolate)) return interrupt_object;
-    DCHECK(interrupt_object.IsUndefined(isolate));
+    if (IsException(interrupt_object, isolate)) return interrupt_object;
+    DCHECK(IsUndefined(interrupt_object, isolate));
   }
 
   return ReadOnlyRoots(isolate).undefined_value();
 }
 
 // Assumes copy ranges are in-bounds and copy length > 0.
+// TODO(manoskouk): Unify part of this with the implementation in
+// wasm-extern-refs.cc
 RUNTIME_FUNCTION(Runtime_WasmArrayCopy) {
   ClearThreadInWasmScope flag_scope(isolate);
   HandleScope scope(isolate);
@@ -750,10 +942,10 @@ RUNTIME_FUNCTION(Runtime_WasmArrayCopy) {
       dst_array.ptr() == src_array.ptr() &&
       (dst_index < src_index ? dst_index + length > src_index
                              : src_index + length > dst_index);
-  wasm::ValueType element_type = src_array.type()->element_type();
+  wasm::ValueType element_type = src_array->type()->element_type();
   if (element_type.is_reference()) {
-    ObjectSlot dst_slot = dst_array.ElementSlot(dst_index);
-    ObjectSlot src_slot = src_array.ElementSlot(src_index);
+    ObjectSlot dst_slot = dst_array->ElementSlot(dst_index);
+    ObjectSlot src_slot = src_array->ElementSlot(src_index);
     if (overlapping_ranges) {
       isolate->heap()->MoveRange(dst_array, dst_slot, src_slot, length,
                                  UPDATE_WRITE_BARRIER);
@@ -762,8 +954,8 @@ RUNTIME_FUNCTION(Runtime_WasmArrayCopy) {
                                  UPDATE_WRITE_BARRIER);
     }
   } else {
-    void* dst = reinterpret_cast<void*>(dst_array.ElementAddress(dst_index));
-    void* src = reinterpret_cast<void*>(src_array.ElementAddress(src_index));
+    void* dst = reinterpret_cast<void*>(dst_array->ElementAddress(dst_index));
+    void* src = reinterpret_cast<void*>(src_array->ElementAddress(src_index));
     size_t copy_size = length * element_type.value_kind_size();
     if (overlapping_ranges) {
       MemMove(dst, src, copy_size);
@@ -786,7 +978,7 @@ RUNTIME_FUNCTION(Runtime_WasmArrayNewSegment) {
   Handle<Map> rtt(Map::cast(args[4]), isolate);
 
   wasm::ArrayType* type =
-      reinterpret_cast<wasm::ArrayType*>(rtt->wasm_type_info().native_type());
+      reinterpret_cast<wasm::ArrayType*>(rtt->wasm_type_info()->native_type());
 
   uint32_t element_size = type->element_type().value_kind_size();
   // This check also implies no overflow.
@@ -795,29 +987,29 @@ RUNTIME_FUNCTION(Runtime_WasmArrayNewSegment) {
   }
 
   if (type->element_type().is_numeric()) {
+    // No chance of overflow due to the check above.
     uint32_t length_in_bytes = length * element_size;
 
-    DCHECK_EQ(length_in_bytes / element_size, length);
     if (!base::IsInBounds<uint32_t>(
             offset, length_in_bytes,
-            instance->data_segment_sizes().get(segment_index))) {
+            instance->data_segment_sizes()->get(segment_index))) {
       return ThrowWasmError(isolate,
                             MessageTemplate::kWasmTrapDataSegmentOutOfBounds);
     }
 
     Address source =
-        instance->data_segment_starts().get(segment_index) + offset;
+        instance->data_segment_starts()->get(segment_index) + offset;
     return *isolate->factory()->NewWasmArrayFromMemory(length, rtt, source);
   } else {
     Handle<Object> elem_segment_raw =
-        handle(instance->element_segments().get(segment_index), isolate);
+        handle(instance->element_segments()->get(segment_index), isolate);
     const wasm::WasmElemSegment* module_elem_segment =
         &instance->module()->elem_segments[segment_index];
     // If the segment is initialized in the instance, we have to get its length
     // from there, as it might have been dropped. If the segment is
     // uninitialized, we need to fetch its length from the module.
     int segment_length =
-        elem_segment_raw->IsFixedArray()
+        IsFixedArray(*elem_segment_raw)
             ? Handle<FixedArray>::cast(elem_segment_raw)->length()
             : module_elem_segment->element_count;
     if (!base::IsInBounds<size_t>(offset, length, segment_length)) {
@@ -826,36 +1018,103 @@ RUNTIME_FUNCTION(Runtime_WasmArrayNewSegment) {
     }
     Handle<Object> result = isolate->factory()->NewWasmArrayFromElementSegment(
         instance, segment_index, offset, length, rtt);
-    if (result->IsSmi()) {
+    if (IsSmi(*result)) {
       return ThrowWasmError(
-          isolate, static_cast<MessageTemplate>(result->ToSmi().value()));
+          isolate, static_cast<MessageTemplate>(Smi::cast(*result).value()));
     } else {
       return *result;
     }
   }
 }
 
-namespace {
-// Synchronize the stack limit with the active continuation for stack-switching.
-// This can be done before or after changing the stack pointer itself, as long
-// as we update both before the next stack check.
-// {StackGuard::SetStackLimit} doesn't update the value of the jslimit if it
-// contains a sentinel value, and it is also thread-safe. So if an interrupt is
-// requested before, during or after this call, it will be preserved and handled
-// at the next stack check.
-void SyncStackLimit(Isolate* isolate) {
-  DisallowGarbageCollection no_gc;
-  auto continuation = WasmContinuationObject::cast(
-      isolate->root(RootIndex::kActiveContinuation));
-  auto stack = Managed<wasm::StackMemory>::cast(continuation.stack()).get();
-  if (v8_flags.trace_wasm_stack_switching) {
-    PrintF("Switch to stack #%d\n", stack->id());
+RUNTIME_FUNCTION(Runtime_WasmArrayInitSegment) {
+  ClearThreadInWasmScope flag_scope(isolate);
+  HandleScope scope(isolate);
+  DCHECK_EQ(6, args.length());
+  Handle<WasmInstanceObject> instance(WasmInstanceObject::cast(args[0]),
+                                      isolate);
+  uint32_t segment_index = args.positive_smi_value_at(1);
+  Handle<WasmArray> array(WasmArray::cast(args[2]), isolate);
+  uint32_t array_index = args.positive_smi_value_at(3);
+  uint32_t segment_offset = args.positive_smi_value_at(4);
+  uint32_t length = args.positive_smi_value_at(5);
+
+  wasm::ArrayType* type = reinterpret_cast<wasm::ArrayType*>(
+      array->map()->wasm_type_info()->native_type());
+
+  uint32_t element_size = type->element_type().value_kind_size();
+
+  if (type->element_type().is_numeric()) {
+    if (!base::IsInBounds<uint32_t>(array_index, length, array->length())) {
+      return ThrowWasmError(isolate,
+                            MessageTemplate::kWasmTrapArrayOutOfBounds);
+    }
+
+    // No chance of overflow, due to the check above and the limit in array
+    // length.
+    uint32_t length_in_bytes = length * element_size;
+
+    if (!base::IsInBounds<uint32_t>(
+            segment_offset, length_in_bytes,
+            instance->data_segment_sizes()->get(segment_index))) {
+      return ThrowWasmError(isolate,
+                            MessageTemplate::kWasmTrapDataSegmentOutOfBounds);
+    }
+
+    Address source =
+        instance->data_segment_starts()->get(segment_index) + segment_offset;
+    Address dest = array->ElementAddress(array_index);
+#if V8_TARGET_BIG_ENDIAN
+    MemCopyAndSwitchEndianness(reinterpret_cast<void*>(dest),
+                               reinterpret_cast<void*>(source), length,
+                               element_size);
+#else
+    MemCopy(reinterpret_cast<void*>(dest), reinterpret_cast<void*>(source),
+            length_in_bytes);
+#endif
+    return *isolate->factory()->undefined_value();
+  } else {
+    Handle<Object> elem_segment_raw =
+        handle(instance->element_segments()->get(segment_index), isolate);
+    const wasm::WasmElemSegment* module_elem_segment =
+        &instance->module()->elem_segments[segment_index];
+    // If the segment is initialized in the instance, we have to get its length
+    // from there, as it might have been dropped. If the segment is
+    // uninitialized, we need to fetch its length from the module.
+    int segment_length =
+        IsFixedArray(*elem_segment_raw)
+            ? Handle<FixedArray>::cast(elem_segment_raw)->length()
+            : module_elem_segment->element_count;
+    if (!base::IsInBounds<size_t>(segment_offset, length, segment_length)) {
+      return ThrowWasmError(
+          isolate, MessageTemplate::kWasmTrapElementSegmentOutOfBounds);
+    }
+    if (!base::IsInBounds(array_index, length, array->length())) {
+      return ThrowWasmError(isolate,
+                            MessageTemplate::kWasmTrapArrayOutOfBounds);
+    }
+
+    // If the element segment has not been initialized yet, lazily initialize it
+    // now.
+    AccountingAllocator allocator;
+    Zone zone(&allocator, ZONE_NAME);
+    base::Optional<MessageTemplate> opt_error =
+        wasm::InitializeElementSegment(&zone, isolate, instance, segment_index);
+    if (opt_error.has_value()) {
+      return ThrowWasmError(isolate, opt_error.value());
+    }
+
+    auto elements = handle(
+        FixedArray::cast(instance->element_segments()->get(segment_index)),
+        isolate);
+    if (length > 0) {
+      isolate->heap()->CopyRange(*array, array->ElementSlot(array_index),
+                                 elements->RawFieldOfElementAt(segment_offset),
+                                 length, UPDATE_WRITE_BARRIER);
+    }
+    return *isolate->factory()->undefined_value();
   }
-  uintptr_t limit = reinterpret_cast<uintptr_t>(stack->jmpbuf()->stack_limit);
-  isolate->stack_guard()->SetStackLimit(limit);
-  isolate->RecordStackSwitchForScanning();
 }
-}  // namespace
 
 // Allocate a new suspender, and prepare for stack switching by updating the
 // active continuation, active suspender and stack limit.
@@ -871,7 +1130,7 @@ RUNTIME_FUNCTION(Runtime_WasmAllocateSuspender) {
   Handle<WasmContinuationObject> target =
       WasmContinuationObject::New(isolate, wasm::JumpBuffer::Inactive, parent);
   auto target_stack =
-      Managed<wasm::StackMemory>::cast(target->stack()).get().get();
+      Managed<wasm::StackMemory>::cast(target->stack())->get().get();
   isolate->wasm_stacks()->Add(target_stack);
   isolate->roots_table().slot(RootIndex::kActiveContinuation).store(*target);
 
@@ -883,7 +1142,7 @@ RUNTIME_FUNCTION(Runtime_WasmAllocateSuspender) {
   suspender->set_continuation(*target);
   active_suspender_slot.store(*suspender);
 
-  SyncStackLimit(isolate);
+  // Stack limit will be updated in WasmReturnPromiseOnSuspendAsm builtin.
   wasm::JumpBuffer* jmpbuf = reinterpret_cast<wasm::JumpBuffer*>(
       parent->ReadExternalPointerField<kWasmContinuationJmpbufTag>(
           WasmContinuationObject::kJmpbufOffset, isolate));
@@ -892,33 +1151,6 @@ RUNTIME_FUNCTION(Runtime_WasmAllocateSuspender) {
   return *suspender;
 }
 
-// Update the stack limit after a stack switch, and preserve pending interrupts.
-RUNTIME_FUNCTION(Runtime_WasmSyncStackLimit) {
-  CHECK(v8_flags.experimental_wasm_stack_switching);
-  SyncStackLimit(isolate);
-  return ReadOnlyRoots(isolate).undefined_value();
-}
-
-// Takes a promise and a suspender, and returns
-// promise.then(suspender.resume(), suspender.reject());
-RUNTIME_FUNCTION(Runtime_WasmCreateResumePromise) {
-  CHECK(v8_flags.experimental_wasm_stack_switching);
-  HandleScope scope(isolate);
-  Handle<Object> promise(args[0], isolate);
-  WasmSuspenderObject suspender = WasmSuspenderObject::cast(args[1]);
-
-  i::Handle<i::Object> argv[] = {handle(suspender.resume(), isolate),
-                                 handle(suspender.reject(), isolate)};
-  i::Handle<i::Object> result;
-  bool has_pending_exception =
-      !i::Execution::CallBuiltin(isolate, isolate->promise_then(), promise,
-                                 arraysize(argv), argv)
-           .ToHandle(&result);
-  // TODO(thibaudm): Propagate exception.
-  CHECK(!has_pending_exception);
-  return *result;
-}
-
 #define RETURN_RESULT_OR_TRAP(call)                                            \
   do {                                                                         \
     Handle<Object> result;                                                     \
@@ -959,12 +1191,13 @@ RUNTIME_FUNCTION(Runtime_WasmStringNewWtf8) {
 
   auto utf8_variant = static_cast<unibrow::Utf8Variant>(utf8_variant_value);
 
-  uint64_t mem_size = instance.memory_size();
+  // TODO(14261): Support multiple memories.
+  uint64_t mem_size = instance->memory0_size();
   if (!base::IsInBounds<uint64_t>(offset, size, mem_size)) {
     return ThrowWasmError(isolate, MessageTemplate::kWasmTrapMemOutOfBounds);
   }
 
-  const base::Vector<const uint8_t> bytes{instance.memory_start() + offset,
+  const base::Vector<const uint8_t> bytes{instance->memory0_start() + offset,
                                           size};
   MaybeHandle<v8::internal::String> result_string =
       isolate->factory()->NewStringFromUtf8(bytes, utf8_variant);
@@ -1015,7 +1248,8 @@ RUNTIME_FUNCTION(Runtime_WasmStringNewWtf16) {
   DCHECK_EQ(memory, 0);
   USE(memory);
 
-  uint64_t mem_size = instance.memory_size();
+  // TODO(14261): Support multiple memories.
+  uint64_t mem_size = instance->memory0_size();
   if (size_in_codeunits > kMaxUInt32 / 2 ||
       !base::IsInBounds<uint64_t>(offset, size_in_codeunits * 2, mem_size)) {
     return ThrowWasmError(isolate, MessageTemplate::kWasmTrapMemOutOfBounds);
@@ -1024,7 +1258,7 @@ RUNTIME_FUNCTION(Runtime_WasmStringNewWtf16) {
     return ThrowWasmError(isolate, MessageTemplate::kWasmTrapUnalignedAccess);
   }
 
-  const byte* bytes = instance.memory_start() + offset;
+  const uint8_t* bytes = instance->memory0_start() + offset;
   const base::uc16* codeunits = reinterpret_cast<const base::uc16*>(bytes);
   RETURN_RESULT_OR_TRAP(isolate->factory()->NewStringFromTwoByteLittleEndian(
       {codeunits, size_in_codeunits}));
@@ -1042,6 +1276,18 @@ RUNTIME_FUNCTION(Runtime_WasmStringNewWtf16Array) {
       isolate->factory()->NewStringFromUtf16(array, start, end));
 }
 
+RUNTIME_FUNCTION(Runtime_WasmSubstring) {
+  ClearThreadInWasmScope flag_scope(isolate);
+  DCHECK_EQ(3, args.length());
+  HandleScope scope(isolate);
+  Handle<String> string(String::cast(args[0]), isolate);
+  int start = args.positive_smi_value_at(1);
+  int length = args.positive_smi_value_at(2);
+
+  string = String::Flatten(isolate, string);
+  return *isolate->factory()->NewCopiedSubstring(string, start, length);
+}
+
 // Returns the new string if the operation succeeds.  Otherwise traps.
 RUNTIME_FUNCTION(Runtime_WasmStringConst) {
   ClearThreadInWasmScope flag_scope(isolate);
@@ -1052,12 +1298,12 @@ RUNTIME_FUNCTION(Runtime_WasmStringConst) {
       base::IsInRange(wasm::kV8MaxWasmStringLiterals, 0, Smi::kMaxValue));
   uint32_t index = args.positive_smi_value_at(1);
 
-  DCHECK_LT(index, instance.module()->stringref_literals.size());
+  DCHECK_LT(index, instance->module()->stringref_literals.size());
 
   const wasm::WasmStringRefLiteral& literal =
-      instance.module()->stringref_literals[index];
+      instance->module()->stringref_literals[index];
   const base::Vector<const uint8_t> module_bytes =
-      instance.module_object().native_module()->wire_bytes();
+      instance->module_object()->native_module()->wire_bytes();
   const base::Vector<const uint8_t> string_bytes =
       module_bytes.SubVector(literal.source.offset(),
                              literal.source.offset() + literal.source.length());
@@ -1067,6 +1313,29 @@ RUNTIME_FUNCTION(Runtime_WasmStringConst) {
               .ToHandleChecked();
 }
 
+RUNTIME_FUNCTION(Runtime_WasmStringNewSegmentWtf8) {
+  ClearThreadInWasmScope flag_scope(isolate);
+  DCHECK_EQ(4, args.length());
+  HandleScope scope(isolate);
+  Handle<WasmInstanceObject> instance(WasmInstanceObject::cast(args[0]),
+                                      isolate);
+  uint32_t segment_index = args.positive_smi_value_at(1);
+  uint32_t offset = args.positive_smi_value_at(2);
+  uint32_t length = args.positive_smi_value_at(3);
+
+  if (!base::IsInBounds<uint32_t>(
+          offset, length, instance->data_segment_sizes()->get(segment_index))) {
+    return ThrowWasmError(isolate,
+                          MessageTemplate::kWasmTrapDataSegmentOutOfBounds);
+  }
+
+  Address source = instance->data_segment_starts()->get(segment_index) + offset;
+  RETURN_RESULT_OR_FAILURE(
+      isolate, isolate->factory()->NewStringFromUtf8(
+                   {reinterpret_cast<const uint8_t*>(source), length},
+                   unibrow::Utf8Variant::kWtf8));
+}
+
 namespace {
 // TODO(12868): Consider unifying with api.cc:String::Utf8Length.
 template <typename T>
@@ -1222,11 +1491,12 @@ RUNTIME_FUNCTION(Runtime_WasmStringEncodeWtf8) {
   DCHECK(utf8_variant_value <=
          static_cast<uint32_t>(unibrow::Utf8Variant::kLastUtf8Variant));
 
-  char* memory_start = reinterpret_cast<char*>(instance.memory_start());
+  // TODO(14261): Support multiple memories.
+  char* memory_start = reinterpret_cast<char*>(instance->memory0_start());
   auto utf8_variant = static_cast<unibrow::Utf8Variant>(utf8_variant_value);
   auto get_writable_bytes =
       [&](const DisallowGarbageCollection&) -> base::Vector<char> {
-    return {memory_start, instance.memory_size()};
+    return {memory_start, instance->memory0_size()};
   };
   return EncodeWtf8(isolate, utf8_variant, string, get_writable_bytes, offset,
                     MessageTemplate::kWasmTrapMemOutOfBounds);
@@ -1265,9 +1535,10 @@ RUNTIME_FUNCTION(Runtime_WasmStringEncodeWtf16) {
 
   DCHECK_EQ(memory, 0);
   USE(memory);
-  DCHECK(base::IsInBounds<uint32_t>(start, length, string.length()));
+  DCHECK(base::IsInBounds<uint32_t>(start, length, string->length()));
 
-  size_t mem_size = instance.memory_size();
+  // TODO(14261): Support multiple memories.
+  size_t mem_size = instance->memory0_size();
   static_assert(String::kMaxLength <=
                 (std::numeric_limits<size_t>::max() / sizeof(base::uc16)));
   if (!base::IsInBounds<size_t>(offset, length * sizeof(base::uc16),
@@ -1279,7 +1550,8 @@ RUNTIME_FUNCTION(Runtime_WasmStringEncodeWtf16) {
   }
 
 #if defined(V8_TARGET_LITTLE_ENDIAN)
-  uint16_t* dst = reinterpret_cast<uint16_t*>(instance.memory_start() + offset);
+  uint16_t* dst =
+      reinterpret_cast<uint16_t*>(instance->memory0_start() + offset);
   String::WriteToFlat(string, dst, start, length);
 #elif defined(V8_TARGET_BIG_ENDIAN)
   // TODO(12868): The host is big-endian but we need to write the string
@@ -1332,14 +1604,15 @@ RUNTIME_FUNCTION(Runtime_WasmStringViewWtf8Encode) {
   auto utf8_variant = static_cast<unibrow::Utf8Variant>(utf8_variant_value);
   size_t length = end - start;
 
-  if (!base::IsInBounds<size_t>(addr, length, instance.memory_size())) {
+  // TODO(14261): Support multiple memories.
+  if (!base::IsInBounds<size_t>(addr, length, instance->memory0_size())) {
     return ThrowWasmError(isolate, MessageTemplate::kWasmTrapMemOutOfBounds);
   }
 
-  byte* memory_start = reinterpret_cast<byte*>(instance.memory_start());
-  const byte* src =
-      reinterpret_cast<const byte*>(array->GetDataStartAddress() + start);
-  byte* dst = memory_start + addr;
+  uint8_t* memory_start = reinterpret_cast<uint8_t*>(instance->memory0_start());
+  const uint8_t* src =
+      reinterpret_cast<const uint8_t*>(array->GetDataStartAddress() + start);
+  uint8_t* dst = memory_start + addr;
 
   std::vector<size_t> surrogates;
   if (utf8_variant != unibrow::Utf8Variant::kWtf8) {
@@ -1413,7 +1686,7 @@ RUNTIME_FUNCTION(Runtime_WasmStringHash) {
   ClearThreadInWasmScope flag_scope(isolate);
   DCHECK_EQ(1, args.length());
   String string(String::cast(args[0]));
-  uint32_t hash = string.EnsureHash();
+  uint32_t hash = string->EnsureHash();
   return Smi::FromInt(static_cast<int>(hash));
 }
 
diff --git a/deps/v8/src/runtime/runtime-weak-refs.cc b/deps/v8/src/runtime/runtime-weak-refs.cc
index ff60813b434bef..e4c9bc57dbe900 100644
--- a/deps/v8/src/runtime/runtime-weak-refs.cc
+++ b/deps/v8/src/runtime/runtime-weak-refs.cc
@@ -15,7 +15,7 @@ RUNTIME_FUNCTION(Runtime_ShrinkFinalizationRegistryUnregisterTokenMap) {
   Handle<JSFinalizationRegistry> finalization_registry =
       args.at<JSFinalizationRegistry>(0);
 
-  if (!finalization_registry->key_map().IsUndefined(isolate)) {
+  if (!IsUndefined(finalization_registry->key_map(), isolate)) {
     Handle<SimpleNumberDictionary> key_map =
         handle(SimpleNumberDictionary::cast(finalization_registry->key_map()),
                isolate);
@@ -44,7 +44,7 @@ RUNTIME_FUNCTION(Runtime_JSWeakRefAddToKeptObjects) {
   HandleScope scope(isolate);
   DCHECK_EQ(1, args.length());
   Handle<HeapObject> object = args.at<HeapObject>(0);
-  DCHECK(object->CanBeHeldWeakly());
+  DCHECK(Object::CanBeHeldWeakly(*object));
 
   isolate->heap()->KeepDuringJob(object);
 
diff --git a/deps/v8/src/runtime/runtime.cc b/deps/v8/src/runtime/runtime.cc
index b878193eee3c65..c01f1c2d357d71 100644
--- a/deps/v8/src/runtime/runtime.cc
+++ b/deps/v8/src/runtime/runtime.cc
@@ -231,6 +231,21 @@ bool Runtime::IsAllowListedForFuzzing(FunctionId id) {
   }
 }
 
+bool Runtime::SwitchToTheCentralStackForTarget(FunctionId id) {
+  // Runtime functions called from Wasm directly or
+  // from Wasm runtime stubs should execute on the central stack.
+  switch (id) {
+#if V8_ENABLE_WEBASSEMBLY
+#define WASM_CASE(Name, ...) case Runtime::k##Name:
+    FOR_EACH_INTRINSIC_WASM(WASM_CASE, WASM_CASE)
+#undef WASM_CASE
+    return true;
+#endif  // V8_ENABLE_WEBASSEMBLY
+    default:
+      return false;
+  }
+}
+
 const Runtime::Function* Runtime::FunctionForName(const unsigned char* name,
                                                   int length) {
   base::CallOnce(&initialize_function_name_map_once,
diff --git a/deps/v8/src/runtime/runtime.h b/deps/v8/src/runtime/runtime.h
index f94bfb47ef29a5..eff1cc9869b623 100644
--- a/deps/v8/src/runtime/runtime.h
+++ b/deps/v8/src/runtime/runtime.h
@@ -66,6 +66,7 @@ namespace internal {
   F(AtomicsLoadSharedStructOrArray, 2, 1)              \
   F(AtomicsStoreSharedStructOrArray, 3, 1)             \
   F(AtomicsExchangeSharedStructOrArray, 3, 1)          \
+  F(AtomicsCompareExchangeSharedStructOrArray, 4, 1)   \
   F(AtomicsConditionNumWaitersForTesting, 1, 1)
 
 #define FOR_EACH_INTRINSIC_BIGINT(F, I) \
@@ -99,27 +100,31 @@ namespace internal {
 #define FOR_EACH_INTRINSIC_COLLECTIONS(F, I) \
   F(MapGrow, 1, 1)                           \
   F(MapShrink, 1, 1)                         \
+  F(OrderedHashSetGrow, 2, 1)                \
   F(SetGrow, 1, 1)                           \
   F(SetShrink, 1, 1)                         \
+  F(OrderedHashSetShrink, 1, 1)              \
   F(TheHole, 0, 1)                           \
   F(WeakCollectionDelete, 3, 1)              \
-  F(WeakCollectionSet, 4, 1)
-
-#define FOR_EACH_INTRINSIC_COMPILER(F, I) \
-  F(CompileOptimizedOSR, 0, 1)            \
-  F(CompileOptimizedOSRFromMaglev, 1, 1)  \
-  F(LogOrTraceOptimizedOSREntry, 0, 1)    \
-  F(CompileLazy, 1, 1)                    \
-  F(CompileBaseline, 1, 1)                \
-  F(CompileOptimized, 1, 1)               \
-  F(InstallBaselineCode, 1, 1)            \
-  F(HealOptimizedCodeSlot, 1, 1)          \
-  F(FunctionLogNextExecution, 1, 1)       \
-  F(InstantiateAsmJs, 4, 1)               \
-  F(NotifyDeoptimized, 0, 1)              \
-  F(ObserveNode, 1, 1)                    \
-  F(ResolvePossiblyDirectEval, 6, 1)      \
-  F(VerifyType, 1, 1)                     \
+  F(WeakCollectionSet, 4, 1)                 \
+  F(OrderedHashMapGrow, 2, 1)
+
+#define FOR_EACH_INTRINSIC_COMPILER(F, I)       \
+  F(CompileOptimizedOSR, 0, 1)                  \
+  F(CompileOptimizedOSRFromMaglev, 1, 1)        \
+  F(CompileOptimizedOSRFromMaglevInlined, 2, 1) \
+  F(LogOrTraceOptimizedOSREntry, 0, 1)          \
+  F(CompileLazy, 1, 1)                          \
+  F(CompileBaseline, 1, 1)                      \
+  F(CompileOptimized, 1, 1)                     \
+  F(InstallBaselineCode, 1, 1)                  \
+  F(HealOptimizedCodeSlot, 1, 1)                \
+  F(FunctionLogNextExecution, 1, 1)             \
+  F(InstantiateAsmJs, 4, 1)                     \
+  F(NotifyDeoptimized, 0, 1)                    \
+  F(ObserveNode, 1, 1)                          \
+  F(ResolvePossiblyDirectEval, 6, 1)            \
+  F(VerifyType, 1, 1)                           \
   F(CheckTurboshaftTypeOf, 2, 1)
 
 #define FOR_EACH_INTRINSIC_DATE(F, I) F(DateCurrentTime, 0, 1)
@@ -223,6 +228,7 @@ namespace internal {
   F(DoubleToStringWithRadix, 2, 1)                         \
   F(FatalProcessOutOfMemoryInAllocateRaw, 0, 1)            \
   F(FatalProcessOutOfMemoryInvalidArrayLength, 0, 1)       \
+  F(FatalInvalidSize, 0, 1)                                \
   F(GetAndResetRuntimeCallStats, -1 /* <= 2 */, 1)         \
   F(GetAndResetTurboProfilingData, 0, 1)                   \
   F(GetTemplateObject, 3, 1)                               \
@@ -247,6 +253,7 @@ namespace internal {
   F(PerformMicrotaskCheckpoint, 0, 1)                      \
   F(SharedValueBarrierSlow, 1, 1)                          \
   F(StackGuard, 0, 1)                                      \
+  F(HandleNoHeapWritesInterrupts, 0, 1)                    \
   F(StackGuardWithGap, 1, 1)                               \
   F(Throw, 1, 1)                                           \
   F(ThrowApplyNonFunction, 1, 1)                           \
@@ -274,11 +281,9 @@ namespace internal {
   F(Typeof, 1, 1)                                          \
   F(UnwindAndFindExceptionHandler, 0, 1)
 
-#define FOR_EACH_INTRINSIC_LITERALS(F, I)           \
-  F(CreateArrayLiteral, 4, 1)                       \
-  F(CreateArrayLiteralWithoutAllocationSite, 2, 1)  \
-  F(CreateObjectLiteral, 4, 1)                      \
-  F(CreateObjectLiteralWithoutAllocationSite, 2, 1) \
+#define FOR_EACH_INTRINSIC_LITERALS(F, I) \
+  F(CreateArrayLiteral, 4, 1)             \
+  F(CreateObjectLiteral, 4, 1)            \
   F(CreateRegExpLiteral, 4, 1)
 
 #define FOR_EACH_INTRINSIC_MODULE(F, I)    \
@@ -433,6 +438,7 @@ namespace internal {
   F(DeleteLookupSlot, 1, 1)                        \
   F(LoadLookupSlot, 1, 1)                          \
   F(LoadLookupSlotInsideTypeof, 1, 1)              \
+  F(LoadLookupSlotForCall_Baseline, 2, 1)          \
                                                    \
   F(NewClosure, 2, 1)                              \
   F(NewClosure_Tenured, 2, 1)                      \
@@ -509,7 +515,9 @@ namespace internal {
   F(ConstructThinString, 1, 1)                \
   F(CurrentFrameIsTurbofan, 0, 1)             \
   F(DebugPrint, -1, 1)                        \
+  F(DebugPrintFloat, 5, 1)                    \
   F(DebugPrintPtr, 1, 1)                      \
+  F(DebugPrintWord, 5, 1)                     \
   F(DebugTrace, 0, 1)                         \
   F(DebugTrackRetainingPath, -1, 1)           \
   F(DeoptimizeFunction, 1, 1)                 \
@@ -570,6 +578,7 @@ namespace internal {
   F(MapIteratorProtector, 0, 1)               \
   F(NeverOptimizeFunction, 1, 1)              \
   F(NewRegExpWithBacktrackLimit, 3, 1)        \
+  F(NoElementsProtector, 0, 1)                \
   F(NotifyContextDisposed, 0, 1)              \
   F(OptimizeMaglevOnNextCall, 1, 1)           \
   F(OptimizeFunctionOnNextCall, -1, 1)        \
@@ -600,7 +609,8 @@ namespace internal {
   F(TurbofanStaticAssert, 1, 1)               \
   F(TypedArraySpeciesProtector, 0, 1)         \
   F(WaitForBackgroundOptimization, 0, 1)      \
-  I(DeoptimizeNow, 0, 1)
+  I(DeoptimizeNow, 0, 1)                      \
+  F(LeakHole, 0, 1)
 
 #define FOR_EACH_INTRINSIC_TYPEDARRAY(F, I)    \
   F(ArrayBufferDetach, -1, 1)                  \
@@ -611,81 +621,90 @@ namespace internal {
   F(TypedArraySet, 2, 1)                       \
   F(TypedArraySortFast, 1, 1)
 
-#define FOR_EACH_INTRINSIC_WASM(F, I) \
-  F(ThrowBadSuspenderError, 0, 1)     \
-  F(ThrowWasmError, 1, 1)             \
-  F(ThrowWasmStackOverflow, 0, 1)     \
-  F(WasmI32AtomicWait, 4, 1)          \
-  F(WasmI64AtomicWait, 5, 1)          \
-  F(WasmAtomicNotify, 3, 1)           \
-  F(WasmMemoryGrow, 2, 1)             \
-  F(WasmStackGuard, 0, 1)             \
-  F(WasmThrow, 2, 1)                  \
-  F(WasmReThrow, 1, 1)                \
-  F(WasmThrowJSTypeError, 0, 1)       \
-  F(WasmThrowTypeError, 2, 1)         \
-  F(WasmRefFunc, 1, 1)                \
-  F(WasmFunctionTableGet, 3, 1)       \
-  F(WasmFunctionTableSet, 4, 1)       \
-  F(WasmTableInit, 6, 1)              \
-  F(WasmTableCopy, 6, 1)              \
-  F(WasmTableGrow, 3, 1)              \
-  F(WasmTableFill, 5, 1)              \
-  F(WasmJSToWasmObject, 2, 1)         \
-  F(WasmCompileLazy, 2, 1)            \
-  F(WasmAllocateFeedbackVector, 3, 1) \
-  F(WasmCompileWrapper, 2, 1)         \
-  F(WasmTriggerTierUp, 1, 1)          \
-  F(WasmDebugBreak, 0, 1)             \
-  F(WasmArrayCopy, 5, 1)              \
-  F(WasmArrayNewSegment, 5, 1)        \
-  F(WasmAllocateSuspender, 0, 1)      \
-  F(WasmSyncStackLimit, 0, 1)         \
-  F(WasmCreateResumePromise, 2, 1)    \
-  F(WasmStringNewWtf8, 5, 1)          \
-  F(WasmStringNewWtf8Array, 4, 1)     \
-  F(WasmStringNewWtf16, 4, 1)         \
-  F(WasmStringNewWtf16Array, 3, 1)    \
-  F(WasmStringConst, 2, 1)            \
-  F(WasmStringMeasureUtf8, 1, 1)      \
-  F(WasmStringMeasureWtf8, 1, 1)      \
-  F(WasmStringEncodeWtf8, 5, 1)       \
-  F(WasmStringEncodeWtf16, 6, 1)      \
-  F(WasmStringEncodeWtf8Array, 4, 1)  \
-  F(WasmStringAsWtf8, 1, 1)           \
-  F(WasmStringViewWtf8Encode, 6, 1)   \
-  F(WasmStringViewWtf8Slice, 3, 1)    \
-  F(WasmStringFromCodePoint, 1, 1)    \
-  F(WasmStringHash, 1, 1)
-
-#define FOR_EACH_INTRINSIC_WASM_TEST(F, I) \
-  F(DeserializeWasmModule, 2, 1)           \
-  F(DisallowWasmCodegen, 1, 1)             \
-  F(FlushWasmCode, 0, 1)                   \
-  F(FreezeWasmLazyCompilation, 1, 1)       \
-  F(GetWasmExceptionTagId, 2, 1)           \
-  F(GetWasmExceptionValues, 1, 1)          \
-  F(GetWasmRecoveredTrapCount, 0, 1)       \
-  F(IsAsmWasmCode, 1, 1)                   \
-  F(IsLiftoffFunction, 1, 1)               \
-  F(IsTurboFanFunction, 1, 1)              \
-  F(IsWasmDebugFunction, 1, 1)             \
-  F(IsUncompiledWasmFunction, 1, 1)        \
-  F(IsThreadInWasm, 0, 1)                  \
-  F(IsWasmCode, 1, 1)                      \
-  F(IsWasmTrapHandlerEnabled, 0, 1)        \
-  F(SerializeWasmModule, 1, 1)             \
-  F(SetWasmCompileControls, 2, 1)          \
-  F(SetWasmInstantiateControls, 0, 1)      \
-  F(SetWasmGCEnabled, 1, 1)                \
-  F(WasmCompiledExportWrappersCount, 0, 1) \
-  F(WasmGetNumberOfInstances, 1, 1)        \
-  F(WasmNumCodeSpaces, 1, 1)               \
-  F(WasmEnterDebugging, 0, 1)              \
-  F(WasmLeaveDebugging, 0, 1)              \
-  F(WasmTierUpFunction, 1, 1)              \
-  F(WasmTraceEnter, 0, 1)                  \
-  F(WasmTraceExit, 1, 1)                   \
+#define FOR_EACH_INTRINSIC_WASM(F, I)         \
+  F(ThrowBadSuspenderError, 0, 1)             \
+  F(ThrowWasmError, 1, 1)                     \
+  F(ThrowWasmStackOverflow, 0, 1)             \
+  F(WasmI32AtomicWait, 4, 1)                  \
+  F(WasmI64AtomicWait, 5, 1)                  \
+  F(WasmAtomicNotify, 3, 1)                   \
+  F(WasmMemoryGrow, 2, 1)                     \
+  F(WasmStackGuard, 0, 1)                     \
+  F(WasmThrow, 2, 1)                          \
+  F(WasmReThrow, 1, 1)                        \
+  F(WasmThrowJSTypeError, 0, 1)               \
+  F(WasmThrowTypeError, 2, 1)                 \
+  F(WasmRefFunc, 1, 1)                        \
+  F(WasmInternalFunctionCreateExternal, 1, 1) \
+  F(WasmFunctionTableGet, 3, 1)               \
+  F(WasmFunctionTableSet, 4, 1)               \
+  F(WasmTableInit, 6, 1)                      \
+  F(WasmTableCopy, 6, 1)                      \
+  F(WasmTableGrow, 3, 1)                      \
+  F(WasmTableFill, 5, 1)                      \
+  F(WasmJSToWasmObject, 2, 1)                 \
+  F(WasmGenericJSToWasmObject, 3, 1)          \
+  F(WasmGenericWasmToJSObject, 1, 1)          \
+  F(WasmCompileLazy, 2, 1)                    \
+  F(WasmAllocateFeedbackVector, 3, 1)         \
+  F(WasmCompileWrapper, 1, 1)                 \
+  F(TierUpWasmToJSWrapper, 1, 1)              \
+  F(WasmTriggerTierUp, 1, 1)                  \
+  F(WasmDebugBreak, 0, 1)                     \
+  F(WasmArrayCopy, 5, 1)                      \
+  F(WasmArrayNewSegment, 5, 1)                \
+  F(WasmArrayInitSegment, 6, 1)               \
+  F(WasmAllocateSuspender, 0, 1)              \
+  F(WasmStringNewSegmentWtf8, 4, 1)           \
+  F(WasmStringNewWtf8, 5, 1)                  \
+  F(WasmStringNewWtf8Array, 4, 1)             \
+  F(WasmStringNewWtf16, 4, 1)                 \
+  F(WasmStringNewWtf16Array, 3, 1)            \
+  F(WasmStringConst, 2, 1)                    \
+  F(WasmStringMeasureUtf8, 1, 1)              \
+  F(WasmStringMeasureWtf8, 1, 1)              \
+  F(WasmStringEncodeWtf8, 5, 1)               \
+  F(WasmStringEncodeWtf16, 6, 1)              \
+  F(WasmStringEncodeWtf8Array, 4, 1)          \
+  F(WasmStringAsWtf8, 1, 1)                   \
+  F(WasmStringViewWtf8Encode, 6, 1)           \
+  F(WasmStringViewWtf8Slice, 3, 1)            \
+  F(WasmStringFromCodePoint, 1, 1)            \
+  F(WasmStringHash, 1, 1)                     \
+  F(WasmSubstring, 3, 1)
+
+#define FOR_EACH_INTRINSIC_WASM_TEST(F, I)  \
+  F(CountUnoptimizedWasmToJSWrapper, 1, 1)  \
+  F(DeserializeWasmModule, 2, 1)            \
+  F(DisallowWasmCodegen, 1, 1)              \
+  F(FlushWasmCode, 0, 1)                    \
+  F(FreezeWasmLazyCompilation, 1, 1)        \
+  F(GetWasmExceptionTagId, 2, 1)            \
+  F(GetWasmExceptionValues, 1, 1)           \
+  F(GetWasmRecoveredTrapCount, 0, 1)        \
+  F(HasUnoptimizedWasmToJSWrapper, 1, 1)    \
+  F(IsAsmWasmCode, 1, 1)                    \
+  F(IsLiftoffFunction, 1, 1)                \
+  F(IsTurboFanFunction, 1, 1)               \
+  F(IsWasmDebugFunction, 1, 1)              \
+  F(IsUncompiledWasmFunction, 1, 1)         \
+  F(IsThreadInWasm, 0, 1)                   \
+  F(IsWasmCode, 1, 1)                       \
+  F(IsWasmTrapHandlerEnabled, 0, 1)         \
+  F(IsWasmPartialOOBWriteNoop, 0, 1)        \
+  F(SerializeWasmModule, 1, 1)              \
+  F(SetWasmCompileControls, 2, 1)           \
+  F(SetWasmInstantiateControls, 0, 1)       \
+  F(SetWasmGCEnabled, 1, 1)                 \
+  F(WasmCompiledExportWrappersCount, 0, 1)  \
+  F(WasmGetNumberOfInstances, 1, 1)         \
+  F(WasmNumCodeSpaces, 1, 1)                \
+  F(WasmEnterDebugging, 0, 1)               \
+  F(WasmLeaveDebugging, 0, 1)               \
+  F(WasmSwitchToTheCentralStackCount, 0, 1) \
+  F(WasmTierUpFunction, 1, 1)               \
+  F(WasmTraceEnter, 0, 1)                   \
+  F(WasmTraceExit, 1, 1)                    \
   F(WasmTraceMemory, 1, 1)
 
 #define FOR_EACH_INTRINSIC_WEAKREF(F, I)                             \
@@ -724,6 +743,7 @@ namespace internal {
   F(DefineNamedOwnIC_Miss, 5, 1)             \
   F(StoreInArrayLiteralIC_Slow, 5, 1)        \
   F(StorePropertyWithInterceptor, 5, 1)      \
+  F(CloneObjectIC_Slow, 2, 1)                \
   F(CloneObjectIC_Miss, 4, 1)                \
   F(KeyedHasIC_Miss, 4, 1)                   \
   F(HasElementWithInterceptor, 2, 1)
@@ -848,6 +868,10 @@ class Runtime : public AllStatic {
   // using it with fuzzers.
   static bool IsAllowListedForFuzzing(FunctionId id);
 
+  // Check if a switch to the central stack should be performed
+  // for a runtime function.
+  static bool SwitchToTheCentralStackForTarget(FunctionId id);
+
   // Get the intrinsic function with the given name.
   static const Function* FunctionForName(const unsigned char* name, int length);
 
@@ -962,8 +986,6 @@ V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream&, Runtime::FunctionId);
 
 using AllocateDoubleAlignFlag = base::BitField<bool, 0, 1>;
 
-using AllowLargeObjectAllocationFlag = base::BitField<bool, 1, 1>;
-
 // A set of bits returned by Runtime_GetOptimizationStatus.
 // These bits must be in sync with bits defined in test/mjsunit/mjsunit.js
 enum class OptimizationStatus {
diff --git a/deps/v8/src/sandbox/code-pointer-inl.h b/deps/v8/src/sandbox/code-pointer-inl.h
new file mode 100644
index 00000000000000..56a5b30237509e
--- /dev/null
+++ b/deps/v8/src/sandbox/code-pointer-inl.h
@@ -0,0 +1,68 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SANDBOX_CODE_POINTER_INL_H_
+#define V8_SANDBOX_CODE_POINTER_INL_H_
+
+#include "include/v8-internal.h"
+#include "src/base/atomic-utils.h"
+#include "src/execution/isolate.h"
+#include "src/sandbox/code-pointer-table-inl.h"
+#include "src/sandbox/code-pointer.h"
+
+namespace v8 {
+namespace internal {
+
+V8_INLINE void InitCodePointerTableEntryField(Address field_address,
+                                              Isolate* isolate,
+                                              Tagged<HeapObject> owning_code,
+                                              Address entrypoint) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  CodePointerTable::Space* space =
+      ReadOnlyHeap::Contains(field_address)
+          ? isolate->read_only_heap()->code_pointer_space()
+          : isolate->heap()->code_pointer_space();
+  CodePointerHandle handle =
+      GetProcessWideCodePointerTable()->AllocateAndInitializeEntry(
+          space, owning_code.ptr(), entrypoint);
+  // Use a Release_Store to ensure that the store of the pointer into the
+  // table is not reordered after the store of the handle. Otherwise, other
+  // threads may access an uninitialized table entry and crash.
+  auto location = reinterpret_cast<CodePointerHandle*>(field_address);
+  base::AsAtomic32::Release_Store(location, handle);
+#else
+  UNREACHABLE();
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+V8_INLINE Address ReadCodeEntrypointField(Address field_address) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // Handles may be written to objects from other threads so the handle needs
+  // to be loaded atomically. We assume that the load from the table cannot
+  // be reordered before the load of the handle due to the data dependency
+  // between the two loads and therefore use relaxed memory ordering, but
+  // technically we should use memory_order_consume here.
+  auto location = reinterpret_cast<CodePointerHandle*>(field_address);
+  CodePointerHandle handle = base::AsAtomic32::Relaxed_Load(location);
+  return GetProcessWideCodePointerTable()->GetEntrypoint(handle);
+#else
+  return ReadMaybeUnalignedValue<Address>(field_address);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+V8_INLINE void WriteCodeEntrypointField(Address field_address, Address value) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // See comment above for why this is a Relaxed_Load.
+  auto location = reinterpret_cast<CodePointerHandle*>(field_address);
+  CodePointerHandle handle = base::AsAtomic32::Relaxed_Load(location);
+  GetProcessWideCodePointerTable()->SetEntrypoint(handle, value);
+#else
+  WriteMaybeUnalignedValue<Address>(field_address, value);
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_SANDBOX_CODE_POINTER_INL_H_
diff --git a/deps/v8/src/sandbox/code-pointer-table-inl.h b/deps/v8/src/sandbox/code-pointer-table-inl.h
new file mode 100644
index 00000000000000..8a2c8eaaa098c0
--- /dev/null
+++ b/deps/v8/src/sandbox/code-pointer-table-inl.h
@@ -0,0 +1,145 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SANDBOX_CODE_POINTER_TABLE_INL_H_
+#define V8_SANDBOX_CODE_POINTER_TABLE_INL_H_
+
+#include "src/sandbox/code-pointer-table.h"
+#include "src/sandbox/external-entity-table-inl.h"
+
+#ifdef V8_COMPRESS_POINTERS
+
+namespace v8 {
+namespace internal {
+
+void CodePointerTableEntry::MakeCodePointerEntry(Address code,
+                                                 Address entrypoint) {
+  // The marking bit is the LSB of the code pointer, which should always be set
+  // here since it is supposed to be a tagged pointer.
+  DCHECK_EQ(code & kMarkingBit, kMarkingBit);
+  entrypoint_.store(entrypoint, std::memory_order_relaxed);
+  code_.store(code, std::memory_order_relaxed);
+}
+
+Address CodePointerTableEntry::GetEntrypoint() const {
+  DCHECK(!IsFreelistEntry());
+  return entrypoint_.load(std::memory_order_relaxed);
+}
+
+void CodePointerTableEntry::SetEntrypoint(Address value) {
+  DCHECK(!IsFreelistEntry());
+  entrypoint_.store(value, std::memory_order_relaxed);
+}
+
+Address CodePointerTableEntry::GetCodeObject() const {
+  DCHECK(!IsFreelistEntry());
+  // We reuse the heap object tag bit as marking bit, so we need to explicitly
+  // set it here when accessing the pointer.
+  return code_.load(std::memory_order_relaxed) | kMarkingBit;
+}
+
+void CodePointerTableEntry::SetCodeObject(Address value) {
+  DCHECK_EQ(value & kMarkingBit, kMarkingBit);
+  DCHECK(!IsFreelistEntry());
+  code_.store(value, std::memory_order_relaxed);
+}
+
+void CodePointerTableEntry::MakeFreelistEntry(uint32_t next_entry_index) {
+  Address value = kFreeEntryTag | next_entry_index;
+  entrypoint_.store(value, std::memory_order_relaxed);
+  code_.store(kNullAddress, std::memory_order_relaxed);
+}
+
+bool CodePointerTableEntry::IsFreelistEntry() const {
+  auto entrypoint = entrypoint_.load(std::memory_order_relaxed);
+  return (entrypoint & kFreeEntryTag) == kFreeEntryTag;
+}
+
+uint32_t CodePointerTableEntry::GetNextFreelistEntryIndex() const {
+  return static_cast<uint32_t>(entrypoint_.load(std::memory_order_relaxed));
+}
+
+void CodePointerTableEntry::Mark() {
+  Address old_value = code_.load(std::memory_order_relaxed);
+  Address new_value = old_value | kMarkingBit;
+
+  // We don't need to perform the CAS in a loop since it can only fail if a new
+  // value has been written into the entry. This, however, will also have set
+  // the marking bit.
+  bool success = code_.compare_exchange_strong(old_value, new_value,
+                                               std::memory_order_relaxed);
+  DCHECK(success || (old_value & kMarkingBit) == kMarkingBit);
+  USE(success);
+}
+
+void CodePointerTableEntry::Unmark() {
+  Address value = code_.load(std::memory_order_relaxed);
+  value &= ~kMarkingBit;
+  code_.store(value, std::memory_order_relaxed);
+}
+
+bool CodePointerTableEntry::IsMarked() const {
+  Address value = code_.load(std::memory_order_relaxed);
+  return value & kMarkingBit;
+}
+
+Address CodePointerTable::GetEntrypoint(CodePointerHandle handle) const {
+  uint32_t index = HandleToIndex(handle);
+  return at(index).GetEntrypoint();
+}
+
+Address CodePointerTable::GetCodeObject(CodePointerHandle handle) const {
+  uint32_t index = HandleToIndex(handle);
+  return at(index).GetCodeObject();
+}
+
+void CodePointerTable::SetEntrypoint(CodePointerHandle handle, Address value) {
+  DCHECK_NE(kNullCodePointerHandle, handle);
+  uint32_t index = HandleToIndex(handle);
+  at(index).SetEntrypoint(value);
+}
+
+void CodePointerTable::SetCodeObject(CodePointerHandle handle, Address value) {
+  DCHECK_NE(kNullCodePointerHandle, handle);
+  uint32_t index = HandleToIndex(handle);
+  at(index).SetCodeObject(value);
+}
+
+CodePointerHandle CodePointerTable::AllocateAndInitializeEntry(
+    Space* space, Address code, Address entrypoint) {
+  DCHECK(space->BelongsTo(this));
+  uint32_t index = AllocateEntry(space);
+  at(index).MakeCodePointerEntry(code, entrypoint);
+  return IndexToHandle(index);
+}
+
+void CodePointerTable::Mark(Space* space, CodePointerHandle handle) {
+  DCHECK(space->BelongsTo(this));
+  // The null entry is immortal and immutable, so no need to mark it as alive.
+  if (handle == kNullCodePointerHandle) return;
+
+  uint32_t index = HandleToIndex(handle);
+  DCHECK(space->Contains(index));
+
+  at(index).Mark();
+}
+
+uint32_t CodePointerTable::HandleToIndex(CodePointerHandle handle) const {
+  uint32_t index = handle >> kCodePointerHandleShift;
+  DCHECK_EQ(handle, index << kCodePointerHandleShift);
+  return index;
+}
+
+CodePointerHandle CodePointerTable::IndexToHandle(uint32_t index) const {
+  CodePointerHandle handle = index << kCodePointerHandleShift;
+  DCHECK_EQ(index, handle >> kCodePointerHandleShift);
+  return handle;
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_COMPRESS_POINTERS
+
+#endif  // V8_SANDBOX_CODE_POINTER_TABLE_INL_H_
diff --git a/deps/v8/src/sandbox/code-pointer-table.cc b/deps/v8/src/sandbox/code-pointer-table.cc
new file mode 100644
index 00000000000000..34321b524029bb
--- /dev/null
+++ b/deps/v8/src/sandbox/code-pointer-table.cc
@@ -0,0 +1,89 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/sandbox/code-pointer-table.h"
+
+#include "src/execution/isolate.h"
+#include "src/logging/counters.h"
+#include "src/sandbox/code-pointer-table-inl.h"
+
+#ifdef V8_COMPRESS_POINTERS
+
+namespace v8 {
+namespace internal {
+
+uint32_t CodePointerTable::Sweep(Space* space, Counters* counters) {
+  DCHECK(space->BelongsTo(this));
+
+  // TODO(saelo): this code is fairly similar to
+  // ExternalPointerTable::SweepAndCompact. Investigate whether common code can
+  // be factored out.
+
+  // Lock the space. Technically this is not necessary since no other thread can
+  // allocate entries at this point, but some of the methods we call on the
+  // space assert that the lock is held.
+  base::MutexGuard guard(&space->mutex_);
+
+  // There must not be any entry allocations while the table is being swept as
+  // that would not be safe. Set the freelist to this special marker value to
+  // easily catch any violation of this requirement.
+  space->freelist_head_.store(kEntryAllocationIsForbiddenMarker,
+                              std::memory_order_relaxed);
+
+  // Here we can iterate over the segments collection without taking a lock
+  // because no other thread can currently allocate entries in this space.
+  uint32_t current_freelist_head = 0;
+  uint32_t current_freelist_length = 0;
+  std::vector<Segment> segments_to_deallocate;
+  for (auto segment : base::Reversed(space->segments_)) {
+    // Remember the state of the freelist before this segment in case this
+    // segment turns out to be completely empty and we deallocate it.
+    uint32_t previous_freelist_head = current_freelist_head;
+    uint32_t previous_freelist_length = current_freelist_length;
+
+    // Process every entry in this segment, again going top to bottom.
+    for (uint32_t i = segment.last_entry(); i >= segment.first_entry(); i--) {
+      if (!at(i).IsMarked()) {
+        at(i).MakeFreelistEntry(current_freelist_head);
+        current_freelist_head = i;
+        current_freelist_length++;
+      } else {
+        at(i).Unmark();
+      }
+    }
+
+    // If a segment is completely empty, free it.
+    uint32_t free_entries = current_freelist_length - previous_freelist_length;
+    bool segment_is_empty = free_entries == kEntriesPerSegment;
+    if (segment_is_empty) {
+      segments_to_deallocate.push_back(segment);
+      // Restore the state of the freelist before this segment.
+      current_freelist_head = previous_freelist_head;
+      current_freelist_length = previous_freelist_length;
+    }
+  }
+
+  // We cannot remove the segments while iterating over the segments set, so
+  // defer that until now.
+  for (auto segment : segments_to_deallocate) {
+    FreeTableSegment(segment);
+    space->segments_.erase(segment);
+  }
+
+  FreelistHead new_freelist(current_freelist_head, current_freelist_length);
+  space->freelist_head_.store(new_freelist, std::memory_order_release);
+  DCHECK_EQ(space->freelist_length(), current_freelist_length);
+
+  uint32_t num_live_entries = space->capacity() - current_freelist_length;
+  counters->code_pointers_count()->AddSample(num_live_entries);
+  return num_live_entries;
+}
+
+DEFINE_LAZY_LEAKY_OBJECT_GETTER(CodePointerTable,
+                                GetProcessWideCodePointerTable)
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_COMPRESS_POINTERS
diff --git a/deps/v8/src/sandbox/code-pointer-table.h b/deps/v8/src/sandbox/code-pointer-table.h
new file mode 100644
index 00000000000000..d51235d3907ae9
--- /dev/null
+++ b/deps/v8/src/sandbox/code-pointer-table.h
@@ -0,0 +1,184 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SANDBOX_CODE_POINTER_TABLE_H_
+#define V8_SANDBOX_CODE_POINTER_TABLE_H_
+
+#include "include/v8config.h"
+#include "src/base/atomicops.h"
+#include "src/base/memory.h"
+#include "src/base/platform/mutex.h"
+#include "src/common/globals.h"
+#include "src/sandbox/external-entity-table.h"
+
+#ifdef V8_COMPRESS_POINTERS
+
+namespace v8 {
+namespace internal {
+
+class Isolate;
+class Counters;
+
+/**
+ * The entries of a CodePointerTable.
+ *
+ * Each entry contains a (compressed) pointer to a Code object as well as a raw
+ * pointer to the Code's entrypoint.
+ */
+struct CodePointerTableEntry {
+  // Make this entry a code pointer entry for the given code object and
+  // entrypoint.
+  inline void MakeCodePointerEntry(Address code, Address entrypoint);
+
+  // Load code entrypoint pointer stored in this entry.
+  // This entry must be a code pointer entry.
+  inline Address GetEntrypoint() const;
+
+  // Store the given code entrypoint pointer in this entry.
+  // This entry must be a code pointer entry.
+  inline void SetEntrypoint(Address value);
+
+  // Load the code object pointer stored in this entry.
+  // This entry must be a code pointer entry.
+  inline Address GetCodeObject() const;
+
+  // Store the given code object pointer in this entry.
+  // This entry must be a code pointer entry.
+  inline void SetCodeObject(Address value);
+
+  // Make this entry a freelist entry, containing the index of the next entry
+  // on the freelist.
+  inline void MakeFreelistEntry(uint32_t next_entry_index);
+
+  // Returns true if this entry is a freelist entry.
+  inline bool IsFreelistEntry() const;
+
+  // Get the index of the next entry on the freelist. This method may be
+  // called even when the entry is not a freelist entry. However, the result
+  // is only valid if this is a freelist entry. This behaviour is required
+  // for efficient entry allocation, see TryAllocateEntryFromFreelist.
+  inline uint32_t GetNextFreelistEntryIndex() const;
+
+  // Mark this entry as alive during garbage collection.
+  inline void Mark();
+
+  // Unmark this entry during sweeping.
+  inline void Unmark();
+
+  // Test whether this entry is currently marked as alive.
+  inline bool IsMarked() const;
+
+ private:
+  friend class CodePointerTable;
+
+  // Freelist entries contain the index of the next free entry in their lower 32
+  // bits and this tag in the upper 32 bits.
+  static constexpr Address kFreeEntryTag = 0xffffffffULL << 32;
+
+  // The marking bit is stored in the code_ field, see below.
+  static constexpr Address kMarkingBit = 1;
+
+  std::atomic<Address> entrypoint_;
+  // The pointer to the Code object also contains the marking bit: since this is
+  // a tagged pointer to a V8 HeapObject, we know that it will be 4-byte aligned
+  // and that the LSB should always be set. We therefore use the LSB as marking
+  // bit. In this way:
+  //  - When loading the pointer, we only need to perform an unconditional OR 1
+  //  to get the correctly tagged pointer
+  //  - When storing the pointer we don't need to do anything since the tagged
+  //  pointer will automatically be marked
+  std::atomic<Address> code_;
+};
+
+static_assert(sizeof(CodePointerTableEntry) == kCodePointerTableEntrySize);
+
+/**
+ * A table containing pointers to code.
+ *
+ * When the sandbox is enabled, a code pointer table (CPT) can be used to ensure
+ * basic control-flow integrity in the absence of special hardware support (such
+ * as landing pad instructions): by referencing code through an index into a
+ * CPT, and ensuring that only valid code entrypoints are stored inside the
+ * table, it is then guaranteed that any indirect control-flow transfer ends up
+ * on a valid entrypoint as long as an attacker is still confined to the
+ * sandbox.
+ */
+class V8_EXPORT_PRIVATE CodePointerTable
+    : public ExternalEntityTable<CodePointerTableEntry,
+                                 kCodePointerTableReservationSize> {
+ public:
+  // Size of a CodePointerTable, for layout computation in IsolateData.
+  static int constexpr kSize = 2 * kSystemPointerSize;
+  static_assert(kMaxCodePointers == kMaxCapacity);
+
+  CodePointerTable() = default;
+  CodePointerTable(const CodePointerTable&) = delete;
+  CodePointerTable& operator=(const CodePointerTable&) = delete;
+
+  // The Spaces used by a CodePointerTable.
+  struct Space
+      : public ExternalEntityTable<CodePointerTableEntry,
+                                   kCodePointerTableReservationSize>::Space {
+   private:
+    friend class CodePointerTable;
+  };
+
+  //
+  // This method is atomic and can be called from background threads.
+  inline Address GetEntrypoint(CodePointerHandle handle) const;
+
+  // Retrieves the code object of the entry referenced by the given handle.
+  //
+  // This method is atomic and can be called from background threads.
+  inline Address GetCodeObject(CodePointerHandle handle) const;
+
+  // Sets the entrypoint of the entry referenced by the given handle.
+  //
+  // This method is atomic and can be called from background threads.
+  inline void SetEntrypoint(CodePointerHandle handle, Address value);
+
+  // Sets the code object of the entry referenced by the given handle.
+  //
+  // This method is atomic and can be called from background threads.
+  inline void SetCodeObject(CodePointerHandle handle, Address value);
+
+  // Allocates a new entry in the table. The caller must provide the initial
+  // value and tag.
+  //
+  // This method is atomic and can be called from background threads.
+  inline CodePointerHandle AllocateAndInitializeEntry(Space* space,
+                                                      Address code,
+                                                      Address entrypoint);
+
+  // Marks the specified entry as alive.
+  //
+  // This method is atomic and can be called from background threads.
+  inline void Mark(Space* space, CodePointerHandle handle);
+
+  // Frees all unmarked entries in the given space.
+  //
+  // This method must only be called while mutator threads are stopped as it is
+  // not safe to allocate table entries while a space is being swept.
+  //
+  // Returns the number of live entries after sweeping.
+  uint32_t Sweep(Space* space, Counters* counters);
+
+  // The base address of this table, for use in JIT compilers.
+  Address base_address() const { return base(); }
+
+ private:
+  inline uint32_t HandleToIndex(CodePointerHandle handle) const;
+  inline CodePointerHandle IndexToHandle(uint32_t index) const;
+};
+
+static_assert(sizeof(CodePointerTable) == CodePointerTable::kSize);
+
+V8_EXPORT_PRIVATE CodePointerTable* GetProcessWideCodePointerTable();
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_COMPRESS_POINTERS
+
+#endif  // V8_SANDBOX_CODE_POINTER_TABLE_H_
diff --git a/deps/v8/src/sandbox/code-pointer.h b/deps/v8/src/sandbox/code-pointer.h
new file mode 100644
index 00000000000000..5eff0f3981a2db
--- /dev/null
+++ b/deps/v8/src/sandbox/code-pointer.h
@@ -0,0 +1,34 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SANDBOX_CODE_POINTER_H_
+#define V8_SANDBOX_CODE_POINTER_H_
+
+#include "src/common/globals.h"
+
+namespace v8 {
+namespace internal {
+
+// Creates and initializes an entry in the CodePointerTable and writes a handle
+// for that entry into the field. The entry will contain a pointer to the
+// owning code object as well as to the entrypoint.
+V8_INLINE void InitCodePointerTableEntryField(Address field_address,
+                                              Isolate* isolate,
+                                              Tagged<HeapObject> owning_code,
+                                              Address entrypoint);
+
+// If the sandbox is enabled: reads the CodePointerHandle from the field and
+// reads the entrypoint pointer from the corresponding CodePointerTable entry.
+// If the sandbox is disabled: load the external pointer from the field.
+V8_INLINE Address ReadCodeEntrypointField(Address field_address);
+
+// If the sandbox is enabled: reads the CodePointerHandle from the field and
+// writes the entrypoint pointer to the corresponding CodePointerTable entry.
+// If the sandbox is disabled: writes the entrypoint pointer to the field.
+V8_INLINE void WriteCodeEntrypointField(Address field_address, Address value);
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_SANDBOX_CODE_POINTER_H_
diff --git a/deps/v8/src/sandbox/external-entity-table-inl.h b/deps/v8/src/sandbox/external-entity-table-inl.h
new file mode 100644
index 00000000000000..4d8bd8b3c166e9
--- /dev/null
+++ b/deps/v8/src/sandbox/external-entity-table-inl.h
@@ -0,0 +1,383 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SANDBOX_EXTERNAL_ENTITY_TABLE_INL_H_
+#define V8_SANDBOX_EXTERNAL_ENTITY_TABLE_INL_H_
+
+#include "src/base/atomicops.h"
+#include "src/base/emulated-virtual-address-subspace.h"
+#include "src/common/assert-scope.h"
+#include "src/sandbox/external-entity-table.h"
+#include "src/utils/allocation.h"
+
+#ifdef V8_COMPRESS_POINTERS
+
+namespace v8 {
+namespace internal {
+
+template <typename Entry, size_t size>
+typename ExternalEntityTable<Entry, size>::Segment
+ExternalEntityTable<Entry, size>::Segment::At(uint32_t offset) {
+  DCHECK(IsAligned(offset, kSegmentSize));
+  uint32_t number = offset / kSegmentSize;
+  return Segment(number);
+}
+
+template <typename Entry, size_t size>
+typename ExternalEntityTable<Entry, size>::Segment
+ExternalEntityTable<Entry, size>::Segment::Containing(uint32_t entry_index) {
+  uint32_t number = entry_index / kEntriesPerSegment;
+  return Segment(number);
+}
+
+template <typename Entry, size_t size>
+ExternalEntityTable<Entry, size>::Space::~Space() {
+  // The segments belonging to this space must have already been deallocated
+  // (through TearDownSpace()), otherwise we may leak memory.
+  DCHECK(segments_.empty());
+}
+
+template <typename Entry, size_t size>
+uint32_t ExternalEntityTable<Entry, size>::Space::freelist_length() const {
+  auto freelist = freelist_head_.load(std::memory_order_relaxed);
+  return freelist.length();
+}
+
+template <typename Entry, size_t size>
+uint32_t ExternalEntityTable<Entry, size>::Space::num_segments() {
+  mutex_.AssertHeld();
+  return static_cast<uint32_t>(segments_.size());
+}
+
+template <typename Entry, size_t size>
+bool ExternalEntityTable<Entry, size>::Space::Contains(uint32_t index) {
+  base::MutexGuard guard(&mutex_);
+  Segment segment = Segment::Containing(index);
+  return segments_.find(segment) != segments_.end();
+}
+
+template <typename Entry, size_t size>
+Entry& ExternalEntityTable<Entry, size>::at(uint32_t index) {
+  return base_[index];
+}
+
+template <typename Entry, size_t size>
+const Entry& ExternalEntityTable<Entry, size>::at(uint32_t index) const {
+  return base_[index];
+}
+
+template <typename Entry, size_t size>
+bool ExternalEntityTable<Entry, size>::is_initialized() const {
+  DCHECK(!base_ || reinterpret_cast<Address>(base_) == vas_->base());
+  return base_ != nullptr;
+}
+
+template <typename Entry, size_t size>
+Address ExternalEntityTable<Entry, size>::base() const {
+  DCHECK(is_initialized());
+  return reinterpret_cast<Address>(base_);
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::Initialize() {
+  DCHECK(!is_initialized());
+  DCHECK_EQ(vas_, nullptr);
+
+  VirtualAddressSpace* root_space = GetPlatformVirtualAddressSpace();
+  DCHECK(IsAligned(kReservationSize, root_space->allocation_granularity()));
+
+  if (root_space->CanAllocateSubspaces()) {
+    auto subspace = root_space->AllocateSubspace(VirtualAddressSpace::kNoHint,
+                                                 kReservationSize, kSegmentSize,
+                                                 PagePermissions::kReadWrite);
+    vas_ = subspace.release();
+  } else {
+    // This may be required on old Windows versions that don't support
+    // VirtualAlloc2, which is required for subspaces. In that case, just use a
+    // fully-backed emulated subspace.
+    Address reservation_base = root_space->AllocatePages(
+        VirtualAddressSpace::kNoHint, kReservationSize, kSegmentSize,
+        PagePermissions::kNoAccess);
+    if (reservation_base) {
+      vas_ = new base::EmulatedVirtualAddressSubspace(
+          root_space, reservation_base, kReservationSize, kReservationSize);
+    }
+  }
+  if (!vas_) {
+    V8::FatalProcessOutOfMemory(
+        nullptr, "ExternalEntityTable::InitializeTable (subspace allocation)");
+  }
+  base_ = reinterpret_cast<Entry*>(vas_->base());
+
+  // Allocate the read-only segment of the table. This segment is always
+  // located at offset 0, and contains the null entry (pointing at
+  // kNullAddress) at index 0. It may later be temporarily marked read-write,
+  // see UnsealedReadOnlySegmentScope.
+  Address first_segment = vas_->AllocatePages(
+      vas_->base(), kSegmentSize, kSegmentSize, PagePermissions::kRead);
+  if (first_segment != vas_->base()) {
+    V8::FatalProcessOutOfMemory(
+        nullptr,
+        "ExternalEntityTable::InitializeTable (first segment allocation)");
+  }
+  DCHECK_EQ(first_segment - vas_->base(), kInternalReadOnlySegmentOffset);
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::TearDown() {
+  DCHECK(is_initialized());
+
+  // Deallocate the (read-only) first segment.
+  vas_->FreePages(vas_->base(), kSegmentSize);
+
+  base_ = nullptr;
+  delete vas_;
+  vas_ = nullptr;
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::InitializeSpace(Space* space) {
+#ifdef DEBUG
+  DCHECK_EQ(space->owning_table_, nullptr);
+  space->owning_table_ = this;
+#endif
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::TearDownSpace(Space* space) {
+  DCHECK(is_initialized());
+  DCHECK(space->BelongsTo(this));
+  for (auto segment : space->segments_) {
+    FreeTableSegment(segment);
+  }
+  space->segments_.clear();
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::AttachSpaceToReadOnlySegment(
+    Space* space) {
+  DCHECK(is_initialized());
+  DCHECK(space->BelongsTo(this));
+
+  DCHECK(!space->is_internal_read_only_space());
+  space->is_internal_read_only_space_ = true;
+
+  UnsealReadOnlySegmentScope unseal_scope(this);
+
+  // Physically attach the segment.
+  FreelistHead freelist;
+  {
+    base::MutexGuard guard(&space->mutex_);
+    DCHECK_EQ(space->segments_.size(), 0);
+    freelist = Extend(space, Segment::At(kInternalReadOnlySegmentOffset));
+  }
+
+  DCHECK(!freelist.is_empty());
+  DCHECK_EQ(freelist.next(), kInternalNullEntryIndex + 1);
+  DCHECK(space->Contains(freelist.next()));
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::DetachSpaceFromReadOnlySegment(
+    Space* space) {
+  DCHECK(is_initialized());
+  DCHECK(space->BelongsTo(this));
+  // Remove the RO segment from the space's segment list without freeing it.
+  // The table itself manages the RO segment's lifecycle.
+  base::MutexGuard guard(&space->mutex_);
+  DCHECK_EQ(space->segments_.size(), 1);
+  space->segments_.clear();
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::UnsealReadOnlySegment() {
+  DCHECK(is_initialized());
+  bool success = vas_->SetPagePermissions(vas_->base(), kSegmentSize,
+                                          PagePermissions::kReadWrite);
+  CHECK(success);
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::SealReadOnlySegment() {
+  DCHECK(is_initialized());
+  bool success = vas_->SetPagePermissions(vas_->base(), kSegmentSize,
+                                          PagePermissions::kRead);
+  CHECK(success);
+}
+
+template <typename Entry, size_t size>
+uint32_t ExternalEntityTable<Entry, size>::AllocateEntry(Space* space) {
+  DCHECK(is_initialized());
+  DCHECK(space->BelongsTo(this));
+
+  // We currently don't want entry allocation to trigger garbage collection as
+  // this may cause seemingly harmless pointer field assignments to trigger
+  // garbage collection. This is especially true for lazily-initialized
+  // external pointer slots which will typically only allocate the external
+  // pointer table entry when the pointer is first set to a non-null value.
+  DisallowGarbageCollection no_gc;
+
+  FreelistHead freelist;
+  bool success = false;
+  while (!success) {
+    // This is essentially DCLP (see
+    // https://preshing.com/20130930/double-checked-locking-is-fixed-in-cpp11/)
+    // and so requires an acquire load as well as a release store in Grow() to
+    // prevent reordering of memory accesses, which could for example cause one
+    // thread to read a freelist entry before it has been properly initialized.
+    freelist = space->freelist_head_.load(std::memory_order_acquire);
+    if (freelist.is_empty()) {
+      // Freelist is empty. Need to take the lock, then attempt to allocate a
+      // new segment if no other thread has done it in the meantime.
+      base::MutexGuard guard(&space->mutex_);
+
+      // Reload freelist head in case another thread already grew the table.
+      freelist = space->freelist_head_.load(std::memory_order_relaxed);
+
+      if (freelist.is_empty()) {
+        // Freelist is (still) empty so extend this space by another segment.
+        freelist = Extend(space);
+        // Extend() adds one segment to the space and so to its freelist.
+        DCHECK_EQ(freelist.length(), kEntriesPerSegment);
+      }
+    }
+
+    success = TryAllocateEntryFromFreelist(space, freelist);
+  }
+
+  uint32_t allocated_entry = freelist.next();
+  DCHECK(space->Contains(allocated_entry));
+  DCHECK_IMPLIES(!space->is_internal_read_only_space(), allocated_entry != 0);
+  return allocated_entry;
+}
+
+template <typename Entry, size_t size>
+uint32_t ExternalEntityTable<Entry, size>::AllocateEntryBelow(
+    Space* space, uint32_t threshold_index) {
+  DCHECK(is_initialized());
+
+  FreelistHead freelist;
+  bool success = false;
+  while (!success) {
+    freelist = space->freelist_head_.load(std::memory_order_acquire);
+    // Check that the next free entry is below the threshold.
+    if (freelist.is_empty() || freelist.next() >= threshold_index) return 0;
+
+    success = TryAllocateEntryFromFreelist(space, freelist);
+  }
+
+  uint32_t allocated_entry = freelist.next();
+  DCHECK(space->Contains(allocated_entry));
+  DCHECK_NE(allocated_entry, 0);
+  DCHECK_LT(allocated_entry, threshold_index);
+  return allocated_entry;
+}
+
+template <typename Entry, size_t size>
+bool ExternalEntityTable<Entry, size>::TryAllocateEntryFromFreelist(
+    Space* space, FreelistHead freelist) {
+  DCHECK(!freelist.is_empty());
+  DCHECK(space->Contains(freelist.next()));
+
+  Entry& freelist_entry = at(freelist.next());
+  uint32_t next_freelist_entry = freelist_entry.GetNextFreelistEntryIndex();
+  FreelistHead new_freelist(next_freelist_entry, freelist.length() - 1);
+  bool success = space->freelist_head_.compare_exchange_strong(
+      freelist, new_freelist, std::memory_order_relaxed);
+
+  // When the CAS succeeded, the entry must've been a freelist entry.
+  // Otherwise, this is not guaranteed as another thread may have allocated
+  // and overwritten the same entry in the meantime.
+  if (success) {
+    DCHECK_IMPLIES(freelist.length() > 1, !new_freelist.is_empty());
+    DCHECK_IMPLIES(freelist.length() == 1, new_freelist.is_empty());
+  }
+  return success;
+}
+
+template <typename Entry, size_t size>
+typename ExternalEntityTable<Entry, size>::FreelistHead
+ExternalEntityTable<Entry, size>::Extend(Space* space) {
+  // Freelist should be empty when calling this method.
+  DCHECK_EQ(space->freelist_length(), 0);
+  // The caller must lock the space's mutex before extending it.
+  space->mutex_.AssertHeld();
+  // The read-only space must never be extended with a newly-allocated segment.
+  DCHECK(!space->is_internal_read_only_space());
+
+  // Allocate the new segment.
+  Segment segment = AllocateTableSegment();
+  return Extend(space, segment);
+}
+
+template <typename Entry, size_t size>
+typename ExternalEntityTable<Entry, size>::FreelistHead
+ExternalEntityTable<Entry, size>::Extend(Space* space, Segment segment) {
+  // Freelist should be empty when calling this method.
+  DCHECK_EQ(space->freelist_length(), 0);
+  // The caller must lock the space's mutex before extending it.
+  space->mutex_.AssertHeld();
+
+  space->segments_.insert(segment);
+  DCHECK_EQ(space->is_internal_read_only_space(), segment.number() == 0);
+  DCHECK_EQ(space->is_internal_read_only_space(),
+            segment.offset() == kInternalReadOnlySegmentOffset);
+
+  // Refill the freelist with the entries in the newly allocated segment.
+  uint32_t first = segment.first_entry();
+  uint32_t last = segment.last_entry();
+  if (V8_UNLIKELY(space->is_internal_read_only_space())) {
+    // For the internal read-only segment, index 0 is reserved for the `null`
+    // entry. The underlying memory has been nulled by allocation, and is
+    // therefore already initialized.
+#ifdef DEBUG
+    CHECK_EQ(first, kInternalNullEntryIndex);
+    static constexpr uint8_t kNullBytes[kEntrySize] = {0};
+    CHECK_EQ(memcmp(&at(first), kNullBytes, kEntrySize), 0);
+#endif  // DEBUG
+    first = kInternalNullEntryIndex + 1;
+  }
+  for (uint32_t i = first; i < last; i++) {
+    uint32_t next_free_entry = i + 1;
+    at(i).MakeFreelistEntry(next_free_entry);
+  }
+  at(last).MakeFreelistEntry(0);
+
+  // This must be a release store to prevent reordering of the preceeding
+  // stores to the freelist from being reordered past this store. See
+  // AllocateEntry() for more details.
+  FreelistHead new_freelist_head(first, last - first + 1);
+  space->freelist_head_.store(new_freelist_head, std::memory_order_release);
+
+  return new_freelist_head;
+}
+
+template <typename Entry, size_t size>
+typename ExternalEntityTable<Entry, size>::Segment
+ExternalEntityTable<Entry, size>::AllocateTableSegment() {
+  Address start =
+      vas_->AllocatePages(VirtualAddressSpace::kNoHint, kSegmentSize,
+                          kSegmentSize, PagePermissions::kReadWrite);
+  if (!start) {
+    V8::FatalProcessOutOfMemory(nullptr,
+                                "ExternalEntityTable::AllocateSegment");
+  }
+  uint32_t offset = static_cast<uint32_t>((start - vas_->base()));
+  return Segment::At(offset);
+}
+
+template <typename Entry, size_t size>
+void ExternalEntityTable<Entry, size>::FreeTableSegment(Segment segment) {
+  // Segment zero is reserved.
+  DCHECK_NE(segment.number(), 0);
+  Address segment_start = vas_->base() + segment.offset();
+  vas_->FreePages(segment_start, kSegmentSize);
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_COMPRESS_POINTERS
+
+#endif  // V8_SANDBOX_EXTERNAL_ENTITY_TABLE_INL_H_
diff --git a/deps/v8/src/sandbox/external-entity-table.h b/deps/v8/src/sandbox/external-entity-table.h
new file mode 100644
index 00000000000000..a0ac884b57685f
--- /dev/null
+++ b/deps/v8/src/sandbox/external-entity-table.h
@@ -0,0 +1,331 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SANDBOX_EXTERNAL_ENTITY_TABLE_H_
+#define V8_SANDBOX_EXTERNAL_ENTITY_TABLE_H_
+
+#include <set>
+
+#include "include/v8-platform.h"
+#include "include/v8config.h"
+#include "src/base/atomicops.h"
+#include "src/base/memory.h"
+#include "src/base/platform/mutex.h"
+#include "src/common/globals.h"
+
+#ifdef V8_COMPRESS_POINTERS
+
+namespace v8 {
+namespace internal {
+
+class Isolate;
+
+/**
+ * A thread-safe table with a fixed maximum size for storing references to
+ * objects located outside of the sandbox.
+ *
+ * An external entity table provides the basic mechanisms to ensure
+ * safe access to objects located outside the sandbox, but referenced
+ * from within it. When an external entity table is used, objects located
+ * inside the sandbox reference outside objects through indices into the table.
+ *
+ * The ExternalEntityTable class should be seen an an incomplete class that
+ * needs to be extended by a concrete implementation class, such as the
+ * ExternalPointerTable class, as it is lacking some functionality. In
+ * particular, while the ExternalEntityTable implements basic table memory
+ * management as well as entry allocation routines, it does not implement any
+ * logic for reclaiming entries such as garbage collection. This must be done
+ * by the child classes.
+ */
+template <typename Entry, size_t size>
+class V8_EXPORT_PRIVATE ExternalEntityTable {
+ protected:
+  static constexpr int kEntrySize = sizeof(Entry);
+  static constexpr size_t kReservationSize = size;
+  static constexpr size_t kMaxCapacity = kReservationSize / kEntrySize;
+
+  // For managing the table's backing memory, the table is partitioned into
+  // segments of this size. Segments can then be allocated and freed using the
+  // AllocateTableSegment() and FreeTableSegment() routines.
+  static constexpr size_t kSegmentSize = 64 * KB;
+  static constexpr size_t kEntriesPerSegment = kSegmentSize / kEntrySize;
+
+  // Struct representing a segment of the table.
+  struct Segment {
+   public:
+    // Initialize a segment given its number.
+    explicit Segment(uint32_t number) : number_(number) {}
+
+    // Returns the segment starting at the specified offset from the base of the
+    // table.
+    static Segment At(uint32_t offset);
+
+    // Returns the segment containing the entry at the given index.
+    static Segment Containing(uint32_t entry_index);
+
+    // The segments of a table are numbered sequentially. This method returns
+    // the number of this segment.
+    uint32_t number() const { return number_; }
+
+    // Returns the offset of this segment from the table base.
+    uint32_t offset() const { return number_ * kSegmentSize; }
+
+    // Returns the index of the first entry in this segment.
+    uint32_t first_entry() const { return number_ * kEntriesPerSegment; }
+
+    // Return the index of the last entry in this segment.
+    uint32_t last_entry() const {
+      return first_entry() + kEntriesPerSegment - 1;
+    }
+
+    // Segments are ordered by their id/offset.
+    bool operator<(const Segment& other) const {
+      return number_ < other.number_;
+    }
+
+   private:
+    // A segment is identified by its number, which is its offset from the base
+    // of the table divided by the segment size.
+    const uint32_t number_;
+  };
+
+  // Struct representing the head of the freelist.
+  //
+  // An external entity table uses simple, singly-linked lists to manage free
+  // entries. Each entry on the freelist contains the 32-bit index of the next
+  // entry. The last entry points to zero.
+  struct FreelistHead {
+    constexpr FreelistHead() : next_(0), length_(0) {}
+    constexpr FreelistHead(uint32_t next, uint32_t length)
+        : next_(next), length_(length) {}
+
+    // Returns the index of the next entry on the freelist.
+    // If the freelist is empty, this returns zero.
+    uint32_t next() const { return next_; }
+
+    // Returns the total length of the freelist.
+    uint32_t length() const { return length_; }
+
+    bool is_empty() const { return length_ == 0; }
+
+   private:
+    uint32_t next_;
+    uint32_t length_;
+  };
+
+  // We expect the FreelistHead struct to fit into a single atomic word.
+  // Otherwise, access to it would be slow.
+  static_assert(std::atomic<FreelistHead>::is_always_lock_free);
+
+  // A collection of segments in an external entity table.
+  //
+  // For the purpose of memory management, a table is partitioned into segments
+  // of a fixed size (e.g. 64kb). A Space is a collection of segments that all
+  // share the same freelist. As such, entry allocation and freeing (e.g.
+  // through garbage collection) all happen on the level of spaces.
+  //
+  // Spaces allow implementing features such as:
+  // * Young generation GC support (a separate space is used for all entries
+  //   belonging to the young generation)
+  // * Having double-width entries in a table (a dedicated space is used that
+  //   contains only double-width entries)
+  // * Sharing one table between multiple isolates that perform GC independently
+  //   (each Isolate owns one space)
+  struct Space {
+   public:
+    Space() = default;
+    Space(const Space&) = delete;
+    Space& operator=(const Space&) = delete;
+    ~Space();
+
+    // Determines the number of entries currently on the freelist.
+    // As entries can be allocated from other threads, the freelist size may
+    // have changed by the time this method returns. As such, the returned
+    // value should only be treated as an approximation.
+    uint32_t freelist_length() const;
+
+    // Returns the current number of segments currently associated with this
+    // space.
+    // The caller must lock the mutex.
+    uint32_t num_segments();
+
+    // Returns whether this space is currently empty.
+    // The caller must lock the mutex.
+    bool is_empty() { return num_segments() == 0; }
+
+    // Returns the current capacity of this space.
+    // The capacity of a space is the total number of entries it can contain.
+    // The caller must lock the mutex.
+    uint32_t capacity() { return num_segments() * kEntriesPerSegment; }
+
+    // Returns true if this space contains the entry with the given index.
+    bool Contains(uint32_t index);
+
+    // Whether this space is attached to a table's internal read-only segment.
+    bool is_internal_read_only_space() const {
+      return is_internal_read_only_space_;
+    }
+
+   protected:
+    friend class ExternalEntityTable<Entry, size>;
+
+#ifdef DEBUG
+    // In debug builds we keep track of which table a space belongs to to be
+    // able to insert additional DCHECKs that verify that spaces are always used
+    // with the correct table.
+    std::atomic<void*> owning_table_ = nullptr;
+
+    // Check whether this space belongs to the given external entity table.
+    bool BelongsTo(void* table) { return owning_table_ == table; }
+#endif  // DEBUG
+
+    // The freelist used by this space.
+    // This contains both the index of the first entry in the freelist and the
+    // total length of the freelist as both values need to be updated together
+    // in a single atomic operation to stay consistent in the case of concurrent
+    // entry allocations.
+    std::atomic<FreelistHead> freelist_head_ = FreelistHead();
+
+    // The collection of segments belonging to this space.
+    std::set<Segment> segments_;
+
+    // Whether this is the internal RO space, which has special semantics:
+    // - read-only page permissions after initialization,
+    // - the space is not swept since slots are live by definition,
+    // - contains exactly one segment, located at offset 0, and
+    // - the segment's lifecycle is managed by `owning_table_`.
+    bool is_internal_read_only_space_ = false;
+
+    // Mutex guarding access to the segments_ set.
+    base::Mutex mutex_;
+  };
+
+  ExternalEntityTable() = default;
+  ExternalEntityTable(const ExternalEntityTable&) = delete;
+  ExternalEntityTable& operator=(const ExternalEntityTable&) = delete;
+
+  // Access the entry at the specified index.
+  Entry& at(uint32_t index);
+  const Entry& at(uint32_t index) const;
+
+  // Returns true if this table has been initialized.
+  bool is_initialized() const;
+
+  // Returns the base address of this table.
+  Address base() const;
+
+  // Allocates a new entry in the given space and return its index.
+  //
+  // If there are no free entries, then this will extend the space by
+  // allocating a new segment.
+  // This method is atomic and can be called from background threads.
+  uint32_t AllocateEntry(Space* space);
+
+  // Attempts to allocate an entry in the given space below the specified index.
+  //
+  // If there are no free entries at a lower index, this method will fail and
+  // return zero. This method will therefore never allocate a new segment.
+  // This method is atomic and can be called from background threads.
+  uint32_t AllocateEntryBelow(Space* space, uint32_t threshold_index);
+
+  // Try to allocate the first entry of the freelist.
+  //
+  // This method is mostly a wrapper around an atomic compare-and-swap which
+  // replaces the current freelist head with the next entry in the freelist,
+  // thereby allocating the entry at the start of the freelist.
+  bool TryAllocateEntryFromFreelist(Space* space, FreelistHead freelist);
+
+  // Allocate a new segment and add it to the given space.
+  //
+  // This should only be called when the freelist of the space is currently
+  // empty. It will then refill the freelist with all entries in the newly
+  // allocated segment.
+  FreelistHead Extend(Space* space);
+
+  // Allocate a new segment in this table.
+  //
+  // The memory of the newly allocated segment is guaranteed to be
+  // zero-initialized.
+  Segment AllocateTableSegment();
+
+  // Free the specified segment of this table.
+  //
+  // The memory of this segment will afterwards be inaccessible.
+  void FreeTableSegment(Segment segment);
+
+  // Marker value for the freelist_head_ member to indicate that entry
+  // allocation is currently forbidden, for example because the table is being
+  // swept as part of a mark+sweep garbage collection. This value should never
+  // occur as freelist_head_ value during normal operations and should be easy
+  // to recognize.
+  static constexpr FreelistHead kEntryAllocationIsForbiddenMarker =
+      FreelistHead(-1, -1);
+
+ public:
+  // Initializes the table by reserving the backing memory, allocating an
+  // initial segment, and populating the freelist.
+  void Initialize();
+
+  // Deallocates all memory associated with this table.
+  void TearDown();
+
+  // Initializes the given space for use with this table.
+  void InitializeSpace(Space* space);
+
+  // Deallocates all segments owned by the given space.
+  void TearDownSpace(Space* space);
+
+  // Attaches/detaches the given space to the internal read-only segment. Note
+  // the lifetime of the underlying segment itself is managed by the table.
+  void AttachSpaceToReadOnlySegment(Space* space);
+  void DetachSpaceFromReadOnlySegment(Space* space);
+
+  // Use this scope to temporarily unseal the read-only segment (i.e. change
+  // permissions to RW).
+  class UnsealReadOnlySegmentScope final {
+   public:
+    explicit UnsealReadOnlySegmentScope(ExternalEntityTable<Entry, size>* table)
+        : table_(table) {
+      table_->UnsealReadOnlySegment();
+    }
+
+    ~UnsealReadOnlySegmentScope() { table_->SealReadOnlySegment(); }
+
+   private:
+    ExternalEntityTable<Entry, size>* const table_;
+  };
+
+ private:
+  // Required for Isolate::CheckIsolateLayout().
+  friend class Isolate;
+
+  static constexpr uint32_t kInternalReadOnlySegmentOffset = 0;
+  static constexpr uint32_t kInternalNullEntryIndex = 0;
+
+  // Helpers to toggle the first segment's permissions between kRead (sealed)
+  // and kReadWrite (unsealed).
+  void UnsealReadOnlySegment();
+  void SealReadOnlySegment();
+
+  // Extends the given space with the given segment.
+  FreelistHead Extend(Space* space, Segment segment);
+
+  // The pointer to the base of the virtual address space backing this table.
+  // All entry accesses happen through this pointer.
+  // It is equivalent to |vas_->base()| and is effectively const after
+  // initialization since the backing memory is never reallocated.
+  Entry* base_ = nullptr;
+
+  // The virtual address space backing this table.
+  // This is used to manage the underlying OS pages, in particular to allocate
+  // and free the segments that make up the table.
+  VirtualAddressSpace* vas_ = nullptr;
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_COMPRESS_POINTERS
+
+#endif  // V8_SANDBOX_EXTERNAL_ENTITY_TABLE_H_
diff --git a/deps/v8/src/sandbox/external-pointer-inl.h b/deps/v8/src/sandbox/external-pointer-inl.h
index 9ad36d66aa3e0a..3481e9c44cd48c 100644
--- a/deps/v8/src/sandbox/external-pointer-inl.h
+++ b/deps/v8/src/sandbox/external-pointer-inl.h
@@ -28,6 +28,13 @@ ExternalPointerTable& GetExternalPointerTable(Isolate* isolate) {
              ? isolate->shared_external_pointer_table()
              : isolate->external_pointer_table();
 }
+
+template <ExternalPointerTag tag>
+ExternalPointerTable::Space* GetDefaultExternalPointerSpace(Isolate* isolate) {
+  return IsSharedExternalPointerType(tag)
+             ? isolate->shared_external_pointer_space()
+             : isolate->heap()->external_pointer_space();
+}
 #endif  // V8_ENABLE_SANDBOX
 
 template <ExternalPointerTag tag>
@@ -36,8 +43,8 @@ V8_INLINE void InitExternalPointerField(Address field_address, Isolate* isolate,
 #ifdef V8_ENABLE_SANDBOX
   static_assert(tag != kExternalPointerNullTag);
   ExternalPointerTable& table = GetExternalPointerTable<tag>(isolate);
-  ExternalPointerHandle handle =
-      table.AllocateAndInitializeEntry(isolate, value, tag);
+  ExternalPointerHandle handle = table.AllocateAndInitializeEntry(
+      GetDefaultExternalPointerSpace<tag>(isolate), value, tag);
   // Use a Release_Store to ensure that the store of the pointer into the
   // table is not reordered after the store of the handle. Otherwise, other
   // threads may access an uninitialized table entry and crash.
@@ -56,7 +63,8 @@ V8_INLINE Address ReadExternalPointerField(Address field_address,
   // Handles may be written to objects from other threads so the handle needs
   // to be loaded atomically. We assume that the load from the table cannot
   // be reordered before the load of the handle due to the data dependency
-  // between the two loads and therefore use relaxed memory ordering.
+  // between the two loads and therefore use relaxed memory ordering, but
+  // technically we should use memory_order_consume here.
   auto location = reinterpret_cast<ExternalPointerHandle*>(field_address);
   ExternalPointerHandle handle = base::AsAtomic32::Relaxed_Load(location);
   return GetExternalPointerTable<tag>(isolate).Get(handle, tag);
@@ -91,8 +99,8 @@ V8_INLINE void WriteLazilyInitializedExternalPointerField(Address field_address,
   ExternalPointerHandle handle = base::AsAtomic32::Relaxed_Load(location);
   if (handle == kNullExternalPointerHandle) {
     // Field has not been initialized yet.
-    ExternalPointerHandle handle =
-        table.AllocateAndInitializeEntry(isolate, value, tag);
+    ExternalPointerHandle handle = table.AllocateAndInitializeEntry(
+        GetDefaultExternalPointerSpace<tag>(isolate), value, tag);
     base::AsAtomic32::Release_Store(location, handle);
   } else {
     table.Set(handle, value, tag);
@@ -102,6 +110,16 @@ V8_INLINE void WriteLazilyInitializedExternalPointerField(Address field_address,
 #endif  // V8_ENABLE_SANDBOX
 }
 
+V8_INLINE void ResetLazilyInitializedExternalPointerField(
+    Address field_address) {
+#ifdef V8_ENABLE_SANDBOX
+  auto location = reinterpret_cast<ExternalPointerHandle*>(field_address);
+  base::AsAtomic32::Release_Store(location, kNullExternalPointerHandle);
+#else
+  WriteMaybeUnalignedValue<Address>(field_address, kNullAddress);
+#endif
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/sandbox/external-pointer-table-inl.h b/deps/v8/src/sandbox/external-pointer-table-inl.h
index 8768840ba7543a..58070686d5e3ef 100644
--- a/deps/v8/src/sandbox/external-pointer-table-inl.h
+++ b/deps/v8/src/sandbox/external-pointer-table-inl.h
@@ -5,190 +5,243 @@
 #ifndef V8_SANDBOX_EXTERNAL_POINTER_TABLE_INL_H_
 #define V8_SANDBOX_EXTERNAL_POINTER_TABLE_INL_H_
 
-#include "src/base/atomicops.h"
-#include "src/common/assert-scope.h"
+#include "src/sandbox/external-entity-table-inl.h"
 #include "src/sandbox/external-pointer-table.h"
 #include "src/sandbox/external-pointer.h"
-#include "src/utils/allocation.h"
 
 #ifdef V8_COMPRESS_POINTERS
 
 namespace v8 {
 namespace internal {
 
-Address ExternalPointerTable::Get(ExternalPointerHandle handle,
-                                  ExternalPointerTag tag) const {
-  uint32_t index = HandleToIndex(handle);
-  Entry entry = RelaxedLoad(index);
-  DCHECK(entry.IsRegularEntry());
-  return entry.Untag(tag);
+void ExternalPointerTableEntry::MakeExternalPointerEntry(
+    Address value, ExternalPointerTag tag) {
+  DCHECK_EQ(0, value & kExternalPointerTagMask);
+  DCHECK(tag & kExternalPointerMarkBit);
+  DCHECK_NE(tag, kExternalPointerFreeEntryTag);
+  DCHECK_NE(tag, kExternalPointerEvacuationEntryTag);
+
+  Payload new_payload(value, tag);
+  payload_.store(new_payload, std::memory_order_relaxed);
+  MaybeUpdateRawPointerForLSan(value);
 }
 
-void ExternalPointerTable::Set(ExternalPointerHandle handle, Address value,
-                               ExternalPointerTag tag) {
-  DCHECK_NE(kNullExternalPointerHandle, handle);
+Address ExternalPointerTableEntry::GetExternalPointer(
+    ExternalPointerTag tag) const {
+  auto payload = payload_.load(std::memory_order_relaxed);
+  DCHECK(payload.ContainsExternalPointer());
+  return payload.Untag(tag);
+}
+
+void ExternalPointerTableEntry::SetExternalPointer(Address value,
+                                                   ExternalPointerTag tag) {
   DCHECK_EQ(0, value & kExternalPointerTagMask);
   DCHECK(tag & kExternalPointerMarkBit);
+  DCHECK(payload_.load(std::memory_order_relaxed).ContainsExternalPointer());
 
-  uint32_t index = HandleToIndex(handle);
-  Entry entry = Entry::MakeRegularEntry(value, tag);
-  RelaxedStore(index, entry);
+  Payload new_payload(value, tag);
+  payload_.store(new_payload, std::memory_order_relaxed);
+  MaybeUpdateRawPointerForLSan(value);
 }
 
-Address ExternalPointerTable::Exchange(ExternalPointerHandle handle,
-                                       Address value, ExternalPointerTag tag) {
-  DCHECK_NE(kNullExternalPointerHandle, handle);
+bool ExternalPointerTableEntry::HasExternalPointer(
+    ExternalPointerTag tag) const {
+  auto payload = payload_.load(std::memory_order_relaxed);
+  return tag == kAnyExternalPointerTag || payload.IsTaggedWith(tag);
+}
+
+Address ExternalPointerTableEntry::ExchangeExternalPointer(
+    Address value, ExternalPointerTag tag) {
   DCHECK_EQ(0, value & kExternalPointerTagMask);
   DCHECK(tag & kExternalPointerMarkBit);
 
-  uint32_t index = HandleToIndex(handle);
-  Entry new_entry = Entry::MakeRegularEntry(value, tag);
-  Entry old_entry = RelaxedExchange(index, new_entry);
-  DCHECK(old_entry.IsRegularEntry());
-  return old_entry.Untag(tag);
-}
-
-bool ExternalPointerTable::TryAllocateEntryFromFreelist(Freelist freelist) {
-  DCHECK(!freelist.IsEmpty());
-  DCHECK_LT(freelist.Head(), capacity());
-  DCHECK_LT(freelist.Size(), capacity());
-
-  Entry entry = RelaxedLoad(freelist.Head());
-  uint32_t new_freelist_head = entry.ExtractNextFreelistEntry();
-
-  Freelist new_freelist(new_freelist_head, freelist.Size() - 1);
-  bool success = Relaxed_CompareAndSwapFreelist(freelist, new_freelist);
-
-  // When the CAS succeeded, the entry must've been a freelist entry.
-  // Otherwise, this is not guaranteed as another thread may have allocated
-  // the same entry in the meantime.
-  if (success) {
-    DCHECK(entry.IsFreelistEntry());
-    DCHECK_LT(new_freelist.Head(), capacity());
-    DCHECK_LT(new_freelist.Size(), capacity());
-    DCHECK_IMPLIES(freelist.Size() > 1, !new_freelist.IsEmpty());
-    DCHECK_IMPLIES(freelist.Size() == 1, new_freelist.IsEmpty());
-  }
-  return success;
+  Payload new_payload(value, tag);
+  Payload old_payload =
+      payload_.exchange(new_payload, std::memory_order_relaxed);
+  DCHECK(old_payload.ContainsExternalPointer());
+  MaybeUpdateRawPointerForLSan(value);
+  return old_payload.Untag(tag);
 }
 
-ExternalPointerHandle ExternalPointerTable::AllocateAndInitializeEntry(
-    Isolate* isolate, Address initial_value, ExternalPointerTag tag) {
-  DCHECK(is_initialized());
-
-  // We currently don't want entry allocation to trigger garbage collection as
-  // this may cause seemingly harmless pointer field assignments to trigger
-  // garbage collection. This is especially true for lazily-initialized
-  // external pointer slots which will typically only allocate the external
-  // pointer table entry when the pointer is first set to a non-null value.
-  DisallowGarbageCollection no_gc;
-
-  Freelist freelist;
-  bool success = false;
-  while (!success) {
-    // This is essentially DCLP (see
-    // https://preshing.com/20130930/double-checked-locking-is-fixed-in-cpp11/)
-    // and so requires an acquire load as well as a release store in Grow() to
-    // prevent reordering of memory accesses, which could for example cause one
-    // thread to read a freelist entry before it has been properly initialized.
-    freelist = Acquire_GetFreelist();
-    if (freelist.IsEmpty()) {
-      // Freelist is empty. Need to take the lock, then attempt to grow the
-      // table if no other thread has done it in the meantime.
-      base::MutexGuard guard(mutex_);
-
-      // Reload freelist head in case another thread already grew the table.
-      freelist = Relaxed_GetFreelist();
-
-      if (freelist.IsEmpty()) {
-        // Freelist is (still) empty so grow the table.
-        freelist = Grow(isolate);
-        // Grow() adds one block to the table and so to the freelist.
-        DCHECK_EQ(freelist.Size(), kEntriesPerBlock);
-      }
-    }
+void ExternalPointerTableEntry::MakeFreelistEntry(uint32_t next_entry_index) {
+  // The next freelist entry is stored in the lower bits of the entry.
+  static_assert(kMaxExternalPointers <= std::numeric_limits<uint32_t>::max());
+  Payload new_payload(next_entry_index, kExternalPointerFreeEntryTag);
+  payload_.store(new_payload, std::memory_order_relaxed);
+}
 
-    success = TryAllocateEntryFromFreelist(freelist);
-  }
+uint32_t ExternalPointerTableEntry::GetNextFreelistEntryIndex() const {
+  auto payload = payload_.load(std::memory_order_relaxed);
+  return payload.ExtractFreelistLink();
+}
 
-  DCHECK_NE(freelist.Head(), 0);
-  DCHECK_LT(freelist.Head(), capacity());
+void ExternalPointerTableEntry::Mark() {
+  auto old_payload = payload_.load(std::memory_order_relaxed);
+  DCHECK(old_payload.ContainsExternalPointer());
 
-  uint32_t entry_index = freelist.Head();
-  Entry entry = Entry::MakeRegularEntry(initial_value, tag);
-  RelaxedStore(entry_index, entry);
+  auto new_payload = old_payload;
+  new_payload.SetMarkBit();
 
-  return IndexToHandle(entry_index);
+  // We don't need to perform the CAS in a loop: if the new value is not equal
+  // to the old value, then the mutator must've just written a new value into
+  // the entry. This in turn must've set the marking bit already (see e.g.
+  // StoreExternalPointer), so we don't need to do it again.
+  bool success = payload_.compare_exchange_strong(old_payload, new_payload,
+                                                  std::memory_order_relaxed);
+  DCHECK(success || old_payload.HasMarkBitSet());
+  USE(success);
 }
 
-ExternalPointerHandle ExternalPointerTable::AllocateEvacuationEntry(
-    uint32_t start_of_evacuation_area) {
-  DCHECK(is_initialized());
-  DCHECK_LT(start_of_evacuation_area, capacity());
-
-  Freelist freelist;
-  bool success = false;
-  while (!success) {
-    freelist = Acquire_GetFreelist();
-    // Check that the next free entry is below the start of the evacuation area.
-    if (freelist.IsEmpty() || freelist.Head() >= start_of_evacuation_area)
-      return kNullExternalPointerHandle;
-
-    success = TryAllocateEntryFromFreelist(freelist);
-  }
+void ExternalPointerTableEntry::MakeEvacuationEntry(Address handle_location) {
+  Payload new_payload(handle_location, kExternalPointerEvacuationEntryTag);
+  payload_.store(new_payload, std::memory_order_relaxed);
+}
+
+void ExternalPointerTableEntry::UnmarkAndMigrateInto(
+    ExternalPointerTableEntry& other) {
+  auto payload = payload_.load(std::memory_order_relaxed);
+  // We expect to only migrate entries containing external pointers.
+  DCHECK(payload.ContainsExternalPointer());
+
+  // During compaction, entries that are evacuated may not be visited during
+  // sweeping and may therefore still have their marking bit set. As such, we
+  // should clear that here.
+  payload.ClearMarkBit();
+
+  other.payload_.store(payload, std::memory_order_relaxed);
+#if defined(LEAK_SANITIZER)
+  other.raw_pointer_for_lsan_ = raw_pointer_for_lsan_;
+#endif  // LEAK_SANITIZER
+
+#ifdef DEBUG
+  // In debug builds, we clobber this old entry so that any sharing of table
+  // entries is easily detected. Shared entries would require write barriers,
+  // so we'd like to avoid them. See the compaction algorithm explanation in
+  // external-pointer-table.h for more details.
+  constexpr Address kClobberedEntryMarker = static_cast<Address>(-1);
+  Payload clobbered(kClobberedEntryMarker, kExternalPointerNullTag);
+  DCHECK_NE(payload, clobbered);
+  payload_.store(clobbered, std::memory_order_relaxed);
+#endif  // DEBUG
+}
+
+Address ExternalPointerTable::Get(ExternalPointerHandle handle,
+                                  ExternalPointerTag tag) const {
+  uint32_t index = HandleToIndex(handle);
+#if defined(V8_USE_ADDRESS_SANITIZER)
+  // We rely on the tagging scheme to produce non-canonical addresses when an
+  // entry isn't tagged with the expected tag. Such "safe" crashes can then be
+  // filtered out by our sandbox crash filter. However, when ASan is active, it
+  // may perform its shadow memory access prior to the actual memory access.
+  // For a non-canonical address, this can lead to a segfault at a _canonical_
+  // address, which our crash filter can then not distinguish from a "real"
+  // crash. Therefore, in ASan builds, we perform an additional CHECK here that
+  // the entry is tagged with the expected tag. The resulting CHECK failure
+  // will then be ignored by the crash filter.
+  // This check is, however, not needed when accessing the null entry, as that
+  // is always valid (it just contains nullptr).
+  CHECK(index == 0 || at(index).HasExternalPointer(tag));
+#else
+  // Otherwise, this is just a DCHECK.
+  DCHECK(index == 0 || at(index).HasExternalPointer(tag));
+#endif
+  return at(index).GetExternalPointer(tag);
+}
 
-  DCHECK_NE(freelist.Head(), 0);
-  DCHECK_LT(freelist.Head(), start_of_evacuation_area);
+void ExternalPointerTable::Set(ExternalPointerHandle handle, Address value,
+                               ExternalPointerTag tag) {
+  DCHECK_NE(kNullExternalPointerHandle, handle);
+  uint32_t index = HandleToIndex(handle);
+  at(index).SetExternalPointer(value, tag);
+}
 
-  return IndexToHandle(freelist.Head());
+Address ExternalPointerTable::Exchange(ExternalPointerHandle handle,
+                                       Address value, ExternalPointerTag tag) {
+  DCHECK_NE(kNullExternalPointerHandle, handle);
+  uint32_t index = HandleToIndex(handle);
+  return at(index).ExchangeExternalPointer(value, tag);
 }
 
-uint32_t ExternalPointerTable::FreelistSize() {
-  Freelist freelist = Relaxed_GetFreelist();
-  DCHECK_LE(freelist.Size(), capacity());
-  return freelist.Size();
+ExternalPointerHandle ExternalPointerTable::AllocateAndInitializeEntry(
+    Space* space, Address initial_value, ExternalPointerTag tag) {
+  DCHECK(space->BelongsTo(this));
+  uint32_t index = AllocateEntry(space);
+  at(index).MakeExternalPointerEntry(initial_value, tag);
+
+  // When we're compacting a space, we're trying to move all entries above a
+  // threshold index (the start of the evacuation area) into segments below
+  // that threshold. However, if the freelist becomes too short and we start
+  // allocating entries inside the area that is supposed to be evacuated, we
+  // need to abort compaction. This is not just an optimization but is also
+  // required for correctness: during sweeping we might otherwise assume that
+  // all entries inside the evacuation area have been moved and that these
+  // segments can therefore be deallocated. In particular, this check will also
+  // make sure that we abort compaction if we extend the space with a new
+  // segment and allocate at least one entry in it (if that segment is located
+  // after the threshold, otherwise it is unproblematic).
+  uint32_t start_of_evacuation_area =
+      space->start_of_evacuation_area_.load(std::memory_order_relaxed);
+  if (V8_UNLIKELY(index >= start_of_evacuation_area)) {
+    space->AbortCompacting(start_of_evacuation_area);
+  }
+
+  return IndexToHandle(index);
 }
 
-void ExternalPointerTable::Mark(ExternalPointerHandle handle,
+void ExternalPointerTable::Mark(Space* space, ExternalPointerHandle handle,
                                 Address handle_location) {
-  static_assert(sizeof(base::Atomic64) == sizeof(Address));
+  DCHECK(space->BelongsTo(this));
+  // The null entry is immortal and immutable, so no need to mark it as alive.
+  if (handle == kNullExternalPointerHandle) return;
+
   // The handle_location must contain the given handle. The only exception to
-  // this is when the handle is zero, which means that it hasn't yet been
-  // initialized. In that case, the handle may be initialized between the
-  // caller loading it and this DCHECK loading it again, in which case the two
-  // values would not be the same. This scenario is unproblematic though as the
-  // new entry will already be marked as alive as it has just been allocated.
-  DCHECK(handle == kNullExternalPointerHandle ||
-         handle ==
-             base::AsAtomic32::Acquire_Load(
-                 reinterpret_cast<ExternalPointerHandle*>(handle_location)));
+  // this is when the handle is zero, which may mean that it hasn't yet been
+  // initialized. However, in that case we'll have already returned from this
+  // function above.
+  DCHECK(handle ==
+         base::AsAtomic32::Acquire_Load(
+             reinterpret_cast<ExternalPointerHandle*>(handle_location)));
 
   uint32_t index = HandleToIndex(handle);
+  DCHECK(space->Contains(index));
+
+  // If the table is being compacted and the entry is inside the evacuation
+  // area, then allocate and set up an evacuation entry for it.
+  MaybeCreateEvacuationEntry(space, index, handle_location);
+
+  // Even if the entry is marked for evacuation, it still needs to be marked as
+  // alive as it may be visited during sweeping before being evacuation.
+  at(index).Mark();
+}
 
+void ExternalPointerTable::MaybeCreateEvacuationEntry(Space* space,
+                                                      uint32_t index,
+                                                      Address handle_location) {
   // Check if the entry should be evacuated for table compaction.
   // The current value of the start of the evacuation area is cached in a local
   // variable here as it otherwise may be changed by another marking thread
   // while this method runs, causing non-optimal behaviour (for example, the
   // allocation of an evacuation entry _after_ the entry that is evacuated).
-  uint32_t current_start_of_evacuation_area = start_of_evacuation_area();
-  if (index >= current_start_of_evacuation_area) {
-    DCHECK(IsCompacting());
-    ExternalPointerHandle new_handle =
-        AllocateEvacuationEntry(current_start_of_evacuation_area);
-    if (new_handle) {
-      DCHECK_LT(HandleToIndex(new_handle), current_start_of_evacuation_area);
-      uint32_t index = HandleToIndex(new_handle);
+  uint32_t start_of_evacuation_area =
+      space->start_of_evacuation_area_.load(std::memory_order_relaxed);
+  if (index >= start_of_evacuation_area) {
+    DCHECK(space->IsCompacting());
+    uint32_t new_index = AllocateEntryBelow(space, start_of_evacuation_area);
+    if (new_index) {
+      DCHECK_LT(new_index, start_of_evacuation_area);
+      DCHECK(space->Contains(new_index));
       // Even though the new entry will only be accessed during sweeping, this
       // still needs to be an atomic write as another thread may attempt (and
       // fail) to allocate the same table entry, thereby causing a read from
       // this memory location. Without an atomic store here, TSan would then
       // complain about a data race.
-      RelaxedStore(index, Entry::MakeEvacuationEntry(handle_location));
+      at(new_index).MakeEvacuationEntry(handle_location);
 #ifdef DEBUG
       // Mark the handle as visited in debug builds to detect double
       // initialization of external pointer fields.
       auto handle_ptr = reinterpret_cast<base::Atomic32*>(handle_location);
-      base::Relaxed_Store(handle_ptr, handle | kVisitedHandleMarker);
+      auto marked_handle = IndexToHandle(index) | kVisitedHandleMarker;
+      base::Relaxed_Store(handle_ptr, marked_handle);
 #endif  // DEBUG
     } else {
       // In this case, the application has allocated a sufficiently large
@@ -199,36 +252,78 @@ void ExternalPointerTable::Mark(ExternalPointerHandle handle,
       // abort compaction here. Entries that have already been visited will
       // still be compacted during Sweep, but there is no guarantee that any
       // blocks at the end of the table will now be completely free.
-      uint32_t compaction_aborted_marker =
-          current_start_of_evacuation_area | kCompactionAbortedMarker;
-      set_start_of_evacuation_area(compaction_aborted_marker);
+      space->AbortCompacting(start_of_evacuation_area);
     }
   }
-  // Even if the entry is marked for evacuation, it still needs to be marked as
-  // alive as it may be visited during sweeping before being evacuation.
+}
 
-  Entry old_entry = RelaxedLoad(index);
-  DCHECK(old_entry.IsRegularEntry());
+bool ExternalPointerTable::IsValidHandle(ExternalPointerHandle handle) const {
+#ifdef DEBUG
+  handle &= ~kVisitedHandleMarker;
+#endif  // DEBUG
+  uint32_t index = handle >> kExternalPointerIndexShift;
+  return handle == index << kExternalPointerIndexShift;
+}
 
-  Entry new_entry = old_entry;
-  new_entry.SetMarkBit();
+uint32_t ExternalPointerTable::HandleToIndex(
+    ExternalPointerHandle handle) const {
+  DCHECK(IsValidHandle(handle));
+  uint32_t index = handle >> kExternalPointerIndexShift;
+#if defined(LEAK_SANITIZER)
+  // When LSan is active, we use "fat" entries that also store the raw pointer
+  // to that LSan can find live references. However, we do this transparently:
+  // we simply multiply the handle by two so that `(handle >> index_shift) * 8`
+  // still produces the correct offset of the entry in the table. However, this
+  // is not secure as an attacker could reference the raw pointer instead of
+  // the encoded pointer in an entry, thereby bypassing the type checks. As
+  // such, this mode must only be used in testing environments. Alternatively,
+  // all places that access external pointer table entries must be made aware
+  // that the entries are 16 bytes large when LSan is active.
+  index /= 2;
+#endif  // LEAK_SANITIZER
+  DCHECK_LE(index, kMaxExternalPointers);
+  return index;
+}
 
-  // We don't need to perform the CAS in a loop: if the new value is not equal
-  // to the old value, then the mutator must've just written a new value into
-  // the entry. This in turn must've set the marking bit already (see
-  // ExternalPointerTable::Set), so we don't need to do it again.
-  Entry entry = RelaxedCompareAndSwap(index, old_entry, new_entry);
-  DCHECK((entry == old_entry) || entry.IsMarked());
-  USE(entry);
+ExternalPointerHandle ExternalPointerTable::IndexToHandle(
+    uint32_t index) const {
+  DCHECK_LE(index, kMaxExternalPointers);
+  ExternalPointerHandle handle = index << kExternalPointerIndexShift;
+#if defined(LEAK_SANITIZER)
+  handle *= 2;
+#endif  // LEAK_SANITIZER
+  DCHECK_NE(handle, kNullExternalPointerHandle);
+  return handle;
+}
+
+void ExternalPointerTable::Space::StartCompacting(
+    uint32_t start_of_evacuation_area) {
+  start_of_evacuation_area_.store(start_of_evacuation_area,
+                                  std::memory_order_relaxed);
+}
+
+void ExternalPointerTable::Space::StopCompacting() {
+  start_of_evacuation_area_.store(kNotCompactingMarker,
+                                  std::memory_order_relaxed);
+}
+
+void ExternalPointerTable::Space::AbortCompacting(
+    uint32_t start_of_evacuation_area) {
+  uint32_t compaction_aborted_marker =
+      start_of_evacuation_area | kCompactionAbortedMarker;
+  DCHECK_NE(compaction_aborted_marker, kNotCompactingMarker);
+  start_of_evacuation_area_.store(compaction_aborted_marker,
+                                  std::memory_order_relaxed);
 }
 
-bool ExternalPointerTable::IsCompacting() {
-  return start_of_evacuation_area() != kNotCompactingMarker;
+bool ExternalPointerTable::Space::IsCompacting() {
+  return start_of_evacuation_area_.load(std::memory_order_relaxed) !=
+         kNotCompactingMarker;
 }
 
-bool ExternalPointerTable::CompactingWasAbortedDuringMarking() {
-  return (start_of_evacuation_area() & kCompactionAbortedMarker) ==
-         kCompactionAbortedMarker;
+bool ExternalPointerTable::Space::CompactingWasAborted() {
+  auto value = start_of_evacuation_area_.load(std::memory_order_relaxed);
+  return (value & kCompactionAbortedMarker) == kCompactionAbortedMarker;
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/sandbox/external-pointer-table.cc b/deps/v8/src/sandbox/external-pointer-table.cc
index 6a3d8aeb196195..b676a6c98a06c6 100644
--- a/deps/v8/src/sandbox/external-pointer-table.cc
+++ b/deps/v8/src/sandbox/external-pointer-table.cc
@@ -4,9 +4,8 @@
 
 #include "src/sandbox/external-pointer-table.h"
 
-#include <algorithm>
-
 #include "src/execution/isolate.h"
+#include "src/heap/read-only-spaces.h"
 #include "src/logging/counters.h"
 #include "src/sandbox/external-pointer-table-inl.h"
 
@@ -15,110 +14,59 @@
 namespace v8 {
 namespace internal {
 
-static_assert(sizeof(ExternalPointerTable) == ExternalPointerTable::kSize);
-
-void ExternalPointerTable::Init(Isolate* isolate) {
-  DCHECK(!is_initialized());
-
-  VirtualAddressSpace* root_space = GetPlatformVirtualAddressSpace();
-  DCHECK(IsAligned(kExternalPointerTableReservationSize,
-                   root_space->allocation_granularity()));
-
-  size_t reservation_size = kExternalPointerTableReservationSize;
-#if defined(LEAK_SANITIZER)
-  // When LSan is active, we use a "shadow table" which contains the raw
-  // pointers stored in this external pointer table so that LSan can scan them.
-  // This is necessary to avoid false leak reports. The shadow table is located
-  // right after the real table in memory. See also lsan_record_ptr().
-  reservation_size *= 2;
-#endif  // LEAK_SANITIZER
-
-  buffer_ = root_space->AllocatePages(
-      VirtualAddressSpace::kNoHint, reservation_size,
-      root_space->allocation_granularity(), PagePermissions::kNoAccess);
-  if (!buffer_) {
-    V8::FatalProcessOutOfMemory(
-        isolate,
-        "Failed to reserve memory for ExternalPointerTable backing buffer");
+void ExternalPointerTable::SetUpFromReadOnlyArtifacts(
+    Space* read_only_space, const ReadOnlyArtifacts* artifacts) {
+  UnsealReadOnlySegmentScope unseal_scope(this);
+  for (const auto& registry_entry : artifacts->external_pointer_registry()) {
+    ExternalPointerHandle handle = AllocateAndInitializeEntry(
+        read_only_space, registry_entry.value, registry_entry.tag);
+    CHECK_EQ(handle, registry_entry.handle);
   }
-
-  mutex_ = new base::Mutex;
-  if (!mutex_) {
-    V8::FatalProcessOutOfMemory(
-        isolate, "Failed to allocate mutex for ExternalPointerTable");
-  }
-
-  // Allocate the initial block. Mutex must be held for that.
-  base::MutexGuard guard(mutex_);
-  Grow(isolate);
-
-  // Set up the special null entry. This entry must contain nullptr so that
-  // empty EmbedderDataSlots represent nullptr.
-  static_assert(kNullExternalPointerHandle == 0);
-  Store(0, Entry::MakeNullEntry());
 }
 
-void ExternalPointerTable::TearDown() {
-  DCHECK(is_initialized());
+uint32_t ExternalPointerTable::SweepAndCompact(Space* space,
+                                               Counters* counters) {
+  DCHECK(space->BelongsTo(this));
+  DCHECK(!space->is_internal_read_only_space());
 
-  size_t reservation_size = kExternalPointerTableReservationSize;
-#if defined(LEAK_SANITIZER)
-  reservation_size *= 2;
-#endif  // LEAK_SANITIZER
+  // Lock the space. Technically this is not necessary since no other thread can
+  // allocate entries at this point, but some of the methods we call on the
+  // space assert that the lock is held.
+  base::MutexGuard guard(&space->mutex_);
 
-  GetPlatformVirtualAddressSpace()->FreePages(buffer_, reservation_size);
-  delete mutex_;
-
-  buffer_ = kNullAddress;
-  capacity_ = 0;
-  freelist_ = 0;
-  mutex_ = nullptr;
-}
-
-uint32_t ExternalPointerTable::SweepAndCompact(Isolate* isolate) {
   // There must not be any entry allocations while the table is being swept as
   // that would not be safe. Set the freelist to this special marker value to
-  // better catch any violation of this requirement.
-  Freelist old_freelist = Relaxed_GetFreelist();
-  base::Release_Store(&freelist_, kTableIsCurrentlySweepingMarker);
-
-  // Keep track of the last block (identified by the index of its first entry)
-  // that has live entries. Used to decommit empty blocks at the end.
-  DCHECK_GE(capacity(), kEntriesPerBlock);
-  const uint32_t last_block = capacity() - kEntriesPerBlock;
-  uint32_t last_in_use_block = last_block;
+  // easily catch any violation of this requirement.
+  space->freelist_head_.store(kEntryAllocationIsForbiddenMarker,
+                              std::memory_order_relaxed);
 
-  // When compacting, we can compute the number of unused blocks at the end of
+  // When compacting, we can compute the number of unused segments at the end of
   // the table and skip those during sweeping.
-  uint32_t first_block_of_evacuation_area = start_of_evacuation_area();
-  if (IsCompacting()) {
+  uint32_t start_of_evacuation_area =
+      space->start_of_evacuation_area_.load(std::memory_order_relaxed);
+  bool evacuation_was_successful = false;
+  if (space->IsCompacting()) {
     TableCompactionOutcome outcome;
-    if (CompactingWasAbortedDuringMarking()) {
+    if (space->CompactingWasAborted()) {
       // Compaction was aborted during marking because the freelist grew to
-      // short. This is not great because now there is no guarantee that any
-      // blocks will be emtpy and so the entire table needs to be swept.
-      outcome = TableCompactionOutcome::kAbortedDuringMarking;
+      // short. In this case, it is not guaranteed that any segments will now
+      // be completely free.
+      outcome = TableCompactionOutcome::kAborted;
       // Extract the original start_of_evacuation_area value so that the
-      // DCHECKs below work correctly.
-      first_block_of_evacuation_area &= ~kCompactionAbortedMarker;
-    } else if (old_freelist.IsEmpty() ||
-               old_freelist.Head() > first_block_of_evacuation_area) {
-      // In this case, marking finished successfully, but the application
-      // afterwards allocated entries inside the area that is being compacted.
-      // In this case, we can still compute how many blocks at the end of the
-      // table are now empty.
-      if (!old_freelist.IsEmpty()) {
-        last_in_use_block = RoundDown(old_freelist.Head(), kEntriesPerBlock);
-      }
-      outcome = TableCompactionOutcome::kPartialSuccess;
+      // DCHECKs below and in ResolveEvacuationEntryDuringSweeping work.
+      start_of_evacuation_area &= ~Space::kCompactionAbortedMarker;
     } else {
-      // Marking was successful so the entire evacuation area is now free.
-      last_in_use_block = first_block_of_evacuation_area - kEntriesPerBlock;
+      // Entry evacuation was successful so all segments inside the evacuation
+      // area are now guaranteed to be free and so can be deallocated.
       outcome = TableCompactionOutcome::kSuccess;
+      evacuation_was_successful = true;
     }
-    isolate->counters()->external_pointer_table_compaction_outcome()->AddSample(
+    DCHECK(IsAligned(start_of_evacuation_area, kEntriesPerSegment));
+
+    space->StopCompacting();
+
+    counters->external_pointer_table_compaction_outcome()->AddSample(
         static_cast<int>(outcome));
-    DCHECK(IsAligned(first_block_of_evacuation_area, kEntriesPerBlock));
   }
 
   // Sweep top to bottom and rebuild the freelist from newly dead and
@@ -126,211 +74,143 @@ uint32_t ExternalPointerTable::SweepAndCompact(Isolate* isolate) {
   // entries and resolving evacuation entries table when compacting the table.
   // This way, the freelist ends up sorted by index which already makes the
   // table somewhat self-compacting and is required for the compaction
-  // algorithm so that evacuated entries are evacuated to the start of the
-  // table. This method must run either on the mutator thread or while the
-  // mutator is stopped.
-  uint32_t current_freelist_size = 0;
+  // algorithm so that evacuated entries are evacuated to the start of a space.
+  // This method must run either on the mutator thread or while the mutator is
+  // stopped.
   uint32_t current_freelist_head = 0;
-
-  // Skip the special null entry. This also guarantees that the first block
-  // will never be decommitted.
-  // The null entry may have been marked as alive (if any live object was
-  // referencing it), which is fine, the entry will just keep the bit set.
-  DCHECK_GE(capacity(), 1);
-  uint32_t table_end = last_in_use_block + kEntriesPerBlock;
-  DCHECK(IsAligned(table_end, kEntriesPerBlock));
-  for (uint32_t i = table_end - 1; i > 0; i--) {
-    // No other threads are active during sweep, so there is no need to use
-    // atomic operations here.
-    Entry entry = Load(i);
-    if (entry.IsEvacuationEntry()) {
-      // Resolve the evacuation entry: take the pointer to the handle from the
-      // evacuation entry, copy the entry to its new location, and finally
-      // update the handle to point to the new entry.
-      ExternalPointerHandle* handle_location =
-          reinterpret_cast<ExternalPointerHandle*>(
-              entry.ExtractHandleLocation());
-
-      ExternalPointerHandle old_handle = *handle_location;
-      ExternalPointerHandle new_handle = IndexToHandle(i);
-
-      // For the compaction algorithm to work optimally, double initialization
-      // of entries is forbidden, see below. This DCHECK can detect double
-      // initialization of external pointer fields in debug builds by checking
-      // that the old_handle was visited during marking.
-      // There's no need to clear the marking bit from the handle as the handle
-      // will be replaced by a new, unmarked handle.
-      DCHECK(HandleWasVisitedDuringMarking(old_handle));
-
-      // The following DCHECKs assert that the compaction algorithm works
-      // correctly: it always moves an entry from the evacuation area to the
-      // front of the table. One reason this invariant can be broken is if an
-      // external pointer slot is re-initialized, in which case the old_handle
-      // may now also point before the evacuation area. For that reason,
-      // re-initialization of external pointer slots is forbidden.
-      DCHECK_GE(HandleToIndex(old_handle), first_block_of_evacuation_area);
-      DCHECK_LT(HandleToIndex(new_handle), first_block_of_evacuation_area);
-
-      Entry entry_to_evacuate = Load(HandleToIndex(old_handle));
-      entry_to_evacuate.ClearMarkBit();
-      Store(i, entry_to_evacuate);
-      *handle_location = new_handle;
-
-#ifdef DEBUG
-      // In debug builds, clobber the old entry so that any sharing of table
-      // entries is easily detected. Shared entries would require write
-      // barriers, so we'd like to avoid them. See the compaction algorithm
-      // explanation in external-pointer-table.h for more details.
-      constexpr Address kClobberedEntryMarker = static_cast<Address>(-1);
-      const Entry kClobberedEntry = Entry::Decode(kClobberedEntryMarker);
-      DCHECK_NE(entry_to_evacuate, kClobberedEntry);
-      Store(HandleToIndex(old_handle), kClobberedEntry);
-#endif  //  DEBUG
-
-      // While we know that the old entry is now free, we don't add it to (the
-      // start of) the freelist because that would immediately cause new
-      // fragmentation when the next entry is allocated. Instead, we assume
-      // that the blocks out of which entries are evacuated will all be
-      // decommitted anyway after this loop, which is usually the case unless
-      // compaction was already aborted during marking.
-    } else if (!entry.IsMarked()) {
-      current_freelist_size++;
-      Entry entry = Entry::MakeFreelistEntry(current_freelist_head);
-      Store(i, entry);
-      current_freelist_head = i;
-    } else {
-      entry.ClearMarkBit();
-      Store(i, entry);
+  uint32_t current_freelist_length = 0;
+  std::vector<Segment> segments_to_deallocate;
+  for (auto segment : base::Reversed(space->segments_)) {
+    // If we evacuated all live entries in this segment then we can skip it
+    // here and directly deallocate it after this loop.
+    if (evacuation_was_successful &&
+        segment.first_entry() >= start_of_evacuation_area) {
+      segments_to_deallocate.push_back(segment);
+      continue;
     }
 
-    if (last_in_use_block == i) {
-      // Finished iterating over the last in-use block. Now see if it is
-      // empty.
-      if (current_freelist_size == kEntriesPerBlock) {
-        // Block is completely empty, so mark it for decommitting.
-        last_in_use_block -= kEntriesPerBlock;
-        // Freelist is now empty again.
-        current_freelist_head = 0;
-        current_freelist_size = 0;
+    // Remember the state of the freelist before this segment in case this
+    // segment turns out to be completely empty and we deallocate it.
+    uint32_t previous_freelist_head = current_freelist_head;
+    uint32_t previous_freelist_length = current_freelist_length;
+
+    // Process every entry in this segment, again going top to bottom.
+    for (uint32_t i = segment.last_entry(); i >= segment.first_entry(); i--) {
+      auto payload = at(i).GetRawPayload();
+      if (payload.ContainsEvacuationEntry()) {
+        // Resolve the evacuation entry: take the pointer to the handle from the
+        // evacuation entry, copy the entry to its new location, and finally
+        // update the handle to point to the new entry.
+        // While we now know that the entry being evacuated is free, we don't
+        // add it to (the start of) the freelist because that would immediately
+        // cause new fragmentation when the next entry is allocated. Instead, we
+        // assume that the segments out of which entries are evacuated will all
+        // be decommitted anyway after this loop, which is usually the case
+        // unless compaction was already aborted during marking.
+        ExternalPointerHandle* handle_location =
+            reinterpret_cast<ExternalPointerHandle*>(
+                payload.ExtractEvacuationEntryHandleLocation());
+        ResolveEvacuationEntryDuringSweeping(i, handle_location,
+                                             start_of_evacuation_area);
+      } else if (!payload.HasMarkBitSet()) {
+        at(i).MakeFreelistEntry(current_freelist_head);
+        current_freelist_head = i;
+        current_freelist_length++;
+      } else {
+        auto new_payload = payload;
+        new_payload.ClearMarkBit();
+        at(i).SetRawPayload(new_payload);
       }
     }
-  }
-
-  // Decommit all blocks at the end of the table that are not used anymore.
-  if (last_in_use_block != last_block) {
-    uint32_t new_capacity = last_in_use_block + kEntriesPerBlock;
-    DCHECK_LT(new_capacity, capacity());
-    Address new_table_end = buffer_ + new_capacity * sizeof(Address);
-    uint32_t bytes_to_decommit = (capacity() - new_capacity) * sizeof(Address);
-    set_capacity(new_capacity);
-
-    VirtualAddressSpace* root_space = GetPlatformVirtualAddressSpace();
-    // The pages may contain stale pointers which could be abused by an
-    // attacker if they are still accessible, so use Decommit here which
-    // guarantees that the pages become inaccessible and will be zeroed out.
-    CHECK(root_space->DecommitPages(new_table_end, bytes_to_decommit));
 
-#if defined(LEAK_SANITIZER)
-    Address new_shadow_table_end = buffer_ +
-                                   kExternalPointerTableReservationSize +
-                                   new_capacity * sizeof(Address);
-    CHECK(root_space->DecommitPages(new_shadow_table_end, bytes_to_decommit));
-#endif  // LEAK_SANITIZER
+    // If a segment is completely empty, free it.
+    uint32_t free_entries = current_freelist_length - previous_freelist_length;
+    bool segment_is_empty = free_entries == kEntriesPerSegment;
+    if (segment_is_empty) {
+      segments_to_deallocate.push_back(segment);
+      // Restore the state of the freelist before this segment.
+      current_freelist_head = previous_freelist_head;
+      current_freelist_length = previous_freelist_length;
+    }
   }
 
-  if (IsCompacting()) {
-    StopCompacting();
+  // We cannot deallocate the segments during the above loop, so do it now.
+  for (auto segment : segments_to_deallocate) {
+    FreeTableSegment(segment);
+    space->segments_.erase(segment);
   }
 
-  Freelist new_freelist(current_freelist_head, current_freelist_size);
-  Release_SetFreelist(new_freelist);
+  FreelistHead new_freelist(current_freelist_head, current_freelist_length);
+  space->freelist_head_.store(new_freelist, std::memory_order_release);
+  DCHECK_EQ(space->freelist_length(), current_freelist_length);
 
-  uint32_t num_active_entries = capacity() - current_freelist_size;
-  isolate->counters()->external_pointers_count()->AddSample(num_active_entries);
-  return num_active_entries;
+  uint32_t num_live_entries = space->capacity() - current_freelist_length;
+  counters->external_pointers_count()->AddSample(num_live_entries);
+  return num_live_entries;
 }
 
-void ExternalPointerTable::StartCompactingIfNeeded() {
-  // This method may be executed while other threads allocate entries from the
-  // freelist or even grow the table, thereby increasing the capacity. In that
-  // case, this method may use incorrect data to determine if table compaction
-  // is necessary. That's fine however since in the worst case, compaction will
-  // simply be aborted right away if the freelist became too small.
-  uint32_t freelist_size = FreelistSize();
-  uint32_t current_capacity = capacity();
+void ExternalPointerTable::Space::StartCompactingIfNeeded() {
+  // Take the lock so that we can be sure that no other thread modifies the
+  // segments set concurrently.
+  base::MutexGuard guard(&mutex_);
 
-  // Current (somewhat arbitrary) heuristic: need compacting if the table is
-  // more than 1MB in size, is at least 10% empty, and if at least one block
-  // can be decommitted after successful compaction.
-  uint32_t table_size = current_capacity * kSystemPointerSize;
-  double free_ratio = static_cast<double>(freelist_size) /
-                      static_cast<double>(current_capacity);
-  uint32_t num_blocks_to_evacuate = (freelist_size / 2) / kEntriesPerBlock;
-  bool should_compact = (table_size >= 1 * MB) && (free_ratio >= 0.10) &&
-                        (num_blocks_to_evacuate >= 1);
+  // This method may be executed while other threads allocate entries from the
+  // freelist. In that case, this method may use incorrect data to determine if
+  // table compaction is necessary. That's fine however since in the worst
+  // case, compaction will simply be aborted right away if the freelist became
+  // too small.
+  uint32_t num_free_entries = freelist_length();
+  uint32_t num_total_entries = capacity();
+
+  // Current (somewhat arbitrary) heuristic: need compacting if the space is
+  // more than 1MB in size, is at least 10% empty, and if at least one segment
+  // can be freed after successful compaction.
+  double free_ratio = static_cast<double>(num_free_entries) /
+                      static_cast<double>(num_total_entries);
+  uint32_t num_segments_to_evacuate =
+      (num_free_entries / 2) / kEntriesPerSegment;
+
+  uint32_t space_size = num_total_entries * kEntrySize;
+  bool should_compact = (space_size >= 1 * MB) && (free_ratio >= 0.10) &&
+                        (num_segments_to_evacuate >= 1);
 
   if (should_compact) {
-    uint32_t num_entries_to_evacuate =
-        num_blocks_to_evacuate * kEntriesPerBlock;
-    set_start_of_evacuation_area(current_capacity - num_entries_to_evacuate);
+    // If we're compacting, attempt to free up the last N segments so that they
+    // can be decommitted afterwards.
+    Segment first_segment_to_evacuate =
+        *std::prev(segments_.end(), num_segments_to_evacuate);
+    uint32_t start_of_evacuation_area = first_segment_to_evacuate.first_entry();
+    StartCompacting(start_of_evacuation_area);
   }
 }
 
-void ExternalPointerTable::StopCompacting() {
-  DCHECK(IsCompacting());
-  set_start_of_evacuation_area(kNotCompactingMarker);
-}
-
-ExternalPointerTable::Freelist ExternalPointerTable::Grow(Isolate* isolate) {
-  // Freelist should be empty when calling this method.
-  DCHECK(Relaxed_GetFreelist().IsEmpty());
-  // Mutex must be held when calling this method.
-  mutex_->AssertHeld();
-
-  // Grow the table by one block.
-  VirtualAddressSpace* root_space = GetPlatformVirtualAddressSpace();
-  DCHECK(IsAligned(kBlockSize, root_space->page_size()));
-  uint32_t old_capacity = capacity();
-  uint32_t new_capacity = old_capacity + kEntriesPerBlock;
-  if (new_capacity > kMaxExternalPointers) {
-    V8::FatalProcessOutOfMemory(
-        isolate, "Cannot grow ExternalPointerTable past its maximum capacity");
-  }
-  if (!root_space->SetPagePermissions(buffer_ + old_capacity * sizeof(Address),
-                                      kBlockSize,
-                                      PagePermissions::kReadWrite)) {
-    V8::FatalProcessOutOfMemory(
-        isolate, "Failed to grow the ExternalPointerTable backing buffer");
-  }
-
-#if defined(LEAK_SANITIZER)
-  if (!root_space->SetPagePermissions(
-          buffer_ + kExternalPointerTableReservationSize +
-              old_capacity * sizeof(Address),
-          kBlockSize, PagePermissions::kReadWrite)) {
-    V8::FatalProcessOutOfMemory(
-        isolate, "Failed to grow the ExternalPointerTabl shadow table");
-  }
-#endif  // LEAK_SANITIZER
-
-  set_capacity(new_capacity);
-
-  // Build freelist bottom to top, which might be more cache friendly.
-  uint32_t start = std::max<uint32_t>(old_capacity, 1);  // Skip entry zero
-  uint32_t last = new_capacity - 1;
-  for (uint32_t i = start; i < last; i++) {
-    uint32_t next_free_entry = i + 1;
-    Store(i, Entry::MakeFreelistEntry(next_free_entry));
-  }
-  Store(last, Entry::MakeFreelistEntry(0));
-
-  // This must be a release store to prevent reordering of the preceeding
-  // stores to the freelist from being reordered past this store. See
-  // AllocateAndInitializeEntry() for more details.
-  Freelist new_freelist(start, last - start + 1);
-  Release_SetFreelist(new_freelist);
-
-  return new_freelist;
+void ExternalPointerTable::ResolveEvacuationEntryDuringSweeping(
+    uint32_t new_index, ExternalPointerHandle* handle_location,
+    uint32_t start_of_evacuation_area) {
+  ExternalPointerHandle old_handle = *handle_location;
+  uint32_t old_index = HandleToIndex(old_handle);
+  ExternalPointerHandle new_handle = IndexToHandle(new_index);
+
+  // For the compaction algorithm to work optimally, double initialization
+  // of entries is forbidden, see below. This DCHECK can detect double
+  // initialization of external pointer fields in debug builds by checking
+  // that the old_handle was visited during marking.
+  // There's no need to clear the bit from the handle as the handle will be
+  // replaced by a new, unmarked handle.
+  DCHECK(HandleWasVisitedDuringMarking(old_handle));
+
+  // The following DCHECKs assert that the compaction algorithm works
+  // correctly: it always moves an entry from the evacuation area to the
+  // front of the table. One reason this invariant can be broken is if an
+  // external pointer slot is re-initialized, in which case the old_handle
+  // may now also point before the evacuation area. For that reason,
+  // re-initialization of external pointer slots is forbidden.
+  DCHECK_GE(old_index, start_of_evacuation_area);
+  DCHECK_LT(new_index, start_of_evacuation_area);
+
+  auto& new_entry = at(new_index);
+  at(old_index).UnmarkAndMigrateInto(new_entry);
+  *handle_location = new_handle;
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/sandbox/external-pointer-table.h b/deps/v8/src/sandbox/external-pointer-table.h
index d76bd771857cf4..a699640b792e44 100644
--- a/deps/v8/src/sandbox/external-pointer-table.h
+++ b/deps/v8/src/sandbox/external-pointer-table.h
@@ -10,6 +10,7 @@
 #include "src/base/memory.h"
 #include "src/base/platform/mutex.h"
 #include "src/common/globals.h"
+#include "src/sandbox/external-entity-table.h"
 
 #ifdef V8_COMPRESS_POINTERS
 
@@ -17,13 +18,183 @@ namespace v8 {
 namespace internal {
 
 class Isolate;
+class Counters;
+class ReadOnlyArtifacts;
+
+/**
+ * The entries of an ExternalPointerTable.
+ *
+ * Each entry consists of a single pointer-sized word containing the external
+ * pointer, the marking bit, and a type tag. An entry can either be:
+ *  - A "regular" entry, containing the external pointer together with a type
+ *    tag and the marking bit in the unused upper bits, or
+ *  - A freelist entry, tagged with the kExternalPointerFreeEntryTag and
+ *    containing the index of the next free entry in the lower 32 bits, or
+ *  - An evacuation entry, tagged with the kExternalPointerEvacuationEntryTag
+ *    and containing the address of the ExternalPointerSlot referencing the
+ *    entry that will be evacuated into this entry. See the compaction
+ *    algorithm overview for more details about these entries.
+ */
+struct ExternalPointerTableEntry {
+  // Make this entry an external pointer entry containing the given pointer
+  // tagged with the given tag.
+  inline void MakeExternalPointerEntry(Address value, ExternalPointerTag tag);
+
+  // Load and untag the external pointer stored in this entry.
+  // This entry must be an external pointer entry.
+  // If the specified tag doesn't match the actual tag of this entry, the
+  // resulting pointer will be invalid and cannot be dereferenced.
+  inline Address GetExternalPointer(ExternalPointerTag tag) const;
+
+  // Tag and store the given external pointer in this entry.
+  // This entry must be an external pointer entry.
+  inline void SetExternalPointer(Address value, ExternalPointerTag tag);
+
+  // Returns true if this entry contains an external pointer with the given tag.
+  inline bool HasExternalPointer(ExternalPointerTag tag) const;
+
+  // Exchanges the external pointer stored in this entry with the provided one.
+  // Returns the old external pointer. This entry must be an external pointer
+  // entry. If the provided tag doesn't match the tag of the old entry, the
+  // returned pointer will be invalid.
+  inline Address ExchangeExternalPointer(Address value, ExternalPointerTag tag);
+
+  // Make this entry a freelist entry, containing the index of the next entry
+  // on the freelist.
+  inline void MakeFreelistEntry(uint32_t next_entry_index);
+
+  // Get the index of the next entry on the freelist. This method may be
+  // called even when the entry is not a freelist entry. However, the result
+  // is only valid if this is a freelist entry. This behaviour is required
+  // for efficient entry allocation, see TryAllocateEntryFromFreelist.
+  inline uint32_t GetNextFreelistEntryIndex() const;
+
+  // Make this entry an evacuation entry containing the address of the handle to
+  // the entry being evacuated.
+  inline void MakeEvacuationEntry(Address handle_location);
+
+  // Move the content of this entry into the provided entry while also clearing
+  // the marking bit. Used during table compaction. This invalidates the entry.
+  inline void UnmarkAndMigrateInto(ExternalPointerTableEntry& other);
+
+  // Mark this entry as alive during table garbage collection.
+  inline void Mark();
+
+ private:
+  friend class ExternalPointerTable;
+
+  // ExternalPointerTable entries consist of a single pointer-sized word
+  // containing a tag and marking bit together with the actual content (e.g. an
+  // external pointer).
+  struct Payload {
+    Payload(Address pointer, ExternalPointerTag tag)
+        : encoded_word_(Tag(pointer, tag)) {}
+
+    Address Untag(ExternalPointerTag tag) const { return encoded_word_ & ~tag; }
+
+    static Address Tag(Address pointer, ExternalPointerTag tag) {
+      return pointer | tag;
+    }
+
+    bool IsTaggedWith(ExternalPointerTag tag) const {
+      // We have to explicitly ignore the marking bit (which is part of the
+      // tag) since an unmarked entry with tag kXyzTag is still considered to
+      // be tagged with kXyzTag.
+      uint64_t expected = tag & ~kExternalPointerMarkBit;
+      uint64_t actual = encoded_word_ & kExternalPointerTagMaskWithoutMarkBit;
+      return expected == actual;
+    }
+
+    void SetMarkBit() { encoded_word_ |= kExternalPointerMarkBit; }
+
+    void ClearMarkBit() { encoded_word_ &= ~kExternalPointerMarkBit; }
+
+    bool HasMarkBitSet() const {
+      return (encoded_word_ & kExternalPointerMarkBit) != 0;
+    }
+
+    bool ContainsFreelistLink() const {
+      return IsTaggedWith(kExternalPointerFreeEntryTag);
+    }
+
+    uint32_t ExtractFreelistLink() const {
+      return static_cast<uint32_t>(encoded_word_);
+    }
+
+    bool ContainsEvacuationEntry() const {
+      return IsTaggedWith(kExternalPointerEvacuationEntryTag);
+    }
+
+    Address ExtractEvacuationEntryHandleLocation() const {
+      return Untag(kExternalPointerEvacuationEntryTag);
+    }
+
+    bool ContainsExternalPointer() const {
+      return !ContainsFreelistLink() && !ContainsEvacuationEntry();
+    }
+
+    bool operator==(Payload other) const {
+      return encoded_word_ == other.encoded_word_;
+    }
+    bool operator!=(Payload other) const {
+      return encoded_word_ != other.encoded_word_;
+    }
+
+   private:
+    Address encoded_word_;
+  };
+
+  inline Payload GetRawPayload() {
+    return payload_.load(std::memory_order_relaxed);
+  }
+  inline void SetRawPayload(Payload new_payload) {
+    return payload_.store(new_payload, std::memory_order_relaxed);
+  }
+
+  inline void MaybeUpdateRawPointerForLSan(Address value) {
+#if defined(LEAK_SANITIZER)
+    raw_pointer_for_lsan_ = value;
+#endif  // LEAK_SANITIZER
+  }
+
+  std::atomic<Payload> payload_;
+
+#if defined(LEAK_SANITIZER)
+  //  When LSan is active, it must be able to detect live references to heap
+  //  allocations from an external pointer table. It will, however, not be able
+  //  to recognize the encoded pointers as they will have their top bits set. So
+  //  instead, when LSan is active we use "fat" entries where the 2nd atomic
+  //  words contains the unencoded raw pointer which LSan will be able to
+  //  recognize as such.
+  //  NOTE: THIS MODE IS NOT SECURE! Attackers are able to modify an
+  //  ExternalPointerHandle to point to the raw pointer part, not the encoded
+  //  part of an entry, thereby bypassing the type checks. If this mode is ever
+  //  needed outside of testing environments, then the external pointer
+  //  accessors (e.g. in the JIT) need to be made aware that entries are now 16
+  //  bytes large so that all entry accesses are again guaranteed to access an
+  //  encoded pointer.
+  Address raw_pointer_for_lsan_;
+#endif  // LEAK_SANITIZER
+};
+
+#if defined(LEAK_SANITIZER)
+//  When LSan is active, we need "fat" entries, see above.
+static_assert(sizeof(ExternalPointerTableEntry) == 16);
+#else
+//  We expect ExternalPointerTable entries to consist of a single 64-bit word.
+static_assert(sizeof(ExternalPointerTableEntry) == 8);
+#endif
 
 /**
  * A table storing pointers to objects outside the V8 heap.
  *
  * When V8_ENABLE_SANDBOX, its primary use is for pointing to objects outside
  * the sandbox, as described below.
+ * When V8_COMPRESS_POINTERS, external pointer tables are also used to ease
+ * alignment requirements in heap object fields via indirection.
  *
+ * A table's role for the V8 Sandbox:
+ * --------------------------------
  * An external pointer table provides the basic mechanisms to ensure
  * memory-safe access to objects located outside the sandbox, but referenced
  * from within it. When an external pointer table is used, objects located
@@ -39,12 +210,19 @@ class Isolate;
  * which ensures that every entry is either an invalid pointer or a valid
  * pointer pointing to a live object.
  *
- * Spatial memory safety can, if necessary, be ensured by storing the size of a
- * referenced object together with the object itself outside the sandbox, and
- * referencing both through a single entry in the table.
+ * Spatial memory safety can, if necessary, be ensured either by storing the
+ * size of the referenced object together with the object itself outside the
+ * sandbox, or by storing both the pointer and the size in one (double-width)
+ * table entry.
  *
- * The garbage collection algorithm for the table works as follows:
- *  - The top bit of every entry is reserved for the marking bit.
+ * Table memory management:
+ * ------------------------
+ * For the purpose of memory management, the table is partitioned into Segments
+ * (for example 64kb memory chunks) that are grouped together in "Spaces". All
+ * segments in a space share a freelist, and so entry allocation and garbage
+ * collection happen on the level of spaces. The garbage collection algorithm
+ * then works as follows:
+ *  - One bit of every entry is reserved for the marking bit.
  *  - Every store to an entry automatically sets the marking bit when ORing
  *    with the tag. This avoids the need for write barriers.
  *  - Every load of an entry automatically removes the marking bit when ANDing
@@ -52,35 +230,134 @@ class Isolate;
  *  - When the GC marking visitor finds a live object with an external pointer,
  *    it marks the corresponding entry as alive through Mark(), which sets the
  *    marking bit using an atomic CAS operation.
- *  - When marking is finished, SweepAndCompact() iterates of the table once
+ *  - When marking is finished, SweepAndCompact() iterates over a Space once
  *    while the mutator is stopped and builds a freelist from all dead entries
  *    while also removing the marking bit from any live entry.
  *
- * The freelist is a singly-linked list, using the lower 32 bits of each entry
- * to store the index of the next free entry. When the freelist is empty and a
- * new entry is allocated, the table grows in place and the freelist is
- * re-populated from the newly added entries.
+ * Table compaction:
+ * -----------------
+ * The table's spaces are to some degree self-compacting: since the freelists
+ * are sorted in ascending order (see SweepAndCompact()), segments at the start
+ * of the table will usually be fairly well utilized, while later segments
+ * might become completely free, in which case they will be deallocated.
+ * However, as a single live entry may keep an entire segment alive, the
+ * following simple algorithm is used to compact a space if that is deemed
+ * necessary:
+ *  - At the start of the GC marking phase, determine if a space needs to be
+ *    compacted. This decisiont is mostly based on the absolute and relative
+ *    size of the freelist.
+ *  - If compaction is needed, this algorithm determines by how many segments
+ *    it would like to shrink the space (N). It will then attempts to move all
+ *    live entries out of these segments so that they can be deallocated
+ *    afterwards during sweeping.
+ *  - The algorithm then simply selects the last N segments for evacuation, and
+ *    it "marks" them for evacuation simply by remembering the start of the
+ *    first selected segment. Everything after this threshold value then
+ *    becomes the evacuation area. In this way, it becomes very cheap to test
+ *    if an entry or segment should be evacuated: only a single integer
+ *    comparison against the threshold is required. It also establishes a
+ *    simple compaction invariant that can be verified with a few DCHECKs:
+ *    compaction always moves an entry at or above the threshold to a new
+ *    position before the threshold.
+ *  - During marking, whenever a live entry inside the evacuation area is
+ *    found, a new "evacuation entry" is allocated from the freelist (which is
+ *    assumed to have enough free slots) and the address of the handle in the
+ *    object owning the table entry is written into it.
+ *  - During sweeping, these evacuation entries are resolved: the content of
+ *    the old entry is copied into the new entry and the handle in the object
+ *    is updated to point to the new entry.
  *
- * When V8_COMPRESS_POINTERS, external pointer tables are also used to ease
- * alignment requirements in heap object fields via indirection.
+ * When compacting, it is expected that the evacuation area contains few live
+ * entries and that the freelist will be able to serve all evacuation entry
+ * allocations. In that case, compaction is essentially free (very little
+ * marking overhead, no memory overhead). However, it can happen that the
+ * application allocates a large number of table entries during marking, in
+ * which case we might end up allocating new entries inside the evacuation area
+ * or even allocate entire new segments for the space that's being compacted.
+ * If that situation is detected, compaction is aborted during marking.
+ *
+ * This algorithm assumes that table entries (except for the null entry) are
+ * never shared between multiple objects. Otherwise, the following could
+ * happen: object A initially has handle H1 and is scanned during incremental
+ * marking. Next, object B with handle H2 is scanned and marked for
+ * evacuation. Afterwards, object A copies the handle H2 from object B.
+ * During sweeping, only object B's handle will be updated to point to the
+ * new entry while object A's handle is now dangling. If shared entries ever
+ * become necessary, setting external pointer handles would have to be
+ * guarded by write barriers to avoid this scenario.
  */
-class V8_EXPORT_PRIVATE ExternalPointerTable {
+class V8_EXPORT_PRIVATE ExternalPointerTable
+    : public ExternalEntityTable<ExternalPointerTableEntry,
+                                 kExternalPointerTableReservationSize> {
+#if defined(LEAK_SANITIZER)
+  //  When LSan is active, we use "fat" entries, see above.
+  static_assert(kMaxExternalPointers == kMaxCapacity * 2);
+#else
+  static_assert(kMaxExternalPointers == kMaxCapacity);
+#endif
+
  public:
   // Size of an ExternalPointerTable, for layout computation in IsolateData.
-  // Asserted to be equal to the actual size in external-pointer-table.cc.
-  static int constexpr kSize = 4 * kSystemPointerSize;
+  static int constexpr kSize = 2 * kSystemPointerSize;
 
   ExternalPointerTable() = default;
-
   ExternalPointerTable(const ExternalPointerTable&) = delete;
   ExternalPointerTable& operator=(const ExternalPointerTable&) = delete;
 
-  // Initializes this external pointer table by reserving the backing memory
-  // and initializing the freelist.
-  void Init(Isolate* isolate);
+  // The Spaces used by an ExternalPointerTable also contain the state related
+  // to compaction.
+  struct Space : public ExternalEntityTable<
+                     ExternalPointerTableEntry,
+                     kExternalPointerTableReservationSize>::Space {
+   public:
+    Space() : start_of_evacuation_area_(kNotCompactingMarker) {}
+
+    // Determine if compaction is needed and if so start the compaction.
+    // This is expected to be called at the start of the GC marking phase.
+    void StartCompactingIfNeeded();
 
-  // Resets this external pointer table and deletes all associated memory.
-  void TearDown();
+   private:
+    friend class ExternalPointerTable;
+
+    // Routines for compaction. See the comment about table compaction above.
+    inline bool IsCompacting();
+    inline void StartCompacting(uint32_t start_of_evacuation_area);
+    inline void StopCompacting();
+    inline void AbortCompacting(uint32_t start_of_evacuation_area);
+    inline bool CompactingWasAborted();
+
+    // This value indicates that this space is not currently being compacted. It
+    // is set to uint32_t max so that determining whether an entry should be
+    // evacuated becomes a single comparison:
+    // `bool should_be_evacuated = index >= start_of_evacuation_area`.
+    static constexpr uint32_t kNotCompactingMarker =
+        std::numeric_limits<uint32_t>::max();
+
+    // This value may be ORed into the start of evacuation area threshold
+    // during the GC marking phase to indicate that compaction has been
+    // aborted because the freelist grew to short and so evacuation entry
+    // allocation is no longer possible. This will prevent any further
+    // evacuation attempts as entries will be evacuated if their index is at or
+    // above the start of the evacuation area, which is now a huge value.
+    static constexpr uint32_t kCompactionAbortedMarker = 0xf0000000;
+
+    // When compacting this space, this field contains the index of the first
+    // entry in the evacuation area. The evacuation area then consists of all
+    // segments above this threshold, and the goal of compaction is to move all
+    // live entries out of these segments so that they can be deallocated after
+    // sweeping. The field can have the following values:
+    // - kNotCompactingMarker: compaction is not currently running.
+    // - A kEntriesPerSegment aligned value within: compaction is running and
+    //   all entries after this value should be evacuated.
+    // - A value that has kCompactionAbortedMarker in its top bits:
+    //   compaction has been aborted during marking. The original start of the
+    //   evacuation area is still contained in the lower bits.
+    std::atomic<uint32_t> start_of_evacuation_area_;
+  };
+
+  // Initializes all slots in the RO space from pre-existing artifacts.
+  void SetUpFromReadOnlyArtifacts(Space* read_only_space,
+                                  const ReadOnlyArtifacts* artifacts);
 
   // Retrieves the entry referenced by the given handle.
   //
@@ -102,499 +379,72 @@ class V8_EXPORT_PRIVATE ExternalPointerTable {
   inline Address Exchange(ExternalPointerHandle handle, Address value,
                           ExternalPointerTag tag);
 
-  // Allocates a new entry in the external pointer table. The caller must
-  // provide the initial value and tag.
+  // Allocates a new entry in the given space. The caller must provide the
+  // initial value and tag for the entry.
   //
   // This method is atomic and can be called from background threads.
   inline ExternalPointerHandle AllocateAndInitializeEntry(
-      Isolate* isolate, Address initial_value, ExternalPointerTag tag);
-
-  // Determines the number of entries currently on the freelist.
-  // The freelist entries encode the freelist size and the next entry on the
-  // list, so this routine fetches the first entry on the freelist and returns
-  // the size encoded in it.
-  // As table entries can be allocated from other threads, the freelist size
-  // may have changed by the time this method returns. As such, the returned
-  // value should only be treated as an approximation.
-  inline uint32_t FreelistSize();
+      Space* space, Address initial_value, ExternalPointerTag tag);
 
   // Marks the specified entry as alive.
   //
-  // If the table is currently being compacted, this may also mark the entry
-  // for compaction for which the location of the handle is required. See the
-  // comments about table compaction below for more details.
+  // If the space to which the entry belongs is currently being compacted, this
+  // may also mark the entry for evacuation for which the location of the
+  // handle is required. See the comments about the compaction algorithm for
+  // more details.
   //
   // This method is atomic and can be called from background threads.
-  inline void Mark(ExternalPointerHandle handle, Address handle_location);
+  inline void Mark(Space* space, ExternalPointerHandle handle,
+                   Address handle_location);
 
-  // Frees unmarked entries and finishes table compaction (if running).
+  // Frees unmarked entries and finishes space compaction (if running).
   //
   // This method must only be called while mutator threads are stopped as it is
   // not safe to allocate table entries while the table is being swept.
   //
   // Returns the number of live entries after sweeping.
-  uint32_t SweepAndCompact(Isolate* isolate);
-
-  // Table compaction.
-  //
-  // The table is to some degree self-compacting: since the freelist is
-  // sorted in ascending order (see SweepAndCompact()), empty slots at the start
-  // of the table will usually quickly be filled. Further, empty blocks at the
-  // end of the table will be decommitted to reduce memory usage. However, live
-  // entries at the end of the table can prevent this decommitting and cause
-  // fragmentation. The following simple algorithm is therefore used to
-  // compact the table if that is deemed necessary:
-  //  - At the start of the GC marking phase, determine if the table needs to be
-  //    compacted. This decisiont is mostly based on the absolute and relative
-  //    size of the freelist.
-  //  - If compaction is needed, this algorithm attempts to shrink the table by
-  //    FreelistSize/2 entries during compaction by moving all live entries out
-  //    of the evacuation area (the last FreelistSize/2 entries of the table),
-  //    then decommitting those blocks at the end of SweepAndCompact.
-  //  - During marking, whenever a live entry inside the evacuation area is
-  //    found, a new "evacuation entry" is allocated from the freelist (which is
-  //    assumed to have enough free slots) and the address of the handle is
-  //    written into it.
-  //  - During sweeping, these evacuation entries are resolved: the content of
-  //    the old entry is copied into the new entry and the handle in the object
-  //    is updated to point to the new entry.
-  //
-  // When compacting, it is expected that the evacuation area contains few live
-  // entries and that the freelist will be able to serve all evacuation entry
-  // allocations. In that case, compaction is essentially free (very little
-  // marking overhead, no memory overhead). However, it can happen that the
-  // application allocates a large number of entries from the table during
-  // marking, in which case the freelist would no longer be able to serve all
-  // allocation without growing. If that situation is detected, compaction is
-  // aborted during marking.
-  //
-  // This algorithm assumes that table entries (except for the null entry) are
-  // never shared between multiple objects. Otherwise, the following could
-  // happen: object A initially has handle H1 and is scanned during incremental
-  // marking. Next, object B with handle H2 is scanned and marked for
-  // evacuation. Afterwards, object A copies the handle H2 from object B.
-  // During sweeping, only object B's handle will be updated to point to the
-  // new entry while object A's handle is now dangling. If shared entries ever
-  // become necessary, setting external pointer handles would have to be
-  // guarded by write barriers to avoid this scenario.
-
-  // Use heuristics to determine if table compaction is needed and if so start
-  // the compaction. This is expected to be called at the start of the GC
-  // marking phase.
-  void StartCompactingIfNeeded();
-
-  // Returns true if table compaction is currently running.
-  inline bool IsCompacting();
-
-  // Returns true if table compaction was aborted during the GC marking phase.
-  inline bool CompactingWasAbortedDuringMarking();
+  uint32_t SweepAndCompact(Space* space, Counters* counters);
 
  private:
-  // Required for Isolate::CheckIsolateLayout().
-  friend class Isolate;
+  inline bool IsValidHandle(ExternalPointerHandle handle) const;
+  inline uint32_t HandleToIndex(ExternalPointerHandle handle) const;
+  inline ExternalPointerHandle IndexToHandle(uint32_t index) const;
 
-  //
-  // ExternalPointerTable constants.
-  //
-  // An external pointer table grows and shrinks in blocks of this size. This
-  // is also the initial size of the table.
-#if V8_TARGET_ARCH_PPC64
-  // PPC64 uses 64KB pages, and this must be a multiple of the page size.
-  static constexpr size_t kBlockSize = 64 * KB;
-#else
-  static constexpr size_t kBlockSize = 16 * KB;
-#endif
-  static constexpr size_t kEntriesPerBlock = kBlockSize / kSystemPointerSize;
-
-  // When the table is swept, it first sets the freelist_ to this special value
-  // to better catch any violation of the "don't-alloc-while-sweeping"
-  // requirement (see SweepAndCompact()). This value should never occur as
-  // freelist_ value during normal operations and should be easy to recognize.
-  static constexpr uint64_t kTableIsCurrentlySweepingMarker =
-      static_cast<uint64_t>(-1);
-
-  // This value is used for start_of_evacuation_area to indicate that the table
-  // is not currently being compacted. It is set to uint32_t max so that
-  // determining whether an entry should be evacuated becomes a single
-  // comparison: `bool should_be_evacuated = index >= start_of_evacuation_area`.
-  static constexpr uint32_t kNotCompactingMarker =
-      std::numeric_limits<uint32_t>::max();
-
-  // This value may be ORed into the start_of_evacuation_area value during the
-  // GC marking phase to indicate that table compaction has been aborted
-  // because the freelist grew to short. This will prevent further evacuation
-  // attempts as `should_be_evacuated` (see above) will always be false.
-  static constexpr uint32_t kCompactionAbortedMarker = 0xf0000000;
+  inline void MaybeCreateEvacuationEntry(Space* space, uint32_t index,
+                                         Address handle_location);
 
+  void ResolveEvacuationEntryDuringSweeping(
+      uint32_t index, ExternalPointerHandle* handle_location,
+      uint32_t start_of_evacuation_area);
+
+#ifdef DEBUG
   // In debug builds during GC marking, this value is ORed into
   // ExternalPointerHandles whose entries are marked for evacuation. During
   // sweeping, the Handles for evacuated entries are checked to have this
   // marker value. This allows detecting re-initialized entries, which are
-  // problematic for table compaction. This is only possible for entries marked
-  // for evacuation as the location of the Handle is only known for those.
+  // problematic for compaction. This is only possible for entries marked for
+  // evacuation as the location of the Handle is only known for those.
   static constexpr uint32_t kVisitedHandleMarker = 0x1;
   static_assert(kExternalPointerIndexShift >= 1);
 
-  //
-  // Internal methods.
-  //
-  // Returns true if this external pointer table has been initialized.
-  bool is_initialized() { return buffer_ != kNullAddress; }
-
-  // Table capacity accesors.
-  // The capacity is expressed in number of entries.
-  //
-  // The capacity of the table may increase during entry allocation (if the
-  // table is grown) and may decrease during sweeping (if blocks at the end are
-  // free). As the former may happen concurrently, the capacity can only be
-  // used reliably if either the table mutex is held or if all mutator threads
-  // are currently stopped. However, it is fine to use this value to
-  // sanity-check incoming ExternalPointerHandles in debug builds (there's no
-  // need for actual bounds-checks because out-of-bounds accesses are guaranteed
-  // to result in a harmless crash).
-  uint32_t capacity() const { return base::Relaxed_Load(&capacity_); }
-  void set_capacity(uint32_t new_capacity) {
-    base::Relaxed_Store(&capacity_, new_capacity);
-  }
-
-  // Start of evacuation area accessors.
-  uint32_t start_of_evacuation_area() const {
-    return base::Relaxed_Load(&start_of_evacuation_area_);
-  }
-  void set_start_of_evacuation_area(uint32_t value) {
-    base::Relaxed_Store(&start_of_evacuation_area_, value);
-  }
-
-  // Struct to represent the freelist of a table.
-  // In it's encoded form, this is stored in the freelist_ member of the table.
-  class Freelist {
-   public:
-    Freelist() : encoded_(0) {}
-    Freelist(uint32_t head, uint32_t size)
-        : encoded_((static_cast<uint64_t>(size) << 32) | head) {}
-
-    uint32_t Head() const { return static_cast<uint32_t>(encoded_); }
-    uint32_t Size() const { return static_cast<uint32_t>(encoded_ >> 32); }
-
-    bool IsEmpty() const {
-      DCHECK_EQ(Head() == 0, Size() == 0);
-      return encoded_ == 0;
-    }
-
-    uint64_t Encode() const { return encoded_; }
-
-    static Freelist Decode(uint64_t encoded_form) {
-      DCHECK_NE(encoded_form, kTableIsCurrentlySweepingMarker);
-      return Freelist(encoded_form);
-    }
-
-   private:
-    explicit Freelist(uint64_t encoded_form) : encoded_(encoded_form) {}
-
-    uint64_t encoded_;
-  };
-
-  // Freelist accessors.
-  Freelist Relaxed_GetFreelist() {
-    return Freelist::Decode(base::Relaxed_Load(&freelist_));
-  }
-  Freelist Acquire_GetFreelist() {
-    return Freelist::Decode(base::Acquire_Load(&freelist_));
-  }
-  void Relaxed_SetFreelist(Freelist new_freelist) {
-    base::Relaxed_Store(&freelist_, new_freelist.Encode());
-  }
-  void Release_SetFreelist(Freelist new_freelist) {
-    base::Release_Store(&freelist_, new_freelist.Encode());
-  }
-  bool Relaxed_CompareAndSwapFreelist(Freelist old_freelist,
-                                      Freelist new_freelist) {
-    uint64_t old_val = base::Relaxed_CompareAndSwap(
-        &freelist_, old_freelist.Encode(), new_freelist.Encode());
-    return old_val == old_freelist.Encode();
+  inline bool HandleWasVisitedDuringMarking(ExternalPointerHandle handle) {
+    return (handle & kVisitedHandleMarker) == kVisitedHandleMarker;
   }
-
-  // Allocate an entry suitable as evacuation entry during table compaction.
-  //
-  // This method will always return an entry before the start of the evacuation
-  // area or fail by returning kNullExternalPointerHandle. It expects the
-  // current start of the evacuation area to be passed as parameter (instead of
-  // loading it from memory) as that value may be modified by another marking
-  // thread when compaction is aborted. See the explanation of the compaction
-  // algorithm for more details.
-  //
-  // The caller is responsible for initializing the entry.
-  //
-  // This method is atomic and can be called from background threads.
-  inline ExternalPointerHandle AllocateEvacuationEntry(
-      uint32_t start_of_evacuation_area);
-
-  // Try to allocate the entry at the start of the freelist.
-  //
-  // This method is mostly a wrapper around an atomic compare-and-swap which
-  // replaces the current freelist_head with the next entry in the freelist,
-  // thereby allocating the entry at the start of the freelist.
-  inline bool TryAllocateEntryFromFreelist(Freelist freelist);
-
-  // Extends the table and adds newly created entries to the freelist. Returns
-  // the new freelist.
-  // When calling this method, mutex_ must be locked.
-  // If the table cannot be grown, either because it is already at its maximum
-  // size or because the memory for it could not be allocated, this method will
-  // fail with an OOM crash.
-  Freelist Grow(Isolate* isolate);
-
-  // Stop compacting at the end of sweeping.
-  void StopCompacting();
+#endif  // DEBUG
 
   // Outcome of external pointer table compaction to use for the
   // ExternalPointerTableCompactionOutcome histogram.
   enum class TableCompactionOutcome {
     // Table compaction was successful.
     kSuccess = 0,
-    // Table compaction was partially successful: marking finished successfully,
-    // but not all blocks that we wanted to free could be freed because some new
-    // entries had already been allocated in them again.
-    kPartialSuccess = 1,
-    // Table compaction was aborted during marking because the freelist grew to
-    // short.
-    kAbortedDuringMarking = 2,
-  };
-
-  // Handle <-> Table index conversion.
-  inline uint32_t HandleToIndex(ExternalPointerHandle handle) const {
-    uint32_t index = handle >> kExternalPointerIndexShift;
-    DCHECK_EQ(handle & ~kVisitedHandleMarker,
-              index << kExternalPointerIndexShift);
-    DCHECK_LT(index, capacity());
-    return index;
-  }
-
-  inline ExternalPointerHandle IndexToHandle(uint32_t index) const {
-    ExternalPointerHandle handle = index << kExternalPointerIndexShift;
-    DCHECK_EQ(index, handle >> kExternalPointerIndexShift);
-    return handle;
-  }
-
-#ifdef DEBUG
-  inline bool HandleWasVisitedDuringMarking(ExternalPointerHandle handle) {
-    return (handle & kVisitedHandleMarker) == kVisitedHandleMarker;
-  }
-#endif  // DEBUG
-
-  //
-  // Entries of an ExternalPointerTable.
-  //
-  class Entry {
-   public:
-    // Construct a null entry.
-    Entry() : value_(kNullAddress) {}
-
-    // Returns the payload of this entry. If the provided tag does not match
-    // the tag of the entry, the returned pointer cannot be dereferenced as
-    // some of its top bits will be set.
-    Address Untag(ExternalPointerTag tag) { return value_ & ~tag; }
-
-    // Return the payload of this entry without performing a tag check. The
-    // caller must ensure that the pointer is not used in an unsafe way.
-    Address UncheckedUntag() { return value_ & ~kExternalPointerTagMask; }
-
-    // Returns true if this entry is tagged with the given tag.
-    bool HasTag(ExternalPointerTag tag) const {
-      return (value_ & kExternalPointerTagMask) == tag;
-    }
-
-    // Check, set, and clear the marking bit of this entry.
-    bool IsMarked() const { return (value_ & kExternalPointerMarkBit) != 0; }
-    void SetMarkBit() { value_ |= kExternalPointerMarkBit; }
-    void ClearMarkBit() { value_ &= ~kExternalPointerMarkBit; }
-
-    // Returns true if this entry is part of the freelist.
-    bool IsFreelistEntry() const {
-      return HasTag(kExternalPointerFreeEntryTag);
-    }
-
-    // Returns true if this is a evacuation entry, in which case
-    // ExtractHandleLocation may be used.
-    bool IsEvacuationEntry() const {
-      return HasTag(kExternalPointerEvacuationEntryTag);
-    }
-
-    // Returns true if this is neither a freelist- nor an evacuation entry.
-    bool IsRegularEntry() const {
-      return !IsFreelistEntry() && !IsEvacuationEntry();
-    }
-
-    // Extract the index of the next entry on the freelist. This method may be
-    // called even when the entry is not a freelist entry. However, the result
-    // is only valid if this is a freelist entry. This behaviour is required
-    // for efficient entry allocation, see TryAllocateEntryFromFreelist.
-    uint32_t ExtractNextFreelistEntry() const {
-      return static_cast<uint32_t>(value_);
-    }
-
-    // An evacuation entry contains the address of the Handle to a (regular)
-    // entry that is to be evacuated (into this entry). This method extracts
-    // that address. Must only be called if this is an evacuation entry.
-    Address ExtractHandleLocation() {
-      DCHECK(IsEvacuationEntry());
-      return Untag(kExternalPointerEvacuationEntryTag);
-    }
-
-    // Constructs an entry containing all zeroes.
-    static Entry MakeNullEntry() { return Entry(kNullAddress); }
-
-    // Constructs a regular entry by tagging the pointer with the tag.
-    static Entry MakeRegularEntry(Address value, ExternalPointerTag tag) {
-      DCHECK_NE(tag, kExternalPointerFreeEntryTag);
-      DCHECK_NE(tag, kExternalPointerEvacuationEntryTag);
-      return Entry(value | tag);
-    }
-
-    // Constructs a freelist entry given the current freelist head and size.
-    static Entry MakeFreelistEntry(uint32_t next_freelist_entry) {
-      // The next freelist entry is stored in the lower bits of the entry.
-      static_assert(kMaxExternalPointers < (1ULL << kExternalPointerTagShift));
-      DCHECK_LT(next_freelist_entry, kMaxExternalPointers);
-      return Entry(next_freelist_entry | kExternalPointerFreeEntryTag);
-    }
-
-    // Constructs an evacuation entry containing the given handle location.
-    static Entry MakeEvacuationEntry(Address handle_location) {
-      return Entry(handle_location | kExternalPointerEvacuationEntryTag);
-    }
-
-    // Encodes this entry into a pointer-sized word for storing it in the
-    // external pointer table.
-    Address Encode() const { return value_; }
-
-    // Decodes a previously encoded entry.
-    static Entry Decode(Address value) { return Entry(value); }
-
-    bool operator==(Entry other) const { return value_ == other.value_; }
-    bool operator!=(Entry other) const { return value_ != other.value_; }
-
-   private:
-    explicit Entry(Address value) : value_(value) {}
-
-    // The raw content of an entry. The top bits will contain the tag and
-    // marking bit, the lower bits contain the pointer payload. Refer to the
-    // ExternalPointerTag and kExternalPointerMarkBit definitions to see which
-    // bits are used for what purpose.
-    Address value_;
+    // Outcome 1, partial success, is no longer supported.
+    // Table compaction was aborted because the freelist grew to short.
+    kAborted = 2,
   };
-
-  //
-  // Low-level entry accessors.
-  //
-  // Computes the address of the specified entry.
-  inline Address entry_address(uint32_t index) const {
-    return buffer_ + index * sizeof(Address);
-  }
-
-  // When LeakSanitizer is enabled, this method will write the untagged (raw)
-  // pointer into the shadow table (located after the real table) at the given
-  // index. This is necessary because LSan is unable to scan the pointers in
-  // the main table due to the pointer tagging scheme (the values don't "look
-  // like" pointers). So instead it can scan the pointers in the shadow table.
-  // This only works because the payload part of an external pointer is only
-  // modified on one thread (but e.g. the marking bit may be modified from
-  // background threads). Otherwise this would always be racy as the Store
-  // methods below are no longer atomic.
-  inline void RecordEntryForLSan(uint32_t index, Entry entry) {
-#if defined(LEAK_SANITIZER)
-    auto addr = entry_address(index) + kExternalPointerTableReservationSize;
-    base::Memory<Address>(addr) = entry.UncheckedUntag();
-#endif  // LEAK_SANITIZER
-  }
-
-  // Loads the entry at the given index. This method is non-atomic, only use it
-  // when no other threads can currently access the table.
-  Entry Load(uint32_t index) const {
-    auto raw_value = base::Memory<Address>(entry_address(index));
-    return Entry::Decode(raw_value);
-  }
-
-  // Stores the provided entry at the given index. This method is non-atomic,
-  // only use it when no other threads can currently access the table.
-  void Store(uint32_t index, Entry entry) {
-    RecordEntryForLSan(index, entry);
-    base::Memory<Address>(entry_address(index)) = entry.Encode();
-  }
-
-  // Atomically loads the entry at the given index.
-  Entry RelaxedLoad(uint32_t index) const {
-    auto addr = reinterpret_cast<base::Atomic64*>(entry_address(index));
-    auto raw_value = base::Relaxed_Load(addr);
-    return Entry::Decode(raw_value);
-  }
-
-  // Atomically stores the provided entry at the given index.
-  void RelaxedStore(uint32_t index, Entry entry) {
-    RecordEntryForLSan(index, entry);
-    auto addr = reinterpret_cast<base::Atomic64*>(entry_address(index));
-    base::Relaxed_Store(addr, entry.Encode());
-  }
-
-  Entry RelaxedCompareAndSwap(uint32_t index, Entry old_entry,
-                              Entry new_entry) {
-    // This is not calling RecordEntryForLSan as that would be racy. This is ok
-    // however because this this method is only used to set the marking bit.
-    auto addr = reinterpret_cast<base::Atomic64*>(entry_address(index));
-    auto raw_value = base::Relaxed_CompareAndSwap(addr, old_entry.Encode(),
-                                                  new_entry.Encode());
-    return Entry::Decode(raw_value);
-  }
-
-  // Atomically exchanges the entry at the given index with the provided entry.
-  Entry RelaxedExchange(uint32_t index, Entry entry) {
-    RecordEntryForLSan(index, entry);
-    auto addr = reinterpret_cast<base::Atomic64*>(entry_address(index));
-    auto raw_value = base::Relaxed_AtomicExchange(addr, entry.Encode());
-    return Entry::Decode(raw_value);
-  }
-
-  //
-  // ExternalPointerTable fields.
-  //
-  // The buffer backing this table. Essentially an array of Entry instances.
-  // This is const after initialization. Should only be accessed using the
-  // Load() and Store() methods, which take care of atomicicy if necessary.
-  Address buffer_ = kNullAddress;
-
-  // The current capacity of this table, which is the number of usable entries.
-  base::Atomic32 capacity_ = 0;
-
-  // When compacting the table, this value contains the index of the first
-  // entry in the evacuation area. The evacuation area is the region at the end
-  // of the table from which entries are moved out of so that the underyling
-  // memory pages can be freed after sweeping.
-  // This field can have the following values:
-  // - kNotCompactingMarker: compaction is not currently running.
-  // - A kEntriesPerBlock aligned value within (0, capacity): table compaction
-  //   is running and all entries after this value should be evacuated.
-  // - A value that has kCompactionAbortedMarker in its top bits: table
-  //   compaction has been aborted during marking. The original start of the
-  //   evacuation area is still contained in the lower bits.
-  // This field must be accessed atomically as it may be written to from
-  // background threads during GC marking (for example to abort compaction).
-  base::Atomic32 start_of_evacuation_area_ = kNotCompactingMarker;
-
-  // The freelist used by this table.
-  // This field stores an (encoded) Freelist struct, i.e. the index of the
-  // current head of the freelist and the current size of the freelist. These
-  // two values need to be updated together (in a single atomic word) so they
-  // stay correctly synchronized when entries are allocated from the freelist
-  // from multiple threads.
-  base::Atomic64 freelist_ = 0;
-
-  // Lock protecting the slow path for entry allocation, in particular Grow().
-  // As the size of this structure must be predictable (it's part of
-  // IsolateData), it cannot directly contain a Mutex and so instead contains a
-  // pointer to one.
-  base::Mutex* mutex_ = nullptr;
 };
 
+static_assert(sizeof(ExternalPointerTable) == ExternalPointerTable::kSize);
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/sandbox/external-pointer.h b/deps/v8/src/sandbox/external-pointer.h
index 24ddda6d3825ef..2a8c5948f3ea72 100644
--- a/deps/v8/src/sandbox/external-pointer.h
+++ b/deps/v8/src/sandbox/external-pointer.h
@@ -10,9 +10,6 @@
 namespace v8 {
 namespace internal {
 
-constexpr ExternalPointer_t kNullExternalPointer = 0;
-constexpr ExternalPointerHandle kNullExternalPointerHandle = 0;
-
 // Creates and initializes an entry in the external pointer table and writes the
 // handle for that entry to the field.
 template <ExternalPointerTag tag>
@@ -22,6 +19,11 @@ V8_INLINE void InitExternalPointerField(Address field_address, Isolate* isolate,
 // If the sandbox is enabled: reads the ExternalPointerHandle from the field and
 // loads the corresponding external pointer from the external pointer table. If
 // the sandbox is disabled: load the external pointer from the field.
+//
+// This can be used for both regular and lazily-initialized external pointer
+// fields since lazily-initialized field will initially contain
+// kNullExternalPointerHandle, which is guaranteed to result in kNullAddress
+// being returned from the external pointer table.
 template <ExternalPointerTag tag>
 V8_INLINE Address ReadExternalPointerField(Address field_address,
                                            const Isolate* isolate);
@@ -34,7 +36,7 @@ template <ExternalPointerTag tag>
 V8_INLINE void WriteExternalPointerField(Address field_address,
                                          Isolate* isolate, Address value);
 
-// Writes and possibly initialized a lazily initialized external pointer field.
+// Writes and possibly initializes a lazily-initialized external pointer field.
 // When the sandbox is enabled, a lazily initialized external pointer field
 // initially contains the kNullExternalPointerHandle and will only be properly
 // initialized (i.e. allocate an entry in the external pointer table) once a
@@ -45,6 +47,14 @@ V8_INLINE void WriteLazilyInitializedExternalPointerField(Address field_address,
                                                           Isolate* isolate,
                                                           Address value);
 
+// Resets a lazily-initialized external pointer field. Afterwards, it is
+// guaranteed that reading the pointer stored in this field will return
+// kNullAddress. If the sandbox is enabled, this will replace the handle with
+// the kNullExternalPointerHandle, otherwise it will simply write kNullAddress
+// to the slot.
+V8_INLINE void ResetLazilyInitializedExternalPointerField(
+    Address field_address);
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/sandbox/indirect-pointer-inl.h b/deps/v8/src/sandbox/indirect-pointer-inl.h
new file mode 100644
index 00000000000000..736ae48ba7acb9
--- /dev/null
+++ b/deps/v8/src/sandbox/indirect-pointer-inl.h
@@ -0,0 +1,35 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SANDBOX_INDIRECT_POINTER_INL_H_
+#define V8_SANDBOX_INDIRECT_POINTER_INL_H_
+
+#include "include/v8-internal.h"
+#include "src/base/atomic-utils.h"
+#include "src/execution/isolate.h"
+#include "src/sandbox/code-pointer-table-inl.h"
+#include "src/sandbox/code-pointer.h"
+
+namespace v8 {
+namespace internal {
+
+V8_INLINE Tagged<Object> ReadIndirectPointerField(Address field_address) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+  // Here we assume that the load from the table cannot be reordered before the
+  // load of the code object pointer due to the data dependency between the two
+  // loads and therefore use relaxed memory ordering, but technically we should
+  // use memory_order_consume here.
+  auto location = reinterpret_cast<IndirectPointerHandle*>(field_address);
+  IndirectPointerHandle handle = base::AsAtomic32::Relaxed_Load(location);
+  static_assert(kAllIndirectPointerObjectsAreCode);
+  return Object(GetProcessWideCodePointerTable()->GetCodeObject(handle));
+#else
+  UNREACHABLE();
+#endif  // V8_CODE_POINTER_SANDBOXING
+}
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_SANDBOX_INDIRECT_POINTER_INL_H_
diff --git a/deps/v8/src/sandbox/indirect-pointer.h b/deps/v8/src/sandbox/indirect-pointer.h
new file mode 100644
index 00000000000000..daf74d0ab73f69
--- /dev/null
+++ b/deps/v8/src/sandbox/indirect-pointer.h
@@ -0,0 +1,29 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SANDBOX_INDIRECT_POINTER_H_
+#define V8_SANDBOX_INDIRECT_POINTER_H_
+
+#include "src/common/globals.h"
+
+namespace v8 {
+namespace internal {
+
+// Reads the IndirectPointerHandle from the field and loads the Object
+// referenced by this handle from the pointer table. Currently, only Code
+// objects are referenced through indirect pointers, so this function will
+// always use the code pointer table. If we ever have multiple tables for
+// storing indirect pointers, then the table identifier could be passed as a
+// template parameter, or the table itself could be provided as a through a
+// (regular) parameter. Alternatively, if only Code objects use the code
+// pointer table, and all other indirectly-referenced objects use another
+// table, then we might want to move the function to load a Code object into
+// code-pointer.h instead.
+// Only available when the sandbox is enabled.
+V8_INLINE Object ReadIndirectPointerField(Address field_address);
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_SANDBOX_INDIRECT_POINTER_H_
diff --git a/deps/v8/src/sandbox/testing.cc b/deps/v8/src/sandbox/testing.cc
index fead4aa222ceb8..49d4ddf870d892 100644
--- a/deps/v8/src/sandbox/testing.cc
+++ b/deps/v8/src/sandbox/testing.cc
@@ -16,6 +16,7 @@
 
 #ifdef V8_OS_LINUX
 #include <signal.h>
+#include <sys/mman.h>
 #include <unistd.h>
 #endif  // V8_OS_LINUX
 
@@ -29,25 +30,27 @@ namespace internal {
 namespace {
 
 // Sandbox.byteLength
-void SandboxGetByteLength(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void SandboxGetByteLength(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   double sandbox_size = GetProcessWideSandbox()->size();
-  args.GetReturnValue().Set(v8::Number::New(isolate, sandbox_size));
+  info.GetReturnValue().Set(v8::Number::New(isolate, sandbox_size));
 }
 
-// new Sandbox.MemoryView(args) -> Sandbox.MemoryView
-void SandboxMemoryView(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+// new Sandbox.MemoryView(info) -> Sandbox.MemoryView
+void SandboxMemoryView(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   Local<v8::Context> context = isolate->GetCurrentContext();
 
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     isolate->ThrowError("Sandbox.MemoryView must be invoked with 'new'");
     return;
   }
 
   Local<v8::Integer> arg1, arg2;
-  if (!args[0]->ToInteger(context).ToLocal(&arg1) ||
-      !args[1]->ToInteger(context).ToLocal(&arg2)) {
+  if (!info[0]->ToInteger(context).ToLocal(&arg1) ||
+      !info[1]->ToInteger(context).ToLocal(&arg2)) {
     isolate->ThrowError("Expects two number arguments (start offset and size)");
     return;
   }
@@ -73,48 +76,199 @@ void SandboxMemoryView(const v8::FunctionCallbackInfo<v8::Value>& args) {
     return;
   }
   Handle<JSArrayBuffer> buffer = factory->NewJSArrayBuffer(std::move(memory));
-  args.GetReturnValue().Set(Utils::ToLocal(buffer));
+  info.GetReturnValue().Set(Utils::ToLocal(buffer));
 }
 
-// Sandbox.getAddressOf(object) -> Number
-void SandboxGetAddressOf(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+// The methods below either take a HeapObject or the address of a HeapObject as
+// argument. These helper functions can be used to extract the argument object
+// in both cases.
+using ArgumentObjectExtractorFunction = std::function<bool(
+    const v8::FunctionCallbackInfo<v8::Value>&, Tagged<HeapObject>* out)>;
 
-  if (args.Length() == 0) {
+static bool GetArgumentObjectPassedAsReference(
+    const v8::FunctionCallbackInfo<v8::Value>& info, Tagged<HeapObject>* out) {
+  v8::Isolate* isolate = info.GetIsolate();
+
+  if (info.Length() == 0) {
     isolate->ThrowError("First argument must be provided");
-    return;
+    return false;
   }
 
-  Handle<Object> arg = Utils::OpenHandle(*args[0]);
-  if (!arg->IsHeapObject()) {
+  Handle<Object> arg = Utils::OpenHandle(*info[0]);
+  if (!IsHeapObject(*arg)) {
     isolate->ThrowError("First argument must be a HeapObject");
+    return false;
+  }
+
+  *out = HeapObject::cast(*arg);
+  return true;
+}
+
+static bool GetArgumentObjectPassedAsAddress(
+    const v8::FunctionCallbackInfo<v8::Value>& info, Tagged<HeapObject>* out) {
+  Sandbox* sandbox = GetProcessWideSandbox();
+  v8::Isolate* isolate = info.GetIsolate();
+  Local<v8::Context> context = isolate->GetCurrentContext();
+
+  if (info.Length() == 0) {
+    isolate->ThrowError("First argument must be provided");
+    return false;
+  }
+
+  Local<v8::Uint32> arg1;
+  if (!info[0]->ToUint32(context).ToLocal(&arg1)) {
+    isolate->ThrowError("First argument must be the address of a HeapObject");
+    return false;
+  }
+
+  uint32_t address = arg1->Value();
+  // Allow tagged addresses by removing the kHeapObjectTag and
+  // kWeakHeapObjectTag. This allows clients to just read tagged pointers from
+  // the heap and use them for these APIs.
+  address &= ~kHeapObjectTagMask;
+  *out = HeapObject::FromAddress(sandbox->base() + address);
+  return true;
+}
+
+// Sandbox.getAddressOf(Object) -> Number
+void SandboxGetAddressOf(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
+
+  Tagged<HeapObject> obj;
+  if (!GetArgumentObjectPassedAsReference(info, &obj)) {
     return;
   }
 
   // HeapObjects must be allocated inside the pointer compression cage so their
   // address relative to the start of the sandbox can be obtained simply by
   // taking the lowest 32 bits of the absolute address.
-  uint32_t address = static_cast<uint32_t>(HeapObject::cast(*arg).address());
-  args.GetReturnValue().Set(v8::Integer::NewFromUnsigned(isolate, address));
+  uint32_t address = static_cast<uint32_t>(obj->address());
+  info.GetReturnValue().Set(v8::Integer::NewFromUnsigned(isolate, address));
 }
 
-// Sandbox.getSizeOf(object) -> Number
-void SandboxGetSizeOf(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+// Sandbox.getObjectAt(Number) -> Object
+void SandboxGetObjectAt(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
 
-  if (args.Length() == 0) {
-    isolate->ThrowError("First argument must be provided");
+  Tagged<HeapObject> obj;
+  if (!GetArgumentObjectPassedAsAddress(info, &obj)) {
     return;
   }
 
-  Handle<Object> arg = Utils::OpenHandle(*args[0]);
-  if (!arg->IsHeapObject()) {
-    isolate->ThrowError("First argument must be a HeapObject");
+  Isolate* i_isolate = reinterpret_cast<Isolate*>(isolate);
+  Handle<Object> handle(obj, i_isolate);
+  info.GetReturnValue().Set(ToApiHandle<v8::Value>(handle));
+}
+
+// Sandbox.isValidObjectAt(Address) -> Bool
+void SandboxIsValidObjectAt(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
+
+  Tagged<HeapObject> obj;
+  if (!GetArgumentObjectPassedAsAddress(info, &obj)) {
+    return;
+  }
+
+  Heap* heap = reinterpret_cast<Isolate*>(isolate)->heap();
+  auto IsLocatedInMappedMemory = [&](Tagged<HeapObject> obj) {
+    // Note that IsOutsideAllocatedSpace is imprecise and may return false for
+    // some addresses outside the allocated space. However, it's probably good
+    // enough for our purposes.
+    return !heap->memory_allocator()->IsOutsideAllocatedSpace(obj.address());
+  };
+
+  bool is_valid = false;
+  if (IsLocatedInMappedMemory(obj)) {
+    Tagged<Map> map = obj->map();
+    if (IsLocatedInMappedMemory(map)) {
+      is_valid = IsMap(map);
+    }
+  }
+
+  info.GetReturnValue().Set(is_valid);
+}
+
+static void SandboxIsWritableImpl(
+    const v8::FunctionCallbackInfo<v8::Value>& info,
+    ArgumentObjectExtractorFunction getArgumentObject) {
+  DCHECK(ValidateCallbackInfo(info));
+
+  Tagged<HeapObject> obj;
+  if (!getArgumentObject(info, &obj)) {
+    return;
+  }
+
+  BasicMemoryChunk* chunk = BasicMemoryChunk::FromHeapObject(obj);
+  bool is_writable = chunk->IsWritable();
+  info.GetReturnValue().Set(is_writable);
+}
+
+// Sandbox.isWritable(Object) -> Bool
+void SandboxIsWritable(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  SandboxIsWritableImpl(info, &GetArgumentObjectPassedAsReference);
+}
+
+// Sandbox.isWritableObjectAt(Number) -> Bool
+void SandboxIsWritableObjectAt(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  SandboxIsWritableImpl(info, &GetArgumentObjectPassedAsAddress);
+}
+
+static void SandboxGetSizeOfImpl(
+    const v8::FunctionCallbackInfo<v8::Value>& info,
+    ArgumentObjectExtractorFunction getArgumentObject) {
+  DCHECK(ValidateCallbackInfo(info));
+
+  Tagged<HeapObject> obj;
+  if (!getArgumentObject(info, &obj)) {
+    return;
+  }
+
+  int size = obj->Size();
+  info.GetReturnValue().Set(size);
+}
+
+// Sandbox.getSizeOf(Object) -> Number
+void SandboxGetSizeOf(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  SandboxGetSizeOfImpl(info, &GetArgumentObjectPassedAsReference);
+}
+
+// Sandbox.getSizeOfObjectAt(Number) -> Number
+void SandboxGetSizeOfObjectAt(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  SandboxGetSizeOfImpl(info, &GetArgumentObjectPassedAsAddress);
+}
+
+static void SandboxGetInstanceTypeOfImpl(
+    const v8::FunctionCallbackInfo<v8::Value>& info,
+    ArgumentObjectExtractorFunction getArgumentObject) {
+  DCHECK(ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
+
+  Tagged<HeapObject> obj;
+  if (!getArgumentObject(info, &obj)) {
     return;
   }
 
-  int size = HeapObject::cast(*arg).Size();
-  args.GetReturnValue().Set(v8::Integer::New(isolate, size));
+  InstanceType type = obj->map()->instance_type();
+  std::stringstream out;
+  out << type;
+  MaybeLocal<v8::String> result =
+      v8::String::NewFromUtf8(isolate, out.str().c_str());
+  info.GetReturnValue().Set(result.ToLocalChecked());
+}
+
+// Sandbox.getInstanceTypeOf(Object) -> String
+void SandboxGetInstanceTypeOf(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  SandboxGetInstanceTypeOfImpl(info, &GetArgumentObjectPassedAsReference);
+}
+
+// Sandbox.getInstanceTypeOfObjectAt(Number) -> String
+void SandboxGetInstanceTypeOfObjectAt(
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  SandboxGetInstanceTypeOfImpl(info, &GetArgumentObjectPassedAsAddress);
 }
 
 Handle<FunctionTemplateInfo> NewFunctionTemplate(
@@ -135,7 +289,7 @@ Handle<JSFunction> CreateFunc(Isolate* isolate, FunctionCallback func,
                                                  : ConstructorBehavior::kThrow;
   Handle<FunctionTemplateInfo> function_template =
       NewFunctionTemplate(isolate, func, constructor_behavior);
-  return ApiNatives::InstantiateFunction(function_template, name)
+  return ApiNatives::InstantiateFunction(isolate, function_template, name)
       .ToHandleChecked();
 }
 
@@ -146,7 +300,7 @@ void InstallFunc(Isolate* isolate, Handle<JSObject> holder,
   Handle<String> function_name = factory->NewStringFromAsciiChecked(name);
   Handle<JSFunction> function =
       CreateFunc(isolate, func, function_name, is_constructor);
-  function->shared().set_length(num_parameters);
+  function->shared()->set_length(num_parameters);
   JSObject::AddProperty(isolate, holder, function_name, function, NONE);
 }
 
@@ -156,7 +310,8 @@ void InstallGetter(Isolate* isolate, Handle<JSObject> object,
   Handle<String> property_name = factory->NewStringFromAsciiChecked(name);
   Handle<JSFunction> getter = CreateFunc(isolate, func, property_name, false);
   Handle<Object> setter = factory->null_value();
-  JSObject::DefineAccessor(object, property_name, getter, setter, FROZEN);
+  JSObject::DefineOwnAccessorIgnoreAttributes(object, property_name, getter,
+                                              setter, FROZEN);
 }
 
 void InstallFunction(Isolate* isolate, Handle<JSObject> holder,
@@ -191,7 +346,19 @@ void SandboxTesting::InstallMemoryCorruptionApi(Isolate* isolate) {
   InstallGetter(isolate, sandbox, SandboxGetByteLength, "byteLength");
   InstallConstructor(isolate, sandbox, SandboxMemoryView, "MemoryView", 2);
   InstallFunction(isolate, sandbox, SandboxGetAddressOf, "getAddressOf", 1);
+  InstallFunction(isolate, sandbox, SandboxGetObjectAt, "getObjectAt", 1);
+  InstallFunction(isolate, sandbox, SandboxIsValidObjectAt, "isValidObjectAt",
+                  1);
+  InstallFunction(isolate, sandbox, SandboxIsWritable, "isWritable", 1);
+  InstallFunction(isolate, sandbox, SandboxIsWritableObjectAt,
+                  "isWritableObjectAt", 1);
   InstallFunction(isolate, sandbox, SandboxGetSizeOf, "getSizeOf", 1);
+  InstallFunction(isolate, sandbox, SandboxGetSizeOfObjectAt,
+                  "getSizeOfObjectAt", 1);
+  InstallFunction(isolate, sandbox, SandboxGetInstanceTypeOf,
+                  "getInstanceTypeOf", 1);
+  InstallFunction(isolate, sandbox, SandboxGetInstanceTypeOfObjectAt,
+                  "getInstanceTypeOfObjectAt", 1);
 
   // Install the Sandbox object as property on the global object.
   Handle<JSGlobalObject> global = isolate->global_object();
@@ -215,7 +382,8 @@ void PrintToStderr(const char* output) {
 // outside of the sandbox address space. If inside, the signal is ignored and
 // the process terminated normally, in the latter case the original signal
 // handler is restored and the signal delivered again.
-struct sigaction g_old_sigbus_handler, g_old_sigsegv_handler;
+struct sigaction g_old_sigabrt_handler, g_old_sigtrap_handler,
+    g_old_sigbus_handler, g_old_sigsegv_handler;
 void SandboxSignalHandler(int signal, siginfo_t* info, void* void_context) {
   // NOTE: This code MUST be async-signal safe.
   // NO malloc or stdio is allowed here.
@@ -226,6 +394,12 @@ void SandboxSignalHandler(int signal, siginfo_t* info, void* void_context) {
     _exit(0);
   }
 
+  if (signal == SIGTRAP) {
+    // Similarly, SIGTRAP probably indicates UNREACHABLE code.
+    PrintToStderr("Caught harmless signal (SIGTRAP). Exiting process...\n");
+    _exit(0);
+  }
+
   Address faultaddr = reinterpret_cast<Address>(info->si_addr);
 
   if (GetProcessWideSandbox()->Contains(faultaddr)) {
@@ -249,8 +423,19 @@ void SandboxSignalHandler(int signal, siginfo_t* info, void* void_context) {
     _exit(0);
   }
 
+  if (faultaddr >= 0x8000'0000'0000'0000ULL) {
+    // On Linux, it appears that the kernel will still report valid (i.e.
+    // canonical) kernel space addresses via the si_addr field, so we need to
+    // handle these separately. We've already filtered out non-canonical
+    // addresses above, so here we can just test if the most-significant bit of
+    // the address is set, and if so assume that it's a kernel address.
+    PrintToStderr(
+        "Caught harmless memory access violatation (kernel space address). "
+        "Exiting process...\n");
+    _exit(0);
+  }
+
   if (faultaddr < 0x1000) {
-    printf("Faultaddr: 0x%lx\n", faultaddr);
     // Nullptr dereferences are harmless as nothing can be mapped there. We use
     // the typical page size (which is also the default value of mmap_min_addr
     // on Linux) to determine what counts as a nullptr dereference here.
@@ -260,6 +445,15 @@ void SandboxSignalHandler(int signal, siginfo_t* info, void* void_context) {
     _exit(0);
   }
 
+  if (faultaddr < 4ULL * GB) {
+    // Currently we also ignore access violations in the first 4GB of the
+    // virtual address space. See crbug.com/1470641 for more details.
+    PrintToStderr(
+        "Caught harmless memory access violaton (first 4GB of virtual address "
+        "space). Exiting process...\n");
+    _exit(0);
+  }
+
   if (info->si_code == SEGV_ACCERR) {
     // This indicates an access to a (valid) mapping but with insufficient
     // permissions (e.g. accessing a region mapped with PROT_NONE). Some
@@ -275,14 +469,22 @@ void SandboxSignalHandler(int signal, siginfo_t* info, void* void_context) {
     _exit(0);
   }
 
+  // TODO(saelo) also try to detect harmless stack overflows here if possible.
+
   // Otherwise it's a sandbox violation, so restore the original signal
-  // handler, then return from this handler. The faulting instruction will be
+  // handlers, then return from this handler. The faulting instruction will be
   // re-executed and will again trigger the access violation, but now the
   // signal will be handled by the original signal handler.
   //
+  // It's important that we restore all signal handlers here. For example, if
+  // we forward a SIGSEGV to Asan's signal handler, that signal handler may
+  // terminate the process with SIGABRT, which we must then *not* ignore.
+  //
   // Should any of the sigaction calls below ever fail, the default signal
   // handler will be invoked (due to SA_RESETHAND) and will terminate the
   // process, so there's no need to attempt to handle that condition.
+  sigaction(SIGABRT, &g_old_sigabrt_handler, nullptr);
+  sigaction(SIGTRAP, &g_old_sigtrap_handler, nullptr);
   sigaction(SIGBUS, &g_old_sigbus_handler, nullptr);
   sigaction(SIGSEGV, &g_old_sigsegv_handler, nullptr);
 }
@@ -293,14 +495,31 @@ void SandboxSignalHandler(int signal, siginfo_t* info, void* void_context) {
 void SandboxTesting::InstallSandboxCrashFilter() {
   CHECK(GetProcessWideSandbox()->is_initialized());
 #ifdef V8_OS_LINUX
+  // Register an alternate stack for signal delivery so that signal handlers
+  // can run properly even if for example the stack pointer has been corrupted
+  // or the stack has overflowed.
+  // Note that the alternate stack is currently only registered for the main
+  // thread. Stack pointer corruption or stack overflows on background threads
+  // may therefore still cause the signal handler to crash.
+  void* alternate_stack = mmap(nullptr, SIGSTKSZ, PROT_READ | PROT_WRITE,
+                               MAP_ANONYMOUS | MAP_PRIVATE, -1, 0);
+  CHECK_NE(alternate_stack, MAP_FAILED);
+  stack_t signalstack = {
+      .ss_sp = alternate_stack,
+      .ss_flags = 0,
+      .ss_size = static_cast<size_t>(SIGSTKSZ),
+  };
+  CHECK_EQ(sigaltstack(&signalstack, nullptr), 0);
+
   struct sigaction action;
   memset(&action, 0, sizeof(action));
-  action.sa_flags = SA_RESETHAND | SA_SIGINFO;
+  action.sa_flags = SA_RESETHAND | SA_SIGINFO | SA_ONSTACK;
   action.sa_sigaction = &SandboxSignalHandler;
   sigemptyset(&action.sa_mask);
 
   bool success = true;
-  success &= (sigaction(SIGABRT, &action, nullptr) == 0);
+  success &= (sigaction(SIGABRT, &action, &g_old_sigabrt_handler) == 0);
+  success &= (sigaction(SIGTRAP, &action, &g_old_sigtrap_handler) == 0);
   success &= (sigaction(SIGBUS, &action, &g_old_sigbus_handler) == 0);
   success &= (sigaction(SIGSEGV, &action, &g_old_sigsegv_handler) == 0);
   CHECK(success);
diff --git a/deps/v8/src/snapshot/code-serializer.cc b/deps/v8/src/snapshot/code-serializer.cc
index c83e8e4581a607..12f79c6ff35f3b 100644
--- a/deps/v8/src/snapshot/code-serializer.cc
+++ b/deps/v8/src/snapshot/code-serializer.cc
@@ -31,10 +31,10 @@
 namespace v8 {
 namespace internal {
 
-AlignedCachedData::AlignedCachedData(const byte* data, int length)
+AlignedCachedData::AlignedCachedData(const uint8_t* data, int length)
     : owns_data_(false), rejected_(false), data_(data), length_(length) {
   if (!IsAligned(reinterpret_cast<intptr_t>(data), kPointerAlignment)) {
-    byte* copy = NewArray<byte>(length);
+    uint8_t* copy = NewArray<uint8_t>(length);
     DCHECK(IsAligned(reinterpret_cast<intptr_t>(copy), kPointerAlignment));
     CopyBytes(copy, data, length);
     data_ = copy;
@@ -60,7 +60,7 @@ ScriptCompiler::CachedData* CodeSerializer::Serialize(
   Handle<Script> script(Script::cast(info->script()), isolate);
   if (v8_flags.trace_serializer) {
     PrintF("[Serializing from");
-    script->name().ShortPrint();
+    ShortPrint(script->name());
     PrintF("]\n");
   }
 #if V8_ENABLE_WEBASSEMBLY
@@ -107,24 +107,20 @@ AlignedCachedData* CodeSerializer::SerializeSharedFunctionInfo(
   return data.GetScriptData();
 }
 
-void CodeSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
+void CodeSerializer::SerializeObjectImpl(Handle<HeapObject> obj,
+                                         SlotType slot_type) {
   ReadOnlyRoots roots(isolate());
   InstanceType instance_type;
   {
     DisallowGarbageCollection no_gc;
-    HeapObject raw = *obj;
+    Tagged<HeapObject> raw = *obj;
     if (SerializeHotObject(raw)) return;
     if (SerializeRoot(raw)) return;
     if (SerializeBackReference(raw)) return;
     if (SerializeReadOnlyObjectReference(raw, &sink_)) return;
 
-    instance_type = raw.map().instance_type();
+    instance_type = raw->map()->instance_type();
     CHECK(!InstanceTypeChecker::IsInstructionStream(instance_type));
-
-    if (ElideObject(raw)) {
-      AllowGarbageCollection allow_gc;
-      return SerializeObject(roots.undefined_value_handle());
-    }
   }
 
   if (InstanceTypeChecker::IsScript(instance_type)) {
@@ -132,29 +128,29 @@ void CodeSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
     Handle<Object> context_data;
     {
       DisallowGarbageCollection no_gc;
-      Script script_obj = Script::cast(*obj);
-      DCHECK_NE(script_obj.compilation_type(), Script::COMPILATION_TYPE_EVAL);
+      Tagged<Script> script_obj = Script::cast(*obj);
+      DCHECK_NE(script_obj->compilation_type(), Script::CompilationType::kEval);
       // We want to differentiate between undefined and uninitialized_symbol for
       // context_data for now. It is hack to allow debugging for scripts that
       // are included as a part of custom snapshot. (see
       // debug::Script::IsEmbedded())
-      Object raw_context_data = script_obj.context_data();
+      Tagged<Object> raw_context_data = script_obj->context_data();
       if (raw_context_data != roots.undefined_value() &&
           raw_context_data != roots.uninitialized_symbol()) {
-        script_obj.set_context_data(roots.undefined_value());
+        script_obj->set_context_data(roots.undefined_value());
       }
       context_data = handle(raw_context_data, isolate());
       // We don't want to serialize host options to avoid serializing
       // unnecessary object graph.
-      host_options = handle(script_obj.host_defined_options(), isolate());
-      script_obj.set_host_defined_options(roots.empty_fixed_array());
+      host_options = handle(script_obj->host_defined_options(), isolate());
+      script_obj->set_host_defined_options(roots.empty_fixed_array());
     }
-    SerializeGeneric(obj);
+    SerializeGeneric(obj, slot_type);
     {
       DisallowGarbageCollection no_gc;
-      Script script_obj = Script::cast(*obj);
-      script_obj.set_host_defined_options(*host_options);
-      script_obj.set_context_data(*context_data);
+      Tagged<Script> script_obj = Script::cast(*obj);
+      script_obj->set_host_defined_options(*host_options);
+      script_obj->set_context_data(*context_data);
     }
     return;
   } else if (InstanceTypeChecker::IsSharedFunctionInfo(instance_type)) {
@@ -162,35 +158,28 @@ void CodeSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
     bool restore_bytecode = false;
     {
       DisallowGarbageCollection no_gc;
-      SharedFunctionInfo sfi = SharedFunctionInfo::cast(*obj);
-      DCHECK(!sfi.IsApiFunction());
+      Tagged<SharedFunctionInfo> sfi = SharedFunctionInfo::cast(*obj);
+      DCHECK(!sfi->IsApiFunction());
 #if V8_ENABLE_WEBASSEMBLY
       // TODO(7110): Enable serializing of Asm modules once the AsmWasmData
       // is context independent.
-      DCHECK(!sfi.HasAsmWasmData());
+      DCHECK(!sfi->HasAsmWasmData());
 #endif  // V8_ENABLE_WEBASSEMBLY
 
-      if (sfi.HasDebugInfo()) {
+      if (auto maybe_debug_info = sfi->TryGetDebugInfo(isolate())) {
+        debug_info = handle(maybe_debug_info.value(), isolate());
         // Clear debug info.
-        DebugInfo raw_debug_info = sfi.GetDebugInfo();
-        if (raw_debug_info.HasInstrumentedBytecodeArray()) {
+        if (debug_info->HasInstrumentedBytecodeArray()) {
           restore_bytecode = true;
-          sfi.SetActiveBytecodeArray(raw_debug_info.OriginalBytecodeArray());
+          sfi->SetActiveBytecodeArray(debug_info->OriginalBytecodeArray());
         }
-        sfi.set_script_or_debug_info(raw_debug_info.script(), kReleaseStore);
-        debug_info = handle(raw_debug_info, isolate());
       }
-      DCHECK(!sfi.HasDebugInfo());
     }
-    SerializeGeneric(obj);
-    // Restore debug info
-    if (!debug_info.is_null()) {
+    SerializeGeneric(obj, slot_type);
+    if (restore_bytecode) {
       DisallowGarbageCollection no_gc;
-      SharedFunctionInfo sfi = SharedFunctionInfo::cast(*obj);
-      sfi.set_script_or_debug_info(*debug_info, kReleaseStore);
-      if (restore_bytecode) {
-        sfi.SetActiveBytecodeArray(debug_info->DebugBytecodeArray());
-      }
+      Tagged<SharedFunctionInfo> sfi = SharedFunctionInfo::cast(*obj);
+      sfi->SetActiveBytecodeArray(debug_info->DebugBytecodeArray());
     }
     return;
   } else if (InstanceTypeChecker::IsUncompiledDataWithoutPreparseDataWithJob(
@@ -199,7 +188,7 @@ void CodeSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
         Handle<UncompiledDataWithoutPreparseDataWithJob>::cast(obj);
     Address job = data->job();
     data->set_job(kNullAddress);
-    SerializeGeneric(data);
+    SerializeGeneric(data, slot_type);
     data->set_job(job);
     return;
   } else if (InstanceTypeChecker::IsUncompiledDataWithPreparseDataAndJob(
@@ -208,7 +197,7 @@ void CodeSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
         Handle<UncompiledDataWithPreparseDataAndJob>::cast(obj);
     Address job = data->job();
     data->set_job(kNullAddress);
-    SerializeGeneric(data);
+    SerializeGeneric(data, slot_type);
     data->set_job(job);
     return;
   }
@@ -219,8 +208,8 @@ void CodeSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
   // information. On deserialization we'll create our code objects again, if
   // --interpreted-frames-native-stack is on. See v8:9122 for more context
   if (V8_UNLIKELY(v8_flags.interpreted_frames_native_stack) &&
-      obj->IsInterpreterData()) {
-    obj = handle(InterpreterData::cast(*obj).bytecode_array(), isolate());
+      IsInterpreterData(*obj)) {
+    obj = handle(InterpreterData::cast(*obj)->bytecode_array(), isolate());
   }
 
   // Past this point we should not see any (context-specific) maps anymore.
@@ -235,13 +224,14 @@ void CodeSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
   CHECK(!InstanceTypeChecker::IsJSFunction(instance_type) &&
         !InstanceTypeChecker::IsContext(instance_type));
 
-  SerializeGeneric(obj);
+  SerializeGeneric(obj, slot_type);
 }
 
-void CodeSerializer::SerializeGeneric(Handle<HeapObject> heap_object) {
+void CodeSerializer::SerializeGeneric(Handle<HeapObject> heap_object,
+                                      SlotType slot_type) {
   // Object has not yet been serialized.  Serialize it here.
   ObjectSerializer serializer(this, heap_object, &sink_);
-  serializer.Serialize();
+  serializer.Serialize(slot_type);
 }
 
 namespace {
@@ -250,21 +240,25 @@ namespace {
 // to create duplicates of InterpreterEntryTrampoline for the deserialized
 // functions, otherwise we'll call the builtin IET for those functions (which
 // is not what a user of this flag wants).
-void CreateInterpreterDataForDeserializedCode(Isolate* isolate,
-                                              Handle<SharedFunctionInfo> sfi,
-                                              bool log_code_creation) {
-  Handle<Script> script(Script::cast(sfi->script()), isolate);
-  String name = ReadOnlyRoots(isolate).empty_string();
-  if (script->name().IsString()) name = String::cast(script->name());
+void CreateInterpreterDataForDeserializedCode(
+    Isolate* isolate, Handle<SharedFunctionInfo> result_sfi,
+    bool log_code_creation) {
+  DCHECK_IMPLIES(isolate->NeedsSourcePositions(), log_code_creation);
+
+  Handle<Script> script(Script::cast(result_sfi->script()), isolate);
+  if (log_code_creation) Script::InitLineEnds(isolate, script);
+
+  Tagged<String> name = ReadOnlyRoots(isolate).empty_string();
+  if (IsString(script->name())) name = String::cast(script->name());
   Handle<String> name_handle(name, isolate);
 
   SharedFunctionInfo::ScriptIterator iter(isolate, *script);
-  for (SharedFunctionInfo shared_info = iter.Next(); !shared_info.is_null();
-       shared_info = iter.Next()) {
+  for (Tagged<SharedFunctionInfo> shared_info = iter.Next();
+       !shared_info.is_null(); shared_info = iter.Next()) {
     IsCompiledScope is_compiled(shared_info, isolate);
     if (!is_compiled.is_compiled()) continue;
-    DCHECK(shared_info.HasBytecodeArray());
-    Handle<SharedFunctionInfo> info = handle(shared_info, isolate);
+    DCHECK(shared_info->HasBytecodeArray());
+    Handle<SharedFunctionInfo> sfi = handle(shared_info, isolate);
 
     Handle<Code> code =
         Builtins::CreateInterpreterEntryTrampolineForProfiling(isolate);
@@ -273,23 +267,26 @@ void CreateInterpreterDataForDeserializedCode(Isolate* isolate,
         Handle<InterpreterData>::cast(isolate->factory()->NewStruct(
             INTERPRETER_DATA_TYPE, AllocationType::kOld));
 
-    interpreter_data->set_bytecode_array(info->GetBytecodeArray(isolate));
+    interpreter_data->set_bytecode_array(sfi->GetBytecodeArray(isolate));
     interpreter_data->set_interpreter_trampoline(*code);
-    if (info->HasBaselineCode()) {
-      info->baseline_code(kAcquireLoad)
-          .set_bytecode_or_interpreter_data(*interpreter_data);
+    if (sfi->HasBaselineCode()) {
+      sfi->baseline_code(kAcquireLoad)
+          ->set_bytecode_or_interpreter_data(*interpreter_data);
     } else {
-      info->set_interpreter_data(*interpreter_data);
+      sfi->set_interpreter_data(*interpreter_data);
     }
 
     if (!log_code_creation) continue;
+    SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, sfi);
+
     Handle<AbstractCode> abstract_code = Handle<AbstractCode>::cast(code);
-    Script::InitLineEnds(isolate, script);
-    int line_num = script->GetLineNumber(info->StartPosition()) + 1;
-    int column_num = script->GetColumnNumber(info->StartPosition()) + 1;
+    Script::PositionInfo info;
+    Script::GetPositionInfo(script, sfi->StartPosition(), &info);
+    int line_num = info.line_start + 1;
+    int column_num = info.line_end + 1;
     PROFILE(isolate,
             CodeCreateEvent(LogEventListener::CodeTag::kFunction, abstract_code,
-                            info, name_handle, line_num, column_num));
+                            sfi, name_handle, line_num, column_num));
   }
 }
 
@@ -327,81 +324,97 @@ class StressOffThreadDeserializeThread final : public base::Thread {
 void FinalizeDeserialization(Isolate* isolate,
                              Handle<SharedFunctionInfo> result,
                              const base::ElapsedTimer& timer) {
-  const bool log_code_creation =
-      isolate->v8_file_logger()->is_listening_to_code_events() ||
-      isolate->is_profiling() ||
-      isolate->logger()->is_listening_to_code_events();
+  // Devtools can report time in this function as profiler overhead, since none
+  // of the following tasks would need to happen normally.
+  TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.compile"),
+               "V8.FinalizeDeserialization");
+
+  const bool log_code_creation = isolate->IsLoggingCodeCreation();
 
   if (V8_UNLIKELY(v8_flags.interpreted_frames_native_stack)) {
     CreateInterpreterDataForDeserializedCode(isolate, result,
                                              log_code_creation);
   }
 
-  bool needs_source_positions = isolate->NeedsSourcePositionsForProfiling();
-
-  if (log_code_creation || v8_flags.log_function_events) {
-    Handle<Script> script(Script::cast(result->script()), isolate);
-    Handle<String> name(script->name().IsString()
-                            ? String::cast(script->name())
-                            : ReadOnlyRoots(isolate).empty_string(),
-                        isolate);
-
-    if (V8_UNLIKELY(v8_flags.log_function_events)) {
-      LOG(isolate,
-          FunctionEvent("deserialize", script->id(),
-                        timer.Elapsed().InMillisecondsF(),
-                        result->StartPosition(), result->EndPosition(), *name));
-    }
-    if (log_code_creation) {
-      Script::InitLineEnds(isolate, script);
-
-      SharedFunctionInfo::ScriptIterator iter(isolate, *script);
-      for (SharedFunctionInfo info = iter.Next(); !info.is_null();
-           info = iter.Next()) {
-        if (info.is_compiled()) {
-          Handle<SharedFunctionInfo> shared_info(info, isolate);
-          if (needs_source_positions) {
-            SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate,
-                                                               shared_info);
-          }
-          DisallowGarbageCollection no_gc;
-          int line_num =
-              script->GetLineNumber(shared_info->StartPosition()) + 1;
-          int column_num =
-              script->GetColumnNumber(shared_info->StartPosition()) + 1;
-          PROFILE(isolate,
-                  CodeCreateEvent(
-                      shared_info->is_toplevel()
-                          ? LogEventListener::CodeTag::kScript
-                          : LogEventListener::CodeTag::kFunction,
-                      handle(shared_info->abstract_code(isolate), isolate),
-                      shared_info, name, line_num, column_num));
-        }
-      }
-    }
-  }
+  bool needs_source_positions = isolate->NeedsSourcePositions();
+  if (!log_code_creation && !needs_source_positions) return;
 
+  Handle<Script> script(Script::cast(result->script()), isolate);
   if (needs_source_positions) {
-    Handle<Script> script(Script::cast(result->script()), isolate);
     Script::InitLineEnds(isolate, script);
   }
+
+  Handle<String> name(IsString(script->name())
+                          ? Tagged<String>::cast(script->name())
+                          : ReadOnlyRoots(isolate).empty_string(),
+                      isolate);
+
+  if (V8_UNLIKELY(v8_flags.log_function_events)) {
+    LOG(isolate,
+        FunctionEvent("deserialize", script->id(),
+                      timer.Elapsed().InMillisecondsF(),
+                      result->StartPosition(), result->EndPosition(), *name));
+  }
+
+  SharedFunctionInfo::ScriptIterator iter(isolate, *script);
+  for (Tagged<SharedFunctionInfo> info = iter.Next(); !info.is_null();
+       info = iter.Next()) {
+    if (!info->is_compiled()) continue;
+    Handle<SharedFunctionInfo> shared_info(info, isolate);
+    if (needs_source_positions) {
+      SharedFunctionInfo::EnsureSourcePositionsAvailable(isolate, shared_info);
+    }
+    Script::PositionInfo pos_info;
+    Script::GetPositionInfo(script, shared_info->StartPosition(), &pos_info);
+    int line_num = pos_info.line + 1;
+    int column_num = pos_info.column + 1;
+    PROFILE(isolate, CodeCreateEvent(
+                         shared_info->is_toplevel()
+                             ? LogEventListener::CodeTag::kScript
+                             : LogEventListener::CodeTag::kFunction,
+                         handle(shared_info->abstract_code(isolate), isolate),
+                         shared_info, name, line_num, column_num));
+  }
 }
 
-void BaselineBatchCompileIfSparkplugCompiled(Isolate* isolate, Script script) {
+void BaselineBatchCompileIfSparkplugCompiled(Isolate* isolate,
+                                             Tagged<Script> script) {
   // Here is main thread, we trigger early baseline compilation only in
   // concurrent sparkplug and baseline batch compilation mode which consumes
   // little main thread execution time.
   if (v8_flags.concurrent_sparkplug && v8_flags.baseline_batch_compilation) {
     SharedFunctionInfo::ScriptIterator iter(isolate, script);
-    for (SharedFunctionInfo info = iter.Next(); !info.is_null();
+    for (Tagged<SharedFunctionInfo> info = iter.Next(); !info.is_null();
          info = iter.Next()) {
-      if (info.sparkplug_compiled() && CanCompileWithBaseline(isolate, info)) {
+      if (info->sparkplug_compiled() && CanCompileWithBaseline(isolate, info)) {
         isolate->baseline_batch_compiler()->EnqueueSFI(info);
       }
     }
   }
 }
 
+const char* ToString(SerializedCodeSanityCheckResult result) {
+  switch (result) {
+    case SerializedCodeSanityCheckResult::kSuccess:
+      return "success";
+    case SerializedCodeSanityCheckResult::kMagicNumberMismatch:
+      return "magic number mismatch";
+    case SerializedCodeSanityCheckResult::kVersionMismatch:
+      return "version mismatch";
+    case SerializedCodeSanityCheckResult::kSourceMismatch:
+      return "source mismatch";
+    case SerializedCodeSanityCheckResult::kFlagsMismatch:
+      return "flags mismatch";
+    case SerializedCodeSanityCheckResult::kChecksumMismatch:
+      return "checksum mismatch";
+    case SerializedCodeSanityCheckResult::kInvalidHeader:
+      return "invalid header";
+    case SerializedCodeSanityCheckResult::kLengthMismatch:
+      return "length mismatch";
+    case SerializedCodeSanityCheckResult::kReadOnlySnapshotChecksumMismatch:
+      return "read-only snapshot checksum mismatch";
+  }
+}
 }  // namespace
 
 MaybeHandle<SharedFunctionInfo> CodeSerializer::Deserialize(
@@ -417,19 +430,22 @@ MaybeHandle<SharedFunctionInfo> CodeSerializer::Deserialize(
   }
 
   base::ElapsedTimer timer;
-  if (v8_flags.profile_deserialization || v8_flags.log_function_events)
+  if (v8_flags.profile_deserialization || v8_flags.log_function_events) {
     timer.Start();
+  }
 
   HandleScope scope(isolate);
 
   SerializedCodeSanityCheckResult sanity_check_result =
       SerializedCodeSanityCheckResult::kSuccess;
   const SerializedCodeData scd = SerializedCodeData::FromCachedData(
-      cached_data, SerializedCodeData::SourceHash(source, origin_options),
+      isolate, cached_data,
+      SerializedCodeData::SourceHash(source, origin_options),
       &sanity_check_result);
   if (sanity_check_result != SerializedCodeSanityCheckResult::kSuccess) {
-    if (v8_flags.profile_deserialization)
-      PrintF("[Cached code failed check]\n");
+    if (v8_flags.profile_deserialization) {
+      PrintF("[Cached code failed check: %s]\n", ToString(sanity_check_result));
+    }
     DCHECK(cached_data->rejected());
     isolate->counters()->code_cache_reject_reason()->AddSample(
         static_cast<int>(sanity_check_result));
@@ -503,7 +519,7 @@ CodeSerializer::StartDeserializeOffThread(LocalIsolate* local_isolate,
 
   const SerializedCodeData scd =
       SerializedCodeData::FromCachedDataWithoutSource(
-          cached_data, &result.sanity_check_result);
+          local_isolate, cached_data, &result.sanity_check_result);
   if (result.sanity_check_result != SerializedCodeSanityCheckResult::kSuccess) {
     // Exit early but don't report yet, we'll re-check this when finishing on
     // the main thread
@@ -528,8 +544,9 @@ MaybeHandle<SharedFunctionInfo> CodeSerializer::FinishOffThreadDeserialize(
     ScriptOriginOptions origin_options,
     BackgroundMergeTask* background_merge_task) {
   base::ElapsedTimer timer;
-  if (v8_flags.profile_deserialization || v8_flags.log_function_events)
+  if (v8_flags.profile_deserialization || v8_flags.log_function_events) {
     timer.Start();
+  }
 
   HandleScope scope(isolate);
 
@@ -554,8 +571,9 @@ MaybeHandle<SharedFunctionInfo> CodeSerializer::FinishOffThreadDeserialize(
     DCHECK_IMPLIES(sanity_check_result != data.sanity_check_result,
                    sanity_check_result ==
                        SerializedCodeSanityCheckResult::kSourceMismatch);
-    if (v8_flags.profile_deserialization)
-      PrintF("[Cached code failed check]\n");
+    if (v8_flags.profile_deserialization) {
+      PrintF("[Cached code failed check: %s]\n", ToString(sanity_check_result));
+    }
     DCHECK(cached_data->rejected());
     isolate->counters()->code_cache_reject_reason()->AddSample(
         static_cast<int>(sanity_check_result));
@@ -579,18 +597,19 @@ MaybeHandle<SharedFunctionInfo> CodeSerializer::FinishOffThreadDeserialize(
       background_merge_task->HasPendingForegroundWork()) {
     Handle<Script> script = handle(Script::cast(result->script()), isolate);
     result = background_merge_task->CompleteMergeInForeground(isolate, script);
-    DCHECK(Script::cast(result->script()).source().StrictEquals(*source));
+    DCHECK(Object::StrictEquals(Script::cast(result->script())->source(),
+                                *source));
     DCHECK(isolate->factory()->script_list()->Contains(
         MaybeObject::MakeWeak(MaybeObject::FromObject(result->script()))));
   } else {
+    Handle<Script> script(Script::cast(result->script()), isolate);
     // Fix up the source on the script. This should be the only deserialized
     // script, and the off-thread deserializer should have set its source to
     // the empty string.
     DCHECK_EQ(data.scripts.size(), 1);
-    DCHECK_EQ(result->script(), *data.scripts[0]);
-    DCHECK_EQ(Script::cast(result->script()).source(),
-              ReadOnlyRoots(isolate).empty_string());
-    Script::cast(result->script()).set_source(*source);
+    DCHECK_EQ(*script, *data.scripts[0]);
+    DCHECK_EQ(script->source(), ReadOnlyRoots(isolate).empty_string());
+    Script::SetSource(isolate, script, source);
 
     // Fix up the script list to include the newly deserialized script.
     Handle<WeakArrayList> list = isolate->factory()->script_list();
@@ -618,7 +637,7 @@ MaybeHandle<SharedFunctionInfo> CodeSerializer::FinishOffThreadDeserialize(
   return scope.CloseAndEscape(result);
 }
 
-SerializedCodeData::SerializedCodeData(const std::vector<byte>* payload,
+SerializedCodeData::SerializedCodeData(const std::vector<uint8_t>* payload,
                                        const CodeSerializer* cs) {
   DisallowGarbageCollection no_gc;
 
@@ -637,6 +656,9 @@ SerializedCodeData::SerializedCodeData(const std::vector<byte>* payload,
   SetHeaderValue(kVersionHashOffset, Version::Hash());
   SetHeaderValue(kSourceHashOffset, cs->source_hash());
   SetHeaderValue(kFlagHashOffset, FlagList::Hash());
+  SetHeaderValue(kReadOnlySnapshotChecksumOffset,
+                 Snapshot::ExtractReadOnlySnapshotChecksum(
+                     cs->isolate()->snapshot_blob()));
   SetHeaderValue(kPayloadLengthOffset, static_cast<uint32_t>(payload->size()));
 
   // Zero out any padding in the header.
@@ -651,8 +673,10 @@ SerializedCodeData::SerializedCodeData(const std::vector<byte>* payload,
 }
 
 SerializedCodeSanityCheckResult SerializedCodeData::SanityCheck(
+    uint32_t expected_ro_snapshot_checksum,
     uint32_t expected_source_hash) const {
-  SerializedCodeSanityCheckResult result = SanityCheckWithoutSource();
+  SerializedCodeSanityCheckResult result =
+      SanityCheckWithoutSource(expected_ro_snapshot_checksum);
   if (result != SerializedCodeSanityCheckResult::kSuccess) return result;
   return SanityCheckJustSource(expected_source_hash);
 }
@@ -666,9 +690,9 @@ SerializedCodeSanityCheckResult SerializedCodeData::SanityCheckJustSource(
   return SerializedCodeSanityCheckResult::kSuccess;
 }
 
-SerializedCodeSanityCheckResult SerializedCodeData::SanityCheckWithoutSource()
-    const {
-  if (this->size_ < kHeaderSize) {
+SerializedCodeSanityCheckResult SerializedCodeData::SanityCheckWithoutSource(
+    uint32_t expected_ro_snapshot_checksum) const {
+  if (size_ < kHeaderSize) {
     return SerializedCodeSanityCheckResult::kInvalidHeader;
   }
   uint32_t magic_number = GetMagicNumber();
@@ -683,8 +707,13 @@ SerializedCodeSanityCheckResult SerializedCodeData::SanityCheckWithoutSource()
   if (flags_hash != FlagList::Hash()) {
     return SerializedCodeSanityCheckResult::kFlagsMismatch;
   }
+  uint32_t ro_snapshot_checksum =
+      GetHeaderValue(kReadOnlySnapshotChecksumOffset);
+  if (ro_snapshot_checksum != expected_ro_snapshot_checksum) {
+    return SerializedCodeSanityCheckResult::kReadOnlySnapshotChecksumMismatch;
+  }
   uint32_t payload_length = GetHeaderValue(kPayloadLengthOffset);
-  uint32_t max_payload_length = this->size_ - kHeaderSize;
+  uint32_t max_payload_length = size_ - kHeaderSize;
   if (payload_length > max_payload_length) {
     return SerializedCodeSanityCheckResult::kLengthMismatch;
   }
@@ -718,23 +747,26 @@ AlignedCachedData* SerializedCodeData::GetScriptData() {
   return result;
 }
 
-base::Vector<const byte> SerializedCodeData::Payload() const {
-  const byte* payload = data_ + kHeaderSize;
+base::Vector<const uint8_t> SerializedCodeData::Payload() const {
+  const uint8_t* payload = data_ + kHeaderSize;
   DCHECK(IsAligned(reinterpret_cast<intptr_t>(payload), kPointerAlignment));
   int length = GetHeaderValue(kPayloadLengthOffset);
   DCHECK_EQ(data_ + size_, payload + length);
-  return base::Vector<const byte>(payload, length);
+  return base::Vector<const uint8_t>(payload, length);
 }
 
 SerializedCodeData::SerializedCodeData(AlignedCachedData* data)
-    : SerializedData(const_cast<byte*>(data->data()), data->length()) {}
+    : SerializedData(const_cast<uint8_t*>(data->data()), data->length()) {}
 
 SerializedCodeData SerializedCodeData::FromCachedData(
-    AlignedCachedData* cached_data, uint32_t expected_source_hash,
+    Isolate* isolate, AlignedCachedData* cached_data,
+    uint32_t expected_source_hash,
     SerializedCodeSanityCheckResult* rejection_result) {
   DisallowGarbageCollection no_gc;
   SerializedCodeData scd(cached_data);
-  *rejection_result = scd.SanityCheck(expected_source_hash);
+  *rejection_result = scd.SanityCheck(
+      Snapshot::ExtractReadOnlySnapshotChecksum(isolate->snapshot_blob()),
+      expected_source_hash);
   if (*rejection_result != SerializedCodeSanityCheckResult::kSuccess) {
     cached_data->Reject();
     return SerializedCodeData(nullptr, 0);
@@ -743,11 +775,13 @@ SerializedCodeData SerializedCodeData::FromCachedData(
 }
 
 SerializedCodeData SerializedCodeData::FromCachedDataWithoutSource(
-    AlignedCachedData* cached_data,
+    LocalIsolate* local_isolate, AlignedCachedData* cached_data,
     SerializedCodeSanityCheckResult* rejection_result) {
   DisallowGarbageCollection no_gc;
   SerializedCodeData scd(cached_data);
-  *rejection_result = scd.SanityCheckWithoutSource();
+  *rejection_result =
+      scd.SanityCheckWithoutSource(Snapshot::ExtractReadOnlySnapshotChecksum(
+          local_isolate->snapshot_blob()));
   if (*rejection_result != SerializedCodeSanityCheckResult::kSuccess) {
     cached_data->Reject();
     return SerializedCodeData(nullptr, 0);
diff --git a/deps/v8/src/snapshot/code-serializer.h b/deps/v8/src/snapshot/code-serializer.h
index b6d9bec2f0cadf..4637d7ed91c3f9 100644
--- a/deps/v8/src/snapshot/code-serializer.h
+++ b/deps/v8/src/snapshot/code-serializer.h
@@ -17,14 +17,14 @@ class BackgroundMergeTask;
 
 class V8_EXPORT_PRIVATE AlignedCachedData {
  public:
-  AlignedCachedData(const byte* data, int length);
+  AlignedCachedData(const uint8_t* data, int length);
   ~AlignedCachedData() {
     if (owns_data_) DeleteArray(data_);
   }
   AlignedCachedData(const AlignedCachedData&) = delete;
   AlignedCachedData& operator=(const AlignedCachedData&) = delete;
 
-  const byte* data() const { return data_; }
+  const uint8_t* data() const { return data_; }
   int length() const { return length_; }
   bool rejected() const { return rejected_; }
 
@@ -45,11 +45,13 @@ class V8_EXPORT_PRIVATE AlignedCachedData {
  private:
   bool owns_data_ : 1;
   bool rejected_ : 1;
-  const byte* data_;
+  const uint8_t* data_;
   int length_;
 };
 
 enum class SerializedCodeSanityCheckResult {
+  // Don't change order/existing values of this enum since it keys into the
+  // `code_cache_reject_reason` histogram. Append-only!
   kSuccess = 0,
   kMagicNumberMismatch = 1,
   kVersionMismatch = 2,
@@ -57,8 +59,15 @@ enum class SerializedCodeSanityCheckResult {
   kFlagsMismatch = 5,
   kChecksumMismatch = 6,
   kInvalidHeader = 7,
-  kLengthMismatch = 8
+  kLengthMismatch = 8,
+  kReadOnlySnapshotChecksumMismatch = 9,
+
+  // This should always point at the last real enum value.
+  kLast = kReadOnlySnapshotChecksumMismatch
 };
+// If this fails, update the static_assert AND the code_cache_reject_reason
+// histogram definition.
+static_assert(static_cast<int>(SerializedCodeSanityCheckResult::kLast) == 9);
 
 class CodeSerializer : public Serializer {
  public:
@@ -105,11 +114,10 @@ class CodeSerializer : public Serializer {
   CodeSerializer(Isolate* isolate, uint32_t source_hash);
   ~CodeSerializer() override { OutputStatistics("CodeSerializer"); }
 
-  virtual bool ElideObject(Object obj) { return false; }
-  void SerializeGeneric(Handle<HeapObject> heap_object);
+  void SerializeGeneric(Handle<HeapObject> heap_object, SlotType slot_type);
 
  private:
-  void SerializeObjectImpl(Handle<HeapObject> o) override;
+  void SerializeObjectImpl(Handle<HeapObject> o, SlotType slot_type) override;
 
   DISALLOW_GARBAGE_COLLECTION(no_gc_)
   uint32_t source_hash_;
@@ -119,29 +127,26 @@ class CodeSerializer : public Serializer {
 class SerializedCodeData : public SerializedData {
  public:
   // The data header consists of uint32_t-sized entries:
-  // [0] magic number and (internally provided) external reference count
-  // [1] version hash
-  // [2] source hash
-  // [3] flag hash
-  // [4] payload length
-  // [5] payload checksum
-  // ...  serialized payload
   static const uint32_t kVersionHashOffset = kMagicNumberOffset + kUInt32Size;
   static const uint32_t kSourceHashOffset = kVersionHashOffset + kUInt32Size;
   static const uint32_t kFlagHashOffset = kSourceHashOffset + kUInt32Size;
-  static const uint32_t kPayloadLengthOffset = kFlagHashOffset + kUInt32Size;
+  static const uint32_t kReadOnlySnapshotChecksumOffset =
+      kFlagHashOffset + kUInt32Size;
+  static const uint32_t kPayloadLengthOffset =
+      kReadOnlySnapshotChecksumOffset + kUInt32Size;
   static const uint32_t kChecksumOffset = kPayloadLengthOffset + kUInt32Size;
   static const uint32_t kUnalignedHeaderSize = kChecksumOffset + kUInt32Size;
   static const uint32_t kHeaderSize = POINTER_SIZE_ALIGN(kUnalignedHeaderSize);
 
   // Used when consuming.
   static SerializedCodeData FromCachedData(
-      AlignedCachedData* cached_data, uint32_t expected_source_hash,
+      Isolate* isolate, AlignedCachedData* cached_data,
+      uint32_t expected_source_hash,
       SerializedCodeSanityCheckResult* rejection_result);
   // For cached data which is consumed before the source is available (e.g.
   // off-thread).
   static SerializedCodeData FromCachedDataWithoutSource(
-      AlignedCachedData* cached_data,
+      LocalIsolate* local_isolate, AlignedCachedData* cached_data,
       SerializedCodeSanityCheckResult* rejection_result);
   // For cached data which was previously already sanity checked by
   // FromCachedDataWithoutSource. The rejection result from that call should be
@@ -151,31 +156,34 @@ class SerializedCodeData : public SerializedData {
       SerializedCodeSanityCheckResult* rejection_result);
 
   // Used when producing.
-  SerializedCodeData(const std::vector<byte>* payload,
+  SerializedCodeData(const std::vector<uint8_t>* payload,
                      const CodeSerializer* cs);
 
   // Return ScriptData object and relinquish ownership over it to the caller.
   AlignedCachedData* GetScriptData();
 
-  base::Vector<const byte> Payload() const;
+  base::Vector<const uint8_t> Payload() const;
 
   static uint32_t SourceHash(Handle<String> source,
                              ScriptOriginOptions origin_options);
 
  private:
   explicit SerializedCodeData(AlignedCachedData* data);
-  SerializedCodeData(const byte* data, int size)
-      : SerializedData(const_cast<byte*>(data), size) {}
+  SerializedCodeData(const uint8_t* data, int size)
+      : SerializedData(const_cast<uint8_t*>(data), size) {}
 
-  base::Vector<const byte> ChecksummedContent() const {
-    return base::Vector<const byte>(data_ + kHeaderSize, size_ - kHeaderSize);
+  base::Vector<const uint8_t> ChecksummedContent() const {
+    return base::Vector<const uint8_t>(data_ + kHeaderSize,
+                                       size_ - kHeaderSize);
   }
 
   SerializedCodeSanityCheckResult SanityCheck(
+      uint32_t expected_ro_snapshot_checksum,
       uint32_t expected_source_hash) const;
   SerializedCodeSanityCheckResult SanityCheckJustSource(
       uint32_t expected_source_hash) const;
-  SerializedCodeSanityCheckResult SanityCheckWithoutSource() const;
+  SerializedCodeSanityCheckResult SanityCheckWithoutSource(
+      uint32_t expected_ro_snapshot_checksum) const;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/context-deserializer.cc b/deps/v8/src/snapshot/context-deserializer.cc
index 7fbeb5e471dd1f..2dd91427f7f350 100644
--- a/deps/v8/src/snapshot/context-deserializer.cc
+++ b/deps/v8/src/snapshot/context-deserializer.cc
@@ -66,10 +66,10 @@ void ContextDeserializer::DeserializeEmbedderFields(
        code = source()->Get()) {
     HandleScope scope(isolate());
     Handle<JSObject> obj = Handle<JSObject>::cast(GetBackReferencedObject());
-    int index = source()->GetInt();
-    int size = source()->GetInt();
+    int index = source()->GetUint30();
+    int size = source()->GetUint30();
     // TODO(yangguo,jgruber): Turn this into a reusable shared buffer.
-    byte* data = new byte[size];
+    uint8_t* data = new uint8_t[size];
     source()->CopyRaw(data, size);
     embedder_fields_deserializer.callback(v8::Utils::ToLocal(obj), index,
                                           {reinterpret_cast<char*>(data), size},
diff --git a/deps/v8/src/snapshot/context-serializer.cc b/deps/v8/src/snapshot/context-serializer.cc
index f9e2ab89355adb..384a30c208e1c1 100644
--- a/deps/v8/src/snapshot/context-serializer.cc
+++ b/deps/v8/src/snapshot/context-serializer.cc
@@ -22,14 +22,15 @@ namespace {
 // serialization, the original state is restored.
 class V8_NODISCARD SanitizeNativeContextScope final {
  public:
-  SanitizeNativeContextScope(Isolate* isolate, NativeContext native_context,
+  SanitizeNativeContextScope(Isolate* isolate,
+                             Tagged<NativeContext> native_context,
                              bool allow_active_isolate_for_testing,
                              const DisallowGarbageCollection& no_gc)
       : native_context_(native_context), no_gc_(no_gc) {
 #ifdef DEBUG
     if (!allow_active_isolate_for_testing) {
       // Microtasks.
-      MicrotaskQueue* microtask_queue = native_context_.microtask_queue();
+      MicrotaskQueue* microtask_queue = native_context_->microtask_queue();
       DCHECK_EQ(0, microtask_queue->size());
       DCHECK(!microtask_queue->HasMicrotasksSuppressions());
       DCHECK_EQ(0, microtask_queue->GetMicrotasksScopeDepth());
@@ -38,14 +39,14 @@ class V8_NODISCARD SanitizeNativeContextScope final {
 #endif
     microtask_queue_external_pointer_ =
         native_context
-            .RawExternalPointerField(NativeContext::kMicrotaskQueueOffset)
+            ->RawExternalPointerField(NativeContext::kMicrotaskQueueOffset)
             .GetAndClearContentForSerialization(no_gc);
   }
 
   ~SanitizeNativeContextScope() {
     // Restore saved fields.
     native_context_
-        .RawExternalPointerField(NativeContext::kMicrotaskQueueOffset)
+        ->RawExternalPointerField(NativeContext::kMicrotaskQueueOffset)
         .RestoreContentAfterSerialization(microtask_queue_external_pointer_,
                                           no_gc_);
   }
@@ -76,12 +77,12 @@ ContextSerializer::~ContextSerializer() {
 void ContextSerializer::Serialize(Context* o,
                                   const DisallowGarbageCollection& no_gc) {
   context_ = *o;
-  DCHECK(context_.IsNativeContext());
+  DCHECK(IsNativeContext(context_));
 
   // Upon deserialization, references to the global proxy and its map will be
   // replaced.
-  reference_map()->AddAttachedReference(context_.global_proxy());
-  reference_map()->AddAttachedReference(context_.global_proxy().map());
+  reference_map()->AddAttachedReference(context_->global_proxy());
+  reference_map()->AddAttachedReference(context_->global_proxy()->map());
 
   // The bootstrap snapshot has a code-stub context. When serializing the
   // context snapshot, it is chained into the weak context list on the isolate
@@ -90,14 +91,14 @@ void ContextSerializer::Serialize(Context* o,
   // explicitly when it's loaded.
   // TODO(v8:10416): These mutations should not observably affect the running
   // context.
-  context_.set(Context::NEXT_CONTEXT_LINK,
-               ReadOnlyRoots(isolate()).undefined_value());
-  DCHECK(!context_.global_object().IsUndefined());
+  context_->set(Context::NEXT_CONTEXT_LINK,
+                ReadOnlyRoots(isolate()).undefined_value());
+  DCHECK(!IsUndefined(context_->global_object()));
   // Reset math random cache to get fresh random numbers.
   MathRandom::ResetContext(context_);
 
   SanitizeNativeContextScope sanitize_native_context(
-      isolate(), context_.native_context(), allow_active_isolate_for_testing(),
+      isolate(), context_->native_context(), allow_active_isolate_for_testing(),
       no_gc);
 
   VisitRootPointer(Root::kStartupObjectCache, nullptr, FullObjectSlot(o));
@@ -113,7 +114,8 @@ void ContextSerializer::Serialize(Context* o,
   Pad();
 }
 
-void ContextSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
+void ContextSerializer::SerializeObjectImpl(Handle<HeapObject> obj,
+                                            SlotType slot_type) {
   DCHECK(!ObjectIsBytecodeHandler(*obj));  // Only referenced in dispatch table.
 
   if (!allow_active_isolate_for_testing()) {
@@ -122,19 +124,16 @@ void ContextSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
     // But in test scenarios there is no way to avoid this. Since we only
     // serialize a single context in these cases, and this context does not
     // have to be executable, we can simply ignore this.
-    DCHECK_IMPLIES(obj->IsNativeContext(), *obj == context_);
+    DCHECK_IMPLIES(IsNativeContext(*obj), *obj == context_);
   }
 
   {
     DisallowGarbageCollection no_gc;
-    HeapObject raw = *obj;
+    Tagged<HeapObject> raw = *obj;
     if (SerializeHotObject(raw)) return;
     if (SerializeRoot(raw)) return;
     if (SerializeBackReference(raw)) return;
-  }
-
-  if (startup_serializer_->SerializeUsingReadOnlyObjectCache(&sink_, obj)) {
-    return;
+    if (SerializeReadOnlyObjectReference(raw, &sink_)) return;
   }
 
   if (startup_serializer_->SerializeUsingSharedHeapObjectCache(&sink_, obj)) {
@@ -152,17 +151,14 @@ void ContextSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
   DCHECK(!startup_serializer_->ReferenceMapContains(obj));
   // All the internalized strings that the context snapshot needs should be
   // either in the root table or in the shared heap object cache.
-  DCHECK(!obj->IsInternalizedString());
+  DCHECK(!IsInternalizedString(*obj));
   // Function and object templates are not context specific.
-  DCHECK(!obj->IsTemplateInfo());
+  DCHECK(!IsTemplateInfo(*obj));
 
-  InstanceType instance_type = obj->map().instance_type();
+  InstanceType instance_type = obj->map()->instance_type();
   if (InstanceTypeChecker::IsFeedbackVector(instance_type)) {
     // Clear literal boilerplates and feedback.
     Handle<FeedbackVector>::cast(obj)->ClearSlots(isolate());
-  } else if (InstanceTypeChecker::IsFeedbackCell(instance_type)) {
-    // Clear InterruptBudget when serializing FeedbackCell.
-    Handle<FeedbackCell>::cast(obj)->SetInitialInterruptBudget();
   } else if (InstanceTypeChecker::IsJSObject(instance_type)) {
     if (SerializeJSObjectWithEmbedderFields(Handle<JSObject>::cast(obj))) {
       return;
@@ -171,13 +167,16 @@ void ContextSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
       DisallowGarbageCollection no_gc;
       // Unconditionally reset the JSFunction to its SFI's code, since we can't
       // serialize optimized code anyway.
-      JSFunction closure = JSFunction::cast(*obj);
-      closure.ResetIfCodeFlushed();
-      if (closure.is_compiled()) {
-        if (closure.shared().HasBaselineCode()) {
-          closure.shared().FlushBaselineCode();
+      Tagged<JSFunction> closure = JSFunction::cast(*obj);
+      if (closure->shared()->HasBytecodeArray()) {
+        closure->SetInterruptBudget(isolate());
+      }
+      closure->ResetIfCodeFlushed();
+      if (closure->is_compiled()) {
+        if (closure->shared()->HasBaselineCode()) {
+          closure->shared()->FlushBaselineCode();
         }
-        closure.set_code(closure.shared().GetCode(isolate()), kReleaseStore);
+        closure->set_code(closure->shared()->GetCode(isolate()), kReleaseStore);
       }
     }
   }
@@ -186,24 +185,24 @@ void ContextSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
 
   // Object has not yet been serialized.  Serialize it here.
   ObjectSerializer serializer(this, obj, &sink_);
-  serializer.Serialize();
+  serializer.Serialize(slot_type);
 }
 
-bool ContextSerializer::ShouldBeInTheStartupObjectCache(HeapObject o) {
+bool ContextSerializer::ShouldBeInTheStartupObjectCache(Tagged<HeapObject> o) {
   // We can't allow scripts to be part of the context snapshot because they
   // contain a unique ID, and deserializing several context snapshots containing
   // script would cause dupes.
-  return o.IsName() || o.IsScript() || o.IsSharedFunctionInfo() ||
-         o.IsHeapNumber() || o.IsCode() || o.IsInstructionStream() ||
-         o.IsScopeInfo() || o.IsAccessorInfo() || o.IsTemplateInfo() ||
-         o.IsClassPositions() ||
-         o.map() == ReadOnlyRoots(isolate()).fixed_cow_array_map();
+  return IsName(o) || IsScript(o) || IsSharedFunctionInfo(o) ||
+         IsHeapNumber(o) || IsCode(o) || IsInstructionStream(o) ||
+         IsScopeInfo(o) || IsAccessorInfo(o) || IsTemplateInfo(o) ||
+         IsClassPositions(o) ||
+         o->map() == ReadOnlyRoots(isolate()).fixed_cow_array_map();
 }
 
-bool ContextSerializer::ShouldBeInTheSharedObjectCache(HeapObject o) {
+bool ContextSerializer::ShouldBeInTheSharedObjectCache(Tagged<HeapObject> o) {
   // v8_flags.shared_string_table may be true during deserialization, so put
   // internalized strings into the shared object snapshot.
-  return o.IsInternalizedString();
+  return IsInternalizedString(o);
 }
 
 namespace {
@@ -213,11 +212,11 @@ bool DataIsEmpty(const StartupData& data) { return data.raw_size == 0; }
 bool ContextSerializer::SerializeJSObjectWithEmbedderFields(
     Handle<JSObject> obj) {
   DisallowGarbageCollection no_gc;
-  JSObject js_obj = *obj;
-  int embedder_fields_count = js_obj.GetEmbedderFieldCount();
+  Tagged<JSObject> js_obj = *obj;
+  int embedder_fields_count = js_obj->GetEmbedderFieldCount();
   if (embedder_fields_count == 0) return false;
   CHECK_GT(embedder_fields_count, 0);
-  DCHECK(!js_obj.NeedsRehashing(cage_base()));
+  DCHECK(!js_obj->NeedsRehashing(cage_base()));
 
   DisallowJavascriptExecution no_js(isolate());
   DisallowCompilation no_compile(isolate());
@@ -235,8 +234,8 @@ bool ContextSerializer::SerializeJSObjectWithEmbedderFields(
     EmbedderDataSlot embedder_data_slot(js_obj, i);
     original_embedder_values.emplace_back(
         embedder_data_slot.load_raw(isolate(), no_gc));
-    Object object = embedder_data_slot.load_tagged();
-    if (object.IsHeapObject()) {
+    Tagged<Object> object = embedder_data_slot.load_tagged();
+    if (IsHeapObject(object)) {
       DCHECK(IsValidHeapObject(isolate()->heap(), HeapObject::cast(object)));
       serialized_data.push_back({nullptr, 0});
     } else {
@@ -269,7 +268,7 @@ bool ContextSerializer::SerializeJSObjectWithEmbedderFields(
   //    smis are serialized regularly.
   {
     AllowGarbageCollection allow_gc;
-    ObjectSerializer(this, obj, &sink_).Serialize();
+    ObjectSerializer(this, obj, &sink_).Serialize(SlotType::kAnySlot);
     // Reload raw pointer.
     js_obj = *obj;
   }
@@ -289,10 +288,11 @@ bool ContextSerializer::SerializeJSObjectWithEmbedderFields(
     EmbedderDataSlot(js_obj, i).store_raw(isolate(),
                                           original_embedder_values[i], no_gc);
     embedder_fields_sink_.Put(kNewObject, "embedder field holder");
-    embedder_fields_sink_.PutInt(reference->back_ref_index(), "BackRefIndex");
-    embedder_fields_sink_.PutInt(i, "embedder field index");
-    embedder_fields_sink_.PutInt(data.raw_size, "embedder fields data size");
-    embedder_fields_sink_.PutRaw(reinterpret_cast<const byte*>(data.data),
+    embedder_fields_sink_.PutUint30(reference->back_ref_index(),
+                                    "BackRefIndex");
+    embedder_fields_sink_.PutUint30(i, "embedder field index");
+    embedder_fields_sink_.PutUint30(data.raw_size, "embedder fields data size");
+    embedder_fields_sink_.PutRaw(reinterpret_cast<const uint8_t*>(data.data),
                                  data.raw_size, "embedder fields data");
     delete[] data.data;
   }
@@ -304,10 +304,10 @@ bool ContextSerializer::SerializeJSObjectWithEmbedderFields(
   return true;
 }
 
-void ContextSerializer::CheckRehashability(HeapObject obj) {
+void ContextSerializer::CheckRehashability(Tagged<HeapObject> obj) {
   if (!can_be_rehashed_) return;
-  if (!obj.NeedsRehashing(cage_base())) return;
-  if (obj.CanBeRehashed(cage_base())) return;
+  if (!obj->NeedsRehashing(cage_base())) return;
+  if (obj->CanBeRehashed(cage_base())) return;
   can_be_rehashed_ = false;
 }
 
diff --git a/deps/v8/src/snapshot/context-serializer.h b/deps/v8/src/snapshot/context-serializer.h
index 5ec67dcea825f4..2d4214a7ac0da2 100644
--- a/deps/v8/src/snapshot/context-serializer.h
+++ b/deps/v8/src/snapshot/context-serializer.h
@@ -29,11 +29,11 @@ class V8_EXPORT_PRIVATE ContextSerializer : public Serializer {
   bool can_be_rehashed() const { return can_be_rehashed_; }
 
  private:
-  void SerializeObjectImpl(Handle<HeapObject> o) override;
-  bool ShouldBeInTheStartupObjectCache(HeapObject o);
-  bool ShouldBeInTheSharedObjectCache(HeapObject o);
+  void SerializeObjectImpl(Handle<HeapObject> o, SlotType slot_type) override;
+  bool ShouldBeInTheStartupObjectCache(Tagged<HeapObject> o);
+  bool ShouldBeInTheSharedObjectCache(Tagged<HeapObject> o);
   bool SerializeJSObjectWithEmbedderFields(Handle<JSObject> obj);
-  void CheckRehashability(HeapObject obj);
+  void CheckRehashability(Tagged<HeapObject> obj);
 
   StartupSerializer* startup_serializer_;
   v8::SerializeEmbedderFieldsCallback serialize_embedder_fields_;
diff --git a/deps/v8/src/snapshot/deserializer.cc b/deps/v8/src/snapshot/deserializer.cc
index e71af5266dc32c..ffb1d35d8aeb69 100644
--- a/deps/v8/src/snapshot/deserializer.cc
+++ b/deps/v8/src/snapshot/deserializer.cc
@@ -6,6 +6,7 @@
 
 #include "src/base/logging.h"
 #include "src/codegen/assembler-inl.h"
+#include "src/codegen/reloc-info-inl.h"
 #include "src/common/assert-scope.h"
 #include "src/common/globals.h"
 #include "src/execution/isolate.h"
@@ -65,7 +66,7 @@ class SlotAccessorForHeapObject {
     CombinedWriteBarrier(*object_, current_slot, value, UPDATE_WRITE_BARRIER);
     return 1;
   }
-  int Write(HeapObject value, HeapObjectReferenceType ref_type,
+  int Write(Tagged<HeapObject> value, HeapObjectReferenceType ref_type,
             int slot_offset = 0) {
     return Write(HeapObjectReference::From(value, ref_type), slot_offset);
   }
@@ -74,6 +75,25 @@ class SlotAccessorForHeapObject {
     return Write(*value, ref_type, slot_offset);
   }
 
+  int WriteIndirect(Tagged<HeapObject> value) {
+    // TODO(saelo): currently, only Code objects can be referenced indirectly
+    // through a pointer table, and so here we directly downcast to Code
+    // because we need to know the offset at which the object has its pointer
+    // table entry index. However, in the future we might have other types of
+    // objects be referenced through the table. In that case, we should
+    // probably introduce some kind of "ExternalHeapObject" class which, in
+    // sandbox builds, owns a pointer table entry and contains the handle for
+    // it. Then we can unify this handling here to expect an ExternalHeapObject
+    // and simply copy the handle into the slot. For that we don't even need to
+    // know which table the object uses.
+    CHECK(IsCode(value));
+    Tagged<Code> code = Code::cast(value);
+    IndirectPointerSlot dest = object_->RawIndirectPointerField(offset_);
+    dest.store(code);
+    IndirectPointerWriteBarrier(*object_, dest, value, UPDATE_WRITE_BARRIER);
+    return 1;
+  }
+
  private:
   SlotAccessorForHeapObject(Handle<HeapObject> object, int offset)
       : object_(object), offset_(offset) {}
@@ -99,7 +119,7 @@ class SlotAccessorForRootSlots {
     current_slot.Relaxed_Store(value);
     return 1;
   }
-  int Write(HeapObject value, HeapObjectReferenceType ref_type,
+  int Write(Tagged<HeapObject> value, HeapObjectReferenceType ref_type,
             int slot_offset = 0) {
     return Write(HeapObjectReference::From(value, ref_type), slot_offset);
   }
@@ -107,6 +127,7 @@ class SlotAccessorForRootSlots {
             int slot_offset = 0) {
     return Write(*value, ref_type, slot_offset);
   }
+  int WriteIndirect(Tagged<HeapObject> value) { UNREACHABLE(); }
 
  private:
   const FullMaybeObjectSlot slot_;
@@ -126,7 +147,7 @@ class SlotAccessorForHandle {
   int offset() const { UNREACHABLE(); }
 
   int Write(MaybeObject value, int slot_offset = 0) { UNREACHABLE(); }
-  int Write(HeapObject value, HeapObjectReferenceType ref_type,
+  int Write(Tagged<HeapObject> value, HeapObjectReferenceType ref_type,
             int slot_offset = 0) {
     DCHECK_EQ(slot_offset, 0);
     DCHECK_EQ(ref_type, HeapObjectReferenceType::STRONG);
@@ -140,6 +161,7 @@ class SlotAccessorForHandle {
     *handle_ = value;
     return 1;
   }
+  int WriteIndirect(Tagged<HeapObject> value) { UNREACHABLE(); }
 
  private:
   Handle<HeapObject>* handle_;
@@ -147,19 +169,34 @@ class SlotAccessorForHandle {
 };
 
 template <typename IsolateT>
-template <typename TSlot>
-int Deserializer<IsolateT>::WriteAddress(TSlot dest, Address value) {
-  DCHECK(!next_reference_is_weak_);
-  memcpy(dest.ToVoidPtr(), &value, kSystemPointerSize);
-  static_assert(IsAligned(kSystemPointerSize, TSlot::kSlotDataSize));
-  return (kSystemPointerSize / TSlot::kSlotDataSize);
+template <typename SlotAccessor>
+int Deserializer<IsolateT>::WriteHeapPointer(SlotAccessor slot_accessor,
+                                             Tagged<HeapObject> heap_object,
+                                             ReferenceDescriptor descr) {
+  if (descr.is_indirect_pointer) {
+    return slot_accessor.WriteIndirect(heap_object);
+  } else {
+    return slot_accessor.Write(heap_object, descr.type);
+  }
+}
+
+template <typename IsolateT>
+template <typename SlotAccessor>
+int Deserializer<IsolateT>::WriteHeapPointer(SlotAccessor slot_accessor,
+                                             Handle<HeapObject> heap_object,
+                                             ReferenceDescriptor descr) {
+  if (descr.is_indirect_pointer) {
+    return slot_accessor.WriteIndirect(*heap_object);
+  } else {
+    return slot_accessor.Write(heap_object, descr.type);
+  }
 }
 
 template <typename IsolateT>
 int Deserializer<IsolateT>::WriteExternalPointer(ExternalPointerSlot dest,
                                                  Address value,
                                                  ExternalPointerTag tag) {
-  DCHECK(!next_reference_is_weak_);
+  DCHECK(!next_reference_is_weak_ && !next_reference_is_indirect_pointer_);
   dest.init(main_thread_isolate(), value, tag);
   // ExternalPointers can only be written into HeapObject fields, therefore they
   // cover (kExternalPointerSlotSize / kTaggedSize) slots.
@@ -189,7 +226,7 @@ int GetNumApiReferences(LocalIsolate* isolate) { return 0; }
 
 template <typename IsolateT>
 Deserializer<IsolateT>::Deserializer(IsolateT* isolate,
-                                     base::Vector<const byte> payload,
+                                     base::Vector<const uint8_t> payload,
                                      uint32_t magic_number,
                                      bool deserializing_user_code,
                                      bool can_rehash)
@@ -249,7 +286,7 @@ void Deserializer<IsolateT>::VisitRootPointers(Root root,
 
 template <typename IsolateT>
 void Deserializer<IsolateT>::Synchronize(VisitorSynchronization::SyncTag tag) {
-  static const byte expected = kSynchronize;
+  static const uint8_t expected = kSynchronize;
   CHECK_EQ(expected, source_.Get());
 }
 
@@ -278,18 +315,18 @@ void Deserializer<IsolateT>::WeakenDescriptorArrays() {
 }
 
 template <typename IsolateT>
-void Deserializer<IsolateT>::LogScriptEvents(Script script) {
+void Deserializer<IsolateT>::LogScriptEvents(Tagged<Script> script) {
   DisallowGarbageCollection no_gc;
-  LOG(isolate(), ScriptEvent(ScriptEventType::kDeserialize, script.id()));
+  LOG(isolate(), ScriptEvent(ScriptEventType::kDeserialize, script->id()));
   LOG(isolate(), ScriptDetails(script));
 }
 
 namespace {
 template <typename IsolateT>
-uint32_t ComputeRawHashField(IsolateT* isolate, String string) {
+uint32_t ComputeRawHashField(IsolateT* isolate, Tagged<String> string) {
   // Make sure raw_hash_field() is computed.
-  string.EnsureHash(SharedStringAccessGuardIfNeeded(isolate));
-  return string.raw_hash_field();
+  string->EnsureHash(SharedStringAccessGuardIfNeeded(isolate));
+  return string->raw_hash_field();
 }
 }  // namespace
 
@@ -301,7 +338,7 @@ StringTableInsertionKey::StringTableInsertionKey(
 #ifdef DEBUG
   deserializing_user_code_ = deserializing_user_code;
 #endif
-  DCHECK(string->IsInternalizedString());
+  DCHECK(IsInternalizedString(*string));
 }
 
 StringTableInsertionKey::StringTableInsertionKey(
@@ -312,17 +349,19 @@ StringTableInsertionKey::StringTableInsertionKey(
 #ifdef DEBUG
   deserializing_user_code_ = deserializing_user_code;
 #endif
-  DCHECK(string->IsInternalizedString());
+  DCHECK(IsInternalizedString(*string));
 }
 
 template <typename IsolateT>
-bool StringTableInsertionKey::IsMatch(IsolateT* isolate, String string) {
+bool StringTableInsertionKey::IsMatch(IsolateT* isolate,
+                                      Tagged<String> string) {
   // We want to compare the content of two strings here.
   return string_->SlowEquals(string, SharedStringAccessGuardIfNeeded(isolate));
 }
-template bool StringTableInsertionKey::IsMatch(Isolate* isolate, String string);
+template bool StringTableInsertionKey::IsMatch(Isolate* isolate,
+                                               Tagged<String> string);
 template bool StringTableInsertionKey::IsMatch(LocalIsolate* isolate,
-                                               String string);
+                                               Tagged<String> string);
 
 namespace {
 
@@ -334,15 +373,16 @@ void NoExternalReferencesCallback() {
   FATAL("No external references provided via API");
 }
 
-void PostProcessExternalString(ExternalString string, Isolate* isolate) {
+void PostProcessExternalString(Tagged<ExternalString> string,
+                               Isolate* isolate) {
   DisallowGarbageCollection no_gc;
-  uint32_t index = string.GetResourceRefForDeserialization();
+  uint32_t index = string->GetResourceRefForDeserialization();
   Address address =
       static_cast<Address>(isolate->api_external_references()[index]);
-  string.InitExternalPointerFields(isolate);
-  string.set_address_as_resource(isolate, address);
+  string->InitExternalPointerFields(isolate);
+  string->set_address_as_resource(isolate, address);
   isolate->heap()->UpdateExternalString(string, 0,
-                                        string.ExternalPayloadSize());
+                                        string->ExternalPayloadSize());
   isolate->heap()->RegisterExternalString(string);
 }
 
@@ -350,70 +390,70 @@ void PostProcessExternalString(ExternalString string, Isolate* isolate) {
 
 // Should be called only on the main thread (not thread safe).
 template <>
-void Deserializer<Isolate>::PostProcessNewJSReceiver(Map map,
+void Deserializer<Isolate>::PostProcessNewJSReceiver(Tagged<Map> map,
                                                      Handle<JSReceiver> obj,
                                                      InstanceType instance_type,
                                                      SnapshotSpace space) {
-  DCHECK_EQ(map.instance_type(), instance_type);
+  DCHECK_EQ(map->instance_type(), instance_type);
 
   if (InstanceTypeChecker::IsJSDataView(instance_type) ||
       InstanceTypeChecker::IsJSRabGsabDataView(instance_type)) {
     auto data_view = JSDataViewOrRabGsabDataView::cast(*obj);
-    auto buffer = JSArrayBuffer::cast(data_view.buffer());
-    if (buffer.was_detached()) {
+    auto buffer = JSArrayBuffer::cast(data_view->buffer());
+    if (buffer->was_detached()) {
       // Directly set the data pointer to point to the EmptyBackingStoreBuffer.
       // Otherwise, we might end up setting it to EmptyBackingStoreBuffer() +
       // byte_offset() which would result in an invalid pointer.
-      data_view.set_data_pointer(main_thread_isolate(),
-                                 EmptyBackingStoreBuffer());
+      data_view->set_data_pointer(main_thread_isolate(),
+                                  EmptyBackingStoreBuffer());
     } else {
-      void* backing_store = buffer.backing_store();
-      data_view.set_data_pointer(
+      void* backing_store = buffer->backing_store();
+      data_view->set_data_pointer(
           main_thread_isolate(),
-          reinterpret_cast<uint8_t*>(backing_store) + data_view.byte_offset());
+          reinterpret_cast<uint8_t*>(backing_store) + data_view->byte_offset());
     }
   } else if (InstanceTypeChecker::IsJSTypedArray(instance_type)) {
     auto typed_array = JSTypedArray::cast(*obj);
     // Note: ByteArray objects must not be deferred s.t. they are
     // available here for is_on_heap(). See also: CanBeDeferred.
     // Fixup typed array pointers.
-    if (typed_array.is_on_heap()) {
-      typed_array.AddExternalPointerCompensationForDeserialization(
+    if (typed_array->is_on_heap()) {
+      typed_array->AddExternalPointerCompensationForDeserialization(
           main_thread_isolate());
     } else {
       // Serializer writes backing store ref as a DataPtr() value.
       uint32_t store_index =
-          typed_array.GetExternalBackingStoreRefForDeserialization();
+          typed_array->GetExternalBackingStoreRefForDeserialization();
       auto backing_store = backing_stores_[store_index];
       void* start = backing_store ? backing_store->buffer_start() : nullptr;
       if (!start) start = EmptyBackingStoreBuffer();
-      typed_array.SetOffHeapDataPtr(main_thread_isolate(), start,
-                                    typed_array.byte_offset());
+      typed_array->SetOffHeapDataPtr(main_thread_isolate(), start,
+                                     typed_array->byte_offset());
     }
   } else if (InstanceTypeChecker::IsJSArrayBuffer(instance_type)) {
     auto buffer = JSArrayBuffer::cast(*obj);
-    uint32_t store_index = buffer.GetBackingStoreRefForDeserialization();
+    uint32_t store_index = buffer->GetBackingStoreRefForDeserialization();
     if (store_index == kEmptyBackingStoreRefSentinel) {
-      buffer.set_extension(nullptr);
-      buffer.set_backing_store(main_thread_isolate(),
-                               EmptyBackingStoreBuffer());
+      buffer->set_extension(nullptr);
+      buffer->set_backing_store(main_thread_isolate(),
+                                EmptyBackingStoreBuffer());
     } else {
       auto bs = backing_store(store_index);
       SharedFlag shared =
           bs && bs->is_shared() ? SharedFlag::kShared : SharedFlag::kNotShared;
       DCHECK_IMPLIES(bs,
-                     buffer.is_resizable_by_js() == bs->is_resizable_by_js());
+                     buffer->is_resizable_by_js() == bs->is_resizable_by_js());
       ResizableFlag resizable = bs && bs->is_resizable_by_js()
                                     ? ResizableFlag::kResizable
                                     : ResizableFlag::kNotResizable;
-      buffer.Setup(shared, resizable, bs, main_thread_isolate());
+      buffer->Setup(shared, resizable, bs, main_thread_isolate());
     }
   }
 }
 
 template <>
 void Deserializer<LocalIsolate>::PostProcessNewJSReceiver(
-    Map map, Handle<JSReceiver> obj, InstanceType instance_type,
+    Tagged<Map> map, Handle<JSReceiver> obj, InstanceType instance_type,
     SnapshotSpace space) {
   UNREACHABLE();
 }
@@ -423,22 +463,22 @@ void Deserializer<IsolateT>::PostProcessNewObject(Handle<Map> map,
                                                   Handle<HeapObject> obj,
                                                   SnapshotSpace space) {
   DisallowGarbageCollection no_gc;
-  Map raw_map = *map;
+  Tagged<Map> raw_map = *map;
   DCHECK_EQ(raw_map, obj->map(isolate_));
-  InstanceType instance_type = raw_map.instance_type();
-  HeapObject raw_obj = *obj;
+  InstanceType instance_type = raw_map->instance_type();
+  Tagged<HeapObject> raw_obj = *obj;
   DCHECK_IMPLIES(deserializing_user_code(), should_rehash());
   if (should_rehash()) {
     if (InstanceTypeChecker::IsString(instance_type)) {
       // Uninitialize hash field as we need to recompute the hash.
-      String string = String::cast(raw_obj);
-      string.set_raw_hash_field(String::kEmptyHashField);
+      Tagged<String> string = String::cast(raw_obj);
+      string->set_raw_hash_field(String::kEmptyHashField);
       // Rehash strings before read-only space is sealed. Strings outside
       // read-only space are rehashed lazily. (e.g. when rehashing dictionaries)
       if (space == SnapshotSpace::kReadOnlyHeap) {
         PushObjectToRehash(obj);
       }
-    } else if (raw_obj.NeedsRehashing(instance_type)) {
+    } else if (raw_obj->NeedsRehashing(instance_type)) {
       PushObjectToRehash(obj);
     }
 
@@ -455,14 +495,11 @@ void Deserializer<IsolateT>::PostProcessNewObject(Handle<Map> map,
         StringTableInsertionKey key(
             isolate(), string,
             DeserializingUserCodeOption::kIsDeserializingUserCode);
-        String result = *isolate()->string_table()->LookupKey(isolate(), &key);
+        Tagged<String> result =
+            *isolate()->string_table()->LookupKey(isolate(), &key);
 
         if (result != raw_obj) {
-          // Updating invalidated object size from a background thread would
-          // race. We are allowed to skip this here since this string hasn't
-          // transitioned so far.
-          String::cast(raw_obj).MakeThin(isolate(), result,
-                                         UpdateInvalidatedObjectSize::kNo);
+          String::cast(raw_obj)->MakeThin(isolate(), result);
           // Mutate the given object handle so that the backreference entry is
           // also updated.
           obj.PatchValue(result);
@@ -479,7 +516,7 @@ void Deserializer<IsolateT>::PostProcessNewObject(Handle<Map> map,
       } else {
         // We dont defer ByteArray because JSTypedArray needs the base_pointer
         // ByteArray immediately if it's on heap.
-        DCHECK(CanBeDeferred(*obj) ||
+        DCHECK(CanBeDeferred(*obj, SlotType::kAnySlot) ||
                InstanceTypeChecker::IsByteArray(instance_type));
       }
     }
@@ -493,15 +530,20 @@ void Deserializer<IsolateT>::PostProcessNewObject(Handle<Map> map,
       new_code_objects_.push_back(Handle<InstructionStream>::cast(obj));
     }
   } else if (InstanceTypeChecker::IsCode(instance_type)) {
-    Code code = Code::cast(raw_obj);
-    code.init_code_entry_point(main_thread_isolate(), kNullAddress);
-    if (!code.has_instruction_stream()) {
-      code.SetEntryPointForOffHeapBuiltin(main_thread_isolate(),
-                                          code.OffHeapInstructionStart());
+    Tagged<Code> code = Code::cast(raw_obj);
+    code->init_instruction_start(main_thread_isolate(), kNullAddress);
+    if (!code->has_instruction_stream()) {
+      code->SetInstructionStartForOffHeapBuiltin(
+          main_thread_isolate(), EmbeddedData::FromBlob(main_thread_isolate())
+                                     .InstructionStartOf(code->builtin_id()));
     } else {
-      code.UpdateCodeEntryPoint(main_thread_isolate(),
-                                code.instruction_stream());
+      code->UpdateInstructionStart(main_thread_isolate(),
+                                   code->instruction_stream());
     }
+  } else if (InstanceTypeChecker::IsSharedFunctionInfo(instance_type)) {
+    Tagged<SharedFunctionInfo> sfi = SharedFunctionInfo::cast(raw_obj);
+    // Reset the id to avoid collisions - it must be unique in this isolate.
+    sfi->set_unique_id(isolate()->GetAndIncNextUniqueSfiId());
   } else if (InstanceTypeChecker::IsMap(instance_type)) {
     if (v8_flags.log_maps) {
       // Keep track of all seen Maps to log them later since they might be only
@@ -529,29 +571,33 @@ void Deserializer<IsolateT>::PostProcessNewObject(Handle<Map> map,
     Handle<DescriptorArray> descriptors = Handle<DescriptorArray>::cast(obj);
     new_descriptor_arrays_.Push(*descriptors);
   } else if (InstanceTypeChecker::IsNativeContext(instance_type)) {
-    NativeContext::cast(raw_obj).init_microtask_queue(main_thread_isolate(),
-                                                      nullptr);
+    NativeContext::cast(raw_obj)->init_microtask_queue(main_thread_isolate(),
+                                                       nullptr);
   } else if (InstanceTypeChecker::IsScript(instance_type)) {
     LogScriptEvents(Script::cast(*obj));
   }
 }
 
 template <typename IsolateT>
-HeapObjectReferenceType Deserializer<IsolateT>::GetAndResetNextReferenceType() {
-  HeapObjectReferenceType type = next_reference_is_weak_
-                                     ? HeapObjectReferenceType::WEAK
-                                     : HeapObjectReferenceType::STRONG;
+typename Deserializer<IsolateT>::ReferenceDescriptor
+Deserializer<IsolateT>::GetAndResetNextReferenceDescriptor() {
+  DCHECK(!(next_reference_is_weak_ && next_reference_is_indirect_pointer_));
+  ReferenceDescriptor desc;
+  desc.type = next_reference_is_weak_ ? HeapObjectReferenceType::WEAK
+                                      : HeapObjectReferenceType::STRONG;
   next_reference_is_weak_ = false;
-  return type;
+  desc.is_indirect_pointer = next_reference_is_indirect_pointer_;
+  next_reference_is_indirect_pointer_ = false;
+  return desc;
 }
 
 template <typename IsolateT>
 Handle<HeapObject> Deserializer<IsolateT>::GetBackReferencedObject() {
-  Handle<HeapObject> obj = back_refs_[source_.GetInt()];
+  Handle<HeapObject> obj = back_refs_[source_.GetUint30()];
 
   // We don't allow ThinStrings in backreferences -- if internalization produces
   // a thin string, then it should also update the backref handle.
-  DCHECK(!obj->IsThinString(isolate()));
+  DCHECK(!IsThinString(*obj, isolate()));
 
   hot_objects_.Add(obj);
   DCHECK(!HasWeakHeapObjectTag(*obj));
@@ -582,7 +628,7 @@ AllocationType SpaceToAllocation(SnapshotSpace space) {
 
 template <typename IsolateT>
 Handle<HeapObject> Deserializer<IsolateT>::ReadObject(SnapshotSpace space) {
-  const int size_in_tagged = source_.GetInt();
+  const int size_in_tagged = source_.GetUint30();
   const int size_in_bytes = size_in_tagged * kTaggedSize;
 
   // The map can't be a forward ref. If you want the map to be a forward ref,
@@ -627,43 +673,43 @@ Handle<HeapObject> Deserializer<IsolateT>::ReadObject(SnapshotSpace space) {
   //     before fields with objects.
   //     - We ensure this is the case by DCHECKing on object allocation that the
   //       previously allocated object has a valid size (see `Allocate`).
-  HeapObject raw_obj =
+  Tagged<HeapObject> raw_obj =
       Allocate(allocation, size_in_bytes, HeapObject::RequiredAlignment(*map));
-  raw_obj.set_map_after_allocation(*map);
-  MemsetTagged(raw_obj.RawField(kTaggedSize),
+  raw_obj->set_map_after_allocation(*map);
+  MemsetTagged(raw_obj->RawField(kTaggedSize),
                Smi::uninitialized_deserialization_value(), size_in_tagged - 1);
-  DCHECK(raw_obj.CheckRequiredAlignment(isolate()));
+  DCHECK(raw_obj->CheckRequiredAlignment(isolate()));
 
   // Make sure BytecodeArrays have a valid age, so that the marker doesn't
   // break when making them older.
-  if (raw_obj.IsBytecodeArray(isolate())) {
-    BytecodeArray::cast(raw_obj).set_bytecode_age(0);
-  } else if (raw_obj.IsEphemeronHashTable()) {
+  if (IsSharedFunctionInfo(raw_obj, isolate())) {
+    SharedFunctionInfo::cast(raw_obj)->set_age(0);
+  } else if (IsEphemeronHashTable(raw_obj)) {
     // Make sure EphemeronHashTables have valid HeapObject keys, so that the
     // marker does not break when marking EphemeronHashTable, see
     // MarkingVisitorBase::VisitEphemeronHashTable.
-    EphemeronHashTable table = EphemeronHashTable::cast(raw_obj);
-    MemsetTagged(table.RawField(table.kElementsStartOffset),
+    Tagged<EphemeronHashTable> table = EphemeronHashTable::cast(raw_obj);
+    MemsetTagged(table->RawField(table->kElementsStartOffset),
                  ReadOnlyRoots(isolate()).undefined_value(),
-                 (size_in_bytes - table.kElementsStartOffset) / kTaggedSize);
+                 (size_in_bytes - table->kElementsStartOffset) / kTaggedSize);
   }
 
 #ifdef DEBUG
   PtrComprCageBase cage_base(isolate());
   // We want to make sure that all embedder pointers are initialized to null.
-  if (raw_obj.IsJSObject(cage_base) &&
-      JSObject::cast(raw_obj).MayHaveEmbedderFields()) {
-    JSObject js_obj = JSObject::cast(raw_obj);
-    for (int i = 0; i < js_obj.GetEmbedderFieldCount(); ++i) {
+  if (IsJSObject(raw_obj, cage_base) &&
+      JSObject::cast(raw_obj)->MayHaveEmbedderFields()) {
+    Tagged<JSObject> js_obj = JSObject::cast(raw_obj);
+    for (int i = 0; i < js_obj->GetEmbedderFieldCount(); ++i) {
       void* pointer;
       CHECK(EmbedderDataSlot(js_obj, i).ToAlignedPointer(main_thread_isolate(),
                                                          &pointer));
       CHECK_NULL(pointer);
     }
-  } else if (raw_obj.IsEmbedderDataArray(cage_base)) {
-    EmbedderDataArray array = EmbedderDataArray::cast(raw_obj);
+  } else if (IsEmbedderDataArray(raw_obj, cage_base)) {
+    Tagged<EmbedderDataArray> array = EmbedderDataArray::cast(raw_obj);
     EmbedderDataSlot start(array, 0);
-    EmbedderDataSlot end(array, array.length());
+    EmbedderDataSlot end(array, array->length());
     for (EmbedderDataSlot slot = start; slot < end; ++slot) {
       void* pointer;
       CHECK(slot.ToAlignedPointer(main_thread_isolate(), &pointer));
@@ -679,7 +725,7 @@ Handle<HeapObject> Deserializer<IsolateT>::ReadObject(SnapshotSpace space) {
   PostProcessNewObject(map, obj, space);
 
 #ifdef DEBUG
-  if (obj->IsInstructionStream(cage_base)) {
+  if (IsInstructionStream(*obj, cage_base)) {
     DCHECK(space == SnapshotSpace::kCode ||
            space == SnapshotSpace::kReadOnlyHeap);
   } else {
@@ -696,18 +742,18 @@ Handle<HeapObject> Deserializer<IsolateT>::ReadMetaMap() {
   const int size_in_bytes = Map::kSize;
   const int size_in_tagged = size_in_bytes / kTaggedSize;
 
-  HeapObject raw_obj =
+  Tagged<HeapObject> raw_obj =
       Allocate(SpaceToAllocation(space), size_in_bytes, kTaggedAligned);
-  raw_obj.set_map_after_allocation(Map::unchecked_cast(raw_obj));
-  MemsetTagged(raw_obj.RawField(kTaggedSize),
+  raw_obj->set_map_after_allocation(Map::unchecked_cast(raw_obj));
+  MemsetTagged(raw_obj->RawField(kTaggedSize),
                Smi::uninitialized_deserialization_value(), size_in_tagged - 1);
-  DCHECK(raw_obj.CheckRequiredAlignment(isolate()));
+  DCHECK(raw_obj->CheckRequiredAlignment(isolate()));
 
   Handle<HeapObject> obj = handle(raw_obj, isolate());
   back_refs_.push_back(obj);
 
   // Set the instance-type manually, to allow backrefs to read it.
-  Map::unchecked_cast(*obj).set_instance_type(MAP_TYPE);
+  Map::unchecked_cast(*obj)->set_instance_type(MAP_TYPE);
 
   ReadData(obj, 1, size_in_tagged);
   PostProcessNewObject(Handle<Map>::cast(obj), obj, space);
@@ -715,101 +761,6 @@ Handle<HeapObject> Deserializer<IsolateT>::ReadMetaMap() {
   return obj;
 }
 
-class DeserializerRelocInfoVisitor {
- public:
-  DeserializerRelocInfoVisitor(Deserializer<Isolate>* deserializer,
-                               const std::vector<Handle<HeapObject>>* objects)
-      : deserializer_(deserializer), objects_(objects), current_object_(0) {}
-
-  DeserializerRelocInfoVisitor(Deserializer<LocalIsolate>* deserializer,
-                               const std::vector<Handle<HeapObject>>* objects) {
-    UNREACHABLE();
-  }
-
-  ~DeserializerRelocInfoVisitor() {
-    DCHECK_EQ(current_object_, objects_->size());
-  }
-
-  void VisitCodeTarget(RelocInfo* rinfo);
-  void VisitEmbeddedPointer(RelocInfo* rinfo);
-  void VisitExternalReference(RelocInfo* rinfo);
-  void VisitInternalReference(RelocInfo* rinfo);
-  void VisitOffHeapTarget(RelocInfo* rinfo);
-
- private:
-  Isolate* isolate() { return deserializer_->isolate(); }
-  SnapshotByteSource& source() { return deserializer_->source_; }
-
-  Deserializer<Isolate>* deserializer_;
-  const std::vector<Handle<HeapObject>>* objects_;
-  int current_object_;
-};
-
-void DeserializerRelocInfoVisitor::VisitCodeTarget(RelocInfo* rinfo) {
-  HeapObject object = *objects_->at(current_object_++);
-  rinfo->set_target_address(
-      InstructionStream::cast(object).instruction_start());
-}
-
-void DeserializerRelocInfoVisitor::VisitEmbeddedPointer(RelocInfo* rinfo) {
-  HeapObject object = *objects_->at(current_object_++);
-  // Embedded object reference must be a strong one.
-  rinfo->set_target_object(isolate()->heap(), object);
-}
-
-void DeserializerRelocInfoVisitor::VisitExternalReference(RelocInfo* rinfo) {
-  byte data = source().Get();
-  CHECK_EQ(data, Deserializer<Isolate>::kExternalReference);
-
-  Address address = deserializer_->ReadExternalReferenceCase();
-
-  if (rinfo->IsCodedSpecially()) {
-    Address location_of_branch_data = rinfo->pc();
-    Assembler::deserialization_set_special_target_at(location_of_branch_data,
-                                                     rinfo->code(), address);
-  } else {
-    WriteUnalignedValue(rinfo->target_address_address(), address);
-  }
-}
-
-void DeserializerRelocInfoVisitor::VisitInternalReference(RelocInfo* rinfo) {
-  byte data = source().Get();
-  CHECK_EQ(data, Deserializer<Isolate>::kInternalReference);
-
-  // An internal reference target is encoded as an offset from code entry.
-  int target_offset = source().GetInt();
-  static_assert(InstructionStream::kOnHeapBodyIsContiguous);
-  DCHECK_LT(static_cast<unsigned>(target_offset),
-            static_cast<unsigned>(rinfo->code().instruction_size()));
-  Address target = rinfo->code().InstructionStart() + target_offset;
-  Assembler::deserialization_set_target_internal_reference_at(
-      rinfo->pc(), target, rinfo->rmode());
-}
-
-void DeserializerRelocInfoVisitor::VisitOffHeapTarget(RelocInfo* rinfo) {
-  // Currently we don't serialize code that contains near builtin entries.
-  DCHECK_NE(rinfo->rmode(), RelocInfo::NEAR_BUILTIN_ENTRY);
-
-  byte data = source().Get();
-  CHECK_EQ(data, Deserializer<Isolate>::kOffHeapTarget);
-
-  Builtin builtin = Builtins::FromInt(source().GetInt());
-
-  CHECK_NOT_NULL(isolate()->embedded_blob_code());
-  EmbeddedData d = EmbeddedData::FromBlob(isolate());
-  Address address = d.InstructionStartOfBuiltin(builtin);
-  CHECK_NE(kNullAddress, address);
-
-  // TODO(ishell): implement RelocInfo::set_target_off_heap_target()
-  if (RelocInfo::OffHeapTargetIsCodedSpecially()) {
-    Address location_of_branch_data = rinfo->pc();
-    Assembler::deserialization_set_special_target_at(location_of_branch_data,
-                                                     rinfo->code(), address);
-  } else {
-    WriteUnalignedValue(rinfo->target_address_address(), address);
-  }
-}
-
 template <typename IsolateT>
 template <typename SlotAccessor>
 int Deserializer<IsolateT>::ReadRepeatedObject(SlotAccessor slot_accessor,
@@ -830,7 +781,7 @@ namespace {
 // Template used by the below CASE_RANGE macro to statically verify that the
 // given number of cases matches the number of expected cases for that bytecode.
 template <int byte_code_count, int expected>
-constexpr byte VerifyBytecodeCount(byte bytecode) {
+constexpr uint8_t VerifyBytecodeCount(uint8_t bytecode) {
   static_assert(byte_code_count == expected);
   return bytecode;
 }
@@ -864,7 +815,7 @@ void Deserializer<IsolateT>::ReadData(Handle<HeapObject> object,
                                       int end_slot_index) {
   int current = start_slot_index;
   while (current < end_slot_index) {
-    byte data = source_.Get();
+    uint8_t data = source_.Get();
     current += ReadSingleBytecodeData(
         data, SlotAccessorForHeapObject::ForSlotIndex(object, current));
   }
@@ -876,7 +827,7 @@ void Deserializer<IsolateT>::ReadData(FullMaybeObjectSlot start,
                                       FullMaybeObjectSlot end) {
   FullMaybeObjectSlot current = start;
   while (current < end) {
-    byte data = source_.Get();
+    uint8_t data = source_.Get();
     current += ReadSingleBytecodeData(data, SlotAccessorForRootSlots(current));
   }
   CHECK_EQ(current, end);
@@ -884,7 +835,7 @@ void Deserializer<IsolateT>::ReadData(FullMaybeObjectSlot start,
 
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadSingleBytecodeData(byte data,
+int Deserializer<IsolateT>::ReadSingleBytecodeData(uint8_t data,
                                                    SlotAccessor slot_accessor) {
   switch (data) {
     case CASE_RANGE_ALL_SPACES(kNewObject):
@@ -897,8 +848,6 @@ int Deserializer<IsolateT>::ReadSingleBytecodeData(byte data,
       return ReadRootArray(data, slot_accessor);
     case kStartupObjectCache:
       return ReadStartupObjectCache(data, slot_accessor);
-    case kReadOnlyObjectCache:
-      return ReadReadOnlyObjectCache(data, slot_accessor);
     case kSharedHeapObjectCache:
       return ReadSharedHeapObjectCache(data, slot_accessor);
     case kNewMetaMap:
@@ -907,12 +856,7 @@ int Deserializer<IsolateT>::ReadSingleBytecodeData(byte data,
     case kExternalReference:
       return ReadExternalReference(data, slot_accessor);
     case kSandboxedRawExternalReference:
-    case kRawExternalReference:
       return ReadRawExternalReference(data, slot_accessor);
-    case kInternalReference:
-    case kOffHeapTarget:
-      //  These bytecodes are expected only during RelocInfo iteration.
-      UNREACHABLE();
     case kAttachedReference:
       return ReadAttachedReference(data, slot_accessor);
     case kNop:
@@ -927,8 +871,6 @@ int Deserializer<IsolateT>::ReadSingleBytecodeData(byte data,
       UNREACHABLE();
     case kVariableRawData:
       return ReadVariableRawData(data, slot_accessor);
-    case kCodeBody:
-      return ReadCodeBody(data, slot_accessor);
     case kVariableRepeat:
       return ReadVariableRepeat(data, slot_accessor);
     case kOffHeapBackingStore:
@@ -941,6 +883,8 @@ int Deserializer<IsolateT>::ReadSingleBytecodeData(byte data,
       return ReadClearedWeakReference(data, slot_accessor);
     case kWeakPrefix:
       return ReadWeakPrefix(data, slot_accessor);
+    case kIndirectPointerPrefix:
+      return ReadIndirectPointerPrefix(data, slot_accessor);
     case CASE_RANGE(kRootArrayConstants, 32):
       return ReadRootArrayConstants(data, slot_accessor);
     case CASE_RANGE(kHotObject, 8):
@@ -969,86 +913,72 @@ int Deserializer<IsolateT>::ReadSingleBytecodeData(byte data,
 // object.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadNewObject(byte data,
+int Deserializer<IsolateT>::ReadNewObject(uint8_t data,
                                           SlotAccessor slot_accessor) {
   SnapshotSpace space = NewObject::Decode(data);
   DCHECK_IMPLIES(V8_STATIC_ROOTS_BOOL, space != SnapshotSpace::kReadOnlyHeap);
-  // Save the reference type before recursing down into reading the object.
-  HeapObjectReferenceType ref_type = GetAndResetNextReferenceType();
+  // Save the descriptor before recursing down into reading the object.
+  ReferenceDescriptor descr = GetAndResetNextReferenceDescriptor();
   Handle<HeapObject> heap_object = ReadObject(space);
-  return slot_accessor.Write(heap_object, ref_type);
+  return WriteHeapPointer(slot_accessor, heap_object, descr);
 }
 
 // Find a recently deserialized object using its offset from the current
 // allocation point and write a pointer to it to the current object.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadBackref(byte data, SlotAccessor slot_accessor) {
+int Deserializer<IsolateT>::ReadBackref(uint8_t data,
+                                        SlotAccessor slot_accessor) {
   Handle<HeapObject> heap_object = GetBackReferencedObject();
-  return slot_accessor.Write(heap_object, GetAndResetNextReferenceType());
+  return WriteHeapPointer(slot_accessor, heap_object,
+                          GetAndResetNextReferenceDescriptor());
 }
 
-// Reference an object in the read-only heap. This should be used when an
-// object is read-only, but is not a root. Except with static roots we
-// always use this reference to refer to read only objects since they are
-// created by loading a memory dump of r/o space.
+// Reference an object in the read-only heap.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadReadOnlyHeapRef(byte data,
+int Deserializer<IsolateT>::ReadReadOnlyHeapRef(uint8_t data,
                                                 SlotAccessor slot_accessor) {
-  DCHECK(isolate()->heap()->deserialization_complete() || V8_STATIC_ROOTS_BOOL);
-  uint32_t chunk_index = source_.GetInt();
-  uint32_t chunk_offset = source_.GetInt();
+  uint32_t chunk_index = source_.GetUint30();
+  uint32_t chunk_offset = source_.GetUint30();
 
   ReadOnlySpace* read_only_space = isolate()->heap()->read_only_space();
   ReadOnlyPage* page = read_only_space->pages()[chunk_index];
   Address address = page->OffsetToAddress(chunk_offset);
-  HeapObject heap_object = HeapObject::FromAddress(address);
+  Tagged<HeapObject> heap_object = HeapObject::FromAddress(address);
 
-  return slot_accessor.Write(heap_object, GetAndResetNextReferenceType());
+  return WriteHeapPointer(slot_accessor, heap_object,
+                          GetAndResetNextReferenceDescriptor());
 }
 
 // Find an object in the roots array and write a pointer to it to the
 // current object.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadRootArray(byte data,
+int Deserializer<IsolateT>::ReadRootArray(uint8_t data,
                                           SlotAccessor slot_accessor) {
-  int id = source_.GetInt();
+  int id = source_.GetUint30();
   RootIndex root_index = static_cast<RootIndex>(id);
   Handle<HeapObject> heap_object =
       Handle<HeapObject>::cast(isolate()->root_handle(root_index));
   hot_objects_.Add(heap_object);
-  return slot_accessor.Write(heap_object, GetAndResetNextReferenceType());
+  return WriteHeapPointer(slot_accessor, heap_object,
+                          GetAndResetNextReferenceDescriptor());
 }
 
 // Find an object in the startup object cache and write a pointer to it to
 // the current object.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadStartupObjectCache(byte data,
+int Deserializer<IsolateT>::ReadStartupObjectCache(uint8_t data,
                                                    SlotAccessor slot_accessor) {
-  int cache_index = source_.GetInt();
+  int cache_index = source_.GetUint30();
   // TODO(leszeks): Could we use the address of the startup_object_cache
   // entry as a Handle backing?
-  HeapObject heap_object = HeapObject::cast(
+  Tagged<HeapObject> heap_object = HeapObject::cast(
       main_thread_isolate()->startup_object_cache()->at(cache_index));
-  return slot_accessor.Write(heap_object, GetAndResetNextReferenceType());
-}
-
-// Find an object in the read-only object cache and write a pointer to it
-// to the current object.
-template <typename IsolateT>
-template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadReadOnlyObjectCache(
-    byte data, SlotAccessor slot_accessor) {
-  DCHECK(!V8_STATIC_ROOTS_BOOL);
-  int cache_index = source_.GetInt();
-  // TODO(leszeks): Could we use the address of the cached_read_only_object
-  // entry as a Handle backing?
-  HeapObject heap_object = HeapObject::cast(
-      isolate()->read_only_heap()->cached_read_only_object(cache_index));
-  return slot_accessor.Write(heap_object, GetAndResetNextReferenceType());
+  return WriteHeapPointer(slot_accessor, heap_object,
+                          GetAndResetNextReferenceDescriptor());
 }
 
 // Find an object in the shared heap object cache and write a pointer to it
@@ -1056,21 +986,22 @@ int Deserializer<IsolateT>::ReadReadOnlyObjectCache(
 template <typename IsolateT>
 template <typename SlotAccessor>
 int Deserializer<IsolateT>::ReadSharedHeapObjectCache(
-    byte data, SlotAccessor slot_accessor) {
-  int cache_index = source_.GetInt();
+    uint8_t data, SlotAccessor slot_accessor) {
+  int cache_index = source_.GetUint30();
   // TODO(leszeks): Could we use the address of the
   // shared_heap_object_cache entry as a Handle backing?
-  HeapObject heap_object = HeapObject::cast(
+  Tagged<HeapObject> heap_object = HeapObject::cast(
       main_thread_isolate()->shared_heap_object_cache()->at(cache_index));
   DCHECK(SharedHeapSerializer::ShouldBeInSharedHeapObjectCache(heap_object));
-  return slot_accessor.Write(heap_object, GetAndResetNextReferenceType());
+  return WriteHeapPointer(slot_accessor, heap_object,
+                          GetAndResetNextReferenceDescriptor());
 }
 
 // Deserialize a new meta-map and write a pointer to it to the current
 // object.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadNewMetaMap(byte data,
+int Deserializer<IsolateT>::ReadNewMetaMap(uint8_t data,
                                            SlotAccessor slot_accessor) {
   Handle<HeapObject> heap_object = ReadMetaMap();
   return slot_accessor.Write(heap_object, HeapObjectReferenceType::STRONG);
@@ -1080,7 +1011,7 @@ int Deserializer<IsolateT>::ReadNewMetaMap(byte data,
 // object.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadExternalReference(byte data,
+int Deserializer<IsolateT>::ReadExternalReference(uint8_t data,
                                                   SlotAccessor slot_accessor) {
   DCHECK_IMPLIES(data == kSandboxedExternalReference, V8_ENABLE_SANDBOX_BOOL);
   Address address = ReadExternalReferenceCase();
@@ -1095,7 +1026,7 @@ int Deserializer<IsolateT>::ReadExternalReference(byte data,
 template <typename IsolateT>
 template <typename SlotAccessor>
 int Deserializer<IsolateT>::ReadRawExternalReference(
-    byte data, SlotAccessor slot_accessor) {
+    uint8_t data, SlotAccessor slot_accessor) {
   DCHECK_IMPLIES(data == kSandboxedExternalReference, V8_ENABLE_SANDBOX_BOOL);
   Address address;
   source_.CopyRaw(&address, kSystemPointerSize);
@@ -1111,20 +1042,22 @@ int Deserializer<IsolateT>::ReadRawExternalReference(
 // the current object.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadAttachedReference(byte data,
+int Deserializer<IsolateT>::ReadAttachedReference(uint8_t data,
                                                   SlotAccessor slot_accessor) {
-  int index = source_.GetInt();
+  int index = source_.GetUint30();
   Handle<HeapObject> heap_object = attached_objects_[index];
-  return slot_accessor.Write(heap_object, GetAndResetNextReferenceType());
+  return WriteHeapPointer(slot_accessor, heap_object,
+                          GetAndResetNextReferenceDescriptor());
 }
 
 template <typename IsolateT>
 template <typename SlotAccessor>
 int Deserializer<IsolateT>::ReadRegisterPendingForwardRef(
-    byte data, SlotAccessor slot_accessor) {
-  HeapObjectReferenceType ref_type = GetAndResetNextReferenceType();
+    uint8_t data, SlotAccessor slot_accessor) {
+  ReferenceDescriptor descr = GetAndResetNextReferenceDescriptor();
+  DCHECK(!descr.is_indirect_pointer);
   unresolved_forward_refs_.emplace_back(slot_accessor.object(),
-                                        slot_accessor.offset(), ref_type);
+                                        slot_accessor.offset(), descr.type);
   num_unresolved_forward_refs_++;
   return 1;
 }
@@ -1132,13 +1065,13 @@ int Deserializer<IsolateT>::ReadRegisterPendingForwardRef(
 template <typename IsolateT>
 template <typename SlotAccessor>
 int Deserializer<IsolateT>::ReadResolvePendingForwardRef(
-    byte data, SlotAccessor slot_accessor) {
+    uint8_t data, SlotAccessor slot_accessor) {
   // Pending forward refs can only be resolved after the heap object's map
   // field is deserialized; currently they only appear immediately after
   // the map field.
   DCHECK_EQ(slot_accessor.offset(), HeapObject::kHeaderSize);
   Handle<HeapObject> obj = slot_accessor.object();
-  int index = source_.GetInt();
+  int index = source_.GetUint30();
   auto& forward_ref = unresolved_forward_refs_[index];
   SlotAccessorForHeapObject::ForSlotOffset(forward_ref.object,
                                            forward_ref.offset)
@@ -1158,106 +1091,38 @@ int Deserializer<IsolateT>::ReadResolvePendingForwardRef(
 // Deserialize raw data of variable length.
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadVariableRawData(byte data,
+int Deserializer<IsolateT>::ReadVariableRawData(uint8_t data,
                                                 SlotAccessor slot_accessor) {
   // This operation is only supported for tagged-size slots, else we might
   // become misaligned.
   DCHECK_EQ(decltype(slot_accessor.slot())::kSlotDataSize, kTaggedSize);
-  int size_in_tagged = source_.GetInt();
+  int size_in_tagged = source_.GetUint30();
   // TODO(leszeks): Only copy slots when there are Smis in the serialized
   // data.
   source_.CopySlots(slot_accessor.slot().location(), size_in_tagged);
   return size_in_tagged;
 }
 
-// Custom deserialization for a Code object and its associated InstructionStream
-// object.
-template <typename IsolateT>
-template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadCodeBody(byte data,
-                                         SlotAccessor slot_accessor) {
-  // This operation is only supported for tagged-size slots, else we might
-  // become misaligned.
-  DCHECK_EQ(decltype(slot_accessor.slot())::kSlotDataSize, kTaggedSize);
-  // CodeBody can only occur right after the heap object header.
-  DCHECK_EQ(slot_accessor.offset(), HeapObject::kHeaderSize);
-
-  int size_in_tagged = source_.GetInt();
-  int size_in_bytes = size_in_tagged * kTaggedSize;
-
-  {
-    DisallowGarbageCollection no_gc;
-    InstructionStream istream =
-        InstructionStream::cast(*slot_accessor.object());
-
-    // First deserialize the untagged region of the InstructionStream object.
-    source_.CopyRaw(reinterpret_cast<void*>(istream.address() +
-                                            InstructionStream::kDataStart),
-                    size_in_bytes);
-  }
-
-  // Then deserialize the InstructionStream header
-  ReadData(slot_accessor.object(), HeapObject::kHeaderSize / kTaggedSize,
-           InstructionStream::kDataStart / kTaggedSize);
-
-  // Then deserialize the pre-serialized RelocInfo objects.
-  std::vector<Handle<HeapObject>> preserialized_objects;
-  while (source_.Peek() != kSynchronize) {
-    Handle<HeapObject> obj = ReadObject();
-    preserialized_objects.push_back(obj);
-  }
-  // Skip the synchronize bytecode.
-  source_.Advance(1);
-
-  // Finally iterate RelocInfos (the same way it was done by the serializer)
-  // and deserialize respective data into RelocInfos. The RelocIterator
-  // holds a raw pointer to the code, so we have to disable garbage
-  // collection here. It's ok though, any objects it would have needed are
-  // in the preserialized_objects vector.
-  {
-    DisallowGarbageCollection no_gc;
-
-    InstructionStream istream =
-        InstructionStream::cast(*slot_accessor.object());
-    if (V8_EXTERNAL_CODE_SPACE_BOOL) {
-      istream.set_main_cage_base(isolate()->cage_base(), kRelaxedStore);
-    }
-    Code code = istream.code(kAcquireLoad);
-    DeserializerRelocInfoVisitor visitor(this, &preserialized_objects);
-    for (RelocIterator it(code, istream, code.relocation_info(),
-                          code.constant_pool(),
-                          InstructionStream::BodyDescriptor::kRelocModeMask);
-         !it.done(); it.next()) {
-      it.rinfo()->Visit(&visitor);
-    }
-  }
-
-  // Advance to the end of the code object.
-  return (int{InstructionStream::kDataStart} - HeapObject::kHeaderSize) /
-             kTaggedSize +
-         size_in_tagged;
-}
-
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadVariableRepeat(byte data,
+int Deserializer<IsolateT>::ReadVariableRepeat(uint8_t data,
                                                SlotAccessor slot_accessor) {
-  int repeats = VariableRepeatCount::Decode(source_.GetInt());
+  int repeats = VariableRepeatCount::Decode(source_.GetUint30());
   return ReadRepeatedObject(slot_accessor, repeats);
 }
 
 template <typename IsolateT>
 template <typename SlotAccessor>
 int Deserializer<IsolateT>::ReadOffHeapBackingStore(
-    byte data, SlotAccessor slot_accessor) {
-  int byte_length = source_.GetInt();
+    uint8_t data, SlotAccessor slot_accessor) {
+  int byte_length = source_.GetUint32();
   std::unique_ptr<BackingStore> backing_store;
   if (data == kOffHeapBackingStore) {
     backing_store = BackingStore::Allocate(main_thread_isolate(), byte_length,
                                            SharedFlag::kNotShared,
                                            InitializedFlag::kUninitialized);
   } else {
-    int max_byte_length = source_.GetInt();
+    int max_byte_length = source_.GetUint32();
     size_t page_size, initial_pages, max_pages;
     Maybe<bool> result =
         JSArrayBuffer::GetResizableBackingStorePageConfiguration(
@@ -1278,10 +1143,10 @@ int Deserializer<IsolateT>::ReadOffHeapBackingStore(
 
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadApiReference(byte data,
+int Deserializer<IsolateT>::ReadApiReference(uint8_t data,
                                              SlotAccessor slot_accessor) {
-  DCHECK_IMPLIES(data == kSandboxedExternalReference, V8_ENABLE_SANDBOX_BOOL);
-  uint32_t reference_id = static_cast<uint32_t>(source_.GetInt());
+  DCHECK_IMPLIES(data == kSandboxedApiReference, V8_ENABLE_SANDBOX_BOOL);
+  uint32_t reference_id = static_cast<uint32_t>(source_.GetUint30());
   Address address;
   if (main_thread_isolate()->api_external_references()) {
     DCHECK_WITH_MSG(reference_id < num_api_references_,
@@ -1302,13 +1167,13 @@ int Deserializer<IsolateT>::ReadApiReference(byte data,
 template <typename IsolateT>
 template <typename SlotAccessor>
 int Deserializer<IsolateT>::ReadClearedWeakReference(
-    byte data, SlotAccessor slot_accessor) {
+    uint8_t data, SlotAccessor slot_accessor) {
   return slot_accessor.Write(HeapObjectReference::ClearedValue(isolate()));
 }
 
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadWeakPrefix(byte data,
+int Deserializer<IsolateT>::ReadWeakPrefix(uint8_t data,
                                            SlotAccessor slot_accessor) {
   // We shouldn't have two weak prefixes in a row.
   DCHECK(!next_reference_is_weak_);
@@ -1320,7 +1185,19 @@ int Deserializer<IsolateT>::ReadWeakPrefix(byte data,
 
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadRootArrayConstants(byte data,
+int Deserializer<IsolateT>::ReadIndirectPointerPrefix(
+    uint8_t data, SlotAccessor slot_accessor) {
+  // We shouldn't have two indirect pointer prefixes in a row.
+  DCHECK(!next_reference_is_indirect_pointer_);
+  // We shouldn't have a indirect pointer prefix without a current object.
+  DCHECK_NE(slot_accessor.object()->address(), kNullAddress);
+  next_reference_is_indirect_pointer_ = true;
+  return 0;
+}
+
+template <typename IsolateT>
+template <typename SlotAccessor>
+int Deserializer<IsolateT>::ReadRootArrayConstants(uint8_t data,
                                                    SlotAccessor slot_accessor) {
   // First kRootArrayConstantsCount roots are guaranteed to be in
   // the old space.
@@ -1336,16 +1213,17 @@ int Deserializer<IsolateT>::ReadRootArrayConstants(byte data,
 
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadHotObject(byte data,
+int Deserializer<IsolateT>::ReadHotObject(uint8_t data,
                                           SlotAccessor slot_accessor) {
   int index = HotObject::Decode(data);
   Handle<HeapObject> hot_object = hot_objects_.Get(index);
-  return slot_accessor.Write(hot_object, GetAndResetNextReferenceType());
+  return WriteHeapPointer(slot_accessor, hot_object,
+                          GetAndResetNextReferenceDescriptor());
 }
 
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadFixedRawData(byte data,
+int Deserializer<IsolateT>::ReadFixedRawData(uint8_t data,
                                              SlotAccessor slot_accessor) {
   using TSlot = decltype(slot_accessor.slot());
 
@@ -1366,7 +1244,7 @@ int Deserializer<IsolateT>::ReadFixedRawData(byte data,
 
 template <typename IsolateT>
 template <typename SlotAccessor>
-int Deserializer<IsolateT>::ReadFixedRepeat(byte data,
+int Deserializer<IsolateT>::ReadFixedRepeat(uint8_t data,
                                             SlotAccessor slot_accessor) {
   int repeats = FixedRepeatWithCount::Decode(data);
   return ReadRepeatedObject(slot_accessor, repeats);
@@ -1384,21 +1262,21 @@ int Deserializer<IsolateT>::ReadFixedRepeat(byte data,
 
 template <typename IsolateT>
 Address Deserializer<IsolateT>::ReadExternalReferenceCase() {
-  uint32_t reference_id = static_cast<uint32_t>(source_.GetInt());
+  uint32_t reference_id = static_cast<uint32_t>(source_.GetUint30());
   return main_thread_isolate()->external_reference_table()->address(
       reference_id);
 }
 
 template <typename IsolateT>
 ExternalPointerTag Deserializer<IsolateT>::ReadExternalPointerTag() {
-  uint64_t shifted_tag = static_cast<uint64_t>(source_.GetInt());
+  uint64_t shifted_tag = static_cast<uint64_t>(source_.GetUint30());
   return static_cast<ExternalPointerTag>(shifted_tag
                                          << kExternalPointerTagShift);
 }
 
 template <typename IsolateT>
-HeapObject Deserializer<IsolateT>::Allocate(AllocationType allocation, int size,
-                                            AllocationAlignment alignment) {
+Tagged<HeapObject> Deserializer<IsolateT>::Allocate(
+    AllocationType allocation, int size, AllocationAlignment alignment) {
 #ifdef DEBUG
   if (!previous_allocation_obj_.is_null()) {
     // Make sure that the previous object is initialized sufficiently to
@@ -1408,8 +1286,9 @@ HeapObject Deserializer<IsolateT>::Allocate(AllocationType allocation, int size,
   }
 #endif
 
-  HeapObject obj = HeapObject::FromAddress(isolate()->heap()->AllocateRawOrFail(
-      size, allocation, AllocationOrigin::kRuntime, alignment));
+  Tagged<HeapObject> obj =
+      HeapObject::FromAddress(isolate()->heap()->AllocateRawOrFail(
+          size, allocation, AllocationOrigin::kRuntime, alignment));
 
 #ifdef DEBUG
   previous_allocation_obj_ = handle(obj, isolate());
diff --git a/deps/v8/src/snapshot/deserializer.h b/deps/v8/src/snapshot/deserializer.h
index c2e8c58f576636..b298b042970ed3 100644
--- a/deps/v8/src/snapshot/deserializer.h
+++ b/deps/v8/src/snapshot/deserializer.h
@@ -49,7 +49,7 @@ class Deserializer : public SerializerDeserializer {
 
  protected:
   // Create a deserializer from a snapshot byte source.
-  Deserializer(IsolateT* isolate, base::Vector<const byte> payload,
+  Deserializer(IsolateT* isolate, base::Vector<const uint8_t> payload,
                uint32_t magic_number, bool deserializing_user_code,
                bool can_rehash);
 
@@ -57,7 +57,7 @@ class Deserializer : public SerializerDeserializer {
 
   // Create Log events for newly deserialized objects.
   void LogNewObjectEvents();
-  void LogScriptEvents(Script script);
+  void LogScriptEvents(Tagged<Script> script);
   void LogNewMapEvents();
 
   // Descriptor arrays are deserialized as "strong", so that there is no risk of
@@ -113,7 +113,6 @@ class Deserializer : public SerializerDeserializer {
   Handle<HeapObject> ReadObject();
 
  private:
-  friend class DeserializerRelocInfoVisitor;
   // A circular queue of hot objects. This is added to in the same order as in
   // Serializer::HotObjectsList, but this stores the objects as a vector of
   // existing handles. This allows us to add Handles to the queue without having
@@ -143,16 +142,29 @@ class Deserializer : public SerializerDeserializer {
     int index_ = 0;
   };
 
+  struct ReferenceDescriptor {
+    HeapObjectReferenceType type;
+    bool is_indirect_pointer;
+  };
+
   void VisitRootPointers(Root root, const char* description,
                          FullObjectSlot start, FullObjectSlot end) override;
 
   void Synchronize(VisitorSynchronization::SyncTag tag) override;
 
-  template <typename TSlot>
-  inline int WriteAddress(TSlot dest, Address value);
+  template <typename SlotAccessor>
+  int WriteHeapPointer(SlotAccessor slot_accessor,
+                       Tagged<HeapObject> heap_object,
+                       ReferenceDescriptor descr);
+  template <typename SlotAccessor>
+  int WriteHeapPointer(SlotAccessor slot_accessor,
+                       Handle<HeapObject> heap_object,
+                       ReferenceDescriptor descr);
 
   inline int WriteExternalPointer(ExternalPointerSlot dest, Address value,
                                   ExternalPointerTag tag);
+  inline int WriteIndirectPointer(IndirectPointerSlot dest,
+                                  Tagged<HeapObject> value);
 
   // Fills in a heap object's data from start to end (exclusive). Start and end
   // are slot indices within the object.
@@ -167,56 +179,54 @@ class Deserializer : public SerializerDeserializer {
   // data into the given slot. May fill in zero or multiple slots, so it returns
   // the number of slots filled.
   template <typename SlotAccessor>
-  int ReadSingleBytecodeData(byte data, SlotAccessor slot_accessor);
+  int ReadSingleBytecodeData(uint8_t data, SlotAccessor slot_accessor);
 
   template <typename SlotAccessor>
-  int ReadNewObject(byte data, SlotAccessor slot_accessor);
-  template <typename SlotAccessor>
-  int ReadBackref(byte data, SlotAccessor slot_accessor);
+  int ReadNewObject(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadReadOnlyHeapRef(byte data, SlotAccessor slot_accessor);
+  int ReadBackref(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadRootArray(byte data, SlotAccessor slot_accessor);
+  int ReadReadOnlyHeapRef(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadStartupObjectCache(byte data, SlotAccessor slot_accessor);
+  int ReadRootArray(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadReadOnlyObjectCache(byte data, SlotAccessor slot_accessor);
+  int ReadStartupObjectCache(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadSharedHeapObjectCache(byte data, SlotAccessor slot_accessor);
+  int ReadSharedHeapObjectCache(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadNewMetaMap(byte data, SlotAccessor slot_accessor);
+  int ReadNewMetaMap(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadExternalReference(byte data, SlotAccessor slot_accessor);
+  int ReadExternalReference(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadRawExternalReference(byte data, SlotAccessor slot_accessor);
+  int ReadRawExternalReference(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadAttachedReference(byte data, SlotAccessor slot_accessor);
+  int ReadAttachedReference(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadRegisterPendingForwardRef(byte data, SlotAccessor slot_accessor);
+  int ReadRegisterPendingForwardRef(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadResolvePendingForwardRef(byte data, SlotAccessor slot_accessor);
+  int ReadResolvePendingForwardRef(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadVariableRawData(byte data, SlotAccessor slot_accessor);
+  int ReadVariableRawData(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadCodeBody(byte data, SlotAccessor slot_accessor);
+  int ReadVariableRepeat(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadVariableRepeat(byte data, SlotAccessor slot_accessor);
+  int ReadOffHeapBackingStore(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadOffHeapBackingStore(byte data, SlotAccessor slot_accessor);
+  int ReadApiReference(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadApiReference(byte data, SlotAccessor slot_accessor);
+  int ReadClearedWeakReference(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadClearedWeakReference(byte data, SlotAccessor slot_accessor);
+  int ReadWeakPrefix(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadWeakPrefix(byte data, SlotAccessor slot_accessor);
+  int ReadIndirectPointerPrefix(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadRootArrayConstants(byte data, SlotAccessor slot_accessor);
+  int ReadRootArrayConstants(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadHotObject(byte data, SlotAccessor slot_accessor);
+  int ReadHotObject(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadFixedRawData(byte data, SlotAccessor slot_accessor);
+  int ReadFixedRawData(uint8_t data, SlotAccessor slot_accessor);
   template <typename SlotAccessor>
-  int ReadFixedRepeat(byte data, SlotAccessor slot_accessor);
+  int ReadFixedRepeat(uint8_t data, SlotAccessor slot_accessor);
 
   // A helper function for ReadData for reading external references.
   inline Address ReadExternalReferenceCase();
@@ -227,7 +237,7 @@ class Deserializer : public SerializerDeserializer {
   Handle<HeapObject> ReadObject(SnapshotSpace space_number);
   Handle<HeapObject> ReadMetaMap();
 
-  HeapObjectReferenceType GetAndResetNextReferenceType();
+  ReferenceDescriptor GetAndResetNextReferenceDescriptor();
 
   template <typename SlotGetter>
   int ReadRepeatedObject(SlotGetter slot_getter, int repeat_count);
@@ -235,12 +245,12 @@ class Deserializer : public SerializerDeserializer {
   // Special handling for serialized code like hooking up internalized strings.
   void PostProcessNewObject(Handle<Map> map, Handle<HeapObject> obj,
                             SnapshotSpace space);
-  void PostProcessNewJSReceiver(Map map, Handle<JSReceiver> obj,
+  void PostProcessNewJSReceiver(Tagged<Map> map, Handle<JSReceiver> obj,
                                 InstanceType instance_type,
                                 SnapshotSpace space);
 
-  HeapObject Allocate(AllocationType allocation, int size,
-                      AllocationAlignment alignment);
+  Tagged<HeapObject> Allocate(AllocationType allocation, int size,
+                              AllocationAlignment alignment);
 
   // Cached current isolate.
   IsolateT* isolate_;
@@ -288,6 +298,7 @@ class Deserializer : public SerializerDeserializer {
   const bool deserializing_user_code_;
 
   bool next_reference_is_weak_ = false;
+  bool next_reference_is_indirect_pointer_ = false;
 
   // TODO(6593): generalize rehashing, and remove this flag.
   const bool should_rehash_;
@@ -333,7 +344,7 @@ class StringTableInsertionKey final : public StringTableKey {
       DeserializingUserCodeOption deserializing_user_code);
 
   template <typename IsolateT>
-  bool IsMatch(IsolateT* isolate, String string);
+  bool IsMatch(IsolateT* isolate, Tagged<String> string);
 
   void PrepareForInsertion(Isolate* isolate) {
     // When sharing the string table, all string table lookups during snapshot
diff --git a/deps/v8/src/snapshot/embedded/embedded-data-inl.h b/deps/v8/src/snapshot/embedded/embedded-data-inl.h
index 028bdd0713476f..3d0588e0e5c84e 100644
--- a/deps/v8/src/snapshot/embedded/embedded-data-inl.h
+++ b/deps/v8/src/snapshot/embedded/embedded-data-inl.h
@@ -10,18 +10,7 @@
 namespace v8 {
 namespace internal {
 
-bool EmbeddedData::BuiltinContains(Builtin builtin, Address pc) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  Address start =
-      reinterpret_cast<Address>(RawCode() + desc.instruction_offset);
-  DCHECK_LT(start, reinterpret_cast<Address>(code_ + code_size_));
-  if (pc < start) return false;
-  Address end = start + desc.instruction_length;
-  return pc < end;
-}
-
-Address EmbeddedData::InstructionStartOfBuiltin(Builtin builtin) const {
+Address EmbeddedData::InstructionStartOf(Builtin builtin) const {
   DCHECK(Builtins::IsBuiltinId(builtin));
   const struct LayoutDescription& desc = LayoutDescription(builtin);
   const uint8_t* result = RawCode() + desc.instruction_offset;
@@ -38,13 +27,13 @@ Address EmbeddedData::InstructionEndOf(Builtin builtin) const {
   return reinterpret_cast<Address>(result);
 }
 
-uint32_t EmbeddedData::InstructionSizeOfBuiltin(Builtin builtin) const {
+uint32_t EmbeddedData::InstructionSizeOf(Builtin builtin) const {
   DCHECK(Builtins::IsBuiltinId(builtin));
   const struct LayoutDescription& desc = LayoutDescription(builtin);
   return desc.instruction_length;
 }
 
-Address EmbeddedData::MetadataStartOfBuiltin(Builtin builtin) const {
+Address EmbeddedData::MetadataStartOf(Builtin builtin) const {
   DCHECK(Builtins::IsBuiltinId(builtin));
   const struct LayoutDescription& desc = LayoutDescription(builtin);
   const uint8_t* result = RawMetadata() + desc.metadata_offset;
@@ -52,130 +41,18 @@ Address EmbeddedData::MetadataStartOfBuiltin(Builtin builtin) const {
   return reinterpret_cast<Address>(result);
 }
 
-uint32_t EmbeddedData::MetadataSizeOfBuiltin(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  return desc.metadata_length;
-}
-
-Address EmbeddedData::SafepointTableStartOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  const uint8_t* result = RawMetadata() + desc.metadata_offset;
-  DCHECK_LE(desc.handler_table_offset, data_size_);
-  return reinterpret_cast<Address>(result);
-}
-
-uint32_t EmbeddedData::SafepointTableSizeOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-#if V8_EMBEDDED_CONSTANT_POOL_BOOL
-  DCHECK_LE(desc.handler_table_offset, desc.constant_pool_offset);
-#else
-  DCHECK_LE(desc.handler_table_offset, desc.code_comments_offset_offset);
-#endif
-  return desc.handler_table_offset - desc.metadata_offset;
-}
-
-Address EmbeddedData::HandlerTableStartOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  const uint8_t* result = RawMetadata() + desc.handler_table_offset;
-  DCHECK_LE(desc.handler_table_offset, data_size_);
-  return reinterpret_cast<Address>(result);
-}
-
-uint32_t EmbeddedData::HandlerTableSizeOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-#if V8_EMBEDDED_CONSTANT_POOL_BOOL
-  DCHECK_LE(desc.handler_table_offset, desc.constant_pool_offset);
-  return desc.constant_pool_offset - desc.handler_table_offset;
-#else
-  DCHECK_LE(desc.handler_table_offset, desc.code_comments_offset_offset);
-  return desc.code_comments_offset_offset - desc.handler_table_offset;
-#endif
-}
-
-Address EmbeddedData::ConstantPoolStartOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-#if V8_EMBEDDED_CONSTANT_POOL_BOOL
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  const uint8_t* result = RawMetadata() + desc.constant_pool_offset;
-  DCHECK_LE(desc.constant_pool_offset, data_size_);
-  return reinterpret_cast<Address>(result);
-#else
-  return kNullAddress;
-#endif
-}
-
-uint32_t EmbeddedData::ConstantPoolSizeOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-#if V8_EMBEDDED_CONSTANT_POOL_BOOL
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  DCHECK_LE(desc.constant_pool_offset, desc.code_comments_offset_offset);
-  return desc.code_comments_offset_offset - desc.constant_pool_offset;
-#else
-  return 0;
-#endif
-}
-
-Address EmbeddedData::CodeCommentsStartOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  const uint8_t* result = RawMetadata() + desc.code_comments_offset_offset;
-  DCHECK_LE(desc.code_comments_offset_offset, data_size_);
-  return reinterpret_cast<Address>(result);
-}
-
-uint32_t EmbeddedData::CodeCommentsSizeOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  DCHECK_LE(desc.code_comments_offset_offset,
-            desc.unwinding_info_offset_offset);
-  return desc.unwinding_info_offset_offset - desc.code_comments_offset_offset;
-}
-
-Address EmbeddedData::UnwindingInfoStartOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  const uint8_t* result = RawMetadata() + desc.unwinding_info_offset_offset;
-  DCHECK_LE(desc.unwinding_info_offset_offset, data_size_);
-  return reinterpret_cast<Address>(result);
-}
-
-uint32_t EmbeddedData::UnwindingInfoSizeOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  uint32_t metadata_end_offset = desc.metadata_offset + desc.metadata_length;
-  DCHECK_LE(desc.unwinding_info_offset_offset, metadata_end_offset);
-  return metadata_end_offset - desc.unwinding_info_offset_offset;
-}
-
-uint32_t EmbeddedData::StackSlotsOf(Builtin builtin) const {
-  DCHECK(Builtins::IsBuiltinId(builtin));
-  const struct LayoutDescription& desc = LayoutDescription(builtin);
-  return desc.stack_slots;
-}
-
 Address EmbeddedData::InstructionStartOfBytecodeHandlers() const {
-  return InstructionStartOfBuiltin(Builtin::kFirstBytecodeHandler);
+  return InstructionStartOf(Builtin::kFirstBytecodeHandler);
 }
 
 Address EmbeddedData::InstructionEndOfBytecodeHandlers() const {
-  static_assert(static_cast<int>(Builtin::kFirstBytecodeHandler) +
-                    kNumberOfBytecodeHandlers +
-                    2 * kNumberOfWideBytecodeHandlers ==
-                Builtins::kBuiltinCount);
-  Builtin lastBytecodeHandler = Builtins::FromInt(Builtins::kBuiltinCount - 1);
-  return InstructionStartOfBuiltin(lastBytecodeHandler) +
-         InstructionSizeOfBuiltin(lastBytecodeHandler);
+  static_assert(Builtins::kBytecodeHandlersAreSortedLast);
+  // Note this also includes trailing padding, but that's fine for our purposes.
+  return reinterpret_cast<Address>(code_ + code_size_);
 }
 
-// Padded with kCodeAlignment.
-// TODO(v8:11045): Consider removing code alignment.
-uint32_t EmbeddedData::PaddedInstructionSizeOfBuiltin(Builtin builtin) const {
-  uint32_t size = InstructionSizeOfBuiltin(builtin);
+uint32_t EmbeddedData::PaddedInstructionSizeOf(Builtin builtin) const {
+  uint32_t size = InstructionSizeOf(builtin);
   CHECK_NE(size, 0);
   return PadAndAlignCode(size);
 }
diff --git a/deps/v8/src/snapshot/embedded/embedded-data.cc b/deps/v8/src/snapshot/embedded/embedded-data.cc
index d7193d02d23e82..fb3642c959579d 100644
--- a/deps/v8/src/snapshot/embedded/embedded-data.cc
+++ b/deps/v8/src/snapshot/embedded/embedded-data.cc
@@ -8,44 +8,35 @@
 #include "src/codegen/callable.h"
 #include "src/snapshot/embedded/embedded-data-inl.h"
 #include "src/snapshot/snapshot-utils.h"
+#include "src/snapshot/sort-builtins.h"
 
 namespace v8 {
 namespace internal {
 
-namespace {
-
-Builtin TryLookupCode(const EmbeddedData& d, Address address) {
-  if (!d.IsInCodeRange(address)) return Builtin::kNoBuiltinId;
-
-  if (address < d.InstructionStartOfBuiltin(static_cast<Builtin>(0))) {
-    return Builtin::kNoBuiltinId;
-  }
+Builtin EmbeddedData::TryLookupCode(Address address) const {
+  if (!IsInCodeRange(address)) return Builtin::kNoBuiltinId;
 
   // Note: Addresses within the padding section between builtins (i.e. within
   // start + size <= address < start + padded_size) are interpreted as belonging
   // to the preceding builtin.
-
-  int l = 0, r = Builtins::kBuiltinCount;
-  while (l < r) {
-    const int mid = (l + r) / 2;
-    const Builtin builtin = Builtins::FromInt(mid);
-    Address start = d.InstructionStartOfBuiltin(builtin);
-    Address end = start + d.PaddedInstructionSizeOfBuiltin(builtin);
-
-    if (address < start) {
-      r = mid;
-    } else if (address >= end) {
-      l = mid + 1;
-    } else {
-      return builtin;
-    }
-  }
-
-  UNREACHABLE();
+  uint32_t offset =
+      static_cast<uint32_t>(address - reinterpret_cast<Address>(RawCode()));
+
+  const struct BuiltinLookupEntry* start =
+      BuiltinLookupEntry(static_cast<ReorderedBuiltinIndex>(0));
+  const struct BuiltinLookupEntry* end = start + kTableSize;
+  const struct BuiltinLookupEntry* desc =
+      std::upper_bound(start, end, offset,
+                       [](uint32_t o, const struct BuiltinLookupEntry& desc) {
+                         return o < desc.end_offset;
+                       });
+  Builtin builtin = static_cast<Builtin>(desc->builtin_id);
+  DCHECK_LT(address,
+            InstructionStartOf(builtin) + PaddedInstructionSizeOf(builtin));
+  DCHECK_GE(address, InstructionStartOf(builtin));
+  return builtin;
 }
 
-}  // namespace
-
 // static
 bool OffHeapInstructionStream::PcIsOffHeap(Isolate* isolate, Address pc) {
   // Mksnapshot calls this while the embedded blob is not available yet.
@@ -87,11 +78,11 @@ Builtin OffHeapInstructionStream::TryLookupCode(Isolate* isolate,
   if (isolate->embedded_blob_code() == nullptr) return Builtin::kNoBuiltinId;
   DCHECK_NOT_NULL(Isolate::CurrentEmbeddedBlobCode());
 
-  Builtin builtin = i::TryLookupCode(EmbeddedData::FromBlob(isolate), address);
+  Builtin builtin = EmbeddedData::FromBlob(isolate).TryLookupCode(address);
 
   if (isolate->is_short_builtin_calls_enabled() &&
       !Builtins::IsBuiltinId(builtin)) {
-    builtin = i::TryLookupCode(EmbeddedData::FromBlob(), address);
+    builtin = EmbeddedData::FromBlob().TryLookupCode(address);
   }
 
 #ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
@@ -103,7 +94,7 @@ Builtin OffHeapInstructionStream::TryLookupCode(Isolate* isolate,
     // So, this blob has to be checked too.
     CodeRange* code_range = CodeRange::GetProcessWideCodeRange();
     if (code_range && code_range->embedded_blob_code_copy() != nullptr) {
-      builtin = i::TryLookupCode(EmbeddedData::FromBlob(code_range), address);
+      builtin = EmbeddedData::FromBlob(code_range).TryLookupCode(address);
     }
   }
 #endif
@@ -115,7 +106,7 @@ void OffHeapInstructionStream::CreateOffHeapOffHeapInstructionStream(
     Isolate* isolate, uint8_t** code, uint32_t* code_size, uint8_t** data,
     uint32_t* data_size) {
   // Create the embedded blob from scratch using the current Isolate's heap.
-  EmbeddedData d = EmbeddedData::FromIsolate(isolate);
+  EmbeddedData d = EmbeddedData::NewFromIsolate(isolate);
 
   // Allocate the backing store that will contain the embedded blob in this
   // Isolate. The backing store is on the native heap, *not* on V8's garbage-
@@ -187,7 +178,7 @@ void FinalizeEmbeddedCodeTargets(Isolate* isolate, EmbeddedData* blob) {
   static_assert(Builtins::kAllBuiltinsAreIsolateIndependent);
   for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
        ++builtin) {
-    Code code = isolate->builtins()->code(builtin);
+    Tagged<Code> code = isolate->builtins()->code(builtin);
     RelocIterator on_heap_it(code, kRelocMask);
     RelocIterator off_heap_it(blob, code, kRelocMask);
 
@@ -204,12 +195,13 @@ void FinalizeEmbeddedCodeTargets(Isolate* isolate, EmbeddedData* blob) {
 
       RelocInfo* rinfo = on_heap_it.rinfo();
       DCHECK_EQ(rinfo->rmode(), off_heap_it.rinfo()->rmode());
-      Code target_code = Code::FromTargetAddress(rinfo->target_address());
+      Tagged<Code> target_code =
+          Code::FromTargetAddress(rinfo->target_address());
       CHECK(Builtins::IsIsolateIndependentBuiltin(target_code));
 
       // Do not emit write-barrier for off-heap writes.
       off_heap_it.rinfo()->set_off_heap_target_address(
-          blob->InstructionStartOfBuiltin(target_code.builtin_id()));
+          blob->InstructionStartOf(target_code->builtin_id()));
 
       on_heap_it.next();
       off_heap_it.next();
@@ -225,8 +217,8 @@ void FinalizeEmbeddedCodeTargets(Isolate* isolate, EmbeddedData* blob) {
   }
 }
 
-void EnsureRelocatable(Code code) {
-  if (code.relocation_size() == 0) return;
+void EnsureRelocatable(Tagged<Code> code) {
+  if (code->relocation_size() == 0) return;
 
   // On some architectures (arm) the builtin might have a non-empty reloc
   // info containing a CONST_POOL entry. These entries don't have to be
@@ -241,57 +233,76 @@ void EnsureRelocatable(Code code) {
 }  // namespace
 
 // static
-EmbeddedData EmbeddedData::FromIsolate(Isolate* isolate) {
+EmbeddedData EmbeddedData::NewFromIsolate(Isolate* isolate) {
   Builtins* builtins = isolate->builtins();
 
   // Store instruction stream lengths and offsets.
   std::vector<struct LayoutDescription> layout_descriptions(kTableSize);
+  std::vector<struct BuiltinLookupEntry> offset_descriptions(kTableSize);
 
   bool saw_unsafe_builtin = false;
   uint32_t raw_code_size = 0;
   uint32_t raw_data_size = 0;
   static_assert(Builtins::kAllBuiltinsAreIsolateIndependent);
-  for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
-       ++builtin) {
-    Code code = builtins->code(builtin);
+
+  std::vector<Builtin> reordered_builtins;
+  if (v8_flags.reorder_builtins &&
+      BuiltinsCallGraph::Get()->all_hash_matched()) {
+    DCHECK(v8_flags.turbo_profiling_input.value());
+    // TODO(ishell, v8:13938): avoid the binary size overhead for non-mksnapshot
+    // binaries.
+    BuiltinsSorter sorter;
+    std::vector<uint32_t> builtin_sizes;
+    for (Builtin i = Builtins::kFirst; i <= Builtins::kLast; ++i) {
+      Tagged<Code> code = builtins->code(i);
+      uint32_t instruction_size =
+          static_cast<uint32_t>(code->instruction_size());
+      uint32_t padding_size = PadAndAlignCode(instruction_size);
+      builtin_sizes.push_back(padding_size);
+    }
+    reordered_builtins = sorter.SortBuiltins(
+        v8_flags.turbo_profiling_input.value(), builtin_sizes);
+    CHECK_EQ(reordered_builtins.size(), Builtins::kBuiltinCount);
+  }
+
+  for (ReorderedBuiltinIndex embedded_index = 0;
+       embedded_index < Builtins::kBuiltinCount; embedded_index++) {
+    Builtin builtin;
+    if (reordered_builtins.empty()) {
+      builtin = static_cast<Builtin>(embedded_index);
+    } else {
+      builtin = reordered_builtins[embedded_index];
+    }
+    Tagged<Code> code = builtins->code(builtin);
 
     // Sanity-check that the given builtin is isolate-independent.
-    if (!code.IsIsolateIndependent(isolate)) {
+    if (!code->IsIsolateIndependent(isolate)) {
       saw_unsafe_builtin = true;
       fprintf(stderr, "%s is not isolate-independent.\n",
               Builtins::name(builtin));
     }
 
-    uint32_t instruction_size = static_cast<uint32_t>(code.instruction_size());
-    uint32_t metadata_size = static_cast<uint32_t>(code.metadata_size());
-
+    uint32_t instruction_size = static_cast<uint32_t>(code->instruction_size());
     DCHECK_EQ(0, raw_code_size % kCodeAlignment);
     {
-      const int builtin_index = static_cast<int>(builtin);
-      struct LayoutDescription& layout_desc =
-          layout_descriptions[builtin_index];
+      // We use builtin id as index in layout_descriptions.
+      const int builtin_id = static_cast<int>(builtin);
+      struct LayoutDescription& layout_desc = layout_descriptions[builtin_id];
       layout_desc.instruction_offset = raw_code_size;
       layout_desc.instruction_length = instruction_size;
       layout_desc.metadata_offset = raw_data_size;
-      layout_desc.metadata_length = metadata_size;
-
-      layout_desc.handler_table_offset =
-          raw_data_size + static_cast<uint32_t>(code.handler_table_offset());
-#if V8_EMBEDDED_CONSTANT_POOL_BOOL
-      layout_desc.constant_pool_offset =
-          raw_data_size + static_cast<uint32_t>(code.constant_pool_offset());
-#endif
-      layout_desc.code_comments_offset_offset =
-          raw_data_size + static_cast<uint32_t>(code.code_comments_offset());
-      layout_desc.unwinding_info_offset_offset =
-          raw_data_size + static_cast<uint32_t>(code.unwinding_info_offset());
-      layout_desc.stack_slots = static_cast<uint32_t>(code.stack_slots());
-
-      CHECK_EQ(code.deoptimization_data().length(), 0);
     }
     // Align the start of each section.
     raw_code_size += PadAndAlignCode(instruction_size);
-    raw_data_size += PadAndAlignData(metadata_size);
+    raw_data_size += PadAndAlignData(code->metadata_size());
+
+    {
+      // We use embedded index as index in offset_descriptions.
+      struct BuiltinLookupEntry& offset_desc =
+          offset_descriptions[embedded_index];
+      offset_desc.end_offset = raw_code_size;
+      offset_desc.builtin_id = static_cast<uint32_t>(builtin);
+    }
   }
   CHECK_WITH_MSG(
       !saw_unsafe_builtin,
@@ -327,19 +338,25 @@ EmbeddedData EmbeddedData::FromIsolate(Isolate* isolate) {
   std::memcpy(blob_data + LayoutDescriptionTableOffset(),
               layout_descriptions.data(), LayoutDescriptionTableSize());
 
+  // Write the builtin_offset_descriptions tables.
+  DCHECK_EQ(BuiltinLookupEntryTableSize(),
+            sizeof(offset_descriptions[0]) * offset_descriptions.size());
+  std::memcpy(blob_data + BuiltinLookupEntryTableOffset(),
+              offset_descriptions.data(), BuiltinLookupEntryTableSize());
+
   // .. and the variable-size data section.
   uint8_t* const raw_metadata_start = blob_data + RawMetadataOffset();
   static_assert(Builtins::kAllBuiltinsAreIsolateIndependent);
   for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
        ++builtin) {
-    Code code = builtins->code(builtin);
+    Tagged<Code> code = builtins->code(builtin);
     uint32_t offset =
         layout_descriptions[static_cast<int>(builtin)].metadata_offset;
     uint8_t* dst = raw_metadata_start + offset;
-    DCHECK_LE(RawMetadataOffset() + offset + code.metadata_size(),
+    DCHECK_LE(RawMetadataOffset() + offset + code->metadata_size(),
               blob_data_size);
-    std::memcpy(dst, reinterpret_cast<uint8_t*>(code.metadata_start()),
-                code.metadata_size());
+    std::memcpy(dst, reinterpret_cast<uint8_t*>(code->metadata_start()),
+                code->metadata_size());
   }
   CHECK_IMPLIES(
       kMaxPCRelativeCodeRangeInMB,
@@ -350,14 +367,14 @@ EmbeddedData EmbeddedData::FromIsolate(Isolate* isolate) {
   static_assert(Builtins::kAllBuiltinsAreIsolateIndependent);
   for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
        ++builtin) {
-    Code code = builtins->code(builtin);
+    Tagged<Code> code = builtins->code(builtin);
     uint32_t offset =
         layout_descriptions[static_cast<int>(builtin)].instruction_offset;
     uint8_t* dst = raw_code_start + offset;
-    DCHECK_LE(RawCodeOffset() + offset + code.instruction_size(),
+    DCHECK_LE(RawCodeOffset() + offset + code->instruction_size(),
               blob_code_size);
-    std::memcpy(dst, reinterpret_cast<uint8_t*>(code.InstructionStart()),
-                code.instruction_size());
+    std::memcpy(dst, reinterpret_cast<uint8_t*>(code->instruction_start()),
+                code->instruction_size());
   }
 
   EmbeddedData d(blob_code, blob_code_size, blob_data, blob_data_size);
@@ -386,19 +403,11 @@ EmbeddedData EmbeddedData::FromIsolate(Isolate* isolate) {
   if (DEBUG_BOOL) {
     for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
          ++builtin) {
-      Code code = builtins->code(builtin);
-
-      CHECK_EQ(d.InstructionSizeOfBuiltin(builtin), code.instruction_size());
-      CHECK_EQ(d.MetadataSizeOfBuiltin(builtin), code.metadata_size());
-
-      CHECK_EQ(d.SafepointTableSizeOf(builtin), code.safepoint_table_size());
-      CHECK_EQ(d.HandlerTableSizeOf(builtin), code.handler_table_size());
-      CHECK_EQ(d.ConstantPoolSizeOf(builtin), code.constant_pool_size());
-      CHECK_EQ(d.CodeCommentsSizeOf(builtin), code.code_comments_size());
-      CHECK_EQ(d.UnwindingInfoSizeOf(builtin), code.unwinding_info_size());
-      CHECK_EQ(d.StackSlotsOf(builtin), code.stack_slots());
+      Tagged<Code> code = builtins->code(builtin);
+      CHECK_EQ(d.InstructionSizeOf(builtin), code->instruction_size());
     }
   }
+
   // Ensure that InterpreterEntryTrampolineForProfiling is relocatable.
   // See v8_flags.interpreted_frames_native_stack for details.
   EnsureRelocatable(
@@ -417,17 +426,23 @@ size_t EmbeddedData::CreateEmbeddedBlobDataHash() const {
   static constexpr uint32_t kFirstHashedDataOffset = IsolateHashOffset();
   // Hash the entire data section except the embedded blob hash fields
   // themselves.
-  base::Vector<const byte> payload(data_ + kFirstHashedDataOffset,
-                                   data_size_ - kFirstHashedDataOffset);
+  base::Vector<const uint8_t> payload(data_ + kFirstHashedDataOffset,
+                                      data_size_ - kFirstHashedDataOffset);
   return Checksum(payload);
 }
 
 size_t EmbeddedData::CreateEmbeddedBlobCodeHash() const {
   CHECK(v8_flags.text_is_readable);
-  base::Vector<const byte> payload(code_, code_size_);
+  base::Vector<const uint8_t> payload(code_, code_size_);
   return Checksum(payload);
 }
 
+Builtin EmbeddedData::GetBuiltinId(ReorderedBuiltinIndex embedded_index) const {
+  Builtin builtin =
+      Builtins::FromInt(BuiltinLookupEntry(embedded_index)->builtin_id);
+  return builtin;
+}
+
 void EmbeddedData::PrintStatistics() const {
   DCHECK(v8_flags.serialization_statistics);
 
@@ -435,7 +450,7 @@ void EmbeddedData::PrintStatistics() const {
   int sizes[kCount];
   static_assert(Builtins::kAllBuiltinsAreIsolateIndependent);
   for (int i = 0; i < kCount; i++) {
-    sizes[i] = InstructionSizeOfBuiltin(Builtins::FromInt(i));
+    sizes[i] = InstructionSizeOf(Builtins::FromInt(i));
   }
 
   // Sort for percentiles.
diff --git a/deps/v8/src/snapshot/embedded/embedded-data.h b/deps/v8/src/snapshot/embedded/embedded-data.h
index ee752634e74a44..4273c03aa926ad 100644
--- a/deps/v8/src/snapshot/embedded/embedded-data.h
+++ b/deps/v8/src/snapshot/embedded/embedded-data.h
@@ -10,6 +10,7 @@
 #include "src/common/globals.h"
 #include "src/execution/isolate.h"
 #include "src/heap/code-range.h"
+#include "src/objects/instruction-stream.h"
 
 namespace v8 {
 namespace internal {
@@ -17,6 +18,8 @@ namespace internal {
 class InstructionStream;
 class Isolate;
 
+using ReorderedBuiltinIndex = uint32_t;
+
 // Wraps an off-heap instruction stream.
 // TODO(jgruber,v8:6666): Remove this class.
 class OffHeapInstructionStream final : public AllStatic {
@@ -51,8 +54,11 @@ class OffHeapInstructionStream final : public AllStatic {
 
 class EmbeddedData final {
  public:
-  static EmbeddedData FromIsolate(Isolate* isolate);
+  // Create the embedded blob from the given Isolate's heap state.
+  static EmbeddedData NewFromIsolate(Isolate* isolate);
 
+  // Returns the global embedded blob (usually physically located in .text and
+  // .rodata).
   static EmbeddedData FromBlob() {
     return EmbeddedData(Isolate::CurrentEmbeddedBlobCode(),
                         Isolate::CurrentEmbeddedBlobCodeSize(),
@@ -60,12 +66,16 @@ class EmbeddedData final {
                         Isolate::CurrentEmbeddedBlobDataSize());
   }
 
+  // Returns a potentially remapped embedded blob (see also
+  // MaybeRemapEmbeddedBuiltinsIntoCodeRange).
   static EmbeddedData FromBlob(Isolate* isolate) {
     return EmbeddedData(
         isolate->embedded_blob_code(), isolate->embedded_blob_code_size(),
         isolate->embedded_blob_data(), isolate->embedded_blob_data_size());
   }
 
+  // Returns a potentially remapped embedded blob (see also
+  // MaybeRemapEmbeddedBuiltinsIntoCodeRange).
   static EmbeddedData FromBlob(CodeRange* code_range) {
     return EmbeddedData(code_range->embedded_blob_code_copy(),
                         Isolate::CurrentEmbeddedBlobCodeSize(),
@@ -73,53 +83,53 @@ class EmbeddedData final {
                         Isolate::CurrentEmbeddedBlobDataSize());
   }
 
-  const uint8_t* code() const { return code_; }
-  uint32_t code_size() const { return code_size_; }
-  const uint8_t* data() const { return data_; }
-  uint32_t data_size() const { return data_size_; }
-
-  bool IsInCodeRange(Address pc) const {
-    Address start = reinterpret_cast<Address>(code_);
-    return (start <= pc) && (pc < start + code_size_);
-  }
-
   // When short builtin calls optimization is enabled for the Isolate, there
   // will be two builtins instruction streams executed: the embedded one and
   // the one un-embedded into the per-Isolate code range. In most of the cases,
   // the per-Isolate instructions will be used but in some cases (like builtin
-  // calls from Wasm) the embedded instruction stream could be used.
-  // If the requested PC belongs to the embedded code blob - it'll be returned,
-  // and the per-Isolate blob otherwise.
+  // calls from Wasm) the embedded instruction stream could be used.  If the
+  // requested PC belongs to the embedded code blob - it'll be returned, and
+  // the per-Isolate blob otherwise.
   // See http://crbug.com/v8/11527 for details.
-  inline static EmbeddedData GetEmbeddedDataForPC(Isolate* isolate,
-                                                  Address maybe_builtin_pc) {
+  static EmbeddedData FromBlobForPc(Isolate* isolate,
+                                    Address maybe_builtin_pc) {
     EmbeddedData d = EmbeddedData::FromBlob(isolate);
-    if (isolate->is_short_builtin_calls_enabled() &&
-        !d.IsInCodeRange(maybe_builtin_pc)) {
+    if (d.IsInCodeRange(maybe_builtin_pc)) return d;
+    if (isolate->is_short_builtin_calls_enabled()) {
       EmbeddedData global_d = EmbeddedData::FromBlob();
       // If the pc does not belong to the embedded code blob we should be using
       // the un-embedded one.
       if (global_d.IsInCodeRange(maybe_builtin_pc)) return global_d;
     }
-#ifdef V8_COMPRESS_POINTERS_IN_SHARED_CAGE
-    if (V8_SHORT_BUILTIN_CALLS_BOOL && !d.IsInCodeRange(maybe_builtin_pc)) {
-      // When shared pointer compression cage is enabled and it has the embedded
-      // code blob copy then it could have been used regardless of whether the
-      // isolate uses it or knows about it or not (see
-      // InstructionStream::OffHeapInstructionStart()).
-      // So, this blob has to be checked too.
-      CodeRange* code_range = CodeRange::GetProcessWideCodeRange();
-      if (code_range && code_range->embedded_blob_code_copy() != nullptr) {
-        EmbeddedData remapped_d = EmbeddedData::FromBlob(code_range);
-        // If the pc does not belong to the embedded code blob we should be
-        // using the un-embedded one.
-        if (remapped_d.IsInCodeRange(maybe_builtin_pc)) return remapped_d;
-      }
+#if defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE) && \
+    defined(V8_SHORT_BUILTIN_CALLS)
+    // When shared pointer compression cage is enabled and it has the embedded
+    // code blob copy then it could have been used regardless of whether the
+    // isolate uses it or knows about it or not (see
+    // InstructionStream::OffHeapInstructionStart()).
+    // So, this blob has to be checked too.
+    CodeRange* code_range = CodeRange::GetProcessWideCodeRange();
+    if (code_range && code_range->embedded_blob_code_copy() != nullptr) {
+      EmbeddedData remapped_d = EmbeddedData::FromBlob(code_range);
+      // If the pc does not belong to the embedded code blob we should be
+      // using the un-embedded one.
+      if (remapped_d.IsInCodeRange(maybe_builtin_pc)) return remapped_d;
     }
-#endif
+#endif  // defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE) &&
+        // defined(V8_SHORT_BUILTIN_CALLS)
     return d;
   }
 
+  const uint8_t* code() const { return code_; }
+  uint32_t code_size() const { return code_size_; }
+  const uint8_t* data() const { return data_; }
+  uint32_t data_size() const { return data_size_; }
+
+  bool IsInCodeRange(Address pc) const {
+    Address start = reinterpret_cast<Address>(code_);
+    return (start <= pc) && (pc < start + code_size_);
+  }
+
   void Dispose() {
     delete[] code_;
     code_ = nullptr;
@@ -127,35 +137,12 @@ class EmbeddedData final {
     data_ = nullptr;
   }
 
-  inline bool BuiltinContains(Builtin builtin, Address pc) const;
-
-  // TODO(ishell): rename XyzOfBuiltin() to XyzOf().
-  inline Address InstructionStartOfBuiltin(Builtin builtin) const;
+  inline Address InstructionStartOf(Builtin builtin) const;
   inline Address InstructionEndOf(Builtin builtin) const;
-  inline uint32_t InstructionSizeOfBuiltin(Builtin builtin) const;
-
+  inline uint32_t InstructionSizeOf(Builtin builtin) const;
   inline Address InstructionStartOfBytecodeHandlers() const;
   inline Address InstructionEndOfBytecodeHandlers() const;
-
-  inline Address MetadataStartOfBuiltin(Builtin builtin) const;
-  inline uint32_t MetadataSizeOfBuiltin(Builtin builtin) const;
-
-  inline Address SafepointTableStartOf(Builtin builtin) const;
-  inline uint32_t SafepointTableSizeOf(Builtin builtin) const;
-
-  inline Address HandlerTableStartOf(Builtin builtin) const;
-  inline uint32_t HandlerTableSizeOf(Builtin builtin) const;
-
-  inline Address ConstantPoolStartOf(Builtin builtin) const;
-  inline uint32_t ConstantPoolSizeOf(Builtin builtin) const;
-
-  inline Address CodeCommentsStartOf(Builtin builtin) const;
-  inline uint32_t CodeCommentsSizeOf(Builtin builtin) const;
-
-  inline Address UnwindingInfoStartOf(Builtin builtin) const;
-  inline uint32_t UnwindingInfoSizeOf(Builtin builtin) const;
-
-  inline uint32_t StackSlotsOf(Builtin builtin) const;
+  inline Address MetadataStartOf(Builtin builtin) const;
 
   uint32_t AddressForHashing(Address addr) {
     DCHECK(IsInCodeRange(addr));
@@ -164,8 +151,7 @@ class EmbeddedData final {
   }
 
   // Padded with kCodeAlignment.
-  // TODO(v8:11045): Consider removing code alignment.
-  inline uint32_t PaddedInstructionSizeOfBuiltin(Builtin builtin) const;
+  inline uint32_t PaddedInstructionSizeOf(Builtin builtin) const;
 
   size_t CreateEmbeddedBlobDataHash() const;
   size_t CreateEmbeddedBlobCodeHash() const;
@@ -182,29 +168,17 @@ class EmbeddedData final {
     return *reinterpret_cast<const size_t*>(data_ + IsolateHashOffset());
   }
 
-  // Blob layout information for a single instruction stream. Corresponds
-  // roughly to InstructionStream object layout (see the instruction and
-  // metadata area).
+  Builtin TryLookupCode(Address address) const;
+
+  // Blob layout information for a single instruction stream.
   struct LayoutDescription {
     // The offset and (unpadded) length of this builtin's instruction area
     // from the start of the embedded code section.
     uint32_t instruction_offset;
     uint32_t instruction_length;
-    // The offset and (unpadded) length of this builtin's metadata area
-    // from the start of the embedded data section.
+    // The offset of this builtin's metadata area from the start of the
+    // embedded data section.
     uint32_t metadata_offset;
-    uint32_t metadata_length;
-
-    // The offsets describing inline metadata tables, relative to the start
-    // of the embedded data section.
-    uint32_t handler_table_offset;
-#if V8_EMBEDDED_CONSTANT_POOL_BOOL
-    uint32_t constant_pool_offset;
-#endif
-    uint32_t code_comments_offset_offset;
-    uint32_t unwinding_info_offset_offset;
-
-    uint32_t stack_slots;
   };
   static_assert(offsetof(LayoutDescription, instruction_offset) ==
                 0 * kUInt32Size);
@@ -212,27 +186,28 @@ class EmbeddedData final {
                 1 * kUInt32Size);
   static_assert(offsetof(LayoutDescription, metadata_offset) ==
                 2 * kUInt32Size);
-  static_assert(offsetof(LayoutDescription, metadata_length) ==
-                3 * kUInt32Size);
-  static_assert(offsetof(LayoutDescription, handler_table_offset) ==
-                4 * kUInt32Size);
-#if V8_EMBEDDED_CONSTANT_POOL_BOOL
-  static_assert(offsetof(LayoutDescription, constant_pool_offset) ==
-                5 * kUInt32Size);
-  static_assert(offsetof(LayoutDescription, code_comments_offset_offset) ==
-                6 * kUInt32Size);
-  static_assert(offsetof(LayoutDescription, unwinding_info_offset_offset) ==
-                7 * kUInt32Size);
-  static_assert(offsetof(LayoutDescription, stack_slots) == 8 * kUInt32Size);
-  static_assert(sizeof(LayoutDescription) == 9 * kUInt32Size);
-#else
-  static_assert(offsetof(LayoutDescription, code_comments_offset_offset) ==
-                5 * kUInt32Size);
-  static_assert(offsetof(LayoutDescription, unwinding_info_offset_offset) ==
-                6 * kUInt32Size);
-  static_assert(offsetof(LayoutDescription, stack_slots) == 7 * kUInt32Size);
-  static_assert(sizeof(LayoutDescription) == 8 * kUInt32Size);
-#endif
+
+  // The embedded code section stores builtins in the so-called
+  // 'embedded snapshot order' which is usually different from the order
+  // as defined by the Builtins enum ('builtin id order'), and determined
+  // through an algorithm based on collected execution profiles. The
+  // BuiltinLookupEntry struct maps from the 'embedded snapshot order' to
+  // the 'builtin id order' and additionally keeps a copy of instruction_end for
+  // each builtin since it is convenient for binary search.
+  struct BuiltinLookupEntry {
+    // The end offset (including padding) of builtin, the end_offset field
+    // should be in ascending order in the array in snapshot, because we will
+    // use it in TryLookupCode. It should be equal to
+    // LayoutDescription[builtin_id].instruction_offset +
+    // PadAndAlignCode(length)
+    uint32_t end_offset;
+    // The id of builtin.
+    uint32_t builtin_id;
+  };
+  static_assert(offsetof(BuiltinLookupEntry, end_offset) == 0 * kUInt32Size);
+  static_assert(offsetof(BuiltinLookupEntry, builtin_id) == 1 * kUInt32Size);
+
+  Builtin GetBuiltinId(ReorderedBuiltinIndex embedded_index) const;
 
   // The layout of the blob is as follows:
   //
@@ -240,14 +215,16 @@ class EmbeddedData final {
   // [0] hash of the data section
   // [1] hash of the code section
   // [2] hash of embedded-blob-relevant heap objects
-  // [3] layout description of instruction stream 0
-  // ... layout descriptions
+  // [3] layout description of builtin 0
+  // ... layout descriptions (builtin id order)
+  // [n] builtin lookup table where entries are sorted by offset_end in
+  //     ascending order. (embedded snapshot order)
   // [x] metadata section of builtin 0
-  // ... metadata sections
+  // ... metadata sections (builtin id order)
   //
   // code:
   // [0] instruction section of builtin 0
-  // ... instruction sections
+  // ... instruction sections (embedded snapshot order)
 
   static constexpr uint32_t kTableSize = Builtins::kBuiltinCount;
   static constexpr uint32_t EmbeddedBlobDataHashOffset() { return 0; }
@@ -266,9 +243,15 @@ class EmbeddedData final {
   static constexpr uint32_t LayoutDescriptionTableSize() {
     return sizeof(struct LayoutDescription) * kTableSize;
   }
-  static constexpr uint32_t FixedDataSize() {
+  static constexpr uint32_t BuiltinLookupEntryTableOffset() {
     return LayoutDescriptionTableOffset() + LayoutDescriptionTableSize();
   }
+  static constexpr uint32_t BuiltinLookupEntryTableSize() {
+    return sizeof(struct BuiltinLookupEntry) * kTableSize;
+  }
+  static constexpr uint32_t FixedDataSize() {
+    return BuiltinLookupEntryTableOffset() + BuiltinLookupEntryTableSize();
+  }
   // The variable-size data section starts here.
   static constexpr uint32_t RawMetadataOffset() { return FixedDataSize(); }
 
@@ -293,6 +276,15 @@ class EmbeddedData final {
             data_ + LayoutDescriptionTableOffset());
     return descs[static_cast<int>(builtin)];
   }
+
+  const BuiltinLookupEntry* BuiltinLookupEntry(
+      ReorderedBuiltinIndex index) const {
+    const struct BuiltinLookupEntry* entries =
+        reinterpret_cast<const struct BuiltinLookupEntry*>(
+            data_ + BuiltinLookupEntryTableOffset());
+    return entries + index;
+  }
+
   const uint8_t* RawMetadata() const { return data_ + RawMetadataOffset(); }
 
   static constexpr int PadAndAlignCode(int size) {
diff --git a/deps/v8/src/snapshot/embedded/embedded-file-writer.cc b/deps/v8/src/snapshot/embedded/embedded-file-writer.cc
index 9ce32f64e89030..b397434b1feaf4 100644
--- a/deps/v8/src/snapshot/embedded/embedded-file-writer.cc
+++ b/deps/v8/src/snapshot/embedded/embedded-file-writer.cc
@@ -67,13 +67,13 @@ void EmbeddedFileWriter::WriteBuiltin(PlatformEmbeddedFileWriterBase* w,
   // that labels do not insert bytes into the middle of the blob byte
   // stream.
   w->DeclareFunctionBegin(builtin_symbol.begin(),
-                          blob->InstructionSizeOfBuiltin(builtin));
+                          blob->InstructionSizeOf(builtin));
   const int builtin_id = static_cast<int>(builtin);
-  const std::vector<byte>& current_positions = source_positions_[builtin_id];
+  const std::vector<uint8_t>& current_positions = source_positions_[builtin_id];
   // The code below interleaves bytes of assembly code for the builtin
   // function with source positions at the appropriate offsets.
-  base::Vector<const byte> vpos(current_positions.data(),
-                                current_positions.size());
+  base::Vector<const uint8_t> vpos(current_positions.data(),
+                                   current_positions.size());
   v8::internal::SourcePositionTableIterator positions(
       vpos, SourcePositionTableIterator::kExternalOnly);
 
@@ -81,15 +81,16 @@ void EmbeddedFileWriter::WriteBuiltin(PlatformEmbeddedFileWriterBase* w,
   CHECK(positions.done());  // Release builds must not contain debug infos.
 #endif
 
-  // Some builtins (JSConstructStubGeneric) have entry points located in the
-  // middle of them, we need to store their addresses since they are part of
-  // the list of allowed return addresses in the deoptimizer.
+  // Some builtins (InterpreterPushArgsThenFastConstructFunction,
+  // JSConstructStubGeneric) have entry points located in the middle of them, we
+  // need to store their addresses since they are part of the list of allowed
+  // return addresses in the deoptimizer.
   const std::vector<LabelInfo>& current_labels = label_info_[builtin_id];
   auto label = current_labels.begin();
 
-  const uint8_t* data = reinterpret_cast<const uint8_t*>(
-      blob->InstructionStartOfBuiltin(builtin));
-  uint32_t size = blob->PaddedInstructionSizeOfBuiltin(builtin);
+  const uint8_t* data =
+      reinterpret_cast<const uint8_t*>(blob->InstructionStartOf(builtin));
+  uint32_t size = blob->PaddedInstructionSizeOf(builtin);
   uint32_t i = 0;
   uint32_t next_source_pos_offset =
       static_cast<uint32_t>(positions.done() ? size : positions.code_offset());
@@ -161,8 +162,9 @@ void EmbeddedFileWriter::WriteCodeSection(PlatformEmbeddedFileWriterBase* w,
   w->DeclareLabel(EmbeddedBlobCodeSymbol().c_str());
 
   static_assert(Builtins::kAllBuiltinsAreIsolateIndependent);
-  for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
-       ++builtin) {
+  for (ReorderedBuiltinIndex embedded_index = 0;
+       embedded_index < Builtins::kBuiltinCount; embedded_index++) {
+    Builtin builtin = blob->GetBuiltinId(embedded_index);
     WriteBuiltin(w, blob, builtin);
   }
   w->AlignToPageSizeIfNeeded();
@@ -269,10 +271,11 @@ void EmbeddedFileWriter::PrepareBuiltinSourcePositionMap(Builtins* builtins) {
   for (Builtin builtin = Builtins::kFirst; builtin <= Builtins::kLast;
        ++builtin) {
     // Retrieve the SourcePositionTable and copy it.
-    Code code = builtins->code(builtin);
-    ByteArray source_position_table = code.source_position_table();
-    std::vector<unsigned char> data(source_position_table.GetDataStartAddress(),
-                                    source_position_table.GetDataEndAddress());
+    Tagged<Code> code = builtins->code(builtin);
+    Tagged<ByteArray> source_position_table = code->source_position_table();
+    std::vector<unsigned char> data(
+        source_position_table->GetDataStartAddress(),
+        source_position_table->GetDataEndAddress());
     source_positions_[static_cast<int>(builtin)] = data;
   }
 }
@@ -281,8 +284,9 @@ void EmbeddedFileWriter::PrepareBuiltinLabelInfoMap(int create_offset,
                                                     int invoke_offset) {
   label_info_[static_cast<int>(Builtin::kJSConstructStubGeneric)].push_back(
       {create_offset, "construct_stub_create_deopt_addr"});
-  label_info_[static_cast<int>(Builtin::kJSConstructStubGeneric)].push_back(
-      {invoke_offset, "construct_stub_invoke_deopt_addr"});
+  label_info_[static_cast<int>(
+                  Builtin::kInterpreterPushArgsThenFastConstructFunction)]
+      .push_back({invoke_offset, "construct_stub_invoke_deopt_addr"});
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/embedded/embedded-file-writer.h b/deps/v8/src/snapshot/embedded/embedded-file-writer.h
index c124853b6fede5..9862c4021670dd 100644
--- a/deps/v8/src/snapshot/embedded/embedded-file-writer.h
+++ b/deps/v8/src/snapshot/embedded/embedded-file-writer.h
@@ -182,7 +182,7 @@ class EmbeddedFileWriter : public EmbeddedFileWriterInterface {
   }
 
  private:
-  std::vector<byte> source_positions_[Builtins::kBuiltinCount];
+  std::vector<uint8_t> source_positions_[Builtins::kBuiltinCount];
   std::vector<LabelInfo> label_info_[Builtins::kBuiltinCount];
 
 #if defined(V8_OS_WIN64)
diff --git a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-aix.cc b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-aix.cc
index 94bb8cc6f3eb32..d199450c44c5a2 100644
--- a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-aix.cc
+++ b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-aix.cc
@@ -4,7 +4,7 @@
 
 #include "src/snapshot/embedded/platform-embedded-file-writer-aix.h"
 
-#include "src/objects/code.h"
+#include "src/objects/instruction-stream.h"
 
 namespace v8 {
 namespace internal {
diff --git a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-base.cc b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-base.cc
index e0602edc7e1c6a..e4ca7bfdacb11c 100644
--- a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-base.cc
+++ b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-base.cc
@@ -130,7 +130,8 @@ EmbeddedTargetOs ToEmbeddedTargetOs(const char* s) {
   }
 
   std::string string(s);
-  if (string == "aix") {
+  // Python 3.9+ on IBM i returns os400 as sys.platform instead of aix
+  if (string == "aix" || string == "os400") {
     return EmbeddedTargetOs::kAIX;
   } else if (string == "chromeos") {
     return EmbeddedTargetOs::kChromeOS;
diff --git a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-generic.cc b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-generic.cc
index 4ec294734d877d..704109e6de42e9 100644
--- a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-generic.cc
+++ b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-generic.cc
@@ -7,7 +7,7 @@
 #include <algorithm>
 #include <cinttypes>
 
-#include "src/objects/code.h"
+#include "src/objects/instruction-stream.h"
 
 namespace v8 {
 namespace internal {
diff --git a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-mac.cc b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-mac.cc
index f092893c4c0b1b..43f39beb783022 100644
--- a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-mac.cc
+++ b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-mac.cc
@@ -4,7 +4,7 @@
 
 #include "src/snapshot/embedded/platform-embedded-file-writer-mac.h"
 
-#include "src/objects/code.h"
+#include "src/objects/instruction-stream.h"
 
 namespace v8 {
 namespace internal {
diff --git a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-win.cc b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-win.cc
index d36ef9946f1b6a..39a99354a8a4f1 100644
--- a/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-win.cc
+++ b/deps/v8/src/snapshot/embedded/platform-embedded-file-writer-win.cc
@@ -123,9 +123,9 @@ void EmitUnwindData(PlatformEmbeddedFileWriterWin* w,
       // entry because the return address can be retrieved from [rsp].
       if (unwind_infos[builtin_index].is_leaf_function()) continue;
 
-      uint64_t builtin_start_offset = blob->InstructionStartOfBuiltin(builtin) -
+      uint64_t builtin_start_offset = blob->InstructionStartOf(builtin) -
                                       reinterpret_cast<Address>(blob->code());
-      uint32_t builtin_size = blob->InstructionSizeOfBuiltin(builtin);
+      uint32_t builtin_size = blob->InstructionSizeOf(builtin);
 
       const std::vector<int>& xdata_desc =
           unwind_infos[builtin_index].fp_offsets();
@@ -206,9 +206,9 @@ void EmitUnwindData(PlatformEmbeddedFileWriterWin* w,
     const int builtin_index = static_cast<int>(builtin);
     if (unwind_infos[builtin_index].is_leaf_function()) continue;
 
-    uint64_t builtin_start_offset = blob->InstructionStartOfBuiltin(builtin) -
+    uint64_t builtin_start_offset = blob->InstructionStartOf(builtin) -
                                     reinterpret_cast<Address>(blob->code());
-    uint32_t builtin_size = blob->InstructionSizeOfBuiltin(builtin);
+    uint32_t builtin_size = blob->InstructionSizeOf(builtin);
 
     const std::vector<int>& xdata_desc =
         unwind_infos[builtin_index].fp_offsets();
diff --git a/deps/v8/src/snapshot/mksnapshot.cc b/deps/v8/src/snapshot/mksnapshot.cc
index bea5b64d867cd0..5f18729cabfc48 100644
--- a/deps/v8/src/snapshot/mksnapshot.cc
+++ b/deps/v8/src/snapshot/mksnapshot.cc
@@ -38,15 +38,14 @@ class SnapshotFileWriter {
     // we end up with a corrupted snapshot file. The build step would succeed,
     // but the build target is unusable. Ideally we would write out temporary
     // files and only move them to the final destination as last step.
-    v8::base::Vector<const i::byte> blob_vector(
-        reinterpret_cast<const i::byte*>(blob.data), blob.raw_size);
+    v8::base::Vector<const uint8_t> blob_vector(
+        reinterpret_cast<const uint8_t*>(blob.data), blob.raw_size);
     MaybeWriteSnapshotFile(blob_vector);
     MaybeWriteStartupBlob(blob_vector);
   }
 
  private:
-  void MaybeWriteStartupBlob(
-      const v8::base::Vector<const i::byte>& blob) const {
+  void MaybeWriteStartupBlob(v8::base::Vector<const uint8_t> blob) const {
     if (!snapshot_blob_path_) return;
 
     FILE* fp = GetFileDescriptorOrDie(snapshot_blob_path_);
@@ -59,8 +58,7 @@ class SnapshotFileWriter {
     }
   }
 
-  void MaybeWriteSnapshotFile(
-      const v8::base::Vector<const i::byte>& blob) const {
+  void MaybeWriteSnapshotFile(v8::base::Vector<const uint8_t> blob) const {
     if (!snapshot_cpp_path_) return;
 
     FILE* fp = GetFileDescriptorOrDie(snapshot_cpp_path_);
@@ -76,6 +74,7 @@ class SnapshotFileWriter {
     fprintf(fp, "// Autogenerated snapshot file. Do not edit.\n\n");
     fprintf(fp, "#include \"src/init/v8.h\"\n");
     fprintf(fp, "#include \"src/base/platform/platform.h\"\n\n");
+    fprintf(fp, "#include \"src/flags/flags.h\"\n");
     fprintf(fp, "#include \"src/snapshot/snapshot.h\"\n\n");
     fprintf(fp, "namespace v8 {\n");
     fprintf(fp, "namespace internal {\n\n");
@@ -89,16 +88,17 @@ class SnapshotFileWriter {
     fprintf(
         fp,
         "bool Snapshot::ShouldVerifyChecksum(const v8::StartupData* data) {\n");
-    fprintf(fp, "  return true;\n");
+    fprintf(fp, "  return v8_flags.verify_snapshot_checksum;\n");
     fprintf(fp, "}\n");
     fprintf(fp, "}  // namespace internal\n");
     fprintf(fp, "}  // namespace v8\n");
   }
 
-  static void WriteSnapshotFileData(
-      FILE* fp, const v8::base::Vector<const i::byte>& blob) {
-    fprintf(fp,
-            "alignas(kPointerAlignment) static const byte blob_data[] = {\n");
+  static void WriteSnapshotFileData(FILE* fp,
+                                    v8::base::Vector<const uint8_t> blob) {
+    fprintf(
+        fp,
+        "alignas(kPointerAlignment) static const uint8_t blob_data[] = {\n");
     WriteBinaryContentsAsCArray(fp, blob);
     fprintf(fp, "};\n");
     fprintf(fp, "static const int blob_size = %d;\n", blob.length());
@@ -107,7 +107,7 @@ class SnapshotFileWriter {
   }
 
   static void WriteBinaryContentsAsCArray(
-      FILE* fp, const v8::base::Vector<const i::byte>& blob) {
+      FILE* fp, v8::base::Vector<const uint8_t> blob) {
     for (int i = 0; i < blob.length(); i++) {
       if ((i & 0x1F) == 0x1F) fprintf(fp, "\n");
       if (i > 0) fprintf(fp, ",");
@@ -154,7 +154,7 @@ char* GetExtraCode(char* filename, const char* description) {
   return chars;
 }
 
-v8::StartupData CreateSnapshotDataBlob(v8::Isolate* isolate,
+v8::StartupData CreateSnapshotDataBlob(i::Isolate* isolate,
                                        const char* embedded_source) {
   v8::base::ElapsedTimer timer;
   timer.Start();
@@ -263,7 +263,6 @@ int main(int argc, char** argv) {
     std::unique_ptr<char> warmup_script(
         GetExtraCode(argc >= 3 ? argv[2] : nullptr, "warm up"));
 
-    i::DisableEmbeddedBlobRefcounting();
     v8::StartupData blob;
     {
       v8::Isolate* isolate = v8::Isolate::Allocate();
@@ -285,16 +284,16 @@ int main(int argc, char** argv) {
       // to be written out if builtins are embedded.
       i_isolate->RegisterEmbeddedFileWriter(&embedded_writer);
 
-      blob = CreateSnapshotDataBlob(isolate, embed_script.get());
+      blob = CreateSnapshotDataBlob(i_isolate, embed_script.get());
 
-      // At this point, the Isolate has been torn down but the embedded blob
-      // is still alive (we called DisableEmbeddedBlobRefcounting above).
-      // That's fine as far as the embedded file writer is concerned.
       WriteEmbeddedFile(&embedded_writer);
 
+#if V8_STATIC_ROOTS_GENERATION_BOOL
       if (i::v8_flags.static_roots_src) {
         i::StaticRootsTableGen::write(i_isolate, i::v8_flags.static_roots_src);
       }
+#endif
+      isolate->Dispose();
     }
 
     if (warmup_script) {
@@ -309,7 +308,6 @@ int main(int argc, char** argv) {
     snapshot_writer.WriteSnapshot(blob);
     delete[] blob.data;
   }
-  i::FreeCurrentEmbeddedBlob();
 
   v8::V8::Dispose();
   v8::V8::DisposePlatform();
diff --git a/deps/v8/src/snapshot/read-only-deserializer.cc b/deps/v8/src/snapshot/read-only-deserializer.cc
index ea86170a8438e2..729b75a17f6621 100644
--- a/deps/v8/src/snapshot/read-only-deserializer.cc
+++ b/deps/v8/src/snapshot/read-only-deserializer.cc
@@ -4,19 +4,142 @@
 
 #include "src/snapshot/read-only-deserializer.h"
 
-#include "src/api/api.h"
-#include "src/common/globals.h"
-#include "src/execution/v8threads.h"
-#include "src/heap/heap-inl.h"  // crbug.com/v8/8499
+#include "src/handles/handles-inl.h"
+#include "src/heap/heap-inl.h"
 #include "src/heap/read-only-heap.h"
 #include "src/logging/counters-scopes.h"
+#include "src/objects/objects-inl.h"
 #include "src/objects/slots.h"
-#include "src/roots/static-roots.h"
+#include "src/snapshot/embedded/embedded-data-inl.h"
+#include "src/snapshot/read-only-serializer-deserializer.h"
 #include "src/snapshot/snapshot-data.h"
 
 namespace v8 {
 namespace internal {
 
+class ReadOnlyHeapImageDeserializer final {
+ public:
+  static void Deserialize(Isolate* isolate, SnapshotByteSource* source) {
+    ReadOnlyHeapImageDeserializer{isolate, source}.DeserializeImpl();
+  }
+
+ private:
+  using Bytecode = ro::Bytecode;
+
+  ReadOnlyHeapImageDeserializer(Isolate* isolate, SnapshotByteSource* source)
+      : source_(source), isolate_(isolate) {}
+
+  void DeserializeImpl() {
+    while (true) {
+      int bytecode_as_int = source_->Get();
+      DCHECK_LT(bytecode_as_int, ro::kNumberOfBytecodes);
+      switch (static_cast<Bytecode>(bytecode_as_int)) {
+        case Bytecode::kAllocatePage:
+          AllocatePage();
+          break;
+        case Bytecode::kSegment:
+          DeserializeSegment();
+          break;
+        case Bytecode::kRelocateSegment:
+          UNREACHABLE();  // Handled together with kSegment.
+        case Bytecode::kReadOnlyRootsTable:
+          DeserializeReadOnlyRootsTable();
+          break;
+        case Bytecode::kFinalizeReadOnlySpace:
+          ro_space()->FinalizeSpaceForDeserialization();
+          return;
+      }
+    }
+  }
+
+  void AllocatePage() {
+    size_t expected_page_index = static_cast<size_t>(source_->GetUint30());
+    size_t actual_page_index = static_cast<size_t>(-1);
+    size_t area_size_in_bytes = static_cast<size_t>(source_->GetUint30());
+    if (V8_STATIC_ROOTS_BOOL) {
+      uint32_t compressed_page_addr = source_->GetUint32();
+      Address pos = isolate_->GetPtrComprCage()->base() + compressed_page_addr;
+      actual_page_index = ro_space()->AllocateNextPageAt(pos);
+    } else {
+      actual_page_index = ro_space()->AllocateNextPage();
+    }
+    CHECK_EQ(actual_page_index, expected_page_index);
+    ro_space()->InitializePageForDeserialization(PageAt(actual_page_index),
+                                                 area_size_in_bytes);
+  }
+
+  void DeserializeSegment() {
+    uint32_t page_index = source_->GetUint30();
+    ReadOnlyPage* page = PageAt(page_index);
+
+    // Copy over raw contents.
+    Address start = page->area_start() + source_->GetUint30();
+    int size_in_bytes = source_->GetUint30();
+    CHECK_LE(start + size_in_bytes, page->area_end());
+    source_->CopyRaw(reinterpret_cast<void*>(start), size_in_bytes);
+
+    if (!V8_STATIC_ROOTS_BOOL) {
+      uint8_t relocate_marker_bytecode = source_->Get();
+      CHECK_EQ(relocate_marker_bytecode, Bytecode::kRelocateSegment);
+      int tagged_slots_size_in_bits = size_in_bytes / kTaggedSize;
+      // The const_cast is unfortunate, but we promise not to mutate data.
+      uint8_t* data =
+          const_cast<uint8_t*>(source_->data() + source_->position());
+      ro::BitSet tagged_slots(data, tagged_slots_size_in_bits);
+      DecodeTaggedSlots(start, tagged_slots);
+      source_->Advance(static_cast<int>(tagged_slots.size_in_bytes()));
+    }
+  }
+
+  Address Decode(ro::EncodedTagged encoded) const {
+    ReadOnlyPage* page = PageAt(encoded.page_index);
+    return page->OffsetToAddress(encoded.offset * kTaggedSize);
+  }
+
+  void DecodeTaggedSlots(Address segment_start,
+                         const ro::BitSet& tagged_slots) {
+    DCHECK(!V8_STATIC_ROOTS_BOOL);
+    for (size_t i = 0; i < tagged_slots.size_in_bits(); i++) {
+      // TODO(jgruber): Depending on sparseness, different iteration methods
+      // could be more efficient.
+      if (!tagged_slots.contains(static_cast<int>(i))) continue;
+      Address slot_addr = segment_start + i * kTaggedSize;
+      Address obj_addr = Decode(ro::EncodedTagged::FromAddress(slot_addr));
+      Address obj_ptr = obj_addr + kHeapObjectTag;
+
+      Tagged_t* dst = reinterpret_cast<Tagged_t*>(slot_addr);
+      *dst = COMPRESS_POINTERS_BOOL
+                 ? V8HeapCompressionScheme::CompressObject(obj_ptr)
+                 : static_cast<Tagged_t>(obj_ptr);
+    }
+  }
+
+  ReadOnlyPage* PageAt(size_t index) const {
+    DCHECK_LT(index, ro_space()->pages().size());
+    return ro_space()->pages()[index];
+  }
+
+  void DeserializeReadOnlyRootsTable() {
+    ReadOnlyRoots roots(isolate_);
+    if (V8_STATIC_ROOTS_BOOL) {
+      roots.InitFromStaticRootsTable(isolate_->cage_base());
+    } else {
+      for (size_t i = 0; i < ReadOnlyRoots::kEntriesCount; i++) {
+        uint32_t encoded_as_int = source_->GetUint32();
+        Address rudolf = Decode(ro::EncodedTagged::FromUint32(encoded_as_int));
+        roots.read_only_roots_[i] = rudolf + kHeapObjectTag;
+      }
+    }
+  }
+
+  ReadOnlySpace* ro_space() const {
+    return isolate_->read_only_heap()->read_only_space();
+  }
+
+  SnapshotByteSource* const source_;
+  Isolate* const isolate_;
+};
+
 ReadOnlyDeserializer::ReadOnlyDeserializer(Isolate* isolate,
                                            const SnapshotData* data,
                                            bool can_rehash)
@@ -27,50 +150,17 @@ void ReadOnlyDeserializer::DeserializeIntoIsolate() {
   NestedTimedHistogramScope histogram_timer(
       isolate()->counters()->snapshot_deserialize_rospace());
   HandleScope scope(isolate());
-
   ReadOnlyHeap* ro_heap = isolate()->read_only_heap();
 
-  // No active threads.
-  DCHECK_NULL(isolate()->thread_manager()->FirstThreadStateInUse());
-  // No active handles.
-  DCHECK(isolate()->handle_scope_implementer()->blocks()->empty());
-  // Read-only object cache is not yet populated.
-  DCHECK(!ro_heap->read_only_object_cache_is_initialized());
-  // Startup object cache is not yet populated.
-  DCHECK(isolate()->startup_object_cache()->empty());
-  // Builtins are not yet created.
-  DCHECK(!isolate()->builtins()->is_initialized());
-
-  {
-    ReadOnlyRoots roots(isolate());
-    if (V8_STATIC_ROOTS_BOOL) {
-      // When static roots are enabled, RO space is deserialized as a verbatim
-      // byte copy without going through any normal deserializer logic.
-      ro_heap->read_only_space()->InitFromMemoryDump(isolate(), source());
-      roots.InitFromStaticRootsTable(isolate()->cage_base());
-      ro_heap->read_only_space()->RepairFreeSpacesAfterDeserialization();
-    } else {
-      roots.Iterate(this);
-
-      // Deserialize the Read-only Object Cache.
-      for (;;) {
-        Object* object = ro_heap->ExtendReadOnlyObjectCache();
-        // During deserialization, the visitor populates the read-only object
-        // cache and eventually terminates the cache with undefined.
-        VisitRootPointer(Root::kReadOnlyObjectCache, nullptr,
-                         FullObjectSlot(object));
-        if (object->IsUndefined(roots)) break;
-      }
-      DeserializeDeferredObjects();
-    }
+  ReadOnlyHeapImageDeserializer::Deserialize(isolate(), source());
+  ro_heap->read_only_space()->RepairFreeSpacesAfterDeserialization();
+  PostProcessNewObjects();
 
+  ReadOnlyRoots roots(isolate());
+  roots.VerifyNameForProtectorsPages();
 #ifdef DEBUG
-    roots.VerifyNameForProtectors();
+  roots.VerifyNameForProtectors();
 #endif
-    roots.VerifyNameForProtectorsPages();
-  }
-
-  PostProcessNewObjectsIfStaticRootsEnabled();
 
   if (should_rehash()) {
     isolate()->heap()->InitializeHashSeed();
@@ -78,44 +168,158 @@ void ReadOnlyDeserializer::DeserializeIntoIsolate() {
   }
 }
 
-#ifdef V8_STATIC_ROOTS
-void ReadOnlyDeserializer::PostProcessNewObjectsIfStaticRootsEnabled() {
+void NoExternalReferencesCallback() {
+  // The following check will trigger if a function or object template with
+  // references to native functions have been deserialized from snapshot, but
+  // no actual external references were provided when the isolate was created.
+  FATAL("No external references provided via API");
+}
+
+class ObjectPostProcessor final {
+ public:
+  explicit ObjectPostProcessor(Isolate* isolate) : isolate_(isolate) {}
+
+  void Finalize() {
+#ifdef V8_ENABLE_SANDBOX
+    DCHECK(ReadOnlyHeap::IsReadOnlySpaceShared());
+    std::vector<ReadOnlyArtifacts::ExternalPointerRegistryEntry> registry;
+    registry.reserve(external_pointer_slots_.size());
+    for (auto& [slot, tag] : external_pointer_slots_) {
+      registry.emplace_back(slot.Relaxed_LoadHandle(), slot.load(isolate_, tag),
+                            tag);
+    }
+
+    isolate_->read_only_artifacts()->set_external_pointer_registry(
+        std::move(registry));
+#endif  // V8_ENABLE_SANDBOX
+  }
+#define POST_PROCESS_TYPE_LIST(V) \
+  V(AccessorInfo)                 \
+  V(CallHandlerInfo)              \
+  V(Code)                         \
+  V(SharedFunctionInfo)
+
+  void PostProcessIfNeeded(Tagged<HeapObject> o) {
+    const InstanceType itype = o->map(isolate_)->instance_type();
+#define V(TYPE)                               \
+  if (InstanceTypeChecker::Is##TYPE(itype)) { \
+    return PostProcess##TYPE(TYPE::cast(o));  \
+  }
+    POST_PROCESS_TYPE_LIST(V)
+#undef V
+    // If we reach here, no postprocessing is needed for this object.
+  }
+#undef POST_PROCESS_TYPE_LIST
+
+ private:
+  Address GetAnyExternalReferenceAt(int index, bool is_api_reference) const {
+    if (is_api_reference) {
+      const intptr_t* refs = isolate_->api_external_references();
+      Address address =
+          refs == nullptr
+              ? reinterpret_cast<Address>(NoExternalReferencesCallback)
+              : static_cast<Address>(refs[index]);
+      DCHECK_NE(address, kNullAddress);
+      return address;
+    }
+    // Note we allow `address` to be kNullAddress since some of our tests
+    // rely on this (e.g. when testing an incompletely initialized ER table).
+    return isolate_->external_reference_table_unsafe()->address(index);
+  }
+
+  void DecodeExternalPointerSlot(ExternalPointerSlot slot,
+                                 ExternalPointerTag tag) {
+    // Constructing no_gc here is not the intended use pattern (instead we
+    // should pass it along the entire callchain); but there's little point of
+    // doing that here - all of the code in this file relies on GC being
+    // disabled, and that's guarded at entry points.
+    DisallowGarbageCollection no_gc;
+    auto encoded = ro::EncodedExternalReference::FromUint32(
+        slot.GetContentAsIndexAfterDeserialization(no_gc));
+    Address slot_value =
+        GetAnyExternalReferenceAt(encoded.index, encoded.is_api_reference);
+    slot.init(isolate_, slot_value, tag);
+#ifdef V8_ENABLE_SANDBOX
+    // Register these slots during deserialization s.t. later isolates (which
+    // share the RO space we are currently deserializing) can properly
+    // initialize their external pointer table RO space. Note that slot values
+    // are only fully finalized at the end of deserialization, thus we only
+    // register the slot itself now and read the handle/value in Finalize.
+    external_pointer_slots_.emplace_back(slot, tag);
+#endif  // V8_ENABLE_SANDBOX
+  }
+  void PostProcessAccessorInfo(Tagged<AccessorInfo> o) {
+    DecodeExternalPointerSlot(
+        o->RawExternalPointerField(AccessorInfo::kSetterOffset),
+        kAccessorInfoSetterTag);
+    DecodeExternalPointerSlot(
+        o->RawExternalPointerField(AccessorInfo::kMaybeRedirectedGetterOffset),
+        kAccessorInfoGetterTag);
+    if (USE_SIMULATOR_BOOL) o->init_getter_redirection(isolate_);
+  }
+  void PostProcessCallHandlerInfo(Tagged<CallHandlerInfo> o) {
+    DecodeExternalPointerSlot(
+        o->RawExternalPointerField(
+            CallHandlerInfo::kMaybeRedirectedCallbackOffset),
+        kCallHandlerInfoCallbackTag);
+    if (USE_SIMULATOR_BOOL) o->init_callback_redirection(isolate_);
+  }
+  void PostProcessCode(Tagged<Code> o) {
+    o->init_instruction_start(isolate_, kNullAddress);
+    // RO space only contains builtin Code objects which don't have an
+    // attached InstructionStream.
+    DCHECK(o->is_builtin());
+    DCHECK(!o->has_instruction_stream());
+    o->SetInstructionStartForOffHeapBuiltin(
+        isolate_,
+        EmbeddedData::FromBlob(isolate_).InstructionStartOf(o->builtin_id()));
+  }
+  void PostProcessSharedFunctionInfo(Tagged<SharedFunctionInfo> o) {
+    // Reset the id to avoid collisions - it must be unique in this isolate.
+    o->set_unique_id(isolate_->GetAndIncNextUniqueSfiId());
+  }
+
+  Isolate* const isolate_;
+
+#ifdef V8_ENABLE_SANDBOX
+  struct SlotAndTag {
+    SlotAndTag(ExternalPointerSlot slot, ExternalPointerTag tag)
+        : slot(slot), tag(tag) {}
+    ExternalPointerSlot slot;
+    ExternalPointerTag tag;
+  };
+  std::vector<SlotAndTag> external_pointer_slots_;
+#endif  // V8_ENABLE_SANDBOX
+};
+
+void ReadOnlyDeserializer::PostProcessNewObjects() {
   // Since we are not deserializing individual objects we need to scan the
   // heap and search for objects that need post-processing.
   //
   // See also Deserializer<IsolateT>::PostProcessNewObject.
-  //
-  // TODO(olivf): Make the V8_STATIC_ROOTS configuration use normal
-  // deserializer paths.
-  ReadOnlyHeapObjectIterator iterator(isolate()->read_only_heap());
   PtrComprCageBase cage_base(isolate());
-  for (HeapObject object = iterator.Next(); !object.is_null();
-       object = iterator.Next()) {
-    const InstanceType instance_type = object.map(cage_base).instance_type();
-
+#ifdef V8_COMPRESS_POINTERS
+  ExternalPointerTable::UnsealReadOnlySegmentScope unseal_scope(
+      &isolate()->external_pointer_table());
+#endif  // V8_COMPRESS_POINTERS
+  ObjectPostProcessor post_processor(isolate());
+  ReadOnlyHeapObjectIterator it(isolate()->read_only_heap());
+  for (Tagged<HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
     if (should_rehash()) {
+      const InstanceType instance_type = o->map(cage_base)->instance_type();
       if (InstanceTypeChecker::IsString(instance_type)) {
-        String str = String::cast(object);
-        str.set_raw_hash_field(Name::kEmptyHashField);
+        Tagged<String> str = String::cast(o);
+        str->set_raw_hash_field(Name::kEmptyHashField);
         PushObjectToRehash(handle(str, isolate()));
-      } else if (object.NeedsRehashing(instance_type)) {
-        PushObjectToRehash(handle(object, isolate()));
+      } else if (o->NeedsRehashing(instance_type)) {
+        PushObjectToRehash(handle(o, isolate()));
       }
     }
 
-    if (InstanceTypeChecker::IsCode(instance_type)) {
-      Code code = Code::cast(object);
-      code.init_code_entry_point(main_thread_isolate(), kNullAddress);
-      // RO space only contains builtin Code objects which don't have an
-      // attached InstructionStream.
-      DCHECK(code.is_builtin());
-      DCHECK(!code.has_instruction_stream());
-      code.SetEntryPointForOffHeapBuiltin(main_thread_isolate(),
-                                          code.OffHeapInstructionStart());
-    }
+    post_processor.PostProcessIfNeeded(o);
   }
+  post_processor.Finalize();
 }
-#endif  // V8_STATIC_ROOTS
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/snapshot/read-only-deserializer.h b/deps/v8/src/snapshot/read-only-deserializer.h
index 8c2d4ceddb44b5..0d70c231e7a5a5 100644
--- a/deps/v8/src/snapshot/read-only-deserializer.h
+++ b/deps/v8/src/snapshot/read-only-deserializer.h
@@ -12,22 +12,16 @@ namespace internal {
 
 class SnapshotData;
 
-// Deserializes the read-only blob, creating the read-only roots and the
-// Read-only object cache used by the other deserializers.
+// Deserializes the read-only blob and creates the read-only roots table.
 class ReadOnlyDeserializer final : public Deserializer<Isolate> {
  public:
   ReadOnlyDeserializer(Isolate* isolate, const SnapshotData* data,
                        bool can_rehash);
 
-  // Deserialize the snapshot into an empty heap.
   void DeserializeIntoIsolate();
 
  private:
-#ifdef V8_STATIC_ROOTS
-  void PostProcessNewObjectsIfStaticRootsEnabled();
-#else
-  void PostProcessNewObjectsIfStaticRootsEnabled() {}
-#endif  // V8_STATIC_ROOTS
+  void PostProcessNewObjects();
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/read-only-serializer-deserializer.h b/deps/v8/src/snapshot/read-only-serializer-deserializer.h
new file mode 100644
index 00000000000000..380e2cc8ecb31e
--- /dev/null
+++ b/deps/v8/src/snapshot/read-only-serializer-deserializer.h
@@ -0,0 +1,141 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SNAPSHOT_READ_ONLY_SERIALIZER_DESERIALIZER_H_
+#define V8_SNAPSHOT_READ_ONLY_SERIALIZER_DESERIALIZER_H_
+
+#include "src/common/globals.h"
+
+namespace v8 {
+namespace internal {
+namespace ro {
+
+// Common functionality for RO serialization and deserialization.
+
+enum Bytecode {
+  // kAllocatePage parameters:
+  //   Uint30 page_index
+  //   Uint30 area_size_in_bytes
+  //   IF_STATIC_ROOTS(Uint32 compressed_page_address)
+  kAllocatePage,
+  //
+  // kSegment parameters:
+  //   Uint30 page_index
+  //   Uint30 offset
+  //   Uint30 size_in_bytes
+  //   ... segment byte stream
+  kSegment,
+  //
+  // kRelocateSegment parameters:
+  //   ... relocation byte stream
+  kRelocateSegment,
+  //
+  // kReadOnlyRootsTable parameters:
+  //   IF_STATIC_ROOTS(... ro roots table slots)
+  kReadOnlyRootsTable,
+  //
+  kFinalizeReadOnlySpace,
+};
+static constexpr int kNumberOfBytecodes =
+    static_cast<int>(kFinalizeReadOnlySpace) + 1;
+
+// Like std::vector<bool> but with a known underlying encoding.
+class BitSet final {
+ public:
+  explicit BitSet(size_t size_in_bits)
+      : size_in_bits_(size_in_bits),
+        data_(new uint8_t[size_in_bytes()]()),
+        owns_data_(true) {}
+
+  explicit BitSet(uint8_t* data, size_t size_in_bits)
+      : size_in_bits_(size_in_bits), data_(data), owns_data_(false) {}
+
+  ~BitSet() {
+    if (owns_data_) delete[] data_;
+  }
+
+  bool contains(int i) const {
+    DCHECK(0 <= i && i < static_cast<int>(size_in_bits_));
+    return (data_[chunk_index(i)] & bit_mask(i)) != 0;
+  }
+
+  void set(int i) {
+    DCHECK(0 <= i && i < static_cast<int>(size_in_bits_));
+    data_[chunk_index(i)] |= bit_mask(i);
+  }
+
+  size_t size_in_bits() const { return size_in_bits_; }
+  size_t size_in_bytes() const {
+    return RoundUp<kBitsPerByte>(size_in_bits_) / kBitsPerByte;
+  }
+
+  const uint8_t* data() const { return data_; }
+
+ private:
+  static constexpr int kBitsPerChunk = kUInt8Size * kBitsPerByte;
+  static constexpr int chunk_index(int i) { return i / kBitsPerChunk; }
+  static constexpr int bit_index(int i) { return i % kBitsPerChunk; }
+  static constexpr uint32_t bit_mask(int i) { return 1 << bit_index(i); }
+
+  const size_t size_in_bits_;
+  uint8_t* const data_;
+  const bool owns_data_;
+};
+
+// Tagged slots need relocation after deserialization when V8_STATIC_ROOTS is
+// disabled.
+//
+// Note this encoding works for all remaining build configs, in particular for
+// all supported kTaggedSize values.
+struct EncodedTagged {
+  static constexpr int kPageIndexBits = 5;  // Max 32 RO pages.
+  static constexpr int kOffsetBits = 27;
+  static constexpr int kSize = kUInt32Size;
+
+  uint32_t ToUint32() const {
+    static_assert(kSize == kUInt32Size);
+    return *reinterpret_cast<const uint32_t*>(this);
+  }
+  static EncodedTagged FromUint32(uint32_t v) {
+    return FromAddress(reinterpret_cast<Address>(&v));
+  }
+  static EncodedTagged FromAddress(Address address) {
+    return *reinterpret_cast<EncodedTagged*>(address);
+  }
+
+  int page_index : kPageIndexBits;
+  int offset : kOffsetBits;  // Shifted by kTaggedSizeLog2.
+};
+static_assert(EncodedTagged::kSize == sizeof(EncodedTagged));
+
+struct EncodedExternalReference {
+  static constexpr int kIsApiReferenceBits = 1;
+  static constexpr int kIndexBits = 31;
+  static constexpr int kSize = kUInt32Size;
+
+  uint32_t ToUint32() const {
+    static_assert(kSize == kUInt32Size);
+    return *reinterpret_cast<const uint32_t*>(this);
+  }
+  static EncodedExternalReference FromUint32(uint32_t v) {
+    return *reinterpret_cast<EncodedExternalReference*>(&v);
+  }
+
+  // This ctor is needed to convert parameter types. We can't use bool/uint32_t
+  // as underlying member types since that messes with field packing on
+  // windows.
+  EncodedExternalReference(bool is_api_reference, uint32_t index)
+      : is_api_reference(is_api_reference), index(index) {}
+
+  int is_api_reference : kIsApiReferenceBits;
+  int index : kIndexBits;
+};
+static_assert(EncodedExternalReference::kSize ==
+              sizeof(EncodedExternalReference));
+
+}  // namespace ro
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_SNAPSHOT_READ_ONLY_SERIALIZER_DESERIALIZER_H_
diff --git a/deps/v8/src/snapshot/read-only-serializer.cc b/deps/v8/src/snapshot/read-only-serializer.cc
index 6315d9833a9049..ecf2a21783578b 100644
--- a/deps/v8/src/snapshot/read-only-serializer.cc
+++ b/deps/v8/src/snapshot/read-only-serializer.cc
@@ -4,235 +4,440 @@
 
 #include "src/snapshot/read-only-serializer.h"
 
-#include "src/api/api.h"
-#include "src/execution/v8threads.h"
+#include "src/heap/heap-inl.h"
 #include "src/heap/read-only-heap.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/slots.h"
-#include "src/snapshot/serializer-inl.h"
+#include "src/snapshot/read-only-serializer-deserializer.h"
 
 namespace v8 {
 namespace internal {
 
-ReadOnlySerializer::ReadOnlySerializer(Isolate* isolate,
-                                       Snapshot::SerializerFlags flags)
-    : RootsSerializer(isolate, flags, RootIndex::kFirstReadOnlyRoot)
-#ifdef DEBUG
-      ,
-      serialized_objects_(isolate->heap()),
-      did_serialize_not_mapped_symbol_(false)
-#endif
-{
-  static_assert(RootIndex::kFirstReadOnlyRoot == RootIndex::kFirstRoot);
-  if (V8_STATIC_ROOTS_BOOL) {
-    // .. since RO heap pages are serialized verbatim:
-    set_serializer_tracks_serialization_statistics(false);
+namespace {
+
+// Preprocess an object to prepare it for serialization.
+class ObjectPreProcessor final {
+ public:
+  explicit ObjectPreProcessor(Isolate* isolate)
+      : isolate_(isolate), extref_encoder_(isolate) {}
+
+#define PRE_PROCESS_TYPE_LIST(V) \
+  V(AccessorInfo)                \
+  V(CallHandlerInfo)             \
+  V(Code)
+
+  void PreProcessIfNeeded(Tagged<HeapObject> o) {
+    const InstanceType itype = o->map(isolate_)->instance_type();
+#define V(TYPE)                               \
+  if (InstanceTypeChecker::Is##TYPE(itype)) { \
+    return PreProcess##TYPE(TYPE::cast(o));   \
   }
-}
+    PRE_PROCESS_TYPE_LIST(V)
+#undef V
+    // If we reach here, no preprocessing is needed for this object.
+  }
+#undef PRE_PROCESS_TYPE_LIST
 
-ReadOnlySerializer::~ReadOnlySerializer() {
-  OutputStatistics("ReadOnlySerializer");
+ private:
+  void EncodeExternalPointerSlot(ExternalPointerSlot slot,
+                                 ExternalPointerTag tag) {
+    Address value = slot.load(isolate_, tag);
+    EncodeExternalPointerSlot(slot, value, tag);
+  }
+
+  void EncodeExternalPointerSlot(ExternalPointerSlot slot, Address value,
+                                 ExternalPointerTag tag) {
+    // Note it's possible that `value != slot.load(...)`, e.g. for
+    // AccessorInfo::remove_getter_indirection.
+    ExternalReferenceEncoder::Value encoder_value =
+        extref_encoder_.Encode(value);
+    DCHECK_LT(encoder_value.index(),
+              1UL << ro::EncodedExternalReference::kIndexBits);
+    ro::EncodedExternalReference encoded{encoder_value.is_from_api(),
+                                         encoder_value.index()};
+    // Constructing no_gc here is not the intended use pattern (instead we
+    // should pass it along the entire callchain); but there's little point of
+    // doing that here - all of the code in this file relies on GC being
+    // disabled, and that's guarded at entry points.
+    DisallowGarbageCollection no_gc;
+    slot.ReplaceContentWithIndexForSerialization(no_gc, encoded.ToUint32());
+  }
+  void PreProcessAccessorInfo(Tagged<AccessorInfo> o) {
+    EncodeExternalPointerSlot(
+        o->RawExternalPointerField(AccessorInfo::kMaybeRedirectedGetterOffset),
+        o->getter(isolate_),  // Pass the non-redirected value.
+        kAccessorInfoGetterTag);
+    EncodeExternalPointerSlot(
+        o->RawExternalPointerField(AccessorInfo::kSetterOffset),
+        kAccessorInfoSetterTag);
+  }
+  void PreProcessCallHandlerInfo(Tagged<CallHandlerInfo> o) {
+    EncodeExternalPointerSlot(
+        o->RawExternalPointerField(
+            CallHandlerInfo::kMaybeRedirectedCallbackOffset),
+        o->callback(isolate_),  // Pass the non-redirected value.
+        kCallHandlerInfoCallbackTag);
+  }
+  void PreProcessCode(Tagged<Code> o) {
+    o->ClearInstructionStartForSerialization(isolate_);
+  }
+
+  Isolate* const isolate_;
+  ExternalReferenceEncoder extref_encoder_;
+};
+
+struct ReadOnlySegmentForSerialization {
+  ReadOnlySegmentForSerialization(Isolate* isolate, const ReadOnlyPage* page,
+                                  Address segment_start, size_t segment_size,
+                                  ObjectPreProcessor* pre_processor)
+      : page(page),
+        segment_start(segment_start),
+        segment_size(segment_size),
+        segment_offset(segment_start - page->area_start()),
+        contents(new uint8_t[segment_size]),
+        tagged_slots(segment_size / kTaggedSize) {
+    // .. because tagged_slots records a bit for each slot:
+    DCHECK(IsAligned(segment_size, kTaggedSize));
+
+    MemCopy(contents.get(), reinterpret_cast<void*>(segment_start),
+            segment_size);
+    PreProcessSegment(pre_processor);
+    if (!V8_STATIC_ROOTS_BOOL) EncodeTaggedSlots(isolate);
+  }
+
+  void PreProcessSegment(ObjectPreProcessor* pre_processor) {
+    // Iterate the RO page and the contents copy in lockstep, preprocessing
+    // objects as we go along.
+    //
+    // See also ObjectSerializer::OutputRawData.
+    DCHECK_GE(segment_start, page->area_start());
+    const Address segment_end = segment_start + segment_size;
+    ReadOnlyPageObjectIterator it(page, segment_start);
+    for (Tagged<HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
+      if (o.address() >= segment_end) break;
+      size_t o_offset = o.ptr() - segment_start;
+      Address o_dst = reinterpret_cast<Address>(contents.get()) + o_offset;
+      pre_processor->PreProcessIfNeeded(HeapObject::cast(Object(o_dst)));
+    }
+  }
+
+  void EncodeTaggedSlots(Isolate* isolate);
+
+  const ReadOnlyPage* const page;
+  const Address segment_start;
+  const size_t segment_size;
+  const size_t segment_offset;
+  // The (mutated) off-heap copy of the on-heap segment.
+  std::unique_ptr<uint8_t[]> contents;
+  // The relocation table.
+  ro::BitSet tagged_slots;
+
+  friend class EncodeRelocationsVisitor;
+};
+
+ro::EncodedTagged Encode(Isolate* isolate, Tagged<HeapObject> o) {
+  Address o_address = o.address();
+  BasicMemoryChunk* chunk = BasicMemoryChunk::FromAddress(o_address);
+
+  ro::EncodedTagged encoded;
+  ReadOnlySpace* ro_space = isolate->read_only_heap()->read_only_space();
+  int index = static_cast<int>(ro_space->IndexOf(chunk));
+  DCHECK_LT(index, 1UL << ro::EncodedTagged::kPageIndexBits);
+  encoded.page_index = index;
+  uint32_t offset = static_cast<int>(chunk->Offset(o_address));
+  DCHECK(IsAligned(offset, kTaggedSize));
+  DCHECK_LT(offset / kTaggedSize, 1UL << ro::EncodedTagged::kOffsetBits);
+  encoded.offset = offset / kTaggedSize;
+
+  return encoded;
 }
 
-void ReadOnlySerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
-  CHECK(ReadOnlyHeap::Contains(*obj));
-  CHECK_IMPLIES(obj->IsString(), obj->IsInternalizedString());
-  DCHECK(!V8_STATIC_ROOTS_BOOL);
+// If relocations are needed, this class
+// - encodes all tagged slots s.t. valid pointers can be reconstructed during
+//   deserialization, and
+// - records the location of all tagged slots in a table.
+class EncodeRelocationsVisitor final : public ObjectVisitor {
+ public:
+  EncodeRelocationsVisitor(Isolate* isolate,
+                           ReadOnlySegmentForSerialization* segment)
+      : isolate_(isolate), segment_(segment) {
+    DCHECK(!V8_STATIC_ROOTS_BOOL);
+  }
 
-  // There should be no references to the not_mapped_symbol except for the entry
-  // in the root table, so don't try to serialize a reference and rely on the
-  // below CHECK(!did_serialize_not_mapped_symbol_) to make sure it doesn't
-  // serialize twice.
-  {
-    DisallowGarbageCollection no_gc;
-    HeapObject raw = *obj;
-    if (!IsNotMappedSymbol(raw)) {
-      if (SerializeHotObject(raw)) return;
-      if (IsRootAndHasBeenSerialized(raw) && SerializeRoot(raw)) return;
-      if (SerializeBackReference(raw)) return;
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
+                     ObjectSlot end) override {
+    VisitPointers(host, MaybeObjectSlot(start), MaybeObjectSlot(end));
+  }
+
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
+                     MaybeObjectSlot end) override {
+    for (MaybeObjectSlot slot = start; slot < end; slot++) {
+      ProcessSlot(slot);
     }
+  }
 
-    CheckRehashability(raw);
+  void VisitMapPointer(Tagged<HeapObject> host) override {
+    ProcessSlot(host->RawMaybeWeakField(HeapObject::kMapOffset));
   }
 
-  // Object has not yet been serialized.  Serialize it here.
-  ObjectSerializer object_serializer(this, obj, &sink_);
-  object_serializer.Serialize();
+  // Sanity-checks:
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override {
+    // RO space contains only builtin Code objects.
+    DCHECK(!host->has_instruction_stream());
+  }
+  void VisitCodeTarget(Tagged<InstructionStream>, RelocInfo*) override {
+    UNREACHABLE();
+  }
+  void VisitEmbeddedPointer(Tagged<InstructionStream>, RelocInfo*) override {
+    UNREACHABLE();
+  }
+  void VisitExternalReference(Tagged<InstructionStream>, RelocInfo*) override {
+    UNREACHABLE();
+  }
+  void VisitInternalReference(Tagged<InstructionStream>, RelocInfo*) override {
+    UNREACHABLE();
+  }
+  void VisitOffHeapTarget(Tagged<InstructionStream>, RelocInfo*) override {
+    UNREACHABLE();
+  }
+  void VisitExternalPointer(Tagged<HeapObject>, ExternalPointerSlot slot,
+                            ExternalPointerTag tag) override {
+    // This slot was encoded in a previous pass, see EncodeExternalPointerSlot.
 #ifdef DEBUG
-  if (IsNotMappedSymbol(*obj)) {
-    CHECK(!did_serialize_not_mapped_symbol_);
-    did_serialize_not_mapped_symbol_ = true;
-  } else {
-    CHECK_NULL(serialized_objects_.Find(obj));
-    // There's no "IdentitySet", so use an IdentityMap with a value that is
-    // later ignored.
-    serialized_objects_.Insert(obj, 0);
-  }
-#endif
+    ExternalPointerSlot slot_in_segment{reinterpret_cast<Address>(
+        segment_->contents.get() + SegmentOffsetOf(slot))};
+    // Constructing no_gc here is not the intended use pattern (instead we
+    // should pass it along the entire callchain); but there's little point of
+    // doing that here - all of the code in this file relies on GC being
+    // disabled, and that's guarded at entry points.
+    DisallowGarbageCollection no_gc;
+    auto encoded = ro::EncodedExternalReference::FromUint32(
+        slot_in_segment.GetContentAsIndexAfterDeserialization(no_gc));
+    if (encoded.is_api_reference) {
+      // Can't validate these since we don't know how many entries
+      // api_external_references contains.
+    } else {
+      CHECK_LT(encoded.index, ExternalReferenceTable::kSize);
+    }
+#endif  // DEBUG
+  }
+
+ private:
+  void ProcessSlot(MaybeObjectSlot slot) {
+    MaybeObject o = *slot;
+    if (!o.IsStrongOrWeak()) return;  // Smis don't need relocation.
+    DCHECK(o.IsStrong());
+
+    int slot_offset = SegmentOffsetOf(slot);
+    DCHECK(IsAligned(slot_offset, kTaggedSize));
+
+    // Encode:
+    ro::EncodedTagged encoded = Encode(isolate_, o.GetHeapObject());
+    memcpy(segment_->contents.get() + slot_offset, &encoded,
+           ro::EncodedTagged::kSize);
+
+    // Record:
+    segment_->tagged_slots.set(AsSlot(slot_offset));
+  }
+
+  template <class SlotT>
+  int SegmentOffsetOf(SlotT slot) const {
+    Address addr = slot.address();
+    DCHECK_GE(addr, segment_->segment_start);
+    DCHECK_LT(addr, segment_->segment_start + segment_->segment_size);
+    return static_cast<int>(addr - segment_->segment_start);
+  }
+
+  static constexpr int AsSlot(int byte_offset) {
+    return byte_offset / kTaggedSize;
+  }
+
+  Isolate* const isolate_;
+  ReadOnlySegmentForSerialization* const segment_;
+};
+
+void ReadOnlySegmentForSerialization::EncodeTaggedSlots(Isolate* isolate) {
+  DCHECK(!V8_STATIC_ROOTS_BOOL);
+  EncodeRelocationsVisitor v(isolate, this);
+  PtrComprCageBase cage_base(isolate);
+
+  DCHECK_GE(segment_start, page->area_start());
+  const Address segment_end = segment_start + segment_size;
+  ReadOnlyPageObjectIterator it(page, segment_start,
+                                SkipFreeSpaceOrFiller::kNo);
+  for (Tagged<HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
+    if (o.address() >= segment_end) break;
+    o->Iterate(cage_base, &v);
+  }
 }
 
-void ReadOnlySerializer::SerializeReadOnlyRoots() {
-  // No active threads.
-  CHECK_NULL(isolate()->thread_manager()->FirstThreadStateInUse());
-  // No active or weak handles.
-  CHECK_IMPLIES(!allow_active_isolate_for_testing(),
-                isolate()->handle_scope_implementer()->blocks()->empty());
-
-  if (!V8_STATIC_ROOTS_BOOL) {
-    ReadOnlyRoots(isolate()).Iterate(this);
-    if (reconstruct_read_only_and_shared_object_caches_for_testing()) {
-      ReconstructReadOnlyObjectCacheForTesting();
+class ReadOnlyHeapImageSerializer {
+ public:
+  struct MemoryRegion {
+    Address start;
+    size_t size;
+  };
+
+  static void Serialize(Isolate* isolate, SnapshotByteSink* sink,
+                        const std::vector<MemoryRegion>& unmapped_regions) {
+    ReadOnlyHeapImageSerializer{isolate, sink}.SerializeImpl(unmapped_regions);
+  }
+
+ private:
+  using Bytecode = ro::Bytecode;
+
+  ReadOnlyHeapImageSerializer(Isolate* isolate, SnapshotByteSink* sink)
+      : isolate_(isolate), sink_(sink), pre_processor_(isolate) {}
+
+  void SerializeImpl(const std::vector<MemoryRegion>& unmapped_regions) {
+    DCHECK_EQ(sink_->Position(), 0);
+
+    ReadOnlySpace* ro_space = isolate_->read_only_heap()->read_only_space();
+
+    // Allocate all pages first s.t. the deserializer can easily handle forward
+    // references (e.g.: an object on page i points at an object on page i+1).
+    for (const ReadOnlyPage* page : ro_space->pages()) {
+      EmitAllocatePage(page, unmapped_regions);
+    }
+
+    // Now write the page contents.
+    for (const ReadOnlyPage* page : ro_space->pages()) {
+      SerializePage(page, unmapped_regions);
     }
+
+    EmitReadOnlyRootsTable();
+    sink_->Put(Bytecode::kFinalizeReadOnlySpace, "space end");
   }
-}
 
-#ifdef V8_STATIC_ROOTS
-void ReadOnlySerializer::WipeCodeEntryPointsForDeterministicSerialization(
-    ReadOnlySerializer::CodeEntryPointVector& saved_entry_points) {
-  // See also ObjectSerializer::OutputRawData.
-  ReadOnlyHeapObjectIterator iterator(isolate()->read_only_heap());
-  for (HeapObject object = iterator.Next(); !object.is_null();
-       object = iterator.Next()) {
-    if (!object.IsCode()) continue;
-    Code code = Code::cast(object);
-    saved_entry_points.push_back(code.code_entry_point());
-    code.SetCodeEntryPointForSerialization(isolate(), kNullAddress);
+  uint32_t IndexOf(const ReadOnlyPage* page) {
+    ReadOnlySpace* ro_space = isolate_->read_only_heap()->read_only_space();
+    return static_cast<uint32_t>(ro_space->IndexOf(page));
   }
-}
 
-void ReadOnlySerializer::RestoreCodeEntryPoints(
-    const ReadOnlySerializer::CodeEntryPointVector& saved_entry_points) {
-  int i = 0;
-  ReadOnlyHeapObjectIterator iterator(isolate()->read_only_heap());
-  for (HeapObject object = iterator.Next(); !object.is_null();
-       object = iterator.Next()) {
-    if (!object.IsCode()) continue;
-    Code code = Code::cast(object);
-    code.SetCodeEntryPointForSerialization(isolate(), saved_entry_points[i++]);
+  void EmitAllocatePage(const ReadOnlyPage* page,
+                        const std::vector<MemoryRegion>& unmapped_regions) {
+    sink_->Put(Bytecode::kAllocatePage, "page begin");
+    sink_->PutUint30(IndexOf(page), "page index");
+    sink_->PutUint30(
+        static_cast<uint32_t>(page->HighWaterMark() - page->area_start()),
+        "area size in bytes");
+    if (V8_STATIC_ROOTS_BOOL) {
+      auto page_addr = reinterpret_cast<Address>(page);
+      sink_->PutUint32(V8HeapCompressionScheme::CompressAny(page_addr),
+                       "page start offset");
+    }
   }
-}
-#endif  // V8_STATIC_ROOTS
 
-void ReadOnlySerializer::FinalizeSerialization() {
-#if V8_STATIC_ROOTS_BOOL
-  DCHECK(object_cache_empty());
-  DCHECK(deferred_objects_empty());
-  DCHECK_EQ(sink_.Position(), 0);
+  void SerializePage(const ReadOnlyPage* page,
+                     const std::vector<MemoryRegion>& unmapped_regions) {
+    Address pos = page->area_start();
 
-  // Note the memcpy-based serialization done here must also guarantee a
-  // deterministic serialized layout. See also ObjectSerializer::OutputRawData
-  // which implements custom logic for this (but is not reached when
-  // serializing memcpy-style).
+    // If this page contains unmapped regions split it into multiple segments.
+    for (auto r = unmapped_regions.begin(); r != unmapped_regions.end(); ++r) {
+      // Regions must be sorted and non-overlapping.
+      if (r + 1 != unmapped_regions.end()) {
+        CHECK(r->start < (r + 1)->start);
+        CHECK(r->start + r->size < (r + 1)->start);
+      }
+      if (base::IsInRange(r->start, pos, page->HighWaterMark())) {
+        size_t segment_size = r->start - pos;
+        ReadOnlySegmentForSerialization segment(isolate_, page, pos,
+                                                segment_size, &pre_processor_);
+        EmitSegment(&segment);
+        pos += segment_size + r->size;
+      }
+    }
 
-  {
-    DisallowGarbageCollection no_gc;
+    // Pages are shrunk, but memory at the end of the area is still
+    // uninitialized and we do not want to include it in the snapshot.
+    size_t segment_size = page->HighWaterMark() - pos;
+    ReadOnlySegmentForSerialization segment(isolate_, page, pos, segment_size,
+                                            &pre_processor_);
+    EmitSegment(&segment);
+  }
 
-    isolate()->heap()->read_only_space()->Unseal();
-    CodeEntryPointVector saved_entry_points;
-    WipeCodeEntryPointsForDeterministicSerialization(saved_entry_points);
-
-    auto space = isolate()->read_only_heap()->read_only_space();
-    size_t num_pages = space->pages().size();
-    sink_.PutInt(num_pages, "num pages");
-    Tagged_t pos = V8HeapCompressionScheme::CompressAny(
-        reinterpret_cast<Address>(space->pages()[0]));
-    sink_.PutInt(pos, "first page offset");
-    // Unprotect and reprotect the payload of wasm null. The header is not
-    // protected.
-    Address wasm_null_payload = isolate()->factory()->wasm_null()->payload();
-    constexpr int kWasmNullPayloadSize = WasmNull::kSize - kTaggedSize;
-    SetPermissions(isolate()->page_allocator(), wasm_null_payload,
-                   kWasmNullPayloadSize, PageAllocator::kRead);
-    for (auto p : space->pages()) {
-      // Pages are shrunk, but memory at the end of the area is still
-      // uninitialized and we do not want to include it in the snapshot.
-      size_t page_content_bytes = p->HighWaterMark() - p->area_start();
-      sink_.PutInt(page_content_bytes, "page content bytes");
-#ifdef MEMORY_SANITIZER
-      __msan_check_mem_is_initialized(reinterpret_cast<void*>(p->area_start()),
-                                      static_cast<int>(page_content_bytes));
-#endif
-      sink_.PutRaw(reinterpret_cast<const byte*>(p->area_start()),
-                   static_cast<int>(page_content_bytes), "page");
+  void EmitSegment(const ReadOnlySegmentForSerialization* segment) {
+    sink_->Put(Bytecode::kSegment, "segment begin");
+    sink_->PutUint30(IndexOf(segment->page), "page index");
+    sink_->PutUint30(static_cast<uint32_t>(segment->segment_offset),
+                     "segment start offset");
+    sink_->PutUint30(static_cast<uint32_t>(segment->segment_size),
+                     "segment byte size");
+    sink_->PutRaw(segment->contents.get(),
+                  static_cast<int>(segment->segment_size), "page");
+    if (!V8_STATIC_ROOTS_BOOL) {
+      sink_->Put(Bytecode::kRelocateSegment, "relocate segment");
+      sink_->PutRaw(segment->tagged_slots.data(),
+                    static_cast<int>(segment->tagged_slots.size_in_bytes()),
+                    "tagged_slots");
     }
-    // Mark the virtual page range as inaccessible, and allow the OS to reclaim
-    // the underlying physical pages. We do not want to protect the header (map
-    // word), as it needs to remain accessible.
-    isolate()->page_allocator()->DecommitPages(
-        reinterpret_cast<void*>(wasm_null_payload), kWasmNullPayloadSize);
-
-    RestoreCodeEntryPoints(saved_entry_points);
-    isolate()->heap()->read_only_space()->Seal(
-        ReadOnlySpace::SealMode::kDoNotDetachFromHeap);
-  }
-#else  // V8_STATIC_ROOTS_BOOL
-  // This comes right after serialization of the other snapshots, where we
-  // add entries to the read-only object cache. Add one entry with 'undefined'
-  // to terminate the read-only object cache.
-  Object undefined = ReadOnlyRoots(isolate()).undefined_value();
-  VisitRootPointer(Root::kReadOnlyObjectCache, nullptr,
-                   FullObjectSlot(&undefined));
-  SerializeDeferredObjects();
+  }
 
-#ifdef DEBUG
-    // Check that every object on read-only heap is reachable (and was
-    // serialized).
-    ReadOnlyHeapObjectIterator iterator(isolate()->read_only_heap());
-    for (HeapObject object = iterator.Next(); !object.is_null();
-         object = iterator.Next()) {
-      if (IsNotMappedSymbol(object)) {
-        CHECK(did_serialize_not_mapped_symbol_);
-      } else {
-        CHECK_NOT_NULL(serialized_objects_.Find(object));
+  void EmitReadOnlyRootsTable() {
+    sink_->Put(Bytecode::kReadOnlyRootsTable, "read only roots table");
+    if (!V8_STATIC_ROOTS_BOOL) {
+      ReadOnlyRoots roots(isolate_);
+      for (size_t i = 0; i < ReadOnlyRoots::kEntriesCount; i++) {
+        RootIndex rudi = static_cast<RootIndex>(i);
+        Tagged<HeapObject> rudolf = HeapObject::cast(roots.object_at(rudi));
+        ro::EncodedTagged encoded = Encode(isolate_, rudolf);
+        sink_->PutUint32(encoded.ToUint32(), "read only roots entry");
       }
     }
-#endif  // DEBUG
-#endif  // V8_STATIC_ROOTS_BOOL
+  }
 
-  Pad();
-}
+  Isolate* const isolate_;
+  SnapshotByteSink* const sink_;
+  ObjectPreProcessor pre_processor_;
+};
 
-bool ReadOnlySerializer::MustBeDeferred(HeapObject object) {
-  if (root_has_been_serialized(RootIndex::kFreeSpaceMap) &&
-      root_has_been_serialized(RootIndex::kOnePointerFillerMap) &&
-      root_has_been_serialized(RootIndex::kTwoPointerFillerMap)) {
-    // All required root objects are serialized, so any aligned objects can
-    // be saved without problems.
-    return false;
-  }
-  // Defer objects with special alignment requirements until the filler roots
-  // are serialized.
-  return HeapObject::RequiredAlignment(object.map()) != kTaggedAligned;
+std::vector<ReadOnlyHeapImageSerializer::MemoryRegion> GetUnmappedRegions(
+    Isolate* isolate) {
+#ifdef V8_STATIC_ROOTS
+  // WasmNull's payload is aligned to the OS page and consists of
+  // WasmNull::kPayloadSize bytes of unmapped memory. To avoid inflating the
+  // snapshot size and accessing uninitialized and/or unmapped memory, the
+  // serializer skips the padding bytes and the payload.
+  ReadOnlyRoots ro_roots(isolate);
+  Tagged<WasmNull> wasm_null = ro_roots.wasm_null();
+  Tagged<HeapObject> wasm_null_padding = ro_roots.wasm_null_padding();
+  CHECK(IsFreeSpace(wasm_null_padding));
+  Address wasm_null_padding_start =
+      wasm_null_padding.address() + FreeSpace::kHeaderSize;
+  std::vector<ReadOnlyHeapImageSerializer::MemoryRegion> unmapped;
+  if (wasm_null.address() > wasm_null_padding_start) {
+    unmapped.push_back({wasm_null_padding_start,
+                        wasm_null.address() - wasm_null_padding_start});
+  }
+  unmapped.push_back({wasm_null->payload(), WasmNull::kPayloadSize});
+  return unmapped;
+#else
+  return {};
+#endif  // V8_STATIC_ROOTS
 }
 
-bool ReadOnlySerializer::SerializeUsingReadOnlyObjectCache(
-    SnapshotByteSink* sink, Handle<HeapObject> obj) {
-  if (!ReadOnlyHeap::Contains(*obj)) return false;
+}  // namespace
 
-  if (V8_STATIC_ROOTS_BOOL) {
-    SerializeReadOnlyObjectReference(*obj, sink);
-  } else {
-    // Get the cache index and serialize it into the read-only snapshot if
-    // necessary.
-    int cache_index = SerializeInObjectCache(obj);
-    // Writing out the cache entry into the calling serializer's sink.
-    sink->Put(kReadOnlyObjectCache, "ReadOnlyObjectCache");
-    sink->PutInt(cache_index, "read_only_object_cache_index");
-  }
+ReadOnlySerializer::ReadOnlySerializer(Isolate* isolate,
+                                       Snapshot::SerializerFlags flags)
+    : RootsSerializer(isolate, flags, RootIndex::kFirstReadOnlyRoot) {}
 
-  return true;
+ReadOnlySerializer::~ReadOnlySerializer() {
+  OutputStatistics("ReadOnlySerializer");
 }
 
-void ReadOnlySerializer::ReconstructReadOnlyObjectCacheForTesting() {
-  ReadOnlyHeap* ro_heap = isolate()->read_only_heap();
-  DCHECK(ro_heap->read_only_object_cache_is_initialized());
-  for (size_t i = 0, size = ro_heap->read_only_object_cache_size(); i < size;
-       i++) {
-    Handle<HeapObject> obj(
-        HeapObject::cast(ro_heap->cached_read_only_object(i)), isolate());
-    int cache_index = SerializeInObjectCache(obj);
-    USE(cache_index);
-    DCHECK_EQ(cache_index, i);
+void ReadOnlySerializer::Serialize() {
+  DisallowGarbageCollection no_gc;
+  ReadOnlyHeapImageSerializer::Serialize(isolate(), &sink_,
+                                         GetUnmappedRegions(isolate()));
+
+  ReadOnlyHeapObjectIterator it(isolate()->read_only_heap());
+  for (Tagged<HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
+    CheckRehashability(o);
+    if (v8_flags.serialization_statistics) {
+      CountAllocation(o->map(), o->Size(), SnapshotSpace::kReadOnlyHeap);
+    }
   }
 }
 
diff --git a/deps/v8/src/snapshot/read-only-serializer.h b/deps/v8/src/snapshot/read-only-serializer.h
index 4e5062c7da140f..a67ceb578da4f0 100644
--- a/deps/v8/src/snapshot/read-only-serializer.h
+++ b/deps/v8/src/snapshot/read-only-serializer.h
@@ -5,58 +5,31 @@
 #ifndef V8_SNAPSHOT_READ_ONLY_SERIALIZER_H_
 #define V8_SNAPSHOT_READ_ONLY_SERIALIZER_H_
 
-#include <unordered_set>
-
-#include "src/base/hashmap.h"
 #include "src/snapshot/roots-serializer.h"
 
 namespace v8 {
 namespace internal {
 
-class HeapObject;
-class SnapshotByteSink;
-
+// TODO(jgruber): Now that this does a memcpy-style serialization, there is no
+// longer a fundamental reason to inherit from RootsSerializer. It's still
+// convenient though because callers expect parts of the Serializer interface
+// (e.g.: rehashability, serialization statistics, blob creation).
+// Consider removing this inheritance.
 class V8_EXPORT_PRIVATE ReadOnlySerializer : public RootsSerializer {
  public:
   ReadOnlySerializer(Isolate* isolate, Snapshot::SerializerFlags flags);
   ~ReadOnlySerializer() override;
-  ReadOnlySerializer(const ReadOnlySerializer&) = delete;
-  ReadOnlySerializer& operator=(const ReadOnlySerializer&) = delete;
-
-  void SerializeReadOnlyRoots();
 
-  // Completes the serialization of the read-only object cache (after it has
-  // been filled by other serializers) and serializes any deferred objects.
-  void FinalizeSerialization();
+  // Serializes the entire ReadOnlySpace as well as the ReadOnlyRoots table.
+  void Serialize();
 
  private:
-  void ReconstructReadOnlyObjectCacheForTesting();
-
-  void SerializeObjectImpl(Handle<HeapObject> o) override;
-  bool MustBeDeferred(HeapObject object) override;
+  void SerializeObjectImpl(Handle<HeapObject> o, SlotType slot_type) override {
+    UNREACHABLE();
+  }
 
-  // If |obj| can be serialized in the read-only snapshot then add it to the
-  // read-only object cache if not already present and emit a
-  // ReadOnlyObjectCache bytecode into |sink|. Returns whether this was
-  // successful.
-  bool SerializeUsingReadOnlyObjectCache(SnapshotByteSink* sink,
-                                         Handle<HeapObject> obj);
-
-#ifdef V8_STATIC_ROOTS
-  using CodeEntryPointVector = std::vector<Address>;
-  void WipeCodeEntryPointsForDeterministicSerialization(
-      CodeEntryPointVector& saved_entry_points);
-  void RestoreCodeEntryPoints(const CodeEntryPointVector& saved_entry_points);
-#endif  // V8_STATIC_ROOTS
-
-#ifdef DEBUG
-  IdentityMap<int, base::DefaultAllocationPolicy> serialized_objects_;
-  bool did_serialize_not_mapped_symbol_;
-#endif
-
-  // For SerializeUsingReadOnlyObjectCache.
-  friend class SharedHeapSerializer;
-  friend class StartupSerializer;
+  ReadOnlySerializer(const ReadOnlySerializer&) = delete;
+  ReadOnlySerializer& operator=(const ReadOnlySerializer&) = delete;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/references.h b/deps/v8/src/snapshot/references.h
index 04753df5337094..37247b9a8c78b5 100644
--- a/deps/v8/src/snapshot/references.h
+++ b/deps/v8/src/snapshot/references.h
@@ -15,7 +15,7 @@ namespace internal {
 
 // Values must be contiguous and start at 0 since they're directly used as
 // array indices.
-enum class SnapshotSpace : byte {
+enum class SnapshotSpace : uint8_t {
   kReadOnlyHeap = 0,
   kOld = 1,
   kCode = 2,
@@ -104,7 +104,7 @@ class SerializerReferenceMap {
   explicit SerializerReferenceMap(Isolate* isolate)
       : map_(isolate->heap()), attached_reference_index_(0) {}
 
-  const SerializerReference* LookupReference(HeapObject object) const {
+  const SerializerReference* LookupReference(Tagged<HeapObject> object) const {
     return map_.Find(object);
   }
 
@@ -118,7 +118,7 @@ class SerializerReferenceMap {
     return &it->second;
   }
 
-  void Add(HeapObject object, SerializerReference reference) {
+  void Add(Tagged<HeapObject> object, SerializerReference reference) {
     DCHECK_NULL(LookupReference(object));
     map_.Insert(object, reference);
   }
@@ -128,7 +128,7 @@ class SerializerReferenceMap {
     backing_store_map_.emplace(backing_store, reference);
   }
 
-  SerializerReference AddAttachedReference(HeapObject object) {
+  SerializerReference AddAttachedReference(Tagged<HeapObject> object) {
     SerializerReference reference =
         SerializerReference::AttachedReference(attached_reference_index_++);
     map_.Insert(object, reference);
diff --git a/deps/v8/src/snapshot/roots-serializer.cc b/deps/v8/src/snapshot/roots-serializer.cc
index 393d5eb9c7a02a..3c42cfbebc59d7 100644
--- a/deps/v8/src/snapshot/roots-serializer.cc
+++ b/deps/v8/src/snapshot/roots-serializer.cc
@@ -29,7 +29,7 @@ int RootsSerializer::SerializeInObjectCache(Handle<HeapObject> heap_object) {
   if (!object_cache_index_map_.LookupOrInsert(*heap_object, &index)) {
     // This object is not part of the object cache yet. Add it to the cache so
     // we can refer to it via cache index from the delegating snapshot.
-    SerializeObject(heap_object);
+    SerializeObject(heap_object, SlotType::kAnySlot);
   }
   return index;
 }
@@ -57,10 +57,10 @@ void RootsSerializer::VisitRootPointers(Root root, const char* description,
   }
 }
 
-void RootsSerializer::CheckRehashability(HeapObject obj) {
+void RootsSerializer::CheckRehashability(Tagged<HeapObject> obj) {
   if (!can_be_rehashed_) return;
-  if (!obj.NeedsRehashing(cage_base())) return;
-  if (obj.CanBeRehashed(cage_base())) return;
+  if (!obj->NeedsRehashing(cage_base())) return;
+  if (obj->CanBeRehashed(cage_base())) return;
   can_be_rehashed_ = false;
 }
 
diff --git a/deps/v8/src/snapshot/roots-serializer.h b/deps/v8/src/snapshot/roots-serializer.h
index 739d8df9036e52..5d3c5658f74123 100644
--- a/deps/v8/src/snapshot/roots-serializer.h
+++ b/deps/v8/src/snapshot/roots-serializer.h
@@ -34,14 +34,14 @@ class RootsSerializer : public Serializer {
     return root_has_been_serialized_.test(static_cast<size_t>(root_index));
   }
 
-  bool IsRootAndHasBeenSerialized(HeapObject obj) const {
+  bool IsRootAndHasBeenSerialized(Tagged<HeapObject> obj) const {
     RootIndex root_index;
     return root_index_map()->Lookup(obj, &root_index) &&
            root_has_been_serialized(root_index);
   }
 
  protected:
-  void CheckRehashability(HeapObject obj);
+  void CheckRehashability(Tagged<HeapObject> obj);
 
   // Serializes |object| if not previously seen and returns its cache index.
   int SerializeInObjectCache(Handle<HeapObject> object);
diff --git a/deps/v8/src/snapshot/serializer-deserializer.cc b/deps/v8/src/snapshot/serializer-deserializer.cc
index 142fcea444898a..eb49a49b365fd2 100644
--- a/deps/v8/src/snapshot/serializer-deserializer.cc
+++ b/deps/v8/src/snapshot/serializer-deserializer.cc
@@ -19,7 +19,7 @@ void IterateObjectCache(Isolate* isolate, std::vector<Object>* cache,
     // During deserialization, the visitor populates the object cache and
     // eventually terminates the cache with undefined.
     visitor->VisitRootPointer(root_id, nullptr, FullObjectSlot(&cache->at(i)));
-    if (cache->at(i).IsUndefined(isolate)) break;
+    if (IsUndefined(cache->at(i), isolate)) break;
   }
 }
 }  // namespace
@@ -41,34 +41,40 @@ void SerializerDeserializer::IterateSharedHeapObjectCache(
                      Root::kSharedHeapObjectCache, visitor);
 }
 
-bool SerializerDeserializer::CanBeDeferred(HeapObject o) {
-  // 1. Maps cannot be deferred as objects are expected to have a valid map
-  // immediately.
-  // 2. Internalized strings cannot be deferred as they might be
-  // converted to thin strings during post processing, at which point forward
-  // references to the now-thin string will already have been written.
-  // 3. JS objects with embedder fields cannot be deferred because the
-  // serialize/deserialize callbacks need the back reference immediately to
-  // identify the object.
-  // 4. ByteArray cannot be deferred as JSTypedArray needs the base_pointer
-  // ByteArray immediately if it's on heap.
+bool SerializerDeserializer::CanBeDeferred(Tagged<HeapObject> o,
+                                           SlotType slot_type) {
+  // HeapObjects' map slots cannot be deferred as objects are expected to have a
+  // valid map immediately.
+  if (slot_type == SlotType::kMapSlot) {
+    DCHECK(IsMap(o));
+    return false;
+  }
+  // * Internalized strings cannot be deferred as they might be
+  //   converted to thin strings during post processing, at which point forward
+  //   references to the now-thin string will already have been written.
+  // * JS objects with embedder fields cannot be deferred because the
+  //   serialize/deserialize callbacks need the back reference immediately to
+  //   identify the object.
+  // * ByteArray cannot be deferred as JSTypedArray needs the base_pointer
+  //   ByteArray immediately if it's on heap.
+  //
   // TODO(leszeks): Could we defer string serialization if forward references
   // were resolved after object post processing?
-  return !o.IsMap() && !o.IsInternalizedString() &&
-         !(o.IsJSObject() && JSObject::cast(o).GetEmbedderFieldCount() > 0) &&
-         !o.IsByteArray();
+  return !IsInternalizedString(o) &&
+         !(IsJSObject(o) && JSObject::cast(o)->GetEmbedderFieldCount() > 0) &&
+         !IsByteArray(o);
 }
 
 void SerializerDeserializer::RestoreExternalReferenceRedirector(
-    Isolate* isolate, AccessorInfo accessor_info) {
+    Isolate* isolate, Tagged<AccessorInfo> accessor_info) {
   DisallowGarbageCollection no_gc;
-  accessor_info.init_getter_redirection(isolate);
+  accessor_info->init_getter_redirection(isolate);
 }
 
 void SerializerDeserializer::RestoreExternalReferenceRedirector(
-    Isolate* isolate, CallHandlerInfo call_handler_info) {
+    Isolate* isolate, Tagged<CallHandlerInfo> call_handler_info) {
   DisallowGarbageCollection no_gc;
-  call_handler_info.init_callback_redirection(isolate);
+  call_handler_info->init_callback_redirection(isolate);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/serializer-deserializer.h b/deps/v8/src/snapshot/serializer-deserializer.h
index 586e7f6f1377c6..968af391146538 100644
--- a/deps/v8/src/snapshot/serializer-deserializer.h
+++ b/deps/v8/src/snapshot/serializer-deserializer.h
@@ -25,15 +25,21 @@ class SerializerDeserializer : public RootVisitor {
                                            RootVisitor* visitor);
 
  protected:
-  static bool CanBeDeferred(HeapObject o);
+  enum class SlotType {
+    kAnySlot,
+    kMapSlot,
+  };
+  static bool CanBeDeferred(Tagged<HeapObject> o, SlotType slot_type);
 
   void RestoreExternalReferenceRedirector(Isolate* isolate,
-                                          AccessorInfo accessor_info);
-  void RestoreExternalReferenceRedirector(Isolate* isolate,
-                                          CallHandlerInfo call_handler_info);
+                                          Tagged<AccessorInfo> accessor_info);
+  void RestoreExternalReferenceRedirector(
+      Isolate* isolate, Tagged<CallHandlerInfo> call_handler_info);
 
-// clang-format off
+  // clang-format off
 #define UNUSED_SERIALIZER_BYTE_CODES(V)                           \
+  /* Free range 0x10..0x1f */                                     \
+  V(0x1b) V(0x1c) V(0x1d) V(0x1e) V(0x1f)                         \
   /* Free range 0x20..0x2f */                                     \
   V(0x20) V(0x21) V(0x22) V(0x23) V(0x24) V(0x25) V(0x26) V(0x27) \
   V(0x28) V(0x29) V(0x2a) V(0x2b) V(0x2c) V(0x2d) V(0x2e) V(0x2f) \
@@ -78,7 +84,7 @@ class SerializerDeserializer : public RootVisitor {
   // 8 hot (recently seen or back-referenced) objects with optional skip.
   static const int kHotObjectCount = 8;
 
-  enum Bytecode : byte {
+  enum Bytecode : uint8_t {
     //
     // ---------- byte code range 0x00..0x1f ----------
     //
@@ -95,8 +101,6 @@ class SerializerDeserializer : public RootVisitor {
     kRootArray,
     // Object provided in the attached list.
     kAttachedReference,
-    // Object in the read-only object cache.
-    kReadOnlyObjectCache,
     // Object in the shared heap object cache.
     kSharedHeapObjectCache,
     // Do nothing, used for padding.
@@ -120,11 +124,6 @@ class SerializerDeserializer : public RootVisitor {
     kApiReference,
     // External reference referenced by id.
     kExternalReference,
-    // External reference encoded as raw pointer. Can only be used when the
-    // snapshot will be deserialized again in the same Isolate, and so is only
-    // useful for testing. This is currently unused as unsandboxed raw external
-    // references are encoded as FixedRawData instead.
-    kRawExternalReference,
     // Same as three bytecodes above but for serializing sandboxed external
     // pointer values.
     // TODO(v8:10391): Remove them once all ExternalPointer usages are
@@ -132,13 +131,9 @@ class SerializerDeserializer : public RootVisitor {
     kSandboxedApiReference,
     kSandboxedExternalReference,
     kSandboxedRawExternalReference,
-    // Internal reference of a code objects in code stream.
-    kInternalReference,
     // In-place weak references.
     kClearedWeakReference,
     kWeakPrefix,
-    // Encodes an off-heap instruction stream target.
-    kOffHeapTarget,
     // Registers the current slot as a "pending" forward reference, to be later
     // filled by a corresponding resolution bytecode.
     kRegisterPendingForwardRef,
@@ -152,10 +147,10 @@ class SerializerDeserializer : public RootVisitor {
     // register as the pending field. We could either hack around this, or
     // simply introduce this new bytecode.
     kNewMetaMap,
-    // Special construction bytecode for InstructionStream object bodies, which
-    // have a more
-    // complex deserialization ordering and RelocInfo processing.
-    kCodeBody,
+    // When the sandbox is enabled, a prefix indicating that the following
+    // object is referenced through an indirect pointer, i.e. through an entry
+    // in a pointer table.
+    kIndirectPointerPrefix,
 
     //
     // ---------- byte code range 0x40..0x7f ----------
@@ -196,12 +191,13 @@ class SerializerDeserializer : public RootVisitor {
       return base::IsInRange(static_cast<int>(value), kMinValue, kMaxValue);
     }
 
-    static constexpr byte Encode(TValue value) {
+    static constexpr uint8_t Encode(TValue value) {
       DCHECK(IsEncodable(value));
-      return static_cast<byte>(kBytecode + static_cast<int>(value) - kMinValue);
+      return static_cast<uint8_t>(kBytecode + static_cast<int>(value) -
+                                  kMinValue);
     }
 
-    static constexpr TValue Decode(byte bytecode) {
+    static constexpr TValue Decode(uint8_t bytecode) {
       DCHECK(base::IsInRange(bytecode, Encode(static_cast<TValue>(kMinValue)),
                              Encode(static_cast<TValue>(kMaxValue))));
       return static_cast<TValue>(bytecode - kBytecode + kMinValue);
diff --git a/deps/v8/src/snapshot/serializer-inl.h b/deps/v8/src/snapshot/serializer-inl.h
index 3767f192e5d146..487efe35a995e7 100644
--- a/deps/v8/src/snapshot/serializer-inl.h
+++ b/deps/v8/src/snapshot/serializer-inl.h
@@ -11,7 +11,7 @@
 namespace v8 {
 namespace internal {
 
-bool Serializer::IsNotMappedSymbol(HeapObject obj) const {
+bool Serializer::IsNotMappedSymbol(Tagged<HeapObject> obj) const {
   Object not_mapped_symbol = ReadOnlyRoots(isolate()).not_mapped_symbol();
   if (V8_EXTERNAL_CODE_SPACE_BOOL) {
     // It's possible that a InstructionStream object might have the same
diff --git a/deps/v8/src/snapshot/serializer.cc b/deps/v8/src/snapshot/serializer.cc
index 99f7ee1cebf3a7..cb1120e3fdf639 100644
--- a/deps/v8/src/snapshot/serializer.cc
+++ b/deps/v8/src/snapshot/serializer.cc
@@ -58,13 +58,14 @@ Serializer::Serializer(Isolate* isolate, Snapshot::SerializerFlags flags)
 void Serializer::PopStack() { stack_.Pop(); }
 #endif
 
-void Serializer::CountAllocation(Map map, int size, SnapshotSpace space) {
+void Serializer::CountAllocation(Tagged<Map> map, int size,
+                                 SnapshotSpace space) {
   DCHECK(v8_flags.serialization_statistics);
 
   const int space_number = static_cast<int>(space);
   allocation_size_[space_number] += size;
 #ifdef VERBOSE_SERIALIZATION_STATISTICS
-  int instance_type = map.instance_type();
+  int instance_type = map->instance_type();
   instance_type_count_[space_number][instance_type]++;
   instance_type_size_[space_number][instance_type] += size;
 #endif  // VERBOSE_SERIALIZATION_STATISTICS
@@ -149,24 +150,24 @@ void Serializer::SerializeDeferredObjects() {
   sink_.Put(kSynchronize, "Finished with deferred objects");
 }
 
-void Serializer::SerializeObject(Handle<HeapObject> obj) {
+void Serializer::SerializeObject(Handle<HeapObject> obj, SlotType slot_type) {
   // ThinStrings are just an indirection to an internalized string, so elide the
   // indirection and serialize the actual string directly.
-  if (obj->IsThinString(isolate())) {
-    obj = handle(ThinString::cast(*obj).actual(isolate()), isolate());
-  } else if (obj->IsCode(isolate())) {
+  if (IsThinString(*obj, isolate())) {
+    obj = handle(ThinString::cast(*obj)->actual(isolate()), isolate());
+  } else if (IsCode(*obj, isolate())) {
     Code code = Code::cast(*obj);
-    if (code.kind() == CodeKind::BASELINE) {
+    if (code->kind() == CodeKind::BASELINE) {
       // For now just serialize the BytecodeArray instead of baseline code.
       // TODO(v8:11429,pthier): Handle Baseline code in cases we want to
       // serialize it.
-      obj = handle(code.bytecode_or_interpreter_data(isolate()), isolate());
+      obj = handle(code->bytecode_or_interpreter_data(isolate()), isolate());
     }
   }
-  SerializeObjectImpl(obj);
+  SerializeObjectImpl(obj, slot_type);
 }
 
-bool Serializer::MustBeDeferred(HeapObject object) { return false; }
+bool Serializer::MustBeDeferred(Tagged<HeapObject> object) { return false; }
 
 void Serializer::VisitRootPointers(Root root, const char* description,
                                    FullObjectSlot start, FullObjectSlot end) {
@@ -177,10 +178,10 @@ void Serializer::VisitRootPointers(Root root, const char* description,
 
 void Serializer::SerializeRootObject(FullObjectSlot slot) {
   Object o = *slot;
-  if (o.IsSmi()) {
+  if (IsSmi(o)) {
     PutSmiRoot(slot);
   } else {
-    SerializeObject(Handle<HeapObject>(slot.location()));
+    SerializeObject(Handle<HeapObject>(slot.location()), SlotType::kAnySlot);
   }
 }
 
@@ -189,13 +190,13 @@ void Serializer::PrintStack() { PrintStack(std::cout); }
 
 void Serializer::PrintStack(std::ostream& out) {
   for (const auto o : stack_) {
-    o->Print(out);
+    Print(*o, out);
     out << "\n";
   }
 }
 #endif  // DEBUG
 
-bool Serializer::SerializeRoot(HeapObject obj) {
+bool Serializer::SerializeRoot(Tagged<HeapObject> obj) {
   RootIndex root_index;
   // Derived serializers are responsible for determining if the root has
   // actually been serialized before calling this.
@@ -206,7 +207,7 @@ bool Serializer::SerializeRoot(HeapObject obj) {
   return false;
 }
 
-bool Serializer::SerializeHotObject(HeapObject obj) {
+bool Serializer::SerializeHotObject(Tagged<HeapObject> obj) {
   DisallowGarbageCollection no_gc;
   // Encode a reference to a hot object by its index in the working set.
   int index = hot_objects_.Find(obj);
@@ -214,21 +215,21 @@ bool Serializer::SerializeHotObject(HeapObject obj) {
   DCHECK(index >= 0 && index < kHotObjectCount);
   if (v8_flags.trace_serializer) {
     PrintF(" Encoding hot object %d:", index);
-    obj.ShortPrint();
+    ShortPrint(obj);
     PrintF("\n");
   }
   sink_.Put(HotObject::Encode(index), "HotObject");
   return true;
 }
 
-bool Serializer::SerializeBackReference(HeapObject obj) {
+bool Serializer::SerializeBackReference(Tagged<HeapObject> obj) {
   DisallowGarbageCollection no_gc;
   const SerializerReference* reference = reference_map_.LookupReference(obj);
   if (reference == nullptr) return false;
   // Encode the location of an already deserialized object in order to write
   // its location into a later object.  We can encode the location as an
   // offset fromthe start of the deserialized objects or as an offset
-  // backwards from thecurrent allocation pointer.
+  // backwards from the current allocation pointer.
   if (reference->is_attached_reference()) {
     if (v8_flags.trace_serializer) {
       PrintF(" Encoding attached reference %d\n",
@@ -239,7 +240,7 @@ bool Serializer::SerializeBackReference(HeapObject obj) {
     DCHECK(reference->is_back_reference());
     if (v8_flags.trace_serializer) {
       PrintF(" Encoding back reference to: ");
-      obj.ShortPrint();
+      ShortPrint(obj);
       PrintF("\n");
     }
 
@@ -249,7 +250,7 @@ bool Serializer::SerializeBackReference(HeapObject obj) {
   return true;
 }
 
-bool Serializer::SerializePendingObject(HeapObject obj) {
+bool Serializer::SerializePendingObject(Tagged<HeapObject> obj) {
   PendingObjectReferences* refs_to_object =
       forward_refs_per_pending_object_.Find(obj);
   if (refs_to_object == nullptr) {
@@ -259,18 +260,18 @@ bool Serializer::SerializePendingObject(HeapObject obj) {
   return true;
 }
 
-bool Serializer::ObjectIsBytecodeHandler(HeapObject obj) const {
-  if (!obj.IsCode()) return false;
-  return (Code::cast(obj).kind() == CodeKind::BYTECODE_HANDLER);
+bool Serializer::ObjectIsBytecodeHandler(Tagged<HeapObject> obj) const {
+  if (!IsCode(obj)) return false;
+  return (Code::cast(obj)->kind() == CodeKind::BYTECODE_HANDLER);
 }
 
 void Serializer::PutRoot(RootIndex root) {
   DisallowGarbageCollection no_gc;
   int root_index = static_cast<int>(root);
-  HeapObject object = HeapObject::cast(isolate()->root(root));
+  Tagged<HeapObject> object = HeapObject::cast(isolate()->root(root));
   if (v8_flags.trace_serializer) {
     PrintF(" Encoding root %d:", root_index);
-    object.ShortPrint();
+    ShortPrint(object);
     PrintF("\n");
   }
 
@@ -285,7 +286,7 @@ void Serializer::PutRoot(RootIndex root) {
     sink_.Put(RootArrayConstant::Encode(root), "RootConstant");
   } else {
     sink_.Put(kRootArray, "RootSerialization");
-    sink_.PutInt(root_index, "root_index");
+    sink_.PutUint30(root_index, "root_index");
     hot_objects_.Add(object);
   }
 }
@@ -301,21 +302,22 @@ void Serializer::PutSmiRoot(FullObjectSlot slot) {
   sink_.Put(FixedRawDataWithSize::Encode(size_in_tagged), "Smi");
 
   Address raw_value = Smi::cast(*slot).ptr();
-  const byte* raw_value_as_bytes = reinterpret_cast<const byte*>(&raw_value);
+  const uint8_t* raw_value_as_bytes =
+      reinterpret_cast<const uint8_t*>(&raw_value);
   sink_.PutRaw(raw_value_as_bytes, bytes_to_output, "Bytes");
 }
 
-void Serializer::PutBackReference(HeapObject object,
+void Serializer::PutBackReference(Tagged<HeapObject> object,
                                   SerializerReference reference) {
   DCHECK_EQ(object, *back_refs_[reference.back_ref_index()]);
-  sink_.PutInt(reference.back_ref_index(), "BackRefIndex");
+  sink_.PutUint30(reference.back_ref_index(), "BackRefIndex");
   hot_objects_.Add(object);
 }
 
 void Serializer::PutAttachedReference(SerializerReference reference) {
   DCHECK(reference.is_attached_reference());
   sink_.Put(kAttachedReference, "AttachedRef");
-  sink_.PutInt(reference.attached_reference_index(), "AttachedRefIndex");
+  sink_.PutUint30(reference.attached_reference_index(), "AttachedRefIndex");
 }
 
 void Serializer::PutRepeat(int repeat_count) {
@@ -323,7 +325,7 @@ void Serializer::PutRepeat(int repeat_count) {
     sink_.Put(FixedRepeatWithCount::Encode(repeat_count), "FixedRepeat");
   } else {
     sink_.Put(kVariableRepeat, "VariableRepeat");
-    sink_.PutInt(VariableRepeatCount::Encode(repeat_count), "repeat count");
+    sink_.PutUint30(VariableRepeatCount::Encode(repeat_count), "repeat count");
   }
 }
 
@@ -344,7 +346,7 @@ void Serializer::PutPendingForwardReference(PendingObjectReferences& refs) {
 
 void Serializer::ResolvePendingForwardReference(int forward_reference_id) {
   sink_.Put(kResolvePendingForwardRef, "ResolvePendingForwardRef");
-  sink_.PutInt(forward_reference_id, "with this index");
+  sink_.PutUint30(forward_reference_id, "with this index");
   unresolved_forward_refs_--;
 
   // If there are no more unresolved forward refs, reset the forward ref id to
@@ -371,7 +373,7 @@ ExternalReferenceEncoder::Value Serializer::EncodeExternalReference(
   return result.FromJust();
 }
 
-void Serializer::RegisterObjectIsPending(HeapObject obj) {
+void Serializer::RegisterObjectIsPending(Tagged<HeapObject> obj) {
   DisallowGarbageCollection no_gc;
   if (IsNotMappedSymbol(obj)) return;
 
@@ -384,10 +386,11 @@ void Serializer::RegisterObjectIsPending(HeapObject obj) {
   // deferred objects queue though, since it may be the very object we just
   // popped off that queue, so just check that it can be deferred.
   DCHECK_IMPLIES(find_result.already_exists, *find_result.entry != nullptr);
-  DCHECK_IMPLIES(find_result.already_exists, CanBeDeferred(obj));
+  DCHECK_IMPLIES(find_result.already_exists,
+                 CanBeDeferred(obj, SlotType::kAnySlot));
 }
 
-void Serializer::ResolvePendingObject(HeapObject obj) {
+void Serializer::ResolvePendingObject(Tagged<HeapObject> obj) {
   DisallowGarbageCollection no_gc;
   if (IsNotMappedSymbol(obj)) return;
 
@@ -420,16 +423,17 @@ void Serializer::InitializeCodeAddressMap() {
   code_address_map_ = std::make_unique<CodeAddressMap>(isolate_);
 }
 
-InstructionStream Serializer::CopyCode(InstructionStream code) {
+Tagged<InstructionStream> Serializer::CopyCode(
+    Tagged<InstructionStream> istream) {
   code_buffer_.clear();  // Clear buffer without deleting backing store.
   // Add InstructionStream padding which is usually added by the allocator.
   // While this doesn't guarantee the exact same alignment, it's enough to
   // fulfill the alignment requirements of writes during relocation.
   code_buffer_.resize(InstructionStream::kCodeAlignmentMinusCodeHeader);
-  int size = code.CodeSize();
+  int size = istream->Size();
   code_buffer_.insert(code_buffer_.end(),
-                      reinterpret_cast<byte*>(code.address()),
-                      reinterpret_cast<byte*>(code.address() + size));
+                      reinterpret_cast<uint8_t*>(istream.address()),
+                      reinterpret_cast<uint8_t*>(istream.address() + size));
   // When pointer compression is enabled the checked cast will try to
   // decompress map field of off-heap InstructionStream object.
   return InstructionStream::unchecked_cast(
@@ -438,7 +442,8 @@ InstructionStream Serializer::CopyCode(InstructionStream code) {
 }
 
 void Serializer::ObjectSerializer::SerializePrologue(SnapshotSpace space,
-                                                     int size, Map map) {
+                                                     int size,
+                                                     Tagged<Map> map) {
   if (serializer_->code_address_map_) {
     const char* code_name =
         serializer_->code_address_map_->Lookup(object_->address());
@@ -456,17 +461,17 @@ void Serializer::ObjectSerializer::SerializePrologue(SnapshotSpace space,
     sink_->Put(NewObject::Encode(space), "NewObject");
 
     // TODO(leszeks): Skip this when the map has a fixed size.
-    sink_->PutInt(size >> kObjectAlignmentBits, "ObjectSizeInWords");
+    sink_->PutUint30(size >> kObjectAlignmentBits, "ObjectSizeInWords");
 
     // Until the space for the object is allocated, it is considered "pending".
     serializer_->RegisterObjectIsPending(*object_);
 
     // Serialize map (first word of the object) before anything else, so that
     // the deserializer can access it when allocating. Make sure that the map
-    // isn't a pending object.
-    DCHECK_NULL(serializer_->forward_refs_per_pending_object_.Find(map));
-    DCHECK(map.IsMap());
-    serializer_->SerializeObject(handle(map, isolate()));
+    // is known to be being serialized for the map slot, so that it is not
+    // deferred.
+    DCHECK(IsMap(map));
+    serializer_->SerializeObject(handle(map, isolate()), SlotType::kMapSlot);
 
     // Make sure the map serialization didn't accidentally recursively serialize
     // this object.
@@ -483,6 +488,14 @@ void Serializer::ObjectSerializer::SerializePrologue(SnapshotSpace space,
     serializer_->CountAllocation(object_->map(), size, space);
   }
 
+  // The snapshot should only contain internalized strings (since these end up
+  // in RO space). If this DCHECK fails, allocate the object_ String through
+  // Factory::InternalizeString instead.
+  // TODO(jgruber,v8:13789): Try to enable this DCHECK once custom snapshots
+  // can extend RO space. We may have to do a pass over the heap prior to
+  // serialization that in-place converts all strings to internalized strings.
+  // DCHECK_IMPLIES(object_->IsString(), object_->IsInternalizedString());
+
   // Mark this object as already serialized, and add it to the reference map so
   // that it can be accessed by backreference by future objects.
   serializer_->num_back_refs_++;
@@ -506,7 +519,8 @@ void Serializer::ObjectSerializer::SerializePrologue(SnapshotSpace space,
 }
 
 uint32_t Serializer::ObjectSerializer::SerializeBackingStore(
-    void* backing_store, int32_t byte_length, Maybe<int32_t> max_byte_length) {
+    void* backing_store, uint32_t byte_length,
+    Maybe<uint32_t> max_byte_length) {
   DisallowGarbageCollection no_gc;
   const SerializerReference* reference_ptr =
       serializer_->reference_map()->LookupBackingStore(backing_store);
@@ -521,11 +535,12 @@ uint32_t Serializer::ObjectSerializer::SerializeBackingStore(
   } else {
     sink_->Put(kOffHeapBackingStore, "Off-heap backing store");
   }
-  sink_->PutInt(byte_length, "length");
+  sink_->PutUint32(byte_length, "length");
   if (max_byte_length.IsJust()) {
-    sink_->PutInt(max_byte_length.FromJust(), "max length");
+    sink_->PutUint32(max_byte_length.FromJust(), "max length");
   }
-  sink_->PutRaw(static_cast<byte*>(backing_store), byte_length, "BackingStore");
+  sink_->PutRaw(static_cast<uint8_t*>(backing_store), byte_length,
+                "BackingStore");
   DCHECK_NE(0, serializer_->seen_backing_stores_index_);
   SerializerReference reference =
       SerializerReference::OffHeapBackingStoreReference(
@@ -539,36 +554,37 @@ void Serializer::ObjectSerializer::SerializeJSTypedArray() {
   {
     DisallowGarbageCollection no_gc;
     JSTypedArray typed_array = JSTypedArray::cast(*object_);
-    if (typed_array.is_on_heap()) {
-      typed_array.RemoveExternalPointerCompensationForSerialization(isolate());
+    if (typed_array->is_on_heap()) {
+      typed_array->RemoveExternalPointerCompensationForSerialization(isolate());
     } else {
-      if (!typed_array.IsDetachedOrOutOfBounds()) {
+      if (!typed_array->IsDetachedOrOutOfBounds()) {
         // Explicitly serialize the backing store now.
-        JSArrayBuffer buffer = JSArrayBuffer::cast(typed_array.buffer());
-        // We cannot store byte_length or max_byte_length larger than int32
+        JSArrayBuffer buffer = JSArrayBuffer::cast(typed_array->buffer());
+        // We cannot store byte_length or max_byte_length larger than uint32
         // range in the snapshot.
-        size_t byte_length_size = buffer.GetByteLength();
-        CHECK_LE(byte_length_size, size_t{std::numeric_limits<int32_t>::max()});
-        int32_t byte_length = static_cast<int32_t>(byte_length_size);
-        Maybe<int32_t> max_byte_length = Nothing<int32_t>();
-        if (buffer.is_resizable_by_js()) {
-          CHECK_LE(buffer.max_byte_length(),
-                   std::numeric_limits<int32_t>::max());
+        size_t byte_length_size = buffer->GetByteLength();
+        CHECK_LE(byte_length_size,
+                 size_t{std::numeric_limits<uint32_t>::max()});
+        uint32_t byte_length = static_cast<uint32_t>(byte_length_size);
+        Maybe<uint32_t> max_byte_length = Nothing<uint32_t>();
+        if (buffer->is_resizable_by_js()) {
+          CHECK_LE(buffer->max_byte_length(),
+                   std::numeric_limits<uint32_t>::max());
           max_byte_length =
-              Just(static_cast<int32_t>(buffer.max_byte_length()));
+              Just(static_cast<uint32_t>(buffer->max_byte_length()));
         }
-        size_t byte_offset = typed_array.byte_offset();
+        size_t byte_offset = typed_array->byte_offset();
 
         // We need to calculate the backing store from the data pointer
         // because the ArrayBuffer may already have been serialized.
         void* backing_store = reinterpret_cast<void*>(
-            reinterpret_cast<Address>(typed_array.DataPtr()) - byte_offset);
+            reinterpret_cast<Address>(typed_array->DataPtr()) - byte_offset);
 
         uint32_t ref =
             SerializeBackingStore(backing_store, byte_length, max_byte_length);
-        typed_array.SetExternalBackingStoreRefForSerialization(ref);
+        typed_array->SetExternalBackingStoreRefForSerialization(ref);
       } else {
-        typed_array.SetExternalBackingStoreRefForSerialization(0);
+        typed_array->SetExternalBackingStoreRefForSerialization(0);
       }
     }
   }
@@ -581,36 +597,36 @@ void Serializer::ObjectSerializer::SerializeJSArrayBuffer() {
   {
     DisallowGarbageCollection no_gc;
     JSArrayBuffer buffer = JSArrayBuffer::cast(*object_);
-    backing_store = buffer.backing_store();
-    // We cannot store byte_length or max_byte_length larger than int32 range in
-    // the snapshot.
-    CHECK_LE(buffer.byte_length(), std::numeric_limits<int32_t>::max());
-    int32_t byte_length = static_cast<int32_t>(buffer.byte_length());
-    Maybe<int32_t> max_byte_length = Nothing<int32_t>();
-    if (buffer.is_resizable_by_js()) {
-      CHECK_LE(buffer.max_byte_length(), std::numeric_limits<int32_t>::max());
-      max_byte_length = Just(static_cast<int32_t>(buffer.max_byte_length()));
+    backing_store = buffer->backing_store();
+    // We cannot store byte_length or max_byte_length larger than uint32 range
+    // in the snapshot.
+    CHECK_LE(buffer->byte_length(), std::numeric_limits<uint32_t>::max());
+    uint32_t byte_length = static_cast<uint32_t>(buffer->byte_length());
+    Maybe<uint32_t> max_byte_length = Nothing<uint32_t>();
+    if (buffer->is_resizable_by_js()) {
+      CHECK_LE(buffer->max_byte_length(), std::numeric_limits<uint32_t>::max());
+      max_byte_length = Just(static_cast<uint32_t>(buffer->max_byte_length()));
     }
-    extension = buffer.extension();
+    extension = buffer->extension();
 
     // Only serialize non-empty backing stores.
-    if (buffer.IsEmpty()) {
-      buffer.SetBackingStoreRefForSerialization(kEmptyBackingStoreRefSentinel);
+    if (buffer->IsEmpty()) {
+      buffer->SetBackingStoreRefForSerialization(kEmptyBackingStoreRefSentinel);
     } else {
       uint32_t ref =
           SerializeBackingStore(backing_store, byte_length, max_byte_length);
-      buffer.SetBackingStoreRefForSerialization(ref);
+      buffer->SetBackingStoreRefForSerialization(ref);
     }
 
     // Ensure deterministic output by setting extension to null during
     // serialization.
-    buffer.set_extension(nullptr);
+    buffer->set_extension(nullptr);
   }
   SerializeObject();
   {
     JSArrayBuffer buffer = JSArrayBuffer::cast(*object_);
-    buffer.set_backing_store(isolate(), backing_store);
-    buffer.set_extension(extension);
+    buffer->set_backing_store(isolate(), backing_store);
+    buffer->set_extension(extension);
   }
 }
 
@@ -645,27 +661,28 @@ void Serializer::ObjectSerializer::SerializeExternalStringAsSequentialString() {
   // an imaginary sequential string with the same content.
   ReadOnlyRoots roots(isolate());
   PtrComprCageBase cage_base(isolate());
-  DCHECK(object_->IsExternalString(cage_base));
+  DCHECK(IsExternalString(*object_, cage_base));
   Handle<ExternalString> string = Handle<ExternalString>::cast(object_);
   int length = string->length();
-  Map map;
+  Tagged<Map> map;
   int content_size;
   int allocation_size;
-  const byte* resource;
+  const uint8_t* resource;
   // Find the map and size for the imaginary sequential string.
-  bool internalized = object_->IsInternalizedString(cage_base);
-  if (object_->IsExternalOneByteString(cage_base)) {
-    map = internalized ? roots.one_byte_internalized_string_map()
-                       : roots.one_byte_string_map();
+  bool internalized = IsInternalizedString(*object_, cage_base);
+  if (IsExternalOneByteString(*object_, cage_base)) {
+    map = internalized ? roots.internalized_one_byte_string_map()
+                       : roots.seq_one_byte_string_map();
     allocation_size = SeqOneByteString::SizeFor(length);
     content_size = length * kCharSize;
-    resource = reinterpret_cast<const byte*>(
+    resource = reinterpret_cast<const uint8_t*>(
         Handle<ExternalOneByteString>::cast(string)->resource()->data());
   } else {
-    map = internalized ? roots.internalized_string_map() : roots.string_map();
+    map = internalized ? roots.internalized_two_byte_string_map()
+                       : roots.seq_two_byte_string_map();
     allocation_size = SeqTwoByteString::SizeFor(length);
     content_size = length * kShortSize;
-    resource = reinterpret_cast<const byte*>(
+    resource = reinterpret_cast<const uint8_t*>(
         Handle<ExternalTwoByteString>::cast(string)->resource()->data());
   }
 
@@ -679,10 +696,10 @@ void Serializer::ObjectSerializer::SerializeExternalStringAsSequentialString() {
 
   // Output raw data header. Do not bother with common raw length cases here.
   sink_->Put(kVariableRawData, "RawDataForString");
-  sink_->PutInt(slots_to_output, "length");
+  sink_->PutUint30(slots_to_output, "length");
 
   // Serialize string header (except for map).
-  byte* string_start = reinterpret_cast<byte*>(string->address());
+  uint8_t* string_start = reinterpret_cast<uint8_t*>(string->address());
   for (int i = HeapObject::kHeaderSize; i < SeqString::kHeaderSize; i++) {
     sink_->Put(string_start[i], "StringHeader");
   }
@@ -695,7 +712,7 @@ void Serializer::ObjectSerializer::SerializeExternalStringAsSequentialString() {
   int padding_size = allocation_size - SeqString::kHeaderSize - content_size;
   DCHECK(0 <= padding_size && padding_size < kObjectAlignment);
   for (int i = 0; i < padding_size; i++) {
-    sink_->Put(static_cast<byte>(0), "StringPadding");
+    sink_->Put(static_cast<uint8_t>(0), "StringPadding");
   }
 }
 
@@ -703,42 +720,42 @@ void Serializer::ObjectSerializer::SerializeExternalStringAsSequentialString() {
 // TODO(all): replace this with proper iteration of weak slots in serializer.
 class V8_NODISCARD UnlinkWeakNextScope {
  public:
-  explicit UnlinkWeakNextScope(Heap* heap, HeapObject object) {
+  explicit UnlinkWeakNextScope(Heap* heap, Tagged<HeapObject> object) {
     Isolate* isolate = heap->isolate();
-    if (object.IsAllocationSite(isolate) &&
-        AllocationSite::cast(object).HasWeakNext()) {
+    if (IsAllocationSite(object, isolate) &&
+        AllocationSite::cast(object)->HasWeakNext()) {
       object_ = object;
-      next_ = AllocationSite::cast(object).weak_next();
-      AllocationSite::cast(object).set_weak_next(
+      next_ = AllocationSite::cast(object)->weak_next();
+      AllocationSite::cast(object)->set_weak_next(
           ReadOnlyRoots(isolate).undefined_value());
     }
   }
 
   ~UnlinkWeakNextScope() {
     if (next_ == Smi::zero()) return;
-    AllocationSite::cast(object_).set_weak_next(next_, UPDATE_WRITE_BARRIER);
+    AllocationSite::cast(object_)->set_weak_next(next_, UPDATE_WRITE_BARRIER);
   }
 
  private:
-  HeapObject object_;
+  Tagged<HeapObject> object_;
   Object next_ = Smi::zero();
   DISALLOW_GARBAGE_COLLECTION(no_gc_)
 };
 
-void Serializer::ObjectSerializer::Serialize() {
+void Serializer::ObjectSerializer::Serialize(SlotType slot_type) {
   RecursionScope recursion(serializer_);
 
   {
     DisallowGarbageCollection no_gc;
-    HeapObject raw = *object_;
+    Tagged<HeapObject> raw = *object_;
     // Defer objects as "pending" if they cannot be serialized now, or if we
     // exceed a certain recursion depth. Some objects cannot be deferred.
-    if ((recursion.ExceedsMaximum() && CanBeDeferred(raw)) ||
-        serializer_->MustBeDeferred(raw)) {
-      DCHECK(CanBeDeferred(raw));
+    bool should_defer =
+        recursion.ExceedsMaximum() || serializer_->MustBeDeferred(raw);
+    if (should_defer && CanBeDeferred(raw, slot_type)) {
       if (v8_flags.trace_serializer) {
         PrintF(" Deferring heap object: ");
-        object_->ShortPrint();
+        ShortPrint(*object_);
         PrintF("\n");
       }
       // Deferred objects are considered "pending".
@@ -747,17 +764,24 @@ void Serializer::ObjectSerializer::Serialize() {
           *serializer_->forward_refs_per_pending_object_.Find(raw));
       serializer_->QueueDeferredObject(raw);
       return;
+    } else {
+      if (v8_flags.trace_serializer && recursion.ExceedsMaximum()) {
+        PrintF(" Exceeding max recursion depth by %d for: ",
+               recursion.ExceedsMaximumBy());
+        ShortPrint(*object_);
+        PrintF("\n");
+      }
     }
 
     if (v8_flags.trace_serializer) {
       PrintF(" Encoding heap object: ");
-      object_->ShortPrint();
+      ShortPrint(*object_);
       PrintF("\n");
     }
   }
 
   PtrComprCageBase cage_base(isolate());
-  InstanceType instance_type = object_->map(cage_base).instance_type();
+  InstanceType instance_type = object_->map(cage_base)->instance_type();
   if (InstanceTypeChecker::IsExternalString(instance_type)) {
     SerializeExternalString();
     return;
@@ -772,22 +796,29 @@ void Serializer::ObjectSerializer::Serialize() {
   }
   if (InstanceTypeChecker::IsScript(instance_type)) {
     // Clear cached line ends & compiled lazy function positions.
-    Oddball undefined = ReadOnlyRoots(isolate()).undefined_value();
-    Handle<Script>::cast(object_)->set_line_ends(undefined);
+    Handle<Script>::cast(object_)->set_line_ends(Smi::zero());
     Handle<Script>::cast(object_)->set_compiled_lazy_function_positions(
-        undefined);
+        ReadOnlyRoots(isolate()).undefined_value());
   }
 
-  // We don't expect fillers.
-  DCHECK(!object_->IsFreeSpaceOrFiller(cage_base));
+#if V8_ENABLE_WEBASSEMBLY
+  // The padding for wasm null is a free space filler. We put it into the roots
+  // table to be able to skip its payload when serializing the read only heap
+  // in the ReadOnlyHeapImageSerializer.
+  DCHECK_IMPLIES(
+      !object_->SafeEquals(ReadOnlyRoots(isolate()).wasm_null_padding()),
+      !IsFreeSpaceOrFiller(*object_, cage_base));
+#else
+  DCHECK(!IsFreeSpaceOrFiller(*object_, cage_base));
+#endif
 
   SerializeObject();
 }
 
 namespace {
-SnapshotSpace GetSnapshotSpace(HeapObject object) {
+SnapshotSpace GetSnapshotSpace(Tagged<HeapObject> object) {
   if (V8_ENABLE_THIRD_PARTY_HEAP_BOOL) {
-    if (object.IsInstructionStream()) {
+    if (IsInstructionStream(object)) {
       return SnapshotSpace::kCode;
     } else if (ReadOnlyHeap::Contains(object)) {
       return SnapshotSpace::kReadOnlyHeap;
@@ -828,7 +859,7 @@ SnapshotSpace GetSnapshotSpace(HeapObject object) {
 }  // namespace
 
 void Serializer::ObjectSerializer::SerializeObject() {
-  Map map = object_->map(serializer_->cage_base());
+  Tagged<Map> map = object_->map(serializer_->cage_base());
   int size = object_->SizeFromMap(map);
 
   // Descriptor arrays have complex element weakness, that is dependent on the
@@ -859,7 +890,7 @@ void Serializer::ObjectSerializer::SerializeDeferred() {
   if (back_reference != nullptr) {
     if (v8_flags.trace_serializer) {
       PrintF(" Deferred heap object ");
-      object_->ShortPrint();
+      ShortPrint(*object_);
       PrintF(" was already serialized\n");
     }
     return;
@@ -868,30 +899,25 @@ void Serializer::ObjectSerializer::SerializeDeferred() {
   if (v8_flags.trace_serializer) {
     PrintF(" Encoding deferred heap object\n");
   }
-  Serialize();
+  Serialize(SlotType::kAnySlot);
 }
 
-void Serializer::ObjectSerializer::SerializeContent(Map map, int size) {
-  HeapObject raw = *object_;
+void Serializer::ObjectSerializer::SerializeContent(Tagged<Map> map, int size) {
+  Tagged<HeapObject> raw = *object_;
   UnlinkWeakNextScope unlink_weak_next(isolate()->heap(), raw);
-  if (raw.IsInstructionStream()) {
-    // For InstructionStream objects, perform a custom serialization.
-    SerializeInstructionStream(map, size);
-  } else {
-    // For other objects, iterate references first.
-    raw.IterateBody(map, size, this);
-    // Then output data payload, if any.
-    OutputRawData(raw.address() + size);
-  }
+  // Iterate references first.
+  raw->IterateBody(map, size, this);
+  // Then output data payload, if any.
+  OutputRawData(raw.address() + size);
 }
 
-void Serializer::ObjectSerializer::VisitPointers(HeapObject host,
+void Serializer::ObjectSerializer::VisitPointers(Tagged<HeapObject> host,
                                                  ObjectSlot start,
                                                  ObjectSlot end) {
   VisitPointers(host, MaybeObjectSlot(start), MaybeObjectSlot(end));
 }
 
-void Serializer::ObjectSerializer::VisitPointers(HeapObject host,
+void Serializer::ObjectSerializer::VisitPointers(Tagged<HeapObject> host,
                                                  MaybeObjectSlot start,
                                                  MaybeObjectSlot end) {
   HandleScope scope(isolate());
@@ -908,12 +934,12 @@ void Serializer::ObjectSerializer::VisitPointers(HeapObject host,
     }
     // TODO(ishell): Revisit this change once we stick to 32-bit compressed
     // tagged values.
-    while (current < end && current.load(cage_base).IsCleared()) {
+    while (current < end && current.load(cage_base)->IsCleared()) {
       sink_->Put(kClearedWeakReference, "ClearedWeakReference");
       bytes_processed_so_far_ += kTaggedSize;
       ++current;
     }
-    HeapObject current_contents;
+    Tagged<HeapObject> current_contents;
     HeapObjectReferenceType reference_type;
     while (current < end && current.load(cage_base).GetHeapObject(
                                 &current_contents, &reference_type)) {
@@ -954,38 +980,41 @@ void Serializer::ObjectSerializer::VisitPointers(HeapObject host,
         ++current;
       }
       // Now write the object itself.
-      serializer_->SerializeObject(obj);
+      serializer_->SerializeObject(obj, SlotType::kAnySlot);
     }
   }
 }
 
-void Serializer::ObjectSerializer::VisitCodePointer(Code host,
-                                                    CodeObjectSlot slot) {
-  // A version of VisitPointers() customized for CodeObjectSlot.
-  HandleScope scope(isolate());
-  DisallowGarbageCollection no_gc;
+void Serializer::ObjectSerializer::VisitInstructionStreamPointer(
+    Tagged<Code> host, InstructionStreamSlot slot) {
+  DCHECK(!host->has_instruction_stream());
+}
 
-#ifdef V8_EXTERNAL_CODE_SPACE
-  PtrComprCageBase code_cage_base(isolate()->code_cage_base());
-#else
-  PtrComprCageBase code_cage_base(isolate());
-#endif
-  Object contents = slot.load(code_cage_base);
-  if (contents.IsSmi()) {
-    // The contents of the CodeObjectSlot being a Smi means that the host
-    // Code corresponds to Code-less embedded builtin
-    // trampoline, the value will be serialized as a Smi.
-    DCHECK_EQ(contents, Smi::zero());
-    return;
-  }
-  DCHECK(HAS_STRONG_HEAP_OBJECT_TAG(contents.ptr()));
-  DCHECK(contents.IsInstructionStream());
+// All of these visitor functions are unreachable since we don't serialize
+// InstructionStream objects anymore.
+void Serializer::ObjectSerializer::VisitEmbeddedPointer(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
+  UNREACHABLE();
+}
 
-  Handle<HeapObject> obj = handle(HeapObject::cast(contents), isolate());
-  if (!serializer_->SerializePendingObject(*obj)) {
-    serializer_->SerializeObject(obj);
-  }
-  bytes_processed_so_far_ += kTaggedSize;
+void Serializer::ObjectSerializer::VisitExternalReference(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
+  UNREACHABLE();
+}
+
+void Serializer::ObjectSerializer::VisitInternalReference(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
+  UNREACHABLE();
+}
+
+void Serializer::ObjectSerializer::VisitOffHeapTarget(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
+  UNREACHABLE();
+}
+
+void Serializer::ObjectSerializer::VisitCodeTarget(
+    Tagged<InstructionStream> host, RelocInfo* rinfo) {
+  UNREACHABLE();
 }
 
 void Serializer::ObjectSerializer::OutputExternalReference(
@@ -1015,14 +1044,14 @@ void Serializer::ObjectSerializer::OutputExternalReference(
     if (sandboxify) {
       CHECK_EQ(target_size, kSystemPointerSize);
       sink_->Put(kSandboxedRawExternalReference, "SandboxedRawReference");
-      sink_->PutRaw(reinterpret_cast<byte*>(&target), target_size,
+      sink_->PutRaw(reinterpret_cast<uint8_t*>(&target), target_size,
                     "raw pointer");
     } else {
       // Encode as FixedRawData instead of RawExternalReference as the target
       // may be less than kSystemPointerSize large.
       int size_in_tagged = target_size >> kTaggedSizeLog2;
       sink_->Put(FixedRawDataWithSize::Encode(size_in_tagged), "FixedRawData");
-      sink_->PutRaw(reinterpret_cast<byte*>(&target), target_size,
+      sink_->PutRaw(reinterpret_cast<uint8_t*>(&target), target_size,
                     "raw pointer");
     }
   } else if (encoded_reference.is_from_api()) {
@@ -1031,88 +1060,25 @@ void Serializer::ObjectSerializer::OutputExternalReference(
     } else {
       sink_->Put(kApiReference, "ApiRef");
     }
-    sink_->PutInt(encoded_reference.index(), "reference index");
+    sink_->PutUint30(encoded_reference.index(), "reference index");
   } else {
     if (sandboxify) {
       sink_->Put(kSandboxedExternalReference, "SandboxedExternalRef");
     } else {
       sink_->Put(kExternalReference, "ExternalRef");
     }
-    sink_->PutInt(encoded_reference.index(), "reference index");
+    sink_->PutUint30(encoded_reference.index(), "reference index");
   }
   if (sandboxify) {
-    sink_->PutInt(static_cast<uint32_t>(tag >> kExternalPointerTagShift),
-                  "external pointer tag");
+    sink_->PutUint30(static_cast<uint32_t>(tag >> kExternalPointerTagShift),
+                     "external pointer tag");
   }
 }
 
-class Serializer::ObjectSerializer::RelocInfoObjectPreSerializer {
- public:
-  explicit RelocInfoObjectPreSerializer(Serializer* serializer)
-      : serializer_(serializer) {}
-
-  void VisitEmbeddedPointer(RelocInfo* target) {
-    HeapObject object = target->target_object(isolate());
-    serializer_->SerializeObject(handle(object, isolate()));
-    num_serialized_objects_++;
-  }
-  void VisitCodeTarget(RelocInfo* target) {
-#ifdef V8_TARGET_ARCH_ARM
-    DCHECK(!RelocInfo::IsRelativeCodeTarget(target->rmode()));
-#endif
-    InstructionStream object =
-        InstructionStream::FromTargetAddress(target->target_address());
-    serializer_->SerializeObject(handle(object, isolate()));
-    num_serialized_objects_++;
-  }
-
-  void VisitExternalReference(RelocInfo* rinfo) {}
-  void VisitInternalReference(RelocInfo* rinfo) {}
-  void VisitOffHeapTarget(RelocInfo* target) {}
-
-  int num_serialized_objects() const { return num_serialized_objects_; }
-
-  Isolate* isolate() { return serializer_->isolate(); }
-
- private:
-  Serializer* serializer_;
-  int num_serialized_objects_ = 0;
-};
-
-void Serializer::ObjectSerializer::VisitEmbeddedPointer(RelocInfo* rinfo) {
-  // Target object should be pre-serialized by RelocInfoObjectPreSerializer, so
-  // just track the pointer's existence as kTaggedSize in
-  // bytes_processed_so_far_.
-  // TODO(leszeks): DCHECK that RelocInfoObjectPreSerializer serialized this
-  // specific object already.
-  bytes_processed_so_far_ += kTaggedSize;
-}
-
-void Serializer::ObjectSerializer::VisitExternalReference(RelocInfo* rinfo) {
-  Address target = rinfo->target_external_reference();
-  DCHECK_NE(target,
-            kNullAddress);  // InstructionStream does not reference null.
-  DCHECK_IMPLIES(serializer_->EncodeExternalReference(target).is_from_api(),
-                 !rinfo->IsCodedSpecially());
-  // Don't "sandboxify" external references embedded in the code.
-  OutputExternalReference(target, rinfo->target_address_size(), false,
-                          kExternalPointerNullTag);
-}
-
-void Serializer::ObjectSerializer::VisitInternalReference(RelocInfo* rinfo) {
-  Address entry = rinfo->code().InstructionStart();
-  DCHECK_GE(rinfo->target_internal_reference(), entry);
-  uintptr_t target_offset = rinfo->target_internal_reference() - entry;
-  static_assert(InstructionStream::kOnHeapBodyIsContiguous);
-  DCHECK_LT(target_offset, rinfo->code().instruction_size());
-  sink_->Put(kInternalReference, "InternalRef");
-  sink_->PutInt(target_offset, "internal ref value");
-}
-
 void Serializer::ObjectSerializer::VisitExternalPointer(
-    HeapObject host, ExternalPointerSlot slot, ExternalPointerTag tag) {
+    Tagged<HeapObject> host, ExternalPointerSlot slot, ExternalPointerTag tag) {
   PtrComprCageBase cage_base(isolate());
-  InstanceType instance_type = object_->map(cage_base).instance_type();
+  InstanceType instance_type = object_->map(cage_base)->instance_type();
   if (InstanceTypeChecker::IsForeign(instance_type) ||
       InstanceTypeChecker::IsJSExternalObject(instance_type) ||
       InstanceTypeChecker::IsAccessorInfo(instance_type) ||
@@ -1142,36 +1108,31 @@ void Serializer::ObjectSerializer::VisitExternalPointer(
         InstanceTypeChecker::IsNativeContext(instance_type) ||
         // See ContextSerializer::SerializeJSObjectWithEmbedderFields().
         (InstanceTypeChecker::IsJSObject(instance_type) &&
-         JSObject::cast(host).GetEmbedderFieldCount() > 0) ||
-        // See ObjectSerializer::OutputRawData().
-        InstanceTypeChecker::IsCode(instance_type));
+         JSObject::cast(host)->GetEmbedderFieldCount() > 0));
   }
 }
 
-void Serializer::ObjectSerializer::VisitOffHeapTarget(RelocInfo* rinfo) {
-  static_assert(EmbeddedData::kTableSize == Builtins::kBuiltinCount);
-
-  // Currently we don't serialize code that contains near builtin entries.
-  CHECK_NE(rinfo->rmode(), RelocInfo::NEAR_BUILTIN_ENTRY);
-
-  Address addr = rinfo->target_off_heap_target();
-  CHECK_NE(kNullAddress, addr);
-
-  Builtin builtin = OffHeapInstructionStream::TryLookupCode(isolate(), addr);
-  CHECK(Builtins::IsBuiltinId(builtin));
-  CHECK(Builtins::IsIsolateIndependent(builtin));
-
-  sink_->Put(kOffHeapTarget, "OffHeapTarget");
-  sink_->PutInt(static_cast<int>(builtin), "builtin index");
-}
-
-void Serializer::ObjectSerializer::VisitCodeTarget(RelocInfo* rinfo) {
-  // Target object should be pre-serialized by RelocInfoObjectPreSerializer, so
-  // just track the pointer's existence as kTaggedSize in
-  // bytes_processed_so_far_.
-  // TODO(leszeks): DCHECK that RelocInfoObjectPreSerializer serialized this
-  // specific object already.
-  bytes_processed_so_far_ += kTaggedSize;
+void Serializer::ObjectSerializer::VisitIndirectPointer(
+    Tagged<HeapObject> host, IndirectPointerSlot slot,
+    IndirectPointerMode mode) {
+  DCHECK(V8_CODE_POINTER_SANDBOXING_BOOL);
+
+  // The slot must be properly initialized at this point, so will always contain
+  // a reference to a HeapObject.
+  Handle<HeapObject> slot_value(HeapObject::cast(slot.load()), isolate());
+  CHECK(IsHeapObject(*slot_value));
+  bytes_processed_so_far_ += kIndirectPointerSlotSize;
+
+  // Currently, we only reference Code objects through indirect pointers, and
+  // we only serialize builtin Code objects which end up in the RO snapshot, so
+  // we cannot see pending objects here. However, we'll need to handle pending
+  // objects here and in the deserializer once we reference other types of
+  // objects through indirect pointers.
+  static_assert(kAllIndirectPointerObjectsAreCode);
+  DCHECK(IsJSFunction(host) && IsCode(*slot_value));
+  DCHECK(!serializer_->SerializePendingObject(*slot_value));
+  sink_->Put(kIndirectPointerPrefix, "IndirectPointer");
+  serializer_->SerializeObject(slot_value, SlotType::kAnySlot);
 }
 
 namespace {
@@ -1181,19 +1142,19 @@ namespace {
 void OutputRawWithCustomField(SnapshotByteSink* sink, Address object_start,
                               int written_so_far, int bytes_to_write,
                               int field_offset, int field_size,
-                              const byte* field_value) {
+                              const uint8_t* field_value) {
   int offset = field_offset - written_so_far;
   if (0 <= offset && offset < bytes_to_write) {
     DCHECK_GE(bytes_to_write, offset + field_size);
-    sink->PutRaw(reinterpret_cast<byte*>(object_start + written_so_far), offset,
-                 "Bytes");
+    sink->PutRaw(reinterpret_cast<uint8_t*>(object_start + written_so_far),
+                 offset, "Bytes");
     sink->PutRaw(field_value, field_size, "Bytes");
     written_so_far += offset + field_size;
     bytes_to_write -= offset + field_size;
-    sink->PutRaw(reinterpret_cast<byte*>(object_start + written_so_far),
+    sink->PutRaw(reinterpret_cast<uint8_t*>(object_start + written_so_far),
                  bytes_to_write, "Bytes");
   } else {
-    sink->PutRaw(reinterpret_cast<byte*>(object_start + written_so_far),
+    sink->PutRaw(reinterpret_cast<uint8_t*>(object_start + written_so_far),
                  bytes_to_write, "Bytes");
   }
 }
@@ -1216,7 +1177,7 @@ void Serializer::ObjectSerializer::OutputRawData(Address up_to) {
                  "FixedRawData");
     } else {
       sink_->Put(kVariableRawData, "VariableRawData");
-      sink_->PutInt(tagged_to_output, "length");
+      sink_->PutUint30(tagged_to_output, "length");
     }
 #ifdef MEMORY_SANITIZER
     // Check that we do not serialize uninitialized memory.
@@ -1224,15 +1185,15 @@ void Serializer::ObjectSerializer::OutputRawData(Address up_to) {
         reinterpret_cast<void*>(object_start + base), bytes_to_output);
 #endif  // MEMORY_SANITIZER
     PtrComprCageBase cage_base(isolate_);
-    if (object_->IsBytecodeArray(cage_base)) {
+    if (IsSharedFunctionInfo(*object_, cage_base)) {
       // The bytecode age field can be changed by GC concurrently.
-      static_assert(BytecodeArray::kBytecodeAgeSize == kUInt16Size);
+      static_assert(SharedFunctionInfo::kAgeSize == kUInt16Size);
       uint16_t field_value = 0;
       OutputRawWithCustomField(sink_, object_start, base, bytes_to_output,
-                               BytecodeArray::kBytecodeAgeOffset,
+                               SharedFunctionInfo::kAgeOffset,
                                sizeof(field_value),
-                               reinterpret_cast<byte*>(&field_value));
-    } else if (object_->IsDescriptorArray(cage_base)) {
+                               reinterpret_cast<uint8_t*>(&field_value));
+    } else if (IsDescriptorArray(*object_, cage_base)) {
       // The number of marked descriptors field can be changed by GC
       // concurrently.
       const auto field_value = DescriptorArrayMarkingState::kInitialGCState;
@@ -1240,139 +1201,42 @@ void Serializer::ObjectSerializer::OutputRawData(Address up_to) {
       OutputRawWithCustomField(sink_, object_start, base, bytes_to_output,
                                DescriptorArray::kRawGcStateOffset,
                                sizeof(field_value),
-                               reinterpret_cast<const byte*>(&field_value));
-    } else if (object_->IsCode(cage_base)) {
-      // code_entry_point field contains a raw value that will be recomputed
+                               reinterpret_cast<const uint8_t*>(&field_value));
+    } else if (IsCode(*object_, cage_base)) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+      // When the sandbox is enabled, this field instead contains the handle to
+      // this Code object's code pointer table entry. This will similarly be
+      // recomputed after deserialization.
+      static uint8_t field_value[kIndirectPointerSlotSize] = {0};
+      OutputRawWithCustomField(sink_, object_start, base, bytes_to_output,
+                               Code::kCodePointerTableEntryOffset,
+                               sizeof(field_value), field_value);
+#else
+      // instruction_start field contains a raw value that will be recomputed
       // after deserialization, so write zeros to keep the snapshot
       // deterministic.
-      static byte field_value[kSystemPointerSize] = {0};
+      static uint8_t field_value[kSystemPointerSize] = {0};
       OutputRawWithCustomField(sink_, object_start, base, bytes_to_output,
-                               Code::kCodeEntryPointOffset, sizeof(field_value),
-                               field_value);
-    } else if (object_->IsSeqString()) {
+                               Code::kInstructionStartOffset,
+                               sizeof(field_value), field_value);
+#endif  // V8_CODE_POINTER_SANDBOXING
+    } else if (IsSeqString(*object_)) {
       // SeqStrings may contain padding. Serialize the padding bytes as 0s to
       // make the snapshot content deterministic.
       SeqString::DataAndPaddingSizes sizes =
-          SeqString::cast(*object_).GetDataAndPaddingSizes();
+          SeqString::cast(*object_)->GetDataAndPaddingSizes();
       DCHECK_EQ(bytes_to_output, sizes.data_size - base + sizes.padding_size);
       int data_bytes_to_output = sizes.data_size - base;
-      sink_->PutRaw(reinterpret_cast<byte*>(object_start + base),
+      sink_->PutRaw(reinterpret_cast<uint8_t*>(object_start + base),
                     data_bytes_to_output, "SeqStringData");
       sink_->PutN(sizes.padding_size, 0, "SeqStringPadding");
     } else {
-      sink_->PutRaw(reinterpret_cast<byte*>(object_start + base),
+      sink_->PutRaw(reinterpret_cast<uint8_t*>(object_start + base),
                     bytes_to_output, "Bytes");
     }
   }
 }
 
-void Serializer::ObjectSerializer::SerializeInstructionStream(Map map,
-                                                              int size) {
-  static const int kWipeOutModeMask =
-      RelocInfo::ModeMask(RelocInfo::CODE_TARGET) |
-      RelocInfo::ModeMask(RelocInfo::FULL_EMBEDDED_OBJECT) |
-      RelocInfo::ModeMask(RelocInfo::COMPRESSED_EMBEDDED_OBJECT) |
-      RelocInfo::ModeMask(RelocInfo::EXTERNAL_REFERENCE) |
-      RelocInfo::ModeMask(RelocInfo::INTERNAL_REFERENCE) |
-      RelocInfo::ModeMask(RelocInfo::INTERNAL_REFERENCE_ENCODED) |
-      RelocInfo::ModeMask(RelocInfo::OFF_HEAP_TARGET);
-
-  DCHECK_EQ(HeapObject::kHeaderSize, bytes_processed_so_far_);
-  Handle<InstructionStream> on_heap_istream =
-      Handle<InstructionStream>::cast(object_);
-  Handle<Code> code = handle(on_heap_istream->code(kAcquireLoad), isolate_);
-
-  // With enabled pointer compression normal accessors no longer work for
-  // off-heap objects, so we have to get the relocation info data via the
-  // on-heap InstructionStream object.
-  // TODO(v8:13784): we can clean this up since we moved all data fields from
-  // InstructionStream to Code
-  ByteArray relocation_info = code->unchecked_relocation_info();
-
-  // To make snapshots reproducible, we make a copy of the InstructionStream
-  // object and wipe all pointers in the copy, which we then serialize.
-  InstructionStream off_heap_istream = serializer_->CopyCode(*on_heap_istream);
-  for (RelocIterator it(*code, off_heap_istream, relocation_info,
-                        code->constant_pool(), kWipeOutModeMask);
-       !it.done(); it.next()) {
-    RelocInfo* rinfo = it.rinfo();
-    rinfo->WipeOut();
-  }
-  // We need to wipe out the header fields *after* wiping out the
-  // relocations, because some of these fields are needed for the latter.
-  off_heap_istream.WipeOutHeader();
-
-  // Initially skip serializing the code header. We'll serialize it after the
-  // InstructionStream body, so that the various fields the InstructionStream
-  // needs for iteration are already valid.
-  // TODO(v8:13784): rename to kInstructionStreamBody
-  sink_->Put(kCodeBody, "kCodeBody");
-
-  // Now serialize the wiped off-heap InstructionStream, as length + data.
-  Address start = off_heap_istream.address() + InstructionStream::kDataStart;
-  int bytes_to_output = size - InstructionStream::kDataStart;
-  DCHECK(IsAligned(bytes_to_output, kTaggedSize));
-  int tagged_to_output = bytes_to_output / kTaggedSize;
-
-  sink_->PutInt(tagged_to_output, "length");
-
-#ifdef MEMORY_SANITIZER
-  // Check that we do not serialize uninitialized memory.
-  __msan_check_mem_is_initialized(reinterpret_cast<void*>(start),
-                                  bytes_to_output);
-#endif  // MEMORY_SANITIZER
-  sink_->PutRaw(reinterpret_cast<byte*>(start), bytes_to_output,
-                "InstructionStream");
-
-  // Manually serialize the code header. We don't use
-  // InstructionStream::BodyDescriptor here as we don't yet want to walk the
-  // RelocInfos.
-  DCHECK_EQ(HeapObject::kHeaderSize, bytes_processed_so_far_);
-  VisitPointers(*on_heap_istream,
-                on_heap_istream->RawField(HeapObject::kHeaderSize),
-                on_heap_istream->RawField(InstructionStream::kDataStart));
-  DCHECK_EQ(bytes_processed_so_far_, InstructionStream::kDataStart);
-
-  // Now serialize RelocInfos. We can't allocate during a RelocInfo walk during
-  // deserialization, so we have two passes for RelocInfo serialization:
-  //   1. A pre-serializer which serializes all allocatable objects in the
-  //      RelocInfo, followed by a kSynchronize bytecode, and
-  //   2. A walk the RelocInfo with this serializer, serializing any objects
-  //      implicitly as offsets into the pre-serializer's object array.
-  // This way, the deserializer can deserialize the allocatable objects first,
-  // without walking RelocInfo, re-build the pre-serializer's object array, and
-  // only then walk the RelocInfo itself.
-  // TODO(leszeks): We only really need to pre-serialize objects which need
-  // serialization, i.e. no backrefs or roots.
-  RelocInfoObjectPreSerializer pre_serializer(serializer_);
-  for (RelocIterator it(*code, *on_heap_istream, relocation_info,
-                        code->constant_pool(),
-                        InstructionStream::BodyDescriptor::kRelocModeMask);
-       !it.done(); it.next()) {
-    it.rinfo()->Visit(&pre_serializer);
-  }
-  // Mark that the pre-serialization finished with a kSynchronize bytecode.
-  sink_->Put(kSynchronize, "PreSerializationFinished");
-
-  // Finally serialize all RelocInfo objects in the on-heap InstructionStream,
-  // knowing that we will not do a recursive serialization.
-  // TODO(leszeks): Add a scope that DCHECKs this.
-  for (RelocIterator it(*code, *on_heap_istream, relocation_info,
-                        code->constant_pool(),
-                        InstructionStream::BodyDescriptor::kRelocModeMask);
-       !it.done(); it.next()) {
-    it.rinfo()->Visit(this);
-  }
-
-  // We record a kTaggedSize for every object encountered during the
-  // serialization, so DCHECK that bytes_processed_so_far_ matches the expected
-  // number of bytes (i.e. the code header + a tagged size per pre-serialized
-  // object).
-  DCHECK_EQ(bytes_processed_so_far_,
-            InstructionStream::kDataStart +
-                kTaggedSize * pre_serializer.num_serialized_objects());
-}
-
 Serializer::HotObjectsList::HotObjectsList(Heap* heap) : heap_(heap) {
   strong_roots_entry_ = heap->RegisterStrongRoots(
       "Serializer::HotObjectsList", FullObjectSlot(&circular_queue_[0]),
@@ -1392,13 +1256,13 @@ Handle<FixedArray> ObjectCacheIndexMap::Values(Isolate* isolate) {
   IdentityMap<int, base::DefaultAllocationPolicy>::IteratableScope it_scope(
       &map_);
   for (auto it = it_scope.begin(); it != it_scope.end(); ++it) {
-    raw.set(*it.entry(), it.key());
+    raw->set(*it.entry(), it.key());
   }
 
   return externals;
 }
 
-bool Serializer::SerializeReadOnlyObjectReference(HeapObject obj,
+bool Serializer::SerializeReadOnlyObjectReference(Tagged<HeapObject> obj,
                                                   SnapshotByteSink* sink) {
   if (!ReadOnlyHeap::Contains(obj)) return false;
 
@@ -1416,8 +1280,8 @@ bool Serializer::SerializeReadOnlyObjectReference(HeapObject obj,
   }
   uint32_t chunk_offset = static_cast<uint32_t>(chunk->Offset(address));
   sink->Put(kReadOnlyHeapRef, "ReadOnlyHeapRef");
-  sink->PutInt(chunk_index, "ReadOnlyHeapRefChunkIndex");
-  sink->PutInt(chunk_offset, "ReadOnlyHeapRefChunkOffset");
+  sink->PutUint30(chunk_index, "ReadOnlyHeapRefChunkIndex");
+  sink->PutUint30(chunk_offset, "ReadOnlyHeapRefChunkOffset");
   return true;
 }
 
diff --git a/deps/v8/src/snapshot/serializer.h b/deps/v8/src/snapshot/serializer.h
index 86a8cec8bd521b..cbc9fc35bba1d8 100644
--- a/deps/v8/src/snapshot/serializer.h
+++ b/deps/v8/src/snapshot/serializer.h
@@ -10,6 +10,9 @@
 #include "src/execution/isolate.h"
 #include "src/handles/global-handles.h"
 #include "src/logging/log.h"
+#include "src/objects/abstract-code.h"
+#include "src/objects/bytecode-array.h"
+#include "src/objects/instruction-stream.h"
 #include "src/objects/objects.h"
 #include "src/snapshot/serializer-deserializer.h"
 #include "src/snapshot/snapshot-source-sink.h"
@@ -29,10 +32,12 @@ class CodeAddressMap : public CodeEventLogger {
     isolate_->v8_file_logger()->RemoveLogEventListener(this);
   }
 
-  void CodeMoveEvent(InstructionStream from, InstructionStream to) override {
+  void CodeMoveEvent(Tagged<InstructionStream> from,
+                     Tagged<InstructionStream> to) override {
     address_to_name_map_.Move(from.address(), to.address());
   }
-  void BytecodeMoveEvent(BytecodeArray from, BytecodeArray to) override {
+  void BytecodeMoveEvent(Tagged<BytecodeArray> from,
+                         Tagged<BytecodeArray> to) override {
     address_to_name_map_.Move(from.address(), to.address());
   }
 
@@ -118,8 +123,9 @@ class CodeAddressMap : public CodeEventLogger {
     base::HashMap impl_;
   };
 
-  void LogRecordedBuffer(AbstractCode code, MaybeHandle<SharedFunctionInfo>,
-                         const char* name, int length) override {
+  void LogRecordedBuffer(Tagged<AbstractCode> code,
+                         MaybeHandle<SharedFunctionInfo>, const char* name,
+                         int length) override {
     DisallowGarbageCollection no_gc;
     address_to_name_map_.Insert(code.address(), name, length);
   }
@@ -143,7 +149,7 @@ class ObjectCacheIndexMap {
   // If |obj| is in the map, immediately return true.  Otherwise add it to the
   // map and return false. In either case set |*index_out| to the index
   // associated with the map.
-  bool LookupOrInsert(HeapObject obj, int* index_out) {
+  bool LookupOrInsert(Tagged<HeapObject> obj, int* index_out) {
     auto find_result = map_.FindOrInsert(obj);
     if (!find_result.already_exists) {
       *find_result.entry = next_index_++;
@@ -155,7 +161,7 @@ class ObjectCacheIndexMap {
     return LookupOrInsert(*obj, index_out);
   }
 
-  bool Lookup(HeapObject obj, int* index_out) const {
+  bool Lookup(Tagged<HeapObject> obj, int* index_out) const {
     int* index = map_.Find(obj);
     if (index == nullptr) {
       return false;
@@ -180,7 +186,7 @@ class Serializer : public SerializerDeserializer {
   Serializer(const Serializer&) = delete;
   Serializer& operator=(const Serializer&) = delete;
 
-  const std::vector<byte>* Payload() const { return sink_.data(); }
+  const std::vector<uint8_t>* Payload() const { return sink_.data(); }
 
   bool ReferenceMapContains(Handle<HeapObject> o) {
     return reference_map()->LookupReference(o) != nullptr;
@@ -210,8 +216,11 @@ class Serializer : public SerializerDeserializer {
       serializer_->recursion_depth_++;
     }
     ~RecursionScope() { serializer_->recursion_depth_--; }
-    bool ExceedsMaximum() {
-      return serializer_->recursion_depth_ >= kMaxRecursionDepth;
+    bool ExceedsMaximum() const {
+      return serializer_->recursion_depth_ > kMaxRecursionDepth;
+    }
+    int ExceedsMaximumBy() const {
+      return serializer_->recursion_depth_ - kMaxRecursionDepth;
     }
 
    private:
@@ -221,13 +230,14 @@ class Serializer : public SerializerDeserializer {
 
   // Compares obj with not_mapped_symbol root. When V8_EXTERNAL_CODE_SPACE is
   // enabled it compares full pointers.
-  V8_INLINE bool IsNotMappedSymbol(HeapObject obj) const;
+  V8_INLINE bool IsNotMappedSymbol(Tagged<HeapObject> obj) const;
 
   void SerializeDeferredObjects();
-  void SerializeObject(Handle<HeapObject> o);
-  virtual void SerializeObjectImpl(Handle<HeapObject> o) = 0;
+  void SerializeObject(Handle<HeapObject> o, SlotType slot_type);
+  virtual void SerializeObjectImpl(Handle<HeapObject> o,
+                                   SlotType slot_type) = 0;
 
-  virtual bool MustBeDeferred(HeapObject object);
+  virtual bool MustBeDeferred(Tagged<HeapObject> object);
 
   void VisitRootPointers(Root root, const char* description,
                          FullObjectSlot start, FullObjectSlot end) override;
@@ -235,7 +245,8 @@ class Serializer : public SerializerDeserializer {
 
   void PutRoot(RootIndex root_index);
   void PutSmiRoot(FullObjectSlot slot);
-  void PutBackReference(HeapObject object, SerializerReference reference);
+  void PutBackReference(Tagged<HeapObject> object,
+                        SerializerReference reference);
   void PutAttachedReference(SerializerReference reference);
   void PutNextChunk(SnapshotSpace space);
   void PutRepeat(int repeat_count);
@@ -248,19 +259,19 @@ class Serializer : public SerializerDeserializer {
   void ResolvePendingForwardReference(int obj);
 
   // Returns true if the object was successfully serialized as a root.
-  bool SerializeRoot(HeapObject obj);
+  bool SerializeRoot(Tagged<HeapObject> obj);
 
   // Returns true if the object was successfully serialized as hot object.
-  bool SerializeHotObject(HeapObject obj);
+  bool SerializeHotObject(Tagged<HeapObject> obj);
 
   // Returns true if the object was successfully serialized as back reference.
-  bool SerializeBackReference(HeapObject obj);
+  bool SerializeBackReference(Tagged<HeapObject> obj);
 
   // Returns true if the object was successfully serialized as pending object.
-  bool SerializePendingObject(HeapObject obj);
+  bool SerializePendingObject(Tagged<HeapObject> obj);
 
   // Returns true if the given heap object is a bytecode handler code object.
-  bool ObjectIsBytecodeHandler(HeapObject obj) const;
+  bool ObjectIsBytecodeHandler(Tagged<HeapObject> obj) const;
 
   ExternalReferenceEncoder::Value EncodeExternalReference(Address addr);
 
@@ -269,7 +280,8 @@ class Serializer : public SerializerDeserializer {
     return external_reference_encoder_.TryEncode(addr);
   }
 
-  bool SerializeReadOnlyObjectReference(HeapObject obj, SnapshotByteSink* sink);
+  bool SerializeReadOnlyObjectReference(Tagged<HeapObject> obj,
+                                        SnapshotByteSink* sink);
 
   // GetInt reads 4 bytes at once, requiring padding at the end.
   // Use padding_offset to specify the space you want to use after padding.
@@ -279,9 +291,9 @@ class Serializer : public SerializerDeserializer {
   // of the serializer.  Initialize it on demand.
   void InitializeCodeAddressMap();
 
-  InstructionStream CopyCode(InstructionStream code);
+  Tagged<InstructionStream> CopyCode(Tagged<InstructionStream> istream);
 
-  void QueueDeferredObject(HeapObject obj) {
+  void QueueDeferredObject(Tagged<HeapObject> obj) {
     DCHECK_NULL(reference_map_.LookupReference(obj));
     deferred_objects_.Push(obj);
   }
@@ -289,14 +301,14 @@ class Serializer : public SerializerDeserializer {
   // Register that the the given object shouldn't be immediately serialized, but
   // will be serialized later and any references to it should be pending forward
   // references.
-  void RegisterObjectIsPending(HeapObject obj);
+  void RegisterObjectIsPending(Tagged<HeapObject> obj);
 
   // Resolve the given pending object reference with the current object.
-  void ResolvePendingObject(HeapObject obj);
+  void ResolvePendingObject(Tagged<HeapObject> obj);
 
   void OutputStatistics(const char* name);
 
-  void CountAllocation(Map map, int size, SnapshotSpace space);
+  void CountAllocation(Tagged<Map> map, int size, SnapshotSpace space);
 
 #ifdef DEBUG
   void PushStack(Handle<HeapObject> o) { stack_.Push(*o); }
@@ -348,14 +360,14 @@ class Serializer : public SerializerDeserializer {
     HotObjectsList(const HotObjectsList&) = delete;
     HotObjectsList& operator=(const HotObjectsList&) = delete;
 
-    void Add(HeapObject object) {
+    void Add(Tagged<HeapObject> object) {
       circular_queue_[index_] = object.ptr();
       index_ = (index_ + 1) & kSizeMask;
     }
 
     static const int kNotFound = -1;
 
-    int Find(HeapObject object) {
+    int Find(Tagged<HeapObject> object) {
       DCHECK(!AllowGarbageCollection::IsAllowed());
       for (int i = 0; i < kSize; i++) {
         if (circular_queue_[i] == object.ptr()) {
@@ -388,7 +400,7 @@ class Serializer : public SerializerDeserializer {
   ExternalReferenceEncoder external_reference_encoder_;
   RootIndexMap root_index_map_;
   std::unique_ptr<CodeAddressMap> code_address_map_;
-  std::vector<byte> code_buffer_;
+  std::vector<uint8_t> code_buffer_;
   GlobalHandleVector<HeapObject>
       deferred_objects_;  // To handle stack overflow.
   int num_back_refs_ = 0;
@@ -455,39 +467,44 @@ class Serializer::ObjectSerializer : public ObjectVisitor {
     serializer_->PopStack();
 #endif  // DEBUG
   }
-  void Serialize();
+  void Serialize(SlotType slot_type);
   void SerializeObject();
   void SerializeDeferred();
-  void VisitPointers(HeapObject host, ObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, ObjectSlot start,
                      ObjectSlot end) override;
-  void VisitPointers(HeapObject host, MaybeObjectSlot start,
+  void VisitPointers(Tagged<HeapObject> host, MaybeObjectSlot start,
                      MaybeObjectSlot end) override;
-  void VisitCodePointer(Code host, CodeObjectSlot slot) override;
-  void VisitEmbeddedPointer(RelocInfo* target) override;
-  void VisitExternalReference(RelocInfo* rinfo) override;
-  void VisitInternalReference(RelocInfo* rinfo) override;
-  void VisitCodeTarget(RelocInfo* target) override;
-  void VisitOffHeapTarget(RelocInfo* target) override;
-
-  void VisitExternalPointer(HeapObject host, ExternalPointerSlot slot,
+  void VisitInstructionStreamPointer(Tagged<Code> host,
+                                     InstructionStreamSlot slot) override;
+  void VisitEmbeddedPointer(Tagged<InstructionStream> host,
+                            RelocInfo* target) override;
+  void VisitExternalReference(Tagged<InstructionStream> host,
+                              RelocInfo* rinfo) override;
+  void VisitInternalReference(Tagged<InstructionStream> host,
+                              RelocInfo* rinfo) override;
+  void VisitCodeTarget(Tagged<InstructionStream> host,
+                       RelocInfo* target) override;
+  void VisitOffHeapTarget(Tagged<InstructionStream> host,
+                          RelocInfo* target) override;
+
+  void VisitExternalPointer(Tagged<HeapObject> host, ExternalPointerSlot slot,
                             ExternalPointerTag tag) override;
+  void VisitIndirectPointer(Tagged<HeapObject> host, IndirectPointerSlot slot,
+                            IndirectPointerMode mode) override;
 
   Isolate* isolate() { return isolate_; }
 
  private:
-  class RelocInfoObjectPreSerializer;
-
-  void SerializePrologue(SnapshotSpace space, int size, Map map);
+  void SerializePrologue(SnapshotSpace space, int size, Tagged<Map> map);
 
   // This function outputs or skips the raw data between the last pointer and
   // up to the current position.
-  void SerializeContent(Map map, int size);
+  void SerializeContent(Tagged<Map> map, int size);
   void OutputExternalReference(Address target, int target_size, bool sandboxify,
                                ExternalPointerTag tag);
   void OutputRawData(Address up_to);
-  void SerializeInstructionStream(Map map, int size);
-  uint32_t SerializeBackingStore(void* backing_store, int32_t byte_length,
-                                 Maybe<int32_t> max_byte_length);
+  uint32_t SerializeBackingStore(void* backing_store, uint32_t byte_length,
+                                 Maybe<uint32_t> max_byte_length);
   void SerializeJSTypedArray();
   void SerializeJSArrayBuffer();
   void SerializeExternalString();
diff --git a/deps/v8/src/snapshot/shared-heap-deserializer.cc b/deps/v8/src/snapshot/shared-heap-deserializer.cc
index f6cd57c9041476..34c752b0244a0a 100644
--- a/deps/v8/src/snapshot/shared-heap-deserializer.cc
+++ b/deps/v8/src/snapshot/shared-heap-deserializer.cc
@@ -35,7 +35,7 @@ void SharedHeapDeserializer::DeserializeStringTable() {
   DCHECK(isolate()->OwnsStringTables());
 
   // Get the string table size.
-  int string_table_size = source()->GetInt();
+  int string_table_size = source()->GetUint30();
 
   // Add each string to the Isolate's string table.
   // TODO(leszeks): Consider pre-sizing the string table.
diff --git a/deps/v8/src/snapshot/shared-heap-serializer.cc b/deps/v8/src/snapshot/shared-heap-serializer.cc
index 6bd29774d7374b..853c3a88d52e62 100644
--- a/deps/v8/src/snapshot/shared-heap-serializer.cc
+++ b/deps/v8/src/snapshot/shared-heap-serializer.cc
@@ -12,32 +12,31 @@ namespace v8 {
 namespace internal {
 
 // static
-bool SharedHeapSerializer::CanBeInSharedOldSpace(HeapObject obj) {
+bool SharedHeapSerializer::CanBeInSharedOldSpace(Tagged<HeapObject> obj) {
   if (ReadOnlyHeap::Contains(obj)) return false;
-  if (obj.IsString()) {
-    return obj.IsInternalizedString() ||
+  if (IsString(obj)) {
+    return IsInternalizedString(obj) ||
            String::IsInPlaceInternalizable(String::cast(obj));
   }
   return false;
 }
 
 // static
-bool SharedHeapSerializer::ShouldBeInSharedHeapObjectCache(HeapObject obj) {
+bool SharedHeapSerializer::ShouldBeInSharedHeapObjectCache(
+    Tagged<HeapObject> obj) {
   // To keep the shared heap object cache lean, only include objects that should
   // not be duplicated. Currently, that is only internalized strings. In-place
   // internalizable strings will still be allocated in the shared heap by the
   // deserializer, but do not need to be kept alive forever in the cache.
   if (CanBeInSharedOldSpace(obj)) {
-    if (obj.IsInternalizedString()) return true;
+    if (IsInternalizedString(obj)) return true;
   }
   return false;
 }
 
-SharedHeapSerializer::SharedHeapSerializer(
-    Isolate* isolate, Snapshot::SerializerFlags flags,
-    ReadOnlySerializer* read_only_serializer)
-    : RootsSerializer(isolate, flags, RootIndex::kFirstStrongRoot),
-      read_only_serializer_(read_only_serializer)
+SharedHeapSerializer::SharedHeapSerializer(Isolate* isolate,
+                                           Snapshot::SerializerFlags flags)
+    : RootsSerializer(isolate, flags, RootIndex::kFirstStrongRoot)
 #ifdef DEBUG
       ,
       serialized_objects_(isolate->heap())
@@ -56,7 +55,7 @@ void SharedHeapSerializer::FinalizeSerialization() {
   // This is called after serialization of the startup and context snapshots
   // which entries are added to the shared heap object cache. Terminate the
   // cache with an undefined.
-  Object undefined = ReadOnlyRoots(isolate()).undefined_value();
+  Tagged<Object> undefined = ReadOnlyRoots(isolate()).undefined_value();
   VisitRootPointer(Root::kSharedHeapObjectCache, nullptr,
                    FullObjectSlot(&undefined));
 
@@ -72,18 +71,13 @@ void SharedHeapSerializer::FinalizeSerialization() {
   IdentityMap<int, base::DefaultAllocationPolicy>::IteratableScope it_scope(
       &serialized_objects_);
   for (auto it = it_scope.begin(); it != it_scope.end(); ++it) {
-    HeapObject obj = HeapObject::cast(it.key());
+    Tagged<HeapObject> obj = HeapObject::cast(it.key());
     CHECK(CanBeInSharedOldSpace(obj));
     CHECK(!ReadOnlyHeap::Contains(obj));
   }
 #endif
 }
 
-bool SharedHeapSerializer::SerializeUsingReadOnlyObjectCache(
-    SnapshotByteSink* sink, Handle<HeapObject> obj) {
-  return read_only_serializer_->SerializeUsingReadOnlyObjectCache(sink, obj);
-}
-
 bool SharedHeapSerializer::SerializeUsingSharedHeapObjectCache(
     SnapshotByteSink* sink, Handle<HeapObject> obj) {
   if (!ShouldBeInSharedHeapObjectCache(*obj)) return false;
@@ -102,14 +96,14 @@ bool SharedHeapSerializer::SerializeUsingSharedHeapObjectCache(
     DCHECK_LT(base::checked_cast<size_t>(cache_index), existing_cache_size);
     if (base::checked_cast<size_t>(cache_index) == existing_cache_size - 1) {
       ReadOnlyRoots roots(isolate());
-      DCHECK(existing_cache->back().IsUndefined(roots));
+      DCHECK(IsUndefined(existing_cache->back(), roots));
       existing_cache->back() = *obj;
       existing_cache->push_back(roots.undefined_value());
     }
   }
 
   sink->Put(kSharedHeapObjectCache, "SharedHeapObjectCache");
-  sink->PutInt(cache_index, "shared_heap_object_cache_index");
+  sink->PutUint30(cache_index, "shared_heap_object_cache_index");
   return true;
 }
 
@@ -125,8 +119,8 @@ void SharedHeapSerializer::SerializeStringTable(StringTable* string_table) {
   // Notably, the hashmap structure, including empty and deleted elements, is
   // not serialized.
 
-  sink_.PutInt(string_table->NumberOfElements(),
-               "String table number of elements");
+  sink_.PutUint30(string_table->NumberOfElements(),
+                  "String table number of elements");
 
   // Custom RootVisitor which walks the string table, but only serializes the
   // string entries. This is an inline class to be able to access the non-public
@@ -148,10 +142,11 @@ void SharedHeapSerializer::SerializeStringTable(StringTable* string_table) {
       DCHECK_EQ(root, Root::kStringTable);
       Isolate* isolate = serializer_->isolate();
       for (OffHeapObjectSlot current = start; current < end; ++current) {
-        Object obj = current.load(isolate);
-        if (obj.IsHeapObject()) {
-          DCHECK(obj.IsInternalizedString());
-          serializer_->SerializeObject(handle(HeapObject::cast(obj), isolate));
+        Tagged<Object> obj = current.load(isolate);
+        if (IsHeapObject(obj)) {
+          DCHECK(IsInternalizedString(obj));
+          serializer_->SerializeObject(handle(HeapObject::cast(obj), isolate),
+                                       SlotType::kAnySlot);
         }
       }
     }
@@ -164,20 +159,21 @@ void SharedHeapSerializer::SerializeStringTable(StringTable* string_table) {
   isolate()->string_table()->IterateElements(&string_table_visitor);
 }
 
-void SharedHeapSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
+void SharedHeapSerializer::SerializeObjectImpl(Handle<HeapObject> obj,
+                                               SlotType slot_type) {
   // Objects in the shared heap cannot depend on per-Isolate roots but can
   // depend on RO roots since sharing objects requires sharing the RO space.
   DCHECK(CanBeInSharedOldSpace(*obj) || ReadOnlyHeap::Contains(*obj));
   {
     DisallowGarbageCollection no_gc;
-    HeapObject raw = *obj;
+    Tagged<HeapObject> raw = *obj;
     if (SerializeHotObject(raw)) return;
     if (IsRootAndHasBeenSerialized(raw) && SerializeRoot(raw)) return;
   }
-  if (SerializeUsingReadOnlyObjectCache(&sink_, obj)) return;
+  if (SerializeReadOnlyObjectReference(*obj, &sink_)) return;
   {
     DisallowGarbageCollection no_gc;
-    HeapObject raw = *obj;
+    Tagged<HeapObject> raw = *obj;
     if (SerializeBackReference(raw)) return;
     CheckRehashability(raw);
 
@@ -185,7 +181,7 @@ void SharedHeapSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
   }
 
   ObjectSerializer object_serializer(this, obj, &sink_);
-  object_serializer.Serialize();
+  object_serializer.Serialize(slot_type);
 
 #ifdef DEBUG
   CHECK_NULL(serialized_objects_.Find(obj));
@@ -217,7 +213,7 @@ void SharedHeapSerializer::ReconstructSharedHeapObjectCacheForTesting() {
     USE(cache_index);
     DCHECK_EQ(cache_index, i);
   }
-  DCHECK(cache->back().IsUndefined(isolate()));
+  DCHECK(IsUndefined(cache->back(), isolate()));
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/shared-heap-serializer.h b/deps/v8/src/snapshot/shared-heap-serializer.h
index a9553a40603292..57ff05228250ae 100644
--- a/deps/v8/src/snapshot/shared-heap-serializer.h
+++ b/deps/v8/src/snapshot/shared-heap-serializer.h
@@ -11,7 +11,6 @@ namespace v8 {
 namespace internal {
 
 class HeapObject;
-class ReadOnlySerializer;
 
 // SharedHeapSerializer serializes objects that should be in the shared heap in
 // the shared Isolate during startup. Currently the shared heap is only in use
@@ -19,8 +18,7 @@ class ReadOnlySerializer;
 // contents are deserialized into each Isolate.
 class V8_EXPORT_PRIVATE SharedHeapSerializer : public RootsSerializer {
  public:
-  SharedHeapSerializer(Isolate* isolate, Snapshot::SerializerFlags flags,
-                       ReadOnlySerializer* read_only_serializer);
+  SharedHeapSerializer(Isolate* isolate, Snapshot::SerializerFlags flags);
   ~SharedHeapSerializer() override;
   SharedHeapSerializer(const SharedHeapSerializer&) = delete;
   SharedHeapSerializer& operator=(const SharedHeapSerializer&) = delete;
@@ -29,13 +27,6 @@ class V8_EXPORT_PRIVATE SharedHeapSerializer : public RootsSerializer {
   // serialize the string table..
   void FinalizeSerialization();
 
-  // If |obj| can be serialized in the read-only snapshot then add it to the
-  // read-only object cache if not already present and emit a
-  // ReadOnlyObjectCache bytecode into |sink|. Returns whether this was
-  // successful.
-  bool SerializeUsingReadOnlyObjectCache(SnapshotByteSink* sink,
-                                         Handle<HeapObject> obj);
-
   // If |obj| can be serialized in the shared heap snapshot then add it to the
   // shared heap object cache if not already present and emit a
   // SharedHeapObjectCache bytecode into |sink|. Returns whether this was
@@ -43,9 +34,9 @@ class V8_EXPORT_PRIVATE SharedHeapSerializer : public RootsSerializer {
   bool SerializeUsingSharedHeapObjectCache(SnapshotByteSink* sink,
                                            Handle<HeapObject> obj);
 
-  static bool CanBeInSharedOldSpace(HeapObject obj);
+  static bool CanBeInSharedOldSpace(Tagged<HeapObject> obj);
 
-  static bool ShouldBeInSharedHeapObjectCache(HeapObject obj);
+  static bool ShouldBeInSharedHeapObjectCache(Tagged<HeapObject> obj);
 
  private:
   bool ShouldReconstructSharedHeapObjectCacheForTesting() const;
@@ -54,9 +45,7 @@ class V8_EXPORT_PRIVATE SharedHeapSerializer : public RootsSerializer {
 
   void SerializeStringTable(StringTable* string_table);
 
-  void SerializeObjectImpl(Handle<HeapObject> obj) override;
-
-  ReadOnlySerializer* read_only_serializer_;
+  void SerializeObjectImpl(Handle<HeapObject> obj, SlotType slot_type) override;
 
 #ifdef DEBUG
   IdentityMap<int, base::DefaultAllocationPolicy> serialized_objects_;
diff --git a/deps/v8/src/snapshot/snapshot-compression.cc b/deps/v8/src/snapshot/snapshot-compression.cc
index 3f735cc20f7441..ee73389436e9d0 100644
--- a/deps/v8/src/snapshot/snapshot-compression.cc
+++ b/deps/v8/src/snapshot/snapshot-compression.cc
@@ -36,7 +36,8 @@ SnapshotData SnapshotCompression::Compress(
   snapshot_data.AllocateData(
       static_cast<uint32_t>(sizeof(payload_length) + compressed_data_size));
 
-  byte* compressed_data = const_cast<byte*>(snapshot_data.RawData().begin());
+  uint8_t* compressed_data =
+      const_cast<uint8_t*>(snapshot_data.RawData().begin());
   // Since we are doing raw compression (no zlib or gzip headers), we need to
   // manually store the uncompressed size.
   MemCopy(compressed_data, &payload_length, sizeof(payload_length));
@@ -63,7 +64,7 @@ SnapshotData SnapshotCompression::Compress(
 }
 
 SnapshotData SnapshotCompression::Decompress(
-    base::Vector<const byte> compressed_data) {
+    base::Vector<const uint8_t> compressed_data) {
   SnapshotData snapshot_data;
   base::ElapsedTimer timer;
   if (v8_flags.profile_deserialization) timer.Start();
diff --git a/deps/v8/src/snapshot/snapshot-compression.h b/deps/v8/src/snapshot/snapshot-compression.h
index bff4c1653c6c04..0d41c3fa348307 100644
--- a/deps/v8/src/snapshot/snapshot-compression.h
+++ b/deps/v8/src/snapshot/snapshot-compression.h
@@ -16,7 +16,7 @@ class SnapshotCompression : public AllStatic {
   V8_EXPORT_PRIVATE static SnapshotData Compress(
       const SnapshotData* uncompressed_data);
   V8_EXPORT_PRIVATE static SnapshotData Decompress(
-      base::Vector<const byte> compressed_data);
+      base::Vector<const uint8_t> compressed_data);
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/snapshot-data.cc b/deps/v8/src/snapshot/snapshot-data.cc
index 702f1a57a8be9e..e45f1ed804455d 100644
--- a/deps/v8/src/snapshot/snapshot-data.cc
+++ b/deps/v8/src/snapshot/snapshot-data.cc
@@ -12,7 +12,7 @@ namespace internal {
 
 void SerializedData::AllocateData(uint32_t size) {
   DCHECK(!owns_data_);
-  data_ = NewArray<byte>(size);
+  data_ = NewArray<uint8_t>(size);
   size_ = size;
   owns_data_ = true;
 }
@@ -22,7 +22,7 @@ constexpr uint32_t SerializedData::kMagicNumber;
 
 SnapshotData::SnapshotData(const Serializer* serializer) {
   DisallowGarbageCollection no_gc;
-  const std::vector<byte>* payload = serializer->Payload();
+  const std::vector<uint8_t>* payload = serializer->Payload();
 
   // Calculate sizes.
   uint32_t size = kHeaderSize + static_cast<uint32_t>(payload->size());
@@ -42,11 +42,11 @@ SnapshotData::SnapshotData(const Serializer* serializer) {
             static_cast<size_t>(payload->size()));
 }
 
-base::Vector<const byte> SnapshotData::Payload() const {
-  const byte* payload = data_ + kHeaderSize;
+base::Vector<const uint8_t> SnapshotData::Payload() const {
+  const uint8_t* payload = data_ + kHeaderSize;
   uint32_t length = GetHeaderValue(kPayloadLengthOffset);
   DCHECK_EQ(data_ + size_, payload + length);
-  return base::Vector<const byte>(payload, length);
+  return base::Vector<const uint8_t>(payload, length);
 }
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/snapshot-data.h b/deps/v8/src/snapshot/snapshot-data.h
index 2127cca719fcce..4037cb5408981b 100644
--- a/deps/v8/src/snapshot/snapshot-data.h
+++ b/deps/v8/src/snapshot/snapshot-data.h
@@ -20,7 +20,7 @@ class Serializer;
 
 class SerializedData {
  public:
-  SerializedData(byte* data, int size)
+  SerializedData(uint8_t* data, int size)
       : data_(data), size_(size), owns_data_(false) {}
   SerializedData() : data_(nullptr), size_(0), owns_data_(false) {}
   SerializedData(SerializedData&& other) V8_NOEXCEPT
@@ -34,7 +34,7 @@ class SerializedData {
   SerializedData& operator=(const SerializedData&) = delete;
 
   virtual ~SerializedData() {
-    if (owns_data_) DeleteArray<byte>(data_);
+    if (owns_data_) DeleteArray<uint8_t>(data_);
   }
 
   uint32_t GetMagicNumber() const { return GetHeaderValue(kMagicNumberOffset); }
@@ -61,7 +61,7 @@ class SerializedData {
 
   void SetMagicNumber() { SetHeaderValue(kMagicNumberOffset, kMagicNumber); }
 
-  byte* data_;
+  uint8_t* data_;
   uint32_t size_;
   bool owns_data_;
 };
@@ -73,14 +73,14 @@ class V8_EXPORT_PRIVATE SnapshotData : public SerializedData {
   explicit SnapshotData(const Serializer* serializer);
 
   // Used when consuming.
-  explicit SnapshotData(const base::Vector<const byte> snapshot)
-      : SerializedData(const_cast<byte*>(snapshot.begin()), snapshot.length()) {
-  }
+  explicit SnapshotData(const base::Vector<const uint8_t> snapshot)
+      : SerializedData(const_cast<uint8_t*>(snapshot.begin()),
+                       snapshot.length()) {}
 
-  virtual base::Vector<const byte> Payload() const;
+  virtual base::Vector<const uint8_t> Payload() const;
 
-  base::Vector<const byte> RawData() const {
-    return base::Vector<const byte>(data_, size_);
+  base::Vector<const uint8_t> RawData() const {
+    return base::Vector<const uint8_t>(data_, size_);
   }
 
  protected:
diff --git a/deps/v8/src/snapshot/snapshot-source-sink.cc b/deps/v8/src/snapshot/snapshot-source-sink.cc
index 0ebc19894ad39f..5f59337facf2fe 100644
--- a/deps/v8/src/snapshot/snapshot-source-sink.cc
+++ b/deps/v8/src/snapshot/snapshot-source-sink.cc
@@ -13,27 +13,30 @@
 namespace v8 {
 namespace internal {
 
-void SnapshotByteSink::PutN(int number_of_bytes, const byte v,
+void SnapshotByteSink::PutN(int number_of_bytes, const uint8_t v,
                             const char* description) {
   data_.insert(data_.end(), number_of_bytes, v);
 }
 
-void SnapshotByteSink::PutInt(uintptr_t integer, const char* description) {
-  DCHECK_LT(integer, 1 << 30);
+void SnapshotByteSink::PutUint30(uint32_t integer, const char* description) {
+  CHECK_LT(integer, 1UL << 30);
   integer <<= 2;
   int bytes = 1;
   if (integer > 0xFF) bytes = 2;
   if (integer > 0xFFFF) bytes = 3;
   if (integer > 0xFFFFFF) bytes = 4;
   integer |= (bytes - 1);
-  Put(static_cast<byte>(integer & 0xFF), "IntPart1");
-  if (bytes > 1) Put(static_cast<byte>((integer >> 8) & 0xFF), "IntPart2");
-  if (bytes > 2) Put(static_cast<byte>((integer >> 16) & 0xFF), "IntPart3");
-  if (bytes > 3) Put(static_cast<byte>((integer >> 24) & 0xFF), "IntPart4");
+  Put(static_cast<uint8_t>(integer & 0xFF), "IntPart1");
+  if (bytes > 1) Put(static_cast<uint8_t>((integer >> 8) & 0xFF), "IntPart2");
+  if (bytes > 2) Put(static_cast<uint8_t>((integer >> 16) & 0xFF), "IntPart3");
+  if (bytes > 3) Put(static_cast<uint8_t>((integer >> 24) & 0xFF), "IntPart4");
 }
 
-void SnapshotByteSink::PutRaw(const byte* data, int number_of_bytes,
+void SnapshotByteSink::PutRaw(const uint8_t* data, int number_of_bytes,
                               const char* description) {
+#ifdef MEMORY_SANITIZER
+  __msan_check_mem_is_initialized(data, number_of_bytes);
+#endif
   data_.insert(data_.end(), data, data + number_of_bytes);
 }
 
@@ -41,9 +44,9 @@ void SnapshotByteSink::Append(const SnapshotByteSink& other) {
   data_.insert(data_.end(), other.data_.begin(), other.data_.end());
 }
 
-int SnapshotByteSource::GetBlob(const byte** data) {
-  int size = GetInt();
-  CHECK(position_ + size <= length_);
+int SnapshotByteSource::GetBlob(const uint8_t** data) {
+  int size = GetUint30();
+  CHECK_LE(position_ + size, length_);
   *data = &data_[position_];
   Advance(size);
   return size;
diff --git a/deps/v8/src/snapshot/snapshot-source-sink.h b/deps/v8/src/snapshot/snapshot-source-sink.h
index 38e94175c9147b..d61969940c38b2 100644
--- a/deps/v8/src/snapshot/snapshot-source-sink.h
+++ b/deps/v8/src/snapshot/snapshot-source-sink.h
@@ -25,11 +25,11 @@ namespace internal {
 class SnapshotByteSource final {
  public:
   SnapshotByteSource(const char* data, int length)
-      : data_(reinterpret_cast<const byte*>(data)),
+      : data_(reinterpret_cast<const uint8_t*>(data)),
         length_(length),
         position_(0) {}
 
-  explicit SnapshotByteSource(base::Vector<const byte> payload)
+  explicit SnapshotByteSource(base::Vector<const uint8_t> payload)
       : data_(payload.begin()), length_(payload.length()), position_(0) {}
 
   ~SnapshotByteSource() = default;
@@ -38,12 +38,12 @@ class SnapshotByteSource final {
 
   bool HasMore() { return position_ < length_; }
 
-  byte Get() {
+  uint8_t Get() {
     DCHECK(position_ < length_);
     return data_[position_++];
   }
 
-  byte Peek() const {
+  uint8_t Peek() const {
     DCHECK(position_ < length_);
     return data_[position_];
   }
@@ -51,6 +51,7 @@ class SnapshotByteSource final {
   void Advance(int by) { position_ += by; }
 
   void CopyRaw(void* to, int number_of_bytes) {
+    DCHECK_LE(position_ + number_of_bytes, length_);
     memcpy(to, data_ + position_, number_of_bytes);
     position_ += number_of_bytes;
   }
@@ -79,10 +80,12 @@ class SnapshotByteSource final {
   }
 #endif
 
-  inline int GetInt() {
+  // Decode a uint30 with run-length encoding. Must have been encoded with
+  // PutUint30.
+  inline uint32_t GetUint30() {
     // This way of decoding variable-length encoded integers does not
     // suffer from branch mispredictions.
-    DCHECK(position_ + 3 < length_);
+    DCHECK_LT(position_ + 3, length_);
     uint32_t answer = data_[position_];
     answer |= data_[position_ + 1] << 8;
     answer |= data_[position_ + 2] << 16;
@@ -96,14 +99,22 @@ class SnapshotByteSource final {
     return answer;
   }
 
+  uint32_t GetUint32() {
+    uint32_t integer;
+    CopyRaw(reinterpret_cast<uint8_t*>(&integer), sizeof(integer));
+    return integer;
+  }
+
   // Returns length.
-  int GetBlob(const byte** data);
+  int GetBlob(const uint8_t** data);
 
-  int position() { return position_; }
+  int position() const { return position_; }
   void set_position(int position) { position_ = position; }
 
+  const uint8_t* data() const { return data_; }
+
  private:
-  const byte* data_;
+  const uint8_t* data_;
   int length_;
   int position_;
 };
@@ -120,19 +131,24 @@ class SnapshotByteSink {
 
   ~SnapshotByteSink() = default;
 
-  void Put(byte b, const char* description) { data_.push_back(b); }
+  void Put(uint8_t b, const char* description) { data_.push_back(b); }
 
-  void PutN(int number_of_bytes, const byte v, const char* description);
-  void PutInt(uintptr_t integer, const char* description);
-  void PutRaw(const byte* data, int number_of_bytes, const char* description);
+  void PutN(int number_of_bytes, const uint8_t v, const char* description);
+  // Append a uint30 with run-length encoding. Must be decoded with GetUint30.
+  void PutUint30(uint32_t integer, const char* description);
+  void PutUint32(uint32_t integer, const char* description) {
+    PutRaw(reinterpret_cast<uint8_t*>(&integer), sizeof(integer), description);
+  }
+  void PutRaw(const uint8_t* data, int number_of_bytes,
+              const char* description);
 
   void Append(const SnapshotByteSink& other);
   int Position() const { return static_cast<int>(data_.size()); }
 
-  const std::vector<byte>* data() const { return &data_; }
+  const std::vector<uint8_t>* data() const { return &data_; }
 
  private:
-  std::vector<byte> data_;
+  std::vector<uint8_t> data_;
 };
 
 }  // namespace internal
diff --git a/deps/v8/src/snapshot/snapshot-utils.cc b/deps/v8/src/snapshot/snapshot-utils.cc
index 834d003575764f..ea04fcec0ecebd 100644
--- a/deps/v8/src/snapshot/snapshot-utils.cc
+++ b/deps/v8/src/snapshot/snapshot-utils.cc
@@ -13,7 +13,7 @@
 namespace v8 {
 namespace internal {
 
-uint32_t Checksum(base::Vector<const byte> payload) {
+uint32_t Checksum(base::Vector<const uint8_t> payload) {
 #ifdef MEMORY_SANITIZER
   // Computing the checksum includes padding bytes for objects like strings.
   // Mark every object as initialized in the code serializer.
diff --git a/deps/v8/src/snapshot/snapshot-utils.h b/deps/v8/src/snapshot/snapshot-utils.h
index f21195a4ac625a..e53a8a8478615a 100644
--- a/deps/v8/src/snapshot/snapshot-utils.h
+++ b/deps/v8/src/snapshot/snapshot-utils.h
@@ -11,7 +11,7 @@
 namespace v8 {
 namespace internal {
 
-V8_EXPORT_PRIVATE uint32_t Checksum(base::Vector<const byte> payload);
+V8_EXPORT_PRIVATE uint32_t Checksum(base::Vector<const uint8_t> payload);
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/snapshot/snapshot.cc b/deps/v8/src/snapshot/snapshot.cc
index c444670ba04b62..45f11e89463d9c 100644
--- a/deps/v8/src/snapshot/snapshot.cc
+++ b/deps/v8/src/snapshot/snapshot.cc
@@ -6,8 +6,13 @@
 
 #include "src/snapshot/snapshot.h"
 
+#include "src/api/api-inl.h"  // For OpenHandle.
+#include "src/baseline/baseline-batch-compiler.h"
 #include "src/common/assert-scope.h"
-#include "src/heap/parked-scope.h"
+#include "src/execution/local-isolate-inl.h"
+#include "src/handles/global-handles-inl.h"
+#include "src/heap/local-heap-inl.h"
+#include "src/heap/read-only-promotion.h"
 #include "src/heap/safepoint.h"
 #include "src/init/bootstrapper.h"
 #include "src/logging/runtime-call-stats-scope.h"
@@ -42,16 +47,18 @@ class SnapshotImpl : public AllStatic {
   static uint32_t ExtractNumContexts(const v8::StartupData* data);
   static uint32_t ExtractContextOffset(const v8::StartupData* data,
                                        uint32_t index);
-  static base::Vector<const byte> ExtractStartupData(
+  static base::Vector<const uint8_t> ExtractStartupData(
       const v8::StartupData* data);
-  static base::Vector<const byte> ExtractReadOnlyData(
+  static base::Vector<const uint8_t> ExtractReadOnlyData(
       const v8::StartupData* data);
-  static base::Vector<const byte> ExtractSharedHeapData(
+  static base::Vector<const uint8_t> ExtractSharedHeapData(
       const v8::StartupData* data);
-  static base::Vector<const byte> ExtractContextData(
+  static base::Vector<const uint8_t> ExtractContextData(
       const v8::StartupData* data, uint32_t index);
 
   static uint32_t GetHeaderValue(const v8::StartupData* data, uint32_t offset) {
+    DCHECK_NOT_NULL(data);
+    DCHECK_LT(offset, static_cast<uint32_t>(data->raw_size));
     return base::ReadLittleEndianValue<uint32_t>(
         reinterpret_cast<Address>(data->data) + offset);
   }
@@ -66,11 +73,12 @@ class SnapshotImpl : public AllStatic {
   // [0] number of contexts N
   // [1] rehashability
   // [2] checksum
-  // [3] (64 bytes) version string
-  // [4] offset to readonly
-  // [5] offset to shared heap
-  // [6] offset to context 0
-  // [7] offset to context 1
+  // [3] read-only snapshot checksum
+  // [4] (64 bytes) version string
+  // [5] offset to readonly
+  // [6] offset to shared heap
+  // [7] offset to context 0
+  // [8] offset to context 1
   // ...
   // ... offset to context N - 1
   // ... startup snapshot data
@@ -84,7 +92,10 @@ class SnapshotImpl : public AllStatic {
   static const uint32_t kRehashabilityOffset =
       kNumberOfContextsOffset + kUInt32Size;
   static const uint32_t kChecksumOffset = kRehashabilityOffset + kUInt32Size;
-  static const uint32_t kVersionStringOffset = kChecksumOffset + kUInt32Size;
+  static const uint32_t kReadOnlySnapshotChecksumOffset =
+      kChecksumOffset + kUInt32Size;
+  static const uint32_t kVersionStringOffset =
+      kReadOnlySnapshotChecksumOffset + kUInt32Size;
   static const uint32_t kVersionStringLength = 64;
   static const uint32_t kReadOnlyOffsetOffset =
       kVersionStringOffset + kVersionStringLength;
@@ -93,12 +104,18 @@ class SnapshotImpl : public AllStatic {
   static const uint32_t kFirstContextOffsetOffset =
       kSharedHeapOffsetOffset + kUInt32Size;
 
-  static base::Vector<const byte> ChecksummedContent(
+  static base::Vector<const uint8_t> ChecksummedContent(
       const v8::StartupData* data) {
-    static_assert(kVersionStringOffset == kChecksumOffset + kUInt32Size);
-    const uint32_t kChecksumStart = kVersionStringOffset;
-    return base::Vector<const byte>(
-        reinterpret_cast<const byte*>(data->data + kChecksumStart),
+    // The hashed region is everything but the header slots up-to-and-including
+    // the checksum slot itself.
+    // TODO(jgruber): We currently exclude #contexts and rehashability. This
+    // seems arbitrary and I think we could shuffle header slot order around to
+    // include them, just for consistency.
+    static_assert(kReadOnlySnapshotChecksumOffset ==
+                  kChecksumOffset + kUInt32Size);
+    const uint32_t kChecksumStart = kReadOnlySnapshotChecksumOffset;
+    return base::Vector<const uint8_t>(
+        reinterpret_cast<const uint8_t*>(data->data + kChecksumStart),
         data->raw_size - kChecksumStart);
   }
 
@@ -115,7 +132,7 @@ class SnapshotImpl : public AllStatic {
 }  // namespace
 
 SnapshotData MaybeDecompress(Isolate* isolate,
-                             const base::Vector<const byte>& snapshot_data) {
+                             base::Vector<const uint8_t> snapshot_data) {
 #ifdef V8_SNAPSHOT_COMPRESSION
   TRACE_EVENT0("v8", "V8.SnapshotDecompress");
   RCS_SCOPE(isolate, RuntimeCallCounterId::kSnapshotDecompress);
@@ -166,11 +183,11 @@ bool Snapshot::Initialize(Isolate* isolate) {
     CHECK(VerifyChecksum(blob));
   }
 
-  base::Vector<const byte> startup_data =
+  base::Vector<const uint8_t> startup_data =
       SnapshotImpl::ExtractStartupData(blob);
-  base::Vector<const byte> read_only_data =
+  base::Vector<const uint8_t> read_only_data =
       SnapshotImpl::ExtractReadOnlyData(blob);
-  base::Vector<const byte> shared_heap_data =
+  base::Vector<const uint8_t> shared_heap_data =
       SnapshotImpl::ExtractSharedHeapData(blob);
 
   SnapshotData startup_snapshot_data(MaybeDecompress(isolate, startup_data));
@@ -201,7 +218,7 @@ MaybeHandle<Context> Snapshot::NewContextFromSnapshot(
 
   const v8::StartupData* blob = isolate->snapshot_blob();
   bool can_rehash = ExtractRehashability(blob);
-  base::Vector<const byte> context_data = SnapshotImpl::ExtractContextData(
+  base::Vector<const uint8_t> context_data = SnapshotImpl::ExtractContextData(
       blob, static_cast<uint32_t>(context_index));
   SnapshotData snapshot_data(MaybeDecompress(isolate, context_data));
 
@@ -227,31 +244,42 @@ void Snapshot::ClearReconstructableDataForSerialization(
   // Clear SFIs and JSRegExps.
   PtrComprCageBase cage_base(isolate);
 
-  if (clear_recompilable_data) {
+  {
     HandleScope scope(isolate);
     std::vector<i::Handle<i::SharedFunctionInfo>> sfis_to_clear;
     {
       i::HeapObjectIterator it(isolate->heap());
-      for (i::HeapObject o = it.Next(); !o.is_null(); o = it.Next()) {
-        if (o.IsSharedFunctionInfo(cage_base)) {
-          i::SharedFunctionInfo shared = i::SharedFunctionInfo::cast(o);
-          if (shared.script(cage_base).IsScript(cage_base) &&
-              Script::cast(shared.script(cage_base)).type() ==
-                  Script::TYPE_EXTENSION) {
+      for (i::Tagged<i::HeapObject> o = it.Next(); !o.is_null();
+           o = it.Next()) {
+        if (clear_recompilable_data && IsSharedFunctionInfo(o, cage_base)) {
+          i::Tagged<i::SharedFunctionInfo> shared =
+              i::SharedFunctionInfo::cast(o);
+          if (IsScript(shared->script(cage_base), cage_base) &&
+              Script::cast(shared->script(cage_base))->type() ==
+                  Script::Type::kExtension) {
             continue;  // Don't clear extensions, they cannot be recompiled.
           }
-          if (shared.CanDiscardCompiled()) {
+          if (shared->CanDiscardCompiled()) {
             sfis_to_clear.emplace_back(shared, isolate);
           }
-        } else if (o.IsJSRegExp(cage_base)) {
-          i::JSRegExp regexp = i::JSRegExp::cast(o);
-          if (regexp.HasCompiledCode()) {
-            regexp.DiscardCompiledCodeForSerialization();
+        } else if (IsJSRegExp(o, cage_base)) {
+          i::Tagged<i::JSRegExp> regexp = i::JSRegExp::cast(o);
+          if (regexp->HasCompiledCode()) {
+            regexp->DiscardCompiledCodeForSerialization();
           }
         }
       }
     }
 
+#if V8_ENABLE_WEBASSEMBLY
+    // Clear the cached js-to-wasm wrappers.
+    Handle<WeakArrayList> wrappers =
+        handle(isolate->heap()->js_to_wasm_wrappers(), isolate);
+    for (int i = 0; i < wrappers->length(); ++i) {
+      wrappers->Set(i, MaybeObject{});
+    }
+#endif  // V8_ENABLE_WEBASSEMBLY
+
     // Must happen after heap iteration since SFI::DiscardCompiled may allocate.
     for (i::Handle<i::SharedFunctionInfo> shared : sfis_to_clear) {
       if (shared->CanDiscardCompiled()) {
@@ -261,41 +289,44 @@ void Snapshot::ClearReconstructableDataForSerialization(
   }
 
   // Clear JSFunctions.
+  {
+    i::HeapObjectIterator it(isolate->heap());
+    for (i::Tagged<i::HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
+      if (!IsJSFunction(o, cage_base)) continue;
+
+      i::Tagged<i::JSFunction> fun = i::JSFunction::cast(o);
+      fun->CompleteInobjectSlackTrackingIfActive();
+
+      i::Tagged<i::SharedFunctionInfo> shared = fun->shared();
+      if (IsScript(shared->script(cage_base), cage_base) &&
+          Script::cast(shared->script(cage_base))->type() ==
+              Script::Type::kExtension) {
+        continue;  // Don't clear extensions, they cannot be recompiled.
+      }
 
-  i::HeapObjectIterator it(isolate->heap());
-  for (i::HeapObject o = it.Next(); !o.is_null(); o = it.Next()) {
-    if (!o.IsJSFunction(cage_base)) continue;
-
-    i::JSFunction fun = i::JSFunction::cast(o);
-    fun.CompleteInobjectSlackTrackingIfActive();
-
-    i::SharedFunctionInfo shared = fun.shared();
-    if (shared.script(cage_base).IsScript(cage_base) &&
-        Script::cast(shared.script(cage_base)).type() ==
-            Script::TYPE_EXTENSION) {
-      continue;  // Don't clear extensions, they cannot be recompiled.
-    }
-
-    // Also, clear out feedback vectors and recompilable code.
-    if (fun.CanDiscardCompiled()) {
-      fun.set_code(*BUILTIN_CODE(isolate, CompileLazy));
-    }
-    if (!fun.raw_feedback_cell(cage_base).value(cage_base).IsUndefined()) {
-      fun.raw_feedback_cell(cage_base).set_value(
-          i::ReadOnlyRoots(isolate).undefined_value());
-    }
+      // Also, clear out feedback vectors and recompilable code.
+      if (fun->CanDiscardCompiled()) {
+        fun->set_code(*BUILTIN_CODE(isolate, CompileLazy));
+      }
+      if (!IsUndefined(fun->raw_feedback_cell(cage_base)->value(cage_base))) {
+        fun->raw_feedback_cell(cage_base)->set_value(
+            i::ReadOnlyRoots(isolate).undefined_value());
+      }
 #ifdef DEBUG
-    if (clear_recompilable_data) {
+      if (clear_recompilable_data) {
 #if V8_ENABLE_WEBASSEMBLY
-      DCHECK(fun.shared().HasWasmExportedFunctionData() ||
-             fun.shared().HasBuiltinId() || fun.shared().IsApiFunction() ||
-             fun.shared().HasUncompiledDataWithoutPreparseData());
+        DCHECK(fun->shared()->HasWasmExportedFunctionData() ||
+               fun->shared()->HasBuiltinId() ||
+               fun->shared()->IsApiFunction() ||
+               fun->shared()->HasUncompiledDataWithoutPreparseData());
 #else
-      DCHECK(fun.shared().HasBuiltinId() || fun.shared().IsApiFunction() ||
-             fun.shared().HasUncompiledDataWithoutPreparseData());
+        DCHECK(fun->shared()->HasBuiltinId() ||
+               fun->shared()->IsApiFunction() ||
+               fun->shared()->HasUncompiledDataWithoutPreparseData());
 #endif  // V8_ENABLE_WEBASSEMBLY
-    }
+      }
 #endif  // DEBUG
+    }
   }
 
   // PendingOptimizeTable also contains BytecodeArray, we need to clear the
@@ -303,6 +334,30 @@ void Snapshot::ClearReconstructableDataForSerialization(
   ReadOnlyRoots roots(isolate);
   isolate->heap()->SetFunctionsMarkedForManualOptimization(
       roots.undefined_value());
+
+#if V8_ENABLE_WEBASSEMBLY
+  {
+    // Check if there are any asm.js / wasm functions on the heap.
+    // These cannot be serialized due to restrictions with the js-to-wasm
+    // wrapper. A tiered-up wrapper would have to be replaced with a generic
+    // wrapper which isn't supported. For asm.js there also isn't any support
+    // for the generic wrapper at all.
+    i::HeapObjectIterator it(isolate->heap(),
+                             HeapObjectIterator::kFilterUnreachable);
+    for (i::Tagged<i::HeapObject> o = it.Next(); !o.is_null(); o = it.Next()) {
+      if (IsJSFunction(o)) {
+        i::Tagged<i::JSFunction> fun = i::JSFunction::cast(o);
+        if (fun->shared()->HasAsmWasmData()) {
+          FATAL("asm.js functions are not supported in snapshots");
+        }
+        if (fun->shared()->HasWasmExportedFunctionData()) {
+          FATAL(
+              "Exported WebAssembly functions are not supported in snapshots");
+        }
+      }
+    }
+  }
+#endif  // V8_ENABLE_WEBASSEMBLY
 }
 
 // static
@@ -328,7 +383,9 @@ void Snapshot::SerializeDeserializeAndVerifyForTesting(
         ((isolate->has_shared_space() || ReadOnlyHeap::IsReadOnlySpaceShared())
              ? Snapshot::kReconstructReadOnlyAndSharedObjectCachesForTesting
              : 0));
-    serialized_data = Snapshot::Create(isolate, *default_context,
+    std::vector<Context> contexts{*default_context};
+    std::vector<SerializeInternalFieldsCallback> callbacks{{}};
+    serialized_data = Snapshot::Create(isolate, &contexts, callbacks,
                                        safepoint_scope, no_gc, flags);
     auto_delete_serialized_data.reset(serialized_data.data);
   }
@@ -336,38 +393,37 @@ void Snapshot::SerializeDeserializeAndVerifyForTesting(
   // The shared heap is verified on Heap teardown, which performs a global
   // safepoint. Both isolate and new_isolate are running in the same thread, so
   // park isolate before running new_isolate to avoid deadlock.
-  ParkedScope parked(isolate->main_thread_local_isolate());
-
-  // Test deserialization.
-  Isolate* new_isolate = Isolate::New();
-  std::unique_ptr<v8::ArrayBuffer::Allocator> array_buffer_allocator(
-      v8::ArrayBuffer::Allocator::NewDefaultAllocator());
-  {
-    // Set serializer_enabled() to not install extensions and experimental
-    // natives on the new isolate.
-    // TODO(v8:10416): This should be a separate setting on the isolate.
-    new_isolate->enable_serializer();
-    new_isolate->Enter();
-    new_isolate->set_snapshot_blob(&serialized_data);
-    new_isolate->set_array_buffer_allocator(array_buffer_allocator.get());
-    CHECK(Snapshot::Initialize(new_isolate));
-
-    HandleScope scope(new_isolate);
-    Handle<Context> new_native_context =
-        new_isolate->bootstrapper()->CreateEnvironmentForTesting();
-    CHECK(new_native_context->IsNativeContext());
+  isolate->main_thread_local_isolate()->BlockMainThreadWhileParked(
+      [&serialized_data]() {
+        // Test deserialization.
+        Isolate* new_isolate = Isolate::New();
+        std::unique_ptr<v8::ArrayBuffer::Allocator> array_buffer_allocator(
+            v8::ArrayBuffer::Allocator::NewDefaultAllocator());
+        {
+          // Set serializer_enabled() to not install extensions and experimental
+          // natives on the new isolate.
+          // TODO(v8:10416): This should be a separate setting on the isolate.
+          new_isolate->enable_serializer();
+          new_isolate->Enter();
+          new_isolate->set_snapshot_blob(&serialized_data);
+          new_isolate->set_array_buffer_allocator(array_buffer_allocator.get());
+          CHECK(Snapshot::Initialize(new_isolate));
+
+          HandleScope scope(new_isolate);
+          Handle<Context> new_native_context =
+              new_isolate->bootstrapper()->CreateEnvironmentForTesting();
+          CHECK(IsNativeContext(*new_native_context));
 
 #ifdef VERIFY_HEAP
-    if (v8_flags.verify_heap) HeapVerifier::VerifyHeap(new_isolate->heap());
+          if (v8_flags.verify_heap)
+            HeapVerifier::VerifyHeap(new_isolate->heap());
 #endif  // VERIFY_HEAP
-  }
-  new_isolate->Exit();
-  Isolate::Delete(new_isolate);
+        }
+        new_isolate->Exit();
+        Isolate::Delete(new_isolate);
+      });
 }
 
-// static
-constexpr Snapshot::SerializerFlags Snapshot::kDefaultSerializerFlags;
-
 // static
 v8::StartupData Snapshot::Create(
     Isolate* isolate, std::vector<Context>* contexts,
@@ -380,18 +436,14 @@ v8::StartupData Snapshot::Create(
   DCHECK_GT(contexts->size(), 0);
   HandleScope scope(isolate);
 
-  // The HeapSafepointScope ensures we are in a safepoint scope so that the
-  // string table is safe to iterate. Unlike mksnapshot, embedders may have
-  // background threads running.
-
   ReadOnlySerializer read_only_serializer(isolate, flags);
-  read_only_serializer.SerializeReadOnlyRoots();
+  read_only_serializer.Serialize();
 
-  SharedHeapSerializer shared_heap_serializer(isolate, flags,
-                                              &read_only_serializer);
+  // TODO(v8:6593): generalize rehashing, and remove this flag.
+  bool can_be_rehashed = read_only_serializer.can_be_rehashed();
 
-  StartupSerializer startup_serializer(isolate, flags, &read_only_serializer,
-                                       &shared_heap_serializer);
+  SharedHeapSerializer shared_heap_serializer(isolate, flags);
+  StartupSerializer startup_serializer(isolate, flags, &shared_heap_serializer);
   startup_serializer.SerializeStrongReferences(no_gc);
 
   // Serialize each context with a new serializer.
@@ -399,9 +451,6 @@ v8::StartupData Snapshot::Create(
   std::vector<SnapshotData*> context_snapshots;
   context_snapshots.reserve(num_contexts);
 
-  // TODO(v8:6593): generalize rehashing, and remove this flag.
-  bool can_be_rehashed = true;
-
   std::vector<int> context_allocation_sizes;
   for (int i = 0; i < num_contexts; i++) {
     ContextSerializer context_serializer(isolate, flags, &startup_serializer,
@@ -423,18 +472,27 @@ v8::StartupData Snapshot::Create(
   shared_heap_serializer.FinalizeSerialization();
   can_be_rehashed = can_be_rehashed && shared_heap_serializer.can_be_rehashed();
 
-  read_only_serializer.FinalizeSerialization();
-  can_be_rehashed = can_be_rehashed && read_only_serializer.can_be_rehashed();
-
   if (v8_flags.serialization_statistics) {
-    // These prints should match the regexp in test/memory/Memory.json
     DCHECK_NE(read_only_serializer.TotalAllocationSize(), 0);
-    DCHECK_NE(shared_heap_serializer.TotalAllocationSize(), 0);
     DCHECK_NE(startup_serializer.TotalAllocationSize(), 0);
+    // The shared heap snapshot can be empty, no problem.
+    // DCHECK_NE(shared_heap_serializer.TotalAllocationSize(), 0);
+    int per_isolate_allocation_size = startup_serializer.TotalAllocationSize();
+    int per_process_allocation_size = 0;
+    if (ReadOnlyHeap::IsReadOnlySpaceShared()) {
+      per_process_allocation_size += read_only_serializer.TotalAllocationSize();
+    } else {
+      per_isolate_allocation_size += read_only_serializer.TotalAllocationSize();
+    }
+    // TODO(jgruber): At snapshot-generation time we don't know whether the
+    // shared heap snapshot will actually be shared at runtime, or if it will
+    // be deserialized into each isolate. Conservatively account to per-isolate
+    // memory here.
+    per_isolate_allocation_size += shared_heap_serializer.TotalAllocationSize();
+    // These prints must match the regexp in test/memory/Memory.json
     PrintF("Deserialization will allocate:\n");
-    PrintF("%10d bytes per isolate\n",
-           read_only_serializer.TotalAllocationSize() +
-               startup_serializer.TotalAllocationSize());
+    PrintF("%10d bytes per process\n", per_process_allocation_size);
+    PrintF("%10d bytes per isolate\n", per_isolate_allocation_size);
     for (int i = 0; i < num_contexts; i++) {
       DCHECK_NE(context_allocation_sizes[i], 0);
       PrintF("%10d bytes per context #%d\n", context_allocation_sizes[i], i);
@@ -455,17 +513,6 @@ v8::StartupData Snapshot::Create(
   return result;
 }
 
-// static
-v8::StartupData Snapshot::Create(Isolate* isolate, Context default_context,
-                                 const SafepointScope& safepoint_scope,
-                                 const DisallowGarbageCollection& no_gc,
-                                 SerializerFlags flags) {
-  std::vector<Context> contexts{default_context};
-  std::vector<SerializeInternalFieldsCallback> callbacks{{}};
-  return Snapshot::Create(isolate, &contexts, callbacks, safepoint_scope, no_gc,
-                          flags);
-}
-
 v8::StartupData SnapshotImpl::CreateSnapshotBlob(
     const SnapshotData* startup_snapshot_in,
     const SnapshotData* read_only_snapshot_in,
@@ -542,8 +589,9 @@ v8::StartupData SnapshotImpl::CreateSnapshotBlob(
             reinterpret_cast<const char*>(startup_snapshot->RawData().begin()),
             payload_length);
   if (v8_flags.serialization_statistics) {
-    PrintF("Snapshot blob consists of:\n%10d bytes for startup\n",
-           payload_length);
+    // These prints must match the regexp in test/memory/Memory.json
+    PrintF("Snapshot blob consists of:\n");
+    PrintF("%10d bytes for startup\n", payload_length);
   }
   payload_offset += payload_length;
 
@@ -555,7 +603,13 @@ v8::StartupData SnapshotImpl::CreateSnapshotBlob(
       data + payload_offset,
       reinterpret_cast<const char*>(read_only_snapshot->RawData().begin()),
       payload_length);
+  SnapshotImpl::SetHeaderValue(
+      data, SnapshotImpl::kReadOnlySnapshotChecksumOffset,
+      Checksum(base::VectorOf(
+          reinterpret_cast<const uint8_t*>(data + payload_offset),
+          payload_length)));
   if (v8_flags.serialization_statistics) {
+    // These prints must match the regexp in test/memory/Memory.json
     PrintF("%10d bytes for read-only\n", payload_length);
   }
   payload_offset += payload_length;
@@ -569,6 +623,7 @@ v8::StartupData SnapshotImpl::CreateSnapshotBlob(
       reinterpret_cast<const char*>(shared_heap_snapshot->RawData().begin()),
       payload_length);
   if (v8_flags.serialization_statistics) {
+    // These prints must match the regexp in test/memory/Memory.json
     PrintF("%10d bytes for shared heap\n", payload_length);
   }
   payload_offset += payload_length;
@@ -584,6 +639,7 @@ v8::StartupData SnapshotImpl::CreateSnapshotBlob(
         reinterpret_cast<const char*>(context_snapshot->RawData().begin()),
         payload_length);
     if (v8_flags.serialization_statistics) {
+      // These prints must match the regexp in test/memory/Memory.json
       PrintF("%10d bytes for context #%d\n", payload_length, i);
     }
     payload_offset += payload_length;
@@ -601,9 +657,7 @@ v8::StartupData SnapshotImpl::CreateSnapshotBlob(
 }
 
 uint32_t SnapshotImpl::ExtractNumContexts(const v8::StartupData* data) {
-  CHECK_LT(kNumberOfContextsOffset, data->raw_size);
-  uint32_t num_contexts = GetHeaderValue(data, kNumberOfContextsOffset);
-  return num_contexts;
+  return GetHeaderValue(data, kNumberOfContextsOffset);
 }
 
 uint32_t Snapshot::GetExpectedChecksum(const v8::StartupData* data) {
@@ -636,28 +690,33 @@ uint32_t SnapshotImpl::ExtractContextOffset(const v8::StartupData* data,
 }
 
 bool Snapshot::ExtractRehashability(const v8::StartupData* data) {
-  CHECK_LT(SnapshotImpl::kRehashabilityOffset,
-           static_cast<uint32_t>(data->raw_size));
   uint32_t rehashability =
       SnapshotImpl::GetHeaderValue(data, SnapshotImpl::kRehashabilityOffset);
   CHECK_IMPLIES(rehashability != 0, rehashability == 1);
   return rehashability != 0;
 }
 
+// static
+uint32_t Snapshot::ExtractReadOnlySnapshotChecksum(
+    const v8::StartupData* data) {
+  return SnapshotImpl::GetHeaderValue(
+      data, SnapshotImpl::kReadOnlySnapshotChecksumOffset);
+}
+
 namespace {
-base::Vector<const byte> ExtractData(const v8::StartupData* snapshot,
-                                     uint32_t start_offset,
-                                     uint32_t end_offset) {
+base::Vector<const uint8_t> ExtractData(const v8::StartupData* snapshot,
+                                        uint32_t start_offset,
+                                        uint32_t end_offset) {
   CHECK_LT(start_offset, end_offset);
   CHECK_LT(end_offset, snapshot->raw_size);
   uint32_t length = end_offset - start_offset;
-  const byte* data =
-      reinterpret_cast<const byte*>(snapshot->data + start_offset);
-  return base::Vector<const byte>(data, length);
+  const uint8_t* data =
+      reinterpret_cast<const uint8_t*>(snapshot->data + start_offset);
+  return base::Vector<const uint8_t>(data, length);
 }
 }  // namespace
 
-base::Vector<const byte> SnapshotImpl::ExtractStartupData(
+base::Vector<const uint8_t> SnapshotImpl::ExtractStartupData(
     const v8::StartupData* data) {
   DCHECK(Snapshot::SnapshotIsValid(data));
 
@@ -666,7 +725,7 @@ base::Vector<const byte> SnapshotImpl::ExtractStartupData(
                      GetHeaderValue(data, kReadOnlyOffsetOffset));
 }
 
-base::Vector<const byte> SnapshotImpl::ExtractReadOnlyData(
+base::Vector<const uint8_t> SnapshotImpl::ExtractReadOnlyData(
     const v8::StartupData* data) {
   DCHECK(Snapshot::SnapshotIsValid(data));
 
@@ -674,7 +733,7 @@ base::Vector<const byte> SnapshotImpl::ExtractReadOnlyData(
                      GetHeaderValue(data, kSharedHeapOffsetOffset));
 }
 
-base::Vector<const byte> SnapshotImpl::ExtractSharedHeapData(
+base::Vector<const uint8_t> SnapshotImpl::ExtractSharedHeapData(
     const v8::StartupData* data) {
   DCHECK(Snapshot::SnapshotIsValid(data));
 
@@ -682,7 +741,7 @@ base::Vector<const byte> SnapshotImpl::ExtractSharedHeapData(
                      GetHeaderValue(data, ContextSnapshotOffsetOffset(0)));
 }
 
-base::Vector<const byte> SnapshotImpl::ExtractContextData(
+base::Vector<const uint8_t> SnapshotImpl::ExtractContextData(
     const v8::StartupData* data, uint32_t index) {
   uint32_t num_contexts = ExtractNumContexts(data);
   CHECK_LT(index, num_contexts);
@@ -696,10 +755,10 @@ base::Vector<const byte> SnapshotImpl::ExtractContextData(
     CHECK_LT(next_context_offset, data->raw_size);
   }
 
-  const byte* context_data =
-      reinterpret_cast<const byte*>(data->data + context_offset);
+  const uint8_t* context_data =
+      reinterpret_cast<const uint8_t*>(data->data + context_offset);
   uint32_t context_length = next_context_offset - context_offset;
-  return base::Vector<const byte>(context_data, context_length);
+  return base::Vector<const uint8_t>(context_data, context_length);
 }
 
 void SnapshotImpl::CheckVersion(const v8::StartupData* data) {
@@ -735,8 +794,9 @@ bool RunExtraCode(v8::Isolate* isolate, v8::Local<v8::Context> context,
   v8::ScriptOrigin origin(isolate, resource_name);
   v8::ScriptCompiler::Source source(source_string, origin);
   v8::Local<v8::Script> script;
-  if (!v8::ScriptCompiler::Compile(context, &source).ToLocal(&script))
+  if (!v8::ScriptCompiler::Compile(context, &source).ToLocal(&script)) {
     return false;
+  }
   if (script->Run(context).IsEmpty()) return false;
   CHECK(!try_catch.HasCaught());
   return true;
@@ -746,22 +806,29 @@ bool RunExtraCode(v8::Isolate* isolate, v8::Local<v8::Context> context,
 
 v8::StartupData CreateSnapshotDataBlobInternal(
     v8::SnapshotCreator::FunctionCodeHandling function_code_handling,
-    const char* embedded_source, v8::Isolate* isolate) {
-  // If no isolate is passed in, create it (and a new context) from scratch.
-  if (isolate == nullptr) isolate = v8::Isolate::Allocate();
+    const char* embedded_source, Isolate* isolate,
+    Snapshot::SerializerFlags serializer_flags) {
+  bool owns_isolate = isolate == nullptr;
+  SnapshotCreatorImpl creator(isolate, nullptr, nullptr, owns_isolate);
 
-  // Optionally run a script to embed, and serialize to create a snapshot blob.
-  v8::SnapshotCreator snapshot_creator(isolate);
   {
-    v8::HandleScope scope(isolate);
-    v8::Local<v8::Context> context = v8::Context::New(isolate);
+    auto v8_isolate = reinterpret_cast<v8::Isolate*>(creator.isolate());
+    v8::HandleScope scope(v8_isolate);
+    v8::Local<v8::Context> context = v8::Context::New(v8_isolate);
     if (embedded_source != nullptr &&
-        !RunExtraCode(isolate, context, embedded_source, "<embedded>")) {
+        !RunExtraCode(v8_isolate, context, embedded_source, "<embedded>")) {
       return {};
     }
-    snapshot_creator.SetDefaultContext(context);
+    creator.SetDefaultContext(Utils::OpenHandle(*context), nullptr);
   }
-  return snapshot_creator.CreateBlob(function_code_handling);
+  return creator.CreateBlob(function_code_handling, serializer_flags);
+}
+
+v8::StartupData CreateSnapshotDataBlobInternalForInspectorTest(
+    v8::SnapshotCreator::FunctionCodeHandling function_code_handling,
+    const char* embedded_source) {
+  return CreateSnapshotDataBlobInternal(function_code_handling,
+                                        embedded_source);
 }
 
 v8::StartupData WarmUpSnapshotDataBlobInternal(
@@ -795,5 +862,263 @@ v8::StartupData WarmUpSnapshotDataBlobInternal(
       v8::SnapshotCreator::FunctionCodeHandling::kKeep);
 }
 
+SnapshotCreatorImpl::SnapshotCreatorImpl(
+    Isolate* isolate, const intptr_t* api_external_references,
+    const StartupData* existing_blob, bool owns_isolate)
+    : owns_isolate_(owns_isolate),
+      isolate_(isolate == nullptr ? Isolate::New() : isolate),
+      array_buffer_allocator_(ArrayBuffer::Allocator::NewDefaultAllocator()) {
+  DCHECK_NOT_NULL(isolate_);
+
+  isolate_->set_array_buffer_allocator(array_buffer_allocator_);
+  isolate_->set_api_external_references(api_external_references);
+  isolate_->enable_serializer();
+  isolate_->Enter();
+
+  const StartupData* blob = existing_blob != nullptr
+                                ? existing_blob
+                                : Snapshot::DefaultSnapshotBlob();
+  if (blob != nullptr && blob->raw_size > 0) {
+    isolate_->set_snapshot_blob(blob);
+    Snapshot::Initialize(isolate_);
+  } else {
+    isolate_->InitWithoutSnapshot();
+  }
+
+  isolate_->baseline_batch_compiler()->set_enabled(false);
+
+  // Reserve a spot for the default context s.t. the call sequence of
+  // SetDefaultContext / AddContext remains independent.
+  contexts_.push_back(SerializableContext{});
+  DCHECK_EQ(contexts_.size(), kDefaultContextIndex + 1);
+}
+
+SnapshotCreatorImpl::~SnapshotCreatorImpl() {
+  if (isolate_->heap()->read_only_space()->writable()) {
+    // Finalize the RO heap in order to leave the Isolate in a consistent state.
+    isolate_->read_only_heap()->OnCreateHeapObjectsComplete(isolate_);
+  }
+  // Destroy leftover global handles (i.e. if CreateBlob was never called).
+  for (size_t i = 0; i < contexts_.size(); i++) {
+    DCHECK(!created());
+    GlobalHandles::Destroy(contexts_[i].handle_location);
+    contexts_[i].handle_location = nullptr;
+  }
+  isolate_->Exit();
+  if (owns_isolate_) Isolate::Delete(isolate_);
+  delete array_buffer_allocator_;
+}
+
+void SnapshotCreatorImpl::SetDefaultContext(
+    Handle<NativeContext> context, SerializeInternalFieldsCallback callback) {
+  DCHECK(contexts_[kDefaultContextIndex].handle_location == nullptr);
+  DCHECK(!context.is_null());
+  DCHECK(!created());
+  CHECK_EQ(isolate_, context->GetIsolate());
+  contexts_[kDefaultContextIndex].handle_location =
+      isolate_->global_handles()->Create(*context).location();
+  contexts_[kDefaultContextIndex].callback = callback;
+}
+
+size_t SnapshotCreatorImpl::AddContext(
+    Handle<NativeContext> context, SerializeInternalFieldsCallback callback) {
+  DCHECK(!context.is_null());
+  DCHECK(!created());
+  CHECK_EQ(isolate_, context->GetIsolate());
+  size_t index = contexts_.size() - kFirstAddtlContextIndex;
+  contexts_.emplace_back(
+      isolate_->global_handles()->Create(*context).location(), callback);
+  return index;
+}
+
+size_t SnapshotCreatorImpl::AddData(Handle<NativeContext> context,
+                                    Address object) {
+  CHECK_EQ(isolate_, context->GetIsolate());
+  DCHECK_NE(object, kNullAddress);
+  DCHECK(!created());
+  HandleScope scope(isolate_);
+  Handle<Object> obj(Object(object), isolate_);
+  Handle<ArrayList> list;
+  if (!IsArrayList(context->serialized_objects())) {
+    list = ArrayList::New(isolate_, 1);
+  } else {
+    list = Handle<ArrayList>(ArrayList::cast(context->serialized_objects()),
+                             isolate_);
+  }
+  size_t index = static_cast<size_t>(list->Length());
+  list = ArrayList::Add(isolate_, list, obj);
+  context->set_serialized_objects(*list);
+  return index;
+}
+
+size_t SnapshotCreatorImpl::AddData(Address object) {
+  DCHECK_NE(object, kNullAddress);
+  DCHECK(!created());
+  HandleScope scope(isolate_);
+  Handle<Object> obj(Object(object), isolate_);
+  Handle<ArrayList> list;
+  if (!IsArrayList(isolate_->heap()->serialized_objects())) {
+    list = ArrayList::New(isolate_, 1);
+  } else {
+    list = Handle<ArrayList>(
+        ArrayList::cast(isolate_->heap()->serialized_objects()), isolate_);
+  }
+  size_t index = static_cast<size_t>(list->Length());
+  list = ArrayList::Add(isolate_, list, obj);
+  isolate_->heap()->SetSerializedObjects(*list);
+  return index;
+}
+
+Handle<NativeContext> SnapshotCreatorImpl::context_at(size_t i) const {
+  return Handle<NativeContext>(contexts_[i].handle_location);
+}
+
+namespace {
+
+void ConvertSerializedObjectsToFixedArray(Isolate* isolate) {
+  if (!IsArrayList(isolate->heap()->serialized_objects())) {
+    isolate->heap()->SetSerializedObjects(
+        ReadOnlyRoots(isolate).empty_fixed_array());
+  } else {
+    Handle<ArrayList> list(
+        ArrayList::cast(isolate->heap()->serialized_objects()), isolate);
+    Handle<FixedArray> elements = ArrayList::Elements(isolate, list);
+    isolate->heap()->SetSerializedObjects(*elements);
+  }
+}
+
+void ConvertSerializedObjectsToFixedArray(Isolate* isolate,
+                                          Handle<NativeContext> context) {
+  if (!IsArrayList(context->serialized_objects())) {
+    context->set_serialized_objects(ReadOnlyRoots(isolate).empty_fixed_array());
+  } else {
+    Handle<ArrayList> list(ArrayList::cast(context->serialized_objects()),
+                           isolate);
+    Handle<FixedArray> elements = ArrayList::Elements(isolate, list);
+    context->set_serialized_objects(*elements);
+  }
+}
+
+}  // anonymous namespace
+
+// static
+StartupData SnapshotCreatorImpl::CreateBlob(
+    SnapshotCreator::FunctionCodeHandling function_code_handling,
+    Snapshot::SerializerFlags serializer_flags) {
+  CHECK(!created());
+  CHECK(contexts_[kDefaultContextIndex].handle_location != nullptr);
+
+  const size_t num_contexts = contexts_.size();
+  const size_t num_additional_contexts = num_contexts - 1;
+
+  // Create and store lists of embedder-provided data needed during
+  // serialization.
+  {
+    HandleScope scope(isolate_);
+
+    // Convert list of context-independent data to FixedArray.
+    ConvertSerializedObjectsToFixedArray(isolate_);
+
+    // Convert lists of context-dependent data to FixedArray.
+    for (size_t i = 0; i < num_contexts; i++) {
+      ConvertSerializedObjectsToFixedArray(isolate_, context_at(i));
+    }
+
+    // We need to store the global proxy size upfront in case we need the
+    // bootstrapper to create a global proxy before we deserialize the context.
+    Handle<FixedArray> global_proxy_sizes = isolate_->factory()->NewFixedArray(
+        static_cast<int>(num_additional_contexts), AllocationType::kOld);
+    for (size_t i = kFirstAddtlContextIndex; i < num_contexts; i++) {
+      global_proxy_sizes->set(
+          static_cast<int>(i - kFirstAddtlContextIndex),
+          Smi::FromInt(context_at(i)->global_proxy()->Size()));
+    }
+    isolate_->heap()->SetSerializedGlobalProxySizes(*global_proxy_sizes);
+  }
+
+  // We might rehash strings and re-sort descriptors. Clear the lookup cache.
+  isolate_->descriptor_lookup_cache()->Clear();
+
+  // If we don't do this then we end up with a stray root pointing at the
+  // context even after we have disposed of the context.
+  {
+    // Note that we need to run a garbage collection without stack at this
+    // point, so that all dead objects are reclaimed. This is required to avoid
+    // conservative stack scanning and guarantee deterministic behaviour.
+    EmbedderStackStateScope stack_scope(
+        isolate_->heap(), EmbedderStackStateScope::kExplicitInvocation,
+        StackState::kNoHeapPointers);
+    isolate_->heap()->CollectAllAvailableGarbage(
+        GarbageCollectionReason::kSnapshotCreator);
+  }
+  {
+    HandleScope scope(isolate_);
+    isolate_->heap()->CompactWeakArrayLists();
+  }
+
+  Snapshot::ClearReconstructableDataForSerialization(
+      isolate_,
+      function_code_handling == SnapshotCreator::FunctionCodeHandling::kClear);
+
+  SafepointKind safepoint_kind = isolate_->has_shared_space()
+                                     ? SafepointKind::kGlobal
+                                     : SafepointKind::kIsolate;
+  SafepointScope safepoint_scope(isolate_, safepoint_kind);
+  DisallowGarbageCollection no_gc_from_here_on;
+
+  // RO space is usually writable when serializing a snapshot s.t. preceding
+  // heap initialization can also extend RO space. There are notable exceptions
+  // though, including --stress-snapshot and serializer cctests.
+  if (isolate_->heap()->read_only_space()->writable()) {
+    // Promote objects from mutable heap spaces to read-only space prior to
+    // serialization. Objects can be promoted if a) they are themselves
+    // immutable-after-deserialization and b) all objects in the transitive
+    // object graph also satisfy condition a).
+    ReadOnlyPromotion::Promote(isolate_, safepoint_scope, no_gc_from_here_on);
+    // When creating the snapshot from scratch, we are responsible for sealing
+    // the RO heap here. Note we cannot delegate the responsibility e.g. to
+    // Isolate::Init since it should still be possible to allocate into RO
+    // space after the Isolate has been initialized, for example as part of
+    // Context creation.
+    isolate_->read_only_heap()->OnCreateHeapObjectsComplete(isolate_);
+  }
+
+  // Create a vector with all contexts and destroy associated global handles.
+  // This is important because serialization visits active global handles as
+  // roots, which we don't want for our internal SnapshotCreatorImpl-related
+  // data.
+  // Note these contexts may be dead after calling Clear(), but will not be
+  // collected until serialization completes and the DisallowGarbageCollection
+  // scope above goes out of scope.
+  std::vector<Context> raw_contexts;
+  raw_contexts.reserve(num_contexts);
+  {
+    HandleScope scope(isolate_);
+    for (size_t i = 0; i < num_contexts; i++) {
+      raw_contexts.push_back(*context_at(i));
+      GlobalHandles::Destroy(contexts_[i].handle_location);
+      contexts_[i].handle_location = nullptr;
+    }
+  }
+
+  // Check that values referenced by global/eternal handles are accounted for.
+  SerializedHandleChecker handle_checker(isolate_, &raw_contexts);
+  if (!handle_checker.CheckGlobalAndEternalHandles()) {
+    GRACEFUL_FATAL("CheckGlobalAndEternalHandles failed");
+  }
+
+  // Create a vector with all embedder fields serializers.
+  std::vector<SerializeInternalFieldsCallback> raw_callbacks;
+  raw_callbacks.reserve(num_contexts);
+  for (size_t i = 0; i < num_contexts; i++) {
+    raw_callbacks.push_back(contexts_[i].callback);
+  }
+
+  contexts_.clear();
+  return Snapshot::Create(isolate_, &raw_contexts, raw_callbacks,
+                          safepoint_scope, no_gc_from_here_on,
+                          serializer_flags);
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/snapshot/snapshot.h b/deps/v8/src/snapshot/snapshot.h
index 88fa61aab8d4ed..dcbb33fa17e947 100644
--- a/deps/v8/src/snapshot/snapshot.h
+++ b/deps/v8/src/snapshot/snapshot.h
@@ -7,6 +7,7 @@
 
 #include <vector>
 
+#include "include/v8-array-buffer.h"  // For ArrayBuffer::Allocator.
 #include "include/v8-snapshot.h"  // For StartupData.
 #include "src/common/assert-scope.h"
 #include "src/common/globals.h"
@@ -73,13 +74,6 @@ class Snapshot : public AllStatic {
       const DisallowGarbageCollection& no_gc,
       SerializerFlags flags = kDefaultSerializerFlags);
 
-  // Convenience helper for the above when only serializing a single context.
-  static v8::StartupData Create(
-      Isolate* isolate, Context default_context,
-      const SafepointScope& safepoint_scope,
-      const DisallowGarbageCollection& no_gc,
-      SerializerFlags flags = kDefaultSerializerFlags);
-
   // ---------------- Deserialization -----------------------------------------
 
   // Initialize the Isolate from the internal snapshot. Returns false if no
@@ -111,6 +105,8 @@ class Snapshot : public AllStatic {
       const v8::StartupData* data);
   V8_EXPORT_PRIVATE static bool VerifyChecksum(const v8::StartupData* data);
   static bool ExtractRehashability(const v8::StartupData* data);
+  V8_EXPORT_PRIVATE static uint32_t ExtractReadOnlySnapshotChecksum(
+      const v8::StartupData* data);
   static bool VersionIsValid(const v8::StartupData* data);
 
   // To be implemented by the snapshot source.
@@ -126,7 +122,15 @@ class Snapshot : public AllStatic {
 // mksnapshot.
 V8_EXPORT_PRIVATE v8::StartupData CreateSnapshotDataBlobInternal(
     v8::SnapshotCreator::FunctionCodeHandling function_code_handling,
-    const char* embedded_source, v8::Isolate* isolate = nullptr);
+    const char* embedded_source = nullptr, Isolate* isolate = nullptr,
+    Snapshot::SerializerFlags serializer_flags =
+        Snapshot::kDefaultSerializerFlags);
+// .. and for inspector-test.cc which needs an extern declaration due to
+// restrictive include rules:
+V8_EXPORT_PRIVATE v8::StartupData
+CreateSnapshotDataBlobInternalForInspectorTest(
+    v8::SnapshotCreator::FunctionCodeHandling function_code_handling,
+    const char* embedded_source);
 
 // Convenience wrapper around snapshot data blob warmup used e.g. by tests and
 // mksnapshot.
@@ -137,6 +141,50 @@ V8_EXPORT_PRIVATE v8::StartupData WarmUpSnapshotDataBlobInternal(
 void SetSnapshotFromFile(StartupData* snapshot_blob);
 #endif
 
+// The implementation of the API-exposed class SnapshotCreator.
+class SnapshotCreatorImpl final {
+ public:
+  SnapshotCreatorImpl(Isolate* isolate, const intptr_t* api_external_references,
+                      const StartupData* existing_blob, bool owns_isolate);
+  ~SnapshotCreatorImpl();
+
+  Isolate* isolate() const { return isolate_; }
+
+  void SetDefaultContext(Handle<NativeContext> context,
+                         SerializeInternalFieldsCallback callback);
+  size_t AddContext(Handle<NativeContext> context,
+                    SerializeInternalFieldsCallback callback);
+
+  size_t AddData(Handle<NativeContext> context, Address object);
+  size_t AddData(Address object);
+
+  StartupData CreateBlob(
+      SnapshotCreator::FunctionCodeHandling function_code_handling,
+      Snapshot::SerializerFlags serializer_flags =
+          Snapshot::kDefaultSerializerFlags);
+
+  static constexpr size_t kDefaultContextIndex = 0;
+  static constexpr size_t kFirstAddtlContextIndex = kDefaultContextIndex + 1;
+
+ private:
+  struct SerializableContext {
+    SerializableContext() : handle_location(nullptr), callback(nullptr) {}
+    SerializableContext(Address* handle_location,
+                        SerializeInternalFieldsCallback callback)
+        : handle_location(handle_location), callback(callback) {}
+    Address* handle_location = nullptr;  // A GlobalHandle.
+    SerializeInternalFieldsCallback callback;
+  };
+
+  Handle<NativeContext> context_at(size_t i) const;
+  bool created() const { return contexts_.size() == 0; }
+
+  const bool owns_isolate_;
+  Isolate* const isolate_;
+  v8::ArrayBuffer::Allocator* const array_buffer_allocator_;
+  std::vector<SerializableContext> contexts_;
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/src/snapshot/sort-builtins.cc b/deps/v8/src/snapshot/sort-builtins.cc
new file mode 100644
index 00000000000000..1ee1184d61771a
--- /dev/null
+++ b/deps/v8/src/snapshot/sort-builtins.cc
@@ -0,0 +1,332 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "sort-builtins.h"
+
+#include <algorithm>
+#include <fstream>
+
+#include "src/snapshot/embedded/embedded-data-inl.h"
+#include "src/snapshot/embedded/embedded-data.h"
+
+namespace v8 {
+namespace internal {
+
+Cluster::Cluster(uint32_t density, uint32_t size, Builtin target,
+                 BuiltinsSorter* sorter)
+    : density_(density), size_(size), sorter_(sorter) {
+  CHECK(size_);
+  targets_.push_back(target);
+  sorter_->builtin_cluster_map_[target] = this;
+}
+
+BuiltinsSorter::BuiltinsSorter() {}
+
+BuiltinsSorter::~BuiltinsSorter() {
+  for (Cluster* cls : clusters_) {
+    delete cls;
+  }
+}
+
+void Cluster::Merge(Cluster* other) {
+  for (Builtin builtin : other->targets_) {
+    targets_.push_back(builtin);
+    sorter_->builtin_cluster_map_.emplace(builtin, this);
+  }
+  density_ = static_cast<uint32_t>(
+      (time_approximation() + other->time_approximation()) /
+      (size_ + other->size_));
+  size_ += other->size_;
+  other->density_ = 0;
+  other->size_ = 0;
+  other->targets_.clear();
+}
+
+uint64_t Cluster::time_approximation() {
+  return static_cast<uint64_t>(size_) * density_;
+}
+
+void BuiltinsSorter::InitializeClusters() {
+  for (uint32_t i = 0; i < static_cast<uint32_t>(builtin_size_.size()); i++) {
+    Builtin id = Builtins::FromInt(i);
+    Builtins::Kind kind = Builtins::KindOf(id);
+    if (kind == Builtins::Kind::ASM || kind == Builtins::Kind::CPP) {
+      // CHECK there is no data for execution count for non TurboFan compiled
+      // builtin.
+      CHECK_EQ(builtin_density_map_[id], 0);
+      continue;
+    }
+    Cluster* cls =
+        new Cluster(builtin_density_map_[id], builtin_size_[i], id, this);
+    clusters_.push_back(cls);
+    builtin_density_order_.push_back(
+        BuiltinDensitySlot{builtin_density_map_[id], id});
+  }
+
+  std::sort(builtin_density_order_.begin(), builtin_density_order_.end(),
+            [](const BuiltinDensitySlot& x, const BuiltinDensitySlot& y) {
+              return x.density_ > y.density_;
+            });
+}
+
+Builtin BuiltinsSorter::FindBestPredecessorOf(Builtin callee) {
+  Builtin bestPred = Builtin::kNoBuiltinId;
+  int32_t bestProb = 0;
+
+  for (auto caller_it = call_graph_.begin(); caller_it != call_graph_.end();
+       caller_it++) {
+    Builtin caller = caller_it->first;
+    const CallProbabilities& callees_prob = caller_it->second;
+    if (callees_prob.count(callee) > 0) {
+      int32_t incoming_prob = callees_prob.at(callee).incoming_;
+      if (incoming_prob == -1) {
+        // We dont want to merge any cluster with -1 prob, because it means it's
+        // either a non TurboFan compiled builtin or its execution count too
+        // small.
+        continue;
+      }
+      if (bestPred == Builtin::kNoBuiltinId || incoming_prob > bestProb) {
+        bestPred = caller;
+        bestProb = incoming_prob;
+      }
+    }
+
+    if (bestProb < kMinEdgeProbabilityThreshold ||
+        bestPred == Builtin::kNoBuiltinId)
+      continue;
+
+    Cluster* predCls = builtin_cluster_map_[bestPred];
+    Cluster* succCls = builtin_cluster_map_[callee];
+
+    // Don't merge if the caller and callee are already in same cluster.
+    if (predCls == succCls) continue;
+    // Don't merge clusters if the combined size is too big.
+    if (predCls->size_ + succCls->size_ > kMaxClusterSize) continue;
+    if (predCls->density_ == 0) {
+      // Some density of cluster after normalized may be 0, in that case we dont
+      // merge them.
+      continue;
+    }
+    CHECK(predCls->size_);
+
+    uint32_t new_density = static_cast<uint32_t>(
+        (predCls->time_approximation() + succCls->time_approximation()) /
+        (predCls->size_ + succCls->size_));
+
+    // Don't merge clusters if the new merged density is lower too many times
+    // than current cluster, to avoid a huge dropping in cluster density, it
+    // will harm locality of builtins.
+    if (predCls->density_ / kMaxDensityDecreaseThreshold > new_density)
+      continue;
+  }
+
+  return bestPred;
+}
+
+void BuiltinsSorter::MergeBestPredecessors() {
+  for (size_t i = 0; i < builtin_density_order_.size(); i++) {
+    Builtin id = builtin_density_order_[i].builtin_;
+    Cluster* succ_cluster = builtin_cluster_map_[id];
+
+    Builtin bestPred = FindBestPredecessorOf(id);
+    if (bestPred != Builtin::kNoBuiltinId) {
+      Cluster* pred_cluster = builtin_cluster_map_[bestPred];
+      pred_cluster->Merge(succ_cluster);
+    }
+  }
+}
+
+void BuiltinsSorter::SortClusters() {
+  std::sort(clusters_.begin(), clusters_.end(),
+            [](const Cluster* x, const Cluster* y) {
+              return x->density_ > y->density_;
+            });
+
+  clusters_.erase(
+      std::remove_if(clusters_.begin(), clusters_.end(),
+                     [](const Cluster* x) { return x->targets_.size() == 0; }),
+      clusters_.end());
+}
+
+bool AddBuiltinIfNotProcessed(Builtin builtin, std::vector<Builtin>& order,
+                              std::unordered_set<Builtin>& processed_builtins) {
+  if (processed_builtins.count(builtin) == 0) {
+    order.push_back(builtin);
+    processed_builtins.emplace(builtin);
+    return true;
+  }
+  return false;
+}
+
+void BuiltinsSorter::ProcessBlockCountLineInfo(
+    std::istringstream& line_stream,
+    std::unordered_map<std::string, Builtin>& name2id) {
+  // Any line starting with kBuiltinCallBlockDensityMarker is a normalized
+  // execution count of block with call. The format is:
+  //   literal kBuiltinCallBlockDensityMarker , caller , block ,
+  //   normalized_count
+  std::string token;
+  std::string caller_name;
+  CHECK(std::getline(line_stream, caller_name, ','));
+  Builtin caller_id = name2id[caller_name];
+
+  BuiltinsCallGraph* profiler = BuiltinsCallGraph::Get();
+
+  char* end = nullptr;
+  errno = 0;
+  CHECK(std::getline(line_stream, token, ','));
+  int32_t block_id = static_cast<int32_t>(strtoul(token.c_str(), &end, 0));
+  CHECK(errno == 0 && end != token.c_str());
+
+  CHECK(std::getline(line_stream, token, ','));
+  int32_t normalized_count =
+      static_cast<int32_t>(strtoul(token.c_str(), &end, 0));
+  CHECK(errno == 0 && end != token.c_str());
+  CHECK(line_stream.eof());
+
+  const BuiltinCallees* block_callees = profiler->GetBuiltinCallees(caller_id);
+  if (block_callees) {
+    int32_t outgoing_prob = 0;
+    int32_t incoming_prob = 0;
+    int caller_density = 0;
+    int callee_density = 0;
+
+    CHECK(builtin_density_map_.count(caller_id));
+    caller_density = builtin_density_map_.at(caller_id);
+
+    // TODO(v8:13938): Remove the below if check when we just store
+    // interesting blocks (contain call other builtins) execution count into
+    // profiling file.
+    if (block_callees->count(block_id)) {
+      // If the line of block density make sense (means it contain call to
+      // other builtins in this block).
+      for (const auto& callee_id : block_callees->at(block_id)) {
+        if (caller_density != 0) {
+          outgoing_prob = normalized_count * 100 / caller_density;
+        } else {
+          // If the caller density was normalized as 0 but the block density
+          // was not, we set caller prob as 100, otherwise it's 0. Because in
+          // the normalization, we may loss fidelity.
+          // For example, a caller was executed 8 times, but after
+          // normalization, it may be 0 time. At that time, if the
+          // normalized_count of this block (it may be a loop body) is a
+          // positive number, we could think normalized_count is bigger than the
+          // execution count of caller, hence we set it as 100, otherwise it's
+          // smaller than execution count of caller, we could set it as 0.
+          outgoing_prob = normalized_count ? 100 : 0;
+        }
+
+        if (builtin_density_map_.count(callee_id)) {
+          callee_density = builtin_density_map_.at(callee_id);
+          if (callee_density != 0) {
+            incoming_prob = normalized_count * 100 / callee_density;
+          } else {
+            // Same as caller prob when callee density exists but is 0.
+            incoming_prob = normalized_count ? 100 : 0;
+          }
+
+        } else {
+          // If callee_density does not exist, it means the callee was not
+          // compiled by TurboFan or execution count is too small (0 after
+          // normalization), we couldn't get the callee count, so we set it as
+          // -1. In that case we could avoid merging this callee builtin into
+          // any other cluster.
+          incoming_prob = -1;
+        }
+
+        CallProbability probs = CallProbability(incoming_prob, outgoing_prob);
+        if (call_graph_.count(caller_id) == 0) {
+          call_graph_.emplace(caller_id, CallProbabilities());
+        }
+        CallProbabilities& call_probs = call_graph_.at(caller_id);
+        call_probs.emplace(callee_id, probs);
+      }
+    }
+  }
+  CHECK(line_stream.eof());
+}
+
+void BuiltinsSorter::ProcessBuiltinDensityLineInfo(
+    std::istringstream& line_stream,
+    std::unordered_map<std::string, Builtin>& name2id) {
+  // Any line starting with kBuiltinDensityMarker is normalized execution count
+  // for block 0 of a builtin, we take it as density of this builtin. The format
+  // is:
+  //   literal kBuiltinDensityMarker , builtin_name , density
+  std::string token;
+  std::string builtin_name;
+  CHECK(std::getline(line_stream, builtin_name, ','));
+  std::getline(line_stream, token, ',');
+  CHECK(line_stream.eof());
+  char* end = nullptr;
+  int density = static_cast<int>(strtol(token.c_str(), &end, 0));
+  CHECK(errno == 0 && end != token.c_str());
+
+  Builtin builtin_id = name2id[builtin_name];
+  builtin_density_map_.emplace(builtin_id, density);
+}
+
+void BuiltinsSorter::InitializeCallGraph(const char* profiling_file,
+                                         const std::vector<uint32_t>& size) {
+  std::ifstream file(profiling_file);
+  CHECK_WITH_MSG(file.good(), "Can't read log file");
+
+  std::unordered_map<std::string, Builtin> name2id;
+  for (Builtin i = Builtins::kFirst; i <= Builtins::kLast; ++i) {
+    std::string name = Builtins::name(i);
+    name2id.emplace(name, i);
+    builtin_size_.push_back(size.at(static_cast<uint32_t>(i)));
+  }
+
+  for (std::string line; std::getline(file, line);) {
+    std::string token;
+    std::istringstream line_stream(line);
+    // We must put lines start with kBuiltinDensityMarker before lines start
+    // with kBuiltinCallBlockDensityMarker, because we have to density to
+    // calculate call prob.
+    if (!std::getline(line_stream, token, ',')) continue;
+    if (token == kBuiltinCallBlockDensityMarker) {
+      ProcessBlockCountLineInfo(line_stream, name2id);
+    } else if (token == kBuiltinDensityMarker) {
+      ProcessBuiltinDensityLineInfo(line_stream, name2id);
+    }
+  }
+}
+
+std::vector<Builtin> BuiltinsSorter::SortBuiltins(
+    const char* profiling_file, const std::vector<uint32_t>& builtin_size) {
+  InitializeCallGraph(profiling_file, builtin_size);
+
+  // Step 1: initialization.
+  InitializeClusters();
+
+  // Step 2: Merge best predecessors.
+  MergeBestPredecessors();
+
+  // Step 3: Sort clusters again.
+  SortClusters();
+
+  std::unordered_set<Builtin> processed_builtins;
+  std::vector<Builtin> builtin_order;
+
+  // For functions in the sorted cluster from step 3.
+  for (size_t i = 0; i < clusters_.size(); i++) {
+    Cluster* cls = clusters_.at(i);
+    for (size_t j = 0; j < cls->targets_.size(); j++) {
+      Builtin builtin = cls->targets_[j];
+      CHECK(
+          AddBuiltinIfNotProcessed(builtin, builtin_order, processed_builtins));
+    }
+  }
+
+  // For the remaining builtins.
+  for (Builtin i = Builtins::kFirst; i <= Builtins::kLast; ++i) {
+    AddBuiltinIfNotProcessed(i, builtin_order, processed_builtins);
+  }
+
+  return builtin_order;
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/src/snapshot/sort-builtins.h b/deps/v8/src/snapshot/sort-builtins.h
new file mode 100644
index 00000000000000..ce0f2e3915ecc9
--- /dev/null
+++ b/deps/v8/src/snapshot/sort-builtins.h
@@ -0,0 +1,147 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_SNAPSHOT_SORT_BUILTINS_H_
+#define V8_SNAPSHOT_SORT_BUILTINS_H_
+
+#include <unordered_map>
+#include <vector>
+
+#include "src/builtins/builtins.h"
+#include "src/diagnostics/basic-block-profiler.h"
+
+// The inputs were the builtin size, call graph and basic block execution count.
+// There are 3 steps in this sorting algorithm:
+// 1. Initializing cluster and sorting:
+//  A cluster represents a group of functions. At the beginning, each
+//  function was in an individual cluster, and we sort these clusters
+//  by their density (which means how much probabilities this function was
+//  invoked).
+//
+// 2. Merge the best predecessor:
+//  After step 1, we will get lots of clusters which may contain only
+//  one function. According to this order, we iterate each function
+//  and merge cluster with some conditions, like:
+//   1) The most incoming probability.
+//   2) Incoming probability must be bigger than a threshold, like 0.1
+//   3) Merged cluster size couldn't be bigger than a threshold, like 1 mb.
+//   4) Predecessor cluster density couldn't be bigger N times than the new
+//   merged cluster, N is 8 now.
+//
+// 3. Sorting clusters:
+//  After step 2, we obtain lots of clusters which comprise several functions.
+//  We will finally sort these clusters by their density.
+
+namespace v8 {
+namespace internal {
+
+class Cluster;
+struct CallProbability {
+  CallProbability(int32_t incoming = 0, int32_t outgoing = 0)
+      : incoming_(incoming), outgoing_(outgoing) {}
+
+  // There are a caller and a callee, we assume caller was invoked
+  // "caller-count" times, it calls callee "call-count" times, the callee was
+  // invoked "callee-count" times. imcoming_ means the possibity the callee
+  // calls from caller, it was calculted by call-count / callee-count. If
+  // callee-count is 0 (may not be compiled by TurboFan or normalized as 0 due
+  // to too small), we set imcoming_ as -1.
+  int32_t incoming_;
+  // outgoing_ means the possibity the caller
+  // calls to callee, it was calculted by call-count / caller-count. If
+  // caller-count is 0 (may not be compiled by TurboFan or normalized as 0 due
+  // to too small), we set outgoing_ as -1. We didn't use outgoing_ as condition
+  // for reordering builtins yet, but we could try to do some experiments with
+  // it later for obtaining a better order of builtins.
+  int32_t outgoing_;
+};
+// The key is the callee builtin, the value is call probabilities in percent
+// (mostly range in 0 ~ 100, except one call happend in a loop block which was
+// executed more times than block 0 of this builtin).
+using CallProbabilities = std::unordered_map<Builtin, CallProbability>;
+// The key is the caller builtin.
+using CallGraph = std::unordered_map<Builtin, CallProbabilities>;
+// The key is the builtin id, the value is density of builtin (range in 0 ~
+// 10000).
+using BuiltinDensityMap = std::unordered_map<Builtin, uint32_t>;
+// The index is the builtin id, the value is size of builtin (in bytes).
+using BuiltinSize = std::vector<uint32_t>;
+// The key is the builtin id, the value is the cluster which it was comprised.
+using BuiltinClusterMap = std::unordered_map<Builtin, Cluster*>;
+
+class BuiltinsSorter {
+  const int32_t kMinEdgeProbabilityThreshold = 10;
+  const uint32_t kMaxClusterSize = 1 * MB;
+  const uint32_t kMaxDensityDecreaseThreshold = 8;
+
+  const std::string kBuiltinCallBlockDensityMarker = "block_count";
+  const std::string kBuiltinDensityMarker = "builtin_count";
+
+  // Pair of denstity of builtin and builtin id.
+  struct BuiltinDensitySlot {
+    BuiltinDensitySlot(uint32_t density, Builtin builtin)
+        : density_(density), builtin_(builtin) {}
+
+    uint32_t density_;
+    Builtin builtin_;
+  };
+
+ public:
+  BuiltinsSorter();
+  ~BuiltinsSorter();
+  std::vector<Builtin> SortBuiltins(const char* profiling_file,
+                                    const std::vector<uint32_t>& builtin_size);
+
+ private:
+  void InitializeCallGraph(const char* profiling_file,
+                           const std::vector<uint32_t>& size);
+  void InitializeClusters();
+  void MergeBestPredecessors();
+  void SortClusters();
+  Builtin FindBestPredecessorOf(Builtin callee);
+  void ProcessBlockCountLineInfo(
+      std::istringstream& line_stream,
+      std::unordered_map<std::string, Builtin>& name2id);
+  void ProcessBuiltinDensityLineInfo(
+      std::istringstream& line_stream,
+      std::unordered_map<std::string, Builtin>& name2id);
+
+  std::vector<Cluster*> clusters_;
+
+  std::vector<BuiltinDensitySlot> builtin_density_order_;
+
+  CallGraph call_graph_;
+
+  BuiltinDensityMap builtin_density_map_;
+
+  BuiltinSize builtin_size_;
+
+  BuiltinClusterMap builtin_cluster_map_;
+
+  friend class Cluster;
+};
+
+class Cluster {
+ public:
+  Cluster(uint32_t density, uint32_t size, Builtin target,
+          BuiltinsSorter* sorter);
+  void Merge(Cluster* other);
+  uint64_t time_approximation();
+
+ private:
+  // Max initialized density was normalized as 10000.
+  uint32_t density_;
+  // Size of the cluster in bytes.
+  uint32_t size_;
+  std::vector<Builtin> targets_;
+  BuiltinsSorter* sorter_;
+
+  friend class BuiltinsSorter;
+};
+
+}  // namespace internal
+
+}  // namespace v8
+
+#endif  // V8_SNAPSHOT_SORT_BUILTINS_H_
diff --git a/deps/v8/src/snapshot/startup-deserializer.cc b/deps/v8/src/snapshot/startup-deserializer.cc
index d8d81b68057668..85b481fe926fc3 100644
--- a/deps/v8/src/snapshot/startup-deserializer.cc
+++ b/deps/v8/src/snapshot/startup-deserializer.cc
@@ -35,7 +35,8 @@ void StartupDeserializer::DeserializeIntoIsolate() {
     isolate()->heap()->IterateSmiRoots(this);
     isolate()->heap()->IterateRoots(
         this,
-        base::EnumSet<SkipRoot>{SkipRoot::kUnserializable, SkipRoot::kWeak});
+        base::EnumSet<SkipRoot>{SkipRoot::kUnserializable, SkipRoot::kWeak,
+                                SkipRoot::kTracedHandles});
     IterateStartupObjectCache(isolate(), this);
 
     isolate()->heap()->IterateWeakRoots(
diff --git a/deps/v8/src/snapshot/startup-serializer.cc b/deps/v8/src/snapshot/startup-serializer.cc
index f7af6a4ee60c26..98e9d8a6a530b2 100644
--- a/deps/v8/src/snapshot/startup-serializer.cc
+++ b/deps/v8/src/snapshot/startup-serializer.cc
@@ -62,10 +62,8 @@ class V8_NODISCARD SanitizeIsolateScope final {
 
 StartupSerializer::StartupSerializer(
     Isolate* isolate, Snapshot::SerializerFlags flags,
-    ReadOnlySerializer* read_only_serializer,
     SharedHeapSerializer* shared_heap_serializer)
     : RootsSerializer(isolate, flags, RootIndex::kFirstStrongRoot),
-      read_only_serializer_(read_only_serializer),
       shared_heap_serializer_(shared_heap_serializer),
       accessor_infos_(isolate->heap()),
       call_handler_infos_(isolate->heap()) {
@@ -82,25 +80,14 @@ StartupSerializer::~StartupSerializer() {
   OutputStatistics("StartupSerializer");
 }
 
-#ifdef DEBUG
-namespace {
-
-bool IsUnexpectedInstructionStreamObject(Isolate* isolate, HeapObject obj) {
-  if (!obj.IsInstructionStream()) return false;
-  // TODO(jgruber): Is REGEXP code still fully supported?
-  return InstructionStream::cast(obj).code(kAcquireLoad).kind() !=
-         CodeKind::REGEXP;
-}
-
-}  // namespace
-#endif  // DEBUG
-void StartupSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
+void StartupSerializer::SerializeObjectImpl(Handle<HeapObject> obj,
+                                            SlotType slot_type) {
   PtrComprCageBase cage_base(isolate());
 #ifdef DEBUG
-  if (obj->IsJSFunction(cage_base)) {
+  if (IsJSFunction(*obj, cage_base)) {
     v8::base::OS::PrintError("Reference stack:\n");
     PrintStack(std::cerr);
-    obj->Print(std::cerr);
+    Print(*obj, std::cerr);
     FATAL(
         "JSFunction should be added through the context snapshot instead of "
         "the isolate snapshot");
@@ -108,34 +95,34 @@ void StartupSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
 #endif  // DEBUG
   {
     DisallowGarbageCollection no_gc;
-    HeapObject raw = *obj;
-    DCHECK(!IsUnexpectedInstructionStreamObject(isolate(), raw));
+    Tagged<HeapObject> raw = *obj;
+    DCHECK(!IsInstructionStream(raw));
     if (SerializeHotObject(raw)) return;
     if (IsRootAndHasBeenSerialized(raw) && SerializeRoot(raw)) return;
   }
 
-  if (SerializeUsingReadOnlyObjectCache(&sink_, obj)) return;
+  if (SerializeReadOnlyObjectReference(*obj, &sink_)) return;
   if (SerializeUsingSharedHeapObjectCache(&sink_, obj)) return;
   if (SerializeBackReference(*obj)) return;
 
-  if (USE_SIMULATOR_BOOL && obj->IsAccessorInfo(cage_base)) {
+  if (USE_SIMULATOR_BOOL && IsAccessorInfo(*obj, cage_base)) {
     // Wipe external reference redirects in the accessor info.
     Handle<AccessorInfo> info = Handle<AccessorInfo>::cast(obj);
     info->remove_getter_redirection(isolate());
     accessor_infos_.Push(*info);
-  } else if (USE_SIMULATOR_BOOL && obj->IsCallHandlerInfo(cage_base)) {
+  } else if (USE_SIMULATOR_BOOL && IsCallHandlerInfo(*obj, cage_base)) {
     Handle<CallHandlerInfo> info = Handle<CallHandlerInfo>::cast(obj);
     info->remove_callback_redirection(isolate());
     call_handler_infos_.Push(*info);
-  } else if (obj->IsScript(cage_base) &&
+  } else if (IsScript(*obj, cage_base) &&
              Handle<Script>::cast(obj)->IsUserJavaScript()) {
     Handle<Script>::cast(obj)->set_context_data(
         ReadOnlyRoots(isolate()).uninitialized_symbol());
-  } else if (obj->IsSharedFunctionInfo(cage_base)) {
+  } else if (IsSharedFunctionInfo(*obj, cage_base)) {
     // Clear inferred name for native functions.
     Handle<SharedFunctionInfo> shared = Handle<SharedFunctionInfo>::cast(obj);
     if (!shared->IsSubjectToDebugging() && shared->HasUncompiledData()) {
-      shared->uncompiled_data().set_inferred_name(
+      shared->uncompiled_data()->set_inferred_name(
           ReadOnlyRoots(isolate()).empty_string());
     }
   }
@@ -145,14 +132,14 @@ void StartupSerializer::SerializeObjectImpl(Handle<HeapObject> obj) {
   // Object has not yet been serialized.  Serialize it here.
   DCHECK(!ReadOnlyHeap::Contains(*obj));
   ObjectSerializer object_serializer(this, obj, &sink_);
-  object_serializer.Serialize();
+  object_serializer.Serialize(slot_type);
 }
 
 void StartupSerializer::SerializeWeakReferencesAndDeferred() {
   // This comes right after serialization of the context snapshot, where we
   // add entries to the startup object cache of the startup snapshot. Add
   // one entry with 'undefined' to terminate the startup object cache.
-  Object undefined = ReadOnlyRoots(isolate()).undefined_value();
+  Tagged<Object> undefined = ReadOnlyRoots(isolate()).undefined_value();
   VisitRootPointer(Root::kStartupObjectCache, nullptr,
                    FullObjectSlot(&undefined));
 
@@ -175,8 +162,8 @@ void StartupSerializer::SerializeStrongReferences(
   // the first page.
   isolate->heap()->IterateSmiRoots(this);
   isolate->heap()->IterateRoots(
-      this,
-      base::EnumSet<SkipRoot>{SkipRoot::kUnserializable, SkipRoot::kWeak});
+      this, base::EnumSet<SkipRoot>{SkipRoot::kUnserializable, SkipRoot::kWeak,
+                                    SkipRoot::kTracedHandles});
 }
 
 SerializedHandleChecker::SerializedHandleChecker(Isolate* isolate,
@@ -184,15 +171,10 @@ SerializedHandleChecker::SerializedHandleChecker(Isolate* isolate,
     : isolate_(isolate) {
   AddToSet(isolate->heap()->serialized_objects());
   for (auto const& context : *contexts) {
-    AddToSet(context.serialized_objects());
+    AddToSet(context->serialized_objects());
   }
 }
 
-bool StartupSerializer::SerializeUsingReadOnlyObjectCache(
-    SnapshotByteSink* sink, Handle<HeapObject> obj) {
-  return read_only_serializer_->SerializeUsingReadOnlyObjectCache(sink, obj);
-}
-
 bool StartupSerializer::SerializeUsingSharedHeapObjectCache(
     SnapshotByteSink* sink, Handle<HeapObject> obj) {
   return shared_heap_serializer_->SerializeUsingSharedHeapObjectCache(sink,
@@ -203,21 +185,20 @@ void StartupSerializer::SerializeUsingStartupObjectCache(
     SnapshotByteSink* sink, Handle<HeapObject> obj) {
   int cache_index = SerializeInObjectCache(obj);
   sink->Put(kStartupObjectCache, "StartupObjectCache");
-  sink->PutInt(cache_index, "startup_object_cache_index");
+  sink->PutUint30(cache_index, "startup_object_cache_index");
 }
 
 void StartupSerializer::CheckNoDirtyFinalizationRegistries() {
   Isolate* isolate = this->isolate();
-  CHECK(isolate->heap()->dirty_js_finalization_registries_list().IsUndefined(
-      isolate));
-  CHECK(
-      isolate->heap()->dirty_js_finalization_registries_list_tail().IsUndefined(
-          isolate));
+  CHECK(IsUndefined(isolate->heap()->dirty_js_finalization_registries_list(),
+                    isolate));
+  CHECK(IsUndefined(
+      isolate->heap()->dirty_js_finalization_registries_list_tail(), isolate));
 }
 
-void SerializedHandleChecker::AddToSet(FixedArray serialized) {
-  int length = serialized.length();
-  for (int i = 0; i < length; i++) serialized_.insert(serialized.get(i));
+void SerializedHandleChecker::AddToSet(Tagged<FixedArray> serialized) {
+  int length = serialized->length();
+  for (int i = 0; i < length; i++) serialized_.insert(serialized->get(i));
 }
 
 void SerializedHandleChecker::VisitRootPointers(Root root,
@@ -228,7 +209,7 @@ void SerializedHandleChecker::VisitRootPointers(Root root,
     if (serialized_.find(*p) != serialized_.end()) continue;
     PrintF("%s handle not serialized: ",
            root == Root::kGlobalHandles ? "global" : "eternal");
-    (*p).Print();
+    Print(*p);
     PrintF("\n");
     ok_ = false;
   }
diff --git a/deps/v8/src/snapshot/startup-serializer.h b/deps/v8/src/snapshot/startup-serializer.h
index 0dadfc8fcf7933..e16465d82536e6 100644
--- a/deps/v8/src/snapshot/startup-serializer.h
+++ b/deps/v8/src/snapshot/startup-serializer.h
@@ -15,13 +15,11 @@ namespace internal {
 
 class HeapObject;
 class SnapshotByteSink;
-class ReadOnlySerializer;
 class SharedHeapSerializer;
 
 class V8_EXPORT_PRIVATE StartupSerializer : public RootsSerializer {
  public:
   StartupSerializer(Isolate* isolate, Snapshot::SerializerFlags flags,
-                    ReadOnlySerializer* read_only_serializer,
                     SharedHeapSerializer* shared_heap_serializer);
   ~StartupSerializer() override;
   StartupSerializer(const StartupSerializer&) = delete;
@@ -35,13 +33,6 @@ class V8_EXPORT_PRIVATE StartupSerializer : public RootsSerializer {
   void SerializeStrongReferences(const DisallowGarbageCollection& no_gc);
   void SerializeWeakReferencesAndDeferred();
 
-  // If |obj| can be serialized in the read-only snapshot then add it to the
-  // read-only object cache if not already present and emits a
-  // ReadOnlyObjectCache bytecode into |sink|. Returns whether this was
-  // successful.
-  bool SerializeUsingReadOnlyObjectCache(SnapshotByteSink* sink,
-                                         Handle<HeapObject> obj);
-
   // If |obj| can be serialized in the shared heap snapshot then add it to the
   // shareable object cache if not already present and emits a
   // SharedHeapObjectCache bytecode into |sink|. Returns whether this was
@@ -59,9 +50,8 @@ class V8_EXPORT_PRIVATE StartupSerializer : public RootsSerializer {
   void CheckNoDirtyFinalizationRegistries();
 
  private:
-  void SerializeObjectImpl(Handle<HeapObject> o) override;
+  void SerializeObjectImpl(Handle<HeapObject> o, SlotType slot_type) override;
 
-  ReadOnlySerializer* const read_only_serializer_;
   SharedHeapSerializer* const shared_heap_serializer_;
   GlobalHandleVector<AccessorInfo> accessor_infos_;
   GlobalHandleVector<CallHandlerInfo> call_handler_infos_;
@@ -75,7 +65,7 @@ class SerializedHandleChecker : public RootVisitor {
   bool CheckGlobalAndEternalHandles();
 
  private:
-  void AddToSet(FixedArray serialized);
+  void AddToSet(Tagged<FixedArray> serialized);
 
   Isolate* isolate_;
   std::unordered_set<Object, Object::Hasher> serialized_;
diff --git a/deps/v8/src/snapshot/static-roots-gen.cc b/deps/v8/src/snapshot/static-roots-gen.cc
index 33614c6401b960..af64831a7f515f 100644
--- a/deps/v8/src/snapshot/static-roots-gen.cc
+++ b/deps/v8/src/snapshot/static-roots-gen.cc
@@ -54,6 +54,7 @@ void StaticRootsTableGen::write(Isolate* isolate, const char* file) {
   CHECK_WITH_MSG(!V8_STATIC_ROOTS_BOOL,
                  "Re-generating the table of roots is only supported in builds "
                  "with v8_enable_static_roots disabled");
+  CHECK(V8_STATIC_ROOTS_GENERATION_BOOL);
   CHECK(file);
   static_assert(static_cast<int>(RootIndex::kFirstReadOnlyRoot) == 0);
 
@@ -74,7 +75,6 @@ void StaticRootsTableGen::write(Isolate* isolate, const char* file) {
       << "\n"
       << "#if V8_STATIC_ROOTS_BOOL\n"
       << "\n"
-      << "#include \"src/objects/instance-type.h\"\n"
       << "#include \"src/roots/roots.h\"\n"
       << "\n"
       << "// Disabling Wasm or Intl invalidates the contents of "
diff --git a/deps/v8/src/strings/string-builder-inl.h b/deps/v8/src/strings/string-builder-inl.h
index 0170415833673f..66f665b0a02d8b 100644
--- a/deps/v8/src/strings/string-builder-inl.h
+++ b/deps/v8/src/strings/string-builder-inl.h
@@ -26,13 +26,15 @@ using StringBuilderSubstringPosition =
                    kStringBuilderConcatHelperPositionBits>;
 
 template <typename sinkchar>
-void StringBuilderConcatHelper(String special, sinkchar* sink,
-                               FixedArray fixed_array, int array_length);
+void StringBuilderConcatHelper(Tagged<String> special, sinkchar* sink,
+                               Tagged<FixedArray> fixed_array,
+                               int array_length);
 
 // Returns the result length of the concatenation.
 // On illegal argument, -1 is returned.
-int StringBuilderConcatLength(int special_length, FixedArray fixed_array,
-                              int array_length, bool* one_byte);
+int StringBuilderConcatLength(int special_length,
+                              Tagged<FixedArray> fixed_array, int array_length,
+                              bool* one_byte);
 
 class FixedArrayBuilder {
  public:
@@ -46,8 +48,8 @@ class FixedArrayBuilder {
   bool HasCapacity(int elements);
   void EnsureCapacity(Isolate* isolate, int elements);
 
-  void Add(Object value);
-  void Add(Smi value);
+  void Add(Tagged<Object> value);
+  void Add(Tagged<Smi> value);
 
   Handle<FixedArray> array() { return array_; }
 
@@ -142,7 +144,7 @@ class IncrementalStringBuilder {
     if (encoding_ == String::ONE_BYTE_ENCODING && CurrentPartCanFit(N)) {
       const uint8_t* chars = reinterpret_cast<const uint8_t*>(literal);
       SeqOneByteString::cast(*current_part_)
-          .SeqOneByteStringSetChars(current_index_, chars, length);
+          ->SeqOneByteStringSetChars(current_index_, chars, length);
       current_index_ += length;
       if (current_index_ == part_length_) Extend();
       DCHECK(HasValidCurrentIndex());
@@ -151,20 +153,12 @@ class IncrementalStringBuilder {
     return AppendCString(literal);
   }
 
-  V8_INLINE void AppendCString(const char* s) {
-    const uint8_t* u = reinterpret_cast<const uint8_t*>(s);
+  template <typename SrcChar>
+  V8_INLINE void AppendCString(const SrcChar* s) {
     if (encoding_ == String::ONE_BYTE_ENCODING) {
-      while (*u != '\0') Append<uint8_t, uint8_t>(*(u++));
+      while (*s != '\0') Append<SrcChar, uint8_t>(*s++);
     } else {
-      while (*u != '\0') Append<uint8_t, base::uc16>(*(u++));
-    }
-  }
-
-  V8_INLINE void AppendCString(const base::uc16* s) {
-    if (encoding_ == String::ONE_BYTE_ENCODING) {
-      while (*s != '\0') Append<base::uc16, uint8_t>(*(s++));
-    } else {
-      while (*s != '\0') Append<base::uc16, base::uc16>(*(s++));
+      while (*s != '\0') Append<SrcChar, base::uc16>(*s++);
     }
   }
 
@@ -211,15 +205,15 @@ class IncrementalStringBuilder {
   template <typename DestChar>
   class NoExtend {
    public:
-    NoExtend(String string, int offset,
+    NoExtend(Tagged<String> string, int offset,
              const DisallowGarbageCollection& no_gc) {
-      DCHECK(string.IsSeqOneByteString() || string.IsSeqTwoByteString());
+      DCHECK(IsSeqOneByteString(string) || IsSeqTwoByteString(string));
       if (sizeof(DestChar) == 1) {
         start_ = reinterpret_cast<DestChar*>(
-            SeqOneByteString::cast(string).GetChars(no_gc) + offset);
+            SeqOneByteString::cast(string)->GetChars(no_gc) + offset);
       } else {
         start_ = reinterpret_cast<DestChar*>(
-            SeqTwoByteString::cast(string).GetChars(no_gc) + offset);
+            SeqTwoByteString::cast(string)->GetChars(no_gc) + offset);
       }
       cursor_ = start_;
 #ifdef DEBUG
@@ -232,12 +226,12 @@ class IncrementalStringBuilder {
       DestChar* end;
       if (sizeof(DestChar) == 1) {
         auto one_byte_string = SeqOneByteString::cast(string_);
-        end = reinterpret_cast<DestChar*>(one_byte_string.GetChars(no_gc_) +
-                                          one_byte_string.length());
+        end = reinterpret_cast<DestChar*>(one_byte_string->GetChars(no_gc_) +
+                                          one_byte_string->length());
       } else {
         auto two_byte_string = SeqTwoByteString::cast(string_);
-        end = reinterpret_cast<DestChar*>(two_byte_string.GetChars(no_gc_) +
-                                          two_byte_string.length());
+        end = reinterpret_cast<DestChar*>(two_byte_string->GetChars(no_gc_) +
+                                          two_byte_string->length());
       }
       DCHECK_LE(cursor_, end + 1);
     }
@@ -335,11 +329,11 @@ void IncrementalStringBuilder::Append(SrcChar c) {
   if (sizeof(DestChar) == 1) {
     DCHECK_EQ(String::ONE_BYTE_ENCODING, encoding_);
     SeqOneByteString::cast(*current_part_)
-        .SeqOneByteStringSet(current_index_++, c);
+        ->SeqOneByteStringSet(current_index_++, c);
   } else {
     DCHECK_EQ(String::TWO_BYTE_ENCODING, encoding_);
     SeqTwoByteString::cast(*current_part_)
-        .SeqTwoByteStringSet(current_index_++, c);
+        ->SeqTwoByteStringSet(current_index_++, c);
   }
   if (current_index_ == part_length_) Extend();
   DCHECK(HasValidCurrentIndex());
diff --git a/deps/v8/src/strings/string-builder.cc b/deps/v8/src/strings/string-builder.cc
index f6871d9e6aa339..df3c81fe3c9a6c 100644
--- a/deps/v8/src/strings/string-builder.cc
+++ b/deps/v8/src/strings/string-builder.cc
@@ -12,13 +12,14 @@ namespace v8 {
 namespace internal {
 
 template <typename sinkchar>
-void StringBuilderConcatHelper(String special, sinkchar* sink,
-                               FixedArray fixed_array, int array_length) {
+void StringBuilderConcatHelper(Tagged<String> special, sinkchar* sink,
+                               Tagged<FixedArray> fixed_array,
+                               int array_length) {
   DisallowGarbageCollection no_gc;
   int position = 0;
   for (int i = 0; i < array_length; i++) {
-    Object element = fixed_array.get(i);
-    if (element.IsSmi()) {
+    Tagged<Object> element = fixed_array->get(i);
+    if (IsSmi(element)) {
       // Smi encoding of position and length.
       int encoded_slice = Smi::ToInt(element);
       int pos;
@@ -29,39 +30,40 @@ void StringBuilderConcatHelper(String special, sinkchar* sink,
         len = StringBuilderSubstringLength::decode(encoded_slice);
       } else {
         // Position and length encoded in two smis.
-        Object obj = fixed_array.get(++i);
-        DCHECK(obj.IsSmi());
+        Tagged<Object> obj = fixed_array->get(++i);
+        DCHECK(IsSmi(obj));
         pos = Smi::ToInt(obj);
         len = -encoded_slice;
       }
       String::WriteToFlat(special, sink + position, pos, len);
       position += len;
     } else {
-      String string = String::cast(element);
-      int element_length = string.length();
+      Tagged<String> string = String::cast(element);
+      int element_length = string->length();
       String::WriteToFlat(string, sink + position, 0, element_length);
       position += element_length;
     }
   }
 }
 
-template void StringBuilderConcatHelper<uint8_t>(String special, uint8_t* sink,
-                                                 FixedArray fixed_array,
+template void StringBuilderConcatHelper<uint8_t>(Tagged<String> special,
+                                                 uint8_t* sink,
+                                                 Tagged<FixedArray> fixed_array,
                                                  int array_length);
 
-template void StringBuilderConcatHelper<base::uc16>(String special,
-                                                    base::uc16* sink,
-                                                    FixedArray fixed_array,
-                                                    int array_length);
+template void StringBuilderConcatHelper<base::uc16>(
+    Tagged<String> special, base::uc16* sink, Tagged<FixedArray> fixed_array,
+    int array_length);
 
-int StringBuilderConcatLength(int special_length, FixedArray fixed_array,
-                              int array_length, bool* one_byte) {
+int StringBuilderConcatLength(int special_length,
+                              Tagged<FixedArray> fixed_array, int array_length,
+                              bool* one_byte) {
   DisallowGarbageCollection no_gc;
   int position = 0;
   for (int i = 0; i < array_length; i++) {
     int increment = 0;
-    Object elt = fixed_array.get(i);
-    if (elt.IsSmi()) {
+    Tagged<Object> elt = fixed_array->get(i);
+    if (IsSmi(elt)) {
       // Smi encoding of position and length.
       int smi_value = Smi::ToInt(elt);
       int pos;
@@ -76,8 +78,8 @@ int StringBuilderConcatLength(int special_length, FixedArray fixed_array,
         // Get the position and check that it is a positive smi.
         i++;
         if (i >= array_length) return -1;
-        Object next_smi = fixed_array.get(i);
-        if (!next_smi.IsSmi()) return -1;
+        Tagged<Object> next_smi = fixed_array->get(i);
+        if (!IsSmi(next_smi)) return -1;
         pos = Smi::ToInt(next_smi);
         if (pos < 0) return -1;
       }
@@ -85,11 +87,11 @@ int StringBuilderConcatLength(int special_length, FixedArray fixed_array,
       DCHECK_GE(len, 0);
       if (pos > special_length || len > special_length - pos) return -1;
       increment = len;
-    } else if (elt.IsString()) {
-      String element = String::cast(elt);
-      int element_length = element.length();
+    } else if (IsString(elt)) {
+      Tagged<String> element = String::cast(elt);
+      int element_length = element->length();
       increment = element_length;
-      if (*one_byte && !element.IsOneByteRepresentation()) {
+      if (*one_byte && !element->IsOneByteRepresentation()) {
         *one_byte = false;
       }
     } else {
@@ -157,15 +159,15 @@ void FixedArrayBuilder::EnsureCapacity(Isolate* isolate, int elements) {
   }
 }
 
-void FixedArrayBuilder::Add(Object value) {
-  DCHECK(!value.IsSmi());
+void FixedArrayBuilder::Add(Tagged<Object> value) {
+  DCHECK(!IsSmi(value));
   array_->set(length_, value);
   length_++;
   has_non_smi_elements_ = true;
 }
 
-void FixedArrayBuilder::Add(Smi value) {
-  DCHECK(value.IsSmi());
+void FixedArrayBuilder::Add(Tagged<Smi> value) {
+  DCHECK(IsSmi(value));
   array_->set(length_, value);
   length_++;
 }
@@ -234,7 +236,7 @@ MaybeHandle<String> ReplacementStringBuilder::ToString() {
 }
 
 void ReplacementStringBuilder::AddElement(Handle<Object> element) {
-  DCHECK(element->IsSmi() || element->IsString());
+  DCHECK(IsSmi(*element) || IsString(*element));
   EnsureCapacity(1);
   DisallowGarbageCollection no_gc;
   array_builder_.Add(*element);
@@ -297,6 +299,9 @@ MaybeHandle<String> IncrementalStringBuilder::Finish() {
   if (overflowed_) {
     THROW_NEW_ERROR(isolate_, NewInvalidStringLengthError(), String);
   }
+  if (isolate()->serializer_enabled()) {
+    return factory()->InternalizeString(accumulator());
+  }
   return accumulator();
 }
 
@@ -305,24 +310,31 @@ MaybeHandle<String> IncrementalStringBuilder::Finish() {
 // the incoming string to have one byte representation "underneath" (The
 // one byte check requires the string to be flat).
 bool IncrementalStringBuilder::CanAppendByCopy(Handle<String> string) {
-  constexpr int kMaxStringLengthForCopy = 16;
   const bool representation_ok =
       encoding_ == String::TWO_BYTE_ENCODING ||
       (string->IsFlat() && String::IsOneByteRepresentationUnderneath(*string));
 
-  return representation_ok && string->length() <= kMaxStringLengthForCopy &&
-         CurrentPartCanFit(string->length());
+  return representation_ok && CurrentPartCanFit(string->length());
 }
 
 void IncrementalStringBuilder::AppendStringByCopy(Handle<String> string) {
   DCHECK(CanAppendByCopy(string));
 
-  Handle<SeqOneByteString> part =
-      Handle<SeqOneByteString>::cast(current_part());
   {
     DisallowGarbageCollection no_gc;
-    String::WriteToFlat(*string, part->GetChars(no_gc) + current_index_, 0,
-                        string->length());
+    if (encoding_ == String::ONE_BYTE_ENCODING) {
+      String::WriteToFlat(
+          *string,
+          Handle<SeqOneByteString>::cast(current_part())->GetChars(no_gc) +
+              current_index_,
+          0, string->length());
+    } else {
+      String::WriteToFlat(
+          *string,
+          Handle<SeqTwoByteString>::cast(current_part())->GetChars(no_gc) +
+              current_index_,
+          0, string->length());
+    }
   }
   current_index_ += string->length();
   DCHECK(current_index_ <= part_length_);
diff --git a/deps/v8/src/strings/string-search.h b/deps/v8/src/strings/string-search.h
index 529501dd31dc63..01326900990fc3 100644
--- a/deps/v8/src/strings/string-search.h
+++ b/deps/v8/src/strings/string-search.h
@@ -8,6 +8,7 @@
 #include "src/base/strings.h"
 #include "src/base/vector.h"
 #include "src/execution/isolate.h"
+#include "src/objects/string.h"
 
 namespace v8 {
 namespace internal {
diff --git a/deps/v8/src/strings/string-stream.cc b/deps/v8/src/strings/string-stream.cc
index 2c96c7cf99a89a..5618edfcdfdf96 100644
--- a/deps/v8/src/strings/string-stream.cc
+++ b/deps/v8/src/strings/string-stream.cc
@@ -127,7 +127,7 @@ void StringStream::Add(base::Vector<const char> format,
       }
       case 'o': {
         DCHECK_EQ(FmtElm::OBJ, current.type_);
-        Object obj(current.data_.u_obj_);
+        Tagged<Object> obj(current.data_.u_obj_);
         PrintObject(obj);
         break;
       }
@@ -191,16 +191,16 @@ void StringStream::Add(base::Vector<const char> format,
   DCHECK_EQ(buffer_[length_], '\0');
 }
 
-void StringStream::PrintObject(Object o) {
-  o.ShortPrint(this);
-  if (o.IsString()) {
-    if (String::cast(o).length() <= String::kMaxShortPrintLength) {
+void StringStream::PrintObject(Tagged<Object> o) {
+  ShortPrint(o, this);
+  if (IsString(o)) {
+    if (String::cast(o)->length() <= String::kMaxShortPrintLength) {
       return;
     }
-  } else if (o.IsNumber() || o.IsOddball()) {
+  } else if (IsNumber(o) || IsOddball(o)) {
     return;
   }
-  if (o.IsHeapObject() && object_print_mode_ == kPrintObjectVerbose) {
+  if (IsHeapObject(o) && object_print_mode_ == kPrintObjectVerbose) {
     // TODO(delphick): Consider whether we can get the isolate without using
     // TLS.
     Isolate* isolate = Isolate::Current();
@@ -268,9 +268,11 @@ bool StringStream::IsMentionedObjectCacheClear(Isolate* isolate) {
 }
 #endif
 
-bool StringStream::Put(String str) { return Put(str, 0, str.length()); }
+bool StringStream::Put(Tagged<String> str) {
+  return Put(str, 0, str->length());
+}
 
-bool StringStream::Put(String str, int start, int end) {
+bool StringStream::Put(Tagged<String> str, int start, int end) {
   StringCharacterStream stream(str, start);
   for (int i = start; i < end && stream.HasMore(); i++) {
     uint16_t c = stream.GetNext();
@@ -284,10 +286,10 @@ bool StringStream::Put(String str, int start, int end) {
   return true;
 }
 
-void StringStream::PrintName(Object name) {
-  if (name.IsString()) {
-    String str = String::cast(name);
-    if (str.length() > 0) {
+void StringStream::PrintName(Tagged<Object> name) {
+  if (IsString(name)) {
+    Tagged<String> str = String::cast(name);
+    if (str->length() > 0) {
       Put(str);
     } else {
       Add("/* anonymous */");
@@ -297,53 +299,55 @@ void StringStream::PrintName(Object name) {
   }
 }
 
-void StringStream::PrintUsingMap(JSObject js_object) {
-  Map map = js_object.map();
-  DescriptorArray descs = map.instance_descriptors(js_object.GetIsolate());
-  for (InternalIndex i : map.IterateOwnDescriptors()) {
-    PropertyDetails details = descs.GetDetails(i);
+void StringStream::PrintUsingMap(Tagged<JSObject> js_object) {
+  Tagged<Map> map = js_object->map();
+  Tagged<DescriptorArray> descs =
+      map->instance_descriptors(js_object->GetIsolate());
+  for (InternalIndex i : map->IterateOwnDescriptors()) {
+    PropertyDetails details = descs->GetDetails(i);
     if (details.location() == PropertyLocation::kField) {
       DCHECK_EQ(PropertyKind::kData, details.kind());
-      Object key = descs.GetKey(i);
-      if (key.IsString() || key.IsNumber()) {
+      Tagged<Object> key = descs->GetKey(i);
+      if (IsString(key) || IsNumber(key)) {
         int len = 3;
-        if (key.IsString()) {
-          len = String::cast(key).length();
+        if (IsString(key)) {
+          len = String::cast(key)->length();
         }
         for (; len < 18; len++) Put(' ');
-        if (key.IsString()) {
+        if (IsString(key)) {
           Put(String::cast(key));
         } else {
-          key.ShortPrint();
+          ShortPrint(key);
         }
         Add(": ");
         FieldIndex index = FieldIndex::ForDescriptor(map, i);
-        Object value = js_object.RawFastPropertyAt(index);
+        Tagged<Object> value = js_object->RawFastPropertyAt(index);
         Add("%o\n", value);
       }
     }
   }
 }
 
-void StringStream::PrintFixedArray(FixedArray array, unsigned int limit) {
-  ReadOnlyRoots roots = array.GetReadOnlyRoots();
+void StringStream::PrintFixedArray(Tagged<FixedArray> array,
+                                   unsigned int limit) {
+  ReadOnlyRoots roots = array->GetReadOnlyRoots();
   for (unsigned int i = 0; i < 10 && i < limit; i++) {
-    Object element = array.get(i);
-    if (element.IsTheHole(roots)) continue;
+    Tagged<Object> element = array->get(i);
+    if (IsTheHole(element, roots)) continue;
     for (int len = 1; len < 18; len++) {
       Put(' ');
     }
-    Add("%d: %o\n", i, array.get(i));
+    Add("%d: %o\n", i, array->get(i));
   }
   if (limit >= 10) {
     Add("                  ...\n");
   }
 }
 
-void StringStream::PrintByteArray(ByteArray byte_array) {
-  unsigned int limit = byte_array.length();
+void StringStream::PrintByteArray(Tagged<ByteArray> byte_array) {
+  unsigned int limit = byte_array->length();
   for (unsigned int i = 0; i < 10 && i < limit; i++) {
-    byte b = byte_array.get(i);
+    uint8_t b = byte_array->get(i);
     Add("             %d: %3d 0x%02x", i, b, b);
     if (b >= ' ' && b <= '~') {
       Add(" '%c'", b);
@@ -367,39 +371,39 @@ void StringStream::PrintMentionedObjectCache(Isolate* isolate) {
       isolate->string_stream_debug_object_cache();
   Add("-- ObjectCacheKey --\n\n");
   for (size_t i = 0; i < debug_object_cache->size(); i++) {
-    HeapObject printee = *(*debug_object_cache)[i];
+    Tagged<HeapObject> printee = *(*debug_object_cache)[i];
     Add(" #%d# %p: ", static_cast<int>(i),
         reinterpret_cast<void*>(printee.ptr()));
-    printee.ShortPrint(this);
+    ShortPrint(printee, this);
     Add("\n");
-    if (printee.IsJSObject()) {
-      if (printee.IsJSPrimitiveWrapper()) {
+    if (IsJSObject(printee)) {
+      if (IsJSPrimitiveWrapper(printee)) {
         Add("           value(): %o\n",
-            JSPrimitiveWrapper::cast(printee).value());
+            JSPrimitiveWrapper::cast(printee)->value());
       }
       PrintUsingMap(JSObject::cast(printee));
-      if (printee.IsJSArray()) {
-        JSArray array = JSArray::cast(printee);
-        if (array.HasObjectElements()) {
-          unsigned int limit = FixedArray::cast(array.elements()).length();
-          unsigned int length =
-              static_cast<uint32_t>(JSArray::cast(array).length().Number());
+      if (IsJSArray(printee)) {
+        Tagged<JSArray> array = JSArray::cast(printee);
+        if (array->HasObjectElements()) {
+          unsigned int limit = FixedArray::cast(array->elements())->length();
+          unsigned int length = static_cast<uint32_t>(
+              Object::Number(JSArray::cast(array)->length()));
           if (length < limit) limit = length;
-          PrintFixedArray(FixedArray::cast(array.elements()), limit);
+          PrintFixedArray(FixedArray::cast(array->elements()), limit);
         }
       }
-    } else if (printee.IsByteArray()) {
+    } else if (IsByteArray(printee)) {
       PrintByteArray(ByteArray::cast(printee));
-    } else if (printee.IsFixedArray()) {
-      unsigned int limit = FixedArray::cast(printee).length();
+    } else if (IsFixedArray(printee)) {
+      unsigned int limit = FixedArray::cast(printee)->length();
       PrintFixedArray(FixedArray::cast(printee), limit);
     }
   }
 }
 
-void StringStream::PrintSecurityTokenIfChanged(JSFunction fun) {
-  Object token = fun.native_context().security_token();
-  Isolate* isolate = fun.GetIsolate();
+void StringStream::PrintSecurityTokenIfChanged(Tagged<JSFunction> fun) {
+  Tagged<Object> token = fun->native_context()->security_token();
+  Isolate* isolate = fun->GetIsolate();
   // Use SafeEquals because the cached token might be a stale pointer.
   if (token.SafeEquals(isolate->string_stream_current_security_token())) {
     Add("Security context: %o\n", token);
@@ -407,33 +411,36 @@ void StringStream::PrintSecurityTokenIfChanged(JSFunction fun) {
   }
 }
 
-void StringStream::PrintFunction(JSFunction fun, Object receiver) {
+void StringStream::PrintFunction(Tagged<JSFunction> fun,
+                                 Tagged<Object> receiver) {
   PrintPrototype(fun, receiver);
 }
 
-void StringStream::PrintPrototype(JSFunction fun, Object receiver) {
-  Object name = fun.shared().Name();
+void StringStream::PrintPrototype(Tagged<JSFunction> fun,
+                                  Tagged<Object> receiver) {
+  Tagged<Object> name = fun->shared()->Name();
   bool print_name = false;
-  Isolate* isolate = fun.GetIsolate();
-  if (receiver.IsNullOrUndefined(isolate) || receiver.IsTheHole(isolate) ||
-      receiver.IsJSProxy()) {
+  Isolate* isolate = fun->GetIsolate();
+  if (IsNullOrUndefined(receiver, isolate) || IsTheHole(receiver, isolate) ||
+      IsJSProxy(receiver)) {
     print_name = true;
   } else if (!isolate->context().is_null()) {
-    if (!receiver.IsJSObject()) {
-      receiver = receiver.GetPrototypeChainRootMap(isolate).prototype();
+    if (!IsJSObject(receiver)) {
+      receiver =
+          Object::GetPrototypeChainRootMap(receiver, isolate)->prototype();
     }
 
     for (PrototypeIterator iter(isolate, JSObject::cast(receiver),
                                 kStartAtReceiver);
          !iter.IsAtEnd(); iter.Advance()) {
-      if (iter.GetCurrent().IsJSProxy()) break;
-      Object key = iter.GetCurrent<JSObject>().SlowReverseLookup(fun);
-      if (!key.IsUndefined(isolate)) {
-        if (!name.IsString() || !key.IsString() ||
-            !String::cast(name).Equals(String::cast(key))) {
+      if (IsJSProxy(iter.GetCurrent())) break;
+      Tagged<Object> key = iter.GetCurrent<JSObject>()->SlowReverseLookup(fun);
+      if (!IsUndefined(key, isolate)) {
+        if (!IsString(name) || !IsString(key) ||
+            !String::cast(name)->Equals(String::cast(key))) {
           print_name = true;
         }
-        if (name.IsString() && String::cast(name).length() == 0) {
+        if (IsString(name) && String::cast(name)->length() == 0) {
           print_name = false;
         }
         name = key;
@@ -446,7 +453,7 @@ void StringStream::PrintPrototype(JSFunction fun, Object receiver) {
   // which it was looked up.
   if (print_name) {
     Add("(aka ");
-    PrintName(fun.shared().Name());
+    PrintName(fun->shared()->Name());
     Put(')');
   }
 }
diff --git a/deps/v8/src/strings/string-stream.h b/deps/v8/src/strings/string-stream.h
index 37ea91ec6cec81..357241a47c7640 100644
--- a/deps/v8/src/strings/string-stream.h
+++ b/deps/v8/src/strings/string-stream.h
@@ -11,7 +11,8 @@
 #include "src/base/strings.h"
 #include "src/base/vector.h"
 #include "src/handles/handles.h"
-#include "src/objects/heap-object.h"
+#include "src/objects/objects.h"
+#include "src/objects/tagged.h"
 #include "src/utils/allocation.h"
 
 namespace v8 {
@@ -103,10 +104,12 @@ class StringStream final {
         : FmtElm(LC_STR) {
       data_.u_lc_str_ = &value;
     }
-    FmtElm(Object value) : FmtElm(OBJ) {  // NOLINT
+    template <typename T>
+    FmtElm(Tagged<T> value) : FmtElm(OBJ) {  // NOLINT
       data_.u_obj_ = value.ptr();
     }
-    FmtElm(Handle<Object> value) : FmtElm(HANDLE) {  // NOLINT
+    template <typename T>
+    FmtElm(Handle<T> value) : FmtElm(HANDLE) {  // NOLINT
       data_.u_handle_ = value.location();
     }
     FmtElm(void* value) : FmtElm(POINTER) {  // NOLINT
@@ -148,8 +151,8 @@ class StringStream final {
   }
 
   bool Put(char c);
-  bool Put(String str);
-  bool Put(String str, int start, int end);
+  bool Put(Tagged<String> str);
+  bool Put(Tagged<String> str, int start, int end);
   void Add(const char* format) { Add(base::CStrVector(format)); }
   void Add(base::Vector<const char> format) {
     Add(format, base::Vector<FmtElm>());
@@ -175,13 +178,13 @@ class StringStream final {
   int length() const { return length_; }
 
   // Object printing support.
-  void PrintName(Object o);
-  void PrintFixedArray(FixedArray array, unsigned int limit);
-  void PrintByteArray(ByteArray ba);
-  void PrintUsingMap(JSObject js_object);
-  void PrintPrototype(JSFunction fun, Object receiver);
-  void PrintSecurityTokenIfChanged(JSFunction function);
-  void PrintFunction(JSFunction function, Object receiver);
+  void PrintName(Tagged<Object> o);
+  void PrintFixedArray(Tagged<FixedArray> array, unsigned int limit);
+  void PrintByteArray(Tagged<ByteArray> ba);
+  void PrintUsingMap(Tagged<JSObject> js_object);
+  void PrintPrototype(Tagged<JSFunction> fun, Tagged<Object> receiver);
+  void PrintSecurityTokenIfChanged(Tagged<JSFunction> function);
+  void PrintFunction(Tagged<JSFunction> function, Tagged<Object> receiver);
 
   // Reset the stream.
   void Reset() {
@@ -200,7 +203,7 @@ class StringStream final {
 
  private:
   void Add(base::Vector<const char> format, base::Vector<FmtElm> elms);
-  void PrintObject(Object obj);
+  void PrintObject(Tagged<Object> obj);
 
   StringAllocator* allocator_;
   ObjectPrintMode object_print_mode_;
diff --git a/deps/v8/src/strings/unicode-decoder.cc b/deps/v8/src/strings/unicode-decoder.cc
index ba257b6b30b7e8..86c0433be177b8 100644
--- a/deps/v8/src/strings/unicode-decoder.cc
+++ b/deps/v8/src/strings/unicode-decoder.cc
@@ -57,8 +57,7 @@ struct DecoderTraits<StrictUtf8Decoder> {
 }  // namespace
 
 template <class Decoder>
-Utf8DecoderBase<Decoder>::Utf8DecoderBase(
-    const base::Vector<const uint8_t>& data)
+Utf8DecoderBase<Decoder>::Utf8DecoderBase(base::Vector<const uint8_t> data)
     : encoding_(Encoding::kAscii),
       non_ascii_start_(NonAsciiStart(data.begin(), data.length())),
       utf16_length_(non_ascii_start_) {
@@ -129,7 +128,7 @@ Utf8DecoderBase<Decoder>::Utf8DecoderBase(
 template <class Decoder>
 template <typename Char>
 void Utf8DecoderBase<Decoder>::Decode(Char* out,
-                                      const base::Vector<const uint8_t>& data) {
+                                      base::Vector<const uint8_t> data) {
   using Traits = DecoderTraits<Decoder>;
   DCHECK(!is_invalid());
   CopyChars(out, data.begin(), non_ascii_start_);
@@ -183,11 +182,11 @@ void Utf8DecoderBase<Decoder>::Decode(Char* out,
 
 #define DEFINE_UNICODE_DECODER(Decoder)                                 \
   template V8_EXPORT_PRIVATE Utf8DecoderBase<Decoder>::Utf8DecoderBase( \
-      const base::Vector<const uint8_t>& data);                         \
+      base::Vector<const uint8_t> data);                                \
   template V8_EXPORT_PRIVATE void Utf8DecoderBase<Decoder>::Decode(     \
-      uint8_t* out, const base::Vector<const uint8_t>& data);           \
+      uint8_t* out, base::Vector<const uint8_t> data);                  \
   template V8_EXPORT_PRIVATE void Utf8DecoderBase<Decoder>::Decode(     \
-      uint16_t* out, const base::Vector<const uint8_t>& data)
+      uint16_t* out, base::Vector<const uint8_t> data)
 
 DEFINE_UNICODE_DECODER(Utf8Decoder);
 
diff --git a/deps/v8/src/strings/unicode-decoder.h b/deps/v8/src/strings/unicode-decoder.h
index 7683b0b959e6b8..646120a94a1dc4 100644
--- a/deps/v8/src/strings/unicode-decoder.h
+++ b/deps/v8/src/strings/unicode-decoder.h
@@ -68,10 +68,10 @@ class Utf8DecoderBase {
   }
 
   template <typename Char>
-  void Decode(Char* out, const base::Vector<const uint8_t>& data);
+  void Decode(Char* out, base::Vector<const uint8_t> data);
 
  protected:
-  explicit Utf8DecoderBase(const base::Vector<const uint8_t>& data);
+  explicit Utf8DecoderBase(base::Vector<const uint8_t> data);
   Encoding encoding_;
   int non_ascii_start_;
   int utf16_length_;
@@ -80,7 +80,7 @@ class Utf8DecoderBase {
 class V8_EXPORT_PRIVATE Utf8Decoder final
     : public Utf8DecoderBase<Utf8Decoder> {
  public:
-  explicit Utf8Decoder(const base::Vector<const uint8_t>& data)
+  explicit Utf8Decoder(base::Vector<const uint8_t> data)
       : Utf8DecoderBase(data) {}
 
   // This decoder never fails; an invalid byte sequence decodes to U+FFFD and
@@ -97,7 +97,7 @@ class V8_EXPORT_PRIVATE Utf8Decoder final
 // isolated surrogates.
 class Wtf8Decoder : public Utf8DecoderBase<Wtf8Decoder> {
  public:
-  explicit Wtf8Decoder(const base::Vector<const uint8_t>& data)
+  explicit Wtf8Decoder(base::Vector<const uint8_t> data)
       : Utf8DecoderBase(data) {}
 
   bool is_invalid() const { return encoding_ == Encoding::kInvalid; }
@@ -107,7 +107,7 @@ class Wtf8Decoder : public Utf8DecoderBase<Wtf8Decoder> {
 // with U+FFFD, we have a separate Encoding::kInvalid state.
 class StrictUtf8Decoder : public Utf8DecoderBase<StrictUtf8Decoder> {
  public:
-  explicit StrictUtf8Decoder(const base::Vector<const uint8_t>& data)
+  explicit StrictUtf8Decoder(base::Vector<const uint8_t> data)
       : Utf8DecoderBase(data) {}
 
   bool is_invalid() const { return encoding_ == Encoding::kInvalid; }
diff --git a/deps/v8/src/strings/unicode-inl.h b/deps/v8/src/strings/unicode-inl.h
index 0539f7626417dc..e08ef94398d965 100644
--- a/deps/v8/src/strings/unicode-inl.h
+++ b/deps/v8/src/strings/unicode-inl.h
@@ -81,11 +81,11 @@ bool Utf16::HasUnpairedSurrogate(const uint16_t* code_units, size_t length) {
 // Decodes UTF-8 bytes incrementally, allowing the decoding of bytes as they
 // stream in. This **must** be followed by a call to ValueOfIncrementalFinish
 // when the stream is complete, to ensure incomplete sequences are handled.
-uchar Utf8::ValueOfIncremental(const byte** cursor, State* state,
+uchar Utf8::ValueOfIncremental(const uint8_t** cursor, State* state,
                                Utf8IncrementalBuffer* buffer) {
   DCHECK_NOT_NULL(buffer);
   State old_state = *state;
-  byte next = **cursor;
+  uint8_t next = **cursor;
   *cursor += 1;
 
   if (V8_LIKELY(next <= kMaxOneByteChar && old_state == State::kAccept)) {
@@ -175,9 +175,9 @@ unsigned Utf8::Encode(char* str, uchar c, int previous, bool replace_invalid) {
   }
 }
 
-uchar Utf8::ValueOf(const byte* bytes, size_t length, size_t* cursor) {
+uchar Utf8::ValueOf(const uint8_t* bytes, size_t length, size_t* cursor) {
   if (length <= 0) return kBadChar;
-  byte first = bytes[0];
+  uint8_t first = bytes[0];
   // Characters between 0000 and 007F are encoded as a single character
   if (V8_LIKELY(first <= kMaxOneByteChar)) {
     *cursor += 1;
diff --git a/deps/v8/src/strings/unicode.cc b/deps/v8/src/strings/unicode.cc
index d98d946f1690c5..837ca0fdbbf636 100644
--- a/deps/v8/src/strings/unicode.cc
+++ b/deps/v8/src/strings/unicode.cc
@@ -199,7 +199,8 @@ static int LookupMapping(const int32_t* table, uint16_t size,
 
 // This method decodes an UTF-8 value according to RFC 3629 and
 // https://encoding.spec.whatwg.org/#utf-8-decoder .
-uchar Utf8::CalculateValue(const byte* str, size_t max_length, size_t* cursor) {
+uchar Utf8::CalculateValue(const uint8_t* str, size_t max_length,
+                           size_t* cursor) {
   DCHECK_GT(max_length, 0);
   DCHECK_GT(str[0], kMaxOneByteChar);
 
@@ -207,8 +208,8 @@ uchar Utf8::CalculateValue(const byte* str, size_t max_length, size_t* cursor) {
   Utf8IncrementalBuffer buffer = 0;
   uchar t;
 
-  const byte* start = str;
-  const byte* end = str + max_length;
+  const uint8_t* start = str;
+  const uint8_t* end = str + max_length;
 
   do {
     t = ValueOfIncremental(&str, &state, &buffer);
@@ -230,7 +231,7 @@ uchar Utf8::ValueOfIncrementalFinish(State* state) {
   }
 }
 
-bool Utf8::ValidateEncoding(const byte* bytes, size_t length) {
+bool Utf8::ValidateEncoding(const uint8_t* bytes, size_t length) {
   State state = State::kAccept;
   Utf8IncrementalBuffer throw_away = 0;
   for (size_t i = 0; i < length && state != State::kReject; i++) {
@@ -271,7 +272,7 @@ void Utf16::ReplaceUnpairedSurrogates(const uint16_t* source_code_units,
 }
 
 #if V8_ENABLE_WEBASSEMBLY
-bool Wtf8::ValidateEncoding(const byte* bytes, size_t length) {
+bool Wtf8::ValidateEncoding(const uint8_t* bytes, size_t length) {
   using State = GeneralizedUtf8DfaDecoder::State;
   auto state = State::kAccept;
   uint32_t current = 0;
@@ -292,7 +293,7 @@ bool Wtf8::ValidateEncoding(const byte* bytes, size_t length) {
 }
 
 // Precondition: valid WTF-8.
-void Wtf8::ScanForSurrogates(const v8::base::Vector<const byte>& wtf8,
+void Wtf8::ScanForSurrogates(v8::base::Vector<const uint8_t> wtf8,
                              std::vector<size_t>* surrogate_offsets) {
   // A surrogate codepoint is encoded in a three-byte sequence:
   //
@@ -303,8 +304,8 @@ void Wtf8::ScanForSurrogates(const v8::base::Vector<const byte>& wtf8,
   // three-byte non-surrogates starting with 0xED whose second byte is in
   // [0x80,0x9F].)  Could speed this up with SWAR; most likely case is that no
   // byte in the array is 0xED.
-  const byte kWtf8SurrogateFirstByte = 0xED;
-  const byte kWtf8SurrogateSecondByteHighBit = 0x20;
+  const uint8_t kWtf8SurrogateFirstByte = 0xED;
+  const uint8_t kWtf8SurrogateSecondByteHighBit = 0x20;
 
   for (size_t i = 0; i < wtf8.size(); i++) {
     if (wtf8[i] == kWtf8SurrogateFirstByte &&
diff --git a/deps/v8/src/strings/unicode.h b/deps/v8/src/strings/unicode.h
index 01349c70be8669..6449d68c61328e 100644
--- a/deps/v8/src/strings/unicode.h
+++ b/deps/v8/src/strings/unicode.h
@@ -19,7 +19,6 @@
 namespace unibrow {
 
 using uchar = unsigned int;
-using byte = unsigned char;
 
 /**
  * The max length of the result of converting the case of a single
@@ -181,7 +180,8 @@ class V8_EXPORT_PRIVATE Utf8 {
   static inline unsigned EncodeOneByte(char* out, uint8_t c);
   static inline unsigned Encode(char* out, uchar c, int previous,
                                 bool replace_invalid = false);
-  static uchar CalculateValue(const byte* str, size_t length, size_t* cursor);
+  static uchar CalculateValue(const uint8_t* str, size_t length,
+                              size_t* cursor);
 
   // The unicode replacement character, used to signal invalid unicode
   // sequences (e.g. an orphan surrogate) when converting to a UTF-8 encoding.
@@ -204,10 +204,11 @@ class V8_EXPORT_PRIVATE Utf8 {
   // The maximum size a single UTF-16 code unit known to be in the range
   // [0,0xff] may take up when encoded as UTF-8.
   static const unsigned kMax8BitCodeUnitSize = 2;
-  static inline uchar ValueOf(const byte* str, size_t length, size_t* cursor);
+  static inline uchar ValueOf(const uint8_t* str, size_t length,
+                              size_t* cursor);
 
   using Utf8IncrementalBuffer = uint32_t;
-  static inline uchar ValueOfIncremental(const byte** cursor, State* state,
+  static inline uchar ValueOfIncremental(const uint8_t** cursor, State* state,
                                          Utf8IncrementalBuffer* buffer);
   static uchar ValueOfIncrementalFinish(State* state);
 
@@ -222,7 +223,7 @@ class V8_EXPORT_PRIVATE Utf8 {
   // - valid utf-8 endcoding (e.g. no over-long encodings),
   // - absence of surrogates,
   // - valid code point range.
-  static bool ValidateEncoding(const byte* str, size_t length);
+  static bool ValidateEncoding(const uint8_t* str, size_t length);
 };
 
 #if V8_ENABLE_WEBASSEMBLY
@@ -238,9 +239,9 @@ class V8_EXPORT_PRIVATE Wtf8 {
   // In terms of the WTF-8 specification (https://simonsapin.github.io/wtf-8/),
   // this function checks for a valid "generalized UTF-8" sequence, with the
   // additional constraint that surrogate pairs are not allowed.
-  static bool ValidateEncoding(const byte* str, size_t length);
+  static bool ValidateEncoding(const uint8_t* str, size_t length);
 
-  static void ScanForSurrogates(const v8::base::Vector<const byte>& wtf8,
+  static void ScanForSurrogates(v8::base::Vector<const uint8_t> wtf8,
                                 std::vector<size_t>* surrogate_offsets);
 };
 #endif  // V8_ENABLE_WEBASSEMBLY
diff --git a/deps/v8/src/third_party/utf8-decoder/README.v8 b/deps/v8/src/third_party/utf8-decoder/README.v8
index f9cbff18662a6b..c8fd2ff2945608 100644
--- a/deps/v8/src/third_party/utf8-decoder/README.v8
+++ b/deps/v8/src/third_party/utf8-decoder/README.v8
@@ -3,8 +3,9 @@ Short Name: utf8-decoder
 URL: http://bjoern.hoehrmann.de/utf-8/decoder/dfa/
 Version: 0
 License: MIT
-License File: NOT_SHIPPED
-Security Critical: no
+License File: LICENSE
+Security Critical: yes
+Shipped: yes
 
 Description:
 Decodes UTF-8 bytes using a fast and simple definite finite automata.
diff --git a/deps/v8/src/third_party/vtune/BUILD.gn b/deps/v8/src/third_party/vtune/BUILD.gn
index d763da10646f7d..9d500a5bdb297c 100644
--- a/deps/v8/src/third_party/vtune/BUILD.gn
+++ b/deps/v8/src/third_party/vtune/BUILD.gn
@@ -2,8 +2,7 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-import("//build/toolchain/toolchain.gni")
-
+import("../../../gni/v8.gni")
 config("vtune_ittapi") {
   include_dirs = [
     "//third_party/ittapi/include",
@@ -11,7 +10,7 @@ config("vtune_ittapi") {
   ]
 }
 
-static_library("v8_vtune") {
+v8_source_set("v8_vtune") {
   sources = [
     "//third_party/ittapi/include/jitprofiling.h",
     "//third_party/ittapi/src/ittnotify/ittnotify_config.h",
@@ -21,25 +20,21 @@ static_library("v8_vtune") {
     "vtune-jit.cc",
     "vtune-jit.h",
   ]
-  configs += [ ":vtune_ittapi" ]
-
-  # TODO(delphick): Consider changing these to be v8_source_sets
-  if (!build_with_chromium && is_clang) {
-    configs -= [ "//build/config/clang:find_bad_constructs" ]
-  }
+  configs = [ ":vtune_ittapi" ]
   deps = [ "../../..:v8" ]
 }
 
-static_library("v8_vtune_trace_mark") {
+v8_source_set("v8_vtune_trace_mark") {
   sources = [
     "//third_party/ittapi/include/ittnotify.h",
     "vtuneapi.cc",
     "vtuneapi.h",
   ]
   deps = [ ":ittnotify" ]
+  configs = []
 }
 
-static_library("ittnotify") {
+v8_source_set("ittnotify") {
   sources = [
     "//third_party/ittapi/include/ittnotify.h",
     "//third_party/ittapi/include/legacy/ittnotify.h",
@@ -49,4 +44,5 @@ static_library("ittnotify") {
   ]
   include_dirs = [ "//third_party/ittapi/include" ]
   deps = []
+  configs = []
 }
diff --git a/deps/v8/src/third_party/vtune/vtune-jit.cc b/deps/v8/src/third_party/vtune/vtune-jit.cc
index ee81e8e0dff13f..5389a012a5fe9d 100644
--- a/deps/v8/src/third_party/vtune/vtune-jit.cc
+++ b/deps/v8/src/third_party/vtune/vtune-jit.cc
@@ -141,53 +141,13 @@ static JITCodeLineInfo* UntagLineInfo(void* ptr) {
     reinterpret_cast<intptr_t>(ptr));
 }
 
-// The parameter str is a mixed pattern which contains the
-// function name and some other info. It comes from all the
-// V8FileLogger::CodeCreateEvent(...) function. This function get the
-// pure function name from the input parameter.
-static std::string GetFunctionNameFromMixedName(const char* str, int length) {
-  int index = 0;
-  int count = 0;
-  char* start_ptr = NULL;
-
-  while (str[index++] != ':' && (index < length)) {}
-
-  const char state = str[index];
-  if (state == '*' || state == '+' || state == '-' || state == '~') index++;
-  if (index >= length) return std::string();
-
-  start_ptr = const_cast<char*>(str + index);
-
-  // Detecting JS and WASM function names. In JitCodeEvent->name.str 
-  // JS functions name ends with a space symbol. WASM function name 
-  // ends with the latest closing parenthesis. 
-  char last_char = ' ';
-  int parenthesis_count = 0;
-  while (index < length) {
-    if (str[index] == '(') {
-      last_char = ')';
-      parenthesis_count++;
-    }
-    if (str[index] == ')') parenthesis_count--;
-    if (str[index] == last_char && parenthesis_count == 0) {
-      if (last_char == ')') count++;
-      break;
-    }
-    count++;
-    index++;
-  }
-
-  return std::string(start_ptr, count);
-}
-
 // The JitCodeEventHandler for Vtune.
 void VTUNEJITInterface::event_handler(const v8::JitCodeEvent* event) {
   if (VTUNERUNNING && event != NULL) {
     switch (event->type) {
       case v8::JitCodeEvent::CODE_ADDED: {
         std::unique_ptr<char[]> temp_file_name;
-        std::string temp_method_name = GetFunctionNameFromMixedName(
-            event->name.str, static_cast<int>(event->name.len));
+        std::string temp_method_name(event->name.str, event->name.len);
         std::vector<LineNumberInfo> jmethod_line_number_table;
         iJIT_Method_Load jmethod;
         memset(&jmethod, 0, sizeof jmethod);
@@ -245,15 +205,16 @@ void VTUNEJITInterface::event_handler(const v8::JitCodeEvent* event) {
           temp_file_name[filename_size] = '\0';
           jmethod.source_file_name = temp_file_name.get();
 
-          jmethod.line_number_size = line_number_table_size;
+          jmethod.line_number_size =
+              static_cast<unsigned int>(line_number_table_size);
           jmethod_line_number_table.resize(jmethod.line_number_size);
           jmethod.line_number_table = jmethod_line_number_table.data();
 
           for (size_t index = 0; index < line_number_table_size; ++index) {
             jmethod.line_number_table[index].LineNumber =
-                line_number_table[index].pos;
+                static_cast<unsigned int>(line_number_table[index].pos);
             jmethod.line_number_table[index].Offset =
-                line_number_table[index].offset;
+                static_cast<unsigned int>(line_number_table[index].offset);
           }
         }
 
diff --git a/deps/v8/src/torque/constants.h b/deps/v8/src/torque/constants.h
index c52897f7f44695..ec6125aa70179e 100644
--- a/deps/v8/src/torque/constants.h
+++ b/deps/v8/src/torque/constants.h
@@ -42,6 +42,7 @@ static const char* const UNINITIALIZED_HEAP_OBJECT_TYPE_STRING =
     "UninitializedHeapObject";
 static const char* const RAWPTR_TYPE_STRING = "RawPtr";
 static const char* const EXTERNALPTR_TYPE_STRING = "ExternalPointer";
+static const char* const INDIRECTPTR_TYPE_STRING = "IndirectPointer";
 static const char* const CONST_STRING_TYPE_STRING = "constexpr string";
 static const char* const STRING_TYPE_STRING = "String";
 static const char* const NUMBER_TYPE_STRING = "Number";
diff --git a/deps/v8/src/torque/csa-generator.cc b/deps/v8/src/torque/csa-generator.cc
index c151877d8927d0..d23ee9c3c1e34d 100644
--- a/deps/v8/src/torque/csa-generator.cc
+++ b/deps/v8/src/torque/csa-generator.cc
@@ -544,6 +544,10 @@ void CSAGenerator::EmitInstruction(const CallBuiltinInstruction& instruction,
     std::string lhs_name;
     std::string lhs_type;
     switch (result_types.size()) {
+      case 0:
+        // If a builtin call is annotated to never return, it has 0 return
+        // types (defining true void builtins is not allowed).
+        break;
       case 1:
         lhs_name = result_names[0];
         lhs_type = result_types[0]->GetGeneratedTNodeTypeName();
@@ -567,14 +571,19 @@ void CSAGenerator::EmitInstruction(const CallBuiltinInstruction& instruction,
         PreCallableExceptionPreparation(instruction.catch_block);
     Stack<std::string> pre_call_stack = *stack;
 
-    std::string generated_type = result_types[0]->GetGeneratedTNodeTypeName();
     for (const std::string& name : result_names) {
       stack->Push(name);
     }
-    out() << "    " << lhs_name << " = ";
-    out() << "ca_.CallStub<" << lhs_type
-          << ">(Builtins::CallableFor(ca_.isolate(), Builtin::k"
-          << instruction.builtin->ExternalName() << ")";
+    if (result_types.empty()) {
+      out() << "ca_.CallStubVoid("
+               "Builtins::CallableFor(ca_.isolate(), Builtin::k"
+            << instruction.builtin->ExternalName() << ")";
+    } else {
+      out() << "    " << lhs_name << " = ";
+      out() << "ca_.CallStub<" << lhs_type
+            << ">(Builtins::CallableFor(ca_.isolate(), Builtin::k"
+            << instruction.builtin->ExternalName() << ")";
+    }
     if (!instruction.builtin->signature().HasContextParameter()) {
       // Add dummy context parameter to satisfy the CallBuiltin signature.
       out() << ", TNode<Object>()";
diff --git a/deps/v8/src/torque/global-context.cc b/deps/v8/src/torque/global-context.cc
index f5405d5f4e109f..e7910c80f9524c 100644
--- a/deps/v8/src/torque/global-context.cc
+++ b/deps/v8/src/torque/global-context.cc
@@ -29,7 +29,9 @@ TargetArchitecture::TargetArchitecture(bool force_32bit)
           kSmiTagSize + (force_32bit ? SmiTagging<kApiInt32Size>::kSmiShiftSize
                                      : kSmiShiftSize)),
       external_ptr_size_(force_32bit ? sizeof(int32_t)
-                                     : kExternalPointerSlotSize) {}
+                                     : kExternalPointerSlotSize),
+      indirect_ptr_size_(force_32bit ? sizeof(int32_t)
+                                     : kIndirectPointerSlotSize) {}
 
 }  // namespace torque
 }  // namespace internal
diff --git a/deps/v8/src/torque/global-context.h b/deps/v8/src/torque/global-context.h
index aab4da221a0b4a..012aa4251b8ad3 100644
--- a/deps/v8/src/torque/global-context.h
+++ b/deps/v8/src/torque/global-context.h
@@ -148,6 +148,7 @@ class TargetArchitecture : public base::ContextualClass<TargetArchitecture> {
   static size_t TaggedSize() { return Get().tagged_size_; }
   static size_t RawPtrSize() { return Get().raw_ptr_size_; }
   static size_t ExternalPointerSize() { return Get().external_ptr_size_; }
+  static size_t IndirectPointerSize() { return Get().indirect_ptr_size_; }
   static size_t MaxHeapAlignment() { return TaggedSize(); }
   static bool ArePointersCompressed() { return TaggedSize() < RawPtrSize(); }
   static int SmiTagAndShiftSize() { return Get().smi_tag_and_shift_size_; }
@@ -157,6 +158,7 @@ class TargetArchitecture : public base::ContextualClass<TargetArchitecture> {
   const size_t raw_ptr_size_;
   const int smi_tag_and_shift_size_;
   const size_t external_ptr_size_;
+  const size_t indirect_ptr_size_;
 };
 
 }  // namespace torque
diff --git a/deps/v8/src/torque/implementation-visitor.cc b/deps/v8/src/torque/implementation-visitor.cc
index 2dac36ea73c232..50d7b854bfece4 100644
--- a/deps/v8/src/torque/implementation-visitor.cc
+++ b/deps/v8/src/torque/implementation-visitor.cc
@@ -170,6 +170,7 @@ void ImplementationVisitor::BeginDebugMacrosFile() {
   source << "#include \"torque-generated/debug-macros.h\"\n\n";
   source << "#include \"src/objects/swiss-name-dictionary.h\"\n";
   source << "#include \"src/objects/ordered-hash-table.h\"\n";
+  source << "#include \"src/torque/runtime-support.h\"\n";
   source << "#include \"tools/debug_helper/debug-macro-shims.h\"\n";
   source << "#include \"include/v8-internal.h\"\n";
   source << "\n";
@@ -2832,6 +2833,9 @@ VisitResult ImplementationVisitor::GenerateCall(
     GenerateCatchBlock(catch_block);
     if (is_tailcall) {
       return VisitResult::NeverResult();
+    } else if (return_type->IsNever()) {
+      assembler().Emit(AbortInstruction{AbortInstruction::Kind::kUnreachable});
+      return VisitResult::NeverResult();
     } else {
       size_t slot_count = LoweredSlotCount(return_type);
       if (builtin->IsStub()) {
@@ -3607,10 +3611,13 @@ void ImplementationVisitor::GenerateBuiltinDefinitionsAndInterfaceDescriptors(
           interface_descriptors << "  DEFINE_RESULT_AND_PARAMETER_TYPES(";
           PrintCommaSeparatedList(interface_descriptors, return_types,
                                   MachineTypeString);
+          bool is_first = return_types.empty();
           for (size_t i = kFirstNonContextParameter;
                i < builtin->parameter_names().size(); ++i) {
             const Type* type = builtin->signature().parameter_types.types[i];
-            interface_descriptors << ", " << MachineTypeString(type);
+            interface_descriptors << (is_first ? "" : ", ")
+                                  << MachineTypeString(type);
+            is_first = false;
           }
           interface_descriptors << ")\n";
 
@@ -3866,7 +3873,8 @@ void ImplementationVisitor::GenerateVisitorLists(
 
     header << "#define TORQUE_DATA_ONLY_VISITOR_ID_LIST(V)\\\n";
     for (const ClassType* type : TypeOracle::GetClasses()) {
-      if (type->ShouldGenerateBodyDescriptor() && type->HasNoPointerSlots()) {
+      if (type->ShouldGenerateBodyDescriptor() &&
+          type->HasNoPointerSlotsExceptMap()) {
         header << "V(" << type->name() << ")\\\n";
       }
     }
@@ -3874,7 +3882,8 @@ void ImplementationVisitor::GenerateVisitorLists(
 
     header << "#define TORQUE_POINTER_VISITOR_ID_LIST(V)\\\n";
     for (const ClassType* type : TypeOracle::GetClasses()) {
-      if (type->ShouldGenerateBodyDescriptor() && !type->HasNoPointerSlots()) {
+      if (type->ShouldGenerateBodyDescriptor() &&
+          !type->HasNoPointerSlotsExceptMap()) {
         header << "V(" << type->name() << ")\\\n";
       }
     }
@@ -4069,19 +4078,18 @@ base::Optional<std::vector<Field>> GetOrderedUniqueIndexFields(
 }
 
 void CppClassGenerator::GenerateClass() {
-  // Is<name>_NonInline(HeapObject)
+  // Is<name>_NonInline(Tagged<HeapObject>)
   if (!type_->IsShape()) {
     cpp::Function f("Is"s + name_ + "_NonInline");
-    f.SetDescription("Alias for HeapObject::Is"s + name_ +
-                     "() that avoids inlining.");
+    f.SetDescription("Alias for Is"s + name_ + "() that avoids inlining.");
     f.SetExport(true);
     f.SetReturnType("bool");
-    f.AddParameter("HeapObject", "o");
+    f.AddParameter("Tagged<HeapObject>", "o");
 
     f.PrintDeclaration(hdr_);
     hdr_ << "\n";
     f.PrintDefinition(impl_, [&](std::ostream& stream) {
-      stream << "  return o.Is" << name_ << "();\n";
+      stream << "  return Is" << name_ << "(o);\n";
     });
   }
   hdr_ << "// Definition " << Position() << "\n";
@@ -4286,18 +4294,18 @@ void CppClassGenerator::GenerateClassCasts() {
                    gen_name_);
   cpp::Function f(&owner, "cast");
   f.SetFlags(cpp::Function::kV8Inline | cpp::Function::kStatic);
-  f.SetReturnType("D");
-  f.AddParameter("Object", "object");
+  f.SetReturnType("Tagged<D>");
+  f.AddParameter("Tagged<Object>", "object");
 
-  // V8_INLINE static D cast(Object)
+  // V8_INLINE static D cast(Tagged<Object>)
   f.PrintDeclaration(hdr_);
   f.PrintDefinition(inl_, [](std::ostream& stream) {
-    stream << "    return D(object.ptr());\n";
+    stream << "    return Tagged<D>(D(object.ptr()));\n";
   });
-  // V8_INLINE static D unchecked_cast(Object)
+  // V8_INLINE static D unchecked_cast(Tagged<Object>)
   f.SetName("unchecked_cast");
   f.PrintInlineDefinition(hdr_, [](std::ostream& stream) {
-    stream << "    return base::bit_cast<D>(object);\n";
+    stream << "    return Tagged<D>::unchecked_cast(object);\n";
   });
 }
 
@@ -4322,12 +4330,10 @@ void CppClassGenerator::GenerateClassConstructors() {
   hdr_ << "  }\n\n";
 
   hdr_ << " protected:\n";
+  hdr_ << "  inline explicit constexpr " << gen_name_
+       << "(Address ptr, typename P::SkipTypeCheckTag\n)";
+  hdr_ << "    : P(ptr, typename P::SkipTypeCheckTag{}) {}\n";
   hdr_ << "  inline explicit " << gen_name_ << "(Address ptr);\n";
-  hdr_ << "  // Special-purpose constructor for subclasses that have fast "
-          "paths where\n";
-  hdr_ << "  // their ptr() is a Smi.\n";
-  hdr_ << "  inline explicit " << gen_name_
-       << "(Address ptr, HeapObject::AllowInlineSmiStorage allow_smi);\n";
 
   inl_ << "template<class D, class P>\n";
   inl_ << "inline " << gen_name_T_ << "::" << gen_name_ << "(Address ptr)\n";
@@ -4335,16 +4341,6 @@ void CppClassGenerator::GenerateClassConstructors() {
   inl_ << "  SLOW_DCHECK(Is" << typecheck_type->name()
        << "_NonInline(*this));\n";
   inl_ << "}\n";
-
-  inl_ << "template<class D, class P>\n";
-  inl_ << "inline " << gen_name_T_ << "::" << gen_name_
-       << "(Address ptr, HeapObject::AllowInlineSmiStorage allow_smi)\n";
-  inl_ << "    : P(ptr, allow_smi) {\n";
-  inl_ << "  SLOW_DCHECK("
-       << "(allow_smi == HeapObject::AllowInlineSmiStorage::kAllowBeingASmi"
-          " && this->IsSmi()) || Is"
-       << typecheck_type->name() << "_NonInline(*this));\n";
-  inl_ << "}\n";
 }
 
 namespace {
@@ -4369,13 +4365,12 @@ std::string GenerateRuntimeTypeCheck(const Type* type,
         // to, so just check that it's weak.
         type_check << value << ".IsWeak()";
       } else {
-        type_check << "(" << (strong ? "!" : "") << value << ".IsWeak() && "
-                   << value << ".GetHeapObjectOrSmi().Is"
+        type_check << "(" << (strong ? "!" : "") << value << ".IsWeak() && Is"
                    << (strong ? runtime_type.type : runtime_type.weak_ref_to)
-                   << "())";
+                   << "(" << value << ".GetHeapObjectOrSmi()))";
       }
     } else {
-      type_check << value << ".Is" << runtime_type.type << "()";
+      type_check << "Is" << runtime_type.type << "(" << value << ")";
     }
   }
   return type_check.str();
@@ -4403,7 +4398,8 @@ bool CanGenerateFieldAccessors(const Type* field_type) {
   // TODO(v8:10391) Generate accessors for external pointers.
   return field_type != TypeOracle::GetVoidType() &&
          field_type != TypeOracle::GetFloat64OrHoleType() &&
-         !field_type->IsSubtypeOf(TypeOracle::GetExternalPointerType());
+         !field_type->IsSubtypeOf(TypeOracle::GetExternalPointerType()) &&
+         !field_type->IsSubtypeOf(TypeOracle::GetIndirectPointerType());
 }
 }  // namespace
 
@@ -4485,7 +4481,6 @@ void CppClassGenerator::GenerateFieldAccessors(
     }
 
     getter.PrintDefinition(inl_, [&](auto& stream) {
-      stream << "  " << type_name << " value;\n";
       EmitLoadFieldStatement(stream, class_field, struct_fields);
       stream << "  return value;\n";
     });
@@ -4543,11 +4538,7 @@ std::string CppClassGenerator::GetTypeNameForAccessor(const Field& f) {
     }
     return constexpr_version->GetGeneratedTypeName();
   }
-  if (field_type->IsSubtypeOf(TypeOracle::GetSmiType())) {
-    // Follow the convention to create Smi accessors with type int.
-    return "int";
-  }
-  return field_type->UnhandlifiedCppTypeName();
+  return field_type->TagglifiedCppTypeName();
 }
 
 bool CppClassGenerator::CanContainHeapObjects(const Type* t) {
@@ -4582,7 +4573,7 @@ void CppClassGenerator::EmitLoadFieldStatement(
     offset = "offset";
   }
 
-  stream << "  value = ";
+  stream << "  " << type_name << " value = ";
 
   if (!field_type->IsSubtypeOf(TypeOracle::GetTaggedType())) {
     if (class_field.read_synchronization ==
@@ -4810,13 +4801,13 @@ void ImplementationVisitor::GenerateClassDefinitions(
         }
 
         factory_impl << ");\n";
-        factory_impl << "  Map map = factory()->read_only_roots()."
+        factory_impl << "  Tagged<Map> map = factory()->read_only_roots()."
                      << SnakeifyString(type->name()) << "_map();";
-        factory_impl << "  HeapObject raw_object =\n";
+        factory_impl << "  Tagged<HeapObject> raw_object =\n";
         factory_impl << "    factory()->AllocateRawWithImmortalMap(size, "
                         "allocation_type, map);\n";
-        factory_impl << "  " << type->UnhandlifiedCppTypeName()
-                     << " result = " << type->UnhandlifiedCppTypeName()
+        factory_impl << "  " << type->TagglifiedCppTypeName()
+                     << " result = " << type->GetConstexprGeneratedTypeName()
                      << "::cast(raw_object);\n";
         factory_impl << "  DisallowGarbageCollection no_gc;";
         factory_impl << "  WriteBarrierMode write_barrier_mode =\n"
@@ -4827,7 +4818,7 @@ void ImplementationVisitor::GenerateClassDefinitions(
         for (const Field& f : type->ComputeAllFields()) {
           if (f.name_and_type.name == "map") continue;
           if (!f.index) {
-            factory_impl << "  result.TorqueGeneratedClass::set_"
+            factory_impl << "  result->TorqueGeneratedClass::set_"
                          << SnakeifyString(f.name_and_type.name) << "(";
             if (f.name_and_type.type->IsSubtypeOf(
                     TypeOracle::GetTaggedType()) &&
@@ -5034,26 +5025,6 @@ void ImplementationVisitor::GenerateBodyDescriptors(
         h_contents << "BodyDescriptorBase {\n";
         h_contents << " public:\n";
 
-        h_contents << "  static bool IsValidSlot(Map map, HeapObject obj, int "
-                      "offset) {\n";
-        if (has_array_fields) {
-          h_contents << "    if (offset < kHeaderSize) {\n";
-        }
-        h_contents << "      bool valid_slots[] = {";
-        for (ObjectSlotKind slot : header_slot_kinds) {
-          h_contents << (slot != ObjectSlotKind::kNoPointer ? "1" : "0") << ",";
-        }
-        h_contents << "};\n"
-                   << "      return valid_slots[static_cast<unsigned "
-                      "int>(offset)/kTaggedSize];\n";
-        if (has_array_fields) {
-          h_contents << "    }\n";
-          bool array_is_tagged = *array_slot_kind != ObjectSlotKind::kNoPointer;
-          h_contents << "    return " << (array_is_tagged ? "true" : "false")
-                     << ";\n";
-        }
-        h_contents << "  }\n\n";
-
         h_contents << "  template <typename ObjectVisitor>\n";
         h_contents
             << "  static inline void IterateBody(Map map, HeapObject obj, "
@@ -5130,7 +5101,7 @@ void ImplementationVisitor::GenerateBodyDescriptors(
         // We use an unchecked_cast here because this is used for concurrent
         // marking, where we shouldn't re-read the map.
         h_contents << "    return " << name
-                   << "::unchecked_cast(raw_object).AllocatedSize();\n";
+                   << "::unchecked_cast(raw_object)->AllocatedSize();\n";
       }
       h_contents << "  }\n\n";
 
@@ -5307,7 +5278,7 @@ void ImplementationVisitor::GenerateClassVerifiers(
       }
 
       // Second, verify that this object is what it claims to be.
-      cc_contents << "  CHECK(o.Is" << name << "(isolate));\n";
+      cc_contents << "  CHECK(Is" << name << "(o, isolate));\n";
 
       // Third, verify its properties.
       for (auto f : type->fields()) {
diff --git a/deps/v8/src/torque/torque-parser.cc b/deps/v8/src/torque/torque-parser.cc
index 2faee24880a4b5..3c3ebec2e6962e 100644
--- a/deps/v8/src/torque/torque-parser.cc
+++ b/deps/v8/src/torque/torque-parser.cc
@@ -43,8 +43,6 @@ struct EnumEntry {
 class BuildFlags : public base::ContextualClass<BuildFlags> {
  public:
   BuildFlags() {
-    build_flags_["V8_SFI_HAS_UNIQUE_ID"] = V8_SFI_HAS_UNIQUE_ID;
-    build_flags_["V8_SFI_NEEDS_PADDING"] = V8_SFI_NEEDS_PADDING;
     build_flags_["V8_EXTERNAL_CODE_SPACE"] = V8_EXTERNAL_CODE_SPACE_BOOL;
     build_flags_["TAGGED_SIZE_8_BYTES"] = TAGGED_SIZE_8_BYTES;
 #ifdef V8_INTL_SUPPORT
@@ -72,6 +70,8 @@ class BuildFlags : public base::ContextualClass<BuildFlags> {
     build_flags_["V8_ENABLE_WEBASSEMBLY"] = false;
 #endif
     build_flags_["V8_ENABLE_SANDBOX"] = V8_ENABLE_SANDBOX_BOOL;
+    build_flags_["V8_CODE_POINTER_SANDBOXING"] =
+        V8_CODE_POINTER_SANDBOXING_BOOL;
     build_flags_["DEBUG"] = DEBUG_BOOL;
   }
   static bool GetFlag(const std::string& name, const char* production) {
diff --git a/deps/v8/src/torque/type-oracle.h b/deps/v8/src/torque/type-oracle.h
index 0f9fda629ac1f1..8dc1b2477b32ba 100644
--- a/deps/v8/src/torque/type-oracle.h
+++ b/deps/v8/src/torque/type-oracle.h
@@ -201,6 +201,10 @@ class TypeOracle : public base::ContextualClass<TypeOracle> {
     return Get().GetBuiltinType(EXTERNALPTR_TYPE_STRING);
   }
 
+  static const Type* GetIndirectPointerType() {
+    return Get().GetBuiltinType(INDIRECTPTR_TYPE_STRING);
+  }
+
   static const Type* GetMapType() {
     return Get().GetBuiltinType(MAP_TYPE_STRING);
   }
diff --git a/deps/v8/src/torque/types.cc b/deps/v8/src/torque/types.cc
index e93fbab8f4ee1f..06bcc789d19ce4 100644
--- a/deps/v8/src/torque/types.cc
+++ b/deps/v8/src/torque/types.cc
@@ -75,16 +75,21 @@ std::string Type::SimpleName() const {
 std::string Type::HandlifiedCppTypeName() const {
   if (IsSubtypeOf(TypeOracle::GetSmiType())) return "int";
   if (IsSubtypeOf(TypeOracle::GetTaggedType())) {
-    return "Handle<" + UnhandlifiedCppTypeName() + ">";
+    return "Handle<" + GetConstexprGeneratedTypeName() + ">";
   } else {
-    return UnhandlifiedCppTypeName();
+    return GetConstexprGeneratedTypeName();
   }
 }
 
-std::string Type::UnhandlifiedCppTypeName() const {
+std::string Type::TagglifiedCppTypeName() const {
   if (IsSubtypeOf(TypeOracle::GetSmiType())) return "int";
-  if (this == TypeOracle::GetObjectType()) return "Object";
-  return GetConstexprGeneratedTypeName();
+  // TODO(leszeks): Changee this to GetTaggedType once there's a Maybe version
+  // of Tagged<T>.
+  if (IsSubtypeOf(TypeOracle::GetStrongTaggedType())) {
+    return "Tagged<" + GetConstexprGeneratedTypeName() + ">";
+  } else {
+    return GetConstexprGeneratedTypeName();
+  }
 }
 
 bool Type::IsSubtypeOf(const Type* supertype) const {
@@ -670,9 +675,13 @@ base::Optional<ObjectSlotKind> ClassType::ComputeArraySlotKind() const {
       .Throw();
 }
 
-bool ClassType::HasNoPointerSlots() const {
-  for (ObjectSlotKind slot : ComputeHeaderSlotKinds()) {
-    if (slot != ObjectSlotKind::kNoPointer) return false;
+bool ClassType::HasNoPointerSlotsExceptMap() const {
+  const auto header_slot_kinds = ComputeHeaderSlotKinds();
+  DCHECK_GE(header_slot_kinds.size(), 1);
+  DCHECK_EQ(ComputeHeaderFields()[0].name_and_type.type,
+            TypeOracle::GetMapType());
+  for (size_t i = 1; i < header_slot_kinds.size(); ++i) {
+    if (header_slot_kinds[i] != ObjectSlotKind::kNoPointer) return false;
   }
   if (auto slot = ComputeArraySlotKind()) {
     if (*slot != ObjectSlotKind::kNoPointer) return false;
@@ -1088,9 +1097,8 @@ VisitResult ProjectStructField(VisitResult structure,
 
 namespace {
 void AppendLoweredTypes(const Type* type, std::vector<const Type*>* result) {
-  DCHECK_NE(type, TypeOracle::GetNeverType());
   if (type->IsConstexpr()) return;
-  if (type == TypeOracle::GetVoidType()) return;
+  if (type->IsVoidOrNever()) return;
   if (base::Optional<const StructType*> s = type->StructSupertype()) {
     for (const Field& field : (*s)->fields()) {
       AppendLoweredTypes(field.name_and_type.type, result);
@@ -1163,6 +1171,8 @@ size_t AbstractType::AlignmentLog2() const {
     alignment = TargetArchitecture::RawPtrSize();
   } else if (this == TypeOracle::GetExternalPointerType()) {
     alignment = TargetArchitecture::ExternalPointerSize();
+  } else if (this == TypeOracle::GetIndirectPointerType()) {
+    alignment = TargetArchitecture::IndirectPointerSize();
   } else if (this == TypeOracle::GetVoidType()) {
     alignment = 1;
   } else if (this == TypeOracle::GetInt8Type()) {
@@ -1233,6 +1243,9 @@ base::Optional<std::tuple<size_t, std::string>> SizeOf(const Type* type) {
   } else if (type->IsSubtypeOf(TypeOracle::GetExternalPointerType())) {
     size = TargetArchitecture::ExternalPointerSize();
     size_string = "kExternalPointerSlotSize";
+  } else if (type->IsSubtypeOf(TypeOracle::GetIndirectPointerType())) {
+    size = TargetArchitecture::IndirectPointerSize();
+    size_string = "kIndirectPointerSlotSize";
   } else if (type->IsSubtypeOf(TypeOracle::GetVoidType())) {
     size = 0;
     size_string = "0";
diff --git a/deps/v8/src/torque/types.h b/deps/v8/src/torque/types.h
index f298fd627d364a..f2ef0722a4895d 100644
--- a/deps/v8/src/torque/types.h
+++ b/deps/v8/src/torque/types.h
@@ -97,7 +97,7 @@ using MaybeSpecializationKey = base::Optional<SpecializationKey<GenericType>>;
 struct TypeChecker {
   // The type of the object. This string is not guaranteed to correspond to a
   // C++ class, but just to a type checker function: for any type "Foo" here,
-  // the function Object::IsFoo must exist.
+  // the function IsFoo must exist.
   std::string type;
   // If {type} is "MaybeObject", then {weak_ref_to} indicates the corresponding
   // strong object type. Otherwise, {weak_ref_to} is empty.
@@ -116,7 +116,7 @@ class V8_EXPORT_PRIVATE Type : public TypeBase {
   // Used for naming generated code.
   virtual std::string SimpleName() const;
 
-  std::string UnhandlifiedCppTypeName() const;
+  std::string TagglifiedCppTypeName() const;
   std::string HandlifiedCppTypeName() const;
 
   const Type* parent() const { return parent_; }
@@ -742,7 +742,7 @@ class ClassType final : public AggregateType {
   // what kind of GC visiting the individual slots require.
   std::vector<ObjectSlotKind> ComputeHeaderSlotKinds() const;
   base::Optional<ObjectSlotKind> ComputeArraySlotKind() const;
-  bool HasNoPointerSlots() const;
+  bool HasNoPointerSlotsExceptMap() const;
   bool HasIndexedFieldsIncludingInParents() const;
   const Field* GetFieldPreceding(size_t field_index) const;
 
diff --git a/deps/v8/src/tracing/trace-categories.h b/deps/v8/src/tracing/trace-categories.h
index 7dc9933f0980ea..54138bc53172bd 100644
--- a/deps/v8/src/tracing/trace-categories.h
+++ b/deps/v8/src/tracing/trace-categories.h
@@ -40,6 +40,7 @@ PERFETTO_DEFINE_CATEGORIES_IN_NAMESPACE_WITH_ATTRS(
     perfetto::Category(TRACE_DISABLED_BY_DEFAULT("v8.gc_stats")),
     perfetto::Category(TRACE_DISABLED_BY_DEFAULT("v8.inspector")),
     perfetto::Category(TRACE_DISABLED_BY_DEFAULT("v8.ic_stats")),
+    perfetto::Category(TRACE_DISABLED_BY_DEFAULT("v8.maglev")),
     perfetto::Category(TRACE_DISABLED_BY_DEFAULT("v8.runtime")),
     perfetto::Category(TRACE_DISABLED_BY_DEFAULT("v8.runtime_stats")),
     perfetto::Category(TRACE_DISABLED_BY_DEFAULT("v8.runtime_stats_sampling")),
diff --git a/deps/v8/src/tracing/trace-event.h b/deps/v8/src/tracing/trace-event.h
index fbaa53e0f04b20..37be54c9e0e8b1 100644
--- a/deps/v8/src/tracing/trace-event.h
+++ b/deps/v8/src/tracing/trace-event.h
@@ -654,8 +654,8 @@ class CallStatsScopedTracer {
           }                                                                \
         });                                                                \
       }                                                                    \
-      v8::internal::Isolate* isolate_;                                     \
-      bool has_parent_scope_;                                              \
+      v8::internal::Isolate* isolate_ = nullptr;                           \
+      bool has_parent_scope_ = false;                                      \
     } stats;                                                               \
   } PERFETTO_UID(scoped_event) {                                           \
     { isolate, 0 }                                                         \
diff --git a/deps/v8/src/trap-handler/handler-inside-posix.cc b/deps/v8/src/trap-handler/handler-inside-posix.cc
index 39d6e0d3ae0d88..142f6fd3a1614a 100644
--- a/deps/v8/src/trap-handler/handler-inside-posix.cc
+++ b/deps/v8/src/trap-handler/handler-inside-posix.cc
@@ -49,7 +49,11 @@ namespace trap_handler {
 
 #if V8_TRAP_HANDLER_SUPPORTED
 
-#if V8_OS_LINUX
+#if V8_OS_LINUX && V8_HOST_ARCH_ARM64
+#define CONTEXT_PC() &uc->uc_mcontext.pc
+#elif V8_OS_DARWIN && V8_HOST_ARCH_ARM64
+#define CONTEXT_PC() &uc->uc_mcontext->__ss.__pc
+#elif V8_OS_LINUX
 #define CONTEXT_REG(reg, REG) &uc->uc_mcontext.gregs[REG_##REG]
 #elif V8_OS_DARWIN
 #define CONTEXT_REG(reg, REG) &uc->uc_mcontext->__ss.__##reg
@@ -132,7 +136,7 @@ bool TryHandleSignal(int signum, siginfo_t* info, void* context) {
 #if V8_HOST_ARCH_X64
     auto* context_ip = CONTEXT_REG(rip, RIP);
 #elif V8_HOST_ARCH_ARM64
-    auto* context_ip = CONTEXT_REG(pc, PC);
+    auto* context_ip = CONTEXT_PC();
 #else
 #error "Unsupported architecture."
 #endif
diff --git a/deps/v8/src/trap-handler/handler-outside-posix.cc b/deps/v8/src/trap-handler/handler-outside-posix.cc
index 004783b64f3274..f441171c50ba2c 100644
--- a/deps/v8/src/trap-handler/handler-outside-posix.cc
+++ b/deps/v8/src/trap-handler/handler-outside-posix.cc
@@ -45,7 +45,14 @@ bool RegisterDefaultTrapHandler() {
 
   struct sigaction action;
   action.sa_sigaction = HandleSignal;
-  action.sa_flags = SA_SIGINFO;
+  // Use SA_ONSTACK so that iff an alternate signal stack was registered via
+  // sigaltstack, that one is used for handling the signal instead of the
+  // default stack. This can be useful if for example the stack pointer is
+  // corrupted or a stack overflow is triggered as that may cause the trap
+  // handler to crash if it runs on the default stack. We assume that other
+  // parts, e.g. Asan or the v8 sandbox testing infrastructure, will register
+  // the alternate stack if necessary.
+  action.sa_flags = SA_SIGINFO | SA_ONSTACK;
   sigemptyset(&action.sa_mask);
   // {sigaction} installs a new custom segfault handler. On success, it returns
   // 0. If we get a nonzero value, we report an error to the caller by returning
diff --git a/deps/v8/src/trap-handler/trap-handler-simulator.h b/deps/v8/src/trap-handler/trap-handler-simulator.h
index 627f8e8dad4fcb..57471de1cb83de 100644
--- a/deps/v8/src/trap-handler/trap-handler-simulator.h
+++ b/deps/v8/src/trap-handler/trap-handler-simulator.h
@@ -8,15 +8,12 @@
 #include <cstdint>
 
 #include "include/v8config.h"
+#include "src/trap-handler/trap-handler.h"
 
 // This header defines the ProbeMemory function to be used by simulators to
 // trigger a signal at a defined location, before doing an actual memory access.
 
-// This implementation is only usable on an x64 host with non-x64 target (i.e. a
-// simulator build on x64).
-#if (!defined(_M_X64) && !defined(__x86_64__)) || defined(V8_TARGET_ARCH_X64)
-#error "Do only include this file on simulator builds on x64."
-#endif
+#ifdef V8_TRAP_HANDLER_VIA_SIMULATOR
 
 namespace v8::internal::trap_handler {
 
@@ -34,12 +31,12 @@ uintptr_t ProbeMemory(uintptr_t address, uintptr_t pc)
 // "ProbeMemory", but we want something more expressive on stack traces.
 #if V8_OS_DARWIN
     asm("_v8_internal_simulator_ProbeMemory");
-#elif !defined(_MSC_VER)
+#else
     asm("v8_internal_simulator_ProbeMemory");
-#else // MSVC
-    ;
 #endif
 
 }  // namespace v8::internal::trap_handler
 
+#endif  // V8_TRAP_HANDLER_VIA_SIMULATOR
+
 #endif  // V8_TRAP_HANDLER_TRAP_HANDLER_SIMULATOR_H_
diff --git a/deps/v8/src/trap-handler/trap-handler.h b/deps/v8/src/trap-handler/trap-handler.h
index 77b0b19aa33d64..e391bc6e3866d2 100644
--- a/deps/v8/src/trap-handler/trap-handler.h
+++ b/deps/v8/src/trap-handler/trap-handler.h
@@ -22,8 +22,9 @@ namespace trap_handler {
     ((V8_OS_LINUX && !V8_OS_ANDROID) || V8_OS_WIN || V8_OS_DARWIN || \
      V8_OS_FREEBSD)
 #define V8_TRAP_HANDLER_SUPPORTED true
-// Arm64 (non-simulator) on Mac.
-#elif V8_TARGET_ARCH_ARM64 && V8_HOST_ARCH_ARM64 && V8_OS_DARWIN
+// Arm64 (non-simulator) on Mac and Linux.
+#elif V8_TARGET_ARCH_ARM64 && V8_HOST_ARCH_ARM64 && \
+    (V8_OS_DARWIN || (V8_OS_LINUX && !V8_OS_ANDROID))
 #define V8_TRAP_HANDLER_SUPPORTED true
 // Arm64 simulator on x64 on Linux, Mac, or Windows.
 //
@@ -106,14 +107,14 @@ void TH_EXPORT_PRIVATE ReleaseHandlerData(int index);
 
 // Initially false, set to true if when trap handlers are enabled. Never goes
 // back to false then.
-extern bool g_is_trap_handler_enabled;
+TH_EXPORT_PRIVATE extern bool g_is_trap_handler_enabled;
 
 // Initially true, set to false when either {IsTrapHandlerEnabled} or
 // {EnableTrapHandler} is called to prevent calling {EnableTrapHandler}
 // repeatedly, or after {IsTrapHandlerEnabled}. Needs to be atomic because
 // {IsTrapHandlerEnabled} can be called from any thread. Updated using relaxed
 // semantics, since it's not used for synchronization.
-extern std::atomic<bool> g_can_enable_trap_handler;
+TH_EXPORT_PRIVATE extern std::atomic<bool> g_can_enable_trap_handler;
 
 // Enables trap handling for WebAssembly bounds checks.
 //
diff --git a/deps/v8/src/utils/address-map.cc b/deps/v8/src/utils/address-map.cc
index 663f8d77e27292..111d0e97736449 100644
--- a/deps/v8/src/utils/address-map.cc
+++ b/deps/v8/src/utils/address-map.cc
@@ -17,7 +17,7 @@ RootIndexMap::RootIndexMap(Isolate* isolate) {
   for (RootIndex root_index = RootIndex::kFirstStrongOrReadOnlyRoot;
        root_index <= RootIndex::kLastStrongOrReadOnlyRoot; ++root_index) {
     Object root = isolate->root(root_index);
-    if (!root.IsHeapObject()) continue;
+    if (!IsHeapObject(root)) continue;
     // Omit root entries that can be written after initialization. They must
     // not be referenced through the root list in the snapshot.
     // Since we map the raw address of an root item to its root list index, the
diff --git a/deps/v8/src/utils/address-map.h b/deps/v8/src/utils/address-map.h
index 0a6c749b3916df..da914392554f3c 100644
--- a/deps/v8/src/utils/address-map.h
+++ b/deps/v8/src/utils/address-map.h
@@ -45,12 +45,14 @@ inline uintptr_t PointerToIndexHashMap<Address>::Key(Address value) {
 }
 
 template <>
-inline uintptr_t PointerToIndexHashMap<HeapObject>::Key(HeapObject value) {
+inline uintptr_t PointerToIndexHashMap<Tagged<HeapObject>>::Key(
+    Tagged<HeapObject> value) {
   return value.ptr();
 }
 
 class AddressToIndexHashMap : public PointerToIndexHashMap<Address> {};
-class HeapObjectToIndexHashMap : public PointerToIndexHashMap<HeapObject> {};
+class HeapObjectToIndexHashMap
+    : public PointerToIndexHashMap<Tagged<HeapObject>> {};
 
 class RootIndexMap {
  public:
@@ -59,7 +61,8 @@ class RootIndexMap {
   RootIndexMap& operator=(const RootIndexMap&) = delete;
 
   // Returns true on successful lookup and sets *|out_root_list|.
-  bool Lookup(HeapObject obj, RootIndex* out_root_list) const {
+  V8_EXPORT_PRIVATE bool Lookup(Tagged<HeapObject> obj,
+                                RootIndex* out_root_list) const {
     Maybe<uint32_t> maybe_index = map_->Get(obj);
     if (maybe_index.IsJust()) {
       *out_root_list = static_cast<RootIndex>(maybe_index.FromJust());
@@ -67,7 +70,7 @@ class RootIndexMap {
     }
     return false;
   }
-  bool Lookup(Address obj, RootIndex* out_root_list) const;
+  V8_EXPORT_PRIVATE bool Lookup(Address obj, RootIndex* out_root_list) const;
 
  private:
   HeapObjectToIndexHashMap* map_;
diff --git a/deps/v8/src/utils/allocation.cc b/deps/v8/src/utils/allocation.cc
index e3ba9ad3a9a7e3..dc8a3696fa4189 100644
--- a/deps/v8/src/utils/allocation.cc
+++ b/deps/v8/src/utils/allocation.cc
@@ -182,7 +182,9 @@ void FreePages(v8::PageAllocator* page_allocator, void* address,
                const size_t size) {
   DCHECK_NOT_NULL(page_allocator);
   DCHECK(IsAligned(size, page_allocator->AllocatePageSize()));
-  CHECK(page_allocator->FreePages(address, size));
+  if (!page_allocator->FreePages(address, size)) {
+    V8::FatalProcessOutOfMemory(nullptr, "FreePages");
+  }
 }
 
 void ReleasePages(v8::PageAllocator* page_allocator, void* address, size_t size,
diff --git a/deps/v8/src/utils/allocation.h b/deps/v8/src/utils/allocation.h
index 662e4b0fdb2bf3..6e5233253043fd 100644
--- a/deps/v8/src/utils/allocation.h
+++ b/deps/v8/src/utils/allocation.h
@@ -79,7 +79,7 @@ char* StrNDup(const char* str, int n);
 class FreeStoreAllocationPolicy {
  public:
   template <typename T, typename TypeTag = T[]>
-  V8_INLINE T* NewArray(size_t length) {
+  V8_INLINE T* AllocateArray(size_t length) {
     return static_cast<T*>(Malloced::operator new(length * sizeof(T)));
   }
   template <typename T, typename TypeTag = T[]>
diff --git a/deps/v8/src/utils/bit-vector.h b/deps/v8/src/utils/bit-vector.h
index 37b9591a3918c4..9d41657a7b375f 100644
--- a/deps/v8/src/utils/bit-vector.h
+++ b/deps/v8/src/utils/bit-vector.h
@@ -110,7 +110,7 @@ class V8_EXPORT_PRIVATE BitVector : public ZoneObject {
     DCHECK_LE(0, length);
     int data_length = (length + kDataBits - 1) >> kDataBitShift;
     if (data_length > 1) {
-      data_.ptr_ = zone->NewArray<uintptr_t>(data_length);
+      data_.ptr_ = zone->AllocateArray<uintptr_t>(data_length);
       std::fill_n(data_.ptr_, data_length, 0);
       data_begin_ = data_.ptr_;
       data_end_ = data_begin_ + data_length;
@@ -122,7 +122,7 @@ class V8_EXPORT_PRIVATE BitVector : public ZoneObject {
     if (!other.is_inline()) {
       int data_length = other.data_length();
       DCHECK_LT(1, data_length);
-      data_.ptr_ = zone->NewArray<uintptr_t>(data_length);
+      data_.ptr_ = zone->AllocateArray<uintptr_t>(data_length);
       data_begin_ = data_.ptr_;
       data_end_ = data_begin_ + data_length;
       std::copy_n(other.data_begin_, data_length, data_begin_);
@@ -141,7 +141,7 @@ class V8_EXPORT_PRIVATE BitVector : public ZoneObject {
     DCHECK_LE(1, old_data_length);
     int new_data_length = (new_length + kDataBits - 1) >> kDataBitShift;
     if (new_data_length > old_data_length) {
-      uintptr_t* new_data = zone->NewArray<uintptr_t>(new_data_length);
+      uintptr_t* new_data = zone->AllocateArray<uintptr_t>(new_data_length);
 
       // Copy over the data.
       std::copy_n(data_begin_, old_data_length, new_data);
diff --git a/deps/v8/src/utils/identity-map.cc b/deps/v8/src/utils/identity-map.cc
index 38a8a03b899739..810e693193930e 100644
--- a/deps/v8/src/utils/identity-map.cc
+++ b/deps/v8/src/utils/identity-map.cc
@@ -63,6 +63,7 @@ int IdentityMapBase::ScanKeysFor(Address address, uint32_t hash) const {
 
 std::pair<int, bool> IdentityMapBase::InsertKey(Address address,
                                                 uint32_t hash) {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   DCHECK_EQ(gc_counter_, heap_->gc_count());
 
   // Grow the map if we reached >= 80% occupancy.
@@ -91,6 +92,7 @@ std::pair<int, bool> IdentityMapBase::InsertKey(Address address,
 }
 
 bool IdentityMapBase::DeleteIndex(int index, uintptr_t* deleted_value) {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   if (deleted_value != nullptr) *deleted_value = values_[index];
   Address not_mapped = ReadOnlyRoots(heap_).not_mapped_symbol().ptr();
   DCHECK_NE(keys_[index], not_mapped);
@@ -131,6 +133,7 @@ bool IdentityMapBase::DeleteIndex(int index, uintptr_t* deleted_value) {
 }
 
 int IdentityMapBase::Lookup(Address key) const {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   uint32_t hash = Hash(key);
   int index = ScanKeysFor(key, hash);
   if (index < 0 && gc_counter_ != heap_->gc_count()) {
@@ -142,6 +145,7 @@ int IdentityMapBase::Lookup(Address key) const {
 }
 
 std::pair<int, bool> IdentityMapBase::LookupOrInsert(Address key) {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   uint32_t hash = Hash(key);
   // Perform an optimistic lookup.
   int index = ScanKeysFor(key, hash);
@@ -168,6 +172,7 @@ uint32_t IdentityMapBase::Hash(Address address) const {
 //    not found => a pointer to a new storage location for the value, false
 IdentityMapFindResult<uintptr_t> IdentityMapBase::FindOrInsertEntry(
     Address key) {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   CHECK(!is_iterable());  // Don't allow insertion while iterable.
   if (capacity_ == 0) {
     return {InsertEntry(key), false};
@@ -181,6 +186,7 @@ IdentityMapFindResult<uintptr_t> IdentityMapBase::FindOrInsertEntry(
 //    found => a pointer to the storage location for the value
 //    not found => {nullptr}
 IdentityMapBase::RawEntry IdentityMapBase::FindEntry(Address key) const {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   // Don't allow find by key while iterable (might rehash).
   CHECK(!is_iterable());
   if (size_ == 0) return nullptr;
@@ -191,6 +197,7 @@ IdentityMapBase::RawEntry IdentityMapBase::FindEntry(Address key) const {
 // Inserts the given key using the object's address as the identity, returning
 // a pointer to the new storage location for the value.
 IdentityMapBase::RawEntry IdentityMapBase::InsertEntry(Address key) {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   // Don't allow find by key while iterable (might rehash).
   CHECK(!is_iterable());
   if (capacity_ == 0) {
@@ -199,11 +206,10 @@ IdentityMapBase::RawEntry IdentityMapBase::InsertEntry(Address key) {
     mask_ = kInitialIdentityMapSize - 1;
     gc_counter_ = heap_->gc_count();
 
-    keys_ = reinterpret_cast<Address*>(NewPointerArray(capacity_));
-    Address not_mapped = ReadOnlyRoots(heap_).not_mapped_symbol().ptr();
+    uintptr_t not_mapped = ReadOnlyRoots(heap_).not_mapped_symbol().ptr();
+    keys_ = reinterpret_cast<Address*>(NewPointerArray(capacity_, not_mapped));
     for (int i = 0; i < capacity_; i++) keys_[i] = not_mapped;
-    values_ = NewPointerArray(capacity_);
-    memset(values_, 0, sizeof(uintptr_t) * capacity_);
+    values_ = NewPointerArray(capacity_, 0);
 
     strong_roots_entry_ =
         heap_->RegisterStrongRoots("IdentityMapBase", FullObjectSlot(keys_),
@@ -261,6 +267,7 @@ int IdentityMapBase::NextIndex(int index) const {
 }
 
 void IdentityMapBase::Rehash() {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   CHECK(!is_iterable());  // Can't rehash while iterating.
   // Record the current GC counter.
   gc_counter_ = heap_->gc_count();
@@ -294,6 +301,7 @@ void IdentityMapBase::Rehash() {
 }
 
 void IdentityMapBase::Resize(int new_capacity) {
+  DCHECK_NE(heap_->gc_state(), Heap::MARK_COMPACT);
   CHECK(!is_iterable());  // Can't resize while iterating.
   // Resize the internal storage and reinsert all the key/value pairs.
   DCHECK_GT(new_capacity, size_);
@@ -306,11 +314,9 @@ void IdentityMapBase::Resize(int new_capacity) {
   gc_counter_ = heap_->gc_count();
   size_ = 0;
 
-  keys_ = reinterpret_cast<Address*>(NewPointerArray(capacity_));
   Address not_mapped = ReadOnlyRoots(heap_).not_mapped_symbol().ptr();
-  for (int i = 0; i < capacity_; i++) keys_[i] = not_mapped;
-  values_ = NewPointerArray(capacity_);
-  memset(values_, 0, sizeof(uintptr_t) * capacity_);
+  keys_ = reinterpret_cast<Address*>(NewPointerArray(capacity_, not_mapped));
+  values_ = NewPointerArray(capacity_, 0);
 
   for (int i = 0; i < old_capacity; i++) {
     if (old_keys[i] == not_mapped) continue;
diff --git a/deps/v8/src/utils/identity-map.h b/deps/v8/src/utils/identity-map.h
index 9e36ee139fee50..f3563ed7286677 100644
--- a/deps/v8/src/utils/identity-map.h
+++ b/deps/v8/src/utils/identity-map.h
@@ -9,7 +9,7 @@
 
 #include "src/base/functional.h"
 #include "src/handles/handles.h"
-#include "src/objects/heap-object.h"
+#include "src/objects/tagged.h"
 
 namespace v8 {
 namespace internal {
@@ -25,7 +25,7 @@ struct IdentityMapFindResult {
 };
 
 // Base class of identity maps contains shared code for all template
-// instantions.
+// instantiations.
 class V8_EXPORT_PRIVATE IdentityMapBase {
  public:
   IdentityMapBase(const IdentityMapBase&) = delete;
@@ -68,7 +68,7 @@ class V8_EXPORT_PRIVATE IdentityMapBase {
   void EnableIteration();
   void DisableIteration();
 
-  virtual uintptr_t* NewPointerArray(size_t length) = 0;
+  virtual uintptr_t* NewPointerArray(size_t length, uintptr_t value) = 0;
   virtual void DeletePointerArray(uintptr_t* array, size_t length) = 0;
 
  private:
@@ -97,9 +97,16 @@ class V8_EXPORT_PRIVATE IdentityMapBase {
 // Implements an identity map from object addresses to a given value type {V}.
 // The map is robust w.r.t. garbage collection by synchronization with the
 // supplied {heap}.
+//
 //  * Keys are treated as strong roots.
 //  * The value type {V} must be reinterpret_cast'able to {uintptr_t}
 //  * The value type {V} must not be a heap type.
+//
+// Note: IdentityMap methods must not be called during the mark-compact phase
+// since rehashing there may lead to incorrect results.
+// Note: When using IdentityMap in concurrent settings, be aware that reads
+// (e.g. `Find`) may trigger lazy rehashing and thus must be treated as write
+// operations wrt synchronization.
 template <typename V, class AllocationPolicy>
 class IdentityMap : public IdentityMapBase {
  public:
@@ -121,7 +128,7 @@ class IdentityMap : public IdentityMapBase {
   IdentityMapFindResult<V> FindOrInsert(Handle<Object> key) {
     return FindOrInsert(*key);
   }
-  IdentityMapFindResult<V> FindOrInsert(Object key) {
+  IdentityMapFindResult<V> FindOrInsert(Tagged<Object> key) {
     auto raw = FindOrInsertEntry(key.ptr());
     return {reinterpret_cast<V*>(raw.entry), raw.already_exists};
   }
@@ -131,21 +138,21 @@ class IdentityMap : public IdentityMapBase {
   //    found => a pointer to the storage location for the value
   //    not found => {nullptr}
   V* Find(Handle<Object> key) const { return Find(*key); }
-  V* Find(Object key) const {
+  V* Find(Tagged<Object> key) const {
     return reinterpret_cast<V*>(FindEntry(key.ptr()));
   }
 
   // Insert the value for the given key. The key must not have previously
   // existed.
   void Insert(Handle<Object> key, V v) { Insert(*key, v); }
-  void Insert(Object key, V v) {
+  void Insert(Tagged<Object> key, V v) {
     *reinterpret_cast<V*>(InsertEntry(key.ptr())) = v;
   }
 
   bool Delete(Handle<Object> key, V* deleted_value) {
     return Delete(*key, deleted_value);
   }
-  bool Delete(Object key, V* deleted_value) {
+  bool Delete(Tagged<Object> key, V* deleted_value) {
     uintptr_t v;
     bool deleted_something = DeleteEntry(key.ptr(), &v);
     if (deleted_value != nullptr && deleted_something) {
@@ -166,7 +173,9 @@ class IdentityMap : public IdentityMapBase {
       return *this;
     }
 
-    Object key() const { return Object(map_->KeyAtIndex(index_)); }
+    Tagged<Object> key() const {
+      return Tagged<Object>(map_->KeyAtIndex(index_));
+    }
     V* entry() const {
       return reinterpret_cast<V*>(map_->EntryAtIndex(index_));
     }
@@ -216,8 +225,11 @@ class IdentityMap : public IdentityMapBase {
   // TODO(ishell): consider removing virtual methods in favor of combining
   // IdentityMapBase and IdentityMap into one class. This would also save
   // space when sizeof(V) is less than sizeof(uintptr_t).
-  uintptr_t* NewPointerArray(size_t length) override {
-    return allocator_.template NewArray<uintptr_t, Buffer>(length);
+  uintptr_t* NewPointerArray(size_t length, uintptr_t value) override {
+    uintptr_t* result =
+        allocator_.template AllocateArray<uintptr_t, Buffer>(length);
+    std::uninitialized_fill_n(result, length, value);
+    return result;
   }
   void DeletePointerArray(uintptr_t* array, size_t length) override {
     allocator_.template DeleteArray<uintptr_t, Buffer>(array, length);
diff --git a/deps/v8/src/utils/memcopy.cc b/deps/v8/src/utils/memcopy.cc
index 6bf529e7f9f3fe..591a6a514df905 100644
--- a/deps/v8/src/utils/memcopy.cc
+++ b/deps/v8/src/utils/memcopy.cc
@@ -38,19 +38,19 @@ void init_memcopy_functions() {
   if (Isolate::CurrentEmbeddedBlobIsBinaryEmbedded()) {
     EmbeddedData d = EmbeddedData::FromBlob();
     memmove_function = reinterpret_cast<MemMoveFunction>(
-        d.InstructionStartOfBuiltin(Builtin::kMemMove));
+        d.InstructionStartOf(Builtin::kMemMove));
   }
 #elif(V8_OS_POSIX || V8_OS_STARBOARD) && V8_HOST_ARCH_ARM
   if (Isolate::CurrentEmbeddedBlobIsBinaryEmbedded()) {
     EmbeddedData d = EmbeddedData::FromBlob();
     memcopy_uint8_function = reinterpret_cast<MemCopyUint8Function>(
-        d.InstructionStartOfBuiltin(Builtin::kMemCopyUint8Uint8));
+        d.InstructionStartOf(Builtin::kMemCopyUint8Uint8));
   }
 #elif V8_OS_POSIX && V8_HOST_ARCH_MIPS
   if (Isolate::CurrentEmbeddedBlobIsBinaryEmbedded()) {
     EmbeddedData d = EmbeddedData::FromBlob();
     memcopy_uint8_function = reinterpret_cast<MemCopyUint8Function>(
-        d.InstructionStartOfBuiltin(Builtin::kMemCopyUint8Uint8));
+        d.InstructionStartOf(Builtin::kMemCopyUint8Uint8));
   }
 #endif
 }
diff --git a/deps/v8/src/utils/memcopy.h b/deps/v8/src/utils/memcopy.h
index 3227c5dfb0b578..c247b1ecfeeac6 100644
--- a/deps/v8/src/utils/memcopy.h
+++ b/deps/v8/src/utils/memcopy.h
@@ -13,6 +13,7 @@
 
 #include "src/base/logging.h"
 #include "src/base/macros.h"
+#include "src/utils/utils.h"
 
 namespace v8 {
 namespace internal {
@@ -92,6 +93,39 @@ inline void MemCopy(void* dest, const void* src, size_t size) {
       return;
   }
 }
+#if V8_TARGET_BIG_ENDIAN
+inline void MemCopyAndSwitchEndianness(void* dst, void* src,
+                                       size_t num_elements,
+                                       size_t element_size) {
+#define COPY_LOOP(type, reverse)                            \
+  {                                                         \
+    for (uint32_t i = 0; i < num_elements; i++) {           \
+      type t;                                               \
+      type* s = reinterpret_cast<type*>(src) + i;           \
+      type* d = reinterpret_cast<type*>(dst) + i;           \
+      memcpy(&t, reinterpret_cast<void*>(s), element_size); \
+      t = reverse(t);                                       \
+      memcpy(reinterpret_cast<void*>(d), &t, element_size); \
+    }                                                       \
+    return;                                                 \
+  }
+
+  switch (element_size) {
+    case 1:
+      MemCopy(dst, src, num_elements);
+      return;
+    case 2:
+      COPY_LOOP(uint16_t, ByteReverse16);
+    case 4:
+      COPY_LOOP(uint32_t, ByteReverse32);
+    case 8:
+      COPY_LOOP(uint64_t, ByteReverse64);
+    default:
+      UNREACHABLE();
+  }
+#undef COPY_LOOP
+}
+#endif
 V8_EXPORT_PRIVATE inline void MemMove(void* dest, const void* src,
                                       size_t size) {
   // Fast path for small sizes. The compiler will expand the {memmove} for small
diff --git a/deps/v8/src/utils/scoped-list.h b/deps/v8/src/utils/scoped-list.h
index 38400a06404f0c..544ede84cb21fe 100644
--- a/deps/v8/src/utils/scoped-list.h
+++ b/deps/v8/src/utils/scoped-list.h
@@ -81,7 +81,7 @@ class V8_NODISCARD ScopedList final {
     ++end_;
   }
 
-  void AddAll(const base::Vector<const T>& list) {
+  void AddAll(base::Vector<const T> list) {
     DCHECK_EQ(buffer_.size(), end_);
     buffer_.reserve(buffer_.size() + list.length());
     for (int i = 0; i < list.length(); i++) {
diff --git a/deps/v8/src/utils/sparse-bit-vector.h b/deps/v8/src/utils/sparse-bit-vector.h
index 130b322273cf26..a0eef2c65a80ab 100644
--- a/deps/v8/src/utils/sparse-bit-vector.h
+++ b/deps/v8/src/utils/sparse-bit-vector.h
@@ -29,6 +29,11 @@ class SparseBitVector : public ZoneObject {
     uintptr_t words[kNumWordsPerSegment] = {0};
     // The next segment (with strict larger offset), or {nullptr}.
     Segment* next = nullptr;
+
+    bool empty() const {
+      return std::all_of(std::begin(words), std::end(words),
+                         [](auto segment) { return segment == 0; });
+    }
   };
 
   // Check that {Segment}s are nicely aligned, for (hopefully) better cache line
@@ -179,7 +184,7 @@ class SparseBitVector : public ZoneObject {
         std::transform(std::begin(segment->words), std::end(segment->words),
                        std::begin(other_segment->words),
                        std::begin(segment->words), std::bit_or<uintptr_t>{});
-      } else {
+      } else if (!other_segment->empty()) {
         DCHECK_LT(last->offset, other_segment->offset);
         Segment* new_segment = zone_->New<Segment>();
         new_segment->offset = other_segment->offset;
diff --git a/deps/v8/src/utils/utils.cc b/deps/v8/src/utils/utils.cc
index f8a8645ece59e1..e0b6270c5c6688 100644
--- a/deps/v8/src/utils/utils.cc
+++ b/deps/v8/src/utils/utils.cc
@@ -198,7 +198,7 @@ int WriteChars(const char* filename, const char* str, int size, bool verbose) {
   return written;
 }
 
-int WriteBytes(const char* filename, const byte* bytes, int size,
+int WriteBytes(const char* filename, const uint8_t* bytes, int size,
                bool verbose) {
   const char* str = reinterpret_cast<const char*>(bytes);
   return WriteChars(filename, str, size, verbose);
diff --git a/deps/v8/src/utils/utils.h b/deps/v8/src/utils/utils.h
index 478c03e629d34b..beca8d908228d9 100644
--- a/deps/v8/src/utils/utils.h
+++ b/deps/v8/src/utils/utils.h
@@ -497,10 +497,6 @@ class BytecodeOffset {
   //  - {ConstructStubInvoke} maps to {construct_stub_invoke_deopt_pc_offset}.
   static BytecodeOffset ConstructStubCreate() { return BytecodeOffset(1); }
   static BytecodeOffset ConstructStubInvoke() { return BytecodeOffset(2); }
-  bool IsValidForConstructStub() const {
-    return id_ == ConstructStubCreate().ToInt() ||
-           id_ == ConstructStubInvoke().ToInt();
-  }
 
   constexpr bool IsNone() const { return id_ == kNoneId; }
   bool operator==(const BytecodeOffset& other) const {
@@ -552,7 +548,7 @@ int WriteChars(const char* filename, const char* str, int size,
 
 // Write size bytes to the file given by filename.
 // The file is overwritten. Returns the number of bytes written.
-int WriteBytes(const char* filename, const byte* bytes, int size,
+int WriteBytes(const char* filename, const uint8_t* bytes, int size,
                bool verbose = true);
 
 // Simple support to read a file into std::string.
diff --git a/deps/v8/src/wasm/DEPS b/deps/v8/src/wasm/DEPS
index d62661839b2188..62404f18970985 100644
--- a/deps/v8/src/wasm/DEPS
+++ b/deps/v8/src/wasm/DEPS
@@ -13,6 +13,12 @@ specific_include_rules = {
   "c-api\.h": [
     "+third_party/wasm-api/wasm.hh",
   ],
+  "turboshaft-graph-interface\.cc": [
+    "+src/compiler/turboshaft/assembler.h",
+    "+src/compiler/turboshaft/define-assembler-macros.inc",
+    "+src/compiler/turboshaft/graph.h",
+    "+src/compiler/turboshaft/undef-assembler-macros.inc",
+  ],
   "wasm-engine\.h": [
     # The WasmEngine may cache common call descriptors.
     "+src/compiler/wasm-call-descriptors.h",
diff --git a/deps/v8/src/wasm/OWNERS b/deps/v8/src/wasm/OWNERS
index d968af074fffcc..6548a6f33d253f 100644
--- a/deps/v8/src/wasm/OWNERS
+++ b/deps/v8/src/wasm/OWNERS
@@ -1,5 +1,6 @@
 ahaas@chromium.org
 clemensb@chromium.org
+dlehmann@chromium.org
 gdeepti@chromium.org
 jkummerow@chromium.org
 manoskouk@chromium.org
diff --git a/deps/v8/src/wasm/assembler-buffer-cache.cc b/deps/v8/src/wasm/assembler-buffer-cache.cc
deleted file mode 100644
index 8146062f3645af..00000000000000
--- a/deps/v8/src/wasm/assembler-buffer-cache.cc
+++ /dev/null
@@ -1,66 +0,0 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/wasm/assembler-buffer-cache.h"
-
-#include <algorithm>
-
-#include "src/codegen/assembler.h"
-#include "src/wasm/wasm-engine.h"
-
-namespace v8::internal::wasm {
-
-class CachedAssemblerBuffer final : public AssemblerBuffer {
- public:
-  CachedAssemblerBuffer(AssemblerBufferCache* cache, base::AddressRegion region)
-      : cache_(cache), region_(region) {}
-
-  ~CachedAssemblerBuffer() override { cache_->Return(region_); }
-
-  uint8_t* start() const override {
-    return reinterpret_cast<uint8_t*>(region_.begin());
-  }
-
-  int size() const override { return static_cast<int>(region_.size()); }
-
-  std::unique_ptr<AssemblerBuffer> Grow(int new_size) override {
-    return cache_->GetAssemblerBuffer(new_size);
-  }
-
- private:
-  AssemblerBufferCache* const cache_;
-  const base::AddressRegion region_;
-};
-
-AssemblerBufferCache::~AssemblerBufferCache() {
-  for (base::AddressRegion region : available_memory_.regions()) {
-    GetWasmCodeManager()->FreeAssemblerBufferSpace(region);
-  }
-}
-
-std::unique_ptr<AssemblerBuffer> AssemblerBufferCache::GetAssemblerBuffer(
-    int size) {
-  DCHECK_LT(0, size);
-  base::AddressRegion region = available_memory_.Allocate(size);
-  if (region.is_empty()) {
-    static constexpr int kMinimumReservation = 64 * KB;
-    int minimum_allocation =
-        std::max(kMinimumReservation, std::max(total_allocated_ / 4, size));
-    base::AddressRegion new_space =
-        GetWasmCodeManager()->AllocateAssemblerBufferSpace(minimum_allocation);
-    available_memory_.Merge(new_space);
-    CHECK_GE(kMaxInt - total_allocated_, new_space.size());
-    total_allocated_ += new_space.size();
-
-    region = available_memory_.Allocate(size);
-    DCHECK(!region.is_empty());
-  }
-  return std::make_unique<CachedAssemblerBuffer>(this, region);
-}
-
-void AssemblerBufferCache::Return(base::AddressRegion region) {
-  available_memory_.Merge(region);
-}
-
-}  // namespace v8::internal::wasm
diff --git a/deps/v8/src/wasm/assembler-buffer-cache.h b/deps/v8/src/wasm/assembler-buffer-cache.h
deleted file mode 100644
index 45cf818460b36d..00000000000000
--- a/deps/v8/src/wasm/assembler-buffer-cache.h
+++ /dev/null
@@ -1,46 +0,0 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#if !V8_ENABLE_WEBASSEMBLY
-#error This header should only be included if WebAssembly is enabled.
-#endif  // !V8_ENABLE_WEBASSEMBLY
-
-#ifndef V8_WASM_ASSEMBLER_BUFFER_CACHE_H_
-#define V8_WASM_ASSEMBLER_BUFFER_CACHE_H_
-
-#include <memory>
-
-#include "src/wasm/wasm-code-manager.h"
-
-namespace v8::internal {
-class AssemblerBuffer;
-}
-
-namespace v8::internal::wasm {
-
-class CachedAssemblerBuffer;
-
-// Creating assembler buffers can be expensive, in particular if PKU is used,
-// which requires an {mmap} and {pkey_protect} system call for each new buffer.
-// Hence pool-allocate a larger memory region and reuse it if assembler buffers
-// are freed.
-class AssemblerBufferCache final {
- public:
-  ~AssemblerBufferCache();
-  std::unique_ptr<AssemblerBuffer> GetAssemblerBuffer(int size);
-
- private:
-  friend class CachedAssemblerBuffer;
-
-  // Called when CachedAssemblerBuffers get destroyed, to return memory to the
-  // cache.
-  void Return(base::AddressRegion);
-
-  DisjointAllocationPool available_memory_;
-  int total_allocated_ = 0;
-};
-
-}  // namespace v8::internal::wasm
-
-#endif  // V8_WASM_ASSEMBLER_BUFFER_CACHE_H_
diff --git a/deps/v8/src/wasm/baseline/DEPS b/deps/v8/src/wasm/baseline/DEPS
deleted file mode 100644
index c2651fbd171594..00000000000000
--- a/deps/v8/src/wasm/baseline/DEPS
+++ /dev/null
@@ -1,5 +0,0 @@
-# Liftoff (the baseline compiler for WebAssembly) depends on some compiler
-# internals, like the linkage location for parameters and returns.
-include_rules = [
-  "+src/compiler/linkage.h",
-]
diff --git a/deps/v8/src/wasm/baseline/arm/liftoff-assembler-arm.h b/deps/v8/src/wasm/baseline/arm/liftoff-assembler-arm.h
index c0feba5069f9ed..b4e16d9e5729dc 100644
--- a/deps/v8/src/wasm/baseline/arm/liftoff-assembler-arm.h
+++ b/deps/v8/src/wasm/baseline/arm/liftoff-assembler-arm.h
@@ -11,6 +11,7 @@
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
 #include "src/wasm/baseline/liftoff-register.h"
+#include "src/wasm/object-access.h"
 #include "src/wasm/wasm-objects.h"
 
 namespace v8 {
@@ -420,6 +421,40 @@ inline void EmitAnyTrue(LiftoffAssembler* assm, LiftoffRegister dst,
   assm->mov(dst.gp(), Operand(1), LeaveCC, ne);
 }
 
+class CacheStatePreservingTempRegisters {
+ public:
+  explicit CacheStatePreservingTempRegisters(LiftoffAssembler* assm,
+                                             LiftoffRegList pinned = {})
+      : assm_(assm), pinned_(pinned) {}
+
+  ~CacheStatePreservingTempRegisters() {
+    for (Register reg : must_pop_) {
+      assm_->Pop(reg);
+    }
+  }
+
+  Register Acquire() {
+    if (assm_->cache_state()->has_unused_register(kGpReg, pinned_)) {
+      return pinned_.set(
+          assm_->cache_state()->unused_register(kGpReg, pinned_).gp());
+    }
+
+    RegList available =
+        kLiftoffAssemblerGpCacheRegs - pinned_.GetGpList() - must_pop_;
+    DCHECK(!available.is_empty());
+    // Use {last()} here so we can just iterate forwards in the destructor.
+    Register reg = available.last();
+    assm_->Push(reg);
+    must_pop_.set(reg);
+    return reg;
+  }
+
+ private:
+  LiftoffAssembler* const assm_;
+  LiftoffRegList pinned_;
+  RegList must_pop_;
+};
+
 }  // namespace liftoff
 
 int LiftoffAssembler::PrepareStackFrame() {
@@ -581,6 +616,40 @@ bool LiftoffAssembler::NeedsAlignment(ValueKind kind) {
   return kind == kS128 || is_reference(kind);
 }
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  {
+    liftoff::CacheStatePreservingTempRegisters temps{this};
+    Register budget_array = temps.Acquire();
+
+    Register instance = cache_state_.cached_instance;
+    if (instance == no_reg) {
+      instance = budget_array;  // Reuse the temp register.
+      LoadInstanceFromFrame(instance);
+    }
+
+    constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+        WasmInstanceObject::kTieringBudgetArrayOffset);
+    ldr(budget_array, MemOperand{instance, kArrayOffset});
+
+    int budget_arr_offset = kInt32Size * declared_func_index;
+    // If the offset cannot be used in the operand directly, add it once to the
+    // budget array to avoid doing this multiple times below.
+    if (!ImmediateFitsAddrMode2Instruction(budget_arr_offset)) {
+      add(budget_array, budget_array, Operand{budget_arr_offset});
+      budget_arr_offset = 0;
+    }
+
+    Register budget = temps.Acquire();
+    MemOperand budget_addr{budget_array, budget_arr_offset};
+    ldr(budget, budget_addr);
+    sub(budget, budget, Operand{budget_used}, SetCC);
+    str(budget, budget_addr);
+  }
+  b(ool_label, mi);
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -634,6 +703,22 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   ldr(dst, MemOperand{instance, offset});
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, ExternalPointerTag tag,
+                                           Register scratch) {
+  LoadFullPointer(dst, src_addr, offset);
+}
+
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register scratch) {
+  UseScratchRegisterScope temps(this);
+  MemOperand src_op = liftoff::GetMemOp(this, &temps, src_addr, index, offset,
+                                        kSystemPointerSizeLog2);
+  ldr(dst, src_op);
+}
+
 void LiftoffAssembler::SpillInstance(Register instance) {
   str(instance, liftoff::GetInstanceOperand());
 }
@@ -1392,38 +1477,11 @@ void LiftoffAssembler::LoadReturnStackSlot(LiftoffRegister dst, int offset,
   liftoff::Load(this, dst, src, kind);
 }
 
-class CacheStatePreservingTempRegister {
- public:
-  explicit CacheStatePreservingTempRegister(LiftoffAssembler& assm)
-      : assm_(assm) {}
-
-  ~CacheStatePreservingTempRegister() {
-    if (must_pop_) assm_.Pop(reg_);
-  }
-
-  Register Get() {
-    DCHECK_EQ(reg_, no_reg);  // This implementation supports only one register.
-    if (assm_.cache_state()->has_unused_register(kGpReg)) {
-      reg_ = assm_.cache_state()->unused_register(kGpReg).gp();
-    } else {
-      reg_ = r0;
-      assm_.Push(reg_);
-      must_pop_ = true;
-    }
-    return reg_;
-  }
-
- private:
-  Register reg_ = no_reg;
-  LiftoffAssembler& assm_;
-  bool must_pop_ = false;
-};
-
 void LiftoffAssembler::MoveStackValue(uint32_t dst_offset, uint32_t src_offset,
                                       ValueKind kind) {
   DCHECK_NE(dst_offset, src_offset);
-  CacheStatePreservingTempRegister temp(*this);
-  Register scratch = temp.Get();
+  liftoff::CacheStatePreservingTempRegisters temps{this};
+  Register scratch = temps.Acquire();
   const int kRegSize = 4;
   DCHECK_EQ(0, SlotSizeForType(kind) % kRegSize);
   int words = SlotSizeForType(kind) / kRegSize;
@@ -1476,12 +1534,12 @@ void LiftoffAssembler::Spill(int offset, WasmValue value) {
   RecordUsedSpillOffset(offset);
   MemOperand dst = liftoff::GetStackSlot(offset);
   UseScratchRegisterScope assembler_temps(this);
-  CacheStatePreservingTempRegister liftoff_temp(*this);
+  liftoff::CacheStatePreservingTempRegisters liftoff_temps{this};
   Register src = no_reg;
   // The scratch register will be required by str if multiple instructions
   // are required to encode the offset, and so we cannot use it in that case.
   if (!ImmediateFitsAddrMode2Instruction(dst.offset())) {
-    src = liftoff_temp.Get();
+    src = liftoff_temps.Acquire();
   } else {
     src = assembler_temps.Acquire();
   }
@@ -2297,13 +2355,6 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
   b(label, cond);
 }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  sub(value, value, Operand(subtrahend), SetCC);
-  b(result_negative, mi);
-}
-
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
   clz(dst, src);
   mov(dst, Operand(dst, LSR, kRegSizeInBitsLog2));
@@ -4229,40 +4280,52 @@ void LiftoffAssembler::emit_f32x4_qfma(LiftoffRegister dst,
                                        LiftoffRegister src1,
                                        LiftoffRegister src2,
                                        LiftoffRegister src3) {
-  vmul(liftoff::GetSimd128Register(dst), liftoff::GetSimd128Register(src1),
+  UseScratchRegisterScope temps(this);
+  Simd128Register scratch =
+      dst == src3 ? temps.AcquireQ() : liftoff::GetSimd128Register(dst);
+  vmul(scratch, liftoff::GetSimd128Register(src1),
        liftoff::GetSimd128Register(src2));
   vadd(liftoff::GetSimd128Register(dst), liftoff::GetSimd128Register(src3),
-       liftoff::GetSimd128Register(dst));
+       scratch);
 }
 
 void LiftoffAssembler::emit_f32x4_qfms(LiftoffRegister dst,
                                        LiftoffRegister src1,
                                        LiftoffRegister src2,
                                        LiftoffRegister src3) {
-  vmul(liftoff::GetSimd128Register(dst), liftoff::GetSimd128Register(src1),
+  UseScratchRegisterScope temps(this);
+  Simd128Register scratch =
+      dst == src3 ? temps.AcquireQ() : liftoff::GetSimd128Register(dst);
+  vmul(scratch, liftoff::GetSimd128Register(src1),
        liftoff::GetSimd128Register(src2));
   vsub(liftoff::GetSimd128Register(dst), liftoff::GetSimd128Register(src3),
-       liftoff::GetSimd128Register(dst));
+       scratch);
 }
 
 void LiftoffAssembler::emit_f64x2_qfma(LiftoffRegister dst,
                                        LiftoffRegister src1,
                                        LiftoffRegister src2,
                                        LiftoffRegister src3) {
-  vmul(dst.low_fp(), src1.low_fp(), src2.low_fp());
-  vmul(dst.high_fp(), src1.high_fp(), src2.high_fp());
-  vadd(dst.low_fp(), src3.low_fp(), dst.low_fp());
-  vadd(dst.high_fp(), src3.high_fp(), dst.high_fp());
+  UseScratchRegisterScope temps(this);
+  Simd128Register scratch =
+      dst == src3 ? temps.AcquireQ() : liftoff::GetSimd128Register(dst);
+  vmul(scratch.low(), src1.low_fp(), src2.low_fp());
+  vmul(scratch.high(), src1.high_fp(), src2.high_fp());
+  vadd(dst.low_fp(), src3.low_fp(), scratch.low());
+  vadd(dst.high_fp(), src3.high_fp(), scratch.high());
 }
 
 void LiftoffAssembler::emit_f64x2_qfms(LiftoffRegister dst,
                                        LiftoffRegister src1,
                                        LiftoffRegister src2,
                                        LiftoffRegister src3) {
-  vmul(dst.low_fp(), src1.low_fp(), src2.low_fp());
-  vmul(dst.high_fp(), src1.high_fp(), src2.high_fp());
-  vsub(dst.low_fp(), src3.low_fp(), dst.low_fp());
-  vsub(dst.high_fp(), src3.high_fp(), dst.high_fp());
+  UseScratchRegisterScope temps(this);
+  Simd128Register scratch =
+      dst == src3 ? temps.AcquireQ() : liftoff::GetSimd128Register(dst);
+  vmul(scratch.low(), src1.low_fp(), src2.low_fp());
+  vmul(scratch.high(), src1.high_fp(), src2.high_fp());
+  vsub(dst.low_fp(), src3.low_fp(), scratch.low());
+  vsub(dst.high_fp(), src3.high_fp(), scratch.high());
 }
 
 void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
@@ -4271,11 +4334,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   b(ool_code, ls);
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  PrepareCallCFunction(0, 0);
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   // Asserts unreachable within the wasm code.
   MacroAssembler::AssertUnreachable(reason);
@@ -4330,13 +4388,15 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetLastRegSet();
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetLastRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -4349,9 +4409,8 @@ void LiftoffAssembler::DropStackSlotsAndRet(uint32_t num_stack_slots) {
   Ret();
 }
 
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   // Arguments are passed by pushing them all to the stack and then passing
@@ -4360,34 +4419,33 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
   // Reserve space in the stack.
   AllocateStackSpace(stack_bytes);
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    switch (param_kind) {
-      case kI32:
-        str(args->gp(), MemOperand(sp, arg_bytes));
-        break;
-      case kI64:
-        str(args->low_gp(), MemOperand(sp, arg_bytes));
-        str(args->high_gp(), MemOperand(sp, arg_bytes + kSystemPointerSize));
-        break;
-      case kF32:
-        vstr(liftoff::GetFloatRegister(args->fp()), MemOperand(sp, arg_bytes));
-        break;
-      case kF64:
-        vstr(args->fp(), MemOperand(sp, arg_bytes));
-        break;
-      case kS128:
-        vstr(args->low_fp(), MemOperand(sp, arg_bytes));
-        vstr(args->high_fp(),
-             MemOperand(sp, arg_bytes + 2 * kSystemPointerSize));
-        break;
-      default:
-        UNREACHABLE();
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    MemOperand dst{sp, arg_offset};
+    if (arg.is_reg()) {
+      liftoff::Store(this, arg.reg(), dst, arg.kind());
+    } else if (arg.is_const()) {
+      DCHECK_EQ(kI32, arg.kind());
+      UseScratchRegisterScope temps(this);
+      Register src = temps.Acquire();
+      mov(src, Operand(arg.i32_const()));
+      str(src, dst);
+    } else {
+      // Stack to stack move.
+      UseScratchRegisterScope temps(this);
+      Register scratch = temps.Acquire();
+      MemOperand src = liftoff::GetStackSlot(arg.offset());
+      int words = SlotSizeForType(arg.kind()) / kSystemPointerSize;
+      do {
+        ldr(scratch, src);
+        str(scratch, dst);
+        src.set_offset(src.offset() + kSystemPointerSize);
+        dst.set_offset(dst.offset() + kSystemPointerSize);
+      } while (--words > 0);
     }
-    args++;
-    arg_bytes += value_kind_size(param_kind);
+    arg_offset += value_kind_size(arg.kind());
   }
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   mov(r0, sp);
@@ -4399,38 +4457,17 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = r0;
     if (kReturnReg != rets->gp()) {
-      Move(*rets, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*rets, LiftoffRegister(kReturnReg), return_kind);
     }
     result_reg++;
   }
 
   // Load potential output value from the buffer on the stack.
   if (out_argument_kind != kVoid) {
-    switch (out_argument_kind) {
-      case kI32:
-        ldr(result_reg->gp(), MemOperand(sp));
-        break;
-      case kI64:
-        ldr(result_reg->low_gp(), MemOperand(sp));
-        ldr(result_reg->high_gp(), MemOperand(sp, kSystemPointerSize));
-        break;
-      case kF32:
-        vldr(liftoff::GetFloatRegister(result_reg->fp()), MemOperand(sp));
-        break;
-      case kF64:
-        vldr(result_reg->fp(), MemOperand(sp));
-        break;
-      case kS128:
-        vld1(Neon8, NeonListOperand(result_reg->low_fp(), 2),
-             NeonMemOperand(sp));
-        break;
-      default:
-        UNREACHABLE();
-    }
+    liftoff::Load(this, *result_reg, MemOperand{sp}, out_argument_kind);
   }
   add(sp, sp, Operand(stack_bytes));
 }
diff --git a/deps/v8/src/wasm/baseline/arm64/liftoff-assembler-arm64.h b/deps/v8/src/wasm/baseline/arm64/liftoff-assembler-arm64.h
index b53083e0abb8b0..8dc8c846401618 100644
--- a/deps/v8/src/wasm/baseline/arm64/liftoff-assembler-arm64.h
+++ b/deps/v8/src/wasm/baseline/arm64/liftoff-assembler-arm64.h
@@ -8,6 +8,7 @@
 #include "src/base/v8-fallthrough.h"
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
+#include "src/wasm/object-access.h"
 #include "src/wasm/wasm-objects.h"
 
 namespace v8 {
@@ -392,6 +393,46 @@ bool LiftoffAssembler::NeedsAlignment(ValueKind kind) {
   return kind == kS128 || is_reference(kind);
 }
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  UseScratchRegisterScope temps{this};
+  Register budget_array = temps.AcquireX();
+
+  Register instance = cache_state_.cached_instance;
+  if (instance == no_reg) {
+    instance = budget_array;  // Reuse the temp register.
+    LoadInstanceFromFrame(instance);
+  }
+
+  constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+      WasmInstanceObject::kTieringBudgetArrayOffset);
+  ldr(budget_array, MemOperand{instance, kArrayOffset});
+
+  int budget_arr_offset = kInt32Size * declared_func_index;
+  // If the offset cannot be used in the operand directly, add it once to the
+  // budget_array to avoid doing that two times below.
+  if (!IsImmLSScaled(budget_arr_offset, 2 /* log2(sizeof(i32)) */) &&
+      !IsImmLSUnscaled(budget_arr_offset)) {
+    Add(budget_array, budget_array, budget_arr_offset);
+    budget_arr_offset = 0;
+  }
+
+  Register budget = temps.AcquireW();
+  MemOperand budget_addr{budget_array, budget_arr_offset};
+  ldr(budget, budget_addr);
+  // Make sure that the {budget_used} can be used as an immediate for SUB.
+  if (budget_used > 0xFFF000) {
+    budget_used = 0xFFF000;  // 16'773'120
+  } else if (budget_used > 0xFFF) {
+    budget_used &= 0xFFF000;
+  }
+  DCHECK(IsImmAddSub(budget_used));
+  AddSub(budget, budget, Operand{budget_used}, SetFlags, SUB);
+  str(budget, budget_addr);
+  B(ool_label, mi);
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -441,13 +482,23 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   LoadTaggedField(dst, MemOperand{instance, offset});
 }
 
-void LiftoffAssembler::LoadExternalPointer(Register dst, Register instance,
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
                                            int offset, ExternalPointerTag tag,
                                            Register /* scratch */) {
-  LoadExternalPointerField(dst, FieldMemOperand(instance, offset), tag,
+  LoadExternalPointerField(dst, MemOperand{src_addr, offset}, tag,
                            kRootRegister);
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register /* scratch */) {
+  UseScratchRegisterScope temps(this);
+  MemOperand src_op = liftoff::GetMemOp(this, &temps, src_addr, index, offset,
+                                        false, V8_ENABLE_SANDBOX_BOOL ? 2 : 3);
+  LoadExternalPointerField(dst, src_op, tag, kRootRegister);
+}
+
 void LiftoffAssembler::SpillInstance(Register instance) {
   Str(instance, liftoff::GetInstanceOperand());
 }
@@ -1734,13 +1785,6 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
   B(label, cond);
 }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  Subs(value.W(), value.W(), Immediate(subtrahend));
-  B(result_negative, mi);
-}
-
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
   Cmp(src.W(), wzr);
   Cset(dst.W(), eq);
@@ -1790,7 +1834,27 @@ bool LiftoffAssembler::emit_select(LiftoffRegister dst, Register condition,
                                    LiftoffRegister true_value,
                                    LiftoffRegister false_value,
                                    ValueKind kind) {
-  return false;
+  if (kind != kI32 && kind != kI64 && kind != kF32 && kind != kF64)
+    return false;
+
+  Cmp(condition.W(), wzr);
+  switch (kind) {
+    default:
+      UNREACHABLE();
+    case kI32:
+      Csel(dst.gp().W(), true_value.gp().W(), false_value.gp().W(), ne);
+      break;
+    case kI64:
+      Csel(dst.gp().X(), true_value.gp().X(), false_value.gp().X(), ne);
+      break;
+    case kF32:
+      Fcsel(dst.fp().S(), true_value.fp().S(), false_value.fp().S(), ne);
+      break;
+    case kF64:
+      Fcsel(dst.fp().D(), true_value.fp().D(), false_value.fp().D(), ne);
+      break;
+  }
+  return true;
 }
 
 void LiftoffAssembler::emit_smi_check(Register obj, Label* target,
@@ -2421,17 +2485,7 @@ void LiftoffAssembler::emit_i32x4_alltrue(LiftoffRegister dst,
 
 void LiftoffAssembler::emit_i32x4_bitmask(LiftoffRegister dst,
                                           LiftoffRegister src) {
-  UseScratchRegisterScope temps(this);
-  VRegister tmp = temps.AcquireQ();
-  VRegister mask = temps.AcquireQ();
-
-  Sshr(tmp.V4S(), src.fp().V4S(), 31);
-  // Set i-th bit of each lane i. When AND with tmp, the lanes that
-  // are signed will have i-th bit set, unsigned will be 0.
-  Movi(mask.V2D(), 0x0000'0008'0000'0004, 0x0000'0002'0000'0001);
-  And(tmp.V16B(), mask.V16B(), tmp.V16B());
-  Addv(tmp.S(), tmp.V4S());
-  Mov(dst.gp().W(), tmp.V4S(), 0);
+  I32x4BitMask(dst.gp(), src.fp());
 }
 
 void LiftoffAssembler::emit_i32x4_shl(LiftoffRegister dst, LiftoffRegister lhs,
@@ -2597,17 +2651,7 @@ void LiftoffAssembler::emit_i16x8_alltrue(LiftoffRegister dst,
 
 void LiftoffAssembler::emit_i16x8_bitmask(LiftoffRegister dst,
                                           LiftoffRegister src) {
-  UseScratchRegisterScope temps(this);
-  VRegister tmp = temps.AcquireQ();
-  VRegister mask = temps.AcquireQ();
-
-  Sshr(tmp.V8H(), src.fp().V8H(), 15);
-  // Set i-th bit of each lane i. When AND with tmp, the lanes that
-  // are signed will have i-th bit set, unsigned will be 0.
-  Movi(mask.V2D(), 0x0080'0040'0020'0010, 0x0008'0004'0002'0001);
-  And(tmp.V16B(), mask.V16B(), tmp.V16B());
-  Addv(tmp.H(), tmp.V8H());
-  Mov(dst.gp().W(), tmp.V8H(), 0);
+  I16x8BitMask(dst.gp(), src.fp());
 }
 
 void LiftoffAssembler::emit_i16x8_shl(LiftoffRegister dst, LiftoffRegister lhs,
@@ -2803,19 +2847,7 @@ void LiftoffAssembler::emit_i8x16_alltrue(LiftoffRegister dst,
 
 void LiftoffAssembler::emit_i8x16_bitmask(LiftoffRegister dst,
                                           LiftoffRegister src) {
-  UseScratchRegisterScope temps(this);
-  VRegister tmp = temps.AcquireQ();
-  VRegister mask = temps.AcquireQ();
-
-  // Set i-th bit of each lane i. When AND with tmp, the lanes that
-  // are signed will have i-th bit set, unsigned will be 0.
-  Sshr(tmp.V16B(), src.fp().V16B(), 7);
-  Movi(mask.V2D(), 0x8040'2010'0804'0201);
-  And(tmp.V16B(), mask.V16B(), tmp.V16B());
-  Ext(mask.V16B(), tmp.V16B(), tmp.V16B(), 8);
-  Zip1(tmp.V16B(), tmp.V16B(), mask.V16B());
-  Addv(tmp.H(), tmp.V8H());
-  Mov(dst.gp().W(), tmp.V8H(), 0);
+  I8x16BitMask(dst.gp(), src.fp());
 }
 
 void LiftoffAssembler::emit_i8x16_shl(LiftoffRegister dst, LiftoffRegister lhs,
@@ -3403,10 +3435,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   B(ool_code, ls);
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   MacroAssembler::AssertUnreachable(reason);
 }
@@ -3424,18 +3452,20 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  bool needs_padding = (all_spills.GetGpList().Count() & 1) != 0;
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  bool needs_padding = (gp_spills.GetNumRegsSet() & 1) != 0;
   if (needs_padding) {
     spill_space_size += kSystemPointerSize;
     ++spill_offset;
   }
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetLastRegSet();
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetLastRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -3448,9 +3478,8 @@ void LiftoffAssembler::DropStackSlotsAndRet(uint32_t num_stack_slots) {
   Ret();
 }
 
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   // The stack pointer is required to be quadword aligned.
@@ -3458,12 +3487,36 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
   // Reserve space in the stack.
   Claim(total_size, 1);
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    Poke(liftoff::GetRegFromType(*args++, param_kind), arg_bytes);
-    arg_bytes += value_kind_size(param_kind);
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    UseScratchRegisterScope temps(this);
+    CPURegister src = no_reg;
+    if (arg.is_reg()) {
+      src = liftoff::GetRegFromType(arg.reg(), arg.kind());
+    } else if (arg.is_const()) {
+      if (arg.kind() == kI32) {
+        if (arg.i32_const() == 0) {
+          src = wzr;
+        } else {
+          src = temps.AcquireW();
+          Mov(src.W(), arg.i32_const());
+        }
+      } else {
+        if (arg.i32_const() == 0) {
+          src = xzr;
+        } else {
+          src = temps.AcquireX();
+          Mov(src.X(), static_cast<int64_t>(arg.i32_const()));
+        }
+      }
+    } else {
+      src = liftoff::AcquireByType(&temps, arg.kind());
+      Ldr(src, liftoff::GetStackSlot(arg.offset()));
+    }
+    Poke(src, arg_offset);
+    arg_offset += value_kind_size(arg.kind());
   }
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   Mov(x0, sp);
@@ -3474,11 +3527,10 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* next_result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = x0;
     if (kReturnReg != next_result_reg->gp()) {
-      Move(*next_result_reg, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
     }
     ++next_result_reg;
   }
diff --git a/deps/v8/src/wasm/baseline/ia32/liftoff-assembler-ia32.h b/deps/v8/src/wasm/baseline/ia32/liftoff-assembler-ia32.h
index c3ecfcaab70de5..ac5febd8c376b6 100644
--- a/deps/v8/src/wasm/baseline/ia32/liftoff-assembler-ia32.h
+++ b/deps/v8/src/wasm/baseline/ia32/liftoff-assembler-ia32.h
@@ -10,6 +10,7 @@
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
 #include "src/wasm/baseline/liftoff-register.h"
+#include "src/wasm/object-access.h"
 #include "src/wasm/simd-shuffle.h"
 #include "src/wasm/value-type.h"
 #include "src/wasm/wasm-objects.h"
@@ -163,6 +164,40 @@ inline void MoveStackValue(LiftoffAssembler* assm, const Operand& src,
   }
 }
 
+class CacheStatePreservingTempRegisters {
+ public:
+  explicit CacheStatePreservingTempRegisters(LiftoffAssembler* assm,
+                                             LiftoffRegList pinned = {})
+      : assm_(assm), pinned_(pinned) {}
+
+  ~CacheStatePreservingTempRegisters() {
+    for (Register reg : must_pop_) {
+      assm_->pop(reg);
+    }
+  }
+
+  Register Acquire() {
+    if (assm_->cache_state()->has_unused_register(kGpReg, pinned_)) {
+      return pinned_.set(
+          assm_->cache_state()->unused_register(kGpReg, pinned_).gp());
+    }
+
+    RegList available =
+        kLiftoffAssemblerGpCacheRegs - pinned_.GetGpList() - must_pop_;
+    DCHECK(!available.is_empty());
+    // Use {last()} here so we can just iterate forwards in the destructor.
+    Register reg = available.last();
+    assm_->push(reg);
+    must_pop_.set(reg);
+    return reg;
+  }
+
+ private:
+  LiftoffAssembler* const assm_;
+  LiftoffRegList pinned_;
+  RegList must_pop_;
+};
+
 constexpr DoubleRegister kScratchDoubleReg = xmm7;
 
 constexpr int kSubSpSize = 6;  // 6 bytes for "sub esp, <imm32>"
@@ -316,6 +351,29 @@ bool LiftoffAssembler::NeedsAlignment(ValueKind kind) {
   return is_reference(kind);
 }
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  {
+    liftoff::CacheStatePreservingTempRegisters temps{this};
+    Register budget_array = temps.Acquire();
+
+    Register instance = cache_state_.cached_instance;
+    if (instance == no_reg) {
+      instance = budget_array;  // Reuse the temp register.
+      LoadInstanceFromFrame(instance);
+    }
+
+    constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+        WasmInstanceObject::kTieringBudgetArrayOffset);
+    mov(budget_array, Operand{instance, kArrayOffset});
+
+    int array_offset = kInt32Size * declared_func_index;
+    sub(Operand{budget_array, array_offset}, Immediate(budget_used));
+  }
+  j(negative, ool_label);
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -366,6 +424,20 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   mov(dst, Operand{instance, offset});
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, ExternalPointerTag tag,
+                                           Register scratch) {
+  LoadFullPointer(dst, src_addr, offset);
+}
+
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register scratch) {
+  Operand src_op = Operand(src_addr, index, times_4, offset);
+  mov(dst, src_op);
+}
+
 void LiftoffAssembler::SpillInstance(Register instance) {
   mov(liftoff::GetInstanceOperand(), instance);
 }
@@ -525,10 +597,21 @@ void LiftoffAssembler::Store(Register dst_addr, Register offset_reg,
         // {offset_reg}.
         LiftoffRegList pinned_byte = pinned | LiftoffRegList{dst_addr};
         if (offset_reg != no_reg) pinned_byte.set(offset_reg);
-        Register byte_src =
-            GetUnusedRegister(liftoff::kByteRegs.MaskOut(pinned_byte)).gp();
-        mov(byte_src, src.gp());
-        mov_b(dst_op, byte_src);
+        LiftoffRegList candidates = liftoff::kByteRegs.MaskOut(pinned_byte);
+        if (!candidates.is_empty()) {
+          Register byte_src = GetUnusedRegister(candidates).gp();
+          mov(byte_src, src.gp());
+          mov_b(dst_op, byte_src);
+        } else {
+          // We have no available byte register. We will temporarily push the
+          // root register to use it as a scratch register.
+          static_assert(kRootRegister == ebx);
+          Register byte_src = kRootRegister;
+          Push(byte_src);
+          mov(byte_src, src.gp());
+          mov_b(dst_op, byte_src);
+          Pop(byte_src);
+        }
       }
       break;
     case StoreType::kI64Store16:
@@ -2494,13 +2577,6 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
   j(cond, label);
 }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  sub(value, Immediate(subtrahend));
-  j(negative, result_negative);
-}
-
 namespace liftoff {
 
 // Setcc into dst register, given a scratch byte register (might be the same as
@@ -2711,12 +2787,12 @@ void EmitSimdShiftOp(LiftoffAssembler* assm, LiftoffRegister dst,
   }
 }
 
-template <void (Assembler::*avx_op)(XMMRegister, XMMRegister, byte),
-          void (Assembler::*sse_op)(XMMRegister, byte), uint8_t width>
+template <void (Assembler::*avx_op)(XMMRegister, XMMRegister, uint8_t),
+          void (Assembler::*sse_op)(XMMRegister, uint8_t), uint8_t width>
 void EmitSimdShiftOpImm(LiftoffAssembler* assm, LiftoffRegister dst,
                         LiftoffRegister operand, int32_t count) {
   constexpr int mask = (1 << width) - 1;
-  byte shift = static_cast<byte>(count & mask);
+  uint8_t shift = static_cast<uint8_t>(count & mask);
   if (CpuFeatures::IsSupported(AVX)) {
     CpuFeatureScope scope(assm, AVX);
     (assm->*avx_op)(dst.fp(), operand.fp(), shift);
@@ -4278,10 +4354,10 @@ void LiftoffAssembler::emit_f32x4_uconvert_i32x4(LiftoffRegister dst,
     psubd(dst.fp(), liftoff::kScratchDoubleReg);
   }
   Cvtdq2ps(liftoff::kScratchDoubleReg,
-           liftoff::kScratchDoubleReg);  // Convert lo exactly.
-  Psrld(dst.fp(), dst.fp(), byte{1});   // Divide by 2 to get in unsigned range.
-  Cvtdq2ps(dst.fp(), dst.fp());         // Convert hi, exactly.
-  Addps(dst.fp(), dst.fp(), dst.fp());  // Double hi, exactly.
+           liftoff::kScratchDoubleReg);   // Convert lo exactly.
+  Psrld(dst.fp(), dst.fp(), uint8_t{1});  // Div by 2 to get in unsigned range.
+  Cvtdq2ps(dst.fp(), dst.fp());           // Convert hi, exactly.
+  Addps(dst.fp(), dst.fp(), dst.fp());    // Double hi, exactly.
   Addps(dst.fp(), dst.fp(),
         liftoff::kScratchDoubleReg);  // Add hi and lo, may round.
 }
@@ -4583,11 +4659,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   j(below_equal, ool_code);
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  PrepareCallCFunction(0, GetUnusedRegister(kGpReg, {}).gp());
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   MacroAssembler::AssertUnreachable(reason);
 }
@@ -4635,13 +4706,15 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetFirstRegSet();
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetFirstRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -4655,19 +4728,35 @@ void LiftoffAssembler::DropStackSlotsAndRet(uint32_t num_stack_slots) {
   ret(static_cast<int>(num_stack_slots * kSystemPointerSize));
 }
 
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   AllocateStackSpace(stack_bytes);
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    liftoff::Store(this, esp, arg_bytes, *args++, param_kind);
-    arg_bytes += value_kind_size(param_kind);
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    if (arg.is_reg()) {
+      liftoff::Store(this, esp, arg_offset, arg.reg(), arg.kind());
+    } else if (arg.is_const()) {
+      DCHECK_EQ(kI32, arg.kind());
+      mov(Operand(esp, arg_offset), Immediate(arg.i32_const()));
+    } else if (value_kind_size(arg.kind()) == 4) {
+      // We do not have a scratch register, so move via the stack. Note that
+      // {push} decrements {esp} by 4 and {pop} increments it again, but the
+      // destionation operand uses the {esp} value after increasing.
+      push(liftoff::GetStackSlot(arg.offset()));
+      pop(Operand(esp, arg_offset));
+    } else {
+      DCHECK_EQ(8, value_kind_size(arg.kind()));
+      push(liftoff::GetStackSlot(arg.offset()));
+      pop(Operand(esp, arg_offset + 4));
+      push(liftoff::GetStackSlot(arg.offset() + 4));
+      pop(Operand(esp, arg_offset));
+    }
+    arg_offset += value_kind_size(arg.kind());
   }
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   constexpr Register kScratch = eax;
   constexpr Register kArgumentBuffer = ecx;
@@ -4684,11 +4773,10 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* next_result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = eax;
     if (kReturnReg != next_result_reg->gp()) {
-      Move(*next_result_reg, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
     }
     ++next_result_reg;
   }
diff --git a/deps/v8/src/wasm/baseline/liftoff-assembler.cc b/deps/v8/src/wasm/baseline/liftoff-assembler.cc
index 29120dd03ba9a5..524ccb51adfe36 100644
--- a/deps/v8/src/wasm/baseline/liftoff-assembler.cc
+++ b/deps/v8/src/wasm/baseline/liftoff-assembler.cc
@@ -10,7 +10,6 @@
 #include "src/base/platform/memory.h"
 #include "src/codegen/assembler-inl.h"
 #include "src/codegen/macro-assembler-inl.h"
-#include "src/compiler/linkage.h"
 #include "src/compiler/wasm-compiler.h"
 #include "src/utils/ostreams.h"
 #include "src/wasm/baseline/liftoff-register.h"
@@ -94,7 +93,6 @@ class StackTransferRecipe {
     // can eliminate a second {Execute} in the destructor.
     bool all_done = move_dst_regs_.is_empty() && load_dst_regs_.is_empty();
     V8_ASSUME(all_done);
-    USE(all_done);
   }
 
   V8_INLINE void Transfer(const VarState& dst, const VarState& src) {
@@ -127,8 +125,7 @@ class StackTransferRecipe {
     }
   }
 
-  V8_INLINE void LoadIntoRegister(LiftoffRegister dst,
-                                  const LiftoffAssembler::VarState& src) {
+  V8_INLINE void LoadIntoRegister(LiftoffRegister dst, const VarState& src) {
     if (src.is_reg()) {
       DCHECK_EQ(dst.reg_class(), src.reg_class());
       if (dst != src.reg()) MoveRegister(dst, src.reg(), src.kind());
@@ -140,8 +137,7 @@ class StackTransferRecipe {
     }
   }
 
-  void LoadI64HalfIntoRegister(LiftoffRegister dst,
-                               const LiftoffAssembler::VarState& src,
+  void LoadI64HalfIntoRegister(LiftoffRegister dst, const VarState& src,
                                RegPairHalf half) {
     // Use CHECK such that the remaining code is statically dead if
     // {kNeedI64RegPair} is false.
@@ -186,11 +182,19 @@ class StackTransferRecipe {
     }
     if (move_dst_regs_.has(dst)) {
       DCHECK_EQ(register_move(dst)->src, src);
-      // Non-fp registers can only occur with the exact same type.
-      DCHECK_IMPLIES(!dst.is_fp(), register_move(dst)->kind == kind);
-      // It can happen that one fp register holds both the f32 zero and the f64
-      // zero, as the initial value for local variables. Move the value as f64
-      // in that case.
+      // Check for compatible value kinds.
+      // - references can occur with mixed kRef / kRefNull kinds.
+      // - FP registers can only occur with mixed f32 / f64 kinds (if they hold
+      //   the initial zero value).
+      // - others must match exactly.
+      DCHECK_EQ(is_object_reference(register_move(dst)->kind),
+                is_object_reference(kind));
+      DCHECK_EQ(dst.is_fp(), register_move(dst)->kind == kF32 ||
+                                 register_move(dst)->kind == kF64);
+      if (!is_object_reference(kind) && !dst.is_fp()) {
+        DCHECK_EQ(register_move(dst)->kind, kind);
+      }
+      // Potentially upgrade an existing `kF32` move to a `kF64` move.
       if (kind == kF64) register_move(dst)->kind = kF64;
       return;
     }
@@ -214,8 +218,8 @@ class StackTransferRecipe {
     }
   }
 
-  void LoadStackSlot(LiftoffRegister dst, uint32_t stack_offset,
-                     ValueKind kind) {
+  void LoadStackSlot(LiftoffRegister dst, int stack_offset, ValueKind kind) {
+    V8_ASSUME(stack_offset > 0);
     if (load_dst_regs_.has(dst)) {
       // It can happen that we spilled the same register to different stack
       // slots, and then we reload them later into the same dst register.
@@ -223,6 +227,11 @@ class StackTransferRecipe {
       return;
     }
     load_dst_regs_.set(dst);
+    // Make sure that we only spill to positions after this stack offset to
+    // avoid overwriting the content.
+    if (stack_offset > last_spill_offset_) {
+      last_spill_offset_ = stack_offset;
+    }
     if (dst.is_gp_pair()) {
       DCHECK_EQ(kI64, kind);
       *register_load(dst.low()) =
@@ -410,7 +419,7 @@ enum ReuseRegisters : bool {
 // to set up the region such that later merges (via {MergeStackWith} /
 // {MergeFullStackWith} can successfully transfer their values to this new
 // state.
-void InitMergeRegion(LiftoffAssembler::CacheState* state,
+void InitMergeRegion(LiftoffAssembler::CacheState* target_state,
                      const VarState* source, VarState* target, uint32_t count,
                      MergeKeepStackSlots keep_stack_slots,
                      MergeAllowConstants allow_constants,
@@ -445,7 +454,7 @@ void InitMergeRegion(LiftoffAssembler::CacheState* state,
     bool needs_reg_transfer = true;
     if (allow_registers) {
       // First try: Keep the same register, if it's free.
-      if (source->is_reg() && state->is_free(source->reg())) {
+      if (source->is_reg() && target_state->is_free(source->reg())) {
         reg = source->reg();
         needs_reg_transfer = false;
       }
@@ -456,8 +465,8 @@ void InitMergeRegion(LiftoffAssembler::CacheState* state,
       }
       // Third try: Use any free register.
       RegClass rc = reg_class_for(source->kind());
-      if (!reg && state->has_unused_register(rc, used_regs)) {
-        reg = state->unused_register(rc, used_regs);
+      if (!reg && target_state->has_unused_register(rc, used_regs)) {
+        reg = target_state->unused_register(rc, used_regs);
       }
     }
     // See above: Recompute the stack offset if requested.
@@ -470,7 +479,7 @@ void InitMergeRegion(LiftoffAssembler::CacheState* state,
     if (reg) {
       if (needs_reg_transfer) transfers.LoadIntoRegister(*reg, *source);
       if (reuse_registers) register_reuse_map.Add(source->reg(), *reg);
-      state->inc_used(*reg);
+      target_state->inc_used(*reg);
       *target = VarState(source->kind(), *reg, target_offset);
     } else {
       // No free register; make this a stack slot.
@@ -505,8 +514,11 @@ LiftoffAssembler::CacheState LiftoffAssembler::MergeIntoNewState(
     target.SetInstanceCacheRegister(cache_state_.cached_instance);
   }
 
+  DCHECK_EQ(cache_state_.cached_mem_start == no_reg,
+            cache_state_.cached_mem_index == CacheState::kNoCachedMemIndex);
   if (cache_state_.cached_mem_start != no_reg) {
-    target.SetMemStartCacheRegister(cache_state_.cached_mem_start);
+    target.SetMemStartCacheRegister(cache_state_.cached_mem_start,
+                                    cache_state_.cached_mem_index);
   }
 
   uint32_t target_height = num_locals + stack_depth + arity;
@@ -867,7 +879,8 @@ void LiftoffAssembler::MergeFullStackWith(CacheState& target) {
   if (cache_state_.cached_instance != target.cached_instance) {
     target.ClearCachedInstanceRegister();
   }
-  if (cache_state_.cached_mem_start != target.cached_mem_start) {
+  if (cache_state_.cached_mem_index != target.cached_mem_index ||
+      cache_state_.cached_mem_start != target.cached_mem_start) {
     target.ClearCachedMemStartRegister();
   }
 }
@@ -910,29 +923,46 @@ void LiftoffAssembler::MergeStackWith(CacheState& target, uint32_t arity,
   // {StackTransferRecipe}. Remember whether the register content has to be
   // reloaded after executing the stack transfers.
   bool reload_instance = false;
+  // If the instance cache registers match, or the destination has no instance
+  // cache register, nothing needs to be done.
+  if (cache_state_.cached_instance != target.cached_instance &&
+      target.cached_instance != no_reg) {
+    // On forward jumps, just reset the cached register in the target state.
+    if (jump_direction == kForwardJump) {
+      target.ClearCachedInstanceRegister();
+    } else if (cache_state_.cached_instance != no_reg) {
+      // If the source has the instance cached but in the wrong register,
+      // execute a register move as part of the stack transfer.
+      transfers.MoveRegister(LiftoffRegister{target.cached_instance},
+                             LiftoffRegister{cache_state_.cached_instance},
+                             kIntPtrKind);
+    } else {
+      // Otherwise (the source state has no cached instance), we reload later.
+      reload_instance = true;
+    }
+  }
+
   bool reload_mem_start = false;
-  for (auto tuple :
-       {std::make_tuple(&reload_instance, cache_state_.cached_instance,
-                        &target.cached_instance),
-        std::make_tuple(&reload_mem_start, cache_state_.cached_mem_start,
-                        &target.cached_mem_start)}) {
-    bool* reload = std::get<0>(tuple);
-    Register src_reg = std::get<1>(tuple);
-    Register* dst_reg = std::get<2>(tuple);
-    // If the registers match, or the destination has no cache register, nothing
-    // needs to be done.
-    if (src_reg == *dst_reg || *dst_reg == no_reg) continue;
+  // If the cached memory start registers match, or the destination has no cache
+  // register, nothing needs to be done.
+  DCHECK_EQ(target.cached_mem_start == no_reg,
+            target.cached_mem_index == CacheState::kNoCachedMemIndex);
+  if ((cache_state_.cached_mem_start != target.cached_mem_start ||
+       cache_state_.cached_mem_index != target.cached_mem_index) &&
+      target.cached_mem_start != no_reg) {
     // On forward jumps, just reset the cached register in the target state.
     if (jump_direction == kForwardJump) {
-      target.ClearCacheRegister(dst_reg);
-    } else if (src_reg != no_reg) {
+      target.ClearCachedMemStartRegister();
+    } else if (cache_state_.cached_mem_index == target.cached_mem_index) {
+      DCHECK_NE(no_reg, cache_state_.cached_mem_start);
       // If the source has the content but in the wrong register, execute a
       // register move as part of the stack transfer.
-      transfers.MoveRegister(LiftoffRegister{*dst_reg},
-                             LiftoffRegister{src_reg}, kIntPtrKind);
+      transfers.MoveRegister(LiftoffRegister{target.cached_mem_start},
+                             LiftoffRegister{cache_state_.cached_mem_start},
+                             kIntPtrKind);
     } else {
       // Otherwise (the source state has no cached content), we reload later.
-      *reload = true;
+      reload_mem_start = true;
     }
   }
 
@@ -948,14 +978,25 @@ void LiftoffAssembler::MergeStackWith(CacheState& target, uint32_t arity,
     Register instance = target.cached_instance;
     if (instance == no_reg) {
       // We don't have the instance available yet. Store it into the target
-      // mem_start, so that we can load the mem_start from there.
+      // mem_start, so that we can load the mem0_start from there.
       instance = target.cached_mem_start;
       LoadInstanceFromFrame(instance);
     }
-    LoadFromInstance(
-        target.cached_mem_start, instance,
-        ObjectAccess::ToTagged(WasmInstanceObject::kMemoryStartOffset),
-        sizeof(size_t));
+    if (target.cached_mem_index == 0) {
+      LoadFromInstance(
+          target.cached_mem_start, instance,
+          ObjectAccess::ToTagged(WasmInstanceObject::kMemory0StartOffset),
+          sizeof(size_t));
+    } else {
+      LoadTaggedPointerFromInstance(
+          target.cached_mem_start, instance,
+          ObjectAccess::ToTagged(
+              WasmInstanceObject::kMemoryBasesAndSizesOffset));
+      int buffer_offset = wasm::ObjectAccess::ToTagged(ByteArray::kHeaderSize) +
+                          kSystemPointerSize * target.cached_mem_index * 2;
+      LoadFullPointer(target.cached_mem_start, target.cached_mem_start,
+                      buffer_offset);
+    }
 #ifdef V8_ENABLE_SANDBOX
     DecodeSandboxedPointer(target.cached_mem_start);
 #endif
@@ -1054,7 +1095,7 @@ void PrepareStackTransfers(const ValueKindSig* sig,
       const RegPairHalf half =
           is_gp_pair && lowered_idx == 0 ? kHighWord : kLowWord;
       --call_desc_input_idx;
-      compiler::LinkageLocation loc =
+      LinkageLocation loc =
           call_descriptor->GetInputLocation(call_desc_input_idx);
       if (loc.IsRegister()) {
         DCHECK(!loc.IsAnyRegister());
@@ -1196,7 +1237,7 @@ void LiftoffAssembler::FinishCall(const ValueKindSig* sig,
                                    kGpCacheRegList.GetFirstRegSet()};
     LiftoffRegList pinned;
     for (int pair_idx = 0; pair_idx < num_lowered_params; ++pair_idx) {
-      compiler::LinkageLocation loc =
+      LinkageLocation loc =
           call_descriptor->GetReturnLocation(call_desc_return_idx++);
       if (loc.IsRegister()) {
         DCHECK(!loc.IsAnyRegister());
@@ -1311,7 +1352,7 @@ void LiftoffAssembler::MoveToReturnLocationsMultiReturn(
     bool needs_gp_pair = needs_gp_reg_pair(return_kind);
     int num_lowered_params = 1 + needs_gp_pair;
     for (int pair_idx = 0; pair_idx < num_lowered_params; ++pair_idx) {
-      compiler::LinkageLocation loc =
+      LinkageLocation loc =
           descriptor->GetReturnLocation(call_desc_return_idx++);
       if (loc.IsCallerFrameSlot()) {
         RegPairHalf half = pair_idx == 0 ? kLowWord : kHighWord;
@@ -1332,7 +1373,7 @@ void LiftoffAssembler::MoveToReturnLocationsMultiReturn(
     int num_lowered_params = 1 + needs_gp_pair;
     for (int pair_idx = 0; pair_idx < num_lowered_params; ++pair_idx) {
       RegPairHalf half = pair_idx == 0 ? kLowWord : kHighWord;
-      compiler::LinkageLocation loc =
+      LinkageLocation loc =
           descriptor->GetReturnLocation(call_desc_return_idx++);
       if (loc.IsRegister()) {
         DCHECK(!loc.IsAnyRegister());
diff --git a/deps/v8/src/wasm/baseline/liftoff-assembler.h b/deps/v8/src/wasm/baseline/liftoff-assembler.h
index aef63c647bf71c..a8bd1b52f1884d 100644
--- a/deps/v8/src/wasm/baseline/liftoff-assembler.h
+++ b/deps/v8/src/wasm/baseline/liftoff-assembler.h
@@ -9,7 +9,6 @@
 #include <memory>
 
 #include "src/base/bits.h"
-#include "src/base/small-vector.h"
 #include "src/codegen/macro-assembler.h"
 #include "src/wasm/baseline/liftoff-assembler-defs.h"
 #include "src/wasm/baseline/liftoff-compiler.h"
@@ -114,16 +113,16 @@ class LiftoffAssembler : public MacroAssembler {
    public:
     enum Location : uint8_t { kStack, kRegister, kIntConst };
 
-    explicit VarState(ValueKind kind, int offset)
+    VarState(ValueKind kind, int offset)
         : loc_(kStack), kind_(kind), spill_offset_(offset) {
       DCHECK_LE(0, offset);
     }
-    explicit VarState(ValueKind kind, LiftoffRegister r, int offset)
+    VarState(ValueKind kind, LiftoffRegister r, int offset)
         : loc_(kRegister), kind_(kind), reg_(r), spill_offset_(offset) {
       DCHECK_EQ(r.reg_class(), reg_class_for(kind));
       DCHECK_LE(0, offset);
     }
-    explicit VarState(ValueKind kind, int32_t i32_const, int offset)
+    VarState(ValueKind kind, int32_t i32_const, int offset)
         : loc_(kIntConst),
           kind_(kind),
           i32_const_(i32_const),
@@ -211,8 +210,7 @@ class LiftoffAssembler : public MacroAssembler {
   ASSERT_TRIVIALLY_COPYABLE(VarState);
 
   struct CacheState {
-    explicit CacheState(Zone* zone)
-        : stack_state(ZoneAllocator<VarState>{zone}) {}
+    explicit CacheState(Zone* zone) : stack_state(zone) {}
 
     // Allow move construction and move assignment.
     CacheState(CacheState&&) V8_NOEXCEPT = default;
@@ -240,11 +238,15 @@ class LiftoffAssembler : public MacroAssembler {
 
     // TODO(jkummerow): Wrap all accesses to {stack_state} in accessors that
     // check {frozen}.
-    base::SmallVector<VarState, 16, ZoneAllocator<VarState>> stack_state;
+    SmallZoneVector<VarState, 16> stack_state;
     LiftoffRegList used_registers;
     uint32_t register_use_count[kAfterMaxLiftoffRegCode] = {0};
     LiftoffRegList last_spilled_regs;
     Register cached_instance = no_reg;
+    static constexpr int kNoCachedMemIndex = -1;
+    // The index of the cached memory start, or {kNoCachedMemIndex} if none is
+    // cached ({cached_mem_start} will be {no_reg} in that case).
+    int cached_mem_index = kNoCachedMemIndex;
     Register cached_mem_start = no_reg;
 #if DEBUG
     uint32_t frozen = 0;
@@ -313,6 +315,7 @@ class LiftoffAssembler : public MacroAssembler {
         DCHECK(candidates.has(cached_mem_start));
         reg = cached_mem_start;
         cached_mem_start = no_reg;
+        cached_mem_index = kNoCachedMemIndex;
       }
 
       LiftoffRegister ret{reg};
@@ -336,8 +339,10 @@ class LiftoffAssembler : public MacroAssembler {
       SetCacheRegister(&cached_instance, reg);
     }
 
-    void SetMemStartCacheRegister(Register reg) {
+    void SetMemStartCacheRegister(Register reg, int memory_index) {
       SetCacheRegister(&cached_mem_start, reg);
+      DCHECK_EQ(kNoCachedMemIndex, cached_mem_index);
+      cached_mem_index = memory_index;
     }
 
     Register TrySetCachedInstanceRegister(LiftoffRegList pinned) {
@@ -355,9 +360,9 @@ class LiftoffAssembler : public MacroAssembler {
       return new_cache_reg;
     }
 
-    void ClearCacheRegister(Register* cache) {
+    V8_INLINE void ClearCacheRegister(Register* cache) {
       DCHECK(!frozen);
-      DCHECK(cache == &cached_instance || cache == &cached_mem_start);
+      V8_ASSUME(cache == &cached_instance || cache == &cached_mem_start);
       if (*cache == no_reg) return;
       int liftoff_code = LiftoffRegister{*cache}.liftoff_code();
       DCHECK_EQ(1, register_use_count[liftoff_code]);
@@ -369,12 +374,16 @@ class LiftoffAssembler : public MacroAssembler {
     void ClearCachedInstanceRegister() { ClearCacheRegister(&cached_instance); }
 
     void ClearCachedMemStartRegister() {
+      V8_ASSUME(cached_mem_index == kNoCachedMemIndex || cached_mem_index >= 0);
+      if (cached_mem_index == kNoCachedMemIndex) return;
+      cached_mem_index = kNoCachedMemIndex;
+      DCHECK_NE(no_reg, cached_mem_start);
       ClearCacheRegister(&cached_mem_start);
     }
 
     void ClearAllCacheRegisters() {
-      ClearCacheRegister(&cached_instance);
-      ClearCacheRegister(&cached_mem_start);
+      ClearCachedInstanceRegister();
+      ClearCachedMemStartRegister();
     }
 
     void inc_used(LiftoffRegister reg) {
@@ -492,14 +501,17 @@ class LiftoffAssembler : public MacroAssembler {
     }
   }
 
-  V8_INLINE LiftoffRegister PopToRegister(LiftoffRegList pinned = {}) {
+  // Pop a VarState from the stack, updating the register use count accordingly.
+  V8_INLINE VarState PopVarState() {
     DCHECK(!cache_state_.stack_state.empty());
     VarState slot = cache_state_.stack_state.back();
     cache_state_.stack_state.pop_back();
-    if (V8_LIKELY(slot.is_reg())) {
-      cache_state_.dec_used(slot.reg());
-      return slot.reg();
-    }
+    if (V8_LIKELY(slot.is_reg())) cache_state_.dec_used(slot.reg());
+    return slot;
+  }
+
+  V8_INLINE LiftoffRegister PopToRegister(LiftoffRegList pinned = {}) {
+    VarState slot = PopVarState();
     return LoadToRegister(slot, pinned);
   }
 
@@ -685,6 +697,7 @@ class LiftoffAssembler : public MacroAssembler {
       if (r.is_gp() && cache_state_.cached_instance == r.gp()) {
         cache_state_.ClearCachedInstanceRegister();
       } else if (r.is_gp() && cache_state_.cached_mem_start == r.gp()) {
+        V8_ASSUME(cache_state_.cached_mem_index >= 0);
         cache_state_.ClearCachedMemStartRegister();
       } else {
         SpillRegister(r);
@@ -777,14 +790,19 @@ class LiftoffAssembler : public MacroAssembler {
   inline static int SlotSizeForType(ValueKind kind);
   inline static bool NeedsAlignment(ValueKind kind);
 
+  inline void CheckTierUp(int declared_func_index, int budget_used,
+                          Label* ool_label, const FreezeCacheState& frozen);
   inline void LoadConstant(LiftoffRegister, WasmValue);
   inline void LoadInstanceFromFrame(Register dst);
   inline void LoadFromInstance(Register dst, Register instance, int offset,
                                int size);
   inline void LoadTaggedPointerFromInstance(Register dst, Register instance,
                                             int offset);
-  inline void LoadExternalPointer(Register dst, Register instance, int offset,
+  inline void LoadExternalPointer(Register dst, Register src_addr, int offset,
                                   ExternalPointerTag tag, Register scratch);
+  inline void LoadExternalPointer(Register dst, Register src_addr, int offset,
+                                  Register index, ExternalPointerTag tag,
+                                  Register scratch);
   inline void SpillInstance(Register instance);
   inline void ResetOSRTarget();
   inline void LoadTaggedPointer(Register dst, Register src_addr,
@@ -1029,15 +1047,6 @@ class LiftoffAssembler : public MacroAssembler {
     }
   }
 
-  void emit_ptrsize_zeroextend_i32(Register dst, Register src) {
-    if (kSystemPointerSize == 8) {
-      emit_type_conversion(kExprI64UConvertI32, LiftoffRegister(dst),
-                           LiftoffRegister(src));
-    } else if (dst != src) {
-      Move(dst, src, kI32);
-    }
-  }
-
   // f32 binops.
   inline void emit_f32_add(DoubleRegister dst, DoubleRegister lhs,
                            DoubleRegister rhs);
@@ -1104,9 +1113,6 @@ class LiftoffAssembler : public MacroAssembler {
                              Register rhs, const FreezeCacheState& frozen);
   inline void emit_i32_cond_jumpi(Condition, Label*, Register lhs, int imm,
                                   const FreezeCacheState& frozen);
-  inline void emit_i32_subi_jump_negative(Register value, int subtrahend,
-                                          Label* result_negative,
-                                          const FreezeCacheState& frozen);
   // Set {dst} to 1 if condition holds, 0 otherwise.
   inline void emit_i32_eqz(Register dst, Register src);
   inline void emit_i32_set_cond(Condition, Register dst, Register lhs,
@@ -1590,8 +1596,6 @@ class LiftoffAssembler : public MacroAssembler {
 
   inline void StackCheck(Label* ool_code, Register limit_address);
 
-  inline void CallTrapCallbackForTesting();
-
   inline void AssertUnreachable(AbortReason reason);
 
   inline void PushRegisters(LiftoffRegList);
@@ -1608,9 +1612,10 @@ class LiftoffAssembler : public MacroAssembler {
   // this is the return value of the C function, stored in {rets[0]}. Further
   // outputs (specified in {sig->returns()}) are read from the buffer and stored
   // in the remaining {rets} registers.
-  inline void CallC(const ValueKindSig* sig, const LiftoffRegister* args,
-                    const LiftoffRegister* rets, ValueKind out_argument_kind,
-                    int stack_bytes, ExternalReference ext_ref);
+  inline void CallC(const std::initializer_list<VarState> args,
+                    const LiftoffRegister* rets, ValueKind return_kind,
+                    ValueKind out_argument_kind, int stack_bytes,
+                    ExternalReference ext_ref);
 
   inline void CallNativeWasmCode(Address addr);
   inline void TailCallNativeWasmCode(Address addr);
diff --git a/deps/v8/src/wasm/baseline/liftoff-compiler.cc b/deps/v8/src/wasm/baseline/liftoff-compiler.cc
index f0887de7d217dd..7a454375d06bfc 100644
--- a/deps/v8/src/wasm/baseline/liftoff-compiler.cc
+++ b/deps/v8/src/wasm/baseline/liftoff-compiler.cc
@@ -12,15 +12,15 @@
 #include "src/codegen/interface-descriptors-inl.h"
 #include "src/codegen/machine-type.h"
 #include "src/codegen/macro-assembler-inl.h"
-#include "src/compiler/linkage.h"
 #include "src/compiler/wasm-compiler.h"
 #include "src/logging/counters.h"
 #include "src/logging/log.h"
+#include "src/objects/contexts.h"
 #include "src/objects/smi.h"
+#include "src/roots/roots.h"
 #include "src/tracing/trace-event.h"
 #include "src/utils/ostreams.h"
 #include "src/utils/utils.h"
-#include "src/wasm/assembler-buffer-cache.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
 #include "src/wasm/baseline/liftoff-register.h"
 #include "src/wasm/function-body-decoder-impl.h"
@@ -36,9 +36,10 @@
 
 namespace v8::internal::wasm {
 
-constexpr auto kRegister = LiftoffAssembler::VarState::kRegister;
-constexpr auto kIntConst = LiftoffAssembler::VarState::kIntConst;
-constexpr auto kStack = LiftoffAssembler::VarState::kStack;
+using VarState = LiftoffAssembler::VarState;
+constexpr auto kRegister = VarState::kRegister;
+constexpr auto kIntConst = VarState::kIntConst;
+constexpr auto kStack = VarState::kStack;
 
 namespace {
 
@@ -92,9 +93,6 @@ struct assert_field_size {
 #define SCOPED_CODE_COMMENT(str) ((void)0)
 #endif
 
-constexpr LoadType::LoadTypeValue kPointerLoadType =
-    kSystemPointerSize == 8 ? LoadType::kI64Load : LoadType::kI32Load;
-
 constexpr ValueKind kIntPtrKind = LiftoffAssembler::kIntPtrKind;
 constexpr ValueKind kSmiKind = LiftoffAssembler::kSmiKind;
 
@@ -340,6 +338,7 @@ class LiftoffCompiler {
  public:
   using ValidationTag = Decoder::NoValidationTag;
   using Value = ValueBase<ValidationTag>;
+  static constexpr bool kUsesPoppedArgs = false;
 
   struct ElseState {
     explicit ElseState(Zone* zone) : label(zone), state(zone) {}
@@ -388,7 +387,7 @@ class LiftoffCompiler {
                                 const FunctionSig* sig) {
       const size_t size = sig->parameter_count() + sig->return_count();
       if (V8_UNLIKELY(size > kInlineStorage)) {
-        storage = zone->NewArray<ValueKind>(size);
+        storage = zone->AllocateArray<ValueKind>(size);
       }
       std::transform(sig->all().begin(), sig->all().end(), storage,
                      [](ValueType type) { return type.kind(); });
@@ -426,7 +425,7 @@ class LiftoffCompiler {
     LiftoffRegList regs_to_save;
     Register cached_instance;
     OutOfLineSafepointInfo* safepoint_info;
-    uint32_t pc;  // for trap handler.
+    uint32_t trapping_pc;  // The PC that should execute the OOL code on trap.
     // These two pointers will only be used for debug code:
     SpilledRegistersForInspection* spilled_registers;
     DebugSideTableBuilder::EntryBuilder* debug_sidetable_entry_builder;
@@ -446,7 +445,7 @@ class LiftoffCompiler {
           {},                            // regs_to_save
           no_reg,                        // cached_instance
           safepoint_info,                // safepoint_info
-          pc,                            // pc
+          pc,                            // trapping_pc
           spilled_registers,             // spilled_registers
           debug_sidetable_entry_builder  // debug_side_table_entry_builder
       };
@@ -464,7 +463,7 @@ class LiftoffCompiler {
           regs_to_save,                  // regs_to_save
           cached_instance,               // cached_instance
           safepoint_info,                // safepoint_info
-          0,                             // pc
+          0,                             // trapping_pc
           spilled_regs,                  // spilled_registers
           debug_sidetable_entry_builder  // debug_side_table_entry_builder
       };
@@ -482,7 +481,7 @@ class LiftoffCompiler {
           regs_to_save,                  // regs_to_save
           cached_instance,               // cached_instance
           safepoint_info,                // safepoint_info
-          0,                             // pc
+          0,                             // trapping_pc
           spilled_regs,                  // spilled_registers
           debug_sidetable_entry_builder  // debug_side_table_entry_builder
       };
@@ -521,6 +520,7 @@ class LiftoffCompiler {
     DCHECK_IMPLIES(
         next_breakpoint_ptr_ == next_breakpoint_end_,
         next_breakpoint_ptr_ == nullptr && next_breakpoint_end_ == nullptr);
+    DCHECK_IMPLIES(!for_debugging_, debug_sidetable_builder_ == nullptr);
   }
 
   bool did_bailout() const { return bailout_reason_ != kSuccess; }
@@ -719,14 +719,13 @@ class LiftoffCompiler {
     bool needs_gp_pair_;
     ValueKind reg_kind_;
     RegClass rc_;
-    compiler::LinkageLocation location_{
-        compiler::LinkageLocation::ForAnyRegister()};
+    LinkageLocation location_{LinkageLocation::ForAnyRegister()};
     LiftoffRegList param_regs_;
   };
 
   void StackCheck(FullDecoder* decoder, WasmCodePosition position) {
     CODE_COMMENT("stack check");
-    if (!v8_flags.wasm_stack_checks || !env_->runtime_exception_support) return;
+    if (!v8_flags.wasm_stack_checks) return;
 
     // Loading the limit address can change the stack state, hence do this
     // before storing information about registers.
@@ -770,47 +769,17 @@ class LiftoffCompiler {
   }
 
   void TierupCheck(FullDecoder* decoder, WasmCodePosition position,
-                   int budget_used, Register tmp1, Register tmp2) {
+                   int budget_used) {
     // We should always decrement the budget, and we don't expect integer
     // overflows in the budget calculation.
     DCHECK_LE(1, budget_used);
 
     if (for_debugging_ != kNotForDebugging) return;
-    CODE_COMMENT("tierup check");
+    SCOPED_CODE_COMMENT("tierup check");
     // We never want to blow the entire budget at once.
     const int kMax = v8_flags.wasm_tiering_budget / 4;
     if (budget_used > kMax) budget_used = kMax;
 
-    LiftoffRegister budget_reg(tmp2);
-    // Be careful not to cause caching of the instance.
-    Register instance = __ cache_state()->cached_instance;
-    if (instance == no_reg) {
-      instance = tmp1;
-      __ LoadInstanceFromFrame(instance);
-    }
-    constexpr int kArraySize = kSystemPointerSize;
-    constexpr int kArrayOffset =
-        WASM_INSTANCE_OBJECT_FIELD_OFFSET(TieringBudgetArray);
-    static_assert(WASM_INSTANCE_OBJECT_FIELD_SIZE(TieringBudgetArray) ==
-                  kArraySize);
-    Register array_reg = tmp1;  // Overwriting {instance}.
-    __ LoadFromInstance(array_reg, instance, kArrayOffset, kArraySize);
-    uint32_t offset =
-        kInt32Size * declared_function_index(env_->module, func_index_);
-#if V8_TARGET_ARCH_ARM || V8_TARGET_ARCH_ARM64
-    // Platforms where both this load and the later store would have to
-    // explicitly add the offset can save code size by performing the addition
-    // only once.
-    __ emit_ptrsize_addi(array_reg, array_reg, offset);
-    offset = 0;
-#endif
-    __ Load(budget_reg, array_reg, no_reg, offset, LoadType::kI32Load, {});
-    LiftoffRegList regs_to_save = __ cache_state()->used_registers;
-    // The cached instance will be reloaded separately.
-    if (__ cache_state()->cached_instance != no_reg) {
-      DCHECK(regs_to_save.has(__ cache_state()->cached_instance));
-      regs_to_save.clear(__ cache_state()->cached_instance);
-    }
     SpilledRegistersForInspection* spilled_regs = nullptr;
 
     OutOfLineSafepointInfo* safepoint_info =
@@ -818,14 +787,23 @@ class LiftoffCompiler {
     __ cache_state()->GetTaggedSlotsForOOLCode(
         &safepoint_info->slots, &safepoint_info->spills,
         LiftoffAssembler::CacheState::SpillLocation::kTopOfStack);
+
+    LiftoffRegList regs_to_save = __ cache_state()->used_registers;
+    // The cached instance will be reloaded separately.
+    if (__ cache_state()->cached_instance != no_reg) {
+      DCHECK(regs_to_save.has(__ cache_state()->cached_instance));
+      regs_to_save.clear(__ cache_state()->cached_instance);
+    }
+
     out_of_line_code_.push_back(OutOfLineCode::TierupCheck(
         zone_, position, regs_to_save, __ cache_state()->cached_instance,
         spilled_regs, safepoint_info, RegisterOOLDebugSideTableEntry(decoder)));
     OutOfLineCode& ool = out_of_line_code_.back();
-    FREEZE_STATE(trapping);
-    __ emit_i32_subi_jump_negative(budget_reg.gp(), budget_used,
-                                   ool.label.get(), trapping);
-    __ Store(array_reg, no_reg, offset, budget_reg, StoreType::kI32Store, {});
+
+    FREEZE_STATE(tierup_check);
+    __ CheckTierUp(declared_function_index(env_->module, func_index_),
+                   budget_used, ool.label.get(), tierup_check);
+
     __ bind(ool.continuation.get());
   }
 
@@ -902,8 +880,6 @@ class LiftoffCompiler {
     USE(kInstanceParameterIndex);
     __ cache_state()->SetInstanceCacheRegister(kWasmInstanceRegister);
 
-    if (for_debugging_) __ ResetOSRTarget();
-
     if (num_params) {
       CODE_COMMENT("process parameters");
       ParameterProcessor processor(this, num_params);
@@ -931,8 +907,8 @@ class LiftoffCompiler {
             pinned.set(__ GetUnusedRegister(kGpReg, pinned).gp());
         Register wasm_null_ref_reg =
             pinned.set(__ GetUnusedRegister(kGpReg, pinned).gp());
-        LoadNullValue(null_ref_reg, pinned, kWasmExternRef);
-        LoadNullValue(wasm_null_ref_reg, pinned, kWasmAnyRef);
+        LoadNullValue(null_ref_reg, kWasmExternRef);
+        LoadNullValue(wasm_null_ref_reg, kWasmAnyRef);
         for (uint32_t local_index = num_params; local_index < __ num_locals();
              ++local_index) {
           ValueType type = decoder->local_types_[local_index];
@@ -961,18 +937,33 @@ class LiftoffCompiler {
       debug_sidetable_builder_->SetNumLocals(__ num_locals());
     }
 
+    if (V8_UNLIKELY(for_debugging_)) {
+      __ ResetOSRTarget();
+      if (V8_UNLIKELY(max_steps_)) {
+        // Generate the single OOL code to jump to if {max_steps_} have been
+        // executed.
+        DCHECK_EQ(0, out_of_line_code_.size());
+        // This trap is never intercepted (e.g. by a debugger), so we do not
+        // need safepoint information (which would be difficult to compute if
+        // the OOL code is shared).
+        out_of_line_code_.push_back(OutOfLineCode::Trap(
+            zone_, WasmCode::kThrowWasmTrapUnreachable, decoder->position(),
+            nullptr, nullptr, 0, nullptr));
+
+        // Subtract 16 steps for the function call itself (including the
+        // function prologue), plus 1 for each local (including parameters). Do
+        // this only *after* setting up the frame completely, even though we
+        // already executed the work then.
+        CheckMaxSteps(decoder, 16 + __ num_locals());
+      }
+    } else {
+      DCHECK(!max_steps_);
+    }
+
     // The function-prologue stack check is associated with position 0, which
     // is never a position of any instruction in the function.
     StackCheck(decoder, 0);
 
-    if (V8_UNLIKELY(max_steps_)) {
-      // Subtract 16 steps for the function call itself (including the function
-      // prologue), plus 1 for each local (including parameters).
-      // Do this only *after* setting up the frame completely, even though we
-      // already executed the work then.
-      CheckMaxSteps(decoder, 16 + __ num_locals());
-    }
-
     if (V8_UNLIKELY(v8_flags.trace_wasm)) TraceFunctionEntry(decoder);
   }
 
@@ -987,25 +978,13 @@ class LiftoffCompiler {
     // accesses do not need protected instruction information, hence they also
     // do not set {pc}.
     DCHECK_IMPLIES(ool->stub != WasmCode::kThrowWasmTrapMemOutOfBounds,
-                   ool->pc == 0);
+                   ool->trapping_pc == 0);
 
-    if (env_->bounds_checks == kTrapHandler && ool->pc != 0) {
+    if (ool->trapping_pc != 0) {
       uint32_t pc = static_cast<uint32_t>(__ pc_offset());
       DCHECK_EQ(pc, __ pc_offset());
       protected_instructions_.emplace_back(
-          trap_handler::ProtectedInstructionData{ool->pc, pc});
-    }
-
-    if (!env_->runtime_exception_support) {
-      // We cannot test calls to the runtime in cctest/test-run-wasm.
-      // Therefore we emit a call to C here instead of a call to the runtime.
-      // In this mode, we never generate stack checks.
-      DCHECK(!is_stack_check);
-      __ CallTrapCallbackForTesting();
-      __ LeaveFrame(StackFrame::WASM);
-      __ DropStackSlotsAndRet(
-          static_cast<uint32_t>(descriptor_->ParameterSlotCount()));
-      return;
+          trap_handler::ProtectedInstructionData{ool->trapping_pc, pc});
     }
 
     if (!ool->regs_to_save.is_empty()) {
@@ -1030,7 +1009,6 @@ class LiftoffCompiler {
       }
 
       int total_frame_size = __ GetTotalFrameSize();
-      LiftoffRegList gp_regs = ool->regs_to_save & kGpCacheRegList;
       // {total_frame_size} is the highest offset from the FP that is used to
       // store a value. The offset of the first spill slot should therefore be
       // {(total_frame_size / kSystemPointerSize) + 1}. However, spill slots
@@ -1039,7 +1017,7 @@ class LiftoffCompiler {
       // index of the first spill slot.
       int index = (total_frame_size / kSystemPointerSize) + 2;
 
-      __ RecordSpillsInSafepoint(safepoint, gp_regs,
+      __ RecordSpillsInSafepoint(safepoint, ool->regs_to_save,
                                  ool->safepoint_info->spills, index);
     }
 
@@ -1140,18 +1118,25 @@ class LiftoffCompiler {
       __ emit_i32_subi(max_steps.gp(), max_steps.gp(), steps_done);
       __ Store(max_steps_addr.gp(), no_reg, 0, max_steps, StoreType::kI32Store,
                pinned);
-      Label cont;
-      __ emit_i32_cond_jumpi(kGreaterThanEqual, &cont, max_steps.gp(), 0,
-                             frozen);
-      // Abort.
-      Trap(decoder, kTrapUnreachable);
-      __ bind(&cont);
+      // Abort if max steps have been executed.
+      DCHECK_EQ(WasmCode::kThrowWasmTrapUnreachable,
+                out_of_line_code_.front().stub);
+      Label* trap_label = out_of_line_code_.front().label.get();
+      __ emit_i32_cond_jumpi(kLessThan, trap_label, max_steps.gp(), 0, frozen);
     }
   }
 
   V8_NOINLINE void EmitDebuggingInfo(FullDecoder* decoder, WasmOpcode opcode) {
     DCHECK(for_debugging_);
+
+    // Snapshot the value types (from the decoder) here, for potentially
+    // building a debug side table entry later. Arguments will have been popped
+    // from the stack later (when we need them), and Liftoff does not keep
+    // precise type information.
+    stack_value_types_for_debugging_ = GetStackValueTypesForDebugging(decoder);
+
     if (!WasmOpcodes::IsBreakable(opcode)) return;
+
     bool has_breakpoint = false;
     if (next_breakpoint_ptr_) {
       if (*next_breakpoint_ptr_ == 0) {
@@ -1217,9 +1202,6 @@ class LiftoffCompiler {
   }
 
   void NextInstruction(FullDecoder* decoder, WasmOpcode opcode) {
-    // Add a single check, so that the fast path can be inlined while
-    // {EmitDebuggingInfo} stays outlined.
-    if (V8_UNLIKELY(for_debugging_)) EmitDebuggingInfo(decoder, opcode);
     TraceCacheState(decoder);
     SLOW_DCHECK(__ ValidateCacheState());
     CODE_COMMENT(WasmOpcodes::OpcodeName(
@@ -1233,6 +1215,10 @@ class LiftoffCompiler {
       DCHECK_EQ(decoder->stack_size() + __ num_locals() + num_exceptions_,
                 __ cache_state()->stack_state.size());
     }
+
+    // Add a single check, so that the fast path can be inlined while
+    // {EmitDebuggingInfo} stays outlined.
+    if (V8_UNLIKELY(for_debugging_)) EmitDebuggingInfo(decoder, opcode);
   }
 
   void EmitBreakpoint(FullDecoder* decoder) {
@@ -1286,8 +1272,8 @@ class LiftoffCompiler {
   }
 
   // Load the property in {kReturnRegister0}.
-  LiftoffRegister GetExceptionProperty(
-      const LiftoffAssembler::VarState& exception, RootIndex root_index) {
+  LiftoffRegister GetExceptionProperty(const VarState& exception,
+                                       RootIndex root_index) {
     DCHECK(root_index == RootIndex::kwasm_exception_tag_symbol ||
            root_index == RootIndex::kwasm_exception_values_symbol);
 
@@ -1299,8 +1285,8 @@ class LiftoffCompiler {
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LOAD_TAGGED_PTR_INSTANCE_FIELD(context_reg.gp(), NativeContext, pinned);
 
-    LiftoffAssembler::VarState tag_symbol{kRef, tag_symbol_reg, 0};
-    LiftoffAssembler::VarState context{kRef, context_reg, 0};
+    VarState tag_symbol{kRef, tag_symbol_reg, 0};
+    VarState context{kRef, context_reg, 0};
 
     CallRuntimeStub(WasmCode::kWasmGetOwnProperty,
                     MakeSig::Returns(kRef).Params(kRef, kRef, kRef),
@@ -1345,26 +1331,103 @@ class LiftoffCompiler {
         wasm::ObjectAccess::ElementOffsetInTaggedFixedArray(imm.index));
 
     CODE_COMMENT("compare tags");
-    {
-      FREEZE_STATE(frozen);
-      Label caught;
-      __ emit_cond_jump(kEqual, &caught, kI32, imm_tag, caught_tag.gp(),
-                        frozen);
-      // The tags don't match, merge the current state into the catch state and
-      // jump to the next handler.
-      __ MergeFullStackWith(block->try_info->catch_state);
-      __ emit_jump(&block->try_info->catch_label);
-      __ bind(&caught);
+
+    if (imm.tag->sig->parameter_count() == 1 &&
+        imm.tag->sig->GetParam(0) == kWasmExternRef) {
+      // Check for the special case where the tag is WebAssembly.JSTag and the
+      // exception is not a WebAssembly.Exception. In this case the exception is
+      // caught and pushed on the operand stack.
+      // Only perform this check if the tag signature is the same as
+      // the JSTag signature, i.e. a single externref, otherwise we know
+      // statically that it cannot be the JSTag.
+      LiftoffRegister undefined =
+          pinned.set(__ GetUnusedRegister(kGpReg, pinned));
+      __ LoadFullPointer(
+          undefined.gp(), kRootRegister,
+          IsolateData::root_slot_offset(RootIndex::kUndefinedValue));
+      LiftoffRegister js_tag = pinned.set(__ GetUnusedRegister(kGpReg, pinned));
+      LOAD_TAGGED_PTR_INSTANCE_FIELD(js_tag.gp(), NativeContext, pinned);
+      __ LoadTaggedPointer(
+          js_tag.gp(), js_tag.gp(), no_reg,
+          NativeContext::SlotOffset(Context::WASM_JS_TAG_INDEX));
+      __ LoadTaggedPointer(
+          js_tag.gp(), js_tag.gp(), no_reg,
+          wasm::ObjectAccess::ToTagged(WasmTagObject::kTagOffset));
+      {
+        LiftoffAssembler::CacheState initial_state(zone_);
+        LiftoffAssembler::CacheState end_state(zone_);
+        Label js_exception;
+        Label done;
+        Label uncaught;
+        initial_state.Split(*__ cache_state());
+        {
+          FREEZE_STATE(state_merged_explicitly);
+          // If the tag is undefined, this is not a wasm exception. Go to a
+          // different block to process the JS exception. Otherwise compare it
+          // with the expected tag.
+          __ emit_cond_jump(kEqual, &js_exception, kRefNull, caught_tag.gp(),
+                            undefined.gp(), state_merged_explicitly);
+          __ emit_cond_jump(kNotEqual, &uncaught, kRefNull, imm_tag,
+                            caught_tag.gp(), state_merged_explicitly);
+        }
+        // Case 1: A wasm exception with a matching tag.
+        GetExceptionValues(decoder, __ cache_state()->stack_state.back(),
+                           imm.tag);
+        // GetExceptionValues modified the cache state. Remember the new state
+        // to merge the end state of case 2 into it.
+        end_state.Steal(*__ cache_state());
+        __ emit_jump(&done);
+
+        __ bind(&js_exception);
+        __ cache_state()->Split(initial_state);
+        {
+          FREEZE_STATE(state_merged_explicitly);
+          __ emit_cond_jump(kNotEqual, &uncaught, kRefNull, imm_tag,
+                            js_tag.gp(), state_merged_explicitly);
+        }
+        // Case 2: A JS exception, and the expected tag is JSTag.
+        // TODO(thibaudm): Can we avoid some state splitting/stealing by
+        // reserving this register earlier and not modifying the state in this
+        // block?
+        LiftoffRegister exception = __ PeekToRegister(0, pinned);
+        __ PushRegister(kRef, exception);
+        // The exception is now on the stack twice: once as an implicit operand
+        // for rethrow, and once as the "unpacked" value.
+        __ MergeFullStackWith(end_state);
+        __ emit_jump(&done);
+
+        // Case 3: Either a wasm exception with a mismatching tag, or a JS
+        // exception but the expected tag is not JSTag.
+        __ bind(&uncaught);
+        __ cache_state()->Steal(initial_state);
+        __ MergeFullStackWith(block->try_info->catch_state);
+        __ emit_jump(&block->try_info->catch_label);
+
+        __ bind(&done);
+        __ cache_state()->Steal(end_state);
+      }
+    } else {
+      {
+        FREEZE_STATE(frozen);
+        Label caught;
+        __ emit_cond_jump(kEqual, &caught, kRefNull, imm_tag, caught_tag.gp(),
+                          frozen);
+        // The tags don't match, merge the current state into the catch state
+        // and jump to the next handler.
+        __ MergeFullStackWith(block->try_info->catch_state);
+        __ emit_jump(&block->try_info->catch_label);
+        __ bind(&caught);
+      }
+      GetExceptionValues(decoder, __ cache_state()->stack_state.back(),
+                         imm.tag);
     }
     if (!block->try_info->in_handler) {
       block->try_info->in_handler = true;
       num_exceptions_++;
     }
-    GetExceptionValues(decoder, __ cache_state()->stack_state.back(), imm.tag);
   }
 
-  void Rethrow(FullDecoder* decoder,
-               const LiftoffAssembler::VarState& exception) {
+  void Rethrow(FullDecoder* decoder, const VarState& exception) {
     CallRuntimeStub(WasmCode::kWasmRethrow, MakeSig::Params(kRef), {exception},
                     decoder->position());
   }
@@ -1443,7 +1506,7 @@ class LiftoffCompiler {
     // Binary comparison of i32 values.
     cond = Negate(GetCompareCondition(outstanding_op_));
     outstanding_op_ = kNoOutstandingOp;
-    LiftoffAssembler::VarState rhs_slot = __ cache_state()->stack_state.back();
+    VarState rhs_slot = __ cache_state()->stack_state.back();
     if (rhs_slot.is_const()) {
       // Compare to a constant.
       int32_t rhs_imm = rhs_slot.i32_const();
@@ -1455,7 +1518,7 @@ class LiftoffCompiler {
     }
 
     Register rhs = __ PopToRegister().gp();
-    LiftoffAssembler::VarState lhs_slot = __ cache_state()->stack_state.back();
+    VarState lhs_slot = __ cache_state()->stack_state.back();
     if (lhs_slot.is_const()) {
       // Compare a constant to an arbitrary value.
       int32_t lhs_imm = lhs_slot.i32_const();
@@ -1582,22 +1645,22 @@ class LiftoffCompiler {
     if (!c->label.get()->is_bound()) __ bind(c->label.get());
   }
 
-  void GenerateCCall(const LiftoffRegister* result_regs,
-                     const ValueKindSig* sig, ValueKind out_argument_kind,
-                     const LiftoffRegister* arg_regs,
+  void GenerateCCall(const LiftoffRegister* result_regs, ValueKind return_kind,
+                     ValueKind out_argument_kind,
+                     const std::initializer_list<VarState> args,
                      ExternalReference ext_ref) {
     // Before making a call, spill all cache registers.
     __ SpillAllRegisters();
 
     // Store arguments on our stack, then align the stack for calling to C.
     int param_bytes = 0;
-    for (ValueKind param_kind : sig->parameters()) {
-      param_bytes += value_kind_size(param_kind);
+    for (const VarState& arg : args) {
+      param_bytes += value_kind_size(arg.kind());
     }
     int out_arg_bytes =
         out_argument_kind == kVoid ? 0 : value_kind_size(out_argument_kind);
     int stack_bytes = std::max(param_bytes, out_arg_bytes);
-    __ CallC(sig, arg_regs, result_regs, out_argument_kind, stack_bytes,
+    __ CallC(args, result_regs, return_kind, out_argument_kind, stack_bytes,
              ext_ref);
   }
 
@@ -1673,11 +1736,11 @@ class LiftoffCompiler {
   void EmitFloatUnOpWithCFallback(
       bool (LiftoffAssembler::*emit_fn)(DoubleRegister, DoubleRegister),
       ExternalReference (*fallback_fn)()) {
-    auto emit_with_c_fallback = [=](LiftoffRegister dst, LiftoffRegister src) {
+    auto emit_with_c_fallback = [this, emit_fn, fallback_fn](
+                                    LiftoffRegister dst, LiftoffRegister src) {
       if ((asm_.*emit_fn)(dst.fp(), src.fp())) return;
       ExternalReference ext_ref = fallback_fn();
-      auto sig = MakeSig::Params(kind);
-      GenerateCCall(&dst, &sig, kind, &src, ext_ref);
+      GenerateCCall(&dst, kVoid, kind, {VarState{kind, src, 0}}, ext_ref);
     };
     EmitUnOp<kind, kind>(emit_with_c_fallback);
   }
@@ -1702,18 +1765,17 @@ class LiftoffCompiler {
       ExternalReference ext_ref = fallback_fn();
       if (can_trap) {
         // External references for potentially trapping conversions return int.
-        auto sig = MakeSig::Returns(kI32).Params(src_kind);
         LiftoffRegister ret_reg =
             __ GetUnusedRegister(kGpReg, LiftoffRegList{dst});
         LiftoffRegister dst_regs[] = {ret_reg, dst};
-        GenerateCCall(dst_regs, &sig, dst_kind, &src, ext_ref);
+        GenerateCCall(dst_regs, kI32, dst_kind, {VarState{src_kind, src, 0}},
+                      ext_ref);
         // It's okay that this is short-lived: we're trapping anyway.
         FREEZE_STATE(trapping);
         __ emit_cond_jump(kEqual, trap, kI32, ret_reg.gp(), no_reg, trapping);
       } else {
-        ValueKind sig_kinds[] = {src_kind};
-        ValueKindSig sig(0, 1, sig_kinds);
-        GenerateCCall(&dst, &sig, dst_kind, &src, ext_ref);
+        GenerateCCall(&dst, kVoid, dst_kind, {VarState{src_kind, src, 0}},
+                      ext_ref);
       }
     }
     __ PushRegister(dst_kind, dst);
@@ -1845,20 +1907,18 @@ class LiftoffCompiler {
         return EmitUnOp<kI64, kI32>(&LiftoffAssembler::emit_i64_eqz);
       case kExprI32Popcnt:
         return EmitUnOp<kI32, kI32>(
-            [=](LiftoffRegister dst, LiftoffRegister src) {
+            [this](LiftoffRegister dst, LiftoffRegister src) {
               if (__ emit_i32_popcnt(dst.gp(), src.gp())) return;
-              auto sig = MakeSig::Returns(kI32).Params(kI32);
-              GenerateCCall(&dst, &sig, kVoid, &src,
+              GenerateCCall(&dst, kI32, kVoid, {VarState{kI32, src, 0}},
                             ExternalReference::wasm_word32_popcnt());
             });
       case kExprI64Popcnt:
         return EmitUnOp<kI64, kI64>(
-            [=](LiftoffRegister dst, LiftoffRegister src) {
+            [this](LiftoffRegister dst, LiftoffRegister src) {
               if (__ emit_i64_popcnt(dst, src)) return;
               // The c function returns i32. We will zero-extend later.
-              auto sig = MakeSig::Returns(kI32).Params(kI64);
               LiftoffRegister c_call_dst = kNeedI64RegPair ? dst.low() : dst;
-              GenerateCCall(&c_call_dst, &sig, kVoid, &src,
+              GenerateCCall(&c_call_dst, kI32, kVoid, {VarState{kI64, src, 0}},
                             ExternalReference::wasm_word64_popcnt());
               // Now zero-extend the result to i64.
               __ emit_type_conversion(kExprI64UConvertI32, dst, c_call_dst,
@@ -1870,8 +1930,7 @@ class LiftoffCompiler {
       case kExprRefAsNonNull:
         return EmitIsNull(opcode, value.type);
       case kExprExternInternalize: {
-        LiftoffAssembler::VarState input_state =
-            __ cache_state()->stack_state.back();
+        VarState input_state = __ cache_state()->stack_state.back();
         CallRuntimeStub(WasmCode::kWasmExternInternalize,
                         MakeSig::Returns(kRefNull).Params(kRefNull),
                         {input_state}, decoder->position());
@@ -1881,7 +1940,7 @@ class LiftoffCompiler {
       }
       case kExprExternExternalize: {
         LiftoffRegList pinned;
-        LiftoffRegister ref = pinned.set(__ PopToRegister(pinned));
+        LiftoffRegister ref = pinned.set(__ PopToModifiableRegister(pinned));
         LiftoffRegister null = __ GetUnusedRegister(kGpReg, pinned);
         LoadNullValueForCompare(null.gp(), pinned, kWasmAnyRef);
         Label label;
@@ -1889,7 +1948,7 @@ class LiftoffCompiler {
           FREEZE_STATE(frozen);
           __ emit_cond_jump(kNotEqual, &label, kRefNull, ref.gp(), null.gp(),
                             frozen);
-          LoadNullValue(ref.gp(), pinned, kWasmExternRef);
+          LoadNullValue(ref.gp(), kWasmExternRef);
           __ bind(&label);
         }
         __ PushRegister(kRefNull, ref);
@@ -1911,7 +1970,7 @@ class LiftoffCompiler {
     static constexpr RegClass src_rc = reg_class_for(src_kind);
     static constexpr RegClass result_rc = reg_class_for(result_kind);
 
-    LiftoffAssembler::VarState rhs_slot = __ cache_state()->stack_state.back();
+    VarState rhs_slot = __ cache_state()->stack_state.back();
     // Check if the RHS is an immediate.
     if (rhs_slot.is_const()) {
       __ cache_state()->stack_state.pop_back();
@@ -1968,19 +2027,14 @@ class LiftoffCompiler {
                            Label* trap_unrepresentable = nullptr) {
     // Cannot emit native instructions, build C call.
     LiftoffRegister ret = __ GetUnusedRegister(kGpReg, LiftoffRegList{dst});
-    LiftoffRegister tmp =
-        __ GetUnusedRegister(kGpReg, LiftoffRegList{dst, ret});
-    LiftoffRegister arg_regs[] = {lhs, rhs};
     LiftoffRegister result_regs[] = {ret, dst};
-    auto sig = MakeSig::Returns(kI32).Params(kI64, kI64);
-    GenerateCCall(result_regs, &sig, kI64, arg_regs, ext_ref);
+    GenerateCCall(result_regs, kI32, kI64, {{kI64, lhs, 0}, {kI64, rhs, 0}},
+                  ext_ref);
     FREEZE_STATE(trapping);
-    __ LoadConstant(tmp, WasmValue(int32_t{0}));
-    __ emit_cond_jump(kEqual, trap_by_zero, kI32, ret.gp(), tmp.gp(), trapping);
+    __ emit_i32_cond_jumpi(kEqual, trap_by_zero, ret.gp(), 0, trapping);
     if (trap_unrepresentable) {
-      __ LoadConstant(tmp, WasmValue(int32_t{-1}));
-      __ emit_cond_jump(kEqual, trap_unrepresentable, kI32, ret.gp(), tmp.gp(),
-                        trapping);
+      __ emit_i32_cond_jumpi(kEqual, trap_unrepresentable, ret.gp(), -1,
+                             trapping);
     }
   }
 
@@ -1997,29 +2051,31 @@ class LiftoffCompiler {
                                            GetCompareCondition(opcode)));
   }
 
+  template <ValueKind kind, ExternalReference(ExtRefFn)()>
+  void EmitCCallBinOp() {
+    EmitBinOp<kind, kind>(
+        [this](LiftoffRegister dst, LiftoffRegister lhs, LiftoffRegister rhs) {
+          const bool out_via_stack = kind == kI64;
+          ValueKind out_arg_kind = out_via_stack ? kI64 : kVoid;
+          ValueKind return_kind = out_via_stack ? kVoid : kind;
+          GenerateCCall(&dst, return_kind, out_arg_kind,
+                        {{kind, lhs, 0}, {kind, rhs, 0}}, ExtRefFn());
+        });
+  }
+
+  template <typename EmitFn, typename EmitFnImm>
+  void EmitI64Shift(EmitFn fn, EmitFnImm fnImm) {
+    return EmitBinOpImm<kI64, kI64>(
+        [this, fn](LiftoffRegister dst, LiftoffRegister src,
+                   LiftoffRegister amount) {
+          CallEmitFn(fn, dst, src,
+                     amount.is_gp_pair() ? amount.low_gp() : amount.gp());
+        },
+        fnImm);
+  }
+
   void BinOp(FullDecoder* decoder, WasmOpcode opcode, const Value& lhs,
              const Value& rhs, Value* result) {
-#define CASE_I64_SHIFTOP(opcode, fn)                                         \
-  case kExpr##opcode:                                                        \
-    return EmitBinOpImm<kI64, kI64>(                                         \
-        [=](LiftoffRegister dst, LiftoffRegister src,                        \
-            LiftoffRegister amount) {                                        \
-          __ emit_##fn(dst, src,                                             \
-                       amount.is_gp_pair() ? amount.low_gp() : amount.gp()); \
-        },                                                                   \
-        &LiftoffAssembler::emit_##fn##i);
-#define CASE_CCALL_BINOP(opcode, kind, ext_ref_fn)                           \
-  case kExpr##opcode:                                                        \
-    return EmitBinOp<k##kind, k##kind>(                                      \
-        [=](LiftoffRegister dst, LiftoffRegister lhs, LiftoffRegister rhs) { \
-          LiftoffRegister args[] = {lhs, rhs};                               \
-          auto ext_ref = ExternalReference::ext_ref_fn();                    \
-          ValueKind sig_kinds[] = {k##kind, k##kind, k##kind};               \
-          const bool out_via_stack = k##kind == kI64;                        \
-          ValueKindSig sig(out_via_stack ? 0 : 1, 2, sig_kinds);             \
-          ValueKind out_arg_kind = out_via_stack ? kI64 : kVoid;             \
-          GenerateCCall(&dst, &sig, out_arg_kind, args, ext_ref);            \
-        });
     switch (opcode) {
       case kExprI32Add:
         return EmitBinOpImm<kI32, kI32>(&LiftoffAssembler::emit_i32_add,
@@ -2148,13 +2204,23 @@ class LiftoffCompiler {
       case kExprI32ShrU:
         return EmitBinOpImm<kI32, kI32>(&LiftoffAssembler::emit_i32_shr,
                                         &LiftoffAssembler::emit_i32_shri);
-        CASE_CCALL_BINOP(I32Rol, I32, wasm_word32_rol)
-        CASE_CCALL_BINOP(I32Ror, I32, wasm_word32_ror)
-        CASE_I64_SHIFTOP(I64Shl, i64_shl)
-        CASE_I64_SHIFTOP(I64ShrS, i64_sar)
-        CASE_I64_SHIFTOP(I64ShrU, i64_shr)
-        CASE_CCALL_BINOP(I64Rol, I64, wasm_word64_rol)
-        CASE_CCALL_BINOP(I64Ror, I64, wasm_word64_ror)
+      case kExprI32Rol:
+        return EmitCCallBinOp<kI32, ExternalReference::wasm_word32_rol>();
+      case kExprI32Ror:
+        return EmitCCallBinOp<kI32, ExternalReference::wasm_word32_ror>();
+      case kExprI64Shl:
+        return EmitI64Shift(&LiftoffAssembler::emit_i64_shl,
+                            &LiftoffAssembler::emit_i64_shli);
+      case kExprI64ShrS:
+        return EmitI64Shift(&LiftoffAssembler::emit_i64_sar,
+                            &LiftoffAssembler::emit_i64_sari);
+      case kExprI64ShrU:
+        return EmitI64Shift(&LiftoffAssembler::emit_i64_shr,
+                            &LiftoffAssembler::emit_i64_shri);
+      case kExprI64Rol:
+        return EmitCCallBinOp<kI64, ExternalReference::wasm_word64_rol>();
+      case kExprI64Ror:
+        return EmitCCallBinOp<kI64, ExternalReference::wasm_word64_ror>();
       case kExprF32Add:
         return EmitBinOp<kF32, kF32>(&LiftoffAssembler::emit_f32_add);
       case kExprF32Sub:
@@ -2271,15 +2337,20 @@ class LiftoffCompiler {
           }
         });
       case kExprRefEq: {
+#if defined(V8_COMPRESS_POINTERS)
+        // In pointer compression, we smi-corrupt (the upper bits of a
+        // Smi are arbitrary). So, we should only compare the lower 32 bits.
+        return EmitBinOp<kRefNull, kI32>(
+            BindFirst(&LiftoffAssembler::emit_i32_set_cond, kEqual));
+#else
         return EmitBinOp<kRefNull, kI32>(
             BindFirst(&LiftoffAssembler::emit_ptrsize_set_cond, kEqual));
+#endif
       }
 
       default:
         UNREACHABLE();
     }
-#undef CASE_I64_SHIFTOP
-#undef CASE_CCALL_BINOP
   }
 
   void TraceInstruction(FullDecoder* decoder, uint32_t markid) {
@@ -2321,16 +2392,14 @@ class LiftoffCompiler {
 
   void RefNull(FullDecoder* decoder, ValueType type, Value*) {
     LiftoffRegister null = __ GetUnusedRegister(kGpReg, {});
-    LoadNullValue(null.gp(), {}, type);
+    LoadNullValue(null.gp(), type);
     __ PushRegister(type.kind(), null);
   }
 
   void RefFunc(FullDecoder* decoder, uint32_t function_index, Value* result) {
-    LiftoffRegister func_index_reg = __ GetUnusedRegister(kGpReg, {});
-    __ LoadConstant(func_index_reg, WasmValue(function_index));
-    LiftoffAssembler::VarState func_index_var(kI32, func_index_reg, 0);
     CallRuntimeStub(WasmCode::kWasmRefFunc, MakeSig::Returns(kRef).Params(kI32),
-                    {func_index_var}, decoder->position());
+                    {VarState{kI32, static_cast<int>(function_index), 0}},
+                    decoder->position());
     __ PushRegister(kRef, LiftoffRegister(kReturnRegister0));
   }
 
@@ -2376,27 +2445,17 @@ class LiftoffCompiler {
 
   void TierupCheckOnTailCall(FullDecoder* decoder) {
     if (!dynamic_tiering()) return;
-    LiftoffRegList pinned;
-    Register tmp1 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-    Register tmp2 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-    TierupCheck(decoder, decoder->position(), __ pc_offset(), tmp1, tmp2);
+    TierupCheck(decoder, decoder->position(), __ pc_offset());
   }
 
   void DoReturn(FullDecoder* decoder, uint32_t /* drop values */) {
-    Register tmp1 = no_reg;
-    Register tmp2 = no_reg;
-    if (dynamic_tiering()) {
-      LiftoffRegList pinned;
-      tmp1 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-      tmp2 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-    }
-    ReturnImpl(decoder, tmp1, tmp2);
+    ReturnImpl(decoder);
   }
 
-  void ReturnImpl(FullDecoder* decoder, Register tmp1, Register tmp2) {
+  void ReturnImpl(FullDecoder* decoder) {
     if (V8_UNLIKELY(v8_flags.trace_wasm)) TraceFunctionExit(decoder);
     if (dynamic_tiering()) {
-      TierupCheck(decoder, decoder->position(), __ pc_offset(), tmp1, tmp2);
+      TierupCheck(decoder, decoder->position(), __ pc_offset());
     }
     size_t num_returns = decoder->sig_->return_count();
     if (num_returns > 0) __ MoveToReturnLocations(decoder->sig_, descriptor_);
@@ -2426,8 +2485,7 @@ class LiftoffCompiler {
     }
   }
 
-  void LocalSetFromStackSlot(LiftoffAssembler::VarState* dst_slot,
-                             uint32_t local_index) {
+  void LocalSetFromStackSlot(VarState* dst_slot, uint32_t local_index) {
     auto& state = *__ cache_state();
     auto& src_slot = state.stack_state.back();
     ValueKind kind = dst_slot->kind();
@@ -2444,7 +2502,7 @@ class LiftoffCompiler {
     RegClass rc = reg_class_for(kind);
     LiftoffRegister dst_reg = __ GetUnusedRegister(rc, {});
     __ Fill(dst_reg, src_slot.offset(), kind);
-    *dst_slot = LiftoffAssembler::VarState(kind, dst_reg, dst_slot->offset());
+    *dst_slot = VarState(kind, dst_reg, dst_slot->offset());
     __ cache_state()->inc_used(dst_reg);
   }
 
@@ -2487,8 +2545,7 @@ class LiftoffCompiler {
       int field_offset =
           wasm::ObjectAccess::ElementOffsetInTaggedFixedAddressArray(
               global->index);
-      __ Load(LiftoffRegister(addr), addr, no_reg, field_offset,
-              kPointerLoadType);
+      __ LoadFullPointer(addr, addr, field_offset);
       *offset = 0;
     } else {
       LOAD_INSTANCE_FIELD(addr, GlobalsStart, kSystemPointerSize, *pinned);
@@ -2615,14 +2672,9 @@ class LiftoffCompiler {
 
   void TableGet(FullDecoder* decoder, const Value&, Value*,
                 const IndexImmediate& imm) {
-    LiftoffRegList pinned;
-
-    LiftoffRegister table_index_reg =
-        pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-    __ LoadConstant(table_index_reg, WasmValue(imm.index));
-    LiftoffAssembler::VarState table_index{kI32, table_index_reg, 0};
+    VarState table_index{kI32, static_cast<int>(imm.index), 0};
 
-    LiftoffAssembler::VarState index = __ cache_state()->stack_state.back();
+    VarState index = __ PopVarState();
 
     ValueType type = env_->module->tables[imm.index].type;
     bool is_funcref = IsSubtypeOf(type, kWasmFuncRef, env_->module);
@@ -2632,9 +2684,6 @@ class LiftoffCompiler {
     CallRuntimeStub(stub, MakeSig::Returns(type.kind()).Params(kI32, kI32),
                     {table_index, index}, decoder->position());
 
-    // Pop parameters from the value stack.
-    __ cache_state()->stack_state.pop_back(1);
-
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
 
     __ PushRegister(type.kind(), LiftoffRegister(kReturnRegister0));
@@ -2642,15 +2691,10 @@ class LiftoffCompiler {
 
   void TableSet(FullDecoder* decoder, const Value&, const Value&,
                 const IndexImmediate& imm) {
-    LiftoffRegList pinned;
+    VarState table_index{kI32, static_cast<int>(imm.index), 0};
 
-    LiftoffRegister table_index_reg =
-        pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-    __ LoadConstant(table_index_reg, WasmValue(imm.index));
-    LiftoffAssembler::VarState table_index{kI32, table_index_reg, 0};
-
-    LiftoffAssembler::VarState value = __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState index = __ cache_state()->stack_state.end()[-2];
+    VarState value = __ PopVarState();
+    VarState index = __ PopVarState();
 
     ValueType type = env_->module->tables[imm.index].type;
     bool is_funcref = IsSubtypeOf(type, kWasmFuncRef, env_->module);
@@ -2660,9 +2704,6 @@ class LiftoffCompiler {
     CallRuntimeStub(stub, MakeSig::Params(kI32, kI32, kRefNull),
                     {table_index, index, value}, decoder->position());
 
-    // Pop parameters from the value stack.
-    __ cache_state()->stack_state.pop_back(2);
-
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
   }
 
@@ -2743,21 +2784,16 @@ class LiftoffCompiler {
     __ PushRegister(kind, dst);
   }
 
-  // {tmp1} and {tmp2} may be {no_reg} if it is guaranteed that {target}
-  // isn't a loop.
-  void BrImpl(FullDecoder* decoder, Control* target, Register tmp1,
-              Register tmp2) {
+  void BrImpl(FullDecoder* decoder, Control* target) {
     if (dynamic_tiering()) {
       if (target->is_loop()) {
         DCHECK(target->label.get()->is_bound());
-        DCHECK_NE(tmp1, no_reg);
-        DCHECK_NE(tmp2, no_reg);
         int jump_distance = __ pc_offset() - target->label.get()->pos();
         // For now we just add one as the cost for the tier up check. We might
         // want to revisit this when tuning tiering budgets later.
         const int kTierUpCheckCost = 1;
         TierupCheck(decoder, decoder->position(),
-                    jump_distance + kTierUpCheckCost, tmp1, tmp2);
+                    jump_distance + kTierUpCheckCost);
       } else {
         // To estimate time spent in this function more accurately, we could
         // increment the tiering budget on forward jumps. However, we don't
@@ -2783,29 +2819,16 @@ class LiftoffCompiler {
            decoder->control_at(br_depth)->is_loop();
   }
 
-  struct TierupTempRegisters {
-    Register tmp1 = no_reg;
-    Register tmp2 = no_reg;
-  };
-  void AllocateTempRegisters(TierupTempRegisters& temps) {
-    LiftoffRegList pinned;
-    temps.tmp1 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-    temps.tmp2 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-  }
-
   void BrOrRet(FullDecoder* decoder, uint32_t depth,
                uint32_t /* drop_values */) {
-    TierupTempRegisters temps;
-    if (NeedsTierupCheck(decoder, depth)) AllocateTempRegisters(temps);
-    BrOrRetImpl(decoder, depth, temps.tmp1, temps.tmp2);
+    BrOrRetImpl(decoder, depth);
   }
 
-  void BrOrRetImpl(FullDecoder* decoder, uint32_t depth, Register tmp1,
-                   Register tmp2) {
+  void BrOrRetImpl(FullDecoder* decoder, uint32_t depth) {
     if (depth == decoder->control_depth() - 1) {
-      ReturnImpl(decoder, tmp1, tmp2);
+      ReturnImpl(decoder);
     } else {
-      BrImpl(decoder, decoder->control_at(depth), tmp1, tmp2);
+      BrImpl(decoder, decoder->control_at(depth));
     }
   }
 
@@ -2816,14 +2839,12 @@ class LiftoffCompiler {
     }
 
     Label cont_false;
-    TierupTempRegisters temps;
-    if (NeedsTierupCheck(decoder, depth)) AllocateTempRegisters(temps);
 
     // Test the condition on the value stack, jump to {cont_false} if zero.
     base::Optional<FreezeCacheState> frozen;
     JumpIfFalse(decoder, &cont_false, frozen);
 
-    BrOrRetImpl(decoder, depth, temps.tmp1, temps.tmp2);
+    BrOrRetImpl(decoder, depth);
 
     __ bind(&cont_false);
   }
@@ -2831,14 +2852,13 @@ class LiftoffCompiler {
   // Generate a branch table case, potentially reusing previously generated
   // stack transfer code.
   void GenerateBrCase(FullDecoder* decoder, uint32_t br_depth,
-                      ZoneMap<uint32_t, MovableLabel>* br_targets,
-                      Register tmp1, Register tmp2) {
+                      ZoneMap<uint32_t, MovableLabel>* br_targets) {
     auto [iterator, is_new_target] = br_targets->emplace(br_depth, zone_);
     Label* label = iterator->second.get();
     DCHECK_EQ(is_new_target, !label->is_bound());
     if (is_new_target) {
       __ bind(label);
-      BrOrRetImpl(decoder, br_depth, tmp1, tmp2);
+      BrOrRetImpl(decoder, br_depth);
     } else {
       __ jmp(label);
     }
@@ -2846,34 +2866,32 @@ class LiftoffCompiler {
 
   // Generate a branch table for input in [min, max).
   // TODO(wasm): Generate a real branch table (like TF TableSwitch).
-  void GenerateBrTable(FullDecoder* decoder, LiftoffRegister tmp,
-                       LiftoffRegister value, uint32_t min, uint32_t max,
+  void GenerateBrTable(FullDecoder* decoder, LiftoffRegister value,
+                       uint32_t min, uint32_t max,
                        BranchTableIterator<ValidationTag>* table_iterator,
                        ZoneMap<uint32_t, MovableLabel>* br_targets,
-                       Register tmp1, Register tmp2,
                        const FreezeCacheState& frozen) {
     DCHECK_LT(min, max);
     // Check base case.
     if (max == min + 1) {
       DCHECK_EQ(min, table_iterator->cur_index());
-      GenerateBrCase(decoder, table_iterator->next(), br_targets, tmp1, tmp2);
+      GenerateBrCase(decoder, table_iterator->next(), br_targets);
       return;
     }
 
     uint32_t split = min + (max - min) / 2;
     Label upper_half;
-    __ LoadConstant(tmp, WasmValue(split));
-    __ emit_cond_jump(kUnsignedGreaterThanEqual, &upper_half, kI32, value.gp(),
-                      tmp.gp(), frozen);
+    __ emit_i32_cond_jumpi(kUnsignedGreaterThanEqual, &upper_half, value.gp(),
+                           split, frozen);
     // Emit br table for lower half:
-    GenerateBrTable(decoder, tmp, value, min, split, table_iterator, br_targets,
-                    tmp1, tmp2, frozen);
+    GenerateBrTable(decoder, value, min, split, table_iterator, br_targets,
+                    frozen);
     __ bind(&upper_half);
     // table_iterator will trigger a DCHECK if we don't stop decoding now.
     if (did_bailout()) return;
     // Emit br table for upper half:
-    GenerateBrTable(decoder, tmp, value, split, max, table_iterator, br_targets,
-                    tmp1, tmp2, frozen);
+    GenerateBrTable(decoder, value, split, max, table_iterator, br_targets,
+                    frozen);
   }
 
   void BrTable(FullDecoder* decoder, const BranchTableImmediate& imm,
@@ -2881,27 +2899,6 @@ class LiftoffCompiler {
     LiftoffRegList pinned;
     LiftoffRegister value = pinned.set(__ PopToRegister());
 
-    // Reserve temp registers if any of the table entries will do a tierup
-    // check (function exit, or loop back edge).
-    Register tmp1 = no_reg;
-    Register tmp2 = no_reg;
-    if (dynamic_tiering()) {
-      bool need_temps = false;
-      BranchTableIterator<ValidationTag> table_iterator(decoder, imm);
-      while (table_iterator.has_next()) {
-        uint32_t depth = table_iterator.next();
-        if (depth == decoder->control_depth() - 1 ||
-            decoder->control_at(depth)->is_loop()) {
-          need_temps = true;
-          break;
-        }
-      }
-      if (need_temps) {
-        tmp1 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-        tmp2 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-      }
-    }
-
     {
       // All targets must have the same arity (checked by validation), so
       // we can just sample any of them to find that arity.
@@ -2916,15 +2913,13 @@ class LiftoffCompiler {
     ZoneMap<uint32_t, MovableLabel> br_targets{zone_};
 
     if (imm.table_count > 0) {
-      LiftoffRegister tmp = __ GetUnusedRegister(kGpReg, pinned);
-      __ LoadConstant(tmp, WasmValue(uint32_t{imm.table_count}));
       FREEZE_STATE(frozen);
       Label case_default;
-      __ emit_cond_jump(kUnsignedGreaterThanEqual, &case_default, kI32,
-                        value.gp(), tmp.gp(), frozen);
+      __ emit_i32_cond_jumpi(kUnsignedGreaterThanEqual, &case_default,
+                             value.gp(), imm.table_count, frozen);
 
-      GenerateBrTable(decoder, tmp, value, 0, imm.table_count, &table_iterator,
-                      &br_targets, tmp1, tmp2, frozen);
+      GenerateBrTable(decoder, value, 0, imm.table_count, &table_iterator,
+                      &br_targets, frozen);
 
       __ bind(&case_default);
       // table_iterator will trigger a DCHECK if we don't stop decoding now.
@@ -2932,7 +2927,7 @@ class LiftoffCompiler {
     }
 
     // Generate the default case.
-    GenerateBrCase(decoder, table_iterator.next(), &br_targets, tmp1, tmp2);
+    GenerateBrCase(decoder, table_iterator.next(), &br_targets);
     DCHECK(!table_iterator.has_next());
   }
 
@@ -2967,16 +2962,17 @@ class LiftoffCompiler {
   }
 
   Label* AddOutOfLineTrap(FullDecoder* decoder, WasmCode::RuntimeStubId stub,
-                          uint32_t pc = 0) {
+                          uint32_t trapping_pc = 0) {
     // Only memory OOB traps need a {pc}.
-    DCHECK_IMPLIES(stub != WasmCode::kThrowWasmTrapMemOutOfBounds, pc == 0);
+    DCHECK_IMPLIES(stub != WasmCode::kThrowWasmTrapMemOutOfBounds,
+                   trapping_pc == 0);
     DCHECK(v8_flags.wasm_bounds_checks);
     OutOfLineSafepointInfo* safepoint_info = nullptr;
+    // Execution does not return after a trap. Therefore we don't have to define
+    // a safepoint for traps that would preserve references on the stack.
+    // However, if this is debug code, then we have to preserve the references
+    // so that they can be inspected.
     if (V8_UNLIKELY(for_debugging_)) {
-      // Execution does not return after a trap. Therefore we don't have to
-      // define a safepoint for traps that would preserve references on the
-      // stack. However, if this is debug code, then we have to preserve the
-      // references so that they can be inspected.
       safepoint_info = zone_->New<OutOfLineSafepointInfo>(zone_);
       __ cache_state()->GetTaggedSlotsForOOLCode(
           &safepoint_info->slots, &safepoint_info->spills,
@@ -2986,7 +2982,7 @@ class LiftoffCompiler {
         zone_, stub, decoder->position(),
         V8_UNLIKELY(for_debugging_) ? GetSpilledRegistersForInspection()
                                     : nullptr,
-        safepoint_info, pc, RegisterOOLDebugSideTableEntry(decoder)));
+        safepoint_info, trapping_pc, RegisterOOLDebugSideTableEntry(decoder)));
     return out_of_line_code_.back().label.get();
   }
 
@@ -2995,12 +2991,13 @@ class LiftoffCompiler {
   // Returns {no_reg} if the memory access is statically known to be out of
   // bounds (a jump to the trap was generated then); return the GP {index}
   // register otherwise (holding the ptrsized index).
-  Register BoundsCheckMem(FullDecoder* decoder, uint32_t access_size,
-                          uint64_t offset, LiftoffRegister index,
-                          LiftoffRegList pinned, ForceCheck force_check) {
-    // This is ensured by the decoder.
+  Register BoundsCheckMem(FullDecoder* decoder, const WasmMemory* memory,
+                          uint32_t access_size, uint64_t offset,
+                          LiftoffRegister index, LiftoffRegList pinned,
+                          ForceCheck force_check) {
+    // The decoder ensures that the access is not statically OOB.
     DCHECK(base::IsInBounds<uintptr_t>(offset, access_size,
-                                       env_->module->max_memory_size));
+                                       memory->max_memory_size));
 
     // After bounds checking, we know that the index must be ptrsize, hence only
     // look at the lower word on 32-bit systems (the high word is bounds-checked
@@ -3009,14 +3006,14 @@ class LiftoffCompiler {
         kNeedI64RegPair && index.is_gp_pair() ? index.low_gp() : index.gp();
 
     // Without bounds checks (testing only), just return the ptrsize index.
-    if (V8_UNLIKELY(env_->bounds_checks == kNoBoundsChecks)) {
+    if (V8_UNLIKELY(memory->bounds_checks == kNoBoundsChecks)) {
       return index_ptrsize;
     }
 
     // Early return for trap handler.
-    DCHECK_IMPLIES(env_->module->is_memory64,
-                   env_->bounds_checks == kExplicitBoundsChecks);
-    if (!force_check && env_->bounds_checks == kTrapHandler) {
+    DCHECK_IMPLIES(memory->is_memory64,
+                   memory->bounds_checks == kExplicitBoundsChecks);
+    if (!force_check && memory->bounds_checks == kTrapHandler) {
       // With trap handlers we should not have a register pair as input (we
       // would only return the lower half).
       DCHECK(index.is_gp());
@@ -3032,10 +3029,10 @@ class LiftoffCompiler {
 
     // Convert the index to ptrsize, bounds-checking the high word on 32-bit
     // systems for memory64.
-    if (!env_->module->is_memory64) {
+    if (!memory->is_memory64) {
       __ emit_u32_to_uintptr(index_ptrsize, index_ptrsize);
     } else if (kSystemPointerSize == kInt32Size) {
-      DCHECK_GE(kMaxUInt32, env_->module->max_memory_size);
+      DCHECK_GE(kMaxUInt32, memory->max_memory_size);
       FREEZE_STATE(trapping);
       __ emit_cond_jump(kNotZero, trap_label, kI32, index.high_gp(), no_reg,
                         trapping);
@@ -3047,7 +3044,17 @@ class LiftoffCompiler {
     LiftoffRegister end_offset_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LiftoffRegister mem_size = __ GetUnusedRegister(kGpReg, pinned);
-    LOAD_INSTANCE_FIELD(mem_size.gp(), MemorySize, kSystemPointerSize, pinned);
+    // TODO(13957): Clamp the loaded memory size to a safe value.
+    if (memory->index == 0) {
+      LOAD_INSTANCE_FIELD(mem_size.gp(), Memory0Size, kSystemPointerSize,
+                          pinned);
+    } else {
+      LOAD_TAGGED_PTR_INSTANCE_FIELD(mem_size.gp(), MemoryBasesAndSizes,
+                                     pinned);
+      int buffer_offset = wasm::ObjectAccess::ToTagged(ByteArray::kHeaderSize) +
+                          kSystemPointerSize * (memory->index * 2 + 1);
+      __ LoadFullPointer(mem_size.gp(), mem_size.gp(), buffer_offset);
+    }
 
     __ LoadConstant(end_offset_reg, WasmValue::ForUintPtr(end_offset));
 
@@ -3055,7 +3062,7 @@ class LiftoffCompiler {
     // If the end offset is larger than the smallest memory, dynamically check
     // the end offset against the actual memory size, which is not known at
     // compile time. Otherwise, only one check is required (see below).
-    if (end_offset > env_->module->min_memory_size) {
+    if (end_offset > memory->min_memory_size) {
       __ emit_cond_jump(kUnsignedGreaterThanEqual, trap_label, kIntPtrKind,
                         end_offset_reg.gp(), mem_size.gp(), trapping);
     }
@@ -3109,8 +3116,9 @@ class LiftoffCompiler {
     // Get one register for computing the effective offset (offset + index).
     LiftoffRegister effective_offset =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-    bool is_memory64 = env_->module->is_memory64;
-    if (is_memory64 && !kNeedI64RegPair) {
+    // TODO(14259): Support multiple memories.
+    const WasmMemory* memory = env_->module->memories.data();
+    if (memory->is_memory64 && !kNeedI64RegPair) {
       __ LoadConstant(effective_offset,
                       WasmValue(static_cast<uint64_t>(offset)));
       if (index != no_reg) {
@@ -3138,7 +3146,7 @@ class LiftoffCompiler {
     LiftoffRegister data = effective_offset;
 
     // Now store all information into the MemoryTracingInfo struct.
-    if (kSystemPointerSize == 8 && !is_memory64) {
+    if (kSystemPointerSize == 8 && !memory->is_memory64) {
       // Zero-extend the effective offset to u64.
       CHECK(__ emit_type_conversion(kExprI64UConvertI32, data, effective_offset,
                                     nullptr));
@@ -3170,8 +3178,9 @@ class LiftoffCompiler {
     __ DeallocateStackSlot(sizeof(MemoryTracingInfo));
   }
 
-  bool IndexStaticallyInBounds(const LiftoffAssembler::VarState& index_slot,
-                               int access_size, uintptr_t* offset) {
+  bool IndexStaticallyInBounds(const WasmMemory* memory,
+                               const VarState& index_slot, int access_size,
+                               uintptr_t* offset) {
     if (!index_slot.is_const()) return false;
 
     // Potentially zero extend index (which is a 32-bit constant).
@@ -3180,7 +3189,7 @@ class LiftoffCompiler {
 
     if (effective_offset < index  // overflow
         || !base::IsInBounds<uintptr_t>(effective_offset, access_size,
-                                        env_->module->min_memory_size)) {
+                                        memory->min_memory_size)) {
       return false;
     }
 
@@ -3188,24 +3197,36 @@ class LiftoffCompiler {
     return true;
   }
 
-  V8_INLINE Register GetMemoryStart(LiftoffRegList pinned) {
-    Register memory_start = __ cache_state()->cached_mem_start;
-    if (V8_UNLIKELY(memory_start == no_reg)) {
-      memory_start = GetMemoryStart_Slow(pinned);
+  V8_INLINE Register GetMemoryStart(int memory_index, LiftoffRegList pinned) {
+    if (memory_index == __ cache_state()->cached_mem_index) {
+      Register memory_start = __ cache_state()->cached_mem_start;
+      DCHECK_NE(no_reg, memory_start);
+      return memory_start;
     }
-    return memory_start;
+    return GetMemoryStart_Slow(memory_index, pinned);
   }
 
   V8_NOINLINE V8_PRESERVE_MOST Register
-  GetMemoryStart_Slow(LiftoffRegList pinned) {
-    DCHECK_EQ(no_reg, __ cache_state()->cached_mem_start);
+  GetMemoryStart_Slow(int memory_index, LiftoffRegList pinned) {
+    // This method should only be called if we cannot use the cached memory
+    // start.
+    DCHECK_NE(memory_index, __ cache_state()->cached_mem_index);
+    __ cache_state()->ClearCachedMemStartRegister();
     SCOPED_CODE_COMMENT("load memory start");
     Register memory_start = __ GetUnusedRegister(kGpReg, pinned).gp();
-    LOAD_INSTANCE_FIELD(memory_start, MemoryStart, kSystemPointerSize, pinned);
+    if (memory_index == 0) {
+      LOAD_INSTANCE_FIELD(memory_start, Memory0Start, kSystemPointerSize,
+                          pinned);
+    } else {
+      LOAD_TAGGED_PTR_INSTANCE_FIELD(memory_start, MemoryBasesAndSizes, pinned);
+      int buffer_offset = wasm::ObjectAccess::ToTagged(ByteArray::kHeaderSize) +
+                          kSystemPointerSize * memory_index * 2;
+      __ LoadFullPointer(memory_start, memory_start, buffer_offset);
+    }
 #ifdef V8_ENABLE_SANDBOX
     __ DecodeSandboxedPointer(memory_start);
 #endif
-    __ cache_state()->SetMemStartCacheRegister(memory_start);
+    __ cache_state()->SetMemStartCacheRegister(memory_start, memory_index);
     return memory_start;
   }
 
@@ -3224,33 +3245,33 @@ class LiftoffCompiler {
     // below, if this is not a statically-in-bounds index).
     auto& index_slot = __ cache_state()->stack_state.back();
     DCHECK_EQ(index_val.type.kind(), index_slot.kind());
-    DCHECK(index_slot.kind() == kI32 || index_slot.kind() == kI64);
-    bool i64_offset = index_slot.kind() == kI64;
-    if (IndexStaticallyInBounds(index_slot, type.size(), &offset)) {
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32, index_slot.kind());
+    if (IndexStaticallyInBounds(imm.memory, index_slot, type.size(), &offset)) {
       __ cache_state()->stack_state.pop_back();
       SCOPED_CODE_COMMENT("load from memory (constant offset)");
       LiftoffRegList pinned;
-      Register mem = pinned.set(GetMemoryStart(pinned));
+      Register mem = pinned.set(GetMemoryStart(imm.memory->index, pinned));
       LiftoffRegister value = pinned.set(__ GetUnusedRegister(rc, pinned));
       __ Load(value, mem, no_reg, offset, type, nullptr, true, i64_offset);
       __ PushRegister(kind, value);
     } else {
       LiftoffRegister full_index = __ PopToRegister();
-      index = BoundsCheckMem(decoder, type.size(), offset, full_index, {},
-                             kDontForceCheck);
+      index = BoundsCheckMem(decoder, imm.memory, type.size(), offset,
+                             full_index, {}, kDontForceCheck);
 
       SCOPED_CODE_COMMENT("load from memory");
       LiftoffRegList pinned{index};
 
       // Load the memory start address only now to reduce register pressure
       // (important on ia32).
-      Register mem = pinned.set(GetMemoryStart(pinned));
+      Register mem = pinned.set(GetMemoryStart(imm.memory->index, pinned));
       LiftoffRegister value = pinned.set(__ GetUnusedRegister(rc, pinned));
 
       uint32_t protected_load_pc = 0;
       __ Load(value, mem, index, offset, type, &protected_load_pc, true,
               i64_offset);
-      if (env_->bounds_checks == kTrapHandler) {
+      if (imm.memory->bounds_checks == kTrapHandler) {
         AddOutOfLineTrap(decoder, WasmCode::kThrowWasmTrapMemOutOfBounds,
                          protected_load_pc);
       }
@@ -3258,6 +3279,8 @@ class LiftoffCompiler {
     }
 
     if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
       TraceMemoryOperation(false, type.mem_type().representation(), index,
                            offset, decoder->position());
     }
@@ -3279,25 +3302,28 @@ class LiftoffCompiler {
     // bytes.
     uint32_t access_size =
         transform == LoadTransformationKind::kExtend ? 8 : type.size();
-    Register index = BoundsCheckMem(decoder, access_size, imm.offset,
-                                    full_index, {}, kDontForceCheck);
+    Register index =
+        BoundsCheckMem(decoder, imm.memory, access_size, imm.offset, full_index,
+                       {}, kDontForceCheck);
 
     uintptr_t offset = imm.offset;
     LiftoffRegList pinned{index};
     CODE_COMMENT("load with transformation");
-    Register addr = GetMemoryStart(pinned);
+    Register addr = GetMemoryStart(imm.mem_index, pinned);
     LiftoffRegister value = __ GetUnusedRegister(reg_class_for(kS128), {});
     uint32_t protected_load_pc = 0;
     __ LoadTransform(value, addr, index, offset, type, transform,
                      &protected_load_pc);
 
-    if (env_->bounds_checks == kTrapHandler) {
+    if (imm.memory->bounds_checks == kTrapHandler) {
       AddOutOfLineTrap(decoder, WasmCode::kThrowWasmTrapMemOutOfBounds,
                        protected_load_pc);
     }
     __ PushRegister(kS128, value);
 
     if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
       // Again load extend is different.
       MachineRepresentation mem_rep =
           transform == LoadTransformationKind::kExtend
@@ -3317,22 +3343,23 @@ class LiftoffCompiler {
     LiftoffRegList pinned;
     LiftoffRegister value = pinned.set(__ PopToRegister());
     LiftoffRegister full_index = __ PopToRegister();
-    Register index = BoundsCheckMem(decoder, type.size(), imm.offset,
-                                    full_index, pinned, kDontForceCheck);
+    Register index =
+        BoundsCheckMem(decoder, imm.memory, type.size(), imm.offset, full_index,
+                       pinned, kDontForceCheck);
 
-    DCHECK(_index.type.kind() == kI32 || _index.type.kind() == kI64);
-    bool i64_offset = _index.type.kind() == kI64;
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32, _index.type.kind());
 
     uintptr_t offset = imm.offset;
     pinned.set(index);
     CODE_COMMENT("load lane");
-    Register addr = GetMemoryStart(pinned);
+    Register addr = GetMemoryStart(imm.mem_index, pinned);
     LiftoffRegister result = __ GetUnusedRegister(reg_class_for(kS128), {});
     uint32_t protected_load_pc = 0;
 
     __ LoadLane(result, value, addr, index, offset, type, laneidx,
                 &protected_load_pc, i64_offset);
-    if (env_->bounds_checks == kTrapHandler) {
+    if (imm.memory->bounds_checks == kTrapHandler) {
       AddOutOfLineTrap(decoder, WasmCode::kThrowWasmTrapMemOutOfBounds,
                        protected_load_pc);
     }
@@ -3340,6 +3367,8 @@ class LiftoffCompiler {
     __ PushRegister(kS128, result);
 
     if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
       TraceMemoryOperation(false, type.mem_type().representation(), index,
                            offset, decoder->position());
     }
@@ -3360,36 +3389,40 @@ class LiftoffCompiler {
 
     auto& index_slot = __ cache_state()->stack_state.back();
     DCHECK_EQ(index_val.type.kind(), index_slot.kind());
-    DCHECK(index_slot.kind() == kI32 || index_slot.kind() == kI64);
-    bool i64_offset = index_slot.kind() == kI64;
-    if (IndexStaticallyInBounds(index_slot, type.size(), &offset)) {
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32, index_val.type.kind());
+    if (IndexStaticallyInBounds(imm.memory, index_slot, type.size(), &offset)) {
       __ cache_state()->stack_state.pop_back();
       SCOPED_CODE_COMMENT("store to memory (constant offset)");
-      Register mem = pinned.set(GetMemoryStart(pinned));
+      Register mem = pinned.set(GetMemoryStart(imm.memory->index, pinned));
       __ Store(mem, no_reg, offset, value, type, pinned, nullptr, true,
                i64_offset);
     } else {
       LiftoffRegister full_index = __ PopToRegister(pinned);
-      index = BoundsCheckMem(decoder, type.size(), imm.offset, full_index,
-                             pinned, kDontForceCheck);
+      ForceCheck force_check =
+          kPartialOOBWritesAreNoops ? kDontForceCheck : kDoForceCheck;
+      index = BoundsCheckMem(decoder, imm.memory, type.size(), imm.offset,
+                             full_index, pinned, force_check);
 
       pinned.set(index);
       SCOPED_CODE_COMMENT("store to memory");
       uint32_t protected_store_pc = 0;
       // Load the memory start address only now to reduce register pressure
       // (important on ia32).
-      Register mem = pinned.set(GetMemoryStart(pinned));
+      Register mem = pinned.set(GetMemoryStart(imm.memory->index, pinned));
       LiftoffRegList outer_pinned;
       if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) outer_pinned.set(index);
       __ Store(mem, index, offset, value, type, outer_pinned,
                &protected_store_pc, true, i64_offset);
-      if (env_->bounds_checks == kTrapHandler) {
+      if (imm.memory->bounds_checks == kTrapHandler) {
         AddOutOfLineTrap(decoder, WasmCode::kThrowWasmTrapMemOutOfBounds,
                          protected_store_pc);
       }
     }
 
     if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
       TraceMemoryOperation(true, type.mem_rep(), index, offset,
                            decoder->position());
     }
@@ -3402,66 +3435,84 @@ class LiftoffCompiler {
     LiftoffRegList pinned;
     LiftoffRegister value = pinned.set(__ PopToRegister());
     LiftoffRegister full_index = __ PopToRegister(pinned);
-    Register index = BoundsCheckMem(decoder, type.size(), imm.offset,
-                                    full_index, pinned, kDontForceCheck);
+    ForceCheck force_check =
+        kPartialOOBWritesAreNoops ? kDontForceCheck : kDoForceCheck;
+    Register index =
+        BoundsCheckMem(decoder, imm.memory, type.size(), imm.offset, full_index,
+                       pinned, force_check);
 
-    DCHECK(_index.type.kind() == kI32 || _index.type.kind() == kI64);
-    bool i64_offset = _index.type.kind() == kI64;
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32, _index.type.kind());
 
     uintptr_t offset = imm.offset;
     pinned.set(index);
     CODE_COMMENT("store lane to memory");
-    Register addr = pinned.set(GetMemoryStart(pinned));
+    Register addr = pinned.set(GetMemoryStart(imm.mem_index, pinned));
     uint32_t protected_store_pc = 0;
     __ StoreLane(addr, index, offset, value, type, lane, &protected_store_pc,
                  i64_offset);
-    if (env_->bounds_checks == kTrapHandler) {
+    if (imm.memory->bounds_checks == kTrapHandler) {
       AddOutOfLineTrap(decoder, WasmCode::kThrowWasmTrapMemOutOfBounds,
                        protected_store_pc);
     }
     if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
       TraceMemoryOperation(true, type.mem_rep(), index, offset,
                            decoder->position());
     }
   }
 
-  void CurrentMemoryPages(FullDecoder* /* decoder */, Value* /* result */) {
-    Register mem_size = __ GetUnusedRegister(kGpReg, {}).gp();
-    LOAD_INSTANCE_FIELD(mem_size, MemorySize, kSystemPointerSize, {});
-    __ emit_ptrsize_shri(mem_size, mem_size, kWasmPageSizeLog2);
-    LiftoffRegister result{mem_size};
-    if (env_->module->is_memory64 && kNeedI64RegPair) {
+  void CurrentMemoryPages(FullDecoder* /* decoder */,
+                          const MemoryIndexImmediate& imm,
+                          Value* /* result */) {
+    LiftoffRegList pinned;
+    LiftoffRegister mem_size = pinned.set(__ GetUnusedRegister(kGpReg, pinned));
+    if (imm.memory->index == 0) {
+      LOAD_INSTANCE_FIELD(mem_size.gp(), Memory0Size, kSystemPointerSize,
+                          pinned);
+    } else {
+      LOAD_TAGGED_PTR_INSTANCE_FIELD(mem_size.gp(), MemoryBasesAndSizes,
+                                     pinned);
+      int buffer_offset = wasm::ObjectAccess::ToTagged(ByteArray::kHeaderSize) +
+                          kSystemPointerSize * (imm.memory->index * 2 + 1);
+      __ LoadFullPointer(mem_size.gp(), mem_size.gp(), buffer_offset);
+    }
+    // Convert bytes to pages.
+    __ emit_ptrsize_shri(mem_size.gp(), mem_size.gp(), kWasmPageSizeLog2);
+    if (imm.memory->is_memory64 && kNeedI64RegPair) {
       LiftoffRegister high_word =
           __ GetUnusedRegister(kGpReg, LiftoffRegList{mem_size});
       // The high word is always 0 on 32-bit systems.
       __ LoadConstant(high_word, WasmValue{uint32_t{0}});
-      result = LiftoffRegister::ForPair(mem_size, high_word.gp());
+      mem_size = LiftoffRegister::ForPair(mem_size.gp(), high_word.gp());
     }
-    __ PushRegister(env_->module->is_memory64 ? kI64 : kI32, result);
+    __ PushRegister(imm.memory->is_memory64 ? kI64 : kI32, mem_size);
   }
 
-  void MemoryGrow(FullDecoder* decoder, const Value& value, Value* result_val) {
+  void MemoryGrow(FullDecoder* decoder, const MemoryIndexImmediate& imm,
+                  const Value& value, Value* result_val) {
     // Pop the input, then spill all cache registers to make the runtime call.
     LiftoffRegList pinned;
-    LiftoffRegister input = pinned.set(__ PopToRegister());
+    LiftoffRegister num_pages = pinned.set(__ PopToRegister());
     __ SpillAllRegisters();
 
     LiftoffRegister result = pinned.set(__ GetUnusedRegister(kGpReg, pinned));
 
     Label done;
 
-    if (env_->module->is_memory64) {
+    if (imm.memory->is_memory64) {
       // If the high word is not 0, this will always fail (would grow by
       // >=256TB). The int32_t value will be sign-extended below.
       __ LoadConstant(result, WasmValue(int32_t{-1}));
       if (kNeedI64RegPair) {
         FREEZE_STATE(all_spilled_anyway);
-        __ emit_cond_jump(kNotEqual, &done, kI32, input.high_gp(), no_reg,
+        __ emit_cond_jump(kNotEqual, &done, kI32, num_pages.high_gp(), no_reg,
                           all_spilled_anyway);
-        input = input.low();
+        num_pages = num_pages.low();
       } else {
         LiftoffRegister high_word = __ GetUnusedRegister(kGpReg, pinned);
-        __ emit_i64_shri(high_word, input, 32);
+        __ emit_i64_shri(high_word, num_pages, 32);
         FREEZE_STATE(all_spilled_anyway);
         __ emit_cond_jump(kNotEqual, &done, kI32, high_word.gp(), no_reg,
                           all_spilled_anyway);
@@ -3470,11 +3521,20 @@ class LiftoffCompiler {
 
     WasmMemoryGrowDescriptor descriptor;
     DCHECK_EQ(0, descriptor.GetStackParameterCount());
-    DCHECK_EQ(1, descriptor.GetRegisterParameterCount());
+    DCHECK_EQ(2, descriptor.GetRegisterParameterCount());
     DCHECK_EQ(machine_type(kI32), descriptor.GetParameterType(0));
+    DCHECK_EQ(machine_type(kI32), descriptor.GetParameterType(1));
 
-    Register param_reg = descriptor.GetRegisterParameter(0);
-    if (input.gp() != param_reg) __ Move(param_reg, input.gp(), kI32);
+    Register num_pages_param_reg = descriptor.GetRegisterParameter(1);
+    if (num_pages.gp() != num_pages_param_reg) {
+      __ Move(num_pages_param_reg, num_pages.gp(), kI32);
+    }
+
+    // Load the constant after potentially moving the {num_pages} register to
+    // avoid overwriting it.
+    Register mem_index_param_reg = descriptor.GetRegisterParameter(0);
+    __ LoadConstant(LiftoffRegister{mem_index_param_reg},
+                    WasmValue(imm.memory->index));
 
     __ CallRuntimeStub(WasmCode::kWasmMemoryGrow);
     DefineSafepoint();
@@ -3486,7 +3546,7 @@ class LiftoffCompiler {
 
     __ bind(&done);
 
-    if (env_->module->is_memory64) {
+    if (imm.memory->is_memory64) {
       LiftoffRegister result64 = result;
       if (kNeedI64RegPair) result64 = __ GetUnusedRegister(kGpRegPair, pinned);
       __ emit_type_conversion(kExprI64SConvertI32, result64, result, nullptr);
@@ -3496,22 +3556,43 @@ class LiftoffCompiler {
     }
   }
 
+  base::OwnedVector<ValueType> GetStackValueTypesForDebugging(
+      FullDecoder* decoder) {
+    DCHECK(for_debugging_);
+    auto stack_value_types =
+        base::OwnedVector<ValueType>::NewForOverwrite(decoder->stack_size());
+
+    int depth = 0;
+    for (ValueType& type : base::Reversed(stack_value_types)) {
+      type = decoder->stack_value(++depth)->type;
+    }
+    return stack_value_types;
+  }
+
   base::OwnedVector<DebugSideTable::Entry::Value>
   GetCurrentDebugSideTableEntries(
       FullDecoder* decoder,
       DebugSideTableBuilder::AssumeSpilling assume_spilling) {
     auto& stack_state = __ cache_state()->stack_state;
+
+#ifdef DEBUG
+    // For value types, we use the cached {stack_value_types_for_debugging_}
+    // vector (gathered in {NextInstruction}). This still includes call
+    // arguments, which Liftoff has already popped at this point. Hence the size
+    // of this vector can be larger than the Liftoff stack size. Just ignore
+    // that and use the lower part only.
+    size_t expected_value_stack_size =
+        stack_state.size() - num_exceptions_ - __ num_locals();
+    DCHECK_LE(expected_value_stack_size,
+              stack_value_types_for_debugging_.size());
+#endif
+
     auto values =
         base::OwnedVector<DebugSideTable::Entry::Value>::NewForOverwrite(
             stack_state.size());
 
-    // For function calls, the decoder still has the arguments on the stack, but
-    // Liftoff already popped them. Hence {decoder->stack_size()} can be bigger
-    // than expected. Just ignore that and use the lower part only.
-    DCHECK_LE(stack_state.size() - num_exceptions_,
-              decoder->num_locals() + decoder->stack_size());
     int index = 0;
-    int decoder_stack_index = decoder->stack_size();
+    ValueType* stack_value_type_ptr = stack_value_types_for_debugging_.begin();
     // Iterate the operand stack control block by control block, so that we can
     // handle the implicit exception value for try blocks.
     for (int j = decoder->control_depth() - 1; j >= 0; j--) {
@@ -3521,18 +3602,23 @@ class LiftoffCompiler {
                           ? next_control->stack_depth + __ num_locals() +
                                 next_control->num_exceptions
                           : __ cache_state()->stack_height();
-      bool exception = control->is_try_catch() || control->is_try_catchall();
+      bool exception_on_stack =
+          control->is_try_catch() || control->is_try_catchall();
       for (; index < end_index; ++index) {
         auto& slot = stack_state[index];
         auto& value = values[index];
         value.index = index;
-        ValueType type =
-            index < static_cast<int>(__ num_locals())
-                ? decoder->local_type(index)
-            : exception ? ValueType::Ref(HeapType::kAny)
-                        : decoder->stack_value(decoder_stack_index--)->type;
-        DCHECK(CompatibleStackSlotTypes(slot.kind(), type.kind()));
-        value.type = type;
+        if (exception_on_stack) {
+          value.type = ValueType::Ref(HeapType::kAny);
+          exception_on_stack = false;
+        } else if (index < static_cast<int>(__ num_locals())) {
+          value.type = decoder->local_type(index);
+        } else {
+          DCHECK_LT(stack_value_type_ptr,
+                    stack_value_types_for_debugging_.end());
+          value.type = *stack_value_type_ptr++;
+        }
+        DCHECK(CompatibleStackSlotTypes(slot.kind(), value.type.kind()));
         switch (slot.loc()) {
           case kIntConst:
             value.storage = DebugSideTable::Entry::kConstant;
@@ -3552,10 +3638,12 @@ class LiftoffCompiler {
             value.stack_offset = slot.offset();
             break;
         }
-        exception = false;
       }
     }
     DCHECK_EQ(values.size(), index);
+    DCHECK_EQ(
+        stack_value_types_for_debugging_.data() + expected_value_stack_size,
+        stack_value_type_ptr);
     return values;
   }
 
@@ -3589,7 +3677,7 @@ class LiftoffCompiler {
   void CallIndirect(FullDecoder* decoder, const Value& index_val,
                     const CallIndirectImmediate& imm, const Value args[],
                     Value returns[]) {
-    CallIndirect(decoder, index_val, imm, kNoTailCall);
+    CallIndirect(decoder, imm, kNoTailCall);
   }
 
   void CallRef(FullDecoder* decoder, const Value& func_ref,
@@ -3608,7 +3696,7 @@ class LiftoffCompiler {
                           const CallIndirectImmediate& imm,
                           const Value args[]) {
     TierupCheckOnTailCall(decoder);
-    CallIndirect(decoder, index_val, imm, kTailCall);
+    CallIndirect(decoder, imm, kTailCall);
   }
 
   void ReturnCallRef(FullDecoder* decoder, const Value& func_ref,
@@ -3632,15 +3720,12 @@ class LiftoffCompiler {
         pinned.set(pass_null_along_branch ? __ PeekToRegister(0, pinned)
                                           : __ PopToRegister(pinned));
     Register null = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-    Register tmp = NeedsTierupCheck(decoder, depth)
-                       ? pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp()
-                       : no_reg;
     LoadNullValueForCompare(null, pinned, ref_object.type);
     {
       FREEZE_STATE(frozen);
       __ emit_cond_jump(kNotEqual, &cont_false, ref_object.type.kind(),
                         ref.gp(), null, frozen);
-      BrOrRetImpl(decoder, depth, null, tmp);
+      BrOrRetImpl(decoder, depth);
     }
     __ bind(&cont_false);
     if (!pass_null_along_branch) {
@@ -3662,16 +3747,13 @@ class LiftoffCompiler {
     LiftoffRegister ref = pinned.set(__ PeekToRegister(0, pinned));
 
     Register null = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-    Register tmp = NeedsTierupCheck(decoder, depth)
-                       ? pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp()
-                       : no_reg;
     LoadNullValueForCompare(null, pinned, ref_object.type);
     {
       FREEZE_STATE(frozen);
       __ emit_cond_jump(kEqual, &cont_false, ref_object.type.kind(), ref.gp(),
                         null, frozen);
 
-      BrOrRetImpl(decoder, depth, null, tmp);
+      BrOrRetImpl(decoder, depth);
     }
     // Drop the reference if we are not branching.
     if (drop_null_on_fallthrough) __ DropValues(1);
@@ -3740,7 +3822,7 @@ class LiftoffCompiler {
   void EmitSimdShiftOp(EmitFn fn, EmitFnImm fnImm) {
     static constexpr RegClass result_rc = reg_class_for(kS128);
 
-    LiftoffAssembler::VarState rhs_slot = __ cache_state()->stack_state.back();
+    VarState rhs_slot = __ cache_state()->stack_state.back();
     // Check if the RHS is an immediate.
     if (rhs_slot.is_const()) {
       __ cache_state()->stack_state.pop_back();
@@ -3770,8 +3852,7 @@ class LiftoffCompiler {
     LiftoffRegister dst = __ GetUnusedRegister(rc, {src}, {});
     if (!(asm_.*emit_fn)(dst, src)) {
       // Return v128 via stack for ARM.
-      auto sig_v_s = MakeSig::Params(kS128);
-      GenerateCCall(&dst, &sig_v_s, kS128, &src, ext_ref());
+      GenerateCCall(&dst, kVoid, kS128, {VarState{kS128, src, 0}}, ext_ref());
     }
     if (V8_UNLIKELY(nondeterminism_)) {
       LiftoffRegList pinned{dst};
@@ -3793,8 +3874,8 @@ class LiftoffCompiler {
     return;
   }
 
-  void SimdOp(FullDecoder* decoder, WasmOpcode opcode, base::Vector<Value> args,
-              Value* result) {
+  void SimdOp(FullDecoder* decoder, WasmOpcode opcode, const Value* /* args */,
+              Value* /* result */) {
     if (!CpuFeatures::SupportsWasmSimd128()) {
       return unsupported(decoder, kSimd, "simd");
     }
@@ -4402,18 +4483,19 @@ class LiftoffCompiler {
 
   void SimdLaneOp(FullDecoder* decoder, WasmOpcode opcode,
                   const SimdLaneImmediate& imm,
-                  const base::Vector<Value> inputs, Value* result) {
+                  base::Vector<const Value> inputs, Value* result) {
     if (!CpuFeatures::SupportsWasmSimd128()) {
       return unsupported(decoder, kSimd, "simd");
     }
     switch (opcode) {
-#define CASE_SIMD_EXTRACT_LANE_OP(opcode, kind, fn)                           \
-  case wasm::kExpr##opcode:                                                   \
-    EmitSimdExtractLaneOp<kS128, k##kind>(                                    \
-        [=](LiftoffRegister dst, LiftoffRegister lhs, uint8_t imm_lane_idx) { \
-          __ emit_##fn(dst, lhs, imm_lane_idx);                               \
-        },                                                                    \
-        imm);                                                                 \
+#define CASE_SIMD_EXTRACT_LANE_OP(opcode, kind, fn)      \
+  case wasm::kExpr##opcode:                              \
+    EmitSimdExtractLaneOp<kS128, k##kind>(               \
+        [this](LiftoffRegister dst, LiftoffRegister lhs, \
+               uint8_t imm_lane_idx) {                   \
+          __ emit_##fn(dst, lhs, imm_lane_idx);          \
+        },                                               \
+        imm);                                            \
     break;
       CASE_SIMD_EXTRACT_LANE_OP(I8x16ExtractLaneS, I32, i8x16_extract_lane_s)
       CASE_SIMD_EXTRACT_LANE_OP(I8x16ExtractLaneU, I32, i8x16_extract_lane_u)
@@ -4424,14 +4506,14 @@ class LiftoffCompiler {
       CASE_SIMD_EXTRACT_LANE_OP(F32x4ExtractLane, F32, f32x4_extract_lane)
       CASE_SIMD_EXTRACT_LANE_OP(F64x2ExtractLane, F64, f64x2_extract_lane)
 #undef CASE_SIMD_EXTRACT_LANE_OP
-#define CASE_SIMD_REPLACE_LANE_OP(opcode, kind, fn)                          \
-  case wasm::kExpr##opcode:                                                  \
-    EmitSimdReplaceLaneOp<k##kind>(                                          \
-        [=](LiftoffRegister dst, LiftoffRegister src1, LiftoffRegister src2, \
-            uint8_t imm_lane_idx) {                                          \
-          __ emit_##fn(dst, src1, src2, imm_lane_idx);                       \
-        },                                                                   \
-        imm);                                                                \
+#define CASE_SIMD_REPLACE_LANE_OP(opcode, kind, fn)          \
+  case wasm::kExpr##opcode:                                  \
+    EmitSimdReplaceLaneOp<k##kind>(                          \
+        [this](LiftoffRegister dst, LiftoffRegister src1,    \
+               LiftoffRegister src2, uint8_t imm_lane_idx) { \
+          __ emit_##fn(dst, src1, src2, imm_lane_idx);       \
+        },                                                   \
+        imm);                                                \
     break;
       CASE_SIMD_REPLACE_LANE_OP(I8x16ReplaceLane, I32, i8x16_replace_lane)
       CASE_SIMD_REPLACE_LANE_OP(I16x8ReplaceLane, I32, i16x8_replace_lane)
@@ -4692,8 +4774,7 @@ class LiftoffCompiler {
     __ PushRegister(kind, value);
   }
 
-  void GetExceptionValues(FullDecoder* decoder,
-                          const LiftoffAssembler::VarState& exception_var,
+  void GetExceptionValues(FullDecoder* decoder, const VarState& exception_var,
                           const WasmTag* tag) {
     LiftoffRegList pinned;
     CODE_COMMENT("get exception values");
@@ -4742,7 +4823,7 @@ class LiftoffCompiler {
   }
 
   void Throw(FullDecoder* decoder, const TagIndexImmediate& imm,
-             const base::Vector<Value>& /* args */) {
+             const Value* /* args */) {
     LiftoffRegList pinned;
 
     // Load the encoded size in a register for the builtin call.
@@ -4752,11 +4833,11 @@ class LiftoffCompiler {
     __ LoadConstant(encoded_size_reg, WasmValue::ForUintPtr(encoded_size));
 
     // Call the WasmAllocateFixedArray builtin to create the values array.
-    CallRuntimeStub(WasmCode::kWasmAllocateFixedArray,
-                    MakeSig::Returns(kIntPtrKind).Params(kIntPtrKind),
-                    {LiftoffAssembler::VarState{
-                        kIntPtrKind, LiftoffRegister{encoded_size_reg}, 0}},
-                    decoder->position());
+    CallRuntimeStub(
+        WasmCode::kWasmAllocateFixedArray,
+        MakeSig::Returns(kIntPtrKind).Params(kIntPtrKind),
+        {VarState{kIntPtrKind, LiftoffRegister{encoded_size_reg}, 0}},
+        decoder->position());
     MaybeOSR();
 
     // The FixedArray for the exception values is now in the first gp return
@@ -4788,8 +4869,8 @@ class LiftoffCompiler {
     // Finally, call WasmThrow.
     CallRuntimeStub(WasmCode::kWasmThrow,
                     MakeSig::Params(kIntPtrKind, kIntPtrKind),
-                    {LiftoffAssembler::VarState{kIntPtrKind, exception_tag, 0},
-                     LiftoffAssembler::VarState{kIntPtrKind, values_array, 0}},
+                    {VarState{kIntPtrKind, exception_tag, 0},
+                     VarState{kIntPtrKind, values_array, 0}},
                     decoder->position());
 
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
@@ -4803,20 +4884,25 @@ class LiftoffCompiler {
                       const MemoryAccessImmediate& imm) {
     LiftoffRegList pinned;
     LiftoffRegister value = pinned.set(__ PopToRegister());
-    bool i64_offset = __ cache_state()->stack_state.back().kind() == kI64;
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32,
+              __ cache_state()->stack_state.back().kind());
     LiftoffRegister full_index = __ PopToRegister(pinned);
-    Register index = BoundsCheckMem(decoder, type.size(), imm.offset,
-                                    full_index, pinned, kDoForceCheck);
+    Register index =
+        BoundsCheckMem(decoder, imm.memory, type.size(), imm.offset, full_index,
+                       pinned, kDoForceCheck);
 
     pinned.set(index);
     AlignmentCheckMem(decoder, type.size(), imm.offset, index, pinned);
     uintptr_t offset = imm.offset;
     CODE_COMMENT("atomic store to memory");
-    Register addr = pinned.set(GetMemoryStart(pinned));
+    Register addr = pinned.set(GetMemoryStart(imm.mem_index, pinned));
     LiftoffRegList outer_pinned;
     if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) outer_pinned.set(index);
     __ AtomicStore(addr, index, offset, value, type, outer_pinned, i64_offset);
     if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
       TraceMemoryOperation(true, type.mem_rep(), index, offset,
                            decoder->position());
     }
@@ -4825,22 +4911,26 @@ class LiftoffCompiler {
   void AtomicLoadMem(FullDecoder* decoder, LoadType type,
                      const MemoryAccessImmediate& imm) {
     ValueKind kind = type.value_type().kind();
-    bool i64_offset = __ cache_state()->stack_state.back().kind() == kI64;
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32,
+              __ cache_state()->stack_state.back().kind());
     LiftoffRegister full_index = __ PopToRegister();
-    Register index = BoundsCheckMem(decoder, type.size(), imm.offset,
-                                    full_index, {}, kDoForceCheck);
+    Register index = BoundsCheckMem(decoder, imm.memory, type.size(),
+                                    imm.offset, full_index, {}, kDoForceCheck);
 
     LiftoffRegList pinned{index};
     AlignmentCheckMem(decoder, type.size(), imm.offset, index, pinned);
     uintptr_t offset = imm.offset;
     CODE_COMMENT("atomic load from memory");
-    Register addr = pinned.set(GetMemoryStart(pinned));
+    Register addr = pinned.set(GetMemoryStart(imm.mem_index, pinned));
     RegClass rc = reg_class_for(kind);
     LiftoffRegister value = pinned.set(__ GetUnusedRegister(rc, pinned));
     __ AtomicLoad(value, addr, index, offset, type, pinned, i64_offset);
     __ PushRegister(kind, value);
 
     if (V8_UNLIKELY(v8_flags.trace_wasm_memory)) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
       TraceMemoryOperation(false, type.mem_type().representation(), index,
                            offset, decoder->position());
     }
@@ -4871,17 +4961,20 @@ class LiftoffCompiler {
     LiftoffRegister result =
         pinned.set(__ GetUnusedRegister(value.reg_class(), pinned));
 #endif
-    bool i64_offset = __ cache_state()->stack_state.back().kind() == kI64;
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32,
+              __ cache_state()->stack_state.back().kind());
     LiftoffRegister full_index = __ PopToRegister(pinned);
-    Register index = BoundsCheckMem(decoder, type.size(), imm.offset,
-                                    full_index, pinned, kDoForceCheck);
+    Register index =
+        BoundsCheckMem(decoder, imm.memory, type.size(), imm.offset, full_index,
+                       pinned, kDoForceCheck);
 
     pinned.set(index);
     AlignmentCheckMem(decoder, type.size(), imm.offset, index, pinned);
 
     CODE_COMMENT("atomic binop");
     uintptr_t offset = imm.offset;
-    Register addr = pinned.set(GetMemoryStart(pinned));
+    Register addr = pinned.set(GetMemoryStart(imm.mem_index, pinned));
 
     (asm_.*emit_fn)(addr, index, offset, value, result, type, i64_offset);
     __ PushRegister(result_kind, result);
@@ -4896,14 +4989,21 @@ class LiftoffCompiler {
     // single register. Afterwards we load all remaining values into the
     // other registers.
     LiftoffRegister full_index = __ PeekToRegister(2, {});
-    Register index = BoundsCheckMem(decoder, type.size(), imm.offset,
-                                    full_index, {}, kDoForceCheck);
+    Register index = BoundsCheckMem(decoder, imm.memory, type.size(),
+                                    imm.offset, full_index, {}, kDoForceCheck);
     LiftoffRegList pinned{index};
     AlignmentCheckMem(decoder, type.size(), imm.offset, index, pinned);
 
     uintptr_t offset = imm.offset;
     Register addr = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-    LOAD_INSTANCE_FIELD(addr, MemoryStart, kSystemPointerSize, pinned);
+    if (imm.memory->index == 0) {
+      LOAD_INSTANCE_FIELD(addr, Memory0Start, kSystemPointerSize, pinned);
+    } else {
+      LOAD_TAGGED_PTR_INSTANCE_FIELD(addr, MemoryBasesAndSizes, pinned);
+      int buffer_offset = wasm::ObjectAccess::ToTagged(ByteArray::kHeaderSize) +
+                          kSystemPointerSize * imm.memory->index * 2;
+      __ LoadFullPointer(addr, addr, buffer_offset);
+    }
 #ifdef V8_ENABLE_SANDBOX
     __ DecodeSandboxedPointer(addr);
 #endif
@@ -4913,7 +5013,9 @@ class LiftoffCompiler {
     LiftoffRegister expected = pinned.set(__ PopToRegister(pinned));
 
     // Pop the index from the stack.
-    bool i64_offset = __ cache_state()->stack_state.back().kind() == kI64;
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32,
+              __ cache_state()->stack_state.back().kind());
     __ DropValues(1);
 
     LiftoffRegister result = expected;
@@ -4930,15 +5032,18 @@ class LiftoffCompiler {
     LiftoffRegList pinned;
     LiftoffRegister new_value = pinned.set(__ PopToRegister(pinned));
     LiftoffRegister expected = pinned.set(__ PopToRegister(pinned));
-    bool i64_offset = __ cache_state()->stack_state.back().kind() == kI64;
+    bool i64_offset = imm.memory->is_memory64;
+    DCHECK_EQ(i64_offset ? kI64 : kI32,
+              __ cache_state()->stack_state.back().kind());
     LiftoffRegister full_index = __ PopToRegister(pinned);
-    Register index = BoundsCheckMem(decoder, type.size(), imm.offset,
-                                    full_index, pinned, kDoForceCheck);
+    Register index =
+        BoundsCheckMem(decoder, imm.memory, type.size(), imm.offset, full_index,
+                       pinned, kDoForceCheck);
     pinned.set(index);
     AlignmentCheckMem(decoder, type.size(), imm.offset, index, pinned);
 
     uintptr_t offset = imm.offset;
-    Register addr = pinned.set(GetMemoryStart(pinned));
+    Register addr = pinned.set(GetMemoryStart(imm.mem_index, pinned));
     LiftoffRegister result =
         pinned.set(__ GetUnusedRegister(reg_class_for(result_kind), pinned));
 
@@ -4949,8 +5054,7 @@ class LiftoffCompiler {
   }
 
   void CallRuntimeStub(WasmCode::RuntimeStubId stub_id, const ValueKindSig& sig,
-                       std::initializer_list<LiftoffAssembler::VarState> params,
-                       int position) {
+                       std::initializer_list<VarState> params, int position) {
     CODE_COMMENT(
         (std::string{"call builtin: "} + GetRuntimeStubName(stub_id)).c_str());
     auto interface_descriptor = Builtins::CallInterfaceDescriptorFor(
@@ -4974,45 +5078,53 @@ class LiftoffCompiler {
 
   void AtomicWait(FullDecoder* decoder, ValueKind kind,
                   const MemoryAccessImmediate& imm) {
+    ValueKind index_kind;
     {
       LiftoffRegList pinned;
       LiftoffRegister full_index = __ PeekToRegister(2, pinned);
       Register index_reg =
-          BoundsCheckMem(decoder, value_kind_size(kind), imm.offset, full_index,
-                         pinned, kDoForceCheck);
+          BoundsCheckMem(decoder, imm.memory, value_kind_size(kind), imm.offset,
+                         full_index, pinned, kDoForceCheck);
       pinned.set(index_reg);
       AlignmentCheckMem(decoder, value_kind_size(kind), imm.offset, index_reg,
                         pinned);
 
       uintptr_t offset = imm.offset;
-      Register index_plus_offset =
-          __ cache_state()->is_used(LiftoffRegister(index_reg))
-              ? pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp()
-              : index_reg;
-      // TODO(clemensb): Skip this if memory is 64 bit.
-      __ emit_ptrsize_zeroextend_i32(index_plus_offset, index_reg);
+      Register index_plus_offset = index_reg;
+
+      if (__ cache_state()->is_used(LiftoffRegister(index_reg))) {
+        index_plus_offset =
+            pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
+        __ Move(index_plus_offset, index_reg, kIntPtrKind);
+      }
       if (offset) {
         __ emit_ptrsize_addi(index_plus_offset, index_plus_offset, offset);
       }
 
-      LiftoffAssembler::VarState& index =
-          __ cache_state()->stack_state.end()[-3];
+      VarState& index = __ cache_state()->stack_state.end()[-3];
 
       // We replace the index on the value stack with the `index_plus_offset`
       // calculated above. Thereby the BigInt allocation below does not
       // overwrite the calculated value by accident.
-      if (full_index != LiftoffRegister(index_plus_offset)) {
-        __ cache_state()->dec_used(full_index);
-        __ cache_state()->inc_used(LiftoffRegister(index_plus_offset));
-      }
-      index = LiftoffAssembler::VarState{
-          kIntPtrKind, LiftoffRegister{index_plus_offset}, index.offset()};
+      // The kind of `index_plus_offset has to be the same or smaller than the
+      // original kind of `index`. The kind of index is kI32 for memory32, and
+      // kI64 for memory64. On 64-bit platforms we can use in both cases the
+      // kind of `index` also for `index_plus_offset`. Note that
+      // `index_plus_offset` fits into a kI32 because we do a bounds check
+      // first.
+      // On 32-bit platforms, we have to use an kI32 also for memory64, because
+      // `index_plus_offset` does not exist in a register pair.
+      __ cache_state()->inc_used(LiftoffRegister(index_plus_offset));
+      if (index.is_reg()) __ cache_state()->dec_used(index.reg());
+      index_kind = index.kind() == kI32 ? kI32 : kIntPtrKind;
+
+      index = VarState{index_kind, LiftoffRegister{index_plus_offset},
+                       index.offset()};
     }
     {
       // Convert the top value of the stack (the timeout) from I64 to a BigInt,
       // which we can then pass to the atomic.wait builtin.
-      LiftoffAssembler::VarState i64_timeout =
-          __ cache_state()->stack_state.back();
+      VarState i64_timeout = __ cache_state()->stack_state.back();
       CallRuntimeStub(
           kNeedI64RegPair ? WasmCode::kI32PairToBigInt : WasmCode::kI64ToBigInt,
           MakeSig::Returns(kRef).Params(kI64), {i64_timeout},
@@ -5027,8 +5139,7 @@ class LiftoffCompiler {
     if (kind == kI32) {
       expected = __ PeekToRegister(1, {}).gp();
     } else {
-      LiftoffAssembler::VarState i64_expected =
-          __ cache_state()->stack_state.end()[-2];
+      VarState i64_expected = __ cache_state()->stack_state.end()[-2];
       CallRuntimeStub(
           kNeedI64RegPair ? WasmCode::kI32PairToBigInt : WasmCode::kI64ToBigInt,
           MakeSig::Returns(kRef).Params(kI64), {i64_expected},
@@ -5037,17 +5148,22 @@ class LiftoffCompiler {
     }
     ValueKind expected_kind = kind == kI32 ? kI32 : kRef;
 
-    LiftoffAssembler::VarState timeout =
-        __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState expected_value{expected_kind,
-                                              LiftoffRegister{expected}, 0};
-    LiftoffAssembler::VarState index = __ cache_state()->stack_state.end()[-3];
+    VarState timeout = __ cache_state()->stack_state.end()[-1];
+    VarState index = __ cache_state()->stack_state.end()[-3];
 
     auto target = kind == kI32 ? WasmCode::kWasmI32AtomicWait
                                : WasmCode::kWasmI64AtomicWait;
 
-    CallRuntimeStub(target, MakeSig::Params(kIntPtrKind, expected_kind, kRef),
-                    {index, expected_value, timeout}, decoder->position());
+    // The type of {index} can either by i32 or intptr, depending on whether
+    // memory32 or memory64 is used. This is okay because both values get passed
+    // by register.
+    CallRuntimeStub(target,
+                    MakeSig::Params(kI32, index_kind, expected_kind, kRef),
+                    {{kI32, static_cast<int32_t>(imm.memory->index), 0},
+                     index,
+                     {expected_kind, LiftoffRegister{expected}, 0},
+                     timeout},
+                    decoder->position());
     // Pop parameters from the value stack.
     __ DropValues(3);
 
@@ -5058,29 +5174,30 @@ class LiftoffCompiler {
 
   void AtomicNotify(FullDecoder* decoder, const MemoryAccessImmediate& imm) {
     LiftoffRegister full_index = __ PeekToRegister(1, {});
-    Register index_reg = BoundsCheckMem(decoder, kInt32Size, imm.offset,
-                                        full_index, {}, kDoForceCheck);
+    Register index_reg =
+        BoundsCheckMem(decoder, imm.memory, kInt32Size, imm.offset, full_index,
+                       {}, kDoForceCheck);
     LiftoffRegList pinned{index_reg};
     AlignmentCheckMem(decoder, kInt32Size, imm.offset, index_reg, pinned);
 
     uintptr_t offset = imm.offset;
-    Register index_plus_offset =
-        __ cache_state()->is_used(LiftoffRegister(index_reg))
-            ? pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp()
-            : index_reg;
-    // TODO(clemensb): Skip this if memory is 64 bit.
-    __ emit_ptrsize_zeroextend_i32(index_plus_offset, index_reg);
+    Register index_plus_offset = index_reg;
+    if (__ cache_state()->is_used(LiftoffRegister(index_reg))) {
+      index_plus_offset = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
+      __ Move(index_plus_offset, index_reg, kIntPtrKind);
+    }
     if (offset) {
       __ emit_ptrsize_addi(index_plus_offset, index_plus_offset, offset);
     }
 
-    LiftoffAssembler::VarState count = __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState index_plus_offset_input{
-        kIntPtrKind, LiftoffRegister{index_plus_offset}, 0};
+    VarState count = __ cache_state()->stack_state.end()[-1];
 
     CallRuntimeStub(WasmCode::kWasmAtomicNotify,
-                    MakeSig::Returns(kI32).Params(kIntPtrKind, kI32),
-                    {index_plus_offset_input, count}, decoder->position());
+                    MakeSig::Returns(kI32).Params(kI32, kIntPtrKind, kI32),
+                    {{kI32, static_cast<int32_t>(imm.memory->index), 0},
+                     {kIntPtrKind, LiftoffRegister{index_plus_offset}, 0},
+                     count},
+                    decoder->position());
     // Pop parameters from the value stack.
     __ DropValues(2);
 
@@ -5160,8 +5277,8 @@ class LiftoffCompiler {
   V(I64AtomicCompareExchange16U, kI64Store16) \
   V(I64AtomicCompareExchange32U, kI64Store32)
 
-  void AtomicOp(FullDecoder* decoder, WasmOpcode opcode,
-                base::Vector<Value> args, const MemoryAccessImmediate& imm,
+  void AtomicOp(FullDecoder* decoder, WasmOpcode opcode, const Value args[],
+                const size_t argc, const MemoryAccessImmediate& imm,
                 Value* result) {
     switch (opcode) {
 #define ATOMIC_STORE_OP(name, type)                \
@@ -5206,7 +5323,7 @@ class LiftoffCompiler {
         AtomicNotify(decoder, imm);
         break;
       default:
-        unsupported(decoder, kAtomics, "atomicop");
+        UNREACHABLE();
     }
   }
 
@@ -5217,41 +5334,46 @@ class LiftoffCompiler {
 
   void AtomicFence(FullDecoder* decoder) { __ AtomicFence(); }
 
-  // Pop a memtype (i32 or i64 depending on {WasmModule::is_memory64}) to a
-  // register, updating {*high_word} to contain the ORed combination of all
-  // popped high words. Returns the ptrsized register holding the popped value.
-  LiftoffRegister PopMemTypeToRegister(FullDecoder* decoder,
-                                       Register* high_word,
-                                       LiftoffRegList* pinned) {
-    LiftoffRegister reg = __ PopToRegister(*pinned);
-    LiftoffRegister intptr_reg = reg;
+  // Pop a VarState and if needed transform it to an intptr.
+  // When truncating from u64 to u32, the {*high_word} is updated to contain
+  // the ORed combination of all high words.
+  VarState PopMemTypeToVarState(Register* high_word, LiftoffRegList* pinned) {
+    VarState slot = __ PopVarState();
+    const bool is_mem64 = slot.kind() == kI64;
+    // For memory32 on a 32-bit system or memory64 on a 64-bit system, there is
+    // nothing to do.
+    if ((kSystemPointerSize == kInt64Size) == is_mem64) {
+      if (slot.is_reg()) pinned->set(slot.reg());
+      return slot;
+    }
+
+    // Otherwise we have to either zero-extend or truncate; pop to a register
+    // first.
+    LiftoffRegister reg = __ LoadToRegister(slot, *pinned);
     // For memory32 on 64-bit hosts, zero-extend.
-    if (kSystemPointerSize == kInt64Size && !env_->module->is_memory64) {
-      // Only overwrite {reg} if it's not used otherwise.
-      if (pinned->has(reg) || __ cache_state()->is_used(reg)) {
-        intptr_reg = __ GetUnusedRegister(kGpReg, *pinned);
-      }
+    if (kSystemPointerSize == kInt64Size) {
+      DCHECK(!is_mem64);  // Handled above.
+      // Get a register that we can overwrite, preferably {reg}.
+      LiftoffRegister intptr_reg = __ GetUnusedRegister(kGpReg, {reg}, *pinned);
       __ emit_u32_to_uintptr(intptr_reg.gp(), reg.gp());
-    }
-    // For memory32 or memory64 on 64-bit, we are done here.
-    if (kSystemPointerSize == kInt64Size || !env_->module->is_memory64) {
       pinned->set(intptr_reg);
-      return intptr_reg;
+      return {kIntPtrKind, intptr_reg, 0};
     }
 
     // For memory64 on 32-bit systems, combine all high words for a zero-check
     // and only use the low words afterwards. This keeps the register pressure
     // managable.
-    DCHECK_GE(kMaxUInt32, env_->module->max_memory_size);
+    DCHECK(is_mem64);  // Other cases are handled above.
+    DCHECK_EQ(kSystemPointerSize, kInt32Size);
     pinned->set(reg.low());
     if (*high_word == no_reg) {
       // Choose a register to hold the (combination of) high word(s). It cannot
       // be one of the pinned registers, and it cannot be used in the value
       // stack.
       *high_word =
-          pinned->has(reg.high())
-              ? __ GetUnusedRegister(kGpReg, *pinned).gp()
-              : __ GetUnusedRegister(kGpReg, {reg.high()}, *pinned).gp();
+          !pinned->has(reg.high()) && __ cache_state()->is_free(reg.high())
+              ? reg.high().gp()
+              : __ GetUnusedRegister(kGpReg, *pinned).gp();
       pinned->set(*high_word);
       if (*high_word != reg.high_gp()) {
         __ Move(*high_word, reg.high_gp(), kI32);
@@ -5260,17 +5382,31 @@ class LiftoffCompiler {
       // Combine the new high word into existing high words.
       __ emit_i32_or(*high_word, *high_word, reg.high_gp());
     }
-    return reg.low();
+    return {kIntPtrKind, reg.low(), 0};
+  }
+
+#ifdef DEBUG
+  // Checks that the top-of-stack value matches the declared memory (64-bit or
+  // 32-bit). To be used inside a DCHECK. Always returns true though, will fail
+  // internally on a detected inconsistency.
+  bool MatchingMemTypeOnTopOfStack(const WasmMemory* memory) {
+    DCHECK_LT(0, __ cache_state()->stack_state.size());
+    ValueKind expected_kind = memory->is_memory64 ? kI64 : kI32;
+    DCHECK_EQ(expected_kind, __ cache_state()->stack_state.back().kind());
+    return true;
   }
+#endif
 
   void MemoryInit(FullDecoder* decoder, const MemoryInitImmediate& imm,
                   const Value&, const Value&, const Value&) {
     Register mem_offsets_high_word = no_reg;
     LiftoffRegList pinned;
-    LiftoffRegister size = pinned.set(__ PopToRegister(pinned));
-    LiftoffRegister src = pinned.set(__ PopToRegister(pinned));
-    LiftoffRegister dst =
-        PopMemTypeToRegister(decoder, &mem_offsets_high_word, &pinned);
+    VarState size = __ PopVarState();
+    if (size.is_reg()) pinned.set(size.reg());
+    VarState src = __ PopVarState();
+    if (src.is_reg()) pinned.set(src.reg());
+    DCHECK(MatchingMemTypeOnTopOfStack(imm.memory.memory));
+    VarState dst = PopMemTypeToVarState(&mem_offsets_high_word, &pinned);
 
     Register instance = __ cache_state()->cached_instance;
     if (instance == no_reg) {
@@ -5291,18 +5427,16 @@ class LiftoffCompiler {
       pinned.clear(mem_offsets_high_word);
     }
 
-    LiftoffRegister segment_index =
-        pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-    __ LoadConstant(segment_index, WasmValue(imm.data_segment.index));
-
-    auto sig = MakeSig::Returns(kI32).Params(kIntPtrKind, kIntPtrKind, kI32,
-                                             kI32, kI32);
-    LiftoffRegister args[] = {LiftoffRegister(instance), dst, src,
-                              segment_index, size};
     // We don't need the instance anymore after the call. We can use the
     // register for the result.
-    LiftoffRegister result(instance);
-    GenerateCCall(&result, &sig, kVoid, args,
+    LiftoffRegister result{instance};
+    GenerateCCall(&result, kI32, kVoid,
+                  {{kIntPtrKind, LiftoffRegister{instance}, 0},
+                   {kI32, static_cast<int32_t>(imm.memory.index), 0},
+                   dst,
+                   src,
+                   {kI32, static_cast<int32_t>(imm.data_segment.index), 0},
+                   size},
                   ExternalReference::wasm_memory_init());
     FREEZE_STATE(trapping);
     __ emit_cond_jump(kEqual, trap_label, kI32, result.gp(), no_reg, trapping);
@@ -5334,18 +5468,21 @@ class LiftoffCompiler {
                   const Value&, const Value&, const Value&) {
     Register mem_offsets_high_word = no_reg;
     LiftoffRegList pinned;
-    LiftoffRegister size = pinned.set(
-        PopMemTypeToRegister(decoder, &mem_offsets_high_word, &pinned));
-    LiftoffRegister src = pinned.set(
-        PopMemTypeToRegister(decoder, &mem_offsets_high_word, &pinned));
-    LiftoffRegister dst = pinned.set(
-        PopMemTypeToRegister(decoder, &mem_offsets_high_word, &pinned));
+    DCHECK_EQ(imm.memory_dst.memory->is_memory64,
+              imm.memory_src.memory->is_memory64);
+    DCHECK(MatchingMemTypeOnTopOfStack(imm.memory_dst.memory));
+    VarState size = PopMemTypeToVarState(&mem_offsets_high_word, &pinned);
+    DCHECK(MatchingMemTypeOnTopOfStack(imm.memory_dst.memory));
+    VarState src = PopMemTypeToVarState(&mem_offsets_high_word, &pinned);
+    DCHECK(MatchingMemTypeOnTopOfStack(imm.memory_dst.memory));
+    VarState dst = PopMemTypeToVarState(&mem_offsets_high_word, &pinned);
 
     Register instance = __ cache_state()->cached_instance;
     if (instance == no_reg) {
       instance = __ GetUnusedRegister(kGpReg, pinned).gp();
       __ LoadInstanceFromFrame(instance);
     }
+    pinned.set(instance);
 
     // Only allocate the OOB code now, so the state of the stack is reflected
     // correctly.
@@ -5358,13 +5495,16 @@ class LiftoffCompiler {
                         no_reg, trapping);
     }
 
-    auto sig = MakeSig::Returns(kI32).Params(kIntPtrKind, kIntPtrKind,
-                                             kIntPtrKind, kIntPtrKind);
-    LiftoffRegister args[] = {LiftoffRegister(instance), dst, src, size};
     // We don't need the instance anymore after the call. We can use the
     // register for the result.
     LiftoffRegister result(instance);
-    GenerateCCall(&result, &sig, kVoid, args,
+    GenerateCCall(&result, kI32, kVoid,
+                  {{kIntPtrKind, LiftoffRegister{instance}, 0},
+                   {kI32, static_cast<int32_t>(imm.memory_dst.index), 0},
+                   {kI32, static_cast<int32_t>(imm.memory_src.index), 0},
+                   dst,
+                   src,
+                   size},
                   ExternalReference::wasm_memory_copy());
     FREEZE_STATE(trapping);
     __ emit_cond_jump(kEqual, trap_label, kI32, result.gp(), no_reg, trapping);
@@ -5374,17 +5514,19 @@ class LiftoffCompiler {
                   const Value&, const Value&, const Value&) {
     Register mem_offsets_high_word = no_reg;
     LiftoffRegList pinned;
-    LiftoffRegister size = pinned.set(
-        PopMemTypeToRegister(decoder, &mem_offsets_high_word, &pinned));
-    LiftoffRegister value = pinned.set(__ PopToRegister(pinned));
-    LiftoffRegister dst = pinned.set(
-        PopMemTypeToRegister(decoder, &mem_offsets_high_word, &pinned));
+    DCHECK(MatchingMemTypeOnTopOfStack(imm.memory));
+    VarState size = PopMemTypeToVarState(&mem_offsets_high_word, &pinned);
+    VarState value = __ PopVarState();
+    if (value.is_reg()) pinned.set(value.reg());
+    DCHECK(MatchingMemTypeOnTopOfStack(imm.memory));
+    VarState dst = PopMemTypeToVarState(&mem_offsets_high_word, &pinned);
 
     Register instance = __ cache_state()->cached_instance;
     if (instance == no_reg) {
       instance = __ GetUnusedRegister(kGpReg, pinned).gp();
       __ LoadInstanceFromFrame(instance);
     }
+    pinned.set(instance);
 
     // Only allocate the OOB code now, so the state of the stack is reflected
     // correctly.
@@ -5397,13 +5539,15 @@ class LiftoffCompiler {
                         no_reg, trapping);
     }
 
-    auto sig = MakeSig::Returns(kI32).Params(kIntPtrKind, kIntPtrKind, kI32,
-                                             kIntPtrKind);
-    LiftoffRegister args[] = {LiftoffRegister(instance), dst, value, size};
     // We don't need the instance anymore after the call. We can use the
     // register for the result.
     LiftoffRegister result(instance);
-    GenerateCCall(&result, &sig, kVoid, args,
+    GenerateCCall(&result, kI32, kVoid,
+                  {{kIntPtrKind, LiftoffRegister{instance}, 0},
+                   {kI32, static_cast<int32_t>(imm.index), 0},
+                   dst,
+                   value,
+                   size},
                   ExternalReference::wasm_memory_fill());
     FREEZE_STATE(trapping);
     __ emit_cond_jump(kEqual, trap_label, kI32, result.gp(), no_reg, trapping);
@@ -5416,31 +5560,28 @@ class LiftoffCompiler {
   }
 
   void TableInit(FullDecoder* decoder, const TableInitImmediate& imm,
-                 base::Vector<Value> args) {
+                 const Value* /* args */) {
     LiftoffRegList pinned;
     LiftoffRegister table_index_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
 
     LoadSmi(table_index_reg, imm.table.index);
-    LiftoffAssembler::VarState table_index{kSmiKind, table_index_reg, 0};
+    VarState table_index{kSmiKind, table_index_reg, 0};
 
     LiftoffRegister segment_index_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(segment_index_reg, imm.element_segment.index);
-    LiftoffAssembler::VarState segment_index{kSmiKind, segment_index_reg, 0};
+    VarState segment_index{kSmiKind, segment_index_reg, 0};
 
-    LiftoffAssembler::VarState size = __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState src = __ cache_state()->stack_state.end()[-2];
-    LiftoffAssembler::VarState dst = __ cache_state()->stack_state.end()[-3];
+    VarState size = __ PopVarState();
+    VarState src = __ PopVarState();
+    VarState dst = __ PopVarState();
 
     CallRuntimeStub(WasmCode::kWasmTableInit,
                     MakeSig::Params(kI32, kI32, kI32, kSmiKind, kSmiKind),
                     {dst, src, size, table_index, segment_index},
                     decoder->position());
 
-    // Pop parameters from the value stack.
-    __ cache_state()->stack_state.pop_back(3);
-
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
   }
 
@@ -5469,33 +5610,28 @@ class LiftoffCompiler {
   }
 
   void TableCopy(FullDecoder* decoder, const TableCopyImmediate& imm,
-                 base::Vector<Value> args) {
+                 const Value* /* args */) {
     LiftoffRegList pinned;
 
     LiftoffRegister table_dst_index_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(table_dst_index_reg, imm.table_dst.index);
-    LiftoffAssembler::VarState table_dst_index{kSmiKind, table_dst_index_reg,
-                                               0};
+    VarState table_dst_index{kSmiKind, table_dst_index_reg, 0};
 
     LiftoffRegister table_src_index_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(table_src_index_reg, imm.table_src.index);
-    LiftoffAssembler::VarState table_src_index{kSmiKind, table_src_index_reg,
-                                               0};
+    VarState table_src_index{kSmiKind, table_src_index_reg, 0};
 
-    LiftoffAssembler::VarState size = __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState src = __ cache_state()->stack_state.end()[-2];
-    LiftoffAssembler::VarState dst = __ cache_state()->stack_state.end()[-3];
+    VarState size = __ PopVarState();
+    VarState src = __ PopVarState();
+    VarState dst = __ PopVarState();
 
     CallRuntimeStub(WasmCode::kWasmTableCopy,
                     MakeSig::Params(kI32, kI32, kI32, kSmiKind, kSmiKind),
                     {dst, src, size, table_dst_index, table_src_index},
                     decoder->position());
 
-    // Pop parameters from the value stack.
-    __ cache_state()->stack_state.pop_back(3);
-
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
   }
 
@@ -5506,18 +5642,15 @@ class LiftoffCompiler {
     LiftoffRegister table_index_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(table_index_reg, imm.index);
-    LiftoffAssembler::VarState table_index(kSmiKind, table_index_reg, 0);
+    VarState table_index(kSmiKind, table_index_reg, 0);
 
-    LiftoffAssembler::VarState delta = __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState value = __ cache_state()->stack_state.end()[-2];
+    VarState delta = __ PopVarState();
+    VarState value = __ PopVarState();
 
     CallRuntimeStub(WasmCode::kWasmTableGrow,
                     MakeSig::Returns(kSmiKind).Params(kSmiKind, kI32, kRefNull),
                     {table_index, delta, value}, decoder->position());
 
-    // Pop parameters from the value stack.
-    __ cache_state()->stack_state.pop_back(2);
-
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
     __ SmiToInt32(kReturnRegister0);
     __ PushRegister(kI32, LiftoffRegister(kReturnRegister0));
@@ -5555,42 +5688,31 @@ class LiftoffCompiler {
     LiftoffRegister table_index_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(table_index_reg, imm.index);
-    LiftoffAssembler::VarState table_index(kSmiKind, table_index_reg, 0);
+    VarState table_index(kSmiKind, table_index_reg, 0);
 
-    LiftoffAssembler::VarState count = __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState value = __ cache_state()->stack_state.end()[-2];
-    LiftoffAssembler::VarState start = __ cache_state()->stack_state.end()[-3];
+    VarState count = __ PopVarState();
+    VarState value = __ PopVarState();
+    VarState start = __ PopVarState();
 
     CallRuntimeStub(WasmCode::kWasmTableFill,
                     MakeSig::Params(kSmiKind, kI32, kI32, kRefNull),
                     {table_index, start, count, value}, decoder->position());
 
-    // Pop parameters from the value stack.
-    __ cache_state()->stack_state.pop_back(3);
-
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
   }
 
   void StructNew(FullDecoder* decoder, const StructIndexImmediate& imm,
-                 const Value& rtt, bool initial_values_on_stack) {
-    LiftoffRegList pinned;
-    LiftoffRegister instance_size =
-        pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-    LiftoffAssembler::VarState instance_size_state(kI32, instance_size, 0);
-    LiftoffAssembler::VarState rtt_value =
-        __ cache_state()->stack_state.end()[-1];
+                 bool initial_values_on_stack) {
+    LiftoffRegister rtt = RttCanon(imm.index, {});
 
-    __ LoadConstant(
-        instance_size,
-        WasmValue(static_cast<int32_t>(WasmStruct::Size(imm.struct_type))));
     CallRuntimeStub(WasmCode::kWasmAllocateStructWithRtt,
-                    MakeSig::Returns(kRef).Params(rtt.type.kind(), kI32),
-                    {rtt_value, instance_size_state}, decoder->position());
-    // Drop the RTT.
-    __ cache_state()->stack_state.pop_back(1);
+                    MakeSig::Returns(kRef).Params(kRtt, kI32),
+                    {VarState{kRtt, rtt, 0},
+                     VarState{kI32, WasmStruct::Size(imm.struct_type), 0}},
+                    decoder->position());
 
     LiftoffRegister obj(kReturnRegister0);
-    pinned.set(obj);
+    LiftoffRegList pinned{obj};
 
     for (uint32_t i = imm.struct_type->field_count(); i > 0;) {
       i--;
@@ -5604,7 +5726,7 @@ class LiftoffCompiler {
         if (!CheckSupportedType(decoder, field_type.kind(), "default value")) {
           return;
         }
-        SetDefaultValue(value, field_type, pinned);
+        SetDefaultValue(value, field_type);
       }
       // Skipping the write barrier is safe as long as:
       // (1) {obj} is freshly allocated, and
@@ -5622,13 +5744,13 @@ class LiftoffCompiler {
   }
 
   void StructNew(FullDecoder* decoder, const StructIndexImmediate& imm,
-                 const Value& rtt, const Value args[], Value* result) {
-    StructNew(decoder, imm, rtt, true);
+                 const Value args[], Value* result) {
+    StructNew(decoder, imm, true);
   }
 
   void StructNewDefault(FullDecoder* decoder, const StructIndexImmediate& imm,
-                        const Value& rtt, Value* result) {
-    StructNew(decoder, imm, rtt, false);
+                        Value* result) {
+    StructNew(decoder, imm, false);
   }
 
   void StructGet(FullDecoder* decoder, const Value& struct_obj,
@@ -5660,11 +5782,11 @@ class LiftoffCompiler {
   }
 
   void ArrayNew(FullDecoder* decoder, const ArrayIndexImmediate& imm,
-                ValueKind rtt_kind, bool initial_value_on_stack) {
+                bool initial_value_on_stack) {
     // Max length check.
     {
       LiftoffRegister length =
-          __ LoadToRegister(__ cache_state()->stack_state.end()[-2], {});
+          __ LoadToRegister(__ cache_state()->stack_state.end()[-1], {});
       Label* trap_label =
           AddOutOfLineTrap(decoder, WasmCode::kThrowWasmTrapArrayTooLarge);
       FREEZE_STATE(trapping);
@@ -5676,19 +5798,13 @@ class LiftoffCompiler {
     int elem_size = value_kind_size(elem_kind);
     // Allocate the array.
     {
-      LiftoffRegister elem_size_reg = __ GetUnusedRegister(kGpReg, {});
-      LiftoffAssembler::VarState rtt_var =
-          __ cache_state()->stack_state.end()[-1];
-      LiftoffAssembler::VarState length_var =
-          __ cache_state()->stack_state.end()[-2];
-      __ LoadConstant(elem_size_reg, WasmValue(elem_size));
-      LiftoffAssembler::VarState elem_size_var(kI32, elem_size_reg, 0);
+      LiftoffRegister rtt = RttCanon(imm.index, {});
       CallRuntimeStub(WasmCode::kWasmAllocateArray_Uninitialized,
-                      MakeSig::Returns(kRef).Params(rtt_kind, kI32, kI32),
-                      {rtt_var, length_var, elem_size_var},
+                      MakeSig::Returns(kRef).Params(kRtt, kI32, kI32),
+                      {VarState{kRtt, rtt, 0},
+                       __ cache_state()->stack_state.end()[-1],  // length
+                       VarState{kI32, elem_size, 0}},
                       decoder->position());
-      // Drop the RTT.
-      __ cache_state()->stack_state.pop_back(1);
     }
 
     LiftoffRegister obj(kReturnRegister0);
@@ -5700,7 +5816,7 @@ class LiftoffCompiler {
       __ PopToFixedRegister(value);
     } else {
       if (!CheckSupportedType(decoder, elem_kind, "default value")) return;
-      SetDefaultValue(value, elem_type, pinned);
+      SetDefaultValue(value, elem_type);
     }
 
     LiftoffRegister index = pinned.set(__ GetUnusedRegister(kGpReg, pinned));
@@ -5718,13 +5834,13 @@ class LiftoffCompiler {
 
   void ArrayNew(FullDecoder* decoder, const ArrayIndexImmediate& imm,
                 const Value& length_value, const Value& initial_value,
-                const Value& rtt, Value* result) {
-    ArrayNew(decoder, imm, rtt.type.kind(), true);
+                Value* result) {
+    ArrayNew(decoder, imm, true);
   }
 
   void ArrayNewDefault(FullDecoder* decoder, const ArrayIndexImmediate& imm,
-                       const Value& length, const Value& rtt, Value* result) {
-    ArrayNew(decoder, imm, rtt.type.kind(), false);
+                       const Value& length, Value* result) {
+    ArrayNew(decoder, imm, false);
   }
 
   void ArrayFill(FullDecoder* decoder, ArrayIndexImmediate& imm,
@@ -5759,9 +5875,9 @@ class LiftoffCompiler {
     }
 
     LiftoffRegList pinned;
-    LiftoffRegister length = pinned.set(__ PopToRegister(pinned));
+    LiftoffRegister length = pinned.set(__ PopToModifiableRegister(pinned));
     LiftoffRegister value = pinned.set(__ PopToRegister(pinned));
-    LiftoffRegister index = pinned.set(__ PopToRegister(pinned));
+    LiftoffRegister index = pinned.set(__ PopToModifiableRegister(pinned));
     LiftoffRegister obj = pinned.set(__ PopToRegister(pinned));
 
     ArrayFillImpl(pinned, obj, index, value, length,
@@ -5824,8 +5940,8 @@ class LiftoffCompiler {
 
   void ArrayCopy(FullDecoder* decoder, const Value& dst, const Value& dst_index,
                  const Value& src, const Value& src_index,
-                 const Value& length) {
-    // TODO(7748): Unify implementation with TF: Implement this with
+                 const ArrayIndexImmediate& src_imm, const Value& length) {
+    // TODO(14034): Unify implementation with TF: Implement this with
     // GenerateCCall. Remove runtime function and builtin in wasm.tq.
     CallRuntimeStub(v8_flags.experimental_wasm_skip_bounds_checks
                         ? WasmCode::kWasmArrayCopy
@@ -5839,44 +5955,26 @@ class LiftoffCompiler {
                      __ cache_state()->stack_state.end()[-5],
                      __ cache_state()->stack_state.end()[-3]},
                     decoder->position());
-    __ cache_state()->stack_state.pop_back(5);
+    __ DropValues(5);
   }
 
-  void ArrayNewFixed(FullDecoder* decoder, const ArrayIndexImmediate& imm,
-                     const base::Vector<Value>& elements, const Value& rtt,
-                     Value* result) {
-    ValueKind rtt_kind = rtt.type.kind();
-    ValueKind elem_kind = imm.array_type->element_type().kind();
+  void ArrayNewFixed(FullDecoder* decoder, const ArrayIndexImmediate& array_imm,
+                     const IndexImmediate& length_imm,
+                     const Value* /* elements */, Value* /* result */) {
+    LiftoffRegister rtt = RttCanon(array_imm.index, {});
+    ValueKind elem_kind = array_imm.array_type->element_type().kind();
+    int32_t elem_count = length_imm.index;
     // Allocate the array.
-    {
-      LiftoffRegList pinned;
-      LiftoffRegister elem_size_reg =
-          pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-
-      __ LoadConstant(elem_size_reg, WasmValue(value_kind_size(elem_kind)));
-      LiftoffAssembler::VarState elem_size_var(kI32, elem_size_reg, 0);
-
-      LiftoffRegister length_reg =
-          pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-      __ LoadConstant(length_reg,
-                      WasmValue(static_cast<int32_t>(elements.size())));
-      LiftoffAssembler::VarState length_var(kI32, length_reg, 0);
-
-      LiftoffAssembler::VarState rtt_var =
-          __ cache_state()->stack_state.end()[-1];
-
-      CallRuntimeStub(WasmCode::kWasmAllocateArray_Uninitialized,
-                      MakeSig::Returns(kRef).Params(rtt_kind, kI32, kI32),
-                      {rtt_var, length_var, elem_size_var},
-                      decoder->position());
-      // Drop the RTT.
-      __ DropValues(1);
-    }
+    CallRuntimeStub(WasmCode::kWasmAllocateArray_Uninitialized,
+                    MakeSig::Returns(kRef).Params(kRtt, kI32, kI32),
+                    {VarState{kRtt, rtt, 0}, VarState{kI32, elem_count, 0},
+                     VarState{kI32, value_kind_size(elem_kind), 0}},
+                    decoder->position());
 
     // Initialize the array with stack arguments.
     LiftoffRegister array(kReturnRegister0);
     if (!CheckSupportedType(decoder, elem_kind, "array.new_fixed")) return;
-    for (int i = static_cast<int>(elements.size()) - 1; i >= 0; i--) {
+    for (int i = elem_count - 1; i >= 0; i--) {
       LiftoffRegList pinned{array};
       LiftoffRegister element = pinned.set(__ PopToRegister(pinned));
       int offset =
@@ -5895,34 +5993,64 @@ class LiftoffCompiler {
 
   void ArrayNewSegment(FullDecoder* decoder,
                        const ArrayIndexImmediate& array_imm,
-                       const IndexImmediate& data_segment,
+                       const IndexImmediate& segment_imm,
                        const Value& /* offset */, const Value& /* length */,
-                       const Value& /* rtt */, Value* /* result */) {
-    LiftoffRegList pinned;
-    LiftoffRegister data_segment_reg =
-        pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-    __ LoadConstant(data_segment_reg,
-                    WasmValue(static_cast<int32_t>(data_segment.index)));
-    LiftoffAssembler::VarState data_segment_var(kI32, data_segment_reg, 0);
+                       Value* /* result */) {
+    LiftoffRegister rtt = RttCanon(array_imm.index, {});
+    LiftoffRegister is_element_reg =
+        __ GetUnusedRegister(kGpReg, LiftoffRegList{rtt});
+    LoadSmi(is_element_reg,
+            array_imm.array_type->element_type().is_reference());
 
-    CallRuntimeStub(WasmCode::kWasmArrayNewSegment,
-                    MakeSig::Returns(kRef).Params(kI32, kI32, kI32, kRtt),
-                    {
-                        data_segment_var,
-                        __ cache_state()->stack_state.end()[-3],  // offset
-                        __ cache_state()->stack_state.end()[-2],  // length
-                        __ cache_state()->stack_state.end()[-1]   // rtt
-                    },
-                    decoder->position());
+    CallRuntimeStub(
+        WasmCode::kWasmArrayNewSegment,
+        MakeSig::Returns(kRef).Params(kI32, kI32, kI32, kSmiKind, kRtt),
+        {
+            VarState{kI32, static_cast<int>(segment_imm.index), 0},  // segment
+            __ cache_state()->stack_state.end()[-2],                 // offset
+            __ cache_state()->stack_state.end()[-1],                 // length
+            VarState{kSmiKind, is_element_reg, 0},  // is_element
+            VarState{kRtt, rtt, 0}                  // rtt
+        },
+        decoder->position());
 
     // Pop parameters from the value stack.
-    __ cache_state()->stack_state.pop_back(3);
+    __ DropValues(2);
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
 
     LiftoffRegister result(kReturnRegister0);
     __ PushRegister(kRef, result);
   }
 
+  void ArrayInitSegment(FullDecoder* decoder,
+                        const ArrayIndexImmediate& array_imm,
+                        const IndexImmediate& segment_imm,
+                        const Value& /* array */,
+                        const Value& /* array_index */,
+                        const Value& /* segment_offset*/,
+                        const Value& /* length */) {
+    LiftoffRegister segment_index_reg = __ GetUnusedRegister(kGpReg, {});
+    LoadSmi(segment_index_reg, static_cast<int32_t>(segment_imm.index));
+    LiftoffRegister is_element_reg =
+        __ GetUnusedRegister(kGpReg, LiftoffRegList{segment_index_reg});
+    LoadSmi(is_element_reg,
+            array_imm.array_type->element_type().is_reference());
+
+    // Builtin parameter order: array_index, segment_offset, length,
+    //                          segment_index, array.
+    CallRuntimeStub(
+        WasmCode::kWasmArrayInitSegment,
+        MakeSig::Params(kI32, kI32, kI32, kSmiKind, kSmiKind, kRefNull),
+        {__ cache_state()->stack_state.end()[-3],
+         __ cache_state()->stack_state.end()[-2],
+         __ cache_state()->stack_state.end()[-1],
+         VarState{kSmiKind, segment_index_reg, 0},
+         VarState{kSmiKind, is_element_reg, 0},
+         __ cache_state()->stack_state.end()[-4]},
+        decoder->position());
+    __ DropValues(4);
+  }
+
   void I31New(FullDecoder* decoder, const Value& input, Value* result) {
     LiftoffRegister src = __ PopToRegister();
     LiftoffRegister dst = __ GetUnusedRegister(kGpReg, {src}, {});
@@ -5971,14 +6099,13 @@ class LiftoffCompiler {
     __ PushRegister(kI32, dst);
   }
 
-  void RttCanon(FullDecoder* decoder, uint32_t type_index, Value* result) {
-    LiftoffRegList pinned;
+  LiftoffRegister RttCanon(uint32_t type_index, LiftoffRegList pinned) {
     LiftoffRegister rtt = pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LOAD_TAGGED_PTR_INSTANCE_FIELD(rtt.gp(), ManagedObjectMaps, pinned);
     __ LoadTaggedPointer(
         rtt.gp(), rtt.gp(), no_reg,
         wasm::ObjectAccess::ElementOffsetInTaggedFixedArray(type_index));
-    __ PushRegister(kRtt, rtt);
+    return rtt;
   }
 
   enum NullSucceeds : bool {  // --
@@ -6071,11 +6198,11 @@ class LiftoffCompiler {
     __ bind(&match);
   }
 
-  void RefTest(FullDecoder* decoder, const Value& obj, const Value& rtt,
+  void RefTest(FullDecoder* decoder, uint32_t ref_index, const Value& obj,
                Value* /* result_val */, bool null_succeeds) {
     Label return_false, done;
     LiftoffRegList pinned;
-    LiftoffRegister rtt_reg = pinned.set(__ PopToRegister(pinned));
+    LiftoffRegister rtt_reg = pinned.set(RttCanon(ref_index, pinned));
     LiftoffRegister obj_reg = pinned.set(__ PopToRegister(pinned));
     Register scratch_null =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
@@ -6087,8 +6214,9 @@ class LiftoffCompiler {
     {
       FREEZE_STATE(frozen);
       SubtypeCheck(decoder->module_, obj_reg.gp(), obj.type, rtt_reg.gp(),
-                   rtt.type, scratch_null, result.gp(), &return_false,
-                   null_succeeds ? kNullSucceeds : kNullFails, frozen);
+                   ValueType::Rtt(ref_index), scratch_null, result.gp(),
+                   &return_false, null_succeeds ? kNullSucceeds : kNullFails,
+                   frozen);
 
       __ LoadConstant(result, WasmValue(1));
       // TODO(jkummerow): Emit near jumps on platforms that have them.
@@ -6112,6 +6240,8 @@ class LiftoffCompiler {
         return RefIsStruct(decoder, obj, result_val, null_succeeds);
       case HeapType::kArray:
         return RefIsArray(decoder, obj, result_val, null_succeeds);
+      case HeapType::kString:
+        return RefIsString(decoder, obj, result_val, null_succeeds);
       case HeapType::kNone:
       case HeapType::kNoExtern:
       case HeapType::kNoFunc:
@@ -6125,17 +6255,14 @@ class LiftoffCompiler {
     }
   }
 
-  void RefCast(FullDecoder* decoder, const Value& obj, const Value& rtt,
+  void RefCast(FullDecoder* decoder, uint32_t ref_index, const Value& obj,
                Value* result, bool null_succeeds) {
-    if (v8_flags.experimental_wasm_assume_ref_cast_succeeds) {
-      // Just drop the rtt.
-      __ DropValues(1);
-      return;
-    }
+    if (v8_flags.experimental_wasm_assume_ref_cast_succeeds) return;
+
     Label* trap_label =
         AddOutOfLineTrap(decoder, WasmCode::kThrowWasmTrapIllegalCast);
     LiftoffRegList pinned;
-    LiftoffRegister rtt_reg = pinned.set(__ PopToRegister(pinned));
+    LiftoffRegister rtt_reg = pinned.set(RttCanon(ref_index, pinned));
     LiftoffRegister obj_reg = pinned.set(__ PopToRegister(pinned));
     Register scratch_null =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
@@ -6148,8 +6275,8 @@ class LiftoffCompiler {
       FREEZE_STATE(frozen);
       NullSucceeds on_null = null_succeeds ? kNullSucceeds : kNullFails;
       SubtypeCheck(decoder->module_, obj_reg.gp(), obj.type, rtt_reg.gp(),
-                   rtt.type, scratch_null, scratch2, trap_label, on_null,
-                   frozen);
+                   ValueType::Rtt(ref_index), scratch_null, scratch2,
+                   trap_label, on_null, frozen);
     }
     __ PushRegister(obj.type.kind(), obj_reg);
   }
@@ -6165,6 +6292,8 @@ class LiftoffCompiler {
         return RefAsStruct(decoder, obj, result_val, null_succeeds);
       case HeapType::kArray:
         return RefAsArray(decoder, obj, result_val, null_succeeds);
+      case HeapType::kString:
+        return RefAsString(decoder, obj, result_val, null_succeeds);
       case HeapType::kNone:
       case HeapType::kNoExtern:
       case HeapType::kNoFunc:
@@ -6178,7 +6307,7 @@ class LiftoffCompiler {
     }
   }
 
-  void BrOnCast(FullDecoder* decoder, const Value& obj, const Value& rtt,
+  void BrOnCast(FullDecoder* decoder, uint32_t ref_index, const Value& obj,
                 Value* /* result_on_branch */, uint32_t depth,
                 bool null_succeeds) {
     // Avoid having sequences of branches do duplicate work.
@@ -6188,27 +6317,27 @@ class LiftoffCompiler {
 
     Label cont_false;
     LiftoffRegList pinned;
-    LiftoffRegister rtt_reg = pinned.set(__ PopToRegister(pinned));
+    LiftoffRegister rtt_reg = pinned.set(RttCanon(ref_index, pinned));
     LiftoffRegister obj_reg = pinned.set(__ PeekToRegister(0, pinned));
     Register scratch_null =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
     Register scratch2 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
     if (obj.type.is_nullable()) {
-      LoadNullValue(scratch_null, pinned, kWasmAnyRef);
+      LoadNullValue(scratch_null, kWasmAnyRef);
     }
     FREEZE_STATE(frozen);
 
     NullSucceeds null_handling = null_succeeds ? kNullSucceeds : kNullFails;
     SubtypeCheck(decoder->module_, obj_reg.gp(), obj.type, rtt_reg.gp(),
-                 rtt.type, scratch_null, scratch2, &cont_false, null_handling,
-                 frozen);
+                 ValueType::Rtt(ref_index), scratch_null, scratch2, &cont_false,
+                 null_handling, frozen);
 
-    BrOrRetImpl(decoder, depth, scratch_null, scratch2);
+    BrOrRetImpl(decoder, depth);
 
     __ bind(&cont_false);
   }
 
-  void BrOnCastFail(FullDecoder* decoder, const Value& obj, const Value& rtt,
+  void BrOnCastFail(FullDecoder* decoder, uint32_t ref_index, const Value& obj,
                     Value* /* result_on_fallthrough */, uint32_t depth,
                     bool null_succeeds) {
     // Avoid having sequences of branches do duplicate work.
@@ -6218,24 +6347,24 @@ class LiftoffCompiler {
 
     Label cont_branch, fallthrough;
     LiftoffRegList pinned;
-    LiftoffRegister rtt_reg = pinned.set(__ PopToRegister(pinned));
+    LiftoffRegister rtt_reg = pinned.set(RttCanon(ref_index, pinned));
     LiftoffRegister obj_reg = pinned.set(__ PeekToRegister(0, pinned));
     Register scratch_null =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
     Register scratch2 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
     if (obj.type.is_nullable()) {
-      LoadNullValue(scratch_null, pinned, kWasmAnyRef);
+      LoadNullValue(scratch_null, kWasmAnyRef);
     }
     FREEZE_STATE(frozen);
 
     NullSucceeds null_handling = null_succeeds ? kNullSucceeds : kNullFails;
     SubtypeCheck(decoder->module_, obj_reg.gp(), obj.type, rtt_reg.gp(),
-                 rtt.type, scratch_null, scratch2, &cont_branch, null_handling,
-                 frozen);
+                 ValueType::Rtt(ref_index), scratch_null, scratch2,
+                 &cont_branch, null_handling, frozen);
     __ emit_jump(&fallthrough);
 
     __ bind(&cont_branch);
-    BrOrRetImpl(decoder, depth, scratch_null, scratch2);
+    BrOrRetImpl(decoder, depth);
 
     __ bind(&fallthrough);
   }
@@ -6252,6 +6381,8 @@ class LiftoffCompiler {
         return BrOnStruct(decoder, obj, result_on_branch, depth, null_succeeds);
       case HeapType::kArray:
         return BrOnArray(decoder, obj, result_on_branch, depth, null_succeeds);
+      case HeapType::kString:
+        return BrOnString(decoder, obj, result_on_branch, depth, null_succeeds);
       case HeapType::kNone:
       case HeapType::kNoExtern:
       case HeapType::kNoFunc:
@@ -6282,6 +6413,9 @@ class LiftoffCompiler {
       case HeapType::kArray:
         return BrOnNonArray(decoder, obj, result_on_fallthrough, depth,
                             null_succeeds);
+      case HeapType::kString:
+        return BrOnNonString(decoder, obj, result_on_fallthrough, depth,
+                             null_succeeds);
       case HeapType::kNone:
       case HeapType::kNoExtern:
       case HeapType::kNoFunc:
@@ -6299,8 +6433,7 @@ class LiftoffCompiler {
   struct TypeCheck {
     Register obj_reg = no_reg;
     ValueType obj_type;
-    Register tmp1 = no_reg;
-    Register tmp2 = no_reg;
+    Register tmp = no_reg;
     Label* no_match;
     bool null_succeeds;
 
@@ -6309,8 +6442,8 @@ class LiftoffCompiler {
           no_match(no_match),
           null_succeeds(null_succeeds) {}
 
-    Register null_reg() { return tmp1; }       // After {Initialize}.
-    Register instance_type() { return tmp1; }  // After {LoadInstanceType}.
+    Register null_reg() { return tmp; }       // After {Initialize}.
+    Register instance_type() { return tmp; }  // After {LoadInstanceType}.
   };
 
   enum PopOrPeek { kPop, kPeek };
@@ -6322,10 +6455,9 @@ class LiftoffCompiler {
     } else {
       check.obj_reg = pinned.set(__ PeekToRegister(0, pinned)).gp();
     }
-    check.tmp1 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
-    check.tmp2 = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
+    check.tmp = pinned.set(__ GetUnusedRegister(kGpReg, pinned)).gp();
     if (check.obj_type.is_nullable()) {
-      LoadNullValue(check.null_reg(), pinned, type);
+      LoadNullValue(check.null_reg(), type);
     }
   }
   void LoadInstanceType(TypeCheck& check, const FreezeCacheState& frozen,
@@ -6378,6 +6510,13 @@ class LiftoffCompiler {
     __ bind(&match);
   }
 
+  void StringCheck(TypeCheck& check, const FreezeCacheState& frozen) {
+    LoadInstanceType(check, frozen, check.no_match);
+    LiftoffRegister instance_type(check.instance_type());
+    __ emit_i32_cond_jumpi(kUnsignedGreaterThanEqual, check.no_match,
+                           check.instance_type(), FIRST_NONSTRING_TYPE, frozen);
+  }
+
   using TypeChecker = void (LiftoffCompiler::*)(TypeCheck& check,
                                                 const FreezeCacheState& frozen);
 
@@ -6386,7 +6525,7 @@ class LiftoffCompiler {
     Label match, no_match, done;
     TypeCheck check(object.type, &no_match, null_succeeds);
     Initialize(check, kPop, object.type);
-    LiftoffRegister result(check.tmp1);
+    LiftoffRegister result(check.tmp);
     {
       FREEZE_STATE(frozen);
 
@@ -6414,6 +6553,7 @@ class LiftoffCompiler {
     AbstractTypeCheck<&LiftoffCompiler::StructCheck>(object, null_succeeds);
   }
 
+  // TODO(jkummerow): Inline.
   void RefIsEq(FullDecoder* /* decoder */, const Value& object,
                Value* /* result_val */, bool null_succeeds) {
     AbstractTypeCheck<&LiftoffCompiler::EqCheck>(object, null_succeeds);
@@ -6429,6 +6569,11 @@ class LiftoffCompiler {
     AbstractTypeCheck<&LiftoffCompiler::I31Check>(object, null_succeeds);
   }
 
+  void RefIsString(FullDecoder* /* decoder */, const Value& object,
+                   Value* /* result_val */, bool null_succeeds = false) {
+    AbstractTypeCheck<&LiftoffCompiler::StringCheck>(object, null_succeeds);
+  }
+
   template <TypeChecker type_checker>
   void AbstractTypeCast(const Value& object, FullDecoder* decoder,
                         ValueKind result_kind, bool null_succeeds = false) {
@@ -6471,6 +6616,12 @@ class LiftoffCompiler {
                                                    null_succeeds);
   }
 
+  void RefAsString(FullDecoder* decoder, const Value& object, Value* result,
+                   bool null_succeeds = false) {
+    AbstractTypeCast<&LiftoffCompiler::StringCheck>(object, decoder, kRef,
+                                                    null_succeeds);
+  }
+
   template <TypeChecker type_checker>
   void BrOnAbstractType(const Value& object, FullDecoder* decoder,
                         uint32_t br_depth, bool null_succeeds) {
@@ -6491,7 +6642,7 @@ class LiftoffCompiler {
 
     (this->*type_checker)(check, frozen);
     __ bind(&match);
-    BrOrRetImpl(decoder, br_depth, check.tmp1, check.tmp2);
+    BrOrRetImpl(decoder, br_depth);
 
     __ bind(&no_match);
   }
@@ -6518,7 +6669,7 @@ class LiftoffCompiler {
     __ emit_jump(&end);
 
     __ bind(&no_match);
-    BrOrRetImpl(decoder, br_depth, check.tmp1, check.tmp2);
+    BrOrRetImpl(decoder, br_depth);
 
     __ bind(&end);
   }
@@ -6551,6 +6702,13 @@ class LiftoffCompiler {
                                                    null_succeeds);
   }
 
+  void BrOnString(FullDecoder* decoder, const Value& object,
+                  Value* /* value_on_branch */, uint32_t br_depth,
+                  bool null_succeeds) {
+    BrOnAbstractType<&LiftoffCompiler::StringCheck>(object, decoder, br_depth,
+                                                    null_succeeds);
+  }
+
   void BrOnNonStruct(FullDecoder* decoder, const Value& object,
                      Value* /* value_on_branch */, uint32_t br_depth,
                      bool null_succeeds) {
@@ -6579,6 +6737,13 @@ class LiftoffCompiler {
                                                    null_succeeds);
   }
 
+  void BrOnNonString(FullDecoder* decoder, const Value& object,
+                     Value* /* value_on_branch */, uint32_t br_depth,
+                     bool null_succeeds) {
+    BrOnNonAbstractType<&LiftoffCompiler::StringCheck>(object, decoder,
+                                                       br_depth, null_succeeds);
+  }
+
   void StringNewWtf8(FullDecoder* decoder, const MemoryIndexImmediate& imm,
                      const unibrow::Utf8Variant variant, const Value& offset,
                      const Value& size, Value* result) {
@@ -6587,12 +6752,12 @@ class LiftoffCompiler {
     LiftoffRegister memory_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(memory_reg, imm.index);
-    LiftoffAssembler::VarState memory_var(kSmiKind, memory_reg, 0);
+    VarState memory_var(kSmiKind, memory_reg, 0);
 
     LiftoffRegister variant_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(variant_reg, static_cast<int32_t>(variant));
-    LiftoffAssembler::VarState variant_var(kSmiKind, variant_reg, 0);
+    VarState variant_var(kSmiKind, variant_reg, 0);
 
     CallRuntimeStub(
         WasmCode::kWasmStringNewWtf8,
@@ -6620,12 +6785,12 @@ class LiftoffCompiler {
     LiftoffRegister array_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-3], pinned));
     MaybeEmitNullCheck(decoder, array_reg.gp(), pinned, array.type);
-    LiftoffAssembler::VarState array_var(kRef, array_reg, 0);
+    VarState array_var(kRef, array_reg, 0);
 
     LiftoffRegister variant_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(variant_reg, static_cast<int32_t>(variant));
-    LiftoffAssembler::VarState variant_var(kSmiKind, variant_reg, 0);
+    VarState variant_var(kSmiKind, variant_reg, 0);
 
     CallRuntimeStub(
         WasmCode::kWasmStringNewWtf8Array,
@@ -6646,11 +6811,7 @@ class LiftoffCompiler {
 
   void StringNewWtf16(FullDecoder* decoder, const MemoryIndexImmediate& imm,
                       const Value& offset, const Value& size, Value* result) {
-    LiftoffRegList pinned;
-    LiftoffRegister memory_reg =
-        pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-    __ LoadConstant(memory_reg, WasmValue(static_cast<int32_t>(imm.index)));
-    LiftoffAssembler::VarState memory_var(kI32, memory_reg, 0);
+    VarState memory_var{kI32, static_cast<int32_t>(imm.index), 0};
 
     CallRuntimeStub(WasmCode::kWasmStringNewWtf16,
                     MakeSig::Returns(kRef).Params(kI32, kI32, kI32),
@@ -6675,7 +6836,7 @@ class LiftoffCompiler {
     LiftoffRegister array_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-3], pinned));
     MaybeEmitNullCheck(decoder, array_reg.gp(), pinned, array.type);
-    LiftoffAssembler::VarState array_var(kRef, array_reg, 0);
+    VarState array_var(kRef, array_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringNewWtf16Array,
                     MakeSig::Returns(kRef).Params(kRef, kI32, kI32),
@@ -6694,17 +6855,10 @@ class LiftoffCompiler {
 
   void StringConst(FullDecoder* decoder, const StringConstImmediate& imm,
                    Value* result) {
-    LiftoffRegList pinned;
-    LiftoffRegister index_reg =
-        pinned.set(__ GetUnusedRegister(kGpReg, pinned));
-    __ LoadConstant(index_reg, WasmValue(static_cast<int32_t>(imm.index)));
-    LiftoffAssembler::VarState index_var(kI32, index_reg, 0);
+    VarState index_var{kI32, static_cast<int32_t>(imm.index), 0};
 
     CallRuntimeStub(WasmCode::kWasmStringConst,
-                    MakeSig::Returns(kRef).Params(kI32),
-                    {
-                        index_var,
-                    },
+                    MakeSig::Returns(kRef).Params(kI32), {index_var},
                     decoder->position());
     RegisterDebugSideTableEntry(decoder, DebugSideTableBuilder::kDidSpill);
 
@@ -6718,7 +6872,7 @@ class LiftoffCompiler {
     LiftoffRegList pinned;
     LiftoffRegister string_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, string_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState string_var(kRef, string_reg, 0);
+    VarState string_var(kRef, string_reg, 0);
 
     WasmCode::RuntimeStubId stub_id;
     switch (variant) {
@@ -6760,23 +6914,22 @@ class LiftoffCompiler {
                         const Value& offset, Value* result) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& offset_var =
-        __ cache_state()->stack_state.end()[-1];
+    VarState& offset_var = __ cache_state()->stack_state.end()[-1];
 
     LiftoffRegister string_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-2], pinned));
     MaybeEmitNullCheck(decoder, string_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState string_var(kRef, string_reg, 0);
+    VarState string_var(kRef, string_reg, 0);
 
     LiftoffRegister memory_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(memory_reg, imm.index);
-    LiftoffAssembler::VarState memory_var(kSmiKind, memory_reg, 0);
+    VarState memory_var(kSmiKind, memory_reg, 0);
 
     LiftoffRegister variant_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(variant_reg, static_cast<int32_t>(variant));
-    LiftoffAssembler::VarState variant_var(kSmiKind, variant_reg, 0);
+    VarState variant_var(kSmiKind, variant_reg, 0);
 
     CallRuntimeStub(
         WasmCode::kWasmStringEncodeWtf8,
@@ -6804,20 +6957,19 @@ class LiftoffCompiler {
     LiftoffRegister array_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-2], pinned));
     MaybeEmitNullCheck(decoder, array_reg.gp(), pinned, array.type);
-    LiftoffAssembler::VarState array_var(kRef, array_reg, 0);
+    VarState array_var(kRef, array_reg, 0);
 
     LiftoffRegister string_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-3], pinned));
     MaybeEmitNullCheck(decoder, string_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState string_var(kRef, string_reg, 0);
+    VarState string_var(kRef, string_reg, 0);
 
-    LiftoffAssembler::VarState& start_var =
-        __ cache_state()->stack_state.end()[-1];
+    VarState& start_var = __ cache_state()->stack_state.end()[-1];
 
     LiftoffRegister variant_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(variant_reg, static_cast<int32_t>(variant));
-    LiftoffAssembler::VarState variant_var(kSmiKind, variant_reg, 0);
+    VarState variant_var(kSmiKind, variant_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringEncodeWtf8Array,
                     MakeSig::Returns(kI32).Params(kRef, kRef, kI32, kSmiKind),
@@ -6839,18 +6991,17 @@ class LiftoffCompiler {
                          const Value& str, const Value& offset, Value* result) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& offset_var =
-        __ cache_state()->stack_state.end()[-1];
+    VarState& offset_var = __ cache_state()->stack_state.end()[-1];
 
     LiftoffRegister string_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-2], pinned));
     MaybeEmitNullCheck(decoder, string_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState string_var(kRef, string_reg, 0);
+    VarState string_var(kRef, string_reg, 0);
 
     LiftoffRegister memory_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(memory_reg, imm.index);
-    LiftoffAssembler::VarState memory_var(kSmiKind, memory_reg, 0);
+    VarState memory_var(kSmiKind, memory_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringEncodeWtf16,
                     MakeSig::Returns(kI32).Params(kRef, kI32, kSmiKind),
@@ -6875,15 +7026,14 @@ class LiftoffCompiler {
     LiftoffRegister array_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-2], pinned));
     MaybeEmitNullCheck(decoder, array_reg.gp(), pinned, array.type);
-    LiftoffAssembler::VarState array_var(kRef, array_reg, 0);
+    VarState array_var(kRef, array_reg, 0);
 
     LiftoffRegister string_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-3], pinned));
     MaybeEmitNullCheck(decoder, string_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState string_var(kRef, string_reg, 0);
+    VarState string_var(kRef, string_reg, 0);
 
-    LiftoffAssembler::VarState& start_var =
-        __ cache_state()->stack_state.end()[-1];
+    VarState& start_var = __ cache_state()->stack_state.end()[-1];
 
     CallRuntimeStub(WasmCode::kWasmStringEncodeWtf16Array,
                     MakeSig::Returns(kI32).Params(kRef, kRef, kI32),
@@ -6906,11 +7056,11 @@ class LiftoffCompiler {
 
     LiftoffRegister tail_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, tail_reg.gp(), pinned, tail.type);
-    LiftoffAssembler::VarState tail_var(kRef, tail_reg, 0);
+    VarState tail_var(kRef, tail_reg, 0);
 
     LiftoffRegister head_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, head_reg.gp(), pinned, head.type);
-    LiftoffAssembler::VarState head_var(kRef, head_reg, 0);
+    VarState head_var(kRef, head_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringConcat,
                     MakeSig::Returns(kRef).Params(kRef, kRef),
@@ -6970,8 +7120,8 @@ class LiftoffCompiler {
 
     // Operands are pointer-distinct and neither is null; call out to the
     // runtime.
-    LiftoffAssembler::VarState a_var(kRef, a_reg, 0);
-    LiftoffAssembler::VarState b_var(kRef, b_reg, 0);
+    VarState a_var(kRef, a_reg, 0);
+    VarState b_var(kRef, b_reg, 0);
     CallRuntimeStub(WasmCode::kWasmStringEqual,
                     MakeSig::Returns(kI32).Params(kRef, kRef),
                     {
@@ -6992,7 +7142,7 @@ class LiftoffCompiler {
 
     LiftoffRegister str_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, str_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState str_var(kRef, str_reg, 0);
+    VarState str_var(kRef, str_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringIsUSVSequence,
                     MakeSig::Returns(kI32).Params(kRef),
@@ -7011,7 +7161,7 @@ class LiftoffCompiler {
 
     LiftoffRegister str_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, str_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState str_var(kRef, str_reg, 0);
+    VarState str_var(kRef, str_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringAsWtf8,
                     MakeSig::Returns(kRef).Params(kRef),
@@ -7030,15 +7180,13 @@ class LiftoffCompiler {
                              Value* result) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& bytes_var =
-        __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState& pos_var =
-        __ cache_state()->stack_state.end()[-2];
+    VarState& bytes_var = __ cache_state()->stack_state.end()[-1];
+    VarState& pos_var = __ cache_state()->stack_state.end()[-2];
 
     LiftoffRegister view_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-3], pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewWtf8Advance,
                     MakeSig::Returns(kI32).Params(kRef, kI32, kI32),
@@ -7063,27 +7211,24 @@ class LiftoffCompiler {
                             Value* next_pos, Value* bytes_written) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& bytes_var =
-        __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState& pos_var =
-        __ cache_state()->stack_state.end()[-2];
-    LiftoffAssembler::VarState& addr_var =
-        __ cache_state()->stack_state.end()[-3];
+    VarState& bytes_var = __ cache_state()->stack_state.end()[-1];
+    VarState& pos_var = __ cache_state()->stack_state.end()[-2];
+    VarState& addr_var = __ cache_state()->stack_state.end()[-3];
 
     LiftoffRegister view_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-4], pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
 
     LiftoffRegister memory_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(memory_reg, imm.index);
-    LiftoffAssembler::VarState memory_var(kSmiKind, memory_reg, 0);
+    VarState memory_var(kSmiKind, memory_reg, 0);
 
     LiftoffRegister variant_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(variant_reg, static_cast<int32_t>(variant));
-    LiftoffAssembler::VarState variant_var(kSmiKind, variant_reg, 0);
+    VarState variant_var(kSmiKind, variant_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewWtf8Encode,
                     MakeSig::Returns(kI32, kI32)
@@ -7111,15 +7256,13 @@ class LiftoffCompiler {
                            Value* result) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& end_var =
-        __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState& start_var =
-        __ cache_state()->stack_state.end()[-2];
+    VarState& end_var = __ cache_state()->stack_state.end()[-1];
+    VarState& start_var = __ cache_state()->stack_state.end()[-2];
 
     LiftoffRegister view_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-3], pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewWtf8Slice,
                     MakeSig::Returns(kRef).Params(kRef, kI32, kI32),
@@ -7141,7 +7284,7 @@ class LiftoffCompiler {
 
     LiftoffRegister str_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, str_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState str_var(kRef, str_reg, 0);
+    VarState str_var(kRef, str_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringAsWtf16,
                     MakeSig::Returns(kRef).Params(kRef),
@@ -7161,8 +7304,8 @@ class LiftoffCompiler {
     LiftoffRegister pos_reg = pinned.set(__ PopToRegister(pinned));
     LiftoffRegister view_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
-    LiftoffAssembler::VarState pos_var(kI32, pos_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
+    VarState pos_var(kI32, pos_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewWtf16GetCodeUnit,
                     MakeSig::Returns(kI32).Params(kRef, kI32),
@@ -7183,22 +7326,19 @@ class LiftoffCompiler {
                              const Value& codeunits, Value* result) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& codeunits_var =
-        __ cache_state()->stack_state.end()[-1];
-    LiftoffAssembler::VarState& pos_var =
-        __ cache_state()->stack_state.end()[-2];
-    LiftoffAssembler::VarState& offset_var =
-        __ cache_state()->stack_state.end()[-3];
+    VarState& codeunits_var = __ cache_state()->stack_state.end()[-1];
+    VarState& pos_var = __ cache_state()->stack_state.end()[-2];
+    VarState& offset_var = __ cache_state()->stack_state.end()[-3];
 
     LiftoffRegister view_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-4], pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
 
     LiftoffRegister memory_reg =
         pinned.set(__ GetUnusedRegister(kGpReg, pinned));
     LoadSmi(memory_reg, imm.index);
-    LiftoffAssembler::VarState memory_var(kSmiKind, memory_reg, 0);
+    VarState memory_var(kSmiKind, memory_reg, 0);
 
     CallRuntimeStub(
         WasmCode::kWasmStringViewWtf16Encode,
@@ -7226,9 +7366,9 @@ class LiftoffCompiler {
     LiftoffRegister start_reg = pinned.set(__ PopToRegister(pinned));
     LiftoffRegister view_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
-    LiftoffAssembler::VarState start_var(kI32, start_reg, 0);
-    LiftoffAssembler::VarState end_var(kI32, end_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
+    VarState start_var(kI32, start_reg, 0);
+    VarState end_var(kI32, end_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewWtf16Slice,
                     MakeSig::Returns(kRef).Params(kRef, kI32, kI32),
@@ -7249,7 +7389,7 @@ class LiftoffCompiler {
 
     LiftoffRegister str_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, str_reg.gp(), pinned, str.type);
-    LiftoffAssembler::VarState str_var(kRef, str_reg, 0);
+    VarState str_var(kRef, str_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringAsIter,
                     MakeSig::Returns(kRef).Params(kRef),
@@ -7269,7 +7409,7 @@ class LiftoffCompiler {
 
     LiftoffRegister view_reg = pinned.set(__ PopToRegister(pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewIterNext,
                     MakeSig::Returns(kI32).Params(kRef),
@@ -7287,13 +7427,12 @@ class LiftoffCompiler {
                              const Value& codepoints, Value* result) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& codepoints_var =
-        __ cache_state()->stack_state.end()[-1];
+    VarState& codepoints_var = __ cache_state()->stack_state.end()[-1];
 
     LiftoffRegister view_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-2], pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewIterAdvance,
                     MakeSig::Returns(kI32).Params(kRef, kI32),
@@ -7313,13 +7452,12 @@ class LiftoffCompiler {
                             const Value& codepoints, Value* result) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& codepoints_var =
-        __ cache_state()->stack_state.end()[-1];
+    VarState& codepoints_var = __ cache_state()->stack_state.end()[-1];
 
     LiftoffRegister view_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-2], pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewIterRewind,
                     MakeSig::Returns(kI32).Params(kRef, kI32),
@@ -7339,13 +7477,12 @@ class LiftoffCompiler {
                            const Value& codepoints, Value* result) {
     LiftoffRegList pinned;
 
-    LiftoffAssembler::VarState& codepoints_var =
-        __ cache_state()->stack_state.end()[-1];
+    VarState& codepoints_var = __ cache_state()->stack_state.end()[-1];
 
     LiftoffRegister view_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-2], pinned));
     MaybeEmitNullCheck(decoder, view_reg.gp(), pinned, view.type);
-    LiftoffAssembler::VarState view_var(kRef, view_reg, 0);
+    VarState view_var(kRef, view_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringViewIterSlice,
                     MakeSig::Returns(kRef).Params(kRef, kI32),
@@ -7367,12 +7504,12 @@ class LiftoffCompiler {
     LiftoffRegister rhs_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-1], pinned));
     MaybeEmitNullCheck(decoder, rhs_reg.gp(), pinned, rhs.type);
-    LiftoffAssembler::VarState rhs_var(kRef, rhs_reg, 0);
+    VarState rhs_var(kRef, rhs_reg, 0);
 
     LiftoffRegister lhs_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-2], pinned));
     MaybeEmitNullCheck(decoder, lhs_reg.gp(), pinned, lhs.type);
-    LiftoffAssembler::VarState lhs_var(kRef, lhs_reg, 0);
+    VarState lhs_var(kRef, lhs_reg, 0);
 
     CallRuntimeStub(WasmCode::kStringCompare,
                     MakeSig::Returns(kSmiKind).Params(kRef, kRef),
@@ -7387,8 +7524,7 @@ class LiftoffCompiler {
 
   void StringFromCodePoint(FullDecoder* decoder, const Value& code_point,
                            Value* result) {
-    LiftoffAssembler::VarState& codepoint_var =
-        __ cache_state()->stack_state.end()[-1];
+    VarState& codepoint_var = __ cache_state()->stack_state.end()[-1];
 
     CallRuntimeStub(WasmCode::kWasmStringFromCodePoint,
                     MakeSig::Returns(kRef).Params(kI32), {codepoint_var},
@@ -7405,7 +7541,7 @@ class LiftoffCompiler {
     LiftoffRegister string_reg = pinned.set(
         __ LoadToRegister(__ cache_state()->stack_state.end()[-1], pinned));
     MaybeEmitNullCheck(decoder, string_reg.gp(), pinned, string.type);
-    LiftoffAssembler::VarState string_var(kRef, string_reg, 0);
+    VarState string_var(kRef, string_reg, 0);
 
     CallRuntimeStub(WasmCode::kWasmStringHash,
                     MakeSig::Returns(kI32).Params(kRef), {string_var},
@@ -7447,10 +7583,10 @@ class LiftoffCompiler {
       Register imported_targets = tmp;
       LOAD_TAGGED_PTR_INSTANCE_FIELD(imported_targets, ImportedFunctionTargets,
                                      pinned);
-      __ Load(
-          LiftoffRegister(target), imported_targets, no_reg,
-          wasm::ObjectAccess::ElementOffsetInTaggedFixedAddressArray(imm.index),
-          kPointerLoadType);
+      __ LoadFullPointer(
+          target, imported_targets,
+          wasm::ObjectAccess::ElementOffsetInTaggedFixedAddressArray(
+              imm.index));
 
       Register imported_function_refs = tmp;
       LOAD_TAGGED_PTR_INSTANCE_FIELD(imported_function_refs,
@@ -7505,8 +7641,8 @@ class LiftoffCompiler {
     }
   }
 
-  void CallIndirect(FullDecoder* decoder, const Value& index_val,
-                    const CallIndirectImmediate& imm, TailCall tail_call) {
+  void CallIndirect(FullDecoder* decoder, const CallIndirectImmediate& imm,
+                    TailCall tail_call) {
     MostlySmallValueKindSig sig(zone_, imm.sig);
     for (ValueKind ret : sig.returns()) {
       if (!CheckSupportedType(decoder, ret, "return")) return;
@@ -7568,16 +7704,19 @@ class LiftoffCompiler {
 
       // Load the signature from {instance->ift_sig_ids[key]}
       if (imm.table_imm.index == 0) {
-        LOAD_INSTANCE_FIELD(real_sig_id, IndirectFunctionTableSigIds,
-                            kSystemPointerSize, pinned);
+        LOAD_TAGGED_PTR_INSTANCE_FIELD(real_sig_id, IndirectFunctionTableSigIds,
+                                       pinned);
       } else {
-        __ Load(LiftoffRegister(real_sig_id), indirect_function_table, no_reg,
-                wasm::ObjectAccess::ToTagged(
-                    WasmIndirectFunctionTable::kSigIdsOffset),
-                kPointerLoadType);
+        __ LoadTaggedPointer(real_sig_id, indirect_function_table, no_reg,
+                             wasm::ObjectAccess::ToTagged(
+                                 WasmIndirectFunctionTable::kSigIdsOffset));
       }
-      static_assert((1 << 2) == kInt32Size);
-      __ Load(LiftoffRegister(real_sig_id), real_sig_id, index, 0,
+      // Here and below, the FixedUint32Array holding the sig ids is really
+      // just a ByteArray interpreted as uint32s, so the offset to the start of
+      // the elements is the ByteArray header size.
+      // TODO(saelo) maybe make the names of these arrays less confusing?
+      int buffer_offset = wasm::ObjectAccess::ToTagged(ByteArray::kHeaderSize);
+      __ Load(LiftoffRegister(real_sig_id), real_sig_id, index, buffer_offset,
               LoadType::kI32Load, nullptr, false, false, true);
 
       // Compare against expected signature.
@@ -7660,16 +7799,15 @@ class LiftoffCompiler {
 
       // Load the signature from {instance->ift_sig_ids[key]}
       if (imm.table_imm.index == 0) {
-        LOAD_INSTANCE_FIELD(real_sig_id, IndirectFunctionTableSigIds,
-                            kSystemPointerSize, pinned);
+        LOAD_TAGGED_PTR_INSTANCE_FIELD(real_sig_id, IndirectFunctionTableSigIds,
+                                       pinned);
       } else {
-        __ Load(LiftoffRegister(real_sig_id), indirect_function_table, no_reg,
-                wasm::ObjectAccess::ToTagged(
-                    WasmIndirectFunctionTable::kSigIdsOffset),
-                kPointerLoadType);
+        __ LoadTaggedPointer(real_sig_id, indirect_function_table, no_reg,
+                             wasm::ObjectAccess::ToTagged(
+                                 WasmIndirectFunctionTable::kSigIdsOffset));
       }
-      static_assert((1 << 2) == kInt32Size);
-      __ Load(LiftoffRegister(real_sig_id), real_sig_id, index, 0,
+      int buffer_offset = wasm::ObjectAccess::ToTagged(ByteArray::kHeaderSize);
+      __ Load(LiftoffRegister(real_sig_id), real_sig_id, index, buffer_offset,
               LoadType::kI32Load, nullptr, false, false, true);
 
       Label* sig_mismatch_label =
@@ -7703,17 +7841,17 @@ class LiftoffCompiler {
 
       // Load the target from {instance->ift_targets[key]}
       if (imm.table_imm.index == 0) {
-        LOAD_INSTANCE_FIELD(function_target, IndirectFunctionTableTargets,
-                            kSystemPointerSize, pinned);
+        LOAD_TAGGED_PTR_INSTANCE_FIELD(function_target,
+                                       IndirectFunctionTableTargets, pinned);
       } else {
-        __ Load(LiftoffRegister(function_target), indirect_function_table,
-                no_reg,
-                wasm::ObjectAccess::ToTagged(
-                    WasmIndirectFunctionTable::kTargetsOffset),
-                kPointerLoadType);
+        __ LoadTaggedPointer(function_target, indirect_function_table, no_reg,
+                             wasm::ObjectAccess::ToTagged(
+                                 WasmIndirectFunctionTable::kTargetsOffset));
       }
-      __ Load(LiftoffRegister(function_target), function_target, index, 0,
-              kPointerLoadType, nullptr, false, false, true);
+      __ LoadExternalPointer(
+          function_target, function_target,
+          ObjectAccess::ElementOffsetInTaggedExternalPointerArray(0), index,
+          kWasmIndirectFunctionTargetTag, tmp3);
 
       auto call_descriptor = compiler::GetWasmCallDescriptor(zone_, imm.sig);
       call_descriptor = GetLoweredCallDescriptor(zone_, call_descriptor);
@@ -7753,16 +7891,16 @@ class LiftoffCompiler {
       LiftoffRegister func_ref = pinned.set(__ PopToRegister(pinned));
       LiftoffRegister vector = pinned.set(__ GetUnusedRegister(kGpReg, pinned));
       MaybeEmitNullCheck(decoder, func_ref.gp(), pinned, func_ref_type);
-      LiftoffAssembler::VarState func_ref_var(kRef, func_ref, 0);
+      VarState func_ref_var(kRef, func_ref, 0);
 
       __ Fill(vector, liftoff::kFeedbackVectorOffset, kRef);
-      LiftoffAssembler::VarState vector_var{kRef, vector, 0};
+      VarState vector_var{kRef, vector, 0};
       LiftoffRegister index = pinned.set(__ GetUnusedRegister(kGpReg, pinned));
       size_t vector_slot = encountered_call_instructions_.size() * 2;
       encountered_call_instructions_.push_back(
           FunctionTypeFeedback::kNonDirectCall);
       __ LoadConstant(index, WasmValue::ForUintPtr(vector_slot));
-      LiftoffAssembler::VarState index_var(kIntPtrKind, index, 0);
+      VarState index_var(kIntPtrKind, index, 0);
 
       // CallRefIC(vector: FixedArray, index: intptr,
       //           funcref: WasmInternalFunction)
@@ -7800,16 +7938,10 @@ class LiftoffCompiler {
           instance.gp(), func_ref.gp(), no_reg,
           wasm::ObjectAccess::ToTagged(WasmInternalFunction::kRefOffset));
 
-#ifdef V8_ENABLE_SANDBOX
-      __ LoadExternalPointer(target.gp(), func_ref.gp(),
-                             WasmInternalFunction::kCallTargetOffset,
-                             kWasmInternalFunctionCallTargetTag, temp.gp());
-#else
-      __ Load(
-          target, func_ref.gp(), no_reg,
+      __ LoadExternalPointer(
+          target.gp(), func_ref.gp(),
           wasm::ObjectAccess::ToTagged(WasmInternalFunction::kCallTargetOffset),
-          kPointerLoadType);
-#endif
+          kWasmInternalFunctionCallTargetTag, temp.gp());
 
       FREEZE_STATE(frozen);
       Label perform_call;
@@ -7822,7 +7954,7 @@ class LiftoffCompiler {
       __ LoadTaggedPointer(
           target.gp(), func_ref.gp(), no_reg,
           wasm::ObjectAccess::ToTagged(WasmInternalFunction::kCodeOffset));
-      __ LoadCodeEntry(target.gp(), target.gp());
+      __ LoadCodeInstructionStart(target.gp(), target.gp());
       // Fall through to {perform_call}.
 
       __ bind(&perform_call);
@@ -7848,7 +7980,7 @@ class LiftoffCompiler {
     }
   }
 
-  void LoadNullValue(Register null, LiftoffRegList pinned, ValueType type) {
+  void LoadNullValue(Register null, ValueType type) {
     __ LoadFullPointer(
         null, kRootRegister,
         type == kWasmExternRef || type == kWasmNullExternRef
@@ -7871,7 +8003,7 @@ class LiftoffCompiler {
       __ LoadConstant(LiftoffRegister(null),
                       WasmValue(static_cast<uint32_t>(static_null)));
     } else {
-      LoadNullValue(null, pinned, type);
+      LoadNullValue(null, type);
     }
   }
 
@@ -7941,8 +8073,7 @@ class LiftoffCompiler {
     }
   }
 
-  void SetDefaultValue(LiftoffRegister reg, ValueType type,
-                       LiftoffRegList pinned) {
+  void SetDefaultValue(LiftoffRegister reg, ValueType type) {
     DCHECK(is_defaultable(type.kind()));
     switch (type.kind()) {
       case kI8:
@@ -7959,7 +8090,7 @@ class LiftoffCompiler {
         DCHECK(CpuFeatures::SupportsWasmSimd128());
         return __ emit_s128_xor(reg, reg, reg);
       case kRefNull:
-        return LoadNullValue(reg.gp(), pinned, type);
+        return LoadNullValue(reg.gp(), type);
       case kRtt:
       case kVoid:
       case kBottom:
@@ -8039,8 +8170,16 @@ class LiftoffCompiler {
       // cause any state changes.
       // TODO(jkummerow): See if we can make this more elegant, e.g. by passing
       // a temp register to {StoreObjectField}.
-      LiftoffRegister unused_and_unpinned = __ GetUnusedRegister(pinned);
-      USE(unused_and_unpinned);
+#if V8_TARGET_ARCH_IA32
+      bool store_needs_additional_register = elem_kind != kI64;
+#else
+      bool store_needs_additional_register = true;
+#endif
+      if (store_needs_additional_register) {
+        LiftoffRegister unused_and_unpinned =
+            __ GetUnusedRegister(kGpReg, pinned);
+        USE(unused_and_unpinned);
+      }
       FREEZE_STATE(in_this_case_its_fine);
       __ emit_cond_jump(kUnsignedGreaterThanEqual, &done, kI32, offset.gp(),
                         end_offset.gp(), in_this_case_its_fine);
@@ -8131,6 +8270,7 @@ class LiftoffCompiler {
   compiler::CallDescriptor* const descriptor_;
   CompilationEnv* const env_;
   DebugSideTableBuilder* const debug_sidetable_builder_;
+  base::OwnedVector<ValueType> stack_value_types_for_debugging_;
   const ForDebugging for_debugging_;
   LiftoffBailoutReason bailout_reason_ = kSuccess;
   const int func_index_;
@@ -8178,6 +8318,8 @@ class LiftoffCompiler {
   // After compilation, this is transferred into {WasmModule::type_feedback}.
   std::vector<uint32_t> encountered_call_instructions_;
 
+  // Pointer to information passed from the fuzzer. The pointers will be
+  // embedded in generated code, which will update the values at runtime.
   int32_t* max_steps_;
   int32_t* nondeterminism_;
 
@@ -8189,8 +8331,7 @@ constexpr WasmOpcode LiftoffCompiler::kNoOutstandingOp;
 // static
 constexpr base::EnumSet<ValueKind> LiftoffCompiler::kUnconditionallySupported;
 
-std::unique_ptr<AssemblerBuffer> NewLiftoffAssemblerBuffer(
-    AssemblerBufferCache* assembler_buffer_cache, int func_body_size) {
+std::unique_ptr<AssemblerBuffer> NewLiftoffAssemblerBuffer(int func_body_size) {
   size_t code_size_estimate =
       WasmCodeManager::EstimateLiftoffCodeSize(func_body_size);
   // Allocate the initial buffer a bit bigger to avoid reallocation during code
@@ -8199,9 +8340,7 @@ std::unique_ptr<AssemblerBuffer> NewLiftoffAssemblerBuffer(
   // have to grow more often.
   int initial_buffer_size = static_cast<int>(128 + code_size_estimate * 4 / 3);
 
-  return assembler_buffer_cache
-             ? assembler_buffer_cache->GetAssemblerBuffer(initial_buffer_size)
-             : NewAssemblerBuffer(initial_buffer_size);
+  return NewAssemblerBuffer(initial_buffer_size);
 }
 
 }  // namespace
@@ -8237,9 +8376,8 @@ WasmCompilationResult ExecuteLiftoffCompilation(
       compiler_options.detected_features ? compiler_options.detected_features
                                          : &unused_detected_features,
       func_body, call_descriptor, env, &zone,
-      NewLiftoffAssemblerBuffer(compiler_options.assembler_buffer_cache,
-                                func_body_size),
-      debug_sidetable_builder.get(), compiler_options);
+      NewLiftoffAssemblerBuffer(func_body_size), debug_sidetable_builder.get(),
+      compiler_options);
   decoder.Decode();
   LiftoffCompiler* compiler = &decoder.interface();
   if (decoder.failed()) compiler->OnFirstError(&decoder);
@@ -8295,7 +8433,7 @@ std::unique_ptr<DebugSideTable> GenerateLiftoffDebugSideTable(
   auto* native_module = code->native_module();
   auto* function = &native_module->module()->functions[code->index()];
   ModuleWireBytes wire_bytes{native_module->wire_bytes()};
-  base::Vector<const byte> function_bytes =
+  base::Vector<const uint8_t> function_bytes =
       wire_bytes.GetFunctionBytes(function);
   CompilationEnv env = native_module->CreateCompilationEnv();
   FunctionBody func_body{function->sig, 0, function_bytes.begin(),
diff --git a/deps/v8/src/wasm/baseline/liftoff-compiler.h b/deps/v8/src/wasm/baseline/liftoff-compiler.h
index a4e3c96566e264..d8b40bcc4f4780 100644
--- a/deps/v8/src/wasm/baseline/liftoff-compiler.h
+++ b/deps/v8/src/wasm/baseline/liftoff-compiler.h
@@ -58,7 +58,6 @@ struct LiftoffOptions {
   int func_index = -1;
   ForDebugging for_debugging = kNotForDebugging;
   Counters* counters = nullptr;
-  AssemblerBufferCache* assembler_buffer_cache = nullptr;
   WasmFeatures* detected_features = nullptr;
   base::Vector<const int> breakpoints = {};
   std::unique_ptr<DebugSideTable>* debug_sidetable = nullptr;
@@ -79,7 +78,6 @@ struct LiftoffOptions {
   SETTER(func_index)
   SETTER(for_debugging)
   SETTER(counters)
-  SETTER(assembler_buffer_cache)
   SETTER(detected_features)
   SETTER(breakpoints)
   SETTER(debug_sidetable)
diff --git a/deps/v8/src/wasm/baseline/loong64/liftoff-assembler-loong64.h b/deps/v8/src/wasm/baseline/loong64/liftoff-assembler-loong64.h
index dbc2b35df45818..aaece7681c999a 100644
--- a/deps/v8/src/wasm/baseline/loong64/liftoff-assembler-loong64.h
+++ b/deps/v8/src/wasm/baseline/loong64/liftoff-assembler-loong64.h
@@ -8,6 +8,7 @@
 #include "src/codegen/machine-type.h"
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
+#include "src/wasm/object-access.h"
 #include "src/wasm/wasm-objects.h"
 
 namespace v8 {
@@ -310,6 +311,32 @@ bool LiftoffAssembler::NeedsAlignment(ValueKind kind) {
   return kind == kS128 || is_reference(kind);
 }
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  Register budget_array = kScratchReg;
+
+  Register instance = cache_state_.cached_instance;
+  if (instance == no_reg) {
+    instance = budget_array;  // Reuse the scratch register.
+    LoadInstanceFromFrame(instance);
+  }
+
+  constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+      WasmInstanceObject::kTieringBudgetArrayOffset);
+  Ld_d(budget_array, MemOperand(instance, kArrayOffset));
+
+  int budget_arr_offset = kInt32Size * declared_func_index;
+
+  Register budget = kScratchReg2;
+  MemOperand budget_addr(budget_array, budget_arr_offset);
+  Ld_w(budget, budget_addr);
+  Sub_w(budget, budget, budget_used);
+  St_w(budget, budget_addr);
+
+  Branch(ool_label, less, budget, Operand(zero_reg));
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -357,6 +384,22 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   LoadTaggedField(dst, MemOperand(instance, offset));
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, ExternalPointerTag tag,
+                                           Register /* scratch */) {
+  LoadExternalPointerField(dst, MemOperand(src_addr, offset), tag,
+                           kRootRegister);
+}
+
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register /* scratch */) {
+  MemOperand src_op = liftoff::GetMemOp(this, src_addr, index, offset, false,
+                                        V8_ENABLE_SANDBOX_BOOL ? 2 : 3);
+  LoadExternalPointerField(dst, src_op, tag, kRootRegister);
+}
+
 void LiftoffAssembler::SpillInstance(Register instance) {
   St_d(instance, liftoff::GetInstanceOperand());
 }
@@ -1056,11 +1099,11 @@ void LiftoffAssembler::emit_i32_divs(Register dst, Register lhs, Register rhs,
   MacroAssembler::Branch(trap_div_by_zero, eq, rhs, Operand(zero_reg));
 
   // Check if lhs == kMinInt and rhs == -1, since this case is unrepresentable.
-  MacroAssembler::li(kScratchReg, 1);
-  MacroAssembler::li(kScratchReg2, 1);
-  MacroAssembler::LoadZeroOnCondition(kScratchReg, lhs, Operand(kMinInt), eq);
-  MacroAssembler::LoadZeroOnCondition(kScratchReg2, rhs, Operand(-1), eq);
-  add_d(kScratchReg, kScratchReg, kScratchReg2);
+  rotri_w(kScratchReg, lhs, 31);
+  xori(kScratchReg, kScratchReg, 1);
+  // If lhs == kMinInt, move rhs to kScratchReg.
+  masknez(kScratchReg, rhs, kScratchReg);
+  addi_w(kScratchReg, kScratchReg, 1);
   MacroAssembler::Branch(trap_div_unrepresentable, eq, kScratchReg,
                          Operand(zero_reg));
 
@@ -1166,12 +1209,11 @@ bool LiftoffAssembler::emit_i64_divs(LiftoffRegister dst, LiftoffRegister lhs,
   MacroAssembler::Branch(trap_div_by_zero, eq, rhs.gp(), Operand(zero_reg));
 
   // Check if lhs == MinInt64 and rhs == -1, since this case is unrepresentable.
-  MacroAssembler::li(kScratchReg, 1);
-  MacroAssembler::li(kScratchReg2, 1);
-  MacroAssembler::LoadZeroOnCondition(
-      kScratchReg, lhs.gp(), Operand(std::numeric_limits<int64_t>::min()), eq);
-  MacroAssembler::LoadZeroOnCondition(kScratchReg2, rhs.gp(), Operand(-1), eq);
-  add_d(kScratchReg, kScratchReg, kScratchReg2);
+  rotri_d(kScratchReg, lhs.gp(), 63);
+  xori(kScratchReg, kScratchReg, 1);
+  // If lhs == MinInt64, move rhs to kScratchReg.
+  masknez(kScratchReg, rhs.gp(), kScratchReg);
+  addi_d(kScratchReg, kScratchReg, 1);
   MacroAssembler::Branch(trap_div_unrepresentable, eq, kScratchReg,
                          Operand(zero_reg));
 
@@ -1665,13 +1707,6 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
   MacroAssembler::CompareTaggedAndBranch(label, cond, lhs, Operand(imm));
 }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  MacroAssembler::Sub_w(value, value, Operand(subtrahend));
-  MacroAssembler::Branch(result_negative, less, value, Operand(zero_reg));
-}
-
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
   slli_w(dst, src, 0);
   sltui(dst, dst, 1);
@@ -1679,25 +1714,14 @@ void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
 
 void LiftoffAssembler::emit_i32_set_cond(Condition cond, Register dst,
                                          Register lhs, Register rhs) {
-  Register tmp = dst;
-  if (dst == lhs || dst == rhs) {
-    tmp = GetUnusedRegister(kGpReg, LiftoffRegList{lhs, rhs}).gp();
-  }
-  // Write 1 as result.
-  MacroAssembler::li(tmp, 1);
-
-  // If negative condition is true, write 0 as result.
-  Condition neg_cond = NegateCondition(cond);
   UseScratchRegisterScope temps(this);
   Register scratch0 = temps.Acquire();
   Register scratch1 = kScratchReg;
 
   slli_w(scratch0, lhs, 0);
   slli_w(scratch1, rhs, 0);
-  // Write 1 as result.
-  MacroAssembler::li(dst, 1);
-  MacroAssembler::LoadZeroOnCondition(dst, scratch0, Operand(scratch1),
-                                      neg_cond);
+
+  CompareWord(cond, dst, scratch0, Operand(scratch1));
 }
 
 void LiftoffAssembler::emit_i64_eqz(Register dst, LiftoffRegister src) {
@@ -1707,20 +1731,7 @@ void LiftoffAssembler::emit_i64_eqz(Register dst, LiftoffRegister src) {
 void LiftoffAssembler::emit_i64_set_cond(Condition cond, Register dst,
                                          LiftoffRegister lhs,
                                          LiftoffRegister rhs) {
-  Register tmp = dst;
-  if (dst == lhs.gp() || dst == rhs.gp()) {
-    tmp = GetUnusedRegister(kGpReg, LiftoffRegList{lhs, rhs}).gp();
-  }
-  // Write 1 as result.
-  MacroAssembler::li(tmp, 1);
-
-  // If negative condition is true, write 0 as result.
-  Condition neg_cond = NegateCondition(cond);
-  MacroAssembler::LoadZeroOnCondition(tmp, lhs.gp(), Operand(rhs.gp()),
-                                      neg_cond);
-
-  // If tmp != dst, result will be moved.
-  MacroAssembler::Move(dst, tmp);
+  CompareWord(cond, dst, lhs.gp(), Operand(rhs.gp()));
 }
 
 namespace liftoff {
@@ -3026,11 +3037,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   MacroAssembler::Branch(ool_code, ule, sp, Operand(limit_address));
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  PrepareCallCFunction(0, GetUnusedRegister(kGpReg, {}).gp());
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   if (v8_flags.debug_code) Abort(reason);
 }
@@ -3089,13 +3095,15 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetFirstRegSet();
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetFirstRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -3110,19 +3118,53 @@ void LiftoffAssembler::DropStackSlotsAndRet(uint32_t num_stack_slots) {
   Ret();
 }
 
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   addi_d(sp, sp, -stack_bytes);
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    liftoff::Store(this, sp, arg_bytes, *args++, param_kind);
-    arg_bytes += value_kind_size(param_kind);
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    if (arg.is_reg()) {
+      liftoff::Store(this, sp, arg_offset, arg.reg(), arg.kind());
+    } else if (arg.is_const()) {
+      if (arg.kind() == kI32) {
+        if (arg.i32_const() == 0) {
+          St_w(zero_reg, MemOperand(sp, arg_offset));
+        } else {
+          UseScratchRegisterScope temps(this);
+          Register src = temps.Acquire();
+          li(src, arg.i32_const());
+          St_w(src, MemOperand(sp, arg_offset));
+        }
+      } else {
+        if (arg.i32_const() == 0) {
+          St_d(zero_reg, MemOperand(sp, arg_offset));
+        } else {
+          UseScratchRegisterScope temps(this);
+          Register src = temps.Acquire();
+          li(src, static_cast<int64_t>(arg.i32_const()));
+          St_d(src, MemOperand(sp, arg_offset));
+        }
+      }
+    } else if (value_kind_size(arg.kind()) == 4) {
+      // Stack to stack move.
+      UseScratchRegisterScope temps(this);
+      Register src = temps.Acquire();
+      Ld_w(src, liftoff::GetStackSlot(arg.offset()));
+      St_w(src, MemOperand(sp, arg_offset));
+    } else {
+      DCHECK_EQ(8, value_kind_size(arg.kind()));
+      // Stack to stack move.
+      UseScratchRegisterScope temps(this);
+      Register src = temps.Acquire();
+      Ld_d(src, liftoff::GetStackSlot(arg.offset()));
+      St_d(src, MemOperand(sp, arg_offset));
+    }
+    arg_offset += value_kind_size(arg.kind());
   }
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   // On LoongArch, the first argument is passed in {a0}.
@@ -3136,12 +3178,23 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* next_result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = a0;
+#ifdef USE_SIMULATOR
+    // When call to a host function in simulator, if the function return an
+    // int32 value, the simulator does not sign-extend it to int64 because
+    // in simulator we do not know whether the function returns an int32 or
+    // int64. so we need to sign extend it here.
+    if (return_kind == kI32) {
+      slli_w(next_result_reg->gp(), kReturnReg, 0);
+    } else if (kReturnReg != next_result_reg->gp()) {
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
+    }
+#else
     if (kReturnReg != next_result_reg->gp()) {
-      Move(*next_result_reg, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
     }
+#endif
     ++next_result_reg;
   }
 
diff --git a/deps/v8/src/wasm/baseline/mips64/liftoff-assembler-mips64.h b/deps/v8/src/wasm/baseline/mips64/liftoff-assembler-mips64.h
index 96cba24c9d6385..41990c4b6541fe 100644
--- a/deps/v8/src/wasm/baseline/mips64/liftoff-assembler-mips64.h
+++ b/deps/v8/src/wasm/baseline/mips64/liftoff-assembler-mips64.h
@@ -8,6 +8,7 @@
 #include "src/codegen/machine-type.h"
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
+#include "src/wasm/object-access.h"
 #include "src/wasm/wasm-objects.h"
 
 namespace v8 {
@@ -426,6 +427,32 @@ bool LiftoffAssembler::NeedsAlignment(ValueKind kind) {
   return kind == kS128 || is_reference(kind);
 }
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  Register budget_array = kScratchReg;
+
+  Register instance = cache_state_.cached_instance;
+  if (instance == no_reg) {
+    instance = budget_array;  // Reuse the scratch register.
+    LoadInstanceFromFrame(instance);
+  }
+
+  constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+      WasmInstanceObject::kTieringBudgetArrayOffset);
+  Ld(budget_array, MemOperand(instance, kArrayOffset));
+
+  int budget_arr_offset = kInt32Size * declared_func_index;
+
+  Register budget = kScratchReg2;
+  MemOperand budget_addr(budget_array, budget_arr_offset);
+  Lw(budget, budget_addr);
+  Subu(budget, budget, budget_used);
+  Sw(budget, budget_addr);
+
+  Branch(ool_label, less, budget, Operand(zero_reg));
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -474,6 +501,21 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   Ld(dst, MemOperand(instance, offset));
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, ExternalPointerTag tag,
+                                           Register scratch) {
+  LoadFullPointer(dst, src_addr, offset);
+}
+
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register scratch) {
+  MemOperand src_op = liftoff::GetMemOp(this, src_addr, index, offset, false,
+                                        kSystemPointerSizeLog2);
+  Ld(dst, src_op);
+}
+
 void LiftoffAssembler::SpillInstance(Register instance) {
   Sd(instance, liftoff::GetInstanceOperand());
 }
@@ -1144,12 +1186,11 @@ void LiftoffAssembler::emit_i32_divs(Register dst, Register lhs, Register rhs,
   MacroAssembler::Branch(trap_div_by_zero, eq, rhs, Operand(zero_reg));
 
   // Check if lhs == kMinInt and rhs == -1, since this case is unrepresentable.
-  MacroAssembler::li(kScratchReg, 1);
-  MacroAssembler::li(kScratchReg2, 1);
-  MacroAssembler::LoadZeroOnCondition(kScratchReg, lhs, Operand(kMinInt), eq);
-  MacroAssembler::LoadZeroOnCondition(kScratchReg2, rhs, Operand(-1), eq);
-  daddu(kScratchReg, kScratchReg, kScratchReg2);
-  MacroAssembler::Branch(trap_div_unrepresentable, eq, kScratchReg,
+  rotr(kScratchReg, lhs, 31);
+  sltiu(kScratchReg2, kScratchReg, 2);
+  movn(kScratchReg2, kScratchReg, kScratchReg2);
+  addu(kScratchReg2, kScratchReg2, rhs);
+  MacroAssembler::Branch(trap_div_unrepresentable, eq, kScratchReg2,
                          Operand(zero_reg));
 
   MacroAssembler::Div(dst, lhs, rhs);
@@ -1254,13 +1295,11 @@ bool LiftoffAssembler::emit_i64_divs(LiftoffRegister dst, LiftoffRegister lhs,
   MacroAssembler::Branch(trap_div_by_zero, eq, rhs.gp(), Operand(zero_reg));
 
   // Check if lhs == MinInt64 and rhs == -1, since this case is unrepresentable.
-  MacroAssembler::li(kScratchReg, 1);
-  MacroAssembler::li(kScratchReg2, 1);
-  MacroAssembler::LoadZeroOnCondition(
-      kScratchReg, lhs.gp(), Operand(std::numeric_limits<int64_t>::min()), eq);
-  MacroAssembler::LoadZeroOnCondition(kScratchReg2, rhs.gp(), Operand(-1), eq);
-  daddu(kScratchReg, kScratchReg, kScratchReg2);
-  MacroAssembler::Branch(trap_div_unrepresentable, eq, kScratchReg,
+  drotr32(kScratchReg, lhs.gp(), 31);
+  sltiu(kScratchReg2, kScratchReg, 2);
+  movn(kScratchReg2, kScratchReg, kScratchReg2);
+  daddu(kScratchReg2, kScratchReg2, rhs.gp());
+  MacroAssembler::Branch(trap_div_unrepresentable, eq, kScratchReg2,
                          Operand(zero_reg));
 
   MacroAssembler::Ddiv(dst.gp(), lhs.gp(), rhs.gp());
@@ -1853,32 +1892,13 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
   MacroAssembler::Branch(label, cond, lhs, Operand(imm));
 }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  MacroAssembler::Dsubu(value, value, Operand(subtrahend));
-  MacroAssembler::Branch(result_negative, less, value, Operand(zero_reg));
-}
-
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
   sltiu(dst, src, 1);
 }
 
 void LiftoffAssembler::emit_i32_set_cond(Condition cond, Register dst,
                                          Register lhs, Register rhs) {
-  Register tmp = dst;
-  if (dst == lhs || dst == rhs) {
-    tmp = GetUnusedRegister(kGpReg, LiftoffRegList{lhs, rhs}).gp();
-  }
-  // Write 1 as result.
-  MacroAssembler::li(tmp, 1);
-
-  // If negative condition is true, write 0 as result.
-  Condition neg_cond = NegateCondition(cond);
-  MacroAssembler::LoadZeroOnCondition(tmp, lhs, Operand(rhs), neg_cond);
-
-  // If tmp != dst, result will be moved.
-  MacroAssembler::Move(dst, tmp);
+  CompareWord(cond, dst, lhs, Operand(rhs));
 }
 
 void LiftoffAssembler::emit_i64_eqz(Register dst, LiftoffRegister src) {
@@ -1888,20 +1908,7 @@ void LiftoffAssembler::emit_i64_eqz(Register dst, LiftoffRegister src) {
 void LiftoffAssembler::emit_i64_set_cond(Condition cond, Register dst,
                                          LiftoffRegister lhs,
                                          LiftoffRegister rhs) {
-  Register tmp = dst;
-  if (dst == lhs.gp() || dst == rhs.gp()) {
-    tmp = GetUnusedRegister(kGpReg, LiftoffRegList{lhs, rhs}).gp();
-  }
-  // Write 1 as result.
-  MacroAssembler::li(tmp, 1);
-
-  // If negative condition is true, write 0 as result.
-  Condition neg_cond = NegateCondition(cond);
-  MacroAssembler::LoadZeroOnCondition(tmp, lhs.gp(), Operand(rhs.gp()),
-                                      neg_cond);
-
-  // If tmp != dst, result will be moved.
-  MacroAssembler::Move(dst, tmp);
+  CompareWord(cond, dst, lhs.gp(), Operand(rhs.gp()));
 }
 
 namespace liftoff {
@@ -3559,11 +3566,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   MacroAssembler::Branch(ool_code, ule, sp, Operand(limit_address));
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  PrepareCallCFunction(0, GetUnusedRegister(kGpReg, {}).gp());
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   if (v8_flags.debug_code) Abort(reason);
 }
@@ -3630,13 +3632,15 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetFirstRegSet();
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetFirstRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -3650,19 +3654,52 @@ void LiftoffAssembler::DropStackSlotsAndRet(uint32_t num_stack_slots) {
   MacroAssembler::DropAndRet(static_cast<int>(num_stack_slots));
 }
 
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   Daddu(sp, sp, -stack_bytes);
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    liftoff::Store(this, sp, arg_bytes, *args++, param_kind);
-    arg_bytes += value_kind_size(param_kind);
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    if (arg.is_reg()) {
+      liftoff::Store(this, sp, arg_offset, arg.reg(), arg.kind());
+    } else if (arg.is_const()) {
+      if (arg.kind() == kI32) {
+        if (arg.i32_const() == 0) {
+          Sw(zero_reg, MemOperand(sp, arg_offset));
+        } else {
+          UseScratchRegisterScope temps(this);
+          Register src = temps.Acquire();
+          li(src, arg.i32_const());
+          Sw(src, MemOperand(sp, arg_offset));
+        }
+      } else {
+        if (arg.i32_const() == 0) {
+          Usd(zero_reg, MemOperand(sp, arg_offset));
+        } else {
+          Register src = kScratchReg;
+          li(src, static_cast<int64_t>(arg.i32_const()));
+          Usd(src, MemOperand(sp, arg_offset));
+        }
+      }
+    } else if (value_kind_size(arg.kind()) == 4) {
+      // Stack to stack move.
+      UseScratchRegisterScope temps(this);
+      Register src = temps.Acquire();
+      Lw(src, liftoff::GetStackSlot(arg.offset()));
+      Sw(src, MemOperand(sp, arg_offset));
+    } else {
+      // Stack to stack move.
+      DCHECK_EQ(8, value_kind_size(arg.kind()));
+      UseScratchRegisterScope temps(this);
+      Register src = temps.Acquire();
+      Ld(src, liftoff::GetStackSlot(arg.offset()));
+      Sd(src, MemOperand(sp, arg_offset));
+    }
+    arg_offset += value_kind_size(arg.kind());
   }
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   // On mips, the first argument is passed in {a0}.
@@ -3676,12 +3713,23 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* next_result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = v0;
+#ifdef USE_SIMULATOR
+    // When call to a host function in simulator, if the function return an
+    // int32 value, the simulator does not sign-extend it to int64 because
+    // in simulator we do not know whether the function returns an int32 or
+    // int64. so we need to sign extend it here.
+    if (return_kind == kI32) {
+      sll(next_result_reg->gp(), kReturnReg, 0);
+    } else if (kReturnReg != next_result_reg->gp()) {
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
+    }
+#else
     if (kReturnReg != next_result_reg->gp()) {
-      Move(*next_result_reg, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
     }
+#endif
     ++next_result_reg;
   }
 
diff --git a/deps/v8/src/wasm/baseline/ppc/liftoff-assembler-ppc.h b/deps/v8/src/wasm/baseline/ppc/liftoff-assembler-ppc.h
index 808200fd4739fb..29fd0e22b60f28 100644
--- a/deps/v8/src/wasm/baseline/ppc/liftoff-assembler-ppc.h
+++ b/deps/v8/src/wasm/baseline/ppc/liftoff-assembler-ppc.h
@@ -9,6 +9,7 @@
 #include "src/codegen/assembler.h"
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
+#include "src/wasm/object-access.h"
 #include "src/wasm/simd-shuffle.h"
 #include "src/wasm/wasm-objects.h"
 
@@ -214,6 +215,35 @@ bool LiftoffAssembler::NeedsAlignment(ValueKind kind) {
   return (kind == kS128 || is_reference(kind));
 }
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  Register budget_array = ip;
+  Register instance = cache_state_.cached_instance;
+
+  if (instance == no_reg) {
+    instance = budget_array;  // Reuse the temp register.
+    LoadInstanceFromFrame(instance);
+  }
+
+  constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+      WasmInstanceObject::kTieringBudgetArrayOffset);
+  LoadU64(budget_array, MemOperand(instance, kArrayOffset), r0);
+
+  int budget_arr_offset = kInt32Size * declared_func_index;
+  // Pick a random register from kLiftoffAssemblerGpCacheRegs.
+  // TODO(miladfarca): Use ScratchRegisterScope when available.
+  Register budget = r15;
+  push(budget);
+  MemOperand budget_addr(budget_array, budget_arr_offset);
+  LoadS32(budget, budget_addr, r0);
+  mov(r0, Operand(budget_used));
+  sub(budget, budget, r0, LeaveOE, SetRC);
+  StoreU32(budget, budget_addr, r0);
+  pop(budget);
+  blt(ool_label, cr0);
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -269,6 +299,20 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   LoadTaggedField(dst, MemOperand(instance, offset), r0);
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, ExternalPointerTag tag,
+                                           Register /* scratch */) {
+  LoadFullPointer(dst, src_addr, offset);
+}
+
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register scratch) {
+  ShiftLeftU64(scratch, index, Operand(kSystemPointerSizeLog2));
+  LoadU64(dst, MemOperand(src_addr, scratch, offset), r0);
+}
+
 void LiftoffAssembler::SpillInstance(Register instance) {
   StoreU64(instance, liftoff::GetInstanceOperand(), r0);
 }
@@ -1674,13 +1718,6 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
   b(to_condition(cond), label);
 }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  SubS64(value, value, Operand(subtrahend), r0, LeaveOE, SetRC);
-  blt(result_negative, cr0);
-}
-
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
   Label done;
   CmpS32(src, Operand(0), r0);
@@ -1793,6 +1830,7 @@ bool LiftoffAssembler::emit_select(LiftoffRegister dst, Register condition,
   V(i32x4_eq, I32x4Eq)                               \
   V(i32x4_gt_s, I32x4GtS)                            \
   V(i32x4_gt_u, I32x4GtU)                            \
+  V(i32x4_dot_i16x8_s, I32x4DotI16x8S)               \
   V(i16x8_add, I16x8Add)                             \
   V(i16x8_sub, I16x8Sub)                             \
   V(i16x8_mul, I16x8Mul)                             \
@@ -1810,6 +1848,7 @@ bool LiftoffAssembler::emit_select(LiftoffRegister dst, Register condition,
   V(i16x8_sconvert_i32x4, I16x8SConvertI32x4)        \
   V(i16x8_uconvert_i32x4, I16x8UConvertI32x4)        \
   V(i16x8_rounding_average_u, I16x8RoundingAverageU) \
+  V(i16x8_q15mulr_sat_s, I16x8Q15MulRSatS)           \
   V(i8x16_add, I8x16Add)                             \
   V(i8x16_sub, I8x16Sub)                             \
   V(i8x16_min_s, I8x16MinS)                          \
@@ -1860,7 +1899,6 @@ SIMD_BINOP_LIST(EMIT_SIMD_BINOP)
   V(i32x4_extmul_low_i16x8_u, I32x4ExtMulLowI16x8U)   \
   V(i32x4_extmul_high_i16x8_s, I32x4ExtMulHighI16x8S) \
   V(i32x4_extmul_high_i16x8_u, I32x4ExtMulHighI16x8U) \
-  V(i32x4_dot_i16x8_s, I32x4DotI16x8S)                \
   V(i16x8_ne, I16x8Ne)                                \
   V(i16x8_ge_s, I16x8GeS)                             \
   V(i16x8_ge_u, I16x8GeU)                             \
@@ -1868,7 +1906,6 @@ SIMD_BINOP_LIST(EMIT_SIMD_BINOP)
   V(i16x8_extmul_low_i8x16_u, I16x8ExtMulLowI8x16U)   \
   V(i16x8_extmul_high_i8x16_s, I16x8ExtMulHighI8x16S) \
   V(i16x8_extmul_high_i8x16_u, I16x8ExtMulHighI8x16U) \
-  V(i16x8_q15mulr_sat_s, I16x8Q15MulRSatS)            \
   V(i16x8_dot_i8x16_i7x16_s, I16x8DotI8x16S)          \
   V(i8x16_ne, I8x16Ne)                                \
   V(i8x16_ge_s, I8x16GeS)                             \
@@ -2477,11 +2514,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   ble(ool_code);
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  PrepareCallCFunction(0, 0, ip);
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   if (v8_flags.debug_code) Abort(reason);
 }
@@ -2502,13 +2534,15 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetLastRegSet();
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetLastRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -2521,9 +2555,8 @@ void LiftoffAssembler::DropStackSlotsAndRet(uint32_t num_stack_slots) {
   Ret();
 }
 
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   int total_size = RoundUp(stack_bytes, kSystemPointerSize);
@@ -2540,32 +2573,50 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   SubS64(sp, sp, Operand(size), r0);
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    switch (param_kind) {
-      case kI32:
-        StoreU32(args->gp(), MemOperand(sp, arg_bytes), r0);
-        break;
-      case kI64:
-        StoreU64(args->gp(), MemOperand(sp, arg_bytes), r0);
-        break;
-      case kF32:
-        StoreF32(args->fp(), MemOperand(sp, arg_bytes), r0);
-        break;
-      case kF64:
-        StoreF64(args->fp(), MemOperand(sp, arg_bytes), r0);
-        break;
-      case kS128:
-        StoreSimd128(args->fp().toSimd(), MemOperand(sp, arg_bytes), r0);
-        break;
-      default:
-        UNREACHABLE();
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    MemOperand dst{sp, arg_offset};
+    if (arg.is_reg()) {
+      switch (arg.kind()) {
+        case kI32:
+          StoreU32(arg.reg().gp(), MemOperand(sp, arg_offset), r0);
+          break;
+        case kI64:
+          StoreU64(arg.reg().gp(), MemOperand(sp, arg_offset), r0);
+          break;
+        case kF32:
+          StoreF32(arg.reg().fp(), MemOperand(sp, arg_offset), r0);
+          break;
+        case kF64:
+          StoreF64(arg.reg().fp(), MemOperand(sp, arg_offset), r0);
+          break;
+        case kS128:
+          StoreSimd128(arg.reg().fp().toSimd(), MemOperand(sp, arg_offset), r0);
+          break;
+        default:
+          UNREACHABLE();
+      }
+    } else if (arg.is_const()) {
+      if (arg.kind() == kI32) {
+        mov(ip, Operand(arg.i32_const()));
+        StoreU32(ip, dst, r0);
+      } else {
+        mov(ip, Operand(static_cast<int64_t>(arg.i32_const())));
+        StoreU64(ip, dst, r0);
+      }
+    } else if (value_kind_size(arg.kind()) == 4) {
+      MemOperand src = liftoff::GetStackSlot(arg.offset());
+      LoadU32(ip, src, r0);
+      StoreU32(ip, dst, r0);
+    } else {
+      DCHECK_EQ(8, value_kind_size(arg.kind()));
+      MemOperand src = liftoff::GetStackSlot(arg.offset());
+      LoadU64(ip, src, r0);
+      StoreU64(ip, dst, r0);
     }
-    args++;
-    arg_bytes += value_kind_size(param_kind);
+    arg_offset += value_kind_size(arg.kind());
   }
-
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   mr(r3, sp);
@@ -2577,11 +2628,10 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = r3;
     if (kReturnReg != rets->gp()) {
-      Move(*rets, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*rets, LiftoffRegister(kReturnReg), return_kind);
     }
     result_reg++;
   }
@@ -2651,14 +2701,37 @@ void LiftoffAssembler::MaybeOSR() {}
 
 void LiftoffAssembler::emit_set_if_nan(Register dst, DoubleRegister src,
                                        ValueKind kind) {
-  UNIMPLEMENTED();
+  Label return_nan, done;
+  fcmpu(src, src);
+  bunordered(&return_nan);
+  b(&done);
+  bind(&return_nan);
+  StoreF32(src, MemOperand(dst), r0);
+  bind(&done);
 }
 
 void LiftoffAssembler::emit_s128_set_if_nan(Register dst, LiftoffRegister src,
                                             Register tmp_gp,
                                             LiftoffRegister tmp_s128,
                                             ValueKind lane_kind) {
-  UNIMPLEMENTED();
+  Label done;
+  if (lane_kind == kF32) {
+    xvcmpeqsp(tmp_s128.fp().toSimd(), src.fp().toSimd(), src.fp().toSimd(),
+              SetRC);
+  } else {
+    DCHECK_EQ(lane_kind, kF64);
+    xvcmpeqdp(tmp_s128.fp().toSimd(), src.fp().toSimd(), src.fp().toSimd(),
+              SetRC);
+  }
+  // CR_LT which is targeting cr6 bit 0, indicating if all lanes true (no lanes
+  // are NaN).
+  Condition all_lanes_true = lt;
+  b(all_lanes_true, &done, cr6);
+  // Do not use the src register as a Fp register to store a value.
+  // We use two different sets for Fp and Simd registers on PPC.
+  li(tmp_gp, Operand(1));
+  StoreU32(tmp_gp, MemOperand(dst), r0);
+  bind(&done);
 }
 
 void LiftoffStackSlots::Construct(int param_slots) {
diff --git a/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv.h b/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv.h
index 52a024cd72ca72..5f22f66f1f3aea 100644
--- a/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv.h
+++ b/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv.h
@@ -8,6 +8,7 @@
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
 #include "src/wasm/wasm-objects.h"
+#include "src/wasm/object-access.h"
 
 namespace v8 {
 namespace internal {
@@ -60,6 +61,33 @@ void LiftoffAssembler::PrepareTailCall(int num_callee_stack_params,
 
 void LiftoffAssembler::AlignFrameSize() {}
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  UseScratchRegisterScope temps(this);
+  Register budget_array = temps.Acquire();
+  Register instance = cache_state_.cached_instance;
+
+  if (instance == no_reg) {
+    instance = budget_array;  // Reuse the temp register.
+    LoadInstanceFromFrame(instance);
+  }
+
+  constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+      WasmInstanceObject::kTieringBudgetArrayOffset);
+  LoadWord(budget_array, MemOperand(instance, kArrayOffset));
+
+  int budget_arr_offset = kInt32Size * declared_func_index;
+  // Pick a random register from kLiftoffAssemblerGpCacheRegs.
+  // TODO(miladfarca): Use ScratchRegisterScope when available.
+  Register budget = kScratchReg;
+  MemOperand budget_addr(budget_array, budget_arr_offset);
+  Lw(budget, budget_addr);
+  Sub32(budget, budget, Operand{budget_used});
+  Sw(budget, budget_addr);
+  Branch(ool_label, lt, budget, Operand{0});
+}
+
 void LiftoffAssembler::PatchPrepareStackFrame(
     int offset, SafepointTableBuilder* safepoint_table_builder,
     bool feedback_vector_slot) {
@@ -200,6 +228,21 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   LoadTaggedField(dst, MemOperand{instance, offset});
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, ExternalPointerTag tag,
+                                           Register /* scratch */) {
+  LoadFullPointer(dst, src_addr, offset);
+}
+
+#ifdef V8_ENABLE_SANDBOX
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register instance,
+                                           int offset, ExternalPointerTag tag,
+                                           Register /* scratch */) {
+  LoadExternalPointerField(dst, FieldMemOperand(instance, offset), tag,
+                           kRootRegister);
+}
+#endif
+
 void LiftoffAssembler::SpillInstance(Register instance) {
   StoreWord(instance, liftoff::GetInstanceOperand());
 }
@@ -367,6 +410,35 @@ void LiftoffAssembler::emit_i8x16_popcnt(LiftoffRegister dst,
   bind(&done);
 }
 
+void LiftoffAssembler::emit_i8x16_shuffle(LiftoffRegister dst,
+                                          LiftoffRegister lhs,
+                                          LiftoffRegister rhs,
+                                          const uint8_t shuffle[16],
+                                          bool is_swizzle) {
+  VRegister dst_v = dst.fp().toV();
+  VRegister lhs_v = lhs.fp().toV();
+  VRegister rhs_v = rhs.fp().toV();
+
+  WasmRvvS128const(kSimd128ScratchReg2, shuffle);
+
+  VU.set(kScratchReg, E8, m1);
+  VRegister temp =
+      GetUnusedRegister(kFpReg, LiftoffRegList{lhs, rhs}).fp().toV();
+  if (dst_v == lhs_v) {
+    vmv_vv(temp, lhs_v);
+    lhs_v = temp;
+  } else if (dst_v == rhs_v) {
+    vmv_vv(temp, rhs_v);
+    rhs_v = temp;
+  }
+  vrgather_vv(dst_v, lhs_v, kSimd128ScratchReg2);
+  vadd_vi(kSimd128ScratchReg2, kSimd128ScratchReg2,
+          -16);  // The indices in range [16, 31] select the i - 16-th element
+                 // of rhs
+  vrgather_vv(kSimd128ScratchReg, rhs_v, kSimd128ScratchReg2);
+  vor_vv(dst_v, dst_v, kSimd128ScratchReg);
+}
+
 void LiftoffAssembler::emit_i8x16_swizzle(LiftoffRegister dst,
                                           LiftoffRegister lhs,
                                           LiftoffRegister rhs) {
@@ -410,12 +482,6 @@ void LiftoffAssembler::emit_i32x4_splat(LiftoffRegister dst,
   vmv_vx(dst.fp().toV(), src.gp());
 }
 
-void LiftoffAssembler::emit_i64x2_splat(LiftoffRegister dst,
-                                        LiftoffRegister src) {
-  VU.set(kScratchReg, E64, m1);
-  vmv_vx(dst.fp().toV(), src.gp());
-}
-
 void LiftoffAssembler::emit_i64x2_eq(LiftoffRegister dst, LiftoffRegister lhs,
                                      LiftoffRegister rhs) {
   WasmRvvEq(dst.fp().toV(), lhs.fp().toV(), rhs.fp().toV(), E64, m1);
@@ -439,8 +505,13 @@ void LiftoffAssembler::emit_i64x2_ge_s(LiftoffRegister dst, LiftoffRegister lhs,
 void LiftoffAssembler::emit_f32x4_splat(LiftoffRegister dst,
                                         LiftoffRegister src) {
   VU.set(kScratchReg, E32, m1);
-  fmv_x_w(kScratchReg, src.fp());
-  vmv_vx(dst.fp().toV(), kScratchReg);
+  vfmv_vf(dst.fp().toV(), src.fp());
+}
+
+void LiftoffAssembler::emit_f64x2_splat(LiftoffRegister dst,
+                                        LiftoffRegister src) {
+  VU.set(kScratchReg, E64, m1);
+  vfmv_vf(dst.fp().toV(), src.fp());
 }
 
 void LiftoffAssembler::emit_i64x2_extmul_low_i32x4_s(LiftoffRegister dst,
@@ -1107,14 +1178,13 @@ void LiftoffAssembler::emit_i16x8_neg(LiftoffRegister dst,
 void LiftoffAssembler::emit_i16x8_alltrue(LiftoffRegister dst,
                                           LiftoffRegister src) {
   VU.set(kScratchReg, E16, m1);
-  Label alltrue;
-  li(kScratchReg, -1);
-  vmv_sx(kSimd128ScratchReg, kScratchReg);
+  Label notalltrue;
+  vmv_vi(kSimd128ScratchReg, -1);
   vredminu_vs(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg);
   vmv_xs(dst.gp(), kSimd128ScratchReg);
-  beqz(dst.gp(), &alltrue);
+  beqz(dst.gp(), &notalltrue);
   li(dst.gp(), 1);
-  bind(&alltrue);
+  bind(&notalltrue);
 }
 
 void LiftoffAssembler::emit_i16x8_bitmask(LiftoffRegister dst,
@@ -1252,14 +1322,13 @@ void LiftoffAssembler::emit_i32x4_neg(LiftoffRegister dst,
 void LiftoffAssembler::emit_i32x4_alltrue(LiftoffRegister dst,
                                           LiftoffRegister src) {
   VU.set(kScratchReg, E32, m1);
-  Label alltrue;
-  li(kScratchReg, -1);
-  vmv_sx(kSimd128ScratchReg, kScratchReg);
+  Label notalltrue;
+  vmv_vi(kSimd128ScratchReg, -1);
   vredminu_vs(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg);
   vmv_xs(dst.gp(), kSimd128ScratchReg);
-  beqz(dst.gp(), &alltrue);
+  beqz(dst.gp(), &notalltrue);
   li(dst.gp(), 1);
-  bind(&alltrue);
+  bind(&notalltrue);
 }
 
 void LiftoffAssembler::emit_i32x4_bitmask(LiftoffRegister dst,
@@ -1459,14 +1528,13 @@ void LiftoffAssembler::emit_i64x2_neg(LiftoffRegister dst,
 void LiftoffAssembler::emit_i64x2_alltrue(LiftoffRegister dst,
                                           LiftoffRegister src) {
   VU.set(kScratchReg, E64, m1);
-  Label alltrue;
-  li(kScratchReg, -1);
-  vmv_sx(kSimd128ScratchReg, kScratchReg);
+  Label notalltrue;
+  vmv_vi(kSimd128ScratchReg, -1);
   vredminu_vs(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg);
   vmv_xs(dst.gp(), kSimd128ScratchReg);
-  beqz(dst.gp(), &alltrue);
+  beqz(dst.gp(), &notalltrue);
   li(dst.gp(), 1);
-  bind(&alltrue);
+  bind(&notalltrue);
 }
 
 void LiftoffAssembler::emit_i64x2_shl(LiftoffRegister dst, LiftoffRegister lhs,
@@ -1971,40 +2039,40 @@ void LiftoffAssembler::emit_i32x4_abs(LiftoffRegister dst,
   vneg_vv(dst.fp().toV(), src.fp().toV(), MaskType::Mask);
 }
 
-void LiftoffAssembler::emit_i8x16_extract_lane_s(LiftoffRegister dst,
+void LiftoffAssembler::emit_i8x16_extract_lane_u(LiftoffRegister dst,
                                                  LiftoffRegister lhs,
                                                  uint8_t imm_lane_idx) {
   VU.set(kScratchReg, E8, m1);
   vslidedown_vi(kSimd128ScratchReg, lhs.fp().toV(), imm_lane_idx);
   vmv_xs(dst.gp(), kSimd128ScratchReg);
+  slli(dst.gp(), dst.gp(), sizeof(void*) * 8 - 8);
+  srli(dst.gp(), dst.gp(), sizeof(void*) * 8 - 8);
 }
 
-void LiftoffAssembler::emit_i8x16_extract_lane_u(LiftoffRegister dst,
+void LiftoffAssembler::emit_i8x16_extract_lane_s(LiftoffRegister dst,
                                                  LiftoffRegister lhs,
                                                  uint8_t imm_lane_idx) {
   VU.set(kScratchReg, E8, m1);
   vslidedown_vi(kSimd128ScratchReg, lhs.fp().toV(), imm_lane_idx);
   vmv_xs(dst.gp(), kSimd128ScratchReg);
-  slli(dst.gp(), dst.gp(), 64 - 8);
-  srli(dst.gp(), dst.gp(), 64 - 8);
 }
 
-void LiftoffAssembler::emit_i16x8_extract_lane_s(LiftoffRegister dst,
+void LiftoffAssembler::emit_i16x8_extract_lane_u(LiftoffRegister dst,
                                                  LiftoffRegister lhs,
                                                  uint8_t imm_lane_idx) {
   VU.set(kScratchReg, E16, m1);
   vslidedown_vi(kSimd128ScratchReg, lhs.fp().toV(), imm_lane_idx);
   vmv_xs(dst.gp(), kSimd128ScratchReg);
+  slli(dst.gp(), dst.gp(), sizeof(void*) * 8 - 16);
+  srli(dst.gp(), dst.gp(), sizeof(void*) * 8 - 16);
 }
 
-void LiftoffAssembler::emit_i16x8_extract_lane_u(LiftoffRegister dst,
+void LiftoffAssembler::emit_i16x8_extract_lane_s(LiftoffRegister dst,
                                                  LiftoffRegister lhs,
                                                  uint8_t imm_lane_idx) {
   VU.set(kScratchReg, E16, m1);
   vslidedown_vi(kSimd128ScratchReg, lhs.fp().toV(), imm_lane_idx);
   vmv_xs(dst.gp(), kSimd128ScratchReg);
-  slli(dst.gp(), dst.gp(), 64 - 16);
-  srli(dst.gp(), dst.gp(), 64 - 16);
 }
 
 void LiftoffAssembler::emit_i32x4_extract_lane(LiftoffRegister dst,
@@ -2015,14 +2083,6 @@ void LiftoffAssembler::emit_i32x4_extract_lane(LiftoffRegister dst,
   vmv_xs(dst.gp(), kSimd128ScratchReg);
 }
 
-void LiftoffAssembler::emit_i64x2_extract_lane(LiftoffRegister dst,
-                                               LiftoffRegister lhs,
-                                               uint8_t imm_lane_idx) {
-  VU.set(kScratchReg, E64, m1);
-  vslidedown_vi(kSimd128ScratchReg, lhs.fp().toV(), imm_lane_idx);
-  vmv_xs(dst.gp(), kSimd128ScratchReg);
-}
-
 void LiftoffAssembler::emit_f32x4_extract_lane(LiftoffRegister dst,
                                                LiftoffRegister lhs,
                                                uint8_t imm_lane_idx) {
@@ -2070,25 +2130,25 @@ void LiftoffAssembler::emit_i32x4_replace_lane(LiftoffRegister dst,
   vmerge_vx(dst.fp().toV(), src2.gp(), src1.fp().toV());
 }
 
-void LiftoffAssembler::emit_i64x2_replace_lane(LiftoffRegister dst,
+void LiftoffAssembler::emit_f32x4_replace_lane(LiftoffRegister dst,
                                                LiftoffRegister src1,
                                                LiftoffRegister src2,
                                                uint8_t imm_lane_idx) {
-  VU.set(kScratchReg, E64, m1);
+  VU.set(kScratchReg, E32, m1);
   li(kScratchReg, 0x1 << imm_lane_idx);
   vmv_sx(v0, kScratchReg);
-  vmerge_vx(dst.fp().toV(), src2.gp(), src1.fp().toV());
+  fmv_x_w(kScratchReg, src2.fp());
+  vmerge_vx(dst.fp().toV(), kScratchReg, src1.fp().toV());
 }
 
-void LiftoffAssembler::emit_f32x4_replace_lane(LiftoffRegister dst,
+void LiftoffAssembler::emit_f64x2_replace_lane(LiftoffRegister dst,
                                                LiftoffRegister src1,
                                                LiftoffRegister src2,
                                                uint8_t imm_lane_idx) {
-  VU.set(kScratchReg, E32, m1);
+  VU.set(kScratchReg, E64, m1);
   li(kScratchReg, 0x1 << imm_lane_idx);
   vmv_sx(v0, kScratchReg);
-  fmv_x_w(kScratchReg, src2.fp());
-  vmerge_vx(dst.fp().toV(), kScratchReg, src1.fp().toV());
+  vfmerge_vf(dst.fp().toV(), src2.fp(), src1.fp().toV());
 }
 
 void LiftoffAssembler::emit_s128_set_if_nan(Register dst, LiftoffRegister src,
@@ -2149,11 +2209,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   MacroAssembler::Branch(ool_code, ule, sp, Operand(limit_address));
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  PrepareCallCFunction(0, GetUnusedRegister(kGpReg, {}).gp());
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   if (v8_flags.debug_code) Abort(reason);
 }
@@ -2211,13 +2266,15 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetFirstRegSet();
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetFirstRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -2286,7 +2343,7 @@ void LiftoffAssembler::emit_set_if_nan(Register dst, FPURegister src,
     feq_d(scratch, src, src);  // rd <- !isNan(src)
   }
   not_(scratch, scratch);
-  StoreWord(scratch, MemOperand(dst));
+  Sw(scratch, MemOperand(dst));
 }
 
 void LiftoffAssembler::CallFrameSetupStub(int declared_function_index) {
diff --git a/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv32.h b/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv32.h
index 00fd61cc2259f8..60d62d47d0ab60 100644
--- a/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv32.h
+++ b/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv32.h
@@ -59,26 +59,30 @@ inline MemOperand GetHalfStackSlot(int offset, RegPairHalf half) {
 
 inline MemOperand GetMemOp(LiftoffAssembler* assm, Register addr,
                            Register offset, uintptr_t offset_imm,
-                           Register scratch, unsigned shift_amount = 0) {
-  DCHECK_NE(scratch, kScratchReg2);
+                           unsigned shift_amount = 0) {
   DCHECK_NE(addr, kScratchReg2);
   DCHECK_NE(offset, kScratchReg2);
-  if (offset != no_reg) {
+  if (is_uint31(offset_imm)) {
+    int32_t offset_imm32 = static_cast<int32_t>(offset_imm);
+    if (offset == no_reg) return MemOperand(addr, offset_imm32);
     if (shift_amount != 0) {
-      assm->CalcScaledAddress(scratch, addr, offset, shift_amount);
+      assm->CalcScaledAddress(kScratchReg2, addr, offset, shift_amount);
     } else {
-      assm->AddWord(scratch, offset, addr);
+      assm->AddWord(kScratchReg2, offset, addr);
     }
-    addr = scratch;
+    return MemOperand(kScratchReg2, offset_imm32);
   }
-  if (is_int31(offset_imm)) {
-    int32_t offset_imm32 = static_cast<int32_t>(offset_imm);
-    return MemOperand(addr, offset_imm32);
-  } else {
-    assm->li(kScratchReg2, Operand(offset_imm));
-    assm->AddWord(kScratchReg2, addr, kScratchReg2);
-    return MemOperand(kScratchReg2, 0);
+  // Offset immediate does not fit in 31 bits.
+  assm->li(kScratchReg2, offset_imm);
+  assm->AddWord(kScratchReg2, kScratchReg2, addr);
+  if (offset != no_reg) {
+    if (shift_amount != 0) {
+      assm->CalcScaledAddress(kScratchReg2, kScratchReg2, offset, shift_amount);
+    } else {
+      assm->AddWord(kScratchReg2, kScratchReg2, offset);
+    }
   }
+  return MemOperand(kScratchReg2, 0);
 }
 
 inline void Load(LiftoffAssembler* assm, LiftoffRegister dst, Register base,
@@ -199,6 +203,15 @@ void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   }
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register scratch) {
+  MemOperand src_op =
+      liftoff::GetMemOp(this, src_addr, index, offset, kSystemPointerSizeLog2);
+  LoadWord(dst, src_op);
+}
+
 void LiftoffAssembler::LoadTaggedPointer(Register dst, Register src_addr,
                                          Register offset_reg,
                                          int32_t offset_imm, bool needs_shift) {
@@ -221,8 +234,7 @@ void LiftoffAssembler::StoreTaggedPointer(Register dst_addr,
                                           LiftoffRegList pinned,
                                           SkipWriteBarrier skip_write_barrier) {
   Register scratch = pinned.set(GetUnusedRegister(kGpReg, pinned)).gp();
-  MemOperand dst_op =
-      liftoff::GetMemOp(this, dst_addr, offset_reg, offset_imm, scratch);
+  MemOperand dst_op = liftoff::GetMemOp(this, dst_addr, offset_reg, offset_imm);
   StoreTaggedField(src.gp(), dst_op);
 
   if (skip_write_barrier || v8_flags.disable_write_barriers) return;
@@ -245,8 +257,8 @@ void LiftoffAssembler::Load(LiftoffRegister dst, Register src_addr,
                             bool /* is_load_mem */, bool /* i64_offset */,
                             bool needs_shift) {
   unsigned shift_amount = needs_shift ? type.size_log_2() : 0;
-  MemOperand src_op = liftoff::GetMemOp(this, src_addr, offset_reg, offset_imm,
-                                        kScratchReg, shift_amount);
+  MemOperand src_op =
+      liftoff::GetMemOp(this, src_addr, offset_reg, offset_imm, shift_amount);
 
   if (protected_load_pc) *protected_load_pc = pc_offset();
   switch (type.value()) {
@@ -292,7 +304,7 @@ void LiftoffAssembler::Load(LiftoffRegister dst, Register src_addr,
     case LoadType::kI64Load: {
       Lw(dst.low_gp(), src_op);
       src_op = liftoff::GetMemOp(this, src_addr, offset_reg,
-                                 offset_imm + kSystemPointerSize, kScratchReg);
+                                 offset_imm + kSystemPointerSize);
       Lw(dst.high_gp(), src_op);
     } break;
     case LoadType::kF32Load:
@@ -327,10 +339,7 @@ void LiftoffAssembler::Store(Register dst_addr, Register offset_reg,
                              StoreType type, LiftoffRegList pinned,
                              uint32_t* protected_store_pc, bool is_store_mem,
                              bool i64_offset) {
-  UseScratchRegisterScope temps(this);
-  Register scratch = temps.Acquire();
-  MemOperand dst_op =
-      liftoff::GetMemOp(this, dst_addr, offset_reg, offset_imm, scratch);
+  MemOperand dst_op = liftoff::GetMemOp(this, dst_addr, offset_reg, offset_imm);
 
 #if defined(V8_TARGET_BIG_ENDIAN)
   if (is_store_mem) {
@@ -369,7 +378,7 @@ void LiftoffAssembler::Store(Register dst_addr, Register offset_reg,
     case StoreType::kI64Store: {
       MacroAssembler::Sw(src.low_gp(), dst_op);
       dst_op = liftoff::GetMemOp(this, dst_addr, offset_reg,
-                                 offset_imm + kSystemPointerSize, scratch);
+                                 offset_imm + kSystemPointerSize);
       MacroAssembler::Sw(src.high_gp(), dst_op);
       break;
     }
@@ -410,6 +419,52 @@ inline Register CalculateActualAddress(LiftoffAssembler* lasm,
 }
 
 enum class Binop { kAdd, kSub, kAnd, kOr, kXor, kExchange };
+inline void AtomicBinop64(LiftoffAssembler* lasm, Register dst_addr,
+                          Register offset_reg, uintptr_t offset_imm,
+                          LiftoffRegister value, LiftoffRegister result,
+                          StoreType type, Binop op) {
+  FrameScope scope(lasm, StackFrame::MANUAL);
+  RegList c_params = {arg_reg_1, arg_reg_2, arg_reg_3};
+  RegList result_list = {result.low_gp(), result.high_gp()};
+
+  // Result registers does not need to be pushed.
+  __ MultiPush(c_params - result_list);
+  liftoff::CalculateActualAddress(lasm, dst_addr, offset_reg, offset_imm,
+                                  arg_reg_1);
+  __ Mv(arg_reg_2, value.low_gp());
+  __ Mv(arg_reg_3, value.high_gp());
+  __ MultiPush(kJSCallerSaved - c_params - result_list);
+  __ PrepareCallCFunction(3, 0, kScratchReg);
+  ExternalReference extern_func_ref;
+  switch (op) {
+    case Binop::kAdd:
+      extern_func_ref = ExternalReference::atomic_pair_add_function();
+      break;
+    case Binop::kSub:
+      extern_func_ref = ExternalReference::atomic_pair_sub_function();
+      break;
+    case Binop::kAnd:
+      extern_func_ref = ExternalReference::atomic_pair_and_function();
+      break;
+    case Binop::kOr:
+      extern_func_ref = ExternalReference::atomic_pair_or_function();
+      break;
+    case Binop::kXor:
+      extern_func_ref = ExternalReference::atomic_pair_xor_function();
+      break;
+    case Binop::kExchange:
+      extern_func_ref = ExternalReference::atomic_pair_exchange_function();
+      break;
+    default:
+      UNREACHABLE();
+  }
+  __ CallCFunction(extern_func_ref, 3, 0);
+  __ MultiPop(kJSCallerSaved - c_params - result_list);
+  __ Mv(result.low_gp(), kReturnRegister0);
+  __ Mv(result.high_gp(), kReturnRegister1);
+  __ MultiPop(c_params - result_list);
+  return;
+}
 
 inline void AtomicBinop(LiftoffAssembler* lasm, Register dst_addr,
                         Register offset_reg, uintptr_t offset_imm,
@@ -425,14 +480,12 @@ inline void AtomicBinop(LiftoffAssembler* lasm, Register dst_addr,
   switch (type.value()) {
     case StoreType::kI64Store8:
     case StoreType::kI64Store16:
-    case StoreType::kI64Store32:
       __ LoadConstant(result.high(), WasmValue(0));
       result_reg = result.low_gp();
       value_reg = value.low_gp();
       break;
     case StoreType::kI32Store8:
     case StoreType::kI32Store16:
-    case StoreType::kI32Store:
       result_reg = result.gp();
       value_reg = value.gp();
       break;
@@ -646,7 +699,9 @@ void LiftoffAssembler::AtomicAdd(Register dst_addr, Register offset_reg,
                                  LiftoffRegister result, StoreType type,
                                  bool i64_offset) {
   if (type.value() == StoreType::kI64Store) {
-    bailout(kAtomics, "Atomic64");
+    liftoff::AtomicBinop64(this, dst_addr, offset_reg, offset_imm, value,
+                           result, type, liftoff::Binop::kAdd);
+    return;
   }
   if (type.value() == StoreType::kI32Store ||
       type.value() == StoreType::kI64Store32) {
@@ -654,6 +709,7 @@ void LiftoffAssembler::AtomicAdd(Register dst_addr, Register offset_reg,
     Register actual_addr = liftoff::CalculateActualAddress(
         this, dst_addr, offset_reg, offset_imm, temps.Acquire());
     if (type.value() == StoreType::kI64Store32) {
+      mv(result.high_gp(), zero_reg);  // High word of result is always 0.
       result = result.low();
       value = value.low();
     }
@@ -670,7 +726,9 @@ void LiftoffAssembler::AtomicSub(Register dst_addr, Register offset_reg,
                                  LiftoffRegister result, StoreType type,
                                  bool i64_offset) {
   if (type.value() == StoreType::kI64Store) {
-    bailout(kAtomics, "Atomic64");
+    liftoff::AtomicBinop64(this, dst_addr, offset_reg, offset_imm, value,
+                           result, type, liftoff::Binop::kSub);
+    return;
   }
   if (type.value() == StoreType::kI32Store ||
       type.value() == StoreType::kI64Store32) {
@@ -678,6 +736,7 @@ void LiftoffAssembler::AtomicSub(Register dst_addr, Register offset_reg,
     Register actual_addr = liftoff::CalculateActualAddress(
         this, dst_addr, offset_reg, offset_imm, temps.Acquire());
     if (type.value() == StoreType::kI64Store32) {
+      mv(result.high_gp(), zero_reg);
       result = result.low();
       value = value.low();
     }
@@ -694,7 +753,9 @@ void LiftoffAssembler::AtomicAnd(Register dst_addr, Register offset_reg,
                                  LiftoffRegister result, StoreType type,
                                  bool i64_offset) {
   if (type.value() == StoreType::kI64Store) {
-    bailout(kAtomics, "Atomic64");
+    liftoff::AtomicBinop64(this, dst_addr, offset_reg, offset_imm, value,
+                           result, type, liftoff::Binop::kAnd);
+    return;
   }
   if (type.value() == StoreType::kI32Store ||
       type.value() == StoreType::kI64Store32) {
@@ -702,6 +763,7 @@ void LiftoffAssembler::AtomicAnd(Register dst_addr, Register offset_reg,
     Register actual_addr = liftoff::CalculateActualAddress(
         this, dst_addr, offset_reg, offset_imm, temps.Acquire());
     if (type.value() == StoreType::kI64Store32) {
+      mv(result.high_gp(), zero_reg);
       result = result.low();
       value = value.low();
     }
@@ -717,7 +779,9 @@ void LiftoffAssembler::AtomicOr(Register dst_addr, Register offset_reg,
                                 LiftoffRegister result, StoreType type,
                                 bool i64_offset) {
   if (type.value() == StoreType::kI64Store) {
-    bailout(kAtomics, "Atomic64");
+    liftoff::AtomicBinop64(this, dst_addr, offset_reg, offset_imm, value,
+                           result, type, liftoff::Binop::kOr);
+    return;
   }
   if (type.value() == StoreType::kI32Store ||
       type.value() == StoreType::kI64Store32) {
@@ -725,6 +789,7 @@ void LiftoffAssembler::AtomicOr(Register dst_addr, Register offset_reg,
     Register actual_addr = liftoff::CalculateActualAddress(
         this, dst_addr, offset_reg, offset_imm, temps.Acquire());
     if (type.value() == StoreType::kI64Store32) {
+      mv(result.high_gp(), zero_reg);
       result = result.low();
       value = value.low();
     }
@@ -740,7 +805,9 @@ void LiftoffAssembler::AtomicXor(Register dst_addr, Register offset_reg,
                                  LiftoffRegister result, StoreType type,
                                  bool i64_offset) {
   if (type.value() == StoreType::kI64Store) {
-    bailout(kAtomics, "Atomic64");
+    liftoff::AtomicBinop64(this, dst_addr, offset_reg, offset_imm, value,
+                           result, type, liftoff::Binop::kXor);
+    return;
   }
   if (type.value() == StoreType::kI32Store ||
       type.value() == StoreType::kI64Store32) {
@@ -748,6 +815,7 @@ void LiftoffAssembler::AtomicXor(Register dst_addr, Register offset_reg,
     Register actual_addr = liftoff::CalculateActualAddress(
         this, dst_addr, offset_reg, offset_imm, temps.Acquire());
     if (type.value() == StoreType::kI64Store32) {
+      mv(result.high_gp(), zero_reg);
       result = result.low();
       value = value.low();
     }
@@ -764,7 +832,9 @@ void LiftoffAssembler::AtomicExchange(Register dst_addr, Register offset_reg,
                                       LiftoffRegister result, StoreType type,
                                       bool i64_offset) {
   if (type.value() == StoreType::kI64Store) {
-    bailout(kAtomics, "Atomic64");
+    liftoff::AtomicBinop64(this, dst_addr, offset_reg, offset_imm, value,
+                           result, type, liftoff::Binop::kExchange);
+    return;
   }
   if (type.value() == StoreType::kI32Store ||
       type.value() == StoreType::kI64Store32) {
@@ -772,6 +842,7 @@ void LiftoffAssembler::AtomicExchange(Register dst_addr, Register offset_reg,
     Register actual_addr = liftoff::CalculateActualAddress(
         this, dst_addr, offset_reg, offset_imm, temps.Acquire());
     if (type.value() == StoreType::kI64Store32) {
+      mv(result.high_gp(), zero_reg);
       result = result.low();
       value = value.low();
     }
@@ -792,18 +863,30 @@ void LiftoffAssembler::AtomicCompareExchange(
   if (type.value() == StoreType::kI64Store) {
     Register actual_addr = liftoff::CalculateActualAddress(
         this, dst_addr, offset_reg, offset_imm, kScratchReg);
-    Mv(a0, actual_addr);
     FrameScope scope(this, StackFrame::MANUAL);
-    PushCallerSaved(SaveFPRegsMode::kIgnore, a0, a1);
+    // NOTE:
+    // a0~a4 are caller-saved registers and also used
+    // to pass parameters for C functions.
+    RegList c_params = {arg_reg_1, arg_reg_2, arg_reg_3, arg_reg_4, a4};
+    RegList result_list = {result.low_gp(), result.high_gp()};
+    MultiPush(c_params - result_list);
+
+    Mv(a0, actual_addr);
+    Mv(a1, expected.low_gp());
+    Mv(a2, expected.high_gp());
+    Mv(a3, new_value.low_gp());
+    Mv(a4, new_value.high_gp());
+
+    MultiPush(kJSCallerSaved - c_params - result_list);
     PrepareCallCFunction(5, 0, kScratchReg);
     CallCFunction(ExternalReference::atomic_pair_compare_exchange_function(), 5,
                   0);
-    PopCallerSaved(SaveFPRegsMode::kIgnore, a0, a1);
-    Mv(result.low_gp(), a0);
-    Mv(result.high_gp(), a1);
+    MultiPop(kJSCallerSaved - c_params - result_list);
+    Mv(result.low_gp(), kReturnRegister0);
+    Mv(result.high_gp(), kReturnRegister1);
+    MultiPop(c_params - result_list);
     return;
   }
-
   // Make sure that {result} is unique.
   switch (type.value()) {
     case StoreType::kI64Store8:
@@ -953,7 +1036,8 @@ void LiftoffAssembler::Move(DoubleRegister dst, DoubleRegister src,
   if (kind != kS128) {
     MacroAssembler::Move(dst, src);
   } else {
-    MacroAssembler::vmv_vv(dst.toV(), dst.toV());
+    VU.set(kScratchReg, E8, m1);
+    MacroAssembler::vmv_vv(dst.toV(), src.toV());
   }
 }
 
@@ -1250,6 +1334,8 @@ void LiftoffAssembler::emit_i64_mul(LiftoffRegister dst, LiftoffRegister lhs,
                           kScratchReg, kScratchReg2);
 }
 
+// Implemented by the host function in external-reference.h(Call to host
+// function wasm::xxx).
 bool LiftoffAssembler::emit_i64_divs(LiftoffRegister dst, LiftoffRegister lhs,
                                      LiftoffRegister rhs,
                                      Label* trap_div_by_zero,
@@ -1366,7 +1452,7 @@ void LiftoffAssembler::emit_i64_shli(LiftoffRegister dst, LiftoffRegister src,
   DCHECK_NE(dst.high_gp(), kScratchReg);
 
   MacroAssembler::ShlPair(dst.low_gp(), dst.high_gp(), src_low, src_high,
-                          amount, kScratchReg, kScratchReg2);
+                          amount & 63, kScratchReg, kScratchReg2);
 }
 
 void LiftoffAssembler::emit_i64_sar(LiftoffRegister dst, LiftoffRegister src,
@@ -1389,7 +1475,7 @@ void LiftoffAssembler::emit_i64_sari(LiftoffRegister dst, LiftoffRegister src,
   DCHECK_NE(dst.high_gp(), kScratchReg);
 
   MacroAssembler::SarPair(dst.low_gp(), dst.high_gp(), src_low, src_high,
-                          amount, kScratchReg, kScratchReg2);
+                          amount & 63, kScratchReg, kScratchReg2);
 }
 
 void LiftoffAssembler::emit_i64_shr(LiftoffRegister dst, LiftoffRegister src,
@@ -1412,7 +1498,7 @@ void LiftoffAssembler::emit_i64_shri(LiftoffRegister dst, LiftoffRegister src,
   DCHECK_NE(dst.high_gp(), kScratchReg);
 
   MacroAssembler::ShrPair(dst.low_gp(), dst.high_gp(), src_low, src_high,
-                          amount, kScratchReg, kScratchReg2);
+                          amount & 63, kScratchReg, kScratchReg2);
 }
 
 #define FP_UNOP_RETURN_FALSE(name)                                             \
@@ -1553,6 +1639,16 @@ bool LiftoffAssembler::emit_type_conversion(WasmOpcode opcode,
   }
 }
 
+void LiftoffAssembler::emit_i64x2_extract_lane(LiftoffRegister dst,
+                                               LiftoffRegister lhs,
+                                               uint8_t imm_lane_idx) {
+  VU.set(kScratchReg, E32, m1);
+  vslidedown_vi(kSimd128ScratchReg, lhs.fp().toV(), (imm_lane_idx << 0x1) + 1);
+  vmv_xs(dst.high_gp(), kSimd128ScratchReg);
+  vslidedown_vi(kSimd128ScratchReg, lhs.fp().toV(), imm_lane_idx << 0x1);
+  vmv_xs(dst.low_gp(), kSimd128ScratchReg);
+}
+
 void LiftoffAssembler::emit_i32_signextend_i8(Register dst, Register src) {
   slli(dst, src, 32 - 8);
   srai(dst, dst, 32 - 8);
@@ -1609,13 +1705,6 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
   MacroAssembler::Branch(label, cond, lhs, Operand(imm));
 }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  SubWord(value, value, Operand(subtrahend));
-  MacroAssembler::Branch(result_negative, lt, value, Operand(zero_reg));
-}
-
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
   MacroAssembler::Sltu(dst, src, 1);
 }
@@ -1711,41 +1800,42 @@ void LiftoffAssembler::LoadTransform(LiftoffRegister dst, Register src_addr,
                                      uint32_t* protected_load_pc) {
   UseScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
-  MemOperand src_op =
-      liftoff::GetMemOp(this, src_addr, offset_reg, offset_imm, scratch);
+  MemOperand src_op = liftoff::GetMemOp(this, src_addr, offset_reg, offset_imm);
   VRegister dst_v = dst.fp().toV();
   *protected_load_pc = pc_offset();
 
   MachineType memtype = type.mem_type();
   if (transform == LoadTransformationKind::kExtend) {
-    Lw(scratch, src_op);
+    // TODO(RISCV): need to confirm the performance impact of using floating
+    // point registers.
+    LoadDouble(kScratchDoubleReg, src_op);
     if (memtype == MachineType::Int8()) {
       VU.set(kScratchReg, E64, m1);
-      vmv_vx(kSimd128ScratchReg, scratch);
+      vfmv_vf(kSimd128ScratchReg, kScratchDoubleReg);
       VU.set(kScratchReg, E16, m1);
       vsext_vf2(dst_v, kSimd128ScratchReg);
     } else if (memtype == MachineType::Uint8()) {
       VU.set(kScratchReg, E64, m1);
-      vmv_vx(kSimd128ScratchReg, scratch);
+      vfmv_vf(kSimd128ScratchReg, kScratchDoubleReg);
       VU.set(kScratchReg, E16, m1);
       vzext_vf2(dst_v, kSimd128ScratchReg);
     } else if (memtype == MachineType::Int16()) {
       VU.set(kScratchReg, E64, m1);
-      vmv_vx(kSimd128ScratchReg, scratch);
+      vfmv_vf(kSimd128ScratchReg, kScratchDoubleReg);
       VU.set(kScratchReg, E32, m1);
       vsext_vf2(dst_v, kSimd128ScratchReg);
     } else if (memtype == MachineType::Uint16()) {
       VU.set(kScratchReg, E64, m1);
-      vmv_vx(kSimd128ScratchReg, scratch);
+      vfmv_vf(kSimd128ScratchReg, kScratchDoubleReg);
       VU.set(kScratchReg, E32, m1);
       vzext_vf2(dst_v, kSimd128ScratchReg);
     } else if (memtype == MachineType::Int32()) {
       VU.set(kScratchReg, E64, m1);
-      vmv_vx(kSimd128ScratchReg, scratch);
+      vfmv_vf(kSimd128ScratchReg, kScratchDoubleReg);
       vsext_vf2(dst_v, kSimd128ScratchReg);
     } else if (memtype == MachineType::Uint32()) {
       VU.set(kScratchReg, E64, m1);
-      vmv_vx(kSimd128ScratchReg, scratch);
+      vfmv_vf(kSimd128ScratchReg, kScratchDoubleReg);
       vzext_vf2(dst_v, kSimd128ScratchReg);
     }
   } else if (transform == LoadTransformationKind::kZeroExtend) {
@@ -1755,11 +1845,10 @@ void LiftoffAssembler::LoadTransform(LiftoffRegister dst, Register src_addr,
       Lw(scratch, src_op);
       vmv_sx(dst_v, scratch);
     } else {
-      // TODO(RISCV): need review
       DCHECK_EQ(MachineType::Int64(), memtype);
       VU.set(kScratchReg, E64, m1);
-      Lw(scratch, src_op);
-      vmv_sx(dst_v, scratch);
+      LoadDouble(kScratchDoubleReg, src_op);
+      vfmv_sf(dst_v, kScratchDoubleReg);
     }
   } else {
     DCHECK_EQ(LoadTransformationKind::kSplat, transform);
@@ -1776,10 +1865,9 @@ void LiftoffAssembler::LoadTransform(LiftoffRegister dst, Register src_addr,
       Lw(scratch, src_op);
       vmv_vx(dst_v, scratch);
     } else if (memtype == MachineType::Int64()) {
-      // TODO(RISCV): need review
       VU.set(kScratchReg, E64, m1);
-      Lw(scratch, src_op);
-      vmv_vx(dst_v, scratch);
+      LoadDouble(kScratchDoubleReg, src_op);
+      vfmv_vf(dst_v, kScratchDoubleReg);
     }
   }
 }
@@ -1791,13 +1879,12 @@ void LiftoffAssembler::LoadLane(LiftoffRegister dst, LiftoffRegister src,
                                 bool /* i64_offfset */) {
   UseScratchRegisterScope temps(this);
   Register scratch = temps.Acquire();
-  MemOperand src_op =
-      liftoff::GetMemOp(this, addr, offset_reg, offset_imm, scratch);
+  MemOperand src_op = liftoff::GetMemOp(this, addr, offset_reg, offset_imm);
   MachineType mem_type = type.mem_type();
   *protected_load_pc = pc_offset();
   if (mem_type == MachineType::Int8()) {
     Lbu(scratch, src_op);
-    VU.set(kScratchReg, E64, m1);
+    VU.set(kScratchReg, E32, m1);
     li(kScratchReg, 0x1 << laneidx);
     vmv_sx(v0, kScratchReg);
     VU.set(kScratchReg, E8, m1);
@@ -1815,11 +1902,11 @@ void LiftoffAssembler::LoadLane(LiftoffRegister dst, LiftoffRegister src,
     vmv_sx(v0, kScratchReg);
     vmerge_vx(dst.fp().toV(), scratch, dst.fp().toV());
   } else if (mem_type == MachineType::Int64()) {
-    Lw(scratch, src_op);
-    VU.set(kScratchReg, E32, m1);
+    LoadDouble(kScratchDoubleReg, src_op);
+    VU.set(kScratchReg, E64, m1);
     li(kScratchReg, 0x1 << laneidx);
     vmv_sx(v0, kScratchReg);
-    vmerge_vx(dst.fp().toV(), scratch, dst.fp().toV());
+    vfmerge_vf(dst.fp().toV(), kScratchDoubleReg, dst.fp().toV());
   } else {
     UNREACHABLE();
   }
@@ -1830,9 +1917,7 @@ void LiftoffAssembler::StoreLane(Register dst, Register offset,
                                  StoreType type, uint8_t lane,
                                  uint32_t* protected_store_pc,
                                  bool /* i64_offfset */) {
-  UseScratchRegisterScope temps(this);
-  Register scratch = temps.Acquire();
-  MemOperand dst_op = liftoff::GetMemOp(this, dst, offset, offset_imm, scratch);
+  MemOperand dst_op = liftoff::GetMemOp(this, dst, offset, offset_imm);
   if (protected_store_pc) *protected_store_pc = pc_offset();
   MachineRepresentation rep = type.mem_rep();
   if (rep == MachineRepresentation::kWord8) {
@@ -1854,170 +1939,175 @@ void LiftoffAssembler::StoreLane(Register dst, Register offset,
     DCHECK_EQ(MachineRepresentation::kWord64, rep);
     VU.set(kScratchReg, E64, m1);
     vslidedown_vi(kSimd128ScratchReg, src.fp().toV(), lane);
-    vmv_xs(kScratchReg, kSimd128ScratchReg);
-    Sw(kScratchReg, dst_op);
+    vfmv_fs(kScratchDoubleReg, kSimd128ScratchReg);
+    StoreDouble(kScratchDoubleReg, dst_op);
   }
 }
 
-void LiftoffAssembler::emit_i8x16_shuffle(LiftoffRegister dst,
-                                          LiftoffRegister lhs,
-                                          LiftoffRegister rhs,
-                                          const uint8_t shuffle[16],
-                                          bool is_swizzle) {
-  // VRegister dst_v = dst.fp().toV();
-  // VRegister lhs_v = lhs.fp().toV();
-  // VRegister rhs_v = rhs.fp().toV();
-
-  // uint64_t imm1 = *(reinterpret_cast<const uint64_t*>(shuffle));
-  // uint64_t imm2 = *((reinterpret_cast<const uint64_t*>(shuffle)) + 1);
-  // VU.set(kScratchReg, VSew::E64, Vlmul::m1);
-  // li(kScratchReg, imm2);
-  // vmv_sx(kSimd128ScratchReg2, kScratchReg);
-  // vslideup_vi(kSimd128ScratchReg, kSimd128ScratchReg2, 1);
-  // li(kScratchReg, imm1);
-  // vmv_sx(kSimd128ScratchReg, kScratchReg);
-
-  // VU.set(kScratchReg, E8, m1);
-  // VRegister temp =
-  //     GetUnusedRegister(kFpReg, LiftoffRegList{lhs, rhs}).fp().toV();
-  // if (dst_v == lhs_v) {
-  //   vmv_vv(temp, lhs_v);
-  //   lhs_v = temp;
-  // } else if (dst_v == rhs_v) {
-  //   vmv_vv(temp, rhs_v);
-  //   rhs_v = temp;
-  // }
-  // vrgather_vv(dst_v, lhs_v, kSimd128ScratchReg);
-  // vadd_vi(kSimd128ScratchReg, kSimd128ScratchReg,
-  //         -16);  // The indices in range [16, 31] select the i - 16-th
-  //         element
-  //                // of rhs
-  // vrgather_vv(kSimd128ScratchReg2, rhs_v, kSimd128ScratchReg);
-  // vor_vv(dst_v, dst_v, kSimd128ScratchReg2);
-  bailout(kSimd, "emit_i8x16_shuffle");
-}
-
-void LiftoffAssembler::emit_f64x2_splat(LiftoffRegister dst,
+void LiftoffAssembler::emit_i64x2_splat(LiftoffRegister dst,
                                         LiftoffRegister src) {
-  // VU.set(kScratchReg, E64, m1);
-  // fmv_x_d(kScratchReg, src.fp());
-  // vmv_vx(dst.fp().toV(), kScratchReg);
-  bailout(kSimd, "emit_f64x2_splat");
+  VU.set(kScratchReg, E32, m1);
+  vmv_vi(v0, 0b0101);
+  vmv_vx(kSimd128ScratchReg, src.high_gp());
+  vmerge_vx(dst.fp().toV(), src.low_gp(), kSimd128ScratchReg);
+}
+
+void LiftoffAssembler::emit_i64x2_replace_lane(LiftoffRegister dst,
+                                               LiftoffRegister src1,
+                                               LiftoffRegister src2,
+                                               uint8_t imm_lane_idx) {
+  VU.set(kScratchReg, E32, m1);
+  vmv_vx(kSimd128ScratchReg, src2.high_gp());
+  vmv_sx(kSimd128ScratchReg, src2.low_gp());
+  VU.set(kScratchReg, E64, m1);
+  li(kScratchReg, 0x1 << imm_lane_idx);
+  vmv_sx(v0, kScratchReg);
+  vfmv_fs(kScratchDoubleReg, kSimd128ScratchReg);
+  vfmerge_vf(dst.fp().toV(), kScratchDoubleReg, src1.fp().toV());
 }
 
 void LiftoffAssembler::emit_f64x2_min(LiftoffRegister dst, LiftoffRegister lhs,
                                       LiftoffRegister rhs) {
-  // VU.set(kScratchReg, E64, m1);
-  // const int64_t kNaN = 0x7ff8000000000000L;
-  // vmfeq_vv(v0, lhs.fp().toV(), lhs.fp().toV());
-  // vmfeq_vv(kSimd128ScratchReg, rhs.fp().toV(), rhs.fp().toV());
-  // vand_vv(v0, v0, kSimd128ScratchReg);
-  // li(kScratchReg, kNaN);
-  // vmv_vx(kSimd128ScratchReg, kScratchReg);
-  // vfmin_vv(kSimd128ScratchReg, rhs.fp().toV(), lhs.fp().toV(), Mask);
-  // vmv_vv(dst.fp().toV(), kSimd128ScratchReg);
-  bailout(kSimd, "emit_f64x2_min");
+  VU.set(kScratchReg, E64, m1);
+  const int32_t kNaN = 0x7ff80000L, kNaNShift = 32;
+  vmfeq_vv(v0, lhs.fp().toV(), lhs.fp().toV());
+  vmfeq_vv(kSimd128ScratchReg, rhs.fp().toV(), rhs.fp().toV());
+  vand_vv(v0, v0, kSimd128ScratchReg);
+  li(kScratchReg, kNaN);
+  li(kScratchReg2, kNaNShift);
+  vmv_vx(kSimd128ScratchReg, kScratchReg);
+  vsll_vx(kSimd128ScratchReg, kSimd128ScratchReg, kScratchReg2);
+  vfmin_vv(kSimd128ScratchReg, rhs.fp().toV(), lhs.fp().toV(), Mask);
+  vmv_vv(dst.fp().toV(), kSimd128ScratchReg);
 }
 
 void LiftoffAssembler::emit_f64x2_max(LiftoffRegister dst, LiftoffRegister lhs,
                                       LiftoffRegister rhs) {
-  // VU.set(kScratchReg, E64, m1);
-  // const int64_t kNaN = 0x7ff8000000000000L;
-  // vmfeq_vv(v0, lhs.fp().toV(), lhs.fp().toV());
-  // vmfeq_vv(kSimd128ScratchReg, rhs.fp().toV(), rhs.fp().toV());
-  // vand_vv(v0, v0, kSimd128ScratchReg);
-  // li(kScratchReg, kNaN);
-  // vmv_vx(kSimd128ScratchReg, kScratchReg);
-  // vfmax_vv(kSimd128ScratchReg, rhs.fp().toV(), lhs.fp().toV(), Mask);
-  // vmv_vv(dst.fp().toV(), kSimd128ScratchReg);
-  bailout(kSimd, "emit_f64x2_max");
+  VU.set(kScratchReg, E64, m1);
+  const int32_t kNaN = 0x7ff80000L, kNaNShift = 32;
+  vmfeq_vv(v0, lhs.fp().toV(), lhs.fp().toV());
+  vmfeq_vv(kSimd128ScratchReg, rhs.fp().toV(), rhs.fp().toV());
+  vand_vv(v0, v0, kSimd128ScratchReg);
+  li(kScratchReg, kNaN);
+  li(kScratchReg2, kNaNShift);
+  vmv_vx(kSimd128ScratchReg, kScratchReg);
+  vsll_vx(kSimd128ScratchReg, kSimd128ScratchReg, kScratchReg2);
+  vfmax_vv(kSimd128ScratchReg, rhs.fp().toV(), lhs.fp().toV(), Mask);
+  vmv_vv(dst.fp().toV(), kSimd128ScratchReg);
 }
 
 void LiftoffAssembler::emit_i32x4_extadd_pairwise_i16x8_s(LiftoffRegister dst,
                                                           LiftoffRegister src) {
-  // VU.set(kScratchReg, E64, m1);
+  VU.set(kScratchReg, E32, m1);
   // li(kScratchReg, 0x0006000400020000);
-  // vmv_sx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, 0x00060004);
+  vmv_vx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, 0x00020000);
+  vmv_sx(kSimd128ScratchReg, kScratchReg);
   // li(kScratchReg, 0x0007000500030001);
-  // vmv_sx(kSimd128ScratchReg3, kScratchReg);
-  // VU.set(kScratchReg, E16, m1);
-  // vrgather_vv(kSimd128ScratchReg2, src.fp().toV(), kSimd128ScratchReg);
-  // vrgather_vv(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg3);
-  // VU.set(kScratchReg, E16, mf2);
-  // vwadd_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
-  bailout(kSimd, "emit_i32x4_extadd_pairwise_i16x8_s");
+  li(kScratchReg, 0x00070005);
+  vmv_vx(kSimd128ScratchReg3, kScratchReg);
+  li(kScratchReg, 0x00030001);
+  vmv_sx(kSimd128ScratchReg3, kScratchReg);
+  VU.set(kScratchReg, E16, m1);
+  vrgather_vv(kSimd128ScratchReg2, src.fp().toV(), kSimd128ScratchReg);
+  vrgather_vv(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg3);
+  VU.set(kScratchReg, E16, mf2);
+  vwadd_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
 }
 
 void LiftoffAssembler::emit_i32x4_extadd_pairwise_i16x8_u(LiftoffRegister dst,
                                                           LiftoffRegister src) {
-  // VU.set(kScratchReg, E64, m1);
+  VU.set(kScratchReg, E32, m1);
   // li(kScratchReg, 0x0006000400020000);
-  // vmv_sx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, 0x00060004);
+  vmv_vx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, 0x00020000);
+  vmv_sx(kSimd128ScratchReg, kScratchReg);
   // li(kScratchReg, 0x0007000500030001);
-  // vmv_sx(kSimd128ScratchReg3, kScratchReg);
-  // VU.set(kScratchReg, E16, m1);
-  // vrgather_vv(kSimd128ScratchReg2, src.fp().toV(), kSimd128ScratchReg);
-  // vrgather_vv(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg3);
-  // VU.set(kScratchReg, E16, mf2);
-  // vwaddu_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
-  bailout(kSimd, "emit_i32x4_extadd_pairwise_i16x8_u");
+  li(kScratchReg, 0x00070005);
+  vmv_vx(kSimd128ScratchReg3, kScratchReg);
+  li(kScratchReg, 0x00030001);
+  vmv_sx(kSimd128ScratchReg3, kScratchReg);
+  VU.set(kScratchReg, E16, m1);
+  vrgather_vv(kSimd128ScratchReg2, src.fp().toV(), kSimd128ScratchReg);
+  vrgather_vv(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg3);
+  VU.set(kScratchReg, E16, mf2);
+  vwaddu_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
 }
 
 void LiftoffAssembler::emit_i16x8_extadd_pairwise_i8x16_s(LiftoffRegister dst,
                                                           LiftoffRegister src) {
-  // VU.set(kScratchReg, E64, m1);
+  VU.set(kScratchReg, E32, m1);
   // li(kScratchReg, 0x0E0C0A0806040200);
-  // vmv_sx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, 0x0E0C0A08);
+  vmv_vx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, 0x06040200);
+  vmv_sx(kSimd128ScratchReg, kScratchReg);
   // li(kScratchReg, 0x0F0D0B0907050301);
-  // vmv_sx(kSimd128ScratchReg3, kScratchReg);
-  // VU.set(kScratchReg, E8, m1);
-  // vrgather_vv(kSimd128ScratchReg2, src.fp().toV(), kSimd128ScratchReg);
-  // vrgather_vv(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg3);
-  // VU.set(kScratchReg, E8, mf2);
-  // vwadd_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
-  bailout(kSimd, "emit_i16x8_extadd_pairwise_i8x16_s");
+  li(kScratchReg, 0x0F0D0B09);
+  vmv_vx(kSimd128ScratchReg3, kScratchReg);
+  li(kScratchReg, 0x07050301);
+  vmv_sx(kSimd128ScratchReg3, kScratchReg);
+  VU.set(kScratchReg, E8, m1);
+  vrgather_vv(kSimd128ScratchReg2, src.fp().toV(), kSimd128ScratchReg);
+  vrgather_vv(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg3);
+  VU.set(kScratchReg, E8, mf2);
+  vwadd_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
 }
 
 void LiftoffAssembler::emit_i16x8_extadd_pairwise_i8x16_u(LiftoffRegister dst,
                                                           LiftoffRegister src) {
-  // VU.set(kScratchReg, E64, m1);
+  VU.set(kScratchReg, E32, m1);
   // li(kScratchReg, 0x0E0C0A0806040200);
-  // vmv_sx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, 0x0E0C0A08);
+  vmv_vx(kSimd128ScratchReg, kScratchReg);
+  li(kScratchReg, 0x06040200);
+  vmv_sx(kSimd128ScratchReg, kScratchReg);
   // li(kScratchReg, 0x0F0D0B0907050301);
-  // vmv_sx(kSimd128ScratchReg3, kScratchReg);
-  // VU.set(kScratchReg, E8, m1);
-  // vrgather_vv(kSimd128ScratchReg2, src.fp().toV(), kSimd128ScratchReg);
-  // vrgather_vv(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg3);
-  // VU.set(kScratchReg, E8, mf2);
-  // vwaddu_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
-  bailout(kSimd, "emit_i16x8_extadd_pairwise_i8x16_u");
-}
-
-void LiftoffAssembler::emit_f64x2_replace_lane(LiftoffRegister dst,
-                                               LiftoffRegister src1,
-                                               LiftoffRegister src2,
-                                               uint8_t imm_lane_idx) {
-  // VU.set(kScratchReg, E64, m1);
-  // li(kScratchReg, 0x1 << imm_lane_idx);
-  // vmv_sx(v0, kScratchReg);
-  // fmv_x_d(kScratchReg, src2.fp());
-  // vmerge_vx(dst.fp().toV(), kScratchReg, src1.fp().toV());
-  bailout(kSimd, "emit_f64x2_replace_lane");
-}
-
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+  li(kScratchReg, 0x0F0D0B09);
+  vmv_vx(kSimd128ScratchReg3, kScratchReg);
+  li(kScratchReg, 0x07050301);
+  vmv_sx(kSimd128ScratchReg3, kScratchReg);
+  VU.set(kScratchReg, E8, m1);
+  vrgather_vv(kSimd128ScratchReg2, src.fp().toV(), kSimd128ScratchReg);
+  vrgather_vv(kSimd128ScratchReg, src.fp().toV(), kSimd128ScratchReg3);
+  VU.set(kScratchReg, E8, mf2);
+  vwaddu_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
+}
+
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   AddWord(sp, sp, Operand(-stack_bytes));
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    liftoff::Store(this, sp, arg_bytes, *args++, param_kind);
-    arg_bytes += value_kind_size(param_kind);
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    UseScratchRegisterScope temps(this);
+    Register src = no_reg;
+    MemOperand dst{sp, arg_offset};
+    if (arg.is_reg()) {
+      liftoff::Store(this, sp, arg_offset, arg.reg(), arg.kind());
+    } else if (arg.is_const()) {
+      DCHECK_EQ(kI32, arg.kind());
+      if (arg.i32_const() == 0) {
+        src = zero_reg;
+      } else {
+        src = temps.Acquire();
+        li(src, arg.i32_const());
+      }
+      StoreWord(src, dst);
+    } else {
+      DCHECK_EQ(value_kind_size(arg.kind()), 4);
+      MemOperand src = liftoff::GetStackSlot(arg.offset());
+      auto scratch = temps.Acquire();
+      Lw(scratch, src);
+      Sw(scratch, dst);
+    }
+    arg_offset += value_kind_size(arg.kind());
   }
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   // On RISC-V, the first argument is passed in {a0}.
@@ -2031,11 +2121,10 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* next_result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = a0;
     if (kReturnReg != next_result_reg->gp()) {
-      Move(*next_result_reg, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
     }
     ++next_result_reg;
   }
@@ -2061,25 +2150,40 @@ void LiftoffStackSlots::Construct(int param_slots) {
     const LiftoffAssembler::VarState& src = slot.src_;
     switch (src.loc()) {
       case LiftoffAssembler::VarState::kStack: {
-        if (src.kind() == kF64) {
-          asm_->AllocateStackSpace(stack_decrement - kDoubleSize);
-          DCHECK_EQ(kLowWord, slot.half_);
-          asm_->Lw(kScratchReg,
-                   liftoff::GetHalfStackSlot(slot.src_offset_, kHighWord));
-          asm_->push(kScratchReg);
-          asm_->Lw(kScratchReg,
-                   liftoff::GetHalfStackSlot(slot.src_offset_, kLowWord));
-          asm_->push(kScratchReg);
-        } else if (src.kind() != kS128) {
-          asm_->AllocateStackSpace(stack_decrement - kSystemPointerSize);
-          asm_->Lw(kScratchReg, liftoff::GetStackSlot(slot.src_offset_));
-          asm_->push(kScratchReg);
-        } else {
-          asm_->AllocateStackSpace(stack_decrement - kSimd128Size);
-          asm_->Lw(kScratchReg, liftoff::GetStackSlot(slot.src_offset_ - 8));
-          asm_->push(kScratchReg);
-          asm_->Lw(kScratchReg, liftoff::GetStackSlot(slot.src_offset_));
-          asm_->push(kScratchReg);
+        switch (src.kind()) {
+          // i32 and i64 can be treated as similar cases, i64 being previously
+          // split into two i32 registers
+          case kI32:
+          case kI64:
+          case kF32:
+          case kRef:
+          case kRefNull: {
+            asm_->AllocateStackSpace(stack_decrement - kSystemPointerSize);
+            UseScratchRegisterScope temps(asm_);
+            Register scratch = temps.Acquire();
+            asm_->Lw(scratch,
+                     liftoff::GetHalfStackSlot(slot.src_offset_, slot.half_));
+            asm_->Push(scratch);
+          } break;
+          case kF64: {
+            asm_->AllocateStackSpace(stack_decrement - kDoubleSize);
+            DCHECK_EQ(kLowWord, slot.half_);
+            asm_->Lw(kScratchReg,
+                     liftoff::GetHalfStackSlot(slot.src_offset_, kHighWord));
+            asm_->push(kScratchReg);
+            asm_->Lw(kScratchReg,
+                     liftoff::GetHalfStackSlot(slot.src_offset_, kLowWord));
+            asm_->push(kScratchReg);
+          } break;
+          case kS128: {
+            asm_->AllocateStackSpace(stack_decrement - kSimd128Size);
+            asm_->Lw(kScratchReg, liftoff::GetStackSlot(slot.src_offset_ - 8));
+            asm_->push(kScratchReg);
+            asm_->Lw(kScratchReg, liftoff::GetStackSlot(slot.src_offset_));
+            asm_->push(kScratchReg);
+          } break;
+          default:
+            UNREACHABLE();
         }
         break;
       }
diff --git a/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv64.h b/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv64.h
index 1d6ae09e8ba0b9..d308a48c1e2e5e 100644
--- a/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv64.h
+++ b/deps/v8/src/wasm/baseline/riscv/liftoff-assembler-riscv64.h
@@ -149,6 +149,15 @@ inline void push(LiftoffAssembler* assm, LiftoffRegister reg, ValueKind kind) {
 
 }  // namespace liftoff
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register scratch) {
+  MemOperand src_op = liftoff::GetMemOp(this, src_addr, index, offset, false,
+                                        kSystemPointerSizeLog2);
+  LoadWord(dst, src_op);
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -173,11 +182,10 @@ void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
 void LiftoffAssembler::LoadTaggedPointer(Register dst, Register src_addr,
                                          Register offset_reg,
                                          int32_t offset_imm, bool needs_shift) {
-  static_assert(kTaggedSize == kInt64Size);
-  unsigned shift_amount = !needs_shift ? 0 : 3;
+  unsigned shift_amount = !needs_shift ? 0 : COMPRESS_POINTERS_BOOL ? 2 : 3;
   MemOperand src_op = liftoff::GetMemOp(this, src_addr, offset_reg, offset_imm,
                                         false, shift_amount);
-  Ld(dst, src_op);
+  LoadTaggedField(dst, src_op);
 }
 
 void LiftoffAssembler::LoadFullPointer(Register dst, Register src_addr,
@@ -387,6 +395,9 @@ inline void AtomicBinop(LiftoffAssembler* lasm, Register dst_addr,
       __ sync();
       break;
     case StoreType::kI64Store32:
+      __ lr_w(true, false, result_reg, actual_addr);
+      __ ZeroExtendWord(result_reg, result_reg);
+      break;
     case StoreType::kI32Store:
       __ lr_w(true, false, result_reg, actual_addr);
       break;
@@ -437,7 +448,7 @@ inline void AtomicBinop(LiftoffAssembler* lasm, Register dst_addr,
       __ sc_w(false, true, store_result, actual_addr, temp);
       break;
     case StoreType::kI64Store:
-      __ sc_w(false, true, store_result, actual_addr, temp);
+      __ sc_d(false, true, store_result, actual_addr, temp);
       break;
     default:
       UNREACHABLE();
@@ -471,10 +482,13 @@ void LiftoffAssembler::AtomicLoad(LiftoffRegister dst, Register src_addr,
       sync();
       return;
     case LoadType::kI32Load:
-    case LoadType::kI64Load32U:
       lw(dst.gp(), src_reg, 0);
       sync();
       return;
+    case LoadType::kI64Load32U:
+      lwu(dst.gp(), src_reg, 0);
+      sync();
+      return;
     case LoadType::kI64Load:
       ld(dst.gp(), src_reg, 0);
       sync();
@@ -1251,6 +1265,14 @@ bool LiftoffAssembler::emit_type_conversion(WasmOpcode opcode,
   }
 }
 
+void LiftoffAssembler::emit_i64x2_extract_lane(LiftoffRegister dst,
+                                               LiftoffRegister lhs,
+                                               uint8_t imm_lane_idx) {
+  VU.set(kScratchReg, E64, m1);
+  vslidedown_vi(kSimd128ScratchReg, lhs.fp().toV(), imm_lane_idx);
+  vmv_xs(dst.gp(), kSimd128ScratchReg);
+}
+
 void LiftoffAssembler::emit_i32_signextend_i8(Register dst, Register src) {
   slliw(dst, src, 32 - 8);
   sraiw(dst, dst, 32 - 8);
@@ -1292,35 +1314,45 @@ void LiftoffAssembler::emit_cond_jump(Condition cond, Label* label,
                                       Register rhs,
                                       const FreezeCacheState& frozen) {
   if (rhs == no_reg) {
-    DCHECK(kind == kI32 || kind == kI64);
-    MacroAssembler::Branch(label, cond, lhs, Operand(zero_reg));
+    if (kind == kI32) {
+      UseScratchRegisterScope temps(this);
+      Register scratch0 = temps.Acquire();
+      slliw(scratch0, lhs, 0);
+      MacroAssembler::Branch(label, cond, scratch0, Operand(zero_reg));
+    } else {
+      DCHECK(kind == kI64);
+      MacroAssembler::Branch(label, cond, lhs, Operand(zero_reg));
+    }
   } else {
-    DCHECK((kind == kI32 || kind == kI64) ||
-           (is_reference(kind) && (cond == kEqual || cond == kNotEqual)));
-    MacroAssembler::Branch(label, cond, lhs, Operand(rhs));
+    if (kind == kI64) {
+      MacroAssembler::Branch(label, cond, lhs, Operand(rhs));
+    } else {
+      DCHECK((kind == kI32) || (kind == kRtt) || (kind == kRef) ||
+             (kind == kRefNull));
+      MacroAssembler::CompareTaggedAndBranch(label, cond, lhs, Operand(rhs));
+    }
   }
 }
 
 void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
                                            Register lhs, int32_t imm,
                                            const FreezeCacheState& frozen) {
-  MacroAssembler::Branch(label, cond, lhs, Operand(imm));
-}
-
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  Sub64(value, value, Operand(subtrahend));
-  MacroAssembler::Branch(result_negative, lt, value, Operand(zero_reg));
+  MacroAssembler::CompareTaggedAndBranch(label, cond, lhs, Operand(imm));
 }
 
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
+  MacroAssembler::slliw(dst, src, 0);
   MacroAssembler::Sltu(dst, src, 1);
 }
 
 void LiftoffAssembler::emit_i32_set_cond(Condition cond, Register dst,
                                          Register lhs, Register rhs) {
-  MacroAssembler::CompareI(dst, lhs, Operand(rhs), cond);
+  UseScratchRegisterScope temps(this);
+  Register scratch0 = temps.Acquire();
+  Register scratch1 = kScratchReg;
+  MacroAssembler::slliw(scratch0, lhs, 0);
+  MacroAssembler::slliw(scratch1, rhs, 0);
+  MacroAssembler::CompareI(dst, scratch0, Operand(scratch1), cond);
 }
 
 void LiftoffAssembler::emit_i64_eqz(Register dst, LiftoffRegister src) {
@@ -1501,47 +1533,20 @@ void LiftoffAssembler::StoreLane(Register dst, Register offset,
   }
 }
 
-void LiftoffAssembler::emit_i8x16_shuffle(LiftoffRegister dst,
-                                          LiftoffRegister lhs,
-                                          LiftoffRegister rhs,
-                                          const uint8_t shuffle[16],
-                                          bool is_swizzle) {
-  VRegister dst_v = dst.fp().toV();
-  VRegister lhs_v = lhs.fp().toV();
-  VRegister rhs_v = rhs.fp().toV();
-
-  uint64_t imm1 = *(reinterpret_cast<const uint64_t*>(shuffle));
-  uint64_t imm2 = *((reinterpret_cast<const uint64_t*>(shuffle)) + 1);
-  VU.set(kScratchReg, VSew::E64, Vlmul::m1);
-  li(kScratchReg, imm2);
-  vmv_sx(kSimd128ScratchReg2, kScratchReg);
-  vslideup_vi(kSimd128ScratchReg, kSimd128ScratchReg2, 1);
-  li(kScratchReg, imm1);
-  vmv_sx(kSimd128ScratchReg, kScratchReg);
-
-  VU.set(kScratchReg, E8, m1);
-  VRegister temp =
-      GetUnusedRegister(kFpReg, LiftoffRegList{lhs, rhs}).fp().toV();
-  if (dst_v == lhs_v) {
-    vmv_vv(temp, lhs_v);
-    lhs_v = temp;
-  } else if (dst_v == rhs_v) {
-    vmv_vv(temp, rhs_v);
-    rhs_v = temp;
-  }
-  vrgather_vv(dst_v, lhs_v, kSimd128ScratchReg);
-  vadd_vi(kSimd128ScratchReg, kSimd128ScratchReg,
-          -16);  // The indices in range [16, 31] select the i - 16-th element
-                 // of rhs
-  vrgather_vv(kSimd128ScratchReg2, rhs_v, kSimd128ScratchReg);
-  vor_vv(dst_v, dst_v, kSimd128ScratchReg2);
+void LiftoffAssembler::emit_i64x2_splat(LiftoffRegister dst,
+                                        LiftoffRegister src) {
+  VU.set(kScratchReg, E64, m1);
+  vmv_vx(dst.fp().toV(), src.gp());
 }
 
-void LiftoffAssembler::emit_f64x2_splat(LiftoffRegister dst,
-                                        LiftoffRegister src) {
+void LiftoffAssembler::emit_i64x2_replace_lane(LiftoffRegister dst,
+                                               LiftoffRegister src1,
+                                               LiftoffRegister src2,
+                                               uint8_t imm_lane_idx) {
   VU.set(kScratchReg, E64, m1);
-  fmv_x_d(kScratchReg, src.fp());
-  vmv_vx(dst.fp().toV(), kScratchReg);
+  li(kScratchReg, 0x1 << imm_lane_idx);
+  vmv_sx(v0, kScratchReg);
+  vmerge_vx(dst.fp().toV(), src2.gp(), src1.fp().toV());
 }
 
 void LiftoffAssembler::emit_f64x2_min(LiftoffRegister dst, LiftoffRegister lhs,
@@ -1634,30 +1639,73 @@ void LiftoffAssembler::emit_i16x8_extadd_pairwise_i8x16_u(LiftoffRegister dst,
   vwaddu_vv(dst.fp().toV(), kSimd128ScratchReg, kSimd128ScratchReg2);
 }
 
-void LiftoffAssembler::emit_f64x2_replace_lane(LiftoffRegister dst,
-                                               LiftoffRegister src1,
-                                               LiftoffRegister src2,
-                                               uint8_t imm_lane_idx) {
-  VU.set(kScratchReg, E64, m1);
-  li(kScratchReg, 0x1 << imm_lane_idx);
-  vmv_sx(v0, kScratchReg);
-  fmv_x_d(kScratchReg, src2.fp());
-  vmerge_vx(dst.fp().toV(), kScratchReg, src1.fp().toV());
-}
-
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   AddWord(sp, sp, Operand(-stack_bytes));
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    liftoff::Store(this, sp, arg_bytes, *args++, param_kind);
-    arg_bytes += value_kind_size(param_kind);
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    UseScratchRegisterScope temps(this);
+    Register src = no_reg;
+    MemOperand dst{sp, arg_offset};
+    if (arg.is_reg()) {
+      switch (arg.kind()) {
+        case kI32:
+          Sw(arg.reg().gp(), dst);
+          break;
+        case kI64:
+          StoreWord(arg.reg().gp(), dst);
+          break;
+        case kF32:
+          StoreFloat(arg.reg().fp(), dst);
+          break;
+        case kF64:
+          StoreDouble(arg.reg().fp(), dst);
+          break;
+        case kS128: {
+          auto scratch = temps.Acquire();
+          AddWord(scratch, sp, Operand(arg_offset));
+          vs(arg.reg().fp().toV(), scratch, 0, VSew::E8);
+          break;
+        }
+        default:
+          UNREACHABLE();
+      }
+    } else if (arg.is_const()) {
+      if (arg.kind() == kI32) {
+        if (arg.i32_const() == 0) {
+          Sw(zero_reg, dst);
+        } else {
+          src = temps.Acquire();
+          li(src, arg.i32_const());
+          Sw(src, dst);
+        }
+      } else {
+        if (arg.i32_const() == 0) {
+          StoreWord(zero_reg, dst);
+        } else {
+          src = temps.Acquire();
+          li(src, static_cast<int64_t>(arg.i32_const()));
+          StoreWord(src, dst);
+        }
+      }
+    } else if (value_kind_size(arg.kind()) == 4) {
+      MemOperand src = liftoff::GetStackSlot(arg.offset());
+      auto scratch = temps.Acquire();
+      Lw(scratch, src);
+      Sw(scratch, dst);
+    } else {
+      DCHECK_EQ(8, value_kind_size(arg.kind()));
+      MemOperand src = liftoff::GetStackSlot(arg.offset());
+      auto scratch = temps.Acquire();
+      Ld(scratch, src);
+      Sd(scratch, dst);
+    }
+    arg_offset += value_kind_size(arg.kind());
   }
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   // On RISC-V, the first argument is passed in {a0}.
@@ -1671,11 +1719,10 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* next_result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = a0;
     if (kReturnReg != next_result_reg->gp()) {
-      Move(*next_result_reg, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
     }
     ++next_result_reg;
   }
diff --git a/deps/v8/src/wasm/baseline/s390/liftoff-assembler-s390.h b/deps/v8/src/wasm/baseline/s390/liftoff-assembler-s390.h
index c24f548570647b..a3d524957807d6 100644
--- a/deps/v8/src/wasm/baseline/s390/liftoff-assembler-s390.h
+++ b/deps/v8/src/wasm/baseline/s390/liftoff-assembler-s390.h
@@ -9,6 +9,7 @@
 #include "src/codegen/assembler.h"
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
+#include "src/wasm/object-access.h"
 #include "src/wasm/simd-shuffle.h"
 #include "src/wasm/wasm-objects.h"
 
@@ -195,6 +196,30 @@ bool LiftoffAssembler::NeedsAlignment(ValueKind kind) {
   return (kind == kS128 || is_reference(kind));
 }
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  Register budget_array = ip;
+  Register instance = cache_state_.cached_instance;
+
+  if (instance == no_reg) {
+    instance = budget_array;  // Reuse the temp register.
+    LoadInstanceFromFrame(instance);
+  }
+
+  constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+      WasmInstanceObject::kTieringBudgetArrayOffset);
+  LoadU64(budget_array, MemOperand(instance, kArrayOffset));
+
+  int budget_arr_offset = kInt32Size * declared_func_index;
+  Register budget = r1;
+  MemOperand budget_addr(budget_array, budget_arr_offset);
+  LoadS32(budget, budget_addr);
+  SubS32(budget, Operand(budget_used));
+  StoreU32(budget, budget_addr);
+  blt(ool_label);
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -249,6 +274,20 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   LoadTaggedField(dst, MemOperand(instance, offset));
 }
 
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, ExternalPointerTag tag,
+                                           Register /* scratch */) {
+  LoadFullPointer(dst, src_addr, offset);
+}
+
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register scratch) {
+  ShiftLeftU64(scratch, index, Operand(kSystemPointerSizeLog2));
+  LoadU64(dst, MemOperand(src_addr, scratch, offset));
+}
+
 void LiftoffAssembler::SpillInstance(Register instance) {
   StoreU64(instance, liftoff::GetInstanceOperand());
 }
@@ -2149,13 +2188,6 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
     bind(&done);            \
   }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  SubS64(value, value, Operand(subtrahend));
-  blt(result_negative);
-}
-
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
   EMIT_EQZ(ltr, src);
 }
@@ -2364,6 +2396,8 @@ SIMD_SHIFT_RI_LIST(EMIT_SIMD_SHIFT_RI)
   V(f64x2_floor, F64x2Floor, fp, fp, true, bool)                       \
   V(f64x2_trunc, F64x2Trunc, fp, fp, true, bool)                       \
   V(f64x2_nearest_int, F64x2NearestInt, fp, fp, true, bool)            \
+  V(f64x2_convert_low_i32x4_s, F64x2ConvertLowI32x4S, fp, fp, , void)  \
+  V(f64x2_convert_low_i32x4_u, F64x2ConvertLowI32x4U, fp, fp, , void)  \
   V(f32x4_abs, F32x4Abs, fp, fp, , void)                               \
   V(f32x4_splat, F32x4Splat, fp, fp, , void)                           \
   V(f32x4_neg, F32x4Neg, fp, fp, , void)                               \
@@ -2396,6 +2430,7 @@ SIMD_SHIFT_RI_LIST(EMIT_SIMD_SHIFT_RI)
   V(i8x16_abs, I8x16Abs, fp, fp, , void)                               \
   V(i8x16_neg, I8x16Neg, fp, fp, , void)                               \
   V(i8x16_splat, I8x16Splat, fp, gp, , void)                           \
+  V(i8x16_popcnt, I8x16Popcnt, fp, fp, , void)                         \
   V(s128_not, S128Not, fp, fp, , void)
 
 #define EMIT_SIMD_UNOP(name, op, dtype, stype, return_val, return_type) \
@@ -2720,19 +2755,7 @@ void LiftoffAssembler::emit_i8x16_swizzle(LiftoffRegister dst,
   Simd128Register src1 = lhs.fp();
   Simd128Register src2 = rhs.fp();
   Simd128Register dest = dst.fp();
-  Simd128Register temp =
-      GetUnusedRegister(kFpReg, LiftoffRegList{dest, src1, src2}).fp();
-  I8x16Swizzle(dest, src1, src2, r0, r1, kScratchDoubleReg, temp);
-}
-
-void LiftoffAssembler::emit_f64x2_convert_low_i32x4_s(LiftoffRegister dst,
-                                                      LiftoffRegister src) {
-  F64x2ConvertLowI32x4S(dst.fp(), src.fp());
-}
-
-void LiftoffAssembler::emit_f64x2_convert_low_i32x4_u(LiftoffRegister dst,
-                                                      LiftoffRegister src) {
-  F64x2ConvertLowI32x4U(dst.fp(), src.fp());
+  I8x16Swizzle(dest, src1, src2, r0, r1, kScratchDoubleReg);
 }
 
 void LiftoffAssembler::emit_f64x2_promote_low_f32x4(LiftoffRegister dst,
@@ -2819,11 +2842,6 @@ void LiftoffAssembler::emit_i8x16_shuffle(LiftoffRegister dst,
                kScratchDoubleReg);
 }
 
-void LiftoffAssembler::emit_i8x16_popcnt(LiftoffRegister dst,
-                                         LiftoffRegister src) {
-  I8x16Popcnt(dst.fp(), src.fp());
-}
-
 void LiftoffAssembler::emit_v128_anytrue(LiftoffRegister dst,
                                          LiftoffRegister src) {
   V128AnyTrue(dst.gp(), src.fp(), r0);
@@ -2924,11 +2942,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   b(le, ool_code);
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  PrepareCallCFunction(0, 0, no_reg);
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   // Asserts unreachable within the wasm code.
   MacroAssembler::AssertUnreachable(reason);
@@ -2947,13 +2960,15 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetLastRegSet();
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetLastRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -2966,9 +2981,8 @@ void LiftoffAssembler::DropStackSlotsAndRet(uint32_t num_stack_slots) {
   Ret();
 }
 
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   int total_size = RoundUp(stack_bytes, 8);
@@ -2985,32 +2999,50 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   lay(sp, MemOperand(sp, -size));
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    switch (param_kind) {
-      case kI32:
-        StoreU32(args->gp(), MemOperand(sp, arg_bytes));
-        break;
-      case kI64:
-        StoreU64(args->gp(), MemOperand(sp, arg_bytes));
-        break;
-      case kF32:
-        StoreF32(args->fp(), MemOperand(sp, arg_bytes));
-        break;
-      case kF64:
-        StoreF64(args->fp(), MemOperand(sp, arg_bytes));
-        break;
-      case kS128:
-        StoreV128(args->fp(), MemOperand(sp, arg_bytes), r0);
-        break;
-      default:
-        UNREACHABLE();
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    MemOperand dst{sp, arg_offset};
+    if (arg.is_reg()) {
+      switch (arg.kind()) {
+        case kI32:
+          StoreU32(arg.reg().gp(), MemOperand(sp, arg_offset));
+          break;
+        case kI64:
+          StoreU64(arg.reg().gp(), MemOperand(sp, arg_offset));
+          break;
+        case kF32:
+          StoreF32(arg.reg().fp(), MemOperand(sp, arg_offset));
+          break;
+        case kF64:
+          StoreF64(arg.reg().fp(), MemOperand(sp, arg_offset));
+          break;
+        case kS128:
+          StoreV128(arg.reg().fp(), MemOperand(sp, arg_offset), r0);
+          break;
+        default:
+          UNREACHABLE();
+      }
+    } else if (arg.is_const()) {
+      if (arg.kind() == kI32) {
+        mov(r0, Operand(arg.i32_const()));
+        StoreU32(r0, dst);
+      } else {
+        mov(r0, Operand(static_cast<int64_t>(arg.i32_const())));
+        StoreU64(r0, dst);
+      }
+    } else if (value_kind_size(arg.kind()) == 4) {
+      MemOperand src = liftoff::GetStackSlot(arg.offset());
+      LoadU32(r0, src);
+      StoreU32(r0, dst);
+    } else {
+      DCHECK_EQ(8, value_kind_size(arg.kind()));
+      MemOperand src = liftoff::GetStackSlot(arg.offset());
+      LoadU64(r0, src);
+      StoreU64(r0, dst);
     }
-    args++;
-    arg_bytes += value_kind_size(param_kind);
+    arg_offset += value_kind_size(arg.kind());
   }
-
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   mov(r2, sp);
@@ -3022,11 +3054,10 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = r2;
     if (kReturnReg != rets->gp()) {
-      Move(*rets, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*rets, LiftoffRegister(kReturnReg), return_kind);
     }
     result_reg++;
   }
@@ -3107,7 +3138,7 @@ void LiftoffAssembler::emit_set_if_nan(Register dst, DoubleRegister src,
   }
   b(&done);
   bind(&return_nan);
-  StoreF32LE(src, MemOperand(dst), r0);
+  StoreF32(src, MemOperand(dst));
   bind(&done);
 }
 
@@ -3128,7 +3159,8 @@ void LiftoffAssembler::emit_s128_set_if_nan(Register dst, LiftoffRegister src,
   }
   b(&done);
   bind(&return_nan);
-  StoreF32LE(src.fp(), MemOperand(dst), r0);
+  mov(r0, Operand(1));
+  StoreU32(r0, MemOperand(dst));
   bind(&done);
 }
 
diff --git a/deps/v8/src/wasm/baseline/x64/liftoff-assembler-x64.h b/deps/v8/src/wasm/baseline/x64/liftoff-assembler-x64.h
index d5106c0401f41f..46a756bbae2964 100644
--- a/deps/v8/src/wasm/baseline/x64/liftoff-assembler-x64.h
+++ b/deps/v8/src/wasm/baseline/x64/liftoff-assembler-x64.h
@@ -14,6 +14,7 @@
 #include "src/flags/flags.h"
 #include "src/heap/memory-chunk.h"
 #include "src/wasm/baseline/liftoff-assembler.h"
+#include "src/wasm/object-access.h"
 #include "src/wasm/simd-shuffle.h"
 #include "src/wasm/wasm-objects.h"
 
@@ -298,6 +299,25 @@ bool LiftoffAssembler::NeedsAlignment(ValueKind kind) {
   return is_reference(kind);
 }
 
+void LiftoffAssembler::CheckTierUp(int declared_func_index, int budget_used,
+                                   Label* ool_label,
+                                   const FreezeCacheState& frozen) {
+  Register instance = cache_state_.cached_instance;
+  if (instance == no_reg) {
+    instance = kScratchRegister;
+    LoadInstanceFromFrame(instance);
+  }
+
+  Register budget_array = kScratchRegister;  // Overwriting {instance}.
+  constexpr int kArrayOffset = wasm::ObjectAccess::ToTagged(
+      WasmInstanceObject::kTieringBudgetArrayOffset);
+  movq(budget_array, Operand{instance, kArrayOffset});
+
+  int offset = kInt32Size * declared_func_index;
+  subl(Operand{budget_array, offset}, Immediate(budget_used));
+  j(negative, ool_label);
+}
+
 void LiftoffAssembler::LoadConstant(LiftoffRegister reg, WasmValue value) {
   switch (value.type().kind()) {
     case kI32:
@@ -351,10 +371,20 @@ void LiftoffAssembler::LoadTaggedPointerFromInstance(Register dst,
   LoadTaggedField(dst, Operand(instance, offset));
 }
 
-void LiftoffAssembler::LoadExternalPointer(Register dst, Register instance,
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
                                            int offset, ExternalPointerTag tag,
                                            Register scratch) {
-  LoadExternalPointerField(dst, FieldOperand(instance, offset), tag, scratch,
+  LoadExternalPointerField(dst, Operand(src_addr, offset), tag, scratch,
+                           IsolateRootLocation::kInRootRegister);
+}
+
+void LiftoffAssembler::LoadExternalPointer(Register dst, Register src_addr,
+                                           int offset, Register index,
+                                           ExternalPointerTag tag,
+                                           Register scratch) {
+  MemOperand src_op = liftoff::GetMemOp(this, src_addr, index, offset,
+                                        times_external_pointer_size);
+  LoadExternalPointerField(dst, src_op, tag, scratch,
                            IsolateRootLocation::kInRootRegister);
 }
 
@@ -2189,13 +2219,6 @@ void LiftoffAssembler::emit_i32_cond_jumpi(Condition cond, Label* label,
   j(cond, label);
 }
 
-void LiftoffAssembler::emit_i32_subi_jump_negative(
-    Register value, int subtrahend, Label* result_negative,
-    const FreezeCacheState& frozen) {
-  subl(value, Immediate(subtrahend));
-  j(negative, result_negative);
-}
-
 void LiftoffAssembler::emit_i32_eqz(Register dst, Register src) {
   testl(src, src);
   setcc(equal, dst);
@@ -2363,12 +2386,12 @@ void EmitSimdShiftOp(LiftoffAssembler* assm, LiftoffRegister dst,
   }
 }
 
-template <void (Assembler::*avx_op)(XMMRegister, XMMRegister, byte),
-          void (Assembler::*sse_op)(XMMRegister, byte), uint8_t width>
+template <void (Assembler::*avx_op)(XMMRegister, XMMRegister, uint8_t),
+          void (Assembler::*sse_op)(XMMRegister, uint8_t), uint8_t width>
 void EmitSimdShiftOpImm(LiftoffAssembler* assm, LiftoffRegister dst,
                         LiftoffRegister operand, int32_t count) {
   constexpr int mask = (1 << width) - 1;
-  byte shift = static_cast<byte>(count & mask);
+  uint8_t shift = static_cast<uint8_t>(count & mask);
   if (CpuFeatures::IsSupported(AVX)) {
     CpuFeatureScope scope(assm, AVX);
     (assm->*avx_op)(dst.fp(), operand.fp(), shift);
@@ -3855,7 +3878,7 @@ void LiftoffAssembler::emit_f32x4_uconvert_i32x4(LiftoffRegister dst,
     psubd(dst.fp(), kScratchDoubleReg);
   }
   Cvtdq2ps(kScratchDoubleReg, kScratchDoubleReg);  // Convert lo exactly.
-  Psrld(dst.fp(), byte{1});            // Divide by 2 to get in unsigned range.
+  Psrld(dst.fp(), uint8_t{1});         // Divide by 2 to get in unsigned range.
   Cvtdq2ps(dst.fp(), dst.fp());        // Convert hi, exactly.
   Addps(dst.fp(), dst.fp());           // Double hi, exactly.
   Addps(dst.fp(), kScratchDoubleReg);  // Add hi and lo, may round.
@@ -4150,11 +4173,6 @@ void LiftoffAssembler::StackCheck(Label* ool_code, Register limit_address) {
   j(below_equal, ool_code);
 }
 
-void LiftoffAssembler::CallTrapCallbackForTesting() {
-  PrepareCallCFunction(0);
-  CallCFunction(ExternalReference::wasm_call_trap_callback_for_testing(), 0);
-}
-
 void LiftoffAssembler::AssertUnreachable(AbortReason reason) {
   MacroAssembler::AssertUnreachable(reason);
 }
@@ -4202,13 +4220,15 @@ void LiftoffAssembler::PopRegisters(LiftoffRegList regs) {
 void LiftoffAssembler::RecordSpillsInSafepoint(
     SafepointTableBuilder::Safepoint& safepoint, LiftoffRegList all_spills,
     LiftoffRegList ref_spills, int spill_offset) {
-  int spill_space_size = 0;
-  while (!all_spills.is_empty()) {
-    LiftoffRegister reg = all_spills.GetFirstRegSet();
+  LiftoffRegList fp_spills = all_spills & kFpCacheRegList;
+  int spill_space_size = fp_spills.GetNumRegsSet() * kSimd128Size;
+  LiftoffRegList gp_spills = all_spills & kGpCacheRegList;
+  while (!gp_spills.is_empty()) {
+    LiftoffRegister reg = gp_spills.GetFirstRegSet();
     if (ref_spills.has(reg)) {
       safepoint.DefineTaggedStackSlot(spill_offset);
     }
-    all_spills.clear(reg);
+    gp_spills.clear(reg);
     ++spill_offset;
     spill_space_size += kSystemPointerSize;
   }
@@ -4222,19 +4242,34 @@ void LiftoffAssembler::DropStackSlotsAndRet(uint32_t num_stack_slots) {
   ret(static_cast<int>(num_stack_slots * kSystemPointerSize));
 }
 
-void LiftoffAssembler::CallC(const ValueKindSig* sig,
-                             const LiftoffRegister* args,
-                             const LiftoffRegister* rets,
+void LiftoffAssembler::CallC(const std::initializer_list<VarState> args,
+                             const LiftoffRegister* rets, ValueKind return_kind,
                              ValueKind out_argument_kind, int stack_bytes,
                              ExternalReference ext_ref) {
   AllocateStackSpace(stack_bytes);
 
-  int arg_bytes = 0;
-  for (ValueKind param_kind : sig->parameters()) {
-    liftoff::StoreToStack(this, Operand(rsp, arg_bytes), *args++, param_kind);
-    arg_bytes += value_kind_size(param_kind);
+  int arg_offset = 0;
+  for (const VarState& arg : args) {
+    Operand dst{rsp, arg_offset};
+    if (arg.is_reg()) {
+      liftoff::StoreToStack(this, dst, arg.reg(), arg.kind());
+    } else if (arg.is_const()) {
+      if (arg.kind() == kI32) {
+        movl(dst, Immediate(arg.i32_const()));
+      } else {
+        MacroAssembler::Move(dst, static_cast<int64_t>(arg.i32_const()));
+      }
+    } else if (value_kind_size(arg.kind()) == 4) {
+      movl(kScratchRegister, liftoff::GetStackSlot(arg.offset()));
+      movl(dst, kScratchRegister);
+    } else {
+      DCHECK_EQ(8, value_kind_size(arg.kind()));
+      movq(kScratchRegister, liftoff::GetStackSlot(arg.offset()));
+      movq(dst, kScratchRegister);
+    }
+    arg_offset += value_kind_size(arg.kind());
   }
-  DCHECK_LE(arg_bytes, stack_bytes);
+  DCHECK_LE(arg_offset, stack_bytes);
 
   // Pass a pointer to the buffer with the arguments to the C function.
   movq(arg_reg_1, rsp);
@@ -4247,11 +4282,10 @@ void LiftoffAssembler::CallC(const ValueKindSig* sig,
 
   // Move return value to the right register.
   const LiftoffRegister* next_result_reg = rets;
-  if (sig->return_count() > 0) {
-    DCHECK_EQ(1, sig->return_count());
+  if (return_kind != kVoid) {
     constexpr Register kReturnReg = rax;
     if (kReturnReg != next_result_reg->gp()) {
-      Move(*next_result_reg, LiftoffRegister(kReturnReg), sig->GetReturn(0));
+      Move(*next_result_reg, LiftoffRegister(kReturnReg), return_kind);
     }
     ++next_result_reg;
   }
diff --git a/deps/v8/src/wasm/c-api.cc b/deps/v8/src/wasm/c-api.cc
index c930b588a6bd90..333708e85d0e45 100644
--- a/deps/v8/src/wasm/c-api.cc
+++ b/deps/v8/src/wasm/c-api.cc
@@ -35,6 +35,7 @@
 #include "src/objects/managed-inl.h"
 #include "src/wasm/leb-helper.h"
 #include "src/wasm/module-instantiate.h"
+#include "src/wasm/serialized-signature-inl.h"
 #include "src/wasm/wasm-arguments.h"
 #include "src/wasm/wasm-constants.h"
 #include "src/wasm/wasm-engine.h"
@@ -42,6 +43,9 @@
 #include "src/wasm/wasm-result.h"
 #include "src/wasm/wasm-serialization.h"
 #include "third_party/wasm-api/wasm.h"
+#ifdef ENABLE_VTUNE_JIT_INTERFACE
+#include "src/third_party/vtune/v8-vtune.h"
+#endif
 
 #ifdef WASM_API_DEBUG
 #error "WASM_API_DEBUG is unsupported"
@@ -116,7 +120,7 @@ i::wasm::ValueType WasmValKindToV8(ValKind kind) {
 }
 
 Name GetNameFromWireBytes(const i::wasm::WireBytesRef& ref,
-                          const v8::base::Vector<const uint8_t>& wire_bytes) {
+                          v8::base::Vector<const uint8_t> wire_bytes) {
   DCHECK_LE(ref.offset(), wire_bytes.length());
   DCHECK_LE(ref.end_offset(), wire_bytes.length());
   if (ref.length() == 0) return Name::make();
@@ -154,9 +158,9 @@ own<ExternType> GetImportExportType(const i::wasm::WasmModule* module,
       return TableType::make(std::move(elem), limits);
     }
     case i::wasm::kExternalMemory: {
-      DCHECK(module->has_memory);
-      Limits limits(module->initial_pages,
-                    module->has_maximum_pages ? module->maximum_pages : -1);
+      const i::wasm::WasmMemory& memory = module->memories[index];
+      Limits limits(memory.initial_pages,
+                    memory.has_maximum_pages ? memory.maximum_pages : -1);
       return MemoryType::make(limits);
     }
     case i::wasm::kExternalGlobal: {
@@ -412,7 +416,7 @@ void CheckAndHandleInterrupts(i::Isolate* isolate) {
 StoreImpl::~StoreImpl() {
 #ifdef DEBUG
   reinterpret_cast<i::Isolate*>(isolate_)->heap()->PreciseCollectAllGarbage(
-      i::Heap::kForcedGC, i::GarbageCollectionReason::kTesting,
+      i::GCFlag::kForced, i::GarbageCollectionReason::kTesting,
       v8::kNoGCCallbackFlags);
 #endif
   context()->Exit();
@@ -442,15 +446,15 @@ void StoreImpl::SetHostInfo(i::Handle<i::Object> object, void* info,
   size_t estimated_size = sizeof(ManagedData);
   i::Handle<i::Object> wrapper = i::Managed<ManagedData>::FromRawPtr(
       i_isolate(), estimated_size, new ManagedData(info, finalizer));
-  int32_t hash = object->GetOrCreateHash(i_isolate()).value();
+  int32_t hash = i::Object::GetOrCreateHash(*object, i_isolate()).value();
   i::JSWeakCollection::Set(host_info_map_, object, wrapper, hash);
 }
 
 void* StoreImpl::GetHostInfo(i::Handle<i::Object> key) {
-  i::Object raw =
-      i::EphemeronHashTable::cast(host_info_map_->table()).Lookup(key);
-  if (raw.IsTheHole(i_isolate())) return nullptr;
-  return i::Managed<ManagedData>::cast(raw).raw()->info;
+  i::Tagged<i::Object> raw =
+      i::EphemeronHashTable::cast(host_info_map_->table())->Lookup(key);
+  if (IsTheHole(raw, i_isolate())) return nullptr;
+  return i::Managed<ManagedData>::cast(raw)->raw()->info;
 }
 
 template <>
@@ -469,6 +473,9 @@ auto Store::make(Engine*) -> own<Store> {
   // Create isolate.
   store->create_params_.array_buffer_allocator =
       v8::ArrayBuffer::Allocator::NewDefaultAllocator();
+#ifdef ENABLE_VTUNE_JIT_INTERFACE
+  store->create_params_.code_event_handler = vTune::GetVtuneCodeEventHandler();
+#endif
 #if DUMP_COUNTERS
   store->create_params_.counter_lookup_callback = EngineImpl::LookupCounter;
   store->create_params_.create_histogram_callback = EngineImpl::CreateHistogram;
@@ -933,7 +940,8 @@ auto Ref::copy() const -> own<Ref> { return impl(this)->copy(); }
 
 auto Ref::same(const Ref* that) const -> bool {
   i::HandleScope handle_scope(impl(this)->isolate());
-  return impl(this)->v8_object()->SameValue(*impl(that)->v8_object());
+  return i::Object::SameValue(*impl(this)->v8_object(),
+                              *impl(that)->v8_object());
 }
 
 auto Ref::get_host_info() const -> void* { return impl(this)->get_host_info(); }
@@ -1287,9 +1295,9 @@ auto Extern::kind() const -> ExternKind {
   if (i::WasmExportedFunction::IsWasmExportedFunction(*obj)) {
     return wasm::EXTERN_FUNC;
   }
-  if (obj->IsWasmGlobalObject()) return wasm::EXTERN_GLOBAL;
-  if (obj->IsWasmTableObject()) return wasm::EXTERN_TABLE;
-  if (obj->IsWasmMemoryObject()) return wasm::EXTERN_MEMORY;
+  if (IsWasmGlobalObject(*obj)) return wasm::EXTERN_GLOBAL;
+  if (IsWasmTableObject(*obj)) return wasm::EXTERN_TABLE;
+  if (IsWasmMemoryObject(*obj)) return wasm::EXTERN_MEMORY;
   UNREACHABLE();
 }
 
@@ -1380,73 +1388,50 @@ struct FuncData {
 
 namespace {
 
-// TODO(jkummerow): Generalize for WasmExportedFunction and WasmCapiFunction.
 class SignatureHelper : public i::AllStatic {
  public:
-  // Use an invalid type as a marker separating params and results.
-  static constexpr i::wasm::ValueType kMarker = i::wasm::kWasmVoid;
-
   static i::Handle<i::PodArray<i::wasm::ValueType>> Serialize(
       i::Isolate* isolate, FuncType* type) {
-    int sig_size =
-        static_cast<int>(type->params().size() + type->results().size() + 1);
     i::Handle<i::PodArray<i::wasm::ValueType>> sig =
-        i::PodArray<i::wasm::ValueType>::New(isolate, sig_size,
-                                             i::AllocationType::kOld);
-    int index = 0;
+        i::wasm::SerializedSignatureHelper::NewEmptyPodArrayForSignature(
+            isolate, type->results().size(), type->params().size());
+
     // TODO(jkummerow): Consider making vec<> range-based for-iterable.
     for (size_t i = 0; i < type->results().size(); i++) {
-      sig->set(index++, WasmValKindToV8(type->results()[i]->kind()));
+      i::wasm::SerializedSignatureHelper::SetReturn(
+          *sig, i, WasmValKindToV8(type->results()[i]->kind()));
     }
-    // {sig->set} needs to take the address of its second parameter,
-    // so we can't pass in the static const kMarker directly.
-    i::wasm::ValueType marker = kMarker;
-    sig->set(index++, marker);
     for (size_t i = 0; i < type->params().size(); i++) {
-      sig->set(index++, WasmValKindToV8(type->params()[i]->kind()));
+      i::wasm::SerializedSignatureHelper::SetParam(
+          *sig, i, WasmValKindToV8(type->params()[i]->kind()));
     }
     return sig;
   }
 
-  static own<FuncType> Deserialize(i::PodArray<i::wasm::ValueType> sig) {
-    int result_arity = ResultArity(sig);
-    int param_arity = sig.length() - result_arity - 1;
+  static own<FuncType> Deserialize(
+      i::Tagged<i::PodArray<i::wasm::ValueType>> sig) {
+    int result_arity = i::wasm::SerializedSignatureHelper::ReturnCount(sig);
+    int param_arity = i::wasm::SerializedSignatureHelper::ParamCount(sig);
     ownvec<ValType> results = ownvec<ValType>::make_uninitialized(result_arity);
     ownvec<ValType> params = ownvec<ValType>::make_uninitialized(param_arity);
 
-    int i = 0;
-    for (; i < result_arity; ++i) {
-      results[i] = ValType::make(V8ValueTypeToWasm(sig.get(i)));
+    for (int i = 0; i < result_arity; ++i) {
+      results[i] = ValType::make(V8ValueTypeToWasm(
+          i::wasm::SerializedSignatureHelper::GetReturn(sig, i)));
     }
-    i++;  // Skip marker.
-    for (int p = 0; i < sig.length(); ++i, ++p) {
-      params[p] = ValType::make(V8ValueTypeToWasm(sig.get(i)));
+    for (int i = 0; i < param_arity; ++i) {
+      params[i] = ValType::make(V8ValueTypeToWasm(
+          i::wasm::SerializedSignatureHelper::GetParam(sig, i)));
     }
     return FuncType::make(std::move(params), std::move(results));
   }
 
-  static int ResultArity(i::PodArray<i::wasm::ValueType> sig) {
-    int count = 0;
-    for (; count < sig.length(); count++) {
-      if (sig.get(count) == kMarker) return count;
-    }
-    UNREACHABLE();
-  }
-
-  static int ParamArity(i::PodArray<i::wasm::ValueType> sig) {
-    return sig.length() - ResultArity(sig) - 1;
-  }
-
-  static i::PodArray<i::wasm::ValueType> GetSig(
+  static i::Tagged<i::PodArray<i::wasm::ValueType>> GetSig(
       i::Handle<i::JSFunction> function) {
-    return i::WasmCapiFunction::cast(*function).GetSerializedSignature();
+    return i::WasmCapiFunction::cast(*function)->GetSerializedSignature();
   }
 };
 
-// Explicit instantiation makes the linker happy for component builds of
-// wasm_api_tests.
-constexpr i::wasm::ValueType SignatureHelper::kMarker;
-
 auto make_func(Store* store_abs, FuncData* data) -> own<Func> {
   auto store = impl(store_abs);
   i::Isolate* isolate = store->i_isolate();
@@ -1459,8 +1444,8 @@ auto make_func(Store* store_abs, FuncData* data) -> own<Func> {
       isolate, reinterpret_cast<i::Address>(&FuncData::v8_callback),
       embedder_data, SignatureHelper::Serialize(isolate, data->type.get()));
   i::WasmApiFunctionRef::cast(
-      function->shared().wasm_capi_function_data().internal().ref())
-      .set_callable(*function);
+      function->shared()->wasm_capi_function_data()->internal()->ref())
+      ->set_callable(*function);
   auto func = implement<Func>::type::make(store, function);
   return func;
 }
@@ -1491,40 +1476,44 @@ auto Func::type() const -> own<FuncType> {
   DCHECK(i::WasmExportedFunction::IsWasmExportedFunction(*func));
   i::Handle<i::WasmExportedFunction> function =
       i::Handle<i::WasmExportedFunction>::cast(func);
-  return FunctionSigToFuncType(
-      function->instance().module()->functions[function->function_index()].sig);
+  return FunctionSigToFuncType(function->instance()
+                                   ->module()
+                                   ->functions[function->function_index()]
+                                   .sig);
 }
 
 auto Func::param_arity() const -> size_t {
   i::Handle<i::JSFunction> func = impl(this)->v8_object();
   if (i::WasmCapiFunction::IsWasmCapiFunction(*func)) {
-    return SignatureHelper::ParamArity(SignatureHelper::GetSig(func));
+    return i::wasm::SerializedSignatureHelper::ParamCount(
+        SignatureHelper::GetSig(func));
   }
   DCHECK(i::WasmExportedFunction::IsWasmExportedFunction(*func));
   i::Handle<i::WasmExportedFunction> function =
       i::Handle<i::WasmExportedFunction>::cast(func);
   const i::wasm::FunctionSig* sig =
-      function->instance().module()->functions[function->function_index()].sig;
+      function->instance()->module()->functions[function->function_index()].sig;
   return sig->parameter_count();
 }
 
 auto Func::result_arity() const -> size_t {
   i::Handle<i::JSFunction> func = impl(this)->v8_object();
   if (i::WasmCapiFunction::IsWasmCapiFunction(*func)) {
-    return SignatureHelper::ResultArity(SignatureHelper::GetSig(func));
+    return i::wasm::SerializedSignatureHelper::ReturnCount(
+        SignatureHelper::GetSig(func));
   }
   DCHECK(i::WasmExportedFunction::IsWasmExportedFunction(*func));
   i::Handle<i::WasmExportedFunction> function =
       i::Handle<i::WasmExportedFunction>::cast(func);
   const i::wasm::FunctionSig* sig =
-      function->instance().module()->functions[function->function_index()].sig;
+      function->instance()->module()->functions[function->function_index()].sig;
   return sig->return_count();
 }
 
 namespace {
 
 own<Ref> V8RefValueToWasm(StoreImpl* store, i::Handle<i::Object> value) {
-  if (value->IsNull(store->i_isolate())) return nullptr;
+  if (IsNull(*value, store->i_isolate())) return nullptr;
   return implement<Ref>::type::make(store,
                                     i::Handle<i::JSReceiver>::cast(value));
 }
@@ -1570,11 +1559,11 @@ void PushArgs(const i::wasm::FunctionSig* sig, const Val args[],
         break;
       case i::wasm::kRef:
       case i::wasm::kRefNull:
-        // TODO(7748): Make sure this works for all heap types.
-        packer->Push(WasmRefToV8(store->i_isolate(), args[i].ref())->ptr());
+        // TODO(14034): Make sure this works for all heap types.
+        packer->Push((*WasmRefToV8(store->i_isolate(), args[i].ref())).ptr());
         break;
       case i::wasm::kS128:
-        // TODO(7748): Implement.
+        // TODO(14034): Implement.
         UNIMPLEMENTED();
       case i::wasm::kRtt:
       case i::wasm::kI8:
@@ -1606,14 +1595,14 @@ void PopArgs(const i::wasm::FunctionSig* sig, Val results[],
         break;
       case i::wasm::kRef:
       case i::wasm::kRefNull: {
-        // TODO(7748): Make sure this works for all heap types.
+        // TODO(14034): Make sure this works for all heap types.
         i::Address raw = packer->Pop<i::Address>();
         i::Handle<i::Object> obj(i::Object(raw), store->i_isolate());
         results[i] = Val(V8RefValueToWasm(store, obj));
         break;
       }
       case i::wasm::kS128:
-        // TODO(7748): Implement.
+        // TODO(14034): Implement.
         UNIMPLEMENTED();
       case i::wasm::kRtt:
       case i::wasm::kI8:
@@ -1625,9 +1614,10 @@ void PopArgs(const i::wasm::FunctionSig* sig, Val results[],
   }
 }
 
-own<Trap> CallWasmCapiFunction(i::WasmCapiFunctionData data, const Val args[],
-                               Val results[]) {
-  FuncData* func_data = i::Managed<FuncData>::cast(data.embedder_data()).raw();
+own<Trap> CallWasmCapiFunction(i::Tagged<i::WasmCapiFunctionData> data,
+                               const Val args[], Val results[]) {
+  FuncData* func_data =
+      i::Managed<FuncData>::cast(data->embedder_data())->raw();
   if (func_data->kind == FuncData::kCallback) {
     return (func_data->callback)(args, results);
   }
@@ -1637,7 +1627,7 @@ own<Trap> CallWasmCapiFunction(i::WasmCapiFunctionData data, const Val args[],
 
 i::Handle<i::JSReceiver> GetProperException(
     i::Isolate* isolate, i::Handle<i::Object> maybe_exception) {
-  if (maybe_exception->IsJSReceiver()) {
+  if (IsJSReceiver(*maybe_exception)) {
     return i::Handle<i::JSReceiver>::cast(maybe_exception);
   }
   i::MaybeHandle<i::String> maybe_string =
@@ -1662,16 +1652,16 @@ auto Func::call(const Val args[], Val results[]) const -> own<Trap> {
   auto isolate = store->i_isolate();
   v8::Isolate::Scope isolate_scope(store->isolate());
   i::HandleScope handle_scope(isolate);
-  i::Object raw_function_data =
-      func->v8_object()->shared().function_data(v8::kAcquireLoad);
+  i::Tagged<i::Object> raw_function_data =
+      func->v8_object()->shared()->function_data(v8::kAcquireLoad);
 
   // WasmCapiFunctions can be called directly.
-  if (raw_function_data.IsWasmCapiFunctionData()) {
+  if (IsWasmCapiFunctionData(raw_function_data)) {
     return CallWasmCapiFunction(
         i::WasmCapiFunctionData::cast(raw_function_data), args, results);
   }
 
-  DCHECK(raw_function_data.IsWasmExportedFunctionData());
+  DCHECK(IsWasmExportedFunctionData(raw_function_data));
   i::Handle<i::WasmExportedFunctionData> function_data(
       i::WasmExportedFunctionData::cast(raw_function_data), isolate);
   i::Handle<i::WasmInstanceObject> instance(function_data->instance(), isolate);
@@ -1681,7 +1671,7 @@ auto Func::call(const Val args[], Val results[]) const -> own<Trap> {
       instance->module()->functions[function_index].sig;
   PrepareFunctionData(isolate, function_data, sig, instance->module());
   i::Handle<i::Code> wrapper_code(function_data->c_wrapper_code(), isolate);
-  i::Address call_target = function_data->internal().call_target(isolate);
+  i::Address call_target = function_data->internal()->call_target(isolate);
 
   i::wasm::CWasmArgumentsPacker packer(function_data->packed_args_size());
   PushArgs(sig, args, &packer, store);
@@ -1690,12 +1680,13 @@ auto Func::call(const Val args[], Val results[]) const -> own<Trap> {
   if (function_index <
       static_cast<int>(instance->module()->num_imported_functions)) {
     object_ref = i::handle(
-        instance->imported_function_refs().get(function_index), isolate);
-    if (object_ref->IsWasmApiFunctionRef()) {
-      i::JSFunction jsfunc = i::JSFunction::cast(
-          i::WasmApiFunctionRef::cast(*object_ref).callable());
-      i::Object data = jsfunc.shared().function_data(v8::kAcquireLoad);
-      if (data.IsWasmCapiFunctionData()) {
+        instance->imported_function_refs()->get(function_index), isolate);
+    if (IsWasmApiFunctionRef(*object_ref)) {
+      i::Tagged<i::JSFunction> jsfunc = i::JSFunction::cast(
+          i::WasmApiFunctionRef::cast(*object_ref)->callable());
+      i::Tagged<i::Object> data =
+          jsfunc->shared()->function_data(v8::kAcquireLoad);
+      if (IsWasmCapiFunctionData(data)) {
         return CallWasmCapiFunction(i::WasmCapiFunctionData::cast(data), args,
                                     results);
       }
@@ -1705,7 +1696,7 @@ auto Func::call(const Val args[], Val results[]) const -> own<Trap> {
       UNIMPLEMENTED();
     } else {
       // A WasmFunction from another module.
-      DCHECK(object_ref->IsWasmInstanceObject());
+      DCHECK(IsWasmInstanceObject(*object_ref));
     }
   }
 
@@ -1726,7 +1717,7 @@ auto Func::call(const Val args[], Val results[]) const -> own<Trap> {
 i::Address FuncData::v8_callback(i::Address host_data_foreign,
                                  i::Address argv) {
   FuncData* self =
-      i::Managed<FuncData>::cast(i::Object(host_data_foreign)).raw();
+      i::Managed<FuncData>::cast(i::Object(host_data_foreign))->raw();
   StoreImpl* store = impl(self->store);
   i::Isolate* isolate = store->i_isolate();
   v8::Isolate::Scope isolate_scope(store->isolate());
@@ -1781,7 +1772,7 @@ i::Address FuncData::v8_callback(i::Address host_data_foreign,
 
   if (trap) {
     isolate->Throw(*impl(trap.get())->v8_object());
-    i::Object ex = isolate->pending_exception();
+    i::Tagged<i::Object> ex = isolate->pending_exception();
     isolate->clear_pending_exception();
     return ex.ptr();
   }
@@ -1808,7 +1799,7 @@ i::Address FuncData::v8_callback(i::Address host_data_foreign,
       case ANYREF:
       case FUNCREF: {
         v8::base::WriteUnalignedValue(
-            p, WasmRefToV8(isolate, results[i].ref())->ptr());
+            p, (*WasmRefToV8(isolate, results[i].ref())).ptr());
         p += sizeof(i::Address);
         break;
       }
@@ -1874,23 +1865,22 @@ auto Global::get() const -> Val {
       return Val(v8_global->GetF64());
     case i::wasm::kRef:
     case i::wasm::kRefNull: {
-      // TODO(7748): Handle types other than funcref and externref if needed.
+      // TODO(14034): Handle types other than funcref and externref if needed.
       StoreImpl* store = impl(this)->store();
       i::HandleScope scope(store->i_isolate());
       v8::Isolate::Scope isolate_scope(store->isolate());
       i::Handle<i::Object> result = v8_global->GetRef();
-      if (result->IsWasmInternalFunction()) {
-        result =
-            handle(i::Handle<i::WasmInternalFunction>::cast(result)->external(),
-                   v8_global->GetIsolate());
+      if (IsWasmInternalFunction(*result)) {
+        result = i::WasmInternalFunction::GetOrCreateExternal(
+            i::Handle<i::WasmInternalFunction>::cast(result));
       }
-      if (result->IsWasmNull()) {
+      if (IsWasmNull(*result)) {
         result = v8_global->GetIsolate()->factory()->null_value();
       }
       return Val(V8RefValueToWasm(store, result));
     }
     case i::wasm::kS128:
-      // TODO(7748): Implement these.
+      // TODO(14034): Implement these.
       UNIMPLEMENTED();
     case i::wasm::kRtt:
     case i::wasm::kI8:
@@ -1988,7 +1978,7 @@ auto Table::make(Store* store_abs, const TableType* type, const Ref* ref)
       // This doesn't call WasmTableObject::Set because the table has
       // just been created, so it can't be imported by any instances
       // yet that might require updating.
-      DCHECK_EQ(table_obj->dispatch_tables().length(), 0);
+      DCHECK_EQ(table_obj->dispatch_tables()->length(), 0);
       backing_store->set(i, *init);
     }
   }
@@ -1999,7 +1989,7 @@ auto Table::type() const -> own<TableType> {
   i::Handle<i::WasmTableObject> table = impl(this)->v8_object();
   uint32_t min = table->current_length();
   uint32_t max;
-  if (!table->maximum_length().ToUint32(&max)) max = 0xFFFFFFFFu;
+  if (!i::Object::ToUint32(table->maximum_length(), &max)) max = 0xFFFFFFFFu;
   ValKind kind;
   switch (table->type().heap_representation()) {
     case i::wasm::HeapType::kFunc:
@@ -2014,7 +2004,7 @@ auto Table::type() const -> own<TableType> {
   return TableType::make(ValType::make(kind), Limits(min, max));
 }
 
-// TODO(7748): Handle types other than funcref and externref if needed.
+// TODO(14034): Handle types other than funcref and externref if needed.
 auto Table::get(size_t index) const -> own<Ref> {
   i::Handle<i::WasmTableObject> table = impl(this)->v8_object();
   if (index >= static_cast<size_t>(table->current_length())) return own<Ref>();
@@ -2022,14 +2012,14 @@ auto Table::get(size_t index) const -> own<Ref> {
   i::HandleScope handle_scope(isolate);
   i::Handle<i::Object> result =
       i::WasmTableObject::Get(isolate, table, static_cast<uint32_t>(index));
-  if (result->IsWasmInternalFunction()) {
-    result = handle(
-        i::Handle<i::WasmInternalFunction>::cast(result)->external(), isolate);
+  if (IsWasmInternalFunction(*result)) {
+    result = i::WasmInternalFunction::GetOrCreateExternal(
+        i::Handle<i::WasmInternalFunction>::cast(result));
   }
-  if (result->IsWasmNull()) {
+  if (IsWasmNull(*result)) {
     result = isolate->factory()->null_value();
   }
-  DCHECK(result->IsNull(isolate) || result->IsJSReceiver());
+  DCHECK(IsNull(*result, isolate) || IsJSReceiver(*result));
   return V8RefValueToWasm(impl(this)->store(), result);
 }
 
@@ -2099,10 +2089,11 @@ auto Memory::make(Store* store_abs, const MemoryType* type) -> own<Memory> {
     if (maximum < minimum) return nullptr;
     if (maximum > i::wasm::kSpecMaxMemory32Pages) return nullptr;
   }
-  // TODO(wasm+): Support shared memory.
+  // TODO(wasm+): Support shared memory and memory64.
   i::SharedFlag shared = i::SharedFlag::kNotShared;
+  i::WasmMemoryFlag mem_type = i::WasmMemoryFlag::kWasmMemory32;
   i::Handle<i::WasmMemoryObject> memory_obj;
-  if (!i::WasmMemoryObject::New(isolate, minimum, maximum, shared)
+  if (!i::WasmMemoryObject::New(isolate, minimum, maximum, shared, mem_type)
            .ToHandle(&memory_obj)) {
     return own<Memory>();
   }
@@ -2111,7 +2102,7 @@ auto Memory::make(Store* store_abs, const MemoryType* type) -> own<Memory> {
 
 auto Memory::type() const -> own<MemoryType> {
   i::Handle<i::WasmMemoryObject> memory = impl(this)->v8_object();
-  uint32_t min = static_cast<uint32_t>(memory->array_buffer().byte_length() /
+  uint32_t min = static_cast<uint32_t>(memory->array_buffer()->byte_length() /
                                        i::wasm::kWasmPageSize);
   uint32_t max =
       memory->has_maximum_pages() ? memory->maximum_pages() : 0xFFFFFFFFu;
@@ -2120,16 +2111,16 @@ auto Memory::type() const -> own<MemoryType> {
 
 auto Memory::data() const -> byte_t* {
   return reinterpret_cast<byte_t*>(
-      impl(this)->v8_object()->array_buffer().backing_store());
+      impl(this)->v8_object()->array_buffer()->backing_store());
 }
 
 auto Memory::data_size() const -> size_t {
-  return impl(this)->v8_object()->array_buffer().byte_length();
+  return impl(this)->v8_object()->array_buffer()->byte_length();
 }
 
 auto Memory::size() const -> pages_t {
   return static_cast<pages_t>(
-      impl(this)->v8_object()->array_buffer().byte_length() /
+      impl(this)->v8_object()->array_buffer()->byte_length() /
       i::wasm::kWasmPageSize);
 }
 
@@ -2463,8 +2454,7 @@ inline auto is_empty(T* p) -> bool {
 
 // Byte vectors
 
-using byte = byte_t;
-WASM_DEFINE_VEC_PLAIN(byte, byte)
+WASM_DEFINE_VEC_PLAIN(byte, byte_t)
 
 ///////////////////////////////////////////////////////////////////////////////
 // Runtime Environment
diff --git a/deps/v8/src/wasm/canonical-types.cc b/deps/v8/src/wasm/canonical-types.cc
index fc50d6ec548ec6..bc69b8c48a07ac 100644
--- a/deps/v8/src/wasm/canonical-types.cc
+++ b/deps/v8/src/wasm/canonical-types.cc
@@ -4,6 +4,7 @@
 
 #include "src/wasm/canonical-types.h"
 
+#include "src/wasm/std-object-sizes.h"
 #include "src/wasm/wasm-engine.h"
 
 namespace v8 {
@@ -191,6 +192,20 @@ int TypeCanonicalizer::FindCanonicalGroup(CanonicalGroup& group) const {
   return element == canonical_groups_.end() ? -1 : element->second;
 }
 
+size_t TypeCanonicalizer::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(TypeCanonicalizer, 232);
+  size_t result = ContentSize(canonical_supertypes_);
+  result += ContentSize(canonical_groups_);
+  for (auto& entry : canonical_groups_) {
+    result += ContentSize(entry.first.types);
+  }
+  result += allocator_.GetCurrentMemoryUsage();
+  if (v8_flags.trace_wasm_offheap_memory) {
+    PrintF("TypeCanonicalizer: %zu\n", result);
+  }
+  return result;
+}
+
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/wasm/canonical-types.h b/deps/v8/src/wasm/canonical-types.h
index 1750ebba9c8b4b..6b6716dd9960a0 100644
--- a/deps/v8/src/wasm/canonical-types.h
+++ b/deps/v8/src/wasm/canonical-types.h
@@ -64,6 +64,8 @@ class TypeCanonicalizer {
                                             const WasmModule* sub_module,
                                             const WasmModule* super_module);
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   using TypeInModule = std::pair<const WasmModule*, uint32_t>;
   struct CanonicalType {
diff --git a/deps/v8/src/wasm/code-space-access.cc b/deps/v8/src/wasm/code-space-access.cc
index bac1002a2858be..b96c6cd45f5f05 100644
--- a/deps/v8/src/wasm/code-space-access.cc
+++ b/deps/v8/src/wasm/code-space-access.cc
@@ -5,56 +5,10 @@
 #include "src/wasm/code-space-access.h"
 
 #include "src/common/code-memory-access-inl.h"
-#include "src/wasm/wasm-code-manager.h"
-#include "src/wasm/wasm-engine.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
+namespace v8::internal::wasm {
 
-thread_local int CodeSpaceWriteScope::scope_depth_ = 0;
+CodeSpaceWriteScope::CodeSpaceWriteScope()
+    : rwx_write_scope_("For wasm::CodeSpaceWriteScope.") {}
 
-// TODO(jkummerow): Background threads could permanently stay in
-// writable mode; only the main thread has to switch back and forth.
-CodeSpaceWriteScope::CodeSpaceWriteScope(NativeModule* native_module) {
-  DCHECK_LE(0, scope_depth_);
-  if (++scope_depth_ == 1) SetWritable();
-}
-
-CodeSpaceWriteScope::~CodeSpaceWriteScope() {
-  DCHECK_LT(0, scope_depth_);
-  if (--scope_depth_ == 0) SetExecutable();
-}
-
-#if V8_HAS_PTHREAD_JIT_WRITE_PROTECT
-
-// static
-void CodeSpaceWriteScope::SetWritable() { RwxMemoryWriteScope::SetWritable(); }
-
-// static
-void CodeSpaceWriteScope::SetExecutable() {
-  RwxMemoryWriteScope::SetExecutable();
-}
-
-#else  // !V8_HAS_PTHREAD_JIT_WRITE_PROTECT
-
-// static
-void CodeSpaceWriteScope::SetWritable() {
-  if (WasmCodeManager::MemoryProtectionKeysEnabled()) {
-    RwxMemoryWriteScope::SetWritable();
-  }
-}
-
-// static
-void CodeSpaceWriteScope::SetExecutable() {
-  if (WasmCodeManager::MemoryProtectionKeysEnabled()) {
-    DCHECK(v8_flags.wasm_memory_protection_keys);
-    RwxMemoryWriteScope::SetExecutable();
-  }
-}
-
-#endif  // !V8_HAS_PTHREAD_JIT_WRITE_PROTECT
-
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
diff --git a/deps/v8/src/wasm/code-space-access.h b/deps/v8/src/wasm/code-space-access.h
index fd02e428dc984b..a6e29a815d09db 100644
--- a/deps/v8/src/wasm/code-space-access.h
+++ b/deps/v8/src/wasm/code-space-access.h
@@ -11,6 +11,7 @@
 
 #include "src/base/build_config.h"
 #include "src/base/macros.h"
+#include "src/common/code-memory-access.h"
 
 namespace v8::internal::wasm {
 
@@ -41,24 +42,15 @@ class NativeModule;
 // permissions for all code pages.
 class V8_NODISCARD CodeSpaceWriteScope final {
  public:
-  explicit V8_EXPORT_PRIVATE CodeSpaceWriteScope(NativeModule*);
-  V8_EXPORT_PRIVATE ~CodeSpaceWriteScope();
+  explicit V8_EXPORT_PRIVATE CodeSpaceWriteScope();
 
   // Disable copy constructor and copy-assignment operator, since this manages
   // a resource and implicit copying of the scope can yield surprising errors.
   CodeSpaceWriteScope(const CodeSpaceWriteScope&) = delete;
   CodeSpaceWriteScope& operator=(const CodeSpaceWriteScope&) = delete;
 
-  static bool IsInScope() {
-    DCHECK_LE(0, scope_depth_);
-    return scope_depth_ != 0;
-  }
-
  private:
-  static thread_local int scope_depth_;
-
-  static void SetWritable();
-  static void SetExecutable();
+  RwxMemoryWriteScope rwx_write_scope_;
 };
 
 }  // namespace v8::internal::wasm
diff --git a/deps/v8/src/wasm/compilation-environment.h b/deps/v8/src/wasm/compilation-environment.h
index 63c2533dfad218..faf67788675abd 100644
--- a/deps/v8/src/wasm/compilation-environment.h
+++ b/deps/v8/src/wasm/compilation-environment.h
@@ -31,52 +31,38 @@ class WasmCode;
 class WasmEngine;
 class WasmError;
 
-enum RuntimeExceptionSupport : bool {
-  kRuntimeExceptionSupport = true,
-  kNoRuntimeExceptionSupport = false
-};
-
-enum BoundsCheckStrategy : int8_t {
-  // Emit protected instructions, use the trap handler for OOB detection.
-  kTrapHandler,
-  // Emit explicit bounds checks.
-  kExplicitBoundsChecks,
-  // Emit no bounds checks at all (for testing only).
-  kNoBoundsChecks
-};
-
 enum DynamicTiering : bool {
   kDynamicTiering = true,
   kNoDynamicTiering = false
 };
 
+// The Arm architecture does not specify the results in memory of
+// partially-in-bound writes, which does not align with the wasm spec. This
+// affects when trap handlers can be used for OOB detection; however, Mac
+// systems with Apple silicon currently do provide trapping beahviour for
+// partially-out-of-bound writes, so we assume we can rely on that on MacOS,
+// since doing so provides better performance for writes.
+#if V8_TARGET_ARCH_ARM64 && !V8_OS_MACOS
+constexpr bool kPartialOOBWritesAreNoops = false;
+#else
+constexpr bool kPartialOOBWritesAreNoops = true;
+#endif
+
 // The {CompilationEnv} encapsulates the module data that is used during
 // compilation. CompilationEnvs are shareable across multiple compilations.
 struct CompilationEnv {
   // A pointer to the decoded module's static representation.
   const WasmModule* const module;
 
-  // The bounds checking strategy to use.
-  const BoundsCheckStrategy bounds_checks;
-
-  // If the runtime doesn't support exception propagation,
-  // we won't generate stack checks, and trap handling will also
-  // be generated differently.
-  const RuntimeExceptionSupport runtime_exception_support;
-
   // Features enabled for this compilation.
   const WasmFeatures enabled_features;
 
   const DynamicTiering dynamic_tiering;
 
   constexpr CompilationEnv(const WasmModule* module,
-                           BoundsCheckStrategy bounds_checks,
-                           RuntimeExceptionSupport runtime_exception_support,
                            const WasmFeatures& enabled_features,
                            DynamicTiering dynamic_tiering)
       : module(module),
-        bounds_checks(bounds_checks),
-        runtime_exception_support(runtime_exception_support),
         enabled_features(enabled_features),
         dynamic_tiering(dynamic_tiering) {}
 };
@@ -168,6 +154,8 @@ class V8_EXPORT_PRIVATE CompilationState {
 
   CompilationState() = delete;
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   // NativeModule is allowed to call the static {New} method.
   friend class NativeModule;
diff --git a/deps/v8/src/wasm/constant-expression-interface.cc b/deps/v8/src/wasm/constant-expression-interface.cc
index e75bbfbb464b0f..d0b3cec03b832c 100644
--- a/deps/v8/src/wasm/constant-expression-interface.cc
+++ b/deps/v8/src/wasm/constant-expression-interface.cc
@@ -47,11 +47,8 @@ void ConstantExpressionInterface::UnOp(FullDecoder* decoder, WasmOpcode opcode,
   if (!generate_value()) return;
   switch (opcode) {
     case kExprExternExternalize: {
-      const char* error_message = nullptr;
       result->runtime_value = WasmValue(
-          WasmToJSObject(isolate_, input.runtime_value.to_ref(),
-                         input.type.heap_type(), &error_message)
-              .ToHandleChecked(),
+          WasmToJSObject(isolate_, input.runtime_value.to_ref()),
           ValueType::RefMaybeNull(HeapType::kExtern, input.type.nullability()));
       break;
     }
@@ -136,29 +133,29 @@ void ConstantExpressionInterface::GlobalGet(FullDecoder* decoder, Value* result,
   result->runtime_value =
       global.type.is_numeric()
           ? WasmValue(
-                reinterpret_cast<byte*>(
-                    instance_->untagged_globals_buffer().backing_store()) +
+                reinterpret_cast<uint8_t*>(
+                    instance_->untagged_globals_buffer()->backing_store()) +
                     global.offset,
                 global.type)
           : WasmValue(
-                handle(instance_->tagged_globals_buffer().get(global.offset),
+                handle(instance_->tagged_globals_buffer()->get(global.offset),
                        isolate_),
                 global.type);
 }
 
 void ConstantExpressionInterface::StructNew(FullDecoder* decoder,
                                             const StructIndexImmediate& imm,
-                                            const Value& rtt,
                                             const Value args[], Value* result) {
   if (!generate_value()) return;
+  Handle<Map> rtt{Map::cast(instance_->managed_object_maps()->get(imm.index)),
+                  isolate_};
   std::vector<WasmValue> field_values(imm.struct_type->field_count());
   for (size_t i = 0; i < field_values.size(); i++) {
     field_values[i] = args[i].runtime_value;
   }
   result->runtime_value =
-      WasmValue(isolate_->factory()->NewWasmStruct(
-                    imm.struct_type, field_values.data(),
-                    Handle<Map>::cast(rtt.runtime_value.to_ref())),
+      WasmValue(isolate_->factory()->NewWasmStruct(imm.struct_type,
+                                                   field_values.data(), rtt),
                 ValueType::Ref(HeapType(imm.index)));
 }
 
@@ -173,7 +170,7 @@ void ConstantExpressionInterface::StringConst(FullDecoder* decoder,
   const wasm::WasmStringRefLiteral& literal =
       module_->stringref_literals[imm.index];
   const base::Vector<const uint8_t> module_bytes =
-      instance_->module_object().native_module()->wire_bytes();
+      instance_->module_object()->native_module()->wire_bytes();
   const base::Vector<const uint8_t> string_bytes =
       module_bytes.SubVector(literal.source.offset(),
                              literal.source.offset() + literal.source.length());
@@ -200,7 +197,11 @@ WasmValue DefaultValueForType(ValueType type, Isolate* isolate) {
     case kS128:
       return WasmValue(Simd128());
     case kRefNull:
-      return WasmValue(isolate->factory()->null_value(), type);
+      return WasmValue(
+          type == kWasmExternRef || type == kWasmNullExternRef
+              ? Handle<Object>::cast(isolate->factory()->null_value())
+              : Handle<Object>::cast(isolate->factory()->wasm_null()),
+          type);
     case kVoid:
     case kRtt:
     case kRef:
@@ -211,17 +212,17 @@ WasmValue DefaultValueForType(ValueType type, Isolate* isolate) {
 }  // namespace
 
 void ConstantExpressionInterface::StructNewDefault(
-    FullDecoder* decoder, const StructIndexImmediate& imm, const Value& rtt,
-    Value* result) {
+    FullDecoder* decoder, const StructIndexImmediate& imm, Value* result) {
   if (!generate_value()) return;
+  Handle<Map> rtt{Map::cast(instance_->managed_object_maps()->get(imm.index)),
+                  isolate_};
   std::vector<WasmValue> field_values(imm.struct_type->field_count());
   for (uint32_t i = 0; i < field_values.size(); i++) {
     field_values[i] = DefaultValueForType(imm.struct_type->field(i), isolate_);
   }
   result->runtime_value =
-      WasmValue(isolate_->factory()->NewWasmStruct(
-                    imm.struct_type, field_values.data(),
-                    Handle<Map>::cast(rtt.runtime_value.to_ref())),
+      WasmValue(isolate_->factory()->NewWasmStruct(imm.struct_type,
+                                                   field_values.data(), rtt),
                 ValueType::Ref(imm.index));
 }
 
@@ -229,8 +230,10 @@ void ConstantExpressionInterface::ArrayNew(FullDecoder* decoder,
                                            const ArrayIndexImmediate& imm,
                                            const Value& length,
                                            const Value& initial_value,
-                                           const Value& rtt, Value* result) {
+                                           Value* result) {
   if (!generate_value()) return;
+  Handle<Map> rtt{Map::cast(instance_->managed_object_maps()->get(imm.index)),
+                  isolate_};
   if (length.runtime_value.to_u32() >
       static_cast<uint32_t>(WasmArray::MaxLength(imm.array_type))) {
     error_ = MessageTemplate::kWasmTrapArrayTooLarge;
@@ -239,43 +242,50 @@ void ConstantExpressionInterface::ArrayNew(FullDecoder* decoder,
   result->runtime_value =
       WasmValue(isolate_->factory()->NewWasmArray(
                     imm.array_type, length.runtime_value.to_u32(),
-                    initial_value.runtime_value,
-                    Handle<Map>::cast(rtt.runtime_value.to_ref())),
+                    initial_value.runtime_value, rtt),
                 ValueType::Ref(imm.index));
 }
 
 void ConstantExpressionInterface::ArrayNewDefault(
     FullDecoder* decoder, const ArrayIndexImmediate& imm, const Value& length,
-    const Value& rtt, Value* result) {
+    Value* result) {
   if (!generate_value()) return;
   Value initial_value(decoder->pc(), imm.array_type->element_type());
   initial_value.runtime_value =
       DefaultValueForType(imm.array_type->element_type(), isolate_);
-  return ArrayNew(decoder, imm, length, initial_value, rtt, result);
+  return ArrayNew(decoder, imm, length, initial_value, result);
 }
 
 void ConstantExpressionInterface::ArrayNewFixed(
-    FullDecoder* decoder, const ArrayIndexImmediate& imm,
-    const base::Vector<Value>& elements, const Value& rtt, Value* result) {
+    FullDecoder* decoder, const ArrayIndexImmediate& array_imm,
+    const IndexImmediate& length_imm, const Value elements[], Value* result) {
   if (!generate_value()) return;
+  Handle<Map> rtt =
+      handle(Map::cast(instance_->managed_object_maps()->get(array_imm.index)),
+             isolate_);
   std::vector<WasmValue> element_values;
-  for (Value elem : elements) element_values.push_back(elem.runtime_value);
+  for (Value elem : base::VectorOf(elements, length_imm.index)) {
+    element_values.push_back(elem.runtime_value);
+  }
   result->runtime_value =
       WasmValue(isolate_->factory()->NewWasmArrayFromElements(
-                    imm.array_type, element_values,
-                    Handle<Map>::cast(rtt.runtime_value.to_ref())),
-                ValueType::Ref(HeapType(imm.index)));
+                    array_imm.array_type, element_values, rtt),
+                ValueType::Ref(HeapType(array_imm.index)));
 }
 
-// TODO(7748): These expressions are non-constant for now. There are plans to
+// TODO(14034): These expressions are non-constant for now. There are plans to
 // make them constant in the future, so we retain the required infrastructure
 // here.
 void ConstantExpressionInterface::ArrayNewSegment(
     FullDecoder* decoder, const ArrayIndexImmediate& array_imm,
     const IndexImmediate& segment_imm, const Value& offset_value,
-    const Value& length_value, const Value& rtt, Value* result) {
+    const Value& length_value, Value* result) {
   if (!generate_value()) return;
 
+  Handle<Map> rtt =
+      handle(Map::cast(instance_->managed_object_maps()->get(array_imm.index)),
+             isolate_);
+
   uint32_t length = length_value.runtime_value.to_u32();
   uint32_t offset = offset_value.runtime_value.to_u32();
   if (length >
@@ -298,9 +308,9 @@ void ConstantExpressionInterface::ArrayNewSegment(
     }
 
     Address source =
-        instance_->data_segment_starts().get(segment_imm.index) + offset;
-    Handle<WasmArray> array_value = isolate_->factory()->NewWasmArrayFromMemory(
-        length, Handle<Map>::cast(rtt.runtime_value.to_ref()), source);
+        instance_->data_segment_starts()->get(segment_imm.index) + offset;
+    Handle<WasmArray> array_value =
+        isolate_->factory()->NewWasmArrayFromMemory(length, rtt, source);
     result->runtime_value = WasmValue(array_value, result_type);
   } else {
     const wasm::WasmElemSegment* elem_segment =
@@ -318,25 +328,16 @@ void ConstantExpressionInterface::ArrayNewSegment(
 
     Handle<Object> array_object =
         isolate_->factory()->NewWasmArrayFromElementSegment(
-            instance_, segment_imm.index, offset, length,
-            Handle<Map>::cast(rtt.runtime_value.to_ref()));
-    if (array_object->IsSmi()) {
+            instance_, segment_imm.index, offset, length, rtt);
+    if (IsSmi(*array_object)) {
       // A smi result stands for an error code.
-      error_ = static_cast<MessageTemplate>(array_object->ToSmi().value());
+      error_ = static_cast<MessageTemplate>(Smi::cast(*array_object).value());
     } else {
       result->runtime_value = WasmValue(array_object, result_type);
     }
   }
 }
 
-void ConstantExpressionInterface::RttCanon(FullDecoder* decoder,
-                                           uint32_t type_index, Value* result) {
-  if (!generate_value()) return;
-  result->runtime_value = WasmValue(
-      handle(instance_->managed_object_maps().get(type_index), isolate_),
-      ValueType::Rtt(type_index));
-}
-
 void ConstantExpressionInterface::I31New(FullDecoder* decoder,
                                          const Value& input, Value* result) {
   if (!generate_value()) return;
diff --git a/deps/v8/src/wasm/constant-expression-interface.h b/deps/v8/src/wasm/constant-expression-interface.h
index f109907ace7c57..1a39e4cd9519e1 100644
--- a/deps/v8/src/wasm/constant-expression-interface.h
+++ b/deps/v8/src/wasm/constant-expression-interface.h
@@ -32,6 +32,7 @@ class V8_EXPORT_PRIVATE ConstantExpressionInterface {
  public:
   using ValidationTag = Decoder::FullValidationTag;
   static constexpr DecodingMode decoding_mode = kConstantExpression;
+  static constexpr bool kUsesPoppedArgs = true;
 
   struct Value : public ValueBase<ValidationTag> {
     WasmValue runtime_value;
diff --git a/deps/v8/src/wasm/constant-expression.cc b/deps/v8/src/wasm/constant-expression.cc
index 0459d2240aa5e5..c0b11d5b45b16e 100644
--- a/deps/v8/src/wasm/constant-expression.cc
+++ b/deps/v8/src/wasm/constant-expression.cc
@@ -50,11 +50,11 @@ ValueOrError EvaluateConstantExpression(Zone* zone, ConstantExpression expr,
     case ConstantExpression::kWireBytesRef: {
       WireBytesRef ref = expr.wire_bytes_ref();
 
-      base::Vector<const byte> module_bytes =
-          instance->module_object().native_module()->wire_bytes();
+      base::Vector<const uint8_t> module_bytes =
+          instance->module_object()->native_module()->wire_bytes();
 
-      const byte* start = module_bytes.begin() + ref.offset();
-      const byte* end = module_bytes.begin() + ref.end_offset();
+      const uint8_t* start = module_bytes.begin() + ref.offset();
+      const uint8_t* end = module_bytes.begin() + ref.end_offset();
 
       auto sig = FixedSizeSignature<ValueType>::Returns(expected);
       FunctionBody body(&sig, ref.offset(), start, end);
diff --git a/deps/v8/src/wasm/decoder.h b/deps/v8/src/wasm/decoder.h
index 3bfb9a1a91d8eb..4e630eed49d8c3 100644
--- a/deps/v8/src/wasm/decoder.h
+++ b/deps/v8/src/wasm/decoder.h
@@ -55,9 +55,10 @@ class ITracer {
   virtual void StartOffset(uint32_t offset) = 0;
   virtual void ElementOffset(uint32_t offset) = 0;
   virtual void DataOffset(uint32_t offset) = 0;
+  virtual void StringOffset(uint32_t offset) = 0;
 
   // Hooks for annotated hex dumps.
-  virtual void Bytes(const byte* start, uint32_t count) = 0;
+  virtual void Bytes(const uint8_t* start, uint32_t count) = 0;
 
   virtual void Description(const char* desc) = 0;
   virtual void Description(const char* desc, size_t length) = 0;
@@ -70,11 +71,11 @@ class ITracer {
   virtual void NextLineIfFull() = 0;
   virtual void NextLineIfNonEmpty() = 0;
 
-  virtual void InitializerExpression(const byte* start, const byte* end,
+  virtual void InitializerExpression(const uint8_t* start, const uint8_t* end,
                                      ValueType expected_type) = 0;
-  virtual void FunctionBody(const WasmFunction* func, const byte* start) = 0;
+  virtual void FunctionBody(const WasmFunction* func, const uint8_t* start) = 0;
   virtual void FunctionName(uint32_t func_index) = 0;
-  virtual void NameSection(const byte* start, const byte* end,
+  virtual void NameSection(const uint8_t* start, const uint8_t* end,
                            uint32_t offset) = 0;
 
   virtual ~ITracer() = default;
@@ -117,12 +118,12 @@ class Decoder {
 
   enum TraceFlag : bool { kTrace = true, kNoTrace = false };
 
-  Decoder(const byte* start, const byte* end, uint32_t buffer_offset = 0)
+  Decoder(const uint8_t* start, const uint8_t* end, uint32_t buffer_offset = 0)
       : Decoder(start, start, end, buffer_offset) {}
-  explicit Decoder(const base::Vector<const byte> bytes,
+  explicit Decoder(const base::Vector<const uint8_t> bytes,
                    uint32_t buffer_offset = 0)
       : Decoder(bytes.begin(), bytes.begin() + bytes.length(), buffer_offset) {}
-  Decoder(const byte* start, const byte* pc, const byte* end,
+  Decoder(const uint8_t* start, const uint8_t* pc, const uint8_t* end,
           uint32_t buffer_offset = 0)
       : start_(start), pc_(pc), end_(end), buffer_offset_(buffer_offset) {
     DCHECK_LE(start, pc);
@@ -134,27 +135,28 @@ class Decoder {
 
   // Reads an 8-bit unsigned integer.
   template <typename ValidationTag>
-  uint8_t read_u8(const byte* pc, Name<ValidationTag> msg = "expected 1 byte") {
+  uint8_t read_u8(const uint8_t* pc,
+                  Name<ValidationTag> msg = "expected 1 byte") {
     return read_little_endian<uint8_t, ValidationTag>(pc, msg);
   }
 
   // Reads a 16-bit unsigned integer (little endian).
   template <typename ValidationTag>
-  uint16_t read_u16(const byte* pc,
+  uint16_t read_u16(const uint8_t* pc,
                     Name<ValidationTag> msg = "expected 2 bytes") {
     return read_little_endian<uint16_t, ValidationTag>(pc, msg);
   }
 
   // Reads a 32-bit unsigned integer (little endian).
   template <typename ValidationTag>
-  uint32_t read_u32(const byte* pc,
+  uint32_t read_u32(const uint8_t* pc,
                     Name<ValidationTag> msg = "expected 4 bytes") {
     return read_little_endian<uint32_t, ValidationTag>(pc, msg);
   }
 
   // Reads a 64-bit unsigned integer (little endian).
   template <typename ValidationTag>
-  uint64_t read_u64(const byte* pc,
+  uint64_t read_u64(const uint8_t* pc,
                     Name<ValidationTag> msg = "expected 8 bytes") {
     return read_little_endian<uint64_t, ValidationTag>(pc, msg);
   }
@@ -162,7 +164,7 @@ class Decoder {
   // Reads a variable-length unsigned integer (little endian). Returns the read
   // value and the number of bytes read.
   template <typename ValidationTag>
-  std::pair<uint32_t, uint32_t> read_u32v(const byte* pc,
+  std::pair<uint32_t, uint32_t> read_u32v(const uint8_t* pc,
                                           Name<ValidationTag> name = "LEB32") {
     return read_leb<uint32_t, ValidationTag, kNoTrace>(pc, name);
   }
@@ -171,14 +173,14 @@ class Decoder {
   // value and the number of bytes read.
   template <typename ValidationTag>
   std::pair<int32_t, uint32_t> read_i32v(
-      const byte* pc, Name<ValidationTag> name = "signed LEB32") {
+      const uint8_t* pc, Name<ValidationTag> name = "signed LEB32") {
     return read_leb<int32_t, ValidationTag, kNoTrace>(pc, name);
   }
 
   // Reads a variable-length unsigned integer (little endian). Returns the read
   // value and the number of bytes read.
   template <typename ValidationTag>
-  std::pair<uint64_t, uint32_t> read_u64v(const byte* pc,
+  std::pair<uint64_t, uint32_t> read_u64v(const uint8_t* pc,
                                           Name<ValidationTag> name = "LEB64") {
     return read_leb<uint64_t, ValidationTag, kNoTrace>(pc, name);
   }
@@ -187,7 +189,7 @@ class Decoder {
   // value and the number of bytes read.
   template <typename ValidationTag>
   std::pair<int64_t, uint32_t> read_i64v(
-      const byte* pc, Name<ValidationTag> name = "signed LEB64") {
+      const uint8_t* pc, Name<ValidationTag> name = "signed LEB64") {
     return read_leb<int64_t, ValidationTag, kNoTrace>(pc, name);
   }
 
@@ -195,7 +197,7 @@ class Decoder {
   // read value and the number of bytes read.
   template <typename ValidationTag>
   std::pair<int64_t, uint32_t> read_i33v(
-      const byte* pc, Name<ValidationTag> name = "signed LEB33") {
+      const uint8_t* pc, Name<ValidationTag> name = "signed LEB33") {
     return read_leb<int64_t, ValidationTag, kNoTrace, 33>(pc, name);
   }
 
@@ -204,7 +206,7 @@ class Decoder {
   // *including* the prefix byte. For most opcodes, it will be 2.
   template <typename ValidationTag>
   std::pair<WasmOpcode, uint32_t> read_prefixed_opcode(
-      const byte* pc, Name<ValidationTag> name = "prefixed opcode") {
+      const uint8_t* pc, Name<ValidationTag> name = "prefixed opcode") {
     // Prefixed opcodes all use LEB128 encoding.
     auto [index, index_length] =
         read_u32v<ValidationTag>(pc + 1, "prefixed opcode index");
@@ -374,9 +376,9 @@ class Decoder {
   virtual void onFirstError() {}
 
   // Debugging helper to print a bytes range as hex bytes.
-  void traceByteRange(const byte* start, const byte* end) {
+  void traceByteRange(const uint8_t* start, const uint8_t* end) {
     DCHECK_LE(start, end);
-    for (const byte* p = start; p < end; ++p) TRACE("%02x ", *p);
+    for (const uint8_t* p = start; p < end; ++p) TRACE("%02x ", *p);
   }
 
   // Debugging helper to print bytes up to the end.
@@ -396,7 +398,8 @@ class Decoder {
   }
 
   // Resets the boundaries of this decoder.
-  void Reset(const byte* start, const byte* end, uint32_t buffer_offset = 0) {
+  void Reset(const uint8_t* start, const uint8_t* end,
+             uint32_t buffer_offset = 0) {
     DCHECK_LE(start, end);
     DCHECK_EQ(static_cast<uint32_t>(end - start), end - start);
     start_ = start;
@@ -415,8 +418,8 @@ class Decoder {
   bool more() const { return pc_ < end_; }
   const WasmError& error() const { return error_; }
 
-  const byte* start() const { return start_; }
-  const byte* pc() const { return pc_; }
+  const uint8_t* start() const { return start_; }
+  const uint8_t* pc() const { return pc_; }
   uint32_t V8_INLINE position() const {
     return static_cast<uint32_t>(pc_ - start_);
   }
@@ -434,19 +437,19 @@ class Decoder {
     DCHECK_LE(buffer_offset_, offset);
     return offset - buffer_offset_;
   }
-  const byte* end() const { return end_; }
-  void set_end(const byte* end) { end_ = end; }
+  const uint8_t* end() const { return end_; }
+  void set_end(const uint8_t* end) { end_ = end; }
 
-  // Check if the byte at {offset} from the current pc equals {expected}.
-  bool lookahead(int offset, byte expected) {
+  // Check if the uint8_t at {offset} from the current pc equals {expected}.
+  bool lookahead(int offset, uint8_t expected) {
     DCHECK_LE(pc_, end_);
     return end_ - pc_ > offset && pc_[offset] == expected;
   }
 
  protected:
-  const byte* start_;
-  const byte* pc_;
-  const byte* end_;
+  const uint8_t* start_;
+  const uint8_t* pc_;
+  const uint8_t* end_;
   // The offset of the current buffer in the module. Needed for streaming.
   uint32_t buffer_offset_;
   WasmError error_;
@@ -468,7 +471,7 @@ class Decoder {
   }
 
   template <typename IntType, typename ValidationTag>
-  IntType read_little_endian(const byte* pc, Name<ValidationTag> msg) {
+  IntType read_little_endian(const uint8_t* pc, Name<ValidationTag> msg) {
     DCHECK_LE(start_, pc);
 
     if (!ValidationTag::validate) {
@@ -505,7 +508,7 @@ class Decoder {
   template <typename IntType, typename ValidationTag, TraceFlag trace,
             size_t size_in_bits = 8 * sizeof(IntType)>
   V8_INLINE std::pair<IntType, uint32_t> read_leb(
-      const byte* pc, Name<ValidationTag> name = "varint") {
+      const uint8_t* pc, Name<ValidationTag> name = "varint") {
     static_assert(size_in_bits <= 8 * sizeof(IntType),
                   "leb does not fit in type");
     TRACE_IF(trace, "  +%u  %-20s: ", pc_offset(),
@@ -535,7 +538,7 @@ class Decoder {
   template <typename IntType, typename ValidationTag, TraceFlag trace,
             size_t size_in_bits = 8 * sizeof(IntType)>
   V8_NOINLINE V8_PRESERVE_MOST std::pair<IntType, uint32_t> read_leb_slowpath(
-      const byte* pc, Name<ValidationTag> name) {
+      const uint8_t* pc, Name<ValidationTag> name) {
     // Create an unrolled LEB decoding function per integer type.
     return read_leb_tail<IntType, ValidationTag, trace, size_in_bits, 0>(
         pc, name, 0);
@@ -544,14 +547,15 @@ class Decoder {
   template <typename IntType, typename ValidationTag, TraceFlag trace,
             size_t size_in_bits, int byte_index>
   V8_INLINE std::pair<IntType, uint32_t> read_leb_tail(
-      const byte* pc, Name<ValidationTag> name, IntType intermediate_result) {
+      const uint8_t* pc, Name<ValidationTag> name,
+      IntType intermediate_result) {
     constexpr bool is_signed = std::is_signed<IntType>::value;
     constexpr int kMaxLength = (size_in_bits + 6) / 7;
     static_assert(byte_index < kMaxLength, "invalid template instantiation");
     constexpr int shift = byte_index * 7;
     constexpr bool is_last_byte = byte_index == kMaxLength - 1;
     const bool at_end = ValidationTag::validate && pc >= end_;
-    byte b = 0;
+    uint8_t b = 0;
     if (V8_LIKELY(!at_end)) {
       DCHECK_LT(pc, end_);
       b = *pc;
@@ -571,7 +575,8 @@ class Decoder {
     if (ValidationTag::validate && V8_UNLIKELY(at_end || (b & 0x80))) {
       TRACE_IF(trace, at_end ? "<end> " : "<length overflow> ");
       if constexpr (ValidationTag::full_validation) {
-        errorf(pc, "expected %s", name);
+        errorf(pc, "%s while decoding %s",
+               at_end ? "reached end" : "length overflow", name);
       } else {
         MarkError();
       }
@@ -586,8 +591,8 @@ class Decoder {
       // either be 0, or all ones.
       constexpr int kExtraBits = size_in_bits - ((kMaxLength - 1) * 7);
       constexpr int kSignExtBits = kExtraBits - (is_signed ? 1 : 0);
-      const byte checked_bits = b & (0xFF << kSignExtBits);
-      constexpr byte kSignExtendedExtraBits = 0x7f & (0xFF << kSignExtBits);
+      const uint8_t checked_bits = b & (0xFF << kSignExtBits);
+      constexpr uint8_t kSignExtendedExtraBits = 0x7f & (0xFF << kSignExtBits);
       const bool valid_extra_bits =
           checked_bits == 0 ||
           (is_signed && checked_bits == kSignExtendedExtraBits);
diff --git a/deps/v8/src/wasm/function-body-decoder-impl.h b/deps/v8/src/wasm/function-body-decoder-impl.h
index dd9e3b0171bc1d..624bccc0bab7a4 100644
--- a/deps/v8/src/wasm/function-body-decoder-impl.h
+++ b/deps/v8/src/wasm/function-body-decoder-impl.h
@@ -31,9 +31,7 @@
 #include "src/wasm/wasm-opcodes.h"
 #include "src/wasm/wasm-subtyping.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
+namespace v8::internal::wasm {
 
 struct WasmGlobal;
 struct WasmTag;
@@ -180,7 +178,7 @@ static constexpr StoreType GetStoreType(WasmOpcode opcode) {
 // Depending on the validation tag and the number of arguments, this forwards to
 // a V8_NOINLINE and V8_PRESERVE_MOST method of the decoder.
 template <typename ValidationTag, typename... Args>
-V8_INLINE void DecodeError(Decoder* decoder, const byte* pc, const char* str,
+V8_INLINE void DecodeError(Decoder* decoder, const uint8_t* pc, const char* str,
                            Args&&... args) {
   // Decode errors can only happen if we are validating; the compiler should
   // know this e.g. from the VALIDATE macro, but this assumption tells it again
@@ -216,7 +214,8 @@ V8_INLINE void DecodeError(Decoder* decoder, const char* str, Args&&... args) {
 namespace value_type_reader {
 
 template <typename ValidationTag>
-std::pair<HeapType, uint32_t> read_heap_type(Decoder* decoder, const byte* pc,
+std::pair<HeapType, uint32_t> read_heap_type(Decoder* decoder,
+                                             const uint8_t* pc,
                                              const WasmFeatures& enabled) {
   auto [heap_index, length] =
       decoder->read_i33v<ValidationTag>(pc, "heap type");
@@ -287,9 +286,10 @@ std::pair<HeapType, uint32_t> read_heap_type(Decoder* decoder, const byte* pc,
 // No bytes are consumed.
 // Returns the read value type and the number of bytes read (a.k.a. length).
 template <typename ValidationTag>
-std::pair<ValueType, uint32_t> read_value_type(Decoder* decoder, const byte* pc,
+std::pair<ValueType, uint32_t> read_value_type(Decoder* decoder,
+                                               const uint8_t* pc,
                                                const WasmFeatures& enabled) {
-  byte val = decoder->read_u8<ValidationTag>(pc, "value type opcode");
+  uint8_t val = decoder->read_u8<ValidationTag>(pc, "value type opcode");
   if (!VALIDATE(decoder->ok())) {
     return {kWasmBottom, 0};
   }
@@ -355,6 +355,9 @@ std::pair<ValueType, uint32_t> read_value_type(Decoder* decoder, const byte* pc,
     }
     case kS128Code: {
       if (!VALIDATE(CheckHardwareSupportsSimd())) {
+        if (v8_flags.correctness_fuzzer_suppressions) {
+          FATAL("Aborting on missing Wasm SIMD support");
+        }
         DecodeError<ValidationTag>(decoder, pc, "Wasm SIMD unsupported");
         return {kWasmBottom, 0};
       }
@@ -376,8 +379,9 @@ std::pair<ValueType, uint32_t> read_value_type(Decoder* decoder, const byte* pc,
 }
 
 template <typename ValidationTag>
-bool ValidateHeapType(Decoder* decoder, const byte* pc,
+bool ValidateHeapType(Decoder* decoder, const uint8_t* pc,
                       const WasmModule* module, HeapType type) {
+  if (!VALIDATE(!type.is_bottom())) return false;
   if (!type.is_index()) return true;
   // A {nullptr} module is accepted if we are not validating anyway (e.g. for
   // opcode length computation).
@@ -391,8 +395,9 @@ bool ValidateHeapType(Decoder* decoder, const byte* pc,
 }
 
 template <typename ValidationTag>
-bool ValidateValueType(Decoder* decoder, const byte* pc,
+bool ValidateValueType(Decoder* decoder, const uint8_t* pc,
                        const WasmModule* module, ValueType type) {
+  if (!VALIDATE(!type.is_bottom())) return false;
   if (V8_LIKELY(!type.is_object_reference())) return true;
   return ValidateHeapType<ValidationTag>(decoder, pc, module, type.heap_type());
 }
@@ -407,7 +412,7 @@ struct ImmI32Immediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  ImmI32Immediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  ImmI32Immediate(Decoder* decoder, const uint8_t* pc, ValidationTag = {}) {
     std::tie(value, length) = decoder->read_i32v<ValidationTag>(pc, "immi32");
   }
 };
@@ -417,7 +422,7 @@ struct ImmI64Immediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  ImmI64Immediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  ImmI64Immediate(Decoder* decoder, const uint8_t* pc, ValidationTag = {}) {
     std::tie(value, length) = decoder->read_i64v<ValidationTag>(pc, "immi64");
   }
 };
@@ -427,7 +432,7 @@ struct ImmF32Immediate {
   uint32_t length = 4;
 
   template <typename ValidationTag>
-  ImmF32Immediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  ImmF32Immediate(Decoder* decoder, const uint8_t* pc, ValidationTag = {}) {
     // We can't use base::bit_cast here because calling any helper function
     // that returns a float would potentially flip NaN bits per C++ semantics,
     // so we have to inline the memcpy call directly.
@@ -441,7 +446,7 @@ struct ImmF64Immediate {
   uint32_t length = 8;
 
   template <typename ValidationTag>
-  ImmF64Immediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  ImmF64Immediate(Decoder* decoder, const uint8_t* pc, ValidationTag = {}) {
     // Avoid base::bit_cast because it might not preserve the signalling bit
     // of a NaN.
     uint64_t tmp = decoder->read_u64<ValidationTag>(pc, "immf64");
@@ -450,12 +455,52 @@ struct ImmF64Immediate {
 };
 
 struct MemoryIndexImmediate {
-  uint8_t index = 0;
+  uint32_t index = 0;
+  const WasmMemory* memory = nullptr;
+  uint32_t length;
+
+  template <typename ValidationTag>
+  MemoryIndexImmediate(Decoder* decoder, const uint8_t* pc,
+                       ValidationTag = {}) {
+    std::tie(index, length) =
+        decoder->read_u32v<ValidationTag>(pc, "memory index");
+  }
+};
+
+struct BrOnCastFlags {
+  enum Values {
+    SRC_IS_NULL = 1,
+    RES_IS_NULL = 1 << 1,
+  };
+
+  bool src_is_null = false;
+  bool res_is_null = false;
+
+  BrOnCastFlags() = default;
+  explicit BrOnCastFlags(uint8_t value)
+      : src_is_null((value & BrOnCastFlags::SRC_IS_NULL) != 0),
+        res_is_null((value & BrOnCastFlags::RES_IS_NULL) != 0) {
+    DCHECK_LE(value, BrOnCastFlags::SRC_IS_NULL | BrOnCastFlags::RES_IS_NULL);
+  }
+};
+
+struct BrOnCastImmediate {
+  BrOnCastFlags flags;
+  uint8_t raw_value = 0;
   uint32_t length = 1;
 
   template <typename ValidationTag>
-  MemoryIndexImmediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
-    index = decoder->read_u8<ValidationTag>(pc, "memory index");
+  BrOnCastImmediate(Decoder* decoder, const uint8_t* pc, ValidationTag = {}) {
+    raw_value = decoder->read_u8<ValidationTag>(pc, "br_on_cast flags");
+    if (raw_value > (BrOnCastFlags::SRC_IS_NULL | BrOnCastFlags::RES_IS_NULL)) {
+      if constexpr (ValidationTag::full_validation) {
+        decoder->errorf(pc, "invalid br_on_cast flags %u", raw_value);
+      } else {
+        decoder->MarkError();
+      }
+      return;
+    }
+    flags = BrOnCastFlags(raw_value);
   }
 };
 
@@ -466,7 +511,7 @@ struct IndexImmediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  IndexImmediate(Decoder* decoder, const byte* pc, const char* name,
+  IndexImmediate(Decoder* decoder, const uint8_t* pc, const char* name,
                  ValidationTag = {}) {
     std::tie(index, length) = decoder->read_u32v<ValidationTag>(pc, name);
   }
@@ -476,7 +521,7 @@ struct TagIndexImmediate : public IndexImmediate {
   const WasmTag* tag = nullptr;
 
   template <typename ValidationTag>
-  TagIndexImmediate(Decoder* decoder, const byte* pc,
+  TagIndexImmediate(Decoder* decoder, const uint8_t* pc,
                     ValidationTag validate = {})
       : IndexImmediate(decoder, pc, "tag index", validate) {}
 };
@@ -485,7 +530,7 @@ struct GlobalIndexImmediate : public IndexImmediate {
   const WasmGlobal* global = nullptr;
 
   template <typename ValidationTag>
-  GlobalIndexImmediate(Decoder* decoder, const byte* pc,
+  GlobalIndexImmediate(Decoder* decoder, const uint8_t* pc,
                        ValidationTag validate = {})
       : IndexImmediate(decoder, pc, "global index", validate) {}
 };
@@ -494,7 +539,7 @@ struct SigIndexImmediate : public IndexImmediate {
   const FunctionSig* sig = nullptr;
 
   template <typename ValidationTag>
-  SigIndexImmediate(Decoder* decoder, const byte* pc,
+  SigIndexImmediate(Decoder* decoder, const uint8_t* pc,
                     ValidationTag validate = {})
       : IndexImmediate(decoder, pc, "signature index", validate) {}
 };
@@ -503,7 +548,7 @@ struct StructIndexImmediate : public IndexImmediate {
   const StructType* struct_type = nullptr;
 
   template <typename ValidationTag>
-  StructIndexImmediate(Decoder* decoder, const byte* pc,
+  StructIndexImmediate(Decoder* decoder, const uint8_t* pc,
                        ValidationTag validate = {})
       : IndexImmediate(decoder, pc, "struct index", validate) {}
 };
@@ -512,7 +557,7 @@ struct ArrayIndexImmediate : public IndexImmediate {
   const ArrayType* array_type = nullptr;
 
   template <typename ValidationTag>
-  ArrayIndexImmediate(Decoder* decoder, const byte* pc,
+  ArrayIndexImmediate(Decoder* decoder, const uint8_t* pc,
                       ValidationTag validate = {})
       : IndexImmediate(decoder, pc, "array index", validate) {}
 };
@@ -521,7 +566,7 @@ struct CallFunctionImmediate : public IndexImmediate {
   const FunctionSig* sig = nullptr;
 
   template <typename ValidationTag>
-  CallFunctionImmediate(Decoder* decoder, const byte* pc,
+  CallFunctionImmediate(Decoder* decoder, const uint8_t* pc,
                         ValidationTag validate = {})
       : IndexImmediate(decoder, pc, "function index", validate) {}
 };
@@ -532,7 +577,7 @@ struct SelectTypeImmediate {
 
   template <typename ValidationTag>
   SelectTypeImmediate(const WasmFeatures& enabled, Decoder* decoder,
-                      const byte* pc, ValidationTag = {}) {
+                      const uint8_t* pc, ValidationTag = {}) {
     uint8_t num_types;
     std::tie(num_types, length) =
         decoder->read_u32v<ValidationTag>(pc, "number of select types");
@@ -568,7 +613,7 @@ struct BlockTypeImmediate {
 
   template <typename ValidationTag>
   BlockTypeImmediate(const WasmFeatures& enabled, Decoder* decoder,
-                     const byte* pc, ValidationTag = {}) {
+                     const uint8_t* pc, ValidationTag = {}) {
     int64_t block_type;
     std::tie(block_type, length) =
         decoder->read_i33v<ValidationTag>(pc, "block type");
@@ -599,8 +644,8 @@ struct BlockTypeImmediate {
   uint32_t out_arity() const {
     return static_cast<uint32_t>(sig.return_count());
   }
-  ValueType in_type(uint32_t index) { return sig.GetParam(index); }
-  ValueType out_type(uint32_t index) { return sig.GetReturn(index); }
+  ValueType in_type(uint32_t index) const { return sig.GetParam(index); }
+  ValueType out_type(uint32_t index) const { return sig.GetReturn(index); }
 };
 
 struct BranchDepthImmediate {
@@ -608,7 +653,8 @@ struct BranchDepthImmediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  BranchDepthImmediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  BranchDepthImmediate(Decoder* decoder, const uint8_t* pc,
+                       ValidationTag = {}) {
     std::tie(depth, length) =
         decoder->read_u32v<ValidationTag>(pc, "branch depth");
   }
@@ -620,7 +666,8 @@ struct FieldImmediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  FieldImmediate(Decoder* decoder, const byte* pc, ValidationTag validate = {})
+  FieldImmediate(Decoder* decoder, const uint8_t* pc,
+                 ValidationTag validate = {})
       : struct_imm(decoder, pc, validate),
         field_imm(decoder, pc + struct_imm.length, "field index", validate),
         length(struct_imm.length + field_imm.length) {}
@@ -633,7 +680,7 @@ struct CallIndirectImmediate {
   const FunctionSig* sig = nullptr;
 
   template <typename ValidationTag>
-  CallIndirectImmediate(Decoder* decoder, const byte* pc,
+  CallIndirectImmediate(Decoder* decoder, const uint8_t* pc,
                         ValidationTag validate = {})
       : sig_imm(decoder, pc, "singature index", validate),
         table_imm(decoder, pc + sig_imm.length, "table index", validate),
@@ -642,11 +689,12 @@ struct CallIndirectImmediate {
 
 struct BranchTableImmediate {
   uint32_t table_count;
-  const byte* start;
-  const byte* table;
+  const uint8_t* start;
+  const uint8_t* table;
 
   template <typename ValidationTag>
-  BranchTableImmediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  BranchTableImmediate(Decoder* decoder, const uint8_t* pc,
+                       ValidationTag = {}) {
     start = pc;
     uint32_t len;
     std::tie(table_count, len) =
@@ -675,7 +723,7 @@ class BranchTableIterator {
     while (has_next()) next();
     return static_cast<uint32_t>(pc_ - start_);
   }
-  const byte* pc() { return pc_; }
+  const uint8_t* pc() { return pc_; }
 
   BranchTableIterator(Decoder* decoder, const BranchTableImmediate& imm)
       : decoder_(decoder),
@@ -685,30 +733,36 @@ class BranchTableIterator {
 
  private:
   Decoder* const decoder_;
-  const byte* start_;
-  const byte* pc_;
+  const uint8_t* start_;
+  const uint8_t* pc_;
   uint32_t index_ = 0;          // the current index.
   const uint32_t table_count_;  // the count of entries, not including default.
 };
 
 struct MemoryAccessImmediate {
   uint32_t alignment;
+  uint32_t mem_index;
   uint64_t offset;
-  uint32_t length = 0;
+  const WasmMemory* memory = nullptr;
+
+  uint32_t length;
 
   template <typename ValidationTag>
-  V8_INLINE MemoryAccessImmediate(Decoder* decoder, const byte* pc,
+  V8_INLINE MemoryAccessImmediate(Decoder* decoder, const uint8_t* pc,
                                   uint32_t max_alignment, bool is_memory64,
+                                  bool multi_memory_enabled,
                                   ValidationTag = {}) {
-    // Check for the fast path (two single-byte LEBs).
+    // Check for the fast path (two single-byte LEBs, mem index 0).
     const bool two_bytes = !ValidationTag::validate || decoder->end() - pc >= 2;
-    const bool use_fast_path = two_bytes && !((pc[0] | pc[1]) & 0x80);
+    const bool use_fast_path = two_bytes && !(pc[0] & 0xc0) && !(pc[1] & 0x80);
     if (V8_LIKELY(use_fast_path)) {
       alignment = pc[0];
+      mem_index = 0;
       offset = pc[1];
       length = 2;
     } else {
-      ConstructSlow<ValidationTag>(decoder, pc, max_alignment, is_memory64);
+      ConstructSlow<ValidationTag>(decoder, pc, max_alignment, is_memory64,
+                                   multi_memory_enabled);
     }
     if (!VALIDATE(alignment <= max_alignment)) {
       DecodeError<ValidationTag>(
@@ -722,21 +776,32 @@ struct MemoryAccessImmediate {
  private:
   template <typename ValidationTag>
   V8_NOINLINE V8_PRESERVE_MOST void ConstructSlow(Decoder* decoder,
-                                                  const byte* pc,
+                                                  const uint8_t* pc,
                                                   uint32_t max_alignment,
-                                                  bool is_memory64) {
+                                                  bool is_memory64,
+                                                  bool multi_memory_enabled) {
     uint32_t alignment_length;
     std::tie(alignment, alignment_length) =
         decoder->read_u32v<ValidationTag>(pc, "alignment");
+    length = alignment_length;
+    if (multi_memory_enabled && (alignment & 0x40)) {
+      alignment &= ~0x40;
+      uint32_t mem_index_length;
+      std::tie(mem_index, mem_index_length) =
+          decoder->read_u32v<ValidationTag>(pc + length, "memory index");
+      length += mem_index_length;
+    } else {
+      mem_index = 0;
+    }
     uint32_t offset_length;
     if (is_memory64) {
       std::tie(offset, offset_length) =
-          decoder->read_u64v<ValidationTag>(pc + alignment_length, "offset");
+          decoder->read_u64v<ValidationTag>(pc + length, "offset");
     } else {
       std::tie(offset, offset_length) =
-          decoder->read_u32v<ValidationTag>(pc + alignment_length, "offset");
+          decoder->read_u32v<ValidationTag>(pc + length, "offset");
     }
-    length = alignment_length + offset_length;
+    length += offset_length;
   }
 };
 
@@ -746,7 +811,7 @@ struct SimdLaneImmediate {
   uint32_t length = 1;
 
   template <typename ValidationTag>
-  SimdLaneImmediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  SimdLaneImmediate(Decoder* decoder, const uint8_t* pc, ValidationTag = {}) {
     lane = decoder->read_u8<ValidationTag>(pc, "lane");
   }
 };
@@ -756,7 +821,7 @@ struct Simd128Immediate {
   uint8_t value[kSimd128Size] = {0};
 
   template <typename ValidationTag>
-  Simd128Immediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  Simd128Immediate(Decoder* decoder, const uint8_t* pc, ValidationTag = {}) {
     for (uint32_t i = 0; i < kSimd128Size; ++i) {
       value[i] = decoder->read_u8<ValidationTag>(pc + i, "value");
     }
@@ -769,7 +834,7 @@ struct MemoryInitImmediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  MemoryInitImmediate(Decoder* decoder, const byte* pc,
+  MemoryInitImmediate(Decoder* decoder, const uint8_t* pc,
                       ValidationTag validate = {})
       : data_segment(decoder, pc, "data segment index", validate),
         memory(decoder, pc + data_segment.length, validate),
@@ -777,15 +842,15 @@ struct MemoryInitImmediate {
 };
 
 struct MemoryCopyImmediate {
-  MemoryIndexImmediate memory_src;
   MemoryIndexImmediate memory_dst;
+  MemoryIndexImmediate memory_src;
   uint32_t length;
 
   template <typename ValidationTag>
-  MemoryCopyImmediate(Decoder* decoder, const byte* pc,
+  MemoryCopyImmediate(Decoder* decoder, const uint8_t* pc,
                       ValidationTag validate = {})
-      : memory_src(decoder, pc, validate),
-        memory_dst(decoder, pc + memory_src.length, validate),
+      : memory_dst(decoder, pc, validate),
+        memory_src(decoder, pc + memory_dst.length, validate),
         length(memory_src.length + memory_dst.length) {}
 };
 
@@ -795,7 +860,7 @@ struct TableInitImmediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  TableInitImmediate(Decoder* decoder, const byte* pc,
+  TableInitImmediate(Decoder* decoder, const uint8_t* pc,
                      ValidationTag validate = {})
       : element_segment(decoder, pc, "element segment index", validate),
         table(decoder, pc + element_segment.length, "table index", validate),
@@ -808,7 +873,7 @@ struct TableCopyImmediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  TableCopyImmediate(Decoder* decoder, const byte* pc,
+  TableCopyImmediate(Decoder* decoder, const uint8_t* pc,
                      ValidationTag validate = {})
       : table_dst(decoder, pc, "table index", validate),
         table_src(decoder, pc + table_dst.length, "table index", validate),
@@ -821,7 +886,7 @@ struct HeapTypeImmediate {
 
   template <typename ValidationTag>
   HeapTypeImmediate(const WasmFeatures& enabled, Decoder* decoder,
-                    const byte* pc, ValidationTag = {}) {
+                    const uint8_t* pc, ValidationTag = {}) {
     std::tie(type, length) =
         value_type_reader::read_heap_type<ValidationTag>(decoder, pc, enabled);
   }
@@ -832,7 +897,8 @@ struct StringConstImmediate {
   uint32_t length;
 
   template <typename ValidationTag>
-  StringConstImmediate(Decoder* decoder, const byte* pc, ValidationTag = {}) {
+  StringConstImmediate(Decoder* decoder, const uint8_t* pc,
+                       ValidationTag = {}) {
     std::tie(index, length) =
         decoder->read_u32v<ValidationTag>(pc, "stringref literal index");
   }
@@ -841,18 +907,18 @@ struct StringConstImmediate {
 template <bool full_validation>
 struct PcForErrors {
   static_assert(full_validation == false);
-  explicit PcForErrors(const byte* /* pc */) {}
+  explicit PcForErrors(const uint8_t* /* pc */) {}
 
-  const byte* pc() const { return nullptr; }
+  const uint8_t* pc() const { return nullptr; }
 };
 
 template <>
 struct PcForErrors<true> {
-  const byte* pc_for_errors = nullptr;
+  const uint8_t* pc_for_errors = nullptr;
 
-  explicit PcForErrors(const byte* pc) : pc_for_errors(pc) {}
+  explicit PcForErrors(const uint8_t* pc) : pc_for_errors(pc) {}
 
-  const byte* pc() const { return pc_for_errors; }
+  const uint8_t* pc() const { return pc_for_errors; }
 };
 
 // An entry on the value stack.
@@ -860,7 +926,7 @@ template <typename ValidationTag>
 struct ValueBase : public PcForErrors<ValidationTag::full_validation> {
   ValueType type = kWasmVoid;
 
-  ValueBase(const byte* pc, ValueType type)
+  ValueBase(const uint8_t* pc, ValueType type)
       : PcForErrors<ValidationTag::full_validation>(pc), type(type) {}
 };
 
@@ -990,23 +1056,23 @@ struct ControlBase : public PcForErrors<ValidationTag::full_validation> {
     Value* result)                                                             \
   F(RefNull, ValueType type, Value* result)                                    \
   F(RefFunc, uint32_t function_index, Value* result)                           \
-  F(StructNew, const StructIndexImmediate& imm, const Value& rtt,              \
-    const Value args[], Value* result)                                         \
-  F(StructNewDefault, const StructIndexImmediate& imm, const Value& rtt,       \
+  F(StructNew, const StructIndexImmediate& imm, const Value args[],            \
     Value* result)                                                             \
+  F(StructNewDefault, const StructIndexImmediate& imm, Value* result)          \
   F(ArrayNew, const ArrayIndexImmediate& imm, const Value& length,             \
-    const Value& initial_value, const Value& rtt, Value* result)               \
+    const Value& initial_value, Value* result)                                 \
   F(ArrayNewDefault, const ArrayIndexImmediate& imm, const Value& length,      \
-    const Value& rtt, Value* result)                                           \
+    Value* result)                                                             \
   F(ArrayNewFixed, const ArrayIndexImmediate& imm,                             \
-    const base::Vector<Value>& elements, const Value& rtt, Value* result)      \
+    const IndexImmediate& length_imm, const Value elements[], Value* result)   \
   F(ArrayNewSegment, const ArrayIndexImmediate& array_imm,                     \
     const IndexImmediate& data_segment, const Value& offset,                   \
-    const Value& length, const Value& rtt, Value* result)                      \
+    const Value& length, Value* result)                                        \
   F(I31New, const Value& input, Value* result)                                 \
-  F(RttCanon, uint32_t type_index, Value* result)                              \
   F(StringConst, const StringConstImmediate& imm, Value* result)
 
+// TODO(manoskouk): Refactor table.init, table.copy to have individual named
+// args.
 #define INTERFACE_NON_CONSTANT_FUNCTIONS(F) /*       force 80 columns       */ \
   /* Control: */                                                               \
   F(Block, Control* block)                                                     \
@@ -1044,8 +1110,9 @@ struct ControlBase : public PcForErrors<ValidationTag::full_validation> {
     const Value& index, const Value& value)                                    \
   F(StoreLane, StoreType type, const MemoryAccessImmediate& imm,               \
     const Value& index, const Value& value, const uint8_t laneidx)             \
-  F(CurrentMemoryPages, Value* result)                                         \
-  F(MemoryGrow, const Value& value, Value* result)                             \
+  F(CurrentMemoryPages, const MemoryIndexImmediate& imm, Value* result)        \
+  F(MemoryGrow, const MemoryIndexImmediate& imm, const Value& value,           \
+    Value* result)                                                             \
   F(CallDirect, const CallFunctionImmediate& imm, const Value args[],          \
     Value returns[])                                                           \
   F(CallIndirect, const Value& index, const CallIndirectImmediate& imm,        \
@@ -1061,18 +1128,18 @@ struct ControlBase : public PcForErrors<ValidationTag::full_validation> {
     bool pass_null_along_branch, Value* result_on_fallthrough)                 \
   F(BrOnNonNull, const Value& ref_object, Value* result, uint32_t depth,       \
     bool drop_null_on_fallthrough)                                             \
-  F(SimdOp, WasmOpcode opcode, base::Vector<Value> args, Value* result)        \
+  F(SimdOp, WasmOpcode opcode, const Value args[], Value* result)              \
   F(SimdLaneOp, WasmOpcode opcode, const SimdLaneImmediate& imm,               \
-    const base::Vector<Value> inputs, Value* result)                           \
+    base::Vector<const Value> inputs, Value* result)                           \
   F(Simd8x16ShuffleOp, const Simd128Immediate& imm, const Value& input0,       \
     const Value& input1, Value* result)                                        \
-  F(Throw, const TagIndexImmediate& imm, const base::Vector<Value>& args)      \
+  F(Throw, const TagIndexImmediate& imm, const Value args[])                   \
   F(Rethrow, Control* block)                                                   \
   F(CatchException, const TagIndexImmediate& imm, Control* block,              \
     base::Vector<Value> caught_values)                                         \
   F(Delegate, uint32_t depth, Control* block)                                  \
   F(CatchAll, Control* block)                                                  \
-  F(AtomicOp, WasmOpcode opcode, base::Vector<Value> args,                     \
+  F(AtomicOp, WasmOpcode opcode, const Value args[], const size_t argc,        \
     const MemoryAccessImmediate& imm, Value* result)                           \
   F(AtomicFence)                                                               \
   F(MemoryInit, const MemoryInitImmediate& imm, const Value& dst,              \
@@ -1082,9 +1149,9 @@ struct ControlBase : public PcForErrors<ValidationTag::full_validation> {
     const Value& src, const Value& size)                                       \
   F(MemoryFill, const MemoryIndexImmediate& imm, const Value& dst,             \
     const Value& value, const Value& size)                                     \
-  F(TableInit, const TableInitImmediate& imm, base::Vector<Value> args)        \
+  F(TableInit, const TableInitImmediate& imm, const Value args[])              \
   F(ElemDrop, const IndexImmediate& imm)                                       \
-  F(TableCopy, const TableCopyImmediate& imm, base::Vector<Value> args)        \
+  F(TableCopy, const TableCopyImmediate& imm, const Value args[])              \
   F(TableGrow, const IndexImmediate& imm, const Value& value,                  \
     const Value& delta, Value* result)                                         \
   F(TableSize, const IndexImmediate& imm, Value* result)                       \
@@ -1099,32 +1166,36 @@ struct ControlBase : public PcForErrors<ValidationTag::full_validation> {
   F(ArraySet, const Value& array_obj, const ArrayIndexImmediate& imm,          \
     const Value& index, const Value& value)                                    \
   F(ArrayLen, const Value& array_obj, Value* result)                           \
-  F(ArrayCopy, const Value& src, const Value& src_index, const Value& dst,     \
-    const Value& dst_index, const Value& length)                               \
+  F(ArrayCopy, const Value& dst, const Value& dst_index, const Value& src,     \
+    const Value& src_index, const ArrayIndexImmediate& src_imm,                \
+    const Value& length)                                                       \
   F(ArrayFill, const ArrayIndexImmediate& imm, const Value& array,             \
     const Value& index, const Value& value, const Value& length)               \
+  F(ArrayInitSegment, const ArrayIndexImmediate& array_imm,                    \
+    const IndexImmediate& segment_imm, const Value& array,                     \
+    const Value& array_index, const Value& segment_offset,                     \
+    const Value& length)                                                       \
   F(I31GetS, const Value& input, Value* result)                                \
   F(I31GetU, const Value& input, Value* result)                                \
-  F(RefTest, const Value& obj, const Value& rtt, Value* result,                \
+  F(RefTest, uint32_t ref_index, const Value& obj, Value* result,              \
     bool null_succeeds)                                                        \
   F(RefTestAbstract, const Value& obj, HeapType type, Value* result,           \
     bool null_succeeds)                                                        \
-  F(RefCast, const Value& obj, const Value& rtt, Value* result,                \
+  F(RefCast, uint32_t ref_index, const Value& obj, Value* result,              \
     bool null_succeeds)                                                        \
   F(RefCastAbstract, const Value& obj, HeapType type, Value* result,           \
     bool null_succeeds)                                                        \
   F(AssertNullTypecheck, const Value& obj, Value* result)                      \
   F(AssertNotNullTypecheck, const Value& obj, Value* result)                   \
-  F(BrOnCast, const Value& obj, const Value& rtt, Value* result_on_branch,     \
+  F(BrOnCast, uint32_t ref_index, const Value& obj, Value* result_on_branch,   \
     uint32_t depth, bool null_succeeds)                                        \
-  F(BrOnCastFail, const Value& obj, const Value& rtt,                          \
+  F(BrOnCastFail, uint32_t ref_index, const Value& obj,                        \
     Value* result_on_fallthrough, uint32_t depth, bool null_succeeds)          \
   F(BrOnCastAbstract, const Value& obj, HeapType type,                         \
     Value* result_on_branch, uint32_t depth, bool null_succeeds)               \
   F(BrOnCastFailAbstract, const Value& obj, HeapType type,                     \
     Value* result_on_fallthrough, uint32_t depth, bool null_succeeds)          \
   F(RefIsStruct, const Value& object, Value* result)                           \
-  F(RefIsEq, const Value& object, Value* result)                               \
   F(RefIsI31, const Value& object, Value* result)                              \
   F(RefIsArray, const Value& object, Value* result)                            \
   F(RefAsStruct, const Value& object, Value* result)                           \
@@ -1252,6 +1323,7 @@ class FastZoneVector {
   }
 
   void shrink_to(uint32_t new_size) {
+    static_assert(std::is_trivially_destructible_v<T>);
     DCHECK_GE(size(), new_size);
     end_ = begin_ + new_size;
   }
@@ -1288,7 +1360,7 @@ class FastZoneVector {
         size_t{8}, base::bits::RoundUpToPowerOfTwo(size() + slots_needed));
     CHECK_GE(kMaxUInt32, new_capacity);
     DCHECK_LT(capacity_end_ - begin_, new_capacity);
-    T* new_begin = zone->template NewArray<T>(new_capacity);
+    T* new_begin = zone->template AllocateArray<T>(new_capacity);
     if (begin_) {
       for (T *ptr = begin_, *new_ptr = new_begin; ptr != end_;
            ++ptr, ++new_ptr) {
@@ -1317,8 +1389,9 @@ class WasmDecoder : public Decoder {
 
  public:
   WasmDecoder(Zone* zone, const WasmModule* module, WasmFeatures enabled,
-              WasmFeatures* detected, const FunctionSig* sig, const byte* start,
-              const byte* end, uint32_t buffer_offset = 0)
+              WasmFeatures* detected, const FunctionSig* sig,
+              const uint8_t* start, const uint8_t* end,
+              uint32_t buffer_offset = 0)
       : Decoder(start, end, buffer_offset),
         zone_(zone),
         module_(module),
@@ -1354,7 +1427,7 @@ class WasmDecoder : public Decoder {
   // The decoded locals will be appended to {this->local_types_}.
   // The decoder's pc is not advanced.
   // The total length of decoded locals is returned.
-  uint32_t DecodeLocals(const byte* pc) {
+  uint32_t DecodeLocals(const uint8_t* pc) {
     DCHECK_NULL(local_types_);
     DCHECK_EQ(0, num_locals_);
 
@@ -1420,7 +1493,7 @@ class WasmDecoder : public Decoder {
 
     if (num_locals_ > 0) {
       // Now build the array of local types from the parsed entries.
-      local_types_ = zone_->NewArray<ValueType>(num_locals_);
+      local_types_ = zone_->AllocateArray<ValueType>(num_locals_);
       ValueType* locals_ptr = local_types_;
 
       if (sig_->parameter_count() > 0) {
@@ -1449,7 +1522,8 @@ class WasmDecoder : public Decoder {
   // variables that are assigned in the loop starting at {pc}. The additional
   // position at the end of the vector represents possible assignments to
   // the instance cache.
-  static BitVector* AnalyzeLoopAssignment(WasmDecoder* decoder, const byte* pc,
+  static BitVector* AnalyzeLoopAssignment(WasmDecoder* decoder,
+                                          const uint8_t* pc,
                                           uint32_t locals_count, Zone* zone,
                                           bool* loop_is_innermost = nullptr) {
     if (pc >= decoder->end()) return nullptr;
@@ -1498,7 +1572,7 @@ class WasmDecoder : public Decoder {
     return VALIDATE(decoder->ok()) ? assigned : nullptr;
   }
 
-  bool Validate(const byte* pc, TagIndexImmediate& imm) {
+  bool Validate(const uint8_t* pc, TagIndexImmediate& imm) {
     size_t num_tags = module_->tags.size();
     if (!VALIDATE(imm.index < num_tags)) {
       DecodeError(pc, "Invalid tag index: %u", imm.index);
@@ -1509,7 +1583,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, GlobalIndexImmediate& imm) {
+  bool Validate(const uint8_t* pc, GlobalIndexImmediate& imm) {
     // We compare with the current size of the globals vector. This is important
     // if we are decoding a constant expression in the global section.
     size_t num_globals = module_->globals.size();
@@ -1537,7 +1611,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, SigIndexImmediate& imm) {
+  bool Validate(const uint8_t* pc, SigIndexImmediate& imm) {
     if (!VALIDATE(module_->has_signature(imm.index))) {
       DecodeError(pc, "invalid signature index: %u", imm.index);
       return false;
@@ -1546,7 +1620,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, StructIndexImmediate& imm) {
+  bool Validate(const uint8_t* pc, StructIndexImmediate& imm) {
     if (!VALIDATE(module_->has_struct(imm.index))) {
       DecodeError(pc, "invalid struct index: %u", imm.index);
       return false;
@@ -1555,7 +1629,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, FieldImmediate& imm) {
+  bool Validate(const uint8_t* pc, FieldImmediate& imm) {
     if (!Validate(pc, imm.struct_imm)) return false;
     if (!VALIDATE(imm.field_imm.index <
                   imm.struct_imm.struct_type->field_count())) {
@@ -1566,7 +1640,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, ArrayIndexImmediate& imm) {
+  bool Validate(const uint8_t* pc, ArrayIndexImmediate& imm) {
     if (!VALIDATE(module_->has_array(imm.index))) {
       DecodeError(pc, "invalid array index: %u", imm.index);
       return false;
@@ -1584,7 +1658,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, CallFunctionImmediate& imm) {
+  bool Validate(const uint8_t* pc, CallFunctionImmediate& imm) {
     size_t num_functions = module_->functions.size();
     if (!VALIDATE(imm.index < num_functions)) {
       DecodeError(pc, "function index #%u is out of bounds", imm.index);
@@ -1595,7 +1669,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, CallIndirectImmediate& imm) {
+  bool Validate(const uint8_t* pc, CallIndirectImmediate& imm) {
     if (!ValidateSignature(pc, imm.sig_imm)) return false;
     if (!ValidateTable(pc + imm.sig_imm.length, imm.table_imm)) {
       return false;
@@ -1623,7 +1697,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, BranchDepthImmediate& imm,
+  bool Validate(const uint8_t* pc, BranchDepthImmediate& imm,
                 size_t control_depth) {
     if (!VALIDATE(imm.depth < control_depth)) {
       DecodeError(pc, "invalid branch depth: %u", imm.depth);
@@ -1632,7 +1706,8 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, BranchTableImmediate& imm, size_t block_depth) {
+  bool Validate(const uint8_t* pc, BranchTableImmediate& imm,
+                size_t block_depth) {
     if (!VALIDATE(imm.table_count <= kV8MaxWasmFunctionBrTableSize)) {
       DecodeError(pc, "invalid table count (> max br_table size): %u",
                   imm.table_count);
@@ -1641,7 +1716,7 @@ class WasmDecoder : public Decoder {
     return checkAvailable(imm.table_count);
   }
 
-  bool Validate(const byte* pc, WasmOpcode opcode, SimdLaneImmediate& imm) {
+  bool Validate(const uint8_t* pc, WasmOpcode opcode, SimdLaneImmediate& imm) {
     uint8_t num_lanes = 0;
     switch (opcode) {
       case kExprF64x2ExtractLane:
@@ -1686,7 +1761,7 @@ class WasmDecoder : public Decoder {
     }
   }
 
-  bool Validate(const byte* pc, Simd128Immediate& imm) {
+  bool Validate(const uint8_t* pc, Simd128Immediate& imm) {
     uint8_t max_lane = 0;
     for (uint32_t i = 0; i < kSimd128Size; ++i) {
       max_lane = std::max(max_lane, imm.value[i]);
@@ -1699,7 +1774,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, BlockTypeImmediate& imm) {
+  bool Validate(const uint8_t* pc, BlockTypeImmediate& imm) {
     if (imm.sig.all().begin() == nullptr) {
       // Then use {sig_index} to initialize the signature.
       if (!VALIDATE(module_->has_signature(imm.sig_index))) {
@@ -1719,37 +1794,61 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, MemoryIndexImmediate& imm) {
-    if (!VALIDATE(this->module_->has_memory)) {
-      this->DecodeError(pc, "memory instruction with no memory");
+  bool Validate(const uint8_t* pc, MemoryIndexImmediate& imm) {
+    size_t num_memories = module_->memories.size();
+    if (!VALIDATE(this->enabled_.has_multi_memory() ||
+                  (imm.index == 0 && imm.length == 1))) {
+      DecodeError(pc,
+                  "expected a single 0 byte for the memory index, found %u "
+                  "encoded in %u bytes; pass --experimental-wasm-multi-memory "
+                  "to enable multi-memory support",
+                  imm.index, imm.length);
       return false;
     }
-    if (!VALIDATE(imm.index == uint8_t{0})) {
-      DecodeError(pc, "expected memory index 0, found %u", imm.index);
+
+    if (!VALIDATE(imm.index < num_memories)) {
+      DecodeError(pc,
+                  "memory index %u exceeds number of declared memories (%zu)",
+                  imm.index, num_memories);
       return false;
     }
+    V8_ASSUME(imm.index < num_memories);
+
+    imm.memory = this->module_->memories.data() + imm.index;
     return true;
   }
 
-  bool Validate(const byte* pc, MemoryAccessImmediate& imm) {
-    if (!VALIDATE(this->module_->has_memory)) {
-      this->DecodeError(pc, "memory instruction with no memory");
+  bool Validate(const uint8_t* pc, MemoryAccessImmediate& imm) {
+    size_t num_memories = module_->memories.size();
+    if (!VALIDATE(imm.mem_index < num_memories)) {
+      DecodeError(pc,
+                  "memory index %u exceeds number of declared memories (%zu)",
+                  imm.mem_index, num_memories);
+      return false;
+    }
+    if (!VALIDATE(this->module_->memories[0].is_memory64 ||
+                  imm.offset <= kMaxUInt32)) {
+      this->DecodeError(pc, "memory offset outside 32-bit range: %" PRIu64,
+                        imm.offset);
       return false;
     }
+    V8_ASSUME(imm.mem_index < num_memories);
+
+    imm.memory = this->module_->memories.data() + imm.mem_index;
     return true;
   }
 
-  bool Validate(const byte* pc, MemoryInitImmediate& imm) {
+  bool Validate(const uint8_t* pc, MemoryInitImmediate& imm) {
     return ValidateDataSegment(pc, imm.data_segment) &&
            Validate(pc + imm.data_segment.length, imm.memory);
   }
 
-  bool Validate(const byte* pc, MemoryCopyImmediate& imm) {
+  bool Validate(const uint8_t* pc, MemoryCopyImmediate& imm) {
     return Validate(pc, imm.memory_src) &&
            Validate(pc + imm.memory_src.length, imm.memory_dst);
   }
 
-  bool Validate(const byte* pc, TableInitImmediate& imm) {
+  bool Validate(const uint8_t* pc, TableInitImmediate& imm) {
     if (!ValidateElementSegment(pc, imm.element_segment)) return false;
     if (!ValidateTable(pc + imm.element_segment.length, imm.table)) {
       return false;
@@ -1765,7 +1864,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, TableCopyImmediate& imm) {
+  bool Validate(const uint8_t* pc, TableCopyImmediate& imm) {
     if (!ValidateTable(pc, imm.table_src)) return false;
     if (!ValidateTable(pc + imm.table_src.length, imm.table_dst)) return false;
     size_t num_tables = module_->tables.size();
@@ -1781,7 +1880,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, StringConstImmediate& imm) {
+  bool Validate(const uint8_t* pc, StringConstImmediate& imm) {
     if (!VALIDATE(imm.index < module_->stringref_literals.size())) {
       DecodeError(pc, "Invalid string literal index: %u", imm.index);
       return false;
@@ -1791,7 +1890,7 @@ class WasmDecoder : public Decoder {
 
   // The following Validate* functions all validate an IndexImmediate, albeit
   // differently according to context.
-  bool ValidateTable(const byte* pc, IndexImmediate& imm) {
+  bool ValidateTable(const uint8_t* pc, IndexImmediate& imm) {
     if (imm.index > 0 || imm.length > 1) {
       this->detected_->Add(kFeature_reftypes);
     }
@@ -1804,7 +1903,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool ValidateElementSegment(const byte* pc, IndexImmediate& imm) {
+  bool ValidateElementSegment(const uint8_t* pc, IndexImmediate& imm) {
     size_t num_elem_segments = module_->elem_segments.size();
     if (!VALIDATE(imm.index < num_elem_segments)) {
       DecodeError(pc, "invalid element segment index: %u", imm.index);
@@ -1814,7 +1913,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool ValidateLocal(const byte* pc, IndexImmediate& imm) {
+  bool ValidateLocal(const uint8_t* pc, IndexImmediate& imm) {
     if (!VALIDATE(imm.index < num_locals())) {
       DecodeError(pc, "invalid local index: %u", imm.index);
       return false;
@@ -1822,7 +1921,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool ValidateType(const byte* pc, IndexImmediate& imm) {
+  bool ValidateType(const uint8_t* pc, IndexImmediate& imm) {
     if (!VALIDATE(module_->has_type(imm.index))) {
       DecodeError(pc, "invalid type index: %u", imm.index);
       return false;
@@ -1830,7 +1929,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool ValidateSignature(const byte* pc, IndexImmediate& imm) {
+  bool ValidateSignature(const uint8_t* pc, IndexImmediate& imm) {
     if (!VALIDATE(module_->has_signature(imm.index))) {
       DecodeError(pc, "invalid signature index: %u", imm.index);
       return false;
@@ -1838,7 +1937,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool ValidateFunction(const byte* pc, IndexImmediate& imm) {
+  bool ValidateFunction(const uint8_t* pc, IndexImmediate& imm) {
     size_t num_functions = module_->functions.size();
     if (!VALIDATE(imm.index < num_functions)) {
       DecodeError(pc, "function index #%u is out of bounds", imm.index);
@@ -1853,7 +1952,7 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool ValidateDataSegment(const byte* pc, IndexImmediate& imm) {
+  bool ValidateDataSegment(const uint8_t* pc, IndexImmediate& imm) {
     if (!VALIDATE(imm.index < module_->num_declared_data_segments)) {
       DecodeError(pc, "invalid data segment index: %u", imm.index);
       return false;
@@ -1861,34 +1960,35 @@ class WasmDecoder : public Decoder {
     return true;
   }
 
-  bool Validate(const byte* pc, SelectTypeImmediate& imm) {
+  bool Validate(const uint8_t* pc, SelectTypeImmediate& imm) {
     return ValidateValueType(pc, imm.type);
   }
 
-  bool Validate(const byte* pc, HeapTypeImmediate& imm) {
+  bool Validate(const uint8_t* pc, HeapTypeImmediate& imm) {
     return ValidateHeapType(pc, imm.type);
   }
 
-  bool ValidateValueType(const byte* pc, ValueType type) {
+  bool ValidateValueType(const uint8_t* pc, ValueType type) {
     return value_type_reader::ValidateValueType<ValidationTag>(this, pc,
                                                                module_, type);
   }
 
-  bool ValidateHeapType(const byte* pc, HeapType type) {
+  bool ValidateHeapType(const uint8_t* pc, HeapType type) {
     return value_type_reader::ValidateHeapType<ValidationTag>(this, pc, module_,
                                                               type);
   }
 
   // Returns the length of the opcode under {pc}.
   template <typename... ImmediateObservers>
-  static uint32_t OpcodeLength(WasmDecoder* decoder, const byte* pc,
+  static uint32_t OpcodeLength(WasmDecoder* decoder, const uint8_t* pc,
                                ImmediateObservers&... ios) {
     WasmOpcode opcode = static_cast<WasmOpcode>(*pc);
     // We don't have information about the module here, so we just assume that
-    // memory64 is enabled when parsing memory access immediates. This is
-    // backwards-compatible; decode errors will be detected at another time when
-    // actually decoding that opcode.
+    // memory64 and multi-memory are enabled when parsing memory access
+    // immediates. This is backwards-compatible; decode errors will be detected
+    // at another time when actually decoding that opcode.
     constexpr bool kConservativelyAssumeMemory64 = true;
+    constexpr bool kConservativelyAssumeMultiMemory = true;
     switch (opcode) {
       /********** Control opcodes **********/
       case kExprUnreachable:
@@ -2022,7 +2122,8 @@ class WasmDecoder : public Decoder {
       FOREACH_LOAD_MEM_OPCODE(DECLARE_OPCODE_CASE)
       FOREACH_STORE_MEM_OPCODE(DECLARE_OPCODE_CASE) {
         MemoryAccessImmediate imm(decoder, pc + 1, UINT32_MAX,
-                                  kConservativelyAssumeMemory64, validate);
+                                  kConservativelyAssumeMemory64,
+                                  kConservativelyAssumeMultiMemory, validate);
         (ios.MemoryAccess(imm), ...);
         return 1 + imm.length;
       }
@@ -2116,14 +2217,17 @@ class WasmDecoder : public Decoder {
             return length + 1;
           FOREACH_SIMD_MEM_OPCODE(DECLARE_OPCODE_CASE) {
             MemoryAccessImmediate imm(decoder, pc + length, UINT32_MAX,
-                                      kConservativelyAssumeMemory64, validate);
+                                      kConservativelyAssumeMemory64,
+                                      kConservativelyAssumeMultiMemory,
+                                      validate);
             (ios.MemoryAccess(imm), ...);
             return length + imm.length;
           }
           FOREACH_SIMD_MEM_1_OPERAND_OPCODE(DECLARE_OPCODE_CASE) {
             MemoryAccessImmediate imm(
                 decoder, pc + length, UINT32_MAX,
-                kConservativelyAssumeMemory64, validate);
+                kConservativelyAssumeMemory64,
+                kConservativelyAssumeMultiMemory, validate);
         if (sizeof...(ios) > 0) {
               SimdLaneImmediate lane_imm(decoder,
                                          pc + length + imm.length, validate);
@@ -2155,8 +2259,9 @@ class WasmDecoder : public Decoder {
             decoder->read_prefixed_opcode<ValidationTag>(pc, "atomic_index");
         switch (opcode) {
           FOREACH_ATOMIC_OPCODE(DECLARE_OPCODE_CASE) {
-            MemoryAccessImmediate imm(decoder, pc + length, UINT32_MAX,
-                                      kConservativelyAssumeMemory64, validate);
+            MemoryAccessImmediate imm(
+                decoder, pc + length, UINT32_MAX, kConservativelyAssumeMemory64,
+                kConservativelyAssumeMultiMemory, validate);
             (ios.MemoryAccess(imm), ...);
             return length + imm.length;
           }
@@ -2221,7 +2326,9 @@ class WasmDecoder : public Decoder {
             return length + imm.length;
           }
           case kExprArrayNewData:
-          case kExprArrayNewElem: {
+          case kExprArrayNewElem:
+          case kExprArrayInitData:
+          case kExprArrayInitElem: {
             ArrayIndexImmediate array_imm(decoder, pc + length, validate);
             IndexImmediate data_imm(decoder, pc + length + array_imm.length,
                                     "segment index", validate);
@@ -2255,6 +2362,24 @@ class WasmDecoder : public Decoder {
             (ios.TypeIndex(imm), ...);
             return length + imm.length;
           }
+          case kExprBrOnCastGeneric:
+          case kExprBrOnCastFailGeneric: {
+            BrOnCastImmediate flags_imm(decoder, pc + length, validate);
+            BranchDepthImmediate branch(decoder, pc + length + flags_imm.length,
+                                        validate);
+            HeapTypeImmediate source_imm(
+                WasmFeatures::All(), decoder,
+                pc + length + flags_imm.length + branch.length, validate);
+            HeapTypeImmediate target_imm(WasmFeatures::All(), decoder,
+                                         pc + length + flags_imm.length +
+                                             branch.length + source_imm.length,
+                                         validate);
+            (ios.BranchDepth(branch), ...);
+            (ios.ValueType(source_imm, flags_imm.flags.src_is_null), ...);
+            (ios.ValueType(target_imm, flags_imm.flags.res_is_null), ...);
+            return length + flags_imm.length + branch.length +
+                   source_imm.length + target_imm.length;
+          }
           case kExprBrOnCast:
           case kExprBrOnCastNull:
           case kExprBrOnCastFail:
@@ -2328,7 +2453,7 @@ class WasmDecoder : public Decoder {
           case kExprStringViewWtf8Slice:
           case kExprStringAsWtf16:
           case kExprStringViewWtf16Length:
-          case kExprStringViewWtf16GetCodeUnit:
+          case kExprStringViewWtf16GetCodeunit:
           case kExprStringViewWtf16Slice:
           case kExprStringAsIter:
           case kExprStringViewIterNext:
@@ -2372,228 +2497,6 @@ class WasmDecoder : public Decoder {
     return 1;
   }
 
-  // TODO(clemensb): This is only used by the interpreter; move there.
-  V8_EXPORT_PRIVATE std::pair<uint32_t, uint32_t> StackEffect(const byte* pc) {
-    WasmOpcode opcode = static_cast<WasmOpcode>(*pc);
-    // Handle "simple" opcodes with a fixed signature first.
-    const FunctionSig* sig = WasmOpcodes::Signature(opcode);
-    if (!sig) sig = WasmOpcodes::AsmjsSignature(opcode);
-    if (sig) return {sig->parameter_count(), sig->return_count()};
-
-#define DECLARE_OPCODE_CASE(name, ...) case kExpr##name:
-    // clang-format off
-    switch (opcode) {
-      case kExprSelect:
-      case kExprSelectWithType:
-        return {3, 1};
-      case kExprTableSet:
-      FOREACH_STORE_MEM_OPCODE(DECLARE_OPCODE_CASE)
-        return {2, 0};
-      FOREACH_LOAD_MEM_OPCODE(DECLARE_OPCODE_CASE)
-      case kExprTableGet:
-      case kExprLocalTee:
-      case kExprMemoryGrow:
-      case kExprRefAsNonNull:
-      case kExprBrOnNull:
-      case kExprRefIsNull:
-        return {1, 1};
-      case kExprLocalSet:
-      case kExprGlobalSet:
-      case kExprDrop:
-      case kExprBrIf:
-      case kExprBrTable:
-      case kExprIf:
-      case kExprBrOnNonNull:
-        return {1, 0};
-      case kExprLocalGet:
-      case kExprGlobalGet:
-      case kExprI32Const:
-      case kExprI64Const:
-      case kExprF32Const:
-      case kExprF64Const:
-      case kExprRefNull:
-      case kExprRefFunc:
-      case kExprMemorySize:
-        return {0, 1};
-      case kExprCallFunction: {
-        CallFunctionImmediate imm(this, pc + 1, validate);
-        CHECK(Validate(pc + 1, imm));
-        return {imm.sig->parameter_count(), imm.sig->return_count()};
-      }
-      case kExprCallIndirect: {
-        CallIndirectImmediate imm(this, pc + 1, validate);
-        CHECK(Validate(pc + 1, imm));
-        // Indirect calls pop an additional argument for the table index.
-        return {imm.sig->parameter_count() + 1,
-                imm.sig->return_count()};
-      }
-      case kExprThrow: {
-        TagIndexImmediate imm(this, pc + 1, validate);
-        CHECK(Validate(pc + 1, imm));
-        DCHECK_EQ(0, imm.tag->sig->return_count());
-        return {imm.tag->sig->parameter_count(), 0};
-      }
-      case kExprBr:
-      case kExprBlock:
-      case kExprLoop:
-      case kExprEnd:
-      case kExprElse:
-      case kExprTry:
-      case kExprCatch:
-      case kExprCatchAll:
-      case kExprDelegate:
-      case kExprRethrow:
-      case kExprNop:
-      case kExprNopForTestingUnsupportedInLiftoff:
-      case kExprReturn:
-      case kExprReturnCall:
-      case kExprReturnCallIndirect:
-      case kExprUnreachable:
-        return {0, 0};
-      case kNumericPrefix:
-      case kAtomicPrefix:
-      case kSimdPrefix: {
-        opcode = this->read_prefixed_opcode<ValidationTag>(pc).first;
-        switch (opcode) {
-          FOREACH_SIMD_1_OPERAND_1_PARAM_OPCODE(DECLARE_OPCODE_CASE)
-            return {1, 1};
-          FOREACH_SIMD_1_OPERAND_2_PARAM_OPCODE(DECLARE_OPCODE_CASE)
-          FOREACH_SIMD_MASK_OPERAND_OPCODE(DECLARE_OPCODE_CASE)
-            return {2, 1};
-          FOREACH_SIMD_CONST_OPCODE(DECLARE_OPCODE_CASE)
-            return {0, 1};
-          // Special case numeric opcodes without fixed signature.
-          case kExprMemoryInit:
-          case kExprMemoryCopy:
-          case kExprMemoryFill:
-            return {3, 0};
-          case kExprTableGrow:
-            return {2, 1};
-          case kExprTableFill:
-            return {3, 0};
-          default: {
-            sig = WasmOpcodes::Signature(opcode);
-            DCHECK_NOT_NULL(sig);
-            return {sig->parameter_count(), sig->return_count()};
-          }
-        }
-      }
-      case kGCPrefix: {
-        opcode = this->read_prefixed_opcode<ValidationTag>(pc).first;
-        switch (opcode) {
-          case kExprStructGet:
-          case kExprStructGetS:
-          case kExprStructGetU:
-          case kExprI31New:
-          case kExprI31GetS:
-          case kExprI31GetU:
-          case kExprArrayNewDefault:
-          case kExprArrayLen:
-          case kExprRefTest:
-          case kExprRefTestNull:
-          case kExprRefTestDeprecated:
-          case kExprRefCast:
-          case kExprRefCastNull:
-          case kExprRefCastDeprecated:
-          case kExprRefCastNop:
-          case kExprBrOnCast:
-          case kExprBrOnCastNull:
-          case kExprBrOnCastFail:
-          case kExprBrOnCastFailNull:
-          case kExprBrOnCastFailDeprecated:
-          case kExprBrOnCastDeprecated:
-            return {1, 1};
-          case kExprStructSet:
-            return {2, 0};
-          case kExprArrayNew:
-          case kExprArrayNewData:
-          case kExprArrayNewElem:
-          case kExprArrayGet:
-          case kExprArrayGetS:
-          case kExprArrayGetU:
-            return {2, 1};
-          case kExprArraySet:
-            return {3, 0};
-          case kExprArrayCopy:
-            return {5, 0};
-          case kExprArrayFill:
-            return {4, 0};
-          case kExprStructNewDefault:
-            return {0, 1};
-          case kExprStructNew: {
-            StructIndexImmediate imm(this, pc + 2, validate);
-            CHECK(Validate(pc + 2, imm));
-            return {imm.struct_type->field_count(), 1};
-          }
-          case kExprArrayNewFixed: {
-            ArrayIndexImmediate array_imm(this, pc + 2, validate);
-            IndexImmediate length_imm(this, pc + 2 + array_imm.length,
-                                                "array length", validate);
-            return {length_imm.index, 1};
-          }
-          case kExprStringConst:
-            return { 0, 1 };
-          case kExprStringMeasureUtf8:
-          case kExprStringMeasureWtf8:
-          case kExprStringMeasureWtf16:
-          case kExprStringIsUSVSequence:
-          case kExprStringAsWtf8:
-          case kExprStringAsWtf16:
-          case kExprStringAsIter:
-          case kExprStringViewWtf16Length:
-          case kExprStringViewIterNext:
-          case kExprStringFromCodePoint:
-          case kExprStringHash:
-            return { 1, 1 };
-          case kExprStringNewUtf8:
-          case kExprStringNewUtf8Try:
-          case kExprStringNewLossyUtf8:
-          case kExprStringNewWtf8:
-          case kExprStringNewWtf16:
-          case kExprStringConcat:
-          case kExprStringEq:
-          case kExprStringViewWtf16GetCodeUnit:
-          case kExprStringViewIterAdvance:
-          case kExprStringViewIterRewind:
-          case kExprStringViewIterSlice:
-          case kExprStringCompare:
-            return { 2, 1 };
-          case kExprStringNewUtf8Array:
-          case kExprStringNewUtf8ArrayTry:
-          case kExprStringNewLossyUtf8Array:
-          case kExprStringNewWtf8Array:
-          case kExprStringNewWtf16Array:
-          case kExprStringEncodeUtf8:
-          case kExprStringEncodeLossyUtf8:
-          case kExprStringEncodeWtf8:
-          case kExprStringEncodeUtf8Array:
-          case kExprStringEncodeLossyUtf8Array:
-          case kExprStringEncodeWtf8Array:
-          case kExprStringEncodeWtf16:
-          case kExprStringEncodeWtf16Array:
-          case kExprStringViewWtf8Advance:
-          case kExprStringViewWtf8Slice:
-          case kExprStringViewWtf16Slice:
-            return { 3, 1 };
-          case kExprStringViewWtf16Encode:
-            return { 4, 1 };
-          case kExprStringViewWtf8EncodeUtf8:
-          case kExprStringViewWtf8EncodeLossyUtf8:
-          case kExprStringViewWtf8EncodeWtf8:
-            return { 4, 2 };
-          default:
-            UNREACHABLE();
-        }
-      }
-      default:
-        FATAL("unimplemented opcode: %x (%s)", opcode,
-              WasmOpcodes::OpcodeName(opcode));
-        return {0, 0};
-    }
-#undef DECLARE_OPCODE_CASE
-    // clang-format on
-  }
-
   static constexpr ValidationTag validate = {};
 
   Zone* const zone_;
@@ -2636,12 +2539,27 @@ class WasmDecoder : public Decoder {
     }                                                           \
   } while (false)
 
+// An empty class used in place of a {base::SmallVector} for cases where the
+// content is not needed afterwards.
+// This is used for implementations which set {kUsesPoppedArgs} to {false}.
+class NoVector {
+ public:
+  // Construct from anything; {NoVector} is always empty.
+  template <typename... Ts>
+  explicit NoVector(Ts&&...) V8_NOEXCEPT {}
+
+  constexpr std::nullptr_t data() const { return nullptr; }
+};
+
 template <typename ValidationTag, typename Interface,
           DecodingMode decoding_mode = kFunctionBody>
 class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   using Value = typename Interface::Value;
   using Control = typename Interface::Control;
   using ArgVector = base::Vector<Value>;
+  using PoppedArgVector =
+      std::conditional_t<Interface::kUsesPoppedArgs,
+                         base::SmallVector<Value, 8>, NoVector>;
   using ReturnVector = base::SmallVector<Value, 2>;
 
   // All Value types should be trivially copyable for performance. We push, pop,
@@ -2683,6 +2601,11 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         static_cast<uint32_t>(this->sig_->parameter_count());
     for (uint32_t index = params_count; index < this->num_locals(); index++) {
       if (!this->local_type(index).is_defaultable()) non_defaultable++;
+      // We need this because reference locals are initialized with null, and
+      // later we run a lowering step for null based on {detected_}.
+      if (this->local_type(index).is_reference()) {
+        this->detected_->Add(kFeature_reftypes);
+      }
     }
     this->InitializeInitializedLocalsTracking(non_defaultable);
 
@@ -2720,7 +2643,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     }
   }
 
-  const char* SafeOpcodeNameAt(const byte* pc) {
+  const char* SafeOpcodeNameAt(const uint8_t* pc) {
     if (!pc) return "<null>";
     if (pc >= this->end_) return "<end>";
     WasmOpcode opcode = static_cast<WasmOpcode>(*pc);
@@ -2807,7 +2730,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     has_nondefaultable_locals_ = non_defaultable_locals > 0;
     if (!has_nondefaultable_locals_) return;
     initialized_locals_ =
-        this->zone_->template NewArray<bool>(this->num_locals_);
+        this->zone_->template AllocateArray<bool>(this->num_locals_);
     // Parameters are always initialized.
     const size_t num_params = this->sig_->parameter_count();
     std::fill_n(initialized_locals_, num_params, true);
@@ -2835,10 +2758,10 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                             kInitStackDepth, this->pc_, kReachable);
       Control* c = &control_.back();
       if constexpr (decoding_mode == kFunctionBody) {
-        InitMerge(&c->start_merge, 0, [](uint32_t) -> Value { UNREACHABLE(); });
+        InitMerge(&c->start_merge, 0, nullptr);
         InitMerge(&c->end_merge,
                   static_cast<uint32_t>(this->sig_->return_count()),
-                  [&](uint32_t i) {
+                  [this](uint32_t i) {
                     return Value{this->pc_, this->sig_->GetReturn(i)};
                   });
       } else {
@@ -2961,10 +2884,15 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     return true;
   }
 
+  V8_INLINE ValueType MemoryIndexType(const WasmMemory* memory) {
+    return memory->is_memory64 ? kWasmI64 : kWasmI32;
+  }
+
   V8_INLINE MemoryAccessImmediate
   MakeMemoryAccessImmediate(uint32_t pc_offset, uint32_t max_alignment) {
     return MemoryAccessImmediate(this, this->pc_ + pc_offset, max_alignment,
-                                 this->module_->is_memory64, validate);
+                                 this->enabled_.has_memory64(),
+                                 this->enabled_.has_multi_memory(), validate);
   }
 
 #ifdef DEBUG
@@ -3101,12 +3029,8 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   DECODE(Block) {
     BlockTypeImmediate imm(this->enabled_, this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    ArgVector args = PeekArgs(&imm.sig);
-    Control* block = PushControl(kControlBlock, args.length());
-    SetBlockType(block, imm, args.begin());
+    Control* block = PushControl(kControlBlock, imm);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(Block, block);
-    DropArgs(&imm.sig);
-    PushMergeValues(block, &block->start_merge);
     return 1 + imm.length;
   }
 
@@ -3128,9 +3052,8 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     this->detected_->Add(kFeature_eh);
     TagIndexImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    ArgVector args = PeekArgs(imm.tag->ToFunctionSig());
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(Throw, imm, base::VectorOf(args));
-    DropArgs(imm.tag->ToFunctionSig());
+    PoppedArgVector args = PopArgs(imm.tag->ToFunctionSig());
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(Throw, imm, args.data());
     EndControl();
     return 1 + imm.length;
   }
@@ -3139,14 +3062,10 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     this->detected_->Add(kFeature_eh);
     BlockTypeImmediate imm(this->enabled_, this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    ArgVector args = PeekArgs(&imm.sig);
-    Control* try_block = PushControl(kControlTry, args.length());
-    SetBlockType(try_block, imm, args.begin());
+    Control* try_block = PushControl(kControlTry, imm);
     try_block->previous_catch = current_catch_;
     current_catch_ = static_cast<int>(control_depth() - 1);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(Try, try_block);
-    DropArgs(&imm.sig);
-    PushMergeValues(try_block, &try_block->start_merge);
     return 1 + imm.length;
   }
 
@@ -3166,15 +3085,13 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     }
     FallThrough();
     c->kind = kControlTryCatch;
-    // TODO(jkummerow): Consider moving the stack manipulation after the
-    // INTERFACE call for consistency.
     stack_.shrink_to(c->stack_depth);
     c->reachability = control_at(1)->innerReachability();
     RollbackLocalsInitialization(c);
     const WasmTagSig* sig = imm.tag->sig;
     stack_.EnsureMoreCapacity(static_cast<int>(sig->parameter_count()),
                               this->zone_);
-    for (ValueType type : sig->parameters()) Push(CreateValue(type));
+    for (ValueType type : sig->parameters()) Push(type);
     base::Vector<Value> values(stack_.begin() + c->stack_depth,
                                sig->parameter_count());
     current_catch_ = c->previous_catch;  // Pop try scope.
@@ -3236,30 +3153,27 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     CHECK_PROTOTYPE_OPCODE(typed_funcref);
     BranchDepthImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm, control_.size())) return 0;
-    Value ref_object = Peek(0);
+    Value ref_object = Pop();
     Control* c = control_at(imm.depth);
-    if (!VALIDATE(TypeCheckBranch<true>(c, 1))) return 0;
+    if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
     switch (ref_object.type.kind()) {
       case kBottom:
         // We are in a polymorphic stack. Leave the stack as it is.
         DCHECK(!current_code_reachable_and_ok_);
-        break;
+        V8_FALLTHROUGH;
       case kRef:
         // For a non-nullable value, we won't take the branch, and can leave
         // the stack as it is.
+        Push(ref_object);
         break;
       case kRefNull: {
-        Value result = CreateValue(ValueType::Ref(ref_object.type.heap_type()));
+        Value* result = Push(ValueType::Ref(ref_object.type.heap_type()));
         // The result of br_on_null has the same value as the argument (but a
         // non-nullable type).
         if (V8_LIKELY(current_code_reachable_and_ok_)) {
-          CALL_INTERFACE(BrOnNull, ref_object, imm.depth, false, &result);
+          CALL_INTERFACE(BrOnNull, ref_object, imm.depth, false, result);
           c->br_merge()->reached = true;
         }
-        // In unreachable code, we still have to push a value of the correct
-        // type onto the stack.
-        Drop(ref_object);
-        Push(result);
         break;
       }
       default:
@@ -3270,10 +3184,10 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   }
 
   DECODE(BrOnNonNull) {
-    CHECK_PROTOTYPE_OPCODE(gc);
+    CHECK_PROTOTYPE_OPCODE(typed_funcref);
     BranchDepthImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm, control_.size())) return 0;
-    Value ref_object = Peek(0);
+    Value ref_object = Pop();
     if (!VALIDATE(ref_object.type.is_object_reference() ||
                   ref_object.type.is_bottom())) {
       PopTypeError(
@@ -3281,15 +3195,11 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
           "subtype of ((ref null any), (ref null extern) or (ref null func))");
       return 0;
     }
-    Drop(ref_object);
     // Typechecking the branch and creating the branch merges requires the
     // non-null value on the stack, so we push it temporarily.
-    Push(CreateValue(ref_object.type.AsNonNull()));
-    // The {value_on_branch} parameter we pass to the interface must be
-    // pointer-identical to the object on the stack.
-    Value* value_on_branch = stack_value(1);
+    Value* value_on_branch = Push(ref_object.type.AsNonNull());
     Control* c = control_at(imm.depth);
-    if (!VALIDATE(TypeCheckBranch<true>(c, 0))) return 0;
+    if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
     switch (ref_object.type.kind()) {
       case kBottom:
         // We are in unreachable code. Do nothing.
@@ -3318,19 +3228,19 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         PopTypeError(0, ref_object, "object reference");
         return 0;
     }
-    // If we stay in the branch, {ref_object} is null. Drop it from the stack.
-    Drop(1);
+    Drop(*value_on_branch);
     return 1 + imm.length;
   }
 
   DECODE(Loop) {
     BlockTypeImmediate imm(this->enabled_, this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    ArgVector args = PeekArgs(&imm.sig);
-    Control* block = PushControl(kControlLoop, args.length());
-    SetBlockType(&control_.back(), imm, args.begin());
+    Control* block = PushControl(kControlLoop, imm);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(Loop, block);
-    DropArgs(&imm.sig);
+    // Loops have a merge point at block entry, hence push the merge values
+    // (Phis in case of TurboFan) after calling the interface.
+    // TODO(clemensb): Can we skip this (and the related PushMergeValues in
+    // PopControl) for Liftoff?
     PushMergeValues(block, &block->start_merge);
     return 1 + imm.length;
   }
@@ -3338,15 +3248,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   DECODE(If) {
     BlockTypeImmediate imm(this->enabled_, this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    Value cond = Peek(0, 0, kWasmI32);
-    ArgVector args = PeekArgs(&imm.sig, 1);
-    if (!VALIDATE(this->ok())) return 0;
-    Control* if_block = PushControl(kControlIf, 1 + args.length());
-    SetBlockType(if_block, imm, args.begin());
+    Value cond = Pop(kWasmI32);
+    Control* if_block = PushControl(kControlIf, imm);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(If, cond, if_block);
-    Drop(cond);
-    DropArgs(&imm.sig);
-    PushMergeValues(if_block, &if_block->start_merge);
     return 1 + imm.length;
   }
 
@@ -3422,34 +3326,30 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   }
 
   DECODE(Select) {
-    Value cond = Peek(0, 2, kWasmI32);
-    Value fval = Peek(1);
-    Value tval = Peek(2, 0, fval.type);
-    ValueType type = tval.type == kWasmBottom ? fval.type : tval.type;
-    if (!VALIDATE(!type.is_reference())) {
+    auto [tval, fval, cond] = Pop(kWasmBottom, kWasmBottom, kWasmI32);
+    ValueType result_type = tval.type;
+    if (result_type == kWasmBottom) {
+      result_type = fval.type;
+    } else {
+      ValidateStackValue(1, fval, result_type);
+    }
+    if (!VALIDATE(!result_type.is_reference())) {
       this->DecodeError(
           "select without type is only valid for value type inputs");
       return 0;
     }
-    Value result = CreateValue(type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(Select, cond, fval, tval, &result);
-    Drop(3);
-    Push(result);
+    Value* result = Push(result_type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(Select, cond, fval, tval, result);
     return 1;
   }
 
   DECODE(SelectWithType) {
     this->detected_->Add(kFeature_reftypes);
     SelectTypeImmediate imm(this->enabled_, this, this->pc_ + 1, validate);
-    this->Validate(this->pc_ + 1, imm);
-    if (!VALIDATE(this->ok())) return 0;
-    Value cond = Peek(0, 2, kWasmI32);
-    Value fval = Peek(1, 1, imm.type);
-    Value tval = Peek(2, 0, imm.type);
-    Value result = CreateValue(imm.type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(Select, cond, fval, tval, &result);
-    Drop(3);
-    Push(result);
+    if (!this->Validate(this->pc_ + 1, imm)) return 0;
+    auto [tval, fval, cond] = Pop(imm.type, imm.type, kWasmI32);
+    Value* result = Push(imm.type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(Select, cond, fval, tval, result);
     return 1 + imm.length;
   }
 
@@ -3457,7 +3357,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     BranchDepthImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm, control_.size())) return 0;
     Control* c = control_at(imm.depth);
-    if (!VALIDATE(TypeCheckBranch<false>(c, 0))) return 0;
+    if (!VALIDATE(TypeCheckBranch<false>(c))) return 0;
     if (V8_LIKELY(current_code_reachable_and_ok_)) {
       CALL_INTERFACE(BrOrRet, imm.depth, 0);
       c->br_merge()->reached = true;
@@ -3469,21 +3369,20 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   DECODE(BrIf) {
     BranchDepthImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm, control_.size())) return 0;
-    Value cond = Peek(0, 0, kWasmI32);
+    Value cond = Pop(kWasmI32);
     Control* c = control_at(imm.depth);
-    if (!VALIDATE(TypeCheckBranch<true>(c, 1))) return 0;
+    if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
     if (V8_LIKELY(current_code_reachable_and_ok_)) {
       CALL_INTERFACE(BrIf, cond, imm.depth);
       c->br_merge()->reached = true;
     }
-    Drop(cond);
     return 1 + imm.length;
   }
 
   DECODE(BrTable) {
     BranchTableImmediate imm(this, this->pc_ + 1, validate);
     BranchTableIterator<ValidationTag> iterator(this, imm);
-    Value key = Peek(0, 0, kWasmI32);
+    Value key = Pop(kWasmI32);
     if (!VALIDATE(this->ok())) return 0;
     if (!this->Validate(this->pc_ + 1, imm, control_.size())) return 0;
 
@@ -3495,7 +3394,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
 
     while (iterator.has_next()) {
       const uint32_t index = iterator.cur_index();
-      const byte* pos = iterator.pc();
+      const uint8_t* pos = iterator.pc();
       const uint32_t target = iterator.next();
       if (!VALIDATE(target < control_depth())) {
         this->DecodeError(pos, "invalid branch depth: %u", target);
@@ -3514,7 +3413,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               arity);
           return 0;
         }
-        if (!VALIDATE(TypeCheckBranch<false>(control_at(target), 1))) return 0;
+        if (!VALIDATE(TypeCheckBranch<false>(control_at(target)))) return 0;
       }
     }
 
@@ -3525,7 +3424,6 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         control_at(i)->br_merge()->reached |= br_targets[i];
       }
     }
-    Drop(key);
     EndControl();
     return 1 + iterator.length();
   }
@@ -3542,74 +3440,61 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
 
   DECODE(I32Const) {
     ImmI32Immediate imm(this, this->pc_ + 1, validate);
-    Value value = CreateValue(kWasmI32);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(I32Const, &value, imm.value);
-    Push(value);
+    Value* value = Push(kWasmI32);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(I32Const, value, imm.value);
     return 1 + imm.length;
   }
 
   DECODE(I64Const) {
     ImmI64Immediate imm(this, this->pc_ + 1, validate);
-    Value value = CreateValue(kWasmI64);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(I64Const, &value, imm.value);
-    Push(value);
+    Value* value = Push(kWasmI64);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(I64Const, value, imm.value);
     return 1 + imm.length;
   }
 
   DECODE(F32Const) {
     ImmF32Immediate imm(this, this->pc_ + 1, validate);
-    Value value = CreateValue(kWasmF32);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(F32Const, &value, imm.value);
-    Push(value);
+    Value* value = Push(kWasmF32);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(F32Const, value, imm.value);
     return 1 + imm.length;
   }
 
   DECODE(F64Const) {
     ImmF64Immediate imm(this, this->pc_ + 1, validate);
-    Value value = CreateValue(kWasmF64);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(F64Const, &value, imm.value);
-    Push(value);
+    Value* value = Push(kWasmF64);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(F64Const, value, imm.value);
     return 1 + imm.length;
   }
 
   DECODE(RefNull) {
     this->detected_->Add(kFeature_reftypes);
     HeapTypeImmediate imm(this->enabled_, this, this->pc_ + 1, validate);
-    this->Validate(this->pc_ + 1, imm);
-    if (!VALIDATE(this->ok())) return 0;
+    if (!this->Validate(this->pc_ + 1, imm)) return 0;
     ValueType type = ValueType::RefNull(imm.type);
-    Value value = CreateValue(type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(RefNull, type, &value);
-    Push(value);
+    Value* value = Push(type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(RefNull, type, value);
     return 1 + imm.length;
   }
 
   DECODE(RefIsNull) {
     this->detected_->Add(kFeature_reftypes);
-    Value value = Peek(0);
-    Value result = CreateValue(kWasmI32);
+    Value value = Pop();
+    Value* result = Push(kWasmI32);
     switch (value.type.kind()) {
       case kRefNull:
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(UnOp, kExprRefIsNull, value,
-                                           &result);
-        Drop(value);
-        Push(result);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(UnOp, kExprRefIsNull, value, result);
         return 1;
       case kBottom:
         // We are in unreachable code, the return value does not matter.
       case kRef:
         // For non-nullable references, the result is always false.
         CALL_INTERFACE_IF_OK_AND_REACHABLE(Drop);
-        Drop(value);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(I32Const, &result, 0);
-        Push(result);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(I32Const, result, 0);
         return 1;
       default:
-        if (ValidationTag::validate) {
-          PopTypeError(0, value, "reference type");
-          return 0;
-        }
-        UNREACHABLE();
+        if constexpr (!ValidationTag::validate) UNREACHABLE();
+        PopTypeError(0, value, "reference type");
+        return 0;
     }
   }
 
@@ -3620,32 +3505,29 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     HeapType heap_type(this->enabled_.has_typed_funcref()
                            ? this->module_->functions[imm.index].sig_index
                            : HeapType::kFunc);
-    Value value = CreateValue(ValueType::Ref(heap_type));
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(RefFunc, imm.index, &value);
-    Push(value);
+    Value* value = Push(ValueType::Ref(heap_type));
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(RefFunc, imm.index, value);
     return 1 + imm.length;
   }
 
   DECODE(RefAsNonNull) {
     CHECK_PROTOTYPE_OPCODE(typed_funcref);
-    Value value = Peek(0);
+    Value value = Pop();
     switch (value.type.kind()) {
       case kBottom:
         // We are in unreachable code. Forward the bottom value.
       case kRef:
         // A non-nullable value can remain as-is.
+        Push(value);
         return 1;
       case kRefNull: {
-        Value result = CreateValue(ValueType::Ref(value.type.heap_type()));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RefAsNonNull, value, &result);
-        Drop(value);
-        Push(result);
+        Value* result = Push(ValueType::Ref(value.type.heap_type()));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(RefAsNonNull, value, result);
         return 1;
       }
       default:
-        if (ValidationTag::validate) {
-          PopTypeError(0, value, "reference type");
-        }
+        if constexpr (!ValidationTag::validate) UNREACHABLE();
+        PopTypeError(0, value, "reference type");
         return 0;
     }
   }
@@ -3658,18 +3540,16 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                         imm.index);
       return 0;
     }
-    Value value = CreateValue(this->local_type(imm.index));
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(LocalGet, &value, imm);
-    Push(value);
+    Value* value = Push(this->local_type(imm.index));
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(LocalGet, value, imm);
     return 1 + imm.length;
   }
 
   DECODE(LocalSet) {
     IndexImmediate imm(this, this->pc_ + 1, "local index", validate);
     if (!this->ValidateLocal(this->pc_ + 1, imm)) return 0;
-    Value value = Peek(0, 0, this->local_type(imm.index));
+    Value value = Pop(this->local_type(imm.index));
     CALL_INTERFACE_IF_OK_AND_REACHABLE(LocalSet, value, imm);
-    Drop(value);
     this->set_local_initialized(imm.index);
     return 1 + imm.length;
   }
@@ -3678,28 +3558,24 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     IndexImmediate imm(this, this->pc_ + 1, "local index", validate);
     if (!this->ValidateLocal(this->pc_ + 1, imm)) return 0;
     ValueType local_type = this->local_type(imm.index);
-    Value value = Peek(0, 0, local_type);
-    Value result = CreateValue(local_type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(LocalTee, value, &result, imm);
-    Drop(value);
-    Push(result);
+    Value value = Pop(local_type);
+    Value* result = Push(local_type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(LocalTee, value, result, imm);
     this->set_local_initialized(imm.index);
     return 1 + imm.length;
   }
 
   DECODE(Drop) {
-    Peek(0);
+    Pop();
     CALL_INTERFACE_IF_OK_AND_REACHABLE(Drop);
-    Drop(1);
     return 1;
   }
 
   DECODE(GlobalGet) {
     GlobalIndexImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    Value result = CreateValue(imm.global->type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(GlobalGet, &result, imm);
-    Push(result);
+    Value* result = Push(imm.global->type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(GlobalGet, result, imm);
     return 1 + imm.length;
   }
 
@@ -3710,9 +3586,8 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       this->DecodeError("immutable global #%u cannot be assigned", imm.index);
       return 0;
     }
-    Value value = Peek(0, 0, imm.global->type);
+    Value value = Pop(imm.global->type);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(GlobalSet, value, imm);
-    Drop(value);
     return 1 + imm.length;
   }
 
@@ -3720,11 +3595,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     this->detected_->Add(kFeature_reftypes);
     IndexImmediate imm(this, this->pc_ + 1, "table index", validate);
     if (!this->ValidateTable(this->pc_ + 1, imm)) return 0;
-    Value index = Peek(0, 0, kWasmI32);
-    Value result = CreateValue(this->module_->tables[imm.index].type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(TableGet, index, &result, imm);
-    Drop(index);
-    Push(result);
+    Value index = Pop(kWasmI32);
+    Value* result = Push(this->module_->tables[imm.index].type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(TableGet, index, result, imm);
     return 1 + imm.length;
   }
 
@@ -3732,10 +3605,8 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     this->detected_->Add(kFeature_reftypes);
     IndexImmediate imm(this, this->pc_ + 1, "table index", validate);
     if (!this->ValidateTable(this->pc_ + 1, imm)) return 0;
-    Value value = Peek(0, 1, this->module_->tables[imm.index].type);
-    Value index = Peek(1, 0, kWasmI32);
+    auto [index, value] = Pop(kWasmI32, this->module_->tables[imm.index].type);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(TableSet, index, value, imm);
-    Drop(2);
     return 1 + imm.length;
   }
 
@@ -3744,53 +3615,48 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   DECODE(StoreMem) { return DecodeStoreMem(GetStoreType(opcode)); }
 
   DECODE(MemoryGrow) {
-    MemoryIndexImmediate imm(this, this->pc_ + 1, validate);
-    if (!this->Validate(this->pc_ + 1, imm)) return 0;
     // This opcode will not be emitted by the asm translator.
     DCHECK_EQ(kWasmOrigin, this->module_->origin);
-    ValueType mem_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value value = Peek(0, 0, mem_type);
-    Value result = CreateValue(mem_type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(MemoryGrow, value, &result);
-    Drop(value);
-    Push(result);
+    MemoryIndexImmediate imm(this, this->pc_ + 1, validate);
+    if (!this->Validate(this->pc_ + 1, imm)) return 0;
+    ValueType mem_type = MemoryIndexType(imm.memory);
+    Value value = Pop(mem_type);
+    Value* result = Push(mem_type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(MemoryGrow, imm, value, result);
     return 1 + imm.length;
   }
 
   DECODE(MemorySize) {
     MemoryIndexImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    ValueType result_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value result = CreateValue(result_type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(CurrentMemoryPages, &result);
-    Push(result);
+    ValueType result_type = MemoryIndexType(imm.memory);
+    Value* result = Push(result_type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(CurrentMemoryPages, imm, result);
     return 1 + imm.length;
   }
 
   DECODE(CallFunction) {
     CallFunctionImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    ArgVector args = PeekArgs(imm.sig);
-    ReturnVector returns = CreateReturnValues(imm.sig);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(CallDirect, imm, args.begin(),
-                                       returns.begin());
-    DropArgs(imm.sig);
-    PushReturns(returns);
+    PoppedArgVector args = PopArgs(imm.sig);
+    Value* returns = PushReturns(imm.sig);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(CallDirect, imm, args.data(), returns);
     return 1 + imm.length;
   }
 
   DECODE(CallIndirect) {
     CallIndirectImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    Value index =
-        Peek(0, static_cast<int>(imm.sig->parameter_count()), kWasmI32);
-    ArgVector args = PeekArgs(imm.sig, 1);
-    ReturnVector returns = CreateReturnValues(imm.sig);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(CallIndirect, index, imm, args.begin(),
-                                       returns.begin());
-    Drop(index);
-    DropArgs(imm.sig);
-    PushReturns(returns);
+    Value index = Pop(kWasmI32);
+    PoppedArgVector args = PopArgs(imm.sig);
+    Value* returns = PushReturns(imm.sig);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(CallIndirect, index, imm, args.data(),
+                                       returns);
+    if (this->enabled_.has_gc() &&
+        !this->module_->types[imm.sig_imm.index].is_final) {
+      // In this case we emit an rtt.canon as part of the indirect call.
+      this->detected_->Add(kFeature_gc);
+    }
     return 1 + imm.length;
   }
 
@@ -3803,9 +3669,8 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                         "tail call type error");
       return 0;
     }
-    ArgVector args = PeekArgs(imm.sig);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(ReturnCall, imm, args.begin());
-    DropArgs(imm.sig);
+    PoppedArgVector args = PopArgs(imm.sig);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(ReturnCall, imm, args.data());
     EndControl();
     return 1 + imm.length;
   }
@@ -3820,13 +3685,16 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                         "tail call return types mismatch");
       return 0;
     }
-    Value index = Peek(0, 0, kWasmI32);
-    ArgVector args = PeekArgs(imm.sig, 1);
+    Value index = Pop(kWasmI32);
+    PoppedArgVector args = PopArgs(imm.sig);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(ReturnCallIndirect, index, imm,
-                                       args.begin());
-    Drop(index);
-    DropArgs(imm.sig);
+                                       args.data());
     EndControl();
+    if (this->enabled_.has_gc() &&
+        !this->module_->types[imm.sig_imm.index].is_final) {
+      // In this case we emit an rtt.canon as part of the indirect call.
+      this->detected_->Add(kFeature_gc);
+    }
     return 1 + imm.length;
   }
 
@@ -3834,14 +3702,11 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     CHECK_PROTOTYPE_OPCODE(typed_funcref);
     SigIndexImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    Value func_ref = Peek(0, 0, ValueType::RefNull(imm.index));
-    ArgVector args = PeekArgs(imm.sig, 1);
-    ReturnVector returns = CreateReturnValues(imm.sig);
+    Value func_ref = Pop(ValueType::RefNull(imm.index));
+    PoppedArgVector args = PopArgs(imm.sig);
+    Value* returns = PushReturns(imm.sig);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(CallRef, func_ref, imm.sig, imm.index,
-                                       args.begin(), returns.begin());
-    Drop(func_ref);
-    DropArgs(imm.sig);
-    PushReturns(returns);
+                                       args.data(), returns);
     return 1 + imm.length;
   }
 
@@ -3850,12 +3715,15 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     CHECK_PROTOTYPE_OPCODE(return_call);
     SigIndexImmediate imm(this, this->pc_ + 1, validate);
     if (!this->Validate(this->pc_ + 1, imm)) return 0;
-    Value func_ref = Peek(0, 0, ValueType::RefNull(imm.index));
-    ArgVector args = PeekArgs(imm.sig, 1);
+    if (!VALIDATE(this->CanReturnCall(imm.sig))) {
+      this->DecodeError("%s: %s", WasmOpcodes::OpcodeName(kExprReturnCallRef),
+                        "tail call return types mismatch");
+      return 0;
+    }
+    Value func_ref = Pop(ValueType::RefNull(imm.index));
+    PoppedArgVector args = PopArgs(imm.sig);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(ReturnCallRef, func_ref, imm.sig,
-                                       imm.index, args.begin());
-    Drop(func_ref);
-    DropArgs(imm.sig);
+                                       imm.index, args.data());
     EndControl();
     return 1 + imm.length;
   }
@@ -4051,36 +3919,20 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   }
 
   template <typename func>
-  void InitMerge(Merge<Value>* merge, uint32_t arity, func get_val) {
+  V8_INLINE void InitMerge(Merge<Value>* merge, uint32_t arity, func get_val) {
     merge->arity = arity;
-    if (arity == 1) {
+    if constexpr (std::is_null_pointer_v<func>) {
+      DCHECK_EQ(0, arity);
+    } else if (arity == 1) {
       merge->vals.first = get_val(0);
     } else if (arity > 1) {
-      merge->vals.array = this->zone()->template NewArray<Value>(arity);
+      merge->vals.array = this->zone()->template AllocateArray<Value>(arity);
       for (uint32_t i = 0; i < arity; i++) {
         merge->vals.array[i] = get_val(i);
       }
     }
   }
 
-  // Initializes start- and end-merges of {c} with values according to the
-  // in- and out-types of {c} respectively.
-  void SetBlockType(Control* c, BlockTypeImmediate& imm, Value* args) {
-    const byte* pc = this->pc_;
-    InitMerge(&c->end_merge, imm.out_arity(), [pc, &imm](uint32_t i) {
-      return Value{pc, imm.out_type(i)};
-    });
-    InitMerge(&c->start_merge, imm.in_arity(), [&imm, args](uint32_t i) {
-      // The merge needs to be instantiated with Values of the correct
-      // type, even if the actual Value is bottom/unreachable or has
-      // a subtype of the static type.
-      // So we copy-construct a new Value, and update its type.
-      Value value = args[i];
-      value.type = imm.in_type(i);
-      return value;
-    });
-  }
-
   // In reachable code, check if there are at least {count} values on the stack.
   // In unreachable code, if there are less than {count} values on the stack,
   // insert a number of unreachable values underneath the current values equal
@@ -4088,11 +3940,11 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   V8_INLINE int EnsureStackArguments(int count) {
     uint32_t limit = control_.back().stack_depth;
     if (V8_LIKELY(stack_.size() >= count + limit)) return 0;
-    return EnsureStackArguments_Slow(count, limit);
+    return EnsureStackArguments_Slow(count);
   }
 
-  V8_NOINLINE V8_PRESERVE_MOST int EnsureStackArguments_Slow(int count,
-                                                             uint32_t limit) {
+  V8_NOINLINE V8_PRESERVE_MOST int EnsureStackArguments_Slow(int count) {
+    uint32_t limit = control_.back().stack_depth;
     if (!VALIDATE(control_.back().unreachable())) {
       NotEnoughArgumentsError(count, stack_.size() - limit);
     }
@@ -4103,7 +3955,10 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     int current_values = stack_.size() - limit;
     int additional_values = count - current_values;
     DCHECK_GT(additional_values, 0);
-    stack_.EnsureMoreCapacity(additional_values, this->zone_);
+    // Ensure that after this operation there is still room for one more value.
+    // Callers might not expect this operation to push values on the stack
+    // (because it only does so in exceptional cases).
+    stack_.EnsureMoreCapacity(additional_values + 1, this->zone_);
     Value unreachable_value = UnreachableValue(this->pc_);
     for (int i = 0; i < additional_values; ++i) stack_.push(unreachable_value);
     if (current_values > 0) {
@@ -4120,11 +3975,13 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     return additional_values;
   }
 
-  // Peeks arguments as required by signature.
-  V8_INLINE ArgVector PeekArgs(const FunctionSig* sig, int depth = 0) {
-    return PeekArgs(
-        base::VectorOf(sig->parameters().begin(), sig->parameter_count()),
-        depth);
+  V8_INLINE void ValidateParameters(const FunctionSig* sig) {
+    int num_params = static_cast<int>(sig->parameter_count());
+    EnsureStackArguments(num_params);
+    Value* param_base = stack_.end() - num_params;
+    for (int i = 0; i < num_params; i++) {
+      ValidateStackValue(i, param_base[i], sig->GetParam(i));
+    }
   }
 
   // Drops a number of stack elements equal to the {sig}'s parameter count (0 if
@@ -4134,15 +3991,19 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     Drop(count);
   }
 
-  V8_INLINE ArgVector PeekArgs(const StructType* type, int depth = 0) {
+  V8_INLINE PoppedArgVector PopArgs(const StructType* type) {
     int count = static_cast<int>(type->field_count());
-    if (count == 0) return {};
-    EnsureStackArguments(depth + count);
-    ArgVector args(stack_value(depth + count), count);
+    EnsureStackArguments(count);
+    DCHECK_LE(control_.back().stack_depth, stack_size());
+    DCHECK_GE(stack_size() - control_.back().stack_depth, count);
+    Value* args_base = stack_.end() - count;
     for (int i = 0; i < count; i++) {
-      ValidateArgType(args, i, type->field(i).Unpacked());
+      ValidateStackValue(i, args_base[i], type->field(i).Unpacked());
     }
-    return args;
+    // Note: Popping from the {FastZoneVector} does not invalidate the old (now
+    // out-of-range) elements.
+    stack_.pop(count);
+    return PoppedArgVector{base::VectorOf(args_base, count)};
   }
   // Drops a number of stack elements equal to the struct's field count, or all
   // of them if less are present.
@@ -4150,35 +4011,59 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     Drop(static_cast<int>(type->field_count()));
   }
 
-  V8_INLINE ArgVector PeekArgs(base::Vector<const ValueType> arg_types,
-                               int depth = 0) {
-    int size = static_cast<int>(arg_types.size());
-    if (size == 0) return {};
-    EnsureStackArguments(size + depth);
-    ArgVector args(stack_value(size + depth), arg_types.size());
-    for (int i = 0; i < size; i++) {
-      ValidateArgType(args, i, arg_types[i]);
-    }
-    return args;
+  // Pops arguments as required by signature, returning them by copy as a
+  // vector.
+  V8_INLINE PoppedArgVector PopArgs(const FunctionSig* sig) {
+    int count = static_cast<int>(sig->parameter_count());
+    EnsureStackArguments(count);
+    DCHECK_LE(control_.back().stack_depth, stack_size());
+    DCHECK_GE(stack_size() - control_.back().stack_depth, count);
+    Value* args_base = stack_.end() - count;
+    for (int i = 0; i < count; ++i) {
+      ValidateStackValue(i, args_base[i], sig->GetParam(i));
+    }
+    // Note: Popping from the {FastZoneVector} does not invalidate the old (now
+    // out-of-range) elements.
+    stack_.pop(count);
+    return PoppedArgVector{base::VectorOf(args_base, count)};
   }
 
-  // TODO(jkummerow): Consider refactoring control stack management so
-  // that {drop_values} is never needed. That would require decoupling
-  // creation of the Control object from setting of its stack depth.
-  Control* PushControl(ControlKind kind, uint32_t drop_values) {
+  Control* PushControl(ControlKind kind, const BlockTypeImmediate& imm) {
     DCHECK(!control_.empty());
-    Reachability reachability = control_.back().innerReachability();
-    // In unreachable code, we may run out of stack.
-    uint32_t stack_depth =
-        stack_.size() >= drop_values ? stack_.size() - drop_values : 0;
-    stack_depth = std::max(stack_depth, control_.back().stack_depth);
+    ValidateParameters(&imm.sig);
+    uint32_t consumed_values = static_cast<uint32_t>(imm.sig.parameter_count());
+    uint32_t stack_depth = stack_.size();
+    DCHECK_LE(consumed_values, stack_depth);
+    uint32_t inner_stack_depth = stack_depth - consumed_values;
+    DCHECK_LE(control_.back().stack_depth, inner_stack_depth);
+
     uint32_t init_stack_depth = this->locals_initialization_stack_depth();
+    Reachability reachability = control_.back().innerReachability();
     control_.EnsureMoreCapacity(1, this->zone_);
-    control_.emplace_back(this->zone_, kind, stack_depth, init_stack_depth,
-                          this->pc_, reachability);
-    current_code_reachable_and_ok_ =
-        VALIDATE(this->ok()) && reachability == kReachable;
-    return &control_.back();
+    control_.emplace_back(this->zone_, kind, inner_stack_depth,
+                          init_stack_depth, this->pc_, reachability);
+    Control* new_block = &control_.back();
+
+    Value* arg_base = stack_.end() - consumed_values;
+    // Update the type of input nodes to the more general types expected by the
+    // block. In particular, in unreachable code, the input would have bottom
+    // type otherwise.
+    for (uint32_t i = 0; i < consumed_values; ++i) {
+      DCHECK_IMPLIES(this->ok(), IsSubtypeOf(arg_base[i].type, imm.in_type(i),
+                                             this->module_) ||
+                                     arg_base[i].type == kWasmBottom);
+      arg_base[i].type = imm.in_type(i);
+    }
+
+    // Initialize start- and end-merges of {c} with values according to the
+    // in- and out-types of {c} respectively.
+    const uint8_t* pc = this->pc_;
+    InitMerge(&new_block->end_merge, imm.out_arity(), [pc, &imm](uint32_t i) {
+      return Value{pc, imm.out_type(i)};
+    });
+    InitMerge(&new_block->start_merge, imm.in_arity(),
+              [arg_base](uint32_t i) { return arg_base[i]; });
+    return new_block;
   }
 
   void PopControl() {
@@ -4213,14 +4098,13 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     MemoryAccessImmediate imm =
         MakeMemoryAccessImmediate(prefix_len, type.size_log_2());
     if (!this->Validate(this->pc_ + prefix_len, imm)) return 0;
-    ValueType index_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value index = Peek(0, 0, index_type);
-    Value result = CreateValue(type.value_type());
-    if (V8_LIKELY(!CheckStaticallyOutOfBounds(type.size(), imm.offset))) {
-      CALL_INTERFACE_IF_OK_AND_REACHABLE(LoadMem, type, imm, index, &result);
-    }
-    Drop(index);
-    Push(result);
+    ValueType index_type = MemoryIndexType(imm.memory);
+    Value index = Pop(index_type);
+    Value* result = Push(type.value_type());
+    if (V8_LIKELY(
+            !CheckStaticallyOutOfBounds(imm.memory, type.size(), imm.offset))) {
+      CALL_INTERFACE_IF_OK_AND_REACHABLE(LoadMem, type, imm, index, result);
+    }
     return prefix_len + imm.length;
   }
 
@@ -4232,17 +4116,16 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     MemoryAccessImmediate imm =
         MakeMemoryAccessImmediate(opcode_length, max_alignment);
     if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-    ValueType index_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value index = Peek(0, 0, index_type);
-    Value result = CreateValue(kWasmS128);
+    ValueType index_type = MemoryIndexType(imm.memory);
+    Value index = Pop(index_type);
+    Value* result = Push(kWasmS128);
     uintptr_t op_size =
         transform == LoadTransformationKind::kExtend ? 8 : type.size();
-    if (V8_LIKELY(!CheckStaticallyOutOfBounds(op_size, imm.offset))) {
+    if (V8_LIKELY(
+            !CheckStaticallyOutOfBounds(imm.memory, op_size, imm.offset))) {
       CALL_INTERFACE_IF_OK_AND_REACHABLE(LoadTransform, type, transform, imm,
-                                         index, &result);
+                                         index, result);
     }
-    Drop(index);
-    Push(result);
     return opcode_length + imm.length;
   }
 
@@ -4253,17 +4136,15 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     SimdLaneImmediate lane_imm(this, this->pc_ + opcode_length + mem_imm.length,
                                validate);
     if (!this->Validate(this->pc_ + opcode_length, opcode, lane_imm)) return 0;
-    Value v128 = Peek(0, 1, kWasmS128);
-    ValueType index_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value index = Peek(1, 0, index_type);
+    ValueType index_type = MemoryIndexType(mem_imm.memory);
+    auto [index, v128] = Pop(index_type, kWasmS128);
 
-    Value result = CreateValue(kWasmS128);
-    if (V8_LIKELY(!CheckStaticallyOutOfBounds(type.size(), mem_imm.offset))) {
+    Value* result = Push(kWasmS128);
+    if (V8_LIKELY(!CheckStaticallyOutOfBounds(mem_imm.memory, type.size(),
+                                              mem_imm.offset))) {
       CALL_INTERFACE_IF_OK_AND_REACHABLE(LoadLane, type, v128, index, mem_imm,
-                                         lane_imm.lane, &result);
+                                         lane_imm.lane, result);
     }
-    Drop(2);
-    Push(result);
     return opcode_length + mem_imm.length + lane_imm.length;
   }
 
@@ -4275,21 +4156,21 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     SimdLaneImmediate lane_imm(this, this->pc_ + opcode_length + mem_imm.length,
                                validate);
     if (!this->Validate(this->pc_ + opcode_length, opcode, lane_imm)) return 0;
-    Value v128 = Peek(0, 1, kWasmS128);
-    ValueType index_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value index = Peek(1, 0, index_type);
+    ValueType index_type = MemoryIndexType(mem_imm.memory);
+    auto [index, v128] = Pop(index_type, kWasmS128);
 
-    if (V8_LIKELY(!CheckStaticallyOutOfBounds(type.size(), mem_imm.offset))) {
+    if (V8_LIKELY(!CheckStaticallyOutOfBounds(mem_imm.memory, type.size(),
+                                              mem_imm.offset))) {
       CALL_INTERFACE_IF_OK_AND_REACHABLE(StoreLane, type, mem_imm, index, v128,
                                          lane_imm.lane);
     }
-    Drop(2);
     return opcode_length + mem_imm.length + lane_imm.length;
   }
 
-  bool CheckStaticallyOutOfBounds(uintptr_t size, uintptr_t offset) {
-    const bool statically_oob = !base::IsInBounds<uintptr_t>(
-        offset, size, this->module_->max_memory_size);
+  bool CheckStaticallyOutOfBounds(const WasmMemory* memory, uint64_t size,
+                                  uint64_t offset) {
+    const bool statically_oob =
+        !base::IsInBounds<uint64_t>(offset, size, memory->max_memory_size);
     if (V8_UNLIKELY(statically_oob)) {
       CALL_INTERFACE_IF_OK_AND_REACHABLE(Trap, TrapReason::kTrapMemOutOfBounds);
       SetSucceedingCodeDynamicallyUnreachable();
@@ -4301,63 +4182,51 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     MemoryAccessImmediate imm =
         MakeMemoryAccessImmediate(prefix_len, store.size_log_2());
     if (!this->Validate(this->pc_ + prefix_len, imm)) return 0;
-    Value value = Peek(0, 1, store.value_type());
-    ValueType index_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value index = Peek(1, 0, index_type);
-    if (V8_LIKELY(!CheckStaticallyOutOfBounds(store.size(), imm.offset))) {
+    ValueType index_type = MemoryIndexType(imm.memory);
+    auto [index, value] = Pop(index_type, store.value_type());
+    if (V8_LIKELY(!CheckStaticallyOutOfBounds(imm.memory, store.size(),
+                                              imm.offset))) {
       CALL_INTERFACE_IF_OK_AND_REACHABLE(StoreMem, store, imm, index, value);
     }
-    Drop(2);
     return prefix_len + imm.length;
   }
 
   uint32_t SimdConstOp(uint32_t opcode_length) {
     Simd128Immediate imm(this, this->pc_ + opcode_length, validate);
-    Value result = CreateValue(kWasmS128);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(S128Const, imm, &result);
-    Push(result);
+    Value* result = Push(kWasmS128);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(S128Const, imm, result);
     return opcode_length + kSimd128Size;
   }
 
   uint32_t SimdExtractLane(WasmOpcode opcode, ValueType type,
                            uint32_t opcode_length) {
     SimdLaneImmediate imm(this, this->pc_ + opcode_length, validate);
-    if (this->Validate(this->pc_ + opcode_length, opcode, imm)) {
-      Value inputs[] = {Peek(0, 0, kWasmS128)};
-      Value result = CreateValue(type);
-      CALL_INTERFACE_IF_OK_AND_REACHABLE(SimdLaneOp, opcode, imm,
-                                         base::ArrayVector(inputs), &result);
-      Drop(1);
-      Push(result);
-    }
+    if (!this->Validate(this->pc_ + opcode_length, opcode, imm)) return 0;
+    Value input = Pop(kWasmS128);
+    Value* result = Push(type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(SimdLaneOp, opcode, imm,
+                                       base::VectorOf({input}), result);
     return opcode_length + imm.length;
   }
 
   uint32_t SimdReplaceLane(WasmOpcode opcode, ValueType type,
                            uint32_t opcode_length) {
     SimdLaneImmediate imm(this, this->pc_ + opcode_length, validate);
-    if (this->Validate(this->pc_ + opcode_length, opcode, imm)) {
-      Value inputs[2] = {Peek(1, 0, kWasmS128), Peek(0, 1, type)};
-      Value result = CreateValue(kWasmS128);
-      CALL_INTERFACE_IF_OK_AND_REACHABLE(SimdLaneOp, opcode, imm,
-                                         base::ArrayVector(inputs), &result);
-      Drop(2);
-      Push(result);
-    }
+    if (!this->Validate(this->pc_ + opcode_length, opcode, imm)) return 0;
+    auto [v128, lane_val] = Pop(kWasmS128, type);
+    Value* result = Push(kWasmS128);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(
+        SimdLaneOp, opcode, imm, base::VectorOf({v128, lane_val}), result);
     return opcode_length + imm.length;
   }
 
   uint32_t Simd8x16ShuffleOp(uint32_t opcode_length) {
     Simd128Immediate imm(this, this->pc_ + opcode_length, validate);
-    if (this->Validate(this->pc_ + opcode_length, imm)) {
-      Value input1 = Peek(0, 1, kWasmS128);
-      Value input0 = Peek(1, 0, kWasmS128);
-      Value result = CreateValue(kWasmS128);
-      CALL_INTERFACE_IF_OK_AND_REACHABLE(Simd8x16ShuffleOp, imm, input0, input1,
-                                         &result);
-      Drop(2);
-      Push(result);
-    }
+    if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
+    auto [input0, input1] = Pop(kWasmS128, kWasmS128);
+    Value* result = Push(kWasmS128);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(Simd8x16ShuffleOp, imm, input0, input1,
+                                       result);
     return opcode_length + 16;
   }
 
@@ -4480,18 +4349,10 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
           this->DecodeError("invalid simd opcode");
           return 0;
         }
-        ArgVector args = PeekArgs(sig);
-        if (sig->return_count() == 0) {
-          CALL_INTERFACE_IF_OK_AND_REACHABLE(SimdOp, opcode,
-                                             base::VectorOf(args), nullptr);
-          DropArgs(sig);
-        } else {
-          ReturnVector results = CreateReturnValues(sig);
-          CALL_INTERFACE_IF_OK_AND_REACHABLE(
-              SimdOp, opcode, base::VectorOf(args), results.begin());
-          DropArgs(sig);
-          PushReturns(results);
-        }
+        PoppedArgVector args = PopArgs(sig);
+        Value* results = sig->return_count() == 0 ? nullptr : PushReturns(sig);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(SimdOp, opcode, args.data(),
+                                           results);
         return opcode_length;
       }
     }
@@ -4508,17 +4369,21 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                      this->module_);
     // For "unrelated" types the check can still succeed for the null value on
     // instructions treating null as a successful check.
-    return (types_unrelated && (!null_succeeds || !obj.type.is_nullable())) ||
+    // TODO(12868): For string views, this implementation anticipates that
+    // https://github.com/WebAssembly/stringref/issues/40 will be resolved
+    // by making the views standalone types.
+    return (types_unrelated &&
+            (!null_succeeds || !obj.type.is_nullable() ||
+             obj.type.is_string_view() || expected_type.is_string_view())) ||
            (!null_succeeds &&
             (expected_type.representation() == HeapType::kNone ||
              expected_type.representation() == HeapType::kNoFunc ||
              expected_type.representation() == HeapType::kNoExtern));
   }
-  bool TypeCheckAlwaysFails(Value obj, Value rtt) {
+  bool TypeCheckAlwaysFails(Value obj, uint32_t ref_index) {
     // All old casts / checks treat null as failure.
     const bool kNullSucceeds = false;
-    return TypeCheckAlwaysFails(obj, HeapType(rtt.type.ref_index()),
-                                kNullSucceeds);
+    return TypeCheckAlwaysFails(obj, HeapType(ref_index), kNullSucceeds);
   }
 
   // Checks if {obj} is a subtype of type, thus checking will always
@@ -4526,8 +4391,14 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   bool TypeCheckAlwaysSucceeds(Value obj, HeapType type) {
     return IsSubtypeOf(obj.type, ValueType::RefNull(type), this->module_);
   }
-  bool TypeCheckAlwaysSucceeds(Value obj, Value rtt) {
-    return TypeCheckAlwaysSucceeds(obj, HeapType(rtt.type.ref_index()));
+  bool TypeCheckAlwaysSucceeds(Value obj, uint32_t ref_index) {
+    return TypeCheckAlwaysSucceeds(obj, HeapType(ref_index));
+  }
+
+#define GC_DEPRECATED                                             \
+  if (v8_flags.wasm_disable_deprecated) {                         \
+    this->DecodeError("opcode %s is a deprecated gc instruction", \
+                      this->SafeOpcodeNameAt(this->pc()));        \
   }
 
 #define NON_CONST_ONLY                                                    \
@@ -4546,17 +4417,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       case kExprStructNew: {
         StructIndexImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ValueType rtt_type = ValueType::Rtt(imm.index);
-        Value rtt = CreateValue(rtt_type);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.index, &rtt);
-        Push(rtt);
-        ArgVector args = PeekArgs(imm.struct_type, 1);
-        Value value = CreateValue(ValueType::Ref(imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StructNew, imm, rtt, args.begin(),
-                                           &value);
-        Drop(rtt);
-        DropArgs(imm.struct_type);
-        Push(value);
+        PoppedArgVector args = PopArgs(imm.struct_type);
+        Value* value = Push(ValueType::Ref(imm.index));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StructNew, imm, args.data(), value);
         return opcode_length + imm.length;
       }
       case kExprStructNewDefault: {
@@ -4574,14 +4437,8 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
             }
           }
         }
-        ValueType rtt_type = ValueType::Rtt(imm.index);
-        Value rtt = CreateValue(rtt_type);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.index, &rtt);
-        Push(rtt);
-        Value value = CreateValue(ValueType::Ref(imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StructNewDefault, imm, rtt, &value);
-        Drop(rtt);
-        Push(value);
+        Value* value = Push(ValueType::Ref(imm.index));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StructNewDefault, imm, value);
         return opcode_length + imm.length;
       }
       case kExprStructGet: {
@@ -4598,13 +4455,10 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               field_type.name().c_str());
           return 0;
         }
-        Value struct_obj =
-            Peek(0, 0, ValueType::RefNull(field.struct_imm.index));
-        Value value = CreateValue(field_type);
+        Value struct_obj = Pop(ValueType::RefNull(field.struct_imm.index));
+        Value* value = Push(field_type);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StructGet, struct_obj, field, true,
-                                           &value);
-        Drop(struct_obj);
-        Push(value);
+                                           value);
         return opcode_length + field.length;
       }
       case kExprStructGetU:
@@ -4622,13 +4476,10 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               field.struct_imm.index, field_type.name().c_str());
           return 0;
         }
-        Value struct_obj =
-            Peek(0, 0, ValueType::RefNull(field.struct_imm.index));
-        Value value = CreateValue(field_type.Unpacked());
+        Value struct_obj = Pop(ValueType::RefNull(field.struct_imm.index));
+        Value* value = Push(field_type.Unpacked());
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StructGet, struct_obj, field,
-                                           opcode == kExprStructGetS, &value);
-        Drop(struct_obj);
-        Push(value);
+                                           opcode == kExprStructGetS, value);
         return opcode_length + field.length;
       }
       case kExprStructSet: {
@@ -4641,30 +4492,21 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                             field.field_imm.index, field.struct_imm.index);
           return 0;
         }
-        Value field_value =
-            Peek(0, 1, struct_type->field(field.field_imm.index).Unpacked());
-        Value struct_obj =
-            Peek(1, 0, ValueType::RefNull(field.struct_imm.index));
+        auto [struct_obj, field_value] =
+            Pop(ValueType::RefNull(field.struct_imm.index),
+                struct_type->field(field.field_imm.index).Unpacked());
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StructSet, struct_obj, field,
                                            field_value);
-        Drop(2);
         return opcode_length + field.length;
       }
       case kExprArrayNew: {
         ArrayIndexImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ValueType rtt_type = ValueType::Rtt(imm.index);
-        Value rtt = CreateValue(rtt_type);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.index, &rtt);
-        Push(rtt);
-        Value length = Peek(1, 1, kWasmI32);
-        Value initial_value =
-            Peek(2, 0, imm.array_type->element_type().Unpacked());
-        Value value = CreateValue(ValueType::Ref(imm.index));
+        auto [initial_value, length] =
+            Pop(imm.array_type->element_type().Unpacked(), kWasmI32);
+        Value* value = Push(ValueType::Ref(imm.index));
         CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayNew, imm, length, initial_value,
-                                           rtt, &value);
-        Drop(3);  // rtt, length, initial_value.
-        Push(value);
+                                           value);
         return opcode_length + imm.length;
       }
       case kExprArrayNewDefault: {
@@ -4677,16 +4519,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               imm.array_type->element_type().name().c_str());
           return 0;
         }
-        ValueType rtt_type = ValueType::Rtt(imm.index);
-        Value rtt = CreateValue(rtt_type);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.index, &rtt);
-        Push(rtt);
-        Value length = Peek(1, 0, kWasmI32);
-        Value value = CreateValue(ValueType::Ref(imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayNewDefault, imm, length, rtt,
-                                           &value);
-        Drop(2);  // rtt, length
-        Push(value);
+        Value length = Pop(kWasmI32);
+        Value* value = Push(ValueType::Ref(imm.index));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayNewDefault, imm, length, value);
         return opcode_length + imm.length;
       }
       case kExprArrayNewData: {
@@ -4702,34 +4537,17 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               array_imm.index);
           return 0;
         }
-#if V8_TARGET_BIG_ENDIAN
-        // Byte sequences in data segments are interpreted as little endian for
-        // the purposes of this instruction. This means that those will have to
-        // be transformed in big endian architectures. TODO(7748): Implement.
-        if (element_type.value_kind_size() > 1) {
-          UNIMPLEMENTED();
-        }
-#endif
-        const byte* data_index_pc =
+        const uint8_t* data_index_pc =
             this->pc_ + opcode_length + array_imm.length;
         IndexImmediate data_segment(this, data_index_pc, "data segment",
                                     validate);
         if (!this->ValidateDataSegment(data_index_pc, data_segment)) return 0;
 
-        ValueType rtt_type = ValueType::Rtt(array_imm.index);
-        Value rtt = CreateValue(rtt_type);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, array_imm.index, &rtt);
-        Push(rtt);
+        auto [offset, length] = Pop(kWasmI32, kWasmI32);
 
-        Value length = Peek(1, 1, kWasmI32);
-        Value offset = Peek(2, 0, kWasmI32);
-
-        Value array = CreateValue(ValueType::Ref(array_imm.index));
+        Value* array = Push(ValueType::Ref(array_imm.index));
         CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayNewSegment, array_imm,
-                                           data_segment, offset, length, rtt,
-                                           &array);
-        Drop(3);  // rtt, length, offset
-        Push(array);
+                                           data_segment, offset, length, array);
         return opcode_length + array_imm.length + data_segment.length;
       }
       case kExprArrayNewElem: {
@@ -4745,19 +4563,14 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               array_imm.index);
           return 0;
         }
-        const byte* elem_index_pc =
+        const uint8_t* elem_index_pc =
             this->pc_ + opcode_length + array_imm.length;
-        IndexImmediate elem_segment(this, elem_index_pc, "data segment",
+        IndexImmediate elem_segment(this, elem_index_pc, "element segment",
                                     validate);
         if (!this->ValidateElementSegment(elem_index_pc, elem_segment)) {
           return 0;
         }
 
-        ValueType rtt_type = ValueType::Rtt(array_imm.index);
-        Value rtt = CreateValue(rtt_type);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, array_imm.index, &rtt);
-        Push(rtt);
-        Value array = CreateValue(ValueType::Ref(array_imm.index));
         ValueType elem_segment_type =
             this->module_->elem_segments[elem_segment.index].type;
         if (V8_UNLIKELY(
@@ -4769,56 +4582,123 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
           return 0;
         }
 
-        Value length = Peek(1, 1, kWasmI32);
-        Value offset = Peek(2, 0, kWasmI32);
-
+        auto [offset, length] = Pop(kWasmI32, kWasmI32);
+        Value* array = Push(ValueType::Ref(array_imm.index));
         CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayNewSegment, array_imm,
-                                           elem_segment, offset, length, rtt,
-                                           &array);
-        Drop(3);  // rtt, length, offset
-        Push(array);
+                                           elem_segment, offset, length, array);
         return opcode_length + array_imm.length + elem_segment.length;
       }
-      case kExprArrayGetS:
-      case kExprArrayGetU: {
+      case kExprArrayInitData: {
         NON_CONST_ONLY
-        ArrayIndexImmediate imm(this, this->pc_ + opcode_length, validate);
-        if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        if (!VALIDATE(imm.array_type->element_type().is_packed())) {
+        ArrayIndexImmediate array_imm(this, this->pc_ + opcode_length,
+                                      validate);
+        if (!this->Validate(this->pc_ + opcode_length, array_imm)) return 0;
+        if (!array_imm.array_type->mutability()) {
           this->DecodeError(
-              "%s: Immediate array type %d has non-packed type %s. Use "
-              "array.get instead.",
-              WasmOpcodes::OpcodeName(opcode), imm.index,
-              imm.array_type->element_type().name().c_str());
+              "array.init_data can only be used with mutable arrays, found "
+              "array type #%d instead",
+              array_imm.index);
           return 0;
         }
-        Value index = Peek(0, 1, kWasmI32);
-        Value array_obj = Peek(1, 0, ValueType::RefNull(imm.index));
-        Value value = CreateValue(imm.array_type->element_type().Unpacked());
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayGet, array_obj, imm, index,
-                                           opcode == kExprArrayGetS, &value);
-        Drop(2);  // index, array_obj
-        Push(value);
-        return opcode_length + imm.length;
-      }
-      case kExprArrayGet: {
-        NON_CONST_ONLY
-        ArrayIndexImmediate imm(this, this->pc_ + opcode_length, validate);
-        if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        if (!VALIDATE(!imm.array_type->element_type().is_packed())) {
-          this->DecodeError(
+        ValueType element_type = array_imm.array_type->element_type();
+        if (element_type.is_reference()) {
+          this->DecodeError(
+              "array.init_data can only be used with numeric-type arrays, "
+              "found array type #%d instead",
+              array_imm.index);
+          return 0;
+        }
+        const uint8_t* data_index_pc =
+            this->pc_ + opcode_length + array_imm.length;
+        IndexImmediate data_segment(this, data_index_pc, "data segment",
+                                    validate);
+        if (!this->ValidateDataSegment(data_index_pc, data_segment)) return 0;
+
+        auto [array, array_index, data_offset, length] = Pop(
+            ValueType::RefNull(array_imm.index), kWasmI32, kWasmI32, kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayInitSegment, array_imm,
+                                           data_segment, array, array_index,
+                                           data_offset, length);
+        return opcode_length + array_imm.length + data_segment.length;
+      }
+      case kExprArrayInitElem: {
+        NON_CONST_ONLY
+        ArrayIndexImmediate array_imm(this, this->pc_ + opcode_length,
+                                      validate);
+        if (!this->Validate(this->pc_ + opcode_length, array_imm)) return 0;
+        if (!array_imm.array_type->mutability()) {
+          this->DecodeError(
+              "array.init_elem can only be used with mutable arrays, found "
+              "array type #%d instead",
+              array_imm.index);
+          return 0;
+        }
+        ValueType element_type = array_imm.array_type->element_type();
+        if (element_type.is_numeric()) {
+          this->DecodeError(
+              "array.init_elem can only be used with reference-type arrays, "
+              "found array type #%d instead",
+              array_imm.index);
+          return 0;
+        }
+        const uint8_t* elem_index_pc =
+            this->pc_ + opcode_length + array_imm.length;
+        IndexImmediate elem_segment(this, elem_index_pc, "element segment",
+                                    validate);
+        if (!this->ValidateElementSegment(elem_index_pc, elem_segment)) {
+          return 0;
+        }
+        ValueType segment_type =
+            this->module_->elem_segments[elem_segment.index].type;
+        if (!VALIDATE(IsSubtypeOf(segment_type, element_type, this->module_))) {
+          this->DecodeError(
+              "array.init_elem: segment type %s is not a subtype of array "
+              "element type %s",
+              segment_type.name().c_str(), element_type.name().c_str());
+          return 0;
+        }
+
+        auto [array, array_index, elem_offset, length] = Pop(
+            ValueType::RefNull(array_imm.index), kWasmI32, kWasmI32, kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayInitSegment, array_imm,
+                                           elem_segment, array, array_index,
+                                           elem_offset, length);
+        return opcode_length + array_imm.length + elem_segment.length;
+      }
+      case kExprArrayGetS:
+      case kExprArrayGetU: {
+        NON_CONST_ONLY
+        ArrayIndexImmediate imm(this, this->pc_ + opcode_length, validate);
+        if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
+        if (!VALIDATE(imm.array_type->element_type().is_packed())) {
+          this->DecodeError(
+              "%s: Immediate array type %d has non-packed type %s. Use "
+              "array.get instead.",
+              WasmOpcodes::OpcodeName(opcode), imm.index,
+              imm.array_type->element_type().name().c_str());
+          return 0;
+        }
+        auto [array_obj, index] = Pop(ValueType::RefNull(imm.index), kWasmI32);
+        Value* value = Push(imm.array_type->element_type().Unpacked());
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayGet, array_obj, imm, index,
+                                           opcode == kExprArrayGetS, value);
+        return opcode_length + imm.length;
+      }
+      case kExprArrayGet: {
+        NON_CONST_ONLY
+        ArrayIndexImmediate imm(this, this->pc_ + opcode_length, validate);
+        if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
+        if (!VALIDATE(!imm.array_type->element_type().is_packed())) {
+          this->DecodeError(
               "array.get: Immediate array type %d has packed type %s. Use "
               "array.get_s or array.get_u instead.",
               imm.index, imm.array_type->element_type().name().c_str());
           return 0;
         }
-        Value index = Peek(0, 1, kWasmI32);
-        Value array_obj = Peek(1, 0, ValueType::RefNull(imm.index));
-        Value value = CreateValue(imm.array_type->element_type());
+        auto [array_obj, index] = Pop(ValueType::RefNull(imm.index), kWasmI32);
+        Value* value = Push(imm.array_type->element_type());
         CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayGet, array_obj, imm, index,
-                                           true, &value);
-        Drop(2);  // index, array_obj
-        Push(value);
+                                           true, value);
         return opcode_length + imm.length;
       }
       case kExprArraySet: {
@@ -4830,21 +4710,18 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                             imm.index);
           return 0;
         }
-        Value value = Peek(0, 2, imm.array_type->element_type().Unpacked());
-        Value index = Peek(1, 1, kWasmI32);
-        Value array_obj = Peek(2, 0, ValueType::RefNull(imm.index));
+        auto [array_obj, index, value] =
+            Pop(ValueType::RefNull(imm.index), kWasmI32,
+                imm.array_type->element_type().Unpacked());
         CALL_INTERFACE_IF_OK_AND_REACHABLE(ArraySet, array_obj, imm, index,
                                            value);
-        Drop(3);
         return opcode_length + imm.length;
       }
       case kExprArrayLen: {
         NON_CONST_ONLY
-        Value array_obj = Peek(0, 0, kWasmArrayRef);
-        Value value = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayLen, array_obj, &value);
-        Drop(array_obj);
-        Push(value);
+        Value array_obj = Pop(kWasmArrayRef);
+        Value* value = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayLen, array_obj, value);
         return opcode_length;
       }
       case kExprArrayCopy: {
@@ -4871,15 +4748,11 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               src_imm.index, dst_imm.index);
           return 0;
         }
-        // [dst, dst_index, src, src_index, length]
-        Value dst = Peek(4, 0, ValueType::RefNull(dst_imm.index));
-        Value dst_index = Peek(3, 1, kWasmI32);
-        Value src = Peek(2, 2, ValueType::RefNull(src_imm.index));
-        Value src_index = Peek(1, 3, kWasmI32);
-        Value length = Peek(0, 4, kWasmI32);
+        auto [dst, dst_index, src, src_index, length] =
+            Pop(ValueType::RefNull(dst_imm.index), kWasmI32,
+                ValueType::RefNull(src_imm.index), kWasmI32, kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayCopy, dst, dst_index, src,
-                                           src_index, length);
-        Drop(5);
+                                           src_index, src_imm, length);
         return opcode_length + dst_imm.length + src_imm.length;
       }
       case kExprArrayFill: {
@@ -4893,13 +4766,11 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
           return 0;
         }
 
-        Value array = Peek(3, 0, ValueType::RefNull(array_imm.index));
-        Value offset = Peek(2, 1, kWasmI32);
-        Value value = Peek(1, 2, array_imm.array_type->element_type());
-        Value length = Peek(0, 3, kWasmI32);
+        auto [array, offset, value, length] =
+            Pop(ValueType::RefNull(array_imm.index), kWasmI32,
+                array_imm.array_type->element_type().Unpacked(), kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayFill, array_imm, array, offset,
                                            value, length);
-        Drop(4);
         return opcode_length + array_imm.length;
       }
       case kExprArrayNewFixed: {
@@ -4917,45 +4788,34 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               length_imm.index, kV8MaxWasmArrayNewFixedLength);
           return 0;
         }
-        Value rtt = CreateValue(ValueType::Rtt(array_imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, array_imm.index, &rtt);
-        Push(rtt);
         ValueType element_type = array_imm.array_type->element_type();
         std::vector<ValueType> element_types(elem_count,
                                              element_type.Unpacked());
         FunctionSig element_sig(0, elem_count, element_types.data());
-        ArgVector elements = PeekArgs(&element_sig, 1);
-        Value result = CreateValue(ValueType::Ref(array_imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayNewFixed, array_imm, elements,
-                                           rtt, &result);
-        Drop(elem_count + 1);
-        Push(result);
+        PoppedArgVector elements = PopArgs(&element_sig);
+        Value* result = Push(ValueType::Ref(array_imm.index));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(ArrayNewFixed, array_imm, length_imm,
+                                           elements.data(), result);
         return opcode_length + array_imm.length + length_imm.length;
       }
       case kExprI31New: {
-        Value input = Peek(0, 0, kWasmI32);
-        Value value = CreateValue(ValueType::Ref(HeapType::kI31));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(I31New, input, &value);
-        Drop(input);
-        Push(value);
+        Value input = Pop(kWasmI32);
+        Value* value = Push(ValueType::Ref(HeapType::kI31));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(I31New, input, value);
         return opcode_length;
       }
       case kExprI31GetS: {
         NON_CONST_ONLY
-        Value i31 = Peek(0, 0, kWasmI31Ref);
-        Value value = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(I31GetS, i31, &value);
-        Drop(i31);
-        Push(value);
+        Value i31 = Pop(kWasmI31Ref);
+        Value* value = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(I31GetS, i31, value);
         return opcode_length;
       }
       case kExprI31GetU: {
         NON_CONST_ONLY
-        Value i31 = Peek(0, 0, kWasmI31Ref);
-        Value value = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(I31GetU, i31, &value);
-        Drop(i31);
-        Push(value);
+        Value i31 = Pop(kWasmI31Ref);
+        Value* value = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(I31GetU, i31, value);
         return opcode_length;
       }
       case kExprRefCast:
@@ -4963,20 +4823,13 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         NON_CONST_ONLY
         HeapTypeImmediate imm(this->enabled_, this, this->pc_ + opcode_length,
                               validate);
-        this->Validate(this->pc_ + opcode_length, imm);
-        if (!VALIDATE(this->ok())) return 0;
+        if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
         opcode_length += imm.length;
 
-        std::optional<Value> rtt;
+        Value obj = Pop();
+
         HeapType target_type = imm.type;
-        if (imm.type.is_index()) {
-          rtt = CreateValue(ValueType::Rtt(imm.type.ref_index()));
-          CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.type.ref_index(),
-                                             &rtt.value());
-          Push(rtt.value());
-        }
 
-        Value obj = Peek(rtt.has_value() ? 1 : 0);
         if (!VALIDATE((obj.type.is_object_reference() &&
                        IsSameTypeHierarchy(obj.type.heap_type(), target_type,
                                            this->module_)) ||
@@ -4989,34 +4842,38 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               obj.type.name().c_str(), target_type.name().c_str());
           return 0;
         }
+        if (!VALIDATE(!target_type.is_string_view())) {
+          // TODO(12868): This reflects the current state of discussion at
+          // https://github.com/WebAssembly/stringref/issues/40
+          // It is suboptimal because it allows classifying a stringview_wtf16
+          // as a stringref. This would be solved by making the views types
+          // that aren't subtypes of anyref, which is one of the possible
+          // resolutions of that discussion.
+          this->DecodeError(
+              this->pc_,
+              "Invalid type for %s: string views are not classifiable",
+              WasmOpcodes::OpcodeName(opcode));
+          return 0;
+        }
 
         bool null_succeeds = opcode == kExprRefCastNull;
-        Value value = CreateValue(ValueType::RefMaybeNull(
+        Value* value = Push(ValueType::RefMaybeNull(
             target_type, null_succeeds ? kNullable : kNonNullable));
         if (current_code_reachable_and_ok_) {
           // This logic ensures that code generation can assume that functions
           // can only be cast to function types, and data objects to data types.
           if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, target_type))) {
-            // Drop the rtt from the stack, then forward the object value to the
-            // result.
-            if (rtt.has_value()) {
-              CALL_INTERFACE(Drop);
-            }
             if (obj.type.is_nullable() && !null_succeeds) {
-              CALL_INTERFACE(AssertNotNullTypecheck, obj, &value);
+              CALL_INTERFACE(AssertNotNullTypecheck, obj, value);
             } else {
-              CALL_INTERFACE(Forward, obj, &value);
+              CALL_INTERFACE(Forward, obj, value);
             }
           } else if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, target_type,
                                                       null_succeeds))) {
-            if (rtt.has_value()) {
-              CALL_INTERFACE(Drop);
-            }
             // Unrelated types. The only way this will not trap is if the object
             // is null.
             if (obj.type.is_nullable() && null_succeeds) {
-              // Drop rtt from the stack, then assert that obj is null.
-              CALL_INTERFACE(AssertNullTypecheck, obj, &value);
+              CALL_INTERFACE(AssertNullTypecheck, obj, value);
             } else {
               CALL_INTERFACE(Trap, TrapReason::kTrapIllegalCast);
               // We know that the following code is not reachable, but according
@@ -5024,16 +4881,15 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               SetSucceedingCodeDynamicallyUnreachable();
             }
           } else {
-            if (rtt.has_value()) {
-              CALL_INTERFACE(RefCast, obj, rtt.value(), &value, null_succeeds);
+            if (target_type.is_index()) {
+              CALL_INTERFACE(RefCast, target_type.ref_index(), obj, value,
+                             null_succeeds);
             } else {
-              CALL_INTERFACE(RefCastAbstract, obj, target_type, &value,
+              CALL_INTERFACE(RefCastAbstract, obj, target_type, value,
                              null_succeeds);
             }
           }
         }
-        Drop(1 + rtt.has_value());
-        Push(value);
         return opcode_length;
       }
       case kExprRefTestNull:
@@ -5041,21 +4897,12 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         NON_CONST_ONLY
         HeapTypeImmediate imm(this->enabled_, this, this->pc_ + opcode_length,
                               validate);
-        this->Validate(this->pc_ + opcode_length, imm);
-        if (!VALIDATE(this->ok())) return 0;
+        if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
         opcode_length += imm.length;
 
-        std::optional<Value> rtt;
+        Value obj = Pop();
         HeapType target_type = imm.type;
-        if (imm.type.is_index()) {
-          rtt = CreateValue(ValueType::Rtt(imm.type.ref_index()));
-          CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.type.ref_index(),
-                                             &rtt.value());
-          Push(rtt.value());
-        }
-
-        Value obj = Peek(rtt.has_value() ? 1 : 0);
-        Value value = CreateValue(kWasmI32);
+        Value* result = Push(kWasmI32);
 
         if (!VALIDATE((obj.type.is_object_reference() &&
                        IsSameTypeHierarchy(obj.type.heap_type(), target_type,
@@ -5069,58 +4916,58 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               obj.type.name().c_str(), target_type.name().c_str());
           return 0;
         }
+        if (!VALIDATE(!target_type.is_string_view())) {
+          // TODO(12868): This reflects the current state of discussion at
+          // https://github.com/WebAssembly/stringref/issues/40
+          // It is suboptimal because it allows classifying a stringview_wtf16
+          // as a stringref. This would be solved by making the views types
+          // that aren't subtypes of anyref, which is one of the possible
+          // resolutions of that discussion.
+          this->DecodeError(
+              this->pc_,
+              "Invalid type for %s: string views are not classifiable",
+              WasmOpcodes::OpcodeName(opcode));
+          return 0;
+        }
         bool null_succeeds = opcode == kExprRefTestNull;
         if (V8_LIKELY(current_code_reachable_and_ok_)) {
           // This logic ensures that code generation can assume that functions
           // can only be cast to function types, and data objects to data types.
           if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, target_type))) {
-            if (rtt.has_value()) {
-              // Drop rtt.
-              CALL_INTERFACE(Drop);
-            }
             // Type checking can still fail for null.
             if (obj.type.is_nullable() && !null_succeeds) {
               // We abuse ref.as_non_null, which isn't otherwise used as a unary
               // operator, as a sentinel for the negation of ref.is_null.
-              CALL_INTERFACE(UnOp, kExprRefAsNonNull, obj, &value);
+              CALL_INTERFACE(UnOp, kExprRefAsNonNull, obj, result);
             } else {
               CALL_INTERFACE(Drop);
-              CALL_INTERFACE(I32Const, &value, 1);
+              CALL_INTERFACE(I32Const, result, 1);
             }
           } else if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, target_type,
                                                       null_succeeds))) {
-            if (rtt.has_value()) {
-              // Drop rtt.
-              CALL_INTERFACE(Drop);
-            }
             CALL_INTERFACE(Drop);
-            CALL_INTERFACE(I32Const, &value, 0);
+            CALL_INTERFACE(I32Const, result, 0);
           } else {
-            if (rtt.has_value()) {
-              // RTT => Cast to concrete (index) type.
-              CALL_INTERFACE(RefTest, obj, rtt.value(), &value, null_succeeds);
+            if (imm.type.is_index()) {
+              CALL_INTERFACE(RefTest, imm.type.ref_index(), obj, result,
+                             null_succeeds);
             } else {
-              // No RTT => Cast to abstract (non-index) types.
-              CALL_INTERFACE(RefTestAbstract, obj, target_type, &value,
+              CALL_INTERFACE(RefTestAbstract, obj, target_type, result,
                              null_succeeds);
             }
           }
         }
-        Drop(1 + rtt.has_value());
-        Push(value);
         return opcode_length;
       }
       case kExprRefTestDeprecated: {
+        GC_DEPRECATED
         NON_CONST_ONLY
         IndexImmediate imm(this, this->pc_ + opcode_length, "type index",
                            validate);
         if (!this->ValidateType(this->pc_ + opcode_length, imm)) return 0;
         opcode_length += imm.length;
-        Value rtt = CreateValue(ValueType::Rtt(imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.index, &rtt);
-        Push(rtt);
-        Value obj = Peek(1);
-        Value value = CreateValue(kWasmI32);
+        Value obj = Pop();
+        Value* value = Push(kWasmI32);
         if (!VALIDATE(IsSubtypeOf(obj.type, kWasmFuncRef, this->module_) ||
                       IsSubtypeOf(obj.type, kWasmStructRef, this->module_) ||
                       IsSubtypeOf(obj.type, kWasmArrayRef, this->module_) ||
@@ -5133,28 +4980,24 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         if (current_code_reachable_and_ok_) {
           // This logic ensures that code generation can assume that functions
           // can only be cast to function types, and data objects to data types.
-          if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, rtt))) {
-            // Drop rtt.
-            CALL_INTERFACE(Drop);
+          if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, imm.index))) {
             // Type checking can still fail for null.
             if (obj.type.is_nullable()) {
               // We abuse ref.as_non_null, which isn't otherwise used as a unary
               // operator, as a sentinel for the negation of ref.is_null.
-              CALL_INTERFACE(UnOp, kExprRefAsNonNull, obj, &value);
+              CALL_INTERFACE(UnOp, kExprRefAsNonNull, obj, value);
             } else {
               CALL_INTERFACE(Drop);
-              CALL_INTERFACE(I32Const, &value, 1);
+              CALL_INTERFACE(I32Const, value, 1);
             }
-          } else if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, rtt))) {
+          } else if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, imm.index))) {
             CALL_INTERFACE(Drop);
-            CALL_INTERFACE(Drop);
-            CALL_INTERFACE(I32Const, &value, 0);
+            CALL_INTERFACE(I32Const, value, 0);
           } else {
-            CALL_INTERFACE(RefTest, obj, rtt, &value, /*null_succeeds*/ false);
+            CALL_INTERFACE(RefTest, imm.index, obj, value,
+                           /*null_succeeds*/ false);
           }
         }
-        Drop(2);
-        Push(value);
         return opcode_length;
       }
       case kExprRefCastNop: {
@@ -5171,7 +5014,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
         opcode_length += imm.length;
         HeapType target_type = imm.type;
-        Value obj = Peek(0);
+        Value obj = Pop();
         if (!VALIDATE((obj.type.is_object_reference() &&
                        IsSameTypeHierarchy(obj.type.heap_type(), target_type,
                                            this->module_)) ||
@@ -5184,22 +5027,18 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               obj.type.name().c_str(), target_type.name().c_str());
           return 0;
         }
-        Value value = CreateValue(ValueType::Ref(target_type));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(Forward, obj, &value);
-        Drop(obj);
-        Push(value);
+        Value* value = Push(ValueType::Ref(target_type));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(Forward, obj, value);
         return opcode_length;
       }
       case kExprRefCastDeprecated: {
+        GC_DEPRECATED
         NON_CONST_ONLY
         IndexImmediate imm(this, this->pc_ + opcode_length, "type index",
                            validate);
         if (!this->ValidateType(this->pc_ + opcode_length, imm)) return 0;
         opcode_length += imm.length;
-        Value rtt = CreateValue(ValueType::Rtt(imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.index, &rtt);
-        Push(rtt);
-        Value obj = Peek(1);
+        Value obj = Pop();
         if (!VALIDATE(IsSubtypeOf(obj.type, kWasmFuncRef, this->module_) ||
                       IsSubtypeOf(obj.type, kWasmStructRef, this->module_) ||
                       IsSubtypeOf(obj.type, kWasmArrayRef, this->module_) ||
@@ -5209,26 +5048,19 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                        "null array)");
           return 0;
         }
-        // If either value is bottom, we emit the most specific type possible.
-        DCHECK(!rtt.type.is_bottom());
-        Value value = CreateValue(ValueType::RefMaybeNull(
+        Value* value = Push(ValueType::RefMaybeNull(
             imm.index,
             obj.type.is_bottom() ? kNonNullable : obj.type.nullability()));
         if (current_code_reachable_and_ok_) {
           // This logic ensures that code generation can assume that functions
           // can only be cast to function types, and data objects to data types.
-          if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, rtt))) {
-            // Drop the rtt from the stack, then forward the object value to the
-            // result.
-            CALL_INTERFACE(Drop);
-            CALL_INTERFACE(Forward, obj, &value);
-          } else if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, rtt))) {
+          if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, imm.index))) {
+            CALL_INTERFACE(Forward, obj, value);
+          } else if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, imm.index))) {
             // Unrelated types. The only way this will not trap is if the object
             // is null.
             if (obj.type.is_nullable()) {
-              // Drop rtt from the stack, then assert that obj is null.
-              CALL_INTERFACE(Drop);
-              CALL_INTERFACE(AssertNullTypecheck, obj, &value);
+              CALL_INTERFACE(AssertNullTypecheck, obj, value);
             } else {
               CALL_INTERFACE(Trap, TrapReason::kTrapIllegalCast);
               // We know that the following code is not reachable, but according
@@ -5237,128 +5069,36 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
             }
           } else {
             bool null_succeeds = true;
-            CALL_INTERFACE(RefCast, obj, rtt, &value, null_succeeds);
+            CALL_INTERFACE(RefCast, imm.index, obj, value, null_succeeds);
           }
         }
-        Drop(2);
-        Push(value);
         return opcode_length;
       }
+      case kExprBrOnCastGeneric: {
+        NON_CONST_ONLY
+        uint32_t pc_offset = opcode_length;
+        BrOnCastImmediate flags_imm(this, this->pc_ + pc_offset, validate);
+        pc_offset += flags_imm.length;
+        return ParseBrOnCast(opcode, pc_offset, flags_imm.flags);
+      }
+      case kExprBrOnCastFailGeneric: {
+        NON_CONST_ONLY
+        uint32_t pc_offset = opcode_length;
+        BrOnCastImmediate flags_imm(this, this->pc_ + pc_offset, validate);
+        pc_offset += flags_imm.length;
+        return ParseBrOnCastFail(opcode, pc_offset, flags_imm.flags);
+      }
       case kExprBrOnCast:
       case kExprBrOnCastNull: {
+        GC_DEPRECATED
         NON_CONST_ONLY
-        BranchDepthImmediate branch_depth(this, this->pc_ + opcode_length,
-                                          validate);
-        if (!this->Validate(this->pc_ + opcode_length, branch_depth,
-                            control_.size())) {
-          return 0;
-        }
-        uint32_t pc_offset = opcode_length + branch_depth.length;
-
-        HeapTypeImmediate imm(this->enabled_, this, this->pc_ + pc_offset,
-                              validate);
-        this->Validate(this->pc_ + opcode_length, imm);
-        if (!VALIDATE(this->ok())) return 0;
-        pc_offset += imm.length;
-
-        std::optional<Value> rtt;
-        HeapType target_type = imm.type;
-        if (imm.type.is_index()) {
-          rtt = CreateValue(ValueType::Rtt(imm.type.ref_index()));
-          CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.type.ref_index(),
-                                             &rtt.value());
-          // Differently to other instructions we don't push the RTT yet.
-        }
-
-        Value obj = Peek(0);
-
-        if (!VALIDATE((obj.type.is_object_reference() &&
-                       IsSameTypeHierarchy(obj.type.heap_type(), target_type,
-                                           this->module_)) ||
-                      obj.type.is_bottom())) {
-          this->DecodeError(
-              obj.pc(),
-              "Invalid types for %s: %s of type %s has to "
-              "be in the same reference type hierarchy as (ref %s)",
-              WasmOpcodes::OpcodeName(opcode), SafeOpcodeNameAt(obj.pc()),
-              obj.type.name().c_str(), target_type.name().c_str());
-          return 0;
-        }
-
-        Control* c = control_at(branch_depth.depth);
-        if (c->br_merge()->arity == 0) {
-          this->DecodeError("%s must target a branch of arity at least 1",
-                            WasmOpcodes::OpcodeName(opcode));
-          return 0;
-        }
-        // Attention: contrary to most other instructions, we modify the
-        // stack before calling the interface function. This makes it
-        // significantly more convenient to pass around the values that
-        // will be on the stack when the branch is taken.
-        // TODO(jkummerow): Reconsider this choice.
-        Drop(obj);
-        bool null_succeeds = opcode == kExprBrOnCastNull;
-        Push(CreateValue(ValueType::RefMaybeNull(
-            target_type, null_succeeds ? kNullable : kNonNullable)));
-        // The {value_on_branch} parameter we pass to the interface must
-        // be pointer-identical to the object on the stack.
-        Value* value_on_branch = stack_value(1);
-        if (!VALIDATE(TypeCheckBranch<true>(c, 0))) return 0;
-        if (V8_LIKELY(current_code_reachable_and_ok_)) {
-          // This logic ensures that code generation can assume that functions
-          // can only be cast to function types, and data objects to data types.
-          if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, target_type))) {
-            if (rtt.has_value()) {
-              CALL_INTERFACE(Drop);  // rtt
-            }
-            // The branch will still not be taken on null if not
-            // {null_succeeds}.
-            if (obj.type.is_nullable() && !null_succeeds) {
-              CALL_INTERFACE(BrOnNonNull, obj, value_on_branch,
-                             branch_depth.depth, false);
-            } else {
-              CALL_INTERFACE(Forward, obj, value_on_branch);
-              CALL_INTERFACE(BrOrRet, branch_depth.depth, 0);
-              // We know that the following code is not reachable, but according
-              // to the spec it technically is. Set it to spec-only reachable.
-              SetSucceedingCodeDynamicallyUnreachable();
-            }
-            c->br_merge()->reached = true;
-          } else if (V8_LIKELY(!TypeCheckAlwaysFails(obj, target_type,
-                                                     null_succeeds))) {
-            if (rtt.has_value()) {
-              CALL_INTERFACE(BrOnCast, obj, rtt.value(), value_on_branch,
-                             branch_depth.depth, null_succeeds);
-            } else {
-              CALL_INTERFACE(BrOnCastAbstract, obj, target_type,
-                             value_on_branch, branch_depth.depth,
-                             null_succeeds);
-            }
-            c->br_merge()->reached = true;
-          } else {
-            // Otherwise the types are unrelated. Do not branch.
-            if (rtt.has_value()) {
-              CALL_INTERFACE(Drop);  // rtt
-            }
-          }
-        }
-
-        Drop(1);    // value_on_branch
-        Push(obj);  // Restore stack state on fallthrough.
-        if (current_code_reachable_and_ok_ && null_succeeds) {
-          // As null branches, the type on fallthrough will be the non-null
-          // variant of the input type.
-          // Note that this is handled differently for br_on_cast_fail for which
-          // the Forward is handled by TurboFan.
-          // TODO(mliedtke): This currently deviates from the spec and is
-          // discussed at
-          // https://github.com/WebAssembly/gc/issues/342#issuecomment-1354505307.
-          stack_value(1)->type = obj.type.AsNonNull();
-          CALL_INTERFACE(Forward, obj, stack_value(1));
-        }
-        return pc_offset;
+        BrOnCastFlags flags;
+        flags.src_is_null = Peek().type.is_nullable();
+        flags.res_is_null = opcode == kExprBrOnCastNull;
+        return ParseBrOnCast(opcode, opcode_length, flags);
       }
       case kExprBrOnCastDeprecated: {
+        GC_DEPRECATED
         NON_CONST_ONLY
         BranchDepthImmediate branch_depth(this, this->pc_ + opcode_length,
                                           validate);
@@ -5370,11 +5110,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         IndexImmediate imm(this, this->pc_ + pc_offset, "type index", validate);
         if (!this->ValidateType(this->pc_ + opcode_length, imm)) return 0;
         pc_offset += imm.length;
-        Value rtt = CreateValue(ValueType::Rtt(imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.index, &rtt);
-        // Don't bother pushing the rtt, as we'd drop it again immediately
-        // anyway.
-        Value obj = Peek(0);
+        Value obj = Pop();
         if (!VALIDATE(IsSubtypeOf(obj.type, kWasmFuncRef, this->module_) ||
                       IsSubtypeOf(obj.type, kWasmStructRef, this->module_) ||
                       IsSubtypeOf(obj.type, kWasmArrayRef, this->module_) ||
@@ -5390,22 +5126,12 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               "br_on_cast must target a branch of arity at least 1");
           return 0;
         }
-        // Attention: contrary to most other instructions, we modify the
-        // stack before calling the interface function. This makes it
-        // significantly more convenient to pass around the values that
-        // will be on the stack when the branch is taken.
-        // TODO(jkummerow): Reconsider this choice.
-        Drop(obj);
-        Push(CreateValue(ValueType::Ref(imm.index)));
-        // The {value_on_branch} parameter we pass to the interface must
-        // be pointer-identical to the object on the stack.
-        Value* value_on_branch = stack_value(1);
-        if (!VALIDATE(TypeCheckBranch<true>(c, 0))) return 0;
+        Value* value_on_branch = Push(ValueType::Ref(imm.index));
+        if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
         if (V8_LIKELY(current_code_reachable_and_ok_)) {
           // This logic ensures that code generation can assume that functions
           // can only be cast to function types, and data objects to data types.
-          if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, rtt))) {
-            CALL_INTERFACE(Drop);  // rtt
+          if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, imm.index))) {
             // The branch will still not be taken on null.
             if (obj.type.is_nullable()) {
               CALL_INTERFACE(BrOnNonNull, obj, value_on_branch,
@@ -5418,128 +5144,29 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
               SetSucceedingCodeDynamicallyUnreachable();
             }
             c->br_merge()->reached = true;
-          } else if (V8_LIKELY(!TypeCheckAlwaysFails(obj, rtt))) {
+          } else if (V8_LIKELY(!TypeCheckAlwaysFails(obj, imm.index))) {
             bool null_succeeds = false;
-            CALL_INTERFACE(BrOnCast, obj, rtt, value_on_branch,
+            CALL_INTERFACE(BrOnCast, imm.index, obj, value_on_branch,
                            branch_depth.depth, null_succeeds);
             c->br_merge()->reached = true;
-          } else {
-            // Otherwise the types are unrelated. Do not branch.
-            CALL_INTERFACE(Drop);  // rtt
           }
         }
 
-        Drop(1);    // value_on_branch
+        Drop(*value_on_branch);
         Push(obj);  // Restore stack state on fallthrough.
         return pc_offset;
       }
       case kExprBrOnCastFail:
       case kExprBrOnCastFailNull: {
+        GC_DEPRECATED
         NON_CONST_ONLY
-        BranchDepthImmediate branch_depth(this, this->pc_ + opcode_length,
-                                          validate);
-        if (!this->Validate(this->pc_ + opcode_length, branch_depth,
-                            control_.size())) {
-          return 0;
-        }
-        uint32_t pc_offset = opcode_length + branch_depth.length;
-        HeapTypeImmediate imm(this->enabled_, this, this->pc_ + pc_offset,
-                              validate);
-        this->Validate(this->pc_ + opcode_length, imm);
-        if (!VALIDATE(this->ok())) return 0;
-        pc_offset += imm.length;
-
-        std::optional<Value> rtt;
-        HeapType target_type = imm.type;
-        if (imm.type.is_index()) {
-          rtt = CreateValue(ValueType::Rtt(imm.type.ref_index()));
-          CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.type.ref_index(),
-                                             &rtt.value());
-          // Differently to other instructions we don't push the RTT yet.
-        }
-
-        Value obj = Peek(0);
-
-        if (!VALIDATE((obj.type.is_object_reference() &&
-                       IsSameTypeHierarchy(obj.type.heap_type(), target_type,
-                                           this->module_)) ||
-                      obj.type.is_bottom())) {
-          this->DecodeError(
-              obj.pc(),
-              "Invalid types for %s: %s of type %s has to "
-              "be in the same reference type hierarchy as (ref %s)",
-              WasmOpcodes::OpcodeName(opcode), SafeOpcodeNameAt(obj.pc()),
-              obj.type.name().c_str(), target_type.name().c_str());
-          return 0;
-        }
-
-        Control* c = control_at(branch_depth.depth);
-        if (c->br_merge()->arity == 0) {
-          this->DecodeError("%s must target a branch of arity at least 1",
-                            WasmOpcodes::OpcodeName(opcode));
-          return 0;
-        }
-
-        bool null_succeeds = opcode == kExprBrOnCastFailNull;
-        if (null_succeeds) {
-          // If null is treated as a successful cast, then the branch type is
-          // guaranteed to be non-null.
-          Drop(obj);
-          Push(CreateValue(obj.type.AsNonNull()));
-        }
-        if (!VALIDATE(TypeCheckBranch<true>(c, 0))) return 0;
-
-        Value result_on_fallthrough = CreateValue(ValueType::RefMaybeNull(
-            target_type, (obj.type.is_bottom() || !null_succeeds)
-                             ? kNonNullable
-                             : obj.type.nullability()));
-        if (V8_LIKELY(current_code_reachable_and_ok_)) {
-          // This logic ensures that code generation can assume that functions
-          // can only be cast between compatible types.
-          if (V8_UNLIKELY(
-                  TypeCheckAlwaysFails(obj, target_type, null_succeeds))) {
-            if (rtt.has_value()) {
-              CALL_INTERFACE(Drop);  // rtt
-            }
-            // The types are incompatible (i.e. neither of the two types is a
-            // subtype of the other). Always branch.
-            CALL_INTERFACE(Forward, obj, stack_value(1));
-            CALL_INTERFACE(BrOrRet, branch_depth.depth, 0);
-            // We know that the following code is not reachable, but according
-            // to the spec it technically is. Set it to spec-only reachable.
-            SetSucceedingCodeDynamicallyUnreachable();
-            c->br_merge()->reached = true;
-          } else if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, target_type))) {
-            if (rtt.has_value()) {
-              CALL_INTERFACE(Drop);  // rtt
-            }
-            // The branch can still be taken on null.
-            if (obj.type.is_nullable() && !null_succeeds) {
-              CALL_INTERFACE(BrOnNull, obj, branch_depth.depth, true,
-                             &result_on_fallthrough);
-              c->br_merge()->reached = true;
-            }
-            // Otherwise, the type check always succeeds. Do not branch. Also,
-            // the object is already on the stack; do not manipulate the stack.
-          } else {
-            if (rtt.has_value()) {
-              CALL_INTERFACE(BrOnCastFail, obj, rtt.value(),
-                             &result_on_fallthrough, branch_depth.depth,
-                             null_succeeds);
-            } else {
-              CALL_INTERFACE(BrOnCastFailAbstract, obj, target_type,
-                             &result_on_fallthrough, branch_depth.depth,
-                             null_succeeds);
-            }
-            c->br_merge()->reached = true;
-          }
-        }
-        // Make sure the correct value is on the stack state on fallthrough.
-        Drop(obj);
-        Push(result_on_fallthrough);
-        return pc_offset;
+        BrOnCastFlags flags(0);
+        flags.src_is_null = Peek().type.is_nullable();
+        flags.res_is_null = opcode == kExprBrOnCastFailNull;
+        return ParseBrOnCastFail(opcode, opcode_length, flags);
       }
       case kExprBrOnCastFailDeprecated: {
+        GC_DEPRECATED
         NON_CONST_ONLY
         BranchDepthImmediate branch_depth(this, this->pc_ + opcode_length,
                                           validate);
@@ -5551,9 +5178,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         IndexImmediate imm(this, this->pc_ + pc_offset, "type index", validate);
         if (!this->ValidateType(this->pc_ + opcode_length, imm)) return 0;
         pc_offset += imm.length;
-        Value rtt = CreateValue(ValueType::Rtt(imm.index));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(RttCanon, imm.index, &rtt);
-        Value obj = Peek(0);
+        Value obj = Peek();
         if (!VALIDATE(IsSubtypeOf(obj.type, kWasmFuncRef, this->module_) ||
                       IsSubtypeOf(obj.type, kWasmStructRef, this->module_) ||
                       IsSubtypeOf(obj.type, kWasmArrayRef, this->module_) ||
@@ -5570,34 +5195,32 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
           return 0;
         }
 
-        if (!VALIDATE(TypeCheckBranch<true>(c, 0))) return 0;
+        if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
         Value result_on_fallthrough = CreateValue(ValueType::Ref(imm.index));
         if (V8_LIKELY(current_code_reachable_and_ok_)) {
           // This logic ensures that code generation can assume that functions
           // can only be cast to function types, and data objects to data types.
-          if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, rtt))) {
-            // Drop {rtt} in the interface.
-            CALL_INTERFACE(Drop);
+          if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, imm.index))) {
             // Otherwise the types are unrelated. Always branch.
             CALL_INTERFACE(BrOrRet, branch_depth.depth, 0);
             // We know that the following code is not reachable, but according
             // to the spec it technically is. Set it to spec-only reachable.
             SetSucceedingCodeDynamicallyUnreachable();
             c->br_merge()->reached = true;
-          } else if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, rtt))) {
-            // Drop {rtt} in the interface.
-            CALL_INTERFACE(Drop);
+          } else if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, imm.index))) {
             // The branch can still be taken on null.
             if (obj.type.is_nullable()) {
               CALL_INTERFACE(BrOnNull, obj, branch_depth.depth, true,
                              &result_on_fallthrough);
               c->br_merge()->reached = true;
+            } else {
+              // Otherwise, the type check always succeeds. Do not branch. Also,
+              // make sure the object remains on the stack.
+              result_on_fallthrough = obj;
             }
-            // Otherwise, the type check always succeeds. Do not branch. Also,
-            // the object is already on the stack; do not manipulate the stack.
           } else {
             bool null_succeeds = false;
-            CALL_INTERFACE(BrOnCastFail, obj, rtt, &result_on_fallthrough,
+            CALL_INTERFACE(BrOnCastFail, imm.index, obj, &result_on_fallthrough,
                            branch_depth.depth, null_succeeds);
             c->br_merge()->reached = true;
           }
@@ -5609,31 +5232,30 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       }
 #define ABSTRACT_TYPE_CHECK(h_type)                                            \
   case kExprRefIs##h_type: {                                                   \
+    GC_DEPRECATED                                                              \
     NON_CONST_ONLY                                                             \
-    Value arg = Peek(0, 0, kWasmAnyRef);                                       \
+    Value arg = Pop(kWasmAnyRef);                                              \
     if (!VALIDATE(this->ok())) return 0;                                       \
-    Value result = CreateValue(kWasmI32);                                      \
+    Value* result = Push(kWasmI32);                                            \
     if (V8_LIKELY(current_code_reachable_and_ok_)) {                           \
       if (IsHeapSubtypeOf(arg.type.heap_type(), HeapType(HeapType::k##h_type), \
                           this->module_)) {                                    \
         if (arg.type.is_nullable()) {                                          \
           /* We abuse ref.as_non_null, which isn't otherwise used as a unary   \
            * operator, as a sentinel for the negation of ref.is_null. */       \
-          CALL_INTERFACE(UnOp, kExprRefAsNonNull, arg, &result);               \
+          CALL_INTERFACE(UnOp, kExprRefAsNonNull, arg, result);                \
         } else {                                                               \
           CALL_INTERFACE(Drop);                                                \
-          CALL_INTERFACE(I32Const, &result, 1);                                \
+          CALL_INTERFACE(I32Const, result, 1);                                 \
         }                                                                      \
       } else if (!IsHeapSubtypeOf(HeapType(HeapType::k##h_type),               \
                                   arg.type.heap_type(), this->module_)) {      \
         CALL_INTERFACE(Drop);                                                  \
-        CALL_INTERFACE(I32Const, &result, 0);                                  \
+        CALL_INTERFACE(I32Const, result, 0);                                   \
       } else {                                                                 \
-        CALL_INTERFACE(RefIs##h_type, arg, &result);                           \
+        CALL_INTERFACE(RefIs##h_type, arg, result);                            \
       }                                                                        \
     }                                                                          \
-    Drop(arg);                                                                 \
-    Push(result);                                                              \
     return opcode_length;                                                      \
   }
         ABSTRACT_TYPE_CHECK(Struct)
@@ -5643,18 +5265,19 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
 
 #define ABSTRACT_TYPE_CAST(h_type)                                             \
   case kExprRefAs##h_type: {                                                   \
+    GC_DEPRECATED                                                              \
     NON_CONST_ONLY                                                             \
-    Value arg = Peek(0, 0, kWasmAnyRef);                                       \
+    Value arg = Pop(kWasmAnyRef);                                              \
     ValueType non_nullable_abstract_type =                                     \
         ValueType::Ref(HeapType::k##h_type);                                   \
-    Value result = CreateValue(non_nullable_abstract_type);                    \
+    Value* result = Push(non_nullable_abstract_type);                          \
     if (V8_LIKELY(current_code_reachable_and_ok_)) {                           \
       if (IsHeapSubtypeOf(arg.type.heap_type(), HeapType(HeapType::k##h_type), \
                           this->module_)) {                                    \
         if (arg.type.is_nullable()) {                                          \
-          CALL_INTERFACE(RefAsNonNull, arg, &result);                          \
+          CALL_INTERFACE(RefAsNonNull, arg, result);                           \
         } else {                                                               \
-          CALL_INTERFACE(Forward, arg, &result);                               \
+          CALL_INTERFACE(Forward, arg, result);                                \
         }                                                                      \
       } else if (!IsHeapSubtypeOf(HeapType(HeapType::k##h_type),               \
                                   arg.type.heap_type(), this->module_)) {      \
@@ -5663,11 +5286,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         /* to the spec it technically is. Set it to spec-only reachable. */    \
         SetSucceedingCodeDynamicallyUnreachable();                             \
       } else {                                                                 \
-        CALL_INTERFACE(RefAs##h_type, arg, &result);                           \
+        CALL_INTERFACE(RefAs##h_type, arg, result);                            \
       }                                                                        \
     }                                                                          \
-    Drop(arg);                                                                 \
-    Push(result);                                                              \
     return opcode_length;                                                      \
   }
         ABSTRACT_TYPE_CAST(Struct)
@@ -5678,6 +5299,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       case kExprBrOnStruct:
       case kExprBrOnArray:
       case kExprBrOnI31: {
+        GC_DEPRECATED
         NON_CONST_ONLY
         BranchDepthImmediate branch_depth(this, this->pc_ + opcode_length,
                                           validate);
@@ -5693,24 +5315,13 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
           return 0;
         }
 
-        // Attention: contrary to most other instructions, we modify the
-        // stack before calling the interface function. This makes it
-        // significantly more convenient to pass around the values that
-        // will be on the stack when the branch is taken.
-        // TODO(jkummerow): Reconsider this choice.
-        Value obj = Peek(0, 0, kWasmAnyRef);
-        Drop(obj);
+        Value obj = Pop(kWasmAnyRef);
         HeapType::Representation heap_type =
             opcode == kExprBrOnStruct  ? HeapType::kStruct
             : opcode == kExprBrOnArray ? HeapType::kArray
                                        : HeapType::kI31;
-        Value result_on_branch = CreateValue(ValueType::Ref(heap_type));
-        Push(result_on_branch);
-        if (!VALIDATE(TypeCheckBranch<true>(c, 0))) return 0;
-        // The {value_on_branch} parameter we pass to the interface must be
-        // pointer-identical to the object on the stack, so we can't reuse
-        // {result_on_branch} which was passed-by-value to {Push}.
-        Value* value_on_branch = stack_value(1);
+        Value* value_on_branch = Push(ValueType::Ref(heap_type));
+        if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
         if (V8_LIKELY(current_code_reachable_and_ok_)) {
           bool null_succeeds = false;
           if (opcode == kExprBrOnStruct) {
@@ -5725,13 +5336,15 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
           }
           c->br_merge()->reached = true;
         }
-        Drop(result_on_branch);
-        Push(obj);  // Restore stack state on fallthrough.
+        // Restore stack state on fallthrough.
+        Drop(*value_on_branch);
+        Push(obj);
         return opcode_length + branch_depth.length;
       }
       case kExprBrOnNonStruct:
       case kExprBrOnNonArray:
       case kExprBrOnNonI31: {
+        GC_DEPRECATED
         NON_CONST_ONLY
         BranchDepthImmediate branch_depth(this, this->pc_ + opcode_length,
                                           validate);
@@ -5746,9 +5359,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                             SafeOpcodeNameAt(this->pc_));
           return 0;
         }
-        if (!VALIDATE(TypeCheckBranch<true>(c, 0))) return 0;
+        if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
 
-        Value obj = Peek(0, 0, kWasmAnyRef);
+        Value obj = Peek(kWasmAnyRef);
         HeapType::Representation heap_type =
             opcode == kExprBrOnNonStruct  ? HeapType::kStruct
             : opcode == kExprBrOnNonArray ? HeapType::kArray
@@ -5774,25 +5387,21 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         return opcode_length + branch_depth.length;
       }
       case kExprExternInternalize: {
-        Value extern_val = Peek(0, 0, kWasmExternRef);
+        Value extern_val = Pop(kWasmExternRef);
         ValueType intern_type = ValueType::RefMaybeNull(
             HeapType::kAny, Nullability(extern_val.type.is_nullable()));
-        Value intern_val = CreateValue(intern_type);
+        Value* intern_val = Push(intern_type);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(UnOp, kExprExternInternalize,
-                                           extern_val, &intern_val);
-        Drop(extern_val);
-        Push(intern_val);
+                                           extern_val, intern_val);
         return opcode_length;
       }
       case kExprExternExternalize: {
-        Value val = Peek(0, 0, kWasmAnyRef);
+        Value val = Pop(kWasmAnyRef);
         ValueType extern_type = ValueType::RefMaybeNull(
             HeapType::kExtern, Nullability(val.type.is_nullable()));
-        Value extern_val = CreateValue(extern_type);
+        Value* extern_val = Push(extern_type);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(UnOp, kExprExternExternalize, val,
-                                           &extern_val);
-        Drop(val);
-        Push(extern_val);
+                                           extern_val);
         return opcode_length;
       }
       default:
@@ -5803,100 +5412,329 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
 
   enum class WasmArrayAccess { kRead, kWrite };
 
+  int ParseBrOnCast(WasmOpcode opcode, uint32_t opcode_length,
+                    BrOnCastFlags flags) {
+    BranchDepthImmediate branch_depth(this, this->pc_ + opcode_length,
+                                      validate);
+    if (!this->Validate(this->pc_ + opcode_length, branch_depth,
+                        control_.size())) {
+      return 0;
+    }
+    uint32_t pc_offset = opcode_length + branch_depth.length;
+
+    Value obj = Pop();
+
+    ValueType src_type = kWasmBottom;
+    if (opcode == kExprBrOnCastGeneric) {
+      HeapTypeImmediate src_imm(this->enabled_, this, this->pc_ + pc_offset,
+                                validate);
+      if (!this->Validate(this->pc_ + pc_offset, src_imm)) return 0;
+      pc_offset += src_imm.length;
+      src_type = ValueType::RefMaybeNull(
+          src_imm.type, flags.src_is_null ? kNullable : kNonNullable);
+      ValidateStackValue(0, obj, src_type);
+    }
+
+    HeapTypeImmediate target_imm(this->enabled_, this, this->pc_ + pc_offset,
+                                 validate);
+    if (!this->Validate(this->pc_ + pc_offset, target_imm)) return 0;
+    pc_offset += target_imm.length;
+    bool null_succeeds = flags.res_is_null;
+    ValueType target_type = ValueType::RefMaybeNull(
+        target_imm.type, null_succeeds ? kNullable : kNonNullable);
+
+    if (src_type != kWasmBottom &&
+        !VALIDATE(IsSubtypeOf(target_type, src_type, this->module_))) {
+      this->DecodeError("invalid types for %s: %s is not a subtype of %s",
+                        WasmOpcodes::OpcodeName(opcode),
+                        target_type.name().c_str(), src_type.name().c_str());
+      return 0;
+    }
+
+    if (!VALIDATE(
+            (obj.type.is_object_reference() &&
+             IsSameTypeHierarchy(obj.type.heap_type(), target_type.heap_type(),
+                                 this->module_)) ||
+            obj.type.is_bottom())) {
+      this->DecodeError(obj.pc(),
+                        "invalid types for %s: %s of type %s has to "
+                        "be in the same reference type hierarchy as %s",
+                        WasmOpcodes::OpcodeName(opcode),
+                        SafeOpcodeNameAt(obj.pc()), obj.type.name().c_str(),
+                        target_type.name().c_str());
+      return 0;
+    }
+
+    Control* c = control_at(branch_depth.depth);
+    if (c->br_merge()->arity == 0) {
+      this->DecodeError("%s must target a branch of arity at least 1",
+                        WasmOpcodes::OpcodeName(opcode));
+      return 0;
+    }
+    Value* value_on_branch = Push(target_type);
+    if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
+    if (V8_LIKELY(current_code_reachable_and_ok_)) {
+      // This logic ensures that code generation can assume that functions
+      // can only be cast to function types, and data objects to data types.
+      if (V8_UNLIKELY(TypeCheckAlwaysSucceeds(obj, target_type.heap_type()))) {
+        // The branch will still not be taken on null if not
+        // {null_succeeds}.
+        if (obj.type.is_nullable() && !null_succeeds) {
+          CALL_INTERFACE(BrOnNonNull, obj, value_on_branch, branch_depth.depth,
+                         false);
+        } else {
+          CALL_INTERFACE(Forward, obj, value_on_branch);
+          CALL_INTERFACE(BrOrRet, branch_depth.depth, 0);
+          // We know that the following code is not reachable, but according
+          // to the spec it technically is. Set it to spec-only reachable.
+          SetSucceedingCodeDynamicallyUnreachable();
+        }
+        c->br_merge()->reached = true;
+      } else if (V8_LIKELY(!TypeCheckAlwaysFails(obj, target_type.heap_type(),
+                                                 null_succeeds))) {
+        if (target_imm.type.is_index()) {
+          CALL_INTERFACE(BrOnCast, target_imm.type.ref_index(), obj,
+                         value_on_branch, branch_depth.depth, null_succeeds);
+        } else {
+          CALL_INTERFACE(BrOnCastAbstract, obj, target_type.heap_type(),
+                         value_on_branch, branch_depth.depth, null_succeeds);
+        }
+        c->br_merge()->reached = true;
+      }
+    }
+
+    Drop(*value_on_branch);
+    Push(obj);  // Restore stack state on fallthrough.
+    if (opcode == kExprBrOnCastGeneric) {
+      // The fallthrough type is the source type as specified in the br_on_cast
+      // instruction. This can be a super type of the stack value. Furthermore
+      // nullability gets refined to non-nullable if the cast target is
+      // nullable, meaning the branch will be taken on null.
+      DCHECK(!src_type.heap_type().is_bottom());
+      bool fallthrough_nullable = flags.src_is_null && !flags.res_is_null;
+      stack_value(1)->type = ValueType::RefMaybeNull(
+          src_type.heap_type(),
+          fallthrough_nullable ? kNullable : kNonNullable);
+      CALL_INTERFACE_IF_OK_AND_REACHABLE(Forward, obj, stack_value(1));
+    } else if (current_code_reachable_and_ok_ && null_succeeds) {
+      // TODO(mliedtke): This is only needed for the deprecated br_on_cast
+      // instructions and can be removed with them.
+      DCHECK(!v8_flags.wasm_disable_deprecated);
+      stack_value(1)->type = obj.type.AsNonNull();
+      CALL_INTERFACE(Forward, obj, stack_value(1));
+    }
+    return pc_offset;
+  }
+
+  int ParseBrOnCastFail(WasmOpcode opcode, uint32_t opcode_length,
+                        BrOnCastFlags flags) {
+    BranchDepthImmediate branch_depth(this, this->pc_ + opcode_length,
+                                      validate);
+    if (!this->Validate(this->pc_ + opcode_length, branch_depth,
+                        control_.size())) {
+      return 0;
+    }
+    uint32_t pc_offset = opcode_length + branch_depth.length;
+
+    ValueType source_type = kWasmBottom;
+    if (opcode == kExprBrOnCastFailGeneric) {
+      HeapTypeImmediate imm(this->enabled_, this, this->pc_ + pc_offset,
+                            validate);
+      if (!this->Validate(this->pc_ + pc_offset, imm)) return 0;
+      pc_offset += imm.length;
+      source_type = ValueType::RefMaybeNull(
+          imm.type, flags.src_is_null ? kNullable : kNonNullable);
+    }
+
+    HeapTypeImmediate imm(this->enabled_, this, this->pc_ + pc_offset,
+                          validate);
+    if (!this->Validate(this->pc_ + pc_offset, imm)) return 0;
+    pc_offset += imm.length;
+
+    bool null_succeeds = flags.res_is_null;
+    ValueType target_type = ValueType::RefMaybeNull(
+        imm.type, null_succeeds ? kNullable : kNonNullable);
+
+    Value obj = Peek();
+
+    if (source_type != kWasmBottom) {
+      if (!VALIDATE(IsSubtypeOf(target_type, source_type, this->module_))) {
+        this->DecodeError("invalid types for %s: %s is not a subtype of %s",
+                          WasmOpcodes::OpcodeName(opcode),
+                          target_type.name().c_str(),
+                          source_type.name().c_str());
+        return 0;
+      }
+      ValidateStackValue(0, obj, source_type);
+    }
+
+    if (!VALIDATE(
+            (obj.type.is_object_reference() &&
+             IsSameTypeHierarchy(obj.type.heap_type(), target_type.heap_type(),
+                                 this->module_)) ||
+            obj.type.is_bottom())) {
+      this->DecodeError(obj.pc(),
+                        "Invalid types for %s: %s of type %s has to "
+                        "be in the same reference type hierarchy as %s",
+                        WasmOpcodes::OpcodeName(opcode),
+                        SafeOpcodeNameAt(obj.pc()), obj.type.name().c_str(),
+                        target_type.name().c_str());
+      return 0;
+    }
+
+    Control* c = control_at(branch_depth.depth);
+    if (c->br_merge()->arity == 0) {
+      this->DecodeError("%s must target a branch of arity at least 1",
+                        WasmOpcodes::OpcodeName(opcode));
+      return 0;
+    }
+
+    if (opcode == kExprBrOnCastFailGeneric) {
+      // The branch type is set based on the source type immediate (independent
+      // of the actual stack value). If the target type is nullable, the branch
+      // type is non-nullable.
+      DCHECK(!source_type.is_bottom());
+      Drop(obj);
+      Push(flags.res_is_null ? source_type.AsNonNull() : source_type);
+      CALL_INTERFACE_IF_OK_AND_REACHABLE(Forward, obj, stack_value(1));
+    } else if (null_succeeds) {
+      // TODO(mliedtke): This is only needed for the legacy br_on_cast_fail.
+      // Remove it on cleanup.
+      DCHECK(!v8_flags.wasm_disable_deprecated);
+      // If null is treated as a successful cast, then the branch type is
+      // guaranteed to be non-null.
+      Drop(obj);
+      Push(obj.type.AsNonNull());
+      CALL_INTERFACE_IF_OK_AND_REACHABLE(Forward, obj, stack_value(1));
+    }
+    if (!VALIDATE(TypeCheckBranch<true>(c))) return 0;
+
+    Value result_on_fallthrough = CreateValue(target_type);
+    if (opcode != kExprBrOnCastFailGeneric) {
+      result_on_fallthrough.type = ValueType::RefMaybeNull(
+          target_type.heap_type(), (obj.type.is_bottom() || !null_succeeds)
+                                       ? kNonNullable
+                                       : obj.type.nullability());
+    }
+    if (V8_LIKELY(current_code_reachable_and_ok_)) {
+      // This logic ensures that code generation can assume that functions
+      // can only be cast between compatible types.
+      if (V8_UNLIKELY(TypeCheckAlwaysFails(obj, target_type.heap_type(),
+                                           null_succeeds))) {
+        // The types are incompatible (i.e. neither of the two types is a
+        // subtype of the other). Always branch.
+        CALL_INTERFACE(Forward, obj, stack_value(1));
+        CALL_INTERFACE(BrOrRet, branch_depth.depth, 0);
+        // We know that the following code is not reachable, but according
+        // to the spec it technically is. Set it to spec-only reachable.
+        SetSucceedingCodeDynamicallyUnreachable();
+        c->br_merge()->reached = true;
+      } else if (V8_UNLIKELY(
+                     TypeCheckAlwaysSucceeds(obj, target_type.heap_type()))) {
+        // The branch can still be taken on null.
+        if (obj.type.is_nullable() && !null_succeeds) {
+          CALL_INTERFACE(BrOnNull, obj, branch_depth.depth, true,
+                         &result_on_fallthrough);
+          c->br_merge()->reached = true;
+        } else {
+          // Otherwise, the type check always succeeds. Do not branch. Also,
+          // make sure the object remains on the stack.
+          result_on_fallthrough = obj;
+        }
+      } else {
+        if (imm.type.is_index()) {
+          CALL_INTERFACE(BrOnCastFail, imm.type.ref_index(), obj,
+                         &result_on_fallthrough, branch_depth.depth,
+                         null_succeeds);
+        } else {
+          CALL_INTERFACE(BrOnCastFailAbstract, obj, target_type.heap_type(),
+                         &result_on_fallthrough, branch_depth.depth,
+                         null_succeeds);
+        }
+        c->br_merge()->reached = true;
+      }
+    }
+    // Make sure the correct value is on the stack state on fallthrough.
+    Drop(obj);
+    Push(result_on_fallthrough);
+    return pc_offset;
+  }
+
   int DecodeStringNewWtf8(unibrow::Utf8Variant variant,
                           uint32_t opcode_length) {
     NON_CONST_ONLY
     bool null_on_invalid = variant == unibrow::Utf8Variant::kUtf8NoTrap;
-    MemoryIndexImmediate memory(this, this->pc_ + opcode_length, validate);
-    if (!this->Validate(this->pc_ + opcode_length, memory)) return 0;
-    ValueType addr_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value offset = Peek(1, 0, addr_type);
-    Value size = Peek(0, 1, kWasmI32);
-    Value result = CreateValue(ValueType::RefMaybeNull(
+    MemoryIndexImmediate imm(this, this->pc_ + opcode_length, validate);
+    if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
+    ValueType addr_type = MemoryIndexType(imm.memory);
+    auto [offset, size] = Pop(addr_type, kWasmI32);
+    Value* result = Push(ValueType::RefMaybeNull(
         HeapType::kString, null_on_invalid ? kNullable : kNonNullable));
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(StringNewWtf8, memory, variant, offset,
-                                       size, &result);
-    Drop(2);
-    Push(result);
-    return opcode_length + memory.length;
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(StringNewWtf8, imm, variant, offset,
+                                       size, result);
+    return opcode_length + imm.length;
   }
 
   int DecodeStringMeasureWtf8(unibrow::Utf8Variant variant,
                               uint32_t opcode_length) {
     NON_CONST_ONLY
-    Value str = Peek(0, 0, kWasmStringRef);
-    Value result = CreateValue(kWasmI32);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(StringMeasureWtf8, variant, str,
-                                       &result);
-    Drop(str);
-    Push(result);
+    Value str = Pop(kWasmStringRef);
+    Value* result = Push(kWasmI32);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(StringMeasureWtf8, variant, str, result);
     return opcode_length;
   }
 
   int DecodeStringEncodeWtf8(unibrow::Utf8Variant variant,
                              uint32_t opcode_length) {
     NON_CONST_ONLY
-    MemoryIndexImmediate memory(this, this->pc_ + opcode_length, validate);
-    if (!this->Validate(this->pc_ + opcode_length, memory)) return 0;
-    ValueType addr_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value str = Peek(1, 0, kWasmStringRef);
-    Value addr = Peek(0, 1, addr_type);
-    Value result = CreateValue(kWasmI32);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(StringEncodeWtf8, memory, variant, str,
-                                       addr, &result);
-    Drop(2);
-    Push(result);
-    return opcode_length + memory.length;
+    MemoryIndexImmediate imm(this, this->pc_ + opcode_length, validate);
+    if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
+    ValueType addr_type = MemoryIndexType(imm.memory);
+    auto [str, addr] = Pop(kWasmStringRef, addr_type);
+    Value* result = Push(kWasmI32);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(StringEncodeWtf8, imm, variant, str,
+                                       addr, result);
+    return opcode_length + imm.length;
   }
 
   int DecodeStringViewWtf8Encode(unibrow::Utf8Variant variant,
                                  uint32_t opcode_length) {
     NON_CONST_ONLY
-    MemoryIndexImmediate memory(this, this->pc_ + opcode_length, validate);
-    if (!this->Validate(this->pc_ + opcode_length, memory)) return 0;
-    ValueType addr_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    Value view = Peek(3, 0, kWasmStringViewWtf8);
-    Value addr = Peek(2, 1, addr_type);
-    Value pos = Peek(1, 2, kWasmI32);
-    Value bytes = Peek(0, 3, kWasmI32);
-    Value next_pos = CreateValue(kWasmI32);
-    Value bytes_out = CreateValue(kWasmI32);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewWtf8Encode, memory, variant,
-                                       view, addr, pos, bytes, &next_pos,
-                                       &bytes_out);
-    Drop(4);
-    Push(next_pos);
-    Push(bytes_out);
-    return opcode_length + memory.length;
+    MemoryIndexImmediate imm(this, this->pc_ + opcode_length, validate);
+    if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
+    ValueType addr_type = MemoryIndexType(imm.memory);
+    auto [view, addr, pos, bytes] =
+        Pop(kWasmStringViewWtf8, addr_type, kWasmI32, kWasmI32);
+    Value* next_pos = Push(kWasmI32);
+    Value* bytes_out = Push(kWasmI32);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewWtf8Encode, imm, variant, view,
+                                       addr, pos, bytes, next_pos, bytes_out);
+    return opcode_length + imm.length;
   }
 
   int DecodeStringNewWtf8Array(unibrow::Utf8Variant variant,
                                uint32_t opcode_length) {
     NON_CONST_ONLY
-    Value array = PeekPackedArray(2, 0, kWasmI8, WasmArrayAccess::kRead);
-    Value start = Peek(1, 1, kWasmI32);
-    Value end = Peek(0, 2, kWasmI32);
+    Value end = Pop(2, kWasmI32);
+    Value start = Pop(1, kWasmI32);
+    Value array = PopPackedArray(0, kWasmI8, WasmArrayAccess::kRead);
     bool null_on_invalid = variant == unibrow::Utf8Variant::kUtf8NoTrap;
-    Value result = CreateValue(ValueType::RefMaybeNull(
+    Value* result = Push(ValueType::RefMaybeNull(
         HeapType::kString, null_on_invalid ? kNullable : kNonNullable));
     CALL_INTERFACE_IF_OK_AND_REACHABLE(StringNewWtf8Array, variant, array,
-                                       start, end, &result);
-    Drop(3);
-    Push(result);
+                                       start, end, result);
     return opcode_length;
   }
 
   int DecodeStringEncodeWtf8Array(unibrow::Utf8Variant variant,
                                   uint32_t opcode_length) {
     NON_CONST_ONLY
-    Value str = Peek(2, 0, kWasmStringRef);
-    Value array = PeekPackedArray(1, 1, kWasmI8, WasmArrayAccess::kWrite);
-    Value start = Peek(0, 2, kWasmI32);
-    Value result = CreateValue(kWasmI32);
+    Value start = Pop(2, kWasmI32);
+    Value array = PopPackedArray(1, kWasmI8, WasmArrayAccess::kWrite);
+    Value str = Pop(0, kWasmStringRef);
+    Value* result = Push(kWasmI32);
     CALL_INTERFACE_IF_OK_AND_REACHABLE(StringEncodeWtf8Array, variant, str,
-                                       array, start, &result);
-    Drop(3);
-    Push(result);
+                                       array, start, result);
     return opcode_length;
   }
 
@@ -5923,22 +5761,18 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         NON_CONST_ONLY
         MemoryIndexImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ValueType addr_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-        Value offset = Peek(1, 0, addr_type);
-        Value size = Peek(0, 1, kWasmI32);
-        Value result = CreateValue(ValueType::Ref(HeapType::kString));
+        ValueType addr_type = MemoryIndexType(imm.memory);
+        auto [offset, size] = Pop(addr_type, kWasmI32);
+        Value* result = Push(kWasmRefString);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringNewWtf16, imm, offset, size,
-                                           &result);
-        Drop(2);
-        Push(result);
+                                           result);
         return opcode_length + imm.length;
       }
       case kExprStringConst: {
         StringConstImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        Value result = CreateValue(ValueType::Ref(HeapType::kString));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringConst, imm, &result);
-        Push(result);
+        Value* result = Push(kWasmRefString);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringConst, imm, result);
         return opcode_length + imm.length;
       }
       case kExprStringMeasureUtf8:
@@ -5949,11 +5783,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                                        opcode_length);
       case kExprStringMeasureWtf16: {
         NON_CONST_ONLY
-        Value str = Peek(0, 0, kWasmStringRef);
-        Value result = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringMeasureWtf16, str, &result);
-        Drop(str);
-        Push(result);
+        Value str = Pop(kWasmStringRef);
+        Value* result = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringMeasureWtf16, str, result);
         return opcode_length;
       }
       case kExprStringEncodeUtf8:
@@ -5969,64 +5801,47 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         NON_CONST_ONLY
         MemoryIndexImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ValueType addr_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-        Value str = Peek(1, 0, kWasmStringRef);
-        Value addr = Peek(0, 1, addr_type);
-        Value result = CreateValue(kWasmI32);
+        ValueType addr_type = MemoryIndexType(imm.memory);
+        auto [str, addr] = Pop(kWasmStringRef, addr_type);
+        Value* result = Push(kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringEncodeWtf16, imm, str, addr,
-                                           &result);
-        Drop(2);
-        Push(result);
+                                           result);
         return opcode_length + imm.length;
       }
       case kExprStringConcat: {
         NON_CONST_ONLY
-        Value head = Peek(1, 0, kWasmStringRef);
-        Value tail = Peek(0, 1, kWasmStringRef);
-        Value result = CreateValue(ValueType::Ref(HeapType::kString));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringConcat, head, tail, &result);
-        Drop(2);
-        Push(result);
+        auto [head, tail] = Pop(kWasmStringRef, kWasmStringRef);
+        Value* result = Push(kWasmRefString);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringConcat, head, tail, result);
         return opcode_length;
       }
       case kExprStringEq: {
         NON_CONST_ONLY
-        Value a = Peek(1, 0, kWasmStringRef);
-        Value b = Peek(0, 1, kWasmStringRef);
-        Value result = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringEq, a, b, &result);
-        Drop(2);
-        Push(result);
+        auto [a, b] = Pop(kWasmStringRef, kWasmStringRef);
+        Value* result = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringEq, a, b, result);
         return opcode_length;
       }
       case kExprStringIsUSVSequence: {
         NON_CONST_ONLY
-        Value str = Peek(0, 0, kWasmStringRef);
-        Value result = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringIsUSVSequence, str, &result);
-        Drop(1);
-        Push(result);
+        Value str = Pop(kWasmStringRef);
+        Value* result = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringIsUSVSequence, str, result);
         return opcode_length;
       }
       case kExprStringAsWtf8: {
         NON_CONST_ONLY
-        Value str = Peek(0, 0, kWasmStringRef);
-        Value result = CreateValue(ValueType::Ref(HeapType::kStringViewWtf8));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringAsWtf8, str, &result);
-        Drop(str);
-        Push(result);
+        Value str = Pop(kWasmStringRef);
+        Value* result = Push(ValueType::Ref(HeapType::kStringViewWtf8));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringAsWtf8, str, result);
         return opcode_length;
       }
       case kExprStringViewWtf8Advance: {
         NON_CONST_ONLY
-        Value view = Peek(2, 0, kWasmStringViewWtf8);
-        Value pos = Peek(1, 1, kWasmI32);
-        Value bytes = Peek(0, 2, kWasmI32);
-        Value result = CreateValue(kWasmI32);
+        auto [view, pos, bytes] = Pop(kWasmStringViewWtf8, kWasmI32, kWasmI32);
+        Value* result = Push(kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewWtf8Advance, view, pos,
-                                           bytes, &result);
-        Drop(3);
-        Push(result);
+                                           bytes, result);
         return opcode_length;
       }
       case kExprStringViewWtf8EncodeUtf8:
@@ -6040,122 +5855,90 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
                                           opcode_length);
       case kExprStringViewWtf8Slice: {
         NON_CONST_ONLY
-        Value view = Peek(2, 0, kWasmStringViewWtf8);
-        Value start = Peek(1, 1, kWasmI32);
-        Value end = Peek(0, 2, kWasmI32);
-        Value result = CreateValue(ValueType::Ref(HeapType::kString));
+        auto [view, start, end] = Pop(kWasmStringViewWtf8, kWasmI32, kWasmI32);
+        Value* result = Push(kWasmRefString);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewWtf8Slice, view, start,
-                                           end, &result);
-        Drop(3);
-        Push(result);
+                                           end, result);
         return opcode_length;
       }
       case kExprStringAsWtf16: {
         NON_CONST_ONLY
-        Value str = Peek(0, 0, kWasmStringRef);
-        Value result = CreateValue(ValueType::Ref(HeapType::kStringViewWtf16));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringAsWtf16, str, &result);
-        Drop(str);
-        Push(result);
+        Value str = Pop(kWasmStringRef);
+        Value* result = Push(ValueType::Ref(HeapType::kStringViewWtf16));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringAsWtf16, str, result);
         return opcode_length;
       }
       case kExprStringViewWtf16Length: {
         NON_CONST_ONLY
-        Value view = Peek(0, 0, kWasmStringViewWtf16);
-        Value result = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringMeasureWtf16, view, &result);
-        Drop(view);
-        Push(result);
+        Value view = Pop(kWasmStringViewWtf16);
+        Value* result = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringMeasureWtf16, view, result);
         return opcode_length;
       }
-      case kExprStringViewWtf16GetCodeUnit: {
+      case kExprStringViewWtf16GetCodeunit: {
         NON_CONST_ONLY
-        Value view = Peek(1, 0, kWasmStringViewWtf16);
-        Value pos = Peek(0, 1, kWasmI32);
-        Value result = CreateValue(kWasmI32);
+        auto [view, pos] = Pop(kWasmStringViewWtf16, kWasmI32);
+        Value* result = Push(kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewWtf16GetCodeUnit, view,
-                                           pos, &result);
-        Drop(2);
-        Push(result);
+                                           pos, result);
         return opcode_length;
       }
       case kExprStringViewWtf16Encode: {
         NON_CONST_ONLY
         MemoryIndexImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ValueType addr_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-        Value view = Peek(3, 0, kWasmStringViewWtf16);
-        Value addr = Peek(2, 1, addr_type);
-        Value pos = Peek(1, 2, kWasmI32);
-        Value codeunits = Peek(0, 3, kWasmI32);
-        Value result = CreateValue(kWasmI32);
+        ValueType addr_type = MemoryIndexType(imm.memory);
+        auto [view, addr, pos, codeunits] =
+            Pop(kWasmStringViewWtf16, addr_type, kWasmI32, kWasmI32);
+        Value* result = Push(kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewWtf16Encode, imm, view,
-                                           addr, pos, codeunits, &result);
-        Drop(4);
-        Push(result);
+                                           addr, pos, codeunits, result);
         return opcode_length + imm.length;
       }
       case kExprStringViewWtf16Slice: {
         NON_CONST_ONLY
-        Value view = Peek(2, 0, kWasmStringViewWtf16);
-        Value start = Peek(1, 1, kWasmI32);
-        Value end = Peek(0, 2, kWasmI32);
-        Value result = CreateValue(ValueType::Ref(HeapType::kString));
+        auto [view, start, end] = Pop(kWasmStringViewWtf16, kWasmI32, kWasmI32);
+        Value* result = Push(kWasmRefString);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewWtf16Slice, view, start,
-                                           end, &result);
-        Drop(3);
-        Push(result);
+                                           end, result);
         return opcode_length;
       }
       case kExprStringAsIter: {
         NON_CONST_ONLY
-        Value str = Peek(0, 0, kWasmStringRef);
-        Value result = CreateValue(ValueType::Ref(HeapType::kStringViewIter));
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringAsIter, str, &result);
-        Drop(str);
-        Push(result);
+        Value str = Pop(kWasmStringRef);
+        Value* result = Push(ValueType::Ref(HeapType::kStringViewIter));
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringAsIter, str, result);
         return opcode_length;
       }
       case kExprStringViewIterNext: {
         NON_CONST_ONLY
-        Value view = Peek(0, 0, kWasmStringViewIter);
-        Value result = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewIterNext, view, &result);
-        Drop(view);
-        Push(result);
+        Value view = Pop(kWasmStringViewIter);
+        Value* result = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewIterNext, view, result);
         return opcode_length;
       }
       case kExprStringViewIterAdvance: {
         NON_CONST_ONLY
-        Value view = Peek(1, 0, kWasmStringViewIter);
-        Value codepoints = Peek(0, 1, kWasmI32);
-        Value result = CreateValue(kWasmI32);
+        auto [view, codepoints] = Pop(kWasmStringViewIter, kWasmI32);
+        Value* result = Push(kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewIterAdvance, view,
-                                           codepoints, &result);
-        Drop(2);
-        Push(result);
+                                           codepoints, result);
         return opcode_length;
       }
       case kExprStringViewIterRewind: {
         NON_CONST_ONLY
-        Value view = Peek(1, 0, kWasmStringViewIter);
-        Value codepoints = Peek(0, 1, kWasmI32);
-        Value result = CreateValue(kWasmI32);
+        auto [view, codepoints] = Pop(kWasmStringViewIter, kWasmI32);
+        Value* result = Push(kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewIterRewind, view,
-                                           codepoints, &result);
-        Drop(2);
-        Push(result);
+                                           codepoints, result);
         return opcode_length;
       }
       case kExprStringViewIterSlice: {
         NON_CONST_ONLY
-        Value view = Peek(1, 0, kWasmStringViewIter);
-        Value codepoints = Peek(0, 1, kWasmI32);
-        Value result = CreateValue(ValueType::Ref(HeapType::kString));
+        auto [view, codepoints] = Pop(kWasmStringViewIter, kWasmI32);
+        Value* result = Push(kWasmRefString);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringViewIterSlice, view,
-                                           codepoints, &result);
-        Drop(2);
-        Push(result);
+                                           codepoints, result);
         return opcode_length;
       }
       case kExprStringNewUtf8Array:
@@ -6177,14 +5960,12 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       case kExprStringNewWtf16Array: {
         CHECK_PROTOTYPE_OPCODE(gc);
         NON_CONST_ONLY
-        Value array = PeekPackedArray(2, 0, kWasmI16, WasmArrayAccess::kRead);
-        Value start = Peek(1, 1, kWasmI32);
-        Value end = Peek(0, 2, kWasmI32);
-        Value result = CreateValue(ValueType::Ref(HeapType::kString));
+        Value end = Pop(2, kWasmI32);
+        Value start = Pop(1, kWasmI32);
+        Value array = PopPackedArray(0, kWasmI16, WasmArrayAccess::kRead);
+        Value* result = Push(kWasmRefString);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringNewWtf16Array, array, start,
-                                           end, &result);
-        Drop(3);
-        Push(result);
+                                           end, result);
         return opcode_length;
       }
       case kExprStringEncodeUtf8Array:
@@ -6202,43 +5983,34 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       case kExprStringEncodeWtf16Array: {
         CHECK_PROTOTYPE_OPCODE(gc);
         NON_CONST_ONLY
-        Value str = Peek(2, 0, kWasmStringRef);
-        Value array = PeekPackedArray(1, 1, kWasmI16, WasmArrayAccess::kWrite);
-        Value start = Peek(0, 2, kWasmI32);
-        Value result = CreateValue(kWasmI32);
+        Value start = Pop(2, kWasmI32);
+        Value array = PopPackedArray(1, kWasmI16, WasmArrayAccess::kWrite);
+        Value str = Pop(0, kWasmStringRef);
+        Value* result = Push(kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringEncodeWtf16Array, str, array,
-                                           start, &result);
-        Drop(3);
-        Push(result);
+                                           start, result);
         return opcode_length;
       }
       case kExprStringCompare: {
         NON_CONST_ONLY
-        Value lhs = Peek(1, 0, kWasmStringRef);
-        Value rhs = Peek(0, 1, kWasmStringRef);
-        Value result = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringCompare, lhs, rhs, &result);
-        Drop(2);
-        Push(result);
+        auto [lhs, rhs] = Pop(kWasmStringRef, kWasmStringRef);
+        Value* result = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringCompare, lhs, rhs, result);
         return opcode_length;
       }
       case kExprStringFromCodePoint: {
         NON_CONST_ONLY
-        Value code_point = Peek(0, 0, kWasmI32);
-        Value result = CreateValue(ValueType::Ref(HeapType::kString));
+        Value code_point = Pop(kWasmI32);
+        Value* result = Push(kWasmRefString);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(StringFromCodePoint, code_point,
-                                           &result);
-        Drop(1);
-        Push(result);
+                                           result);
         return opcode_length;
       }
       case kExprStringHash: {
         NON_CONST_ONLY
-        Value string = Peek(0, 0, kWasmStringRef);
-        Value result = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringHash, string, &result);
-        Drop(1);
-        Push(result);
+        Value string = Pop(kWasmStringRef);
+        Value* result = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(StringHash, string, result);
         return opcode_length;
       }
       default:
@@ -6272,7 +6044,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       ATOMIC_OP_LIST(CASE_ATOMIC_OP)
 #undef CASE_ATOMIC_OP
       case kExprAtomicFence: {
-        byte zero = this->template read_u8<ValidationTag>(
+        uint8_t zero = this->template read_u8<ValidationTag>(
             this->pc_ + opcode_length, "zero");
         if (!VALIDATE(zero == 0)) {
           this->DecodeError(this->pc_ + opcode_length,
@@ -6289,37 +6061,21 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         return 0;
     }
 
-    const FunctionSig* sig = WasmOpcodes::Signature(opcode);
-    V8_ASSUME(sig != nullptr);
-
     MemoryAccessImmediate imm = MakeMemoryAccessImmediate(
         opcode_length, ElementSizeLog2Of(memtype.representation()));
     if (!this->Validate(this->pc_ + opcode_length, imm)) return false;
 
-    int parameter_count = static_cast<int>(sig->parameter_count());
-    DCHECK_LE(1, parameter_count);
-    DCHECK_EQ(kWasmI32, sig->GetParam(0));
-    EnsureStackArguments(parameter_count);
-    ArgVector args(stack_value(parameter_count), parameter_count);
-    ValueType mem_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-    ValidateArgType(args, 0, mem_type);
-    for (int i = 1; i < parameter_count; i++) {
-      ValidateArgType(args, i, sig->GetParam(i));
-    }
-
-    base::Optional<Value> result;
-    if (sig->return_count()) {
-      DCHECK_EQ(1, sig->return_count());
-      result = CreateValue(sig->GetReturn());
+    const FunctionSig* sig =
+        WasmOpcodes::SignatureForAtomicOp(opcode, imm.memory->is_memory64);
+    V8_ASSUME(sig != nullptr);
+    PoppedArgVector args = PopArgs(sig);
+    Value* result = sig->return_count() ? Push(sig->GetReturn()) : nullptr;
+    if (V8_LIKELY(!CheckStaticallyOutOfBounds(imm.memory, memtype.MemSize(),
+                                              imm.offset))) {
+      CALL_INTERFACE_IF_OK_AND_REACHABLE(AtomicOp, opcode, args.data(),
+                                         sig->parameter_count(), imm, result);
     }
 
-    if (V8_LIKELY(!CheckStaticallyOutOfBounds(memtype.MemSize(), imm.offset))) {
-      CALL_INTERFACE_IF_OK_AND_REACHABLE(
-          AtomicOp, opcode, base::VectorOf(args), imm,
-          result.has_value() ? &result.value() : nullptr);
-    }
-    DropArgs(sig);
-    if (result.has_value()) Push(result.value());
     return opcode_length + imm.length;
   }
 
@@ -6348,12 +6104,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       case kExprMemoryInit: {
         MemoryInitImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ValueType mem_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-        Value size = Peek(0, 2, kWasmI32);
-        Value offset = Peek(1, 1, kWasmI32);
-        Value dst = Peek(2, 0, mem_type);
+        ValueType mem_type = MemoryIndexType(imm.memory.memory);
+        auto [dst, offset, size] = Pop(mem_type, kWasmI32, kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(MemoryInit, imm, dst, offset, size);
-        Drop(3);
         return opcode_length + imm.length;
       }
       case kExprDataDrop: {
@@ -6368,32 +6121,34 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       case kExprMemoryCopy: {
         MemoryCopyImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ValueType mem_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-        Value size = Peek(0, 2, mem_type);
-        Value src = Peek(1, 1, mem_type);
-        Value dst = Peek(2, 0, mem_type);
+        ValueType mem_type = MemoryIndexType(imm.memory_src.memory);
+        if (mem_type != MemoryIndexType(imm.memory_dst.memory)) {
+          // Disallow copying between a 32-bit and a 64-bit memory, because it's
+          // not clear what type to expect for the number of bytes.
+          // TODO(14258): Check if the spec says anything about copying between
+          // memories of different type.
+          this->DecodeError(this->pc_,
+                            "copying between memories of different type");
+          return 0;
+        }
+
+        auto [dst, src, size] = Pop(mem_type, mem_type, mem_type);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(MemoryCopy, imm, dst, src, size);
-        Drop(3);
         return opcode_length + imm.length;
       }
       case kExprMemoryFill: {
         MemoryIndexImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ValueType mem_type = this->module_->is_memory64 ? kWasmI64 : kWasmI32;
-        Value size = Peek(0, 2, mem_type);
-        Value value = Peek(1, 1, kWasmI32);
-        Value dst = Peek(2, 0, mem_type);
+        ValueType mem_type = MemoryIndexType(imm.memory);
+        auto [dst, value, size] = Pop(mem_type, kWasmI32, mem_type);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(MemoryFill, imm, dst, value, size);
-        Drop(3);
         return opcode_length + imm.length;
       }
       case kExprTableInit: {
         TableInitImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ArgVector args = PeekArgs(sig);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(TableInit, imm,
-                                           base::VectorOf(args));
-        DropArgs(sig);
+        PoppedArgVector args = PopArgs(sig);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(TableInit, imm, args.data());
         return opcode_length + imm.length;
       }
       case kExprElemDrop: {
@@ -6408,43 +6163,36 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       case kExprTableCopy: {
         TableCopyImmediate imm(this, this->pc_ + opcode_length, validate);
         if (!this->Validate(this->pc_ + opcode_length, imm)) return 0;
-        ArgVector args = PeekArgs(sig);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(TableCopy, imm,
-                                           base::VectorOf(args));
-        DropArgs(sig);
+        PoppedArgVector args = PopArgs(sig);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(TableCopy, imm, args.data());
         return opcode_length + imm.length;
       }
       case kExprTableGrow: {
         IndexImmediate imm(this, this->pc_ + opcode_length, "table index",
                            validate);
         if (!this->ValidateTable(this->pc_ + opcode_length, imm)) return 0;
-        Value delta = Peek(0, 1, kWasmI32);
-        Value value = Peek(1, 0, this->module_->tables[imm.index].type);
-        Value result = CreateValue(kWasmI32);
+        auto [value, delta] =
+            Pop(this->module_->tables[imm.index].type, kWasmI32);
+        Value* result = Push(kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(TableGrow, imm, value, delta,
-                                           &result);
-        Drop(2);
-        Push(result);
+                                           result);
         return opcode_length + imm.length;
       }
       case kExprTableSize: {
         IndexImmediate imm(this, this->pc_ + opcode_length, "table index",
                            validate);
         if (!this->ValidateTable(this->pc_ + opcode_length, imm)) return 0;
-        Value result = CreateValue(kWasmI32);
-        CALL_INTERFACE_IF_OK_AND_REACHABLE(TableSize, imm, &result);
-        Push(result);
+        Value* result = Push(kWasmI32);
+        CALL_INTERFACE_IF_OK_AND_REACHABLE(TableSize, imm, result);
         return opcode_length + imm.length;
       }
       case kExprTableFill: {
         IndexImmediate imm(this, this->pc_ + opcode_length, "table index",
                            validate);
         if (!this->ValidateTable(this->pc_ + opcode_length, imm)) return 0;
-        Value count = Peek(0, 2, kWasmI32);
-        Value value = Peek(1, 1, this->module_->tables[imm.index].type);
-        Value start = Peek(2, 0, kWasmI32);
+        auto [start, value, count] =
+            Pop(kWasmI32, this->module_->tables[imm.index].type, kWasmI32);
         CALL_INTERFACE_IF_OK_AND_REACHABLE(TableFill, imm, start, value, count);
-        Drop(3);
         return opcode_length + imm.length;
       }
       default:
@@ -6455,14 +6203,17 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
 
   V8_INLINE Value CreateValue(ValueType type) { return Value{this->pc_, type}; }
 
-  V8_INLINE void Push(Value value) {
-    DCHECK_NE(kWasmVoid, value.type);
+  V8_INLINE Value* Push(Value value) {
+    DCHECK_IMPLIES(this->ok(), value.type != kWasmVoid);
     // {stack_.EnsureMoreCapacity} should have been called before, either in the
     // central decoding loop, or individually if more than one element is
     // pushed.
     stack_.push(value);
+    return &stack_.back();
   }
 
+  V8_INLINE Value* Push(ValueType type) { return Push(CreateValue(type)); }
+
   void PushMergeValues(Control* c, Merge<Value>* merge) {
     if constexpr (decoding_mode == kConstantExpression) return;
     DCHECK_EQ(c, &control_.back());
@@ -6481,18 +6232,20 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     DCHECK_EQ(c->stack_depth + merge->arity, stack_.size());
   }
 
-  V8_INLINE ReturnVector CreateReturnValues(const FunctionSig* sig) {
-    size_t return_count = sig->return_count();
-    ReturnVector values(return_count);
-    std::transform(sig->returns().begin(), sig->returns().end(), values.begin(),
-                   [this](ValueType type) { return CreateValue(type); });
-    return values;
-  }
   V8_INLINE void PushReturns(ReturnVector values) {
     stack_.EnsureMoreCapacity(static_cast<int>(values.size()), this->zone_);
     for (Value& value : values) Push(value);
   }
 
+  Value* PushReturns(const FunctionSig* sig) {
+    size_t return_count = sig->return_count();
+    stack_.EnsureMoreCapacity(static_cast<int>(return_count), this->zone_);
+    for (size_t i = 0; i < return_count; ++i) {
+      Push(sig->GetReturn(i));
+    }
+    return stack_.end() - return_count;
+  }
+
   // We do not inline these functions because doing so causes a large binary
   // size increase. Not inlining them should not create a performance
   // degradation, because their invocations are guarded by V8_LIKELY.
@@ -6523,16 +6276,42 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
         SafeOpcodeNameAt(this->pc_), needed, actual);
   }
 
-  V8_INLINE Value Peek(int depth, int index, ValueType expected) {
-    Value val = Peek(depth);
-    if (!VALIDATE(IsSubtypeOf(val.type, expected, this->module_) ||
-                  val.type == kWasmBottom || expected == kWasmBottom)) {
-      PopTypeError(index, val, expected);
+  V8_INLINE Value Pop(int index, ValueType expected) {
+    Value value = Pop();
+    ValidateStackValue(index, value, expected);
+    return value;
+  }
+
+  V8_INLINE void ValidateStackValue(int index, Value value,
+                                    ValueType expected) {
+    if (!VALIDATE(IsSubtypeOf(value.type, expected, this->module_) ||
+                  value.type == kWasmBottom || expected == kWasmBottom)) {
+      PopTypeError(index, value, expected);
     }
-    return val;
   }
 
-  V8_INLINE Value Peek(int depth) {
+  V8_INLINE Value Pop() {
+    DCHECK(!control_.empty());
+    uint32_t limit = control_.back().stack_depth;
+    if (V8_UNLIKELY(stack_size() <= limit)) {
+      // Popping past the current control start in reachable code.
+      if (!VALIDATE(control_.back().unreachable())) {
+        NotEnoughArgumentsError(1, 0);
+      }
+      return UnreachableValue(this->pc_);
+    }
+    Value top_of_stack = stack_.back();
+    stack_.pop();
+    return top_of_stack;
+  }
+
+  V8_INLINE Value Peek(int depth, int index, ValueType expected) {
+    Value value = Peek(depth);
+    ValidateStackValue(index, value, expected);
+    return value;
+  }
+
+  V8_INLINE Value Peek(int depth = 0) {
     DCHECK(!control_.empty());
     uint32_t limit = control_.back().stack_depth;
     if (V8_UNLIKELY(stack_.size() <= limit + depth)) {
@@ -6547,10 +6326,35 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     return *(stack_.end() - depth - 1);
   }
 
-  Value PeekPackedArray(uint32_t stack_depth, uint32_t operand_index,
-                        ValueType expected_element_type,
-                        WasmArrayAccess access) {
-    Value array = Peek(stack_depth);
+  V8_INLINE Value Peek(ValueType expected) { return Peek(0, 0, expected); }
+
+  // Pop multiple values at once; faster than multiple individual {Pop}s.
+  // Returns an array of the popped values if there are multiple, or the popped
+  // value itself if a single type is passed.
+  template <typename... ValueTypes,
+            typename = std::enable_if_t<
+                // Pop is only allowed to be called with ValueType parameters.
+                std::conjunction_v<std::is_same<ValueType, ValueTypes>...>>>
+  V8_INLINE std::conditional_t<sizeof...(ValueTypes) == 1, Value,
+                               std::array<Value, sizeof...(ValueTypes)>>
+  Pop(ValueTypes... expected_types) {
+    constexpr int kCount = sizeof...(ValueTypes);
+    EnsureStackArguments(kCount);
+    DCHECK_LE(control_.back().stack_depth, stack_size());
+    DCHECK_GE(stack_size() - control_.back().stack_depth, kCount);
+    // Note: Popping from the {FastZoneVector} does not invalidate the old (now
+    // out-of-range) elements.
+    stack_.pop(kCount);
+    auto ValidateAndGetNextArg = [this, i = 0](ValueType type) mutable {
+      ValidateStackValue(i, stack_.end()[i], type);
+      return stack_.end()[i++];
+    };
+    return {ValidateAndGetNextArg(expected_types)...};
+  }
+
+  Value PopPackedArray(uint32_t operand_index, ValueType expected_element_type,
+                       WasmArrayAccess access) {
+    Value array = Pop();
     if (array.type.is_bottom()) {
       // We are in a polymorphic stack. Leave the stack as it is.
       DCHECK(!current_code_reachable_and_ok_);
@@ -6575,15 +6379,6 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     return array;
   }
 
-  V8_INLINE void ValidateArgType(ArgVector args, int index,
-                                 ValueType expected) {
-    Value val = args[index];
-    if (!VALIDATE(IsSubtypeOf(val.type, expected, this->module_) ||
-                  val.type == kWasmBottom || expected == kWasmBottom)) {
-      PopTypeError(index, val, expected);
-    }
-  }
-
   // Drop the top {count} stack elements, or all of them if less than {count}
   // are present.
   V8_INLINE void Drop(int count = 1) {
@@ -6612,9 +6407,8 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   };
 
   // - If the current code is reachable, check if the current stack values are
-  //   compatible with {merge} based on their number and types. Disregard the
-  //   first {drop_values} on the stack. If {strict_count}, check that
-  //   #(stack elements) == {merge->arity}, otherwise
+  //   compatible with {merge} based on their number and types. If
+  //   {strict_count}, check that #(stack elements) == {merge->arity}, otherwise
   //   #(stack elements) >= {merge->arity}.
   // - If the current code is unreachable, check if any values that may exist on
   //   top of the stack are compatible with {merge}. If {push_branch_values},
@@ -6626,7 +6420,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   //   introduction of subtyping.
   template <StackElementsCountMode strict_count, bool push_branch_values,
             MergeType merge_type>
-  bool TypeCheckStackAgainstMerge(uint32_t drop_values, Merge<Value>* merge) {
+  bool TypeCheckStackAgainstMerge(Merge<Value>* merge) {
     constexpr const char* merge_description =
         merge_type == kBranchMerge     ? "branch"
         : merge_type == kReturnMerge   ? "return"
@@ -6638,15 +6432,13 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     // if the current code is reachable even if it is spec-only reachable.
     if (V8_LIKELY(decoding_mode == kConstantExpression ||
                   !control_.back().unreachable())) {
-      if (V8_UNLIKELY(strict_count ? actual != drop_values + arity
-                                   : actual < drop_values + arity)) {
+      if (V8_UNLIKELY(strict_count ? actual != arity : actual < arity)) {
         this->DecodeError("expected %u elements on the stack for %s, found %u",
-                          arity, merge_description,
-                          actual >= drop_values ? actual - drop_values : 0);
+                          arity, merge_description, actual);
         return false;
       }
       // Typecheck the topmost {merge->arity} values on the stack.
-      Value* stack_values = stack_.end() - (arity + drop_values);
+      Value* stack_values = stack_.end() - arity;
       for (uint32_t i = 0; i < arity; ++i) {
         Value& val = stack_values[i];
         Value& old = (*merge)[i];
@@ -6660,25 +6452,24 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
       return true;
     }
     // Unreachable code validation starts here.
-    if (V8_UNLIKELY(strict_count && actual > drop_values + arity)) {
+    if (V8_UNLIKELY(strict_count && actual > arity)) {
       this->DecodeError("expected %u elements on the stack for %s, found %u",
-                        arity, merge_description,
-                        actual >= drop_values ? actual - drop_values : 0);
+                        arity, merge_description, actual);
       return false;
     }
     // TODO(manoskouk): Use similar code as above if we keep unreachable checks.
-    for (int i = arity - 1, depth = drop_values; i >= 0; --i, ++depth) {
+    for (int i = arity - 1, depth = 0; i >= 0; --i, ++depth) {
       Peek(depth, i, (*merge)[i].type);
     }
     if constexpr (push_branch_values) {
       uint32_t inserted_value_count =
-          static_cast<uint32_t>(EnsureStackArguments(drop_values + arity));
+          static_cast<uint32_t>(EnsureStackArguments(arity));
       if (inserted_value_count > 0) {
         // stack_.EnsureMoreCapacity() may have inserted unreachable values into
         // the bottom of the stack. If so, mark them with the correct type. If
         // drop values were also inserted, disregard them, as they will be
         // dropped anyway.
-        Value* stack_base = stack_value(drop_values + arity);
+        Value* stack_base = stack_value(arity);
         for (uint32_t i = 0; i < std::min(arity, inserted_value_count); i++) {
           if (stack_base[i].type == kWasmBottom) {
             stack_base[i].type = (*merge)[i].type;
@@ -6692,7 +6483,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   template <StackElementsCountMode strict_count, MergeType merge_type>
   bool DoReturn() {
     if (!VALIDATE((TypeCheckStackAgainstMerge<strict_count, false, merge_type>(
-            0, &control_.front().end_merge)))) {
+            &control_.front().end_merge)))) {
       return false;
     }
     DCHECK_IMPLIES(current_code_reachable_and_ok_,
@@ -6702,7 +6493,9 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
     return true;
   }
 
-  int startrel(const byte* ptr) { return static_cast<int>(ptr - this->start_); }
+  int startrel(const uint8_t* ptr) {
+    return static_cast<int>(ptr - this->start_);
+  }
 
   void FallThrough() {
     Control* c = &control_.back();
@@ -6733,7 +6526,7 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
 
   bool TypeCheckFallThru() {
     return TypeCheckStackAgainstMerge<kStrictCounting, true, kFallthroughMerge>(
-        0, &control_.back().end_merge);
+        &control_.back().end_merge);
   }
 
   // If the current code is reachable, check if the current stack values are
@@ -6743,13 +6536,10 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   // push back to the stack values based on the type of {c} (this is needed for
   // conditional branches due to their typing rules, and fallthroughs so that
   // the outer control finds enough values on the stack).
-  // {drop_values} is the number of stack values that will be dropped before the
-  // branch is taken. This is currently 1 for for br (condition), br_table
-  // (index) and br_on_null (reference), and 0 for all other branches.
   template <bool push_branch_values>
-  bool TypeCheckBranch(Control* c, uint32_t drop_values) {
+  bool TypeCheckBranch(Control* c) {
     return TypeCheckStackAgainstMerge<kNonStrictCounting, push_branch_values,
-                                      kBranchMerge>(drop_values, c->br_merge());
+                                      kBranchMerge>(c->br_merge());
   }
 
   void onFirstError() override {
@@ -6785,27 +6575,17 @@ class WasmFullDecoder : public WasmDecoder<ValidationTag, decoding_mode> {
   int BuildSimpleOperator(WasmOpcode opcode, ValueType return_type,
                           ValueType arg_type) {
     DCHECK_NE(kWasmVoid, return_type);
-    Value val = Peek(0, 0, arg_type);
-    Value ret = CreateValue(return_type);
-    CALL_INTERFACE_IF_OK_AND_REACHABLE(UnOp, opcode, val, &ret);
-    Drop(val);
-    Push(ret);
+    Value val = Pop(arg_type);
+    Value* ret = Push(return_type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(UnOp, opcode, val, ret);
     return 1;
   }
 
   int BuildSimpleOperator(WasmOpcode opcode, ValueType return_type,
                           ValueType lhs_type, ValueType rhs_type) {
-    Value rval = Peek(0, 1, rhs_type);
-    Value lval = Peek(1, 0, lhs_type);
-    if (return_type == kWasmVoid) {
-      CALL_INTERFACE_IF_OK_AND_REACHABLE(BinOp, opcode, lval, rval, nullptr);
-      Drop(2);
-    } else {
-      Value ret = CreateValue(return_type);
-      CALL_INTERFACE_IF_OK_AND_REACHABLE(BinOp, opcode, lval, rval, &ret);
-      Drop(2);
-      Push(ret);
-    }
+    auto [lval, rval] = Pop(lhs_type, rhs_type);
+    Value* ret = return_type == kWasmVoid ? nullptr : Push(return_type);
+    CALL_INTERFACE_IF_OK_AND_REACHABLE(BinOp, opcode, lval, rval, ret);
     return 1;
   }
 
@@ -6823,6 +6603,7 @@ class EmptyInterface {
  public:
   using ValidationTag = Decoder::FullValidationTag;
   static constexpr DecodingMode decoding_mode = kFunctionBody;
+  static constexpr bool kUsesPoppedArgs = false;
   using Value = ValueBase<ValidationTag>;
   using Control = ControlBase<Value, ValidationTag>;
   using FullDecoder = WasmFullDecoder<ValidationTag, EmptyInterface>;
@@ -6840,8 +6621,6 @@ class EmptyInterface {
 #undef VALIDATE
 #undef CHECK_PROTOTYPE_OPCODE
 
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
 
 #endif  // V8_WASM_FUNCTION_BODY_DECODER_IMPL_H_
diff --git a/deps/v8/src/wasm/function-body-decoder.cc b/deps/v8/src/wasm/function-body-decoder.cc
index 1d667f4952e353..27e81a58407f2c 100644
--- a/deps/v8/src/wasm/function-body-decoder.cc
+++ b/deps/v8/src/wasm/function-body-decoder.cc
@@ -19,8 +19,8 @@ namespace wasm {
 
 template <typename ValidationTag>
 bool DecodeLocalDecls(WasmFeatures enabled, BodyLocalDecls* decls,
-                      const WasmModule* module, const byte* start,
-                      const byte* end, Zone* zone) {
+                      const WasmModule* module, const uint8_t* start,
+                      const uint8_t* end, Zone* zone) {
   if constexpr (ValidationTag::validate) DCHECK_NOT_NULL(module);
   WasmFeatures no_features = WasmFeatures::None();
   constexpr FixedSizeSignature<ValueType, 0, 0> kNoSig;
@@ -40,7 +40,7 @@ bool DecodeLocalDecls(WasmFeatures enabled, BodyLocalDecls* decls,
 }
 
 void DecodeLocalDecls(WasmFeatures enabled, BodyLocalDecls* decls,
-                      const byte* start, const byte* end, Zone* zone) {
+                      const uint8_t* start, const uint8_t* end, Zone* zone) {
   constexpr WasmModule* kNoModule = nullptr;
   DecodeLocalDecls<Decoder::NoValidationTag>(enabled, decls, kNoModule, start,
                                              end, zone);
@@ -49,16 +49,16 @@ void DecodeLocalDecls(WasmFeatures enabled, BodyLocalDecls* decls,
 bool ValidateAndDecodeLocalDeclsForTesting(WasmFeatures enabled,
                                            BodyLocalDecls* decls,
                                            const WasmModule* module,
-                                           const byte* start, const byte* end,
-                                           Zone* zone) {
+                                           const uint8_t* start,
+                                           const uint8_t* end, Zone* zone) {
   return DecodeLocalDecls<Decoder::BooleanValidationTag>(enabled, decls, module,
                                                          start, end, zone);
 }
 
-BytecodeIterator::BytecodeIterator(const byte* start, const byte* end)
+BytecodeIterator::BytecodeIterator(const uint8_t* start, const uint8_t* end)
     : Decoder(start, end) {}
 
-BytecodeIterator::BytecodeIterator(const byte* start, const byte* end,
+BytecodeIterator::BytecodeIterator(const uint8_t* start, const uint8_t* end,
                                    BodyLocalDecls* decls, Zone* zone)
     : Decoder(start, end) {
   DCHECK_NOT_NULL(decls);
@@ -81,7 +81,7 @@ DecodeResult ValidateFunctionBody(const WasmFeatures& enabled,
   return decoder.toResult(nullptr);
 }
 
-unsigned OpcodeLength(const byte* pc, const byte* end) {
+unsigned OpcodeLength(const uint8_t* pc, const uint8_t* end) {
   WasmFeatures unused_detected_features;
   Zone* no_zone = nullptr;
   WasmModule* no_module = nullptr;
@@ -94,18 +94,7 @@ unsigned OpcodeLength(const byte* pc, const byte* end) {
 
 bool CheckHardwareSupportsSimd() { return CpuFeatures::SupportsWasmSimd128(); }
 
-std::pair<uint32_t, uint32_t> StackEffect(const WasmModule* module,
-                                          const FunctionSig* sig,
-                                          const byte* pc, const byte* end) {
-  WasmFeatures unused_detected_features = WasmFeatures::None();
-  Zone* no_zone = nullptr;
-  WasmDecoder<Decoder::NoValidationTag> decoder(
-      no_zone, module, WasmFeatures::All(), &unused_detected_features, sig, pc,
-      end);
-  return decoder.StackEffect(pc);
-}
-
-void PrintRawWasmCode(const byte* start, const byte* end) {
+void PrintRawWasmCode(const uint8_t* start, const uint8_t* end) {
   AccountingAllocator allocator;
   PrintRawWasmCode(&allocator, FunctionBody{nullptr, 0, start, end}, nullptr,
                    kPrintLocals);
@@ -184,7 +173,7 @@ bool PrintRawWasmCode(AccountingAllocator* allocator, const FunctionBody& body,
     if (line_numbers) line_numbers->push_back(kNoByteCode);
     ++line_nr;
 
-    for (const byte* locals = body.start; locals < i.pc(); locals++) {
+    for (const uint8_t* locals = body.start; locals < i.pc(); locals++) {
       os << (locals == body.start ? "0x" : " 0x") << AsHex(*locals, 2) << ",";
     }
     os << std::endl;
@@ -226,6 +215,11 @@ bool PrintRawWasmCode(AccountingAllocator* allocator, const FunctionBody& body,
       os << PrefixName(prefix) << ", ";
     }
 
+    if (WasmOpcodes::IsRelaxedSimdOpcode(opcode)) {
+      // Expand multi-byte opcodes.
+      os << "...";
+      offset += 1;
+    }
     os << RawOpcodeName(opcode) << ",";
 
     if (opcode == kExprLoop || opcode == kExprIf || opcode == kExprBlock ||
@@ -302,6 +296,12 @@ bool PrintRawWasmCode(AccountingAllocator* allocator, const FunctionBody& body,
         os << ": " << *imm.sig;
         break;
       }
+      case kExprCallRef: {
+        SigIndexImmediate imm(&i, i.pc() + 1, Decoder::kNoValidation);
+        CHECK(decoder.Validate(i.pc() + 1, imm));
+        os << ": " << *imm.sig;
+        break;
+      }
       case kExprCallFunction: {
         CallFunctionImmediate imm(&i, i.pc() + 1, Decoder::kNoValidation);
         os << " function #" << imm.index;
@@ -322,7 +322,8 @@ bool PrintRawWasmCode(AccountingAllocator* allocator, const FunctionBody& body,
 }
 
 BitVector* AnalyzeLoopAssignmentForTesting(Zone* zone, uint32_t num_locals,
-                                           const byte* start, const byte* end,
+                                           const uint8_t* start,
+                                           const uint8_t* end,
                                            bool* loop_is_innermost) {
   WasmFeatures no_features = WasmFeatures::None();
   WasmDecoder<Decoder::FullValidationTag> decoder(
diff --git a/deps/v8/src/wasm/function-body-decoder.h b/deps/v8/src/wasm/function-body-decoder.h
index 5a91669cb62e6d..1e8c51339e2c96 100644
--- a/deps/v8/src/wasm/function-body-decoder.h
+++ b/deps/v8/src/wasm/function-body-decoder.h
@@ -17,13 +17,12 @@
 #include "src/wasm/wasm-result.h"
 #include "src/zone/zone-containers.h"
 
-namespace v8 {
-namespace internal {
-
+namespace v8::internal {
 class AccountingAllocator;
-class BitVector;  // forward declaration
+class BitVector;
+}  // namespace v8::internal
 
-namespace wasm {
+namespace v8::internal::wasm {
 
 class WasmFeatures;
 struct WasmModule;  // forward declaration of module interface.
@@ -32,11 +31,11 @@ struct WasmModule;  // forward declaration of module interface.
 struct FunctionBody {
   const FunctionSig* sig;  // function signature
   uint32_t offset;         // offset in the module bytes, for error reporting
-  const byte* start;       // start of the function body
-  const byte* end;         // end of the function body
+  const uint8_t* start;    // start of the function body
+  const uint8_t* end;      // end of the function body
 
-  FunctionBody(const FunctionSig* sig, uint32_t offset, const byte* start,
-               const byte* end)
+  FunctionBody(const FunctionSig* sig, uint32_t offset, const uint8_t* start,
+               const uint8_t* end)
       : sig(sig), offset(offset), start(start), end(end) {}
 };
 
@@ -59,7 +58,7 @@ bool PrintRawWasmCode(AccountingAllocator* allocator, const FunctionBody& body,
                       std::vector<int>* line_numbers = nullptr);
 
 // A simplified form of AST printing, e.g. from a debugger.
-void PrintRawWasmCode(const byte* start, const byte* end);
+void PrintRawWasmCode(const uint8_t* start, const uint8_t* end);
 
 struct BodyLocalDecls {
   // The size of the encoded declarations.
@@ -72,30 +71,20 @@ struct BodyLocalDecls {
 // Decode locals; validation is not performed.
 V8_EXPORT_PRIVATE void DecodeLocalDecls(WasmFeatures enabled,
                                         BodyLocalDecls* decls,
-                                        const byte* start, const byte* end,
-                                        Zone* zone);
+                                        const uint8_t* start,
+                                        const uint8_t* end, Zone* zone);
 
 // Decode locals, including validation.
 V8_EXPORT_PRIVATE bool ValidateAndDecodeLocalDeclsForTesting(
     WasmFeatures enabled, BodyLocalDecls* decls, const WasmModule* module,
-    const byte* start, const byte* end, Zone* zone);
+    const uint8_t* start, const uint8_t* end, Zone* zone);
 
 V8_EXPORT_PRIVATE BitVector* AnalyzeLoopAssignmentForTesting(
-    Zone* zone, uint32_t num_locals, const byte* start, const byte* end,
+    Zone* zone, uint32_t num_locals, const uint8_t* start, const uint8_t* end,
     bool* loop_is_innermost);
 
 // Computes the length of the opcode at the given address.
-V8_EXPORT_PRIVATE unsigned OpcodeLength(const byte* pc, const byte* end);
-
-// Computes the stack effect of the opcode at the given address.
-// Returns <pop count, push count>.
-// Be cautious with control opcodes: This function only covers their immediate,
-// local stack effect (e.g. BrIf pops 1, Br pops 0). Those opcodes can have
-// non-local stack effect though, which are not covered here.
-// TODO(clemensb): This is only used by the interpreter; move there.
-V8_EXPORT_PRIVATE std::pair<uint32_t, uint32_t> StackEffect(
-    const WasmModule* module, const FunctionSig* sig, const byte* pc,
-    const byte* end);
+V8_EXPORT_PRIVATE unsigned OpcodeLength(const uint8_t* pc, const uint8_t* end);
 
 // Checks if the underlying hardware supports the Wasm SIMD proposal.
 V8_EXPORT_PRIVATE bool CheckHardwareSupportsSimd();
@@ -118,9 +107,10 @@ class V8_EXPORT_PRIVATE BytecodeIterator : public NON_EXPORTED_BASE(Decoder) {
     }
 
    protected:
-    const byte* ptr_;
-    const byte* end_;
-    iterator_base(const byte* ptr, const byte* end) : ptr_(ptr), end_(end) {}
+    const uint8_t* ptr_;
+    const uint8_t* end_;
+    iterator_base(const uint8_t* ptr, const uint8_t* end)
+        : ptr_(ptr), end_(end) {}
   };
 
  public:
@@ -136,7 +126,7 @@ class V8_EXPORT_PRIVATE BytecodeIterator : public NON_EXPORTED_BASE(Decoder) {
 
    private:
     friend class BytecodeIterator;
-    opcode_iterator(const byte* ptr, const byte* end)
+    opcode_iterator(const uint8_t* ptr, const uint8_t* end)
         : iterator_base(ptr, end) {}
   };
   // If one wants to iterate over the instruction offsets without looking at
@@ -151,25 +141,26 @@ class V8_EXPORT_PRIVATE BytecodeIterator : public NON_EXPORTED_BASE(Decoder) {
     }
 
    private:
-    const byte* start_;
+    const uint8_t* start_;
     friend class BytecodeIterator;
-    offset_iterator(const byte* start, const byte* ptr, const byte* end)
+    offset_iterator(const uint8_t* start, const uint8_t* ptr,
+                    const uint8_t* end)
         : iterator_base(ptr, end), start_(start) {}
   };
 
   // Create a new {BytecodeIterator}, starting after the locals declarations.
-  BytecodeIterator(const byte* start, const byte* end);
+  BytecodeIterator(const uint8_t* start, const uint8_t* end);
 
   // Create a new {BytecodeIterator}, starting with locals declarations.
-  BytecodeIterator(const byte* start, const byte* end, BodyLocalDecls* decls,
-                   Zone* zone);
+  BytecodeIterator(const uint8_t* start, const uint8_t* end,
+                   BodyLocalDecls* decls, Zone* zone);
 
-  base::iterator_range<opcode_iterator> opcodes() {
+  base::iterator_range<opcode_iterator> opcodes() const {
     return base::iterator_range<opcode_iterator>(opcode_iterator(pc_, end_),
                                                  opcode_iterator(end_, end_));
   }
 
-  base::iterator_range<offset_iterator> offsets() {
+  base::iterator_range<offset_iterator> offsets() const {
     return base::iterator_range<offset_iterator>(
         offset_iterator(start_, pc_, end_),
         offset_iterator(start_, end_, end_));
@@ -187,16 +178,16 @@ class V8_EXPORT_PRIVATE BytecodeIterator : public NON_EXPORTED_BASE(Decoder) {
     }
   }
 
-  bool has_next() { return pc_ < end_; }
+  bool has_next() const { return pc_ < end_; }
 
   WasmOpcode prefixed_opcode() {
     auto [opcode, length] = read_prefixed_opcode<Decoder::NoValidationTag>(pc_);
     return opcode;
   }
+
+  const uint8_t* pc() const { return pc_; }
 };
 
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
 
 #endif  // V8_WASM_FUNCTION_BODY_DECODER_H_
diff --git a/deps/v8/src/wasm/function-compiler.cc b/deps/v8/src/wasm/function-compiler.cc
index 4972776fd97736..48afe6a1e4342d 100644
--- a/deps/v8/src/wasm/function-compiler.cc
+++ b/deps/v8/src/wasm/function-compiler.cc
@@ -6,12 +6,14 @@
 
 #include "src/codegen/compiler.h"
 #include "src/codegen/optimized-compilation-info.h"
+#include "src/compiler/turboshaft/wasm-turboshaft-compiler.h"
 #include "src/compiler/wasm-compiler.h"
 #include "src/handles/handles-inl.h"
 #include "src/logging/counters-scopes.h"
 #include "src/logging/log.h"
 #include "src/objects/code-inl.h"
 #include "src/wasm/baseline/liftoff-compiler.h"
+#include "src/wasm/turboshaft-graph-interface.h"
 #include "src/wasm/wasm-code-manager.h"
 #include "src/wasm/wasm-debug.h"
 
@@ -19,14 +21,13 @@ namespace v8::internal::wasm {
 
 WasmCompilationResult WasmCompilationUnit::ExecuteCompilation(
     CompilationEnv* env, const WireBytesStorage* wire_bytes_storage,
-    Counters* counters, AssemblerBufferCache* buffer_cache,
-    WasmFeatures* detected) {
+    Counters* counters, WasmFeatures* detected) {
   WasmCompilationResult result;
   if (func_index_ < static_cast<int>(env->module->num_imported_functions)) {
     result = ExecuteImportWrapperCompilation(env);
   } else {
-    result = ExecuteFunctionCompilation(env, wire_bytes_storage, counters,
-                                        buffer_cache, detected);
+    result =
+        ExecuteFunctionCompilation(env, wire_bytes_storage, counters, detected);
   }
 
   if (result.succeeded() && counters) {
@@ -56,8 +57,7 @@ WasmCompilationResult WasmCompilationUnit::ExecuteImportWrapperCompilation(
 
 WasmCompilationResult WasmCompilationUnit::ExecuteFunctionCompilation(
     CompilationEnv* env, const WireBytesStorage* wire_bytes_storage,
-    Counters* counters, AssemblerBufferCache* buffer_cache,
-    WasmFeatures* detected) {
+    Counters* counters, WasmFeatures* detected) {
   auto* func = &env->module->functions[func_index_];
   base::Vector<const uint8_t> code = wire_bytes_storage->GetCode(func->code);
   wasm::FunctionBody func_body{func->sig, func->code.offset(), code.begin(),
@@ -118,24 +118,21 @@ WasmCompilationResult WasmCompilationUnit::ExecuteFunctionCompilation(
           func_index_ >= 32 ||
           ((v8_flags.wasm_tier_mask_for_testing & (1 << func_index_)) == 0) ||
           v8_flags.liftoff_only) {
+        auto options = LiftoffOptions{}
+                           .set_func_index(func_index_)
+                           .set_for_debugging(for_debugging_)
+                           .set_counters(counters)
+                           .set_detected_features(detected);
         // We do not use the debug side table, we only (optionally) pass it to
         // cover different code paths in Liftoff for testing.
         std::unique_ptr<DebugSideTable> unused_debug_sidetable;
-        std::unique_ptr<DebugSideTable>* debug_sidetable_ptr = nullptr;
         if (V8_UNLIKELY(func_index_ < 32 &&
                         (v8_flags.wasm_debug_mask_for_testing &
                          (1 << func_index_)) != 0)) {
-          debug_sidetable_ptr = &unused_debug_sidetable;
+          options.set_debug_sidetable(&unused_debug_sidetable);
+          if (!for_debugging_) options.set_for_debugging(kForDebugging);
         }
-        result = ExecuteLiftoffCompilation(
-            env, func_body,
-            LiftoffOptions{}
-                .set_func_index(func_index_)
-                .set_for_debugging(for_debugging_)
-                .set_counters(counters)
-                .set_detected_features(detected)
-                .set_assembler_buffer_cache(buffer_cache)
-                .set_debug_sidetable(debug_sidetable_ptr));
+        result = ExecuteLiftoffCompilation(env, func_body, options);
         if (result.succeeded()) break;
       }
 
@@ -152,7 +149,18 @@ WasmCompilationResult WasmCompilationUnit::ExecuteFunctionCompilation(
       compiler::WasmCompilationData data(func_body);
       data.func_index = func_index_;
       data.wire_bytes_storage = wire_bytes_storage;
-      data.buffer_cache = buffer_cache;
+      bool use_turboshaft = v8_flags.turboshaft_wasm;
+      if (func_index_ < 32 && ((v8_flags.wasm_turboshaft_mask_for_testing &
+                                (1 << func_index_)) == 1)) {
+        use_turboshaft = true;
+      }
+      if (use_turboshaft) {
+        result = compiler::turboshaft::ExecuteTurboshaftWasmCompilation(
+            env, data, detected);
+        if (result.succeeded()) return result;
+        // Else fall back to turbofan.
+      }
+
       result = compiler::ExecuteTurbofanWasmCompilation(env, data, counters,
                                                         detected);
       result.for_debugging = for_debugging_;
@@ -180,53 +188,25 @@ void WasmCompilationUnit::CompileWasmFunction(Counters* counters,
   CompilationEnv env = native_module->CreateCompilationEnv();
   WasmCompilationResult result = unit.ExecuteCompilation(
       &env, native_module->compilation_state()->GetWireBytesStorage().get(),
-      counters, nullptr, detected);
+      counters, detected);
   if (result.succeeded()) {
     WasmCodeRefScope code_ref_scope;
-    // We need to extend the lifetime of {assumptions} beyond the
-    // {std::move(result)} statement.
-    // TODO(jkummerow): Refactor this: make {result} stack-allocated here
-    // and pass it by reference to other code that populates or consumes it.
-    AssumptionsJournal* assumptions = result.assumptions.release();
-    native_module->PublishCode(
-        native_module->AddCompiledCode(std::move(result)),
-        assumptions->empty() ? nullptr : assumptions);
-    delete assumptions;
+    AssumptionsJournal* assumptions = result.assumptions.get();
+    native_module->PublishCode(native_module->AddCompiledCode(result),
+                               assumptions->empty() ? nullptr : assumptions);
   } else {
     native_module->compilation_state()->SetError();
   }
 }
 
 namespace {
-bool UseGenericWrapper(const FunctionSig* sig) {
-#if V8_TARGET_ARCH_ARM64
-  if (!v8_flags.enable_wasm_arm64_generic_wrapper) {
-    return false;
-  }
-#endif
-#if (V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_ARM64)
-  if (sig->returns().size() > 1) {
-    return false;
-  }
-  if (sig->returns().size() == 1) {
-    ValueType ret = sig->GetReturn(0);
-    if (ret.kind() == kS128) return false;
-    if (ret.is_reference()) {
-      if (ret.heap_representation() != wasm::HeapType::kExtern &&
-          ret.heap_representation() != wasm::HeapType::kFunc) {
-        return false;
-      }
-    }
-  }
-  for (ValueType type : sig->parameters()) {
-    if (type.kind() != kI32 && type.kind() != kI64 && type.kind() != kF32 &&
-        type.kind() != kF64 &&
-        !(type.is_reference() &&
-          type.heap_representation() == wasm::HeapType::kExtern)) {
-      return false;
-    }
-  }
-  return v8_flags.wasm_generic_wrapper;
+bool UseGenericWrapper(const WasmModule* module, const FunctionSig* sig) {
+#if (V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_IA32 || \
+     V8_TARGET_ARCH_ARM)
+  // We don't use the generic wrapper for asm.js, because it creates invalid
+  // stack traces.
+  return !is_asmjs_module(module) && v8_flags.wasm_generic_wrapper &&
+         IsJSCompatibleSignature(sig);
 #else
   return false;
 #endif
@@ -241,7 +221,7 @@ JSToWasmWrapperCompilationUnit::JSToWasmWrapperCompilationUnit(
       is_import_(is_import),
       sig_(sig),
       canonical_sig_index_(canonical_sig_index),
-      use_generic_wrapper_(allow_generic && UseGenericWrapper(sig) &&
+      use_generic_wrapper_(allow_generic && UseGenericWrapper(module, sig) &&
                            !is_import),
       job_(use_generic_wrapper_
                ? nullptr
@@ -261,14 +241,13 @@ void JSToWasmWrapperCompilationUnit::Execute() {
 
 Handle<Code> JSToWasmWrapperCompilationUnit::Finalize() {
   if (use_generic_wrapper_) {
-    return isolate_->builtins()->code_handle(Builtin::kGenericJSToWasmWrapper);
+    return isolate_->builtins()->code_handle(Builtin::kJSToWasmWrapper);
   }
 
   CompilationJob::Status status = job_->FinalizeJob(isolate_);
   CHECK_EQ(status, CompilationJob::SUCCEEDED);
   Handle<Code> code = job_->compilation_info()->code();
-  if (isolate_->v8_file_logger()->is_listening_to_code_events() ||
-      isolate_->is_profiling()) {
+  if (isolate_->IsLoggingCodeCreation()) {
     Handle<String> name = isolate_->factory()->NewStringFromAsciiChecked(
         job_->compilation_info()->GetDebugName().get());
     PROFILE(isolate_, CodeCreateEvent(LogEventListener::CodeTag::kStub,
diff --git a/deps/v8/src/wasm/function-compiler.h b/deps/v8/src/wasm/function-compiler.h
index 6304f366706017..eb1a9f267f1c65 100644
--- a/deps/v8/src/wasm/function-compiler.h
+++ b/deps/v8/src/wasm/function-compiler.h
@@ -27,7 +27,6 @@ class TurbofanCompilationJob;
 
 namespace wasm {
 
-class AssemblerBufferCache;
 class NativeModule;
 class WasmCode;
 class WasmEngine;
@@ -75,9 +74,9 @@ struct WasmCompilationResult {
   std::unique_ptr<AssemblerBuffer> instr_buffer;
   uint32_t frame_slot_count = 0;
   uint32_t tagged_parameter_slots = 0;
-  base::OwnedVector<byte> source_positions;
-  base::OwnedVector<byte> inlining_positions;
-  base::OwnedVector<byte> protected_instructions_data;
+  base::OwnedVector<uint8_t> source_positions;
+  base::OwnedVector<uint8_t> inlining_positions;
+  base::OwnedVector<uint8_t> protected_instructions_data;
   std::unique_ptr<AssumptionsJournal> assumptions;
   int func_index = kAnonymousFuncIndex;
   ExecutionTier requested_tier;
@@ -97,7 +96,6 @@ class V8_EXPORT_PRIVATE WasmCompilationUnit final {
 
   WasmCompilationResult ExecuteCompilation(CompilationEnv*,
                                            const WireBytesStorage*, Counters*,
-                                           AssemblerBufferCache*,
                                            WasmFeatures* detected);
 
   ExecutionTier tier() const { return tier_; }
@@ -112,7 +110,6 @@ class V8_EXPORT_PRIVATE WasmCompilationUnit final {
   WasmCompilationResult ExecuteFunctionCompilation(CompilationEnv*,
                                                    const WireBytesStorage*,
                                                    Counters*,
-                                                   AssemblerBufferCache*,
                                                    WasmFeatures* detected);
 
   WasmCompilationResult ExecuteImportWrapperCompilation(CompilationEnv*);
diff --git a/deps/v8/src/wasm/graph-builder-interface.cc b/deps/v8/src/wasm/graph-builder-interface.cc
index 939b9f22d44f0a..4cbd8a90326223 100644
--- a/deps/v8/src/wasm/graph-builder-interface.cc
+++ b/deps/v8/src/wasm/graph-builder-interface.cc
@@ -79,22 +79,22 @@ struct SsaEnv : public ZoneObject {
   enum State { kUnreachable, kReached, kMerged };
 
   State state;
-  TFNode* control;
   TFNode* effect;
+  TFNode* control;
   compiler::WasmInstanceCacheNodes instance_cache;
   LocalsVector locals;
 
-  SsaEnv(LocalsAllocator* alloc, State state, TFNode* control, TFNode* effect,
+  SsaEnv(LocalsAllocator* alloc, State state, TFNode* effect, TFNode* control,
          uint32_t locals_size)
       : state(state),
-        control(control),
         effect(effect),
+        control(control),
         locals(alloc, locals_size) {}
 
   SsaEnv(const SsaEnv& other) V8_NOEXCEPT = default;
   SsaEnv(SsaEnv&& other) V8_NOEXCEPT : state(other.state),
-                                       control(other.control),
                                        effect(other.effect),
+                                       control(other.control),
                                        instance_cache(other.instance_cache),
                                        locals(std::move(other.locals)) {
     other.Kill();
@@ -118,6 +118,7 @@ class WasmGraphBuildingInterface {
   using FullDecoder =
       WasmFullDecoder<ValidationTag, WasmGraphBuildingInterface>;
   using CheckForNull = compiler::CheckForNull;
+  static constexpr bool kUsesPoppedArgs = true;
 
   struct Value : public ValueBase<ValidationTag> {
     TFNode* node = nullptr;
@@ -244,24 +245,38 @@ class WasmGraphBuildingInterface {
         ssa_env->locals[index++] = node;
       }
     }
-    LoadContextIntoSsa(ssa_env, decoder);
+
+    size_t num_memories =
+        decoder->module_ == nullptr ? 0 : decoder->module_->memories.size();
+    if (num_memories == 1) {
+      builder_->set_cached_memory_index(0);
+    } else if (num_memories > 1) {
+      int first_used_mem_index = FindFirstUsedMemoryIndex(
+          base::VectorOf(decoder->start(), decoder->end() - decoder->start()),
+          decoder->zone());
+      if (first_used_mem_index >= 0) {
+        builder_->set_cached_memory_index(first_used_mem_index);
+      }
+    }
+    LoadInstanceCacheIntoSsa(ssa_env);
 
     if (v8_flags.trace_wasm && inlined_status_ == kRegularFunction) {
       builder_->TraceFunctionEntry(decoder->position());
     }
   }
 
-  // Reload the instance cache entries into the Ssa Environment.
-  void LoadContextIntoSsa(SsaEnv* ssa_env, FullDecoder* decoder) {
-    if (ssa_env != nullptr) {
-      builder_->InitInstanceCache(&ssa_env->instance_cache);
-      TFNode* mem_size = ssa_env->instance_cache.mem_size;
-      if (mem_size != nullptr) {
-        bool is_memory64 =
-            decoder->module_ != nullptr && decoder->module_->is_memory64;
-        builder_->SetType(mem_size, is_memory64 ? kWasmI64 : kWasmI32);
-      }
-    }
+  // Load the instance cache entries into the Ssa Environment.
+  void LoadInstanceCacheIntoSsa(SsaEnv* ssa_env) {
+    builder_->InitInstanceCache(&ssa_env->instance_cache);
+  }
+
+  // Reload the instance cache entries into the Ssa Environment, if memory can
+  // actually grow.
+  void ReloadInstanceCacheIntoSsa(SsaEnv* ssa_env, const WasmModule* module) {
+    if (module->memories.empty()) return;
+    const WasmMemory* memory0 = &module->memories[0];
+    if (memory0->initial_pages == memory0->maximum_pages) return;
+    LoadInstanceCacheIntoSsa(ssa_env);
   }
 
   void StartFunctionBody(FullDecoder* decoder, Control* block) {}
@@ -310,11 +325,12 @@ class WasmGraphBuildingInterface {
         &can_be_innermost);
     if (decoder->failed()) return;
     int instance_cache_index = decoder->num_locals();
-    // If the module has shared memory, the stack guard might reallocate the
-    // shared memory. We have to assume the instance cache will be updated.
-    if (decoder->module_->has_shared_memory) {
-      assigned->Add(instance_cache_index);
-    }
+    // If the cached memory is shared, the stack guard might reallocate the
+    // backing store. We have to assume the instance cache will be updated.
+    bool cached_mem_is_shared =
+        builder_->has_cached_memory() &&
+        decoder->module_->memories[builder_->cached_memory_index()].is_shared;
+    if (cached_mem_is_shared) assigned->Add(instance_cache_index);
     DCHECK_NOT_NULL(assigned);
     decoder->control_at(0)->loop_assignments = assigned;
 
@@ -348,10 +364,9 @@ class WasmGraphBuildingInterface {
     // Now we setup a new environment for the inside of the loop.
     // TODO(choongwoo): Clear locals of the following SsaEnv after use.
     SetEnv(Split(decoder->zone(), ssa_env_));
-    builder_->StackCheck(decoder->module_->has_shared_memory
-                             ? &ssa_env_->instance_cache
-                             : nullptr,
-                         decoder->position());
+    builder_->StackCheck(
+        cached_mem_is_shared ? &ssa_env_->instance_cache : nullptr,
+        decoder->position());
     ssa_env_->SetNotMerged();
 
     // Wrap input merge into phis.
@@ -376,23 +391,15 @@ class WasmGraphBuildingInterface {
   }
 
   void If(FullDecoder* decoder, const Value& cond, Control* if_block) {
-    TFNode* if_true = nullptr;
-    TFNode* if_false = nullptr;
     WasmBranchHint hint = WasmBranchHint::kNoHint;
     if (branch_hints_) {
       hint = branch_hints_->GetHintFor(decoder->pc_relative_offset());
     }
-    switch (hint) {
-      case WasmBranchHint::kNoHint:
-        builder_->BranchNoHint(cond.node, &if_true, &if_false);
-        break;
-      case WasmBranchHint::kUnlikely:
-        builder_->BranchExpectFalse(cond.node, &if_true, &if_false);
-        break;
-      case WasmBranchHint::kLikely:
-        builder_->BranchExpectTrue(cond.node, &if_true, &if_false);
-        break;
-    }
+    auto [if_true, if_false] = hint == WasmBranchHint::kUnlikely
+                                   ? builder_->BranchExpectFalse(cond.node)
+                               : hint == WasmBranchHint::kLikely
+                                   ? builder_->BranchExpectTrue(cond.node)
+                                   : builder_->BranchNoHint(cond.node);
     SsaEnv* merge_env = ssa_env_;
     SsaEnv* false_env = Split(decoder->zone(), ssa_env_);
     false_env->control = if_false;
@@ -627,18 +634,21 @@ class WasmGraphBuildingInterface {
     }
     switch (hint) {
       case WasmBranchHint::kNoHint:
-        builder_->BranchNoHint(cond.node, &tenv->control, &fenv->control);
+        std::tie(tenv->control, fenv->control) =
+            builder_->BranchNoHint(cond.node);
         break;
       case WasmBranchHint::kUnlikely:
-        builder_->BranchExpectFalse(cond.node, &tenv->control, &fenv->control);
+        std::tie(tenv->control, fenv->control) =
+            builder_->BranchExpectFalse(cond.node);
         break;
       case WasmBranchHint::kLikely:
-        builder_->BranchExpectTrue(cond.node, &tenv->control, &fenv->control);
+        std::tie(tenv->control, fenv->control) =
+            builder_->BranchExpectTrue(cond.node);
         break;
     }
     builder_->SetControl(fenv->control);
     ScopedSsaEnv scoped_env(this, tenv);
-    BrOrRet(decoder, depth, 1);
+    BrOrRet(decoder, depth, 0);
   }
 
   void BrTable(FullDecoder* decoder, const BranchTableImmediate& imm,
@@ -646,7 +656,7 @@ class WasmGraphBuildingInterface {
     if (imm.table_count == 0) {
       // Only a default target. Do the equivalent of br.
       uint32_t target = BranchTableIterator<ValidationTag>(decoder, imm).next();
-      BrOrRet(decoder, target, 1);
+      BrOrRet(decoder, target, 0);
       return;
     }
 
@@ -660,7 +670,7 @@ class WasmGraphBuildingInterface {
       ScopedSsaEnv env(this, Split(decoder->zone(), ssa_env_));
       builder_->SetControl(i == imm.table_count ? builder_->IfDefault(sw)
                                                 : builder_->IfValue(i, sw));
-      BrOrRet(decoder, target, 1);
+      BrOrRet(decoder, target, 0);
     }
     DCHECK(decoder->ok());
   }
@@ -676,53 +686,68 @@ class WasmGraphBuildingInterface {
   void LoadMem(FullDecoder* decoder, LoadType type,
                const MemoryAccessImmediate& imm, const Value& index,
                Value* result) {
-    SetAndTypeNode(result, builder_->LoadMem(
-                               type.value_type(), type.mem_type(), index.node,
-                               imm.offset, imm.alignment, decoder->position()));
+    SetAndTypeNode(result,
+                   builder_->LoadMem(imm.memory, type.value_type(),
+                                     type.mem_type(), index.node, imm.offset,
+                                     imm.alignment, decoder->position()));
   }
 
   void LoadTransform(FullDecoder* decoder, LoadType type,
                      LoadTransformationKind transform,
                      const MemoryAccessImmediate& imm, const Value& index,
                      Value* result) {
-    SetAndTypeNode(result,
-                   builder_->LoadTransform(type.value_type(), type.mem_type(),
-                                           transform, index.node, imm.offset,
-                                           imm.alignment, decoder->position()));
+    SetAndTypeNode(result, builder_->LoadTransform(
+                               imm.memory, type.value_type(), type.mem_type(),
+                               transform, index.node, imm.offset, imm.alignment,
+                               decoder->position()));
   }
 
   void LoadLane(FullDecoder* decoder, LoadType type, const Value& value,
                 const Value& index, const MemoryAccessImmediate& imm,
                 const uint8_t laneidx, Value* result) {
-    SetAndTypeNode(
-        result, builder_->LoadLane(
-                    type.value_type(), type.mem_type(), value.node, index.node,
-                    imm.offset, imm.alignment, laneidx, decoder->position()));
+    SetAndTypeNode(result, builder_->LoadLane(
+                               imm.memory, type.value_type(), type.mem_type(),
+                               value.node, index.node, imm.offset,
+                               imm.alignment, laneidx, decoder->position()));
   }
 
   void StoreMem(FullDecoder* decoder, StoreType type,
                 const MemoryAccessImmediate& imm, const Value& index,
                 const Value& value) {
-    builder_->StoreMem(type.mem_rep(), index.node, imm.offset, imm.alignment,
-                       value.node, decoder->position(), type.value_type());
+    builder_->StoreMem(imm.memory, type.mem_rep(), index.node, imm.offset,
+                       imm.alignment, value.node, decoder->position(),
+                       type.value_type());
   }
 
   void StoreLane(FullDecoder* decoder, StoreType type,
                  const MemoryAccessImmediate& imm, const Value& index,
                  const Value& value, const uint8_t laneidx) {
-    builder_->StoreLane(type.mem_rep(), index.node, imm.offset, imm.alignment,
-                        value.node, laneidx, decoder->position(),
+    builder_->StoreLane(imm.memory, type.mem_rep(), index.node, imm.offset,
+                        imm.alignment, value.node, laneidx, decoder->position(),
                         type.value_type());
   }
 
-  void CurrentMemoryPages(FullDecoder* decoder, Value* result) {
-    SetAndTypeNode(result, builder_->CurrentMemoryPages());
+  void CurrentMemoryPages(FullDecoder* decoder, const MemoryIndexImmediate& imm,
+                          Value* result) {
+    SetAndTypeNode(result, builder_->CurrentMemoryPages(imm.memory));
   }
 
-  void MemoryGrow(FullDecoder* decoder, const Value& value, Value* result) {
-    SetAndTypeNode(result, builder_->MemoryGrow(value.node));
+  void MemoryGrow(FullDecoder* decoder, const MemoryIndexImmediate& imm,
+                  const Value& value, Value* result) {
+    SetAndTypeNode(result, builder_->MemoryGrow(imm.memory, value.node));
     // Always reload the instance cache after growing memory.
-    LoadContextIntoSsa(ssa_env_, decoder);
+    ReloadInstanceCacheIntoSsa(ssa_env_, decoder->module_);
+  }
+
+  TFNode* ExternRefToString(FullDecoder* decoder, const Value value,
+                            bool null_succeeds = false) {
+    wasm::ValueType target_type =
+        null_succeeds ? kWasmStringRef : kWasmRefString;
+    WasmTypeCheckConfig config{value.type, target_type};
+    TFNode* string =
+        builder_->RefCastAbstract(value.node, config, decoder->position());
+    TFNode* rename = builder_->TypeGuard(string, target_type);
+    return builder_->SetType(rename, target_type);
   }
 
   bool HandleWellKnownImport(FullDecoder* decoder, uint32_t index,
@@ -738,17 +763,150 @@ class WasmGraphBuildingInterface {
       case WKI::kUninstantiated:
       case WKI::kGeneric:
         return false;
+
+      // WebAssembly.String.* imports.
+      case WKI::kStringCharCodeAt: {
+        TFNode* string = ExternRefToString(decoder, args[0]);
+        TFNode* view = builder_->StringAsWtf16(
+            string, compiler::kWithoutNullCheck, decoder->position());
+        builder_->SetType(view, kWasmRefString);
+        result = builder_->StringViewWtf16GetCodeUnit(
+            view, compiler::kWithoutNullCheck, args[1].node,
+            decoder->position());
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      }
+      case WKI::kStringCodePointAt: {
+        TFNode* string = ExternRefToString(decoder, args[0]);
+        TFNode* view = builder_->StringAsWtf16(
+            string, compiler::kWithoutNullCheck, decoder->position());
+        builder_->SetType(view, kWasmRefString);
+        result = builder_->StringCodePointAt(view, compiler::kWithoutNullCheck,
+                                             args[1].node, decoder->position());
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      }
+      case WKI::kStringCompare: {
+        TFNode* a_string = ExternRefToString(decoder, args[0]);
+        TFNode* b_string = ExternRefToString(decoder, args[1]);
+        result = builder_->StringCompare(a_string, compiler::kWithoutNullCheck,
+                                         b_string, compiler::kWithoutNullCheck,
+                                         decoder->position());
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      }
+      case WKI::kStringConcat: {
+        TFNode* head_string = ExternRefToString(decoder, args[0]);
+        TFNode* tail_string = ExternRefToString(decoder, args[1]);
+        result = builder_->StringConcat(
+            head_string, compiler::kWithoutNullCheck, tail_string,
+            compiler::kWithoutNullCheck, decoder->position());
+        builder_->SetType(result, kWasmRefString);
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      }
+      case WKI::kStringEquals: {
+        // Using nullable type guards here because this instruction needs to
+        // handle {null} without trapping.
+        static constexpr bool kNullSucceeds = true;
+        TFNode* a_string = ExternRefToString(decoder, args[0], kNullSucceeds);
+        TFNode* b_string = ExternRefToString(decoder, args[1], kNullSucceeds);
+        result = builder_->StringEqual(a_string, args[0].type, b_string,
+                                       args[1].type, decoder->position());
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      }
+      case WKI::kStringFromCharCode:
+        result = builder_->StringFromCharCode(args[0].node);
+        builder_->SetType(result, kWasmRefString);
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      case WKI::kStringFromCodePoint:
+        result = builder_->StringFromCodePoint(args[0].node);
+        builder_->SetType(result, kWasmRefString);
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      case WKI::kStringFromWtf16Array:
+        result = builder_->StringNewWtf16Array(
+            args[0].node, NullCheckFor(args[0].type), args[1].node,
+            args[2].node, decoder->position());
+        builder_->SetType(result, kWasmRefString);
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      case WKI::kStringFromWtf8Array:
+        result = builder_->StringNewWtf8Array(
+            unibrow::Utf8Variant::kWtf8, args[0].node,
+            NullCheckFor(args[0].type), args[1].node, args[2].node,
+            decoder->position());
+        builder_->SetType(result, kWasmRefString);
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      case WKI::kStringLength: {
+        TFNode* string = ExternRefToString(decoder, args[0]);
+        result = builder_->StringMeasureWtf16(
+            string, compiler::kWithoutNullCheck, decoder->position());
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      }
+      case WKI::kStringSubstring: {
+        TFNode* string = ExternRefToString(decoder, args[0]);
+        TFNode* view = builder_->StringAsWtf16(
+            string, compiler::kWithoutNullCheck, decoder->position());
+        builder_->SetType(view, kWasmRefString);
+        result = builder_->StringViewWtf16Slice(
+            view, compiler::kWithoutNullCheck, args[1].node, args[2].node,
+            decoder->position());
+        builder_->SetType(result, kWasmRefString);
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      }
+      case WKI::kStringToWtf16Array: {
+        TFNode* string = ExternRefToString(decoder, args[0]);
+        result = builder_->StringEncodeWtf16Array(
+            string, compiler::kWithoutNullCheck, args[1].node,
+            NullCheckFor(args[1].type), args[2].node, decoder->position());
+        decoder->detected_->Add(kFeature_imported_strings);
+        break;
+      }
+
+      // Other string-related imports.
+      case WKI::kDoubleToString:
+        result = builder_->WellKnown_DoubleToString(args[0].node);
+        break;
+      case WKI::kIntToString:
+        result = builder_->WellKnown_IntToString(args[0].node, args[1].node);
+        break;
+      case WKI::kParseFloat:
+        result = builder_->WellKnown_ParseFloat(args[0].node,
+                                                NullCheckFor(args[0].type));
+        decoder->detected_->Add(kFeature_stringref);
+        break;
+      case WKI::kStringIndexOf:
+        result = builder_->WellKnown_StringIndexOf(
+            args[0].node, args[1].node, args[2].node,
+            NullCheckFor(args[0].type), NullCheckFor(args[1].type));
+        decoder->detected_->Add(kFeature_stringref);
+        break;
+      case WKI::kStringToLocaleLowerCaseStringref:
+        // Temporarily ignored because of bugs (v8:13977, v8:13985).
+        // TODO(jkummerow): Fix and re-enable.
+        return false;
+        // result = builder_->WellKnown_StringToLocaleLowerCaseStringref(
+        //     args[0].node, args[1].node, NullCheckFor(args[0].type));
+        // decoder->detected_->Add(kFeature_stringref);
+        // break;
       case WKI::kStringToLowerCaseStringref:
         result = builder_->WellKnown_StringToLowerCaseStringref(
             args[0].node, NullCheckFor(args[0].type));
+        decoder->detected_->Add(kFeature_stringref);
         break;
     }
-    assumptions_->RecordAssumption(index, import);
-    SetAndTypeNode(&returns[0], result);
     if (v8_flags.trace_wasm_inlining) {
-      PrintF("[function %d: import %d is well-known built-in %s]\n",
-             func_index_, index, WellKnownImportName(import));
+      PrintF("[function %d: call to %d is well-known %s]\n", func_index_, index,
+             WellKnownImportName(import));
     }
+    assumptions_->RecordAssumption(index, import);
+    SetAndTypeNode(&returns[0], result);
     return true;
   }
 
@@ -762,6 +920,7 @@ class WasmGraphBuildingInterface {
     }
     // This must happen after the {next_call_feedback()} call.
     if (HandleWellKnownImport(decoder, imm.index, args, returns)) return;
+
     DoCall(decoder, CallInfo::CallDirect(imm.index, maybe_call_count), imm.sig,
            args, returns);
   }
@@ -821,8 +980,8 @@ class WasmGraphBuildingInterface {
     for (int i = 0; i < num_cases; i++) {
       const uint32_t expected_function_index = feedback->function_index(i);
 
-      if (v8_flags.trace_wasm_speculative_inlining) {
-        PrintF("[Function #%d call #%d: graph support for inlining #%d]\n",
+      if (v8_flags.trace_wasm_inlining) {
+        PrintF("[function %d: call #%d: graph support for inlining #%d]\n",
                func_index_, feedback_instruction_index_ - 1,
                expected_function_index);
       }
@@ -837,7 +996,7 @@ class WasmGraphBuildingInterface {
       builder_->SetControl(success_control);
       ssa_env_->control = success_control;
       Value* returns_direct =
-          decoder->zone()->NewArray<Value>(sig->return_count());
+          decoder->zone()->AllocateArray<Value>(sig->return_count());
       for (size_t i = 0; i < sig->return_count(); i++) {
         returns_direct[i].type = returns[i].type;
       }
@@ -853,7 +1012,8 @@ class WasmGraphBuildingInterface {
       ssa_env_->effect = initial_effect;
       ssa_env_->control = failure_control;
     }
-    Value* returns_ref = decoder->zone()->NewArray<Value>(sig->return_count());
+    Value* returns_ref =
+        decoder->zone()->AllocateArray<Value>(sig->return_count());
     for (size_t i = 0; i < sig->return_count(); i++) {
       returns_ref[i].type = returns[i].type;
     }
@@ -872,13 +1032,9 @@ class WasmGraphBuildingInterface {
     builder_->SetEffectControl(effect, control);
 
     // Each of the {DoCall} helpers above has created a reload of the instance
-    // cache nodes. Rather than merging all of them into a Phi here, just
+    // cache nodes. Rather than merging all of them into a Phi, just
     // let them get DCE'ed and perform a single reload after the merge.
-    if (decoder->module_->initial_pages != decoder->module_->maximum_pages) {
-      // The invoked function could have used grow_memory, so we need to
-      // reload mem_size and mem_start.
-      LoadContextIntoSsa(ssa_env_, decoder);
-    }
+    ReloadInstanceCacheIntoSsa(ssa_env_, decoder->module_);
 
     for (uint32_t i = 0; i < sig->return_count(); i++) {
       std::vector<TFNode*> phi_args;
@@ -913,8 +1069,8 @@ class WasmGraphBuildingInterface {
     for (int i = 0; i < num_cases; i++) {
       const uint32_t expected_function_index = feedback->function_index(i);
 
-      if (v8_flags.trace_wasm_speculative_inlining) {
-        PrintF("[Function #%d call #%d: graph support for inlining #%d]\n",
+      if (v8_flags.trace_wasm_inlining) {
+        PrintF("[function %d: call #%d: graph support for inlining #%d]\n",
                func_index_, feedback_instruction_index_ - 1,
                expected_function_index);
       }
@@ -948,8 +1104,8 @@ class WasmGraphBuildingInterface {
     SsaEnv* false_env = ssa_env_;
     SsaEnv* true_env = Split(decoder->zone(), false_env);
     false_env->SetNotMerged();
-    builder_->BrOnNull(ref_object.node, ref_object.type, &true_env->control,
-                       &false_env->control);
+    std::tie(true_env->control, false_env->control) =
+        builder_->BrOnNull(ref_object.node, ref_object.type);
     builder_->SetControl(false_env->control);
     {
       ScopedSsaEnv scoped_env(this, true_env);
@@ -967,24 +1123,25 @@ class WasmGraphBuildingInterface {
     SsaEnv* false_env = ssa_env_;
     SsaEnv* true_env = Split(decoder->zone(), false_env);
     false_env->SetNotMerged();
-    builder_->BrOnNull(ref_object.node, ref_object.type, &false_env->control,
-                       &true_env->control);
+    std::tie(false_env->control, true_env->control) =
+        builder_->BrOnNull(ref_object.node, ref_object.type);
     builder_->SetControl(false_env->control);
     ScopedSsaEnv scoped_env(this, true_env);
     BrOrRet(decoder, depth, 0);
   }
 
-  void SimdOp(FullDecoder* decoder, WasmOpcode opcode, base::Vector<Value> args,
+  void SimdOp(FullDecoder* decoder, WasmOpcode opcode, const Value* args,
               Value* result) {
-    NodeVector inputs(args.size());
-    GetNodes(inputs.begin(), args);
+    size_t num_inputs = WasmOpcodes::Signature(opcode)->parameter_count();
+    NodeVector inputs(num_inputs);
+    GetNodes(inputs.begin(), args, num_inputs);
     TFNode* node = builder_->SimdOp(opcode, inputs.begin());
     if (result) SetAndTypeNode(result, node);
   }
 
   void SimdLaneOp(FullDecoder* decoder, WasmOpcode opcode,
-                  const SimdLaneImmediate& imm, base::Vector<Value> inputs,
-                  Value* result) {
+                  const SimdLaneImmediate& imm,
+                  base::Vector<const Value> inputs, Value* result) {
     NodeVector nodes(inputs.size());
     GetNodes(nodes.begin(), inputs);
     SetAndTypeNode(result,
@@ -999,16 +1156,14 @@ class WasmGraphBuildingInterface {
   }
 
   void Throw(FullDecoder* decoder, const TagIndexImmediate& imm,
-             const base::Vector<Value>& value_args) {
-    int count = value_args.length();
-    ZoneVector<TFNode*> args(count, decoder->zone());
-    for (int i = 0; i < count; ++i) {
-      args[i] = value_args[i].node;
-    }
+             const Value arg_values[]) {
+    int count = static_cast<int>(imm.tag->sig->parameter_count());
+    NodeVector args(count);
+    GetNodes(args.data(), base::VectorOf(arg_values, count));
     CheckForException(decoder,
                       builder_->Throw(imm.index, imm.tag, base::VectorOf(args),
                                       decoder->position()),
-                      kDontReloadContext);
+                      false);
     builder_->TerminateThrow(effect(), control());
   }
 
@@ -1016,11 +1171,31 @@ class WasmGraphBuildingInterface {
     DCHECK(block->is_try_catchall() || block->is_try_catch());
     TFNode* exception = block->try_info->exception;
     DCHECK_NOT_NULL(exception);
-    CheckForException(decoder, builder_->Rethrow(exception),
-                      kDontReloadContext);
+    CheckForException(decoder, builder_->Rethrow(exception), false);
     builder_->TerminateThrow(effect(), control());
   }
 
+  void CatchAndUnpackWasmException(FullDecoder* decoder, Control* block,
+                                   TFNode* exception, const WasmTag* tag,
+                                   TFNode* caught_tag, TFNode* exception_tag,
+                                   base::Vector<Value> values) {
+    TFNode* compare = builder_->ExceptionTagEqual(caught_tag, exception_tag);
+    auto [if_catch, if_no_catch] = builder_->BranchNoHint(compare);
+    // If the tags don't match we continue with the next tag by setting the
+    // false environment as the new {TryInfo::catch_env} here.
+    block->try_info->catch_env = Split(decoder->zone(), ssa_env_);
+    block->try_info->catch_env->control = if_no_catch;
+    block->block_env = Steal(decoder->zone(), ssa_env_);
+    block->block_env->control = if_catch;
+    SetEnv(block->block_env);
+    NodeVector caught_values(values.size());
+    base::Vector<TFNode*> caught_vector = base::VectorOf(caught_values);
+    builder_->GetExceptionValues(exception, tag, caught_vector);
+    for (size_t i = 0, e = values.size(); i < e; ++i) {
+      SetAndTypeNode(&values[i], caught_values[i]);
+    }
+  }
+
   void CatchException(FullDecoder* decoder, const TagIndexImmediate& imm,
                       Control* block, base::Vector<Value> values) {
     DCHECK(block->is_try_catch());
@@ -1035,32 +1210,56 @@ class WasmGraphBuildingInterface {
     TFNode* exception = block->try_info->exception;
     SetEnv(block->try_info->catch_env);
 
-    TFNode* if_catch = nullptr;
-    TFNode* if_no_catch = nullptr;
-
-    // Get the exception tag and see if it matches the expected one.
     TFNode* caught_tag = builder_->GetExceptionTag(exception);
-    TFNode* exception_tag = builder_->LoadTagFromTable(imm.index);
-    TFNode* compare = builder_->ExceptionTagEqual(caught_tag, exception_tag);
-    builder_->BranchNoHint(compare, &if_catch, &if_no_catch);
-
-    // If the tags don't match we continue with the next tag by setting the
-    // false environment as the new {TryInfo::catch_env} here.
-    SsaEnv* if_no_catch_env = Split(decoder->zone(), ssa_env_);
-    if_no_catch_env->control = if_no_catch;
-    SsaEnv* if_catch_env = Steal(decoder->zone(), ssa_env_);
-    if_catch_env->control = if_catch;
-    block->try_info->catch_env = if_no_catch_env;
-    block->block_env = if_catch_env;
-
-    // If the tags match we extract the values from the exception object and
-    // push them onto the operand stack using the passed {values} vector.
-    SetEnv(if_catch_env);
-    NodeVector caught_values(values.size());
-    base::Vector<TFNode*> caught_vector = base::VectorOf(caught_values);
-    builder_->GetExceptionValues(exception, imm.tag, caught_vector);
-    for (size_t i = 0, e = values.size(); i < e; ++i) {
-      SetAndTypeNode(&values[i], caught_values[i]);
+    TFNode* expected_tag = builder_->LoadTagFromTable(imm.index);
+
+    if (imm.tag->sig->parameter_count() == 1 &&
+        imm.tag->sig->GetParam(0).is_reference_to(HeapType::kExtern)) {
+      // Check for the special case where the tag is WebAssembly.JSTag and the
+      // exception is not a WebAssembly.Exception. In this case the exception is
+      // caught and pushed on the operand stack.
+      // Only perform this check if the tag signature is the same as
+      // the JSTag signature, i.e. a single externref or (ref extern), otherwise
+      // we know statically that it cannot be the JSTag.
+
+      TFNode* is_js_exn = builder_->IsExceptionTagUndefined(caught_tag);
+      auto [exn_is_js, exn_is_wasm] = builder_->BranchExpectFalse(is_js_exn);
+      SsaEnv* exn_is_js_env = Split(decoder->zone(), ssa_env_);
+      exn_is_js_env->control = exn_is_js;
+      SsaEnv* exn_is_wasm_env = Steal(decoder->zone(), ssa_env_);
+      exn_is_wasm_env->control = exn_is_wasm;
+
+      // Case 1: A wasm exception.
+      SetEnv(exn_is_wasm_env);
+      CatchAndUnpackWasmException(decoder, block, exception, imm.tag,
+                                  caught_tag, expected_tag, values);
+
+      // Case 2: A JS exception.
+      SetEnv(exn_is_js_env);
+      TFNode* js_tag = builder_->LoadJSTag();
+      TFNode* compare = builder_->ExceptionTagEqual(expected_tag, js_tag);
+      auto [if_catch, if_no_catch] = builder_->BranchNoHint(compare);
+      // Merge the wasm no-catch and JS no-catch paths.
+      SsaEnv* if_no_catch_env = Split(decoder->zone(), ssa_env_);
+      if_no_catch_env->control = if_no_catch;
+      SetEnv(if_no_catch_env);
+      Goto(decoder, block->try_info->catch_env);
+      // Merge the wasm catch and JS catch paths.
+      SsaEnv* if_catch_env = Steal(decoder->zone(), ssa_env_);
+      if_catch_env->control = if_catch;
+      SetEnv(if_catch_env);
+      Goto(decoder, block->block_env);
+
+      // The final env is a merge of case 1 and 2. The unpacked value is a Phi
+      // of the unpacked value (case 1) and the exception itself (case 2).
+      SetEnv(block->block_env);
+      TFNode* phi_inputs[] = {values[0].node, exception,
+                              block->block_env->control};
+      TFNode* ref = builder_->Phi(wasm::kWasmExternRef, 2, phi_inputs);
+      SetAndTypeNode(&values[0], ref);
+    } else {
+      CatchAndUnpackWasmException(decoder, block, exception, imm.tag,
+                                  caught_tag, expected_tag, values);
     }
   }
 
@@ -1114,13 +1313,14 @@ class WasmGraphBuildingInterface {
     SetEnv(block->try_info->catch_env);
   }
 
-  void AtomicOp(FullDecoder* decoder, WasmOpcode opcode,
-                base::Vector<Value> args, const MemoryAccessImmediate& imm,
+  void AtomicOp(FullDecoder* decoder, WasmOpcode opcode, const Value args[],
+                const size_t argc, const MemoryAccessImmediate& imm,
                 Value* result) {
-    NodeVector inputs(args.size());
-    GetNodes(inputs.begin(), args);
-    TFNode* node = builder_->AtomicOp(opcode, inputs.begin(), imm.alignment,
-                                      imm.offset, decoder->position());
+    NodeVector inputs(argc);
+    GetNodes(inputs.begin(), args, argc);
+    TFNode* node =
+        builder_->AtomicOp(imm.memory, opcode, inputs.begin(), imm.alignment,
+                           imm.offset, decoder->position());
     if (result) SetAndTypeNode(result, node);
   }
 
@@ -1128,8 +1328,8 @@ class WasmGraphBuildingInterface {
 
   void MemoryInit(FullDecoder* decoder, const MemoryInitImmediate& imm,
                   const Value& dst, const Value& src, const Value& size) {
-    builder_->MemoryInit(imm.data_segment.index, dst.node, src.node, size.node,
-                         decoder->position());
+    builder_->MemoryInit(imm.memory.memory, imm.data_segment.index, dst.node,
+                         src.node, size.node, decoder->position());
   }
 
   void DataDrop(FullDecoder* decoder, const IndexImmediate& imm) {
@@ -1138,16 +1338,18 @@ class WasmGraphBuildingInterface {
 
   void MemoryCopy(FullDecoder* decoder, const MemoryCopyImmediate& imm,
                   const Value& dst, const Value& src, const Value& size) {
-    builder_->MemoryCopy(dst.node, src.node, size.node, decoder->position());
+    builder_->MemoryCopy(imm.memory_dst.memory, imm.memory_src.memory, dst.node,
+                         src.node, size.node, decoder->position());
   }
 
   void MemoryFill(FullDecoder* decoder, const MemoryIndexImmediate& imm,
                   const Value& dst, const Value& value, const Value& size) {
-    builder_->MemoryFill(dst.node, value.node, size.node, decoder->position());
+    builder_->MemoryFill(imm.memory, dst.node, value.node, size.node,
+                         decoder->position());
   }
 
   void TableInit(FullDecoder* decoder, const TableInitImmediate& imm,
-                 base::Vector<Value> args) {
+                 const Value* args) {
     builder_->TableInit(imm.table.index, imm.element_segment.index,
                         args[0].node, args[1].node, args[2].node,
                         decoder->position());
@@ -1158,7 +1360,7 @@ class WasmGraphBuildingInterface {
   }
 
   void TableCopy(FullDecoder* decoder, const TableCopyImmediate& imm,
-                 base::Vector<Value> args) {
+                 const Value args[]) {
     builder_->TableCopy(imm.table_dst.index, imm.table_src.index, args[0].node,
                         args[1].node, args[2].node, decoder->position());
   }
@@ -1180,18 +1382,19 @@ class WasmGraphBuildingInterface {
   }
 
   void StructNew(FullDecoder* decoder, const StructIndexImmediate& imm,
-                 const Value& rtt, const Value args[], Value* result) {
+                 const Value args[], Value* result) {
+    TFNode* rtt = builder_->RttCanon(imm.index);
     uint32_t field_count = imm.struct_type->field_count();
     NodeVector arg_nodes(field_count);
     for (uint32_t i = 0; i < field_count; i++) {
       arg_nodes[i] = args[i].node;
     }
-    SetAndTypeNode(result,
-                   builder_->StructNew(imm.index, imm.struct_type, rtt.node,
-                                       base::VectorOf(arg_nodes)));
+    SetAndTypeNode(result, builder_->StructNew(imm.index, imm.struct_type, rtt,
+                                               base::VectorOf(arg_nodes)));
   }
   void StructNewDefault(FullDecoder* decoder, const StructIndexImmediate& imm,
-                        const Value& rtt, Value* result) {
+                        Value* result) {
+    TFNode* rtt = builder_->RttCanon(imm.index);
     uint32_t field_count = imm.struct_type->field_count();
     NodeVector arg_nodes(field_count);
     for (uint32_t i = 0; i < field_count; i++) {
@@ -1199,9 +1402,8 @@ class WasmGraphBuildingInterface {
       arg_nodes[i] = builder_->SetType(builder_->DefaultValue(field_type),
                                        field_type.Unpacked());
     }
-    SetAndTypeNode(result,
-                   builder_->StructNew(imm.index, imm.struct_type, rtt.node,
-                                       base::VectorOf(arg_nodes)));
+    SetAndTypeNode(result, builder_->StructNew(imm.index, imm.struct_type, rtt,
+                                               base::VectorOf(arg_nodes)));
   }
 
   void StructGet(FullDecoder* decoder, const Value& struct_object,
@@ -1222,22 +1424,24 @@ class WasmGraphBuildingInterface {
 
   void ArrayNew(FullDecoder* decoder, const ArrayIndexImmediate& imm,
                 const Value& length, const Value& initial_value,
-                const Value& rtt, Value* result) {
+                Value* result) {
+    TFNode* rtt = builder_->RttCanon(imm.index);
     SetAndTypeNode(result, builder_->ArrayNew(imm.index, imm.array_type,
                                               length.node, initial_value.node,
-                                              rtt.node, decoder->position()));
+                                              rtt, decoder->position()));
     // array.new(_default) introduces a loop. Therefore, we have to mark the
     // immediately nesting loop (if any) as non-innermost.
     if (!loop_infos_.empty()) loop_infos_.back().can_be_innermost = false;
   }
 
   void ArrayNewDefault(FullDecoder* decoder, const ArrayIndexImmediate& imm,
-                       const Value& length, const Value& rtt, Value* result) {
+                       const Value& length, Value* result) {
+    TFNode* rtt = builder_->RttCanon(imm.index);
     // This will be set in {builder_}.
     TFNode* initial_value = nullptr;
-    SetAndTypeNode(result, builder_->ArrayNew(imm.index, imm.array_type,
-                                              length.node, initial_value,
-                                              rtt.node, decoder->position()));
+    SetAndTypeNode(result,
+                   builder_->ArrayNew(imm.index, imm.array_type, length.node,
+                                      initial_value, rtt, decoder->position()));
     // array.new(_default) introduces a loop. Therefore, we have to mark the
     // immediately nesting loop (if any) as non-innermost.
     if (!loop_infos_.empty()) loop_infos_.back().can_be_innermost = false;
@@ -1267,12 +1471,10 @@ class WasmGraphBuildingInterface {
 
   void ArrayCopy(FullDecoder* decoder, const Value& dst, const Value& dst_index,
                  const Value& src, const Value& src_index,
-                 const Value& length) {
-    builder_->ArrayCopy(
-        dst.node, dst_index.node, NullCheckFor(dst.type), src.node,
-        src_index.node, NullCheckFor(src.type), length.node,
-        decoder->module_->types[src.type.ref_index()].array_type,
-        decoder->position());
+                 const ArrayIndexImmediate& src_imm, const Value& length) {
+    builder_->ArrayCopy(dst.node, dst_index.node, NullCheckFor(dst.type),
+                        src.node, src_index.node, NullCheckFor(src.type),
+                        length.node, src_imm.array_type, decoder->position());
   }
 
   void ArrayFill(FullDecoder* decoder, ArrayIndexImmediate& imm,
@@ -1286,25 +1488,37 @@ class WasmGraphBuildingInterface {
     if (!loop_infos_.empty()) loop_infos_.back().can_be_innermost = false;
   }
 
-  void ArrayNewFixed(FullDecoder* decoder, const ArrayIndexImmediate& imm,
-                     const base::Vector<Value>& elements, const Value& rtt,
+  void ArrayNewFixed(FullDecoder* decoder, const ArrayIndexImmediate& array_imm,
+                     const IndexImmediate& length_imm, const Value elements[],
                      Value* result) {
-    NodeVector element_nodes(elements.size());
-    for (uint32_t i = 0; i < elements.size(); i++) {
-      element_nodes[i] = elements[i].node;
-    }
-    SetAndTypeNode(result, builder_->ArrayNewFixed(imm.array_type, rtt.node,
+    TFNode* rtt = builder_->RttCanon(array_imm.index);
+    NodeVector element_nodes(length_imm.index);
+    GetNodes(element_nodes.data(), elements, length_imm.index);
+    SetAndTypeNode(result, builder_->ArrayNewFixed(array_imm.array_type, rtt,
                                                    VectorOf(element_nodes)));
   }
 
   void ArrayNewSegment(FullDecoder* decoder,
                        const ArrayIndexImmediate& array_imm,
-                       const IndexImmediate& data_segment, const Value& offset,
-                       const Value& length, const Value& rtt, Value* result) {
+                       const IndexImmediate& segment_imm, const Value& offset,
+                       const Value& length, Value* result) {
+    TFNode* rtt = builder_->RttCanon(array_imm.index);
     SetAndTypeNode(result,
                    builder_->ArrayNewSegment(
-                       array_imm.array_type, data_segment.index, offset.node,
-                       length.node, rtt.node, decoder->position()));
+                       segment_imm.index, offset.node, length.node, rtt,
+                       array_imm.array_type->element_type().is_reference(),
+                       decoder->position()));
+  }
+
+  void ArrayInitSegment(FullDecoder* decoder,
+                        const ArrayIndexImmediate& array_imm,
+                        const IndexImmediate& segment_imm, const Value& array,
+                        const Value& array_index, const Value& segment_offset,
+                        const Value& length) {
+    builder_->ArrayInitSegment(
+        segment_imm.index, array.node, array_index.node, segment_offset.node,
+        length.node, array_imm.array_type->element_type().is_reference(),
+        decoder->position());
   }
 
   void I31New(FullDecoder* decoder, const Value& input, Value* result) {
@@ -1323,74 +1537,81 @@ class WasmGraphBuildingInterface {
                                      decoder->position()));
   }
 
-  void RttCanon(FullDecoder* decoder, uint32_t type_index, Value* result) {
-    SetAndTypeNode(result, builder_->RttCanon(type_index));
-  }
-
   using WasmTypeCheckConfig = v8::internal::compiler::WasmTypeCheckConfig;
 
-  void RefTest(FullDecoder* decoder, const Value& object, const Value& rtt,
+  void RefTest(FullDecoder* decoder, uint32_t ref_index, const Value& object,
                Value* result, bool null_succeeds) {
-    WasmTypeCheckConfig config = {
-        object.type,
-        ValueType::RefMaybeNull(rtt.type.ref_index(),
-                                null_succeeds ? kNullable : kNonNullable)};
-    SetAndTypeNode(result, builder_->RefTest(object.node, rtt.node, config));
+    TFNode* rtt = builder_->RttCanon(ref_index);
+    WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         ref_index, null_succeeds ? kNullable : kNonNullable)};
+    SetAndTypeNode(result, builder_->RefTest(object.node, rtt, config));
   }
 
   void RefTestAbstract(FullDecoder* decoder, const Value& object,
                        wasm::HeapType type, Value* result, bool null_succeeds) {
-    bool is_nullable = object.type.is_nullable();
-    SetAndTypeNode(result, builder_->RefTestAbstract(
-                               object.node, type, is_nullable, null_succeeds));
+    WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         type, null_succeeds ? kNullable : kNonNullable)};
+    SetAndTypeNode(result, builder_->RefTestAbstract(object.node, config));
   }
 
-  void RefCast(FullDecoder* decoder, const Value& object, const Value& rtt,
+  void RefCast(FullDecoder* decoder, uint32_t ref_index, const Value& object,
                Value* result, bool null_succeeds) {
-    WasmTypeCheckConfig config = {
-        object.type,
-        ValueType::RefMaybeNull(rtt.type.ref_index(),
-                                null_succeeds ? kNullable : kNonNullable)};
-    TFNode* cast_node = v8_flags.experimental_wasm_assume_ref_cast_succeeds
-                            ? builder_->TypeGuard(object.node, result->type)
-                            : builder_->RefCast(object.node, rtt.node, config,
-                                                decoder->position());
-    SetAndTypeNode(result, cast_node);
+    TFNode* node = object.node;
+    if (v8_flags.experimental_wasm_assume_ref_cast_succeeds) {
+      node = builder_->TypeGuard(node, result->type);
+    } else {
+      TFNode* rtt = builder_->RttCanon(ref_index);
+      WasmTypeCheckConfig config{object.type, result->type};
+      node = builder_->RefCast(object.node, rtt, config, decoder->position());
+    }
+    SetAndTypeNode(result, node);
   }
 
+  // TODO(jkummerow): {type} is redundant.
   void RefCastAbstract(FullDecoder* decoder, const Value& object,
                        wasm::HeapType type, Value* result, bool null_succeeds) {
     TFNode* node = object.node;
-    if (!v8_flags.experimental_wasm_assume_ref_cast_succeeds) {
-      bool is_nullable = object.type.is_nullable();
-      node = builder_->RefCastAbstract(object.node, type, decoder->position(),
-                                       is_nullable, null_succeeds);
+    if (v8_flags.experimental_wasm_assume_ref_cast_succeeds) {
+      node = builder_->TypeGuard(node, result->type);
+    } else {
+      WasmTypeCheckConfig config{object.type, result->type};
+      node =
+          builder_->RefCastAbstract(object.node, config, decoder->position());
     }
-    SetAndTypeNode(result, builder_->TypeGuard(node, result->type));
+    SetAndTypeNode(result, node);
   }
 
-  template <void (compiler::WasmGraphBuilder::*branch_function)(
-      TFNode*, TFNode*, WasmTypeCheckConfig, TFNode**, TFNode**, TFNode**,
-      TFNode**)>
-  void BrOnCastAbs(FullDecoder* decoder, const Value& object, const Value& rtt,
+  template <compiler::WasmGraphBuilder::ResultNodesOfBr (
+      compiler::WasmGraphBuilder::*branch_function)(TFNode*, TFNode*,
+                                                    WasmTypeCheckConfig)>
+  void BrOnCastAbs(FullDecoder* decoder, HeapType type, const Value& object,
                    Value* forwarding_value, uint32_t br_depth,
                    bool branch_on_match, bool null_succeeds) {
+    TFNode* rtt =
+        type.is_bottom() ? nullptr : builder_->RttCanon(type.ref_index());
     // If the type is bottom (used for abstract types), set HeapType to None.
     // The heap type is not read but the null information is needed for the
     // cast.
     ValueType to_type = ValueType::RefMaybeNull(
-        !rtt.type.is_bottom() ? rtt.type.ref_index() : HeapType::kNone,
+        type.is_bottom() ? HeapType::kNone : type.ref_index(),
         null_succeeds ? kNullable : kNonNullable);
-    WasmTypeCheckConfig config = {object.type, to_type};
+    WasmTypeCheckConfig config{object.type, to_type};
     SsaEnv* branch_env = Split(decoder->zone(), ssa_env_);
     // TODO(choongwoo): Clear locals of `no_branch_env` after use.
     SsaEnv* no_branch_env = Steal(decoder->zone(), ssa_env_);
     no_branch_env->SetNotMerged();
+    auto nodes_after_br =
+        (builder_->*branch_function)(object.node, rtt, config);
+
     SsaEnv* match_env = branch_on_match ? branch_env : no_branch_env;
     SsaEnv* no_match_env = branch_on_match ? no_branch_env : branch_env;
-    (builder_->*branch_function)(object.node, rtt.node, config,
-                                 &match_env->control, &match_env->effect,
-                                 &no_match_env->control, &no_match_env->effect);
+    match_env->control = nodes_after_br.control_on_match;
+    match_env->effect = nodes_after_br.effect_on_match;
+    no_match_env->control = nodes_after_br.control_on_no_match;
+    no_match_env->effect = nodes_after_br.effect_on_no_match;
+
     builder_->SetControl(no_branch_env->control);
 
     if (branch_on_match) {
@@ -1419,18 +1640,19 @@ class WasmGraphBuildingInterface {
     }
   }
 
-  void BrOnCast(FullDecoder* decoder, const Value& object, const Value& rtt,
+  void BrOnCast(FullDecoder* decoder, uint32_t ref_index, const Value& object,
                 Value* value_on_branch, uint32_t br_depth, bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnCast>(
-        decoder, object, rtt, value_on_branch, br_depth, true, null_succeeds);
+        decoder, HeapType{ref_index}, object, value_on_branch, br_depth, true,
+        null_succeeds);
   }
 
-  void BrOnCastFail(FullDecoder* decoder, const Value& object, const Value& rtt,
-                    Value* value_on_fallthrough, uint32_t br_depth,
-                    bool null_succeeds) {
+  void BrOnCastFail(FullDecoder* decoder, uint32_t ref_index,
+                    const Value& object, Value* value_on_fallthrough,
+                    uint32_t br_depth, bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnCast>(
-        decoder, object, rtt, value_on_fallthrough, br_depth, false,
-        null_succeeds);
+        decoder, HeapType{ref_index}, object, value_on_fallthrough, br_depth,
+        false, null_succeeds);
   }
 
   void BrOnCastAbstract(FullDecoder* decoder, const Value& object,
@@ -1449,13 +1671,16 @@ class WasmGraphBuildingInterface {
       case HeapType::kArray:
         return BrOnArray(decoder, object, value_on_branch, br_depth,
                          null_succeeds);
+      case HeapType::kString:
+        return BrOnString(decoder, object, value_on_branch, br_depth,
+                          null_succeeds);
       case HeapType::kNone:
       case HeapType::kNoExtern:
       case HeapType::kNoFunc:
         DCHECK(null_succeeds);
         // This is needed for BrOnNull. {value_on_branch} is on the value stack
         // and BrOnNull interacts with the values on the stack.
-        // TODO(7748): The compiler shouldn't have to access the stack used by
+        // TODO(14034): The compiler shouldn't have to access the stack used by
         // the decoder ideally.
         SetAndTypeNode(value_on_branch,
                        builder_->TypeGuard(object.node, value_on_branch->type));
@@ -1484,13 +1709,16 @@ class WasmGraphBuildingInterface {
       case HeapType::kArray:
         return BrOnNonArray(decoder, object, value_on_fallthrough, br_depth,
                             null_succeeds);
+      case HeapType::kString:
+        return BrOnNonString(decoder, object, value_on_fallthrough, br_depth,
+                             null_succeeds);
       case HeapType::kNone:
       case HeapType::kNoExtern:
       case HeapType::kNoFunc:
         DCHECK(null_succeeds);
         // We need to store a node in the stack where the decoder so far only
         // pushed a value and expects the `BrOnCastFailAbstract` to set it.
-        // TODO(7748): The compiler shouldn't have to access the stack used by
+        // TODO(14034): The compiler shouldn't have to access the stack used by
         // the decoder ideally.
         Forward(decoder, object, decoder->stack_value(1));
         return BrOnNonNull(decoder, object, value_on_fallthrough, br_depth,
@@ -1503,43 +1731,33 @@ class WasmGraphBuildingInterface {
     }
   }
 
-  void RefIsEq(FullDecoder* decoder, const Value& object, Value* result) {
-    bool null_succeeds = false;
-    SetAndTypeNode(result,
-                   builder_->RefIsEq(object.node, object.type.is_nullable(),
-                                     null_succeeds));
-  }
-
   void BrOnEq(FullDecoder* decoder, const Value& object, Value* value_on_branch,
               uint32_t br_depth, bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnEq>(
-        decoder, object, Value{nullptr, kWasmBottom}, value_on_branch, br_depth,
-        true, null_succeeds);
+        decoder, HeapType{kBottom}, object, value_on_branch, br_depth, true,
+        null_succeeds);
   }
 
   void BrOnNonEq(FullDecoder* decoder, const Value& object,
                  Value* value_on_fallthrough, uint32_t br_depth,
                  bool null_succeeds) {
-    // TODO(7748): Merge BrOn* and BrOnNon* instructions as their only
+    // TODO(14034): Merge BrOn* and BrOnNon* instructions as their only
     // difference is a boolean flag passed to BrOnCastAbs. This could also be
     // leveraged to merge BrOnCastFailAbstract and BrOnCastAbstract.
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnEq>(
-        decoder, object, Value{nullptr, kWasmBottom}, value_on_fallthrough,
-        br_depth, false, null_succeeds);
+        decoder, HeapType{kBottom}, object, value_on_fallthrough, br_depth,
+        false, null_succeeds);
   }
 
   void RefIsStruct(FullDecoder* decoder, const Value& object, Value* result) {
-    bool null_succeeds = false;
-    SetAndTypeNode(result,
-                   builder_->RefIsStruct(object.node, object.type.is_nullable(),
-                                         null_succeeds));
+    WasmTypeCheckConfig config{object.type, ValueType::Ref(HeapType::kStruct)};
+    SetAndTypeNode(result, builder_->RefTestAbstract(object.node, config));
   }
 
   void RefAsStruct(FullDecoder* decoder, const Value& object, Value* result) {
-    bool null_succeeds = false;
+    WasmTypeCheckConfig config{object.type, ValueType::Ref(HeapType::kStruct)};
     TFNode* cast_object =
-        builder_->RefAsStruct(object.node, object.type.is_nullable(),
-                              decoder->position(), null_succeeds);
+        builder_->RefCastAbstract(object.node, config, decoder->position());
     TFNode* rename = builder_->TypeGuard(cast_object, result->type);
     SetAndTypeNode(result, rename);
   }
@@ -1548,30 +1766,27 @@ class WasmGraphBuildingInterface {
                   Value* value_on_branch, uint32_t br_depth,
                   bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnStruct>(
-        decoder, object, Value{nullptr, kWasmBottom}, value_on_branch, br_depth,
-        true, null_succeeds);
+        decoder, HeapType{kBottom}, object, value_on_branch, br_depth, true,
+        null_succeeds);
   }
 
   void BrOnNonStruct(FullDecoder* decoder, const Value& object,
                      Value* value_on_fallthrough, uint32_t br_depth,
                      bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnStruct>(
-        decoder, object, Value{nullptr, kWasmBottom}, value_on_fallthrough,
-        br_depth, false, null_succeeds);
+        decoder, HeapType{kBottom}, object, value_on_fallthrough, br_depth,
+        false, null_succeeds);
   }
 
   void RefIsArray(FullDecoder* decoder, const Value& object, Value* result) {
-    bool null_succeeds = false;
-    SetAndTypeNode(result,
-                   builder_->RefIsArray(object.node, object.type.is_nullable(),
-                                        null_succeeds));
+    WasmTypeCheckConfig config{object.type, ValueType::Ref(HeapType::kArray)};
+    SetAndTypeNode(result, builder_->RefTestAbstract(object.node, config));
   }
 
   void RefAsArray(FullDecoder* decoder, const Value& object, Value* result) {
-    bool null_succeeds = false;
+    WasmTypeCheckConfig config{object.type, ValueType::Ref(HeapType::kArray)};
     TFNode* cast_object =
-        builder_->RefAsArray(object.node, object.type.is_nullable(),
-                             decoder->position(), null_succeeds);
+        builder_->RefCastAbstract(object.node, config, decoder->position());
     TFNode* rename = builder_->TypeGuard(cast_object, result->type);
     SetAndTypeNode(result, rename);
   }
@@ -1580,27 +1795,27 @@ class WasmGraphBuildingInterface {
                  Value* value_on_branch, uint32_t br_depth,
                  bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnArray>(
-        decoder, object, Value{nullptr, kWasmBottom}, value_on_branch, br_depth,
-        true, null_succeeds);
+        decoder, HeapType{kBottom}, object, value_on_branch, br_depth, true,
+        null_succeeds);
   }
 
   void BrOnNonArray(FullDecoder* decoder, const Value& object,
                     Value* value_on_fallthrough, uint32_t br_depth,
                     bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnArray>(
-        decoder, object, Value{nullptr, kWasmBottom}, value_on_fallthrough,
-        br_depth, false, null_succeeds);
+        decoder, HeapType{kBottom}, object, value_on_fallthrough, br_depth,
+        false, null_succeeds);
   }
 
   void RefIsI31(FullDecoder* decoder, const Value& object, Value* result) {
-    bool null_succeeds = false;
-    SetAndTypeNode(result, builder_->RefIsI31(object.node, null_succeeds));
+    WasmTypeCheckConfig config{object.type, ValueType::Ref(HeapType::kI31)};
+    SetAndTypeNode(result, builder_->RefTestAbstract(object.node, config));
   }
 
   void RefAsI31(FullDecoder* decoder, const Value& object, Value* result) {
-    bool null_succeeds = false;
+    WasmTypeCheckConfig config{object.type, ValueType::Ref(HeapType::kI31)};
     TFNode* cast_object =
-        builder_->RefAsI31(object.node, decoder->position(), null_succeeds);
+        builder_->RefCastAbstract(object.node, config, decoder->position());
     TFNode* rename = builder_->TypeGuard(cast_object, result->type);
     SetAndTypeNode(result, rename);
   }
@@ -1608,16 +1823,32 @@ class WasmGraphBuildingInterface {
   void BrOnI31(FullDecoder* decoder, const Value& object,
                Value* value_on_branch, uint32_t br_depth, bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnI31>(
-        decoder, object, Value{nullptr, kWasmBottom}, value_on_branch, br_depth,
-        true, null_succeeds);
+        decoder, HeapType{kBottom}, object, value_on_branch, br_depth, true,
+        null_succeeds);
   }
 
   void BrOnNonI31(FullDecoder* decoder, const Value& object,
                   Value* value_on_fallthrough, uint32_t br_depth,
                   bool null_succeeds) {
     BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnI31>(
-        decoder, object, Value{nullptr, kWasmBottom}, value_on_fallthrough,
-        br_depth, false, null_succeeds);
+        decoder, HeapType{kBottom}, object, value_on_fallthrough, br_depth,
+        false, null_succeeds);
+  }
+
+  void BrOnString(FullDecoder* decoder, const Value& object,
+                  Value* value_on_branch, uint32_t br_depth,
+                  bool null_succeeds) {
+    BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnString>(
+        decoder, HeapType{kBottom}, object, value_on_branch, br_depth, true,
+        null_succeeds);
+  }
+
+  void BrOnNonString(FullDecoder* decoder, const Value& object,
+                     Value* value_on_fallthrough, uint32_t br_depth,
+                     bool null_succeeds) {
+    BrOnCastAbs<&compiler::WasmGraphBuilder::BrOnString>(
+        decoder, HeapType{kBottom}, object, value_on_fallthrough, br_depth,
+        false, null_succeeds);
   }
 
   void StringNewWtf8(FullDecoder* decoder, const MemoryIndexImmediate& memory,
@@ -1631,8 +1862,9 @@ class WasmGraphBuildingInterface {
                           const unibrow::Utf8Variant variant,
                           const Value& array, const Value& start,
                           const Value& end, Value* result) {
-    SetAndTypeNode(result, builder_->StringNewWtf8Array(variant, array.node,
-                                                        start.node, end.node));
+    SetAndTypeNode(result, builder_->StringNewWtf8Array(
+                               variant, array.node, NullCheckFor(array.type),
+                               start.node, end.node, decoder->position()));
   }
 
   void StringNewWtf16(FullDecoder* decoder, const MemoryIndexImmediate& imm,
@@ -1644,8 +1876,9 @@ class WasmGraphBuildingInterface {
   void StringNewWtf16Array(FullDecoder* decoder, const Value& array,
                            const Value& start, const Value& end,
                            Value* result) {
-    SetAndTypeNode(result, builder_->StringNewWtf16Array(array.node, start.node,
-                                                         end.node));
+    SetAndTypeNode(result, builder_->StringNewWtf16Array(
+                               array.node, NullCheckFor(array.type), start.node,
+                               end.node, decoder->position()));
   }
 
   void StringConst(FullDecoder* decoder, const StringConstImmediate& imm,
@@ -1725,8 +1958,7 @@ class WasmGraphBuildingInterface {
 
   void StringEq(FullDecoder* decoder, const Value& a, const Value& b,
                 Value* result) {
-    SetAndTypeNode(result, builder_->StringEqual(a.node, NullCheckFor(a.type),
-                                                 b.node, NullCheckFor(b.type),
+    SetAndTypeNode(result, builder_->StringEqual(a.node, a.type, b.node, b.type,
                                                  decoder->position()));
   }
 
@@ -1928,13 +2160,13 @@ class WasmGraphBuildingInterface {
     return v8_flags.wasm_loop_unrolling || v8_flags.wasm_loop_peeling;
   }
 
-  void GetNodes(TFNode** nodes, Value* values, size_t count) {
+  void GetNodes(TFNode** nodes, const Value* values, size_t count) {
     for (size_t i = 0; i < count; ++i) {
       nodes[i] = values[i].node;
     }
   }
 
-  void GetNodes(TFNode** nodes, base::Vector<Value> values) {
+  void GetNodes(TFNode** nodes, base::Vector<const Value> values) {
     GetNodes(nodes, values.begin(), values.size());
   }
 
@@ -1970,10 +2202,8 @@ class WasmGraphBuildingInterface {
     builder_->set_instance_cache(&env->instance_cache);
   }
 
-  enum ReloadContextAfterException { kDontReloadContext, kReloadContext };
-
   TFNode* CheckForException(FullDecoder* decoder, TFNode* node,
-                            ReloadContextAfterException reload_mode) {
+                            bool may_modify_instance_cache) {
     DCHECK_NOT_NULL(node);
 
     // We need to emit IfSuccess/IfException nodes if this node throws and has
@@ -2001,11 +2231,10 @@ class WasmGraphBuildingInterface {
 
     ScopedSsaEnv scoped_env(this, exception_env, success_env);
 
-    // If the exceptional operation could have modified memory size, we need to
+    // The exceptional operation could have modified memory size; we need to
     // reload the memory context into the exceptional control path.
-    if (reload_mode == kReloadContext &&
-        decoder->module_->initial_pages != decoder->module_->maximum_pages) {
-      LoadContextIntoSsa(ssa_env_, decoder);
+    if (may_modify_instance_cache) {
+      ReloadInstanceCacheIntoSsa(ssa_env_, decoder->module_);
     }
 
     if (emit_loop_exits()) {
@@ -2253,7 +2482,7 @@ class WasmGraphBuildingInterface {
             call_info.table_index(), call_info.sig_index(),
             base::VectorOf(arg_nodes), base::VectorOf(return_nodes),
             decoder->position());
-        CheckForException(decoder, call, kReloadContext);
+        CheckForException(decoder, call, true);
         break;
       }
       case CallInfo::kCallDirect: {
@@ -2261,25 +2490,23 @@ class WasmGraphBuildingInterface {
             call_info.callee_index(), base::VectorOf(arg_nodes),
             base::VectorOf(return_nodes), decoder->position());
         builder_->StoreCallCount(call, call_info.call_count());
-        CheckForException(decoder, call, kReloadContext);
+        CheckForException(decoder, call, true);
         break;
       }
       case CallInfo::kCallRef: {
         TFNode* call = builder_->CallRef(
             sig, base::VectorOf(arg_nodes), base::VectorOf(return_nodes),
             call_info.null_check(), decoder->position());
-        CheckForException(decoder, call, kReloadContext);
+        CheckForException(decoder, call, true);
         break;
       }
     }
     for (size_t i = 0; i < return_count; ++i) {
       SetAndTypeNode(&returns[i], return_nodes[i]);
     }
-    if (decoder->module_->initial_pages != decoder->module_->maximum_pages) {
-      // The invoked function could have used grow_memory, so we need to
-      // reload mem_size and mem_start.
-      LoadContextIntoSsa(ssa_env_, decoder);
-    }
+    // The invoked function could have used grow_memory, so we need to
+    // reload memory information.
+    ReloadInstanceCacheIntoSsa(ssa_env_, decoder->module_);
   }
 
   void DoReturnCall(FullDecoder* decoder, CallInfo call_info,
@@ -2346,15 +2573,12 @@ class WasmGraphBuildingInterface {
       }
     }
     if (loop->loop_assignments->Contains(decoder->num_locals())) {
-#define WRAP_CACHE_FIELD(field)                                                \
-  if (ssa_env_->instance_cache.field != nullptr) {                             \
-    ssa_env_->instance_cache.field = builder_->LoopExitValue(                  \
-        ssa_env_->instance_cache.field, MachineType::PointerRepresentation()); \
-  }
-
-      WRAP_CACHE_FIELD(mem_start);
-      WRAP_CACHE_FIELD(mem_size);
-#undef WRAP_CACHE_FIELD
+      for (auto field : compiler::WasmInstanceCacheNodes::kFields) {
+        if (ssa_env_->instance_cache.*field == nullptr) continue;
+        ssa_env_->instance_cache.*field =
+            builder_->LoopExitValue(ssa_env_->instance_cache.*field,
+                                    MachineType::PointerRepresentation());
+      }
     }
   }
 
@@ -2402,6 +2626,34 @@ class WasmGraphBuildingInterface {
     DCHECK_LT(value->type.kind(), kBottom);
     value->node = builder_->SetType(node, value->type);
   }
+
+  // In order to determine the memory index to cache in an SSA value, we try to
+  // determine the first memory index that will be accessed in the function. If
+  // we do not find a memory access this method returns -1.
+  // This is a best-effort implementation: It ignores potential control flow and
+  // only looks for basic memory load and store operations.
+  int FindFirstUsedMemoryIndex(base::Vector<const uint8_t> body, Zone* zone) {
+    BodyLocalDecls locals;
+    for (BytecodeIterator it{body.begin(), body.end(), &locals, zone};
+         it.has_next(); it.next()) {
+      WasmOpcode opcode = it.current();
+      constexpr bool kConservativelyAssumeMemory64 = true;
+      constexpr bool kConservativelyAssumeMultiMemory = true;
+      switch (opcode) {
+        default:
+          break;
+#define CASE(name, ...) case kExpr##name:
+          FOREACH_LOAD_MEM_OPCODE(CASE)
+          FOREACH_STORE_MEM_OPCODE(CASE)
+#undef CASE
+          MemoryAccessImmediate imm(
+              &it, it.pc() + 1, UINT32_MAX, kConservativelyAssumeMemory64,
+              kConservativelyAssumeMultiMemory, Decoder::kNoValidation);
+          return imm.mem_index;
+      }
+    }
+    return -1;
+  }
 };
 
 }  // namespace
diff --git a/deps/v8/src/wasm/jump-table-assembler.cc b/deps/v8/src/wasm/jump-table-assembler.cc
index 76dac357682e5e..80e9d53f7d06b6 100644
--- a/deps/v8/src/wasm/jump-table-assembler.cc
+++ b/deps/v8/src/wasm/jump-table-assembler.cc
@@ -59,7 +59,7 @@ void JumpTableAssembler::EmitLazyCompileJumpSlot(uint32_t func_index,
 
 bool JumpTableAssembler::EmitJumpSlot(Address target) {
   intptr_t displacement = static_cast<intptr_t>(
-      reinterpret_cast<byte*>(target) - pc_ - kNearJmpInstrSize);
+      reinterpret_cast<uint8_t*>(target) - pc_ - kNearJmpInstrSize);
   if (!is_int32(displacement)) return false;
   near_jmp(displacement, RelocInfo::NO_INFO);  // 5 bytes
   return true;
@@ -199,8 +199,8 @@ bool JumpTableAssembler::EmitJumpSlot(Address target) {
   static constexpr ptrdiff_t kCodeEntryMarkerSize = 0;
 #endif
 
-  byte* jump_pc = pc_ + kCodeEntryMarkerSize;
-  ptrdiff_t jump_distance = reinterpret_cast<byte*>(target) - jump_pc;
+  uint8_t* jump_pc = pc_ + kCodeEntryMarkerSize;
+  ptrdiff_t jump_distance = reinterpret_cast<uint8_t*>(target) - jump_pc;
   DCHECK_EQ(0, jump_distance % kInstrSize);
   int64_t instr_offset = jump_distance / kInstrSize;
   if (!MacroAssembler::IsNearCallOffset(instr_offset)) {
@@ -280,7 +280,7 @@ void JumpTableAssembler::EmitLazyCompileJumpSlot(uint32_t func_index,
 }
 
 bool JumpTableAssembler::EmitJumpSlot(Address target) {
-  intptr_t relative_target = reinterpret_cast<byte*>(target) - pc_;
+  intptr_t relative_target = reinterpret_cast<uint8_t*>(target) - pc_;
 
   if (!is_int32(relative_target / 2)) {
     return false;
@@ -370,23 +370,37 @@ void JumpTableAssembler::EmitLazyCompileJumpSlot(uint32_t func_index,
   DCHECK(is_int32(func_index));
   int start = pc_offset();
   li(kWasmCompileLazyFuncIndexRegister, (int32_t)func_index);  // max. 2 instr
-  // Jump produces max 4 instructions.
-  Jump(lazy_compile_target, RelocInfo::NO_INFO);
+  // EmitJumpSlot produces 1 instructions.
+  CHECK(EmitJumpSlot(lazy_compile_target));
   int nop_bytes = start + kLazyCompileTableSlotSize - pc_offset();
   DCHECK_EQ(nop_bytes % kInstrSize, 0);
   for (int i = 0; i < nop_bytes; i += kInstrSize) nop();
 }
 bool JumpTableAssembler::EmitJumpSlot(Address target) {
-  PatchAndJump(target);
+  intptr_t relative_target = reinterpret_cast<uint8_t*>(target) - pc_;
+  DCHECK_EQ(relative_target % 4, 0);
+  intptr_t instr_offset = relative_target / kInstrSize;
+  if (!is_int26(instr_offset)) {
+    return false;
+  }
+
+  b(instr_offset);
   return true;
 }
 void JumpTableAssembler::EmitFarJumpSlot(Address target) {
-  li(t7, Operand(target, RelocInfo::OFF_HEAP_TARGET));
-  Jump(t7);
+  pcaddi(t7, 4);
+  Ld_d(t7, MemOperand(t7, 0));
+  jirl(zero_reg, t7, 0);
+  nop();  // pc_ should be align.
+  DCHECK_EQ(reinterpret_cast<uint64_t>(pc_) % 8, 0);
+  dq(target);
 }
 void JumpTableAssembler::PatchFarJumpSlot(Address slot, Address target) {
-  UNREACHABLE();
+  Address target_addr = slot + kFarJumpTableSlotSize - 8;
+  reinterpret_cast<std::atomic<Address>*>(target_addr)
+      ->store(target, std::memory_order_relaxed);
 }
+
 void JumpTableAssembler::NopBytes(int bytes) {
   DCHECK_LE(0, bytes);
   DCHECK_EQ(0, bytes % kInstrSize);
@@ -417,7 +431,7 @@ void JumpTableAssembler::EmitLazyCompileJumpSlot(uint32_t func_index,
 }
 
 bool JumpTableAssembler::EmitJumpSlot(Address target) {
-  intptr_t relative_target = reinterpret_cast<byte*>(target) - pc_;
+  intptr_t relative_target = reinterpret_cast<uint8_t*>(target) - pc_;
 
   if (!is_int26(relative_target)) {
     return false;
@@ -428,13 +442,13 @@ bool JumpTableAssembler::EmitJumpSlot(Address target) {
 }
 
 void JumpTableAssembler::EmitFarJumpSlot(Address target) {
-  byte* start = pc_;
+  uint8_t* start = pc_;
   mov(ip, Operand(reinterpret_cast<Address>(start + kFarJumpTableSlotSize -
                                             8)));  // 5 instr
   LoadU64(ip, MemOperand(ip));
   mtctr(ip);
   bctr();
-  byte* end = pc_;
+  uint8_t* end = pc_;
   int used = end - start;
   CHECK(used < kFarJumpTableSlotSize - 8);
   NopBytes(kFarJumpTableSlotSize - 8 - used);
diff --git a/deps/v8/src/wasm/jump-table-assembler.h b/deps/v8/src/wasm/jump-table-assembler.h
index eeb399996b2078..8773d3925385e2 100644
--- a/deps/v8/src/wasm/jump-table-assembler.h
+++ b/deps/v8/src/wasm/jump-table-assembler.h
@@ -234,10 +234,10 @@ class V8_EXPORT_PRIVATE JumpTableAssembler : public MacroAssembler {
   static constexpr int kFarJumpTableSlotSize = 6 * kInstrSize;
   static constexpr int kLazyCompileTableSlotSize = 10 * kInstrSize;
 #elif V8_TARGET_ARCH_LOONG64
-  static constexpr int kJumpTableLineSize = 8 * kInstrSize;
-  static constexpr int kJumpTableSlotSize = 8 * kInstrSize;
-  static constexpr int kFarJumpTableSlotSize = 4 * kInstrSize;
-  static constexpr int kLazyCompileTableSlotSize = 8 * kInstrSize;
+  static constexpr int kJumpTableLineSize = 1 * kInstrSize;
+  static constexpr int kJumpTableSlotSize = 1 * kInstrSize;
+  static constexpr int kFarJumpTableSlotSize = 6 * kInstrSize;
+  static constexpr int kLazyCompileTableSlotSize = 3 * kInstrSize;
 #else
 #error Unknown architecture.
 #endif
diff --git a/deps/v8/src/wasm/local-decl-encoder.cc b/deps/v8/src/wasm/local-decl-encoder.cc
index b903e349e6f1bf..eb9718d2ff8247 100644
--- a/deps/v8/src/wasm/local-decl-encoder.cc
+++ b/deps/v8/src/wasm/local-decl-encoder.cc
@@ -14,10 +14,11 @@ namespace wasm {
 // This struct is just a type tag for Zone::NewArray<T>(size_t) call.
 struct LocalDeclEncoderBuffer {};
 
-void LocalDeclEncoder::Prepend(Zone* zone, const byte** start,
-                               const byte** end) const {
+void LocalDeclEncoder::Prepend(Zone* zone, const uint8_t** start,
+                               const uint8_t** end) const {
   size_t size = (*end - *start);
-  byte* buffer = zone->NewArray<byte, LocalDeclEncoderBuffer>(Size() + size);
+  uint8_t* buffer =
+      zone->AllocateArray<uint8_t, LocalDeclEncoderBuffer>(Size() + size);
   size_t pos = Emit(buffer);
   if (size > 0) {
     memcpy(buffer + pos, *start, size);
@@ -27,8 +28,8 @@ void LocalDeclEncoder::Prepend(Zone* zone, const byte** start,
   *end = buffer + pos;
 }
 
-size_t LocalDeclEncoder::Emit(byte* buffer) const {
-  byte* pos = buffer;
+size_t LocalDeclEncoder::Emit(uint8_t* buffer) const {
+  uint8_t* pos = buffer;
   LEBHelper::write_u32v(&pos, static_cast<uint32_t>(local_decls.size()));
   for (auto& local_decl : local_decls) {
     uint32_t locals_count = local_decl.first;
diff --git a/deps/v8/src/wasm/local-decl-encoder.h b/deps/v8/src/wasm/local-decl-encoder.h
index 987807cf292d00..28784bff7e207a 100644
--- a/deps/v8/src/wasm/local-decl-encoder.h
+++ b/deps/v8/src/wasm/local-decl-encoder.h
@@ -26,9 +26,9 @@ class V8_EXPORT_PRIVATE LocalDeclEncoder {
 
   // Prepend local declarations by creating a new buffer and copying data
   // over. The new buffer must be delete[]'d by the caller.
-  void Prepend(Zone* zone, const byte** start, const byte** end) const;
+  void Prepend(Zone* zone, const uint8_t** start, const uint8_t** end) const;
 
-  size_t Emit(byte* buffer) const;
+  size_t Emit(uint8_t* buffer) const;
 
   // Add locals declarations to this helper. Return the index of the newly added
   // local(s), with an optional adjustment for the parameters.
diff --git a/deps/v8/src/wasm/module-compiler.cc b/deps/v8/src/wasm/module-compiler.cc
index 128ca572d39fe6..f6ac958579af5b 100644
--- a/deps/v8/src/wasm/module-compiler.cc
+++ b/deps/v8/src/wasm/module-compiler.cc
@@ -15,17 +15,17 @@
 #include "src/base/platform/mutex.h"
 #include "src/base/platform/semaphore.h"
 #include "src/base/platform/time.h"
+#include "src/codegen/compiler.h"
 #include "src/compiler/wasm-compiler.h"
 #include "src/debug/debug.h"
 #include "src/handles/global-handles-inl.h"
-#include "src/heap/heap-inl.h"  // For CodePageCollectionMemoryModificationScope.
 #include "src/logging/counters-scopes.h"
 #include "src/logging/metrics.h"
 #include "src/tracing/trace-event.h"
-#include "src/wasm/assembler-buffer-cache.h"
 #include "src/wasm/code-space-access.h"
 #include "src/wasm/module-decoder.h"
 #include "src/wasm/pgo.h"
+#include "src/wasm/std-object-sizes.h"
 #include "src/wasm/streaming-decoder.h"
 #include "src/wasm/wasm-code-manager.h"
 #include "src/wasm/wasm-engine.h"
@@ -250,10 +250,10 @@ class CompilationUnitQueues {
       auto* queue = queues_[queue_to_add].get();
       base::MutexGuard guard(&queue->mutex);
       queue->top_tier_priority_units.emplace(priority, unit);
+      num_priority_units_.fetch_add(1, std::memory_order_relaxed);
+      num_units_[CompilationTier::kTopTier].fetch_add(
+          1, std::memory_order_relaxed);
     }
-    num_priority_units_.fetch_add(1, std::memory_order_relaxed);
-    num_units_[CompilationTier::kTopTier].fetch_add(1,
-                                                    std::memory_order_relaxed);
   }
 
   // Get the current number of units in the queue for |tier|. This is only a
@@ -274,6 +274,8 @@ class CompilationUnitQueues {
     }
   }
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   // Functions bigger than {kBigUnitsLimit} will be compiled first, in ascending
   // order of their function body size.
@@ -311,7 +313,7 @@ class CompilationUnitQueues {
 #endif
     }
 
-    base::Mutex mutex;
+    mutable base::Mutex mutex;
 
     // Can be read concurrently to check whether any elements are in the queue.
     std::atomic<bool> has_units[CompilationTier::kNumTiers];
@@ -507,7 +509,7 @@ class CompilationUnitQueues {
   }
 
   // {queues_mutex_} protectes {queues_};
-  base::SharedMutex queues_mutex_;
+  mutable base::SharedMutex queues_mutex_;
   std::vector<std::unique_ptr<QueueImpl>> queues_;
 
   const int num_declared_functions_;
@@ -520,6 +522,31 @@ class CompilationUnitQueues {
   std::atomic<int> next_queue_to_add{0};
 };
 
+size_t CompilationUnitQueues::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(CompilationUnitQueues, 248);
+  UPDATE_WHEN_CLASS_CHANGES(QueueImpl, 144);
+  UPDATE_WHEN_CLASS_CHANGES(BigUnitsQueue, 120);
+  // Not including sizeof(CompilationUnitQueues) because that's included in
+  // sizeof(CompilationStateImpl).
+  size_t result = 0;
+  {
+    base::SharedMutexGuard<base::kShared> lock(&queues_mutex_);
+    result += ContentSize(queues_) + queues_.size() * sizeof(QueueImpl);
+    for (const auto& q : queues_) {
+      result += ContentSize(*q->units);
+      result += q->top_tier_priority_units.size() * sizeof(TopTierPriorityUnit);
+    }
+  }
+  {
+    base::MutexGuard lock(&big_units_queue_.mutex);
+    result += big_units_queue_.units[0].size() * sizeof(BigUnit);
+    result += big_units_queue_.units[1].size() * sizeof(BigUnit);
+  }
+  // For {top_tier_compiled_}.
+  result += sizeof(std::atomic<bool>) * num_declared_functions_;
+  return result;
+}
+
 bool CompilationUnitQueues::Queue::ShouldPublish(
     int num_processed_units) const {
   auto* queue = static_cast<const QueueImpl*>(this);
@@ -567,6 +594,10 @@ class CompilationStateImpl {
   // (tiering decisions).
   void ApplyPgoInfoToInitialProgress(ProfileInformation* pgo_info);
 
+  // Apply PGO information to a fully initialized compilation state. Also
+  // trigger compilation as needed.
+  void ApplyPgoInfoLate(ProfileInformation* pgo_info);
+
   // Initialize compilation progress. Set compilation tiers to expect for
   // baseline and top tier compilation. Must be set before
   // {CommitCompilationUnits} is invoked which triggers background compilation.
@@ -617,7 +648,8 @@ class CompilationStateImpl {
   void OnCompilationStopped(WasmFeatures detected);
   void PublishDetectedFeatures(Isolate*);
   void SchedulePublishCompilationResults(
-      std::vector<std::unique_ptr<WasmCode>> unpublished_code);
+      std::vector<std::unique_ptr<WasmCode>> unpublished_code,
+      CompilationTier tier);
 
   size_t NumOutstandingCompilations(CompilationTier tier) const;
 
@@ -670,6 +702,8 @@ class CompilationStateImpl {
     return native_module_weak_;
   }
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   void AddCompilationUnitInternal(CompilationUnitBuilder* builder,
                                   int function_index,
@@ -760,10 +794,13 @@ class CompilationStateImpl {
   // End of fields protected by {callbacks_mutex_}.
   //////////////////////////////////////////////////////////////////////////////
 
-  // {publish_mutex_} protects {publish_queue_} and {publisher_running_}.
-  base::Mutex publish_mutex_;
-  std::vector<std::unique_ptr<WasmCode>> publish_queue_;
-  bool publisher_running_ = false;
+  struct PublishState {
+    // {mutex_} protects {publish_queue_} and {publisher_running_}.
+    base::Mutex mutex_;
+    std::vector<std::unique_ptr<WasmCode>> publish_queue_;
+    bool publisher_running_ = false;
+  };
+  PublishState publish_state_[CompilationTier::kNumTiers];
 
   // Encoding of fields in the {compilation_progress_} vector.
   using RequiredBaselineTierField = base::BitField8<ExecutionTier, 0, 2>;
@@ -783,6 +820,34 @@ CompilationStateImpl* BackgroundCompileScope::compilation_state() const {
   return Impl(native_module_->compilation_state());
 }
 
+size_t CompilationStateImpl::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(CompilationStateImpl, 704);
+  UPDATE_WHEN_CLASS_CHANGES(JSToWasmWrapperCompilationUnit, 40);
+  size_t result = sizeof(CompilationStateImpl);
+
+  result += compilation_unit_queues_.EstimateCurrentMemoryConsumption();
+
+  result += ContentSize(js_to_wasm_wrapper_units_);
+  result +=
+      js_to_wasm_wrapper_units_.size() *
+      (sizeof(JSToWasmWrapperCompilationUnit) + sizeof(TurbofanCompilationJob));
+
+  {
+    base::MutexGuard lock(&callbacks_mutex_);
+    result += ContentSize(callbacks_);
+    // Concrete subclasses of CompilationEventCallback will be bigger, but we
+    // can't know that here.
+    result += callbacks_.size() * sizeof(CompilationEventCallback);
+
+    result += ContentSize(compilation_progress_);
+  }
+
+  if (v8_flags.trace_wasm_offheap_memory) {
+    PrintF("CompilationStateImpl: %zu\n", result);
+  }
+  return result;
+}
+
 bool BackgroundCompileScope::cancelled() const {
   return native_module_ == nullptr ||
          Impl(native_module_->compilation_state())->cancelled();
@@ -794,7 +859,10 @@ void UpdateFeatureUseCounts(Isolate* isolate, WasmFeatures detected) {
       {kFeature_reftypes, Feature::kWasmRefTypes},
       {kFeature_simd, Feature::kWasmSimdOpcodes},
       {kFeature_threads, Feature::kWasmThreadOpcodes},
-      {kFeature_eh, Feature::kWasmExceptionHandling}};
+      {kFeature_eh, Feature::kWasmExceptionHandling},
+      {kFeature_memory64, Feature::kWasmMemory64},
+      {kFeature_multi_memory, Feature::kWasmMultiMemory},
+      {kFeature_gc, Feature::kWasmGC}};
 
   for (auto& feature : kUseCounters) {
     if (detected.contains(feature.first)) isolate->CountUsage(feature.second);
@@ -869,6 +937,10 @@ DynamicTiering CompilationState::dynamic_tiering() const {
   return Impl(this)->dynamic_tiering();
 }
 
+size_t CompilationState::EstimateCurrentMemoryConsumption() const {
+  return Impl(this)->EstimateCurrentMemoryConsumption();
+}
+
 // static
 std::unique_ptr<CompilationState> CompilationState::New(
     const std::shared_ptr<NativeModule>& native_module,
@@ -1102,11 +1174,11 @@ class CompileLazyTimingScope {
 
 }  // namespace
 
-bool CompileLazy(Isolate* isolate, WasmInstanceObject instance,
+bool CompileLazy(Isolate* isolate, Tagged<WasmInstanceObject> instance,
                  int func_index) {
   DisallowGarbageCollection no_gc;
-  WasmModuleObject module_object = instance.module_object();
-  NativeModule* native_module = module_object.native_module();
+  Tagged<WasmModuleObject> module_object = instance->module_object();
+  NativeModule* native_module = module_object->native_module();
   Counters* counters = isolate->counters();
 
   // Put the timer scope around everything, including the {CodeSpaceWriteScope}
@@ -1133,12 +1205,10 @@ bool CompileLazy(Isolate* isolate, WasmInstanceObject instance,
       func_index, tiers.baseline_tier,
       is_in_debug_state ? kForDebugging : kNotForDebugging};
   CompilationEnv env = native_module->CreateCompilationEnv();
-  // TODO(wasm): Use an assembler buffer cache for lazy compilation.
-  AssemblerBufferCache* assembler_buffer_cache = nullptr;
   WasmFeatures detected_features;
   WasmCompilationResult result = baseline_unit.ExecuteCompilation(
       &env, compilation_state->GetWireBytesStorage().get(), counters,
-      assembler_buffer_cache, &detected_features);
+      &detected_features);
   compilation_state->OnCompilationStopped(detected_features);
 
   // During lazy compilation, we can only get compilation errors when
@@ -1150,20 +1220,14 @@ bool CompileLazy(Isolate* isolate, WasmInstanceObject instance,
   }
 
   WasmCodeRefScope code_ref_scope;
-  WasmCode* code;
-  {
-    CodeSpaceWriteScope code_space_write_scope(native_module);
-    code = native_module->PublishCode(
-        native_module->AddCompiledCode(std::move(result)));
-  }
+  WasmCode* code =
+      native_module->PublishCode(native_module->AddCompiledCode(result));
   DCHECK_EQ(func_index, code->index());
 
-  if (WasmCode::ShouldBeLogged(isolate)) {
-    Object url_obj = module_object.script().name();
-    DCHECK(url_obj.IsString() || url_obj.IsUndefined());
-    std::unique_ptr<char[]> url =
-        url_obj.IsString() ? String::cast(url_obj).ToCString() : nullptr;
-    code->LogCode(isolate, url.get(), module_object.script().id());
+  if (V8_UNLIKELY(native_module->log_code())) {
+    GetWasmEngine()->LogCode(base::VectorOf(&code, 1));
+    // Log the code immediately in the current isolate.
+    GetWasmEngine()->LogOutstandingCodesForIsolate(isolate);
   }
 
   counters->wasm_lazily_compiled_functions()->Increment();
@@ -1204,14 +1268,15 @@ void ThrowLazyCompilationError(Isolate* isolate,
 
 class TransitiveTypeFeedbackProcessor {
  public:
-  static void Process(WasmInstanceObject instance, int func_index) {
+  static void Process(Tagged<WasmInstanceObject> instance, int func_index) {
     TransitiveTypeFeedbackProcessor{instance, func_index}.ProcessQueue();
   }
 
  private:
-  TransitiveTypeFeedbackProcessor(WasmInstanceObject instance, int func_index)
+  TransitiveTypeFeedbackProcessor(Tagged<WasmInstanceObject> instance,
+                                  int func_index)
       : instance_(instance),
-        module_(instance.module()),
+        module_(instance->module()),
         mutex_guard(&module_->type_feedback.mutex),
         feedback_for_function_(module_->type_feedback.feedback_for_function) {
     queue_.insert(func_index);
@@ -1259,25 +1324,25 @@ class TransitiveTypeFeedbackProcessor {
 
 class FeedbackMaker {
  public:
-  FeedbackMaker(WasmInstanceObject instance, int func_index, int num_calls)
+  FeedbackMaker(Tagged<WasmInstanceObject> instance, int func_index,
+                int num_calls)
       : instance_(instance),
         num_imported_functions_(
-            static_cast<int>(instance.module()->num_imported_functions)),
+            static_cast<int>(instance->module()->num_imported_functions)),
         func_index_(func_index) {
     result_.reserve(num_calls);
   }
 
-  void AddCandidate(Object maybe_function, int count) {
-    if (!maybe_function.IsWasmInternalFunction()) return;
-    WasmInternalFunction function = WasmInternalFunction::cast(maybe_function);
-    if (!WasmExportedFunction::IsWasmExportedFunction(function.external())) {
+  void AddCandidate(Tagged<Object> maybe_function, int count) {
+    if (!IsWasmInternalFunction(maybe_function)) return;
+    Tagged<WasmInternalFunction> function =
+        WasmInternalFunction::cast(maybe_function);
+    if (function->ref() != instance_) {
+      // Not a wasm function, or not a function declared in this instance.
       return;
     }
-    WasmExportedFunction target =
-        WasmExportedFunction::cast(function.external());
-    if (target.instance() != instance_) return;
-    if (target.function_index() < num_imported_functions_) return;
-    AddCall(target.function_index(), count);
+    if (function->function_index() < num_imported_functions_) return;
+    AddCall(function->function_index(), count);
   }
 
   void AddCall(int target, int count) {
@@ -1301,14 +1366,14 @@ class FeedbackMaker {
     if (cache_usage_ == 0) {
       result_.emplace_back();
     } else if (cache_usage_ == 1) {
-      if (v8_flags.trace_wasm_speculative_inlining) {
-        PrintF("[Function #%d call_ref #%zu inlineable (monomorphic)]\n",
+      if (v8_flags.trace_wasm_inlining) {
+        PrintF("[function %d: call_ref #%zu inlineable (monomorphic)]\n",
                func_index_, result_.size());
       }
       result_.emplace_back(targets_cache_[0], counts_cache_[0]);
     } else {
-      if (v8_flags.trace_wasm_speculative_inlining) {
-        PrintF("[Function #%d call_ref #%zu inlineable (polymorphic %d)]\n",
+      if (v8_flags.trace_wasm_inlining) {
+        PrintF("[function %d: call_ref #%zu inlineable (polymorphic %d)]\n",
                func_index_, result_.size(), cache_usage_);
       }
       CallSiteFeedback::PolymorphicCase* polymorphic =
@@ -1338,40 +1403,42 @@ class FeedbackMaker {
 
 void TransitiveTypeFeedbackProcessor::ProcessFunction(int func_index) {
   int which_vector = declared_function_index(module_, func_index);
-  Object maybe_feedback = instance_.feedback_vectors().get(which_vector);
-  if (!maybe_feedback.IsFixedArray()) return;
-  FixedArray feedback = FixedArray::cast(maybe_feedback);
+  Tagged<Object> maybe_feedback =
+      instance_->feedback_vectors()->get(which_vector);
+  if (!IsFixedArray(maybe_feedback)) return;
+  Tagged<FixedArray> feedback = FixedArray::cast(maybe_feedback);
   base::Vector<uint32_t> call_direct_targets =
       module_->type_feedback.feedback_for_function[func_index]
           .call_targets.as_vector();
-  DCHECK_EQ(feedback.length(), call_direct_targets.size() * 2);
-  FeedbackMaker fm(instance_, func_index, feedback.length() / 2);
-  for (int i = 0; i < feedback.length(); i += 2) {
-    Object value = feedback.get(i);
-    if (value.IsWasmInternalFunction()) {
+  DCHECK_EQ(feedback->length(), call_direct_targets.size() * 2);
+  FeedbackMaker fm(instance_, func_index, feedback->length() / 2);
+  for (int i = 0; i < feedback->length(); i += 2) {
+    Tagged<Object> value = feedback->get(i);
+    if (IsWasmInternalFunction(value)) {
       // Monomorphic.
-      int count = Smi::cast(feedback.get(i + 1)).value();
+      int count = Smi::cast(feedback->get(i + 1)).value();
       fm.AddCandidate(value, count);
-    } else if (value.IsFixedArray()) {
+    } else if (IsFixedArray(value)) {
       // Polymorphic.
-      FixedArray polymorphic = FixedArray::cast(value);
-      for (int j = 0; j < polymorphic.length(); j += 2) {
-        Object function = polymorphic.get(j);
-        int count = Smi::cast(polymorphic.get(j + 1)).value();
+      Tagged<FixedArray> polymorphic = FixedArray::cast(value);
+      for (int j = 0; j < polymorphic->length(); j += 2) {
+        Tagged<Object> function = polymorphic->get(j);
+        int count = Smi::cast(polymorphic->get(j + 1)).value();
         fm.AddCandidate(function, count);
       }
-    } else if (value.IsSmi()) {
+    } else if (IsSmi(value)) {
       // Uninitialized, or a direct call collecting call count.
       uint32_t target = call_direct_targets[i / 2];
       if (target != FunctionTypeFeedback::kNonDirectCall) {
         int count = Smi::cast(value).value();
         fm.AddCall(static_cast<int>(target), count);
-      } else if (v8_flags.trace_wasm_speculative_inlining) {
-        PrintF("[Function #%d call #%d: uninitialized]\n", func_index, i / 2);
+      } else if (v8_flags.trace_wasm_inlining) {
+        PrintF("[function %d: call #%d: uninitialized]\n", func_index, i / 2);
       }
-    } else if (v8_flags.trace_wasm_speculative_inlining) {
-      if (value == ReadOnlyRoots(instance_.GetIsolate()).megamorphic_symbol()) {
-        PrintF("[Function #%d call #%d: megamorphic]\n", func_index, i / 2);
+    } else if (v8_flags.trace_wasm_inlining) {
+      if (value ==
+          ReadOnlyRoots(instance_->GetIsolate()).megamorphic_symbol()) {
+        PrintF("[function %d: call #%d: megamorphic]\n", func_index, i / 2);
       }
     }
     fm.FinalizeCall();
@@ -1381,8 +1448,8 @@ void TransitiveTypeFeedbackProcessor::ProcessFunction(int func_index) {
   feedback_for_function_[func_index].feedback_vector = std::move(result);
 }
 
-void TriggerTierUp(WasmInstanceObject instance, int func_index) {
-  NativeModule* native_module = instance.module_object().native_module();
+void TriggerTierUp(Tagged<WasmInstanceObject> instance, int func_index) {
+  NativeModule* native_module = instance->module_object()->native_module();
   CompilationStateImpl* compilation_state =
       Impl(native_module->compilation_state());
   WasmCompilationUnit tiering_unit{func_index, ExecutionTier::kTurbofan,
@@ -1394,8 +1461,9 @@ void TriggerTierUp(WasmInstanceObject instance, int func_index) {
     base::SharedMutexGuard<base::kExclusive> mutex_guard(
         &module->type_feedback.mutex);
     int array_index =
-        wasm::declared_function_index(instance.module(), func_index);
-    instance.tiering_budget_array()[array_index] = v8_flags.wasm_tiering_budget;
+        wasm::declared_function_index(instance->module(), func_index);
+    instance->tiering_budget_array()[array_index] =
+        v8_flags.wasm_tiering_budget;
     int& stored_priority =
         module->type_feedback.feedback_for_function[func_index].tierup_priority;
     if (stored_priority < kMaxInt) ++stored_priority;
@@ -1419,9 +1487,9 @@ void TriggerTierUp(WasmInstanceObject instance, int func_index) {
   compilation_state->AddTopTierPriorityCompilationUnit(tiering_unit, priority);
 }
 
-void TierUpNowForTesting(Isolate* isolate, WasmInstanceObject instance,
+void TierUpNowForTesting(Isolate* isolate, Tagged<WasmInstanceObject> instance,
                          int func_index) {
-  NativeModule* native_module = instance.module_object().native_module();
+  NativeModule* native_module = instance->module_object()->native_module();
   if (native_module->enabled_features().has_inlining()) {
     TransitiveTypeFeedbackProcessor::Process(instance, func_index);
   }
@@ -1433,10 +1501,10 @@ void TierUpNowForTesting(Isolate* isolate, WasmInstanceObject instance,
 
 namespace {
 
-void RecordStats(Code code, Counters* counters) {
-  if (!code.has_instruction_stream()) return;
-  counters->wasm_generated_code_size()->Increment(code.body_size());
-  counters->wasm_reloc_size()->Increment(code.relocation_info().length());
+void RecordStats(Tagged<Code> code, Counters* counters) {
+  if (!code->has_instruction_stream()) return;
+  counters->wasm_generated_code_size()->Increment(code->body_size());
+  counters->wasm_reloc_size()->Increment(code->relocation_size());
 }
 
 enum CompilationExecutionResult : int8_t { kNoMoreUnits, kYield };
@@ -1479,7 +1547,7 @@ CompilationExecutionResult ExecuteCompilationUnits(
   CompilationUnitQueues::Queue* queue;
   base::Optional<WasmCompilationUnit> unit;
 
-  WasmFeatures detected_features = WasmFeatures::None();
+  WasmFeatures global_detected_features = WasmFeatures::None();
 
   // Preparation (synchronized): Initialize the fields above and get the first
   // compilation unit.
@@ -1496,30 +1564,20 @@ CompilationExecutionResult ExecuteCompilationUnits(
   }
   TRACE_COMPILE("ExecuteCompilationUnits (task id %d)\n", task_id);
 
-  // If PKU is enabled, use an assembler buffer cache to avoid many expensive
-  // buffer allocations. Otherwise, malloc/free is efficient enough to prefer
-  // that bit of overhead over the memory consumption increase by the cache.
-  base::Optional<AssemblerBufferCache> optional_assembler_buffer_cache;
-  AssemblerBufferCache* assembler_buffer_cache = nullptr;
-  // Also, open a CodeSpaceWriteScope now to have (thread-local) write access to
-  // the assembler buffers.
-  base::Optional<CodeSpaceWriteScope> write_scope_for_assembler_buffers;
-  if (WasmCodeManager::MemoryProtectionKeysEnabled()) {
-    optional_assembler_buffer_cache.emplace();
-    assembler_buffer_cache = &*optional_assembler_buffer_cache;
-    write_scope_for_assembler_buffers.emplace(nullptr);
-  }
-
   std::vector<WasmCompilationResult> results_to_publish;
   while (true) {
     ExecutionTier current_tier = unit->tier();
     const char* event_name = GetCompilationEventName(unit.value(), env.value());
     TRACE_EVENT0("v8.wasm", event_name);
     while (unit->tier() == current_tier) {
+      // Track detected features on a per-function basis before collecting them
+      // into {global_detected_features}.
+      WasmFeatures per_function_detected_features = WasmFeatures::None();
       // (asynchronous): Execute the compilation.
       WasmCompilationResult result =
           unit->ExecuteCompilation(&env.value(), wire_bytes.get(), counters,
-                                   assembler_buffer_cache, &detected_features);
+                                   &per_function_detected_features);
+      global_detected_features.Add(per_function_detected_features);
       results_to_publish.emplace_back(std::move(result));
 
       bool yield = delegate && delegate->ShouldYield();
@@ -1543,12 +1601,12 @@ CompilationExecutionResult ExecuteCompilationUnits(
                 queue, tier))) {
         std::vector<std::unique_ptr<WasmCode>> unpublished_code =
             compile_scope.native_module()->AddCompiledCode(
-                base::VectorOf(std::move(results_to_publish)));
+                base::VectorOf(results_to_publish));
         results_to_publish.clear();
         compile_scope.compilation_state()->SchedulePublishCompilationResults(
-            std::move(unpublished_code));
+            std::move(unpublished_code), tier);
         compile_scope.compilation_state()->OnCompilationStopped(
-            detected_features);
+            global_detected_features);
         return yield ? kYield : kNoMoreUnits;
       }
 
@@ -1564,10 +1622,10 @@ CompilationExecutionResult ExecuteCompilationUnits(
       if (batch_full || liftoff_finished) {
         std::vector<std::unique_ptr<WasmCode>> unpublished_code =
             compile_scope.native_module()->AddCompiledCode(
-                base::VectorOf(std::move(results_to_publish)));
+                base::VectorOf(results_to_publish));
         results_to_publish.clear();
         compile_scope.compilation_state()->SchedulePublishCompilationResults(
-            std::move(unpublished_code));
+            std::move(unpublished_code), tier);
       }
     }
   }
@@ -1589,11 +1647,11 @@ int AddExportWrapperUnits(Isolate* isolate, NativeModule* native_module,
             ->isorecursive_canonical_type_ids[function.sig_index];
     int wrapper_index =
         GetExportWrapperIndex(canonical_type_index, function.imported);
-    if (wrapper_index < isolate->heap()->js_to_wasm_wrappers().length()) {
+    if (wrapper_index < isolate->heap()->js_to_wasm_wrappers()->length()) {
       MaybeObject existing_wrapper =
-          isolate->heap()->js_to_wasm_wrappers().Get(wrapper_index);
+          isolate->heap()->js_to_wasm_wrappers()->Get(wrapper_index);
       if (existing_wrapper.IsStrongOrWeak() &&
-          !existing_wrapper.GetHeapObject().IsUndefined()) {
+          !IsUndefined(existing_wrapper.GetHeapObject())) {
         // Skip wrapper compilation as the wrapper is already cached.
         // Note that this does not guarantee that the wrapper is still cached
         // at the moment at which the WasmInternalFunction is instantiated.
@@ -1624,6 +1682,10 @@ int AddImportWrapperUnits(NativeModule* native_module,
     const WasmFunction& function =
         native_module->module()->functions[func_index];
     if (!IsJSCompatibleSignature(function.sig)) continue;
+    if (UseGenericWasmToJSWrapper(kDefaultImportCallKind, function.sig,
+                                  kNoSuspend)) {
+      continue;
+    }
     uint32_t canonical_type_index =
         native_module->module()
             ->isorecursive_canonical_type_ids[function.sig_index];
@@ -2010,7 +2072,10 @@ std::shared_ptr<NativeModule> CompileToNativeModule(
   }
 
   // Embedder usage count for declared shared memories.
-  if (module->has_shared_memory) {
+  const bool has_shared_memory =
+      std::any_of(module->memories.begin(), module->memories.end(),
+                  [](auto& memory) { return memory.is_shared; });
+  if (has_shared_memory) {
     isolate->CountUsage(v8::Isolate::UseCounterFeature::kWasmSharedMemory);
   }
 
@@ -2053,7 +2118,7 @@ std::shared_ptr<NativeModule> CompileToNativeModule(
 AsyncCompileJob::AsyncCompileJob(
     Isolate* isolate, WasmFeatures enabled_features,
     base::OwnedVector<const uint8_t> bytes, Handle<Context> context,
-    Handle<Context> incumbent_context, const char* api_method_name,
+    Handle<NativeContext> incumbent_context, const char* api_method_name,
     std::shared_ptr<CompilationResultResolver> resolver, int compilation_id)
     : isolate_(isolate),
       api_method_name_(api_method_name),
@@ -2074,7 +2139,7 @@ AsyncCompileJob::AsyncCompileJob(
   native_context_ =
       isolate->global_handles()->Create(context->native_context());
   incumbent_context_ = isolate->global_handles()->Create(*incumbent_context);
-  DCHECK(native_context_->IsNativeContext());
+  DCHECK(IsNativeContext(*native_context_));
   context_id_ = isolate->GetOrRegisterRecorderContextId(native_context_);
   metrics_event_.async = true;
 }
@@ -2209,8 +2274,7 @@ class AsyncStreamingProcessor final : public StreamingProcessor {
  public:
   explicit AsyncStreamingProcessor(AsyncCompileJob* job);
 
-  bool ProcessModuleHeader(base::Vector<const uint8_t> bytes,
-                           uint32_t offset) override;
+  bool ProcessModuleHeader(base::Vector<const uint8_t> bytes) override;
 
   bool ProcessSection(SectionCode section_code,
                       base::Vector<const uint8_t> bytes,
@@ -2282,7 +2346,10 @@ AsyncCompileJob::~AsyncCompileJob() {
 void AsyncCompileJob::CreateNativeModule(
     std::shared_ptr<const WasmModule> module, size_t code_size_estimate) {
   // Embedder usage count for declared shared memories.
-  if (module->has_shared_memory) {
+  const bool has_shared_memory =
+      std::any_of(module->memories.begin(), module->memories.end(),
+                  [](auto& memory) { return memory.is_shared; });
+  if (has_shared_memory) {
     isolate_->CountUsage(v8::Isolate::UseCounterFeature::kWasmSharedMemory);
   }
 
@@ -2328,12 +2395,24 @@ void AsyncCompileJob::FinishCompile(bool is_after_cache_hit) {
   if (stream_) {
     stream_->NotifyNativeModuleCreated(native_module_);
   }
+  const WasmModule* module = native_module_->module();
+  auto compilation_state = Impl(native_module_->compilation_state());
+
+  // If experimental PGO via files is enabled, load profile information now that
+  // we have all wire bytes and know that the module is valid.
+  if (V8_UNLIKELY(v8_flags.experimental_wasm_pgo_from_file)) {
+    std::unique_ptr<ProfileInformation> pgo_info =
+        LoadProfileFromFile(module, native_module_->wire_bytes());
+    if (pgo_info) {
+      compilation_state->ApplyPgoInfoLate(pgo_info.get());
+    }
+  }
+
   bool is_after_deserialization = !module_object_.is_null();
   if (!is_after_deserialization) {
     PrepareRuntimeObjects();
   }
 
-  auto compilation_state = Impl(native_module_->compilation_state());
   // Measure duration of baseline compilation or deserialization from cache.
   if (base::TimeTicks::IsHighResolution()) {
     base::TimeDelta duration = base::TimeTicks::Now() - start_time_;
@@ -2359,11 +2438,10 @@ void AsyncCompileJob::FinishCompile(bool is_after_cache_hit) {
   DCHECK(!isolate_->context().is_null());
   // Finish the wasm script now and make it public to the debugger.
   Handle<Script> script(module_object_->script(), isolate_);
-  const WasmModule* module = module_object_->module();
-  if (script->type() == Script::TYPE_WASM &&
+  if (script->type() == Script::Type::kWasm &&
       module->debug_symbols.type == WasmDebugSymbols::Type::SourceMap &&
       !module->debug_symbols.external_url.is_empty()) {
-    ModuleWireBytes wire_bytes(module_object_->native_module()->wire_bytes());
+    ModuleWireBytes wire_bytes(native_module_->wire_bytes());
     MaybeHandle<String> src_map_str = isolate_->factory()->NewStringFromUtf8(
         wire_bytes.GetNameOrNull(module->debug_symbols.external_url),
         AllocationType::kOld);
@@ -2787,9 +2865,9 @@ AsyncStreamingProcessor::AsyncStreamingProcessor(AsyncCompileJob* job)
 
 // Process the module header.
 bool AsyncStreamingProcessor::ProcessModuleHeader(
-    base::Vector<const uint8_t> bytes, uint32_t offset) {
+    base::Vector<const uint8_t> bytes) {
   TRACE_STREAMING("Process module header...\n");
-  decoder_.DecodeModuleHeader(bytes, offset);
+  decoder_.DecodeModuleHeader(bytes);
   if (!decoder_.ok()) return false;
   prefix_hash_ = GetWireBytesHash(bytes);
   return true;
@@ -3101,7 +3179,11 @@ CompilationStateImpl::CompilationStateImpl(
       native_module_weak_(std::move(native_module)),
       async_counters_(std::move(async_counters)),
       compilation_unit_queues_(native_module->num_functions()),
-      dynamic_tiering_(dynamic_tiering) {}
+      dynamic_tiering_(dynamic_tiering) {
+  if (native_module->module()->memories.size() > 1) {
+    detected_features_.Add(kFeature_multi_memory);
+  }
+}
 
 void CompilationStateImpl::InitCompileJob() {
   DCHECK_NULL(baseline_compile_job_);
@@ -3223,6 +3305,61 @@ void CompilationStateImpl::ApplyPgoInfoToInitialProgress(
   }
 }
 
+void CompilationStateImpl::ApplyPgoInfoLate(ProfileInformation* pgo_info) {
+  TRACE_EVENT0("v8.wasm", "wasm.ApplyPgoInfo");
+  const WasmModule* module = native_module_->module();
+  CompilationUnitBuilder builder{native_module_};
+
+  base::MutexGuard guard(&callbacks_mutex_);
+  // Functions that were executed in the profiling run are eagerly compiled to
+  // Liftoff (in the background).
+  for (int func_index : pgo_info->executed_functions()) {
+    uint8_t& progress =
+        compilation_progress_[declared_function_index(module, func_index)];
+    ExecutionTier old_baseline_tier =
+        RequiredBaselineTierField::decode(progress);
+    // If the function is already marked for eager compilation, we are good.
+    if (old_baseline_tier != ExecutionTier::kNone) continue;
+
+    // If we already compiled Liftoff or TurboFan code, we are also good.
+    ExecutionTier reached_tier = ReachedTierField::decode(progress);
+    if (reached_tier >= ExecutionTier::kLiftoff) continue;
+
+    // Set the baseline tier to Liftoff and schedule a compilation unit.
+    progress =
+        RequiredBaselineTierField::update(progress, ExecutionTier::kLiftoff);
+    // Add this as a "top tier unit" since it does not contribute to initial
+    // compilation ("baseline finished" might already be triggered).
+    // TODO(clemensb): Rename "baseline finished" to "initial compile finished".
+    // TODO(clemensb): Avoid scheduling both a Liftoff and a TurboFan unit, or
+    // prioritize Liftoff when executing the units.
+    builder.AddTopTierUnit(func_index, ExecutionTier::kLiftoff);
+  }
+
+  // Functions that were tiered up during PGO generation are eagerly compiled to
+  // TurboFan in the background.
+  for (int func_index : pgo_info->tiered_up_functions()) {
+    uint8_t& progress =
+        compilation_progress_[declared_function_index(module, func_index)];
+    ExecutionTier old_baseline_tier =
+        RequiredBaselineTierField::decode(progress);
+    ExecutionTier old_top_tier = RequiredTopTierField::decode(progress);
+    // If the function is already marked for eager or background compilation to
+    // TurboFan, we are good.
+    if (old_baseline_tier == ExecutionTier::kTurbofan) continue;
+    if (old_top_tier == ExecutionTier::kTurbofan) continue;
+
+    // If we already compiled TurboFan code, we are also good.
+    ExecutionTier reached_tier = ReachedTierField::decode(progress);
+    if (reached_tier == ExecutionTier::kTurbofan) continue;
+
+    // Set top tier to TurboFan and schedule a compilation unit.
+    progress = RequiredTopTierField::update(progress, ExecutionTier::kTurbofan);
+    builder.AddTopTierUnit(func_index, ExecutionTier::kTurbofan);
+  }
+  builder.Commit();
+}
+
 void CompilationStateImpl::InitializeCompilationProgress(
     int num_import_wrappers, int num_export_wrappers,
     ProfileInformation* pgo_info) {
@@ -3335,10 +3472,6 @@ void CompilationStateImpl::InitializeCompilationProgressAfterDeserialization(
   }
 
   auto* module = native_module_->module();
-  base::Optional<CodeSpaceWriteScope> lazy_code_space_write_scope;
-  if (IsLazyModule(module) || !lazy_functions.empty()) {
-    lazy_code_space_write_scope.emplace(native_module_);
-  }
   {
     base::MutexGuard guard(&callbacks_mutex_);
     DCHECK(compilation_progress_.empty());
@@ -3392,7 +3525,9 @@ void CompilationStateImpl::InitializeCompilationProgressAfterDeserialization(
   }
   auto builder = std::make_unique<CompilationUnitBuilder>(native_module_);
   InitializeCompilationUnits(std::move(builder));
-  WaitForCompilationEvent(CompilationEvent::kFinishedBaselineCompilation);
+  if (!v8_flags.wasm_lazy_compilation) {
+    WaitForCompilationEvent(CompilationEvent::kFinishedBaselineCompilation);
+  }
 }
 
 void CompilationStateImpl::AddCallback(
@@ -3433,7 +3568,6 @@ void CompilationStateImpl::CommitCompilationUnits(
     compilation_unit_queues_.AddUnits(baseline_units, top_tier_units,
                                       native_module_->module());
   }
-  ResetPKUPermissionsForThreadSpawning pku_reset_scope;
   if (!baseline_units.empty()) {
     DCHECK(baseline_compile_job_->IsValid());
     baseline_compile_job_->NotifyConcurrencyIncrease();
@@ -3455,7 +3589,6 @@ void CompilationStateImpl::AddTopTierPriorityCompilationUnit(
   // We should not have a {CodeSpaceWriteScope} open at this point, as
   // {NotifyConcurrencyIncrease} can spawn new threads which could inherit PKU
   // permissions (which would be a security issue).
-  DCHECK(!CodeSpaceWriteScope::IsInScope());
   top_tier_compile_job_->NotifyConcurrencyIncrease();
 }
 
@@ -3477,17 +3610,16 @@ void CompilationStateImpl::FinalizeJSToWasmWrappers(Isolate* isolate,
 
   isolate->heap()->EnsureWasmCanonicalRttsSize(module->MaxCanonicalTypeIndex() +
                                                1);
-  CodePageCollectionMemoryModificationScope modification_scope(isolate->heap());
   for (auto& unit : js_to_wasm_wrapper_units_) {
     DCHECK_EQ(isolate, unit->isolate());
     // Note: The code is either the compiled signature-specific wrapper or the
     // generic wrapper built-in.
     Handle<Code> code = unit->Finalize();
-    uint32_t index =
-        GetExportWrapperIndex(unit->canonical_sig_index(), unit->is_import());
-    isolate->heap()->js_to_wasm_wrappers().Set(index,
-                                               MaybeObject::FromObject(*code));
     if (!code->is_builtin()) {
+      uint32_t index =
+          GetExportWrapperIndex(unit->canonical_sig_index(), unit->is_import());
+      isolate->heap()->js_to_wasm_wrappers()->Set(
+          index, MaybeObject::FromObject(*code));
       // Do not increase code stats for non-jitted wrappers.
       RecordStats(*code, isolate->counters());
       isolate->counters()->wasm_compiled_export_wrapper()->Increment(1);
@@ -3684,7 +3816,7 @@ void CompilationStateImpl::PublishCode(
   std::vector<WasmCode*> published_code =
       native_module_->PublishCode(std::move(code));
   // Defer logging code in case wire bytes were not fully received yet.
-  if (native_module_->HasWireBytes()) {
+  if (native_module_->log_code() && native_module_->HasWireBytes()) {
     GetWasmEngine()->LogCode(base::VectorOf(published_code));
   }
 
@@ -3692,32 +3824,34 @@ void CompilationStateImpl::PublishCode(
 }
 
 void CompilationStateImpl::SchedulePublishCompilationResults(
-    std::vector<std::unique_ptr<WasmCode>> unpublished_code) {
+    std::vector<std::unique_ptr<WasmCode>> unpublished_code,
+    CompilationTier tier) {
+  PublishState& state = publish_state_[tier];
   {
-    base::MutexGuard guard(&publish_mutex_);
-    if (publisher_running_) {
+    base::MutexGuard guard(&state.mutex_);
+    if (state.publisher_running_) {
       // Add new code to the queue and return.
-      publish_queue_.reserve(publish_queue_.size() + unpublished_code.size());
+      state.publish_queue_.reserve(state.publish_queue_.size() +
+                                   unpublished_code.size());
       for (auto& c : unpublished_code) {
-        publish_queue_.emplace_back(std::move(c));
+        state.publish_queue_.emplace_back(std::move(c));
       }
       return;
     }
-    publisher_running_ = true;
+    state.publisher_running_ = true;
   }
-  CodeSpaceWriteScope code_space_write_scope(native_module_);
   while (true) {
     PublishCompilationResults(std::move(unpublished_code));
     unpublished_code.clear();
 
     // Keep publishing new code that came in.
-    base::MutexGuard guard(&publish_mutex_);
-    DCHECK(publisher_running_);
-    if (publish_queue_.empty()) {
-      publisher_running_ = false;
+    base::MutexGuard guard(&state.mutex_);
+    DCHECK(state.publisher_running_);
+    if (state.publish_queue_.empty()) {
+      state.publisher_running_ = false;
       return;
     }
-    unpublished_code.swap(publish_queue_);
+    unpublished_code.swap(state.publish_queue_);
   }
 }
 
@@ -3808,7 +3942,8 @@ using JSToWasmWrapperUnitVector =
 
 class CompileJSToWasmWrapperJob final : public BaseCompileJSToWasmWrapperJob {
  public:
-  CompileJSToWasmWrapperJob(JSToWasmWrapperUnitVector* compilation_units)
+  explicit CompileJSToWasmWrapperJob(
+      JSToWasmWrapperUnitVector* compilation_units)
       : BaseCompileJSToWasmWrapperJob(compilation_units->size()),
         compilation_units_(compilation_units) {}
 
@@ -3848,9 +3983,9 @@ void CompileJsToWasmWrappers(Isolate* isolate, const WasmModule* module) {
     int wrapper_index =
         GetExportWrapperIndex(canonical_type_index, function.imported);
     MaybeObject existing_wrapper =
-        isolate->heap()->js_to_wasm_wrappers().Get(wrapper_index);
+        isolate->heap()->js_to_wasm_wrappers()->Get(wrapper_index);
     if (existing_wrapper.IsStrongOrWeak() &&
-        !existing_wrapper.GetHeapObject().IsUndefined()) {
+        !IsUndefined(existing_wrapper.GetHeapObject())) {
       continue;
     }
 
@@ -3887,16 +4022,15 @@ void CompileJsToWasmWrappers(Isolate* isolate, const WasmModule* module) {
   // optimization we create a code memory modification scope that avoids
   // changing the page permissions back-and-forth between RWX and RX, because
   // many such wrapper are allocated in sequence below.
-  CodePageCollectionMemoryModificationScope modification_scope(isolate->heap());
   for (auto& pair : compilation_units) {
     JSToWasmWrapperKey key = pair.first;
     JSToWasmWrapperCompilationUnit* unit = pair.second.get();
     DCHECK_EQ(isolate, unit->isolate());
     Handle<Code> code = unit->Finalize();
-    int wrapper_index = GetExportWrapperIndex(key.second, key.first);
-    isolate->heap()->js_to_wasm_wrappers().Set(
-        wrapper_index, HeapObjectReference::Strong(*code));
     if (!code->is_builtin()) {
+      int wrapper_index = GetExportWrapperIndex(key.second, key.first);
+      isolate->heap()->js_to_wasm_wrappers()->Set(
+          wrapper_index, HeapObjectReference::Strong(*code));
       // Do not increase code stats for non-jitted wrappers.
       RecordStats(*code, isolate->counters());
       isolate->counters()->wasm_compiled_export_wrapper()->Increment(1);
@@ -3920,17 +4054,14 @@ WasmCode* CompileImportWrapper(
   CompilationEnv env = native_module->CreateCompilationEnv();
   WasmCompilationResult result = compiler::CompileWasmImportCallWrapper(
       &env, kind, sig, source_positions, expected_arity, suspend);
-  WasmCode* published_code;
-  {
-    CodeSpaceWriteScope code_space_write_scope(native_module);
-    std::unique_ptr<WasmCode> wasm_code = native_module->AddCode(
-        result.func_index, result.code_desc, result.frame_slot_count,
-        result.tagged_parameter_slots,
-        result.protected_instructions_data.as_vector(),
-        result.source_positions.as_vector(), GetCodeKind(result),
-        ExecutionTier::kNone, kNotForDebugging);
-    published_code = native_module->PublishCode(std::move(wasm_code));
-  }
+
+  std::unique_ptr<WasmCode> wasm_code = native_module->AddCode(
+      result.func_index, result.code_desc, result.frame_slot_count,
+      result.tagged_parameter_slots,
+      result.protected_instructions_data.as_vector(),
+      result.source_positions.as_vector(), GetCodeKind(result),
+      ExecutionTier::kNone, kNotForDebugging);
+  WasmCode* published_code = native_module->PublishCode(std::move(wasm_code));
   (*cache_scope)[key] = published_code;
   published_code->IncRef();
   counters->wasm_generated_code_size()->Increment(
diff --git a/deps/v8/src/wasm/module-compiler.h b/deps/v8/src/wasm/module-compiler.h
index e984ad436cad2f..0921bcc9aab7c7 100644
--- a/deps/v8/src/wasm/module-compiler.h
+++ b/deps/v8/src/wasm/module-compiler.h
@@ -76,7 +76,7 @@ WasmCode* CompileImportWrapper(
 // Triggered by the WasmCompileLazy builtin. The return value indicates whether
 // compilation was successful. Lazy compilation can fail only if validation is
 // also lazy.
-bool CompileLazy(Isolate*, WasmInstanceObject, int func_index);
+bool CompileLazy(Isolate*, Tagged<WasmInstanceObject>, int func_index);
 
 // Throws the compilation error after failed lazy compilation.
 void ThrowLazyCompilationError(Isolate* isolate,
@@ -85,10 +85,10 @@ void ThrowLazyCompilationError(Isolate* isolate,
 
 // Trigger tier-up of a particular function to TurboFan. If tier-up was already
 // triggered, we instead increase the priority with exponential back-off.
-V8_EXPORT_PRIVATE void TriggerTierUp(WasmInstanceObject instance,
+V8_EXPORT_PRIVATE void TriggerTierUp(Tagged<WasmInstanceObject> instance,
                                      int func_index);
 // Synchronous version of the above.
-void TierUpNowForTesting(Isolate* isolate, WasmInstanceObject instance,
+void TierUpNowForTesting(Isolate* isolate, Tagged<WasmInstanceObject> instance,
                          int func_index);
 
 template <typename Key, typename KeyInfo, typename Hash>
@@ -136,7 +136,8 @@ class AsyncCompileJob {
  public:
   AsyncCompileJob(Isolate* isolate, WasmFeatures enabled_features,
                   base::OwnedVector<const uint8_t> bytes,
-                  Handle<Context> context, Handle<Context> incumbent_context,
+                  Handle<Context> context,
+                  Handle<NativeContext> incumbent_context,
                   const char* api_method_name,
                   std::shared_ptr<CompilationResultResolver> resolver,
                   int compilation_id);
@@ -277,7 +278,7 @@ class AsyncCompileJob {
   // {native_module_}).
   ModuleWireBytes wire_bytes_;
   Handle<NativeContext> native_context_;
-  Handle<Context> incumbent_context_;
+  Handle<NativeContext> incumbent_context_;
   v8::metrics::Recorder::ContextId context_id_;
   v8::metrics::WasmModuleDecoded metrics_event_;
   const std::shared_ptr<CompilationResultResolver> resolver_;
diff --git a/deps/v8/src/wasm/module-decoder-impl.h b/deps/v8/src/wasm/module-decoder-impl.h
index 9396fe11d6d73b..97554288b55d16 100644
--- a/deps/v8/src/wasm/module-decoder-impl.h
+++ b/deps/v8/src/wasm/module-decoder-impl.h
@@ -71,7 +71,7 @@ inline WireBytesRef consume_string(Decoder* decoder,
     tracer->NextLine();
   }
   uint32_t offset = decoder->pc_offset();
-  const byte* string_start = decoder->pc();
+  const uint8_t* string_start = decoder->pc();
   // Consume bytes before validation to guarantee that the string is not oob.
   if (length > 0) {
     if (tracer) {
@@ -121,7 +121,7 @@ inline SectionCode IdentifyUnknownSectionInternal(Decoder* decoder,
   if (decoder->failed()) {
     return kUnknownSectionCode;
   }
-  const byte* section_name_start =
+  const uint8_t* section_name_start =
       decoder->start() + decoder->GetBufferRelativeOffset(string.offset());
 
   TRACE("  +%d  section name        : \"%.*s\"\n",
@@ -167,7 +167,7 @@ class WasmSectionIterator {
 
   SectionCode section_code() const { return section_code_; }
 
-  const byte* section_start() const { return section_start_; }
+  const uint8_t* section_start() const { return section_start_; }
 
   uint32_t section_length() const {
     return static_cast<uint32_t>(section_end_ - section_start_);
@@ -177,13 +177,13 @@ class WasmSectionIterator {
     return {payload_start_, payload_length()};
   }
 
-  const byte* payload_start() const { return payload_start_; }
+  const uint8_t* payload_start() const { return payload_start_; }
 
   uint32_t payload_length() const {
     return static_cast<uint32_t>(section_end_ - payload_start_);
   }
 
-  const byte* section_end() const { return section_end_; }
+  const uint8_t* section_end() const { return section_end_; }
 
   // Advances to the next section, checking that decoding the current section
   // stopped at {section_end_}.
@@ -207,9 +207,9 @@ class WasmSectionIterator {
   Decoder* decoder_;
   ITracer* tracer_;
   SectionCode section_code_;
-  const byte* section_start_;
-  const byte* payload_start_;
-  const byte* section_end_;
+  const uint8_t* section_start_;
+  const uint8_t* payload_start_;
+  const uint8_t* section_end_;
 
   // Reads the section code/name at the current position and sets up
   // the embedder fields.
@@ -250,7 +250,7 @@ class WasmSectionIterator {
       // To identify the unknown section we set the end of the decoder bytes to
       // the end of the custom section, so that we do not read the section name
       // beyond the end of the section.
-      const byte* module_end = decoder_->end();
+      const uint8_t* module_end = decoder_->end();
       decoder_->set_end(section_end_);
       section_code = IdentifyUnknownSectionInternal(decoder_, tracer_);
       if (decoder_->ok()) decoder_->set_end(module_end);
@@ -272,54 +272,57 @@ class WasmSectionIterator {
   }
 };
 
+inline void DumpModule(const base::Vector<const uint8_t> module_bytes,
+                       bool ok) {
+  std::string path;
+  if (v8_flags.dump_wasm_module_path) {
+    path = v8_flags.dump_wasm_module_path;
+    if (path.size() && !base::OS::isDirectorySeparator(path[path.size() - 1])) {
+      path += base::OS::DirectorySeparator();
+    }
+  }
+  // File are named `<hash>.{ok,failed}.wasm`.
+  // Limit the hash to 8 characters (32 bits).
+  uint32_t hash = static_cast<uint32_t>(GetWireBytesHash(module_bytes));
+  base::EmbeddedVector<char, 32> buf;
+  SNPrintF(buf, "%08x.%s.wasm", hash, ok ? "ok" : "failed");
+  path += buf.begin();
+  size_t rv = 0;
+  if (FILE* file = base::OS::FOpen(path.c_str(), "wb")) {
+    rv = fwrite(module_bytes.begin(), module_bytes.length(), 1, file);
+    base::Fclose(file);
+  }
+  if (rv != 1) {
+    OFStream os(stderr);
+    os << "Error while dumping wasm file to " << path << std::endl;
+  }
+}
+
 // The main logic for decoding the bytes of a module.
 class ModuleDecoderImpl : public Decoder {
  public:
   ModuleDecoderImpl(WasmFeatures enabled_features,
                     base::Vector<const uint8_t> wire_bytes, ModuleOrigin origin,
+                    PopulateExplicitRecGroups populate_explicit_rec_groups =
+                        kDoNotPopulateExplicitRecGroups,
                     ITracer* tracer = ITracer::NoTrace)
       : Decoder(wire_bytes),
         enabled_features_(enabled_features),
         module_(std::make_shared<WasmModule>(origin)),
         module_start_(wire_bytes.begin()),
         module_end_(wire_bytes.end()),
+        populate_explicit_rec_groups_(populate_explicit_rec_groups),
         tracer_(tracer) {}
 
   void onFirstError() override {
     pc_ = end_;  // On error, terminate section decoding loop.
   }
 
-  void DumpModule(const base::Vector<const byte> module_bytes) {
-    std::string path;
-    if (v8_flags.dump_wasm_module_path) {
-      path = v8_flags.dump_wasm_module_path;
-      if (path.size() &&
-          !base::OS::isDirectorySeparator(path[path.size() - 1])) {
-        path += base::OS::DirectorySeparator();
-      }
-    }
-    // File are named `<hash>.{ok,failed}.wasm`.
-    // Limit the hash to 8 characters (32 bits).
-    uint32_t hash = static_cast<uint32_t>(GetWireBytesHash(module_bytes));
-    base::EmbeddedVector<char, 32> buf;
-    SNPrintF(buf, "%08x.%s.wasm", hash, ok() ? "ok" : "failed");
-    path += buf.begin();
-    size_t rv = 0;
-    if (FILE* file = base::OS::FOpen(path.c_str(), "wb")) {
-      rv = fwrite(module_bytes.begin(), module_bytes.length(), 1, file);
-      base::Fclose(file);
-    }
-    if (rv != 1) {
-      OFStream os(stderr);
-      os << "Error while dumping wasm file to " << path << std::endl;
-    }
-  }
-
-  void DecodeModuleHeader(base::Vector<const uint8_t> bytes, uint8_t offset) {
+  void DecodeModuleHeader(base::Vector<const uint8_t> bytes) {
     if (failed()) return;
-    Reset(bytes, offset);
+    Reset(bytes);
 
-    const byte* pos = pc_;
+    const uint8_t* pos = pc_;
     uint32_t magic_word = consume_u32("wasm magic", tracer_);
     if (tracer_) tracer_->NextLine();
 #define BYTES(x) (x & 0xFF), (x >> 8) & 0xFF, (x >> 16) & 0xFF, (x >> 24) & 0xFF
@@ -660,6 +663,10 @@ class ModuleDecoderImpl : public Decoder {
                  kV8MaxWasmTypes);
           return;
         }
+        if (populate_explicit_rec_groups_ == kPopulateExplicitRecGroups) {
+          module_->explicit_recursive_type_groups.emplace(
+              static_cast<uint32_t>(module_->types.size()), group_size);
+        }
         // We need to resize types before decoding the type definitions in this
         // group, so that the correct type size is visible to type definitions.
         module_->types.resize(initial_size + group_size);
@@ -674,6 +681,10 @@ class ModuleDecoderImpl : public Decoder {
           type_canon->AddRecursiveGroup(module_.get(), group_size,
                                         static_cast<uint32_t>(initial_size));
         }
+        if (tracer_) {
+          tracer_->Description("end of rec. group");
+          tracer_->NextLine();
+        }
       } else {
         if (tracer_) tracer_->TypeOffset(pc_offset());
         // Similarly to above, we need to resize types for a group of size 1.
@@ -687,7 +698,8 @@ class ModuleDecoderImpl : public Decoder {
       }
     }
 
-    // Check validity of explicitly defined supertypes.
+    // Check validity of explicitly defined supertypes and propagate subtyping
+    // depth.
     const WasmModule* module = module_.get();
     for (uint32_t i = 0; ok() && i < module_->types.size(); ++i) {
       uint32_t explicit_super = module_->supertype(i);
@@ -700,9 +712,10 @@ class ModuleDecoderImpl : public Decoder {
         errorf("type %u: forward-declared supertype %u", i, explicit_super);
         continue;
       }
-      int depth = GetSubtypingDepth(module, i);
+      uint32_t depth = module->types[explicit_super].subtyping_depth + 1;
+      module_->types[i].subtyping_depth = depth;
       DCHECK_GE(depth, 0);
-      if (depth > static_cast<int>(kV8MaxRttSubtypingDepth)) {
+      if (depth > kV8MaxRttSubtypingDepth) {
         errorf("type %u: subtyping depth is greater than allowed", i);
         continue;
       }
@@ -735,7 +748,7 @@ class ModuleDecoderImpl : public Decoder {
           0                   // index
       });
       WasmImport* import = &module_->import_table.back();
-      const byte* pos = pc_;
+      const uint8_t* pos = pc_;
       import->module_name = consume_utf8_string(this, "module name", tracer_);
       import->field_name = consume_utf8_string(this, "field name", tracer_);
       import->kind =
@@ -765,7 +778,7 @@ class ModuleDecoderImpl : public Decoder {
           module_->tables.emplace_back();
           WasmTable* table = &module_->tables.back();
           table->imported = true;
-          const byte* type_position = pc();
+          const uint8_t* type_position = pc();
           ValueType type = consume_value_type();
           if (!type.is_object_reference()) {
             errorf(type_position, "Invalid table type %s", type.name().c_str());
@@ -782,16 +795,37 @@ class ModuleDecoderImpl : public Decoder {
         }
         case kExternalMemory: {
           // ===== Imported memory =============================================
-          if (!AddMemory(module_.get())) break;
-          consume_memory_flags(&module_->has_shared_memory,
-                               &module_->is_memory64,
-                               &module_->has_maximum_pages);
-          uint32_t max_pages = module_->is_memory64 ? kSpecMaxMemory64Pages
-                                                    : kSpecMaxMemory32Pages;
+          static_assert(kV8MaxWasmMemories <= kMaxUInt32);
+          if (!enabled_features_.has_multi_memory()) {
+            if (!module_->memories.empty()) {
+              error(
+                  "At most one imported memory is supported (pass "
+                  "--experimental-wasm-multi-memory to allow more "
+                  "memories)");
+              break;
+            }
+          } else if (module_->memories.size() >= kV8MaxWasmMemories - 1) {
+            errorf("At most %u imported memories are supported",
+                   kV8MaxWasmMemories);
+            break;
+          }
+          uint32_t mem_index = static_cast<uint32_t>(module_->memories.size());
+          import->index = mem_index;
+          module_->memories.emplace_back();
+          WasmMemory* external_memory = &module_->memories.back();
+          external_memory->index = mem_index;
+
+          consume_memory_flags(&external_memory->is_shared,
+                               &external_memory->is_memory64,
+                               &external_memory->has_maximum_pages);
+          uint32_t max_pages = external_memory->is_memory64
+                                   ? kSpecMaxMemory64Pages
+                                   : kSpecMaxMemory32Pages;
           consume_resizable_limits(
-              "memory", "pages", max_pages, &module_->initial_pages,
-              module_->has_maximum_pages, max_pages, &module_->maximum_pages,
-              module_->is_memory64 ? k64BitLimits : k32BitLimits);
+              "memory", "pages", max_pages, &external_memory->initial_pages,
+              external_memory->has_maximum_pages, max_pages,
+              &external_memory->maximum_pages,
+              external_memory->is_memory64 ? k64BitLimits : k32BitLimits);
           break;
         }
         case kExternalGlobal: {
@@ -823,7 +857,7 @@ class ModuleDecoderImpl : public Decoder {
           break;
       }
     }
-    UpdateMemorySizes();
+    UpdateComputedMemoryInformation();
     module_->type_feedback.well_known_imports.Initialize(
         module_->num_imported_functions);
     if (tracer_) tracer_->ImportsDone();
@@ -866,26 +900,33 @@ class ModuleDecoderImpl : public Decoder {
       if (tracer_) tracer_->TableOffset(pc_offset());
       module_->tables.emplace_back();
       WasmTable* table = &module_->tables.back();
-      const byte* type_position = pc();
+      const uint8_t* type_position = pc();
 
       bool has_initializer = false;
       if (enabled_features_.has_typed_funcref() &&
           read_u8<Decoder::FullValidationTag>(
               pc(), "table-with-initializer byte") == 0x40) {
-        consume_bytes(1, "table-with-initializer byte");
+        consume_bytes(1, "with-initializer ", tracer_);
         has_initializer = true;
+        type_position++;
+        uint8_t reserved = consume_u8("reserved-byte", tracer_);
+        if (reserved != 0) {
+          error(type_position, "Reserved byte must be 0x00");
+          break;
+        }
+        type_position++;
       }
 
       ValueType table_type = consume_value_type();
       if (!table_type.is_object_reference()) {
         error(type_position, "Only reference types can be used as table types");
-        continue;
+        break;
       }
       if (!has_initializer && !table_type.is_defaultable()) {
         errorf(type_position,
                "Table of non-defaultable table %s needs initial value",
                table_type.name().c_str());
-        continue;
+        break;
       }
       table->type = table_type;
 
@@ -903,34 +944,52 @@ class ModuleDecoderImpl : public Decoder {
   }
 
   void DecodeMemorySection() {
+    const uint8_t* mem_count_pc = pc();
+    static_assert(kV8MaxWasmMemories <= kMaxUInt32);
+    // Use {kV8MaxWasmMemories} here, but only allow for >1 memory if
+    // multi-memory is enabled (checked below). This allows for better error
+    // messages.
     uint32_t memory_count = consume_count("memory count", kV8MaxWasmMemories);
+    size_t imported_memories = module_->memories.size();
+    if (enabled_features_.has_multi_memory()) {
+      DCHECK_GE(kV8MaxWasmMemories, imported_memories);
+      if (memory_count > kV8MaxWasmMemories - imported_memories) {
+        errorf(mem_count_pc,
+               "Exceeding maximum number of memories (%u; declared %u, "
+               "imported %zu)",
+               kV8MaxWasmMemories, memory_count, imported_memories);
+      }
+    } else {
+      DCHECK_GE(1, imported_memories);
+      if (imported_memories + memory_count > 1) {
+        errorf(mem_count_pc,
+               "At most one memory is supported (declared %u, imported %zu); "
+               "pass --experimental-wasm-multi-memory to allow more memories",
+               memory_count, imported_memories);
+      }
+    }
+    module_->memories.resize(imported_memories + memory_count);
 
     for (uint32_t i = 0; ok() && i < memory_count; i++) {
+      WasmMemory* memory = module_->memories.data() + imported_memories + i;
+      memory->index = static_cast<uint32_t>(imported_memories + i);
       if (tracer_) tracer_->MemoryOffset(pc_offset());
-      if (!AddMemory(module_.get())) break;
-      consume_memory_flags(&module_->has_shared_memory, &module_->is_memory64,
-                           &module_->has_maximum_pages);
+      consume_memory_flags(&memory->is_shared, &memory->is_memory64,
+                           &memory->has_maximum_pages);
       uint32_t max_pages =
-          module_->is_memory64 ? kSpecMaxMemory64Pages : kSpecMaxMemory32Pages;
+          memory->is_memory64 ? kSpecMaxMemory64Pages : kSpecMaxMemory32Pages;
       consume_resizable_limits(
-          "memory", "pages", max_pages, &module_->initial_pages,
-          module_->has_maximum_pages, max_pages, &module_->maximum_pages,
-          module_->is_memory64 ? k64BitLimits : k32BitLimits);
+          "memory", "pages", max_pages, &memory->initial_pages,
+          memory->has_maximum_pages, max_pages, &memory->maximum_pages,
+          memory->is_memory64 ? k64BitLimits : k32BitLimits);
     }
-    UpdateMemorySizes();
+    UpdateComputedMemoryInformation();
   }
 
-  void UpdateMemorySizes() {
-    // Set min and max memory size.
-    const uintptr_t platform_max_pages = module_->is_memory64
-                                             ? kV8MaxWasmMemory64Pages
-                                             : kV8MaxWasmMemory32Pages;
-    module_->min_memory_size =
-        std::min(platform_max_pages, uintptr_t{module_->initial_pages}) *
-        kWasmPageSize;
-    module_->max_memory_size =
-        std::min(platform_max_pages, uintptr_t{module_->maximum_pages}) *
-        kWasmPageSize;
+  void UpdateComputedMemoryInformation() {
+    for (WasmMemory& memory : module_->memories) {
+      UpdateComputedInformation(&memory, module_->origin);
+    }
   }
 
   void DecodeGlobalSection() {
@@ -972,7 +1031,7 @@ class ModuleDecoderImpl : public Decoder {
 
       exp->name = consume_utf8_string(this, "field name", tracer_);
 
-      const byte* pos = pc();
+      const uint8_t* pos = pc();
       exp->kind =
           static_cast<ImportExportKindCode>(consume_u8("kind: ", tracer_));
       if (tracer_) {
@@ -1000,13 +1059,14 @@ class ModuleDecoderImpl : public Decoder {
           break;
         }
         case kExternalMemory: {
-          uint32_t index = consume_u32v("memory index", tracer_);
-          // TODO(titzer): This should become more regular
-          // once we support multiple memories.
-          if (!module_->has_memory || index != 0) {
-            error("invalid memory index != 0");
+          exp->index = consume_u32v("memory index", tracer_);
+          size_t num_memories = module_->memories.size();
+          if (exp->index >= module_->memories.size()) {
+            errorf(pos, "invalid exported memory index %u (having %zu memor%s)",
+                   exp->index, num_memories, num_memories == 1 ? "y" : "ies");
+            break;
           }
-          module_->mem_export = true;
+          module_->memories[exp->index].exported = true;
           break;
         }
         case kExternalGlobal: {
@@ -1038,8 +1098,10 @@ class ModuleDecoderImpl : public Decoder {
         if (a.name.length() != b.name.length()) {
           return a.name.length() < b.name.length();
         }
-        const byte* left = start() + GetBufferRelativeOffset(a.name.offset());
-        const byte* right = start() + GetBufferRelativeOffset(b.name.offset());
+        const uint8_t* left =
+            start() + GetBufferRelativeOffset(a.name.offset());
+        const uint8_t* right =
+            start() + GetBufferRelativeOffset(b.name.offset());
         return memcmp(left, right, a.name.length()) < 0;
       };
       std::stable_sort(sorted_exports.begin(), sorted_exports.end(), cmp_less);
@@ -1049,7 +1111,8 @@ class ModuleDecoderImpl : public Decoder {
       for (auto end = sorted_exports.end(); it != end; last = &*it++) {
         DCHECK(!cmp_less(*it, *last));  // Vector must be sorted.
         if (!cmp_less(*last, *it)) {
-          const byte* pc = start() + GetBufferRelativeOffset(it->name.offset());
+          const uint8_t* pc =
+              start() + GetBufferRelativeOffset(it->name.offset());
           TruncatedUserString<> name(pc, it->name.length());
           errorf(pc, "Duplicate export name '%.*s' for %s %d and %s %d",
                  name.length(), name.start(), ExternalKindName(last->kind),
@@ -1063,7 +1126,7 @@ class ModuleDecoderImpl : public Decoder {
   void DecodeStartSection() {
     if (tracer_) tracer_->StartOffset(pc_offset());
     WasmFunction* func;
-    const byte* pos = pc_;
+    const uint8_t* pos = pc_;
     module_->start_function_index = consume_func_index(module_.get(), &func);
     if (tracer_) tracer_->NextLine();
     if (func &&
@@ -1115,7 +1178,7 @@ class ModuleDecoderImpl : public Decoder {
         tracer_->FunctionName(function_index);
         tracer_->NextLine();
       }
-      const byte* pos = pc();
+      const uint8_t* pos = pc();
       uint32_t size = consume_u32v("body size", tracer_);
       if (tracer_) {
         tracer_->Description(size);
@@ -1197,8 +1260,7 @@ class ModuleDecoderImpl : public Decoder {
     if (!CheckDataSegmentsCount(data_segments_count)) return;
 
     module_->data_segments.reserve(data_segments_count);
-    for (uint32_t i = 0; ok() && i < data_segments_count; ++i) {
-      const byte* pos = pc();
+    for (uint32_t i = 0; i < data_segments_count; ++i) {
       TRACE("DecodeDataSegment[%d] module+%d\n", i,
             static_cast<int>(pc_ - start_));
       if (tracer_) tracer_->DataOffset(pc_offset());
@@ -1206,19 +1268,8 @@ class ModuleDecoderImpl : public Decoder {
       bool is_active;
       uint32_t memory_index;
       ConstantExpression dest_addr;
-      consume_data_segment_header(&is_active, &memory_index, &dest_addr);
-      if (failed()) break;
-
-      if (is_active) {
-        if (!module_->has_memory) {
-          error("cannot load data without memory");
-          break;
-        }
-        if (memory_index != 0) {
-          errorf(pos, "illegal memory index %u != 0", memory_index);
-          break;
-        }
-      }
+      std::tie(is_active, memory_index, dest_addr) =
+          consume_data_segment_header();
 
       uint32_t source_length = consume_u32v("source size", tracer_);
       if (tracer_) {
@@ -1227,23 +1278,17 @@ class ModuleDecoderImpl : public Decoder {
       }
       uint32_t source_offset = pc_offset();
 
-      if (is_active) {
-        module_->data_segments.emplace_back(std::move(dest_addr));
-      } else {
-        module_->data_segments.emplace_back();
-      }
-
-      WasmDataSegment* segment = &module_->data_segments.back();
-
       if (tracer_) {
         tracer_->Bytes(pc_, source_length);
         tracer_->Description("segment data");
         tracer_->NextLine();
       }
       consume_bytes(source_length, "segment data");
-      if (failed()) break;
 
-      segment->source = {source_offset, source_length};
+      if (failed()) break;
+      module_->data_segments.emplace_back(
+          is_active, memory_index, dest_addr,
+          WireBytesRef{source_offset, source_length});
     }
   }
 
@@ -1579,6 +1624,7 @@ class ModuleDecoderImpl : public Decoder {
     for (uint32_t i = 0; ok() && i < immediate; ++i) {
       TRACE("DecodeStringLiteral[%d] module+%d\n", i,
             static_cast<int>(pc_ - start_));
+      if (tracer_) tracer_->StringOffset(pc_offset());
       // TODO(12868): Throw if the string's utf-16 length > String::kMaxLength.
       WireBytesRef pos = wasm::consume_string(this, unibrow::Utf8Variant::kWtf8,
                                               "string literal", tracer_);
@@ -1621,57 +1667,56 @@ class ModuleDecoderImpl : public Decoder {
     return toResult(std::move(module_));
   }
 
-  void ValidateAllFunctions() {
-    DCHECK(!error_.has_error());
-    // Pass nullptr for an "empty" filter function.
-    error_ = ValidateFunctions(module_.get(), enabled_features_,
-                               base::VectorOf(start_, end_ - start_), nullptr);
-  }
-
   // Decodes an entire module.
   ModuleResult DecodeModule(bool validate_functions) {
-    base::Vector<const byte> wire_bytes(start_, end_ - start_);
+    // Keep a reference to the wire bytes, in case this decoder gets reset on
+    // error.
+    base::Vector<const uint8_t> wire_bytes(start_, end_ - start_);
     size_t max_size = max_module_size();
     if (wire_bytes.size() > max_size) {
       return ModuleResult{WasmError{0, "size > maximum module size (%zu): %zu",
                                     max_size, wire_bytes.size()}};
     }
 
-    uint32_t offset = 0;
-    DecodeModuleHeader(wire_bytes, offset);
+    DecodeModuleHeader(wire_bytes);
     if (failed()) return toResult(nullptr);
 
-    // Size of the module header.
-    offset += 8;
-    Decoder decoder(start_ + offset, end_, offset);
-
-    WasmSectionIterator section_iter(&decoder, tracer_);
+    static constexpr uint32_t kWasmHeaderSize = 8;
+    Decoder section_iterator_decoder(start_ + kWasmHeaderSize, end_,
+                                     kWasmHeaderSize);
+    WasmSectionIterator section_iter(&section_iterator_decoder, tracer_);
 
     while (ok()) {
-      // Shift the offset by the section header length.
-      offset += section_iter.payload_start() - section_iter.section_start();
       if (section_iter.section_code() != SectionCode::kUnknownSectionCode) {
+        uint32_t offset = static_cast<uint32_t>(section_iter.payload().begin() -
+                                                wire_bytes.begin());
         DecodeSection(section_iter.section_code(), section_iter.payload(),
                       offset);
+        if (!ok()) break;
       }
-      // Shift the offset by the remaining section payload.
-      offset += section_iter.payload_length();
-      if (!section_iter.more() || !ok()) break;
+      if (!section_iter.more()) break;
       section_iter.advance(true);
     }
 
-    if (ok() && validate_functions) {
-      Reset(wire_bytes);
-      ValidateAllFunctions();
+    // Check for module structure errors before validating function bodies, to
+    // produce consistent error message independent of whether validation
+    // happens here or later.
+    if (section_iterator_decoder.failed()) {
+      return section_iterator_decoder.toResult(nullptr);
     }
 
-    if (v8_flags.dump_wasm_module) DumpModule(wire_bytes);
-
-    if (decoder.failed()) {
-      return decoder.toResult(nullptr);
+    ModuleResult result = FinishDecoding();
+    if (!result.failed() && validate_functions) {
+      // Pass nullptr for an "empty" filter function.
+      if (WasmError validation_error = ValidateFunctions(
+              module_.get(), enabled_features_, wire_bytes, nullptr)) {
+        result = ModuleResult{validation_error};
+      }
     }
 
-    return FinishDecoding();
+    if (v8_flags.dump_wasm_module) DumpModule(wire_bytes, result.ok());
+
+    return result;
   }
 
   // Decodes a single anonymous function starting at {start_}.
@@ -1699,7 +1744,7 @@ class ModuleDecoderImpl : public Decoder {
   }
 
   // Decodes a single function signature at {start}.
-  const FunctionSig* DecodeFunctionSignature(Zone* zone, const byte* start) {
+  const FunctionSig* DecodeFunctionSignature(Zone* zone, const uint8_t* start) {
     pc_ = start;
     if (!expect_u8("type form", kWasmFunctionTypeCode)) return nullptr;
     const FunctionSig* result = consume_sig(zone);
@@ -1733,20 +1778,10 @@ class ModuleDecoderImpl : public Decoder {
     seen_unordered_sections_ |= 1 << section_code;
   }
 
-  uint32_t off(const byte* ptr) {
+  uint32_t off(const uint8_t* ptr) {
     return static_cast<uint32_t>(ptr - start_) + buffer_offset_;
   }
 
-  bool AddMemory(WasmModule* module) {
-    if (module->has_memory) {
-      error("At most one memory is supported");
-      return false;
-    } else {
-      module->has_memory = true;
-      return true;
-    }
-  }
-
   // Calculate individual global offsets and total size of globals table. This
   // function should be called after all globals have been defined, which is
   // after the import section and the global section, but before the global
@@ -1782,7 +1817,7 @@ class ModuleDecoderImpl : public Decoder {
   }
 
   uint32_t consume_sig_index(WasmModule* module, const FunctionSig** sig) {
-    const byte* pos = pc_;
+    const uint8_t* pos = pc_;
     uint32_t sig_index = consume_u32v("signature index");
     if (tracer_) tracer_->Bytes(pos, static_cast<uint32_t>(pc_ - pos));
     if (!module->has_signature(sig_index)) {
@@ -1801,7 +1836,7 @@ class ModuleDecoderImpl : public Decoder {
   }
 
   uint32_t consume_tag_sig_index(WasmModule* module, const FunctionSig** sig) {
-    const byte* pos = pc_;
+    const uint8_t* pos = pc_;
     uint32_t sig_index = consume_sig_index(module, sig);
     if (*sig && (*sig)->return_count() != 0) {
       errorf(pos, "tag signature %u has non-void return", sig_index);
@@ -1812,7 +1847,7 @@ class ModuleDecoderImpl : public Decoder {
   }
 
   uint32_t consume_count(const char* name, size_t maximum) {
-    const byte* p = pc_;
+    const uint8_t* p = pc_;
     uint32_t count = consume_u32v(name, tracer_);
     if (tracer_) {
       tracer_->Description(count);
@@ -1847,7 +1882,7 @@ class ModuleDecoderImpl : public Decoder {
 
   template <typename T>
   uint32_t consume_index(const char* name, std::vector<T>* vector, T** ptr) {
-    const byte* pos = pc_;
+    const uint8_t* pos = pc_;
     uint32_t index = consume_u32v("index:", tracer_);
     if (tracer_) tracer_->Description(index);
     if (index >= vector->size()) {
@@ -1920,7 +1955,7 @@ class ModuleDecoderImpl : public Decoder {
                                 uint32_t max_initial, uint32_t* initial,
                                 bool has_maximum, uint32_t max_maximum,
                                 uint32_t* maximum, ResizableLimitsType type) {
-    const byte* pos = pc();
+    const uint8_t* pos = pc();
     // Note that even if we read the values as 64-bit value, all V8 limits are
     // still within uint32_t range.
     uint64_t initial_64 = type == k64BitLimits
@@ -1965,7 +2000,7 @@ class ModuleDecoderImpl : public Decoder {
 
   // Consumes a byte, and emits an error if it does not equal {expected}.
   bool expect_u8(const char* name, uint8_t expected) {
-    const byte* pos = pc();
+    const uint8_t* pos = pc();
     uint8_t value = consume_u8(name);
     if (value != expected) {
       errorf(pos, "expected %s 0x%02x, got 0x%02x", name, expected, value);
@@ -2090,7 +2125,7 @@ class ModuleDecoderImpl : public Decoder {
   // Read a mutability flag
   bool consume_mutability() {
     if (tracer_) tracer_->Bytes(pc_, 1);
-    byte val = consume_u8("mutability");
+    uint8_t val = consume_u8("mutability");
     if (tracer_) {
       tracer_->Description(val == 0   ? " immutable"
                            : val == 1 ? " mutable"
@@ -2158,7 +2193,8 @@ class ModuleDecoderImpl : public Decoder {
     if (failed()) return nullptr;
 
     // FunctionSig stores the return types first.
-    ValueType* buffer = zone->NewArray<ValueType>(param_count + return_count);
+    ValueType* buffer =
+        zone->AllocateArray<ValueType>(param_count + return_count);
     uint32_t b = 0;
     for (uint32_t i = 0; i < return_count; ++i) buffer[b++] = returns[i];
     for (uint32_t i = 0; i < param_count; ++i) buffer[b++] = params[i];
@@ -2170,15 +2206,15 @@ class ModuleDecoderImpl : public Decoder {
     uint32_t field_count =
         consume_count(", field count", kV8MaxWasmStructFields);
     if (failed()) return nullptr;
-    ValueType* fields = zone->NewArray<ValueType>(field_count);
-    bool* mutabilities = zone->NewArray<bool>(field_count);
+    ValueType* fields = zone->AllocateArray<ValueType>(field_count);
+    bool* mutabilities = zone->AllocateArray<bool>(field_count);
     for (uint32_t i = 0; ok() && i < field_count; ++i) {
       fields[i] = consume_storage_type();
       mutabilities[i] = consume_mutability();
       if (tracer_) tracer_->NextLine();
     }
     if (failed()) return nullptr;
-    uint32_t* offsets = zone->NewArray<uint32_t>(field_count);
+    uint32_t* offsets = zone->AllocateArray<uint32_t>(field_count);
     StructType* result =
         zone->New<StructType>(field_count, offsets, fields, mutabilities);
     result->InitializeOffsets();
@@ -2195,7 +2231,7 @@ class ModuleDecoderImpl : public Decoder {
 
   // Consume the attribute field of an exception.
   uint32_t consume_exception_attribute() {
-    const byte* pos = pc_;
+    const uint8_t* pos = pc_;
     uint32_t attribute = consume_u32v("exception attribute");
     if (tracer_) tracer_->Bytes(pos, static_cast<uint32_t>(pc_ - pos));
     if (attribute != kExceptionAttribute) {
@@ -2206,7 +2242,7 @@ class ModuleDecoderImpl : public Decoder {
   }
 
   WasmElemSegment consume_element_segment_header() {
-    const byte* pos = pc();
+    const uint8_t* pos = pc();
 
     // The mask for the bit in the flag which indicates if the segment is
     // active or not (0 is active).
@@ -2329,7 +2365,7 @@ class ModuleDecoderImpl : public Decoder {
     }
 
     uint32_t num_elem =
-        consume_count("number of elements", max_table_init_entries());
+        consume_count(" number of elements", max_table_init_entries());
 
     if (is_active) {
       return {type,         table_index, std::move(offset),
@@ -2339,9 +2375,8 @@ class ModuleDecoderImpl : public Decoder {
     }
   }
 
-  void consume_data_segment_header(bool* is_active, uint32_t* index,
-                                   ConstantExpression* offset) {
-    const byte* pos = pc();
+  std::tuple<bool, uint32_t, ConstantExpression> consume_data_segment_header() {
+    const uint8_t* pos = pc();
     uint32_t flag = consume_u32v("flag: ", tracer_);
     if (tracer_) {
       tracer_->Description(
@@ -2357,32 +2392,35 @@ class ModuleDecoderImpl : public Decoder {
         flag != SegmentFlags::kPassive &&
         flag != SegmentFlags::kActiveWithIndex) {
       errorf(pos, "illegal flag value %u. Must be 0, 1, or 2", flag);
-      return;
+      return {};
     }
 
-    // We know now that the flag is valid. Time to read the rest.
-    ValueType expected_type = module_->is_memory64 ? kWasmI64 : kWasmI32;
-    if (flag == SegmentFlags::kActiveNoIndex) {
-      *is_active = true;
-      *index = 0;
-      *offset = consume_init_expr(module_.get(), expected_type);
-      return;
-    }
-    if (flag == SegmentFlags::kPassive) {
-      *is_active = false;
-      return;
-    }
-    if (flag == SegmentFlags::kActiveWithIndex) {
-      *is_active = true;
-      *index = consume_u32v("memory index", tracer_);
-      if (tracer_) tracer_->Description(*index);
-      *offset = consume_init_expr(module_.get(), expected_type);
+    bool is_active = flag == SegmentFlags::kActiveNoIndex ||
+                     flag == SegmentFlags::kActiveWithIndex;
+    uint32_t mem_index = flag == SegmentFlags::kActiveWithIndex
+                             ? consume_u32v("memory index", tracer_)
+                             : 0;
+    ConstantExpression offset;
+
+    if (is_active) {
+      size_t num_memories = module_->memories.size();
+      if (mem_index >= num_memories) {
+        errorf(pos,
+               "invalid memory index %u for data section (having %zu memor%s)",
+               mem_index, num_memories, num_memories == 1 ? "y" : "ies");
+        return {};
+      }
+      ValueType expected_type =
+          module_->memories[mem_index].is_memory64 ? kWasmI64 : kWasmI32;
+      offset = consume_init_expr(module_.get(), expected_type);
     }
+
+    return {is_active, mem_index, offset};
   }
 
   uint32_t consume_element_func_index(WasmModule* module, ValueType expected) {
     WasmFunction* func = nullptr;
-    const byte* initial_pc = pc();
+    const uint8_t* initial_pc = pc();
     uint32_t index = consume_func_index(module, &func);
     if (tracer_) tracer_->NextLine();
     if (failed()) return index;
@@ -2401,8 +2439,9 @@ class ModuleDecoderImpl : public Decoder {
 
   const WasmFeatures enabled_features_;
   const std::shared_ptr<WasmModule> module_;
-  const byte* module_start_ = nullptr;
-  const byte* module_end_ = nullptr;
+  const uint8_t* module_start_ = nullptr;
+  const uint8_t* module_end_ = nullptr;
+  PopulateExplicitRecGroups populate_explicit_rec_groups_;
   ITracer* tracer_;
   // The type section is the first section in a module.
   uint8_t next_ordered_section_ = kFirstSectionInModule;
diff --git a/deps/v8/src/wasm/module-decoder.cc b/deps/v8/src/wasm/module-decoder.cc
index 82e224899a1c95..045792134ebe87 100644
--- a/deps/v8/src/wasm/module-decoder.cc
+++ b/deps/v8/src/wasm/module-decoder.cc
@@ -76,11 +76,6 @@ ModuleResult DecodeWasmModule(
     std::shared_ptr<metrics::Recorder> metrics_recorder,
     v8::metrics::Recorder::ContextId context_id,
     DecodingMethod decoding_method) {
-  size_t max_size = max_module_size();
-  if (wire_bytes.size() > max_size) {
-    return ModuleResult{WasmError{0, "size > maximum module size (%zu): %zu",
-                                  max_size, wire_bytes.size()}};
-  }
   if (counters) {
     auto size_counter =
         SELECT_WASM_COUNTER(counters, origin, wasm, module_size_bytes);
@@ -117,12 +112,14 @@ ModuleResult DecodeWasmModule(
   return result;
 }
 
-ModuleResult DecodeWasmModule(WasmFeatures enabled_features,
-                              base::Vector<const uint8_t> wire_bytes,
-                              bool validate_functions, ModuleOrigin origin) {
+ModuleResult DecodeWasmModule(
+    WasmFeatures enabled_features, base::Vector<const uint8_t> wire_bytes,
+    bool validate_functions, ModuleOrigin origin,
+    PopulateExplicitRecGroups populate_explicit_rec_groups) {
   TRACE_EVENT0(TRACE_DISABLED_BY_DEFAULT("v8.wasm.detailed"),
                "wasm.DecodeWasmModule");
-  ModuleDecoderImpl decoder{enabled_features, wire_bytes, origin};
+  ModuleDecoderImpl decoder{enabled_features, wire_bytes, origin,
+                            populate_explicit_rec_groups};
   return decoder.DecodeModule(validate_functions);
 }
 
@@ -143,9 +140,8 @@ const std::shared_ptr<WasmModule>& ModuleDecoder::shared_module() const {
   return impl_->shared_module();
 }
 
-void ModuleDecoder::DecodeModuleHeader(base::Vector<const uint8_t> bytes,
-                                       uint32_t offset) {
-  impl_->DecodeModuleHeader(bytes, offset);
+void ModuleDecoder::DecodeModuleHeader(base::Vector<const uint8_t> bytes) {
+  impl_->DecodeModuleHeader(bytes);
 }
 
 void ModuleDecoder::DecodeSection(SectionCode section_code,
@@ -226,7 +222,7 @@ AsmJsOffsetsResult DecodeAsmJsOffsets(
       continue;
     }
     DCHECK(decoder.checkAvailable(size));
-    const byte* table_end = decoder.pc() + size;
+    const uint8_t* table_end = decoder.pc() + size;
     uint32_t locals_size = decoder.consume_u32v("locals size");
     int function_start_position = decoder.consume_u32v("function start pos");
     int function_end_position = function_start_position;
@@ -274,7 +270,7 @@ std::vector<CustomSectionOffset> DecodeCustomSections(
   std::vector<CustomSectionOffset> result;
 
   while (decoder.more()) {
-    byte section_code = decoder.consume_u8("section code");
+    uint8_t section_code = decoder.consume_u8("section code");
     uint32_t section_length = decoder.consume_u32v("section length");
     uint32_t section_start = decoder.pc_offset();
     if (section_code != 0) {
@@ -450,6 +446,7 @@ class ValidateFunctionsTask : public JobTask {
   bool ValidateFunction(int func_index) {
     WasmFeatures unused_detected_features;
     const WasmFunction& function = module_->functions[func_index];
+    DCHECK_LT(0, function.code.offset());
     FunctionBody body{function.sig, function.code.offset(),
                       wire_bytes_.begin() + function.code.offset(),
                       wire_bytes_.begin() + function.code.end_offset()};
diff --git a/deps/v8/src/wasm/module-decoder.h b/deps/v8/src/wasm/module-decoder.h
index 96680020d8ec71..2b9df2d925af85 100644
--- a/deps/v8/src/wasm/module-decoder.h
+++ b/deps/v8/src/wasm/module-decoder.h
@@ -84,6 +84,11 @@ enum class DecodingMethod {
   kDeserialize
 };
 
+enum PopulateExplicitRecGroups {
+  kDoNotPopulateExplicitRecGroups,
+  kPopulateExplicitRecGroups
+};
+
 // Decodes the bytes of a wasm module in {wire_bytes} while recording events and
 // updating counters.
 V8_EXPORT_PRIVATE ModuleResult DecodeWasmModule(
@@ -96,7 +101,9 @@ V8_EXPORT_PRIVATE ModuleResult DecodeWasmModule(
 // or updating counters.
 V8_EXPORT_PRIVATE ModuleResult DecodeWasmModule(
     WasmFeatures enabled_features, base::Vector<const uint8_t> wire_bytes,
-    bool validate_functions, ModuleOrigin origin);
+    bool validate_functions, ModuleOrigin origin,
+    PopulateExplicitRecGroups populate_explicit_rec_groups =
+        kDoNotPopulateExplicitRecGroups);
 // Stripped down version for disassembler needs.
 V8_EXPORT_PRIVATE ModuleResult
 DecodeWasmModuleForDisassembler(base::Vector<const uint8_t> wire_bytes);
@@ -156,7 +163,7 @@ class ModuleDecoder {
   explicit ModuleDecoder(WasmFeatures enabled_feature);
   ~ModuleDecoder();
 
-  void DecodeModuleHeader(base::Vector<const uint8_t> bytes, uint32_t offset);
+  void DecodeModuleHeader(base::Vector<const uint8_t> bytes);
 
   void DecodeSection(SectionCode section_code,
                      base::Vector<const uint8_t> bytes, uint32_t offset);
diff --git a/deps/v8/src/wasm/module-instantiate.cc b/deps/v8/src/wasm/module-instantiate.cc
index 6db5364f6a7e30..86c4d5ce23cba9 100644
--- a/deps/v8/src/wasm/module-instantiate.cc
+++ b/deps/v8/src/wasm/module-instantiate.cc
@@ -20,6 +20,7 @@
 #include "src/wasm/constant-expression-interface.h"
 #include "src/wasm/module-compiler.h"
 #include "src/wasm/module-decoder-impl.h"
+#include "src/wasm/pgo.h"
 #include "src/wasm/wasm-constants.h"
 #include "src/wasm/wasm-engine.h"
 #include "src/wasm/wasm-external-refs.h"
@@ -34,14 +35,13 @@
     if (v8_flags.trace_wasm_instances) PrintF(__VA_ARGS__); \
   } while (false)
 
-namespace v8 {
-namespace internal {
-namespace wasm {
+namespace v8::internal::wasm {
 
 namespace {
 
-byte* raw_buffer_ptr(MaybeHandle<JSArrayBuffer> buffer, int offset) {
-  return static_cast<byte*>(buffer.ToHandleChecked()->backing_store()) + offset;
+uint8_t* raw_buffer_ptr(MaybeHandle<JSArrayBuffer> buffer, int offset) {
+  return static_cast<uint8_t*>(buffer.ToHandleChecked()->backing_store()) +
+         offset;
 }
 
 using ImportWrapperQueue =
@@ -97,7 +97,7 @@ Handle<DescriptorArray> CreateArrayDescriptorArray(
 
   // TODO(ishell): cache Wasm field type in FieldType value.
   MaybeObject any_type = MaybeObject::FromObject(FieldType::Any());
-  DCHECK(any_type->IsSmi());
+  DCHECK(IsSmi(any_type));
 
   // Add descriptor for length property.
   PropertyDetails details(PropertyKind::kData, FROZEN, PropertyLocation::kField,
@@ -162,29 +162,11 @@ Handle<Map> CreateArrayMap(Isolate* isolate, const WasmModule* module,
   return map;
 }
 
-Handle<Map> CreateFuncRefMap(Isolate* isolate, const WasmModule* module,
-                             Handle<Map> opt_rtt_parent,
-                             Handle<WasmInstanceObject> instance) {
-  const int inobject_properties = 0;
-  const int instance_size =
-      Map::cast(isolate->root(RootIndex::kWasmInternalFunctionMap))
-          .instance_size();
-  const InstanceType instance_type = WASM_INTERNAL_FUNCTION_TYPE;
-  const ElementsKind elements_kind = TERMINAL_FAST_ELEMENTS_KIND;
-  constexpr uint32_t kNoIndex = ~0u;
-  Handle<WasmTypeInfo> type_info = isolate->factory()->NewWasmTypeInfo(
-      kNullAddress, opt_rtt_parent, instance_size, instance, kNoIndex);
-  Handle<Map> map = isolate->factory()->NewMap(
-      instance_type, instance_size, elements_kind, inobject_properties);
-  map->set_wasm_type_info(*type_info);
-  return map;
-}
-
 void CreateMapForType(Isolate* isolate, const WasmModule* module,
                       int type_index, Handle<WasmInstanceObject> instance,
                       Handle<FixedArray> maps) {
   // Recursive calls for supertypes may already have created this map.
-  if (maps->get(type_index).IsMap()) return;
+  if (IsMap(maps->get(type_index))) return;
 
   Handle<WeakArrayList> canonical_rtts;
   uint32_t canonical_type_index =
@@ -196,7 +178,7 @@ void CreateMapForType(Isolate* isolate, const WasmModule* module,
             canonical_type_index);
   MaybeObject maybe_canonical_map = canonical_rtts->Get(canonical_type_index);
   if (maybe_canonical_map.IsStrongOrWeak() &&
-      maybe_canonical_map.GetHeapObject().IsMap()) {
+      IsMap(maybe_canonical_map.GetHeapObject())) {
     maps->set(type_index, maybe_canonical_map.GetHeapObject());
     return;
   }
@@ -221,7 +203,7 @@ void CreateMapForType(Isolate* isolate, const WasmModule* module,
       map = CreateArrayMap(isolate, module, type_index, rtt_parent, instance);
       break;
     case TypeDefinition::kFunction:
-      map = CreateFuncRefMap(isolate, module, rtt_parent, instance);
+      map = CreateFuncRefMap(isolate, rtt_parent, instance);
       break;
   }
   canonical_rtts->Set(canonical_type_index, HeapObjectReference::Weak(*map));
@@ -243,17 +225,17 @@ bool IsSupportedWasmFastApiFunction(Isolate* isolate,
   if (!shared->IsApiFunction()) {
     return false;
   }
-  if (shared->get_api_func_data().GetCFunctionsCount() == 0) {
+  if (shared->api_func_data()->GetCFunctionsCount() == 0) {
     return false;
   }
-  if (!shared->get_api_func_data().accept_any_receiver()) {
+  if (!shared->api_func_data()->accept_any_receiver()) {
     return false;
   }
-  if (!shared->get_api_func_data().signature().IsUndefined()) {
+  if (!IsUndefined(shared->api_func_data()->signature())) {
     // TODO(wasm): CFunctionInfo* signature check.
     return false;
   }
-  const CFunctionInfo* info = shared->get_api_func_data().GetCSignature(0);
+  const CFunctionInfo* info = shared->api_func_data()->GetCSignature(0);
   if (!compiler::IsFastCallSupportedSignature(info)) {
     return false;
   }
@@ -263,7 +245,7 @@ bool IsSupportedWasmFastApiFunction(Isolate* isolate,
     if (v8_flags.trace_opt) {
       CodeTracer::Scope scope(isolate->GetCodeTracer());
       PrintF(scope.file(), "[disabled optimization for ");
-      shared->ShortPrint(scope.file());
+      ShortPrint(*shared, scope.file());
       PrintF(scope.file(),
              ", reason: the signature of the imported function in the Wasm "
              "module doesn't match that of the Fast API function (%s)]\n",
@@ -321,23 +303,23 @@ bool IsSupportedWasmFastApiFunction(Isolate* isolate,
 bool ResolveBoundJSFastApiFunction(const wasm::FunctionSig* expected_sig,
                                    Handle<JSReceiver> callable) {
   Handle<JSFunction> target;
-  if (callable->IsJSBoundFunction()) {
+  if (IsJSBoundFunction(*callable)) {
     Handle<JSBoundFunction> bound_target =
         Handle<JSBoundFunction>::cast(callable);
     // Nested bound functions and arguments not supported yet.
-    if (bound_target->bound_arguments().length() > 0) {
+    if (bound_target->bound_arguments()->length() > 0) {
       return false;
     }
-    if (bound_target->bound_target_function().IsJSBoundFunction()) {
+    if (IsJSBoundFunction(bound_target->bound_target_function())) {
       return false;
     }
     Handle<JSReceiver> bound_target_function =
         handle(bound_target->bound_target_function(), callable->GetIsolate());
-    if (!bound_target_function->IsJSFunction()) {
+    if (!IsJSFunction(*bound_target_function)) {
       return false;
     }
     target = Handle<JSFunction>::cast(bound_target_function);
-  } else if (callable->IsJSFunction()) {
+  } else if (IsJSFunction(*callable)) {
     target = Handle<JSFunction>::cast(callable);
   } else {
     return false;
@@ -348,48 +330,215 @@ bool ResolveBoundJSFastApiFunction(const wasm::FunctionSig* expected_sig,
   return IsSupportedWasmFastApiFunction(isolate, expected_sig, shared);
 }
 
-#if V8_INTL_SUPPORT
-namespace {
-
 bool IsStringRef(wasm::ValueType type) {
   return type.is_reference_to(wasm::HeapType::kString);
 }
 
-}  // namespace
-#endif
+bool IsExternRef(wasm::ValueType type) {
+  return type.is_reference_to(wasm::HeapType::kExtern);
+}
+
+bool IsStringOrExternRef(wasm::ValueType type) {
+  return IsStringRef(type) || IsExternRef(type);
+}
+
+bool IsI16Array(wasm::ValueType type, const WasmModule* module, bool writable) {
+  if (!type.is_object_reference() || !type.has_index()) return false;
+  uint32_t reftype = type.ref_index();
+  if (!module->has_array(reftype)) return false;
+  if (writable && !module->array_type(reftype)->mutability()) return false;
+  return module->array_type(reftype)->element_type() == kWasmI16;
+}
 
-// This detects imports of the form: `Function.prototype.call.bind(foo)`, where
-// `foo` is something that has a Builtin id.
-WellKnownImport CheckForWellKnownImport(Handle<JSReceiver> callable,
+bool IsI8Array(wasm::ValueType type, const WasmModule* module, bool writable) {
+  if (!type.is_object_reference() || !type.has_index()) return false;
+  uint32_t reftype = type.ref_index();
+  if (!module->has_array(reftype)) return false;
+  if (writable && !module->array_type(reftype)->mutability()) return false;
+  return module->array_type(reftype)->element_type() == kWasmI8;
+}
+
+// This detects imports of the forms:
+// - `Function.prototype.call.bind(foo)`, where `foo` is something that has a
+//   Builtin id.
+// - JSFunction with Builtin id (e.g. `parseFloat`).
+WellKnownImport CheckForWellKnownImport(Handle<WasmInstanceObject> instance,
+                                        int func_index,
+                                        Handle<JSReceiver> callable,
                                         const wasm::FunctionSig* sig) {
   WellKnownImport kGeneric = WellKnownImport::kGeneric;  // "using" is C++20.
+  if (instance.is_null()) return kGeneric;
+  static constexpr ValueType kRefExtern = ValueType::Ref(HeapType::kExtern);
+  // Check for plain JS functions.
+  if (IsJSFunction(*callable)) {
+    Tagged<SharedFunctionInfo> sfi = JSFunction::cast(*callable)->shared();
+    if (!sfi->HasBuiltinId()) return kGeneric;
+    // This needs to be a separate switch because it allows other cases than
+    // the one below. Merging them would be invalid, because we would then
+    // recognize receiver-requiring methods even when they're (erroneously)
+    // being imported such that they don't get a receiver.
+    switch (sfi->builtin_id()) {
+      case Builtin::kWebAssemblyStringCharCodeAt:
+        if (sig->parameter_count() == 2 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmExternRef &&
+            sig->GetParam(1) == kWasmI32 && sig->GetReturn(0) == kWasmI32) {
+          return WellKnownImport::kStringCharCodeAt;
+        }
+        break;
+      case Builtin::kWebAssemblyStringCodePointAt:
+        if (sig->parameter_count() == 2 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmExternRef &&
+            sig->GetParam(1) == kWasmI32 && sig->GetReturn(0) == kWasmI32) {
+          return WellKnownImport::kStringCodePointAt;
+        }
+        break;
+      case Builtin::kWebAssemblyStringCompare:
+        if (sig->parameter_count() == 2 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmExternRef &&
+            sig->GetParam(1) == kWasmExternRef &&
+            sig->GetReturn(0) == kWasmI32) {
+          return WellKnownImport::kStringCompare;
+        }
+        break;
+      case Builtin::kWebAssemblyStringConcat:
+        if (sig->parameter_count() == 2 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmExternRef &&
+            sig->GetParam(1) == kWasmExternRef &&
+            sig->GetReturn(0) == kRefExtern) {
+          return WellKnownImport::kStringConcat;
+        }
+        break;
+      case Builtin::kWebAssemblyStringEquals:
+        if (sig->parameter_count() == 2 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmExternRef &&
+            sig->GetParam(1) == kWasmExternRef &&
+            sig->GetReturn(0) == kWasmI32) {
+          return WellKnownImport::kStringEquals;
+        }
+        break;
+      case Builtin::kWebAssemblyStringFromCharCode:
+        if (sig->parameter_count() == 1 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmI32 && sig->GetReturn(0) == kRefExtern) {
+          return WellKnownImport::kStringFromCharCode;
+        }
+        break;
+      case Builtin::kWebAssemblyStringFromCodePoint:
+        if (sig->parameter_count() == 1 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmI32 && sig->GetReturn(0) == kRefExtern) {
+          return WellKnownImport::kStringFromCodePoint;
+        }
+        break;
+      case Builtin::kWebAssemblyStringFromWtf16Array:
+        // i16array, i32, i32 -> extern
+        if (sig->parameter_count() == 3 && sig->return_count() == 1 &&
+            IsI16Array(sig->GetParam(0), instance->module(), false) &&
+            sig->GetParam(1) == kWasmI32 && sig->GetParam(2) == kWasmI32 &&
+            sig->GetReturn(0) == kRefExtern) {
+          return WellKnownImport::kStringFromWtf16Array;
+        }
+        break;
+      case Builtin::kWebAssemblyStringFromWtf8Array:
+        // i8array, i32, i32 -> extern
+        if (sig->parameter_count() == 3 && sig->return_count() == 1 &&
+            IsI8Array(sig->GetParam(0), instance->module(), false) &&
+            sig->GetParam(1) == kWasmI32 && sig->GetParam(2) == kWasmI32 &&
+            sig->GetReturn(0) == kRefExtern) {
+          return WellKnownImport::kStringFromWtf8Array;
+        }
+        break;
+      case Builtin::kWebAssemblyStringLength:
+        if (sig->parameter_count() == 1 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmExternRef &&
+            sig->GetReturn(0) == kWasmI32) {
+          return WellKnownImport::kStringLength;
+        }
+        break;
+      case Builtin::kWebAssemblyStringSubstring:
+        if (sig->parameter_count() == 3 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmExternRef &&
+            sig->GetParam(1) == kWasmI32 && sig->GetParam(2) == kWasmI32 &&
+            sig->GetReturn(0) == kRefExtern) {
+          return WellKnownImport::kStringSubstring;
+        }
+        break;
+      case Builtin::kWebAssemblyStringToWtf16Array:
+        // string, i16array, i32 -> i32
+        if (sig->parameter_count() == 3 && sig->return_count() == 1 &&
+            sig->GetParam(0) == kWasmExternRef &&
+            IsI16Array(sig->GetParam(1), instance->module(), true) &&
+            sig->GetParam(2) == kWasmI32 && sig->GetReturn(0) == kWasmI32) {
+          return WellKnownImport::kStringToWtf16Array;
+        }
+        break;
+      case Builtin::kNumberParseFloat:
+        if (sig->parameter_count() == 1 && sig->return_count() == 1 &&
+            IsStringRef(sig->GetParam(0)) &&
+            sig->GetReturn(0) == wasm::kWasmF64) {
+          return WellKnownImport::kParseFloat;
+        }
+        break;
+      default:
+        break;
+    }
+    return kGeneric;
+  }
+
+  // Check for bound JS functions.
   // First part: check that the callable is a bound function whose target
   // is {Function.prototype.call}, and which only binds a receiver.
-  if (!callable->IsJSBoundFunction()) return kGeneric;
+  if (!IsJSBoundFunction(*callable)) return kGeneric;
   Handle<JSBoundFunction> bound = Handle<JSBoundFunction>::cast(callable);
-  if (bound->bound_arguments().length() != 0) return kGeneric;
-  if (!bound->bound_target_function().IsJSFunction()) return kGeneric;
-  SharedFunctionInfo sfi =
-      JSFunction::cast(bound->bound_target_function()).shared();
-  if (!sfi.HasBuiltinId()) return kGeneric;
-  if (sfi.builtin_id() != Builtin::kFunctionPrototypeCall) return kGeneric;
+  if (bound->bound_arguments()->length() != 0) return kGeneric;
+  if (!IsJSFunction(bound->bound_target_function())) return kGeneric;
+  Tagged<SharedFunctionInfo> sfi =
+      JSFunction::cast(bound->bound_target_function())->shared();
+  if (!sfi->HasBuiltinId()) return kGeneric;
+  if (sfi->builtin_id() != Builtin::kFunctionPrototypeCall) return kGeneric;
   // Second part: check if the bound receiver is one of the builtins for which
   // we have special-cased support.
-  Object bound_this = bound->bound_this();
-  if (!bound_this.IsJSFunction()) return kGeneric;
-  sfi = JSFunction::cast(bound_this).shared();
-  if (!sfi.HasBuiltinId()) return kGeneric;
-  switch (sfi.builtin_id()) {
+  Tagged<Object> bound_this = bound->bound_this();
+  if (!IsJSFunction(bound_this)) return kGeneric;
+  sfi = JSFunction::cast(bound_this)->shared();
+  if (!sfi->HasBuiltinId()) return kGeneric;
+  switch (sfi->builtin_id()) {
 #if V8_INTL_SUPPORT
+    case Builtin::kStringPrototypeToLocaleLowerCase:
+      if (sig->parameter_count() == 2 && sig->return_count() == 1 &&
+          IsStringRef(sig->GetParam(0)) && IsStringRef(sig->GetParam(1)) &&
+          IsStringRef(sig->GetReturn(0))) {
+        DCHECK_GE(func_index, 0);
+        instance->well_known_imports()->set(func_index, bound_this);
+        return WellKnownImport::kStringToLocaleLowerCaseStringref;
+      }
+      break;
     case Builtin::kStringPrototypeToLowerCaseIntl:
-      // TODO(jkummerow): Consider caching signatures to compare with, similar
-      // to {wasm::WasmOpcodes::Signature(...)}.
       if (sig->parameter_count() == 1 && sig->return_count() == 1 &&
           IsStringRef(sig->GetParam(0)) && IsStringRef(sig->GetReturn(0))) {
         return WellKnownImport::kStringToLowerCaseStringref;
       }
-      return kGeneric;
+      break;
 #endif
+    case Builtin::kNumberPrototypeToString:
+      if (sig->parameter_count() == 2 && sig->return_count() == 1 &&
+          sig->GetParam(0) == wasm::kWasmI32 &&
+          sig->GetParam(1) == wasm::kWasmI32 &&
+          IsStringOrExternRef(sig->GetReturn(0))) {
+        return WellKnownImport::kIntToString;
+      }
+      if (sig->parameter_count() == 1 && sig->return_count() == 1 &&
+          sig->GetParam(0) == wasm::kWasmF64 &&
+          IsStringOrExternRef(sig->GetReturn(0))) {
+        return WellKnownImport::kDoubleToString;
+      }
+      break;
+    case Builtin::kStringPrototypeIndexOf:
+      // (string, string, i32) -> (i32).
+      if (sig->parameter_count() == 3 && sig->return_count() == 1 &&
+          IsStringRef(sig->GetParam(0)) && IsStringRef(sig->GetParam(1)) &&
+          sig->GetParam(2) == wasm::kWasmI32 &&
+          sig->GetReturn(0) == wasm::kWasmI32)
+        return WellKnownImport::kStringIndexOf;
+      break;
     default:
       break;
   }
@@ -398,14 +547,17 @@ WellKnownImport CheckForWellKnownImport(Handle<JSReceiver> callable,
 
 }  // namespace
 
-WasmImportData::WasmImportData(Handle<JSReceiver> callable,
+WasmImportData::WasmImportData(Handle<WasmInstanceObject> instance,
+                               int func_index, Handle<JSReceiver> callable,
                                const wasm::FunctionSig* expected_sig,
                                uint32_t expected_canonical_type_index)
     : callable_(callable) {
-  kind_ = ComputeKind(expected_sig, expected_canonical_type_index);
+  kind_ = ComputeKind(instance, func_index, expected_sig,
+                      expected_canonical_type_index);
 }
 
 ImportCallKind WasmImportData::ComputeKind(
+    Handle<WasmInstanceObject> instance, int func_index,
     const wasm::FunctionSig* expected_sig,
     uint32_t expected_canonical_type_index) {
   Isolate* isolate = callable_->GetIsolate();
@@ -417,7 +569,7 @@ ImportCallKind WasmImportData::ComputeKind(
     uint32_t func_index =
         static_cast<uint32_t>(imported_function->function_index());
     if (func_index >=
-        imported_function->instance().module()->num_imported_functions) {
+        imported_function->instance()->module()->num_imported_functions) {
       return ImportCallKind::kWasmToWasm;
     }
     // Resolve the shortcut to the underlying callable and continue.
@@ -450,9 +602,10 @@ ImportCallKind WasmImportData::ComputeKind(
       ResolveBoundJSFastApiFunction(expected_sig, callable_)) {
     return ImportCallKind::kWasmToJSFastApi;
   }
-  well_known_status_ = CheckForWellKnownImport(callable_, expected_sig);
+  well_known_status_ =
+      CheckForWellKnownImport(instance, func_index, callable_, expected_sig);
   // For JavaScript calls, determine whether the target has an arity match.
-  if (callable_->IsJSFunction()) {
+  if (IsJSFunction(*callable_)) {
     Handle<JSFunction> function = Handle<JSFunction>::cast(callable_);
     Handle<SharedFunctionInfo> shared(function->shared(),
                                       function->GetIsolate());
@@ -561,8 +714,7 @@ class InstanceBuilder {
   ErrorThrower* thrower_;
   Handle<WasmModuleObject> module_object_;
   MaybeHandle<JSReceiver> ffi_;
-  MaybeHandle<JSArrayBuffer> memory_buffer_;
-  Handle<WasmMemoryObject> memory_object_;
+  MaybeHandle<JSArrayBuffer> asmjs_memory_buffer_;
   Handle<JSArrayBuffer> untagged_globals_;
   Handle<FixedArray> tagged_globals_;
   std::vector<Handle<WasmTagObject>> tags_wrappers_;
@@ -574,26 +726,20 @@ class InstanceBuilder {
   // performance a bit over allocating a new {Zone} each time.
   Zone init_expr_zone_;
 
-// Helper routines to print out errors with imports.
-#define ERROR_THROWER_WITH_MESSAGE(TYPE)                                      \
-  void Report##TYPE(const char* error, uint32_t index,                        \
-                    Handle<String> module_name, Handle<String> import_name) { \
-    thrower_->TYPE("Import #%d module=\"%s\" function=\"%s\" error: %s",      \
-                   index, module_name->ToCString().get(),                     \
-                   import_name->ToCString().get(), error);                    \
-  }                                                                           \
-                                                                              \
-  MaybeHandle<Object> Report##TYPE(const char* error, uint32_t index,         \
-                                   Handle<String> module_name) {              \
-    thrower_->TYPE("Import #%d module=\"%s\" error: %s", index,               \
-                   module_name->ToCString().get(), error);                    \
-    return MaybeHandle<Object>();                                             \
+  std::string ImportName(uint32_t index, Handle<String> module_name,
+                         Handle<String> import_name) {
+    std::ostringstream oss;
+    oss << "Import #" << index << " module=\"" << module_name->ToCString().get()
+        << "\" function=\"" << import_name->ToCString().get() << "\"";
+    return oss.str();
   }
 
-  ERROR_THROWER_WITH_MESSAGE(LinkError)
-  ERROR_THROWER_WITH_MESSAGE(TypeError)
-
-#undef ERROR_THROWER_WITH_MESSAGE
+  std::string ImportName(uint32_t index, Handle<String> module_name) {
+    std::ostringstream oss;
+    oss << "Import #" << index << " module=\"" << module_name->ToCString().get()
+        << "\"";
+    return oss.str();
+  }
 
   // Look up an import value in the {ffi_} object.
   MaybeHandle<Object> LookupImport(uint32_t index, Handle<String> module_name,
@@ -613,11 +759,8 @@ class InstanceBuilder {
 
   void SanitizeImports();
 
-  // Find the imported memory if there is one.
-  bool FindImportedMemory();
-
   // Allocate the memory.
-  bool AllocateMemory();
+  MaybeHandle<WasmMemoryObject> AllocateMemory(uint32_t memory_index);
 
   // Processes a single imported function.
   bool ProcessImportedFunction(Handle<WasmInstanceObject> instance,
@@ -637,11 +780,6 @@ class InstanceBuilder {
                             Handle<String> module_name,
                             Handle<String> import_name, Handle<Object> value);
 
-  // Process a single imported memory.
-  bool ProcessImportedMemory(Handle<WasmInstanceObject> instance,
-                             int import_index, Handle<String> module_name,
-                             Handle<String> import_name, Handle<Object> value);
-
   // Process a single imported global.
   bool ProcessImportedGlobal(Handle<WasmInstanceObject> instance,
                              int import_index, int global_index,
@@ -665,6 +803,10 @@ class InstanceBuilder {
   // functions, or {-1} on error.
   int ProcessImports(Handle<WasmInstanceObject> instance);
 
+  // Process all imported memories, placing the WasmMemoryObjects in the
+  // supplied {FixedArray}.
+  bool ProcessImportedMemories(Handle<FixedArray> imported_memory_objects);
+
   template <typename T>
   T* GetRawUntaggedGlobalPtr(const WasmGlobal& global);
 
@@ -745,6 +887,30 @@ class ReportLazyCompilationTimesTask : public v8::Task {
   std::weak_ptr<NativeModule> native_module_;
   int delay_in_seconds_;
 };
+
+class WriteOutPGOTask : public v8::Task {
+ public:
+  explicit WriteOutPGOTask(std::weak_ptr<NativeModule> native_module)
+      : native_module_(std::move(native_module)) {}
+
+  void Run() final {
+    std::shared_ptr<NativeModule> native_module = native_module_.lock();
+    if (!native_module) return;
+    DumpProfileToFile(native_module->module(), native_module->wire_bytes(),
+                      native_module->tiering_budget_array());
+    Schedule(std::move(native_module_));
+  }
+
+  static void Schedule(std::weak_ptr<NativeModule> native_module) {
+    // Write out PGO info every 10 seconds.
+    V8::GetCurrentPlatform()->CallDelayedOnWorkerThread(
+        std::make_unique<WriteOutPGOTask>(std::move(native_module)), 10.0);
+  }
+
+ private:
+  const std::weak_ptr<NativeModule> native_module_;
+};
+
 }  // namespace
 
 MaybeHandle<WasmInstanceObject> InstantiateToInstanceObject(
@@ -757,32 +923,34 @@ MaybeHandle<WasmInstanceObject> InstantiateToInstanceObject(
                           memory_buffer);
   auto instance = builder.Build();
   if (!instance.is_null()) {
+    const std::shared_ptr<NativeModule>& native_module =
+        module_object->shared_native_module();
     // Post tasks for lazy compilation metrics before we call the start
     // function.
     if (v8_flags.wasm_lazy_compilation &&
-        module_object->native_module()
-            ->ShouldLazyCompilationMetricsBeReported()) {
+        native_module->ShouldLazyCompilationMetricsBeReported()) {
       V8::GetCurrentPlatform()->CallDelayedOnWorkerThread(
           std::make_unique<ReportLazyCompilationTimesTask>(
-              isolate->async_counters(), module_object->shared_native_module(),
-              5),
+              isolate->async_counters(), native_module, 5),
           5.0);
       V8::GetCurrentPlatform()->CallDelayedOnWorkerThread(
           std::make_unique<ReportLazyCompilationTimesTask>(
-              isolate->async_counters(), module_object->shared_native_module(),
-              20),
+              isolate->async_counters(), native_module, 20),
           20.0);
       V8::GetCurrentPlatform()->CallDelayedOnWorkerThread(
           std::make_unique<ReportLazyCompilationTimesTask>(
-              isolate->async_counters(), module_object->shared_native_module(),
-              60),
+              isolate->async_counters(), native_module, 60),
           60.0);
       V8::GetCurrentPlatform()->CallDelayedOnWorkerThread(
           std::make_unique<ReportLazyCompilationTimesTask>(
-              isolate->async_counters(), module_object->shared_native_module(),
-              120),
+              isolate->async_counters(), native_module, 120),
           120.0);
     }
+    if (v8_flags.experimental_wasm_pgo_to_file &&
+        native_module->ShouldPgoDataBeWritten() &&
+        native_module->module()->num_declared_functions > 0) {
+      WriteOutPGOTask::Schedule(native_module);
+    }
     if (builder.ExecuteStartFunction()) {
       return instance;
     }
@@ -796,7 +964,7 @@ InstanceBuilder::InstanceBuilder(Isolate* isolate,
                                  ErrorThrower* thrower,
                                  Handle<WasmModuleObject> module_object,
                                  MaybeHandle<JSReceiver> ffi,
-                                 MaybeHandle<JSArrayBuffer> memory_buffer)
+                                 MaybeHandle<JSArrayBuffer> asmjs_memory_buffer)
     : isolate_(isolate),
       context_id_(context_id),
       enabled_(module_object->native_module()->enabled_features()),
@@ -804,7 +972,7 @@ InstanceBuilder::InstanceBuilder(Isolate* isolate,
       thrower_(thrower),
       module_object_(module_object),
       ffi_(ffi),
-      memory_buffer_(memory_buffer),
+      asmjs_memory_buffer_(asmjs_memory_buffer),
       init_expr_zone_(isolate_->allocator(), "constant expression zone") {
   sanitized_imports_.reserve(module_->import_table.size());
   well_known_imports_.reserve(module_->num_imported_functions);
@@ -836,36 +1004,33 @@ MaybeHandle<WasmInstanceObject> InstanceBuilder::Build() {
   NativeModule* native_module = module_object_->native_module();
 
   //--------------------------------------------------------------------------
-  // Set up the memory buffer and memory objects.
+  // Create the WebAssembly.Instance object.
   //--------------------------------------------------------------------------
-  uint32_t initial_pages = module_->initial_pages;
-  auto initial_pages_counter = SELECT_WASM_COUNTER(
-      isolate_->counters(), module_->origin, wasm, min_mem_pages_count);
-  initial_pages_counter->AddSample(initial_pages);
-  if (module_->has_maximum_pages) {
-    DCHECK_EQ(kWasmOrigin, module_->origin);
-    auto max_pages_counter =
-        isolate_->counters()->wasm_wasm_max_mem_pages_count();
-    max_pages_counter->AddSample(module_->maximum_pages);
-  }
+  TRACE("New module instantiation for %p\n", native_module);
+  Handle<WasmInstanceObject> instance =
+      WasmInstanceObject::New(isolate_, module_object_);
 
+  //--------------------------------------------------------------------------
+  // Set up the memory buffers and memory objects and attach them to the
+  // instance.
+  //--------------------------------------------------------------------------
   if (is_asmjs_module(module_)) {
+    CHECK_EQ(1, module_->memories.size());
     Handle<JSArrayBuffer> buffer;
-    if (memory_buffer_.ToHandle(&buffer)) {
-      // asm.js instantiation should have changed the state of the buffer.
-      CHECK(!buffer->is_detachable());
-      CHECK(buffer->is_asmjs_memory());
-    } else {
+    if (!asmjs_memory_buffer_.ToHandle(&buffer)) {
       // Use an empty JSArrayBuffer for degenerate asm.js modules.
-      memory_buffer_ = isolate_->factory()->NewJSArrayBufferAndBackingStore(
-          0, InitializedFlag::kUninitialized);
-      if (!memory_buffer_.ToHandle(&buffer)) {
+      MaybeHandle<JSArrayBuffer> new_buffer =
+          isolate_->factory()->NewJSArrayBufferAndBackingStore(
+              0, InitializedFlag::kUninitialized);
+      if (!new_buffer.ToHandle(&buffer)) {
         thrower_->RangeError("Out of memory: asm.js memory");
         return {};
       }
-      buffer->set_is_asmjs_memory(true);
       buffer->set_is_detachable(false);
     }
+    // asm.js instantiation should have changed the state of the buffer (or we
+    // set it above).
+    CHECK(!buffer->is_detachable());
 
     // The maximum number of pages isn't strictly necessary for memory
     // objects used for asm.js, as they are never visible, but we might
@@ -873,43 +1038,38 @@ MaybeHandle<WasmInstanceObject> InstanceBuilder::Build() {
     auto maximum_pages =
         static_cast<int>(RoundUp(buffer->byte_length(), wasm::kWasmPageSize) /
                          wasm::kWasmPageSize);
-    memory_object_ = WasmMemoryObject::New(isolate_, buffer, maximum_pages)
-                         .ToHandleChecked();
+    Handle<WasmMemoryObject> memory_object = WasmMemoryObject::New(
+        isolate_, buffer, maximum_pages, WasmMemoryFlag::kWasmMemory32);
+    constexpr int kMemoryIndexZero = 0;
+    WasmMemoryObject::UseInInstance(isolate_, memory_object, instance,
+                                    kMemoryIndexZero);
+    instance->memory_objects()->set(kMemoryIndexZero, *memory_object);
   } else {
-    // Actual wasm module must have either imported or created memory.
-    CHECK(memory_buffer_.is_null());
-    if (!FindImportedMemory()) {
-      if (module_->has_memory && !AllocateMemory()) {
+    CHECK(asmjs_memory_buffer_.is_null());
+    Handle<FixedArray> memory_objects{instance->memory_objects(), isolate_};
+    // First process all imported memories, then allocate non-imported ones.
+    if (!ProcessImportedMemories(memory_objects)) return {};
+    // Actual Wasm modules can have multiple memories.
+    static_assert(kV8MaxWasmMemories <= kMaxUInt32);
+    uint32_t num_memories = static_cast<uint32_t>(module_->memories.size());
+    for (uint32_t memory_index = 0; memory_index < num_memories;
+         ++memory_index) {
+      Handle<WasmMemoryObject> memory_object;
+      if (!IsUndefined(memory_objects->get(memory_index))) {
+        memory_object =
+            handle(WasmMemoryObject::cast(memory_objects->get(memory_index)),
+                   isolate_);
+      } else if (AllocateMemory(memory_index).ToHandle(&memory_object)) {
+        memory_objects->set(memory_index, *memory_object);
+      } else {
         DCHECK(isolate_->has_pending_exception() || thrower_->error());
         return {};
       }
+      WasmMemoryObject::UseInInstance(isolate_, memory_object, instance,
+                                      memory_index);
     }
   }
 
-  //--------------------------------------------------------------------------
-  // Create the WebAssembly.Instance object.
-  //--------------------------------------------------------------------------
-  TRACE("New module instantiation for %p\n", native_module);
-  Handle<WasmInstanceObject> instance =
-      WasmInstanceObject::New(isolate_, module_object_);
-
-  //--------------------------------------------------------------------------
-  // Attach the memory to the instance.
-  //--------------------------------------------------------------------------
-  if (module_->has_memory) {
-    DCHECK(!memory_object_.is_null());
-    if (!instance->has_memory_object()) {
-      instance->set_memory_object(*memory_object_);
-    }
-    // Add the instance object to the list of instances for this memory.
-    WasmMemoryObject::AddInstance(isolate_, memory_object_, instance);
-
-    // Double-check the {memory} array buffer matches the instance.
-    Handle<JSArrayBuffer> memory = memory_buffer_.ToHandleChecked();
-    CHECK_EQ(instance->memory_size(), memory->byte_length());
-    CHECK_EQ(instance->memory_start(), memory->backing_store());
-  }
-
   //--------------------------------------------------------------------------
   // Set up the globals for the new instance.
   //--------------------------------------------------------------------------
@@ -927,7 +1087,7 @@ MaybeHandle<WasmInstanceObject> InstanceBuilder::Build() {
 
     instance->set_untagged_globals_buffer(*untagged_globals_);
     instance->set_globals_start(
-        reinterpret_cast<byte*>(untagged_globals_->backing_store()));
+        reinterpret_cast<uint8_t*>(untagged_globals_->backing_store()));
   }
 
   uint32_t tagged_globals_buffer_size = module_->tagged_globals_buffer_size;
@@ -1070,8 +1230,9 @@ MaybeHandle<WasmInstanceObject> InstanceBuilder::Build() {
       WasmInstanceObject::EnsureIndirectFunctionTableWithMinimumSize(
           instance, table_index, table.initial_size);
       if (thrower_->error()) return {};
-      auto table_object = handle(
-          WasmTableObject::cast(instance->tables().get(table_index)), isolate_);
+      auto table_object =
+          handle(WasmTableObject::cast(instance->tables()->get(table_index)),
+                 isolate_);
       WasmTableObject::AddDispatchTable(isolate_, table_object, instance,
                                         table_index);
     }
@@ -1138,23 +1299,18 @@ MaybeHandle<WasmInstanceObject> InstanceBuilder::Build() {
   if (module_->start_function_index >= 0) {
     int start_index = module_->start_function_index;
     auto& function = module_->functions[start_index];
-    uint32_t canonical_sig_index =
-        module_->isorecursive_canonical_type_ids[module_->functions[start_index]
-                                                     .sig_index];
-    Handle<Code> wrapper_code =
-        JSToWasmWrapperCompilationUnit::CompileJSToWasmWrapper(
-            isolate_, function.sig, canonical_sig_index, module_,
-            function.imported);
     // TODO(clemensb): Don't generate an exported function for the start
     // function. Use CWasmEntry instead.
-    start_function_ = WasmExportedFunction::New(
-        isolate_, instance, start_index,
-        static_cast<int>(function.sig->parameter_count()), wrapper_code);
+    Handle<WasmInternalFunction> internal =
+        WasmInstanceObject::GetOrCreateWasmInternalFunction(isolate_, instance,
+                                                            start_index);
+    start_function_ = Handle<WasmExportedFunction>::cast(
+        WasmInternalFunction::GetOrCreateExternal(internal));
 
     if (function.imported) {
       ImportedFunctionEntry entry(instance, module_->start_function_index);
-      Object callable = entry.maybe_callable();
-      if (callable.IsJSFunction()) {
+      Tagged<Object> callable = entry.maybe_callable();
+      if (IsJSFunction(callable)) {
         // If the start function was imported and calls into Blink, we have
         // to pretend that the V8 API was used to enter its correct context.
         // To get that context to {ExecuteStartFunction} below, we install it
@@ -1163,7 +1319,7 @@ MaybeHandle<WasmInstanceObject> InstanceBuilder::Build() {
         // target's context, but the end result is the same, and since the
         // start function wrapper doesn't leak, neither does this
         // implementation detail.
-        start_function_->set_context(JSFunction::cast(callable).context());
+        start_function_->set_context(JSFunction::cast(callable)->context());
       }
     }
   }
@@ -1219,27 +1375,28 @@ MaybeHandle<Object> InstanceBuilder::LookupImport(uint32_t index,
   // a JSObject, if the module has imports.
   DCHECK(!ffi_.is_null());
   // Look up the module first.
-  MaybeHandle<Object> result = Object::GetPropertyOrElement(
-      isolate_, ffi_.ToHandleChecked(), module_name);
-  if (result.is_null()) {
-    return ReportTypeError("module not found", index, module_name);
-  }
-
-  Handle<Object> module = result.ToHandleChecked();
-
-  // Look up the value in the module.
-  if (!module->IsJSReceiver()) {
-    return ReportTypeError("module is not an object or function", index,
-                           module_name);
+  Handle<Object> module;
+  if (!Object::GetPropertyOrElement(isolate_, ffi_.ToHandleChecked(),
+                                    module_name)
+           .ToHandle(&module) ||
+      !IsJSReceiver(*module)) {
+    const char* error = module.is_null()
+                            ? "module not found"
+                            : "module is not an object or function";
+    thrower_->TypeError("%s: %s", ImportName(index, module_name).c_str(),
+                        error);
+    return {};
   }
 
-  result = Object::GetPropertyOrElement(isolate_, module, import_name);
-  if (result.is_null()) {
-    ReportLinkError("import not found", index, module_name, import_name);
-    return MaybeHandle<JSFunction>();
+  MaybeHandle<Object> value =
+      Object::GetPropertyOrElement(isolate_, module, import_name);
+  if (value.is_null()) {
+    thrower_->LinkError("%s: import not found",
+                        ImportName(index, module_name, import_name).c_str());
+    return {};
   }
 
-  return result;
+  return value;
 }
 
 namespace {
@@ -1255,9 +1412,9 @@ bool HasDefaultToNumberBehaviour(Isolate* isolate,
                              isolate->factory()->valueOf_string()};
   if (value_of_it.state() != LookupIterator::DATA) return false;
   Handle<Object> value_of = value_of_it.GetDataValue();
-  if (!value_of->IsJSFunction()) return false;
+  if (!IsJSFunction(*value_of)) return false;
   Builtin value_of_builtin_id =
-      Handle<JSFunction>::cast(value_of)->code().builtin_id();
+      Handle<JSFunction>::cast(value_of)->code()->builtin_id();
   if (value_of_builtin_id != Builtin::kObjectPrototypeValueOf) return false;
 
   // The {toString} member must be the default "FunctionPrototypeToString".
@@ -1265,9 +1422,9 @@ bool HasDefaultToNumberBehaviour(Isolate* isolate,
                               isolate->factory()->toString_string()};
   if (to_string_it.state() != LookupIterator::DATA) return false;
   Handle<Object> to_string = to_string_it.GetDataValue();
-  if (!to_string->IsJSFunction()) return false;
+  if (!IsJSFunction(*to_string)) return false;
   Builtin to_string_builtin_id =
-      Handle<JSFunction>::cast(to_string)->code().builtin_id();
+      Handle<JSFunction>::cast(to_string)->code()->builtin_id();
   if (to_string_builtin_id != Builtin::kFunctionPrototypeToString) return false;
 
   // Just a default function, which will convert to "Nan". Accept this.
@@ -1292,7 +1449,9 @@ MaybeHandle<Object> InstanceBuilder::LookupImportAsm(
     uint32_t index, Handle<String> import_name) {
   // Check that a foreign function interface object was provided.
   if (ffi_.is_null()) {
-    return ReportLinkError("missing imports object", index, import_name);
+    thrower_->LinkError("%s: missing imports object",
+                        ImportName(index, import_name).c_str());
+    return {};
   }
 
   // Perform lookup of the given {import_name} without causing any observable
@@ -1308,7 +1467,9 @@ MaybeHandle<Object> InstanceBuilder::LookupImportAsm(
     case LookupIterator::WASM_OBJECT:
     case LookupIterator::ACCESSOR:
     case LookupIterator::TRANSITION:
-      return ReportLinkError("not a data property", index, import_name);
+      thrower_->LinkError("%s: not a data property",
+                          ImportName(index, import_name).c_str());
+      return {};
     case LookupIterator::NOT_FOUND:
       // Accepting missing properties as undefined does not cause any
       // observable difference from JavaScript semantics, we are lenient.
@@ -1319,12 +1480,13 @@ MaybeHandle<Object> InstanceBuilder::LookupImportAsm(
       // {ProcessImportedGlobal}), but only if we can easily determine that
       // their Number-conversion is side effect free and returns NaN (which is
       // the case as long as "valueOf" (or others) are not overwritten).
-      if (value->IsJSFunction() &&
+      if (IsJSFunction(*value) &&
           module_->import_table[index].kind == kExternalGlobal &&
           !HasDefaultToNumberBehaviour(isolate_,
                                        Handle<JSFunction>::cast(value))) {
-        return ReportLinkError("function has special ToNumber behaviour", index,
-                               import_name);
+        thrower_->LinkError("%s: function has special ToNumber behaviour",
+                            ImportName(index, import_name).c_str());
+        return {};
       }
       return value;
     }
@@ -1341,8 +1503,9 @@ void InstanceBuilder::LoadDataSegments(Handle<WasmInstanceObject> instance) {
     // Passive segments are not copied during instantiation.
     if (!segment.active) continue;
 
+    const WasmMemory& dst_memory = module_->memories[segment.memory_index];
     size_t dest_offset;
-    if (module_->is_memory64) {
+    if (dst_memory.is_memory64) {
       ValueOrError result = EvaluateConstantExpression(
           &init_expr_zone_, segment.dest_addr, kWasmI64, isolate_, instance);
       if (MaybeMarkError(result, thrower_)) return;
@@ -1350,7 +1513,7 @@ void InstanceBuilder::LoadDataSegments(Handle<WasmInstanceObject> instance) {
 
       // Clamp to {std::numeric_limits<size_t>::max()}, which is always an
       // invalid offset.
-      DCHECK_GT(std::numeric_limits<size_t>::max(), instance->memory_size());
+      DCHECK_GT(std::numeric_limits<size_t>::max(), dst_memory.max_memory_size);
       dest_offset = static_cast<size_t>(std::min(
           dest_offset_64, uint64_t{std::numeric_limits<size_t>::max()}));
     } else {
@@ -1360,12 +1523,18 @@ void InstanceBuilder::LoadDataSegments(Handle<WasmInstanceObject> instance) {
       dest_offset = to_value(result).to_u32();
     }
 
-    if (!base::IsInBounds<size_t>(dest_offset, size, instance->memory_size())) {
-      thrower_->RuntimeError("data segment is out of bounds");
+    size_t memory_size = instance->memory_size(segment.memory_index);
+    if (!base::IsInBounds<size_t>(dest_offset, size, memory_size)) {
+      size_t segment_index = &segment - module_->data_segments.data();
+      thrower_->RuntimeError(
+          "data segment %zu is out of bounds (offset %zu, "
+          "length %u, memory size %zu)",
+          segment_index, dest_offset, size, memory_size);
       return;
     }
 
-    std::memcpy(instance->memory_start() + dest_offset,
+    uint8_t* memory_base = instance->memory_base(segment.memory_index);
+    std::memcpy(memory_base + dest_offset,
                 wire_bytes.begin() + segment.source.offset(), size);
   }
 }
@@ -1374,12 +1543,12 @@ void InstanceBuilder::WriteGlobalValue(const WasmGlobal& global,
                                        const WasmValue& value) {
   TRACE("init [globals_start=%p + %u] = %s, type = %s\n",
         global.type.is_reference()
-            ? reinterpret_cast<byte*>(tagged_globals_->address())
+            ? reinterpret_cast<uint8_t*>(tagged_globals_->address())
             : raw_buffer_ptr(untagged_globals_, 0),
         global.offset, value.to_string().c_str(), global.type.name().c_str());
   DCHECK(IsSubtypeOf(value.type(), global.type, module_));
   if (global.type.is_numeric()) {
-    value.CopyTo(GetRawUntaggedGlobalPtr<byte>(global));
+    value.CopyTo(GetRawUntaggedGlobalPtr<uint8_t>(global));
   } else {
     tagged_globals_->set(global.offset, *value.to_ref());
   }
@@ -1413,31 +1582,15 @@ void InstanceBuilder::SanitizeImports() {
   }
 }
 
-bool InstanceBuilder::FindImportedMemory() {
-  DCHECK_EQ(module_->import_table.size(), sanitized_imports_.size());
-  for (size_t index = 0; index < module_->import_table.size(); index++) {
-    WasmImport import = module_->import_table[index];
-
-    if (import.kind == kExternalMemory) {
-      auto& value = sanitized_imports_[index].value;
-      if (!value->IsWasmMemoryObject()) return false;
-      memory_object_ = Handle<WasmMemoryObject>::cast(value);
-      memory_buffer_ =
-          Handle<JSArrayBuffer>(memory_object_->array_buffer(), isolate_);
-      return true;
-    }
-  }
-  return false;
-}
-
 bool InstanceBuilder::ProcessImportedFunction(
     Handle<WasmInstanceObject> instance, int import_index, int func_index,
     Handle<String> module_name, Handle<String> import_name,
     Handle<Object> value) {
   // Function imports must be callable.
-  if (!value->IsCallable()) {
-    ReportLinkError("function import requires a callable", import_index,
-                    module_name, import_name);
+  if (!IsCallable(*value)) {
+    thrower_->LinkError(
+        "%s: function import requires a callable",
+        ImportName(import_index, module_name, import_name).c_str());
     return false;
   }
   // Store any {WasmExternalFunction} callable in the instance before the call
@@ -1455,14 +1608,21 @@ bool InstanceBuilder::ProcessImportedFunction(
   uint32_t sig_index = module_->functions[func_index].sig_index;
   uint32_t canonical_type_index =
       module_->isorecursive_canonical_type_ids[sig_index];
-  WasmImportData resolved(js_receiver, expected_sig, canonical_type_index);
+  WasmImportData resolved(instance, func_index, js_receiver, expected_sig,
+                          canonical_type_index);
+  if (resolved.well_known_status() != WellKnownImport::kGeneric &&
+      v8_flags.trace_wasm_inlining) {
+    PrintF("[import %d is well-known built-in %s]\n", import_index,
+           WellKnownImportName(resolved.well_known_status()));
+  }
   well_known_imports_.push_back(resolved.well_known_status());
   ImportCallKind kind = resolved.kind();
   js_receiver = resolved.callable();
   switch (kind) {
     case ImportCallKind::kLinkError:
-      ReportLinkError("imported function does not match the expected type",
-                      import_index, module_name, import_name);
+      thrower_->LinkError(
+          "%s: imported function does not match the expected type",
+          ImportName(import_index, module_name, import_name).c_str());
       return false;
     case ImportCallKind::kWasmToWasm: {
       // The imported function is a Wasm function from another instance.
@@ -1476,7 +1636,7 @@ bool InstanceBuilder::ProcessImportedFunction(
       break;
     }
     case ImportCallKind::kWasmToCapi: {
-      NativeModule* native_module = instance->module_object().native_module();
+      NativeModule* native_module = instance->module_object()->native_module();
       int expected_arity = static_cast<int>(expected_sig->parameter_count());
       WasmImportWrapperCache* cache = native_module->import_wrapper_cache();
       // TODO(jkummerow): Consider precompiling CapiCallWrappers in parallel,
@@ -1504,31 +1664,40 @@ bool InstanceBuilder::ProcessImportedFunction(
       ImportedFunctionEntry entry(instance, func_index);
       // We re-use the SetWasmToJs infrastructure because it passes the
       // callable to the wrapper, which we need to get the function data.
-      entry.SetWasmToJs(isolate_, js_receiver, wasm_code, kNoSuspend);
+      entry.SetWasmToJs(isolate_, js_receiver, wasm_code, kNoSuspend,
+                        expected_sig);
       break;
     }
     case ImportCallKind::kWasmToJSFastApi: {
-      NativeModule* native_module = instance->module_object().native_module();
-      DCHECK(js_receiver->IsJSFunction() || js_receiver->IsJSBoundFunction());
+      NativeModule* native_module = instance->module_object()->native_module();
+      DCHECK(IsJSFunction(*js_receiver) || IsJSBoundFunction(*js_receiver));
       WasmCodeRefScope code_ref_scope;
       WasmCode* wasm_code = compiler::CompileWasmJSFastCallWrapper(
           native_module, expected_sig, js_receiver);
       ImportedFunctionEntry entry(instance, func_index);
-      entry.SetWasmToJs(isolate_, js_receiver, wasm_code, kNoSuspend);
+      entry.SetWasmToJs(isolate_, js_receiver, wasm_code, kNoSuspend,
+                        expected_sig);
       break;
     }
     default: {
       // The imported function is a callable.
-
+      if (UseGenericWasmToJSWrapper(kind, expected_sig, resolved.suspend()) &&
+          (kind == ImportCallKind::kJSFunctionArityMatch ||
+           kind == ImportCallKind::kJSFunctionArityMismatch)) {
+        ImportedFunctionEntry entry(instance, func_index);
+        entry.SetWasmToJs(isolate_, js_receiver, resolved.suspend(),
+                          expected_sig);
+        break;
+      }
       int expected_arity = static_cast<int>(expected_sig->parameter_count());
       if (kind == ImportCallKind::kJSFunctionArityMismatch) {
         Handle<JSFunction> function = Handle<JSFunction>::cast(js_receiver);
-        SharedFunctionInfo shared = function->shared();
+        Tagged<SharedFunctionInfo> shared = function->shared();
         expected_arity =
-            shared.internal_formal_parameter_count_without_receiver();
+            shared->internal_formal_parameter_count_without_receiver();
       }
 
-      NativeModule* native_module = instance->module_object().native_module();
+      NativeModule* native_module = instance->module_object()->native_module();
       uint32_t canonical_type_index =
           module_->isorecursive_canonical_type_ids
               [module_->functions[func_index].sig_index];
@@ -1538,7 +1707,8 @@ bool InstanceBuilder::ProcessImportedFunction(
       ImportedFunctionEntry entry(instance, func_index);
       if (wasm_code->kind() == WasmCode::kWasmToJsWrapper) {
         // Wasm to JS wrappers are treated specially in the import table.
-        entry.SetWasmToJs(isolate_, js_receiver, wasm_code, resolved.suspend());
+        entry.SetWasmToJs(isolate_, js_receiver, wasm_code, resolved.suspend(),
+                          expected_sig);
       } else {
         // Wasm math intrinsics are compiled as regular Wasm functions.
         DCHECK(kind >= ImportCallKind::kFirstMathIntrinsic &&
@@ -1584,14 +1754,27 @@ bool InstanceBuilder::InitializeImportedIndirectFunctionTable(
 
     Handle<WasmInstanceObject> target_instance =
         maybe_target_instance.ToHandleChecked();
-    const WasmModule* target_module = target_instance->module_object().module();
+    const WasmModule* target_module =
+        target_instance->module_object()->module();
     const WasmFunction& function = target_module->functions[function_index];
 
     FunctionTargetAndRef entry(target_instance, function_index);
+    Handle<Object> ref = entry.ref();
+    if (v8_flags.wasm_to_js_generic_wrapper && IsWasmApiFunctionRef(*ref)) {
+      Handle<WasmApiFunctionRef> orig_ref =
+          Handle<WasmApiFunctionRef>::cast(ref);
+      Handle<WasmApiFunctionRef> new_ref =
+          isolate_->factory()->NewWasmApiFunctionRef(orig_ref);
+      WasmApiFunctionRef::SetCrossInstanceTableIndexAsCallOrigin(
+          isolate_, new_ref, instance, i);
+      ref = new_ref;
+    }
+
     uint32_t canonicalized_sig_index =
         target_module->isorecursive_canonical_type_ids[function.sig_index];
+
     instance->GetIndirectFunctionTable(isolate_, table_index)
-        ->Set(i, canonicalized_sig_index, entry.call_target(), *entry.ref());
+        ->Set(i, canonicalized_sig_index, entry.call_target(), *ref);
   }
   return true;
 }
@@ -1601,9 +1784,10 @@ bool InstanceBuilder::ProcessImportedTable(Handle<WasmInstanceObject> instance,
                                            Handle<String> module_name,
                                            Handle<String> import_name,
                                            Handle<Object> value) {
-  if (!value->IsWasmTableObject()) {
-    ReportLinkError("table import requires a WebAssembly.Table", import_index,
-                    module_name, import_name);
+  if (!IsWasmTableObject(*value)) {
+    thrower_->LinkError(
+        "%s: table import requires a WebAssembly.Table",
+        ImportName(import_index, module_name, import_name).c_str());
     return false;
   }
   const WasmTable& table = module_->tables[table_index];
@@ -1619,12 +1803,13 @@ bool InstanceBuilder::ProcessImportedTable(Handle<WasmInstanceObject> instance,
   }
 
   if (table.has_maximum_size) {
-    if (table_object->maximum_length().IsUndefined(isolate_)) {
+    if (IsUndefined(table_object->maximum_length(), isolate_)) {
       thrower_->LinkError("table import %d has no maximum length, expected %u",
                           import_index, table.maximum_size);
       return false;
     }
-    int64_t imported_maximum_size = table_object->maximum_length().Number();
+    int64_t imported_maximum_size =
+        Object::Number(table_object->maximum_length());
     if (imported_maximum_size < 0) {
       thrower_->LinkError("table import %d has no maximum length, expected %u",
                           import_index, table.maximum_size);
@@ -1640,14 +1825,15 @@ bool InstanceBuilder::ProcessImportedTable(Handle<WasmInstanceObject> instance,
   }
 
   const WasmModule* table_type_module =
-      !table_object->instance().IsUndefined()
-          ? WasmInstanceObject::cast(table_object->instance()).module()
+      !IsUndefined(table_object->instance())
+          ? WasmInstanceObject::cast(table_object->instance())->module()
           : instance->module();
 
   if (!EquivalentTypes(table.type, table_object->type(), module_,
                        table_type_module)) {
-    ReportLinkError("imported table does not match the expected type",
-                    import_index, module_name, import_name);
+    thrower_->LinkError(
+        "%s: imported table does not match the expected type",
+        ImportName(import_index, module_name, import_name).c_str());
     return false;
   }
 
@@ -1657,60 +1843,7 @@ bool InstanceBuilder::ProcessImportedTable(Handle<WasmInstanceObject> instance,
     return false;
   }
 
-  instance->tables().set(table_index, *value);
-  return true;
-}
-
-bool InstanceBuilder::ProcessImportedMemory(Handle<WasmInstanceObject> instance,
-                                            int import_index,
-                                            Handle<String> module_name,
-                                            Handle<String> import_name,
-                                            Handle<Object> value) {
-  if (!value->IsWasmMemoryObject()) {
-    ReportLinkError("memory import must be a WebAssembly.Memory object",
-                    import_index, module_name, import_name);
-    return false;
-  }
-  auto memory_object = Handle<WasmMemoryObject>::cast(value);
-
-  // The imported memory should have been already set up early.
-  CHECK_EQ(instance->memory_object(), *memory_object);
-
-  Handle<JSArrayBuffer> buffer(memory_object_->array_buffer(), isolate_);
-  // memory_ should have already been assigned in Build().
-  DCHECK_EQ(*memory_buffer_.ToHandleChecked(), *buffer);
-  uint32_t imported_cur_pages =
-      static_cast<uint32_t>(buffer->byte_length() / kWasmPageSize);
-  if (imported_cur_pages < module_->initial_pages) {
-    thrower_->LinkError("memory import %d is smaller than initial %u, got %u",
-                        import_index, module_->initial_pages,
-                        imported_cur_pages);
-    return false;
-  }
-  int32_t imported_maximum_pages = memory_object_->maximum_pages();
-  if (module_->has_maximum_pages) {
-    if (imported_maximum_pages < 0) {
-      thrower_->LinkError(
-          "memory import %d has no maximum limit, expected at most %u",
-          import_index, imported_maximum_pages);
-      return false;
-    }
-    if (static_cast<uint32_t>(imported_maximum_pages) >
-        module_->maximum_pages) {
-      thrower_->LinkError(
-          "memory import %d has a larger maximum size %u than the "
-          "module's declared maximum %u",
-          import_index, imported_maximum_pages, module_->maximum_pages);
-      return false;
-    }
-  }
-  if (module_->has_shared_memory != buffer->is_shared()) {
-    thrower_->LinkError(
-        "mismatch in shared state of memory, declared = %d, imported = %d",
-        module_->has_shared_memory, buffer->is_shared());
-    return false;
-  }
-
+  instance->tables()->set(table_index, *value);
   return true;
 }
 
@@ -1719,14 +1852,15 @@ bool InstanceBuilder::ProcessImportedWasmGlobalObject(
     Handle<String> module_name, Handle<String> import_name,
     const WasmGlobal& global, Handle<WasmGlobalObject> global_object) {
   if (static_cast<bool>(global_object->is_mutable()) != global.mutability) {
-    ReportLinkError("imported global does not match the expected mutability",
-                    import_index, module_name, import_name);
+    thrower_->LinkError(
+        "%s: imported global does not match the expected mutability",
+        ImportName(import_index, module_name, import_name).c_str());
     return false;
   }
 
   const WasmModule* global_type_module =
-      !global_object->instance().IsUndefined()
-          ? WasmInstanceObject::cast(global_object->instance()).module()
+      !IsUndefined(global_object->instance())
+          ? WasmInstanceObject::cast(global_object->instance())->module()
           : instance->module();
 
   bool valid_type =
@@ -1737,8 +1871,9 @@ bool InstanceBuilder::ProcessImportedWasmGlobalObject(
                         instance->module());
 
   if (!valid_type) {
-    ReportLinkError("imported global does not match the expected type",
-                    import_index, module_name, import_name);
+    thrower_->LinkError(
+        "%s: imported global does not match the expected type",
+        ImportName(import_index, module_name, import_name).c_str());
     return false;
   }
   if (global.mutability) {
@@ -1751,8 +1886,8 @@ bool InstanceBuilder::ProcessImportedWasmGlobalObject(
       buffer = handle(global_object->tagged_buffer(), isolate_);
       // For externref globals we use a relative offset, not an absolute
       // address.
-      instance->imported_mutable_globals().set_int(
-          global.index * kSystemPointerSize, global_object->offset());
+      instance->imported_mutable_globals()->set(global.index,
+                                                global_object->offset());
     } else {
       buffer = handle(global_object->untagged_buffer(), isolate_);
       // It is safe in this case to store the raw pointer to the buffer
@@ -1760,10 +1895,10 @@ bool InstanceBuilder::ProcessImportedWasmGlobalObject(
       // relocated.
       Address address = reinterpret_cast<Address>(raw_buffer_ptr(
           Handle<JSArrayBuffer>::cast(buffer), global_object->offset()));
-      instance->imported_mutable_globals().set_sandboxed_pointer(
-          global.index * kSystemPointerSize, address);
+      instance->imported_mutable_globals()->set_sandboxed_pointer(global.index,
+                                                                  address);
     }
-    instance->imported_mutable_globals_buffers().set(global.index, *buffer);
+    instance->imported_mutable_globals_buffers()->set(global.index, *buffer);
     return true;
   }
 
@@ -1818,9 +1953,10 @@ bool InstanceBuilder::ProcessImportedGlobal(Handle<WasmInstanceObject> instance,
   // defines constructing a WebAssembly.Global of v128 to be a TypeError.
   // We *should* never hit this case in the JS API, but the module should should
   // be allowed to declare such a global (no validation error).
-  if (global.type == kWasmS128 && !value->IsWasmGlobalObject()) {
-    ReportLinkError("global import of type v128 must be a WebAssembly.Global",
-                    import_index, module_name, import_name);
+  if (global.type == kWasmS128 && !IsWasmGlobalObject(*value)) {
+    thrower_->LinkError(
+        "%s: global import of type v128 must be a WebAssembly.Global",
+        ImportName(import_index, module_name, import_name).c_str());
     return false;
   }
 
@@ -1831,30 +1967,31 @@ bool InstanceBuilder::ProcessImportedGlobal(Handle<WasmInstanceObject> instance,
     // conversion via {ToPrimitive} would produce as well. {LookupImportAsm}
     // checked via {HasDefaultToNumberBehaviour} that "valueOf" or friends have
     // not been patched.
-    if (value->IsJSFunction()) value = isolate_->factory()->nan_value();
-    if (value->IsPrimitive()) {
+    if (IsJSFunction(*value)) value = isolate_->factory()->nan_value();
+    if (IsPrimitive(*value)) {
       MaybeHandle<Object> converted = global.type == kWasmI32
                                           ? Object::ToInt32(isolate_, value)
                                           : Object::ToNumber(isolate_, value);
       if (!converted.ToHandle(&value)) {
         // Conversion is known to fail for Symbols and BigInts.
-        ReportLinkError("global import must be a number", import_index,
-                        module_name, import_name);
+        thrower_->LinkError(
+            "%s: global import must be a number",
+            ImportName(import_index, module_name, import_name).c_str());
         return false;
       }
     }
   }
 
-  if (value->IsWasmGlobalObject()) {
+  if (IsWasmGlobalObject(*value)) {
     auto global_object = Handle<WasmGlobalObject>::cast(value);
     return ProcessImportedWasmGlobalObject(instance, import_index, module_name,
                                            import_name, global, global_object);
   }
 
   if (global.mutability) {
-    ReportLinkError(
-        "imported mutable global must be a WebAssembly.Global object",
-        import_index, module_name, import_name);
+    thrower_->LinkError(
+        "%s: imported mutable global must be a WebAssembly.Global object",
+        ImportName(import_index, module_name, import_name).c_str());
     return false;
   }
 
@@ -1864,15 +2001,17 @@ bool InstanceBuilder::ProcessImportedGlobal(Handle<WasmInstanceObject> instance,
     if (!wasm::JSToWasmObject(isolate_, module_, value, global.type,
                               &error_message)
              .ToHandle(&wasm_value)) {
-      ReportLinkError(error_message, global_index, module_name, import_name);
+      thrower_->LinkError(
+          "%s: %s", ImportName(global_index, module_name, import_name).c_str(),
+          error_message);
       return false;
     }
     WriteGlobalValue(global, WasmValue(wasm_value, global.type));
     return true;
   }
 
-  if (value->IsNumber() && global.type != kWasmI64) {
-    double number_value = value->Number();
+  if (IsNumber(*value) && global.type != kWasmI64) {
+    double number_value = Object::Number(*value);
     // The Wasm-BigInt proposal currently says that i64 globals may
     // only be initialized with BigInts. See:
     // https://github.com/WebAssembly/JS-BigInt-integration/issues/12
@@ -1885,15 +2024,15 @@ bool InstanceBuilder::ProcessImportedGlobal(Handle<WasmInstanceObject> instance,
     return true;
   }
 
-  if (global.type == kWasmI64 && value->IsBigInt()) {
-    WriteGlobalValue(global, WasmValue(BigInt::cast(*value).AsInt64()));
+  if (global.type == kWasmI64 && IsBigInt(*value)) {
+    WriteGlobalValue(global, WasmValue(BigInt::cast(*value)->AsInt64()));
     return true;
   }
 
-  ReportLinkError(
-      "global import must be a number, valid Wasm reference, or "
+  thrower_->LinkError(
+      "%s: global import must be a number, valid Wasm reference, or "
       "WebAssembly.Global object",
-      import_index, module_name, import_name);
+      ImportName(import_index, module_name, import_name).c_str());
   return false;
 }
 
@@ -1902,7 +2041,7 @@ void InstanceBuilder::CompileImportWrappers(
   int num_imports = static_cast<int>(module_->import_table.size());
   TRACE_EVENT1("v8.wasm", "wasm.CompileImportWrappers", "num_imports",
                num_imports);
-  NativeModule* native_module = instance->module_object().native_module();
+  NativeModule* native_module = instance->module_object()->native_module();
   WasmImportWrapperCache::ModificationScope cache_scope(
       native_module->import_wrapper_cache());
 
@@ -1915,7 +2054,7 @@ void InstanceBuilder::CompileImportWrappers(
   for (int index = 0; index < num_imports; ++index) {
     Handle<Object> value = sanitized_imports_[index].value;
     if (module_->import_table[index].kind != kExternalFunction ||
-        !value->IsCallable()) {
+        !IsCallable(*value)) {
       continue;
     }
     auto js_receiver = Handle<JSReceiver>::cast(value);
@@ -1924,7 +2063,11 @@ void InstanceBuilder::CompileImportWrappers(
     uint32_t sig_index = module_->functions[func_index].sig_index;
     uint32_t canonical_type_index =
         module_->isorecursive_canonical_type_ids[sig_index];
-    WasmImportData resolved(js_receiver, sig, canonical_type_index);
+    WasmImportData resolved({}, func_index, js_receiver, sig,
+                            canonical_type_index);
+    if (UseGenericWasmToJSWrapper(resolved.kind(), sig, resolved.suspend())) {
+      continue;
+    }
     ImportCallKind kind = resolved.kind();
     if (kind == ImportCallKind::kWasmToWasm ||
         kind == ImportCallKind::kLinkError ||
@@ -1937,9 +2080,9 @@ void InstanceBuilder::CompileImportWrappers(
     if (kind == ImportCallKind::kJSFunctionArityMismatch) {
       Handle<JSFunction> function =
           Handle<JSFunction>::cast(resolved.callable());
-      SharedFunctionInfo shared = function->shared();
+      Tagged<SharedFunctionInfo> shared = function->shared();
       expected_arity =
-          shared.internal_formal_parameter_count_without_receiver();
+          shared->internal_formal_parameter_count_without_receiver();
     }
     WasmImportWrapperCache::CacheKey key(kind, canonical_type_index,
                                          expected_arity, resolved.suspend());
@@ -1999,13 +2142,10 @@ int InstanceBuilder::ProcessImports(Handle<WasmInstanceObject> instance) {
         USE(num_imported_tables);
         break;
       }
-      case kExternalMemory: {
-        if (!ProcessImportedMemory(instance, index, module_name, import_name,
-                                   value)) {
-          return -1;
-        }
+      case kExternalMemory:
+        // Imported memories are already handled earlier via
+        // {ProcessImportedMemories}.
         break;
-      }
       case kExternalGlobal: {
         if (!ProcessImportedGlobal(instance, index, import.index, module_name,
                                    import_name, value)) {
@@ -2014,22 +2154,24 @@ int InstanceBuilder::ProcessImports(Handle<WasmInstanceObject> instance) {
         break;
       }
       case kExternalTag: {
-        if (!value->IsWasmTagObject()) {
-          ReportLinkError("tag import requires a WebAssembly.Tag", index,
-                          module_name, import_name);
+        if (!IsWasmTagObject(*value)) {
+          thrower_->LinkError(
+              "%s: tag import requires a WebAssembly.Tag",
+              ImportName(index, module_name, import_name).c_str());
           return -1;
         }
         Handle<WasmTagObject> imported_tag = Handle<WasmTagObject>::cast(value);
         if (!imported_tag->MatchesSignature(
                 module_->isorecursive_canonical_type_ids
                     [module_->tags[import.index].sig_index])) {
-          ReportLinkError("imported tag does not match the expected type",
-                          index, module_name, import_name);
+          thrower_->LinkError(
+              "%s: imported tag does not match the expected type",
+              ImportName(index, module_name, import_name).c_str());
           return -1;
         }
-        Object tag = imported_tag->tag();
-        DCHECK(instance->tags_table().get(import.index).IsUndefined());
-        instance->tags_table().set(import.index, tag);
+        Tagged<Object> tag = imported_tag->tag();
+        DCHECK(IsUndefined(instance->tags_table()->get(import.index)));
+        instance->tags_table()->set(import.index, tag);
         tags_wrappers_[import.index] = imported_tag;
         break;
       }
@@ -2049,6 +2191,85 @@ int InstanceBuilder::ProcessImports(Handle<WasmInstanceObject> instance) {
   return num_imported_functions;
 }
 
+bool InstanceBuilder::ProcessImportedMemories(
+    Handle<FixedArray> imported_memory_objects) {
+  DCHECK_EQ(module_->import_table.size(), sanitized_imports_.size());
+
+  int num_imports = static_cast<int>(module_->import_table.size());
+  for (int import_index = 0; import_index < num_imports; ++import_index) {
+    const WasmImport& import = module_->import_table[import_index];
+
+    if (import.kind != kExternalMemory) continue;
+
+    Handle<String> module_name = sanitized_imports_[import_index].module_name;
+    Handle<String> import_name = sanitized_imports_[import_index].import_name;
+    Handle<Object> value = sanitized_imports_[import_index].value;
+
+    if (!IsWasmMemoryObject(*value)) {
+      thrower_->LinkError(
+          "%s: memory import must be a WebAssembly.Memory object",
+          ImportName(import_index, module_name, import_name).c_str());
+      return false;
+    }
+    uint32_t memory_index = import.index;
+    auto memory_object = Handle<WasmMemoryObject>::cast(value);
+
+    Handle<JSArrayBuffer> buffer{memory_object->array_buffer(), isolate_};
+    uint32_t imported_cur_pages =
+        static_cast<uint32_t>(buffer->byte_length() / kWasmPageSize);
+    const WasmMemory* memory = &module_->memories[memory_index];
+    if (memory->is_memory64 != memory_object->is_memory64()) {
+      // For now, we forbid importing memory32 as memory64 and vice versa.
+      // TODO(13780): Check if the final spec says anything about this or has
+      // any tests. Adapt if needed.
+      thrower_->LinkError("cannot import memory%d as memory%d",
+                          memory_object->is_memory64() ? 64 : 32,
+                          memory->is_memory64 ? 64 : 32);
+      return false;
+    }
+    if (imported_cur_pages < memory->initial_pages) {
+      thrower_->LinkError(
+          "%s: memory import has %u pages which is smaller than the declared "
+          "initial of %u",
+          ImportName(import_index, module_name, import_name).c_str(),
+          imported_cur_pages, memory->initial_pages);
+      return false;
+    }
+    int32_t imported_maximum_pages = memory_object->maximum_pages();
+    if (memory->has_maximum_pages) {
+      if (imported_maximum_pages < 0) {
+        thrower_->LinkError(
+            "%s: memory import has no maximum limit, expected at most %u",
+            ImportName(import_index, module_name, import_name).c_str(),
+            imported_maximum_pages);
+        return false;
+      }
+      if (static_cast<uint32_t>(imported_maximum_pages) >
+          memory->maximum_pages) {
+        thrower_->LinkError(
+            "%s: memory import has a larger maximum size %u than the "
+            "module's declared maximum %u",
+            ImportName(import_index, module_name, import_name).c_str(),
+            imported_maximum_pages, memory->maximum_pages);
+        return false;
+      }
+    }
+    if (memory->is_shared != buffer->is_shared()) {
+      thrower_->LinkError(
+          "%s: mismatch in shared state of memory, declared = %d, imported = "
+          "%d",
+          ImportName(import_index, module_name, import_name).c_str(),
+          memory->is_shared, buffer->is_shared());
+      return false;
+    }
+
+    DCHECK_EQ(ReadOnlyRoots{isolate_}.undefined_value(),
+              imported_memory_objects->get(memory_index));
+    imported_memory_objects->set(memory_index, *memory_object);
+  }
+  return true;
+}
+
 template <typename T>
 T* InstanceBuilder::GetRawUntaggedGlobalPtr(const WasmGlobal& global) {
   return reinterpret_cast<T*>(raw_buffer_ptr(untagged_globals_, global.offset));
@@ -2068,32 +2289,31 @@ void InstanceBuilder::InitGlobals(Handle<WasmInstanceObject> instance) {
     if (global.type.is_reference()) {
       tagged_globals_->set(global.offset, *to_value(result).to_ref());
     } else {
-      to_value(result).CopyTo(GetRawUntaggedGlobalPtr<byte>(global));
+      to_value(result).CopyTo(GetRawUntaggedGlobalPtr<uint8_t>(global));
     }
   }
 }
 
 // Allocate memory for a module instance as a new JSArrayBuffer.
-bool InstanceBuilder::AllocateMemory() {
-  int initial_pages = static_cast<int>(module_->initial_pages);
-  int maximum_pages = module_->has_maximum_pages
-                          ? static_cast<int>(module_->maximum_pages)
+MaybeHandle<WasmMemoryObject> InstanceBuilder::AllocateMemory(
+    uint32_t memory_index) {
+  const WasmMemory& memory = module_->memories[memory_index];
+  int initial_pages = static_cast<int>(memory.initial_pages);
+  int maximum_pages = memory.has_maximum_pages
+                          ? static_cast<int>(memory.maximum_pages)
                           : WasmMemoryObject::kNoMaximum;
-  auto shared =
-      module_->has_shared_memory ? SharedFlag::kShared : SharedFlag::kNotShared;
-
-  auto mem_type = module_->is_memory64 ? WasmMemoryFlag::kWasmMemory64
-                                       : WasmMemoryFlag::kWasmMemory32;
-  if (!WasmMemoryObject::New(isolate_, initial_pages, maximum_pages, shared,
-                             mem_type)
-           .ToHandle(&memory_object_)) {
+  auto shared = memory.is_shared ? SharedFlag::kShared : SharedFlag::kNotShared;
+
+  auto mem_type = memory.is_memory64 ? WasmMemoryFlag::kWasmMemory64
+                                     : WasmMemoryFlag::kWasmMemory32;
+  MaybeHandle<WasmMemoryObject> maybe_memory_object = WasmMemoryObject::New(
+      isolate_, initial_pages, maximum_pages, shared, mem_type);
+  if (maybe_memory_object.is_null()) {
     thrower_->RangeError(
         "Out of memory: Cannot allocate Wasm memory for new instance");
-    return false;
+    return {};
   }
-  memory_buffer_ =
-      Handle<JSArrayBuffer>(memory_object_->array_buffer(), isolate_);
-  return true;
+  return maybe_memory_object;
 }
 
 // Process the exports, creating wrappers for functions, tables, memories,
@@ -2119,7 +2339,7 @@ void InstanceBuilder::ProcessExports(Handle<WasmInstanceObject> instance) {
       }
     } else if (import.kind == kExternalGlobal) {
       Handle<Object> value = sanitized_imports_[index].value;
-      if (value->IsWasmGlobalObject()) {
+      if (IsWasmGlobalObject(*value)) {
         imported_globals[import.index] = value;
       }
     }
@@ -2152,12 +2372,11 @@ void InstanceBuilder::ProcessExports(Handle<WasmInstanceObject> instance) {
     switch (exp.kind) {
       case kExternalFunction: {
         // Wrap and export the code as a JSFunction.
-        // TODO(wasm): reduce duplication with LoadElemSegment() further below
         Handle<WasmInternalFunction> internal =
             WasmInstanceObject::GetOrCreateWasmInternalFunction(
                 isolate_, instance, exp.index);
-        Handle<WasmExternalFunction> wasm_external_function =
-            handle(WasmExternalFunction::cast(internal->external()), isolate_);
+        Handle<JSFunction> wasm_external_function =
+            WasmInternalFunction::GetOrCreateExternal(internal);
         desc.set_value(wasm_external_function);
 
         if (is_asm_js &&
@@ -2168,16 +2387,14 @@ void InstanceBuilder::ProcessExports(Handle<WasmInstanceObject> instance) {
         break;
       }
       case kExternalTable: {
-        desc.set_value(handle(instance->tables().get(exp.index), isolate_));
+        desc.set_value(handle(instance->tables()->get(exp.index), isolate_));
         break;
       }
       case kExternalMemory: {
         // Export the memory as a WebAssembly.Memory object. A WasmMemoryObject
         // should already be available if the module has memory, since we always
         // create or import it when building an WasmInstanceObject.
-        DCHECK(instance->has_memory_object());
-        desc.set_value(
-            Handle<WasmMemoryObject>(instance->memory_object(), isolate_));
+        desc.set_value(handle(instance->memory_object(exp.index), isolate_));
         break;
       }
       case kExternalGlobal: {
@@ -2201,15 +2418,15 @@ void InstanceBuilder::ProcessExports(Handle<WasmInstanceObject> instance) {
                 FixedArray::cast(buffers_array->get(global.index)), isolate_);
             // For externref globals we store the relative offset in the
             // imported_mutable_globals array instead of an absolute address.
-            offset = instance->imported_mutable_globals().get_int(
-                global.index * kSystemPointerSize);
+            offset = static_cast<uint32_t>(
+                instance->imported_mutable_globals()->get(global.index));
           } else {
             untagged_buffer =
                 handle(JSArrayBuffer::cast(buffers_array->get(global.index)),
                        isolate_);
             Address global_addr =
-                instance->imported_mutable_globals().get_sandboxed_pointer(
-                    global.index * kSystemPointerSize);
+                instance->imported_mutable_globals()->get_sandboxed_pointer(
+                    global.index);
 
             size_t buffer_size = untagged_buffer->byte_length();
             Address backing_store =
@@ -2243,7 +2460,7 @@ void InstanceBuilder::ProcessExports(Handle<WasmInstanceObject> instance) {
         Handle<WasmTagObject> wrapper = tags_wrappers_[exp.index];
         if (wrapper.is_null()) {
           Handle<HeapObject> tag_object(
-              HeapObject::cast(instance->tags_table().get(exp.index)),
+              HeapObject::cast(instance->tags_table()->get(exp.index)),
               isolate_);
           uint32_t canonical_sig_index =
               module_->isorecursive_canonical_type_ids[tag.sig_index];
@@ -2258,22 +2475,15 @@ void InstanceBuilder::ProcessExports(Handle<WasmInstanceObject> instance) {
         UNREACHABLE();
     }
 
-    v8::Maybe<bool> status = JSReceiver::DefineOwnProperty(
-        isolate_, export_to, name, &desc, Just(kThrowOnError));
-    if (!status.IsJust()) {
-      DisallowGarbageCollection no_gc;
-      TruncatedUserString<> trunc_name(name->GetCharVector<uint8_t>(no_gc));
-      thrower_->LinkError("export of %.*s failed.", trunc_name.length(),
-                          trunc_name.start());
-      return;
-    }
+    CHECK(JSReceiver::DefineOwnProperty(isolate_, export_to, name, &desc,
+                                        Just(kThrowOnError))
+              .FromMaybe(false));
   }
 
   if (module_->origin == kWasmOrigin) {
-    v8::Maybe<bool> success = JSReceiver::SetIntegrityLevel(
-        isolate_, exports_object, FROZEN, kDontThrow);
-    DCHECK(success.FromMaybe(false));
-    USE(success);
+    CHECK(JSReceiver::SetIntegrityLevel(isolate_, exports_object, FROZEN,
+                                        kDontThrow)
+              .FromMaybe(false));
   }
 }
 
@@ -2294,17 +2504,17 @@ V8_INLINE void SetFunctionTablePlaceholder(Isolate* isolate,
     WasmTableObject::SetFunctionTablePlaceholder(
         isolate, table_object, entry_index, instance, func_index);
   } else {
-    table_object->entries().set(entry_index,
-                                *wasm_internal_function.ToHandleChecked());
+    table_object->entries()->set(entry_index,
+                                 *wasm_internal_function.ToHandleChecked());
   }
-  WasmTableObject::UpdateDispatchTables(isolate, *table_object, entry_index,
-                                        function, *instance);
+  WasmTableObject::UpdateDispatchTables(isolate, table_object, entry_index,
+                                        function, instance);
 }
 
 V8_INLINE void SetFunctionTableNullEntry(Isolate* isolate,
                                          Handle<WasmTableObject> table_object,
                                          uint32_t entry_index) {
-  table_object->entries().set(entry_index, *isolate->factory()->wasm_null());
+  table_object->entries()->set(entry_index, *isolate->factory()->wasm_null());
   WasmTableObject::ClearDispatchTables(isolate, table_object, entry_index);
 }
 }  // namespace
@@ -2315,8 +2525,9 @@ void InstanceBuilder::SetTableInitialValues(
        table_index < static_cast<int>(module_->tables.size()); ++table_index) {
     const WasmTable& table = module_->tables[table_index];
     if (table.initial_value.is_set()) {
-      auto table_object = handle(
-          WasmTableObject::cast(instance->tables().get(table_index)), isolate_);
+      auto table_object =
+          handle(WasmTableObject::cast(instance->tables()->get(table_index)),
+                 isolate_);
       bool is_function_table = IsSubtypeOf(table.type, kWasmFuncRef, module_);
       if (is_function_table &&
           table.initial_value.kind() == ConstantExpression::kRefFunc) {
@@ -2426,13 +2637,13 @@ ValueOrError ConsumeElementSegmentEntry(Zone* zone, Isolate* isolate,
 base::Optional<MessageTemplate> InitializeElementSegment(
     Zone* zone, Isolate* isolate, Handle<WasmInstanceObject> instance,
     uint32_t segment_index) {
-  if (!instance->element_segments().get(segment_index).IsUndefined()) return {};
+  if (!IsUndefined(instance->element_segments()->get(segment_index))) return {};
 
   const WasmElemSegment& elem_segment =
       instance->module()->elem_segments[segment_index];
 
-  base::Vector<const byte> module_bytes =
-      instance->module_object().native_module()->wire_bytes();
+  base::Vector<const uint8_t> module_bytes =
+      instance->module_object()->native_module()->wire_bytes();
 
   Decoder decoder(module_bytes);
   decoder.consume_bytes(elem_segment.elements_wire_bytes_offset);
@@ -2448,7 +2659,7 @@ base::Optional<MessageTemplate> InitializeElementSegment(
     result->set(static_cast<int>(i), *to_value(value).to_ref());
   }
 
-  instance->element_segments().set(segment_index, *result);
+  instance->element_segments()->set(segment_index, *result);
 
   return {};
 }
@@ -2469,7 +2680,7 @@ void InstanceBuilder::LoadTableSegments(Handle<WasmInstanceObject> instance) {
     const size_t count = elem_segment.element_count;
 
     Handle<WasmTableObject> table_object = handle(
-        WasmTableObject::cast(instance->tables().get(table_index)), isolate_);
+        WasmTableObject::cast(instance->tables()->get(table_index)), isolate_);
     if (!base::IsInBounds<size_t>(dst, count, table_object->current_length())) {
       thrower_->RuntimeError("%s",
                              MessageFormatter::TemplateString(
@@ -2477,8 +2688,8 @@ void InstanceBuilder::LoadTableSegments(Handle<WasmInstanceObject> instance) {
       return;
     }
 
-    base::Vector<const byte> module_bytes =
-        instance->module_object().native_module()->wire_bytes();
+    base::Vector<const uint8_t> module_bytes =
+        instance->module_object()->native_module()->wire_bytes();
     Decoder decoder(module_bytes);
     decoder.consume_bytes(elem_segment.elements_wire_bytes_offset);
 
@@ -2520,22 +2731,20 @@ void InstanceBuilder::LoadTableSegments(Handle<WasmInstanceObject> instance) {
     }
     // Active segment have to be set to empty after instance initialization
     // (much like passive segments after dropping).
-    instance->element_segments().set(segment_index,
-                                     *isolate_->factory()->empty_fixed_array());
+    instance->element_segments()->set(
+        segment_index, *isolate_->factory()->empty_fixed_array());
   }
 }
 
 void InstanceBuilder::InitializeTags(Handle<WasmInstanceObject> instance) {
   Handle<FixedArray> tags_table(instance->tags_table(), isolate_);
   for (int index = 0; index < tags_table->length(); ++index) {
-    if (!tags_table->get(index).IsUndefined(isolate_)) continue;
+    if (!IsUndefined(tags_table->get(index), isolate_)) continue;
     Handle<WasmExceptionTag> tag = WasmExceptionTag::New(isolate_, index);
     tags_table->set(index, *tag);
   }
 }
 
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
 
 #undef TRACE
diff --git a/deps/v8/src/wasm/module-instantiate.h b/deps/v8/src/wasm/module-instantiate.h
index 589b256ecb1d42..8a7b6626fc37bd 100644
--- a/deps/v8/src/wasm/module-instantiate.h
+++ b/deps/v8/src/wasm/module-instantiate.h
@@ -19,18 +19,11 @@
 namespace v8 {
 namespace internal {
 
-class Isolate;
 class JSArrayBuffer;
-class JSReceiver;
 class WasmModuleObject;
 class WasmInstanceObject;
 class Zone;
 
-template <typename T>
-class Handle;
-template <typename T>
-class MaybeHandle;
-
 namespace wasm {
 class ErrorThrower;
 enum Suspend : bool;
@@ -88,7 +81,8 @@ constexpr ImportCallKind kDefaultImportCallKind =
 // is why the ultimate target is provided as well.
 class WasmImportData {
  public:
-  V8_EXPORT_PRIVATE WasmImportData(Handle<JSReceiver> callable,
+  V8_EXPORT_PRIVATE WasmImportData(Handle<WasmInstanceObject> instance,
+                                   int func_index, Handle<JSReceiver> callable,
                                    const wasm::FunctionSig* sig,
                                    uint32_t expected_canonical_type_index);
 
@@ -98,7 +92,9 @@ class WasmImportData {
   Handle<JSReceiver> callable() const { return callable_; }
 
  private:
-  ImportCallKind ComputeKind(const wasm::FunctionSig* expected_sig,
+  ImportCallKind ComputeKind(Handle<WasmInstanceObject> instance,
+                             int func_index,
+                             const wasm::FunctionSig* expected_sig,
                              uint32_t expected_canonical_type_index);
 
   ImportCallKind kind_;
diff --git a/deps/v8/src/wasm/names-provider.cc b/deps/v8/src/wasm/names-provider.cc
index a5ee411ca40eeb..0a0a980ef68af3 100644
--- a/deps/v8/src/wasm/names-provider.cc
+++ b/deps/v8/src/wasm/names-provider.cc
@@ -6,6 +6,7 @@
 
 #include "src/strings/unicode-decoder.h"
 #include "src/wasm/module-decoder.h"
+#include "src/wasm/std-object-sizes.h"
 #include "src/wasm/string-builder.h"
 
 namespace v8 {
@@ -118,7 +119,7 @@ static constexpr char kIdentifierChar[] = {
 // code unit.
 // We could decide that we don't care much how exactly non-ASCII names are
 // rendered and simplify this to "one '_' per invalid UTF8 byte".
-void SanitizeUnicodeName(StringBuilder& out, const byte* utf8_src,
+void SanitizeUnicodeName(StringBuilder& out, const uint8_t* utf8_src,
                          size_t length) {
   base::Vector<const uint8_t> utf8_data(utf8_src, length);
   Utf8Decoder decoder(utf8_data);
@@ -136,9 +137,9 @@ void SanitizeUnicodeName(StringBuilder& out, const byte* utf8_src,
 
 void NamesProvider::ComputeImportName(const WasmImport& import,
                                       std::map<uint32_t, std::string>& target) {
-  const byte* mod_start = wire_bytes_.begin() + import.module_name.offset();
+  const uint8_t* mod_start = wire_bytes_.begin() + import.module_name.offset();
   size_t mod_length = import.module_name.length();
-  const byte* field_start = wire_bytes_.begin() + import.field_name.offset();
+  const uint8_t* field_start = wire_bytes_.begin() + import.field_name.offset();
   size_t field_length = import.field_name.length();
   StringBuilder buffer;
   buffer << '$';
@@ -371,6 +372,11 @@ void NamesProvider::PrintTagName(StringBuilder& out, uint32_t tag_index,
     WriteRef(out, ref);
     return MaybeAddComment(out, tag_index, index_as_comment);
   }
+  auto it = import_export_tag_names_.find(tag_index);
+  if (it != import_export_tag_names_.end()) {
+    out << it->second;
+    return MaybeAddComment(out, tag_index, index_as_comment);
+  }
   out << "$tag" << tag_index;
 }
 
@@ -404,6 +410,43 @@ void NamesProvider::PrintValueType(StringBuilder& out, ValueType type) {
   }
 }
 
+namespace {
+size_t StringMapSize(const std::map<uint32_t, std::string>& map) {
+  size_t result = ContentSize(map);
+  for (const auto& entry : map) {
+    result += entry.second.size();
+  }
+  return result;
+}
+}  // namespace
+
+size_t NamesProvider::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(NamesProvider, 208);
+  size_t result = sizeof(NamesProvider);
+  if (name_section_names_) {
+    DecodedNameSection* names = name_section_names_.get();
+    result += names->local_names_.EstimateCurrentMemoryConsumption();
+    result += names->label_names_.EstimateCurrentMemoryConsumption();
+    result += names->type_names_.EstimateCurrentMemoryConsumption();
+    result += names->table_names_.EstimateCurrentMemoryConsumption();
+    result += names->memory_names_.EstimateCurrentMemoryConsumption();
+    result += names->global_names_.EstimateCurrentMemoryConsumption();
+    result += names->element_segment_names_.EstimateCurrentMemoryConsumption();
+    result += names->data_segment_names_.EstimateCurrentMemoryConsumption();
+    result += names->field_names_.EstimateCurrentMemoryConsumption();
+    result += names->tag_names_.EstimateCurrentMemoryConsumption();
+  }
+  result += StringMapSize(import_export_function_names_);
+  result += StringMapSize(import_export_table_names_);
+  result += StringMapSize(import_export_memory_names_);
+  result += StringMapSize(import_export_global_names_);
+  result += StringMapSize(import_export_tag_names_);
+  if (v8_flags.trace_wasm_offheap_memory) {
+    PrintF("NamesProvider: %zu\n", result);
+  }
+  return result;
+}
+
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/wasm/names-provider.h b/deps/v8/src/wasm/names-provider.h
index eea9dda75cb959..6e97cab5715025 100644
--- a/deps/v8/src/wasm/names-provider.h
+++ b/deps/v8/src/wasm/names-provider.h
@@ -70,6 +70,8 @@ class V8_EXPORT_PRIVATE NamesProvider {
   void PrintHeapType(StringBuilder& out, HeapType type);
   void PrintValueType(StringBuilder& out, ValueType type);
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   void DecodeNamesIfNotYetDone();
   void ComputeFunctionNamesFromImportsExports();
diff --git a/deps/v8/src/wasm/object-access.h b/deps/v8/src/wasm/object-access.h
index 6ebe8337b1a3ad..fe1ae164391be3 100644
--- a/deps/v8/src/wasm/object-access.h
+++ b/deps/v8/src/wasm/object-access.h
@@ -43,6 +43,11 @@ class ObjectAccess : public AllStatic {
     return ToTagged(FixedAddressArray::OffsetOfElementAt(index));
   }
 
+  // Get the offset into a external pointer array for a given {index}.
+  static constexpr int ElementOffsetInTaggedExternalPointerArray(int index) {
+    return ToTagged(ExternalPointerArray::OffsetOfElementAt(index));
+  }
+
   // Get the offset of the context stored in a {JSFunction} object.
   static constexpr int ContextOffsetInTaggedJSFunction() {
     return ToTagged(JSFunction::kContextOffset);
diff --git a/deps/v8/src/wasm/pgo.cc b/deps/v8/src/wasm/pgo.cc
index b8fd847c209999..0569250826fdf4 100644
--- a/deps/v8/src/wasm/pgo.cc
+++ b/deps/v8/src/wasm/pgo.cc
@@ -101,18 +101,17 @@ class ProfileGenerator {
   const uint32_t* const tiering_budget_array_;
 };
 
-void DeserializeTypeFeedback(Decoder& decoder, WasmModule* module) {
-  // TODO(clemensb): Guard this with a lock on {module->type_feedback.mutex}
-  // if this code can run in multi-threaded situations in the future.
+void DeserializeTypeFeedback(Decoder& decoder, const WasmModule* module) {
+  base::SharedMutexGuard<base::kShared> type_feedback_guard{
+      &module->type_feedback.mutex};
   std::unordered_map<uint32_t, FunctionTypeFeedback>& feedback_for_function =
       module->type_feedback.feedback_for_function;
   uint32_t num_entries = decoder.consume_u32v("num function entries");
   CHECK_LE(num_entries, module->num_declared_functions);
   for (uint32_t missing_entries = num_entries; missing_entries > 0;
        --missing_entries) {
+    FunctionTypeFeedback feedback;
     uint32_t function_index = decoder.consume_u32v("function index");
-    CHECK(!feedback_for_function.count(function_index));
-    FunctionTypeFeedback& feedback = feedback_for_function[function_index];
     // Deserialize {feedback_vector}.
     uint32_t feedback_vector_size =
         decoder.consume_u32v("feedback vector size");
@@ -142,11 +141,24 @@ void DeserializeTypeFeedback(Decoder& decoder, WasmModule* module) {
     for (uint32_t& call_target : feedback.call_targets) {
       call_target = decoder.consume_u32v("call target");
     }
+
+    // Finally, insert the new feedback into the map. Overwrite existing
+    // feedback, but check for consistency.
+    auto [feedback_it, is_new] =
+        feedback_for_function.emplace(function_index, std::move(feedback));
+    if (!is_new) {
+      FunctionTypeFeedback& old_feedback = feedback_it->second;
+      CHECK(old_feedback.feedback_vector.empty() ||
+            old_feedback.feedback_vector.size() == feedback_vector_size);
+      CHECK_EQ(old_feedback.call_targets.as_vector(),
+               feedback.call_targets.as_vector());
+      std::swap(old_feedback.feedback_vector, feedback.feedback_vector);
+    }
   }
 }
 
 std::unique_ptr<ProfileInformation> DeserializeTieringInformation(
-    Decoder& decoder, WasmModule* module) {
+    Decoder& decoder, const WasmModule* module) {
   std::vector<uint32_t> executed_functions;
   std::vector<uint32_t> tiered_up_functions;
   uint32_t start = module->num_imported_functions;
@@ -165,7 +177,7 @@ std::unique_ptr<ProfileInformation> DeserializeTieringInformation(
 }
 
 std::unique_ptr<ProfileInformation> RestoreProfileData(
-    WasmModule* module, base::Vector<uint8_t> profile_data) {
+    const WasmModule* module, base::Vector<uint8_t> profile_data) {
   Decoder decoder{profile_data.begin(), profile_data.end()};
 
   DeserializeTypeFeedback(decoder, module);
@@ -192,8 +204,11 @@ void DumpProfileToFile(const WasmModule* module,
   ProfileGenerator profile_generator{module, tiering_budget_array};
   base::OwnedVector<uint8_t> profile_data = profile_generator.GetProfileData();
 
-  PrintF("Dumping Wasm PGO data to file '%s' (%zu bytes)\n", filename.begin(),
-         profile_data.size());
+  PrintF(
+      "Dumping Wasm PGO data to file '%s' (module size %zu, %u declared "
+      "functions, %zu bytes PGO data)\n",
+      filename.begin(), wire_bytes.size(), module->num_declared_functions,
+      profile_data.size());
   if (FILE* file = base::OS::FOpen(filename.begin(), "wb")) {
     size_t written = fwrite(profile_data.begin(), 1, profile_data.size(), file);
     CHECK_EQ(profile_data.size(), written);
@@ -202,7 +217,7 @@ void DumpProfileToFile(const WasmModule* module,
 }
 
 std::unique_ptr<ProfileInformation> LoadProfileFromFile(
-    WasmModule* module, base::Vector<const uint8_t> wire_bytes) {
+    const WasmModule* module, base::Vector<const uint8_t> wire_bytes) {
   CHECK(!wire_bytes.empty());
   // File are named `profile-wasm-<hash>`.
   // We use the same hash as for reported scripts, to make it easier to
diff --git a/deps/v8/src/wasm/pgo.h b/deps/v8/src/wasm/pgo.h
index 082a08747a7f40..bb7942b49934ab 100644
--- a/deps/v8/src/wasm/pgo.h
+++ b/deps/v8/src/wasm/pgo.h
@@ -45,7 +45,7 @@ void DumpProfileToFile(const WasmModule* module,
                        uint32_t* tiering_budget_array);
 
 V8_WARN_UNUSED_RESULT std::unique_ptr<ProfileInformation> LoadProfileFromFile(
-    WasmModule* module, base::Vector<const uint8_t> wire_bytes);
+    const WasmModule* module, base::Vector<const uint8_t> wire_bytes);
 
 }  // namespace v8::internal::wasm
 
diff --git a/deps/v8/src/wasm/serialized-signature-inl.h b/deps/v8/src/wasm/serialized-signature-inl.h
new file mode 100644
index 00000000000000..0e0afcdf2e0cca
--- /dev/null
+++ b/deps/v8/src/wasm/serialized-signature-inl.h
@@ -0,0 +1,108 @@
+// Copyright 2023 the V8 project authors. All rights reserved.  Use of
+// this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_WASM_SERIALIZED_SIGNATURE_INL_H_
+#define V8_WASM_SERIALIZED_SIGNATURE_INL_H_
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#include "src/handles/handles.h"
+#include "src/objects/fixed-array-inl.h"
+#include "src/objects/tagged.h"
+#include "src/wasm/value-type.h"
+
+namespace v8::internal::wasm {
+
+// The SerializedSignatureHelper helps with the translation of a
+// wasm::FunctionSig into a PodArray<wasm::ValueType> and back. The serialized
+// format in the PodArray starts with the return count, followed by the return
+// types array and the parameter types array.
+class SerializedSignatureHelper {
+ public:
+  // Allocates a PodArray for the serialized signature and sets the return
+  // count, but does not fill in the return types and parameter types yet.
+  static inline Handle<PodArray<wasm::ValueType>> NewEmptyPodArrayForSignature(
+      Isolate* isolate, size_t return_count, size_t param_count) {
+    size_t sig_size = return_count + param_count + 1;
+    Handle<PodArray<wasm::ValueType>> result = PodArray<wasm::ValueType>::New(
+        isolate, static_cast<int>(sig_size), AllocationType::kOld);
+
+    result->set(0, wasm::ValueType::FromRawBitField(
+                       static_cast<uint32_t>(return_count)));
+    return result;
+  }
+
+  static inline Handle<PodArray<wasm::ValueType>> SerializeSignature(
+      Isolate* isolate, const wasm::FunctionSig* sig) {
+    Handle<PodArray<wasm::ValueType>> result = NewEmptyPodArrayForSignature(
+        isolate, sig->return_count(), sig->parameter_count());
+    if (!sig->all().empty()) {
+      result->copy_in(1, sig->all().begin(),
+                      static_cast<int>(sig->all().size()));
+    }
+    return result;
+  }
+
+  static inline wasm::FunctionSig* DeserializeSignature(
+      Zone* zone, Tagged<PodArray<wasm::ValueType>> sig) {
+    int sig_size = sig->length() - 1;
+    int return_count = ReturnCount(sig);
+    int param_count = sig_size - return_count;
+    wasm::ValueType* types = zone->AllocateArray<wasm::ValueType>(sig_size);
+    if (sig_size > 0) {
+      sig->copy_out(1, types, sig_size);
+    }
+    return zone->New<wasm::FunctionSig>(return_count, param_count, types);
+  }
+
+  // Deserializes a PodArray signature into a wasm::FunctionSig. The memory
+  // allocated for the reps array is set in {out_reps} so that the caller has
+  // ownership of the allocated data.
+  static inline wasm::FunctionSig DeserializeSignature(
+      Tagged<PodArray<wasm::ValueType>> sig,
+      std::unique_ptr<wasm::ValueType[]>* out_reps) {
+    int sig_size = sig->length() - 1;
+    int return_count = ReturnCount(sig);
+    int param_count = sig_size - return_count;
+    out_reps->reset(new wasm::ValueType[sig_size]);
+    if (sig_size > 0) {
+      sig->copy_out(1, out_reps->get(), sig_size);
+    }
+    return wasm::FunctionSig(return_count, param_count, out_reps->get());
+  }
+
+  static inline int ReturnCount(Tagged<PodArray<wasm::ValueType>> sig) {
+    return sig->get(0).raw_bit_field();
+  }
+
+  static inline int ParamCount(Tagged<PodArray<wasm::ValueType>> sig) {
+    return sig->length() - ReturnCount(sig) - 1;
+  }
+
+  static inline void SetReturn(Tagged<PodArray<wasm::ValueType>> sig,
+                               size_t index, wasm::ValueType type) {
+    sig->set(static_cast<int>(1 + index), type);
+  }
+
+  static inline void SetParam(Tagged<PodArray<wasm::ValueType>> sig,
+                              size_t index, wasm::ValueType type) {
+    sig->set(static_cast<int>(1 + index + ReturnCount(sig)), type);
+  }
+
+  static inline wasm::ValueType GetReturn(Tagged<PodArray<wasm::ValueType>> sig,
+                                          size_t index) {
+    return sig->get(static_cast<int>(1 + index));
+  }
+
+  static inline wasm::ValueType GetParam(Tagged<PodArray<wasm::ValueType>> sig,
+                                         size_t index) {
+    return sig->get(static_cast<int>(1 + index + ReturnCount(sig)));
+  }
+};
+
+}  // namespace v8::internal::wasm
+
+#endif  // V8_WASM_SERIALIZED_SIGNATURE_INL_H_
diff --git a/deps/v8/src/wasm/simd-shuffle.cc b/deps/v8/src/wasm/simd-shuffle.cc
index 5b454c1cc97fdb..e3370d0c849456 100644
--- a/deps/v8/src/wasm/simd-shuffle.cc
+++ b/deps/v8/src/wasm/simd-shuffle.cc
@@ -12,47 +12,6 @@ namespace v8 {
 namespace internal {
 namespace wasm {
 
-void SimdShuffle::CanonicalizeShuffle(bool inputs_equal, uint8_t* shuffle,
-                                      bool* needs_swap, bool* is_swizzle) {
-  *needs_swap = false;
-  // Inputs equal, then it's a swizzle.
-  if (inputs_equal) {
-    *is_swizzle = true;
-  } else {
-    // Inputs are distinct; check that both are required.
-    bool src0_is_used = false;
-    bool src1_is_used = false;
-    for (int i = 0; i < kSimd128Size; ++i) {
-      if (shuffle[i] < kSimd128Size) {
-        src0_is_used = true;
-      } else {
-        src1_is_used = true;
-      }
-    }
-    if (src0_is_used && !src1_is_used) {
-      *is_swizzle = true;
-    } else if (src1_is_used && !src0_is_used) {
-      *needs_swap = true;
-      *is_swizzle = true;
-    } else {
-      *is_swizzle = false;
-      // Canonicalize general 2 input shuffles so that the first input lanes are
-      // encountered first. This makes architectural shuffle pattern matching
-      // easier, since we only need to consider 1 input ordering instead of 2.
-      if (shuffle[0] >= kSimd128Size) {
-        // The second operand is used first. Swap inputs and adjust the shuffle.
-        *needs_swap = true;
-        for (int i = 0; i < kSimd128Size; ++i) {
-          shuffle[i] ^= kSimd128Size;
-        }
-      }
-    }
-  }
-  if (*is_swizzle) {
-    for (int i = 0; i < kSimd128Size; ++i) shuffle[i] &= kSimd128Size - 1;
-  }
-}
-
 bool SimdShuffle::TryMatchIdentity(const uint8_t* shuffle) {
   for (int i = 0; i < kSimd128Size; ++i) {
     if (shuffle[i] != i) return false;
@@ -91,6 +50,18 @@ bool SimdShuffle::TryMatch32x4Shuffle(const uint8_t* shuffle,
   return true;
 }
 
+bool SimdShuffle::TryMatch32x8Shuffle(const uint8_t* shuffle,
+                                      uint8_t* shuffle32x8) {
+  for (int i = 0; i < 8; ++i) {
+    if (shuffle[i * 4] % 4 != 0) return false;
+    for (int j = 1; j < 4; ++j) {
+      if (shuffle[i * 4 + j] - shuffle[i * 4 + j - 1] != 1) return false;
+    }
+    shuffle32x8[i] = shuffle[i * 4] / 4;
+  }
+  return true;
+}
+
 bool SimdShuffle::TryMatch16x8Shuffle(const uint8_t* shuffle,
                                       uint8_t* shuffle16x8) {
   for (int i = 0; i < 8; ++i) {
diff --git a/deps/v8/src/wasm/simd-shuffle.h b/deps/v8/src/wasm/simd-shuffle.h
index 04b8602e932bd2..791c1883ddbb05 100644
--- a/deps/v8/src/wasm/simd-shuffle.h
+++ b/deps/v8/src/wasm/simd-shuffle.h
@@ -18,13 +18,55 @@ namespace wasm {
 
 class V8_EXPORT_PRIVATE SimdShuffle {
  public:
-  // Converts a shuffle into canonical form, meaning that the first lane index
-  // is in the range [0 .. 15]. Set |inputs_equal| true if this is an explicit
-  // swizzle. Returns canonicalized |shuffle|, |needs_swap|, and |is_swizzle|.
-  // If |needs_swap| is true, inputs must be swapped. If |is_swizzle| is true,
-  // the second input can be ignored.
+  // is in the range [0 .. 15] (or [0 .. 31] if simd_size is kSimd256Size). Set
+  // |inputs_equal| true if this is an explicit swizzle. Returns canonicalized
+  // |shuffle|, |needs_swap|, and |is_swizzle|. If |needs_swap| is true, inputs
+  // must be swapped. If |is_swizzle| is true, the second input can be ignored.
+  template <const int simd_size = kSimd128Size,
+            typename = std::enable_if_t<simd_size == kSimd128Size ||
+                                        simd_size == kSimd256Size>>
   static void CanonicalizeShuffle(bool inputs_equal, uint8_t* shuffle,
-                                  bool* needs_swap, bool* is_swizzle);
+                                  bool* needs_swap, bool* is_swizzle) {
+    *needs_swap = false;
+    // Inputs equal, then it's a swizzle.
+    if (inputs_equal) {
+      *is_swizzle = true;
+    } else {
+      // Inputs are distinct; check that both are required.
+      bool src0_is_used = false;
+      bool src1_is_used = false;
+      for (int i = 0; i < simd_size; ++i) {
+        if (shuffle[i] < simd_size) {
+          src0_is_used = true;
+        } else {
+          src1_is_used = true;
+        }
+      }
+      if (src0_is_used && !src1_is_used) {
+        *is_swizzle = true;
+      } else if (src1_is_used && !src0_is_used) {
+        *needs_swap = true;
+        *is_swizzle = true;
+      } else {
+        *is_swizzle = false;
+        // Canonicalize general 2 input shuffles so that the first input lanes
+        // are encountered first. This makes architectural shuffle pattern
+        // matching easier, since we only need to consider 1 input ordering
+        // instead of 2.
+        if (shuffle[0] >= simd_size) {
+          // The second operand is used first. Swap inputs and adjust the
+          // shuffle.
+          *needs_swap = true;
+          for (int i = 0; i < simd_size; ++i) {
+            shuffle[i] ^= simd_size;
+          }
+        }
+      }
+    }
+    if (*is_swizzle) {
+      for (int i = 0; i < simd_size; ++i) shuffle[i] &= simd_size - 1;
+    }
+  }
 
   // Tries to match an 8x16 byte shuffle to the identity shuffle, which is
   // [0 1 ... 15]. This should be called after canonicalizing the shuffle, so
@@ -66,6 +108,12 @@ class V8_EXPORT_PRIVATE SimdShuffle {
   // [0 1 2 3 8 9 10 11 4 5 6 7 12 13 14 15] == [0 2 1 3]
   static bool TryMatch32x4Shuffle(const uint8_t* shuffle, uint8_t* shuffle32x4);
 
+  // Tries to match an 8x32 byte shuffle to an equivalent 32x8 shuffle. If
+  // successful, it writes the 32x8 shuffle word indices. E.g.
+  // [0 1 2 3 8 9 10 11 4 5 6 7 12 13 14 15 16 17 18 19 24 25 26 27 20 21 22 23
+  //  28 29 30 31 == [0 2 1 3 4 6 5 7]
+  static bool TryMatch32x8Shuffle(const uint8_t* shuffle, uint8_t* shuffle32x8);
+
   // Tries to match an 8x16 byte shuffle to an equivalent 16x8 shuffle. If
   // successful, it writes the 16x8 shuffle word indices. E.g.
   // [0 1 8 9 2 3 10 11 4 5 12 13 6 7 14 15] == [0 4 1 5 2 6 3 7]
diff --git a/deps/v8/src/wasm/stacks.cc b/deps/v8/src/wasm/stacks.cc
index 360b53551a4336..8f5b4a7f821cc3 100644
--- a/deps/v8/src/wasm/stacks.cc
+++ b/deps/v8/src/wasm/stacks.cc
@@ -5,16 +5,14 @@
 #include "src/wasm/stacks.h"
 
 #include "src/base/platform/platform.h"
+#include "src/execution/simulator.h"
 
 namespace v8::internal::wasm {
 
 // static
 StackMemory* StackMemory::GetCurrentStackView(Isolate* isolate) {
-  uintptr_t limit = isolate->stack_guard()->real_jslimit();
-  uintptr_t stack_start = base::Stack::GetStackStart();
-  DCHECK_LE(limit, stack_start);
-  size_t size = stack_start - limit;
-  return new StackMemory(isolate, reinterpret_cast<byte*>(limit), size);
+  base::Vector<uint8_t> view = SimulatorStack::GetCurrentStackView(isolate);
+  return new StackMemory(isolate, view.begin(), view.size());
 }
 
 StackMemory::~StackMemory() {
@@ -22,7 +20,9 @@ StackMemory::~StackMemory() {
     PrintF("Delete stack #%d\n", id_);
   }
   PageAllocator* allocator = GetPlatformPageAllocator();
-  if (owned_) allocator->DecommitPages(limit_, size_);
+  if (owned_ && !allocator->DecommitPages(limit_, size_)) {
+    V8::FatalProcessOutOfMemory(nullptr, "Decommit stack memory");
+  }
   // We don't need to handle removing the last stack from the list (next_ ==
   // this). This only happens on isolate tear down, otherwise there is always
   // at least one reachable stack (the active stack).
@@ -45,7 +45,7 @@ StackMemory::StackMemory(Isolate* isolate) : isolate_(isolate), owned_(true) {
   int kJsStackSizeKB = v8_flags.wasm_stack_switching_stack_size;
   size_ = (kJsStackSizeKB + kJSLimitOffsetKB) * KB;
   size_ = RoundUp(size_, allocator->AllocatePageSize());
-  limit_ = static_cast<byte*>(
+  limit_ = static_cast<uint8_t*>(
       allocator->AllocatePages(nullptr, size_, allocator->AllocatePageSize(),
                                PageAllocator::kReadWrite));
   if (v8_flags.trace_wasm_stack_switching) {
@@ -55,7 +55,7 @@ StackMemory::StackMemory(Isolate* isolate) : isolate_(isolate), owned_(true) {
 }
 
 // Overload to represent a view of the libc stack.
-StackMemory::StackMemory(Isolate* isolate, byte* limit, size_t size)
+StackMemory::StackMemory(Isolate* isolate, uint8_t* limit, size_t size)
     : isolate_(isolate), limit_(limit), size_(size), owned_(false) {
   id_ = 0;
 }
diff --git a/deps/v8/src/wasm/stacks.h b/deps/v8/src/wasm/stacks.h
index 516d7bb426d33d..6dacbac010d5c5 100644
--- a/deps/v8/src/wasm/stacks.h
+++ b/deps/v8/src/wasm/stacks.h
@@ -34,7 +34,8 @@ class StackMemory {
  public:
   static StackMemory* New(Isolate* isolate) { return new StackMemory(isolate); }
 
-  // Returns a non-owning view of the current stack.
+  // Returns a non-owning view of the current (main) stack. This may be
+  // the simulator's stack when running on the simulator.
   static StackMemory* GetCurrentStackView(Isolate* isolate);
 
   ~StackMemory();
@@ -63,10 +64,10 @@ class StackMemory {
   explicit StackMemory(Isolate* isolate);
 
   // Overload to represent a view of the libc stack.
-  StackMemory(Isolate* isolate, byte* limit, size_t size);
+  StackMemory(Isolate* isolate, uint8_t* limit, size_t size);
 
   Isolate* isolate_;
-  byte* limit_;
+  uint8_t* limit_;
   size_t size_;
   bool owned_;
   JumpBuffer jmpbuf_;
diff --git a/deps/v8/src/wasm/std-object-sizes.h b/deps/v8/src/wasm/std-object-sizes.h
new file mode 100644
index 00000000000000..6b16ef2987c56b
--- /dev/null
+++ b/deps/v8/src/wasm/std-object-sizes.h
@@ -0,0 +1,78 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#ifndef V8_WASM_STD_OBJECT_SIZES_H_
+#define V8_WASM_STD_OBJECT_SIZES_H_
+
+#include <map>
+#include <unordered_map>
+#include <unordered_set>
+#include <vector>
+
+#include "include/v8config.h"
+
+namespace v8::internal::wasm {
+
+// These helpers are used to estimate the memory consumption of standard
+// data structures off the managed heap.
+// The size of the container itself is not included here, because it's
+// typically included in the size of the containing element.
+
+template <typename T>
+inline size_t ContentSize(const std::vector<T>& vector) {
+  // We use {capacity()} rather than {size()} because we want to compute
+  // actual memory consumption.
+  return vector.capacity() * sizeof(T);
+}
+
+template <typename Key, typename T>
+inline size_t ContentSize(const std::map<Key, T>& map) {
+  // Very rough lower bound approximation: two internal pointers per entry.
+  return map.size() * (sizeof(Key) + sizeof(T) + 2 * sizeof(void*));
+}
+
+template <typename Key, typename T, typename Hash>
+inline size_t ContentSize(const std::unordered_map<Key, T, Hash>& map) {
+  // Very rough lower bound approximation: two internal pointers per entry.
+  size_t raw = map.size() * (sizeof(Key) + sizeof(T) + 2 * sizeof(void*));
+  // In the spirit of computing lower bounds of definitely-used memory,
+  // we assume a 75% fill ratio.
+  return raw * 4 / 3;
+}
+
+template <typename T>
+inline size_t ContentSize(std::unordered_set<T> set) {
+  // Very rough lower bound approximation: two internal pointers per entry.
+  size_t raw = set.size() * (sizeof(T) + 2 * sizeof(void*));
+  // In the spirit of computing lower bounds of definitely-used memory,
+  // we assume a 75% fill ratio.
+  return raw * 4 / 3;
+}
+
+// To make it less likely for size estimation functions to become outdated
+// when the classes they're responsible for change, we insert static asserts
+// about the respective class's size into them to at least catch some possible
+// future modifications. Since object sizes are toolchain specific, we define
+// restrictions here under which we enable these checks.
+// When one of these checks fails, that probably means you've added fields to
+// a class guarded by it. Update the respective EstimateCurrentMemoryConsumption
+// function accordingly, and then update the check's expected size.
+#if V8_TARGET_ARCH_X64 && defined(__clang__) && V8_TARGET_OS_LINUX &&          \
+    !V8_USE_ADDRESS_SANITIZER && !V8_USE_MEMORY_SANITIZER && defined(DEBUG) && \
+    V8_COMPRESS_POINTERS && !defined(V8_GC_MOLE) && defined(_LIBCPP_VERSION)
+#define UPDATE_WHEN_CLASS_CHANGES(classname, size)                       \
+  static_assert(sizeof(classname) == size,                               \
+                "Update {EstimateCurrentMemoryConsumption} when adding " \
+                "fields to " #classname)
+#else
+#define UPDATE_WHEN_CLASS_CHANGES(classname, size) (void)0
+#endif
+
+}  // namespace v8::internal::wasm
+
+#endif  // V8_WASM_STD_OBJECT_SIZES_H_
diff --git a/deps/v8/src/wasm/streaming-decoder.cc b/deps/v8/src/wasm/streaming-decoder.cc
index 2d28fd343fe84e..786c5aa250f055 100644
--- a/deps/v8/src/wasm/streaming-decoder.cc
+++ b/deps/v8/src/wasm/streaming-decoder.cc
@@ -163,7 +163,7 @@ class V8_EXPORT_PRIVATE AsyncStreamingDecoder : public StreamingDecoder {
 
   void ProcessModuleHeader() {
     if (!ok()) return;
-    if (!processor_->ProcessModuleHeader(state_->buffer(), 0)) Fail();
+    if (!processor_->ProcessModuleHeader(state_->buffer())) Fail();
   }
 
   void ProcessSection(SectionBuffer* buffer) {
diff --git a/deps/v8/src/wasm/streaming-decoder.h b/deps/v8/src/wasm/streaming-decoder.h
index fe552d436578e5..2e3dc59455bd08 100644
--- a/deps/v8/src/wasm/streaming-decoder.h
+++ b/deps/v8/src/wasm/streaming-decoder.h
@@ -30,8 +30,7 @@ class V8_EXPORT_PRIVATE StreamingProcessor {
   virtual ~StreamingProcessor() = default;
   // Process the first 8 bytes of a WebAssembly module. Returns true if the
   // processing finished successfully and the decoding should continue.
-  virtual bool ProcessModuleHeader(base::Vector<const uint8_t> bytes,
-                                   uint32_t offset) = 0;
+  virtual bool ProcessModuleHeader(base::Vector<const uint8_t> bytes) = 0;
 
   // Process all sections but the code section. Returns true if the processing
   // finished successfully and the decoding should continue.
diff --git a/deps/v8/src/wasm/string-builder-multiline.h b/deps/v8/src/wasm/string-builder-multiline.h
index 619b8bdfdbd9e7..f643f68c7cec88 100644
--- a/deps/v8/src/wasm/string-builder-multiline.h
+++ b/deps/v8/src/wasm/string-builder-multiline.h
@@ -25,6 +25,13 @@ class DisassemblyCollector;
 namespace internal {
 namespace wasm {
 
+// Computes the number of decimal digits required to print {value}.
+inline int GetNumDigits(uint32_t value) {
+  int digits = 1;
+  for (uint32_t compare = 10; value >= compare; compare *= 10) digits++;
+  return digits;
+}
+
 struct LabelInfo {
   LabelInfo(size_t line_number, size_t offset,
             uint32_t index_by_occurrence_order)
@@ -115,12 +122,35 @@ class MultiLineStringBuilder : public StringBuilder {
   // Note: implemented in wasm-disassembler.cc (which is also the only user).
   void ToDisassemblyCollector(v8::debug::DisassemblyCollector* collector);
 
-  void WriteTo(std::ostream& out) {
+  void WriteTo(std::ostream& out, bool print_offsets) {
     if (length() != 0) NextLine(0);
+    if (lines_.size() == 0) return;
 
+    if (print_offsets) {
+      // The last offset is expected to be the largest.
+      int width = GetNumDigits(lines_.back().bytecode_offset);
+      // We could have used std::setw(width), but this is faster.
+      constexpr int kBufSize = 12;  // Enough for any uint32 plus '|'.
+      char buffer[kBufSize] = {32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, '|'};
+      char* const buffer_end = buffer + kBufSize - 1;
+      char* const buffer_start = buffer_end - width;
+      for (const Line& l : lines_) {
+        uint32_t offset = l.bytecode_offset;
+        char* ptr = buffer_end;
+        do {
+          *(--ptr) = '0' + (offset % 10);
+          offset /= 10;
+          // We pre-filled the buffer with spaces, and the offsets are expected
+          // to be increasing, so we can just stop the loop here and don't need
+          // to write spaces until {ptr == buffer_start}.
+        } while (offset > 0);
+        out.write(buffer_start, width + 1);  // +1 for the '|'.
+        out.write(l.data, l.len);
+      }
+      return;
+    }
     // In the name of speed, batch up lines that happen to be stored
     // consecutively.
-    if (lines_.size() == 0) return;
     const Line& first = lines_[0];
     const char* last_start = first.data;
     size_t len = first.len;
diff --git a/deps/v8/src/wasm/string-builder.h b/deps/v8/src/wasm/string-builder.h
index 804494d07804a4..e5dc009573203c 100644
--- a/deps/v8/src/wasm/string-builder.h
+++ b/deps/v8/src/wasm/string-builder.h
@@ -46,7 +46,7 @@ class StringBuilder {
     return result;
   }
   // Convenience wrappers.
-  void write(const byte* data, size_t n) {
+  void write(const uint8_t* data, size_t n) {
     char* ptr = allocate(n);
     memcpy(ptr, data, n);
   }
diff --git a/deps/v8/src/wasm/struct-types.h b/deps/v8/src/wasm/struct-types.h
index f17ed10279e657..31d428e2e1b0f8 100644
--- a/deps/v8/src/wasm/struct-types.h
+++ b/deps/v8/src/wasm/struct-types.h
@@ -134,9 +134,11 @@ class StructType : public ZoneObject {
         : zone_(zone),
           field_count_(field_count),
           cursor_(0),
-          field_offsets_(zone_->NewArray<uint32_t>(field_count_)),
-          buffer_(zone->NewArray<ValueType>(static_cast<int>(field_count))),
-          mutabilities_(zone->NewArray<bool>(static_cast<int>(field_count))) {}
+          field_offsets_(zone_->AllocateArray<uint32_t>(field_count_)),
+          buffer_(
+              zone->AllocateArray<ValueType>(static_cast<int>(field_count))),
+          mutabilities_(
+              zone->AllocateArray<bool>(static_cast<int>(field_count))) {}
 
     void AddField(ValueType type, bool mutability, uint32_t offset = 0) {
       DCHECK_LT(cursor_, field_count_);
diff --git a/deps/v8/src/wasm/turboshaft-graph-interface.cc b/deps/v8/src/wasm/turboshaft-graph-interface.cc
new file mode 100644
index 00000000000000..6ab1c20e57ba05
--- /dev/null
+++ b/deps/v8/src/wasm/turboshaft-graph-interface.cc
@@ -0,0 +1,4540 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/wasm/turboshaft-graph-interface.h"
+
+#include "src/common/globals.h"
+#include "src/compiler/turboshaft/assembler.h"
+#include "src/compiler/turboshaft/graph.h"
+#include "src/compiler/wasm-compiler-definitions.h"
+#include "src/trap-handler/trap-handler.h"
+#include "src/wasm/compilation-environment.h"
+#include "src/wasm/function-body-decoder-impl.h"
+#include "src/wasm/function-compiler.h"
+#include "src/wasm/memory-tracing.h"
+#include "src/wasm/wasm-engine.h"
+#include "src/wasm/wasm-linkage.h"
+#include "src/wasm/wasm-objects.h"
+#include "src/wasm/wasm-opcodes-inl.h"
+
+namespace v8::internal::wasm {
+
+#include "src/compiler/turboshaft/define-assembler-macros.inc"
+
+using Assembler =
+    compiler::turboshaft::Assembler<compiler::turboshaft::reducer_list<>>;
+using compiler::CallDescriptor;
+using compiler::MemoryAccessKind;
+using compiler::TrapId;
+using compiler::turboshaft::ConditionWithHint;
+using compiler::turboshaft::Float32;
+using compiler::turboshaft::Float64;
+using compiler::turboshaft::FloatRepresentation;
+using compiler::turboshaft::Graph;
+using compiler::turboshaft::Label;
+using compiler::turboshaft::LoadOp;
+using compiler::turboshaft::LoopLabel;
+using compiler::turboshaft::MemoryRepresentation;
+using compiler::turboshaft::OpIndex;
+using compiler::turboshaft::PendingLoopPhiOp;
+using compiler::turboshaft::RegisterRepresentation;
+using compiler::turboshaft::StoreOp;
+using compiler::turboshaft::SupportedOperations;
+using compiler::turboshaft::Tagged;
+using compiler::turboshaft::WordRepresentation;
+using TSBlock = compiler::turboshaft::Block;
+using compiler::turboshaft::TSCallDescriptor;
+using compiler::turboshaft::V;
+using compiler::turboshaft::Word32;
+using compiler::turboshaft::Word64;
+using compiler::turboshaft::WordPtr;
+
+#define LOAD_INSTANCE_FIELD(name, representation)                       \
+  asm_.Load(instance_node_, LoadOp::Kind::TaggedBase(), representation, \
+            WasmInstanceObject::k##name##Offset)
+
+#define LOAD_ROOT(name)                                          \
+  asm_.Load(asm_.LoadRootRegister(), LoadOp::Kind::RawAligned(), \
+            MemoryRepresentation::PointerSized(),                \
+            IsolateData::root_slot_offset(RootIndex::k##name))
+
+class TurboshaftGraphBuildingInterface {
+ public:
+  using ValidationTag = Decoder::FullValidationTag;
+  using FullDecoder =
+      WasmFullDecoder<ValidationTag, TurboshaftGraphBuildingInterface>;
+  static constexpr bool kUsesPoppedArgs = true;
+  static constexpr MemoryRepresentation kMaybeSandboxedPointer =
+      V8_ENABLE_SANDBOX_BOOL ? MemoryRepresentation::SandboxedPointer()
+                             : MemoryRepresentation::PointerSized();
+
+  struct Value : public ValueBase<ValidationTag> {
+    OpIndex op = OpIndex::Invalid();
+    template <typename... Args>
+    explicit Value(Args&&... args) V8_NOEXCEPT
+        : ValueBase(std::forward<Args>(args)...) {}
+  };
+
+  struct Control : public ControlBase<Value, ValidationTag> {
+    TSBlock* merge_block = nullptr;
+    // for 'if', loops, and 'try' respectively.
+    TSBlock* false_or_loop_or_catch_block = nullptr;
+    V<Tagged> exception = OpIndex::Invalid();  // Only for 'try-catch'.
+
+    template <typename... Args>
+    explicit Control(Args&&... args) V8_NOEXCEPT
+        : ControlBase(std::forward<Args>(args)...) {}
+  };
+
+  TurboshaftGraphBuildingInterface(Graph& graph, Zone* zone,
+                                   compiler::NodeOriginTable* node_origins)
+      : asm_(graph, graph, zone, node_origins) {}
+
+  void StartFunction(FullDecoder* decoder) {
+    TSBlock* block = asm_.NewBlock();
+    asm_.Bind(block);
+    // Set 0 as the current source position (before locals declarations).
+    asm_.SetCurrentOrigin(WasmPositionToOpIndex(0));
+    instance_node_ = asm_.Parameter(0, RegisterRepresentation::Tagged());
+    ssa_env_.resize(decoder->num_locals());
+    uint32_t index = 0;
+    for (; index < decoder->sig_->parameter_count(); index++) {
+      // Parameter indices are shifted by 1 because parameter 0 is the instance.
+      ssa_env_[index] = asm_.Parameter(
+          index + 1, RepresentationFor(decoder->sig_->GetParam(index)));
+    }
+    while (index < decoder->num_locals()) {
+      ValueType type = decoder->local_type(index);
+      OpIndex op;
+      if (!type.is_defaultable()) {
+        DCHECK(type.is_reference());
+        // TODO(jkummerow): Consider using "the hole" instead, to make any
+        // illegal uses more obvious.
+        op = asm_.Null(type.AsNullable());
+      } else {
+        op = DefaultValue(type);
+      }
+      while (index < decoder->num_locals() &&
+             decoder->local_type(index) == type) {
+        ssa_env_[index++] = op;
+      }
+    }
+
+    StackCheck();  // TODO(14108): Remove for leaf functions.
+
+    if (v8_flags.trace_wasm) {
+      asm_.SetCurrentOrigin(WasmPositionToOpIndex(decoder->position()));
+      CallRuntime(Runtime::kWasmTraceEnter, {});
+    }
+  }
+
+  void StartFunctionBody(FullDecoder* decoder, Control* block) {}
+
+  void FinishFunction(FullDecoder* decoder) {
+    for (OpIndex index : asm_.output_graph().AllOperationIndices()) {
+      WasmCodePosition position =
+          OpIndexToWasmPosition(asm_.output_graph().operation_origins()[index]);
+      asm_.output_graph().source_positions()[index] = SourcePosition(position);
+    }
+  }
+
+  void OnFirstError(FullDecoder*) {}
+
+  void NextInstruction(FullDecoder* decoder, WasmOpcode) {
+    asm_.SetCurrentOrigin(WasmPositionToOpIndex(decoder->position()));
+  }
+
+  // ******** Control Flow ********
+  // The basic structure of control flow is {block_phis_}. It contains a mapping
+  // from blocks to phi inputs corresponding to the SSA values plus the stack
+  // merge values at the beginning of the block.
+  // - When we create a new block (to be bound in the future), we register it to
+  //   {block_phis_} with {NewBlock}.
+  // - When we encounter an jump to a block, we invoke {SetupControlFlowEdge}.
+  // - Finally, when we bind a block, we setup its phis, the SSA environment,
+  //   and its merge values, with {EnterBlock}.
+  // - When we create a loop, we generate PendingLoopPhis for the SSA state and
+  //   the incoming stack values. We also create a block which will act as a
+  //   merge block for all loop backedges (since a loop in Turboshaft can only
+  //   have one backedge). When we PopControl a loop, we enter the merge block
+  //   to create its Phis for all backedges as necessary, and use those values
+  //   to patch the backedge of the PendingLoopPhis of the loop.
+
+  void Block(FullDecoder* decoder, Control* block) {
+    block->merge_block = NewBlock(decoder, block->br_merge());
+  }
+
+  void Loop(FullDecoder* decoder, Control* block) {
+    TSBlock* loop = asm_.NewLoopHeader();
+    asm_.Goto(loop);
+    asm_.Bind(loop);
+    for (uint32_t i = 0; i < decoder->num_locals(); i++) {
+      OpIndex phi = asm_.PendingLoopPhi(
+          ssa_env_[i], RepresentationFor(decoder->local_type(i)));
+      ssa_env_[i] = phi;
+    }
+    uint32_t arity = block->start_merge.arity;
+    Value* stack_base = arity > 0 ? decoder->stack_value(arity) : nullptr;
+    for (uint32_t i = 0; i < arity; i++) {
+      OpIndex phi = asm_.PendingLoopPhi(stack_base[i].op,
+                                        RepresentationFor(stack_base[i].type));
+      block->start_merge[i].op = phi;
+    }
+
+    StackCheck();
+
+    TSBlock* loop_merge = NewBlock(decoder, &block->start_merge);
+    block->merge_block = loop_merge;
+    block->false_or_loop_or_catch_block = loop;
+  }
+
+  void If(FullDecoder* decoder, const Value& cond, Control* if_block) {
+    TSBlock* true_block = NewBlock(decoder, nullptr);
+    TSBlock* false_block = NewBlock(decoder, nullptr);
+    TSBlock* merge_block = NewBlock(decoder, &if_block->end_merge);
+    if_block->false_or_loop_or_catch_block = false_block;
+    if_block->merge_block = merge_block;
+    SetupControlFlowEdge(decoder, true_block);
+    SetupControlFlowEdge(decoder, false_block);
+    // TODO(14108): Branch hints.
+    asm_.Branch(ConditionWithHint(cond.op), true_block, false_block);
+    EnterBlock(decoder, true_block, nullptr);
+  }
+
+  void Else(FullDecoder* decoder, Control* if_block) {
+    if (if_block->reachable()) {
+      SetupControlFlowEdge(decoder, if_block->merge_block);
+      asm_.Goto(if_block->merge_block);
+    }
+    EnterBlock(decoder, if_block->false_or_loop_or_catch_block, nullptr);
+  }
+
+  void BrOrRet(FullDecoder* decoder, uint32_t depth, uint32_t drop_values) {
+    if (depth == decoder->control_depth() - 1) {
+      DoReturn(decoder, drop_values);
+    } else {
+      Control* target = decoder->control_at(depth);
+      SetupControlFlowEdge(decoder, target->merge_block, drop_values);
+      asm_.Goto(target->merge_block);
+    }
+  }
+
+  void BrIf(FullDecoder* decoder, const Value& cond, uint32_t depth) {
+    if (depth == decoder->control_depth() - 1) {
+      TSBlock* return_block = NewBlock(decoder, nullptr);
+      SetupControlFlowEdge(decoder, return_block);
+      TSBlock* non_branching = NewBlock(decoder, nullptr);
+      SetupControlFlowEdge(decoder, non_branching);
+      asm_.Branch(ConditionWithHint(cond.op), return_block, non_branching);
+      EnterBlock(decoder, return_block, nullptr);
+      DoReturn(decoder, 0);
+      EnterBlock(decoder, non_branching, nullptr);
+    } else {
+      Control* target = decoder->control_at(depth);
+      SetupControlFlowEdge(decoder, target->merge_block);
+      TSBlock* non_branching = NewBlock(decoder, nullptr);
+      SetupControlFlowEdge(decoder, non_branching);
+      asm_.Branch(ConditionWithHint(cond.op), target->merge_block,
+                  non_branching);
+      EnterBlock(decoder, non_branching, nullptr);
+    }
+  }
+
+  void BrTable(FullDecoder* decoder, const BranchTableImmediate& imm,
+               const Value& key) {
+    compiler::turboshaft::SwitchOp::Case* cases =
+        asm_.output_graph()
+            .graph_zone()
+            ->AllocateArray<compiler::turboshaft::SwitchOp::Case>(
+                imm.table_count);
+    BranchTableIterator<ValidationTag> new_block_iterator(decoder, imm);
+    std::vector<TSBlock*> intermediate_blocks;
+    TSBlock* default_case = nullptr;
+    while (new_block_iterator.has_next()) {
+      TSBlock* intermediate = NewBlock(decoder, nullptr);
+      SetupControlFlowEdge(decoder, intermediate);
+      intermediate_blocks.emplace_back(intermediate);
+      uint32_t i = new_block_iterator.cur_index();
+      if (i == imm.table_count) {
+        default_case = intermediate;
+      } else {
+        cases[i] = {static_cast<int>(i), intermediate, BranchHint::kNone};
+      }
+      new_block_iterator.next();
+    }
+    DCHECK_NOT_NULL(default_case);
+    asm_.Switch(key.op, base::VectorOf(cases, imm.table_count), default_case);
+
+    int i = 0;
+    BranchTableIterator<ValidationTag> branch_iterator(decoder, imm);
+    while (branch_iterator.has_next()) {
+      TSBlock* intermediate = intermediate_blocks[i];
+      i++;
+      EnterBlock(decoder, intermediate, nullptr);
+      BrOrRet(decoder, branch_iterator.next(), 0);
+    }
+  }
+
+  void FallThruTo(FullDecoder* decoder, Control* block) {
+    // TODO(14108): Why is {block->reachable()} not reliable here? Maybe it is
+    // not in other spots as well.
+    if (asm_.current_block() != nullptr) {
+      SetupControlFlowEdge(decoder, block->merge_block);
+      asm_.Goto(block->merge_block);
+    }
+  }
+
+  void PopControl(FullDecoder* decoder, Control* block) {
+    switch (block->kind) {
+      case kControlIf:
+        if (block->reachable()) {
+          SetupControlFlowEdge(decoder, block->merge_block);
+          asm_.Goto(block->merge_block);
+        }
+        EnterBlock(decoder, block->false_or_loop_or_catch_block, nullptr);
+        // Exceptionally for one-armed if, we cannot take the values from the
+        // stack; we have to pass the stack values at the beginning of the
+        // if-block.
+        SetupControlFlowEdge(decoder, block->merge_block, 0, OpIndex::Invalid(),
+                             &block->start_merge);
+        asm_.Goto(block->merge_block);
+        EnterBlock(decoder, block->merge_block, block->br_merge());
+        break;
+      case kControlIfElse:
+      case kControlBlock:
+      case kControlTry:
+      case kControlTryCatch:
+      case kControlTryCatchAll:
+        // {block->reachable()} is not reliable here for exceptions, because
+        // the decoder sets the reachability to the upper block's reachability
+        // before calling this interface function.
+        if (asm_.current_block() != nullptr) {
+          SetupControlFlowEdge(decoder, block->merge_block);
+          asm_.Goto(block->merge_block);
+        }
+        EnterBlock(decoder, block->merge_block, block->br_merge());
+        break;
+      case kControlLoop: {
+        TSBlock* post_loop = NewBlock(decoder, nullptr);
+        if (block->reachable()) {
+          SetupControlFlowEdge(decoder, post_loop);
+          asm_.Goto(post_loop);
+        }
+        if (block->merge_block->PredecessorCount() == 0) {
+          // Turns out, the loop has no backedges, i.e. it is not quite a loop
+          // at all. Replace it with a merge, and its PendingPhis with one-input
+          // phis.
+          block->false_or_loop_or_catch_block->SetKind(
+              compiler::turboshaft::Block::Kind::kMerge);
+          auto to = asm_.output_graph()
+                        .operations(*block->false_or_loop_or_catch_block)
+                        .begin();
+          for (uint32_t i = 0; i < ssa_env_.size() + block->br_merge()->arity;
+               ++i, ++to) {
+            // TODO(manoskouk): Add `->` operator to the iterator.
+            PendingLoopPhiOp& pending_phi = (*to).Cast<PendingLoopPhiOp>();
+            OpIndex replaced = asm_.output_graph().Index(*to);
+            asm_.output_graph().Replace<compiler::turboshaft::PhiOp>(
+                replaced, base::VectorOf({pending_phi.first()}),
+                pending_phi.rep);
+          }
+        } else {
+          // We abuse the start merge of the loop, which is not used otherwise
+          // anymore, to store backedge inputs for the pending phi stack values
+          // of the loop.
+          EnterBlock(decoder, block->merge_block, block->br_merge());
+          asm_.Goto(block->false_or_loop_or_catch_block);
+          auto to = asm_.output_graph()
+                        .operations(*block->false_or_loop_or_catch_block)
+                        .begin();
+          for (uint32_t i = 0; i < ssa_env_.size(); ++i, ++to) {
+            PendingLoopPhiOp& pending_phi = (*to).Cast<PendingLoopPhiOp>();
+            OpIndex replaced = asm_.output_graph().Index(*to);
+            asm_.output_graph().Replace<compiler::turboshaft::PhiOp>(
+                replaced, base::VectorOf({pending_phi.first(), ssa_env_[i]}),
+                pending_phi.rep);
+          }
+          for (uint32_t i = 0; i < block->br_merge()->arity; ++i, ++to) {
+            PendingLoopPhiOp& pending_phi = (*to).Cast<PendingLoopPhiOp>();
+            OpIndex replaced = asm_.output_graph().Index(*to);
+            asm_.output_graph().Replace<compiler::turboshaft::PhiOp>(
+                replaced,
+                base::VectorOf(
+                    {pending_phi.first(), (*block->br_merge())[i].op}),
+                pending_phi.rep);
+          }
+        }
+        EnterBlock(decoder, post_loop, nullptr);
+        break;
+      }
+    }
+  }
+
+  void DoReturn(FullDecoder* decoder, uint32_t drop_values) {
+    size_t return_count = decoder->sig_->return_count();
+    base::SmallVector<OpIndex, 8> return_values(return_count);
+    Value* stack_base = return_count == 0
+                            ? nullptr
+                            : decoder->stack_value(static_cast<uint32_t>(
+                                  return_count + drop_values));
+    for (size_t i = 0; i < return_count; i++) {
+      return_values[i] = stack_base[i].op;
+    }
+    if (v8_flags.trace_wasm) {
+      V<WordPtr> info = asm_.IntPtrConstant(0);
+      if (return_count == 1) {
+        wasm::ValueType return_type = decoder->sig_->GetReturn(0);
+        int size = return_type.value_kind_size();
+        // TODO(14108): This won't fit everything.
+        info = asm_.StackSlot(size, size);
+        // TODO(14108): Write barrier might be needed.
+        asm_.Store(
+            info, return_values[0], StoreOp::Kind::RawAligned(),
+            MemoryRepresentation::FromMachineType(return_type.machine_type()),
+            compiler::kNoWriteBarrier);
+      }
+      CallRuntime(Runtime::kWasmTraceExit, {info});
+    }
+    asm_.Return(asm_.Word32Constant(0), base::VectorOf(return_values));
+  }
+
+  void UnOp(FullDecoder* decoder, WasmOpcode opcode, const Value& value,
+            Value* result) {
+    result->op = UnOpImpl(decoder, opcode, value.op, value.type);
+  }
+
+  void BinOp(FullDecoder* decoder, WasmOpcode opcode, const Value& lhs,
+             const Value& rhs, Value* result) {
+    result->op = BinOpImpl(opcode, lhs.op, rhs.op);
+  }
+
+  void TraceInstruction(FullDecoder* decoder, uint32_t markid) {
+    // TODO(14108): Implement.
+  }
+
+  void I32Const(FullDecoder* decoder, Value* result, int32_t value) {
+    result->op = asm_.Word32Constant(value);
+  }
+
+  void I64Const(FullDecoder* decoder, Value* result, int64_t value) {
+    result->op = asm_.Word64Constant(value);
+  }
+
+  void F32Const(FullDecoder* decoder, Value* result, float value) {
+    result->op = asm_.Float32Constant(value);
+  }
+
+  void F64Const(FullDecoder* decoder, Value* result, double value) {
+    result->op = asm_.Float64Constant(value);
+  }
+
+  void S128Const(FullDecoder* decoder, const Simd128Immediate& imm,
+                 Value* result) {
+    result->op = asm_.Simd128Constant(imm.value);
+  }
+
+  void RefNull(FullDecoder* decoder, ValueType type, Value* result) {
+    result->op = asm_.Null(type);
+  }
+
+  void RefFunc(FullDecoder* decoder, uint32_t function_index, Value* result) {
+    V<FixedArray> functions = LOAD_INSTANCE_FIELD(
+        WasmInternalFunctions, MemoryRepresentation::TaggedPointer());
+    V<Tagged> maybe_function = LoadFixedArrayElement(functions, function_index);
+
+    Label<WasmInternalFunction> done(&asm_);
+    IF (asm_.IsSmi(maybe_function)) {
+      V<Word32> function_index_constant = asm_.Word32Constant(function_index);
+      V<WasmInternalFunction> from_builtin = CallBuiltinFromRuntimeStub(
+          decoder, wasm::WasmCode::kWasmRefFunc, {function_index_constant});
+      GOTO(done, from_builtin);
+    }
+    ELSE {
+      GOTO(done, V<WasmInternalFunction>::Cast(maybe_function));
+    }
+    END_IF
+    BIND(done, result_value);
+
+    result->op = result_value;
+  }
+
+  void RefAsNonNull(FullDecoder* decoder, const Value& arg, Value* result) {
+    result->op =
+        asm_.AssertNotNull(arg.op, arg.type, TrapId::kTrapNullDereference);
+  }
+
+  void Drop(FullDecoder* decoder) {}
+
+  void LocalGet(FullDecoder* decoder, Value* result,
+                const IndexImmediate& imm) {
+    result->op = ssa_env_[imm.index];
+  }
+
+  void LocalSet(FullDecoder* decoder, const Value& value,
+                const IndexImmediate& imm) {
+    ssa_env_[imm.index] = value.op;
+  }
+
+  void LocalTee(FullDecoder* decoder, const Value& value, Value* result,
+                const IndexImmediate& imm) {
+    ssa_env_[imm.index] = result->op = value.op;
+  }
+
+  void GlobalGet(FullDecoder* decoder, Value* result,
+                 const GlobalIndexImmediate& imm) {
+    result->op = asm_.GlobalGet(instance_node_, imm.global);
+  }
+
+  void GlobalSet(FullDecoder* decoder, const Value& value,
+                 const GlobalIndexImmediate& imm) {
+    asm_.GlobalSet(instance_node_, value.op, imm.global);
+  }
+
+  void Trap(FullDecoder* decoder, TrapReason reason) {
+    asm_.TrapIfNot(asm_.Word32Constant(0), OpIndex::Invalid(),
+                   GetTrapIdForTrap(reason));
+    asm_.Unreachable();
+  }
+
+  void AssertNullTypecheck(FullDecoder* decoder, const Value& obj,
+                           Value* result) {
+    asm_.TrapIfNot(asm_.IsNull(obj.op, obj.type), OpIndex::Invalid(),
+                   TrapId::kTrapIllegalCast);
+    Forward(decoder, obj, result);
+  }
+
+  void AssertNotNullTypecheck(FullDecoder* decoder, const Value& obj,
+                              Value* result) {
+    asm_.AssertNotNull(obj.op, obj.type, TrapId::kTrapIllegalCast);
+    Forward(decoder, obj, result);
+  }
+
+  void NopForTestingUnsupportedInLiftoff(FullDecoder* decoder) {
+    Bailout(decoder);
+  }
+
+  void Select(FullDecoder* decoder, const Value& cond, const Value& fval,
+              const Value& tval, Value* result) {
+    using Implementation = compiler::turboshaft::SelectOp::Implementation;
+    bool use_select = false;
+    switch (tval.type.kind()) {
+      case kI32:
+        if (SupportedOperations::word32_select()) use_select = true;
+        break;
+      case kI64:
+        if (SupportedOperations::word64_select()) use_select = true;
+        break;
+      case kF32:
+        if (SupportedOperations::float32_select()) use_select = true;
+        break;
+      case kF64:
+        if (SupportedOperations::float64_select()) use_select = true;
+        break;
+      case kRef:
+      case kRefNull:
+      case kS128:
+        break;
+      case kI8:
+      case kI16:
+      case kRtt:
+      case kVoid:
+      case kBottom:
+        UNREACHABLE();
+    }
+
+    if (use_select) {
+      result->op =
+          asm_.Select(cond.op, tval.op, fval.op, RepresentationFor(tval.type),
+                      BranchHint::kNone, Implementation::kCMove);
+      return;
+    } else {
+      TSBlock* true_block = asm_.NewBlock();
+      TSBlock* false_block = asm_.NewBlock();
+      TSBlock* merge_block = asm_.NewBlock();
+      asm_.Branch(ConditionWithHint(cond.op), true_block, false_block);
+      asm_.Bind(true_block);
+      asm_.Goto(merge_block);
+      asm_.Bind(false_block);
+      asm_.Goto(merge_block);
+      asm_.Bind(merge_block);
+      result->op = asm_.Phi({tval.op, fval.op}, RepresentationFor(tval.type));
+    }
+  }
+
+  // TODO(14108): Cache memories' starts and sizes. Consider VariableReducer,
+  // LoadElimination, or manual handling like ssa_env_.
+  void LoadMem(FullDecoder* decoder, LoadType type,
+               const MemoryAccessImmediate& imm, const Value& index,
+               Value* result) {
+#if defined(V8_TARGET_BIG_ENDIAN)
+    // TODO(14108): Implement for big endian.
+    Bailout(decoder);
+#endif
+
+    MemoryRepresentation repr =
+        MemoryRepresentation::FromMachineType(type.mem_type());
+
+    auto [final_index, strategy] =
+        BoundsCheckMem(imm.memory, repr, index.op, imm.offset,
+                       compiler::EnforceBoundsCheck::kCanOmitBoundsCheck);
+
+    V<WordPtr> mem_start = MemStart(imm.memory->index);
+
+    LoadOp::Kind load_kind = GetMemoryAccessKind(repr, strategy);
+
+    // TODO(14108): If offset is in int range, use it as static offset.
+    OpIndex load = asm_.Load(asm_.WordPtrAdd(mem_start, imm.offset),
+                             final_index, load_kind, repr);
+    OpIndex extended_load =
+        (type.value_type() == kWasmI64 && repr.SizeInBytes() < 8)
+            ? (repr.IsSigned() ? asm_.ChangeInt32ToInt64(load)
+                               : asm_.ChangeUint32ToUint64(load))
+            : load;
+
+    if (v8_flags.trace_wasm_memory) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
+      TraceMemoryOperation(false, repr, final_index, imm.offset);
+    }
+
+    result->op = extended_load;
+  }
+
+  void LoadTransform(FullDecoder* decoder, LoadType type,
+                     LoadTransformationKind transform,
+                     const MemoryAccessImmediate& imm, const Value& index,
+                     Value* result) {
+#if defined(V8_TARGET_BIG_ENDIAN)
+    // TODO(14108): Implement for big endian.
+    Bailout(decoder);
+#endif
+    MemoryRepresentation repr =
+        transform == LoadTransformationKind::kExtend
+            ? MemoryRepresentation::Int64()
+            : MemoryRepresentation::FromMachineType(type.mem_type());
+
+    auto [final_index, strategy] =
+        BoundsCheckMem(imm.memory, repr, index.op, imm.offset,
+                       compiler::EnforceBoundsCheck::kCanOmitBoundsCheck);
+
+    compiler::turboshaft::Simd128LoadTransformOp::LoadKind load_kind =
+        GetMemoryAccessKind(repr, strategy);
+
+    using TransformKind =
+        compiler::turboshaft::Simd128LoadTransformOp::TransformKind;
+
+    TransformKind transform_kind;
+
+    if (transform == LoadTransformationKind::kExtend) {
+      if (type.mem_type() == MachineType::Int8()) {
+        transform_kind = TransformKind::k8x8S;
+      } else if (type.mem_type() == MachineType::Uint8()) {
+        transform_kind = TransformKind::k8x8U;
+      } else if (type.mem_type() == MachineType::Int16()) {
+        transform_kind = TransformKind::k16x4S;
+      } else if (type.mem_type() == MachineType::Uint16()) {
+        transform_kind = TransformKind::k16x4U;
+      } else if (type.mem_type() == MachineType::Int32()) {
+        transform_kind = TransformKind::k32x2S;
+      } else if (type.mem_type() == MachineType::Uint32()) {
+        transform_kind = TransformKind::k32x2U;
+      } else {
+        UNREACHABLE();
+      }
+    } else if (transform == LoadTransformationKind::kSplat) {
+      if (type.mem_type() == MachineType::Int8()) {
+        transform_kind = TransformKind::k8Splat;
+      } else if (type.mem_type() == MachineType::Int16()) {
+        transform_kind = TransformKind::k16Splat;
+      } else if (type.mem_type() == MachineType::Int32()) {
+        transform_kind = TransformKind::k32Splat;
+      } else if (type.mem_type() == MachineType::Int64()) {
+        transform_kind = TransformKind::k64Splat;
+      } else {
+        UNREACHABLE();
+      }
+    } else {
+      if (type.mem_type() == MachineType::Int32()) {
+        transform_kind = TransformKind::k32Zero;
+      } else if (type.mem_type() == MachineType::Int64()) {
+        transform_kind = TransformKind::k64Zero;
+      } else {
+        UNREACHABLE();
+      }
+    }
+
+    OpIndex load = asm_.Simd128LoadTransform(
+        asm_.WordPtrAdd(MemStart(imm.mem_index), imm.offset), final_index,
+        load_kind, transform_kind, 0);
+
+    if (v8_flags.trace_wasm_memory) {
+      TraceMemoryOperation(false, repr, final_index, imm.offset);
+    }
+
+    result->op = load;
+  }
+
+  void LoadLane(FullDecoder* decoder, LoadType type, const Value& value,
+                const Value& index, const MemoryAccessImmediate& imm,
+                const uint8_t laneidx, Value* result) {
+    using compiler::turboshaft::Simd128LaneMemoryOp;
+#if defined(V8_TARGET_BIG_ENDIAN)
+    // TODO(14108): Implement for big endian.
+    Bailout(decoder);
+#endif
+
+    MemoryRepresentation repr =
+        MemoryRepresentation::FromMachineType(type.mem_type());
+
+    auto [final_index, strategy] =
+        BoundsCheckMem(imm.memory, repr, index.op, imm.offset,
+                       compiler::EnforceBoundsCheck::kCanOmitBoundsCheck);
+    Simd128LaneMemoryOp::Kind kind = GetMemoryAccessKind(repr, strategy);
+
+    Simd128LaneMemoryOp::LaneKind lane_kind;
+
+    switch (repr) {
+      case MemoryRepresentation::Int8():
+        lane_kind = Simd128LaneMemoryOp::LaneKind::k8;
+        break;
+      case MemoryRepresentation::Int16():
+        lane_kind = Simd128LaneMemoryOp::LaneKind::k16;
+        break;
+      case MemoryRepresentation::Int32():
+        lane_kind = Simd128LaneMemoryOp::LaneKind::k32;
+        break;
+      case MemoryRepresentation::Int64():
+        lane_kind = Simd128LaneMemoryOp::LaneKind::k64;
+        break;
+      default:
+        UNREACHABLE();
+    }
+
+    // TODO(14108): If `offset` is in int range, use it as static offset, or
+    // consider using a larger type as offset.
+    OpIndex load = asm_.Simd128LaneMemory(
+        asm_.WordPtrAdd(MemStart(imm.mem_index), imm.offset), final_index,
+        value.op, Simd128LaneMemoryOp::Mode::kLoad, kind, lane_kind, laneidx,
+        0);
+
+    if (v8_flags.trace_wasm_memory) {
+      TraceMemoryOperation(false, repr, final_index, imm.offset);
+    }
+
+    result->op = load;
+  }
+
+  void StoreMem(FullDecoder* decoder, StoreType type,
+                const MemoryAccessImmediate& imm, const Value& index,
+                const Value& value) {
+#if defined(V8_TARGET_BIG_ENDIAN)
+    // TODO(14108): Implement for big endian.
+    Bailout(decoder);
+#endif
+
+    MemoryRepresentation repr =
+        MemoryRepresentation::FromMachineRepresentation(type.mem_rep());
+
+    auto [final_index, strategy] =
+        BoundsCheckMem(imm.memory, repr, index.op, imm.offset,
+                       wasm::kPartialOOBWritesAreNoops
+                           ? compiler::EnforceBoundsCheck::kCanOmitBoundsCheck
+                           : compiler::EnforceBoundsCheck::kNeedsBoundsCheck);
+
+    V<WordPtr> mem_start = MemStart(imm.memory->index);
+
+    StoreOp::Kind store_kind = GetMemoryAccessKind(repr, strategy);
+
+    OpIndex store_value = value.op;
+    if (value.type == kWasmI64 && repr.SizeInBytes() <= 4) {
+      store_value = asm_.TruncateWord64ToWord32(store_value);
+    }
+    // TODO(14108): If offset is in int range, use it as static offset.
+    asm_.Store(mem_start, asm_.WordPtrAdd(imm.offset, final_index), store_value,
+               store_kind, repr, compiler::kNoWriteBarrier, 0);
+
+    if (v8_flags.trace_wasm_memory) {
+      // TODO(14259): Implement memory tracing for multiple memories.
+      CHECK_EQ(0, imm.memory->index);
+      TraceMemoryOperation(true, repr, final_index, imm.offset);
+    }
+  }
+
+  void StoreLane(FullDecoder* decoder, StoreType type,
+                 const MemoryAccessImmediate& imm, const Value& index,
+                 const Value& value, const uint8_t laneidx) {
+    using compiler::turboshaft::Simd128LaneMemoryOp;
+#if defined(V8_TARGET_BIG_ENDIAN)
+    // TODO(14108): Implement for big endian.
+    Bailout(decoder);
+#endif
+
+    MemoryRepresentation repr =
+        MemoryRepresentation::FromMachineRepresentation(type.mem_rep());
+
+    auto [final_index, strategy] =
+        BoundsCheckMem(imm.memory, repr, index.op, imm.offset,
+                       kPartialOOBWritesAreNoops
+                           ? compiler::EnforceBoundsCheck::kCanOmitBoundsCheck
+                           : compiler::EnforceBoundsCheck::kNeedsBoundsCheck);
+    Simd128LaneMemoryOp::Kind kind = GetMemoryAccessKind(repr, strategy);
+
+    Simd128LaneMemoryOp::LaneKind lane_kind;
+
+    switch (repr) {
+      // TODO(manoskouk): Why use unsigned representations here as opposed to
+      // LoadLane?
+      case MemoryRepresentation::Uint8():
+        lane_kind = Simd128LaneMemoryOp::LaneKind::k8;
+        break;
+      case MemoryRepresentation::Uint16():
+        lane_kind = Simd128LaneMemoryOp::LaneKind::k16;
+        break;
+      case MemoryRepresentation::Uint32():
+        lane_kind = Simd128LaneMemoryOp::LaneKind::k32;
+        break;
+      case MemoryRepresentation::Uint64():
+        lane_kind = Simd128LaneMemoryOp::LaneKind::k64;
+        break;
+      default:
+        UNREACHABLE();
+    }
+
+    // TODO(14108): If `offset` is in int range, use it as static offset, or
+    // consider using a larger type as offset.
+    asm_.Simd128LaneMemory(asm_.WordPtrAdd(MemStart(imm.mem_index), imm.offset),
+                           final_index, value.op,
+                           Simd128LaneMemoryOp::Mode::kStore, kind, lane_kind,
+                           laneidx, 0);
+
+    if (v8_flags.trace_wasm_memory) {
+      TraceMemoryOperation(true, repr, final_index, imm.offset);
+    }
+  }
+
+  void CurrentMemoryPages(FullDecoder* decoder, const MemoryIndexImmediate& imm,
+                          Value* result) {
+    V<WordPtr> result_wordptr =
+        asm_.WordPtrShiftRightArithmetic(MemSize(imm.index), kWasmPageSizeLog2);
+    // In the 32-bit case, truncation happens implicitly.
+    if (imm.memory->is_memory64) {
+      result->op = asm_.ChangeIntPtrToInt64(result_wordptr);
+    } else {
+      result->op = asm_.TruncateWordPtrToWord32(result_wordptr);
+    }
+  }
+
+  void MemoryGrow(FullDecoder* decoder, const MemoryIndexImmediate& imm,
+                  const Value& value, Value* result) {
+    if (!imm.memory->is_memory64) {
+      result->op = CallBuiltinFromRuntimeStub(
+          decoder, WasmCode::kWasmMemoryGrow,
+          {asm_.Word32Constant(imm.index), value.op});
+    } else {
+      Label<Word64> done(&asm_);
+
+      IF (asm_.Uint64LessThanOrEqual(
+              value.op, asm_.Word64Constant(static_cast<int64_t>(kMaxInt)))) {
+        GOTO(done, asm_.ChangeInt32ToInt64(CallBuiltinFromRuntimeStub(
+                       decoder, WasmCode::kWasmMemoryGrow,
+                       {asm_.Word32Constant(imm.index),
+                        asm_.TruncateWord64ToWord32(value.op)})));
+      }
+      ELSE {
+        GOTO(done, asm_.Word64Constant(int64_t{-1}));
+      }
+      END_IF
+
+      BIND(done, result_64);
+
+      result->op = result_64;
+    }
+  }
+
+  void CallDirect(FullDecoder* decoder, const CallFunctionImmediate& imm,
+                  const Value args[], Value returns[]) {
+    if (imm.index < decoder->module_->num_imported_functions) {
+      auto [target, ref] = BuildImportedFunctionTargetAndRef(imm.index);
+      BuildWasmCall(decoder, imm.sig, target, ref, args, returns);
+    } else {
+      // Locally defined function.
+      V<WordPtr> callee =
+          asm_.RelocatableConstant(imm.index, RelocInfo::WASM_CALL);
+      BuildWasmCall(decoder, imm.sig, callee, instance_node_, args, returns);
+    }
+  }
+
+  void ReturnCall(FullDecoder* decoder, const CallFunctionImmediate& imm,
+                  const Value args[]) {
+    if (imm.index < decoder->module_->num_imported_functions) {
+      auto [target, ref] = BuildImportedFunctionTargetAndRef(imm.index);
+      BuildWasmReturnCall(imm.sig, target, ref, args);
+    } else {
+      // Locally defined function.
+      V<WordPtr> callee =
+          asm_.RelocatableConstant(imm.index, RelocInfo::WASM_CALL);
+      BuildWasmReturnCall(imm.sig, callee, instance_node_, args);
+    }
+  }
+
+  void CallIndirect(FullDecoder* decoder, const Value& index,
+                    const CallIndirectImmediate& imm, const Value args[],
+                    Value returns[]) {
+    auto [target, ref] = BuildIndirectCallTargetAndRef(decoder, index.op, imm);
+    if (!target.valid()) return;
+    BuildWasmCall(decoder, imm.sig, target, ref, args, returns);
+  }
+
+  void ReturnCallIndirect(FullDecoder* decoder, const Value& index,
+                          const CallIndirectImmediate& imm,
+                          const Value args[]) {
+    auto [target, ref] = BuildIndirectCallTargetAndRef(decoder, index.op, imm);
+    if (!target.valid()) return;
+    BuildWasmReturnCall(imm.sig, target, ref, args);
+  }
+
+  void CallRef(FullDecoder* decoder, const Value& func_ref,
+               const FunctionSig* sig, uint32_t sig_index, const Value args[],
+               Value returns[]) {
+    auto [target, ref] =
+        BuildFunctionReferenceTargetAndRef(func_ref.op, func_ref.type);
+    BuildWasmCall(decoder, sig, target, ref, args, returns);
+  }
+
+  void ReturnCallRef(FullDecoder* decoder, const Value& func_ref,
+                     const FunctionSig* sig, uint32_t sig_index,
+                     const Value args[]) {
+    auto [target, ref] =
+        BuildFunctionReferenceTargetAndRef(func_ref.op, func_ref.type);
+    BuildWasmReturnCall(sig, target, ref, args);
+  }
+
+  void BrOnNull(FullDecoder* decoder, const Value& ref_object, uint32_t depth,
+                bool pass_null_along_branch, Value* result_on_fallthrough) {
+    result_on_fallthrough->op = ref_object.op;
+    TSBlock* null_branch = asm_.NewBlock();
+    TSBlock* non_null_branch = asm_.NewBlock();
+    asm_.Branch(ConditionWithHint(asm_.IsNull(ref_object.op, ref_object.type),
+                                  BranchHint::kFalse),
+                null_branch, non_null_branch);
+    asm_.Bind(null_branch);
+    BrOrRet(decoder, depth, pass_null_along_branch ? 0 : 1);
+    asm_.Bind(non_null_branch);
+  }
+
+  void BrOnNonNull(FullDecoder* decoder, const Value& ref_object, Value* result,
+                   uint32_t depth, bool /* drop_null_on_fallthrough */) {
+    result->op = ref_object.op;
+    TSBlock* null_branch = asm_.NewBlock();
+    TSBlock* non_null_branch = asm_.NewBlock();
+    asm_.Branch(ConditionWithHint(asm_.IsNull(ref_object.op, ref_object.type),
+                                  BranchHint::kFalse),
+                null_branch, non_null_branch);
+    asm_.Bind(non_null_branch);
+    BrOrRet(decoder, depth, 0);
+    asm_.Bind(null_branch);
+  }
+
+  void SimdOp(FullDecoder* decoder, WasmOpcode opcode, const Value* args,
+              Value* result) {
+    switch (opcode) {
+#define HANDLE_BINARY_OPCODE(kind)                            \
+  case kExpr##kind:                                           \
+    result->op = asm_.Simd128Binop(                           \
+        args[0].op, args[1].op,                               \
+        compiler::turboshaft::Simd128BinopOp::Kind::k##kind); \
+    break;
+      FOREACH_SIMD_128_BINARY_OPCODE(HANDLE_BINARY_OPCODE)
+#undef HANDLE_BINARY_OPCODE
+
+#define HANDLE_INVERSE_COMPARISON(wasm_kind, ts_kind)            \
+  case kExpr##wasm_kind:                                         \
+    result->op = asm_.Simd128Binop(                              \
+        args[1].op, args[0].op,                                  \
+        compiler::turboshaft::Simd128BinopOp::Kind::k##ts_kind); \
+    break;
+
+      HANDLE_INVERSE_COMPARISON(I8x16LtS, I8x16GtS)
+      HANDLE_INVERSE_COMPARISON(I8x16LtU, I8x16GtU)
+      HANDLE_INVERSE_COMPARISON(I8x16LeS, I8x16GeS)
+      HANDLE_INVERSE_COMPARISON(I8x16LeU, I8x16GeU)
+
+      HANDLE_INVERSE_COMPARISON(I16x8LtS, I16x8GtS)
+      HANDLE_INVERSE_COMPARISON(I16x8LtU, I16x8GtU)
+      HANDLE_INVERSE_COMPARISON(I16x8LeS, I16x8GeS)
+      HANDLE_INVERSE_COMPARISON(I16x8LeU, I16x8GeU)
+
+      HANDLE_INVERSE_COMPARISON(I32x4LtS, I32x4GtS)
+      HANDLE_INVERSE_COMPARISON(I32x4LtU, I32x4GtU)
+      HANDLE_INVERSE_COMPARISON(I32x4LeS, I32x4GeS)
+      HANDLE_INVERSE_COMPARISON(I32x4LeU, I32x4GeU)
+
+      HANDLE_INVERSE_COMPARISON(I64x2LtS, I64x2GtS)
+      HANDLE_INVERSE_COMPARISON(I64x2LeS, I64x2GeS)
+
+      HANDLE_INVERSE_COMPARISON(F32x4Gt, F32x4Lt)
+      HANDLE_INVERSE_COMPARISON(F32x4Ge, F32x4Le)
+      HANDLE_INVERSE_COMPARISON(F64x2Gt, F64x2Lt)
+      HANDLE_INVERSE_COMPARISON(F64x2Ge, F64x2Le)
+
+#undef HANDLE_INVERSE_COMPARISON
+
+#define HANDLE_UNARY_NON_OPTIONAL_OPCODE(kind)                            \
+  case kExpr##kind:                                                       \
+    result->op = asm_.Simd128Unary(                                       \
+        args[0].op, compiler::turboshaft::Simd128UnaryOp::Kind::k##kind); \
+    break;
+      FOREACH_SIMD_128_UNARY_NON_OPTIONAL_OPCODE(
+          HANDLE_UNARY_NON_OPTIONAL_OPCODE)
+#undef HANDLE_UNARY_NON_OPTIONAL_OPCODE
+
+#define HANDLE_UNARY_OPTIONAL_OPCODE(kind, feature, external_ref)           \
+  case kExpr##kind:                                                         \
+    if (SupportedOperations::feature()) {                                   \
+      result->op = asm_.Simd128Unary(                                       \
+          args[0].op, compiler::turboshaft::Simd128UnaryOp::Kind::k##kind); \
+    } else {                                                                \
+      result->op = CallCStackSlotToStackSlot(                               \
+          args[0].op, ExternalReference::external_ref(),                    \
+          MemoryRepresentation::Simd128());                                 \
+    }                                                                       \
+    break;
+      HANDLE_UNARY_OPTIONAL_OPCODE(F32x4Ceil, float32_round_up, wasm_f32x4_ceil)
+      HANDLE_UNARY_OPTIONAL_OPCODE(F32x4Floor, float32_round_down,
+                                   wasm_f32x4_floor)
+      HANDLE_UNARY_OPTIONAL_OPCODE(F32x4Trunc, float32_round_to_zero,
+                                   wasm_f32x4_trunc)
+      HANDLE_UNARY_OPTIONAL_OPCODE(F32x4NearestInt, float32_round_ties_even,
+                                   wasm_f32x4_nearest_int)
+      HANDLE_UNARY_OPTIONAL_OPCODE(F64x2Ceil, float64_round_up, wasm_f64x2_ceil)
+      HANDLE_UNARY_OPTIONAL_OPCODE(F64x2Floor, float64_round_down,
+                                   wasm_f64x2_floor)
+      HANDLE_UNARY_OPTIONAL_OPCODE(F64x2Trunc, float64_round_to_zero,
+                                   wasm_f64x2_trunc)
+      HANDLE_UNARY_OPTIONAL_OPCODE(F64x2NearestInt, float64_round_ties_even,
+                                   wasm_f64x2_nearest_int)
+#undef HANDLE_UNARY_OPTIONAL_OPCODE
+
+#define HANDLE_SHIFT_OPCODE(kind)                             \
+  case kExpr##kind:                                           \
+    result->op = asm_.Simd128Shift(                           \
+        args[0].op, args[1].op,                               \
+        compiler::turboshaft::Simd128ShiftOp::Kind::k##kind); \
+    break;
+      FOREACH_SIMD_128_SHIFT_OPCODE(HANDLE_SHIFT_OPCODE)
+#undef HANDLE_SHIFT_OPCODE
+
+#define HANDLE_TEST_OPCODE(kind)                                         \
+  case kExpr##kind:                                                      \
+    result->op = asm_.Simd128Test(                                       \
+        args[0].op, compiler::turboshaft::Simd128TestOp::Kind::k##kind); \
+    break;
+      FOREACH_SIMD_128_TEST_OPCODE(HANDLE_TEST_OPCODE)
+#undef HANDLE_TEST_OPCODE
+
+#define HANDLE_SPLAT_OPCODE(kind)                                         \
+  case kExpr##kind##Splat:                                                \
+    result->op = asm_.Simd128Splat(                                       \
+        args[0].op, compiler::turboshaft::Simd128SplatOp::Kind::k##kind); \
+    break;
+      FOREACH_SIMD_128_SPLAT_OPCODE(HANDLE_SPLAT_OPCODE)
+#undef HANDLE_SPLAT_OPCODE
+
+// Ternary mask operators put the mask as first input.
+#define HANDLE_TERNARY_MASK_OPCODE(kind)                        \
+  case kExpr##kind:                                             \
+    result->op = asm_.Simd128Ternary(                           \
+        args[2].op, args[0].op, args[1].op,                     \
+        compiler::turboshaft::Simd128TernaryOp::Kind::k##kind); \
+    break;
+      FOREACH_SIMD_128_TERNARY_MASK_OPCODE(HANDLE_TERNARY_MASK_OPCODE)
+#undef HANDLE_TERNARY_MASK_OPCODE
+
+#define HANDLE_TERNARY_OTHER_OPCODE(kind)                       \
+  case kExpr##kind:                                             \
+    result->op = asm_.Simd128Ternary(                           \
+        args[0].op, args[1].op, args[2].op,                     \
+        compiler::turboshaft::Simd128TernaryOp::Kind::k##kind); \
+    break;
+      FOREACH_SIMD_128_TERNARY_OTHER_OPCODE(HANDLE_TERNARY_OTHER_OPCODE)
+#undef HANDLE_TERNARY_OTHER_OPCODE
+
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  void SimdLaneOp(FullDecoder* decoder, WasmOpcode opcode,
+                  const SimdLaneImmediate& imm,
+                  base::Vector<const Value> inputs, Value* result) {
+    using compiler::turboshaft::Simd128ExtractLaneOp;
+    using compiler::turboshaft::Simd128ReplaceLaneOp;
+    switch (opcode) {
+      case kExprI8x16ExtractLaneS:
+        result->op = asm_.Simd128ExtractLane(
+            inputs[0].op, Simd128ExtractLaneOp::Kind::kI8x16S, imm.lane);
+        break;
+      case kExprI8x16ExtractLaneU:
+        result->op = asm_.Simd128ExtractLane(
+            inputs[0].op, Simd128ExtractLaneOp::Kind::kI8x16U, imm.lane);
+        break;
+      case kExprI16x8ExtractLaneS:
+        result->op = asm_.Simd128ExtractLane(
+            inputs[0].op, Simd128ExtractLaneOp::Kind::kI16x8S, imm.lane);
+        break;
+      case kExprI16x8ExtractLaneU:
+        result->op = asm_.Simd128ExtractLane(
+            inputs[0].op, Simd128ExtractLaneOp::Kind::kI16x8U, imm.lane);
+        break;
+      case kExprI32x4ExtractLane:
+        result->op = asm_.Simd128ExtractLane(
+            inputs[0].op, Simd128ExtractLaneOp::Kind::kI32x4, imm.lane);
+        break;
+      case kExprI64x2ExtractLane:
+        result->op = asm_.Simd128ExtractLane(
+            inputs[0].op, Simd128ExtractLaneOp::Kind::kI64x2, imm.lane);
+        break;
+      case kExprF32x4ExtractLane:
+        result->op = asm_.Simd128ExtractLane(
+            inputs[0].op, Simd128ExtractLaneOp::Kind::kF32x4, imm.lane);
+        break;
+      case kExprF64x2ExtractLane:
+        result->op = asm_.Simd128ExtractLane(
+            inputs[0].op, Simd128ExtractLaneOp::Kind::kF64x2, imm.lane);
+        break;
+      case kExprI8x16ReplaceLane:
+        result->op = asm_.Simd128ReplaceLane(inputs[0].op, inputs[1].op,
+                                             Simd128ReplaceLaneOp::Kind::kI8x16,
+                                             imm.lane);
+        break;
+      case kExprI16x8ReplaceLane:
+        result->op = asm_.Simd128ReplaceLane(inputs[0].op, inputs[1].op,
+                                             Simd128ReplaceLaneOp::Kind::kI16x8,
+                                             imm.lane);
+        break;
+      case kExprI32x4ReplaceLane:
+        result->op = asm_.Simd128ReplaceLane(inputs[0].op, inputs[1].op,
+                                             Simd128ReplaceLaneOp::Kind::kI32x4,
+                                             imm.lane);
+        break;
+      case kExprI64x2ReplaceLane:
+        result->op = asm_.Simd128ReplaceLane(inputs[0].op, inputs[1].op,
+                                             Simd128ReplaceLaneOp::Kind::kI64x2,
+                                             imm.lane);
+        break;
+      case kExprF32x4ReplaceLane:
+        result->op = asm_.Simd128ReplaceLane(inputs[0].op, inputs[1].op,
+                                             Simd128ReplaceLaneOp::Kind::kF32x4,
+                                             imm.lane);
+        break;
+      case kExprF64x2ReplaceLane:
+        result->op = asm_.Simd128ReplaceLane(inputs[0].op, inputs[1].op,
+                                             Simd128ReplaceLaneOp::Kind::kF64x2,
+                                             imm.lane);
+        break;
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  void Simd8x16ShuffleOp(FullDecoder* decoder, const Simd128Immediate& imm,
+                         const Value& input0, const Value& input1,
+                         Value* result) {
+    result->op = asm_.Simd128Shuffle(input0.op, input1.op, imm.value);
+  }
+
+  void Try(FullDecoder* decoder, Control* block) {
+    block->false_or_loop_or_catch_block = NewBlock(decoder, nullptr);
+    block->merge_block = NewBlock(decoder, block->br_merge());
+  }
+
+  void Throw(FullDecoder* decoder, const TagIndexImmediate& imm,
+             const Value arg_values[]) {
+    size_t count = imm.tag->sig->parameter_count();
+    base::SmallVector<OpIndex, 8> values(count);
+    for (size_t index = 0; index < count; index++) {
+      values[index] = arg_values[index].op;
+    }
+
+    uint32_t encoded_size = WasmExceptionPackage::GetEncodedSize(imm.tag);
+
+    V<FixedArray> values_array =
+        CallBuiltinFromRuntimeStub(decoder, WasmCode::kWasmAllocateFixedArray,
+                                   {asm_.IntPtrConstant(encoded_size)});
+
+    uint32_t index = 0;
+    const wasm::WasmTagSig* sig = imm.tag->sig;
+
+    // Encode the exception values in {values_array}.
+    for (size_t i = 0; i < count; i++) {
+      OpIndex value = values[i];
+      switch (sig->GetParam(i).kind()) {
+        case kF32:
+          value = asm_.BitcastFloat32ToWord32(value);
+          V8_FALLTHROUGH;
+        case kI32:
+          BuildEncodeException32BitValue(values_array, index, value);
+          // We need 2 Smis to encode a 32-bit value.
+          index += 2;
+          break;
+        case kF64:
+          value = asm_.BitcastFloat64ToWord64(value);
+          V8_FALLTHROUGH;
+        case kI64: {
+          OpIndex upper_half = asm_.TruncateWord64ToWord32(
+              asm_.Word64ShiftRightLogical(value, 32));
+          BuildEncodeException32BitValue(values_array, index, upper_half);
+          index += 2;
+          OpIndex lower_half = asm_.TruncateWord64ToWord32(value);
+          BuildEncodeException32BitValue(values_array, index, lower_half);
+          index += 2;
+          break;
+        }
+        case wasm::kRef:
+        case wasm::kRefNull:
+        case wasm::kRtt:
+          StoreFixedArrayElement(values_array, index, value,
+                                 compiler::kFullWriteBarrier);
+          index++;
+          break;
+        case kS128: {
+          using Kind = compiler::turboshaft::Simd128ExtractLaneOp::Kind;
+          BuildEncodeException32BitValue(
+              values_array, index,
+              asm_.Simd128ExtractLane(value, Kind::kI32x4, 0));
+          index += 2;
+          BuildEncodeException32BitValue(
+              values_array, index,
+              asm_.Simd128ExtractLane(value, Kind::kI32x4, 1));
+          index += 2;
+          BuildEncodeException32BitValue(
+              values_array, index,
+              asm_.Simd128ExtractLane(value, Kind::kI32x4, 2));
+          index += 2;
+          BuildEncodeException32BitValue(
+              values_array, index,
+              asm_.Simd128ExtractLane(value, Kind::kI32x4, 3));
+          index += 2;
+          break;
+        }
+        case kI8:
+        case kI16:
+        case kVoid:
+        case kBottom:
+          UNREACHABLE();
+      }
+    }
+
+    V<FixedArray> instance_tags =
+        LOAD_INSTANCE_FIELD(TagsTable, MemoryRepresentation::TaggedPointer());
+    auto tag =
+        V<WasmTagObject>::Cast(LoadFixedArrayElement(instance_tags, imm.index));
+
+    CallBuiltinFromRuntimeStub(decoder, WasmCode::kWasmThrow,
+                               {tag, values_array}, CheckForException::kYes);
+    asm_.Unreachable();
+  }
+
+  void Rethrow(FullDecoder* decoder, Control* block) {
+    CallBuiltinFromRuntimeStub(decoder, WasmCode::kWasmRethrow,
+                               {block->exception}, CheckForException::kYes);
+    asm_.Unreachable();
+  }
+
+  // TODO(14108): Optimize in case of unreachable catch block?
+  void CatchException(FullDecoder* decoder, const TagIndexImmediate& imm,
+                      Control* block, base::Vector<Value> values) {
+    EnterBlock(decoder, block->false_or_loop_or_catch_block, nullptr,
+               &block->exception);
+    V<NativeContext> native_context = LOAD_INSTANCE_FIELD(
+        NativeContext, MemoryRepresentation::TaggedPointer());
+    V<WasmTagObject> caught_tag = CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmGetOwnProperty,
+        {block->exception, LOAD_ROOT(wasm_exception_tag_symbol),
+         native_context});
+    V<FixedArray> instance_tags =
+        LOAD_INSTANCE_FIELD(TagsTable, MemoryRepresentation::TaggedPointer());
+    auto expected_tag =
+        V<WasmTagObject>::Cast(LoadFixedArrayElement(instance_tags, imm.index));
+    TSBlock* if_catch = asm_.NewBlock();
+    TSBlock* if_no_catch = NewBlock(decoder, nullptr);
+    SetupControlFlowEdge(decoder, if_no_catch);
+
+    // If the tags don't match we continue with the next tag by setting the
+    // no-catch environment as the new {block->catch_block} here.
+    block->false_or_loop_or_catch_block = if_no_catch;
+
+    if (imm.tag->sig->parameter_count() == 1 &&
+        imm.tag->sig->GetParam(0).is_reference_to(HeapType::kExtern)) {
+      // Check for the special case where the tag is WebAssembly.JSTag and the
+      // exception is not a WebAssembly.Exception. In this case the exception is
+      // caught and pushed on the operand stack.
+      // Only perform this check if the tag signature is the same as
+      // the JSTag signature, i.e. a single externref or (ref extern), otherwise
+      // we know statically that it cannot be the JSTag.
+      V<Word32> caught_tag_undefined =
+          asm_.TaggedEqual(caught_tag, LOAD_ROOT(UndefinedValue));
+      TSBlock* js_exception = asm_.NewBlock();
+      TSBlock* wasm_exception = asm_.NewBlock();
+      TSBlock* no_catch_merge = asm_.NewBlock();
+      asm_.Branch(ConditionWithHint(caught_tag_undefined, BranchHint::kFalse),
+                  js_exception, wasm_exception);
+
+      asm_.Bind(js_exception);
+      V<Tagged> tag_object = asm_.Load(
+          native_context, LoadOp::Kind::TaggedBase(),
+          MemoryRepresentation::TaggedPointer(),
+          NativeContext::OffsetOfElementAt(Context::WASM_JS_TAG_INDEX));
+      V<Tagged> js_tag = asm_.Load(tag_object, LoadOp::Kind::TaggedBase(),
+                                   MemoryRepresentation::TaggedPointer(),
+                                   WasmTagObject::kTagOffset);
+      asm_.Branch(ConditionWithHint(asm_.TaggedEqual(expected_tag, js_tag)),
+                  if_catch, no_catch_merge);
+
+      asm_.Bind(wasm_exception);
+      TSBlock* unpack_block = asm_.NewBlock();
+      asm_.Branch(ConditionWithHint(asm_.TaggedEqual(caught_tag, expected_tag)),
+                  unpack_block, no_catch_merge);
+      asm_.Bind(unpack_block);
+      UnpackWasmException(decoder, block->exception, values);
+      asm_.Goto(if_catch);
+
+      asm_.Bind(no_catch_merge);
+      asm_.Goto(if_no_catch);
+
+      asm_.Bind(if_catch);
+      V<Tagged> args[2] = {block->exception, V<Tagged>::Cast(values[0].op)};
+      values[0].op = asm_.Phi(base::VectorOf(args, 2));
+    } else {
+      asm_.Branch(ConditionWithHint(asm_.TaggedEqual(caught_tag, expected_tag)),
+                  if_catch, if_no_catch);
+      asm_.Bind(if_catch);
+      UnpackWasmException(decoder, block->exception, values);
+    }
+  }
+
+  // TODO(14108): Optimize in case of unreachable catch block?
+  void Delegate(FullDecoder* decoder, uint32_t depth, Control* block) {
+    EnterBlock(decoder, block->false_or_loop_or_catch_block, nullptr,
+               &block->exception);
+    if (depth == decoder->control_depth() - 1) {
+      // We just throw to the caller, no need to handle the exception in this
+      // frame.
+      CallBuiltinFromRuntimeStub(decoder, WasmCode::kWasmRethrow,
+                                 {block->exception});
+      asm_.Unreachable();
+    } else {
+      DCHECK(decoder->control_at(depth)->is_try());
+      TSBlock* target_catch =
+          decoder->control_at(depth)->false_or_loop_or_catch_block;
+      SetupControlFlowEdge(decoder, target_catch, 0, block->exception);
+      asm_.Goto(target_catch);
+    }
+  }
+
+  void CatchAll(FullDecoder* decoder, Control* block) {
+    DCHECK(block->is_try_catchall() || block->is_try_catch());
+    DCHECK_EQ(decoder->control_at(0), block);
+    EnterBlock(decoder, block->false_or_loop_or_catch_block, nullptr,
+               &block->exception);
+  }
+
+  V<BigInt> BuildChangeInt64ToBigInt(V<Word64> input) {
+    V<WordPtr> builtin =
+        Is64() ? asm_.RelocatableConstant(WasmCode::kI64ToBigInt,
+                                          RelocInfo::WASM_STUB_CALL)
+               : asm_.RelocatableConstant(WasmCode::kI32PairToBigInt,
+                                          RelocInfo::WASM_STUB_CALL);
+    CallInterfaceDescriptor interface_descriptor =
+        Is64()
+            ? Builtins::CallInterfaceDescriptorFor(Builtin::kI64ToBigInt)
+            : Builtins::CallInterfaceDescriptorFor(Builtin::kI32PairToBigInt);
+    const CallDescriptor* call_descriptor =
+        compiler::Linkage::GetStubCallDescriptor(
+            asm_.graph_zone(),  // zone
+            interface_descriptor,
+            0,                                  // stack parameter count
+            CallDescriptor::kNoFlags,           // flags
+            compiler::Operator::kNoProperties,  // properties
+            StubCallMode::kCallWasmRuntimeStub);
+    const TSCallDescriptor* ts_call_descriptor = TSCallDescriptor::Create(
+        call_descriptor, compiler::CanThrow::kNo, asm_.graph_zone());
+    if (Is64()) {
+      return asm_.Call(builtin, {input}, ts_call_descriptor);
+    }
+    V<Word32> low_word = asm_.TruncateWord64ToWord32(input);
+    V<Word32> high_word = asm_.TruncateWord64ToWord32(asm_.ShiftRightLogical(
+        input, asm_.Word32Constant(32), WordRepresentation::Word64()));
+    return asm_.Call(builtin, {low_word, high_word}, ts_call_descriptor);
+  }
+
+  void AtomicNotify(FullDecoder* decoder, const MemoryAccessImmediate& imm,
+                    OpIndex index, OpIndex value, Value* result) {
+    V<WordPtr> converted_index;
+    compiler::BoundsCheckResult bounds_check_result;
+    std::tie(converted_index, bounds_check_result) = CheckBoundsAndAlignment(
+        imm.memory, MemoryRepresentation::Int32(), index, imm.offset,
+        decoder->position(), compiler::EnforceBoundsCheck::kNeedsBoundsCheck);
+
+    OpIndex effective_offset = asm_.WordPtrAdd(converted_index, imm.offset);
+
+    result->op = CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmAtomicNotify,
+        {asm_.Word32Constant(imm.memory->index), effective_offset, value});
+  }
+
+  void AtomicWait(FullDecoder* decoder, WasmOpcode opcode,
+                  const MemoryAccessImmediate& imm, OpIndex index,
+                  OpIndex expected, V<Word64> timeout, Value* result) {
+    V<WordPtr> converted_index;
+    compiler::BoundsCheckResult bounds_check_result;
+    std::tie(converted_index, bounds_check_result) = CheckBoundsAndAlignment(
+        imm.memory,
+        opcode == kExprI32AtomicWait ? MemoryRepresentation::Int32()
+                                     : MemoryRepresentation::Int64(),
+        index, imm.offset, decoder->position(),
+        compiler::EnforceBoundsCheck::kNeedsBoundsCheck);
+
+    OpIndex effective_offset = asm_.WordPtrAdd(converted_index, imm.offset);
+    V<BigInt> bigint_timeout = BuildChangeInt64ToBigInt(timeout);
+
+    if (opcode == kExprI32AtomicWait) {
+      result->op = CallBuiltinFromRuntimeStub(
+          decoder, WasmCode::kWasmI32AtomicWait,
+          {asm_.Word32Constant(imm.memory->index), effective_offset, expected,
+           bigint_timeout});
+      return;
+    }
+    DCHECK_EQ(opcode, kExprI64AtomicWait);
+    V<BigInt> bigint_expected = BuildChangeInt64ToBigInt(expected);
+    result->op = CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmI64AtomicWait,
+        {asm_.Word32Constant(imm.memory->index), effective_offset,
+         bigint_expected, bigint_timeout});
+  }
+
+  void AtomicOp(FullDecoder* decoder, WasmOpcode opcode, const Value args[],
+                const size_t argc, const MemoryAccessImmediate& imm,
+                Value* result) {
+    if (opcode == WasmOpcode::kExprAtomicNotify) {
+      return AtomicNotify(decoder, imm, args[0].op, args[1].op, result);
+    }
+    if (opcode == WasmOpcode::kExprI32AtomicWait ||
+        opcode == WasmOpcode::kExprI64AtomicWait) {
+      return AtomicWait(decoder, opcode, imm, args[0].op, args[1].op,
+                        args[2].op, result);
+    }
+    using Binop = compiler::turboshaft::AtomicRMWOp::BinOp;
+    enum OpType { kBinop, kLoad, kStore };
+    struct AtomicOpInfo {
+      OpType op_type;
+      // Initialize with a default value, to allow constexpr constructors.
+      Binop bin_op = Binop::kAdd;
+      RegisterRepresentation result_rep;
+      MemoryRepresentation input_rep;
+
+      constexpr AtomicOpInfo(Binop bin_op, RegisterRepresentation result_rep,
+                             MemoryRepresentation input_rep)
+          : op_type(kBinop),
+            bin_op(bin_op),
+            result_rep(result_rep),
+            input_rep(input_rep) {}
+
+      constexpr AtomicOpInfo(OpType op_type, RegisterRepresentation result_rep,
+                             MemoryRepresentation input_rep)
+          : op_type(op_type), result_rep(result_rep), input_rep(input_rep) {}
+
+      static constexpr AtomicOpInfo Get(wasm::WasmOpcode opcode) {
+        switch (opcode) {
+#define CASE_BINOP(OPCODE, BINOP, RESULT, INPUT)                           \
+  case WasmOpcode::kExpr##OPCODE:                                          \
+    return AtomicOpInfo(Binop::k##BINOP, RegisterRepresentation::RESULT(), \
+                        MemoryRepresentation::INPUT());
+#define RMW_OPERATION(V)                                          \
+  V(I32AtomicAdd, Add, Word32, Uint32)                            \
+  V(I32AtomicAdd8U, Add, Word32, Uint8)                           \
+  V(I32AtomicAdd16U, Add, Word32, Uint16)                         \
+  V(I32AtomicSub, Sub, Word32, Uint32)                            \
+  V(I32AtomicSub8U, Sub, Word32, Uint8)                           \
+  V(I32AtomicSub16U, Sub, Word32, Uint16)                         \
+  V(I32AtomicAnd, And, Word32, Uint32)                            \
+  V(I32AtomicAnd8U, And, Word32, Uint8)                           \
+  V(I32AtomicAnd16U, And, Word32, Uint16)                         \
+  V(I32AtomicOr, Or, Word32, Uint32)                              \
+  V(I32AtomicOr8U, Or, Word32, Uint8)                             \
+  V(I32AtomicOr16U, Or, Word32, Uint16)                           \
+  V(I32AtomicXor, Xor, Word32, Uint32)                            \
+  V(I32AtomicXor8U, Xor, Word32, Uint8)                           \
+  V(I32AtomicXor16U, Xor, Word32, Uint16)                         \
+  V(I32AtomicExchange, Exchange, Word32, Uint32)                  \
+  V(I32AtomicExchange8U, Exchange, Word32, Uint8)                 \
+  V(I32AtomicExchange16U, Exchange, Word32, Uint16)               \
+  V(I32AtomicCompareExchange, CompareExchange, Word32, Uint32)    \
+  V(I32AtomicCompareExchange8U, CompareExchange, Word32, Uint8)   \
+  V(I32AtomicCompareExchange16U, CompareExchange, Word32, Uint16) \
+  V(I64AtomicAdd, Add, Word64, Uint64)                            \
+  V(I64AtomicAdd8U, Add, Word64, Uint8)                           \
+  V(I64AtomicAdd16U, Add, Word64, Uint16)                         \
+  V(I64AtomicAdd32U, Add, Word64, Uint32)                         \
+  V(I64AtomicSub, Sub, Word64, Uint64)                            \
+  V(I64AtomicSub8U, Sub, Word64, Uint8)                           \
+  V(I64AtomicSub16U, Sub, Word64, Uint16)                         \
+  V(I64AtomicSub32U, Sub, Word64, Uint32)                         \
+  V(I64AtomicAnd, And, Word64, Uint64)                            \
+  V(I64AtomicAnd8U, And, Word64, Uint8)                           \
+  V(I64AtomicAnd16U, And, Word64, Uint16)                         \
+  V(I64AtomicAnd32U, And, Word64, Uint32)                         \
+  V(I64AtomicOr, Or, Word64, Uint64)                              \
+  V(I64AtomicOr8U, Or, Word64, Uint8)                             \
+  V(I64AtomicOr16U, Or, Word64, Uint16)                           \
+  V(I64AtomicOr32U, Or, Word64, Uint32)                           \
+  V(I64AtomicXor, Xor, Word64, Uint64)                            \
+  V(I64AtomicXor8U, Xor, Word64, Uint8)                           \
+  V(I64AtomicXor16U, Xor, Word64, Uint16)                         \
+  V(I64AtomicXor32U, Xor, Word64, Uint32)                         \
+  V(I64AtomicExchange, Exchange, Word64, Uint64)                  \
+  V(I64AtomicExchange8U, Exchange, Word64, Uint8)                 \
+  V(I64AtomicExchange16U, Exchange, Word64, Uint16)               \
+  V(I64AtomicExchange32U, Exchange, Word64, Uint32)               \
+  V(I64AtomicCompareExchange, CompareExchange, Word64, Uint64)    \
+  V(I64AtomicCompareExchange8U, CompareExchange, Word64, Uint8)   \
+  V(I64AtomicCompareExchange16U, CompareExchange, Word64, Uint16) \
+  V(I64AtomicCompareExchange32U, CompareExchange, Word64, Uint32)
+
+          RMW_OPERATION(CASE_BINOP)
+#undef RMW_OPERATION
+#undef CASE
+#define CASE_LOAD(OPCODE, RESULT, INPUT)                         \
+  case WasmOpcode::kExpr##OPCODE:                                \
+    return AtomicOpInfo(kLoad, RegisterRepresentation::RESULT(), \
+                        MemoryRepresentation::INPUT());
+#define LOAD_OPERATION(V)             \
+  V(I32AtomicLoad, Word32, Uint32)    \
+  V(I32AtomicLoad16U, Word32, Uint16) \
+  V(I32AtomicLoad8U, Word32, Uint8)   \
+  V(I64AtomicLoad, Word64, Uint64)    \
+  V(I64AtomicLoad32U, Word64, Uint32) \
+  V(I64AtomicLoad16U, Word64, Uint16) \
+  V(I64AtomicLoad8U, Word64, Uint8)
+          LOAD_OPERATION(CASE_LOAD)
+#undef LOAD_OPERATION
+#undef CASE_LOAD
+#define CASE_STORE(OPCODE, INPUT, OUTPUT)                        \
+  case WasmOpcode::kExpr##OPCODE:                                \
+    return AtomicOpInfo(kStore, RegisterRepresentation::INPUT(), \
+                        MemoryRepresentation::OUTPUT());
+#define STORE_OPERATION(V)             \
+  V(I32AtomicStore, Word32, Uint32)    \
+  V(I32AtomicStore16U, Word32, Uint16) \
+  V(I32AtomicStore8U, Word32, Uint8)   \
+  V(I64AtomicStore, Word64, Uint64)    \
+  V(I64AtomicStore32U, Word64, Uint32) \
+  V(I64AtomicStore16U, Word64, Uint16) \
+  V(I64AtomicStore8U, Word64, Uint8)
+          STORE_OPERATION(CASE_STORE)
+#undef STORE_OPERATION_OPERATION
+#undef CASE_STORE
+          default:
+            UNREACHABLE();
+        }
+      }
+    };
+
+    AtomicOpInfo info = AtomicOpInfo::Get(opcode);
+
+    V<WordPtr> index;
+    compiler::BoundsCheckResult bounds_check_result;
+    std::tie(index, bounds_check_result) = CheckBoundsAndAlignment(
+        imm.memory, info.input_rep, args[0].op, imm.offset, decoder->position(),
+        compiler::EnforceBoundsCheck::kCanOmitBoundsCheck);
+    // MemoryAccessKind::kUnaligned is impossible due to explicit aligment
+    // check.
+    MemoryAccessKind access_kind =
+        bounds_check_result == compiler::BoundsCheckResult::kTrapHandler
+            ? MemoryAccessKind::kProtected
+            : MemoryAccessKind::kNormal;
+
+    if (info.op_type == kBinop) {
+      if (info.bin_op == Binop::kCompareExchange) {
+        result->op = asm_.AtomicCompareExchange(
+            MemBuffer(imm.memory->index, imm.offset), index, args[1].op,
+            args[2].op, info.result_rep, info.input_rep, access_kind);
+        return;
+      }
+      result->op = asm_.AtomicRMW(MemBuffer(imm.memory->index, imm.offset),
+                                  index, args[1].op, info.bin_op,
+                                  info.result_rep, info.input_rep, access_kind);
+      return;
+    }
+    if (info.op_type == kStore) {
+      OpIndex value = args[1].op;
+      if (info.result_rep == RegisterRepresentation::Word64() &&
+          info.input_rep != MemoryRepresentation::Uint64()) {
+        value = asm_.TruncateWord64ToWord32(value);
+      }
+      asm_.Store(MemBuffer(imm.memory->index, imm.offset), index, value,
+                 access_kind == MemoryAccessKind::kProtected
+                     ? LoadOp::Kind::Protected().Atomic()
+                     : LoadOp::Kind::RawAligned().Atomic(),
+                 info.input_rep, compiler::kNoWriteBarrier);
+      return;
+    }
+    DCHECK_EQ(info.op_type, kLoad);
+    result->op = asm_.Load(MemBuffer(imm.memory->index, imm.offset), index,
+                           access_kind == MemoryAccessKind::kProtected
+                               ? LoadOp::Kind::Protected().Atomic()
+                               : LoadOp::Kind::RawAligned().Atomic(),
+                           info.input_rep, info.result_rep);
+  }
+
+  void AtomicFence(FullDecoder* decoder) { Bailout(decoder); }
+
+  void MemoryInit(FullDecoder* decoder, const MemoryInitImmediate& imm,
+                  const Value& dst, const Value& src, const Value& size) {
+    V<WordPtr> dst_uintptr =
+        MemoryIndexToUintPtrOrOOBTrap(imm.memory.memory->is_memory64, dst.op);
+    DCHECK_EQ(size.type, kWasmI32);
+    V<Word32> result = CallCStackSlotToInt32(
+        ExternalReference::wasm_memory_init(),
+        {{asm_.BitcastTaggedToWord(instance_node_),
+          MemoryRepresentation::PointerSized()},
+         {asm_.Word32Constant(imm.memory.index), MemoryRepresentation::Int32()},
+         {dst_uintptr, MemoryRepresentation::PointerSized()},
+         {src.op, MemoryRepresentation::Int32()},
+         {asm_.Word32Constant(imm.data_segment.index),
+          MemoryRepresentation::Int32()},
+         {size.op, MemoryRepresentation::Int32()}});
+    asm_.TrapIfNot(result, OpIndex::Invalid(), TrapId::kTrapMemOutOfBounds);
+  }
+
+  void MemoryCopy(FullDecoder* decoder, const MemoryCopyImmediate& imm,
+                  const Value& dst, const Value& src, const Value& size) {
+    bool is_memory_64 = imm.memory_src.memory->is_memory64;
+    DCHECK_EQ(is_memory_64, imm.memory_dst.memory->is_memory64);
+    V<WordPtr> dst_uintptr =
+        MemoryIndexToUintPtrOrOOBTrap(is_memory_64, dst.op);
+    V<WordPtr> src_uintptr =
+        MemoryIndexToUintPtrOrOOBTrap(is_memory_64, src.op);
+    V<WordPtr> size_uintptr =
+        MemoryIndexToUintPtrOrOOBTrap(is_memory_64, size.op);
+    V<Word32> result = CallCStackSlotToInt32(
+        ExternalReference::wasm_memory_copy(),
+        {{asm_.BitcastTaggedToWord(instance_node_),
+          MemoryRepresentation::PointerSized()},
+         {asm_.Word32Constant(imm.memory_dst.index),
+          MemoryRepresentation::Int32()},
+         {asm_.Word32Constant(imm.memory_src.index),
+          MemoryRepresentation::Int32()},
+         {dst_uintptr, MemoryRepresentation::PointerSized()},
+         {src_uintptr, MemoryRepresentation::PointerSized()},
+         {size_uintptr, MemoryRepresentation::PointerSized()}});
+    asm_.TrapIfNot(result, OpIndex::Invalid(), TrapId::kTrapMemOutOfBounds);
+  }
+
+  void MemoryFill(FullDecoder* decoder, const MemoryIndexImmediate& imm,
+                  const Value& dst, const Value& value, const Value& size) {
+    bool is_memory_64 = imm.memory->is_memory64;
+    V<WordPtr> dst_uintptr =
+        MemoryIndexToUintPtrOrOOBTrap(is_memory_64, dst.op);
+    V<WordPtr> size_uintptr =
+        MemoryIndexToUintPtrOrOOBTrap(is_memory_64, size.op);
+    V<Word32> result = CallCStackSlotToInt32(
+        ExternalReference::wasm_memory_fill(),
+        {{asm_.BitcastTaggedToWord(instance_node_),
+          MemoryRepresentation::PointerSized()},
+         {asm_.Word32Constant(imm.index), MemoryRepresentation::Int32()},
+         {dst_uintptr, MemoryRepresentation::PointerSized()},
+         {value.op, MemoryRepresentation::Int32()},
+         {size_uintptr, MemoryRepresentation::PointerSized()}});
+
+    asm_.TrapIfNot(result, OpIndex::Invalid(), TrapId::kTrapMemOutOfBounds);
+  }
+
+  void DataDrop(FullDecoder* decoder, const IndexImmediate& imm) {
+    V<FixedUInt32Array> data_segment_sizes = LOAD_INSTANCE_FIELD(
+        DataSegmentSizes, MemoryRepresentation::TaggedPointer());
+    asm_.Store(data_segment_sizes, asm_.Word32Constant(0),
+               StoreOp::Kind::TaggedBase(), MemoryRepresentation::Int32(),
+               compiler::kNoWriteBarrier,
+               FixedUInt32Array::kHeaderSize + imm.index * kUInt32Size);
+  }
+
+  void TableGet(FullDecoder* decoder, const Value& index, Value* result,
+                const IndexImmediate& imm) {
+    ValueType table_type = decoder->module_->tables[imm.index].type;
+    auto stub = IsSubtypeOf(table_type, kWasmFuncRef, decoder->module_)
+                    ? WasmCode::kWasmTableGetFuncRef
+                    : WasmCode::kWasmTableGet;
+    result->op = CallBuiltinFromRuntimeStub(
+        decoder, stub, {asm_.IntPtrConstant(imm.index), index.op});
+  }
+
+  void TableSet(FullDecoder* decoder, const Value& index, const Value& value,
+                const IndexImmediate& imm) {
+    ValueType table_type = decoder->module_->tables[imm.index].type;
+    auto stub = IsSubtypeOf(table_type, kWasmFuncRef, decoder->module_)
+                    ? WasmCode::kWasmTableSetFuncRef
+                    : WasmCode::kWasmTableSet;
+    CallBuiltinFromRuntimeStub(
+        decoder, stub, {asm_.IntPtrConstant(imm.index), index.op, value.op});
+  }
+
+  void TableInit(FullDecoder* decoder, const TableInitImmediate& imm,
+                 const Value* args) {
+    V<Word32> dst = args[0].op;
+    V<Word32> src = args[1].op;
+    V<Word32> size = args[2].op;
+    CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmTableInit,
+        {dst, src, size, asm_.NumberConstant(imm.table.index),
+         asm_.NumberConstant(imm.element_segment.index)});
+  }
+
+  void TableCopy(FullDecoder* decoder, const TableCopyImmediate& imm,
+                 const Value args[]) {
+    V<Word32> dst = args[0].op;
+    V<Word32> src = args[1].op;
+    V<Word32> size = args[2].op;
+    CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmTableCopy,
+        {dst, src, size, asm_.NumberConstant(imm.table_dst.index),
+         asm_.NumberConstant(imm.table_src.index)});
+  }
+
+  void TableGrow(FullDecoder* decoder, const IndexImmediate& imm,
+                 const Value& value, const Value& delta, Value* result) {
+    V<Smi> result_smi = CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmTableGrow,
+        {asm_.NumberConstant(imm.index), delta.op, value.op});
+    result->op = asm_.UntagSmi(result_smi);
+  }
+
+  void TableFill(FullDecoder* decoder, const IndexImmediate& imm,
+                 const Value& start, const Value& value, const Value& count) {
+    CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmTableFill,
+        {asm_.NumberConstant(imm.index), start.op, count.op, value.op});
+  }
+
+  void TableSize(FullDecoder* decoder, const IndexImmediate& imm,
+                 Value* result) {
+    V<FixedArray> tables =
+        LOAD_INSTANCE_FIELD(Tables, MemoryRepresentation::TaggedPointer());
+    auto table =
+        V<WasmTableObject>::Cast(LoadFixedArrayElement(tables, imm.index));
+    V<Smi> size_smi = asm_.Load(table, LoadOp::Kind::TaggedBase(),
+                                MemoryRepresentation::TaggedSigned(),
+                                WasmTableObject::kCurrentLengthOffset);
+    result->op = asm_.UntagSmi(size_smi);
+  }
+
+  void ElemDrop(FullDecoder* decoder, const IndexImmediate& imm) {
+    V<FixedArray> elem_segments = LOAD_INSTANCE_FIELD(
+        ElementSegments, MemoryRepresentation::TaggedPointer());
+    StoreFixedArrayElement(elem_segments, imm.index, LOAD_ROOT(EmptyFixedArray),
+                           compiler::kFullWriteBarrier);
+  }
+
+  void StructNew(FullDecoder* decoder, const StructIndexImmediate& imm,
+                 const Value args[], Value* result) {
+    Bailout(decoder);
+  }
+  void StructNewDefault(FullDecoder* decoder, const StructIndexImmediate& imm,
+                        Value* result) {
+    Bailout(decoder);
+  }
+
+  void StructGet(FullDecoder* decoder, const Value& struct_object,
+                 const FieldImmediate& field, bool is_signed, Value* result) {
+    result->op = asm_.StructGet(struct_object.op, field.struct_imm.struct_type,
+                                field.field_imm.index, is_signed,
+                                struct_object.type.is_nullable()
+                                    ? compiler::kWithNullCheck
+                                    : compiler::kWithoutNullCheck);
+  }
+
+  void StructSet(FullDecoder* decoder, const Value& struct_object,
+                 const FieldImmediate& field, const Value& field_value) {
+    asm_.StructSet(struct_object.op, field_value.op,
+                   field.struct_imm.struct_type, field.field_imm.index,
+                   struct_object.type.is_nullable()
+                       ? compiler::kWithNullCheck
+                       : compiler::kWithoutNullCheck);
+  }
+
+  void ArrayNew(FullDecoder* decoder, const ArrayIndexImmediate& imm,
+                const Value& length, const Value& initial_value,
+                Value* result) {
+    Bailout(decoder);
+  }
+
+  void ArrayNewDefault(FullDecoder* decoder, const ArrayIndexImmediate& imm,
+                       const Value& length, Value* result) {
+    Bailout(decoder);
+  }
+
+  void ArrayGet(FullDecoder* decoder, const Value& array_obj,
+                const ArrayIndexImmediate& imm, const Value& index,
+                bool is_signed, Value* result) {
+    BoundsCheckArray(array_obj.op, index.op, array_obj.type);
+    result->op = asm_.ArrayGet(array_obj.op, index.op,
+                               imm.array_type->element_type(), is_signed);
+  }
+
+  void ArraySet(FullDecoder* decoder, const Value& array_obj,
+                const ArrayIndexImmediate& imm, const Value& index,
+                const Value& value) {
+    BoundsCheckArray(array_obj.op, index.op, array_obj.type);
+    asm_.ArraySet(array_obj.op, index.op, value.op,
+                  imm.array_type->element_type());
+  }
+
+  void ArrayLen(FullDecoder* decoder, const Value& array_obj, Value* result) {
+    result->op =
+        asm_.ArrayLength(array_obj.op, array_obj.type.is_nullable()
+                                           ? compiler::kWithNullCheck
+                                           : compiler::kWithoutNullCheck);
+  }
+
+  void ArrayCopy(FullDecoder* decoder, const Value& dst, const Value& dst_index,
+                 const Value& src, const Value& src_index,
+                 const ArrayIndexImmediate& src_imm, const Value& length) {
+    BoundsCheckArrayWithLength(dst.op, dst_index.op, length.op,
+                               dst.type.is_nullable()
+                                   ? compiler::kWithNullCheck
+                                   : compiler::kWithoutNullCheck);
+    BoundsCheckArrayWithLength(src.op, src_index.op, length.op,
+                               src.type.is_nullable()
+                                   ? compiler::kWithNullCheck
+                                   : compiler::kWithoutNullCheck);
+
+    ValueType element_type = src_imm.array_type->element_type();
+
+    Label<> end(&asm_);
+    Label<> builtin(&asm_);
+    Label<> reverse(&asm_);
+
+    GOTO_IF(asm_.Word32Equal(length.op, 0), end);
+
+    // Values determined by test/mjsunit/wasm/array-copy-benchmark.js on x64.
+    int array_copy_max_loop_length;
+    switch (element_type.kind()) {
+      case wasm::kI32:
+      case wasm::kI64:
+      case wasm::kI8:
+      case wasm::kI16:
+        array_copy_max_loop_length = 20;
+        break;
+      case wasm::kF32:
+      case wasm::kF64:
+        array_copy_max_loop_length = 35;
+        break;
+      case wasm::kS128:
+        array_copy_max_loop_length = 100;
+        break;
+      case wasm::kRtt:
+      case wasm::kRef:
+      case wasm::kRefNull:
+        array_copy_max_loop_length = 15;
+        break;
+      case wasm::kVoid:
+      case wasm::kBottom:
+        UNREACHABLE();
+    }
+
+    GOTO_IF(asm_.Uint32LessThan(array_copy_max_loop_length, length.op),
+            builtin);
+    V<Word32> src_end_index =
+        asm_.Word32Sub(asm_.Word32Add(src_index.op, length.op), 1);
+    GOTO_IF(asm_.Uint32LessThan(src_index.op, dst_index.op), reverse);
+
+    {
+      LoopLabel<Word32, Word32> loop_label(&asm_);
+      GOTO(loop_label, src_index.op, dst_index.op);
+      LOOP(loop_label, src_index_loop, dst_index_loop) {
+        OpIndex value =
+            asm_.ArrayGet(src.op, src_index_loop, element_type, true);
+        asm_.ArraySet(dst.op, dst_index_loop, value, element_type);
+
+        V<Word32> condition =
+            asm_.Uint32LessThan(src_index_loop, src_end_index);
+        IF (condition) {
+          GOTO(loop_label, asm_.Word32Add(src_index_loop, 1),
+               asm_.Word32Add(dst_index_loop, 1));
+        }
+        END_IF
+
+        GOTO(end);
+      }
+    }
+
+    {
+      BIND(reverse);
+      V<Word32> dst_end_index =
+          asm_.Word32Sub(asm_.Word32Add(dst_index.op, length.op), 1);
+      LoopLabel<Word32, Word32> loop_label(&asm_);
+      GOTO(loop_label, src_end_index, dst_end_index);
+      LOOP(loop_label, src_index_loop, dst_index_loop) {
+        OpIndex value =
+            asm_.ArrayGet(src.op, src_index_loop, element_type, true);
+        asm_.ArraySet(dst.op, dst_index_loop, value, element_type);
+
+        V<Word32> condition = asm_.Uint32LessThan(src_index.op, src_index_loop);
+        IF (condition) {
+          GOTO(loop_label, asm_.Word32Sub(src_index_loop, 1),
+               asm_.Word32Sub(dst_index_loop, 1));
+        }
+        END_IF
+
+        GOTO(end);
+      }
+    }
+
+    {
+      BIND(builtin);
+      MachineType arg_types[]{
+          MachineType::TaggedPointer(), MachineType::TaggedPointer(),
+          MachineType::Uint32(),        MachineType::TaggedPointer(),
+          MachineType::Uint32(),        MachineType::Uint32()};
+      MachineSignature sig(0, 6, arg_types);
+
+      CallC(&sig, ExternalReference::wasm_array_copy(),
+            {instance_node_, dst.op, dst_index.op, src.op, src_index.op,
+             length.op});
+      GOTO(end);
+    }
+
+    BIND(end);
+  }
+
+  void ArrayFill(FullDecoder* decoder, ArrayIndexImmediate& imm,
+                 const Value& array, const Value& index, const Value& value,
+                 const Value& length) {
+    Bailout(decoder);
+  }
+
+  void ArrayNewFixed(FullDecoder* decoder, const ArrayIndexImmediate& array_imm,
+                     const IndexImmediate& length_imm, const Value elements[],
+                     Value* result) {
+    Bailout(decoder);
+  }
+
+  void ArrayNewSegment(FullDecoder* decoder,
+                       const ArrayIndexImmediate& array_imm,
+                       const IndexImmediate& segment_imm, const Value& offset,
+                       const Value& length, Value* result) {
+    bool is_element = array_imm.array_type->element_type().is_reference();
+    result->op = CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmArrayNewSegment,
+        {asm_.Word32Constant(segment_imm.index), offset.op, length.op,
+         asm_.SmiConstant(Smi::FromInt(is_element ? 1 : 0)),
+         asm_.RttCanon(instance_node_, array_imm.index)});
+  }
+
+  void ArrayInitSegment(FullDecoder* decoder,
+                        const ArrayIndexImmediate& array_imm,
+                        const IndexImmediate& segment_imm, const Value& array,
+                        const Value& array_index, const Value& segment_offset,
+                        const Value& length) {
+    bool is_element = array_imm.array_type->element_type().is_reference();
+    CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmArrayInitSegment,
+        {array_index.op, segment_offset.op, length.op,
+         asm_.SmiConstant(Smi::FromInt(segment_imm.index)),
+         asm_.SmiConstant(Smi::FromInt(is_element ? 1 : 0)), array.op});
+  }
+
+  void I31New(FullDecoder* decoder, const Value& input, Value* result) {
+    if constexpr (SmiValuesAre31Bits()) {
+      V<Word32> shifted =
+          asm_.Word32ShiftLeft(input.op, kSmiTagSize + kSmiShiftSize);
+      if (Is64()) {
+        // The uppermost bits don't matter.
+        result->op = asm_.BitcastWord32ToWord64(shifted);
+      } else {
+        result->op = shifted;
+      }
+    } else {
+      // Set the topmost bit to sign-extend the second bit. This way,
+      // interpretation in JS (if this value escapes there) will be the same as
+      // i31.get_s.
+      V<WordPtr> input_wordptr = asm_.ChangeUint32ToUintPtr(input.op);
+      result->op = asm_.WordPtrShiftRightArithmetic(
+          asm_.WordPtrShiftLeft(input_wordptr, kSmiShiftSize + kSmiTagSize + 1),
+          1);
+    }
+  }
+
+  void I31GetS(FullDecoder* decoder, const Value& input, Value* result) {
+    V<Tagged> input_non_null =
+        input.type.is_nullable()
+            ? asm_.AssertNotNull(input.op, kWasmI31Ref,
+                                 TrapId::kTrapNullDereference)
+            : input.op;
+    if constexpr (SmiValuesAre31Bits()) {
+      result->op = asm_.Word32ShiftRightArithmeticShiftOutZeros(
+          asm_.TruncateWordPtrToWord32(
+              asm_.BitcastTaggedToWord(input_non_null)),
+          kSmiTagSize + kSmiShiftSize);
+    } else {
+      // Topmost bit is already sign-extended.
+      result->op = asm_.TruncateWordPtrToWord32(
+          asm_.WordPtrShiftRightArithmeticShiftOutZeros(
+              asm_.BitcastTaggedToWord(input_non_null),
+              kSmiTagSize + kSmiShiftSize));
+    }
+  }
+
+  void I31GetU(FullDecoder* decoder, const Value& input, Value* result) {
+    V<Tagged> input_non_null =
+        input.type.is_nullable()
+            ? asm_.AssertNotNull(input.op, kWasmI31Ref,
+                                 TrapId::kTrapNullDereference)
+            : input.op;
+    if constexpr (SmiValuesAre31Bits()) {
+      result->op = asm_.Word32ShiftRightLogical(
+          asm_.TruncateWordPtrToWord32(
+              asm_.BitcastTaggedToWord(input_non_null)),
+          kSmiTagSize + kSmiShiftSize);
+    } else {
+      // Topmost bit is sign-extended, remove it.
+      result->op = asm_.TruncateWordPtrToWord32(asm_.WordPtrShiftRightLogical(
+          asm_.WordPtrShiftLeft(asm_.BitcastTaggedToWord(input_non_null), 1),
+          kSmiTagSize + kSmiShiftSize + 1));
+    }
+  }
+
+  void RefTest(FullDecoder* decoder, uint32_t ref_index, const Value& object,
+               Value* result, bool null_succeeds) {
+    V<Map> rtt = asm_.RttCanon(instance_node_, ref_index);
+    compiler::WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         ref_index, null_succeeds ? kNullable : kNonNullable)};
+    result->op = asm_.WasmTypeCheck(object.op, rtt, config);
+  }
+
+  void RefTestAbstract(FullDecoder* decoder, const Value& object, HeapType type,
+                       Value* result, bool null_succeeds) {
+    compiler::WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         type, null_succeeds ? kNullable : kNonNullable)};
+    V<Map> rtt = OpIndex::Invalid();
+    result->op = asm_.WasmTypeCheck(object.op, rtt, config);
+  }
+
+  void RefCast(FullDecoder* decoder, uint32_t ref_index, const Value& object,
+               Value* result, bool null_succeeds) {
+    if (v8_flags.experimental_wasm_assume_ref_cast_succeeds) {
+      // TODO(14108): Implement type guards.
+      Forward(decoder, object, result);
+      return;
+    }
+    V<Map> rtt = asm_.RttCanon(instance_node_, ref_index);
+    DCHECK_EQ(result->type.is_nullable(), null_succeeds);
+    compiler::WasmTypeCheckConfig config{object.type, result->type};
+    result->op = asm_.WasmTypeCast(object.op, rtt, config);
+  }
+
+  void RefCastAbstract(FullDecoder* decoder, const Value& object, HeapType type,
+                       Value* result, bool null_succeeds) {
+    if (v8_flags.experimental_wasm_assume_ref_cast_succeeds) {
+      // TODO(14108): Implement type guards.
+      Forward(decoder, object, result);
+      return;
+    }
+    // TODO(jkummerow): {type} is redundant.
+    DCHECK_IMPLIES(null_succeeds, result->type.is_nullable());
+    DCHECK_EQ(type, result->type.heap_type());
+    compiler::WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         type, null_succeeds ? kNullable : kNonNullable)};
+    V<Map> rtt = OpIndex::Invalid();
+    result->op = asm_.WasmTypeCast(object.op, rtt, config);
+  }
+
+  void BrOnCast(FullDecoder* decoder, uint32_t ref_index, const Value& object,
+                Value* value_on_branch, uint32_t br_depth, bool null_succeeds) {
+    V<Map> rtt = asm_.RttCanon(instance_node_, ref_index);
+    compiler::WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         ref_index, null_succeeds ? kNullable : kNonNullable)};
+    return BrOnCastImpl(decoder, rtt, config, object, value_on_branch, br_depth,
+                        null_succeeds);
+  }
+
+  void BrOnCastAbstract(FullDecoder* decoder, const Value& object,
+                        HeapType type, Value* value_on_branch,
+                        uint32_t br_depth, bool null_succeeds) {
+    V<Map> rtt = OpIndex::Invalid();
+    compiler::WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         type, null_succeeds ? kNullable : kNonNullable)};
+    return BrOnCastImpl(decoder, rtt, config, object, value_on_branch, br_depth,
+                        null_succeeds);
+  }
+
+  void BrOnCastFail(FullDecoder* decoder, uint32_t ref_index,
+                    const Value& object, Value* value_on_fallthrough,
+                    uint32_t br_depth, bool null_succeeds) {
+    V<Map> rtt = asm_.RttCanon(instance_node_, ref_index);
+    compiler::WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         ref_index, null_succeeds ? kNullable : kNonNullable)};
+    return BrOnCastFailImpl(decoder, rtt, config, object, value_on_fallthrough,
+                            br_depth, null_succeeds);
+  }
+
+  void BrOnCastFailAbstract(FullDecoder* decoder, const Value& object,
+                            HeapType type, Value* value_on_fallthrough,
+                            uint32_t br_depth, bool null_succeeds) {
+    V<Map> rtt = OpIndex::Invalid();
+    compiler::WasmTypeCheckConfig config{
+        object.type, ValueType::RefMaybeNull(
+                         type, null_succeeds ? kNullable : kNonNullable)};
+    return BrOnCastFailImpl(decoder, rtt, config, object, value_on_fallthrough,
+                            br_depth, null_succeeds);
+  }
+
+  void RefIsStruct(FullDecoder* decoder, const Value& object, Value* result) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void RefAsStruct(FullDecoder* decoder, const Value& object, Value* result) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void BrOnStruct(FullDecoder* decoder, const Value& object,
+                  Value* value_on_branch, uint32_t br_depth,
+                  bool null_succeeds) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void BrOnNonStruct(FullDecoder* decoder, const Value& object,
+                     Value* value_on_fallthrough, uint32_t br_depth,
+                     bool null_succeeds) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void RefIsArray(FullDecoder* decoder, const Value& object, Value* result) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void RefAsArray(FullDecoder* decoder, const Value& object, Value* result) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void BrOnArray(FullDecoder* decoder, const Value& object,
+                 Value* value_on_branch, uint32_t br_depth,
+                 bool null_succeeds) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void BrOnNonArray(FullDecoder* decoder, const Value& object,
+                    Value* value_on_fallthrough, uint32_t br_depth,
+                    bool null_succeeds) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void RefIsI31(FullDecoder* decoder, const Value& object, Value* result) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void RefAsI31(FullDecoder* decoder, const Value& object, Value* result) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void BrOnI31(FullDecoder* decoder, const Value& object,
+               Value* value_on_branch, uint32_t br_depth, bool null_succeeds) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void BrOnNonI31(FullDecoder* decoder, const Value& object,
+                  Value* value_on_fallthrough, uint32_t br_depth,
+                  bool null_succeeds) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void BrOnString(FullDecoder* decoder, const Value& object,
+                  Value* value_on_branch, uint32_t br_depth,
+                  bool null_succeeds) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void BrOnNonString(FullDecoder* decoder, const Value& object,
+                     Value* value_on_fallthrough, uint32_t br_depth,
+                     bool null_succeeds) {
+    Bailout(decoder);  // Deprecated: Do not implement!
+  }
+
+  void StringNewWtf8(FullDecoder* decoder, const MemoryIndexImmediate& memory,
+                     const unibrow::Utf8Variant variant, const Value& offset,
+                     const Value& size, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringNewWtf8Array(FullDecoder* decoder,
+                          const unibrow::Utf8Variant variant,
+                          const Value& array, const Value& start,
+                          const Value& end, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringNewWtf16(FullDecoder* decoder, const MemoryIndexImmediate& imm,
+                      const Value& offset, const Value& size, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringNewWtf16Array(FullDecoder* decoder, const Value& array,
+                           const Value& start, const Value& end,
+                           Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringConst(FullDecoder* decoder, const StringConstImmediate& imm,
+                   Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringMeasureWtf8(FullDecoder* decoder,
+                         const unibrow::Utf8Variant variant, const Value& str,
+                         Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringMeasureWtf16(FullDecoder* decoder, const Value& str,
+                          Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringEncodeWtf8(FullDecoder* decoder,
+                        const MemoryIndexImmediate& memory,
+                        const unibrow::Utf8Variant variant, const Value& str,
+                        const Value& offset, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringEncodeWtf8Array(FullDecoder* decoder,
+                             const unibrow::Utf8Variant variant,
+                             const Value& str, const Value& array,
+                             const Value& start, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringEncodeWtf16(FullDecoder* decoder, const MemoryIndexImmediate& imm,
+                         const Value& str, const Value& offset, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringEncodeWtf16Array(FullDecoder* decoder, const Value& str,
+                              const Value& array, const Value& start,
+                              Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringConcat(FullDecoder* decoder, const Value& head, const Value& tail,
+                    Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringEq(FullDecoder* decoder, const Value& a, const Value& b,
+                Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringIsUSVSequence(FullDecoder* decoder, const Value& str,
+                           Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringAsWtf8(FullDecoder* decoder, const Value& str, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewWtf8Advance(FullDecoder* decoder, const Value& view,
+                             const Value& pos, const Value& bytes,
+                             Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewWtf8Encode(FullDecoder* decoder,
+                            const MemoryIndexImmediate& memory,
+                            const unibrow::Utf8Variant variant,
+                            const Value& view, const Value& addr,
+                            const Value& pos, const Value& bytes,
+                            Value* next_pos, Value* bytes_written) {
+    Bailout(decoder);
+  }
+
+  void StringViewWtf8Slice(FullDecoder* decoder, const Value& view,
+                           const Value& start, const Value& end,
+                           Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringAsWtf16(FullDecoder* decoder, const Value& str, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewWtf16GetCodeUnit(FullDecoder* decoder, const Value& view,
+                                  const Value& pos, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewWtf16Encode(FullDecoder* decoder,
+                             const MemoryIndexImmediate& imm, const Value& view,
+                             const Value& offset, const Value& pos,
+                             const Value& codeunits, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewWtf16Slice(FullDecoder* decoder, const Value& view,
+                            const Value& start, const Value& end,
+                            Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringAsIter(FullDecoder* decoder, const Value& str, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewIterNext(FullDecoder* decoder, const Value& view,
+                          Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewIterAdvance(FullDecoder* decoder, const Value& view,
+                             const Value& codepoints, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewIterRewind(FullDecoder* decoder, const Value& view,
+                            const Value& codepoints, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringViewIterSlice(FullDecoder* decoder, const Value& view,
+                           const Value& codepoints, Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringCompare(FullDecoder* decoder, const Value& lhs, const Value& rhs,
+                     Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringFromCodePoint(FullDecoder* decoder, const Value& code_point,
+                           Value* result) {
+    Bailout(decoder);
+  }
+
+  void StringHash(FullDecoder* decoder, const Value& string, Value* result) {
+    Bailout(decoder);
+  }
+
+  void Forward(FullDecoder* decoder, const Value& from, Value* to) {
+    to->op = from.op;
+  }
+
+  bool did_bailout() { return did_bailout_; }
+
+ private:
+  // Holds phi inputs for a specific block. These include SSA values as well as
+  // stack merge values.
+  struct BlockPhis {
+    // The first vector corresponds to all inputs of the first phi etc.
+    std::vector<std::vector<OpIndex>> phi_inputs;
+    std::vector<ValueType> phi_types;
+    std::vector<OpIndex> incoming_exception;
+
+    explicit BlockPhis(int total_arity)
+        : phi_inputs(total_arity), phi_types(total_arity) {}
+  };
+
+  enum class CheckForException { kNo, kYes };
+
+  void Bailout(FullDecoder* decoder) {
+    decoder->errorf("Unsupported Turboshaft operation: %s",
+                    decoder->SafeOpcodeNameAt(decoder->pc()));
+    did_bailout_ = true;
+  }
+
+  void BailoutWithoutOpcode(FullDecoder* decoder, const char* message) {
+    decoder->errorf("Unsupported operation: %s", message);
+    did_bailout_ = true;
+  }
+
+  // Creates a new block, initializes a {BlockPhis} for it, and registers it
+  // with block_phis_. We pass a {merge} only if we later need to recover values
+  // for that merge.
+  TSBlock* NewBlock(FullDecoder* decoder, Merge<Value>* merge) {
+    TSBlock* block = asm_.NewBlock();
+    BlockPhis block_phis(decoder->num_locals() +
+                         (merge != nullptr ? merge->arity : 0));
+    for (uint32_t i = 0; i < decoder->num_locals(); i++) {
+      block_phis.phi_types[i] = decoder->local_type(i);
+    }
+    if (merge != nullptr) {
+      for (uint32_t i = 0; i < merge->arity; i++) {
+        block_phis.phi_types[decoder->num_locals() + i] = (*merge)[i].type;
+      }
+    }
+    block_phis_.emplace(block, std::move(block_phis));
+    return block;
+  }
+
+  // Sets up a control flow edge from the current SSA environment and a stack to
+  // {block}. The stack is {stack_values} if present, otherwise the current
+  // decoder stack.
+  void SetupControlFlowEdge(FullDecoder* decoder, TSBlock* block,
+                            uint32_t drop_values = 0,
+                            V<Tagged> exception = OpIndex::Invalid(),
+                            Merge<Value>* stack_values = nullptr) {
+    if (asm_.current_block() == nullptr) return;
+    // It is guaranteed that this element exists.
+    BlockPhis& phis_for_block = block_phis_.find(block)->second;
+    uint32_t merge_arity =
+        static_cast<uint32_t>(phis_for_block.phi_inputs.size()) -
+        decoder->num_locals();
+    for (size_t i = 0; i < ssa_env_.size(); i++) {
+      phis_for_block.phi_inputs[i].emplace_back(ssa_env_[i]);
+    }
+    // We never drop values from an explicit merge.
+    DCHECK_IMPLIES(stack_values != nullptr, drop_values == 0);
+    Value* stack_base = merge_arity == 0 ? nullptr
+                        : stack_values != nullptr
+                            ? &(*stack_values)[0]
+                            : decoder->stack_value(merge_arity + drop_values);
+    for (size_t i = 0; i < merge_arity; i++) {
+      DCHECK(stack_base[i].op.valid());
+      phis_for_block.phi_inputs[decoder->num_locals() + i].emplace_back(
+          stack_base[i].op);
+    }
+    if (exception.valid()) {
+      phis_for_block.incoming_exception.push_back(exception);
+    }
+  }
+
+  OpIndex MaybePhi(std::vector<OpIndex>& elements, ValueType type) {
+    if (elements.empty()) return OpIndex::Invalid();
+    for (size_t i = 1; i < elements.size(); i++) {
+      if (elements[i] != elements[0]) {
+        return asm_.Phi(base::VectorOf(elements), RepresentationFor(type));
+      }
+    }
+    return elements[0];
+  }
+
+  // Binds a block, initializes phis for its SSA environment from its entry in
+  // {block_phis_}, and sets values to its {merge} (if available) from the
+  // its entry in {block_phis_}.
+  void EnterBlock(FullDecoder* decoder, TSBlock* tsblock, Merge<Value>* merge,
+                  OpIndex* exception = nullptr) {
+    asm_.Bind(tsblock);
+    BlockPhis& block_phis = block_phis_.at(tsblock);
+    for (uint32_t i = 0; i < decoder->num_locals(); i++) {
+      ssa_env_[i] = MaybePhi(block_phis.phi_inputs[i], block_phis.phi_types[i]);
+    }
+    DCHECK_EQ(decoder->num_locals() + (merge != nullptr ? merge->arity : 0),
+              block_phis.phi_inputs.size());
+    if (merge != nullptr) {
+      for (uint32_t i = 0; i < merge->arity; i++) {
+        (*merge)[i].op =
+            MaybePhi(block_phis.phi_inputs[decoder->num_locals() + i],
+                     block_phis.phi_types[decoder->num_locals() + i]);
+      }
+    }
+    DCHECK_IMPLIES(exception == nullptr, block_phis.incoming_exception.empty());
+    if (exception != nullptr && !exception->valid()) {
+      *exception = MaybePhi(block_phis.incoming_exception, kWasmExternRef);
+    }
+    block_phis_.erase(tsblock);
+  }
+
+  OpIndex DefaultValue(ValueType type) {
+    switch (type.kind()) {
+      case kI8:
+      case kI16:
+      case kI32:
+        return asm_.Word32Constant(int32_t{0});
+      case kI64:
+        return asm_.Word64Constant(int64_t{0});
+      case kF32:
+        return asm_.Float32Constant(0.0f);
+      case kF64:
+        return asm_.Float64Constant(0.0);
+      case kRefNull:
+        return asm_.Null(type);
+      case kS128: {
+        uint8_t value[kSimd128Size] = {};
+        return asm_.Simd128Constant(value);
+      }
+      case kVoid:
+      case kRtt:
+      case kRef:
+      case kBottom:
+        UNREACHABLE();
+    }
+  }
+
+  RegisterRepresentation RepresentationFor(ValueType type) {
+    switch (type.kind()) {
+      case kI8:
+      case kI16:
+      case kI32:
+        return RegisterRepresentation::Word32();
+      case kI64:
+        return RegisterRepresentation::Word64();
+      case kF32:
+        return RegisterRepresentation::Float32();
+      case kF64:
+        return RegisterRepresentation::Float64();
+      case kRefNull:
+      case kRef:
+        return RegisterRepresentation::Tagged();
+      case kS128:
+        return RegisterRepresentation::Simd128();
+      case kVoid:
+      case kRtt:
+      case kBottom:
+        UNREACHABLE();
+    }
+  }
+
+  V<Word64> ExtractTruncationProjections(OpIndex truncated) {
+    V<Word64> result =
+        asm_.Projection(truncated, 0, RegisterRepresentation::Word64());
+    V<Word32> check =
+        asm_.Projection(truncated, 1, RegisterRepresentation::Word32());
+    asm_.TrapIf(asm_.Word32Equal(check, 0), OpIndex::Invalid(),
+                TrapId::kTrapFloatUnrepresentable);
+    return result;
+  }
+
+  std::pair<OpIndex, V<Word32>> BuildCCallForFloatConversion(
+      OpIndex arg, MemoryRepresentation float_type,
+      ExternalReference ccall_ref) {
+    uint8_t slot_size = MemoryRepresentation::Int64().SizeInBytes();
+    V<WordPtr> stack_slot = __ StackSlot(slot_size, slot_size);
+    __ Store(stack_slot, arg, StoreOp::Kind::RawAligned(), float_type,
+             compiler::WriteBarrierKind::kNoWriteBarrier);
+    MachineType reps[]{MachineType::Int32(), MachineType::Pointer()};
+    MachineSignature sig(1, 1, reps);
+    V<Word32> overflow = CallC(&sig, ccall_ref, stack_slot);
+    return {stack_slot, overflow};
+  }
+
+  OpIndex BuildCcallConvertFloat(OpIndex arg, MemoryRepresentation float_type,
+                                 ExternalReference ccall_ref) {
+    auto [stack_slot, overflow] =
+        BuildCCallForFloatConversion(arg, float_type, ccall_ref);
+    __ TrapIf(__ Word32Equal(overflow, 0), OpIndex::Invalid(),
+              compiler::TrapId::kTrapFloatUnrepresentable);
+    MemoryRepresentation int64 = MemoryRepresentation::Int64();
+    return __ Load(stack_slot, LoadOp::Kind::RawAligned(), int64);
+  }
+
+  OpIndex BuildCcallConvertFloatSat(OpIndex arg,
+                                    MemoryRepresentation float_type,
+                                    ExternalReference ccall_ref,
+                                    bool is_signed) {
+    MemoryRepresentation int64 = MemoryRepresentation::Int64();
+    uint8_t slot_size = int64.SizeInBytes();
+    V<WordPtr> stack_slot = __ StackSlot(slot_size, slot_size);
+    __ Store(stack_slot, arg, StoreOp::Kind::RawAligned(), float_type,
+             compiler::WriteBarrierKind::kNoWriteBarrier);
+    MachineType reps[]{MachineType::Pointer()};
+    MachineSignature sig(0, 1, reps);
+    CallC(&sig, ccall_ref, stack_slot);
+    return __ Load(stack_slot, LoadOp::Kind::RawAligned(), int64);
+  }
+
+  OpIndex BuildIntToFloatConversionInstruction(
+      OpIndex input, ExternalReference ccall_ref,
+      MemoryRepresentation input_representation,
+      MemoryRepresentation result_representation) {
+    uint8_t slot_size = std::max(input_representation.SizeInBytes(),
+                                 result_representation.SizeInBytes());
+    V<WordPtr> stack_slot = __ StackSlot(slot_size, slot_size);
+    __ Store(stack_slot, input, StoreOp::Kind::RawAligned(),
+             input_representation, compiler::WriteBarrierKind::kNoWriteBarrier);
+    MachineType reps[]{MachineType::Pointer()};
+    MachineSignature sig(0, 1, reps);
+    CallC(&sig, ccall_ref, stack_slot);
+    return __ Load(stack_slot, LoadOp::Kind::RawAligned(),
+                   result_representation);
+  }
+
+  OpIndex BuildDiv64Call(OpIndex lhs, OpIndex rhs, ExternalReference ccall_ref,
+                         wasm::TrapId trap_zero) {
+    MemoryRepresentation int64_rep = MemoryRepresentation::Int64();
+    V<WordPtr> stack_slot =
+        asm_.StackSlot(2 * int64_rep.SizeInBytes(), int64_rep.SizeInBytes());
+    asm_.Store(stack_slot, lhs, StoreOp::Kind::RawAligned(), int64_rep,
+               compiler::WriteBarrierKind::kNoWriteBarrier);
+    asm_.Store(stack_slot, rhs, StoreOp::Kind::RawAligned(), int64_rep,
+               compiler::WriteBarrierKind::kNoWriteBarrier,
+               int64_rep.SizeInBytes());
+
+    MachineType sig_types[] = {MachineType::Int32(), MachineType::Pointer()};
+    MachineSignature sig(1, 1, sig_types);
+    OpIndex rc = CallC(&sig, ccall_ref, stack_slot);
+    __ TrapIf(__ Word32Equal(rc, 0), OpIndex::Invalid(), trap_zero);
+    __ TrapIf(__ Word32Equal(rc, -1), OpIndex::Invalid(),
+              TrapId::kTrapDivUnrepresentable);
+    return __ Load(stack_slot, LoadOp::Kind::RawAligned(), int64_rep);
+  }
+
+  // TODO(14108): Remove the decoder argument once we have no bailouts.
+  OpIndex UnOpImpl(FullDecoder* decoder, WasmOpcode opcode, OpIndex arg,
+                   ValueType input_type /* for ref.is_null only*/) {
+    switch (opcode) {
+      case kExprI32Eqz:
+        return asm_.Word32Equal(arg, 0);
+      case kExprF32Abs:
+        return asm_.Float32Abs(arg);
+      case kExprF32Neg:
+        return asm_.Float32Negate(arg);
+      case kExprF32Sqrt:
+        return asm_.Float32Sqrt(arg);
+      case kExprF64Abs:
+        return asm_.Float64Abs(arg);
+      case kExprF64Neg:
+        return asm_.Float64Negate(arg);
+      case kExprF64Sqrt:
+        return asm_.Float64Sqrt(arg);
+      case kExprI32SConvertF32: {
+        V<Float32> truncated = UnOpImpl(decoder, kExprF32Trunc, arg, kWasmF32);
+        V<Word32> result = asm_.TruncateFloat32ToInt32OverflowToMin(truncated);
+        V<Float32> converted_back = asm_.ChangeInt32ToFloat32(result);
+        asm_.TrapIf(
+            asm_.Word32Equal(asm_.Float32Equal(converted_back, truncated), 0),
+            OpIndex::Invalid(), TrapId::kTrapFloatUnrepresentable);
+        return result;
+      }
+      case kExprI32UConvertF32: {
+        V<Float32> truncated = UnOpImpl(decoder, kExprF32Trunc, arg, kWasmF32);
+        V<Word32> result = asm_.TruncateFloat32ToUint32OverflowToMin(truncated);
+        V<Float32> converted_back = asm_.ChangeUint32ToFloat32(result);
+        asm_.TrapIf(
+            asm_.Word32Equal(asm_.Float32Equal(converted_back, truncated), 0),
+            OpIndex::Invalid(), TrapId::kTrapFloatUnrepresentable);
+        return result;
+      }
+      case kExprI32SConvertF64: {
+        V<Float64> truncated = UnOpImpl(decoder, kExprF64Trunc, arg, kWasmF64);
+        V<Word32> result =
+            asm_.TruncateFloat64ToInt32OverflowUndefined(truncated);
+        V<Float64> converted_back = asm_.ChangeInt32ToFloat64(result);
+        asm_.TrapIf(
+            asm_.Word32Equal(asm_.Float64Equal(converted_back, truncated), 0),
+            OpIndex::Invalid(), TrapId::kTrapFloatUnrepresentable);
+        return result;
+      }
+      case kExprI32UConvertF64: {
+        V<Float64> truncated = UnOpImpl(decoder, kExprF64Trunc, arg, kWasmF64);
+        V<Word32> result = asm_.TruncateFloat64ToUint32OverflowToMin(truncated);
+        V<Float64> converted_back = asm_.ChangeUint32ToFloat64(result);
+        asm_.TrapIf(
+            asm_.Word32Equal(asm_.Float64Equal(converted_back, truncated), 0),
+            OpIndex::Invalid(), TrapId::kTrapFloatUnrepresentable);
+        return result;
+      }
+      case kExprI64SConvertF32:
+        return Is64() ? ExtractTruncationProjections(
+                            asm_.TryTruncateFloat32ToInt64(arg))
+                      : BuildCcallConvertFloat(
+                            arg, MemoryRepresentation::Float32(),
+                            ExternalReference::wasm_float32_to_int64());
+      case kExprI64UConvertF32:
+        return Is64() ? ExtractTruncationProjections(
+                            asm_.TryTruncateFloat32ToUint64(arg))
+                      : BuildCcallConvertFloat(
+                            arg, MemoryRepresentation::Float32(),
+                            ExternalReference::wasm_float32_to_uint64());
+      case kExprI64SConvertF64:
+        return Is64() ? ExtractTruncationProjections(
+                            asm_.TryTruncateFloat64ToInt64(arg))
+                      : BuildCcallConvertFloat(
+                            arg, MemoryRepresentation::Float64(),
+                            ExternalReference::wasm_float64_to_int64());
+      case kExprI64UConvertF64:
+        return Is64() ? ExtractTruncationProjections(
+                            asm_.TryTruncateFloat64ToUint64(arg))
+                      : BuildCcallConvertFloat(
+                            arg, MemoryRepresentation::Float64(),
+                            ExternalReference::wasm_float64_to_uint64());
+      case kExprF64SConvertI32:
+        return asm_.ChangeInt32ToFloat64(arg);
+      case kExprF64UConvertI32:
+        return asm_.ChangeUint32ToFloat64(arg);
+      case kExprF32SConvertI32:
+        return asm_.ChangeInt32ToFloat32(arg);
+      case kExprF32UConvertI32:
+        return asm_.ChangeUint32ToFloat32(arg);
+      case kExprI32SConvertSatF32: {
+        V<Float32> truncated = UnOpImpl(decoder, kExprF32Trunc, arg, kWasmF32);
+        V<Word32> converted =
+            asm_.TruncateFloat32ToInt32OverflowUndefined(truncated);
+        V<Float32> converted_back = asm_.ChangeInt32ToFloat32(converted);
+
+        Label<Word32> done(&asm_);
+
+        IF (LIKELY(asm_.Float32Equal(truncated, converted_back))) {
+          GOTO(done, converted);
+        }
+        ELSE {
+          // Overflow.
+          IF (asm_.Float32Equal(arg, arg)) {
+            // Not NaN.
+            IF (asm_.Float32LessThan(arg, 0)) {
+              // Negative arg.
+              GOTO(done,
+                   asm_.Word32Constant(std::numeric_limits<int32_t>::min()));
+            }
+            ELSE {
+              // Positive arg.
+              GOTO(done,
+                   asm_.Word32Constant(std::numeric_limits<int32_t>::max()));
+            }
+            END_IF
+          }
+          ELSE {
+            // NaN.
+            GOTO(done, asm_.Word32Constant(0));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+
+        return result;
+      }
+      case kExprI32UConvertSatF32: {
+        V<Float32> truncated = UnOpImpl(decoder, kExprF32Trunc, arg, kWasmF32);
+        V<Word32> converted =
+            asm_.TruncateFloat32ToUint32OverflowUndefined(truncated);
+        V<Float32> converted_back = asm_.ChangeUint32ToFloat32(converted);
+
+        Label<Word32> done(&asm_);
+
+        IF (LIKELY(asm_.Float32Equal(truncated, converted_back))) {
+          GOTO(done, converted);
+        }
+        ELSE {
+          // Overflow.
+          IF (asm_.Float32Equal(arg, arg)) {
+            // Not NaN.
+            IF (asm_.Float32LessThan(arg, 0)) {
+              // Negative arg.
+              GOTO(done, asm_.Word32Constant(0));
+            }
+            ELSE {
+              // Positive arg.
+              GOTO(done,
+                   asm_.Word32Constant(std::numeric_limits<uint32_t>::max()));
+            }
+            END_IF
+          }
+          ELSE {
+            // NaN.
+            GOTO(done, asm_.Word32Constant(0));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+
+        return result;
+      }
+      case kExprI32SConvertSatF64: {
+        V<Float64> truncated = UnOpImpl(decoder, kExprF64Trunc, arg, kWasmF64);
+        V<Word32> converted =
+            asm_.TruncateFloat64ToInt32OverflowUndefined(truncated);
+        V<Float64> converted_back = asm_.ChangeInt32ToFloat64(converted);
+
+        Label<Word32> done(&asm_);
+
+        IF (LIKELY(asm_.Float64Equal(truncated, converted_back))) {
+          GOTO(done, converted);
+        }
+        ELSE {
+          // Overflow.
+          IF (asm_.Float64Equal(arg, arg)) {
+            // Not NaN.
+            IF (asm_.Float64LessThan(arg, 0)) {
+              // Negative arg.
+              GOTO(done,
+                   asm_.Word32Constant(std::numeric_limits<int32_t>::min()));
+            }
+            ELSE {
+              // Positive arg.
+              GOTO(done,
+                   asm_.Word32Constant(std::numeric_limits<int32_t>::max()));
+            }
+            END_IF
+          }
+          ELSE {
+            // NaN.
+            GOTO(done, asm_.Word32Constant(0));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+
+        return result;
+      }
+      case kExprI32UConvertSatF64: {
+        V<Float64> truncated = UnOpImpl(decoder, kExprF64Trunc, arg, kWasmF64);
+        V<Word32> converted =
+            asm_.TruncateFloat64ToUint32OverflowUndefined(truncated);
+        V<Float64> converted_back = asm_.ChangeUint32ToFloat64(converted);
+
+        Label<Word32> done(&asm_);
+
+        IF (LIKELY(asm_.Float64Equal(truncated, converted_back))) {
+          GOTO(done, converted);
+        }
+        ELSE {
+          // Overflow.
+          IF (asm_.Float64Equal(arg, arg)) {
+            // Not NaN.
+            IF (asm_.Float64LessThan(arg, 0)) {
+              // Negative arg.
+              GOTO(done, asm_.Word32Constant(0));
+            }
+            ELSE {
+              // Positive arg.
+              GOTO(done,
+                   asm_.Word32Constant(std::numeric_limits<uint32_t>::max()));
+            }
+            END_IF
+          }
+          ELSE {
+            // NaN.
+            GOTO(done, asm_.Word32Constant(0));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+
+        return result;
+      }
+      case kExprI64SConvertSatF32: {
+        if (!Is64()) {
+          bool is_signed = true;
+          return BuildCcallConvertFloatSat(
+              arg, MemoryRepresentation::Float32(),
+              ExternalReference::wasm_float32_to_int64_sat(), is_signed);
+        }
+        V<Word64> converted = asm_.TryTruncateFloat32ToInt64(arg);
+        Label<compiler::turboshaft::Word64> done(&asm_);
+
+        if (SupportedOperations::sat_conversion_is_safe()) {
+          return asm_.Projection(converted, 0,
+                                 RegisterRepresentation::Word64());
+        }
+        IF (LIKELY(asm_.Projection(converted, 1,
+                                   RegisterRepresentation::Word32()))) {
+          GOTO(done,
+               asm_.Projection(converted, 0, RegisterRepresentation::Word64()));
+        }
+        ELSE {
+          // Overflow.
+          IF (asm_.Float32Equal(arg, arg)) {
+            // Not NaN.
+            IF (asm_.Float32LessThan(arg, 0)) {
+              // Negative arg.
+              GOTO(done,
+                   asm_.Word64Constant(std::numeric_limits<int64_t>::min()));
+            }
+            ELSE {
+              // Positive arg.
+              GOTO(done,
+                   asm_.Word64Constant(std::numeric_limits<int64_t>::max()));
+            }
+            END_IF
+          }
+          ELSE {
+            // NaN.
+            GOTO(done, asm_.Word64Constant(int64_t{0}));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+
+        return result;
+      }
+      case kExprI64UConvertSatF32: {
+        if (!Is64()) {
+          bool is_signed = false;
+          return BuildCcallConvertFloatSat(
+              arg, MemoryRepresentation::Float32(),
+              ExternalReference::wasm_float32_to_uint64_sat(), is_signed);
+        }
+        V<Word64> converted = asm_.TryTruncateFloat32ToUint64(arg);
+        Label<compiler::turboshaft::Word64> done(&asm_);
+
+        if (SupportedOperations::sat_conversion_is_safe()) {
+          return asm_.Projection(converted, 0,
+                                 RegisterRepresentation::Word64());
+        }
+
+        IF (LIKELY(asm_.Projection(converted, 1,
+                                   RegisterRepresentation::Word32()))) {
+          GOTO(done,
+               asm_.Projection(converted, 0, RegisterRepresentation::Word64()));
+        }
+        ELSE {
+          // Overflow.
+          IF (asm_.Float32Equal(arg, arg)) {
+            // Not NaN.
+            IF (asm_.Float32LessThan(arg, 0)) {
+              // Negative arg.
+              GOTO(done, asm_.Word64Constant(int64_t{0}));
+            }
+            ELSE {
+              // Positive arg.
+              GOTO(done,
+                   asm_.Word64Constant(std::numeric_limits<uint64_t>::max()));
+            }
+            END_IF
+          }
+          ELSE {
+            // NaN.
+            GOTO(done, asm_.Word64Constant(int64_t{0}));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+
+        return result;
+      }
+      case kExprI64SConvertSatF64: {
+        if (!Is64()) {
+          bool is_signed = true;
+          return BuildCcallConvertFloatSat(
+              arg, MemoryRepresentation::Float64(),
+              ExternalReference::wasm_float64_to_int64_sat(), is_signed);
+        }
+        V<Word64> converted = asm_.TryTruncateFloat64ToInt64(arg);
+        Label<compiler::turboshaft::Word64> done(&asm_);
+
+        if (SupportedOperations::sat_conversion_is_safe()) {
+          return asm_.Projection(converted, 0,
+                                 RegisterRepresentation::Word64());
+        }
+
+        IF (LIKELY(asm_.Projection(converted, 1,
+                                   RegisterRepresentation::Word32()))) {
+          GOTO(done,
+               asm_.Projection(converted, 0, RegisterRepresentation::Word64()));
+        }
+        ELSE {
+          // Overflow.
+          IF (asm_.Float64Equal(arg, arg)) {
+            // Not NaN.
+            IF (asm_.Float64LessThan(arg, 0)) {
+              // Negative arg.
+              GOTO(done,
+                   asm_.Word64Constant(std::numeric_limits<int64_t>::min()));
+            }
+            ELSE {
+              // Positive arg.
+              GOTO(done,
+                   asm_.Word64Constant(std::numeric_limits<int64_t>::max()));
+            }
+            END_IF
+          }
+          ELSE {
+            // NaN.
+            GOTO(done, asm_.Word64Constant(int64_t{0}));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+
+        return result;
+      }
+      case kExprI64UConvertSatF64: {
+        if (!Is64()) {
+          bool is_signed = false;
+          return BuildCcallConvertFloatSat(
+              arg, MemoryRepresentation::Float64(),
+              ExternalReference::wasm_float64_to_uint64_sat(), is_signed);
+        }
+        V<Word64> converted = asm_.TryTruncateFloat64ToUint64(arg);
+        Label<compiler::turboshaft::Word64> done(&asm_);
+
+        if (SupportedOperations::sat_conversion_is_safe()) {
+          return asm_.Projection(converted, 0,
+                                 RegisterRepresentation::Word64());
+        }
+
+        IF (LIKELY(asm_.Projection(converted, 1,
+                                   RegisterRepresentation::Word32()))) {
+          GOTO(done,
+               asm_.Projection(converted, 0, RegisterRepresentation::Word64()));
+        }
+        ELSE {
+          // Overflow.
+          IF (asm_.Float64Equal(arg, arg)) {
+            // Not NaN.
+            IF (asm_.Float64LessThan(arg, 0)) {
+              // Negative arg.
+              GOTO(done, asm_.Word64Constant(int64_t{0}));
+            }
+            ELSE {
+              // Positive arg.
+              GOTO(done,
+                   asm_.Word64Constant(std::numeric_limits<uint64_t>::max()));
+            }
+            END_IF
+          }
+          ELSE {
+            // NaN.
+            GOTO(done, asm_.Word64Constant(int64_t{0}));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+
+        return result;
+      }
+      case kExprF32ConvertF64:
+        return asm_.ChangeFloat64ToFloat32(arg);
+      case kExprF64ConvertF32:
+        return asm_.ChangeFloat32ToFloat64(arg);
+      case kExprF32ReinterpretI32:
+        return asm_.BitcastWord32ToFloat32(arg);
+      case kExprI32ReinterpretF32:
+        return asm_.BitcastFloat32ToWord32(arg);
+      case kExprI32Clz:
+        return asm_.Word32CountLeadingZeros(arg);
+      case kExprI32Ctz:
+        if (SupportedOperations::word32_ctz()) {
+          return asm_.Word32CountTrailingZeros(arg);
+        } else {
+          // TODO(14108): Use reverse_bits if supported.
+          return CallCStackSlotToInt32(arg,
+                                       ExternalReference::wasm_word32_ctz(),
+                                       MemoryRepresentation::Int32());
+        }
+      case kExprI32Popcnt:
+        if (SupportedOperations::word32_popcnt()) {
+          return asm_.Word32PopCount(arg);
+        } else {
+          return CallCStackSlotToInt32(arg,
+                                       ExternalReference::wasm_word32_popcnt(),
+                                       MemoryRepresentation::Int32());
+        }
+      case kExprF32Floor:
+        if (SupportedOperations::float32_round_down()) {
+          return asm_.Float32RoundDown(arg);
+        } else {
+          return CallCStackSlotToStackSlot(arg,
+                                           ExternalReference::wasm_f32_floor(),
+                                           MemoryRepresentation::Float32());
+        }
+      case kExprF32Ceil:
+        if (SupportedOperations::float32_round_up()) {
+          return asm_.Float32RoundUp(arg);
+        } else {
+          return CallCStackSlotToStackSlot(arg,
+                                           ExternalReference::wasm_f32_ceil(),
+                                           MemoryRepresentation::Float32());
+        }
+      case kExprF32Trunc:
+        if (SupportedOperations::float32_round_to_zero()) {
+          return asm_.Float32RoundToZero(arg);
+        } else {
+          return CallCStackSlotToStackSlot(arg,
+                                           ExternalReference::wasm_f32_trunc(),
+                                           MemoryRepresentation::Float32());
+        }
+      case kExprF32NearestInt:
+        if (SupportedOperations::float32_round_ties_even()) {
+          return asm_.Float32RoundTiesEven(arg);
+        } else {
+          return CallCStackSlotToStackSlot(
+              arg, ExternalReference::wasm_f32_nearest_int(),
+              MemoryRepresentation::Float32());
+        }
+      case kExprF64Floor:
+        if (SupportedOperations::float64_round_down()) {
+          return asm_.Float64RoundDown(arg);
+        } else {
+          return CallCStackSlotToStackSlot(arg,
+                                           ExternalReference::wasm_f64_floor(),
+                                           MemoryRepresentation::Float64());
+        }
+      case kExprF64Ceil:
+        if (SupportedOperations::float64_round_up()) {
+          return asm_.Float64RoundUp(arg);
+        } else {
+          return CallCStackSlotToStackSlot(arg,
+                                           ExternalReference::wasm_f64_ceil(),
+                                           MemoryRepresentation::Float64());
+        }
+      case kExprF64Trunc:
+        if (SupportedOperations::float64_round_to_zero()) {
+          return asm_.Float64RoundToZero(arg);
+        } else {
+          return CallCStackSlotToStackSlot(arg,
+                                           ExternalReference::wasm_f64_trunc(),
+                                           MemoryRepresentation::Float64());
+        }
+      case kExprF64NearestInt:
+        if (SupportedOperations::float64_round_ties_even()) {
+          return asm_.Float64RoundTiesEven(arg);
+        } else {
+          return CallCStackSlotToStackSlot(
+              arg, ExternalReference::wasm_f64_nearest_int(),
+              MemoryRepresentation::Float64());
+        }
+      case kExprF64Acos:
+        return CallCStackSlotToStackSlot(
+            arg, ExternalReference::f64_acos_wrapper_function(),
+            MemoryRepresentation::Float64());
+      case kExprF64Asin:
+        return CallCStackSlotToStackSlot(
+            arg, ExternalReference::f64_asin_wrapper_function(),
+            MemoryRepresentation::Float64());
+      case kExprF64Atan:
+        return asm_.Float64Atan(arg);
+      case kExprF64Cos:
+        return asm_.Float64Cos(arg);
+      case kExprF64Sin:
+        return asm_.Float64Sin(arg);
+      case kExprF64Tan:
+        return asm_.Float64Tan(arg);
+      case kExprF64Exp:
+        return asm_.Float64Exp(arg);
+      case kExprF64Log:
+        return asm_.Float64Log(arg);
+      case kExprI32ConvertI64:
+        return asm_.TruncateWord64ToWord32(arg);
+      case kExprI64SConvertI32:
+        return asm_.ChangeInt32ToInt64(arg);
+      case kExprI64UConvertI32:
+        return asm_.ChangeUint32ToUint64(arg);
+      case kExprF64ReinterpretI64:
+        return asm_.BitcastWord64ToFloat64(arg);
+      case kExprI64ReinterpretF64:
+        return asm_.BitcastFloat64ToWord64(arg);
+      case kExprI64Clz:
+        return asm_.Word64CountLeadingZeros(arg);
+      case kExprI64Ctz:
+        if (SupportedOperations::word64_ctz() ||
+            (!Is64() && SupportedOperations::word32_ctz())) {
+          return asm_.Word64CountTrailingZeros(arg);
+        } else {
+          // TODO(14108): Use reverse_bits if supported.
+          return asm_.ChangeUint32ToUint64(
+              CallCStackSlotToInt32(arg, ExternalReference::wasm_word64_ctz(),
+                                    MemoryRepresentation::Int64()));
+        }
+      case kExprI64Popcnt:
+        if (SupportedOperations::word64_popcnt() ||
+            (!Is64() && SupportedOperations::word32_popcnt())) {
+          return asm_.Word64PopCount(arg);
+        } else {
+          return asm_.ChangeUint32ToUint64(CallCStackSlotToInt32(
+              arg, ExternalReference::wasm_word64_popcnt(),
+              MemoryRepresentation::Int64()));
+        }
+      case kExprI64Eqz:
+        return asm_.Word64Equal(arg, 0);
+      case kExprF32SConvertI64:
+        if (!Is64()) {
+          return BuildIntToFloatConversionInstruction(
+              arg, ExternalReference::wasm_int64_to_float32(),
+              MemoryRepresentation::Int64(), MemoryRepresentation::Float32());
+        }
+        return asm_.ChangeInt64ToFloat32(arg);
+      case kExprF32UConvertI64:
+        if (!Is64()) {
+          return BuildIntToFloatConversionInstruction(
+              arg, ExternalReference::wasm_uint64_to_float32(),
+              MemoryRepresentation::Uint64(), MemoryRepresentation::Float32());
+        }
+        return asm_.ChangeUint64ToFloat32(arg);
+      case kExprF64SConvertI64:
+        if (!Is64()) {
+          return BuildIntToFloatConversionInstruction(
+              arg, ExternalReference::wasm_int64_to_float64(),
+              MemoryRepresentation::Int64(), MemoryRepresentation::Float64());
+        }
+        return asm_.ChangeInt64ToFloat64(arg);
+      case kExprF64UConvertI64:
+        if (!Is64()) {
+          return BuildIntToFloatConversionInstruction(
+              arg, ExternalReference::wasm_uint64_to_float64(),
+              MemoryRepresentation::Uint64(), MemoryRepresentation::Float64());
+        }
+        return asm_.ChangeUint64ToFloat64(arg);
+      case kExprI32SExtendI8:
+        return asm_.Word32SignExtend8(arg);
+      case kExprI32SExtendI16:
+        return asm_.Word32SignExtend16(arg);
+      case kExprI64SExtendI8:
+        return asm_.Word64SignExtend8(arg);
+      case kExprI64SExtendI16:
+        return asm_.Word64SignExtend16(arg);
+      case kExprI64SExtendI32:
+        // TODO(14108): Is this correct?
+        return asm_.ChangeInt32ToInt64(asm_.TruncateWord64ToWord32(arg));
+      case kExprRefIsNull:
+        return asm_.IsNull(arg, input_type);
+      case kExprI32AsmjsLoadMem8S:
+        return AsmjsLoadMem(arg, MemoryRepresentation::Int8());
+      case kExprI32AsmjsLoadMem8U:
+        return AsmjsLoadMem(arg, MemoryRepresentation::Uint8());
+      case kExprI32AsmjsLoadMem16S:
+        return AsmjsLoadMem(arg, MemoryRepresentation::Int16());
+      case kExprI32AsmjsLoadMem16U:
+        return AsmjsLoadMem(arg, MemoryRepresentation::Uint16());
+      case kExprI32AsmjsLoadMem:
+        return AsmjsLoadMem(arg, MemoryRepresentation::Int32());
+      case kExprF32AsmjsLoadMem:
+        return AsmjsLoadMem(arg, MemoryRepresentation::Float32());
+      case kExprF64AsmjsLoadMem:
+        return AsmjsLoadMem(arg, MemoryRepresentation::Float64());
+      case kExprI32AsmjsSConvertF32:
+      case kExprI32AsmjsUConvertF32:
+        return asm_.JSTruncateFloat64ToWord32(asm_.ChangeFloat32ToFloat64(arg));
+      case kExprI32AsmjsSConvertF64:
+      case kExprI32AsmjsUConvertF64:
+        return asm_.JSTruncateFloat64ToWord32(arg);
+      case kExprRefAsNonNull:
+        // We abuse ref.as_non_null, which isn't otherwise used in this switch,
+        // as a sentinel for the negation of ref.is_null.
+        return asm_.Word32Equal(asm_.IsNull(arg, input_type), 0);
+      case kExprExternInternalize:
+      case kExprExternExternalize:
+        Bailout(decoder);
+        return OpIndex::Invalid();
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  // TODO(14108): Implement 64-bit divisions on 32-bit platforms.
+  OpIndex BinOpImpl(WasmOpcode opcode, OpIndex lhs, OpIndex rhs) {
+    switch (opcode) {
+      case kExprI32Add:
+        return asm_.Word32Add(lhs, rhs);
+      case kExprI32Sub:
+        return asm_.Word32Sub(lhs, rhs);
+      case kExprI32Mul:
+        return asm_.Word32Mul(lhs, rhs);
+      case kExprI32DivS: {
+        asm_.TrapIf(asm_.Word32Equal(rhs, 0), OpIndex::Invalid(),
+                    TrapId::kTrapDivByZero);
+        V<Word32> unrepresentable_condition = asm_.Word32BitwiseAnd(
+            asm_.Word32Equal(rhs, -1), asm_.Word32Equal(lhs, kMinInt));
+        asm_.TrapIf(unrepresentable_condition, OpIndex::Invalid(),
+                    TrapId::kTrapDivUnrepresentable);
+        return asm_.Int32Div(lhs, rhs);
+      }
+      case kExprI32DivU:
+        asm_.TrapIf(asm_.Word32Equal(rhs, 0), OpIndex::Invalid(),
+                    TrapId::kTrapDivByZero);
+        return asm_.Uint32Div(lhs, rhs);
+      case kExprI32RemS: {
+        asm_.TrapIf(asm_.Word32Equal(rhs, 0), OpIndex::Invalid(),
+                    TrapId::kTrapRemByZero);
+        Label<Word32> done(&asm_);
+        IF (UNLIKELY(asm_.Word32Equal(rhs, -1))) {
+          GOTO(done, asm_.Word32Constant(0));
+        }
+        ELSE {
+          GOTO(done, asm_.Int32Mod(lhs, rhs));
+        }
+        END_IF;
+
+        BIND(done, result);
+        return result;
+      }
+      case kExprI32RemU:
+        asm_.TrapIf(asm_.Word32Equal(rhs, 0), OpIndex::Invalid(),
+                    TrapId::kTrapRemByZero);
+        return asm_.Uint32Mod(lhs, rhs);
+      case kExprI32And:
+        return asm_.Word32BitwiseAnd(lhs, rhs);
+      case kExprI32Ior:
+        return asm_.Word32BitwiseOr(lhs, rhs);
+      case kExprI32Xor:
+        return asm_.Word32BitwiseXor(lhs, rhs);
+      case kExprI32Shl:
+        // If possible, the bitwise-and gets optimized away later.
+        return asm_.Word32ShiftLeft(lhs, asm_.Word32BitwiseAnd(rhs, 0x1f));
+      case kExprI32ShrS:
+        return asm_.Word32ShiftRightArithmetic(
+            lhs, asm_.Word32BitwiseAnd(rhs, 0x1f));
+      case kExprI32ShrU:
+        return asm_.Word32ShiftRightLogical(lhs,
+                                            asm_.Word32BitwiseAnd(rhs, 0x1f));
+      case kExprI32Ror:
+        return asm_.Word32RotateRight(lhs, asm_.Word32BitwiseAnd(rhs, 0x1f));
+      case kExprI32Rol:
+        if (SupportedOperations::word32_rol()) {
+          return asm_.Word32RotateLeft(lhs, asm_.Word32BitwiseAnd(rhs, 0x1f));
+        } else {
+          return asm_.Word32RotateRight(
+              lhs, asm_.Word32Sub(32, asm_.Word32BitwiseAnd(rhs, 0x1f)));
+        }
+      case kExprI32Eq:
+        return asm_.Word32Equal(lhs, rhs);
+      case kExprI32Ne:
+        return asm_.Word32Equal(asm_.Word32Equal(lhs, rhs), 0);
+      case kExprI32LtS:
+        return asm_.Int32LessThan(lhs, rhs);
+      case kExprI32LeS:
+        return asm_.Int32LessThanOrEqual(lhs, rhs);
+      case kExprI32LtU:
+        return asm_.Uint32LessThan(lhs, rhs);
+      case kExprI32LeU:
+        return asm_.Uint32LessThanOrEqual(lhs, rhs);
+      case kExprI32GtS:
+        return asm_.Int32LessThan(rhs, lhs);
+      case kExprI32GeS:
+        return asm_.Int32LessThanOrEqual(rhs, lhs);
+      case kExprI32GtU:
+        return asm_.Uint32LessThan(rhs, lhs);
+      case kExprI32GeU:
+        return asm_.Uint32LessThanOrEqual(rhs, lhs);
+      case kExprI64Add:
+        return asm_.Word64Add(lhs, rhs);
+      case kExprI64Sub:
+        return asm_.Word64Sub(lhs, rhs);
+      case kExprI64Mul:
+        return asm_.Word64Mul(lhs, rhs);
+      case kExprI64DivS: {
+        if (!Is64()) {
+          return BuildDiv64Call(lhs, rhs, ExternalReference::wasm_int64_div(),
+                                wasm::TrapId::kTrapDivByZero);
+        }
+        asm_.TrapIf(asm_.Word64Equal(rhs, 0), OpIndex::Invalid(),
+                    TrapId::kTrapDivByZero);
+        V<Word32> unrepresentable_condition = asm_.Word32BitwiseAnd(
+            asm_.Word64Equal(rhs, -1),
+            asm_.Word64Equal(lhs, std::numeric_limits<int64_t>::min()));
+        asm_.TrapIf(unrepresentable_condition, OpIndex::Invalid(),
+                    TrapId::kTrapDivUnrepresentable);
+        return asm_.Int64Div(lhs, rhs);
+      }
+      case kExprI64DivU:
+        if (!Is64()) {
+          return BuildDiv64Call(lhs, rhs, ExternalReference::wasm_uint64_div(),
+                                wasm::TrapId::kTrapDivByZero);
+        }
+        asm_.TrapIf(asm_.Word64Equal(rhs, 0), OpIndex::Invalid(),
+                    TrapId::kTrapDivByZero);
+        return asm_.Uint64Div(lhs, rhs);
+      case kExprI64RemS: {
+        if (!Is64()) {
+          return BuildDiv64Call(lhs, rhs, ExternalReference::wasm_int64_mod(),
+                                wasm::TrapId::kTrapRemByZero);
+        }
+        asm_.TrapIf(asm_.Word64Equal(rhs, 0), OpIndex::Invalid(),
+                    TrapId::kTrapRemByZero);
+        Label<Word64> done(&asm_);
+        IF (UNLIKELY(asm_.Word64Equal(rhs, -1))) {
+          GOTO(done, asm_.Word64Constant(int64_t{0}));
+        }
+        ELSE {
+          GOTO(done, asm_.Int64Mod(lhs, rhs));
+        }
+        END_IF;
+
+        BIND(done, result);
+        return result;
+      }
+      case kExprI64RemU:
+        if (!Is64()) {
+          return BuildDiv64Call(lhs, rhs, ExternalReference::wasm_uint64_mod(),
+                                wasm::TrapId::kTrapRemByZero);
+        }
+        asm_.TrapIf(asm_.Word64Equal(rhs, 0), OpIndex::Invalid(),
+                    TrapId::kTrapRemByZero);
+        return asm_.Uint64Mod(lhs, rhs);
+      case kExprI64And:
+        return asm_.Word64BitwiseAnd(lhs, rhs);
+      case kExprI64Ior:
+        return asm_.Word64BitwiseOr(lhs, rhs);
+      case kExprI64Xor:
+        return asm_.Word64BitwiseXor(lhs, rhs);
+      case kExprI64Shl:
+        // If possible, the bitwise-and gets optimized away later.
+        return asm_.Word64ShiftLeft(
+            lhs, asm_.Word32BitwiseAnd(asm_.TruncateWord64ToWord32(rhs), 0x3f));
+      case kExprI64ShrS:
+        return asm_.Word64ShiftRightArithmetic(
+            lhs, asm_.Word32BitwiseAnd(asm_.TruncateWord64ToWord32(rhs), 0x3f));
+      case kExprI64ShrU:
+        return asm_.Word64ShiftRightLogical(
+            lhs, asm_.Word32BitwiseAnd(asm_.TruncateWord64ToWord32(rhs), 0x3f));
+      case kExprI64Ror:
+        return asm_.Word64RotateRight(
+            lhs, asm_.Word32BitwiseAnd(asm_.TruncateWord64ToWord32(rhs), 0x3f));
+      case kExprI64Rol:
+        if (SupportedOperations::word64_rol()) {
+          return asm_.Word64RotateLeft(
+              lhs,
+              asm_.Word32BitwiseAnd(asm_.TruncateWord64ToWord32(rhs), 0x3f));
+        } else {
+          return asm_.Word64RotateRight(
+              lhs,
+              asm_.Word32BitwiseAnd(
+                  asm_.Word32Sub(64, asm_.TruncateWord64ToWord32(rhs)), 0x3f));
+        }
+      case kExprI64Eq:
+        return asm_.Word64Equal(lhs, rhs);
+      case kExprI64Ne:
+        return asm_.Word32Equal(asm_.Word64Equal(lhs, rhs), 0);
+      case kExprI64LtS:
+        return asm_.Int64LessThan(lhs, rhs);
+      case kExprI64LeS:
+        return asm_.Int64LessThanOrEqual(lhs, rhs);
+      case kExprI64LtU:
+        return asm_.Uint64LessThan(lhs, rhs);
+      case kExprI64LeU:
+        return asm_.Uint64LessThanOrEqual(lhs, rhs);
+      case kExprI64GtS:
+        return asm_.Int64LessThan(rhs, lhs);
+      case kExprI64GeS:
+        return asm_.Int64LessThanOrEqual(rhs, lhs);
+      case kExprI64GtU:
+        return asm_.Uint64LessThan(rhs, lhs);
+      case kExprI64GeU:
+        return asm_.Uint64LessThanOrEqual(rhs, lhs);
+      case kExprF32CopySign: {
+        V<Word32> lhs_without_sign =
+            asm_.Word32BitwiseAnd(asm_.BitcastFloat32ToWord32(lhs), 0x7fffffff);
+        V<Word32> rhs_sign =
+            asm_.Word32BitwiseAnd(asm_.BitcastFloat32ToWord32(rhs), 0x80000000);
+        return asm_.BitcastWord32ToFloat32(
+            asm_.Word32BitwiseOr(lhs_without_sign, rhs_sign));
+      }
+      case kExprF32Add:
+        return asm_.Float32Add(lhs, rhs);
+      case kExprF32Sub:
+        return asm_.Float32Sub(lhs, rhs);
+      case kExprF32Mul:
+        return asm_.Float32Mul(lhs, rhs);
+      case kExprF32Div:
+        return asm_.Float32Div(lhs, rhs);
+      case kExprF32Eq:
+        return asm_.Float32Equal(lhs, rhs);
+      case kExprF32Ne:
+        return asm_.Word32Equal(asm_.Float32Equal(lhs, rhs), 0);
+      case kExprF32Lt:
+        return asm_.Float32LessThan(lhs, rhs);
+      case kExprF32Le:
+        return asm_.Float32LessThanOrEqual(lhs, rhs);
+      case kExprF32Gt:
+        return asm_.Float32LessThan(rhs, lhs);
+      case kExprF32Ge:
+        return asm_.Float32LessThanOrEqual(rhs, lhs);
+      case kExprF32Min:
+        return asm_.Float32Min(rhs, lhs);
+      case kExprF32Max:
+        return asm_.Float32Max(rhs, lhs);
+      case kExprF64CopySign: {
+        V<Word64> lhs_without_sign = asm_.Word64BitwiseAnd(
+            asm_.BitcastFloat64ToWord64(lhs), 0x7fffffffffffffff);
+        V<Word64> rhs_sign = asm_.Word64BitwiseAnd(
+            asm_.BitcastFloat64ToWord64(rhs), 0x8000000000000000);
+        return asm_.BitcastWord64ToFloat64(
+            asm_.Word64BitwiseOr(lhs_without_sign, rhs_sign));
+      }
+      case kExprF64Add:
+        return asm_.Float64Add(lhs, rhs);
+      case kExprF64Sub:
+        return asm_.Float64Sub(lhs, rhs);
+      case kExprF64Mul:
+        return asm_.Float64Mul(lhs, rhs);
+      case kExprF64Div:
+        return asm_.Float64Div(lhs, rhs);
+      case kExprF64Eq:
+        return asm_.Float64Equal(lhs, rhs);
+      case kExprF64Ne:
+        return asm_.Word32Equal(asm_.Float64Equal(lhs, rhs), 0);
+      case kExprF64Lt:
+        return asm_.Float64LessThan(lhs, rhs);
+      case kExprF64Le:
+        return asm_.Float64LessThanOrEqual(lhs, rhs);
+      case kExprF64Gt:
+        return asm_.Float64LessThan(rhs, lhs);
+      case kExprF64Ge:
+        return asm_.Float64LessThanOrEqual(rhs, lhs);
+      case kExprF64Min:
+        return asm_.Float64Min(lhs, rhs);
+      case kExprF64Max:
+        return asm_.Float64Max(lhs, rhs);
+      case kExprF64Pow:
+        return asm_.Float64Power(lhs, rhs);
+      case kExprF64Atan2:
+        return asm_.Float64Atan2(lhs, rhs);
+      case kExprF64Mod:
+        return CallCStackSlotToStackSlot(
+            lhs, rhs, ExternalReference::f64_mod_wrapper_function(),
+            MemoryRepresentation::Float64());
+      case kExprRefEq:
+        return asm_.TaggedEqual(lhs, rhs);
+      case kExprI32AsmjsDivS: {
+        // asmjs semantics return 0 when dividing by 0.
+        if (SupportedOperations::int32_div_is_safe()) {
+          return asm_.Int32Div(lhs, rhs);
+        }
+        Label<Word32> done(&asm_);
+        IF (UNLIKELY(asm_.Word32Equal(rhs, 0))) {
+          GOTO(done, asm_.Word32Constant(0));
+        }
+        ELSE {
+          IF (UNLIKELY(asm_.Word32Equal(rhs, -1))) {
+            GOTO(done, asm_.Word32Sub(0, lhs));
+          }
+          ELSE {
+            GOTO(done, asm_.Int32Div(lhs, rhs));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+        return result;
+      }
+      case kExprI32AsmjsDivU: {
+        // asmjs semantics return 0 when dividing by 0.
+        if (SupportedOperations::uint32_div_is_safe()) {
+          return asm_.Uint32Div(lhs, rhs);
+        }
+        Label<Word32> done(&asm_);
+        IF (UNLIKELY(asm_.Word32Equal(rhs, 0))) {
+          GOTO(done, asm_.Word32Constant(0));
+        }
+        ELSE {
+          GOTO(done, asm_.Uint32Div(lhs, rhs));
+        }
+        END_IF
+        BIND(done, result);
+        return result;
+      }
+      case kExprI32AsmjsRemS: {
+        Label<Word32> done(&asm_);
+        IF (UNLIKELY(asm_.Word32Equal(rhs, 0))) {
+          GOTO(done, asm_.Word32Constant(0));
+        }
+        ELSE {
+          IF (UNLIKELY(asm_.Word32Equal(rhs, -1))) {
+            GOTO(done, asm_.Word32Constant(0));
+          }
+          ELSE {
+            GOTO(done, asm_.Int32Mod(lhs, rhs));
+          }
+          END_IF
+        }
+        END_IF
+        BIND(done, result);
+        return result;
+      }
+      case kExprI32AsmjsRemU: {
+        // asmjs semantics return 0 for mod with 0.
+        Label<Word32> done(&asm_);
+        IF (UNLIKELY(asm_.Word32Equal(rhs, 0))) {
+          GOTO(done, asm_.Word32Constant(0));
+        }
+        ELSE {
+          GOTO(done, asm_.Uint32Mod(lhs, rhs));
+        }
+        END_IF
+        BIND(done, result);
+        return result;
+      }
+      case kExprI32AsmjsStoreMem8:
+        AsmjsStoreMem(lhs, rhs, MemoryRepresentation::Int8());
+        return rhs;
+      case kExprI32AsmjsStoreMem16:
+        AsmjsStoreMem(lhs, rhs, MemoryRepresentation::Int16());
+        return rhs;
+      case kExprI32AsmjsStoreMem:
+        AsmjsStoreMem(lhs, rhs, MemoryRepresentation::Int32());
+        return rhs;
+      case kExprF32AsmjsStoreMem:
+        AsmjsStoreMem(lhs, rhs, MemoryRepresentation::Float32());
+        return rhs;
+      case kExprF64AsmjsStoreMem:
+        AsmjsStoreMem(lhs, rhs, MemoryRepresentation::Float64());
+        return rhs;
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  std::pair<V<WordPtr>, compiler::BoundsCheckResult> CheckBoundsAndAlignment(
+      const wasm::WasmMemory* memory, MemoryRepresentation repr, OpIndex index,
+      uintptr_t offset, wasm::WasmCodePosition position,
+      compiler::EnforceBoundsCheck enforce_check) {
+    // Atomic operations need bounds checks until the backend can emit protected
+    // loads.
+    compiler::BoundsCheckResult bounds_check_result;
+    V<WordPtr> converted_index;
+    std::tie(converted_index, bounds_check_result) =
+        BoundsCheckMem(memory, repr, index, offset, enforce_check);
+
+    const uintptr_t align_mask = repr.SizeInBytes() - 1;
+
+    // TODO(14108): Optimize constant index as per wasm-compiler.cc.
+
+    // Unlike regular memory accesses, atomic memory accesses should trap if
+    // the effective offset is misaligned.
+    // TODO(wasm): this addition is redundant with one inserted by {MemBuffer}.
+    OpIndex effective_offset =
+        asm_.WordPtrAdd(MemBuffer(memory->index, offset), converted_index);
+
+    V<Word32> cond = asm_.TruncateWordPtrToWord32(asm_.WordPtrBitwiseAnd(
+        effective_offset, asm_.IntPtrConstant(align_mask)));
+    asm_.TrapIfNot(asm_.Word32Equal(cond, asm_.Word32Constant(0)),
+                   OpIndex::Invalid(), TrapId::kTrapUnalignedAccess);
+    return {converted_index, bounds_check_result};
+  }
+
+  std::pair<V<WordPtr>, compiler::BoundsCheckResult> BoundsCheckMem(
+      const wasm::WasmMemory* memory, MemoryRepresentation repr, OpIndex index,
+      uintptr_t offset, compiler::EnforceBoundsCheck enforce_bounds_check) {
+    // The function body decoder already validated that the access is not
+    // statically OOB.
+    DCHECK(base::IsInBounds(offset, static_cast<uintptr_t>(repr.SizeInBytes()),
+                            memory->max_memory_size));
+
+    // Convert the index to uintptr.
+    if (!memory->is_memory64) {
+      index = asm_.ChangeUint32ToUintPtr(index);
+    } else if (kSystemPointerSize == kInt32Size) {
+      // In memory64 mode on 32-bit systems, the upper 32 bits need to be zero
+      // to succeed the bounds check.
+      DCHECK_NE(kTrapHandler, memory->bounds_checks);
+      if (memory->bounds_checks == wasm::kExplicitBoundsChecks) {
+        V<Word32> high_word = asm_.TruncateWord64ToWord32(
+            asm_.Word64ShiftRightLogical(index, 32));
+        asm_.TrapIf(high_word, OpIndex::Invalid(), TrapId::kTrapMemOutOfBounds);
+      }
+      // Truncate index to 32-bit.
+      index = asm_.TruncateWord64ToWord32(index);
+    }
+
+    //  If no bounds checks should be performed (for testing), just return the
+    // converted index and assume it to be in-bounds.
+    if (memory->bounds_checks == wasm::kNoBoundsChecks) {
+      return {index, compiler::BoundsCheckResult::kInBounds};
+    }
+
+    // TODO(14108): Optimize constant index as per wasm-compiler.cc.
+
+    if (memory->bounds_checks == kTrapHandler &&
+        enforce_bounds_check ==
+            compiler::EnforceBoundsCheck::kCanOmitBoundsCheck) {
+      return {index, compiler::BoundsCheckResult::kTrapHandler};
+    }
+
+    uintptr_t end_offset = offset + repr.SizeInBytes() - 1u;
+
+    V<WordPtr> memory_size = MemSize(memory->index);
+    if (end_offset > memory->min_memory_size) {
+      // The end offset is larger than the smallest memory.
+      // Dynamically check the end offset against the dynamic memory size.
+      asm_.TrapIfNot(
+          asm_.UintPtrLessThan(asm_.UintPtrConstant(end_offset), memory_size),
+          OpIndex::Invalid(), TrapId::kTrapMemOutOfBounds);
+    }
+
+    // This produces a positive number since {end_offset <= min_size <=
+    // mem_size}.
+    V<WordPtr> effective_size = asm_.WordPtrSub(memory_size, end_offset);
+    asm_.TrapIfNot(asm_.UintPtrLessThan(index, effective_size),
+                   OpIndex::Invalid(), TrapId::kTrapMemOutOfBounds);
+    return {index, compiler::BoundsCheckResult::kDynamicallyChecked};
+  }
+
+  V<WordPtr> MemStart(uint32_t index) {
+    if (index == 0) {
+      return LOAD_INSTANCE_FIELD(Memory0Start, kMaybeSandboxedPointer);
+    } else {
+      V<ByteArray> instance_memories = LOAD_INSTANCE_FIELD(
+          MemoryBasesAndSizes, MemoryRepresentation::TaggedPointer());
+      return asm_.Load(instance_memories, LoadOp::Kind::TaggedBase(),
+                       kMaybeSandboxedPointer,
+                       ByteArray::kHeaderSize +
+                           2 * index * kMaybeSandboxedPointer.SizeInBytes());
+    }
+  }
+
+  V<WordPtr> MemBuffer(uint32_t mem_index, uintptr_t offset) {
+    V<WordPtr> mem_start = MemStart(mem_index);
+    if (offset == 0) return mem_start;
+    return asm_.WordPtrAdd(mem_start, offset);
+  }
+
+  V<WordPtr> MemSize(uint32_t index) {
+    if (index == 0) {
+      return LOAD_INSTANCE_FIELD(Memory0Size,
+                                 MemoryRepresentation::PointerSized());
+    } else {
+      V<ByteArray> instance_memories = LOAD_INSTANCE_FIELD(
+          MemoryBasesAndSizes, MemoryRepresentation::TaggedPointer());
+      return asm_.Load(
+          instance_memories, LoadOp::Kind::TaggedBase(),
+          MemoryRepresentation::PointerSized(),
+          ByteArray::kHeaderSize + (2 * index + 1) * kSystemPointerSize);
+    }
+  }
+
+  LoadOp::Kind GetMemoryAccessKind(
+      MemoryRepresentation repr,
+      compiler::BoundsCheckResult bounds_check_result) {
+    if (bounds_check_result == compiler::BoundsCheckResult::kTrapHandler) {
+      DCHECK(repr == MemoryRepresentation::Int8() ||
+             repr == MemoryRepresentation::Uint8() ||
+             SupportedOperations::IsUnalignedLoadSupported(repr));
+      return LoadOp::Kind::Protected();
+    } else if (repr != MemoryRepresentation::Int8() &&
+               repr != MemoryRepresentation::Uint8() &&
+               !SupportedOperations::IsUnalignedLoadSupported(repr)) {
+      return LoadOp::Kind::RawUnaligned();
+    } else {
+      return LoadOp::Kind::RawAligned();
+    }
+  }
+
+  void TraceMemoryOperation(bool is_store, MemoryRepresentation repr,
+                            V<WordPtr> index, uintptr_t offset) {
+    int kAlign = 4;  // Ensure that the LSB is 0, like a Smi.
+    V<WordPtr> info = asm_.StackSlot(sizeof(MemoryTracingInfo), kAlign);
+    V<WordPtr> effective_offset = asm_.WordPtrAdd(index, offset);
+    asm_.Store(info, effective_offset, StoreOp::Kind::RawAligned(),
+               MemoryRepresentation::PointerSized(), compiler::kNoWriteBarrier,
+               offsetof(MemoryTracingInfo, offset));
+    asm_.Store(info, asm_.Word32Constant(is_store ? 1 : 0),
+               StoreOp::Kind::RawAligned(), MemoryRepresentation::Uint8(),
+               compiler::kNoWriteBarrier,
+               offsetof(MemoryTracingInfo, is_store));
+    V<Word32> rep_as_int = asm_.Word32Constant(
+        static_cast<int>(repr.ToMachineType().representation()));
+    asm_.Store(info, rep_as_int, StoreOp::Kind::RawAligned(),
+               MemoryRepresentation::Uint8(), compiler::kNoWriteBarrier,
+               offsetof(MemoryTracingInfo, mem_rep));
+    CallRuntime(Runtime::kWasmTraceMemory, {info});
+  }
+
+  void StackCheck() {
+    if (V8_UNLIKELY(!v8_flags.wasm_stack_checks)) return;
+    V<WordPtr> limit_address = LOAD_INSTANCE_FIELD(
+        StackLimitAddress, MemoryRepresentation::PointerSized());
+    V<WordPtr> limit = asm_.Load(limit_address, LoadOp::Kind::RawAligned(),
+                                 MemoryRepresentation::PointerSized(), 0);
+    V<Word32> check =
+        asm_.StackPointerGreaterThan(limit, compiler::StackCheckKind::kWasm);
+    TSBlock* continuation = asm_.NewBlock();
+    TSBlock* call_builtin = asm_.NewBlock();
+    asm_.Branch(ConditionWithHint(check, BranchHint::kTrue), continuation,
+                call_builtin);
+
+    // TODO(14108): Cache descriptor.
+    asm_.Bind(call_builtin);
+    V<WordPtr> builtin = asm_.RelocatableConstant(WasmCode::kWasmStackGuard,
+                                                  RelocInfo::WASM_STUB_CALL);
+    const CallDescriptor* call_descriptor =
+        compiler::Linkage::GetStubCallDescriptor(
+            asm_.graph_zone(),                    // zone
+            NoContextDescriptor{},                // descriptor
+            0,                                    // stack parameter count
+            CallDescriptor::kNoFlags,             // flags
+            compiler::Operator::kNoProperties,    // properties
+            StubCallMode::kCallWasmRuntimeStub);  // stub call mode
+    const TSCallDescriptor* ts_call_descriptor = TSCallDescriptor::Create(
+        call_descriptor, compiler::CanThrow::kNo, asm_.graph_zone());
+    asm_.Call(builtin, {}, ts_call_descriptor);
+    asm_.Goto(continuation);
+
+    asm_.Bind(continuation);
+  }
+
+  std::pair<V<WordPtr>, V<HeapObject>> BuildImportedFunctionTargetAndRef(
+      uint32_t function_index) {
+    // Imported function.
+    V<WordPtr> func_index = asm_.IntPtrConstant(function_index);
+    V<FixedArray> imported_function_refs = LOAD_INSTANCE_FIELD(
+        ImportedFunctionRefs, MemoryRepresentation::TaggedPointer());
+    auto ref = V<HeapObject>::Cast(
+        LoadFixedArrayElement(imported_function_refs, func_index));
+    V<FixedAddressArray> imported_targets = LOAD_INSTANCE_FIELD(
+        ImportedFunctionTargets, MemoryRepresentation::TaggedPointer());
+    V<WordPtr> target =
+        asm_.Load(imported_targets, func_index, LoadOp::Kind::TaggedBase(),
+                  MemoryRepresentation::PointerSized(),
+                  FixedAddressArray::kHeaderSize, kSystemPointerSizeLog2);
+    return {target, ref};
+  }
+
+  std::pair<V<WordPtr>, V<HeapObject>> BuildIndirectCallTargetAndRef(
+      FullDecoder* decoder, OpIndex index, CallIndirectImmediate imm) {
+    uint32_t table_index = imm.table_imm.index;
+    const WasmTable& table = decoder->module_->tables[table_index];
+    V<WordPtr> index_intptr = asm_.ChangeInt32ToIntPtr(index);
+    uint32_t sig_index = imm.sig_imm.index;
+
+    /* Step 1: Load the indirect function tables for this table. */
+    bool needs_dynamic_size =
+        !(table.has_maximum_size && table.maximum_size == table.initial_size);
+    V<Word32> ift_size;
+    V<ByteArray> ift_sig_ids;
+    V<ExternalPointerArray> ift_targets;
+    V<FixedArray> ift_refs;
+    if (table_index == 0) {
+      ift_size = needs_dynamic_size
+                     ? LOAD_INSTANCE_FIELD(IndirectFunctionTableSize,
+                                           MemoryRepresentation::Uint32())
+                     : asm_.Word32Constant(table.initial_size);
+      ift_sig_ids = LOAD_INSTANCE_FIELD(IndirectFunctionTableSigIds,
+                                        MemoryRepresentation::TaggedPointer());
+      ift_targets = LOAD_INSTANCE_FIELD(IndirectFunctionTableTargets,
+                                        MemoryRepresentation::TaggedPointer());
+      ift_refs = LOAD_INSTANCE_FIELD(IndirectFunctionTableRefs,
+                                     MemoryRepresentation::TaggedPointer());
+    } else {
+      V<FixedArray> ift_tables = LOAD_INSTANCE_FIELD(
+          IndirectFunctionTables, MemoryRepresentation::TaggedPointer());
+      OpIndex ift_table = LoadFixedArrayElement(ift_tables, table_index);
+      ift_size = needs_dynamic_size
+                     ? asm_.Load(ift_table, LoadOp::Kind::TaggedBase(),
+                                 MemoryRepresentation::Uint32(),
+                                 WasmIndirectFunctionTable::kSizeOffset)
+                     : asm_.Word32Constant(table.initial_size);
+      ift_sig_ids = asm_.Load(ift_table, LoadOp::Kind::TaggedBase(),
+                              MemoryRepresentation::TaggedPointer(),
+                              WasmIndirectFunctionTable::kSigIdsOffset);
+      ift_targets = asm_.Load(ift_table, LoadOp::Kind::TaggedBase(),
+                              MemoryRepresentation::TaggedPointer(),
+                              WasmIndirectFunctionTable::kTargetsOffset);
+      ift_refs = asm_.Load(ift_table, LoadOp::Kind::TaggedBase(),
+                           MemoryRepresentation::TaggedPointer(),
+                           WasmIndirectFunctionTable::kRefsOffset);
+    }
+
+    /* Step 2: Bounds check against the table size. */
+    asm_.TrapIfNot(asm_.Uint32LessThan(index, ift_size), OpIndex::Invalid(),
+                   TrapId::kTrapTableOutOfBounds);
+
+    /* Step 3: Check the canonical real signature against the canonical declared
+     * signature. */
+    bool needs_type_check =
+        !EquivalentTypes(table.type.AsNonNull(), ValueType::Ref(sig_index),
+                         decoder->module_, decoder->module_);
+    bool needs_null_check = table.type.is_nullable();
+
+    if (needs_type_check) {
+      V<WordPtr> isorecursive_canonical_types = LOAD_INSTANCE_FIELD(
+          IsorecursiveCanonicalTypes, MemoryRepresentation::PointerSized());
+      V<Word32> expected_sig_id =
+          asm_.Load(isorecursive_canonical_types, LoadOp::Kind::RawAligned(),
+                    MemoryRepresentation::Uint32(), sig_index * kUInt32Size);
+      V<Word32> loaded_sig =
+          asm_.Load(ift_sig_ids, index_intptr, LoadOp::Kind::TaggedBase(),
+                    MemoryRepresentation::Uint32(), ByteArray::kHeaderSize,
+                    2 /* kInt32SizeLog2 */);
+      if (decoder->enabled_.has_gc() &&
+          !decoder->module_->types[sig_index].is_final) {
+        // In this case, a full null check and type check is needed.
+        Bailout(decoder);
+        return {};
+      } else {
+        // In this case, signatures must match exactly.
+        asm_.TrapIfNot(asm_.Word32Equal(expected_sig_id, loaded_sig),
+                       OpIndex::Invalid(), TrapId::kTrapFuncSigMismatch);
+      }
+    } else if (needs_null_check) {
+      V<Word32> loaded_sig =
+          asm_.Load(ift_sig_ids, index_intptr, LoadOp::Kind::TaggedBase(),
+                    MemoryRepresentation::Uint32(), ByteArray::kHeaderSize,
+                    2 /* kInt32SizeLog2 */);
+      asm_.TrapIf(asm_.Word32Equal(-1, loaded_sig), OpIndex::Invalid(),
+                  TrapId::kTrapFuncSigMismatch);
+    }
+
+    /* Step 4: Extract ref and target. */
+#ifdef V8_ENABLE_SANDBOX
+    V<Word32> external_pointer_handle = asm_.Load(
+        ift_targets, index_intptr, LoadOp::Kind::TaggedBase(),
+        MemoryRepresentation::Uint32(), ExternalPointerArray::kHeaderSize, 2);
+    V<WordPtr> target = BuildDecodeExternalPointer(
+        external_pointer_handle, kWasmIndirectFunctionTargetTag);
+#else
+    V<WordPtr> target =
+        asm_.Load(ift_targets, index_intptr, LoadOp::Kind::TaggedBase(),
+                  MemoryRepresentation::PointerSized(),
+                  ExternalPointerArray::kHeaderSize, kSystemPointerSizeLog2);
+#endif
+    auto ref =
+        V<HeapObject>::Cast(LoadFixedArrayElement(ift_refs, index_intptr));
+    return {target, ref};
+  }
+
+  std::pair<V<WordPtr>, V<HeapObject>> BuildFunctionReferenceTargetAndRef(
+      V<HeapObject> func_ref, ValueType type) {
+    if (type.is_nullable() &&
+        null_check_strategy_ == compiler::NullCheckStrategy::kExplicit) {
+      func_ref = V<HeapObject>::Cast(
+          asm_.AssertNotNull(func_ref, type, TrapId::kTrapNullDereference));
+    }
+
+    V<HeapObject> ref =
+        type.is_nullable() && null_check_strategy_ ==
+                                  compiler::NullCheckStrategy::kTrapHandler
+            ? asm_.Load(func_ref, LoadOp::Kind::TrapOnNull(),
+                        MemoryRepresentation::TaggedPointer(),
+                        WasmInternalFunction::kRefOffset)
+            : asm_.Load(func_ref, LoadOp::Kind::TaggedBase(),
+                        MemoryRepresentation::TaggedPointer(),
+                        WasmInternalFunction::kRefOffset);
+
+#ifdef V8_ENABLE_SANDBOX
+    V<Word32> target_handle = asm_.Load(
+        func_ref, LoadOp::Kind::TaggedBase(), MemoryRepresentation::Uint32(),
+        WasmInternalFunction::kCallTargetOffset);
+    V<WordPtr> target = BuildDecodeExternalPointer(
+        target_handle, kWasmInternalFunctionCallTargetTag);
+#else
+    V<WordPtr> target = asm_.Load(func_ref, LoadOp::Kind::TaggedBase(),
+                                  MemoryRepresentation::PointerSized(),
+                                  WasmInternalFunction::kCallTargetOffset);
+#endif
+    Label<WordPtr> done(&asm_);
+    // For wasm functions, we have a cached handle to a pointer to off-heap
+    // code. For WasmJSFunctions we used not to be able to cache this handle
+    // because the code was on-heap, so we needed to fetch it every time from
+    // the on-heap Code object. However now, when code pointer sandboxing is on,
+    // the on-heap Code object also has a handle to off-heap code, so we could
+    // probably also cache that somehow.
+    // TODO(manoskouk): Figure out how to improve the situation.
+    IF (UNLIKELY(asm_.WordPtrEqual(target, 0))) {
+      V<Code> wrapper_code = asm_.Load(func_ref, LoadOp::Kind::TaggedBase(),
+                                       MemoryRepresentation::TaggedPointer(),
+                                       WasmInternalFunction::kCodeOffset);
+#ifdef V8_CODE_POINTER_SANDBOXING
+      V<Word32> call_target_handle = asm_.Load(
+          wrapper_code, LoadOp::Kind::TaggedBase(),
+          MemoryRepresentation::Uint32(), Code::kInstructionStartOffset);
+      V<WordPtr> call_target =
+          BuildDecodeExternalCodePointer(call_target_handle);
+#else
+      V<WordPtr> call_target = asm_.Load(
+          wrapper_code, LoadOp::Kind::TaggedBase(),
+          MemoryRepresentation::PointerSized(), Code::kInstructionStartOffset);
+#endif
+      GOTO(done, call_target);
+    }
+    ELSE {
+      GOTO(done, target);
+    }
+    END_IF
+
+    BIND(done, final_target);
+
+    return {final_target, ref};
+  }
+
+  void BuildWasmCall(FullDecoder* decoder, const FunctionSig* sig,
+                     V<WordPtr> callee, V<HeapObject> ref, const Value args[],
+                     Value returns[]) {
+    const TSCallDescriptor* descriptor = TSCallDescriptor::Create(
+        compiler::GetWasmCallDescriptor(asm_.graph_zone(), sig),
+        compiler::CanThrow::kYes, asm_.graph_zone());
+
+    std::vector<OpIndex> arg_indices(sig->parameter_count() + 1);
+    arg_indices[0] = ref;
+    for (uint32_t i = 0; i < sig->parameter_count(); i++) {
+      arg_indices[i + 1] = args[i].op;
+    }
+
+    OpIndex call = CallAndMaybeCatchException(
+        decoder, callee, base::VectorOf(arg_indices), descriptor);
+
+    if (sig->return_count() == 1) {
+      returns[0].op = call;
+    } else if (sig->return_count() > 1) {
+      for (uint32_t i = 0; i < sig->return_count(); i++) {
+        returns[i].op =
+            asm_.Projection(call, i, RepresentationFor(sig->GetReturn(i)));
+      }
+    }
+  }
+
+  void BuildWasmReturnCall(const FunctionSig* sig, V<WordPtr> callee,
+                           V<HeapObject> ref, const Value args[]) {
+    const TSCallDescriptor* descriptor = TSCallDescriptor::Create(
+        compiler::GetWasmCallDescriptor(asm_.graph_zone(), sig),
+        compiler::CanThrow::kYes, asm_.graph_zone());
+
+    base::SmallVector<OpIndex, 8> arg_indices(sig->parameter_count() + 1);
+    arg_indices[0] = ref;
+    for (uint32_t i = 0; i < sig->parameter_count(); i++) {
+      arg_indices[i + 1] = args[i].op;
+    }
+
+    asm_.TailCall(callee, base::VectorOf(arg_indices), descriptor);
+  }
+
+  OpIndex CallBuiltinFromRuntimeStub(
+      FullDecoder* decoder, WasmCode::RuntimeStubId stub_id,
+      base::Vector<const OpIndex> args,
+      CheckForException check_for_exception = CheckForException::kNo) {
+    Builtin builtin_name = RuntimeStubIdToBuiltinName(stub_id);
+    CallInterfaceDescriptor interface_descriptor =
+        Builtins::CallInterfaceDescriptorFor(builtin_name);
+    const CallDescriptor* call_descriptor =
+        compiler::Linkage::GetStubCallDescriptor(
+            asm_.graph_zone(), interface_descriptor,
+            interface_descriptor.GetStackParameterCount(),
+            CallDescriptor::kNoFlags, compiler::Operator::kNoProperties,
+            StubCallMode::kCallWasmRuntimeStub);
+    const TSCallDescriptor* ts_call_descriptor = TSCallDescriptor::Create(
+        call_descriptor, compiler::CanThrow::kYes, asm_.graph_zone());
+    V<WordPtr> call_target =
+        asm_.RelocatableConstant(stub_id, RelocInfo::WASM_STUB_CALL);
+    return check_for_exception == CheckForException::kYes
+               ? CallAndMaybeCatchException(decoder, call_target, args,
+                                            ts_call_descriptor)
+               : asm_.Call(call_target, OpIndex::Invalid(), args,
+                           ts_call_descriptor);
+  }
+
+  OpIndex CallBuiltinFromRuntimeStub(
+      FullDecoder* decoder, WasmCode::RuntimeStubId stub_id,
+      std::initializer_list<OpIndex> args,
+      CheckForException check_for_exception = CheckForException::kNo) {
+    return CallBuiltinFromRuntimeStub(decoder, stub_id, base::VectorOf(args),
+                                      check_for_exception);
+  }
+
+  OpIndex CallAndMaybeCatchException(FullDecoder* decoder, V<WordPtr> callee,
+                                     base::Vector<const OpIndex> args,
+                                     const TSCallDescriptor* descriptor) {
+    if (decoder->current_catch() == -1) {
+      return asm_.Call(callee, OpIndex::Invalid(), args, descriptor);
+    }
+
+    Control* current_catch =
+        decoder->control_at(decoder->control_depth_of_current_catch());
+    TSBlock* catch_block = current_catch->false_or_loop_or_catch_block;
+    TSBlock* success_block = asm_.NewBlock();
+    TSBlock* exception_block = asm_.NewBlock();
+    OpIndex call;
+    {
+      decltype(asm_)::CatchScope scope(asm_, exception_block);
+
+      call = asm_.Call(callee, OpIndex::Invalid(), args, descriptor);
+      asm_.Goto(success_block);
+    }
+
+    asm_.Bind(exception_block);
+    OpIndex exception = asm_.CatchBlockBegin();
+    SetupControlFlowEdge(decoder, catch_block, 0, exception);
+    asm_.Goto(catch_block);
+
+    asm_.Bind(success_block);
+    return call;
+  }
+
+  OpIndex CallRuntime(Runtime::FunctionId f,
+                      std::initializer_list<const OpIndex> args) {
+    const Runtime::Function* fun = Runtime::FunctionForId(f);
+    OpIndex isolate_root = asm_.LoadRootRegister();
+    DCHECK_EQ(1, fun->result_size);
+    int builtin_slot_offset = IsolateData::BuiltinSlotOffset(
+        Builtin::kCEntry_Return1_ArgvOnStack_NoBuiltinExit);
+    OpIndex centry_stub =
+        asm_.Load(isolate_root, LoadOp::Kind::RawAligned(),
+                  MemoryRepresentation::PointerSized(), builtin_slot_offset);
+    base::SmallVector<OpIndex, 8> centry_args;
+    for (OpIndex arg : args) centry_args.emplace_back(arg);
+    centry_args.emplace_back(
+        asm_.ExternalConstant(ExternalReference::Create(f)));
+    centry_args.emplace_back(asm_.Word32Constant(fun->nargs));
+    centry_args.emplace_back(asm_.NoContextConstant());  // js_context
+    const CallDescriptor* call_descriptor =
+        compiler::Linkage::GetRuntimeCallDescriptor(
+            asm_.graph_zone(), f, fun->nargs, compiler::Operator::kNoProperties,
+            CallDescriptor::kNoFlags);
+    const TSCallDescriptor* ts_call_descriptor = TSCallDescriptor::Create(
+        call_descriptor, compiler::CanThrow::kYes, asm_.graph_zone());
+    return asm_.Call(centry_stub, OpIndex::Invalid(),
+                     base::VectorOf(centry_args), ts_call_descriptor);
+  }
+
+  OpIndex CallC(const MachineSignature* sig, ExternalReference ref,
+                std::initializer_list<OpIndex> args) {
+    DCHECK_LE(sig->return_count(), 1);
+    const CallDescriptor* call_descriptor =
+        compiler::Linkage::GetSimplifiedCDescriptor(asm_.graph_zone(), sig);
+    const TSCallDescriptor* ts_call_descriptor = TSCallDescriptor::Create(
+        call_descriptor, compiler::CanThrow::kNo, asm_.graph_zone());
+    return asm_.Call(asm_.ExternalConstant(ref), OpIndex::Invalid(),
+                     base::VectorOf(args), ts_call_descriptor);
+  }
+
+  OpIndex CallC(const MachineSignature* sig, ExternalReference ref,
+                OpIndex arg) {
+    return CallC(sig, ref, {arg});
+  }
+
+  OpIndex CallCStackSlotToInt32(OpIndex arg, ExternalReference ref,
+                                MemoryRepresentation arg_type) {
+    OpIndex stack_slot_param =
+        asm_.StackSlot(arg_type.SizeInBytes(), arg_type.SizeInBytes());
+    asm_.Store(stack_slot_param, arg, StoreOp::Kind::RawAligned(), arg_type,
+               compiler::WriteBarrierKind::kNoWriteBarrier);
+    MachineType reps[]{MachineType::Int32(), MachineType::Pointer()};
+    MachineSignature sig(1, 1, reps);
+    return CallC(&sig, ref, stack_slot_param);
+  }
+
+  V<Word32> CallCStackSlotToInt32(
+      ExternalReference ref,
+      std::initializer_list<std::pair<OpIndex, MemoryRepresentation>> args) {
+    int slot_size = 0;
+    for (auto arg : args) slot_size += arg.second.SizeInBytes();
+    // Since we are storing the arguments unaligned anyway, we do not need
+    // alignment > 0.
+    V<WordPtr> stack_slot_param = asm_.StackSlot(slot_size, 0);
+    int offset = 0;
+    for (auto arg : args) {
+      asm_.Store(stack_slot_param, arg.first, StoreOp::Kind::RawUnaligned(),
+                 arg.second, compiler::WriteBarrierKind::kNoWriteBarrier,
+                 offset);
+      offset += arg.second.SizeInBytes();
+    }
+    MachineType reps[]{MachineType::Int32(), MachineType::Pointer()};
+    MachineSignature sig(1, 1, reps);
+    return CallC(&sig, ref, stack_slot_param);
+  }
+
+  OpIndex CallCStackSlotToStackSlot(OpIndex arg, ExternalReference ref,
+                                    MemoryRepresentation arg_type) {
+    V<WordPtr> stack_slot =
+        asm_.StackSlot(arg_type.SizeInBytes(), arg_type.SizeInBytes());
+    asm_.Store(stack_slot, arg, StoreOp::Kind::RawAligned(), arg_type,
+               compiler::WriteBarrierKind::kNoWriteBarrier);
+    MachineType reps[]{MachineType::Pointer()};
+    MachineSignature sig(0, 1, reps);
+    CallC(&sig, ref, stack_slot);
+    return asm_.Load(stack_slot, LoadOp::Kind::RawAligned(), arg_type);
+  }
+
+  OpIndex CallCStackSlotToStackSlot(OpIndex arg0, OpIndex arg1,
+                                    ExternalReference ref,
+                                    MemoryRepresentation arg_type) {
+    V<WordPtr> stack_slot =
+        asm_.StackSlot(2 * arg_type.SizeInBytes(), arg_type.SizeInBytes());
+    asm_.Store(stack_slot, arg0, StoreOp::Kind::RawAligned(), arg_type,
+               compiler::WriteBarrierKind::kNoWriteBarrier);
+    asm_.Store(stack_slot, arg1, StoreOp::Kind::RawAligned(), arg_type,
+               compiler::WriteBarrierKind::kNoWriteBarrier,
+               arg_type.SizeInBytes());
+    MachineType reps[]{MachineType::Pointer()};
+    MachineSignature sig(0, 1, reps);
+    CallC(&sig, ref, stack_slot);
+    return asm_.Load(stack_slot, LoadOp::Kind::RawAligned(), arg_type);
+  }
+
+  V<WordPtr> MemoryIndexToUintPtrOrOOBTrap(bool memory_is_64, OpIndex index) {
+    if (!memory_is_64) return asm_.ChangeUint32ToUintPtr(index);
+    if (kSystemPointerSize == kInt64Size) return index;
+    asm_.TrapIf(
+        asm_.TruncateWord64ToWord32(asm_.Word64ShiftRightLogical(index, 32)),
+        OpIndex::Invalid(), TrapId::kTrapMemOutOfBounds);
+    return OpIndex(asm_.TruncateWord64ToWord32(index));
+  }
+
+  V<Smi> ChangeUint31ToSmi(V<Word32> value) {
+    if constexpr (COMPRESS_POINTERS_BOOL) {
+      return V<Smi>::Cast(
+          asm_.Word32ShiftLeft(value, kSmiShiftSize + kSmiTagSize));
+    } else {
+      return V<Smi>::Cast(asm_.WordPtrShiftLeft(
+          asm_.ChangeUint32ToUintPtr(value), kSmiShiftSize + kSmiTagSize));
+    }
+  }
+
+  V<Word32> ChangeSmiToUint32(V<Smi> value) {
+    if constexpr (COMPRESS_POINTERS_BOOL) {
+      return asm_.Word32ShiftRightLogical(V<Word32>::Cast(value),
+                                          kSmiShiftSize + kSmiTagSize);
+    } else {
+      return asm_.TruncateWordPtrToWord32(asm_.WordPtrShiftRightLogical(
+          V<WordPtr>::Cast(value), kSmiShiftSize + kSmiTagSize));
+    }
+  }
+
+  V<WordPtr> BuildDecodeExternalPointer(V<Word32> handle,
+                                        ExternalPointerTag tag) {
+#ifdef V8_ENABLE_SANDBOX
+    // Decode loaded external pointer.
+    V<WordPtr> isolate_root = asm_.LoadRootRegister();
+    DCHECK(!IsSharedExternalPointerType(tag));
+    V<WordPtr> table =
+        asm_.Load(isolate_root, LoadOp::Kind::RawAligned(),
+                  MemoryRepresentation::PointerSized(),
+                  IsolateData::external_pointer_table_offset() +
+                      Internals::kExternalPointerTableBasePointerOffset);
+    V<Word32> index =
+        asm_.Word32ShiftRightLogical(handle, kExternalPointerIndexShift);
+    V<WordPtr> pointer =
+        asm_.LoadOffHeap(table, asm_.ChangeUint32ToUint64(index), 0,
+                         MemoryRepresentation::PointerSized());
+    pointer = asm_.Word64BitwiseAnd(pointer, asm_.Word64Constant(~tag));
+    return pointer;
+#else   // V8_ENABLE_SANDBOX
+    UNREACHABLE();
+#endif  // V8_ENABLE_SANDBOX
+  }
+
+  V<WordPtr> BuildDecodeExternalCodePointer(V<Word32> handle) {
+#ifdef V8_CODE_POINTER_SANDBOXING
+    V<Word32> index =
+        asm_.Word32ShiftRightLogical(handle, kCodePointerHandleShift);
+    V<WordPtr> offset = asm_.ChangeUint32ToUintPtr(
+        asm_.Word32ShiftLeft(index, kCodePointerTableEntrySizeLog2));
+    V<WordPtr> table =
+        asm_.ExternalConstant(ExternalReference::code_pointer_table_address());
+    return asm_.Load(table, offset, LoadOp::Kind::RawAligned(),
+                     MemoryRepresentation::PointerSized());
+#else
+    UNREACHABLE();
+#endif
+  }
+
+  void BuildEncodeException32BitValue(V<FixedArray> values_array,
+                                      uint32_t index, V<Word32> value) {
+    V<Smi> upper_half =
+        ChangeUint31ToSmi(asm_.Word32ShiftRightLogical(value, 16));
+    StoreFixedArrayElement(values_array, index, upper_half,
+                           compiler::kNoWriteBarrier);
+    V<Smi> lower_half =
+        ChangeUint31ToSmi(asm_.Word32BitwiseAnd(value, 0xffffu));
+    StoreFixedArrayElement(values_array, index + 1, lower_half,
+                           compiler::kNoWriteBarrier);
+  }
+
+  V<Word32> BuildDecodeException32BitValue(V<FixedArray> exception_values_array,
+                                           int index) {
+    V<Word32> upper_half = asm_.Word32ShiftLeft(
+        ChangeSmiToUint32(
+            V<Smi>::Cast(LoadFixedArrayElement(exception_values_array, index))),
+        16);
+    V<Word32> lower_half = ChangeSmiToUint32(
+        V<Smi>::Cast(LoadFixedArrayElement(exception_values_array, index + 1)));
+    return asm_.Word32BitwiseOr(upper_half, lower_half);
+  }
+
+  V<Word64> BuildDecodeException64BitValue(V<FixedArray> exception_values_array,
+                                           int index) {
+    V<Word64> upper_half = asm_.Word64ShiftLeft(
+        asm_.ChangeUint32ToUint64(
+            BuildDecodeException32BitValue(exception_values_array, index)),
+        32);
+    V<Word64> lower_half = asm_.ChangeUint32ToUint64(
+        BuildDecodeException32BitValue(exception_values_array, index + 2));
+    return asm_.Word64BitwiseOr(upper_half, lower_half);
+  }
+
+  void UnpackWasmException(FullDecoder* decoder, V<Tagged> exception,
+                           base::Vector<Value> values) {
+    V<FixedArray> exception_values_array = CallBuiltinFromRuntimeStub(
+        decoder, WasmCode::kWasmGetOwnProperty,
+        {exception, LOAD_ROOT(wasm_exception_values_symbol),
+         LOAD_INSTANCE_FIELD(NativeContext,
+                             MemoryRepresentation::TaggedPointer())});
+
+    int index = 0;
+    for (Value& value : values) {
+      switch (value.type.kind()) {
+        case kI32:
+          value.op =
+              BuildDecodeException32BitValue(exception_values_array, index);
+          index += 2;
+          break;
+        case kI64:
+          value.op =
+              BuildDecodeException64BitValue(exception_values_array, index);
+          index += 4;
+          break;
+        case kF32:
+          value.op = asm_.BitcastWord32ToFloat32(
+              BuildDecodeException32BitValue(exception_values_array, index));
+          index += 2;
+          break;
+        case kF64:
+          value.op = asm_.BitcastWord64ToFloat64(
+              BuildDecodeException64BitValue(exception_values_array, index));
+          index += 4;
+          break;
+        case kS128: {
+          value.op = asm_.Simd128Splat(
+              BuildDecodeException32BitValue(exception_values_array, index),
+              compiler::turboshaft::Simd128SplatOp::Kind::kI32x4);
+          index += 2;
+          using Kind = compiler::turboshaft::Simd128ReplaceLaneOp::Kind;
+          value.op = asm_.Simd128ReplaceLane(
+              value.op,
+              BuildDecodeException32BitValue(exception_values_array, index),
+              Kind::kI32x4, 1);
+          index += 2;
+          value.op = asm_.Simd128ReplaceLane(
+              value.op,
+              BuildDecodeException32BitValue(exception_values_array, index),
+              Kind::kI32x4, 2);
+          index += 2;
+          value.op = asm_.Simd128ReplaceLane(
+              value.op,
+              BuildDecodeException32BitValue(exception_values_array, index),
+              Kind::kI32x4, 3);
+          index += 2;
+          break;
+        }
+        case kRtt:
+        case kRef:
+        case kRefNull:
+          value.op = LoadFixedArrayElement(exception_values_array, index);
+          index++;
+          break;
+        case kI8:
+        case kI16:
+        case kVoid:
+        case kBottom:
+          UNREACHABLE();
+      }
+    }
+  }
+
+  void AsmjsStoreMem(V<Word32> index, OpIndex value,
+                     MemoryRepresentation repr) {
+    // Since asmjs does not support unaligned accesses, we can bounds-check
+    // ignoring the access size.
+    IF (LIKELY(asm_.Uint32LessThan(index,
+                                   asm_.TruncateWordPtrToWord32(MemSize(0))))) {
+      asm_.Store(MemStart(0), asm_.ChangeUint32ToUintPtr(index), value,
+                 StoreOp::Kind::RawAligned(), repr, compiler::kNoWriteBarrier,
+                 0);
+    }
+    END_IF
+  }
+
+  OpIndex AsmjsLoadMem(V<Word32> index, MemoryRepresentation repr) {
+    // Since asmjs does not support unaligned accesses, we can bounds-check
+    // ignoring the access size.
+    TSBlock* in_bounds = asm_.NewBlock();
+    TSBlock* out_of_bounds = asm_.NewBlock();
+    TSBlock* done = asm_.NewBlock();
+
+    asm_.Branch(
+        ConditionWithHint(asm_.Uint32LessThan(
+                              index, asm_.TruncateWordPtrToWord32(MemSize(0))),
+                          BranchHint::kTrue),
+        in_bounds, out_of_bounds);
+
+    asm_.Bind(in_bounds);
+    OpIndex loaded_value =
+        asm_.Load(MemStart(0), asm_.ChangeInt32ToIntPtr(index),
+                  LoadOp::Kind::RawAligned(), repr);
+    asm_.Goto(done);
+
+    asm_.Bind(out_of_bounds);
+    OpIndex default_value;
+    switch (repr) {
+      case MemoryRepresentation::Int8():
+      case MemoryRepresentation::Int16():
+      case MemoryRepresentation::Int32():
+      case MemoryRepresentation::Uint8():
+      case MemoryRepresentation::Uint16():
+      case MemoryRepresentation::Uint32():
+        default_value = asm_.Word32Constant(0);
+        break;
+      case MemoryRepresentation::Float32():
+        default_value =
+            asm_.Float32Constant(std::numeric_limits<float>::quiet_NaN());
+        break;
+      case MemoryRepresentation::Float64():
+        default_value =
+            asm_.Float64Constant(std::numeric_limits<double>::quiet_NaN());
+        break;
+      default:
+        UNREACHABLE();
+    }
+    asm_.Goto(done);
+
+    asm_.Bind(done);
+    return asm_.Phi(base::VectorOf({loaded_value, default_value}),
+                    repr.ToRegisterRepresentation());
+  }
+
+  void BoundsCheckArray(V<HeapObject> array, V<Word32> index,
+                        ValueType array_type) {
+    if (V8_UNLIKELY(v8_flags.experimental_wasm_skip_bounds_checks)) {
+      if (array_type.is_nullable()) {
+        asm_.AssertNotNull(array, array_type, TrapId::kTrapNullDereference);
+      }
+    } else {
+      OpIndex length = asm_.ArrayLength(
+          array, array_type.is_nullable() ? compiler::kWithNullCheck
+                                          : compiler::kWithoutNullCheck);
+      asm_.TrapIfNot(asm_.Uint32LessThan(index, length), OpIndex::Invalid(),
+                     TrapId::kTrapArrayOutOfBounds);
+    }
+  }
+
+  void BoundsCheckArrayWithLength(V<HeapObject> array, V<Word32> index,
+                                  V<Word32> length,
+                                  compiler::CheckForNull null_check) {
+    if (V8_UNLIKELY(v8_flags.experimental_wasm_skip_bounds_checks)) return;
+    V<Word32> array_length = asm_.ArrayLength(array, null_check);
+    V<Word32> range_end = asm_.Word32Add(index, length);
+    V<Word32> range_valid = asm_.Word32BitwiseAnd(
+        // OOB if (index + length > array.len).
+        asm_.Uint32LessThanOrEqual(range_end, array_length),
+        // OOB if (index + length) overflows.
+        asm_.Uint32LessThanOrEqual(index, range_end));
+    asm_.TrapIfNot(range_valid, OpIndex::Invalid(),
+                   TrapId::kTrapArrayOutOfBounds);
+  }
+
+  V<Tagged> LoadFixedArrayElement(V<FixedArray> array, int index) {
+    return asm_.Load(array, LoadOp::Kind::TaggedBase(),
+                     MemoryRepresentation::AnyTagged(),
+                     FixedArray::kHeaderSize + index * kTaggedSize);
+  }
+
+  V<Tagged> LoadFixedArrayElement(V<FixedArray> array, V<WordPtr> index) {
+    return asm_.Load(array, index, LoadOp::Kind::TaggedBase(),
+                     MemoryRepresentation::AnyTagged(), FixedArray::kHeaderSize,
+                     kTaggedSizeLog2);
+  }
+
+  void StoreFixedArrayElement(V<FixedArray> array, int index, V<Tagged> value,
+                              compiler::WriteBarrierKind write_barrier) {
+    asm_.Store(array, value, LoadOp::Kind::TaggedBase(),
+               MemoryRepresentation::AnyTagged(), write_barrier,
+               FixedArray::kHeaderSize + index * kTaggedSize);
+  }
+
+  void StoreFixedArrayElement(V<FixedArray> array, V<WordPtr> index,
+                              V<Tagged> value,
+                              compiler::WriteBarrierKind write_barrier) {
+    asm_.Store(array, index, value, LoadOp::Kind::TaggedBase(),
+               MemoryRepresentation::AnyTagged(), write_barrier,
+               FixedArray::kHeaderSize, kTaggedSizeLog2);
+  }
+
+  void BrOnCastImpl(FullDecoder* decoder, V<Map> rtt,
+                    compiler::WasmTypeCheckConfig config, const Value& object,
+                    Value* value_on_branch, uint32_t br_depth,
+                    bool null_succeeds) {
+    OpIndex cast_succeeds = asm_.WasmTypeCheck(object.op, rtt, config);
+    IF (cast_succeeds) {
+      // Narrow type for the successful cast target branch.
+      Forward(decoder, object, value_on_branch);
+      BrOrRet(decoder, br_depth, 0);
+    }
+    END_IF
+    // Note: Differently to below for br_on_cast_fail, we do not Forward
+    // the value here to perform a TypeGuard. It can't be done here due to
+    // asymmetric decoder code. A Forward here would be popped from the stack
+    // and ignored by the decoder. Therefore the decoder has to call Forward
+    // itself.
+  }
+
+  void BrOnCastFailImpl(FullDecoder* decoder, V<Map> rtt,
+                        compiler::WasmTypeCheckConfig config,
+                        const Value& object, Value* value_on_fallthrough,
+                        uint32_t br_depth, bool null_succeeds) {
+    OpIndex cast_succeeds = asm_.WasmTypeCheck(object.op, rtt, config);
+    IF (__ Word32Equal(cast_succeeds, 0)) {
+      // It is necessary in case of {null_succeeds} to forward the value.
+      // This will add a TypeGuard to the non-null type (as in this case the
+      // object is non-nullable).
+      Forward(decoder, object, decoder->stack_value(1));
+      BrOrRet(decoder, br_depth, 0);
+    }
+    END_IF
+    // Narrow type for the successful cast fallthrough branch.
+    Forward(decoder, object, value_on_fallthrough);
+  }
+
+  TrapId GetTrapIdForTrap(wasm::TrapReason reason) {
+    switch (reason) {
+#define TRAPREASON_TO_TRAPID(name)                                             \
+  case wasm::k##name:                                                          \
+    static_assert(                                                             \
+        static_cast<int>(TrapId::k##name) == wasm::WasmCode::kThrowWasm##name, \
+        "trap id mismatch");                                                   \
+    return TrapId::k##name;
+      FOREACH_WASM_TRAPREASON(TRAPREASON_TO_TRAPID)
+#undef TRAPREASON_TO_TRAPID
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  OpIndex WasmPositionToOpIndex(WasmCodePosition position) {
+    return OpIndex(sizeof(compiler::turboshaft::OperationStorageSlot) *
+                   static_cast<int>(position));
+  }
+
+  WasmCodePosition OpIndexToWasmPosition(OpIndex index) {
+    return index.valid()
+               ? static_cast<WasmCodePosition>(
+                     index.offset() /
+                     sizeof(compiler::turboshaft::OperationStorageSlot))
+               : kNoCodePosition;
+  }
+
+  Assembler& Asm() { return asm_; }
+
+  V<WasmInstanceObject> instance_node_;
+  std::unordered_map<TSBlock*, BlockPhis> block_phis_;
+  Assembler asm_;
+  std::vector<OpIndex> ssa_env_;
+  bool did_bailout_ = false;
+  compiler::NullCheckStrategy null_check_strategy_ =
+      trap_handler::IsTrapHandlerEnabled() && V8_STATIC_ROOTS_BOOL
+          ? compiler::NullCheckStrategy::kTrapHandler
+          : compiler::NullCheckStrategy::kExplicit;
+};
+
+V8_EXPORT_PRIVATE bool BuildTSGraph(AccountingAllocator* allocator,
+                                    const WasmFeatures& enabled,
+                                    const WasmModule* module,
+                                    WasmFeatures* detected,
+                                    const FunctionBody& body, Graph& graph,
+                                    compiler::NodeOriginTable* node_origins) {
+  Zone zone(allocator, ZONE_NAME);
+  WasmFullDecoder<Decoder::FullValidationTag, TurboshaftGraphBuildingInterface>
+      decoder(&zone, module, enabled, detected, body, graph, &zone,
+              node_origins);
+  decoder.Decode();
+  // Turboshaft runs with validation, but the function should already be
+  // validated, so graph building must always succeed, unless we bailed out.
+  DCHECK_IMPLIES(!decoder.ok(), decoder.interface().did_bailout());
+  return decoder.ok();
+}
+
+#undef LOAD_INSTANCE_FIELD
+#include "src/compiler/turboshaft/undef-assembler-macros.inc"
+
+}  // namespace v8::internal::wasm
diff --git a/deps/v8/src/wasm/turboshaft-graph-interface.h b/deps/v8/src/wasm/turboshaft-graph-interface.h
new file mode 100644
index 00000000000000..06744e0f5f157b
--- /dev/null
+++ b/deps/v8/src/wasm/turboshaft-graph-interface.h
@@ -0,0 +1,39 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#if !V8_ENABLE_WEBASSEMBLY
+#error This header should only be included if WebAssembly is enabled.
+#endif  // !V8_ENABLE_WEBASSEMBLY
+
+#ifndef V8_WASM_TURBOSHAFT_GRAPH_INTERFACE_H_
+#define V8_WASM_TURBOSHAFT_GRAPH_INTERFACE_H_
+
+#include "src/base/macros.h"
+
+namespace v8::internal {
+class AccountingAllocator;
+
+namespace compiler {
+class NodeOriginTable;
+namespace turboshaft {
+class Graph;
+}
+}  // namespace compiler
+
+namespace wasm {
+struct FunctionBody;
+class WasmFeatures;
+struct WasmModule;
+
+V8_EXPORT_PRIVATE bool BuildTSGraph(AccountingAllocator* allocator,
+                                    const WasmFeatures& enabled,
+                                    const WasmModule* module,
+                                    WasmFeatures* detected,
+                                    const FunctionBody& body,
+                                    compiler::turboshaft::Graph& graph,
+                                    compiler::NodeOriginTable* node_origins);
+}  // namespace wasm
+}  // namespace v8::internal
+
+#endif  // V8_WASM_TURBOSHAFT_GRAPH_INTERFACE_H_
diff --git a/deps/v8/src/wasm/value-type.h b/deps/v8/src/wasm/value-type.h
index e6a15eb81b389a..3e3761863d1613 100644
--- a/deps/v8/src/wasm/value-type.h
+++ b/deps/v8/src/wasm/value-type.h
@@ -148,6 +148,12 @@ class HeapType {
 
   constexpr bool is_bottom() const { return representation_ == kBottom; }
 
+  constexpr bool is_string_view() const {
+    return representation_ == kStringViewWtf8 ||
+           representation_ == kStringViewWtf16 ||
+           representation_ == kStringViewIter;
+  }
+
   std::string name() const {
     switch (representation_) {
       case kFunc:
@@ -431,12 +437,18 @@ class ValueType {
 
   constexpr bool is_bottom() const { return kind() == kBottom; }
 
-  // These can occur as the result of type propagation, but never in
-  // reachable control flow.
+  constexpr bool is_string_view() const {
+    return is_object_reference() && heap_type().is_string_view();
+  }
+
+  // Except for {bottom}, these can occur as the result of trapping type casts,
+  // type propagation, or trivially uninhabitable parameters/locals, but never
+  // in reachable control flow.
   constexpr bool is_uninhabited() const {
-    return is_non_nullable() && (is_reference_to(HeapType::kNone) ||
-                                 is_reference_to(HeapType::kNoExtern) ||
-                                 is_reference_to(HeapType::kNoFunc));
+    return is_bottom() ||
+           (is_non_nullable() && (is_reference_to(HeapType::kNone) ||
+                                  is_reference_to(HeapType::kNoExtern) ||
+                                  is_reference_to(HeapType::kNoFunc)));
   }
 
   constexpr bool is_packed() const { return wasm::is_packed(kind()); }
@@ -719,6 +731,7 @@ constexpr ValueType kWasmI31Ref = ValueType::RefNull(HeapType::kI31);
 constexpr ValueType kWasmStructRef = ValueType::RefNull(HeapType::kStruct);
 constexpr ValueType kWasmArrayRef = ValueType::RefNull(HeapType::kArray);
 constexpr ValueType kWasmStringRef = ValueType::RefNull(HeapType::kString);
+constexpr ValueType kWasmRefString = ValueType::Ref(HeapType::kString);
 constexpr ValueType kWasmStringViewWtf8 =
     ValueType::RefNull(HeapType::kStringViewWtf8);
 constexpr ValueType kWasmStringViewWtf16 =
@@ -732,6 +745,7 @@ constexpr ValueType kWasmNullFuncRef = ValueType::RefNull(HeapType::kNoFunc);
 
 // Constants used by the generic js-to-wasm wrapper.
 constexpr int kWasmValueKindBitsMask = (1u << ValueType::kKindBits) - 1;
+constexpr int kWasmHeapTypeBitsMask = (1u << ValueType::kHeapTypeBits) - 1;
 
 #define FOREACH_WASMVALUE_CTYPES(V) \
   V(kI32, int32_t)                  \
diff --git a/deps/v8/src/wasm/wasm-code-manager.cc b/deps/v8/src/wasm/wasm-code-manager.cc
index 5d4f0f5d622c09..bfee624b7e5bcb 100644
--- a/deps/v8/src/wasm/wasm-code-manager.cc
+++ b/deps/v8/src/wasm/wasm-code-manager.cc
@@ -35,6 +35,7 @@
 #include "src/wasm/module-compiler.h"
 #include "src/wasm/names-provider.h"
 #include "src/wasm/pgo.h"
+#include "src/wasm/std-object-sizes.h"
 #include "src/wasm/wasm-debug.h"
 #include "src/wasm/wasm-engine.h"
 #include "src/wasm/wasm-import-wrapper-cache.h"
@@ -187,13 +188,13 @@ int WasmCode::code_comments_size() const {
   return static_cast<int>(unpadded_binary_size_ - code_comments_offset_);
 }
 
-std::unique_ptr<const byte[]> WasmCode::ConcatenateBytes(
-    std::initializer_list<base::Vector<const byte>> vectors) {
+std::unique_ptr<const uint8_t[]> WasmCode::ConcatenateBytes(
+    std::initializer_list<base::Vector<const uint8_t>> vectors) {
   size_t total_size = 0;
   for (auto& vec : vectors) total_size += vec.size();
   // Use default-initialization (== no initialization).
-  std::unique_ptr<byte[]> result{new byte[total_size]};
-  byte* ptr = result.get();
+  std::unique_ptr<uint8_t[]> result{new uint8_t[total_size]};
+  uint8_t* ptr = result.get();
   for (auto& vec : vectors) {
     if (vec.empty()) continue;  // Avoid nullptr in {memcpy}.
     memcpy(ptr, vec.begin(), vec.size());
@@ -225,14 +226,22 @@ bool WasmCode::ShouldBeLogged(Isolate* isolate) {
   // The return value is cached in {WasmEngine::IsolateData::log_codes}. Ensure
   // to call {WasmEngine::EnableCodeLogging} if this return value would change
   // for any isolate. Otherwise we might lose code events.
-  return isolate->v8_file_logger()->is_listening_to_code_events() ||
-         isolate->logger()->is_listening_to_code_events() ||
-         isolate->is_profiling();
+  return isolate->IsLoggingCodeCreation();
 }
 
 std::string WasmCode::DebugName() const {
   if (IsAnonymous()) {
-    return "anonymous function";
+    switch (kind()) {
+      case kWasmFunction:
+        UNREACHABLE();
+      case kWasmToCapiWrapper:
+        return "wasm to C-API wrapper";
+      case kWasmToJsWrapper:
+        return "wasm to js wrapper";
+      case kJumpTable:
+        return "jump table";
+    }
+    UNREACHABLE();
   }
 
   ModuleWireBytes wire_bytes(native_module()->wire_bytes());
@@ -531,7 +540,7 @@ int WasmCode::GetSourceOffsetBefore(int code_offset) {
 std::pair<int, SourcePosition> WasmCode::GetInliningPosition(
     int inlining_id) const {
   const size_t elem_size = sizeof(int) + sizeof(SourcePosition);
-  const byte* start = inlining_positions().begin() + elem_size * inlining_id;
+  const uint8_t* start = inlining_positions().begin() + elem_size * inlining_id;
   DCHECK_LE(start, inlining_positions().end());
   std::pair<int, SourcePosition> result;
   std::memcpy(&result.first, start, sizeof result.first);
@@ -675,12 +684,12 @@ constexpr base::AddressRegion kUnrestrictedRegion{
 
 }  // namespace
 
-base::Vector<byte> WasmCodeAllocator::AllocateForCode(
+base::Vector<uint8_t> WasmCodeAllocator::AllocateForCode(
     NativeModule* native_module, size_t size) {
   return AllocateForCodeInRegion(native_module, size, kUnrestrictedRegion);
 }
 
-base::Vector<byte> WasmCodeAllocator::AllocateForCodeInRegion(
+base::Vector<uint8_t> WasmCodeAllocator::AllocateForCodeInRegion(
     NativeModule* native_module, size_t size, base::AddressRegion region) {
   DCHECK_LT(0, size);
   auto* code_manager = GetWasmCodeManager();
@@ -758,7 +767,7 @@ base::Vector<byte> WasmCodeAllocator::AllocateForCodeInRegion(
 
   TRACE_HEAP("Code alloc for %p: 0x%" PRIxPTR ",+%zu\n", this,
              code_space.begin(), size);
-  return {reinterpret_cast<byte*>(code_space.begin()), code_space.size()};
+  return {reinterpret_cast<uint8_t*>(code_space.begin()), code_space.size()};
 }
 
 void WasmCodeAllocator::FreeCode(base::Vector<WasmCode* const> codes) {
@@ -769,6 +778,8 @@ void WasmCodeAllocator::FreeCode(base::Vector<WasmCode* const> codes) {
     code_size += code->instructions().size();
     freed_regions.Merge(base::AddressRegion{code->instruction_start(),
                                             code->instructions().size()});
+    ThreadIsolation::UnregisterWasmAllocation(code->instruction_start(),
+                                              code->instructions().size());
   }
   freed_code_size_.fetch_add(code_size);
 
@@ -805,17 +816,6 @@ size_t WasmCodeAllocator::GetNumCodeSpaces() const {
   return owned_code_space_.size();
 }
 
-namespace {
-BoundsCheckStrategy GetBoundsChecks(const WasmModule* module) {
-  if (!v8_flags.wasm_bounds_checks) return kNoBoundsChecks;
-  if (v8_flags.wasm_enforce_bounds_checks) return kExplicitBoundsChecks;
-  // We do not have trap handler support for memory64 yet.
-  if (module->is_memory64) return kExplicitBoundsChecks;
-  if (trap_handler::IsTrapHandlerEnabled()) return kTrapHandler;
-  return kExplicitBoundsChecks;
-}
-}  // namespace
-
 NativeModule::NativeModule(const WasmFeatures& enabled,
                            DynamicTiering dynamic_tiering,
                            VirtualMemory code_space,
@@ -828,8 +828,7 @@ NativeModule::NativeModule(const WasmFeatures& enabled,
       enabled_features_(enabled),
       module_(std::move(module)),
       import_wrapper_cache_(std::unique_ptr<WasmImportWrapperCache>(
-          new WasmImportWrapperCache())),
-      bounds_checks_(GetBoundsChecks(module_.get())) {
+          new WasmImportWrapperCache())) {
   DCHECK(engine_scope_);
   // We receive a pointer to an empty {std::shared_ptr}, and install ourselve
   // there.
@@ -861,7 +860,7 @@ NativeModule::NativeModule(const WasmFeatures& enabled,
 
 void NativeModule::ReserveCodeTableForTesting(uint32_t max_functions) {
   WasmCodeRefScope code_ref_scope;
-  DCHECK_LE(module_->num_declared_functions, max_functions);
+  CHECK_LE(module_->num_declared_functions, max_functions);
   auto new_table = std::make_unique<WasmCode*[]>(max_functions);
   if (module_->num_declared_functions > 0) {
     memcpy(new_table.get(), code_table_.get(),
@@ -869,70 +868,75 @@ void NativeModule::ReserveCodeTableForTesting(uint32_t max_functions) {
   }
   code_table_ = std::move(new_table);
 
-  base::AddressRegion single_code_space_region;
   base::RecursiveMutexGuard guard(&allocation_mutex_);
   CHECK_EQ(1, code_space_data_.size());
-  single_code_space_region = code_space_data_[0].region;
-  // Re-allocate jump table.
+  base::AddressRegion single_code_space_region = code_space_data_[0].region;
+  // Re-allocate the near and far jump tables.
   main_jump_table_ = CreateEmptyJumpTableInRegionLocked(
       JumpTableAssembler::SizeForNumberOfSlots(max_functions),
       single_code_space_region);
+  CHECK(
+      single_code_space_region.contains(main_jump_table_->instruction_start()));
+  main_far_jump_table_ = CreateEmptyJumpTableInRegionLocked(
+      JumpTableAssembler::SizeForNumberOfFarJumpSlots(
+          WasmCode::kRuntimeStubCount,
+          NumWasmFunctionsInFarJumpTable(max_functions)),
+      single_code_space_region);
+  CHECK(single_code_space_region.contains(
+      main_far_jump_table_->instruction_start()));
   code_space_data_[0].jump_table = main_jump_table_;
-  CodeSpaceWriteScope code_space_write_scope(this);
   InitializeJumpTableForLazyCompilation(max_functions);
 }
 
-void NativeModule::LogWasmCodes(Isolate* isolate, Script script) {
+void NativeModule::LogWasmCodes(Isolate* isolate, Tagged<Script> script) {
   DisallowGarbageCollection no_gc;
   if (!WasmCode::ShouldBeLogged(isolate)) return;
 
   TRACE_EVENT1("v8.wasm", "wasm.LogWasmCodes", "functions",
                module_->num_declared_functions);
 
-  Object url_obj = script.name();
-  DCHECK(url_obj.IsString() || url_obj.IsUndefined());
+  Tagged<Object> url_obj = script->name();
+  DCHECK(IsString(url_obj) || IsUndefined(url_obj));
   std::unique_ptr<char[]> source_url =
-      url_obj.IsString() ? String::cast(url_obj).ToCString()
-                         : std::unique_ptr<char[]>(new char[1]{'\0'});
+      IsString(url_obj) ? String::cast(url_obj)->ToCString()
+                        : std::unique_ptr<char[]>(new char[1]{'\0'});
 
   // Log all owned code, not just the current entries in the code table. This
   // will also include import wrappers.
   WasmCodeRefScope code_ref_scope;
   for (auto& code : SnapshotAllOwnedCode()) {
-    code->LogCode(isolate, source_url.get(), script.id());
+    code->LogCode(isolate, source_url.get(), script->id());
   }
 }
 
 CompilationEnv NativeModule::CreateCompilationEnv() const {
-  return {module(), bounds_checks_, kRuntimeExceptionSupport, enabled_features_,
-          compilation_state()->dynamic_tiering()};
+  return {module(), enabled_features_, compilation_state()->dynamic_tiering()};
 }
 
 WasmCode* NativeModule::AddCodeForTesting(Handle<Code> code) {
-  CodeSpaceWriteScope code_space_write_scope(this);
   const size_t relocation_size = code->relocation_size();
-  base::OwnedVector<byte> reloc_info;
+  base::OwnedVector<uint8_t> reloc_info;
   if (relocation_size > 0) {
-    reloc_info = base::OwnedVector<byte>::Of(
-        base::Vector<byte>{code->relocation_start(), relocation_size});
+    reloc_info = base::OwnedVector<uint8_t>::Of(
+        base::Vector<uint8_t>{code->relocation_start(), relocation_size});
   }
   Handle<ByteArray> source_pos_table(code->source_position_table(),
-                                     code->instruction_stream().GetIsolate());
-  base::OwnedVector<byte> source_pos =
-      base::OwnedVector<byte>::NewForOverwrite(source_pos_table->length());
+                                     code->instruction_stream()->GetIsolate());
+  base::OwnedVector<uint8_t> source_pos =
+      base::OwnedVector<uint8_t>::NewForOverwrite(source_pos_table->length());
   if (source_pos_table->length() > 0) {
     source_pos_table->copy_out(0, source_pos.begin(),
                                source_pos_table->length());
   }
   static_assert(InstructionStream::kOnHeapBodyIsContiguous);
-  base::Vector<const byte> instructions(
-      reinterpret_cast<byte*>(code->body_start()),
+  base::Vector<const uint8_t> instructions(
+      reinterpret_cast<uint8_t*>(code->body_start()),
       static_cast<size_t>(code->body_size()));
   const int stack_slots = code->stack_slots();
 
   // Metadata offsets in InstructionStream objects are relative to the start of
   // the metadata section, whereas WasmCode expects offsets relative to
-  // InstructionStart.
+  // instruction_start.
   const int base_offset = code->instruction_size();
   // TODO(jgruber,v8:8758): Remove this translation. It exists only because
   // InstructionStream objects contains real offsets but WasmCode expects an
@@ -947,37 +951,42 @@ WasmCode* NativeModule::AddCodeForTesting(Handle<Code> code) {
   base::RecursiveMutexGuard guard{&allocation_mutex_};
   base::Vector<uint8_t> dst_code_bytes =
       code_allocator_.AllocateForCode(this, instructions.size());
-  memcpy(dst_code_bytes.begin(), instructions.begin(), instructions.size());
-
-  // Apply the relocation delta by iterating over the RelocInfo.
-  intptr_t delta = reinterpret_cast<Address>(dst_code_bytes.begin()) -
-                   code->InstructionStart();
-  int mode_mask =
-      RelocInfo::kApplyMask | RelocInfo::ModeMask(RelocInfo::WASM_STUB_CALL);
-  auto jump_tables_ref =
-      FindJumpTablesForRegionLocked(base::AddressRegionOf(dst_code_bytes));
-  Address dst_code_addr = reinterpret_cast<Address>(dst_code_bytes.begin());
-  Address constant_pool_start = dst_code_addr + constant_pool_offset;
-  RelocIterator orig_it(*code, mode_mask);
-  for (RelocIterator it(dst_code_bytes, reloc_info.as_vector(),
-                        constant_pool_start, mode_mask);
-       !it.done(); it.next(), orig_it.next()) {
-    RelocInfo::Mode mode = it.rinfo()->rmode();
-    if (RelocInfo::IsWasmStubCall(mode)) {
-      uint32_t stub_call_tag = orig_it.rinfo()->wasm_call_tag();
-      DCHECK_LT(stub_call_tag, WasmCode::kRuntimeStubCount);
-      Address entry = GetNearRuntimeStubEntry(
-          static_cast<WasmCode::RuntimeStubId>(stub_call_tag), jump_tables_ref);
-      it.rinfo()->set_wasm_stub_call_address(entry, SKIP_ICACHE_FLUSH);
-    } else {
-      it.rinfo()->apply(delta);
+  {
+    CodeSpaceWriteScope write_scope;
+    ThreadIsolation::RegisterWasmAllocation(
+        reinterpret_cast<Address>(dst_code_bytes.begin()), instructions.size());
+    memcpy(dst_code_bytes.begin(), instructions.begin(), instructions.size());
+
+    // Apply the relocation delta by iterating over the RelocInfo.
+    intptr_t delta = reinterpret_cast<Address>(dst_code_bytes.begin()) -
+                     code->instruction_start();
+    int mode_mask =
+        RelocInfo::kApplyMask | RelocInfo::ModeMask(RelocInfo::WASM_STUB_CALL);
+    auto jump_tables_ref =
+        FindJumpTablesForRegionLocked(base::AddressRegionOf(dst_code_bytes));
+    Address dst_code_addr = reinterpret_cast<Address>(dst_code_bytes.begin());
+    Address constant_pool_start = dst_code_addr + constant_pool_offset;
+    RelocIterator orig_it(*code, mode_mask);
+    for (RelocIterator it(dst_code_bytes, reloc_info.as_vector(),
+                          constant_pool_start, mode_mask);
+         !it.done(); it.next(), orig_it.next()) {
+      RelocInfo::Mode mode = it.rinfo()->rmode();
+      if (RelocInfo::IsWasmStubCall(mode)) {
+        uint32_t stub_call_tag = orig_it.rinfo()->wasm_call_tag();
+        DCHECK_LT(stub_call_tag, WasmCode::kRuntimeStubCount);
+        Address entry = GetNearRuntimeStubEntry(
+            static_cast<WasmCode::RuntimeStubId>(stub_call_tag),
+            jump_tables_ref);
+        it.rinfo()->set_wasm_stub_call_address(entry, SKIP_ICACHE_FLUSH);
+      } else {
+        it.rinfo()->apply(delta);
+      }
     }
   }
 
   // Flush the i-cache after relocation.
   FlushInstructionCache(dst_code_bytes.begin(), dst_code_bytes.size());
 
-  // FIXME(mliedtke): Get inlining positions from input.
   std::unique_ptr<WasmCode> new_code{
       new WasmCode{this,                     // native_module
                    kAnonymousFuncIndex,      // index
@@ -1006,13 +1015,12 @@ void NativeModule::InitializeJumpTableForLazyCompilation(
     uint32_t num_wasm_functions) {
   if (!num_wasm_functions) return;
   allocation_mutex_.AssertHeld();
-  DCHECK(CodeSpaceWriteScope::IsInScope());
 
   DCHECK_NULL(lazy_compile_table_);
   lazy_compile_table_ = CreateEmptyJumpTableLocked(
       JumpTableAssembler::SizeForNumberOfLazyFunctions(num_wasm_functions));
 
-  DCHECK_EQ(1, code_space_data_.size());
+  CHECK_EQ(1, code_space_data_.size());
   const CodeSpaceData& code_space_data = code_space_data_[0];
   DCHECK_NOT_NULL(code_space_data.jump_table);
   DCHECK_NOT_NULL(code_space_data.far_jump_table);
@@ -1021,6 +1029,7 @@ void NativeModule::InitializeJumpTableForLazyCompilation(
       code_space_data.far_jump_table->instruction_start() +
       JumpTableAssembler::FarJumpSlotIndexToOffset(WasmCode::kWasmCompileLazy);
 
+  CodeSpaceWriteScope write_scope;
   JumpTableAssembler::GenerateLazyCompileTable(
       lazy_compile_table_->instruction_start(), num_wasm_functions,
       module_->num_imported_functions, compile_lazy_address);
@@ -1037,7 +1046,6 @@ void NativeModule::UseLazyStubLocked(uint32_t func_index) {
             module_->num_imported_functions + module_->num_declared_functions);
   // Avoid opening a new write scope per function. The caller should hold the
   // scope instead.
-  DCHECK(CodeSpaceWriteScope::IsInScope());
 
   DCHECK_NOT_NULL(lazy_compile_table_);
 
@@ -1053,11 +1061,11 @@ void NativeModule::UseLazyStubLocked(uint32_t func_index) {
 std::unique_ptr<WasmCode> NativeModule::AddCode(
     int index, const CodeDesc& desc, int stack_slots,
     uint32_t tagged_parameter_slots,
-    base::Vector<const byte> protected_instructions_data,
-    base::Vector<const byte> source_position_table, WasmCode::Kind kind,
+    base::Vector<const uint8_t> protected_instructions_data,
+    base::Vector<const uint8_t> source_position_table, WasmCode::Kind kind,
     ExecutionTier tier, ForDebugging for_debugging) {
-  base::Vector<byte> code_space;
-  base::Vector<byte> inlining_positions;
+  base::Vector<uint8_t> code_space;
+  base::Vector<uint8_t> inlining_positions;
   NativeModule::JumpTablesRef jump_table_ref;
   {
     base::RecursiveMutexGuard guard{&allocation_mutex_};
@@ -1068,6 +1076,11 @@ std::unique_ptr<WasmCode> NativeModule::AddCode(
   // Only Liftoff code can have the {frame_has_feedback_slot} bit set.
   DCHECK_NE(tier, ExecutionTier::kLiftoff);
   bool frame_has_feedback_slot = false;
+  {
+    CodeSpaceWriteScope write_scope;
+    ThreadIsolation::RegisterWasmAllocation(
+        reinterpret_cast<Address>(code_space.begin()), desc.instr_size);
+  }
   return AddCodeWithCodeSpace(index, desc, stack_slots, tagged_parameter_slots,
                               protected_instructions_data,
                               source_position_table, inlining_positions, kind,
@@ -1078,13 +1091,13 @@ std::unique_ptr<WasmCode> NativeModule::AddCode(
 std::unique_ptr<WasmCode> NativeModule::AddCodeWithCodeSpace(
     int index, const CodeDesc& desc, int stack_slots,
     uint32_t tagged_parameter_slots,
-    base::Vector<const byte> protected_instructions_data,
-    base::Vector<const byte> source_position_table,
-    base::Vector<const byte> inlining_positions, WasmCode::Kind kind,
+    base::Vector<const uint8_t> protected_instructions_data,
+    base::Vector<const uint8_t> source_position_table,
+    base::Vector<const uint8_t> inlining_positions, WasmCode::Kind kind,
     ExecutionTier tier, ForDebugging for_debugging,
     bool frame_has_feedback_slot, base::Vector<uint8_t> dst_code_bytes,
     const JumpTablesRef& jump_tables) {
-  base::Vector<byte> reloc_info{
+  base::Vector<uint8_t> reloc_info{
       desc.buffer + desc.buffer_size - desc.reloc_size,
       static_cast<size_t>(desc.reloc_size)};
   UpdateCodeSize(desc.instr_size, tier, for_debugging);
@@ -1099,32 +1112,36 @@ std::unique_ptr<WasmCode> NativeModule::AddCodeWithCodeSpace(
   const int code_comments_offset = desc.code_comments_offset;
   const int instr_size = desc.instr_size;
 
-  memcpy(dst_code_bytes.begin(), desc.buffer,
-         static_cast<size_t>(desc.instr_size));
-
-  // Apply the relocation delta by iterating over the RelocInfo.
-  intptr_t delta = dst_code_bytes.begin() - desc.buffer;
-  int mode_mask = RelocInfo::kApplyMask |
-                  RelocInfo::ModeMask(RelocInfo::WASM_CALL) |
-                  RelocInfo::ModeMask(RelocInfo::WASM_STUB_CALL);
-  Address code_start = reinterpret_cast<Address>(dst_code_bytes.begin());
-  Address constant_pool_start = code_start + constant_pool_offset;
-  for (RelocIterator it(dst_code_bytes, reloc_info, constant_pool_start,
-                        mode_mask);
-       !it.done(); it.next()) {
-    RelocInfo::Mode mode = it.rinfo()->rmode();
-    if (RelocInfo::IsWasmCall(mode)) {
-      uint32_t call_tag = it.rinfo()->wasm_call_tag();
-      Address target = GetNearCallTargetForFunction(call_tag, jump_tables);
-      it.rinfo()->set_wasm_call_address(target, SKIP_ICACHE_FLUSH);
-    } else if (RelocInfo::IsWasmStubCall(mode)) {
-      uint32_t stub_call_tag = it.rinfo()->wasm_call_tag();
-      DCHECK_LT(stub_call_tag, WasmCode::kRuntimeStubCount);
-      Address entry = GetNearRuntimeStubEntry(
-          static_cast<WasmCode::RuntimeStubId>(stub_call_tag), jump_tables);
-      it.rinfo()->set_wasm_stub_call_address(entry, SKIP_ICACHE_FLUSH);
-    } else {
-      it.rinfo()->apply(delta);
+  {
+    CodeSpaceWriteScope write_scope;
+    memcpy(dst_code_bytes.begin(), desc.buffer,
+           static_cast<size_t>(desc.instr_size));
+
+    // Apply the relocation delta by iterating over the RelocInfo.
+    intptr_t delta = dst_code_bytes.begin() - desc.buffer;
+    int mode_mask = RelocInfo::kApplyMask |
+                    RelocInfo::ModeMask(RelocInfo::WASM_CALL) |
+                    RelocInfo::ModeMask(RelocInfo::WASM_STUB_CALL);
+    Address code_start = reinterpret_cast<Address>(dst_code_bytes.begin());
+    Address constant_pool_start = code_start + constant_pool_offset;
+
+    for (RelocIterator it(dst_code_bytes, reloc_info, constant_pool_start,
+                          mode_mask);
+         !it.done(); it.next()) {
+      RelocInfo::Mode mode = it.rinfo()->rmode();
+      if (RelocInfo::IsWasmCall(mode)) {
+        uint32_t call_tag = it.rinfo()->wasm_call_tag();
+        Address target = GetNearCallTargetForFunction(call_tag, jump_tables);
+        it.rinfo()->set_wasm_call_address(target, SKIP_ICACHE_FLUSH);
+      } else if (RelocInfo::IsWasmStubCall(mode)) {
+        uint32_t stub_call_tag = it.rinfo()->wasm_call_tag();
+        DCHECK_LT(stub_call_tag, WasmCode::kRuntimeStubCount);
+        Address entry = GetNearRuntimeStubEntry(
+            static_cast<WasmCode::RuntimeStubId>(stub_call_tag), jump_tables);
+        it.rinfo()->set_wasm_stub_call_address(entry, SKIP_ICACHE_FLUSH);
+      } else {
+        it.rinfo()->apply(delta);
+      }
     }
   }
 
@@ -1168,7 +1185,6 @@ WasmCode* NativeModule::PublishCode(std::unique_ptr<WasmCode> code,
       }
     }
   }
-  CodeSpaceWriteScope code_space_write_scope(this);
   return PublishCodeLocked(std::move(code));
 }
 
@@ -1176,7 +1192,6 @@ std::vector<WasmCode*> NativeModule::PublishCode(
     base::Vector<std::unique_ptr<WasmCode>> codes) {
   // Publishing often happens in a loop, so the caller should hold the
   // {CodeSpaceWriteScope} outside of such a loop.
-  DCHECK(CodeSpaceWriteScope::IsInScope());
   TRACE_EVENT1(TRACE_DISABLED_BY_DEFAULT("v8.wasm.detailed"),
                "wasm.PublishCode", "number", codes.size());
   std::vector<WasmCode*> published_code;
@@ -1306,7 +1321,6 @@ void NativeModule::ReinstallDebugCode(WasmCode* code) {
   code_table_[slot_idx] = code;
   code->IncRef();
 
-  CodeSpaceWriteScope code_space_write_scope(this);
   PatchJumpTablesLocked(slot_idx, code->instruction_start());
 }
 
@@ -1321,14 +1335,14 @@ NativeModule::AllocateForDeserializedCode(size_t total_code_size) {
 }
 
 std::unique_ptr<WasmCode> NativeModule::AddDeserializedCode(
-    int index, base::Vector<byte> instructions, int stack_slots,
+    int index, base::Vector<uint8_t> instructions, int stack_slots,
     uint32_t tagged_parameter_slots, int safepoint_table_offset,
     int handler_table_offset, int constant_pool_offset,
     int code_comments_offset, int unpadded_binary_size,
-    base::Vector<const byte> protected_instructions_data,
-    base::Vector<const byte> reloc_info,
-    base::Vector<const byte> source_position_table,
-    base::Vector<const byte> inlining_positions, WasmCode::Kind kind,
+    base::Vector<const uint8_t> protected_instructions_data,
+    base::Vector<const uint8_t> reloc_info,
+    base::Vector<const uint8_t> source_position_table,
+    base::Vector<const uint8_t> inlining_positions, WasmCode::Kind kind,
     ExecutionTier tier) {
   UpdateCodeSize(instructions.size(), tier, kNotForDebugging);
 
@@ -1403,12 +1417,14 @@ WasmCode* NativeModule::CreateEmptyJumpTableInRegionLocked(
   allocation_mutex_.AssertHeld();
   // Only call this if we really need a jump table.
   DCHECK_LT(0, jump_table_size);
-  CodeSpaceWriteScope code_space_write_scope(this);
   base::Vector<uint8_t> code_space =
       code_allocator_.AllocateForCodeInRegion(this, jump_table_size, region);
   DCHECK(!code_space.empty());
   UpdateCodeSize(jump_table_size, ExecutionTier::kNone, kNotForDebugging);
-  ZapCode(reinterpret_cast<Address>(code_space.begin()), code_space.size());
+  {
+    wasm::CodeSpaceWriteScope code_write_scope;
+    ZapCode(reinterpret_cast<Address>(code_space.begin()), code_space.size());
+  }
   std::unique_ptr<WasmCode> code{
       new WasmCode{this,                  // native_module
                    kAnonymousFuncIndex,   // index
@@ -1427,6 +1443,8 @@ WasmCode* NativeModule::CreateEmptyJumpTableInRegionLocked(
                    WasmCode::kJumpTable,  // kind
                    ExecutionTier::kNone,  // tier
                    kNotForDebugging}};    // for_debugging
+  ThreadIsolation::RegisterWasmAllocation(
+      reinterpret_cast<Address>(code_space.begin()), code_space.size());
   return PublishCodeLocked(std::move(code));
 }
 
@@ -1442,6 +1460,7 @@ void NativeModule::UpdateCodeSize(size_t size, ExecutionTier tier,
 void NativeModule::PatchJumpTablesLocked(uint32_t slot_index, Address target) {
   allocation_mutex_.AssertHeld();
 
+  CodeSpaceWriteScope write_scope;
   for (auto& code_space_data : code_space_data_) {
     DCHECK_IMPLIES(code_space_data.jump_table, code_space_data.far_jump_table);
     if (!code_space_data.jump_table) continue;
@@ -1484,7 +1503,6 @@ void NativeModule::AddCodeSpaceLocked(base::AddressRegion region) {
   DCHECK_GE(region.size(),
             2 * OverheadPerCodeSpace(module()->num_declared_functions));
 
-  CodeSpaceWriteScope code_space_write_scope(this);
 #if defined(V8_OS_WIN64)
   // On some platforms, specifically Win64, we need to reserve some pages at
   // the beginning of an executable space.
@@ -1494,7 +1512,7 @@ void NativeModule::AddCodeSpaceLocked(base::AddressRegion region) {
   if (WasmCodeManager::CanRegisterUnwindInfoForNonABICompliantCodeRange()) {
     size_t size = Heap::GetCodeRangeReservedAreaSize();
     DCHECK_LT(0, size);
-    base::Vector<byte> padding =
+    base::Vector<uint8_t> padding =
         code_allocator_.AllocateForCodeInRegion(this, size, region);
     CHECK_EQ(reinterpret_cast<Address>(padding.begin()), region.begin());
     win64_unwindinfo::RegisterNonABICompliantCodeRange(
@@ -1513,18 +1531,28 @@ void NativeModule::AddCodeSpaceLocked(base::AddressRegion region) {
   const bool needs_jump_table = num_wasm_functions > 0 && needs_far_jump_table;
 
   if (needs_jump_table) {
-    jump_table = CreateEmptyJumpTableInRegionLocked(
-        JumpTableAssembler::SizeForNumberOfSlots(num_wasm_functions), region);
+    // Allocate additional jump tables just as big as the first one.
+    // This is in particular needed in cctests which add functions to the module
+    // after the jump tables are already created (see https://crbug.com/v8/14213
+    // and {NativeModule::ReserveCodeTableForTesting}.
+    int jump_table_size =
+        is_first_code_space
+            ? JumpTableAssembler::SizeForNumberOfSlots(num_wasm_functions)
+            : main_jump_table_->instructions_size_;
+    jump_table = CreateEmptyJumpTableInRegionLocked(jump_table_size, region);
     CHECK(region.contains(jump_table->instruction_start()));
   }
 
   if (needs_far_jump_table) {
     int num_function_slots = NumWasmFunctionsInFarJumpTable(num_wasm_functions);
-    far_jump_table = CreateEmptyJumpTableInRegionLocked(
-        JumpTableAssembler::SizeForNumberOfFarJumpSlots(
-            WasmCode::kRuntimeStubCount,
-            NumWasmFunctionsInFarJumpTable(num_function_slots)),
-        region);
+    // See comment above for the size computation.
+    int far_jump_table_size =
+        is_first_code_space
+            ? JumpTableAssembler::SizeForNumberOfFarJumpSlots(
+                  WasmCode::kRuntimeStubCount, num_function_slots)
+            : main_far_jump_table_->instructions_size_;
+    far_jump_table =
+        CreateEmptyJumpTableInRegionLocked(far_jump_table_size, region);
     CHECK(region.contains(far_jump_table->instruction_start()));
     EmbeddedData embedded_data = EmbeddedData::FromBlob();
 #define RUNTIME_STUB(Name) Builtin::k##Name,
@@ -1537,8 +1565,9 @@ void NativeModule::AddCodeSpaceLocked(base::AddressRegion region) {
     Address builtin_addresses[WasmCode::kRuntimeStubCount];
     for (int i = 0; i < WasmCode::kRuntimeStubCount; ++i) {
       Builtin builtin = stub_names[i];
-      builtin_addresses[i] = embedded_data.InstructionStartOfBuiltin(builtin);
+      builtin_addresses[i] = embedded_data.InstructionStartOf(builtin);
     }
+    CodeSpaceWriteScope write_scope;
     JumpTableAssembler::GenerateFarJumpTable(
         far_jump_table->instruction_start(), builtin_addresses,
         WasmCode::kRuntimeStubCount, num_function_slots);
@@ -1562,6 +1591,7 @@ void NativeModule::AddCodeSpaceLocked(base::AddressRegion region) {
     // Patch the new jump table(s) with existing functions. If this is the first
     // code space, there cannot be any functions that have been compiled yet.
     const CodeSpaceData& new_code_space_data = code_space_data_.back();
+    CodeSpaceWriteScope write_scope;
     for (uint32_t slot_index = 0; slot_index < num_wasm_functions;
          ++slot_index) {
       if (code_table_[slot_index]) {
@@ -1777,12 +1807,14 @@ NativeModule::~NativeModule() {
   // Cancel all background compilation before resetting any field of the
   // NativeModule or freeing anything.
   compilation_state_->CancelCompilation();
-  GetWasmEngine()->FreeNativeModule(this);
+
   // Free the import wrapper cache before releasing the {WasmCode} objects in
   // {owned_code_}. The destructor of {WasmImportWrapperCache} still needs to
   // decrease reference counts on the {WasmCode} objects.
   import_wrapper_cache_.reset();
 
+  GetWasmEngine()->FreeNativeModule(this);
+
   // If experimental PGO support is enabled, serialize the PGO data now.
   if (V8_UNLIKELY(v8_flags.experimental_wasm_pgo_to_file)) {
     DumpProfileToFile(module_.get(), wire_bytes(), tiering_budgets_.get());
@@ -1841,15 +1873,17 @@ void WasmCodeManager::Commit(base::AddressRegion region) {
 
   bool success = false;
   if (MemoryProtectionKeysEnabled()) {
-    DCHECK(CodeSpaceWriteScope::IsInScope());
 #if V8_HAS_PKU_JIT_WRITE_PROTECT
     TRACE_HEAP(
         "Setting rwx permissions and memory protection key for 0x%" PRIxPTR
         ":0x%" PRIxPTR "\n",
         region.begin(), region.end());
-    success = base::MemoryProtectionKey::SetPermissionsAndKey(
-        GetPlatformPageAllocator(), region, permission,
-        RwxMemoryWriteScope::memory_protection_key());
+    if (ThreadIsolation::Enabled()) {
+      success = ThreadIsolation::MakeExecutable(region.begin(), region.size());
+    } else {
+      success = base::MemoryProtectionKey::SetPermissionsAndKey(
+          region, permission, RwxMemoryWriteScope::memory_protection_key());
+    }
 #else
     UNREACHABLE();
 #endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
@@ -1913,6 +1947,8 @@ VirtualMemory WasmCodeManager::TryAllocate(size_t size, void* hint) {
   TRACE_HEAP("VMem alloc: 0x%" PRIxPTR ":0x%" PRIxPTR " (%zu)\n", mem.address(),
              mem.end(), mem.size());
 
+  ThreadIsolation::RegisterJitPage(mem.address(), mem.size());
+
   // TODO(v8:8462): Remove eager commit once perf supports remapping.
   if (v8_flags.perf_prof) {
     SetPermissions(GetPlatformPageAllocator(), mem.address(), mem.size(),
@@ -2037,7 +2073,7 @@ size_t WasmCodeManager::EstimateNativeModuleCodeSize(
 // static
 size_t WasmCodeManager::EstimateNativeModuleMetaDataSize(
     const WasmModule* module) {
-  size_t wasm_module_estimate = EstimateStoredSize(module);
+  size_t wasm_module_estimate = module->EstimateStoredSize();
 
   uint32_t num_wasm_functions = module->num_declared_functions;
 
@@ -2069,8 +2105,7 @@ bool WasmCodeManager::HasMemoryProtectionKeySupport() {
 
 // static
 bool WasmCodeManager::MemoryProtectionKeysEnabled() {
-  return HasMemoryProtectionKeySupport() &&
-         v8_flags.wasm_memory_protection_keys;
+  return HasMemoryProtectionKeySupport();
 }
 
 // static
@@ -2082,48 +2117,6 @@ bool WasmCodeManager::MemoryProtectionKeyWritable() {
 #endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
 }
 
-base::AddressRegion WasmCodeManager::AllocateAssemblerBufferSpace(int size) {
-#if V8_HAS_PKU_JIT_WRITE_PROTECT
-  if (MemoryProtectionKeysEnabled()) {
-    auto* page_allocator = GetPlatformPageAllocator();
-    size_t page_size = page_allocator->AllocatePageSize();
-    size = RoundUp(size, page_size);
-    void* mapped = AllocatePages(page_allocator, nullptr, size, page_size,
-                                 PageAllocator::kNoAccess);
-    if (V8_UNLIKELY(!mapped)) {
-      auto oom_detail = base::FormattedString{}
-                        << "cannot allocate " << size
-                        << " more bytes for assembler buffers";
-      V8::FatalProcessOutOfMemory(nullptr,
-                                  "Allocate protected assembler buffer space",
-                                  oom_detail.PrintToArray().data());
-      UNREACHABLE();
-    }
-    auto region =
-        base::AddressRegionOf(reinterpret_cast<uint8_t*>(mapped), size);
-    CHECK(base::MemoryProtectionKey::SetPermissionsAndKey(
-        page_allocator, region, PageAllocator::kReadWrite,
-        RwxMemoryWriteScope::memory_protection_key()));
-    return region;
-  }
-#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
-  DCHECK(!MemoryProtectionKeysEnabled());
-  return base::AddressRegionOf(new uint8_t[size], size);
-}
-
-void WasmCodeManager::FreeAssemblerBufferSpace(base::AddressRegion region) {
-#if V8_HAS_PKU_JIT_WRITE_PROTECT
-  if (MemoryProtectionKeysEnabled()) {
-    auto* page_allocator = GetPlatformPageAllocator();
-    FreePages(page_allocator, reinterpret_cast<void*>(region.begin()),
-              region.size());
-    return;
-  }
-#endif  // V8_HAS_PKU_JIT_WRITE_PROTECT
-  DCHECK(!MemoryProtectionKeysEnabled());
-  delete[] reinterpret_cast<uint8_t*>(region.begin());
-}
-
 std::shared_ptr<NativeModule> WasmCodeManager::NewNativeModule(
     Isolate* isolate, const WasmFeatures& enabled, size_t code_size_estimate,
     std::shared_ptr<const WasmModule> module) {
@@ -2205,13 +2198,13 @@ void NativeModule::SampleCodeSize(Counters* counters) const {
 }
 
 std::unique_ptr<WasmCode> NativeModule::AddCompiledCode(
-    WasmCompilationResult result) {
+    const WasmCompilationResult& result) {
   std::vector<std::unique_ptr<WasmCode>> code = AddCompiledCode({&result, 1});
   return std::move(code[0]);
 }
 
 std::vector<std::unique_ptr<WasmCode>> NativeModule::AddCompiledCode(
-    base::Vector<WasmCompilationResult> results) {
+    base::Vector<const WasmCompilationResult> results) {
   TRACE_EVENT1(TRACE_DISABLED_BY_DEFAULT("v8.wasm.detailed"),
                "wasm.AddCompiledCode", "num", results.size());
   DCHECK(!results.empty());
@@ -2248,9 +2241,8 @@ std::vector<std::unique_ptr<WasmCode>> NativeModule::AddCompiledCode(
     }
     total_code_space += new_code_space;
   }
-  base::Vector<byte> code_space;
+  base::Vector<uint8_t> code_space;
   NativeModule::JumpTablesRef jump_tables;
-  CodeSpaceWriteScope code_space_write_scope(this);
   {
     base::RecursiveMutexGuard guard{&allocation_mutex_};
     code_space = code_allocator_.AllocateForCode(this, total_code_space);
@@ -2264,11 +2256,19 @@ std::vector<std::unique_ptr<WasmCode>> NativeModule::AddCompiledCode(
   // {results} vector in smaller chunks).
   CHECK(jump_tables.is_valid());
 
+  std::vector<size_t> sizes;
+  for (const auto& result : results) {
+    sizes.emplace_back(RoundUp<kCodeAlignment>(result.code_desc.instr_size));
+  }
+  ThreadIsolation::RegisterJitAllocations(
+      reinterpret_cast<Address>(code_space.begin()), sizes,
+      ThreadIsolation::JitAllocationType::kWasmCode);
+
   // Now copy the generated code into the code space and relocate it.
   for (auto& result : results) {
     DCHECK_EQ(result.code_desc.buffer, result.instr_buffer->start());
     size_t code_size = RoundUp<kCodeAlignment>(result.code_desc.instr_size);
-    base::Vector<byte> this_code_space = code_space.SubVector(0, code_size);
+    base::Vector<uint8_t> this_code_space = code_space.SubVector(0, code_size);
     code_space += code_size;
     generated_code.emplace_back(AddCodeWithCodeSpace(
         result.func_index, result.code_desc, result.frame_slot_count,
@@ -2322,7 +2322,6 @@ void NativeModule::RemoveCompiledCode(RemoveFilter filter) {
   const uint32_t num_imports = module_->num_imported_functions;
   const uint32_t num_functions = module_->num_declared_functions;
   WasmCodeRefScope ref_scope;
-  CodeSpaceWriteScope write_scope(this);
   base::RecursiveMutexGuard guard(&allocation_mutex_);
   for (uint32_t i = 0; i < num_functions; i++) {
     WasmCode* code = code_table_[i];
@@ -2388,6 +2387,47 @@ NamesProvider* NativeModule::GetNamesProvider() {
   return names_provider_.get();
 }
 
+size_t NativeModule::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(NativeModule, 440);
+  size_t result = sizeof(NativeModule);
+  result += module_->EstimateCurrentMemoryConsumption();
+
+  size_t wire_bytes_size = wire_bytes_ ? wire_bytes_->size() : 0;
+  result += wire_bytes_size;
+
+  if (source_map_) {
+    result += source_map_->EstimateCurrentMemoryConsumption();
+  }
+  result += compilation_state_->EstimateCurrentMemoryConsumption();
+  result += import_wrapper_cache_->EstimateCurrentMemoryConsumption();
+  // For {tiering_budgets_}.
+  result += module_->num_declared_functions * sizeof(uint32_t);
+
+  {
+    base::RecursiveMutexGuard lock(&allocation_mutex_);
+    result += ContentSize(owned_code_);
+    result += ContentSize(new_owned_code_);
+    // For {code_table_}.
+    result += module_->num_declared_functions * sizeof(void*);
+    result += ContentSize(code_space_data_);
+    if (debug_info_) {
+      result += debug_info_->EstimateCurrentMemoryConsumption();
+    }
+    if (names_provider_) {
+      result += names_provider_->EstimateCurrentMemoryConsumption();
+    }
+    if (cached_code_) {
+      result += ContentSize(*cached_code_.get());
+    }
+  }
+
+  if (v8_flags.trace_wasm_offheap_memory) {
+    PrintF("NativeModule wire bytes: %zu\n", wire_bytes_size);
+    PrintF("NativeModule: %zu\n", result);
+  }
+  return result;
+}
+
 void WasmCodeManager::FreeNativeModule(
     base::Vector<VirtualMemory> owned_code_space, size_t committed_size) {
   base::MutexGuard lock(&native_modules_mutex_);
@@ -2404,6 +2444,7 @@ void WasmCodeManager::FreeNativeModule(
 #endif  // V8_OS_WIN64
 
     lookup_map_.erase(code_space.address());
+    ThreadIsolation::UnregisterJitPage(code_space.address(), code_space.size());
     code_space.Free();
     DCHECK(!code_space.IsReserved());
   }
@@ -2471,6 +2512,13 @@ Builtin RuntimeStubIdToBuiltinName(WasmCode::RuntimeStubId stub_id) {
 #undef RUNTIME_STUB_NAME_TRAP
   static_assert(arraysize(builtin_names) == WasmCode::kRuntimeStubCount);
 
+#define RUNTIME_STUB_NAME(Name) \
+  static_assert(Builtin::k##Name == builtin_names[wasm::WasmCode::k##Name]);
+#define RUNTIME_STUB_NAME_TRAP(Name) RUNTIME_STUB_NAME(ThrowWasm##Name)
+  WASM_RUNTIME_STUB_LIST(RUNTIME_STUB_NAME, RUNTIME_STUB_NAME_TRAP);
+#undef RUNTIME_STUB_NAME
+#undef RUNTIME_STUB_NAME_TRAP
+
   DCHECK_GT(arraysize(builtin_names), stub_id);
   return builtin_names[stub_id];
 }
diff --git a/deps/v8/src/wasm/wasm-code-manager.h b/deps/v8/src/wasm/wasm-code-manager.h
index 251d19b3647096..dd6220495a49ae 100644
--- a/deps/v8/src/wasm/wasm-code-manager.h
+++ b/deps/v8/src/wasm/wasm-code-manager.h
@@ -70,6 +70,7 @@ enum class WellKnownImport : uint8_t;
   V(WasmI64AtomicWait)                   \
   V(WasmGetOwnProperty)                  \
   V(WasmRefFunc)                         \
+  V(WasmInternalFunctionCreateExternal)  \
   V(WasmMemoryGrow)                      \
   V(WasmTableInit)                       \
   V(WasmTableCopy)                       \
@@ -121,8 +122,8 @@ enum class WellKnownImport : uint8_t;
   V(WasmArrayCopy)                       \
   V(WasmArrayCopyWithChecks)             \
   V(WasmArrayNewSegment)                 \
+  V(WasmArrayInitSegment)                \
   V(WasmAllocateStructWithRtt)           \
-  V(WasmSubtypeCheck)                    \
   V(WasmOnStackReplace)                  \
   V(WasmSuspend)                         \
   V(WasmStringNewWtf8)                   \
@@ -137,6 +138,7 @@ enum class WellKnownImport : uint8_t;
   V(WasmStringIsUSVSequence)             \
   V(WasmStringAsWtf16)                   \
   V(WasmStringViewWtf16GetCodeUnit)      \
+  V(WasmStringCodePointAt)               \
   V(WasmStringViewWtf16Encode)           \
   V(WasmStringViewWtf16Slice)            \
   V(WasmStringNewWtf8Array)              \
@@ -271,21 +273,21 @@ class V8_EXPORT_PRIVATE WasmCode final {
   }
 #endif  // V8_IS_TSAN
 
-  base::Vector<byte> instructions() const {
+  base::Vector<uint8_t> instructions() const {
     return base::VectorOf(instructions_,
                           static_cast<size_t>(instructions_size_));
   }
   Address instruction_start() const {
     return reinterpret_cast<Address>(instructions_);
   }
-  base::Vector<const byte> reloc_info() const {
+  base::Vector<const uint8_t> reloc_info() const {
     return {protected_instructions_data().end(),
             static_cast<size_t>(reloc_info_size_)};
   }
-  base::Vector<const byte> source_positions() const {
+  base::Vector<const uint8_t> source_positions() const {
     return {reloc_info().end(), static_cast<size_t>(source_positions_size_)};
   }
-  base::Vector<const byte> inlining_positions() const {
+  base::Vector<const uint8_t> inlining_positions() const {
     return {source_positions().end(),
             static_cast<size_t>(inlining_positions_size_)};
   }
@@ -420,14 +422,14 @@ class V8_EXPORT_PRIVATE WasmCode final {
   friend class NativeModule;
 
   WasmCode(NativeModule* native_module, int index,
-           base::Vector<byte> instructions, int stack_slots,
+           base::Vector<uint8_t> instructions, int stack_slots,
            uint32_t tagged_parameter_slots, int safepoint_table_offset,
            int handler_table_offset, int constant_pool_offset,
            int code_comments_offset, int unpadded_binary_size,
-           base::Vector<const byte> protected_instructions_data,
-           base::Vector<const byte> reloc_info,
-           base::Vector<const byte> source_position_table,
-           base::Vector<const byte> inlining_positions, Kind kind,
+           base::Vector<const uint8_t> protected_instructions_data,
+           base::Vector<const uint8_t> reloc_info,
+           base::Vector<const uint8_t> source_position_table,
+           base::Vector<const uint8_t> inlining_positions, Kind kind,
            ExecutionTier tier, ForDebugging for_debugging,
            bool frame_has_feedback_slot = false)
       : native_module_(native_module),
@@ -457,8 +459,8 @@ class V8_EXPORT_PRIVATE WasmCode final {
     DCHECK_LE(constant_pool_offset, unpadded_binary_size);
   }
 
-  std::unique_ptr<const byte[]> ConcatenateBytes(
-      std::initializer_list<base::Vector<const byte>>);
+  std::unique_ptr<const uint8_t[]> ConcatenateBytes(
+      std::initializer_list<base::Vector<const uint8_t>>);
 
   // Tries to get a reasonable name. Lazily looks up the name section, and falls
   // back to the function index. Return value is guaranteed to not be empty.
@@ -486,13 +488,13 @@ class V8_EXPORT_PRIVATE WasmCode final {
   V8_NOINLINE bool DecRefOnPotentiallyDeadCode();
 
   NativeModule* const native_module_ = nullptr;
-  byte* const instructions_;
+  uint8_t* const instructions_;
   // {meta_data_} contains several byte vectors concatenated into one:
   //  - protected instructions data of size {protected_instructions_size_}
   //  - relocation info of size {reloc_info_size_}
   //  - source positions of size {source_positions_size_}
   // Note that the protected instructions come first to ensure alignment.
-  std::unique_ptr<const byte[]> meta_data_;
+  std::unique_ptr<const uint8_t[]> meta_data_;
   const int instructions_size_;
   const int reloc_info_size_;
   const int source_positions_size_;
@@ -559,13 +561,13 @@ class WasmCodeAllocator {
 
   // Allocate code space. Returns a valid buffer or fails with OOM (crash).
   // Hold the {NativeModule}'s {allocation_mutex_} when calling this method.
-  base::Vector<byte> AllocateForCode(NativeModule*, size_t size);
+  base::Vector<uint8_t> AllocateForCode(NativeModule*, size_t size);
 
   // Allocate code space within a specific region. Returns a valid buffer or
   // fails with OOM (crash).
   // Hold the {NativeModule}'s {allocation_mutex_} when calling this method.
-  base::Vector<byte> AllocateForCodeInRegion(NativeModule*, size_t size,
-                                             base::AddressRegion);
+  base::Vector<uint8_t> AllocateForCodeInRegion(NativeModule*, size_t size,
+                                                base::AddressRegion);
 
   // Free memory pages of all given code objects. Used for wasm code GC.
   // Hold the {NativeModule}'s {allocation_mutex_} when calling this method.
@@ -603,7 +605,7 @@ class WasmCodeAllocator {
 class V8_EXPORT_PRIVATE NativeModule final {
  public:
 #if V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_S390X || V8_TARGET_ARCH_ARM64 || \
-    V8_TARGET_ARCH_PPC64
+    V8_TARGET_ARCH_PPC64 || V8_TARGET_ARCH_LOONG64 || V8_TARGET_ARCH_RISCV64
   static constexpr bool kNeedsFarJumpsBetweenCodeSpaces = true;
 #else
   static constexpr bool kNeedsFarJumpsBetweenCodeSpaces = false;
@@ -619,8 +621,8 @@ class V8_EXPORT_PRIVATE NativeModule final {
   std::unique_ptr<WasmCode> AddCode(
       int index, const CodeDesc& desc, int stack_slots,
       uint32_t tagged_parameter_slots,
-      base::Vector<const byte> protected_instructions,
-      base::Vector<const byte> source_position_table, WasmCode::Kind kind,
+      base::Vector<const uint8_t> protected_instructions,
+      base::Vector<const uint8_t> source_position_table, WasmCode::Kind kind,
       ExecutionTier tier, ForDebugging for_debugging);
 
   // {PublishCode} makes the code available to the system by entering it into
@@ -650,14 +652,14 @@ class V8_EXPORT_PRIVATE NativeModule final {
       size_t total_code_size);
 
   std::unique_ptr<WasmCode> AddDeserializedCode(
-      int index, base::Vector<byte> instructions, int stack_slots,
+      int index, base::Vector<uint8_t> instructions, int stack_slots,
       uint32_t tagged_parameter_slots, int safepoint_table_offset,
       int handler_table_offset, int constant_pool_offset,
       int code_comments_offset, int unpadded_binary_size,
-      base::Vector<const byte> protected_instructions_data,
-      base::Vector<const byte> reloc_info,
-      base::Vector<const byte> source_position_table,
-      base::Vector<const byte> inlining_positions, WasmCode::Kind kind,
+      base::Vector<const uint8_t> protected_instructions_data,
+      base::Vector<const uint8_t> reloc_info,
+      base::Vector<const uint8_t> source_position_table,
+      base::Vector<const uint8_t> inlining_positions, WasmCode::Kind kind,
       ExecutionTier tier);
 
   // Adds anonymous code for testing purposes.
@@ -711,7 +713,10 @@ class V8_EXPORT_PRIVATE NativeModule final {
   // on the fly, and bypass the instance builder pipeline.
   void ReserveCodeTableForTesting(uint32_t max_functions);
 
-  void LogWasmCodes(Isolate*, Script);
+  // Log all owned code in the given isolate, using the given script as the
+  // containing script. Use this after transferring the module to a new isolate
+  // or when enabling a component that needs all code to be logged (profiler).
+  void LogWasmCodes(Isolate*, Tagged<Script>);
 
   CompilationState* compilation_state() const {
     return compilation_state_.get();
@@ -728,7 +733,6 @@ class V8_EXPORT_PRIVATE NativeModule final {
   uint32_t num_imported_functions() const {
     return module_->num_imported_functions;
   }
-  BoundsCheckStrategy bounds_checks() const { return bounds_checks_; }
   void set_lazy_compile_frozen(bool frozen) { lazy_compile_frozen_ = frozen; }
   bool lazy_compile_frozen() const { return lazy_compile_frozen_; }
   base::Vector<const uint8_t> wire_bytes() const {
@@ -777,6 +781,13 @@ class V8_EXPORT_PRIVATE NativeModule final {
                                                 std::memory_order_relaxed);
   }
 
+  // Similar to above, scheduling a repeated task to write out PGO data is only
+  // needed once per module, not per instantiation.
+  bool ShouldPgoDataBeWritten() {
+    return should_pgo_data_be_written_.exchange(false,
+                                                std::memory_order_relaxed);
+  }
+
   bool HasWireBytes() const {
     auto wire_bytes = std::atomic_load(&wire_bytes_);
     return wire_bytes && !wire_bytes->empty();
@@ -803,9 +814,9 @@ class V8_EXPORT_PRIVATE NativeModule final {
   void SampleCodeSize(Counters*) const;
 
   V8_WARN_UNUSED_RESULT std::unique_ptr<WasmCode> AddCompiledCode(
-      WasmCompilationResult);
+      const WasmCompilationResult&);
   V8_WARN_UNUSED_RESULT std::vector<std::unique_ptr<WasmCode>> AddCompiledCode(
-      base::Vector<WasmCompilationResult>);
+      base::Vector<const WasmCompilationResult>);
 
   // Set a new debugging state, but don't trigger any recompilation;
   // recompilation happens lazily.
@@ -851,6 +862,16 @@ class V8_EXPORT_PRIVATE NativeModule final {
 
   Counters* counters() const { return code_allocator_.counters(); }
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
+  bool log_code() const { return log_code_.load(std::memory_order_relaxed); }
+
+  void EnableCodeLogging() { log_code_.store(true, std::memory_order_relaxed); }
+
+  void DisableCodeLogging() {
+    log_code_.store(false, std::memory_order_relaxed);
+  }
+
  private:
   friend class WasmCode;
   friend class WasmCodeAllocator;
@@ -873,9 +894,9 @@ class V8_EXPORT_PRIVATE NativeModule final {
   std::unique_ptr<WasmCode> AddCodeWithCodeSpace(
       int index, const CodeDesc& desc, int stack_slots,
       uint32_t tagged_parameter_slots,
-      base::Vector<const byte> protected_instructions_data,
-      base::Vector<const byte> source_position_table,
-      base::Vector<const byte> inlining_positions, WasmCode::Kind kind,
+      base::Vector<const uint8_t> protected_instructions_data,
+      base::Vector<const uint8_t> source_position_table,
+      base::Vector<const uint8_t> inlining_positions, WasmCode::Kind kind,
       ExecutionTier tier, ForDebugging for_debugging,
       bool frame_has_feedback_slot, base::Vector<uint8_t> code_space,
       const JumpTablesRef& jump_tables_ref);
@@ -1015,7 +1036,6 @@ class V8_EXPORT_PRIVATE NativeModule final {
   // End of fields protected by {allocation_mutex_}.
   //////////////////////////////////////////////////////////////////////////////
 
-  const BoundsCheckStrategy bounds_checks_;
   bool lazy_compile_frozen_ = false;
   std::atomic<size_t> liftoff_bailout_count_{0};
   std::atomic<size_t> liftoff_code_size_{0};
@@ -1026,6 +1046,17 @@ class V8_EXPORT_PRIVATE NativeModule final {
   std::atomic<int64_t> sum_lazy_compilation_time_in_micro_sec_{0};
   std::atomic<int64_t> max_lazy_compilation_time_in_micro_sec_{0};
   std::atomic<bool> should_metrics_be_reported_{true};
+
+  // Whether the next instantiation should trigger repeated output of PGO data
+  // (if --experimental-wasm-pgo-to-file is enabled).
+  std::atomic<bool> should_pgo_data_be_written_{true};
+
+  // A lock-free quick-access flag to indicate whether code for this
+  // NativeModule might need to be logged in any isolate. This is updated by the
+  // {WasmEngine}, which keeps the source of truth. After checking this flag,
+  // you would typically call into {WasmEngine::LogCode} which then checks
+  // (under a mutex) which isolate needs logging.
+  std::atomic<bool> log_code_{false};
 };
 
 class V8_EXPORT_PRIVATE WasmCodeManager final {
@@ -1077,12 +1108,6 @@ class V8_EXPORT_PRIVATE WasmCodeManager final {
   // Can only be called if {HasMemoryProtectionKeySupport()} is {true}.
   static bool MemoryProtectionKeyWritable();
 
-  // Allocate new memory for assembler buffers, potentially protected by PKU.
-  base::AddressRegion AllocateAssemblerBufferSpace(int size);
-
-  // Free previously allocated space for assembler buffers.
-  void FreeAssemblerBufferSpace(base::AddressRegion region);
-
  private:
   friend class WasmCodeAllocator;
   friend class WasmEngine;
diff --git a/deps/v8/src/wasm/wasm-constants.h b/deps/v8/src/wasm/wasm-constants.h
index ef0d7f44ff9680..f69c4af00fcbb1 100644
--- a/deps/v8/src/wasm/wasm-constants.h
+++ b/deps/v8/src/wasm/wasm-constants.h
@@ -37,10 +37,6 @@ enum ValueTypeCode : uint8_t {
   kI16Code = 0x79,
   // Current reference types
   kFuncRefCode = 0x70,
-  // TODO(7784): Switch to official opcodes once they are aligned with the
-  // stringref proposal for nofunc and noextern.
-  kNoExternCode = 0x69,
-  kNoFuncCode = 0x68,
   kExternRefCode = 0x6f,
   // typed-funcref and GC proposal types
   kAnyRefCode = 0x6e,
@@ -48,6 +44,8 @@ enum ValueTypeCode : uint8_t {
   kRefNullCode = 0x6c,
   kRefCode = 0x6b,
   kI31RefCode = 0x6a,
+  kNoExternCode = 0x69,  // TODO(7784): Switch to official encoding.
+  kNoFuncCode = 0x68,    // TODO(7784): Switch to official encoding.
   kStructRefCode = 0x67,
   kArrayRefCode = 0x66,
   kNoneCode = 0x65,
@@ -184,6 +182,10 @@ constexpr uint32_t kMinimumSupertypeArraySize = 3;
 // Maximum number of call targets tracked per call.
 constexpr int kMaxPolymorphism = 4;
 
+// A struct field beyond this limit needs an explicit null check (trapping null
+// access not guaranteed to behave properly).
+constexpr int kMaxStructFieldIndexForImplicitNullCheck = 4000;
+
 #if V8_TARGET_ARCH_X64
 constexpr int32_t kOSRTargetOffset = 4 * kSystemPointerSize;
 #endif
diff --git a/deps/v8/src/wasm/wasm-debug.cc b/deps/v8/src/wasm/wasm-debug.cc
index 6071774e1a0329..f2e970c71ffe0c 100644
--- a/deps/v8/src/wasm/wasm-debug.cc
+++ b/deps/v8/src/wasm/wasm-debug.cc
@@ -16,6 +16,7 @@
 #include "src/wasm/baseline/liftoff-compiler.h"
 #include "src/wasm/baseline/liftoff-register.h"
 #include "src/wasm/module-decoder.h"
+#include "src/wasm/std-object-sizes.h"
 #include "src/wasm/value-type.h"
 #include "src/wasm/wasm-code-manager.h"
 #include "src/wasm/wasm-engine.h"
@@ -110,6 +111,20 @@ void DebugSideTable::Entry::Print(std::ostream& os) const {
   os << " ]\n";
 }
 
+size_t DebugSideTable::Entry::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(DebugSideTable::Entry, 32);
+  return ContentSize(changed_values_);
+}
+
+size_t DebugSideTable::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(DebugSideTable, 32);
+  size_t result = sizeof(DebugSideTable) + ContentSize(entries_);
+  for (const Entry& entry : entries_) {
+    result += entry.EstimateCurrentMemoryConsumption();
+  }
+  return result;
+}
+
 class DebugInfoImpl {
  public:
   explicit DebugInfoImpl(NativeModule* native_module)
@@ -243,8 +258,8 @@ class DebugInfoImpl {
     if (!result.succeeded()) FATAL("Liftoff compilation failed");
     DCHECK_EQ(generate_debug_sidetable, debug_sidetable != nullptr);
 
-    WasmCode* new_code = native_module_->PublishCode(
-        native_module_->AddCompiledCode(std::move(result)));
+    WasmCode* new_code =
+        native_module_->PublishCode(native_module_->AddCompiledCode(result));
 
     DCHECK(new_code->is_inspectable());
     if (generate_debug_sidetable) {
@@ -391,7 +406,7 @@ class DebugInfoImpl {
   }
 
   bool IsStepping(WasmFrame* frame) {
-    Isolate* isolate = frame->wasm_instance().GetIsolate();
+    Isolate* isolate = frame->wasm_instance()->GetIsolate();
     if (isolate->debug()->last_step_action() == StepInto) return true;
     base::MutexGuard guard(&mutex_);
     auto it = per_isolate_data_.find(isolate);
@@ -478,6 +493,39 @@ class DebugInfoImpl {
     }
   }
 
+  size_t EstimateCurrentMemoryConsumption() const {
+    UPDATE_WHEN_CLASS_CHANGES(DebugInfoImpl, 208);
+    UPDATE_WHEN_CLASS_CHANGES(CachedDebuggingCode, 40);
+    UPDATE_WHEN_CLASS_CHANGES(PerIsolateDebugData, 48);
+    size_t result = sizeof(DebugInfoImpl);
+    {
+      base::MutexGuard lock(&debug_side_tables_mutex_);
+      result += ContentSize(debug_side_tables_);
+      for (const auto& [code, table] : debug_side_tables_) {
+        result += table->EstimateCurrentMemoryConsumption();
+      }
+    }
+    {
+      base::MutexGuard lock(&mutex_);
+      result += ContentSize(cached_debugging_code_);
+      for (const CachedDebuggingCode& code : cached_debugging_code_) {
+        result += code.breakpoint_offsets.size() * sizeof(int);
+      }
+      result += ContentSize(per_isolate_data_);
+      for (const auto& [isolate, data] : per_isolate_data_) {
+        // Inlined handling of {PerIsolateDebugData}.
+        result += ContentSize(data.breakpoints_per_function);
+        for (const auto& [idx, breakpoints] : data.breakpoints_per_function) {
+          result += ContentSize(breakpoints);
+        }
+      }
+    }
+    if (v8_flags.trace_wasm_offheap_memory) {
+      PrintF("DebugInfo: %zu\n", result);
+    }
+    return result;
+  }
+
  private:
   struct FrameInspectionScope {
     FrameInspectionScope(DebugInfoImpl* debug_info, Address pc)
@@ -669,7 +717,7 @@ class DebugInfoImpl {
     DisallowGarbageCollection no_gc;
     int position = frame->position();
     NativeModule* native_module =
-        frame->wasm_instance().module_object().native_module();
+        frame->wasm_instance()->module_object()->native_module();
     uint8_t opcode = native_module->wire_bytes()[position];
     if (opcode == kExprReturn) return true;
     // Another implicit return is at the last kExprEnd in the function body.
@@ -782,20 +830,24 @@ void DebugInfo::RemoveIsolate(Isolate* isolate) {
   return impl_->RemoveIsolate(isolate);
 }
 
+size_t DebugInfo::EstimateCurrentMemoryConsumption() const {
+  return impl_->EstimateCurrentMemoryConsumption();
+}
+
 }  // namespace wasm
 
 namespace {
 
 // Return the next breakable position at or after {offset_in_func} in function
 // {func_index}, or 0 if there is none.
-// Note that 0 is never a breakable position in wasm, since the first byte
+// Note that 0 is never a breakable position in wasm, since the first uint8_t
 // contains the locals count for the function.
 int FindNextBreakablePosition(wasm::NativeModule* native_module, int func_index,
                               int offset_in_func) {
   AccountingAllocator alloc;
   Zone tmp(&alloc, ZONE_NAME);
   wasm::BodyLocalDecls locals;
-  const byte* module_start = native_module->wire_bytes().begin();
+  const uint8_t* module_start = native_module->wire_bytes().begin();
   const wasm::WasmFunction& func =
       native_module->module()->functions[func_index];
   wasm::BytecodeIterator iterator(module_start + func.code.offset(),
@@ -811,17 +863,18 @@ int FindNextBreakablePosition(wasm::NativeModule* native_module, int func_index,
   return 0;
 }
 
-void SetBreakOnEntryFlag(Script script, bool enabled) {
-  if (script.break_on_entry() == enabled) return;
+void SetBreakOnEntryFlag(Tagged<Script> script, bool enabled) {
+  if (script->break_on_entry() == enabled) return;
 
-  script.set_break_on_entry(enabled);
+  script->set_break_on_entry(enabled);
   // Update the "break_on_entry" flag on all live instances.
-  i::WeakArrayList weak_instance_list = script.wasm_weak_instance_list();
-  for (int i = 0; i < weak_instance_list.length(); ++i) {
-    if (weak_instance_list.Get(i)->IsCleared()) continue;
-    i::WasmInstanceObject instance =
-        i::WasmInstanceObject::cast(weak_instance_list.Get(i)->GetHeapObject());
-    instance.set_break_on_entry(enabled);
+  i::Tagged<i::WeakArrayList> weak_instance_list =
+      script->wasm_weak_instance_list();
+  for (int i = 0; i < weak_instance_list->length(); ++i) {
+    if (weak_instance_list->Get(i)->IsCleared()) continue;
+    i::Tagged<i::WasmInstanceObject> instance =
+        i::WasmInstanceObject::cast(weak_instance_list->Get(i).GetHeapObject());
+    instance->set_break_on_entry(enabled);
   }
 }
 }  // namespace
@@ -894,9 +947,10 @@ bool WasmScript::SetBreakPointForFunction(Handle<Script> script, int func_index,
 
 namespace {
 
-int GetBreakpointPos(Isolate* isolate, Object break_point_info_or_undef) {
-  if (break_point_info_or_undef.IsUndefined(isolate)) return kMaxInt;
-  return BreakPointInfo::cast(break_point_info_or_undef).source_position();
+int GetBreakpointPos(Isolate* isolate,
+                     Tagged<Object> break_point_info_or_undef) {
+  if (IsUndefined(break_point_info_or_undef, isolate)) return kMaxInt;
+  return BreakPointInfo::cast(break_point_info_or_undef)->source_position();
 }
 
 int FindBreakpointInfoInsertPos(Isolate* isolate,
@@ -911,7 +965,7 @@ int FindBreakpointInfoInsertPos(Isolate* isolate,
   int right = breakpoint_infos->length();  // exclusive
   while (right - left > 1) {
     int mid = left + (right - left) / 2;
-    Object mid_obj = breakpoint_infos->get(mid);
+    Tagged<Object> mid_obj = breakpoint_infos->get(mid);
     if (GetBreakpointPos(isolate, mid_obj) <= position) {
       left = mid;
     } else {
@@ -946,9 +1000,9 @@ bool WasmScript::ClearBreakPoint(Handle<Script> script, int position,
   if (info->GetBreakPointCount(isolate) == 0) {
     // Update array by moving breakpoints up one position.
     for (int i = pos; i < breakpoint_infos->length() - 1; i++) {
-      Object entry = breakpoint_infos->get(i + 1);
+      Tagged<Object> entry = breakpoint_infos->get(i + 1);
       breakpoint_infos->set(i, entry);
-      if (entry.IsUndefined(isolate)) break;
+      if (IsUndefined(entry, isolate)) break;
     }
     // Make sure last array element is empty as a result.
     breakpoint_infos->set_undefined(breakpoint_infos->length() - 1);
@@ -981,7 +1035,7 @@ bool WasmScript::ClearBreakPointById(Handle<Script> script, int breakpoint_id) {
 
   for (int i = 0, e = breakpoint_infos->length(); i < e; ++i) {
     Handle<Object> obj(breakpoint_infos->get(i), isolate);
-    if (obj->IsUndefined(isolate)) {
+    if (IsUndefined(*obj, isolate)) {
       continue;
     }
     Handle<BreakPointInfo> breakpoint_info = Handle<BreakPointInfo>::cast(obj);
@@ -998,9 +1052,9 @@ bool WasmScript::ClearBreakPointById(Handle<Script> script, int breakpoint_id) {
 }
 
 // static
-void WasmScript::ClearAllBreakpoints(Script script) {
-  script.set_wasm_breakpoint_infos(
-      ReadOnlyRoots(script.GetIsolate()).empty_fixed_array());
+void WasmScript::ClearAllBreakpoints(Tagged<Script> script) {
+  script->set_wasm_breakpoint_infos(
+      ReadOnlyRoots(script->GetIsolate()).empty_fixed_array());
   SetBreakOnEntryFlag(script, false);
 }
 
@@ -1032,8 +1086,8 @@ void WasmScript::AddBreakpointToInfo(Handle<Script> script, int position,
   }
 
   // Enlarge break positions array if necessary.
-  bool need_realloc = !breakpoint_infos->get(breakpoint_infos->length() - 1)
-                           .IsUndefined(isolate);
+  bool need_realloc = !IsUndefined(
+      breakpoint_infos->get(breakpoint_infos->length() - 1), isolate);
   Handle<FixedArray> new_breakpoint_infos = breakpoint_infos;
   if (need_realloc) {
     new_breakpoint_infos = isolate->factory()->NewFixedArray(
@@ -1046,8 +1100,8 @@ void WasmScript::AddBreakpointToInfo(Handle<Script> script, int position,
 
   // Move elements [insert_pos, ...] up by one.
   for (int i = breakpoint_infos->length() - 1; i >= insert_pos; --i) {
-    Object entry = breakpoint_infos->get(i);
-    if (entry.IsUndefined(isolate)) continue;
+    Tagged<Object> entry = breakpoint_infos->get(i);
+    if (IsUndefined(entry, isolate)) continue;
     new_breakpoint_infos->set(i + 1, entry);
   }
 
@@ -1103,7 +1157,7 @@ bool WasmScript::GetPossibleBreakpoints(
     return false;
   AccountingAllocator alloc;
   Zone tmp(&alloc, ZONE_NAME);
-  const byte* module_start = native_module->wire_bytes().begin();
+  const uint8_t* module_start = native_module->wire_bytes().begin();
 
   for (int func_idx = start_func_index; func_idx <= end_func_index;
        ++func_idx) {
@@ -1133,7 +1187,7 @@ namespace {
 
 bool CheckBreakPoint(Isolate* isolate, Handle<BreakPoint> break_point,
                      StackFrameId frame_id) {
-  if (break_point->condition().length() == 0) return true;
+  if (break_point->condition()->length() == 0) return true;
 
   HandleScope scope(isolate);
   Handle<String> condition(break_point->condition(), isolate);
@@ -1147,7 +1201,7 @@ bool CheckBreakPoint(Isolate* isolate, Handle<BreakPoint> break_point,
     isolate->clear_pending_exception();
     return false;
   }
-  return result->BooleanValue(isolate);
+  return Object::BooleanValue(*result, isolate);
 }
 
 }  // namespace
@@ -1166,13 +1220,13 @@ MaybeHandle<FixedArray> WasmScript::CheckBreakPoints(Isolate* isolate,
 
   Handle<Object> maybe_breakpoint_info(breakpoint_infos->get(insert_pos),
                                        isolate);
-  if (maybe_breakpoint_info->IsUndefined(isolate)) return {};
+  if (IsUndefined(*maybe_breakpoint_info, isolate)) return {};
   Handle<BreakPointInfo> breakpoint_info =
       Handle<BreakPointInfo>::cast(maybe_breakpoint_info);
   if (breakpoint_info->source_position() != position) return {};
 
   Handle<Object> break_points(breakpoint_info->break_points(), isolate);
-  if (!break_points->IsFixedArray()) {
+  if (!IsFixedArray(*break_points)) {
     if (!CheckBreakPoint(isolate, Handle<BreakPoint>::cast(break_points),
                          frame_id)) {
       return {};
diff --git a/deps/v8/src/wasm/wasm-debug.h b/deps/v8/src/wasm/wasm-debug.h
index 9b1e6116b08b7f..fd3b56c01b8555 100644
--- a/deps/v8/src/wasm/wasm-debug.h
+++ b/deps/v8/src/wasm/wasm-debug.h
@@ -23,8 +23,6 @@
 namespace v8 {
 namespace internal {
 
-template <typename T>
-class Handle;
 class WasmFrame;
 
 namespace wasm {
@@ -103,6 +101,8 @@ class DebugSideTable {
 
     void Print(std::ostream&) const;
 
+    size_t EstimateCurrentMemoryConsumption() const;
+
    private:
     int pc_offset_;
     int stack_height_;
@@ -151,6 +151,8 @@ class DebugSideTable {
 
   void Print(std::ostream&) const;
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   struct EntryPositionLess {
     bool operator()(const Entry& a, const Entry& b) const {
@@ -209,6 +211,8 @@ class V8_EXPORT_PRIVATE DebugInfo {
 
   void RemoveIsolate(Isolate*);
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   std::unique_ptr<DebugInfoImpl> impl_;
 };
diff --git a/deps/v8/src/wasm/wasm-disassembler-impl.h b/deps/v8/src/wasm/wasm-disassembler-impl.h
index 4b84171aec7181..431a36c1281730 100644
--- a/deps/v8/src/wasm/wasm-disassembler-impl.h
+++ b/deps/v8/src/wasm/wasm-disassembler-impl.h
@@ -81,12 +81,14 @@ class V8_EXPORT_PRIVATE FunctionBodyDisassembler
 
   FunctionBodyDisassembler(Zone* zone, const WasmModule* module,
                            uint32_t func_index, WasmFeatures* detected,
-                           const FunctionSig* sig, const byte* start,
-                           const byte* end, uint32_t offset,
+                           const FunctionSig* sig, const uint8_t* start,
+                           const uint8_t* end, uint32_t offset,
+                           const ModuleWireBytes wire_bytes,
                            NamesProvider* names)
       : WasmDecoder<ValidationTag>(zone, module, WasmFeatures::All(), detected,
                                    sig, start, end, offset),
         func_index_(func_index),
+        wire_bytes_(wire_bytes),
         names_(names) {}
 
   void DecodeAsWat(MultiLineStringBuilder& out, Indentation indentation,
@@ -111,6 +113,7 @@ class V8_EXPORT_PRIVATE FunctionBodyDisassembler
   friend class ImmediatesPrinter<ValidationTag>;
   uint32_t func_index_;
   WasmOpcode current_opcode_ = kExprUnreachable;
+  const ModuleWireBytes wire_bytes_;
   NamesProvider* names_;
   std::set<uint32_t> used_types_;
   std::vector<LabelInfo> label_stack_;
@@ -132,9 +135,7 @@ class ModuleDisassembler {
   V8_EXPORT_PRIVATE ModuleDisassembler(
       MultiLineStringBuilder& out, const WasmModule* module,
       NamesProvider* names, const ModuleWireBytes wire_bytes,
-      AccountingAllocator* allocator,
-      // When non-nullptr, doubles as a sentinel that bytecode offsets should be
-      // stored for each line of disassembly.
+      AccountingAllocator* allocator, bool collect_offsets,
       std::vector<int>* function_body_offsets = nullptr);
   V8_EXPORT_PRIVATE ~ModuleDisassembler();
 
@@ -148,7 +149,7 @@ class ModuleDisassembler {
   void PrintExportName(ImportExportKindCode kind, uint32_t index);
   void PrintMutableType(bool mutability, ValueType type);
   void PrintTable(const WasmTable& table);
-  void PrintMemory();
+  void PrintMemory(const WasmMemory& memory);
   void PrintGlobal(const WasmGlobal& global);
   void PrintInitExpression(const ConstantExpression& init,
                            ValueType expected_type);
@@ -162,7 +163,7 @@ class ModuleDisassembler {
   const WasmModule* module_;
   NamesProvider* names_;
   const ModuleWireBytes wire_bytes_;
-  const byte* start_;
+  const uint8_t* start_;
   Zone zone_;
   std::unique_ptr<OffsetsProvider> offsets_;
   std::vector<int>* function_body_offsets_;
diff --git a/deps/v8/src/wasm/wasm-disassembler.cc b/deps/v8/src/wasm/wasm-disassembler.cc
index f12af425f45b17..c8dbafb08ffecc 100644
--- a/deps/v8/src/wasm/wasm-disassembler.cc
+++ b/deps/v8/src/wasm/wasm-disassembler.cc
@@ -24,8 +24,32 @@ void Disassemble(const WasmModule* module, ModuleWireBytes wire_bytes,
                  std::vector<int>* function_body_offsets) {
   MultiLineStringBuilder out;
   AccountingAllocator allocator;
+  constexpr bool kCollectOffsets = true;
   ModuleDisassembler md(out, module, names, wire_bytes, &allocator,
-                        function_body_offsets);
+                        kCollectOffsets, function_body_offsets);
+  md.PrintModule({0, 2}, v8_flags.wasm_disassembly_max_mb);
+  out.ToDisassemblyCollector(collector);
+}
+
+void Disassemble(base::Vector<const uint8_t> wire_bytes,
+                 v8::debug::DisassemblyCollector* collector,
+                 std::vector<int>* function_body_offsets) {
+  ModuleResult result = DecodeWasmModuleForDisassembler(wire_bytes);
+  MultiLineStringBuilder out;
+  AccountingAllocator allocator;
+  constexpr bool kCollectOffsets = true;
+  if (result.failed()) {
+    WasmError error = result.error();
+    out << "Decoding error: " << error.message() << " at offset "
+        << error.offset();
+    out.ToDisassemblyCollector(collector);
+    return;
+  }
+  const WasmModule* module = result.value().get();
+  NamesProvider names(module, wire_bytes);
+  ModuleWireBytes module_bytes(wire_bytes);
+  ModuleDisassembler md(out, module, &names, module_bytes, &allocator,
+                        kCollectOffsets, function_body_offsets);
   md.PrintModule({0, 2}, v8_flags.wasm_disassembly_max_mb);
   out.ToDisassemblyCollector(collector);
 }
@@ -145,6 +169,18 @@ void PrintSignatureOneLine(StringBuilder& out, const FunctionSig* sig,
   }
 }
 
+void PrintStringRaw(StringBuilder& out, const uint8_t* start,
+                    const uint8_t* end) {
+  for (const uint8_t* ptr = start; ptr < end; ptr++) {
+    uint8_t b = *ptr;
+    if (b < 32 || b >= 127 || b == '"' || b == '\\') {
+      out << '\\' << kHexChars[b >> 4] << kHexChars[b & 0xF];
+    } else {
+      out << static_cast<char>(b);
+    }
+  }
+}
+
 ////////////////////////////////////////////////////////////////////////////////
 // FunctionBodyDisassembler.
 
@@ -292,7 +328,7 @@ class ImmediatesPrinter {
     int depth = imm_depth;
     if (owner_->current_opcode_ == kExprDelegate) depth++;
     // Be robust: if the module is invalid, print what we got.
-    if (depth >= static_cast<int>(owner_->label_stack_.size())) {
+    if (depth < 0 || depth >= static_cast<int>(owner_->label_stack_.size())) {
       out_ << imm_depth;
       return;
     }
@@ -334,10 +370,18 @@ class ImmediatesPrinter {
     if (imm.type.is_index()) use_type(imm.type.ref_index());
   }
 
+  void ValueType(HeapTypeImmediate& imm, bool is_nullable) {
+    out_ << " ";
+    names()->PrintValueType(
+        out_, ValueType::RefMaybeNull(imm.type,
+                                      is_nullable ? kNullable : kNonNullable));
+    if (imm.type.is_index()) use_type(imm.type.ref_index());
+  }
+
   void BranchDepth(BranchDepthImmediate& imm) { PrintDepthAsLabel(imm.depth); }
 
   void BranchTable(BranchTableImmediate& imm) {
-    const byte* pc = imm.table;
+    const uint8_t* pc = imm.table;
     for (uint32_t i = 0; i <= imm.table_count; i++) {
       auto [target, length] = owner_->read_u32v<ValidationTag>(pc);
       PrintDepthAsLabel(target);
@@ -505,8 +549,26 @@ class ImmediatesPrinter {
   }
 
   void StringConst(StringConstImmediate& imm) {
-    // TODO(jkummerow): Print (a prefix of) the string?
-    out_ << " " << imm.index;
+    if (imm.index >= owner_->module_->stringref_literals.size()) {
+      out_ << " " << imm.index << " INVALID";
+      return;
+    }
+    out_ << " \"";
+    const WasmStringRefLiteral& lit =
+        owner_->module_->stringref_literals[imm.index];
+    const uint8_t* start = owner_->wire_bytes_.start() + lit.source.offset();
+    static constexpr uint32_t kMaxCharsPrinted = 40;
+    if (lit.source.length() <= kMaxCharsPrinted) {
+      const uint8_t* end =
+          owner_->wire_bytes_.start() + lit.source.end_offset();
+      PrintStringRaw(out_, start, end);
+    } else {
+      const uint8_t* end = start + kMaxCharsPrinted - 1;
+      PrintStringRaw(out_, start, end);
+      out_ << "…";
+    }
+    out_ << '"';
+    if (kIndicesAsComments) out_ << " (;" << imm.index << ";)";
   }
 
   void MemoryInit(MemoryInitImmediate& imm) {
@@ -581,7 +643,7 @@ class OffsetsProvider : public ITracer {
     data_offsets_.reserve(module->data_segments.size());
 
     ModuleDecoderImpl decoder{WasmFeatures::All(), wire_bytes, kWasmOrigin,
-                              this};
+                              kDoNotPopulateExplicitRecGroups, this};
     constexpr bool kNoVerifyFunctions = false;
     decoder.DecodeModule(kNoVerifyFunctions);
 
@@ -614,9 +676,13 @@ class OffsetsProvider : public ITracer {
 
   void DataOffset(uint32_t offset) override { data_offsets_.push_back(offset); }
 
+  void StringOffset(uint32_t offset) override {
+    string_offsets_.push_back(offset);
+  }
+
   // Unused by this tracer:
   void ImportsDone() override {}
-  void Bytes(const byte* start, uint32_t count) override {}
+  void Bytes(const uint8_t* start, uint32_t count) override {}
   void Description(const char* desc) override {}
   void Description(const char* desc, size_t length) override {}
   void Description(uint32_t number) override {}
@@ -626,11 +692,11 @@ class OffsetsProvider : public ITracer {
   void NextLine() override {}
   void NextLineIfFull() override {}
   void NextLineIfNonEmpty() override {}
-  void InitializerExpression(const byte* start, const byte* end,
+  void InitializerExpression(const uint8_t* start, const uint8_t* end,
                              ValueType expected_type) override {}
-  void FunctionBody(const WasmFunction* func, const byte* start) override {}
+  void FunctionBody(const WasmFunction* func, const uint8_t* start) override {}
   void FunctionName(uint32_t func_index) override {}
-  void NameSection(const byte* start, const byte* end,
+  void NameSection(const uint8_t* start, const uint8_t* end,
                    uint32_t offset) override {}
 
 #define GETTER(name)                       \
@@ -642,6 +708,7 @@ class OffsetsProvider : public ITracer {
   GETTER(import)
   GETTER(element)
   GETTER(data)
+  GETTER(string)
 #undef GETTER
 
 #define IMPORT_ADJUSTED_GETTER(name)                                  \
@@ -672,6 +739,7 @@ class OffsetsProvider : public ITracer {
   std::vector<uint32_t> global_offsets_;
   std::vector<uint32_t> element_offsets_;
   std::vector<uint32_t> data_offsets_;
+  std::vector<uint32_t> string_offsets_;
   uint32_t memory_offset_{0};
   uint32_t start_offset_{0};
 };
@@ -679,12 +747,10 @@ class OffsetsProvider : public ITracer {
 ////////////////////////////////////////////////////////////////////////////////
 // ModuleDisassembler.
 
-ModuleDisassembler::ModuleDisassembler(MultiLineStringBuilder& out,
-                                       const WasmModule* module,
-                                       NamesProvider* names,
-                                       const ModuleWireBytes wire_bytes,
-                                       AccountingAllocator* allocator,
-                                       std::vector<int>* function_body_offsets)
+ModuleDisassembler::ModuleDisassembler(
+    MultiLineStringBuilder& out, const WasmModule* module, NamesProvider* names,
+    const ModuleWireBytes wire_bytes, AccountingAllocator* allocator,
+    bool collect_offsets, std::vector<int>* function_body_offsets)
     : out_(out),
       module_(module),
       names_(names),
@@ -693,7 +759,7 @@ ModuleDisassembler::ModuleDisassembler(MultiLineStringBuilder& out,
       zone_(allocator, "disassembler zone"),
       offsets_(new OffsetsProvider()),
       function_body_offsets_(function_body_offsets) {
-  if (function_body_offsets != nullptr) {
+  if (collect_offsets) {
     offsets_->CollectOffsets(module, wire_bytes_.module_bytes());
   }
 }
@@ -774,14 +840,16 @@ void ModuleDisassembler::PrintModule(Indentation indentation, size_t max_mb) {
   out_ << indentation << "(module";
   if (module_->name.is_set()) {
     out_ << " $";
-    const byte* name_start = start_ + module_->name.offset();
+    const uint8_t* name_start = start_ + module_->name.offset();
     out_.write(name_start, module_->name.length());
   }
   indentation.increase();
 
   // II. Types
   // TODO(jkummerow): If we want to support binary -> WAT -> binary round
-  // trips, then we need to print rec groups.
+  // trips, then we need to print rec groups. The difficulty is that we
+  // don't store that information, so we'd either have to make {WasmModule}
+  // bigger, or re-decode the type section here.
   for (uint32_t i = 0; i < module_->types.size(); i++) {
     if (kSkipFunctionTypesInTypeSection && module_->has_signature(i)) {
       continue;
@@ -790,7 +858,6 @@ void ModuleDisassembler::PrintModule(Indentation indentation, size_t max_mb) {
   }
 
   // III. Imports
-  bool memory_imported = false;
   for (uint32_t i = 0; i < module_->import_table.size(); i++) {
     const WasmImport& import = module_->import_table[i];
     out_.NextLine(offsets_->import_offset(i));
@@ -825,12 +892,13 @@ void ModuleDisassembler::PrintModule(Indentation indentation, size_t max_mb) {
         break;
       }
       case kExternalMemory:
-        memory_imported = true;
         out_ << "(memory ";
         names_->PrintMemoryName(out_, import.index, kIndicesAsComments);
-        if (module_->mem_export) PrintExportName(kExternalMemory, 0);
+        if (module_->memories[import.index].exported) {
+          PrintExportName(kExternalMemory, 0);
+        }
         PrintImportName(import);
-        PrintMemory();
+        PrintMemory(module_->memories[import.index]);
         break;
       case kExternalTag:
         out_ << "(tag ";
@@ -859,16 +927,15 @@ void ModuleDisassembler::PrintModule(Indentation indentation, size_t max_mb) {
   }
 
   // V. Memories
-  static_assert(kV8MaxWasmMemories == 1,
-                "Code below needs updating for multi-memory");
-  uint32_t num_memories = module_->has_memory ? 1 : 0;
-  for (uint32_t i = 0; i < num_memories; i++) {
-    if (memory_imported) continue;
+  uint32_t num_memories = static_cast<uint32_t>(module_->memories.size());
+  for (uint32_t memory_index = 0; memory_index < num_memories; ++memory_index) {
+    const WasmMemory& memory = module_->memories[memory_index];
+    if (memory.imported) continue;
     out_.NextLine(offsets_->memory_offset());
     out_ << indentation << "(memory ";
-    names_->PrintMemoryName(out_, 0, kIndicesAsComments);
-    if (module_->mem_export) PrintExportName(kExternalMemory, 0);
-    PrintMemory();
+    names_->PrintMemoryName(out_, memory_index, kIndicesAsComments);
+    if (memory.exported) PrintExportName(kExternalMemory, memory_index);
+    PrintMemory(memory);
     out_ << ")";
   }
 
@@ -884,7 +951,16 @@ void ModuleDisassembler::PrintModule(Indentation indentation, size_t max_mb) {
   }
 
   // VII. String literals
-  // TODO(jkummerow/12868): Implement.
+  size_t num_strings = module_->stringref_literals.size();
+  for (uint32_t i = 0; i < num_strings; i++) {
+    const WasmStringRefLiteral lit = module_->stringref_literals[i];
+    out_.NextLine(offsets_->string_offset(i));
+    out_ << indentation << "(string \"";
+    PrintString(lit.source);
+    out_ << '"';
+    if (kIndicesAsComments) out_ << " (;" << i << ";)";
+    out_ << ")";
+  }
 
   // VIII. Globals
   for (uint32_t i = module_->num_imported_globals; i < module_->globals.size();
@@ -960,10 +1036,10 @@ void ModuleDisassembler::PrintModule(Indentation indentation, size_t max_mb) {
     PrintSignatureOneLine(out_, func->sig, i, names_, true, kIndicesAsComments);
     out_.NextLine(func->code.offset());
     WasmFeatures detected;
-    base::Vector<const byte> code = wire_bytes_.GetFunctionBytes(func);
+    base::Vector<const uint8_t> code = wire_bytes_.GetFunctionBytes(func);
     FunctionBodyDisassembler d(&zone_, module_, i, &detected, func->sig,
                                code.begin(), code.end(), func->code.offset(),
-                               names_);
+                               wire_bytes_, names_);
     uint32_t first_instruction_offset;
     d.DecodeAsWat(out_, indentation, FunctionBodyDisassembler::kSkipHeader,
                   &first_instruction_offset);
@@ -987,7 +1063,9 @@ void ModuleDisassembler::PrintModule(Indentation indentation, size_t max_mb) {
       names_->PrintDataSegmentName(out_, i, kIndicesAsComments);
     }
     if (data.active) {
-      ValueType type = module_->is_memory64 ? kWasmI64 : kWasmI32;
+      ValueType type = module_->memories[data.memory_index].is_memory64
+                           ? kWasmI64
+                           : kWasmI32;
       PrintInitExpression(data.dest_addr, type);
     }
     out_ << " \"";
@@ -1038,10 +1116,10 @@ void ModuleDisassembler::PrintTable(const WasmTable& table) {
   names_->PrintValueType(out_, table.type);
 }
 
-void ModuleDisassembler::PrintMemory() {
-  out_ << " " << module_->initial_pages;
-  if (module_->has_maximum_pages) out_ << " " << module_->maximum_pages;
-  if (module_->has_shared_memory) out_ << " shared";
+void ModuleDisassembler::PrintMemory(const WasmMemory& memory) {
+  out_ << " " << memory.initial_pages;
+  if (memory.has_maximum_pages) out_ << " " << memory.maximum_pages;
+  if (memory.is_shared) out_ << " shared";
 }
 
 void ModuleDisassembler::PrintGlobal(const WasmGlobal& global) {
@@ -1069,13 +1147,13 @@ void ModuleDisassembler::PrintInitExpression(const ConstantExpression& init,
       break;
     case ConstantExpression::kWireBytesRef:
       WireBytesRef ref = init.wire_bytes_ref();
-      const byte* start = start_ + ref.offset();
-      const byte* end = start_ + ref.end_offset();
+      const uint8_t* start = start_ + ref.offset();
+      const uint8_t* end = start_ + ref.end_offset();
 
       auto sig = FixedSizeSignature<ValueType>::Returns(expected_type);
       WasmFeatures detected;
       FunctionBodyDisassembler d(&zone_, module_, 0, &detected, &sig, start,
-                                 end, ref.offset(), names_);
+                                 end, ref.offset(), wire_bytes_, names_);
       d.DecodeGlobalInitializer(out_);
       break;
   }
@@ -1090,23 +1168,15 @@ void ModuleDisassembler::PrintTagSignature(const FunctionSig* sig) {
 }
 
 void ModuleDisassembler::PrintString(WireBytesRef ref) {
-  for (const byte* ptr = start_ + ref.offset(); ptr < start_ + ref.end_offset();
-       ptr++) {
-    byte b = *ptr;
-    if (b < 32 || b >= 127 || b == '"' || b == '\\') {
-      out_ << '\\' << kHexChars[b >> 4] << kHexChars[b & 0xF];
-    } else {
-      out_ << static_cast<char>(b);
-    }
-  }
+  PrintStringRaw(out_, start_ + ref.offset(), start_ + ref.end_offset());
 }
 
 // This mimics legacy wasmparser behavior. It might be a questionable choice,
 // but we'll follow suit for now.
 void ModuleDisassembler::PrintStringAsJSON(WireBytesRef ref) {
-  for (const byte* ptr = start_ + ref.offset(); ptr < start_ + ref.end_offset();
-       ptr++) {
-    byte b = *ptr;
+  for (const uint8_t* ptr = start_ + ref.offset();
+       ptr < start_ + ref.end_offset(); ptr++) {
+    uint8_t b = *ptr;
     if (b <= 34) {
       switch (b) {
         // clang-format off
diff --git a/deps/v8/src/wasm/wasm-disassembler.h b/deps/v8/src/wasm/wasm-disassembler.h
index b7aacc5bbbf791..d1d0bc531a1294 100644
--- a/deps/v8/src/wasm/wasm-disassembler.h
+++ b/deps/v8/src/wasm/wasm-disassembler.h
@@ -27,6 +27,10 @@ void Disassemble(const WasmModule* module, ModuleWireBytes wire_bytes,
                  v8::debug::DisassemblyCollector* collector,
                  std::vector<int>* function_body_offsets);
 
+void Disassemble(base::Vector<const uint8_t> wire_bytes,
+                 v8::debug::DisassemblyCollector* collector,
+                 std::vector<int>* function_body_offsets);
+
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/wasm/wasm-engine.cc b/deps/v8/src/wasm/wasm-engine.cc
index 4a3372707a79c9..688a0741cb6f61 100644
--- a/deps/v8/src/wasm/wasm-engine.cc
+++ b/deps/v8/src/wasm/wasm-engine.cc
@@ -7,6 +7,7 @@
 #include "src/base/functional.h"
 #include "src/base/platform/time.h"
 #include "src/base/small-vector.h"
+#include "src/common/assert-scope.h"
 #include "src/common/globals.h"
 #include "src/debug/debug.h"
 #include "src/diagnostics/code-tracer.h"
@@ -19,6 +20,8 @@
 #include "src/objects/heap-number.h"
 #include "src/objects/managed-inl.h"
 #include "src/objects/objects-inl.h"
+#include "src/objects/objects.h"
+#include "src/objects/primitive-heap-object.h"
 #include "src/utils/ostreams.h"
 #include "src/wasm/function-compiler.h"
 #include "src/wasm/module-compiler.h"
@@ -26,6 +29,7 @@
 #include "src/wasm/module-instantiate.h"
 #include "src/wasm/pgo.h"
 #include "src/wasm/stacks.h"
+#include "src/wasm/std-object-sizes.h"
 #include "src/wasm/streaming-decoder.h"
 #include "src/wasm/wasm-debug.h"
 #include "src/wasm/wasm-limits.h"
@@ -131,10 +135,10 @@ class WasmGCForegroundTask : public CancelableTask {
 class WeakScriptHandle {
  public:
   explicit WeakScriptHandle(Handle<Script> script) : script_id_(script->id()) {
-    DCHECK(script->name().IsString() || script->name().IsUndefined());
-    if (script->name().IsString()) {
+    DCHECK(IsString(script->name()) || IsUndefined(script->name()));
+    if (IsString(script->name())) {
       std::unique_ptr<char[]> source_url =
-          String::cast(script->name()).ToCString();
+          String::cast(script->name())->ToCString();
       // Convert from {unique_ptr} to {shared_ptr}.
       source_url_ = {source_url.release(), source_url.get_deleter()};
     }
@@ -480,7 +484,7 @@ bool WasmEngine::SyncValidate(Isolate* isolate, const WasmFeatures& enabled,
 
 MaybeHandle<AsmWasmData> WasmEngine::SyncCompileTranslatedAsmJs(
     Isolate* isolate, ErrorThrower* thrower, ModuleWireBytes bytes,
-    base::Vector<const byte> asm_js_offset_table_bytes,
+    base::Vector<const uint8_t> asm_js_offset_table_bytes,
     Handle<HeapNumber> uses_bitset, LanguageMode language_mode) {
   int compilation_id = next_compilation_id_.fetch_add(1);
   TRACE_EVENT1("v8.wasm", "wasm.SyncCompileTranslatedAsmJs", "id",
@@ -521,7 +525,7 @@ Handle<WasmModuleObject> WasmEngine::FinalizeTranslatedAsmJs(
     Isolate* isolate, Handle<AsmWasmData> asm_wasm_data,
     Handle<Script> script) {
   std::shared_ptr<NativeModule> native_module =
-      asm_wasm_data->managed_native_module().get();
+      asm_wasm_data->managed_native_module()->get();
   Handle<WasmModuleObject> module_object =
       WasmModuleObject::New(isolate, std::move(native_module), script);
   return module_object;
@@ -696,7 +700,7 @@ void WasmEngine::AsyncCompile(
       base::OwnedVector<const uint8_t>::Of(bytes.module_bytes());
 
   AsyncCompileJob* job = CreateAsyncCompileJob(
-      isolate, enabled, std::move(copy), handle(isolate->context(), isolate),
+      isolate, enabled, std::move(copy), isolate->native_context(),
       api_method_name_for_errors, std::move(resolver), compilation_id);
   job->Start();
 }
@@ -802,12 +806,6 @@ namespace {
 Handle<Script> CreateWasmScript(Isolate* isolate,
                                 std::shared_ptr<NativeModule> native_module,
                                 base::Vector<const char> source_url) {
-  Handle<Script> script =
-      isolate->factory()->NewScript(isolate->factory()->undefined_value());
-  script->set_compilation_state(Script::COMPILATION_STATE_COMPILED);
-  script->set_context_data(isolate->native_context()->debug_context_id());
-  script->set_type(Script::TYPE_WASM);
-
   base::Vector<const uint8_t> wire_bytes = native_module->wire_bytes();
 
   // The source URL of the script is
@@ -854,8 +852,8 @@ Handle<Script> CreateWasmScript(Isolate* isolate,
                     .ToHandleChecked();
     }
   }
-  script->set_name(*url_str);
-
+  Handle<PrimitiveHeapObject> source_map_url =
+      isolate->factory()->undefined_value();
   const WasmDebugSymbols& debug_symbols = module->debug_symbols;
   if (debug_symbols.type == WasmDebugSymbols::Type::SourceMap &&
       !debug_symbols.external_url.is_empty()) {
@@ -863,7 +861,7 @@ Handle<Script> CreateWasmScript(Isolate* isolate,
         ModuleWireBytes(wire_bytes).GetNameOrNull(debug_symbols.external_url);
     MaybeHandle<String> src_map_str = isolate->factory()->NewStringFromUtf8(
         external_url, AllocationType::kOld);
-    script->set_source_mapping_url(*src_map_str.ToHandleChecked());
+    source_map_url = src_map_str.ToHandleChecked();
   }
 
   // Use the given shared {NativeModule}, but increase its reference count by
@@ -875,10 +873,26 @@ Handle<Script> CreateWasmScript(Isolate* isolate,
   Handle<Managed<wasm::NativeModule>> managed_native_module =
       Managed<wasm::NativeModule>::FromSharedPtr(isolate, memory_estimate,
                                                  std::move(native_module));
-  script->set_wasm_managed_native_module(*managed_native_module);
-  script->set_wasm_breakpoint_infos(ReadOnlyRoots(isolate).empty_fixed_array());
-  script->set_wasm_weak_instance_list(
-      ReadOnlyRoots(isolate).empty_weak_array_list());
+
+  Handle<Script> script =
+      isolate->factory()->NewScript(isolate->factory()->undefined_value());
+  {
+    DisallowGarbageCollection no_gc;
+    Tagged<Script> raw_script = *script;
+    raw_script->set_compilation_state(Script::CompilationState::kCompiled);
+    raw_script->set_context_data(isolate->native_context()->debug_context_id());
+    raw_script->set_name(*url_str);
+    raw_script->set_type(Script::Type::kWasm);
+    raw_script->set_source_mapping_url(*source_map_url);
+    raw_script->set_line_ends(ReadOnlyRoots(isolate).empty_fixed_array(),
+                              SKIP_WRITE_BARRIER);
+    raw_script->set_wasm_managed_native_module(*managed_native_module);
+    raw_script->set_wasm_breakpoint_infos(
+        ReadOnlyRoots(isolate).empty_fixed_array(), SKIP_WRITE_BARRIER);
+    raw_script->set_wasm_weak_instance_list(
+        ReadOnlyRoots(isolate).empty_weak_array_list(), SKIP_WRITE_BARRIER);
+  }
+
   return script;
 }
 }  // namespace
@@ -896,9 +910,11 @@ Handle<WasmModuleObject> WasmEngine::ImportNativeModule(
   {
     base::MutexGuard lock(&mutex_);
     DCHECK_EQ(1, isolates_.count(isolate));
-    isolates_[isolate]->native_modules.insert(native_module);
+    IsolateInfo* isolate_info = isolates_.find(isolate)->second.get();
+    isolate_info->native_modules.insert(native_module);
     DCHECK_EQ(1, native_modules_.count(native_module));
     native_modules_[native_module]->isolates.insert(isolate);
+    if (isolate_info->log_codes) native_module->EnableCodeLogging();
   }
 
   // Finish the Wasm script now and make it public to the debugger.
@@ -927,7 +943,9 @@ void WasmEngine::DumpAndResetTurboStatistics() {
   base::MutexGuard guard(&mutex_);
   if (compilation_stats_ != nullptr) {
     StdoutStream os;
-    os << AsPrintableStatistics{*compilation_stats_.get(), false} << std::endl;
+    os << AsPrintableStatistics{"Turbofan Wasm", *compilation_stats_.get(),
+                                false}
+       << std::endl;
   }
   compilation_stats_.reset();
 }
@@ -936,7 +954,9 @@ void WasmEngine::DumpTurboStatistics() {
   base::MutexGuard guard(&mutex_);
   if (compilation_stats_ != nullptr) {
     StdoutStream os;
-    os << AsPrintableStatistics{*compilation_stats_.get(), false} << std::endl;
+    os << AsPrintableStatistics{"Turbofan Wasm", *compilation_stats_.get(),
+                                false}
+       << std::endl;
   }
 }
 
@@ -951,7 +971,7 @@ AsyncCompileJob* WasmEngine::CreateAsyncCompileJob(
     base::OwnedVector<const uint8_t> bytes, Handle<Context> context,
     const char* api_method_name,
     std::shared_ptr<CompilationResultResolver> resolver, int compilation_id) {
-  Handle<Context> incumbent_context = isolate->GetIncumbentContext();
+  Handle<NativeContext> incumbent_context = isolate->GetIncumbentContext();
   AsyncCompileJob* job = new AsyncCompileJob(
       isolate, enabled, std::move(bytes), context, incumbent_context,
       api_method_name, std::move(resolver), compilation_id);
@@ -1090,51 +1110,112 @@ void WasmEngine::RemoveIsolate(Isolate* isolate) {
   }
 #endif  // V8_ENABLE_WASM_GDB_REMOTE_DEBUGGING
 
+  // Keep a WasmCodeRefScope which dies after the {mutex_} is released, to avoid
+  // deadlock when code actually dies, as that requires taking the {mutex_}.
+  WasmCodeRefScope code_ref_scope_for_dead_code;
+
   base::MutexGuard guard(&mutex_);
-  auto it = isolates_.find(isolate);
-  DCHECK_NE(isolates_.end(), it);
-  std::unique_ptr<IsolateInfo> info = std::move(it->second);
-  isolates_.erase(it);
-  for (auto* native_module : info->native_modules) {
+
+  // Lookup the IsolateInfo; do not remove it yet (that happens below).
+  auto isolates_it = isolates_.find(isolate);
+  DCHECK_NE(isolates_.end(), isolates_it);
+  IsolateInfo* isolate_info = isolates_it->second.get();
+
+  // Remove the isolate from the per-native-module info, and other cleanup.
+  for (auto* native_module : isolate_info->native_modules) {
     DCHECK_EQ(1, native_modules_.count(native_module));
-    DCHECK_EQ(1, native_modules_[native_module]->isolates.count(isolate));
-    auto* module = native_modules_[native_module].get();
-    module->isolates.erase(isolate);
-    if (current_gc_info_) {
-      for (WasmCode* code : module->potentially_dead_code) {
-        current_gc_info_->dead_code.erase(code);
-      }
+    NativeModuleInfo* native_module_info =
+        native_modules_.find(native_module)->second.get();
+
+    // Check that the {NativeModule::log_code_} field has the expected value,
+    // and update if the dying isolate was the last one with code logging
+    // enabled.
+    auto has_isolate_with_code_logging = [this, native_module_info] {
+      return std::any_of(native_module_info->isolates.begin(),
+                         native_module_info->isolates.end(),
+                         [this](Isolate* isolate) {
+                           return isolates_.find(isolate)->second->log_codes;
+                         });
+    };
+    DCHECK_EQ(native_module->log_code(), has_isolate_with_code_logging());
+    DCHECK_EQ(1, native_module_info->isolates.count(isolate));
+    native_module_info->isolates.erase(isolate);
+    if (!has_isolate_with_code_logging()) {
+      native_module->DisableCodeLogging();
     }
+
+    // Remove any debug code and other info for this isolate.
     if (native_module->HasDebugInfo()) {
       native_module->GetDebugInfo()->RemoveIsolate(isolate);
     }
   }
+
+  // Abort any outstanding GC.
   if (current_gc_info_) {
     if (RemoveIsolateFromCurrentGC(isolate)) PotentiallyFinishCurrentGC();
   }
-  if (auto* task = info->log_codes_task) {
+
+  // Cancel outstanding code logging and clear the {code_to_log} vector.
+  if (auto* task = isolate_info->log_codes_task) {
     task->Cancel();
-    for (auto& log_entry : info->code_to_log) {
-      WasmCode::DecrementRefCount(base::VectorOf(log_entry.second.code));
+    for (auto& [script_id, code_to_log] : isolate_info->code_to_log) {
+      for (WasmCode* code : code_to_log.code) {
+        // Keep a reference in the {code_ref_scope_for_dead_code} such that the
+        // code cannot become dead immediately.
+        WasmCodeRefScope::AddRef(code);
+        code->DecRefOnLiveCode();
+      }
     }
-    info->code_to_log.clear();
+    isolate_info->code_to_log.clear();
   }
-  DCHECK(info->code_to_log.empty());
+  DCHECK(isolate_info->code_to_log.empty());
+
+  // Finally remove the {IsolateInfo} for this isolate.
+  isolates_.erase(isolates_it);
 }
 
 void WasmEngine::LogCode(base::Vector<WasmCode*> code_vec) {
   if (code_vec.empty()) return;
+  NativeModule* native_module = code_vec[0]->native_module();
+  if (!native_module->log_code()) return;
   using TaskToSchedule =
       std::pair<std::shared_ptr<v8::TaskRunner>, std::unique_ptr<LogCodesTask>>;
   std::vector<TaskToSchedule> to_schedule;
   {
     base::MutexGuard guard(&mutex_);
-    NativeModule* native_module = code_vec[0]->native_module();
     DCHECK_EQ(1, native_modules_.count(native_module));
-    for (Isolate* isolate : native_modules_[native_module]->isolates) {
+    NativeModuleInfo* native_module_info =
+        native_modules_.find(native_module)->second.get();
+    for (Isolate* isolate : native_module_info->isolates) {
       DCHECK_EQ(1, isolates_.count(isolate));
       IsolateInfo* info = isolates_[isolate].get();
       if (info->log_codes == false) continue;
+
+      auto script_it = info->scripts.find(native_module);
+      // If the script does not yet exist, logging will happen later. If the
+      // weak handle is cleared already, we also don't need to log any more.
+      if (script_it == info->scripts.end()) continue;
+
+      // If this is the first code to log in that isolate, request an interrupt
+      // to log the newly added code as soon as possible.
+      if (info->code_to_log.empty()) {
+        isolate->stack_guard()->RequestLogWasmCode();
+      }
+
+      WeakScriptHandle& weak_script_handle = script_it->second;
+      auto& log_entry = info->code_to_log[weak_script_handle.script_id()];
+      if (!log_entry.source_url) {
+        log_entry.source_url = weak_script_handle.source_url();
+      }
+      log_entry.code.insert(log_entry.code.end(), code_vec.begin(),
+                            code_vec.end());
+
+      // Increment the reference count for the added {log_entry.code} entries.
+      for (WasmCode* code : code_vec) {
+        DCHECK_EQ(native_module, code->native_module());
+        code->IncRef();
+      }
+
       if (info->log_codes_task == nullptr) {
         auto new_task = std::make_unique<LogCodesTask>(
             &mutex_, &info->log_codes_task, isolate, this);
@@ -1151,24 +1232,6 @@ void WasmEngine::LogCode(base::Vector<WasmCode*> code_vec) {
         to_schedule.emplace_back(info->foreground_task_runner,
                                  std::move(new_task));
       }
-      if (info->code_to_log.empty()) {
-        isolate->stack_guard()->RequestLogWasmCode();
-      }
-      for (WasmCode* code : code_vec) {
-        DCHECK_EQ(native_module, code->native_module());
-        code->IncRef();
-      }
-
-      auto script_it = info->scripts.find(native_module);
-      // If the script does not yet exist, logging will happen later. If the
-      // weak handle is cleared already, we also don't need to log any more.
-      if (script_it == info->scripts.end()) continue;
-      auto& log_entry = info->code_to_log[script_it->second.script_id()];
-      if (!log_entry.source_url) {
-        log_entry.source_url = script_it->second.source_url();
-      }
-      log_entry.code.insert(log_entry.code.end(), code_vec.begin(),
-                            code_vec.end());
     }
   }
   for (auto& [runner, task] : to_schedule) {
@@ -1180,7 +1243,13 @@ void WasmEngine::EnableCodeLogging(Isolate* isolate) {
   base::MutexGuard guard(&mutex_);
   auto it = isolates_.find(isolate);
   DCHECK_NE(isolates_.end(), it);
-  it->second->log_codes = true;
+  IsolateInfo* info = it->second.get();
+  info->log_codes = true;
+  // Also set {NativeModule::log_code_} for all native modules currently used by
+  // this isolate.
+  for (NativeModule* native_module : info->native_modules) {
+    native_module->EnableCodeLogging();
+  }
 }
 
 void WasmEngine::LogOutstandingCodesForIsolate(Isolate* isolate) {
@@ -1197,13 +1266,13 @@ void WasmEngine::LogOutstandingCodesForIsolate(Isolate* isolate) {
   bool should_log = WasmCode::ShouldBeLogged(isolate);
 
   TRACE_EVENT0("v8.wasm", "wasm.LogCode");
-  for (auto& pair : code_to_log) {
-    for (WasmCode* code : pair.second.code) {
+  for (auto& [script_id, code_to_log] : code_to_log) {
+    for (WasmCode* code : code_to_log.code) {
       if (should_log) {
-        code->LogCode(isolate, pair.second.source_url.get(), pair.first);
+        code->LogCode(isolate, code_to_log.source_url.get(), script_id);
       }
     }
-    WasmCode::DecrementRefCount(base::VectorOf(pair.second.code));
+    WasmCode::DecrementRefCount(base::VectorOf(code_to_log.code));
   }
 }
 
@@ -1230,15 +1299,20 @@ std::shared_ptr<NativeModule> WasmEngine::NewNativeModule(
     }
     native_modules_kept_alive_for_pgo->emplace_back(native_module);
   }
-  auto pair = native_modules_.insert(std::make_pair(
+  auto [iterator, inserted] = native_modules_.insert(std::make_pair(
       native_module.get(), std::make_unique<NativeModuleInfo>(native_module)));
-  DCHECK(pair.second);  // inserted new entry.
-  pair.first->second.get()->isolates.insert(isolate);
-  auto* isolate_info = isolates_[isolate].get();
+  DCHECK(inserted);
+  NativeModuleInfo* native_module_info = iterator->second.get();
+  native_module_info->isolates.insert(isolate);
+  DCHECK_EQ(1, isolates_.count(isolate));
+  IsolateInfo* isolate_info = isolates_.find(isolate)->second.get();
   isolate_info->native_modules.insert(native_module.get());
   if (isolate_info->keep_in_debug_state) {
     native_module->SetDebugState(kDebugging);
   }
+  if (isolate_info->log_codes) {
+    native_module->EnableCodeLogging();
+  }
 
   // Record memory protection key support.
   if (!isolate_info->pku_support_sampled) {
@@ -1671,6 +1745,50 @@ void WasmEngine::PotentiallyFinishCurrentGC() {
   if (next_gc_sequence_index != 0) TriggerGC(next_gc_sequence_index);
 }
 
+size_t WasmEngine::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(WasmEngine, 680);
+  UPDATE_WHEN_CLASS_CHANGES(IsolateInfo, 256);
+  UPDATE_WHEN_CLASS_CHANGES(NativeModuleInfo, 144);
+  UPDATE_WHEN_CLASS_CHANGES(CurrentGCInfo, 96);
+  size_t result = sizeof(WasmEngine);
+  result += type_canonicalizer_.EstimateCurrentMemoryConsumption();
+  {
+    base::MutexGuard lock(&mutex_);
+    result += ContentSize(async_compile_jobs_);
+    result += async_compile_jobs_.size() * sizeof(AsyncCompileJob);
+
+    // TODO(14106): Do we care about {compilation_stats_}?
+    // TODO(14106): Do we care about {code_tracer_}?
+
+    result += ContentSize(isolates_);
+    result += isolates_.size() * sizeof(IsolateInfo);
+    for (const auto& [isolate, isolate_info] : isolates_) {
+      result += ContentSize(isolate_info->native_modules);
+      result += ContentSize(isolate_info->scripts);
+      result += ContentSize(isolate_info->code_to_log);
+    }
+
+    result += ContentSize(native_modules_);
+    result += native_modules_.size() * sizeof(NativeModuleInfo);
+    for (const auto& [native_module, native_module_info] : native_modules_) {
+      result += native_module->EstimateCurrentMemoryConsumption();
+      result += ContentSize(native_module_info->isolates);
+      result += ContentSize(native_module_info->potentially_dead_code);
+      result += ContentSize(native_module_info->dead_code);
+    }
+
+    if (current_gc_info_) {
+      result += sizeof(CurrentGCInfo);
+      result += ContentSize(current_gc_info_->outstanding_isolates);
+      result += ContentSize(current_gc_info_->dead_code);
+    }
+  }
+  if (v8_flags.trace_wasm_offheap_memory) {
+    PrintF("WasmEngine: %zu\n", result);
+  }
+  return result;
+}
+
 namespace {
 
 struct GlobalWasmState {
diff --git a/deps/v8/src/wasm/wasm-engine.h b/deps/v8/src/wasm/wasm-engine.h
index e941958e4778ee..2a9df617fa0a27 100644
--- a/deps/v8/src/wasm/wasm-engine.h
+++ b/deps/v8/src/wasm/wasm-engine.h
@@ -156,7 +156,7 @@ class V8_EXPORT_PRIVATE WasmEngine {
   // asm.js module.
   MaybeHandle<AsmWasmData> SyncCompileTranslatedAsmJs(
       Isolate* isolate, ErrorThrower* thrower, ModuleWireBytes bytes,
-      base::Vector<const byte> asm_js_offset_table_bytes,
+      base::Vector<const uint8_t> asm_js_offset_table_bytes,
       Handle<HeapNumber> uses_bitset, LanguageMode language_mode);
   Handle<WasmModuleObject> FinalizeTranslatedAsmJs(
       Isolate* isolate, Handle<AsmWasmData> asm_wasm_data,
@@ -373,6 +373,10 @@ class V8_EXPORT_PRIVATE WasmEngine {
     return wasm_null_tagged_compressed_;
   }
 
+  // Returns an approximation of current off-heap memory used by this engine,
+  // excluding code space.
+  size_t EstimateCurrentMemoryConsumption() const;
+
   // Call on process start and exit.
   static void InitializeOncePerProcess();
   static void GlobalTearDown();
@@ -417,7 +421,7 @@ class V8_EXPORT_PRIVATE WasmEngine {
 
   // This mutex protects all information which is mutated concurrently or
   // fields that are initialized lazily on the first access.
-  base::Mutex mutex_;
+  mutable base::Mutex mutex_;
 
   //////////////////////////////////////////////////////////////////////////////
   // Protected by {mutex_}:
diff --git a/deps/v8/src/wasm/wasm-external-refs.cc b/deps/v8/src/wasm/wasm-external-refs.cc
index ae6e49bbc4f043..b75097ef363875 100644
--- a/deps/v8/src/wasm/wasm-external-refs.cc
+++ b/deps/v8/src/wasm/wasm-external-refs.cc
@@ -35,9 +35,7 @@
 #include "src/utils/utils.h"
 #include "src/wasm/wasm-external-refs.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
+namespace v8::internal::wasm {
 
 using base::ReadUnalignedValue;
 using base::WriteUnalignedValue;
@@ -459,8 +457,9 @@ class V8_NODISCARD ThreadNotInWasmScope {
 #endif
 };
 
-inline byte* EffectiveAddress(WasmInstanceObject instance, uintptr_t index) {
-  return instance.memory_start() + index;
+inline uint8_t* EffectiveAddress(WasmInstanceObject instance,
+                                 uint32_t mem_index, uintptr_t index) {
+  return instance->memory_base(mem_index) + index;
 }
 
 template <typename V>
@@ -478,22 +477,24 @@ int32_t memory_init_wrapper(Address data) {
   ThreadNotInWasmScope thread_not_in_wasm_scope;
   DisallowGarbageCollection no_gc;
   size_t offset = 0;
-  Object raw_instance = ReadAndIncrementOffset<Object>(data, &offset);
-  WasmInstanceObject instance = WasmInstanceObject::cast(raw_instance);
+  WasmInstanceObject instance =
+      WasmInstanceObject::cast(ReadAndIncrementOffset<Object>(data, &offset));
+  uint32_t mem_index = ReadAndIncrementOffset<uint32_t>(data, &offset);
   uintptr_t dst = ReadAndIncrementOffset<uintptr_t>(data, &offset);
   uint32_t src = ReadAndIncrementOffset<uint32_t>(data, &offset);
   uint32_t seg_index = ReadAndIncrementOffset<uint32_t>(data, &offset);
   uint32_t size = ReadAndIncrementOffset<uint32_t>(data, &offset);
 
-  uint64_t mem_size = instance.memory_size();
+  uint64_t mem_size = instance->memory_size(mem_index);
   if (!base::IsInBounds<uint64_t>(dst, size, mem_size)) return kOutOfBounds;
 
-  uint32_t seg_size = instance.data_segment_sizes().get(seg_index);
+  uint32_t seg_size = instance->data_segment_sizes()->get(seg_index);
   if (!base::IsInBounds<uint32_t>(src, size, seg_size)) return kOutOfBounds;
 
-  byte* seg_start =
-      reinterpret_cast<byte*>(instance.data_segment_starts().get(seg_index));
-  std::memcpy(EffectiveAddress(instance, dst), seg_start + src, size);
+  uint8_t* seg_start = reinterpret_cast<uint8_t*>(
+      instance->data_segment_starts()->get(seg_index));
+  std::memcpy(EffectiveAddress(instance, mem_index, dst), seg_start + src,
+              size);
   return kSuccess;
 }
 
@@ -501,19 +502,22 @@ int32_t memory_copy_wrapper(Address data) {
   ThreadNotInWasmScope thread_not_in_wasm_scope;
   DisallowGarbageCollection no_gc;
   size_t offset = 0;
-  Object raw_instance = ReadAndIncrementOffset<Object>(data, &offset);
-  WasmInstanceObject instance = WasmInstanceObject::cast(raw_instance);
+  WasmInstanceObject instance =
+      WasmInstanceObject::cast(ReadAndIncrementOffset<Object>(data, &offset));
+  uint32_t dst_mem_index = ReadAndIncrementOffset<uint32_t>(data, &offset);
+  uint32_t src_mem_index = ReadAndIncrementOffset<uint32_t>(data, &offset);
   uintptr_t dst = ReadAndIncrementOffset<uintptr_t>(data, &offset);
   uintptr_t src = ReadAndIncrementOffset<uintptr_t>(data, &offset);
   uintptr_t size = ReadAndIncrementOffset<uintptr_t>(data, &offset);
 
-  uint64_t mem_size = instance.memory_size();
-  if (!base::IsInBounds<uint64_t>(dst, size, mem_size)) return kOutOfBounds;
-  if (!base::IsInBounds<uint64_t>(src, size, mem_size)) return kOutOfBounds;
+  uint64_t dst_mem_size = instance->memory_size(dst_mem_index);
+  uint64_t src_mem_size = instance->memory_size(src_mem_index);
+  if (!base::IsInBounds<uint64_t>(dst, size, dst_mem_size)) return kOutOfBounds;
+  if (!base::IsInBounds<uint64_t>(src, size, src_mem_size)) return kOutOfBounds;
 
   // Use std::memmove, because the ranges can overlap.
-  std::memmove(EffectiveAddress(instance, dst), EffectiveAddress(instance, src),
-               size);
+  std::memmove(EffectiveAddress(instance, dst_mem_index, dst),
+               EffectiveAddress(instance, src_mem_index, src), size);
   return kSuccess;
 }
 
@@ -522,17 +526,18 @@ int32_t memory_fill_wrapper(Address data) {
   DisallowGarbageCollection no_gc;
 
   size_t offset = 0;
-  Object raw_instance = ReadAndIncrementOffset<Object>(data, &offset);
-  WasmInstanceObject instance = WasmInstanceObject::cast(raw_instance);
+  WasmInstanceObject instance =
+      WasmInstanceObject::cast(ReadAndIncrementOffset<Object>(data, &offset));
+  uint32_t mem_index = ReadAndIncrementOffset<uint32_t>(data, &offset);
   uintptr_t dst = ReadAndIncrementOffset<uintptr_t>(data, &offset);
   uint8_t value =
       static_cast<uint8_t>(ReadAndIncrementOffset<uint32_t>(data, &offset));
   uintptr_t size = ReadAndIncrementOffset<uintptr_t>(data, &offset);
 
-  uint64_t mem_size = instance.memory_size();
+  uint64_t mem_size = instance->memory_size(mem_index);
   if (!base::IsInBounds<uint64_t>(dst, size, mem_size)) return kOutOfBounds;
 
-  std::memset(EffectiveAddress(instance, dst), value, size);
+  std::memset(EffectiveAddress(instance, mem_index, dst), value, size);
   return kSuccess;
 }
 
@@ -561,13 +566,13 @@ void array_copy_wrapper(Address raw_instance, Address raw_dst_array,
       dst_array.ptr() == src_array.ptr() &&
       (dst_index < src_index ? dst_index + length > src_index
                              : src_index + length > dst_index);
-  wasm::ValueType element_type = src_array.type()->element_type();
+  wasm::ValueType element_type = src_array->type()->element_type();
   if (element_type.is_reference()) {
     WasmInstanceObject instance =
         WasmInstanceObject::cast(Object(raw_instance));
-    Isolate* isolate = instance.GetIsolate();
-    ObjectSlot dst_slot = dst_array.ElementSlot(dst_index);
-    ObjectSlot src_slot = src_array.ElementSlot(src_index);
+    Isolate* isolate = instance->GetIsolate();
+    ObjectSlot dst_slot = dst_array->ElementSlot(dst_index);
+    ObjectSlot src_slot = src_array->ElementSlot(src_index);
     if (overlapping_ranges) {
       isolate->heap()->MoveRange(dst_array, dst_slot, src_slot, length,
                                  UPDATE_WRITE_BARRIER);
@@ -667,7 +672,7 @@ void array_fill_wrapper(Address raw_array, uint32_t index, uint32_t length,
   if (emit_write_barrier) {
     DCHECK(type.is_reference());
     WasmArray array = WasmArray::cast(Object(raw_array));
-    Isolate* isolate = array.GetIsolate();
+    Isolate* isolate = array->GetIsolate();
     ObjectSlot start(reinterpret_cast<Address>(initial_element_address));
     ObjectSlot end(
         reinterpret_cast<Address>(initial_element_address + bytes_to_set));
@@ -675,21 +680,60 @@ void array_fill_wrapper(Address raw_array, uint32_t index, uint32_t length,
   }
 }
 
-static WasmTrapCallbackForTesting wasm_trap_callback_for_testing = nullptr;
+double flat_string_to_f64(Address string_address) {
+  String s = String::cast(Object(string_address));
+  return FlatStringToDouble(s, ALLOW_TRAILING_JUNK,
+                            std::numeric_limits<double>::quiet_NaN());
+}
 
-void set_trap_callback_for_testing(WasmTrapCallbackForTesting callback) {
-  wasm_trap_callback_for_testing = callback;
+void sync_stack_limit(Isolate* isolate) {
+  CHECK(v8_flags.experimental_wasm_stack_switching);
+  DisallowGarbageCollection no_gc;
+
+  isolate->SyncStackLimit();
 }
 
-void call_trap_callback_for_testing() {
-  if (wasm_trap_callback_for_testing) {
-    wasm_trap_callback_for_testing();
-  }
+intptr_t switch_to_the_central_stack(Isolate* isolate, uintptr_t current_sp) {
+  CHECK(v8_flags.experimental_wasm_stack_switching);
+
+  ThreadLocalTop* thread_local_top = isolate->thread_local_top();
+  StackGuard* stack_guard = isolate->stack_guard();
+
+  CHECK_EQ(thread_local_top->secondary_stack_sp_, 0);
+  CHECK_EQ(thread_local_top->secondary_stack_limit_, 0);
+
+  auto secondary_stack_limit = stack_guard->real_jslimit();
+
+  stack_guard->SetStackLimitForStackSwitching(
+      thread_local_top->central_stack_limit_);
+
+  thread_local_top->secondary_stack_limit_ = secondary_stack_limit;
+  thread_local_top->secondary_stack_sp_ = current_sp;
+  thread_local_top->is_on_central_stack_flag_ = true;
+
+  auto counter = isolate->wasm_switch_to_the_central_stack_counter();
+  isolate->set_wasm_switch_to_the_central_stack_counter(counter + 1);
+
+  return thread_local_top->central_stack_sp_;
+}
+
+void switch_from_the_central_stack(Isolate* isolate) {
+  CHECK(v8_flags.experimental_wasm_stack_switching);
+
+  ThreadLocalTop* thread_local_top = isolate->thread_local_top();
+  CHECK_NE(thread_local_top->secondary_stack_sp_, 0);
+  CHECK_NE(thread_local_top->secondary_stack_limit_, 0);
+
+  auto secondary_stack_limit = thread_local_top->secondary_stack_limit_;
+  thread_local_top->secondary_stack_limit_ = 0;
+  thread_local_top->secondary_stack_sp_ = 0;
+  thread_local_top->is_on_central_stack_flag_ = false;
+
+  StackGuard* stack_guard = isolate->stack_guard();
+  stack_guard->SetStackLimitForStackSwitching(secondary_stack_limit);
 }
 
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
 
 #undef V8_WITH_SANITIZER
 #undef RESET_THREAD_IN_WASM_FLAG_FOR_ASAN_ON_WINDOWS
diff --git a/deps/v8/src/wasm/wasm-external-refs.h b/deps/v8/src/wasm/wasm-external-refs.h
index 7bbdcee31e467b..724abd421f1bd0 100644
--- a/deps/v8/src/wasm/wasm-external-refs.h
+++ b/deps/v8/src/wasm/wasm-external-refs.h
@@ -15,6 +15,9 @@
 
 namespace v8 {
 namespace internal {
+
+class Isolate;
+
 namespace wasm {
 
 using Address = uintptr_t;
@@ -124,12 +127,14 @@ void array_fill_wrapper(Address raw_array, uint32_t index, uint32_t length,
                         uint32_t emit_write_barrier, uint32_t raw_type,
                         Address initial_value_addr);
 
-using WasmTrapCallbackForTesting = void (*)();
+double flat_string_to_f64(Address string_address);
 
-V8_EXPORT_PRIVATE void set_trap_callback_for_testing(
-    WasmTrapCallbackForTesting callback);
+// Update the stack limit after a stack switch,
+// and preserve pending interrupts.
+void sync_stack_limit(Isolate* isolate);
 
-V8_EXPORT_PRIVATE void call_trap_callback_for_testing();
+intptr_t switch_to_the_central_stack(Isolate* isolate, uintptr_t sp);
+void switch_from_the_central_stack(Isolate* isolate);
 
 }  // namespace wasm
 }  // namespace internal
diff --git a/deps/v8/src/wasm/wasm-feature-flags.h b/deps/v8/src/wasm/wasm-feature-flags.h
index 095b6debff5f9c..33672eb9e14137 100644
--- a/deps/v8/src/wasm/wasm-feature-flags.h
+++ b/deps/v8/src/wasm/wasm-feature-flags.h
@@ -23,12 +23,6 @@
   /* V8 side owner: jabraham */                                                \
   V(instruction_tracing, "instruction tracing section", false)                 \
                                                                                \
-  /* GC proposal (early prototype, might change dramatically) */               \
-  /* Official proposal: https://github.com/WebAssembly/gc */                   \
-  /* Prototype engineering spec: https://bit.ly/3cWcm6Q */                     \
-  /* V8 side owner: jkummerow */                                               \
-  V(gc, "garbage collection", false)                                           \
-                                                                               \
   /* Inlining of small wasm GC functions into JavaScript */                    \
   /* V8 side owner: mliedtke */                                                \
   V(js_inlining, "inline small wasm functions into JS", false)                 \
@@ -45,11 +39,6 @@
     false)                                                                     \
   V(skip_bounds_checks, "skip array bounds checks (unsafe)", false)            \
                                                                                \
-  /* Typed function references proposal. */                                    \
-  /* Official proposal: https://github.com/WebAssembly/function-references */  \
-  /* V8 side owner: manoskouk */                                               \
-  V(typed_funcref, "typed function references", false)                         \
-                                                                               \
   /* Branch Hinting proposal. */                                               \
   /* https://github.com/WebAssembly/branch-hinting */                          \
   /* V8 side owner: jkummerow */                                               \
@@ -60,10 +49,11 @@
   /* V8 side owner: thibaudm, fgm */                                           \
   V(stack_switching, "stack switching", false)                                 \
                                                                                \
-  /* Reference-Typed Strings Proposal. */                                      \
-  /* https://github.com/WebAssembly/stringref */                               \
+  /* Imported Strings Proposal. */                                             \
+  /* https://github.com/WebAssembly/design/issues/1480 */                      \
+  /* Prototype spec: https://bit.ly/wasm-imported-strings */                   \
   /* V8 side owner: jkummerow */                                               \
-  V(stringref, "reference-typed strings", false)
+  V(imported_strings, "imported strings", false)
 
 // #############################################################################
 // Staged features (disabled by default, but enabled via --wasm-staging (also
@@ -73,6 +63,8 @@
 // the wild. Staged features are not necessarily fully stabilized. They should
 // be shipped with enough lead time to the next branch to allow for
 // stabilization.
+// Consider adding a chromium-side use counter if you want to track usage in the
+// wild (also see {V8::UseCounterFeature}).
 #define FOREACH_WASM_STAGING_FEATURE_FLAG(V) /*          (force 80 columns) */ \
   /* Type reflection proposal. */                                              \
   /* https://github.com/webassembly/js-types */                                \
@@ -85,22 +77,31 @@
   /* V8 side owner: clemensb */                                                \
   V(memory64, "memory64", false)                                               \
                                                                                \
-  /* Relaxed SIMD proposal. */                                                 \
-  /* https://github.com/WebAssembly/relaxed-simd */                            \
-  /* V8 side owner: gdeepti */                                                 \
-  V(relaxed_simd, "relaxed simd", false)                                       \
-                                                                               \
-  /* Extended Constant Expressions Proposal. */                                \
-  /* https://github.com/WebAssembly/extended-const */                          \
+  /* Typed function references proposal. */                                    \
+  /* Official proposal: https://github.com/WebAssembly/function-references */  \
   /* V8 side owner: manoskouk */                                               \
-  /* Staged in v11.3. */                                                       \
-  V(extended_const, "extended constant expressions", false)                    \
+  V(typed_funcref, "typed function references", false)                         \
+                                                                               \
+  /* GC proposal. https://github.com/WebAssembly/gc */                         \
+  /* Prototype engineering spec: https://bit.ly/3cWcm6Q */                     \
+  /* V8 side owner: jkummerow */                                               \
+  V(gc, "garbage collection", false)                                           \
+                                                                               \
+  /* Reference-Typed Strings Proposal. */                                      \
+  /* https://github.com/WebAssembly/stringref */                               \
+  /* V8 side owner: jkummerow */                                               \
+  V(stringref, "reference-typed strings", false)                               \
                                                                                \
   /* Not user-visible, defined here so an Origin Trial can control it. */      \
   /* V8 side owner: manoskouk, clemensb */                                     \
   /* Staged in v11.3 */                                                        \
   /* Launch bug: https://crbug.com/1424350 */                                  \
-  V(inlining, "wasm-into-wasm inlining", false)
+  V(inlining, "wasm-into-wasm inlining", false)                                \
+                                                                               \
+  /* Multi-memory Proposal. */                                                 \
+  /* https://github.com/WebAssembly/multi-memory */                            \
+  /* V8 side owner: clemensb */                                                \
+  V(multi_memory, "multi-memory", false)
 
 // #############################################################################
 // Shipped features (enabled by default). Remove the feature flag once they hit
@@ -112,8 +113,24 @@
   /* Staged in v8.7 * */                                                       \
   /* Shipped in v11.2 * */                                                     \
   /* ITS: https://groups.google.com/a/chromium.org/g/blink-dev/c/6VEOK4WZ7Wk   \
-   */                                                                          \
-  V(return_call, "return call opcodes", true)
+  */                                                                           \
+  V(return_call, "return call opcodes", true)                                  \
+                                                                               \
+  /* Extended Constant Expressions Proposal. */                                \
+  /* https://github.com/WebAssembly/extended-const */                          \
+  /* V8 side owner: manoskouk */                                               \
+  /* Staged in v11.3. */                                                       \
+  /* Shipped in v11.4. */                                                      \
+  V(extended_const, "extended constant expressions", true)                     \
+                                                                               \
+  /* Relaxed SIMD proposal. */                                                 \
+  /* https://github.com/WebAssembly/relaxed-simd */                            \
+  /* V8 side owner: gdeepti */                                                 \
+  /* Staged in v11.2. */                                                       \
+  /* Shipped in v11.4. */                                                      \
+  /* ITS: https://groups.google.com/a/chromium.org/g/blink-dev/c/dX61V0HAAz4   \
+  */                                                                           \
+  V(relaxed_simd, "relaxed simd", true)
 
 // Combination of all available wasm feature flags.
 #define FOREACH_WASM_FEATURE_FLAG(V)        \
diff --git a/deps/v8/src/wasm/wasm-features.cc b/deps/v8/src/wasm/wasm-features.cc
index b11b0ae8096294..690edc4fe1d129 100644
--- a/deps/v8/src/wasm/wasm-features.cc
+++ b/deps/v8/src/wasm/wasm-features.cc
@@ -3,7 +3,8 @@
 // found in the LICENSE file.
 
 #include "src/wasm/wasm-features.h"
-#include "src/execution/isolate.h"
+
+#include "src/execution/isolate-inl.h"
 #include "src/flags/flags.h"
 #include "src/handles/handles-inl.h"
 
@@ -26,12 +27,12 @@ WasmFeatures WasmFeatures::FromFlags() {
 
 // static
 WasmFeatures WasmFeatures::FromIsolate(Isolate* isolate) {
-  return FromContext(isolate, handle(isolate->context(), isolate));
+  return FromContext(isolate, isolate->native_context());
 }
 
 // static
 WasmFeatures WasmFeatures::FromContext(Isolate* isolate,
-                                       Handle<Context> context) {
+                                       Handle<NativeContext> context) {
   WasmFeatures features = WasmFeatures::FromFlags();
   if (isolate->IsWasmGCEnabled(context)) {
     features.Add(kFeature_gc);
@@ -45,6 +46,9 @@ WasmFeatures WasmFeatures::FromContext(Isolate* isolate,
   if (isolate->IsWasmInliningEnabled(context)) {
     features.Add(kFeature_inlining);
   }
+  if (isolate->IsWasmImportedStringsEnabled(context)) {
+    features.Add(kFeature_imported_strings);
+  }
   // This space intentionally left blank for future Wasm origin trials.
   return features;
 }
diff --git a/deps/v8/src/wasm/wasm-features.h b/deps/v8/src/wasm/wasm-features.h
index 9d87947badd451..c77ca0ee81b4a8 100644
--- a/deps/v8/src/wasm/wasm-features.h
+++ b/deps/v8/src/wasm/wasm-features.h
@@ -10,8 +10,7 @@
 #define V8_WASM_WASM_FEATURES_H_
 
 // The feature flags are declared in their own header.
-#include "src/base/enum-set.h"
-#include "src/base/macros.h"
+#include "src/common/globals.h"
 #include "src/wasm/wasm-feature-flags.h"
 
 // Features that are always enabled and do not have a flag.
@@ -29,11 +28,6 @@
 namespace v8 {
 namespace internal {
 
-class Context;
-template <typename T>
-class Handle;
-class Isolate;
-
 namespace wasm {
 
 enum WasmFeature {
@@ -71,8 +65,8 @@ class WasmFeatures : public base::EnumSet<WasmFeature> {
   // not enabled by a flag and are always on.
   static WasmFeatures FromFlags();
   static V8_EXPORT_PRIVATE WasmFeatures FromIsolate(Isolate*);
-  static V8_EXPORT_PRIVATE WasmFeatures FromContext(Isolate*,
-                                                    Handle<Context> context);
+  static V8_EXPORT_PRIVATE WasmFeatures
+  FromContext(Isolate*, Handle<NativeContext> context);
 };
 
 // static
diff --git a/deps/v8/src/wasm/wasm-import-wrapper-cache.cc b/deps/v8/src/wasm/wasm-import-wrapper-cache.cc
index b600258d0b40c8..3cfbf79ea07e04 100644
--- a/deps/v8/src/wasm/wasm-import-wrapper-cache.cc
+++ b/deps/v8/src/wasm/wasm-import-wrapper-cache.cc
@@ -6,6 +6,7 @@
 
 #include <vector>
 
+#include "src/wasm/std-object-sizes.h"
 #include "src/wasm/wasm-code-manager.h"
 
 namespace v8 {
@@ -57,6 +58,11 @@ WasmImportWrapperCache::~WasmImportWrapperCache() {
   WasmCode::DecrementRefCount(base::VectorOf(ptrs));
 }
 
+size_t WasmImportWrapperCache::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(WasmImportWrapperCache, 88);
+  return sizeof(WasmImportWrapperCache) + ContentSize(entry_map_);
+}
+
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/wasm/wasm-import-wrapper-cache.h b/deps/v8/src/wasm/wasm-import-wrapper-cache.h
index 9ab568b91b12da..b0690ca3f873dc 100644
--- a/deps/v8/src/wasm/wasm-import-wrapper-cache.h
+++ b/deps/v8/src/wasm/wasm-import-wrapper-cache.h
@@ -82,6 +82,8 @@ class WasmImportWrapperCache {
 
   ~WasmImportWrapperCache();
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   mutable base::Mutex mutex_;
   std::unordered_map<CacheKey, WasmCode*, CacheKeyHash> entry_map_;
diff --git a/deps/v8/src/wasm/wasm-init-expr.cc b/deps/v8/src/wasm/wasm-init-expr.cc
deleted file mode 100644
index 2e04de5c68d530..00000000000000
--- a/deps/v8/src/wasm/wasm-init-expr.cc
+++ /dev/null
@@ -1,60 +0,0 @@
-// Copyright 2021 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/wasm/wasm-init-expr.h"
-
-#include "src/wasm/wasm-features.h"
-#include "src/wasm/wasm-module.h"
-
-namespace v8 {
-namespace internal {
-namespace wasm {
-
-ValueType WasmInitExpr::type(const WasmModule* module,
-                             const WasmFeatures& enabled_features) const {
-  switch (kind()) {
-    case kNone:
-      return kWasmBottom;
-    case kGlobalGet:
-      return immediate().index < module->globals.size()
-                 ? module->globals[immediate().index].type
-                 : kWasmBottom;
-    case kI32Const:
-    case kI32Add:
-    case kI32Sub:
-    case kI32Mul:
-      return kWasmI32;
-    case kI64Add:
-    case kI64Sub:
-    case kI64Mul:
-    case kI64Const:
-      return kWasmI64;
-    case kF32Const:
-      return kWasmF32;
-    case kF64Const:
-      return kWasmF64;
-    case kS128Const:
-      return kWasmS128;
-    case kRefFuncConst: {
-      uint32_t heap_type = enabled_features.has_typed_funcref()
-                               ? module->functions[immediate().index].sig_index
-                               : HeapType::kFunc;
-      return ValueType::Ref(heap_type);
-    }
-    case kRefNullConst:
-      return ValueType::RefNull(immediate().heap_type);
-    case kStructNew:
-    case kStructNewDefault:
-    case kArrayNewFixed:
-      return ValueType::Ref(immediate().index);
-    case kI31New:
-      return kWasmI31Ref.AsNonNull();
-    case kStringConst:
-      return ValueType::Ref(HeapType::kString);
-  }
-}
-
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/src/wasm/wasm-init-expr.h b/deps/v8/src/wasm/wasm-init-expr.h
index fcdcd25003e4f8..cc23961f129ae3 100644
--- a/deps/v8/src/wasm/wasm-init-expr.h
+++ b/deps/v8/src/wasm/wasm-init-expr.h
@@ -24,11 +24,9 @@ class WasmFeatures;
 // Representation of an constant expression. Unlike {ConstantExpression}, this
 // does not use {WireBytesRef}, i.e., it does not depend on a wasm module's
 // bytecode representation.
-// TODO(manoskouk): Add missing kinds of expressions.
 class WasmInitExpr : public ZoneObject {
  public:
   enum Operator {
-    kNone,
     kGlobalGet,
     kI32Const,
     kI64Const,
@@ -45,9 +43,13 @@ class WasmInitExpr : public ZoneObject {
     kRefFuncConst,
     kStructNew,
     kStructNewDefault,
+    kArrayNew,
+    kArrayNewDefault,
     kArrayNewFixed,
     kI31New,
     kStringConst,
+    kExternInternalize,
+    kExternExternalize
   };
 
   union Immediate {
@@ -60,9 +62,6 @@ class WasmInitExpr : public ZoneObject {
     HeapType::Representation heap_type;
   };
 
-  WasmInitExpr() : kind_(kNone), operands_(nullptr) {
-    immediate_.i32_const = 0;
-  }
   explicit WasmInitExpr(int32_t v) : kind_(kI32Const), operands_(nullptr) {
     immediate_.i32_const = v;
   }
@@ -84,28 +83,23 @@ class WasmInitExpr : public ZoneObject {
                             WasmInitExpr rhs) {
     DCHECK(op == kI32Add || op == kI32Sub || op == kI32Mul || op == kI64Add ||
            op == kI64Sub || op == kI64Mul);
-    return WasmInitExpr(
-        op, zone->New<ZoneVector<WasmInitExpr>>(
-                std::initializer_list<WasmInitExpr>{lhs, rhs}, zone));
+    return WasmInitExpr(zone, op, {lhs, rhs});
   }
 
   static WasmInitExpr GlobalGet(uint32_t index) {
-    WasmInitExpr expr;
-    expr.kind_ = kGlobalGet;
+    WasmInitExpr expr(kGlobalGet);
     expr.immediate_.index = index;
     return expr;
   }
 
   static WasmInitExpr RefFuncConst(uint32_t index) {
-    WasmInitExpr expr;
-    expr.kind_ = kRefFuncConst;
+    WasmInitExpr expr(kRefFuncConst);
     expr.immediate_.index = index;
     return expr;
   }
 
   static WasmInitExpr RefNullConst(HeapType::Representation heap_type) {
-    WasmInitExpr expr;
-    expr.kind_ = kRefNullConst;
+    WasmInitExpr expr(kRefNullConst);
     expr.immediate_.heap_type = heap_type;
     return expr;
   }
@@ -118,8 +112,21 @@ class WasmInitExpr : public ZoneObject {
   }
 
   static WasmInitExpr StructNewDefault(uint32_t index) {
-    WasmInitExpr expr;
-    expr.kind_ = kStructNewDefault;
+    WasmInitExpr expr(kStructNewDefault);
+    expr.immediate_.index = index;
+    return expr;
+  }
+
+  static WasmInitExpr ArrayNew(Zone* zone, uint32_t index, WasmInitExpr initial,
+                               WasmInitExpr length) {
+    WasmInitExpr expr(zone, kArrayNew, {initial, length});
+    expr.immediate_.index = index;
+    return expr;
+  }
+
+  static WasmInitExpr ArrayNewDefault(Zone* zone, uint32_t index,
+                                      WasmInitExpr length) {
+    WasmInitExpr expr(zone, kArrayNewDefault, {length});
     expr.immediate_.index = index;
     return expr;
   }
@@ -132,19 +139,24 @@ class WasmInitExpr : public ZoneObject {
   }
 
   static WasmInitExpr I31New(Zone* zone, WasmInitExpr value) {
-    WasmInitExpr expr(kI31New,
-                      zone->New<ZoneVector<WasmInitExpr>>(
-                          std::initializer_list<WasmInitExpr>{value}, zone));
+    WasmInitExpr expr(zone, kI31New, {value});
     return expr;
   }
 
   static WasmInitExpr StringConst(uint32_t index) {
-    WasmInitExpr expr;
-    expr.kind_ = kStringConst;
+    WasmInitExpr expr(kStringConst);
     expr.immediate_.index = index;
     return expr;
   }
 
+  static WasmInitExpr ExternInternalize(Zone* zone, WasmInitExpr arg) {
+    return WasmInitExpr(zone, kExternInternalize, {arg});
+  }
+
+  static WasmInitExpr ExternExternalize(Zone* zone, WasmInitExpr arg) {
+    return WasmInitExpr(zone, kExternExternalize, {arg});
+  }
+
   Immediate immediate() const { return immediate_; }
   Operator kind() const { return kind_; }
   const ZoneVector<WasmInitExpr>* operands() const { return operands_; }
@@ -152,8 +164,6 @@ class WasmInitExpr : public ZoneObject {
   bool operator==(const WasmInitExpr& other) const {
     if (kind() != other.kind()) return false;
     switch (kind()) {
-      case kNone:
-        return true;
       case kGlobalGet:
       case kRefFuncConst:
       case kStringConst:
@@ -180,6 +190,8 @@ class WasmInitExpr : public ZoneObject {
         return immediate().heap_type == other.immediate().heap_type;
       case kStructNew:
       case kStructNewDefault:
+      case kArrayNew:
+      case kArrayNewDefault:
         if (immediate().index != other.immediate().index) return false;
         DCHECK_EQ(operands()->size(), other.operands()->size());
         for (uint32_t i = 0; i < operands()->size(); i++) {
@@ -193,9 +205,10 @@ class WasmInitExpr : public ZoneObject {
           if (operands()[i] != other.operands()[i]) return false;
         }
         return true;
-      case kI31New: {
+      case kI31New:
+      case kExternInternalize:
+      case kExternExternalize:
         return operands_[0] == other.operands_[0];
-      }
     }
   }
 
@@ -203,12 +216,41 @@ class WasmInitExpr : public ZoneObject {
     return !(*this == other);
   }
 
-  ValueType type(const WasmModule* module,
-                 const WasmFeatures& enabled_features) const;
+  static WasmInitExpr DefaultValue(ValueType type) {
+    // No initializer, emit a default value.
+    switch (type.kind()) {
+      case kI8:
+      case kI16:
+      case kI32:
+        return WasmInitExpr(int32_t{0});
+      case kI64:
+        return WasmInitExpr(int64_t{0});
+      case kF32:
+        return WasmInitExpr(0.0f);
+      case kF64:
+        return WasmInitExpr(0.0);
+      case kRefNull:
+        return WasmInitExpr::RefNullConst(type.heap_representation());
+      case kS128: {
+        uint8_t value[kSimd128Size] = {0};
+        return WasmInitExpr(value);
+      }
+      case kVoid:
+      case kBottom:
+      case kRef:
+      case kRtt:
+        UNREACHABLE();
+    }
+  }
 
  private:
   WasmInitExpr(Operator kind, const ZoneVector<WasmInitExpr>* operands)
       : kind_(kind), operands_(operands) {}
+  explicit WasmInitExpr(Operator kind) : kind_(kind), operands_(nullptr) {}
+  WasmInitExpr(Zone* zone, Operator kind,
+               std::initializer_list<WasmInitExpr> operands)
+      : kind_(kind),
+        operands_(zone->New<ZoneVector<WasmInitExpr>>(operands, zone)) {}
   Immediate immediate_;
   Operator kind_;
   const ZoneVector<WasmInitExpr>* operands_;
diff --git a/deps/v8/src/wasm/wasm-js.cc b/deps/v8/src/wasm/wasm-js.cc
index ba12cf19c981a2..199225d230d75a 100644
--- a/deps/v8/src/wasm/wasm-js.cc
+++ b/deps/v8/src/wasm/wasm-js.cc
@@ -151,15 +151,16 @@ std::shared_ptr<WasmStreaming> WasmStreaming::Unpack(Isolate* isolate,
 
 namespace {
 
-#define ASSIGN(type, var, expr)                      \
-  Local<type> var;                                   \
-  do {                                               \
-    if (!expr.ToLocal(&var)) {                       \
-      DCHECK(i_isolate->has_scheduled_exception());  \
-      return;                                        \
-    } else {                                         \
-      DCHECK(!i_isolate->has_scheduled_exception()); \
-    }                                                \
+#define ASSIGN(type, var, expr)                          \
+  Local<type> var;                                       \
+  do {                                                   \
+    if (!expr.ToLocal(&var)) {                           \
+      DCHECK(i_isolate->has_scheduled_exception());      \
+      return;                                            \
+    } else {                                             \
+      if (i_isolate->is_execution_terminating()) return; \
+      DCHECK(!i_isolate->has_scheduled_exception());     \
+    }                                                    \
   } while (false)
 
 i::Handle<i::String> v8_str(i::Isolate* isolate, const char* str) {
@@ -171,10 +172,11 @@ Local<String> v8_str(Isolate* isolate, const char* str) {
 
 #define GET_FIRST_ARGUMENT_AS(Type)                                  \
   i::MaybeHandle<i::Wasm##Type##Object> GetFirstArgumentAs##Type(    \
-      const v8::FunctionCallbackInfo<v8::Value>& args,               \
+      const v8::FunctionCallbackInfo<v8::Value>& info,               \
       ErrorThrower* thrower) {                                       \
-    i::Handle<i::Object> arg0 = Utils::OpenHandle(*args[0]);         \
-    if (!arg0->IsWasm##Type##Object()) {                             \
+    SLOW_DCHECK(i::ValidateCallbackInfo(info));                      \
+    i::Handle<i::Object> arg0 = Utils::OpenHandle(*info[0]);         \
+    if (!IsWasm##Type##Object(*arg0)) {                              \
       thrower->TypeError("Argument 0 must be a WebAssembly." #Type); \
       return {};                                                     \
     }                                                                \
@@ -187,11 +189,12 @@ GET_FIRST_ARGUMENT_AS(Tag)
 #undef GET_FIRST_ARGUMENT_AS
 
 i::wasm::ModuleWireBytes GetFirstArgumentAsBytes(
-    const v8::FunctionCallbackInfo<v8::Value>& args, ErrorThrower* thrower,
+    const v8::FunctionCallbackInfo<v8::Value>& info, ErrorThrower* thrower,
     bool* is_shared) {
+  DCHECK(i::ValidateCallbackInfo(info));
   const uint8_t* start = nullptr;
   size_t length = 0;
-  v8::Local<v8::Value> source = args[0];
+  v8::Local<v8::Value> source = info[0];
   if (source->IsArrayBuffer()) {
     // A raw array buffer was passed.
     Local<ArrayBuffer> buffer = Local<ArrayBuffer>::Cast(source);
@@ -220,8 +223,10 @@ i::wasm::ModuleWireBytes GetFirstArgumentAsBytes(
   }
   size_t max_length = i::wasm::max_module_size();
   if (length > max_length) {
-    thrower->RangeError("buffer source exceeds maximum size of %zu (is %zu)",
-                        max_length, length);
+    // The spec requires a CompileError for implementation-defined limits, see
+    // https://webassembly.github.io/spec/js-api/index.html#limits.
+    thrower->CompileError("buffer source exceeds maximum size of %zu (is %zu)",
+                          max_length, length);
   }
   if (thrower->error()) return i::wasm::ModuleWireBytes(nullptr, nullptr);
   return i::wasm::ModuleWireBytes(start, start + length);
@@ -502,16 +507,17 @@ void RecordCompilationMethod(i::Isolate* isolate, CompilationMethod method) {
 }  // namespace
 
 // WebAssembly.compile(bytes) -> Promise
-void WebAssemblyCompile(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void WebAssemblyCompile(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   constexpr const char* kAPIMethodName = "WebAssembly.compile()";
-  v8::Isolate* isolate = args.GetIsolate();
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   RecordCompilationMethod(i_isolate, kAsyncCompilation);
 
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, kAPIMethodName);
 
-  i::Handle<i::Context> native_context = i_isolate->native_context();
+  i::Handle<i::NativeContext> native_context = i_isolate->native_context();
   if (!i::wasm::IsWasmCodegenAllowed(i_isolate, native_context)) {
     i::Handle<i::String> error =
         i::wasm::ErrorStringForCodegen(i_isolate, native_context);
@@ -521,14 +527,14 @@ void WebAssemblyCompile(const v8::FunctionCallbackInfo<v8::Value>& args) {
   Local<Context> context = isolate->GetCurrentContext();
   ASSIGN(Promise::Resolver, promise_resolver, Promise::Resolver::New(context));
   Local<Promise> promise = promise_resolver->GetPromise();
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   return_value.Set(promise);
 
   std::shared_ptr<i::wasm::CompilationResultResolver> resolver(
       new AsyncCompilationResolver(isolate, context, promise_resolver));
 
   bool is_shared = false;
-  auto bytes = GetFirstArgumentAsBytes(args, &thrower, &is_shared);
+  auto bytes = GetFirstArgumentAsBytes(info, &thrower, &is_shared);
   if (thrower.error()) {
     resolver->OnCompilationFailed(thrower.Reify());
     return;
@@ -541,19 +547,20 @@ void WebAssemblyCompile(const v8::FunctionCallbackInfo<v8::Value>& args) {
 }
 
 void WasmStreamingCallbackForTesting(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
 
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.compile()");
 
   std::shared_ptr<v8::WasmStreaming> streaming =
-      v8::WasmStreaming::Unpack(args.GetIsolate(), args.Data());
+      v8::WasmStreaming::Unpack(info.GetIsolate(), info.Data());
 
   bool is_shared = false;
   i::wasm::ModuleWireBytes bytes =
-      GetFirstArgumentAsBytes(args, &thrower, &is_shared);
+      GetFirstArgumentAsBytes(info, &thrower, &is_shared);
   if (thrower.error()) {
     streaming->Abort(Utils::ToLocal(thrower.Reify()));
     return;
@@ -564,17 +571,19 @@ void WasmStreamingCallbackForTesting(
 }
 
 void WasmStreamingPromiseFailedCallback(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   std::shared_ptr<v8::WasmStreaming> streaming =
-      v8::WasmStreaming::Unpack(args.GetIsolate(), args.Data());
-  streaming->Abort(args[0]);
+      v8::WasmStreaming::Unpack(info.GetIsolate(), info.Data());
+  streaming->Abort(info[0]);
 }
 
 // WebAssembly.compileStreaming(Response | Promise<Response>)
 //   -> Promise<WebAssembly.Module>
 void WebAssemblyCompileStreaming(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   RecordCompilationMethod(i_isolate, kStreamingCompilation);
   HandleScope scope(isolate);
@@ -585,14 +594,14 @@ void WebAssemblyCompileStreaming(
   // Create and assign the return value of this function.
   ASSIGN(Promise::Resolver, promise_resolver, Promise::Resolver::New(context));
   Local<Promise> promise = promise_resolver->GetPromise();
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   return_value.Set(promise);
 
   // Prepare the CompilationResultResolver for the compilation.
   auto resolver = std::make_shared<AsyncCompilationResolver>(isolate, context,
                                                              promise_resolver);
 
-  i::Handle<i::Context> native_context = i_isolate->native_context();
+  i::Handle<i::NativeContext> native_context = i_isolate->native_context();
   if (!i::wasm::IsWasmCodegenAllowed(i_isolate, native_context)) {
     i::Handle<i::String> error =
         i::wasm::ErrorStringForCodegen(i_isolate, native_context);
@@ -626,7 +635,7 @@ void WebAssemblyCompileStreaming(
   // Ending with:
   //    return Promise.resolve(parameter).then(compile_callback);
   ASSIGN(Promise::Resolver, input_resolver, Promise::Resolver::New(context));
-  if (!input_resolver->Resolve(context, args[0]).IsJust()) return;
+  if (!input_resolver->Resolve(context, info[0]).IsJust()) return;
 
   // We do not have any use of the result here. The {compile_callback} will
   // start streaming compilation, which will eventually resolve the promise we
@@ -636,16 +645,17 @@ void WebAssemblyCompileStreaming(
 }
 
 // WebAssembly.validate(bytes) -> bool
-void WebAssemblyValidate(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyValidate(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.validate()");
 
   bool is_shared = false;
-  auto bytes = GetFirstArgumentAsBytes(args, &thrower, &is_shared);
+  auto bytes = GetFirstArgumentAsBytes(info, &thrower, &is_shared);
 
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
 
   if (thrower.error()) {
     if (thrower.wasm_error()) thrower.Reset();  // Clear error.
@@ -669,7 +679,7 @@ void WebAssemblyValidate(const v8::FunctionCallbackInfo<v8::Value>& args) {
                                                        enabled_features, bytes);
   }
 
-  return_value.Set(Boolean::New(isolate, validated));
+  return_value.Set(validated);
 }
 
 namespace {
@@ -692,20 +702,21 @@ bool TransferPrototype(i::Isolate* isolate, i::Handle<i::JSObject> destination,
 }  // namespace
 
 // new WebAssembly.Module(bytes) -> WebAssembly.Module
-void WebAssemblyModule(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyModule(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
-  if (i_isolate->wasm_module_callback()(args)) return;
+  if (i_isolate->wasm_module_callback()(info)) return;
   RecordCompilationMethod(i_isolate, kSyncCompilation);
 
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Module()");
 
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     thrower.TypeError("WebAssembly.Module must be invoked with 'new'");
     return;
   }
-  i::Handle<i::Context> native_context = i_isolate->native_context();
+  i::Handle<i::NativeContext> native_context = i_isolate->native_context();
   if (!i::wasm::IsWasmCodegenAllowed(i_isolate, native_context)) {
     i::Handle<i::String> error =
         i::wasm::ErrorStringForCodegen(i_isolate, native_context);
@@ -714,7 +725,7 @@ void WebAssemblyModule(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
 
   bool is_shared = false;
-  auto bytes = GetFirstArgumentAsBytes(args, &thrower, &is_shared);
+  auto bytes = GetFirstArgumentAsBytes(info, &thrower, &is_shared);
 
   if (thrower.error()) {
     return;
@@ -739,101 +750,105 @@ void WebAssemblyModule(const v8::FunctionCallbackInfo<v8::Value>& args) {
   if (!maybe_module_obj.ToHandle(&module_obj)) return;
 
   // The infrastructure for `new Foo` calls allocates an object, which is
-  // available here as {args.This()}. We're going to discard this object
+  // available here as {info.This()}. We're going to discard this object
   // and use {module_obj} instead, but it does have the correct prototype,
   // which we must harvest from it. This makes a difference when the JS
   // constructor function wasn't {WebAssembly.Module} directly, but some
   // subclass: {module_obj} has {WebAssembly.Module}'s prototype at this
   // point, so we must overwrite that with the correct prototype for {Foo}.
   if (!TransferPrototype(i_isolate, module_obj,
-                         Utils::OpenHandle(*args.This()))) {
+                         Utils::OpenHandle(*info.This()))) {
     return;
   }
 
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   return_value.Set(Utils::ToLocal(i::Handle<i::JSObject>::cast(module_obj)));
 }
 
 // WebAssembly.Module.imports(module) -> Array<Import>
-void WebAssemblyModuleImports(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  HandleScope scope(args.GetIsolate());
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyModuleImports(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  HandleScope scope(info.GetIsolate());
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Module.imports()");
 
-  auto maybe_module = GetFirstArgumentAsModule(args, &thrower);
+  auto maybe_module = GetFirstArgumentAsModule(info, &thrower);
   if (thrower.error()) return;
   auto imports = i::wasm::GetImports(i_isolate, maybe_module.ToHandleChecked());
-  args.GetReturnValue().Set(Utils::ToLocal(imports));
+  info.GetReturnValue().Set(Utils::ToLocal(imports));
 }
 
 // WebAssembly.Module.exports(module) -> Array<Export>
-void WebAssemblyModuleExports(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  HandleScope scope(args.GetIsolate());
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyModuleExports(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  HandleScope scope(info.GetIsolate());
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Module.exports()");
 
-  auto maybe_module = GetFirstArgumentAsModule(args, &thrower);
+  auto maybe_module = GetFirstArgumentAsModule(info, &thrower);
   if (thrower.error()) return;
   auto exports = i::wasm::GetExports(i_isolate, maybe_module.ToHandleChecked());
-  args.GetReturnValue().Set(Utils::ToLocal(exports));
+  info.GetReturnValue().Set(Utils::ToLocal(exports));
 }
 
 // WebAssembly.Module.customSections(module, name) -> Array<Section>
 void WebAssemblyModuleCustomSections(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  HandleScope scope(args.GetIsolate());
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  HandleScope scope(info.GetIsolate());
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate,
                                 "WebAssembly.Module.customSections()");
 
-  auto maybe_module = GetFirstArgumentAsModule(args, &thrower);
+  auto maybe_module = GetFirstArgumentAsModule(info, &thrower);
   if (thrower.error()) return;
 
-  if (args[1]->IsUndefined()) {
+  if (info[1]->IsUndefined()) {
     thrower.TypeError("Argument 1 is required");
     return;
   }
 
   i::MaybeHandle<i::Object> maybe_name =
-      i::Object::ToString(i_isolate, Utils::OpenHandle(*args[1]));
+      i::Object::ToString(i_isolate, Utils::OpenHandle(*info[1]));
   i::Handle<i::Object> name;
   if (!maybe_name.ToHandle(&name)) return;
   auto custom_sections =
       i::wasm::GetCustomSections(i_isolate, maybe_module.ToHandleChecked(),
                                  i::Handle<i::String>::cast(name), &thrower);
   if (thrower.error()) return;
-  args.GetReturnValue().Set(Utils::ToLocal(custom_sections));
+  info.GetReturnValue().Set(Utils::ToLocal(custom_sections));
 }
 
 // new WebAssembly.Instance(module, imports) -> WebAssembly.Instance
-void WebAssemblyInstance(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void WebAssemblyInstance(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   RecordCompilationMethod(i_isolate, kAsyncInstantiation);
   i_isolate->CountUsage(
       v8::Isolate::UseCounterFeature::kWebAssemblyInstantiation);
 
-  HandleScope scope(args.GetIsolate());
-  if (i_isolate->wasm_instance_callback()(args)) return;
+  HandleScope scope(info.GetIsolate());
+  if (i_isolate->wasm_instance_callback()(info)) return;
 
   i::MaybeHandle<i::JSObject> maybe_instance_obj;
   {
     ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Instance()");
-    if (!args.IsConstructCall()) {
+    if (!info.IsConstructCall()) {
       thrower.TypeError("WebAssembly.Instance must be invoked with 'new'");
       return;
     }
 
     i::MaybeHandle<i::WasmModuleObject> maybe_module =
-        GetFirstArgumentAsModule(args, &thrower);
+        GetFirstArgumentAsModule(info, &thrower);
     if (thrower.error()) return;
 
     i::Handle<i::WasmModuleObject> module_obj = maybe_module.ToHandleChecked();
 
-    Local<Value> ffi = args[1];
+    Local<Value> ffi = info[1];
 
     if (!ffi->IsUndefined() && !ffi->IsObject()) {
       thrower.TypeError("Argument 1 must be an object");
@@ -853,26 +868,27 @@ void WebAssemblyInstance(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
 
   // The infrastructure for `new Foo` calls allocates an object, which is
-  // available here as {args.This()}. We're going to discard this object
+  // available here as {info.This()}. We're going to discard this object
   // and use {instance_obj} instead, but it does have the correct prototype,
   // which we must harvest from it. This makes a difference when the JS
   // constructor function wasn't {WebAssembly.Instance} directly, but some
   // subclass: {instance_obj} has {WebAssembly.Instance}'s prototype at this
   // point, so we must overwrite that with the correct prototype for {Foo}.
   if (!TransferPrototype(i_isolate, instance_obj,
-                         Utils::OpenHandle(*args.This()))) {
+                         Utils::OpenHandle(*info.This()))) {
     return;
   }
 
-  args.GetReturnValue().Set(Utils::ToLocal(instance_obj));
+  info.GetReturnValue().Set(Utils::ToLocal(instance_obj));
 }
 
 // WebAssembly.instantiateStreaming(Response | Promise<Response> [, imports])
 //   -> Promise<ResultObject>
 // (where ResultObject has a "module" and an "instance" field)
 void WebAssemblyInstantiateStreaming(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   RecordCompilationMethod(i_isolate, kStreamingInstantiation);
   i_isolate->CountUsage(
@@ -886,7 +902,7 @@ void WebAssemblyInstantiateStreaming(
   // Create and assign the return value of this function.
   ASSIGN(Promise::Resolver, result_resolver, Promise::Resolver::New(context));
   Local<Promise> promise = result_resolver->GetPromise();
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   return_value.Set(promise);
 
   // Create an InstantiateResultResolver in case there is an issue with the
@@ -894,7 +910,7 @@ void WebAssemblyInstantiateStreaming(
   std::unique_ptr<i::wasm::InstantiationResultResolver> resolver(
       new InstantiateModuleResultResolver(isolate, context, result_resolver));
 
-  i::Handle<i::Context> native_context = i_isolate->native_context();
+  i::Handle<i::NativeContext> native_context = i_isolate->native_context();
   if (!i::wasm::IsWasmCodegenAllowed(i_isolate, native_context)) {
     i::Handle<i::String> error =
         i::wasm::ErrorStringForCodegen(i_isolate, native_context);
@@ -903,8 +919,8 @@ void WebAssemblyInstantiateStreaming(
     return;
   }
 
-  // If args.Length < 2, this will be undefined - see FunctionCallbackInfo.
-  Local<Value> ffi = args[1];
+  // If info.Length < 2, this will be undefined - see FunctionCallbackInfo.
+  Local<Value> ffi = info[1];
 
   if (!ffi->IsUndefined() && !ffi->IsObject()) {
     thrower.TypeError("Argument 1 must be an object");
@@ -945,7 +961,7 @@ void WebAssemblyInstantiateStreaming(
   // Ending with:
   //    return Promise.resolve(parameter).then(compile_callback);
   ASSIGN(Promise::Resolver, input_resolver, Promise::Resolver::New(context));
-  if (!input_resolver->Resolve(context, args[0]).IsJust()) return;
+  if (!input_resolver->Resolve(context, info[0]).IsJust()) return;
 
   // We do not have any use of the result here. The {compile_callback} will
   // start streaming compilation, which will eventually resolve the promise we
@@ -957,9 +973,10 @@ void WebAssemblyInstantiateStreaming(
 // WebAssembly.instantiate(module, imports) -> WebAssembly.Instance
 // WebAssembly.instantiate(bytes, imports) ->
 //     {module: WebAssembly.Module, instance: WebAssembly.Instance}
-void WebAssemblyInstantiate(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void WebAssemblyInstantiate(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
   constexpr const char* kAPIMethodName = "WebAssembly.instantiate()";
-  v8::Isolate* isolate = args.GetIsolate();
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   i_isolate->CountUsage(
       v8::Isolate::UseCounterFeature::kWebAssemblyInstantiation);
@@ -972,22 +989,22 @@ void WebAssemblyInstantiate(const v8::FunctionCallbackInfo<v8::Value>& args) {
 
   ASSIGN(Promise::Resolver, promise_resolver, Promise::Resolver::New(context));
   Local<Promise> promise = promise_resolver->GetPromise();
-  args.GetReturnValue().Set(promise);
+  info.GetReturnValue().Set(promise);
 
   std::unique_ptr<i::wasm::InstantiationResultResolver> resolver(
       new InstantiateModuleResultResolver(isolate, context, promise_resolver));
 
-  Local<Value> first_arg_value = args[0];
+  Local<Value> first_arg_value = info[0];
   i::Handle<i::Object> first_arg = Utils::OpenHandle(*first_arg_value);
-  if (!first_arg->IsJSObject()) {
+  if (!IsJSObject(*first_arg)) {
     thrower.TypeError(
         "Argument 0 must be a buffer source or a WebAssembly.Module object");
     resolver->OnInstantiationFailed(thrower.Reify());
     return;
   }
 
-  // If args.Length < 2, this will be undefined - see FunctionCallbackInfo.
-  Local<Value> ffi = args[1];
+  // If info.Length < 2, this will be undefined - see FunctionCallbackInfo.
+  Local<Value> ffi = info[1];
 
   if (!ffi->IsUndefined() && !ffi->IsObject()) {
     thrower.TypeError("Argument 1 must be an object");
@@ -995,7 +1012,7 @@ void WebAssemblyInstantiate(const v8::FunctionCallbackInfo<v8::Value>& args) {
     return;
   }
 
-  if (first_arg->IsWasmModuleObject()) {
+  if (IsWasmModuleObject(*first_arg)) {
     i::Handle<i::WasmModuleObject> module_obj =
         i::Handle<i::WasmModuleObject>::cast(first_arg);
 
@@ -1006,7 +1023,7 @@ void WebAssemblyInstantiate(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
 
   bool is_shared = false;
-  auto bytes = GetFirstArgumentAsBytes(args, &thrower, &is_shared);
+  auto bytes = GetFirstArgumentAsBytes(info, &thrower, &is_shared);
   if (thrower.error()) {
     resolver->OnInstantiationFailed(thrower.Reify());
     return;
@@ -1022,7 +1039,7 @@ void WebAssemblyInstantiate(const v8::FunctionCallbackInfo<v8::Value>& args) {
 
   // The first parameter is a buffer source, we have to check if we are allowed
   // to compile it.
-  i::Handle<i::Context> native_context = i_isolate->native_context();
+  i::Handle<i::NativeContext> native_context = i_isolate->native_context();
   if (!i::wasm::IsWasmCodegenAllowed(i_isolate, native_context)) {
     i::Handle<i::String> error =
         i::wasm::ErrorStringForCodegen(i_isolate, native_context);
@@ -1138,29 +1155,31 @@ i::Handle<i::Object> DefaultReferenceValue(i::Isolate* isolate,
   DCHECK(type.is_object_reference());
   // Use undefined for JS type (externref) but null for wasm types as wasm does
   // not know undefined.
-  if (type.heap_representation() == i::wasm::HeapType::kExtern) {
+  if (type.heap_representation() == i::wasm::HeapType::kExtern ||
+      type.heap_representation() == i::wasm::HeapType::kNoExtern) {
     return isolate->factory()->undefined_value();
   }
   return isolate->factory()->wasm_null();
 }
 }  // namespace
 
-// new WebAssembly.Table(args) -> WebAssembly.Table
-void WebAssemblyTable(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+// new WebAssembly.Table(info) -> WebAssembly.Table
+void WebAssemblyTable(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Table()");
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     thrower.TypeError("WebAssembly.Table must be invoked with 'new'");
     return;
   }
-  if (!args[0]->IsObject()) {
+  if (!info[0]->IsObject()) {
     thrower.TypeError("Argument 0 must be a table descriptor");
     return;
   }
   Local<Context> context = isolate->GetCurrentContext();
-  Local<v8::Object> descriptor = Local<Object>::Cast(args[0]);
+  Local<v8::Object> descriptor = Local<Object>::Cast(info[0]);
   i::wasm::ValueType type;
   // The descriptor's 'element'.
   {
@@ -1210,6 +1229,7 @@ void WebAssemblyTable(const v8::FunctionCallbackInfo<v8::Value>& args) {
   if (!GetInitialOrMinimumProperty(isolate, &thrower, context, descriptor,
                                    &initial, 0,
                                    i::wasm::max_table_init_entries())) {
+    DCHECK(i_isolate->has_scheduled_exception() || thrower.error());
     return;
   }
   // The descriptor's 'maximum'.
@@ -1219,6 +1239,7 @@ void WebAssemblyTable(const v8::FunctionCallbackInfo<v8::Value>& args) {
                                   v8_str(isolate, "maximum"), &has_maximum,
                                   &maximum, initial,
                                   std::numeric_limits<uint32_t>::max())) {
+    DCHECK(i_isolate->has_scheduled_exception() || thrower.error());
     return;
   }
 
@@ -1230,19 +1251,20 @@ void WebAssemblyTable(const v8::FunctionCallbackInfo<v8::Value>& args) {
                               DefaultReferenceValue(i_isolate, type));
 
   // The infrastructure for `new Foo` calls allocates an object, which is
-  // available here as {args.This()}. We're going to discard this object
+  // available here as {info.This()}. We're going to discard this object
   // and use {table_obj} instead, but it does have the correct prototype,
   // which we must harvest from it. This makes a difference when the JS
   // constructor function wasn't {WebAssembly.Table} directly, but some
   // subclass: {table_obj} has {WebAssembly.Table}'s prototype at this
   // point, so we must overwrite that with the correct prototype for {Foo}.
   if (!TransferPrototype(i_isolate, table_obj,
-                         Utils::OpenHandle(*args.This()))) {
+                         Utils::OpenHandle(*info.This()))) {
+    DCHECK(i_isolate->has_pending_exception());
     return;
   }
 
-  if (initial > 0 && args.Length() >= 2 && !args[1]->IsUndefined()) {
-    i::Handle<i::Object> element = Utils::OpenHandle(*args[1]);
+  if (initial > 0 && info.Length() >= 2 && !info[1]->IsUndefined()) {
+    i::Handle<i::Object> element = Utils::OpenHandle(*info[1]);
     const char* error_message;
     if (!i::WasmTableObject::JSToWasmElement(i_isolate, table_obj, element,
                                              &error_message)
@@ -1275,55 +1297,77 @@ void WebAssemblyTable(const v8::FunctionCallbackInfo<v8::Value>& args) {
         break;
     }
   }
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   return_value.Set(Utils::ToLocal(i::Handle<i::JSObject>::cast(table_obj)));
 }
 
-void WebAssemblyMemory(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyMemory(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Memory()");
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     thrower.TypeError("WebAssembly.Memory must be invoked with 'new'");
     return;
   }
-  if (!args[0]->IsObject()) {
+  if (!info[0]->IsObject()) {
     thrower.TypeError("Argument 0 must be a memory descriptor");
     return;
   }
   Local<Context> context = isolate->GetCurrentContext();
-  Local<v8::Object> descriptor = Local<Object>::Cast(args[0]);
+  Local<v8::Object> descriptor = Local<Object>::Cast(info[0]);
+
+  auto memory_flag = i::WasmMemoryFlag::kWasmMemory32;
+  auto max_pages = i::wasm::kSpecMaxMemory32Pages;
+
+  v8::Local<v8::Value> index_value;
+  if (!descriptor->Get(context, v8_str(isolate, "index"))
+           .ToLocal(&index_value)) {
+    DCHECK(i_isolate->has_scheduled_exception());
+    return;
+  }
+
+  if (!index_value->IsUndefined()) {
+    v8::Local<v8::String> index;
+    if (!index_value->ToString(context).ToLocal(&index)) {
+      DCHECK(i_isolate->has_scheduled_exception());
+      return;
+    }
+    if (index->StringEquals(v8_str(isolate, "u64"))) {
+      memory_flag = i::WasmMemoryFlag::kWasmMemory64;
+      max_pages = i::wasm::kSpecMaxMemory64Pages;
+    } else if (!index->StringEquals(v8_str(isolate, "u32"))) {
+      thrower.TypeError("Unknown memory index");
+      return;
+    }
+  }
 
-  // TODO(clemensb): The JS API spec is not updated for memory64 yet; fix this
-  // code once it is.
   int64_t initial = 0;
   if (!GetInitialOrMinimumProperty(isolate, &thrower, context, descriptor,
-                                   &initial, 0,
-                                   i::wasm::kSpecMaxMemory32Pages)) {
+                                   &initial, 0, max_pages)) {
+    DCHECK(i_isolate->has_scheduled_exception() || thrower.error());
     return;
   }
   // The descriptor's 'maximum'.
   int64_t maximum = i::WasmMemoryObject::kNoMaximum;
   if (!GetOptionalIntegerProperty(isolate, &thrower, context, descriptor,
                                   v8_str(isolate, "maximum"), nullptr, &maximum,
-                                  initial, i::wasm::kSpecMaxMemory32Pages)) {
+                                  initial, max_pages)) {
+    DCHECK(i_isolate->has_scheduled_exception() || thrower.error());
     return;
   }
 
-  auto shared = i::SharedFlag::kNotShared;
-  // Shared property of descriptor
-  Local<String> shared_key = v8_str(isolate, "shared");
-  v8::MaybeLocal<v8::Value> maybe_value = descriptor->Get(context, shared_key);
+  // Shared property of descriptor.
   v8::Local<v8::Value> value;
-  if (maybe_value.ToLocal(&value)) {
-    shared = value->BooleanValue(isolate) ? i::SharedFlag::kShared
-                                          : i::SharedFlag::kNotShared;
-  } else {
+  if (!descriptor->Get(context, v8_str(isolate, "shared")).ToLocal(&value)) {
     DCHECK(i_isolate->has_scheduled_exception());
     return;
   }
 
+  auto shared = value->BooleanValue(isolate) ? i::SharedFlag::kShared
+                                             : i::SharedFlag::kNotShared;
+
   // Throw TypeError if shared is true, and the descriptor has no "maximum"
   if (shared == i::SharedFlag::kShared && maximum == -1) {
     thrower.TypeError("If shared is true, maximum property should be defined.");
@@ -1332,21 +1376,22 @@ void WebAssemblyMemory(const v8::FunctionCallbackInfo<v8::Value>& args) {
 
   i::Handle<i::JSObject> memory_obj;
   if (!i::WasmMemoryObject::New(i_isolate, static_cast<int>(initial),
-                                static_cast<int>(maximum), shared)
+                                static_cast<int>(maximum), shared, memory_flag)
            .ToHandle(&memory_obj)) {
     thrower.RangeError("could not allocate memory");
     return;
   }
 
   // The infrastructure for `new Foo` calls allocates an object, which is
-  // available here as {args.This()}. We're going to discard this object
+  // available here as {info.This()}. We're going to discard this object
   // and use {memory_obj} instead, but it does have the correct prototype,
   // which we must harvest from it. This makes a difference when the JS
   // constructor function wasn't {WebAssembly.Memory} directly, but some
   // subclass: {memory_obj} has {WebAssembly.Memory}'s prototype at this
   // point, so we must overwrite that with the correct prototype for {Foo}.
   if (!TransferPrototype(i_isolate, memory_obj,
-                         Utils::OpenHandle(*args.This()))) {
+                         Utils::OpenHandle(*info.This()))) {
+    DCHECK(i_isolate->has_pending_exception());
     return;
   }
 
@@ -1362,7 +1407,7 @@ void WebAssemblyMemory(const v8::FunctionCallbackInfo<v8::Value>& args) {
       return;
     }
   }
-  args.GetReturnValue().Set(Utils::ToLocal(memory_obj));
+  info.GetReturnValue().Set(Utils::ToLocal(memory_obj));
 }
 
 // Determines the type encoded in a value type property (e.g. type reflection).
@@ -1461,21 +1506,22 @@ bool ToF64(Local<v8::Value> value, Local<Context> context, double* f64_value) {
 }  // namespace
 
 // WebAssembly.Global
-void WebAssemblyGlobal(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyGlobal(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Global()");
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     thrower.TypeError("WebAssembly.Global must be invoked with 'new'");
     return;
   }
-  if (!args[0]->IsObject()) {
+  if (!info[0]->IsObject()) {
     thrower.TypeError("Argument 0 must be a global descriptor");
     return;
   }
   Local<Context> context = isolate->GetCurrentContext();
-  Local<v8::Object> descriptor = Local<Object>::Cast(args[0]);
+  Local<v8::Object> descriptor = Local<Object>::Cast(info[0]);
   auto enabled_features = i::wasm::WasmFeatures::FromIsolate(i_isolate);
 
   // The descriptor's 'mutable'.
@@ -1521,19 +1567,19 @@ void WebAssemblyGlobal(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
 
   // The infrastructure for `new Foo` calls allocates an object, which is
-  // available here as {args.This()}. We're going to discard this object
+  // available here as {info.This()}. We're going to discard this object
   // and use {global_obj} instead, but it does have the correct prototype,
   // which we must harvest from it. This makes a difference when the JS
   // constructor function wasn't {WebAssembly.Global} directly, but some
   // subclass: {global_obj} has {WebAssembly.Global}'s prototype at this
   // point, so we must overwrite that with the correct prototype for {Foo}.
   if (!TransferPrototype(i_isolate, global_obj,
-                         Utils::OpenHandle(*args.This()))) {
+                         Utils::OpenHandle(*info.This()))) {
     return;
   }
 
   // Convert value to a WebAssembly value, the default value is 0.
-  Local<v8::Value> value = Local<Value>::Cast(args[1]);
+  Local<v8::Value> value = Local<Value>::Cast(info[1]);
   switch (type.kind()) {
     case i::wasm::kI32: {
       int32_t i32_value = 0;
@@ -1560,25 +1606,29 @@ void WebAssemblyGlobal(const v8::FunctionCallbackInfo<v8::Value>& args) {
       break;
     }
     case i::wasm::kRef:
-      if (args.Length() < 2) {
+      if (info.Length() < 2) {
         thrower.TypeError("Non-defaultable global needs initial value");
         break;
       }
       V8_FALLTHROUGH;
     case i::wasm::kRefNull: {
       // We need the wasm default value {null} over {undefined}.
-      i::Handle<i::Object> value_handle =
-          (args.Length() < 2) ? i_isolate->factory()->null_value()
-                              : Utils::OpenHandle(*value);
-      const char* error_message;
-      // The JS API does not allow for indexed types.
-      // TODO(7748): Fix this if that changes.
-      DCHECK(!type.has_index());
-      if (!i::wasm::JSToWasmObject(i_isolate, value_handle, type,
-                                   &error_message)
-               .ToHandle(&value_handle)) {
-        thrower.TypeError("%s", error_message);
-        break;
+      i::Handle<i::Object> value_handle;
+      if (info.Length() < 2) {
+        value_handle = DefaultReferenceValue(i_isolate, type);
+      } else {
+        value_handle = Utils::OpenHandle(*value);
+        const char* error_message;
+        // While the JS API generally allows indexed types, it currently has
+        // no way to specify such types in `new WebAssembly.Global(...)`.
+        // TODO(14034): Fix this if that changes.
+        DCHECK(!type.has_index());
+        if (!i::wasm::JSToWasmObject(i_isolate, value_handle, type,
+                                     &error_message)
+                 .ToHandle(&value_handle)) {
+          thrower.TypeError("%s", error_message);
+          break;
+        }
       }
       global_obj->SetRef(value_handle);
       break;
@@ -1593,7 +1643,7 @@ void WebAssemblyGlobal(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
 
   i::Handle<i::JSObject> global_js_object(global_obj);
-  args.GetReturnValue().Set(Utils::ToLocal(global_js_object));
+  info.GetReturnValue().Set(Utils::ToLocal(global_js_object));
 }
 
 namespace {
@@ -1612,22 +1662,23 @@ uint32_t GetIterableLength(i::Isolate* isolate, Local<Context> context,
 }  // namespace
 
 // WebAssembly.Tag
-void WebAssemblyTag(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyTag(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
 
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Tag()");
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     thrower.TypeError("WebAssembly.Tag must be invoked with 'new'");
     return;
   }
-  if (!args[0]->IsObject()) {
+  if (!info[0]->IsObject()) {
     thrower.TypeError("Argument 0 must be a tag type");
     return;
   }
 
-  Local<Object> event_type = Local<Object>::Cast(args[0]);
+  Local<Object> event_type = Local<Object>::Cast(info[0]);
   Local<Context> context = isolate->GetCurrentContext();
   auto enabled_features = i::wasm::WasmFeatures::FromIsolate(i_isolate);
 
@@ -1675,17 +1726,18 @@ void WebAssemblyTag(const v8::FunctionCallbackInfo<v8::Value>& args) {
 
   i::Handle<i::JSObject> tag_object =
       i::WasmTagObject::New(i_isolate, &sig, canonical_type_index, tag);
-  args.GetReturnValue().Set(Utils::ToLocal(tag_object));
+  info.GetReturnValue().Set(Utils::ToLocal(tag_object));
 }
 
 // WebAssembly.Suspender
-void WebAssemblySuspender(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblySuspender(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
 
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Suspender()");
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     thrower.TypeError("WebAssembly.Suspender must be invoked with 'new'");
     return;
   }
@@ -1693,26 +1745,27 @@ void WebAssemblySuspender(const v8::FunctionCallbackInfo<v8::Value>& args) {
   i::Handle<i::JSObject> suspender = i::WasmSuspenderObject::New(i_isolate);
 
   // The infrastructure for `new Foo` calls allocates an object, which is
-  // available here as {args.This()}. We're going to discard this object
+  // available here as {info.This()}. We're going to discard this object
   // and use {suspender} instead, but it does have the correct prototype,
   // which we must harvest from it. This makes a difference when the JS
   // constructor function wasn't {WebAssembly.Suspender} directly, but some
   // subclass: {suspender} has {WebAssembly.Suspender}'s prototype at this
   // point, so we must overwrite that with the correct prototype for {Foo}.
   if (!TransferPrototype(i_isolate, suspender,
-                         Utils::OpenHandle(*args.This()))) {
+                         Utils::OpenHandle(*info.This()))) {
+    DCHECK(i_isolate->has_pending_exception());
     return;
   }
-  args.GetReturnValue().Set(Utils::ToLocal(suspender));
+  info.GetReturnValue().Set(Utils::ToLocal(suspender));
 }
 
 namespace {
 
 uint32_t GetEncodedSize(i::Handle<i::WasmTagObject> tag_object) {
   auto serialized_sig = tag_object->serialized_signature();
-  i::wasm::WasmTagSig sig{0, static_cast<size_t>(serialized_sig.length()),
+  i::wasm::WasmTagSig sig{0, static_cast<size_t>(serialized_sig->length()),
                           reinterpret_cast<i::wasm::ValueType*>(
-                              serialized_sig.GetDataStartAddress())};
+                              serialized_sig->GetDataStartAddress())};
   return i::WasmExceptionPackage::GetEncodedSize(&sig);
 }
 
@@ -1727,7 +1780,18 @@ void EncodeExceptionValues(v8::Isolate* isolate,
     thrower->TypeError("Exception values must be an iterable object");
     return;
   }
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   auto values = arg.As<Object>();
+  uint32_t length = GetIterableLength(i_isolate, context, values);
+  if (length == i::kMaxUInt32) {
+    thrower->TypeError("Exception values argument has no length");
+    return;
+  }
+  if (length != static_cast<uint32_t>(signature->length())) {
+    thrower->TypeError(
+        "Number of exception values does not match signature length");
+    return;
+  }
   for (int i = 0; i < signature->length(); ++i) {
     MaybeLocal<Value> maybe_value = values->Get(context, i);
     i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
@@ -1762,28 +1826,18 @@ void EncodeExceptionValues(v8::Isolate* isolate,
         break;
       }
       case i::wasm::kRef:
-      case i::wasm::kRefNull:
-        switch (type.heap_representation()) {
-          case i::wasm::HeapType::kFunc:
-          case i::wasm::HeapType::kExtern:
-          case i::wasm::HeapType::kAny:
-          case i::wasm::HeapType::kEq:
-          case i::wasm::HeapType::kI31:
-          case i::wasm::HeapType::kStruct:
-          case i::wasm::HeapType::kArray:
-          case i::wasm::HeapType::kString:
-          case i::wasm::HeapType::kStringViewWtf8:
-          case i::wasm::HeapType::kStringViewWtf16:
-          case i::wasm::HeapType::kStringViewIter:
-            values_out->set(index++, *Utils::OpenHandle(*value));
-            break;
-          case internal::wasm::HeapType::kBottom:
-            UNREACHABLE();
-          default:
-            // TODO(7748): Add support for custom struct/array types.
-            UNIMPLEMENTED();
+      case i::wasm::kRefNull: {
+        const char* error_message;
+        i::Handle<i::Object> value_handle = Utils::OpenHandle(*value);
+        if (!internal::wasm::JSToWasmObject(i_isolate, value_handle, type,
+                                            &error_message)
+                 .ToHandle(&value_handle)) {
+          thrower->TypeError("%s", error_message);
+          return;
         }
+        values_out->set(index++, *value_handle);
         break;
+      }
       case i::wasm::kRtt:
       case i::wasm::kI8:
       case i::wasm::kI16:
@@ -1797,22 +1851,23 @@ void EncodeExceptionValues(v8::Isolate* isolate,
 
 }  // namespace
 
-void WebAssemblyException(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyException(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
 
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Exception()");
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     thrower.TypeError("WebAssembly.Exception must be invoked with 'new'");
     return;
   }
-  if (!args[0]->IsObject()) {
+  if (!info[0]->IsObject()) {
     thrower.TypeError("Argument 0 must be a WebAssembly tag");
     return;
   }
-  i::Handle<i::Object> arg0 = Utils::OpenHandle(*args[0]);
-  if (!i::HeapObject::cast(*arg0).IsWasmTagObject()) {
+  i::Handle<i::Object> arg0 = Utils::OpenHandle(*info[0]);
+  if (!IsWasmTagObject(i::HeapObject::cast(*arg0))) {
     thrower.TypeError("Argument 0 must be a WebAssembly tag");
     return;
   }
@@ -1829,36 +1884,35 @@ void WebAssemblyException(const v8::FunctionCallbackInfo<v8::Value>& args) {
                                                   runtime_exception));
   i::Handle<i::PodArray<i::wasm::ValueType>> signature(
       tag_object->serialized_signature(), i_isolate);
-  EncodeExceptionValues(isolate, signature, args[1], &thrower, values);
+  EncodeExceptionValues(isolate, signature, info[1], &thrower, values);
   if (thrower.error()) return;
 
   // Third argument: optional ExceptionOption ({traceStack: <bool>}).
-  if (!args[2]->IsNullOrUndefined() && !args[2]->IsObject()) {
+  if (!info[2]->IsNullOrUndefined() && !info[2]->IsObject()) {
     thrower.TypeError("Argument 2 is not an object");
     return;
   }
-  if (args[2]->IsObject()) {
+  if (info[2]->IsObject()) {
     Local<Context> context = isolate->GetCurrentContext();
-    Local<Object> trace_stack_obj = Local<Object>::Cast(args[2]);
+    Local<Object> trace_stack_obj = Local<Object>::Cast(info[2]);
     Local<String> trace_stack_key = v8_str(isolate, "traceStack");
     v8::MaybeLocal<v8::Value> maybe_trace_stack =
         trace_stack_obj->Get(context, trace_stack_key);
     v8::Local<Value> trace_stack_value;
     if (maybe_trace_stack.ToLocal(&trace_stack_value) &&
         trace_stack_value->BooleanValue(isolate)) {
-      auto caller = Utils::OpenHandle(*args.NewTarget());
-      i_isolate->CaptureAndSetErrorStack(runtime_exception, i::SKIP_NONE,
-                                         caller);
-      i::Handle<i::AccessorInfo> error_stack =
-          i_isolate->factory()->error_stack_accessor();
-      i::Handle<i::Name> name(i::Name::cast(error_stack->name()), i_isolate);
-      i::JSObject::SetAccessor(runtime_exception, name, error_stack,
-                               i::DONT_ENUM)
-          .Assert();
+      auto caller = Utils::OpenHandle(*info.NewTarget());
+
+      i::Handle<i::Object> capture_result;
+      if (!i::ErrorUtils::CaptureStackTrace(i_isolate, runtime_exception,
+                                            i::SKIP_NONE, caller)
+               .ToHandle(&capture_result)) {
+        return;
+      }
     }
   }
 
-  args.GetReturnValue().Set(
+  info.GetReturnValue().Set(
       Utils::ToLocal(i::Handle<i::Object>::cast(runtime_exception)));
 }
 
@@ -1933,20 +1987,21 @@ bool IsPromisingSignature(const i::wasm::FunctionSig* inner_sig,
 }  // namespace
 
 // WebAssembly.Function
-void WebAssemblyFunction(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyFunction(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Function()");
-  if (!args.IsConstructCall()) {
+  if (!info.IsConstructCall()) {
     thrower.TypeError("WebAssembly.Function must be invoked with 'new'");
     return;
   }
-  if (!args[0]->IsObject()) {
+  if (!info[0]->IsObject()) {
     thrower.TypeError("Argument 0 must be a function type");
     return;
   }
-  Local<Object> function_type = Local<Object>::Cast(args[0]);
+  Local<Object> function_type = Local<Object>::Cast(info[0]);
   Local<Context> context = isolate->GetCurrentContext();
   auto enabled_features = i::wasm::WasmFeatures::FromIsolate(i_isolate);
 
@@ -2018,27 +2073,27 @@ void WebAssemblyFunction(const v8::FunctionCallbackInfo<v8::Value>& args) {
     builder.AddReturn(type);
   }
 
-  if (!args[1]->IsFunction()) {
+  if (!info[1]->IsFunction()) {
     thrower.TypeError("Argument 1 must be a function");
     return;
   }
   const i::wasm::FunctionSig* sig = builder.Build();
 
   i::Handle<i::JSReceiver> callable =
-      Utils::OpenHandle(*args[1].As<Function>());
+      Utils::OpenHandle(*info[1].As<Function>());
 
   i::wasm::Suspend suspend = i::wasm::kNoSuspend;
   i::wasm::Promise promise = i::wasm::kNoPromise;
   if (i::v8_flags.experimental_wasm_stack_switching) {
     // Optional third argument for JS Promise Integration.
-    if (!args[2]->IsNullOrUndefined() && !args[2]->IsObject()) {
+    if (!info[2]->IsNullOrUndefined() && !info[2]->IsObject()) {
       thrower.TypeError(
           "Expected argument 3 to be an object with a "
           "'suspending' or 'promising' property");
       return;
     }
-    if (args[2]->IsObject()) {
-      Local<Object> usage_obj = Local<Object>::Cast(args[2]);
+    if (info[2]->IsObject()) {
+      Local<Object> usage_obj = Local<Object>::Cast(info[2]);
       if (HasJSPromiseIntegrationFlag(isolate, usage_obj, &thrower,
                                       "suspending")) {
         suspend = i::wasm::kSuspend;
@@ -2059,7 +2114,7 @@ void WebAssemblyFunction(const v8::FunctionCallbackInfo<v8::Value>& args) {
         i::wasm::GetWasmEngine()->type_canonicalizer()->AddRecursiveGroup(sig);
     if (i::Handle<i::WasmExportedFunction>::cast(callable)->MatchesSignature(
             canonical_sig_index)) {
-      args.GetReturnValue().Set(Utils::ToLocal(callable));
+      info.GetReturnValue().Set(Utils::ToLocal(callable));
       return;
     }
 
@@ -2074,7 +2129,7 @@ void WebAssemblyFunction(const v8::FunctionCallbackInfo<v8::Value>& args) {
         i::wasm::GetWasmEngine()->type_canonicalizer()->AddRecursiveGroup(sig);
     if (i::Handle<i::WasmJSFunction>::cast(callable)->MatchesSignature(
             canonical_sig_index)) {
-      args.GetReturnValue().Set(Utils::ToLocal(callable));
+      info.GetReturnValue().Set(Utils::ToLocal(callable));
       return;
     }
 
@@ -2091,21 +2146,49 @@ void WebAssemblyFunction(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
   if (is_wasm_exported_function && promise) {
     auto wasm_exported_function = i::WasmExportedFunction::cast(*callable);
-    i::SharedFunctionInfo sfi = wasm_exported_function.shared();
-    i::WasmExportedFunctionData data = sfi.wasm_exported_function_data();
-    if (!IsPromisingSignature(data.sig(), sig)) {
+    i::Handle<i::WasmExportedFunctionData> data(
+        wasm_exported_function->shared()->wasm_exported_function_data(),
+        i_isolate);
+    if (!IsPromisingSignature(data->sig(), sig)) {
       thrower.TypeError("Incompatible signature for promising function");
       return;
     }
     i::Handle<i::WasmInstanceObject> instance(
-        i::WasmInstanceObject::cast(data.internal().ref()), i_isolate);
-    int func_index = data.function_index();
+        i::WasmInstanceObject::cast(data->internal()->ref()), i_isolate);
+    int func_index = data->function_index();
     i::Handle<i::Code> wrapper =
         BUILTIN_CODE(i_isolate, WasmReturnPromiseOnSuspend);
+
+    i::Handle<i::Map> rtt;
+    bool has_gc =
+        instance->module_object()->native_module()->enabled_features().has_gc();
+    if (has_gc) {
+      int sig_index = instance->module()->functions[func_index].sig_index;
+      // TODO(14034): Create funcref RTTs lazily?
+      rtt =
+          handle(i::Map::cast(instance->managed_object_maps()->get(sig_index)),
+                 i_isolate);
+    } else {
+      rtt = i_isolate->factory()->wasm_internal_function_map();
+    }
+
+    int num_imported_functions = instance->module()->num_imported_functions;
+    i::Handle<i::HeapObject> ref =
+        func_index >= num_imported_functions
+            ? instance
+            : i::handle(
+                  i::HeapObject::cast(
+                      instance->imported_function_refs()->get(func_index)),
+                  i_isolate);
+
+    i::Handle<i::WasmInternalFunction> internal =
+        i_isolate->factory()->NewWasmInternalFunction(
+            instance->GetCallTarget(func_index), ref, rtt, func_index);
+
     i::Handle<i::JSFunction> result = i::WasmExportedFunction::New(
-        i_isolate, instance, func_index,
-        static_cast<int>(data.sig()->parameter_count()), wrapper);
-    args.GetReturnValue().Set(Utils::ToLocal(result));
+        i_isolate, instance, internal, func_index,
+        static_cast<int>(data->sig()->parameter_count()), wrapper);
+    info.GetReturnValue().Set(Utils::ToLocal(result));
     return;
   }
   if (is_wasm_js_function && promise) {
@@ -2119,7 +2202,7 @@ void WebAssemblyFunction(const v8::FunctionCallbackInfo<v8::Value>& args) {
   if (is_wasm_js_function && suspend) {
     auto wasm_js_function = i::WasmJSFunction::cast(*callable);
     const i::wasm::FunctionSig* inner_sig =
-        wasm_js_function.GetSignature(&zone);
+        wasm_js_function->GetSignature(&zone);
     if (!IsSuspendingSignature(inner_sig, sig)) {
       thrower.TypeError("Incompatible signature for suspending function");
       return;
@@ -2127,19 +2210,20 @@ void WebAssemblyFunction(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
   i::Handle<i::JSFunction> result =
       i::WasmJSFunction::New(i_isolate, sig, callable, suspend);
-  args.GetReturnValue().Set(Utils::ToLocal(result));
+  info.GetReturnValue().Set(Utils::ToLocal(result));
 }
 
 // WebAssembly.Function.type(WebAssembly.Function) -> FunctionType
-void WebAssemblyFunctionType(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyFunctionType(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Function.type()");
 
   const i::wasm::FunctionSig* sig;
   i::Zone zone(i_isolate->allocator(), ZONE_NAME);
-  i::Handle<i::Object> arg0 = Utils::OpenHandle(*args[0]);
+  i::Handle<i::Object> arg0 = Utils::OpenHandle(*info[0]);
   if (i::WasmExportedFunction::IsWasmExportedFunction(*arg0)) {
     auto wasm_exported_function =
         i::Handle<i::WasmExportedFunction>::cast(arg0);
@@ -2170,7 +2254,7 @@ void WebAssemblyFunctionType(const v8::FunctionCallbackInfo<v8::Value>& args) {
   }
 
   auto type = i::wasm::GetTypeForFunction(i_isolate, sig);
-  args.GetReturnValue().Set(Utils::ToLocal(type));
+  info.GetReturnValue().Set(Utils::ToLocal(type));
 }
 
 constexpr const char* kName_WasmGlobalObject = "WebAssembly.Global";
@@ -2183,8 +2267,8 @@ constexpr const char* kName_WasmExceptionPackage = "WebAssembly.Exception";
 #define EXTRACT_THIS(var, WasmType)                                  \
   i::Handle<i::WasmType> var;                                        \
   {                                                                  \
-    i::Handle<i::Object> this_arg = Utils::OpenHandle(*args.This()); \
-    if (!this_arg->Is##WasmType()) {                                 \
+    i::Handle<i::Object> this_arg = Utils::OpenHandle(*info.This()); \
+    if (!Is##WasmType(*this_arg)) {                                  \
       thrower.TypeError("Receiver is not a %s", kName_##WasmType);   \
       return;                                                        \
     }                                                                \
@@ -2192,30 +2276,33 @@ constexpr const char* kName_WasmExceptionPackage = "WebAssembly.Exception";
   }
 
 void WebAssemblyInstanceGetExports(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Instance.exports()");
   EXTRACT_THIS(receiver, WasmInstanceObject);
   i::Handle<i::JSObject> exports_object(receiver->exports_object(), i_isolate);
-  args.GetReturnValue().Set(Utils::ToLocal(exports_object));
+  info.GetReturnValue().Set(Utils::ToLocal(exports_object));
 }
 
 void WebAssemblyTableGetLength(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Table.length()");
   EXTRACT_THIS(receiver, WasmTableObject);
-  args.GetReturnValue().Set(
+  info.GetReturnValue().Set(
       v8::Number::New(isolate, receiver->current_length()));
 }
 
 // WebAssembly.Table.grow(num, init_value = null) -> num
-void WebAssemblyTableGrow(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyTableGrow(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Table.grow()");
@@ -2223,14 +2310,14 @@ void WebAssemblyTableGrow(const v8::FunctionCallbackInfo<v8::Value>& args) {
   EXTRACT_THIS(receiver, WasmTableObject);
 
   uint32_t grow_by;
-  if (!EnforceUint32("Argument 0", args[0], context, &thrower, &grow_by)) {
+  if (!EnforceUint32("Argument 0", info[0], context, &thrower, &grow_by)) {
     return;
   }
 
   i::Handle<i::Object> init_value;
 
-  if (args.Length() >= 2 && !args[1]->IsUndefined()) {
-    init_value = Utils::OpenHandle(*args[1]);
+  if (info.Length() >= 2) {
+    init_value = Utils::OpenHandle(*info[1]);
     const char* error_message;
     if (!i::WasmTableObject::JSToWasmElement(i_isolate, receiver, init_value,
                                              &error_message)
@@ -2252,7 +2339,7 @@ void WebAssemblyTableGrow(const v8::FunctionCallbackInfo<v8::Value>& args) {
     thrower.RangeError("failed to grow table by %u", grow_by);
     return;
   }
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   return_value.Set(old_size);
 }
 
@@ -2261,20 +2348,28 @@ void WasmObjectToJSReturnValue(v8::ReturnValue<v8::Value>& return_value,
                                i::Handle<i::Object> value,
                                i::wasm::HeapType type, i::Isolate* isolate,
                                ScheduledErrorThrower* thrower) {
-  const char* error_message = nullptr;
-  i::MaybeHandle<i::Object> maybe_result =
-      i::wasm::WasmToJSObject(isolate, value, type, &error_message);
-  if (maybe_result.is_null()) {
-    thrower->TypeError("%s", error_message);
-  } else {
-    return_value.Set(Utils::ToLocal(maybe_result.ToHandleChecked()));
+  switch (type.representation()) {
+    case internal::wasm::HeapType::kStringViewWtf8:
+      thrower->TypeError("%s", "stringview_wtf8 has no JS representation");
+      break;
+    case internal::wasm::HeapType::kStringViewWtf16:
+      thrower->TypeError("%s", "stringview_wtf16 has no JS representation");
+      break;
+    case internal::wasm::HeapType::kStringViewIter:
+      thrower->TypeError("%s", "stringview_iter has no JS representation");
+      break;
+    default: {
+      return_value.Set(Utils::ToLocal(i::wasm::WasmToJSObject(isolate, value)));
+      break;
+    }
   }
 }
 }  // namespace
 
 // WebAssembly.Table.get(num) -> any
-void WebAssemblyTableGet(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyTableGet(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Table.get()");
@@ -2282,38 +2377,28 @@ void WebAssemblyTableGet(const v8::FunctionCallbackInfo<v8::Value>& args) {
   EXTRACT_THIS(receiver, WasmTableObject);
 
   uint32_t index;
-  if (!EnforceUint32("Argument 0", args[0], context, &thrower, &index)) {
-    return;
-  }
-  if (!i::WasmTableObject::IsInBounds(i_isolate, receiver, index)) {
-    thrower.RangeError("invalid index %u into function table", index);
-    return;
-  }
-
-  if (receiver->type() == i::wasm::kWasmStringViewWtf8) {
-    thrower.TypeError("stringview_wtf8 has no JS representation");
-    return;
-  }
-  if (receiver->type() == i::wasm::kWasmStringViewWtf16) {
-    thrower.TypeError("stringview_wtf16 has no JS representation");
+  if (!EnforceUint32("Argument 0", info[0], context, &thrower, &index)) {
     return;
   }
-  if (receiver->type() == i::wasm::kWasmStringViewIter) {
-    thrower.TypeError("stringview_iter has no JS representation");
+  if (!receiver->is_in_bounds(index)) {
+    thrower.RangeError("invalid index %u into %s table of size %d", index,
+                       receiver->type().name().c_str(),
+                       receiver->current_length());
     return;
   }
 
   i::Handle<i::Object> result =
       i::WasmTableObject::Get(i_isolate, receiver, index);
 
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   WasmObjectToJSReturnValue(return_value, result, receiver->type().heap_type(),
                             i_isolate, &thrower);
 }
 
 // WebAssembly.Table.set(num, any)
-void WebAssemblyTableSet(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyTableSet(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Table.set()");
@@ -2322,17 +2407,19 @@ void WebAssemblyTableSet(const v8::FunctionCallbackInfo<v8::Value>& args) {
 
   // Parameter 0.
   uint32_t index;
-  if (!EnforceUint32("Argument 0", args[0], context, &thrower, &index)) {
+  if (!EnforceUint32("Argument 0", info[0], context, &thrower, &index)) {
     return;
   }
-  if (!i::WasmTableObject::IsInBounds(i_isolate, table_object, index)) {
-    thrower.RangeError("invalid index %u into function table", index);
+  if (!table_object->is_in_bounds(index)) {
+    thrower.RangeError("invalid index %u into %s table of size %d", index,
+                       table_object->type().name().c_str(),
+                       table_object->current_length());
     return;
   }
 
   i::Handle<i::Object> element;
-  if (args.Length() >= 2) {
-    element = Utils::OpenHandle(*args[1]);
+  if (info.Length() >= 2) {
+    element = Utils::OpenHandle(*info[1]);
     const char* error_message;
     if (!i::WasmTableObject::JSToWasmElement(i_isolate, table_object, element,
                                              &error_message)
@@ -2352,27 +2439,29 @@ void WebAssemblyTableSet(const v8::FunctionCallbackInfo<v8::Value>& args) {
 }
 
 // WebAssembly.Table.type() -> TableType
-void WebAssemblyTableType(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyTableType(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Table.type()");
 
   EXTRACT_THIS(table, WasmTableObject);
   base::Optional<uint32_t> max_size;
-  if (!table->maximum_length().IsUndefined()) {
-    uint64_t max_size64 = table->maximum_length().Number();
+  if (!IsUndefined(table->maximum_length())) {
+    uint64_t max_size64 = i::Object::Number(table->maximum_length());
     DCHECK_LE(max_size64, std::numeric_limits<uint32_t>::max());
     max_size.emplace(static_cast<uint32_t>(max_size64));
   }
   auto type = i::wasm::GetTypeForTable(i_isolate, table->type(),
                                        table->current_length(), max_size);
-  args.GetReturnValue().Set(Utils::ToLocal(type));
+  info.GetReturnValue().Set(Utils::ToLocal(type));
 }
 
 // WebAssembly.Memory.grow(num) -> num
-void WebAssemblyMemoryGrow(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyMemoryGrow(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Memory.grow()");
@@ -2380,7 +2469,7 @@ void WebAssemblyMemoryGrow(const v8::FunctionCallbackInfo<v8::Value>& args) {
   EXTRACT_THIS(receiver, WasmMemoryObject);
 
   uint32_t delta_pages;
-  if (!EnforceUint32("Argument 0", args[0], context, &thrower, &delta_pages)) {
+  if (!EnforceUint32("Argument 0", info[0], context, &thrower, &delta_pages)) {
     return;
   }
 
@@ -2399,21 +2488,22 @@ void WebAssemblyMemoryGrow(const v8::FunctionCallbackInfo<v8::Value>& args) {
     thrower.RangeError("Unable to grow instance memory");
     return;
   }
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   return_value.Set(ret);
 }
 
 // WebAssembly.Memory.buffer -> ArrayBuffer
 void WebAssemblyMemoryGetBuffer(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Memory.buffer");
   EXTRACT_THIS(receiver, WasmMemoryObject);
 
   i::Handle<i::Object> buffer_obj(receiver->array_buffer(), i_isolate);
-  DCHECK(buffer_obj->IsJSArrayBuffer());
+  DCHECK(IsJSArrayBuffer(*buffer_obj));
   i::Handle<i::JSArrayBuffer> buffer(i::JSArrayBuffer::cast(*buffer_obj),
                                      i_isolate);
   if (buffer->is_shared()) {
@@ -2427,13 +2517,14 @@ void WebAssemblyMemoryGetBuffer(
           "Status of setting SetIntegrityLevel of buffer is false.");
     }
   }
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
   return_value.Set(Utils::ToLocal(buffer));
 }
 
 // WebAssembly.Memory.type() -> MemoryType
-void WebAssemblyMemoryType(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyMemoryType(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Memory.type()");
@@ -2450,13 +2541,15 @@ void WebAssemblyMemoryType(const v8::FunctionCallbackInfo<v8::Value>& args) {
     max_size.emplace(static_cast<uint32_t>(max_size64));
   }
   bool shared = buffer->is_shared();
-  auto type = i::wasm::GetTypeForMemory(i_isolate, min_size, max_size, shared);
-  args.GetReturnValue().Set(Utils::ToLocal(type));
+  auto type = i::wasm::GetTypeForMemory(i_isolate, min_size, max_size, shared,
+                                        memory->is_memory64());
+  info.GetReturnValue().Set(Utils::ToLocal(type));
 }
 
 // WebAssembly.Tag.type() -> FunctionType
-void WebAssemblyTagType(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyTagType(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Tag.type()");
@@ -2464,20 +2557,21 @@ void WebAssemblyTagType(const v8::FunctionCallbackInfo<v8::Value>& args) {
   EXTRACT_THIS(tag, WasmTagObject);
   if (thrower.error()) return;
 
-  int n = tag->serialized_signature().length();
+  int n = tag->serialized_signature()->length();
   std::vector<i::wasm::ValueType> data(n);
   if (n > 0) {
-    tag->serialized_signature().copy_out(0, data.data(), n);
+    tag->serialized_signature()->copy_out(0, data.data(), n);
   }
   const i::wasm::FunctionSig sig{0, data.size(), data.data()};
   constexpr bool kForException = true;
   auto type = i::wasm::GetTypeForFunction(i_isolate, &sig, kForException);
-  args.GetReturnValue().Set(Utils::ToLocal(type));
+  info.GetReturnValue().Set(Utils::ToLocal(type));
 }
 
 void WebAssemblyExceptionGetArg(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Exception.getArg()");
@@ -2486,12 +2580,12 @@ void WebAssemblyExceptionGetArg(
   if (thrower.error()) return;
 
   i::MaybeHandle<i::WasmTagObject> maybe_tag =
-      GetFirstArgumentAsTag(args, &thrower);
+      GetFirstArgumentAsTag(info, &thrower);
   if (thrower.error()) return;
   auto tag = maybe_tag.ToHandleChecked();
   Local<Context> context = isolate->GetCurrentContext();
   uint32_t index;
-  if (!EnforceUint32("Index", args[1], context, &thrower, &index)) {
+  if (!EnforceUint32("Index", info[1], context, &thrower, &index)) {
     return;
   }
   auto maybe_values =
@@ -2499,16 +2593,16 @@ void WebAssemblyExceptionGetArg(
 
   auto this_tag =
       i::WasmExceptionPackage::GetExceptionTag(i_isolate, exception);
-  DCHECK(this_tag->IsWasmExceptionTag());
+  DCHECK(IsWasmExceptionTag(*this_tag));
   if (tag->tag() != *this_tag) {
     thrower.TypeError("First argument does not match the exception tag");
     return;
   }
 
-  DCHECK(!maybe_values->IsUndefined());
+  DCHECK(!IsUndefined(*maybe_values));
   auto values = i::Handle<i::FixedArray>::cast(maybe_values);
   auto signature = tag->serialized_signature();
-  if (index >= static_cast<uint32_t>(signature.length())) {
+  if (index >= static_cast<uint32_t>(signature->length())) {
     thrower.RangeError("Index out of range");
     return;
   }
@@ -2516,7 +2610,7 @@ void WebAssemblyExceptionGetArg(
   uint32_t decode_index = 0;
   // Since the bounds check above passed, the cast to int is safe.
   for (int i = 0; i < static_cast<int>(index); ++i) {
-    switch (signature.get(i).kind()) {
+    switch (signature->get(i).kind()) {
       case i::wasm::kI32:
       case i::wasm::kF32:
         decode_index += 2;
@@ -2527,26 +2621,7 @@ void WebAssemblyExceptionGetArg(
         break;
       case i::wasm::kRef:
       case i::wasm::kRefNull:
-        switch (signature.get(i).heap_representation()) {
-          case i::wasm::HeapType::kFunc:
-          case i::wasm::HeapType::kExtern:
-          case i::wasm::HeapType::kAny:
-          case i::wasm::HeapType::kEq:
-          case i::wasm::HeapType::kI31:
-          case i::wasm::HeapType::kStruct:
-          case i::wasm::HeapType::kArray:
-          case i::wasm::HeapType::kString:
-          case i::wasm::HeapType::kStringViewWtf8:
-          case i::wasm::HeapType::kStringViewWtf16:
-          case i::wasm::HeapType::kStringViewIter:
-            decode_index++;
-            break;
-          case i::wasm::HeapType::kBottom:
-            UNREACHABLE();
-          default:
-            // TODO(7748): Add support for custom struct/array types.
-            UNIMPLEMENTED();
-        }
+        decode_index++;
         break;
       case i::wasm::kRtt:
       case i::wasm::kI8:
@@ -2559,7 +2634,7 @@ void WebAssemblyExceptionGetArg(
   }
   // Decode the value at {decode_index}.
   Local<Value> result;
-  switch (signature.get(index).kind()) {
+  switch (signature->get(index).kind()) {
     case i::wasm::kI32: {
       uint32_t u32_bits = 0;
       i::DecodeI32ExceptionValue(values, &decode_index, &u32_bits);
@@ -2589,30 +2664,13 @@ void WebAssemblyExceptionGetArg(
       break;
     }
     case i::wasm::kRef:
-    case i::wasm::kRefNull:
-      switch (signature.get(index).heap_representation()) {
-        case i::wasm::HeapType::kFunc:
-        case i::wasm::HeapType::kExtern:
-        case i::wasm::HeapType::kAny:
-        case i::wasm::HeapType::kEq:
-        case i::wasm::HeapType::kI31:
-        case i::wasm::HeapType::kArray:
-        case i::wasm::HeapType::kStruct:
-        case i::wasm::HeapType::kString:
-        case i::wasm::HeapType::kStringViewWtf8:
-        case i::wasm::HeapType::kStringViewWtf16:
-        case i::wasm::HeapType::kStringViewIter: {
-          auto obj = values->get(decode_index);
-          result = Utils::ToLocal(i::Handle<i::Object>(obj, i_isolate));
-          break;
-        }
-        case i::wasm::HeapType::kBottom:
-          UNREACHABLE();
-        default:
-          // TODO(7748): Add support for custom struct/array types.
-          UNIMPLEMENTED();
-      }
-      break;
+    case i::wasm::kRefNull: {
+      i::Handle<i::Object> obj = handle(values->get(decode_index), i_isolate);
+      ReturnValue<Value> return_value = info.GetReturnValue();
+      return WasmObjectToJSReturnValue(return_value, obj,
+                                       signature->get(index).heap_type(),
+                                       i_isolate, &thrower);
+    }
     case i::wasm::kRtt:
     case i::wasm::kI8:
     case i::wasm::kI16:
@@ -2621,11 +2679,12 @@ void WebAssemblyExceptionGetArg(
     case i::wasm::kS128:
       UNREACHABLE();
   }
-  args.GetReturnValue().Set(result);
+  info.GetReturnValue().Set(result);
 }
 
-void WebAssemblyExceptionIs(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyExceptionIs(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Exception.is()");
@@ -2634,25 +2693,26 @@ void WebAssemblyExceptionIs(const v8::FunctionCallbackInfo<v8::Value>& args) {
   if (thrower.error()) return;
 
   auto tag = i::WasmExceptionPackage::GetExceptionTag(i_isolate, exception);
-  DCHECK(tag->IsWasmExceptionTag());
+  DCHECK(IsWasmExceptionTag(*tag));
 
-  auto maybe_tag = GetFirstArgumentAsTag(args, &thrower);
+  auto maybe_tag = GetFirstArgumentAsTag(info, &thrower);
   if (thrower.error()) {
     return;
   }
   auto tag_arg = maybe_tag.ToHandleChecked();
-  args.GetReturnValue().Set(tag_arg->tag() == *tag);
+  info.GetReturnValue().Set(tag_arg->tag() == *tag);
 }
 
 void WebAssemblyGlobalGetValueCommon(
-    const v8::FunctionCallbackInfo<v8::Value>& args, const char* name) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info, const char* name) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   ScheduledErrorThrower thrower(i_isolate, name);
   EXTRACT_THIS(receiver, WasmGlobalObject);
 
-  v8::ReturnValue<v8::Value> return_value = args.GetReturnValue();
+  v8::ReturnValue<v8::Value> return_value = info.GetReturnValue();
 
   switch (receiver->type().kind()) {
     case i::wasm::kI32:
@@ -2689,20 +2749,23 @@ void WebAssemblyGlobalGetValueCommon(
 }
 
 // WebAssembly.Global.valueOf() -> num
-void WebAssemblyGlobalValueOf(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  return WebAssemblyGlobalGetValueCommon(args, "WebAssembly.Global.valueOf()");
+void WebAssemblyGlobalValueOf(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  return WebAssemblyGlobalGetValueCommon(info, "WebAssembly.Global.valueOf()");
 }
 
 // get WebAssembly.Global.value -> num
 void WebAssemblyGlobalGetValue(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  return WebAssemblyGlobalGetValueCommon(args, "get WebAssembly.Global.value");
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  return WebAssemblyGlobalGetValueCommon(info, "get WebAssembly.Global.value");
 }
 
 // set WebAssembly.Global.value(num)
 void WebAssemblyGlobalSetValue(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   HandleScope scope(isolate);
   Local<Context> context = isolate->GetCurrentContext();
@@ -2713,7 +2776,7 @@ void WebAssemblyGlobalSetValue(
     thrower.TypeError("Can't set the value of an immutable global.");
     return;
   }
-  if (args.Length() == 0) {
+  if (info.Length() == 0) {
     thrower.TypeError("Argument 0 is required");
     return;
   }
@@ -2721,25 +2784,25 @@ void WebAssemblyGlobalSetValue(
   switch (receiver->type().kind()) {
     case i::wasm::kI32: {
       int32_t i32_value = 0;
-      if (!args[0]->Int32Value(context).To(&i32_value)) return;
+      if (!info[0]->Int32Value(context).To(&i32_value)) return;
       receiver->SetI32(i32_value);
       break;
     }
     case i::wasm::kI64: {
       v8::Local<v8::BigInt> bigint_value;
-      if (!args[0]->ToBigInt(context).ToLocal(&bigint_value)) return;
+      if (!info[0]->ToBigInt(context).ToLocal(&bigint_value)) return;
       receiver->SetI64(bigint_value->Int64Value());
       break;
     }
     case i::wasm::kF32: {
       double f64_value = 0;
-      if (!args[0]->NumberValue(context).To(&f64_value)) return;
+      if (!info[0]->NumberValue(context).To(&f64_value)) return;
       receiver->SetF32(i::DoubleToFloat32(f64_value));
       break;
     }
     case i::wasm::kF64: {
       double f64_value = 0;
-      if (!args[0]->NumberValue(context).To(&f64_value)) return;
+      if (!info[0]->NumberValue(context).To(&f64_value)) return;
       receiver->SetF64(f64_value);
       break;
     }
@@ -2749,10 +2812,10 @@ void WebAssemblyGlobalSetValue(
     case i::wasm::kRef:
     case i::wasm::kRefNull: {
       const i::wasm::WasmModule* module =
-          receiver->instance().IsWasmInstanceObject()
-              ? i::WasmInstanceObject::cast(receiver->instance()).module()
+          IsWasmInstanceObject(receiver->instance())
+              ? i::WasmInstanceObject::cast(receiver->instance())->module()
               : nullptr;
-      i::Handle<i::Object> value = Utils::OpenHandle(*args[0]);
+      i::Handle<i::Object> value = Utils::OpenHandle(*info[0]);
       const char* error_message;
       if (!i::wasm::JSToWasmObject(i_isolate, module, value, receiver->type(),
                                    &error_message)
@@ -2773,8 +2836,9 @@ void WebAssemblyGlobalSetValue(
 }
 
 // WebAssembly.Global.type() -> GlobalType
-void WebAssemblyGlobalType(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void WebAssemblyGlobalType(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  DCHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   ScheduledErrorThrower thrower(i_isolate, "WebAssembly.Global.type()");
@@ -2782,7 +2846,7 @@ void WebAssemblyGlobalType(const v8::FunctionCallbackInfo<v8::Value>& args) {
   EXTRACT_THIS(global, WasmGlobalObject);
   auto type = i::wasm::GetTypeForGlobal(i_isolate, global->is_mutable(),
                                         global->type());
-  args.GetReturnValue().Set(Utils::ToLocal(type));
+  info.GetReturnValue().Set(Utils::ToLocal(type));
 }
 
 }  // namespace
@@ -2817,8 +2881,8 @@ Handle<JSFunction> CreateFunc(
   Handle<FunctionTemplateInfo> temp =
       NewFunctionTemplate(isolate, func, has_prototype, side_effect_type);
   Handle<JSFunction> function =
-      ApiNatives::InstantiateFunction(temp, name).ToHandleChecked();
-  DCHECK(function->shared().HasSharedName());
+      ApiNatives::InstantiateFunction(isolate, temp, name).ToHandleChecked();
+  DCHECK(function->shared()->HasSharedName());
   return function;
 }
 
@@ -2830,7 +2894,7 @@ Handle<JSFunction> InstallFunc(
   Handle<String> name = v8_str(isolate, str);
   Handle<JSFunction> function =
       CreateFunc(isolate, name, func, has_prototype, side_effect_type);
-  function->shared().set_length(length);
+  function->shared()->set_length(length);
   JSObject::AddProperty(isolate, object, name, function, attributes);
   return function;
 }
@@ -2874,7 +2938,7 @@ void InstallGetterSetter(Isolate* isolate, Handle<JSObject> object,
                  SideEffectType::kHasNoSideEffect);
   Handle<JSFunction> setter_func =
       CreateFunc(isolate, SetterName(isolate, name), setter, false);
-  setter_func->shared().set_length(1);
+  setter_func->shared()->set_length(1);
 
   Utils::ToLocal(object)->SetAccessorProperty(
       Utils::ToLocal(name), Utils::ToLocal(getter_func),
@@ -2888,7 +2952,7 @@ void InstallGetterSetter(Isolate* isolate, Handle<JSObject> object,
 void SetDummyInstanceTemplate(Isolate* isolate, Handle<JSFunction> fun) {
   Handle<ObjectTemplateInfo> instance_template = NewObjectTemplate(isolate);
   FunctionTemplateInfo::SetInstanceTemplate(
-      isolate, handle(fun->shared().get_api_func_data(), isolate),
+      isolate, handle(fun->shared()->api_func_data(), isolate),
       instance_template);
 }
 
@@ -2912,14 +2976,43 @@ Handle<JSObject> SetupConstructor(Isolate* isolate,
   return proto;
 }
 
+void InstallStrings(Isolate* isolate, Handle<JSObject> webassembly) {
+  Handle<JSObject> string = isolate->factory()->NewJSObjectWithNullProto();
+  JSObject::AddProperty(isolate, webassembly, "String", string, DONT_ENUM);
+  SimpleInstallFunction(isolate, string, "fromWtf16Array",
+                        Builtin::kWebAssemblyStringFromWtf16Array, 3, true);
+  SimpleInstallFunction(isolate, string, "toWtf16Array",
+                        Builtin::kWebAssemblyStringToWtf16Array, 3, true);
+  SimpleInstallFunction(isolate, string, "fromWtf8Array",
+                        Builtin::kWebAssemblyStringFromWtf8Array, 3, true);
+  SimpleInstallFunction(isolate, string, "fromCharCode",
+                        Builtin::kWebAssemblyStringFromCharCode, 1, true);
+  SimpleInstallFunction(isolate, string, "fromCodePoint",
+                        Builtin::kWebAssemblyStringFromCodePoint, 1, true);
+  SimpleInstallFunction(isolate, string, "codePointAt",
+                        Builtin::kWebAssemblyStringCodePointAt, 2, true);
+  SimpleInstallFunction(isolate, string, "charCodeAt",
+                        Builtin::kWebAssemblyStringCharCodeAt, 2, true);
+  SimpleInstallFunction(isolate, string, "length",
+                        Builtin::kWebAssemblyStringLength, 1, true);
+  SimpleInstallFunction(isolate, string, "concat",
+                        Builtin::kWebAssemblyStringConcat, 2, true);
+  SimpleInstallFunction(isolate, string, "substring",
+                        Builtin::kWebAssemblyStringSubstring, 3, true);
+  SimpleInstallFunction(isolate, string, "equals",
+                        Builtin::kWebAssemblyStringEquals, 2, true);
+  SimpleInstallFunction(isolate, string, "compare",
+                        Builtin::kWebAssemblyStringCompare, 2, true);
+}
+
 // static
 void WasmJs::Install(Isolate* isolate, bool exposed_on_global_object) {
   Handle<JSGlobalObject> global = isolate->global_object();
   Handle<Context> context(global->native_context(), isolate);
   // Install the JS API once only.
-  Object prev = context->get(Context::WASM_MODULE_CONSTRUCTOR_INDEX);
-  if (!prev.IsUndefined(isolate)) {
-    DCHECK(prev.IsJSFunction());
+  Tagged<Object> prev = context->get(Context::WASM_MODULE_CONSTRUCTOR_INDEX);
+  if (!IsUndefined(prev, isolate)) {
+    DCHECK(IsJSFunction(prev));
     return;
   }
 
@@ -2946,20 +3039,6 @@ void WasmJs::Install(Isolate* isolate, bool exposed_on_global_object) {
   InstallFunc(isolate, webassembly, "validate", WebAssemblyValidate, 1);
   InstallFunc(isolate, webassembly, "instantiate", WebAssemblyInstantiate, 1);
 
-  // TODO(7748): These built-ins should not be shipped with wasm GC.
-  // Either a new flag will be needed or the built-ins have to be deleted prior
-  // to shipping.
-  // TODO(13810): We should install these later, when we can query the
-  // isolate's wasm_gc_enabled_callback, to take the Origin Trial into account.
-  if (v8_flags.experimental_wasm_gc) {
-    SimpleInstallFunction(
-        isolate, webassembly, "experimentalConvertArrayToString",
-        Builtin::kExperimentalWasmConvertArrayToString, 0, true);
-    SimpleInstallFunction(
-        isolate, webassembly, "experimentalConvertStringToArray",
-        Builtin::kExperimentalWasmConvertStringToArray, 0, true);
-  }
-
   if (v8_flags.wasm_test_streaming) {
     isolate->set_wasm_streaming_callback(WasmStreamingCallbackForTesting);
   }
@@ -3059,6 +3138,16 @@ void WasmJs::Install(Isolate* isolate, bool exposed_on_global_object) {
       SetupConstructor(isolate, tag_constructor, i::WASM_TAG_OBJECT_TYPE,
                        WasmTagObject::kHeaderSize, "WebAssembly.Tag");
   context->set_wasm_tag_constructor(*tag_constructor);
+  wasm::ValueType param = wasm::kWasmExternRef;
+  const i::wasm::FunctionSig sig{0, 1, &param};
+  auto js_tag = WasmExceptionTag::New(isolate, 0);
+  uint32_t canonical_type_index =
+      i::wasm::GetWasmEngine()->type_canonicalizer()->AddRecursiveGroup(&sig);
+  i::Handle<i::JSObject> js_tag_object =
+      i::WasmTagObject::New(isolate, &sig, canonical_type_index, js_tag);
+  context->set_wasm_js_tag(*js_tag_object);
+  JSObject::AddProperty(isolate, webassembly, "JSTag", js_tag_object,
+                        ro_attributes);
 
   if (enabled_features.has_type_reflection()) {
     InstallFunc(isolate, tag_proto, "type", WebAssemblyTagType, 0);
@@ -3093,11 +3182,12 @@ void WasmJs::Install(Isolate* isolate, bool exposed_on_global_object) {
     JSFunction::EnsureHasInitialMap(function_constructor);
     Handle<JSObject> function_proto(
         JSObject::cast(function_constructor->instance_prototype()), isolate);
-    Handle<Map> function_map = isolate->factory()->CreateSloppyFunctionMap(
-        FUNCTION_WITHOUT_PROTOTYPE, MaybeHandle<JSFunction>());
+    Handle<Map> function_map =
+        Map::Copy(isolate, isolate->sloppy_function_without_prototype_map(),
+                  "WebAssembly.Function");
     CHECK(JSObject::SetPrototype(
               isolate, function_proto,
-              handle(context->function_function().prototype(), isolate), false,
+              handle(context->function_function()->prototype(), isolate), false,
               kDontThrow)
               .FromJust());
     JSFunction::SetInitialMap(isolate, function_constructor, function_map,
@@ -3112,6 +3202,11 @@ void WasmJs::Install(Isolate* isolate, bool exposed_on_global_object) {
     context->set_wasm_exported_function_map(*function_map);
   }
 
+  // Setup importable strings.
+  if (enabled_features.has_imported_strings()) {
+    InstallStrings(isolate, webassembly);
+  }
+
   // Setup errors
   Handle<JSFunction> compile_error(
       isolate->native_context()->wasm_compile_error_function(), isolate);
@@ -3132,8 +3227,26 @@ void WasmJs::Install(Isolate* isolate, bool exposed_on_global_object) {
 
 // static
 void WasmJs::InstallConditionalFeatures(Isolate* isolate,
-                                        Handle<Context> context) {
-  // This space left blank for future origin trials.
+                                        Handle<NativeContext> context) {
+  Handle<JSGlobalObject> global = handle(context->global_object(), isolate);
+  // If some fuzzer decided to make the global object non-extensible, then
+  // we can't install any features (and would CHECK-fail if we tried).
+  if (!global->map()->is_extensible()) return;
+
+  MaybeHandle<Object> maybe_wasm =
+      JSReceiver::GetProperty(isolate, global, "WebAssembly");
+  Handle<Object> wasm_obj;
+  if (!maybe_wasm.ToHandle(&wasm_obj) || !IsJSObject(*wasm_obj)) return;
+  Handle<JSObject> webassembly = Handle<JSObject>::cast(wasm_obj);
+  if (!webassembly->map()->is_extensible()) return;
+
+  if (isolate->IsWasmImportedStringsEnabled(context)) {
+    Handle<String> string_string = isolate->factory()->String_string();
+    if (!JSObject::HasRealNamedProperty(isolate, webassembly, string_string)
+             .FromMaybe(true)) {
+      InstallStrings(isolate, webassembly);
+    }
+  }
 }
 
 namespace wasm {
diff --git a/deps/v8/src/wasm/wasm-js.h b/deps/v8/src/wasm/wasm-js.h
index 526f5fc93224c4..efce2e3a861f58 100644
--- a/deps/v8/src/wasm/wasm-js.h
+++ b/deps/v8/src/wasm/wasm-js.h
@@ -18,9 +18,6 @@ class WasmStreaming;
 }  // namespace v8
 
 namespace v8::internal {
-class Context;
-template <typename T>
-class Handle;
 
 namespace wasm {
 class CompilationResultResolver;
@@ -37,7 +34,7 @@ class WasmJs {
                                         bool exposed_on_global_object);
 
   V8_EXPORT_PRIVATE static void InstallConditionalFeatures(
-      Isolate* isolate, Handle<Context> context);
+      Isolate* isolate, Handle<NativeContext> context);
 };
 
 }  // namespace v8::internal
diff --git a/deps/v8/src/wasm/wasm-limits.h b/deps/v8/src/wasm/wasm-limits.h
index 5b820121599cc4..c2a2fe6a50f91c 100644
--- a/deps/v8/src/wasm/wasm-limits.h
+++ b/deps/v8/src/wasm/wasm-limits.h
@@ -20,52 +20,52 @@ namespace v8::internal::wasm {
 
 // These constants limit the amount of *declared* memory. At runtime, memory can
 // only grow up to kV8MaxWasmMemory{32,64}Pages.
-constexpr size_t kSpecMaxMemory32Pages = 65536;  // 4GB
+constexpr size_t kSpecMaxMemory32Pages = 65'536;  // 4GB
 // TODO(clemensb): Adapt once the spec defines a limit here. For now, use 16GB.
-constexpr size_t kSpecMaxMemory64Pages = 262144;  // 16GB
+constexpr size_t kSpecMaxMemory64Pages = 262'144;  // 16GB
 
 // The following limits are imposed by V8 on WebAssembly modules.
 // The limits are agreed upon with other engines for consistency.
-constexpr size_t kV8MaxWasmTypes = 1000000;
-constexpr size_t kV8MaxWasmFunctions = 1000000;
-constexpr size_t kV8MaxWasmImports = 100000;
-constexpr size_t kV8MaxWasmExports = 100000;
-constexpr size_t kV8MaxWasmGlobals = 1000000;
-constexpr size_t kV8MaxWasmTags = 1000000;
-constexpr size_t kV8MaxWasmExceptionTypes = 1000000;
-constexpr size_t kV8MaxWasmDataSegments = 100000;
+constexpr size_t kV8MaxWasmTypes = 1'000'000;
+constexpr size_t kV8MaxWasmFunctions = 1'000'000;
+constexpr size_t kV8MaxWasmImports = 100'000;
+constexpr size_t kV8MaxWasmExports = 100'000;
+constexpr size_t kV8MaxWasmGlobals = 1'000'000;
+constexpr size_t kV8MaxWasmTags = 1'000'000;
+constexpr size_t kV8MaxWasmExceptionTypes = 1'000'000;
+constexpr size_t kV8MaxWasmDataSegments = 100'000;
 // This indicates the maximum memory size our implementation supports.
 // Do not use this limit directly; use {max_mem{32,64}_pages()} instead to take
 // the spec'ed limit as well as command line flag into account.
 // Also, do not use this limit to validate declared memory, use
 // kSpecMaxMemory{32,64}Pages for that.
 constexpr size_t kV8MaxWasmMemory32Pages = kSystemPointerSize == 4
-                                               ? 32767   // = 2 GiB - 64Kib
-                                               : 65536;  // = 4 GiB
+                                               ? 32'767   // = 2 GiB - 64Kib
+                                               : 65'536;  // = 4 GiB
 constexpr size_t kV8MaxWasmMemory64Pages = kSystemPointerSize == 4
-                                               ? 32767    // = 2 GiB - 64Kib
-                                               : 262144;  // = 16 GiB
-constexpr size_t kV8MaxWasmStringSize = 100000;
+                                               ? 32'767    // = 2 GiB - 64Kib
+                                               : 262'144;  // = 16 GiB
+constexpr size_t kV8MaxWasmStringSize = 100'000;
 constexpr size_t kV8MaxWasmModuleSize = 1024 * 1024 * 1024;  // = 1 GiB
-constexpr size_t kV8MaxWasmFunctionSize = 7654321;
-constexpr size_t kV8MaxWasmFunctionLocals = 50000;
-constexpr size_t kV8MaxWasmFunctionParams = 1000;
-constexpr size_t kV8MaxWasmFunctionReturns = 1000;
-constexpr size_t kV8MaxWasmFunctionBrTableSize = 65520;
+constexpr size_t kV8MaxWasmFunctionSize = 7'654'321;
+constexpr size_t kV8MaxWasmFunctionLocals = 50'000;
+constexpr size_t kV8MaxWasmFunctionParams = 1'000;
+constexpr size_t kV8MaxWasmFunctionReturns = 1'000;
+constexpr size_t kV8MaxWasmFunctionBrTableSize = 65'520;
 // Don't use this limit directly, but use the value of
 // v8_flags.wasm_max_table_size.
-constexpr size_t kV8MaxWasmTableSize = 10000000;
-constexpr size_t kV8MaxWasmTableInitEntries = 10000000;
-constexpr size_t kV8MaxWasmTables = 100000;
-constexpr size_t kV8MaxWasmMemories = 1;
+constexpr size_t kV8MaxWasmTableSize = 10'000'000;
+constexpr size_t kV8MaxWasmTableInitEntries = 10'000'000;
+constexpr size_t kV8MaxWasmTables = 100'000;
+constexpr size_t kV8MaxWasmMemories = 100'000;
 
-// GC proposal. These limits are not standardized yet.
-constexpr size_t kV8MaxWasmStructFields = 2000;
-constexpr uint32_t kV8MaxRttSubtypingDepth = 31;
-constexpr size_t kV8MaxWasmArrayNewFixedLength = 10000;
+// GC proposal.
+constexpr size_t kV8MaxWasmStructFields = 10'000;
+constexpr uint32_t kV8MaxRttSubtypingDepth = 63;
+constexpr size_t kV8MaxWasmArrayNewFixedLength = 10'000;
 
 // Stringref proposal. This limit is not standardized yet.
-constexpr size_t kV8MaxWasmStringLiterals = 1000000;
+constexpr size_t kV8MaxWasmStringLiterals = 1'000'000;
 
 static_assert(kV8MaxWasmTableSize <= 4294967295,  // 2^32 - 1
               "v8 should not exceed WebAssembly's non-web embedding limits");
diff --git a/deps/v8/src/wasm/wasm-linkage.h b/deps/v8/src/wasm/wasm-linkage.h
index b8fbc3f055b2bf..a32d757f6a3aae 100644
--- a/deps/v8/src/wasm/wasm-linkage.h
+++ b/deps/v8/src/wasm/wasm-linkage.h
@@ -11,8 +11,8 @@
 
 #include "src/codegen/aligned-slot-allocator.h"
 #include "src/codegen/assembler-arch.h"
+#include "src/codegen/linkage-location.h"
 #include "src/codegen/machine-type.h"
-#include "src/wasm/value-type.h"
 
 namespace v8 {
 namespace internal {
@@ -111,7 +111,7 @@ constexpr DoubleRegister kFpReturnRegisters[] = {d0, d2};
 // == riscv64 =================================================================
 // ===========================================================================
 // Note that kGpParamRegisters and kFpParamRegisters are used in
-// Builtins::Generate_WasmCompileLazy (builtins-riscv64.cc)
+// Builtins::Generate_WasmCompileLazy (builtins-riscv.cc)
 constexpr Register kGpParamRegisters[] = {a0, a2, a3, a4, a5, a6, a7};
 constexpr Register kGpReturnRegisters[] = {a0, a1};
 constexpr DoubleRegister kFpParamRegisters[] = {fa0, fa1, fa2, fa3,
@@ -251,6 +251,41 @@ class LinkageAllocator {
   AlignedSlotAllocator slot_allocator_;
 };
 
+// Helper for allocating either an GP or FP reg, or the next stack slot.
+class LinkageLocationAllocator {
+ public:
+  template <size_t kNumGpRegs, size_t kNumFpRegs>
+  constexpr LinkageLocationAllocator(const Register (&gp)[kNumGpRegs],
+                                     const DoubleRegister (&fp)[kNumFpRegs],
+                                     int slot_offset)
+      : allocator_(LinkageAllocator(gp, fp)), slot_offset_(slot_offset) {}
+
+  LinkageLocation Next(MachineRepresentation rep) {
+    MachineType type = MachineType::TypeForRepresentation(rep);
+    if (IsFloatingPoint(rep)) {
+      if (allocator_.CanAllocateFP(rep)) {
+        int reg_code = allocator_.NextFpReg(rep);
+        return LinkageLocation::ForRegister(reg_code, type);
+      }
+    } else if (allocator_.CanAllocateGP()) {
+      int reg_code = allocator_.NextGpReg();
+      return LinkageLocation::ForRegister(reg_code, type);
+    }
+    // Cannot use register; use stack slot.
+    int index = -1 - (slot_offset_ + allocator_.NextStackSlot(rep));
+    return LinkageLocation::ForCallerFrameSlot(index, type);
+  }
+
+  int NumStackSlots() const { return allocator_.NumStackSlots(); }
+  void EndSlotArea() { allocator_.EndSlotArea(); }
+
+ private:
+  LinkageAllocator allocator_;
+  // Since params and returns are in different stack frames, we must allocate
+  // them separately. Parameter slots don't need an offset, but return slots
+  // must be offset to just before the param slots, using this |slot_offset_|.
+  int slot_offset_;
+};
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/wasm/wasm-module-builder.cc b/deps/v8/src/wasm/wasm-module-builder.cc
index ec838f4b1243bb..15c8737f6bed57 100644
--- a/deps/v8/src/wasm/wasm-module-builder.cc
+++ b/deps/v8/src/wasm/wasm-module-builder.cc
@@ -48,7 +48,7 @@ WasmFunctionBuilder::WasmFunctionBuilder(WasmModuleBuilder* builder)
       direct_calls_(builder->zone()),
       asm_offsets_(builder->zone(), 8) {}
 
-void WasmFunctionBuilder::EmitByte(byte val) { body_.write_u8(val); }
+void WasmFunctionBuilder::EmitByte(uint8_t val) { body_.write_u8(val); }
 
 void WasmFunctionBuilder::EmitI32V(int32_t val) { body_.write_i32v(val); }
 
@@ -84,7 +84,7 @@ void WasmFunctionBuilder::EmitTeeLocal(uint32_t local_index) {
   EmitWithU32V(kExprLocalTee, local_index);
 }
 
-void WasmFunctionBuilder::EmitCode(const byte* code, uint32_t code_size) {
+void WasmFunctionBuilder::EmitCode(const uint8_t* code, uint32_t code_size) {
   body_.write(code, code_size);
 }
 
@@ -105,13 +105,14 @@ void WasmFunctionBuilder::EmitWithPrefix(WasmOpcode opcode) {
   }
 }
 
-void WasmFunctionBuilder::EmitWithU8(WasmOpcode opcode, const byte immediate) {
+void WasmFunctionBuilder::EmitWithU8(WasmOpcode opcode,
+                                     const uint8_t immediate) {
   body_.write_u8(opcode);
   body_.write_u8(immediate);
 }
 
-void WasmFunctionBuilder::EmitWithU8U8(WasmOpcode opcode, const byte imm1,
-                                       const byte imm2) {
+void WasmFunctionBuilder::EmitWithU8U8(WasmOpcode opcode, const uint8_t imm1,
+                                       const uint8_t imm2) {
   body_.write_u8(opcode);
   body_.write_u8(imm1);
   body_.write_u8(imm2);
@@ -167,7 +168,7 @@ void WasmFunctionBuilder::EmitDirectCallIndex(uint32_t index) {
   call.offset = body_.size();
   call.direct_index = index;
   direct_calls_.push_back(call);
-  byte placeholder_bytes[kMaxVarInt32Size] = {0};
+  uint8_t placeholder_bytes[kMaxVarInt32Size] = {0};
   EmitCode(placeholder_bytes, arraysize(placeholder_bytes));
 }
 
@@ -229,7 +230,7 @@ void WasmFunctionBuilder::WriteBody(ZoneBuffer* buffer) const {
   size_t locals_size = locals_.Size();
   buffer->write_size(locals_size + body_.size());
   buffer->EnsureSpace(locals_size);
-  byte** ptr = buffer->pos_ptr();
+  uint8_t** ptr = buffer->pos_ptr();
   locals_.Emit(*ptr);
   (*ptr) += locals_size;  // UGLY: manual bump of position pointer
   if (body_.size() > 0) {
@@ -295,10 +296,19 @@ WasmFunctionBuilder* WasmModuleBuilder::AddFunction(uint32_t sig_index) {
   return functions_.back();
 }
 
-void WasmModuleBuilder::AddDataSegment(const byte* data, uint32_t size,
+void WasmModuleBuilder::AddDataSegment(const uint8_t* data, uint32_t size,
                                        uint32_t dest) {
-  data_segments_.push_back({ZoneVector<byte>(zone()), dest});
-  ZoneVector<byte>& vec = data_segments_.back().data;
+  data_segments_.push_back({ZoneVector<uint8_t>(zone()), dest});
+  ZoneVector<uint8_t>& vec = data_segments_.back().data;
+  for (uint32_t i = 0; i < size; i++) {
+    vec.push_back(data[i]);
+  }
+}
+
+void WasmModuleBuilder::AddPassiveDataSegment(const uint8_t* data,
+                                              uint32_t size) {
+  data_segments_.push_back({ZoneVector<uint8_t>(zone()), 0, false});
+  ZoneVector<uint8_t>& vec = data_segments_.back().data;
   for (uint32_t i = 0; i < size; i++) {
     vec.push_back(data[i]);
   }
@@ -368,12 +378,13 @@ uint32_t WasmModuleBuilder::AddTable(ValueType type, uint32_t min_size,
 
 uint32_t WasmModuleBuilder::AddTable(ValueType type, uint32_t min_size,
                                      uint32_t max_size, WasmInitExpr init) {
-  tables_.push_back({type, min_size, max_size, true, init});
+  tables_.push_back({type, min_size, max_size, true, {init}});
   return static_cast<uint32_t>(tables_.size() - 1);
 }
 
-void WasmModuleBuilder::AddElementSegment(WasmElemSegment segment) {
+uint32_t WasmModuleBuilder::AddElementSegment(WasmElemSegment segment) {
   element_segments_.push_back(std::move(segment));
+  return static_cast<uint32_t>(element_segments_.size() - 1);
 }
 
 void WasmModuleBuilder::SetIndirectFunction(
@@ -450,9 +461,60 @@ void WasmModuleBuilder::SetMaxMemorySize(uint32_t value) {
 void WasmModuleBuilder::SetHasSharedMemory() { has_shared_memory_ = true; }
 
 namespace {
-void WriteInitializerExpressionWithEnd(ZoneBuffer* buffer,
-                                       const WasmInitExpr& init,
-                                       ValueType type) {
+
+WasmOpcode FromInitExprOperator(WasmInitExpr::Operator op) {
+  switch (op) {
+    case WasmInitExpr::kGlobalGet:
+      return kExprGlobalGet;
+    case WasmInitExpr::kI32Const:
+      return kExprI32Const;
+    case WasmInitExpr::kI64Const:
+      return kExprI64Const;
+    case WasmInitExpr::kF32Const:
+      return kExprF32Const;
+    case WasmInitExpr::kF64Const:
+      return kExprF64Const;
+    case WasmInitExpr::kS128Const:
+      return kExprS128Const;
+    case WasmInitExpr::kI32Add:
+      return kExprI32Add;
+    case WasmInitExpr::kI32Sub:
+      return kExprI32Sub;
+    case WasmInitExpr::kI32Mul:
+      return kExprI32Mul;
+    case WasmInitExpr::kI64Add:
+      return kExprI64Add;
+    case WasmInitExpr::kI64Sub:
+      return kExprI64Sub;
+    case WasmInitExpr::kI64Mul:
+      return kExprI64Mul;
+    case WasmInitExpr::kRefNullConst:
+      return kExprRefNull;
+    case WasmInitExpr::kRefFuncConst:
+      return kExprRefFunc;
+    case WasmInitExpr::kStructNew:
+      return kExprStructNew;
+    case WasmInitExpr::kStructNewDefault:
+      return kExprStructNewDefault;
+    case WasmInitExpr::kArrayNew:
+      return kExprArrayNew;
+    case WasmInitExpr::kArrayNewDefault:
+      return kExprArrayNewDefault;
+    case WasmInitExpr::kArrayNewFixed:
+      return kExprArrayNewFixed;
+    case WasmInitExpr::kI31New:
+      return kExprI31New;
+    case WasmInitExpr::kStringConst:
+      return kExprStringConst;
+    case WasmInitExpr::kExternInternalize:
+      return kExprExternInternalize;
+    case WasmInitExpr::kExternExternalize:
+      return kExprExternExternalize;
+  }
+}
+
+void WriteInitializerExpressionWithoutEnd(ZoneBuffer* buffer,
+                                          const WasmInitExpr& init) {
   switch (init.kind()) {
     case WasmInitExpr::kI32Const:
       buffer->write_u8(kExprI32Const);
@@ -476,46 +538,14 @@ void WriteInitializerExpressionWithEnd(ZoneBuffer* buffer,
       buffer->write(init.immediate().s128_const.data(), kSimd128Size);
       break;
     case WasmInitExpr::kI32Add:
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[0],
-                                        kWasmI32);
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[1],
-                                        kWasmI32);
-      buffer->write_u8(kExprI32Add);
-      break;
     case WasmInitExpr::kI32Sub:
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[0],
-                                        kWasmI32);
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[1],
-                                        kWasmI32);
-      buffer->write_u8(kExprI32Sub);
-      break;
     case WasmInitExpr::kI32Mul:
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[0],
-                                        kWasmI32);
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[1],
-                                        kWasmI32);
-      buffer->write_u8(kExprI32Mul);
-      break;
     case WasmInitExpr::kI64Add:
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[0],
-                                        kWasmI64);
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[1],
-                                        kWasmI64);
-      buffer->write_u8(kExprI64Add);
-      break;
     case WasmInitExpr::kI64Sub:
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[0],
-                                        kWasmI64);
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[1],
-                                        kWasmI64);
-      buffer->write_u8(kExprI64Sub);
-      break;
     case WasmInitExpr::kI64Mul:
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[0],
-                                        kWasmI64);
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[1],
-                                        kWasmI64);
-      buffer->write_u8(kExprI64Mul);
+      WriteInitializerExpressionWithoutEnd(buffer, (*init.operands())[0]);
+      WriteInitializerExpressionWithoutEnd(buffer, (*init.operands())[1]);
+      buffer->write_u8(FromInitExprOperator(init.kind()));
       break;
     case WasmInitExpr::kGlobalGet:
       buffer->write_u8(kExprGlobalGet);
@@ -529,75 +559,28 @@ void WriteInitializerExpressionWithEnd(ZoneBuffer* buffer,
       buffer->write_u8(kExprRefFunc);
       buffer->write_u32v(init.immediate().index);
       break;
-    case WasmInitExpr::kNone: {
-      // No initializer, emit a default value.
-      switch (type.kind()) {
-        case kI32:
-          buffer->write_u8(kExprI32Const);
-          // LEB encoding of 0.
-          buffer->write_u8(0);
-          break;
-        case kI64:
-          buffer->write_u8(kExprI64Const);
-          // LEB encoding of 0.
-          buffer->write_u8(0);
-          break;
-        case kF32:
-          buffer->write_u8(kExprF32Const);
-          buffer->write_f32(0.f);
-          break;
-        case kF64:
-          buffer->write_u8(kExprF64Const);
-          buffer->write_f64(0.);
-          break;
-        case kRefNull:
-          buffer->write_u8(kExprRefNull);
-          buffer->write_i32v(type.heap_type().code());
-          break;
-        case kS128:
-          buffer->write_u8(static_cast<byte>(kSimdPrefix));
-          buffer->write_u8(static_cast<byte>(kExprS128Const & 0xff));
-          for (int i = 0; i < kSimd128Size; i++) buffer->write_u8(0);
-          break;
-        case kI8:
-        case kI16:
-        case kVoid:
-        case kBottom:
-        case kRef:
-        case kRtt:
-          UNREACHABLE();
-      }
-      break;
-    }
     case WasmInitExpr::kStructNew:
     case WasmInitExpr::kStructNewDefault:
-      static_assert((kExprStructNew >> 8) == kGCPrefix);
-      static_assert((kExprStructNewDefault >> 8) == kGCPrefix);
-      static_assert((kExprStructNew & 0x80) == 0);
-      static_assert((kExprStructNewDefault & 0x80) == 0);
-      for (const WasmInitExpr& operand : *init.operands()) {
-        WriteInitializerExpressionWithEnd(buffer, operand, kWasmBottom);
+    case WasmInitExpr::kArrayNew:
+    case WasmInitExpr::kArrayNewDefault: {
+      if (init.operands() != nullptr) {
+        for (const WasmInitExpr& operand : *init.operands()) {
+          WriteInitializerExpressionWithoutEnd(buffer, operand);
+        }
       }
+      WasmOpcode opcode = FromInitExprOperator(init.kind());
+      DCHECK_EQ(opcode >> 8, kGCPrefix);
+      DCHECK_EQ(opcode & 0x80, 0);
       buffer->write_u8(kGCPrefix);
-      WasmOpcode opcode;
-      switch (init.kind()) {
-        case WasmInitExpr::kStructNew:
-          opcode = kExprStructNew;
-          break;
-        case WasmInitExpr::kStructNewDefault:
-          opcode = kExprStructNewDefault;
-          break;
-        default:
-          UNREACHABLE();
-      }
       buffer->write_u8(static_cast<uint8_t>(opcode));
       buffer->write_u32v(init.immediate().index);
       break;
+    }
     case WasmInitExpr::kArrayNewFixed: {
       static_assert((kExprArrayNewFixed >> 8) == kGCPrefix);
       static_assert((kExprArrayNewFixed & 0x80) == 0);
       for (const WasmInitExpr& operand : *init.operands()) {
-        WriteInitializerExpressionWithEnd(buffer, operand, kWasmBottom);
+        WriteInitializerExpressionWithoutEnd(buffer, operand);
       }
       buffer->write_u8(kGCPrefix);
       buffer->write_u8(static_cast<uint8_t>(kExprArrayNewFixed));
@@ -606,15 +589,16 @@ void WriteInitializerExpressionWithEnd(ZoneBuffer* buffer,
       break;
     }
     case WasmInitExpr::kI31New:
-      WriteInitializerExpressionWithEnd(buffer, (*init.operands())[0],
-                                        kWasmI32);
-      static_assert((kExprI31New >> 8) == kGCPrefix);
-      static_assert((kExprI31New & 0x80) == 0);
-
+    case WasmInitExpr::kExternInternalize:
+    case WasmInitExpr::kExternExternalize: {
+      WriteInitializerExpressionWithoutEnd(buffer, (*init.operands())[0]);
+      WasmOpcode opcode = FromInitExprOperator(init.kind());
+      DCHECK_EQ(opcode >> 8, kGCPrefix);
+      DCHECK_EQ(opcode & 0x80, 0);
       buffer->write_u8(kGCPrefix);
-      buffer->write_u8(static_cast<uint8_t>(kExprI31New));
-
+      buffer->write_u8(opcode);
       break;
+    }
     case WasmInitExpr::kStringConst:
       buffer->write_u8(kGCPrefix);
       buffer->write_u32v(kExprStringConst & 0xFF);
@@ -623,9 +607,8 @@ void WriteInitializerExpressionWithEnd(ZoneBuffer* buffer,
   }
 }
 
-void WriteInitializerExpression(ZoneBuffer* buffer, const WasmInitExpr& init,
-                                ValueType type) {
-  WriteInitializerExpressionWithEnd(buffer, init, type);
+void WriteInitializerExpression(ZoneBuffer* buffer, const WasmInitExpr& init) {
+  WriteInitializerExpressionWithoutEnd(buffer, init);
   buffer->write_u8(kExprEnd);
 }
 }  // namespace
@@ -738,12 +721,16 @@ void WasmModuleBuilder::WriteTo(ZoneBuffer* buffer) const {
     size_t start = EmitSection(kTableSectionCode, buffer);
     buffer->write_size(tables_.size());
     for (const WasmTable& table : tables_) {
+      if (table.init) {
+        buffer->write_u8(0x40);  // table-with-initializer
+        buffer->write_u8(0x00);  // reserved byte
+      }
       WriteValueType(buffer, table.type);
       buffer->write_u8(table.has_maximum ? kWithMaximum : kNoMaximum);
       buffer->write_size(table.min_size);
       if (table.has_maximum) buffer->write_size(table.max_size);
-      if (table.init.kind() != WasmInitExpr::kNone) {
-        WriteInitializerExpression(buffer, table.init, table.type);
+      if (table.init) {
+        WriteInitializerExpression(buffer, *table.init);
       }
     }
     FixupSection(buffer, start);
@@ -785,7 +772,7 @@ void WasmModuleBuilder::WriteTo(ZoneBuffer* buffer) const {
     for (const WasmGlobal& global : globals_) {
       WriteValueType(buffer, global.type);
       buffer->write_u8(global.mutability ? 1 : 0);
-      WriteInitializerExpression(buffer, global.init, global.type);
+      WriteInitializerExpression(buffer, global.init);
     }
     FixupSection(buffer, start);
   }
@@ -842,7 +829,7 @@ void WasmModuleBuilder::WriteTo(ZoneBuffer* buffer) const {
       buffer->write_u8(kind_mask | expressions_as_elements_mask);
       if (is_active) {
         buffer->write_u32v(segment.table_index);
-        WriteInitializerExpression(buffer, segment.offset, segment.type);
+        WriteInitializerExpression(buffer, segment.offset);
       }
       WriteValueType(buffer, segment.type);
       buffer->write_size(segment.entries.size());
@@ -869,6 +856,15 @@ void WasmModuleBuilder::WriteTo(ZoneBuffer* buffer) const {
     FixupSection(buffer, start);
   }
 
+  // == emit data segment count section ========================================
+  if (std::any_of(
+          data_segments_.begin(), data_segments_.end(),
+          [](const WasmDataSegment& segment) { return !segment.is_active; })) {
+    buffer->write_u8(kDataCountSectionCode);
+    buffer->write_u32v(1);  // section length
+    buffer->write_u32v(static_cast<uint32_t>(data_segments_.size()));
+  }
+
   // == emit compilation hints section =========================================
   bool emit_compilation_hints = false;
   for (auto* fn : functions_) {
@@ -911,12 +907,16 @@ void WasmModuleBuilder::WriteTo(ZoneBuffer* buffer) const {
     buffer->write_size(data_segments_.size());
 
     for (auto segment : data_segments_) {
-      buffer->write_u8(0);              // linear memory segment
-      buffer->write_u8(kExprI32Const);  // constant expression for dest
-      buffer->write_u32v(segment.dest);
-      buffer->write_u8(kExprEnd);
+      if (segment.is_active) {
+        buffer->write_u8(0);              // linear memory segment
+        buffer->write_u8(kExprI32Const);  // constant expression for dest
+        buffer->write_u32v(segment.dest);
+        buffer->write_u8(kExprEnd);
+      } else {
+        buffer->write_u8(kPassive);
+      }
       buffer->write_u32v(static_cast<uint32_t>(segment.data.size()));
-      buffer->write(&segment.data[0], segment.data.size());
+      buffer->write(segment.data.data(), segment.data.size());
     }
     FixupSection(buffer, start);
   }
diff --git a/deps/v8/src/wasm/wasm-module-builder.h b/deps/v8/src/wasm/wasm-module-builder.h
index dbf29bd4292b51..685875a283bb38 100644
--- a/deps/v8/src/wasm/wasm-module-builder.h
+++ b/deps/v8/src/wasm/wasm-module-builder.h
@@ -32,7 +32,7 @@ class ZoneBuffer : public ZoneObject {
 
   static constexpr size_t kInitialSize = 1024;
   explicit ZoneBuffer(Zone* zone, size_t initial = kInitialSize)
-      : zone_(zone), buffer_(zone->NewArray<byte, Buffer>(initial)) {
+      : zone_(zone), buffer_(zone->AllocateArray<uint8_t, Buffer>(initial)) {
     pos_ = buffer_;
     end_ = buffer_ + initial;
   }
@@ -90,7 +90,7 @@ class ZoneBuffer : public ZoneObject {
 
   void write_f64(double val) { write_u64(base::bit_cast<uint64_t>(val)); }
 
-  void write(const byte* data, size_t size) {
+  void write(const uint8_t* data, size_t size) {
     if (size == 0) return;
     EnsureSpace(size);
     memcpy(pos_, data, size);
@@ -99,7 +99,7 @@ class ZoneBuffer : public ZoneObject {
 
   void write_string(base::Vector<const char> name) {
     write_size(name.length());
-    write(reinterpret_cast<const byte*>(name.begin()), name.length());
+    write(reinterpret_cast<const uint8_t*>(name.begin()), name.length());
   }
 
   size_t reserve_u32v() {
@@ -111,10 +111,10 @@ class ZoneBuffer : public ZoneObject {
 
   // Patch a (padded) u32v at the given offset to be the given value.
   void patch_u32v(size_t offset, uint32_t val) {
-    byte* ptr = buffer_ + offset;
+    uint8_t* ptr = buffer_ + offset;
     for (size_t pos = 0; pos != kPaddedVarInt32Size; ++pos) {
       uint32_t next = val >> 7;
-      byte out = static_cast<byte>(val & 0x7f);
+      uint8_t out = static_cast<uint8_t>(val & 0x7f);
       if (pos != kPaddedVarInt32Size - 1) {
         *(ptr++) = 0x80 | out;
         val = next;
@@ -124,21 +124,21 @@ class ZoneBuffer : public ZoneObject {
     }
   }
 
-  void patch_u8(size_t offset, byte val) {
+  void patch_u8(size_t offset, uint8_t val) {
     DCHECK_GE(size(), offset);
     buffer_[offset] = val;
   }
 
   size_t offset() const { return static_cast<size_t>(pos_ - buffer_); }
   size_t size() const { return static_cast<size_t>(pos_ - buffer_); }
-  const byte* data() const { return buffer_; }
-  const byte* begin() const { return buffer_; }
-  const byte* end() const { return pos_; }
+  const uint8_t* data() const { return buffer_; }
+  const uint8_t* begin() const { return buffer_; }
+  const uint8_t* end() const { return pos_; }
 
   void EnsureSpace(size_t size) {
     if ((pos_ + size) > end_) {
       size_t new_size = size + (end_ - buffer_) * 2;
-      byte* new_buffer = zone_->NewArray<byte, Buffer>(new_size);
+      uint8_t* new_buffer = zone_->AllocateArray<uint8_t, Buffer>(new_size);
       memcpy(new_buffer, buffer_, (pos_ - buffer_));
       pos_ = new_buffer + (pos_ - buffer_);
       buffer_ = new_buffer;
@@ -152,13 +152,13 @@ class ZoneBuffer : public ZoneObject {
     pos_ = buffer_ + size;
   }
 
-  byte** pos_ptr() { return &pos_; }
+  uint8_t** pos_ptr() { return &pos_; }
 
  private:
   Zone* zone_;
-  byte* buffer_;
-  byte* pos_;
-  byte* end_;
+  uint8_t* buffer_;
+  uint8_t* pos_;
+  uint8_t* end_;
 };
 
 class WasmModuleBuilder;
@@ -169,10 +169,10 @@ class V8_EXPORT_PRIVATE WasmFunctionBuilder : public ZoneObject {
   void SetSignature(const FunctionSig* sig);
   void SetSignature(uint32_t sig_index);
   uint32_t AddLocal(ValueType type);
-  void EmitByte(byte b);
+  void EmitByte(uint8_t b);
   void EmitI32V(int32_t val);
   void EmitU32V(uint32_t val);
-  void EmitCode(const byte* code, uint32_t code_size);
+  void EmitCode(const uint8_t* code, uint32_t code_size);
   void Emit(WasmOpcode opcode);
   void EmitWithPrefix(WasmOpcode opcode);
   void EmitGetLocal(uint32_t index);
@@ -183,8 +183,8 @@ class V8_EXPORT_PRIVATE WasmFunctionBuilder : public ZoneObject {
   void EmitF32Const(float val);
   void EmitF64Const(double val);
   void EmitS128Const(Simd128 val);
-  void EmitWithU8(WasmOpcode opcode, const byte immediate);
-  void EmitWithU8U8(WasmOpcode opcode, const byte imm1, const byte imm2);
+  void EmitWithU8(WasmOpcode opcode, const uint8_t immediate);
+  void EmitWithU8U8(WasmOpcode opcode, const uint8_t imm1, const uint8_t imm2);
   void EmitWithI32V(WasmOpcode opcode, int32_t immediate);
   void EmitWithU32V(WasmOpcode opcode, uint32_t immediate);
   void EmitValueType(ValueType type);
@@ -197,7 +197,7 @@ class V8_EXPORT_PRIVATE WasmFunctionBuilder : public ZoneObject {
                           WasmCompilationHintTier top_tier);
 
   size_t GetPosition() const { return body_.size(); }
-  void FixupByte(size_t position, byte value) {
+  void FixupByte(size_t position, uint8_t value) {
     body_.patch_u8(position, value);
   }
   void DeleteCodeAfter(size_t position);
@@ -282,9 +282,11 @@ class V8_EXPORT_PRIVATE WasmModuleBuilder : public ZoneObject {
 
     // Construct a passive or declarative segment, which has no table
     // index or offset.
-    WasmElemSegment(Zone* zone, ValueType type, bool declarative)
+    WasmElemSegment(Zone* zone, ValueType type, bool declarative,
+                    WasmInitExpr offset)
         : type(type),
           table_index(0),
+          offset(offset),
           entries(zone),
           status(declarative ? kStatusDeclarative : kStatusPassive) {
       DCHECK(IsValidOffsetKind(offset.kind()));
@@ -305,7 +307,8 @@ class V8_EXPORT_PRIVATE WasmModuleBuilder : public ZoneObject {
     // offset would also be mistyped.
     bool IsValidOffsetKind(WasmInitExpr::Operator kind) {
       return kind == WasmInitExpr::kI32Const ||
-             kind == WasmInitExpr::kGlobalGet;
+             kind == WasmInitExpr::kGlobalGet ||
+             kind == WasmInitExpr::kRefNullConst;
     }
   };
 
@@ -314,15 +317,15 @@ class V8_EXPORT_PRIVATE WasmModuleBuilder : public ZoneObject {
                      base::Vector<const char> module = {});
   WasmFunctionBuilder* AddFunction(const FunctionSig* sig = nullptr);
   WasmFunctionBuilder* AddFunction(uint32_t sig_index);
-  uint32_t AddGlobal(ValueType type, bool mutability = true,
-                     WasmInitExpr init = WasmInitExpr());
+  uint32_t AddGlobal(ValueType type, bool mutability, WasmInitExpr init);
   uint32_t AddGlobalImport(base::Vector<const char> name, ValueType type,
                            bool mutability,
                            base::Vector<const char> module = {});
-  void AddDataSegment(const byte* data, uint32_t size, uint32_t dest);
+  void AddDataSegment(const uint8_t* data, uint32_t size, uint32_t dest);
+  void AddPassiveDataSegment(const uint8_t* data, uint32_t size);
   // Add an element segment to this {WasmModuleBuilder}. {segment}'s enties
   // have to be initialized.
-  void AddElementSegment(WasmElemSegment segment);
+  uint32_t AddElementSegment(WasmElemSegment segment);
   // Helper method to create an active segment with one function. Assumes that
   // table segment at {table_index} is typed as funcref.
   void SetIndirectFunction(uint32_t table_index, uint32_t index_in_table,
@@ -377,6 +380,10 @@ class V8_EXPORT_PRIVATE WasmModuleBuilder : public ZoneObject {
     current_recursive_group_start_ = -1;
   }
 
+  void AddRecursiveTypeGroup(uint32_t start, uint32_t size) {
+    recursive_groups_.emplace(start, size);
+  }
+
   // Writing methods.
   void WriteTo(ZoneBuffer* buffer) const;
   void WriteAsmJsOffsetTable(ZoneBuffer* buffer) const;
@@ -408,6 +415,8 @@ class V8_EXPORT_PRIVATE WasmModuleBuilder : public ZoneObject {
     return types_[index].array_type;
   }
 
+  uint32_t GetSuperType(uint32_t index) { return types_[index].supertype; }
+
   WasmFunctionBuilder* GetFunction(uint32_t index) { return functions_[index]; }
   int NumExceptions() { return static_cast<int>(exceptions_.size()); }
 
@@ -417,6 +426,8 @@ class V8_EXPORT_PRIVATE WasmModuleBuilder : public ZoneObject {
 
   int NumFunctions() { return static_cast<int>(functions_.size()); }
 
+  int NumDataSegments() { return static_cast<int>(data_segments_.size()); }
+
   const FunctionSig* GetExceptionType(int index) {
     return types_[exceptions_[index]].function_sig;
   }
@@ -452,12 +463,13 @@ class V8_EXPORT_PRIVATE WasmModuleBuilder : public ZoneObject {
     uint32_t min_size;
     uint32_t max_size;
     bool has_maximum;
-    WasmInitExpr init;
+    base::Optional<WasmInitExpr> init;
   };
 
   struct WasmDataSegment {
-    ZoneVector<byte> data;
+    ZoneVector<uint8_t> data;
     uint32_t dest;
+    bool is_active = true;
   };
 
   friend class WasmFunctionBuilder;
diff --git a/deps/v8/src/wasm/wasm-module-sourcemap.cc b/deps/v8/src/wasm/wasm-module-sourcemap.cc
index 21a47e1b71947e..e6a25859511fb9 100644
--- a/deps/v8/src/wasm/wasm-module-sourcemap.cc
+++ b/deps/v8/src/wasm/wasm-module-sourcemap.cc
@@ -12,6 +12,7 @@
 #include "include/v8-object.h"
 #include "include/v8-primitive.h"
 #include "src/base/vlq-base64.h"
+#include "src/wasm/std-object-sizes.h"
 
 namespace v8 {
 
@@ -157,6 +158,19 @@ bool WasmModuleSourceMap::DecodeMapping(const std::string& s) {
   return true;
 }
 
+size_t WasmModuleSourceMap::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(WasmModuleSourceMap, 104);
+  size_t result = sizeof(WasmModuleSourceMap);
+  result += ContentSize(offsets);
+  result += ContentSize(filenames);
+  for (const std::string& s : filenames) {
+    result += s.length();
+  }
+  result += ContentSize(file_idxs);
+  result += ContentSize(source_row);
+  return result;
+}
+
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/wasm/wasm-module-sourcemap.h b/deps/v8/src/wasm/wasm-module-sourcemap.h
index 38c0358f90ccc3..2d3cc225fdbaa3 100644
--- a/deps/v8/src/wasm/wasm-module-sourcemap.h
+++ b/deps/v8/src/wasm/wasm-module-sourcemap.h
@@ -72,6 +72,8 @@ class V8_EXPORT_PRIVATE WasmModuleSourceMap {
   // with IsValid, HasSource and HasValidEntry.
   std::string GetFilename(size_t wasm_offset) const;
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   std::vector<size_t> offsets;
   std::vector<std::string> filenames;
diff --git a/deps/v8/src/wasm/wasm-module.cc b/deps/v8/src/wasm/wasm-module.cc
index b0412620bcb77a..e2116235dd6b1b 100644
--- a/deps/v8/src/wasm/wasm-module.cc
+++ b/deps/v8/src/wasm/wasm-module.cc
@@ -13,6 +13,7 @@
 #include "src/objects/objects.h"
 #include "src/wasm/jump-table-assembler.h"
 #include "src/wasm/module-decoder.h"
+#include "src/wasm/std-object-sizes.h"
 #include "src/wasm/wasm-code-manager.h"
 #include "src/wasm/wasm-engine.h"
 #include "src/wasm/wasm-init-expr.h"
@@ -24,6 +25,11 @@
 
 namespace v8::internal::wasm {
 
+// Ensure that the max subtyping depth can be stored in the TypeDefinition.
+static_assert(
+    kV8MaxRttSubtypingDepth <=
+    std::numeric_limits<decltype(TypeDefinition().subtyping_depth)>::max());
+
 template <class Value>
 void AdaptiveMap<Value>::FinishInitialization() {
   uint32_t count = 0;
@@ -112,17 +118,10 @@ int GetContainingWasmFunction(const WasmModule* module, uint32_t byte_offset) {
   return func_index;
 }
 
-// TODO(7748): Measure whether this iterative implementation is fast enough.
-// We could cache the result on the module, in yet another vector indexed by
-// type index.
 int GetSubtypingDepth(const WasmModule* module, uint32_t type_index) {
-  uint32_t starting_point = type_index;
-  int depth = 0;
-  while ((type_index = module->supertype(type_index)) != kNoSuperType) {
-    if (type_index == starting_point) return -1;  // Cycle detected.
-    depth++;
-    if (depth > static_cast<int>(kV8MaxRttSubtypingDepth)) break;
-  }
+  DCHECK_LT(type_index, module->types.size());
+  int depth = module->types[type_index].subtyping_depth;
+  DCHECK_LE(depth, kV8MaxRttSubtypingDepth);
   return depth;
 }
 
@@ -133,7 +132,7 @@ void LazilyGeneratedNames::AddForTesting(int function_index,
 }
 
 AsmJsOffsetInformation::AsmJsOffsetInformation(
-    base::Vector<const byte> encoded_offsets)
+    base::Vector<const uint8_t> encoded_offsets)
     : encoded_offsets_(base::OwnedVector<const uint8_t>::Of(encoded_offsets)) {}
 
 AsmJsOffsetInformation::~AsmJsOffsetInformation() = default;
@@ -218,7 +217,7 @@ WasmModule::WasmModule(ModuleOrigin origin)
     : signature_zone(GetWasmEngine()->allocator(), "signature zone"),
       origin(origin) {}
 
-bool IsWasmCodegenAllowed(Isolate* isolate, Handle<Context> context) {
+bool IsWasmCodegenAllowed(Isolate* isolate, Handle<NativeContext> context) {
   // TODO(wasm): Once wasm has its own CSP policy, we should introduce a
   // separate callback that includes information about the module about to be
   // compiled. For the time being, pass an empty string as placeholder for the
@@ -297,7 +296,7 @@ Handle<JSObject> GetTypeForGlobal(Isolate* isolate, bool is_mutable,
   Handle<JSFunction> object_function = isolate->object_function();
   Handle<JSObject> object = factory->NewJSObject(object_function);
   Handle<String> mutable_string = factory->InternalizeUtf8String("mutable");
-  Handle<String> value_string = factory->InternalizeUtf8String("value");
+  Handle<String> value_string = factory->value_string();
   JSObject::AddProperty(isolate, object, mutable_string,
                         factory->ToBoolean(is_mutable), NONE);
   JSObject::AddProperty(isolate, object, value_string,
@@ -308,7 +307,7 @@ Handle<JSObject> GetTypeForGlobal(Isolate* isolate, bool is_mutable,
 
 Handle<JSObject> GetTypeForMemory(Isolate* isolate, uint32_t min_size,
                                   base::Optional<uint32_t> max_size,
-                                  bool shared) {
+                                  bool shared, bool is_memory64) {
   Factory* factory = isolate->factory();
 
   Handle<JSFunction> object_function = isolate->object_function();
@@ -316,6 +315,7 @@ Handle<JSObject> GetTypeForMemory(Isolate* isolate, uint32_t min_size,
   Handle<String> minimum_string = factory->InternalizeUtf8String("minimum");
   Handle<String> maximum_string = factory->InternalizeUtf8String("maximum");
   Handle<String> shared_string = factory->InternalizeUtf8String("shared");
+  Handle<String> index_string = factory->InternalizeUtf8String("index");
   JSObject::AddProperty(isolate, object, minimum_string,
                         factory->NewNumberFromUint(min_size), NONE);
   if (max_size.has_value()) {
@@ -325,6 +325,10 @@ Handle<JSObject> GetTypeForMemory(Isolate* isolate, uint32_t min_size,
   JSObject::AddProperty(isolate, object, shared_string,
                         factory->ToBoolean(shared), NONE);
 
+  auto index = is_memory64 ? "u64" : "u32";
+  JSObject::AddProperty(isolate, object, index_string,
+                        factory->InternalizeUtf8String(index), NONE);
+
   return object;
 }
 
@@ -338,7 +342,7 @@ Handle<JSObject> GetTypeForTable(Isolate* isolate, ValueType type,
 
   Handle<JSFunction> object_function = isolate->object_function();
   Handle<JSObject> object = factory->NewJSObject(object_function);
-  Handle<String> element_string = factory->InternalizeUtf8String("element");
+  Handle<String> element_string = factory->element_string();
   Handle<String> minimum_string = factory->InternalizeUtf8String("minimum");
   Handle<String> maximum_string = factory->InternalizeUtf8String("maximum");
   JSObject::AddProperty(isolate, object, element_string, element, NONE);
@@ -358,14 +362,14 @@ Handle<JSArray> GetImports(Isolate* isolate,
   Factory* factory = isolate->factory();
 
   Handle<String> module_string = factory->InternalizeUtf8String("module");
-  Handle<String> name_string = factory->InternalizeUtf8String("name");
+  Handle<String> name_string = factory->name_string();
   Handle<String> kind_string = factory->InternalizeUtf8String("kind");
   Handle<String> type_string = factory->InternalizeUtf8String("type");
 
-  Handle<String> function_string = factory->InternalizeUtf8String("function");
+  Handle<String> function_string = factory->function_string();
   Handle<String> table_string = factory->InternalizeUtf8String("table");
   Handle<String> memory_string = factory->InternalizeUtf8String("memory");
-  Handle<String> global_string = factory->InternalizeUtf8String("global");
+  Handle<String> global_string = factory->global_string();
   Handle<String> tag_string = factory->InternalizeUtf8String("tag");
 
   // Create the result array.
@@ -407,14 +411,14 @@ Handle<JSArray> GetImports(Isolate* isolate,
         break;
       case kExternalMemory:
         if (enabled_features.has_type_reflection()) {
-          DCHECK_EQ(0, import.index);  // Only one memory supported.
+          auto& memory = module->memories[import.index];
           base::Optional<uint32_t> maximum_size;
-          if (module->has_maximum_pages) {
-            maximum_size.emplace(module->maximum_pages);
+          if (memory.has_maximum_pages) {
+            maximum_size.emplace(memory.maximum_pages);
           }
           type_value =
-              GetTypeForMemory(isolate, module->initial_pages, maximum_size,
-                               module->has_shared_memory);
+              GetTypeForMemory(isolate, memory.initial_pages, maximum_size,
+                               memory.is_shared, memory.is_memory64);
         }
         import_kind = memory_string;
         break;
@@ -458,14 +462,14 @@ Handle<JSArray> GetExports(Isolate* isolate,
   auto enabled_features = i::wasm::WasmFeatures::FromIsolate(isolate);
   Factory* factory = isolate->factory();
 
-  Handle<String> name_string = factory->InternalizeUtf8String("name");
+  Handle<String> name_string = factory->name_string();
   Handle<String> kind_string = factory->InternalizeUtf8String("kind");
   Handle<String> type_string = factory->InternalizeUtf8String("type");
 
-  Handle<String> function_string = factory->InternalizeUtf8String("function");
+  Handle<String> function_string = factory->function_string();
   Handle<String> table_string = factory->InternalizeUtf8String("table");
   Handle<String> memory_string = factory->InternalizeUtf8String("memory");
-  Handle<String> global_string = factory->InternalizeUtf8String("global");
+  Handle<String> global_string = factory->global_string();
   Handle<String> tag_string = factory->InternalizeUtf8String("tag");
 
   // Create the result array.
@@ -505,14 +509,14 @@ Handle<JSArray> GetExports(Isolate* isolate,
         break;
       case kExternalMemory:
         if (enabled_features.has_type_reflection()) {
-          DCHECK_EQ(0, exp.index);  // Only one memory supported.
+          auto& memory = module->memories[exp.index];
           base::Optional<uint32_t> maximum_size;
-          if (module->has_maximum_pages) {
-            maximum_size.emplace(module->maximum_pages);
+          if (memory.has_maximum_pages) {
+            maximum_size.emplace(memory.maximum_pages);
           }
           type_value =
-              GetTypeForMemory(isolate, module->initial_pages, maximum_size,
-                               module->has_shared_memory);
+              GetTypeForMemory(isolate, memory.initial_pages, maximum_size,
+                               memory.is_shared, memory.is_memory64);
         }
         export_kind = memory_string;
         break;
@@ -617,21 +621,93 @@ int GetSourcePosition(const WasmModule* module, uint32_t func_index,
       is_at_number_conversion);
 }
 
-namespace {
-template <typename T>
-inline size_t VectorSize(const std::vector<T>& vector) {
-  return sizeof(T) * vector.size();
+size_t WasmModule::EstimateStoredSize() const {
+  UPDATE_WHEN_CLASS_CHANGES(WasmModule, 848);
+  return sizeof(WasmModule) +                            // --
+         signature_zone.allocation_size_for_tracing() +  // --
+         ContentSize(types) +                            // --
+         ContentSize(isorecursive_canonical_type_ids) +  // --
+         ContentSize(explicit_recursive_type_groups) +   // --
+         ContentSize(functions) +                        // --
+         ContentSize(globals) +                          // --
+         ContentSize(data_segments) +                    // --
+         ContentSize(tables) +                           // --
+         ContentSize(memories) +                         // --
+         ContentSize(import_table) +                     // --
+         ContentSize(export_table) +                     // --
+         ContentSize(tags) +                             // --
+         ContentSize(stringref_literals) +               // --
+         ContentSize(elem_segments) +                    // --
+         ContentSize(compilation_hints) +                // --
+         ContentSize(branch_hints) +                     // --
+         ContentSize(inst_traces) +                      // --
+         (num_declared_functions + 7) / 8;               // validated_functions
 }
-}  // namespace
 
-size_t EstimateStoredSize(const WasmModule* module) {
-  return sizeof(WasmModule) + VectorSize(module->globals) +
-         module->signature_zone.allocation_size() + VectorSize(module->types) +
-         VectorSize(module->isorecursive_canonical_type_ids) +
-         VectorSize(module->functions) + VectorSize(module->data_segments) +
-         VectorSize(module->tables) + VectorSize(module->import_table) +
-         VectorSize(module->export_table) + VectorSize(module->tags) +
-         VectorSize(module->elem_segments);
+template <class Value>
+size_t AdaptiveMap<Value>::EstimateCurrentMemoryConsumption() const {
+  UNREACHABLE();  // Explicit implementations below.
+}
+
+template <>
+size_t NameMap::EstimateCurrentMemoryConsumption() const {
+  size_t result = ContentSize(vector_);
+  if (map_) result += ContentSize(*map_);
+  return result;
+}
+
+size_t LazilyGeneratedNames::EstimateCurrentMemoryConsumption() const {
+  base::MutexGuard lock(&mutex_);
+  return function_names_.EstimateCurrentMemoryConsumption();
+}
+
+template <>
+size_t IndirectNameMap::EstimateCurrentMemoryConsumption() const {
+  size_t result = ContentSize(vector_);
+  for (const auto& inner_map : vector_) {
+    result += inner_map.EstimateCurrentMemoryConsumption();
+  }
+  if (map_) {
+    result += ContentSize(*map_);
+    for (const auto& [outer_index, inner_map] : *map_) {
+      result += inner_map.EstimateCurrentMemoryConsumption();
+    }
+  }
+  return result;
+}
+
+size_t TypeFeedbackStorage::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(TypeFeedbackStorage, 160);
+  UPDATE_WHEN_CLASS_CHANGES(FunctionTypeFeedback, 48);
+  // Not including sizeof(TFS) because that's contained in sizeof(WasmModule).
+  size_t result = ContentSize(feedback_for_function);
+  base::SharedMutexGuard<base::kShared> lock(&mutex);
+  for (const auto& [func_idx, feedback] : feedback_for_function) {
+    result += ContentSize(feedback.feedback_vector);
+    result += feedback.call_targets.size() * sizeof(uint32_t);
+  }
+  // The size of {well_known_imports} can only be estimated at the WasmModule
+  // level.
+  if (v8_flags.trace_wasm_offheap_memory) {
+    PrintF("TypeFeedback: %zu\n", result);
+  }
+  return result;
+}
+
+size_t WasmModule::EstimateCurrentMemoryConsumption() const {
+  UPDATE_WHEN_CLASS_CHANGES(WasmModule, 848);
+  size_t result = EstimateStoredSize();
+
+  result += type_feedback.EstimateCurrentMemoryConsumption();
+  // For type_feedback.well_known_imports:
+  result += num_imported_functions * sizeof(WellKnownImport);
+
+  result += lazily_generated_names.EstimateCurrentMemoryConsumption();
+
+  if (v8_flags.trace_wasm_offheap_memory) {
+    PrintF("WasmModule: %zu\n", result);
+  }
+  return result;
 }
 
 size_t PrintSignature(base::Vector<char> buffer, const wasm::FunctionSig* sig,
diff --git a/deps/v8/src/wasm/wasm-module.h b/deps/v8/src/wasm/wasm-module.h
index bc96893274dd9c..9c9d146d2faa13 100644
--- a/deps/v8/src/wasm/wasm-module.h
+++ b/deps/v8/src/wasm/wasm-module.h
@@ -18,6 +18,7 @@
 #include "src/codegen/signature.h"
 #include "src/common/globals.h"
 #include "src/handles/handles.h"
+#include "src/trap-handler/trap-handler.h"
 #include "src/wasm/branch-hint-map.h"
 #include "src/wasm/constant-expression.h"
 #include "src/wasm/struct-types.h"
@@ -100,6 +101,67 @@ struct WasmTag {
   uint32_t sig_index;
 };
 
+enum ModuleOrigin : uint8_t {
+  kWasmOrigin,
+  kAsmJsSloppyOrigin,
+  kAsmJsStrictOrigin
+};
+
+enum BoundsCheckStrategy : int8_t {
+  // Emit protected instructions, use the trap handler for OOB detection.
+  kTrapHandler,
+  // Emit explicit bounds checks.
+  kExplicitBoundsChecks,
+  // Emit no bounds checks at all (for testing only).
+  kNoBoundsChecks
+};
+
+// Static representation of a wasm memory.
+struct WasmMemory {
+  uint32_t index = 0;              // index into the memory table
+  uint32_t initial_pages = 0;      // initial size of the memory in 64k pages
+  uint32_t maximum_pages = 0;      // maximum size of the memory in 64k pages
+  bool is_shared = false;          // true if memory is a SharedArrayBuffer
+  bool has_maximum_pages = false;  // true if there is a maximum memory size
+  bool is_memory64 = false;        // true if the memory is 64 bit
+  bool imported = false;           // true if the memory is imported
+  bool exported = false;           // true if the memory is exported
+  // Computed information, cached here for faster compilation.
+  // Updated via {UpdateComputedInformation}.
+  uintptr_t min_memory_size = 0;  // smallest size of any memory in bytes
+  uintptr_t max_memory_size = 0;  // largest size of any memory in bytes
+  BoundsCheckStrategy bounds_checks = kExplicitBoundsChecks;
+};
+
+inline void UpdateComputedInformation(WasmMemory* memory, ModuleOrigin origin) {
+  const uintptr_t platform_max_pages =
+      memory->is_memory64 ? kV8MaxWasmMemory64Pages : kV8MaxWasmMemory32Pages;
+  memory->min_memory_size =
+      std::min(platform_max_pages, uintptr_t{memory->initial_pages}) *
+      kWasmPageSize;
+  memory->max_memory_size =
+      std::min(platform_max_pages, uintptr_t{memory->maximum_pages}) *
+      kWasmPageSize;
+
+  if (!v8_flags.wasm_bounds_checks) {
+    memory->bounds_checks = kNoBoundsChecks;
+  } else if (v8_flags.wasm_enforce_bounds_checks) {
+    // Explicit bounds checks requested via flag (for testing).
+    memory->bounds_checks = kExplicitBoundsChecks;
+  } else if (origin != kWasmOrigin) {
+    // Asm.js modules can't use trap handling.
+    memory->bounds_checks = kExplicitBoundsChecks;
+  } else if (memory->is_memory64) {
+    // Memory64 currently always requires explicit bounds checks.
+    memory->bounds_checks = kExplicitBoundsChecks;
+  } else if (trap_handler::IsTrapHandlerEnabled()) {
+    memory->bounds_checks = kTrapHandler;
+  } else {
+    // If the trap handler is not enabled, fall back to explicit bounds checks.
+    memory->bounds_checks = kExplicitBoundsChecks;
+  }
+}
+
 // Static representation of a wasm literal stringref.
 struct WasmStringRefLiteral {
   explicit WasmStringRefLiteral(const WireBytesRef& source) : source(source) {}
@@ -108,16 +170,21 @@ struct WasmStringRefLiteral {
 
 // Static representation of a wasm data segment.
 struct WasmDataSegment {
-  // Construct an active segment.
-  explicit WasmDataSegment(ConstantExpression dest_addr)
-      : dest_addr(dest_addr), active(true) {}
+  explicit WasmDataSegment(bool is_active, uint32_t memory_index,
+                           ConstantExpression dest_addr, WireBytesRef source)
+      : active(is_active),
+        memory_index(memory_index),
+        dest_addr(dest_addr),
+        source(source) {}
 
-  // Construct a passive segment, which has no dest_addr.
-  WasmDataSegment() : active(false) {}
+  static WasmDataSegment PassiveForTesting() {
+    return WasmDataSegment{false, 0, {}, {}};
+  }
 
-  ConstantExpression dest_addr;  // destination memory address of the data.
+  bool active = true;     // true if copied automatically during instantiation.
+  uint32_t memory_index;  // memory index (if active).
+  ConstantExpression dest_addr;  // destination memory address (if active).
   WireBytesRef source;           // start offset in the module bytes.
-  bool active = true;  // true if copied automatically during instantiation.
 };
 
 // Static representation of wasm element segment (table initializer).
@@ -212,12 +279,6 @@ struct WasmCompilationHint {
   WasmCompilationHintTier top_tier;
 };
 
-enum ModuleOrigin : uint8_t {
-  kWasmOrigin,
-  kAsmJsSloppyOrigin,
-  kAsmJsStrictOrigin
-};
-
 #define SELECT_WASM_COUNTER(counters, origin, prefix, suffix)     \
   ((origin) == kWasmOrigin ? (counters)->prefix##_wasm_##suffix() \
                            : (counters)->prefix##_asm_##suffix())
@@ -286,6 +347,8 @@ class AdaptiveMap {
     }
   }
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   static constexpr uint32_t kLoadFactor = 4;
   using MapType = std::map<uint32_t, Value>;
@@ -308,17 +371,19 @@ class V8_EXPORT_PRIVATE LazilyGeneratedNames {
   void AddForTesting(int function_index, WireBytesRef name);
   bool Has(uint32_t function_index);
 
+  size_t EstimateCurrentMemoryConsumption() const;
+
  private:
   // Lazy loading must guard against concurrent modifications from multiple
   // {WasmModuleObject}s.
-  base::Mutex mutex_;
+  mutable base::Mutex mutex_;
   bool has_functions_{false};
   NameMap function_names_;
 };
 
 class V8_EXPORT_PRIVATE AsmJsOffsetInformation {
  public:
-  explicit AsmJsOffsetInformation(base::Vector<const byte> encoded_offsets);
+  explicit AsmJsOffsetInformation(base::Vector<const uint8_t> encoded_offsets);
 
   // Destructor defined in wasm-module.cc, where the definition of
   // {AsmJsOffsets} is available.
@@ -348,7 +413,7 @@ class V8_EXPORT_PRIVATE AsmJsOffsetInformation {
 constexpr uint32_t kNoSuperType = std::numeric_limits<uint32_t>::max();
 
 struct TypeDefinition {
-  enum Kind { kFunction, kStruct, kArray };
+  enum Kind : int8_t { kFunction, kStruct, kArray };
 
   TypeDefinition(const FunctionSig* sig, uint32_t supertype, bool is_final)
       : function_sig(sig),
@@ -398,6 +463,7 @@ struct TypeDefinition {
   uint32_t supertype;
   Kind kind;
   bool is_final;
+  uint8_t subtyping_depth = 0;
 };
 
 struct V8_EXPORT_PRIVATE WasmDebugSymbols {
@@ -516,6 +582,8 @@ struct TypeFeedbackStorage {
   mutable base::SharedMutex mutex;
 
   WellKnownImportsList well_known_imports;
+
+  size_t EstimateCurrentMemoryConsumption() const;
 };
 
 struct WasmTable;
@@ -524,15 +592,6 @@ struct WasmTable;
 struct V8_EXPORT_PRIVATE WasmModule {
   // ================ Fields ===================================================
   Zone signature_zone;
-  uint32_t initial_pages = 0;      // initial size of the memory in 64k pages
-  uint32_t maximum_pages = 0;      // maximum size of the memory in 64k pages
-  uintptr_t min_memory_size = 0;   // smallest size of any memory in bytes
-  uintptr_t max_memory_size = 0;   // largest size of any memory in bytes
-  bool has_shared_memory = false;  // true if memory is a SharedArrayBuffer
-  bool has_maximum_pages = false;  // true if there is a maximum memory size
-  bool is_memory64 = false;        // true if the memory is 64 bit
-  bool has_memory = false;         // true if the memory was defined or imported
-  bool mem_export = false;         // true if the memory is exported
   int start_function_index = -1;   // start function, >= 0 if any
 
   // Size of the buffer required for all globals that are not imported and
@@ -559,10 +618,13 @@ struct V8_EXPORT_PRIVATE WasmModule {
   // Maps each type index to its global (cross-module) canonical index as per
   // isorecursive type canonicalization.
   std::vector<uint32_t> isorecursive_canonical_type_ids;
+  // First index -> size. Used for fuzzing only.
+  std::unordered_map<uint32_t, uint32_t> explicit_recursive_type_groups;
   std::vector<WasmFunction> functions;
   std::vector<WasmGlobal> globals;
   std::vector<WasmDataSegment> data_segments;
   std::vector<WasmTable> tables;
+  std::vector<WasmMemory> memories;
   std::vector<WasmImport> import_table;
   std::vector<WasmExport> export_table;
   std::vector<WasmTag> tags;
@@ -600,6 +662,13 @@ struct V8_EXPORT_PRIVATE WasmModule {
   // ================ Accessors ================================================
   void add_type(TypeDefinition type) {
     types.push_back(type);
+    if (type.supertype != kNoSuperType) {
+      // Set the subtyping depth. Outside of unit tests this is done by the
+      // module decoder.
+      DCHECK_GT(types.size(), 0);
+      DCHECK_LT(type.supertype, types.size() - 1);
+      types.back().subtyping_depth = types[type.supertype].subtyping_depth + 1;
+    }
     // Isorecursive canonical type will be computed later.
     isorecursive_canonical_type_ids.push_back(kNoSuperType);
   }
@@ -709,6 +778,9 @@ struct V8_EXPORT_PRIVATE WasmModule {
   base::Vector<const WasmFunction> declared_functions() const {
     return base::VectorOf(functions) + num_imported_functions;
   }
+
+  size_t EstimateStoredSize() const;                // No tracing.
+  size_t EstimateCurrentMemoryConsumption() const;  // With tracing.
 };
 
 // Static representation of a wasm indirect call table.
@@ -728,8 +800,6 @@ inline bool is_asmjs_module(const WasmModule* module) {
   return module->origin != kWasmOrigin;
 }
 
-size_t EstimateStoredSize(const WasmModule* module);
-
 // Returns the wrapper index for a function with isorecursive canonical
 // signature index {canonical_sig_index}, and origin defined by {is_import}.
 int GetExportWrapperIndex(uint32_t canonical_sig_index, bool is_import);
@@ -760,12 +830,12 @@ V8_EXPORT_PRIVATE int GetSubtypingDepth(const WasmModule* module,
 // It is illegal for anyone receiving a ModuleWireBytes to store pointers based
 // on module_bytes, as this storage is only guaranteed to be alive as long as
 // this struct is alive.
-// As {ModuleWireBytes} is just a wrapper around a {base::Vector<const byte>},
-// it should generally be passed by value.
+// As {ModuleWireBytes} is just a wrapper around a {base::Vector<const
+// uint8_t>}, it should generally be passed by value.
 struct V8_EXPORT_PRIVATE ModuleWireBytes {
-  explicit ModuleWireBytes(base::Vector<const byte> module_bytes)
+  explicit ModuleWireBytes(base::Vector<const uint8_t> module_bytes)
       : module_bytes_(module_bytes) {}
-  ModuleWireBytes(const byte* start, const byte* end)
+  ModuleWireBytes(const uint8_t* start, const uint8_t* end)
       : module_bytes_(start, static_cast<int>(end - start)) {
     DCHECK_GE(kMaxInt, end - start);
   }
@@ -782,19 +852,19 @@ struct V8_EXPORT_PRIVATE ModuleWireBytes {
     return ref.offset() <= size && ref.length() <= size - ref.offset();
   }
 
-  base::Vector<const byte> GetFunctionBytes(
+  base::Vector<const uint8_t> GetFunctionBytes(
       const WasmFunction* function) const {
     return module_bytes_.SubVector(function->code.offset(),
                                    function->code.end_offset());
   }
 
-  base::Vector<const byte> module_bytes() const { return module_bytes_; }
-  const byte* start() const { return module_bytes_.begin(); }
-  const byte* end() const { return module_bytes_.end(); }
+  base::Vector<const uint8_t> module_bytes() const { return module_bytes_; }
+  const uint8_t* start() const { return module_bytes_.begin(); }
+  const uint8_t* end() const { return module_bytes_.end(); }
   size_t length() const { return module_bytes_.length(); }
 
  private:
-  base::Vector<const byte> module_bytes_;
+  base::Vector<const uint8_t> module_bytes_;
 };
 ASSERT_TRIVIALLY_COPYABLE(ModuleWireBytes);
 
@@ -811,7 +881,7 @@ V8_EXPORT_PRIVATE std::ostream& operator<<(std::ostream& os,
                                            const WasmFunctionName& name);
 
 V8_EXPORT_PRIVATE bool IsWasmCodegenAllowed(Isolate* isolate,
-                                            Handle<Context> context);
+                                            Handle<NativeContext> context);
 V8_EXPORT_PRIVATE Handle<String> ErrorStringForCodegen(Isolate* isolate,
                                                        Handle<Context> context);
 
@@ -821,7 +891,7 @@ Handle<JSObject> GetTypeForGlobal(Isolate* isolate, bool is_mutable,
                                   ValueType type);
 Handle<JSObject> GetTypeForMemory(Isolate* isolate, uint32_t min_size,
                                   base::Optional<uint32_t> max_size,
-                                  bool shared);
+                                  bool shared, bool is_memory64);
 Handle<JSObject> GetTypeForTable(Isolate* isolate, ValueType type,
                                  uint32_t min_size,
                                  base::Optional<uint32_t> max_size);
@@ -862,7 +932,7 @@ class TruncatedUserString {
   explicit TruncatedUserString(base::Vector<T> name)
       : TruncatedUserString(name.begin(), name.length()) {}
 
-  TruncatedUserString(const byte* start, size_t len)
+  TruncatedUserString(const uint8_t* start, size_t len)
       : TruncatedUserString(reinterpret_cast<const char*>(start), len) {}
 
   TruncatedUserString(const char* start, size_t len)
diff --git a/deps/v8/src/wasm/wasm-objects-inl.h b/deps/v8/src/wasm/wasm-objects-inl.h
index 5d1f10642b8280..0214a536fa2fd1 100644
--- a/deps/v8/src/wasm/wasm-objects-inl.h
+++ b/deps/v8/src/wasm/wasm-objects-inl.h
@@ -63,10 +63,10 @@ CAST_ACCESSOR(WasmInstanceObject)
 #define OPTIONAL_ACCESSORS(holder, name, type, offset)                  \
   DEF_GETTER(holder, has_##name, bool) {                                \
     Object value = TaggedField<Object, offset>::load(cage_base, *this); \
-    return !value.IsUndefined(GetReadOnlyRoots(cage_base));             \
+    return !IsUndefined(value, GetReadOnlyRoots(cage_base));            \
   }                                                                     \
-  ACCESSORS_CHECKED2(holder, name, type, offset,                        \
-                     !value.IsUndefined(GetReadOnlyRoots(cage_base)), true)
+  ACCESSORS_CHECKED2(holder, name, Tagged<type>, offset,                \
+                     !IsUndefined(value, GetReadOnlyRoots(cage_base)), true)
 
 #define PRIMITIVE_ACCESSORS(holder, name, type, offset)               \
   type holder::name() const {                                         \
@@ -90,11 +90,11 @@ CAST_ACCESSOR(WasmInstanceObject)
 
 // WasmModuleObject
 wasm::NativeModule* WasmModuleObject::native_module() const {
-  return managed_native_module().raw();
+  return managed_native_module()->raw();
 }
 const std::shared_ptr<wasm::NativeModule>&
 WasmModuleObject::shared_native_module() const {
-  return managed_native_module().get();
+  return managed_native_module()->get();
 }
 const wasm::WasmModule* WasmModuleObject::module() const {
   // TODO(clemensb): Remove this helper (inline in callers).
@@ -102,7 +102,7 @@ const wasm::WasmModule* WasmModuleObject::module() const {
 }
 bool WasmModuleObject::is_asm_js() {
   bool asm_js = is_asmjs_module(module());
-  DCHECK_EQ(asm_js, script().IsUserJavaScript());
+  DCHECK_EQ(asm_js, script()->IsUserJavaScript());
   return asm_js;
 }
 
@@ -110,9 +110,10 @@ bool WasmModuleObject::is_asm_js() {
 OPTIONAL_ACCESSORS(WasmMemoryObject, instances, WeakArrayList, kInstancesOffset)
 
 // WasmGlobalObject
-ACCESSORS(WasmGlobalObject, untagged_buffer, JSArrayBuffer,
+ACCESSORS(WasmGlobalObject, untagged_buffer, Tagged<JSArrayBuffer>,
           kUntaggedBufferOffset)
-ACCESSORS(WasmGlobalObject, tagged_buffer, FixedArray, kTaggedBufferOffset)
+ACCESSORS(WasmGlobalObject, tagged_buffer, Tagged<FixedArray>,
+          kTaggedBufferOffset)
 
 wasm::ValueType WasmGlobalObject::type() const {
   return wasm::ValueType::FromRawBitField(static_cast<uint32_t>(raw_type()));
@@ -125,8 +126,8 @@ int WasmGlobalObject::type_size() const { return type().value_kind_size(); }
 
 Address WasmGlobalObject::address() const {
   DCHECK_NE(type(), wasm::kWasmAnyRef);
-  DCHECK_LE(offset() + type_size(), untagged_buffer().byte_length());
-  return reinterpret_cast<Address>(untagged_buffer().backing_store()) +
+  DCHECK_LE(offset() + type_size(), untagged_buffer()->byte_length());
+  return reinterpret_cast<Address>(untagged_buffer()->backing_store()) +
          offset();
 }
 
@@ -146,14 +147,14 @@ double WasmGlobalObject::GetF64() {
   return base::ReadUnalignedValue<double>(address());
 }
 
-byte* WasmGlobalObject::GetS128RawBytes() {
-  return reinterpret_cast<byte*>(address());
+uint8_t* WasmGlobalObject::GetS128RawBytes() {
+  return reinterpret_cast<uint8_t*>(address());
 }
 
 Handle<Object> WasmGlobalObject::GetRef() {
   // We use this getter for externref, funcref, and stringref.
   DCHECK(type().is_reference());
-  return handle(tagged_buffer().get(offset()), GetIsolate());
+  return handle(tagged_buffer()->get(offset()), GetIsolate());
 }
 
 void WasmGlobalObject::SetI32(int32_t value) {
@@ -174,13 +175,14 @@ void WasmGlobalObject::SetF64(double value) {
 
 void WasmGlobalObject::SetRef(Handle<Object> value) {
   DCHECK(type().is_object_reference());
-  tagged_buffer().set(offset(), *value);
+  tagged_buffer()->set(offset(), *value);
 }
 
 // WasmInstanceObject
-SANDBOXED_POINTER_ACCESSORS(WasmInstanceObject, memory_start, byte*,
-                            kMemoryStartOffset)
-PRIMITIVE_ACCESSORS(WasmInstanceObject, memory_size, size_t, kMemorySizeOffset)
+SANDBOXED_POINTER_ACCESSORS(WasmInstanceObject, memory0_start, uint8_t*,
+                            kMemory0StartOffset)
+PRIMITIVE_ACCESSORS(WasmInstanceObject, memory0_size, size_t,
+                    kMemory0SizeOffset)
 PRIMITIVE_ACCESSORS(WasmInstanceObject, stack_limit_address, Address,
                     kStackLimitAddressOffset)
 PRIMITIVE_ACCESSORS(WasmInstanceObject, real_stack_limit_address, Address,
@@ -195,39 +197,43 @@ PRIMITIVE_ACCESSORS(WasmInstanceObject, old_allocation_top_address, Address*,
                     kOldAllocationTopAddressOffset)
 PRIMITIVE_ACCESSORS(WasmInstanceObject, isorecursive_canonical_types,
                     const uint32_t*, kIsorecursiveCanonicalTypesOffset)
-SANDBOXED_POINTER_ACCESSORS(WasmInstanceObject, globals_start, byte*,
+SANDBOXED_POINTER_ACCESSORS(WasmInstanceObject, globals_start, uint8_t*,
                             kGlobalsStartOffset)
-ACCESSORS(WasmInstanceObject, imported_mutable_globals, ByteArray,
-          kImportedMutableGlobalsOffset)
-ACCESSORS(WasmInstanceObject, imported_function_targets, FixedAddressArray,
-          kImportedFunctionTargetsOffset)
+ACCESSORS(WasmInstanceObject, imported_mutable_globals,
+          Tagged<FixedAddressArray>, kImportedMutableGlobalsOffset)
+ACCESSORS(WasmInstanceObject, imported_function_targets,
+          Tagged<FixedAddressArray>, kImportedFunctionTargetsOffset)
 PRIMITIVE_ACCESSORS(WasmInstanceObject, indirect_function_table_size, uint32_t,
                     kIndirectFunctionTableSizeOffset)
-PRIMITIVE_ACCESSORS(WasmInstanceObject, indirect_function_table_sig_ids,
-                    uint32_t*, kIndirectFunctionTableSigIdsOffset)
-PRIMITIVE_ACCESSORS(WasmInstanceObject, indirect_function_table_targets,
-                    Address*, kIndirectFunctionTableTargetsOffset)
+ACCESSORS(WasmInstanceObject, indirect_function_table_sig_ids,
+          Tagged<FixedUInt32Array>, kIndirectFunctionTableSigIdsOffset)
+ACCESSORS(WasmInstanceObject, indirect_function_table_targets,
+          Tagged<ExternalPointerArray>, kIndirectFunctionTableTargetsOffset)
 PRIMITIVE_ACCESSORS(WasmInstanceObject, jump_table_start, Address,
                     kJumpTableStartOffset)
 PRIMITIVE_ACCESSORS(WasmInstanceObject, hook_on_function_call_address, Address,
                     kHookOnFunctionCallAddressOffset)
 PRIMITIVE_ACCESSORS(WasmInstanceObject, tiering_budget_array, uint32_t*,
                     kTieringBudgetArrayOffset)
-ACCESSORS(WasmInstanceObject, data_segment_starts, FixedAddressArray,
+ACCESSORS(WasmInstanceObject, memory_bases_and_sizes, Tagged<FixedAddressArray>,
+          kMemoryBasesAndSizesOffset)
+ACCESSORS(WasmInstanceObject, data_segment_starts, Tagged<FixedAddressArray>,
           kDataSegmentStartsOffset)
-ACCESSORS(WasmInstanceObject, data_segment_sizes, FixedUInt32Array,
+ACCESSORS(WasmInstanceObject, data_segment_sizes, Tagged<FixedUInt32Array>,
           kDataSegmentSizesOffset)
-ACCESSORS(WasmInstanceObject, element_segments, FixedArray,
+ACCESSORS(WasmInstanceObject, element_segments, Tagged<FixedArray>,
           kElementSegmentsOffset)
 PRIMITIVE_ACCESSORS(WasmInstanceObject, break_on_entry, uint8_t,
                     kBreakOnEntryOffset)
 
-ACCESSORS(WasmInstanceObject, module_object, WasmModuleObject,
+ACCESSORS(WasmInstanceObject, module_object, Tagged<WasmModuleObject>,
           kModuleObjectOffset)
-ACCESSORS(WasmInstanceObject, exports_object, JSObject, kExportsObjectOffset)
-ACCESSORS(WasmInstanceObject, native_context, Context, kNativeContextOffset)
-OPTIONAL_ACCESSORS(WasmInstanceObject, memory_object, WasmMemoryObject,
-                   kMemoryObjectOffset)
+ACCESSORS(WasmInstanceObject, exports_object, Tagged<JSObject>,
+          kExportsObjectOffset)
+ACCESSORS(WasmInstanceObject, native_context, Tagged<Context>,
+          kNativeContextOffset)
+ACCESSORS(WasmInstanceObject, memory_objects, Tagged<FixedArray>,
+          kMemoryObjectsOffset)
 OPTIONAL_ACCESSORS(WasmInstanceObject, untagged_globals_buffer, JSArrayBuffer,
                    kUntaggedGlobalsBufferOffset)
 OPTIONAL_ACCESSORS(WasmInstanceObject, tagged_globals_buffer, FixedArray,
@@ -237,26 +243,46 @@ OPTIONAL_ACCESSORS(WasmInstanceObject, imported_mutable_globals_buffers,
 OPTIONAL_ACCESSORS(WasmInstanceObject, tables, FixedArray, kTablesOffset)
 OPTIONAL_ACCESSORS(WasmInstanceObject, indirect_function_tables, FixedArray,
                    kIndirectFunctionTablesOffset)
-ACCESSORS(WasmInstanceObject, imported_function_refs, FixedArray,
+ACCESSORS(WasmInstanceObject, imported_function_refs, Tagged<FixedArray>,
           kImportedFunctionRefsOffset)
 OPTIONAL_ACCESSORS(WasmInstanceObject, indirect_function_table_refs, FixedArray,
                    kIndirectFunctionTableRefsOffset)
 OPTIONAL_ACCESSORS(WasmInstanceObject, tags_table, FixedArray, kTagsTableOffset)
-ACCESSORS(WasmInstanceObject, wasm_internal_functions, FixedArray,
+ACCESSORS(WasmInstanceObject, wasm_internal_functions, Tagged<FixedArray>,
           kWasmInternalFunctionsOffset)
-ACCESSORS(WasmInstanceObject, managed_object_maps, FixedArray,
+ACCESSORS(WasmInstanceObject, managed_object_maps, Tagged<FixedArray>,
           kManagedObjectMapsOffset)
-ACCESSORS(WasmInstanceObject, feedback_vectors, FixedArray,
+ACCESSORS(WasmInstanceObject, feedback_vectors, Tagged<FixedArray>,
           kFeedbackVectorsOffset)
+ACCESSORS(WasmInstanceObject, well_known_imports, Tagged<FixedArray>,
+          kWellKnownImportsOffset)
 
 void WasmInstanceObject::clear_padding() {
-  if (FIELD_SIZE(kOptionalPaddingOffset) != 0) {
+  if constexpr (FIELD_SIZE(kOptionalPaddingOffset) != 0) {
     DCHECK_EQ(4, FIELD_SIZE(kOptionalPaddingOffset));
     memset(reinterpret_cast<void*>(address() + kOptionalPaddingOffset), 0,
            FIELD_SIZE(kOptionalPaddingOffset));
   }
 }
 
+Tagged<WasmMemoryObject> WasmInstanceObject::memory_object(
+    int memory_index) const {
+  return WasmMemoryObject::cast(memory_objects()->get(memory_index));
+}
+
+uint8_t* WasmInstanceObject::memory_base(int memory_index) const {
+  DCHECK_EQ(memory0_start(),
+            reinterpret_cast<uint8_t*>(
+                memory_bases_and_sizes()->get_sandboxed_pointer(0)));
+  return reinterpret_cast<uint8_t*>(
+      memory_bases_and_sizes()->get_sandboxed_pointer(2 * memory_index));
+}
+
+size_t WasmInstanceObject::memory_size(int memory_index) const {
+  DCHECK_EQ(memory0_size(), memory_bases_and_sizes()->get(1));
+  return memory_bases_and_sizes()->get(2 * memory_index + 1);
+}
+
 ImportedFunctionEntry::ImportedFunctionEntry(
     Handle<WasmInstanceObject> instance, int index)
     : instance_(instance), index_(index) {
@@ -280,7 +306,8 @@ EXTERNAL_POINTER_ACCESSORS(WasmInternalFunction, call_target, Address,
                            kWasmInternalFunctionCallTargetTag)
 
 // WasmFunctionData
-ACCESSORS(WasmFunctionData, internal, WasmInternalFunction, kInternalOffset)
+ACCESSORS(WasmFunctionData, internal, Tagged<WasmInternalFunction>,
+          kInternalOffset)
 
 EXTERNAL_POINTER_ACCESSORS(WasmExportedFunctionData, sig, wasm::FunctionSig*,
                            kSigOffset, kWasmExportedFunctionDataSignatureTag)
@@ -308,12 +335,10 @@ CAST_ACCESSOR(WasmExternalFunction)
 
 // WasmIndirectFunctionTable
 TQ_OBJECT_CONSTRUCTORS_IMPL(WasmIndirectFunctionTable)
-PRIMITIVE_ACCESSORS(WasmIndirectFunctionTable, sig_ids, uint32_t*,
-                    kSigIdsOffset)
-PRIMITIVE_ACCESSORS(WasmIndirectFunctionTable, targets, Address*,
-                    kTargetsOffset)
-OPTIONAL_ACCESSORS(WasmIndirectFunctionTable, managed_native_allocations,
-                   Foreign, kManagedNativeAllocationsOffset)
+ACCESSORS(WasmIndirectFunctionTable, sig_ids, Tagged<FixedUInt32Array>,
+          kSigIdsOffset)
+ACCESSORS(WasmIndirectFunctionTable, targets, Tagged<ExternalPointerArray>,
+          kTargetsOffset)
 
 // WasmTypeInfo
 EXTERNAL_POINTER_ACCESSORS(WasmTypeInfo, native_type, Address,
@@ -331,6 +356,15 @@ wasm::ValueType WasmTableObject::type() {
 
 bool WasmMemoryObject::has_maximum_pages() { return maximum_pages() >= 0; }
 
+bool WasmMemoryObject::is_memory64() const {
+  int memory64_smi_value =
+      TorqueGeneratedWasmMemoryObject<WasmMemoryObject,
+                                      JSObject>::is_memory64();
+  DCHECK_LE(0, memory64_smi_value);
+  DCHECK_GE(1, memory64_smi_value);
+  return memory64_smi_value != 0;
+}
+
 // static
 Handle<Object> WasmObject::ReadValueAt(Isolate* isolate, Handle<HeapObject> obj,
                                        wasm::ValueType type, uint32_t offset) {
@@ -418,14 +452,14 @@ MaybeHandle<Object> WasmObject::ToWasmValue(Isolate* isolate,
 // Conversions from Numeric objects.
 // static
 template <typename ElementType>
-ElementType WasmObject::FromNumber(Object value) {
+ElementType WasmObject::FromNumber(Tagged<Object> value) {
   // The value must already be prepared for storing to numeric fields.
-  DCHECK(value.IsNumber());
-  if (value.IsSmi()) {
+  DCHECK(IsNumber(value));
+  if (IsSmi(value)) {
     return static_cast<ElementType>(Smi::ToInt(value));
 
-  } else if (value.IsHeapNumber()) {
-    double double_value = HeapNumber::cast(value).value();
+  } else if (IsHeapNumber(value)) {
+    double double_value = HeapNumber::cast(value)->value();
     if (std::is_same<ElementType, double>::value ||
         std::is_same<ElementType, float>::value) {
       return static_cast<ElementType>(double_value);
@@ -459,7 +493,7 @@ void WasmObject::WriteValueAt(Isolate* isolate, Handle<HeapObject> obj,
       break;
     }
     case wasm::kI64: {
-      int64_t scalar_value = BigInt::cast(*value).AsInt64();
+      int64_t scalar_value = BigInt::cast(*value)->AsInt64();
       base::WriteUnalignedValue<int64_t>(field_address, scalar_value);
       break;
     }
@@ -492,19 +526,19 @@ void WasmObject::WriteValueAt(Isolate* isolate, Handle<HeapObject> obj,
   }
 }
 
-wasm::StructType* WasmStruct::type(Map map) {
-  WasmTypeInfo type_info = map.wasm_type_info();
-  return reinterpret_cast<wasm::StructType*>(type_info.native_type());
+wasm::StructType* WasmStruct::type(Tagged<Map> map) {
+  Tagged<WasmTypeInfo> type_info = map->wasm_type_info();
+  return reinterpret_cast<wasm::StructType*>(type_info->native_type());
 }
 
-wasm::StructType* WasmStruct::GcSafeType(Map map) {
-  DCHECK_EQ(WASM_STRUCT_TYPE, map.instance_type());
-  HeapObject raw = HeapObject::cast(map.constructor_or_back_pointer());
+wasm::StructType* WasmStruct::GcSafeType(Tagged<Map> map) {
+  DCHECK_EQ(WASM_STRUCT_TYPE, map->instance_type());
+  Tagged<HeapObject> raw = HeapObject::cast(map->constructor_or_back_pointer());
   // The {WasmTypeInfo} might be in the middle of being moved, which is why we
   // can't read its map for a checked cast. But we can rely on its native type
   // pointer being intact in the old location.
-  WasmTypeInfo type_info = WasmTypeInfo::unchecked_cast(raw);
-  return reinterpret_cast<wasm::StructType*>(type_info.native_type());
+  Tagged<WasmTypeInfo> type_info = WasmTypeInfo::unchecked_cast(raw);
+  return reinterpret_cast<wasm::StructType*>(type_info->native_type());
 }
 
 int WasmStruct::Size(const wasm::StructType* type) {
@@ -517,24 +551,28 @@ int WasmStruct::Size(const wasm::StructType* type) {
 }
 
 // static
-void WasmStruct::EncodeInstanceSizeInMap(int instance_size, Map map) {
+void WasmStruct::EncodeInstanceSizeInMap(int instance_size, Tagged<Map> map) {
   // WasmStructs can be bigger than the {map.instance_size_in_words} field
   // can describe; yet we have to store the instance size somewhere on the
   // map so that the GC can read it without relying on any other objects
   // still being around. To solve this problem, we store the instance size
   // in two other fields that are otherwise unused for WasmStructs.
-  static_assert(0xFFFF - kHeaderSize >
-                wasm::kMaxValueTypeSize * wasm::kV8MaxWasmStructFields);
-  map.SetWasmByte1(instance_size & 0xFF);
-  map.SetWasmByte2(instance_size >> 8);
+  static_assert(0xFFFF > ((kHeaderSize + wasm::kMaxValueTypeSize *
+                                             wasm::kV8MaxWasmStructFields) >>
+                          kObjectAlignmentBits));
+  map->SetWasmByte1((instance_size >> kObjectAlignmentBits) & 0xff);
+  map->SetWasmByte2(instance_size >> (8 + kObjectAlignmentBits));
 }
 
 // static
-int WasmStruct::DecodeInstanceSizeFromMap(Map map) {
-  return (map.WasmByte2() << 8) | map.WasmByte1();
+int WasmStruct::DecodeInstanceSizeFromMap(Tagged<Map> map) {
+  return (map->WasmByte2() << (8 + kObjectAlignmentBits)) |
+         (map->WasmByte1() << kObjectAlignmentBits);
 }
 
-int WasmStruct::GcSafeSize(Map map) { return DecodeInstanceSizeFromMap(map); }
+int WasmStruct::GcSafeSize(Tagged<Map> map) {
+  return DecodeInstanceSizeFromMap(map);
+}
 
 wasm::StructType* WasmStruct::type() const { return type(map()); }
 
@@ -567,25 +605,25 @@ void WasmStruct::SetField(Isolate* isolate, Handle<WasmStruct> obj,
   WriteValueAt(isolate, obj, field_type, offset, value);
 }
 
-wasm::ArrayType* WasmArray::type(Map map) {
-  DCHECK_EQ(WASM_ARRAY_TYPE, map.instance_type());
-  WasmTypeInfo type_info = map.wasm_type_info();
-  return reinterpret_cast<wasm::ArrayType*>(type_info.native_type());
+wasm::ArrayType* WasmArray::type(Tagged<Map> map) {
+  DCHECK_EQ(WASM_ARRAY_TYPE, map->instance_type());
+  Tagged<WasmTypeInfo> type_info = map->wasm_type_info();
+  return reinterpret_cast<wasm::ArrayType*>(type_info->native_type());
 }
 
-wasm::ArrayType* WasmArray::GcSafeType(Map map) {
-  DCHECK_EQ(WASM_ARRAY_TYPE, map.instance_type());
-  HeapObject raw = HeapObject::cast(map.constructor_or_back_pointer());
+wasm::ArrayType* WasmArray::GcSafeType(Tagged<Map> map) {
+  DCHECK_EQ(WASM_ARRAY_TYPE, map->instance_type());
+  Tagged<HeapObject> raw = HeapObject::cast(map->constructor_or_back_pointer());
   // The {WasmTypeInfo} might be in the middle of being moved, which is why we
   // can't read its map for a checked cast. But we can rely on its native type
   // pointer being intact in the old location.
-  WasmTypeInfo type_info = WasmTypeInfo::unchecked_cast(raw);
-  return reinterpret_cast<wasm::ArrayType*>(type_info.native_type());
+  Tagged<WasmTypeInfo> type_info = WasmTypeInfo::unchecked_cast(raw);
+  return reinterpret_cast<wasm::ArrayType*>(type_info->native_type());
 }
 
 wasm::ArrayType* WasmArray::type() const { return type(map()); }
 
-int WasmArray::SizeFor(Map map, int length) {
+int WasmArray::SizeFor(Tagged<Map> map, int length) {
   int element_size = DecodeElementSizeFromMap(map);
   return kHeaderSize + RoundUp(element_size * length, kTaggedSize);
 }
@@ -618,12 +656,14 @@ Handle<Object> WasmArray::GetElement(Isolate* isolate, Handle<WasmArray> array,
 }
 
 // static
-void WasmArray::EncodeElementSizeInMap(int element_size, Map map) {
-  map.SetWasmByte1(element_size);
+void WasmArray::EncodeElementSizeInMap(int element_size, Tagged<Map> map) {
+  map->SetWasmByte1(element_size);
 }
 
 // static
-int WasmArray::DecodeElementSizeFromMap(Map map) { return map.WasmByte1(); }
+int WasmArray::DecodeElementSizeFromMap(Tagged<Map> map) {
+  return map->WasmByte1();
+}
 
 EXTERNAL_POINTER_ACCESSORS(WasmContinuationObject, jmpbuf, Address,
                            kJmpbufOffset, kWasmContinuationJmpbufTag)
diff --git a/deps/v8/src/wasm/wasm-objects.cc b/deps/v8/src/wasm/wasm-objects.cc
index c8817667230002..5a6b9dd178047d 100644
--- a/deps/v8/src/wasm/wasm-objects.cc
+++ b/deps/v8/src/wasm/wasm-objects.cc
@@ -17,6 +17,7 @@
 #include "src/wasm/module-compiler.h"
 #include "src/wasm/module-decoder.h"
 #include "src/wasm/module-instantiate.h"
+#include "src/wasm/serialized-signature-inl.h"
 #include "src/wasm/value-type.h"
 #include "src/wasm/wasm-code-manager.h"
 #include "src/wasm/wasm-engine.h"
@@ -57,7 +58,7 @@ Handle<WasmModuleObject> WasmModuleObject::New(
     Isolate* isolate, std::shared_ptr<wasm::NativeModule> native_module,
     Handle<Script> script) {
   Handle<Managed<wasm::NativeModule>> managed_native_module;
-  if (script->type() == Script::TYPE_WASM) {
+  if (script->type() == Script::Type::kWasm) {
     managed_native_module = handle(
         Managed<wasm::NativeModule>::cast(script->wasm_managed_native_module()),
         isolate);
@@ -204,7 +205,7 @@ int WasmTableObject::Grow(Isolate* isolate, Handle<WasmTableObject> table,
 
   // Check if growing by {count} is valid.
   uint32_t max_size;
-  if (!table->maximum_length().ToUint32(&max_size)) {
+  if (!Object::ToUint32(table->maximum_length(), &max_size)) {
     max_size = v8_flags.wasm_max_table_size;
   }
   max_size = std::min(max_size, v8_flags.wasm_max_table_size.value());
@@ -215,7 +216,7 @@ int WasmTableObject::Grow(Isolate* isolate, Handle<WasmTableObject> table,
   // Even with 2x over-allocation, there should not be an integer overflow.
   static_assert(wasm::kV8MaxWasmTableSize <= kMaxInt / 2);
   DCHECK_GE(kMaxInt, new_size);
-  int old_capacity = table->entries().length();
+  int old_capacity = table->entries()->length();
   if (new_size > static_cast<uint32_t>(old_capacity)) {
     int grow = static_cast<int>(new_size) - old_capacity;
     // Grow at least by the old capacity, to implement exponential growing.
@@ -256,20 +257,18 @@ int WasmTableObject::Grow(Isolate* isolate, Handle<WasmTableObject> table,
   return old_size;
 }
 
-bool WasmTableObject::IsInBounds(Isolate* isolate,
-                                 Handle<WasmTableObject> table,
-                                 uint32_t entry_index) {
-  return entry_index < static_cast<uint32_t>(table->current_length());
+bool WasmTableObject::is_in_bounds(uint32_t entry_index) {
+  return entry_index < static_cast<uint32_t>(current_length());
 }
 
 MaybeHandle<Object> WasmTableObject::JSToWasmElement(
     Isolate* isolate, Handle<WasmTableObject> table, Handle<Object> entry,
     const char** error_message) {
   // Any `entry` has to be in its JS representation.
-  DCHECK(!entry->IsWasmInternalFunction());
+  DCHECK(!IsWasmInternalFunction(*entry));
   const WasmModule* module =
-      !table->instance().IsUndefined()
-          ? WasmInstanceObject::cast(table->instance()).module()
+      !IsUndefined(table->instance())
+          ? WasmInstanceObject::cast(table->instance())->module()
           : nullptr;
   return wasm::JSToWasmObject(isolate, module, entry, table->type(),
                               error_message);
@@ -280,13 +279,13 @@ void WasmTableObject::SetFunctionTableEntry(Isolate* isolate,
                                             Handle<FixedArray> entries,
                                             int entry_index,
                                             Handle<Object> entry) {
-  if (entry->IsWasmNull(isolate)) {
+  if (IsWasmNull(*entry, isolate)) {
     ClearDispatchTables(isolate, table, entry_index);  // Degenerate case.
     entries->set(entry_index, ReadOnlyRoots(isolate).wasm_null());
     return;
   }
-  Handle<Object> external =
-      handle(Handle<WasmInternalFunction>::cast(entry)->external(), isolate);
+  Handle<Object> external = WasmInternalFunction::GetOrCreateExternal(
+      Handle<WasmInternalFunction>::cast(entry));
 
   if (WasmExportedFunction::IsWasmExportedFunction(*external)) {
     auto exported_function = Handle<WasmExportedFunction>::cast(external);
@@ -294,8 +293,8 @@ void WasmTableObject::SetFunctionTableEntry(Isolate* isolate,
                                                isolate);
     int func_index = exported_function->function_index();
     auto* wasm_function = &target_instance->module()->functions[func_index];
-    UpdateDispatchTables(isolate, *table, entry_index, wasm_function,
-                         *target_instance);
+    UpdateDispatchTables(isolate, table, entry_index, wasm_function,
+                         target_instance);
   } else if (WasmJSFunction::IsWasmJSFunction(*external)) {
     UpdateDispatchTables(isolate, table, entry_index,
                          Handle<WasmJSFunction>::cast(external));
@@ -307,11 +306,12 @@ void WasmTableObject::SetFunctionTableEntry(Isolate* isolate,
   entries->set(entry_index, *entry);
 }
 
-// TODO(manoskouk): Does this need to be handlified?
+// Note: This needs to be handlified because it transitively calls
+// {ImportWasmJSFunctionIntoTable} which calls {NewWasmApiFunctionRef}.
 void WasmTableObject::Set(Isolate* isolate, Handle<WasmTableObject> table,
                           uint32_t index, Handle<Object> entry) {
   // Callers need to perform bounds checks, type check, and error handling.
-  DCHECK(IsInBounds(isolate, table, index));
+  DCHECK(table->is_in_bounds(index));
 
   Handle<FixedArray> entries(table->entries(), isolate);
   // The FixedArray is addressed with int's.
@@ -339,9 +339,9 @@ void WasmTableObject::Set(Isolate* isolate, Handle<WasmTableObject> table,
     case wasm::HeapType::kBottom:
       UNREACHABLE();
     default:
-      DCHECK(!table->instance().IsUndefined());
+      DCHECK(!IsUndefined(table->instance()));
       if (WasmInstanceObject::cast(table->instance())
-              .module()
+              ->module()
               ->has_signature(table->type().ref_index())) {
         SetFunctionTableEntry(isolate, table, entries, entry_index, entry);
         return;
@@ -356,14 +356,14 @@ Handle<Object> WasmTableObject::Get(Isolate* isolate,
                                     uint32_t index) {
   Handle<FixedArray> entries(table->entries(), isolate);
   // Callers need to perform bounds checks and error handling.
-  DCHECK(IsInBounds(isolate, table, index));
+  DCHECK(table->is_in_bounds(index));
 
   // The FixedArray is addressed with int's.
   int entry_index = static_cast<int>(index);
 
   Handle<Object> entry(entries->get(entry_index), isolate);
 
-  if (entry->IsWasmNull(isolate)) {
+  if (IsWasmNull(*entry, isolate)) {
     return entry;
   }
 
@@ -383,20 +383,20 @@ Handle<Object> WasmTableObject::Get(Isolate* isolate,
     case wasm::HeapType::kNoExtern:
       return entry;
     case wasm::HeapType::kFunc:
-      if (entry->IsWasmInternalFunction()) return entry;
+      if (IsWasmInternalFunction(*entry)) return entry;
       break;
     case wasm::HeapType::kBottom:
       UNREACHABLE();
     default:
-      DCHECK(!table->instance().IsUndefined());
+      DCHECK(!IsUndefined(table->instance()));
       const WasmModule* module =
-          WasmInstanceObject::cast(table->instance()).module();
+          WasmInstanceObject::cast(table->instance())->module();
       if (module->has_array(table->type().ref_index()) ||
           module->has_struct(table->type().ref_index())) {
         return entry;
       }
       DCHECK(module->has_signature(table->type().ref_index()));
-      if (entry->IsWasmInternalFunction()) return entry;
+      if (IsWasmInternalFunction(*entry)) return entry;
       break;
   }
 
@@ -429,40 +429,58 @@ void WasmTableObject::Fill(Isolate* isolate, Handle<WasmTableObject> table,
 }
 
 // static
-void WasmTableObject::UpdateDispatchTables(Isolate* isolate,
-                                           WasmTableObject table,
-                                           int entry_index,
-                                           const wasm::WasmFunction* func,
-                                           WasmInstanceObject target_instance) {
-  DisallowGarbageCollection no_gc;
-
+void WasmTableObject::UpdateDispatchTables(
+    Isolate* isolate, Handle<WasmTableObject> table, int entry_index,
+    const wasm::WasmFunction* func,
+    Handle<WasmInstanceObject> target_instance) {
   // We simply need to update the IFTs for each instance that imports
   // this table.
-  FixedArray dispatch_tables = table.dispatch_tables();
-  DCHECK_EQ(0, dispatch_tables.length() % kDispatchTableNumElements);
+  Handle<FixedArray> dispatch_tables =
+      handle(table->dispatch_tables(), isolate);
+  DCHECK_EQ(0, dispatch_tables->length() % kDispatchTableNumElements);
 
-  Object call_ref =
+  Handle<Object> call_ref =
       func->imported
           // The function in the target instance was imported. Use its imports
           // table, which contains a tuple needed by the import wrapper.
-          ? target_instance.imported_function_refs().get(func->func_index)
+          ? handle(target_instance->imported_function_refs()->get(
+                       func->func_index),
+                   isolate)
           // For wasm functions, just pass the target instance.
           : target_instance;
-  Address call_target = target_instance.GetCallTarget(func->func_index);
+  Address call_target = target_instance->GetCallTarget(func->func_index);
 
   int original_sig_id = func->sig_index;
 
-  for (int i = 0, len = dispatch_tables.length(); i < len;
+  for (int i = 0, len = dispatch_tables->length(); i < len;
        i += kDispatchTableNumElements) {
     int table_index =
-        Smi::cast(dispatch_tables.get(i + kDispatchTableIndexOffset)).value();
-    WasmInstanceObject instance = WasmInstanceObject::cast(
-        dispatch_tables.get(i + kDispatchTableInstanceOffset));
-    int sig_id = target_instance.module()
+        Smi::cast(dispatch_tables->get(i + kDispatchTableIndexOffset)).value();
+    Handle<WasmInstanceObject> instance =
+        handle(WasmInstanceObject::cast(
+                   dispatch_tables->get(i + kDispatchTableInstanceOffset)),
+               isolate);
+    int sig_id = target_instance->module()
                      ->isorecursive_canonical_type_ids[original_sig_id];
-    WasmIndirectFunctionTable ift = WasmIndirectFunctionTable::cast(
-        instance.indirect_function_tables().get(table_index));
-    ift.Set(entry_index, sig_id, call_target, call_ref);
+    Handle<WasmIndirectFunctionTable> ift =
+        handle(WasmIndirectFunctionTable::cast(
+                   instance->indirect_function_tables()->get(table_index)),
+               isolate);
+    if (v8_flags.wasm_to_js_generic_wrapper &&
+        IsWasmApiFunctionRef(*call_ref)) {
+      Handle<WasmApiFunctionRef> orig_ref =
+          Handle<WasmApiFunctionRef>::cast(call_ref);
+      Handle<WasmApiFunctionRef> new_ref =
+          isolate->factory()->NewWasmApiFunctionRef(orig_ref);
+      if (new_ref->instance() == *instance) {
+        WasmApiFunctionRef::SetIndexInTableAsCallOrigin(new_ref, entry_index);
+      } else {
+        WasmApiFunctionRef::SetCrossInstanceTableIndexAsCallOrigin(
+            isolate, new_ref, instance, entry_index);
+      }
+      call_ref = new_ref;
+    }
+    ift->Set(entry_index, sig_id, call_target, *call_ref);
   }
 }
 
@@ -499,22 +517,9 @@ void WasmTableObject::UpdateDispatchTables(
   DCHECK_EQ(0, dispatch_tables->length() % kDispatchTableNumElements);
 
   // Reconstruct signature.
-  // TODO(jkummerow): Unify with "SignatureHelper" in c-api.cc.
-  PodArray<wasm::ValueType> serialized_sig =
-      capi_function->GetSerializedSignature();
-  int total_count = serialized_sig.length() - 1;
-  std::unique_ptr<wasm::ValueType[]> reps(new wasm::ValueType[total_count]);
-  int result_count;
-  static const wasm::ValueType kMarker = wasm::kWasmVoid;
-  for (int i = 0, j = 0; i <= total_count; i++) {
-    if (serialized_sig.get(i) == kMarker) {
-      result_count = i;
-      continue;
-    }
-    reps[j++] = serialized_sig.get(i);
-  }
-  int param_count = total_count - result_count;
-  wasm::FunctionSig sig(result_count, param_count, reps.get());
+  std::unique_ptr<wasm::ValueType[]> reps;
+  wasm::FunctionSig sig = wasm::SerializedSignatureHelper::DeserializeSignature(
+      capi_function->GetSerializedSignature(), &reps);
 
   for (int i = 0; i < dispatch_tables->length();
        i += kDispatchTableNumElements) {
@@ -525,11 +530,12 @@ void WasmTableObject::UpdateDispatchTables(
             dispatch_tables->get(i + kDispatchTableInstanceOffset)),
         isolate);
     wasm::NativeModule* native_module =
-        instance->module_object().native_module();
+        instance->module_object()->native_module();
     wasm::WasmImportWrapperCache* cache = native_module->import_wrapper_cache();
     auto kind = wasm::ImportCallKind::kWasmToCapi;
     uint32_t canonical_type_index =
         wasm::GetTypeCanonicalizer()->AddRecursiveGroup(&sig);
+    int param_count = static_cast<int>(sig.parameter_count());
     wasm::WasmCode* wasm_code = cache->MaybeGet(kind, canonical_type_index,
                                                 param_count, wasm::kNoSuspend);
     if (wasm_code == nullptr) {
@@ -548,9 +554,9 @@ void WasmTableObject::UpdateDispatchTables(
     instance->GetIndirectFunctionTable(isolate, table_index)
         ->Set(entry_index, canonical_type_index, wasm_code->instruction_start(),
               WasmCapiFunctionData::cast(
-                  capi_function->shared().function_data(kAcquireLoad))
-                  .internal()
-                  .ref());
+                  capi_function->shared()->function_data(kAcquireLoad))
+                  ->internal()
+                  ->ref());
   }
 }
 
@@ -585,7 +591,7 @@ void WasmTableObject::SetFunctionTablePlaceholder(
   Handle<Tuple2> tuple = isolate->factory()->NewTuple2(
       instance, Handle<Smi>(Smi::FromInt(func_index), isolate),
       AllocationType::kOld);
-  table->entries().set(entry_index, *tuple);
+  table->entries()->set(entry_index, *tuple);
 }
 
 void WasmTableObject::GetFunctionTableEntry(
@@ -597,14 +603,14 @@ void WasmTableObject::GetFunctionTableEntry(
   DCHECK_LT(entry_index, table->current_length());
   // We initialize {is_valid} with {true}. We may change it later.
   *is_valid = true;
-  Handle<Object> element(table->entries().get(entry_index), isolate);
+  Handle<Object> element(table->entries()->get(entry_index), isolate);
 
-  *is_null = element->IsWasmNull(isolate);
+  *is_null = IsWasmNull(*element, isolate);
   if (*is_null) return;
 
-  if (element->IsWasmInternalFunction()) {
-    element = handle(Handle<WasmInternalFunction>::cast(element)->external(),
-                     isolate);
+  if (IsWasmInternalFunction(*element)) {
+    element = WasmInternalFunction::GetOrCreateExternal(
+        Handle<WasmInternalFunction>::cast(element));
   }
   if (WasmExportedFunction::IsWasmExportedFunction(*element)) {
     auto target_func = Handle<WasmExportedFunction>::cast(element);
@@ -618,7 +624,7 @@ void WasmTableObject::GetFunctionTableEntry(
     *maybe_js_function = Handle<WasmJSFunction>::cast(element);
     return;
   }
-  if (element->IsTuple2()) {
+  if (IsTuple2(*element)) {
     auto tuple = Handle<Tuple2>::cast(element);
     *instance = handle(WasmInstanceObject::cast(tuple->value1()), isolate);
     *function_index = Smi::cast(tuple->value2()).value();
@@ -628,64 +634,41 @@ void WasmTableObject::GetFunctionTableEntry(
   *is_valid = false;
 }
 
-namespace {
-class IftNativeAllocations {
- public:
-  IftNativeAllocations(Handle<WasmIndirectFunctionTable> table, uint32_t size)
-      : sig_ids_(size), targets_(size) {
-    table->set_sig_ids(sig_ids_.data());
-    table->set_targets(targets_.data());
-  }
-
-  static size_t SizeInMemory(uint32_t size) {
-    return size * (sizeof(Address) + sizeof(uint32_t));
-  }
-
-  void resize(Handle<WasmIndirectFunctionTable> table, uint32_t new_size) {
-    DCHECK_GE(new_size, sig_ids_.size());
-    DCHECK_EQ(this, Managed<IftNativeAllocations>::cast(
-                        table->managed_native_allocations())
-                        .raw());
-    sig_ids_.resize(new_size);
-    targets_.resize(new_size);
-    table->set_sig_ids(sig_ids_.data());
-    table->set_targets(targets_.data());
-  }
-
- private:
-  std::vector<uint32_t> sig_ids_;
-  std::vector<Address> targets_;
-};
-}  // namespace
-
 Handle<WasmIndirectFunctionTable> WasmIndirectFunctionTable::New(
     Isolate* isolate, uint32_t size) {
   auto refs = isolate->factory()->NewFixedArray(static_cast<int>(size));
+  auto sig_ids = FixedUInt32Array::New(isolate, size);
+  auto targets = ExternalPointerArray::New(isolate, size);
   auto table = Handle<WasmIndirectFunctionTable>::cast(
       isolate->factory()->NewStruct(WASM_INDIRECT_FUNCTION_TABLE_TYPE));
+
+  // Disallow GC until all fields have acceptable types.
+  DisallowGarbageCollection no_gc;
+
   table->set_size(size);
   table->set_refs(*refs);
-  auto native_allocations = Managed<IftNativeAllocations>::Allocate(
-      isolate, IftNativeAllocations::SizeInMemory(size), table, size);
-  table->set_managed_native_allocations(*native_allocations);
+  table->set_sig_ids(*sig_ids);
+  table->set_targets(*targets);
   for (uint32_t i = 0; i < size; ++i) {
     table->Clear(i);
   }
+
   return table;
 }
+
 void WasmIndirectFunctionTable::Set(uint32_t index, int sig_id,
-                                    Address call_target, Object ref) {
-  sig_ids()[index] = sig_id;
-  targets()[index] = call_target;
-  refs().set(index, ref);
+                                    Address call_target, Tagged<Object> ref) {
+  Isolate* isolate = GetIsolateFromWritableObject(*this);
+  sig_ids()->set(index, sig_id);
+  targets()->set<kWasmIndirectFunctionTargetTag>(index, isolate, call_target);
+  refs()->set(index, ref);
 }
 
 void WasmIndirectFunctionTable::Clear(uint32_t index) {
-  sig_ids()[index] = -1;
-  targets()[index] = 0;
-  refs().set(
-      index,
-      ReadOnlyRoots(GetIsolateFromWritableObject(*this)).undefined_value());
+  Isolate* isolate = GetIsolateFromWritableObject(*this);
+  sig_ids()->set(index, -1);
+  targets()->clear(index);
+  refs()->set(index, ReadOnlyRoots(isolate).undefined_value());
 }
 
 void WasmIndirectFunctionTable::Resize(Isolate* isolate,
@@ -699,6 +682,9 @@ void WasmIndirectFunctionTable::Resize(Isolate* isolate,
   // Grow table exponentially to guarantee amortized constant allocation and gc
   // time.
   Handle<FixedArray> old_refs(table->refs(), isolate);
+  Handle<FixedUInt32Array> old_sig_ids(table->sig_ids(), isolate);
+  Handle<ExternalPointerArray> old_targets(table->targets(), isolate);
+
   // Since we might have overallocated, {old_capacity} might be different than
   // {old_size}.
   uint32_t old_capacity = old_refs->length();
@@ -706,13 +692,22 @@ void WasmIndirectFunctionTable::Resize(Isolate* isolate,
   if (new_size <= old_capacity) return;
   uint32_t new_capacity = std::max(2 * old_capacity, new_size);
 
-  Managed<IftNativeAllocations>::cast(table->managed_native_allocations())
-      .raw()
-      ->resize(table, new_capacity);
+  Handle<FixedUInt32Array> new_sig_ids =
+      FixedUInt32Array::New(isolate, new_capacity);
+  new_sig_ids->copy_in(0, old_sig_ids->GetDataStartAddress(),
+                       old_capacity * kUInt32Size);
+  table->set_sig_ids(*new_sig_ids);
+
+  Handle<ExternalPointerArray> new_targets =
+      isolate->factory()
+          ->CopyExternalPointerArrayAndGrow<kWasmIndirectFunctionTargetTag>(
+              old_targets, static_cast<int>(new_capacity - old_capacity));
+  table->set_targets(*new_targets);
 
   Handle<FixedArray> new_refs = isolate->factory()->CopyFixedArrayAndGrow(
       old_refs, static_cast<int>(new_capacity - old_capacity));
   table->set_refs(*new_refs);
+
   for (uint32_t i = old_capacity; i < new_capacity; ++i) {
     table->Clear(i);
   }
@@ -720,39 +715,49 @@ void WasmIndirectFunctionTable::Resize(Isolate* isolate,
 
 namespace {
 
-void SetInstanceMemory(Handle<WasmInstanceObject> instance,
-                       Handle<JSArrayBuffer> buffer) {
-  bool is_wasm_module = instance->module()->origin == wasm::kWasmOrigin;
-  bool use_trap_handler =
-      instance->module_object().native_module()->bounds_checks() ==
-      wasm::kTrapHandler;
+void SetInstanceMemory(Tagged<WasmInstanceObject> instance,
+                       Tagged<JSArrayBuffer> buffer, int memory_index) {
+  DisallowHeapAllocation no_gc;
+  const WasmModule* module = instance->module();
+  const wasm::WasmMemory& memory = module->memories[memory_index];
+
+  bool is_wasm_module = module->origin == wasm::kWasmOrigin;
+  bool use_trap_handler = memory.bounds_checks == wasm::kTrapHandler;
+  // Asm.js does not use trap handling.
+  CHECK_IMPLIES(use_trap_handler, is_wasm_module);
+  // ArrayBuffers allocated for Wasm do always have a BackingStore.
+  std::shared_ptr<BackingStore> backing_store = buffer->GetBackingStore();
+  CHECK_IMPLIES(is_wasm_module, backing_store);
+  CHECK_IMPLIES(is_wasm_module, backing_store->is_wasm_memory());
   // Wasm modules compiled to use the trap handler don't have bounds checks,
   // so they must have a memory that has guard regions.
-  CHECK_IMPLIES(is_wasm_module && use_trap_handler,
-                buffer->GetBackingStore()->has_guard_regions());
+  CHECK_IMPLIES(use_trap_handler, backing_store->has_guard_regions());
 
-  instance->SetRawMemory(reinterpret_cast<byte*>(buffer->backing_store()),
+  instance->SetRawMemory(memory_index,
+                         reinterpret_cast<uint8_t*>(buffer->backing_store()),
                          buffer->byte_length());
 #if DEBUG
   if (!v8_flags.mock_arraybuffer_allocator) {
     // To flush out bugs earlier, in DEBUG mode, check that all pages of the
     // memory are accessible by reading and writing one byte on each page.
     // Don't do this if the mock ArrayBuffer allocator is enabled.
-    byte* mem_start = instance->memory_start();
-    size_t mem_size = instance->memory_size();
+    uint8_t* mem_start = instance->memory0_start();
+    size_t mem_size = instance->memory0_size();
     for (size_t offset = 0; offset < mem_size; offset += wasm::kWasmPageSize) {
-      byte val = mem_start[offset];
+      uint8_t val = mem_start[offset];
       USE(val);
       mem_start[offset] = val;
     }
   }
 #endif
 }
+
 }  // namespace
 
-MaybeHandle<WasmMemoryObject> WasmMemoryObject::New(
-    Isolate* isolate, Handle<JSArrayBuffer> buffer, int maximum,
-    WasmMemoryFlag memory_type) {
+Handle<WasmMemoryObject> WasmMemoryObject::New(Isolate* isolate,
+                                               Handle<JSArrayBuffer> buffer,
+                                               int maximum,
+                                               WasmMemoryFlag memory_type) {
   Handle<JSFunction> memory_ctor(
       isolate->native_context()->wasm_memory_constructor(), isolate);
 
@@ -762,9 +767,13 @@ MaybeHandle<WasmMemoryObject> WasmMemoryObject::New(
   memory_object->set_maximum_pages(maximum);
   memory_object->set_is_memory64(memory_type == WasmMemoryFlag::kWasmMemory64);
 
+  std::shared_ptr<BackingStore> backing_store = buffer->GetBackingStore();
   if (buffer->is_shared()) {
-    auto backing_store = buffer->GetBackingStore();
+    // Only Wasm memory can be shared (in contrast to asm.js memory).
+    CHECK(backing_store && backing_store->is_wasm_memory());
     backing_store->AttachSharedWasmMemoryObject(isolate, memory_object);
+  } else if (backing_store) {
+    CHECK(!backing_store->is_shared());
   }
 
   // For debugging purposes we memorize a link from the JSArrayBuffer
@@ -818,51 +827,56 @@ MaybeHandle<WasmMemoryObject> WasmMemoryObject::New(
       has_maximum ? std::min(engine_maximum, maximum) : engine_maximum;
 #endif
 
-  auto backing_store = BackingStore::AllocateWasmMemory(
-      isolate, initial, heuristic_maximum, memory_type, shared);
+  std::unique_ptr<BackingStore> backing_store =
+      BackingStore::AllocateWasmMemory(isolate, initial, heuristic_maximum,
+                                       memory_type, shared);
 
   if (!backing_store) return {};
 
   Handle<JSArrayBuffer> buffer =
-      (shared == SharedFlag::kShared)
+      shared == SharedFlag::kShared
           ? isolate->factory()->NewJSSharedArrayBuffer(std::move(backing_store))
           : isolate->factory()->NewJSArrayBuffer(std::move(backing_store));
 
-  return New(isolate, buffer, maximum);
+  return New(isolate, buffer, maximum, memory_type);
 }
 
-void WasmMemoryObject::AddInstance(Isolate* isolate,
-                                   Handle<WasmMemoryObject> memory,
-                                   Handle<WasmInstanceObject> instance) {
+void WasmMemoryObject::UseInInstance(Isolate* isolate,
+                                     Handle<WasmMemoryObject> memory,
+                                     Handle<WasmInstanceObject> instance,
+                                     int memory_index_in_instance) {
+  SetInstanceMemory(*instance, memory->array_buffer(),
+                    memory_index_in_instance);
   Handle<WeakArrayList> old_instances =
       memory->has_instances()
           ? Handle<WeakArrayList>(memory->instances(), isolate)
-          : handle(ReadOnlyRoots(isolate->heap()).empty_weak_array_list(),
-                   isolate);
+          : isolate->factory()->empty_weak_array_list();
   Handle<WeakArrayList> new_instances = WeakArrayList::Append(
       isolate, old_instances, MaybeObjectHandle::Weak(instance));
   memory->set_instances(*new_instances);
-  Handle<JSArrayBuffer> buffer(memory->array_buffer(), isolate);
-  SetInstanceMemory(instance, buffer);
 }
 
-void WasmMemoryObject::update_instances(Isolate* isolate,
-                                        Handle<JSArrayBuffer> buffer) {
+void WasmMemoryObject::SetNewBuffer(Tagged<JSArrayBuffer> new_buffer) {
+  DisallowGarbageCollection no_gc;
+  set_array_buffer(new_buffer);
   if (has_instances()) {
-    Handle<WeakArrayList> instances(this->instances(), isolate);
-    for (int i = 0; i < instances->length(); i++) {
+    Tagged<WeakArrayList> instances = this->instances();
+    for (int i = 0, len = instances->length(); i < len; ++i) {
       MaybeObject elem = instances->Get(i);
-      HeapObject heap_object;
-      if (elem->GetHeapObjectIfWeak(&heap_object)) {
-        Handle<WasmInstanceObject> instance(
-            WasmInstanceObject::cast(heap_object), isolate);
-        SetInstanceMemory(instance, buffer);
-      } else {
-        DCHECK(elem->IsCleared());
+      if (elem->IsCleared()) continue;
+      Tagged<WasmInstanceObject> instance =
+          WasmInstanceObject::cast(elem.GetHeapObjectAssumeWeak());
+      // TODO(clemens): Avoid the iteration by also remembering the memory index
+      // if we ever see larger numbers of memories.
+      Tagged<FixedArray> memory_objects = instance->memory_objects();
+      int num_memories = memory_objects->length();
+      for (int mem_idx = 0; mem_idx < num_memories; ++mem_idx) {
+        if (memory_objects->get(mem_idx) == *this) {
+          SetInstanceMemory(instance, new_buffer, mem_idx);
+        }
       }
     }
   }
-  set_array_buffer(*buffer);
 }
 
 // static
@@ -871,9 +885,6 @@ int32_t WasmMemoryObject::Grow(Isolate* isolate,
                                uint32_t pages) {
   TRACE_EVENT0("v8.wasm", "wasm.GrowMemory");
   Handle<JSArrayBuffer> old_buffer(memory_object->array_buffer(), isolate);
-  // Any buffer used as an asmjs memory cannot be detached, and
-  // therefore this memory cannot be grown.
-  if (old_buffer->is_asmjs_memory()) return -1;
 
   std::shared_ptr<BackingStore> backing_store = old_buffer->GetBackingStore();
   if (!backing_store) return -1;
@@ -909,7 +920,7 @@ int32_t WasmMemoryObject::Grow(Isolate* isolate,
       return -1;
     }
 
-    BackingStore::BroadcastSharedWasmMemoryGrow(isolate, backing_store);
+    backing_store->BroadcastSharedWasmMemoryGrow(isolate);
     // Broadcasting the update should update this memory object too.
     CHECK_NE(*old_buffer, memory_object->array_buffer());
     size_t new_pages = result_inplace.value() + pages;
@@ -920,7 +931,7 @@ int32_t WasmMemoryObject::Grow(Isolate* isolate,
     // grow the same memory object can come in from different workers.
     // It is also possible that a call to Grow was in progress when
     // handling this call.
-    CHECK_LE(new_byte_length, memory_object->array_buffer().byte_length());
+    CHECK_LE(new_byte_length, memory_object->array_buffer()->byte_length());
     // As {old_pages} was read racefully, we return here the synchronized
     // value provided by {GrowWasmMemoryInPlace}, to provide the atomic
     // read-modify-write behavior required by the spec.
@@ -933,7 +944,7 @@ int32_t WasmMemoryObject::Grow(Isolate* isolate,
     JSArrayBuffer::Detach(old_buffer, true).Check();
     Handle<JSArrayBuffer> new_buffer =
         isolate->factory()->NewJSArrayBuffer(std::move(backing_store));
-    memory_object->update_instances(isolate, new_buffer);
+    memory_object->SetNewBuffer(*new_buffer);
     // For debugging purposes we memorize a link from the JSArrayBuffer
     // to it's owning WasmMemoryObject instance.
     Handle<Symbol> symbol =
@@ -973,7 +984,7 @@ int32_t WasmMemoryObject::Grow(Isolate* isolate,
   JSArrayBuffer::Detach(old_buffer, true).Check();
   Handle<JSArrayBuffer> new_buffer =
       isolate->factory()->NewJSArrayBuffer(std::move(new_backing_store));
-  memory_object->update_instances(isolate, new_buffer);
+  memory_object->SetNewBuffer(*new_buffer);
   // For debugging purposes we memorize a link from the JSArrayBuffer
   // to it's owning WasmMemoryObject instance.
   Handle<Symbol> symbol = isolate->factory()->array_buffer_wasm_memory_symbol();
@@ -1034,7 +1045,7 @@ MaybeHandle<WasmGlobalObject> WasmGlobalObject::New(
 
 FunctionTargetAndRef::FunctionTargetAndRef(
     Handle<WasmInstanceObject> target_instance, int target_func_index) {
-  Isolate* isolate = target_instance->native_context().GetIsolate();
+  Isolate* isolate = target_instance->native_context()->GetIsolate();
   if (target_func_index <
       static_cast<int>(target_instance->module()->num_imported_functions)) {
     // The function in the target instance was imported. Use its imports table,
@@ -1049,60 +1060,90 @@ FunctionTargetAndRef::FunctionTargetAndRef(
   }
 }
 
+void ImportedFunctionEntry::SetWasmToJs(Isolate* isolate,
+                                        Handle<JSReceiver> callable,
+                                        wasm::Suspend suspend,
+                                        const wasm::FunctionSig* sig) {
+  DCHECK(UseGenericWasmToJSWrapper(wasm::kDefaultImportCallKind, sig, suspend));
+  Address wrapper = isolate->builtins()
+                        ->code(Builtin::kWasmToJsWrapperAsm)
+                        ->instruction_start();
+  TRACE_IFT("Import callable 0x%" PRIxPTR "[%d] = {callable=0x%" PRIxPTR
+            ", target=0x%" PRIxPTR "}\n",
+            instance_->ptr(), index_, callable->ptr(), wrapper);
+  Handle<WasmApiFunctionRef> ref = isolate->factory()->NewWasmApiFunctionRef(
+      callable, suspend, instance_,
+      wasm::SerializedSignatureHelper::SerializeSignature(isolate, sig));
+  WasmApiFunctionRef::SetImportIndexAsCallOrigin(ref, index_);
+  instance_->imported_function_refs()->set(index_, *ref);
+  instance_->imported_function_targets()->set(index_, wrapper);
+}
+
 void ImportedFunctionEntry::SetWasmToJs(
     Isolate* isolate, Handle<JSReceiver> callable,
-    const wasm::WasmCode* wasm_to_js_wrapper, wasm::Suspend suspend) {
+    const wasm::WasmCode* wasm_to_js_wrapper, wasm::Suspend suspend,
+    const wasm::FunctionSig* sig) {
   TRACE_IFT("Import callable 0x%" PRIxPTR "[%d] = {callable=0x%" PRIxPTR
             ", target=%p}\n",
             instance_->ptr(), index_, callable->ptr(),
             wasm_to_js_wrapper->instructions().begin());
   DCHECK(wasm_to_js_wrapper->kind() == wasm::WasmCode::kWasmToJsWrapper ||
          wasm_to_js_wrapper->kind() == wasm::WasmCode::kWasmToCapiWrapper);
-  Handle<WasmApiFunctionRef> ref =
-      isolate->factory()->NewWasmApiFunctionRef(callable, suspend, instance_);
-  instance_->imported_function_refs().set(index_, *ref);
-  instance_->imported_function_targets().set(
+  Handle<WasmApiFunctionRef> ref = isolate->factory()->NewWasmApiFunctionRef(
+      callable, suspend, instance_,
+      wasm::SerializedSignatureHelper::SerializeSignature(isolate, sig));
+  // The wasm-to-js wrapper is already optimized, the call_origin should never
+  // be accessed.
+  ref->set_call_origin(Smi::FromInt(WasmApiFunctionRef::kInvalidCallOrigin));
+  instance_->imported_function_refs()->set(index_, *ref);
+  instance_->imported_function_targets()->set(
       index_, wasm_to_js_wrapper->instruction_start());
 }
 
-void ImportedFunctionEntry::SetWasmToWasm(WasmInstanceObject instance,
+void ImportedFunctionEntry::SetWasmToWasm(Tagged<WasmInstanceObject> instance,
                                           Address call_target) {
   TRACE_IFT("Import Wasm 0x%" PRIxPTR "[%d] = {instance=0x%" PRIxPTR
             ", target=0x%" PRIxPTR "}\n",
             instance_->ptr(), index_, instance.ptr(), call_target);
-  instance_->imported_function_refs().set(index_, instance);
-  instance_->imported_function_targets().set(index_, call_target);
+  instance_->imported_function_refs()->set(index_, instance);
+  instance_->imported_function_targets()->set(index_, call_target);
 }
 
 // Returns an empty Object() if no callable is available, a JSReceiver
 // otherwise.
-Object ImportedFunctionEntry::maybe_callable() {
-  Object value = object_ref();
-  if (!value.IsWasmApiFunctionRef()) return Object();
-  return JSReceiver::cast(WasmApiFunctionRef::cast(value).callable());
+Tagged<Object> ImportedFunctionEntry::maybe_callable() {
+  Tagged<Object> value = object_ref();
+  if (!IsWasmApiFunctionRef(value)) return Object();
+  return JSReceiver::cast(WasmApiFunctionRef::cast(value)->callable());
 }
 
-JSReceiver ImportedFunctionEntry::callable() {
-  return JSReceiver::cast(WasmApiFunctionRef::cast(object_ref()).callable());
+Tagged<JSReceiver> ImportedFunctionEntry::callable() {
+  return JSReceiver::cast(WasmApiFunctionRef::cast(object_ref())->callable());
 }
 
-Object ImportedFunctionEntry::object_ref() {
-  return instance_->imported_function_refs().get(index_);
+Tagged<Object> ImportedFunctionEntry::object_ref() {
+  return instance_->imported_function_refs()->get(index_);
 }
 
 Address ImportedFunctionEntry::target() {
-  return instance_->imported_function_targets().get(index_);
+  return instance_->imported_function_targets()->get(index_);
+}
+
+void ImportedFunctionEntry::set_target(Address new_target) {
+  instance_->imported_function_targets()->set(index_, new_target);
 }
 
 // static
-constexpr uint16_t WasmInstanceObject::kTaggedFieldOffsets[];
+constexpr std::array<uint16_t, 24> WasmInstanceObject::kTaggedFieldOffsets;
+// static
+constexpr std::array<const char*, 24> WasmInstanceObject::kTaggedFieldNames;
 
 // static
 bool WasmInstanceObject::EnsureIndirectFunctionTableWithMinimumSize(
     Handle<WasmInstanceObject> instance, int table_index,
     uint32_t minimum_size) {
   Isolate* isolate = instance->GetIsolate();
-  DCHECK_LT(table_index, instance->indirect_function_tables().length());
+  DCHECK_LT(table_index, instance->indirect_function_tables()->length());
   Handle<WasmIndirectFunctionTable> table =
       instance->GetIndirectFunctionTable(isolate, table_index);
   WasmIndirectFunctionTable::Resize(isolate, table, minimum_size);
@@ -1112,113 +1153,159 @@ bool WasmInstanceObject::EnsureIndirectFunctionTableWithMinimumSize(
   return true;
 }
 
-void WasmInstanceObject::SetRawMemory(byte* mem_start, size_t mem_size) {
-  CHECK_LE(mem_size, module()->is_memory64 ? wasm::max_mem64_bytes()
-                                           : wasm::max_mem32_bytes());
-  set_memory_start(mem_start);
-  set_memory_size(mem_size);
+void WasmInstanceObject::SetRawMemory(int memory_index, uint8_t* mem_start,
+                                      size_t mem_size) {
+  CHECK_LE(memory_index, module()->memories.size());
+
+  CHECK_LE(mem_size, module()->memories[memory_index].is_memory64
+                         ? wasm::max_mem64_bytes()
+                         : wasm::max_mem32_bytes());
+  // All memory bases and sizes are stored in a FixedAddressArray.
+  Tagged<FixedAddressArray> bases_and_sizes = memory_bases_and_sizes();
+  bases_and_sizes->set_sandboxed_pointer(memory_index * 2,
+                                         reinterpret_cast<Address>(mem_start));
+  bases_and_sizes->set(memory_index * 2 + 1, mem_size);
+  // Memory 0 has fast-access fields.
+  if (memory_index == 0) {
+    set_memory0_start(mem_start);
+    set_memory0_size(mem_size);
+  }
 }
 
 const WasmModule* WasmInstanceObject::module() {
-  return module_object().module();
+  return module_object()->module();
 }
 
 Handle<WasmInstanceObject> WasmInstanceObject::New(
     Isolate* isolate, Handle<WasmModuleObject> module_object) {
-  Handle<JSFunction> instance_cons(
-      isolate->native_context()->wasm_instance_constructor(), isolate);
-  Handle<JSObject> instance_object =
-      isolate->factory()->NewJSObject(instance_cons, AllocationType::kOld);
-
-  Handle<WasmInstanceObject> instance(
-      WasmInstanceObject::cast(*instance_object), isolate);
-  instance->clear_padding();
-
-  auto module = module_object->module();
+  // Do first allocate all objects that will be stored in instance fields,
+  // because otherwise we would have to allocate when the instance is not fully
+  // initialized yet, which can lead to heap verification errors.
+  const WasmModule* module = module_object->module();
 
-  auto num_imported_functions = module->num_imported_functions;
+  int num_imported_functions = module->num_imported_functions;
   Handle<FixedAddressArray> imported_function_targets =
       FixedAddressArray::New(isolate, num_imported_functions);
-  instance->set_imported_function_targets(*imported_function_targets);
+  Handle<FixedArray> imported_function_refs =
+      isolate->factory()->NewFixedArray(num_imported_functions);
+  Handle<FixedArray> well_known_imports =
+      isolate->factory()->NewFixedArray(num_imported_functions);
+
+  Handle<FixedArray> functions = isolate->factory()->NewFixedArrayWithZeroes(
+      static_cast<int>(module->functions.size()));
 
   int num_imported_mutable_globals = module->num_imported_mutable_globals;
   // The imported_mutable_globals is essentially a FixedAddressArray (storing
   // sandboxed pointers), but some entries (the indices for reference-type
   // globals) are accessed as 32-bit integers which is more convenient with a
   // raw ByteArray.
-  Handle<ByteArray> imported_mutable_globals =
+  Handle<FixedAddressArray> imported_mutable_globals =
       FixedAddressArray::New(isolate, num_imported_mutable_globals);
-  instance->set_imported_mutable_globals(*imported_mutable_globals);
 
   int num_data_segments = module->num_declared_data_segments;
   Handle<FixedAddressArray> data_segment_starts =
       FixedAddressArray::New(isolate, num_data_segments);
-  instance->set_data_segment_starts(*data_segment_starts);
-
   Handle<FixedUInt32Array> data_segment_sizes =
       FixedUInt32Array::New(isolate, num_data_segments);
-  instance->set_data_segment_sizes(*data_segment_sizes);
 
-  instance->set_element_segments(*isolate->factory()->empty_fixed_array());
+  static_assert(wasm::kV8MaxWasmMemories < kMaxInt / 2);
+  int num_memories = static_cast<int>(module->memories.size());
+  Handle<FixedArray> memory_objects =
+      isolate->factory()->NewFixedArray(num_memories);
+  Handle<FixedAddressArray> memory_bases_and_sizes =
+      FixedAddressArray::New(isolate, 2 * num_memories);
 
-  Handle<FixedArray> imported_function_refs =
-      isolate->factory()->NewFixedArray(num_imported_functions);
-  instance->set_imported_function_refs(*imported_function_refs);
-
-  instance->set_stack_limit_address(
-      isolate->stack_guard()->address_of_jslimit());
-  instance->set_real_stack_limit_address(
-      isolate->stack_guard()->address_of_real_jslimit());
-  instance->set_new_allocation_limit_address(
-      isolate->heap()->NewSpaceAllocationLimitAddress());
-  instance->set_new_allocation_top_address(
-      isolate->heap()->NewSpaceAllocationTopAddress());
-  instance->set_old_allocation_limit_address(
-      isolate->heap()->OldSpaceAllocationLimitAddress());
-  instance->set_old_allocation_top_address(
-      isolate->heap()->OldSpaceAllocationTopAddress());
-  instance->set_globals_start(
-      reinterpret_cast<byte*>(EmptyBackingStoreBuffer()));
-  instance->set_indirect_function_table_size(0);
-  instance->set_indirect_function_table_refs(
-      ReadOnlyRoots(isolate).empty_fixed_array());
-  instance->set_indirect_function_table_sig_ids(nullptr);
-  instance->set_indirect_function_table_targets(nullptr);
-  instance->set_native_context(*isolate->native_context());
-  instance->set_module_object(*module_object);
-  instance->set_jump_table_start(
-      module_object->native_module()->jump_table_start());
-  instance->set_hook_on_function_call_address(
-      isolate->debug()->hook_on_function_call_address());
-  instance->set_managed_object_maps(*isolate->factory()->empty_fixed_array());
-  Handle<FixedArray> functions = isolate->factory()->NewFixedArrayWithZeroes(
-      static_cast<int>(module->functions.size()));
-  instance->set_wasm_internal_functions(*functions);
-  instance->set_feedback_vectors(*isolate->factory()->empty_fixed_array());
-  instance->set_tiering_budget_array(
-      module_object->native_module()->tiering_budget_array());
-  instance->set_break_on_entry(module_object->script().break_on_entry());
-  instance->SetRawMemory(reinterpret_cast<byte*>(EmptyBackingStoreBuffer()), 0);
+  // Now allocate the instance itself.
+  Handle<JSFunction> instance_cons(
+      isolate->native_context()->wasm_instance_constructor(), isolate);
+  Handle<JSObject> instance_object =
+      isolate->factory()->NewJSObject(instance_cons, AllocationType::kOld);
+
+  // Initialize the instance. During this step, no more allocations should
+  // happen because the instance is incomplete yet, so we should not trigger
+  // heap verification at this point.
+  {
+    DisallowHeapAllocation no_gc;
+
+    // Some constants:
+    uint8_t* empty_backing_store_buffer =
+        reinterpret_cast<uint8_t*>(EmptyBackingStoreBuffer());
+    Tagged<FixedArray> empty_fixed_array =
+        ReadOnlyRoots(isolate).empty_fixed_array();
+    Tagged<ByteArray> empty_byte_array =
+        ReadOnlyRoots(isolate).empty_byte_array();
+    Tagged<ExternalPointerArray> empty_external_pointer_array =
+        ReadOnlyRoots(isolate).empty_external_pointer_array();
+
+    Tagged<WasmInstanceObject> instance =
+        WasmInstanceObject::cast(*instance_object);
+    instance->clear_padding();
+    instance->set_imported_function_targets(*imported_function_targets);
+    instance->set_imported_mutable_globals(*imported_mutable_globals);
+    instance->set_data_segment_starts(*data_segment_starts);
+    instance->set_data_segment_sizes(*data_segment_sizes);
+    instance->set_element_segments(empty_fixed_array);
+    instance->set_imported_function_refs(*imported_function_refs);
+    instance->set_stack_limit_address(
+        isolate->stack_guard()->address_of_jslimit());
+    instance->set_real_stack_limit_address(
+        isolate->stack_guard()->address_of_real_jslimit());
+    instance->set_new_allocation_limit_address(
+        isolate->heap()->NewSpaceAllocationLimitAddress());
+    instance->set_new_allocation_top_address(
+        isolate->heap()->NewSpaceAllocationTopAddress());
+    instance->set_old_allocation_limit_address(
+        isolate->heap()->OldSpaceAllocationLimitAddress());
+    instance->set_old_allocation_top_address(
+        isolate->heap()->OldSpaceAllocationTopAddress());
+    instance->set_globals_start(empty_backing_store_buffer);
+    instance->set_indirect_function_table_size(0);
+    instance->set_indirect_function_table_refs(empty_fixed_array);
+    instance->set_indirect_function_table_sig_ids(
+        FixedUInt32Array::cast(empty_byte_array));
+    instance->set_indirect_function_table_targets(
+        ExternalPointerArray::cast(empty_external_pointer_array));
+    instance->set_native_context(*isolate->native_context());
+    instance->set_module_object(*module_object);
+    instance->set_jump_table_start(
+        module_object->native_module()->jump_table_start());
+    instance->set_hook_on_function_call_address(
+        isolate->debug()->hook_on_function_call_address());
+    instance->set_managed_object_maps(*isolate->factory()->empty_fixed_array());
+    instance->set_well_known_imports(*well_known_imports);
+    instance->set_wasm_internal_functions(*functions);
+    instance->set_feedback_vectors(*isolate->factory()->empty_fixed_array());
+    instance->set_tiering_budget_array(
+        module_object->native_module()->tiering_budget_array());
+    instance->set_break_on_entry(module_object->script()->break_on_entry());
+    instance->InitDataSegmentArrays(*module_object);
+    instance->set_memory0_start(empty_backing_store_buffer);
+    instance->set_memory0_size(0);
+    instance->set_memory_objects(*memory_objects);
+    instance->set_memory_bases_and_sizes(*memory_bases_and_sizes);
+
+    for (int i = 0; i < num_memories; ++i) {
+      memory_bases_and_sizes->set_sandboxed_pointer(
+          2 * i, reinterpret_cast<Address>(empty_backing_store_buffer));
+      memory_bases_and_sizes->set(2 * i + 1, 0);
+    }
+  }
 
   // Insert the new instance into the scripts weak list of instances. This list
   // is used for breakpoints affecting all instances belonging to the script.
-  if (module_object->script().type() == Script::TYPE_WASM) {
+  if (module_object->script()->type() == Script::Type::kWasm) {
     Handle<WeakArrayList> weak_instance_list(
-        module_object->script().wasm_weak_instance_list(), isolate);
+        module_object->script()->wasm_weak_instance_list(), isolate);
     weak_instance_list = WeakArrayList::Append(
-        isolate, weak_instance_list, MaybeObjectHandle::Weak(instance));
-    module_object->script().set_wasm_weak_instance_list(*weak_instance_list);
+        isolate, weak_instance_list, MaybeObjectHandle::Weak(instance_object));
+    module_object->script()->set_wasm_weak_instance_list(*weak_instance_list);
   }
 
-  InitDataSegmentArrays(instance, module_object);
-
-  return instance;
+  return Handle<WasmInstanceObject>::cast(instance_object);
 }
 
-// static
 void WasmInstanceObject::InitDataSegmentArrays(
-    Handle<WasmInstanceObject> instance,
-    Handle<WasmModuleObject> module_object) {
+    Tagged<WasmModuleObject> module_object) {
   auto module = module_object->module();
   auto wire_bytes = module_object->native_module()->wire_bytes();
   auto num_data_segments = module->num_declared_data_segments;
@@ -1234,20 +1321,20 @@ void WasmInstanceObject::InitDataSegmentArrays(
     // Initialize the pointer and size of passive segments.
     auto source_bytes = wire_bytes.SubVector(segment.source.offset(),
                                              segment.source.end_offset());
-    instance->data_segment_starts().set(
-        i, reinterpret_cast<Address>(source_bytes.begin()));
+    data_segment_starts()->set(i,
+                               reinterpret_cast<Address>(source_bytes.begin()));
     // Set the active segments to being already dropped, since memory.init on
     // a dropped passive segment and an active segment have the same
     // behavior.
-    instance->data_segment_sizes().set(
-        static_cast<int>(i), segment.active ? 0 : source_bytes.length());
+    data_segment_sizes()->set(static_cast<int>(i),
+                              segment.active ? 0 : source_bytes.length());
   }
 }
 
 Address WasmInstanceObject::GetCallTarget(uint32_t func_index) {
-  wasm::NativeModule* native_module = module_object().native_module();
+  wasm::NativeModule* native_module = module_object()->native_module();
   if (func_index < native_module->num_imported_functions()) {
-    return imported_function_targets().get(func_index);
+    return imported_function_targets()->get(func_index);
   }
   return jump_table_start() +
          JumpTableOffset(native_module->module(), func_index);
@@ -1255,15 +1342,15 @@ Address WasmInstanceObject::GetCallTarget(uint32_t func_index) {
 
 Handle<WasmIndirectFunctionTable> WasmInstanceObject::GetIndirectFunctionTable(
     Isolate* isolate, uint32_t table_index) {
-  DCHECK_LT(table_index, indirect_function_tables().length());
+  DCHECK_LT(table_index, indirect_function_tables()->length());
   return handle(WasmIndirectFunctionTable::cast(
-                    indirect_function_tables().get(table_index)),
+                    indirect_function_tables()->get(table_index)),
                 isolate);
 }
 
 void WasmInstanceObject::SetIndirectFunctionTableShortcuts(Isolate* isolate) {
-  if (indirect_function_tables().length() > 0 &&
-      indirect_function_tables().get(0).IsWasmIndirectFunctionTable()) {
+  if (indirect_function_tables()->length() > 0 &&
+      IsWasmIndirectFunctionTable(indirect_function_tables()->get(0))) {
     HandleScope scope(isolate);
     Handle<WasmIndirectFunctionTable> table0 =
         GetIndirectFunctionTable(isolate, 0);
@@ -1281,12 +1368,12 @@ bool WasmInstanceObject::CopyTableEntries(Isolate* isolate,
                                           uint32_t table_src_index,
                                           uint32_t dst, uint32_t src,
                                           uint32_t count) {
-  CHECK_LT(table_dst_index, instance->tables().length());
-  CHECK_LT(table_src_index, instance->tables().length());
+  CHECK_LT(table_dst_index, instance->tables()->length());
+  CHECK_LT(table_src_index, instance->tables()->length());
   auto table_dst = handle(
-      WasmTableObject::cast(instance->tables().get(table_dst_index)), isolate);
+      WasmTableObject::cast(instance->tables()->get(table_dst_index)), isolate);
   auto table_src = handle(
-      WasmTableObject::cast(instance->tables().get(table_src_index)), isolate);
+      WasmTableObject::cast(instance->tables()->get(table_src_index)), isolate);
   uint32_t max_dst = table_dst->current_length();
   uint32_t max_src = table_src->current_length();
   bool copy_backward = src < dst;
@@ -1320,7 +1407,7 @@ base::Optional<MessageTemplate> WasmInstanceObject::InitTableEntries(
   Zone zone(&allocator, "LoadElemSegment");
 
   Handle<WasmTableObject> table_object = handle(
-      WasmTableObject::cast(instance->tables().get(table_index)), isolate);
+      WasmTableObject::cast(instance->tables()->get(table_index)), isolate);
 
   // If needed, try to lazily initialize the element segment.
   base::Optional<MessageTemplate> opt_error =
@@ -1328,7 +1415,7 @@ base::Optional<MessageTemplate> WasmInstanceObject::InitTableEntries(
   if (opt_error.has_value()) return opt_error;
 
   Handle<FixedArray> elem_segment =
-      handle(FixedArray::cast(instance->element_segments().get(segment_index)),
+      handle(FixedArray::cast(instance->element_segments()->get(segment_index)),
              isolate);
   if (!base::IsInBounds<uint64_t>(dst, count, table_object->current_length())) {
     return {MessageTemplate::kWasmTrapTableOutOfBounds};
@@ -1348,8 +1435,8 @@ base::Optional<MessageTemplate> WasmInstanceObject::InitTableEntries(
 
 MaybeHandle<WasmInternalFunction> WasmInstanceObject::GetWasmInternalFunction(
     Isolate* isolate, Handle<WasmInstanceObject> instance, int index) {
-  Object val = instance->wasm_internal_functions().get(index);
-  if (val.IsSmi()) return {};
+  Tagged<Object> val = instance->wasm_internal_functions()->get(index);
+  if (IsSmi(val)) return {};
   return handle(WasmInternalFunction::cast(val), isolate);
 }
 
@@ -1363,20 +1450,86 @@ WasmInstanceObject::GetOrCreateWasmInternalFunction(
     return maybe_result.ToHandleChecked();
   }
 
-  Handle<WasmModuleObject> module_object(instance->module_object(), isolate);
-  const WasmModule* module = module_object->module();
-  const WasmFunction& function = module->functions[function_index];
+  Handle<HeapObject> ref =
+      function_index >=
+              static_cast<int>(instance->module()->num_imported_functions)
+          ? instance
+          : handle(HeapObject::cast(
+                       instance->imported_function_refs()->get(function_index)),
+                   isolate);
+
+  if (v8_flags.wasm_to_js_generic_wrapper && IsWasmApiFunctionRef(*ref)) {
+    Handle<WasmApiFunctionRef> wafr = Handle<WasmApiFunctionRef>::cast(ref);
+    ref = isolate->factory()->NewWasmApiFunctionRef(
+        handle(wafr->callable(), isolate),
+        static_cast<wasm::Suspend>(wafr->suspend()),
+        handle(wafr->instance(), isolate), handle(wafr->sig(), isolate));
+  }
+
+  Handle<Map> rtt;
+  bool has_gc =
+      instance->module_object()->native_module()->enabled_features().has_gc();
+  if (has_gc) {
+    int sig_index = instance->module()->functions[function_index].sig_index;
+    // TODO(14034): Create funcref RTTs lazily?
+    rtt = handle(Map::cast(instance->managed_object_maps()->get(sig_index)),
+                 isolate);
+  } else {
+    rtt = isolate->factory()->wasm_internal_function_map();
+  }
+
+  auto result = isolate->factory()->NewWasmInternalFunction(
+      instance->GetCallTarget(function_index), ref, rtt, function_index);
+
+  if (IsWasmApiFunctionRef(*ref)) {
+    Handle<WasmApiFunctionRef> wafr = Handle<WasmApiFunctionRef>::cast(ref);
+    WasmApiFunctionRef::SetInternalFunctionAsCallOrigin(wafr, result);
+    wafr->set_call_origin(*result);
+  }
+  WasmInstanceObject::SetWasmInternalFunction(instance, function_index, result);
+  return result;
+}
+
+void WasmInstanceObject::SetWasmInternalFunction(
+    Handle<WasmInstanceObject> instance, int index,
+    Handle<WasmInternalFunction> val) {
+  instance->wasm_internal_functions()->set(index, *val);
+}
+
+// static
+Handle<JSFunction> WasmInternalFunction::GetOrCreateExternal(
+    Handle<WasmInternalFunction> internal) {
+  Isolate* isolate = GetIsolateFromWritableObject(*internal);
+  if (!IsUndefined(internal->external())) {
+    return handle(JSFunction::cast(internal->external()), isolate);
+  }
+
+  // {this} can either be:
+  // - a declared function, i.e. {ref()} is an instance,
+  // - or an imported callable, i.e. {ref()} is a WasmApiFunctionRef which
+  //   refers to the imported instance.
+  // It cannot be a JS/C API function as for those, the external function is set
+  // at creation.
+  Handle<WasmInstanceObject> instance =
+      handle(IsWasmInstanceObject(internal->ref())
+                 ? WasmInstanceObject::cast(internal->ref())
+                 : WasmInstanceObject::cast(
+                       WasmApiFunctionRef::cast(internal->ref())->instance()),
+             isolate);
+  const WasmModule* module = instance->module();
+  const WasmFunction& function = module->functions[internal->function_index()];
   uint32_t canonical_sig_index =
       module->isorecursive_canonical_type_ids[function.sig_index];
   isolate->heap()->EnsureWasmCanonicalRttsSize(canonical_sig_index + 1);
   int wrapper_index =
       wasm::GetExportWrapperIndex(canonical_sig_index, function.imported);
 
-  MaybeObject entry = isolate->heap()->js_to_wasm_wrappers().Get(wrapper_index);
+  MaybeObject entry =
+      isolate->heap()->js_to_wasm_wrappers()->Get(wrapper_index);
 
   Handle<Code> wrapper;
   // {entry} can be cleared, {undefined}, or a ready {Code}.
-  if (entry.IsStrongOrWeak() && entry.GetHeapObject().IsCode()) {
+  if (entry.IsStrongOrWeak() && IsCode(entry.GetHeapObject())) {
     wrapper = handle(Code::cast(entry.GetHeapObject()), isolate);
   } else {
     // The wrapper may not exist yet if no function in the exports section has
@@ -1386,24 +1539,70 @@ WasmInstanceObject::GetOrCreateWasmInternalFunction(
         isolate, function.sig, canonical_sig_index, instance->module(),
         function.imported);
   }
-  // Store the wrapper in the isolate, or make its reference weak now that we
-  // have a function referencing it.
-  isolate->heap()->js_to_wasm_wrappers().Set(
-      wrapper_index, HeapObjectReference::Weak(*wrapper));
-  auto external = Handle<WasmExternalFunction>::cast(WasmExportedFunction::New(
-      isolate, instance, function_index,
-      static_cast<int>(function.sig->parameter_count()), wrapper));
-  Handle<WasmInternalFunction> result =
-      WasmInternalFunction::FromExternal(external, isolate).ToHandleChecked();
+  if (!wrapper->is_builtin()) {
+    // Store the wrapper in the isolate, or make its reference weak now that we
+    // have a function referencing it.
+    isolate->heap()->js_to_wasm_wrappers()->Set(
+        wrapper_index, HeapObjectReference::Weak(*wrapper));
+  }
+  auto result = WasmExportedFunction::New(
+      isolate, instance, internal, internal->function_index(),
+      static_cast<int>(function.sig->parameter_count()), wrapper);
 
-  WasmInstanceObject::SetWasmInternalFunction(instance, function_index, result);
+  internal->set_external(*result);
   return result;
 }
 
-void WasmInstanceObject::SetWasmInternalFunction(
-    Handle<WasmInstanceObject> instance, int index,
-    Handle<WasmInternalFunction> val) {
-  instance->wasm_internal_functions().set(index, *val);
+Tagged<HeapObject> WasmInternalFunction::external() {
+  return this->TorqueGeneratedWasmInternalFunction::external();
+}
+
+// static
+void WasmApiFunctionRef::SetImportIndexAsCallOrigin(
+    Handle<WasmApiFunctionRef> ref, int entry_index) {
+  ref->set_call_origin(Smi::FromInt(-entry_index - 1));
+}
+
+// static
+void WasmApiFunctionRef::SetIndexInTableAsCallOrigin(
+    Handle<WasmApiFunctionRef> ref, int entry_index) {
+  ref->set_call_origin(Smi::FromInt(entry_index + 1));
+}
+
+// static
+bool WasmApiFunctionRef::CallOriginIsImportIndex(Handle<Object> call_origin) {
+  return Smi::cast(*call_origin).value() < 0;
+}
+
+// static
+bool WasmApiFunctionRef::CallOriginIsIndexInTable(Handle<Object> call_origin) {
+  return Smi::cast(*call_origin).value() > 0;
+}
+
+// static
+int WasmApiFunctionRef::CallOriginAsIndex(Handle<Object> call_origin) {
+  int raw_index = Smi::cast(*call_origin).value();
+  CHECK_NE(raw_index, kInvalidCallOrigin);
+  if (raw_index < 0) {
+    raw_index = -raw_index;
+  }
+  return raw_index - 1;
+}
+
+// static
+void WasmApiFunctionRef::SetCrossInstanceTableIndexAsCallOrigin(
+    Isolate* isolate, Handle<WasmApiFunctionRef> ref,
+    Handle<WasmInstanceObject> instance, int entry_index) {
+  Handle<Tuple2> tuple = isolate->factory()->NewTuple2(
+      instance, handle(Smi::FromInt(entry_index + 1), isolate),
+      AllocationType::kOld);
+  ref->set_call_origin(*tuple);
+}
+
+// static
+void WasmApiFunctionRef::SetInternalFunctionAsCallOrigin(
+    Handle<WasmApiFunctionRef> ref, Handle<WasmInternalFunction> internal) {
+  ref->set_call_origin(*internal);
 }
 
 // static
@@ -1424,10 +1623,9 @@ void WasmInstanceObject::ImportWasmJSFunctionIntoTable(
   Handle<JSReceiver> callable(js_function->GetCallable(), isolate);
   wasm::Suspend suspend = js_function->GetSuspend();
   wasm::WasmCodeRefScope code_ref_scope;
-  Address call_target = kNullAddress;
 
-  auto module_canonical_ids =
-      instance->module()->isorecursive_canonical_type_ids;
+  const wasm::WasmModule* module = instance->module();
+  auto module_canonical_ids = module->isorecursive_canonical_type_ids;
   // TODO(manoskouk): Consider adding a set of canonical indices to the module
   // to avoid this linear search.
   auto sig_in_module =
@@ -1436,45 +1634,72 @@ void WasmInstanceObject::ImportWasmJSFunctionIntoTable(
 
   if (sig_in_module != module_canonical_ids.end()) {
     wasm::NativeModule* native_module =
-        instance->module_object().native_module();
-    wasm::WasmImportData resolved(callable, sig, canonical_sig_index);
+        instance->module_object()->native_module();
+    wasm::WasmImportData resolved({}, -1, callable, sig, canonical_sig_index);
     wasm::ImportCallKind kind = resolved.kind();
     callable = resolved.callable();  // Update to ultimate target.
     DCHECK_NE(wasm::ImportCallKind::kLinkError, kind);
-    wasm::CompilationEnv env = native_module->CreateCompilationEnv();
     // {expected_arity} should only be used if kind != kJSFunctionArityMismatch.
     int expected_arity = -1;
     if (kind == wasm::ImportCallKind ::kJSFunctionArityMismatch) {
       expected_arity = Handle<JSFunction>::cast(callable)
                            ->shared()
-                           .internal_formal_parameter_count_without_receiver();
+                           ->internal_formal_parameter_count_without_receiver();
     }
-    // TODO(manoskouk): Reuse js_function->wasm_to_js_wrapper_code().
-    wasm::WasmCompilationResult result = compiler::CompileWasmImportCallWrapper(
-        &env, kind, sig, false, expected_arity, suspend);
-    wasm::CodeSpaceWriteScope write_scope(native_module);
-    std::unique_ptr<wasm::WasmCode> wasm_code = native_module->AddCode(
-        result.func_index, result.code_desc, result.frame_slot_count,
-        result.tagged_parameter_slots,
-        result.protected_instructions_data.as_vector(),
-        result.source_positions.as_vector(), GetCodeKind(result),
-        wasm::ExecutionTier::kNone, wasm::kNotForDebugging);
-    wasm::WasmCode* published_code =
-        native_module->PublishCode(std::move(wasm_code));
-    isolate->counters()->wasm_generated_code_size()->Increment(
-        published_code->instructions().length());
-    isolate->counters()->wasm_reloc_size()->Increment(
-        published_code->reloc_info().length());
-    call_target = published_code->instruction_start();
-  }
-
-  // Update the dispatch table.
-  Handle<WasmApiFunctionRef> ref =
-      isolate->factory()->NewWasmApiFunctionRef(callable, suspend, instance);
 
+    wasm::WasmImportWrapperCache* cache = native_module->import_wrapper_cache();
+    wasm::WasmCode* wasm_code =
+        cache->MaybeGet(kind, canonical_sig_index, expected_arity, suspend);
+    Address call_target;
+    if (wasm_code) {
+      call_target = wasm_code->instruction_start();
+    } else if (UseGenericWasmToJSWrapper(kind, sig, resolved.suspend())) {
+      call_target = isolate->builtins()
+                        ->code(Builtin::kWasmToJsWrapperAsm)
+                        ->instruction_start();
+    } else {
+      wasm::CompilationEnv env = native_module->CreateCompilationEnv();
+      wasm::WasmCompilationResult result =
+          compiler::CompileWasmImportCallWrapper(&env, kind, sig, false,
+                                                 expected_arity, suspend);
+      std::unique_ptr<wasm::WasmCode> compiled_code = native_module->AddCode(
+          result.func_index, result.code_desc, result.frame_slot_count,
+          result.tagged_parameter_slots,
+          result.protected_instructions_data.as_vector(),
+          result.source_positions.as_vector(), GetCodeKind(result),
+          wasm::ExecutionTier::kNone, wasm::kNotForDebugging);
+      wasm_code = native_module->PublishCode(std::move(compiled_code));
+      isolate->counters()->wasm_generated_code_size()->Increment(
+          wasm_code->instructions().length());
+      isolate->counters()->wasm_reloc_size()->Increment(
+          wasm_code->reloc_info().length());
+
+      wasm::WasmImportWrapperCache::ModificationScope cache_scope(cache);
+      wasm::WasmImportWrapperCache::CacheKey key(kind, canonical_sig_index,
+                                                 expected_arity, suspend);
+      cache_scope[key] = wasm_code;
+      call_target = wasm_code->instruction_start();
+    }
+
+    // Update the dispatch table.
+    int sig_id = static_cast<int>(
+        std::distance(module_canonical_ids.begin(), sig_in_module));
+    Handle<WasmApiFunctionRef> ref = isolate->factory()->NewWasmApiFunctionRef(
+        callable, suspend, instance,
+        wasm::SerializedSignatureHelper::SerializeSignature(
+            isolate, module->signature(sig_id)));
+
+    WasmApiFunctionRef::SetIndexInTableAsCallOrigin(ref, entry_index);
+    WasmIndirectFunctionTable::cast(
+        instance->indirect_function_tables()->get(table_index))
+        ->Set(entry_index, canonical_sig_index, call_target, *ref);
+    return;
+  }
+  // We pass the instance as ref-parameter as a dummy value. It will never be
+  // used because `call_target` == nullptr.
   WasmIndirectFunctionTable::cast(
-      instance->indirect_function_tables().get(table_index))
-      .Set(entry_index, canonical_sig_index, call_target, *ref);
+      instance->indirect_function_tables()->get(table_index))
+      ->Set(entry_index, canonical_sig_index, kNullAddress, *instance);
 }
 
 // static
@@ -1482,9 +1707,9 @@ uint8_t* WasmInstanceObject::GetGlobalStorage(
     Handle<WasmInstanceObject> instance, const wasm::WasmGlobal& global) {
   DCHECK(!global.type.is_reference());
   if (global.mutability && global.imported) {
-    return reinterpret_cast<byte*>(
-        instance->imported_mutable_globals().get_sandboxed_pointer(
-            global.index * kSystemPointerSize));
+    return reinterpret_cast<uint8_t*>(
+        instance->imported_mutable_globals()->get_sandboxed_pointer(
+            global.index));
   } else {
     return instance->globals_start() + global.offset;
   }
@@ -1499,10 +1724,9 @@ WasmInstanceObject::GetGlobalBufferAndIndex(Handle<WasmInstanceObject> instance,
   if (global.mutability && global.imported) {
     Handle<FixedArray> buffer(
         FixedArray::cast(
-            instance->imported_mutable_globals_buffers().get(global.index)),
+            instance->imported_mutable_globals_buffers()->get(global.index)),
         isolate);
-    Address idx = instance->imported_mutable_globals().get_int(
-        global.index * kSystemPointerSize);
+    Address idx = instance->imported_mutable_globals()->get(global.index);
     DCHECK_LE(idx, std::numeric_limits<uint32_t>::max());
     return {buffer, static_cast<uint32_t>(idx)};
   }
@@ -1629,25 +1853,10 @@ bool WasmTagObject::MatchesSignature(uint32_t expected_canonical_type_index) {
 }
 
 const wasm::FunctionSig* WasmCapiFunction::GetSignature(Zone* zone) const {
-  WasmCapiFunctionData function_data = shared().wasm_capi_function_data();
-  PodArray<wasm::ValueType> serialized_sig =
-      function_data.serialized_signature();
-  int sig_size = serialized_sig.length() - 1;
-  wasm::ValueType* types = zone->NewArray<wasm::ValueType>(sig_size);
-  int returns_size = 0;
-  int index = 0;
-  while (serialized_sig.get(index) != wasm::kWasmVoid) {
-    types[index] = serialized_sig.get(index);
-    index++;
-  }
-  returns_size = index;
-  while (index < sig_size) {
-    types[index] = serialized_sig.get(index + 1);
-    index++;
-  }
-
-  return zone->New<wasm::FunctionSig>(returns_size, sig_size - returns_size,
-                                      types);
+  Tagged<WasmCapiFunctionData> function_data =
+      shared()->wasm_capi_function_data();
+  return wasm::SerializedSignatureHelper::DeserializeSignature(
+      zone, function_data->serialized_signature());
 }
 
 bool WasmCapiFunction::MatchesSignature(
@@ -1656,10 +1865,10 @@ bool WasmCapiFunction::MatchesSignature(
   Zone zone(&allocator, ZONE_NAME);
   const wasm::FunctionSig* sig = GetSignature(&zone);
 #if DEBUG
-  // TODO(7748): Change this if indexed types are allowed.
+  // TODO(14034): Change this if indexed types are allowed.
   for (wasm::ValueType type : sig->all()) CHECK(!type.has_index());
 #endif
-  // TODO(7748): Check for subtyping instead if C API functions can define
+  // TODO(14034): Check for subtyping instead if C API functions can define
   // signature supertype.
   return wasm::GetWasmEngine()->type_canonicalizer()->AddRecursiveGroup(sig) ==
          other_canonical_sig_index;
@@ -1711,7 +1920,7 @@ Handle<Object> WasmExceptionPackage::GetExceptionValues(
           isolate, exception_package,
           isolate->factory()->wasm_exception_values_symbol())
           .ToHandle(&values)) {
-    DCHECK_IMPLIES(!values->IsUndefined(), values->IsFixedArray());
+    DCHECK_IMPLIES(!IsUndefined(*values), IsFixedArray(*values));
     return values;
   }
   return ReadOnlyRoots(isolate).undefined_value_handle();
@@ -1766,6 +1975,23 @@ Handle<WasmContinuationObject> WasmContinuationObject::New(
   return result;
 }
 
+bool UseGenericWasmToJSWrapper(wasm::ImportCallKind kind,
+                               const wasm::FunctionSig* sig,
+                               wasm::Suspend suspend) {
+  if (kind != wasm::ImportCallKind::kJSFunctionArityMatch &&
+      kind != wasm::ImportCallKind::kJSFunctionArityMismatch) {
+    return false;
+  }
+#if !V8_TARGET_ARCH_X64 && !V8_TARGET_ARCH_ARM64 && !V8_TARGET_ARCH_ARM && \
+    !V8_TARGET_ARCH_IA32
+  return false;
+#else
+  if (suspend == wasm::kSuspend) return false;
+
+  return v8_flags.wasm_to_js_generic_wrapper;
+#endif
+}
+
 // static
 Handle<WasmContinuationObject> WasmContinuationObject::New(
     Isolate* isolate, std::unique_ptr<wasm::StackMemory> stack,
@@ -1788,8 +2014,10 @@ Handle<WasmContinuationObject> WasmContinuationObject::New(
 Handle<WasmSuspenderObject> WasmSuspenderObject::New(Isolate* isolate) {
   Handle<JSFunction> suspender_cons(
       isolate->native_context()->wasm_suspender_constructor(), isolate);
+  Handle<JSPromise> promise = isolate->factory()->NewJSPromise();
   auto suspender = Handle<WasmSuspenderObject>::cast(
       isolate->factory()->NewJSObject(suspender_cons));
+  suspender->set_promise(*promise);
   suspender->set_state(kInactive);
   // Instantiate the callable object which resumes this Suspender. This will be
   // used implicitly as the onFulfilled callback of the returned JS promise.
@@ -1809,6 +2037,7 @@ Handle<WasmSuspenderObject> WasmSuspenderObject::New(Isolate* isolate) {
       Factory::JSFunctionBuilder{isolate, reject_sfi, context}.Build();
   suspender->set_resume(*resume);
   suspender->set_reject(*reject);
+  suspender->set_wasm_to_js_counter(0);
   return suspender;
 }
 
@@ -1868,22 +2097,22 @@ uint32_t WasmExceptionPackage::GetEncodedSize(const wasm::WasmTagSig* sig) {
   return encoded_size;
 }
 
-bool WasmExportedFunction::IsWasmExportedFunction(Object object) {
-  if (!object.IsJSFunction()) return false;
-  JSFunction js_function = JSFunction::cast(object);
-  Code code = js_function.code();
-  if (CodeKind::JS_TO_WASM_FUNCTION != code.kind() &&
-      code.builtin_id() != Builtin::kGenericJSToWasmWrapper &&
-      code.builtin_id() != Builtin::kWasmReturnPromiseOnSuspend) {
+bool WasmExportedFunction::IsWasmExportedFunction(Tagged<Object> object) {
+  if (!IsJSFunction(object)) return false;
+  Tagged<JSFunction> js_function = JSFunction::cast(object);
+  Tagged<Code> code = js_function->code();
+  if (CodeKind::JS_TO_WASM_FUNCTION != code->kind() &&
+      code->builtin_id() != Builtin::kJSToWasmWrapper &&
+      code->builtin_id() != Builtin::kWasmReturnPromiseOnSuspend) {
     return false;
   }
-  DCHECK(js_function.shared().HasWasmExportedFunctionData());
+  DCHECK(js_function->shared()->HasWasmExportedFunctionData());
   return true;
 }
 
-bool WasmCapiFunction::IsWasmCapiFunction(Object object) {
-  if (!object.IsJSFunction()) return false;
-  JSFunction js_function = JSFunction::cast(object);
+bool WasmCapiFunction::IsWasmCapiFunction(Tagged<Object> object) {
+  if (!IsJSFunction(object)) return false;
+  Tagged<JSFunction> js_function = JSFunction::cast(object);
   // TODO(jkummerow): Enable this when there is a JavaScript wrapper
   // able to call this function.
   // if (js_function->code()->kind() != CodeKind::WASM_TO_CAPI_FUNCTION) {
@@ -1891,7 +2120,7 @@ bool WasmCapiFunction::IsWasmCapiFunction(Object object) {
   // }
   // DCHECK(js_function->shared()->HasWasmCapiFunctionData());
   // return true;
-  return js_function.shared().HasWasmCapiFunctionData();
+  return js_function->shared()->HasWasmCapiFunctionData();
 }
 
 Handle<WasmCapiFunction> WasmCapiFunction::New(
@@ -1915,46 +2144,30 @@ Handle<WasmCapiFunction> WasmCapiFunction::New(
   Handle<JSFunction> result =
       Factory::JSFunctionBuilder{isolate, shared, isolate->native_context()}
           .Build();
-  fun_data->internal().set_external(*result);
+  fun_data->internal()->set_external(*result);
   return Handle<WasmCapiFunction>::cast(result);
 }
 
-WasmInstanceObject WasmExportedFunction::instance() {
-  return shared().wasm_exported_function_data().instance();
+Tagged<WasmInstanceObject> WasmExportedFunction::instance() {
+  return shared()->wasm_exported_function_data()->instance();
 }
 
 int WasmExportedFunction::function_index() {
-  return shared().wasm_exported_function_data().function_index();
+  return shared()->wasm_exported_function_data()->function_index();
 }
 
 Handle<WasmExportedFunction> WasmExportedFunction::New(
-    Isolate* isolate, Handle<WasmInstanceObject> instance, int func_index,
-    int arity, Handle<Code> export_wrapper) {
+    Isolate* isolate, Handle<WasmInstanceObject> instance,
+    Handle<WasmInternalFunction> internal, int func_index, int arity,
+    Handle<Code> export_wrapper) {
   DCHECK(
       CodeKind::JS_TO_WASM_FUNCTION == export_wrapper->kind() ||
       (export_wrapper->is_builtin() &&
-       (export_wrapper->builtin_id() == Builtin::kGenericJSToWasmWrapper ||
+       (export_wrapper->builtin_id() == Builtin::kJSToWasmWrapper ||
         export_wrapper->builtin_id() == Builtin::kWasmReturnPromiseOnSuspend)));
-  int num_imported_functions = instance->module()->num_imported_functions;
-  Handle<Object> ref =
-      func_index >= num_imported_functions
-          ? instance
-          : handle(instance->imported_function_refs().get(func_index), isolate);
-
   Factory* factory = isolate->factory();
   const wasm::FunctionSig* sig = instance->module()->functions[func_index].sig;
-  Address call_target = instance->GetCallTarget(func_index);
   Handle<Map> rtt;
-  bool has_gc =
-      instance->module_object().native_module()->enabled_features().has_gc();
-  if (has_gc) {
-    int sig_index = instance->module()->functions[func_index].sig_index;
-    // TODO(7748): Create funcref RTTs lazily?
-    rtt = handle(Map::cast(instance->managed_object_maps().get(sig_index)),
-                 isolate);
-  } else {
-    rtt = factory->wasm_internal_function_map();
-  }
   wasm::Promise promise =
       export_wrapper->builtin_id() == Builtin::kWasmReturnPromiseOnSuspend
           ? wasm::kPromise
@@ -1964,11 +2177,11 @@ Handle<WasmExportedFunction> WasmExportedFunction::New(
       instance->module()->isorecursive_canonical_type_ids[sig_index];
   Handle<WasmExportedFunctionData> function_data =
       factory->NewWasmExportedFunctionData(
-          export_wrapper, instance, call_target, ref, func_index, sig,
-          canonical_type_index, wasm::kGenericWrapperBudget, rtt, promise);
+          export_wrapper, instance, internal, func_index, sig,
+          canonical_type_index, v8_flags.wasm_wrapper_tiering_budget, promise);
 
   MaybeHandle<String> maybe_name;
-  bool is_asm_js_module = instance->module_object().is_asm_js();
+  bool is_asm_js_module = instance->module_object()->is_asm_js();
   if (is_asm_js_module) {
     // We can use the function name only for asm.js. For WebAssembly, the
     // function name is specified as the function_index.toString().
@@ -2008,26 +2221,26 @@ Handle<WasmExportedFunction> WasmExportedFunction::New(
 
   // According to the spec, exported functions should not have a [[Construct]]
   // method. This does not apply to functions exported from asm.js however.
-  DCHECK_EQ(is_asm_js_module, js_function->IsConstructor());
+  DCHECK_EQ(is_asm_js_module, IsConstructor(*js_function));
   shared->set_length(arity);
   shared->set_internal_formal_parameter_count(JSParameterCount(arity));
-  shared->set_script(instance->module_object().script());
-  function_data->internal().set_external(*js_function);
+  shared->set_script(instance->module_object()->script(), kReleaseStore);
+  function_data->internal()->set_external(*js_function);
   return Handle<WasmExportedFunction>::cast(js_function);
 }
 
 Address WasmExportedFunction::GetWasmCallTarget() {
-  return instance().GetCallTarget(function_index());
+  return instance()->GetCallTarget(function_index());
 }
 
 const wasm::FunctionSig* WasmExportedFunction::sig() {
-  return instance().module()->functions[function_index()].sig;
+  return instance()->module()->functions[function_index()].sig;
 }
 
 bool WasmExportedFunction::MatchesSignature(
     uint32_t other_canonical_type_index) {
   return wasm::GetWasmEngine()->type_canonicalizer()->IsCanonicalSubtype(
-      this->shared().wasm_exported_function_data().canonical_type_index(),
+      this->shared()->wasm_exported_function_data()->canonical_type_index(),
       other_canonical_type_index);
 }
 
@@ -2044,10 +2257,27 @@ std::unique_ptr<char[]> WasmExportedFunction::GetDebugName(
 }
 
 // static
-bool WasmJSFunction::IsWasmJSFunction(Object object) {
-  if (!object.IsJSFunction()) return false;
-  JSFunction js_function = JSFunction::cast(object);
-  return js_function.shared().HasWasmJSFunctionData();
+bool WasmJSFunction::IsWasmJSFunction(Tagged<Object> object) {
+  if (!IsJSFunction(object)) return false;
+  Tagged<JSFunction> js_function = JSFunction::cast(object);
+  return js_function->shared()->HasWasmJSFunctionData();
+}
+
+Handle<Map> CreateFuncRefMap(Isolate* isolate, Handle<Map> opt_rtt_parent,
+                             Handle<WasmInstanceObject> opt_instance) {
+  const int inobject_properties = 0;
+  const int instance_size =
+      Map::cast(isolate->root(RootIndex::kWasmInternalFunctionMap))
+          ->instance_size();
+  const InstanceType instance_type = WASM_INTERNAL_FUNCTION_TYPE;
+  const ElementsKind elements_kind = TERMINAL_FAST_ELEMENTS_KIND;
+  constexpr uint32_t kNoIndex = ~0u;
+  Handle<WasmTypeInfo> type_info = isolate->factory()->NewWasmTypeInfo(
+      kNullAddress, opt_rtt_parent, instance_size, opt_instance, kNoIndex);
+  Handle<Map> map = isolate->factory()->NewMap(
+      instance_type, instance_size, elements_kind, inobject_properties);
+  map->set_wasm_type_info(*type_info);
+  return map;
 }
 
 Handle<WasmJSFunction> WasmJSFunction::New(Isolate* isolate,
@@ -2055,14 +2285,9 @@ Handle<WasmJSFunction> WasmJSFunction::New(Isolate* isolate,
                                            Handle<JSReceiver> callable,
                                            wasm::Suspend suspend) {
   DCHECK_LE(sig->all().size(), kMaxInt);
-  int sig_size = static_cast<int>(sig->all().size());
-  int return_count = static_cast<int>(sig->return_count());
   int parameter_count = static_cast<int>(sig->parameter_count());
   Handle<PodArray<wasm::ValueType>> serialized_sig =
-      PodArray<wasm::ValueType>::New(isolate, sig_size, AllocationType::kOld);
-  if (sig_size > 0) {
-    serialized_sig->copy_in(0, sig->all().begin(), sig_size);
-  }
+      wasm::SerializedSignatureHelper::SerializeSignature(isolate, sig);
   // TODO(wasm): Think about caching and sharing the JS-to-JS wrappers per
   // signature instead of compiling a new one for every instantiation.
   Handle<Code> wrapper_code =
@@ -2073,77 +2298,103 @@ Handle<WasmJSFunction> WasmJSFunction::New(Isolate* isolate,
   // WasmExportedFunction.
   Address call_target = kNullAddress;
   if (WasmExportedFunction::IsWasmExportedFunction(*callable)) {
-    call_target = WasmExportedFunction::cast(*callable).GetWasmCallTarget();
+    call_target = WasmExportedFunction::cast(*callable)->GetWasmCallTarget();
   }
 
   Factory* factory = isolate->factory();
-  Handle<Map> rtt = factory->wasm_internal_function_map();
+
+  Handle<Map> rtt;
+  Handle<NativeContext> context(isolate->native_context());
+
+  if (wasm::WasmFeatures::FromIsolate(isolate).has_gc()) {
+    uint32_t canonical_type_index =
+        wasm::GetWasmEngine()->type_canonicalizer()->AddRecursiveGroup(sig);
+
+    isolate->heap()->EnsureWasmCanonicalRttsSize(canonical_type_index + 1);
+
+    Handle<WeakArrayList> canonical_rtts =
+        handle(isolate->heap()->wasm_canonical_rtts(), isolate);
+
+    MaybeObject maybe_canonical_map = canonical_rtts->Get(canonical_type_index);
+
+    if (maybe_canonical_map.IsStrongOrWeak() &&
+        IsMap(maybe_canonical_map.GetHeapObject())) {
+      rtt = handle(Map::cast(maybe_canonical_map.GetHeapObject()), isolate);
+    } else {
+      rtt = CreateFuncRefMap(isolate, Handle<Map>(),
+                             Handle<WasmInstanceObject>());
+      canonical_rtts->Set(canonical_type_index,
+                          HeapObjectReference::Weak(*rtt));
+    }
+  } else {
+    rtt = factory->wasm_internal_function_map();
+  }
+
   Handle<WasmJSFunctionData> function_data = factory->NewWasmJSFunctionData(
-      call_target, callable, return_count, parameter_count, serialized_sig,
-      wrapper_code, rtt, suspend, wasm::kNoPromise);
+      call_target, callable, serialized_sig, wrapper_code, rtt, suspend,
+      wasm::kNoPromise);
 
   if (wasm::WasmFeatures::FromIsolate(isolate).has_typed_funcref()) {
-    using CK = wasm::ImportCallKind;
-    int expected_arity = parameter_count;
-    CK kind = wasm::kDefaultImportCallKind;
-    if (callable->IsJSFunction()) {
-      SharedFunctionInfo shared = Handle<JSFunction>::cast(callable)->shared();
-      expected_arity =
-          shared.internal_formal_parameter_count_without_receiver();
-      if (expected_arity != parameter_count) {
-        kind = CK::kJSFunctionArityMismatch;
+    Handle<Code> wasm_to_js_wrapper_code;
+    if (UseGenericWasmToJSWrapper(wasm::kDefaultImportCallKind, sig, suspend)) {
+      wasm_to_js_wrapper_code =
+          isolate->builtins()->code_handle(Builtin::kWasmToJsWrapperAsm);
+    } else {
+      int expected_arity = parameter_count;
+      wasm::ImportCallKind kind = wasm::kDefaultImportCallKind;
+      if (IsJSFunction(*callable)) {
+        Tagged<SharedFunctionInfo> shared =
+            Handle<JSFunction>::cast(callable)->shared();
+        expected_arity =
+            shared->internal_formal_parameter_count_without_receiver();
+        if (expected_arity != parameter_count) {
+          kind = wasm::ImportCallKind::kJSFunctionArityMismatch;
+        }
       }
+      // TODO(wasm): Think about caching and sharing the wasm-to-JS wrappers per
+      // signature instead of compiling a new one for every instantiation.
+      wasm_to_js_wrapper_code = compiler::CompileWasmToJSWrapper(
+                                    isolate, sig, kind, expected_arity, suspend)
+                                    .ToHandleChecked();
     }
-    // TODO(wasm): Think about caching and sharing the wasm-to-JS wrappers per
-    // signature instead of compiling a new one for every instantiation.
-    Handle<Code> wasm_to_js_wrapper_code =
-        compiler::CompileWasmToJSWrapper(isolate, sig, kind, expected_arity,
-                                         suspend)
-            .ToHandleChecked();
-    function_data->internal().set_code(*wasm_to_js_wrapper_code);
+    function_data->internal()->set_code(*wasm_to_js_wrapper_code);
   }
 
   Handle<String> name = factory->Function_string();
-  if (callable->IsJSFunction()) {
+  if (IsJSFunction(*callable)) {
     name = JSFunction::GetDebugName(Handle<JSFunction>::cast(callable));
     name = String::Flatten(isolate, name);
   }
-  Handle<NativeContext> context(isolate->native_context());
   Handle<SharedFunctionInfo> shared =
       factory->NewSharedFunctionInfoForWasmJSFunction(name, function_data);
   Handle<JSFunction> js_function =
       Factory::JSFunctionBuilder{isolate, shared, context}
           .set_map(isolate->wasm_exported_function_map())
           .Build();
-  js_function->shared().set_internal_formal_parameter_count(
+  js_function->shared()->set_internal_formal_parameter_count(
       JSParameterCount(parameter_count));
-  function_data->internal().set_external(*js_function);
+  function_data->internal()->set_external(*js_function);
   return Handle<WasmJSFunction>::cast(js_function);
 }
 
-JSReceiver WasmJSFunction::GetCallable() const {
-  return JSReceiver::cast(WasmApiFunctionRef::cast(
-                              shared().wasm_js_function_data().internal().ref())
-                              .callable());
+Tagged<JSReceiver> WasmJSFunction::GetCallable() const {
+  return JSReceiver::cast(
+      WasmApiFunctionRef::cast(
+          shared()->wasm_js_function_data()->internal()->ref())
+          ->callable());
 }
 
 wasm::Suspend WasmJSFunction::GetSuspend() const {
   return static_cast<wasm::Suspend>(
       WasmApiFunctionRef::cast(
-          shared().wasm_js_function_data().internal().ref())
-          .suspend());
+          shared()->wasm_js_function_data()->internal()->ref())
+          ->suspend());
 }
 
 const wasm::FunctionSig* WasmJSFunction::GetSignature(Zone* zone) const {
-  WasmJSFunctionData function_data = shared().wasm_js_function_data();
-  int sig_size = function_data.serialized_signature().length();
-  wasm::ValueType* types = zone->NewArray<wasm::ValueType>(sig_size);
-  if (sig_size > 0) {
-    function_data.serialized_signature().copy_out(0, types, sig_size);
-  }
-  int return_count = function_data.serialized_return_count();
-  int parameter_count = function_data.serialized_parameter_count();
-  return zone->New<wasm::FunctionSig>(return_count, parameter_count, types);
+  Tagged<WasmJSFunctionData> function_data = shared()->wasm_js_function_data();
+  return wasm::SerializedSignatureHelper::DeserializeSignature(
+      zone, function_data->serialized_signature());
 }
 
 bool WasmJSFunction::MatchesSignature(
@@ -2152,20 +2403,21 @@ bool WasmJSFunction::MatchesSignature(
   Zone zone(&allocator, ZONE_NAME);
   const wasm::FunctionSig* sig = GetSignature(&zone);
 #if DEBUG
-  // TODO(7748): Change this if indexed types are allowed.
+  // TODO(14034): Change this if indexed types are allowed.
   for (wasm::ValueType type : sig->all()) CHECK(!type.has_index());
 #endif
-  // TODO(7748): Check for subtyping instead if WebAssembly.Function can define
+  // TODO(14034): Check for subtyping instead if WebAssembly.Function can define
   // signature supertype.
   return wasm::GetWasmEngine()->type_canonicalizer()->AddRecursiveGroup(sig) ==
          other_canonical_sig_index;
 }
 
-PodArray<wasm::ValueType> WasmCapiFunction::GetSerializedSignature() const {
-  return shared().wasm_capi_function_data().serialized_signature();
+Tagged<PodArray<wasm::ValueType>> WasmCapiFunction::GetSerializedSignature()
+    const {
+  return shared()->wasm_capi_function_data()->serialized_signature();
 }
 
-bool WasmExternalFunction::IsWasmExternalFunction(Object object) {
+bool WasmExternalFunction::IsWasmExternalFunction(Tagged<Object> object) {
   return WasmExportedFunction::IsWasmExportedFunction(object) ||
          WasmJSFunction::IsWasmJSFunction(object);
 }
@@ -2176,10 +2428,10 @@ MaybeHandle<WasmInternalFunction> WasmInternalFunction::FromExternal(
   if (WasmExportedFunction::IsWasmExportedFunction(*external) ||
       WasmJSFunction::IsWasmJSFunction(*external) ||
       WasmCapiFunction::IsWasmCapiFunction(*external)) {
-    WasmFunctionData data = WasmFunctionData::cast(
-        Handle<JSFunction>::cast(external)->shared().function_data(
+    Tagged<WasmFunctionData> data = WasmFunctionData::cast(
+        Handle<JSFunction>::cast(external)->shared()->function_data(
             kAcquireLoad));
-    return handle(data.internal(), isolate);
+    return handle(data->internal(), isolate);
   }
   return MaybeHandle<WasmInternalFunction>();
 }
@@ -2232,7 +2484,7 @@ Handle<Object> CanonicalizeHeapNumber(Handle<Object> number, Isolate* isolate) {
 Handle<Object> CanonicalizeSmi(Handle<Object> smi, Isolate* isolate) {
   if constexpr (SmiValuesAre31Bits()) return smi;
 
-  int32_t value = Handle<Smi>::cast(smi)->value();
+  int32_t value = Smi::cast(*smi).value();
 
   if (value <= kInt31MaxValue && value >= kInt31MinValue) {
     return smi;
@@ -2247,7 +2499,7 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
                                    ValueType expected_canonical,
                                    const char** error_message) {
   DCHECK(expected_canonical.is_object_reference());
-  if (expected_canonical.kind() == kRefNull && value->IsNull(isolate)) {
+  if (expected_canonical.kind() == kRefNull && IsNull(*value, isolate)) {
     switch (expected_canonical.heap_representation()) {
       case HeapType::kStringViewWtf8:
         *error_message = "stringview_wtf8 has no JS representation";
@@ -2266,7 +2518,6 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
     }
   }
 
-  // TODO(7748): Streamline interaction of undefined and (ref any).
   switch (expected_canonical.heap_representation()) {
     case HeapType::kFunc: {
       if (!(WasmExternalFunction::IsWasmExternalFunction(*value) ||
@@ -2278,26 +2529,26 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
       }
       return MaybeHandle<Object>(Handle<JSFunction>::cast(value)
                                      ->shared()
-                                     .wasm_function_data()
-                                     .internal(),
+                                     ->wasm_function_data()
+                                     ->internal(),
                                  isolate);
     }
     case HeapType::kExtern: {
-      if (!value->IsNull(isolate)) return value;
+      if (!IsNull(*value, isolate)) return value;
       *error_message = "null is not allowed for (ref extern)";
       return {};
     }
     case HeapType::kAny: {
-      if (value->IsSmi()) return CanonicalizeSmi(value, isolate);
-      if (value->IsHeapNumber()) {
+      if (IsSmi(*value)) return CanonicalizeSmi(value, isolate);
+      if (IsHeapNumber(*value)) {
         return CanonicalizeHeapNumber(value, isolate);
       }
-      if (!value->IsNull(isolate)) return value;
+      if (!IsNull(*value, isolate)) return value;
       *error_message = "null is not allowed for (ref any)";
       return {};
     }
     case HeapType::kStruct: {
-      if (value->IsWasmStruct()) {
+      if (IsWasmStruct(*value)) {
         return value;
       }
       *error_message =
@@ -2305,7 +2556,7 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
       return {};
     }
     case HeapType::kArray: {
-      if (value->IsWasmArray()) {
+      if (IsWasmArray(*value)) {
         return value;
       }
       *error_message =
@@ -2313,13 +2564,13 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
       return {};
     }
     case HeapType::kEq: {
-      if (value->IsSmi()) {
+      if (IsSmi(*value)) {
         Handle<Object> truncated = CanonicalizeSmi(value, isolate);
-        if (truncated->IsSmi()) return truncated;
-      } else if (value->IsHeapNumber()) {
+        if (IsSmi(*truncated)) return truncated;
+      } else if (IsHeapNumber(*value)) {
         Handle<Object> truncated = CanonicalizeHeapNumber(value, isolate);
-        if (truncated->IsSmi()) return truncated;
-      } else if (value->IsWasmStruct() || value->IsWasmArray()) {
+        if (IsSmi(*truncated)) return truncated;
+      } else if (IsWasmStruct(*value) || IsWasmArray(*value)) {
         return value;
       }
       *error_message =
@@ -2328,12 +2579,12 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
       return {};
     }
     case HeapType::kI31: {
-      if (value->IsSmi()) {
+      if (IsSmi(*value)) {
         Handle<Object> truncated = CanonicalizeSmi(value, isolate);
-        if (truncated->IsSmi()) return truncated;
-      } else if (value->IsHeapNumber()) {
+        if (IsSmi(*truncated)) return truncated;
+      } else if (IsHeapNumber(*value)) {
         Handle<Object> truncated = CanonicalizeHeapNumber(value, isolate);
-        if (truncated->IsSmi()) return truncated;
+        if (IsSmi(*truncated)) return truncated;
       }
       *error_message =
           "i31ref object must be null (if nullable) or a Number that fits "
@@ -2341,7 +2592,7 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
       return {};
     }
     case HeapType::kString:
-      if (value->IsString()) return value;
+      if (IsString(*value)) return value;
       *error_message = "wrong type (expected a string)";
       return {};
     case HeapType::kStringViewWtf8:
@@ -2363,10 +2614,11 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
       auto type_canonicalizer = GetWasmEngine()->type_canonicalizer();
 
       if (WasmExportedFunction::IsWasmExportedFunction(*value)) {
-        WasmExportedFunction function = WasmExportedFunction::cast(*value);
-        uint32_t real_type_index = function.shared()
-                                       .wasm_exported_function_data()
-                                       .canonical_type_index();
+        Tagged<WasmExportedFunction> function =
+            WasmExportedFunction::cast(*value);
+        uint32_t real_type_index = function->shared()
+                                       ->wasm_exported_function_data()
+                                       ->canonical_type_index();
         if (!type_canonicalizer->IsCanonicalSubtype(
                 real_type_index, expected_canonical.ref_index())) {
           *error_message =
@@ -2376,7 +2628,7 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
         }
         return WasmInternalFunction::FromExternal(value, isolate);
       } else if (WasmJSFunction::IsWasmJSFunction(*value)) {
-        if (!WasmJSFunction::cast(*value).MatchesSignature(
+        if (!WasmJSFunction::cast(*value)->MatchesSignature(
                 expected_canonical.ref_index())) {
           *error_message =
               "assigned WebAssembly.Function has to be a subtype of the "
@@ -2385,7 +2637,7 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
         }
         return WasmInternalFunction::FromExternal(value, isolate);
       } else if (WasmCapiFunction::IsWasmCapiFunction(*value)) {
-        if (!WasmCapiFunction::cast(*value).MatchesSignature(
+        if (!WasmCapiFunction::cast(*value)->MatchesSignature(
                 expected_canonical.ref_index())) {
           *error_message =
               "assigned C API function has to be a subtype of the expected "
@@ -2393,11 +2645,12 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, Handle<Object> value,
           return {};
         }
         return WasmInternalFunction::FromExternal(value, isolate);
-      } else if (value->IsWasmStruct() || value->IsWasmArray()) {
+      } else if (IsWasmStruct(*value) || IsWasmArray(*value)) {
         auto wasm_obj = Handle<WasmObject>::cast(value);
-        WasmTypeInfo type_info = wasm_obj->map().wasm_type_info();
-        uint32_t real_idx = type_info.type_index();
-        const WasmModule* real_module = type_info.instance().module();
+        Tagged<WasmTypeInfo> type_info = wasm_obj->map()->wasm_type_info();
+        uint32_t real_idx = type_info->type_index();
+        const WasmModule* real_module =
+            WasmInstanceObject::cast(type_info->instance())->module();
         uint32_t real_canonical_index =
             real_module->isorecursive_canonical_type_ids[real_idx];
         if (!type_canonicalizer->IsCanonicalSubtype(
@@ -2428,48 +2681,14 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, const WasmModule* module,
   return JSToWasmObject(isolate, value, expected_canonical, error_message);
 }
 
-MaybeHandle<Object> WasmToJSObject(Isolate* isolate, Handle<Object> value,
-                                   HeapType type, const char** error_message) {
-  switch (type.representation()) {
-    case i::wasm::HeapType::kExtern:
-    case i::wasm::HeapType::kString:
-    case i::wasm::HeapType::kI31:
-    case i::wasm::HeapType::kStruct:
-    case i::wasm::HeapType::kArray:
-    case i::wasm::HeapType::kEq:
-    case i::wasm::HeapType::kAny:
-      return value->IsWasmNull() ? isolate->factory()->null_value() : value;
-    case i::wasm::HeapType::kFunc: {
-      if (value->IsWasmNull()) {
-        return isolate->factory()->null_value();
-      } else {
-        DCHECK(value->IsWasmInternalFunction());
-        return handle(
-            i::Handle<i::WasmInternalFunction>::cast(value)->external(),
-            isolate);
-      }
-    }
-    case i::wasm::HeapType::kStringViewWtf8:
-      *error_message = "stringview_wtf8 has no JS representation";
-      return {};
-    case i::wasm::HeapType::kStringViewWtf16:
-      *error_message = "stringview_wtf16 has no JS representation";
-      return {};
-    case i::wasm::HeapType::kStringViewIter:
-      *error_message = "stringview_iter has no JS representation";
-      return {};
-    case i::wasm::HeapType::kBottom:
-      UNREACHABLE();
-    default:
-      if (value->IsWasmNull()) {
-        return isolate->factory()->null_value();
-      } else if (value->IsWasmInternalFunction()) {
-        return handle(
-            i::Handle<i::WasmInternalFunction>::cast(value)->external(),
-            isolate);
-      } else {
-        return value;
-      }
+Handle<Object> WasmToJSObject(Isolate* isolate, Handle<Object> value) {
+  if (IsWasmNull(*value)) {
+    return isolate->factory()->null_value();
+  } else if (IsWasmInternalFunction(*value)) {
+    return i::WasmInternalFunction::GetOrCreateExternal(
+        i::Handle<i::WasmInternalFunction>::cast(value));
+  } else {
+    return value;
   }
 }
 
diff --git a/deps/v8/src/wasm/wasm-objects.h b/deps/v8/src/wasm/wasm-objects.h
index 74cbdd4d9cb4cf..ba01c79b48c3ce 100644
--- a/deps/v8/src/wasm/wasm-objects.h
+++ b/deps/v8/src/wasm/wasm-objects.h
@@ -30,7 +30,6 @@
 namespace v8 {
 namespace internal {
 namespace wasm {
-class InterpretedFrame;
 class NativeModule;
 class WasmCode;
 struct WasmFunction;
@@ -63,7 +62,7 @@ class Managed;
 
 #define DECL_OPTIONAL_ACCESSORS(name, type) \
   DECL_GETTER(has_##name, bool)             \
-  DECL_ACCESSORS(name, type)
+  DECL_ACCESSORS(name, Tagged<type>)
 
 class V8_EXPORT_PRIVATE FunctionTargetAndRef {
  public:
@@ -99,16 +98,22 @@ class ImportedFunctionEntry {
 
   // Initialize this entry as a Wasm to JS call. This accepts the isolate as a
   // parameter, since it must allocate a tuple.
+  void SetWasmToJs(Isolate*, Handle<JSReceiver> callable, wasm::Suspend suspend,
+                   const wasm::FunctionSig* sig);
   V8_EXPORT_PRIVATE void SetWasmToJs(Isolate*, Handle<JSReceiver> callable,
                                      const wasm::WasmCode* wasm_to_js_wrapper,
-                                     wasm::Suspend suspend);
+                                     wasm::Suspend suspend,
+                                     const wasm::FunctionSig* sig);
+
   // Initialize this entry as a Wasm to Wasm call.
-  void SetWasmToWasm(WasmInstanceObject target_instance, Address call_target);
+  void SetWasmToWasm(Tagged<WasmInstanceObject> target_instance,
+                     Address call_target);
 
-  JSReceiver callable();
-  Object maybe_callable();
-  Object object_ref();
+  Tagged<JSReceiver> callable();
+  Tagged<Object> maybe_callable();
+  Tagged<Object> object_ref();
   Address target();
+  void set_target(Address new_target);
 
  private:
   Handle<WasmInstanceObject> const instance_;
@@ -188,8 +193,7 @@ class WasmTableObject
       Isolate* isolate, Handle<WasmTableObject> table,
       Handle<WasmInstanceObject> instance, int table_index);
 
-  static bool IsInBounds(Isolate* isolate, Handle<WasmTableObject> table,
-                         uint32_t entry_index);
+  bool is_in_bounds(uint32_t entry_index);
 
   // Thin wrapper around {JsToWasmObject}.
   static MaybeHandle<Object> JSToWasmElement(Isolate* isolate,
@@ -213,10 +217,11 @@ class WasmTableObject
                                      uint32_t count);
 
   // TODO(wasm): Unify these three methods into one.
-  static void UpdateDispatchTables(Isolate* isolate, WasmTableObject table,
+  static void UpdateDispatchTables(Isolate* isolate,
+                                   Handle<WasmTableObject> table,
                                    int entry_index,
                                    const wasm::WasmFunction* func,
-                                   WasmInstanceObject target_instance);
+                                   Handle<WasmInstanceObject> target_instance);
   static void UpdateDispatchTables(Isolate* isolate,
                                    Handle<WasmTableObject> table,
                                    int entry_index,
@@ -258,28 +263,35 @@ class WasmMemoryObject
  public:
   DECL_OPTIONAL_ACCESSORS(instances, WeakArrayList)
 
-  // Add an instance to the internal (weak) list.
-  V8_EXPORT_PRIVATE static void AddInstance(Isolate* isolate,
-                                            Handle<WasmMemoryObject> memory,
-                                            Handle<WasmInstanceObject> object);
+  // Add a use of this memory object to the given instance. This updates the
+  // internal weak list of instances that use this memory and also updates the
+  // fields of the instance to reference this memory's buffer.
+  V8_EXPORT_PRIVATE static void UseInInstance(Isolate* isolate,
+                                              Handle<WasmMemoryObject> memory,
+                                              Handle<WasmInstanceObject> object,
+                                              int memory_index_in_instance);
   inline bool has_maximum_pages();
 
-  V8_EXPORT_PRIVATE static MaybeHandle<WasmMemoryObject> New(
+  // Overwrite the Torque-generated method that returns an int.
+  inline bool is_memory64() const;
+
+  V8_EXPORT_PRIVATE static Handle<WasmMemoryObject> New(
       Isolate* isolate, Handle<JSArrayBuffer> buffer, int maximum,
-      WasmMemoryFlag memory_type = WasmMemoryFlag::kWasmMemory32);
+      WasmMemoryFlag memory_type);
 
   V8_EXPORT_PRIVATE static MaybeHandle<WasmMemoryObject> New(
-      Isolate* isolate, int initial, int maximum,
-      SharedFlag shared = SharedFlag::kNotShared,
-      WasmMemoryFlag memory_type = WasmMemoryFlag::kWasmMemory32);
-
-  static constexpr int kNoMaximum = -1;
+      Isolate* isolate, int initial, int maximum, SharedFlag shared,
+      WasmMemoryFlag memory_type);
 
-  void update_instances(Isolate* isolate, Handle<JSArrayBuffer> buffer);
+  // Assign a new (grown) buffer to this memory, also updating the shortcut
+  // fields of all instances that use this memory.
+  void SetNewBuffer(Tagged<JSArrayBuffer> new_buffer);
 
   V8_EXPORT_PRIVATE static int32_t Grow(Isolate*, Handle<WasmMemoryObject>,
                                         uint32_t pages);
 
+  static constexpr int kNoMaximum = -1;
+
   TQ_OBJECT_CONSTRUCTORS(WasmMemoryObject)
 };
 
@@ -287,8 +299,8 @@ class WasmMemoryObject
 class WasmGlobalObject
     : public TorqueGeneratedWasmGlobalObject<WasmGlobalObject, JSObject> {
  public:
-  DECL_ACCESSORS(untagged_buffer, JSArrayBuffer)
-  DECL_ACCESSORS(tagged_buffer, FixedArray)
+  DECL_ACCESSORS(untagged_buffer, Tagged<JSArrayBuffer>)
+  DECL_ACCESSORS(tagged_buffer, Tagged<FixedArray>)
   DECL_PRIMITIVE_ACCESSORS(type, wasm::ValueType)
 
   // Dispatched behavior.
@@ -306,7 +318,7 @@ class WasmGlobalObject
   inline int64_t GetI64();
   inline float GetF32();
   inline double GetF64();
-  inline byte* GetS128RawBytes();
+  inline uint8_t* GetS128RawBytes();
   inline Handle<Object> GetRef();
 
   inline void SetI32(int32_t value);
@@ -330,25 +342,28 @@ class V8_EXPORT_PRIVATE WasmInstanceObject : public JSObject {
  public:
   DECL_CAST(WasmInstanceObject)
 
-  DECL_ACCESSORS(module_object, WasmModuleObject)
-  DECL_ACCESSORS(exports_object, JSObject)
-  DECL_ACCESSORS(native_context, Context)
-  DECL_OPTIONAL_ACCESSORS(memory_object, WasmMemoryObject)
+  DECL_ACCESSORS(module_object, Tagged<WasmModuleObject>)
+  DECL_ACCESSORS(exports_object, Tagged<JSObject>)
+  DECL_ACCESSORS(native_context, Tagged<Context>)
+  DECL_ACCESSORS(memory_objects, Tagged<FixedArray>)
   DECL_OPTIONAL_ACCESSORS(untagged_globals_buffer, JSArrayBuffer)
   DECL_OPTIONAL_ACCESSORS(tagged_globals_buffer, FixedArray)
   DECL_OPTIONAL_ACCESSORS(imported_mutable_globals_buffers, FixedArray)
   DECL_OPTIONAL_ACCESSORS(tables, FixedArray)
   DECL_OPTIONAL_ACCESSORS(indirect_function_tables, FixedArray)
-  DECL_ACCESSORS(imported_function_refs, FixedArray)
-  DECL_ACCESSORS(imported_mutable_globals, ByteArray)
-  DECL_ACCESSORS(imported_function_targets, FixedAddressArray)
+  DECL_ACCESSORS(imported_function_refs, Tagged<FixedArray>)
+  DECL_ACCESSORS(imported_mutable_globals, Tagged<FixedAddressArray>)
+  DECL_ACCESSORS(imported_function_targets, Tagged<FixedAddressArray>)
   DECL_OPTIONAL_ACCESSORS(indirect_function_table_refs, FixedArray)
+  DECL_ACCESSORS(indirect_function_table_sig_ids, Tagged<FixedUInt32Array>)
+  DECL_ACCESSORS(indirect_function_table_targets, Tagged<ExternalPointerArray>)
   DECL_OPTIONAL_ACCESSORS(tags_table, FixedArray)
-  DECL_ACCESSORS(wasm_internal_functions, FixedArray)
-  DECL_ACCESSORS(managed_object_maps, FixedArray)
-  DECL_ACCESSORS(feedback_vectors, FixedArray)
-  DECL_SANDBOXED_POINTER_ACCESSORS(memory_start, byte*)
-  DECL_PRIMITIVE_ACCESSORS(memory_size, size_t)
+  DECL_ACCESSORS(wasm_internal_functions, Tagged<FixedArray>)
+  DECL_ACCESSORS(managed_object_maps, Tagged<FixedArray>)
+  DECL_ACCESSORS(feedback_vectors, Tagged<FixedArray>)
+  DECL_ACCESSORS(well_known_imports, Tagged<FixedArray>)
+  DECL_SANDBOXED_POINTER_ACCESSORS(memory0_start, uint8_t*)
+  DECL_PRIMITIVE_ACCESSORS(memory0_size, size_t)
   DECL_PRIMITIVE_ACCESSORS(stack_limit_address, Address)
   DECL_PRIMITIVE_ACCESSORS(real_stack_limit_address, Address)
   DECL_PRIMITIVE_ACCESSORS(new_allocation_limit_address, Address*)
@@ -356,22 +371,25 @@ class V8_EXPORT_PRIVATE WasmInstanceObject : public JSObject {
   DECL_PRIMITIVE_ACCESSORS(old_allocation_limit_address, Address*)
   DECL_PRIMITIVE_ACCESSORS(old_allocation_top_address, Address*)
   DECL_PRIMITIVE_ACCESSORS(isorecursive_canonical_types, const uint32_t*)
-  DECL_SANDBOXED_POINTER_ACCESSORS(globals_start, byte*)
+  DECL_SANDBOXED_POINTER_ACCESSORS(globals_start, uint8_t*)
   DECL_PRIMITIVE_ACCESSORS(indirect_function_table_size, uint32_t)
-  DECL_PRIMITIVE_ACCESSORS(indirect_function_table_sig_ids, uint32_t*)
-  DECL_PRIMITIVE_ACCESSORS(indirect_function_table_targets, Address*)
   DECL_PRIMITIVE_ACCESSORS(jump_table_start, Address)
   DECL_PRIMITIVE_ACCESSORS(hook_on_function_call_address, Address)
   DECL_PRIMITIVE_ACCESSORS(tiering_budget_array, uint32_t*)
-  DECL_ACCESSORS(data_segment_starts, FixedAddressArray)
-  DECL_ACCESSORS(data_segment_sizes, FixedUInt32Array)
-  DECL_ACCESSORS(element_segments, FixedArray)
+  DECL_ACCESSORS(memory_bases_and_sizes, Tagged<FixedAddressArray>)
+  DECL_ACCESSORS(data_segment_starts, Tagged<FixedAddressArray>)
+  DECL_ACCESSORS(data_segment_sizes, Tagged<FixedUInt32Array>)
+  DECL_ACCESSORS(element_segments, Tagged<FixedArray>)
   DECL_PRIMITIVE_ACCESSORS(break_on_entry, uint8_t)
 
   // Clear uninitialized padding space. This ensures that the snapshot content
   // is deterministic. Depending on the V8 build mode there could be no padding.
   V8_INLINE void clear_padding();
 
+  inline Tagged<WasmMemoryObject> memory_object(int memory_index) const;
+  inline uint8_t* memory_base(int memory_index) const;
+  inline size_t memory_size(int memory_index) const;
+
   // Dispatched behavior.
   DECL_PRINTER(WasmInstanceObject)
   DECL_VERIFIER(WasmInstanceObject)
@@ -382,17 +400,17 @@ class V8_EXPORT_PRIVATE WasmInstanceObject : public JSObject {
   /* Less than system pointer sized fields come first. */                 \
   V(kImportedFunctionRefsOffset, kTaggedSize)                             \
   V(kIndirectFunctionTableRefsOffset, kTaggedSize)                        \
+  V(kIndirectFunctionTableSigIdsOffset, kTaggedSize)                      \
+  V(kIndirectFunctionTableTargetsOffset, kTaggedSize)                     \
   V(kImportedMutableGlobalsOffset, kTaggedSize)                           \
   V(kImportedFunctionTargetsOffset, kTaggedSize)                          \
   V(kIndirectFunctionTableSizeOffset, kUInt32Size)                        \
   /* Optional padding to align system pointer size fields */              \
   V(kOptionalPaddingOffset, POINTER_SIZE_PADDING(kOptionalPaddingOffset)) \
-  V(kMemoryStartOffset, kSystemPointerSize)                               \
-  V(kMemorySizeOffset, kSizetSize)                                        \
+  V(kMemory0StartOffset, kSystemPointerSize)                              \
+  V(kMemory0SizeOffset, kSizetSize)                                       \
   V(kStackLimitAddressOffset, kSystemPointerSize)                         \
   V(kIsorecursiveCanonicalTypesOffset, kSystemPointerSize)                \
-  V(kIndirectFunctionTableTargetsOffset, kSystemPointerSize)              \
-  V(kIndirectFunctionTableSigIdsOffset, kSystemPointerSize)               \
   V(kGlobalsStartOffset, kSystemPointerSize)                              \
   V(kJumpTableStartOffset, kSystemPointerSize)                            \
   /* End of often-accessed fields. */                                     \
@@ -405,13 +423,14 @@ class V8_EXPORT_PRIVATE WasmInstanceObject : public JSObject {
   V(kHookOnFunctionCallAddressOffset, kSystemPointerSize)                 \
   V(kTieringBudgetArrayOffset, kSystemPointerSize)                        \
   /* Less than system pointer size aligned fields are below. */           \
+  V(kMemoryBasesAndSizesOffset, kTaggedSize)                              \
   V(kDataSegmentStartsOffset, kTaggedSize)                                \
   V(kDataSegmentSizesOffset, kTaggedSize)                                 \
   V(kElementSegmentsOffset, kTaggedSize)                                  \
   V(kModuleObjectOffset, kTaggedSize)                                     \
   V(kExportsObjectOffset, kTaggedSize)                                    \
   V(kNativeContextOffset, kTaggedSize)                                    \
-  V(kMemoryObjectOffset, kTaggedSize)                                     \
+  V(kMemoryObjectsOffset, kTaggedSize)                                    \
   V(kUntaggedGlobalsBufferOffset, kTaggedSize)                            \
   V(kTaggedGlobalsBufferOffset, kTaggedSize)                              \
   V(kImportedMutableGlobalsBuffersOffset, kTaggedSize)                    \
@@ -421,6 +440,7 @@ class V8_EXPORT_PRIVATE WasmInstanceObject : public JSObject {
   V(kWasmInternalFunctionsOffset, kTaggedSize)                            \
   V(kManagedObjectMapsOffset, kTaggedSize)                                \
   V(kFeedbackVectorsOffset, kTaggedSize)                                  \
+  V(kWellKnownImportsOffset, kTaggedSize)                                 \
   V(kBreakOnEntryOffset, kUInt8Size)                                      \
   /* More padding to make the header pointer-size aligned */              \
   V(kHeaderPaddingOffset, POINTER_SIZE_PADDING(kHeaderPaddingOffset))     \
@@ -441,27 +461,47 @@ class V8_EXPORT_PRIVATE WasmInstanceObject : public JSObject {
 #undef ASSERT_FIELD_ALIGNED
 #undef WASM_INSTANCE_OBJECT_FIELDS
 
-  static constexpr uint16_t kTaggedFieldOffsets[] = {
-      kImportedFunctionRefsOffset,
-      kIndirectFunctionTableRefsOffset,
-      kModuleObjectOffset,
-      kExportsObjectOffset,
-      kNativeContextOffset,
-      kMemoryObjectOffset,
-      kUntaggedGlobalsBufferOffset,
-      kTaggedGlobalsBufferOffset,
-      kImportedMutableGlobalsBuffersOffset,
-      kTablesOffset,
-      kIndirectFunctionTablesOffset,
-      kTagsTableOffset,
-      kWasmInternalFunctionsOffset,
-      kManagedObjectMapsOffset,
-      kFeedbackVectorsOffset,
-      kImportedMutableGlobalsOffset,
-      kImportedFunctionTargetsOffset,
-      kDataSegmentStartsOffset,
-      kDataSegmentSizesOffset,
-      kElementSegmentsOffset};
+// V(offset, name)
+#define WASM_TAGGED_INSTANCE_OBJECT_FIELDS(V)                                 \
+  V(kImportedFunctionRefsOffset, "imported_function_refs")                    \
+  V(kIndirectFunctionTableRefsOffset, "indirect_function_table_refs")         \
+  V(kIndirectFunctionTableTargetsOffset, "indirect_function_table_targets")   \
+  V(kIndirectFunctionTableSigIdsOffset, "indirect_function_table_sig_ids")    \
+  V(kModuleObjectOffset, "module_object")                                     \
+  V(kExportsObjectOffset, "exports_object")                                   \
+  V(kNativeContextOffset, "native_context")                                   \
+  V(kMemoryObjectsOffset, "memory_objects")                                   \
+  V(kUntaggedGlobalsBufferOffset, "untagged_globals_buffer")                  \
+  V(kTaggedGlobalsBufferOffset, "tagged_globals_buffer")                      \
+  V(kImportedMutableGlobalsBuffersOffset, "imported_mutable_globals_buffers") \
+  V(kTablesOffset, "tables")                                                  \
+  V(kIndirectFunctionTablesOffset, "indirect_function_tables")                \
+  V(kTagsTableOffset, "tags_table")                                           \
+  V(kWasmInternalFunctionsOffset, "wasm_internal_functions")                  \
+  V(kManagedObjectMapsOffset, "managed_object_maps")                          \
+  V(kFeedbackVectorsOffset, "feedback_vectors")                               \
+  V(kWellKnownImportsOffset, "well_known_imports")                            \
+  V(kImportedMutableGlobalsOffset, "imported_mutable_globals")                \
+  V(kImportedFunctionTargetsOffset, "imported_function_targets")              \
+  V(kMemoryBasesAndSizesOffset, "memory_bases_and_sizes")                     \
+  V(kDataSegmentStartsOffset, "data_segment_starts")                          \
+  V(kDataSegmentSizesOffset, "data_segment_sizes")                            \
+  V(kElementSegmentsOffset, "element_segments")
+
+  static constexpr std::array<uint16_t, 24> kTaggedFieldOffsets = {
+#define WASM_INSTANCE_TAGGED_FIELD_OFFSET(offset, _) offset,
+      WASM_TAGGED_INSTANCE_OBJECT_FIELDS(WASM_INSTANCE_TAGGED_FIELD_OFFSET)
+#undef WASM_INSTANCE_TAGGED_FIELD_OFFSET
+  };
+
+  static constexpr std::array<const char*, 24> kTaggedFieldNames = {
+#define WASM_INSTANCE_TAGGED_FIELD_NAME(_, name) name,
+      WASM_TAGGED_INSTANCE_OBJECT_FIELDS(WASM_INSTANCE_TAGGED_FIELD_NAME)
+#undef WASM_INSTANCE_TAGGED_FIELD_NAME
+  };
+
+  static_assert(kTaggedFieldOffsets.size() == kTaggedFieldNames.size(),
+                "every field offset needs a name");
 
   const wasm::WasmModule* module();
 
@@ -469,7 +509,7 @@ class V8_EXPORT_PRIVATE WasmInstanceObject : public JSObject {
       Handle<WasmInstanceObject> instance, int table_index,
       uint32_t minimum_size);
 
-  void SetRawMemory(byte* mem_start, size_t mem_size);
+  void SetRawMemory(int memory_index, uint8_t* mem_start, size_t mem_size);
 
   static Handle<WasmInstanceObject> New(Isolate*, Handle<WasmModuleObject>);
 
@@ -539,8 +579,7 @@ class V8_EXPORT_PRIVATE WasmInstanceObject : public JSObject {
   OBJECT_CONSTRUCTORS(WasmInstanceObject, JSObject);
 
  private:
-  static void InitDataSegmentArrays(Handle<WasmInstanceObject>,
-                                    Handle<WasmModuleObject>);
+  void InitDataSegmentArrays(Tagged<WasmModuleObject>);
 };
 
 // Representation of WebAssembly.Exception JavaScript-level object.
@@ -601,18 +640,23 @@ void V8_EXPORT_PRIVATE
 DecodeI64ExceptionValue(Handle<FixedArray> encoded_values,
                         uint32_t* encoded_index, uint64_t* value);
 
+bool UseGenericWasmToJSWrapper(wasm::ImportCallKind kind,
+                               const wasm::FunctionSig* sig,
+                               wasm::Suspend suspend);
+
 // A Wasm function that is wrapped and exported to JavaScript.
 // Representation of WebAssembly.Function JavaScript-level object.
 class WasmExportedFunction : public JSFunction {
  public:
-  WasmInstanceObject instance();
+  Tagged<WasmInstanceObject> instance();
   V8_EXPORT_PRIVATE int function_index();
 
-  V8_EXPORT_PRIVATE static bool IsWasmExportedFunction(Object object);
+  V8_EXPORT_PRIVATE static bool IsWasmExportedFunction(Tagged<Object> object);
 
   V8_EXPORT_PRIVATE static Handle<WasmExportedFunction> New(
-      Isolate* isolate, Handle<WasmInstanceObject> instance, int func_index,
-      int arity, Handle<Code> export_wrapper);
+      Isolate* isolate, Handle<WasmInstanceObject> instance,
+      Handle<WasmInternalFunction> internal, int func_index, int arity,
+      Handle<Code> export_wrapper);
 
   Address GetWasmCallTarget();
 
@@ -632,14 +676,14 @@ class WasmExportedFunction : public JSFunction {
 // Representation of WebAssembly.Function JavaScript-level object.
 class WasmJSFunction : public JSFunction {
  public:
-  static bool IsWasmJSFunction(Object object);
+  static bool IsWasmJSFunction(Tagged<Object> object);
 
   static Handle<WasmJSFunction> New(Isolate* isolate,
                                     const wasm::FunctionSig* sig,
                                     Handle<JSReceiver> callable,
                                     wasm::Suspend suspend);
 
-  JSReceiver GetCallable() const;
+  Tagged<JSReceiver> GetCallable() const;
   wasm::Suspend GetSuspend() const;
   // Deserializes the signature of this function using the provided zone. Note
   // that lifetime of the signature is hence directly coupled to the zone.
@@ -653,13 +697,13 @@ class WasmJSFunction : public JSFunction {
 // An external function exposed to Wasm via the C/C++ API.
 class WasmCapiFunction : public JSFunction {
  public:
-  static bool IsWasmCapiFunction(Object object);
+  static bool IsWasmCapiFunction(Tagged<Object> object);
 
   static Handle<WasmCapiFunction> New(
       Isolate* isolate, Address call_target, Handle<Foreign> embedder_data,
       Handle<PodArray<wasm::ValueType>> serialized_signature);
 
-  PodArray<wasm::ValueType> GetSerializedSignature() const;
+  Tagged<PodArray<wasm::ValueType>> GetSerializedSignature() const;
   // Checks whether the given {sig} has the same parameter types as the
   // serialized signature stored within this C-API function object.
   bool MatchesSignature(uint32_t other_canonical_sig_index) const;
@@ -676,7 +720,7 @@ class WasmCapiFunction : public JSFunction {
 // // TODO(wasm): Potentially {WasmCapiFunction} will be added here as well.
 class WasmExternalFunction : public JSFunction {
  public:
-  static bool IsWasmExternalFunction(Object object);
+  static bool IsWasmExternalFunction(Tagged<Object> object);
 
   DECL_CAST(WasmExternalFunction)
   OBJECT_CONSTRUCTORS(WasmExternalFunction, JSFunction);
@@ -686,22 +730,32 @@ class WasmIndirectFunctionTable
     : public TorqueGeneratedWasmIndirectFunctionTable<WasmIndirectFunctionTable,
                                                       Struct> {
  public:
-  DECL_PRIMITIVE_ACCESSORS(sig_ids, uint32_t*)
-  DECL_PRIMITIVE_ACCESSORS(targets, Address*)
-  DECL_OPTIONAL_ACCESSORS(managed_native_allocations, Foreign)
+  DECL_ACCESSORS(sig_ids, Tagged<FixedUInt32Array>)
+  // When the sandbox is enabled, this array holds indices into the external
+  // pointer table that contain the function entrypoint. Otherwise, this array
+  // directly contains the entrypoint pointers.
+  // TODO(chromium:1395058): consider instead turning this entire structure into
+  // a pointer table entry. For example, we could create a WasmCodePointerTable
+  // where each entry contains the signature, the target, and the ref
+  // object. Then the WasmIndirectFunctionTable object would simply contain an
+  // array of indices into a WasmCodePointerTable. This way, we can also
+  // guarantee that an attacker cannot for example modify the signature
+  // associated with a target function.
+  DECL_ACCESSORS(targets, Tagged<ExternalPointerArray>)
 
   V8_EXPORT_PRIVATE static Handle<WasmIndirectFunctionTable> New(
       Isolate* isolate, uint32_t size);
   static void Resize(Isolate* isolate, Handle<WasmIndirectFunctionTable> table,
                      uint32_t new_size);
   V8_EXPORT_PRIVATE void Set(uint32_t index, int sig_id, Address call_target,
-                             Object ref);
+                             Tagged<Object> ref);
   void Clear(uint32_t index);
 
   DECL_PRINTER(WasmIndirectFunctionTable)
 
-  static_assert(kStartOfStrongFieldsOffset == kManagedNativeAllocationsOffset);
-  using BodyDescriptor = FlexibleBodyDescriptor<kStartOfStrongFieldsOffset>;
+  using BodyDescriptor =
+      FixedBodyDescriptor<kStartOfStrongFieldsOffset, kEndOfStrongFieldsOffset,
+                          kHeaderSize>;
 
   TQ_OBJECT_CONSTRUCTORS(WasmIndirectFunctionTable)
 };
@@ -709,7 +763,7 @@ class WasmIndirectFunctionTable
 class WasmFunctionData
     : public TorqueGeneratedWasmFunctionData<WasmFunctionData, HeapObject> {
  public:
-  DECL_ACCESSORS(internal, WasmInternalFunction)
+  DECL_ACCESSORS(internal, Tagged<WasmInternalFunction>)
 
   DECL_PRINTER(WasmFunctionData)
 
@@ -745,6 +799,26 @@ class WasmApiFunctionRef
  public:
   // Dispatched behavior.
   DECL_PRINTER(WasmApiFunctionRef)
+  static constexpr int kInvalidCallOrigin = 0;
+
+  static void SetImportIndexAsCallOrigin(Handle<WasmApiFunctionRef> ref,
+                                         int entry_index);
+
+  static bool CallOriginIsImportIndex(Handle<Object> call_origin);
+
+  static bool CallOriginIsIndexInTable(Handle<Object> call_origin);
+
+  static int CallOriginAsIndex(Handle<Object> call_origin);
+
+  static void SetIndexInTableAsCallOrigin(Handle<WasmApiFunctionRef> ref,
+                                          int entry_index);
+
+  static void SetCrossInstanceTableIndexAsCallOrigin(
+      Isolate* isolate, Handle<WasmApiFunctionRef> ref,
+      Handle<WasmInstanceObject> instance, int entry_index);
+
+  static void SetInternalFunctionAsCallOrigin(
+      Handle<WasmApiFunctionRef> ref, Handle<WasmInternalFunction> internal);
 
   class BodyDescriptor;
 
@@ -760,6 +834,9 @@ class WasmInternalFunction
   static MaybeHandle<WasmInternalFunction> FromExternal(Handle<Object> external,
                                                         Isolate* isolate);
 
+  V8_EXPORT_PRIVATE static Handle<JSFunction> GetOrCreateExternal(
+      Handle<WasmInternalFunction> internal);
+
   DECL_EXTERNAL_POINTER_ACCESSORS(call_target, Address)
 
   // Dispatched behavior.
@@ -768,6 +845,10 @@ class WasmInternalFunction
   class BodyDescriptor;
 
   TQ_OBJECT_CONSTRUCTORS(WasmInternalFunction)
+ private:
+  // Make this private so it is not use by accident. Use {GetOrCreateExternal}
+  // instead.
+  Tagged<HeapObject> external();
 };
 
 // Information for a WasmJSFunction which is referenced as the function data of
@@ -777,7 +858,7 @@ class WasmJSFunctionData
     : public TorqueGeneratedWasmJSFunctionData<WasmJSFunctionData,
                                                WasmFunctionData> {
  public:
-  DECL_ACCESSORS(wasm_to_js_wrapper_code, Code)
+  DECL_ACCESSORS(wasm_to_js_wrapper_code, Tagged<Code>)
 
   // Dispatched behavior.
   DECL_PRINTER(WasmJSFunctionData)
@@ -855,7 +936,7 @@ class WasmScript : public AllStatic {
                                                     int breakpoint_id);
 
   // Remove all set breakpoints.
-  static void ClearAllBreakpoints(Script);
+  static void ClearAllBreakpoints(Tagged<Script>);
 
   // Get a list of all possible breakpoints within a given range of this module.
   V8_EXPORT_PRIVATE static bool GetPossibleBreakpoints(
@@ -936,20 +1017,21 @@ class WasmObject : public TorqueGeneratedWasmObject<WasmObject, JSReceiver> {
 
  private:
   template <typename ElementType>
-  static ElementType FromNumber(Object value);
+  static ElementType FromNumber(Tagged<Object> value);
 
   TQ_OBJECT_CONSTRUCTORS(WasmObject)
 };
 
 class WasmStruct : public TorqueGeneratedWasmStruct<WasmStruct, WasmObject> {
  public:
-  static inline wasm::StructType* type(Map map);
+  static inline wasm::StructType* type(Tagged<Map> map);
   inline wasm::StructType* type() const;
-  static inline wasm::StructType* GcSafeType(Map map);
+  static inline wasm::StructType* GcSafeType(Tagged<Map> map);
   static inline int Size(const wasm::StructType* type);
-  static inline int GcSafeSize(Map map);
-  static inline void EncodeInstanceSizeInMap(int instance_size, Map map);
-  static inline int DecodeInstanceSizeFromMap(Map map);
+  static inline int GcSafeSize(Tagged<Map> map);
+  static inline void EncodeInstanceSizeInMap(int instance_size,
+                                             Tagged<Map> map);
+  static inline int DecodeInstanceSizeFromMap(Tagged<Map> map);
 
   // Returns the address of the field at given offset.
   inline Address RawFieldAddress(int raw_offset);
@@ -976,16 +1058,16 @@ class WasmStruct : public TorqueGeneratedWasmStruct<WasmStruct, WasmObject> {
 
 class WasmArray : public TorqueGeneratedWasmArray<WasmArray, WasmObject> {
  public:
-  static inline wasm::ArrayType* type(Map map);
+  static inline wasm::ArrayType* type(Tagged<Map> map);
   inline wasm::ArrayType* type() const;
-  static inline wasm::ArrayType* GcSafeType(Map map);
+  static inline wasm::ArrayType* GcSafeType(Tagged<Map> map);
 
   // Get the {ObjectSlot} corresponding to the element at {index}. Requires that
   // this is a reference array.
   inline ObjectSlot ElementSlot(uint32_t index);
   V8_EXPORT_PRIVATE wasm::WasmValue GetElement(uint32_t index);
 
-  static inline int SizeFor(Map map, int length);
+  static inline int SizeFor(Tagged<Map> map, int length);
 
   // Returns boxed value of the array's element.
   static inline Handle<Object> GetElement(Isolate* isolate,
@@ -1010,8 +1092,8 @@ class WasmArray : public TorqueGeneratedWasmArray<WasmArray, WasmObject> {
     return MaxLength(type->element_type().value_kind_size());
   }
 
-  static inline void EncodeElementSizeInMap(int element_size, Map map);
-  static inline int DecodeElementSizeFromMap(Map map);
+  static inline void EncodeElementSizeInMap(int element_size, Tagged<Map> map);
+  static inline int DecodeElementSizeFromMap(Tagged<Map> map);
 
   DECL_PRINTER(WasmArray)
 
@@ -1055,23 +1137,28 @@ class WasmSuspenderObject
  public:
   enum State : int { kInactive = 0, kActive, kSuspended };
   static Handle<WasmSuspenderObject> New(Isolate* isolate);
-  // TODO(thibaudm): returnPromiseOnSuspend & suspendOnReturnedPromise.
   DECL_PRINTER(WasmSuspenderObject)
+  using BodyDescriptor =
+      FixedBodyDescriptor<kStartOfStrongFieldsOffset, kEndOfStrongFieldsOffset,
+                          kHeaderSize>;
   TQ_OBJECT_CONSTRUCTORS(WasmSuspenderObject)
 };
 
 class WasmNull : public TorqueGeneratedWasmNull<WasmNull, HeapObject> {
  public:
-#if V8_STATIC_ROOTS_BOOL || V8_STATIC_ROOT_GENERATION_BOOL
+#if V8_STATIC_ROOTS_BOOL || V8_STATIC_ROOTS_GENERATION_BOOL
   // TODO(manoskouk): Make it smaller if able and needed.
   static constexpr int kSize = 64 * KB + kTaggedSize;
   // Payload should be a multiple of page size.
   static_assert((kSize - kTaggedSize) % kMinimumOSPageSize == 0);
   // Any wasm struct offset should fit in the object.
-  static_assert(kSize >= WasmStruct::kHeaderSize +
-                             wasm::kV8MaxWasmStructFields * kSimd128Size);
+  static_assert(kSize >=
+                WasmStruct::kHeaderSize +
+                    (wasm::kMaxStructFieldIndexForImplicitNullCheck + 1) *
+                        kSimd128Size);
 
   Address payload() { return ptr() + kHeaderSize - kHeapObjectTag; }
+  static constexpr size_t kPayloadSize = kSize - kTaggedSize;
 #else
   static constexpr int kSize = kTaggedSize;
 #endif
@@ -1082,6 +1169,9 @@ class WasmNull : public TorqueGeneratedWasmNull<WasmNull, HeapObject> {
 
 #undef DECL_OPTIONAL_ACCESSORS
 
+Handle<Map> CreateFuncRefMap(Isolate* isolate, Handle<Map> opt_rtt_parent,
+                             Handle<WasmInstanceObject> opt_instance);
+
 namespace wasm {
 // Takes a {value} in the JS representation and typechecks it according to
 // {expected}. If the typecheck succeeds, returns the wasm representation of the
@@ -1095,11 +1185,10 @@ MaybeHandle<Object> JSToWasmObject(Isolate* isolate, const WasmModule* module,
                                    Handle<Object> value, ValueType expected,
                                    const char** error_message);
 
-// Takes a {value} in the Wasm representation and tries to transform it to the
-// respective JS representation. If the transformation fails, the empty handle
-// is returned.
-MaybeHandle<Object> WasmToJSObject(Isolate* isolate, Handle<Object> value,
-                                   HeapType type, const char** error_message);
+// Takes a {value} in the Wasm representation and transforms it to the
+// respective JS representation. The caller is responsible for not providing an
+// object which cannot be transformed to JS.
+Handle<Object> WasmToJSObject(Isolate* isolate, Handle<Object> value);
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/src/wasm/wasm-objects.tq b/deps/v8/src/wasm/wasm-objects.tq
index ea72ccb95e91de..806cbb11bb4fe3 100644
--- a/deps/v8/src/wasm/wasm-objects.tq
+++ b/deps/v8/src/wasm/wasm-objects.tq
@@ -24,6 +24,10 @@ extern class WasmApiFunctionRef extends HeapObject {
   // to load memory start/size fields.
   instance: WasmInstanceObject|Undefined;
   suspend: Smi;  // Boolean.
+  wrapper_budget: Smi;
+  call_origin: Smi|WasmInternalFunction|Tuple2;
+  // The signature is needed for the generic wasm-to-js wrapper.
+  sig: PodArrayOfWasmValueType;
 }
 
 // This is the representation that is used internally by wasm to represent
@@ -40,6 +44,8 @@ extern class WasmInternalFunction extends HeapObject {
   external: JSFunction|Undefined;
   // This field is used when the call target is null.
   code: Code;
+  // The function index if ref is a WasmInstanceObject, -1 otherwise.
+  function_index: Smi;
   // The call target. Tagged with the kWasmInternalFunctionCallTargetTag
   call_target: ExternalPointer;
 }
@@ -71,9 +77,10 @@ extern class WasmExportedFunctionData extends WasmFunctionData {
   sig: ExternalPointer;  // wasm::FunctionSig*
 }
 
+extern operator '.sig_ptr' macro LoadWasmExportedFunctionDataSigPtr(
+    WasmExportedFunctionData): RawPtr;
+
 extern class WasmJSFunctionData extends WasmFunctionData {
-  serialized_return_count: Smi;
-  serialized_parameter_count: Smi;
   serialized_signature: PodArrayOfWasmValueType;
 }
 
@@ -88,13 +95,12 @@ extern class WasmResumeData extends HeapObject {
 }
 
 extern class WasmIndirectFunctionTable extends Struct {
+  sig_ids: ByteArray;
+  targets: ExternalPointerArray;
+  refs: FixedArray;
   size: uint32;
   @if(TAGGED_SIZE_8_BYTES) optional_padding: uint32;
   @ifnot(TAGGED_SIZE_8_BYTES) optional_padding: void;
-  sig_ids: RawPtr;
-  targets: RawPtr;
-  managed_native_allocations: Foreign|Undefined;
-  refs: FixedArray;
 }
 
 extern class WasmContinuationObject extends HeapObject {
@@ -106,9 +112,16 @@ extern class WasmContinuationObject extends HeapObject {
 extern class WasmSuspenderObject extends JSObject {
   continuation: WasmContinuationObject|Undefined;
   parent: WasmSuspenderObject|Undefined;
+  promise: JSPromise;
   resume: JSObject|Undefined;
   reject: JSObject|Undefined;
   state: Smi;  // 0: Inactive, 1: Active, 2: Suspended.
+  // Number of Wasm-to-JS frames in this suspender's stack.
+  // If the value is non-zero, this means that there are JS frames on the stack
+  // and trying to suspend should trap.
+  wasm_to_js_counter: uint32;
+  @if(TAGGED_SIZE_8_BYTES) optional_padding: uint32;
+  @ifnot(TAGGED_SIZE_8_BYTES) optional_padding: void;
 }
 
 extern class WasmExceptionTag extends Struct {
@@ -157,7 +170,7 @@ extern class WasmGlobalObject extends JSObject {
   tagged_buffer: FixedArray|Undefined;
   offset: Smi;
   raw_type: Smi;
-  // TODO(7748): If we encode mutability in raw_type, turn this into a boolean
+  // TODO(14034): If we encode mutability in raw_type, turn this into a boolean
   // accessor.
   is_mutable: Smi;
 }
@@ -188,7 +201,8 @@ extern class WasmTypeInfo extends HeapObject {
   type_index: uint32;
   @if(TAGGED_SIZE_8_BYTES) optional_padding: uint32;
   @ifnot(TAGGED_SIZE_8_BYTES) optional_padding: void;
-  instance: WasmInstanceObject;
+  // Is undefined for WasmExternalFunctions referring to WasmJSFunctions.
+  instance: WasmInstanceObject|Undefined;
   const supertypes_length: Smi;
   supertypes[supertypes_length]: Object;
 }
@@ -198,12 +212,10 @@ extern operator '.native_type_ptr' macro LoadWasmTypeInfoNativeTypePtr(
 
 // WasmObject corresponds to data ref types which are WasmStruct and WasmArray.
 @abstract
-extern class WasmObject extends JSReceiver {
-}
+extern class WasmObject extends JSReceiver {}
 
 @highestInstanceTypeWithinParentClassRange
-extern class WasmStruct extends WasmObject {
-}
+extern class WasmStruct extends WasmObject {}
 
 @lowestInstanceTypeWithinParentClassRange
 extern class WasmArray extends WasmObject {
diff --git a/deps/v8/src/wasm/wasm-opcodes-inl.h b/deps/v8/src/wasm/wasm-opcodes-inl.h
index 1b1c9ae2382dff..42c71aa262a501 100644
--- a/deps/v8/src/wasm/wasm-opcodes-inl.h
+++ b/deps/v8/src/wasm/wasm-opcodes-inl.h
@@ -23,8 +23,8 @@ namespace wasm {
 // static
 constexpr const char* WasmOpcodes::OpcodeName(WasmOpcode opcode) {
   switch (opcode) {
-#define CASE(opcode, binary, sig, name) \
-  case kExpr##opcode:                   \
+#define CASE(opcode, binary, sig, name, ...) \
+  case kExpr##opcode:                        \
     return name;
     FOREACH_OPCODE(CASE)
 #undef CASE
@@ -136,7 +136,7 @@ constexpr bool WasmOpcodes::IsRelaxedSimdOpcode(WasmOpcode opcode) {
   return (opcode & 0xfff00) == 0xfd100;
 }
 
-constexpr byte WasmOpcodes::ExtractPrefix(WasmOpcode opcode) {
+constexpr uint8_t WasmOpcodes::ExtractPrefix(WasmOpcode opcode) {
   // See comment on {WasmOpcode} for the encoding.
   return (opcode > 0xffff) ? opcode >> 12 : opcode >> 8;
 }
@@ -144,7 +144,7 @@ constexpr byte WasmOpcodes::ExtractPrefix(WasmOpcode opcode) {
 namespace impl {
 
 #define DECLARE_SIG_ENUM(name, ...) kSigEnum_##name,
-enum WasmOpcodeSig : byte {
+enum WasmOpcodeSig : uint8_t {
   kSigEnum_None,
   FOREACH_SIGNATURE(DECLARE_SIG_ENUM)
 };
@@ -163,40 +163,48 @@ constexpr const FunctionSig* kCachedSigs[] = {
     nullptr, FOREACH_SIGNATURE(DECLARE_SIG_ENTRY)};
 #undef DECLARE_SIG_ENTRY
 
-constexpr WasmOpcodeSig GetShortOpcodeSigIndex(byte opcode) {
+constexpr WasmOpcodeSig GetShortOpcodeSigIndex(uint8_t opcode) {
 #define CASE(name, opc, sig, ...) opcode == opc ? kSigEnum_##sig:
   return FOREACH_SIMPLE_OPCODE(CASE) FOREACH_SIMPLE_PROTOTYPE_OPCODE(CASE)
       kSigEnum_None;
 #undef CASE
 }
 
-constexpr WasmOpcodeSig GetAsmJsOpcodeSigIndex(byte opcode) {
+constexpr WasmOpcodeSig GetAsmJsOpcodeSigIndex(uint8_t opcode) {
 #define CASE(name, opc, sig, ...) opcode == opc ? kSigEnum_##sig:
   return FOREACH_ASMJS_COMPAT_OPCODE(CASE) kSigEnum_None;
 #undef CASE
 }
 
-constexpr WasmOpcodeSig GetSimdOpcodeSigIndex(byte opcode) {
+constexpr WasmOpcodeSig GetSimdOpcodeSigIndex(uint8_t opcode) {
 #define CASE(name, opc, sig, ...) opcode == (opc & 0xFF) ? kSigEnum_##sig:
   return FOREACH_SIMD_MVP_0_OPERAND_OPCODE(CASE) FOREACH_SIMD_MEM_OPCODE(CASE)
       FOREACH_SIMD_MEM_1_OPERAND_OPCODE(CASE) kSigEnum_None;
 #undef CASE
 }
 
-constexpr WasmOpcodeSig GetRelaxedSimdOpcodeSigIndex(byte opcode) {
+constexpr WasmOpcodeSig GetRelaxedSimdOpcodeSigIndex(uint8_t opcode) {
 #define CASE(name, opc, sig, ...) opcode == (opc & 0xFF) ? kSigEnum_##sig:
   return FOREACH_RELAXED_SIMD_OPCODE(CASE) kSigEnum_None;
 #undef CASE
 }
 
-constexpr WasmOpcodeSig GetAtomicOpcodeSigIndex(byte opcode) {
+constexpr WasmOpcodeSig GetAtomicOpcodeMem32SigIndex(uint8_t opcode) {
 #define CASE(name, opc, sig, ...) opcode == (opc & 0xFF) ? kSigEnum_##sig:
   return FOREACH_ATOMIC_OPCODE(CASE) FOREACH_ATOMIC_0_OPERAND_OPCODE(CASE)
       kSigEnum_None;
 #undef CASE
 }
 
-constexpr WasmOpcodeSig GetNumericOpcodeSigIndex(byte opcode) {
+constexpr WasmOpcodeSig GetAtomicOpcodeMem64SigIndex(uint8_t opcode) {
+#define CASE(name, opc, sig32, text, sig64) \
+  opcode == (opc & 0xFF) ? kSigEnum_##sig64:
+  return FOREACH_ATOMIC_OPCODE(CASE) FOREACH_ATOMIC_0_OPERAND_OPCODE(CASE)
+      kSigEnum_None;
+#undef CASE
+}
+
+constexpr WasmOpcodeSig GetNumericOpcodeSigIndex(uint8_t opcode) {
 #define CASE(name, opc, sig, ...) opcode == (opc & 0xFF) ? kSigEnum_##sig:
   return FOREACH_NUMERIC_OPCODE_WITH_SIG(CASE) kSigEnum_None;
 #undef CASE
@@ -210,8 +218,10 @@ constexpr std::array<WasmOpcodeSig, 256> kSimdExprSigTable =
     base::make_array<256>(GetSimdOpcodeSigIndex);
 constexpr std::array<WasmOpcodeSig, 256> kRelaxedSimdExprSigTable =
     base::make_array<256>(GetRelaxedSimdOpcodeSigIndex);
-constexpr std::array<WasmOpcodeSig, 256> kAtomicExprSigTable =
-    base::make_array<256>(GetAtomicOpcodeSigIndex);
+constexpr std::array<WasmOpcodeSig, 256> kAtomicExprSigTableMem32 =
+    base::make_array<256>(GetAtomicOpcodeMem32SigIndex);
+constexpr std::array<WasmOpcodeSig, 256> kAtomicExprSigTableMem64 =
+    base::make_array<256>(GetAtomicOpcodeMem64SigIndex);
 constexpr std::array<WasmOpcodeSig, 256> kNumericExprSigTable =
     base::make_array<256>(GetNumericOpcodeSigIndex);
 
@@ -234,8 +244,6 @@ constexpr const FunctionSig* WasmOpcodes::Signature(WasmOpcode opcode) {
       }
       return nullptr;
     }
-    case kAtomicPrefix:
-      return impl::kCachedSigs[impl::kAtomicExprSigTable[opcode & 0xff]];
     case kNumericPrefix:
       return impl::kCachedSigs[impl::kNumericExprSigTable[opcode & 0xff]];
     default:
@@ -243,6 +251,15 @@ constexpr const FunctionSig* WasmOpcodes::Signature(WasmOpcode opcode) {
   }
 }
 
+constexpr const FunctionSig* WasmOpcodes::SignatureForAtomicOp(
+    WasmOpcode opcode, bool is_memory64) {
+  if (is_memory64) {
+    return impl::kCachedSigs[impl::kAtomicExprSigTableMem64[opcode & 0xff]];
+  } else {
+    return impl::kCachedSigs[impl::kAtomicExprSigTableMem32[opcode & 0xff]];
+  }
+}
+
 constexpr const FunctionSig* WasmOpcodes::AsmjsSignature(WasmOpcode opcode) {
   DCHECK_GT(impl::kSimpleAsmjsExprSigTable.size(), opcode);
   return impl::kCachedSigs[impl::kSimpleAsmjsExprSigTable[opcode]];
diff --git a/deps/v8/src/wasm/wasm-opcodes.cc b/deps/v8/src/wasm/wasm-opcodes.cc
index a30eadab44c59e..d12432b0849bf3 100644
--- a/deps/v8/src/wasm/wasm-opcodes.cc
+++ b/deps/v8/src/wasm/wasm-opcodes.cc
@@ -30,11 +30,9 @@ std::ostream& operator<<(std::ostream& os, const FunctionSig& sig) {
 
 bool IsJSCompatibleSignature(const FunctionSig* sig) {
   for (auto type : sig->all()) {
-    // Structs and arrays may only be passed via externref.
-    // Rtts are implicit and can not be used explicitly.
-    if (type == kWasmS128 || type.is_rtt()) {
-      return false;
-    }
+    // Rtts are internal-only. They should never be part of a signature.
+    DCHECK(!type.is_rtt());
+    if (type == kWasmS128) return false;
     if (type.is_object_reference()) {
       switch (type.heap_type().representation()) {
         case HeapType::kStringViewWtf8:
diff --git a/deps/v8/src/wasm/wasm-opcodes.h b/deps/v8/src/wasm/wasm-opcodes.h
index 6d55228f8de564..9cb85ab54f408e 100644
--- a/deps/v8/src/wasm/wasm-opcodes.h
+++ b/deps/v8/src/wasm/wasm-opcodes.h
@@ -31,26 +31,26 @@ V8_EXPORT_PRIVATE bool IsJSCompatibleSignature(const FunctionSig* sig);
 // Format of all opcode macros: kExprName, binary, signature, wat name
 
 // Control expressions and blocks.
-#define FOREACH_CONTROL_OPCODE(V)                              \
-  V(Unreachable, 0x00, _, "unreachable")                       \
-  V(Nop, 0x01, _, "nop")                                       \
-  V(Block, 0x02, _, "block")                                   \
-  V(Loop, 0x03, _, "loop")                                     \
-  V(If, 0x04, _, "if")                                         \
-  V(Else, 0x05, _, "else")                                     \
-  V(Try, 0x06, _, "try")                                       \
-  V(Catch, 0x07, _, "catch")                                   \
-  V(Throw, 0x08, _, "throw")                                   \
-  V(Rethrow, 0x09, _, "rethrow")                               \
-  V(End, 0x0b, _, "end")                                       \
-  V(Br, 0x0c, _, "br")                                         \
-  V(BrIf, 0x0d, _, "br_if")                                    \
-  V(BrTable, 0x0e, _, "br_table")                              \
-  V(Return, 0x0f, _, "return")                                 \
-  V(Delegate, 0x18, _, "delegate")                             \
-  V(CatchAll, 0x19, _, "catch_all")                            \
-  V(BrOnNull, 0xd4, _, "br_on_null")        /* gc prototype */ \
-  V(BrOnNonNull, 0xd6, _, "br_on_non_null") /* gc prototype */ \
+#define FOREACH_CONTROL_OPCODE(V) /* 80 columns                             */ \
+  V(Unreachable, 0x00, _, "unreachable")                                       \
+  V(Nop, 0x01, _, "nop")                                                       \
+  V(Block, 0x02, _, "block")                                                   \
+  V(Loop, 0x03, _, "loop")                                                     \
+  V(If, 0x04, _, "if")                                                         \
+  V(Else, 0x05, _, "else")                                                     \
+  V(Try, 0x06, _, "try")                                                       \
+  V(Catch, 0x07, _, "catch")                                                   \
+  V(Throw, 0x08, _, "throw")                                                   \
+  V(Rethrow, 0x09, _, "rethrow")                                               \
+  V(End, 0x0b, _, "end")                                                       \
+  V(Br, 0x0c, _, "br")                                                         \
+  V(BrIf, 0x0d, _, "br_if")                                                    \
+  V(BrTable, 0x0e, _, "br_table")                                              \
+  V(Return, 0x0f, _, "return")                                                 \
+  V(Delegate, 0x18, _, "delegate")                                             \
+  V(CatchAll, 0x19, _, "catch_all")                                            \
+  V(BrOnNull, 0xd4, _, "br_on_null")        /* typed_funcref prototype */      \
+  V(BrOnNonNull, 0xd6, _, "br_on_non_null") /* typed_funcref prototype */      \
   V(NopForTestingUnsupportedInLiftoff, 0x16, _, "nop_for_testing")
 
 // Constants, locals, globals, and calls.
@@ -610,77 +610,83 @@ V8_EXPORT_PRIVATE bool IsJSCompatibleSignature(const FunctionSig* sig);
 #define FOREACH_NUMERIC_OPCODE(V) \
   FOREACH_NUMERIC_OPCODE_WITH_SIG(V) FOREACH_NUMERIC_OPCODE_VARIADIC(V)
 
+// kExprName, binary, signature for memory32, wat name, signature for memory64.
 #define FOREACH_ATOMIC_OPCODE(V)                                              \
-  V(AtomicNotify, 0xfe00, i_ii, "memory.atomic.notify")                       \
-  V(I32AtomicWait, 0xfe01, i_iil, "memory.atomic.wait32")                     \
-  V(I64AtomicWait, 0xfe02, i_ill, "memory.atomic.wait64")                     \
-  V(I32AtomicLoad, 0xfe10, i_i, "i32.atomic.load")                            \
-  V(I64AtomicLoad, 0xfe11, l_i, "i64.atomic.load")                            \
-  V(I32AtomicLoad8U, 0xfe12, i_i, "i32.atomic.load8_u")                       \
-  V(I32AtomicLoad16U, 0xfe13, i_i, "i32.atomic.load16_u")                     \
-  V(I64AtomicLoad8U, 0xfe14, l_i, "i64.atomic.load8_u")                       \
-  V(I64AtomicLoad16U, 0xfe15, l_i, "i64.atomic.load16_u")                     \
-  V(I64AtomicLoad32U, 0xfe16, l_i, "i64.atomic.load32_u")                     \
-  V(I32AtomicStore, 0xfe17, v_ii, "i32.atomic.store")                         \
-  V(I64AtomicStore, 0xfe18, v_il, "i64.atomic.store")                         \
-  V(I32AtomicStore8U, 0xfe19, v_ii, "i32.atomic.store8")                      \
-  V(I32AtomicStore16U, 0xfe1a, v_ii, "i32.atomic.store16")                    \
-  V(I64AtomicStore8U, 0xfe1b, v_il, "i64.atomic.store8")                      \
-  V(I64AtomicStore16U, 0xfe1c, v_il, "i64.atomic.store16")                    \
-  V(I64AtomicStore32U, 0xfe1d, v_il, "i64.atomic.store32")                    \
-  V(I32AtomicAdd, 0xfe1e, i_ii, "i32.atomic.rmw.add")                         \
-  V(I64AtomicAdd, 0xfe1f, l_il, "i64.atomic.rmw.add")                         \
-  V(I32AtomicAdd8U, 0xfe20, i_ii, "i32.atomic.rmw8.add_u")                    \
-  V(I32AtomicAdd16U, 0xfe21, i_ii, "i32.atomic.rmw16.add_u")                  \
-  V(I64AtomicAdd8U, 0xfe22, l_il, "i64.atomic.rmw8.add_u")                    \
-  V(I64AtomicAdd16U, 0xfe23, l_il, "i64.atomic.rmw16.add_u")                  \
-  V(I64AtomicAdd32U, 0xfe24, l_il, "i64.atomic.rmw32.add_u")                  \
-  V(I32AtomicSub, 0xfe25, i_ii, "i32.atomic.rmw.sub")                         \
-  V(I64AtomicSub, 0xfe26, l_il, "i64.atomic.rmw.sub")                         \
-  V(I32AtomicSub8U, 0xfe27, i_ii, "i32.atomic.rmw8.sub_u")                    \
-  V(I32AtomicSub16U, 0xfe28, i_ii, "i32.atomic.rmw16.sub_u")                  \
-  V(I64AtomicSub8U, 0xfe29, l_il, "i64.atomic.rmw8.sub_u")                    \
-  V(I64AtomicSub16U, 0xfe2a, l_il, "i64.atomic.rmw16.sub_u")                  \
-  V(I64AtomicSub32U, 0xfe2b, l_il, "i64.atomic.rmw32.sub_u")                  \
-  V(I32AtomicAnd, 0xfe2c, i_ii, "i32.atomic.rmw.and")                         \
-  V(I64AtomicAnd, 0xfe2d, l_il, "i64.atomic.rmw.and")                         \
-  V(I32AtomicAnd8U, 0xfe2e, i_ii, "i32.atomic.rmw8.and_u")                    \
-  V(I32AtomicAnd16U, 0xfe2f, i_ii, "i32.atomic.rmw16.and_u")                  \
-  V(I64AtomicAnd8U, 0xfe30, l_il, "i64.atomic.rmw8.and_u")                    \
-  V(I64AtomicAnd16U, 0xfe31, l_il, "i64.atomic.rmw16.and_u")                  \
-  V(I64AtomicAnd32U, 0xfe32, l_il, "i64.atomic.rmw32.and_u")                  \
-  V(I32AtomicOr, 0xfe33, i_ii, "i32.atomic.rmw.or")                           \
-  V(I64AtomicOr, 0xfe34, l_il, "i64.atomic.rmw.or")                           \
-  V(I32AtomicOr8U, 0xfe35, i_ii, "i32.atomic.rmw8.or_u")                      \
-  V(I32AtomicOr16U, 0xfe36, i_ii, "i32.atomic.rmw16.or_u")                    \
-  V(I64AtomicOr8U, 0xfe37, l_il, "i64.atomic.rmw8.or_u")                      \
-  V(I64AtomicOr16U, 0xfe38, l_il, "i64.atomic.rmw16.or_u")                    \
-  V(I64AtomicOr32U, 0xfe39, l_il, "i64.atomic.rmw32.or_u")                    \
-  V(I32AtomicXor, 0xfe3a, i_ii, "i32.atomic.rmw.xor")                         \
-  V(I64AtomicXor, 0xfe3b, l_il, "i64.atomic.rmw.xor")                         \
-  V(I32AtomicXor8U, 0xfe3c, i_ii, "i32.atomic.rmw8.xor_u")                    \
-  V(I32AtomicXor16U, 0xfe3d, i_ii, "i32.atomic.rmw16.xor_u")                  \
-  V(I64AtomicXor8U, 0xfe3e, l_il, "i64.atomic.rmw8.xor_u")                    \
-  V(I64AtomicXor16U, 0xfe3f, l_il, "i64.atomic.rmw16.xor_u")                  \
-  V(I64AtomicXor32U, 0xfe40, l_il, "i64.atomic.rmw32.xor_u")                  \
-  V(I32AtomicExchange, 0xfe41, i_ii, "i32.atomic.rmw.xchg")                   \
-  V(I64AtomicExchange, 0xfe42, l_il, "i64.atomic.rmw.xchg")                   \
-  V(I32AtomicExchange8U, 0xfe43, i_ii, "i32.atomic.rmw8.xchg_u")              \
-  V(I32AtomicExchange16U, 0xfe44, i_ii, "i32.atomic.rmw16.xchg_u")            \
-  V(I64AtomicExchange8U, 0xfe45, l_il, "i64.atomic.rmw8.xchg_u")              \
-  V(I64AtomicExchange16U, 0xfe46, l_il, "i64.atomic.rmw16.xchg_u")            \
-  V(I64AtomicExchange32U, 0xfe47, l_il, "i64.atomic.rmw32.xchg_u")            \
-  V(I32AtomicCompareExchange, 0xfe48, i_iii, "i32.atomic.rmw.cmpxchg")        \
-  V(I64AtomicCompareExchange, 0xfe49, l_ill, "i64.atomic.rmw.cmpxchg")        \
-  V(I32AtomicCompareExchange8U, 0xfe4a, i_iii, "i32.atomic.rmw8.cmpxchg_u")   \
-  V(I32AtomicCompareExchange16U, 0xfe4b, i_iii, "i32.atomic.rmw16.cmpxchg_u") \
-  V(I64AtomicCompareExchange8U, 0xfe4c, l_ill, "i64.atomic.rmw8.cmpxchg_u")   \
-  V(I64AtomicCompareExchange16U, 0xfe4d, l_ill, "i64.atomic.rmw16.cmpxchg_u") \
-  V(I64AtomicCompareExchange32U, 0xfe4e, l_ill, "i64.atomic.rmw32.cmpxchg_u")
+  V(AtomicNotify, 0xfe00, i_ii, "memory.atomic.notify", i_li)                 \
+  V(I32AtomicWait, 0xfe01, i_iil, "memory.atomic.wait32", i_lil)              \
+  V(I64AtomicWait, 0xfe02, i_ill, "memory.atomic.wait64", i_lll)              \
+  V(I32AtomicLoad, 0xfe10, i_i, "i32.atomic.load", i_l)                       \
+  V(I64AtomicLoad, 0xfe11, l_i, "i64.atomic.load", l_l)                       \
+  V(I32AtomicLoad8U, 0xfe12, i_i, "i32.atomic.load8_u", i_l)                  \
+  V(I32AtomicLoad16U, 0xfe13, i_i, "i32.atomic.load16_u", i_l)                \
+  V(I64AtomicLoad8U, 0xfe14, l_i, "i64.atomic.load8_u", l_l)                  \
+  V(I64AtomicLoad16U, 0xfe15, l_i, "i64.atomic.load16_u", l_l)                \
+  V(I64AtomicLoad32U, 0xfe16, l_i, "i64.atomic.load32_u", l_l)                \
+  V(I32AtomicStore, 0xfe17, v_ii, "i32.atomic.store", v_li)                   \
+  V(I64AtomicStore, 0xfe18, v_il, "i64.atomic.store", v_ll)                   \
+  V(I32AtomicStore8U, 0xfe19, v_ii, "i32.atomic.store8", v_li)                \
+  V(I32AtomicStore16U, 0xfe1a, v_ii, "i32.atomic.store16", v_li)              \
+  V(I64AtomicStore8U, 0xfe1b, v_il, "i64.atomic.store8", v_ll)                \
+  V(I64AtomicStore16U, 0xfe1c, v_il, "i64.atomic.store16", v_ll)              \
+  V(I64AtomicStore32U, 0xfe1d, v_il, "i64.atomic.store32", v_ll)              \
+  V(I32AtomicAdd, 0xfe1e, i_ii, "i32.atomic.rmw.add", i_li)                   \
+  V(I64AtomicAdd, 0xfe1f, l_il, "i64.atomic.rmw.add", l_ll)                   \
+  V(I32AtomicAdd8U, 0xfe20, i_ii, "i32.atomic.rmw8.add_u", i_li)              \
+  V(I32AtomicAdd16U, 0xfe21, i_ii, "i32.atomic.rmw16.add_u", i_li)            \
+  V(I64AtomicAdd8U, 0xfe22, l_il, "i64.atomic.rmw8.add_u", l_ll)              \
+  V(I64AtomicAdd16U, 0xfe23, l_il, "i64.atomic.rmw16.add_u", l_ll)            \
+  V(I64AtomicAdd32U, 0xfe24, l_il, "i64.atomic.rmw32.add_u", l_ll)            \
+  V(I32AtomicSub, 0xfe25, i_ii, "i32.atomic.rmw.sub", i_li)                   \
+  V(I64AtomicSub, 0xfe26, l_il, "i64.atomic.rmw.sub", l_ll)                   \
+  V(I32AtomicSub8U, 0xfe27, i_ii, "i32.atomic.rmw8.sub_u", i_li)              \
+  V(I32AtomicSub16U, 0xfe28, i_ii, "i32.atomic.rmw16.sub_u", i_li)            \
+  V(I64AtomicSub8U, 0xfe29, l_il, "i64.atomic.rmw8.sub_u", l_ll)              \
+  V(I64AtomicSub16U, 0xfe2a, l_il, "i64.atomic.rmw16.sub_u", l_ll)            \
+  V(I64AtomicSub32U, 0xfe2b, l_il, "i64.atomic.rmw32.sub_u", l_ll)            \
+  V(I32AtomicAnd, 0xfe2c, i_ii, "i32.atomic.rmw.and", i_li)                   \
+  V(I64AtomicAnd, 0xfe2d, l_il, "i64.atomic.rmw.and", l_ll)                   \
+  V(I32AtomicAnd8U, 0xfe2e, i_ii, "i32.atomic.rmw8.and_u", i_li)              \
+  V(I32AtomicAnd16U, 0xfe2f, i_ii, "i32.atomic.rmw16.and_u", i_li)            \
+  V(I64AtomicAnd8U, 0xfe30, l_il, "i64.atomic.rmw8.and_u", l_ll)              \
+  V(I64AtomicAnd16U, 0xfe31, l_il, "i64.atomic.rmw16.and_u", l_ll)            \
+  V(I64AtomicAnd32U, 0xfe32, l_il, "i64.atomic.rmw32.and_u", l_ll)            \
+  V(I32AtomicOr, 0xfe33, i_ii, "i32.atomic.rmw.or", i_li)                     \
+  V(I64AtomicOr, 0xfe34, l_il, "i64.atomic.rmw.or", l_ll)                     \
+  V(I32AtomicOr8U, 0xfe35, i_ii, "i32.atomic.rmw8.or_u", i_li)                \
+  V(I32AtomicOr16U, 0xfe36, i_ii, "i32.atomic.rmw16.or_u", i_li)              \
+  V(I64AtomicOr8U, 0xfe37, l_il, "i64.atomic.rmw8.or_u", l_ll)                \
+  V(I64AtomicOr16U, 0xfe38, l_il, "i64.atomic.rmw16.or_u", l_ll)              \
+  V(I64AtomicOr32U, 0xfe39, l_il, "i64.atomic.rmw32.or_u", l_ll)              \
+  V(I32AtomicXor, 0xfe3a, i_ii, "i32.atomic.rmw.xor", i_li)                   \
+  V(I64AtomicXor, 0xfe3b, l_il, "i64.atomic.rmw.xor", l_ll)                   \
+  V(I32AtomicXor8U, 0xfe3c, i_ii, "i32.atomic.rmw8.xor_u", i_li)              \
+  V(I32AtomicXor16U, 0xfe3d, i_ii, "i32.atomic.rmw16.xor_u", i_li)            \
+  V(I64AtomicXor8U, 0xfe3e, l_il, "i64.atomic.rmw8.xor_u", l_ll)              \
+  V(I64AtomicXor16U, 0xfe3f, l_il, "i64.atomic.rmw16.xor_u", l_ll)            \
+  V(I64AtomicXor32U, 0xfe40, l_il, "i64.atomic.rmw32.xor_u", l_ll)            \
+  V(I32AtomicExchange, 0xfe41, i_ii, "i32.atomic.rmw.xchg", i_li)             \
+  V(I64AtomicExchange, 0xfe42, l_il, "i64.atomic.rmw.xchg", l_ll)             \
+  V(I32AtomicExchange8U, 0xfe43, i_ii, "i32.atomic.rmw8.xchg_u", i_li)        \
+  V(I32AtomicExchange16U, 0xfe44, i_ii, "i32.atomic.rmw16.xchg_u", i_li)      \
+  V(I64AtomicExchange8U, 0xfe45, l_il, "i64.atomic.rmw8.xchg_u", l_ll)        \
+  V(I64AtomicExchange16U, 0xfe46, l_il, "i64.atomic.rmw16.xchg_u", l_ll)      \
+  V(I64AtomicExchange32U, 0xfe47, l_il, "i64.atomic.rmw32.xchg_u", l_ll)      \
+  V(I32AtomicCompareExchange, 0xfe48, i_iii, "i32.atomic.rmw.cmpxchg", i_lii) \
+  V(I64AtomicCompareExchange, 0xfe49, l_ill, "i64.atomic.rmw.cmpxchg", l_lll) \
+  V(I32AtomicCompareExchange8U, 0xfe4a, i_iii, "i32.atomic.rmw8.cmpxchg_u",   \
+    i_lii)                                                                    \
+  V(I32AtomicCompareExchange16U, 0xfe4b, i_iii, "i32.atomic.rmw16.cmpxchg_u", \
+    i_lii)                                                                    \
+  V(I64AtomicCompareExchange8U, 0xfe4c, l_ill, "i64.atomic.rmw8.cmpxchg_u",   \
+    l_lll)                                                                    \
+  V(I64AtomicCompareExchange16U, 0xfe4d, l_ill, "i64.atomic.rmw16.cmpxchg_u", \
+    l_lll)                                                                    \
+  V(I64AtomicCompareExchange32U, 0xfe4e, l_ill, "i64.atomic.rmw32.cmpxchg_u", \
+    l_lll)
 
 #define FOREACH_ATOMIC_0_OPERAND_OPCODE(V)                      \
   /* AtomicFence does not target a particular linear memory. */ \
-  V(AtomicFence, 0xfe03, v_v, "atomic.fence")
+  V(AtomicFence, 0xfe03, v_v, "atomic.fence", v_v)
 
 #define FOREACH_GC_OPCODE(V) /*              Force 80 columns               */ \
   V(StructGet, 0xfb03, _, "struct.get")                                        \
@@ -700,7 +706,9 @@ V8_EXPORT_PRIVATE bool IsJSCompatibleSignature(const FunctionSig* sig);
   V(ArrayNewDefault, 0xfb1c, _, "array.new_default")                           \
   V(ArrayNewData, 0xfb1d, _, "array.new_data")                                 \
   V(ArrayNewElem, 0xfb1f, _, "array.new_elem")                                 \
-  V(ArrayFill, 0xfb0f, _, "array.init")                                        \
+  V(ArrayFill, 0xfb0f, _, "array.fill")                                        \
+  V(ArrayInitData, 0xfb54, _, "array.init_data")                               \
+  V(ArrayInitElem, 0xfb55, _, "array.init_elem")                               \
   V(I31New, 0xfb20, _, "i31.new")                                              \
   V(I31GetS, 0xfb21, _, "i31.get_s")                                           \
   V(I31GetU, 0xfb22, _, "i31.get_u")                                           \
@@ -716,6 +724,8 @@ V8_EXPORT_PRIVATE bool IsJSCompatibleSignature(const FunctionSig* sig);
   V(BrOnCastFail, 0xfb43, _, "br_on_cast_fail")                                \
   V(BrOnCastFailNull, 0xfb4b, _, "br_on_cast_fail null")                       \
   V(BrOnCastFailDeprecated, 0xfb47, _, "br_on_cast_fail")                      \
+  V(BrOnCastGeneric, 0xfb4e, _, "br_on_cast")                                  \
+  V(BrOnCastFailGeneric, 0xfb4f, _, "br_on_cast_fail")                         \
   V(RefCastNop, 0xfb4c, _, "ref.cast_nop")                                     \
   V(RefIsStruct, 0xfb51, _, "ref.is_struct")                                   \
   V(RefIsI31, 0xfb52, _, "ref.is_i31")                                         \
@@ -756,7 +766,7 @@ V8_EXPORT_PRIVATE bool IsJSCompatibleSignature(const FunctionSig* sig);
   V(StringViewWtf8EncodeWtf8, 0xfb95, _, "stringview_wtf8.encode_wtf8")        \
   V(StringAsWtf16, 0xfb98, _, "string.as_wtf16")                               \
   V(StringViewWtf16Length, 0xfb99, _, "stringview_wtf16.length")               \
-  V(StringViewWtf16GetCodeUnit, 0xfb9a, _, "stringview_wtf16.get_codeunit")    \
+  V(StringViewWtf16GetCodeunit, 0xfb9a, _, "stringview_wtf16.get_codeunit")    \
   V(StringViewWtf16Encode, 0xfb9b, _, "stringview_wtf16.encode")               \
   V(StringViewWtf16Slice, 0xfb9c, _, "stringview_wtf16.slice")                 \
   V(StringAsIter, 0xfba0, _, "string.as_iter")                                 \
@@ -796,47 +806,54 @@ V8_EXPORT_PRIVATE bool IsJSCompatibleSignature(const FunctionSig* sig);
 // All signatures.
 #define FOREACH_SIGNATURE(V)                        \
   FOREACH_SIMD_SIGNATURE(V)                         \
-  V(v_v, kWasmVoid)                                 \
-  V(i_ii, kWasmI32, kWasmI32, kWasmI32)             \
-  V(i_i, kWasmI32, kWasmI32)                        \
-  V(i_v, kWasmI32)                                  \
-  V(i_ff, kWasmI32, kWasmF32, kWasmF32)             \
-  V(i_f, kWasmI32, kWasmF32)                        \
-  V(i_dd, kWasmI32, kWasmF64, kWasmF64)             \
-  V(i_d, kWasmI32, kWasmF64)                        \
-  V(i_l, kWasmI32, kWasmI64)                        \
-  V(l_ll, kWasmI64, kWasmI64, kWasmI64)             \
-  V(i_ll, kWasmI32, kWasmI64, kWasmI64)             \
-  V(l_l, kWasmI64, kWasmI64)                        \
-  V(l_i, kWasmI64, kWasmI32)                        \
-  V(l_f, kWasmI64, kWasmF32)                        \
-  V(l_d, kWasmI64, kWasmF64)                        \
-  V(f_ff, kWasmF32, kWasmF32, kWasmF32)             \
-  V(f_f, kWasmF32, kWasmF32)                        \
-  V(f_d, kWasmF32, kWasmF64)                        \
-  V(f_i, kWasmF32, kWasmI32)                        \
-  V(f_l, kWasmF32, kWasmI64)                        \
-  V(d_dd, kWasmF64, kWasmF64, kWasmF64)             \
   V(d_d, kWasmF64, kWasmF64)                        \
+  V(d_dd, kWasmF64, kWasmF64, kWasmF64)             \
   V(d_f, kWasmF64, kWasmF32)                        \
   V(d_i, kWasmF64, kWasmI32)                        \
-  V(d_l, kWasmF64, kWasmI64)                        \
-  V(v_i, kWasmVoid, kWasmI32)                       \
-  V(v_ii, kWasmVoid, kWasmI32, kWasmI32)            \
-  V(v_id, kWasmVoid, kWasmI32, kWasmF64)            \
   V(d_id, kWasmF64, kWasmI32, kWasmF64)             \
-  V(v_if, kWasmVoid, kWasmI32, kWasmF32)            \
+  V(d_l, kWasmF64, kWasmI64)                        \
+  V(f_d, kWasmF32, kWasmF64)                        \
+  V(f_f, kWasmF32, kWasmF32)                        \
+  V(f_ff, kWasmF32, kWasmF32, kWasmF32)             \
+  V(f_i, kWasmF32, kWasmI32)                        \
   V(f_if, kWasmF32, kWasmI32, kWasmF32)             \
-  V(v_il, kWasmVoid, kWasmI32, kWasmI64)            \
-  V(l_il, kWasmI64, kWasmI32, kWasmI64)             \
-  V(v_iii, kWasmVoid, kWasmI32, kWasmI32, kWasmI32) \
+  V(f_l, kWasmF32, kWasmI64)                        \
+  V(i_a, kWasmI32, kWasmAnyRef)                     \
+  V(i_ci, kWasmI32, kWasmFuncRef, kWasmI32)         \
+  V(i_d, kWasmI32, kWasmF64)                        \
+  V(i_dd, kWasmI32, kWasmF64, kWasmF64)             \
+  V(i_f, kWasmI32, kWasmF32)                        \
+  V(i_ff, kWasmI32, kWasmF32, kWasmF32)             \
+  V(i_i, kWasmI32, kWasmI32)                        \
+  V(i_ii, kWasmI32, kWasmI32, kWasmI32)             \
   V(i_iii, kWasmI32, kWasmI32, kWasmI32, kWasmI32)  \
-  V(l_ill, kWasmI64, kWasmI32, kWasmI64, kWasmI64)  \
   V(i_iil, kWasmI32, kWasmI32, kWasmI32, kWasmI64)  \
   V(i_ill, kWasmI32, kWasmI32, kWasmI64, kWasmI64)  \
-  V(i_a, kWasmI32, kWasmAnyRef)                     \
-  V(i_ci, kWasmI32, kWasmFuncRef, kWasmI32)         \
-  V(i_qq, kWasmI32, kWasmEqRef, kWasmEqRef)
+  V(i_l, kWasmI32, kWasmI64)                        \
+  V(i_li, kWasmI32, kWasmI64, kWasmI32)             \
+  V(i_lii, kWasmI32, kWasmI64, kWasmI32, kWasmI32)  \
+  V(i_lil, kWasmI32, kWasmI64, kWasmI32, kWasmI64)  \
+  V(i_lll, kWasmI32, kWasmI64, kWasmI64, kWasmI64)  \
+  V(i_ll, kWasmI32, kWasmI64, kWasmI64)             \
+  V(i_qq, kWasmI32, kWasmEqRef, kWasmEqRef)         \
+  V(i_v, kWasmI32)                                  \
+  V(l_d, kWasmI64, kWasmF64)                        \
+  V(l_f, kWasmI64, kWasmF32)                        \
+  V(l_i, kWasmI64, kWasmI32)                        \
+  V(l_il, kWasmI64, kWasmI32, kWasmI64)             \
+  V(l_ill, kWasmI64, kWasmI32, kWasmI64, kWasmI64)  \
+  V(l_l, kWasmI64, kWasmI64)                        \
+  V(l_ll, kWasmI64, kWasmI64, kWasmI64)             \
+  V(l_lll, kWasmI64, kWasmI64, kWasmI64, kWasmI64)  \
+  V(v_id, kWasmVoid, kWasmI32, kWasmF64)            \
+  V(v_if, kWasmVoid, kWasmI32, kWasmF32)            \
+  V(v_i, kWasmVoid, kWasmI32)                       \
+  V(v_ii, kWasmVoid, kWasmI32, kWasmI32)            \
+  V(v_iii, kWasmVoid, kWasmI32, kWasmI32, kWasmI32) \
+  V(v_il, kWasmVoid, kWasmI32, kWasmI64)            \
+  V(v_li, kWasmVoid, kWasmI64, kWasmI32)            \
+  V(v_ll, kWasmVoid, kWasmI64, kWasmI64)            \
+  V(v_v, kWasmVoid)
 
 #define FOREACH_SIMD_SIGNATURE(V)                      \
   V(s_s, kWasmS128, kWasmS128)                         \
@@ -896,6 +913,8 @@ class V8_EXPORT_PRIVATE WasmOpcodes {
  public:
   static constexpr const char* OpcodeName(WasmOpcode);
   static constexpr const FunctionSig* Signature(WasmOpcode);
+  static constexpr const FunctionSig* SignatureForAtomicOp(WasmOpcode opcode,
+                                                           bool is_memory64);
   static constexpr const FunctionSig* AsmjsSignature(WasmOpcode);
   static constexpr bool IsPrefixOpcode(WasmOpcode);
   static constexpr bool IsControlOpcode(WasmOpcode);
@@ -911,7 +930,7 @@ class V8_EXPORT_PRIVATE WasmOpcodes {
   static constexpr TrapReason MessageIdToTrapReason(MessageTemplate message);
 
   // Extract the prefix byte (or 0x00) from a {WasmOpcode}.
-  static constexpr byte ExtractPrefix(WasmOpcode);
+  static constexpr uint8_t ExtractPrefix(WasmOpcode);
   static inline const char* TrapReasonMessage(TrapReason);
 };
 
diff --git a/deps/v8/src/wasm/wasm-result.cc b/deps/v8/src/wasm/wasm-result.cc
index 2278006399601e..a7d4e69f1f3891 100644
--- a/deps/v8/src/wasm/wasm-result.cc
+++ b/deps/v8/src/wasm/wasm-result.cc
@@ -146,12 +146,13 @@ ErrorThrower::ErrorThrower(ErrorThrower&& other) V8_NOEXCEPT
 }
 
 ErrorThrower::~ErrorThrower() {
-  if (error() && !isolate_->has_pending_exception()) {
-    // We don't want to mix pending exceptions and scheduled exceptions, hence
-    // an existing exception should be pending, never scheduled.
-    DCHECK(!isolate_->has_scheduled_exception());
-    isolate_->Throw(*Reify());
-  }
+  if (!error() || isolate_->has_pending_exception()) return;
+
+  // We don't want to mix pending exceptions and scheduled exceptions, hence
+  // an existing exception should be pending, never scheduled.
+  DCHECK(!isolate_->has_scheduled_exception());
+  HandleScope handle_scope{isolate_};
+  isolate_->Throw(*Reify());
 }
 
 ScheduledErrorThrower::~ScheduledErrorThrower() {
diff --git a/deps/v8/src/wasm/wasm-result.h b/deps/v8/src/wasm/wasm-result.h
index 8a53e96ac9df04..d01231a4602730 100644
--- a/deps/v8/src/wasm/wasm-result.h
+++ b/deps/v8/src/wasm/wasm-result.h
@@ -21,10 +21,6 @@
 namespace v8 {
 namespace internal {
 
-class Isolate;
-template <typename T>
-class Handle;
-
 namespace wasm {
 
 class V8_EXPORT_PRIVATE WasmError {
diff --git a/deps/v8/src/wasm/wasm-serialization.cc b/deps/v8/src/wasm/wasm-serialization.cc
index 7661ae8c05b0c5..46c7284683e909 100644
--- a/deps/v8/src/wasm/wasm-serialization.cc
+++ b/deps/v8/src/wasm/wasm-serialization.cc
@@ -36,13 +36,13 @@ constexpr uint8_t kTurboFanFunction = 4;
 // in Wasm, e.g. StreamProcessor and ZoneBuffer, with these.
 class Writer {
  public:
-  explicit Writer(base::Vector<byte> buffer)
+  explicit Writer(base::Vector<uint8_t> buffer)
       : start_(buffer.begin()), end_(buffer.end()), pos_(buffer.begin()) {}
 
   size_t bytes_written() const { return pos_ - start_; }
-  byte* current_location() const { return pos_; }
+  uint8_t* current_location() const { return pos_; }
   size_t current_size() const { return end_ - pos_; }
-  base::Vector<byte> current_buffer() const {
+  base::Vector<uint8_t> current_buffer() const {
     return {current_location(), current_size()};
   }
 
@@ -59,7 +59,7 @@ class Writer {
 
   template <typename T>
   void WriteVector(const base::Vector<T> v) {
-    base::Vector<const byte> bytes = base::Vector<const byte>::cast(v);
+    base::Vector<const uint8_t> bytes = base::Vector<const uint8_t>::cast(v);
     DCHECK_GE(current_size(), bytes.size());
     if (bytes.size() > 0) {
       memcpy(current_location(), bytes.begin(), bytes.size());
@@ -75,20 +75,20 @@ class Writer {
   void Skip(size_t size) { pos_ += size; }
 
  private:
-  byte* const start_;
-  byte* const end_;
-  byte* pos_;
+  uint8_t* const start_;
+  uint8_t* const end_;
+  uint8_t* pos_;
 };
 
 class Reader {
  public:
-  explicit Reader(base::Vector<const byte> buffer)
+  explicit Reader(base::Vector<const uint8_t> buffer)
       : start_(buffer.begin()), end_(buffer.end()), pos_(buffer.begin()) {}
 
   size_t bytes_read() const { return pos_ - start_; }
-  const byte* current_location() const { return pos_; }
+  const uint8_t* current_location() const { return pos_; }
   size_t current_size() const { return end_ - pos_; }
-  base::Vector<const byte> current_buffer() const {
+  base::Vector<const uint8_t> current_buffer() const {
     return {current_location(), current_size()};
   }
 
@@ -108,7 +108,7 @@ class Reader {
   template <typename T>
   base::Vector<const T> ReadVector(size_t size) {
     DCHECK_GE(current_size(), size);
-    base::Vector<const byte> bytes{pos_, size * sizeof(T)};
+    base::Vector<const uint8_t> bytes{pos_, size * sizeof(T)};
     pos_ += size * sizeof(T);
     if (v8_flags.trace_wasm_serialization) {
       StdoutStream{} << "read vector of " << size << " elements of size "
@@ -121,9 +121,9 @@ class Reader {
   void Skip(size_t size) { pos_ += size; }
 
  private:
-  const byte* const start_;
-  const byte* const end_;
-  const byte* pos_;
+  const uint8_t* const start_;
+  const uint8_t* const end_;
+  const uint8_t* pos_;
 };
 
 void WriteHeader(Writer* writer) {
@@ -151,7 +151,7 @@ void SetWasmCalleeTag(RelocInfo* rinfo, uint32_t tag) {
                         static_cast<Address>(tag));
   } else {
     DCHECK(instr->IsBranchAndLink() || instr->IsUnconditionalBranch());
-    instr->SetBranchImmTarget(
+    instr->SetBranchImmTarget<UncondBranchType>(
         reinterpret_cast<Instruction*>(rinfo->pc() + tag * kInstrSize));
   }
 #else
@@ -161,7 +161,7 @@ void SetWasmCalleeTag(RelocInfo* rinfo, uint32_t tag) {
   } else if (rinfo->rmode() == RelocInfo::WASM_STUB_CALL) {
     rinfo->set_wasm_stub_call_address(addr, SKIP_ICACHE_FLUSH);
   } else {
-    rinfo->set_target_address(addr, SKIP_WRITE_BARRIER, SKIP_ICACHE_FLUSH);
+    rinfo->set_target_address(addr, SKIP_ICACHE_FLUSH);
   }
 #endif
 }
@@ -407,8 +407,8 @@ void NativeModuleSerializer::WriteCode(const WasmCode* code, Writer* writer) {
   writer->Write(code->tier());
 
   // Get a pointer to the destination buffer, to hold relocated code.
-  byte* serialized_code_start = writer->current_buffer().begin();
-  byte* code_start = serialized_code_start;
+  uint8_t* serialized_code_start = writer->current_buffer().begin();
+  uint8_t* code_start = serialized_code_start;
   size_t code_size = code->instructions().size();
   writer->Skip(code_size);
   // Write the reloc info, source positions, inlining positions and protected
@@ -422,12 +422,12 @@ void NativeModuleSerializer::WriteCode(const WasmCode* code, Writer* writer) {
     V8_TARGET_ARCH_RISCV64
   // On platforms that don't support misaligned word stores, copy to an aligned
   // buffer if necessary so we can relocate the serialized code.
-  std::unique_ptr<byte[]> aligned_buffer;
+  std::unique_ptr<uint8_t[]> aligned_buffer;
   if (!IsAligned(reinterpret_cast<Address>(serialized_code_start),
                  kSystemPointerSize)) {
-    // 'byte' does not guarantee an alignment but seems to work well enough in
-    // practice.
-    aligned_buffer.reset(new byte[code_size]);
+    // 'uint8_t' does not guarantee an alignment but seems to work well enough
+    // in practice.
+    aligned_buffer.reset(new uint8_t[code_size]);
     code_start = aligned_buffer.get();
   }
 #endif
@@ -526,7 +526,7 @@ size_t WasmSerializer::GetSerializedNativeModuleSize() const {
   return kHeaderSize + serializer.Measure();
 }
 
-bool WasmSerializer::SerializeNativeModule(base::Vector<byte> buffer) const {
+bool WasmSerializer::SerializeNativeModule(base::Vector<uint8_t> buffer) const {
   NativeModuleSerializer serializer(native_module_, base::VectorOf(code_table_),
                                     base::VectorOf(import_statuses_));
   size_t measured_size = kHeaderSize + serializer.Measure();
@@ -541,7 +541,7 @@ bool WasmSerializer::SerializeNativeModule(base::Vector<byte> buffer) const {
 }
 
 struct DeserializationUnit {
-  base::Vector<const byte> src_code_buffer;
+  base::Vector<const uint8_t> src_code_buffer;
   std::unique_ptr<WasmCode> code;
   NativeModule::JumpTablesRef jump_tables;
 };
@@ -618,7 +618,7 @@ class V8_EXPORT_PRIVATE NativeModuleDeserializer {
   // Updated in {ReadCode}.
   size_t remaining_code_size_ = 0;
   bool all_functions_validated_ = false;
-  base::Vector<byte> current_code_space_;
+  base::Vector<uint8_t> current_code_space_;
   NativeModule::JumpTablesRef current_jump_tables_;
   std::vector<int> lazy_functions_;
   std::vector<int> eager_functions_;
@@ -631,7 +631,6 @@ class DeserializeCodeTask : public JobTask {
       : deserializer_(deserializer), reloc_queue_(reloc_queue) {}
 
   void Run(JobDelegate* delegate) override {
-    CodeSpaceWriteScope code_space_write_scope(deserializer_->native_module_);
     bool finished = false;
     while (!finished) {
       // Repeatedly publish everything that was copied already.
@@ -643,7 +642,6 @@ class DeserializeCodeTask : public JobTask {
         deserializer_->CopyAndRelocate(unit);
       }
       publish_queue_.Add(std::move(batch));
-      ResetPKUPermissionsForThreadSpawning pku_reset_scope;
       delegate->NotifyConcurrencyIncrease();
     }
   }
@@ -722,7 +720,6 @@ bool NativeModuleDeserializer::Read(Reader* reader) {
 
   std::vector<DeserializationUnit> batch;
   size_t batch_size = 0;
-  CodeSpaceWriteScope code_space_write_scope(native_module_);
   for (uint32_t i = first_wasm_fn; i < total_fns; ++i) {
     DeserializationUnit unit = ReadCode(i, reader);
     if (!unit.code) continue;
@@ -732,7 +729,6 @@ bool NativeModuleDeserializer::Read(Reader* reader) {
       reloc_queue.Add(std::move(batch));
       DCHECK(batch.empty());
       batch_size = 0;
-      ResetPKUPermissionsForThreadSpawning pku_reset_scope;
       job_handle->NotifyConcurrencyIncrease();
     }
   }
@@ -744,7 +740,6 @@ bool NativeModuleDeserializer::Read(Reader* reader) {
 
   if (!batch.empty()) {
     reloc_queue.Add(std::move(batch));
-    ResetPKUPermissionsForThreadSpawning pku_reset_scope;
     job_handle->NotifyConcurrencyIncrease();
   }
 
@@ -810,12 +805,12 @@ DeserializationUnit NativeModuleDeserializer::ReadCode(int fn_index,
   }
 
   DeserializationUnit unit;
-  unit.src_code_buffer = reader->ReadVector<byte>(code_size);
-  auto reloc_info = reader->ReadVector<byte>(reloc_size);
-  auto source_pos = reader->ReadVector<byte>(source_position_size);
-  auto inlining_pos = reader->ReadVector<byte>(inlining_position_size);
+  unit.src_code_buffer = reader->ReadVector<uint8_t>(code_size);
+  auto reloc_info = reader->ReadVector<uint8_t>(reloc_size);
+  auto source_pos = reader->ReadVector<uint8_t>(source_position_size);
+  auto inlining_pos = reader->ReadVector<uint8_t>(inlining_position_size);
   auto protected_instructions =
-      reader->ReadVector<byte>(protected_instructions_size);
+      reader->ReadVector<uint8_t>(protected_instructions_size);
 
   base::Vector<uint8_t> instructions =
       current_code_space_.SubVector(0, code_size);
@@ -833,6 +828,10 @@ DeserializationUnit NativeModuleDeserializer::ReadCode(int fn_index,
 
 void NativeModuleDeserializer::CopyAndRelocate(
     const DeserializationUnit& unit) {
+  CodeSpaceWriteScope write_scope;
+  ThreadIsolation::RegisterWasmAllocation(
+      reinterpret_cast<Address>(unit.code->instructions().begin()),
+      unit.src_code_buffer.size());
   memcpy(unit.code->instructions().begin(), unit.src_code_buffer.begin(),
          unit.src_code_buffer.size());
 
@@ -892,8 +891,8 @@ void NativeModuleDeserializer::ReadTieringBudget(Reader* reader) {
   if (size_of_tiering_budget > reader->current_size()) {
     return;
   }
-  base::Vector<const byte> serialized_budget =
-      reader->ReadVector<const byte>(size_of_tiering_budget);
+  base::Vector<const uint8_t> serialized_budget =
+      reader->ReadVector<const uint8_t>(size_of_tiering_budget);
 
   memcpy(native_module_->tiering_budget_array(), serialized_budget.begin(),
          size_of_tiering_budget);
@@ -913,9 +912,9 @@ void NativeModuleDeserializer::Publish(std::vector<DeserializationUnit> batch) {
   }
 }
 
-bool IsSupportedVersion(base::Vector<const byte> header) {
+bool IsSupportedVersion(base::Vector<const uint8_t> header) {
   if (header.size() < WasmSerializer::kHeaderSize) return false;
-  byte current_version[WasmSerializer::kHeaderSize];
+  uint8_t current_version[WasmSerializer::kHeaderSize];
   Writer writer({current_version, WasmSerializer::kHeaderSize});
   WriteHeader(&writer);
   return memcmp(header.begin(), current_version, WasmSerializer::kHeaderSize) ==
@@ -923,8 +922,8 @@ bool IsSupportedVersion(base::Vector<const byte> header) {
 }
 
 MaybeHandle<WasmModuleObject> DeserializeNativeModule(
-    Isolate* isolate, base::Vector<const byte> data,
-    base::Vector<const byte> wire_bytes_vec,
+    Isolate* isolate, base::Vector<const uint8_t> data,
+    base::Vector<const uint8_t> wire_bytes_vec,
     base::Vector<const char> source_url) {
   if (!IsWasmCodegenAllowed(isolate, isolate->native_context())) return {};
   if (!IsSupportedVersion(data)) return {};
diff --git a/deps/v8/src/wasm/wasm-serialization.h b/deps/v8/src/wasm/wasm-serialization.h
index 9613e9951ce78e..fd522125609492 100644
--- a/deps/v8/src/wasm/wasm-serialization.h
+++ b/deps/v8/src/wasm/wasm-serialization.h
@@ -28,7 +28,7 @@ class V8_EXPORT_PRIVATE WasmSerializer {
 
   // Serialize the {NativeModule} into the provided {buffer}. Returns true on
   // success and false if the given buffer it too small for serialization.
-  bool SerializeNativeModule(base::Vector<byte> buffer) const;
+  bool SerializeNativeModule(base::Vector<uint8_t> buffer) const;
 
   // The data header consists of uint32_t-sized entries (see {WriteVersion}):
   // [0] magic number
@@ -55,12 +55,13 @@ class V8_EXPORT_PRIVATE WasmSerializer {
 
 // Support for deserializing WebAssembly {NativeModule} objects.
 // Checks the version header of the data against the current version.
-bool IsSupportedVersion(base::Vector<const byte> data);
+bool IsSupportedVersion(base::Vector<const uint8_t> data);
 
 // Deserializes the given data to create a Wasm module object.
 V8_EXPORT_PRIVATE MaybeHandle<WasmModuleObject> DeserializeNativeModule(
-    Isolate*, base::Vector<const byte> data,
-    base::Vector<const byte> wire_bytes, base::Vector<const char> source_url);
+    Isolate*, base::Vector<const uint8_t> data,
+    base::Vector<const uint8_t> wire_bytes,
+    base::Vector<const char> source_url);
 
 }  // namespace wasm
 }  // namespace internal
diff --git a/deps/v8/src/wasm/wasm-value.h b/deps/v8/src/wasm/wasm-value.h
index 5878732d0b02e1..1a5a862f038c27 100644
--- a/deps/v8/src/wasm/wasm-value.h
+++ b/deps/v8/src/wasm/wasm-value.h
@@ -47,7 +47,7 @@ class Simd128 {
   FOREACH_SIMD_TYPE(DEFINE_SIMD_TYPE_SPECIFIC_METHODS)
 #undef DEFINE_SIMD_TYPE_SPECIFIC_METHODS
 
-  explicit Simd128(byte* bytes) {
+  explicit Simd128(uint8_t* bytes) {
     memcpy(static_cast<void*>(val_), reinterpret_cast<void*>(bytes),
            kSimd128Size);
   }
@@ -143,7 +143,7 @@ class WasmValue {
                                         : type_.value_kind_size());
   }
 
-  void CopyTo(byte* to) const {
+  void CopyTo(uint8_t* to) const {
     static_assert(sizeof(float) == sizeof(Float32));
     static_assert(sizeof(double) == sizeof(Float64));
     DCHECK(type_.is_numeric());
@@ -193,9 +193,9 @@ class WasmValue {
       case kS128: {
         std::stringstream stream;
         stream << "0x" << std::hex;
-        for (int8_t byte : bit_pattern_) {
-          if (!(byte & 0xf0)) stream << '0';
-          stream << byte;
+        for (int8_t uint8_t : bit_pattern_) {
+          if (!(uint8_t & 0xf0)) stream << '0';
+          stream << uint8_t;
         }
         return stream.str();
       }
diff --git a/deps/v8/src/wasm/well-known-imports.cc b/deps/v8/src/wasm/well-known-imports.cc
index beeb6b54aa49b4..7f12574eb5495b 100644
--- a/deps/v8/src/wasm/well-known-imports.cc
+++ b/deps/v8/src/wasm/well-known-imports.cc
@@ -10,12 +10,49 @@ namespace v8::internal::wasm {
 
 const char* WellKnownImportName(WellKnownImport wki) {
   switch (wki) {
+    // Generic:
     case WellKnownImport::kUninstantiated:
       return "uninstantiated";
     case WellKnownImport::kGeneric:
       return "generic";
+
+    // Functions:
+    case WellKnownImport::kDoubleToString:
+      return "DoubleToString";
+    case WellKnownImport::kIntToString:
+      return "IntToString";
+    case WellKnownImport::kParseFloat:
+      return "ParseFloat";
+    case WellKnownImport::kStringCharCodeAt:
+      return "String.charCodeAt";
+    case WellKnownImport::kStringCodePointAt:
+      return "String.codePointAt";
+    case WellKnownImport::kStringCompare:
+      return "String.compare";
+    case WellKnownImport::kStringConcat:
+      return "String.concat";
+    case WellKnownImport::kStringEquals:
+      return "String.equals";
+    case WellKnownImport::kStringFromCharCode:
+      return "String.fromCharCode";
+    case WellKnownImport::kStringFromCodePoint:
+      return "String.fromCodePoint";
+    case WellKnownImport::kStringFromWtf16Array:
+      return "String.fromWtf16Array";
+    case WellKnownImport::kStringFromWtf8Array:
+      return "String.fromWtf8Array";
+    case WellKnownImport::kStringIndexOf:
+      return "String.indexOf";
+    case WellKnownImport::kStringLength:
+      return "String.length";
+    case WellKnownImport::kStringSubstring:
+      return "String.substring";
+    case WellKnownImport::kStringToLocaleLowerCaseStringref:
+      return "String.toLocaleLowerCase";
     case WellKnownImport::kStringToLowerCaseStringref:
       return "String.toLowerCase";
+    case WellKnownImport::kStringToWtf16Array:
+      return "String.toWtf16Array";
   }
 }
 
diff --git a/deps/v8/src/wasm/well-known-imports.h b/deps/v8/src/wasm/well-known-imports.h
index 11c7b46580099c..1b98cfdbff15bf 100644
--- a/deps/v8/src/wasm/well-known-imports.h
+++ b/deps/v8/src/wasm/well-known-imports.h
@@ -19,9 +19,29 @@
 namespace v8::internal::wasm {
 
 enum class WellKnownImport : uint8_t {
+  // Generic:
   kUninstantiated,
   kGeneric,
+
+  // Functions:
+  kDoubleToString,
+  kIntToString,
+  kParseFloat,
+  kStringCharCodeAt,
+  kStringCodePointAt,
+  kStringCompare,
+  kStringConcat,
+  kStringEquals,
+  kStringFromCharCode,
+  kStringFromCodePoint,
+  kStringFromWtf16Array,
+  kStringFromWtf8Array,
+  kStringIndexOf,
+  kStringLength,
+  kStringSubstring,
+  kStringToLocaleLowerCaseStringref,
   kStringToLowerCaseStringref,
+  kStringToWtf16Array,
 };
 
 class NativeModule;
diff --git a/deps/v8/src/zone/zone-allocator.h b/deps/v8/src/zone/zone-allocator.h
index 5a772ed5409737..8c1e6d47ef770c 100644
--- a/deps/v8/src/zone/zone-allocator.h
+++ b/deps/v8/src/zone/zone-allocator.h
@@ -57,7 +57,7 @@ class ZoneAllocator {
   template <typename U>
   friend class ZoneAllocator;
 
-  T* allocate(size_t length) { return zone_->NewArray<T>(length); }
+  T* allocate(size_t length) { return zone_->AllocateArray<T>(length); }
   void deallocate(T* p, size_t length) { zone_->DeleteArray<T>(p, length); }
 
   size_t max_size() const {
diff --git a/deps/v8/src/zone/zone-chunk-list.h b/deps/v8/src/zone/zone-chunk-list.h
index 0aeaf09eb5513e..99fb589487cb83 100644
--- a/deps/v8/src/zone/zone-chunk-list.h
+++ b/deps/v8/src/zone/zone-chunk-list.h
@@ -27,11 +27,14 @@ class ZoneChunkListIterator;
 // * offers forward- and backwards-iteration,
 // * offers relatively fast seeking,
 // * offers bidirectional iterators,
-// * can be rewound without freeing the backing store.
+// * can be rewound without freeing the backing store,
+// * can be split and joined again efficiently.
 // This list will maintain a doubly-linked list of chunks. When a chunk is
 // filled up, a new one gets appended. New chunks appended at the end will
 // grow in size up to a certain limit to avoid over-allocation and to keep
-// the zone clean.
+// the zone clean. Chunks may be partially filled. In particular, chunks may
+// be empty after rewinding, such that they can be reused when inserting
+// again at a later point in time.
 template <typename T>
 class ZoneChunkList : public ZoneObject {
  public:
@@ -40,43 +43,27 @@ class ZoneChunkList : public ZoneObject {
   using reverse_iterator = ZoneChunkListIterator<T, true, true>;
   using const_reverse_iterator = ZoneChunkListIterator<T, true, false>;
 
-  enum class StartMode {
-    // The list will not allocate a starting chunk. Use if you expect your
-    // list to remain empty in many cases.
-    kEmpty = 0,
-    // The list will start with a small initial chunk. Subsequent chunks will
-    // get bigger over time.
-    kSmall = 8,
-    // The list will start with one chunk at maximum size. Use this if you
-    // expect your list to contain many items to avoid growing chunks.
-    kBig = 256
-  };
+  static constexpr uint32_t kInitialChunkCapacity = 8;
+  static constexpr uint32_t kMaxChunkCapacity = 256;
 
-  explicit ZoneChunkList(Zone* zone, StartMode start_mode = StartMode::kEmpty)
-      : zone_(zone) {
-    if (start_mode != StartMode::kEmpty) {
-      front_ = NewChunk(static_cast<uint32_t>(start_mode));
-      back_ = front_;
-    }
-  }
+  explicit ZoneChunkList(Zone* zone) : zone_(zone) {}
 
-  ZoneChunkList(const ZoneChunkList&) = delete;
-  ZoneChunkList& operator=(const ZoneChunkList&) = delete;
+  MOVE_ONLY_NO_DEFAULT_CONSTRUCTOR(ZoneChunkList);
 
   size_t size() const { return size_; }
-  bool is_empty() const { return size() == 0; }
+  bool empty() const { return size() == 0; }
 
-  T& front() const;
-  T& back() const;
+  T& front();
+  const T& front() const;
+  T& back();
+  const T& back() const;
 
   void push_back(const T& item);
-  void pop_back();
 
-  // Will push a separate chunk to the front of the chunk-list.
-  // Very memory-inefficient. Do only use sparsely! If you have many items to
-  // add in front, consider using 'push_front_many'.
+  // If the first chunk has space, inserts into it at the front. Otherwise
+  // allocate a new chunk with the same growth strategy as `push_back`.
+  // This limits the amount of copying to O(`kMaxChunkCapacity`).
   void push_front(const T& item);
-  // TODO(heimbuef): Add 'push_front_many'.
 
   // Cuts the last list elements so at most 'limit' many remain. Does not
   // free the actual memory, since it is zone allocated.
@@ -89,6 +76,12 @@ class ZoneChunkList : public ZoneObject {
   // TODO(heimbuef): Add 'rFind', seeking from the end and returning a
   // reverse iterator.
 
+  // Splits off a new list that contains the elements from `split_begin` to
+  // `end()`. The current list is truncated to end just before `split_begin`.
+  // This naturally invalidates all iterators, including `split_begin`.
+  ZoneChunkList<T> SplitAt(iterator split_begin);
+  void Append(ZoneChunkList<T>& other);
+
   void CopyTo(T* ptr);
 
   iterator begin() { return iterator::Begin(this); }
@@ -104,14 +97,17 @@ class ZoneChunkList : public ZoneObject {
     return const_reverse_iterator::End(this);
   }
 
+  void swap(ZoneChunkList<T>& other) {
+    DCHECK_EQ(zone_, other.zone_);
+    std::swap(size_, other.size_);
+    std::swap(front_, other.front_);
+    std::swap(last_nonempty_, other.last_nonempty_);
+  }
+
  private:
   template <typename S, bool backwards, bool modifiable>
   friend class ZoneChunkListIterator;
 
-  static constexpr uint32_t kMaxChunkCapacity = 256u;
-
-  static_assert(kMaxChunkCapacity == static_cast<uint32_t>(StartMode::kBig));
-
   struct Chunk {
     uint32_t capacity_ = 0;
     uint32_t position_ = 0;
@@ -119,6 +115,12 @@ class ZoneChunkList : public ZoneObject {
     Chunk* previous_ = nullptr;
     T* items() { return reinterpret_cast<T*>(this + 1); }
     const T* items() const { return reinterpret_cast<const T*>(this + 1); }
+    uint32_t size() const {
+      DCHECK_LE(position_, capacity_);
+      return position_;
+    }
+    bool empty() const { return size() == 0; }
+    bool full() const { return size() == capacity_; }
   };
 
   Chunk* NewChunk(const uint32_t capacity) {
@@ -128,6 +130,10 @@ class ZoneChunkList : public ZoneObject {
     return chunk;
   }
 
+  static uint32_t NextChunkCapacity(uint32_t previous_capacity) {
+    return std::min(previous_capacity * 2, kMaxChunkCapacity);
+  }
+
   struct SeekResult {
     Chunk* chunk_;
     uint32_t chunk_index_;
@@ -137,11 +143,45 @@ class ZoneChunkList : public ZoneObject {
   // index. Will skip entire chunks and is therefore faster than iterating.
   SeekResult SeekIndex(size_t index) const;
 
+#ifdef DEBUG
+  // Check the invariants.
+  void Verify() const {
+    if (front_ == nullptr) {
+      // Initial empty state.
+      DCHECK_NULL(last_nonempty_);
+      DCHECK_EQ(0, size());
+    } else if (empty()) {
+      // Special case: Fully rewound list, with only empty chunks.
+      DCHECK_EQ(front_, last_nonempty_);
+      DCHECK_EQ(0, size());
+      for (Chunk* chunk = front_; chunk != nullptr; chunk = chunk->next_) {
+        DCHECK(chunk->empty());
+      }
+    } else {
+      // Normal state: Somewhat filled and (partially) rewound.
+      DCHECK_NOT_NULL(last_nonempty_);
+
+      size_t size_check = 0;
+      bool in_empty_tail = false;
+      for (Chunk* chunk = front_; chunk != nullptr; chunk = chunk->next_) {
+        // Chunks from `front_` to `last_nonempty_` (inclusive) are non-empty.
+        DCHECK_EQ(in_empty_tail, chunk->empty());
+        size_check += chunk->size();
+
+        if (chunk == last_nonempty_) {
+          in_empty_tail = true;
+        }
+      }
+      DCHECK_EQ(size_check, size());
+    }
+  }
+#endif
+
   Zone* zone_;
 
   size_t size_ = 0;
   Chunk* front_ = nullptr;
-  Chunk* back_ = nullptr;
+  Chunk* last_nonempty_ = nullptr;
 };
 
 template <typename T, bool backwards, bool modifiable>
@@ -187,26 +227,26 @@ class ZoneChunkListIterator
     return clone;
   }
 
-  void Advance(int amount) {
-    // Move forwards.
-    DCHECK_GE(amount, 0);
-#if DEBUG
+  void Advance(uint32_t amount) {
+    static_assert(!backwards, "Advance only works on forward iterators");
+
+#ifdef DEBUG
     ZoneChunkListIterator clone(*this);
-    for (int i = 0; i < amount; ++i) {
+    for (uint32_t i = 0; i < amount; ++i) {
       ++clone;
     }
 #endif
 
-    position_ += amount;
-    while (position_ > 0 && position_ >= current_->capacity_) {
-      auto overshoot = position_ - current_->capacity_;
+    CHECK(!base::bits::UnsignedAddOverflow32(position_, amount, &position_));
+    while (position_ > 0 && position_ >= current_->position_) {
+      auto overshoot = position_ - current_->position_;
       current_ = current_->next_;
       position_ = overshoot;
 
       DCHECK(position_ == 0 || current_);
     }
 
-#if DEBUG
+#ifdef DEBUG
     DCHECK_EQ(clone, *this);
 #endif
   }
@@ -219,16 +259,11 @@ class ZoneChunkListIterator
     if (!backwards) return ZoneChunkListIterator(list->front_, 0);
 
     // Backward iterator:
-    if (list->back_ == nullptr) return End(list);
-    if (list->back_->position_ == 0) {
-      if (list->back_->previous_ != nullptr) {
-        return ZoneChunkListIterator(list->back_->previous_,
-                                     list->back_->previous_->capacity_ - 1);
-      } else {
-        return End(list);
-      }
-    }
-    return ZoneChunkListIterator(list->back_, list->back_->position_ - 1);
+    if (list->empty()) return End(list);
+
+    DCHECK(!list->last_nonempty_->empty());
+    return ZoneChunkListIterator(list->last_nonempty_,
+                                 list->last_nonempty_->position_ - 1);
   }
 
   static ZoneChunkListIterator End(ChunkList* list) {
@@ -236,17 +271,14 @@ class ZoneChunkListIterator
     if (backwards) return ZoneChunkListIterator(nullptr, 0);
 
     // Forward iterator:
-    if (list->back_ == nullptr) return Begin(list);
+    if (list->empty()) return Begin(list);
 
-    DCHECK_LE(list->back_->position_, list->back_->capacity_);
-    if (list->back_->position_ == list->back_->capacity_) {
-      return ZoneChunkListIterator(list->back_->next_, 0);
-    }
-
-    return ZoneChunkListIterator(list->back_, list->back_->position_);
+    // NOTE: Decrementing `end()` is not supported if `last_nonempty_->next_`
+    // is nullptr (in that case `Move` will crash on dereference).
+    return ZoneChunkListIterator(list->last_nonempty_->next_, 0);
   }
 
-  ZoneChunkListIterator(Chunk* current, size_t position)
+  ZoneChunkListIterator(Chunk* current, uint32_t position)
       : current_(current), position_(position) {
     DCHECK(current == nullptr || position < current->capacity_);
   }
@@ -257,14 +289,14 @@ class ZoneChunkListIterator
       // Move backwards.
       if (position_ == 0) {
         current_ = current_->previous_;
-        position_ = current_ ? current_->capacity_ - 1 : 0;
+        position_ = current_ ? current_->position_ - 1 : 0;
       } else {
         --position_;
       }
     } else {
       // Move forwards.
       ++position_;
-      if (position_ >= current_->capacity_) {
+      if (position_ >= current_->position_) {
         current_ = current_->next_;
         position_ = 0;
       }
@@ -272,73 +304,82 @@ class ZoneChunkListIterator
   }
 
   Chunk* current_;
-  size_t position_;
+  uint32_t position_;
 };
 
 template <typename T>
-T& ZoneChunkList<T>::front() const {
-  DCHECK_LT(size_t(0), size());
-  return front_->items()[0];
+T& ZoneChunkList<T>::front() {
+  DCHECK(!empty());
+  return *begin();
 }
 
 template <typename T>
-T& ZoneChunkList<T>::back() const {
-  DCHECK_LT(size_t(0), size());
-
-  if (back_->position_ == 0) {
-    return back_->previous_->items()[back_->previous_->position_ - 1];
-  } else {
-    return back_->items()[back_->position_ - 1];
-  }
+const T& ZoneChunkList<T>::front() const {
+  DCHECK(!empty());
+  return *begin();
 }
 
 template <typename T>
-void ZoneChunkList<T>::push_back(const T& item) {
-  if (back_ == nullptr) {
-    front_ = NewChunk(static_cast<uint32_t>(StartMode::kSmall));
-    back_ = front_;
-  }
+T& ZoneChunkList<T>::back() {
+  DCHECK(!empty());
+  // Avoid the branch in `ZoneChunkListIterator::Begin()`.
+  V8_ASSUME(size_ != 0);
+  return *rbegin();
+}
 
-  DCHECK_LE(back_->position_, back_->capacity_);
-  if (back_->position_ == back_->capacity_) {
-    if (back_->next_ == nullptr) {
-      constexpr auto max_capacity = kMaxChunkCapacity;
-      Chunk* chunk = NewChunk(std::min(back_->capacity_ << 1, max_capacity));
-      back_->next_ = chunk;
-      chunk->previous_ = back_;
-    }
-    back_ = back_->next_;
-  }
-  back_->items()[back_->position_] = item;
-  ++back_->position_;
-  ++size_;
-  DCHECK_LE(back_->position_, back_->capacity_);
+template <typename T>
+const T& ZoneChunkList<T>::back() const {
+  DCHECK(!empty());
+  // Avoid the branch in `ZoneChunkListIterator::Begin()`.
+  V8_ASSUME(size_ != 0);
+  return *rbegin();
 }
 
 template <typename T>
-void ZoneChunkList<T>::pop_back() {
-  DCHECK_LT(size_t(0), size());
-  if (back_->position_ == 0) {
-    back_ = back_->previous_;
+void ZoneChunkList<T>::push_back(const T& item) {
+  if (last_nonempty_ == nullptr) {
+    // Initially empty chunk list.
+    front_ = NewChunk(kInitialChunkCapacity);
+    last_nonempty_ = front_;
+  } else if (last_nonempty_->full()) {
+    // If there is an empty chunk following, reuse that, otherwise allocate.
+    if (last_nonempty_->next_ == nullptr) {
+      Chunk* chunk = NewChunk(NextChunkCapacity(last_nonempty_->capacity_));
+      last_nonempty_->next_ = chunk;
+      chunk->previous_ = last_nonempty_;
+    }
+    last_nonempty_ = last_nonempty_->next_;
+    DCHECK(!last_nonempty_->full());
   }
-  --back_->position_;
-  --size_;
+
+  last_nonempty_->items()[last_nonempty_->position_] = item;
+  ++last_nonempty_->position_;
+  ++size_;
+  DCHECK_LE(last_nonempty_->position_, last_nonempty_->capacity_);
 }
 
 template <typename T>
 void ZoneChunkList<T>::push_front(const T& item) {
-  Chunk* chunk = NewChunk(1);  // Yes, this gets really inefficient.
-  chunk->next_ = front_;
-  if (front_) {
+  if (front_ == nullptr) {
+    // Initially empty chunk list.
+    front_ = NewChunk(kInitialChunkCapacity);
+    last_nonempty_ = front_;
+  } else if (front_->full()) {
+    // First chunk at capacity, so prepend a new chunk.
+    DCHECK_NULL(front_->previous_);
+    Chunk* chunk = NewChunk(NextChunkCapacity(front_->capacity_));
     front_->previous_ = chunk;
-  } else {
-    back_ = chunk;
+    chunk->next_ = front_;
+    front_ = chunk;
   }
-  front_ = chunk;
+  DCHECK(!front_->full());
 
-  chunk->items()[0] = item;
-  chunk->position_ = 1;
+  T* end = front_->items() + front_->position_;
+  std::move_backward(front_->items(), end, end + 1);
+  front_->items()[0] = item;
+  ++front_->position_;
   ++size_;
+  DCHECK_LE(front_->position_, front_->capacity_);
 }
 
 template <typename T>
@@ -364,8 +405,8 @@ void ZoneChunkList<T>::Rewind(const size_t limit) {
   // Do a partial rewind of the chunk containing the index.
   seek_result.chunk_->position_ = seek_result.chunk_index_;
 
-  // Set back_ so iterators will work correctly.
-  back_ = seek_result.chunk_;
+  // Set last_nonempty_ so iterators will work correctly.
+  last_nonempty_ = seek_result.chunk_;
 
   // Do full rewind of all subsequent chunks.
   for (Chunk* current = seek_result.chunk_->next_; current != nullptr;
@@ -374,6 +415,10 @@ void ZoneChunkList<T>::Rewind(const size_t limit) {
   }
 
   size_ = limit;
+
+#ifdef DEBUG
+  Verify();
+#endif
 }
 
 template <typename T>
@@ -391,6 +436,89 @@ typename ZoneChunkList<T>::const_iterator ZoneChunkList<T>::Find(
                                                    seek_result.chunk_index_);
 }
 
+template <typename T>
+ZoneChunkList<T> ZoneChunkList<T>::SplitAt(iterator split_begin) {
+  ZoneChunkList<T> result(zone_);
+
+  // `result` is an empty freshly-constructed list.
+  if (split_begin == end()) return result;
+
+  // `this` is empty after the split and `result` contains everything.
+  if (split_begin == begin()) {
+    this->swap(result);
+    return result;
+  }
+
+  // There is at least one element in both `this` and `result`.
+
+  // Split the chunk.
+  Chunk* split_chunk = split_begin.current_;
+  DCHECK_LE(split_begin.position_, split_chunk->position_);
+  T* chunk_split_begin = split_chunk->items() + split_begin.position_;
+  T* chunk_split_end = split_chunk->items() + split_chunk->position_;
+  uint32_t new_chunk_size =
+      static_cast<uint32_t>(chunk_split_end - chunk_split_begin);
+  uint32_t new_chunk_capacity = std::max(
+      kInitialChunkCapacity, base::bits::RoundUpToPowerOfTwo32(new_chunk_size));
+  CHECK_LE(new_chunk_size, new_chunk_capacity);
+  Chunk* new_chunk = NewChunk(new_chunk_capacity);
+  std::copy(chunk_split_begin, chunk_split_end, new_chunk->items());
+  new_chunk->position_ = new_chunk_size;
+  split_chunk->position_ = split_begin.position_;
+
+  // Split the linked list.
+  result.front_ = new_chunk;
+  result.last_nonempty_ =
+      (last_nonempty_ == split_chunk) ? new_chunk : last_nonempty_;
+  new_chunk->next_ = split_chunk->next_;
+  if (new_chunk->next_) {
+    new_chunk->next_->previous_ = new_chunk;
+  }
+
+  last_nonempty_ = split_chunk;
+  split_chunk->next_ = nullptr;
+
+  // Compute the new size.
+  size_t new_size = 0;
+  for (Chunk* chunk = front_; chunk != split_chunk; chunk = chunk->next_) {
+    DCHECK(!chunk->empty());
+    new_size += chunk->size();
+  }
+  new_size += split_chunk->size();
+  DCHECK_LT(new_size, size());
+  result.size_ = size() - new_size;
+  size_ = new_size;
+
+#ifdef DEBUG
+  Verify();
+  result.Verify();
+#endif
+
+  return result;
+}
+
+template <typename T>
+void ZoneChunkList<T>::Append(ZoneChunkList<T>& other) {
+  DCHECK_EQ(zone_, other.zone_);
+
+  if (other.front_ == nullptr) return;
+
+  last_nonempty_->next_ = other.front_;
+  other.front_->previous_ = last_nonempty_;
+
+  last_nonempty_ = other.last_nonempty_;
+
+  size_ += other.size_;
+#ifdef DEBUG
+  Verify();
+#endif
+
+  // Leave `other` in empty, but valid state.
+  other.front_ = nullptr;
+  other.last_nonempty_ = nullptr;
+  other.size_ = 0;
+}
+
 template <typename T>
 void ZoneChunkList<T>::CopyTo(T* ptr) {
   for (Chunk* current = front_; current != nullptr; current = current->next_) {
diff --git a/deps/v8/src/zone/zone-compact-set.h b/deps/v8/src/zone/zone-compact-set.h
new file mode 100644
index 00000000000000..06e902b6e53ebf
--- /dev/null
+++ b/deps/v8/src/zone/zone-compact-set.h
@@ -0,0 +1,362 @@
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_ZONE_ZONE_COMPACT_SET_H_
+#define V8_ZONE_ZONE_COMPACT_SET_H_
+
+#include <algorithm>
+#include <initializer_list>
+#include <type_traits>
+
+#include "src/base/compiler-specific.h"
+#include "src/base/pointer-with-payload.h"
+#include "src/common/assert-scope.h"
+#include "src/handles/handles.h"
+#include "src/zone/zone-containers.h"
+#include "src/zone/zone.h"
+
+namespace v8 {
+namespace internal {
+
+template <typename T, typename Enable = void>
+struct ZoneCompactSetTraits;
+
+template <typename T>
+struct ZoneCompactSetTraits<Handle<T>> {
+  using handle_type = Handle<T>;
+  using data_type = Address;
+
+  static data_type* HandleToPointer(handle_type handle) {
+    // Use address() instead of location() to get around handle access checks
+    // (we're not actually dereferencing the handle so it's safe to read its
+    // location)
+    return base::bit_cast<Address*>(handle.address());
+  }
+  static handle_type PointerToHandle(data_type* ptr) {
+    return handle_type(ptr);
+  }
+};
+
+// A Zone-allocated set which has a compact encoding of zero and one values.
+// Two or more values will be stored as a sorted list, which is copied on write
+// to keep the ZoneCompactSet copy constructor trivial. Note that this means
+// that insertions past the first value will trigger an allocation and copy of
+// the existing elements -- ZoneCompactSet should be preferred for cases where
+// we mostly have only zero or one values.
+//
+// T must be a Handle-like type with a specialization of ZoneCompactSetTraits.
+// In particular, it must be a trivial wrapper of a pointer to actual data --
+// ZoneCompactSet will store this pointer rather than the T type.
+template <typename T>
+class ZoneCompactSet final {
+  static_assert(std::is_trivially_copyable_v<T>);
+  static_assert(std::is_trivially_destructible_v<T>);
+
+  using Traits = ZoneCompactSetTraits<T>;
+  using handle_type = typename Traits::handle_type;
+  using data_type = typename Traits::data_type;
+
+ public:
+  ZoneCompactSet() : data_(kEmptyTag) {}
+  explicit ZoneCompactSet(T handle)
+      : data_(Traits::HandleToPointer(handle), kSingletonTag) {}
+  explicit ZoneCompactSet(std::initializer_list<T> handles, Zone* zone)
+      : ZoneCompactSet(handles.begin(), handles.end(), zone) {}
+
+  ZoneCompactSet(const ZoneCompactSet& other) V8_NOEXCEPT = default;
+  ZoneCompactSet& operator=(const ZoneCompactSet& other) V8_NOEXCEPT = default;
+  ZoneCompactSet(ZoneCompactSet&& other) V8_NOEXCEPT = default;
+  ZoneCompactSet& operator=(ZoneCompactSet&& other) V8_NOEXCEPT = default;
+
+  template <class It,
+            typename = typename std::iterator_traits<It>::iterator_category>
+  explicit ZoneCompactSet(It first, It last, Zone* zone) {
+    auto size = last - first;
+    if (size == 0) {
+      data_ = EmptyValue();
+    } else if (size == 1) {
+      data_ =
+          PointerWithPayload(Traits::HandleToPointer(*first), kSingletonTag);
+    } else {
+      List* list = NewList(size, zone);
+      auto list_it = list->begin();
+      for (auto it = first; it != last; ++it) {
+        *list_it = Traits::HandleToPointer(*it);
+        list_it++;
+      }
+      std::sort(list->begin(), list->end());
+      data_ = PointerWithPayload(list, kListTag);
+    }
+  }
+
+  bool is_empty() const { return data_ == EmptyValue(); }
+
+  size_t size() const {
+    if (is_empty()) return 0;
+    if (is_singleton()) return 1;
+    return list()->size();
+  }
+
+  T at(size_t i) const {
+    DCHECK_NE(kEmptyTag, data_.GetPayload());
+    if (is_singleton()) {
+      DCHECK_EQ(0u, i);
+      return Traits::PointerToHandle(singleton());
+    }
+    return Traits::PointerToHandle(list()->at(static_cast<int>(i)));
+  }
+
+  T operator[](size_t i) const { return at(i); }
+
+  void insert(T handle, Zone* zone) {
+    data_type* const value = Traits::HandleToPointer(handle);
+    if (is_empty()) {
+      data_ = PointerWithPayload(value, kSingletonTag);
+    } else if (is_singleton()) {
+      if (singleton() == value) return;
+      List* list = NewList(2, zone);
+      if (singleton() < value) {
+        (*list)[0] = singleton();
+        (*list)[1] = value;
+      } else {
+        (*list)[0] = value;
+        (*list)[1] = singleton();
+      }
+      data_ = PointerWithPayload(list, kListTag);
+    } else {
+      const List* current_list = list();
+      auto it =
+          std::lower_bound(current_list->begin(), current_list->end(), value);
+      if (it != current_list->end() && *it == value) {
+        // Already in the list.
+        return;
+      }
+      // Otherwise, lower_bound returned the insertion position to keep the list
+      // sorted.
+      DCHECK(it == current_list->end() || *it > value);
+      // We need to copy the list to mutate it, so that trivial copies of the
+      // data_ pointer don't observe changes to the list.
+      // TODO(leszeks): Avoid copying on every insertion by introducing some
+      // concept of mutable/immutable/frozen/CoW sets.
+      List* new_list = NewList(current_list->size() + 1, zone);
+      auto new_it = new_list->begin();
+      new_it = std::copy(current_list->begin(), it, new_it);
+      *new_it++ = value;
+      new_it = std::copy(it, current_list->end(), new_it);
+      DCHECK_EQ(new_it, new_list->end());
+      DCHECK(std::is_sorted(new_list->begin(), new_list->end()));
+      data_ = PointerWithPayload(new_list, kListTag);
+    }
+  }
+
+  void Union(ZoneCompactSet<T> const& other, Zone* zone) {
+    for (size_t i = 0; i < other.size(); ++i) {
+      insert(other.at(i), zone);
+    }
+  }
+
+  bool contains(ZoneCompactSet<T> const& other) const {
+    if (data_ == other.data_) return true;
+    if (is_empty()) return false;
+    if (other.is_empty()) return true;
+    if (is_singleton()) {
+      DCHECK_IMPLIES(other.is_singleton(), other.singleton() != singleton());
+      return false;
+    }
+    const List* list = this->list();
+    DCHECK(std::is_sorted(list->begin(), list->end()));
+    if (other.is_singleton()) {
+      return std::binary_search(list->begin(), list->end(), other.singleton());
+    }
+    DCHECK(other.is_list());
+    DCHECK(std::is_sorted(other.list()->begin(), other.list()->end()));
+    // For each element in the `other` list, find the matching element in this
+    // list. Since both lists are sorted, each search candidate will be larger
+    // than the previous, and each found element will be the lower bound for
+    // the search of the next element.
+    auto it = list->begin();
+    for (const data_type* pointer : *other.list()) {
+      it = std::lower_bound(it, list->end(), pointer);
+      if (it == list->end() || *it != pointer) return false;
+    }
+    return true;
+  }
+
+  bool contains(T handle) const {
+    if (is_empty()) return false;
+    data_type* pointer = Traits::HandleToPointer(handle);
+    if (is_singleton()) {
+      return singleton() == pointer;
+    }
+    const List* list = this->list();
+    DCHECK(std::is_sorted(list->begin(), list->end()));
+    return std::binary_search(list->begin(), list->end(), pointer);
+  }
+
+  void remove(T handle, Zone* zone) {
+    if (is_empty()) return;
+    data_type* pointer = Traits::HandleToPointer(handle);
+    if (is_singleton()) {
+      if (singleton() == pointer) {
+        data_ = EmptyValue();
+      }
+      return;
+    }
+    const List* current_list = list();
+    auto found_it =
+        std::lower_bound(current_list->begin(), current_list->end(), pointer);
+    if (found_it == current_list->end() || *found_it != pointer) {
+      // Not in the list.
+      return;
+    }
+    // Otherwise, lower_bound returned the location of the value.
+
+    // Drop back down to singleton mode if the size will drops to 1 -- this is
+    // needed to ensure that comparisons are correct. We never have to drop down
+    // from list to zero size.
+    DCHECK_GE(current_list->size(), 2);
+    if (current_list->size() == 2) {
+      data_type* other_value;
+      if (found_it == current_list->begin()) {
+        other_value = current_list->at(1);
+      } else {
+        other_value = current_list->at(0);
+      }
+      data_ = PointerWithPayload(other_value, kSingletonTag);
+      return;
+    }
+
+    // We need to copy the list to mutate it, so that trivial copies of the
+    // data_ pointer don't observe changes to the list.
+    List* new_list = NewList(current_list->size() - 1, zone);
+    auto new_it = new_list->begin();
+    new_it = std::copy(current_list->begin(), found_it, new_it);
+    new_it = std::copy(found_it + 1, current_list->end(), new_it);
+    DCHECK_EQ(new_it, new_list->end());
+    DCHECK(std::is_sorted(new_list->begin(), new_list->end()));
+    data_ = PointerWithPayload(new_list, kListTag);
+  }
+
+  void clear() { data_ = EmptyValue(); }
+
+  friend bool operator==(ZoneCompactSet<T> const& lhs,
+                         ZoneCompactSet<T> const& rhs) {
+    if (lhs.data_ == rhs.data_) return true;
+    if (lhs.is_list() && rhs.is_list()) {
+      List const* const lhs_list = lhs.list();
+      List const* const rhs_list = rhs.list();
+      return std::equal(lhs_list->begin(), lhs_list->end(), rhs_list->begin(),
+                        rhs_list->end());
+    }
+    return false;
+  }
+
+  friend bool operator!=(ZoneCompactSet<T> const& lhs,
+                         ZoneCompactSet<T> const& rhs) {
+    return !(lhs == rhs);
+  }
+
+  friend uintptr_t hash_value(ZoneCompactSet<T> const& set) {
+    return set.data_.raw();
+  }
+
+  class const_iterator;
+  inline const_iterator begin() const;
+  inline const_iterator end() const;
+
+ private:
+  enum Tag { kSingletonTag = 0, kEmptyTag = 1, kListTag = 2 };
+
+  using List = base::Vector<data_type*>;
+  using PointerWithPayload = base::PointerWithPayload<void, Tag, 2>;
+
+  bool is_singleton() const { return data_.GetPayload() == kSingletonTag; }
+  bool is_list() const { return data_.GetPayload() == kListTag; }
+
+  List const* list() const {
+    DCHECK(is_list());
+    return static_cast<List const*>(data_.GetPointerWithKnownPayload(kListTag));
+  }
+
+  data_type* singleton() const {
+    return static_cast<data_type*>(
+        data_.GetPointerWithKnownPayload(kSingletonTag));
+  }
+
+  List* NewList(size_t size, Zone* zone) {
+    // We need to allocate both the List, and the backing store of the list, in
+    // the zone, so that we have a List pointer and not an on-stack List (which
+    // we can't use in the `data_` pointer).
+    return zone->New<List>(zone->AllocateArray<data_type*>(size), size);
+  }
+
+  static PointerWithPayload EmptyValue() {
+    return PointerWithPayload(nullptr, kEmptyTag);
+  }
+
+  PointerWithPayload data_;
+};
+
+template <typename T>
+std::ostream& operator<<(std::ostream& os, ZoneCompactSet<T> set) {
+  for (size_t i = 0; i < set.size(); ++i) {
+    if (i > 0) os << ", ";
+    os << set.at(i);
+  }
+  return os;
+}
+
+template <typename T>
+class ZoneCompactSet<T>::const_iterator {
+ public:
+  using iterator_category = std::forward_iterator_tag;
+  using difference_type = std::ptrdiff_t;
+  using value_type = T;
+  using reference = value_type;
+  using pointer = value_type*;
+
+  const_iterator(const const_iterator& other) = default;
+  const_iterator& operator=(const const_iterator& other) = default;
+
+  reference operator*() const { return (*set_)[current_]; }
+  bool operator==(const const_iterator& other) const {
+    return set_ == other.set_ && current_ == other.current_;
+  }
+  bool operator!=(const const_iterator& other) const {
+    return !(*this == other);
+  }
+  const_iterator& operator++() {
+    DCHECK(current_ < set_->size());
+    current_ += 1;
+    return *this;
+  }
+  const_iterator operator++(int);
+
+ private:
+  friend class ZoneCompactSet<T>;
+
+  explicit const_iterator(const ZoneCompactSet<T>* set, size_t current)
+      : set_(set), current_(current) {}
+
+  const ZoneCompactSet<T>* set_;
+  size_t current_;
+};
+
+template <typename T>
+typename ZoneCompactSet<T>::const_iterator ZoneCompactSet<T>::begin() const {
+  return ZoneCompactSet<T>::const_iterator(this, 0);
+}
+
+template <typename T>
+typename ZoneCompactSet<T>::const_iterator ZoneCompactSet<T>::end() const {
+  return ZoneCompactSet<T>::const_iterator(this, size());
+}
+
+template <typename T>
+using ZoneHandleSet = ZoneCompactSet<Handle<T>>;
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_ZONE_ZONE_COMPACT_SET_H_
diff --git a/deps/v8/src/zone/zone-containers.h b/deps/v8/src/zone/zone-containers.h
index f78948e2dd224c..d9219e14b736bf 100644
--- a/deps/v8/src/zone/zone-containers.h
+++ b/deps/v8/src/zone/zone-containers.h
@@ -18,6 +18,9 @@
 #include <unordered_set>
 
 #include "src/base/functional.h"
+#include "src/base/intrusive-set.h"
+#include "src/base/small-map.h"
+#include "src/base/small-vector.h"
 #include "src/zone/zone-allocator.h"
 
 namespace v8 {
@@ -61,7 +64,7 @@ class ZoneVector {
   // Constructs a new vector and fills it with {size} elements, each
   // constructed via the default constructor.
   ZoneVector(size_t size, Zone* zone) : zone_(zone) {
-    data_ = size > 0 ? zone->NewArray<T>(size) : nullptr;
+    data_ = size > 0 ? zone->AllocateArray<T>(size) : nullptr;
     end_ = capacity_ = data_ + size;
     for (T* p = data_; p < end_; p++) emplace(p);
   }
@@ -69,7 +72,7 @@ class ZoneVector {
   // Constructs a new vector and fills it with {size} elements, each
   // having the value {def}.
   ZoneVector(size_t size, T def, Zone* zone) : zone_(zone) {
-    data_ = size > 0 ? zone->NewArray<T>(size) : nullptr;
+    data_ = size > 0 ? zone->AllocateArray<T>(size) : nullptr;
     end_ = capacity_ = data_ + size;
     for (T* p = data_; p < end_; p++) emplace(p, def);
   }
@@ -79,7 +82,7 @@ class ZoneVector {
   ZoneVector(std::initializer_list<T> list, Zone* zone) : zone_(zone) {
     size_t size = list.size();
     if (size > 0) {
-      data_ = zone->NewArray<T>(size);
+      data_ = zone->AllocateArray<T>(size);
       CopyToNewStorage(data_, list.begin(), list.end());
     } else {
       data_ = nullptr;
@@ -96,7 +99,7 @@ class ZoneVector {
                       std::random_access_iterator_tag,
                       typename std::iterator_traits<It>::iterator_category>) {
       size_t size = last - first;
-      data_ = size > 0 ? zone->NewArray<T>(size) : nullptr;
+      data_ = size > 0 ? zone->AllocateArray<T>(size) : nullptr;
       end_ = capacity_ = data_ + size;
       for (T* p = data_; p < end_; p++) emplace(p, *first++);
     } else {
@@ -144,7 +147,7 @@ class ZoneVector {
       if (data_) zone_->DeleteArray(data_, capacity());
       size_t new_cap = other.capacity();
       if (new_cap > 0) {
-        data_ = zone_->NewArray<T>(new_cap);
+        data_ = zone_->AllocateArray<T>(new_cap);
         CopyToNewStorage(data_, other.data_, other.end_);
       } else {
         data_ = nullptr;
@@ -384,13 +387,13 @@ class ZoneVector {
     return new_capacity < minimum ? minimum : new_capacity;
   }
 
-  void EnsureOneMoreCapacity() {
-    if (end_ < capacity_) return;
+  V8_INLINE void EnsureOneMoreCapacity() {
+    if (V8_LIKELY(end_ < capacity_)) return;
     Grow(capacity() + 1);
   }
 
-  void EnsureCapacity(size_t minimum) {
-    if (minimum <= capacity()) return;
+  V8_INLINE void EnsureCapacity(size_t minimum) {
+    if (V8_LIKELY(minimum <= capacity())) return;
     Grow(minimum);
   }
 
@@ -462,12 +465,12 @@ class ZoneVector {
 
 #undef EMIT_TRIVIAL_CASE
 
-  void Grow(size_t minimum) {
+  V8_NOINLINE V8_PRESERVE_MOST void Grow(size_t minimum) {
     T* old_data = data_;
     T* old_end = end_;
     size_t old_size = size();
     size_t new_capacity = NewCapacity(minimum);
-    data_ = zone_->NewArray<T>(new_capacity);
+    data_ = zone_->AllocateArray<T>(new_capacity);
     end_ = data_ + old_size;
     if (old_data) {
       MoveToNewStorage(data_, old_data, old_end);
@@ -488,7 +491,7 @@ class ZoneVector {
       T* old_end = end_;
       size_t old_size = size();
       size_t new_capacity = NewCapacity(old_size + count);
-      data_ = zone_->NewArray<T>(new_capacity);
+      data_ = zone_->AllocateArray<T>(new_capacity);
       end_ = data_ + old_size + count;
       if (old_data) {
         MoveToNewStorage(data_, old_data, pos);
@@ -588,6 +591,16 @@ bool operator<(const ZoneVector<T>& lhs, const ZoneVector<T>& rhs) {
                                       rhs.end());
 }
 
+template <class T, class GetIntrusiveSetIndex>
+class ZoneIntrusiveSet
+    : public base::IntrusiveSet<T, GetIntrusiveSetIndex, ZoneVector<T>> {
+ public:
+  explicit ZoneIntrusiveSet(Zone* zone, GetIntrusiveSetIndex index_functor = {})
+      : base::IntrusiveSet<T, GetIntrusiveSetIndex, ZoneVector<T>>(
+            ZoneVector<T>(zone), std::move(index_functor)) {}
+};
+using base::IntrusiveSetIndex;
+
 // A wrapper subclass for std::deque to make it easy to construct one
 // that uses a zone allocator.
 template <typename T>
@@ -669,7 +682,7 @@ class ZoneSet : public std::set<K, Compare, ZoneAllocator<K>> {
 template <typename K, typename Compare = std::less<K>>
 class ZoneMultiset : public std::multiset<K, Compare, ZoneAllocator<K>> {
  public:
-  // Constructs an empty set.
+  // Constructs an empty multiset.
   explicit ZoneMultiset(Zone* zone)
       : std::multiset<K, Compare, ZoneAllocator<K>>(Compare(),
                                                     ZoneAllocator<K>(zone)) {}
@@ -710,7 +723,7 @@ template <typename K, typename Hash = base::hash<K>,
 class ZoneUnorderedSet
     : public std::unordered_set<K, Hash, KeyEqual, ZoneAllocator<K>> {
  public:
-  // Constructs an empty map.
+  // Constructs an empty set.
   explicit ZoneUnorderedSet(Zone* zone, size_t bucket_count = 100)
       : std::unordered_set<K, Hash, KeyEqual, ZoneAllocator<K>>(
             bucket_count, Hash(), KeyEqual(), ZoneAllocator<K>(zone)) {}
@@ -729,6 +742,47 @@ class ZoneMultimap
             Compare(), ZoneAllocator<std::pair<const K, V>>(zone)) {}
 };
 
+// A wrapper subclass for base::SmallVector to make it easy to construct one
+// that uses a zone allocator.
+template <typename T, size_t kSize>
+class SmallZoneVector : public base::SmallVector<T, kSize, ZoneAllocator<T>> {
+ public:
+  // Constructs an empty small vector.
+  explicit SmallZoneVector(Zone* zone)
+      : base::SmallVector<T, kSize, ZoneAllocator<T>>(ZoneAllocator<T>(zone)) {}
+
+  explicit SmallZoneVector(size_t size, Zone* zone)
+      : base::SmallVector<T, kSize, ZoneAllocator<T>>(
+            size, ZoneAllocator<T>(ZoneAllocator<T>(zone))) {}
+};
+
+// Used by SmallZoneMap below. Essentially a closure around placement-new of
+// the "full" fallback ZoneMap. Called once SmallMap grows beyond kArraySize.
+template <typename ZoneMap>
+class ZoneMapInit {
+ public:
+  explicit ZoneMapInit(Zone* zone) : zone_(zone) {}
+  void operator()(ZoneMap* map) const { new (map) ZoneMap(zone_); }
+
+ private:
+  Zone* zone_;
+};
+
+// A wrapper subclass for base::SmallMap to make it easy to construct one that
+// uses a zone-allocated std::map as the fallback once the SmallMap outgrows
+// its inline storage.
+template <typename K, typename V, size_t kArraySize,
+          typename Compare = std::less<K>, typename KeyEqual = std::equal_to<K>>
+class SmallZoneMap
+    : public base::SmallMap<ZoneMap<K, V, Compare>, kArraySize, KeyEqual,
+                            ZoneMapInit<ZoneMap<K, V, Compare>>> {
+ public:
+  explicit SmallZoneMap(Zone* zone)
+      : base::SmallMap<ZoneMap<K, V, Compare>, kArraySize, KeyEqual,
+                       ZoneMapInit<ZoneMap<K, V, Compare>>>(
+            ZoneMapInit<ZoneMap<K, V, Compare>>(zone)) {}
+};
+
 // Typedefs to shorten commonly used vectors.
 using IntVector = ZoneVector<int>;
 
diff --git a/deps/v8/src/zone/zone-handle-set.h b/deps/v8/src/zone/zone-handle-set.h
deleted file mode 100644
index 301ca67cb7949f..00000000000000
--- a/deps/v8/src/zone/zone-handle-set.h
+++ /dev/null
@@ -1,248 +0,0 @@
-// Copyright 2016 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_ZONE_ZONE_HANDLE_SET_H_
-#define V8_ZONE_ZONE_HANDLE_SET_H_
-
-#include "src/handles/handles.h"
-#include "src/zone/zone-containers.h"
-#include "src/zone/zone.h"
-
-namespace v8 {
-namespace internal {
-
-template <typename T>
-class ZoneHandleSet final {
- public:
-  ZoneHandleSet() : data_(kEmptyTag) {}
-  explicit ZoneHandleSet(Handle<T> handle)
-      : data_(handle.address() | kSingletonTag) {
-    DCHECK(IsAligned(handle.address(), kPointerAlignment));
-  }
-
-  bool is_empty() const { return data_ == kEmptyTag; }
-
-  size_t size() const {
-    if ((data_ & kTagMask) == kEmptyTag) return 0;
-    if ((data_ & kTagMask) == kSingletonTag) return 1;
-    return list()->size();
-  }
-
-  Handle<T> at(size_t i) const {
-    DCHECK_NE(kEmptyTag, data_ & kTagMask);
-    if ((data_ & kTagMask) == kSingletonTag) {
-      DCHECK_EQ(0u, i);
-      return Handle<T>(singleton());
-    }
-    return Handle<T>(list()->at(static_cast<int>(i)));
-  }
-
-  Handle<T> operator[](size_t i) const { return at(i); }
-
-  void insert(Handle<T> handle, Zone* zone) {
-    Address* const value = reinterpret_cast<Address*>(handle.address());
-    DCHECK(IsAligned(reinterpret_cast<Address>(value), kPointerAlignment));
-    if ((data_ & kTagMask) == kEmptyTag) {
-      data_ = reinterpret_cast<Address>(value) | kSingletonTag;
-    } else if ((data_ & kTagMask) == kSingletonTag) {
-      if (singleton() == value) return;
-      List* list = zone->New<List>(zone);
-      if (singleton() < value) {
-        list->push_back(singleton());
-        list->push_back(value);
-      } else {
-        list->push_back(value);
-        list->push_back(singleton());
-      }
-      DCHECK(IsAligned(reinterpret_cast<Address>(list), kPointerAlignment));
-      data_ = reinterpret_cast<Address>(list) | kListTag;
-    } else {
-      DCHECK_EQ(kListTag, data_ & kTagMask);
-      List const* const old_list = list();
-      for (size_t i = 0; i < old_list->size(); ++i) {
-        if (old_list->at(i) == value) return;
-        if (old_list->at(i) > value) break;
-      }
-      List* new_list = zone->New<List>(zone);
-      new_list->reserve(old_list->size() + 1);
-      size_t i = 0;
-      for (; i < old_list->size(); ++i) {
-        if (old_list->at(i) > value) break;
-        new_list->push_back(old_list->at(i));
-      }
-      new_list->push_back(value);
-      for (; i < old_list->size(); ++i) {
-        new_list->push_back(old_list->at(i));
-      }
-      DCHECK_EQ(old_list->size() + 1, new_list->size());
-      DCHECK(IsAligned(reinterpret_cast<Address>(new_list), kPointerAlignment));
-      data_ = reinterpret_cast<Address>(new_list) | kListTag;
-    }
-  }
-
-  void Union(ZoneHandleSet<T> const& other, Zone* zone) {
-    for (size_t i = 0; i < other.size(); ++i) {
-      insert(other.at(i), zone);
-    }
-  }
-
-  bool contains(ZoneHandleSet<T> const& other) const {
-    if (data_ == other.data_) return true;
-    if (data_ == kEmptyTag) return false;
-    if (other.data_ == kEmptyTag) return true;
-    if ((data_ & kTagMask) == kSingletonTag) return false;
-    DCHECK_EQ(kListTag, data_ & kTagMask);
-    List const* cached_list = list();
-    if ((other.data_ & kTagMask) == kSingletonTag) {
-      return std::find(cached_list->begin(), cached_list->end(),
-                       other.singleton()) != cached_list->end();
-    }
-    DCHECK_EQ(kListTag, other.data_ & kTagMask);
-    // TODO(bmeurer): Optimize this case.
-    for (size_t i = 0; i < other.list()->size(); ++i) {
-      if (std::find(cached_list->begin(), cached_list->end(),
-                    other.list()->at(i)) == cached_list->end()) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  bool contains(Handle<T> other) const {
-    if (data_ == kEmptyTag) return false;
-    Address* other_address = reinterpret_cast<Address*>(other.address());
-    if ((data_ & kTagMask) == kSingletonTag) {
-      return singleton() == other_address;
-    }
-    DCHECK_EQ(kListTag, data_ & kTagMask);
-    return std::find(list()->begin(), list()->end(), other_address) !=
-           list()->end();
-  }
-
-  void remove(Handle<T> handle, Zone* zone) {
-    // TODO(bmeurer): Optimize this case.
-    ZoneHandleSet<T> that;
-    for (size_t i = 0; i < size(); ++i) {
-      Handle<T> value = at(i);
-      if (value.address() != handle.address()) {
-        that.insert(value, zone);
-      }
-    }
-    std::swap(*this, that);
-  }
-
-  friend bool operator==(ZoneHandleSet<T> const& lhs,
-                         ZoneHandleSet<T> const& rhs) {
-    if (lhs.data_ == rhs.data_) return true;
-    if ((lhs.data_ & kTagMask) == kListTag &&
-        (rhs.data_ & kTagMask) == kListTag) {
-      List const* const lhs_list = lhs.list();
-      List const* const rhs_list = rhs.list();
-      if (lhs_list->size() == rhs_list->size()) {
-        for (size_t i = 0; i < lhs_list->size(); ++i) {
-          if (lhs_list->at(i) != rhs_list->at(i)) return false;
-        }
-        return true;
-      }
-    }
-    return false;
-  }
-
-  friend bool operator!=(ZoneHandleSet<T> const& lhs,
-                         ZoneHandleSet<T> const& rhs) {
-    return !(lhs == rhs);
-  }
-
-  friend size_t hash_value(ZoneHandleSet<T> const& set) {
-    return static_cast<size_t>(set.data_);
-  }
-
-  class const_iterator;
-  inline const_iterator begin() const;
-  inline const_iterator end() const;
-
- private:
-  using List = ZoneVector<Address*>;
-
-  List const* list() const {
-    DCHECK_EQ(kListTag, data_ & kTagMask);
-    return reinterpret_cast<List const*>(data_ - kListTag);
-  }
-
-  Address* singleton() const {
-    DCHECK_EQ(kSingletonTag, data_ & kTagMask);
-    return reinterpret_cast<Address*>(data_ - kSingletonTag);
-  }
-
-  enum Tag : Address {
-    kSingletonTag = 0,
-    kEmptyTag = 1,
-    kListTag = 2,
-    kTagMask = 3
-  };
-
-  static_assert(kTagMask < kPointerAlignment);
-
-  Address data_;
-};
-
-template <typename T>
-std::ostream& operator<<(std::ostream& os, ZoneHandleSet<T> set) {
-  for (size_t i = 0; i < set.size(); ++i) {
-    if (i > 0) os << ", ";
-    os << set.at(i);
-  }
-  return os;
-}
-
-template <typename T>
-class ZoneHandleSet<T>::const_iterator {
- public:
-  using iterator_category = std::forward_iterator_tag;
-  using difference_type = std::ptrdiff_t;
-  using value_type = Handle<T>;
-  using reference = value_type;
-  using pointer = value_type*;
-
-  const_iterator(const const_iterator& other) = default;
-  const_iterator& operator=(const const_iterator& other) = default;
-
-  reference operator*() const { return (*set_)[current_]; }
-  bool operator==(const const_iterator& other) const {
-    return set_ == other.set_ && current_ == other.current_;
-  }
-  bool operator!=(const const_iterator& other) const {
-    return !(*this == other);
-  }
-  const_iterator& operator++() {
-    DCHECK(current_ < set_->size());
-    current_ += 1;
-    return *this;
-  }
-  const_iterator operator++(int);
-
- private:
-  friend class ZoneHandleSet<T>;
-
-  explicit const_iterator(const ZoneHandleSet<T>* set, size_t current)
-      : set_(set), current_(current) {}
-
-  const ZoneHandleSet<T>* set_;
-  size_t current_;
-};
-
-template <typename T>
-typename ZoneHandleSet<T>::const_iterator ZoneHandleSet<T>::begin() const {
-  return ZoneHandleSet<T>::const_iterator(this, 0);
-}
-
-template <typename T>
-typename ZoneHandleSet<T>::const_iterator ZoneHandleSet<T>::end() const {
-  return ZoneHandleSet<T>::const_iterator(this, size());
-}
-
-}  // namespace internal
-}  // namespace v8
-
-#endif  // V8_ZONE_ZONE_HANDLE_SET_H_
diff --git a/deps/v8/src/zone/zone-list-inl.h b/deps/v8/src/zone/zone-list-inl.h
index 7cf9bec1aefb32..42d2633fb9d035 100644
--- a/deps/v8/src/zone/zone-list-inl.h
+++ b/deps/v8/src/zone/zone-list-inl.h
@@ -28,7 +28,7 @@ void ZoneList<T>::AddAll(const ZoneList<T>& other, Zone* zone) {
 }
 
 template <typename T>
-void ZoneList<T>::AddAll(const base::Vector<const T>& other, Zone* zone) {
+void ZoneList<T>::AddAll(base::Vector<const T> other, Zone* zone) {
   int length = other.length();
   if (length == 0) return;
 
@@ -65,7 +65,7 @@ void ZoneList<T>::ResizeAddInternal(const T& element, Zone* zone) {
 template <typename T>
 void ZoneList<T>::Resize(int new_capacity, Zone* zone) {
   DCHECK_LE(length_, new_capacity);
-  T* new_data = zone->NewArray<T>(new_capacity);
+  T* new_data = zone->AllocateArray<T>(new_capacity);
   if (length_ > 0) {
     if (std::is_trivially_copyable<T>::value) {
       MemCopy(new_data, data_, length_ * sizeof(T));
diff --git a/deps/v8/src/zone/zone-list.h b/deps/v8/src/zone/zone-list.h
index e24d9610dc408a..52844accf8b08c 100644
--- a/deps/v8/src/zone/zone-list.h
+++ b/deps/v8/src/zone/zone-list.h
@@ -34,7 +34,7 @@ class ZoneList final : public ZoneObject {
   // always zero. The capacity must be non-negative.
   ZoneList(int capacity, Zone* zone) : capacity_(capacity) {
     DCHECK_GE(capacity, 0);
-    data_ = (capacity_ > 0) ? zone->NewArray<T>(capacity_) : nullptr;
+    data_ = (capacity_ > 0) ? zone->AllocateArray<T>(capacity_) : nullptr;
   }
 
   // Construct a new ZoneList by copying the elements of the given ZoneList.
@@ -44,7 +44,7 @@ class ZoneList final : public ZoneObject {
   }
 
   // Construct a new ZoneList by copying the elements of the given vector.
-  ZoneList(const base::Vector<const T>& other, Zone* zone)
+  ZoneList(base::Vector<const T> other, Zone* zone)
       : ZoneList(other.length(), zone) {
     AddAll(other, zone);
   }
@@ -112,7 +112,7 @@ class ZoneList final : public ZoneObject {
   // Add all the elements from the argument list to this list.
   void AddAll(const ZoneList<T>& other, Zone* zone);
   // Add all the elements from the vector to this list.
-  void AddAll(const base::Vector<const T>& other, Zone* zone);
+  void AddAll(base::Vector<const T> other, Zone* zone);
   // Inserts the element at the specific index.
   void InsertAt(int index, const T& element, Zone* zone);
 
diff --git a/deps/v8/src/zone/zone-utils.h b/deps/v8/src/zone/zone-utils.h
index 1c08fcac0c496a..996ad76c9024f2 100644
--- a/deps/v8/src/zone/zone-utils.h
+++ b/deps/v8/src/zone/zone-utils.h
@@ -15,11 +15,11 @@ namespace v8 {
 namespace internal {
 
 template <typename T>
-base::Vector<T> CloneVector(Zone* zone, const base::Vector<const T>& other) {
+base::Vector<T> CloneVector(Zone* zone, base::Vector<const T> other) {
   int length = other.length();
   if (length == 0) return base::Vector<T>();
 
-  T* data = zone->NewArray<T>(length);
+  T* data = zone->AllocateArray<T>(length);
   if (std::is_trivially_copyable<T>::value) {
     MemCopy(data, other.data(), length * sizeof(T));
   } else {
diff --git a/deps/v8/src/zone/zone.h b/deps/v8/src/zone/zone.h
index 3ddda6b2df8a74..cdaa92887bd7b5 100644
--- a/deps/v8/src/zone/zone.h
+++ b/deps/v8/src/zone/zone.h
@@ -122,29 +122,40 @@ class V8_EXPORT_PRIVATE Zone final {
   // buffer allocations with meaningful names to make buffer allocation sites
   // distinguishable between each other.
   template <typename T, typename TypeTag = T[]>
-  T* NewArray(size_t length) {
+  T* AllocateArray(size_t length) {
     static_assert(alignof(T) <= kAlignmentInBytes);
     DCHECK_IMPLIES(is_compressed_pointer<T>::value, supports_compression());
     DCHECK_LT(length, std::numeric_limits<size_t>::max() / sizeof(T));
     return static_cast<T*>(Allocate<TypeTag>(length * sizeof(T)));
   }
 
+  // Allocates a Vector with 'length' uninitialized entries.
+  template <typename T, typename TypeTag = T[]>
+  base::Vector<T> AllocateVector(size_t length) {
+    T* new_array = AllocateArray<T, TypeTag>(length);
+    return {new_array, length};
+  }
+
+  // Allocates a Vector with 'length' elements and value-constructs them.
   template <typename T, typename TypeTag = T[]>
   base::Vector<T> NewVector(size_t length) {
-    T* new_array = NewArray<T, TypeTag>(length);
+    T* new_array = AllocateArray<T, TypeTag>(length);
+    std::uninitialized_value_construct_n(new_array, length);
     return {new_array, length};
   }
 
+  // Allocates a Vector with 'length' elements and initializes them with
+  // 'value'.
   template <typename T, typename TypeTag = T[]>
   base::Vector<T> NewVector(size_t length, T value) {
-    T* new_array = NewArray<T, TypeTag>(length);
+    T* new_array = AllocateArray<T, TypeTag>(length);
     std::uninitialized_fill_n(new_array, length, value);
     return {new_array, length};
   }
 
   template <typename T, typename TypeTag = std::remove_const_t<T>[]>
   base::Vector<std::remove_const_t<T>> CloneVector(base::Vector<T> v) {
-    auto* new_array = NewArray<std::remove_const_t<T>, TypeTag>(v.size());
+    auto* new_array = AllocateArray<std::remove_const_t<T>, TypeTag>(v.size());
     std::uninitialized_copy(v.begin(), v.end(), new_array);
     return {new_array, v.size()};
   }
@@ -217,6 +228,7 @@ class V8_EXPORT_PRIVATE Zone final {
   void ReleaseSegment(Segment* segment);
 
   // All pointers returned from New() are 8-byte aligned.
+  // ASan requires 8-byte alignment. MIPS also requires 8-byte alignment.
   static const size_t kAlignmentInBytes = 8;
 
   // Never allocate segments smaller than this size in bytes.
@@ -320,8 +332,8 @@ class ZoneAllocationPolicy {
   explicit ZoneAllocationPolicy(Zone* zone) : zone_(zone) {}
 
   template <typename T, typename TypeTag = T[]>
-  V8_INLINE T* NewArray(size_t length) {
-    return zone()->NewArray<T, TypeTag>(length);
+  V8_INLINE T* AllocateArray(size_t length) {
+    return zone()->AllocateArray<T, TypeTag>(length);
   }
   template <typename T, typename TypeTag = T[]>
   V8_INLINE void DeleteArray(T* p, size_t length) {
diff --git a/deps/v8/test/benchmarks/benchmarks.status b/deps/v8/test/benchmarks/benchmarks.status
index a75bfb87b4f347..c8ce9d4da5477a 100644
--- a/deps/v8/test/benchmarks/benchmarks.status
+++ b/deps/v8/test/benchmarks/benchmarks.status
@@ -92,6 +92,7 @@
 
 ['variant == nooptimization and mode == debug', {
   # Too slow for nooptimization mode and debug.
+  'kraken/imaging-desaturate': [SKIP],
   'kraken/imaging-gaussian-blur': [SKIP],
 }],
 
@@ -99,6 +100,7 @@
   # Too slow for stress_incremental_marking.
   'octane/box2d': [SKIP],
   'octane/typescript': [SKIP],
+  'octane/earley-boyer' : [PASS, SLOW, ['mode == debug', FAIL]],
 }],
 
 ['gc_fuzzer', {
@@ -114,14 +116,16 @@
   'octane/gbemu-part1': [SKIP],
 }], # gc_fuzzer or deopt_fuzzer
 
-['predictable', {
+['verify_predictable', {
   # https://crbug.com/v8/8537
   'octane/typescript': [SKIP],
 
   # https://crbug.com/v8/13234
   'octane/box2d': [SKIP],
   'octane/earley-boyer': [SKIP],
-}],  # 'predictable'
+  'octane/gbemu-part1': [SKIP],
+  'octane/pdfjs': [SKIP],
+}],  # 'verify_predictable'
 
 ['variant == stress_snapshot', {
   '*': [SKIP],  # only relevant for mjsunit tests.
@@ -136,4 +140,22 @@
   'octane/pdfjs': [SLOW],
 }],  # 'tsan'
 
+##############################################################################
+['gc_fuzzer or deopt_fuzzer or interrupt_fuzzer', {
+  # BUG(v8:13808) Skipped until bug is fixed.
+  'octane/pdfjs': [SKIP],
+}], # gc_fuzzer or deopt_fuzzer or interrupt_fuzzer
+
+##############################################################################
+['variant == jitless and mode == debug and tsan', {
+  # Too slow for jitless mode in tsan debug.
+  'kraken/ai-astar': [SKIP],
+  'kraken/audio-beat-detection': [SKIP],
+  'kraken/audio-dft': [SKIP],
+  'kraken/audio-oscillator': [SKIP],
+  'kraken/imaging-darkroom': [SKIP],
+  'octane/box2d': [SKIP],
+  'octane/crypto': [SKIP],
+}], # 'variant == jitless and mode == debug and tsan'
+
 ]
diff --git a/deps/v8/test/benchmarks/cpp/cppgc/allocation_perf.cc b/deps/v8/test/benchmarks/cpp/cppgc/allocation_perf.cc
index 4bcb9e430c4cca..5b498a1e6930f2 100644
--- a/deps/v8/test/benchmarks/cpp/cppgc/allocation_perf.cc
+++ b/deps/v8/test/benchmarks/cpp/cppgc/allocation_perf.cc
@@ -26,8 +26,9 @@ BENCHMARK_F(Allocate, Tiny)(benchmark::State& st) {
   subtle::NoGarbageCollectionScope no_gc(*Heap::From(&heap()));
   for (auto _ : st) {
     USE(_);
-    benchmark::DoNotOptimize(
-        cppgc::MakeGarbageCollected<TinyObject>(heap().GetAllocationHandle()));
+    TinyObject* result =
+        cppgc::MakeGarbageCollected<TinyObject>(heap().GetAllocationHandle());
+    benchmark::DoNotOptimize(result);
   }
   st.SetBytesProcessed(st.iterations() * sizeof(TinyObject));
 }
@@ -42,8 +43,9 @@ BENCHMARK_F(Allocate, Large)(benchmark::State& st) {
   subtle::NoGarbageCollectionScope no_gc(*Heap::From(&heap()));
   for (auto _ : st) {
     USE(_);
-    benchmark::DoNotOptimize(
-        cppgc::MakeGarbageCollected<LargeObject>(heap().GetAllocationHandle()));
+    LargeObject* result =
+        cppgc::MakeGarbageCollected<LargeObject>(heap().GetAllocationHandle());
+    benchmark::DoNotOptimize(result);
   }
   st.SetBytesProcessed(st.iterations() * sizeof(LargeObject));
 }
diff --git a/deps/v8/test/benchmarks/csuite/benchmark.py b/deps/v8/test/benchmarks/csuite/benchmark.py
index 99c472ca41f86f..531c14a4a12036 100755
--- a/deps/v8/test/benchmarks/csuite/benchmark.py
+++ b/deps/v8/test/benchmarks/csuite/benchmark.py
@@ -156,17 +156,17 @@ def ProcessLine(self, line):
     # Kraken or Sunspider?
     g = re.match("(?P<test_name>\w+(-\w+)*)\(RunTime\): (?P<score>\d+) ms\.", \
         line)
-    if g == None:
+    if g is None:
       # Octane?
       g = re.match("(?P<test_name>\w+): (?P<score>\d+)", line)
-      if g == None:
+      if g is None:
         g = re.match("Score \(version [0-9]+\): (?P<score>\d+)", line)
-        if g != None:
+        if g is not None:
           return ('Octane', g.group('score'))
         else:
           # Generic?
           g = re.match("(?P<test_name>\w+)\W+(?P<score>\d+)", line)
-          if g == None:
+          if g is None:
             return (None, None)
     return (g.group('test_name'), g.group('score'))
 
@@ -177,7 +177,7 @@ def ProcessOutput(self, suitename):
       with open(outfile, 'r') as f:
         for line in f:
           (test, result) = self.ProcessLine(line)
-          if test != None:
+          if test is not None:
             suite.RecordResult(test, result)
 
     suite.ProcessResults(self.opts)
diff --git a/deps/v8/test/benchmarks/testcfg.py b/deps/v8/test/benchmarks/testcfg.py
index 7c7974cfd9d56d..7a03d94341ca51 100644
--- a/deps/v8/test/benchmarks/testcfg.py
+++ b/deps/v8/test/benchmarks/testcfg.py
@@ -101,7 +101,7 @@ class TestSuite(testsuite.TestSuite):
 
   def __init__(self, ctx, *args, **kwargs):
     super(TestSuite, self).__init__(ctx, *args, **kwargs)
-    self.testroot = os.path.join(self.root, "data")
+    self.testroot = self.root / "data"
 
   def _test_loader_class(self):
     return TestLoader
@@ -115,24 +115,23 @@ def _get_files_params(self):
     path = self.path
     testroot = self.suite.testroot
     files = []
-    if path.startswith("kraken"):
-      files.append(os.path.join(testroot, "%s-data.js" % path))
-      files.append(os.path.join(testroot, "%s.js" % path))
-    elif path.startswith("octane"):
-      files.append(os.path.join(testroot, "octane/base.js"))
-      files.append(os.path.join(testroot, "%s.js" % path))
-      if path.startswith("octane/gbemu"):
-        files.append(os.path.join(testroot, "octane/gbemu-part2.js"))
-      elif path.startswith("octane/typescript"):
-        files.append(os.path.join(testroot,
-                                  "octane/typescript-compiler.js"))
-        files.append(os.path.join(testroot, "octane/typescript-input.js"))
-      elif path.startswith("octane/zlib"):
-        files.append(os.path.join(testroot, "octane/zlib-data.js"))
+    if path.parts[0] == "kraken":
+      files.append(testroot / f"{path}-data.js")
+      files.append(testroot / f"{path}.js")
+    elif path.parts[0] == "octane":
+      files.append(testroot / "octane/base.js")
+      files.append(testroot / f"{path}.js")
+      if path.parts[1] == "gbemu":
+        files.append(testroot / "octane/gbemu-part2.js")
+      elif path.parts[1] == "typescript":
+        files.append(testroot / "octane/typescript-compiler.js")
+        files.append(testroot / "octane/typescript-input.js")
+      elif path.parts[1] == "zlib":
+        files.append(testroot / "octane/zlib-data.js")
       files += ["-e", "BenchmarkSuite.RunSuites({});"]
-    elif path.startswith("sunspider"):
-      files.append(os.path.join(testroot, "%s.js" % path))
+    elif path.parts[0] == "sunspider":
+      files.append(self._get_source_path())
     return files
 
   def _get_source_path(self):
-    return os.path.join(self.suite.testroot, self.path + self._get_suffix())
+    return self.suite.testroot / self.path_js
diff --git a/deps/v8/test/bigint/testcfg.py b/deps/v8/test/bigint/testcfg.py
index d882f16650dcda..dbac147d808350 100644
--- a/deps/v8/test/bigint/testcfg.py
+++ b/deps/v8/test/bigint/testcfg.py
@@ -2,13 +2,7 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-# for py2/py3 compatibility
-from __future__ import print_function
-
-import os
-
 from testrunner.local import command
-from testrunner.local import utils
 from testrunner.local import testsuite
 from testrunner.objects import testcase
 
@@ -21,14 +15,11 @@ def _get_variants(self, test):
 
 class TestLoader(testsuite.TestLoader):
   def _list_test_filenames(self):
-    shell = os.path.abspath(
-      os.path.join(self.test_config.shell_dir, SHELL))
-    if utils.IsWindows():
-      shell += ".exe"
+    args = ['--list'] + self.test_config.extra_flags
     cmd = self.ctx.command(
         cmd_prefix=self.test_config.command_prefix,
-        shell=shell,
-        args=['--list'] + self.test_config.extra_flags)
+        shell=self.ctx.platform_shell(SHELL, args, self.test_config.shell_dir),
+        args=args)
     output = cmd.execute()
 
     if output.exit_code != 0:
@@ -53,7 +44,7 @@ def _test_class(self):
 
 class TestCase(testcase.TestCase):
   def _get_files_params(self):
-    return [self.path]
+    return [self.name]
 
   def get_shell(self):
     return SHELL
diff --git a/deps/v8/test/cctest/BUILD.gn b/deps/v8/test/cctest/BUILD.gn
index 3451d833edd944..20af62910025ff 100644
--- a/deps/v8/test/cctest/BUILD.gn
+++ b/deps/v8/test/cctest/BUILD.gn
@@ -104,8 +104,6 @@ v8_source_set("cctest_sources") {
     "heap/test-external-string-tracker.cc",
     "heap/test-heap.cc",
     "heap/test-incremental-marking.cc",
-    "heap/test-invalidated-slots.cc",
-    "heap/test-iterators.cc",
     "heap/test-mark-compact.cc",
     "heap/test-memory-measurement.cc",
     "heap/test-spaces.cc",
@@ -200,6 +198,7 @@ v8_source_set("cctest_sources") {
       "compiler/test-run-stackcheck.cc",
       "compiler/test-run-unwinding-info.cc",
       "compiler/test-run-variables.cc",
+      "compiler/test-select-combine.cc",
       "compiler/test-verify-type.cc",
       "setup-isolate-for-tests.cc",
       "setup-isolate-for-tests.h",
@@ -339,7 +338,6 @@ v8_source_set("cctest_sources") {
       "wasm/test-run-wasm-atomics64.cc",
       "wasm/test-run-wasm-bulk-memory.cc",
       "wasm/test-run-wasm-exceptions.cc",
-      "wasm/test-run-wasm-interpreter.cc",
       "wasm/test-run-wasm-js.cc",
       "wasm/test-run-wasm-memory64.cc",
       "wasm/test-run-wasm-module.cc",
diff --git a/deps/v8/test/cctest/assembler-helper-arm.cc b/deps/v8/test/cctest/assembler-helper-arm.cc
index 698005fd9eba74..acf4a2ece95d6d 100644
--- a/deps/v8/test/cctest/assembler-helper-arm.cc
+++ b/deps/v8/test/cctest/assembler-helper-arm.cc
@@ -22,7 +22,7 @@ Handle<Code> AssembleCodeImpl(Isolate* isolate,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
   if (v8_flags.print_code) {
-    code->Print();
+    Print(*code);
   }
   return code;
 }
diff --git a/deps/v8/test/cctest/cctest.cc b/deps/v8/test/cctest/cctest.cc
index bbadc6849b2ce2..63e7442dec82f9 100644
--- a/deps/v8/test/cctest/cctest.cc
+++ b/deps/v8/test/cctest/cctest.cc
@@ -37,6 +37,7 @@
 #include "include/v8-locker.h"
 #include "src/base/lazy-instance.h"
 #include "src/base/logging.h"
+#include "src/base/optional.h"
 #include "src/base/platform/condition-variable.h"
 #include "src/base/platform/mutex.h"
 #include "src/base/platform/semaphore.h"
@@ -51,6 +52,7 @@
 #include "src/flags/flags.h"
 #include "src/objects/objects-inl.h"
 #include "src/trap-handler/trap-handler.h"
+#include "test/cctest/heap/heap-utils.h"
 #include "test/cctest/print-extension.h"
 #include "test/cctest/profiler-extension.h"
 #include "test/cctest/trace-extension.h"
@@ -158,7 +160,16 @@ void CcTest::Run(const char* snapshot_directory) {
 #ifdef DEBUG
   const size_t active_isolates = i::Isolate::non_disposed_isolates();
 #endif  // DEBUG
-  callback_();
+  {
+#ifdef V8_ENABLE_DIRECT_LOCAL
+    // TODO(v8:13270): This handle scope should not be needed. It will be
+    // removed when the implementation of direct handles is complete and they
+    // can never implicitly be converted to indirect handles.
+    v8::base::Optional<v8::HandleScope> scope;
+    if (initialize_) scope.emplace(isolate_);
+#endif
+    callback_();
+  }
 #ifdef DEBUG
   // This DCHECK ensures that all Isolates are properly disposed after finishing
   // the test. Stray Isolates lead to stray tasks in the platform which can
@@ -200,34 +211,6 @@ void CcTest::AddGlobalFunction(v8::Local<v8::Context> env, const char* name,
   env->Global()->Set(env, v8_str(name), func).FromJust();
 }
 
-void CcTest::CollectGarbage(i::AllocationSpace space, i::Isolate* isolate) {
-  i::Isolate* iso = isolate ? isolate : i_isolate();
-  iso->heap()->CollectGarbage(space, i::GarbageCollectionReason::kTesting);
-}
-
-void CcTest::CollectAllGarbage(i::Isolate* isolate) {
-  i::Isolate* iso = isolate ? isolate : i_isolate();
-  iso->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                 i::GarbageCollectionReason::kTesting);
-}
-
-void CcTest::CollectAllAvailableGarbage(i::Isolate* isolate) {
-  i::Isolate* iso = isolate ? isolate : i_isolate();
-  iso->heap()->CollectAllAvailableGarbage(i::GarbageCollectionReason::kTesting);
-}
-
-void CcTest::PreciseCollectAllGarbage(i::Isolate* isolate) {
-  i::Isolate* iso = isolate ? isolate : i_isolate();
-  iso->heap()->PreciseCollectAllGarbage(i::Heap::kNoGCFlags,
-                                        i::GarbageCollectionReason::kTesting);
-}
-
-void CcTest::CollectSharedGarbage(i::Isolate* isolate) {
-  i::Isolate* iso = isolate ? isolate : i_isolate();
-  iso->heap()->CollectGarbageShared(iso->main_thread_local_heap(),
-                                    i::GarbageCollectionReason::kTesting);
-}
-
 i::Handle<i::String> CcTest::MakeString(const char* str) {
   i::Isolate* isolate = CcTest::i_isolate();
   i::Factory* factory = isolate->factory();
@@ -315,9 +298,9 @@ HandleAndZoneScope::HandleAndZoneScope(bool support_zone_compression)
 HandleAndZoneScope::~HandleAndZoneScope() = default;
 
 #ifdef V8_ENABLE_TURBOFAN
-i::Handle<i::JSFunction> Optimize(
-    i::Handle<i::JSFunction> function, i::Zone* zone, i::Isolate* isolate,
-    uint32_t flags, std::unique_ptr<i::compiler::JSHeapBroker>* out_broker) {
+i::Handle<i::JSFunction> Optimize(i::Handle<i::JSFunction> function,
+                                  i::Zone* zone, i::Isolate* isolate,
+                                  uint32_t flags) {
   i::Handle<i::SharedFunctionInfo> shared(function->shared(), isolate);
   i::IsCompiledScope is_compiled_scope(shared->is_compiled_scope(isolate));
   CHECK(is_compiled_scope.is_compiled() ||
@@ -338,7 +321,7 @@ i::Handle<i::JSFunction> Optimize(
   i::JSFunction::EnsureFeedbackVector(isolate, function, &is_compiled_scope);
 
   i::Handle<i::Code> code =
-      i::compiler::Pipeline::GenerateCodeForTesting(&info, isolate, out_broker)
+      i::compiler::Pipeline::GenerateCodeForTesting(&info, isolate)
           .ToHandleChecked();
   function->set_code(*code, v8::kReleaseStore);
   return function;
@@ -425,11 +408,10 @@ int main(int argc, char* argv[]) {
   return 0;
 }
 
-RegisterThreadedTest* RegisterThreadedTest::first_ = nullptr;
-int RegisterThreadedTest::count_ = 0;
+std::vector<const RegisterThreadedTest*> RegisterThreadedTest::tests_;
 
 bool IsValidUnwrapObject(v8::Object* object) {
-  i::Address addr = *reinterpret_cast<i::Address*>(object);
+  i::Address addr = i::ValueHelper::ValueAsAddress(object);
   auto instance_type = i::Internals::GetInstanceType(addr);
   return (v8::base::IsInRange(instance_type,
                               i::Internals::kFirstJSApiObjectType,
@@ -438,45 +420,6 @@ bool IsValidUnwrapObject(v8::Object* object) {
           instance_type == i::Internals::kJSSpecialApiObjectType);
 }
 
-ManualGCScope::ManualGCScope(i::Isolate* isolate)
-    : flag_concurrent_marking_(i::v8_flags.concurrent_marking),
-      flag_concurrent_sweeping_(i::v8_flags.concurrent_sweeping),
-      flag_concurrent_minor_mc_marking_(
-          i::v8_flags.concurrent_minor_mc_marking),
-      flag_stress_concurrent_allocation_(
-          i::v8_flags.stress_concurrent_allocation),
-      flag_stress_incremental_marking_(i::v8_flags.stress_incremental_marking),
-      flag_parallel_marking_(i::v8_flags.parallel_marking),
-      flag_detect_ineffective_gcs_near_heap_limit_(
-          i::v8_flags.detect_ineffective_gcs_near_heap_limit) {
-  // Some tests run threaded (back-to-back) and thus the GC may already be
-  // running by the time a ManualGCScope is created. Finalizing existing marking
-  // prevents any undefined/unexpected behavior.
-  if (isolate && isolate->heap()->incremental_marking()->IsMarking()) {
-    CcTest::CollectGarbage(i::OLD_SPACE, isolate);
-  }
-
-  i::v8_flags.concurrent_marking = false;
-  i::v8_flags.concurrent_sweeping = false;
-  i::v8_flags.concurrent_minor_mc_marking = false;
-  i::v8_flags.stress_incremental_marking = false;
-  i::v8_flags.stress_concurrent_allocation = false;
-  // Parallel marking has a dependency on concurrent marking.
-  i::v8_flags.parallel_marking = false;
-  i::v8_flags.detect_ineffective_gcs_near_heap_limit = false;
-}
-
-ManualGCScope::~ManualGCScope() {
-  i::v8_flags.concurrent_marking = flag_concurrent_marking_;
-  i::v8_flags.concurrent_sweeping = flag_concurrent_sweeping_;
-  i::v8_flags.concurrent_minor_mc_marking = flag_concurrent_minor_mc_marking_;
-  i::v8_flags.stress_concurrent_allocation = flag_stress_concurrent_allocation_;
-  i::v8_flags.stress_incremental_marking = flag_stress_incremental_marking_;
-  i::v8_flags.parallel_marking = flag_parallel_marking_;
-  i::v8_flags.detect_ineffective_gcs_near_heap_limit =
-      flag_detect_ineffective_gcs_near_heap_limit_;
-}
-
 v8::PageAllocator* TestPlatform::GetPageAllocator() {
   return CcTest::default_platform()->GetPageAllocator();
 }
diff --git a/deps/v8/test/cctest/cctest.h b/deps/v8/test/cctest/cctest.h
index 203ba968f646a1..f3777878fd2c03 100644
--- a/deps/v8/test/cctest/cctest.h
+++ b/deps/v8/test/cctest/cctest.h
@@ -54,6 +54,7 @@ namespace internal {
 const auto GetRegConfig = RegisterConfiguration::Default;
 
 class HandleScope;
+class ManualGCScope;
 class Zone;
 
 namespace compiler {
@@ -170,12 +171,6 @@ class CcTest {
 
   static void AddGlobalFunction(v8::Local<v8::Context> env, const char* name,
                                 v8::FunctionCallback callback);
-  static void CollectGarbage(i::AllocationSpace space,
-                             i::Isolate* isolate = nullptr);
-  static void CollectAllGarbage(i::Isolate* isolate = nullptr);
-  static void CollectAllAvailableGarbage(i::Isolate* isolate = nullptr);
-  static void PreciseCollectAllGarbage(i::Isolate* isolate = nullptr);
-  static void CollectSharedGarbage(i::Isolate* isolate = nullptr);
 
   static i::Handle<i::String> MakeString(const char* str);
   static i::Handle<i::String> MakeName(const char* str, int suffix);
@@ -225,7 +220,7 @@ class CcTest {
   TestPlatformFactory* test_platform_factory_;
 
   friend int main(int argc, char** argv);
-  friend class ManualGCScope;
+  friend class v8::internal::ManualGCScope;
 };
 
 // Switches between all the Api tests using the threading support.
@@ -240,6 +235,8 @@ class CcTest {
 // to that thread, suspending the current test.
 class ApiTestFuzzer: public v8::base::Thread {
  public:
+  ~ApiTestFuzzer() override = default;
+
   void CallTest();
 
   // The ApiTestFuzzer is also a Thread, so it has a Run method.
@@ -270,19 +267,22 @@ class ApiTestFuzzer: public v8::base::Thread {
         test_number_(num),
         gate_(0),
         active_(true) {}
-  ~ApiTestFuzzer() override = default;
 
+  static bool NextThread();
+  void ContextSwitch();
+  static int GetNextFuzzer();
+
+  static unsigned linear_congruential_generator;
+  static std::vector<std::unique_ptr<ApiTestFuzzer>> fuzzers_;
   static bool fuzzing_;
+  static v8::base::Semaphore all_tests_done_;
   static int tests_being_run_;
-  static int current_;
   static int active_tests_;
-  static bool NextThread();
+  static int current_fuzzer_;
+
   int test_number_;
   v8::base::Semaphore gate_;
   bool active_;
-  void ContextSwitch();
-  static int GetNextTestNumber();
-  static v8::base::Semaphore all_tests_done_;
 };
 
 
@@ -295,30 +295,23 @@ class RegisterThreadedTest {
  public:
   explicit RegisterThreadedTest(CcTest::TestFunction* callback,
                                 const char* name)
-      : fuzzer_(nullptr), callback_(callback), name_(name) {
-    prev_ = first_;
-    first_ = this;
-    count_++;
+      : callback_(callback), name_(name) {
+    tests_.push_back(this);
   }
-  static int count() { return count_; }
-  static RegisterThreadedTest* nth(int i) {
-    CHECK(i < count());
-    RegisterThreadedTest* current = first_;
-    while (i > 0) {
-      i--;
-      current = current->prev_;
-    }
-    return current;
+  static int count() { return static_cast<int>(tests_.size()); }
+  static const RegisterThreadedTest* nth(int i) {
+    DCHECK_LE(0, i);
+    DCHECK_LT(i, count());
+    // Added tests used to be prepended to a linked list and therefore the last
+    // one to be added was at index 0. This ensures that we keep this behavior.
+    return tests_[count() - i - 1];
   }
-  CcTest::TestFunction* callback() { return callback_; }
-  ApiTestFuzzer* fuzzer_;
-  const char* name() { return name_; }
+  CcTest::TestFunction* callback() const { return callback_; }
+  const char* name() const { return name_; }
 
  private:
-  static RegisterThreadedTest* first_;
-  static int count_;
+  static std::vector<const RegisterThreadedTest*> tests_;
   CcTest::TestFunction* callback_;
-  RegisterThreadedTest* prev_;
   const char* name_;
 };
 
@@ -342,9 +335,7 @@ class LocalContext {
 
   virtual ~LocalContext();
 
-  v8::Context* operator->() {
-    return *reinterpret_cast<v8::Context**>(&context_);
-  }
+  v8::Context* operator->() { return i::ValueHelper::HandleAsValue(context_); }
   v8::Context* operator*() { return operator->(); }
   bool IsReady() { return !context_.IsEmpty(); }
 
@@ -369,6 +360,15 @@ static inline uint16_t* AsciiToTwoByteString(const char* source) {
   return converted;
 }
 
+static inline uint16_t* AsciiToTwoByteString(const char16_t* source,
+                                             size_t* length_out = nullptr) {
+  size_t array_length = std::char_traits<char16_t>::length(source) + 1;
+  uint16_t* converted = i::NewArray<uint16_t>(array_length);
+  for (size_t i = 0; i < array_length; i++) converted[i] = source[i];
+  if (length_out != nullptr) *length_out = array_length - 1;
+  return converted;
+}
+
 template <typename T>
 static inline i::Handle<T> GetGlobal(const char* name) {
   i::Isolate* isolate = CcTest::i_isolate();
@@ -564,13 +564,10 @@ class StreamerThread : public v8::base::Thread {
 
 // Takes a JSFunction and runs it through the test version of the optimizing
 // pipeline, allocating the temporary compilation artifacts in a given Zone.
-// For possible {flags} values, look at OptimizedCompilationInfo::Flag.  If
-// {out_broker} is not nullptr, returns the JSHeapBroker via that (transferring
-// ownership to the caller).
-i::Handle<i::JSFunction> Optimize(
-    i::Handle<i::JSFunction> function, i::Zone* zone, i::Isolate* isolate,
-    uint32_t flags,
-    std::unique_ptr<i::compiler::JSHeapBroker>* out_broker = nullptr);
+// For possible {flags} values, look at OptimizedCompilationInfo::Flag.
+i::Handle<i::JSFunction> Optimize(i::Handle<i::JSFunction> function,
+                                  i::Zone* zone, i::Isolate* isolate,
+                                  uint32_t flags);
 
 static inline void ExpectString(const char* code, const char* expected) {
   v8::Local<v8::Value> result = CompileRun(code);
@@ -579,7 +576,6 @@ static inline void ExpectString(const char* code, const char* expected) {
   CHECK_EQ(0, strcmp(expected, *utf8));
 }
 
-
 static inline void ExpectInt32(const char* code, int expected) {
   v8::Local<v8::Value> result = CompileRun(code);
   CHECK(result->IsInt32());
@@ -690,28 +686,6 @@ class StaticOneByteResource : public v8::String::ExternalOneByteStringResource {
   const char* data_;
 };
 
-// ManualGCScope allows for disabling GC heuristics. This is useful for tests
-// that want to check specific corner cases around GC.
-//
-// The scope will finalize any ongoing GC on the provided Isolate. If no Isolate
-// is manually provided, it is assumed that a CcTest setup (e.g.
-// CcTest::InitializeVM()) is used.
-class V8_NODISCARD ManualGCScope {
- public:
-  explicit ManualGCScope(
-      i::Isolate* isolate = reinterpret_cast<i::Isolate*>(CcTest::isolate_));
-  ~ManualGCScope();
-
- private:
-  const bool flag_concurrent_marking_;
-  const bool flag_concurrent_sweeping_;
-  const bool flag_concurrent_minor_mc_marking_;
-  const bool flag_stress_concurrent_allocation_;
-  const bool flag_stress_incremental_marking_;
-  const bool flag_parallel_marking_;
-  const bool flag_detect_ineffective_gcs_near_heap_limit_;
-};
-
 // This is a base class that can be overridden to implement a test platform. It
 // delegates all operations to the default platform.
 class TestPlatform : public v8::Platform {
diff --git a/deps/v8/test/cctest/cctest.status b/deps/v8/test/cctest/cctest.status
index 73fbd95cec16f7..b265ad869d3f58 100644
--- a/deps/v8/test/cctest/cctest.status
+++ b/deps/v8/test/cctest/cctest.status
@@ -34,7 +34,14 @@
 
   # These tests always fail.  They are here to test test.py.  If
   # they don't fail then test.py has failed.
-  'test-serialize/TestThatAlwaysFails': [FAIL],
+  #
+  # With the official_build flag CHECK failures and UNREACHABLE do not pass
+  # through the normal V8_Fatal and we can't distinguish FAIL from CRASH.
+  # TODO(v8:13945, olivf) We could make FAILs in official builds
+  #                       distinguishable from crashes and improve the test
+  #                       runner. So far, it only affects very few tests.
+  'test-serialize/TestCheckThatAlwaysFails': [FAIL, ['official_build', CRASH]],
+  'test-serialize/TestFatal': [FAIL],
   'test-api/SealHandleScope': [FAIL],
 
   # These tests are expected to hit a CHECK (i.e. a FAIL result actually means
@@ -85,12 +92,9 @@
   'test-serialize/SnapshotCreatorNoExternalReferencesCustomFail1': [FAIL],
   'test-serialize/SnapshotCreatorNoExternalReferencesCustomFail2': [FAIL],
 
-  # BUG(v8:8739). Wasm interpreter does not create proper stack traces.
-  'test-wasm-stack/RunWasmInterpreter_CollectDetailedWasmStack_WasmError': [SKIP],
-
   # Test that misuse of PopAndReturn does not compile.
-  'test-code-stub-assembler/PopAndReturnFromJSBuiltinWithStackParameters' : [FAIL],
-  'test-code-stub-assembler/PopAndReturnFromTFCBuiltinWithStackParameters' : [FAIL],
+  'test-code-stub-assembler/PopAndReturnFromJSBuiltinWithStackParameters' : [FAIL, ['official_build', CRASH]],
+  'test-code-stub-assembler/PopAndReturnFromTFCBuiltinWithStackParameters' : [FAIL, ['official_build', CRASH]],
 
   # Slow tests.
   'test-api/InternalFieldsSubclassing': [PASS, SLOW],
@@ -161,9 +165,6 @@
 
   # BUG(v8:3446).
   'test-mark-compact/Promotion': [PASS, FAIL],
-
-  # BUG(v8:3434).
-  'test-api/LoadICFastApi_DirectCall_GCMoveStubWithProfiler': [SKIP],
 }],  # 'arch == arm64'
 
 ['arch == arm64 and simulator_run', {
@@ -179,12 +180,6 @@
   # Apple silicon. See:
   # https://developer.apple.com/library/archive/documentation/Xcode/Conceptual/iPhoneOSABIReference/Articles/ARM64FunctionCallingConventions.html
   'test-assembler-arm64/printf_no_preserve': [SKIP],
-
-  # https://crbug.com/v8/12588
-  'test-run-wasm-relaxed-simd/RunWasm_F32x4Qfma_interpreter': [SKIP],
-  'test-run-wasm-relaxed-simd/RunWasm_F32x4Qfms_interpreter': [SKIP],
-  'test-run-wasm-relaxed-simd/RunWasm_F64x2Qfma_interpreter': [SKIP],
-  'test-run-wasm-relaxed-simd/RunWasm_F64x2Qfms_interpreter': [SKIP],
 }],  # arch == arm64 and system == macos and not simulator_run
 
 ##############################################################################
@@ -227,16 +222,6 @@
 ['asan or tsan', {
   # Tests that need to run sequentially (e.g. due to memory consumption).
   'regress/regress-crbug-9161': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_Add': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_DivS': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_DivU': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_Eq': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_GeS': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_GeU': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_GtS': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_Ior': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_LeU': [PASS, HEAVY],
-  'test-run-wasm/RunWasmInterpreter_I32Binop_LtU': [PASS, HEAVY],
   'test-run-wasm/RunWasmLiftoff_I32Binop_Add': [PASS, HEAVY],
   'test-run-wasm/RunWasmLiftoff_I32Binop_DivS': [PASS, HEAVY],
   'test-run-wasm/RunWasmLiftoff_I32Binop_DivU': [PASS, HEAVY],
@@ -267,15 +252,20 @@
   # the --stress-concurrent-allocation variant.
   'test-heap/OutOfMemorySmallObjects': [PASS, NO_VARIANTS],
   'test-heap/OutOfMemory': [PASS, NO_VARIANTS],
+
+  # Too slow for tsan in debug mode:
+  'test-serialize/StaticRootsPredictableSnapshot': [PASS, ['mode == debug', SKIP]],
 }],  # 'tsan == True'
 
 ##############################################################################
-['is_full_debug', {
+['full_debug', {
   # Tests too slow in non-optimized debug mode.
   'test-api/InternalFieldsSubclassing': [SKIP],
   'test-concurrent-allocation/ConcurrentAllocationInLargeSpace': [SKIP],
   'test-heap/TestInternalWeakLists': [SKIP],
-}],  # 'is_full_debug'
+  'test-serialize/StartupSerializerOnce': [SKIP],
+  'test-serialize/StartupSerializerTwice': [SKIP],
+}],  # 'full_debug'
 
 ##############################################################################
 ['byteorder == big', {
@@ -378,25 +368,22 @@
   # this test is unstable, sometimes fail when running w/ other tests.
   'test-cpu-profiler/CrossScriptInliningCallerLineNumbers2': [SKIP],
 
-  # SIMD not fully implemented yet.
-  'test-gc/RunWasmLiftoff_RefTrivialCasts': [SKIP],
-  'test-gc/RunWasmTurbofan_RefTrivialCasts': [SKIP],
 
   # Some wasm functionality is not implemented yet.
-  'test-run-wasm-atomics64/*': [SKIP],
-  'test-run-wasm-atomics/*': [SKIP],
-  'test-run-wasm-64/*': [SKIP],
-  'test-run-wasm/RunWasmTurbofan_Select_s128_parameters': [SKIP],
-  'test-run-wasm/RunWasmLiftoff_Select_s128_parameters': [SKIP],
   'test-liftoff-for-fuzzing/NondeterminismUnopF64x2AllNaN': [SKIP],
   'test-liftoff-for-fuzzing/NondeterminismUnopF64x2OneNaN': [SKIP],
   'test-liftoff-for-fuzzing/NondeterminismUnopF32x4AllNaN': [SKIP],
   'test-liftoff-for-fuzzing/NondeterminismUnopF32x4OneNaN': [SKIP],
 
-  # riscv64 sign extend on uint32.
-  'test-run-load-store/RunUnalignedLoadStoreZeroExtend64': [SKIP],
-  'test-run-load-store/RunLoadStoreZeroExtend64': [SKIP],
-}],  # 'arch == riscv64'
+  # According to riscv's NaN generation and propagation scheme, the payload
+  # is not guaranteed. So the test fails when src bits has payload.
+  'test-run-wasm/RunWasmLiftoff_F32ReinterpretI32': [SKIP],
+  'test-run-wasm/RunWasmTurbofan_F32ReinterpretI32': [SKIP],
+}],  # 'arch == riscv64 or (arch == riscv32)'
+['arch == riscv32', {
+  # Some wasm functionality is not implemented yet.
+  'test-run-wasm-64/*': [SKIP],
+}],  # 'arch == riscv32'
 
 ##############################################################################
 ['((arch == riscv64) or (arch == riscv32)) and simulator_run', {
@@ -438,9 +425,6 @@
   'test-run-wasm-module/Run_WasmModule_Return114' : [SKIP],
   'test-run-wasm-module/Run_WasmModule_CallAdd' : [SKIP],
   'test-run-wasm-module/Run_WasmModule_CallMain_recursive' : [SKIP],
-  # TODO(ppc): Implement load/store reverse byte instructions
-  'test-run-wasm-simd/RunWasm_SimdLoadStoreLoad': [SKIP],
-  'test-run-wasm-simd/RunWasm_SimdLoadStoreLoad_turbofan': [SKIP],
   # slow in PASE emulator
   'test-cpu-profiler/Inlining2': [PASS, SLOW],
   'test-cpu-profiler/CollectCpuProfileCallerLineNumbers': [PASS, SLOW],
@@ -462,20 +446,8 @@
   'test-jump-table-assembler/*': [SKIP],
 
   'test-wasm-breakpoints/*' : [SKIP],
-
-  # TODO(11856): Port nondeterminism detection.
-  'test-liftoff-for-fuzzing/*': [SKIP],
-
 }],  # 'arch == ppc or arch == ppc64 or arch == s390 or arch == s390x'
 
-['arch == ppc64', {
-  # SIMD / Liftoff not fully implemented yet
-  'test-run-wasm-simd-liftoff/*': [SKIP],
-  'test-run-wasm-relaxed-simd/*': [SKIP],
-  'test-gc/RunWasmLiftoff_RefTrivialCasts': [SKIP],
-  'test-gc/RunWasmLiftoff_RefTrivialCastsStatic': [SKIP],
-}],
-
 ##############################################################################
 ['variant == stress_incremental_marking', {
   'test-heap-profiler/SamplingHeapProfiler': [SKIP],
@@ -568,6 +540,7 @@
   'test-run-stackcheck/*': [SKIP],
   'test-run-unwinding-info/*': [SKIP],
   'test-run-variables/*': [SKIP],
+  'test-select-combine/*': [SKIP],
   'test-serialize/*': [SKIP],
   'test-swiss-name-dictionary-csa/*': [SKIP],
   'test-torque/*': [SKIP],
@@ -582,14 +555,14 @@
 }], # lite_mode or variant == jitless
 
 ##############################################################################
-['jitless_build_mode', {
+['has_jitless', {
   # invocation_count maintenance is disabled.
   'test-debug/DebugCoverage*': [SKIP],
   # Feedback collection maintenance is (mostly) disabled.
   'test-heap/IncrementalMarkingPreservesMonomorphicCallIC': [SKIP],
   # WebAssembly not included.
   'test-api/Threading8': [SKIP],
-}],  # jitless_build_mode
+}],  # has_jitless
 
 ##############################################################################
 ['lite_mode', {
@@ -608,11 +581,6 @@
   'test-cpu-profiler/TickLinesOptimized': [SKIP],
   'test-heap/TestOptimizeAfterBytecodeFlushingCandidate': [SKIP],
   'test-js-to-wasm/*': [SKIP],
-  'test-run-wasm-exceptions/RunWasmInterpreter_TryCatchCallDirect': [SKIP],
-  'test-run-wasm-exceptions/RunWasmInterpreter_TryCatchCallExternal': [SKIP],
-  'test-run-wasm-exceptions/RunWasmInterpreter_TryCatchCallIndirect': [SKIP],
-  'test-run-wasm-exceptions/RunWasmInterpreter_TryCatchThrow': [SKIP],
-  'test-run-wasm-exceptions/RunWasmInterpreter_TryCatchTrapTypeError': [SKIP],
   'test-run-wasm-exceptions/RunWasmLiftoff_TryCatchCallDirect': [SKIP],
   'test-run-wasm-exceptions/RunWasmLiftoff_TryCatchCallExternal': [SKIP],
   'test-run-wasm-exceptions/RunWasmLiftoff_TryCatchCallIndirect': [SKIP],
@@ -717,7 +685,6 @@
   'test-lab/*': [SKIP],
   'test-heap/TestAlignedOverAllocation': [SKIP],
   'test-heap/RememberedSetRemoveRange': [SKIP],
-  'test-heap/CodeObjectRegistry': [SKIP],
   'test-heap/DeepEagerCompilationPeakMemory': [SKIP],
   'test-api/GetHeapStatistics': [SKIP],
   'test-api/GetHeapSpaceStatistics': [SKIP],
@@ -986,27 +953,6 @@
   'test-heap/WeakMapInPolymorphicStoreIC': [SKIP],
   'test-js-weak-refs/TestJSWeakRef': [SKIP],
   'test-js-weak-refs/TestJSWeakRefKeepDuringJob': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32AddOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32DivSOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32DivUOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32MulOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32RemSOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32RemUOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32ShlOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32ShrSOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32ShrUOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I32SubOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64AddOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64DivSOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64DivUOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64MulOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64RemSOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64RemUOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64ShlOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64ShrSOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64ShrUOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_I64SubOnDifferentRegisters': [SKIP],
-  'test-run-wasm/RunWasmInterpreter_LoadMemI32_const_oob_misaligned': [SKIP],
   'test-run-wasm/RunWasmLiftoff_I32AddOnDifferentRegisters': [SKIP],
   'test-run-wasm/RunWasmLiftoff_I32DivSOnDifferentRegisters': [SKIP],
   'test-run-wasm/RunWasmLiftoff_I32DivUOnDifferentRegisters': [SKIP],
@@ -1098,6 +1044,133 @@
   # TODO(v8:12783, nicohartmann@): FastApiCalls temporarily disabled on
   # Turboshaft until support has been properly ported.
   'test-api/FastApiCalls': [SKIP],
+
+  # The 'turboshaft' variant sets the '--no-liftoff' flag, which means that Wasm
+  # compiles directly to Turboshaft. This makes the cache no longer incremental,
+  # and these tests don't make sense.
+  # TODO(14108): Remove once we remove '--no-liftoff' from the 'turboshaft'
+  # variant.
+  'test-streaming-compilation/AsyncTestIncrementalCaching': [FAIL],
+  'test-streaming-compilation/SingleThreadedTestIncrementalCaching': [FAIL],
+
+  # Revectorization is not supported yet in Turboshaft.
+  # TODO(14108): Remove once supported.
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8Max': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8Min': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8Pmin': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8Pmax': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F64x4Pmin': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F64x4Min': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F64x4Pmax': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F64x4Max': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8GeS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8Ne': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8GeU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8GtU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I64x4Ne': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I64x4GeS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32GeS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32GeU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32GtU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32Ne': [FAIL],
+  'test-run-wasm-simd/WasmTurbofan_I16x16GeU': [FAIL],
+  'test-run-wasm-simd/WasmTurbofan_I16x16GeS': [FAIL],
+  'test-run-wasm-simd/WasmTurbofan_I16x16GtU': [FAIL],
+  'test-run-wasm-simd/WasmTurbofan_I16x16Ne': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8Abs': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8Sqrt': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8SConvertI32x8': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8UConvertI32x8': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F32x8Neg': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16Abs': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_F64x4Sqrt': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16Neg': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8Neg': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8UConvertF32x8': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8Abs': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32Neg': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32Abs': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16AddSatS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16AddSatU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16SubSatS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16SubSatU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32AddSatS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32AddSatU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32SubSatS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I8x32SubSatU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Const': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Not': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256And': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Or': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Xor': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256AndNot': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Select': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16ShrS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16Shl': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I16x16ShrU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8Shl': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8ShrU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I32x8ShrS': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I64x4Shl': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_I64x4ShrU': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Load8Splat': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Load16Splat': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Load32Splat': [FAIL],
+  'test-run-wasm-simd/RunWasmTurbofan_S256Load64Splat': [FAIL],
+  'test-run-wasm-simd/S128Load8x8S': [FAIL],
+  'test-run-wasm-simd/S128Load8x8U': [FAIL],
+  'test-run-wasm-simd/S128Load16x4S': [FAIL],
+  'test-run-wasm-simd/S128Load16x4U': [FAIL],
+  'test-run-wasm-simd/S128Load32x2S': [FAIL],
+  'test-run-wasm-simd/S128Load32x2U': [FAIL],
 }],  # variant == turboshaft
 
+##############################################################################
+# Behavioural differences between Maglev and Turbofan when the former is used
+# for OptimizeFunctionOnNextCall.
+['variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)', {
+  # Maglev doesn't support compiler::NodeObserver machinery.
+  'test-js-to-wasm/TestFastJSWasmCall_I32Arg': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_Nop': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_MixedMistypedArgs': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_MistypedArgs': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_LazyDeopt_F64Result': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_MixedArgs': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_LazyDeopt_I64Result': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_NoArgs': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_I64Arg': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_I32ArgNotSmi': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_I64ArgExpectsBigInt': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_I32ArgDoesntExpectBigInt': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_LazyDeopt_VoidResult': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_LazyDeopt_I32Result': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_I64NegativeResult': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_LazyDeopt_F32Result': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_MismatchedArity': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_MultipleArgs': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_EagerDeopt': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_F64ArgDoesntExpectBigInt': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_ExternrefArg': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_F32Arg': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_F64Arg': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_NoReturnTypes': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_ExternrefNullArg': [FAIL],
+  'test-js-to-wasm/TestFastJSWasmCall_F32ArgDoesntExpectBigInt': [FAIL],
+  'test-calls-with-arraylike-or-spread/ReduceJSCallWithArrayLike': [FAIL],
+  'test-calls-with-arraylike-or-spread/ReduceJSCallWithSpread': [FAIL],
+  'test-calls-with-arraylike-or-spread/ReduceJSCreateBoundFunction': [FAIL],
+  'test-calls-with-arraylike-or-spread/ReduceJSCreateClosure': [FAIL],
+  'test-verify-type/TestVerifyType': [FAIL],
+  # Maglev doesn't support FastApi calls.
+  'test-api/FastApiCalls': [FAIL],
+  'test-api/FastApiSequenceOverloads': [FAIL],
+  # Maglev doesn't produce optimized enough code to match heap tests
+  # expectations.
+  'test-heap/EnsureAllocationSiteDependentCodesProcessed': [FAIL],
+}],  # variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)
+
+['conservative_stack_scanning', {
+  # Needs --predictable.
+  'test-serialize/StaticRootsPredictableSnapshot': [SKIP],
+}],  # conservative_stack_scanning
 ]
diff --git a/deps/v8/test/cctest/compiler/codegen-tester.h b/deps/v8/test/cctest/compiler/codegen-tester.h
index 219650def31ccc..168a63e6744aa7 100644
--- a/deps/v8/test/cctest/compiler/codegen-tester.h
+++ b/deps/v8/test/cctest/compiler/codegen-tester.h
@@ -60,14 +60,14 @@ class RawMachineAssemblerTester : public HandleAndZoneScope,
 
   ~RawMachineAssemblerTester() override = default;
 
-  void CheckNumber(double expected, Object number) {
-    CHECK(this->isolate()->factory()->NewNumber(expected)->SameValue(number));
+  void CheckNumber(double expected, Tagged<Object> number) {
+    CHECK(Object::SameValue(*this->isolate()->factory()->NewNumber(expected),
+                            number));
   }
 
-  void CheckString(const char* expected, Object string) {
-    CHECK(
-        this->isolate()->factory()->InternalizeUtf8String(expected)->SameValue(
-            string));
+  void CheckString(const char* expected, Tagged<Object> string) {
+    CHECK(Object::SameValue(
+        *this->isolate()->factory()->InternalizeUtf8String(expected), string));
   }
 
   void GenerateCode() { Generate(); }
@@ -87,7 +87,7 @@ class RawMachineAssemblerTester : public HandleAndZoneScope,
           &info, main_isolate(), call_descriptor(), graph(),
           AssemblerOptions::Default(main_isolate()), schedule);
     }
-    return code_.ToHandleChecked()->code_entry_point();
+    return code_.ToHandleChecked()->instruction_start();
   }
 
  private:
@@ -338,17 +338,83 @@ class TaggedBinopTester : public BinopTester<Type, USE_RETURN_REGISTER> {
                                                MachineType::AnyTagged()) {}
 };
 
+// A helper class for integer binary operations. Wraps a machine opcode and
+// provides evaluation routines and the operators.
+template <typename T>
+class IntBinopWrapper {
+ public:
+  explicit IntBinopWrapper(IrOpcode::Value op) : opcode(op) {}
+
+  const Operator* op(MachineOperatorBuilder* machine) const {
+    switch (opcode) {
+      case IrOpcode::kInt32Add:
+        return machine->Int32Add();
+      case IrOpcode::kInt32Sub:
+        return machine->Int32Sub();
+      case IrOpcode::kInt32Mul:
+        return machine->Int32Mul();
+      case IrOpcode::kWord32And:
+        return machine->Word32And();
+      case IrOpcode::kWord32Or:
+        return machine->Word32Or();
+      case IrOpcode::kWord32Xor:
+        return machine->Word32Xor();
+      case IrOpcode::kInt64Add:
+        return machine->Int64Add();
+      case IrOpcode::kInt64Sub:
+        return machine->Int64Sub();
+      case IrOpcode::kInt64Mul:
+        return machine->Int64Mul();
+      case IrOpcode::kWord64And:
+        return machine->Word64And();
+      case IrOpcode::kWord64Or:
+        return machine->Word64Or();
+      case IrOpcode::kWord64Xor:
+        return machine->Word64Xor();
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  T eval(T a, T b) const {
+    switch (opcode) {
+      case IrOpcode::kInt32Add:
+      case IrOpcode::kInt64Add:
+        return a + b;
+      case IrOpcode::kInt32Sub:
+      case IrOpcode::kInt64Sub:
+        return a - b;
+      case IrOpcode::kInt32Mul:
+      case IrOpcode::kInt64Mul:
+        return a * b;
+      case IrOpcode::kWord32And:
+      case IrOpcode::kWord64And:
+        return a & b;
+      case IrOpcode::kWord32Or:
+      case IrOpcode::kWord64Or:
+        return a | b;
+      case IrOpcode::kWord32Xor:
+      case IrOpcode::kWord64Xor:
+        return a ^ b;
+      default:
+        UNREACHABLE();
+    }
+  }
+  IrOpcode::Value opcode;
+};
+
 // A helper class for testing compares. Wraps a machine opcode and provides
 // evaluation routines and the operators.
 class CompareWrapper {
  public:
   explicit CompareWrapper(IrOpcode::Value op) : opcode(op) {}
 
-  Node* MakeNode(RawMachineAssemblerTester<int32_t>* m, Node* a, Node* b) {
+  Node* MakeNode(RawMachineAssemblerTester<int32_t>* m, Node* a,
+                 Node* b) const {
     return m->AddNode(op(m->machine()), a, b);
   }
 
-  const Operator* op(MachineOperatorBuilder* machine) {
+  const Operator* op(MachineOperatorBuilder* machine) const {
     switch (opcode) {
       case IrOpcode::kWord32Equal:
         return machine->Word32Equal();
@@ -360,6 +426,16 @@ class CompareWrapper {
         return machine->Uint32LessThan();
       case IrOpcode::kUint32LessThanOrEqual:
         return machine->Uint32LessThanOrEqual();
+      case IrOpcode::kWord64Equal:
+        return machine->Word64Equal();
+      case IrOpcode::kInt64LessThan:
+        return machine->Int64LessThan();
+      case IrOpcode::kInt64LessThanOrEqual:
+        return machine->Int64LessThanOrEqual();
+      case IrOpcode::kUint64LessThan:
+        return machine->Uint64LessThan();
+      case IrOpcode::kUint64LessThanOrEqual:
+        return machine->Uint64LessThanOrEqual();
       case IrOpcode::kFloat64Equal:
         return machine->Float64Equal();
       case IrOpcode::kFloat64LessThan:
@@ -371,7 +447,7 @@ class CompareWrapper {
     }
   }
 
-  bool Int32Compare(int32_t a, int32_t b) {
+  bool Int32Compare(int32_t a, int32_t b) const {
     switch (opcode) {
       case IrOpcode::kWord32Equal:
         return a == b;
@@ -388,7 +464,24 @@ class CompareWrapper {
     }
   }
 
-  bool Float64Compare(double a, double b) {
+  bool Int64Compare(int64_t a, int64_t b) const {
+    switch (opcode) {
+      case IrOpcode::kWord64Equal:
+        return a == b;
+      case IrOpcode::kInt64LessThan:
+        return a < b;
+      case IrOpcode::kInt64LessThanOrEqual:
+        return a <= b;
+      case IrOpcode::kUint64LessThan:
+        return static_cast<uint64_t>(a) < static_cast<uint64_t>(b);
+      case IrOpcode::kUint64LessThanOrEqual:
+        return static_cast<uint64_t>(a) <= static_cast<uint64_t>(b);
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  bool Float64Compare(double a, double b) const {
     switch (opcode) {
       case IrOpcode::kFloat64Equal:
         return a == b;
diff --git a/deps/v8/test/cctest/compiler/function-tester.cc b/deps/v8/test/cctest/compiler/function-tester.cc
index f3bfd5bb11b0b7..9a9d91d72ae083 100644
--- a/deps/v8/test/cctest/compiler/function-tester.cc
+++ b/deps/v8/test/cctest/compiler/function-tester.cc
@@ -22,7 +22,6 @@ namespace compiler {
 
 FunctionTester::FunctionTester(const char* source, uint32_t flags)
     : isolate(main_isolate()),
-      canonical(isolate),
       function((v8_flags.allow_natives_syntax = true, NewFunction(source))),
       flags_(flags) {
   Compile(function);
@@ -32,7 +31,6 @@ FunctionTester::FunctionTester(const char* source, uint32_t flags)
 
 FunctionTester::FunctionTester(Graph* graph, int param_count)
     : isolate(main_isolate()),
-      canonical(isolate),
       function(NewFunction(BuildFunction(param_count).c_str())),
       flags_(0) {
   CompileGraph(graph);
@@ -40,12 +38,11 @@ FunctionTester::FunctionTester(Graph* graph, int param_count)
 
 FunctionTester::FunctionTester(Handle<Code> code, int param_count)
     : isolate(main_isolate()),
-      canonical(isolate),
       function((v8_flags.allow_natives_syntax = true,
                 NewFunction(BuildFunction(param_count).c_str()))),
       flags_(0) {
   CHECK(!code.is_null());
-  CHECK(code->IsCode());
+  CHECK(IsCode(*code));
   Compile(function);
   function->set_code(*code, kReleaseStore);
 }
@@ -86,7 +83,7 @@ void FunctionTester::CheckCall(Handle<Object> expected, Handle<Object> a,
                                Handle<Object> b, Handle<Object> c,
                                Handle<Object> d) {
   Handle<Object> result = Call(a, b, c, d).ToHandleChecked();
-  CHECK(expected->SameValue(*result));
+  CHECK(Object::SameValue(*expected, *result));
 }
 
 Handle<JSFunction> FunctionTester::NewFunction(const char* source) {
@@ -133,13 +130,13 @@ Handle<Object> FunctionTester::false_value() {
 
 Handle<JSFunction> FunctionTester::ForMachineGraph(Graph* graph,
                                                    int param_count) {
-  JSFunction p;
+  Tagged<JSFunction> p;
   {  // because of the implicit handle scope of FunctionTester.
     FunctionTester f(graph, param_count);
     p = *f.function;
   }
   return Handle<JSFunction>(
-      p, p.GetIsolate());  // allocated in outer handle scope.
+      p, p->GetIsolate());  // allocated in outer handle scope.
 }
 
 Handle<JSFunction> FunctionTester::Compile(Handle<JSFunction> f) {
diff --git a/deps/v8/test/cctest/compiler/function-tester.h b/deps/v8/test/cctest/compiler/function-tester.h
index 09249f40b09d56..24ba7d346dad5b 100644
--- a/deps/v8/test/cctest/compiler/function-tester.h
+++ b/deps/v8/test/cctest/compiler/function-tester.h
@@ -31,7 +31,6 @@ class FunctionTester : public InitializedHandleScope {
   explicit FunctionTester(Handle<Code> code);
 
   Isolate* isolate;
-  CanonicalHandleScope canonical;
   Handle<JSFunction> function;
 
   MaybeHandle<Object> Call() {
diff --git a/deps/v8/test/cctest/compiler/js-heap-broker-base.h b/deps/v8/test/cctest/compiler/js-heap-broker-base.h
new file mode 100644
index 00000000000000..cbe74a37b46209
--- /dev/null
+++ b/deps/v8/test/cctest/compiler/js-heap-broker-base.h
@@ -0,0 +1,117 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_CCTEST_COMPILER_JS_HEAP_BROKER_H_
+#define V8_CCTEST_COMPILER_JS_HEAP_BROKER_H_
+
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+class CanonicalHandles {
+ public:
+  CanonicalHandles(Isolate* isolate, Zone* zone)
+      : isolate_(isolate),
+        canonical_handles_(std::make_unique<CanonicalHandlesMap>(
+            isolate->heap(), ZoneAllocationPolicy(zone))) {}
+
+  template <typename T>
+  Handle<T> Create(Tagged<T> object) {
+    CHECK_NOT_NULL(canonical_handles_);
+    auto find_result = canonical_handles_->FindOrInsert(object);
+    if (!find_result.already_exists) {
+      *find_result.entry = Handle<T>(object, isolate_).location();
+    }
+    return Handle<T>(*find_result.entry);
+  }
+
+  template <typename T>
+  Handle<T> Create(T object) {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return Create(Tagged<T>(object));
+  }
+
+  template <typename T>
+  Handle<T> Create(Handle<T> handle) {
+    return Create(*handle);
+  }
+
+  std::unique_ptr<CanonicalHandlesMap> Detach() {
+    DCHECK_NOT_NULL(canonical_handles_);
+    return std::move(canonical_handles_);
+  }
+
+ private:
+  Isolate* isolate_;
+  std::unique_ptr<CanonicalHandlesMap> canonical_handles_;
+};
+
+class JSHeapBrokerTestBase {
+ public:
+  JSHeapBrokerTestBase(Isolate* isolate, Zone* zone)
+      : broker_(isolate, zone),
+        broker_scope_(&broker_,
+                      std::make_unique<CanonicalHandlesMap>(
+                          isolate->heap(), ZoneAllocationPolicy(zone))),
+        current_broker_(&broker_) {
+    // PersistentHandlesScope currently requires an active handle before it can
+    // be opened and they can't be nested.
+    // TODO(v8:13897): Remove once PersistentHandlesScopes can be opened
+    // uncontionally.
+    if (!PersistentHandlesScope::IsActive(isolate)) {
+      Handle<Object> dummy(ReadOnlyRoots(isolate->heap()).empty_string(),
+                           isolate);
+      persistent_scope_ = std::make_unique<PersistentHandlesScope>(isolate);
+    }
+  }
+
+  JSHeapBrokerTestBase(Isolate* isolate, Zone* zone, CanonicalHandles&& handles)
+      : broker_(isolate, zone),
+        broker_scope_(&broker_, handles.Detach()),
+        current_broker_(&broker_) {
+    // PersistentHandlesScope currently requires an active handle before it can
+    // be opened and they can't be nested.
+    // TODO(v8:13897): Remove once PersistentHandlesScopes can be opened
+    // uncontionally.
+    if (!PersistentHandlesScope::IsActive(isolate)) {
+      Handle<Object> dummy(ReadOnlyRoots(isolate->heap()).empty_string(),
+                           isolate);
+      persistent_scope_ = std::make_unique<PersistentHandlesScope>(isolate);
+    }
+  }
+
+  ~JSHeapBrokerTestBase() {
+    if (persistent_scope_ != nullptr) {
+      persistent_scope_->Detach();
+    }
+  }
+
+  JSHeapBroker* broker() { return &broker_; }
+
+  template <typename T>
+  Handle<T> CanonicalHandle(Tagged<T> object) {
+    return broker()->CanonicalPersistentHandle(object);
+  }
+  template <typename T>
+  Handle<T> CanonicalHandle(T object) {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return CanonicalHandle(Tagged<T>(object));
+  }
+  template <typename T>
+  Handle<T> CanonicalHandle(Handle<T> handle) {
+    return CanonicalHandle(*handle);
+  }
+
+ private:
+  JSHeapBroker broker_;
+  JSHeapBrokerScopeForTesting broker_scope_;
+  CurrentHeapBrokerScope current_broker_;
+  std::unique_ptr<PersistentHandlesScope> persistent_scope_;
+};
+
+}  // namespace compiler
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_CCTEST_COMPILER_JS_HEAP_BROKER_H_
diff --git a/deps/v8/test/cctest/compiler/serializer-tester.h b/deps/v8/test/cctest/compiler/serializer-tester.h
index d530ca1c5447d7..5e133b369c4921 100644
--- a/deps/v8/test/cctest/compiler/serializer-tester.h
+++ b/deps/v8/test/cctest/compiler/serializer-tester.h
@@ -34,7 +34,6 @@ class SerializerTester : public HandleAndZoneScope {
   Isolate* isolate() { return main_isolate(); }
 
  private:
-  CanonicalHandleScope canonical_;
   OptionalJSFunctionRef function_;
   std::unique_ptr<JSHeapBroker> broker_;
 };
diff --git a/deps/v8/test/cctest/compiler/test-atomic-load-store-codegen.cc b/deps/v8/test/cctest/compiler/test-atomic-load-store-codegen.cc
index 2b39cca0ef71a6..b3e0e163077bc4 100644
--- a/deps/v8/test/cctest/compiler/test-atomic-load-store-codegen.cc
+++ b/deps/v8/test/cctest/compiler/test-atomic-load-store-codegen.cc
@@ -15,7 +15,7 @@ namespace compiler {
 #if V8_TARGET_LITTLE_ENDIAN
 #define LSB(addr, bytes) addr
 #elif V8_TARGET_BIG_ENDIAN
-#define LSB(addr, bytes) reinterpret_cast<byte*>(addr + 1) - (bytes)
+#define LSB(addr, bytes) reinterpret_cast<uint8_t*>(addr + 1) - (bytes)
 #else
 #error "Unknown Architecture"
 #endif
@@ -88,7 +88,8 @@ void CheckEq(CType in_value, CType out_value) {
 #ifdef V8_COMPRESS_POINTERS
 // Specializations for checking the result of compressing store.
 template <>
-void CheckEq<Object>(Object in_value, Object out_value) {
+void CheckEq<Tagged<Object>>(Tagged<Object> in_value,
+                             Tagged<Object> out_value) {
   // Compare only lower 32-bits of the value because tagged load/stores are
   // 32-bit operations anyway.
   CHECK_EQ(static_cast<Tagged_t>(in_value.ptr()),
@@ -96,24 +97,25 @@ void CheckEq<Object>(Object in_value, Object out_value) {
 }
 
 template <>
-void CheckEq<HeapObject>(HeapObject in_value, HeapObject out_value) {
-  return CheckEq<Object>(in_value, out_value);
+void CheckEq<Tagged<HeapObject>>(Tagged<HeapObject> in_value,
+                                 Tagged<HeapObject> out_value) {
+  return CheckEq<Tagged<Object>>(in_value, out_value);
 }
 
 template <>
-void CheckEq<Smi>(Smi in_value, Smi out_value) {
-  return CheckEq<Object>(in_value, out_value);
+void CheckEq<Tagged<Smi>>(Tagged<Smi> in_value, Tagged<Smi> out_value) {
+  return CheckEq<Tagged<Object>>(in_value, out_value);
 }
 #endif
 
-template <typename TaggedT>
-void InitBuffer(TaggedT* buffer, size_t length, MachineType type) {
-  const size_t kBufferSize = sizeof(TaggedT) * length;
+template <typename T>
+void InitBuffer(Tagged<T>* buffer, size_t length, MachineType type) {
+  const size_t kBufferSize = sizeof(Tagged<T>) * length;
 
   // Tagged field loads require values to be properly tagged because of
   // pointer decompression that may be happenning during load.
   Isolate* isolate = CcTest::InitIsolateOnce();
-  Smi* smi_view = reinterpret_cast<Smi*>(&buffer[0]);
+  Tagged<Smi>* smi_view = reinterpret_cast<Tagged<Smi>*>(&buffer[0]);
   if (type.IsTaggedSigned()) {
     for (size_t i = 0; i < length; i++) {
       smi_view[i] = Smi::FromInt(static_cast<int>(i + kBufferSize) ^ 0xABCDEF0);
@@ -130,18 +132,19 @@ void InitBuffer(TaggedT* buffer, size_t length, MachineType type) {
   }
 }
 
-template <typename TaggedT>
+template <typename T>
 void AtomicLoadTagged(MachineType type, AtomicMemoryOrder order) {
   const int kNumElems = 16;
-  TaggedT buffer[kNumElems];
+  Tagged<T> buffer[kNumElems];
 
   InitBuffer(buffer, kNumElems, type);
 
   for (int i = 0; i < kNumElems; i++) {
-    BufferedRawMachineAssemblerTester<TaggedT> m;
-    TaggedT* base_pointer = &buffer[0];
+    BufferedRawMachineAssemblerTester<Tagged<T>> m;
+    Tagged<T>* base_pointer = &buffer[0];
     if (COMPRESS_POINTERS_BOOL) {
-      base_pointer = reinterpret_cast<TaggedT*>(LSB(base_pointer, kTaggedSize));
+      base_pointer =
+          reinterpret_cast<Tagged<T>*>(LSB(base_pointer, kTaggedSize));
     }
     Node* base = m.PointerConstant(base_pointer);
     Node* index = m.Int32Constant(i * sizeof(buffer[0]));
@@ -153,7 +156,7 @@ void AtomicLoadTagged(MachineType type, AtomicMemoryOrder order) {
       load = m.AtomicLoad(params, base, index);
     }
     m.Return(load);
-    CheckEq<TaggedT>(buffer[i], m.Call());
+    CheckEq<Tagged<T>>(buffer[i], m.Call());
   }
 }
 }  // namespace
@@ -241,7 +244,7 @@ TEST(SeqCstStoreInteger) {
 }
 
 namespace {
-template <typename TaggedT>
+template <typename T>
 void AtomicStoreTagged(MachineType type, AtomicMemoryOrder order) {
   // This tests that tagged values are correctly transferred by atomic loads and
   // stores from in_buffer to out_buffer. For each particular element in
@@ -249,17 +252,17 @@ void AtomicStoreTagged(MachineType type, AtomicMemoryOrder order) {
   // indices are zapped, to test instructions of the correct width are emitted.
 
   const int kNumElems = 16;
-  TaggedT in_buffer[kNumElems];
-  TaggedT out_buffer[kNumElems];
+  Tagged<T> in_buffer[kNumElems];
+  Tagged<T> out_buffer[kNumElems];
   uintptr_t zap_data[] = {kZapValue, kZapValue};
-  TaggedT zap_value;
+  Tagged<T> zap_value;
 
-  static_assert(sizeof(TaggedT) <= sizeof(zap_data));
-  MemCopy(&zap_value, &zap_data, sizeof(TaggedT));
+  static_assert(sizeof(Tagged<T>) <= sizeof(zap_data));
+  MemCopy(&zap_value, &zap_data, sizeof(Tagged<T>));
   InitBuffer(in_buffer, kNumElems, type);
 
 #ifdef V8_TARGET_BIG_ENDIAN
-  int offset = sizeof(TaggedT) - ElementSizeInBytes(type.representation());
+  int offset = sizeof(Tagged<T>) - ElementSizeInBytes(type.representation());
 #else
   int offset = 0;
 #endif
@@ -270,9 +273,9 @@ void AtomicStoreTagged(MachineType type, AtomicMemoryOrder order) {
     RawMachineAssemblerTester<int32_t> m;
     int32_t OK = 0x29000 + x;
     Node* in_base = m.PointerConstant(in_buffer);
-    Node* in_index = m.IntPtrConstant(x * sizeof(TaggedT) + offset);
+    Node* in_index = m.IntPtrConstant(x * sizeof(Tagged<T>) + offset);
     Node* out_base = m.PointerConstant(out_buffer);
-    Node* out_index = m.IntPtrConstant(y * sizeof(TaggedT) + offset);
+    Node* out_index = m.IntPtrConstant(y * sizeof(Tagged<T>) + offset);
 
     Node* load;
     AtomicLoadParameters load_params(type, order);
@@ -295,7 +298,7 @@ void AtomicStoreTagged(MachineType type, AtomicMemoryOrder order) {
     CHECK_NE(in_buffer[x], out_buffer[y]);
     CHECK_EQ(OK, m.Call());
     // Mostly same as CHECK_EQ() but customized for compressed tagged values.
-    CheckEq<TaggedT>(in_buffer[x], out_buffer[y]);
+    CheckEq<Tagged<T>>(in_buffer[x], out_buffer[y]);
     for (int32_t z = 0; z < kNumElems; z++) {
       if (z != y) CHECK_EQ(zap_value, out_buffer[z]);
     }
diff --git a/deps/v8/test/cctest/compiler/test-calls-with-arraylike-or-spread.cc b/deps/v8/test/cctest/compiler/test-calls-with-arraylike-or-spread.cc
index dc9767865e5ae0..2a31e8c4c3dea4 100644
--- a/deps/v8/test/cctest/compiler/test-calls-with-arraylike-or-spread.cc
+++ b/deps/v8/test/cctest/compiler/test-calls-with-arraylike-or-spread.cc
@@ -127,17 +127,18 @@ TEST(ReduceJSCreateBoundFunction) {
       IrOpcode::kPhi);
 }
 
-static void SumF(const v8::FunctionCallbackInfo<v8::Value>& args) {
+static void SumF(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
-  v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
-  int this_x = args.This()
+  v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
+  int this_x = info.This()
                    ->Get(context, v8_str("x"))
                    .ToLocalChecked()
                    ->Int32Value(context)
                    .FromJust();
-  args.GetReturnValue().Set(v8_num(
-      args[0]->Int32Value(args.GetIsolate()->GetCurrentContext()).FromJust() +
-      args[1]->Int32Value(args.GetIsolate()->GetCurrentContext()).FromJust() +
+  info.GetReturnValue().Set(v8_num(
+      info[0]->Int32Value(info.GetIsolate()->GetCurrentContext()).FromJust() +
+      info[1]->Int32Value(info.GetIsolate()->GetCurrentContext()).FromJust() +
       this_x));
 }
 
diff --git a/deps/v8/test/cctest/compiler/test-code-assembler.cc b/deps/v8/test/cctest/compiler/test-code-assembler.cc
index 09e70c9b02fc6f..26455e09e892f1 100644
--- a/deps/v8/test/cctest/compiler/test-code-assembler.cc
+++ b/deps/v8/test/cctest/compiler/test-code-assembler.cc
@@ -53,7 +53,7 @@ TEST(SimpleSmiReturn) {
   CodeAssembler m(asm_tester.state());
   m.Return(SmiTag(&m, m.IntPtrConstant(37)));
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK_EQ(37, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(37, (*ft.CallChecked<Smi>()).value());
 }
 
 TEST(SimpleIntPtrReturn) {
@@ -65,7 +65,7 @@ TEST(SimpleIntPtrReturn) {
       m.IntPtrConstant(reinterpret_cast<intptr_t>(&test))));
   FunctionTester ft(asm_tester.GenerateCode());
   MaybeHandle<Object> result = ft.Call();
-  CHECK_EQ(reinterpret_cast<Address>(&test), result.ToHandleChecked()->ptr());
+  CHECK_EQ(reinterpret_cast<Address>(&test), (*result.ToHandleChecked()).ptr());
 }
 
 TEST(SimpleDoubleReturn) {
@@ -86,7 +86,7 @@ TEST(SimpleCallRuntime1Arg) {
   TNode<Smi> b = SmiTag(&m, m.IntPtrConstant(0));
   m.Return(m.CallRuntime(Runtime::kIsSmi, context, b));
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK(ft.CallChecked<Oddball>().is_identical_to(
+  CHECK(ft.CallChecked<Boolean>().is_identical_to(
       isolate->factory()->true_value()));
 }
 
@@ -99,7 +99,7 @@ TEST(SimpleTailCallRuntime1Arg) {
   TNode<Smi> b = SmiTag(&m, m.IntPtrConstant(0));
   m.TailCallRuntime(Runtime::kIsSmi, context, b);
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK(ft.CallChecked<Oddball>().is_identical_to(
+  CHECK(ft.CallChecked<Boolean>().is_identical_to(
       isolate->factory()->true_value()));
 }
 
@@ -113,7 +113,7 @@ TEST(SimpleCallRuntime2Arg) {
   TNode<Smi> b = SmiTag(&m, m.IntPtrConstant(4));
   m.Return(m.CallRuntime(Runtime::kAdd, context, a, b));
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK_EQ(6, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(6, (*ft.CallChecked<Smi>()).value());
 }
 
 TEST(SimpleTailCallRuntime2Arg) {
@@ -126,7 +126,7 @@ TEST(SimpleTailCallRuntime2Arg) {
   TNode<Smi> b = SmiTag(&m, m.IntPtrConstant(4));
   m.TailCallRuntime(Runtime::kAdd, context, a, b);
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK_EQ(6, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(6, (*ft.CallChecked<Smi>()).value());
 }
 
 namespace {
@@ -460,7 +460,7 @@ TEST(ExceptionHandler) {
   m.Return(var.value());
 
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
-  CHECK_EQ(2, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(2, (*ft.CallChecked<Smi>()).value());
 }
 
 TEST(TestCodeAssemblerCodeComment) {
diff --git a/deps/v8/test/cctest/compiler/test-code-generator.cc b/deps/v8/test/cctest/compiler/test-code-generator.cc
index 7d86c2e359229d..4e1a4330ede47f 100644
--- a/deps/v8/test/cctest/compiler/test-code-generator.cc
+++ b/deps/v8/test/cctest/compiler/test-code-generator.cc
@@ -273,21 +273,21 @@ void PrintStateValue(std::ostream& os, Isolate* isolate, Handle<Object> value,
                      AllocatedOperand operand) {
   switch (operand.representation()) {
     case MachineRepresentation::kTagged:
-      if (value->IsSmi()) {
+      if (IsSmi(*value)) {
         os << Smi::cast(*value).value();
       } else {
-        os << value->Number();
+        os << Object::Number(*value);
       }
       break;
     case MachineRepresentation::kFloat32:
     case MachineRepresentation::kFloat64:
-      os << value->Number();
+      os << Object::Number(*value);
       break;
     case MachineRepresentation::kSimd128: {
-      FixedArray vector = FixedArray::cast(*value);
+      Tagged<FixedArray> vector = FixedArray::cast(*value);
       os << "[";
       for (int lane = 0; lane < 4; lane++) {
-        os << Smi::cast(vector.get(lane)).value();
+        os << Smi::cast(vector->get(lane)).value();
         if (lane < 3) {
           os << ", ";
         }
@@ -774,7 +774,7 @@ class TestEnvironment : public HandleAndZoneScope {
     return static_cast<int>(std::distance(layout.cbegin(), it));
   }
 
-  Object GetMoveSource(Handle<FixedArray> state, MoveOperands* move) {
+  Tagged<Object> GetMoveSource(Handle<FixedArray> state, MoveOperands* move) {
     InstructionOperand from = move->source();
     if (from.IsConstant()) {
       Constant constant = instructions_.GetConstant(
@@ -823,7 +823,7 @@ class TestEnvironment : public HandleAndZoneScope {
     for (auto move : *moves) {
       int to_index = OperandToStatePosition(
           TeardownLayout(), AllocatedOperand::cast(move->destination()));
-      Object source = GetMoveSource(state_out, move);
+      Tagged<Object> source = GetMoveSource(state_out, move);
       state_out->set(to_index, source);
     }
     return state_out;
@@ -838,14 +838,14 @@ class TestEnvironment : public HandleAndZoneScope {
     for (auto move : *moves) {
       int to_index = OperandToStatePosition(
           TeardownLayout(), AllocatedOperand::cast(move->destination()));
-      Object source = GetMoveSource(state_in, move);
+      Tagged<Object> source = GetMoveSource(state_in, move);
       state_out->set(to_index, source);
     }
     // If we generated redundant moves, they were eliminated automatically and
     // don't appear in the parallel move. Simulate them now.
     for (auto& operand : teardown_layout_) {
       int to_index = OperandToStatePosition(TeardownLayout(), operand);
-      if (state_out->get(to_index).IsUndefined()) {
+      if (IsUndefined(state_out->get(to_index))) {
         int from_index = OperandToStatePosition(setup_layout_, operand);
         state_out->set(to_index, state_in->get(from_index));
       }
@@ -900,13 +900,13 @@ class TestEnvironment : public HandleAndZoneScope {
       case MachineRepresentation::kTagged:
       case MachineRepresentation::kFloat32:
       case MachineRepresentation::kFloat64:
-        return actual->StrictEquals(*expected);
+        return Object::StrictEquals(*actual, *expected);
       case MachineRepresentation::kSimd128:
         for (int lane = 0; lane < 4; lane++) {
           int actual_lane =
-              Smi::cast(FixedArray::cast(*actual).get(lane)).value();
+              Smi::cast(FixedArray::cast(*actual)->get(lane)).value();
           int expected_lane =
-              Smi::cast(FixedArray::cast(*expected).get(lane)).value();
+              Smi::cast(FixedArray::cast(*expected)->get(lane)).value();
           if (actual_lane != expected_lane) {
             return false;
           }
@@ -1139,12 +1139,11 @@ class CodeGeneratorTester {
 
     constexpr size_t kMaxUnoptimizedFrameHeight = 0;
     constexpr size_t kMaxPushedArgumentCount = 0;
-    constexpr wasm::AssemblerBufferCache* kNoBufferCache = nullptr;
     generator_ = new CodeGenerator(
         environment->main_zone(), &frame_, &linkage_,
         environment->instructions(), &info_, environment->main_isolate(),
         base::Optional<OsrHelper>(), kNoSourcePosition, nullptr,
-        AssemblerOptions::Default(environment->main_isolate()), kNoBufferCache,
+        AssemblerOptions::Default(environment->main_isolate()),
         Builtin::kNoBuiltinId, kMaxUnoptimizedFrameHeight,
         kMaxPushedArgumentCount);
 
@@ -1371,7 +1370,7 @@ TEST(FuzzAssembleMove) {
 
     Handle<Code> test = c.FinalizeForExecuting();
     if (v8_flags.print_code) {
-      test->Print();
+      Print(*test);
     }
 
     Handle<FixedArray> actual = env.Run(test, state_in);
@@ -1395,7 +1394,7 @@ TEST(FuzzAssembleParallelMove) {
 
   Handle<Code> test = c.FinalizeForExecuting();
   if (v8_flags.print_code) {
-    test->Print();
+    Print(*test);
   }
 
   Handle<FixedArray> actual = env.Run(test, state_in);
@@ -1420,7 +1419,7 @@ TEST(FuzzAssembleSwap) {
 
     Handle<Code> test = c.FinalizeForExecuting();
     if (v8_flags.print_code) {
-      test->Print();
+      Print(*test);
     }
 
     Handle<FixedArray> actual = env.Run(test, state_in);
@@ -1458,7 +1457,7 @@ TEST(FuzzAssembleMoveAndSwap) {
 
     Handle<Code> test = c.FinalizeForExecuting();
     if (v8_flags.print_code) {
-      test->Print();
+      Print(*test);
     }
 
     Handle<FixedArray> actual = env.Run(test, state_in);
@@ -1539,7 +1538,7 @@ TEST(AssembleTailCallGap) {
                                 CodeGeneratorTester::kRegisterPush);
     Handle<Code> code = c.Finalize();
     if (v8_flags.print_code) {
-      code->Print();
+      Print(*code);
     }
   }
 
@@ -1568,7 +1567,7 @@ TEST(AssembleTailCallGap) {
                                 CodeGeneratorTester::kStackSlotPush);
     Handle<Code> code = c.Finalize();
     if (v8_flags.print_code) {
-      code->Print();
+      Print(*code);
     }
   }
 
@@ -1597,7 +1596,7 @@ TEST(AssembleTailCallGap) {
                                 CodeGeneratorTester::kScalarPush);
     Handle<Code> code = c.Finalize();
     if (v8_flags.print_code) {
-      code->Print();
+      Print(*code);
     }
   }
 }
@@ -1664,9 +1663,9 @@ TEST(Regress_1171759) {
           .ToHandleChecked();
 
   std::shared_ptr<wasm::NativeModule> module =
-      AllocateNativeModule(handles.main_isolate(), code->InstructionSize());
+      AllocateNativeModule(handles.main_isolate(), code->instruction_size());
   wasm::WasmCodeRefScope wasm_code_ref_scope;
-  byte* code_start = module->AddCodeForTesting(code)->instructions().begin();
+  uint8_t* code_start = module->AddCodeForTesting(code)->instructions().begin();
 
   // Generate a minimal calling function, to push stack arguments.
   RawMachineAssemblerTester<int32_t> mt;
diff --git a/deps/v8/test/cctest/compiler/test-concurrent-shared-function-info.cc b/deps/v8/test/cctest/compiler/test-concurrent-shared-function-info.cc
index 87a80ce331adf1..8045f460a5fb42 100644
--- a/deps/v8/test/cctest/compiler/test-concurrent-shared-function-info.cc
+++ b/deps/v8/test/cctest/compiler/test-concurrent-shared-function-info.cc
@@ -29,35 +29,34 @@ enum class SfiState {
   PreparedForDebugExecution,
 };
 
-void ExpectSharedFunctionInfoState(SharedFunctionInfo sfi,
+void ExpectSharedFunctionInfoState(Isolate* isolate,
+                                   Tagged<SharedFunctionInfo> sfi,
                                    SfiState expectedState) {
-  Object function_data = sfi.function_data(kAcquireLoad);
-  HeapObject script_or_debug_info = sfi.script_or_debug_info(kAcquireLoad);
+  Tagged<Object> function_data = sfi->function_data(kAcquireLoad);
+  Tagged<HeapObject> script = sfi->script(kAcquireLoad);
   switch (expectedState) {
     case SfiState::Compiled:
-      CHECK(function_data.IsBytecodeArray() ||
-            (function_data.IsCode() &&
-             Code::cast(function_data).kind() == CodeKind::BASELINE));
-      CHECK(script_or_debug_info.IsScript());
+      CHECK(IsBytecodeArray(function_data) ||
+            (IsCode(function_data) &&
+             Code::cast(function_data)->kind() == CodeKind::BASELINE));
+      CHECK(IsScript(script));
       break;
-    case SfiState::DebugInfo:
-      CHECK(function_data.IsBytecodeArray() ||
-            (function_data.IsCode() &&
-             Code::cast(function_data).kind() == CodeKind::BASELINE));
-      CHECK(script_or_debug_info.IsDebugInfo());
-      {
-        DebugInfo debug_info = DebugInfo::cast(script_or_debug_info);
-        CHECK(!debug_info.HasInstrumentedBytecodeArray());
-      }
+    case SfiState::DebugInfo: {
+      CHECK(IsBytecodeArray(function_data) ||
+            (IsCode(function_data) &&
+             Code::cast(function_data)->kind() == CodeKind::BASELINE));
+      CHECK(IsScript(script));
+      Tagged<DebugInfo> debug_info = sfi->GetDebugInfo(isolate);
+      CHECK(!debug_info->HasInstrumentedBytecodeArray());
       break;
-    case SfiState::PreparedForDebugExecution:
-      CHECK(function_data.IsBytecodeArray());
-      CHECK(script_or_debug_info.IsDebugInfo());
-      {
-        DebugInfo debug_info = DebugInfo::cast(script_or_debug_info);
-        CHECK(debug_info.HasInstrumentedBytecodeArray());
-      }
+    }
+    case SfiState::PreparedForDebugExecution: {
+      CHECK(IsBytecodeArray(function_data));
+      CHECK(IsScript(script));
+      Tagged<DebugInfo> debug_info = sfi->GetDebugInfo(isolate);
+      CHECK(debug_info->HasInstrumentedBytecodeArray());
       break;
+    }
   }
 }
 
@@ -137,7 +136,7 @@ TEST(TestConcurrentSharedFunctionInfo) {
   IsCompiledScope compiled_scope_f(*f_sfi, isolate);
   JSFunction::EnsureFeedbackVector(isolate, f, &compiled_scope_f);
 
-  ExpectSharedFunctionInfoState(*test_sfi, SfiState::Compiled);
+  ExpectSharedFunctionInfoState(isolate, *test_sfi, SfiState::Compiled);
 
   auto job =
       Pipeline::NewCompilationJob(isolate, test, CodeKind::TURBOFAN, true);
@@ -145,8 +144,7 @@ TEST(TestConcurrentSharedFunctionInfo) {
   // Prepare job.
   {
     CompilationHandleScope compilation(isolate, job->compilation_info());
-    CanonicalHandleScopeForTurbofan canonical(isolate, job->compilation_info());
-    job->compilation_info()->ReopenHandlesInNewHandleScope(isolate);
+    job->compilation_info()->ReopenAndCanonicalizeHandlesInNewScope(isolate);
     const CompilationJob::Status status = job->PrepareJob(isolate);
     CHECK_EQ(status, CompilationJob::SUCCEEDED);
   }
@@ -160,12 +158,12 @@ TEST(TestConcurrentSharedFunctionInfo) {
 
   sema_execute_start.Signal();
   // Background thread is running, now mess with test's SFI.
-  ExpectSharedFunctionInfoState(*test_sfi, SfiState::Compiled);
+  ExpectSharedFunctionInfoState(isolate, *test_sfi, SfiState::Compiled);
 
   // Compiled ==> DebugInfo
   {
     isolate->debug()->GetOrCreateDebugInfo(test_sfi);
-    ExpectSharedFunctionInfoState(*test_sfi, SfiState::DebugInfo);
+    ExpectSharedFunctionInfoState(isolate, *test_sfi, SfiState::DebugInfo);
   }
 
   for (int i = 0; i < 100; ++i) {
@@ -174,15 +172,15 @@ TEST(TestConcurrentSharedFunctionInfo) {
       int breakpoint_id;
       CHECK(isolate->debug()->SetBreakpointForFunction(
           test_sfi, isolate->factory()->empty_string(), &breakpoint_id));
-      ExpectSharedFunctionInfoState(*test_sfi,
+      ExpectSharedFunctionInfoState(isolate, *test_sfi,
                                     SfiState::PreparedForDebugExecution);
     }
 
     // PreparedForDebugExecution ==> DebugInfo
     {
-      DebugInfo debug_info = test_sfi->GetDebugInfo();
-      debug_info.ClearBreakInfo(isolate);
-      ExpectSharedFunctionInfoState(*test_sfi, SfiState::DebugInfo);
+      Tagged<DebugInfo> debug_info = test_sfi->GetDebugInfo(isolate);
+      debug_info->ClearBreakInfo(isolate);
+      ExpectSharedFunctionInfoState(isolate, *test_sfi, SfiState::DebugInfo);
     }
   }
 
diff --git a/deps/v8/test/cctest/compiler/test-instruction-scheduler.cc b/deps/v8/test/cctest/compiler/test-instruction-scheduler.cc
index ab65b5d485d553..d24be3767cc53a 100644
--- a/deps/v8/test/cctest/compiler/test-instruction-scheduler.cc
+++ b/deps/v8/test/cctest/compiler/test-instruction-scheduler.cc
@@ -4,6 +4,7 @@
 
 #include "src/compiler/backend/instruction-scheduler.h"
 #include "src/compiler/backend/instruction-selector-impl.h"
+#include "src/compiler/backend/instruction-selector.h"
 #include "src/compiler/backend/instruction.h"
 #include "test/cctest/cctest.h"
 
@@ -11,12 +12,14 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
+using FlagsContinuation = FlagsContinuationT<TurbofanAdapter>;
+
 // Create InstructionBlocks with a single block.
 InstructionBlocks* CreateSingleBlock(Zone* zone) {
   InstructionBlock* block = zone->New<InstructionBlock>(
       zone, RpoNumber::FromInt(0), RpoNumber::Invalid(), RpoNumber::Invalid(),
       RpoNumber::Invalid(), false, false);
-  InstructionBlocks* blocks = zone->NewArray<InstructionBlocks>(1);
+  InstructionBlocks* blocks = zone->AllocateArray<InstructionBlocks>(1);
   new (blocks) InstructionBlocks(1, block, zone);
   return blocks;
 }
diff --git a/deps/v8/test/cctest/compiler/test-js-constant-cache.cc b/deps/v8/test/cctest/compiler/test-js-constant-cache.cc
index 560e324495e6a9..bed263334627bf 100644
--- a/deps/v8/test/cctest/compiler/test-js-constant-cache.cc
+++ b/deps/v8/test/cctest/compiler/test-js-constant-cache.cc
@@ -8,6 +8,7 @@
 #include "src/compiler/node-properties.h"
 #include "src/heap/factory-inl.h"
 #include "test/cctest/cctest.h"
+#include "test/cctest/compiler/js-heap-broker-base.h"
 #include "test/common/value-helper.h"
 
 namespace v8 {
@@ -31,16 +32,15 @@ class JSCacheTesterHelper {
 // TODO(dcarney): JSConstantCacheTester inherits from JSGraph???
 class JSConstantCacheTester : public HandleAndZoneScope,
                               public JSCacheTesterHelper,
-                              public JSGraph {
+                              public JSGraph,
+                              public JSHeapBrokerTestBase {
  public:
   JSConstantCacheTester()
       : HandleAndZoneScope(kCompressGraphZone),
         JSCacheTesterHelper(main_zone()),
         JSGraph(main_isolate(), &main_graph_, &main_common_, &main_javascript_,
                 nullptr, &main_machine_),
-        canonical_(main_isolate()),
-        broker_(main_isolate(), main_zone()),
-        current_broker_(&broker_) {
+        JSHeapBrokerTestBase(main_isolate(), main_zone()) {
     main_graph_.SetStart(main_graph_.NewNode(common()->Start(0)));
     main_graph_.SetEnd(
         main_graph_.NewNode(common()->End(1), main_graph_.start()));
@@ -52,15 +52,8 @@ class JSConstantCacheTester : public HandleAndZoneScope,
   }
 
   Factory* factory() { return main_isolate()->factory(); }
-  JSHeapBroker* broker() { return &broker_; }
-
- private:
-  CanonicalHandleScope canonical_;
-  JSHeapBroker broker_;
-  CurrentHeapBrokerScope current_broker_;
 };
 
-
 TEST(ZeroConstant1) {
   JSConstantCacheTester T;
 
@@ -192,8 +185,9 @@ TEST(HeapNumbers) {
   JSConstantCacheTester T;
 
   FOR_FLOAT64_INPUTS(value) {
-    Handle<Object> num = T.factory()->NewNumber(value);
-    Handle<HeapNumber> heap = T.factory()->NewHeapNumber(value);
+    Handle<Object> num = T.CanonicalHandle(*T.factory()->NewNumber(value));
+    Handle<HeapNumber> heap =
+        T.CanonicalHandle(*T.factory()->NewHeapNumber(value));
     Node* node1 = T.Constant(value);
     Node* node2 = T.Constant(MakeRef(T.broker(), num), T.broker());
     Node* node3 = T.Constant(MakeRef(T.broker(), heap), T.broker());
diff --git a/deps/v8/test/cctest/compiler/test-js-context-specialization.cc b/deps/v8/test/cctest/compiler/test-js-context-specialization.cc
index c8eadddf9ae79a..8933e56b1e613a 100644
--- a/deps/v8/test/cctest/compiler/test-js-context-specialization.cc
+++ b/deps/v8/test/cctest/compiler/test-js-context-specialization.cc
@@ -17,16 +17,18 @@
 #include "src/objects/property.h"
 #include "test/cctest/cctest.h"
 #include "test/cctest/compiler/function-tester.h"
+#include "test/cctest/compiler/js-heap-broker-base.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
-class ContextSpecializationTester : public HandleAndZoneScope {
+class ContextSpecializationTester : public HandleAndZoneScope,
+                                    public JSHeapBrokerTestBase {
  public:
   explicit ContextSpecializationTester(Maybe<OuterContext> context)
       : HandleAndZoneScope(kCompressGraphZone),
-        canonical_(main_isolate()),
+        JSHeapBrokerTestBase(main_isolate(), main_zone()),
         graph_(main_zone()->New<Graph>(main_zone())),
         common_(main_zone()),
         javascript_(main_zone()),
@@ -34,10 +36,22 @@ class ContextSpecializationTester : public HandleAndZoneScope {
         simplified_(main_zone()),
         jsgraph_(main_isolate(), graph(), common(), &javascript_, &simplified_,
                  &machine_),
-        reducer_(main_zone(), graph(), &tick_counter_, &js_heap_broker_),
-        js_heap_broker_(main_isolate(), main_zone()),
-        current_broker_(&js_heap_broker_),
-        spec_(&reducer_, jsgraph(), &js_heap_broker_, context,
+        reducer_(main_zone(), graph(), &tick_counter_, broker()),
+        spec_(&reducer_, jsgraph(), broker(), context,
+              MaybeHandle<JSFunction>()) {}
+  ContextSpecializationTester(Maybe<OuterContext> context,
+                              CanonicalHandles&& handles)
+      : HandleAndZoneScope(kCompressGraphZone),
+        JSHeapBrokerTestBase(main_isolate(), main_zone(), std::move(handles)),
+        graph_(main_zone()->New<Graph>(main_zone())),
+        common_(main_zone()),
+        javascript_(main_zone()),
+        machine_(main_zone()),
+        simplified_(main_zone()),
+        jsgraph_(main_isolate(), graph(), common(), &javascript_, &simplified_,
+                 &machine_),
+        reducer_(main_zone(), graph(), &tick_counter_, broker()),
+        spec_(&reducer_, jsgraph(), broker(), context,
               MaybeHandle<JSFunction>()) {}
 
   JSContextSpecialization* spec() { return &spec_; }
@@ -56,11 +70,8 @@ class ContextSpecializationTester : public HandleAndZoneScope {
   void CheckContextInputAndDepthChanges(Node* node, Node* expected_new_context,
                                         size_t expected_new_depth);
 
-  JSHeapBroker* broker() { return &js_heap_broker_; }
-
  private:
   TickCounter tick_counter_;
-  CanonicalHandleScope canonical_;
   Graph* graph_;
   CommonOperatorBuilder common_;
   JSOperatorBuilder javascript_;
@@ -68,8 +79,6 @@ class ContextSpecializationTester : public HandleAndZoneScope {
   SimplifiedOperatorBuilder simplified_;
   JSGraph jsgraph_;
   GraphReducer reducer_;
-  JSHeapBroker js_heap_broker_;
-  CurrentHeapBrokerScope current_broker_;
   JSContextSpecialization spec_;
 };
 
@@ -116,12 +125,24 @@ void ContextSpecializationTester::CheckContextInputAndDepthChanges(
 }
 
 namespace {
+
 Handle<Context> NewContextForTesting(Isolate* isolate,
                                      Handle<Context> previous) {
   Handle<ScopeInfo> scope_info = ScopeInfo::CreateForWithScope(isolate, {});
   Handle<JSObject> extension = isolate->factory()->NewJSObjectWithNullProto();
   return isolate->factory()->NewWithContext(previous, scope_info, extension);
 }
+
+Handle<Context> NewCanonicalContextForTesting(ContextSpecializationTester& t,
+                                              Handle<Context> previous) {
+  Handle<ScopeInfo> scope_info =
+      t.CanonicalHandle(*ScopeInfo::CreateForWithScope(t.isolate(), {}));
+  Handle<JSObject> extension =
+      t.CanonicalHandle(*t.isolate()->factory()->NewJSObjectWithNullProto());
+  return t.CanonicalHandle(
+      *t.isolate()->factory()->NewWithContext(previous, scope_info, extension));
+}
+
 }  // namespace
 
 static const int slot_index = 5;
@@ -133,10 +154,11 @@ TEST(ReduceJSLoadContext0) {
   t.graph()->SetStart(start);
 
   // Make a context and initialize it a bit for this test.
-  Handle<Context> native = t.factory()->NewNativeContext();
-  Handle<Context> subcontext1 = NewContextForTesting(t.isolate(), native);
-  Handle<Context> subcontext2 = NewContextForTesting(t.isolate(), subcontext1);
-  Handle<Object> expected = t.factory()->InternalizeUtf8String("gboy!");
+  Handle<Context> native = t.CanonicalHandle(*t.factory()->NewNativeContext());
+  Handle<Context> subcontext1 = NewCanonicalContextForTesting(t, native);
+  Handle<Context> subcontext2 = NewCanonicalContextForTesting(t, subcontext1);
+  Handle<Object> expected =
+      t.CanonicalHandle(*t.factory()->InternalizeUtf8String("gboy!"));
   const int slot = 5;
   native->set(slot, *expected);
 
@@ -279,12 +301,15 @@ TEST(ReduceJSLoadContext2) {
   const i::compiler::Operator* create_function_context =
       t.javascript()->CreateFunctionContext(empty, 42, FUNCTION_SCOPE);
 
-  Handle<HeapObject> slot_value0 = t.factory()->InternalizeUtf8String("0");
-  Handle<HeapObject> slot_value1 = t.factory()->InternalizeUtf8String("1");
+  Handle<HeapObject> slot_value0 =
+      t.CanonicalHandle(*t.factory()->InternalizeUtf8String("0"));
+  Handle<HeapObject> slot_value1 =
+      t.CanonicalHandle(*t.factory()->InternalizeUtf8String("1"));
 
-  Handle<Context> context_object0 = t.factory()->NewNativeContext();
+  Handle<Context> context_object0 =
+      t.CanonicalHandle(*t.factory()->NewNativeContext());
   Handle<Context> context_object1 =
-      NewContextForTesting(t.isolate(), context_object0);
+      NewCanonicalContextForTesting(t, context_object0);
   context_object0->set_extension(*slot_value0);
   context_object1->set_extension(*slot_value1);
 
@@ -360,13 +385,17 @@ TEST(ReduceJSLoadContext3) {
   Handle<HeapObject> slot_value0 = factory->InternalizeUtf8String("0");
   Handle<HeapObject> slot_value1 = factory->InternalizeUtf8String("1");
 
-  Handle<Context> context_object0 = factory->NewNativeContext();
+  CanonicalHandles canonical_handles(isolate, handle_zone_scope.main_zone());
+
+  Handle<Context> context_object0 =
+      canonical_handles.Create(factory->NewNativeContext());
   Handle<Context> context_object1 =
-      NewContextForTesting(isolate, context_object0);
+      canonical_handles.Create(NewContextForTesting(isolate, context_object0));
   context_object0->set_extension(*slot_value0);
   context_object1->set_extension(*slot_value1);
 
-  ContextSpecializationTester t(Just(OuterContext(context_object1, 0)));
+  ContextSpecializationTester t(Just(OuterContext(context_object1, 0)),
+                                std::move(canonical_handles));
 
   Node* start = t.graph()->NewNode(t.common()->Start(2));
   t.graph()->SetStart(start);
@@ -438,10 +467,11 @@ TEST(ReduceJSStoreContext0) {
   t.graph()->SetStart(start);
 
   // Make a context and initialize it a bit for this test.
-  Handle<Context> native = t.factory()->NewNativeContext();
-  Handle<Context> subcontext1 = NewContextForTesting(t.isolate(), native);
-  Handle<Context> subcontext2 = NewContextForTesting(t.isolate(), subcontext1);
-  Handle<Object> expected = t.factory()->InternalizeUtf8String("gboy!");
+  Handle<Context> native = t.CanonicalHandle(*t.factory()->NewNativeContext());
+  Handle<Context> subcontext1 = NewCanonicalContextForTesting(t, native);
+  Handle<Context> subcontext2 = NewCanonicalContextForTesting(t, subcontext1);
+  Handle<Object> expected =
+      t.CanonicalHandle(*t.factory()->InternalizeUtf8String("gboy!"));
   const int slot = 5;
   native->set(slot, *expected);
 
@@ -549,12 +579,15 @@ TEST(ReduceJSStoreContext2) {
   const i::compiler::Operator* create_function_context =
       t.javascript()->CreateFunctionContext(empty, 42, FUNCTION_SCOPE);
 
-  Handle<HeapObject> slot_value0 = t.factory()->InternalizeUtf8String("0");
-  Handle<HeapObject> slot_value1 = t.factory()->InternalizeUtf8String("1");
+  Handle<HeapObject> slot_value0 =
+      t.CanonicalHandle(*t.factory()->InternalizeUtf8String("0"));
+  Handle<HeapObject> slot_value1 =
+      t.CanonicalHandle(*t.factory()->InternalizeUtf8String("1"));
 
-  Handle<Context> context_object0 = t.factory()->NewNativeContext();
+  Handle<Context> context_object0 =
+      t.CanonicalHandle(*t.factory()->NewNativeContext());
   Handle<Context> context_object1 =
-      NewContextForTesting(t.isolate(), context_object0);
+      NewCanonicalContextForTesting(t, context_object0);
   context_object0->set_extension(*slot_value0);
   context_object1->set_extension(*slot_value1);
 
@@ -599,16 +632,22 @@ TEST(ReduceJSStoreContext3) {
   auto isolate = handle_zone_scope.main_isolate();
   auto factory = isolate->factory();
 
-  Handle<HeapObject> slot_value0 = factory->InternalizeUtf8String("0");
-  Handle<HeapObject> slot_value1 = factory->InternalizeUtf8String("1");
+  CanonicalHandles canonical_handles(isolate, handle_zone_scope.main_zone());
+
+  Handle<HeapObject> slot_value0 =
+      canonical_handles.Create(factory->InternalizeUtf8String("0"));
+  Handle<HeapObject> slot_value1 =
+      canonical_handles.Create(factory->InternalizeUtf8String("1"));
 
-  Handle<Context> context_object0 = factory->NewNativeContext();
+  Handle<Context> context_object0 =
+      canonical_handles.Create(factory->NewNativeContext());
   Handle<Context> context_object1 =
-      NewContextForTesting(isolate, context_object0);
+      canonical_handles.Create(NewContextForTesting(isolate, context_object0));
   context_object0->set_extension(*slot_value0);
   context_object1->set_extension(*slot_value1);
 
-  ContextSpecializationTester t(Just(OuterContext(context_object1, 0)));
+  ContextSpecializationTester t(Just(OuterContext(context_object1, 0)),
+                                std::move(canonical_handles));
 
   Node* start = t.graph()->NewNode(t.common()->Start(2));
   t.graph()->SetStart(start);
@@ -691,13 +730,12 @@ TEST(SpecializeJSFunction_ToConstant_uninit) {
         "(function() { if (false) { var x = 1; } function inc(a)"
         " { return x; } return inc; })()");  // x is undefined!
     i::Isolate* isolate = CcTest::i_isolate();
-    CHECK(
-        T.Call(T.Val(0.0), T.Val(0.0)).ToHandleChecked()->IsUndefined(isolate));
-    CHECK(
-        T.Call(T.Val(2.0), T.Val(0.0)).ToHandleChecked()->IsUndefined(isolate));
-    CHECK(T.Call(T.Val(-2.1), T.Val(0.0))
-              .ToHandleChecked()
-              ->IsUndefined(isolate));
+    CHECK(IsUndefined(*T.Call(T.Val(0.0), T.Val(0.0)).ToHandleChecked(),
+                      isolate));
+    CHECK(IsUndefined(*T.Call(T.Val(2.0), T.Val(0.0)).ToHandleChecked(),
+                      isolate));
+    CHECK(IsUndefined(*T.Call(T.Val(-2.1), T.Val(0.0)).ToHandleChecked(),
+                      isolate));
   }
 
   {
@@ -705,9 +743,9 @@ TEST(SpecializeJSFunction_ToConstant_uninit) {
         "(function() { if (false) { var x = 1; } function inc(a)"
         " { return a + x; } return inc; })()");  // x is undefined!
 
-    CHECK(T.Call(T.Val(0.0), T.Val(0.0)).ToHandleChecked()->IsNaN());
-    CHECK(T.Call(T.Val(2.0), T.Val(0.0)).ToHandleChecked()->IsNaN());
-    CHECK(T.Call(T.Val(-2.1), T.Val(0.0)).ToHandleChecked()->IsNaN());
+    CHECK(IsNaN(*T.Call(T.Val(0.0), T.Val(0.0)).ToHandleChecked()));
+    CHECK(IsNaN(*T.Call(T.Val(2.0), T.Val(0.0)).ToHandleChecked()));
+    CHECK(IsNaN(*T.Call(T.Val(-2.1), T.Val(0.0)).ToHandleChecked()));
   }
 }
 
diff --git a/deps/v8/test/cctest/compiler/test-js-typed-lowering.cc b/deps/v8/test/cctest/compiler/test-js-typed-lowering.cc
index 0b18caeaaa8136..cdb359315f5a87 100644
--- a/deps/v8/test/cctest/compiler/test-js-typed-lowering.cc
+++ b/deps/v8/test/cctest/compiler/test-js-typed-lowering.cc
@@ -17,19 +17,19 @@
 #include "src/heap/factory-inl.h"
 #include "src/objects/objects.h"
 #include "test/cctest/cctest.h"
+#include "test/cctest/compiler/js-heap-broker-base.h"
 
 namespace v8 {
 namespace internal {
 namespace compiler {
 
-class JSTypedLoweringTester : public HandleAndZoneScope {
+class JSTypedLoweringTester : public HandleAndZoneScope,
+                              public JSHeapBrokerTestBase {
  public:
   explicit JSTypedLoweringTester(int num_parameters = 0)
       : HandleAndZoneScope(kCompressGraphZone),
+        JSHeapBrokerTestBase(main_isolate(), main_zone()),
         isolate(main_isolate()),
-        canonical(isolate),
-        js_heap_broker(isolate, main_zone()),
-        current_broker(&js_heap_broker),
         binop(nullptr),
         unop(nullptr),
         javascript(main_zone()),
@@ -37,9 +37,9 @@ class JSTypedLoweringTester : public HandleAndZoneScope {
         simplified(main_zone()),
         common(main_zone()),
         graph(main_zone()),
-        typer(&js_heap_broker, Typer::kNoFlags, &graph, &tick_counter),
+        typer(broker(), Typer::kNoFlags, &graph, &tick_counter),
         context_node(nullptr),
-        deps(&js_heap_broker, main_zone()) {
+        deps(broker(), main_zone()) {
     graph.SetStart(graph.NewNode(common.Start(num_parameters)));
     graph.SetEnd(graph.NewNode(common.End(1), graph.start()));
     typer.Run();
@@ -47,9 +47,6 @@ class JSTypedLoweringTester : public HandleAndZoneScope {
 
   Isolate* isolate;
   TickCounter tick_counter;
-  CanonicalHandleScope canonical;
-  JSHeapBroker js_heap_broker;
-  CurrentHeapBrokerScope current_broker;
   const Operator* binop;
   const Operator* unop;
   JSOperatorBuilder javascript;
@@ -95,10 +92,8 @@ class JSTypedLoweringTester : public HandleAndZoneScope {
   Node* reduce(Node* node) {
     JSGraph jsgraph(main_isolate(), &graph, &common, &javascript, &simplified,
                     &machine);
-    GraphReducer graph_reducer(main_zone(), &graph, &tick_counter,
-                               &js_heap_broker);
-    JSTypedLowering reducer(&graph_reducer, &jsgraph, &js_heap_broker,
-                            main_zone());
+    GraphReducer graph_reducer(main_zone(), &graph, &tick_counter, broker());
+    JSTypedLowering reducer(&graph_reducer, &jsgraph, broker(), main_zone());
     Reduction reduction = reducer.Reduce(node);
     if (reduction.Changed()) return reduction.replacement();
     return node;
diff --git a/deps/v8/test/cctest/compiler/test-loop-analysis.cc b/deps/v8/test/cctest/compiler/test-loop-analysis.cc
index ede4da40c0f4bd..d076f88058db70 100644
--- a/deps/v8/test/cctest/compiler/test-loop-analysis.cc
+++ b/deps/v8/test/cctest/compiler/test-loop-analysis.cc
@@ -927,7 +927,7 @@ TEST(LaEdgeMatrix3_5) { RunEdgeMatrix3_i(5); }
 
 static void RunManyChainedLoops_i(int count) {
   LoopFinderTester t;
-  Node** nodes = t.zone()->NewArray<Node*>(count * 4);
+  Node** nodes = t.zone()->AllocateArray<Node*>(count * 4);
   Node* k11 = t.jsgraph.Int32Constant(11);
   Node* k12 = t.jsgraph.Int32Constant(12);
   Node* last = t.start;
@@ -963,7 +963,7 @@ static void RunManyChainedLoops_i(int count) {
 
 static void RunManyNestedLoops_i(int count) {
   LoopFinderTester t;
-  Node** nodes = t.zone()->NewArray<Node*>(count * 5);
+  Node** nodes = t.zone()->AllocateArray<Node*>(count * 5);
   Node* k11 = t.jsgraph.Int32Constant(11);
   Node* k12 = t.jsgraph.Int32Constant(12);
   Node* outer = nullptr;
diff --git a/deps/v8/test/cctest/compiler/test-multiple-return.cc b/deps/v8/test/cctest/compiler/test-multiple-return.cc
index 9c65ee1582b7be..8ef9e7e3d13dda 100644
--- a/deps/v8/test/cctest/compiler/test-multiple-return.cc
+++ b/deps/v8/test/cctest/compiler/test-multiple-return.cc
@@ -187,7 +187,7 @@ void TestReturnMultipleValues(MachineType type, int min_count, int max_count) {
       std::shared_ptr<wasm::NativeModule> module = AllocateNativeModule(
           handles.main_isolate(), code->instruction_size());
       wasm::WasmCodeRefScope wasm_code_ref_scope;
-      byte* code_start =
+      uint8_t* code_start =
           module->AddCodeForTesting(code)->instructions().begin();
 
       RawMachineAssemblerTester<int32_t> mt(CodeKind::JS_TO_WASM_FUNCTION);
@@ -284,7 +284,8 @@ void ReturnLastValue(MachineType type) {
     std::shared_ptr<wasm::NativeModule> module =
         AllocateNativeModule(handles.main_isolate(), code->instruction_size());
     wasm::WasmCodeRefScope wasm_code_ref_scope;
-    byte* code_start = module->AddCodeForTesting(code)->instructions().begin();
+    uint8_t* code_start =
+        module->AddCodeForTesting(code)->instructions().begin();
 
     // Generate caller.
     int expect = return_count - 1;
@@ -347,7 +348,8 @@ void ReturnSumOfReturns(MachineType type) {
     std::shared_ptr<wasm::NativeModule> module =
         AllocateNativeModule(handles.main_isolate(), code->instruction_size());
     wasm::WasmCodeRefScope wasm_code_ref_scope;
-    byte* code_start = module->AddCodeForTesting(code)->instructions().begin();
+    uint8_t* code_start =
+        module->AddCodeForTesting(code)->instructions().begin();
 
     // Generate caller.
     RawMachineAssemblerTester<int32_t> mt;
diff --git a/deps/v8/test/cctest/compiler/test-representation-change.cc b/deps/v8/test/cctest/compiler/test-representation-change.cc
index 38cab3452b4629..053a5f1c9d99e4 100644
--- a/deps/v8/test/cctest/compiler/test-representation-change.cc
+++ b/deps/v8/test/cctest/compiler/test-representation-change.cc
@@ -13,6 +13,7 @@
 #include "test/cctest/cctest.h"
 #include "test/cctest/compiler/codegen-tester.h"
 #include "test/cctest/compiler/graph-and-builders.h"
+#include "test/cctest/compiler/js-heap-broker-base.h"
 #include "test/common/value-helper.h"
 
 namespace v8 {
@@ -20,27 +21,23 @@ namespace internal {
 namespace compiler {
 
 class RepresentationChangerTester : public HandleAndZoneScope,
-                                    public GraphAndBuilders {
+                                    public GraphAndBuilders,
+                                    public JSHeapBrokerTestBase {
  public:
   explicit RepresentationChangerTester(int num_parameters = 0)
       : HandleAndZoneScope(kCompressGraphZone),
         GraphAndBuilders(main_zone()),
+        JSHeapBrokerTestBase(main_isolate(), main_zone()),
         javascript_(main_zone()),
         jsgraph_(main_isolate(), main_graph_, &main_common_, &javascript_,
                  &main_simplified_, &main_machine_),
-        broker_(main_isolate(), main_zone()),
-        current_broker_(&broker_),
-        canonical_(main_isolate()),
-        changer_(&jsgraph_, &broker_, nullptr) {
+        changer_(&jsgraph_, broker(), nullptr) {
     Node* s = graph()->NewNode(common()->Start(num_parameters));
     graph()->SetStart(s);
   }
 
   JSOperatorBuilder javascript_;
   JSGraph jsgraph_;
-  JSHeapBroker broker_;
-  CurrentHeapBrokerScope current_broker_;
-  CanonicalHandleScope canonical_;
   RepresentationChanger changer_;
 
   Isolate* isolate() { return main_isolate(); }
@@ -80,7 +77,7 @@ class RepresentationChangerTester : public HandleAndZoneScope,
     CHECK_FLOAT_EQ(expected, fval);
   }
 
-  void CheckHeapConstant(Node* n, HeapObject expected) {
+  void CheckHeapConstant(Node* n, Tagged<HeapObject> expected) {
     HeapObjectMatcher m(n);
     CHECK(m.HasResolvedValue());
     CHECK_EQ(expected, *m.ResolvedValue());
diff --git a/deps/v8/test/cctest/compiler/test-run-load-store.cc b/deps/v8/test/cctest/compiler/test-run-load-store.cc
index a235c655883834..78b9d3c0cd14f6 100644
--- a/deps/v8/test/cctest/compiler/test-run-load-store.cc
+++ b/deps/v8/test/cctest/compiler/test-run-load-store.cc
@@ -8,8 +8,10 @@
 
 #include "src/base/bits.h"
 #include "src/base/overflowing-math.h"
+#include "src/base/template-utils.h"
 #include "src/base/utils/random-number-generator.h"
 #include "src/objects/objects-inl.h"
+#include "src/objects/tagged.h"
 #include "test/cctest/cctest.h"
 #include "test/cctest/compiler/codegen-tester.h"
 #include "test/common/value-helper.h"
@@ -26,7 +28,7 @@ enum TestAlignment {
 #if V8_TARGET_LITTLE_ENDIAN
 #define LSB(addr, bytes) addr
 #elif V8_TARGET_BIG_ENDIAN
-#define LSB(addr, bytes) reinterpret_cast<byte*>(addr + 1) - (bytes)
+#define LSB(addr, bytes) reinterpret_cast<uint8_t*>(addr + 1) - (bytes)
 #else
 #error "Unknown Architecture"
 #endif
@@ -36,9 +38,9 @@ enum TestAlignment {
 #define A_GIG (1024ULL * 1024ULL * 1024ULL)
 
 namespace {
-byte* ComputeOffset(void* real_address, int32_t offset) {
-  return reinterpret_cast<byte*>(reinterpret_cast<Address>(real_address) -
-                                 offset);
+uint8_t* ComputeOffset(void* real_address, int32_t offset) {
+  return reinterpret_cast<uint8_t*>(reinterpret_cast<Address>(real_address) -
+                                    offset);
 }
 
 void RunLoadInt32(const TestAlignment t) {
@@ -69,7 +71,7 @@ void RunLoadInt32Offset(TestAlignment t) {
   for (size_t i = 0; i < arraysize(offsets); i++) {
     RawMachineAssemblerTester<int32_t> m;
     int32_t offset = offsets[i];
-    byte* pointer = ComputeOffset(&p1, offset);
+    uint8_t* pointer = ComputeOffset(&p1, offset);
 
     // generate load [#base + #index]
     if (t == TestAlignment::kAligned) {
@@ -97,8 +99,8 @@ void RunLoadStoreFloat32Offset(TestAlignment t) {
         base::AddWithWraparound(0x2342AABB, base::MulWithWraparound(i, 3));
     RawMachineAssemblerTester<int32_t> m;
     int32_t offset = i;
-    byte* from = ComputeOffset(&p1, offset);
-    byte* to = ComputeOffset(&p2, offset);
+    uint8_t* from = ComputeOffset(&p1, offset);
+    uint8_t* to = ComputeOffset(&p2, offset);
     // generate load [#base + #index]
     if (t == TestAlignment::kAligned) {
       Node* load = m.Load(MachineType::Float32(), m.PointerConstant(from),
@@ -135,8 +137,8 @@ void RunLoadStoreFloat64Offset(TestAlignment t) {
         base::AddWithWraparound(0x2342AABB, base::MulWithWraparound(i, 3));
     RawMachineAssemblerTester<int32_t> m;
     int32_t offset = i;
-    byte* from = ComputeOffset(&p1, offset);
-    byte* to = ComputeOffset(&p2, offset);
+    uint8_t* from = ComputeOffset(&p1, offset);
+    uint8_t* to = ComputeOffset(&p2, offset);
     // generate load [#base + #index]
     if (t == TestAlignment::kAligned) {
       Node* load = m.Load(MachineType::Float64(), m.PointerConstant(from),
@@ -201,7 +203,8 @@ void CheckEq(CType in_value, CType out_value) {
 #ifdef V8_COMPRESS_POINTERS
 // Specializations for checking the result of compressing store.
 template <>
-void CheckEq<Object>(Object in_value, Object out_value) {
+void CheckEq<Tagged<Object>>(Tagged<Object> in_value,
+                             Tagged<Object> out_value) {
   // Compare only lower 32-bits of the value because tagged load/stores are
   // 32-bit operations anyway.
   CHECK_EQ(static_cast<Tagged_t>(in_value.ptr()),
@@ -209,13 +212,14 @@ void CheckEq<Object>(Object in_value, Object out_value) {
 }
 
 template <>
-void CheckEq<HeapObject>(HeapObject in_value, HeapObject out_value) {
-  return CheckEq<Object>(in_value, out_value);
+void CheckEq<Tagged<HeapObject>>(Tagged<HeapObject> in_value,
+                                 Tagged<HeapObject> out_value) {
+  return CheckEq<Tagged<Object>>(in_value, out_value);
 }
 
 template <>
-void CheckEq<Smi>(Smi in_value, Smi out_value) {
-  return CheckEq<Object>(in_value, out_value);
+void CheckEq<Tagged<Smi>>(Tagged<Smi> in_value, Tagged<Smi> out_value) {
+  return CheckEq<Tagged<Object>>(in_value, out_value);
 }
 #endif
 
@@ -225,9 +229,9 @@ template <typename CType>
 void InitBuffer(CType* buffer, size_t length, MachineType type) {
   const size_t kBufferSize = sizeof(CType) * length;
   if (!type.IsTagged()) {
-    byte* raw = reinterpret_cast<byte*>(buffer);
+    uint8_t* raw = reinterpret_cast<uint8_t*>(buffer);
     for (size_t i = 0; i < kBufferSize; i++) {
-      raw[i] = static_cast<byte>((i + kBufferSize) ^ 0xAA);
+      raw[i] = static_cast<uint8_t>((i + kBufferSize) ^ 0xAA);
     }
     return;
   }
@@ -343,8 +347,8 @@ void RunLoadStore(MachineType type, TestAlignment t) {
 template <typename CType>
 void RunUnalignedLoadStoreUnalignedAccess(MachineType type) {
   CType in, out;
-  byte in_buffer[2 * sizeof(CType)];
-  byte out_buffer[2 * sizeof(CType)];
+  uint8_t in_buffer[2 * sizeof(CType)];
+  uint8_t out_buffer[2 * sizeof(CType)];
 
   InitBuffer(&in, 1, type);
 
@@ -386,10 +390,12 @@ TEST(RunLoadImmIndex) {
   RunLoadImmIndex<int32_t>(MachineType::Int32(), TestAlignment::kAligned);
   RunLoadImmIndex<uint32_t>(MachineType::Uint32(), TestAlignment::kAligned);
   RunLoadImmIndex<void*>(MachineType::Pointer(), TestAlignment::kAligned);
-  RunLoadImmIndex<Smi>(MachineType::TaggedSigned(), TestAlignment::kAligned);
-  RunLoadImmIndex<HeapObject>(MachineType::TaggedPointer(),
-                              TestAlignment::kAligned);
-  RunLoadImmIndex<Object>(MachineType::AnyTagged(), TestAlignment::kAligned);
+  RunLoadImmIndex<Tagged<Smi>>(MachineType::TaggedSigned(),
+                               TestAlignment::kAligned);
+  RunLoadImmIndex<Tagged<HeapObject>>(MachineType::TaggedPointer(),
+                                      TestAlignment::kAligned);
+  RunLoadImmIndex<Tagged<Object>>(MachineType::AnyTagged(),
+                                  TestAlignment::kAligned);
   RunLoadImmIndex<float>(MachineType::Float32(), TestAlignment::kAligned);
   RunLoadImmIndex<double>(MachineType::Float64(), TestAlignment::kAligned);
 #if V8_TARGET_ARCH_64_BIT
@@ -420,10 +426,12 @@ TEST(RunLoadStore) {
   RunLoadStore<int32_t>(MachineType::Int32(), TestAlignment::kAligned);
   RunLoadStore<uint32_t>(MachineType::Uint32(), TestAlignment::kAligned);
   RunLoadStore<void*>(MachineType::Pointer(), TestAlignment::kAligned);
-  RunLoadStore<Smi>(MachineType::TaggedSigned(), TestAlignment::kAligned);
-  RunLoadStore<HeapObject>(MachineType::TaggedPointer(),
-                           TestAlignment::kAligned);
-  RunLoadStore<Object>(MachineType::AnyTagged(), TestAlignment::kAligned);
+  RunLoadStore<Tagged<Smi>>(MachineType::TaggedSigned(),
+                            TestAlignment::kAligned);
+  RunLoadStore<Tagged<HeapObject>>(MachineType::TaggedPointer(),
+                                   TestAlignment::kAligned);
+  RunLoadStore<Tagged<Object>>(MachineType::AnyTagged(),
+                               TestAlignment::kAligned);
   RunLoadStore<float>(MachineType::Float32(), TestAlignment::kAligned);
   RunLoadStore<double>(MachineType::Float64(), TestAlignment::kAligned);
 #if V8_TARGET_ARCH_64_BIT
diff --git a/deps/v8/test/cctest/compiler/test-run-machops.cc b/deps/v8/test/cctest/compiler/test-run-machops.cc
index fa97076a1afa99..261192764a98e5 100644
--- a/deps/v8/test/cctest/compiler/test-run-machops.cc
+++ b/deps/v8/test/cctest/compiler/test-run-machops.cc
@@ -472,6 +472,22 @@ TEST(RunSelectUnorderedNotEqual) {
   CHECK_EQ(input1, m.Call(input1, input2, std::nanf("")));
 }
 
+namespace {
+template <typename T>
+ExternalReference ExternalRefFromFunc(RawMachineAssemblerTester<T>* m,
+                                      Address func_address) {
+  ExternalReference::Type func_type = ExternalReference::FAST_C_CALL;
+  ApiFunction func(func_address);
+  ExternalReference ref = ExternalReference::Create(&func, func_type);
+#ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
+  EncodedCSignature sig = m->call_descriptor()->ToEncodedCSignature();
+  m->main_isolate()->simulator_data()->AddSignatureForTargetForTesting(
+      func_address, sig);
+#endif
+  return ref;
+}
+}  // namespace
+
 namespace {
 void FooForSelect() {}
 }  // namespace
@@ -484,14 +500,13 @@ TEST(RunWord32SelectWithMemoryInput) {
   }
 
   // Test that the generated code also works with values spilled on the stack.
-
-  auto* foo_ptr = &FooForSelect;
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(FooForSelect));
   constexpr int input1 = 16;
   int input2 = 3443;
   // Load {value2} before the function call so that it gets spilled.
   Node* value2 = m.LoadFromPointer(&input2, MachineType::Int32());
-  Node* function = m.LoadFromPointer(&foo_ptr, MachineType::Pointer());
   // Call a function so that {value2} gets spilled on the stack.
+  Node* function = m.ExternalConstant(ref);
   m.CallCFunction(function, MachineType::Int32());
   Node* cmp = m.Word32Equal(m.Parameter(1), m.Int32Constant(0));
   m.Return(m.Word32Select(cmp, m.Parameter(0), value2));
@@ -511,13 +526,13 @@ TEST(RunWord64SelectWithMemoryInput) {
 
   // Test that the generated code also works with values spilled on the stack.
 
-  auto* foo_ptr = &FooForSelect;
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(FooForSelect));
   constexpr int64_t input1 = 16;
   int64_t input2 = 0x12345678ABCD;
   // Load {value2} before the function call so that it gets spilled.
   Node* value2 = m.LoadFromPointer(&input2, MachineType::Int64());
-  Node* function = m.LoadFromPointer(&foo_ptr, MachineType::Pointer());
   // Call a function so that {value2} gets spilled on the stack.
+  Node* function = m.ExternalConstant(ref);
   m.CallCFunction(function, MachineType::Int32());
   Node* cmp = m.Word32Equal(m.Parameter(1), m.Int32Constant(0));
   m.Return(m.Word64Select(cmp, m.Parameter(0), value2));
@@ -1157,7 +1172,7 @@ TEST(RunDiamondPhiConst) {
 
 
 TEST(RunDiamondPhiNumber) {
-  RawMachineAssemblerTester<Object> m(MachineType::Int32());
+  RawMachineAssemblerTester<Tagged<Object>> m(MachineType::Int32());
   double false_val = -11.1;
   double true_val = 200.1;
   Node* true_node = m.NumberConstant(true_val);
@@ -1170,7 +1185,7 @@ TEST(RunDiamondPhiNumber) {
 
 
 TEST(RunDiamondPhiString) {
-  RawMachineAssemblerTester<Object> m(MachineType::Int32());
+  RawMachineAssemblerTester<Tagged<Object>> m(MachineType::Int32());
   const char* false_val = "false";
   const char* true_val = "true";
   Node* true_node = m.StringConstant(true_val);
@@ -5164,7 +5179,7 @@ TEST(RunRefDiamond) {
   const int magic = 99644;
   Handle<String> rexpected =
       CcTest::i_isolate()->factory()->InternalizeUtf8String("A");
-  String buffer;
+  Tagged<String> buffer;
 
   RawMachineLabel blocka, blockb, end;
   Node* k1 = m.StringConstant("A");
@@ -5187,7 +5202,7 @@ TEST(RunRefDiamond) {
   m.Return(m.Int32Constant(magic));
 
   CHECK_EQ(magic, m.Call());
-  CHECK(rexpected->SameValue(buffer));
+  CHECK(Object::SameValue(*rexpected, buffer));
 }
 
 
@@ -5199,7 +5214,7 @@ TEST(RunDoubleRefDiamond) {
   double dconstant = 99.99;
   Handle<String> rexpected =
       CcTest::i_isolate()->factory()->InternalizeUtf8String("AX");
-  String rbuffer;
+  Tagged<String> rbuffer;
 
   RawMachineLabel blocka, blockb, end;
   Node* d1 = m.Float64Constant(dconstant);
@@ -5228,7 +5243,7 @@ TEST(RunDoubleRefDiamond) {
 
   CHECK_EQ(magic, m.Call());
   CHECK_EQ(dconstant, dbuffer);
-  CHECK(rexpected->SameValue(rbuffer));
+  CHECK(Object::SameValue(*rexpected, rbuffer));
 }
 
 
@@ -5240,7 +5255,7 @@ TEST(RunDoubleRefDoubleDiamond) {
   double dconstant = 99.997;
   Handle<String> rexpected =
       CcTest::i_isolate()->factory()->InternalizeUtf8String("AD");
-  String rbuffer;
+  Tagged<String> rbuffer;
 
   RawMachineLabel blocka, blockb, mid, blockd, blocke, end;
   Node* d1 = m.Float64Constant(dconstant);
@@ -5279,7 +5294,7 @@ TEST(RunDoubleRefDoubleDiamond) {
 
   CHECK_EQ(magic, m.Call());
   CHECK_EQ(dconstant, dbuffer);
-  CHECK(rexpected->SameValue(rbuffer));
+  CHECK(Object::SameValue(*rexpected, rbuffer));
 }
 
 
@@ -5745,7 +5760,7 @@ TEST(RunSpillConstantsAndParameters) {
 
 
 TEST(RunNewSpaceConstantsInPhi) {
-  RawMachineAssemblerTester<Object> m(MachineType::Int32());
+  RawMachineAssemblerTester<Tagged<Object>> m(MachineType::Int32());
 
   Isolate* isolate = CcTest::i_isolate();
   Handle<HeapNumber> true_val = isolate->factory()->NewHeapNumber(11.2);
@@ -6778,20 +6793,6 @@ TEST(RunCallCFunction9) {
 #endif  // !USE_SIMULATOR
 
 #ifdef V8_ENABLE_FP_PARAMS_IN_C_LINKAGE
-#ifdef V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
-#define IF_SIMULATOR_ADD_SIGNATURE                                     \
-  EncodedCSignature sig = m.call_descriptor()->ToEncodedCSignature();  \
-  m.main_isolate()->simulator_data()->AddSignatureForTargetForTesting( \
-      func_address, sig);
-#else
-#define IF_SIMULATOR_ADD_SIGNATURE
-#endif  // V8_USE_SIMULATOR_WITH_GENERIC_C_CALLS
-
-#define EXTERNAL_REF_FROM_FUNC(FUNC)                                  \
-  Address func_address = FUNCTION_ADDR(&FUNC);                        \
-  ExternalReference::Type func_type = ExternalReference::FAST_C_CALL; \
-  ApiFunction func(func_address);                                     \
-  ExternalReference ref = ExternalReference::Create(&func, func_type);
 
 namespace {
 
@@ -6919,8 +6920,7 @@ double int_foo10(int64_t a, int64_t b, int64_t c, int64_t d, int64_t e,
 
 TEST(RunCallDoubleCFunction0) {
   RawMachineAssemblerTester<double> m;
-  EXTERNAL_REF_FROM_FUNC(double_foo0)
-  IF_SIMULATOR_ADD_SIGNATURE
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(double_foo0));
 
   Node* function = m.ExternalConstant(ref);
   m.Return(m.CallCFunction(function, MachineType::Float64()));
@@ -6929,8 +6929,7 @@ TEST(RunCallDoubleCFunction0) {
 
 TEST(RunCallDoubleCFunction1) {
   RawMachineAssemblerTester<double> m(MachineType::Float64());
-  EXTERNAL_REF_FROM_FUNC(double_foo1)
-  IF_SIMULATOR_ADD_SIGNATURE
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(double_foo1));
 
   Node* function = m.ExternalConstant(ref);
   m.Return(
@@ -6942,8 +6941,7 @@ TEST(RunCallDoubleCFunction1) {
 TEST(RunCallDoubleCFunction2) {
   RawMachineAssemblerTester<double> m(MachineType::Float64(),
                                       MachineType::Float64());
-  EXTERNAL_REF_FROM_FUNC(double_foo2)
-  IF_SIMULATOR_ADD_SIGNATURE
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(double_foo2));
 
   Node* function = m.ExternalConstant(ref);
   m.Return(
@@ -6961,8 +6959,7 @@ TEST(RunCallDoubleCFunction8) {
       MachineType::Float64(), MachineType::Float64(), MachineType::Float64(),
       MachineType::Float64(), MachineType::Float64(), MachineType::Float64(),
       MachineType::Float64(), MachineType::Float64());
-  EXTERNAL_REF_FROM_FUNC(double_foo8)
-  IF_SIMULATOR_ADD_SIGNATURE
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(double_foo8));
 
   Node* function = m.ExternalConstant(ref);
   Node* param = m.Parameter(0);
@@ -6986,8 +6983,7 @@ TEST(RunCallDoubleCFunction9) {
       MachineType::Float64(), MachineType::Float64(), MachineType::Float64(),
       MachineType::Float64(), MachineType::Float64(), MachineType::Float64(),
       MachineType::Float64(), MachineType::Float64(), MachineType::Float64());
-  EXTERNAL_REF_FROM_FUNC(double_foo9)
-  IF_SIMULATOR_ADD_SIGNATURE
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(double_foo9));
 
   Node* function = m.ExternalConstant(ref);
   Node* param = m.Parameter(0);
@@ -7022,8 +7018,7 @@ TEST(RunCallDoubleCFunction10) {
       MachineType::Float64(), MachineType::Float64(), MachineType::Float64(),
       MachineType::Float64(), MachineType::Float64(), MachineType::Float64(),
       MachineType::Int64());
-  EXTERNAL_REF_FROM_FUNC(double_foo10)
-  IF_SIMULATOR_ADD_SIGNATURE
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(double_foo10));
 
   Node* function = m.ExternalConstant(ref);
   m.Return(
@@ -7051,8 +7046,7 @@ TEST(RunCallIntCFunction10) {
       MachineType::Int64(), MachineType::Int64(), MachineType::Int64(),
       MachineType::Int64(), MachineType::Int64(), MachineType::Int64(),
       MachineType::Float64());
-  EXTERNAL_REF_FROM_FUNC(int_foo10)
-  IF_SIMULATOR_ADD_SIGNATURE
+  ExternalReference ref = ExternalRefFromFunc(&m, FUNCTION_ADDR(int_foo10));
 
   Node* function = m.ExternalConstant(ref);
   m.Return(
diff --git a/deps/v8/test/cctest/compiler/test-run-native-calls.cc b/deps/v8/test/cctest/compiler/test-run-native-calls.cc
index 1fee7933c0769d..3a3890db4a63ea 100644
--- a/deps/v8/test/cctest/compiler/test-run-native-calls.cc
+++ b/deps/v8/test/cctest/compiler/test-run-native-calls.cc
@@ -271,7 +271,7 @@ Handle<Code> WrapWithCFunction(Isolate* isolate, Handle<Code> inner,
     Node* target = b.graph()->NewNode(b.common()->HeapConstant(inner));
 
     // Add arguments to the call.
-    Node** args = zone.NewArray<Node*>(param_count + 3);
+    Node** args = zone.AllocateArray<Node*>(param_count + 3);
     int index = 0;
     args[index++] = target;
     for (int i = 0; i < param_count; i++) {
@@ -447,7 +447,7 @@ class Computer {
         CallDescriptor* cdesc = Linkage::GetSimplifiedCDescriptor(&zone, &csig);
         RawMachineAssembler raw(isolate, &graph, cdesc);
         Node* target = raw.HeapConstant(inner);
-        Node** inputs = zone.NewArray<Node*>(num_params + 1);
+        Node** inputs = zone.AllocateArray<Node*>(num_params + 1);
         int input_count = 0;
         inputs[input_count++] = target;
         for (int i = 0; i < num_params; i++) {
@@ -482,7 +482,7 @@ class Computer {
         RawMachineAssembler raw(isolate, &graph, cdesc);
         Node* base = raw.PointerConstant(io.input);
         Node* target = raw.HeapConstant(inner);
-        Node** inputs = zone.NewArray<Node*>(kMaxParamCount + 1);
+        Node** inputs = zone.AllocateArray<Node*>(kMaxParamCount + 1);
         int input_count = 0;
         inputs[input_count++] = target;
         for (int i = 0; i < num_params; i++) {
@@ -582,7 +582,7 @@ static void CopyTwentyInt32(CallDescriptor* desc) {
     RawMachineAssembler raw(isolate, &graph, cdesc);
     Node* base = raw.PointerConstant(input);
     Node* target = raw.HeapConstant(inner);
-    Node** inputs = zone.NewArray<Node*>(JSParameterCount(kNumParams));
+    Node** inputs = zone.AllocateArray<Node*>(JSParameterCount(kNumParams));
     int input_count = 0;
     inputs[input_count++] = target;
     for (int i = 0; i < kNumParams; i++) {
@@ -951,13 +951,13 @@ static void Build_Select_With_Call(CallDescriptor* desc,
     r.Return(r.Parameter(which));
     inner = CompileGraph("Select-indirection", desc, &graph, r.ExportForTest());
     CHECK(!inner.is_null());
-    CHECK(inner->IsCode());
+    CHECK(IsCode(*inner));
   }
 
   {
     // Build a call to the function that does the select.
     Node* target = raw->HeapConstant(inner);
-    Node** inputs = raw->zone()->NewArray<Node*>(num_params + 1);
+    Node** inputs = raw->zone()->AllocateArray<Node*>(num_params + 1);
     int input_count = 0;
     inputs[input_count++] = target;
     for (int i = 0; i < num_params; i++) {
@@ -1064,7 +1064,7 @@ void MixedParamTest(int start) {
             Linkage::GetSimplifiedCDescriptor(&wrap_zone, &csig);
         RawMachineAssembler raw(isolate, &graph, cdesc);
         Node* target = raw.HeapConstant(select);
-        Node** inputs = wrap_zone.NewArray<Node*>(num_params + 1);
+        Node** inputs = wrap_zone.AllocateArray<Node*>(num_params + 1);
         int input_count = 0;
         inputs[input_count++] = target;
         int64_t constant = 0x0102030405060708;
diff --git a/deps/v8/test/cctest/compiler/test-select-combine.cc b/deps/v8/test/cctest/compiler/test-select-combine.cc
new file mode 100644
index 00000000000000..fa0140f7f634af
--- /dev/null
+++ b/deps/v8/test/cctest/compiler/test-select-combine.cc
@@ -0,0 +1,500 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/objects/objects-inl.h"
+#include "test/cctest/cctest.h"
+#include "test/cctest/compiler/codegen-tester.h"
+#include "test/common/value-helper.h"
+
+namespace v8::internal::compiler {
+
+// Generates a binop arithmetic instruction, followed by a integer compare zero
+// and select. This is to test a possible merge of the arithmetic op and the
+// compare for use by the select. We test a matrix of configurations:
+// - floating-point and integer select.
+// - add, sub, mul, and, or and xor.
+// - int32, uint32t, int64_t, uint64_t, float and double.
+// - one or multiple users of the binary operation.
+// - two different graph layouts (single block vs three blocks).
+
+namespace {
+
+enum GraphConfig { kOneUse, kTwoUsesOneBlock, kTwoUsesTwoBlocks };
+constexpr GraphConfig graph_configs[] = {GraphConfig::kOneUse,
+                                         GraphConfig::kTwoUsesOneBlock,
+                                         GraphConfig::kTwoUsesTwoBlocks};
+
+// kOneUse:
+// (bin_res = binop lhs, rhs)
+// (return (select (compare bin_res, zero, cond), tval, fval))
+//
+// kTwoUsesOneBlock:
+// (bin_res = binop lhs, rhs)
+// (return (add (select (compare bin_res, zero, cond), tval, fval), bin_res))
+//
+// kTwoUsesTwoBlocks:
+// Same as above, but the final addition is conditionally executed in a
+// different block.
+// (bin_res = binop lhs, rhs)
+// (select_res = (select (compare bin_res, zero, cond), tval, fval))
+// (select_res >= tval)
+//   ? (return select_res)
+//   : (return (add select_res, bin_res))
+
+template <typename CondType, typename ResultType>
+class ConditionalSelectGen {
+ public:
+  ConditionalSelectGen(BufferedRawMachineAssemblerTester<ResultType>& m,
+                       GraphConfig c, IrOpcode::Value icmp_op,
+                       IrOpcode::Value bin_op)
+      : m_(m), config_(c), cmpw_(icmp_op), binw_(bin_op) {}
+
+  void BuildGraph(const Operator* select_op, Node* lhs, Node* rhs, Node* tval,
+                  Node* fval) {
+    CompareAndSelect(select_op, lhs, rhs, tval, fval);
+
+    switch (config()) {
+      case GraphConfig::kOneUse:
+        m().Return(select());
+        break;
+      case GraphConfig::kTwoUsesOneBlock:
+        m().Return(AddBinopUse());
+        break;
+      case GraphConfig::kTwoUsesTwoBlocks:
+        m().Return(AddBranchAndUse());
+        break;
+      default:
+        UNREACHABLE();
+    }
+  }
+
+  void CompareAndSelect(const Operator* selectop, Node* lhs, Node* rhs,
+                        Node* tval, Node* fval) {
+    Node* zero = Is32() ? m().Int32Constant(0) : m().Int64Constant(0);
+    bin_node_ = m().AddNode(binw().op(m().machine()), lhs, rhs);
+    Node* cond = m().AddNode(cmpw().op(m().machine()), bin_node(), zero);
+    select_ = m().AddNode(selectop, cond, tval, fval);
+  }
+
+  Node* AddBranchAndUse() {
+    const Operator* cond_op = nullptr;
+    switch (select()->opcode()) {
+      case IrOpcode::kFloat32Select:
+        cond_op = m().machine()->Float32LessThan();
+        break;
+      case IrOpcode::kFloat64Select:
+        cond_op = m().machine()->Float64LessThan();
+        break;
+      case IrOpcode::kWord32Select:
+        cond_op = m().machine()->Int32LessThan();
+        break;
+      case IrOpcode::kWord64Select:
+        cond_op = m().machine()->Int64LessThan();
+        break;
+      default:
+        UNREACHABLE();
+    }
+    DCHECK_NOT_NULL(cond_op);
+    Node* cond = m().AddNode(cond_op, select(), select()->InputAt(1));
+    m().Branch(cond, &blocka(), &blockb());
+    m().Bind(&blocka());
+    Node* res = AddBinopUse();
+    m().Return(res);
+    m().Bind(&blockb());
+    return select();
+  }
+
+  ResultType expected(CondType lhs, CondType rhs, ResultType tval,
+                      ResultType fval) {
+    CondType bin_node_res = binw().eval(lhs, rhs);
+    ResultType res =
+        Is32() ? cmpw().Int32Compare(static_cast<uint32_t>(bin_node_res), 0)
+                     ? tval
+                     : fval
+        : cmpw().Int64Compare(static_cast<uint64_t>(bin_node_res), 0) ? tval
+                                                                      : fval;
+    if (config() == GraphConfig::kTwoUsesTwoBlocks && res >= tval) {
+      return res;
+    }
+    if (config() != GraphConfig::kOneUse) {
+      res += static_cast<ResultType>(bin_node_res);
+    }
+    return res;
+  }
+
+  BufferedRawMachineAssemblerTester<ResultType>& m() { return m_; }
+  GraphConfig config() const { return config_; }
+  const IntBinopWrapper<CondType>& binw() const { return binw_; }
+  const CompareWrapper& cmpw() const { return cmpw_; }
+  Node* select() const { return select_; }
+  Node* bin_node() const { return bin_node_; }
+  RawMachineLabel& blocka() { return blocka_; }
+  RawMachineLabel& blockb() { return blockb_; }
+
+  virtual Node* AddBinopUse() = 0;
+  virtual bool Is32() const = 0;
+
+ private:
+  BufferedRawMachineAssemblerTester<ResultType>& m_;
+  GraphConfig config_;
+  CompareWrapper cmpw_;
+  IntBinopWrapper<CondType> binw_;
+  Node* bin_node_;
+  Node* select_;
+  RawMachineLabel blocka_, blockb_;
+};
+
+template <typename ResultType>
+class UInt32ConditionalSelectGen
+    : public ConditionalSelectGen<uint32_t, ResultType> {
+ public:
+  using ConditionalSelectGen<uint32_t, ResultType>::ConditionalSelectGen;
+
+  Node* AddBinopUse() override {
+    BufferedRawMachineAssemblerTester<ResultType>& m = this->m();
+    Node* bin_node = this->bin_node();
+    Node* bin_node_use = nullptr;
+    Node* select = this->select();
+    const Operator* add_op = nullptr;
+    switch (select->opcode()) {
+      case IrOpcode::kFloat32Select:
+        bin_node_use = m.RoundUint32ToFloat32(bin_node);
+        add_op = m.machine()->Float32Add();
+        break;
+      case IrOpcode::kFloat64Select:
+        bin_node_use = m.ChangeUint32ToFloat64(bin_node);
+        add_op = m.machine()->Float64Add();
+        break;
+      case IrOpcode::kWord32Select:
+        bin_node_use = bin_node;
+        add_op = m.machine()->Int32Add();
+        break;
+      case IrOpcode::kWord64Select:
+        bin_node_use = m.ChangeUint32ToUint64(bin_node);
+        add_op = m.machine()->Int64Add();
+        break;
+      default:
+        UNREACHABLE();
+    }
+    DCHECK_NOT_NULL(bin_node_use);
+    DCHECK_NOT_NULL(add_op);
+    return m.AddNode(add_op, select, bin_node_use);
+  }
+
+  bool Is32() const override { return true; }
+};
+
+template <typename ResultType>
+class UInt64ConditionalSelectGen
+    : public ConditionalSelectGen<uint64_t, ResultType> {
+ public:
+  using ConditionalSelectGen<uint64_t, ResultType>::ConditionalSelectGen;
+
+  Node* AddBinopUse() override {
+    BufferedRawMachineAssemblerTester<ResultType>& m = this->m();
+    Node* bin_node = this->bin_node();
+    Node* bin_node_use = nullptr;
+    Node* select = this->select();
+    const Operator* add_op;
+    switch (select->opcode()) {
+      case IrOpcode::kFloat32Select:
+        bin_node_use = m.RoundUint64ToFloat32(bin_node);
+        add_op = m.machine()->Float32Add();
+        break;
+      case IrOpcode::kFloat64Select:
+        bin_node_use = m.RoundUint64ToFloat64(bin_node);
+        add_op = m.machine()->Float64Add();
+        break;
+      case IrOpcode::kWord32Select:
+        bin_node_use = m.TruncateInt64ToInt32(bin_node);
+        add_op = m.machine()->Int32Add();
+        break;
+      case IrOpcode::kWord64Select:
+        bin_node_use = bin_node;
+        add_op = m.machine()->Int64Add();
+        break;
+      default:
+        UNREACHABLE();
+    }
+    DCHECK(bin_node_use);
+    DCHECK(add_op);
+    return m.AddNode(add_op, select, bin_node_use);
+  }
+
+  bool Is32() const override { return false; }
+};
+
+constexpr IrOpcode::Value int32_cmp_opcodes[] = {
+    IrOpcode::kWord32Equal, IrOpcode::kInt32LessThan,
+    IrOpcode::kInt32LessThanOrEqual, IrOpcode::kUint32LessThan,
+    IrOpcode::kUint32LessThanOrEqual};
+constexpr IrOpcode::Value int32_bin_opcodes[] = {
+    IrOpcode::kInt32Add,  IrOpcode::kInt32Sub, IrOpcode::kInt32Mul,
+    IrOpcode::kWord32And, IrOpcode::kWord32Or, IrOpcode::kWord32Xor,
+};
+
+TEST(Word32SelectCombineInt32CompareZero) {
+  RawMachineAssemblerTester<int32_t> features(MachineType::Uint32());
+  if (!features.machine()->Word32Select().IsSupported()) {
+    return;
+  }
+
+  for (auto config : graph_configs) {
+    for (auto cmp : int32_cmp_opcodes) {
+      for (auto bin : int32_bin_opcodes) {
+        BufferedRawMachineAssemblerTester<uint32_t> m(
+            MachineType::Uint32(), MachineType::Uint32(), MachineType::Int32(),
+            MachineType::Int32());
+        UInt32ConditionalSelectGen<uint32_t> gen(m, config, cmp, bin);
+        Node* lhs = m.Parameter(0);
+        Node* rhs = m.Parameter(1);
+        Node* tval = m.Parameter(2);
+        Node* fval = m.Parameter(3);
+        gen.BuildGraph(m.machine()->Word32Select().op(), lhs, rhs, tval, fval);
+
+        FOR_UINT32_INPUTS(a) {
+          FOR_UINT32_INPUTS(b) {
+            uint32_t expected = gen.expected(a, b, 2, 1);
+            uint32_t actual = m.Call(a, b, 2, 1);
+            CHECK_EQ(expected, actual);
+          }
+        }
+      }
+    }
+  }
+}
+
+TEST(Word64SelectCombineInt32CompareZero) {
+  RawMachineAssemblerTester<int32_t> features(MachineType::Int32());
+  if (!features.machine()->Word64Select().IsSupported()) {
+    return;
+  }
+
+  for (auto config : graph_configs) {
+    for (auto cmp : int32_cmp_opcodes) {
+      for (auto bin : int32_bin_opcodes) {
+        BufferedRawMachineAssemblerTester<uint64_t> m(
+            MachineType::Uint32(), MachineType::Uint32(), MachineType::Uint64(),
+            MachineType::Uint64());
+        UInt32ConditionalSelectGen<uint64_t> gen(m, config, cmp, bin);
+        Node* lhs = m.Parameter(0);
+        Node* rhs = m.Parameter(1);
+        Node* tval = m.Parameter(2);
+        Node* fval = m.Parameter(3);
+        gen.BuildGraph(m.machine()->Word64Select().op(), lhs, rhs, tval, fval);
+
+        FOR_UINT32_INPUTS(a) {
+          FOR_UINT32_INPUTS(b) {
+            uint64_t c = 2;
+            uint64_t d = 1;
+            uint64_t expected = gen.expected(a, b, c, d);
+            uint64_t actual = m.Call(a, b, c, d);
+            CHECK_EQ(expected, actual);
+          }
+        }
+      }
+    }
+  }
+}
+
+TEST(Float32SelectCombineInt32CompareZero) {
+  RawMachineAssemblerTester<uint32_t> features(MachineType::Uint32());
+  if (!features.machine()->Float32Select().IsSupported()) {
+    return;
+  }
+
+  for (auto config : graph_configs) {
+    for (auto cmp : int32_cmp_opcodes) {
+      for (auto bin : int32_bin_opcodes) {
+        BufferedRawMachineAssemblerTester<float> m(
+            MachineType::Uint32(), MachineType::Uint32(),
+            MachineType::Float32(), MachineType::Float32());
+        UInt32ConditionalSelectGen<float> gen(m, config, cmp, bin);
+        Node* lhs = m.Parameter(0);
+        Node* rhs = m.Parameter(1);
+        Node* tval = m.Parameter(2);
+        Node* fval = m.Parameter(3);
+        gen.BuildGraph(m.machine()->Float32Select().op(), lhs, rhs, tval, fval);
+
+        FOR_UINT32_INPUTS(a) {
+          FOR_UINT32_INPUTS(b) {
+            float expected = gen.expected(a, b, 2.0f, 1.0f);
+            float actual = m.Call(a, b, 2.0f, 1.0f);
+            CHECK_FLOAT_EQ(expected, actual);
+          }
+        }
+      }
+    }
+  }
+}
+
+TEST(Float64SelectCombineInt32CompareZero) {
+  RawMachineAssemblerTester<uint32_t> features(MachineType::Uint32());
+  if (!features.machine()->Float64Select().IsSupported()) {
+    return;
+  }
+
+  for (auto config : graph_configs) {
+    for (auto cmp : int32_cmp_opcodes) {
+      for (auto bin : int32_bin_opcodes) {
+        BufferedRawMachineAssemblerTester<double> m(
+            MachineType::Uint32(), MachineType::Uint32(),
+            MachineType::Float64(), MachineType::Float64());
+        UInt32ConditionalSelectGen<double> gen(m, config, cmp, bin);
+        Node* lhs = m.Parameter(0);
+        Node* rhs = m.Parameter(1);
+        Node* tval = m.Parameter(2);
+        Node* fval = m.Parameter(3);
+        gen.BuildGraph(m.machine()->Float64Select().op(), lhs, rhs, tval, fval);
+
+        FOR_UINT32_INPUTS(a) {
+          FOR_UINT32_INPUTS(b) {
+            double expected = gen.expected(a, b, 2.0, 1.0);
+            double actual = m.Call(a, b, 2.0, 1.0);
+            CHECK_DOUBLE_EQ(expected, actual);
+          }
+        }
+      }
+    }
+  }
+}
+
+constexpr IrOpcode::Value int64_bin_opcodes[] = {
+    IrOpcode::kInt64Add,  IrOpcode::kInt64Sub, IrOpcode::kInt64Mul,
+    IrOpcode::kWord64And, IrOpcode::kWord64Or, IrOpcode::kWord64Xor,
+};
+constexpr IrOpcode::Value int64_cmp_opcodes[] = {
+    IrOpcode::kWord64Equal, IrOpcode::kInt64LessThan,
+    IrOpcode::kInt64LessThanOrEqual, IrOpcode::kUint64LessThan,
+    IrOpcode::kUint64LessThanOrEqual};
+
+TEST(Word32SelectCombineInt64CompareZero) {
+  RawMachineAssemblerTester<int32_t> features(MachineType::Int32());
+  if (!features.machine()->Word32Select().IsSupported()) {
+    return;
+  }
+
+  for (auto config : graph_configs) {
+    for (auto cmp : int64_cmp_opcodes) {
+      for (auto bin : int64_bin_opcodes) {
+        BufferedRawMachineAssemblerTester<uint32_t> m(
+            MachineType::Uint64(), MachineType::Uint64(), MachineType::Int32(),
+            MachineType::Int32());
+        UInt64ConditionalSelectGen<uint32_t> gen(m, config, cmp, bin);
+        Node* lhs = m.Parameter(0);
+        Node* rhs = m.Parameter(1);
+        Node* tval = m.Parameter(2);
+        Node* fval = m.Parameter(3);
+        gen.BuildGraph(m.machine()->Word32Select().op(), lhs, rhs, tval, fval);
+
+        FOR_UINT64_INPUTS(a) {
+          FOR_UINT64_INPUTS(b) {
+            uint32_t expected = gen.expected(a, b, 2, 1);
+            uint32_t actual = m.Call(a, b, 2, 1);
+            CHECK_EQ(expected, actual);
+          }
+        }
+      }
+    }
+  }
+}
+
+TEST(Word64SelectCombineInt64CompareZero) {
+  RawMachineAssemblerTester<uint32_t> features(MachineType::Uint32());
+  if (!features.machine()->Word64Select().IsSupported()) {
+    return;
+  }
+
+  for (auto config : graph_configs) {
+    for (auto cmp : int64_cmp_opcodes) {
+      for (auto bin : int64_bin_opcodes) {
+        BufferedRawMachineAssemblerTester<uint64_t> m(
+            MachineType::Uint64(), MachineType::Uint64(), MachineType::Uint64(),
+            MachineType::Uint64());
+        UInt64ConditionalSelectGen<uint64_t> gen(m, config, cmp, bin);
+        Node* lhs = m.Parameter(0);
+        Node* rhs = m.Parameter(1);
+        Node* tval = m.Parameter(2);
+        Node* fval = m.Parameter(3);
+        gen.BuildGraph(m.machine()->Word64Select().op(), lhs, rhs, tval, fval);
+
+        FOR_UINT64_INPUTS(a) {
+          FOR_UINT64_INPUTS(b) {
+            uint64_t c = 2;
+            uint64_t d = 1;
+            uint64_t expected = gen.expected(a, b, c, d);
+            uint64_t actual = m.Call(a, b, c, d);
+            CHECK_EQ(expected, actual);
+          }
+        }
+      }
+    }
+  }
+}
+
+TEST(Float32SelectCombineInt64CompareZero) {
+  RawMachineAssemblerTester<uint32_t> features(MachineType::Uint32());
+  if (!features.machine()->Float32Select().IsSupported()) {
+    return;
+  }
+
+  for (auto config : graph_configs) {
+    for (auto cmp : int64_cmp_opcodes) {
+      for (auto bin : int64_bin_opcodes) {
+        BufferedRawMachineAssemblerTester<float> m(
+            MachineType::Uint64(), MachineType::Uint64(),
+            MachineType::Float32(), MachineType::Float32());
+        UInt64ConditionalSelectGen<float> gen(m, config, cmp, bin);
+        Node* lhs = m.Parameter(0);
+        Node* rhs = m.Parameter(1);
+        Node* tval = m.Parameter(2);
+        Node* fval = m.Parameter(3);
+        gen.BuildGraph(m.machine()->Float32Select().op(), lhs, rhs, tval, fval);
+
+        FOR_UINT64_INPUTS(a) {
+          FOR_UINT64_INPUTS(b) {
+            float expected = gen.expected(a, b, 2.0f, 1.0f);
+            float actual = m.Call(a, b, 2.0f, 1.0f);
+            CHECK_FLOAT_EQ(expected, actual);
+          }
+        }
+      }
+    }
+  }
+}
+
+TEST(Float64SelectCombineInt64CompareZero) {
+  RawMachineAssemblerTester<uint32_t> features(MachineType::Uint32());
+  if (!features.machine()->Float64Select().IsSupported()) {
+    return;
+  }
+
+  for (auto config : graph_configs) {
+    for (auto cmp : int64_cmp_opcodes) {
+      for (auto bin : int64_bin_opcodes) {
+        BufferedRawMachineAssemblerTester<double> m(
+            MachineType::Uint64(), MachineType::Uint64(),
+            MachineType::Float64(), MachineType::Float64());
+        UInt64ConditionalSelectGen<double> gen(m, config, cmp, bin);
+        Node* lhs = m.Parameter(0);
+        Node* rhs = m.Parameter(1);
+        Node* tval = m.Parameter(2);
+        Node* fval = m.Parameter(3);
+        gen.BuildGraph(m.machine()->Float64Select().op(), lhs, rhs, tval, fval);
+
+        FOR_UINT64_INPUTS(a) {
+          FOR_UINT64_INPUTS(b) {
+            double expected = gen.expected(a, b, 2.0, 1.0);
+            double actual = m.Call(a, b, 2.0, 1.0);
+            CHECK_DOUBLE_EQ(expected, actual);
+          }
+        }
+      }
+    }
+  }
+}
+
+}  // end namespace
+
+}  // namespace v8::internal::compiler
diff --git a/deps/v8/test/cctest/compiler/test-verify-type.cc b/deps/v8/test/cctest/compiler/test-verify-type.cc
index ffc69d5514083c..22821463e15214 100644
--- a/deps/v8/test/cctest/compiler/test-verify-type.cc
+++ b/deps/v8/test/cctest/compiler/test-verify-type.cc
@@ -52,6 +52,8 @@ TEST(TestVerifyType) {
           CHECK(asserted_type.Equals(Type::Range(-8, 42, zone)));
           simplified_lowering_happened = true;
           return NodeObserver::Observation::kStop;
+        } else if (old_state.opcode() == node->opcode()) {
+          return NodeObserver::Observation::kContinue;
         } else {
           // Every other lowering would be wrong, so fail the test.
           UNREACHABLE();
diff --git a/deps/v8/test/cctest/heap/heap-tester.h b/deps/v8/test/cctest/heap/heap-tester.h
index 89075df06b8b55..927def37f73a98 100644
--- a/deps/v8/test/cctest/heap/heap-tester.h
+++ b/deps/v8/test/cctest/heap/heap-tester.h
@@ -81,10 +81,6 @@
 
 namespace v8 {
 namespace internal {
-
-template <typename T>
-class Handle;
-
 namespace heap {
 
 class HeapTester {
diff --git a/deps/v8/test/cctest/heap/heap-utils.cc b/deps/v8/test/cctest/heap/heap-utils.cc
index 53f2100c9d5b20..06023378e6a436 100644
--- a/deps/v8/test/cctest/heap/heap-utils.cc
+++ b/deps/v8/test/cctest/heap/heap-utils.cc
@@ -12,10 +12,12 @@
 #include "src/heap/free-list.h"
 #include "src/heap/gc-tracer-inl.h"
 #include "src/heap/heap-inl.h"
+#include "src/heap/heap.h"
 #include "src/heap/incremental-marking.h"
 #include "src/heap/mark-compact.h"
 #include "src/heap/marking-barrier.h"
 #include "src/heap/memory-chunk.h"
+#include "src/heap/page-inl.h"
 #include "src/heap/safepoint.h"
 #include "src/heap/spaces.h"
 #include "src/objects/free-space-inl.h"
@@ -25,19 +27,13 @@ namespace v8 {
 namespace internal {
 namespace heap {
 
-void InvokeScavenge(Isolate* isolate) {
-  CcTest::CollectGarbage(i::NEW_SPACE, isolate);
-}
-
-void InvokeMarkSweep(Isolate* isolate) { CcTest::CollectAllGarbage(isolate); }
-
 void SealCurrentObjects(Heap* heap) {
   // If you see this check failing, disable the flag at the start of your test:
   // v8_flags.stress_concurrent_allocation = false;
   // Background thread allocating concurrently interferes with this function.
   CHECK(!v8_flags.stress_concurrent_allocation);
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
+  heap::InvokeMajorGC(heap);
   heap->EnsureSweepingCompleted(Heap::SweepingForcedFinalizationMode::kV8Only);
   heap->old_space()->FreeLinearAllocationArea();
   for (Page* page : *heap->old_space()) {
@@ -149,7 +145,7 @@ void FillPageInPagedSpace(Page* page,
   CollectionEpoch full_epoch =
       heap->tracer()->CurrentEpoch(GCTracer::Scope::ScopeId::MARK_COMPACTOR);
   CollectionEpoch young_epoch = heap->tracer()->CurrentEpoch(
-      GCTracer::Scope::ScopeId::MINOR_MARK_COMPACTOR);
+      GCTracer::Scope::ScopeId::MINOR_MARK_SWEEPER);
 
   for (Page* p : *paged_space) {
     if (p != page) paged_space->UnlinkFreeListCategories(p);
@@ -165,12 +161,13 @@ void FillPageInPagedSpace(Page* page,
   // Collect all free list block sizes
   page->ForAllFreeListCategories(
       [&available_sizes](FreeListCategory* category) {
-        category->IterateNodesForTesting([&available_sizes](FreeSpace node) {
-          int node_size = node.Size();
-          if (node_size >= kMaxRegularHeapObjectSize) {
-            available_sizes.push_back(node_size);
-          }
-        });
+        category->IterateNodesForTesting(
+            [&available_sizes](Tagged<FreeSpace> node) {
+              int node_size = node->Size();
+              if (node_size >= kMaxRegularHeapObjectSize) {
+                available_sizes.push_back(node_size);
+              }
+            });
       });
 
   Isolate* isolate = heap->isolate();
@@ -198,11 +195,12 @@ void FillPageInPagedSpace(Page* page,
         remaining_sizes.push_back({});
         std::vector<int>& sizes_in_category =
             remaining_sizes[remaining_sizes.size() - 1];
-        category->IterateNodesForTesting([&sizes_in_category](FreeSpace node) {
-          int node_size = node.Size();
-          DCHECK_LT(0, FixedArrayLenFromSize(node_size));
-          sizes_in_category.push_back(node_size);
-        });
+        category->IterateNodesForTesting(
+            [&sizes_in_category](Tagged<FreeSpace> node) {
+              int node_size = node->Size();
+              DCHECK_LT(0, FixedArrayLenFromSize(node_size));
+              sizes_in_category.push_back(node_size);
+            });
       });
   for (auto it = remaining_sizes.rbegin(); it != remaining_sizes.rend(); ++it) {
     std::vector<int> sizes_in_category = *it;
@@ -227,13 +225,13 @@ void FillPageInPagedSpace(Page* page,
   CHECK_EQ(full_epoch, heap->tracer()->CurrentEpoch(
                            GCTracer::Scope::ScopeId::MARK_COMPACTOR));
   CHECK_EQ(young_epoch, heap->tracer()->CurrentEpoch(
-                            GCTracer::Scope::ScopeId::MINOR_MARK_COMPACTOR));
+                            GCTracer::Scope::ScopeId::MINOR_MARK_SWEEPER));
 }
 }  // namespace
 
 void FillCurrentPage(v8::internal::NewSpace* space,
                      std::vector<Handle<FixedArray>>* out_handles) {
-  if (v8_flags.minor_mc) {
+  if (v8_flags.minor_ms) {
     PauseAllocationObserversScope pause_observers(space->heap());
     if (space->top() == kNullAddress) return;
     Page* page = Page::FromAllocationAreaAddress(space->top());
@@ -278,7 +276,7 @@ void FillCurrentPageButNBytes(v8::internal::NewSpace* space, int extra_bytes,
 }
 
 void SimulateIncrementalMarking(i::Heap* heap, bool force_completion) {
-  const double kStepSizeInMs = 100;
+  static constexpr auto kStepSize = v8::base::TimeDelta::FromMilliseconds(100);
   CHECK(v8_flags.incremental_marking);
   i::IncrementalMarking* marking = heap->incremental_marking();
 
@@ -292,11 +290,12 @@ void SimulateIncrementalMarking(i::Heap* heap, bool force_completion) {
     // If minor incremental marking is running, we need to finalize it first
     // because of the AdvanceForTesting call in this function which is currently
     // only possible for MajorMC.
-    heap->CollectGarbage(NEW_SPACE, GarbageCollectionReason::kFinalizeMinorMC);
+    heap->CollectGarbage(NEW_SPACE,
+                         GarbageCollectionReason::kFinalizeConcurrentMinorMS);
   }
 
   if (marking->IsStopped()) {
-    heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+    heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                   i::GarbageCollectionReason::kTesting);
   }
   CHECK(marking->IsMarking());
@@ -307,16 +306,19 @@ void SimulateIncrementalMarking(i::Heap* heap, bool force_completion) {
   marking->MarkRootsForTesting();
 
   while (!marking->IsMajorMarkingComplete()) {
-    marking->AdvanceForTesting(kStepSizeInMs);
+    marking->AdvanceForTesting(kStepSize);
   }
 }
 
 void SimulateFullSpace(v8::internal::PagedSpace* space) {
+  Heap* heap = space->heap();
+  IsolateSafepointScope safepoint_scope(heap);
+  heap->FreeLinearAllocationAreas();
+
   // If you see this check failing, disable the flag at the start of your test:
   // v8_flags.stress_concurrent_allocation = false;
   // Background thread allocating concurrently interferes with this function.
   CHECK(!v8_flags.stress_concurrent_allocation);
-  CodePageCollectionMemoryModificationScopeForTesting code_scope(space->heap());
   if (space->heap()->sweeping_in_progress()) {
     space->heap()->EnsureSweepingCompleted(
         Heap::SweepingForcedFinalizationMode::kV8Only);
@@ -326,21 +328,56 @@ void SimulateFullSpace(v8::internal::PagedSpace* space) {
 }
 
 void AbandonCurrentlyFreeMemory(PagedSpace* space) {
+  Heap* heap = space->heap();
+  IsolateSafepointScope safepoint_scope(heap);
+  heap->FreeLinearAllocationAreas();
+
   space->FreeLinearAllocationArea();
   for (Page* page : *space) {
     page->MarkNeverAllocateForTesting();
   }
 }
 
-void GcAndSweep(Heap* heap, AllocationSpace space) {
-  heap->CollectGarbage(space, GarbageCollectionReason::kTesting);
+void InvokeMajorGC(Heap* heap) {
+  heap->CollectGarbage(OLD_SPACE, GarbageCollectionReason::kTesting);
+}
+
+void InvokeMajorGC(Heap* heap, GCFlag gc_flag) {
+  heap->CollectAllGarbage(gc_flag, GarbageCollectionReason::kTesting);
+}
+
+void InvokeMinorGC(Heap* heap) {
+  heap->CollectGarbage(NEW_SPACE, GarbageCollectionReason::kTesting);
+}
+
+void InvokeAtomicMajorGC(Heap* heap) {
+  heap->PreciseCollectAllGarbage(GCFlag::kNoFlags,
+                                 GarbageCollectionReason::kTesting);
   if (heap->sweeping_in_progress()) {
-    IsolateSafepointScope scope(heap);
     heap->EnsureSweepingCompleted(
-        Heap::SweepingForcedFinalizationMode::kV8Only);
+        Heap::SweepingForcedFinalizationMode::kUnifiedHeap);
   }
 }
 
+void InvokeAtomicMinorGC(Heap* heap) {
+  InvokeMinorGC(heap);
+  if (heap->sweeping_in_progress()) {
+    heap->EnsureSweepingCompleted(
+        Heap::SweepingForcedFinalizationMode::kUnifiedHeap);
+  }
+}
+
+void InvokeMemoryReducingMajorGCs(Heap* heap) {
+  heap->CollectAllAvailableGarbage(GarbageCollectionReason::kTesting);
+}
+
+void CollectSharedGarbage(Heap* heap) {
+  heap->CollectGarbageShared(heap->main_thread_local_heap(),
+                             GarbageCollectionReason::kTesting);
+}
+
+void EmptyNewSpaceUsingGC(Heap* heap) { InvokeMajorGC(heap); }
+
 void ForceEvacuationCandidate(Page* page) {
   CHECK(v8_flags.manual_evacuation_candidates_selection);
   page->SetFlag(MemoryChunk::FORCE_EVACUATION_CANDIDATE_FOR_TESTING);
@@ -357,27 +394,85 @@ void ForceEvacuationCandidate(Page* page) {
   }
 }
 
-bool InCorrectGeneration(HeapObject object) {
+bool InCorrectGeneration(Tagged<HeapObject> object) {
   return v8_flags.single_generation ? !i::Heap::InYoungGeneration(object)
                                     : i::Heap::InYoungGeneration(object);
 }
 
 void GrowNewSpace(Heap* heap) {
   IsolateSafepointScope scope(heap);
-  if (!heap->new_space()->IsAtMaximumCapacity()) {
-    heap->new_space()->Grow();
+  NewSpace* new_space = heap->new_space();
+  if (new_space->TotalCapacity() < new_space->MaximumCapacity()) {
+    new_space->Grow();
   }
-  CHECK(heap->new_space()->EnsureCurrentCapacity());
+  CHECK(new_space->EnsureCurrentCapacity());
 }
 
 void GrowNewSpaceToMaximumCapacity(Heap* heap) {
   IsolateSafepointScope scope(heap);
-  while (!heap->new_space()->IsAtMaximumCapacity()) {
-    heap->new_space()->Grow();
+  NewSpace* new_space = heap->new_space();
+  while (new_space->TotalCapacity() < new_space->MaximumCapacity()) {
+    new_space->Grow();
   }
-  CHECK(heap->new_space()->EnsureCurrentCapacity());
+  CHECK(new_space->EnsureCurrentCapacity());
 }
 
 }  // namespace heap
+
+ManualGCScope::ManualGCScope(Isolate* isolate)
+    : isolate_(isolate),
+      flag_concurrent_marking_(v8_flags.concurrent_marking),
+      flag_concurrent_sweeping_(v8_flags.concurrent_sweeping),
+      flag_concurrent_minor_ms_marking_(v8_flags.concurrent_minor_ms_marking),
+      flag_stress_concurrent_allocation_(v8_flags.stress_concurrent_allocation),
+      flag_stress_incremental_marking_(v8_flags.stress_incremental_marking),
+      flag_parallel_marking_(v8_flags.parallel_marking),
+      flag_detect_ineffective_gcs_near_heap_limit_(
+          v8_flags.detect_ineffective_gcs_near_heap_limit),
+      flag_cppheap_concurrent_marking_(v8_flags.cppheap_concurrent_marking) {
+  // Some tests run threaded (back-to-back) and thus the GC may already be
+  // running by the time a ManualGCScope is created. Finalizing existing marking
+  // prevents any undefined/unexpected behavior.
+  if (isolate) {
+    auto* heap = isolate->heap();
+    if (heap->incremental_marking()->IsMarking()) {
+      heap::InvokeAtomicMajorGC(heap);
+    }
+  }
+
+  v8_flags.concurrent_marking = false;
+  v8_flags.concurrent_sweeping = false;
+  v8_flags.concurrent_minor_ms_marking = false;
+  v8_flags.stress_incremental_marking = false;
+  v8_flags.stress_concurrent_allocation = false;
+  // Parallel marking has a dependency on concurrent marking.
+  v8_flags.parallel_marking = false;
+  v8_flags.detect_ineffective_gcs_near_heap_limit = false;
+  // CppHeap concurrent marking has a dependency on concurrent marking.
+  v8_flags.cppheap_concurrent_marking = false;
+
+  if (isolate_ && isolate_->heap()->cpp_heap()) {
+    CppHeap::From(isolate_->heap()->cpp_heap())
+        ->UpdateGCCapabilitiesFromFlagsForTesting();
+  }
+}
+
+ManualGCScope::~ManualGCScope() {
+  v8_flags.concurrent_marking = flag_concurrent_marking_;
+  v8_flags.concurrent_sweeping = flag_concurrent_sweeping_;
+  v8_flags.concurrent_minor_ms_marking = flag_concurrent_minor_ms_marking_;
+  v8_flags.stress_concurrent_allocation = flag_stress_concurrent_allocation_;
+  v8_flags.stress_incremental_marking = flag_stress_incremental_marking_;
+  v8_flags.parallel_marking = flag_parallel_marking_;
+  v8_flags.detect_ineffective_gcs_near_heap_limit =
+      flag_detect_ineffective_gcs_near_heap_limit_;
+  v8_flags.cppheap_concurrent_marking = flag_cppheap_concurrent_marking_;
+
+  if (isolate_ && isolate_->heap()->cpp_heap()) {
+    CppHeap::From(isolate_->heap()->cpp_heap())
+        ->UpdateGCCapabilitiesFromFlagsForTesting();
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/cctest/heap/heap-utils.h b/deps/v8/test/cctest/heap/heap-utils.h
index abaa10c7ca7368..97682735041a29 100644
--- a/deps/v8/test/cctest/heap/heap-utils.h
+++ b/deps/v8/test/cctest/heap/heap-utils.h
@@ -6,9 +6,13 @@
 #define HEAP_HEAP_UTILS_H_
 
 #include "src/api/api-inl.h"
+#include "src/flags/flags.h"
 #include "src/heap/heap.h"
+#include "test/cctest/cctest.h"
 
-namespace v8::internal::heap {
+namespace v8::internal {
+
+namespace heap {
 
 void SealCurrentObjects(Heap* heap);
 
@@ -40,13 +44,17 @@ void SimulateFullSpace(v8::internal::PagedSpace* space);
 
 void AbandonCurrentlyFreeMemory(PagedSpace* space);
 
-void GcAndSweep(Heap* heap, AllocationSpace space);
-
-void ForceEvacuationCandidate(Page* page);
+void InvokeMajorGC(Heap* heap);
+void InvokeMajorGC(Heap* heap, GCFlag gc_flag);
+void InvokeMinorGC(Heap* heap);
+void InvokeAtomicMajorGC(Heap* heap);
+void InvokeAtomicMinorGC(Heap* heap);
+void InvokeMemoryReducingMajorGCs(Heap* heap);
+void CollectSharedGarbage(Heap* heap);
 
-void InvokeScavenge(Isolate* isolate = nullptr);
+void EmptyNewSpaceUsingGC(Heap* heap);
 
-void InvokeMarkSweep(Isolate* isolate = nullptr);
+void ForceEvacuationCandidate(Page* page);
 
 void GrowNewSpace(Heap* heap);
 
@@ -59,7 +67,7 @@ bool InYoungGeneration(v8::Isolate* isolate, const GlobalOrPersistent& global) {
   return i::Heap::InYoungGeneration(*v8::Utils::OpenHandle(*tmp));
 }
 
-bool InCorrectGeneration(HeapObject object);
+bool InCorrectGeneration(Tagged<HeapObject> object);
 
 template <typename GlobalOrPersistent>
 bool InCorrectGeneration(v8::Isolate* isolate,
@@ -69,6 +77,48 @@ bool InCorrectGeneration(v8::Isolate* isolate,
   return InCorrectGeneration(*v8::Utils::OpenHandle(*tmp));
 }
 
-}  // namespace v8::internal::heap
+class ManualEvacuationCandidatesSelectionScope {
+ public:
+  // Marking a page as an evacuation candidate update the page flags which may
+  // race with reading the page flag during concurrent marking.
+  explicit ManualEvacuationCandidatesSelectionScope(ManualGCScope&) {
+    DCHECK(!v8_flags.manual_evacuation_candidates_selection);
+    v8_flags.manual_evacuation_candidates_selection = true;
+  }
+  ~ManualEvacuationCandidatesSelectionScope() {
+    DCHECK(v8_flags.manual_evacuation_candidates_selection);
+    v8_flags.manual_evacuation_candidates_selection = false;
+  }
+
+ private:
+};
+
+}  // namespace heap
+
+// ManualGCScope allows for disabling GC heuristics. This is useful for tests
+// that want to check specific corner cases around GC.
+//
+// The scope will finalize any ongoing GC on the provided Isolate. If no Isolate
+// is manually provided, it is assumed that a CcTest setup (e.g.
+// CcTest::InitializeVM()) is used.
+class V8_NODISCARD ManualGCScope final {
+ public:
+  explicit ManualGCScope(
+      Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate_));
+  ~ManualGCScope();
+
+ private:
+  Isolate* const isolate_;
+  const bool flag_concurrent_marking_;
+  const bool flag_concurrent_sweeping_;
+  const bool flag_concurrent_minor_ms_marking_;
+  const bool flag_stress_concurrent_allocation_;
+  const bool flag_stress_incremental_marking_;
+  const bool flag_parallel_marking_;
+  const bool flag_detect_ineffective_gcs_near_heap_limit_;
+  const bool flag_cppheap_concurrent_marking_;
+};
+
+}  // namespace v8::internal
 
 #endif  // HEAP_HEAP_UTILS_H_
diff --git a/deps/v8/test/cctest/heap/test-alloc.cc b/deps/v8/test/cctest/heap/test-alloc.cc
index 4b4f2a6594f10e..d69a1e5197ce9b 100644
--- a/deps/v8/test/cctest/heap/test-alloc.cc
+++ b/deps/v8/test/cctest/heap/test-alloc.cc
@@ -45,12 +45,12 @@ Handle<Object> HeapTester::TestAllocateAfterFailures() {
   // Similar to what the factory's retrying logic does in the last-resort case,
   // we wrap the allocator function in an AlwaysAllocateScope.  Test that
   // all allocations succeed immediately without any retry.
-  CcTest::CollectAllAvailableGarbage();
   Heap* heap = CcTest::heap();
+  heap::InvokeMemoryReducingMajorGCs(heap);
   AlwaysAllocateScopeForTesting scope(heap);
   int size = FixedArray::SizeFor(100);
   // Young generation.
-  HeapObject obj =
+  Tagged<HeapObject> obj =
       heap->AllocateRaw(size, AllocationType::kYoung).ToObjectChecked();
   // In order to pass heap verification on Isolate teardown, mark the
   // allocated area as a filler.
@@ -84,8 +84,7 @@ Handle<Object> HeapTester::TestAllocateAfterFailures() {
 
   // Code space.
   heap::SimulateFullSpace(heap->code_space());
-  CodePageCollectionMemoryModificationScopeForTesting code_scope(heap);
-  size = CcTest::i_isolate()->builtins()->code(Builtin::kIllegal).Size();
+  size = CcTest::i_isolate()->builtins()->code(Builtin::kIllegal)->Size();
   obj =
       heap->AllocateRaw(size, AllocationType::kCode, AllocationOrigin::kRuntime)
           .ToObjectChecked();
@@ -101,7 +100,7 @@ HEAP_TEST(StressHandles) {
   v8::Local<v8::Context> env = v8::Context::New(CcTest::isolate());
   env->Enter();
   Handle<Object> o = TestAllocateAfterFailures();
-  CHECK(o->IsTrue(CcTest::i_isolate()));
+  CHECK(IsTrue(*o, CcTest::i_isolate()));
   env->Exit();
 }
 
@@ -143,7 +142,7 @@ TEST(StressJS) {
   info->set_language_mode(LanguageMode::kStrict);
   Handle<JSFunction> function =
       Factory::JSFunctionBuilder{isolate, info, context}.Build();
-  CHECK(!function->shared().construct_as_builtin());
+  CHECK(!function->shared()->construct_as_builtin());
 
   // Force the creation of an initial map.
   factory->NewJSObject(function);
diff --git a/deps/v8/test/cctest/heap/test-array-buffer-tracker.cc b/deps/v8/test/cctest/heap/test-array-buffer-tracker.cc
index a6facdd101d03a..4932b6e57583ab 100644
--- a/deps/v8/test/cctest/heap/test-array-buffer-tracker.cc
+++ b/deps/v8/test/cctest/heap/test-array-buffer-tracker.cc
@@ -5,6 +5,7 @@
 #include "src/api/api-inl.h"
 #include "src/common/globals.h"
 #include "src/execution/isolate.h"
+#include "src/flags/flags.h"
 #include "src/heap/array-buffer-sweeper.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/spaces.h"
@@ -36,8 +37,8 @@ bool IsTracked(i::Heap* heap, i::ArrayBufferExtension* extension) {
   return in_young || in_old;
 }
 
-bool IsTracked(i::Heap* heap, i::JSArrayBuffer buffer) {
-  return IsTracked(heap, buffer.extension());
+bool IsTracked(i::Heap* heap, i::Tagged<i::JSArrayBuffer> buffer) {
+  return IsTracked(heap, buffer->extension());
 }
 
 }  // namespace
@@ -68,12 +69,12 @@ TEST(ArrayBuffer_OnlyMC) {
     extension = buf->extension();
     CHECK(v8_flags.single_generation ? IsTrackedOld(heap, extension)
                                      : IsTrackedYoung(heap, extension));
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
     CHECK(IsTrackedOld(heap, extension));
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
     CHECK(IsTrackedOld(heap, extension));
   }
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
   CHECK(!IsTracked(heap, extension));
 }
 
@@ -96,12 +97,12 @@ TEST(ArrayBuffer_OnlyScavenge) {
     Handle<JSArrayBuffer> buf = v8::Utils::OpenHandle(*ab);
     extension = buf->extension();
     CHECK(IsTrackedYoung(heap, extension));
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeAtomicMinorGC(heap);
     CHECK(IsTrackedYoung(heap, extension));
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
     CHECK(IsTrackedOld(heap, extension));
   }
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
   CHECK(!IsTracked(heap, extension));
 }
 
@@ -124,23 +125,24 @@ TEST(ArrayBuffer_ScavengeAndMC) {
     Handle<JSArrayBuffer> buf = v8::Utils::OpenHandle(*ab);
     extension = buf->extension();
     CHECK(IsTrackedYoung(heap, extension));
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeAtomicMinorGC(heap);
     CHECK(IsTrackedYoung(heap, extension));
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
     CHECK(IsTrackedOld(heap, extension));
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeAtomicMinorGC(heap);
     CHECK(IsTrackedOld(heap, extension));
   }
-  heap::GcAndSweep(heap, NEW_SPACE);
+  heap::InvokeAtomicMinorGC(heap);
   CHECK(IsTrackedOld(heap, extension));
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
   CHECK(!IsTracked(heap, extension));
 }
 
 TEST(ArrayBuffer_Compaction) {
   if (!v8_flags.compact) return;
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   v8_flags.concurrent_array_buffer_sweeping = false;
   CcTest::InitializeVM();
   LocalContext env;
@@ -152,13 +154,15 @@ TEST(ArrayBuffer_Compaction) {
   Local<v8::ArrayBuffer> ab1 = v8::ArrayBuffer::New(isolate, 100);
   Handle<JSArrayBuffer> buf1 = v8::Utils::OpenHandle(*ab1);
   CHECK(IsTracked(heap, *buf1));
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
 
   Page* page_before_gc = Page::FromHeapObject(*buf1);
   heap::ForceEvacuationCandidate(page_before_gc);
   CHECK(IsTracked(heap, *buf1));
 
-  CcTest::CollectAllGarbage();
+  // We need to invoke GC without stack, otherwise no compaction is performed.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+  heap::InvokeMajorGC(heap);
 
   Page* page_after_gc = Page::FromHeapObject(*buf1);
   CHECK(IsTracked(heap, *buf1));
@@ -198,14 +202,14 @@ TEST(ArrayBuffer_UnregisterDuringSweep) {
       Local<v8::ArrayBuffer> ab2 = v8::ArrayBuffer::New(isolate, 100);
       Handle<JSArrayBuffer> buf2 = v8::Utils::OpenHandle(*ab2);
       CHECK(IsTracked(heap, *buf));
-      heap::GcAndSweep(heap, NEW_SPACE);
+      heap::InvokeAtomicMinorGC(heap);
       CHECK(IsTracked(heap, *buf));
-      heap::GcAndSweep(heap, NEW_SPACE);
+      heap::InvokeAtomicMinorGC(heap);
       CHECK(IsTracked(heap, *buf));
       CHECK(IsTracked(heap, *buf2));
     }
 
-    CcTest::CollectGarbage(OLD_SPACE);
+    heap::InvokeMajorGC(heap);
     // |Detach| will cause the buffer to be |Unregister|ed. Without
     // barriers and proper synchronization this will trigger a data race on
     // TSAN.
@@ -238,15 +242,15 @@ TEST(ArrayBuffer_NonLivePromotion) {
     }
     heap::SimulateIncrementalMarking(heap, false);
     CHECK(IsTracked(heap, JSArrayBuffer::cast(root->get(0))));
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeAtomicMinorGC(heap);
     CHECK(IsTracked(heap, JSArrayBuffer::cast(root->get(0))));
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeAtomicMinorGC(heap);
     CHECK(IsTracked(heap, JSArrayBuffer::cast(root->get(0))));
     ArrayBufferExtension* extension =
-        JSArrayBuffer::cast(root->get(0)).extension();
+        JSArrayBuffer::cast(root->get(0))->extension();
     root->set(0, ReadOnlyRoots(heap).undefined_value());
     heap::SimulateIncrementalMarking(heap, true);
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
     CHECK(!IsTracked(heap, extension));
   }
 }
@@ -262,7 +266,7 @@ TEST(ArrayBuffer_LivePromotion) {
   v8::Isolate* isolate = env->GetIsolate();
   Heap* heap = reinterpret_cast<Isolate*>(isolate)->heap();
 
-  JSArrayBuffer raw_ab;
+  Tagged<JSArrayBuffer> raw_ab;
   {
     v8::HandleScope handle_scope(isolate);
     Handle<FixedArray> root =
@@ -279,21 +283,23 @@ TEST(ArrayBuffer_LivePromotion) {
                                   Utils::ToLocal(Handle<Object>::cast(root)));
     heap::SimulateIncrementalMarking(heap, true);
     CHECK(IsTracked(heap, JSArrayBuffer::cast(root->get(0))));
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeMinorGC(heap);
     CHECK(IsTracked(heap, JSArrayBuffer::cast(root->get(0))));
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeMinorGC(heap);
     CHECK(IsTracked(heap, JSArrayBuffer::cast(root->get(0))));
     raw_ab = JSArrayBuffer::cast(root->get(0));
     root->set(0, ReadOnlyRoots(heap).undefined_value());
     // Prohibit page from being released.
     Page::FromHeapObject(raw_ab)->MarkNeverEvacuate();
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeMajorGC(heap);
+    CHECK(!heap->array_buffer_sweeper()->sweeping_in_progress());
     CHECK(IsTracked(heap, raw_ab));
   }
 }
 
 TEST(ArrayBuffer_SemiSpaceCopyThenPagePromotion) {
   if (!i::v8_flags.incremental_marking) return;
+  if (v8_flags.minor_ms) return;
   v8_flags.concurrent_array_buffer_sweeping = false;
   ManualGCScope manual_gc_scope;
   // The test verifies that the marking state is preserved across semispace
@@ -321,9 +327,9 @@ TEST(ArrayBuffer_SemiSpaceCopyThenPagePromotion) {
     // processing during newspace evacuation.
     heap::FillCurrentPage(heap->new_space(), &handles);
     CHECK(IsTracked(heap, JSArrayBuffer::cast(root->get(0))));
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeAtomicMinorGC(heap);
     heap::SimulateIncrementalMarking(heap, true);
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
     CHECK(IsTracked(heap, JSArrayBuffer::cast(root->get(0))));
   }
 }
@@ -358,7 +364,7 @@ TEST(ArrayBuffer_PagePromotion) {
     heap::FillCurrentPage(heap->new_space(), &handles);
     CHECK(IsTrackedYoung(heap, extension));
     heap::SimulateIncrementalMarking(heap, true);
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
     CHECK(IsTrackedOld(heap, extension));
   }
 }
@@ -381,8 +387,8 @@ UNINITIALIZED_TEST(ArrayBuffer_SemiSpaceCopyMultipleTasks) {
     Heap* heap = i_isolate->heap();
 
     // Ensure heap is in a clean state.
-    CcTest::CollectAllGarbage(i_isolate);
-    CcTest::CollectAllGarbage(i_isolate);
+    heap::InvokeMajorGC(heap);
+    heap::InvokeMajorGC(heap);
 
     Local<v8::ArrayBuffer> ab1 = v8::ArrayBuffer::New(isolate, 100);
     Handle<JSArrayBuffer> buf1 = v8::Utils::OpenHandle(*ab1);
@@ -390,7 +396,7 @@ UNINITIALIZED_TEST(ArrayBuffer_SemiSpaceCopyMultipleTasks) {
     Local<v8::ArrayBuffer> ab2 = v8::ArrayBuffer::New(isolate, 100);
     Handle<JSArrayBuffer> buf2 = v8::Utils::OpenHandle(*ab2);
     CHECK_NE(Page::FromHeapObject(*buf1), Page::FromHeapObject(*buf2));
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
   }
   isolate->Dispose();
 }
@@ -434,7 +440,7 @@ TEST(ArrayBuffer_ExternalBackingStoreSizeDecreases) {
     Local<v8::ArrayBuffer> ab = v8::ArrayBuffer::New(isolate, kArraybufferSize);
     USE(ab);
   }
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
   const size_t backing_store_after =
       heap->new_space()->ExternalBackingStoreBytes(type);
   CHECK_EQ(0, backing_store_after - backing_store_before);
@@ -443,7 +449,8 @@ TEST(ArrayBuffer_ExternalBackingStoreSizeDecreases) {
 TEST(ArrayBuffer_ExternalBackingStoreSizeIncreasesMarkCompact) {
   if (!v8_flags.compact) return;
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   v8_flags.concurrent_array_buffer_sweeping = false;
   CcTest::InitializeVM();
   LocalContext env;
@@ -452,6 +459,9 @@ TEST(ArrayBuffer_ExternalBackingStoreSizeIncreasesMarkCompact) {
   heap::AbandonCurrentlyFreeMemory(heap->old_space());
   ExternalBackingStoreType type = ExternalBackingStoreType::kArrayBuffer;
 
+  // We need to invoke GC without stack, otherwise some objects may survive.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+
   const size_t backing_store_before =
       heap->old_space()->ExternalBackingStoreBytes(type);
 
@@ -462,20 +472,20 @@ TEST(ArrayBuffer_ExternalBackingStoreSizeIncreasesMarkCompact) {
         v8::ArrayBuffer::New(isolate, kArraybufferSize);
     Handle<JSArrayBuffer> buf1 = v8::Utils::OpenHandle(*ab1);
     CHECK(IsTracked(heap, *buf1));
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
 
     Page* page_before_gc = Page::FromHeapObject(*buf1);
     heap::ForceEvacuationCandidate(page_before_gc);
     CHECK(IsTracked(heap, *buf1));
 
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
 
     const size_t backing_store_after =
         heap->old_space()->ExternalBackingStoreBytes(type);
     CHECK_EQ(kArraybufferSize, backing_store_after - backing_store_before);
   }
 
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
   const size_t backing_store_after =
       heap->old_space()->ExternalBackingStoreBytes(type);
   CHECK_EQ(0, backing_store_after - backing_store_before);
diff --git a/deps/v8/test/cctest/heap/test-compaction.cc b/deps/v8/test/cctest/heap/test-compaction.cc
index a0bdbe9f716f05..69ed1790af1f2d 100644
--- a/deps/v8/test/cctest/heap/test-compaction.cc
+++ b/deps/v8/test/cctest/heap/test-compaction.cc
@@ -25,7 +25,7 @@ void CheckInvariantsOfAbortedPage(Page* page) {
   // 1) Markbits are cleared
   // 2) The page is not marked as evacuation candidate anymore
   // 3) The page is not marked as aborted compaction anymore.
-  CHECK(page->heap()->non_atomic_marking_state()->bitmap(page)->IsClean());
+  CHECK(page->marking_bitmap()->IsClean());
   CHECK(!page->IsEvacuationCandidate());
   CHECK(!page->IsFlagSet(Page::COMPACTION_WAS_ABORTED));
 }
@@ -40,14 +40,15 @@ void CheckAllObjectsOnPage(const std::vector<Handle<FixedArray>>& handles,
 }  // namespace
 
 HEAP_TEST(CompactionFullAbortedPage) {
-  if (!v8_flags.compact || v8_flags.crash_on_aborted_evacuation) return;
+  if (!v8_flags.compact) return;
   // Test the scenario where we reach OOM during compaction and the whole page
   // is aborted.
 
   // Disable concurrent sweeping to ensure memory is in an expected state, i.e.,
   // we can reach the state of a half aborted page.
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
@@ -63,7 +64,8 @@ HEAP_TEST(CompactionFullAbortedPage) {
 
     {
       HandleScope scope2(isolate);
-      CHECK(heap->old_space()->TryExpandImpl());
+      CHECK(heap->old_space()->TryExpandImpl(
+          MemoryAllocator::AllocationMode::kRegular));
       auto compaction_page_handles = heap::CreatePadding(
           heap,
           static_cast<int>(MemoryChunkLayout::AllocatableMemoryInDataPage()),
@@ -75,7 +77,7 @@ HEAP_TEST(CompactionFullAbortedPage) {
       CheckAllObjectsOnPage(compaction_page_handles, to_be_aborted_page);
 
       heap->set_force_oom(true);
-      CcTest::CollectAllGarbage();
+      heap::InvokeMajorGC(heap);
       heap->EnsureSweepingCompleted(
           Heap::SweepingForcedFinalizationMode::kV8Only);
 
@@ -104,14 +106,15 @@ int GetObjectSize(int objects_per_page) {
 }  // namespace
 
 HEAP_TEST(CompactionPartiallyAbortedPage) {
-  if (!v8_flags.compact || v8_flags.crash_on_aborted_evacuation) return;
+  if (!v8_flags.compact) return;
   // Test the scenario where we reach OOM during compaction and parts of the
   // page have already been migrated to a new one.
 
   // Disable concurrent sweeping to ensure memory is in an expected state, i.e.,
   // we can reach the state of a half aborted page.
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   const int objects_per_page = 10;
   const int object_size = GetObjectSize(objects_per_page);
@@ -133,7 +136,8 @@ HEAP_TEST(CompactionPartiallyAbortedPage) {
       HandleScope scope2(isolate);
       // Fill another page with objects of size {object_size} (last one is
       // properly adjusted).
-      CHECK(heap->old_space()->TryExpandImpl());
+      CHECK(heap->old_space()->TryExpandImpl(
+          MemoryAllocator::AllocationMode::kRegular));
       auto compaction_page_handles = heap::CreatePadding(
           heap,
           static_cast<int>(MemoryChunkLayout::AllocatableMemoryInDataPage()),
@@ -148,7 +152,8 @@ HEAP_TEST(CompactionPartiallyAbortedPage) {
         // Add another page that is filled with {num_objects} objects of size
         // {object_size}.
         HandleScope scope3(isolate);
-        CHECK(heap->old_space()->TryExpandImpl());
+        CHECK(heap->old_space()->TryExpandImpl(
+            MemoryAllocator::AllocationMode::kRegular));
         const int num_objects = 3;
         std::vector<Handle<FixedArray>> page_to_fill_handles =
             heap::CreatePadding(heap, object_size * num_objects,
@@ -157,7 +162,7 @@ HEAP_TEST(CompactionPartiallyAbortedPage) {
             Page::FromAddress(page_to_fill_handles.front()->address());
 
         heap->set_force_oom(true);
-        CcTest::CollectAllGarbage();
+        heap::InvokeMajorGC(heap);
         heap->EnsureSweepingCompleted(
             Heap::SweepingForcedFinalizationMode::kV8Only);
 
@@ -184,94 +189,8 @@ HEAP_TEST(CompactionPartiallyAbortedPage) {
   heap->RemoveNearHeapLimitCallback(reset_oom, 0u);
 }
 
-HEAP_TEST(CompactionPartiallyAbortedPageWithInvalidatedSlots) {
-  if (!v8_flags.compact || v8_flags.crash_on_aborted_evacuation) return;
-  // Test evacuating a page partially when it contains recorded
-  // slots and invalidated objects.
-
-  // Disable concurrent sweeping to ensure memory is in an expected state, i.e.,
-  // we can reach the state of a half aborted page.
-  ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
-
-  const int objects_per_page = 10;
-  const int object_size = GetObjectSize(objects_per_page);
-
-  CcTest::InitializeVM();
-  Isolate* isolate = CcTest::i_isolate();
-  Heap* heap = isolate->heap();
-  auto reset_oom = [](void* heap, size_t limit, size_t) -> size_t {
-    reinterpret_cast<Heap*>(heap)->set_force_oom(false);
-    return limit;
-  };
-  heap->AddNearHeapLimitCallback(reset_oom, heap);
-
-  {
-    HandleScope scope1(isolate);
-
-    heap::SealCurrentObjects(heap);
-
-    {
-      HandleScope scope2(isolate);
-      // Fill another page with objects of size {object_size} (last one is
-      // properly adjusted).
-      CHECK(heap->old_space()->TryExpandImpl());
-      auto compaction_page_handles = heap::CreatePadding(
-          heap,
-          static_cast<int>(MemoryChunkLayout::AllocatableMemoryInDataPage()),
-          AllocationType::kOld, object_size);
-      Page* to_be_aborted_page =
-          Page::FromHeapObject(*compaction_page_handles.front());
-      for (Handle<FixedArray> object : compaction_page_handles) {
-        CHECK_EQ(Page::FromHeapObject(*object), to_be_aborted_page);
-
-        for (int i = 0; i < object->length(); i++) {
-          RememberedSet<OLD_TO_NEW>::Insert<AccessMode::ATOMIC>(
-              to_be_aborted_page, object->RawFieldOfElementAt(i).address());
-        }
-      }
-      // First object is going to be evacuated.
-      HeapObject front_object = *compaction_page_handles.front();
-      to_be_aborted_page->RegisterObjectWithInvalidatedSlots<OLD_TO_NEW>(
-          front_object, front_object.Size());
-      // Last object is NOT going to be evacuated.
-      // This happens since not all objects fit on the only other page in the
-      // old space, the GC isn't allowed to allocate another page.
-      HeapObject back_object = *compaction_page_handles.back();
-      to_be_aborted_page->RegisterObjectWithInvalidatedSlots<OLD_TO_NEW>(
-          back_object, back_object.Size());
-      to_be_aborted_page->SetFlag(
-          MemoryChunk::FORCE_EVACUATION_CANDIDATE_FOR_TESTING);
-
-      {
-        // Add another page that is filled with {num_objects} objects of size
-        // {object_size}.
-        HandleScope scope3(isolate);
-        CHECK(heap->old_space()->TryExpandImpl());
-        const int num_objects = 3;
-        std::vector<Handle<FixedArray>> page_to_fill_handles =
-            heap::CreatePadding(heap, object_size * num_objects,
-                                AllocationType::kOld, object_size);
-        Page* page_to_fill =
-            Page::FromAddress(page_to_fill_handles.front()->address());
-
-        heap->set_force_oom(true);
-        CcTest::CollectAllGarbage();
-        heap->EnsureSweepingCompleted(
-            Heap::SweepingForcedFinalizationMode::kV8Only);
-
-        CHECK_EQ(Page::FromHeapObject(*compaction_page_handles.front()),
-                 page_to_fill);
-        CHECK_EQ(Page::FromHeapObject(*compaction_page_handles.back()),
-                 to_be_aborted_page);
-      }
-    }
-  }
-  heap->RemoveNearHeapLimitCallback(reset_oom, 0u);
-}
-
 HEAP_TEST(CompactionPartiallyAbortedPageIntraAbortedPointers) {
-  if (!v8_flags.compact || v8_flags.crash_on_aborted_evacuation) return;
+  if (!v8_flags.compact) return;
   // Test the scenario where we reach OOM during compaction and parts of the
   // page have already been migrated to a new one. Objects on the aborted page
   // are linked together. This test makes sure that intra-aborted page pointers
@@ -280,7 +199,8 @@ HEAP_TEST(CompactionPartiallyAbortedPageIntraAbortedPointers) {
   // Disable concurrent sweeping to ensure memory is in an expected state, i.e.,
   // we can reach the state of a half aborted page.
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   const int objects_per_page = 10;
   const int object_size = GetObjectSize(objects_per_page);
@@ -305,7 +225,8 @@ HEAP_TEST(CompactionPartiallyAbortedPageIntraAbortedPointers) {
       HandleScope temporary_scope(isolate);
       // Fill a fresh page with objects of size {object_size} (last one is
       // properly adjusted).
-      CHECK(heap->old_space()->TryExpandImpl());
+      CHECK(heap->old_space()->TryExpandImpl(
+          MemoryAllocator::AllocationMode::kRegular));
       std::vector<Handle<FixedArray>> compaction_page_handles =
           heap::CreatePadding(
               heap,
@@ -326,7 +247,8 @@ HEAP_TEST(CompactionPartiallyAbortedPageIntraAbortedPointers) {
       // Add another page that is filled with {num_objects} objects of size
       // {object_size}.
       HandleScope scope3(isolate);
-      CHECK(heap->old_space()->TryExpandImpl());
+      CHECK(heap->old_space()->TryExpandImpl(
+          MemoryAllocator::AllocationMode::kRegular));
       const int num_objects = 2;
       int used_memory = object_size * num_objects;
       std::vector<Handle<FixedArray>> page_to_fill_handles =
@@ -334,8 +256,12 @@ HEAP_TEST(CompactionPartiallyAbortedPageIntraAbortedPointers) {
                               object_size);
       Page* page_to_fill = Page::FromHeapObject(*page_to_fill_handles.front());
 
+      // We need to invoke GC without stack, otherwise no compaction is
+      // performed.
+      DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+
       heap->set_force_oom(true);
-      CcTest::CollectAllGarbage();
+      heap::InvokeMajorGC(heap);
       heap->EnsureSweepingCompleted(
           Heap::SweepingForcedFinalizationMode::kV8Only);
 
@@ -346,7 +272,7 @@ HEAP_TEST(CompactionPartiallyAbortedPageIntraAbortedPointers) {
       while (current->get(0) != ReadOnlyRoots(heap).undefined_value()) {
         current =
             Handle<FixedArray>(FixedArray::cast(current->get(0)), isolate);
-        CHECK(current->IsFixedArray());
+        CHECK(IsFixedArray(*current));
         if (Page::FromHeapObject(*current) != to_be_aborted_page) {
           in_place = false;
         }
@@ -377,7 +303,8 @@ HEAP_TEST(CompactionPartiallyAbortedPageWithRememberedSetEntries) {
   // Disable concurrent sweeping to ensure memory is in an expected state, i.e.,
   // we can reach the state of a half aborted page.
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   const int objects_per_page = 10;
   const int object_size = GetObjectSize(objects_per_page);
@@ -401,7 +328,8 @@ HEAP_TEST(CompactionPartiallyAbortedPageWithRememberedSetEntries) {
       HandleScope temporary_scope(isolate);
       // Fill another page with objects of size {object_size} (last one is
       // properly adjusted).
-      CHECK(heap->old_space()->TryExpandImpl());
+      CHECK(heap->old_space()->TryExpandImpl(
+          MemoryAllocator::AllocationMode::kRegular));
       auto compaction_page_handles = heap::CreatePadding(
           heap,
           static_cast<int>(MemoryChunkLayout::AllocatableMemoryInDataPage()),
@@ -428,7 +356,8 @@ HEAP_TEST(CompactionPartiallyAbortedPageWithRememberedSetEntries) {
       // Add another page that is filled with {num_objects} objects of size
       // {object_size}.
       HandleScope scope3(isolate);
-      CHECK(heap->old_space()->TryExpandImpl());
+      CHECK(heap->old_space()->TryExpandImpl(
+          MemoryAllocator::AllocationMode::kRegular));
       const int num_objects = 2;
       int used_memory = object_size * num_objects;
       std::vector<Handle<FixedArray>> page_to_fill_handles =
@@ -436,8 +365,12 @@ HEAP_TEST(CompactionPartiallyAbortedPageWithRememberedSetEntries) {
                               object_size);
       Page* page_to_fill = Page::FromHeapObject(*page_to_fill_handles.front());
 
+      // We need to invoke GC without stack, otherwise no compaction is
+      // performed.
+      DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+
       heap->set_force_oom(true);
-      CcTest::CollectAllGarbage();
+      heap::InvokeMajorGC(heap);
       heap->EnsureSweepingCompleted(
           Heap::SweepingForcedFinalizationMode::kV8Only);
 
@@ -449,7 +382,7 @@ HEAP_TEST(CompactionPartiallyAbortedPageWithRememberedSetEntries) {
         current =
             Handle<FixedArray>(FixedArray::cast(current->get(0)), isolate);
         CHECK(!Heap::InYoungGeneration(*current));
-        CHECK(current->IsFixedArray());
+        CHECK(IsFixedArray(*current));
         if (Page::FromHeapObject(*current) != to_be_aborted_page) {
           in_place = false;
         }
@@ -489,7 +422,7 @@ HEAP_TEST(CompactionPartiallyAbortedPageWithRememberedSetEntries) {
       // If remembered set entries are not properly filtered/reset for aborted
       // pages we have now a broken address at an object slot in old space and
       // the following scavenge will crash.
-      CcTest::CollectGarbage(NEW_SPACE);
+      heap::InvokeMinorGC(CcTest::heap());
     }
   }
   heap->RemoveNearHeapLimitCallback(reset_oom, 0u);
diff --git a/deps/v8/test/cctest/heap/test-concurrent-allocation.cc b/deps/v8/test/cctest/heap/test-concurrent-allocation.cc
index 846d2bf6dc0393..c46814e15ca465 100644
--- a/deps/v8/test/cctest/heap/test-concurrent-allocation.cc
+++ b/deps/v8/test/cctest/heap/test-concurrent-allocation.cc
@@ -12,7 +12,9 @@
 #include "src/codegen/assembler.h"
 #include "src/codegen/macro-assembler-inl.h"
 #include "src/codegen/macro-assembler.h"
+#include "src/codegen/reloc-info-inl.h"
 #include "src/common/globals.h"
+#include "src/handles/global-handles-inl.h"
 #include "src/handles/handles-inl.h"
 #include "src/handles/handles.h"
 #include "src/handles/local-handles-inl.h"
@@ -33,13 +35,13 @@ namespace internal {
 
 namespace {
 void CreateFixedArray(Heap* heap, Address start, int size) {
-  HeapObject object = HeapObject::FromAddress(start);
-  object.set_map_after_allocation(ReadOnlyRoots(heap).fixed_array_map(),
-                                  SKIP_WRITE_BARRIER);
-  FixedArray array = FixedArray::cast(object);
+  Tagged<HeapObject> object = HeapObject::FromAddress(start);
+  object->set_map_after_allocation(ReadOnlyRoots(heap).fixed_array_map(),
+                                   SKIP_WRITE_BARRIER);
+  Tagged<FixedArray> array = FixedArray::cast(object);
   int length = (size - FixedArray::kHeaderSize) / kTaggedSize;
-  array.set_length(length);
-  MemsetTagged(array.data_start(), ReadOnlyRoots(heap).undefined_value(),
+  array->set_length(length);
+  MemsetTagged(array->data_start(), ReadOnlyRoots(heap).undefined_value(),
                length);
 }
 
@@ -49,14 +51,20 @@ const int kMediumObjectSize = 8 * KB;
 
 void AllocateSomeObjects(LocalHeap* local_heap) {
   for (int i = 0; i < kNumIterations; i++) {
-    Address address = local_heap->AllocateRawOrFail(
+    AllocationResult result = local_heap->AllocateRaw(
         kSmallObjectSize, AllocationType::kOld, AllocationOrigin::kRuntime,
         AllocationAlignment::kTaggedAligned);
-    CreateFixedArray(local_heap->heap(), address, kSmallObjectSize);
-    address = local_heap->AllocateRawOrFail(
-        kMediumObjectSize, AllocationType::kOld, AllocationOrigin::kRuntime,
-        AllocationAlignment::kTaggedAligned);
-    CreateFixedArray(local_heap->heap(), address, kMediumObjectSize);
+    if (!result.IsFailure()) {
+      CreateFixedArray(local_heap->heap(), result.ToAddress(),
+                       kSmallObjectSize);
+    }
+    result = local_heap->AllocateRaw(kMediumObjectSize, AllocationType::kOld,
+                                     AllocationOrigin::kRuntime,
+                                     AllocationAlignment::kTaggedAligned);
+    if (!result.IsFailure()) {
+      CreateFixedArray(local_heap->heap(), result.ToAddress(),
+                       kMediumObjectSize);
+    }
     if (i % 10 == 0) {
       local_heap->Safepoint();
     }
@@ -73,7 +81,6 @@ class ConcurrentAllocationThread final : public v8::base::Thread {
         pending_(pending) {}
 
   void Run() override {
-    RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
     LocalHeap local_heap(heap_, ThreadKind::kBackground);
     UnparkedScope unparked_scope(&local_heap);
     AllocateSomeObjects(&local_heap);
@@ -387,7 +394,7 @@ UNINITIALIZED_TEST(ConcurrentBlackAllocation) {
   CHECK(thread->Start());
 
   sema_white.Wait();
-  heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+  heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                 i::GarbageCollectionReason::kTesting);
   sema_marking_started.Signal();
 
@@ -397,7 +404,7 @@ UNINITIALIZED_TEST(ConcurrentBlackAllocation) {
 
   for (int i = 0; i < kNumIterations * kObjectsAllocatedPerIteration; i++) {
     Address address = objects[i];
-    HeapObject object = HeapObject::FromAddress(address);
+    Tagged<HeapObject> object = HeapObject::FromAddress(address);
 
     if (i < kWhiteIterations * kObjectsAllocatedPerIteration) {
       CHECK(heap->marking_state()->IsUnmarked(object));
@@ -411,8 +418,8 @@ UNINITIALIZED_TEST(ConcurrentBlackAllocation) {
 
 class ConcurrentWriteBarrierThread final : public v8::base::Thread {
  public:
-  explicit ConcurrentWriteBarrierThread(Heap* heap, FixedArray fixed_array,
-                                        HeapObject value)
+  ConcurrentWriteBarrierThread(Heap* heap, Tagged<FixedArray> fixed_array,
+                               Tagged<HeapObject> value)
       : v8::base::Thread(base::Thread::Options("ThreadWithLocalHeap")),
         heap_(heap),
         fixed_array_(fixed_array),
@@ -421,7 +428,7 @@ class ConcurrentWriteBarrierThread final : public v8::base::Thread {
   void Run() override {
     LocalHeap local_heap(heap_, ThreadKind::kBackground);
     UnparkedScope unparked_scope(&local_heap);
-    fixed_array_.set(0, value_);
+    fixed_array_->set(0, value_);
   }
 
   Heap* heap_;
@@ -443,8 +450,8 @@ UNINITIALIZED_TEST(ConcurrentWriteBarrier) {
   Isolate* i_isolate = reinterpret_cast<Isolate*>(isolate);
   Heap* heap = i_isolate->heap();
 
-  FixedArray fixed_array;
-  HeapObject value;
+  Tagged<FixedArray> fixed_array;
+  Tagged<HeapObject> value;
   {
     HandleScope handle_scope(i_isolate);
     Handle<FixedArray> fixed_array_handle(
@@ -454,41 +461,46 @@ UNINITIALIZED_TEST(ConcurrentWriteBarrier) {
     fixed_array = *fixed_array_handle;
     value = *value_handle;
   }
-  heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+  heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                 i::GarbageCollectionReason::kTesting);
   CHECK(heap->marking_state()->IsUnmarked(value));
 
+  // Mark host |fixed_array| to trigger the barrier.
+  heap->marking_state()->TryMarkAndAccountLiveBytes(fixed_array);
+
   auto thread =
       std::make_unique<ConcurrentWriteBarrierThread>(heap, fixed_array, value);
   CHECK(thread->Start());
 
   thread->Join();
 
-  CHECK(heap->marking_state()->IsBlackOrGrey(value));
-  heap::InvokeMarkSweep(i_isolate);
+  CHECK(heap->marking_state()->IsMarked(value));
+  heap::InvokeMajorGC(heap);
 
   isolate->Dispose();
 }
 
 class ConcurrentRecordRelocSlotThread final : public v8::base::Thread {
  public:
-  explicit ConcurrentRecordRelocSlotThread(Heap* heap, Code code,
-                                           HeapObject value)
+  ConcurrentRecordRelocSlotThread(Heap* heap, Tagged<Code> code,
+                                  Tagged<HeapObject> value)
       : v8::base::Thread(base::Thread::Options("ThreadWithLocalHeap")),
         heap_(heap),
         code_(code),
         value_(value) {}
 
   void Run() override {
-    RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
     LocalHeap local_heap(heap_, ThreadKind::kBackground);
     UnparkedScope unparked_scope(&local_heap);
     // Modification of InstructionStream object requires write access.
     RwxMemoryWriteScopeForTesting rwx_write_scope;
+    DisallowGarbageCollection no_gc;
+    Tagged<InstructionStream> istream = code_->instruction_stream();
     int mode_mask = RelocInfo::EmbeddedObjectModeMask();
+    CodePageMemoryModificationScope memory_modification_scope(istream);
     for (RelocIterator it(code_, mode_mask); !it.done(); it.next()) {
       DCHECK(RelocInfo::IsEmbeddedObjectMode(it.rinfo()->rmode()));
-      it.rinfo()->set_target_object(heap_, value_);
+      it.rinfo()->set_target_object(istream, value_);
     }
   }
 
@@ -503,8 +515,9 @@ UNINITIALIZED_TEST(ConcurrentRecordRelocSlot) {
     // The test requires concurrent marking barrier.
     return;
   }
-  v8_flags.manual_evacuation_candidates_selection = true;
   ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   v8::Isolate::CreateParams create_params;
   create_params.array_buffer_allocator = CcTest::array_buffer_allocator();
@@ -512,12 +525,11 @@ UNINITIALIZED_TEST(ConcurrentRecordRelocSlot) {
   Isolate* i_isolate = reinterpret_cast<Isolate*>(isolate);
   Heap* heap = i_isolate->heap();
   {
-    Code code;
-    HeapObject value;
-    CodePageCollectionMemoryModificationScopeForTesting code_scope(heap);
+    Tagged<Code> code;
+    Tagged<HeapObject> value;
     {
       HandleScope handle_scope(i_isolate);
-      i::byte buffer[i::Assembler::kDefaultBufferSize];
+      uint8_t buffer[i::Assembler::kDefaultBufferSize];
       MacroAssembler masm(i_isolate, v8::internal::CodeObjectRequired::kYes,
                           ExternalAssemblerBuffer(buffer, sizeof(buffer)));
 #if V8_TARGET_ARCH_ARM64
@@ -533,6 +545,8 @@ UNINITIALIZED_TEST(ConcurrentRecordRelocSlot) {
       masm.GetCode(i_isolate, &desc);
       Handle<Code> code_handle =
           Factory::CodeBuilder(i_isolate, desc, CodeKind::FOR_TESTING).Build();
+      // Globalize the handle for |code| for the incremental marker to mark it.
+      i_isolate->global_handles()->Create(*code_handle.location());
       heap::AbandonCurrentlyFreeMemory(heap->old_space());
       Handle<HeapNumber> value_handle(
           i_isolate->factory()->NewHeapNumber<AllocationType::kOld>(1.1));
@@ -540,15 +554,17 @@ UNINITIALIZED_TEST(ConcurrentRecordRelocSlot) {
       code = *code_handle;
       value = *value_handle;
     }
-    heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+    heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                   i::GarbageCollectionReason::kTesting);
     CHECK(heap->marking_state()->IsUnmarked(value));
 
+    // Advance marking to make sure |code| is marked.
+    heap->incremental_marking()->AdvanceForTesting(v8::base::TimeDelta::Max());
+
+    CHECK(heap->marking_state()->IsMarked(code));
+    CHECK(heap->marking_state()->IsUnmarked(value));
+
     {
-      // TODO(v8:13023): remove ResetPKUPermissionsForThreadSpawning in the
-      // future when RwxMemoryWriteScope::SetDefaultPermissionsForNewThread() is
-      // stable.
-      ResetPKUPermissionsForThreadSpawning thread_scope;
       auto thread =
           std::make_unique<ConcurrentRecordRelocSlotThread>(heap, code, value);
       CHECK(thread->Start());
@@ -556,8 +572,8 @@ UNINITIALIZED_TEST(ConcurrentRecordRelocSlot) {
       thread->Join();
     }
 
-    CHECK(heap->marking_state()->IsBlackOrGrey(value));
-    heap::InvokeMarkSweep(i_isolate);
+    CHECK(heap->marking_state()->IsMarked(value));
+    heap::InvokeMajorGC(heap);
   }
   isolate->Dispose();
 }
diff --git a/deps/v8/test/cctest/heap/test-concurrent-marking.cc b/deps/v8/test/cctest/heap/test-concurrent-marking.cc
index 280ecb11aa1ffa..dba45324372a2a 100644
--- a/deps/v8/test/cctest/heap/test-concurrent-marking.cc
+++ b/deps/v8/test/cctest/heap/test-concurrent-marking.cc
@@ -19,7 +19,7 @@ TEST(ConcurrentMarkingMarkedBytes) {
   Heap* heap = CcTest::heap();
   HandleScope sc(isolate);
   Handle<FixedArray> root = isolate->factory()->NewFixedArray(1000000);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   if (!heap->incremental_marking()->IsStopped()) return;
 
   // Store array in Global such that it is part of the root set when
@@ -28,6 +28,9 @@ TEST(ConcurrentMarkingMarkedBytes) {
                                 Utils::ToLocal(Handle<Object>::cast(root)));
 
   heap::SimulateIncrementalMarking(heap, false);
+  // Ensure that objects are published to the global marking worklist such that
+  // the concurrent markers can pick it up.
+  heap->mark_compact_collector()->local_marking_worklists()->Publish();
   heap->concurrent_marking()->Join();
   CHECK_GE(heap->concurrent_marking()->TotalMarkedBytes(), root->Size());
 }
diff --git a/deps/v8/test/cctest/heap/test-external-string-tracker.cc b/deps/v8/test/cctest/heap/test-external-string-tracker.cc
index d9b240a94588cb..2f180b327c3c6c 100644
--- a/deps/v8/test/cctest/heap/test-external-string-tracker.cc
+++ b/deps/v8/test/cctest/heap/test-external-string-tracker.cc
@@ -87,7 +87,7 @@ TEST(ExternalString_ExternalBackingStoreSizeDecreases) {
     USE(es);
   }
 
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
 
   const size_t backing_store_after =
       heap->old_space()->ExternalBackingStoreBytes(type);
@@ -98,7 +98,8 @@ TEST(ExternalString_ExternalBackingStoreSizeDecreases) {
 TEST(ExternalString_ExternalBackingStoreSizeIncreasesMarkCompact) {
   if (!v8_flags.compact) return;
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   CcTest::InitializeVM();
   LocalContext env;
   v8::Isolate* isolate = env->GetIsolate();
@@ -120,14 +121,14 @@ TEST(ExternalString_ExternalBackingStoreSizeIncreasesMarkCompact) {
     Page* page_before_gc = Page::FromHeapObject(*esh);
     heap::ForceEvacuationCandidate(page_before_gc);
 
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
 
     const size_t backing_store_after =
         heap->old_space()->ExternalBackingStoreBytes(type);
     CHECK_EQ(es->Length(), backing_store_after - backing_store_before);
   }
 
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
   const size_t backing_store_after =
       heap->old_space()->ExternalBackingStoreBytes(type);
   CHECK_EQ(0, backing_store_after - backing_store_before);
@@ -161,7 +162,7 @@ TEST(ExternalString_ExternalBackingStoreSizeIncreasesAfterExternalization) {
                     new_backing_store_before);
 
     // Trigger full GC so that the newly allocated string moves to old gen.
-    heap::GcAndSweep(heap, OLD_SPACE);
+    heap::InvokeAtomicMajorGC(heap);
 
     bool success =
         str->MakeExternal(new TestOneByteResource(i::StrDup(TEST_STR)));
@@ -171,7 +172,7 @@ TEST(ExternalString_ExternalBackingStoreSizeIncreasesAfterExternalization) {
                                 old_backing_store_before);
   }
 
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
   const size_t backing_store_after =
       heap->old_space()->ExternalBackingStoreBytes(type);
   CHECK_EQ(0, backing_store_after - old_backing_store_before);
@@ -199,31 +200,15 @@ TEST(ExternalString_PromotedThinString) {
 
     // Internalize external string.
     i::Handle<i::String> isymbol1 = factory->InternalizeString(string1);
-    CHECK(isymbol1->IsInternalizedString());
-    CHECK(string1->IsExternalString());
+    CHECK(IsInternalizedString(*isymbol1));
+    CHECK(IsExternalString(*string1));
     CHECK(!heap->InYoungGeneration(*isymbol1));
 
-    // New external string in the young space. This string has the same content
-    // as the previous one (that was already internalized).
-    v8::Local<v8::String> string2 =
-        v8::String::NewFromUtf8Literal(isolate, TEST_STR);
-    bool success =
-        string2->MakeExternal(new TestOneByteResource(i::StrDup(TEST_STR)));
-    CHECK(success);
-
-    // Internalize (it will create a thin string in the new space).
-    i::Handle<i::String> istring = v8::Utils::OpenHandle(*string2);
-    i::Handle<i::String> isymbol2 = factory->InternalizeString(istring);
-    CHECK(isymbol2->IsInternalizedString());
-    CHECK(istring->IsThinString());
-    CHECK(heap->InYoungGeneration(*istring));
-
     // Collect thin string. References to the thin string will be updated to
     // point to the actual external string in the old space.
-    heap::GcAndSweep(heap, NEW_SPACE);
+    heap::InvokeAtomicMinorGC(heap);
 
     USE(isymbol1);
-    USE(isymbol2);
   }
 }
 }  // namespace heap
diff --git a/deps/v8/test/cctest/heap/test-heap.cc b/deps/v8/test/cctest/heap/test-heap.cc
index ad00fc13d6bfb6..bcf0106da2c1a7 100644
--- a/deps/v8/test/cctest/heap/test-heap.cc
+++ b/deps/v8/test/cctest/heap/test-heap.cc
@@ -48,8 +48,10 @@
 #include "src/heap/gc-tracer.h"
 #include "src/heap/heap-inl.h"
 #include "src/heap/heap-verifier.h"
+#include "src/heap/heap.h"
 #include "src/heap/incremental-marking.h"
 #include "src/heap/large-spaces.h"
+#include "src/heap/mark-compact-inl.h"
 #include "src/heap/mark-compact.h"
 #include "src/heap/marking-barrier.h"
 #include "src/heap/marking-state-inl.h"
@@ -86,14 +88,14 @@ namespace heap {
 
 // We only start allocation-site tracking with the second instantiation.
 static const int kPretenureCreationCount =
-    AllocationSite::kPretenureMinimumCreated + 1;
+    PretenuringHandler::GetMinMementoCountForTesting() + 1;
 
 static void CheckMap(Map map, int type, int instance_size) {
-  CHECK(map.IsHeapObject());
+  CHECK(IsHeapObject(map));
   DCHECK(IsValidHeapObject(CcTest::heap(), map));
-  CHECK_EQ(ReadOnlyRoots(CcTest::heap()).meta_map(), map.map());
-  CHECK_EQ(type, map.instance_type());
-  CHECK_EQ(instance_size, map.instance_size());
+  CHECK_EQ(ReadOnlyRoots(CcTest::heap()).meta_map(), map->map());
+  CHECK_EQ(type, map->instance_type());
+  CHECK_EQ(instance_size, map->instance_size());
 }
 
 
@@ -104,7 +106,8 @@ TEST(HeapMaps) {
   CheckMap(roots.heap_number_map(), HEAP_NUMBER_TYPE, HeapNumber::kSize);
   CheckMap(roots.fixed_array_map(), FIXED_ARRAY_TYPE, kVariableSizeSentinel);
   CheckMap(roots.hash_table_map(), HASH_TABLE_TYPE, kVariableSizeSentinel);
-  CheckMap(roots.string_map(), STRING_TYPE, kVariableSizeSentinel);
+  CheckMap(roots.seq_two_byte_string_map(), SEQ_TWO_BYTE_STRING_TYPE,
+           kVariableSizeSentinel);
 }
 
 static void VerifyStoredPrototypeMap(Isolate* isolate,
@@ -117,7 +120,7 @@ static void VerifyStoredPrototypeMap(Isolate* isolate,
 
   Handle<JSFunction> fun(
       JSFunction::cast(context->get(stored_ctor_context_index)), isolate);
-  Handle<JSObject> proto(JSObject::cast(fun->initial_map().prototype()),
+  Handle<JSObject> proto(JSObject::cast(fun->initial_map()->prototype()),
                          isolate);
   Handle<Map> that_map(proto->map(), isolate);
 
@@ -164,25 +167,26 @@ TEST(InitialObjects) {
 }
 
 static void CheckOddball(Isolate* isolate, Object obj, const char* string) {
-  CHECK(obj.IsOddball());
+  CHECK(IsOddball(obj));
   Handle<Object> handle(obj, isolate);
   Object print_string = *Object::ToString(isolate, handle).ToHandleChecked();
-  CHECK(String::cast(print_string).IsOneByteEqualTo(base::CStrVector(string)));
+  CHECK(String::cast(print_string)->IsOneByteEqualTo(base::CStrVector(string)));
 }
 
 static void CheckSmi(Isolate* isolate, int value, const char* string) {
   Handle<Object> handle(Smi::FromInt(value), isolate);
   Object print_string = *Object::ToString(isolate, handle).ToHandleChecked();
-  CHECK(String::cast(print_string).IsOneByteEqualTo(base::CStrVector(string)));
+  CHECK(String::cast(print_string)->IsOneByteEqualTo(base::CStrVector(string)));
 }
 
 
 static void CheckNumber(Isolate* isolate, double value, const char* string) {
   Handle<Object> number = isolate->factory()->NewNumber(value);
-  CHECK(number->IsNumber());
+  CHECK(IsNumber(*number));
   Handle<Object> print_string =
       Object::ToString(isolate, number).ToHandleChecked();
-  CHECK(String::cast(*print_string).IsOneByteEqualTo(base::CStrVector(string)));
+  CHECK(
+      String::cast(*print_string)->IsOneByteEqualTo(base::CStrVector(string)));
 }
 
 void CheckEmbeddedObjectsAreEqual(Isolate* isolate, Handle<Code> lhs,
@@ -218,14 +222,14 @@ static void CheckGcSafeFindCodeForInnerPointer(Isolate* isolate) {
           .Build()
           ->instruction_stream(),
       isolate);
-  CHECK(code->IsInstructionStream(cage_base));
+  CHECK(IsInstructionStream(*code, cage_base));
 
   HeapObject obj = HeapObject::cast(*code);
   Address obj_addr = obj.address();
 
-  for (int i = 0; i < obj.Size(cage_base); i += kTaggedSize) {
+  for (int i = 0; i < obj->Size(cage_base); i += kTaggedSize) {
     Code lookup_result = isolate->heap()->FindCodeForInnerPointer(obj_addr + i);
-    CHECK_EQ(*code, lookup_result.instruction_stream());
+    CHECK_EQ(*code, lookup_result->instruction_stream());
   }
 
   Handle<InstructionStream> copy(
@@ -235,9 +239,9 @@ static void CheckGcSafeFindCodeForInnerPointer(Isolate* isolate) {
       isolate);
   HeapObject obj_copy = HeapObject::cast(*copy);
   Code not_right = isolate->heap()->FindCodeForInnerPointer(
-      obj_copy.address() + obj_copy.Size(cage_base) / 2);
-  CHECK_NE(not_right.instruction_stream(), *code);
-  CHECK_EQ(not_right.instruction_stream(), *copy);
+      obj_copy.address() + obj_copy->Size(cage_base) / 2);
+  CHECK_NE(not_right->instruction_stream(), *code);
+  CHECK_EQ(not_right->instruction_stream(), *copy);
 }
 
 TEST(HandleNull) {
@@ -258,60 +262,60 @@ TEST(HeapObjects) {
 
   HandleScope sc(isolate);
   Handle<Object> value = factory->NewNumber(1.000123);
-  CHECK(value->IsHeapNumber());
-  CHECK(value->IsNumber());
-  CHECK_EQ(1.000123, value->Number());
+  CHECK(IsHeapNumber(*value));
+  CHECK(IsNumber(*value));
+  CHECK_EQ(1.000123, Object::Number(*value));
 
   value = factory->NewNumber(1.0);
-  CHECK(value->IsSmi());
-  CHECK(value->IsNumber());
-  CHECK_EQ(1.0, value->Number());
+  CHECK(IsSmi(*value));
+  CHECK(IsNumber(*value));
+  CHECK_EQ(1.0, Object::Number(*value));
 
   value = factory->NewNumberFromInt(1024);
-  CHECK(value->IsSmi());
-  CHECK(value->IsNumber());
-  CHECK_EQ(1024.0, value->Number());
+  CHECK(IsSmi(*value));
+  CHECK(IsNumber(*value));
+  CHECK_EQ(1024.0, Object::Number(*value));
 
   value = factory->NewNumberFromInt(Smi::kMinValue);
-  CHECK(value->IsSmi());
-  CHECK(value->IsNumber());
-  CHECK_EQ(Smi::kMinValue, Handle<Smi>::cast(value)->value());
+  CHECK(IsSmi(*value));
+  CHECK(IsNumber(*value));
+  CHECK_EQ(Smi::kMinValue, Smi::cast(*value).value());
 
   value = factory->NewNumberFromInt(Smi::kMaxValue);
-  CHECK(value->IsSmi());
-  CHECK(value->IsNumber());
-  CHECK_EQ(Smi::kMaxValue, Handle<Smi>::cast(value)->value());
+  CHECK(IsSmi(*value));
+  CHECK(IsNumber(*value));
+  CHECK_EQ(Smi::kMaxValue, Smi::cast(*value).value());
 
 #if !defined(V8_TARGET_ARCH_64_BIT)
   // TODO(lrn): We need a NumberFromIntptr function in order to test this.
   value = factory->NewNumberFromInt(Smi::kMinValue - 1);
-  CHECK(value->IsHeapNumber());
-  CHECK(value->IsNumber());
-  CHECK_EQ(static_cast<double>(Smi::kMinValue - 1), value->Number());
+  CHECK(IsHeapNumber(*value));
+  CHECK(IsNumber(*value));
+  CHECK_EQ(static_cast<double>(Smi::kMinValue - 1), Object::Number(*value));
 #endif
 
   value = factory->NewNumberFromUint(static_cast<uint32_t>(Smi::kMaxValue) + 1);
-  CHECK(value->IsHeapNumber());
-  CHECK(value->IsNumber());
+  CHECK(IsHeapNumber(*value));
+  CHECK(IsNumber(*value));
   CHECK_EQ(static_cast<double>(static_cast<uint32_t>(Smi::kMaxValue) + 1),
-           value->Number());
+           Object::Number(*value));
 
   value = factory->NewNumberFromUint(static_cast<uint32_t>(1) << 31);
-  CHECK(value->IsHeapNumber());
-  CHECK(value->IsNumber());
+  CHECK(IsHeapNumber(*value));
+  CHECK(IsNumber(*value));
   CHECK_EQ(static_cast<double>(static_cast<uint32_t>(1) << 31),
-           value->Number());
+           Object::Number(*value));
 
   // nan oddball checks
-  CHECK(factory->nan_value()->IsNumber());
-  CHECK(std::isnan(factory->nan_value()->Number()));
+  CHECK(IsNumber(*factory->nan_value()));
+  CHECK(std::isnan(Object::Number(*factory->nan_value())));
 
   Handle<String> s = factory->NewStringFromStaticChars("fisk hest ");
-  CHECK(s->IsString());
+  CHECK(IsString(*s));
   CHECK_EQ(10, s->length());
 
   Handle<String> object_string = Handle<String>::cast(factory->Object_string());
-  Handle<JSGlobalObject> global(CcTest::i_isolate()->context().global_object(),
+  Handle<JSGlobalObject> global(CcTest::i_isolate()->context()->global_object(),
                                 isolate);
   CHECK(Just(true) ==
         JSReceiver::HasOwnProperty(isolate, global, object_string));
@@ -338,9 +342,9 @@ TEST(Tagging) {
   CcTest::InitializeVM();
   int request = 24;
   CHECK_EQ(request, static_cast<int>(OBJECT_POINTER_ALIGN(request)));
-  CHECK(Smi::FromInt(42).IsSmi());
-  CHECK(Smi::FromInt(Smi::kMinValue).IsSmi());
-  CHECK(Smi::FromInt(Smi::kMaxValue).IsSmi());
+  CHECK(IsSmi(Smi::FromInt(42)));
+  CHECK(IsSmi(Smi::FromInt(Smi::kMinValue)));
+  CHECK(IsSmi(Smi::FromInt(Smi::kMaxValue)));
 }
 
 
@@ -353,9 +357,9 @@ TEST(GarbageCollection) {
 
   HandleScope sc(isolate);
   // Check GC.
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(CcTest::heap());
 
-  Handle<JSGlobalObject> global(CcTest::i_isolate()->context().global_object(),
+  Handle<JSGlobalObject> global(CcTest::i_isolate()->context()->global_object(),
                                 isolate);
   Handle<String> name = factory->InternalizeUtf8String("theFunction");
   Handle<String> prop_name = factory->InternalizeUtf8String("theSlot");
@@ -380,14 +384,14 @@ TEST(GarbageCollection) {
              *Object::GetProperty(isolate, obj, prop_namex).ToHandleChecked());
   }
 
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(CcTest::heap());
 
   // Function should be alive.
   CHECK(Just(true) == JSReceiver::HasOwnProperty(isolate, global, name));
   // Check function is retained.
   Handle<Object> func_value =
       Object::GetProperty(isolate, global, name).ToHandleChecked();
-  CHECK(func_value->IsJSFunction());
+  CHECK(IsJSFunction(*func_value));
   Handle<JSFunction> function = Handle<JSFunction>::cast(func_value);
 
   {
@@ -399,12 +403,12 @@ TEST(GarbageCollection) {
   }
 
   // After gc, it should survive.
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(CcTest::heap());
 
   CHECK(Just(true) == JSReceiver::HasOwnProperty(isolate, global, obj_name));
   Handle<Object> obj =
       Object::GetProperty(isolate, global, obj_name).ToHandleChecked();
-  CHECK(obj->IsJSObject());
+  CHECK(IsJSObject(*obj));
   CHECK_EQ(Smi::FromInt(23),
            *Object::GetProperty(isolate, obj, prop_name).ToHandleChecked());
 }
@@ -470,12 +474,12 @@ TEST(GlobalHandles) {
   }
 
   // after gc, it should survive
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(CcTest::heap());
 
-  CHECK((*h1).IsString());
-  CHECK((*h2).IsHeapNumber());
-  CHECK((*h3).IsString());
-  CHECK((*h4).IsHeapNumber());
+  CHECK(IsString(*h1));
+  CHECK(IsHeapNumber(*h2));
+  CHECK(IsString(*h3));
+  CHECK(IsHeapNumber(*h4));
 
   CHECK_EQ(*h3, *h1);
   GlobalHandles::Destroy(h1.location());
@@ -532,9 +536,10 @@ TEST(WeakGlobalUnmodifiedApiHandlesScavenge) {
       h2.location(), reinterpret_cast<void*>(&handle_and_id),
       &TestWeakGlobalHandleCallback, v8::WeakCallbackType::kParameter);
 
-  v8_flags.single_generation ? CcTest::CollectGarbage(OLD_SPACE)
-                             : CcTest::CollectGarbage(NEW_SPACE);
-  CHECK((*h1).IsHeapNumber());
+  v8_flags.single_generation ? heap::InvokeMajorGC(CcTest::heap())
+                             : heap::InvokeMinorGC(CcTest::heap());
+
+  CHECK(IsHeapNumber(*h1));
   CHECK(WeakPointerCleared);
   GlobalHandles::Destroy(h1.location());
 }
@@ -564,8 +569,7 @@ TEST(WeakGlobalHandlesMark) {
   }
 
   // Make sure the objects are promoted.
-  CcTest::CollectGarbage(OLD_SPACE);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::EmptyNewSpaceUsingGC(isolate->heap());
   CHECK(!Heap::InYoungGeneration(*h1) && !Heap::InYoungGeneration(*h2));
 
   std::pair<Handle<Object>*, int> handle_and_id(&h2, 1234);
@@ -574,8 +578,8 @@ TEST(WeakGlobalHandlesMark) {
       &TestWeakGlobalHandleCallback, v8::WeakCallbackType::kParameter);
 
   // Incremental marking potentially marked handles before they turned weak.
-  CcTest::CollectAllGarbage();
-  CHECK((*h1).IsString());
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(IsString(*h1));
   CHECK(WeakPointerCleared);
   GlobalHandles::Destroy(h1.location());
 }
@@ -605,7 +609,7 @@ TEST(DeleteWeakGlobalHandle) {
                           &TestWeakGlobalHandleCallback,
                           v8::WeakCallbackType::kParameter);
   CHECK(!WeakPointerCleared);
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(CcTest::heap());
   CHECK(WeakPointerCleared);
 }
 
@@ -617,7 +621,8 @@ TEST(BytecodeArray) {
   static const int32_t kParameterCount = 2;
 
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
@@ -636,7 +641,7 @@ TEST(BytecodeArray) {
   Handle<BytecodeArray> array = factory->NewBytecodeArray(
       kRawBytesSize, kRawBytes, kFrameSize, kParameterCount, constant_pool);
 
-  CHECK(array->IsBytecodeArray());
+  CHECK(IsBytecodeArray(*array));
   CHECK_EQ(array->length(), (int)sizeof(kRawBytes));
   CHECK_EQ(array->frame_size(), kFrameSize);
   CHECK_EQ(array->parameter_count(), kParameterCount);
@@ -656,7 +661,9 @@ TEST(BytecodeArray) {
   // evacuation candidate.
   Page* evac_page = Page::FromHeapObject(*constant_pool);
   heap::ForceEvacuationCandidate(evac_page);
-  CcTest::CollectAllGarbage();
+  // We need to invoke GC without stack, otherwise no compaction is performed.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+  heap::InvokeMajorGC(heap);
 
   // BytecodeArray should survive.
   CHECK_EQ(array->length(), kRawBytesSize);
@@ -672,28 +679,6 @@ TEST(BytecodeArray) {
   CHECK_NE(array->constant_pool().ptr(), old_constant_pool_address.ptr());
 }
 
-TEST(BytecodeArrayAging) {
-  static const uint8_t kRawBytes[] = {0xC3, 0x7E, 0xA5, 0x5A};
-  static const int kRawBytesSize = sizeof(kRawBytes);
-  static const int32_t kFrameSize = 32;
-  static const int32_t kParameterCount = 2;
-  CcTest::InitializeVM();
-  Isolate* isolate = CcTest::i_isolate();
-  Factory* factory = isolate->factory();
-  HandleScope scope(isolate);
-
-  Handle<BytecodeArray> array =
-      factory->NewBytecodeArray(kRawBytesSize, kRawBytes, kFrameSize,
-                                kParameterCount, factory->empty_fixed_array());
-
-  CHECK_EQ(0, array->bytecode_age());
-  array->MakeOlder();
-  CHECK_EQ(1, array->bytecode_age());
-  array->set_bytecode_age(v8_flags.bytecode_old_age);
-  array->MakeOlder();
-  CHECK_EQ(v8_flags.bytecode_old_age, array->bytecode_age());
-}
-
 static const char* not_so_random_string_table[] = {
     "abstract",   "boolean",      "break",      "byte",    "case",
     "catch",      "char",         "class",      "const",   "continue",
@@ -717,7 +702,7 @@ static void CheckInternalizedStrings(const char** strings) {
     Handle<String> a =
         isolate->factory()->InternalizeUtf8String(base::CStrVector(string));
     // InternalizeUtf8String may return a failure if a GC is needed.
-    CHECK(a->IsInternalizedString());
+    CHECK(IsInternalizedString(*a));
     Handle<String> b = factory->InternalizeUtf8String(string);
     CHECK_EQ(*b, *a);
     CHECK(b->IsOneByteEqualTo(base::CStrVector(string)));
@@ -899,7 +884,7 @@ TEST(JSArray) {
   JSArray::SetLength(array, static_cast<uint32_t>(Smi::kMaxValue) + 1);
 
   uint32_t int_length = 0;
-  CHECK(array->length().ToArrayIndex(&int_length));
+  CHECK(Object::ToArrayIndex(array->length(), &int_length));
   CHECK_EQ(static_cast<uint32_t>(Smi::kMaxValue) + 1, int_length);
   CHECK(array->HasDictionaryElements());  // Must be in slow mode.
 
@@ -907,7 +892,7 @@ TEST(JSArray) {
   Object::SetElement(isolate, array, int_length, name, ShouldThrow::kDontThrow)
       .Check();
   uint32_t new_int_length = 0;
-  CHECK(array->length().ToArrayIndex(&new_int_length));
+  CHECK(Object::ToArrayIndex(array->length(), &new_int_length));
   CHECK_EQ(static_cast<double>(int_length), new_int_length - 1);
   element = Object::GetElement(isolate, array, int_length).ToHandleChecked();
   CHECK_EQ(*element, *name);
@@ -1037,7 +1022,7 @@ static int ObjectsFoundInHeap(Heap* heap, Handle<Object> objs[], int size) {
       // InstructionStream object with non-InstructionStream object here and it
       // might produce false positives because operator== for tagged values
       // compares only lower 32 bits when pointer compression is enabled.
-      if (objs[i]->ptr() == obj.ptr()) {
+      if ((*objs[i]).ptr() == obj.ptr()) {
         found_count++;
       }
     }
@@ -1052,7 +1037,7 @@ TEST(Iteration) {
   Factory* factory = isolate->factory();
   v8::HandleScope scope(CcTest::isolate());
 
-  // Array of objects to scan haep for.
+  // Array of objects to scan heap for.
   const int objs_count = 6;
   Handle<Object> objs[objs_count];
   int next_objs_index = 0;
@@ -1078,7 +1063,7 @@ TEST(Iteration) {
 
   // Add a Map object to look for.
   objs[next_objs_index++] =
-      Handle<Map>(HeapObject::cast(*objs[0]).map(), isolate);
+      Handle<Map>(HeapObject::cast(*objs[0])->map(), isolate);
 
   CHECK_EQ(objs_count, next_objs_index);
   CHECK_EQ(objs_count, ObjectsFoundInHeap(CcTest::heap(), objs, objs_count));
@@ -1125,27 +1110,24 @@ TEST(TestBytecodeFlushing) {
     Handle<Object> func_value =
         Object::GetProperty(i_isolate, i_isolate->global_object(), foo_name)
             .ToHandleChecked();
-    CHECK(func_value->IsJSFunction());
+    CHECK(IsJSFunction(*func_value));
     Handle<JSFunction> function = Handle<JSFunction>::cast(func_value);
-    CHECK(function->shared().is_compiled());
+    CHECK(function->shared()->is_compiled());
 
     // The code will survive at least two GCs.
-    CcTest::CollectAllGarbage();
-    CcTest::CollectAllGarbage();
-    CHECK(function->shared().is_compiled());
-
-    // Simulate several GCs that use full marking.
-    const int kAgingThreshold = 6;
-    for (int i = 0; i < kAgingThreshold; i++) {
-      CcTest::CollectAllGarbage();
-    }
+    heap::InvokeMajorGC(CcTest::heap());
+    heap::InvokeMajorGC(CcTest::heap());
+    CHECK(function->shared()->is_compiled());
+
+    i::SharedFunctionInfo::EnsureOldForTesting(function->shared());
+    heap::InvokeMajorGC(CcTest::heap());
 
     // foo should no longer be in the compilation cache
-    CHECK(!function->shared().is_compiled());
+    CHECK(!function->shared()->is_compiled());
     CHECK(!function->is_compiled());
     // Call foo to get it recompiled.
     CompileRun("foo()");
-    CHECK(function->shared().is_compiled());
+    CHECK(function->shared()->is_compiled());
     CHECK(function->is_compiled());
   }
 }
@@ -1165,6 +1147,7 @@ static void TestMultiReferencedBytecodeFlushing(bool sparkplug_compile) {
   i::v8_flags.flush_bytecode = true;
   i::v8_flags.allow_natives_syntax = true;
 
+  ManualGCScope manual_gc_scope;
   CcTest::InitializeVM();
   v8::Isolate* isolate = CcTest::isolate();
   Isolate* i_isolate = CcTest::i_isolate();
@@ -1194,7 +1177,7 @@ static void TestMultiReferencedBytecodeFlushing(bool sparkplug_compile) {
     Handle<Object> func_value =
         Object::GetProperty(i_isolate, i_isolate->global_object(), foo_name)
             .ToHandleChecked();
-    CHECK(func_value->IsJSFunction());
+    CHECK(IsJSFunction(*func_value));
     Handle<JSFunction> function = Handle<JSFunction>::cast(func_value);
     Handle<SharedFunctionInfo> shared = handle(function->shared(), i_isolate);
     CHECK(shared->is_compiled());
@@ -1210,21 +1193,18 @@ static void TestMultiReferencedBytecodeFlushing(bool sparkplug_compile) {
           i_isolate, copy, Compiler::CLEAR_EXCEPTION, &is_compiled_scope);
     }
 
-    // Simulate several GCs that use full marking.
-    const int kAgingThreshold = 7;
-    for (int i = 0; i < kAgingThreshold; i++) {
-      CcTest::CollectAllGarbage();
-    }
+    i::SharedFunctionInfo::EnsureOldForTesting(*shared);
+    heap::InvokeMajorGC(CcTest::heap());
 
-    // foo should no longer be in the compilation cache
-    CHECK(!shared->is_compiled());
-    CHECK(!copy->is_compiled());
-    CHECK(!function->is_compiled());
+    // shared SFI is marked old but BytecodeArray is kept alive by copy.
+    CHECK(shared->is_compiled());
+    CHECK(copy->is_compiled());
+    CHECK(function->is_compiled());
 
     // The feedback metadata for both SharedFunctionInfo instances should have
     // been reset.
-    CHECK(!shared->HasFeedbackMetadata());
-    CHECK(!copy->HasFeedbackMetadata());
+    CHECK(shared->HasFeedbackMetadata());
+    CHECK(copy->HasFeedbackMetadata());
   }
 }
 
@@ -1272,36 +1252,29 @@ HEAP_TEST(Regress10560) {
     Handle<Object> func_value =
         Object::GetProperty(i_isolate, i_isolate->global_object(), foo_name)
             .ToHandleChecked();
-    CHECK(func_value->IsJSFunction());
+    CHECK(IsJSFunction(*func_value));
     Handle<JSFunction> function = Handle<JSFunction>::cast(func_value);
-    CHECK(function->shared().is_compiled());
+    CHECK(function->shared()->is_compiled());
     CHECK(!function->has_feedback_vector());
 
     // Pre-age bytecode so it will be flushed on next run.
-    CHECK(function->shared().HasBytecodeArray());
-    const int kAgingThreshold = 6;
-    for (int i = 0; i < kAgingThreshold; i++) {
-      function->shared().GetBytecodeArray(i_isolate).MakeOlder();
-      if (function->shared().GetBytecodeArray(i_isolate).IsOld()) break;
-    }
-
-    CHECK(function->shared().GetBytecodeArray(i_isolate).IsOld());
+    CHECK(function->shared()->HasBytecodeArray());
+    SharedFunctionInfo::EnsureOldForTesting(function->shared());
 
     heap::SimulateFullSpace(heap->old_space());
 
     // Just check bytecode isn't flushed still
-    CHECK(function->shared().GetBytecodeArray(i_isolate).IsOld());
-    CHECK(function->shared().is_compiled());
+    CHECK(function->shared()->is_compiled());
 
     heap->set_force_gc_on_next_allocation();
 
     // Allocate feedback vector.
     IsCompiledScope is_compiled_scope(
-        function->shared().is_compiled_scope(i_isolate));
+        function->shared()->is_compiled_scope(i_isolate));
     JSFunction::EnsureFeedbackVector(i_isolate, function, &is_compiled_scope);
 
     CHECK(function->has_feedback_vector());
-    CHECK(function->shared().is_compiled());
+    CHECK(function->shared()->is_compiled());
     CHECK(function->is_compiled());
   }
 }
@@ -1333,16 +1306,16 @@ UNINITIALIZED_TEST(Regress10843) {
     for (int i = 0; i < 140; i++) {
       arrays.push_back(factory->NewFixedArray(10000));
     }
-    CcTest::CollectAllGarbage(i_isolate);
-    CcTest::CollectAllGarbage(i_isolate);
+    heap::InvokeMajorGC(heap);
+    heap::InvokeMajorGC(heap);
     for (int i = 0; i < 40; i++) {
       arrays.push_back(factory->NewFixedArray(10000));
     }
-    CcTest::CollectAllGarbage(i_isolate);
+    heap::InvokeMajorGC(heap);
     for (int i = 0; i < 100; i++) {
       arrays.push_back(factory->NewFixedArray(10000));
     }
-    CcTest::CollectAllGarbage(i_isolate);
+    heap::InvokeMajorGC(heap);
     CHECK(callback_was_invoked);
   }
   isolate->Dispose();
@@ -1385,11 +1358,11 @@ UNINITIALIZED_TEST(Regress12777) {
     for (int i = 0; i < 5; i++) {
       arrays.push_back(i_isolate->factory()->NewFixedArray(length));
     }
-    CcTest::CollectAllGarbage(i_isolate);
+    heap::InvokeMajorGC(i_isolate->heap());
     for (int i = 0; i < 5; i++) {
       arrays.push_back(i_isolate->factory()->NewFixedArray(length));
     }
-    CcTest::CollectAllGarbage(i_isolate);
+    heap::InvokeMajorGC(i_isolate->heap());
     for (int i = 0; i < 5; i++) {
       arrays.push_back(i_isolate->factory()->NewFixedArray(length));
     }
@@ -1452,22 +1425,19 @@ TEST(TestOptimizeAfterBytecodeFlushingCandidate) {
   Handle<Object> func_value =
       Object::GetProperty(isolate, isolate->global_object(), foo_name)
           .ToHandleChecked();
-  CHECK(func_value->IsJSFunction());
+  CHECK(IsJSFunction(*func_value));
   Handle<JSFunction> function = Handle<JSFunction>::cast(func_value);
-  CHECK(function->shared().is_compiled());
+  CHECK(function->shared()->is_compiled());
 
   // The code will survive at least two GCs.
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
-  CHECK(function->shared().is_compiled());
+  heap::InvokeMajorGC(CcTest::heap());
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(function->shared()->is_compiled());
 
-  // Simulate several GCs that use incremental marking.
-  const int kAgingThreshold = 6;
-  for (int i = 0; i < kAgingThreshold; i++) {
-    heap::SimulateIncrementalMarking(CcTest::heap());
-    CcTest::CollectAllGarbage();
-  }
-  CHECK(!function->shared().is_compiled());
+  i::SharedFunctionInfo::EnsureOldForTesting(function->shared());
+  heap::InvokeMajorGC(CcTest::heap());
+
+  CHECK(!function->shared()->is_compiled());
   CHECK(!function->is_compiled());
 
   // This compile will compile the function again.
@@ -1476,13 +1446,8 @@ TEST(TestOptimizeAfterBytecodeFlushingCandidate) {
     CompileRun("foo();");
   }
 
-  // Simulate several GCs that use incremental marking but make sure
-  // the loop breaks once the function is enqueued as a candidate.
-  for (int i = 0; i < kAgingThreshold; i++) {
-    heap::SimulateIncrementalMarking(CcTest::heap());
-    if (function->shared().GetBytecodeArray(CcTest::i_isolate()).IsOld()) break;
-    CcTest::CollectAllGarbage();
-  }
+  SharedFunctionInfo::EnsureOldForTesting(function->shared());
+  heap::SimulateIncrementalMarking(CcTest::heap());
 
   // Force optimization while incremental marking is active and while
   // the function is enqueued as a candidate.
@@ -1494,8 +1459,8 @@ TEST(TestOptimizeAfterBytecodeFlushingCandidate) {
   }
 
   // Simulate one final GC and make sure the candidate wasn't flushed.
-  CcTest::CollectAllGarbage();
-  CHECK(function->shared().is_compiled());
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(function->shared()->is_compiled());
   CHECK(function->is_compiled());
 }
 #endif  // !defined(V8_LITE_MODE) && defined(V8_ENABLE_TURBOFAN)
@@ -1551,6 +1516,10 @@ void CompilationCacheCachingBehavior(bool retain_script) {
   if (!v8_flags.compilation_cache) {
     return;
   }
+  if (!v8_flags.flush_bytecode ||
+      (v8_flags.always_sparkplug && !v8_flags.flush_baseline_code)) {
+    return;
+  }
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   Factory* factory = isolate->factory();
@@ -1590,7 +1559,7 @@ void CompilationCacheCachingBehavior(bool retain_script) {
 
   // Check that the code cache entry survives at least one GC.
   {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
     v8::HandleScope scope(CcTest::isolate());
     ScriptDetails script_details(Handle<Object>(),
                                  v8::ScriptOriginOptions(true, false));
@@ -1602,13 +1571,13 @@ void CompilationCacheCachingBehavior(bool retain_script) {
     Handle<SharedFunctionInfo> shared =
         lookup_result.toplevel_sfi().ToHandleChecked();
     CHECK(shared->HasBytecodeArray());
-    const int kAgingThreshold = 6;
-    for (int i = 0; i < kAgingThreshold; i++) {
-      shared->GetBytecodeArray(CcTest::i_isolate()).MakeOlder();
-    }
+    SharedFunctionInfo::EnsureOldForTesting(*shared);
   }
 
-  CcTest::CollectAllGarbage();
+  // The first GC flushes the BytecodeArray from the SFI.
+  heap::InvokeMajorGC(CcTest::heap());
+  // The second GC removes the SFI from the compilation cache.
+  heap::InvokeMajorGC(CcTest::heap());
 
   {
     v8::HandleScope scope(CcTest::isolate());
@@ -1644,10 +1613,7 @@ template <typename T>
 void AgeBytecode(v8::Local<T> function_or_script) {
   Handle<SharedFunctionInfo> shared = GetSharedFunctionInfo(function_or_script);
   CHECK(shared->HasBytecodeArray());
-  const int kAgingThreshold = 6;
-  for (int i = 0; i < kAgingThreshold; i++) {
-    shared->GetBytecodeArray(CcTest::i_isolate()).MakeOlder();
-  }
+  SharedFunctionInfo::EnsureOldForTesting(*shared);
 }
 
 void CompilationCacheRegeneration(bool retain_root_sfi, bool flush_root_sfi,
@@ -1657,10 +1623,11 @@ void CompilationCacheRegeneration(bool retain_root_sfi, bool flush_root_sfi,
     return;
   }
 
-  // Some flags can prevent bytecode flushing, which affects this test.
-  bool flushing_disabled =
-      !v8_flags.flush_bytecode ||
-      (v8_flags.always_sparkplug && !v8_flags.flush_baseline_code);
+  // Skip test if code flushing was disabled.
+  if (!v8_flags.flush_bytecode ||
+      (v8_flags.always_sparkplug && !v8_flags.flush_baseline_code)) {
+    return;
+  }
 
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
@@ -1738,14 +1705,18 @@ void CompilationCacheRegeneration(bool retain_root_sfi, bool flush_root_sfi,
     }
   }
 
-  CcTest::CollectAllGarbage();
-
   if (v8_flags.stress_incremental_marking) {
-    // If incremental marking could have started before the bytecode was aged,
-    // then we need a second collection to evict the cache entries.
-    CcTest::CollectAllGarbage();
+    // This GC finishes incremental marking if it is already running. If
+    // incremental marking was already running we would not flush the code right
+    // away.
+    heap::InvokeMajorGC(CcTest::heap());
   }
 
+  // The first GC performs code flushing.
+  heap::InvokeMajorGC(CcTest::heap());
+  // The second GC clears the entry from the compilation cache.
+  heap::InvokeMajorGC(CcTest::heap());
+
   // The root SharedFunctionInfo can be retained either by a Global in this
   // function or by the compilation cache.
   bool root_sfi_should_still_exist = retain_root_sfi || !flush_root_sfi;
@@ -1761,17 +1732,17 @@ void CompilationCacheRegeneration(bool retain_root_sfi, bool flush_root_sfi,
     // The eager function may have had its bytecode flushed.
     Handle<SharedFunctionInfo> eager_sfi =
         GetSharedFunctionInfo(eager_function.Get(CcTest::isolate()));
-    CHECK_EQ(!flush_eager_sfi || flushing_disabled, eager_sfi->is_compiled());
+    CHECK_EQ(!flush_eager_sfi, eager_sfi->is_compiled());
 
     // Check whether the root SharedFunctionInfo is still reachable from the
     // Script.
     Handle<Script> script(Script::cast(lazy_sfi->script()), isolate);
     bool root_sfi_still_exists = false;
     MaybeObject maybe_root_sfi =
-        script->shared_function_infos().Get(kFunctionLiteralIdTopLevel);
-    if (HeapObject sfi_or_undefined;
+        script->shared_function_infos()->Get(kFunctionLiteralIdTopLevel);
+    if (Tagged<HeapObject> sfi_or_undefined;
         maybe_root_sfi.GetHeapObject(&sfi_or_undefined)) {
-      root_sfi_still_exists = !sfi_or_undefined.IsUndefined();
+      root_sfi_still_exists = !IsUndefined(sfi_or_undefined);
     }
     CHECK_EQ(root_sfi_should_still_exist, root_sfi_still_exists);
   }
@@ -1804,7 +1775,7 @@ void CompilationCacheRegeneration(bool retain_root_sfi, bool flush_root_sfi,
     // it was flushed but the root function was not.
     Handle<SharedFunctionInfo> old_eager_sfi =
         GetSharedFunctionInfo(eager_function.Get(CcTest::isolate()));
-    CHECK_EQ(!(flush_eager_sfi && !flush_root_sfi) || flushing_disabled,
+    CHECK_EQ(!(flush_eager_sfi && !flush_root_sfi),
              old_eager_sfi->is_compiled());
 
     v8::Local<v8::Value> result = script->Run(context).ToLocalChecked();
@@ -1874,9 +1845,9 @@ static void OptimizeEmptyFunction(const char* name) {
 int CountNativeContexts() {
   int count = 0;
   Object object = CcTest::heap()->native_contexts_list();
-  while (!object.IsUndefined(CcTest::i_isolate())) {
+  while (!IsUndefined(object, CcTest::i_isolate())) {
     count++;
-    object = Context::cast(object).next_context_link();
+    object = Context::cast(object)->next_context_link();
   }
   return count;
 }
@@ -1912,7 +1883,7 @@ TEST(TestInternalWeakLists) {
     // Collect garbage that might have been created by one of the
     // installed extensions.
     isolate->compilation_cache()->Clear();
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
 
     CHECK_EQ(i + 1, CountNativeContexts());
 
@@ -1932,31 +1903,31 @@ TEST(TestInternalWeakLists) {
 
     // Scavenge treats these references as strong.
     for (int j = 0; j < 10; j++) {
-      CcTest::CollectGarbage(NEW_SPACE);
+      heap::InvokeMinorGC(CcTest::heap());
     }
 
     // Mark compact handles the weak references.
     isolate->compilation_cache()->Clear();
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
 
     // Get rid of f3 and f5 in the same way.
     CompileRun("f3=null");
     for (int j = 0; j < 10; j++) {
-      CcTest::CollectGarbage(NEW_SPACE);
+      heap::InvokeMinorGC(CcTest::heap());
     }
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
     CompileRun("f5=null");
     for (int j = 0; j < 10; j++) {
-      CcTest::CollectGarbage(NEW_SPACE);
+      heap::InvokeMinorGC(CcTest::heap());
     }
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
 
     ctx[i]->Exit();
   }
 
   // Force compilation cache cleanup.
   CcTest::heap()->NotifyContextDisposed(true);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
   // Dispose the native contexts one by one.
   for (int i = 0; i < kNumTestContexts; i++) {
@@ -1967,12 +1938,12 @@ TEST(TestInternalWeakLists) {
 
     // Scavenge treats these references as strong.
     for (int j = 0; j < 10; j++) {
-      CcTest::CollectGarbage(i::NEW_SPACE);
+      heap::InvokeMinorGC(CcTest::heap());
       CHECK_EQ(kNumTestContexts - i, CountNativeContexts());
     }
 
     // Mark compact handles the weak references.
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
     CHECK_EQ(kNumTestContexts - i - 1, CountNativeContexts());
   }
 
@@ -2008,7 +1979,7 @@ TEST(TestSizeOfRegExpCode) {
 
   // Get initial heap size after several full GCs, which will stabilize
   // the heap size and return with sweeping finished completely.
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
   if (heap->sweeping_in_progress()) {
     heap->EnsureSweepingCompleted(
         Heap::SweepingForcedFinalizationMode::kV8Only);
@@ -2016,11 +1987,11 @@ TEST(TestSizeOfRegExpCode) {
   int initial_size = static_cast<int>(heap->SizeOfObjects());
 
   CompileRun("'foo'.match(reg_exp_source);");
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
   int size_with_regexp = static_cast<int>(heap->SizeOfObjects());
 
   CompileRun("'foo'.match(half_size_reg_exp);");
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
   int size_with_optimized_regexp = static_cast<int>(heap->SizeOfObjects());
 
   int size_of_regexp_code = size_with_regexp - initial_size;
@@ -2050,7 +2021,7 @@ HEAP_TEST(TestSizeOfObjects) {
 
   // Get initial heap size after several full GCs, which will stabilize
   // the heap size and return with sweeping finished completely.
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
   if (heap->sweeping_in_progress()) {
     heap->EnsureSweepingCompleted(
         Heap::SweepingForcedFinalizationMode::kV8Only);
@@ -2073,7 +2044,7 @@ HEAP_TEST(TestSizeOfObjects) {
 
   // The heap size should go back to initial size after a full GC, even
   // though sweeping didn't finish yet.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   // Normally sweeping would not be complete here, but no guarantees.
   CHECK_EQ(initial_size, static_cast<int>(heap->SizeOfObjects()));
   // Waiting for sweeper threads should not change heap size.
@@ -2150,7 +2121,7 @@ TEST(TestAlignedAllocation) {
   HeapObject obj;
   HeapObject filler;
   if (double_misalignment) {
-    if (v8_flags.minor_mc) {
+    if (v8_flags.minor_ms) {
       // Make one allocation to force allocating an allocation area. Using
       // kDoubleSize to not change space alignment
       USE(CcTest::heap()->new_space()->AllocateRawUnaligned(kDoubleSize));
@@ -2170,8 +2141,8 @@ TEST(TestAlignedAllocation) {
     CHECK(IsAligned(obj.address(), kDoubleAlignment));
     // There is a filler object before the object.
     filler = HeapObject::FromAddress(start);
-    CHECK(obj != filler && filler.IsFreeSpaceOrFiller() &&
-          filler.Size() == kTaggedSize);
+    CHECK(obj != filler && IsFreeSpaceOrFiller(filler) &&
+          filler->Size() == kTaggedSize);
     CHECK_EQ(kTaggedSize + double_misalignment, *top_addr - start);
 
     // Similarly for kDoubleUnaligned.
@@ -2184,8 +2155,8 @@ TEST(TestAlignedAllocation) {
     CHECK(IsAligned(obj.address() + kTaggedSize, kDoubleAlignment));
     // There is a filler object before the object.
     filler = HeapObject::FromAddress(start);
-    CHECK(obj != filler && filler.IsFreeSpaceOrFiller() &&
-          filler.Size() == kTaggedSize);
+    CHECK(obj != filler && IsFreeSpaceOrFiller(filler) &&
+          filler->Size() == kTaggedSize);
     CHECK_EQ(kTaggedSize + double_misalignment, *top_addr - start);
   }
 }
@@ -2247,10 +2218,10 @@ TEST(TestAlignedOverAllocation) {
     CHECK(IsAligned(obj.address(), kDoubleAlignment));
     filler = HeapObject::FromAddress(start);
     CHECK(obj != filler);
-    CHECK(filler.IsFreeSpaceOrFiller());
-    CHECK_EQ(kTaggedSize, filler.Size());
-    CHECK(obj != filler && filler.IsFreeSpaceOrFiller() &&
-          filler.Size() == kTaggedSize);
+    CHECK(IsFreeSpaceOrFiller(filler));
+    CHECK_EQ(kTaggedSize, filler->Size());
+    CHECK(obj != filler && IsFreeSpaceOrFiller(filler) &&
+          filler->Size() == kTaggedSize);
 
     // Similarly for kDoubleUnaligned.
     start = AlignOldSpace(kDoubleUnaligned, 0);
@@ -2262,8 +2233,8 @@ TEST(TestAlignedOverAllocation) {
     obj = OldSpaceAllocateAligned(kTaggedSize, kDoubleUnaligned);
     CHECK(IsAligned(obj.address() + kTaggedSize, kDoubleAlignment));
     filler = HeapObject::FromAddress(start);
-    CHECK(obj != filler && filler.IsFreeSpaceOrFiller() &&
-          filler.Size() == kTaggedSize);
+    CHECK(obj != filler && IsFreeSpaceOrFiller(filler) &&
+          filler->Size() == kTaggedSize);
   }
 }
 
@@ -2284,7 +2255,7 @@ TEST(HeapNumberAlignment) {
     if (!v8_flags.single_generation) {
       AlignNewSpace(required_alignment, offset);
       Handle<Object> number_new = factory->NewNumber(1.000123);
-      CHECK(number_new->IsHeapNumber());
+      CHECK(IsHeapNumber(*number_new));
       CHECK(Heap::InYoungGeneration(*number_new));
       CHECK_EQ(0, Heap::GetFillToAlign(HeapObject::cast(*number_new).address(),
                                        required_alignment));
@@ -2293,7 +2264,7 @@ TEST(HeapNumberAlignment) {
     AlignOldSpace(required_alignment, offset);
     Handle<Object> number_old =
         factory->NewNumber<AllocationType::kOld>(1.000321);
-    CHECK(number_old->IsHeapNumber());
+    CHECK(IsHeapNumber(*number_old));
     CHECK(heap->InOldSpace(*number_old));
     CHECK_EQ(0, Heap::GetFillToAlign(HeapObject::cast(*number_old).address(),
                                      required_alignment));
@@ -2311,8 +2282,8 @@ TEST(TestSizeOfObjectsVsHeapObjectIteratorPrecision) {
   intptr_t size_of_objects_2 = 0;
   for (HeapObject obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (!obj.IsFreeSpace(cage_base)) {
-      size_of_objects_2 += obj.Size(cage_base);
+    if (!IsFreeSpace(obj, cage_base)) {
+      size_of_objects_2 += obj->Size(cage_base);
     }
   }
   // Delta must be within 5% of the larger result.
@@ -2345,7 +2316,7 @@ static int NumberOfGlobalObjects() {
   HeapObjectIterator iterator(CcTest::heap());
   for (HeapObject obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (obj.IsJSGlobalObject()) count++;
+    if (IsJSGlobalObject(obj)) count++;
   }
   return count;
 }
@@ -2367,7 +2338,7 @@ TEST(LeakNativeContextViaMap) {
     v8::Local<v8::Context>::New(isolate, ctx1p)->Enter();
   }
 
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(2, NumberOfGlobalObjects());
 
   {
@@ -2394,10 +2365,10 @@ TEST(LeakNativeContextViaMap) {
     ctx1p.Reset();
     isolate->ContextDisposedNotification();
   }
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(1, NumberOfGlobalObjects());
   ctx2p.Reset();
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(0, NumberOfGlobalObjects());
 }
 
@@ -2419,7 +2390,7 @@ TEST(LeakNativeContextViaFunction) {
     v8::Local<v8::Context>::New(isolate, ctx1p)->Enter();
   }
 
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(2, NumberOfGlobalObjects());
 
   {
@@ -2446,10 +2417,10 @@ TEST(LeakNativeContextViaFunction) {
     ctx1p.Reset();
     isolate->ContextDisposedNotification();
   }
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(1, NumberOfGlobalObjects());
   ctx2p.Reset();
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(0, NumberOfGlobalObjects());
 }
 
@@ -2469,7 +2440,7 @@ TEST(LeakNativeContextViaMapKeyed) {
     v8::Local<v8::Context>::New(isolate, ctx1p)->Enter();
   }
 
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(2, NumberOfGlobalObjects());
 
   {
@@ -2496,10 +2467,10 @@ TEST(LeakNativeContextViaMapKeyed) {
     ctx1p.Reset();
     isolate->ContextDisposedNotification();
   }
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(1, NumberOfGlobalObjects());
   ctx2p.Reset();
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(0, NumberOfGlobalObjects());
 }
 
@@ -2519,7 +2490,7 @@ TEST(LeakNativeContextViaMapProto) {
     v8::Local<v8::Context>::New(isolate, ctx1p)->Enter();
   }
 
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(2, NumberOfGlobalObjects());
 
   {
@@ -2550,10 +2521,10 @@ TEST(LeakNativeContextViaMapProto) {
     ctx1p.Reset();
     isolate->ContextDisposedNotification();
   }
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(1, NumberOfGlobalObjects());
   ctx2p.Reset();
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(0, NumberOfGlobalObjects());
 }
 
@@ -2592,7 +2563,7 @@ TEST(InstanceOfStubWriteBarrier) {
 
   IncrementalMarking* marking = CcTest::heap()->incremental_marking();
   marking->Stop();
-  CcTest::heap()->StartIncrementalMarking(i::Heap::kNoGCFlags,
+  CcTest::heap()->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                           i::GarbageCollectionReason::kTesting);
 
   i::Handle<JSFunction> f = i::Handle<JSFunction>::cast(
@@ -2603,12 +2574,12 @@ TEST(InstanceOfStubWriteBarrier) {
 
   MarkingState* marking_state = CcTest::heap()->marking_state();
 
-  const double kStepSizeInMs = 100;
+  static constexpr auto kStepSize = v8::base::TimeDelta::FromMilliseconds(100);
   while (!marking_state->IsMarked(f->code())) {
     // Discard any pending GC requests otherwise we will get GC when we enter
     // code below.
     CHECK(!marking->IsMajorMarkingComplete());
-    marking->AdvanceForTesting(kStepSizeInMs);
+    marking->AdvanceForTesting(kStepSize);
   }
 
   CHECK(marking->IsMarking());
@@ -2621,7 +2592,7 @@ TEST(InstanceOfStubWriteBarrier) {
     g->Call(ctx, global, 0, nullptr).ToLocalChecked();
   }
 
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(CcTest::heap());
 }
 
 HEAP_TEST(GCFlags) {
@@ -2629,13 +2600,10 @@ HEAP_TEST(GCFlags) {
   CcTest::InitializeVM();
   Heap* heap = CcTest::heap();
 
-  heap->set_current_gc_flags(Heap::kNoGCFlags);
-  CHECK_EQ(Heap::kNoGCFlags, heap->current_gc_flags_);
-
+  heap->current_gc_flags_ = GCFlag::kNoFlags;
   // Check whether we appropriately reset flags after GC.
-  CcTest::heap()->CollectAllGarbage(Heap::kReduceMemoryFootprintMask,
-                                    GarbageCollectionReason::kTesting);
-  CHECK_EQ(Heap::kNoGCFlags, heap->current_gc_flags_);
+  heap::InvokeMajorGC(CcTest::heap(), GCFlag::kReduceMemoryFootprint);
+  CHECK_EQ(heap->current_gc_flags_, GCFlag::kNoFlags);
 
   if (heap->sweeping_in_progress()) {
     heap->EnsureSweepingCompleted(
@@ -2644,16 +2612,16 @@ HEAP_TEST(GCFlags) {
 
   IncrementalMarking* marking = heap->incremental_marking();
   marking->Stop();
-  heap->StartIncrementalMarking(Heap::kReduceMemoryFootprintMask,
-                                i::GarbageCollectionReason::kTesting);
-  CHECK_NE(0, heap->current_gc_flags_ & Heap::kReduceMemoryFootprintMask);
+  heap->StartIncrementalMarking(GCFlag::kReduceMemoryFootprint,
+                                GarbageCollectionReason::kTesting);
+  CHECK(heap->current_gc_flags_ & GCFlag::kReduceMemoryFootprint);
 
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
   // NewSpace scavenges should not overwrite the flags.
-  CHECK_NE(0, heap->current_gc_flags_ & Heap::kReduceMemoryFootprintMask);
+  CHECK(heap->current_gc_flags_ & GCFlag::kReduceMemoryFootprint);
 
-  CcTest::CollectAllGarbage();
-  CHECK_EQ(Heap::kNoGCFlags, heap->current_gc_flags_);
+  heap::InvokeMajorGC(heap, GCFlag::kNoFlags);
+  CHECK_EQ(heap->current_gc_flags_, GCFlag::kNoFlags);
 }
 
 HEAP_TEST(Regress845060) {
@@ -2674,7 +2642,7 @@ HEAP_TEST(Regress845060) {
   CHECK(Heap::InYoungGeneration(*v8::Utils::OpenHandle(*str)));
 
   // Use kReduceMemoryFootprintMask to unmap from space after scavenging.
-  heap->StartIncrementalMarking(i::Heap::kReduceMemoryFootprintMask,
+  heap->StartIncrementalMarking(i::GCFlag::kReduceMemoryFootprint,
                                 GarbageCollectionReason::kTesting);
 
   // Run the test (which allocates results) until the original string was
@@ -2693,14 +2661,14 @@ TEST(IdleNotificationFinishMarking) {
   heap::SimulateFullSpace(CcTest::heap()->old_space());
   IncrementalMarking* marking = CcTest::heap()->incremental_marking();
   marking->Stop();
-  CcTest::heap()->StartIncrementalMarking(i::Heap::kNoGCFlags,
+  CcTest::heap()->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                           i::GarbageCollectionReason::kTesting);
 
   CHECK_EQ(CcTest::heap()->gc_count(), initial_gc_count);
 
-  const double kStepSizeInMs = 100;
+  const auto kStepSize = v8::base::TimeDelta::FromMilliseconds(100);
   while (!marking->IsMajorMarkingComplete()) {
-    marking->AdvanceForTesting(kStepSizeInMs);
+    marking->AdvanceForTesting(kStepSize);
   }
 
   // The next idle notification has to finish incremental marking.
@@ -2818,22 +2786,23 @@ TEST(OptimizedPretenuringNestedInObjectProperties) {
 
   // Keep the nested literal alive while its root is freed
   base::ScopedVector<char> source(1024);
-  base::SNPrintF(source,
-                 "let number_elements = %d;"
-                 "let elements = new Array(number_elements);"
-                 "function f() {"
-                 "  for (let i = 0; i < number_elements; i++) {"
-                 "     let l =  {a: {c: 2.2, d: {e: 3.3}}, b: 1.1}; "
-                 "    elements[i] = l.a;"
-                 "  }"
-                 "  return elements[number_elements-1];"
-                 "};"
-                 "%%PrepareFunctionForOptimization(f);"
-                 "f(); gc(); gc();"
-                 "f(); f();"
-                 "%%OptimizeFunctionOnNextCall(f);"
-                 "f();",
-                 kPretenureCreationCount);
+  base::SNPrintF(
+      source,
+      "let number_elements = %d;"
+      "let elements = new Array(number_elements);"
+      "function f() {"
+      "  for (let i = 0; i < number_elements; i++) {"
+      "     let l =  {a: {b: {c: {d: {e: 2.2}, e: 3.3}, g: {h: 1.1}}}}; "
+      "    elements[i] = l.a.b.c.d;"
+      "  }"
+      "  return elements[number_elements-1];"
+      "};"
+      "%%PrepareFunctionForOptimization(f);"
+      "f(); gc(); gc();"
+      "f(); f();"
+      "%%OptimizeFunctionOnNextCall(f);"
+      "f();",
+      kPretenureCreationCount);
 
   v8::Local<v8::Value> res = CompileRun(source.begin());
 
@@ -2887,8 +2856,8 @@ TEST(OptimizedPretenuringMixedInObjectProperties) {
 
   JSObject inner_object = JSObject::cast(o->RawFastPropertyAt(idx1));
   CHECK(CcTest::heap()->InOldSpace(inner_object));
-  CHECK(CcTest::heap()->InOldSpace(inner_object.RawFastPropertyAt(idx1)));
-  CHECK(CcTest::heap()->InOldSpace(inner_object.RawFastPropertyAt(idx2)));
+  CHECK(CcTest::heap()->InOldSpace(inner_object->RawFastPropertyAt(idx1)));
+  CHECK(CcTest::heap()->InOldSpace(inner_object->RawFastPropertyAt(idx2)));
 }
 
 
@@ -3195,7 +3164,7 @@ TEST(Regress1465) {
   CHECK_EQ(transitions_count, transitions_before);
 
   heap::SimulateIncrementalMarking(heap);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
   // Count number of live transitions after marking.  Note that one transition
   // is left, because 'o' still holds an instance of one transition target.
@@ -3258,12 +3227,12 @@ TEST(TransitionArrayShrinksDuringAllocToZero) {
       "root = new F");
   root = GetByName("root");
   AddPropertyTo(2, root, "funny");
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(CcTest::heap());
 
   // Count number of live transitions after marking.  Note that one transition
   // is left, because 'o' still holds an instance of one transition target.
   int transitions_after =
-      CountMapTransitions(i_isolate, Map::cast(root->map().GetBackPointer()));
+      CountMapTransitions(i_isolate, Map::cast(root->map()->GetBackPointer()));
   CHECK_EQ(1, transitions_after);
 }
 
@@ -3287,12 +3256,12 @@ TEST(TransitionArrayShrinksDuringAllocToOne) {
 
   root = GetByName("root");
   AddPropertyTo(2, root, "funny");
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(CcTest::heap());
 
   // Count number of live transitions after marking.  Note that one transition
   // is left, because 'o' still holds an instance of one transition target.
   int transitions_after =
-      CountMapTransitions(i_isolate, Map::cast(root->map().GetBackPointer()));
+      CountMapTransitions(i_isolate, Map::cast(root->map()->GetBackPointer()));
   CHECK_EQ(2, transitions_after);
 }
 
@@ -3316,12 +3285,12 @@ TEST(TransitionArrayShrinksDuringAllocToOnePropertyFound) {
 
   root = GetByName("root");
   AddPropertyTo(0, root, "prop9");
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(CcTest::heap());
 
   // Count number of live transitions after marking.  Note that one transition
   // is left, because 'o' still holds an instance of one transition target.
   int transitions_after =
-      CountMapTransitions(i_isolate, Map::cast(root->map().GetBackPointer()));
+      CountMapTransitions(i_isolate, Map::cast(root->map()->GetBackPointer()));
   CHECK_EQ(1, transitions_after);
 }
 #endif  // DEBUG
@@ -3353,9 +3322,10 @@ TEST(ReleaseOverReservedPages) {
   Factory* factory = isolate->factory();
   Heap* heap = isolate->heap();
   v8::HandleScope scope(CcTest::isolate());
+  // We need to invoke GC without stack, otherwise some objects may survive.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
   // Ensure that the young generation is empty.
-  CcTest::CollectGarbage(NEW_SPACE);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::EmptyNewSpaceUsingGC(heap);
   static const int number_of_test_pages = 20;
 
   // Prepare many pages with low live-bytes count.
@@ -3371,14 +3341,14 @@ TEST(ReleaseOverReservedPages) {
 
   // Triggering one GC will cause a lot of garbage to be discovered but
   // even spread across all allocated pages.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK_GE(overall_page_count, old_space->CountTotalPages());
 
   // Triggering subsequent GCs should cause at least half of the pages
   // to be released to the OS after at most two cycles.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK_GE(overall_page_count, old_space->CountTotalPages());
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK_GE(overall_page_count, old_space->CountTotalPages() * 2);
 
   // Triggering a last-resort GC should cause all pages to be released to the
@@ -3388,7 +3358,7 @@ TEST(ReleaseOverReservedPages) {
   // first page should be small in order to reduce memory used when the VM
   // boots, but if the 20 small arrays don't fit on the first page then that's
   // an indication that it is too small.
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
   CHECK_GE(initial_page_count, old_space->CountTotalPages());
 }
 
@@ -3432,7 +3402,7 @@ TEST(PrintSharedFunctionInfo) {
           CcTest::global()->Get(ctx, v8_str("g")).ToLocalChecked())));
 
   StdoutStream os;
-  g->shared().Print(os);
+  Print(g->shared(), os);
   os << std::endl;
 }
 #endif  // OBJECT_PRINT
@@ -3479,7 +3449,7 @@ TEST(IncrementalMarkingPreservesMonomorphicCallIC) {
   CHECK(feedback_vector->Get(feedback_helper.slot(slot2))->IsWeak());
 
   heap::SimulateIncrementalMarking(CcTest::heap());
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
   CHECK(feedback_vector->Get(feedback_helper.slot(slot1))->IsWeak());
   CHECK(feedback_vector->Get(feedback_helper.slot(slot2))->IsWeak());
@@ -3518,7 +3488,7 @@ TEST(IncrementalMarkingPreservesMonomorphicConstructor) {
   CHECK(vector->Get(FeedbackSlot(0))->IsWeakOrCleared());
 
   heap::SimulateIncrementalMarking(CcTest::heap());
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
   CHECK(vector->Get(FeedbackSlot(0))->IsWeakOrCleared());
 }
@@ -3544,7 +3514,7 @@ TEST(IncrementalMarkingPreservesMonomorphicIC) {
   CheckVectorIC(f, 0, InlineCacheState::MONOMORPHIC);
 
   heap::SimulateIncrementalMarking(CcTest::heap());
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
   CheckVectorIC(f, 0, InlineCacheState::MONOMORPHIC);
 }
@@ -3587,7 +3557,7 @@ TEST(IncrementalMarkingPreservesPolymorphicIC) {
 
   // Fire context dispose notification.
   heap::SimulateIncrementalMarking(CcTest::heap());
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
   CheckVectorIC(f, 0, InlineCacheState::POLYMORPHIC);
 }
@@ -3631,7 +3601,7 @@ TEST(ContextDisposeDoesntClearPolymorphicIC) {
   // Fire context dispose notification.
   CcTest::isolate()->ContextDisposedNotification();
   heap::SimulateIncrementalMarking(CcTest::heap());
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
   CheckVectorIC(f, 0, InlineCacheState::POLYMORPHIC);
 }
@@ -3676,7 +3646,7 @@ void ReleaseStackTraceDataTest(v8::Isolate* isolate, const char* source,
     v8::Local<v8::Context> ctx = isolate->GetCurrentContext();
     v8::Local<v8::String> source_string =
         v8::String::NewExternalOneByte(isolate, resource).ToLocalChecked();
-    CcTest::CollectAllAvailableGarbage(i_isolate);
+    heap::InvokeMemoryReducingMajorGCs(i_isolate->heap());
     v8::Script::Compile(ctx, source_string)
         .ToLocalChecked()
         ->Run(ctx)
@@ -3686,7 +3656,7 @@ void ReleaseStackTraceDataTest(v8::Isolate* isolate, const char* source,
   CHECK(!resource->IsDisposed());
 
   CompileRun(accessor);
-  CcTest::CollectAllAvailableGarbage(i_isolate);
+  heap::InvokeMemoryReducingMajorGCs(i_isolate->heap());
 
   // External source has been released.
   CHECK(resource->IsDisposed());
@@ -3778,7 +3748,7 @@ void DetailedErrorStackTraceTest(const char* src,
 }
 
 FixedArray ParametersOf(Handle<FixedArray> stack_trace, int frame_index) {
-  return CallSiteInfo::cast(stack_trace->get(frame_index)).parameters();
+  return CallSiteInfo::cast(stack_trace->get(frame_index))->parameters();
 }
 
 // * Test interpreted function error
@@ -3800,23 +3770,23 @@ TEST(DetailedErrorStackTrace) {
 
   DetailedErrorStackTraceTest(source, [](Handle<FixedArray> stack_trace) {
     FixedArray foo_parameters = ParametersOf(stack_trace, 0);
-    CHECK_EQ(foo_parameters.length(), 1);
-    CHECK(foo_parameters.get(0).IsSmi());
-    CHECK_EQ(Smi::ToInt(foo_parameters.get(0)), 42);
+    CHECK_EQ(foo_parameters->length(), 1);
+    CHECK(IsSmi(foo_parameters->get(0)));
+    CHECK_EQ(Smi::ToInt(foo_parameters->get(0)), 42);
 
     FixedArray bar_parameters = ParametersOf(stack_trace, 1);
-    CHECK_EQ(bar_parameters.length(), 2);
-    CHECK(bar_parameters.get(0).IsJSObject());
-    CHECK(bar_parameters.get(1).IsBoolean());
+    CHECK_EQ(bar_parameters->length(), 2);
+    CHECK(IsJSObject(bar_parameters->get(0)));
+    CHECK(IsBoolean(bar_parameters->get(1)));
     Handle<Object> foo = Handle<Object>::cast(GetByName("foo"));
-    CHECK_EQ(bar_parameters.get(0), *foo);
-    CHECK(!bar_parameters.get(1).BooleanValue(CcTest::i_isolate()));
+    CHECK_EQ(bar_parameters->get(0), *foo);
+    CHECK(!Object::BooleanValue(bar_parameters->get(1), CcTest::i_isolate()));
 
     FixedArray main_parameters = ParametersOf(stack_trace, 2);
-    CHECK_EQ(main_parameters.length(), 2);
-    CHECK(main_parameters.get(0).IsJSObject());
-    CHECK(main_parameters.get(1).IsUndefined());
-    CHECK_EQ(main_parameters.get(0), *foo);
+    CHECK_EQ(main_parameters->length(), 2);
+    CHECK(IsJSObject(main_parameters->get(0)));
+    CHECK(IsUndefined(main_parameters->get(1)));
+    CHECK_EQ(main_parameters->get(0), *foo);
   });
 }
 
@@ -3841,14 +3811,14 @@ TEST(DetailedErrorStackTraceInline) {
 
   DetailedErrorStackTraceTest(source, [](Handle<FixedArray> stack_trace) {
     FixedArray parameters_add = ParametersOf(stack_trace, 0);
-    CHECK_EQ(parameters_add.length(), 1);
-    CHECK(parameters_add.get(0).IsSmi());
-    CHECK_EQ(Smi::ToInt(parameters_add.get(0)), 42);
+    CHECK_EQ(parameters_add->length(), 1);
+    CHECK(IsSmi(parameters_add->get(0)));
+    CHECK_EQ(Smi::ToInt(parameters_add->get(0)), 42);
 
     FixedArray parameters_foo = ParametersOf(stack_trace, 1);
-    CHECK_EQ(parameters_foo.length(), 1);
-    CHECK(parameters_foo.get(0).IsSmi());
-    CHECK_EQ(Smi::ToInt(parameters_foo.get(0)), 41);
+    CHECK_EQ(parameters_foo->length(), 1);
+    CHECK(IsSmi(parameters_foo->get(0)));
+    CHECK_EQ(Smi::ToInt(parameters_foo->get(0)), 41);
   });
 }
 
@@ -3863,9 +3833,9 @@ TEST(DetailedErrorStackTraceBuiltinExit) {
   DetailedErrorStackTraceTest(source, [](Handle<FixedArray> stack_trace) {
     FixedArray parameters = ParametersOf(stack_trace, 0);
 
-    CHECK_EQ(parameters.length(), 2);
-    CHECK(parameters.get(1).IsSmi());
-    CHECK_EQ(Smi::ToInt(parameters.get(1)), 9999);
+    CHECK_EQ(parameters->length(), 2);
+    CHECK(IsSmi(parameters->get(1)));
+    CHECK_EQ(Smi::ToInt(parameters->get(1)), 9999);
   });
 }
 
@@ -3884,7 +3854,7 @@ TEST(Regress169928) {
   // and hence are incompatible with this test case.
   if (v8_flags.gc_global || v8_flags.stress_compaction ||
       v8_flags.stress_incremental_marking || v8_flags.single_generation ||
-      v8_flags.minor_mc)
+      v8_flags.minor_ms)
     return;
 
   // Prepare the environment
@@ -3911,7 +3881,7 @@ TEST(Regress169928) {
             .FromJust());
 
   // First make sure we flip spaces
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(CcTest::heap());
 
   // Allocate the object.
   Handle<FixedArray> array_data =
@@ -3956,7 +3926,8 @@ TEST(LargeObjectSlotRecording) {
   if (!v8_flags.incremental_marking) return;
   if (!v8_flags.compact) return;
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
@@ -3990,8 +3961,10 @@ TEST(LargeObjectSlotRecording) {
 
   heap::SimulateIncrementalMarking(heap, true);
 
-  // Move the evaucation candidate object.
-  CcTest::CollectAllGarbage();
+  // Move the evacuation candidate object.
+  // We need to invoke GC without stack, otherwise no compaction is performed.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+  heap::InvokeMajorGC(heap);
 
   // Verify that the pointers in the large object got updated.
   for (int i = 0; i < size; i += kStep) {
@@ -4037,7 +4010,7 @@ static void TestFillersFromPersistentHandles(bool promote) {
 
   if (promote) {
     // Age the array so it's ready for promotion on next GC.
-    CcTest::CollectGarbage(NEW_SPACE);
+    heap::InvokeMinorGC(heap);
   }
   CHECK(Heap::InYoungGeneration(*array));
 
@@ -4057,7 +4030,7 @@ static void TestFillersFromPersistentHandles(bool promote) {
       persistent_scope.Detach());
 
   // GC should retain the trimmed array but drop all of the three fillers.
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
   if (!v8_flags.single_generation) {
     if (promote) {
       CHECK(heap->InOldSpace(*tail));
@@ -4065,10 +4038,10 @@ static void TestFillersFromPersistentHandles(bool promote) {
       CHECK(Heap::InYoungGeneration(*tail));
     }
   }
-  CHECK_EQ(n - 6, (*tail).length());
-  CHECK(!filler_1->IsHeapObject());
-  CHECK(!filler_2->IsHeapObject());
-  CHECK(!filler_3->IsHeapObject());
+  CHECK_EQ(n - 6, tail->length());
+  CHECK(!IsHeapObject(*filler_1));
+  CHECK(!IsHeapObject(*filler_2));
+  CHECK(!IsHeapObject(*filler_3));
 }
 
 TEST(DoNotEvacuateFillersFromPersistentHandles) {
@@ -4095,7 +4068,7 @@ TEST(IncrementalMarkingStepMakesBigProgressWithLargeObjects) {
   IncrementalMarking* marking = CcTest::heap()->incremental_marking();
   if (marking->IsStopped()) {
     CcTest::heap()->StartIncrementalMarking(
-        i::Heap::kNoGCFlags, i::GarbageCollectionReason::kTesting);
+        i::GCFlag::kNoFlags, i::GarbageCollectionReason::kTesting);
   }
   heap::SimulateIncrementalMarking(CcTest::heap());
   CHECK(marking->IsMajorMarkingComplete());
@@ -4135,10 +4108,10 @@ TEST(DisableInlineAllocation) {
 
 static int AllocationSitesCount(Heap* heap) {
   int count = 0;
-  for (Object site = heap->allocation_sites_list(); site.IsAllocationSite();) {
+  for (Object site = heap->allocation_sites_list(); IsAllocationSite(site);) {
     AllocationSite cur = AllocationSite::cast(site);
-    CHECK(cur.HasWeakNext());
-    site = cur.weak_next();
+    CHECK(cur->HasWeakNext());
+    site = cur->weak_next();
     count++;
   }
   return count;
@@ -4147,22 +4120,21 @@ static int AllocationSitesCount(Heap* heap) {
 static int SlimAllocationSiteCount(Heap* heap) {
   int count = 0;
   for (Object weak_list = heap->allocation_sites_list();
-       weak_list.IsAllocationSite();) {
+       IsAllocationSite(weak_list);) {
     AllocationSite weak_cur = AllocationSite::cast(weak_list);
-    for (Object site = weak_cur.nested_site(); site.IsAllocationSite();) {
+    for (Object site = weak_cur->nested_site(); IsAllocationSite(site);) {
       AllocationSite cur = AllocationSite::cast(site);
-      CHECK(!cur.HasWeakNext());
-      site = cur.nested_site();
+      CHECK(!cur->HasWeakNext());
+      site = cur->nested_site();
       count++;
     }
-    weak_list = weak_cur.weak_next();
+    weak_list = weak_cur->weak_next();
   }
   return count;
 }
 
 TEST(EnsureAllocationSiteDependentCodesProcessed) {
-  if (v8_flags.always_turbofan || !v8_flags.turbofan ||
-      !V8_ALLOCATION_SITE_TRACKING_BOOL) {
+  if (v8_flags.always_turbofan || !V8_ALLOCATION_SITE_TRACKING_BOOL) {
     return;
   }
   v8_flags.allow_natives_syntax = true;
@@ -4207,11 +4179,11 @@ TEST(EnsureAllocationSiteDependentCodesProcessed) {
     DependentCode dependency = site->dependent_code();
     CHECK_NE(dependency,
              DependentCode::empty_dependent_code(ReadOnlyRoots(isolate)));
-    CHECK_EQ(dependency.length(), DependentCode::kSlotsPerEntry);
-    MaybeObject code = dependency.Get(0 + DependentCode::kCodeSlotOffset);
+    CHECK_EQ(dependency->length(), DependentCode::kSlotsPerEntry);
+    MaybeObject code = dependency->Get(0 + DependentCode::kCodeSlotOffset);
     CHECK(code->IsWeak());
-    CHECK_EQ(bar_handle->code(), Code::cast(code->GetHeapObjectAssumeWeak()));
-    Smi groups = dependency.Get(0 + DependentCode::kGroupsSlotOffset).ToSmi();
+    CHECK_EQ(bar_handle->code(), Code::cast(code.GetHeapObjectAssumeWeak()));
+    Smi groups = dependency->Get(0 + DependentCode::kGroupsSlotOffset).ToSmi();
     CHECK_EQ(static_cast<DependentCode::DependencyGroups>(groups.value()),
              DependentCode::kAllocationSiteTransitionChangedGroup |
                  DependentCode::kAllocationSiteTenuringChangedGroup);
@@ -4220,12 +4192,12 @@ TEST(EnsureAllocationSiteDependentCodesProcessed) {
   // Now make sure that a gc should get rid of the function, even though we
   // still have the allocation site alive.
   for (int i = 0; i < 4; i++) {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
   }
 
   // The site still exists because of our global handle, but the code is no
   // longer referred to by dependent_code().
-  CHECK(site->dependent_code().Get(0)->IsCleared());
+  CHECK(site->dependent_code()->Get(0)->IsCleared());
 }
 
 void CheckNumberOfAllocations(Heap* heap, const char* source,
@@ -4331,7 +4303,7 @@ TEST(AllocationSiteCreation) {
 }
 
 TEST(CellsInOptimizedCodeAreWeak) {
-  if (v8_flags.always_turbofan || !v8_flags.turbofan) return;
+  if (v8_flags.always_turbofan) return;
   v8_flags.allow_natives_syntax = true;
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
@@ -4370,7 +4342,7 @@ TEST(CellsInOptimizedCodeAreWeak) {
 
   // Now make sure that a gc should get rid of the function
   for (int i = 0; i < 4; i++) {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
   }
 
   CHECK(code->marked_for_deoptimization());
@@ -4379,7 +4351,7 @@ TEST(CellsInOptimizedCodeAreWeak) {
 
 
 TEST(ObjectsInOptimizedCodeAreWeak) {
-  if (v8_flags.always_turbofan || !v8_flags.turbofan) return;
+  if (v8_flags.always_turbofan) return;
   v8_flags.allow_natives_syntax = true;
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
@@ -4417,7 +4389,7 @@ TEST(ObjectsInOptimizedCodeAreWeak) {
 
   // Now make sure that a gc should get rid of the function
   for (int i = 0; i < 4; i++) {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
   }
 
   CHECK(code->marked_for_deoptimization());
@@ -4425,9 +4397,7 @@ TEST(ObjectsInOptimizedCodeAreWeak) {
 }
 
 TEST(NewSpaceObjectsInOptimizedCode) {
-  if (v8_flags.always_turbofan || !v8_flags.turbofan ||
-      v8_flags.single_generation)
-    return;
+  if (v8_flags.always_turbofan || v8_flags.single_generation) return;
   v8_flags.allow_natives_syntax = true;
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
@@ -4471,19 +4441,19 @@ TEST(NewSpaceObjectsInOptimizedCode) {
                                            .ToLocalChecked())));
 
     CHECK(Heap::InYoungGeneration(*foo));
-    CcTest::CollectGarbage(OLD_SPACE);
+    heap::InvokeMajorGC(CcTest::heap());
     CHECK(!Heap::InYoungGeneration(*foo));
 #ifdef VERIFY_HEAP
     HeapVerifier::VerifyHeap(CcTest::heap());
 #endif
-    CHECK(!bar->code().marked_for_deoptimization());
+    CHECK(!bar->code()->marked_for_deoptimization());
     code = handle(bar->code(), isolate);
     code = scope.CloseAndEscape(code);
   }
 
   // Now make sure that a gc should get rid of the function
   for (int i = 0; i < 4; i++) {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
   }
 
   CHECK(code->marked_for_deoptimization());
@@ -4491,7 +4461,7 @@ TEST(NewSpaceObjectsInOptimizedCode) {
 }
 
 TEST(ObjectsInEagerlyDeoptimizedCodeAreWeak) {
-  if (v8_flags.always_turbofan || !v8_flags.turbofan) return;
+  if (v8_flags.always_turbofan) return;
   v8_flags.allow_natives_syntax = true;
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
@@ -4532,7 +4502,7 @@ TEST(ObjectsInEagerlyDeoptimizedCodeAreWeak) {
 
   // Now make sure that a gc should get rid of the function
   for (int i = 0; i < 4; i++) {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
   }
 
   CHECK(code->marked_for_deoptimization());
@@ -4540,7 +4510,7 @@ TEST(ObjectsInEagerlyDeoptimizedCodeAreWeak) {
 }
 
 static Handle<InstructionStream> DummyOptimizedCode(Isolate* isolate) {
-  i::byte buffer[i::Assembler::kDefaultBufferSize];
+  uint8_t buffer[i::Assembler::kDefaultBufferSize];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   CodeDesc desc;
@@ -4561,7 +4531,7 @@ static Handle<InstructionStream> DummyOptimizedCode(Isolate* isolate) {
           .Build()
           ->instruction_stream(),
       isolate);
-  CHECK(code->IsInstructionStream());
+  CHECK(IsInstructionStream(*code));
   return code;
 }
 
@@ -4615,7 +4585,7 @@ TEST(WeakFunctionInConstructor) {
   }
   weak_ic_cleared = false;
   garbage.SetWeak(&garbage, &ClearWeakIC, v8::WeakCallbackType::kParameter);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
   CHECK(weak_ic_cleared);
 
   // We've determined the constructor in createObj has had it's weak cell
@@ -4627,7 +4597,7 @@ TEST(WeakFunctionInConstructor) {
     MaybeObject slot_value = feedback_vector->Get(FeedbackSlot(0));
     CHECK(slot_value->IsWeakOrCleared());
     if (slot_value->IsCleared()) break;
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
   }
 
   MaybeObject slot_value = feedback_vector->Get(FeedbackSlot(0));
@@ -4661,7 +4631,7 @@ void CheckWeakness(const char* source) {
   }
   weak_ic_cleared = false;
   garbage.SetWeak(&garbage, &ClearWeakIC, v8::WeakCallbackType::kParameter);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
   CHECK(weak_ic_cleared);
 }
 
@@ -4876,7 +4846,7 @@ TEST(MonomorphicStaysMonomorphicAfterGC) {
     v8::HandleScope new_scope(CcTest::isolate());
     CompileRun("(testIC())");
   }
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
   CheckIC(loadIC, 0, InlineCacheState::MONOMORPHIC);
   {
     v8::HandleScope new_scope(CcTest::isolate());
@@ -4915,7 +4885,7 @@ TEST(PolymorphicStaysPolymorphicAfterGC) {
     v8::HandleScope new_scope(CcTest::isolate());
     CompileRun("(testIC())");
   }
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
   CheckIC(loadIC, 0, InlineCacheState::POLYMORPHIC);
   {
     v8::HandleScope new_scope(CcTest::isolate());
@@ -4960,11 +4930,11 @@ TEST(AddInstructionChangesNewSpacePromotion) {
   v8::Local<v8::Object> global = CcTest::global();
   v8::Local<v8::Function> g = v8::Local<v8::Function>::Cast(
       global->Get(env.local(), v8_str("crash")).ToLocalChecked());
-  v8::Local<v8::Value> args1[] = {v8_num(1)};
+  v8::Local<v8::Value> info1[] = {v8_num(1)};
   heap->DisableInlineAllocation();
   heap->set_allocation_timeout(1);
-  g->Call(env.local(), global, 1, args1).ToLocalChecked();
-  CcTest::CollectAllGarbage();
+  g->Call(env.local(), global, 1, info1).ToLocalChecked();
+  heap::InvokeMajorGC(heap);
 }
 
 
@@ -4994,14 +4964,15 @@ TEST(CEntryStubOOM) {
 
 static void InterruptCallback357137(v8::Isolate* isolate, void* data) { }
 
-
-static void RequestInterrupt(const v8::FunctionCallbackInfo<v8::Value>& args) {
+static void RequestInterrupt(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CcTest::isolate()->RequestInterrupt(&InterruptCallback357137, nullptr);
 }
 
 HEAP_TEST(Regress538257) {
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   v8::Isolate::CreateParams create_params;
   // Set heap limits.
   create_params.constraints.set_max_young_generation_size_in_bytes(3 * MB);
@@ -5029,7 +5000,7 @@ HEAP_TEST(Regress538257) {
       heap::ForceEvacuationCandidate(Page::FromHeapObject(*objects[i]));
     }
     heap::SimulateFullSpace(old_space);
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
     // If we get this far, we've successfully aborted compaction. Any further
     // allocations might trigger OOM.
   }
@@ -5126,7 +5097,7 @@ TEST(Regress388880) {
   // that would cause crash.
   IncrementalMarking* marking = CcTest::heap()->incremental_marking();
   marking->Stop();
-  CcTest::heap()->StartIncrementalMarking(i::Heap::kNoGCFlags,
+  CcTest::heap()->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                           i::GarbageCollectionReason::kTesting);
   CHECK(marking->IsMarking());
 
@@ -5155,7 +5126,7 @@ TEST(Regress3631) {
       "weak_map");
   if (marking->IsStopped()) {
     CcTest::heap()->StartIncrementalMarking(
-        i::Heap::kNoGCFlags, i::GarbageCollectionReason::kTesting);
+        i::GCFlag::kNoFlags, i::GarbageCollectionReason::kTesting);
   }
   // Incrementally mark the backing store.
   Handle<JSReceiver> obj =
@@ -5169,7 +5140,7 @@ TEST(Regress3631) {
       "for (var i = 0; i < 50; i++) {"
       "  weak_map.set(future_keys[i], i);"
       "}");
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
 }
 
 
@@ -5179,14 +5150,14 @@ TEST(Regress442710) {
   Factory* factory = isolate->factory();
 
   HandleScope sc(isolate);
-  Handle<JSGlobalObject> global(CcTest::i_isolate()->context().global_object(),
+  Handle<JSGlobalObject> global(CcTest::i_isolate()->context()->global_object(),
                                 isolate);
   Handle<JSArray> array = factory->NewJSArray(2);
 
   Handle<String> name = factory->InternalizeUtf8String("testArray");
   Object::SetProperty(isolate, global, name, array).Check();
   CompileRun("testArray[0] = 1; testArray[1] = 2; testArray.shift();");
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(CcTest::heap());
 }
 
 
@@ -5197,7 +5168,7 @@ HEAP_TEST(NumberStringCacheSize) {
   if (!isolate->snapshot_available()) return;
   Heap* heap = isolate->heap();
   CHECK_EQ(Heap::kInitialNumberStringCacheSize * 2,
-           heap->number_string_cache().length());
+           heap->number_string_cache()->length());
 }
 
 
@@ -5223,14 +5194,14 @@ TEST(Regress3877) {
       "a.x = new cls();"
       "cls.prototype = null;");
   for (int i = 0; i < 4; i++) {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
   }
   // The map of a.x keeps prototype alive
   CHECK(!weak_prototype_holder->Get(0)->IsCleared());
   // Change the map of a.x and make the previous map garbage collectable.
   CompileRun("a.x.__proto__ = {};");
   for (int i = 0; i < 4; i++) {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
   }
   CHECK(weak_prototype_holder->Get(0)->IsCleared());
 }
@@ -5254,11 +5225,10 @@ void CheckMapRetainingFor(int n) {
   v8_flags.retain_maps_for_n_gc = n;
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
-  DisableConservativeStackScanningScopeForTesting no_stack_scanning(
-      CcTest::heap());
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
   v8::Local<v8::Context> ctx = v8::Context::New(CcTest::isolate());
   Handle<Context> context = Utils::OpenHandle(*ctx);
-  CHECK(context->IsNativeContext());
+  CHECK(IsNativeContext(*context));
   Handle<NativeContext> native_context = Handle<NativeContext>::cast(context);
   // This global is used to visit the object's constructor alive when starting
   // incremental marking. The native context keeps the constructor alive. The
@@ -5271,11 +5241,11 @@ void CheckMapRetainingFor(int n) {
   CHECK(array_with_map->Get(0)->IsWeak());
   for (int i = 0; i < n; i++) {
     heap::SimulateIncrementalMarking(heap);
-    CcTest::CollectGarbage(OLD_SPACE);
+    heap::InvokeMajorGC(heap);
   }
   CHECK(array_with_map->Get(0)->IsWeak());
   heap::SimulateIncrementalMarking(heap);
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
   CHECK(array_with_map->Get(0)->IsCleared());
 
   ctx->Exit();
@@ -5302,7 +5272,7 @@ TEST(RetainedMapsCleanup) {
   Heap* heap = isolate->heap();
   v8::Local<v8::Context> ctx = v8::Context::New(CcTest::isolate());
   Handle<Context> context = Utils::OpenHandle(*ctx);
-  CHECK(context->IsNativeContext());
+  CHECK(IsNativeContext(*context));
   Handle<NativeContext> native_context = Handle<NativeContext>::cast(context);
 
   ctx->Enter();
@@ -5310,7 +5280,7 @@ TEST(RetainedMapsCleanup) {
       AddRetainedMap(isolate, native_context);
   CHECK(array_with_map->Get(0)->IsWeak());
   heap->NotifyContextDisposed(true);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   ctx->Exit();
 
   CHECK_EQ(ReadOnlyRoots(heap).empty_weak_array_list(),
@@ -5330,20 +5300,20 @@ TEST(PreprocessStackTrace) {
       Object::GetProperty(isolate, exception, key).ToHandleChecked();
   Handle<Object> code =
       Object::GetElement(isolate, stack_trace, 3).ToHandleChecked();
-  CHECK(code->IsInstructionStream());
+  CHECK(IsInstructionStream(*code));
 
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
 
   Handle<Object> pos =
       Object::GetElement(isolate, stack_trace, 3).ToHandleChecked();
-  CHECK(pos->IsSmi());
+  CHECK(IsSmi(*pos));
 
   Handle<FixedArray> frame_array = Handle<FixedArray>::cast(stack_trace);
   int array_length = frame_array->length();
   for (int i = 0; i < array_length; i++) {
     Handle<Object> element =
         Object::GetElement(isolate, stack_trace, i).ToHandleChecked();
-    CHECK(!element->IsInstructionStream());
+    CHECK(!IsInstructionStream(*element));
   }
 }
 
@@ -5370,12 +5340,12 @@ TEST(NewSpaceAllocationCounter) {
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
   size_t counter1 = heap->NewSpaceAllocationCounter();
-  CcTest::CollectGarbage(OLD_SPACE);  // Ensure new space is empty.
+  heap::EmptyNewSpaceUsingGC(heap);  // Ensure new space is empty.
   const size_t kSize = 1024;
   AllocateInSpace(isolate, kSize, NEW_SPACE);
   size_t counter2 = heap->NewSpaceAllocationCounter();
   CHECK_EQ(kSize, counter2 - counter1);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
   size_t counter3 = heap->NewSpaceAllocationCounter();
   CHECK_EQ(0U, counter3 - counter2);
   // Test counter overflow.
@@ -5405,19 +5375,18 @@ TEST(OldSpaceAllocationCounter) {
   // Disable LAB, such that calculations with SizeOfObjects() and object size
   // are correct.
   heap->DisableInlineAllocation();
+  heap::EmptyNewSpaceUsingGC(heap);
   size_t counter1 = heap->OldGenerationAllocationCounter();
-  CcTest::CollectGarbage(NEW_SPACE);
-  CcTest::CollectGarbage(NEW_SPACE);
   const size_t kSize = 1024;
   AllocateInSpace(isolate, kSize, OLD_SPACE);
   size_t counter2 = heap->OldGenerationAllocationCounter();
   // TODO(ulan): replace all CHECK_LE with CHECK_EQ after v8:4148 is fixed.
   CHECK_LE(kSize, counter2 - counter1);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
   size_t counter3 = heap->OldGenerationAllocationCounter();
   CHECK_EQ(0u, counter3 - counter2);
   AllocateInSpace(isolate, kSize, OLD_SPACE);
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
   size_t counter4 = heap->OldGenerationAllocationCounter();
   CHECK_LE(kSize, counter4 - counter3);
   // Test counter overflow.
@@ -5433,15 +5402,14 @@ TEST(OldSpaceAllocationCounter) {
   }
 }
 
-
-static void CheckLeak(const v8::FunctionCallbackInfo<v8::Value>& args) {
+static void CheckLeak(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   Isolate* isolate = CcTest::i_isolate();
   Object message(
       *reinterpret_cast<Address*>(isolate->pending_message_address()));
-  CHECK(message.IsTheHole(isolate));
+  CHECK(IsTheHole(message, isolate));
 }
 
-
 TEST(MessageObjectLeak) {
   CcTest::InitializeVM();
   v8::Isolate* isolate = CcTest::isolate();
@@ -5472,28 +5440,27 @@ TEST(MessageObjectLeak) {
   CompileRun(test);
 }
 
-
 static void CheckEqualSharedFunctionInfos(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  Handle<Object> obj1 = v8::Utils::OpenHandle(*args[0]);
-  Handle<Object> obj2 = v8::Utils::OpenHandle(*args[1]);
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  Handle<Object> obj1 = v8::Utils::OpenHandle(*info[0]);
+  Handle<Object> obj2 = v8::Utils::OpenHandle(*info[1]);
   Handle<JSFunction> fun1 = Handle<JSFunction>::cast(obj1);
   Handle<JSFunction> fun2 = Handle<JSFunction>::cast(obj2);
   CHECK(fun1->shared() == fun2->shared());
 }
 
-
-static void RemoveCodeAndGC(const v8::FunctionCallbackInfo<v8::Value>& args) {
+static void RemoveCodeAndGC(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   Isolate* isolate = CcTest::i_isolate();
-  Handle<Object> obj = v8::Utils::OpenHandle(*args[0]);
+  Handle<Object> obj = v8::Utils::OpenHandle(*info[0]);
   Handle<JSFunction> fun = Handle<JSFunction>::cast(obj);
   // Bytecode is code too.
   SharedFunctionInfo::DiscardCompiled(isolate, handle(fun->shared(), isolate));
   fun->set_code(*BUILTIN_CODE(isolate, CompileLazy));
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
 }
 
-
 TEST(CanonicalSharedFunctionInfo) {
   CcTest::InitializeVM();
   v8::Isolate* isolate = CcTest::isolate();
@@ -5529,13 +5496,13 @@ TEST(ScriptIterator) {
   Heap* heap = CcTest::heap();
   LocalContext context;
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
   int script_count = 0;
   {
     HeapObjectIterator it(heap);
     for (HeapObject obj = it.Next(); !obj.is_null(); obj = it.Next()) {
-      if (obj.IsScript()) script_count++;
+      if (IsScript(obj)) script_count++;
     }
   }
 
@@ -5562,10 +5529,10 @@ AllocationResult HeapTester::AllocateByteArrayForTest(
     if (!allocation.To(&result)) return allocation;
   }
 
-  result.set_map_after_allocation(ReadOnlyRoots(heap).byte_array_map(),
-                                  SKIP_WRITE_BARRIER);
-  ByteArray::cast(result).set_length(length);
-  ByteArray::cast(result).clear_padding();
+  result->set_map_after_allocation(ReadOnlyRoots(heap).byte_array_map(),
+                                   SKIP_WRITE_BARRIER);
+  ByteArray::cast(result)->set_length(length);
+  ByteArray::cast(result)->clear_padding();
   return AllocationResult::FromObject(result);
 }
 
@@ -5597,7 +5564,7 @@ HEAP_TEST(Regress587004) {
   for (int i = 0; i < N; i++) {
     array->set(i, *number);
   }
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
   heap::SimulateFullSpace(heap->old_space());
   heap->RightTrimFixedArray(*array, N - 1);
   heap->EnsureSweepingCompleted(Heap::SweepingForcedFinalizationMode::kV8Only);
@@ -5609,27 +5576,28 @@ HEAP_TEST(Regress587004) {
   while (
       AllocateByteArrayForTest(heap, M, AllocationType::kOld).To(&byte_array)) {
     for (int j = 0; j < M; j++) {
-      byte_array.set(j, 0x31);
+      byte_array->set(j, 0x31);
     }
   }
   // Re-enable old space expansion to avoid OOM crash.
   heap->set_force_oom(false);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
 }
 
 HEAP_TEST(Regress589413) {
   if (!v8_flags.incremental_marking || v8_flags.stress_concurrent_allocation)
     return;
   v8_flags.stress_compaction = true;
-  v8_flags.manual_evacuation_candidates_selection = true;
-  v8_flags.parallel_compaction = false;
   ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
+  v8_flags.parallel_compaction = false;
   CcTest::InitializeVM();
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
   // Get the heap in clean state.
-  CcTest::CollectGarbage(OLD_SPACE);
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
+  heap::InvokeMajorGC(heap);
   Isolate* isolate = CcTest::i_isolate();
   Factory* factory = isolate->factory();
   // Fill the new space with byte arrays with elements looking like pointers.
@@ -5646,7 +5614,7 @@ HEAP_TEST(Regress589413) {
     if (Page::FromHeapObject(byte_array) != young_page) break;
 
     for (int j = 0; j < M; j++) {
-      byte_array.set(j, 0x31);
+      byte_array->set(j, 0x31);
     }
     // Add the array in root set.
     handle(byte_array, isolate);
@@ -5662,7 +5630,7 @@ HEAP_TEST(Regress589413) {
     AlwaysAllocateScopeForTesting always_allocate(isolate->heap());
 
     // Make sure the byte arrays will be promoted on the next GC.
-    CcTest::CollectGarbage(NEW_SPACE);
+    heap::InvokeMinorGC(heap);
     // This number is close to large free list category threshold.
     const int N = 0x3EEE;
 
@@ -5705,7 +5673,7 @@ HEAP_TEST(Regress589413) {
       for (size_t j = 0; j < arrays.size(); j++) {
         array = arrays[j];
         for (int i = 0; i < N; i++) {
-          array.set(i, *ec_obj);
+          array->set(i, *ec_obj);
         }
       }
     }
@@ -5718,7 +5686,7 @@ HEAP_TEST(Regress589413) {
 
   // Force allocation from the free list.
   heap->set_force_oom(true);
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
   heap->RemoveNearHeapLimitCallback(reset_oom, 0);
 }
 
@@ -5746,9 +5714,9 @@ TEST(Regress598319) {
         Handle<FixedArray> tmp = isolate->factory()->NewFixedArray(
             number_of_objects, AllocationType::kOld);
         root->set(0, *tmp);
-        for (int i = 0; i < get().length(); i++) {
+        for (int i = 0; i < get()->length(); i++) {
           tmp = isolate->factory()->NewFixedArray(100, AllocationType::kOld);
-          get().set(i, *tmp);
+          get()->set(i, *tmp);
         }
       }
       global_root.Reset(CcTest::isolate(),
@@ -5764,13 +5732,13 @@ TEST(Regress598319) {
     v8::Global<Value> global_root;
   } arr(isolate, kNumberOfObjects);
 
-  CHECK_EQ(arr.get().length(), kNumberOfObjects);
+  CHECK_EQ(arr.get()->length(), kNumberOfObjects);
   CHECK(heap->lo_space()->Contains(arr.get()));
   LargePage* page = LargePage::FromHeapObject(arr.get());
   CHECK_NOT_NULL(page);
 
   // GC to cleanup state
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
   if (heap->sweeping_in_progress()) {
     heap->EnsureSweepingCompleted(
         Heap::SweepingForcedFinalizationMode::kV8Only);
@@ -5780,33 +5748,35 @@ TEST(Regress598319) {
   IncrementalMarking* marking = heap->incremental_marking();
   MarkingState* marking_state = heap->marking_state();
   CHECK(marking_state->IsUnmarked(arr.get()));
-  for (int i = 0; i < arr.get().length(); i++) {
-    HeapObject arr_value = HeapObject::cast(arr.get().get(i));
+  for (int i = 0; i < arr.get()->length(); i++) {
+    HeapObject arr_value = HeapObject::cast(arr.get()->get(i));
     CHECK(marking_state->IsUnmarked(arr_value));
   }
 
   // Start incremental marking.
   CHECK(marking->IsMarking() || marking->IsStopped());
   if (marking->IsStopped()) {
-    heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+    heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                   i::GarbageCollectionReason::kTesting);
   }
   CHECK(marking->IsMarking());
 
   // Check that we have not marked the interesting array during root scanning.
-  for (int i = 0; i < arr.get().length(); i++) {
-    HeapObject arr_value = HeapObject::cast(arr.get().get(i));
+  for (int i = 0; i < arr.get()->length(); i++) {
+    HeapObject arr_value = HeapObject::cast(arr.get()->get(i));
     CHECK(marking_state->IsUnmarked(arr_value));
   }
 
   // Now we search for a state where we are in incremental marking and have
   // only partially marked the large object.
-  const double kSmallStepSizeInMs = 0.1;
+  static constexpr auto kSmallStepSize =
+      v8::base::TimeDelta::FromMillisecondsD(0.1);
+  static constexpr size_t kSmallMaxBytesToMark = 100;
   while (!marking->IsMajorMarkingComplete()) {
-    marking->AdvanceForTesting(kSmallStepSizeInMs);
+    marking->AdvanceForTesting(kSmallStepSize, kSmallMaxBytesToMark);
     ProgressBar& progress_bar = page->ProgressBar();
     if (progress_bar.IsEnabled() && progress_bar.Value() > 0) {
-      CHECK_NE(progress_bar.Value(), arr.get().Size());
+      CHECK_NE(progress_bar.Value(), arr.get()->Size());
       {
         // Shift by 1, effectively moving one white object across the progress
         // bar, meaning that we will miss marking it.
@@ -5823,16 +5793,17 @@ TEST(Regress598319) {
   MarkingBarrier::PublishAll(heap);
 
   // Finish marking with bigger steps to speed up test.
-  const double kLargeStepSizeInMs = 1000;
+  static constexpr auto kLargeStepSize =
+      v8::base::TimeDelta::FromMilliseconds(1000);
   while (!marking->IsMajorMarkingComplete()) {
-    marking->AdvanceForTesting(kLargeStepSizeInMs);
+    marking->AdvanceForTesting(kLargeStepSize);
   }
   CHECK(marking->IsMajorMarkingComplete());
 
   // All objects need to be black after marking. If a white object crossed the
   // progress bar, we would fail here.
-  for (int i = 0; i < arr.get().length(); i++) {
-    HeapObject arr_value = HeapObject::cast(arr.get().get(i));
+  for (int i = 0; i < arr.get()->length(); i++) {
+    HeapObject arr_value = HeapObject::cast(arr.get()->get(i));
     CHECK(arr_value.InReadOnlySpace() || marking_state->IsMarked(arr_value));
   }
 }
@@ -5840,7 +5811,7 @@ TEST(Regress598319) {
 Handle<FixedArray> ShrinkArrayAndCheckSize(Heap* heap, int length) {
   // Make sure there is no garbage and the compilation cache is empty.
   for (int i = 0; i < 5; i++) {
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
   }
   heap->EnsureSweepingCompleted(Heap::SweepingForcedFinalizationMode::kV8Only);
   // Disable LAB, such that calculations with SizeOfObjects() and object size
@@ -5856,7 +5827,7 @@ Handle<FixedArray> ShrinkArrayAndCheckSize(Heap* heap, int length) {
   // Shrinking does not change the space size immediately.
   CHECK_EQ(size_after_allocation, size_after_shrinking);
   // GC and sweeping updates the size to acccount for shrinking.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   heap->EnsureSweepingCompleted(Heap::SweepingForcedFinalizationMode::kV8Only);
   intptr_t size_after_gc = heap->SizeOfObjects();
   CHECK_EQ(size_after_gc, size_before_allocation + array->Size());
@@ -5889,7 +5860,7 @@ TEST(Regress615489) {
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
   Isolate* isolate = heap->isolate();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
   i::IncrementalMarking* marking = heap->incremental_marking();
   if (heap->sweeping_in_progress()) {
@@ -5898,7 +5869,7 @@ TEST(Regress615489) {
   }
   CHECK(marking->IsMarking() || marking->IsStopped());
   if (marking->IsStopped()) {
-    heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+    heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                   i::GarbageCollectionReason::kTesting);
   }
   CHECK(marking->IsMarking());
@@ -5908,13 +5879,13 @@ TEST(Regress615489) {
     v8::HandleScope inner(CcTest::isolate());
     isolate->factory()->NewFixedArray(500, AllocationType::kOld)->Size();
   }
-  const double kStepSizeInMs = 100;
+  static constexpr auto kStepSize = v8::base::TimeDelta::FromMilliseconds(100);
   while (!marking->IsMajorMarkingComplete()) {
-    marking->AdvanceForTesting(kStepSizeInMs);
+    marking->AdvanceForTesting(kStepSize);
   }
   CHECK(marking->IsMajorMarkingComplete());
   intptr_t size_before = heap->SizeOfObjects();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   intptr_t size_after = heap->SizeOfObjects();
   // Live size does not increase after garbage collection.
   CHECK_LE(size_after, size_before);
@@ -5936,15 +5907,16 @@ class StaticOneByteResource : public v8::String::ExternalOneByteStringResource {
 
 TEST(Regress631969) {
   if (!v8_flags.incremental_marking || v8_flags.separate_gc_phases) return;
-  v8_flags.manual_evacuation_candidates_selection = true;
-  v8_flags.parallel_compaction = false;
   ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
+  v8_flags.parallel_compaction = false;
   CcTest::InitializeVM();
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
   // Get the heap in clean state.
-  CcTest::CollectGarbage(OLD_SPACE);
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
+  heap::InvokeMajorGC(heap);
   Isolate* isolate = CcTest::i_isolate();
   Factory* factory = isolate->factory();
   // Allocate two strings in a fresh page and mark the page as evacuation
@@ -5959,22 +5931,22 @@ TEST(Regress631969) {
   heap::SimulateIncrementalMarking(heap, false);
 
   // Allocate a cons string and promote it to a fresh page in the old space.
-  heap::SimulateFullSpace(heap->old_space());
   Handle<String> s3 = factory->NewConsString(s1, s2).ToHandleChecked();
-  CcTest::CollectGarbage(NEW_SPACE);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::EmptyNewSpaceUsingGC(heap);
+
+  heap::SimulateIncrementalMarking(heap, false);
 
   // Finish incremental marking.
-  const double kStepSizeInMs = 100;
+  static constexpr auto kStepSize = v8::base::TimeDelta::FromMilliseconds(100);
   IncrementalMarking* marking = heap->incremental_marking();
   while (!marking->IsMajorMarkingComplete()) {
-    marking->AdvanceForTesting(kStepSizeInMs);
+    marking->AdvanceForTesting(kStepSize);
   }
 
   {
     StaticOneByteResource external_string("12345678901234");
     s3->MakeExternal(&external_string);
-    CcTest::CollectGarbage(OLD_SPACE);
+    heap::InvokeMajorGC(heap);
     // This avoids the GC from trying to free stack allocated resources.
     i::Handle<i::ExternalOneByteString>::cast(s3)->SetResource(isolate,
                                                                nullptr);
@@ -5988,7 +5960,7 @@ TEST(ContinuousRightTrimFixedArrayInBlackArea) {
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
   Isolate* isolate = CcTest::i_isolate();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
   i::IncrementalMarking* marking = heap->incremental_marking();
   if (heap->sweeping_in_progress()) {
@@ -5997,7 +5969,7 @@ TEST(ContinuousRightTrimFixedArrayInBlackArea) {
   }
   CHECK(marking->IsMarking() || marking->IsStopped());
   if (marking->IsStopped()) {
-    heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+    heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                   i::GarbageCollectionReason::kTesting);
   }
   CHECK(marking->IsMarking());
@@ -6016,9 +5988,9 @@ TEST(ContinuousRightTrimFixedArrayInBlackArea) {
   Page* page = Page::FromAddress(start_address);
   NonAtomicMarkingState* marking_state = heap->non_atomic_marking_state();
   CHECK(marking_state->IsMarked(*array));
-  CHECK(marking_state->bitmap(page)->AllBitsSetInRange(
-      page->AddressToMarkbitIndex(start_address),
-      page->AddressToMarkbitIndex(end_address)));
+  CHECK(page->marking_bitmap()->AllBitsSetInRange(
+      MarkingBitmap::AddressToIndex(start_address),
+      MarkingBitmap::LimitAddressToIndex(end_address)));
   CHECK(heap->old_space()->Contains(*array));
 
   // Trim it once by one word to make checking for white marking color uniform.
@@ -6026,8 +5998,7 @@ TEST(ContinuousRightTrimFixedArrayInBlackArea) {
   isolate->heap()->RightTrimFixedArray(*array, 1);
 
   HeapObject filler = HeapObject::FromAddress(previous);
-  CHECK(filler.IsFreeSpaceOrFiller());
-  CHECK(marking_state->IsImpossible(filler));
+  CHECK(IsFreeSpaceOrFiller(filler));
 
   // Trim 10 times by one, two, and three word.
   for (int i = 1; i <= 3; i++) {
@@ -6035,12 +6006,12 @@ TEST(ContinuousRightTrimFixedArrayInBlackArea) {
       previous -= kTaggedSize * i;
       isolate->heap()->RightTrimFixedArray(*array, i);
       filler = HeapObject::FromAddress(previous);
-      CHECK(filler.IsFreeSpaceOrFiller());
+      CHECK(IsFreeSpaceOrFiller(filler));
       CHECK(marking_state->IsUnmarked(filler));
     }
   }
 
-  heap::GcAndSweep(heap, OLD_SPACE);
+  heap::InvokeAtomicMajorGC(heap);
 }
 
 TEST(Regress618958) {
@@ -6063,7 +6034,7 @@ TEST(Regress618958) {
 }
 
 TEST(YoungGenerationLargeObjectAllocationScavenge) {
-  if (v8_flags.minor_mc) return;
+  if (v8_flags.minor_ms) return;
   CcTest::InitializeVM();
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
@@ -6080,7 +6051,7 @@ TEST(YoungGenerationLargeObjectAllocationScavenge) {
   Handle<Object> number = isolate->factory()->NewHeapNumber(123.456);
   array_small->set(0, *number);
 
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
 
   // After the first young generation GC array_small will be in the old
   // generation large object space.
@@ -6088,11 +6059,11 @@ TEST(YoungGenerationLargeObjectAllocationScavenge) {
   CHECK_EQ(LO_SPACE, chunk->owner_identity());
   CHECK(!chunk->InYoungGeneration());
 
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
 }
 
 TEST(YoungGenerationLargeObjectAllocationMarkCompact) {
-  if (v8_flags.minor_mc) return;
+  if (v8_flags.minor_ms) return;
   CcTest::InitializeVM();
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
@@ -6109,7 +6080,7 @@ TEST(YoungGenerationLargeObjectAllocationMarkCompact) {
   Handle<Object> number = isolate->factory()->NewHeapNumber(123.456);
   array_small->set(0, *number);
 
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
 
   // After the first full GC array_small will be in the old generation
   // large object space.
@@ -6117,11 +6088,11 @@ TEST(YoungGenerationLargeObjectAllocationMarkCompact) {
   CHECK_EQ(LO_SPACE, chunk->owner_identity());
   CHECK(!chunk->InYoungGeneration());
 
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
 }
 
 TEST(YoungGenerationLargeObjectAllocationReleaseScavenger) {
-  if (v8_flags.minor_mc) return;
+  if (v8_flags.minor_ms) return;
   CcTest::InitializeVM();
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
@@ -6138,7 +6109,7 @@ TEST(YoungGenerationLargeObjectAllocationReleaseScavenger) {
     }
   }
 
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
   CHECK(isolate->heap()->new_lo_space()->IsEmpty());
   CHECK_EQ(0, isolate->heap()->new_lo_space()->Size());
   CHECK_EQ(0, isolate->heap()->new_lo_space()->SizeOfObjects());
@@ -6165,7 +6136,7 @@ TEST(UncommitUnusedLargeObjectMemory) {
   array->Shrink(isolate, 1);
   CHECK(array->Size() < size_before);
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK(chunk->CommittedPhysicalMemory() < committed_memory_before);
   size_t shrinked_size = RoundUp(
       (array->address() - chunk->address()) + array->Size(), CommitPageSize());
@@ -6262,9 +6233,6 @@ TEST(RememberedSet_RemoveStaleOnScavenge) {
   }
   CHECK_EQ(3, GetRememberedSetSize<OLD_TO_NEW>(*arr));
 
-  // Run scavenger once so the young object becomes ready for promotion on the
-  // next pass.
-  CcTest::CollectGarbage(i::NEW_SPACE);
   arr->set(1, ReadOnlyRoots(CcTest::heap()).undefined_value());
   Handle<FixedArrayBase> tail =
       Handle<FixedArrayBase>(heap->LeftTrimFixedArray(*arr, 1), isolate);
@@ -6274,7 +6242,7 @@ TEST(RememberedSet_RemoveStaleOnScavenge) {
 
   // Run GC to promote the remaining young object and fixup the stale entries in
   // the remembered set.
-  CcTest::CollectGarbage(i::OLD_SPACE);
+  heap::EmptyNewSpaceUsingGC(heap);
   CHECK_EQ(0, GetRememberedSetSize<OLD_TO_NEW>(*tail));
 }
 
@@ -6284,6 +6252,9 @@ TEST(RememberedSet_RemoveStaleOnScavenge) {
 TEST(RememberedSet_OldToOld) {
   if (v8_flags.stress_incremental_marking) return;
   v8_flags.stress_concurrent_allocation = false;  // For SealCurrentObjects.
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   Factory* factory = isolate->factory();
@@ -6307,13 +6278,14 @@ TEST(RememberedSet_OldToOld) {
     factory->NewFixedArray(100, AllocationType::kOld);
   }
 
-  v8_flags.manual_evacuation_candidates_selection = true;
   heap::ForceEvacuationCandidate(Page::FromHeapObject(*arr));
   const auto prev_location = *arr;
 
   // This GC pass will evacuate the page with 'arr'/'ref' so it will have to
   // create OLD_TO_OLD remembered set to track the reference.
-  CcTest::CollectAllGarbage();
+  // We need to invoke GC without stack, otherwise no compaction is performed.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+  heap::InvokeMajorGC(heap);
   CHECK_NE(prev_location.ptr(), arr->ptr());
 }
 
@@ -6407,7 +6379,7 @@ HEAP_TEST(Regress670675) {
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
   Isolate* isolate = heap->isolate();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
   if (heap->sweeping_in_progress()) {
     heap->EnsureSweepingCompleted(
@@ -6432,8 +6404,7 @@ HEAP_TEST(Regress670675) {
                                         AllocationType::kOld);
     }
     if (marking->IsStopped()) break;
-    const double kStepSizeInMs = 1.0;
-    marking->AdvanceForTesting(kStepSizeInMs);
+    marking->AdvanceForTesting(v8::base::TimeDelta::FromMillisecondsD(0.1));
   }
   DCHECK(marking->IsStopped());
 }
@@ -6445,7 +6416,7 @@ HEAP_TEST(RegressMissingWriteBarrierInAllocate) {
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
   Isolate* isolate = heap->isolate();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   heap::SimulateIncrementalMarking(heap, false);
   Handle<Map> map;
   {
@@ -6462,12 +6433,12 @@ HEAP_TEST(RegressMissingWriteBarrierInAllocate) {
   // The object is black. If Factory::New sets the map without write-barrier,
   // then the map is white and will be freed prematurely.
   heap::SimulateIncrementalMarking(heap, true);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   if (heap->sweeping_in_progress()) {
     heap->EnsureSweepingCompleted(
         Heap::SweepingForcedFinalizationMode::kV8Only);
   }
-  CHECK(object->map().IsMap());
+  CHECK(IsMap(object->map()));
 }
 
 HEAP_TEST(MarkCompactEpochCounter) {
@@ -6477,14 +6448,14 @@ HEAP_TEST(MarkCompactEpochCounter) {
   v8::HandleScope scope(CcTest::isolate());
   Heap* heap = CcTest::heap();
   unsigned epoch0 = heap->mark_compact_collector()->epoch();
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
   unsigned epoch1 = heap->mark_compact_collector()->epoch();
   CHECK_EQ(epoch0 + 1, epoch1);
   heap::SimulateIncrementalMarking(heap, true);
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
   unsigned epoch2 = heap->mark_compact_collector()->epoch();
   CHECK_EQ(epoch1 + 1, epoch2);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
   unsigned epoch3 = heap->mark_compact_collector()->epoch();
   CHECK_EQ(epoch2, epoch3);
 }
@@ -6517,7 +6488,6 @@ void OOMCallback(const char* location, const OOMDetails&) {
   Heap* heap = oom_isolate->heap();
   size_t kSlack = heap->new_space() ? heap->MaxSemiSpaceSize() : 0;
   CHECK_LE(heap->OldGenerationCapacity(), kHeapLimit + kSlack);
-  CHECK_LE(heap->memory_allocator()->Size(), heap->MaxReserved() + kSlack);
   base::OS::ExitProcess(0);
 }
 
@@ -6560,7 +6530,7 @@ UNINITIALIZED_TEST(OutOfMemoryIneffectiveGC) {
   isolate->SetOOMErrorHandler(OOMCallback);
   Factory* factory = i_isolate->factory();
   Heap* heap = i_isolate->heap();
-  CcTest::CollectAllGarbage(i_isolate);
+  heap::InvokeMajorGC(heap);
   {
     HandleScope scope(i_isolate);
     while (heap->OldGenerationSizeOfObjects() <
@@ -6651,12 +6621,12 @@ HEAP_TEST(Regress779503) {
     // Delay sweeper tasks to allow the scavenger to sweep the page it is
     // currently scavenging.
     heap->delay_sweeper_tasks_for_testing_ = true;
-    CcTest::CollectGarbage(OLD_SPACE);
+    heap::InvokeMajorGC(heap);
     CHECK(!Heap::InYoungGeneration(*byte_array));
   }
   // Scavenging and sweeping the same page will crash as slots will be
   // overridden.
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
   heap->delay_sweeper_tasks_for_testing_ = false;
 }
 
@@ -6816,7 +6786,7 @@ UNINITIALIZED_TEST(RestoreHeapLimit) {
 }
 
 void HeapTester::UncommitUnusedMemory(Heap* heap) {
-  if (!v8_flags.minor_mc) SemiSpaceNewSpace::From(heap->new_space())->Shrink();
+  if (!v8_flags.minor_ms) SemiSpaceNewSpace::From(heap->new_space())->Shrink();
   heap->memory_allocator()->unmapper()->EnsureUnmappingCompleted();
 }
 
@@ -6848,7 +6818,8 @@ TEST(Regress8014) {
 TEST(Regress8617) {
   if (!v8_flags.incremental_marking) return;
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   LocalContext env;
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
@@ -6859,8 +6830,7 @@ TEST(Regress8617) {
       v8::Utils::OpenHandle(*CompileRun("function foo() { return 42; };"
                                         "foo;"));
   if (heap->InYoungGeneration(*foo)) {
-    CcTest::CollectGarbage(NEW_SPACE);
-    CcTest::CollectGarbage(NEW_SPACE);
+    heap::EmptyNewSpaceUsingGC(heap);
   }
   // Step 2. Create an object with a reference to foo in the descriptor array.
   CompileRun(
@@ -6868,7 +6838,7 @@ TEST(Regress8617) {
       "obj.method = foo;"
       "obj;");
   // Step 3. Make sure that foo moves during Mark-Compact.
-  Page* ec_page = Page::FromAddress(foo->ptr());
+  Page* ec_page = Page::FromAddress((*foo).ptr());
   heap::ForceEvacuationCandidate(ec_page);
   // Step 4. Start incremental marking.
   heap::SimulateIncrementalMarking(heap, false);
@@ -6880,21 +6850,20 @@ TEST(Regress8617) {
   CompileRun("obj.bar = 10;");
   // Step 6. Promote the descriptor array to old space. During promotion
   // the Scavenger will not record the slot of foo in the descriptor array.
-  CcTest::CollectGarbage(NEW_SPACE);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::EmptyNewSpaceUsingGC(heap);
   // Step 7. Complete the Mark-Compact.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   // Step 8. Use the descriptor for foo, which contains a stale pointer.
   CompileRun("obj.method()");
 }
 
 HEAP_TEST(MemoryReducerActivationForSmallHeaps) {
-  if (v8_flags.single_generation) return;
+  if (v8_flags.single_generation || !v8_flags.memory_reducer) return;
   ManualGCScope manual_gc_scope;
   LocalContext env;
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
-  CHECK_EQ(heap->memory_reducer()->state_.id(), MemoryReducer::kDone);
+  CHECK_EQ(heap->memory_reducer()->state_.id(), MemoryReducer::kUninit);
   HandleScope scope(isolate);
   const size_t kActivationThreshold = 1 * MB;
   size_t initial_capacity = heap->OldGenerationCapacity();
@@ -6924,7 +6893,6 @@ TEST(CodeObjectRegistry) {
 
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
-  CodePageCollectionMemoryModificationScopeForTesting code_scope(heap);
 
   Handle<InstructionStream> code1;
   HandleScope outer_scope(heap->isolate());
@@ -6942,7 +6910,7 @@ TEST(CodeObjectRegistry) {
     CHECK(MemoryChunk::FromHeapObject(*code1)->Contains(code1->address()));
     CHECK(MemoryChunk::FromHeapObject(*code2)->Contains(code2->address()));
   }
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
   CHECK(MemoryChunk::FromHeapObject(*code1)->Contains(code1->address()));
   CHECK(MemoryChunk::FromAddress(code2_address)->Contains(code2_address));
 }
@@ -6953,8 +6921,7 @@ TEST(Regress9701) {
   CcTest::InitializeVM();
   Heap* heap = CcTest::heap();
   // Start with an empty new space.
-  CcTest::CollectGarbage(NEW_SPACE);
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::EmptyNewSpaceUsingGC(heap);
 
   int mark_sweep_count_before = heap->ms_count();
   // Allocate many short living array buffers.
@@ -6988,7 +6955,7 @@ UNINITIALIZED_TEST(HugeHeapLimit) {
 #endif
 
 UNINITIALIZED_TEST(HeapLimit) {
-  uint64_t kMemoryGB = 15;
+  uint64_t kMemoryGB = 8;
   v8::Isolate::CreateParams create_params;
   create_params.array_buffer_allocator = CcTest::array_buffer_allocator();
   create_params.constraints.ConfigureDefaults(kMemoryGB * GB, kMemoryGB * GB);
@@ -7015,10 +6982,10 @@ TEST(GarbageCollectionWithLocalHeap) {
 
   LocalHeap* local_heap = CcTest::i_isolate()->main_thread_local_heap();
 
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(CcTest::heap());
 
   { ParkedScope parked_scope(local_heap); }
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(CcTest::heap());
 }
 
 TEST(Regress10698) {
@@ -7041,7 +7008,7 @@ TEST(Regress10698) {
   // Step 4. Set the filler at the end of the first array.
   // It will have an impossible markbit pattern because the second markbit
   // will be taken from the second array.
-  filler.set_map_after_allocation(*factory->one_pointer_filler_map());
+  filler->set_map_after_allocation(*factory->one_pointer_filler_map());
 }
 
 class TestAllocationTracker : public HeapObjectAllocationTracker {
@@ -7068,13 +7035,14 @@ HEAP_TEST(CodeLargeObjectSpace) {
   TestAllocationTracker allocation_tracker{size_in_bytes};
   heap->AddHeapObjectAllocationTracker(&allocation_tracker);
 
-  CodePageCollectionMemoryModificationScopeForTesting code_scope(heap);
   HeapObject obj;
   {
     AllocationResult allocation = heap->AllocateRaw(
         size_in_bytes, AllocationType::kCode, AllocationOrigin::kRuntime);
     CHECK(allocation.To(&obj));
     CHECK_EQ(allocation.ToAddress(), allocation_tracker.address());
+    ThreadIsolation::RegisterInstructionStreamAllocation(obj.address(),
+                                                         size_in_bytes);
 
     heap->CreateFillerObjectAt(obj.address(), size_in_bytes);
   }
@@ -7102,13 +7070,14 @@ UNINITIALIZED_HEAP_TEST(CodeLargeObjectSpace64k) {
     TestAllocationTracker allocation_tracker{size_in_bytes};
     heap->AddHeapObjectAllocationTracker(&allocation_tracker);
 
-    CodePageCollectionMemoryModificationScopeForTesting code_scope(heap);
     HeapObject obj;
     {
       AllocationResult allocation = heap->AllocateRaw(
           size_in_bytes, AllocationType::kCode, AllocationOrigin::kRuntime);
       CHECK(allocation.To(&obj));
       CHECK_EQ(allocation.ToAddress(), allocation_tracker.address());
+      ThreadIsolation::RegisterInstructionStreamAllocation(obj.address(),
+                                                           size_in_bytes);
 
       heap->CreateFillerObjectAt(obj.address(), size_in_bytes);
     }
@@ -7124,13 +7093,14 @@ UNINITIALIZED_HEAP_TEST(CodeLargeObjectSpace64k) {
     TestAllocationTracker allocation_tracker{size_in_bytes};
     heap->AddHeapObjectAllocationTracker(&allocation_tracker);
 
-    CodePageCollectionMemoryModificationScopeForTesting code_scope(heap);
     HeapObject obj;
     {
       AllocationResult allocation = heap->AllocateRaw(
           size_in_bytes, AllocationType::kCode, AllocationOrigin::kRuntime);
       CHECK(allocation.To(&obj));
       CHECK_EQ(allocation.ToAddress(), allocation_tracker.address());
+      ThreadIsolation::RegisterInstructionStreamAllocation(obj.address(),
+                                                           size_in_bytes);
 
       heap->CreateFillerObjectAt(obj.address(), size_in_bytes);
     }
@@ -7202,7 +7172,7 @@ TEST(Regress10900) {
   Isolate* isolate = CcTest::i_isolate();
   Heap* heap = isolate->heap();
   HandleScope handle_scope(isolate);
-  i::byte buffer[i::Assembler::kDefaultBufferSize];
+  uint8_t buffer[i::Assembler::kDefaultBufferSize];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
 #if V8_TARGET_ARCH_ARM64
@@ -7217,8 +7187,6 @@ TEST(Regress10900) {
   CodeDesc desc;
   masm.GetCode(isolate, &desc);
   {
-    CodePageCollectionMemoryModificationScopeForTesting code_scope(
-        isolate->heap());
     Handle<Code> code;
     for (int i = 0; i < 100; i++) {
       // Generate multiple code pages.
@@ -7227,7 +7195,7 @@ TEST(Regress10900) {
   }
   // Force garbage collection that compacts code pages and triggers
   // an assertion in Isolate::AddCodeMemoryRange before the bug fix.
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(heap);
 }
 
 namespace {
@@ -7250,7 +7218,7 @@ TEST(Regress11181) {
       std::memory_order_relaxed);
   v8::HandleScope scope(CcTest::isolate());
   GenerateGarbage();
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
 }
 
 TEST(LongTaskStatsFullAtomic) {
@@ -7262,7 +7230,7 @@ TEST(LongTaskStatsFullAtomic) {
   CHECK_EQ(0u, v8::metrics::LongTaskStats::Get(isolate)
                    .gc_full_atomic_wall_clock_duration_us);
   for (int i = 0; i < 10; ++i) {
-    CcTest::CollectAllAvailableGarbage();
+    heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   }
   CHECK_LT(0u, v8::metrics::LongTaskStats::Get(isolate)
                    .gc_full_atomic_wall_clock_duration_us);
@@ -7282,7 +7250,7 @@ TEST(LongTaskStatsFullIncremental) {
                    .gc_full_incremental_wall_clock_duration_us);
   for (int i = 0; i < 10; ++i) {
     heap::SimulateIncrementalMarking(CcTest::heap());
-    CcTest::CollectAllAvailableGarbage();
+    heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   }
   CHECK_LT(0u, v8::metrics::LongTaskStats::Get(isolate)
                    .gc_full_incremental_wall_clock_duration_us);
@@ -7302,7 +7270,7 @@ TEST(LongTaskStatsYoung) {
       0u,
       v8::metrics::LongTaskStats::Get(isolate).gc_young_wall_clock_duration_us);
   for (int i = 0; i < 10; ++i) {
-    CcTest::CollectGarbage(NEW_SPACE);
+    heap::InvokeMinorGC(CcTest::heap());
   }
   CHECK_LT(
       0u,
diff --git a/deps/v8/test/cctest/heap/test-invalidated-slots.cc b/deps/v8/test/cctest/heap/test-invalidated-slots.cc
deleted file mode 100644
index 97eabfb5c1c24a..00000000000000
--- a/deps/v8/test/cctest/heap/test-invalidated-slots.cc
+++ /dev/null
@@ -1,417 +0,0 @@
-// Copyright 2017 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include <stdlib.h>
-
-#include "src/heap/heap-inl.h"
-#include "src/heap/heap.h"
-#include "src/heap/invalidated-slots-inl.h"
-#include "src/heap/invalidated-slots.h"
-#include "src/heap/memory-chunk.h"
-#include "src/init/v8.h"
-#include "test/cctest/cctest.h"
-#include "test/cctest/heap/heap-tester.h"
-#include "test/cctest/heap/heap-utils.h"
-
-namespace v8 {
-namespace internal {
-namespace heap {
-
-Page* HeapTester::AllocateByteArraysOnPage(
-    Heap* heap, std::vector<ByteArray>* byte_arrays) {
-  PauseAllocationObserversScope pause_observers(heap);
-  const int kLength = 256 - ByteArray::kHeaderSize;
-  const int kSize = ByteArray::SizeFor(kLength);
-  CHECK_EQ(kSize, 256);
-  PagedSpace* old_space = heap->old_space();
-  Page* page;
-  // Fill a page with byte arrays.
-  {
-    AlwaysAllocateScopeForTesting always_allocate(heap);
-    heap::SimulateFullSpace(old_space);
-    ByteArray byte_array;
-    CHECK(AllocateByteArrayForTest(heap, kLength, AllocationType::kOld)
-              .To(&byte_array));
-    byte_arrays->push_back(byte_array);
-    page = Page::FromHeapObject(byte_array);
-    size_t n = page->area_size() / kSize;
-    for (size_t i = 1; i < n; i++) {
-      CHECK(AllocateByteArrayForTest(heap, kLength, AllocationType::kOld)
-                .To(&byte_array));
-      byte_arrays->push_back(byte_array);
-      CHECK_EQ(page, Page::FromHeapObject(byte_array));
-    }
-  }
-  CHECK_NULL(page->invalidated_slots<OLD_TO_OLD>());
-  return page;
-}
-
-HEAP_TEST(InvalidatedSlotsNoInvalidatedRanges) {
-  v8_flags.stress_concurrent_allocation =
-      false;  // For AllocateByteArraysOnPage.
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-  InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToOld(
-      page, InvalidatedSlotsFilter::LivenessCheck::kNo);
-  for (ByteArray byte_array : byte_arrays) {
-    Address start = byte_array.address() + ByteArray::kHeaderSize;
-    Address end = byte_array.address() + byte_array.Size();
-    for (Address addr = start; addr < end; addr += kTaggedSize) {
-      CHECK(filter.IsValid(addr));
-    }
-  }
-}
-
-HEAP_TEST(InvalidatedSlotsSomeInvalidatedRanges) {
-  v8_flags.stress_concurrent_allocation =
-      false;  // For AllocateByteArraysOnPage.
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-  // Register every second byte arrays as invalidated.
-  for (size_t i = 0; i < byte_arrays.size(); i += 2) {
-    ByteArray byte_array = byte_arrays[i];
-    page->RegisterObjectWithInvalidatedSlots<OLD_TO_OLD>(byte_array,
-                                                         byte_array.Size());
-  }
-  InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToOld(
-      page, InvalidatedSlotsFilter::LivenessCheck::kNo);
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    Address start = byte_array.address() + ByteArray::kHeaderSize;
-    Address end = byte_array.address() + byte_array.Size();
-    for (Address addr = start; addr < end; addr += kTaggedSize) {
-      if (i % 2 == 0) {
-        CHECK(!filter.IsValid(addr));
-      } else {
-        CHECK(filter.IsValid(addr));
-      }
-    }
-  }
-}
-
-HEAP_TEST(InvalidatedSlotsAllInvalidatedRanges) {
-  v8_flags.stress_concurrent_allocation =
-      false;  // For AllocateByteArraysOnPage.
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-  // Register the all byte arrays as invalidated.
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    page->RegisterObjectWithInvalidatedSlots<OLD_TO_OLD>(byte_array,
-                                                         byte_array.Size());
-  }
-  InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToOld(
-      page, InvalidatedSlotsFilter::LivenessCheck::kNo);
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    Address start = byte_array.address() + ByteArray::kHeaderSize;
-    Address end = byte_array.address() + byte_array.Size();
-    for (Address addr = start; addr < end; addr += kTaggedSize) {
-      CHECK(!filter.IsValid(addr));
-    }
-  }
-}
-
-HEAP_TEST(InvalidatedSlotsAfterTrimming) {
-  ManualGCScope manual_gc_scope;
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-  // Register the all byte arrays as invalidated.
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    page->RegisterObjectWithInvalidatedSlots<OLD_TO_OLD>(
-        byte_arrays[i], ByteArray::kHeaderSize);
-  }
-  // Trim byte arrays and check that the slots outside the byte arrays are
-  // considered invalid if the old space page was swept.
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    Address start = byte_array.address() + ByteArray::kHeaderSize;
-    Address end = byte_array.address() + byte_array.Size();
-    heap->RightTrimFixedArray(byte_array, byte_array.length());
-
-    InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToOld(
-        page, InvalidatedSlotsFilter::LivenessCheck::kNo);
-    for (Address addr = start; addr < end; addr += kTaggedSize) {
-      CHECK_EQ(filter.IsValid(addr), page->SweepingDone());
-    }
-  }
-}
-
-HEAP_TEST(InvalidatedSlotsEvacuationCandidate) {
-  ManualGCScope manual_gc_scope;
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-  page->MarkEvacuationCandidate();
-  // Register the all byte arrays as invalidated.
-  // This should be no-op because the page is marked as evacuation
-  // candidate.
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    page->RegisterObjectWithInvalidatedSlots<OLD_TO_OLD>(byte_array,
-                                                         byte_array.Size());
-  }
-  // All slots must still be valid.
-  InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToOld(
-      page, InvalidatedSlotsFilter::LivenessCheck::kNo);
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    Address start = byte_array.address() + ByteArray::kHeaderSize;
-    Address end = byte_array.address() + byte_array.Size();
-    for (Address addr = start; addr < end; addr += kTaggedSize) {
-      CHECK(filter.IsValid(addr));
-    }
-  }
-}
-
-HEAP_TEST(InvalidatedSlotsResetObjectRegression) {
-  v8_flags.stress_concurrent_allocation =
-      false;  // For AllocateByteArraysOnPage.
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-  // Ensure that the first array has smaller size then the rest.
-  heap->RightTrimFixedArray(byte_arrays[0], byte_arrays[0].length() - 8);
-  // Register the all byte arrays as invalidated.
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    page->RegisterObjectWithInvalidatedSlots<OLD_TO_OLD>(byte_array,
-                                                         byte_array.Size());
-  }
-  // All slots must still be invalid.
-  InvalidatedSlotsFilter filter = InvalidatedSlotsFilter::OldToOld(
-      page, InvalidatedSlotsFilter::LivenessCheck::kNo);
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    Address start = byte_array.address() + ByteArray::kHeaderSize;
-    Address end = byte_array.address() + byte_array.Size();
-    for (Address addr = start; addr < end; addr += kTaggedSize) {
-      CHECK(!filter.IsValid(addr));
-    }
-  }
-}
-
-Handle<FixedArray> AllocateArrayOnFreshPage(Isolate* isolate,
-                                            PagedSpace* old_space, int length) {
-  AlwaysAllocateScopeForTesting always_allocate(isolate->heap());
-  heap::SimulateFullSpace(old_space);
-  return isolate->factory()->NewFixedArray(length, AllocationType::kOld);
-}
-
-Handle<FixedArray> AllocateArrayOnEvacuationCandidate(Isolate* isolate,
-                                                      PagedSpace* old_space,
-                                                      int length) {
-  Handle<FixedArray> object =
-      AllocateArrayOnFreshPage(isolate, old_space, length);
-  heap::ForceEvacuationCandidate(Page::FromHeapObject(*object));
-  return object;
-}
-
-HEAP_TEST(InvalidatedSlotsRightTrimFixedArray) {
-  if (!v8_flags.incremental_marking) return;
-  v8_flags.manual_evacuation_candidates_selection = true;
-  v8_flags.parallel_compaction = false;
-  ManualGCScope manual_gc_scope;
-  CcTest::InitializeVM();
-  Isolate* isolate = CcTest::i_isolate();
-  Factory* factory = isolate->factory();
-  Heap* heap = CcTest::heap();
-  HandleScope scope(isolate);
-  PagedSpace* old_space = heap->old_space();
-  // Allocate a dummy page to be swept be the sweeper during evacuation.
-  AllocateArrayOnFreshPage(isolate, old_space, 1);
-  Handle<FixedArray> evacuated =
-      AllocateArrayOnEvacuationCandidate(isolate, old_space, 1);
-  Handle<FixedArray> trimmed = AllocateArrayOnFreshPage(isolate, old_space, 10);
-  heap::SimulateIncrementalMarking(heap);
-  for (int i = 1; i < trimmed->length(); i++) {
-    trimmed->set(i, *evacuated);
-  }
-  {
-    HandleScope new_scope(isolate);
-    Handle<HeapObject> dead = factory->NewFixedArray(1);
-    for (int i = 1; i < trimmed->length(); i++) {
-      trimmed->set(i, *dead);
-    }
-    heap->RightTrimFixedArray(*trimmed, trimmed->length() - 1);
-  }
-  CcTest::CollectGarbage(i::NEW_SPACE);
-  CcTest::CollectGarbage(i::OLD_SPACE);
-}
-
-HEAP_TEST(InvalidatedSlotsRightTrimLargeFixedArray) {
-  if (!v8_flags.incremental_marking) return;
-  v8_flags.manual_evacuation_candidates_selection = true;
-  v8_flags.parallel_compaction = false;
-  ManualGCScope manual_gc_scope;
-  CcTest::InitializeVM();
-  Isolate* isolate = CcTest::i_isolate();
-  Factory* factory = isolate->factory();
-  Heap* heap = CcTest::heap();
-  HandleScope scope(isolate);
-  PagedSpace* old_space = heap->old_space();
-  // Allocate a dummy page to be swept be the sweeper during evacuation.
-  AllocateArrayOnFreshPage(isolate, old_space, 1);
-  Handle<FixedArray> evacuated =
-      AllocateArrayOnEvacuationCandidate(isolate, old_space, 1);
-  Handle<FixedArray> trimmed;
-  {
-    AlwaysAllocateScopeForTesting always_allocate(heap);
-    trimmed = factory->NewFixedArray(
-        kMaxRegularHeapObjectSize / kTaggedSize + 100, AllocationType::kOld);
-    DCHECK(MemoryChunk::FromHeapObject(*trimmed)->InLargeObjectSpace());
-  }
-  heap::SimulateIncrementalMarking(heap);
-  for (int i = 1; i < trimmed->length(); i++) {
-    trimmed->set(i, *evacuated);
-  }
-  {
-    HandleScope new_scope(isolate);
-    Handle<HeapObject> dead = factory->NewFixedArray(1);
-    for (int i = 1; i < trimmed->length(); i++) {
-      trimmed->set(i, *dead);
-    }
-    heap->RightTrimFixedArray(*trimmed, trimmed->length() - 1);
-  }
-  CcTest::CollectGarbage(i::NEW_SPACE);
-  CcTest::CollectGarbage(i::OLD_SPACE);
-}
-
-HEAP_TEST(InvalidatedSlotsFastToSlow) {
-  if (!v8_flags.incremental_marking) return;
-  v8_flags.manual_evacuation_candidates_selection = true;
-  v8_flags.parallel_compaction = false;
-  ManualGCScope manual_gc_scope;
-  CcTest::InitializeVM();
-  Isolate* isolate = CcTest::i_isolate();
-  Factory* factory = isolate->factory();
-  Heap* heap = CcTest::heap();
-  PagedSpace* old_space = heap->old_space();
-
-  HandleScope scope(isolate);
-
-  Handle<String> name = factory->InternalizeUtf8String("TestObject");
-  Handle<String> prop_name1 = factory->InternalizeUtf8String("prop1");
-  Handle<String> prop_name2 = factory->InternalizeUtf8String("prop2");
-  Handle<String> prop_name3 = factory->InternalizeUtf8String("prop3");
-  // Allocate a dummy page to be swept be the sweeper during evacuation.
-  AllocateArrayOnFreshPage(isolate, old_space, 1);
-  Handle<FixedArray> evacuated =
-      AllocateArrayOnEvacuationCandidate(isolate, old_space, 1);
-  // Allocate a dummy page to ensure that the JSObject is allocated on
-  // a fresh page.
-  AllocateArrayOnFreshPage(isolate, old_space, 1);
-  Handle<JSObject> obj;
-  {
-    AlwaysAllocateScopeForTesting always_allocate(heap);
-    Handle<JSFunction> function = factory->NewFunctionForTesting(name);
-    function->shared().set_expected_nof_properties(3);
-    obj = factory->NewJSObject(function, AllocationType::kOld);
-  }
-  // Start incremental marking.
-  heap::SimulateIncrementalMarking(heap);
-  // Set properties to point to the evacuation candidate.
-  Object::SetProperty(isolate, obj, prop_name1, evacuated).Check();
-  Object::SetProperty(isolate, obj, prop_name2, evacuated).Check();
-  Object::SetProperty(isolate, obj, prop_name3, evacuated).Check();
-
-  {
-    HandleScope new_scope(isolate);
-    Handle<HeapObject> dead = factory->NewFixedArray(1);
-    Object::SetProperty(isolate, obj, prop_name1, dead).Check();
-    Object::SetProperty(isolate, obj, prop_name2, dead).Check();
-    Object::SetProperty(isolate, obj, prop_name3, dead).Check();
-    Handle<Map> map(obj->map(), isolate);
-    Handle<Map> normalized_map =
-        Map::Normalize(isolate, map, CLEAR_INOBJECT_PROPERTIES, "testing");
-    JSObject::MigrateToMap(isolate, obj, normalized_map);
-  }
-  CcTest::CollectGarbage(i::NEW_SPACE);
-  CcTest::CollectGarbage(i::OLD_SPACE);
-}
-
-HEAP_TEST(InvalidatedSlotsCleanupFull) {
-  ManualGCScope manual_gc_scope;
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-  // Register all byte arrays as invalidated.
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    page->RegisterObjectWithInvalidatedSlots<OLD_TO_NEW>(byte_array,
-                                                         byte_array.Size());
-  }
-
-  // Mark full page as free
-  InvalidatedSlotsCleanup cleanup = InvalidatedSlotsCleanup::OldToNew(page);
-  cleanup.Free(page->area_start(), page->area_end());
-
-  // After cleanup there should be no invalidated objects on page left
-  CHECK(page->invalidated_slots<OLD_TO_NEW>()->empty());
-}
-
-HEAP_TEST(InvalidatedSlotsCleanupEachObject) {
-  ManualGCScope manual_gc_scope;
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-  // Register all byte arrays as invalidated.
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    ByteArray byte_array = byte_arrays[i];
-    page->RegisterObjectWithInvalidatedSlots<OLD_TO_NEW>(byte_array,
-                                                         byte_array.Size());
-  }
-
-  // Mark each object as free on page
-  InvalidatedSlotsCleanup cleanup = InvalidatedSlotsCleanup::OldToNew(page);
-
-  for (size_t i = 0; i < byte_arrays.size(); i++) {
-    Address free_start = byte_arrays[i].address();
-    Address free_end = free_start + byte_arrays[i].Size();
-    cleanup.Free(free_start, free_end);
-  }
-
-  // After cleanup there should be no invalidated objects on page left
-  CHECK(page->invalidated_slots<OLD_TO_NEW>()->empty());
-}
-
-HEAP_TEST(InvalidatedSlotsCleanupRightTrim) {
-  ManualGCScope manual_gc_scope;
-  CcTest::InitializeVM();
-  Heap* heap = CcTest::heap();
-  std::vector<ByteArray> byte_arrays;
-  Page* page = AllocateByteArraysOnPage(heap, &byte_arrays);
-
-  CHECK_GT(byte_arrays.size(), 1);
-  ByteArray& invalidated = byte_arrays[1];
-
-  heap->RightTrimFixedArray(invalidated, invalidated.length() - 8);
-  page->RegisterObjectWithInvalidatedSlots<OLD_TO_NEW>(invalidated,
-                                                       invalidated.Size());
-
-  // Free memory at end of invalidated object
-  InvalidatedSlotsCleanup cleanup = InvalidatedSlotsCleanup::OldToNew(page);
-  Address free_start = invalidated.address() + invalidated.Size();
-  cleanup.Free(free_start, page->area_end());
-
-  // After cleanup the invalidated object should be smaller
-  InvalidatedSlots* invalidated_slots = page->invalidated_slots<OLD_TO_NEW>();
-  CHECK_EQ(invalidated_slots->size(), 1);
-}
-
-}  // namespace heap
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/cctest/heap/test-iterators.cc b/deps/v8/test/cctest/heap/test-iterators.cc
deleted file mode 100644
index 6afcfcaf695a18..00000000000000
--- a/deps/v8/test/cctest/heap/test-iterators.cc
+++ /dev/null
@@ -1,121 +0,0 @@
-// Copyright 2019 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "include/v8-object.h"
-#include "src/api/api-inl.h"
-#include "src/execution/isolate.h"
-#include "src/heap/combined-heap.h"
-#include "src/heap/heap.h"
-#include "src/heap/read-only-heap.h"
-#include "src/heap/read-only-spaces.h"
-#include "src/objects/heap-object.h"
-#include "src/objects/objects.h"
-#include "src/roots/roots-inl.h"
-#include "test/cctest/cctest.h"
-
-namespace v8 {
-namespace internal {
-namespace heap {
-
-namespace {
-template <typename T>
-void TestIterator(T it) {
-  while (!it.Next().is_null()) {
-  }
-  for (int i = 0; i < 20; i++) {
-    CHECK(it.Next().is_null());
-  }
-}
-}  // namespace
-
-TEST(HeapObjectIteratorNullPastEnd) {
-  TestIterator<HeapObjectIterator>(
-      static_cast<v8::internal::HeapObjectIterator>(CcTest::heap()));
-}
-
-TEST(ReadOnlyHeapObjectIteratorNullPastEnd) {
-  TestIterator<ReadOnlyHeapObjectIterator>(
-      static_cast<v8::internal::ReadOnlyHeapObjectIterator>(
-          CcTest::read_only_heap()));
-}
-
-TEST(CombinedHeapObjectIteratorNullPastEnd) {
-  TestIterator<CombinedHeapObjectIterator>(CcTest::heap());
-}
-
-namespace {
-// An arbitrary object guaranteed to live on the non-read-only heap.
-Object CreateWritableObject() {
-  return *v8::Utils::OpenHandle(*v8::Object::New(CcTest::isolate()));
-}
-}  // namespace
-
-TEST(ReadOnlyHeapObjectIterator) {
-  CcTest::InitializeVM();
-  HandleScope handle_scope(CcTest::i_isolate());
-  const Object sample_object = CreateWritableObject();
-  ReadOnlyHeapObjectIterator iterator(CcTest::read_only_heap());
-
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
-       obj = iterator.Next()) {
-    CHECK(ReadOnlyHeap::Contains(obj));
-    CHECK(!CcTest::heap()->Contains(obj));
-    CHECK_NE(sample_object, obj);
-  }
-}
-
-TEST(HeapObjectIterator) {
-  CcTest::InitializeVM();
-  HandleScope handle_scope(CcTest::i_isolate());
-  const Object sample_object = CreateWritableObject();
-  HeapObjectIterator iterator(CcTest::heap());
-  bool seen_sample_object = false;
-
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
-       obj = iterator.Next()) {
-    CHECK_IMPLIES(!v8_flags.enable_third_party_heap,
-                  !ReadOnlyHeap::Contains(obj));
-    CHECK(CcTest::heap()->Contains(obj));
-    if (sample_object.SafeEquals(obj)) seen_sample_object = true;
-  }
-  CHECK(seen_sample_object);
-}
-
-TEST(CombinedHeapObjectIterator) {
-  CcTest::InitializeVM();
-  HandleScope handle_scope(CcTest::i_isolate());
-  const Object sample_object = CreateWritableObject();
-  CombinedHeapObjectIterator iterator(CcTest::heap());
-  bool seen_sample_object = false;
-
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
-       obj = iterator.Next()) {
-    CHECK(IsValidHeapObject(CcTest::heap(), obj));
-    if (sample_object.SafeEquals(obj)) seen_sample_object = true;
-  }
-  CHECK(seen_sample_object);
-}
-
-TEST(PagedSpaceIterator) {
-  Heap* const heap = CcTest::heap();
-  PagedSpaceIterator iterator(heap);
-  CHECK_EQ(iterator.Next(), reinterpret_cast<PagedSpace*>(heap->old_space()));
-  CHECK_EQ(iterator.Next(), reinterpret_cast<PagedSpace*>(heap->code_space()));
-  for (int i = 0; i < 20; i++) {
-    CHECK_NULL(iterator.Next());
-  }
-}
-
-TEST(SpaceIterator) {
-  auto* const read_only_space = CcTest::read_only_heap()->read_only_space();
-  for (SpaceIterator it(CcTest::heap()); it.HasNext();) {
-    // ReadOnlySpace is not actually a Space but is instead a BaseSpace, but
-    // ensure it's not been inserted incorrectly.
-    CHECK_NE(it.Next(), reinterpret_cast<BaseSpace*>(read_only_space));
-  }
-}
-
-}  // namespace heap
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/cctest/heap/test-mark-compact.cc b/deps/v8/test/cctest/heap/test-mark-compact.cc
index 6dd9ec471aac59..0dd9f97d8c049b 100644
--- a/deps/v8/test/cctest/heap/test-mark-compact.cc
+++ b/deps/v8/test/cctest/heap/test-mark-compact.cc
@@ -27,6 +27,8 @@
 
 #include <stdlib.h>
 
+#include "src/common/globals.h"
+
 #ifdef __linux__
 #include <errno.h>
 #include <fcntl.h>
@@ -41,6 +43,7 @@
 #include "src/handles/global-handles.h"
 #include "src/heap/mark-compact-inl.h"
 #include "src/heap/mark-compact.h"
+#include "src/heap/marking-inl.h"
 #include "src/init/v8.h"
 #include "src/objects/objects-inl.h"
 #include "test/cctest/cctest.h"
@@ -67,8 +70,8 @@ TEST(Promotion) {
 
     // Array should be in the new space.
     CHECK(heap->InSpace(*array, NEW_SPACE));
-    CcTest::CollectAllGarbage();
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(heap);
+    heap::InvokeMajorGC(heap);
     CHECK(heap->InSpace(*array, OLD_SPACE));
   }
 }
@@ -77,11 +80,11 @@ TEST(Promotion) {
 // allocation failure.
 AllocationResult HeapTester::AllocateMapForTest(Isolate* isolate) {
   Heap* heap = isolate->heap();
-  HeapObject obj;
+  Tagged<HeapObject> obj;
   AllocationResult alloc = heap->AllocateRaw(Map::kSize, AllocationType::kMap);
   if (!alloc.To(&obj)) return alloc;
-  obj.set_map_after_allocation(ReadOnlyRoots(heap).meta_map(),
-                               SKIP_WRITE_BARRIER);
+  obj->set_map_after_allocation(ReadOnlyRoots(heap).meta_map(),
+                                SKIP_WRITE_BARRIER);
   return AllocationResult::FromObject(isolate->factory()->InitializeMap(
       Map::cast(obj), JS_OBJECT_TYPE, JSObject::kHeaderSize,
       TERMINAL_FAST_ELEMENTS_KIND, 0, heap));
@@ -93,16 +96,16 @@ AllocationResult HeapTester::AllocateFixedArrayForTest(
     Heap* heap, int length, AllocationType allocation) {
   DCHECK(length >= 0 && length <= FixedArray::kMaxLength);
   int size = FixedArray::SizeFor(length);
-  HeapObject obj;
+  Tagged<HeapObject> obj;
   {
     AllocationResult result = heap->AllocateRaw(size, allocation);
     if (!result.To(&obj)) return result;
   }
-  obj.set_map_after_allocation(ReadOnlyRoots(heap).fixed_array_map(),
-                               SKIP_WRITE_BARRIER);
-  FixedArray array = FixedArray::cast(obj);
-  array.set_length(length);
-  MemsetTagged(array.data_start(), ReadOnlyRoots(heap).undefined_value(),
+  obj->set_map_after_allocation(ReadOnlyRoots(heap).fixed_array_map(),
+                                SKIP_WRITE_BARRIER);
+  Tagged<FixedArray> array = FixedArray::cast(obj);
+  array->set_length(length);
+  MemsetTagged(array->data_start(), ReadOnlyRoots(heap).undefined_value(),
                length);
   return AllocationResult::FromObject(array);
 }
@@ -116,10 +119,10 @@ HEAP_TEST(MarkCompactCollector) {
   Factory* factory = isolate->factory();
 
   v8::HandleScope sc(CcTest::isolate());
-  Handle<JSGlobalObject> global(isolate->context().global_object(), isolate);
+  Handle<JSGlobalObject> global(isolate->context()->global_object(), isolate);
 
   // call mark-compact when heap is empty
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
 
   AllocationResult allocation;
   if (!v8_flags.single_generation) {
@@ -129,7 +132,7 @@ HEAP_TEST(MarkCompactCollector) {
       allocation =
           AllocateFixedArrayForTest(heap, arraysize, AllocationType::kYoung);
     } while (!allocation.IsFailure());
-    CcTest::CollectGarbage(NEW_SPACE);
+    heap::InvokeMinorGC(heap);
     AllocateFixedArrayForTest(heap, arraysize, AllocationType::kYoung)
         .ToObjectChecked();
   }
@@ -138,7 +141,7 @@ HEAP_TEST(MarkCompactCollector) {
   do {
     allocation = AllocateMapForTest(isolate);
   } while (!allocation.IsFailure());
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
   AllocateMapForTest(isolate).ToObjectChecked();
 
   { HandleScope scope(isolate);
@@ -150,14 +153,14 @@ HEAP_TEST(MarkCompactCollector) {
     factory->NewJSObject(function);
   }
 
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
 
   { HandleScope scope(isolate);
     Handle<String> func_name = factory->InternalizeUtf8String("theFunction");
     CHECK(Just(true) == JSReceiver::HasOwnProperty(isolate, global, func_name));
     Handle<Object> func_value =
         Object::GetProperty(isolate, global, func_name).ToHandleChecked();
-    CHECK(func_value->IsJSFunction());
+    CHECK(IsJSFunction(*func_value));
     Handle<JSFunction> function = Handle<JSFunction>::cast(func_value);
     Handle<JSObject> obj = factory->NewJSObject(function);
 
@@ -168,14 +171,14 @@ HEAP_TEST(MarkCompactCollector) {
     Object::SetProperty(isolate, obj, prop_name, twenty_three).Check();
   }
 
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::InvokeMajorGC(heap);
 
   { HandleScope scope(isolate);
     Handle<String> obj_name = factory->InternalizeUtf8String("theObject");
     CHECK(Just(true) == JSReceiver::HasOwnProperty(isolate, global, obj_name));
     Handle<Object> object =
         Object::GetProperty(isolate, global, obj_name).ToHandleChecked();
-    CHECK(object->IsJSObject());
+    CHECK(IsJSObject(*object));
     Handle<String> prop_name = factory->InternalizeUtf8String("theSlot");
     CHECK_EQ(*Object::GetProperty(isolate, object, prop_name).ToHandleChecked(),
              Smi::FromInt(23));
@@ -204,7 +207,7 @@ HEAP_TEST(DoNotEvacuatePinnedPages) {
   CHECK(heap->InSpace(*handles.front(), OLD_SPACE));
   page->SetFlag(MemoryChunk::PINNED);
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   heap->EnsureSweepingCompleted(Heap::SweepingForcedFinalizationMode::kV8Only);
 
   // The pinned flag should prevent the page from moving.
@@ -214,7 +217,7 @@ HEAP_TEST(DoNotEvacuatePinnedPages) {
 
   page->ClearFlag(MemoryChunk::PINNED);
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   heap->EnsureSweepingCompleted(Heap::SweepingForcedFinalizationMode::kV8Only);
 
   // `compact_on_every_full_gc` ensures that this page is an evacuation
@@ -342,7 +345,7 @@ TEST(Regress5829) {
   }
   CHECK(marking->IsMarking() || marking->IsStopped());
   if (marking->IsStopped()) {
-    heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+    heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                   i::GarbageCollectionReason::kTesting);
   }
   CHECK(marking->IsMarking());
@@ -355,10 +358,8 @@ TEST(Regress5829) {
   heap->CreateFillerObjectAt(old_end - kTaggedSize, kTaggedSize);
   heap->old_space()->FreeLinearAllocationArea();
   Page* page = Page::FromAddress(array->address());
-  MarkingState* marking_state = heap->marking_state();
-  for (auto object_and_size :
-       LiveObjectRange<kGreyObjects>(page, marking_state->bitmap(page))) {
-    CHECK(!object_and_size.first.IsFreeSpaceOrFiller());
+  for (auto object_and_size : LiveObjectRange(page)) {
+    CHECK(!IsFreeSpaceOrFiller(object_and_size.first));
   }
 }
 
diff --git a/deps/v8/test/cctest/heap/test-memory-measurement.cc b/deps/v8/test/cctest/heap/test-memory-measurement.cc
index 8ad42475148adf..c0f582cea499ea 100644
--- a/deps/v8/test/cctest/heap/test-memory-measurement.cc
+++ b/deps/v8/test/cctest/heap/test-memory-measurement.cc
@@ -186,10 +186,7 @@ class MockMeasureMemoryDelegate : public v8::MeasureMemoryDelegate {
  public:
   bool ShouldMeasure(v8::Local<v8::Context> context) override { return true; }
 
-  void MeasurementComplete(
-      const std::vector<std::pair<v8::Local<v8::Context>, size_t>>&
-          context_sizes_in_bytes,
-      size_t unattributed_size_in_bytes) override {
+  void MeasurementComplete(Result result) override {
     // Empty.
   }
 };
diff --git a/deps/v8/test/cctest/heap/test-spaces.cc b/deps/v8/test/cctest/heap/test-spaces.cc
index 5ed8781d13b3cf..d4dcf619b3daa4 100644
--- a/deps/v8/test/cctest/heap/test-spaces.cc
+++ b/deps/v8/test/cctest/heap/test-spaces.cc
@@ -331,7 +331,6 @@ TEST(PagedNewSpace) {
       CcTest::heap()->InitialSemiSpaceSize(), allocation_info);
   CHECK(new_space->MaximumCapacity());
   CHECK(new_space->EnsureCurrentCapacity());
-  CHECK_LT(0, new_space->Capacity());
   CHECK_LT(0, new_space->TotalCapacity());
 
   AllocationResult allocation_result;
@@ -378,10 +377,10 @@ TEST(OldLargeObjectSpace) {
 
   int lo_size = Page::kPageSize;
 
-  Object obj = lo->AllocateRaw(lo_size).ToObjectChecked();
-  CHECK(obj.IsHeapObject());
+  Tagged<Object> obj = lo->AllocateRaw(lo_size).ToObjectChecked();
+  CHECK(IsHeapObject(obj));
 
-  HeapObject ho = HeapObject::cast(obj);
+  Tagged<HeapObject> ho = HeapObject::cast(obj);
 
   CHECK(lo->Contains(HeapObject::cast(obj)));
 
@@ -468,28 +467,29 @@ TEST(SizeOfInitialHeap) {
 }
 #endif  // DEBUG
 
-static HeapObject AllocateUnaligned(NewSpace* space, int size) {
+static Tagged<HeapObject> AllocateUnaligned(NewSpace* space, int size) {
   AllocationResult allocation = space->AllocateRaw(size, kTaggedAligned);
   CHECK(!allocation.IsFailure());
-  HeapObject filler;
+  Tagged<HeapObject> filler;
   CHECK(allocation.To(&filler));
   space->heap()->CreateFillerObjectAt(filler.address(), size);
   return filler;
 }
 
-static HeapObject AllocateUnaligned(PagedSpace* space, int size) {
+static Tagged<HeapObject> AllocateUnaligned(PagedSpace* space, int size) {
   AllocationResult allocation = space->AllocateRaw(size, kTaggedAligned);
   CHECK(!allocation.IsFailure());
-  HeapObject filler;
+  Tagged<HeapObject> filler;
   CHECK(allocation.To(&filler));
   space->heap()->CreateFillerObjectAt(filler.address(), size);
   return filler;
 }
 
-static HeapObject AllocateUnaligned(OldLargeObjectSpace* space, int size) {
+static Tagged<HeapObject> AllocateUnaligned(OldLargeObjectSpace* space,
+                                            int size) {
   AllocationResult allocation = space->AllocateRaw(size);
   CHECK(!allocation.IsFailure());
-  HeapObject filler;
+  Tagged<HeapObject> filler;
   CHECK(allocation.To(&filler));
   return filler;
 }
@@ -613,7 +613,7 @@ UNINITIALIZED_TEST(InlineAllocationObserverCadence) {
 
     // Clear out any pre-existing garbage to make the test consistent
     // across snapshot/no-snapshot builds.
-    CcTest::CollectAllGarbage(i_isolate);
+    heap::InvokeMajorGC(i_isolate->heap());
 
     NewSpace* new_space = i_isolate->heap()->new_space();
 
@@ -655,7 +655,7 @@ HEAP_TEST(Regress777177) {
     heap::SimulateFullSpace(old_space);
     AllocationResult result =
         old_space->AllocateRaw(filler_size, kTaggedAligned);
-    HeapObject obj = result.ToObjectChecked();
+    Tagged<HeapObject> obj = result.ToObjectChecked();
     heap->CreateFillerObjectAt(obj.address(), filler_size);
   }
 
@@ -664,7 +664,7 @@ HEAP_TEST(Regress777177) {
     // top_on_previous_step_ to the next page.
     AllocationResult result =
         old_space->AllocateRaw(max_object_size, kTaggedAligned);
-    HeapObject obj = result.ToObjectChecked();
+    Tagged<HeapObject> obj = result.ToObjectChecked();
     // Simulate allocation folding moving the top pointer back.
     old_space->SetTopAndLimit(obj.address(), old_space->limit(),
                               old_space->limit());
@@ -674,7 +674,7 @@ HEAP_TEST(Regress777177) {
     // This triggers assert in crbug.com/777177.
     AllocationResult result =
         old_space->AllocateRaw(filler_size, kTaggedAligned);
-    HeapObject obj = result.ToObjectChecked();
+    Tagged<HeapObject> obj = result.ToObjectChecked();
     heap->CreateFillerObjectAt(obj.address(), filler_size);
   }
   old_space->RemoveAllocationObserver(&observer);
@@ -704,7 +704,7 @@ HEAP_TEST(Regress791582) {
   {
     AllocationResult result =
         new_space->AllocateRaw(until_page_end, kTaggedAligned);
-    HeapObject obj = result.ToObjectChecked();
+    Tagged<HeapObject> obj = result.ToObjectChecked();
     heap->CreateFillerObjectAt(obj.address(), until_page_end);
     // Simulate allocation folding moving the top pointer back.
     *new_space->allocation_top_address() = obj.address();
@@ -713,7 +713,7 @@ HEAP_TEST(Regress791582) {
   {
     // This triggers assert in crbug.com/791582
     AllocationResult result = new_space->AllocateRaw(256, kTaggedAligned);
-    HeapObject obj = result.ToObjectChecked();
+    Tagged<HeapObject> obj = result.ToObjectChecked();
     heap->CreateFillerObjectAt(obj.address(), 256);
   }
   new_space->RemoveAllocationObserver(&observer);
@@ -739,8 +739,9 @@ TEST(ShrinkPageToHighWaterMarkFreeSpaceEnd) {
   old_space->FreeLinearAllocationArea();
   old_space->ResetFreeList();
 
-  HeapObject filler = HeapObject::FromAddress(array->address() + array->Size());
-  CHECK(filler.IsFreeSpace());
+  Tagged<HeapObject> filler =
+      HeapObject::FromAddress(array->address() + array->Size());
+  CHECK(IsFreeSpace(filler));
   size_t shrunk = old_space->ShrinkPageToHighWaterMark(page);
   size_t should_have_shrunk = RoundDown(
       static_cast<size_t>(MemoryChunkLayout::AllocatableMemoryInDataPage() -
@@ -792,8 +793,9 @@ TEST(ShrinkPageToHighWaterMarkOneWordFiller) {
   old_space->FreeLinearAllocationArea();
   old_space->ResetFreeList();
 
-  HeapObject filler = HeapObject::FromAddress(array->address() + array->Size());
-  CHECK_EQ(filler.map(),
+  Tagged<HeapObject> filler =
+      HeapObject::FromAddress(array->address() + array->Size());
+  CHECK_EQ(filler->map(),
            ReadOnlyRoots(CcTest::heap()).one_pointer_filler_map());
 
   size_t shrunk = old_space->ShrinkPageToHighWaterMark(page);
@@ -820,8 +822,9 @@ TEST(ShrinkPageToHighWaterMarkTwoWordFiller) {
   old_space->FreeLinearAllocationArea();
   old_space->ResetFreeList();
 
-  HeapObject filler = HeapObject::FromAddress(array->address() + array->Size());
-  CHECK_EQ(filler.map(),
+  Tagged<HeapObject> filler =
+      HeapObject::FromAddress(array->address() + array->Size());
+  CHECK_EQ(filler->map(),
            ReadOnlyRoots(CcTest::heap()).two_pointer_filler_map());
 
   size_t shrunk = old_space->ShrinkPageToHighWaterMark(page);
@@ -953,7 +956,7 @@ TEST(ReadOnlySpaceMetrics_AlignedAllocations) {
 
   int alignment = USE_ALLOCATION_ALIGNMENT_BOOL ? kDoubleSize : kTaggedSize;
 
-  HeapObject object =
+  Tagged<HeapObject> object =
       faked_space->AllocateRaw(object_size, kDoubleAligned).ToObjectChecked();
   CHECK_EQ(object.address() % alignment, 0);
   object =
diff --git a/deps/v8/test/cctest/heap/test-unmapper.cc b/deps/v8/test/cctest/heap/test-unmapper.cc
index c31a2ad227974f..3bff0da71033fe 100644
--- a/deps/v8/test/cctest/heap/test-unmapper.cc
+++ b/deps/v8/test/cctest/heap/test-unmapper.cc
@@ -52,7 +52,7 @@ UNINITIALIZED_TEST(EagerUnmappingInCollectAllAvailableGarbage) {
     Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
     Heap* heap = i_isolate->heap();
     i::heap::SimulateFullSpace(heap->old_space());
-    CcTest::CollectAllAvailableGarbage(i_isolate);
+    i::heap::InvokeMemoryReducingMajorGCs(heap);
     CHECK_EQ(0, heap->memory_allocator()->unmapper()->NumberOfChunks());
   }
   isolate->Dispose();
diff --git a/deps/v8/test/cctest/heap/test-weak-references.cc b/deps/v8/test/cctest/heap/test-weak-references.cc
index 8e24eb8bb167b9..647625aa54d9f1 100644
--- a/deps/v8/test/cctest/heap/test-weak-references.cc
+++ b/deps/v8/test/cctest/heap/test-weak-references.cc
@@ -40,8 +40,8 @@ TEST(WeakReferencesBasic) {
   if (!v8_flags.single_generation) CHECK(Heap::InYoungGeneration(*lh));
 
   MaybeObject code_object = lh->data1();
-  CHECK(code_object->IsSmi());
-  CcTest::CollectAllGarbage();
+  CHECK(IsSmi(code_object));
+  heap::InvokeMajorGC(CcTest::heap());
   CHECK(!Heap::InYoungGeneration(*lh));
   CHECK_EQ(code_object, lh->data1());
 
@@ -55,20 +55,20 @@ TEST(WeakReferencesBasic) {
     assm.GetCode(isolate, &desc);
     Handle<Code> code =
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
-    CHECK(code->IsCode());
+    CHECK(IsCode(*code));
 
     lh->set_data1(HeapObjectReference::Weak(*code));
-    HeapObject code_heap_object;
-    CHECK(lh->data1()->GetHeapObjectIfWeak(&code_heap_object));
+    Tagged<HeapObject> code_heap_object;
+    CHECK(lh->data1().GetHeapObjectIfWeak(&code_heap_object));
     CHECK_EQ(*code, code_heap_object);
 
-    CcTest::CollectAllGarbage();
+    heap::InvokeMajorGC(CcTest::heap());
 
-    CHECK(lh->data1()->GetHeapObjectIfWeak(&code_heap_object));
+    CHECK(lh->data1().GetHeapObjectIfWeak(&code_heap_object));
     CHECK_EQ(*code, code_heap_object);
   }  // code will go out of scope.
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
   CHECK(lh->data1()->IsCleared());
 }
 
@@ -77,7 +77,8 @@ TEST(WeakReferencesOldToOld) {
   // Like WeakReferencesBasic, but the updated weak slot is in the old space,
   // and referring to an old space object.
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   Factory* factory = isolate->factory();
@@ -96,11 +97,11 @@ TEST(WeakReferencesOldToOld) {
 
   Page* page_before_gc = Page::FromHeapObject(*fixed_array);
   heap::ForceEvacuationCandidate(page_before_gc);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK(heap->InOldSpace(*fixed_array));
 
-  HeapObject heap_object;
-  CHECK(lh->data1()->GetHeapObjectIfWeak(&heap_object));
+  Tagged<HeapObject> heap_object;
+  CHECK(lh->data1().GetHeapObjectIfWeak(&heap_object));
   CHECK_EQ(heap_object, *fixed_array);
 }
 
@@ -123,10 +124,10 @@ TEST(WeakReferencesOldToNew) {
   CHECK(Heap::InYoungGeneration(*fixed_array));
   lh->set_data1(HeapObjectReference::Weak(*fixed_array));
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
-  HeapObject heap_object;
-  CHECK(lh->data1()->GetHeapObjectIfWeak(&heap_object));
+  Tagged<HeapObject> heap_object;
+  CHECK(lh->data1().GetHeapObjectIfWeak(&heap_object));
   CHECK_EQ(heap_object, *fixed_array);
 }
 
@@ -149,10 +150,10 @@ TEST(WeakReferencesOldToNewScavenged) {
   CHECK(Heap::InYoungGeneration(*fixed_array));
   lh->set_data1(HeapObjectReference::Weak(*fixed_array));
 
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
 
-  HeapObject heap_object;
-  CHECK(lh->data1()->GetHeapObjectIfWeak(&heap_object));
+  Tagged<HeapObject> heap_object;
+  CHECK(lh->data1().GetHeapObjectIfWeak(&heap_object));
   CHECK_EQ(heap_object, *fixed_array);
 }
 
@@ -160,7 +161,8 @@ TEST(WeakReferencesOldToCleared) {
   // Like WeakReferencesBasic, but the updated weak slot is in the old space,
   // and is cleared.
   ManualGCScope manual_gc_scope;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   CcTest::InitializeVM();
   Isolate* isolate = CcTest::i_isolate();
   Factory* factory = isolate->factory();
@@ -172,7 +174,7 @@ TEST(WeakReferencesOldToCleared) {
   CHECK(heap->InOldSpace(*lh));
   lh->set_data1(HeapObjectReference::ClearedValue(isolate));
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK(lh->data1()->IsCleared());
 }
 
@@ -191,7 +193,7 @@ TEST(ObjectMovesBeforeClearingWeakField) {
   HandleScope outer_scope(isolate);
   Handle<LoadHandler> lh = CreateLoadHandlerForTest(factory);
   CHECK(InCorrectGeneration(*lh));
-  LoadHandler lh_location = *lh;
+  Tagged<LoadHandler> lh_location = *lh;
   {
     HandleScope inner_scope(isolate);
     // Create a new FixedArray which the LoadHandler will point to.
@@ -207,13 +209,13 @@ TEST(ObjectMovesBeforeClearingWeakField) {
   SimulateIncrementalMarking(heap, true);
 
   // Scavenger will move *lh.
-  CcTest::CollectGarbage(NEW_SPACE);
-  LoadHandler new_lh_location = *lh;
+  heap::InvokeMinorGC(heap);
+  Tagged<LoadHandler> new_lh_location = *lh;
   CHECK_NE(lh_location, new_lh_location);
   CHECK(lh->data1()->IsWeak());
 
   // Now we try to clear *lh.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK(lh->data1()->IsCleared());
 }
 
@@ -247,10 +249,10 @@ TEST(ObjectWithWeakFieldDies) {
   }  // outer_scope goes out of scope
 
   // lh will die
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
 
   // This used to crash when processing the dead weak reference.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 }
 
 TEST(ObjectWithWeakReferencePromoted) {
@@ -269,12 +271,12 @@ TEST(ObjectWithWeakReferencePromoted) {
   CHECK(Heap::InYoungGeneration(*fixed_array));
   lh->set_data1(HeapObjectReference::Weak(*fixed_array));
 
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::EmptyNewSpaceUsingGC(heap);
   CHECK(heap->InOldSpace(*lh));
   CHECK(heap->InOldSpace(*fixed_array));
 
-  HeapObject heap_object;
-  CHECK(lh->data1()->GetHeapObjectIfWeak(&heap_object));
+  Tagged<HeapObject> heap_object;
+  CHECK(lh->data1().GetHeapObjectIfWeak(&heap_object));
   CHECK_EQ(heap_object, *fixed_array);
 }
 
@@ -291,11 +293,11 @@ TEST(ObjectWithClearedWeakReferencePromoted) {
 
   lh->set_data1(HeapObjectReference::ClearedValue(isolate));
 
-  CcTest::CollectGarbage(OLD_SPACE);
+  heap::EmptyNewSpaceUsingGC(heap);
   CHECK(heap->InOldSpace(*lh));
   CHECK(lh->data1()->IsCleared());
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK(lh->data1()->IsCleared());
 }
 
@@ -332,7 +334,7 @@ TEST(WeakReferenceWriteBarrier) {
     lh->set_data1(HeapObjectReference::Weak(*fixed_array2));
   }
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
   // Check that the write barrier treated the weak reference as strong.
   CHECK(lh->data1()->IsWeak());
@@ -345,8 +347,8 @@ TEST(EmptyWeakArray) {
   HandleScope outer_scope(isolate);
 
   Handle<WeakFixedArray> array = factory->empty_weak_fixed_array();
-  CHECK(array->IsWeakFixedArray());
-  CHECK(!array->IsFixedArray());
+  CHECK(IsWeakFixedArray(*array));
+  CHECK(!IsFixedArray(*array));
   CHECK_EQ(array->length(), 0);
 }
 
@@ -363,15 +365,15 @@ TEST(WeakArraysBasic) {
 
   const int length = 4;
   Handle<WeakFixedArray> array = factory->NewWeakFixedArray(length);
-  CHECK(array->IsWeakFixedArray());
-  CHECK(!array->IsFixedArray());
+  CHECK(IsWeakFixedArray(*array));
+  CHECK(!IsFixedArray(*array));
   CHECK_EQ(array->length(), length);
 
   CHECK(Heap::InYoungGeneration(*array));
 
   for (int i = 0; i < length; ++i) {
-    HeapObject heap_object;
-    CHECK(array->Get(i)->GetHeapObjectIfStrong(&heap_object));
+    Tagged<HeapObject> heap_object;
+    CHECK(array->Get(i).GetHeapObjectIfStrong(&heap_object));
     CHECK_EQ(heap_object, ReadOnlyRoots(heap).undefined_value());
   }
 
@@ -401,24 +403,24 @@ TEST(WeakArraysBasic) {
 
   // TODO(marja): update this when/if we do handle weak references in the new
   // space.
-  CcTest::CollectGarbage(NEW_SPACE);
-  HeapObject heap_object;
-  CHECK(array->Get(0)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2016);
-  CHECK(array->Get(1)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2017);
-  CHECK(array->Get(2)->GetHeapObjectIfStrong(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2018);
-  CHECK(array->Get(3)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2019);
-
-  CcTest::CollectAllGarbage();
+  heap::InvokeMinorGC(heap);
+  Tagged<HeapObject> heap_object;
+  CHECK(array->Get(0).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2016);
+  CHECK(array->Get(1).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2017);
+  CHECK(array->Get(2).GetHeapObjectIfStrong(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2018);
+  CHECK(array->Get(3).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2019);
+
+  heap::InvokeMajorGC(heap);
   CHECK(heap->InOldSpace(*array));
   CHECK(array->Get(0)->IsCleared());
-  CHECK(array->Get(1)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2017);
-  CHECK(array->Get(2)->GetHeapObjectIfStrong(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2018);
+  CHECK(array->Get(1).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2017);
+  CHECK(array->Get(2).GetHeapObjectIfStrong(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2018);
   CHECK(array->Get(3)->IsCleared());
 }
 
@@ -435,9 +437,9 @@ TEST(WeakArrayListBasic) {
 
   Handle<WeakArrayList> array(ReadOnlyRoots(heap).empty_weak_array_list(),
                               isolate);
-  CHECK(array->IsWeakArrayList());
-  CHECK(!array->IsFixedArray());
-  CHECK(!array->IsWeakFixedArray());
+  CHECK(IsWeakArrayList(*array));
+  CHECK(!IsFixedArray(*array));
+  CHECK(!IsWeakFixedArray(*array));
   CHECK_EQ(array->length(), 0);
 
   Handle<FixedArray> index2 = factory->NewFixedArray(1);
@@ -498,33 +500,33 @@ TEST(WeakArrayListBasic) {
 
   // TODO(marja): update this when/if we do handle weak references in the new
   // space.
-  CcTest::CollectGarbage(NEW_SPACE);
-  HeapObject heap_object;
+  heap::InvokeMinorGC(heap);
+  Tagged<HeapObject> heap_object;
   CHECK_EQ(array->length(), 8);
-  CHECK(array->Get(0)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2016);
+  CHECK(array->Get(0).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2016);
   CHECK_EQ(array->Get(1).ToSmi().value(), 1);
 
-  CHECK(array->Get(2)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2017);
+  CHECK(array->Get(2).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2017);
   CHECK_EQ(array->Get(3).ToSmi().value(), 3);
 
-  CHECK(array->Get(4)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2018);
+  CHECK(array->Get(4).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2018);
   CHECK_EQ(array->Get(5).ToSmi().value(), 5);
 
-  CHECK(array->Get(6)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2019);
+  CHECK(array->Get(6).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2019);
   CHECK_EQ(array->Get(7).ToSmi().value(), 7);
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK(heap->InOldSpace(*array));
   CHECK_EQ(array->length(), 8);
   CHECK(array->Get(0)->IsCleared());
   CHECK_EQ(array->Get(1).ToSmi().value(), 1);
 
-  CHECK(array->Get(2)->GetHeapObjectIfWeak(&heap_object));
-  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object).get(0)).value(), 2017);
+  CHECK(array->Get(2).GetHeapObjectIfWeak(&heap_object));
+  CHECK_EQ(Smi::cast(FixedArray::cast(heap_object)->get(0)).value(), 2017);
   CHECK_EQ(array->Get(3).ToSmi().value(), 3);
 
   CHECK(array->Get(4)->IsCleared());
@@ -617,14 +619,14 @@ TEST(Regress7768) {
   CompileRun("%DeoptimizeFunction(myfunc);");
 
   // The object pointed to by the weak reference won't be scavenged.
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
 
   // Make sure the memory where it's stored is invalidated, so that we'll crash
   // if we try to access it.
   HeapTester::UncommitUnusedMemory(heap);
 
   // This used to crash when processing the dead weak reference.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 }
 
 TEST(PrototypeUsersBasic) {
@@ -709,9 +711,9 @@ TEST(PrototypeUsersBasic) {
 
 namespace {
 
-HeapObject saved_heap_object;
+Tagged<HeapObject> saved_heap_object;
 
-static void TestCompactCallback(HeapObject value, int old_index,
+static void TestCompactCallback(Tagged<HeapObject> value, int old_index,
                                 int new_index) {
   saved_heap_object = value;
   CHECK_EQ(old_index, 2);
@@ -753,13 +755,13 @@ TEST(PrototypeUsersCompacted) {
   }
 
   PrototypeUsers::MarkSlotEmpty(*array, 1);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK(array->Get(3)->IsCleared());
 
   CHECK_EQ(array->length(), 3 + PrototypeUsers::kFirstIndex);
-  WeakArrayList new_array =
+  Tagged<WeakArrayList> new_array =
       PrototypeUsers::Compact(array, heap, TestCompactCallback);
-  CHECK_EQ(new_array.length(), 1 + PrototypeUsers::kFirstIndex);
+  CHECK_EQ(new_array->length(), 1 + PrototypeUsers::kFirstIndex);
   CHECK_EQ(saved_heap_object, *live_map);
 }
 
diff --git a/deps/v8/test/cctest/heap/test-write-barrier.cc b/deps/v8/test/cctest/heap/test-write-barrier.cc
index 051476bfb60e72..583f2298fe5653 100644
--- a/deps/v8/test/cctest/heap/test-write-barrier.cc
+++ b/deps/v8/test/cctest/heap/test-write-barrier.cc
@@ -38,17 +38,22 @@ HEAP_TEST(WriteBarrier_Marking) {
     objects->set(2, *value2);
   }
   heap::SimulateIncrementalMarking(CcTest::heap(), false);
-  FixedArray host = FixedArray::cast(objects->get(0));
-  HeapObject value1 = HeapObject::cast(objects->get(1));
-  HeapObject value2 = HeapObject::cast(objects->get(2));
+  Tagged<FixedArray> host = FixedArray::cast(objects->get(0));
+  Tagged<HeapObject> value1 = HeapObject::cast(objects->get(1));
+  Tagged<HeapObject> value2 = HeapObject::cast(objects->get(2));
   CHECK(heap->marking_state()->IsUnmarked(host));
   CHECK(heap->marking_state()->IsUnmarked(value1));
-  WriteBarrier::Marking(host, host.RawFieldOfElementAt(0), value1);
-  CHECK(heap->marking_state()->IsGrey(value1));
+  // Trigger the barrier for the unmarked host and expect the bail out.
+  WriteBarrier::Marking(host, host->RawFieldOfElementAt(0), value1);
+  CHECK(!heap->marking_state()->IsMarked(value1));
   heap->marking_state()->TryMarkAndAccountLiveBytes(host);
+  // Trigger the barrier for the marked host.
+  WriteBarrier::Marking(host, host->RawFieldOfElementAt(0), value1);
+  CHECK(heap->marking_state()->IsMarked(value1));
+
   CHECK(heap->marking_state()->IsUnmarked(value2));
-  WriteBarrier::Marking(host, host.RawFieldOfElementAt(0), value2);
-  CHECK(heap->marking_state()->IsGrey(value2));
+  WriteBarrier::Marking(host, host->RawFieldOfElementAt(0), value2);
+  CHECK(heap->marking_state()->IsMarked(value2));
   heap::SimulateIncrementalMarking(CcTest::heap(), true);
   CHECK(heap->marking_state()->IsMarked(host));
   CHECK(heap->marking_state()->IsMarked(value1));
@@ -73,11 +78,15 @@ HEAP_TEST(WriteBarrier_MarkingExtension) {
     objects->set(0, *host);
   }
   heap::SimulateIncrementalMarking(CcTest::heap(), false);
-  JSArrayBuffer host = JSArrayBuffer::cast(objects->get(0));
+  Tagged<JSArrayBuffer> host = JSArrayBuffer::cast(objects->get(0));
   CHECK(heap->marking_state()->IsUnmarked(host));
   CHECK(!extension->IsMarked());
   WriteBarrier::Marking(host, extension);
-  // Concurrent marking barrier should mark this object.
+  // Concurrent marking barrier should bail out for unmarked host.
+  CHECK(!extension->IsMarked());
+  heap->marking_state()->TryMarkAndAccountLiveBytes(host);
+  WriteBarrier::Marking(host, extension);
+  // Concurrent marking barrier should mark the value now.
   CHECK(extension->IsMarked());
   // Keep object alive using the global handle.
   v8::Global<ArrayBuffer> global_host(CcTest::isolate(),
diff --git a/deps/v8/test/cctest/print-extension.cc b/deps/v8/test/cctest/print-extension.cc
index 766e5ca40304ac..b870f2809ff4ff 100644
--- a/deps/v8/test/cctest/print-extension.cc
+++ b/deps/v8/test/cctest/print-extension.cc
@@ -37,12 +37,11 @@ v8::Local<v8::FunctionTemplate> PrintExtension::GetNativeFunctionTemplate(
   return v8::FunctionTemplate::New(isolate, PrintExtension::Print);
 }
 
-
-void PrintExtension::Print(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  for (int i = 0; i < args.Length(); i++) {
+void PrintExtension::Print(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  for (int i = 0; i < info.Length(); i++) {
     if (i != 0) printf(" ");
-    v8::HandleScope scope(args.GetIsolate());
-    v8::String::Utf8Value str(args.GetIsolate(), args[i]);
+    v8::HandleScope scope(info.GetIsolate());
+    v8::String::Utf8Value str(info.GetIsolate(), info[i]);
     if (*str == nullptr) return;
     printf("%s", *str);
   }
diff --git a/deps/v8/test/cctest/print-extension.h b/deps/v8/test/cctest/print-extension.h
index 7060e0569e2dd1..7c154946d5e8fc 100644
--- a/deps/v8/test/cctest/print-extension.h
+++ b/deps/v8/test/cctest/print-extension.h
@@ -42,7 +42,7 @@ class PrintExtension : public v8::Extension {
   PrintExtension() : v8::Extension("v8/print", "native function print();") { }
   v8::Local<v8::FunctionTemplate> GetNativeFunctionTemplate(
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
-  static void Print(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void Print(const v8::FunctionCallbackInfo<v8::Value>& info);
 };
 
 }  // namespace internal
diff --git a/deps/v8/test/cctest/profiler-extension.cc b/deps/v8/test/cctest/profiler-extension.cc
index 23aa5f4131eb67..8b4b9611bb66a0 100644
--- a/deps/v8/test/cctest/profiler-extension.cc
+++ b/deps/v8/test/cctest/profiler-extension.cc
@@ -58,23 +58,26 @@ v8::Local<v8::FunctionTemplate> ProfilerExtension::GetNativeFunctionTemplate(
 }
 
 void ProfilerExtension::StartProfiling(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   last_profile = nullptr;
-  profiler_->StartProfiling(args.Length() > 0
-                                ? args[0].As<v8::String>()
-                                : v8::String::Empty(args.GetIsolate()));
+  profiler_->StartProfiling(info.Length() > 0
+                                ? info[0].As<v8::String>()
+                                : v8::String::Empty(info.GetIsolate()));
 }
 
 void ProfilerExtension::StopProfiling(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   last_profile = profiler_->StopProfiling(
-      args.Length() > 0 ? args[0].As<v8::String>()
-                        : v8::String::Empty(args.GetIsolate()));
+      info.Length() > 0 ? info[0].As<v8::String>()
+                        : v8::String::Empty(info.GetIsolate()));
 }
 
 void ProfilerExtension::CollectSample(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::CpuProfiler::CollectSample(args.GetIsolate());
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::CpuProfiler::CollectSample(info.GetIsolate());
 }
 
 }  // namespace internal
diff --git a/deps/v8/test/cctest/profiler-extension.h b/deps/v8/test/cctest/profiler-extension.h
index afb78dcc301feb..45df3c95bf3e1e 100644
--- a/deps/v8/test/cctest/profiler-extension.h
+++ b/deps/v8/test/cctest/profiler-extension.h
@@ -57,9 +57,9 @@ class ProfilerExtension : public v8::Extension {
   static v8::CpuProfile* last_profile;
 
  private:
-  static void StartProfiling(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void StopProfiling(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void CollectSample(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void StartProfiling(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void StopProfiling(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void CollectSample(const v8::FunctionCallbackInfo<v8::Value>& info);
 
   static v8::CpuProfiler* profiler_;
   static const char* kSource;
diff --git a/deps/v8/test/cctest/test-accessor-assembler.cc b/deps/v8/test/cctest/test-accessor-assembler.cc
index 4cba63b0acc832..165f6817d6ebc5 100644
--- a/deps/v8/test/cctest/test-accessor-assembler.cc
+++ b/deps/v8/test/cctest/test-accessor-assembler.cc
@@ -62,7 +62,7 @@ void TestStubCacheOffsetCalculation(StubCache::Table table) {
       factory->cell_map(),     Map::Create(isolate, 0),
       factory->meta_map(),     factory->instruction_stream_map(),
       Map::Create(isolate, 0), factory->hash_table_map(),
-      factory->symbol_map(),   factory->string_map(),
+      factory->symbol_map(),   factory->seq_two_byte_string_map(),
       Map::Create(isolate, 0), factory->sloppy_arguments_elements_map(),
   };
 
@@ -82,7 +82,7 @@ void TestStubCacheOffsetCalculation(StubCache::Table table) {
       }
       Handle<Object> result = ft.Call(name, map).ToHandleChecked();
 
-      Smi expected = Smi::FromInt(expected_result & Smi::kMaxValue);
+      Tagged<Smi> expected = Smi::FromInt(expected_result & Smi::kMaxValue);
       CHECK_EQ(expected, Smi::cast(*result));
     }
   }
@@ -227,7 +227,7 @@ TEST(TryProbeStubCache) {
       queried_existing = true;
     }
 
-    Handle<Object> expected_handler(handler->GetHeapObjectOrSmi(), isolate);
+    Handle<Object> expected_handler(handler.GetHeapObjectOrSmi(), isolate);
     ft.CheckTrue(receiver, name, expected_handler);
   }
 
@@ -243,7 +243,7 @@ TEST(TryProbeStubCache) {
       queried_existing = true;
     }
 
-    Handle<Object> expected_handler(handler->GetHeapObjectOrSmi(), isolate);
+    Handle<Object> expected_handler(handler.GetHeapObjectOrSmi(), isolate);
     ft.CheckTrue(receiver, name, expected_handler);
   }
   // Ensure we performed both kind of queries.
diff --git a/deps/v8/test/cctest/test-accessors.cc b/deps/v8/test/cctest/test-accessors.cc
index d51559316eed9c..5a249d66c22b4c 100644
--- a/deps/v8/test/cctest/test-accessors.cc
+++ b/deps/v8/test/cctest/test-accessors.cc
@@ -32,6 +32,7 @@
 #include "src/execution/frames-inl.h"
 #include "src/strings/string-stream.h"
 #include "test/cctest/cctest.h"
+#include "test/cctest/heap/heap-utils.h"
 
 using ::v8::ObjectTemplate;
 using ::v8::Value;
@@ -342,8 +343,8 @@ static void CheckAccessorArgsCorrect(
   CHECK(info.Data()
             ->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("data"))
             .FromJust());
-  CcTest::CollectAllGarbage();
   CHECK(info.GetIsolate() == CcTest::isolate());
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK(info.This() == info.Holder());
   CHECK(info.Data()
             ->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("data"))
@@ -534,7 +535,7 @@ static void StackCheck(Local<String> name,
     i::StackFrame* frame = iter.frame();
     CHECK(i != 0 || (frame->type() == i::StackFrame::EXIT));
     i::Code code = frame->LookupCode();
-    CHECK(code.contains(isolate, frame->pc()));
+    CHECK(code->contains(isolate, frame->pc()));
     iter.Advance();
   }
 }
@@ -678,22 +679,18 @@ THREADED_TEST(GlobalObjectAccessor) {
   // JSGlobalProxy as a receiver regardless of the current IC state and
   // the order in which ICs are executed.
   for (int i = 0; i < 10; i++) {
-    CHECK(
-        v8::Utils::OpenHandle(*check_getter->Run(env.local()).ToLocalChecked())
-            ->IsJSGlobalProxy());
+    CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(
+        *check_getter->Run(env.local()).ToLocalChecked())));
   }
   for (int i = 0; i < 10; i++) {
-    CHECK(
-        v8::Utils::OpenHandle(*check_setter->Run(env.local()).ToLocalChecked())
-            ->IsJSGlobalProxy());
+    CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(
+        *check_setter->Run(env.local()).ToLocalChecked())));
   }
   for (int i = 0; i < 10; i++) {
-    CHECK(
-        v8::Utils::OpenHandle(*check_getter->Run(env.local()).ToLocalChecked())
-            ->IsJSGlobalProxy());
-    CHECK(
-        v8::Utils::OpenHandle(*check_setter->Run(env.local()).ToLocalChecked())
-            ->IsJSGlobalProxy());
+    CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(
+        *check_getter->Run(env.local()).ToLocalChecked())));
+    CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(
+        *check_setter->Run(env.local()).ToLocalChecked())));
   }
 }
 
diff --git a/deps/v8/test/cctest/test-api-array-buffer.cc b/deps/v8/test/cctest/test-api-array-buffer.cc
index 5977ecd230756c..8e32b30a5ca63a 100644
--- a/deps/v8/test/cctest/test-api-array-buffer.cc
+++ b/deps/v8/test/cctest/test-api-array-buffer.cc
@@ -5,6 +5,7 @@
 #include "src/api/api-inl.h"
 #include "src/base/strings.h"
 #include "src/objects/js-array-buffer-inl.h"
+#include "test/cctest/heap/heap-utils.h"
 #include "test/cctest/test-api.h"
 #include "test/common/flag-utils.h"
 
@@ -67,7 +68,7 @@ THREADED_TEST(ArrayBuffer_ApiInternalToExternal) {
   Local<v8::ArrayBuffer> ab = v8::ArrayBuffer::New(isolate, 1024);
   CheckInternalFieldsAreZero(ab);
   CHECK_EQ(1024, ab->ByteLength());
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   std::shared_ptr<v8::BackingStore> backing_store = Externalize(ab);
   CHECK_EQ(1024, backing_store->ByteLength());
@@ -299,7 +300,6 @@ THREADED_TEST(ArrayBuffer_ExternalizeEmpty) {
 }
 
 THREADED_TEST(SharedArrayBuffer_ApiInternalToExternal) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   LocalContext env;
   v8::Isolate* isolate = env->GetIsolate();
   v8::HandleScope handle_scope(isolate);
@@ -307,7 +307,7 @@ THREADED_TEST(SharedArrayBuffer_ApiInternalToExternal) {
   Local<v8::SharedArrayBuffer> ab = v8::SharedArrayBuffer::New(isolate, 1024);
   CheckInternalFieldsAreZero(ab);
   CHECK_EQ(1024, ab->ByteLength());
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   std::shared_ptr<v8::BackingStore> backing_store = Externalize(ab);
 
@@ -334,7 +334,6 @@ THREADED_TEST(SharedArrayBuffer_ApiInternalToExternal) {
 }
 
 THREADED_TEST(SharedArrayBuffer_JSInternalToExternal) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   LocalContext env;
   v8::Isolate* isolate = env->GetIsolate();
   v8::HandleScope handle_scope(isolate);
@@ -391,10 +390,9 @@ THREADED_TEST(SkipArrayBufferBackingStoreDuringGC) {
       v8::ArrayBuffer::New(isolate, std::move(backing_store));
 
   // Should not crash
-  CcTest::CollectGarbage(i::NEW_SPACE);  // in survivor space now
-  CcTest::CollectGarbage(i::NEW_SPACE);  // in old gen now
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   // Should not move the pointer
   CHECK_EQ(ab->GetBackingStore()->Data(), store_ptr);
@@ -415,8 +413,7 @@ THREADED_TEST(SkipArrayBufferDuringScavenge) {
   auto backing_store = v8::ArrayBuffer::NewBackingStore(
       store_ptr, 8, [](void*, size_t, void*) {}, nullptr);
 
-  // Make `store_ptr` point to from space
-  CcTest::CollectGarbage(i::NEW_SPACE);
+  i::heap::InvokeMinorGC(CcTest::heap());
 
   // Create ArrayBuffer with pointer-that-cannot-be-visited in the backing store
   Local<v8::ArrayBuffer> ab =
@@ -424,8 +421,7 @@ THREADED_TEST(SkipArrayBufferDuringScavenge) {
 
   // Should not crash,
   // i.e. backing store pointer should not be treated as a heap object pointer
-  CcTest::CollectGarbage(i::NEW_SPACE);  // in survivor space now
-  CcTest::CollectGarbage(i::NEW_SPACE);  // in old gen now
+  i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
 
   CHECK_EQ(ab->GetBackingStore()->Data(), store_ptr);
   CHECK_EQ(ab->Data(), store_ptr);
diff --git a/deps/v8/test/cctest/test-api-interceptors.cc b/deps/v8/test/cctest/test-api-interceptors.cc
index 4fcffa21928690..238cf58415d7b0 100644
--- a/deps/v8/test/cctest/test-api-interceptors.cc
+++ b/deps/v8/test/cctest/test-api-interceptors.cc
@@ -14,6 +14,7 @@
 #include "src/objects/objects.h"
 #include "src/runtime/runtime.h"
 #include "src/strings/unicode-inl.h"
+#include "test/cctest/heap/heap-utils.h"
 #include "test/cctest/test-api.h"
 
 using ::v8::Context;
@@ -377,7 +378,7 @@ void InterceptorHasOwnPropertyGetter(
 void InterceptorHasOwnPropertyGetterGC(
     Local<Name> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
   // The request is not intercepted so don't call ApiTestFuzzer::Fuzz() here.
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
 int query_counter_int = 0;
@@ -1370,11 +1371,11 @@ THREADED_TEST(InterceptorLoadGlobalICGlobalWithInterceptor) {
   LocalContext context(nullptr, templ_global);
   i::Handle<i::JSReceiver> global_proxy =
       v8::Utils::OpenHandle<Object, i::JSReceiver>(context->Global());
-  CHECK(global_proxy->IsJSGlobalProxy());
+  CHECK(IsJSGlobalProxy(*global_proxy));
   i::Handle<i::JSGlobalObject> global(
-      i::JSGlobalObject::cast(global_proxy->map().prototype()),
+      i::JSGlobalObject::cast(global_proxy->map()->prototype()),
       global_proxy->GetIsolate());
-  CHECK(global->map().has_named_interceptor());
+  CHECK(global->map()->has_named_interceptor());
 
   v8::Local<Value> value = CompileRun(
       "var f = function() { "
@@ -1434,11 +1435,11 @@ THREADED_TEST(InterceptorLoadICGlobalWithInterceptor) {
   LocalContext context(nullptr, templ_global);
   i::Handle<i::JSReceiver> global_proxy =
       v8::Utils::OpenHandle<Object, i::JSReceiver>(context->Global());
-  CHECK(global_proxy->IsJSGlobalProxy());
+  CHECK(IsJSGlobalProxy(*global_proxy));
   i::Handle<i::JSGlobalObject> global(
-      i::JSGlobalObject::cast(global_proxy->map().prototype()),
+      i::JSGlobalObject::cast(global_proxy->map()->prototype()),
       global_proxy->GetIsolate());
-  CHECK(global->map().has_named_interceptor());
+  CHECK(global->map()->has_named_interceptor());
 
   ExpectInt32(
       "(function() {"
diff --git a/deps/v8/test/cctest/test-api-stack-traces.cc b/deps/v8/test/cctest/test-api-stack-traces.cc
index 96a19018b8bf19..e9cab6ced7ecd9 100644
--- a/deps/v8/test/cctest/test-api-stack-traces.cc
+++ b/deps/v8/test/cctest/test-api-stack-traces.cc
@@ -60,6 +60,7 @@ THREADED_TEST(IsolatePrepareStackTraceThrow) {
 }
 
 static void ThrowV8Exception(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   v8::Local<String> foo = v8_str("foo");
   v8::Local<String> message = v8_str("message");
@@ -279,8 +280,9 @@ const char function_name_source_anon5[] =
     "})";
 
 static void AnalyzeStackInNativeCode(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::HandleScope scope(args.GetIsolate());
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::HandleScope scope(info.GetIsolate());
   const char* origin = "capture-stack-trace-test";
   const int kOverviewTest = 1;
   const int kDetailedTest = 2;
@@ -288,18 +290,18 @@ static void AnalyzeStackInNativeCode(
   const int kFunctionNameAndDisplayName = 4;
   const int kFunctionNameIsNotString = 5;
 
-  CHECK_EQ(args.Length(), 1);
+  CHECK_EQ(info.Length(), 1);
 
-  v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
-  v8::Isolate* isolate = args.GetIsolate();
-  int testGroup = args[0]->Int32Value(context).FromJust();
+  v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
+  v8::Isolate* isolate = info.GetIsolate();
+  int testGroup = info[0]->Int32Value(context).FromJust();
   if (testGroup == kOverviewTest) {
     v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-        args.GetIsolate(), 10, v8::StackTrace::kOverview);
+        info.GetIsolate(), 10, v8::StackTrace::kOverview);
     CHECK_EQ(4, stackTrace->GetFrameCount());
     checkStackFrame(origin, overview_source, "//foobar.com/overview.ts", "bar",
                     2, 10, false, false,
-                    stackTrace->GetFrame(args.GetIsolate(), 0));
+                    stackTrace->GetFrame(info.GetIsolate(), 0));
     checkStackFrame(origin, overview_source, "//foobar.com/overview.ts", "foo",
                     6, 3, false, true, stackTrace->GetFrame(isolate, 1));
     // This is the source string inside the eval which has the call to foo.
@@ -310,7 +312,7 @@ static void AnalyzeStackInNativeCode(
                     7, false, false, stackTrace->GetFrame(isolate, 3));
   } else if (testGroup == kDetailedTest) {
     v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-        args.GetIsolate(), 10, v8::StackTrace::kDetailed);
+        info.GetIsolate(), 10, v8::StackTrace::kDetailed);
     CHECK_EQ(4, stackTrace->GetFrameCount());
     checkStackFrame(origin, detailed_source, nullptr, "bat", 4, 22, false,
                     false, stackTrace->GetFrame(isolate, 0));
@@ -325,21 +327,21 @@ static void AnalyzeStackInNativeCode(
                     stackTrace->GetFrame(isolate, 3));
   } else if (testGroup == kFunctionName) {
     v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-        args.GetIsolate(), 5, v8::StackTrace::kOverview);
+        info.GetIsolate(), 5, v8::StackTrace::kOverview);
     CHECK_EQ(3, stackTrace->GetFrameCount());
     checkStackFrame(nullptr, function_name_source_anon3, nullptr,
                     "function.name", 3, 1, true, false,
                     stackTrace->GetFrame(isolate, 0));
   } else if (testGroup == kFunctionNameAndDisplayName) {
     v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-        args.GetIsolate(), 5, v8::StackTrace::kOverview);
+        info.GetIsolate(), 5, v8::StackTrace::kOverview);
     CHECK_EQ(3, stackTrace->GetFrameCount());
     checkStackFrame(nullptr, function_name_source_anon4, nullptr,
                     "function.name", 3, 1, true, false,
                     stackTrace->GetFrame(isolate, 0));
   } else if (testGroup == kFunctionNameIsNotString) {
     v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-        args.GetIsolate(), 5, v8::StackTrace::kOverview);
+        info.GetIsolate(), 5, v8::StackTrace::kOverview);
     CHECK_EQ(3, stackTrace->GetFrameCount());
     checkStackFrame(nullptr, function_name_source_anon5, nullptr, "", 3, 1,
                     true, false, stackTrace->GetFrame(isolate, 0));
@@ -677,17 +679,18 @@ TEST(RethrowBogusErrorStackTrace) {
 }
 
 void AnalyzeStackOfEvalWithSourceURL(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::HandleScope scope(args.GetIsolate());
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::HandleScope scope(info.GetIsolate());
   v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-      args.GetIsolate(), 10, v8::StackTrace::kDetailed);
+      info.GetIsolate(), 10, v8::StackTrace::kDetailed);
   CHECK_EQ(5, stackTrace->GetFrameCount());
   v8::Local<v8::String> url = v8_str("eval_url");
   for (int i = 0; i < 3; i++) {
     v8::Local<v8::String> name =
-        stackTrace->GetFrame(args.GetIsolate(), i)->GetScriptNameOrSourceURL();
+        stackTrace->GetFrame(info.GetIsolate(), i)->GetScriptNameOrSourceURL();
     CHECK(!name.IsEmpty());
-    CHECK(url->Equals(args.GetIsolate()->GetCurrentContext(), name).FromJust());
+    CHECK(url->Equals(info.GetIsolate()->GetCurrentContext(), name).FromJust());
   }
 }
 
@@ -722,14 +725,15 @@ TEST(SourceURLInStackTrace) {
 
 static int scriptIdInStack[2];
 
-void AnalyzeScriptIdInStack(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::HandleScope scope(args.GetIsolate());
+void AnalyzeScriptIdInStack(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::HandleScope scope(info.GetIsolate());
   v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-      args.GetIsolate(), 10, v8::StackTrace::kScriptId);
+      info.GetIsolate(), 10, v8::StackTrace::kScriptId);
   CHECK_EQ(2, stackTrace->GetFrameCount());
   for (int i = 0; i < 2; i++) {
     scriptIdInStack[i] =
-        stackTrace->GetFrame(args.GetIsolate(), i)->GetScriptId();
+        stackTrace->GetFrame(info.GetIsolate(), i)->GetScriptId();
   }
 }
 
@@ -755,17 +759,18 @@ TEST(ScriptIdInStackTrace) {
 }
 
 void AnalyzeStackOfInlineScriptWithSourceURL(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::HandleScope scope(args.GetIsolate());
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::HandleScope scope(info.GetIsolate());
   v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-      args.GetIsolate(), 10, v8::StackTrace::kDetailed);
+      info.GetIsolate(), 10, v8::StackTrace::kDetailed);
   CHECK_EQ(4, stackTrace->GetFrameCount());
   v8::Local<v8::String> url = v8_str("source_url");
   for (int i = 0; i < 3; i++) {
     v8::Local<v8::String> name =
-        stackTrace->GetFrame(args.GetIsolate(), i)->GetScriptNameOrSourceURL();
+        stackTrace->GetFrame(info.GetIsolate(), i)->GetScriptNameOrSourceURL();
     CHECK(!name.IsEmpty());
-    CHECK(url->Equals(args.GetIsolate()->GetCurrentContext(), name).FromJust());
+    CHECK(url->Equals(info.GetIsolate()->GetCurrentContext(), name).FromJust());
   }
 }
 
@@ -799,17 +804,18 @@ TEST(InlineScriptWithSourceURLInStackTrace) {
 }
 
 void AnalyzeStackOfDynamicScriptWithSourceURL(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::HandleScope scope(args.GetIsolate());
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::HandleScope scope(info.GetIsolate());
   v8::Local<v8::StackTrace> stackTrace = v8::StackTrace::CurrentStackTrace(
-      args.GetIsolate(), 10, v8::StackTrace::kDetailed);
+      info.GetIsolate(), 10, v8::StackTrace::kDetailed);
   CHECK_EQ(4, stackTrace->GetFrameCount());
   v8::Local<v8::String> url = v8_str("source_url");
   for (int i = 0; i < 3; i++) {
     v8::Local<v8::String> name =
-        stackTrace->GetFrame(args.GetIsolate(), i)->GetScriptNameOrSourceURL();
+        stackTrace->GetFrame(info.GetIsolate(), i)->GetScriptNameOrSourceURL();
     CHECK(!name.IsEmpty());
-    CHECK(url->Equals(args.GetIsolate()->GetCurrentContext(), name).FromJust());
+    CHECK(url->Equals(info.GetIsolate()->GetCurrentContext(), name).FromJust());
   }
 }
 
@@ -886,10 +892,11 @@ UNINITIALIZED_TEST(CaptureStackTraceForStackOverflow) {
   isolate->Dispose();
 }
 
-void AnalyzeScriptNameInStack(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::HandleScope scope(args.GetIsolate());
+void AnalyzeScriptNameInStack(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::HandleScope scope(info.GetIsolate());
   v8::Local<v8::String> name =
-      v8::StackTrace::CurrentScriptNameOrSourceURL(args.GetIsolate());
+      v8::StackTrace::CurrentScriptNameOrSourceURL(info.GetIsolate());
   CHECK(!name.IsEmpty());
   CHECK(name->StringEquals(v8_str("test.js")));
 }
@@ -913,10 +920,11 @@ TEST(CurrentScriptNameOrSourceURL_Name) {
   CHECK(CompileRunWithOrigin(source, "test.js")->IsUndefined());
 }
 
-void AnalyzeScriptURLInStack(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::HandleScope scope(args.GetIsolate());
+void AnalyzeScriptURLInStack(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::HandleScope scope(info.GetIsolate());
   v8::Local<v8::String> name =
-      v8::StackTrace::CurrentScriptNameOrSourceURL(args.GetIsolate());
+      v8::StackTrace::CurrentScriptNameOrSourceURL(info.GetIsolate());
   CHECK(!name.IsEmpty());
   CHECK(name->StringEquals(v8_str("foo.js")));
 }
diff --git a/deps/v8/test/cctest/test-api-typed-array.cc b/deps/v8/test/cctest/test-api-typed-array.cc
index 866f979442b926..0513656fe56294 100644
--- a/deps/v8/test/cctest/test-api-typed-array.cc
+++ b/deps/v8/test/cctest/test-api-typed-array.cc
@@ -6,6 +6,7 @@
 #include "src/base/strings.h"
 #include "src/objects/js-array-buffer-inl.h"
 #include "src/objects/js-array-buffer.h"
+#include "test/cctest/heap/heap-utils.h"
 #include "test/cctest/test-api.h"
 
 using ::v8::Array;
@@ -17,7 +18,7 @@ namespace {
 
 void CheckElementValue(i::Isolate* isolate, int expected,
                        i::Handle<i::Object> obj, int offset) {
-  i::Object element =
+  i::Tagged<i::Object> element =
       *i::Object::GetElement(isolate, obj, offset).ToHandleChecked();
   CHECK_EQ(expected, i::Smi::ToInt(element));
 }
@@ -139,7 +140,7 @@ void ObjectWithExternalArrayTestHelper(Local<Context> context,
       "}"
       "sum;");
   // Force GC to trigger verification.
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(28, result->Int32Value(context).FromJust());
 
   // Make sure out-of-range loads do not throw.
@@ -177,8 +178,8 @@ void ObjectWithExternalArrayTestHelper(Local<Context> context,
   CHECK_EQ(0, result->Int32Value(context).FromJust());
   if (array_type == i::kExternalFloat64Array ||
       array_type == i::kExternalFloat32Array) {
-    CHECK(std::isnan(
-        i::Object::GetElement(isolate, jsobj, 7).ToHandleChecked()->Number()));
+    CHECK(std::isnan(i::Object::Number(
+        *i::Object::GetElement(isolate, jsobj, 7).ToHandleChecked())));
   } else {
     CheckElementValue(isolate, 0, jsobj, 7);
   }
@@ -189,9 +190,9 @@ void ObjectWithExternalArrayTestHelper(Local<Context> context,
       "}"
       "ext_array[6];");
   CHECK_EQ(2, result->Int32Value(context).FromJust());
-  CHECK_EQ(2, static_cast<int>(i::Object::GetElement(isolate, jsobj, 6)
-                                   .ToHandleChecked()
-                                   ->Number()));
+  CHECK_EQ(2,
+           static_cast<int>(i::Object::Number(
+               *i::Object::GetElement(isolate, jsobj, 6).ToHandleChecked())));
 
   if (array_type != i::kExternalFloat32Array &&
       array_type != i::kExternalFloat64Array) {
@@ -461,61 +462,51 @@ THREADED_TEST(DataView) {
 }
 
 THREADED_TEST(SharedUint8Array) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<uint8_t, v8::Uint8Array, v8::SharedArrayBuffer>(
       i::kExternalUint8Array, 0, 0xFF);
 }
 
 THREADED_TEST(SharedInt8Array) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<int8_t, v8::Int8Array, v8::SharedArrayBuffer>(
       i::kExternalInt8Array, -0x80, 0x7F);
 }
 
 THREADED_TEST(SharedUint16Array) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<uint16_t, v8::Uint16Array, v8::SharedArrayBuffer>(
       i::kExternalUint16Array, 0, 0xFFFF);
 }
 
 THREADED_TEST(SharedInt16Array) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<int16_t, v8::Int16Array, v8::SharedArrayBuffer>(
       i::kExternalInt16Array, -0x8000, 0x7FFF);
 }
 
 THREADED_TEST(SharedUint32Array) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<uint32_t, v8::Uint32Array, v8::SharedArrayBuffer>(
       i::kExternalUint32Array, 0, UINT_MAX);
 }
 
 THREADED_TEST(SharedInt32Array) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<int32_t, v8::Int32Array, v8::SharedArrayBuffer>(
       i::kExternalInt32Array, INT_MIN, INT_MAX);
 }
 
 THREADED_TEST(SharedFloat32Array) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<float, v8::Float32Array, v8::SharedArrayBuffer>(
       i::kExternalFloat32Array, -500, 500);
 }
 
 THREADED_TEST(SharedFloat64Array) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<double, v8::Float64Array, v8::SharedArrayBuffer>(
       i::kExternalFloat64Array, -500, 500);
 }
 
 THREADED_TEST(SharedUint8ClampedArray) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   TypedArrayTestHelper<uint8_t, v8::Uint8ClampedArray, v8::SharedArrayBuffer>(
       i::kExternalUint8ClampedArray, 0, 0xFF);
 }
 
 THREADED_TEST(SharedDataView) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   const int kSize = 50;
 
   LocalContext env;
diff --git a/deps/v8/test/cctest/test-api.cc b/deps/v8/test/cctest/test-api.cc
index 230e57c4795a78..fa6901159a2bd5 100644
--- a/deps/v8/test/cctest/test-api.cc
+++ b/deps/v8/test/cctest/test-api.cc
@@ -31,6 +31,7 @@
 #include <csignal>
 #include <map>
 #include <memory>
+#include <sstream>
 #include <string>
 
 #include "test/cctest/cctest.h"
@@ -78,6 +79,7 @@
 #include "test/cctest/heap/heap-tester.h"
 #include "test/cctest/heap/heap-utils.h"
 #include "test/common/flag-utils.h"
+#include "test/common/streaming-helper.h"
 
 #if V8_ENABLE_WEBASSEMBLY
 #include "src/wasm/wasm-engine.h"
@@ -139,28 +141,27 @@ void RunWithProfiler(void (*test)()) {
 static int signature_callback_count;
 static Local<Value> signature_expected_receiver;
 static void IncrementingSignatureCallback(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   signature_callback_count++;
-  CHECK(signature_expected_receiver->Equals(
-                                       args.GetIsolate()->GetCurrentContext(),
-                                       args.Holder())
+  CHECK(signature_expected_receiver
+            ->Equals(info.GetIsolate()->GetCurrentContext(), info.Holder())
             .FromJust());
-  CHECK(signature_expected_receiver->Equals(
-                                       args.GetIsolate()->GetCurrentContext(),
-                                       args.This())
+  CHECK(signature_expected_receiver
+            ->Equals(info.GetIsolate()->GetCurrentContext(), info.This())
             .FromJust());
   v8::Local<v8::Array> result =
-      v8::Array::New(args.GetIsolate(), args.Length());
-  for (int i = 0; i < args.Length(); i++) {
-    CHECK(result->Set(args.GetIsolate()->GetCurrentContext(),
-                      v8::Integer::New(args.GetIsolate(), i), args[i])
+      v8::Array::New(info.GetIsolate(), info.Length());
+  for (int i = 0; i < info.Length(); i++) {
+    CHECK(result
+              ->Set(info.GetIsolate()->GetCurrentContext(),
+                    v8::Integer::New(info.GetIsolate(), i), info[i])
               .FromJust());
   }
-  args.GetReturnValue().Set(result);
+  info.GetReturnValue().Set(result);
 }
 
-
 static void Returns42(const v8::FunctionCallbackInfo<v8::Value>& info) {
   info.GetReturnValue().Set(42);
 }
@@ -557,11 +558,11 @@ THREADED_TEST(ScriptUsingStringResource) {
     CHECK_EQ(static_cast<const String::ExternalStringResourceBase*>(resource),
              source->GetExternalStringResourceBase(&encoding));
     CHECK_EQ(String::TWO_BYTE_ENCODING, encoding);
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     CHECK_EQ(0, dispose_count);
   }
   CcTest::i_isolate()->compilation_cache()->Clear();
-  CcTest::CollectAllAvailableGarbage();
+  i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(1, dispose_count);
 }
 
@@ -593,11 +594,11 @@ THREADED_TEST(ScriptUsingOneByteStringResource) {
     Local<Value> value = script->Run(env.local()).ToLocalChecked();
     CHECK(value->IsNumber());
     CHECK_EQ(7, value->Int32Value(env.local()).FromJust());
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     CHECK_EQ(0, dispose_count);
   }
   CcTest::i_isolate()->compilation_cache()->Clear();
-  CcTest::CollectAllAvailableGarbage();
+  i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(1, dispose_count);
 }
 
@@ -607,7 +608,7 @@ THREADED_TEST(ScriptMakingExternalString) {
       CcTest::heap());
 
   int dispose_count = 0;
-  uint16_t* two_byte_source = AsciiToTwoByteString("1 + 2 * 3");
+  uint16_t* two_byte_source = AsciiToTwoByteString(u"1 + 2 * 3 /* π */");
   {
     LocalContext env;
     v8::HandleScope scope(env->GetIsolate());
@@ -615,14 +616,13 @@ THREADED_TEST(ScriptMakingExternalString) {
         String::NewFromTwoByte(env->GetIsolate(), two_byte_source)
             .ToLocalChecked();
     // Trigger GCs so that the newly allocated string moves to old gen.
-    CcTest::CollectGarbage(i::NEW_SPACE);  // in survivor space now
-    CcTest::CollectGarbage(i::NEW_SPACE);  // in old gen now
+    i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
     CHECK(!source->IsExternalTwoByte());
     CHECK(!source->IsExternalOneByte());
     CHECK(!source->IsExternal());
     String::Encoding encoding = String::UNKNOWN_ENCODING;
     CHECK(!source->GetExternalStringResourceBase(&encoding));
-    CHECK_EQ(String::ONE_BYTE_ENCODING, encoding);
+    CHECK_EQ(String::TWO_BYTE_ENCODING, encoding);
     bool success = source->MakeExternal(new TestResource(two_byte_source,
                                                          &dispose_count));
     CHECK(success);
@@ -630,11 +630,11 @@ THREADED_TEST(ScriptMakingExternalString) {
     Local<Value> value = script->Run(env.local()).ToLocalChecked();
     CHECK(value->IsNumber());
     CHECK_EQ(7, value->Int32Value(env.local()).FromJust());
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     CHECK_EQ(0, dispose_count);
   }
   CcTest::i_isolate()->compilation_cache()->Clear();
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(1, dispose_count);
 }
 
@@ -650,8 +650,7 @@ THREADED_TEST(ScriptMakingExternalOneByteString) {
     v8::HandleScope scope(env->GetIsolate());
     Local<String> source = v8_str(c_source);
     // Trigger GCs so that the newly allocated string moves to old gen.
-    CcTest::CollectGarbage(i::NEW_SPACE);  // in survivor space now
-    CcTest::CollectGarbage(i::NEW_SPACE);  // in old gen now
+    i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
     bool success = source->MakeExternal(
         new TestOneByteResource(i::StrDup(c_source), &dispose_count));
     CHECK(success);
@@ -659,11 +658,11 @@ THREADED_TEST(ScriptMakingExternalOneByteString) {
     Local<Value> value = script->Run(env.local()).ToLocalChecked();
     CHECK(value->IsNumber());
     CHECK_EQ(7, value->Int32Value(env.local()).FromJust());
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     CHECK_EQ(0, dispose_count);
   }
   CcTest::i_isolate()->compilation_cache()->Clear();
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(1, dispose_count);
 }
 
@@ -674,8 +673,7 @@ TEST(MakingExternalStringConditions) {
 
   if (!i::v8_flags.single_generation) {
     // Free some space in the new space so that we can check freshness.
-    CcTest::CollectGarbage(i::NEW_SPACE);
-    CcTest::CollectGarbage(i::NEW_SPACE);
+    i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
   }
 
   Local<String> tiny_local_string = v8_str("\xCF\x80");
@@ -687,8 +685,7 @@ TEST(MakingExternalStringConditions) {
   if (!i::v8_flags.single_generation) {
     // We should refuse to externalize new space strings.
     CHECK(!local_string->CanMakeExternal(String::Encoding::TWO_BYTE_ENCODING));
-    // Trigger full GC so that the newly allocated string moves to old gen.
-    CcTest::CollectGarbage(i::OLD_SPACE);
+    i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
   }
   // Old space strings should be accepted.
   CHECK(local_string->CanMakeExternal(String::Encoding::TWO_BYTE_ENCODING));
@@ -710,8 +707,7 @@ TEST(MakingExternalOneByteStringConditions) {
 
   if (!i::v8_flags.single_generation) {
     // Free some space in the new space so that we can check freshness.
-    CcTest::CollectGarbage(i::NEW_SPACE);
-    CcTest::CollectGarbage(i::NEW_SPACE);
+    i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
   }
 
   Local<String> tiny_local_string = v8_str("s");
@@ -727,8 +723,8 @@ TEST(MakingExternalOneByteStringConditions) {
   if (!i::v8_flags.single_generation) {
     // We should refuse to externalize new space strings.
     CHECK(!local_string->CanMakeExternal(String::Encoding::ONE_BYTE_ENCODING));
-    // Trigger full GC so that the newly allocated string moves to old gen.
-    CcTest::CollectGarbage(i::OLD_SPACE);
+    // Trigger GC so that the newly allocated string moves to old gen.
+    i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
     CHECK(!tiny_local_string->CanMakeExternal(
         String::Encoding::ONE_BYTE_ENCODING));
   }
@@ -755,9 +751,7 @@ TEST(MakingExternalUnalignedOneByteString) {
       "slice('abcdefghijklmnopqrstuvwxyz');"));
 
   // Trigger GCs so that the newly allocated string moves to old gen.
-  i::heap::SimulateFullSpace(CcTest::heap()->old_space());
-  CcTest::CollectGarbage(i::NEW_SPACE);  // in survivor space now
-  CcTest::CollectGarbage(i::NEW_SPACE);  // in old gen now
+  i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
 
   // Turn into external string with unaligned resource data.
   const char* c_cons = "_abcdefghijklmnopqrstuvwxyz";
@@ -770,9 +764,8 @@ TEST(MakingExternalUnalignedOneByteString) {
   CHECK(success);
 
   // Trigger GCs and force evacuation.
-  CcTest::CollectAllGarbage();
-  CcTest::heap()->CollectAllGarbage(i::Heap::kReduceMemoryFootprintMask,
-                                    i::GarbageCollectionReason::kTesting);
+  i::heap::InvokeMajorGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap(), i::GCFlag::kReduceMemoryFootprint);
 }
 
 THREADED_TEST(UsingExternalString) {
@@ -786,14 +779,13 @@ THREADED_TEST(UsingExternalString) {
             .ToLocalChecked();
     i::Handle<i::String> istring = v8::Utils::OpenHandle(*string);
     // Trigger GCs so that the newly allocated string moves to old gen.
-    CcTest::CollectGarbage(i::NEW_SPACE);  // in survivor space now
-    CcTest::CollectGarbage(i::NEW_SPACE);  // in old gen now
+    i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
     i::Handle<i::String> isymbol =
         factory->InternalizeString(istring);
-    CHECK(isymbol->IsInternalizedString());
+    CHECK(IsInternalizedString(*isymbol));
   }
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
 
@@ -809,14 +801,13 @@ THREADED_TEST(UsingExternalOneByteString) {
             .ToLocalChecked();
     i::Handle<i::String> istring = v8::Utils::OpenHandle(*string);
     // Trigger GCs so that the newly allocated string moves to old gen.
-    CcTest::CollectGarbage(i::NEW_SPACE);  // in survivor space now
-    CcTest::CollectGarbage(i::NEW_SPACE);  // in old gen now
+    i::heap::EmptyNewSpaceUsingGC(CcTest::heap());
     i::Handle<i::String> isymbol =
         factory->InternalizeString(istring);
-    CHECK(isymbol->IsInternalizedString());
+    CHECK(IsInternalizedString(*isymbol));
   }
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
 
@@ -869,7 +860,7 @@ THREADED_TEST(NewExternalForVeryLongString) {
 }
 
 TEST(ScavengeExternalString) {
-  ManualGCScope manual_gc_scope;
+  i::ManualGCScope manual_gc_scope;
   i::v8_flags.stress_compaction = false;
   i::v8_flags.gc_global = false;
   i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
@@ -886,18 +877,19 @@ TEST(ScavengeExternalString) {
             new TestResource(two_byte_string, &dispose_count))
             .ToLocalChecked();
     i::Handle<i::String> istring = v8::Utils::OpenHandle(*string);
-    CcTest::CollectGarbage(i::NEW_SPACE);
+    i::heap::InvokeMinorGC(CcTest::heap());
     in_young_generation = i::Heap::InYoungGeneration(*istring);
     CHECK_IMPLIES(!in_young_generation,
                   CcTest::heap()->old_space()->Contains(*istring));
     CHECK_EQ(0, dispose_count);
   }
-  CcTest::CollectGarbage(in_young_generation ? i::NEW_SPACE : i::OLD_SPACE);
+  in_young_generation ? i::heap::InvokeMinorGC(CcTest::heap())
+                      : i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(1, dispose_count);
 }
 
 TEST(ScavengeExternalOneByteString) {
-  ManualGCScope manual_gc_scope;
+  i::ManualGCScope manual_gc_scope;
   i::v8_flags.stress_compaction = false;
   i::v8_flags.gc_global = false;
   i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
@@ -914,13 +906,14 @@ TEST(ScavengeExternalOneByteString) {
             new TestOneByteResource(i::StrDup(one_byte_string), &dispose_count))
             .ToLocalChecked();
     i::Handle<i::String> istring = v8::Utils::OpenHandle(*string);
-    CcTest::CollectGarbage(i::NEW_SPACE);
+    i::heap::InvokeMinorGC(CcTest::heap());
     in_young_generation = i::Heap::InYoungGeneration(*istring);
     CHECK_IMPLIES(!in_young_generation,
                   CcTest::heap()->old_space()->Contains(*istring));
     CHECK_EQ(0, dispose_count);
   }
-  CcTest::CollectGarbage(in_young_generation ? i::NEW_SPACE : i::OLD_SPACE);
+  in_young_generation ? i::heap::InvokeMinorGC(CcTest::heap())
+                      : i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(1, dispose_count);
 }
 
@@ -967,11 +960,11 @@ TEST(ExternalStringWithDisposeHandling) {
     Local<Value> value = script->Run(env.local()).ToLocalChecked();
     CHECK(value->IsNumber());
     CHECK_EQ(7, value->Int32Value(env.local()).FromJust());
-    CcTest::CollectAllAvailableGarbage();
+    i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
     CHECK_EQ(0, TestOneByteResourceWithDisposeControl::dispose_count);
   }
   CcTest::i_isolate()->compilation_cache()->Clear();
-  CcTest::CollectAllAvailableGarbage();
+  i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(1, TestOneByteResourceWithDisposeControl::dispose_calls);
   CHECK_EQ(0, TestOneByteResourceWithDisposeControl::dispose_count);
 
@@ -990,11 +983,11 @@ TEST(ExternalStringWithDisposeHandling) {
     Local<Value> value = script->Run(env.local()).ToLocalChecked();
     CHECK(value->IsNumber());
     CHECK_EQ(7, value->Int32Value(env.local()).FromJust());
-    CcTest::CollectAllAvailableGarbage();
+    i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
     CHECK_EQ(0, TestOneByteResourceWithDisposeControl::dispose_count);
   }
   CcTest::i_isolate()->compilation_cache()->Clear();
-  CcTest::CollectAllAvailableGarbage();
+  i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK_EQ(1, TestOneByteResourceWithDisposeControl::dispose_calls);
   CHECK_EQ(1, TestOneByteResourceWithDisposeControl::dispose_count);
 }
@@ -1051,8 +1044,8 @@ THREADED_TEST(StringConcat) {
     CHECK_EQ(68, value->Int32Value(env.local()).FromJust());
   }
   CcTest::i_isolate()->compilation_cache()->Clear();
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
 
@@ -1086,6 +1079,7 @@ static void handle_callback_2(const v8::FunctionCallbackInfo<Value>& info) {
 
 static void construct_callback(
     const v8::FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   CheckReturnValue(info, FUNCTION_ADDR(construct_callback));
   CHECK(
@@ -1103,6 +1097,7 @@ static void construct_callback(
 
 static void Return239Callback(
     Local<String> name, const v8::PropertyCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   CheckReturnValue(info, FUNCTION_ADDR(Return239Callback));
   info.GetReturnValue().Set(v8_str("bad value"));
@@ -1146,7 +1141,6 @@ static void TestFunctionTemplateInitializer(Handler handler,
   }
 }
 
-
 template<typename Constructor, typename Accessor>
 static void TestFunctionTemplateAccessor(Constructor constructor,
                                          Accessor accessor) {
@@ -1457,6 +1451,7 @@ THREADED_TEST(FunctionTemplateSetLength) {
 
 static void* expected_ptr;
 static void callback(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   void* ptr = v8::External::Cast(*args.Data())->Value();
   CHECK_EQ(expected_ptr, ptr);
   args.GetReturnValue().Set(true);
@@ -2048,15 +2043,15 @@ THREADED_TEST(Boolean) {
              ->BooleanValue(isolate));
 }
 
-
-static void DummyCallHandler(const v8::FunctionCallbackInfo<v8::Value>& args) {
+static void DummyCallHandler(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
-  args.GetReturnValue().Set(v8_num(13.4));
+  info.GetReturnValue().Set(v8_num(13.4));
 }
 
-
 static void GetM(Local<String> name,
                  const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   info.GetReturnValue().Set(v8_num(876));
 }
@@ -2162,12 +2157,14 @@ THREADED_TEST(IntegerValue) {
 
 static void GetNirk(Local<String> name,
                     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   info.GetReturnValue().Set(v8_num(900));
 }
 
 static void GetRino(Local<String> name,
                     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   info.GetReturnValue().Set(v8_num(560));
 }
@@ -2442,6 +2439,7 @@ THREADED_TEST(TestObjectTemplateClassInheritance) {
 
 static void NamedPropertyGetterWhichReturns42(
     Local<Name> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_num(42));
 }
 
@@ -2482,14 +2480,15 @@ THREADED_TEST(TestObjectTemplateReflectConstruct) {
   }
 }
 
-static void GetFlabby(const v8::FunctionCallbackInfo<v8::Value>& args) {
+static void GetFlabby(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
-  args.GetReturnValue().Set(v8_num(17.2));
+  info.GetReturnValue().Set(v8_num(17.2));
 }
 
-
 static void GetKnurd(Local<String> property,
                      const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   info.GetReturnValue().Set(v8_num(15.2));
 }
@@ -2672,6 +2671,7 @@ THREADED_TEST(DescriptorInheritance2) {
 
 void SimpleAccessorGetter(Local<String> name,
                           const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   Local<Object> self = info.This().As<Object>();
   info.GetReturnValue().Set(
       self->Get(info.GetIsolate()->GetCurrentContext(),
@@ -2681,6 +2681,7 @@ void SimpleAccessorGetter(Local<String> name,
 
 void SimpleAccessorSetter(Local<String> name, Local<Value> value,
                           const v8::PropertyCallbackInfo<void>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   Local<Object> self = info.This().As<Object>();
   CHECK(self->Set(info.GetIsolate()->GetCurrentContext(),
                   String::Concat(info.GetIsolate(), v8_str("accessor_"), name),
@@ -2690,6 +2691,7 @@ void SimpleAccessorSetter(Local<String> name, Local<Value> value,
 
 void SymbolAccessorGetter(Local<Name> name,
                           const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CHECK(name->IsSymbol());
   v8::Isolate* isolate = info.GetIsolate();
   Local<Symbol> sym = name.As<Symbol>();
@@ -2699,6 +2701,7 @@ void SymbolAccessorGetter(Local<Name> name,
 
 void SymbolAccessorSetter(Local<Name> name, Local<Value> value,
                           const v8::PropertyCallbackInfo<void>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CHECK(name->IsSymbol());
   v8::Isolate* isolate = info.GetIsolate();
   Local<Symbol> sym = name.As<Symbol>();
@@ -2709,6 +2712,7 @@ void SymbolAccessorSetter(Local<Name> name, Local<Value> value,
 
 void SymbolAccessorGetterReturnsDefault(
     Local<Name> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CHECK(name->IsSymbol());
   v8::Isolate* isolate = info.GetIsolate();
   Local<Symbol> sym = name.As<Symbol>();
@@ -2718,6 +2722,7 @@ void SymbolAccessorGetterReturnsDefault(
 
 static void ThrowingSymbolAccessorGetter(
     Local<Name> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(info.GetIsolate()->ThrowException(name));
 }
 
@@ -2729,15 +2734,17 @@ THREADED_TEST(AccessorIsPreservedOnAttributeChange) {
   LocalContext env;
   v8::Local<v8::Value> res = CompileRun("var a = []; a;");
   i::Handle<i::JSReceiver> a(v8::Utils::OpenHandle(v8::Object::Cast(*res)));
-  CHECK_EQ(1, a->map().instance_descriptors(i_isolate).number_of_descriptors());
+  CHECK_EQ(1,
+           a->map()->instance_descriptors(i_isolate)->number_of_descriptors());
   CompileRun("Object.defineProperty(a, 'length', { writable: false });");
-  CHECK_EQ(0, a->map().instance_descriptors(i_isolate).number_of_descriptors());
+  CHECK_EQ(0,
+           a->map()->instance_descriptors(i_isolate)->number_of_descriptors());
   // But we should still have an AccessorInfo.
   i::Handle<i::String> name = i_isolate->factory()->length_string();
   i::LookupIterator it(i_isolate, a, name,
                        i::LookupIterator::OWN_SKIP_INTERCEPTOR);
   CHECK_EQ(i::LookupIterator::ACCESSOR, it.state());
-  CHECK(it.GetAccessors()->IsAccessorInfo());
+  CHECK(IsAccessorInfo(*it.GetAccessors()));
 }
 
 
@@ -2754,6 +2761,7 @@ static const int kTargetRecursionDepth = 100;  // near maximum
 
 static void CallScriptRecursivelyCall(
     const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
   int depth = args.This()
@@ -2773,6 +2781,7 @@ static void CallScriptRecursivelyCall(
 
 static void CallFunctionRecursivelyCall(
     const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
   int depth = args.This()
@@ -2826,6 +2835,7 @@ static void ThrowingPropertyHandlerGet(
     Local<Name> key, const v8::PropertyCallbackInfo<v8::Value>& info) {
   // Since this interceptor is used on "with" objects, the runtime will look up
   // @@unscopables.  Punt.
+  CHECK(i::ValidateCallbackInfo(info));
   if (key->IsSymbol()) return;
   ApiTestFuzzer::Fuzz();
   info.GetReturnValue().Set(info.GetIsolate()->ThrowException(key));
@@ -2835,6 +2845,7 @@ static void ThrowingPropertyHandlerGet(
 static void ThrowingPropertyHandlerSet(
     Local<Name> key, Local<Value>,
     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetIsolate()->ThrowException(key);
   info.GetReturnValue().SetUndefined();  // not the same as empty handle
 }
@@ -2881,7 +2892,9 @@ void OnInternalFieldCheck(const char* location, const char* message) {
        strcmp(message, "Data is not a Value"));
 }
 
-THREADED_TEST(InternalDataFields) {
+// The fatal error handler would call exit() so this should not be run in
+// parallel.
+TEST(InternalDataFields) {
   LocalContext env;
   v8::Isolate* isolate = env->GetIsolate();
   v8::HandleScope scope(isolate);
@@ -2952,7 +2965,7 @@ TEST(InternalFieldsSubclassing) {
     i::Handle<i::JSObject> i_obj =
         i::Handle<i::JSObject>::cast(v8::Utils::OpenHandle(*obj));
     CHECK_EQ(nof_embedder_fields, obj->InternalFieldCount());
-    CHECK_EQ(0, i_obj->map().GetInObjectProperties());
+    CHECK_EQ(0, i_obj->map()->GetInObjectProperties());
     // Check writing and reading internal fields.
     for (int j = 0; j < nof_embedder_fields; j++) {
       CHECK(obj->GetInternalField(j).As<v8::Value>()->IsUndefined());
@@ -3017,25 +3030,25 @@ TEST(InternalFieldsSubclassing) {
           i::Handle<i::JSObject>::cast(v8::Utils::OpenHandle(*value));
 #ifdef VERIFY_HEAP
       i_value->HeapObjectVerify(i_isolate);
-      i_value->map().HeapObjectVerify(i_isolate);
-      i_value->map().FindRootMap(i_isolate).HeapObjectVerify(i_isolate);
+      i_value->map()->HeapObjectVerify(i_isolate);
+      i_value->map()->FindRootMap(i_isolate)->HeapObjectVerify(i_isolate);
 #endif
       CHECK_EQ(nof_embedder_fields, value->InternalFieldCount());
       if (in_object_only) {
-        CHECK_LE(nof_properties, i_value->map().GetInObjectProperties());
+        CHECK_LE(nof_properties, i_value->map()->GetInObjectProperties());
       } else {
-        CHECK_LE(i_value->map().GetInObjectProperties(), kMaxNofProperties);
+        CHECK_LE(i_value->map()->GetInObjectProperties(), kMaxNofProperties);
       }
 
       // Make sure we get the precise property count.
       i::MapUpdater::CompleteInobjectSlackTracking(
-          i_isolate, i_value->map().FindRootMap(i_isolate));
+          i_isolate, i_value->map()->FindRootMap(i_isolate));
       // TODO(cbruni): fix accounting to make this condition true.
       // CHECK_EQ(0, i_value->map()->UnusedPropertyFields());
       if (in_object_only) {
-        CHECK_EQ(nof_properties, i_value->map().GetInObjectProperties());
+        CHECK_EQ(nof_properties, i_value->map()->GetInObjectProperties());
       } else {
-        CHECK_LE(i_value->map().GetInObjectProperties(), kMaxNofProperties);
+        CHECK_LE(i_value->map()->GetInObjectProperties(), kMaxNofProperties);
       }
     }
   }
@@ -3086,7 +3099,7 @@ static void CheckAlignedPointerInInternalField(Local<v8::Object> obj,
                                                void* value) {
   CHECK(HAS_SMI_TAG(reinterpret_cast<i::Address>(value)));
   obj->SetAlignedPointerInInternalField(0, value);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(value, obj->GetAlignedPointerFromInternalField(0));
 }
 
@@ -3143,7 +3156,7 @@ THREADED_TEST(SetAlignedPointerInInternalFields) {
   void* values[] = {heap_allocated_1, heap_allocated_2};
 
   obj->SetAlignedPointerInInternalFields(2, indices, values);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   {
     v8::SealHandleScope no_handle_leak(isolate);
     CHECK_EQ(heap_allocated_1, obj->GetAlignedPointerFromInternalField(0));
@@ -3153,7 +3166,7 @@ THREADED_TEST(SetAlignedPointerInInternalFields) {
   indices[0] = 1;
   indices[1] = 0;
   obj->SetAlignedPointerInInternalFields(2, indices, values);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(heap_allocated_2, obj->GetAlignedPointerFromInternalField(0));
   CHECK_EQ(heap_allocated_1, obj->GetAlignedPointerFromInternalField(1));
 
@@ -3166,7 +3179,7 @@ static void CheckAlignedPointerInEmbedderData(LocalContext* env,
                                               int index, void* value) {
   CHECK_EQ(0, static_cast<int>(reinterpret_cast<uintptr_t>(value) & 0x1));
   (*env)->SetAlignedPointerInEmbedderData(index, value);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(value, (*env)->GetAlignedPointerFromEmbedderData(index));
   CHECK_EQ(value,
            some_obj->GetAlignedPointerFromEmbedderDataInCreationContext(index));
@@ -3206,7 +3219,7 @@ THREADED_TEST(EmbedderDataAlignedPointers) {
   for (int i = 0; i < 100; i++) {
     env->SetAlignedPointerInEmbedderData(i, AlignedTestPointer(i));
   }
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   for (int i = 0; i < 100; i++) {
     v8::SealHandleScope no_handle_leak(env->GetIsolate());
     CHECK_EQ(AlignedTestPointer(i), env->GetAlignedPointerFromEmbedderData(i));
@@ -3246,7 +3259,7 @@ THREADED_TEST(IdentityHash) {
 
   // Ensure that the test starts with an fresh heap to test whether the hash
   // code is based on the address.
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   Local<v8::Object> obj = v8::Object::New(isolate);
   int hash = obj->GetIdentityHash();
   int hash1 = obj->GetIdentityHash();
@@ -3256,7 +3269,7 @@ THREADED_TEST(IdentityHash) {
   // objects should not be assigned the same hash code. If the test below fails
   // the random number generator should be evaluated.
   CHECK_NE(hash, hash2);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   int hash3 = v8::Object::New(isolate)->GetIdentityHash();
   // Make sure that the identity hash is not based on the initial address of
   // the object alone. If the test below fails the random number generator
@@ -3297,11 +3310,11 @@ void GlobalProxyIdentityHash(bool set_in_js) {
   int32_t hash1;
   if (set_in_js) {
     CompileRun("var m = new Set(); m.add(global);");
-    i::Object original_hash = i_global_proxy->GetHash();
-    CHECK(original_hash.IsSmi());
+    i::Object original_hash = i::Object::GetHash(*i_global_proxy);
+    CHECK(IsSmi(original_hash));
     hash1 = i::Smi::ToInt(original_hash);
   } else {
-    hash1 = i_global_proxy->GetOrCreateHash(i_isolate).value();
+    hash1 = i::Object::GetOrCreateHash(*i_global_proxy, i_isolate).value();
   }
   // Hash should be retained after being detached.
   env->DetachGlobal();
@@ -3332,7 +3345,7 @@ TEST(SymbolIdentityHash) {
     int hash = symbol->GetIdentityHash();
     int hash1 = symbol->GetIdentityHash();
     CHECK_EQ(hash, hash1);
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     int hash3 = symbol->GetIdentityHash();
     CHECK_EQ(hash, hash3);
   }
@@ -3343,7 +3356,7 @@ TEST(SymbolIdentityHash) {
     int hash = js_symbol->GetIdentityHash();
     int hash1 = js_symbol->GetIdentityHash();
     CHECK_EQ(hash, hash1);
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     int hash3 = js_symbol->GetIdentityHash();
     CHECK_EQ(hash, hash3);
   }
@@ -3359,7 +3372,7 @@ TEST(StringIdentityHash) {
   int hash = str->GetIdentityHash();
   int hash1 = str->GetIdentityHash();
   CHECK_EQ(hash, hash1);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   int hash3 = str->GetIdentityHash();
   CHECK_EQ(hash, hash3);
 
@@ -3380,7 +3393,7 @@ THREADED_TEST(SymbolProperties) {
   v8::Local<v8::Symbol> sym3 = v8::Symbol::New(isolate, v8_str("sym3"));
   v8::Local<v8::Symbol> sym4 = v8::Symbol::New(isolate, v8_str("native"));
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   // Check basic symbol functionality.
   CHECK(sym1->IsSymbol());
@@ -3451,7 +3464,7 @@ THREADED_TEST(SymbolProperties) {
   CHECK_EQ(num_props + 1,
            obj->GetPropertyNames(env.local()).ToLocalChecked()->Length());
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   CHECK(obj->SetAccessor(env.local(), sym3, SymbolAccessorGetter,
                          SymbolAccessorSetter)
@@ -3578,7 +3591,7 @@ THREADED_TEST(PrivatePropertiesOnProxies) {
   v8::Local<v8::Private> priv2 =
       v8::Private::New(isolate, v8_str("my-private"));
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   CHECK(priv2->Name()
             ->Equals(env.local(),
@@ -3617,7 +3630,7 @@ THREADED_TEST(PrivatePropertiesOnProxies) {
   CHECK_EQ(num_props + 1,
            proxy->GetPropertyNames(env.local()).ToLocalChecked()->Length());
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   // Add another property and delete it afterwards to force the object in
   // slow case.
@@ -3669,7 +3682,7 @@ THREADED_TEST(PrivateProperties) {
   v8::Local<v8::Private> priv2 =
       v8::Private::New(isolate, v8_str("my-private"));
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   CHECK(priv2->Name()
             ->Equals(env.local(),
@@ -3707,7 +3720,7 @@ THREADED_TEST(PrivateProperties) {
   CHECK_EQ(num_props + 1,
            obj->GetPropertyNames(env.local()).ToLocalChecked()->Length());
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   // Add another property and delete it afterwards to force the object in
   // slow case.
@@ -3858,7 +3871,7 @@ THREADED_TEST(HiddenProperties) {
   v8::Local<v8::String> empty = v8_str("");
   v8::Local<v8::String> prop_name = v8_str("prop_name");
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   // Make sure delete of a non-existent hidden value works
   obj->DeletePrivate(env.local(), key).FromJust();
@@ -3876,7 +3889,7 @@ THREADED_TEST(HiddenProperties) {
                      ->Int32Value(env.local())
                      .FromJust());
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   // Make sure we do not find the hidden property.
   CHECK(!obj->Has(env.local(), empty).FromJust());
@@ -3900,7 +3913,7 @@ THREADED_TEST(HiddenProperties) {
                      ->Int32Value(env.local())
                      .FromJust());
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   // Add another property and delete it afterwards to force the object in
   // slow case.
@@ -3924,7 +3937,7 @@ THREADED_TEST(HiddenProperties) {
                      ->Int32Value(env.local())
                      .FromJust());
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   CHECK(obj->SetPrivate(env.local(), key, v8::Integer::New(isolate, 2002))
             .FromJust());
@@ -3982,10 +3995,10 @@ THREADED_TEST(External) {
 
   {
     i::Handle<i::Object> obj = v8::Utils::OpenHandle(*ext);
-    CHECK_EQ(i::HeapObject::cast(*obj).map(), CcTest::heap()->external_map());
+    CHECK_EQ(i::HeapObject::cast(*obj)->map(), CcTest::heap()->external_map());
     CHECK(ext->IsExternal());
     CHECK(!CompileRun("new Set().add(this.ext)").IsEmpty());
-    CHECK_EQ(i::HeapObject::cast(*obj).map(), CcTest::heap()->external_map());
+    CHECK_EQ(i::HeapObject::cast(*obj)->map(), CcTest::heap()->external_map());
     CHECK(ext->IsExternal());
   }
 
@@ -4241,7 +4254,7 @@ class TwoPassCallbackData {
     if (!trigger_gc) return;
     auto data_2 = new TwoPassCallbackData(isolate, metadata);
     data_2->SetWeak();
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
   }
 
   void SetWeak() {
@@ -4283,7 +4296,7 @@ TEST(TwoPassPhantomCallbacks) {
     data->SetWeak();
   }
   CHECK_EQ(static_cast<int>(kLength), metadata.instance_counter);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   EmptyMessageQueues(isolate);
 }
 
@@ -4303,7 +4316,7 @@ TEST(TwoPassPhantomCallbacksNestedGc) {
   array[10]->MarkTriggerGc();
   array[15]->MarkTriggerGc();
   CHECK_EQ(static_cast<int>(kLength), metadata.instance_counter);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   EmptyMessageQueues(isolate);
 }
 
@@ -4435,7 +4448,7 @@ void TestGlobalValueMap() {
   }
   CHECK_EQ(initial_handle_count + 1, global_handles->handles_count());
   if (map.IsWeak()) {
-    CcTest::PreciseCollectAllGarbage();
+    i::heap::InvokeAtomicMajorGC(CcTest::heap());
   } else {
     map.Clear();
   }
@@ -4914,6 +4927,51 @@ TEST(MessageGetSourceLine) {
       });
 }
 
+void GetCurrentStackTrace(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  std::stringstream ss;
+  v8::Message::PrintCurrentStackTrace(args.GetIsolate(), ss);
+  std::string str = ss.str();
+  args.GetReturnValue().Set(v8_str(str.c_str()));
+}
+
+THREADED_TEST(MessagePrintCurrentStackTrace) {
+  v8::Isolate* isolate = CcTest::isolate();
+  v8::HandleScope scope(isolate);
+  Local<ObjectTemplate> templ = ObjectTemplate::New(isolate);
+  templ->Set(isolate, "getCurrentStackTrace",
+             v8::FunctionTemplate::New(isolate, GetCurrentStackTrace));
+  LocalContext context(nullptr, templ);
+
+  v8::ScriptOrigin origin = v8::ScriptOrigin(isolate, v8_str("test"), 0, 0);
+  v8::Local<v8::String> script = v8_str(
+      "function c() {\n"
+      "  return getCurrentStackTrace();\n"
+      "}\n"
+      "function b() {\n"
+      "  return c();\n"
+      "}\n"
+      "function a() {\n"
+      "  return b();\n"
+      "}\n"
+      "a();");
+  v8::Local<v8::Value> stack_trace =
+      v8::Script::Compile(context.local(), script, &origin)
+          .ToLocalChecked()
+          ->Run(context.local())
+          .ToLocalChecked();
+
+  CHECK(stack_trace->IsString());
+  v8::String::Utf8Value stack_trace_value(isolate,
+                                          stack_trace.As<v8::String>());
+  std::string stack_trace_string(*stack_trace_value);
+  std::string expected(
+      "c (test:2:10)\n"
+      "b (test:5:10)\n"
+      "a (test:8:10)\n"
+      "test:10:1");
+  CHECK_EQ(stack_trace_string, expected);
+}
+
 THREADED_TEST(GetSetProperty) {
   LocalContext context;
   v8::Isolate* isolate = context->GetIsolate();
@@ -5128,6 +5186,7 @@ THREADED_TEST(Array) {
 
 
 void HandleF(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   v8::EscapableHandleScope scope(args.GetIsolate());
   ApiTestFuzzer::Fuzz();
   Local<v8::Array> result = v8::Array::New(args.GetIsolate(), args.Length());
@@ -5625,6 +5684,7 @@ THREADED_TEST(ConversionException) {
 
 
 void ThrowFromC(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   args.GetIsolate()->ThrowException(v8_str("konto"));
 }
@@ -5874,6 +5934,7 @@ THREADED_TEST(ExternalScriptException) {
 
 
 void CThrowCountDown(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   CHECK_EQ(4, args.Length());
   v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
@@ -5913,6 +5974,7 @@ void CThrowCountDown(const v8::FunctionCallbackInfo<v8::Value>& args) {
 
 
 void JSCheck(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   CHECK_EQ(3, args.Length());
   v8::Isolate* isolate = args.GetIsolate();
@@ -6025,6 +6087,7 @@ TEST(ExceptionOrder) {
 
 
 void ThrowValue(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   CHECK_EQ(1, args.Length());
   args.GetIsolate()->ThrowException(args[0]);
@@ -6112,6 +6175,7 @@ THREADED_TEST(TryCatchAndFinallyHidingException) {
 
 
 void WithTryCatch(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   v8::TryCatch try_catch(args.GetIsolate());
 }
 
@@ -6154,6 +6218,7 @@ void TryCatchMixedNestingCheck(v8::TryCatch* try_catch) {
 
 void TryCatchMixedNestingHelper(
     const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   v8::TryCatch try_catch(args.GetIsolate());
   CompileRunWithOrigin("throw new Error('a');\n", "inner", 0, 0);
@@ -6182,6 +6247,7 @@ TEST(TryCatchMixedNesting) {
 
 
 void TryCatchNativeHelper(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   v8::TryCatch try_catch(args.GetIsolate());
   args.GetIsolate()->ThrowException(v8_str("boom"));
@@ -6204,6 +6270,7 @@ TEST(TryCatchNative) {
 
 void TryCatchNativeResetHelper(
     const v8::FunctionCallbackInfo<v8::Value>& args) {
+  CHECK(i::ValidateCallbackInfo(args));
   ApiTestFuzzer::Fuzz();
   v8::TryCatch try_catch(args.GetIsolate());
   args.GetIsolate()->ThrowException(v8_str("boom"));
@@ -6378,6 +6445,7 @@ THREADED_TEST(MultiRun) {
 
 static void GetXValue(Local<Name> name,
                       const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   CHECK(info.Data()
             ->Equals(CcTest::isolate()->GetCurrentContext(), v8_str("donut"))
@@ -6673,6 +6741,7 @@ THREADED_TEST(DontDeleteAPIAccessorsCannotBeOverriden) {
 
 static void Get239Value(Local<Name> name,
                         const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   CHECK(info.Data()
             ->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("donut"))
@@ -6716,6 +6785,7 @@ v8::Persistent<Value> xValue;
 
 static void SetXValue(Local<Name> name, Local<Value> value,
                       const v8::PropertyCallbackInfo<void>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   Local<Context> context = info.GetIsolate()->GetCurrentContext();
   CHECK(value->Equals(context, v8_num(4)).FromJust());
   CHECK(info.Data()->Equals(context, v8_str("donut")).FromJust());
@@ -7680,7 +7750,7 @@ static void SetFlag(const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
 }
 
 static void IndependentWeakHandle(bool global_gc, bool interlinked) {
-  ManualGCScope manual_gc_scope;
+  i::ManualGCScope manual_gc_scope;
   i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
       CcTest::heap());
   // Parallel scavenge introduces too much fragmentation.
@@ -7707,14 +7777,15 @@ static void IndependentWeakHandle(bool global_gc, bool interlinked) {
       b->Set(context, v8_str("x"), a).FromJust();
     }
     if (i::v8_flags.single_generation || global_gc) {
-      CcTest::CollectAllGarbage();
+      i::heap::InvokeMajorGC(CcTest::heap());
     } else {
-      CcTest::CollectGarbage(i::NEW_SPACE);
+      i::heap::InvokeMinorGC(CcTest::heap());
     }
     v8::Local<Value> big_array = v8::Array::New(CcTest::isolate(), 5000);
     // Verify that we created an array where the space was reserved up front.
-    big_array_size =
-        i::JSArray::cast(*v8::Utils::OpenHandle(*big_array)).elements().Size();
+    big_array_size = i::JSArray::cast(*v8::Utils::OpenHandle(*big_array))
+                         ->elements()
+                         ->Size();
     CHECK_LE(20000, big_array_size);
     a->Set(context, v8_str("y"), big_array).FromJust();
     big_heap_size = CcTest::heap()->SizeOfObjects();
@@ -7727,9 +7798,9 @@ static void IndependentWeakHandle(bool global_gc, bool interlinked) {
   object_b.handle.SetWeak(&object_b, &SetFlag,
                           v8::WeakCallbackType::kParameter);
   if (i::v8_flags.single_generation || global_gc) {
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
   } else {
-    CcTest::CollectGarbage(i::NEW_SPACE);
+    i::heap::InvokeMinorGC(CcTest::heap());
   }
   // A single GC should be enough to reclaim the memory, since we are using
   // phantom handles.
@@ -7789,7 +7860,7 @@ void InternalFieldCallback(bool global_gc) {
   // setting internal pointer fields mark the object for a heap layout change,
   // which prevents it from being reclaimed and the callbacks from being
   // executed.
-  ManualGCScope manual_gc_scope;
+  i::ManualGCScope manual_gc_scope;
   i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
       CcTest::heap());
 
@@ -7829,9 +7900,9 @@ void InternalFieldCallback(bool global_gc) {
   }
 
   if (i::v8_flags.single_generation || global_gc) {
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
   } else {
-    CcTest::CollectGarbage(i::NEW_SPACE);
+    i::heap::InvokeMinorGC(CcTest::heap());
   }
 
   CHECK_EQ(1729, t1->x());
@@ -7864,6 +7935,8 @@ void i::heap::HeapTester::ResetWeakHandle(bool global_gc) {
   v8::HandleScope scope(iso);
   v8::Local<Context> context = Context::New(iso);
   Context::Scope context_scope(context);
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+      CcTest::heap());
 
   FlagAndPersistent object_a, object_b;
 
@@ -7874,9 +7947,9 @@ void i::heap::HeapTester::ResetWeakHandle(bool global_gc) {
     object_a.handle.Reset(iso, a);
     object_b.handle.Reset(iso, b);
     if (global_gc || v8_flags.single_generation) {
-      CcTest::PreciseCollectAllGarbage();
+      i::heap::InvokeAtomicMajorGC(CcTest::heap());
     } else {
-      CcTest::CollectGarbage(i::NEW_SPACE);
+      i::heap::InvokeMinorGC(CcTest::heap());
     }
   }
 
@@ -7886,10 +7959,11 @@ void i::heap::HeapTester::ResetWeakHandle(bool global_gc) {
                           v8::WeakCallbackType::kParameter);
   object_b.handle.SetWeak(&object_b, &ResetUseValueAndSetFlag,
                           v8::WeakCallbackType::kParameter);
+
   if (global_gc || v8_flags.single_generation) {
-    CcTest::PreciseCollectAllGarbage();
+    i::heap::InvokeAtomicMajorGC(CcTest::heap());
   } else {
-    CcTest::CollectGarbage(i::NEW_SPACE);
+    i::heap::InvokeMinorGC(CcTest::heap());
   }
   CHECK(object_a.flag);
   CHECK(object_b.flag);
@@ -7900,32 +7974,24 @@ THREADED_HEAP_TEST(ResetWeakHandle) {
   i::heap::HeapTester::ResetWeakHandle(true);
 }
 
-static void InvokeScavenge() { CcTest::CollectGarbage(i::NEW_SPACE); }
-
-static void InvokeMarkSweep() { CcTest::CollectAllGarbage(); }
-
-static void ForceScavenge2(
-    const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
+static void ForceMinorGC2(const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
   data.GetParameter()->flag = true;
-  InvokeScavenge();
+  i::heap::InvokeMinorGC(CcTest::heap());
 }
 
-static void ForceScavenge1(
-    const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
+static void ForceMinorGC1(const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
   data.GetParameter()->handle.Reset();
-  data.SetSecondPassCallback(ForceScavenge2);
+  data.SetSecondPassCallback(ForceMinorGC2);
 }
 
-static void ForceMarkSweep2(
-    const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
+static void ForceFullGC2(const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
   data.GetParameter()->flag = true;
-  InvokeMarkSweep();
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
-static void ForceMarkSweep1(
-    const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
+static void ForceFullGC1(const v8::WeakCallbackInfo<FlagAndPersistent>& data) {
   data.GetParameter()->handle.Reset();
-  data.SetSecondPassCallback(ForceMarkSweep2);
+  data.SetSecondPassCallback(ForceFullGC2);
 }
 
 THREADED_TEST(GCFromWeakCallbacks) {
@@ -7944,9 +8010,9 @@ THREADED_TEST(GCFromWeakCallbacks) {
       object.handle.Reset(isolate, v8::Object::New(isolate));
     }
     object.flag = false;
-    object.handle.SetWeak(&object, &ForceMarkSweep1,
+    object.handle.SetWeak(&object, &ForceFullGC1,
                           v8::WeakCallbackType::kParameter);
-    InvokeMarkSweep();
+    i::heap::InvokeMajorGC(CcTest::heap());
     EmptyMessageQueues(isolate);
     CHECK(object.flag);
     return;
@@ -7954,11 +8020,14 @@ THREADED_TEST(GCFromWeakCallbacks) {
 
   static const int kNumberOfGCTypes = 2;
   using Callback = v8::WeakCallbackInfo<FlagAndPersistent>::Callback;
-  Callback gc_forcing_callback[kNumberOfGCTypes] = {&ForceScavenge1,
-                                                    &ForceMarkSweep1};
+  Callback gc_forcing_callback[kNumberOfGCTypes] = {&ForceMinorGC1,
+                                                    &ForceFullGC1};
 
   using GCInvoker = void (*)();
-  GCInvoker invoke_gc[kNumberOfGCTypes] = {&InvokeScavenge, &InvokeMarkSweep};
+
+  GCInvoker invoke_gc[kNumberOfGCTypes] = {
+      []() { i::heap::InvokeMinorGC(CcTest::heap()); },
+      []() { i::heap::InvokeMajorGC(CcTest::heap()); }};
 
   for (int outer_gc = 0; outer_gc < kNumberOfGCTypes; outer_gc++) {
     for (int inner_gc = 0; inner_gc < kNumberOfGCTypes; inner_gc++) {
@@ -7991,7 +8060,7 @@ static void ArgumentsTestCallback(
   CHECK(v8::Integer::New(isolate, 3)->Equals(context, args[2]).FromJust());
   CHECK(v8::Undefined(isolate)->Equals(context, args[3]).FromJust());
   v8::HandleScope scope(args.GetIsolate());
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
 
@@ -8016,6 +8085,7 @@ static int p_getter_count2;
 
 static void PGetter(Local<Name> name,
                     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   p_getter_count++;
   v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
@@ -8069,6 +8139,7 @@ static void RunHolderTest(v8::Local<v8::ObjectTemplate> obj) {
 
 static void PGetter2(Local<Name> name,
                      const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   p_getter_count2++;
   v8::Isolate* isolate = info.GetIsolate();
@@ -8854,6 +8925,7 @@ THREADED_TEST(ExceptionCreateMessageLength) {
 
 static void YGetter(Local<String> name,
                     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   info.GetReturnValue().Set(v8_num(10));
 }
@@ -8862,6 +8934,7 @@ static void YGetter(Local<String> name,
 static void YSetter(Local<String> name,
                     Local<Value> value,
                     const v8::PropertyCallbackInfo<void>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   Local<Object> this_obj = info.This().As<Object>();
   v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
   if (this_obj->Has(context, name).FromJust())
@@ -9219,7 +9292,7 @@ static bool security_check_with_gc_called;
 static bool SecurityTestCallbackWithGC(Local<v8::Context> accessing_context,
                                        Local<v8::Object> accessed_object,
                                        Local<v8::Value> data) {
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   security_check_with_gc_called = true;
   return true;
 }
@@ -9710,18 +9783,18 @@ static int g_echo_value = -1;
 static void EchoGetter(
     Local<String> name,
     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_num(g_echo_value));
 }
 
-
 static void EchoSetter(Local<String> name, Local<Value> value,
-                       const v8::PropertyCallbackInfo<void>& args) {
+                       const v8::PropertyCallbackInfo<void>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (value->IsNumber())
     g_echo_value =
-        value->Int32Value(args.GetIsolate()->GetCurrentContext()).FromJust();
+        value->Int32Value(info.GetIsolate()->GetCurrentContext()).FromJust();
 }
 
-
 static void UnreachableGetter(
     Local<String> name,
     const v8::PropertyCallbackInfo<v8::Value>& info) {
@@ -10082,6 +10155,7 @@ TEST(Regress470113) {
 
 static void ConstTenGetter(Local<String> name,
                            const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_num(10));
 }
 
@@ -10299,10 +10373,10 @@ THREADED_TEST(InstanceProperties) {
   CHECK_EQ(12, value->Int32Value(context.local()).FromJust());
 }
 
-
 static void GlobalObjectInstancePropertiesGet(
-    Local<Name> key, const v8::PropertyCallbackInfo<v8::Value>&) {
+    Local<Name> key, const v8::PropertyCallbackInfo<v8::Value>& info) {
   // The request is not intercepted so don't call ApiTestFuzzer::Fuzz() here.
+  CHECK(i::ValidateCallbackInfo(info));
 }
 
 static int script_execution_count = 0;
@@ -10555,30 +10629,30 @@ static int shadow_y;
 static int shadow_y_setter_call_count;
 static int shadow_y_getter_call_count;
 
-
-static void ShadowYSetter(Local<String>,
-                          Local<Value>,
-                          const v8::PropertyCallbackInfo<void>&) {
+static void ShadowYSetter(Local<String>, Local<Value>,
+                          const v8::PropertyCallbackInfo<void>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   shadow_y_setter_call_count++;
   shadow_y = 42;
 }
 
-
 static void ShadowYGetter(Local<String> name,
                           const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   shadow_y_getter_call_count++;
   info.GetReturnValue().Set(v8_num(shadow_y));
 }
 
-
 static void ShadowIndexedGet(uint32_t index,
-                             const v8::PropertyCallbackInfo<v8::Value>&) {
+                             const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
 }
 
-
 static void ShadowNamedGet(Local<Name> key,
-                           const v8::PropertyCallbackInfo<v8::Value>&) {}
+                           const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+}
 
 THREADED_TEST(ShadowObject) {
   shadow_y = shadow_y_setter_call_count = shadow_y_getter_call_count = 0;
@@ -10678,9 +10752,9 @@ THREADED_TEST(ShadowObjectAndDataProperty) {
   // slow_stub bailout which would mean a trip to the runtime on all
   // subsequent stores, and a lack of feedback for the optimizing
   // compiler downstream.
-  i::HeapObject heap_object;
+  i::Tagged<i::HeapObject> heap_object;
   CHECK(nexus.GetFeedback().GetHeapObject(&heap_object));
-  CHECK(heap_object.IsPropertyCell());
+  CHECK(IsPropertyCell(heap_object));
 }
 
 THREADED_TEST(ShadowObjectAndDataPropertyTurbo) {
@@ -10722,9 +10796,9 @@ THREADED_TEST(ShadowObjectAndDataPropertyTurbo) {
   CHECK_EQ(i::FeedbackSlotKind::kStoreGlobalSloppy, nexus.kind());
   CompileRun("%OptimizeFunctionOnNextCall(foo); foo(1)");
   CHECK_EQ(i::InlineCacheState::MONOMORPHIC, nexus.ic_state());
-  i::HeapObject heap_object;
+  i::Tagged<i::HeapObject> heap_object;
   CHECK(nexus.GetFeedback().GetHeapObject(&heap_object));
-  CHECK(heap_object.IsPropertyCell());
+  CHECK(IsPropertyCell(heap_object));
 }
 
 THREADED_TEST(SetPrototype) {
@@ -11025,7 +11099,7 @@ THREADED_TEST(Constructor) {
       context->Global()->Set(context.local(), v8_str("Fun"), cons).FromJust());
   Local<v8::Object> inst = cons->NewInstance(context.local()).ToLocalChecked();
   i::Handle<i::JSReceiver> obj(v8::Utils::OpenHandle(*inst));
-  CHECK(obj->IsJSObject());
+  CHECK(IsJSObject(*obj));
   Local<Value> value = CompileRun("(new Fun()).constructor === Fun");
   CHECK(value->BooleanValue(isolate));
 }
@@ -11660,55 +11734,57 @@ THREADED_TEST(HandleIteration) {
 
 static void InterceptorCallICFastApi(
     Local<Name> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   // The request is not intercepted so don't call ApiTestFuzzer::Fuzz() here.
   CheckReturnValue(info, FUNCTION_ADDR(InterceptorCallICFastApi));
   int* call_count =
       reinterpret_cast<int*>(v8::External::Cast(*info.Data())->Value());
   ++(*call_count);
   if ((*call_count) % 20 == 0) {
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
   }
 }
 
 static void FastApiCallback_TrivialSignature(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
-  CheckReturnValue(args, FUNCTION_ADDR(FastApiCallback_TrivialSignature));
+  CheckReturnValue(info, FUNCTION_ADDR(FastApiCallback_TrivialSignature));
   v8::Isolate* isolate = CcTest::isolate();
-  CHECK_EQ(isolate, args.GetIsolate());
-  CHECK(args.This()
-            ->Equals(isolate->GetCurrentContext(), args.Holder())
+  CHECK_EQ(isolate, info.GetIsolate());
+  CHECK(info.This()
+            ->Equals(isolate->GetCurrentContext(), info.Holder())
             .FromJust());
-  CHECK(args.Data()
+  CHECK(info.Data()
             ->Equals(isolate->GetCurrentContext(), v8_str("method_data"))
             .FromJust());
-  args.GetReturnValue().Set(
-      args[0]->Int32Value(isolate->GetCurrentContext()).FromJust() + 1);
+  info.GetReturnValue().Set(
+      info[0]->Int32Value(isolate->GetCurrentContext()).FromJust() + 1);
 }
 
 static void FastApiCallback_SimpleSignature(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
-  CheckReturnValue(args, FUNCTION_ADDR(FastApiCallback_SimpleSignature));
+  CheckReturnValue(info, FUNCTION_ADDR(FastApiCallback_SimpleSignature));
   v8::Isolate* isolate = CcTest::isolate();
-  CHECK_EQ(isolate, args.GetIsolate());
-  CHECK(args.This()
+  CHECK_EQ(isolate, info.GetIsolate());
+  CHECK(info.This()
             ->GetPrototype()
-            ->Equals(isolate->GetCurrentContext(), args.Holder())
+            ->Equals(isolate->GetCurrentContext(), info.Holder())
             .FromJust());
-  CHECK(args.Data()
+  CHECK(info.Data()
             ->Equals(isolate->GetCurrentContext(), v8_str("method_data"))
             .FromJust());
   // Note, we're using HasRealNamedProperty instead of Has to avoid
   // invoking the interceptor again.
-  CHECK(args.Holder()
+  CHECK(info.Holder()
             ->HasRealNamedProperty(isolate->GetCurrentContext(), v8_str("foo"))
             .FromJust());
-  args.GetReturnValue().Set(
-      args[0]->Int32Value(isolate->GetCurrentContext()).FromJust() + 1);
+  info.GetReturnValue().Set(
+      info[0]->Int32Value(isolate->GetCurrentContext()).FromJust() + 1);
 }
 
-
 // Helper to maximize the odds of object moving.
 static void GenerateSomeGarbage() {
   CompileRun(
@@ -11719,17 +11795,16 @@ static void GenerateSomeGarbage() {
       "garbage = undefined;");
 }
 
-
-void DirectApiCallback(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void DirectApiCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   static int count = 0;
   if (count++ % 3 == 0) {
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     // This should move the stub
     GenerateSomeGarbage();  // This should ensure the old stub memory is flushed
   }
 }
 
-
 THREADED_TEST(CallICFastApi_DirectCall_GCMoveStub) {
   LocalContext context;
   v8::Isolate* isolate = context->GetIsolate();
@@ -11789,7 +11864,7 @@ static int p_getter_count_3;
 
 static Local<Value> DoDirectGetter() {
   if (++p_getter_count_3 % 3 == 0) {
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     GenerateSomeGarbage();
   }
   return v8_str("Direct Getter Result");
@@ -11797,6 +11872,7 @@ static Local<Value> DoDirectGetter() {
 
 static void DirectGetterCallback(
     Local<String> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CheckReturnValue(info, FUNCTION_ADDR(DirectGetterCallback));
   info.GetReturnValue().Set(DoDirectGetter());
 }
@@ -11831,6 +11907,7 @@ THREADED_PROFILED_TEST(LoadICFastApi_DirectCall_GCMoveStub) {
 
 void ThrowingDirectGetterCallback(
     Local<String> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetIsolate()->ThrowException(v8_str("g"));
 }
 
@@ -11924,6 +12001,7 @@ THREADED_PROFILED_TEST(CallICFastApi_TrivialSignature) {
 
 static void ThrowingGetter(Local<String> name,
                            const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   info.GetIsolate()->ThrowException(Local<Value>());
   info.GetReturnValue().SetUndefined();
@@ -12136,6 +12214,7 @@ THREADED_TEST(ExceptionsDoNotPropagatePastTryCatch) {
 
 static void ParentGetter(Local<String> name,
                          const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   info.GetReturnValue().Set(v8_num(1));
 }
@@ -12143,6 +12222,7 @@ static void ParentGetter(Local<String> name,
 
 static void ChildGetter(Local<String> name,
                         const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   info.GetReturnValue().Set(v8_num(42));
 }
@@ -12212,6 +12292,7 @@ THREADED_TEST(Overriding) {
 
 static void ShouldThrowOnErrorGetter(
     Local<Name> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   v8::Isolate* isolate = info.GetIsolate();
   Local<Boolean> should_throw_on_error =
@@ -12223,6 +12304,7 @@ static void ShouldThrowOnErrorGetter(
 template <typename T>
 static void ShouldThrowOnErrorSetter(Local<Name> name, Local<v8::Value> value,
                                      const v8::PropertyCallbackInfo<T>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   v8::Isolate* isolate = info.GetIsolate();
   auto context = isolate->GetCurrentContext();
@@ -12275,6 +12357,7 @@ THREADED_TEST(AccessorShouldThrowOnError) {
 
 static void ShouldThrowOnErrorQuery(
     Local<Name> name, const v8::PropertyCallbackInfo<v8::Integer>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   v8::Isolate* isolate = info.GetIsolate();
   info.GetReturnValue().Set(v8::None);
@@ -12291,6 +12374,7 @@ static void ShouldThrowOnErrorQuery(
 
 static void ShouldThrowOnErrorDeleter(
     Local<Name> name, const v8::PropertyCallbackInfo<v8::Boolean>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   v8::Isolate* isolate = info.GetIsolate();
   info.GetReturnValue().Set(v8::True(isolate));
@@ -12309,6 +12393,7 @@ static void ShouldThrowOnErrorDeleter(
 
 static void ShouldThrowOnErrorPropertyEnumerator(
     const v8::PropertyCallbackInfo<v8::Array>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   ApiTestFuzzer::Fuzz();
   v8::Isolate* isolate = info.GetIsolate();
   Local<v8::Array> names = v8::Array::New(isolate, 1);
@@ -12662,13 +12747,13 @@ TEST(CallHandlerAsFunctionHasNoSideEffectNotSupported) {
             .IsEmpty());
 
   // Side-effect-free version is not supported.
-  i::FunctionTemplateInfo cons = i::FunctionTemplateInfo::cast(
+  i::Tagged<i::FunctionTemplateInfo> cons = i::FunctionTemplateInfo::cast(
       v8::Utils::OpenHandle(*templ)->constructor());
   i::Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap();
   i::CallHandlerInfo handler_info =
-      i::CallHandlerInfo::cast(cons.GetInstanceCallHandler());
-  CHECK(!handler_info.IsSideEffectFreeCallHandlerInfo());
-  handler_info.set_map(
+      i::CallHandlerInfo::cast(cons->GetInstanceCallHandler());
+  CHECK(!handler_info->IsSideEffectFreeCallHandlerInfo());
+  handler_info->set_map(
       i::ReadOnlyRoots(heap).side_effect_free_call_handler_info_map());
   CHECK(v8::debug::EvaluateGlobal(
             isolate, v8_str("obj()"),
@@ -13055,12 +13140,13 @@ UNINITIALIZED_TEST(SharedObjectGetConstructorName) {
   isolate->Dispose();
 }
 
+unsigned ApiTestFuzzer::linear_congruential_generator;
+std::vector<std::unique_ptr<ApiTestFuzzer>> ApiTestFuzzer::fuzzers_;
 bool ApiTestFuzzer::fuzzing_ = false;
 v8::base::Semaphore ApiTestFuzzer::all_tests_done_(0);
-int ApiTestFuzzer::active_tests_;
 int ApiTestFuzzer::tests_being_run_;
-int ApiTestFuzzer::current_;
-
+int ApiTestFuzzer::active_tests_;
+int ApiTestFuzzer::current_fuzzer_;
 
 // We are in a callback and want to switch to another thread (if we
 // are currently running the thread fuzzing test).
@@ -13071,32 +13157,38 @@ void ApiTestFuzzer::Fuzz() {
   CcTest::i_isolate()->IncrementJavascriptExecutionCounter();
 
   if (!fuzzing_) return;
-  ApiTestFuzzer* test = RegisterThreadedTest::nth(current_)->fuzzer_;
-  test->ContextSwitch();
+  fuzzers_[current_fuzzer_]->ContextSwitch();
 }
 
 
 // Let the next thread go.  Since it is also waiting on the V8 lock it may
 // not start immediately.
 bool ApiTestFuzzer::NextThread() {
-  int test_position = GetNextTestNumber();
-  const char* test_name = RegisterThreadedTest::nth(current_)->name();
-  if (test_position == current_) {
-    if (kLogThreading)
-      printf("Stay with %s\n", test_name);
+  int next_fuzzer = GetNextFuzzer();
+  if (next_fuzzer == current_fuzzer_) {
+    if (kLogThreading) {
+      int current_number = fuzzers_[current_fuzzer_]->test_number_;
+      printf("Stay with %s #%d\n",
+             RegisterThreadedTest::nth(current_number)->name(), current_number);
+    }
     return false;
   }
   if (kLogThreading) {
-    printf("Switch from %s to %s\n",
-           test_name,
-           RegisterThreadedTest::nth(test_position)->name());
-  }
-  current_ = test_position;
-  RegisterThreadedTest::nth(current_)->fuzzer_->gate_.Signal();
+    int current_number =
+        current_fuzzer_ >= 0 ? fuzzers_[current_fuzzer_]->test_number_ : -1;
+    int next_number = fuzzers_[next_fuzzer]->test_number_;
+    printf("Switch from %s #%d to %s #%d\n",
+           current_number >= 0
+               ? RegisterThreadedTest::nth(current_number)->name()
+               : "<none>",
+           current_number, RegisterThreadedTest::nth(next_number)->name(),
+           next_number);
+  }
+  current_fuzzer_ = next_fuzzer;
+  fuzzers_[current_fuzzer_]->gate_.Signal();
   return true;
 }
 
-
 void ApiTestFuzzer::Run() {
   // Wait until it is our turn.
   gate_.Wait();
@@ -13119,10 +13211,6 @@ void ApiTestFuzzer::Run() {
   }
 }
 
-
-static unsigned linear_congruential_generator;
-
-
 void ApiTestFuzzer::SetUp(PartOfTest part) {
   linear_congruential_generator = i::v8_flags.testing_prng_seed;
   fuzzing_ = true;
@@ -13130,20 +13218,16 @@ void ApiTestFuzzer::SetUp(PartOfTest part) {
   int start =  count * part / (LAST_PART + 1);
   int end = (count * (part + 1) / (LAST_PART + 1)) - 1;
   active_tests_ = tests_being_run_ = end - start + 1;
+  fuzzers_.clear();
   for (int i = 0; i < tests_being_run_; i++) {
-    RegisterThreadedTest::nth(i)->fuzzer_ = new ApiTestFuzzer(i + start);
+    fuzzers_.push_back(
+        std::unique_ptr<ApiTestFuzzer>(new ApiTestFuzzer(i + start)));
   }
-  for (int i = 0; i < active_tests_; i++) {
-    CHECK(RegisterThreadedTest::nth(i)->fuzzer_->Start());
+  for (const auto& fuzzer : fuzzers_) {
+    CHECK(fuzzer->Start());
   }
 }
 
-
-static void CallTestNumber(int test_number) {
-  (RegisterThreadedTest::nth(test_number)->callback())();
-}
-
-
 void ApiTestFuzzer::RunAllTests() {
   // This method is called when running each THREADING_TEST, which is an
   // initialized test and has entered the isolate at this point. We need to exit
@@ -13151,7 +13235,7 @@ void ApiTestFuzzer::RunAllTests() {
   // their tests.
   CcTest::isolate()->Exit();
   // Set off the first test.
-  current_ = -1;
+  current_fuzzer_ = -1;
   NextThread();
   // Wait till they are all done.
   all_tests_done_.Wait();
@@ -13159,18 +13243,16 @@ void ApiTestFuzzer::RunAllTests() {
   CcTest::isolate()->Enter();
 }
 
-
-int ApiTestFuzzer::GetNextTestNumber() {
-  int next_test;
+int ApiTestFuzzer::GetNextFuzzer() {
+  int next;
   do {
-    next_test = (linear_congruential_generator >> 16) % tests_being_run_;
+    next = (linear_congruential_generator >> 16) % tests_being_run_;
     linear_congruential_generator *= 1664525u;
     linear_congruential_generator += 1013904223u;
-  } while (!RegisterThreadedTest::nth(next_test)->fuzzer_->active_);
-  return next_test;
+  } while (!fuzzers_[next]->active_);
+  return next;
 }
 
-
 void ApiTestFuzzer::ContextSwitch() {
   // If the new thread is the same as the current thread there is nothing to do.
   if (NextThread()) {
@@ -13188,12 +13270,10 @@ void ApiTestFuzzer::ContextSwitch() {
   }
 }
 
-
 void ApiTestFuzzer::TearDown() {
   fuzzing_ = false;
-  for (int i = 0; i < RegisterThreadedTest::count(); i++) {
-    ApiTestFuzzer *fuzzer = RegisterThreadedTest::nth(i)->fuzzer_;
-    if (fuzzer != nullptr) fuzzer->Join();
+  for (const auto& fuzzer : fuzzers_) {
+    if (fuzzer) fuzzer->Join();
   }
 }
 
@@ -13202,7 +13282,7 @@ void ApiTestFuzzer::CallTest() {
   if (kLogThreading)
     printf("Start test %s #%d\n",
            RegisterThreadedTest::nth(test_number_)->name(), test_number_);
-  CallTestNumber(test_number_);
+  (RegisterThreadedTest::nth(test_number_)->callback())();
   if (kLogThreading)
     printf("End test %s #%d\n", RegisterThreadedTest::nth(test_number_)->name(),
            test_number_);
@@ -13380,10 +13460,10 @@ static int GetGlobalObjectsCount() {
   i::HeapObjectIterator it(CcTest::heap());
   for (i::HeapObject object = it.Next(); !object.is_null();
        object = it.Next()) {
-    if (object.IsJSGlobalObject()) {
+    if (IsJSGlobalObject(object)) {
       i::JSGlobalObject g = i::JSGlobalObject::cast(object);
       // Skip dummy global object.
-      if (g.global_dictionary(v8::kAcquireLoad).NumberOfElements() != 0) {
+      if (g->global_dictionary(v8::kAcquireLoad)->NumberOfElements() != 0) {
         count++;
       }
     }
@@ -13400,8 +13480,8 @@ static void CheckSurvivingGlobalObjectsCount(int expected) {
   // collected until the second garbage collection.
   i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
       CcTest::heap());
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap());
   int count = GetGlobalObjectsCount();
   CHECK_EQ(expected, count);
 }
@@ -13469,7 +13549,7 @@ TEST(WeakCallbackApi) {
     handle->SetWeak<v8::Persistent<v8::Object>>(
         handle, WeakApiCallback, v8::WeakCallbackType::kParameter);
   }
-  CcTest::PreciseCollectAllGarbage();
+  i::heap::InvokeAtomicMajorGC(CcTest::heap());
   // Verify disposed.
   CHECK_EQ(initial_handles, globals->handles_count());
 }
@@ -13511,7 +13591,15 @@ THREADED_TEST(NewPersistentHandleFromWeakCallback) {
   handle1.SetWeak(&handle1, NewPersistentHandleCallback1,
                   v8::WeakCallbackType::kParameter);
   handle2.Reset();
-  CcTest::CollectAllGarbage();
+  {
+    // We need to invoke GC without stack, otherwise the weak reference may not
+    // be cleared by this GC because of conservative stack scanning and, when
+    // it is cleared, the handle object will be dead and the pointer passed
+    // as parameter to the callback will be dangling.
+    i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+        CcTest::heap());
+    i::heap::InvokeMajorGC(CcTest::heap());
+  }
 }
 
 
@@ -13521,7 +13609,7 @@ v8::Persistent<v8::Object> to_be_disposed;
 void DisposeAndForceGcCallback2(
     const v8::WeakCallbackInfo<v8::Persistent<v8::Object>>& data) {
   to_be_disposed.Reset();
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
 
@@ -13545,7 +13633,15 @@ THREADED_TEST(DoNotUseDeletedNodesInSecondLevelGc) {
   handle1.SetWeak(&handle1, DisposeAndForceGcCallback1,
                   v8::WeakCallbackType::kParameter);
   to_be_disposed.Reset(isolate, handle2);
-  CcTest::CollectAllGarbage();
+  {
+    // We need to invoke GC without stack, otherwise the weak reference may not
+    // be cleared by this GC because of conservative stack scanning and, when
+    // it is cleared, the handle object will be dead and the pointer passed
+    // as parameter to the callback will be dangling.
+    i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+        CcTest::heap());
+    i::heap::InvokeMajorGC(CcTest::heap());
+  }
 }
 
 void DisposingCallback(
@@ -13583,7 +13679,15 @@ THREADED_TEST(NoGlobalHandlesOrphaningDueToWeakCallback) {
                   v8::WeakCallbackType::kParameter);
   handle3.SetWeak(&handle3, HandleCreatingCallback1,
                   v8::WeakCallbackType::kParameter);
-  CcTest::CollectAllGarbage();
+  {
+    // We need to invoke GC without stack, otherwise the weak references may not
+    // be cleared by this GC because of conservative stack scanning and, when
+    // they are cleared, the handle objects will be dead and the pointers passed
+    // as parameters to the callbacks will be dangling.
+    i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+        CcTest::heap());
+    i::heap::InvokeMajorGC(CcTest::heap());
+  }
   EmptyMessageQueues(isolate);
 }
 
@@ -13628,6 +13732,7 @@ THREADED_TEST(NestedHandleScopeAndContexts) {
   env->Exit();
 }
 
+namespace {
 static v8::base::HashMap* instruction_stream_map = nullptr;
 static v8::base::HashMap* jitcode_line_info = nullptr;
 static int saw_bar = 0;
@@ -13760,6 +13865,7 @@ static void event_handler(const v8::JitCodeEvent* event) {
       UNREACHABLE();
   }
 }
+}  // namespace
 
 UNINITIALIZED_TEST(SetJitCodeEventHandler) {
   i::v8_flags.stress_compaction = true;
@@ -13791,7 +13897,7 @@ UNINITIALIZED_TEST(SetJitCodeEventHandler) {
   i::Heap* heap = i_isolate->heap();
 
   // Start with a clean slate.
-  CcTest::CollectAllAvailableGarbage(i_isolate);
+  i::heap::InvokeMemoryReducingMajorGCs(heap);
   {
     v8::HandleScope scope(isolate);
     v8::base::HashMap code;
@@ -13835,7 +13941,13 @@ UNINITIALIZED_TEST(SetJitCodeEventHandler) {
     }
 
     // Force code movement.
-    CcTest::CollectAllAvailableGarbage(i_isolate);
+    {
+      // We need to invoke GC without stack, otherwise no compaction is
+      // performed.
+      i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+          heap);
+      i::heap::InvokeMemoryReducingMajorGCs(heap);
+    }
 
     isolate->SetJitCodeEventHandler(v8::kJitCodeEventDefault, nullptr);
 
@@ -14168,8 +14280,8 @@ void CheckIsSymbolAt(v8::Isolate* isolate, v8::Local<v8::Array> properties,
   v8::String::Utf8Value symbol_name(
       isolate, Local<Symbol>::Cast(value)->Description(isolate));
   if (strcmp(name, *symbol_name) != 0) {
-    FATAL("properties[%u] was Symbol('%s') instead of Symbol('%s').", index,
-          name, *symbol_name);
+    GRACEFUL_FATAL("properties[%u] was Symbol('%s') instead of Symbol('%s').",
+                   index, name, *symbol_name);
   }
 }
 
@@ -14185,7 +14297,8 @@ void CheckStringArray(v8::Isolate* isolate, v8::Local<v8::Array> properties,
     } else {
       v8::String::Utf8Value elm(isolate, value);
       if (strcmp(names[i], *elm) != 0) {
-        FATAL("properties[%u] was '%s' instead of '%s'.", i, *elm, names[i]);
+        GRACEFUL_FATAL("properties[%u] was '%s' instead of '%s'.", i, *elm,
+                       names[i]);
       }
     }
   }
@@ -14834,22 +14947,24 @@ static void MorphAString(i::String string,
   i::Isolate* isolate = CcTest::i_isolate();
   CHECK(i::StringShape(string).IsExternal());
   i::ReadOnlyRoots roots(CcTest::heap());
-  if (string.IsOneByteRepresentation()) {
+  if (string->IsOneByteRepresentation()) {
     // Check old map is not internalized or long.
-    CHECK(string.map() == roots.external_one_byte_string_map());
+    CHECK(string->map() == roots.external_one_byte_string_map());
     // Morph external string to be TwoByte string.
-    string.set_map(roots.external_string_map());
-    i::ExternalTwoByteString morphed = i::ExternalTwoByteString::cast(string);
-    CcTest::heap()->UpdateExternalString(morphed, string.length(), 0);
-    morphed.SetResource(isolate, uc16_resource);
+    string->set_map(roots.external_two_byte_string_map());
+    i::Tagged<i::ExternalTwoByteString> morphed =
+        i::ExternalTwoByteString::cast(string);
+    CcTest::heap()->UpdateExternalString(morphed, string->length(), 0);
+    morphed->SetResource(isolate, uc16_resource);
   } else {
     // Check old map is not internalized or long.
-    CHECK(string.map() == roots.external_string_map());
+    CHECK(string->map() == roots.external_two_byte_string_map());
     // Morph external string to be one-byte string.
-    string.set_map(roots.external_one_byte_string_map());
-    i::ExternalOneByteString morphed = i::ExternalOneByteString::cast(string);
-    CcTest::heap()->UpdateExternalString(morphed, string.length(), 0);
-    morphed.SetResource(isolate, one_byte_resource);
+    string->set_map(roots.external_one_byte_string_map());
+    i::Tagged<i::ExternalOneByteString> morphed =
+        i::ExternalOneByteString::cast(string);
+    CcTest::heap()->UpdateExternalString(morphed, string->length(), 0);
+    morphed->SetResource(isolate, one_byte_resource);
   }
 }
 
@@ -14937,14 +15052,14 @@ THREADED_TEST(MorphCompositeStringTest) {
               .FromJust());
 
     // This avoids the GC from trying to free a stack allocated resource.
-    if (ilhs->IsExternalOneByteString())
-      i::ExternalOneByteString::cast(*ilhs).SetResource(i_isolate, nullptr);
+    if (IsExternalOneByteString(*ilhs))
+      i::ExternalOneByteString::cast(*ilhs)->SetResource(i_isolate, nullptr);
     else
-      i::ExternalTwoByteString::cast(*ilhs).SetResource(i_isolate, nullptr);
-    if (irhs->IsExternalOneByteString())
-      i::ExternalOneByteString::cast(*irhs).SetResource(i_isolate, nullptr);
+      i::ExternalTwoByteString::cast(*ilhs)->SetResource(i_isolate, nullptr);
+    if (IsExternalOneByteString(*irhs))
+      i::ExternalOneByteString::cast(*irhs)->SetResource(i_isolate, nullptr);
     else
-      i::ExternalTwoByteString::cast(*irhs).SetResource(i_isolate, nullptr);
+      i::ExternalTwoByteString::cast(*irhs)->SetResource(i_isolate, nullptr);
   }
   i::DeleteArray(two_byte_string);
 }
@@ -15648,7 +15763,7 @@ TEST(ErrorLevelWarning) {
   v8::Local<v8::Script> lscript = CompileWithOrigin(source, "test", false);
   i::Handle<i::SharedFunctionInfo> obj = i::Handle<i::SharedFunctionInfo>::cast(
       v8::Utils::OpenHandle(*lscript->GetUnboundScript()));
-  CHECK(obj->script().IsScript());
+  CHECK(IsScript(obj->script()));
   i::Handle<i::Script> script(i::Script::cast(obj->script()), i_isolate);
 
   int levels[] = {
@@ -16701,7 +16816,7 @@ static void CreateGarbageInOldSpace() {
 // Test that idle notification can be handled and eventually collects garbage.
 TEST(TestIdleNotification) {
   if (!i::v8_flags.incremental_marking) return;
-  ManualGCScope manual_gc_scope;
+  i::ManualGCScope manual_gc_scope;
   const intptr_t MB = 1024 * 1024;
   const double IdlePauseInSeconds = 1.0;
   LocalContext env;
@@ -16714,7 +16829,7 @@ TEST(TestIdleNotification) {
   for (int i = 0; i < 200 && !finished; i++) {
     if (i < 10 && CcTest::heap()->incremental_marking()->IsStopped()) {
       CcTest::heap()->StartIncrementalMarking(
-          i::Heap::kReduceMemoryFootprintMask,
+          i::GCFlag::kReduceMemoryFootprint,
           i::GarbageCollectionReason::kTesting);
     }
     START_ALLOW_USE_DEPRECATED();
@@ -16733,23 +16848,10 @@ TEST(TestIdleNotification) {
   CHECK_LT(final_size, initial_size + 1);
 }
 
-TEST(TestMemorySavingsMode) {
-  LocalContext context;
-  v8::Isolate* isolate = context->GetIsolate();
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
-  START_ALLOW_USE_DEPRECATED();
-  CHECK(!i_isolate->IsMemorySavingsModeActive());
-  isolate->EnableMemorySavingsMode();
-  CHECK(i_isolate->IsMemorySavingsModeActive());
-  isolate->DisableMemorySavingsMode();
-  CHECK(!i_isolate->IsMemorySavingsModeActive());
-  END_ALLOW_USE_DEPRECATED();
-}
-
 TEST(Regress2333) {
   LocalContext env;
   for (int i = 0; i < 3; i++) {
-    CcTest::CollectGarbage(i::NEW_SPACE);
+    i::heap::InvokeMinorGC(CcTest::heap());
   }
 }
 
@@ -16853,6 +16955,10 @@ THREADED_TEST(GetHeapStatistics) {
 }
 
 TEST(GetHeapSpaceStatistics) {
+  // This test is incompatible with concurrent allocation, which may occur
+  // while collecting the statistics and break the final `CHECK_EQ`s.
+  if (i::v8_flags.stress_concurrent_allocation) return;
+
   LocalContext c1;
   v8::Isolate* isolate = c1->GetIsolate();
   v8::HandleScope scope(isolate);
@@ -16867,7 +16973,7 @@ TEST(GetHeapSpaceStatistics) {
   isolate->GetHeapStatistics(&heap_statistics);
 
   // Ensure that the sum of all the spaces matches the totals from
-  // GetHeapSpaceStatics.
+  // GetHeapSpaceStatistics.
   size_t total_size = 0u;
   size_t total_used_size = 0u;
   size_t total_available_size = 0u;
@@ -16908,7 +17014,7 @@ TEST(NumberOfNativeContexts) {
   }
   for (size_t i = 0; i < kNumTestContexts; i++) {
     context[i].Reset();
-    CcTest::PreciseCollectAllGarbage();
+    i::heap::InvokeAtomicMajorGC(CcTest::heap());
     CcTest::isolate()->GetHeapStatistics(&heap_statistics);
     CHECK_EQ(kNumTestContexts - i - 1u,
              heap_statistics.number_of_native_contexts());
@@ -16936,65 +17042,27 @@ TEST(NumberOfDetachedContexts) {
   }
   for (size_t i = 0; i < kNumTestContexts; i++) {
     context[i].Reset();
-    CcTest::PreciseCollectAllGarbage();
+    i::heap::InvokeAtomicMajorGC(CcTest::heap());
     CcTest::isolate()->GetHeapStatistics(&heap_statistics);
     CHECK_EQ(kNumTestContexts - i - 1u,
              heap_statistics.number_of_detached_contexts());
   }
 }
 
-class VisitorImpl : public v8::ExternalResourceVisitor {
- public:
-  explicit VisitorImpl(TestResource** resource) {
-    for (int i = 0; i < 4; i++) {
-      resource_[i] = resource[i];
-      found_resource_[i] = false;
-    }
-  }
-  ~VisitorImpl() override = default;
-  void VisitExternalString(v8::Local<v8::String> string) override {
-    CHECK(string->IsExternal());
-    if (string->IsExternalOneByte()) {
-      CHECK(!string->IsExternalTwoByte());
-      return;
-    }
-    CHECK(string->IsExternalTwoByte());
-    v8::String::ExternalStringResource* resource =
-        string->GetExternalStringResource();
-    CHECK(resource);
-    for (int i = 0; i < 4; i++) {
-      if (resource_[i] == resource) {
-        CHECK(!found_resource_[i]);
-        found_resource_[i] = true;
-      }
-    }
-  }
-  void CheckVisitedResources() {
-    for (int i = 0; i < 4; i++) {
-      CHECK(found_resource_[i]);
-    }
-  }
-
- private:
-  v8::String::ExternalStringResource* resource_[4];
-  bool found_resource_[4];
-};
-
-
 TEST(ExternalizeOldSpaceTwoByteCons) {
   v8::Isolate* isolate = CcTest::isolate();
   LocalContext env;
   v8::HandleScope scope(isolate);
   v8::Local<v8::String> cons =
-      CompileRun("'Romeo Montague ' + 'Juliet Capulet'")
+      CompileRun("'Romeo Montague ' + 'Juliet Capulet ❤️'")
           ->ToString(env.local())
           .ToLocalChecked();
-  CHECK(v8::Utils::OpenHandle(*cons)->IsConsString());
-  CcTest::CollectAllAvailableGarbage();
+  CHECK(IsConsString(*v8::Utils::OpenHandle(*cons)));
+  i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK(CcTest::heap()->old_space()->Contains(*v8::Utils::OpenHandle(*cons)));
 
   TestResource* resource = new TestResource(
-      AsciiToTwoByteString("Romeo Montague Juliet Capulet"));
+      AsciiToTwoByteString(u"Romeo Montague Juliet Capulet ❤️"));
   cons->MakeExternal(resource);
 
   CHECK(cons->IsExternalTwoByte());
@@ -17014,8 +17082,8 @@ TEST(ExternalizeOldSpaceOneByteCons) {
       CompileRun("'Romeo Montague ' + 'Juliet Capulet'")
           ->ToString(env.local())
           .ToLocalChecked();
-  CHECK(v8::Utils::OpenHandle(*cons)->IsConsString());
-  CcTest::CollectAllAvailableGarbage();
+  CHECK(IsConsString(*v8::Utils::OpenHandle(*cons)));
+  i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   CHECK(CcTest::heap()->old_space()->Contains(*v8::Utils::OpenHandle(*cons)));
 
   TestOneByteResource* resource =
@@ -17029,71 +17097,6 @@ TEST(ExternalizeOldSpaceOneByteCons) {
   CHECK_EQ(String::ONE_BYTE_ENCODING, encoding);
 }
 
-
-TEST(VisitExternalStrings) {
-  v8::Isolate* isolate = CcTest::isolate();
-  LocalContext env;
-  v8::HandleScope scope(isolate);
-  const char string[] = "Some string";
-  uint16_t* two_byte_string = AsciiToTwoByteString(string);
-  TestResource* resource[5];
-  resource[0] = new TestResource(two_byte_string);
-  v8::Local<v8::String> string0 =
-      v8::String::NewExternalTwoByte(env->GetIsolate(), resource[0])
-          .ToLocalChecked();
-  resource[1] = new TestResource(two_byte_string, nullptr, false);
-  v8::Local<v8::String> string1 =
-      v8::String::NewExternalTwoByte(env->GetIsolate(), resource[1])
-          .ToLocalChecked();
-
-  // Externalized symbol.
-  resource[2] = new TestResource(two_byte_string, nullptr, false);
-  v8::Local<v8::String> string2 = v8::String::NewFromUtf8Literal(
-      env->GetIsolate(), string, v8::NewStringType::kInternalized);
-  CHECK(string2->MakeExternal(resource[2]));
-
-  // Symbolized External.
-  resource[3] = new TestResource(AsciiToTwoByteString("Some other string"));
-  v8::Local<v8::String> string3 =
-      v8::String::NewExternalTwoByte(env->GetIsolate(), resource[3])
-          .ToLocalChecked();
-  CcTest::CollectAllAvailableGarbage();  // Tenure string.
-  // Turn into a symbol.
-  i::Handle<i::String> string3_i = v8::Utils::OpenHandle(*string3);
-  CHECK(!CcTest::i_isolate()->factory()->InternalizeString(
-      string3_i).is_null());
-  CHECK(string3_i->IsInternalizedString());
-
-  // Externalized one-byte string.
-  auto one_byte_resource =
-      new TestOneByteResource(i::StrDup(string), nullptr, 0);
-  v8::Local<v8::String> string4 =
-      String::NewExternalOneByte(env->GetIsolate(), one_byte_resource)
-          .ToLocalChecked();
-
-  // We need to add usages for string* to avoid warnings in GCC 4.7
-  CHECK(string0->IsExternalTwoByte());
-  CHECK(string1->IsExternalTwoByte());
-  CHECK(string2->IsExternalTwoByte());
-  CHECK(string3->IsExternalTwoByte());
-  CHECK(!string4->IsExternalTwoByte());
-  CHECK(string0->IsExternal());
-  CHECK(string1->IsExternal());
-  CHECK(string2->IsExternal());
-  CHECK(string3->IsExternal());
-  CHECK(string4->IsExternal());
-  CHECK(!string0->IsExternalOneByte());
-  CHECK(!string1->IsExternalOneByte());
-  CHECK(!string2->IsExternalOneByte());
-  CHECK(!string3->IsExternalOneByte());
-  CHECK(string4->IsExternalOneByte());
-
-  VisitorImpl visitor(resource);
-  isolate->VisitExternalResources(&visitor);
-  visitor.CheckVisitedResources();
-}
-
-
 TEST(ExternalStringCollectedAtTearDown) {
   int destroyed = 0;
   v8::Isolate::CreateParams create_params;
@@ -17131,7 +17134,7 @@ TEST(ExternalInternalizedStringCollectedAtTearDown) {
         new TestOneByteResource(i::StrDup(s), &destroyed);
     v8::Local<v8::String> ring =
         CompileRun("ring")->ToString(env.local()).ToLocalChecked();
-    CHECK(v8::Utils::OpenHandle(*ring)->IsInternalizedString());
+    CHECK(IsInternalizedString(*v8::Utils::OpenHandle(*ring)));
     ring->MakeExternal(inscription);
     // Ring is still alive.  Orcs are roaming freely across our lands.
     CHECK_EQ(0, destroyed);
@@ -17155,7 +17158,7 @@ TEST(ExternalInternalizedStringCollectedAtGC) {
     TestOneByteResource* inscription =
         new TestOneByteResource(i::StrDup(s), &destroyed);
     v8::Local<v8::String> ring = CompileRun("ring").As<v8::String>();
-    CHECK(v8::Utils::OpenHandle(*ring)->IsInternalizedString());
+    CHECK(IsInternalizedString(*v8::Utils::OpenHandle(*ring)));
     ring->MakeExternal(inscription);
     // Ring is still alive.  Orcs are roaming freely across our lands.
     CHECK_EQ(0, destroyed);
@@ -17164,7 +17167,7 @@ TEST(ExternalInternalizedStringCollectedAtGC) {
 
   // Garbage collector deals swift blows to evil.
   CcTest::i_isolate()->compilation_cache()->Clear();
-  CcTest::CollectAllAvailableGarbage();
+  i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
 
   // Ring has been destroyed.  Free Peoples of Middle-earth Rejoice.
   CHECK_EQ(1, destroyed);
@@ -17334,7 +17337,7 @@ THREADED_TEST(SpaghettiStackReThrow) {
 
 
 TEST(Regress528) {
-  ManualGCScope manual_gc_scope;
+  i::ManualGCScope manual_gc_scope;
   v8::Isolate* isolate = CcTest::isolate();
   i::v8_flags.retain_maps_for_n_gc = 0;
   v8::HandleScope scope(isolate);
@@ -17366,7 +17369,7 @@ TEST(Regress528) {
     other_context->Enter();
     CompileRun(source_simple);
     other_context->Exit();
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     if (GetGlobalObjectsCount() == 1) break;
   }
   CHECK_GE(2, gc_count);
@@ -17388,7 +17391,7 @@ TEST(Regress528) {
     other_context->Enter();
     CompileRun(source_eval);
     other_context->Exit();
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     if (GetGlobalObjectsCount() == 1) break;
   }
   CHECK_GE(2, gc_count);
@@ -17415,7 +17418,7 @@ TEST(Regress528) {
     other_context->Enter();
     CompileRun(source_exception);
     other_context->Exit();
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     if (GetGlobalObjectsCount() == 1) break;
   }
   CHECK_GE(2, gc_count);
@@ -17620,6 +17623,24 @@ THREADED_TEST(ScriptColumnNumber) {
   CHECK_EQ(17, bar->GetScriptColumnNumber());
 }
 
+THREADED_TEST(ScriptStartPosition) {
+  LocalContext env;
+  v8::Isolate* isolate = env->GetIsolate();
+  v8::HandleScope scope(isolate);
+  v8::ScriptOrigin origin = v8::ScriptOrigin(isolate, v8_str("test"), 3, 2);
+  v8::Local<v8::String> script =
+      v8_str("function foo() {}\n\n     function bar() {}");
+  v8::Script::Compile(env.local(), script, &origin)
+      .ToLocalChecked()
+      ->Run(env.local())
+      .ToLocalChecked();
+  v8::Local<v8::Function> foo = v8::Local<v8::Function>::Cast(
+      env->Global()->Get(env.local(), v8_str("foo")).ToLocalChecked());
+  v8::Local<v8::Function> bar = v8::Local<v8::Function>::Cast(
+      env->Global()->Get(env.local(), v8_str("bar")).ToLocalChecked());
+  CHECK_EQ(12, foo->GetScriptStartPosition());
+  CHECK_EQ(36, bar->GetScriptStartPosition());
+}
 
 THREADED_TEST(FunctionGetScriptId) {
   LocalContext env;
@@ -17701,8 +17722,9 @@ THREADED_TEST(FunctionProtoToString) {
 static void GetterWhichReturns42(
     Local<String> name,
     const v8::PropertyCallbackInfo<v8::Value>& info) {
-  CHECK(v8::Utils::OpenHandle(*info.This())->IsJSObject());
-  CHECK(v8::Utils::OpenHandle(*info.Holder())->IsJSObject());
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(IsJSObject(*v8::Utils::OpenHandle(*info.This())));
+  CHECK(IsJSObject(*v8::Utils::OpenHandle(*info.Holder())));
   info.GetReturnValue().Set(v8_num(42));
 }
 
@@ -17711,8 +17733,9 @@ static void SetterWhichSetsYOnThisTo23(
     Local<String> name,
     Local<Value> value,
     const v8::PropertyCallbackInfo<void>& info) {
-  CHECK(v8::Utils::OpenHandle(*info.This())->IsJSObject());
-  CHECK(v8::Utils::OpenHandle(*info.Holder())->IsJSObject());
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(IsJSObject(*v8::Utils::OpenHandle(*info.This())));
+  CHECK(IsJSObject(*v8::Utils::OpenHandle(*info.Holder())));
   info.This()
       .As<Object>()
       ->Set(info.GetIsolate()->GetCurrentContext(), v8_str("y"), v8_num(23))
@@ -17722,8 +17745,9 @@ static void SetterWhichSetsYOnThisTo23(
 
 void FooGetInterceptor(Local<Name> name,
                        const v8::PropertyCallbackInfo<v8::Value>& info) {
-  CHECK(v8::Utils::OpenHandle(*info.This())->IsJSObject());
-  CHECK(v8::Utils::OpenHandle(*info.Holder())->IsJSObject());
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(IsJSObject(*v8::Utils::OpenHandle(*info.This())));
+  CHECK(IsJSObject(*v8::Utils::OpenHandle(*info.Holder())));
   if (!name->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("foo"))
            .FromJust()) {
     return;
@@ -17734,8 +17758,9 @@ void FooGetInterceptor(Local<Name> name,
 
 void FooSetInterceptor(Local<Name> name, Local<Value> value,
                        const v8::PropertyCallbackInfo<v8::Value>& info) {
-  CHECK(v8::Utils::OpenHandle(*info.This())->IsJSObject());
-  CHECK(v8::Utils::OpenHandle(*info.Holder())->IsJSObject());
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(IsJSObject(*v8::Utils::OpenHandle(*info.This())));
+  CHECK(IsJSObject(*v8::Utils::OpenHandle(*info.Holder())));
   if (!name->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("foo"))
            .FromJust()) {
     return;
@@ -17803,6 +17828,7 @@ TEST(SetterOnConstructorPrototype) {
 static void NamedPropertySetterWhichSetsYOnThisTo23(
     Local<Name> name, Local<Value> value,
     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (name->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("x"))
           .FromJust()) {
     info.This()
@@ -17995,26 +18021,26 @@ TEST(GCCallbacksOld) {
   context->GetIsolate()->AddGCEpilogueCallback(EpilogueCallback);
   CHECK_EQ(0, prologue_call_count);
   CHECK_EQ(0, epilogue_call_count);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(1, prologue_call_count);
   CHECK_EQ(1, epilogue_call_count);
   context->GetIsolate()->AddGCPrologueCallback(PrologueCallbackSecond);
   context->GetIsolate()->AddGCEpilogueCallback(EpilogueCallbackSecond);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(2, prologue_call_count);
   CHECK_EQ(2, epilogue_call_count);
   CHECK_EQ(1, prologue_call_count_second);
   CHECK_EQ(1, epilogue_call_count_second);
   context->GetIsolate()->RemoveGCPrologueCallback(PrologueCallback);
   context->GetIsolate()->RemoveGCEpilogueCallback(EpilogueCallback);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(2, prologue_call_count);
   CHECK_EQ(2, epilogue_call_count);
   CHECK_EQ(2, prologue_call_count_second);
   CHECK_EQ(2, epilogue_call_count_second);
   context->GetIsolate()->RemoveGCPrologueCallback(PrologueCallbackSecond);
   context->GetIsolate()->RemoveGCEpilogueCallback(EpilogueCallbackSecond);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(2, prologue_call_count);
   CHECK_EQ(2, epilogue_call_count);
   CHECK_EQ(2, prologue_call_count_second);
@@ -18036,14 +18062,14 @@ TEST(GCCallbacksWithData) {
   CHECK_EQ(0, epilogue1);
   CHECK_EQ(0, prologue2);
   CHECK_EQ(0, epilogue2);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(1, prologue1);
   CHECK_EQ(1, epilogue1);
   CHECK_EQ(0, prologue2);
   CHECK_EQ(0, epilogue2);
   context->GetIsolate()->AddGCPrologueCallback(PrologueCallbackNew, &prologue2);
   context->GetIsolate()->AddGCEpilogueCallback(EpilogueCallbackNew, &epilogue2);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(2, prologue1);
   CHECK_EQ(2, epilogue1);
   CHECK_EQ(1, prologue2);
@@ -18052,7 +18078,7 @@ TEST(GCCallbacksWithData) {
                                                   &prologue1);
   context->GetIsolate()->RemoveGCEpilogueCallback(EpilogueCallbackNew,
                                                   &epilogue1);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(2, prologue1);
   CHECK_EQ(2, epilogue1);
   CHECK_EQ(2, prologue2);
@@ -18061,140 +18087,13 @@ TEST(GCCallbacksWithData) {
                                                   &prologue2);
   context->GetIsolate()->RemoveGCEpilogueCallback(EpilogueCallbackNew,
                                                   &epilogue2);
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CHECK_EQ(2, prologue1);
   CHECK_EQ(2, epilogue1);
   CHECK_EQ(2, prologue2);
   CHECK_EQ(2, epilogue2);
 }
 
-namespace {
-
-void AssertOneByteConsContainsTwoByteExternal(i::Handle<i::String> maybe_cons,
-                                              i::Handle<i::String> external) {
-  CHECK(maybe_cons->IsOneByteRepresentation());
-  CHECK(maybe_cons->IsConsString());
-  i::ConsString cons = i::ConsString::cast(*maybe_cons);
-  CHECK(cons.IsFlat(GetPtrComprCageBase(cons)));
-  CHECK(cons.first() == *external);
-  CHECK(cons.first().IsTwoByteRepresentation());
-  CHECK(cons.first().IsExternalString());
-}
-
-}  // namespace
-
-THREADED_TEST(TwoByteStringInOneByteCons) {
-  // See Chromium issue 47824.
-  LocalContext context;
-  v8::HandleScope scope(context->GetIsolate());
-
-  const char* init_code =
-      "var str1 = 'abelspendabel';"
-      "var str2 = str1 + str1 + str1;"
-      "str2;";
-  Local<Value> result = CompileRun(init_code);
-
-  Local<Value> indexof = CompileRun("str2.indexOf('els')");
-  Local<Value> lastindexof = CompileRun("str2.lastIndexOf('dab')");
-  Local<Value> second_char = CompileRun("str2[1]");
-
-  CHECK(result->IsString());
-  i::Handle<i::String> string = v8::Utils::OpenHandle(String::Cast(*result));
-  int length = string->length();
-  CHECK(string->IsConsString());
-  CHECK(string->IsOneByteRepresentation());
-
-  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(context->GetIsolate());
-  i::Handle<i::String> flat_string = i::String::Flatten(i_isolate, string);
-
-  CHECK(string->IsOneByteRepresentation());
-  CHECK(flat_string->IsOneByteRepresentation());
-
-  // Create external resource.
-  uint16_t* uc16_buffer = new uint16_t[length + 1];
-
-  i::String::WriteToFlat(*flat_string, uc16_buffer, 0, length);
-  uc16_buffer[length] = 0;
-
-  TestResource resource(uc16_buffer);
-
-  flat_string->MakeExternal(&resource);
-
-  CHECK(flat_string->IsTwoByteRepresentation());
-
-  // At this point, we should have a Cons string which is flat and one-byte,
-  // with a first half that is a two-byte string (although it only contains
-  // one-byte characters). This is a valid sequence of steps, and it can
-  // happen in real pages.
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  // Check that some string operations work.
-
-  // Atom RegExp.
-  Local<Value> reresult = CompileRun("str2.match(/abel/g).length;");
-  CHECK_EQ(6, reresult->Int32Value(context.local()).FromJust());
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  // Nonatom RegExp.
-  reresult = CompileRun("str2.match(/abe./g).length;");
-  CHECK_EQ(6, reresult->Int32Value(context.local()).FromJust());
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  reresult = CompileRun("str2.search(/bel/g);");
-  CHECK_EQ(1, reresult->Int32Value(context.local()).FromJust());
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  reresult = CompileRun("str2.search(/be./g);");
-  CHECK_EQ(1, reresult->Int32Value(context.local()).FromJust());
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  ExpectTrue("/bel/g.test(str2);");
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  ExpectTrue("/be./g.test(str2);");
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  reresult = CompileRun("/bel/g.exec(str2);");
-  CHECK(!reresult->IsNull());
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  reresult = CompileRun("/be./g.exec(str2);");
-  CHECK(!reresult->IsNull());
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  ExpectString("str2.substring(2, 10);", "elspenda");
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  ExpectString("str2.substring(2, 20);", "elspendabelabelspe");
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  ExpectString("str2.charAt(2);", "e");
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  ExpectObject("str2.indexOf('els');", indexof);
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  ExpectObject("str2.lastIndexOf('dab');", lastindexof);
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  // crbug.com/1088179. Fill the single character string cache, then run split.
-  i_isolate->factory()->LookupSingleCharacterStringFromCode(0);
-  for (size_t i = 0; i < std::strlen(init_code); i++) {
-    i_isolate->factory()->LookupSingleCharacterStringFromCode(init_code[i]);
-  }
-  ExpectObject("str2.split('')[1]", second_char);
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  reresult = CompileRun("str2.charCodeAt(2);");
-  CHECK_EQ(static_cast<int32_t>('e'),
-           reresult->Int32Value(context.local()).FromJust());
-  AssertOneByteConsContainsTwoByteExternal(string, flat_string);
-
-  // This avoids the GC from trying to free stack allocated resources.
-  i::Handle<i::ExternalTwoByteString>::cast(flat_string)
-      ->SetResource(i_isolate, nullptr);
-}
-
 TEST(ContainsOnlyOneByte) {
   v8::Isolate* isolate = CcTest::isolate();
   v8::HandleScope scope(isolate);
@@ -18271,7 +18170,7 @@ TEST(ContainsOnlyOneByte) {
 void FailedAccessCheckCallbackGC(Local<v8::Object> target,
                                  v8::AccessType type,
                                  Local<v8::Value> data) {
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
   CcTest::isolate()->ThrowException(
       v8::Exception::Error(v8_str("cross context")));
 }
@@ -18899,7 +18798,7 @@ TEST(DontDeleteCellLoadIC) {
                  "})()",
                  "ReferenceError: cell is not defined");
     CompileRun("cell = \"new_second\";");
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     ExpectString("readCell()", "new_second");
     ExpectString("readCell()", "new_second");
   }
@@ -19053,11 +18952,13 @@ THREADED_TEST(Equals) {
 
 static void Getter(v8::Local<v8::Name> property,
                    const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_str("42!"));
 }
 
 
 static void Enumerator(const v8::PropertyCallbackInfo<v8::Array>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   v8::Local<v8::Array> result = v8::Array::New(info.GetIsolate());
   result->Set(info.GetIsolate()->GetCurrentContext(), 0,
               v8_str("universalAnswer"))
@@ -19273,12 +19174,14 @@ THREADED_TEST(CreationContextOfJsBoundFunction) {
 void HasOwnPropertyIndexedPropertyGetter(
     uint32_t index,
     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (index == 42) info.GetReturnValue().Set(v8_str("yes"));
 }
 
 
 void HasOwnPropertyNamedPropertyGetter(
     Local<Name> property, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (property->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("foo"))
           .FromJust()) {
     info.GetReturnValue().Set(v8_str("yes"));
@@ -19288,12 +19191,14 @@ void HasOwnPropertyNamedPropertyGetter(
 
 void HasOwnPropertyIndexedPropertyQuery(
     uint32_t index, const v8::PropertyCallbackInfo<v8::Integer>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (index == 42) info.GetReturnValue().Set(1);
 }
 
 
 void HasOwnPropertyNamedPropertyQuery(
     Local<Name> property, const v8::PropertyCallbackInfo<v8::Integer>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (property->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("foo"))
           .FromJust()) {
     info.GetReturnValue().Set(1);
@@ -19303,6 +19208,7 @@ void HasOwnPropertyNamedPropertyQuery(
 
 void HasOwnPropertyNamedPropertyQuery2(
     Local<Name> property, const v8::PropertyCallbackInfo<v8::Integer>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (property->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("bar"))
           .FromJust()) {
     info.GetReturnValue().Set(1);
@@ -19312,11 +19218,13 @@ void HasOwnPropertyNamedPropertyQuery2(
 void HasOwnPropertyAccessorGetter(
     Local<String> property,
     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_str("yes"));
 }
 
 void HasOwnPropertyAccessorNameGetter(
     Local<Name> property, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_str("yes"));
 }
 
@@ -19718,11 +19626,11 @@ THREADED_TEST(ReadOnlyIndexedProperties) {
 }
 
 static int CountLiveMapsInMapCache(i::Context context) {
-  i::WeakFixedArray map_cache = i::WeakFixedArray::cast(context.map_cache());
-  int length = map_cache.length();
+  i::WeakFixedArray map_cache = i::WeakFixedArray::cast(context->map_cache());
+  int length = map_cache->length();
   int count = 0;
   for (int i = 0; i < length; i++) {
-    if (map_cache.Get(i)->IsWeak()) count++;
+    if (map_cache->Get(i)->IsWeak()) count++;
   }
   return count;
 }
@@ -19750,7 +19658,7 @@ THREADED_TEST(Regress1516) {
   CHECK_LE(1, elements);
 
   // We have to abort incremental marking here to abandon black pages.
-  CcTest::PreciseCollectAllGarbage();
+  i::heap::InvokeAtomicMajorGC(CcTest::heap());
 
   CHECK_GT(elements, CountLiveMapsInMapCache(CcTest::i_isolate()->context()));
 }
@@ -20182,6 +20090,10 @@ static void MicrotasksCompletedCallback(v8::Isolate* isolate, void*) {
   ++microtasks_completed_callback_count;
 }
 
+static void MicrotasksCompletedCallbackCallScript(v8::Isolate* isolate, void*) {
+  CompileRun("1+1;");
+}
+
 TEST(SetAutorunMicrotasks) {
   LocalContext env;
   v8::HandleScope scope(env->GetIsolate());
@@ -20256,6 +20168,17 @@ TEST(SetAutorunMicrotasks) {
   CHECK_EQ(4, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
   CHECK_EQ(15u, microtasks_completed_callback_count);
 
+  // A callback which calls script should not cause nested microtask execution
+  // and a nested invocation of the microtasks completed callback.
+  env->GetIsolate()->AddMicrotasksCompletedCallback(
+      &MicrotasksCompletedCallbackCallScript);
+  CompileRun("1+1;");
+  CHECK_EQ(2, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
+  CHECK_EQ(4, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
+  CHECK_EQ(18u, microtasks_completed_callback_count);
+  env->GetIsolate()->RemoveMicrotasksCompletedCallback(
+      &MicrotasksCompletedCallbackCallScript);
+
   env->GetIsolate()->RemoveMicrotasksCompletedCallback(
       &MicrotasksCompletedCallback);
   env->GetIsolate()->EnqueueMicrotask(
@@ -20263,7 +20186,7 @@ TEST(SetAutorunMicrotasks) {
   CompileRun("1+1;");
   CHECK_EQ(3, CompileRun("ext1Calls")->Int32Value(env.local()).FromJust());
   CHECK_EQ(4, CompileRun("ext2Calls")->Int32Value(env.local()).FromJust());
-  CHECK_EQ(15u, microtasks_completed_callback_count);
+  CHECK_EQ(18u, microtasks_completed_callback_count);
 }
 
 
@@ -20531,7 +20454,7 @@ void AssertCowElements(bool expected, const char* source) {
   Local<Value> object = CompileRun(source);
   i::Handle<i::JSObject> array =
       i::Handle<i::JSObject>::cast(v8::Utils::OpenHandle(*object.As<Object>()));
-  CHECK_EQ(expected, array->elements().IsCowArray());
+  CHECK_EQ(expected, array->elements()->IsCowArray());
 }
 
 }  // namespace
@@ -21377,6 +21300,7 @@ class RequestInterruptTestWithNativeAccessor
   static void ShouldContinueNativeGetter(
       Local<String> property,
       const v8::PropertyCallbackInfo<v8::Value>& info) {
+    CHECK(i::ValidateCallbackInfo(info));
     RequestInterruptTestBase* test =
         reinterpret_cast<RequestInterruptTestBase*>(
             info.Data().As<v8::External>()->Value());
@@ -21408,7 +21332,9 @@ class RequestInterruptTestWithMethodCallAndInterceptor
 
  private:
   static void EmptyInterceptor(
-      Local<Name> property, const v8::PropertyCallbackInfo<v8::Value>& info) {}
+      Local<Name> property, const v8::PropertyCallbackInfo<v8::Value>& info) {
+    CHECK(i::ValidateCallbackInfo(info));
+  }
 };
 
 
@@ -21597,8 +21523,8 @@ THREADED_TEST(FunctionNew) {
   auto serial_number =
       i::Handle<i::JSFunction>::cast(v8::Utils::OpenHandle(*func))
           ->shared()
-          .get_api_func_data()
-          .serial_number();
+          ->api_func_data()
+          ->serial_number();
   CHECK_EQ(i::TemplateInfo::kDoNotCache, serial_number);
 
   // Verify that each Function::New creates a new function instance
@@ -21619,7 +21545,7 @@ void Verify(v8::Isolate* isolate, Local<v8::Object> obj) {
 #if VERIFY_HEAP
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   i::Handle<i::JSReceiver> i_obj = v8::Utils::OpenHandle(*obj);
-  i_obj->ObjectVerify(i_isolate);
+  i::Object::ObjectVerify(*i_obj, i_isolate);
 #endif
 }
 
@@ -21780,6 +21706,7 @@ TEST(EscapableHandleScope) {
 
 static void SetterWhichExpectsThisAndHolderToDiffer(
     Local<String>, Local<Value>, const v8::PropertyCallbackInfo<void>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CHECK(info.Holder() != info.This());
 }
 
@@ -21816,6 +21743,7 @@ class ApiCallOptimizationChecker {
 
   static void OptimizationCallback(
       const v8::FunctionCallbackInfo<v8::Value>& info) {
+    CHECK(i::ValidateCallbackInfo(info));
     CHECK(data == info.Data());
     CHECK(receiver == info.This());
     if (info.Length() == 1) {
@@ -21825,6 +21753,8 @@ class ApiCallOptimizationChecker {
     }
     CHECK(holder == info.Holder());
     count++;
+    Local<Value> return_value = info.GetReturnValue().Get();
+    CHECK(return_value->IsUndefined());
     info.GetReturnValue().Set(v8_str("returned"));
   }
 
@@ -22019,6 +21949,7 @@ TEST(FunctionCallOptimizationMultipleArgs) {
 
 static void ReturnsSymbolCallback(
     const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8::Symbol::New(info.GetIsolate()));
 }
 
@@ -22056,16 +21987,16 @@ TEST(EmptyApiCallback) {
   global->Set(context.local(), v8_str("x"), function).FromJust();
 
   auto result = CompileRun("x()");
-  CHECK(v8::Utils::OpenHandle(*result)->IsJSGlobalProxy());
+  CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(*result)));
 
   result = CompileRun("x(1,2,3)");
-  CHECK(v8::Utils::OpenHandle(*result)->IsJSGlobalProxy());
+  CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(*result)));
 
   result = CompileRun("x.call(undefined)");
-  CHECK(v8::Utils::OpenHandle(*result)->IsJSGlobalProxy());
+  CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(*result)));
 
   result = CompileRun("x.call(null)");
-  CHECK(v8::Utils::OpenHandle(*result)->IsJSGlobalProxy());
+  CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(*result)));
 
   result = CompileRun("7 + x.call(3) + 11");
   CHECK(result->IsInt32());
@@ -22180,14 +22111,15 @@ void StoringEventLoggerCallback(const char* message, int status) {
 
 
 TEST(EventLogging) {
-  v8::Isolate* isolate = CcTest::isolate();
-  isolate->SetEventLogger(StoringEventLoggerCallback);
-  i::NestedTimedHistogram histogram(
-      "V8.Test", 0, 10000, i::TimedHistogramResolution::MILLISECOND, 50,
-      reinterpret_cast<i::Isolate*>(isolate)->counters());
-  event_count = 0;
-  int count = 0;
-  {
+    i::v8_flags.log_timer_events = true;
+    v8::Isolate* isolate = CcTest::isolate();
+    isolate->SetEventLogger(StoringEventLoggerCallback);
+    i::NestedTimedHistogram histogram(
+        "V8.Test", 0, 10000, i::TimedHistogramResolution::MILLISECOND, 50,
+        reinterpret_cast<i::Isolate*>(isolate)->counters());
+    event_count = 0;
+    int count = 0;
+    {
     CHECK_EQ(0, event_count);
     {
       CHECK_EQ(0, event_count);
@@ -22245,7 +22177,7 @@ TEST(EventLogging) {
     CHECK_EQ(0, strcmp("V8.Test", last_event_message));
     CHECK_EQ(v8::LogEventStatus::kEnd, last_event_status);
     CHECK_EQ(++count, event_count);
-  }
+    }
   CHECK_EQ(0, strcmp("V8.Test", last_event_message));
   CHECK_EQ(v8::LogEventStatus::kEnd, last_event_status);
   CHECK_EQ(++count, event_count);
@@ -22877,7 +22809,7 @@ TEST(ScriptPositionInfo) {
 
   i::Handle<i::SharedFunctionInfo> obj = i::Handle<i::SharedFunctionInfo>::cast(
       v8::Utils::OpenHandle(*script->GetUnboundScript()));
-  CHECK(obj->script().IsScript());
+  CHECK(IsScript(obj->script()));
 
   i::Handle<i::Script> script1(i::Script::cast(obj->script()), i_isolate);
 
@@ -22887,62 +22819,64 @@ TEST(ScriptPositionInfo) {
     // With offset.
 
     // Behave as if 0 was passed if position is negative.
-    CHECK(script1->GetPositionInfo(-1, &info, script1->WITH_OFFSET));
+    CHECK(script1->GetPositionInfo(-1, &info));
     CHECK_EQ(13, info.line);
     CHECK_EQ(0, info.column);
     CHECK_EQ(0, info.line_start);
     CHECK_EQ(8, info.line_end);
 
-    CHECK(script1->GetPositionInfo(0, &info, script1->WITH_OFFSET));
+    CHECK(script1->GetPositionInfo(0, &info));
     CHECK_EQ(13, info.line);
     CHECK_EQ(0, info.column);
     CHECK_EQ(0, info.line_start);
     CHECK_EQ(8, info.line_end);
 
-    CHECK(script1->GetPositionInfo(8, &info, script1->WITH_OFFSET));
+    CHECK(script1->GetPositionInfo(8, &info));
     CHECK_EQ(13, info.line);
     CHECK_EQ(8, info.column);
     CHECK_EQ(0, info.line_start);
     CHECK_EQ(8, info.line_end);
 
-    CHECK(script1->GetPositionInfo(9, &info, script1->WITH_OFFSET));
+    CHECK(script1->GetPositionInfo(9, &info));
     CHECK_EQ(14, info.line);
     CHECK_EQ(0, info.column);
     CHECK_EQ(9, info.line_start);
     CHECK_EQ(17, info.line_end);
 
     // Fail when position is larger than script size.
-    CHECK(!script1->GetPositionInfo(220384, &info, script1->WITH_OFFSET));
+    CHECK(!script1->GetPositionInfo(220384, &info));
 
     // Without offset.
 
     // Behave as if 0 was passed if position is negative.
-    CHECK(script1->GetPositionInfo(-1, &info, script1->NO_OFFSET));
+    CHECK(
+        script1->GetPositionInfo(-1, &info, i::Script::OffsetFlag::kNoOffset));
     CHECK_EQ(0, info.line);
     CHECK_EQ(0, info.column);
     CHECK_EQ(0, info.line_start);
     CHECK_EQ(8, info.line_end);
 
-    CHECK(script1->GetPositionInfo(0, &info, script1->NO_OFFSET));
+    CHECK(script1->GetPositionInfo(0, &info, i::Script::OffsetFlag::kNoOffset));
     CHECK_EQ(0, info.line);
     CHECK_EQ(0, info.column);
     CHECK_EQ(0, info.line_start);
     CHECK_EQ(8, info.line_end);
 
-    CHECK(script1->GetPositionInfo(8, &info, script1->NO_OFFSET));
+    CHECK(script1->GetPositionInfo(8, &info, i::Script::OffsetFlag::kNoOffset));
     CHECK_EQ(0, info.line);
     CHECK_EQ(8, info.column);
     CHECK_EQ(0, info.line_start);
     CHECK_EQ(8, info.line_end);
 
-    CHECK(script1->GetPositionInfo(9, &info, script1->NO_OFFSET));
+    CHECK(script1->GetPositionInfo(9, &info, i::Script::OffsetFlag::kNoOffset));
     CHECK_EQ(1, info.line);
     CHECK_EQ(0, info.column);
     CHECK_EQ(9, info.line_start);
     CHECK_EQ(17, info.line_end);
 
     // Fail when position is larger than script size.
-    CHECK(!script1->GetPositionInfo(220384, &info, script1->NO_OFFSET));
+    CHECK(!script1->GetPositionInfo(220384, &info,
+                                    i::Script::OffsetFlag::kNoOffset));
 
     i::Script::InitLineEnds(i_isolate, script1);
   }
@@ -23210,48 +23144,6 @@ TEST(Regress411793) {
       "    { get: function() {}, set: function() {} });");
 }
 
-class TestSourceStream : public v8::ScriptCompiler::ExternalSourceStream {
- public:
-  explicit TestSourceStream(const char** chunks) : chunks_(chunks), index_(0) {}
-
-  size_t GetMoreData(const uint8_t** src) override {
-    // Unlike in real use cases, this function will never block.
-    if (chunks_[index_] == nullptr) {
-      return 0;
-    }
-    // Copy the data, since the caller takes ownership of it.
-    size_t len = strlen(chunks_[index_]);
-    // We don't need to zero-terminate since we return the length.
-    uint8_t* copy = new uint8_t[len];
-    memcpy(copy, chunks_[index_], len);
-    *src = copy;
-    ++index_;
-    return len;
-  }
-
-  // Helper for constructing a string from chunks (the compilation needs it
-  // too).
-  static char* FullSourceString(const char** chunks) {
-    size_t total_len = 0;
-    for (size_t i = 0; chunks[i] != nullptr; ++i) {
-      total_len += strlen(chunks[i]);
-    }
-    char* full_string = new char[total_len + 1];
-    size_t offset = 0;
-    for (size_t i = 0; chunks[i] != nullptr; ++i) {
-      size_t len = strlen(chunks[i]);
-      memcpy(full_string + offset, chunks[i], len);
-      offset += len;
-    }
-    full_string[total_len] = 0;
-    return full_string;
-  }
-
- private:
-  const char** chunks_;
-  unsigned index_;
-};
-
 v8::MaybeLocal<Module> UnexpectedModuleResolveCallback(
     Local<Context> context, Local<String> specifier,
     Local<FixedArray> import_assertions, Local<Module> referrer) {
@@ -23271,7 +23163,7 @@ void RunStreamingTest(const char** chunks, v8::ScriptType type,
   v8::TryCatch try_catch(isolate);
 
   v8::ScriptCompiler::StreamedSource source(
-      std::make_unique<TestSourceStream>(chunks), encoding);
+      std::make_unique<i::TestSourceStream>(chunks), encoding);
   v8::ScriptCompiler::ScriptStreamingTask* task =
       v8::ScriptCompiler::StartStreaming(isolate, &source, type);
 
@@ -23287,7 +23179,7 @@ void RunStreamingTest(const char** chunks, v8::ScriptType type,
                           v8::Local<v8::Value>(), false, false,
                           type == v8::ScriptType::kModule);
 
-  char* full_source = TestSourceStream::FullSourceString(chunks);
+  char* full_source = i::TestSourceStream::FullSourceString(chunks);
   if (type == v8::ScriptType::kClassic) {
     v8::MaybeLocal<Script> script = v8::ScriptCompiler::Compile(
         env.local(), &source, v8_str(full_source), origin);
@@ -23595,7 +23487,7 @@ TEST(StreamingWithDebuggingEnabledLate) {
   v8::TryCatch try_catch(isolate);
 
   v8::ScriptCompiler::StreamedSource source(
-      std::make_unique<TestSourceStream>(chunks),
+      std::make_unique<i::TestSourceStream>(chunks),
       v8::ScriptCompiler::StreamedSource::ONE_BYTE);
   v8::ScriptCompiler::ScriptStreamingTask* task =
       v8::ScriptCompiler::StartStreaming(isolate, &source);
@@ -23608,7 +23500,7 @@ TEST(StreamingWithDebuggingEnabledLate) {
   CHECK(!try_catch.HasCaught());
 
   v8::ScriptOrigin origin(isolate, v8_str("http://foo.com"));
-  char* full_source = TestSourceStream::FullSourceString(chunks);
+  char* full_source = i::TestSourceStream::FullSourceString(chunks);
 
   EnableDebugger(isolate);
 
@@ -23708,7 +23600,7 @@ TEST(StreamingWithHarmonyScopes) {
 
   v8::TryCatch try_catch(isolate);
   v8::ScriptCompiler::StreamedSource source(
-      std::make_unique<TestSourceStream>(chunks),
+      std::make_unique<i::TestSourceStream>(chunks),
       v8::ScriptCompiler::StreamedSource::ONE_BYTE);
   v8::ScriptCompiler::ScriptStreamingTask* task =
       v8::ScriptCompiler::StartStreaming(isolate, &source);
@@ -23723,7 +23615,7 @@ TEST(StreamingWithHarmonyScopes) {
   CHECK(!try_catch.HasCaught());
 
   v8::ScriptOrigin origin(isolate, v8_str("http://foo.com"));
-  char* full_source = TestSourceStream::FullSourceString(chunks);
+  char* full_source = i::TestSourceStream::FullSourceString(chunks);
   v8::Local<Script> script =
       v8::ScriptCompiler::Compile(env.local(), &source, v8_str(full_source),
                                   origin)
@@ -23744,7 +23636,6 @@ void StreamingWithIsolateScriptCache(bool run_gc) {
                           nullptr};
   const char* full_source = chunks[0];
   v8::Isolate* isolate = CcTest::isolate();
-  auto i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   v8::HandleScope scope(isolate);
   v8::ScriptOrigin origin(isolate, v8_str("http://foo.com"), 0, 0, false, -1,
                           v8::Local<v8::Value>(), false, false, false);
@@ -23758,7 +23649,7 @@ void StreamingWithIsolateScriptCache(bool run_gc) {
     v8::EscapableHandleScope inner_scope(isolate);
 
     v8::ScriptCompiler::StreamedSource source(
-        std::make_unique<TestSourceStream>(chunks),
+        std::make_unique<i::TestSourceStream>(chunks),
         v8::ScriptCompiler::StreamedSource::ONE_BYTE);
     v8::ScriptCompiler::ScriptStreamingTask* task =
         v8::ScriptCompiler::StartStreaming(isolate, &source,
@@ -23779,11 +23670,7 @@ void StreamingWithIsolateScriptCache(bool run_gc) {
       // alive and reachable via the Isolate script cache.
       i::Handle<i::JSFunction> script_function =
           i::Handle<i::JSFunction>::cast(v8::Utils::OpenHandle(*script));
-      i::Handle<i::BytecodeArray> script_bytecode(
-          script_function->shared().GetBytecodeArray(i_isolate), i_isolate);
-      for (int i = 0; i < 5; ++i) {
-        script_bytecode->MakeOlder();
-      }
+      i::SharedFunctionInfo::EnsureOldForTesting(script_function->shared());
     }
   }
 
@@ -24090,13 +23977,14 @@ TEST(CreateSyntheticModule) {
       i_isolate->factory()->NewStringFromAsciiChecked("default");
 
   CHECK(
-      i::Handle<i::Object>(exports->Lookup(default_name), i_isolate)->IsCell());
-  CHECK(i::Handle<i::Cell>::cast(
-            i::Handle<i::Object>(exports->Lookup(default_name), i_isolate))
-            ->value()
-            .IsUndefined());
-  CHECK_EQ(i_module->export_names().length(), 1);
-  CHECK(i::String::cast(i_module->export_names().get(0)).Equals(*default_name));
+      IsCell(*i::Handle<i::Object>(exports->Lookup(default_name), i_isolate)));
+  CHECK(IsUndefined(
+      i::Handle<i::Cell>::cast(
+          i::Handle<i::Object>(exports->Lookup(default_name), i_isolate))
+          ->value()));
+  CHECK_EQ(i_module->export_names()->length(), 1);
+  CHECK(
+      i::String::cast(i_module->export_names()->get(0))->Equals(*default_name));
   CHECK_EQ(i_module->status(), i::Module::kLinked);
   CHECK(module->IsSyntheticModule());
   CHECK(!module->IsSourceTextModule());
@@ -24150,7 +24038,7 @@ TEST(CreateSyntheticModuleGCName) {
         UnexpectedSyntheticModuleEvaluationStepsCallback));
   }
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 #ifdef VERIFY_HEAP
   i::Handle<i::HeapObject> i_module =
       i::Handle<i::HeapObject>::cast(v8::Utils::OpenHandle(*module));
@@ -24184,7 +24072,7 @@ TEST(SyntheticModuleSetExports) {
 
   // During Instantiation there should be a Cell for the export initialized to
   // undefined.
-  CHECK(foo_cell->value().IsUndefined());
+  CHECK(IsUndefined(foo_cell->value()));
 
   Maybe<bool> set_export_result =
       module->SetSyntheticModuleExport(isolate, foo_string, bar_string);
@@ -24299,11 +24187,11 @@ TEST(SyntheticModuleEvaluationStepsSetExport) {
       i::Handle<i::Cell>::cast(i::Handle<i::Object>(
           exports->Lookup(v8::Utils::OpenHandle(*test_export_string)),
           i_isolate));
-  CHECK(test_export_cell->value().IsUndefined());
+  CHECK(IsUndefined(test_export_cell->value()));
 
   Local<Value> completion_value = module->Evaluate(context).ToLocalChecked();
   CHECK(completion_value->IsUndefined());
-  CHECK_EQ(42, test_export_cell->value().Number());
+  CHECK_EQ(42, i::Object::Number(test_export_cell->value()));
   CHECK_EQ(module->GetStatus(), Module::kEvaluated);
 }
 
@@ -25105,7 +24993,6 @@ class TerminateExecutionThread : public v8::base::Thread {
 };
 
 TEST(FutexInterruption) {
-  i::v8_flags.harmony_sharedarraybuffer = true;
   v8::Isolate* isolate = CcTest::isolate();
   v8::HandleScope scope(isolate);
   LocalContext env;
@@ -25903,7 +25790,8 @@ TEST(SetPrototypeTemplate) {
 
 void ensure_receiver_is_global_proxy(
     v8::Local<v8::Name>, const v8::PropertyCallbackInfo<v8::Value>& info) {
-  CHECK(v8::Utils::OpenHandle(*info.This())->IsJSGlobalProxy());
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(IsJSGlobalProxy(*v8::Utils::OpenHandle(*info.This())));
 }
 
 THREADED_TEST(GlobalAccessorInfo) {
@@ -25973,16 +25861,19 @@ void CheckContexts(v8::Isolate* isolate) {
 
 void ContextCheckGetter(Local<String> name,
                         const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CheckContexts(info.GetIsolate());
   info.GetReturnValue().Set(true);
 }
 
 void ContextCheckSetter(Local<String> name, Local<Value>,
                         const v8::PropertyCallbackInfo<void>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CheckContexts(info.GetIsolate());
 }
 
 void ContextCheckToString(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CheckContexts(info.GetIsolate());
   info.GetReturnValue().Set(v8_str("foo"));
 }
@@ -26348,7 +26239,7 @@ TEST(CreateShadowRealmContext) {
   Local<Value> result = script->Run(context.local()).ToLocalChecked();
   CHECK(result->IsObject());
   i::Handle<i::Object> object = v8::Utils::OpenHandle(*result);
-  CHECK(object->IsJSShadowRealm());
+  CHECK(IsJSShadowRealm(*object));
 }
 
 v8::MaybeLocal<v8::Context> HostCreateShadowRealmContextCallbackThrow(
@@ -26775,13 +26666,12 @@ TEST(AtomicsWaitCallback) {
 }
 
 #if V8_ENABLE_WEBASSEMBLY
-namespace v8 {
-namespace internal {
-namespace wasm {
+namespace v8::internal::wasm {
+
 TEST(WasmI32AtomicWaitCallback) {
   WasmRunner<int32_t, int32_t, int32_t, double> r(TestExecutionTier::kTurbofan);
   r.builder().AddMemory(kWasmPageSize, SharedFlag::kShared);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_WAIT(kExprI32AtomicWait, WASM_LOCAL_GET(0),
                              WASM_LOCAL_GET(1),
                              WASM_I64_SCONVERT_F64(WASM_LOCAL_GET(2)), 4)});
@@ -26794,7 +26684,8 @@ TEST(WasmI32AtomicWaitCallback) {
             ->Set(env.local(), v8_str("func"), v8::Utils::ToLocal(func))
             .FromJust());
   Handle<JSArrayBuffer> memory(
-      r.builder().instance_object()->memory_object().array_buffer(), i_isolate);
+      r.builder().instance_object()->memory_object(0)->array_buffer(),
+      i_isolate);
   CHECK(env->Global()
             ->Set(env.local(), v8_str("sab"), v8::Utils::ToLocal(memory))
             .FromJust());
@@ -26816,7 +26707,7 @@ TEST(WasmI32AtomicWaitCallback) {
 TEST(WasmI64AtomicWaitCallback) {
   WasmRunner<int32_t, int32_t, double, double> r(TestExecutionTier::kTurbofan);
   r.builder().AddMemory(kWasmPageSize, SharedFlag::kShared);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_WAIT(kExprI64AtomicWait, WASM_LOCAL_GET(0),
                              WASM_I64_SCONVERT_F64(WASM_LOCAL_GET(1)),
                              WASM_I64_SCONVERT_F64(WASM_LOCAL_GET(2)), 8)});
@@ -26829,7 +26720,8 @@ TEST(WasmI64AtomicWaitCallback) {
             ->Set(env.local(), v8_str("func"), v8::Utils::ToLocal(func))
             .FromJust());
   Handle<JSArrayBuffer> memory(
-      r.builder().instance_object()->memory_object().array_buffer(), i_isolate);
+      r.builder().instance_object()->memory_object(0)->array_buffer(),
+      i_isolate);
   CHECK(env->Global()
             ->Set(env.local(), v8_str("sab"), v8::Utils::ToLocal(memory))
             .FromJust());
@@ -26848,9 +26740,7 @@ TEST(WasmI64AtomicWaitCallback) {
   AtomicsWaitCallbackCommon(isolate, CompileRun(init), 8, 8);
 }
 
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
 #endif  // V8_ENABLE_WEBASSEMBLY
 
 TEST(BigIntAPI) {
@@ -26975,19 +26865,20 @@ TEST(GetJSEntryStubs) {
   v8::JSEntryStubs entry_stubs = isolate->GetJSEntryStubs();
 
   v8::JSEntryStub entry_stub = entry_stubs.js_entry_stub;
-  CHECK_EQ(i_isolate->builtins()->code(i::Builtin::kJSEntry).InstructionStart(),
-           reinterpret_cast<i::Address>(entry_stub.code.start));
+  CHECK_EQ(
+      i_isolate->builtins()->code(i::Builtin::kJSEntry)->instruction_start(),
+      reinterpret_cast<i::Address>(entry_stub.code.start));
 
   v8::JSEntryStub construct_stub = entry_stubs.js_construct_entry_stub;
   CHECK_EQ(i_isolate->builtins()
                ->code(i::Builtin::kJSConstructEntry)
-               .InstructionStart(),
+               ->instruction_start(),
            reinterpret_cast<i::Address>(construct_stub.code.start));
 
   v8::JSEntryStub microtask_stub = entry_stubs.js_run_microtasks_entry_stub;
   CHECK_EQ(i_isolate->builtins()
                ->code(i::Builtin::kJSRunMicrotasksEntry)
-               .InstructionStart(),
+               ->instruction_start(),
            reinterpret_cast<i::Address>(microtask_stub.code.start));
 }
 
@@ -27002,7 +26893,7 @@ TEST(MicrotaskContextShouldBeNativeContext) {
     i::Handle<i::Context> context =
         v8::Utils::OpenHandle(*isolate->GetEnteredOrMicrotaskContext());
 
-    CHECK(context->IsNativeContext());
+    CHECK(IsNativeContext(*context));
     info.GetReturnValue().SetUndefined();
   };
 
@@ -27484,8 +27375,7 @@ static void CallIsolate2(const v8::FunctionCallbackInfo<v8::Value>& args) {
       v8::Local<v8::Context>::New(isolate_2, context_2);
   v8::Context::Scope context_scope(context);
   i::Heap* heap_2 = reinterpret_cast<i::Isolate*>(isolate_2)->heap();
-  heap_2->CollectAllGarbage(i::Heap::kForcedGC,
-                            i::GarbageCollectionReason::kTesting);
+  i::heap::InvokeMajorGC(heap_2, i::GCFlag::kForced);
   CompileRun("f2() //# sourceURL=isolate2b");
 }
 
@@ -28348,11 +28238,13 @@ TEST(FastApiStackSlot) {
   CHECK(foo->IsNumber());
   CHECK_EQ(128, foo->ToInt32(env.local()).ToLocalChecked()->Value());
 
-  CHECK(checker.DidCallFast() && checker.DidCallSlow());
+  // TODO(v8:13600): Re-enable these checks and verify `try_catch.HasCaught()`.
+  // CHECK(checker.DidCallFast());
+  // CHECK_EQ(checker.fast_value_, test_value);
+  CHECK(checker.DidCallSlow());
   CHECK_EQ(false, has_caught);
   int32_t slow_value_typed = checker.slow_value_.ToChecked();
   CHECK_EQ(slow_value_typed, test_value);
-  CHECK_EQ(checker.fast_value_, test_value);
 #endif  // !defined(V8_LITE_MODE) && defined(V8_ENABLE_TURBOFAN)
 }
 
@@ -29057,7 +28949,7 @@ THREADED_TEST(Recorder_GetContext) {
   }
 
   // Invalidate the context and therefore the context id.
-  CcTest::PreciseCollectAllGarbage();
+  i::heap::InvokeAtomicMajorGC(CcTest::heap());
 
   // Ensure that a stale context id returns an empty handle.
   {
@@ -29132,7 +29024,7 @@ TEST(TriggerMainThreadMetricsEvent) {
     CHECK_GT(recorder->time_in_us_, 100);
   }
 
-  CcTest::PreciseCollectAllGarbage();
+  i::heap::InvokeAtomicMajorGC(CcTest::heap());
 
   // Check that event submission doesn't break even if the context id is
   // invalid.
@@ -29179,7 +29071,7 @@ TEST(TriggerDelayedMainThreadMetricsEvent) {
     CHECK_GT(recorder->time_in_us_, 100);
   }
 
-  CcTest::PreciseCollectAllGarbage();
+  i::heap::InvokeAtomicMajorGC(CcTest::heap());
 
   // Check that event submission doesn't break even if the context id is
   // invalid.
@@ -29367,10 +29259,10 @@ THREADED_TEST(SetMicrotaskQueueOfContext) {
 
 namespace {
 
-bool sab_constructor_enabled_value = false;
+bool MockSabConstructorEnabledCallback(v8::Local<v8::Context>) { return true; }
 
-bool MockSabConstructorEnabledCallback(v8::Local<v8::Context>) {
-  return sab_constructor_enabled_value;
+bool MockSabConstructorDisabledCallback(v8::Local<v8::Context>) {
+  return false;
 }
 
 }  // namespace
@@ -29381,36 +29273,33 @@ TEST(TestSetSabConstructorEnabledCallback) {
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
   v8::HandleScope scope(isolate);
   v8::Local<v8::Context> context = v8::Context::New(CcTest::isolate());
-  i::Handle<i::Context> i_context = v8::Utils::OpenHandle(*context);
-
-  // {Isolate::IsSharedArrayBufferConstructorEnabled} calls the callback set by
-  // the embedder if such a callback exists. Otherwise it returns
-  // {v8_flags.harmony_sharedarraybuffer}. First we test that the flag is
-  // returned correctly if no callback is set. Then we test that the flag is
-  // ignored if the callback is set.
+  i::Handle<i::NativeContext> i_context = v8::Utils::OpenHandle(*context);
 
-  i::v8_flags.harmony_sharedarraybuffer = false;
+  // No callback
   i::v8_flags.enable_sharedarraybuffer_per_context = false;
-  CHECK(!i_isolate->IsSharedArrayBufferConstructorEnabled(i_context));
+  CHECK(i_isolate->IsSharedArrayBufferConstructorEnabled(i_context));
 
-  i::v8_flags.harmony_sharedarraybuffer = false;
-  i::v8_flags.enable_sharedarraybuffer_per_context = false;
+  i::v8_flags.enable_sharedarraybuffer_per_context = true;
   CHECK(!i_isolate->IsSharedArrayBufferConstructorEnabled(i_context));
 
-  i::v8_flags.harmony_sharedarraybuffer = true;
+  // Callback returns false
+  isolate->SetSharedArrayBufferConstructorEnabledCallback(
+      MockSabConstructorDisabledCallback);
+
   i::v8_flags.enable_sharedarraybuffer_per_context = false;
   CHECK(i_isolate->IsSharedArrayBufferConstructorEnabled(i_context));
 
-  i::v8_flags.harmony_sharedarraybuffer = true;
   i::v8_flags.enable_sharedarraybuffer_per_context = true;
   CHECK(!i_isolate->IsSharedArrayBufferConstructorEnabled(i_context));
 
+  // Callback returns true
   isolate->SetSharedArrayBufferConstructorEnabledCallback(
       MockSabConstructorEnabledCallback);
-  sab_constructor_enabled_value = false;
-  CHECK(!i_isolate->IsSharedArrayBufferConstructorEnabled(i_context));
 
-  sab_constructor_enabled_value = true;
+  i::v8_flags.enable_sharedarraybuffer_per_context = false;
+  CHECK(i_isolate->IsSharedArrayBufferConstructorEnabled(i_context));
+
+  i::v8_flags.enable_sharedarraybuffer_per_context = true;
   CHECK(i_isolate->IsSharedArrayBufferConstructorEnabled(i_context));
 }
 
@@ -30093,15 +29982,18 @@ TEST(DeepFreezeFreezesExternalObjectData) {
 namespace {
 void handle_property(Local<String> name,
                      const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_num(900));
 }
 
 void handle_property_2(Local<String> name,
                        const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_num(902));
 }
 
 void handle_property(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CHECK_EQ(0, info.Length());
   info.GetReturnValue().Set(v8_num(907));
 }
@@ -30124,12 +30016,13 @@ TEST(DeepFreezeInstantiatesAccessors) {
 
   v8::Local<v8::Context> context = env.local();
   v8::Maybe<void> maybe_success = context->DeepFreeze(nullptr);
-  CHECK(maybe_success.IsNothing());
+  CHECK(!maybe_success.IsNothing());
 }
 
 namespace {
 void handle_object_property(v8::Local<v8::String> property,
                             const v8::PropertyCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_num(909));
 }
 }  // namespace
@@ -30151,5 +30044,5 @@ TEST(DeepFreezeInstantiatesAccessors2) {
 
   v8::Local<v8::Context> context = env.local();
   v8::Maybe<void> maybe_success = context->DeepFreeze(nullptr);
-  CHECK(maybe_success.IsNothing());
+  CHECK(!maybe_success.IsNothing());
 }
diff --git a/deps/v8/test/cctest/test-api.h b/deps/v8/test/cctest/test-api.h
index ba443198dbce2d..5ecf1e3ba97295 100644
--- a/deps/v8/test/cctest/test-api.h
+++ b/deps/v8/test/cctest/test-api.h
@@ -11,26 +11,28 @@
 #include "test/cctest/cctest.h"
 
 template <typename T>
-static void CheckReturnValue(const T& t, i::Address callback) {
-  v8::ReturnValue<v8::Value> rv = t.GetReturnValue();
-  i::FullObjectSlot o(*reinterpret_cast<i::Address*>(&rv));
-  CHECK_EQ(CcTest::isolate(), t.GetIsolate());
-  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(t.GetIsolate());
-  CHECK_EQ(t.GetIsolate(), rv.GetIsolate());
-  CHECK((*o).IsTheHole(isolate) || (*o).IsUndefined(isolate));
+static void CheckReturnValue(const T& info, i::Address callback) {
+  v8::ReturnValue<v8::Value> returnValue = info.GetReturnValue();
+  i::FullObjectSlot returnObjectSlot(
+      *reinterpret_cast<i::Address*>(&returnValue));
+  CHECK_EQ(CcTest::isolate(), info.GetIsolate());
+  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
+  CHECK_EQ(info.GetIsolate(), returnValue.GetIsolate());
+  CHECK(IsTheHole(*returnObjectSlot, isolate) ||
+        IsUndefined(*returnObjectSlot, isolate));
   // Verify reset
-  bool is_runtime = (*o).IsTheHole(isolate);
+  bool is_runtime = IsTheHole(*returnObjectSlot, isolate);
   if (is_runtime) {
-    CHECK(rv.Get()->IsUndefined());
+    CHECK(returnValue.Get()->IsUndefined());
   } else {
-    i::Handle<i::Object> v = v8::Utils::OpenHandle(*rv.Get());
-    CHECK_EQ(*v, *o);
+    i::Handle<i::Object> v = v8::Utils::OpenHandle(*returnValue.Get());
+    CHECK_EQ(*v, *returnObjectSlot);
   }
-  rv.Set(true);
-  CHECK(!(*o).IsTheHole(isolate) && !(*o).IsUndefined(isolate));
-  rv.Set(v8::Local<v8::Object>());
-  CHECK((*o).IsTheHole(isolate) || (*o).IsUndefined(isolate));
-  CHECK_EQ(is_runtime, (*o).IsTheHole(isolate));
+  returnValue.Set(true);
+  CHECK_EQ(*returnObjectSlot, i::ReadOnlyRoots(isolate).true_value());
+  returnValue.Set(v8::Local<v8::Object>());
+  CHECK(IsTheHole(*returnObjectSlot, isolate) ||
+        IsUndefined(*returnObjectSlot, isolate));
   // If CPU profiler is active check that when API callback is invoked
   // VMState is set to EXTERNAL.
   if (isolate->is_profiling()) {
diff --git a/deps/v8/test/cctest/test-assembler-arm.cc b/deps/v8/test/cctest/test-assembler-arm.cc
index d511f2d28923b9..6ac06f846b1f8a 100644
--- a/deps/v8/test/cctest/test-assembler-arm.cc
+++ b/deps/v8/test/cctest/test-assembler-arm.cc
@@ -62,7 +62,7 @@ TEST(0) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   int res = reinterpret_cast<int>(f.Call(3, 4, 0, 0, 0));
@@ -98,7 +98,7 @@ TEST(1) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   int res = reinterpret_cast<int>(f.Call(100, 0, 0, 0, 0));
@@ -143,7 +143,7 @@ TEST(2) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   int res = reinterpret_cast<int>(f.Call(10, 0, 0, 0, 0));
@@ -189,7 +189,7 @@ TEST(3) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   t.i = 100000;
@@ -319,7 +319,7 @@ TEST(4) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
     t.a = 1.5;
@@ -381,7 +381,7 @@ TEST(5) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
     int res = reinterpret_cast<int>(f.Call(0xAAAAAAAA, 0, 0, 0, 0));
@@ -412,7 +412,7 @@ TEST(6) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   int res = reinterpret_cast<int>(f.Call(0xFFFF, 0, 0, 0, 0));
@@ -479,7 +479,7 @@ static void TestRoundingMode(VCVTTypes types,
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   int res = reinterpret_cast<int>(f.Call(0, 0, 0, 0, 0));
@@ -661,7 +661,7 @@ TEST(8) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto fn = GeneratedCode<F_ppiii>::FromCode(isolate, *code);
   d.a = 1.1;
@@ -770,7 +770,7 @@ TEST(9) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto fn = GeneratedCode<F_ppiii>::FromCode(isolate, *code);
   d.a = 1.1;
@@ -875,7 +875,7 @@ TEST(10) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto fn = GeneratedCode<F_ppiii>::FromCode(isolate, *code);
   d.a = 1.1;
@@ -969,7 +969,7 @@ TEST(11) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   f.Call(&i, 0, 0, 0, 0);
@@ -1094,7 +1094,7 @@ TEST(13) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
     t.a = 1.5;
@@ -1166,7 +1166,7 @@ TEST(14) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   t.left = base::bit_cast<double>(kHoleNanInt64);
@@ -2170,7 +2170,7 @@ TEST(15) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
     t.src0 = 0x01020304;
@@ -2474,7 +2474,7 @@ TEST(16) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   t.src0 = 0x01020304;
@@ -2552,7 +2552,7 @@ TEST(sdiv) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
     TEST_SDIV(0, kMinInt, 0);
@@ -2612,7 +2612,7 @@ TEST(udiv) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
     TEST_UDIV(0u, 0, 0);
@@ -2640,7 +2640,7 @@ TEST(smmla) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2665,7 +2665,7 @@ TEST(smmul) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2690,7 +2690,7 @@ TEST(sxtb) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2715,7 +2715,7 @@ TEST(sxtab) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2740,7 +2740,7 @@ TEST(sxth) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2765,7 +2765,7 @@ TEST(sxtah) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2790,7 +2790,7 @@ TEST(uxtb) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2815,7 +2815,7 @@ TEST(uxtab) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2840,7 +2840,7 @@ TEST(uxth) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2865,7 +2865,7 @@ TEST(uxtah) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   for (size_t i = 0; i < 128; ++i) {
@@ -2907,7 +2907,7 @@ TEST(rbit) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 
 #ifdef OBJECT_PRINT
-    code->Print(std::cout);
+    Print(*code, std::cout);
 #endif
 
     auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
@@ -3028,7 +3028,7 @@ TEST(msr_mrs) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_ippii>::FromCode(isolate, *code);
 
@@ -3125,7 +3125,7 @@ TEST(ARMv8_float32_vrintX) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
 
@@ -3226,7 +3226,7 @@ TEST(ARMv8_vrintX) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
 
@@ -3363,7 +3363,7 @@ TEST(ARMv8_vsel) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_ippii>::FromCode(isolate, *code);
 
@@ -3454,7 +3454,7 @@ TEST(ARMv8_vminmax_f64) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_ppiii>::FromCode(isolate, *code);
 
@@ -3536,7 +3536,7 @@ TEST(ARMv8_vminmax_f32) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_ppiii>::FromCode(isolate, *code);
 
@@ -3671,7 +3671,7 @@ static GeneratedCode<F_ppiii> GenerateMacroFloatMinMax(
       Factory::CodeBuilder(assm.isolate(), desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   return GeneratedCode<F_ppiii>::FromCode(assm.isolate(), *code);
 }
@@ -3846,7 +3846,7 @@ TEST(unaligned_loads) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_ppiii>::FromCode(isolate, *code);
 
@@ -3889,7 +3889,7 @@ TEST(unaligned_stores) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_ppiii>::FromCode(isolate, *code);
 
@@ -3989,7 +3989,7 @@ TEST(vswp) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   f.Call(&t, 0, 0, 0, 0);
@@ -4201,7 +4201,7 @@ TEST(split_add_immediate) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
     uint32_t res = reinterpret_cast<int>(f.Call(0, 0, 0, 0, 0));
@@ -4221,7 +4221,7 @@ TEST(split_add_immediate) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
     uint32_t res = reinterpret_cast<int>(f.Call(0, 0, 0, 0, 0));
@@ -4244,7 +4244,7 @@ TEST(split_add_immediate) {
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
     StdoutStream os;
-    code->Print(os);
+    Print(*code, os);
 #endif
     auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
     uint32_t res = reinterpret_cast<int>(f.Call(0, 0, 0, 0, 0));
diff --git a/deps/v8/test/cctest/test-assembler-arm64.cc b/deps/v8/test/cctest/test-assembler-arm64.cc
index 273cba805857f4..5b224e90040021 100644
--- a/deps/v8/test/cctest/test-assembler-arm64.cc
+++ b/deps/v8/test/cctest/test-assembler-arm64.cc
@@ -167,7 +167,7 @@ static void InitializeVM() {
   START_AFTER_RESET();
 
 #define RUN() \
-  simulator.RunFrom(reinterpret_cast<Instruction*>(code->code_entry_point()))
+  simulator.RunFrom(reinterpret_cast<Instruction*>(code->instruction_start()))
 
 #define END()                                                                  \
   __ Debug("End test.", __LINE__, TRACE_DISABLE | LOG_ALL);                    \
@@ -178,7 +178,7 @@ static void InitializeVM() {
     CodeDesc desc;                                                             \
     __ GetCode(masm.isolate(), &desc);                                         \
     code = Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build(); \
-    if (v8_flags.print_code) code->Print();                                    \
+    if (v8_flags.print_code) Print(*code);                                     \
   }
 
 #else  // ifdef USE_SIMULATOR.
@@ -229,7 +229,7 @@ static void InitializeVM() {
     CodeDesc desc;                                                             \
     __ GetCode(masm.isolate(), &desc);                                         \
     code = Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build(); \
-    if (v8_flags.print_code) code->Print();                                    \
+    if (v8_flags.print_code) Print(*code);                                     \
   }
 
 #endif  // ifdef USE_SIMULATOR.
@@ -6789,7 +6789,7 @@ static void LdrLiteralRangeHelper(
   END();
 
   if (outcome == EmitExpected) {
-    Address pool_start = code->InstructionStart() + pc_offset_before_emission;
+    Address pool_start = code->instruction_start() + pc_offset_before_emission;
     Instruction* branch = reinterpret_cast<Instruction*>(pool_start);
     CHECK(branch->IsImmBranch());
     CHECK_EQ(expected_pool_size, branch->ImmPCOffset());
@@ -14771,12 +14771,12 @@ static void AtomicMemoryWHelper(AtomicMemoryLoadSignature* load_funcs,
                                 AtomicMemoryStoreSignature* store_funcs,
                                 uint64_t arg1, uint64_t arg2, uint64_t expected,
                                 uint64_t result_mask) {
-  uint64_t data0[2] = {arg2, 0};
-  uint64_t data1[2] = {arg2, 0};
-  uint64_t data2[2] = {arg2, 0};
-  uint64_t data3[2] = {arg2, 0};
-  uint64_t data4[2] = {arg2, 0};
-  uint64_t data5[2] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data0[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data1[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data2[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data3[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data4[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data5[] = {arg2, 0};
 
   SETUP();
   SETUP_FEATURE(LSE);
@@ -14838,12 +14838,12 @@ static void AtomicMemoryXHelper(AtomicMemoryLoadSignature* load_funcs,
                                 AtomicMemoryStoreSignature* store_funcs,
                                 uint64_t arg1, uint64_t arg2,
                                 uint64_t expected) {
-  uint64_t data0[2] = {arg2, 0};
-  uint64_t data1[2] = {arg2, 0};
-  uint64_t data2[2] = {arg2, 0};
-  uint64_t data3[2] = {arg2, 0};
-  uint64_t data4[2] = {arg2, 0};
-  uint64_t data5[2] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data0[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data1[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data2[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data3[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data4[] = {arg2, 0};
+  alignas(kXRegSize * 2) uint64_t data5[] = {arg2, 0};
 
   SETUP();
   SETUP_FEATURE(LSE);
@@ -16004,6 +16004,25 @@ TEST(internal_reference_linked) {
   CHECK_EQUAL_64(0x1, x0);
 }
 
+TEST(scalar_movi) {
+  INIT_V8();
+  SETUP();
+  START();
+
+  // Make sure that V0 is initialized to a non-zero value.
+  __ Movi(v0.V16B(), 0xFF);
+  // This constant value can't be encoded in a MOVI instruction,
+  // so the program would use a fallback path that must set the
+  // upper 64 bits of the destination vector to 0.
+  __ Movi(v0.V1D(), 0xDECAFC0FFEE);
+  __ Mov(x0, v0.V2D(), 1);
+
+  END();
+  RUN();
+
+  CHECK_EQUAL_64(0, x0);
+}
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/test/cctest/test-assembler-ia32.cc b/deps/v8/test/cctest/test-assembler-ia32.cc
index 3996b71cecf8c1..f13a6f93ab5fe1 100644
--- a/deps/v8/test/cctest/test-assembler-ia32.cc
+++ b/deps/v8/test/cctest/test-assembler-ia32.cc
@@ -52,7 +52,7 @@ TEST(AssemblerIa320) {
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
 
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
 
@@ -66,7 +66,7 @@ TEST(AssemblerIa320) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
   auto res = f.Call(3, 4);
@@ -80,7 +80,7 @@ TEST(AssemblerIa321) {
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
 
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
   Label L, C;
@@ -104,7 +104,7 @@ TEST(AssemblerIa321) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   int res = f.Call(100);
@@ -118,7 +118,7 @@ TEST(AssemblerIa322) {
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
 
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
   Label L, C;
@@ -145,7 +145,7 @@ TEST(AssemblerIa322) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   int res = f.Call(10);
@@ -161,7 +161,7 @@ TEST(AssemblerIa323) {
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
 
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
 
@@ -174,7 +174,7 @@ TEST(AssemblerIa323) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
   int res = f.Call(-3.1415f);
@@ -190,7 +190,7 @@ TEST(AssemblerIa324) {
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
 
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
 
@@ -203,7 +203,7 @@ TEST(AssemblerIa324) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F4>::FromCode(isolate, *code);
   int res = f.Call(2.718281828);
@@ -218,7 +218,7 @@ TEST(AssemblerIa325) {
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
 
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
 
@@ -241,7 +241,7 @@ TEST(AssemblerIa326) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
 
@@ -264,7 +264,7 @@ TEST(AssemblerIa326) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F5>::FromCode(isolate, *code);
   double res = f.Call(2.2, 1.1);
@@ -279,7 +279,7 @@ TEST(AssemblerIa328) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
   __ mov(eax, Operand(esp, 4));
@@ -296,7 +296,7 @@ TEST(AssemblerIa328) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F6>::FromCode(isolate, *code);
   double res = f.Call(12);
@@ -324,7 +324,7 @@ TEST(AssemblerMultiByteNop) {
   CcTest::InitializeVM();
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   __ push(ebx);
@@ -377,7 +377,7 @@ TEST(AssemblerMultiByteNop) {
   assm.GetCode(isolate, &desc);
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
-  CHECK(code->IsCode());
+  CHECK(IsCode(*code));
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
   int res = f.Call();
@@ -388,16 +388,17 @@ TEST(AssemblerMultiByteNop) {
 #ifdef __GNUC__
 #define ELEMENT_COUNT 4u
 
-void DoSSE2(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void DoSSE2(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
   v8::Local<v8::Context> context = CcTest::isolate()->GetCurrentContext();
 
-  CHECK(args[0]->IsArray());
-  v8::Local<v8::Array> vec = v8::Local<v8::Array>::Cast(args[0]);
+  CHECK(info[0]->IsArray());
+  v8::Local<v8::Array> vec = v8::Local<v8::Array>::Cast(info[0]);
   CHECK_EQ(ELEMENT_COUNT, vec->Length());
 
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
 
@@ -431,10 +432,9 @@ void DoSSE2(const v8::FunctionCallbackInfo<v8::Value>& args) {
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
   int res = f.Call();
-  args.GetReturnValue().Set(v8::Integer::New(CcTest::isolate(), res));
+  info.GetReturnValue().Set(v8::Integer::New(CcTest::isolate(), res));
 }
 
-
 TEST(StackAlignmentForSSE2) {
   CcTest::InitializeVM();
   CHECK_EQ(0, v8::base::OS::ActivationFrameAlignment() % 16);
@@ -462,7 +462,7 @@ TEST(StackAlignmentForSSE2) {
     v8_vec->Set(env.local(), i, v8_num(vec[i])).FromJust();
   }
 
-  v8::Local<v8::Value> args[] = { v8_vec };
+  v8::Local<v8::Value> args[] = {v8_vec};
   v8::Local<v8::Value> result =
       foo->Call(env.local(), global_object, 1, args).ToLocalChecked();
 
@@ -480,7 +480,7 @@ TEST(AssemblerIa32Extractps) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   { CpuFeatureScope fscope41(&assm, SSE4_1);
@@ -495,7 +495,7 @@ TEST(AssemblerIa32Extractps) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F4>::FromCode(isolate, *code);
@@ -512,7 +512,7 @@ TEST(AssemblerIa32SSE) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -535,7 +535,7 @@ TEST(AssemblerIa32SSE) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F8>::FromCode(isolate, *code);
@@ -548,7 +548,7 @@ TEST(AssemblerIa32SSE3) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -568,7 +568,7 @@ TEST(AssemblerIa32SSE3) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F8>::FromCode(isolate, *code);
@@ -582,7 +582,7 @@ TEST(AssemblerX64FMA_sd) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -796,7 +796,7 @@ TEST(AssemblerX64FMA_sd) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F9>::FromCode(isolate, *code);
@@ -811,7 +811,7 @@ TEST(AssemblerX64FMA_ss) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1025,7 +1025,7 @@ TEST(AssemblerX64FMA_ss) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F10>::FromCode(isolate, *code);
@@ -1039,7 +1039,7 @@ TEST(AssemblerIa32BMI1) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1133,7 +1133,7 @@ TEST(AssemblerIa32BMI1) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -1147,7 +1147,7 @@ TEST(AssemblerIa32LZCNT) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1181,7 +1181,7 @@ TEST(AssemblerIa32LZCNT) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -1195,7 +1195,7 @@ TEST(AssemblerIa32POPCNT) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1229,7 +1229,7 @@ TEST(AssemblerIa32POPCNT) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -1243,7 +1243,7 @@ TEST(AssemblerIa32BMI2) {
 
   Isolate* isolate = reinterpret_cast<Isolate*>(CcTest::isolate());
   HandleScope scope(isolate);
-  v8::internal::byte buffer[2048];
+  uint8_t buffer[2048];
   MacroAssembler assm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1375,7 +1375,7 @@ TEST(AssemblerIa32BMI2) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -1419,7 +1419,7 @@ TEST(AssemblerIa32JumpTables1) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -1467,7 +1467,7 @@ TEST(AssemblerIa32JumpTables2) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -1511,7 +1511,7 @@ TEST(Regress621926) {
 
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -1521,7 +1521,7 @@ TEST(Regress621926) {
 TEST(DeoptExitSizeIsFixed) {
   Isolate* isolate = CcTest::i_isolate();
   HandleScope handles(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
 
diff --git a/deps/v8/test/cctest/test-assembler-loong64.cc b/deps/v8/test/cctest/test-assembler-loong64.cc
index 142b746da3e090..29e9ea79b1da48 100644
--- a/deps/v8/test/cctest/test-assembler-loong64.cc
+++ b/deps/v8/test/cctest/test-assembler-loong64.cc
@@ -4116,7 +4116,7 @@ TEST(jump_tables1) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -4179,7 +4179,7 @@ TEST(jump_tables2) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -4249,7 +4249,7 @@ TEST(jump_tables3) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -4257,7 +4257,7 @@ TEST(jump_tables3) {
         Object(reinterpret_cast<Address>(f.Call(i, 0, 0, 0, 0))), isolate);
 #ifdef OBJECT_PRINT
     ::printf("f(%d) = ", i);
-    result->Print(std::cout);
+    Print(*result);
     ::printf("\n");
 #endif
     CHECK(values[i].is_identical_to(result));
@@ -4284,7 +4284,7 @@ uint64_t run_li_macro(int64_t imm, LiFlags mode, int32_t num_instr = 0) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
 
diff --git a/deps/v8/test/cctest/test-assembler-mips64.cc b/deps/v8/test/cctest/test-assembler-mips64.cc
index fecd5779b27181..88f3f9ff0596cd 100644
--- a/deps/v8/test/cctest/test-assembler-mips64.cc
+++ b/deps/v8/test/cctest/test-assembler-mips64.cc
@@ -3280,7 +3280,7 @@ TEST(jump_tables1) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -3345,7 +3345,7 @@ TEST(jump_tables2) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -3420,7 +3420,7 @@ TEST(jump_tables3) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -3428,7 +3428,7 @@ TEST(jump_tables3) {
         Object(reinterpret_cast<Address>(f.Call(i, 0, 0, 0, 0))), isolate);
 #ifdef OBJECT_PRINT
     ::printf("f(%d) = ", i);
-    result->Print(std::cout);
+    Print(*result);
     ::printf("\n");
 #endif
     CHECK(values[i].is_identical_to(result));
@@ -4731,7 +4731,7 @@ uint64_t run_aluipc(int16_t offset) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
-  PC = (uint64_t)code->code_entry_point();  // Set the program counter.
+  PC = (uint64_t)code->instruction_start();  // Set the program counter.
 
   uint64_t res = reinterpret_cast<uint64_t>(f.Call(0, 0, 0, 0, 0));
 
@@ -4784,7 +4784,7 @@ uint64_t run_auipc(int16_t offset) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
-  PC = (uint64_t)code->code_entry_point();  // Set the program counter.
+  PC = (uint64_t)code->instruction_start();  // Set the program counter.
 
   uint64_t res = reinterpret_cast<uint64_t>(f.Call(0, 0, 0, 0, 0));
 
@@ -5012,7 +5012,7 @@ uint64_t run_li_macro(uint64_t imm, LiFlags mode, int32_t num_instr = 0) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
 
@@ -5558,7 +5558,7 @@ void run_bz_bnz(TestCaseMsaBranch* input, Branch GenerateBranch,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -5780,7 +5780,7 @@ uint64_t run_addiupc(int32_t imm19) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
-  PC = (uint64_t)code->code_entry_point();  // Set the program counter.
+  PC = (uint64_t)code->instruction_start();  // Set the program counter.
 
   uint64_t res = reinterpret_cast<uint64_t>(f.Call(0, 0, 0, 0, 0));
 
@@ -6393,7 +6393,7 @@ uint64_t run_Subu(uint64_t imm, int32_t num_instr) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
 
@@ -6476,7 +6476,7 @@ uint64_t run_Dsubu(uint64_t imm, int32_t num_instr) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
 
@@ -6783,7 +6783,7 @@ TEST(MSA_fill_copy) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -6846,7 +6846,7 @@ TEST(MSA_fill_copy_2) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F5>::FromCode(isolate, *code);
 
@@ -6899,7 +6899,7 @@ TEST(MSA_fill_copy_3) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F5>::FromCode(isolate, *code);
 
@@ -6948,7 +6948,7 @@ void run_msa_insert(int64_t rs_value, int n, msa_reg_t* w) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -7058,7 +7058,7 @@ void run_msa_ctc_cfc(uint64_t value) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -7108,7 +7108,7 @@ TEST(MSA_move_v) {
     Handle<Code> code =
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-    code->Print(std::cout);
+    Print(*code);
 #endif
     auto f = GeneratedCode<F3>::FromCode(isolate, *code);
     f.Call(&t[i].wd_lo, 0, 0, 0, 0);
@@ -7153,7 +7153,7 @@ void run_msa_sldi(OperFunc GenerateOperation,
     Handle<Code> code =
         Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-    code->Print(std::cout);
+    Print(*code);
 #endif
     auto f = GeneratedCode<F3>::FromCode(isolate, *code);
     f.Call(&res[0], 0, 0, 0, 0);
@@ -7313,7 +7313,7 @@ void run_msa_i8(SecondaryField opcode, uint64_t ws_lo, uint64_t ws_hi,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -7517,7 +7517,7 @@ void run_msa_i5(struct TestCaseMsaI5* input, bool i5_sign_ext,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -7943,7 +7943,7 @@ void run_msa_2r(const struct TestCaseMsa2R* input,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -8993,7 +8993,7 @@ void run_msa_vector(struct TestCaseMsaVector* input,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -9081,7 +9081,7 @@ void run_msa_bit(struct TestCaseMsaBit* input, InstFunc GenerateInstructionFunc,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -9554,7 +9554,7 @@ void run_msa_i10(int32_t input, InstFunc GenerateVectorInstructionFunc,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -9632,7 +9632,7 @@ void run_msa_mi10(InstFunc GenerateVectorInstructionFunc) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F5>::FromCode(isolate, *code);
 
@@ -9711,7 +9711,7 @@ void run_msa_3r(struct TestCaseMsa3R* input, InstFunc GenerateI5InstructionFunc,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
@@ -10718,7 +10718,7 @@ void run_msa_3rf(const struct TestCaseMsa3RF* input,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
 
diff --git a/deps/v8/test/cctest/test-assembler-ppc.cc b/deps/v8/test/cctest/test-assembler-ppc.cc
index b1c4a6b90ada82..d8980c24615e9a 100644
--- a/deps/v8/test/cctest/test-assembler-ppc.cc
+++ b/deps/v8/test/cctest/test-assembler-ppc.cc
@@ -63,7 +63,7 @@ TEST(0) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(3, 4, 0, 0, 0));
@@ -99,7 +99,7 @@ TEST(1) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(100, 0, 0, 0, 0));
@@ -147,7 +147,7 @@ TEST(2) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(10, 0, 0, 0, 0));
@@ -216,7 +216,7 @@ TEST(3) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F_piiii>::FromCode(isolate, *code);
   t.i = 100000;
@@ -1075,7 +1075,7 @@ TEST(WordSizedVectorInstructions) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F_iiiii>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(0, 0, 0, 0, 0));
diff --git a/deps/v8/test/cctest/test-assembler-riscv32.cc b/deps/v8/test/cctest/test-assembler-riscv32.cc
index 0bcbd5fae41f6e..719836ab7ca9c2 100644
--- a/deps/v8/test/cctest/test-assembler-riscv32.cc
+++ b/deps/v8/test/cctest/test-assembler-riscv32.cc
@@ -492,9 +492,8 @@ TEST(RISCV_UTEST_fmv_d_double) {
            base::bit_cast<int64_t>(dst));
 }
 
-// Test fmv_d
-// double not a canonical NaN
-TEST(RISCV_UTEST_fmv_d_double_NAN_BOX) {
+// Test signaling NaN in FMV.D
+TEST(RISCV_UTEST_fmv_d_double_signaling_NaN) {
   CcTest::InitializeVM();
 
   int64_t src = base::bit_cast<int64_t>(0x7ff4000000000000);
@@ -1073,7 +1072,7 @@ TEST(NAN_BOX) {
     CHECK_EQ((uint32_t)base::bit_cast<uint32_t>(1234.56f), res);
   }
 
-  // Test NaN boxing in FMV.S
+  // Test signaling NaN in FMV.S
   {
     auto fn = [](MacroAssembler& assm) {
       __ fmv_w_x(fa0, a0);
@@ -1730,7 +1729,7 @@ TEST(jump_tables3) {
         Object(reinterpret_cast<Address>(f.Call(i, 0, 0, 0, 0))), isolate);
 #ifdef OBJECT_PRINT
     ::printf("f(%d) = ", i);
-    result->Print(std::cout);
+    Print(*result, std::cout);
     ::printf("\n");
 #endif
     CHECK(values[i].is_identical_to(result));
@@ -1771,7 +1770,7 @@ TEST(li_estimate) {
       __ vl(v2, a0, 0, SEW);                                                 \
       __ vs(v2, a1, 0, SEW);                                                 \
     };                                                                       \
-    GenAndRunTest<int32_t, int64_t>((int64_t)src, (int64_t)dst, fn);         \
+    GenAndRunTest<int32_t, int32_t>((int32_t)src, (int32_t)dst, fn);         \
     CHECK(!memcmp(src, dst, sizeof(src)));                                   \
   }
 
@@ -1793,11 +1792,141 @@ TEST(RVV_VFMV) {
       __ vfmv_vf(v2, fa1);
       __ vs(v2, a1, 0, VSew::E32);
     };
-    GenAndRunTest<int32_t, int64_t>((int64_t)&src, (int64_t)dst, fn);
+    GenAndRunTest<int32_t, int32_t>((int32_t)&src, (int32_t)dst, fn);
     CHECK(!memcmp(ref, dst, sizeof(ref)));
   }
 }
 
+TEST(RVV_VFMV_signaling_NaN) {
+  if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;
+  CcTest::InitializeVM();
+
+  {
+    constexpr uint32_t n = 2;
+    int64_t rs1_fval = 0x7FF4000000000000;
+    int64_t dst[n] = {0};
+    auto fn = [](MacroAssembler& assm) {
+      __ VU.set(t0, VSew::E64, Vlmul::m1);
+      __ fld(ft0, a0, 0);
+      __ vfmv_vf(v1, ft0);
+      __ vs(v1, a1, 0, VSew::E64);
+    };
+    GenAndRunTest<int32_t, int32_t>((int32_t)&rs1_fval, (int32_t)dst, fn);
+    for (uint32_t i = 0; i < n; i++) {
+      CHECK_EQ(rs1_fval, dst[i]);
+    }
+  }
+
+  {
+    constexpr uint32_t n = 4;
+    int32_t rs1_fval = 0x7F400000;
+    int32_t dst[n] = {0};
+    auto fn = [](MacroAssembler& assm) {
+      __ VU.set(t0, VSew::E32, Vlmul::m1);
+      __ flw(ft0, a0, 0);
+      __ vfmv_vf(v1, ft0);
+      __ vs(v1, a1, 0, VSew::E32);
+    };
+    GenAndRunTest<int32_t, int32_t>((int32_t)&rs1_fval, (int32_t)dst, fn);
+    for (uint32_t i = 0; i < n; i++) {
+      CHECK_EQ(rs1_fval, dst[i]);
+    }
+  }
+}
+
+TEST(RVV_VFNEG_signaling_NaN) {
+  if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;
+  CcTest::InitializeVM();
+
+  {
+    constexpr uint32_t n = 2;
+    int64_t rs1_fval = 0x7FF4000000000000;
+    int64_t expected_fval = 0xFFF4000000000000;
+    int64_t dst[n] = {0};
+    auto fn = [](MacroAssembler& assm) {
+      __ VU.set(t0, VSew::E64, Vlmul::m1);
+      __ fld(ft0, a0, 0);
+      __ vfmv_vf(v1, ft0);
+      __ vfneg_vv(v2, v1);
+      __ vs(v2, a1, 0, VSew::E64);
+    };
+    GenAndRunTest<int32_t, int32_t>((int32_t)&rs1_fval, (int32_t)dst, fn);
+    for (uint32_t i = 0; i < n; i++) {
+      CHECK_EQ(expected_fval, dst[i]);
+    }
+  }
+
+  {
+    constexpr uint32_t n = 4;
+    int32_t rs1_fval = 0x7F400000;
+    int32_t expected_fval = 0xFF400000;
+    int32_t dst[n] = {0};
+    auto fn = [](MacroAssembler& assm) {
+      __ VU.set(t0, VSew::E32, Vlmul::m1);
+      __ flw(ft0, a0, 0);
+      __ vfmv_vf(v1, ft0);
+      __ vfneg_vv(v2, v1);
+      __ vs(v2, a1, 0, VSew::E32);
+    };
+    GenAndRunTest<int32_t, int32_t>((int32_t)&rs1_fval, (int32_t)dst, fn);
+    for (uint32_t i = 0; i < n; i++) {
+      CHECK_EQ(expected_fval, dst[i]);
+    }
+  }
+}
+
+// Tests for Floating-Point scalar move instructions between vector and scalar f
+// register
+#define UTEST_RVV_VF_MV_FORM_WITH_RES(instr_name, reg1, reg2, width, type)   \
+  TEST(RISCV_UTEST_##instr_name##_##width) {                                 \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    CcTest::InitializeVM();                                                  \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    for (type fval : compiler::ValueHelper::GetVector<type>()) {             \
+      int##width##_t rs1_fval = base::bit_cast<int##width##_t>(fval);        \
+      int##width##_t res[n] = {0};                                           \
+      for (uint32_t i = 0; i < n; i++) res[i] = (rs1_fval + i + 1);          \
+      auto fn = [](MacroAssembler& assm) {                                   \
+        __ VU.set(t0, VSew::E##width, Vlmul::m1);                            \
+        width == 32 ? __ flw(ft0, a0, 0) : __ fld(ft0, a0, 0);               \
+        __ vl(v1, a1, 0, VSew::E##width);                                    \
+        __ instr_name(reg1, reg2);                                           \
+        __ fsd(ft0, a0, 0);                                                  \
+        __ vs(v1, a1, 0, VSew::E##width);                                    \
+      };                                                                     \
+      GenAndRunTest<int32_t, int32_t>((int32_t)&rs1_fval, (int32_t)res, fn); \
+      for (uint32_t i = 0; i < n; i++) {                                     \
+        CHECK_EQ(i == 0 ? rs1_fval : res[i], res[i]);                        \
+      }                                                                      \
+    }                                                                        \
+  }                                                                          \
+  TEST(RISCV_UTEST_##instr_name##_##width##_##sNaN) {                        \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    CcTest::InitializeVM();                                                  \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    int##width##_t rs1_fval = width == 32 ? 0x7F400000 : 0x7FF4000000000000; \
+    int##width##_t res[n] = {0};                                             \
+    for (uint32_t i = 0; i < n; i++) res[i] = (rs1_fval + i + 1);            \
+    auto fn = [](MacroAssembler& assm) {                                     \
+      __ VU.set(t0, VSew::E##width, Vlmul::m1);                              \
+      width == 32 ? __ flw(ft0, a0, 0) : __ fld(ft0, a0, 0);                 \
+      __ vl(v1, a1, 0, VSew::E##width);                                      \
+      __ instr_name(reg1, reg2);                                             \
+      __ fsd(ft0, a0, 0);                                                    \
+      __ vs(v1, a1, 0, VSew::E##width);                                      \
+    };                                                                       \
+    GenAndRunTest<int32_t, int32_t>((int32_t)&rs1_fval, (int32_t)res, fn);   \
+    for (uint32_t i = 0; i < n; i++) {                                       \
+      CHECK_EQ(i == 0 ? rs1_fval : res[i], res[i]);                          \
+    }                                                                        \
+  }
+
+UTEST_RVV_VF_MV_FORM_WITH_RES(vfmv_fs, ft0, v1, 32, float)
+UTEST_RVV_VF_MV_FORM_WITH_RES(vfmv_fs, ft0, v1, 64, double)
+UTEST_RVV_VF_MV_FORM_WITH_RES(vfmv_sf, v1, ft0, 32, float)
+UTEST_RVV_VF_MV_FORM_WITH_RES(vfmv_sf, v1, ft0, 64, double)
+#undef UTEST_RVV_VF_MV_FORM_WITH_RES
+
 inline int32_t ToImm5(int32_t v) {
   int32_t smax = (int32_t)(INT64_MAX >> (64 - 5));
   int32_t smin = (int32_t)(INT64_MIN >> (64 - 5));
@@ -1975,7 +2104,7 @@ UTEST_RVV_VI_VX_FORM_WITH_FN(vminu_vx, 32, ARRAY_INT32, std::min<uint32_t>)
       __ vfmv_vf(v1, fa1);                                                 \
       __ instr_name(v0, v0, v1);                                           \
       __ vfmv_fs(fa0, v0);                                                 \
-      __ li(a3, Operand(int64_t(result)));                                 \
+      __ li(a3, Operand(int32_t(result)));                                 \
       __ vs(v0, a3, 0, E32);                                               \
     };                                                                     \
     for (float rs1_fval : compiler::ValueHelper::GetVector<float>()) {     \
@@ -1994,16 +2123,19 @@ UTEST_RVV_VI_VX_FORM_WITH_FN(vminu_vx, 32, ARRAY_INT32, std::min<uint32_t>)
     double result[2] = {0.0};                                              \
     auto fn = [&result](MacroAssembler& assm) {                            \
       __ VU.set(t0, VSew::E64, Vlmul::m1);                                 \
+      __ fld(fa0, a0, 0);                                                  \
+      __ fld(fa1, a1, 0);                                                  \
       __ vfmv_vf(v0, fa0);                                                 \
       __ vfmv_vf(v1, fa1);                                                 \
       __ instr_name(v0, v0, v1);                                           \
       __ vfmv_fs(fa0, v0);                                                 \
-      __ li(a3, Operand(int64_t(result)));                                 \
+      __ li(a3, Operand(int32_t(result)));                                 \
       __ vs(v0, a3, 0, E64);                                               \
     };                                                                     \
     for (double rs1_fval : compiler::ValueHelper::GetVector<double>()) {   \
       for (double rs2_fval : compiler::ValueHelper::GetVector<double>()) { \
-        GenAndRunTest<double, double>(rs1_fval, rs2_fval, fn);             \
+        GenAndRunTest<int32_t, int32_t>((int32_t)&rs1_fval,                \
+                                        (int32_t)&rs2_fval, fn);           \
         for (int i = 0; i < 2; i++) {                                      \
           CHECK_DOUBLE_EQ(UseCanonicalNan<double>(expect_res), result[i]); \
           result[i] = 0.0;                                                 \
@@ -2035,11 +2167,14 @@ UTEST_RVV_VI_VX_FORM_WITH_FN(vminu_vx, 32, ARRAY_INT32, std::min<uint32_t>)
 #define UTEST_RVV_VF_VV_FORM_WITH_OP(instr_name, tested_op) \
   UTEST_RVV_VF_VV_FORM_WITH_RES(instr_name, ((rs1_fval)tested_op(rs2_fval)))
 
-#define UTEST_RVV_VF_VF_FORM_WITH_OP(instr_name, tested_op) \
-  UTEST_RVV_VF_VF_FORM_WITH_RES(instr_name, ((rs1_fval)tested_op(rs2_fval)))
+#define UTEST_RVV_VF_VF_FORM_WITH_OP(instr_name, array, tested_op) \
+  UTEST_RVV_VF_VF_FORM_WITH_RES(instr_name, array,                 \
+                                ((rs1_fval)tested_op(rs2_fval)))
+
+#define ARRAY_FLOAT compiler::ValueHelper::GetVector<float>()
 
 UTEST_RVV_VF_VV_FORM_WITH_OP(vfadd_vv, +)
-// UTEST_RVV_VF_VF_FORM_WITH_OP(vfadd_vf, ARRAY_FLOAT, +)
+UTEST_RVV_VF_VF_FORM_WITH_OP(vfadd_vf, ARRAY_FLOAT, +)
 UTEST_RVV_VF_VV_FORM_WITH_OP(vfsub_vv, -)
 // UTEST_RVV_VF_VF_FORM_WITH_OP(vfsub_vf, ARRAY_FLOAT, -)
 UTEST_RVV_VF_VV_FORM_WITH_OP(vfmul_vv, *)
@@ -2072,12 +2207,12 @@ UTEST_RVV_VF_VV_FORM_WITH_OP(vfdiv_vv, /)
       }                                                                        \
       __ vfmv_vf(v4, fa1);                                                     \
       __ instr_name(v0, v2, v4);                                               \
-      __ li(t1, Operand(int64_t(result)));                                     \
+      __ li(t1, Operand(int32_t(result)));                                     \
       __ vs(v0, t1, 0, VSew::E64);                                             \
     };                                                                         \
     for (float rs1_fval : compiler::ValueHelper::GetVector<float>()) {         \
       for (float rs2_fval : compiler::ValueHelper::GetVector<float>()) {       \
-        GenAndRunTest<double, float>(rs1_fval, rs2_fval, fn);                  \
+        GenAndRunTest<double*, float>(rs1_fval, rs2_fval, fn);                 \
         for (size_t i = 0; i < n; i++) {                                       \
           CHECK_DOUBLE_EQ(                                                     \
               check_fn(rs1_fval, rs2_fval)                                     \
@@ -2112,12 +2247,12 @@ UTEST_RVV_VF_VV_FORM_WITH_OP(vfdiv_vv, /)
         __ vfmv_vf(v2, fa0);                                                   \
       }                                                                        \
       __ instr_name(v0, v2, fa1);                                              \
-      __ li(t1, Operand(int64_t(result)));                                     \
+      __ li(t1, Operand(int32_t(result)));                                     \
       __ vs(v0, t1, 0, VSew::E64);                                             \
     };                                                                         \
     for (float rs1_fval : compiler::ValueHelper::GetVector<float>()) {         \
       for (float rs2_fval : compiler::ValueHelper::GetVector<float>()) {       \
-        GenAndRunTest<double, float>(rs1_fval, rs2_fval, fn);                  \
+        GenAndRunTest<double*, float>(rs1_fval, rs2_fval, fn);                 \
         for (size_t i = 0; i < n; i++) {                                       \
           CHECK_DOUBLE_EQ(                                                     \
               check_fn(rs1_fval, rs2_fval)                                     \
@@ -2174,83 +2309,98 @@ UTEST_RVV_VFW_VF_FORM_WITH_OP(vfwmul_vf, *, false, is_invalid_fmul)
 
 // Tests for vector widening floating-point fused multiply-add Instructions
 // between vectors
-#define UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(instr_name, array, expect_res)     \
-  TEST(RISCV_UTEST_FLOAT_WIDENING_##instr_name) {                             \
-    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                        \
-    CcTest::InitializeVM();                                                   \
-    auto fn = [](MacroAssembler& assm) {                                      \
-      __ VU.set(t0, VSew::E32, Vlmul::m1);                                    \
-      __ vfmv_vf(v0, fa0);                                                    \
-      __ vfmv_vf(v2, fa1);                                                    \
-      __ vfmv_vf(v4, fa2);                                                    \
-      __ instr_name(v0, v2, v4);                                              \
-      __ VU.set(t0, VSew::E64, Vlmul::m1);                                    \
-      __ vfmv_fs(fa0, v0);                                                    \
-    };                                                                        \
-    for (float rs1_fval : array) {                                            \
-      for (float rs2_fval : array) {                                          \
-        for (float rs3_fval : array) {                                        \
-          double rs1_dval = base::bit_cast<double>(                           \
-              (uint64_t)base::bit_cast<uint32_t>(rs1_fval) << 32 |            \
-              base::bit_cast<uint32_t>(rs1_fval));                            \
-          double rs2_dval = static_cast<double>(rs2_fval);                    \
-          double rs3_dval = static_cast<double>(rs3_fval);                    \
-          double res =                                                        \
-              GenAndRunTest<double, float>(rs1_fval, rs2_fval, rs3_fval, fn); \
-          CHECK_DOUBLE_EQ((expect_res), res);                                 \
-        }                                                                     \
-      }                                                                       \
-    }                                                                         \
+#define UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(instr_name, float_array,   \
+                                           double_array, expect_res)  \
+  TEST(RISCV_UTEST_FLOAT_WIDENING_##instr_name) {                     \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                \
+    CcTest::InitializeVM();                                           \
+    double addend_arr[2] = {0};                                       \
+    float right_mul_arr[4] = {0};                                     \
+    float left_mul_arr[4] = {0};                                      \
+    auto fn = [](MacroAssembler& assm) {                              \
+      __ VU.set(t0, VSew::E32, Vlmul::m1);                            \
+      __ vl(v0, a0, 0, VSew::E32);                                    \
+      __ vl(v2, a1, 0, VSew::E32);                                    \
+      __ vl(v4, a2, 0, VSew::E32);                                    \
+      __ instr_name(v0, v2, v4);                                      \
+      __ VU.set(t0, VSew::E64, Vlmul::m1);                            \
+      __ vs(v0, a0, 0, VSew::E64);                                    \
+    };                                                                \
+    for (double rs1_dval : double_array) {                            \
+      for (float rs2_fval : float_array) {                            \
+        for (float rs3_fval : float_array) {                          \
+          for (double& src : addend_arr) src = rs1_dval;              \
+          for (float& src : right_mul_arr) src = rs2_fval;            \
+          for (float& src : left_mul_arr) src = rs3_fval;             \
+          double rs2_dval = static_cast<double>(rs2_fval);            \
+          double rs3_dval = static_cast<double>(rs3_fval);            \
+          GenAndRunTest<int32_t, int32_t>((int32_t)addend_arr,        \
+                                          (int32_t)right_mul_arr,     \
+                                          (int32_t)left_mul_arr, fn); \
+          for (uint32_t i = 0; i < 2; i++) {                          \
+            CHECK_DOUBLE_EQ((expect_res), addend_arr[i]);             \
+          }                                                           \
+        }                                                             \
+      }                                                               \
+    }                                                                 \
   }
 
 // Tests for vector single-width floating-point fused multiply-add Instructions
 // between vectors and scalar
-#define UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(instr_name, array, expect_res)     \
-  TEST(RISCV_UTEST_FLOAT_WIDENING_##instr_name) {                             \
-    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                        \
-    CcTest::InitializeVM();                                                   \
-    auto fn = [](MacroAssembler& assm) {                                      \
-      __ VU.set(t0, VSew::E32, Vlmul::m1);                                    \
-      __ vfmv_vf(v0, fa0);                                                    \
-      __ vfmv_vf(v2, fa2);                                                    \
-      __ instr_name(v0, fa1, v2);                                             \
-      __ VU.set(t0, VSew::E64, Vlmul::m1);                                    \
-      __ vfmv_fs(fa0, v0);                                                    \
-    };                                                                        \
-    for (float rs1_fval : array) {                                            \
-      for (float rs2_fval : array) {                                          \
-        for (float rs3_fval : array) {                                        \
-          double rs1_dval = base::bit_cast<double>(                           \
-              (uint64_t)base::bit_cast<uint32_t>(rs1_fval) << 32 |            \
-              base::bit_cast<uint32_t>(rs1_fval));                            \
-          double rs2_dval = static_cast<double>(rs2_fval);                    \
-          double rs3_dval = static_cast<double>(rs3_fval);                    \
-          double res =                                                        \
-              GenAndRunTest<double, float>(rs1_fval, rs2_fval, rs3_fval, fn); \
-          CHECK_DOUBLE_EQ((expect_res), res);                                 \
-        }                                                                     \
-      }                                                                       \
-    }                                                                         \
+#define UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(instr_name, float_array,    \
+                                           double_array, expect_res)   \
+  TEST(RISCV_UTEST_FLOAT_WIDENING_##instr_name) {                      \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                 \
+    CcTest::InitializeVM();                                            \
+    double addend_arr[2] = {0};                                        \
+    float right_mul_arr[4] = {0};                                      \
+    auto fn = [](MacroAssembler& assm) {                               \
+      __ VU.set(t0, VSew::E32, Vlmul::m1);                             \
+      __ vl(v0, a0, 0, VSew::E32);                                     \
+      __ flw(fa1, a1, 0);                                              \
+      __ vl(v2, a2, 0, VSew::E32);                                     \
+      __ instr_name(v0, fa1, v2);                                      \
+      __ VU.set(t0, VSew::E64, Vlmul::m1);                             \
+      __ vs(v0, a0, 0, VSew::E64);                                     \
+    };                                                                 \
+    for (double rs1_dval : double_array) {                             \
+      for (float rs2_fval : float_array) {                             \
+        for (float rs3_fval : float_array) {                           \
+          for (double& src : addend_arr) src = rs1_dval;               \
+          for (float& src : right_mul_arr) src = rs3_fval;             \
+          double rs2_dval = static_cast<double>(rs2_fval);             \
+          double rs3_dval = static_cast<double>(rs3_fval);             \
+          GenAndRunTest<int32_t, int32_t>((int32_t)addend_arr,         \
+                                          (int32_t)&rs2_fval,          \
+                                          (int32_t)right_mul_arr, fn); \
+          for (uint32_t i = 0; i < 2; i++) {                           \
+            CHECK_DOUBLE_EQ((expect_res), addend_arr[i]);              \
+          }                                                            \
+        }                                                              \
+      }                                                                \
+    }                                                                  \
   }
 
 #define ARRAY_FLOAT compiler::ValueHelper::GetVector<float>()
-UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(vfwmacc_vv, ARRAY_FLOAT,
+#define ARRAY_DOUBLE compiler::ValueHelper::GetVector<double>()
+UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(vfwmacc_vv, ARRAY_FLOAT, ARRAY_DOUBLE,
                                    std::fma(rs2_dval, rs3_dval, rs1_dval))
-UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(vfwmacc_vf, ARRAY_FLOAT,
+UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(vfwmacc_vf, ARRAY_FLOAT, ARRAY_DOUBLE,
                                    std::fma(rs2_dval, rs3_dval, rs1_dval))
-UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(vfwnmacc_vv, ARRAY_FLOAT,
+UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(vfwnmacc_vv, ARRAY_FLOAT, ARRAY_DOUBLE,
                                    std::fma(rs2_dval, -rs3_dval, -rs1_dval))
-UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(vfwnmacc_vf, ARRAY_FLOAT,
+UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(vfwnmacc_vf, ARRAY_FLOAT, ARRAY_DOUBLE,
                                    std::fma(rs2_dval, -rs3_dval, -rs1_dval))
-UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(vfwmsac_vv, ARRAY_FLOAT,
+UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(vfwmsac_vv, ARRAY_FLOAT, ARRAY_DOUBLE,
                                    std::fma(rs2_dval, rs3_dval, -rs1_dval))
-UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(vfwmsac_vf, ARRAY_FLOAT,
+UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(vfwmsac_vf, ARRAY_FLOAT, ARRAY_DOUBLE,
                                    std::fma(rs2_dval, rs3_dval, -rs1_dval))
-UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(vfwnmsac_vv, ARRAY_FLOAT,
+UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES(vfwnmsac_vv, ARRAY_FLOAT, ARRAY_DOUBLE,
                                    std::fma(rs2_dval, -rs3_dval, rs1_dval))
-UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(vfwnmsac_vf, ARRAY_FLOAT,
+UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES(vfwnmsac_vf, ARRAY_FLOAT, ARRAY_DOUBLE,
                                    std::fma(rs2_dval, -rs3_dval, rs1_dval))
 
+#undef ARRAY_DOUBLE
 #undef ARRAY_FLOAT
 #undef UTEST_RVV_VFW_FMA_VV_FORM_WITH_RES
 #undef UTEST_RVV_VFW_FMA_VF_FORM_WITH_RES
@@ -2348,13 +2498,15 @@ UTEST_RVV_FMA_VF_FORM_WITH_RES(vfnmsac_vf, ARRAY_FLOAT,
   TEST(RISCV_UTEST_FLOAT_WIDENING_##instr_name) {                      \
     if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                 \
     CcTest::InitializeVM();                                            \
-    auto fn = [](MacroAssembler& assm) {                               \
+    double result = 0;                                                 \
+    auto fn = [&result](MacroAssembler& assm) {                        \
       __ VU.set(t0, VSew::E32, Vlmul::m1);                             \
       __ vfmv_vf(v2, fa0);                                             \
       __ vfmv_vf(v4, fa0);                                             \
       __ instr_name(v0, v2, v4);                                       \
       __ VU.set(t0, VSew::E64, Vlmul::m1);                             \
-      __ vfmv_fs(fa0, v0);                                             \
+      __ li(a0, Operand(int32_t(&result)));                            \
+      __ vs(v0, a0, 0, VSew::E64);                                     \
     };                                                                 \
     for (float rs1_fval : compiler::ValueHelper::GetVector<float>()) { \
       std::vector<double> temp_arr(kRvvVLEN / 32,                      \
@@ -2363,19 +2515,23 @@ UTEST_RVV_FMA_VF_FORM_WITH_RES(vfnmsac_vf, ARRAY_FLOAT,
           (uint64_t)base::bit_cast<uint32_t>(rs1_fval) << 32 |         \
           base::bit_cast<uint32_t>(rs1_fval));                         \
       for (double val : temp_arr) {                                    \
+        if (is_invalid_fadd(expect_res, val)) {                        \
+          expect_res = std::numeric_limits<float>::quiet_NaN();        \
+          break;                                                       \
+        }                                                              \
         expect_res += val;                                             \
         if (std::isnan(expect_res)) {                                  \
           expect_res = std::numeric_limits<double>::quiet_NaN();       \
           break;                                                       \
         }                                                              \
       }                                                                \
-      double res = GenAndRunTest<double, float>(rs1_fval, fn);         \
-      CHECK_DOUBLE_EQ(UseCanonicalNan<double>(expect_res), res);       \
+      GenAndRunTest<double*, float>(rs1_fval, fn);                     \
+      CHECK_DOUBLE_EQ(UseCanonicalNan<double>(expect_res), result);    \
     }                                                                  \
   }
 
-UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES(vfwredusum_vv)
-UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES(vfwredosum_vv)
+UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES(vfwredusum_vs)
+UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES(vfwredosum_vs)
 
 #undef UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES
 // calculate the value of r used in rounding
@@ -2436,7 +2592,7 @@ static inline uint8_t get_round(int vxrm, uint64_t v, uint8_t shift) {
           ref = base::saturated_cast<sign##int16_t>(                         \
               (static_cast<sign##int32_t>(x) >> shift) +                     \
               get_round(vxrm, x, shift));                                    \
-        GenAndRunTest<int32_t, int64_t>((int64_t)t.src, (int64_t)t.dst, fn); \
+        GenAndRunTest<int32_t, int32_t>((int32_t)t.src, (int32_t)t.dst, fn); \
         CHECK(!memcmp(t.dst, t.ref, sizeof(t.ref)));                         \
       }                                                                      \
     }                                                                        \
@@ -2465,7 +2621,7 @@ UTEST_RVV_VNCLIP_E32M2_E16M1(vnclip_vi, )
         __ instr_name(v2, v1);                                              \
         __ vs(v2, a1, 0, VSew::E##width);                                   \
       };                                                                    \
-      GenAndRunTest<int64_t, int64_t>((int64_t)src, (int64_t)dst, fn);      \
+      GenAndRunTest<int32_t, int32_t>((int32_t)src, (int32_t)dst, fn);      \
       for (uint32_t i = 0; i < n; i++) {                                    \
         CHECK_EQ(expect_res, dst[i]);                                       \
       }                                                                     \
@@ -2502,74 +2658,323 @@ UTEST_RVV_VI_VIE_FORM_WITH_RES(vsext_vf2, int16_t, 16, 8, ARRAY(int8_t),
 
 #undef UTEST_RVV_VI_VIE_FORM_WITH_RES
 
+static constexpr double double_sNaN[] = {
+    std::numeric_limits<double>::signaling_NaN(),
+    -std::numeric_limits<double>::signaling_NaN()};
+static constexpr float float_sNaN[] = {
+    std::numeric_limits<float>::signaling_NaN(),
+    -std::numeric_limits<float>::signaling_NaN()};
+// Tests for vector Floating-Point merge instruction
+#define UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(number, type, int_type, width, \
+                                              array, expect_res)             \
+  TEST(RISCV_UTEST_vfmerge_vf_##type##_##number) {                           \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    CcTest::InitializeVM();                                                  \
+    for (type fval : array) {                                                \
+      int_type rs1_fval = base::bit_cast<int_type>(fval);                    \
+      for (uint32_t mask = 0; mask < (1 << n); mask++) {                     \
+        int_type src[n] = {0};                                               \
+        int_type dst[n] = {0};                                               \
+        dst[0] = rs1_fval;                                                   \
+        for (uint32_t i = 0; i < n; i++) src[i] = i;                         \
+        auto fn = [mask](MacroAssembler& assm) {                             \
+          __ VU.set(t0, VSew::E##width, Vlmul::m1);                          \
+          __ vl(v1, a0, 0, VSew::E##width);                                  \
+          __ vl(v24, a1, 0, VSew::E##width);                                 \
+          __ vmv_vi(v0, mask);                                               \
+          __ vfmv_fs(ft0, v24);                                              \
+          __ vfmerge_vf(v2, ft0, v1);                                        \
+          __ vs(v2, a1, 0, VSew::E##width);                                  \
+        };                                                                   \
+        GenAndRunTest<int32_t, int32_t>((int32_t)src, (int32_t)dst, fn);     \
+        for (uint32_t i = 0; i < n; i++) {                                   \
+          CHECK_EQ(expect_res, dst[i]);                                      \
+        }                                                                    \
+      }                                                                      \
+    }                                                                        \
+  }
+
+UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(
+    1, double, int64_t, 64, compiler::ValueHelper::GetVector<double>(),
+    ((mask >> i) & 0x1) ? rs1_fval : src[i])
+UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(2, float, int32_t, 32,
+                                      compiler::ValueHelper::GetVector<float>(),
+                                      ((mask >> i) & 0x1) ? rs1_fval : src[i])
+UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(3, double, int64_t, 64,
+                                      base::ArrayVector(double_sNaN),
+                                      ((mask >> i) & 0x1) ? rs1_fval : src[i])
+UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(4, float, int32_t, 32,
+                                      base::ArrayVector(float_sNaN),
+                                      ((mask >> i) & 0x1) ? rs1_fval : src[i])
+#undef UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES
+
 // Tests for vector permutation instructions vector slide instructions
-#define UTEST_RVV_VP_VS_VI_FORM_WITH_RES(instr_name, type, width, array, \
-                                         expect_res)                     \
-  TEST(RISCV_UTEST_##instr_name##_##type) {                              \
-    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                   \
-    constexpr uint32_t n = kRvvVLEN / width;                             \
-    CcTest::InitializeVM();                                              \
-    for (type x : array) {                                               \
-      for (uint32_t offset = 0; offset < n; offset++) {                  \
-        type src[n] = {0};                                               \
-        type dst[n] = {0};                                               \
-        for (uint32_t i = 0; i < n; i++) src[i] = x + i;                 \
-        auto fn = [offset](MacroAssembler& assm) {                       \
-          __ VU.set(t0, VSew::E##width, Vlmul::m1);                      \
-          __ vl(v1, a0, 0, VSew::E##width);                              \
-          __ instr_name(v2, v1, offset);                                 \
-          __ vs(v2, a1, 0, VSew::E##width);                              \
-        };                                                               \
-        GenAndRunTest<int64_t, int64_t>((int64_t)src, (int64_t)dst, fn); \
-        for (uint32_t i = 0; i < n; i++) {                               \
-          CHECK_EQ(expect_res, dst[i]);                                  \
-        }                                                                \
-      }                                                                  \
-    }                                                                    \
-  }
-
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, int64_t, 64, ARRAY(int64_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, int32_t, 32, ARRAY(int32_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, int16_t, 16, ARRAY(int16_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, int8_t, 8, ARRAY(int8_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, uint32_t, 32, ARRAY(uint32_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, uint16_t, 16, ARRAY(uint16_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, uint8_t, 8, ARRAY(uint8_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, int64_t, 64, ARRAY(int64_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, int32_t, 32, ARRAY(int32_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, int16_t, 16, ARRAY(int16_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, int8_t, 8, ARRAY(int8_t),
-                                 i < offset ? dst[i] : src[i - offset])
-
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, uint32_t, 32, ARRAY(uint32_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, uint16_t, 16, ARRAY(uint16_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, uint8_t, 8, ARRAY(uint8_t),
-                                 i < offset ? dst[i] : src[i - offset])
-
-#undef UTEST_RVV_VP_VS_VI_FORM_WITH_RES
+#define UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(instr_name, type, width, array, \
+                                             expect_res)                     \
+  TEST(RISCV_UTEST_##instr_name##_##type) {                                  \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    CcTest::InitializeVM();                                                  \
+    for (type x : array) {                                                   \
+      for (uint32_t offset = 0; offset <= n; offset++) {                     \
+        type src[n] = {0};                                                   \
+        type dst[n] = {0};                                                   \
+        for (uint32_t i = 0; i < n; i++) src[i] = x + i;                     \
+        auto fn = [offset](MacroAssembler& assm) {                           \
+          __ VU.set(t0, VSew::E##width, Vlmul::m1);                          \
+          __ vl(v1, a0, 0, VSew::E##width);                                  \
+          __ instr_name(v2, v1, offset);                                     \
+          __ vs(v2, a1, 0, VSew::E##width);                                  \
+        };                                                                   \
+        GenAndRunTest<int32_t, int32_t>((int32_t)src, (int32_t)dst, fn);     \
+        for (uint32_t i = 0; i < n; i++) {                                   \
+          CHECK_EQ(expect_res, dst[i]);                                      \
+        }                                                                    \
+      }                                                                      \
+    }                                                                        \
+  }
+
+// Test for vslidedown_vi
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, int64_t, 64, ARRAY(int64_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, int32_t, 32, ARRAY(int32_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, int16_t, 16, ARRAY(int16_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, int8_t, 8, ARRAY(int8_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, uint32_t, 32,
+                                     ARRAY(uint32_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, uint16_t, 16,
+                                     ARRAY(uint16_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, uint8_t, 8, ARRAY(uint8_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+
+// Test for vslideup_vi
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, int64_t, 64, ARRAY(int64_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, int32_t, 32, ARRAY(int32_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, int16_t, 16, ARRAY(int16_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, int8_t, 8, ARRAY(int8_t),
+                                     i < offset ? dst[i] : src[i - offset])
+
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, uint32_t, 32, ARRAY(uint32_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, uint16_t, 16, ARRAY(uint16_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, uint8_t, 8, ARRAY(uint8_t),
+                                     i < offset ? dst[i] : src[i - offset])
+#undef UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES
+
+#define UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(instr_name, type, width, array, \
+                                             expect_res)                     \
+  TEST(RISCV_UTEST_##instr_name##_##type) {                                  \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    CcTest::InitializeVM();                                                  \
+    for (type x : array) {                                                   \
+      for (uint32_t offset = 0; offset <= n; offset++) {                     \
+        type src[n] = {0};                                                   \
+        type dst[n] = {0};                                                   \
+        for (uint32_t i = 0; i < n; i++) src[i] = x + i;                     \
+        auto fn = [](MacroAssembler& assm) {                                 \
+          __ VU.set(t0, VSew::E##width, Vlmul::m1);                          \
+          __ vl(v1, a0, 0, VSew::E##width);                                  \
+          __ instr_name(v2, v1, a2);                                         \
+          __ vs(v2, a1, 0, VSew::E##width);                                  \
+        };                                                                   \
+        type rs2_val = (type)offset;                                         \
+        GenAndRunTest<int32_t, int32_t>((int32_t)src, (int32_t)dst, rs2_val, \
+                                        fn);                                 \
+        for (uint32_t i = 0; i < n; i++) {                                   \
+          CHECK_EQ(expect_res, dst[i]);                                      \
+        }                                                                    \
+      }                                                                      \
+    }                                                                        \
+  }
+
+// Test for vslidedown_vx
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, int64_t, 64, ARRAY(int64_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, int32_t, 32, ARRAY(int32_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, int16_t, 16, ARRAY(int16_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, int8_t, 8, ARRAY(int8_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, uint32_t, 32,
+                                     ARRAY(uint32_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, uint16_t, 16,
+                                     ARRAY(uint16_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, uint8_t, 8, ARRAY(uint8_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+
+// Test for vslideup_vx
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, int64_t, 64, ARRAY(int64_t),
+                                     (int64_t)i < rs2_val ? dst[i]
+                                                          : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, int32_t, 32, ARRAY(int32_t),
+                                     (int32_t)i < rs2_val ? dst[i]
+                                                          : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, int16_t, 16, ARRAY(int16_t),
+                                     (int16_t)i < rs2_val ? dst[i]
+                                                          : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, int8_t, 8, ARRAY(int8_t),
+                                     (int8_t)i < rs2_val ? dst[i]
+                                                         : src[i - rs2_val])
+
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, uint32_t, 32, ARRAY(uint32_t),
+                                     (uint32_t)i < rs2_val ? dst[i]
+                                                           : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, uint16_t, 16, ARRAY(uint16_t),
+                                     (uint16_t)i < rs2_val ? dst[i]
+                                                           : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, uint8_t, 8, ARRAY(uint8_t),
+                                     (uint8_t)i < rs2_val ? dst[i]
+                                                          : src[i - rs2_val])
+#undef UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES
+
+#define UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(instr_name, type, width, array, \
+                                              expect_res)                     \
+  TEST(RISCV_UTEST_##instr_name##_##type) {                                   \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                        \
+    constexpr uint32_t n = kRvvVLEN / width;                                  \
+    CcTest::InitializeVM();                                                   \
+    for (type x : array) {                                                    \
+      type src[n] = {0};                                                      \
+      type dst[n] = {0};                                                      \
+      for (uint32_t i = 0; i < n; i++) src[i] = x + i;                        \
+      auto fn = [](MacroAssembler& assm) {                                    \
+        __ VU.set(t0, VSew::E##width, Vlmul::m1);                             \
+        __ vl(v1, a0, 0, VSew::E##width);                                     \
+        __ instr_name(v2, v1, a2);                                            \
+        __ vs(v2, a1, 0, VSew::E##width);                                     \
+      };                                                                      \
+      type rs2_val = x + x;                                                   \
+      GenAndRunTest<int32_t, int32_t>((int32_t)src, (int32_t)dst, rs2_val,    \
+                                      fn);                                    \
+      for (uint32_t i = 0; i < n; i++) {                                      \
+        CHECK_EQ(expect_res, dst[i]);                                         \
+      }                                                                       \
+    }                                                                         \
+  }
+
+// Test for vslide1down_vx
+// UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, int64_t, 64,
+//                                       ARRAY(int64_t),
+//                                       (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, int32_t, 32,
+                                      ARRAY(int32_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, int16_t, 16,
+                                      ARRAY(int16_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, int8_t, 8, ARRAY(int8_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, uint32_t, 32,
+                                      ARRAY(uint32_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, uint16_t, 16,
+                                      ARRAY(uint16_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, uint8_t, 8,
+                                      ARRAY(uint8_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+
+// Test for vslide1up_vx
+// UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, int64_t, 64,
+// ARRAY(int64_t),
+//                                       (int64_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, int32_t, 32, ARRAY(int32_t),
+                                      (int32_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, int16_t, 16, ARRAY(int16_t),
+                                      (int16_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, int8_t, 8, ARRAY(int8_t),
+                                      (int8_t)i < 1 ? rs2_val : src[i - 1])
+
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, uint32_t, 32,
+                                      ARRAY(uint32_t),
+                                      (uint32_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, uint16_t, 16,
+                                      ARRAY(uint16_t),
+                                      (uint16_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, uint8_t, 8, ARRAY(uint8_t),
+                                      (uint8_t)i < 1 ? rs2_val : src[i - 1])
+#undef UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES
+
+#define UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(instr_name, type, width, fval, \
+                                              array, expect_res)             \
+  TEST(RISCV_UTEST_##instr_name##_##width##_##fval) {                        \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    CcTest::InitializeVM();                                                  \
+    for (type x : array) {                                                   \
+      type src[n] = {0};                                                     \
+      type dst[n] = {0};                                                     \
+      src[0] = base::bit_cast<type>(fval);                                   \
+      for (uint32_t i = 1; i < n; i++) src[i] = x + i;                       \
+      auto fn = [](MacroAssembler& assm) {                                   \
+        __ VU.set(t0, VSew::E##width, Vlmul::m1);                            \
+        __ vl(v1, a0, 0, VSew::E##width);                                    \
+        width == 32 ? __ flw(fa0, a0, 0) : __ fld(fa0, a0, 0);               \
+        __ instr_name(v2, v1, fa0);                                          \
+        __ vs(v2, a1, 0, VSew::E##width);                                    \
+      };                                                                     \
+      GenAndRunTest<int32_t, int32_t>((int32_t)src, (int32_t)dst, fn);       \
+      for (uint32_t i = 0; i < n; i++) {                                     \
+        CHECK_EQ(expect_res, dst[i]);                                        \
+      }                                                                      \
+    }                                                                        \
+  }
+
+// Test for vfslide1down_vf
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1down_vf, int64_t, 64,
+                                      0x40934A3D70A3D70A, ARRAY(int64_t),
+                                      (i + 1) < n ? src[i + 1] : src[0])
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1down_vf, int32_t, 32, 0x449A51EC,
+                                      ARRAY(int32_t),
+                                      (i + 1) < n ? src[i + 1] : src[0])
+// Test for vfslide1down_vf_signaling_NaN
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1down_vf, int64_t, 64,
+                                      0x7FF4000000000000, ARRAY(int64_t),
+                                      (i + 1) < n ? src[i + 1] : src[0])
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1down_vf, int32_t, 32, 0x7F400000,
+                                      ARRAY(int32_t),
+                                      (i + 1) < n ? src[i + 1] : src[0])
+// Test for vfslide1up_vf
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1up_vf, int64_t, 64,
+                                      0x40934A3D70A3D70A, ARRAY(int64_t),
+                                      (int64_t)i < 1 ? src[0] : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1up_vf, int32_t, 32, 0x449A51EC,
+                                      ARRAY(int32_t),
+                                      (int32_t)i < 1 ? src[0] : src[i - 1])
+// Test for vfslide1up_vf_signaling_NaN
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1up_vf, int64_t, 64,
+                                      0x7FF4000000000000, ARRAY(int64_t),
+                                      (int64_t)i < 1 ? src[0] : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1up_vf, int32_t, 32, 0x7F400000,
+                                      ARRAY(int32_t),
+                                      (int32_t)i < 1 ? src[0] : src[i - 1])
+#undef UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES
 #undef ARRAY
 
 #define UTEST_VFIRST_M_WITH_WIDTH(width)                            \
   TEST(RISCV_UTEST_vfirst_m_##width) {                              \
     if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;              \
-    constexpr uint32_t vlen = 128;                                  \
-    constexpr uint32_t n = vlen / width;                            \
+    constexpr int32_t vlen = 128;                                   \
+    constexpr int32_t n = vlen / width;                             \
     CcTest::InitializeVM();                                         \
-    for (uint32_t i = 0; i <= n; i++) {                             \
+    for (int32_t i = 0; i <= n; i++) {                              \
       uint64_t src[2] = {0};                                        \
       src[0] = 1 << i;                                              \
       auto fn = [](MacroAssembler& assm) {                          \
@@ -2577,8 +2982,8 @@ UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, uint8_t, 8, ARRAY(uint8_t),
         __ vl(v2, a0, 0, VSew::E##width);                           \
         __ vfirst_m(a0, v2);                                        \
       };                                                            \
-      auto res = GenAndRunTest<int64_t, int64_t>((int64_t)src, fn); \
-      CHECK_EQ(i < n ? i : (int64_t)-1, res);                       \
+      auto res = GenAndRunTest<int32_t, int32_t>((int32_t)src, fn); \
+      CHECK_EQ(i < n ? i : (int32_t)-1, res);                       \
     }                                                               \
   }
 
@@ -2603,8 +3008,8 @@ UTEST_VFIRST_M_WITH_WIDTH(8)
         __ vl(v2, a0, 0, VSew::E##width);                             \
         __ vcpop_m(a0, v2);                                           \
       };                                                              \
-      auto res = GenAndRunTest<int64_t, int64_t>((int64_t)src, fn);   \
-      CHECK_EQ(std::__popcount(src[0]), res);                         \
+      auto res = GenAndRunTest<int32_t, int32_t>((int32_t)src, fn);   \
+      CHECK_EQ(__builtin_popcountl(src[0]), res);                     \
     }                                                                 \
   }
 
@@ -2613,6 +3018,32 @@ UTEST_VCPOP_M_WITH_WIDTH(32)
 UTEST_VCPOP_M_WITH_WIDTH(16)
 UTEST_VCPOP_M_WITH_WIDTH(8)
 
+TEST(RISCV_UTEST_WasmRvvS128const) {
+  if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;
+  CcTest::InitializeVM();
+  for (uint64_t x : compiler::ValueHelper::GetVector<int64_t>()) {
+    for (uint64_t y : compiler::ValueHelper::GetVector<int64_t>()) {
+      uint64_t src[2] = {x, y};
+      uint8_t vals[16];
+      volatile uint32_t result[kRvvVLEN / 32] = {0};
+      memcpy(vals, src, sizeof(vals));
+      auto fn = [vals, &result](MacroAssembler& assm) {
+        __ Push(kScratchReg);
+        __ WasmRvvS128const(v10, vals);
+        __ li(t1, Operand(int32_t(result)));
+        __ VU.set(t0, VSew::E32, Vlmul::m1);
+        __ vs(v10, t1, 0, VSew::E32);
+        __ Pop(kScratchReg);
+      };
+      GenAndRunTest(fn);
+      volatile uint64_t* result_addr =
+          reinterpret_cast<volatile uint64_t*>(&result[0]);
+      CHECK_EQ((uint64_t)*result_addr, x);
+      CHECK_EQ((uint64_t) * (result_addr + 1), y);
+    }
+  }
+}
+
 #undef UTEST_VCPOP_M_WITH_WIDTH
 #endif  // CAN_USE_RVV_INSTRUCTIONS
 #undef __
diff --git a/deps/v8/test/cctest/test-assembler-riscv64.cc b/deps/v8/test/cctest/test-assembler-riscv64.cc
index c5a937d0e64624..c05b01f3cce560 100644
--- a/deps/v8/test/cctest/test-assembler-riscv64.cc
+++ b/deps/v8/test/cctest/test-assembler-riscv64.cc
@@ -1214,7 +1214,7 @@ TEST(NAN_BOX) {
     CHECK_EQ((uint64_t)base::bit_cast<uint32_t>(1234.56f), res);
   }
 
-  // Test NaN boxing in FMV.S
+  // Test signaling NaN in FMV.S
   {
     auto fn = [](MacroAssembler& assm) {
       __ fmv_w_x(fa0, a0);
@@ -1225,7 +1225,7 @@ TEST(NAN_BOX) {
     CHECK_EQ((uint32_t)base::bit_cast<uint32_t>(0x7f400000), res);
   }
 
-  // Test NaN boxing in FMV.D
+  // Test signaling NaN in FMV.D
   {
     auto fn = [](MacroAssembler& assm) {
       __ fmv_d_x(fa0, a0);
@@ -2006,7 +2006,7 @@ TEST(jump_tables3) {
         Object(reinterpret_cast<Address>(f.Call(i, 0, 0, 0, 0))), isolate);
 #ifdef OBJECT_PRINT
     ::printf("f(%d) = ", i);
-    result->Print(std::cout);
+    Print(*result, std::cout);
     ::printf("\n");
 #endif
     CHECK(values[i].is_identical_to(result));
@@ -2073,6 +2073,136 @@ TEST(RVV_VFMV) {
   }
 }
 
+TEST(RVV_VFMV_signaling_NaN) {
+  if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;
+  CcTest::InitializeVM();
+
+  {
+    constexpr uint32_t n = 2;
+    int64_t rs1_fval = 0x7FF4000000000000;
+    int64_t dst[n] = {0};
+    auto fn = [](MacroAssembler& assm) {
+      __ VU.set(t0, VSew::E64, Vlmul::m1);
+      __ fmv_d_x(ft0, a0);
+      __ vfmv_vf(v1, ft0);
+      __ vs(v1, a1, 0, VSew::E64);
+    };
+    GenAndRunTest<int64_t, int64_t>((int64_t)rs1_fval, (int64_t)dst, fn);
+    for (uint32_t i = 0; i < n; i++) {
+      CHECK_EQ(rs1_fval, dst[i]);
+    }
+  }
+
+  {
+    constexpr uint32_t n = 4;
+    int32_t rs1_fval = 0x7F400000;
+    int32_t dst[n] = {0};
+    auto fn = [](MacroAssembler& assm) {
+      __ VU.set(t0, VSew::E32, Vlmul::m1);
+      __ fmv_w_x(ft0, a0);
+      __ vfmv_vf(v1, ft0);
+      __ vs(v1, a1, 0, VSew::E32);
+    };
+    GenAndRunTest<int64_t, int64_t>((int64_t)rs1_fval, (int64_t)dst, fn);
+    for (uint32_t i = 0; i < n; i++) {
+      CHECK_EQ(rs1_fval, dst[i]);
+    }
+  }
+}
+
+TEST(RVV_VFNEG_signaling_NaN) {
+  if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;
+  CcTest::InitializeVM();
+
+  {
+    constexpr uint32_t n = 2;
+    int64_t rs1_fval = 0x7FF4000000000000;
+    int64_t expected_fval = 0xFFF4000000000000;
+    int64_t dst[n] = {0};
+    auto fn = [](MacroAssembler& assm) {
+      __ VU.set(t0, VSew::E64, Vlmul::m1);
+      __ fmv_d_x(ft0, a0);
+      __ vfmv_vf(v1, ft0);
+      __ vfneg_vv(v2, v1);
+      __ vs(v2, a1, 0, VSew::E64);
+    };
+    GenAndRunTest<int64_t, int64_t>((int64_t)rs1_fval, (int64_t)dst, fn);
+    for (uint32_t i = 0; i < n; i++) {
+      CHECK_EQ(expected_fval, dst[i]);
+    }
+  }
+
+  {
+    constexpr uint32_t n = 4;
+    int32_t rs1_fval = 0x7F400000;
+    int32_t expected_fval = 0xFF400000;
+    int32_t dst[n] = {0};
+    auto fn = [](MacroAssembler& assm) {
+      __ VU.set(t0, VSew::E32, Vlmul::m1);
+      __ fmv_w_x(ft0, a0);
+      __ vfmv_vf(v1, ft0);
+      __ vfneg_vv(v2, v1);
+      __ vs(v2, a1, 0, VSew::E32);
+    };
+    GenAndRunTest<int64_t, int64_t>((int64_t)rs1_fval, (int64_t)dst, fn);
+    for (uint32_t i = 0; i < n; i++) {
+      CHECK_EQ(expected_fval, dst[i]);
+    }
+  }
+}
+
+// Tests for Floating-Point scalar move instructions between vector and scalar f
+// register
+#define UTEST_RVV_VF_MV_FORM_WITH_RES(instr_name, reg1, reg2, width, type)   \
+  TEST(RISCV_UTEST_##instr_name##_##width) {                                 \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    CcTest::InitializeVM();                                                  \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    for (type fval : compiler::ValueHelper::GetVector<type>()) {             \
+      int##width##_t rs1_fval = base::bit_cast<int##width##_t>(fval);        \
+      int##width##_t res[n] = {0};                                           \
+      for (uint32_t i = 0; i < n; i++) res[i] = (rs1_fval + i + 1);          \
+      auto fn = [](MacroAssembler& assm) {                                   \
+        __ VU.set(t0, VSew::E##width, Vlmul::m1);                            \
+        width == 32 ? __ flw(ft0, a0, 0) : __ fld(ft0, a0, 0);               \
+        __ vl(v1, a1, 0, VSew::E##width);                                    \
+        __ instr_name(reg1, reg2);                                           \
+        __ fsd(ft0, a0, 0);                                                  \
+        __ vs(v1, a1, 0, VSew::E##width);                                    \
+      };                                                                     \
+      GenAndRunTest<int64_t, int64_t>((int64_t)&rs1_fval, (int64_t)res, fn); \
+      for (uint32_t i = 0; i < n; i++) {                                     \
+        CHECK_EQ(i == 0 ? rs1_fval : res[i], res[i]);                        \
+      }                                                                      \
+    }                                                                        \
+  }                                                                          \
+  TEST(RISCV_UTEST_##instr_name##_##width##_##sNaN) {                        \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    CcTest::InitializeVM();                                                  \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    int##width##_t rs1_fval = width == 32 ? 0x7F400000 : 0x7FF4000000000000; \
+    int##width##_t res[n] = {0};                                             \
+    for (uint32_t i = 0; i < n; i++) res[i] = (rs1_fval + i + 1);            \
+    auto fn = [](MacroAssembler& assm) {                                     \
+      __ VU.set(t0, VSew::E##width, Vlmul::m1);                              \
+      width == 32 ? __ flw(ft0, a0, 0) : __ fld(ft0, a0, 0);                 \
+      __ vl(v1, a1, 0, VSew::E##width);                                      \
+      __ instr_name(reg1, reg2);                                             \
+      __ fsd(ft0, a0, 0);                                                    \
+      __ vs(v1, a1, 0, VSew::E##width);                                      \
+    };                                                                       \
+    GenAndRunTest<int64_t, int64_t>((int64_t)&rs1_fval, (int64_t)res, fn);   \
+    for (uint32_t i = 0; i < n; i++) {                                       \
+      CHECK_EQ(i == 0 ? rs1_fval : res[i], res[i]);                          \
+    }                                                                        \
+  }
+
+UTEST_RVV_VF_MV_FORM_WITH_RES(vfmv_fs, ft0, v1, 32, float)
+UTEST_RVV_VF_MV_FORM_WITH_RES(vfmv_fs, ft0, v1, 64, double)
+UTEST_RVV_VF_MV_FORM_WITH_RES(vfmv_sf, v1, ft0, 32, float)
+UTEST_RVV_VF_MV_FORM_WITH_RES(vfmv_sf, v1, ft0, 64, double)
+#undef UTEST_RVV_VF_MV_FORM_WITH_RES
+
 inline int32_t ToImm5(int32_t v) {
   int32_t smax = (int32_t)(INT64_MAX >> (64 - 5));
   int32_t smin = (int32_t)(INT64_MIN >> (64 - 5));
@@ -2641,6 +2771,10 @@ UTEST_RVV_FMA_VF_FORM_WITH_RES(vfnmsac_vf, ARRAY_FLOAT,
           (uint64_t)base::bit_cast<uint32_t>(rs1_fval) << 32 |         \
           base::bit_cast<uint32_t>(rs1_fval));                         \
       for (double val : temp_arr) {                                    \
+        if (is_invalid_fadd(expect_res, val)) {                        \
+          expect_res = std::numeric_limits<float>::quiet_NaN();        \
+          break;                                                       \
+        }                                                              \
         expect_res += val;                                             \
         if (std::isnan(expect_res)) {                                  \
           expect_res = std::numeric_limits<double>::quiet_NaN();       \
@@ -2652,8 +2786,8 @@ UTEST_RVV_FMA_VF_FORM_WITH_RES(vfnmsac_vf, ARRAY_FLOAT,
     }                                                                  \
   }
 
-UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES(vfwredusum_vv)
-UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES(vfwredosum_vv)
+UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES(vfwredusum_vs)
+UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES(vfwredosum_vs)
 
 #undef UTEST_RVV_VFW_REDSUM_VV_FORM_WITH_RES
 // calculate the value of r used in rounding
@@ -2780,65 +2914,315 @@ UTEST_RVV_VI_VIE_FORM_WITH_RES(vsext_vf2, int16_t, 16, 8, ARRAY(int8_t),
 
 #undef UTEST_RVV_VI_VIE_FORM_WITH_RES
 
+static constexpr double double_sNaN[] = {
+    std::numeric_limits<double>::signaling_NaN(),
+    -std::numeric_limits<double>::signaling_NaN()};
+static constexpr float float_sNaN[] = {
+    std::numeric_limits<float>::signaling_NaN(),
+    -std::numeric_limits<float>::signaling_NaN()};
+// Tests for vector Floating-Point merge instruction
+#define UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(                                 \
+    number /*prevent redefinition*/, type, int_type, width, array, expect_res) \
+  TEST(RISCV_UTEST_vfmerge_vf_##type##_##number) {                             \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                         \
+    constexpr uint32_t n = kRvvVLEN / width;                                   \
+    CcTest::InitializeVM();                                                    \
+    for (type fval : array) {                                                  \
+      int_type rs1_fval = base::bit_cast<int_type>(fval);                      \
+      for (uint32_t mask = 0; mask < (1 << n); mask++) {                       \
+        int_type src[n] = {0};                                                 \
+        int_type dst[n] = {0};                                                 \
+        dst[0] = rs1_fval;                                                     \
+        for (uint32_t i = 0; i < n; i++) src[i] = i;                           \
+        auto fn = [mask](MacroAssembler& assm) {                               \
+          __ VU.set(t0, VSew::E##width, Vlmul::m1);                            \
+          __ vl(v1, a0, 0, VSew::E##width);                                    \
+          __ vl(v24, a1, 0, VSew::E##width);                                   \
+          __ vmv_vi(v0, mask);                                                 \
+          __ vfmv_fs(ft0, v24);                                                \
+          __ vfmerge_vf(v2, ft0, v1);                                          \
+          __ vs(v2, a1, 0, VSew::E##width);                                    \
+        };                                                                     \
+        GenAndRunTest<int64_t, int64_t>((int64_t)src, (int64_t)dst, fn);       \
+        for (uint32_t i = 0; i < n; i++) {                                     \
+          CHECK_EQ(expect_res, dst[i]);                                        \
+        }                                                                      \
+      }                                                                        \
+    }                                                                          \
+  }
+
+UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(
+    1, double, int64_t, 64, compiler::ValueHelper::GetVector<double>(),
+    ((mask >> i) & 0x1) ? rs1_fval : src[i])
+UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(2, float, int32_t, 32,
+                                      compiler::ValueHelper::GetVector<float>(),
+                                      ((mask >> i) & 0x1) ? rs1_fval : src[i])
+UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(3, double, int64_t, 64,
+                                      base::ArrayVector(double_sNaN),
+                                      ((mask >> i) & 0x1) ? rs1_fval : src[i])
+UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES(4, float, int32_t, 32,
+                                      base::ArrayVector(float_sNaN),
+                                      ((mask >> i) & 0x1) ? rs1_fval : src[i])
+#undef UTEST_RVV_VF_VFMERGE_VF_FORM_WITH_RES
+
 // Tests for vector permutation instructions vector slide instructions
-#define UTEST_RVV_VP_VS_VI_FORM_WITH_RES(instr_name, type, width, array, \
-                                         expect_res)                     \
-  TEST(RISCV_UTEST_##instr_name##_##type) {                              \
-    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                   \
-    constexpr uint32_t n = kRvvVLEN / width;                             \
-    CcTest::InitializeVM();                                              \
-    for (type x : array) {                                               \
-      for (uint32_t offset = 0; offset < n; offset++) {                  \
-        type src[n] = {0};                                               \
-        type dst[n] = {0};                                               \
-        for (uint32_t i = 0; i < n; i++) src[i] = x + i;                 \
-        auto fn = [offset](MacroAssembler& assm) {                       \
-          __ VU.set(t0, VSew::E##width, Vlmul::m1);                      \
-          __ vl(v1, a0, 0, VSew::E##width);                              \
-          __ instr_name(v2, v1, offset);                                 \
-          __ vs(v2, a1, 0, VSew::E##width);                              \
-        };                                                               \
-        GenAndRunTest<int64_t, int64_t>((int64_t)src, (int64_t)dst, fn); \
-        for (uint32_t i = 0; i < n; i++) {                               \
-          CHECK_EQ(expect_res, dst[i]);                                  \
-        }                                                                \
-      }                                                                  \
-    }                                                                    \
-  }
-
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, int64_t, 64, ARRAY(int64_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, int32_t, 32, ARRAY(int32_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, int16_t, 16, ARRAY(int16_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, int8_t, 8, ARRAY(int8_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, uint32_t, 32, ARRAY(uint32_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, uint16_t, 16, ARRAY(uint16_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslidedown_vi, uint8_t, 8, ARRAY(uint8_t),
-                                 (i + offset) < n ? src[i + offset] : 0)
-
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, int64_t, 64, ARRAY(int64_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, int32_t, 32, ARRAY(int32_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, int16_t, 16, ARRAY(int16_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, int8_t, 8, ARRAY(int8_t),
-                                 i < offset ? dst[i] : src[i - offset])
-
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, uint32_t, 32, ARRAY(uint32_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, uint16_t, 16, ARRAY(uint16_t),
-                                 i < offset ? dst[i] : src[i - offset])
-UTEST_RVV_VP_VS_VI_FORM_WITH_RES(vslideup_vi, uint8_t, 8, ARRAY(uint8_t),
-                                 i < offset ? dst[i] : src[i - offset])
-
-#undef UTEST_RVV_VP_VS_VI_FORM_WITH_RES
+#define UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(instr_name, type, width, array, \
+                                             expect_res)                     \
+  TEST(RISCV_UTEST_##instr_name##_##type) {                                  \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    CcTest::InitializeVM();                                                  \
+    for (type x : array) {                                                   \
+      for (uint32_t offset = 0; offset <= n; offset++) {                     \
+        type src[n] = {0};                                                   \
+        type dst[n] = {0};                                                   \
+        for (uint32_t i = 0; i < n; i++) src[i] = x + i;                     \
+        auto fn = [offset](MacroAssembler& assm) {                           \
+          __ VU.set(t0, VSew::E##width, Vlmul::m1);                          \
+          __ vl(v1, a0, 0, VSew::E##width);                                  \
+          __ instr_name(v2, v1, offset);                                     \
+          __ vs(v2, a1, 0, VSew::E##width);                                  \
+        };                                                                   \
+        GenAndRunTest<int64_t, int64_t>((int64_t)src, (int64_t)dst, fn);     \
+        for (uint32_t i = 0; i < n; i++) {                                   \
+          CHECK_EQ(expect_res, dst[i]);                                      \
+        }                                                                    \
+      }                                                                      \
+    }                                                                        \
+  }
+
+// Test for vslidedown_vi
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, int64_t, 64, ARRAY(int64_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, int32_t, 32, ARRAY(int32_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, int16_t, 16, ARRAY(int16_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, int8_t, 8, ARRAY(int8_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, uint32_t, 32,
+                                     ARRAY(uint32_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, uint16_t, 16,
+                                     ARRAY(uint16_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslidedown_vi, uint8_t, 8, ARRAY(uint8_t),
+                                     (i + offset) < n ? src[i + offset] : 0)
+
+// Test for vslideup_vi
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, int64_t, 64, ARRAY(int64_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, int32_t, 32, ARRAY(int32_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, int16_t, 16, ARRAY(int16_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, int8_t, 8, ARRAY(int8_t),
+                                     i < offset ? dst[i] : src[i - offset])
+
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, uint32_t, 32, ARRAY(uint32_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, uint16_t, 16, ARRAY(uint16_t),
+                                     i < offset ? dst[i] : src[i - offset])
+UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES(vslideup_vi, uint8_t, 8, ARRAY(uint8_t),
+                                     i < offset ? dst[i] : src[i - offset])
+#undef UTEST_RVV_VP_VSLIDE_VI_FORM_WITH_RES
+
+#define UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(instr_name, type, width, array, \
+                                             expect_res)                     \
+  TEST(RISCV_UTEST_##instr_name##_##type) {                                  \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    CcTest::InitializeVM();                                                  \
+    for (type x : array) {                                                   \
+      for (uint32_t offset = 0; offset <= n; offset++) {                     \
+        type src[n] = {0};                                                   \
+        type dst[n] = {0};                                                   \
+        for (uint32_t i = 0; i < n; i++) src[i] = x + i;                     \
+        auto fn = [](MacroAssembler& assm) {                                 \
+          __ VU.set(t0, VSew::E##width, Vlmul::m1);                          \
+          __ vl(v1, a0, 0, VSew::E##width);                                  \
+          __ instr_name(v2, v1, a2);                                         \
+          __ vs(v2, a1, 0, VSew::E##width);                                  \
+        };                                                                   \
+        type rs2_val = (type)offset;                                         \
+        GenAndRunTest<int64_t, int64_t>((int64_t)src, (int64_t)dst, rs2_val, \
+                                        fn);                                 \
+        for (uint32_t i = 0; i < n; i++) {                                   \
+          CHECK_EQ(expect_res, dst[i]);                                      \
+        }                                                                    \
+      }                                                                      \
+    }                                                                        \
+  }
+
+// Test for vslidedown_vx
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, int64_t, 64, ARRAY(int64_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, int32_t, 32, ARRAY(int32_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, int16_t, 16, ARRAY(int16_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, int8_t, 8, ARRAY(int8_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, uint32_t, 32,
+                                     ARRAY(uint32_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, uint16_t, 16,
+                                     ARRAY(uint16_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslidedown_vx, uint8_t, 8, ARRAY(uint8_t),
+                                     (i + rs2_val) < n ? src[i + rs2_val] : 0)
+
+// Test for vslideup_vx
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, int64_t, 64, ARRAY(int64_t),
+                                     (int64_t)i < rs2_val ? dst[i]
+                                                          : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, int32_t, 32, ARRAY(int32_t),
+                                     (int32_t)i < rs2_val ? dst[i]
+                                                          : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, int16_t, 16, ARRAY(int16_t),
+                                     (int16_t)i < rs2_val ? dst[i]
+                                                          : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, int8_t, 8, ARRAY(int8_t),
+                                     (int8_t)i < rs2_val ? dst[i]
+                                                         : src[i - rs2_val])
+
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, uint32_t, 32, ARRAY(uint32_t),
+                                     (uint32_t)i < rs2_val ? dst[i]
+                                                           : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, uint16_t, 16, ARRAY(uint16_t),
+                                     (uint16_t)i < rs2_val ? dst[i]
+                                                           : src[i - rs2_val])
+UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES(vslideup_vx, uint8_t, 8, ARRAY(uint8_t),
+                                     (uint8_t)i < rs2_val ? dst[i]
+                                                          : src[i - rs2_val])
+#undef UTEST_RVV_VP_VSLIDE_VX_FORM_WITH_RES
+
+#define UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(instr_name, type, width, array, \
+                                              expect_res)                     \
+  TEST(RISCV_UTEST_##instr_name##_##type) {                                   \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                        \
+    constexpr uint32_t n = kRvvVLEN / width;                                  \
+    CcTest::InitializeVM();                                                   \
+    for (type x : array) {                                                    \
+      type src[n] = {0};                                                      \
+      type dst[n] = {0};                                                      \
+      for (uint32_t i = 0; i < n; i++) src[i] = x + i;                        \
+      auto fn = [](MacroAssembler& assm) {                                    \
+        __ VU.set(t0, VSew::E##width, Vlmul::m1);                             \
+        __ vl(v1, a0, 0, VSew::E##width);                                     \
+        __ instr_name(v2, v1, a2);                                            \
+        __ vs(v2, a1, 0, VSew::E##width);                                     \
+      };                                                                      \
+      type rs2_val = x + x;                                                   \
+      GenAndRunTest<int64_t, int64_t>((int64_t)src, (int64_t)dst, rs2_val,    \
+                                      fn);                                    \
+      for (uint32_t i = 0; i < n; i++) {                                      \
+        CHECK_EQ(expect_res, dst[i]);                                         \
+      }                                                                       \
+    }                                                                         \
+  }
+
+// Test for vslide1down_vx
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, int64_t, 64,
+                                      ARRAY(int64_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, int32_t, 32,
+                                      ARRAY(int32_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, int16_t, 16,
+                                      ARRAY(int16_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, int8_t, 8, ARRAY(int8_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, uint32_t, 32,
+                                      ARRAY(uint32_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, uint16_t, 16,
+                                      ARRAY(uint16_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1down_vx, uint8_t, 8,
+                                      ARRAY(uint8_t),
+                                      (i + 1) < n ? src[i + 1] : rs2_val)
+
+// Test for vslide1up_vx
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, int64_t, 64, ARRAY(int64_t),
+                                      (int64_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, int32_t, 32, ARRAY(int32_t),
+                                      (int32_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, int16_t, 16, ARRAY(int16_t),
+                                      (int16_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, int8_t, 8, ARRAY(int8_t),
+                                      (int8_t)i < 1 ? rs2_val : src[i - 1])
+
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, uint32_t, 32,
+                                      ARRAY(uint32_t),
+                                      (uint32_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, uint16_t, 16,
+                                      ARRAY(uint16_t),
+                                      (uint16_t)i < 1 ? rs2_val : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES(vslide1up_vx, uint8_t, 8, ARRAY(uint8_t),
+                                      (uint8_t)i < 1 ? rs2_val : src[i - 1])
+#undef UTEST_RVV_VP_VSLIDE1_VX_FORM_WITH_RES
+
+#define UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(instr_name, type, width, fval, \
+                                              array, expect_res)             \
+  TEST(RISCV_UTEST_##instr_name##_##width##_##fval) {                        \
+    if (!CpuFeatures::IsSupported(RISCV_SIMD)) return;                       \
+    constexpr uint32_t n = kRvvVLEN / width;                                 \
+    CcTest::InitializeVM();                                                  \
+    for (type x : array) {                                                   \
+      type src[n] = {0};                                                     \
+      type dst[n] = {0};                                                     \
+      src[0] = base::bit_cast<type>(fval);                                   \
+      for (uint32_t i = 1; i < n; i++) src[i] = x + i;                       \
+      auto fn = [](MacroAssembler& assm) {                                   \
+        __ VU.set(t0, VSew::E##width, Vlmul::m1);                            \
+        __ vl(v1, a0, 0, VSew::E##width);                                    \
+        width == 32 ? __ flw(fa0, a0, 0) : __ fld(fa0, a0, 0);               \
+        __ instr_name(v2, v1, fa0);                                          \
+        __ vs(v2, a1, 0, VSew::E##width);                                    \
+      };                                                                     \
+      GenAndRunTest<int64_t, int64_t>((int64_t)src, (int64_t)dst, fn);       \
+      for (uint32_t i = 0; i < n; i++) {                                     \
+        CHECK_EQ(expect_res, dst[i]);                                        \
+      }                                                                      \
+    }                                                                        \
+  }
+
+// Test for vfslide1down_vf
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1down_vf, int64_t, 64,
+                                      0x40934A3D70A3D70A /*1234.56*/,
+                                      ARRAY(int64_t),
+                                      (i + 1) < n ? src[i + 1] : src[0])
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1down_vf, int32_t, 32,
+                                      0x449A51EC /*1234.56f*/, ARRAY(int32_t),
+                                      (i + 1) < n ? src[i + 1] : src[0])
+// Test for vfslide1down_vf_signaling_NaN
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1down_vf, int64_t, 64,
+                                      0x7FF4000000000000, ARRAY(int64_t),
+                                      (i + 1) < n ? src[i + 1] : src[0])
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1down_vf, int32_t, 32, 0x7F400000,
+                                      ARRAY(int32_t),
+                                      (i + 1) < n ? src[i + 1] : src[0])
+// Test for vfslide1up_vf
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1up_vf, int64_t, 64,
+                                      0x40934A3D70A3D70A /*1234.56*/,
+                                      ARRAY(int64_t),
+                                      (int64_t)i < 1 ? src[0] : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1up_vf, int32_t, 32,
+                                      0x449A51EC /*1234.56f*/, ARRAY(int32_t),
+                                      (int32_t)i < 1 ? src[0] : src[i - 1])
+// Test for vfslide1up_vf_signaling_NaN
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1up_vf, int64_t, 64,
+                                      0x7FF4000000000000, ARRAY(int64_t),
+                                      (int64_t)i < 1 ? src[0] : src[i - 1])
+UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES(vfslide1up_vf, int32_t, 32, 0x7F400000,
+                                      ARRAY(int32_t),
+                                      (int32_t)i < 1 ? src[0] : src[i - 1])
+#undef UTEST_RVV_VP_VSLIDE1_VF_FORM_WITH_RES
 #undef ARRAY
 
 #define UTEST_VFIRST_M_WITH_WIDTH(width)                            \
diff --git a/deps/v8/test/cctest/test-assembler-s390.cc b/deps/v8/test/cctest/test-assembler-s390.cc
index 69b22e6907c482..1dcdc014cf8673 100644
--- a/deps/v8/test/cctest/test-assembler-s390.cc
+++ b/deps/v8/test/cctest/test-assembler-s390.cc
@@ -66,7 +66,7 @@ TEST(0) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(3, 4, 0, 0, 0));
@@ -105,7 +105,7 @@ TEST(1) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(100, 0, 0, 0, 0));
@@ -156,7 +156,7 @@ TEST(2) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(10, 0, 0, 0, 0));
@@ -201,7 +201,7 @@ TEST(3) {
   __ mvc(MemOperand(r0, 123), MemOperand(r4, 567), Operand(88));
   __ sll(r13, Operand(10));
 
-  v8::internal::byte* bufPos = assm.buffer_pos();
+  uint8_t* bufPos = assm.buffer_pos();
   ::printf("buffer position = %p", static_cast<void*>(bufPos));
   ::fflush(stdout);
   // OS::DebugBreak();
@@ -211,7 +211,7 @@ TEST(3) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   USE(code);
   ::exit(0);
@@ -252,7 +252,7 @@ TEST(4) {
   Handle<Code> code = isolate->factory()->NewCode(
       desc, CodeKind::FOR_TESTING, Handle<Code>());
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(
@@ -280,7 +280,7 @@ TEST(5) {
   Handle<Code> code = isolate->factory()->NewCode(
       desc, CodeKind::FOR_TESTING, Handle<Code>());
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
   intptr_t res =
@@ -314,7 +314,7 @@ TEST(6) {
   Handle<Code> code = isolate->factory()->NewCode(
       desc, CodeKind::FOR_TESTING, Handle<Code>());
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
   intptr_t res =
@@ -346,7 +346,7 @@ TEST(7) {
   Handle<Code> code = isolate->factory()->NewCode(
       desc, CodeKind::FOR_TESTING, Handle<Code>());
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
   intptr_t res =
@@ -377,7 +377,7 @@ TEST(8) {
   Handle<Code> code = isolate->factory()->NewCode(
       desc, CodeKind::FOR_TESTING, Handle<Code>());
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res =
@@ -404,7 +404,7 @@ TEST(9) {
   Handle<Code> code = isolate->factory()->NewCode(
       desc, CodeKind::FOR_TESTING, Handle<Code>());
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res =
@@ -489,7 +489,7 @@ TEST(10) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(3, 4, 0, 0, 0));
@@ -543,7 +543,7 @@ TEST(11) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(0, 0, 0, 0, 0));
@@ -597,7 +597,7 @@ TEST(12) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(0, 0, 0, 0, 0));
@@ -661,7 +661,7 @@ TEST(13) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(50, 250, 0, 0, 0));
@@ -752,7 +752,7 @@ TEST(14) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(0, 0, 0, 0, 0));
@@ -842,7 +842,7 @@ TEST(15) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(0, 0, 0, 0, 0));
@@ -889,7 +889,7 @@ TEST(16) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(0, 0, 0, 0, 0));
@@ -963,7 +963,7 @@ TEST(17) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   intptr_t res = reinterpret_cast<intptr_t>(f.Call(0x2, 0x30, 0, 0, 0));
@@ -1055,7 +1055,7 @@ TEST(18) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   // f.Call(reg2, reg3, reg4, reg5, reg6) -> set the register value
diff --git a/deps/v8/test/cctest/test-code-stub-assembler.cc b/deps/v8/test/cctest/test-code-stub-assembler.cc
index 5efe5281c26937..a83c1df60ba4fc 100644
--- a/deps/v8/test/cctest/test-code-stub-assembler.cc
+++ b/deps/v8/test/cctest/test-code-stub-assembler.cc
@@ -83,7 +83,7 @@ TEST(CallCFunction) {
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
 
   Handle<Object> result = ft.Call().ToHandleChecked();
-  CHECK_EQ(45, Handle<Smi>::cast(result)->value());
+  CHECK_EQ(45, Smi::cast(*result).value());
 }
 
 TEST(CallCFunctionWithCallerSavedRegisters) {
@@ -111,7 +111,7 @@ TEST(CallCFunctionWithCallerSavedRegisters) {
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
 
   Handle<Object> result = ft.Call().ToHandleChecked();
-  CHECK_EQ(3, Handle<Smi>::cast(result)->value());
+  CHECK_EQ(3, Smi::cast(*result).value());
 }
 
 TEST(NumberToString) {
@@ -157,7 +157,7 @@ TEST(NumberToString) {
     Handle<String> expected = factory->NumberToString(input);
 
     Handle<Object> result = ft.Call(input).ToHandleChecked();
-    if (result->IsUndefined(isolate)) {
+    if (IsUndefined(*result, isolate)) {
       // Query may fail if cache was resized, in which case the entry is not
       // added to the cache.
       CHECK_LT(cache_length_before_addition, kFullCacheSize);
@@ -165,7 +165,7 @@ TEST(NumberToString) {
       expected = factory->NumberToString(input);
       result = ft.Call(input).ToHandleChecked();
     }
-    CHECK(!result->IsUndefined(isolate));
+    CHECK(!IsUndefined(*result, isolate));
     CHECK_EQ(*expected, *result);
   }
 }
@@ -186,9 +186,9 @@ void CheckToUint32Result(uint32_t expected, Handle<Object> result) {
       static_cast<int64_t>(std::numeric_limits<intptr_t>::max());
   if (expected_fits_into_intptr &&
       Smi::IsValid(static_cast<intptr_t>(expected))) {
-    CHECK(result->IsSmi());
+    CHECK(IsSmi(*result));
   } else {
-    CHECK(result->IsHeapNumber());
+    CHECK(IsHeapNumber(*result));
   }
 }
 
@@ -243,7 +243,7 @@ TEST(ToUint32) {
     Handle<HeapNumber> input_num;
 
     // Check with Smi input.
-    if (input_obj->IsSmi()) {
+    if (IsSmi(*input_obj)) {
       Handle<Smi> input_smi = Handle<Smi>::cast(input_obj);
       Handle<Object> result = ft.Call(input_smi).ToHandleChecked();
       CheckToUint32Result(expectations[i], result);
@@ -254,7 +254,7 @@ TEST(ToUint32) {
 
     // Check with HeapNumber input.
     {
-      CHECK(input_num->IsHeapNumber());
+      CHECK(IsHeapNumber(*input_num));
       Handle<Object> result = ft.Call(input_num).ToHandleChecked();
       CheckToUint32Result(expectations[i], result);
     }
@@ -286,9 +286,9 @@ void IsValidPositiveSmiCase(Isolate* isolate, intptr_t value) {
 
   bool expected = i::PlatformSmiTagging::IsValidSmi(value) && (value >= 0);
   if (expected) {
-    CHECK(maybe_handle.ToHandleChecked()->IsTrue(isolate));
+    CHECK(IsTrue(*maybe_handle.ToHandleChecked(), isolate));
   } else {
-    CHECK(maybe_handle.ToHandleChecked()->IsFalse(isolate));
+    CHECK(IsFalse(*maybe_handle.ToHandleChecked(), isolate));
   }
 }
 }  // namespace
@@ -424,7 +424,7 @@ TEST(FixedArrayAccessSmiIndex) {
                                    m.SmiTag(m.IntPtrConstant(4)), 0));
   FunctionTester ft(asm_tester.GenerateCode());
   MaybeHandle<Object> result = ft.Call();
-  CHECK_EQ(733, Handle<Smi>::cast(result.ToHandleChecked())->value());
+  CHECK_EQ(733, Smi::cast(*result.ToHandleChecked()).value());
 }
 
 TEST(LoadHeapNumberValue) {
@@ -436,7 +436,7 @@ TEST(LoadHeapNumberValue) {
       m.ChangeFloat64ToUint32(m.LoadHeapNumberValue(m.HeapConstant(number))))));
   FunctionTester ft(asm_tester.GenerateCode());
   MaybeHandle<Object> result = ft.Call();
-  CHECK_EQ(1234, Handle<Smi>::cast(result.ToHandleChecked())->value());
+  CHECK_EQ(1234, Smi::cast(*result.ToHandleChecked()).value());
 }
 
 TEST(LoadInstanceType) {
@@ -448,7 +448,7 @@ TEST(LoadInstanceType) {
   FunctionTester ft(asm_tester.GenerateCode());
   MaybeHandle<Object> result = ft.Call();
   CHECK_EQ(InstanceType::ODDBALL_TYPE,
-           Handle<Smi>::cast(result.ToHandleChecked())->value());
+           Smi::cast(*result.ToHandleChecked()).value());
 }
 
 TEST(DecodeWordFromWord32) {
@@ -464,7 +464,7 @@ TEST(DecodeWordFromWord32) {
   // value  = 00101111
   // mask   = 00111000
   // result = 101
-  CHECK_EQ(5, Handle<Smi>::cast(result.ToHandleChecked())->value());
+  CHECK_EQ(5, Smi::cast(*result.ToHandleChecked()).value());
 }
 
 TEST(JSFunction) {
@@ -479,7 +479,7 @@ TEST(JSFunction) {
 
   MaybeHandle<Object> result = ft.Call(handle(Smi::FromInt(23), isolate),
                                        handle(Smi::FromInt(34), isolate));
-  CHECK_EQ(57, Handle<Smi>::cast(result.ToHandleChecked())->value());
+  CHECK_EQ(57, Smi::cast(*result.ToHandleChecked()).value());
 }
 
 TEST(ComputeIntegerHash) {
@@ -502,7 +502,7 @@ TEST(ComputeIntegerHash) {
     Handle<Object> result = ft.Call(key).ToHandleChecked();
 
     uint32_t hash = ComputeSeededHash(k, HashSeed(isolate));
-    Smi expected = Smi::FromInt(hash);
+    Tagged<Smi> expected = Smi::FromInt(hash);
     CHECK_EQ(expected, Smi::cast(*result));
   }
 }
@@ -559,7 +559,7 @@ TEST(ToString) {
     Handle<Object> obj = handle(test->get(0), isolate);
     Handle<String> expected = handle(String::cast(test->get(1)), isolate);
     Handle<Object> result = ft.Call(obj).ToHandleChecked();
-    CHECK(result->IsString());
+    CHECK(IsString(*result));
     CHECK(String::Equals(isolate, Handle<String>::cast(result), expected));
   }
 }
@@ -748,7 +748,7 @@ TEST(TryToName) {
     uint32_t dummy;
     CHECK(key->AsArrayIndex(&dummy));
     CHECK(key->HasHashCode());
-    CHECK(!key->IsInternalizedString());
+    CHECK(!IsInternalizedString(*key));
     Handle<Object> index(Smi::FromInt(153), isolate);
     ft.CheckTrue(key, expect_index, index);
   }
@@ -1108,9 +1108,8 @@ TEST(TransitionLookup) {
     }
   }
 
-  CHECK(root_map->raw_transitions()
-            ->GetHeapObjectAssumeStrong()
-            .IsTransitionArray());
+  CHECK(IsTransitionArray(
+      root_map->raw_transitions()->GetHeapObjectAssumeStrong()));
   Handle<TransitionArray> transitions(
       TransitionArray::cast(
           root_map->raw_transitions()->GetHeapObjectAssumeStrong()),
@@ -1174,11 +1173,13 @@ void AddProperties(Handle<JSObject> object, Handle<Name> names[],
   Isolate* isolate = object->GetIsolate();
   for (size_t i = 0; i < names_count; i++) {
     Handle<Object> value = values[(seed + i) % values_count];
-    if (value->IsAccessorPair()) {
+    if (IsAccessorPair(*value)) {
       Handle<AccessorPair> pair = Handle<AccessorPair>::cast(value);
       Handle<Object> getter(pair->getter(), isolate);
       Handle<Object> setter(pair->setter(), isolate);
-      JSObject::DefineAccessor(object, names[i], getter, setter, NONE).Check();
+      JSObject::DefineOwnAccessorIgnoreAttributes(object, names[i], getter,
+                                                  setter, NONE)
+          .Check();
     } else {
       JSObject::AddProperty(isolate, object, names[i], value, NONE);
     }
@@ -1262,9 +1263,9 @@ TEST(TryHasOwnProperty) {
     Handle<Map> map = Map::Create(isolate, inobject_properties);
     Handle<JSObject> object = factory->NewJSObjectFromMap(map);
     AddProperties(object, names, arraysize(names));
-    CHECK_EQ(JS_OBJECT_TYPE, object->map().instance_type());
-    CHECK_EQ(inobject_properties, object->map().GetInObjectProperties());
-    CHECK(!object->map().is_dictionary_map());
+    CHECK_EQ(JS_OBJECT_TYPE, object->map()->instance_type());
+    CHECK_EQ(inobject_properties, object->map()->GetInObjectProperties());
+    CHECK(!object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1274,9 +1275,9 @@ TEST(TryHasOwnProperty) {
     Handle<Map> map = Map::Create(isolate, inobject_properties);
     Handle<JSObject> object = factory->NewJSObjectFromMap(map);
     AddProperties(object, names, arraysize(names));
-    CHECK_EQ(JS_OBJECT_TYPE, object->map().instance_type());
-    CHECK_EQ(inobject_properties, object->map().GetInObjectProperties());
-    CHECK(!object->map().is_dictionary_map());
+    CHECK_EQ(JS_OBJECT_TYPE, object->map()->instance_type());
+    CHECK_EQ(inobject_properties, object->map()->GetInObjectProperties());
+    CHECK(!object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1286,9 +1287,9 @@ TEST(TryHasOwnProperty) {
     Handle<Map> map = Map::Create(isolate, inobject_properties);
     Handle<JSObject> object = factory->NewJSObjectFromMap(map);
     AddProperties(object, names, arraysize(names));
-    CHECK_EQ(JS_OBJECT_TYPE, object->map().instance_type());
-    CHECK_EQ(inobject_properties, object->map().GetInObjectProperties());
-    CHECK(!object->map().is_dictionary_map());
+    CHECK_EQ(JS_OBJECT_TYPE, object->map()->instance_type());
+    CHECK_EQ(inobject_properties, object->map()->GetInObjectProperties());
+    CHECK(!object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1306,8 +1307,8 @@ TEST(TryHasOwnProperty) {
                                    LanguageMode::kSloppy)
               .FromJust());
 
-    CHECK_EQ(JS_OBJECT_TYPE, object->map().instance_type());
-    CHECK(object->map().is_dictionary_map());
+    CHECK_EQ(JS_OBJECT_TYPE, object->map()->instance_type());
+    CHECK(object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1316,10 +1317,10 @@ TEST(TryHasOwnProperty) {
     Handle<JSFunction> function =
         factory->NewFunctionForTesting(factory->empty_string());
     JSFunction::EnsureHasInitialMap(function);
-    function->initial_map().set_instance_type(JS_GLOBAL_OBJECT_TYPE);
-    function->initial_map().set_is_prototype_map(true);
-    function->initial_map().set_is_dictionary_map(true);
-    function->initial_map().set_may_have_interesting_symbols(true);
+    function->initial_map()->set_instance_type(JS_GLOBAL_OBJECT_TYPE);
+    function->initial_map()->set_is_prototype_map(true);
+    function->initial_map()->set_is_dictionary_map(true);
+    function->initial_map()->set_may_have_interesting_properties(true);
     Handle<JSObject> object = factory->NewJSGlobalObject(function);
     AddProperties(object, names, arraysize(names));
 
@@ -1328,8 +1329,8 @@ TEST(TryHasOwnProperty) {
                                    LanguageMode::kSloppy)
               .FromJust());
 
-    CHECK_EQ(JS_GLOBAL_OBJECT_TYPE, object->map().instance_type());
-    CHECK(object->map().is_dictionary_map());
+    CHECK_EQ(JS_GLOBAL_OBJECT_TYPE, object->map()->instance_type());
+    CHECK(object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1367,13 +1368,13 @@ TEST(TryHasOwnProperty) {
     Handle<JSFunction> function =
         factory->NewFunctionForTesting(factory->empty_string());
     Handle<JSProxy> object = factory->NewJSProxy(function, objects[0]);
-    CHECK_EQ(JS_PROXY_TYPE, object->map().instance_type());
+    CHECK_EQ(JS_PROXY_TYPE, object->map()->instance_type());
     ft.CheckTrue(object, names[0], expect_bailout);
   }
 
   {
     Handle<JSObject> object = isolate->global_proxy();
-    CHECK_EQ(JS_GLOBAL_PROXY_TYPE, object->map().instance_type());
+    CHECK_EQ(JS_GLOBAL_PROXY_TYPE, object->map()->instance_type());
     ft.CheckTrue(object, names[0], expect_bailout);
   }
 }
@@ -1467,9 +1468,9 @@ TEST(TryGetOwnProperty) {
     Handle<JSObject> object = factory->NewJSObjectFromMap(map);
     AddProperties(object, names, arraysize(names), values, arraysize(values),
                   rand_gen.NextInt());
-    CHECK_EQ(JS_OBJECT_TYPE, object->map().instance_type());
-    CHECK_EQ(inobject_properties, object->map().GetInObjectProperties());
-    CHECK(!object->map().is_dictionary_map());
+    CHECK_EQ(JS_OBJECT_TYPE, object->map()->instance_type());
+    CHECK_EQ(inobject_properties, object->map()->GetInObjectProperties());
+    CHECK(!object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1480,9 +1481,9 @@ TEST(TryGetOwnProperty) {
     Handle<JSObject> object = factory->NewJSObjectFromMap(map);
     AddProperties(object, names, arraysize(names), values, arraysize(values),
                   rand_gen.NextInt());
-    CHECK_EQ(JS_OBJECT_TYPE, object->map().instance_type());
-    CHECK_EQ(inobject_properties, object->map().GetInObjectProperties());
-    CHECK(!object->map().is_dictionary_map());
+    CHECK_EQ(JS_OBJECT_TYPE, object->map()->instance_type());
+    CHECK_EQ(inobject_properties, object->map()->GetInObjectProperties());
+    CHECK(!object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1493,9 +1494,9 @@ TEST(TryGetOwnProperty) {
     Handle<JSObject> object = factory->NewJSObjectFromMap(map);
     AddProperties(object, names, arraysize(names), values, arraysize(values),
                   rand_gen.NextInt());
-    CHECK_EQ(JS_OBJECT_TYPE, object->map().instance_type());
-    CHECK_EQ(inobject_properties, object->map().GetInObjectProperties());
-    CHECK(!object->map().is_dictionary_map());
+    CHECK_EQ(JS_OBJECT_TYPE, object->map()->instance_type());
+    CHECK_EQ(inobject_properties, object->map()->GetInObjectProperties());
+    CHECK(!object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1514,8 +1515,8 @@ TEST(TryGetOwnProperty) {
                                    LanguageMode::kSloppy)
               .FromJust());
 
-    CHECK_EQ(JS_OBJECT_TYPE, object->map().instance_type());
-    CHECK(object->map().is_dictionary_map());
+    CHECK_EQ(JS_OBJECT_TYPE, object->map()->instance_type());
+    CHECK(object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1530,8 +1531,8 @@ TEST(TryGetOwnProperty) {
                                    LanguageMode::kSloppy)
               .FromJust());
 
-    CHECK_EQ(JS_GLOBAL_OBJECT_TYPE, object->map().instance_type());
-    CHECK(object->map().is_dictionary_map());
+    CHECK_EQ(JS_GLOBAL_OBJECT_TYPE, object->map()->instance_type());
+    CHECK(object->map()->is_dictionary_map());
     objects.push_back(object);
   }
 
@@ -1544,7 +1545,7 @@ TEST(TryGetOwnProperty) {
         Handle<Object> expected_value =
             JSReceiver::GetProperty(isolate, object, name).ToHandleChecked();
         Handle<Object> value = ft.Call(object, name).ToHandleChecked();
-        CHECK(expected_value->SameValue(*value));
+        CHECK(Object::SameValue(*expected_value, *value));
       }
     }
   }
@@ -1565,7 +1566,7 @@ TEST(TryGetOwnProperty) {
         Handle<Name> name = non_existing_names[key_index];
         Handle<Object> expected_value =
             JSReceiver::GetProperty(isolate, object, name).ToHandleChecked();
-        CHECK(expected_value->IsUndefined(isolate));
+        CHECK(IsUndefined(*expected_value, isolate));
         Handle<Object> value = ft.Call(object, name).ToHandleChecked();
         CHECK_EQ(*not_found_symbol, *value);
       }
@@ -1576,7 +1577,7 @@ TEST(TryGetOwnProperty) {
     Handle<JSFunction> function =
         factory->NewFunctionForTesting(factory->empty_string());
     Handle<JSProxy> object = factory->NewJSProxy(function, objects[0]);
-    CHECK_EQ(JS_PROXY_TYPE, object->map().instance_type());
+    CHECK_EQ(JS_PROXY_TYPE, object->map()->instance_type());
     Handle<Object> value = ft.Call(object, names[0]).ToHandleChecked();
     // Proxies are not supported yet.
     CHECK_EQ(*bailout_symbol, *value);
@@ -1584,7 +1585,7 @@ TEST(TryGetOwnProperty) {
 
   {
     Handle<JSObject> object = isolate->global_proxy();
-    CHECK_EQ(JS_GLOBAL_PROXY_TYPE, object->map().instance_type());
+    CHECK_EQ(JS_GLOBAL_PROXY_TYPE, object->map()->instance_type());
     // Global proxies are not supported yet.
     Handle<Object> value = ft.Call(object, names[0]).ToHandleChecked();
     CHECK_EQ(*bailout_symbol, *value);
@@ -1684,7 +1685,7 @@ TEST(TryLookupElement) {
     Handle<JSArray> object = factory->NewJSArray(0, PACKED_SMI_ELEMENTS);
     AddElement(object, 0, smi0);
     AddElement(object, 1, smi0);
-    CHECK_EQ(PACKED_SMI_ELEMENTS, object->map().elements_kind());
+    CHECK_EQ(PACKED_SMI_ELEMENTS, object->map()->elements_kind());
 
     CHECK_FOUND(object, 0);
     CHECK_FOUND(object, 1);
@@ -1697,7 +1698,7 @@ TEST(TryLookupElement) {
     Handle<JSArray> object = factory->NewJSArray(0, HOLEY_SMI_ELEMENTS);
     AddElement(object, 0, smi0);
     AddElement(object, 13, smi0);
-    CHECK_EQ(HOLEY_SMI_ELEMENTS, object->map().elements_kind());
+    CHECK_EQ(HOLEY_SMI_ELEMENTS, object->map()->elements_kind());
 
     CHECK_FOUND(object, 0);
     CHECK_NOT_FOUND(object, 1);
@@ -1710,7 +1711,7 @@ TEST(TryLookupElement) {
     Handle<JSArray> object = factory->NewJSArray(0, PACKED_ELEMENTS);
     AddElement(object, 0, smi0);
     AddElement(object, 1, smi0);
-    CHECK_EQ(PACKED_ELEMENTS, object->map().elements_kind());
+    CHECK_EQ(PACKED_ELEMENTS, object->map()->elements_kind());
 
     CHECK_FOUND(object, 0);
     CHECK_FOUND(object, 1);
@@ -1723,7 +1724,7 @@ TEST(TryLookupElement) {
     Handle<JSArray> object = factory->NewJSArray(0, HOLEY_ELEMENTS);
     AddElement(object, 0, smi0);
     AddElement(object, 13, smi0);
-    CHECK_EQ(HOLEY_ELEMENTS, object->map().elements_kind());
+    CHECK_EQ(HOLEY_ELEMENTS, object->map()->elements_kind());
 
     CHECK_FOUND(object, 0);
     CHECK_NOT_FOUND(object, 1);
@@ -1738,7 +1739,7 @@ TEST(TryLookupElement) {
     Handle<JSTypedArray> object = factory->NewJSTypedArray(
         kExternalInt32Array, v8::Utils::OpenHandle(*buffer), 0, 2);
 
-    CHECK_EQ(INT32_ELEMENTS, object->map().elements_kind());
+    CHECK_EQ(INT32_ELEMENTS, object->map()->elements_kind());
 
     CHECK_FOUND(object, 0);
     CHECK_FOUND(object, 1);
@@ -1764,7 +1765,7 @@ TEST(TryLookupElement) {
     Handle<String> str = factory->InternalizeUtf8String("ab");
     Handle<JSPrimitiveWrapper>::cast(object)->set_value(*str);
     AddElement(object, 13, smi0);
-    CHECK_EQ(FAST_STRING_WRAPPER_ELEMENTS, object->map().elements_kind());
+    CHECK_EQ(FAST_STRING_WRAPPER_ELEMENTS, object->map()->elements_kind());
 
     CHECK_FOUND(object, 0);
     CHECK_FOUND(object, 1);
@@ -1780,7 +1781,7 @@ TEST(TryLookupElement) {
     Handle<JSPrimitiveWrapper>::cast(object)->set_value(*str);
     AddElement(object, 13, smi0);
     JSObject::NormalizeElements(object);
-    CHECK_EQ(SLOW_STRING_WRAPPER_ELEMENTS, object->map().elements_kind());
+    CHECK_EQ(SLOW_STRING_WRAPPER_ELEMENTS, object->map()->elements_kind());
 
     CHECK_FOUND(object, 0);
     CHECK_FOUND(object, 1);
@@ -1812,19 +1813,19 @@ TEST(TryLookupElement) {
     Handle<JSFunction> function =
         factory->NewFunctionForTesting(factory->empty_string());
     Handle<JSProxy> object = factory->NewJSProxy(function, handler);
-    CHECK_EQ(JS_PROXY_TYPE, object->map().instance_type());
+    CHECK_EQ(JS_PROXY_TYPE, object->map()->instance_type());
     ft.CheckTrue(object, smi0, expect_bailout);
   }
 
   {
     Handle<JSObject> object = isolate->global_object();
-    CHECK_EQ(JS_GLOBAL_OBJECT_TYPE, object->map().instance_type());
+    CHECK_EQ(JS_GLOBAL_OBJECT_TYPE, object->map()->instance_type());
     ft.CheckTrue(object, smi0, expect_bailout);
   }
 
   {
     Handle<JSObject> object = isolate->global_proxy();
-    CHECK_EQ(JS_GLOBAL_PROXY_TYPE, object->map().instance_type());
+    CHECK_EQ(JS_GLOBAL_PROXY_TYPE, object->map()->instance_type());
     ft.CheckTrue(object, smi0, expect_bailout);
   }
 }
@@ -1945,19 +1946,19 @@ TEST(AllocationFoldingCSA) {
     } else {
       CHECK(IsAligned(result->address(), kTaggedSize));
     }
-    ByteArray prev_array;
+    Tagged<ByteArray> prev_array;
     for (int i = 1; i <= kNumArrays; ++i) {
-      ByteArray current_array = ByteArray::cast(result->get(i - 1));
+      Tagged<ByteArray> current_array = ByteArray::cast(result->get(i - 1));
       if (V8_COMPRESS_POINTERS_8GB_BOOL) {
         CHECK(IsAligned(current_array.address(), kObjectAlignment8GbHeap));
       } else {
         CHECK(IsAligned(current_array.address(), kTaggedSize));
       }
-      CHECK_EQ(current_array.length(), i * kTaggedSize);
+      CHECK_EQ(current_array->length(), i * kTaggedSize);
       if (i != 1) {
         // TODO(v8:13070): Align prev_array.AllocatedSize() to the allocation
         // size.
-        CHECK_EQ(prev_array.address() + prev_array.AllocatedSize(),
+        CHECK_EQ(prev_array.address() + prev_array->AllocatedSize(),
                  current_array.address());
       }
       prev_array = current_array;
@@ -2098,7 +2099,7 @@ TEST(PopAndReturnFromTFCBuiltinWithStackParameters) {
 namespace {
 
 TNode<Object> MakeConstantNode(CodeStubAssembler& m, Handle<Object> value) {
-  if (value->IsSmi()) {
+  if (IsSmi(*value)) {
     return m.SmiConstant(Smi::ToInt(*value));
   }
   return m.HeapConstant(Handle<HeapObject>::cast(value));
@@ -2188,7 +2189,7 @@ TEST(PopAndReturnConstant) {
   }
 
   FunctionTester ft(asm_tester.GenerateCode(), 0);
-  ft.function->shared().DontAdaptArguments();
+  ft.function->shared()->DontAdaptArguments();
 
   // Now call this function multiple time also checking that the stack pointer
   // didn't change after the calls.
@@ -2222,7 +2223,7 @@ TEST(PopAndReturnVariable) {
   }
 
   FunctionTester ft(asm_tester.GenerateCode(), 0);
-  ft.function->shared().DontAdaptArguments();
+  ft.function->shared()->DontAdaptArguments();
 
   // Now call this function multiple time also checking that the stack pointer
   // didn't change after the calls.
@@ -2390,7 +2391,7 @@ TEST(Arguments) {
   }
 
   FunctionTester ft(asm_tester.GenerateCode(), 0);
-  ft.function->shared().DontAdaptArguments();
+  ft.function->shared()->DontAdaptArguments();
 
   Handle<Object> result;
   result = ft.Call(Handle<Smi>(Smi::FromInt(12), isolate),
@@ -2447,7 +2448,7 @@ TEST(ArgumentsForEach) {
   }
 
   FunctionTester ft(asm_tester.GenerateCode(), 0);
-  ft.function->shared().DontAdaptArguments();
+  ft.function->shared()->DontAdaptArguments();
 
   Handle<Object> result;
   result = ft.Call(Handle<Smi>(Smi::FromInt(12), isolate),
@@ -2607,7 +2608,8 @@ class AppendJSArrayCodeStubAssembler : public CodeStubAssembler {
                              Handle<Object> o3, Handle<Object> o4,
                              int initial_size, int result_size) {
     Handle<JSArray> array = isolate->factory()->NewJSArray(
-        kind_, 2, initial_size, INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
+        kind_, 2, initial_size,
+        ArrayStorageAllocationMode::INITIALIZE_ARRAY_ELEMENTS_WITH_HOLE);
     Object::SetElement(isolate, array, 0, Handle<Smi>(Smi::FromInt(1), isolate),
                        kDontThrow)
         .Check();
@@ -2631,7 +2633,7 @@ class AppendJSArrayCodeStubAssembler : public CodeStubAssembler {
     Handle<Object> result = ft.Call(o1, o2, o3, o4).ToHandleChecked();
 
     CHECK_EQ(kind_, array->GetElementsKind());
-    CHECK_EQ(result_size, Handle<Smi>::cast(result)->value());
+    CHECK_EQ(result_size, Smi::cast(*result).value());
     CHECK_EQ(result_size, Smi::ToInt(array->length()));
     Handle<Object> obj =
         JSObject::GetElement(isolate, array, 2).ToHandleChecked();
@@ -2646,8 +2648,9 @@ class AppendJSArrayCodeStubAssembler : public CodeStubAssembler {
     CHECK_EQ(result_size < 6 ? *undefined_value : *o4, *obj);
   }
 
-  static void TestAppendJSArray(Isolate* isolate, ElementsKind kind, Object o1,
-                                Object o2, Object o3, Object o4,
+  static void TestAppendJSArray(Isolate* isolate, ElementsKind kind,
+                                Tagged<Object> o1, Tagged<Object> o2,
+                                Tagged<Object> o3, Tagged<Object> o4,
                                 int initial_size, int result_size) {
     CodeAssemblerTester asm_tester(isolate, i::JSParameterCount(kNumParams));
     AppendJSArrayCodeStubAssembler m(asm_tester.state(), kind);
@@ -2778,7 +2781,7 @@ TEST(NewJSPromise) {
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Object> result =
       ft.Call(isolate->factory()->undefined_value()).ToHandleChecked();
-  CHECK(result->IsJSPromise());
+  CHECK(IsJSPromise(*result));
 }
 
 TEST(NewJSPromise2) {
@@ -2796,7 +2799,7 @@ TEST(NewJSPromise2) {
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Object> result =
       ft.Call(isolate->factory()->undefined_value()).ToHandleChecked();
-  CHECK(result->IsJSPromise());
+  CHECK(IsJSPromise(*result));
   Handle<JSPromise> js_promise = Handle<JSPromise>::cast(result);
   CHECK_EQ(v8::Promise::kRejected, js_promise->status());
   CHECK_EQ(Smi::FromInt(1), js_promise->result());
@@ -2880,11 +2883,11 @@ TEST(CreatePromiseResolvingFunctionsContext) {
 
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Object> result = ft.Call().ToHandleChecked();
-  CHECK(result->IsContext());
+  CHECK(IsContext(*result));
   Handle<Context> context_js = Handle<Context>::cast(result);
   CHECK_EQ(isolate->root(RootIndex::kEmptyScopeInfo), context_js->scope_info());
   CHECK_EQ(*isolate->native_context(), context_js->native_context());
-  CHECK(context_js->get(PromiseBuiltins::kPromiseSlot).IsJSPromise());
+  CHECK(IsJSPromise(context_js->get(PromiseBuiltins::kPromiseSlot)));
   CHECK_EQ(ReadOnlyRoots(isolate).false_value(),
            context_js->get(PromiseBuiltins::kDebugEventSlot));
 }
@@ -2914,10 +2917,10 @@ TEST(CreatePromiseResolvingFunctions) {
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Object> result_obj =
       ft.Call(isolate->factory()->undefined_value()).ToHandleChecked();
-  CHECK(result_obj->IsFixedArray());
+  CHECK(IsFixedArray(*result_obj));
   Handle<FixedArray> result_arr = Handle<FixedArray>::cast(result_obj);
-  CHECK(result_arr->get(0).IsJSFunction());
-  CHECK(result_arr->get(1).IsJSFunction());
+  CHECK(IsJSFunction(result_arr->get(0)));
+  CHECK(IsJSFunction(result_arr->get(1)));
 }
 
 TEST(NewElementsCapacity) {
@@ -2930,25 +2933,25 @@ TEST(NewElementsCapacity) {
 
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Smi> test_value = Handle<Smi>(Smi::FromInt(1), isolate);
-  Handle<Smi> result_obj = ft.CallChecked<Smi>(test_value);
+  Tagged<Smi> result_obj = *ft.CallChecked<Smi>(test_value);
   CHECK_EQ(
-      result_obj->value(),
-      static_cast<int>(JSObject::NewElementsCapacity(test_value->value())));
+      result_obj.value(),
+      static_cast<int>(JSObject::NewElementsCapacity((*test_value).value())));
   test_value = Handle<Smi>(Smi::FromInt(1), isolate);
-  result_obj = ft.CallChecked<Smi>(test_value);
+  result_obj = *ft.CallChecked<Smi>(test_value);
   CHECK_EQ(
-      result_obj->value(),
-      static_cast<int>(JSObject::NewElementsCapacity(test_value->value())));
+      result_obj.value(),
+      static_cast<int>(JSObject::NewElementsCapacity((*test_value).value())));
   test_value = Handle<Smi>(Smi::FromInt(2), isolate);
-  result_obj = ft.CallChecked<Smi>(test_value);
+  result_obj = *ft.CallChecked<Smi>(test_value);
   CHECK_EQ(
-      result_obj->value(),
-      static_cast<int>(JSObject::NewElementsCapacity(test_value->value())));
+      result_obj.value(),
+      static_cast<int>(JSObject::NewElementsCapacity((*test_value).value())));
   test_value = Handle<Smi>(Smi::FromInt(1025), isolate);
-  result_obj = ft.CallChecked<Smi>(test_value);
+  result_obj = *ft.CallChecked<Smi>(test_value);
   CHECK_EQ(
-      result_obj->value(),
-      static_cast<int>(JSObject::NewElementsCapacity(test_value->value())));
+      result_obj.value(),
+      static_cast<int>(JSObject::NewElementsCapacity((*test_value).value())));
 }
 
 TEST(NewElementsCapacitySmi) {
@@ -2960,25 +2963,25 @@ TEST(NewElementsCapacitySmi) {
 
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Smi> test_value = Handle<Smi>(Smi::FromInt(0), isolate);
-  Handle<Smi> result_obj = ft.CallChecked<Smi>(test_value);
+  Tagged<Smi> result_obj = *ft.CallChecked<Smi>(test_value);
   CHECK_EQ(
-      result_obj->value(),
-      static_cast<int>(JSObject::NewElementsCapacity(test_value->value())));
+      result_obj.value(),
+      static_cast<int>(JSObject::NewElementsCapacity((*test_value).value())));
   test_value = Handle<Smi>(Smi::FromInt(1), isolate);
-  result_obj = ft.CallChecked<Smi>(test_value);
+  result_obj = *ft.CallChecked<Smi>(test_value);
   CHECK_EQ(
-      result_obj->value(),
-      static_cast<int>(JSObject::NewElementsCapacity(test_value->value())));
+      result_obj.value(),
+      static_cast<int>(JSObject::NewElementsCapacity((*test_value).value())));
   test_value = Handle<Smi>(Smi::FromInt(2), isolate);
-  result_obj = ft.CallChecked<Smi>(test_value);
+  result_obj = *ft.CallChecked<Smi>(test_value);
   CHECK_EQ(
-      result_obj->value(),
-      static_cast<int>(JSObject::NewElementsCapacity(test_value->value())));
+      result_obj.value(),
+      static_cast<int>(JSObject::NewElementsCapacity((*test_value).value())));
   test_value = Handle<Smi>(Smi::FromInt(1025), isolate);
-  result_obj = ft.CallChecked<Smi>(test_value);
+  result_obj = *ft.CallChecked<Smi>(test_value);
   CHECK_EQ(
-      result_obj->value(),
-      static_cast<int>(JSObject::NewElementsCapacity(test_value->value())));
+      result_obj.value(),
+      static_cast<int>(JSObject::NewElementsCapacity((*test_value).value())));
 }
 
 TEST(AllocateFunctionWithMapAndContext) {
@@ -3005,7 +3008,7 @@ TEST(AllocateFunctionWithMapAndContext) {
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Object> result_obj =
       ft.Call(isolate->factory()->undefined_value()).ToHandleChecked();
-  CHECK(result_obj->IsJSFunction());
+  CHECK(IsJSFunction(*result_obj));
   Handle<JSFunction> fun = Handle<JSFunction>::cast(result_obj);
   CHECK_EQ(ReadOnlyRoots(isolate).empty_property_array(),
            fun->property_array());
@@ -3039,13 +3042,12 @@ TEST(CreatePromiseGetCapabilitiesExecutorContext) {
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Object> result_obj =
       ft.Call(isolate->factory()->undefined_value()).ToHandleChecked();
-  CHECK(result_obj->IsContext());
+  CHECK(IsContext(*result_obj));
   Handle<Context> context_js = Handle<Context>::cast(result_obj);
   CHECK_EQ(PromiseBuiltins::kCapabilitiesContextLength, context_js->length());
   CHECK_EQ(isolate->root(RootIndex::kEmptyScopeInfo), context_js->scope_info());
   CHECK_EQ(*isolate->native_context(), context_js->native_context());
-  CHECK(
-      context_js->get(PromiseBuiltins::kCapabilitySlot).IsPromiseCapability());
+  CHECK(IsPromiseCapability(context_js->get(PromiseBuiltins::kCapabilitySlot)));
 }
 
 TEST(NewPromiseCapability) {
@@ -3061,7 +3063,7 @@ TEST(NewPromiseCapability) {
     const TNode<Object> promise_constructor =
         m.LoadContextElement(native_context, Context::PROMISE_FUNCTION_INDEX);
 
-    const TNode<Oddball> debug_event = m.TrueConstant();
+    const TNode<True> debug_event = m.TrueConstant();
     const TNode<Object> capability =
         m.CallBuiltin(Builtin::kNewPromiseCapability, context,
                       promise_constructor, debug_event);
@@ -3070,19 +3072,19 @@ TEST(NewPromiseCapability) {
     FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
 
     Handle<Object> result_obj = ft.Call().ToHandleChecked();
-    CHECK(result_obj->IsPromiseCapability());
+    CHECK(IsPromiseCapability(*result_obj));
     Handle<PromiseCapability> result =
         Handle<PromiseCapability>::cast(result_obj);
 
-    CHECK(result->promise().IsJSPromise());
-    CHECK(result->resolve().IsJSFunction());
-    CHECK(result->reject().IsJSFunction());
+    CHECK(IsJSPromise(result->promise()));
+    CHECK(IsJSFunction(result->resolve()));
+    CHECK(IsJSFunction(result->reject()));
     CHECK_EQ(
         *isolate->factory()->promise_capability_default_reject_shared_fun(),
-        JSFunction::cast(result->reject()).shared());
+        JSFunction::cast(result->reject())->shared());
     CHECK_EQ(
         *isolate->factory()->promise_capability_default_resolve_shared_fun(),
-        JSFunction::cast(result->resolve()).shared());
+        JSFunction::cast(result->resolve())->shared());
 
     Handle<JSFunction> callbacks[] = {
         handle(JSFunction::cast(result->resolve()), isolate),
@@ -3109,7 +3111,7 @@ TEST(NewPromiseCapability) {
     auto context = m.GetJSContextParameter();
 
     auto constructor = m.Parameter<Object>(1);
-    const TNode<Oddball> debug_event = m.TrueConstant();
+    const TNode<True> debug_event = m.TrueConstant();
     const TNode<Object> capability = m.CallBuiltin(
         Builtin::kNewPromiseCapability, context, constructor, debug_event);
     m.Return(capability);
@@ -3126,16 +3128,16 @@ TEST(NewPromiseCapability) {
             "})")));
 
     Handle<Object> result_obj = ft.Call(constructor_fn).ToHandleChecked();
-    CHECK(result_obj->IsPromiseCapability());
+    CHECK(IsPromiseCapability(*result_obj));
     Handle<PromiseCapability> result =
         Handle<PromiseCapability>::cast(result_obj);
 
-    CHECK(result->promise().IsJSObject());
+    CHECK(IsJSObject(result->promise()));
     Handle<JSObject> promise(JSObject::cast(result->promise()), isolate);
     CHECK_EQ(constructor_fn->prototype_or_initial_map(kAcquireLoad),
              promise->map());
-    CHECK(result->resolve().IsJSFunction());
-    CHECK(result->reject().IsJSFunction());
+    CHECK(IsJSFunction(result->resolve()));
+    CHECK(IsJSFunction(result->reject()));
 
     Handle<String> resolved_str =
         isolate->factory()->NewStringFromAsciiChecked("resolvedStr");
@@ -3194,7 +3196,7 @@ TEST(DirectMemoryTest8BitWord32Immediate) {
   m.Return(m.SmiConstant(0));
 
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
-  CHECK_EQ(1, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(1, (*ft.CallChecked<Smi>()).value());
 }
 
 TEST(DirectMemoryTest16BitWord32Immediate) {
@@ -3226,7 +3228,7 @@ TEST(DirectMemoryTest16BitWord32Immediate) {
   m.Return(m.SmiConstant(0));
 
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
-  CHECK_EQ(1, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(1, (*ft.CallChecked<Smi>()).value());
 }
 
 TEST(DirectMemoryTest8BitWord32) {
@@ -3270,7 +3272,7 @@ TEST(DirectMemoryTest8BitWord32) {
   m.Return(m.SmiConstant(0));
 
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
-  CHECK_EQ(1, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(1, (*ft.CallChecked<Smi>()).value());
 }
 
 TEST(DirectMemoryTest16BitWord32) {
@@ -3326,7 +3328,7 @@ TEST(DirectMemoryTest16BitWord32) {
   m.Return(m.SmiConstant(0));
 
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
-  CHECK_EQ(1, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(1, (*ft.CallChecked<Smi>()).value());
 }
 
 TEST(LoadJSArrayElementsMap) {
@@ -3456,8 +3458,8 @@ TEST(IsNumberArrayIndex) {
   for (size_t i = 0; i < arraysize(indices); i++) {
     Handle<Object> index = isolate->factory()->NewNumber(indices[i]);
     uint32_t array_index;
-    CHECK_EQ(index->ToArrayIndex(&array_index),
-             (ft.CallChecked<Smi>(index)->value() == 1));
+    CHECK_EQ(Object::ToArrayIndex(*index, &array_index),
+             ((*ft.CallChecked<Smi>(index)).value() == 1));
   }
 }
 
@@ -3482,10 +3484,10 @@ TEST(NumberMinMax) {
   Handle<Smi> smi_1(Smi::FromInt(1), isolate);
   Handle<Smi> smi_2(Smi::FromInt(2), isolate);
   Handle<Smi> smi_5(Smi::FromInt(5), isolate);
-  CHECK_EQ(ft_min.CallChecked<Smi>(smi_1, smi_2)->value(), 1);
-  CHECK_EQ(ft_min.CallChecked<Smi>(smi_2, smi_1)->value(), 1);
-  CHECK_EQ(ft_max.CallChecked<Smi>(smi_1, smi_2)->value(), 2);
-  CHECK_EQ(ft_max.CallChecked<Smi>(smi_2, smi_1)->value(), 2);
+  CHECK_EQ((*ft_min.CallChecked<Smi>(smi_1, smi_2)).value(), 1);
+  CHECK_EQ((*ft_min.CallChecked<Smi>(smi_2, smi_1)).value(), 1);
+  CHECK_EQ((*ft_max.CallChecked<Smi>(smi_1, smi_2)).value(), 2);
+  CHECK_EQ((*ft_max.CallChecked<Smi>(smi_2, smi_1)).value(), 2);
 
   // Test double values.
   Handle<Object> double_a = isolate->factory()->NewNumber(2.5);
@@ -3537,8 +3539,8 @@ TEST(NumberAddSub) {
   // Test smi values.
   Handle<Smi> smi_1(Smi::FromInt(1), isolate);
   Handle<Smi> smi_2(Smi::FromInt(2), isolate);
-  CHECK_EQ(ft_add.CallChecked<Smi>(smi_1, smi_2)->value(), 3);
-  CHECK_EQ(ft_sub.CallChecked<Smi>(smi_2, smi_1)->value(), 1);
+  CHECK_EQ((*ft_add.CallChecked<Smi>(smi_1, smi_2)).value(), 3);
+  CHECK_EQ((*ft_sub.CallChecked<Smi>(smi_2, smi_1)).value(), 1);
 
   // Test double values.
   Handle<Object> double_a = isolate->factory()->NewNumber(2.5);
@@ -3573,8 +3575,8 @@ TEST(CloneEmptyFixedArray) {
 
   Handle<FixedArray> source(isolate->factory()->empty_fixed_array());
   Handle<Object> result_raw = ft.Call(source).ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
-  CHECK_EQ(0, result.length());
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
+  CHECK_EQ(0, result->length());
   CHECK_EQ(*(isolate->factory()->empty_fixed_array()), result);
 }
 
@@ -3591,13 +3593,13 @@ TEST(CloneFixedArray) {
   Handle<FixedArray> source(isolate->factory()->NewFixedArrayWithHoles(5));
   source->set(1, Smi::FromInt(1234));
   Handle<Object> result_raw = ft.Call(source).ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
-  CHECK_EQ(5, result.length());
-  CHECK(result.get(0).IsTheHole(isolate));
-  CHECK_EQ(Smi::cast(result.get(1)).value(), 1234);
-  CHECK(result.get(2).IsTheHole(isolate));
-  CHECK(result.get(3).IsTheHole(isolate));
-  CHECK(result.get(4).IsTheHole(isolate));
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
+  CHECK_EQ(5, result->length());
+  CHECK(IsTheHole(result->get(0), isolate));
+  CHECK_EQ(Smi::cast(result->get(1)).value(), 1234);
+  CHECK(IsTheHole(result->get(2), isolate));
+  CHECK(IsTheHole(result->get(3), isolate));
+  CHECK(IsTheHole(result->get(4), isolate));
 }
 
 TEST(CloneFixedArrayCOW) {
@@ -3614,7 +3616,7 @@ TEST(CloneFixedArrayCOW) {
   source->set(1, Smi::FromInt(1234));
   source->set_map(ReadOnlyRoots(isolate).fixed_cow_array_map());
   Handle<Object> result_raw = ft.Call(source).ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
   CHECK_EQ(*source, result);
 }
 
@@ -3638,14 +3640,14 @@ TEST(ExtractFixedArrayCOWForceCopy) {
   source->set(1, Smi::FromInt(1234));
   source->set_map(ReadOnlyRoots(isolate).fixed_cow_array_map());
   Handle<Object> result_raw = ft.Call(source).ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
   CHECK_NE(*source, result);
-  CHECK_EQ(5, result.length());
-  CHECK(result.get(0).IsTheHole(isolate));
-  CHECK_EQ(Smi::cast(result.get(1)).value(), 1234);
-  CHECK(result.get(2).IsTheHole(isolate));
-  CHECK(result.get(3).IsTheHole(isolate));
-  CHECK(result.get(4).IsTheHole(isolate));
+  CHECK_EQ(5, result->length());
+  CHECK(IsTheHole(result->get(0), isolate));
+  CHECK_EQ(Smi::cast(result->get(1)).value(), 1234);
+  CHECK(IsTheHole(result->get(2), isolate));
+  CHECK(IsTheHole(result->get(3), isolate));
+  CHECK(IsTheHole(result->get(4), isolate));
 }
 
 TEST(ExtractFixedArraySimple) {
@@ -3671,10 +3673,10 @@ TEST(ExtractFixedArraySimple) {
       ft.Call(source, Handle<Smi>(Smi::FromInt(1), isolate),
               Handle<Smi>(Smi::FromInt(2), isolate))
           .ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
-  CHECK_EQ(2, result.length());
-  CHECK_EQ(Smi::cast(result.get(0)).value(), 1234);
-  CHECK(result.get(1).IsTheHole(isolate));
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
+  CHECK_EQ(2, result->length());
+  CHECK_EQ(Smi::cast(result->get(0)).value(), 1234);
+  CHECK(IsTheHole(result->get(1), isolate));
 }
 
 TEST(ExtractFixedArraySimpleSmiConstant) {
@@ -3697,10 +3699,10 @@ TEST(ExtractFixedArraySimpleSmiConstant) {
   Handle<FixedArray> source(isolate->factory()->NewFixedArrayWithHoles(5));
   source->set(1, Smi::FromInt(1234));
   Handle<Object> result_raw = ft.Call(source).ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
-  CHECK_EQ(2, result.length());
-  CHECK_EQ(Smi::cast(result.get(0)).value(), 1234);
-  CHECK(result.get(1).IsTheHole(isolate));
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
+  CHECK_EQ(2, result->length());
+  CHECK_EQ(Smi::cast(result->get(0)).value(), 1234);
+  CHECK(IsTheHole(result->get(1), isolate));
 }
 
 TEST(ExtractFixedArraySimpleIntPtrConstant) {
@@ -3723,10 +3725,10 @@ TEST(ExtractFixedArraySimpleIntPtrConstant) {
   Handle<FixedArray> source(isolate->factory()->NewFixedArrayWithHoles(5));
   source->set(1, Smi::FromInt(1234));
   Handle<Object> result_raw = ft.Call(source).ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
-  CHECK_EQ(2, result.length());
-  CHECK_EQ(Smi::cast(result.get(0)).value(), 1234);
-  CHECK(result.get(1).IsTheHole(isolate));
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
+  CHECK_EQ(2, result->length());
+  CHECK_EQ(Smi::cast(result->get(0)).value(), 1234);
+  CHECK(IsTheHole(result->get(1), isolate));
 }
 
 TEST(ExtractFixedArraySimpleIntPtrConstantNoDoubles) {
@@ -3747,10 +3749,10 @@ TEST(ExtractFixedArraySimpleIntPtrConstantNoDoubles) {
   Handle<FixedArray> source(isolate->factory()->NewFixedArrayWithHoles(5));
   source->set(1, Smi::FromInt(1234));
   Handle<Object> result_raw = ft.Call(source).ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
-  CHECK_EQ(2, result.length());
-  CHECK_EQ(Smi::cast(result.get(0)).value(), 1234);
-  CHECK(result.get(1).IsTheHole(isolate));
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
+  CHECK_EQ(2, result->length());
+  CHECK_EQ(Smi::cast(result->get(0)).value(), 1234);
+  CHECK(IsTheHole(result->get(1), isolate));
 }
 
 TEST(ExtractFixedArraySimpleIntPtrParameters) {
@@ -3772,10 +3774,10 @@ TEST(ExtractFixedArraySimpleIntPtrParameters) {
       ft.Call(source, Handle<Smi>(Smi::FromInt(1), isolate),
               Handle<Smi>(Smi::FromInt(2), isolate))
           .ToHandleChecked();
-  FixedArray result(FixedArray::cast(*result_raw));
-  CHECK_EQ(2, result.length());
-  CHECK_EQ(Smi::cast(result.get(0)).value(), 1234);
-  CHECK(result.get(1).IsTheHole(isolate));
+  Tagged<FixedArray> result(FixedArray::cast(*result_raw));
+  CHECK_EQ(2, result->length());
+  CHECK_EQ(Smi::cast(result->get(0)).value(), 1234);
+  CHECK(IsTheHole(result->get(1), isolate));
 
   Handle<FixedDoubleArray> source_double = Handle<FixedDoubleArray>::cast(
       isolate->factory()->NewFixedDoubleArray(5));
@@ -3788,10 +3790,11 @@ TEST(ExtractFixedArraySimpleIntPtrParameters) {
       ft.Call(source_double, Handle<Smi>(Smi::FromInt(1), isolate),
               Handle<Smi>(Smi::FromInt(2), isolate))
           .ToHandleChecked();
-  FixedDoubleArray double_result = FixedDoubleArray::cast(*double_result_raw);
-  CHECK_EQ(2, double_result.length());
-  CHECK_EQ(double_result.get_scalar(0), 11);
-  CHECK_EQ(double_result.get_scalar(1), 12);
+  Tagged<FixedDoubleArray> double_result =
+      FixedDoubleArray::cast(*double_result_raw);
+  CHECK_EQ(2, double_result->length());
+  CHECK_EQ(double_result->get_scalar(0), 11);
+  CHECK_EQ(double_result->get_scalar(1), 12);
 }
 
 TEST(SingleInputPhiElimination) {
@@ -4042,8 +4045,8 @@ TEST(InstructionSchedulingCallerSavedRegisters) {
   FunctionTester ft(asm_tester.GenerateCode(options), kNumParams);
   Handle<Object> input = isolate->factory()->NewNumber(8);
   MaybeHandle<Object> result = ft.Call(input);
-  CHECK(result.ToHandleChecked()->IsSmi());
-  CHECK_EQ(result.ToHandleChecked()->Number(), 13);
+  CHECK(IsSmi(*result.ToHandleChecked()));
+  CHECK_EQ(Object::Number(*result.ToHandleChecked()), 13);
 
   v8_flags.turbo_instruction_scheduling = old_turbo_instruction_scheduling;
 }
@@ -4081,18 +4084,18 @@ TEST(WasmInt32ToHeapNumber) {
 
     FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
     Handle<Object> result = ft.Call().ToHandleChecked();
-    CHECK(result->IsNumber());
+    CHECK(IsNumber(*result));
     Handle<Object> expected(isolate->factory()->NewNumber(test_value));
-    CHECK(result->StrictEquals(*expected));
+    CHECK(Object::StrictEquals(*result, *expected));
   }
 }
 
 int32_t NumberToInt32(Handle<Object> number) {
-  if (number->IsSmi()) {
+  if (IsSmi(*number)) {
     return Smi::ToInt(*number);
   }
-  if (number->IsHeapNumber()) {
-    double num = HeapNumber::cast(*number).value();
+  if (IsHeapNumber(*number)) {
+    double num = HeapNumber::cast(*number)->value();
     return DoubleToInt32(num);
   }
   UNREACHABLE();
@@ -4167,11 +4170,11 @@ TEST(WasmFloat32ToNumber) {
 
     FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
     Handle<Object> result = ft.Call().ToHandleChecked();
-    CHECK(result->IsNumber());
+    CHECK(IsNumber(*result));
     Handle<Object> expected(isolate->factory()->NewNumber(test_value));
-    CHECK(result->StrictEquals(*expected) ||
-          (std::isnan(test_value) && std::isnan(result->Number())));
-    CHECK_EQ(result->IsSmi(), expected->IsSmi());
+    CHECK(Object::StrictEquals(*result, *expected) ||
+          (std::isnan(test_value) && std::isnan(Object::Number(*result))));
+    CHECK_EQ(IsSmi(*result), IsSmi(*expected));
   }
 }
 
@@ -4207,20 +4210,20 @@ TEST(WasmFloat64ToNumber) {
 
     FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
     Handle<Object> result = ft.Call().ToHandleChecked();
-    CHECK(result->IsNumber());
+    CHECK(IsNumber(*result));
     Handle<Object> expected(isolate->factory()->NewNumber(test_value));
-    CHECK(result->StrictEquals(*expected) ||
-          (std::isnan(test_value) && std::isnan(result->Number())));
-    CHECK_EQ(result->IsSmi(), expected->IsSmi());
+    CHECK(Object::StrictEquals(*result, *expected) ||
+          (std::isnan(test_value) && std::isnan(Object::Number(*result))));
+    CHECK_EQ(IsSmi(*result), IsSmi(*expected));
   }
 }
 
 double NumberToFloat64(Handle<Object> number) {
-  if (number->IsSmi()) {
+  if (IsSmi(*number)) {
     return Smi::ToInt(*number);
   }
-  if (number->IsHeapNumber()) {
-    return HeapNumber::cast(*number).value();
+  if (IsHeapNumber(*number)) {
+    return HeapNumber::cast(*number)->value();
   }
   UNREACHABLE();
 }
@@ -4416,8 +4419,9 @@ TEST(IntPtrMulHigh) {
   m.Return(m.SmiTag(res));
 
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK_EQ(-147694,
-           ft.CallChecked<Smi>(handle(Smi::FromInt(295387), isolate))->value());
+  CHECK_EQ(
+      -147694,
+      (*ft.CallChecked<Smi>(handle(Smi::FromInt(295387), isolate))).value());
   CHECK_EQ(-147694, base::bits::SignedMulHigh32(
                         std::numeric_limits<int32_t>::min(), 295387));
   CHECK_EQ(-147694, base::bits::SignedMulHigh64(
@@ -4435,7 +4439,7 @@ TEST(IntPtrMulHighConstantFoldable) {
   m.Return(m.SmiTag(res));
 
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK_EQ(-147694, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(-147694, (*ft.CallChecked<Smi>()).value());
   CHECK_EQ(-147694, base::bits::SignedMulHigh32(
                         std::numeric_limits<int32_t>::min(), 295387));
   CHECK_EQ(-147694, base::bits::SignedMulHigh64(
@@ -4455,8 +4459,9 @@ TEST(UintPtrMulHigh) {
   m.Return(m.SmiTag(res));
 
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK_EQ(147693,
-           ft.CallChecked<Smi>(handle(Smi::FromInt(295387), isolate))->value());
+  CHECK_EQ(
+      147693,
+      (*ft.CallChecked<Smi>(handle(Smi::FromInt(295387), isolate))).value());
   CHECK_EQ(147693, base::bits::UnsignedMulHigh32(
                        std::numeric_limits<int32_t>::min(), 295387));
   CHECK_EQ(147693, base::bits::UnsignedMulHigh64(
@@ -4474,7 +4479,7 @@ TEST(UintPtrMulHighConstantFoldable) {
   m.Return(m.SmiTag(res));
 
   FunctionTester ft(asm_tester.GenerateCode());
-  CHECK_EQ(147693, ft.CallChecked<Smi>()->value());
+  CHECK_EQ(147693, (*ft.CallChecked<Smi>()).value());
   CHECK_EQ(
       147693,
       base::bits::UnsignedMulHigh32(
@@ -4501,18 +4506,14 @@ TEST(IntPtrMulWithOverflow) {
     m.Return(m.SelectBooleanConstant(overflow));
 
     FunctionTester ft(asm_tester.GenerateCode());
-    CHECK(ft.Call(handle(Smi::FromInt(-1), isolate))
-              .ToHandleChecked()
-              ->IsTrue(isolate));
-    CHECK(ft.Call(handle(Smi::FromInt(1), isolate))
-              .ToHandleChecked()
-              ->IsFalse(isolate));
-    CHECK(ft.Call(handle(Smi::FromInt(2), isolate))
-              .ToHandleChecked()
-              ->IsTrue(isolate));
-    CHECK(ft.Call(handle(Smi::FromInt(0), isolate))
-              .ToHandleChecked()
-              ->IsFalse(isolate));
+    CHECK(IsTrue(*ft.Call(handle(Smi::FromInt(-1), isolate)).ToHandleChecked(),
+                 isolate));
+    CHECK(IsFalse(*ft.Call(handle(Smi::FromInt(1), isolate)).ToHandleChecked(),
+                  isolate));
+    CHECK(IsTrue(*ft.Call(handle(Smi::FromInt(2), isolate)).ToHandleChecked(),
+                 isolate));
+    CHECK(IsFalse(*ft.Call(handle(Smi::FromInt(0), isolate)).ToHandleChecked(),
+                  isolate));
   }
 
   {
@@ -4526,15 +4527,12 @@ TEST(IntPtrMulWithOverflow) {
     m.Return(m.SelectBooleanConstant(overflow));
 
     FunctionTester ft(asm_tester.GenerateCode());
-    CHECK(ft.Call(handle(Smi::FromInt(-1), isolate))
-              .ToHandleChecked()
-              ->IsFalse(isolate));
-    CHECK(ft.Call(handle(Smi::FromInt(1), isolate))
-              .ToHandleChecked()
-              ->IsFalse(isolate));
-    CHECK(ft.Call(handle(Smi::FromInt(2), isolate))
-              .ToHandleChecked()
-              ->IsTrue(isolate));
+    CHECK(IsFalse(*ft.Call(handle(Smi::FromInt(-1), isolate)).ToHandleChecked(),
+                  isolate));
+    CHECK(IsFalse(*ft.Call(handle(Smi::FromInt(1), isolate)).ToHandleChecked(),
+                  isolate));
+    CHECK(IsTrue(*ft.Call(handle(Smi::FromInt(2), isolate)).ToHandleChecked(),
+                 isolate));
   }
 }
 
diff --git a/deps/v8/test/cctest/test-cpu-profiler.cc b/deps/v8/test/cctest/test-cpu-profiler.cc
index 09b0d0541ff660..110f0bf0cb77c9 100644
--- a/deps/v8/test/cctest/test-cpu-profiler.cc
+++ b/deps/v8/test/cctest/test-cpu-profiler.cc
@@ -43,6 +43,8 @@
 #include "src/codegen/source-position-table.h"
 #include "src/deoptimizer/deoptimize-reason.h"
 #include "src/execution/embedder-state.h"
+#include "src/execution/protectors-inl.h"
+#include "src/flags/flags.h"
 #include "src/heap/spaces.h"
 #include "src/init/v8.h"
 #include "src/libsampler/sampler.h"
@@ -200,13 +202,13 @@ TEST(CodeEvents) {
                                     comment2_code, "comment2");
 
   PtrComprCageBase cage_base(isolate);
-  if (comment2_code->IsBytecodeArray(cage_base)) {
+  if (IsBytecodeArray(*comment2_code, cage_base)) {
     profiler_listener.BytecodeMoveEvent(comment2_code->GetBytecodeArray(),
                                         moved_code->GetBytecodeArray());
   } else {
     profiler_listener.CodeMoveEvent(
-        comment2_code->GetCode().instruction_stream(),
-        moved_code->GetCode().instruction_stream());
+        comment2_code->GetCode()->instruction_stream(),
+        moved_code->GetCode()->instruction_stream());
   }
 
   // Enqueue a tick event to enable code events processing.
@@ -1251,13 +1253,17 @@ TEST(BoundFunctionCall) {
 
 // This tests checks distribution of the samples through the source lines.
 static void TickLines(bool optimize) {
+  if (optimize && !v8_flags.turbofan) return;
+
 #if !defined(V8_LITE_MODE) && defined(V8_ENABLE_TURBOFAN)
   v8_flags.turbofan = optimize;
 #ifdef V8_ENABLE_MAGLEV
   // TODO(v8:7700): Also test maglev here.
   v8_flags.maglev = false;
+  v8_flags.optimize_on_next_call_optimizes_to_maglev = false;
 #endif  // V8_ENABLE_MAGLEV
 #endif  // !defined(V8_LITE_MODE) && defined(V8_ENABLE_TURBOFAN)
+
   CcTest::InitializeVM();
   LocalContext env;
   i::v8_flags.allow_natives_syntax = true;
@@ -1277,6 +1283,9 @@ static void TickLines(bool optimize) {
                    func_name);
     base::SNPrintF(optimize_call, "%%OptimizeFunctionOnNextCall(%s);\n",
                    func_name);
+  } else if (v8_flags.sparkplug) {
+    base::SNPrintF(prepare_opt, "%%CompileBaseline(%s);\n", func_name);
+    optimize_call[0] = '\0';
   } else {
     prepare_opt[0] = '\0';
     optimize_call[0] = '\0';
@@ -1284,7 +1293,7 @@ static void TickLines(bool optimize) {
   base::SNPrintF(script,
                  "function %s() {\n"
                  "  var n = 0;\n"
-                 "  var m = 100*100;\n"
+                 "  var m = 20;\n"
                  "  while (m > 1) {\n"
                  "    m--;\n"
                  "    n += m * m * m;\n"
@@ -1302,7 +1311,7 @@ static void TickLines(bool optimize) {
   i::Handle<i::JSFunction> func = i::Handle<i::JSFunction>::cast(
       v8::Utils::OpenHandle(*GetFunction(env.local(), func_name)));
   CHECK(!func->shared().is_null());
-  CHECK(!func->shared().abstract_code(isolate).is_null());
+  CHECK(!func->shared()->abstract_code(isolate).is_null());
   CHECK(!optimize || func->HasAttachedOptimizedCode() ||
         !CcTest::i_isolate()->use_optimizer());
   i::Handle<i::AbstractCode> code(func->abstract_code(isolate), isolate);
@@ -1426,7 +1435,7 @@ TEST(FunctionCallSample) {
 
   // Collect garbage that might have be generated while installing
   // extensions.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
   CompileRun(call_function_test_source);
   v8::Local<v8::Function> function = GetFunction(env.local(), "start");
@@ -1866,6 +1875,9 @@ static const char* inlining_test_source =
 //              action #16 7
 //      (program) #0 2
 TEST(Inlining) {
+  if (!v8_flags.turbofan) return;
+  if (v8_flags.optimize_on_next_call_optimizes_to_maglev) return;
+
   i::v8_flags.allow_natives_syntax = true;
   v8::HandleScope scope(CcTest::isolate());
   v8::Local<v8::Context> env = CcTest::NewContext({PROFILER_EXTENSION_ID});
@@ -1962,6 +1974,8 @@ static const char* inlining_test_source2 = R"(
 //                        bailed out due to 'Optimization is always disabled'
 //     2    (program):0 0 #2
 TEST(Inlining2) {
+  if (!v8_flags.turbofan) return;
+  if (v8_flags.optimize_on_next_call_optimizes_to_maglev) return;
   // Skip test if concurrent sparkplug is enabled. The test becomes flaky,
   // since it requires a precise trace.
   if (v8_flags.concurrent_sparkplug) return;
@@ -2530,8 +2544,9 @@ const char* GetBranchDeoptReason(v8::Local<v8::Context> context,
 
 // deopt at top function
 TEST(CollectDeoptEvents) {
-  if (!CcTest::i_isolate()->use_optimizer() || i::v8_flags.always_turbofan)
+  if (!CcTest::i_isolate()->use_optimizer() || i::v8_flags.always_turbofan) {
     return;
+  }
   i::v8_flags.allow_natives_syntax = true;
   v8::HandleScope scope(CcTest::isolate());
   v8::Local<v8::Context> env = CcTest::NewContext({PROFILER_EXTENSION_ID});
@@ -2639,8 +2654,12 @@ TEST(CollectDeoptEvents) {
   }
   {
     const char* branch[] = {"", "opt_function2", "opt_function2"};
-    CHECK_EQ(reason(i::DeoptimizeReason::kDivisionByZero),
-             GetBranchDeoptReason(env, iprofile, branch, arraysize(branch)));
+    const char* deopt_reason =
+        GetBranchDeoptReason(env, iprofile, branch, arraysize(branch));
+    if (deopt_reason != reason(i::DeoptimizeReason::kDivisionByZero) &&
+        deopt_reason != reason(i::DeoptimizeReason::kNotInt32)) {
+      FATAL("%s", deopt_reason);
+    }
   }
   iprofiler->DeleteProfile(iprofile);
 }
@@ -2878,6 +2897,28 @@ namespace {
 #ifdef V8_USE_PERFETTO
 class CpuProfilerListener : public platform::tracing::TraceEventListener {
  public:
+  void ParseFromArray(const std::vector<char>& array) {
+    perfetto::protos::Trace trace;
+    CHECK(trace.ParseFromArray(array.data(), static_cast<int>(array.size())));
+
+    for (int i = 0; i < trace.packet_size(); i++) {
+      // TODO(petermarshall): ChromeTracePacket instead.
+      const perfetto::protos::TracePacket& packet = trace.packet(i);
+      ProcessPacket(packet);
+    }
+  }
+
+  const std::string& result_json() {
+    result_json_ += "]";
+    return result_json_;
+  }
+  void Reset() {
+    result_json_.clear();
+    profile_id_ = 0;
+    sequence_state_.clear();
+  }
+
+ private:
   void ProcessPacket(const ::perfetto::protos::TracePacket& packet) {
     auto& seq_state = sequence_state_[packet.trusted_packet_sequence_id()];
     if (packet.incremental_state_cleared()) seq_state = SequenceState{};
@@ -2906,17 +2947,6 @@ class CpuProfilerListener : public platform::tracing::TraceEventListener {
     result_json_ += track_event.debug_annotations()[0].legacy_json_value();
   }
 
-  const std::string& result_json() {
-    result_json_ += "]";
-    return result_json_;
-  }
-  void Reset() {
-    result_json_.clear();
-    profile_id_ = 0;
-    sequence_state_.clear();
-  }
-
- private:
   std::string result_json_;
   uint64_t profile_id_ = 0;
 
@@ -4149,7 +4179,9 @@ TEST(EmbedderStatePropagateNativeContextMove) {
     return;
   }
   i::v8_flags.allow_natives_syntax = true;
-  i::v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   LocalContext execution_env;
   i::HandleScope scope(CcTest::i_isolate());
 
@@ -4181,9 +4213,13 @@ TEST(EmbedderStatePropagateNativeContextMove) {
             [](const v8::FunctionCallbackInfo<v8::Value>& info) {
               i::Isolate* isolate =
                   reinterpret_cast<i::Isolate*>(info.GetIsolate());
+              // We need to invoke GC without stack, otherwise no compaction is
+              // performed.
+              DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+                  isolate->heap());
               i::heap::ForceEvacuationCandidate(
                   i::Page::FromHeapObject(isolate->raw_native_context()));
-              CcTest::CollectAllGarbage();
+              heap::InvokeMajorGC(isolate->heap());
             });
     v8::Local<v8::Function> move_func =
         move_func_template->GetFunction(execution_env.local()).ToLocalChecked();
@@ -4220,7 +4256,9 @@ TEST(EmbedderStatePropagateNativeContextMove) {
 TEST(ContextFilterMovedNativeContext) {
   if (i::v8_flags.enable_third_party_heap) return;
   i::v8_flags.allow_natives_syntax = true;
-  i::v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   LocalContext env;
   i::HandleScope scope(CcTest::i_isolate());
 
@@ -4244,7 +4282,7 @@ TEST(ContextFilterMovedNativeContext) {
                   reinterpret_cast<i::Isolate*>(info.GetIsolate());
               i::heap::ForceEvacuationCandidate(
                   i::Page::FromHeapObject(isolate->raw_native_context()));
-              CcTest::CollectAllGarbage();
+              heap::InvokeMajorGC(isolate->heap());
             });
     v8::Local<v8::Function> move_func =
         move_func_template->GetFunction(env.local()).ToLocalChecked();
@@ -4335,7 +4373,7 @@ UNINITIALIZED_TEST(DetailedSourcePositionAPI) {
     int detailed_positions = GetSourcePositionEntryCount(i_isolate, source);
 
     CHECK((non_detailed_positions == -1 && detailed_positions == -1) ||
-          non_detailed_positions < detailed_positions);
+          non_detailed_positions <= detailed_positions);
   }
 
   isolate->Dispose();
@@ -4397,8 +4435,8 @@ UNINITIALIZED_TEST(DetailedSourcePositionAPI_Inlining) {
     if (non_detailed_positions == -1) {
       CHECK_EQ(non_detailed_positions, detailed_positions);
     } else {
-      CHECK_LT(non_detailed_positions, detailed_positions);
-      CHECK_LT(non_detailed_inlined_positions, detailed_inlined_positions);
+      CHECK_LE(non_detailed_positions, detailed_positions);
+      CHECK_LE(non_detailed_inlined_positions, detailed_inlined_positions);
     }
   }
 
@@ -4488,6 +4526,111 @@ TEST(CanStartStopProfilerWithTitlesAndIds) {
   CHECK_EQ(anonymous_id_2, profile_with_id_2->id());
 }
 
+TEST(NoProfilingProtectorCPUProfiler) {
+#if !defined(V8_LITE_MODE) &&                                     \
+    (defined(V8_ENABLE_TURBOFAN) || defined(V8_ENABLE_MAGLEV)) && \
+    !defined(USE_SIMULATOR)
+  if (i::v8_flags.jitless) return;
+
+#ifdef V8_ENABLE_TURBOFAN
+  FLAG_SCOPE(turbofan);
+#endif
+#ifdef V8_ENABLE_MAGLEV
+  FLAG_SCOPE(maglev);
+#endif
+  FLAG_SCOPE(allow_natives_syntax);
+
+  CcTest::InitializeVM();
+  LocalContext env;
+  v8::Isolate* isolate = CcTest::isolate();
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
+  i::HandleScope scope(i_isolate);
+
+  Local<v8::FunctionTemplate> receiver_templ = v8::FunctionTemplate::New(
+      isolate,
+      [](const v8::FunctionCallbackInfo<v8::Value>& info) {
+        CHECK(i::ValidateCallbackInfo(info));
+        // Artificially slow down the callback with a predictable amount of
+        // time. This ensures the test has a relatively stable run time on
+        // various platforms and protects it from flakyness.
+        v8::base::OS::Sleep(v8::base::TimeDelta::FromMilliseconds(100));
+      },
+      v8::Local<v8::Value>(), v8::Local<v8::Signature>(), 1,
+      v8::ConstructorBehavior::kThrow, v8::SideEffectType::kHasSideEffect);
+
+  v8::Local<v8::ObjectTemplate> object_template =
+      v8::ObjectTemplate::New(isolate);
+  const char* api_func_str = "api_func";
+  object_template->Set(isolate, api_func_str, receiver_templ);
+
+  v8::Local<v8::Object> object =
+      object_template->NewInstance(env.local()).ToLocalChecked();
+
+  env->Global()->Set(env.local(), v8_str("receiver"), object).Check();
+
+  // Prepare the code.
+  v8::Local<v8::Function> function = CreateApiCode(&env);
+  Handle<JSFunction> i_function =
+      Handle<JSFunction>::cast(v8::Utils::OpenHandle(*function));
+
+  CHECK(!i_function->code()->is_optimized_code());
+  CompileRun("foo(42);");
+
+  Handle<Code> code(i_function->code(), i_isolate);
+  CHECK(code->is_optimized_code());
+  CHECK(!code->marked_for_deoptimization());
+  CHECK(Protectors::IsNoProfilingIntact(i_isolate));
+
+  // Setup and start CPU profiler.
+  int num_runs_arg = 100;
+  v8::Local<v8::Value> args[] = {
+      v8::Integer::New(env->GetIsolate(), num_runs_arg)};
+  ProfilerHelper helper(env.local(), kEagerLogging);
+  // Run some code to ensure that interrupt request that should invalidate
+  // NoProfilingProtector is processed.
+  CompileRun("(function () {})();");
+
+  // Enabling of the profiler should trigger code deoptimization.
+  CHECK(!Protectors::IsNoProfilingIntact(i_isolate));
+  CHECK(code->marked_for_deoptimization());
+
+  // Optimize function again, now it should be compiled with support for
+  // Api functions profiling.
+  CompileRun("%OptimizeFunctionOnNextCall(foo); foo(55);");
+
+  unsigned external_samples = 1000;
+  v8::CpuProfile* profile =
+      helper.Run(function, args, arraysize(args), 0, external_samples);
+
+  // Check that generated profile has the expected structure.
+  const v8::CpuProfileNode* root = profile->GetTopDownRoot();
+  const v8::CpuProfileNode* foo_node = GetChild(env.local(), root, "foo");
+  const v8::CpuProfileNode* api_func_node =
+      GetChild(env.local(), foo_node, api_func_str);
+  CHECK_NOT_NULL(api_func_node);
+  CHECK_EQ(api_func_node->GetSourceType(), CpuProfileNode::kCallback);
+  // Ensure the API function frame appears only once in the stack trace.
+  const v8::CpuProfileNode* api_func_node2 =
+      FindChild(env.local(), api_func_node, api_func_str);
+  CHECK_NULL(api_func_node2);
+
+  int foo_ticks = foo_node->GetHitCount();
+  int api_func_ticks = api_func_node->GetHitCount();
+  // Check that at least 80% of the samples in foo hit the fast callback.
+  CHECK_LE(foo_ticks, api_func_ticks * 0.2);
+  // The following constant in the CHECK is because above we expect at least
+  // 1000 samples with EXTERNAL type (see external_samples). Since the only
+  // thing that generates those kind of samples is the fast callback, then
+  // we're supposed to have close to 1000 ticks in its node. Since the CPU
+  // profiler is nondeterministic, we've allowed for some slack, otherwise
+  // this could be 1000 instead of 800.
+  CHECK_GE(api_func_ticks, 800);
+
+  profile->Delete();
+#endif  // !defined(V8_LITE_MODE) &&
+        // (defined(V8_ENABLE_TURBOFAN) || defined(V8_ENABLE_MAGLEV))
+}
+
 TEST(FastApiCPUProfiler) {
 #if !defined(V8_LITE_MODE) && !defined(USE_SIMULATOR) && \
     defined(V8_ENABLE_TURBOFAN)
@@ -4501,6 +4644,10 @@ TEST(FastApiCPUProfiler) {
   // feedback to go down the "best optimization" path for the fast call.
   FLAG_VALUE_SCOPE(always_turbofan, false);
   FLAG_VALUE_SCOPE(prof_browser_mode, false);
+#if V8_ENABLE_MAGLEV
+  FLAG_VALUE_SCOPE(maglev, false);
+  FLAG_VALUE_SCOPE(optimize_on_next_call_optimizes_to_maglev, false);
+#endif
 
   CcTest::InitializeVM();
   LocalContext env;
@@ -4562,6 +4709,10 @@ TEST(FastApiCPUProfiler) {
       GetChild(env.local(), foo_node, api_func_str);
   CHECK_NOT_NULL(api_func_node);
   CHECK_EQ(api_func_node->GetSourceType(), CpuProfileNode::kCallback);
+  // Ensure the API function frame appears only once in the stack trace.
+  const v8::CpuProfileNode* api_func_node2 =
+      FindChild(env.local(), api_func_node, api_func_str);
+  CHECK_NULL(api_func_node2);
 
   // Check that the CodeEntry is the expected one, i.e. the fast callback.
   CodeEntry* code_entry =
@@ -4638,29 +4789,26 @@ TEST(BytecodeFlushEventsEagerLogging) {
     Handle<Object> func_value =
         Object::GetProperty(i_isolate, i_isolate->global_object(), foo_name)
             .ToHandleChecked();
-    CHECK(func_value->IsJSFunction());
+    CHECK(IsJSFunction(*func_value));
     Handle<JSFunction> function = Handle<JSFunction>::cast(func_value);
-    CHECK(function->shared().is_compiled());
+    CHECK(function->shared()->is_compiled());
 
     i::BytecodeArray compiled_data =
-        function->shared().GetBytecodeArray(i_isolate);
-    i::Address bytecode_start = compiled_data.GetFirstBytecodeAddress();
+        function->shared()->GetBytecodeArray(i_isolate);
+    i::Address bytecode_start = compiled_data->GetFirstBytecodeAddress();
 
     CHECK(instruction_stream_map->FindEntry(bytecode_start));
 
     // The code will survive at least two GCs.
-    CcTest::CollectAllGarbage();
-    CcTest::CollectAllGarbage();
-    CHECK(function->shared().is_compiled());
-
-    // Simulate several GCs that use full marking.
-    const int kAgingThreshold = 6;
-    for (int i = 0; i < kAgingThreshold; i++) {
-      CcTest::CollectAllGarbage();
-    }
+    heap::InvokeMajorGC(CcTest::heap());
+    heap::InvokeMajorGC(CcTest::heap());
+    CHECK(function->shared()->is_compiled());
+
+    i::SharedFunctionInfo::EnsureOldForTesting(function->shared());
+    heap::InvokeMajorGC(CcTest::heap());
 
     // foo should no longer be in the compilation cache
-    CHECK(!function->shared().is_compiled());
+    CHECK(!function->shared()->is_compiled());
     CHECK(!function->is_compiled());
 
     CHECK(!instruction_stream_map->FindEntry(bytecode_start));
@@ -4706,7 +4854,7 @@ TEST(ClearUnusedWithEagerLogging) {
   // given two functions.
   isolate->compilation_cache()->Clear();
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
   // Verify that the InstructionStreamMap's size is unchanged post-GC.
   CHECK_EQ(instruction_stream_map->size(), initial_size);
diff --git a/deps/v8/test/cctest/test-debug-helper.cc b/deps/v8/test/cctest/test-debug-helper.cc
index e8b4f3365b0bb6..809a6b9ba6fbe8 100644
--- a/deps/v8/test/cctest/test-debug-helper.cc
+++ b/deps/v8/test/cctest/test-debug-helper.cc
@@ -134,7 +134,7 @@ TEST(GetObjectProperties) {
   v8::Local<v8::Value> v = CompileRun("42");
   Handle<Object> o = v8::Utils::OpenHandle(*v);
   d::ObjectPropertiesResultPtr props =
-      d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+      d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
   CHECK(props->type_check_result == d::TypeCheckResult::kSmi);
   CHECK(props->brief == std::string("42 (0x2a)"));
   CHECK(props->type == std::string("v8::internal::Smi"));
@@ -142,7 +142,7 @@ TEST(GetObjectProperties) {
 
   v = CompileRun("[\"a\", \"bc\"]");
   o = v8::Utils::OpenHandle(*v);
-  props = d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+  props = d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
   CHECK(props->type_check_result == d::TypeCheckResult::kUsedMap);
   CHECK(props->type == std::string("v8::internal::JSArray"));
   CHECK_EQ(props->num_properties, 4);
@@ -155,7 +155,7 @@ TEST(GetObjectProperties) {
 
   // We need to supply some valid address for decompression before reading the
   // elements from the JSArray.
-  heap_addresses.any_heap_pointer = o->ptr();
+  heap_addresses.any_heap_pointer = (*o).ptr();
 
   i::Tagged_t properties_or_hash =
       *reinterpret_cast<i::Tagged_t*>(props->properties[1]->address);
@@ -293,7 +293,7 @@ TEST(GetObjectProperties) {
     const alphabet = "abcdefghijklmnopqrstuvwxyz";
     alphabet.substr(3,20) + alphabet.toUpperCase().substr(5,15) + "7")");
   o = v8::Utils::OpenHandle(*v);
-  props = d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+  props = d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
   CHECK(Contains(props->brief, "\"defghijklmnopqrstuvwFGHIJKLMNOPQRST7\""));
 
   // Cause a failure when reading the "second" pointer within the top-level
@@ -302,33 +302,38 @@ TEST(GetObjectProperties) {
     CheckProp(*props->properties[4], "v8::internal::String", "second");
     uintptr_t second_address = props->properties[4]->address;
     MemoryFailureRegion failure(second_address, second_address + 4);
-    props = d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+    props = d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
     CHECK(Contains(props->brief, "\"defghijklmnopqrstuvwFGHIJKLMNOPQRST...\""));
   }
 
   // Build a very long string.
   v = CompileRun("'a'.repeat(1000)");
   o = v8::Utils::OpenHandle(*v);
-  props = d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+  props = d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
   CHECK(Contains(props->brief, "\"" + std::string(80, 'a') + "...\""));
 
   // GetObjectProperties can read cacheable external strings.
+  StringResource* string_resource = new StringResource(true);
   auto external_string =
-      v8::String::NewExternalTwoByte(isolate, new StringResource(true));
+      v8::String::NewExternalTwoByte(isolate, string_resource);
   o = v8::Utils::OpenHandle(*external_string.ToLocalChecked());
-  props = d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+  props = d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
   CHECK(Contains(props->brief, "\"abcde\""));
+  CheckProp(*props->properties[5], "char16_t", "raw_characters",
+            d::PropertyKind::kArrayOfKnownSize, string_resource->length());
+  CHECK_EQ(props->properties[5]->address,
+           reinterpret_cast<uintptr_t>(string_resource->data()));
   // GetObjectProperties cannot read uncacheable external strings.
   external_string =
       v8::String::NewExternalTwoByte(isolate, new StringResource(false));
   o = v8::Utils::OpenHandle(*external_string.ToLocalChecked());
-  props = d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+  props = d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
   CHECK_EQ(std::string(props->brief).find("\""), std::string::npos);
 
   // Build a basic JS object and get its properties.
   v = CompileRun("({a: 1, b: 2})");
   o = v8::Utils::OpenHandle(*v);
-  props = d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+  props = d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
 
   // Objects constructed from literals get their properties placed inline, so
   // the GetObjectProperties response should include an array.
@@ -379,7 +384,7 @@ TEST(GetObjectProperties) {
   // exercise bitfield functionality.
   v = CompileRun("(function () {})");
   o = v8::Utils::OpenHandle(*v);
-  props = d::GetObjectProperties(o->ptr(), &ReadMemory, heap_addresses);
+  props = d::GetObjectProperties((*o).ptr(), &ReadMemory, heap_addresses);
   props = d::GetObjectProperties(
       ReadProp<i::Tagged_t>(*props, "shared_function_info"), &ReadMemory,
       heap_addresses);
@@ -436,16 +441,16 @@ static void FrameIterationCheck(
       auto js_function = js_frame->function();
       CheckProp(*props->properties[0], "v8::internal::JSFunction",
                 "currently_executing_jsfunction", js_function.ptr());
-      auto shared_function_info = js_function.shared();
-      auto script = i::Script::cast(shared_function_info.script());
+      auto shared_function_info = js_function->shared();
+      auto script = i::Script::cast(shared_function_info->script());
       CheckProp(*props->properties[1], "v8::internal::Object", "script_name",
-                static_cast<i::Tagged_t>(script.name().ptr()));
+                static_cast<i::Tagged_t>(script->name().ptr()));
       CheckProp(*props->properties[2], "v8::internal::Object", "script_source",
-                static_cast<i::Tagged_t>(script.source().ptr()));
+                static_cast<i::Tagged_t>(script->source().ptr()));
 
-      auto scope_info = shared_function_info.scope_info();
+      auto scope_info = shared_function_info->scope_info();
       CheckProp(*props->properties[3], "v8::internal::Object", "function_name",
-                static_cast<i::Tagged_t>(scope_info.FunctionName().ptr()));
+                static_cast<i::Tagged_t>(scope_info->FunctionName().ptr()));
 
       CheckProp(*props->properties[4], "", "function_character_offset");
       const d::ObjectProperty& function_character_offset =
diff --git a/deps/v8/test/cctest/test-debug.cc b/deps/v8/test/cctest/test-debug.cc
index f8f8e6a8a6205b..d3cecd7e670bf9 100644
--- a/deps/v8/test/cctest/test-debug.cc
+++ b/deps/v8/test/cctest/test-debug.cc
@@ -43,6 +43,7 @@
 #include "src/objects/objects-inl.h"
 #include "src/utils/utils.h"
 #include "test/cctest/cctest.h"
+#include "test/cctest/heap/heap-utils.h"
 
 using ::v8::internal::Handle;
 using ::v8::internal::StepInto;  // From StepAction enum
@@ -76,8 +77,7 @@ static v8::Local<v8::Function> CompileFunction(LocalContext* env,
 static bool HasBreakInfo(v8::Local<v8::Function> fun) {
   Handle<v8::internal::JSFunction> f =
       Handle<v8::internal::JSFunction>::cast(v8::Utils::OpenHandle(*fun));
-  Handle<v8::internal::SharedFunctionInfo> shared(f->shared(), f->GetIsolate());
-  return shared->HasBreakInfo();
+  return f->shared()->HasBreakInfo(f->GetIsolate());
 }
 
 // Set a break point in a function with a position relative to function start,
@@ -87,7 +87,7 @@ static i::Handle<i::BreakPoint> SetBreakPoint(v8::Local<v8::Function> fun,
                                               const char* condition = nullptr) {
   i::Handle<i::JSFunction> function =
       i::Handle<i::JSFunction>::cast(v8::Utils::OpenHandle(*fun));
-  position += function->shared().StartPosition();
+  position += function->shared()->StartPosition();
   static int break_point_index = 0;
   i::Isolate* isolate = function->GetIsolate();
   i::Handle<i::String> condition_string =
@@ -130,51 +130,41 @@ static void PrepareStep(i::StepAction step_action) {
 namespace v8 {
 namespace internal {
 
-// Collect the currently debugged functions.
 Handle<FixedArray> GetDebuggedFunctions() {
-  Debug* debug = CcTest::i_isolate()->debug();
-
-  v8::internal::DebugInfoListNode* node = debug->debug_info_list_;
-
-  // Find the number of debugged functions.
-  int count = 0;
-  while (node) {
-    count++;
-    node = node->next();
-  }
+  i::Isolate* isolate = CcTest::i_isolate();
+  DebugInfoCollection* infos = &isolate->debug()->debug_infos_;
 
-  // Allocate array for the debugged functions
+  int count = static_cast<int>(infos->Size());
   Handle<FixedArray> debugged_functions =
       CcTest::i_isolate()->factory()->NewFixedArray(count);
 
-  // Run through the debug info objects and collect all functions.
-  count = 0;
-  while (node) {
-    debugged_functions->set(count++, *node->debug_info());
-    node = node->next();
+  int i = 0;
+  DebugInfoCollection::Iterator it(infos);
+  for (; it.HasNext(); it.Advance()) {
+    Handle<DebugInfo> debug_info(it.Next(), isolate);
+    debugged_functions->set(i++, *debug_info);
   }
 
   return debugged_functions;
 }
 
-
 // Check that the debugger has been fully unloaded.
 void CheckDebuggerUnloaded() {
   // Check that the debugger context is cleared and that there is no debug
   // information stored for the debugger.
-  CHECK(!CcTest::i_isolate()->debug()->debug_info_list_);
+  CHECK_EQ(CcTest::i_isolate()->debug()->debug_infos_.Size(), 0);
 
   // Collect garbage to ensure weak handles are cleared.
   i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
       CcTest::heap());
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
+  heap::InvokeMajorGC(CcTest::heap());
 
   // Iterate the heap and check that there are no debugger related objects left.
   HeapObjectIterator iterator(CcTest::heap());
-  for (HeapObject obj = iterator.Next(); !obj.is_null();
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    CHECK(!obj.IsDebugInfo());
+    CHECK(!IsDebugInfo(obj));
   }
 }
 
@@ -228,10 +218,10 @@ class DebugEventBreakPointCollectGarbage : public v8::debug::DebugDelegate {
     break_point_hit_count++;
     if (break_point_hit_count % 2 == 0) {
       // Scavenge.
-      CcTest::CollectGarbage(v8::internal::NEW_SPACE);
+      i::heap::InvokeMinorGC(CcTest::heap());
     } else {
       // Mark sweep compact.
-      CcTest::CollectAllGarbage();
+      i::heap::InvokeMajorGC(CcTest::heap());
     }
   }
 };
@@ -248,7 +238,7 @@ class DebugEventBreak : public v8::debug::DebugDelegate {
 
     // Run the garbage collector to enforce heap verification if option
     // --verify-heap is set.
-    CcTest::CollectGarbage(v8::internal::NEW_SPACE);
+    i::heap::InvokeMinorGC(CcTest::heap());
 
     // Set the break flag again to come back here as soon as possible.
     v8::debug::SetBreakOnNextFunctionCall(CcTest::isolate());
@@ -1067,8 +1057,9 @@ TEST(BreakPointBuiltinNewContext) {
   CheckDebuggerUnloaded();
 }
 
-void NoOpFunctionCallback(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().Set(v8_num(2));
+void NoOpFunctionCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(v8_num(2));
 }
 
 TEST(BreakPointApiFunction) {
@@ -1153,11 +1144,12 @@ TEST(BreakPointApiConstructor) {
   CheckDebuggerUnloaded();
 }
 
-void GetWrapperCallback(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().Set(
-      args[0]
+void GetWrapperCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(
+      info[0]
           .As<v8::Object>()
-          ->Get(args.GetIsolate()->GetCurrentContext(), args[1])
+          ->Get(info.GetIsolate()->GetCurrentContext(), info[1])
           .ToLocalChecked());
 }
 
@@ -1207,10 +1199,11 @@ TEST(BreakPointApiGetter) {
   CheckDebuggerUnloaded();
 }
 
-void SetWrapperCallback(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  CHECK(args[0]
+void SetWrapperCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(info[0]
             .As<v8::Object>()
-            ->Set(args.GetIsolate()->GetCurrentContext(), args[1], args[2])
+            ->Set(info.GetIsolate()->GetCurrentContext(), info[1], info[2])
             .FromJust());
 }
 
@@ -1391,7 +1384,7 @@ TEST(Regress1163547) {
   // dictionary mode.
   auto constructor_fun =
       Handle<i::JSFunction>::cast(v8::Utils::OpenHandle(*constructor));
-  CHECK(!i::JSObject::cast(constructor_fun->prototype()).HasFastProperties());
+  CHECK(!i::JSObject::cast(constructor_fun->prototype())->HasFastProperties());
 
   // Run with breakpoint.
   bp = SetBreakPoint(function, 0);
@@ -1605,7 +1598,7 @@ TEST(BreakPointConditionBuiltin) {
   // === Test rest arguments ===
   break_point_hit_count = 0;
   builtin = CompileRun("String.fromCharCode").As<v8::Function>();
-  CompileRun("function f(...args) { return String.fromCharCode(...args); }");
+  CompileRun("function f(...info) { return String.fromCharCode(...info); }");
   CHECK_EQ(0, break_point_hit_count);
 
   // Run with breakpoint.
@@ -1752,12 +1745,12 @@ static void CallAndGC(v8::Local<v8::Context> context,
     CHECK_EQ(1 + i * 3, break_point_hit_count);
 
     // Scavenge and call function.
-    CcTest::CollectGarbage(v8::internal::NEW_SPACE);
+    i::heap::InvokeMinorGC(CcTest::heap());
     f->Call(context, recv, 0, nullptr).ToLocalChecked();
     CHECK_EQ(2 + i * 3, break_point_hit_count);
 
     // Mark sweep (and perhaps compact) and call function.
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
     f->Call(context, recv, 0, nullptr).ToLocalChecked();
     CHECK_EQ(3 + i * 3, break_point_hit_count);
   }
@@ -2970,7 +2963,7 @@ TEST(PauseInScript) {
 
   // Set breakpoint in the script.
   i::Handle<i::Script> i_script(
-      i::Script::cast(v8::Utils::OpenHandle(*script)->shared().script()),
+      i::Script::cast(v8::Utils::OpenHandle(*script)->shared()->script()),
       isolate);
   i::Handle<i::String> condition = isolate->factory()->empty_string();
   int position = 0;
@@ -3120,7 +3113,9 @@ TEST(DebugBreakInWrappedScript) {
   CheckDebuggerUnloaded();
 }
 
-static void EmptyHandler(const v8::FunctionCallbackInfo<v8::Value>& args) {}
+static void EmptyHandler(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+}
 
 TEST(DebugScopeIteratorWithFunctionTemplate) {
   LocalContext env;
@@ -3357,13 +3352,13 @@ TEST(DebugScriptLineEndsAreAscending) {
         v8::internal::Script::cast(instances->get(i)), CcTest::i_isolate());
 
     v8::internal::Script::InitLineEnds(CcTest::i_isolate(), new_script);
-    v8::internal::FixedArray ends =
+    v8::internal::Tagged<v8::internal::FixedArray> ends =
         v8::internal::FixedArray::cast(new_script->line_ends());
-    CHECK_GT(ends.length(), 0);
+    CHECK_GT(ends->length(), 0);
 
     int prev_end = -1;
-    for (int j = 0; j < ends.length(); j++) {
-      const int curr_end = v8::internal::Smi::ToInt(ends.get(j));
+    for (int j = 0; j < ends->length(); j++) {
+      const int curr_end = v8::internal::Smi::ToInt(ends->get(j));
       CHECK_GT(curr_end, prev_end);
       prev_end = curr_end;
     }
@@ -3988,8 +3983,9 @@ class DebugBreakStackTraceListener : public v8::debug::DebugDelegate {
   }
 };
 
-static void AddDebugBreak(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::debug::SetBreakOnNextFunctionCall(args.GetIsolate());
+static void AddDebugBreak(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::debug::SetBreakOnNextFunctionCall(info.GetIsolate());
 }
 
 TEST(DebugBreakStackTrace) {
@@ -4248,8 +4244,9 @@ class DebugEventExpectNoException : public v8::debug::DebugDelegate {
 };
 
 static void TryCatchWrappedThrowCallback(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::TryCatch try_catch(args.GetIsolate());
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::TryCatch try_catch(info.GetIsolate());
   CompileRun("throw 'rejection';");
   CHECK(try_catch.HasCaught());
 }
@@ -4330,7 +4327,7 @@ TEST(BreakLocationIterator) {
   CHECK(i_isolate->debug()->EnsureBreakInfo(shared));
   i_isolate->debug()->PrepareFunctionForDebugExecution(shared);
 
-  Handle<i::DebugInfo> debug_info(shared->GetDebugInfo(), i_isolate);
+  Handle<i::DebugInfo> debug_info(shared->GetDebugInfo(i_isolate), i_isolate);
 
   {
     i::BreakIterator iterator(debug_info);
@@ -4567,24 +4564,6 @@ TEST(DebugCoverageWithScriptDataOutOfScope) {
   CHECK_EQ(26, function_data.EndOffset());
 }
 
-TEST(BuiltinsExceptionPrediction) {
-  v8::Isolate* isolate = CcTest::isolate();
-  i::Isolate* iisolate = CcTest::i_isolate();
-  v8::HandleScope handle_scope(isolate);
-  v8::Context::New(isolate);
-
-  i::Builtins* builtins = iisolate->builtins();
-  bool fail = false;
-  for (i::Builtin builtin = i::Builtins::kFirst; builtin <= i::Builtins::kLast;
-       ++builtin) {
-    i::Code code = builtins->code(builtin);
-    if (code.kind() != i::CodeKind::BUILTIN) continue;
-    auto prediction = code.GetBuiltinCatchPrediction();
-    USE(prediction);
-  }
-  CHECK(!fail);
-}
-
 TEST(DebugGetPossibleBreakpointsReturnLocations) {
   LocalContext env;
   v8::Isolate* isolate = env->GetIsolate();
@@ -4622,10 +4601,10 @@ TEST(DebugEvaluateNoSideEffect) {
   std::vector<i::Handle<i::JSFunction>> all_functions;
   {
     i::HeapObjectIterator iterator(isolate->heap());
-    for (i::HeapObject obj = iterator.Next(); !obj.is_null();
+    for (i::Tagged<i::HeapObject> obj = iterator.Next(); !obj.is_null();
          obj = iterator.Next()) {
-      if (!obj.IsJSFunction()) continue;
-      i::JSFunction fun = i::JSFunction::cast(obj);
+      if (!IsJSFunction(obj)) continue;
+      i::Tagged<i::JSFunction> fun = i::JSFunction::cast(obj);
       all_functions.emplace_back(fun, isolate);
     }
   }
@@ -4692,7 +4671,7 @@ i::MaybeHandle<i::Script> FindScript(
   Handle<i::String> i_name =
       isolate->factory()->NewStringFromAsciiChecked(name);
   for (const auto& script : scripts) {
-    if (!script->name().IsString()) continue;
+    if (!IsString(script->name())) continue;
     if (i_name->Equals(i::String::cast(script->name()))) return script;
   }
   return i::MaybeHandle<i::Script>();
@@ -4713,35 +4692,35 @@ UNINITIALIZED_TEST(LoadedAtStartupScripts) {
 
     std::vector<i::Handle<i::Script>> scripts;
     CompileWithOrigin(v8_str("function foo(){}"), v8_str("normal.js"), false);
-    std::unordered_map<int, int> count_by_type;
+    std::unordered_map<i::Script::Type, int> count_by_type;
     {
       i::DisallowGarbageCollection no_gc;
       i::Script::Iterator iterator(i_isolate);
-      for (i::Script script = iterator.Next(); !script.is_null();
+      for (i::Tagged<i::Script> script = iterator.Next(); !script.is_null();
            script = iterator.Next()) {
-        if (script.type() == i::Script::TYPE_NATIVE &&
-            script.name().IsUndefined(i_isolate)) {
+        if (script->type() == i::Script::Type::kNative &&
+            IsUndefined(script->name(), i_isolate)) {
           continue;
         }
-        ++count_by_type[script.type()];
+        ++count_by_type[script->type()];
         scripts.emplace_back(script, i_isolate);
       }
     }
-    CHECK_EQ(count_by_type[i::Script::TYPE_NATIVE], 0);
-    CHECK_EQ(count_by_type[i::Script::TYPE_EXTENSION], 1);
-    CHECK_EQ(count_by_type[i::Script::TYPE_NORMAL], 1);
+    CHECK_EQ(count_by_type[i::Script::Type::kNative], 0);
+    CHECK_EQ(count_by_type[i::Script::Type::kExtension], 1);
+    CHECK_EQ(count_by_type[i::Script::Type::kNormal], 1);
 #if V8_ENABLE_WEBASSEMBLY
-    CHECK_EQ(count_by_type[i::Script::TYPE_WASM], 0);
+    CHECK_EQ(count_by_type[i::Script::Type::kWasm], 0);
 #endif  // V8_ENABLE_WEBASSEMBLY
-    CHECK_EQ(count_by_type[i::Script::TYPE_INSPECTOR], 0);
+    CHECK_EQ(count_by_type[i::Script::Type::kInspector], 0);
 
     i::Handle<i::Script> gc_script =
         FindScript(i_isolate, scripts, "v8/gc").ToHandleChecked();
-    CHECK_EQ(gc_script->type(), i::Script::TYPE_EXTENSION);
+    CHECK_EQ(gc_script->type(), i::Script::Type::kExtension);
 
     i::Handle<i::Script> normal_script =
         FindScript(i_isolate, scripts, "normal.js").ToHandleChecked();
-    CHECK_EQ(normal_script->type(), i::Script::TYPE_NORMAL);
+    CHECK_EQ(normal_script->type(), i::Script::Type::kNormal);
   }
   isolate->Dispose();
 }
@@ -4782,7 +4761,7 @@ TEST(SourceInfo) {
   v8::Local<v8::Script> v8_script =
       v8::Script::Compile(env.local(), v8_str(source)).ToLocalChecked();
   i::Handle<i::Script> i_script(
-      i::Script::cast(v8::Utils::OpenHandle(*v8_script)->shared().script()),
+      i::Script::cast(v8::Utils::OpenHandle(*v8_script)->shared()->script()),
       CcTest::i_isolate());
   v8::Local<v8::debug::Script> script =
       v8::ToApiHandle<v8::debug::Script>(i_script);
@@ -5494,6 +5473,7 @@ TEST(TerminateOnResumeAtBreakpoint) {
 namespace {
 bool microtask_one_ran = false;
 static void MicrotaskOne(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CHECK(v8::MicrotasksScope::IsRunningMicrotasks(info.GetIsolate()));
   v8::HandleScope scope(info.GetIsolate());
   v8::MicrotasksScope microtasks(info.GetIsolate()->GetCurrentContext(),
@@ -5690,6 +5670,7 @@ TEST(TerminateOnResumeAtUnhandledRejection) {
 
 namespace {
 void RejectPromiseThroughCpp(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   auto data = reinterpret_cast<std::pair<v8::Isolate*, LocalContext*>*>(
       info.Data().As<v8::External>()->Value());
 
diff --git a/deps/v8/test/cctest/test-descriptor-array.cc b/deps/v8/test/cctest/test-descriptor-array.cc
index db70c4f6a009e0..d8976a700f4d7e 100644
--- a/deps/v8/test/cctest/test-descriptor-array.cc
+++ b/deps/v8/test/cctest/test-descriptor-array.cc
@@ -32,7 +32,7 @@ Handle<Name> NewNameWithHash(Isolate* isolate, const char* str, uint32_t hash,
   Handle<Name> name = isolate->factory()->NewOneByteInternalizedString(
       base::OneByteVector(str), hash_field);
   name->set_raw_hash_field(hash_field);
-  CHECK(name->IsUniqueName());
+  CHECK(IsUniqueName(*name));
   return name;
 }
 
@@ -51,13 +51,13 @@ void CheckDescriptorArrayLookups(Isolate* isolate, Handle<Map> map,
   // Test C++ implementation.
   {
     DisallowGarbageCollection no_gc;
-    DescriptorArray descriptors = map->instance_descriptors(isolate);
-    DCHECK(descriptors.IsSortedNoDuplicates());
-    int nof_descriptors = descriptors.number_of_descriptors();
+    Tagged<DescriptorArray> descriptors = map->instance_descriptors(isolate);
+    DCHECK(descriptors->IsSortedNoDuplicates());
+    int nof_descriptors = descriptors->number_of_descriptors();
 
     for (size_t i = 0; i < names.size(); ++i) {
-      Name name = *names[i];
-      InternalIndex index = descriptors.Search(name, nof_descriptors, false);
+      Tagged<Name> name = *names[i];
+      InternalIndex index = descriptors->Search(name, nof_descriptors, false);
       CHECK(index.is_found());
       CHECK_EQ(i, index.as_uint32());
     }
@@ -68,7 +68,7 @@ void CheckDescriptorArrayLookups(Isolate* isolate, Handle<Map> map,
     for (size_t i = 0; i < names.size(); ++i) {
       Handle<Object> name_index =
           Call(isolate, csa_lookup, map, names[i]).ToHandleChecked();
-      CHECK(name_index->IsSmi());
+      CHECK(IsSmi(*name_index));
       CHECK_EQ(DescriptorArray::ToKeyIndex(static_cast<int>(i)),
                Smi::ToInt(*name_index));
     }
@@ -85,12 +85,12 @@ void CheckTransitionArrayLookups(Isolate* isolate,
     DCHECK(transitions->IsSortedNoDuplicates());
 
     for (size_t i = 0; i < maps.size(); ++i) {
-      Map expected_map = *maps[i];
-      Name name = expected_map.instance_descriptors(isolate).GetKey(
-          expected_map.LastAdded());
+      Tagged<Map> expected_map = *maps[i];
+      Tagged<Name> name = expected_map->instance_descriptors(isolate)->GetKey(
+          expected_map->LastAdded());
 
-      Map map = transitions->SearchAndGetTargetForTesting(PropertyKind::kData,
-                                                          name, NONE);
+      Tagged<Map> map = transitions->SearchAndGetTargetForTesting(
+          PropertyKind::kData, name, NONE);
       CHECK(!map.is_null());
       CHECK_EQ(expected_map, map);
     }
@@ -100,13 +100,13 @@ void CheckTransitionArrayLookups(Isolate* isolate,
   if (!v8_flags.jitless) {
     for (size_t i = 0; i < maps.size(); ++i) {
       Handle<Map> expected_map = maps[i];
-      Handle<Name> name(expected_map->instance_descriptors(isolate).GetKey(
+      Handle<Name> name(expected_map->instance_descriptors(isolate)->GetKey(
                             expected_map->LastAdded()),
                         isolate);
 
       Handle<Object> transition_map =
           Call(isolate, csa_lookup, transitions, name).ToHandleChecked();
-      CHECK(transition_map->IsMap());
+      CHECK(IsMap(*transition_map));
       CHECK_EQ(*expected_map, *transition_map);
     }
   }
@@ -255,7 +255,7 @@ TEST(DescriptorArrayHashCollisionMassive) {
   CheckDescriptorArrayLookups(isolate, map, names, csa_lookup);
 
   // Sort descriptor array and check it again.
-  map->instance_descriptors(isolate).Sort();
+  map->instance_descriptors(isolate)->Sort();
   CheckDescriptorArrayLookups(isolate, map, names, csa_lookup);
 }
 
@@ -306,7 +306,7 @@ TEST(DescriptorArrayHashCollision) {
   CheckDescriptorArrayLookups(isolate, map, names, csa_lookup);
 
   // Sort descriptor array and check it again.
-  map->instance_descriptors(isolate).Sort();
+  map->instance_descriptors(isolate)->Sort();
   CheckDescriptorArrayLookups(isolate, map, names, csa_lookup);
 }
 
diff --git a/deps/v8/test/cctest/test-disasm-regex-helper.cc b/deps/v8/test/cctest/test-disasm-regex-helper.cc
index 8c3b251d15ed37..ee0e08a136b77f 100644
--- a/deps/v8/test/cctest/test-disasm-regex-helper.cc
+++ b/deps/v8/test/cctest/test-disasm-regex-helper.cc
@@ -22,11 +22,11 @@ std::string DisassembleFunction(const char* function) {
 
   Isolate* isolate = CcTest::i_isolate();
   Handle<Code> code(f->code(), isolate);
-  Address begin = code->InstructionStart();
-  Address end = code->InstructionEnd();
+  Address begin = code->instruction_start();
+  Address end = code->instruction_end();
   std::ostringstream os;
-  Disassembler::Decode(isolate, os, reinterpret_cast<byte*>(begin),
-                       reinterpret_cast<byte*>(end), CodeReference(code));
+  Disassembler::Decode(isolate, os, reinterpret_cast<uint8_t*>(begin),
+                       reinterpret_cast<uint8_t*>(end), CodeReference(code));
   return os.str();
 }
 
diff --git a/deps/v8/test/cctest/test-field-type-tracking.cc b/deps/v8/test/cctest/test-field-type-tracking.cc
index 6a69fa5771aa3d..0554b5f00cbab8 100644
--- a/deps/v8/test/cctest/test-field-type-tracking.cc
+++ b/deps/v8/test/cctest/test-field-type-tracking.cc
@@ -62,8 +62,10 @@ static Handle<AccessorPair> CreateAccessorPair(bool with_getter,
 }
 
 // Check cached migration target map after Map::Update() and Map::TryUpdate()
-static void CheckMigrationTarget(Isolate* isolate, Map old_map, Map new_map) {
-  Map target = TransitionsAccessor(isolate, old_map).GetMigrationTarget();
+static void CheckMigrationTarget(Isolate* isolate, Tagged<Map> old_map,
+                                 Tagged<Map> new_map) {
+  Tagged<Map> target =
+      TransitionsAccessor(isolate, old_map).GetMigrationTarget();
   if (target.is_null()) return;
   CHECK_EQ(new_map, target);
   CHECK_EQ(MapUpdater::TryUpdateNoLock(isolate, old_map,
@@ -96,7 +98,7 @@ class Expectations {
   explicit Expectations(Isolate* isolate)
       : Expectations(
             isolate,
-            isolate->object_function()->initial_map().elements_kind()) {}
+            isolate->object_function()->initial_map()->elements_kind()) {}
 
   void Init(int index, PropertyKind kind, PropertyAttributes attributes,
             PropertyConstness constness, PropertyLocation location,
@@ -125,7 +127,7 @@ class Expectations {
       os << "Descriptor @ ";
 
       if (kinds_[i] == PropertyKind::kData) {
-        Handle<FieldType>::cast(values_[i])->PrintTo(os);
+        FieldType::cast(*values_[i])->PrintTo(os);
       } else {
         // kAccessor
         os << "(get: " << Brief(*values_[i])
@@ -237,8 +239,9 @@ class Expectations {
     }
   }
 
-  bool Check(DescriptorArray descriptors, InternalIndex descriptor) const {
-    PropertyDetails details = descriptors.GetDetails(descriptor);
+  bool Check(Tagged<DescriptorArray> descriptors,
+             InternalIndex descriptor) const {
+    PropertyDetails details = descriptors->GetDetails(descriptor);
 
     if (details.kind() != kinds_[descriptor.as_int()]) return false;
     if (details.location() != locations_[descriptor.as_int()]) return false;
@@ -252,10 +255,10 @@ class Expectations {
 
     if (!details.representation().Equals(expected_representation)) return false;
 
-    Object expected_value = *values_[descriptor.as_int()];
+    Tagged<Object> expected_value = *values_[descriptor.as_int()];
     if (details.location() == PropertyLocation::kField) {
       if (details.kind() == PropertyKind::kData) {
-        FieldType type = descriptors.GetFieldType(descriptor);
+        Tagged<FieldType> type = descriptors->GetFieldType(descriptor);
         return FieldType::cast(expected_value) == type;
       } else {
         // kAccessor
@@ -263,28 +266,28 @@ class Expectations {
       }
     } else {
       CHECK_EQ(PropertyKind::kAccessor, details.kind());
-      Object value = descriptors.GetStrongValue(descriptor);
+      Tagged<Object> value = descriptors->GetStrongValue(descriptor);
       if (value == expected_value) return true;
-      if (!value.IsAccessorPair()) return false;
-      AccessorPair pair = AccessorPair::cast(value);
-      return pair.Equals(expected_value, *setter_values_[descriptor.as_int()]);
+      if (!IsAccessorPair(value)) return false;
+      Tagged<AccessorPair> pair = AccessorPair::cast(value);
+      return pair->Equals(expected_value, *setter_values_[descriptor.as_int()]);
     }
     UNREACHABLE();
   }
 
-  bool Check(Map map, int expected_nof) const {
-    CHECK_EQ(elements_kind_, map.elements_kind());
+  bool Check(Tagged<Map> map, int expected_nof) const {
+    CHECK_EQ(elements_kind_, map->elements_kind());
     CHECK(number_of_properties_ <= MAX_PROPERTIES);
-    CHECK_EQ(expected_nof, map.NumberOfOwnDescriptors());
-    CHECK(!map.is_dictionary_map());
+    CHECK_EQ(expected_nof, map->NumberOfOwnDescriptors());
+    CHECK(!map->is_dictionary_map());
 
-    DescriptorArray descriptors = map.instance_descriptors();
+    Tagged<DescriptorArray> descriptors = map->instance_descriptors();
     CHECK(expected_nof <= number_of_properties_);
     for (InternalIndex i : InternalIndex::Range(expected_nof)) {
       if (!Check(descriptors, i)) {
         Print();
 #ifdef OBJECT_PRINT
-        descriptors.Print();
+        i::Print(descriptors);
 #endif
         return false;
       }
@@ -292,11 +295,13 @@ class Expectations {
     return true;
   }
 
-  bool Check(Map map) const { return Check(map, number_of_properties_); }
+  bool Check(Tagged<Map> map) const {
+    return Check(map, number_of_properties_);
+  }
 
-  bool CheckNormalized(Map map) const {
-    CHECK(map.is_dictionary_map());
-    CHECK_EQ(elements_kind_, map.elements_kind());
+  bool CheckNormalized(Tagged<Map> map) const {
+    CHECK(map->is_dictionary_map());
+    CHECK_EQ(elements_kind_, map->elements_kind());
     // TODO(leszeks): Iterate over the key/value pairs of the map and compare
     // them against the expected fields.
     return true;
@@ -416,16 +421,16 @@ class Expectations {
 
     Handle<String> name = CcTest::MakeName("prop", property_index);
 
-    CHECK(!getter->IsNull(isolate_) || !setter->IsNull(isolate_));
+    CHECK(!IsNull(*getter, isolate_) || !IsNull(*setter, isolate_));
     Factory* factory = isolate_->factory();
 
-    if (!getter->IsNull(isolate_)) {
+    if (!IsNull(*getter, isolate_)) {
       Handle<AccessorPair> pair = factory->NewAccessorPair();
       pair->SetComponents(*getter, *factory->null_value());
       Descriptor d = Descriptor::AccessorConstant(name, pair, attributes);
       map = Map::CopyInsertDescriptor(isolate_, map, &d, INSERT_TRANSITION);
     }
-    if (!setter->IsNull(isolate_)) {
+    if (!IsNull(*setter, isolate_)) {
       Handle<AccessorPair> pair = factory->NewAccessorPair();
       pair->SetComponents(*getter, *setter);
       Descriptor d = Descriptor::AccessorConstant(name, pair, attributes);
@@ -448,8 +453,8 @@ class Expectations {
     Handle<Object> setter(pair->setter(), isolate);
 
     InternalIndex descriptor =
-        map->instance_descriptors(isolate).SearchWithCache(isolate, *name,
-                                                           *map);
+        map->instance_descriptors(isolate)->SearchWithCache(isolate, *name,
+                                                            *map);
     map = Map::TransitionToAccessorProperty(isolate, map, name, descriptor,
                                             getter, setter, attributes);
     CHECK(!map->is_deprecated());
@@ -540,9 +545,9 @@ TEST(ReconfigureAccessorToNonExistingDataField) {
   Handle<JSObject> obj = factory->NewJSObjectFromMap(map);
   JSObject::MigrateToMap(isolate, obj, prepared_map);
   FieldIndex index = FieldIndex::ForDescriptor(*prepared_map, first);
-  CHECK(obj->RawFastPropertyAt(index).IsUninitialized(isolate));
+  CHECK(IsUninitialized(obj->RawFastPropertyAt(index), isolate));
 #ifdef VERIFY_HEAP
-  obj->ObjectVerify(isolate);
+  Object::ObjectVerify(*obj, isolate);
 #endif
 }
 
@@ -570,24 +575,22 @@ TEST(ReconfigureAccessorToNonExistingDataFieldHeavy) {
   Handle<Object> obj_value =
       Object::GetProperty(isolate, isolate->global_object(), obj_name)
           .ToHandleChecked();
-  CHECK(obj_value->IsJSObject());
+  CHECK(IsJSObject(*obj_value));
   Handle<JSObject> obj = Handle<JSObject>::cast(obj_value);
 
-  CHECK_EQ(1, obj->map().NumberOfOwnDescriptors());
+  CHECK_EQ(1, obj->map()->NumberOfOwnDescriptors());
   InternalIndex first(0);
-  CHECK(obj->map()
-            .instance_descriptors(isolate)
-            .GetStrongValue(first)
-            .IsAccessorPair());
+  CHECK(IsAccessorPair(
+      obj->map()->instance_descriptors(isolate)->GetStrongValue(first)));
 
   Handle<Object> value(Smi::FromInt(42), isolate);
   JSObject::SetOwnPropertyIgnoreAttributes(obj, foo_str, value, NONE).Check();
 
   // Check that the property contains |value|.
-  CHECK_EQ(1, obj->map().NumberOfOwnDescriptors());
+  CHECK_EQ(1, obj->map()->NumberOfOwnDescriptors());
   FieldIndex index = FieldIndex::ForDescriptor(obj->map(), first);
-  Object the_value = obj->RawFastPropertyAt(index);
-  CHECK(the_value.IsSmi());
+  Tagged<Object> the_value = obj->RawFastPropertyAt(index);
+  CHECK(IsSmi(the_value));
   CHECK_EQ(42, Smi::ToInt(the_value));
 }
 
@@ -606,7 +609,7 @@ struct CRFTData {
 };
 
 Handle<Code> CreateDummyOptimizedCode(Isolate* isolate) {
-  byte buffer[1];
+  uint8_t buffer[1];
   CodeDesc desc;
   desc.buffer = buffer;
   desc.buffer_size = arraysize(buffer);
@@ -622,7 +625,7 @@ static void CheckCodeObjectForDeopt(const CRFTData& from,
                                     Handle<Code> code_field_repr,
                                     Handle<Code> code_field_const,
                                     bool expected_deopt) {
-  if (!from.type->Equals(*expected.type)) {
+  if (!(*from.type)->Equals(*expected.type)) {
     CHECK_EQ(expected_deopt, code_field_type->marked_for_deoptimization());
   } else {
     CHECK(!code_field_type->marked_for_deoptimization());
@@ -755,12 +758,12 @@ void TestGeneralizeField(int detach_property_at_index, int property_index,
 
   {
     // Check that all previous maps are not stable.
-    Map tmp = *new_map;
+    Tagged<Map> tmp = *new_map;
     while (true) {
-      Object back = tmp.GetBackPointer();
-      if (back.IsUndefined(isolate)) break;
+      Tagged<Object> back = tmp->GetBackPointer();
+      if (IsUndefined(back, isolate)) break;
       tmp = Map::cast(back);
-      CHECK(!tmp.is_stable());
+      CHECK(!tmp->is_stable());
     }
   }
 
@@ -1416,7 +1419,7 @@ struct CheckNormalize {
     CHECK(!map->is_deprecated());
     CHECK_NE(*map, *new_map);
 
-    CHECK(new_map->GetBackPointer().IsUndefined(isolate));
+    CHECK(IsUndefined(new_map->GetBackPointer(), isolate));
     CHECK(!new_map->is_deprecated());
     CHECK(expectations.CheckNormalized(*new_map));
   }
@@ -1750,6 +1753,7 @@ static void TestReconfigureElementsKind_GeneralizeFieldInPlace(
   // Create a map, add required properties to it and initialize expectations.
   Handle<Map> initial_map = isolate->factory()->NewMap(
       JS_ARRAY_TYPE, JSArray::kHeaderSize, PACKED_SMI_ELEMENTS);
+  initial_map->SetConstructor(*isolate->object_function());
 
   Handle<Map> map = initial_map;
   map = expectations.AsElementsKind(map, PACKED_ELEMENTS);
@@ -1832,7 +1836,7 @@ static void TestReconfigureElementsKind_GeneralizeFieldInPlace(
   {
     MapHandles map_list;
     map_list.push_back(updated_map);
-    Map transitioned_map = map2->FindElementsKindTransitionedMap(
+    Tagged<Map> transitioned_map = map2->FindElementsKindTransitionedMap(
         isolate, map_list, ConcurrencyMode::kSynchronous);
     CHECK_EQ(*updated_map, transitioned_map);
   }
@@ -2199,13 +2203,13 @@ static void TestGeneralizeFieldWithSpecialTransition(
           for (int j = 0; j < kPropCount; j++) {
             expectations2.GeneralizeField(j);
           }
-          CHECK(new_map2->GetBackPointer().IsUndefined(isolate));
+          CHECK(IsUndefined(new_map2->GetBackPointer(), isolate));
           CHECK(expectations2.Check(*new_map2));
         } else {
           expectations2.SetDataField(i, expected.constness,
                                      expected.representation, expected.type);
 
-          CHECK(!new_map2->GetBackPointer().IsUndefined(isolate));
+          CHECK(!IsUndefined(new_map2->GetBackPointer(), isolate));
           CHECK(expectations2.Check(*new_map2));
         }
         break;
@@ -2791,12 +2795,12 @@ TEST(HoleyHeapNumber) {
   Handle<Object> obj =
       Object::NewStorageFor(isolate, isolate->factory()->uninitialized_value(),
                             Representation::Double());
-  CHECK(obj->IsHeapNumber());
-  CHECK_EQ(kHoleNanInt64, HeapNumber::cast(*obj).value_as_bits(kRelaxedLoad));
+  CHECK(IsHeapNumber(*obj));
+  CHECK_EQ(kHoleNanInt64, HeapNumber::cast(*obj)->value_as_bits(kRelaxedLoad));
 
   obj = Object::NewStorageFor(isolate, mhn, Representation::Double());
-  CHECK(obj->IsHeapNumber());
-  CHECK_EQ(kHoleNanInt64, HeapNumber::cast(*obj).value_as_bits(kRelaxedLoad));
+  CHECK(IsHeapNumber(*obj));
+  CHECK_EQ(kHoleNanInt64, HeapNumber::cast(*obj)->value_as_bits(kRelaxedLoad));
 }
 
 namespace {
@@ -2835,11 +2839,11 @@ void TestStoreToConstantField(const char* store_func_source,
   CHECK_EQ(1, map->NumberOfOwnDescriptors());
   InternalIndex first(0);
   CHECK(map->instance_descriptors(isolate)
-            .GetDetails(first)
+            ->GetDetails(first)
             .representation()
             .Equals(expected_rep));
   CHECK_EQ(PropertyConstness::kConst,
-           map->instance_descriptors(isolate).GetDetails(first).constness());
+           map->instance_descriptors(isolate)->GetDetails(first).constness());
 
   // Store value2 to obj2 and check that it got same map and property details
   // did not change.
@@ -2852,11 +2856,11 @@ void TestStoreToConstantField(const char* store_func_source,
   CHECK_EQ(1, map->NumberOfOwnDescriptors());
 
   CHECK(map->instance_descriptors(isolate)
-            .GetDetails(first)
+            ->GetDetails(first)
             .representation()
             .Equals(expected_rep));
   CHECK_EQ(PropertyConstness::kConst,
-           map->instance_descriptors(isolate).GetDetails(first).constness());
+           map->instance_descriptors(isolate)->GetDetails(first).constness());
 
   // Store value2 to obj1 and check that property became mutable.
   Call(isolate, store_func, obj1, value2).Check();
@@ -2867,11 +2871,11 @@ void TestStoreToConstantField(const char* store_func_source,
   CHECK_EQ(1, map->NumberOfOwnDescriptors());
 
   CHECK(map->instance_descriptors(isolate)
-            .GetDetails(first)
+            ->GetDetails(first)
             .representation()
             .Equals(expected_rep));
   CHECK_EQ(expected_constness,
-           map->instance_descriptors(isolate).GetDetails(first).constness());
+           map->instance_descriptors(isolate)->GetDetails(first).constness());
 }
 
 void TestStoreToConstantField_PlusMinusZero(const char* store_func_source,
@@ -2982,7 +2986,7 @@ TEST(NormalizeToMigrationTarget) {
   Isolate* isolate = CcTest::i_isolate();
 
   CHECK(
-      isolate->native_context()->normalized_map_cache().IsNormalizedMapCache());
+      IsNormalizedMapCache(isolate->native_context()->normalized_map_cache()));
 
   Handle<Map> base_map = Map::Create(isolate, 4);
 
@@ -3111,13 +3115,13 @@ TEST(DeletePropertyGeneralizesConstness) {
     tmp = Map::TransitionToDataProperty(isolate, new_parent_map, name_x, value,
                                         attributes, PropertyConstness::kConst,
                                         StoreOrigin::kNamed);
-    CHECK(!tmp->map(isolate).is_dictionary_map());
+    CHECK(!tmp->map(isolate)->is_dictionary_map());
     transitions.push_back(tmp);
 
     tmp = Map::TransitionToDataProperty(isolate, new_parent_map, name_y, value,
                                         attributes, PropertyConstness::kConst,
                                         StoreOrigin::kNamed);
-    CHECK(!tmp->map(isolate).is_dictionary_map());
+    CHECK(!tmp->map(isolate)->is_dictionary_map());
     transitions.push_back(tmp);
   }
 
@@ -3142,10 +3146,10 @@ TEST(DeletePropertyGeneralizesConstness) {
   }
 }
 
-#define CHECK_SAME(object, rep, expected)           \
-  CHECK_EQ(object->FitsRepresentation(rep, true),   \
-           object->FitsRepresentation(rep, false)); \
-  CHECK_EQ(object->FitsRepresentation(rep, true), expected)
+#define CHECK_SAME(object, rep, expected)                    \
+  CHECK_EQ(Object::FitsRepresentation(*object, rep, true),   \
+           Object::FitsRepresentation(*object, rep, false)); \
+  CHECK_EQ(Object::FitsRepresentation(*object, rep, true), expected)
 
 TEST(CheckFitsRepresentationPredicate) {
   CcTest::InitializeVM();
@@ -3166,8 +3170,8 @@ TEST(CheckFitsRepresentationPredicate) {
   // representation by converting it to a HeapNumber. If coercion is
   // disallowed, that query should fail.
   CHECK_SAME(smi_value, rep_smi, true);
-  CHECK_EQ(smi_value->FitsRepresentation(rep_double, true), true);
-  CHECK_EQ(smi_value->FitsRepresentation(rep_double, false), false);
+  CHECK_EQ(Object::FitsRepresentation(*smi_value, rep_double, true), true);
+  CHECK_EQ(Object::FitsRepresentation(*smi_value, rep_double, false), false);
   CHECK_SAME(smi_value, rep_heapobject, false);
   CHECK_SAME(smi_value, rep_tagged, true);
 
diff --git a/deps/v8/test/cctest/test-func-name-inference.cc b/deps/v8/test/cctest/test-func-name-inference.cc
index dad3d414cdea91..af1958cd815415 100644
--- a/deps/v8/test/cctest/test-func-name-inference.cc
+++ b/deps/v8/test/cctest/test-func-name-inference.cc
@@ -51,16 +51,16 @@ static void CheckFunctionName(v8::Local<v8::Script> script,
   // Get script source.
   Handle<i::Object> obj = v8::Utils::OpenHandle(*script);
   Handle<SharedFunctionInfo> shared_function;
-  if (obj->IsSharedFunctionInfo()) {
+  if (IsSharedFunctionInfo(*obj)) {
     shared_function =
         Handle<SharedFunctionInfo>(SharedFunctionInfo::cast(*obj), isolate);
   } else {
     shared_function =
-        Handle<SharedFunctionInfo>(JSFunction::cast(*obj).shared(), isolate);
+        Handle<SharedFunctionInfo>(JSFunction::cast(*obj)->shared(), isolate);
   }
   Handle<i::Script> i_script(i::Script::cast(shared_function->script()),
                              isolate);
-  CHECK(i_script->source().IsString());
+  CHECK(IsString(i_script->source()));
   Handle<i::String> script_src(i::String::cast(i_script->source()), isolate);
 
   // Find the position of a given func source substring in the source.
@@ -83,10 +83,11 @@ static void CheckFunctionName(v8::Local<v8::Script> script,
 
   // Verify inferred function name.
   std::unique_ptr<char[]> inferred_name =
-      shared_func_info->inferred_name().ToCString();
-  i::PrintF("expected: %s, found: %s\n", ref_inferred_name,
-            inferred_name.get());
-  CHECK_EQ(0, strcmp(ref_inferred_name, inferred_name.get()));
+      shared_func_info->inferred_name()->ToCString();
+  if (strcmp(ref_inferred_name, inferred_name.get()) != 0) {
+    GRACEFUL_FATAL("expected: %s, found: %s\n", ref_inferred_name,
+                   inferred_name.get());
+  }
 }
 
 
diff --git a/deps/v8/test/cctest/test-heap-profiler.cc b/deps/v8/test/cctest/test-heap-profiler.cc
index d9d363eeae8922..1ca4a4808de2b3 100644
--- a/deps/v8/test/cctest/test-heap-profiler.cc
+++ b/deps/v8/test/cctest/test-heap-profiler.cc
@@ -42,6 +42,7 @@
 #include "src/debug/debug.h"
 #include "src/handles/global-handles.h"
 #include "src/heap/heap-inl.h"
+#include "src/heap/pretenuring-handler.h"
 #include "src/objects/objects-inl.h"
 #include "src/profiler/allocation-tracker.h"
 #include "src/profiler/heap-profiler.h"
@@ -915,7 +916,7 @@ TEST(HeapSnapshotAddressReuse) {
   CompileRun(
       "for (var i = 0; i < 10000; ++i)\n"
       "  a[i] = new A();\n");
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   const v8::HeapSnapshot* snapshot2 = heap_profiler->TakeHeapSnapshot();
   CHECK(ValidateSnapshot(snapshot2));
@@ -957,7 +958,7 @@ TEST(HeapEntryIdsAndArrayShift) {
       "for (var i = 0; i < 1; ++i)\n"
       "  a.shift();\n");
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   const v8::HeapSnapshot* snapshot2 = heap_profiler->TakeHeapSnapshot();
   CHECK(ValidateSnapshot(snapshot2));
@@ -998,7 +999,7 @@ TEST(HeapEntryIdsAndGC) {
   const v8::HeapSnapshot* snapshot1 = heap_profiler->TakeHeapSnapshot();
   CHECK(ValidateSnapshot(snapshot1));
 
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   const v8::HeapSnapshot* snapshot2 = heap_profiler->TakeHeapSnapshot();
   CHECK(ValidateSnapshot(snapshot2));
@@ -1271,7 +1272,7 @@ TEST(HeapSnapshotObjectsStats) {
   // We have to call GC 6 times. In other case the garbage will be
   // the reason of flakiness.
   for (int i = 0; i < 6; ++i) {
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
   }
 
   v8::SnapshotObjectId initial_id;
@@ -1426,7 +1427,7 @@ TEST(HeapObjectIds) {
   }
 
   heap_profiler->StopTrackingHeapObjects();
-  CcTest::CollectAllAvailableGarbage();
+  i::heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
 
   for (int i = 0; i < kLength; i++) {
     v8::SnapshotObjectId id = heap_profiler->GetObjectId(objects[i]);
@@ -1805,7 +1806,11 @@ TEST(NativeSnapshotObjectId) {
 TEST(NativeSnapshotObjectIdMoving) {
   if (i::v8_flags.enable_third_party_heap) return;
   // Required to allow moving specific objects.
-  i::v8_flags.manual_evacuation_candidates_selection = true;
+  i::ManualGCScope manual_gc_scope;
+  i::heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
+  // Concurrent allocation writes page flags in a racy way.
+  i::v8_flags.stress_concurrent_allocation = false;
 
   LocalContext env;
   v8::Isolate* isolate = env->GetIsolate();
@@ -1843,7 +1848,7 @@ TEST(NativeSnapshotObjectIdMoving) {
         v8::Utils::OpenHandle(*v8::Local<v8::String>::Cast(local)));
     i::heap::ForceEvacuationCandidate(i::Page::FromHeapObject(*internal));
   }
-  CcTest::CollectAllGarbage();
+  i::heap::InvokeMajorGC(CcTest::heap());
 
   non_merged_id = heap_profiler->GetObjectId(&native1);
   CHECK_NE(v8::HeapProfiler::kUnknownObjectId, non_merged_id);
@@ -2060,7 +2065,7 @@ TEST(GetHeapValueForDeletedObject) {
 }
 
 static int StringCmp(const char* ref, i::String act) {
-  std::unique_ptr<char[]> s_act = act.ToCString();
+  std::unique_ptr<char[]> s_act = act->ToCString();
   int result = strcmp(ref, s_act.get());
   if (result != 0)
     fprintf(stderr, "Expected: \"%s\", Actual: \"%s\"\n", ref, s_act.get());
@@ -2589,7 +2594,6 @@ TEST(ManyLocalsInSharedContext) {
       "var ok = eval(result.join('\\n'));");
   const v8::HeapSnapshot* snapshot = heap_profiler->TakeHeapSnapshot();
   CHECK(ValidateSnapshot(snapshot));
-
   const v8::HeapGraphNode* global = GetGlobalObject(snapshot);
   CHECK(global);
   const v8::HeapGraphNode* ok_object = GetProperty(
@@ -2733,7 +2737,7 @@ TEST(CheckCodeNames) {
   const char* builtin_path1[] = {
       "::(GC roots)",
       "::(Builtins)",
-      "::(KeyedLoadIC_PolymorphicName builtin handle)",
+      "::(KeyedLoadIC_PolymorphicName builtin code)",
   };
   const v8::HeapGraphNode* node = GetNodeByPath(
       env->GetIsolate(), snapshot, builtin_path1, arraysize(builtin_path1));
@@ -2742,13 +2746,13 @@ TEST(CheckCodeNames) {
   const char* builtin_path2[] = {
       "::(GC roots)",
       "::(Builtins)",
-      "::(CompileLazy builtin handle)",
+      "::(CompileLazy builtin code)",
   };
   node = GetNodeByPath(env->GetIsolate(), snapshot, builtin_path2,
                        arraysize(builtin_path2));
   CHECK(node);
   v8::String::Utf8Value node_name(env->GetIsolate(), node->GetName());
-  CHECK_EQ(0, strcmp("(CompileLazy builtin handle)", *node_name));
+  CHECK_EQ(0, strcmp("(CompileLazy builtin code)", *node_name));
 }
 
 
@@ -2793,8 +2797,8 @@ static const char* record_trace_tree_source =
 "\n"
 "for (var i = 0; i < 100; i++) start();\n";
 
-static AllocationTraceNode* FindNode(
-    AllocationTracker* tracker, const v8::base::Vector<const char*>& names) {
+static AllocationTraceNode* FindNode(AllocationTracker* tracker,
+                                     v8::base::Vector<const char*> names) {
   AllocationTraceNode* node = tracker->trace_tree()->root();
   for (int i = 0; node != nullptr && i < names.length(); i++) {
     const char* name = names[i];
@@ -3263,7 +3267,7 @@ TEST(EmbedderGraph) {
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(env->GetIsolate());
   v8::Local<v8::Value> global_object =
       v8::Utils::ToLocal(i::Handle<i::JSObject>(
-          (isolate->context().native_context().global_object()), isolate));
+          (isolate->context()->native_context()->global_object()), isolate));
   global_object_pointer = &global_object;
   v8::HeapProfiler* heap_profiler = env->GetIsolate()->GetHeapProfiler();
   heap_profiler->AddBuildEmbedderGraphCallback(BuildEmbedderGraph, nullptr);
@@ -3327,7 +3331,7 @@ TEST(EmbedderGraphWithNamedEdges) {
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(env->GetIsolate());
   v8::Local<v8::Value> global_object =
       v8::Utils::ToLocal(i::Handle<i::JSObject>(
-          (isolate->context().native_context().global_object()), isolate));
+          (isolate->context()->native_context()->global_object()), isolate));
   global_object_pointer = &global_object;
   v8::HeapProfiler* heap_profiler = env->GetIsolate()->GetHeapProfiler();
   heap_profiler->AddBuildEmbedderGraphCallback(BuildEmbedderGraphWithNamedEdges,
@@ -3393,7 +3397,7 @@ TEST(EmbedderGraphMultipleCallbacks) {
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(env->GetIsolate());
   v8::Local<v8::Value> global_object =
       v8::Utils::ToLocal(i::Handle<i::JSObject>(
-          (isolate->context().native_context().global_object()), isolate));
+          (isolate->context()->native_context()->global_object()), isolate));
   global_object_pointer = &global_object;
   v8::HeapProfiler* heap_profiler = env->GetIsolate()->GetHeapProfiler();
   GraphBuildingContext context;
@@ -3470,7 +3474,7 @@ TEST(EmbedderGraphWithWrapperNode) {
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(env->GetIsolate());
   v8::Local<v8::Value> global_object =
       v8::Utils::ToLocal(i::Handle<i::JSObject>(
-          (isolate->context().native_context().global_object()), isolate));
+          (isolate->context()->native_context()->global_object()), isolate));
   global_object_pointer = &global_object;
   v8::HeapProfiler* heap_profiler = env->GetIsolate()->GetHeapProfiler();
   heap_profiler->AddBuildEmbedderGraphCallback(
@@ -3527,7 +3531,7 @@ TEST(EmbedderGraphWithPrefix) {
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(env->GetIsolate());
   v8::Local<v8::Value> global_object =
       v8::Utils::ToLocal(i::Handle<i::JSObject>(
-          (isolate->context().native_context().global_object()), isolate));
+          (isolate->context()->native_context()->global_object()), isolate));
   global_object_pointer = &global_object;
   v8::HeapProfiler* heap_profiler = env->GetIsolate()->GetHeapProfiler();
   heap_profiler->AddBuildEmbedderGraphCallback(BuildEmbedderGraphWithPrefix,
@@ -3597,7 +3601,7 @@ TEST(AddressToTraceMap) {
 
 static const v8::AllocationProfile::Node* FindAllocationProfileNode(
     v8::Isolate* isolate, v8::AllocationProfile* profile,
-    const v8::base::Vector<const char*>& names) {
+    v8::base::Vector<const char*> names) {
   v8::AllocationProfile::Node* node = profile->GetRootNode();
   for (int i = 0; node != nullptr && i < names.length(); ++i) {
     const char* name = names[i];
@@ -3636,7 +3640,7 @@ static const char* simple_sampling_heap_profiler_script =
     "function bar(size) { return new Array(size); }\n"
     "%NeverOptimizeFunction(bar);\n"
     "var foo = function() {\n"
-    "  for (var i = 0; i < 1024; ++i) {\n"
+    "  for (var i = 0; i < 2048; ++i) {\n"
     "    A[i] = bar(1024);\n"
     "  }\n"
     "}\n"
@@ -3714,7 +3718,7 @@ TEST(SamplingHeapProfiler) {
         "  eval(\"new Array(100)\");\n"
         "}\n");
 
-    CcTest::CollectAllGarbage();
+    i::heap::InvokeMajorGC(CcTest::heap());
 
     std::unique_ptr<v8::AllocationProfile> profile(
         heap_profiler->GetAllocationProfile());
@@ -3896,7 +3900,7 @@ TEST(SamplingHeapProfilerLeftTrimming) {
       "      a.shift();\n"
       "}\n");
 
-  CcTest::CollectGarbage(i::NEW_SPACE);
+  i::heap::InvokeMinorGC(CcTest::heap());
   // Should not crash.
 
   heap_profiler->StopSamplingHeapProfiler();
@@ -3941,7 +3945,7 @@ TEST(SamplingHeapProfilerPretenuredInlineAllocations) {
                      "%%OptimizeFunctionOnNextCall(f);"
                      "f();"
                      "f;",
-                     i::AllocationSite::kPretenureMinimumCreated + 1);
+                     i::PretenuringHandler::GetMinMementoCountForTesting() + 1);
 
   v8::Local<v8::Function> f =
       v8::Local<v8::Function>::Cast(CompileRun(source.begin()));
@@ -4078,13 +4082,13 @@ TEST(WeakReference) {
 
   i::Handle<i::Object> obj = v8::Utils::OpenHandle(*script);
   i::Handle<i::SharedFunctionInfo> shared_function =
-      i::Handle<i::SharedFunctionInfo>(i::JSFunction::cast(*obj).shared(),
+      i::Handle<i::SharedFunctionInfo>(i::JSFunction::cast(*obj)->shared(),
                                        i_isolate);
   i::Handle<i::ClosureFeedbackCellArray> feedback_cell_array =
       i::ClosureFeedbackCellArray::New(i_isolate, shared_function);
   i::Handle<i::FeedbackVector> fv = factory->NewFeedbackVector(
       shared_function, feedback_cell_array,
-      handle(i::JSFunction::cast(*obj).raw_feedback_cell(), i_isolate));
+      handle(i::JSFunction::cast(*obj)->raw_feedback_cell(), i_isolate));
 
   // Create a Code object.
   i::Assembler assm(i::AssemblerOptions{});
@@ -4094,7 +4098,7 @@ TEST(WeakReference) {
   i::Handle<i::Code> code =
       i::Factory::CodeBuilder(i_isolate, desc, i::CodeKind::FOR_TESTING)
           .Build();
-  CHECK(code->IsCode());
+  CHECK(IsCode(*code));
 
   // Manually inlined version of FeedbackVector::SetOptimizedCode (needed due
   // to the FOR_TESTING code kind).
@@ -4159,6 +4163,8 @@ TEST(HeapSnapshotDeleteDuringTakeSnapshot) {
   v8::HeapProfiler* heap_profiler = env->GetIsolate()->GetHeapProfiler();
   int gc_calls = 0;
   v8::Global<v8::Object> handle;
+  v8::Isolate* isolate = env->GetIsolate();
+  i::Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap();
 
   {
     struct WeakData {
@@ -4169,8 +4175,8 @@ TEST(HeapSnapshotDeleteDuringTakeSnapshot) {
     WeakData* data =
         new WeakData{heap_profiler->TakeHeapSnapshot(), &gc_calls, &handle};
 
-    v8::HandleScope inner_scope(env->GetIsolate());
-    handle.Reset(env->GetIsolate(), v8::Object::New(env->GetIsolate()));
+    v8::HandleScope inner_scope(isolate);
+    handle.Reset(isolate, v8::Object::New(isolate));
     handle.SetWeak(
         data,
         [](const v8::WeakCallbackInfo<WeakData>& data) {
@@ -4183,6 +4189,52 @@ TEST(HeapSnapshotDeleteDuringTakeSnapshot) {
   }
   CHECK_EQ(gc_calls, 0);
 
-  CHECK(ValidateSnapshot(heap_profiler->TakeHeapSnapshot()));
+  // We need to invoke GC without stack, otherwise some objects may survive.
+  i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+  // For the same reason, we need to take the snapshot without scanning the
+  // stack.
+  v8::HeapProfiler::HeapSnapshotOptions options;
+  options.stack_state = cppgc::EmbedderStackState::kNoHeapPointers;
+
+  CHECK(ValidateSnapshot(heap_profiler->TakeHeapSnapshot(options)));
   CHECK_EQ(gc_calls, 1);
 }
+
+TEST(ObjectRetainedInHandle) {
+  LocalContext env;
+  v8::Isolate* isolate = env->GetIsolate();
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
+  v8::HandleScope scope(isolate);
+  v8::HeapProfiler* heap_profiler = isolate->GetHeapProfiler();
+
+  // Allocate an array and keep a handle to it.
+  i::Handle<i::FixedArray> handle = i_isolate->factory()->NewFixedArray(1024);
+
+  const v8::HeapSnapshot* snapshot = heap_profiler->TakeHeapSnapshot();
+  CHECK(ValidateSnapshot(snapshot));
+
+  // Make sure to keep the handle alive.
+  CHECK(!handle.is_null());
+}
+
+TEST(ObjectRetainedInDirectHandle) {
+  LocalContext env;
+  v8::Isolate* isolate = env->GetIsolate();
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
+  v8::HandleScope scope(isolate);
+  v8::HeapProfiler* heap_profiler = isolate->GetHeapProfiler();
+
+  // Allocate an array and keep a direct handle to it.
+  i::DirectHandle<i::FixedArray> direct;
+  {
+    // Make sure the temporary indirect handle goes away.
+    v8::HandleScope inner_scope(isolate);
+    direct = i_isolate->factory()->NewFixedArray(1024);
+  }
+
+  const v8::HeapSnapshot* snapshot = heap_profiler->TakeHeapSnapshot();
+  CHECK(ValidateSnapshot(snapshot));
+
+  // Make sure to keep the handle alive.
+  CHECK(!direct.is_null());
+}
diff --git a/deps/v8/test/cctest/test-helper-riscv32.cc b/deps/v8/test/cctest/test-helper-riscv32.cc
index 79468c73734d6c..07ca9983a60d5d 100644
--- a/deps/v8/test/cctest/test-helper-riscv32.cc
+++ b/deps/v8/test/cctest/test-helper-riscv32.cc
@@ -39,7 +39,7 @@ Handle<Code> AssembleCodeImpl(Isolate* isolate, Func assemble) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
   if (v8_flags.print_code) {
-    code->Print();
+    Print(*code);
   }
   return code;
 }
diff --git a/deps/v8/test/cctest/test-helper-riscv32.h b/deps/v8/test/cctest/test-helper-riscv32.h
index 91fe1835dcd207..8e2028917cc3f4 100644
--- a/deps/v8/test/cctest/test-helper-riscv32.h
+++ b/deps/v8/test/cctest/test-helper-riscv32.h
@@ -249,7 +249,7 @@ void GenAndRunTestForLRSC(T value, Func test_generator) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #if defined(DEBUG)
-  code->Print();
+  Print(*code);
 #endif
   using INT_T =
       typename std::conditional<sizeof(T) == 4, int32_t, int64_t>::type;
@@ -312,7 +312,7 @@ OUTPUT_T GenAndRunTestForAMO(INPUT_T input0, INPUT_T input1,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #if defined(DEBUG)
-  code->Print();
+  Print(*code);
 #endif
   OUTPUT_T tmp = 0;
   auto f = GeneratedCode<OUTPUT_T(void* base, INPUT_T, INPUT_T)>::FromCode(
diff --git a/deps/v8/test/cctest/test-helper-riscv64.cc b/deps/v8/test/cctest/test-helper-riscv64.cc
index e4cf6bd29b89e2..a7841da9c82272 100644
--- a/deps/v8/test/cctest/test-helper-riscv64.cc
+++ b/deps/v8/test/cctest/test-helper-riscv64.cc
@@ -38,7 +38,7 @@ Handle<Code> AssembleCodeImpl(Isolate* isolate, Func assemble) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
   if (v8_flags.print_code) {
-    code->Print();
+    Print(*code);
   }
   return code;
 }
diff --git a/deps/v8/test/cctest/test-helper-riscv64.h b/deps/v8/test/cctest/test-helper-riscv64.h
index a6914e20c28761..9c4fccf287d9e4 100644
--- a/deps/v8/test/cctest/test-helper-riscv64.h
+++ b/deps/v8/test/cctest/test-helper-riscv64.h
@@ -254,7 +254,7 @@ void GenAndRunTestForLRSC(T value, Func test_generator) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #if defined(DEBUG)
-  code->Print();
+  Print(*code);
 #endif
   using INT_T =
       typename std::conditional<sizeof(T) == 4, int32_t, int64_t>::type;
@@ -318,7 +318,7 @@ OUTPUT_T GenAndRunTestForAMO(INPUT_T input0, INPUT_T input1,
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #if defined(DEBUG)
-  code->Print();
+  Print(*code);
 #endif
   OUTPUT_T tmp = 0;
   auto f = GeneratedCode<OUTPUT_T(void* base, INPUT_T, INPUT_T)>::FromCode(
diff --git a/deps/v8/test/cctest/test-inobject-slack-tracking.cc b/deps/v8/test/cctest/test-inobject-slack-tracking.cc
index f7a3a9115f9c05..a01e03bba960ab 100644
--- a/deps/v8/test/cctest/test-inobject-slack-tracking.cc
+++ b/deps/v8/test/cctest/test-inobject-slack-tracking.cc
@@ -72,31 +72,32 @@ static inline Handle<T> CompileRunI(const char* script) {
   return OpenHandle<T>(CompileRun(script));
 }
 
-static Object GetFieldValue(JSObject obj, int property_index) {
-  FieldIndex index = FieldIndex::ForPropertyIndex(obj.map(), property_index);
-  return obj.RawFastPropertyAt(index);
+static Tagged<Object> GetFieldValue(Tagged<JSObject> obj, int property_index) {
+  FieldIndex index = FieldIndex::ForPropertyIndex(obj->map(), property_index);
+  return obj->RawFastPropertyAt(index);
 }
 
-static double GetDoubleFieldValue(JSObject obj, FieldIndex field_index) {
-  Object value = obj.RawFastPropertyAt(field_index);
-  if (value.IsHeapNumber()) {
-    return HeapNumber::cast(value).value();
+static double GetDoubleFieldValue(Tagged<JSObject> obj,
+                                  FieldIndex field_index) {
+  Tagged<Object> value = obj->RawFastPropertyAt(field_index);
+  if (IsHeapNumber(value)) {
+    return HeapNumber::cast(value)->value();
   } else {
-    return value.Number();
+    return Object::Number(value);
   }
 }
 
-static double GetDoubleFieldValue(JSObject obj, int property_index) {
-  FieldIndex index = FieldIndex::ForPropertyIndex(obj.map(), property_index);
+static double GetDoubleFieldValue(Tagged<JSObject> obj, int property_index) {
+  FieldIndex index = FieldIndex::ForPropertyIndex(obj->map(), property_index);
   return GetDoubleFieldValue(obj, index);
 }
 
-bool IsObjectShrinkable(JSObject obj) {
+bool IsObjectShrinkable(Tagged<JSObject> obj) {
   Handle<Map> filler_map =
       CcTest::i_isolate()->factory()->one_pointer_filler_map();
 
-  int inobject_properties = obj.map().GetInObjectProperties();
-  int unused = obj.map().UnusedPropertyFields();
+  int inobject_properties = obj->map()->GetInObjectProperties();
+  int unused = obj->map()->UnusedPropertyFields();
   if (unused == 0) return false;
 
   Address packed_filler = MapWord::FromMap(*filler_map).ptr();
@@ -139,7 +140,7 @@ TEST(JSObjectBasic) {
   CHECK(initial_map->IsInobjectSlackTrackingInProgress());
 
   // There must be at least some slack.
-  CHECK_LT(5, obj->map().GetInObjectProperties());
+  CHECK_LT(5, obj->map()->GetInObjectProperties());
   CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj, 0));
   CHECK_EQ(4.2, GetDoubleFieldValue(*obj, 1));
   CHECK_EQ(*obj, GetFieldValue(*obj, 2));
@@ -156,7 +157,7 @@ TEST(JSObjectBasic) {
   CHECK(!IsObjectShrinkable(*obj));
 
   // No slack left.
-  CHECK_EQ(3, obj->map().GetInObjectProperties());
+  CHECK_EQ(3, obj->map()->GetInObjectProperties());
 }
 
 
@@ -200,7 +201,7 @@ TEST(JSObjectComplex) {
   CHECK(initial_map->IsInobjectSlackTrackingInProgress());
 
   // There must be at least some slack.
-  CHECK_LT(5, obj3->map().GetInObjectProperties());
+  CHECK_LT(5, obj3->map()->GetInObjectProperties());
   CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj3, 0));
   CHECK_EQ(4.2, GetDoubleFieldValue(*obj3, 1));
   CHECK_EQ(*obj3, GetFieldValue(*obj3, 2));
@@ -220,14 +221,14 @@ TEST(JSObjectComplex) {
   CHECK(IsObjectShrinkable(*obj3));
   CHECK(!IsObjectShrinkable(*obj5));
 
-  CHECK_EQ(5, obj1->map().GetInObjectProperties());
-  CHECK_EQ(4, obj1->map().UnusedPropertyFields());
+  CHECK_EQ(5, obj1->map()->GetInObjectProperties());
+  CHECK_EQ(4, obj1->map()->UnusedPropertyFields());
 
-  CHECK_EQ(5, obj3->map().GetInObjectProperties());
-  CHECK_EQ(2, obj3->map().UnusedPropertyFields());
+  CHECK_EQ(5, obj3->map()->GetInObjectProperties());
+  CHECK_EQ(2, obj3->map()->UnusedPropertyFields());
 
-  CHECK_EQ(5, obj5->map().GetInObjectProperties());
-  CHECK_EQ(0, obj5->map().UnusedPropertyFields());
+  CHECK_EQ(5, obj5->map()->GetInObjectProperties());
+  CHECK_EQ(0, obj5->map()->UnusedPropertyFields());
 
   // Since slack tracking is complete, the new objects should not be shrinkable.
   obj1 = CompileRunI<JSObject>("new A(1);");
@@ -285,7 +286,7 @@ TEST(JSGeneratorObjectBasic) {
   CHECK(initial_map->IsInobjectSlackTrackingInProgress());
 
   // There must be at least some slack.
-  CHECK_LT(5, obj->map().GetInObjectProperties());
+  CHECK_LT(5, obj->map()->GetInObjectProperties());
   CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj, 0));
   CHECK_EQ(4.2, GetDoubleFieldValue(*obj, 1));
   CHECK_EQ(*obj, GetFieldValue(*obj, 2));
@@ -302,7 +303,7 @@ TEST(JSGeneratorObjectBasic) {
   CHECK(!IsObjectShrinkable(*obj));
 
   // No slack left.
-  CHECK_EQ(3, obj->map().GetInObjectProperties());
+  CHECK_EQ(3, obj->map()->GetInObjectProperties());
 }
 
 
@@ -369,7 +370,7 @@ TEST(SubclassBasicNoBaseClassInstances) {
   CHECK(b_initial_map->IsInobjectSlackTrackingInProgress());
 
   // There must be at least some slack.
-  CHECK_LT(10, obj->map().GetInObjectProperties());
+  CHECK_LT(10, obj->map()->GetInObjectProperties());
   CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj, 0));
   CHECK_EQ(4.2, GetDoubleFieldValue(*obj, 1));
   CHECK_EQ(*obj, GetFieldValue(*obj, 2));
@@ -394,7 +395,7 @@ TEST(SubclassBasicNoBaseClassInstances) {
   CHECK(a_initial_map->IsInobjectSlackTrackingInProgress());
 
   // No slack left.
-  CHECK_EQ(6, obj->map().GetInObjectProperties());
+  CHECK_EQ(6, obj->map()->GetInObjectProperties());
 }
 
 
@@ -474,10 +475,10 @@ TEST(SubclassBasic) {
   CHECK(!IsObjectShrinkable(*a_obj));
 
   // No slack left.
-  CHECK_EQ(3, a_obj->map().GetInObjectProperties());
+  CHECK_EQ(3, a_obj->map()->GetInObjectProperties());
 
   // There must be at least some slack.
-  CHECK_LT(10, b_obj->map().GetInObjectProperties());
+  CHECK_LT(10, b_obj->map()->GetInObjectProperties());
   CHECK_EQ(Smi::FromInt(42), GetFieldValue(*b_obj, 0));
   CHECK_EQ(4.2, GetDoubleFieldValue(*b_obj, 1));
   CHECK_EQ(*b_obj, GetFieldValue(*b_obj, 2));
@@ -497,7 +498,7 @@ TEST(SubclassBasic) {
   CHECK(!IsObjectShrinkable(*b_obj));
 
   // No slack left.
-  CHECK_EQ(6, b_obj->map().GetInObjectProperties());
+  CHECK_EQ(6, b_obj->map()->GetInObjectProperties());
 }
 
 
@@ -574,10 +575,10 @@ static void TestClassHierarchy(const std::vector<int>& hierarchy_desc, int n) {
     Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
 
     // If the object is slow-mode already, bail out.
-    if (obj->map().is_dictionary_map()) continue;
+    if (obj->map()->is_dictionary_map()) continue;
 
     // There must be at least some slack.
-    CHECK_LT(fields_count, obj->map().GetInObjectProperties());
+    CHECK_LT(fields_count, obj->map()->GetInObjectProperties());
 
     // One instance was created.
     CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
@@ -601,7 +602,7 @@ static void TestClassHierarchy(const std::vector<int>& hierarchy_desc, int n) {
     CHECK(!IsObjectShrinkable(*obj));
 
     // No slack left.
-    CHECK_EQ(fields_count, obj->map().GetInObjectProperties());
+    CHECK_EQ(fields_count, obj->map()->GetInObjectProperties());
   }
 }
 
@@ -684,8 +685,8 @@ TEST(InobjectPropetiesCountOverflowInSubclass) {
     Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
 
     // There must be no slack left.
-    CHECK_EQ(JSObject::kMaxInstanceSize, obj->map().instance_size());
-    CHECK_EQ(kMaxInobjectProperties, obj->map().GetInObjectProperties());
+    CHECK_EQ(JSObject::kMaxInstanceSize, obj->map()->instance_size());
+    CHECK_EQ(kMaxInobjectProperties, obj->map()->GetInObjectProperties());
 
     // One instance was created.
     CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
@@ -702,7 +703,7 @@ TEST(InobjectPropetiesCountOverflowInSubclass) {
     CHECK(!IsObjectShrinkable(*obj));
 
     // No slack left.
-    CHECK_EQ(kMaxInobjectProperties, obj->map().GetInObjectProperties());
+    CHECK_EQ(kMaxInobjectProperties, obj->map()->GetInObjectProperties());
   }
 
   // The other classes in the hierarchy are not affected.
@@ -712,7 +713,7 @@ TEST(InobjectPropetiesCountOverflowInSubclass) {
 static void CheckExpectedProperties(int expected, std::ostringstream& os) {
   Handle<HeapObject> obj = Handle<HeapObject>::cast(
       v8::Utils::OpenHandle(*CompileRun(os.str().c_str())));
-  CHECK_EQ(expected, obj->map().GetInObjectProperties());
+  CHECK_EQ(expected, obj->map()->GetInObjectProperties());
 }
 
 TEST(ObjectLiteralPropertyBackingStoreSize) {
@@ -870,8 +871,8 @@ TEST(SlowModeSubclass) {
     Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
 
     // Object should go dictionary mode.
-    CHECK_EQ(JSObject::kHeaderSize, obj->map().instance_size());
-    CHECK(obj->map().is_dictionary_map());
+    CHECK_EQ(JSObject::kHeaderSize, obj->map()->instance_size());
+    CHECK(obj->map()->is_dictionary_map());
 
     // One instance was created.
     CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
@@ -888,8 +889,8 @@ TEST(SlowModeSubclass) {
     CHECK(!IsObjectShrinkable(*obj));
 
     // Object should stay in dictionary mode.
-    CHECK_EQ(JSObject::kHeaderSize, obj->map().instance_size());
-    CHECK(obj->map().is_dictionary_map());
+    CHECK_EQ(JSObject::kHeaderSize, obj->map()->instance_size());
+    CHECK(obj->map()->is_dictionary_map());
   }
 
   // The other classes in the hierarchy are not affected.
@@ -952,7 +953,7 @@ static void TestSubclassBuiltin(const char* subclass_name,
   CHECK(initial_map->IsInobjectSlackTrackingInProgress());
 
   // There must be at least some slack.
-  CHECK_LT(builtin_properties_count + 5, obj->map().GetInObjectProperties());
+  CHECK_LT(builtin_properties_count + 5, obj->map()->GetInObjectProperties());
   CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj, builtin_properties_count + 0));
   CHECK_EQ(4.2, GetDoubleFieldValue(*obj, builtin_properties_count + 1));
   CHECK_EQ(*obj, GetFieldValue(*obj, builtin_properties_count + 2));
@@ -969,9 +970,9 @@ static void TestSubclassBuiltin(const char* subclass_name,
   CHECK(!IsObjectShrinkable(*obj));
 
   // No slack left.
-  CHECK_EQ(builtin_properties_count + 3, obj->map().GetInObjectProperties());
+  CHECK_EQ(builtin_properties_count + 3, obj->map()->GetInObjectProperties());
 
-  CHECK_EQ(instance_type, obj->map().instance_type());
+  CHECK_EQ(instance_type, obj->map()->instance_type());
 }
 
 
@@ -1283,8 +1284,8 @@ TEST(SubclassTranspiledClassHierarchy) {
   CHECK(!IsObjectShrinkable(*obj));
 
   // No slack left.
-  CHECK_EQ(21, obj->map().GetInObjectProperties());
-  CHECK_EQ(JS_OBJECT_TYPE, obj->map().instance_type());
+  CHECK_EQ(21, obj->map()->GetInObjectProperties());
+  CHECK_EQ(JS_OBJECT_TYPE, obj->map()->instance_type());
 }
 
 TEST(Regress8853_ClassConstructor) {
@@ -1294,9 +1295,9 @@ TEST(Regress8853_ClassConstructor) {
   // For classes without any this.prop assignments in their
   // constructors we start out with 10 inobject properties.
   Handle<JSObject> obj = CompileRunI<JSObject>("new (class {});\n");
-  CHECK(obj->map().IsInobjectSlackTrackingInProgress());
+  CHECK(obj->map()->IsInobjectSlackTrackingInProgress());
   CHECK(IsObjectShrinkable(*obj));
-  CHECK_EQ(10, obj->map().GetInObjectProperties());
+  CHECK_EQ(10, obj->map()->GetInObjectProperties());
 
   // For classes with N explicit this.prop assignments in their
   // constructors we start out with N+8 inobject properties.
@@ -1308,9 +1309,9 @@ TEST(Regress8853_ClassConstructor) {
       "    this.z = 3;\n"
       "  }\n"
       "});\n");
-  CHECK(obj->map().IsInobjectSlackTrackingInProgress());
+  CHECK(obj->map()->IsInobjectSlackTrackingInProgress());
   CHECK(IsObjectShrinkable(*obj));
-  CHECK_EQ(3 + 8, obj->map().GetInObjectProperties());
+  CHECK_EQ(3 + 8, obj->map()->GetInObjectProperties());
 }
 
 TEST(Regress8853_ClassHierarchy) {
@@ -1324,9 +1325,9 @@ TEST(Regress8853_ClassHierarchy) {
   for (int i = 1; i < 10; ++i) {
     std::string script = "new " + base + ";\n";
     Handle<JSObject> obj = CompileRunI<JSObject>(script.c_str());
-    CHECK(obj->map().IsInobjectSlackTrackingInProgress());
+    CHECK(obj->map()->IsInobjectSlackTrackingInProgress());
     CHECK(IsObjectShrinkable(*obj));
-    CHECK_EQ(8 + 2 * i, obj->map().GetInObjectProperties());
+    CHECK_EQ(8 + 2 * i, obj->map()->GetInObjectProperties());
     base = "(class extends " + base + " {})";
   }
 }
@@ -1338,9 +1339,9 @@ TEST(Regress8853_FunctionConstructor) {
   // For constructor functions without any this.prop assignments in
   // them we start out with 10 inobject properties.
   Handle<JSObject> obj = CompileRunI<JSObject>("new (function() {});\n");
-  CHECK(obj->map().IsInobjectSlackTrackingInProgress());
+  CHECK(obj->map()->IsInobjectSlackTrackingInProgress());
   CHECK(IsObjectShrinkable(*obj));
-  CHECK_EQ(10, obj->map().GetInObjectProperties());
+  CHECK_EQ(10, obj->map()->GetInObjectProperties());
 
   // For constructor functions with N explicit this.prop assignments
   // in them we start out with N+8 inobject properties.
@@ -1353,9 +1354,9 @@ TEST(Regress8853_FunctionConstructor) {
       "  this.c = 3;\n"
       "  this.f = 3;\n"
       "});\n");
-  CHECK(obj->map().IsInobjectSlackTrackingInProgress());
+  CHECK(obj->map()->IsInobjectSlackTrackingInProgress());
   CHECK(IsObjectShrinkable(*obj));
-  CHECK_EQ(6 + 8, obj->map().GetInObjectProperties());
+  CHECK_EQ(6 + 8, obj->map()->GetInObjectProperties());
 }
 
 TEST(InstanceFieldsArePropertiesDefaultConstructorLazy) {
@@ -1376,7 +1377,7 @@ TEST(InstanceFieldsArePropertiesDefaultConstructorLazy) {
       "  x09 = null;\n"
       "  x10 = null;\n"
       "});\n");
-  CHECK_EQ(11 + 8, obj->map().GetInObjectProperties());
+  CHECK_EQ(11 + 8, obj->map()->GetInObjectProperties());
 }
 
 TEST(InstanceFieldsArePropertiesFieldsAndConstructorLazy) {
@@ -1409,7 +1410,7 @@ TEST(InstanceFieldsArePropertiesFieldsAndConstructorLazy) {
       "    this.x20 = null;\n"
       "  }\n"
       "});\n");
-  CHECK_EQ(21 + 8, obj->map().GetInObjectProperties());
+  CHECK_EQ(21 + 8, obj->map()->GetInObjectProperties());
 }
 
 TEST(InstanceFieldsArePropertiesDefaultConstructorEager) {
@@ -1431,7 +1432,7 @@ TEST(InstanceFieldsArePropertiesDefaultConstructorEager) {
       "  x09 = null;\n"
       "  x10 = null;\n"
       "});\n");
-  CHECK_EQ(11 + 8, obj->map().GetInObjectProperties());
+  CHECK_EQ(11 + 8, obj->map()->GetInObjectProperties());
 }
 
 TEST(InstanceFieldsArePropertiesFieldsAndConstructorEager) {
@@ -1465,7 +1466,7 @@ TEST(InstanceFieldsArePropertiesFieldsAndConstructorEager) {
       "    this.x20 = null;\n"
       "  }\n"
       "});\n");
-  CHECK_EQ(21 + 8, obj->map().GetInObjectProperties());
+  CHECK_EQ(21 + 8, obj->map()->GetInObjectProperties());
 }
 
 }  // namespace test_inobject_slack_tracking
diff --git a/deps/v8/test/cctest/test-js-to-wasm.cc b/deps/v8/test/cctest/test-js-to-wasm.cc
index 867a725b226887..0a9cdac8b63d68 100644
--- a/deps/v8/test/cctest/test-js-to-wasm.cc
+++ b/deps/v8/test/cctest/test-js-to-wasm.cc
@@ -19,7 +19,7 @@ namespace v8 {
 namespace internal {
 namespace wasm {
 
-static const int kDeoptLoopCount = 1e4;
+static const int kDeoptLoopCount = 1e3;
 
 // Validates the type of the result returned by a test function.
 template <typename T>
@@ -284,12 +284,19 @@ class FastJSWasmCallTester {
   FastJSWasmCallTester()
       : allocator_(),
         zone_(&allocator_, ZONE_NAME),
-        builder_(zone_.New<WasmModuleBuilder>(&zone_)) {
+        builder_(zone_.New<WasmModuleBuilder>(&zone_)),
+        old_budget_(i::v8_flags.invocation_count_for_turbofan) {
+    i::v8_flags.experimental_wasm_typed_funcref = true;
     i::v8_flags.experimental_wasm_typed_funcref = true;
     i::v8_flags.allow_natives_syntax = true;
     i::v8_flags.turbo_inline_js_wasm_calls = true;
     i::v8_flags.stress_background_compile = false;
     i::v8_flags.concurrent_osr = false;  // Seems to mess with %ObserveNode.
+    i::v8_flags.invocation_count_for_turbofan = 20;
+  }
+
+  ~FastJSWasmCallTester() {
+    i::v8_flags.invocation_count_for_turbofan = old_budget_;
   }
 
   void DeclareCallback(const char* name, FunctionSig* signature,
@@ -752,6 +759,11 @@ class FastJSWasmCallTester {
         "  }"
         "  return result;"
         "}"
+        "%PrepareFunctionForOptimization(test);"
+        "test(" +
+        js_args +
+        ");"
+        "%OptimizeFunctionOnNextCall(test);"
         "test(" +
         js_args + ");";
 
@@ -774,6 +786,7 @@ class FastJSWasmCallTester {
   Zone zone_;
   WasmModuleBuilder* builder_;
   TestMode test_mode_ = kJSToWasmInliningEnabled;
+  int old_budget_;
 };
 
 TEST(TestFastJSWasmCall_Nop) {
diff --git a/deps/v8/test/cctest/test-js-weak-refs.cc b/deps/v8/test/cctest/test-js-weak-refs.cc
index eb44c3c8909f45..b7968ca4061fdd 100644
--- a/deps/v8/test/cctest/test-js-weak-refs.cc
+++ b/deps/v8/test/cctest/test-js-weak-refs.cc
@@ -86,7 +86,7 @@ Handle<WeakCell> FinalizationRegistryRegister(
   Execution::Call(isolate, regfunc, finalization_registry, arraysize(args),
                   args)
       .ToHandleChecked();
-  CHECK(finalization_registry->active_cells().IsWeakCell());
+  CHECK(IsWeakCell(finalization_registry->active_cells()));
   Handle<WeakCell> weak_cell =
       handle(WeakCell::cast(finalization_registry->active_cells()), isolate);
 #ifdef VERIFY_HEAP
@@ -105,33 +105,34 @@ Handle<WeakCell> FinalizationRegistryRegister(
 }
 
 void NullifyWeakCell(Handle<WeakCell> weak_cell, Isolate* isolate) {
-  auto empty_func = [](HeapObject object, ObjectSlot slot, Object target) {};
+  auto empty_func = [](Tagged<HeapObject> object, ObjectSlot slot,
+                       Tagged<Object> target) {};
   weak_cell->Nullify(isolate, empty_func);
 #ifdef VERIFY_HEAP
   weak_cell->WeakCellVerify(isolate);
 #endif  // VERIFY_HEAP
 }
 
-Object PopClearedCellHoldings(
+Tagged<Object> PopClearedCellHoldings(
     Handle<JSFinalizationRegistry> finalization_registry, Isolate* isolate) {
   // PopClearedCell is implemented in Torque. Reproduce that implementation here
   // for testing.
   Handle<WeakCell> weak_cell =
       handle(WeakCell::cast(finalization_registry->cleared_cells()), isolate);
-  DCHECK(weak_cell->prev().IsUndefined(isolate));
+  DCHECK(IsUndefined(weak_cell->prev(), isolate));
   finalization_registry->set_cleared_cells(weak_cell->next());
   weak_cell->set_next(ReadOnlyRoots(isolate).undefined_value());
 
-  if (finalization_registry->cleared_cells().IsWeakCell()) {
-    WeakCell cleared_cells_head =
+  if (IsWeakCell(finalization_registry->cleared_cells())) {
+    Tagged<WeakCell> cleared_cells_head =
         WeakCell::cast(finalization_registry->cleared_cells());
-    DCHECK_EQ(cleared_cells_head.prev(), *weak_cell);
-    cleared_cells_head.set_prev(ReadOnlyRoots(isolate).undefined_value());
+    DCHECK_EQ(cleared_cells_head->prev(), *weak_cell);
+    cleared_cells_head->set_prev(ReadOnlyRoots(isolate).undefined_value());
   } else {
-    DCHECK(finalization_registry->cleared_cells().IsUndefined(isolate));
+    DCHECK(IsUndefined(finalization_registry->cleared_cells(), isolate));
   }
 
-  if (!weak_cell->unregister_token().IsUndefined(isolate)) {
+  if (!IsUndefined(weak_cell->unregister_token(), isolate)) {
     JSFinalizationRegistry::RemoveCellFromUnregisterTokenMap(
         isolate, finalization_registry->ptr(), weak_cell->ptr());
   }
@@ -141,7 +142,8 @@ Object PopClearedCellHoldings(
 
 // Usage: VerifyWeakCellChain(isolate, list_head, n, cell1, cell2, ..., celln);
 // verifies that list_head == cell1 and cell1, cell2, ..., celln. form a list.
-void VerifyWeakCellChain(Isolate* isolate, Object list_head, int n_args, ...) {
+void VerifyWeakCellChain(Isolate* isolate, Tagged<Object> list_head, int n_args,
+                         ...) {
   CHECK_GE(n_args, 0);
 
   va_list args;
@@ -149,55 +151,56 @@ void VerifyWeakCellChain(Isolate* isolate, Object list_head, int n_args, ...) {
 
   if (n_args == 0) {
     // Verify empty list
-    CHECK(list_head.IsUndefined(isolate));
+    CHECK(IsUndefined(list_head, isolate));
   } else {
-    WeakCell current = WeakCell::cast(Object(va_arg(args, Address)));
+    Tagged<WeakCell> current = WeakCell::cast(Object(va_arg(args, Address)));
     CHECK_EQ(current, list_head);
-    CHECK(current.prev().IsUndefined(isolate));
+    CHECK(IsUndefined(current->prev(), isolate));
 
     for (int i = 1; i < n_args; i++) {
-      WeakCell next = WeakCell::cast(Object(va_arg(args, Address)));
-      CHECK_EQ(current.next(), next);
-      CHECK_EQ(next.prev(), current);
+      Tagged<WeakCell> next = WeakCell::cast(Object(va_arg(args, Address)));
+      CHECK_EQ(current->next(), next);
+      CHECK_EQ(next->prev(), current);
       current = next;
     }
-    CHECK(current.next().IsUndefined(isolate));
+    CHECK(IsUndefined(current->next(), isolate));
   }
   va_end(args);
 }
 
 // Like VerifyWeakCellChain but verifies the chain created with key_list_prev
 // and key_list_next instead of prev and next.
-void VerifyWeakCellKeyChain(Isolate* isolate, SimpleNumberDictionary key_map,
-                            Object unregister_token, int n_args, ...) {
+void VerifyWeakCellKeyChain(Isolate* isolate,
+                            Tagged<SimpleNumberDictionary> key_map,
+                            Tagged<Object> unregister_token, int n_args, ...) {
   CHECK_GE(n_args, 0);
 
   va_list args;
   va_start(args, n_args);
 
-  Object hash = unregister_token.GetHash();
+  Tagged<Object> hash = Object::GetHash(unregister_token);
   InternalIndex entry = InternalIndex::NotFound();
-  if (!hash.IsUndefined(isolate)) {
+  if (!IsUndefined(hash, isolate)) {
     uint32_t key = Smi::ToInt(hash);
-    entry = key_map.FindEntry(isolate, key);
+    entry = key_map->FindEntry(isolate, key);
   }
   if (n_args == 0) {
     // Verify empty list
     CHECK(entry.is_not_found());
   } else {
     CHECK(entry.is_found());
-    WeakCell current = WeakCell::cast(Object(va_arg(args, Address)));
-    Object list_head = key_map.ValueAt(entry);
+    Tagged<WeakCell> current = WeakCell::cast(Object(va_arg(args, Address)));
+    Tagged<Object> list_head = key_map->ValueAt(entry);
     CHECK_EQ(current, list_head);
-    CHECK(current.key_list_prev().IsUndefined(isolate));
+    CHECK(IsUndefined(current->key_list_prev(), isolate));
 
     for (int i = 1; i < n_args; i++) {
-      WeakCell next = WeakCell::cast(Object(va_arg(args, Address)));
-      CHECK_EQ(current.key_list_next(), next);
-      CHECK_EQ(next.key_list_prev(), current);
+      Tagged<WeakCell> next = WeakCell::cast(Object(va_arg(args, Address)));
+      CHECK_EQ(current->key_list_next(), next);
+      CHECK_EQ(next->key_list_prev(), current);
       current = next;
     }
-    CHECK(current.key_list_next().IsUndefined(isolate));
+    CHECK(IsUndefined(current->key_list_next(), isolate));
   }
   va_end(args);
 }
@@ -231,13 +234,13 @@ TEST(TestRegister) {
 
   VerifyWeakCellChain(isolate, finalization_registry->active_cells(), 1,
                       *weak_cell1);
-  CHECK(weak_cell1->key_list_prev().IsUndefined(isolate));
-  CHECK(weak_cell1->key_list_next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell1->key_list_prev(), isolate));
+  CHECK(IsUndefined(weak_cell1->key_list_next(), isolate));
 
-  CHECK(finalization_registry->cleared_cells().IsUndefined(isolate));
+  CHECK(IsUndefined(finalization_registry->cleared_cells(), isolate));
 
   // No key was used during registration, key-based map stays uninitialized.
-  CHECK(finalization_registry->key_map().IsUndefined(isolate));
+  CHECK(IsUndefined(finalization_registry->key_map(), isolate));
 
   // Register another weak reference and verify internal data structures.
   Handle<WeakCell> weak_cell2 =
@@ -245,11 +248,11 @@ TEST(TestRegister) {
 
   VerifyWeakCellChain(isolate, finalization_registry->active_cells(), 2,
                       *weak_cell2, *weak_cell1);
-  CHECK(weak_cell2->key_list_prev().IsUndefined(isolate));
-  CHECK(weak_cell2->key_list_next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell2->key_list_prev(), isolate));
+  CHECK(IsUndefined(weak_cell2->key_list_next(), isolate));
 
-  CHECK(finalization_registry->cleared_cells().IsUndefined(isolate));
-  CHECK(finalization_registry->key_map().IsUndefined(isolate));
+  CHECK(IsUndefined(finalization_registry->cleared_cells(), isolate));
+  CHECK(IsUndefined(finalization_registry->key_map(), isolate));
 }
 
 TEST(TestRegisterWithKey) {
@@ -272,7 +275,7 @@ TEST(TestRegisterWithKey) {
       finalization_registry, js_object, undefined, token1, isolate);
 
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 1, *weak_cell1);
     VerifyWeakCellKeyChain(isolate, key_map, *token2, 0);
@@ -284,7 +287,7 @@ TEST(TestRegisterWithKey) {
       finalization_registry, js_object, undefined, token2, isolate);
 
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 1, *weak_cell1);
     VerifyWeakCellKeyChain(isolate, key_map, *token2, 1, *weak_cell2);
@@ -296,7 +299,7 @@ TEST(TestRegisterWithKey) {
       finalization_registry, js_object, undefined, token1, isolate);
 
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 2, *weak_cell3,
                            *weak_cell1);
@@ -322,20 +325,20 @@ TEST(TestWeakCellNullify1) {
   // Nullify the first WeakCell and verify internal data structures.
   NullifyWeakCell(weak_cell1, isolate);
   CHECK_EQ(finalization_registry->active_cells(), *weak_cell2);
-  CHECK(weak_cell2->prev().IsUndefined(isolate));
-  CHECK(weak_cell2->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell2->prev(), isolate));
+  CHECK(IsUndefined(weak_cell2->next(), isolate));
   CHECK_EQ(finalization_registry->cleared_cells(), *weak_cell1);
-  CHECK(weak_cell1->prev().IsUndefined(isolate));
-  CHECK(weak_cell1->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell1->prev(), isolate));
+  CHECK(IsUndefined(weak_cell1->next(), isolate));
 
   // Nullify the second WeakCell and verify internal data structures.
   NullifyWeakCell(weak_cell2, isolate);
-  CHECK(finalization_registry->active_cells().IsUndefined(isolate));
+  CHECK(IsUndefined(finalization_registry->active_cells(), isolate));
   CHECK_EQ(finalization_registry->cleared_cells(), *weak_cell2);
   CHECK_EQ(weak_cell2->next(), *weak_cell1);
-  CHECK(weak_cell2->prev().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell2->prev(), isolate));
   CHECK_EQ(weak_cell1->prev(), *weak_cell2);
-  CHECK(weak_cell1->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell1->next(), isolate));
 }
 
 TEST(TestWeakCellNullify2) {
@@ -356,19 +359,19 @@ TEST(TestWeakCellNullify2) {
   // Like TestWeakCellNullify1 but nullify the WeakCells in opposite order.
   NullifyWeakCell(weak_cell2, isolate);
   CHECK_EQ(finalization_registry->active_cells(), *weak_cell1);
-  CHECK(weak_cell1->prev().IsUndefined(isolate));
-  CHECK(weak_cell1->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell1->prev(), isolate));
+  CHECK(IsUndefined(weak_cell1->next(), isolate));
   CHECK_EQ(finalization_registry->cleared_cells(), *weak_cell2);
-  CHECK(weak_cell2->prev().IsUndefined(isolate));
-  CHECK(weak_cell2->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell2->prev(), isolate));
+  CHECK(IsUndefined(weak_cell2->next(), isolate));
 
   NullifyWeakCell(weak_cell1, isolate);
-  CHECK(finalization_registry->active_cells().IsUndefined(isolate));
+  CHECK(IsUndefined(finalization_registry->active_cells(), isolate));
   CHECK_EQ(finalization_registry->cleared_cells(), *weak_cell1);
   CHECK_EQ(weak_cell1->next(), *weak_cell2);
-  CHECK(weak_cell1->prev().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell1->prev(), isolate));
   CHECK_EQ(weak_cell2->prev(), *weak_cell1);
-  CHECK(weak_cell2->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell2->next(), isolate));
 }
 
 TEST(TestJSFinalizationRegistryPopClearedCellHoldings1) {
@@ -398,30 +401,33 @@ TEST(TestJSFinalizationRegistryPopClearedCellHoldings1) {
   NullifyWeakCell(weak_cell3, isolate);
 
   CHECK(finalization_registry->NeedsCleanup());
-  Object cleared1 = PopClearedCellHoldings(finalization_registry, isolate);
+  Tagged<Object> cleared1 =
+      PopClearedCellHoldings(finalization_registry, isolate);
   CHECK_EQ(cleared1, *holdings3);
-  CHECK(weak_cell3->prev().IsUndefined(isolate));
-  CHECK(weak_cell3->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell3->prev(), isolate));
+  CHECK(IsUndefined(weak_cell3->next(), isolate));
 
   CHECK(finalization_registry->NeedsCleanup());
-  Object cleared2 = PopClearedCellHoldings(finalization_registry, isolate);
+  Tagged<Object> cleared2 =
+      PopClearedCellHoldings(finalization_registry, isolate);
   CHECK_EQ(cleared2, *holdings2);
-  CHECK(weak_cell2->prev().IsUndefined(isolate));
-  CHECK(weak_cell2->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell2->prev(), isolate));
+  CHECK(IsUndefined(weak_cell2->next(), isolate));
 
   CHECK(!finalization_registry->NeedsCleanup());
 
   NullifyWeakCell(weak_cell1, isolate);
 
   CHECK(finalization_registry->NeedsCleanup());
-  Object cleared3 = PopClearedCellHoldings(finalization_registry, isolate);
+  Tagged<Object> cleared3 =
+      PopClearedCellHoldings(finalization_registry, isolate);
   CHECK_EQ(cleared3, *holdings1);
-  CHECK(weak_cell1->prev().IsUndefined(isolate));
-  CHECK(weak_cell1->next().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_cell1->prev(), isolate));
+  CHECK(IsUndefined(weak_cell1->next(), isolate));
 
   CHECK(!finalization_registry->NeedsCleanup());
-  CHECK(finalization_registry->active_cells().IsUndefined(isolate));
-  CHECK(finalization_registry->cleared_cells().IsUndefined(isolate));
+  CHECK(IsUndefined(finalization_registry->active_cells(), isolate));
+  CHECK(IsUndefined(finalization_registry->cleared_cells(), isolate));
 }
 
 TEST(TestJSFinalizationRegistryPopClearedCellHoldings2) {
@@ -451,26 +457,28 @@ TEST(TestJSFinalizationRegistryPopClearedCellHoldings2) {
   // Nullifying doesn't affect the key chains (just moves WeakCells from
   // active_cells to cleared_cells).
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 2, *weak_cell2,
                            *weak_cell1);
   }
 
-  Object cleared1 = PopClearedCellHoldings(finalization_registry, isolate);
+  Tagged<Object> cleared1 =
+      PopClearedCellHoldings(finalization_registry, isolate);
   CHECK_EQ(cleared1, *holdings2);
 
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 1, *weak_cell1);
   }
 
-  Object cleared2 = PopClearedCellHoldings(finalization_registry, isolate);
+  Tagged<Object> cleared2 =
+      PopClearedCellHoldings(finalization_registry, isolate);
   CHECK_EQ(cleared2, *holdings1);
 
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 0);
   }
@@ -505,7 +513,7 @@ TEST(TestUnregisterActiveCells) {
                       *weak_cell2b, *weak_cell2a, *weak_cell1b, *weak_cell1a);
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 0);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 2, *weak_cell1b,
                            *weak_cell1a);
@@ -515,7 +523,7 @@ TEST(TestUnregisterActiveCells) {
 
   JSFinalizationRegistry::Unregister(finalization_registry, token1, isolate);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 0);
     VerifyWeakCellKeyChain(isolate, key_map, *token2, 2, *weak_cell2b,
@@ -560,7 +568,7 @@ TEST(TestUnregisterActiveAndClearedCells) {
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 1,
                       *weak_cell2a);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 2, *weak_cell1b,
                            *weak_cell1a);
@@ -575,7 +583,7 @@ TEST(TestUnregisterActiveAndClearedCells) {
                       *weak_cell1b, *weak_cell1a);
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 0);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 2, *weak_cell1b,
                            *weak_cell1a);
@@ -604,7 +612,7 @@ TEST(TestWeakCellUnregisterTwice) {
                       *weak_cell1);
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 0);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 1, *weak_cell1);
   }
@@ -614,7 +622,7 @@ TEST(TestWeakCellUnregisterTwice) {
   VerifyWeakCellChain(isolate, finalization_registry->active_cells(), 0);
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 0);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 0);
   }
@@ -624,7 +632,7 @@ TEST(TestWeakCellUnregisterTwice) {
   VerifyWeakCellChain(isolate, finalization_registry->active_cells(), 0);
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 0);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 0);
   }
@@ -648,13 +656,14 @@ TEST(TestWeakCellUnregisterPopped) {
   NullifyWeakCell(weak_cell1, isolate);
 
   CHECK(finalization_registry->NeedsCleanup());
-  Object cleared1 = PopClearedCellHoldings(finalization_registry, isolate);
+  Tagged<Object> cleared1 =
+      PopClearedCellHoldings(finalization_registry, isolate);
   CHECK_EQ(cleared1, *holdings1);
 
   VerifyWeakCellChain(isolate, finalization_registry->active_cells(), 0);
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 0);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 0);
   }
@@ -664,7 +673,7 @@ TEST(TestWeakCellUnregisterPopped) {
   VerifyWeakCellChain(isolate, finalization_registry->active_cells(), 0);
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 0);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 0);
   }
@@ -699,17 +708,17 @@ TEST(TestJSWeakRef) {
     // This doesn't add the target into the KeepDuringJob set.
     Handle<JSWeakRef> inner_weak_ref = ConstructJSWeakRef(js_object, isolate);
 
-    CcTest::CollectAllGarbage();
-    CHECK(!inner_weak_ref->target().IsUndefined(isolate));
+    heap::InvokeMajorGC(CcTest::heap());
+    CHECK(!IsUndefined(inner_weak_ref->target(), isolate));
 
     weak_ref = inner_scope.CloseAndEscape(inner_weak_ref);
   }
 
-  CHECK(!weak_ref->target().IsUndefined(isolate));
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
 
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(CcTest::heap());
 
-  CHECK(weak_ref->target().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_ref->target(), isolate));
 }
 
 TEST(TestJSWeakRefIncrementalMarking) {
@@ -734,18 +743,18 @@ TEST(TestJSWeakRefIncrementalMarking) {
     Handle<JSWeakRef> inner_weak_ref = ConstructJSWeakRef(js_object, isolate);
 
     heap::SimulateIncrementalMarking(heap, true);
-    CcTest::CollectAllGarbage();
-    CHECK(!inner_weak_ref->target().IsUndefined(isolate));
+    heap::InvokeMajorGC(heap);
+    CHECK(!IsUndefined(inner_weak_ref->target(), isolate));
 
     weak_ref = inner_scope.CloseAndEscape(inner_weak_ref);
   }
 
-  CHECK(!weak_ref->target().IsUndefined(isolate));
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
 
   heap::SimulateIncrementalMarking(heap, true);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
-  CHECK(weak_ref->target().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_ref->target(), isolate));
 }
 
 TEST(TestJSWeakRefKeepDuringJob) {
@@ -758,34 +767,34 @@ TEST(TestJSWeakRefKeepDuringJob) {
 
   HandleScope outer_scope(isolate);
   Handle<JSWeakRef> weak_ref = MakeWeakRefAndKeepDuringJob(isolate);
-  CHECK(!weak_ref->target().IsUndefined(isolate));
-  CcTest::CollectAllGarbage();
-  CHECK(!weak_ref->target().IsUndefined(isolate));
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
 
   // Clears the KeepDuringJob set.
   context->GetIsolate()->ClearKeptObjects();
-  CcTest::CollectAllGarbage();
-  CHECK(weak_ref->target().IsUndefined(isolate));
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(IsUndefined(weak_ref->target(), isolate));
 
   weak_ref = MakeWeakRefAndKeepDuringJob(isolate);
-  CHECK(!weak_ref->target().IsUndefined(isolate));
-  CcTest::CollectAllGarbage();
-  CHECK(!weak_ref->target().IsUndefined(isolate));
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
 
   // ClearKeptObjects should be called by PerformMicrotasksCheckpoint.
   CcTest::isolate()->PerformMicrotaskCheckpoint();
-  CcTest::CollectAllGarbage();
-  CHECK(weak_ref->target().IsUndefined(isolate));
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(IsUndefined(weak_ref->target(), isolate));
 
   weak_ref = MakeWeakRefAndKeepDuringJob(isolate);
-  CHECK(!weak_ref->target().IsUndefined(isolate));
-  CcTest::CollectAllGarbage();
-  CHECK(!weak_ref->target().IsUndefined(isolate));
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
 
   // ClearKeptObjects should be called by MicrotasksScope::PerformCheckpoint.
   v8::MicrotasksScope::PerformCheckpoint(CcTest::isolate());
-  CcTest::CollectAllGarbage();
-  CHECK(weak_ref->target().IsUndefined(isolate));
+  heap::InvokeMajorGC(CcTest::heap());
+  CHECK(IsUndefined(weak_ref->target(), isolate));
 }
 
 TEST(TestJSWeakRefKeepDuringJobIncrementalMarking) {
@@ -802,19 +811,19 @@ TEST(TestJSWeakRefKeepDuringJobIncrementalMarking) {
   HandleScope outer_scope(isolate);
   Handle<JSWeakRef> weak_ref = MakeWeakRefAndKeepDuringJob(isolate);
 
-  CHECK(!weak_ref->target().IsUndefined(isolate));
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
 
   heap::SimulateIncrementalMarking(heap, true);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
-  CHECK(!weak_ref->target().IsUndefined(isolate));
+  CHECK(!IsUndefined(weak_ref->target(), isolate));
 
   // Clears the KeepDuringJob set.
   context->GetIsolate()->ClearKeptObjects();
   heap::SimulateIncrementalMarking(heap, true);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
-  CHECK(weak_ref->target().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_ref->target(), isolate));
 }
 
 TEST(TestRemoveUnregisterToken) {
@@ -849,7 +858,7 @@ TEST(TestRemoveUnregisterToken) {
   VerifyWeakCellChain(isolate, finalization_registry->cleared_cells(), 1,
                       *weak_cell2a);
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 2, *weak_cell1b,
                            *weak_cell1a);
@@ -860,7 +869,7 @@ TEST(TestRemoveUnregisterToken) {
   finalization_registry->RemoveUnregisterToken(
       JSReceiver::cast(*token2), isolate,
       JSFinalizationRegistry::kKeepMatchedCellsInRegistry,
-      [](HeapObject, ObjectSlot, Object) {});
+      [](Tagged<HeapObject>, ObjectSlot, Tagged<Object>) {});
 
   // Both weak_cell2a and weak_cell2b remain on the weak cell chains.
   VerifyWeakCellChain(isolate, finalization_registry->active_cells(), 3,
@@ -870,7 +879,7 @@ TEST(TestRemoveUnregisterToken) {
 
   // But both weak_cell2a and weak_cell2b are removed from the key chain.
   {
-    SimpleNumberDictionary key_map =
+    Tagged<SimpleNumberDictionary> key_map =
         SimpleNumberDictionary::cast(finalization_registry->key_map());
     VerifyWeakCellKeyChain(isolate, key_map, *token1, 2, *weak_cell1b,
                            *weak_cell1a);
@@ -922,11 +931,11 @@ TEST(JSWeakRefScavengedInWorklist) {
   }
 
   // Now collect both weak_ref and its target. The worklist should be empty.
-  CcTest::CollectGarbage(NEW_SPACE);
+  heap::InvokeMinorGC(heap);
   CHECK(heap->mark_compact_collector()->weak_objects()->js_weak_refs.IsEmpty());
 
   // The mark-compactor shouldn't see zapped WeakRefs in the worklist.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 }
 
 TEST(JSWeakRefTenuredInWorklist) {
@@ -959,7 +968,7 @@ TEST(JSWeakRefTenuredInWorklist) {
   // incremental marking.
   v8::Global<Value> global_weak_ref(
       CcTest::isolate(), Utils::ToLocal(Handle<Object>::cast(weak_ref)));
-  JSWeakRef old_weak_ref_location = *weak_ref;
+  Address old_weak_ref_location = weak_ref->address();
 
   // Do marking. This puts the WeakRef above into the js_weak_refs worklist
   // since its target isn't marked.
@@ -971,16 +980,16 @@ TEST(JSWeakRefTenuredInWorklist) {
 
   // Now collect weak_ref's target. We still have a Handle to weak_ref, so it is
   // moved and remains on the worklist.
-  CcTest::CollectGarbage(NEW_SPACE);
-  JSWeakRef new_weak_ref_location = *weak_ref;
+  heap::InvokeMinorGC(heap);
+  Address new_weak_ref_location = weak_ref->address();
   CHECK_NE(old_weak_ref_location, new_weak_ref_location);
   CHECK(
       !heap->mark_compact_collector()->weak_objects()->js_weak_refs.IsEmpty());
 
   // The mark-compactor should see the moved WeakRef in the worklist.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
   CHECK(heap->mark_compact_collector()->weak_objects()->js_weak_refs.IsEmpty());
-  CHECK(weak_ref->target().IsUndefined(isolate));
+  CHECK(IsUndefined(weak_ref->target(), isolate));
 }
 
 TEST(UnregisterTokenHeapVerifier) {
@@ -1013,8 +1022,8 @@ TEST(UnregisterTokenHeapVerifier) {
 
   // GC so the WeakCell corresponding to o is moved from the active_cells to
   // cleared_cells.
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
+  heap::InvokeMajorGC(heap);
 
   {
     // Override the unregister token to make the original object collectible.
@@ -1071,8 +1080,8 @@ TEST(UnregisteredAndUnclearedCellHeapVerifier) {
   }
 
   // Trigger GC.
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
+  heap::InvokeMajorGC(heap);
 
   // Pump message loop to run the finalizer task, then the incremental marking
   // task. The verifier will verify that live WeakCells don't point to dead
diff --git a/deps/v8/test/cctest/test-liveedit.cc b/deps/v8/test/cctest/test-liveedit.cc
index 67775c74aaffc6..b76b2ccec5b9a6 100644
--- a/deps/v8/test/cctest/test-liveedit.cc
+++ b/deps/v8/test/cctest/test-liveedit.cc
@@ -207,7 +207,7 @@ void PatchFunctions(v8::Local<v8::Context> context, const char* source_a,
       v8::Script::Compile(context, v8_str(isolate, source_a)).ToLocalChecked();
   script_a->Run(context).ToLocalChecked();
   i::Handle<i::Script> i_script_a(
-      i::Script::cast(v8::Utils::OpenHandle(*script_a)->shared().script()),
+      i::Script::cast(v8::Utils::OpenHandle(*script_a)->shared()->script()),
       i_isolate);
 
   if (result) {
@@ -543,7 +543,7 @@ TEST(LiveEditFunctionExpression) {
   v8::Local<v8::Function> f =
       script->Run(context).ToLocalChecked().As<v8::Function>();
   i::Handle<i::Script> i_script(
-      i::Script::cast(v8::Utils::OpenHandle(*script)->shared().script()),
+      i::Script::cast(v8::Utils::OpenHandle(*script)->shared()->script()),
       i_isolate);
   debug::LiveEditResult result;
   LiveEdit::PatchScript(
diff --git a/deps/v8/test/cctest/test-lockers.cc b/deps/v8/test/cctest/test-lockers.cc
index b75e68bc0a3ee2..dfdc08af8bc01e 100644
--- a/deps/v8/test/cctest/test-lockers.cc
+++ b/deps/v8/test/cctest/test-lockers.cc
@@ -70,8 +70,9 @@ class DeoptimizeCodeThread : public v8::base::Thread {
   const char* source_;
 };
 
-void UnlockForDeoptimization(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void UnlockForDeoptimization(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   // Gets the pointer to the thread that will trigger the deoptimization of the
   // code.
   DeoptimizeCodeThread* deoptimizer =
@@ -91,8 +92,9 @@ void UnlockForDeoptimization(const v8::FunctionCallbackInfo<v8::Value>& args) {
 }
 
 void UnlockForDeoptimizationIfReady(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   bool* ready_to_deoptimize = reinterpret_cast<bool*>(isolate->GetData(1));
   if (*ready_to_deoptimize) {
     // The test should enter here only once, so put the flag back to false.
diff --git a/deps/v8/test/cctest/test-log-stack-tracer.cc b/deps/v8/test/cctest/test-log-stack-tracer.cc
index b04f57f7c1066d..824f42178b8f3d 100644
--- a/deps/v8/test/cctest/test-log-stack-tracer.cc
+++ b/deps/v8/test/cctest/test-log-stack-tracer.cc
@@ -43,10 +43,10 @@
 namespace v8 {
 namespace internal {
 
-static bool IsAddressWithinFuncCode(JSFunction function, Isolate* isolate,
-                                    void* addr) {
-  i::AbstractCode code = function.abstract_code(isolate);
-  return code.contains(isolate, reinterpret_cast<Address>(addr));
+static bool IsAddressWithinFuncCode(Tagged<JSFunction> function,
+                                    Isolate* isolate, void* addr) {
+  i::Tagged<i::AbstractCode> code = function->abstract_code(isolate);
+  return code->contains(isolate, reinterpret_cast<Address>(addr));
 }
 
 static bool IsAddressWithinFuncCode(v8::Local<v8::Context> context,
@@ -55,20 +55,23 @@ static bool IsAddressWithinFuncCode(v8::Local<v8::Context> context,
   v8::Local<v8::Value> func =
       context->Global()->Get(context, v8_str(func_name)).ToLocalChecked();
   CHECK(func->IsFunction());
-  JSFunction js_func = JSFunction::cast(*v8::Utils::OpenHandle(*func));
+  Tagged<JSFunction> js_func = JSFunction::cast(*v8::Utils::OpenHandle(*func));
   return IsAddressWithinFuncCode(js_func, isolate, addr);
 }
 
 // This C++ function is called as a constructor, to grab the frame pointer
 // from the calling function.  When this function runs, the stack contains
 // a C_Entry frame and a Construct frame above the calling function's frame.
-static void construct_call(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(args.GetIsolate());
+static void construct_call(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
   i::StackFrameIterator frame_iterator(isolate);
   CHECK(frame_iterator.frame()->is_exit() ||
-        frame_iterator.frame()->is_builtin_exit());
+        frame_iterator.frame()->is_builtin_exit() ||
+        frame_iterator.frame()->is_api_callback_exit());
   frame_iterator.Advance();
-  CHECK(frame_iterator.frame()->is_construct());
+  CHECK(frame_iterator.frame()->is_construct() ||
+        frame_iterator.frame()->is_fast_construct());
   frame_iterator.Advance();
   if (frame_iterator.frame()->type() == i::StackFrame::STUB) {
     // Skip over bytecode handler frame.
@@ -77,10 +80,10 @@ static void construct_call(const v8::FunctionCallbackInfo<v8::Value>& args) {
   i::StackFrame* calling_frame = frame_iterator.frame();
   CHECK(calling_frame->is_java_script());
 
-  v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+  v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
 #if defined(V8_HOST_ARCH_32_BIT)
   int32_t low_bits = static_cast<int32_t>(calling_frame->fp());
-  args.This()
+  info.This()
       ->Set(context, v8_str("low_bits"), v8_num(low_bits >> 1))
       .FromJust();
 #elif defined(V8_HOST_ARCH_64_BIT)
@@ -92,15 +95,14 @@ static void construct_call(const v8::FunctionCallbackInfo<v8::Value>& args) {
   int32_t high_bits = static_cast<int32_t>(fp & kSmiValueMask);
   fp >>= kSmiValueSize - 1;
   CHECK_EQ(fp, 0);  // Ensure all the bits are successfully encoded.
-  args.This()->Set(context, v8_str("low_bits"), v8_int(low_bits)).FromJust();
-  args.This()->Set(context, v8_str("high_bits"), v8_int(high_bits)).FromJust();
+  info.This()->Set(context, v8_str("low_bits"), v8_int(low_bits)).FromJust();
+  info.This()->Set(context, v8_str("high_bits"), v8_int(high_bits)).FromJust();
 #else
 #error Host architecture is neither 32-bit nor 64-bit.
 #endif
-  args.GetReturnValue().Set(args.This());
+  info.GetReturnValue().Set(info.This());
 }
 
-
 // Use the API to create a JSFunction object that calls the above C++ function.
 void CreateFramePointerGrabberConstructor(v8::Local<v8::Context> context,
                                           const char* constructor_name) {
@@ -237,7 +239,7 @@ TEST(PureJSStackTrace) {
                                 sample.stack[base + 1]));
 }
 
-static void CFuncDoTrace(byte dummy_param) {
+static void CFuncDoTrace(uint8_t dummy_param) {
   Address fp;
 #if V8_HAS_BUILTIN_FRAME_ADDRESS
   fp = reinterpret_cast<Address>(__builtin_frame_address(0));
@@ -251,7 +253,6 @@ static void CFuncDoTrace(byte dummy_param) {
   i::TraceExtension::DoTrace(fp);
 }
 
-
 static int CFunc(int depth) {
   if (depth <= 0) {
     CFuncDoTrace(0);
diff --git a/deps/v8/test/cctest/test-macro-assembler-arm.cc b/deps/v8/test/cctest/test-macro-assembler-arm.cc
index cce64f00804f24..a1a0cc3d3a3c28 100644
--- a/deps/v8/test/cctest/test-macro-assembler-arm.cc
+++ b/deps/v8/test/cctest/test-macro-assembler-arm.cc
@@ -150,7 +150,7 @@ TEST(ExtractLane) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
   f.Call(&t, 0, 0, 0, 0);
@@ -281,7 +281,7 @@ TEST(ReplaceLane) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
   f.Call(&t, 0, 0, 0, 0);
diff --git a/deps/v8/test/cctest/test-macro-assembler-loong64.cc b/deps/v8/test/cctest/test-macro-assembler-loong64.cc
index 39392799932418..05945f118fe702 100644
--- a/deps/v8/test/cctest/test-macro-assembler-loong64.cc
+++ b/deps/v8/test/cctest/test-macro-assembler-loong64.cc
@@ -218,7 +218,7 @@ TEST(jump_tables4) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -302,7 +302,7 @@ TEST(jump_tables6) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kSwitchTableCases; ++i) {
@@ -1492,8 +1492,7 @@ static GeneratedCode<F4> GenerateMacroFloat32MinMax(MacroAssembler* masm) {
       Factory::CodeBuilder(masm->isolate(), desc, CodeKind::FOR_TESTING)
           .Build();
 #ifdef DEBUG
-  StdoutStream os;
-  code->Print(os);
+  Print(*code);
 #endif
   return GeneratedCode<F4>::FromCode(masm->isolate(), *code);
 }
@@ -1639,8 +1638,7 @@ static GeneratedCode<F4> GenerateMacroFloat64MinMax(MacroAssembler* masm) {
       Factory::CodeBuilder(masm->isolate(), desc, CodeKind::FOR_TESTING)
           .Build();
 #ifdef DEBUG
-  StdoutStream os;
-  code->Print(os);
+  Print(*code);
 #endif
   return GeneratedCode<F4>::FromCode(masm->isolate(), *code);
 }
@@ -1737,7 +1735,7 @@ uint64_t run_Sub_w(uint64_t imm, int32_t num_instr) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
 
@@ -1821,7 +1819,7 @@ uint64_t run_Sub_d(uint64_t imm, int32_t num_instr) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F2>::FromCode(isolate, *code);
 
diff --git a/deps/v8/test/cctest/test-macro-assembler-mips64.cc b/deps/v8/test/cctest/test-macro-assembler-mips64.cc
index 6b821931ecd8e1..693b60149e48dc 100644
--- a/deps/v8/test/cctest/test-macro-assembler-mips64.cc
+++ b/deps/v8/test/cctest/test-macro-assembler-mips64.cc
@@ -267,7 +267,7 @@ TEST(jump_tables4) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -337,7 +337,7 @@ TEST(jump_tables5) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -426,7 +426,7 @@ TEST(jump_tables6) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kSwitchTableCases; ++i) {
@@ -1473,8 +1473,7 @@ static GeneratedCode<F4> GenerateMacroFloat32MinMax(MacroAssembler* masm) {
       Factory::CodeBuilder(masm->isolate(), desc, CodeKind::FOR_TESTING)
           .Build();
 #ifdef DEBUG
-  StdoutStream os;
-  code->Print(os);
+  Print(*code);
 #endif
   return GeneratedCode<F4>::FromCode(masm->isolate(), *code);
 }
@@ -1621,8 +1620,7 @@ static GeneratedCode<F4> GenerateMacroFloat64MinMax(MacroAssembler* masm) {
       Factory::CodeBuilder(masm->isolate(), desc, CodeKind::FOR_TESTING)
           .Build();
 #ifdef DEBUG
-  StdoutStream os;
-  code->Print(os);
+  Print(*code);
 #endif
   return GeneratedCode<F4>::FromCode(masm->isolate(), *code);
 }
diff --git a/deps/v8/test/cctest/test-macro-assembler-riscv32.cc b/deps/v8/test/cctest/test-macro-assembler-riscv32.cc
index 533e1ac043442e..68c1e72d3aa91f 100644
--- a/deps/v8/test/cctest/test-macro-assembler-riscv32.cc
+++ b/deps/v8/test/cctest/test-macro-assembler-riscv32.cc
@@ -230,7 +230,7 @@ TEST(jump_tables4) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -317,7 +317,7 @@ TEST(jump_tables6) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kSwitchTableCases; ++i) {
diff --git a/deps/v8/test/cctest/test-macro-assembler-riscv64.cc b/deps/v8/test/cctest/test-macro-assembler-riscv64.cc
index d88b2912f770bd..09cfa32ff9610a 100644
--- a/deps/v8/test/cctest/test-macro-assembler-riscv64.cc
+++ b/deps/v8/test/cctest/test-macro-assembler-riscv64.cc
@@ -228,7 +228,7 @@ TEST(jump_tables4) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kNumCases; ++i) {
@@ -315,7 +315,7 @@ TEST(jump_tables6) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   for (int i = 0; i < kSwitchTableCases; ++i) {
@@ -659,6 +659,7 @@ TEST(min_max_nan) {
 
   auto fn = [](MacroAssembler& masm) {
     __ push(s6);
+    __ push(s11);
     __ InitializeRootRegister();
     __ LoadDouble(fa3, MemOperand(a0, offsetof(TestFloat, a)));
     __ LoadDouble(fa4, MemOperand(a0, offsetof(TestFloat, b)));
@@ -672,6 +673,7 @@ TEST(min_max_nan) {
     __ StoreDouble(fa6, MemOperand(a0, offsetof(TestFloat, d)));
     __ StoreFloat(fa7, MemOperand(a0, offsetof(TestFloat, g)));
     __ StoreFloat(fa0, MemOperand(a0, offsetof(TestFloat, h)));
+    __ pop(s11);
     __ pop(s6);
   };
   auto f = AssembleCode<F3>(isolate, fn);
diff --git a/deps/v8/test/cctest/test-mementos.cc b/deps/v8/test/cctest/test-mementos.cc
index 1fd892815a2727..e64f5239459822 100644
--- a/deps/v8/test/cctest/test-mementos.cc
+++ b/deps/v8/test/cctest/test-mementos.cc
@@ -30,6 +30,7 @@
 #include "src/heap/heap-inl.h"
 #include "src/objects/objects-inl.h"
 #include "test/cctest/cctest.h"
+#include "test/cctest/heap/heap-utils.h"
 
 namespace v8 {
 namespace internal {
@@ -40,7 +41,7 @@ static void SetUpNewSpaceWithPoisonedMementoAtTop() {
   NewSpace* new_space = heap->new_space();
 
   // Make sure we can allocate some objects without causing a GC later.
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
   // Allocate a string, the GC may suspect a memento behind the string.
   Handle<SeqOneByteString> string =
@@ -49,10 +50,10 @@ static void SetUpNewSpaceWithPoisonedMementoAtTop() {
 
   // Create an allocation memento behind the string with a garbage allocation
   // site pointer.
-  AllocationMemento memento = AllocationMemento::unchecked_cast(
+  Tagged<AllocationMemento> memento = AllocationMemento::unchecked_cast(
       Object(new_space->top() + kHeapObjectTag));
-  memento.set_map_after_allocation(ReadOnlyRoots(heap).allocation_memento_map(),
-                                   SKIP_WRITE_BARRIER);
+  memento->set_map_after_allocation(
+      ReadOnlyRoots(heap).allocation_memento_map(), SKIP_WRITE_BARRIER);
 
   // Using this accessor because set_memento expects an Object and not a
   // MaybeObject.
@@ -71,16 +72,16 @@ TEST(Regress340063) {
 
   // Call GC to see if we can handle a poisonous memento right after the
   // current new space top pointer.
-  CcTest::PreciseCollectAllGarbage();
+  i::heap::InvokeAtomicMajorGC(CcTest::heap());
 }
 
 
 TEST(Regress470390) {
 #ifdef VERIFY_HEAP
-  // With MinorMC, we may have object allocated after `new_space->top()`. If the
+  // With MinorMS, we may have object allocated after `new_space->top()`. If the
   // next object after `new_space->top()` is an invalid memento, heap
   // verification should fail.
-  if (v8_flags.minor_mc) return;
+  if (v8_flags.minor_ms) return;
 #endif  // VERIFY_HEAP
 
   CcTest::InitializeVM();
@@ -91,16 +92,15 @@ TEST(Regress470390) {
   SetUpNewSpaceWithPoisonedMementoAtTop();
 
   // Set the new space limit to be equal to the top.
-  Address top = CcTest::i_isolate()->heap()->new_space()->top();
-  *(CcTest::i_isolate()->heap()->new_space()->allocation_limit_address()) = top;
+  Address top = CcTest::heap()->new_space()->top();
+  *(CcTest::heap()->new_space()->allocation_limit_address()) = top;
 
   // Call GC to see if we can handle a poisonous memento right after the
   // current new space top pointer.
-  CcTest::PreciseCollectAllGarbage();
+  i::heap::InvokeAtomicMajorGC(CcTest::heap());
 }
 
-
-TEST(BadMementoAfterTopForceScavenge) {
+TEST(BadMementoAfterTopForceMinorGC) {
   CcTest::InitializeVM();
   if (!i::v8_flags.allocation_site_pretenuring || v8_flags.single_generation)
     return;
@@ -109,7 +109,7 @@ TEST(BadMementoAfterTopForceScavenge) {
   SetUpNewSpaceWithPoisonedMementoAtTop();
 
   // Force GC to test the poisoned memento handling
-  CcTest::CollectGarbage(i::NEW_SPACE);
+  i::heap::InvokeMinorGC(CcTest::heap());
 }
 
 }  // namespace internal
diff --git a/deps/v8/test/cctest/test-orderedhashtable.cc b/deps/v8/test/cctest/test-orderedhashtable.cc
index 72ff991e2cd982..dbaf97eb225798 100644
--- a/deps/v8/test/cctest/test-orderedhashtable.cc
+++ b/deps/v8/test/cctest/test-orderedhashtable.cc
@@ -16,13 +16,13 @@ static Isolate* GetIsolateFrom(LocalContext* context) {
 }
 
 void CopyHashCode(Handle<JSReceiver> from, Handle<JSReceiver> to) {
-  int hash = Smi::ToInt(from->GetHash());
+  int hash = Smi::ToInt(Object::GetHash(*from));
   to->SetIdentityHash(hash);
 }
 
 void Verify(Isolate* isolate, Handle<HeapObject> obj) {
 #if VERIFY_HEAP
-  obj->ObjectVerify(isolate);
+  Object::ObjectVerify(*obj, isolate);
 #endif
 }
 
@@ -59,19 +59,20 @@ Handle<OrderedNameDictionary> Add(Isolate* isolate,
 // version for
 // OrderedHashMap, OrderedHashSet
 template <typename T>
-bool HasKey(Isolate* isolate, Handle<T> table, Object key) {
+bool HasKey(Isolate* isolate, Handle<T> table, Tagged<Object> key) {
   return T::HasKey(isolate, *table, key);
 }
 
 template <>
-bool HasKey(Isolate* isolate, Handle<OrderedNameDictionary> table, Object key) {
+bool HasKey(Isolate* isolate, Handle<OrderedNameDictionary> table,
+            Tagged<Object> key) {
   return table->FindEntry(isolate, key).is_found();
 }
 
 // version for
 // OrderedHashTable, OrderedHashSet
 template <typename T>
-Handle<T> Delete(Isolate* isolate, Handle<T> table, Object key) {
+Handle<T> Delete(Isolate* isolate, Handle<T> table, Tagged<Object> key) {
   T::Delete(isolate, *table, key);
   return table;
 }
@@ -79,7 +80,7 @@ Handle<T> Delete(Isolate* isolate, Handle<T> table, Object key) {
 template <>
 Handle<OrderedNameDictionary> Delete(Isolate* isolate,
                                      Handle<OrderedNameDictionary> table,
-                                     Object key) {
+                                     Tagged<Object> key) {
   // OrderedNameDictionary doesn't have Delete, but only DeleteEntry, which
   // requires the key to be deleted to be present
   InternalIndex entry = table->FindEntry(isolate, key);
@@ -297,9 +298,9 @@ TEST(SmallOrderedHashMapDuplicateHashCode) {
   Handle<JSObject> key2 = factory->NewJSObjectWithNullProto();
   CopyHashCode(key1, key2);
 
-  CHECK(!key1->SameValue(*key2));
-  Object hash1 = key1->GetHash();
-  Object hash2 = key2->GetHash();
+  CHECK(!Object::SameValue(*key1, *key2));
+  Tagged<Object> hash1 = Object::GetHash(*key1);
+  Tagged<Object> hash2 = Object::GetHash(*key2);
   CHECK_EQ(hash1, hash2);
 
   map = SmallOrderedHashMap::Add(isolate, map, key2, value).ToHandleChecked();
@@ -1421,7 +1422,8 @@ TEST(OrderedNameDictionaryInsertion) {
   Factory* factory = isolate->factory();
   HandleScope scope(isolate);
 
-  Handle<OrderedNameDictionary> dict = factory->NewOrderedNameDictionary();
+  Handle<OrderedNameDictionary> dict =
+      OrderedNameDictionary::Allocate(isolate, 2).ToHandleChecked();
   Verify(isolate, dict);
   CHECK_EQ(2, dict->NumberOfBuckets());
   CHECK_EQ(0, dict->NumberOfElements());
@@ -1455,7 +1457,8 @@ TEST(OrderedNameDictionaryFindEntry) {
   Factory* factory = isolate->factory();
   HandleScope scope(isolate);
 
-  Handle<OrderedNameDictionary> dict = factory->NewOrderedNameDictionary();
+  Handle<OrderedNameDictionary> dict =
+      OrderedNameDictionary::Allocate(isolate, 2).ToHandleChecked();
   Verify(isolate, dict);
   CHECK_EQ(2, dict->NumberOfBuckets());
   CHECK_EQ(0, dict->NumberOfElements());
@@ -1495,7 +1498,8 @@ TEST(OrderedNameDictionaryValueAtAndValueAtPut) {
   Factory* factory = isolate->factory();
   HandleScope scope(isolate);
 
-  Handle<OrderedNameDictionary> dict = factory->NewOrderedNameDictionary();
+  Handle<OrderedNameDictionary> dict =
+      OrderedNameDictionary::Allocate(isolate, 2).ToHandleChecked();
   Verify(isolate, dict);
   CHECK_EQ(2, dict->NumberOfBuckets());
   CHECK_EQ(0, dict->NumberOfElements());
@@ -1555,7 +1559,8 @@ TEST(OrderedNameDictionaryDetailsAtAndDetailsAtPut) {
   Factory* factory = isolate->factory();
   HandleScope scope(isolate);
 
-  Handle<OrderedNameDictionary> dict = factory->NewOrderedNameDictionary();
+  Handle<OrderedNameDictionary> dict =
+      OrderedNameDictionary::Allocate(isolate, 2).ToHandleChecked();
   Verify(isolate, dict);
   CHECK_EQ(2, dict->NumberOfBuckets());
   CHECK_EQ(0, dict->NumberOfElements());
@@ -1855,9 +1860,9 @@ TEST(SmallOrderedNameDictionarySetAndMigrateHash) {
 TEST(OrderedNameDictionarySetAndMigrateHash) {
   LocalContext context;
   Isolate* isolate = GetIsolateFrom(&context);
-  Factory* factory = isolate->factory();
   HandleScope scope(isolate);
-  Handle<OrderedNameDictionary> dict = factory->NewOrderedNameDictionary();
+  Handle<OrderedNameDictionary> dict =
+      OrderedNameDictionary::Allocate(isolate, 2).ToHandleChecked();
   Handle<String> value = isolate->factory()->InternalizeUtf8String("bar");
   PropertyDetails details = PropertyDetails::Empty();
 
@@ -1883,7 +1888,7 @@ TEST(OrderedNameDictionaryHandlerInsertion) {
 
   Handle<HeapObject> table =
       OrderedNameDictionaryHandler::Allocate(isolate, 4).ToHandleChecked();
-  CHECK(table->IsSmallOrderedNameDictionary());
+  CHECK(IsSmallOrderedNameDictionary(*table));
   Verify(isolate, table);
 
   // Add a new key.
@@ -1893,9 +1898,9 @@ TEST(OrderedNameDictionaryHandlerInsertion) {
 
   table = OrderedNameDictionaryHandler::Add(isolate, table, key, value, details)
               .ToHandleChecked();
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   Verify(isolate, table);
-  CHECK(table->IsSmallOrderedNameDictionary());
+  CHECK(IsSmallOrderedNameDictionary(*table));
   CHECK(OrderedNameDictionaryHandler::FindEntry(isolate, *table, *key)
             .is_found());
 
@@ -1906,7 +1911,7 @@ TEST(OrderedNameDictionaryHandlerInsertion) {
     table =
         OrderedNameDictionaryHandler::Add(isolate, table, key, value, details)
             .ToHandleChecked();
-    DCHECK(key->IsUniqueName());
+    DCHECK(IsUniqueName(*key));
     Verify(isolate, table);
 
     for (int j = 0; j <= i; j++) {
@@ -1924,7 +1929,7 @@ TEST(OrderedNameDictionaryHandlerInsertion) {
     }
   }
 
-  CHECK(table->IsOrderedNameDictionary());
+  CHECK(IsOrderedNameDictionary(*table));
 }
 
 TEST(OrderedNameDictionaryHandlerDeletion) {
@@ -1934,7 +1939,7 @@ TEST(OrderedNameDictionaryHandlerDeletion) {
 
   Handle<HeapObject> table =
       OrderedNameDictionaryHandler::Allocate(isolate, 4).ToHandleChecked();
-  CHECK(table->IsSmallOrderedNameDictionary());
+  CHECK(IsSmallOrderedNameDictionary(*table));
   Verify(isolate, table);
 
   // Add a new key.
@@ -1945,16 +1950,16 @@ TEST(OrderedNameDictionaryHandlerDeletion) {
 
   table = OrderedNameDictionaryHandler::Add(isolate, table, key, value, details)
               .ToHandleChecked();
-  DCHECK(key->IsUniqueName());
+  DCHECK(IsUniqueName(*key));
   Verify(isolate, table);
-  CHECK(table->IsSmallOrderedNameDictionary());
+  CHECK(IsSmallOrderedNameDictionary(*table));
   CHECK(OrderedNameDictionaryHandler::FindEntry(isolate, *table, *key)
             .is_found());
 
   // Remove a non-existing key.
   OrderedNameDictionaryHandler::Delete(isolate, table, key2);
   Verify(isolate, table);
-  CHECK(table->IsSmallOrderedNameDictionary());
+  CHECK(IsSmallOrderedNameDictionary(*table));
   CHECK(OrderedNameDictionaryHandler::FindEntry(isolate, *table, *key2)
             .is_not_found());
   CHECK(OrderedNameDictionaryHandler::FindEntry(isolate, *table, *key)
@@ -1963,11 +1968,11 @@ TEST(OrderedNameDictionaryHandlerDeletion) {
   // Remove an existing key.
   OrderedNameDictionaryHandler::Delete(isolate, table, key);
   Verify(isolate, table);
-  CHECK(table->IsSmallOrderedNameDictionary());
+  CHECK(IsSmallOrderedNameDictionary(*table));
   CHECK(OrderedNameDictionaryHandler::FindEntry(isolate, *table, *key)
             .is_not_found());
 
-  CHECK(table->IsSmallOrderedNameDictionary());
+  CHECK(IsSmallOrderedNameDictionary(*table));
 }
 
 TEST(OrderedNameDictionarySetEntry) {
@@ -1976,7 +1981,8 @@ TEST(OrderedNameDictionarySetEntry) {
   Factory* factory = isolate->factory();
   HandleScope scope(isolate);
 
-  Handle<OrderedNameDictionary> dict = factory->NewOrderedNameDictionary();
+  Handle<OrderedNameDictionary> dict =
+      OrderedNameDictionary::Allocate(isolate, 2).ToHandleChecked();
   Verify(isolate, dict);
   CHECK_EQ(2, dict->NumberOfBuckets());
   CHECK_EQ(0, dict->NumberOfElements());
@@ -2063,7 +2069,8 @@ TEST(OrderedNameDictionaryDeleteEntry) {
   Factory* factory = isolate->factory();
   HandleScope scope(isolate);
 
-  Handle<OrderedNameDictionary> dict = factory->NewOrderedNameDictionary();
+  Handle<OrderedNameDictionary> dict =
+      OrderedNameDictionary::Allocate(isolate, 2).ToHandleChecked();
   Verify(isolate, dict);
   CHECK_EQ(2, dict->NumberOfBuckets());
   CHECK_EQ(0, dict->NumberOfElements());
@@ -2094,7 +2101,7 @@ TEST(OrderedNameDictionaryDeleteEntry) {
     key = factory->InternalizeUtf8String(buf);
     dict = OrderedNameDictionary::Add(isolate, dict, key, value, details)
                .ToHandleChecked();
-    DCHECK(key->IsUniqueName());
+    DCHECK(IsUniqueName(*key));
     Verify(isolate, dict);
   }
 
@@ -2156,7 +2163,7 @@ TEST(SmallOrderedNameDictionaryDeleteEntry) {
     key = factory->InternalizeUtf8String(buf);
     dict = SmallOrderedNameDictionary::Add(isolate, dict, key, value, details)
                .ToHandleChecked();
-    DCHECK(key->IsUniqueName());
+    DCHECK(IsUniqueName(*key));
     Verify(isolate, dict);
   }
 
@@ -2261,7 +2268,8 @@ TEST(ZeroSizeOrderedHashMap) {
   {
     Handle<OrderedHashMap> map = empty;
 
-    map = OrderedHashMap::EnsureGrowable(isolate, map).ToHandleChecked();
+    map =
+        OrderedHashMap::EnsureCapacityForAdding(isolate, map).ToHandleChecked();
 
     CHECK_LT(0, map->NumberOfBuckets());
     CHECK_EQ(0, map->NumberOfElements());
@@ -2336,7 +2344,8 @@ TEST(ZeroSizeOrderedHashSet) {
   {
     Handle<OrderedHashSet> set = empty;
 
-    set = OrderedHashSet::EnsureGrowable(isolate, set).ToHandleChecked();
+    set =
+        OrderedHashSet::EnsureCapacityForAdding(isolate, set).ToHandleChecked();
 
     CHECK_LT(0, set->NumberOfBuckets());
     CHECK_EQ(0, set->NumberOfElements());
diff --git a/deps/v8/test/cctest/test-profile-generator.cc b/deps/v8/test/cctest/test-profile-generator.cc
index e34554951c5587..ceb2f8c8658c0f 100644
--- a/deps/v8/test/cctest/test-profile-generator.cc
+++ b/deps/v8/test/cctest/test-profile-generator.cc
@@ -874,7 +874,7 @@ int GetFunctionLineNumber(CpuProfiler* profiler, LocalContext* env,
           (*env)->Global()->Get(env->local(), v8_str(name)).ToLocalChecked())));
   PtrComprCageBase cage_base(isolate);
   CodeEntry* func_entry = instruction_stream_map->FindEntry(
-      func->abstract_code(isolate).InstructionStart(cage_base));
+      func->abstract_code(isolate)->InstructionStart(cage_base));
   if (!func_entry) FATAL("%s", name);
   return func_entry->line_number();
 }
diff --git a/deps/v8/test/cctest/test-regexp.cc b/deps/v8/test/cctest/test-regexp.cc
index 81e75b9d7c9813..c5da72b59d13ce 100644
--- a/deps/v8/test/cctest/test-regexp.cc
+++ b/deps/v8/test/cctest/test-regexp.cc
@@ -7,6 +7,7 @@
 #include "src/api/api-inl.h"
 #include "src/execution/frames-inl.h"
 #include "test/cctest/cctest.h"
+#include "test/cctest/heap/heap-utils.h"
 
 using namespace v8;
 
@@ -68,23 +69,26 @@ class InterruptTest {
 
   void RunTest(InterruptCallback test_body_fn) {
     HandleScope handle_scope(isolate_);
+    Local<RegExp> re =
+        RegExp::New(env_.local(), v8_str("((a*)*)*b"), v8::RegExp::kNone)
+            .ToLocalChecked();
+    regexp_handle_.Reset(isolate_, re);
     i_thread.SetTestBody(test_body_fn);
     CHECK(i_thread.Start());
     TestBody();
     i_thread.Join();
   }
 
-  static void CollectAllGarbage(Isolate* isolate, void* data) {
+  static void InvokeMajorGC(Isolate* isolate, void* data) {
     i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
-    i_isolate->heap()->PreciseCollectAllGarbage(
-        i::Heap::kNoGCFlags, i::GarbageCollectionReason::kTesting);
+    i::heap::InvokeAtomicMajorGC(i_isolate->heap());
   }
 
   static void MakeSubjectOneByteExternal(Isolate* isolate, void* data) {
     auto instance = reinterpret_cast<InterruptTest*>(data);
     HandleScope scope(isolate);
     Local<String> string =
-        Local<String>::New(isolate, instance->one_byte_string_handle_);
+        Local<String>::New(isolate, instance->subject_string_handle_);
     CHECK(string->CanMakeExternal(String::Encoding::ONE_BYTE_ENCODING));
     string->MakeExternal(&one_byte_string_resource);
   }
@@ -93,11 +97,37 @@ class InterruptTest {
     auto instance = reinterpret_cast<InterruptTest*>(data);
     HandleScope scope(isolate);
     Local<String> string =
-        Local<String>::New(isolate, instance->two_byte_string_handle_);
+        Local<String>::New(isolate, instance->subject_string_handle_);
     CHECK(string->CanMakeExternal(String::Encoding::TWO_BYTE_ENCODING));
     string->MakeExternal(&two_byte_string_resource);
   }
 
+  static void TwoByteSubjectToOneByte(Isolate* isolate, void* data) {
+    auto instance = reinterpret_cast<InterruptTest*>(data);
+    HandleScope scope(isolate);
+    Local<RegExp> re = instance->regexp_handle_.Get(isolate);
+    i::Handle<i::JSRegExp> regexp = Utils::OpenHandle(*re);
+    // We executed on a two-byte subject so far, so we expect only bytecode for
+    // two-byte to be present.
+    i::Tagged<i::Object> one_byte_code = regexp->bytecode(/* is_latin1 */ true);
+    CHECK(IsSmi(one_byte_code));
+    CHECK_EQ(i::Smi::cast(one_byte_code).value(),
+             i::JSRegExp::kUninitializedValue);
+    i::Tagged<i::Object> two_byte_code =
+        regexp->bytecode(/* is_latin1 */ false);
+    CHECK(IsByteArray(two_byte_code));
+
+    // Transition the subject string to one-byte by internalizing it.
+    // It already contains only one-byte characters.
+    Local<String> string = instance->GetSubjectString();
+    CHECK(!string->IsOneByte());
+    CHECK(string->ContainsOnlyOneByte());
+    // Internalize the subject by using it as a computed property name in an
+    // object.
+    CompileRun("o = { [subject_string]: 'foo' }");
+    CHECK(string->IsOneByte());
+  }
+
   static void IterateStack(Isolate* isolate, void* data) {
     HandleScope scope(isolate);
 
@@ -113,7 +143,7 @@ class InterruptTest {
     state.sp = &state;
 #endif
 
-    i::StackFrameIteratorForProfiler it(
+    i::StackFrameIteratorForProfilerForTesting it(
         i_isolate, reinterpret_cast<i::Address>(state.pc),
         reinterpret_cast<i::Address>(state.fp),
         reinterpret_cast<i::Address>(state.sp),
@@ -128,20 +158,20 @@ class InterruptTest {
     }
   }
 
- private:
-  static void SignalSemaphore(Isolate* isolate, void* data) {
-    reinterpret_cast<InterruptTest*>(data)->sem_.Signal();
-  }
-
-  void CreateTestStrings() {
-    i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate_);
-
+  void SetOneByteSubjectString() {
+    HandleScope handle_scope(isolate_);
+    i::Isolate* i_isolate = this->i_isolate();
     // The string must be in old space to support externalization.
     i::Handle<i::String> i_one_byte_string =
         i_isolate->factory()->NewStringFromAsciiChecked(
             &kOneByteSubjectString[0], i::AllocationType::kOld);
-    Local<String> one_byte_string = Utils::ToLocal(i_one_byte_string);
+    SetSubjectString(Utils::ToLocal(i_one_byte_string));
+  }
 
+  void SetTwoByteSubjectString() {
+    HandleScope handle_scope(isolate_);
+    i::Isolate* i_isolate = this->i_isolate();
+    // The string must be in old space to support externalization.
     i::Handle<i::String> i_two_byte_string =
         i_isolate->factory()
             ->NewStringFromTwoByte(
@@ -149,29 +179,43 @@ class InterruptTest {
                                                kSubjectStringLength),
                 i::AllocationType::kOld)
             .ToHandleChecked();
-    Local<String> two_byte_string = Utils::ToLocal(i_two_byte_string);
+    SetSubjectString(Utils::ToLocal(i_two_byte_string));
+  }
 
+  void SetSubjectString(Local<String> subject) {
     env_->Global()
-        ->Set(env_.local(), v8_str("subject_string"), one_byte_string)
-        .FromJust();
-    env_->Global()
-        ->Set(env_.local(), v8_str("I 8 some \xCF\x80"), two_byte_string)
+        ->Set(env_.local(), v8_str("subject_string"), subject)
         .FromJust();
+    subject_string_handle_.Reset(env_->GetIsolate(), subject);
+  }
+
+  Local<String> GetSubjectString() const {
+    return subject_string_handle_.Get(isolate_);
+  }
+
+  Local<RegExp> GetRegExp() const { return regexp_handle_.Get(isolate_); }
+
+  i::Isolate* i_isolate() const {
+    return reinterpret_cast<i::Isolate*>(isolate_);
+  }
 
-    one_byte_string_handle_.Reset(env_->GetIsolate(), one_byte_string);
-    two_byte_string_handle_.Reset(env_->GetIsolate(), two_byte_string);
+ private:
+  static void SignalSemaphore(Isolate* isolate, void* data) {
+    reinterpret_cast<InterruptTest*>(data)->sem_.Signal();
   }
 
   void TestBody() {
     CHECK(!ran_test_body_.load());
     CHECK(!ran_to_completion_.load());
 
-    CreateTestStrings();
+    DCHECK(!subject_string_handle_.IsEmpty());
 
     TryCatch try_catch(env_->GetIsolate());
 
     isolate_->RequestInterrupt(&SignalSemaphore, this);
-    CompileRun("/((a*)*)*b/.exec(subject_string)");
+    MaybeLocal<Object> result = regexp_handle_.Get(isolate_)->Exec(
+        env_.local(), subject_string_handle_.Get(isolate_));
+    CHECK(result.IsEmpty());
 
     CHECK(try_catch.HasTerminated());
     CHECK(ran_test_body_.load());
@@ -223,8 +267,8 @@ class InterruptTest {
   Isolate* isolate_;
   base::Semaphore sem_;  // Coordinates between main and interrupt threads.
 
-  Persistent<String> one_byte_string_handle_;
-  Persistent<String> two_byte_string_handle_;
+  Persistent<String> subject_string_handle_;
+  Persistent<RegExp> regexp_handle_;
 
   std::atomic<bool> ran_test_body_;
   std::atomic<bool> ran_to_completion_;
@@ -239,25 +283,66 @@ void SetCommonV8FlagsForInterruptTests() {
 
 }  // namespace
 
-TEST(InterruptAndCollectAllGarbage) {
+TEST(InterruptAndInvokeMajorGC) {
   // Move all movable objects on GC.
   i::v8_flags.compact_on_every_full_gc = true;
   SetCommonV8FlagsForInterruptTests();
-  InterruptTest{}.RunTest(InterruptTest::CollectAllGarbage);
+  InterruptTest test{};
+  test.SetOneByteSubjectString();
+  test.RunTest(InterruptTest::InvokeMajorGC);
 }
 
 TEST(InterruptAndMakeSubjectOneByteExternal) {
   SetCommonV8FlagsForInterruptTests();
-  InterruptTest{}.RunTest(InterruptTest::MakeSubjectOneByteExternal);
+  InterruptTest test{};
+  test.SetOneByteSubjectString();
+  test.RunTest(InterruptTest::MakeSubjectOneByteExternal);
 }
 
 TEST(InterruptAndMakeSubjectTwoByteExternal) {
   SetCommonV8FlagsForInterruptTests();
-  InterruptTest{}.RunTest(InterruptTest::MakeSubjectTwoByteExternal);
+  InterruptTest test{};
+  test.SetTwoByteSubjectString();
+  test.RunTest(InterruptTest::MakeSubjectTwoByteExternal);
 }
 
 TEST(InterruptAndIterateStack) {
   i::v8_flags.regexp_tier_up = false;
   SetCommonV8FlagsForInterruptTests();
-  InterruptTest{}.RunTest(InterruptTest::IterateStack);
+  InterruptTest test{};
+  test.SetOneByteSubjectString();
+  test.RunTest(InterruptTest::IterateStack);
+}
+
+TEST(InterruptAndTransitionSubjectFromTwoByteToOneByte) {
+  SetCommonV8FlagsForInterruptTests();
+  InterruptTest test{};
+  i::Isolate* i_isolate = test.i_isolate();
+  i::HandleScope handle_scope(i_isolate);
+  // Internalize a one-byte copy of the two-byte string we are going to
+  // internalize during the interrupt. This ensures that the two-byte string
+  // transitions to a ThinString pointing to a one-byte string.
+  Local<String> internalized_string =
+      String::NewFromUtf8(
+          reinterpret_cast<Isolate*>(i_isolate), &kOneByteSubjectString[1],
+          v8::NewStringType::kInternalized, kSubjectStringLength - 1)
+          .ToLocalChecked();
+  CHECK(internalized_string->IsOneByte());
+
+  test.SetTwoByteSubjectString();
+  Local<String> string = test.GetSubjectString();
+  CHECK(!string->IsOneByte());
+  // Set the subject string as a substring of the original subject (containing
+  // only one-byte characters).
+  v8::Local<Value> value =
+      CompileRun("subject_string = subject_string.substring(1)");
+  test.SetSubjectString(value.As<String>());
+  CHECK(test.GetSubjectString()->ContainsOnlyOneByte());
+
+  test.RunTest(InterruptTest::TwoByteSubjectToOneByte);
+  // After the test, we expect that bytecode for a one-byte subject has been
+  // installed during the interrupt.
+  i::Handle<i::JSRegExp> regexp = Utils::OpenHandle(*test.GetRegExp());
+  i::Tagged<i::Object> one_byte_code = regexp->bytecode(/* is_latin1 */ true);
+  CHECK(IsByteArray(one_byte_code));
 }
diff --git a/deps/v8/test/cctest/test-sampler-api.cc b/deps/v8/test/cctest/test-sampler-api.cc
index 9ecb7e2e671933..43dbd226b7215a 100644
--- a/deps/v8/test/cctest/test-sampler-api.cc
+++ b/deps/v8/test/cctest/test-sampler-api.cc
@@ -74,7 +74,8 @@ class SamplingTestHelper {
   }
 
  private:
-  static void CollectSample(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  static void CollectSample(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    CHECK(i::ValidateCallbackInfo(info));
     instance_->DoCollectSample();
   }
 
diff --git a/deps/v8/test/cctest/test-serialize.cc b/deps/v8/test/cctest/test-serialize.cc
index e5135a5b04d390..36f131630d6fd4 100644
--- a/deps/v8/test/cctest/test-serialize.cc
+++ b/deps/v8/test/cctest/test-serialize.cc
@@ -36,9 +36,11 @@
 #include "src/codegen/compiler.h"
 #include "src/codegen/script-details.h"
 #include "src/common/assert-scope.h"
+#include "src/debug/debug-coverage.h"
 #include "src/heap/heap-inl.h"
-#include "src/heap/parked-scope.h"
+#include "src/heap/parked-scope-inl.h"
 #include "src/heap/read-only-heap.h"
+#include "src/heap/read-only-promotion.h"
 #include "src/heap/safepoint.h"
 #include "src/heap/spaces.h"
 #include "src/numbers/hash-seed-inl.h"
@@ -64,20 +66,14 @@
 namespace v8 {
 namespace internal {
 
-enum CodeCacheType { kLazy, kEager, kAfterExecute };
-
-void DisableAlwaysOpt() {
-  // Isolates prepared for serialization do not optimize. The only exception is
-  // with the flag --always-turbofan.
-  v8_flags.always_turbofan = false;
-}
+namespace {
 
 // A convenience struct to simplify management of the blobs required to
 // deserialize an isolate.
 struct StartupBlobs {
-  base::Vector<const byte> startup;
-  base::Vector<const byte> read_only;
-  base::Vector<const byte> shared_space;
+  base::Vector<const uint8_t> startup;
+  base::Vector<const uint8_t> read_only;
+  base::Vector<const uint8_t> shared_space;
 
   void Dispose() {
     startup.Dispose();
@@ -86,6 +82,8 @@ struct StartupBlobs {
   }
 };
 
+}  // namespace
+
 // TestSerializer is used for testing isolate serialization.
 class TestSerializer {
  public:
@@ -136,16 +134,24 @@ class TestSerializer {
   }
 };
 
-static base::Vector<const byte> WritePayload(
-    const base::Vector<const byte>& payload) {
+namespace {
+
+enum CodeCacheType { kLazy, kEager, kAfterExecute };
+
+void DisableAlwaysOpt() {
+  // Isolates prepared for serialization do not optimize. The only exception is
+  // with the flag --always-turbofan.
+  v8_flags.always_turbofan = false;
+}
+
+base::Vector<const uint8_t> WritePayload(
+    const base::Vector<const uint8_t>& payload) {
   int length = payload.length();
-  byte* blob = NewArray<byte>(length);
+  uint8_t* blob = NewArray<uint8_t>(length);
   memcpy(blob, payload.begin(), length);
-  return base::Vector<const byte>(const_cast<const byte*>(blob), length);
+  return base::Vector<const uint8_t>(const_cast<const uint8_t*>(blob), length);
 }
 
-namespace {
-
 // Convenience wrapper around the convenience wrapper.
 v8::StartupData CreateSnapshotDataBlob(const char* embedded_source) {
   v8::StartupData data = CreateSnapshotDataBlobInternal(
@@ -153,9 +159,7 @@ v8::StartupData CreateSnapshotDataBlob(const char* embedded_source) {
   return data;
 }
 
-}  // namespace
-
-static StartupBlobs Serialize(v8::Isolate* isolate) {
+StartupBlobs Serialize(v8::Isolate* isolate) {
   // We have to create one context.  One reason for this is so that the builtins
   // can be loaded from self hosted JS builtins and their addresses can be
   // processed.  This will clear the pending fixups array, which would otherwise
@@ -168,27 +172,50 @@ static StartupBlobs Serialize(v8::Isolate* isolate) {
   }
 
   Isolate* i_isolate = reinterpret_cast<Isolate*>(isolate);
-  CcTest::CollectAllAvailableGarbage(i_isolate);
+  {
+    // Note that we need to run a garbage collection without stack at this
+    // point, so that all dead objects are reclaimed. This is required to avoid
+    // conservative stack scanning and guarantee deterministic behaviour.
+    EmbedderStackStateScope stack_scope(
+        i_isolate->heap(), EmbedderStackStateScope::kExplicitInvocation,
+        StackState::kNoHeapPointers);
+    heap::InvokeMemoryReducingMajorGCs(i_isolate->heap());
+  }
 
-  IsolateSafepointScope safepoint(i_isolate->heap());
-  HandleScope scope(i_isolate);
+  // Note this effectively reimplements Snapshot::Create, keep in sync.
 
+  SafepointScope safepoint(i_isolate, SafepointKind::kIsolate);
   DisallowGarbageCollection no_gc;
+  HandleScope scope(i_isolate);
+
+  if (i_isolate->heap()->read_only_space()->writable()) {
+    // Promote objects from mutable heap spaces to read-only space prior to
+    // serialization. Objects can be promoted if a) they are themselves
+    // immutable-after-deserialization and b) all objects in the transitive
+    // object graph also satisfy condition a).
+    ReadOnlyPromotion::Promote(i_isolate, safepoint, no_gc);
+    // When creating the snapshot from scratch, we are responsible for sealing
+    // the RO heap here. Note we cannot delegate the responsibility e.g. to
+    // Isolate::Init since it should still be possible to allocate into RO
+    // space after the Isolate has been initialized, for example as part of
+    // Context creation.
+    i_isolate->read_only_heap()->OnCreateHeapObjectsComplete(i_isolate);
+  }
+
   ReadOnlySerializer read_only_serializer(i_isolate,
                                           Snapshot::kDefaultSerializerFlags);
-  read_only_serializer.SerializeReadOnlyRoots();
+  read_only_serializer.Serialize();
 
   SharedHeapSerializer shared_space_serializer(
-      i_isolate, Snapshot::kDefaultSerializerFlags, &read_only_serializer);
+      i_isolate, Snapshot::kDefaultSerializerFlags);
 
   StartupSerializer ser(i_isolate, Snapshot::kDefaultSerializerFlags,
-                        &read_only_serializer, &shared_space_serializer);
+                        &shared_space_serializer);
   ser.SerializeStrongReferences(no_gc);
 
   ser.SerializeWeakReferencesAndDeferred();
 
   shared_space_serializer.FinalizeSerialization();
-  read_only_serializer.FinalizeSerialization();
   SnapshotData startup_snapshot(&ser);
   SnapshotData read_only_snapshot(&read_only_serializer);
   SnapshotData shared_space_snapshot(&shared_space_serializer);
@@ -213,20 +240,20 @@ base::Vector<const char> ConstructSource(base::Vector<const char> head,
   return base::VectorOf(source, source_length);
 }
 
-static v8::Isolate* Deserialize(const StartupBlobs& blobs) {
+v8::Isolate* Deserialize(const StartupBlobs& blobs) {
   v8::Isolate* isolate = TestSerializer::NewIsolateFromBlob(blobs);
   CHECK(isolate);
   return isolate;
 }
 
-static void SanityCheck(v8::Isolate* v8_isolate) {
+void SanityCheck(v8::Isolate* v8_isolate) {
   Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
   v8::HandleScope scope(v8_isolate);
 #ifdef VERIFY_HEAP
   HeapVerifier::VerifyHeap(isolate->heap());
 #endif
-  CHECK(isolate->global_object()->IsJSObject());
-  CHECK(isolate->native_context()->IsContext());
+  CHECK(IsJSObject(*isolate->global_object()));
+  CHECK(IsContext(*isolate->native_context()));
   isolate->factory()->InternalizeString(base::StaticCharVector("Empty"));
 }
 
@@ -249,6 +276,8 @@ void TestStartupSerializerOnceImpl() {
   FreeCurrentEmbeddedBlob();
 }
 
+}  // namespace
+
 UNINITIALIZED_TEST(StartupSerializerOnce) {
   DisableAlwaysOpt();
   TestStartupSerializerOnceImpl();
@@ -258,9 +287,13 @@ UNINITIALIZED_TEST(StartupSerializerTwice) {
   DisableAlwaysOpt();
   v8::Isolate* isolate = TestSerializer::NewIsolateInitialized();
   StartupBlobs blobs1 = Serialize(isolate);
+  isolate->Dispose();
+
+  isolate = Deserialize(blobs1);
   StartupBlobs blobs2 = Serialize(isolate);
   isolate->Dispose();
   blobs1.Dispose();
+
   isolate = Deserialize(blobs2);
   {
     v8::Isolate::Scope isolate_scope(isolate);
@@ -305,9 +338,13 @@ UNINITIALIZED_TEST(StartupSerializerTwiceRunScript) {
   DisableAlwaysOpt();
   v8::Isolate* isolate = TestSerializer::NewIsolateInitialized();
   StartupBlobs blobs1 = Serialize(isolate);
+  isolate->Dispose();
+
+  isolate = Deserialize(blobs1);
   StartupBlobs blobs2 = Serialize(isolate);
   isolate->Dispose();
   blobs1.Dispose();
+
   isolate = Deserialize(blobs2);
   {
     v8::Isolate::Scope isolate_scope(isolate);
@@ -328,10 +365,10 @@ UNINITIALIZED_TEST(StartupSerializerTwiceRunScript) {
   FreeCurrentEmbeddedBlob();
 }
 
-static void SerializeContext(base::Vector<const byte>* startup_blob_out,
-                             base::Vector<const byte>* read_only_blob_out,
-                             base::Vector<const byte>* shared_space_blob_out,
-                             base::Vector<const byte>* context_blob_out) {
+static void SerializeContext(base::Vector<const uint8_t>* startup_blob_out,
+                             base::Vector<const uint8_t>* read_only_blob_out,
+                             base::Vector<const uint8_t>* shared_space_blob_out,
+                             base::Vector<const uint8_t>* context_blob_out) {
   v8::Isolate* v8_isolate = TestSerializer::NewIsolateInitialized();
   Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
   Heap* heap = isolate->heap();
@@ -351,7 +388,16 @@ static void SerializeContext(base::Vector<const byte>* startup_blob_out,
 
     // If we don't do this then we end up with a stray root pointing at the
     // context even after we have disposed of env.
-    CcTest::CollectAllAvailableGarbage(isolate);
+    {
+      // Note that we need to run a garbage collection without stack at this
+      // point, so that all dead objects are reclaimed. This is required to
+      // avoid conservative stack scanning and guarantee deterministic
+      // behaviour.
+      EmbedderStackStateScope stack_scope(
+          heap, EmbedderStackStateScope::kExplicitInvocation,
+          StackState::kNoHeapPointers);
+      heap::InvokeMemoryReducingMajorGCs(heap);
+    }
 
     {
       v8::HandleScope handle_scope(v8_isolate);
@@ -365,19 +411,27 @@ static void SerializeContext(base::Vector<const byte>* startup_blob_out,
 
     IsolateSafepointScope safepoint(heap);
 
+    if (!isolate->initialized_from_snapshot()) {
+      // When creating the snapshot from scratch, we are responsible for sealing
+      // the RO heap here. Note we cannot delegate the responsibility e.g. to
+      // Isolate::Init since it should still be possible to allocate into RO
+      // space after the Isolate has been initialized, for example as part of
+      // Context creation.
+      isolate->read_only_heap()->OnCreateHeapObjectsComplete(isolate);
+    }
+
     DisallowGarbageCollection no_gc;
     SnapshotByteSink read_only_sink;
     ReadOnlySerializer read_only_serializer(isolate,
                                             Snapshot::kDefaultSerializerFlags);
-    read_only_serializer.SerializeReadOnlyRoots();
+    read_only_serializer.Serialize();
 
     SharedHeapSerializer shared_space_serializer(
-        isolate, Snapshot::kDefaultSerializerFlags, &read_only_serializer);
+        isolate, Snapshot::kDefaultSerializerFlags);
 
     SnapshotByteSink startup_sink;
     StartupSerializer startup_serializer(
-        isolate, Snapshot::kDefaultSerializerFlags, &read_only_serializer,
-        &shared_space_serializer);
+        isolate, Snapshot::kDefaultSerializerFlags, &shared_space_serializer);
     startup_serializer.SerializeStrongReferences(no_gc);
 
     SnapshotByteSink context_sink;
@@ -389,7 +443,6 @@ static void SerializeContext(base::Vector<const byte>* startup_blob_out,
     startup_serializer.SerializeWeakReferencesAndDeferred();
 
     shared_space_serializer.FinalizeSerialization();
-    read_only_serializer.FinalizeSerialization();
 
     SnapshotData read_only_snapshot(&read_only_serializer);
     SnapshotData shared_space_snapshot(&shared_space_serializer);
@@ -407,10 +460,10 @@ static void SerializeContext(base::Vector<const byte>* startup_blob_out,
 #ifdef SNAPSHOT_COMPRESSION
 UNINITIALIZED_TEST(SnapshotCompression) {
   DisableAlwaysOpt();
-  base::Vector<const byte> startup_blob;
-  base::Vector<const byte> read_only_blob;
-  base::Vector<const byte> shared_space_blob;
-  base::Vector<const byte> context_blob;
+  base::Vector<const uint8_t> startup_blob;
+  base::Vector<const uint8_t> read_only_blob;
+  base::Vector<const uint8_t> shared_space_blob;
+  base::Vector<const uint8_t> context_blob;
   SerializeContext(&startup_blob, &read_only_blob, &shared_space_blob,
                    &context_blob);
   SnapshotData original_snapshot_data(context_blob);
@@ -429,10 +482,10 @@ UNINITIALIZED_TEST(SnapshotCompression) {
 
 UNINITIALIZED_TEST(ContextSerializerContext) {
   DisableAlwaysOpt();
-  base::Vector<const byte> startup_blob;
-  base::Vector<const byte> read_only_blob;
-  base::Vector<const byte> shared_space_blob;
-  base::Vector<const byte> context_blob;
+  base::Vector<const uint8_t> startup_blob;
+  base::Vector<const uint8_t> read_only_blob;
+  base::Vector<const uint8_t> shared_space_blob;
+  base::Vector<const uint8_t> context_blob;
   SerializeContext(&startup_blob, &read_only_blob, &shared_space_blob,
                    &context_blob);
 
@@ -454,7 +507,7 @@ UNINITIALIZED_TEST(ContextSerializerContext) {
                  isolate, &snapshot_data, false, global_proxy,
                  v8::DeserializeInternalFieldsCallback())
                  .ToHandleChecked();
-      CHECK(root->IsContext());
+      CHECK(IsContext(*root));
       CHECK(Handle<Context>::cast(root)->global_proxy() == *global_proxy);
     }
 
@@ -465,7 +518,7 @@ UNINITIALIZED_TEST(ContextSerializerContext) {
                   isolate, &snapshot_data, false, global_proxy,
                   v8::DeserializeInternalFieldsCallback())
                   .ToHandleChecked();
-      CHECK(root2->IsContext());
+      CHECK(IsContext(*root2));
       CHECK(!root.is_identical_to(root2));
     }
     context_blob.Dispose();
@@ -476,24 +529,24 @@ UNINITIALIZED_TEST(ContextSerializerContext) {
 }
 
 static void SerializeCustomContext(
-    base::Vector<const byte>* startup_blob_out,
-    base::Vector<const byte>* read_only_blob_out,
-    base::Vector<const byte>* shared_space_blob_out,
-    base::Vector<const byte>* context_blob_out) {
-  v8::Isolate* v8_isolate = TestSerializer::NewIsolateInitialized();
-  Isolate* isolate = reinterpret_cast<Isolate*>(v8_isolate);
+    base::Vector<const uint8_t>* startup_blob_out,
+    base::Vector<const uint8_t>* read_only_blob_out,
+    base::Vector<const uint8_t>* shared_space_blob_out,
+    base::Vector<const uint8_t>* context_blob_out) {
+  v8::Isolate* isolate = TestSerializer::NewIsolateInitialized();
+  Isolate* i_isolate = reinterpret_cast<Isolate*>(isolate);
   {
-    v8::Isolate::Scope isolate_scope(v8_isolate);
+    v8::Isolate::Scope isolate_scope(isolate);
 
     v8::Persistent<v8::Context> env;
     {
-      HandleScope scope(isolate);
-      env.Reset(v8_isolate, v8::Context::New(v8_isolate));
+      HandleScope scope(i_isolate);
+      env.Reset(isolate, v8::Context::New(isolate));
     }
     CHECK(!env.IsEmpty());
     {
-      v8::HandleScope handle_scope(v8_isolate);
-      v8::Local<v8::Context>::New(v8_isolate, env)->Enter();
+      v8::HandleScope handle_scope(isolate);
+      v8::Local<v8::Context>::New(isolate, env)->Enter();
       // After execution, e's function context refers to the global object.
       CompileRun(
           "var e;"
@@ -512,53 +565,73 @@ static void SerializeCustomContext(
           base::StaticCharVector("function g() { return [,"),
           base::StaticCharVector("1,"),
           base::StaticCharVector("];} a = g(); b = g(); b.push(1);"), 100000);
-      v8::MaybeLocal<v8::String> source_str =
-          v8::String::NewFromUtf8(v8_isolate, source.begin(),
-                                  v8::NewStringType::kNormal, source.length());
+      v8::MaybeLocal<v8::String> source_str = v8::String::NewFromUtf8(
+          isolate, source.begin(), v8::NewStringType::kNormal, source.length());
       CompileRun(source_str.ToLocalChecked());
       source.Dispose();
     }
     // If we don't do this then we end up with a stray root pointing at the
     // context even after we have disposed of env.
-    CcTest::CollectAllAvailableGarbage(isolate);
+    {
+      // Note that we need to run a garbage collection without stack at this
+      // point, so that all dead objects are reclaimed. This is required to
+      // avoid conservative stack scanning and guarantee deterministic
+      // behaviour.
+      EmbedderStackStateScope stack_scope(
+          i_isolate->heap(), EmbedderStackStateScope::kExplicitInvocation,
+          StackState::kNoHeapPointers);
+      heap::InvokeMemoryReducingMajorGCs(i_isolate->heap());
+    }
 
     {
-      v8::HandleScope handle_scope(v8_isolate);
-      v8::Local<v8::Context>::New(v8_isolate, env)->Exit();
+      v8::HandleScope handle_scope(isolate);
+      v8::Local<v8::Context>::New(isolate, env)->Exit();
     }
 
-    HandleScope scope(isolate);
+    HandleScope scope(i_isolate);
     i::Context raw_context = i::Context::cast(*v8::Utils::OpenPersistent(env));
 
     env.Reset();
 
-    IsolateSafepointScope safepoint(isolate->heap());
-
+    SafepointScope safepoint(i_isolate, SafepointKind::kIsolate);
     DisallowGarbageCollection no_gc;
+
+    if (i_isolate->heap()->read_only_space()->writable()) {
+      // Promote objects from mutable heap spaces to read-only space prior to
+      // serialization. Objects can be promoted if a) they are themselves
+      // immutable-after-deserialization and b) all objects in the transitive
+      // object graph also satisfy condition a).
+      ReadOnlyPromotion::Promote(i_isolate, safepoint, no_gc);
+      // When creating the snapshot from scratch, we are responsible for sealing
+      // the RO heap here. Note we cannot delegate the responsibility e.g. to
+      // Isolate::Init since it should still be possible to allocate into RO
+      // space after the Isolate has been initialized, for example as part of
+      // Context creation.
+      i_isolate->read_only_heap()->OnCreateHeapObjectsComplete(i_isolate);
+    }
+
     SnapshotByteSink read_only_sink;
-    ReadOnlySerializer read_only_serializer(isolate,
+    ReadOnlySerializer read_only_serializer(i_isolate,
                                             Snapshot::kDefaultSerializerFlags);
-    read_only_serializer.SerializeReadOnlyRoots();
+    read_only_serializer.Serialize();
 
     SharedHeapSerializer shared_space_serializer(
-        isolate, Snapshot::kDefaultSerializerFlags, &read_only_serializer);
+        i_isolate, Snapshot::kDefaultSerializerFlags);
 
     SnapshotByteSink startup_sink;
     StartupSerializer startup_serializer(
-        isolate, Snapshot::kDefaultSerializerFlags, &read_only_serializer,
-        &shared_space_serializer);
+        i_isolate, Snapshot::kDefaultSerializerFlags, &shared_space_serializer);
     startup_serializer.SerializeStrongReferences(no_gc);
 
     SnapshotByteSink context_sink;
     ContextSerializer context_serializer(
-        isolate, Snapshot::kDefaultSerializerFlags, &startup_serializer,
+        i_isolate, Snapshot::kDefaultSerializerFlags, &startup_serializer,
         v8::SerializeInternalFieldsCallback());
     context_serializer.Serialize(&raw_context, no_gc);
 
     startup_serializer.SerializeWeakReferencesAndDeferred();
 
     shared_space_serializer.FinalizeSerialization();
-    read_only_serializer.FinalizeSerialization();
 
     SnapshotData read_only_snapshot(&read_only_serializer);
     SnapshotData shared_space_snapshot(&shared_space_serializer);
@@ -570,15 +643,15 @@ static void SerializeCustomContext(
     *read_only_blob_out = WritePayload(read_only_snapshot.RawData());
     *shared_space_blob_out = WritePayload(shared_space_snapshot.RawData());
   }
-  v8_isolate->Dispose();
+  isolate->Dispose();
 }
 
 UNINITIALIZED_TEST(ContextSerializerCustomContext) {
   DisableAlwaysOpt();
-  base::Vector<const byte> startup_blob;
-  base::Vector<const byte> read_only_blob;
-  base::Vector<const byte> shared_space_blob;
-  base::Vector<const byte> context_blob;
+  base::Vector<const uint8_t> startup_blob;
+  base::Vector<const uint8_t> read_only_blob;
+  base::Vector<const uint8_t> shared_space_blob;
+  base::Vector<const uint8_t> context_blob;
   SerializeCustomContext(&startup_blob, &read_only_blob, &shared_space_blob,
                          &context_blob);
 
@@ -600,13 +673,13 @@ UNINITIALIZED_TEST(ContextSerializerCustomContext) {
                  isolate, &snapshot_data, false, global_proxy,
                  v8::DeserializeInternalFieldsCallback())
                  .ToHandleChecked();
-      CHECK(root->IsContext());
-      Handle<Context> context = Handle<Context>::cast(root);
+      CHECK(IsContext(*root));
+      Handle<NativeContext> context = Handle<NativeContext>::cast(root);
 
       // Add context to the weak native context list
-      context->set(Context::NEXT_CONTEXT_LINK,
-                   isolate->heap()->native_contexts_list(),
-                   UPDATE_WRITE_BARRIER);
+      Handle<Context>::cast(context)->set(
+          Context::NEXT_CONTEXT_LINK, isolate->heap()->native_contexts_list(),
+          UPDATE_WRITE_BARRIER);
       isolate->heap()->set_native_contexts_list(*context);
 
       CHECK(context->global_proxy() == *global_proxy);
@@ -704,7 +777,7 @@ UNINITIALIZED_TEST(CustomSnapshotDataBlob1) {
   FreeCurrentEmbeddedBlob();
 }
 
-static void UnreachableCallback(const FunctionCallbackInfo<Value>& args) {
+static void UnreachableCallback(const FunctionCallbackInfo<Value>& info) {
   UNREACHABLE();
 }
 
@@ -769,8 +842,8 @@ UNINITIALIZED_TEST(CustomSnapshotDataBlobStringNotInternalized) {
     v8::Local<v8::Value> result = CompileRun("f()").As<v8::Value>();
     CHECK(result->IsString());
     i::String str = *v8::Utils::OpenHandle(*result.As<v8::String>());
-    CHECK_EQ(std::string(str.ToCString().get()), "AB");
-    CHECK(!str.IsInternalizedString());
+    CHECK_EQ(std::string(str->ToCString().get()), "AB");
+    CHECK(!IsInternalizedString(str));
     CHECK(!i::ReadOnlyHeap::Contains(str));
   }
   isolate1->Dispose();
@@ -808,13 +881,11 @@ void TestCustomSnapshotDataBlobWithIrregexpCode(
     v8::Local<v8::Context> context = v8::Context::New(isolate1);
     v8::Context::Scope c_scope(context);
     {
-      // Check that compiled irregexp code has not been flushed prior to
+      // Check that compiled irregexp code has been flushed prior to
       // serialization.
       i::Handle<i::JSRegExp> re =
           Utils::OpenHandle(*CompileRun("re1").As<v8::RegExp>());
-      CHECK_EQ(re->HasCompiledCode(),
-               function_code_handling ==
-                   v8::SnapshotCreator::FunctionCodeHandling::kKeep);
+      CHECK(!re->HasCompiledCode());
     }
     {
       v8::Maybe<int32_t> result =
@@ -1290,8 +1361,9 @@ UNINITIALIZED_TEST(CustomSnapshotDataBlob2) {
 }
 
 static void SerializationFunctionTemplate(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().Set(args[0]);
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(info[0]);
 }
 
 UNINITIALIZED_TEST(CustomSnapshotDataBlobOutdatedContextWithOverflow) {
@@ -1430,7 +1502,7 @@ bool IsCompiled(const char* name) {
   return i::Handle<i::JSFunction>::cast(
              v8::Utils::OpenHandle(*CompileRun(name)))
       ->shared()
-      .is_compiled();
+      ->is_compiled();
 }
 
 UNINITIALIZED_TEST(SnapshotDataBlobWithWarmup) {
@@ -1585,11 +1657,13 @@ UNINITIALIZED_TEST(CustomSnapshotDataBlobImmortalImmovableRoots) {
 
 TEST(TestThatAlwaysSucceeds) {}
 
-TEST(TestThatAlwaysFails) {
+TEST(TestCheckThatAlwaysFails) {
   bool ArtificialFailure = false;
   CHECK(ArtificialFailure);
 }
 
+TEST(TestFatal) { GRACEFUL_FATAL("fatal"); }
+
 int CountBuiltins() {
   // Check that we have not deserialized any additional builtin.
   HeapObjectIterator iterator(CcTest::heap());
@@ -1597,7 +1671,7 @@ int CountBuiltins() {
   int counter = 0;
   for (HeapObject obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (obj.IsCode() && Code::cast(obj).kind() == CodeKind::BUILTIN) counter++;
+    if (IsCode(obj) && Code::cast(obj)->kind() == CodeKind::BUILTIN) counter++;
   }
   return counter;
 }
@@ -1659,7 +1733,7 @@ TEST(CodeSerializerWithProfiler) {
       isolate, orig_source, default_script_details, &cache,
       v8::ScriptCompiler::kNoCompileOptions);
 
-  CHECK(!orig->GetBytecodeArray(isolate).HasSourcePositionTable());
+  CHECK(!orig->GetBytecodeArray(isolate)->HasSourcePositionTable());
 
   isolate->SetIsProfiling(true);
 
@@ -1671,7 +1745,7 @@ TEST(CodeSerializerWithProfiler) {
 
   // Since the profiler is now enabled, source positions should be collected
   // after deserialization.
-  CHECK(copy->GetBytecodeArray(isolate).HasSourcePositionTable());
+  CHECK(copy->GetBytecodeArray(isolate)->HasSourcePositionTable());
 
   delete cache;
 }
@@ -1712,17 +1786,17 @@ void TestCodeSerializerOnePlusOneImpl(bool verify_builtins_count = true) {
   }
 
   CHECK_NE(*orig, *copy);
-  CHECK(Script::cast(copy->script()).source() == *copy_source);
+  CHECK(Script::cast(copy->script())->source() == *copy_source);
 
   Handle<JSFunction> copy_fun =
       Factory::JSFunctionBuilder{isolate, copy, isolate->native_context()}
           .Build();
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   Handle<Object> copy_result =
       Execution::CallScript(isolate, copy_fun, global,
                             isolate->factory()->empty_fixed_array())
           .ToHandleChecked();
-  CHECK_EQ(2, Handle<Smi>::cast(copy_result)->value());
+  CHECK_EQ(2, Smi::cast(*copy_result).value());
 
   if (verify_builtins_count) CHECK_EQ(builtins_count, CountBuiltins());
 
@@ -1746,6 +1820,14 @@ TEST(CodeSerializerOnePlusOneWithDebugger) {
   TestCodeSerializerOnePlusOneImpl();
 }
 
+TEST(CodeSerializerOnePlusOneWithBlockCoverage) {
+  v8::HandleScope scope(CcTest::isolate());
+  static v8::debug::DebugDelegate dummy_delegate;
+  v8::debug::SetDebugDelegate(CcTest::isolate(), &dummy_delegate);
+  Coverage::SelectMode(CcTest::i_isolate(), debug::CoverageMode::kBlockCount);
+  TestCodeSerializerOnePlusOneImpl();
+}
+
 TEST(CodeSerializerPromotedToCompilationCache) {
   LocalContext context;
   Isolate* isolate = CcTest::i_isolate();
@@ -1925,7 +2007,7 @@ TEST(CodeSerializerInternalizedString) {
   CHECK(!orig_source.is_identical_to(copy_source));
   CHECK(orig_source->Equals(*copy_source));
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
 
   i::AlignedCachedData* cached_data = nullptr;
   Handle<SharedFunctionInfo> orig = CompileScriptAndProduceCache(
@@ -1938,7 +2020,7 @@ TEST(CodeSerializerInternalizedString) {
       Execution::CallScript(isolate, orig_fun, global,
                             isolate->factory()->empty_fixed_array())
           .ToHandleChecked();
-  CHECK(orig_result->IsInternalizedString());
+  CHECK(IsInternalizedString(*orig_result));
 
   int builtins_count = CountBuiltins();
 
@@ -1949,7 +2031,7 @@ TEST(CodeSerializerInternalizedString) {
                          v8::ScriptCompiler::kConsumeCodeCache);
   }
   CHECK_NE(*orig, *copy);
-  CHECK(Script::cast(copy->script()).source() == *copy_source);
+  CHECK(Script::cast(copy->script())->source() == *copy_source);
 
   Handle<JSFunction> copy_fun =
       Factory::JSFunctionBuilder{isolate, copy, isolate->native_context()}
@@ -1989,7 +2071,7 @@ TEST(CodeSerializerLargeCodeObject) {
   Handle<String> source_str =
       isolate->factory()->NewStringFromUtf8(source).ToHandleChecked();
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   AlignedCachedData* cache = nullptr;
 
   Handle<SharedFunctionInfo> orig =
@@ -2016,7 +2098,7 @@ TEST(CodeSerializerLargeCodeObject) {
           .ToHandleChecked();
 
   int result_int;
-  CHECK(copy_result->ToInt32(&result_int));
+  CHECK(Object::ToInt32(*copy_result, &result_int));
   CHECK_EQ(7, result_int);
 
   delete cache;
@@ -2030,7 +2112,8 @@ TEST(CodeSerializerLargeCodeObjectWithIncrementalMarking) {
   v8_flags.always_turbofan = false;
   const char* filter_flag = "--turbo-filter=NOTHING";
   FlagList::SetFlagsFromString(filter_flag, strlen(filter_flag));
-  v8_flags.manual_evacuation_candidates_selection = true;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   LocalContext context;
   Isolate* isolate = CcTest::i_isolate();
@@ -2058,7 +2141,7 @@ TEST(CodeSerializerLargeCodeObjectWithIncrementalMarking) {
     ec_page = Page::FromHeapObject(*moving_object);
   }
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   AlignedCachedData* cache = nullptr;
 
   Handle<SharedFunctionInfo> orig =
@@ -2086,7 +2169,7 @@ TEST(CodeSerializerLargeCodeObjectWithIncrementalMarking) {
   // We should have missed a write barrier. Complete incremental marking
   // to flush out the bug.
   heap::SimulateIncrementalMarking(heap, true);
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(heap);
 
   Handle<JSFunction> copy_fun =
       Factory::JSFunctionBuilder{isolate, copy, isolate->native_context()}
@@ -2098,7 +2181,7 @@ TEST(CodeSerializerLargeCodeObjectWithIncrementalMarking) {
           .ToHandleChecked();
 
   int result_int;
-  CHECK(copy_result->ToInt32(&result_int));
+  CHECK(Object::ToInt32(*copy_result, &result_int));
   CHECK_EQ(7, result_int);
 
   delete cache;
@@ -2125,7 +2208,7 @@ TEST(CodeSerializerLargeStrings) {
                        f->NewStringFromUtf8(source_t).ToHandleChecked())
           .ToHandleChecked();
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   AlignedCachedData* cache = nullptr;
 
   Handle<SharedFunctionInfo> orig =
@@ -2201,7 +2284,7 @@ TEST(CodeSerializerThreeBigStrings) {
            source_c_str)
           .ToHandleChecked();
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   AlignedCachedData* cache = nullptr;
 
   Handle<SharedFunctionInfo> orig =
@@ -2270,8 +2353,8 @@ class SerializerOneByteResource
 
 class SerializerTwoByteResource : public v8::String::ExternalStringResource {
  public:
-  SerializerTwoByteResource(const char* data, size_t length)
-      : data_(AsciiToTwoByteString(data)), length_(length), dispose_count_(0) {}
+  SerializerTwoByteResource(const uint16_t* data, size_t length)
+      : data_(data), length_(length), dispose_count_(0) {}
   ~SerializerTwoByteResource() override { DeleteArray<const uint16_t>(data_); }
 
   const uint16_t* data() const override { return data_; }
@@ -2299,17 +2382,21 @@ TEST(CodeSerializerExternalString) {
       isolate->factory()->NewStringFromAsciiChecked("one_byte");
   one_byte_string = isolate->factory()->InternalizeString(one_byte_string);
   one_byte_string->MakeExternal(&one_byte_resource);
-  CHECK(one_byte_string->IsExternalOneByteString());
-  CHECK(one_byte_string->IsInternalizedString());
+  CHECK(IsExternalOneByteString(*one_byte_string));
+  CHECK(IsInternalizedString(*one_byte_string));
 
   // Obtain external internalized two-byte string.
-  SerializerTwoByteResource two_byte_resource("two_byte", 8);
+  size_t two_byte_length;
+  uint16_t* two_byte = AsciiToTwoByteString(u"two_byte 🤓", &two_byte_length);
+  SerializerTwoByteResource two_byte_resource(two_byte, two_byte_length);
   Handle<String> two_byte_string =
-      isolate->factory()->NewStringFromAsciiChecked("two_byte");
+      isolate->factory()
+          ->NewStringFromTwoByte(base::VectorOf(two_byte, two_byte_length))
+          .ToHandleChecked();
   two_byte_string = isolate->factory()->InternalizeString(two_byte_string);
   two_byte_string->MakeExternal(&two_byte_resource);
-  CHECK(two_byte_string->IsExternalTwoByteString());
-  CHECK(two_byte_string->IsInternalizedString());
+  CHECK(IsExternalTwoByteString(*two_byte_string));
+  CHECK(IsInternalizedString(*two_byte_string));
 
   const char* source =
       "var o = {}               \n"
@@ -2321,7 +2408,7 @@ TEST(CodeSerializerExternalString) {
           ->NewStringFromUtf8(base::CStrVector(source))
           .ToHandleChecked();
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   AlignedCachedData* cache = nullptr;
 
   Handle<SharedFunctionInfo> orig = CompileScriptAndProduceCache(
@@ -2345,7 +2432,7 @@ TEST(CodeSerializerExternalString) {
                             isolate->factory()->empty_fixed_array())
           .ToHandleChecked();
 
-  CHECK_EQ(15.0, copy_result->Number());
+  CHECK_EQ(15.0, Object::Number(*copy_result));
 
   // This avoids the GC from trying to free stack allocated resources.
   i::Handle<i::ExternalOneByteString>::cast(one_byte_string)
@@ -2374,8 +2461,8 @@ TEST(CodeSerializerLargeExternalString) {
       reinterpret_cast<const char*>(string.begin()), string.length());
   name = f->InternalizeString(name);
   name->MakeExternal(&one_byte_resource);
-  CHECK(name->IsExternalOneByteString());
-  CHECK(name->IsInternalizedString());
+  CHECK(IsExternalOneByteString(*name));
+  CHECK(IsInternalizedString(*name));
   CHECK(isolate->heap()->InSpace(*name, LO_SPACE));
 
   // Create the source, which is "var <literal> = 42; <literal>".
@@ -2387,7 +2474,7 @@ TEST(CodeSerializerLargeExternalString) {
                .ToHandleChecked())
           .ToHandleChecked();
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   AlignedCachedData* cache = nullptr;
 
   Handle<SharedFunctionInfo> orig =
@@ -2411,7 +2498,7 @@ TEST(CodeSerializerLargeExternalString) {
                             isolate->factory()->empty_fixed_array())
           .ToHandleChecked();
 
-  CHECK_EQ(42.0, copy_result->Number());
+  CHECK_EQ(42.0, Object::Number(*copy_result));
 
   // This avoids the GC from trying to free stack allocated resources.
   i::Handle<i::ExternalOneByteString>::cast(name)->SetResource(isolate,
@@ -2440,10 +2527,10 @@ TEST(CodeSerializerExternalScriptName) {
   const SerializerOneByteResource one_byte_resource("one_byte", 8);
   Handle<String> name =
       f->NewExternalStringFromOneByte(&one_byte_resource).ToHandleChecked();
-  CHECK(name->IsExternalOneByteString());
-  CHECK(!name->IsInternalizedString());
+  CHECK(IsExternalOneByteString(*name));
+  CHECK(!IsInternalizedString(*name));
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   AlignedCachedData* cache = nullptr;
 
   Handle<SharedFunctionInfo> orig = CompileScriptAndProduceCache(
@@ -2467,7 +2554,7 @@ TEST(CodeSerializerExternalScriptName) {
                             isolate->factory()->empty_fixed_array())
           .ToHandleChecked();
 
-  CHECK_EQ(10.0, copy_result->Number());
+  CHECK_EQ(10.0, Object::Number(*copy_result));
 
   // This avoids the GC from trying to free stack allocated resources.
   i::Handle<i::ExternalOneByteString>::cast(name)->SetResource(isolate,
@@ -2842,11 +2929,7 @@ static void CodeSerializerMergeDeserializedScript(bool retain_toplevel_sfi) {
     Handle<SharedFunctionInfo> shared = CompileScriptAndProduceCache(
         isolate, source, ScriptDetails(), &cached_data,
         v8::ScriptCompiler::kNoCompileOptions);
-    Handle<BytecodeArray> bytecode =
-        handle(shared->GetBytecodeArray(isolate), isolate);
-    for (int i = 0; i <= v8_flags.bytecode_old_age; ++i) {
-      bytecode->MakeOlder();
-    }
+    SharedFunctionInfo::EnsureOldForTesting(*shared);
     Handle<Script> local_script =
         handle(Script::cast(shared->script()), isolate);
     script = first_compilation_scope.CloseAndEscape(local_script);
@@ -2854,16 +2937,16 @@ static void CodeSerializerMergeDeserializedScript(bool retain_toplevel_sfi) {
 
   Handle<HeapObject> retained_toplevel_sfi;
   if (retain_toplevel_sfi) {
-    retained_toplevel_sfi =
-        handle(script->shared_function_infos().Get(0).GetHeapObjectAssumeWeak(),
-               isolate);
+    retained_toplevel_sfi = handle(
+        script->shared_function_infos()->Get(0).GetHeapObjectAssumeWeak(),
+        isolate);
   }
 
   // GC twice in case incremental marking had already marked the bytecode array.
   // After this, the Isolate compilation cache contains a weak reference to the
   // Script but not the top-level SharedFunctionInfo.
-  CcTest::CollectAllGarbage();
-  CcTest::CollectAllGarbage();
+  heap::InvokeMajorGC(isolate->heap());
+  heap::InvokeMajorGC(isolate->heap());
 
   Handle<SharedFunctionInfo> copy =
       CompileScript(isolate, source, ScriptDetails(), cached_data,
@@ -2979,24 +3062,27 @@ UNINITIALIZED_TEST(SnapshotCreatorMultipleContexts) {
 static int serialized_static_field = 314;
 
 static void SerializedCallback(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  if (args.Data()->IsExternal()) {
-    CHECK_EQ(args.Data().As<v8::External>()->Value(),
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  if (info.Data()->IsExternal()) {
+    CHECK_EQ(info.Data().As<v8::External>()->Value(),
              static_cast<void*>(&serialized_static_field));
     int* value =
-        reinterpret_cast<int*>(args.Data().As<v8::External>()->Value());
+        reinterpret_cast<int*>(info.Data().As<v8::External>()->Value());
     (*value)++;
   }
-  args.GetReturnValue().Set(v8_num(42));
+  info.GetReturnValue().Set(v8_num(42));
 }
 
 static void SerializedCallbackReplacement(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  args.GetReturnValue().Set(v8_num(1337));
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(v8_num(1337));
 }
 
 static void NamedPropertyGetterForSerialization(
     v8::Local<v8::Name> name, const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (name->Equals(info.GetIsolate()->GetCurrentContext(), v8_str("x"))
           .FromJust()) {
     info.GetReturnValue().Set(v8_num(2016));
@@ -3006,11 +3092,13 @@ static void NamedPropertyGetterForSerialization(
 static void AccessorForSerialization(
     v8::Local<v8::String> property,
     const v8::PropertyCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   info.GetReturnValue().Set(v8_num(2017));
 }
 
 static SerializerOneByteResource serializable_one_byte_resource("one_byte", 8);
-static SerializerTwoByteResource serializable_two_byte_resource("two_byte", 8);
+static SerializerTwoByteResource serializable_two_byte_resource(
+    AsciiToTwoByteString(u"two_byte 🤓"), 11);
 
 intptr_t original_external_references[] = {
     reinterpret_cast<intptr_t>(SerializedCallback),
@@ -3067,7 +3155,7 @@ UNINITIALIZED_TEST(SnapshotCreatorExternalReferences) {
 
       ExpectInt32("f()", 42);
       ExpectString("one_byte", "one_byte");
-      ExpectString("two_byte", "two_byte");
+      ExpectString("two_byte", "two_byte 🤓");
       creator.SetDefaultContext(context);
     }
     blob =
@@ -3092,7 +3180,7 @@ UNINITIALIZED_TEST(SnapshotCreatorExternalReferences) {
       v8::Context::Scope context_scope(context);
       ExpectInt32("f()", 42);
       ExpectString("one_byte", "one_byte");
-      ExpectString("two_byte", "two_byte");
+      ExpectString("two_byte", "two_byte 🤓");
       v8::Local<v8::String> one_byte = CompileRun("one_byte").As<v8::String>();
       v8::Local<v8::String> two_byte = CompileRun("two_byte").As<v8::String>();
       CHECK(one_byte->IsExternalOneByte());
@@ -3175,6 +3263,7 @@ UNINITIALIZED_TEST(SnapshotCreatorShortExternalReferences) {
   FreeCurrentEmbeddedBlob();
 }
 
+namespace {
 v8::StartupData CreateSnapshotWithDefaultAndCustom() {
   v8::SnapshotCreator creator(original_external_references);
   v8::Isolate* isolate = creator.GetIsolate();
@@ -3208,6 +3297,7 @@ v8::StartupData CreateSnapshotWithDefaultAndCustom() {
   }
   return creator.CreateBlob(v8::SnapshotCreator::FunctionCodeHandling::kClear);
 }
+}  // namespace
 
 UNINITIALIZED_TEST(SnapshotCreatorNoExternalReferencesDefault) {
   DisableAlwaysOpt();
@@ -4221,8 +4311,8 @@ UNINITIALIZED_TEST(ReinitializeHashSeedRehashable) {
           "p = JSON.parse('{\"foo\": {\"x\": 1}}');");
       i::Handle<i::Object> i_a = v8::Utils::OpenHandle(*CompileRun("a"));
       i::Handle<i::Object> i_o = v8::Utils::OpenHandle(*CompileRun("o"));
-      CHECK(i_a->IsJSArray());
-      CHECK(i_a->IsJSObject());
+      CHECK(IsJSArray(*i_a));
+      CHECK(IsJSObject(*i_a));
       CHECK(!i::Handle<i::JSArray>::cast(i_a)->HasFastElements());
       CHECK(!i::Handle<i::JSObject>::cast(i_o)->HasFastProperties());
       ExpectInt32("a[2111]", 5);
@@ -4250,8 +4340,8 @@ UNINITIALIZED_TEST(ReinitializeHashSeedRehashable) {
     v8::Context::Scope context_scope(context);
     i::Handle<i::Object> i_a = v8::Utils::OpenHandle(*CompileRun("a"));
     i::Handle<i::Object> i_o = v8::Utils::OpenHandle(*CompileRun("o"));
-    CHECK(i_a->IsJSArray());
-    CHECK(i_a->IsJSObject());
+    CHECK(IsJSArray(*i_a));
+    CHECK(IsJSObject(*i_a));
     CHECK(!i::Handle<i::JSArray>::cast(i_a)->HasFastElements());
     CHECK(!i::Handle<i::JSObject>::cast(i_o)->HasFastProperties());
     ExpectInt32("a[2111]", 5);
@@ -4847,14 +4937,14 @@ UNINITIALIZED_TEST(ClassFieldsWithBindings) {
 }
 
 void CheckSFIsAreWeak(WeakFixedArray sfis, Isolate* isolate) {
-  CHECK_GT(sfis.length(), 0);
+  CHECK_GT(sfis->length(), 0);
   int no_of_weak = 0;
-  for (int i = 0; i < sfis.length(); ++i) {
-    MaybeObject maybe_object = sfis.Get(i);
-    HeapObject heap_object;
+  for (int i = 0; i < sfis->length(); ++i) {
+    MaybeObject maybe_object = sfis->Get(i);
+    Tagged<HeapObject> heap_object;
     CHECK(maybe_object->IsWeakOrCleared() ||
-          (maybe_object->GetHeapObjectIfStrong(&heap_object) &&
-           heap_object.IsUndefined(isolate)));
+          (maybe_object.GetHeapObjectIfStrong(&heap_object) &&
+           IsUndefined(heap_object, isolate)));
     if (maybe_object->IsWeak()) {
       ++no_of_weak;
     }
@@ -4907,7 +4997,7 @@ UNINITIALIZED_TEST(WeakArraySerializationInSnapshot) {
 
     // Verify that the pointers in shared_function_infos are weak.
     WeakFixedArray sfis =
-        Script::cast(function->shared().script()).shared_function_infos();
+        Script::cast(function->shared()->script())->shared_function_infos();
     CheckSFIsAreWeak(sfis, reinterpret_cast<i::Isolate*>(isolate));
   }
   isolate->Dispose();
@@ -4939,7 +5029,7 @@ TEST(WeakArraySerializationInCodeCache) {
                     v8::ScriptCompiler::kConsumeCodeCache);
 
   // Verify that the pointers in shared_function_infos are weak.
-  WeakFixedArray sfis = Script::cast(copy->script()).shared_function_infos();
+  WeakFixedArray sfis = Script::cast(copy->script())->shared_function_infos();
   CheckSFIsAreWeak(sfis, isolate);
 
   delete cache;
@@ -5010,7 +5100,7 @@ TEST(CachedCompileFunctionRespectsEager) {
     auto i_fun = i::Handle<i::JSFunction>::cast(Utils::OpenHandle(*fun));
 
     // Function should be compiled iff kEagerCompile was used.
-    CHECK_EQ(i_fun->shared().is_compiled(), eager_compile);
+    CHECK_EQ(i_fun->shared()->is_compiled(), eager_compile);
   }
 }
 
@@ -5133,7 +5223,7 @@ void CheckObjectsAreInSharedHeap(Isolate* isolate) {
        obj = iterator.Next()) {
     const bool expected_in_shared_old =
         heap->MustBeInSharedOldSpace(obj) ||
-        (obj.IsString() && String::IsInPlaceInternalizable(String::cast(obj)));
+        (IsString(obj) && String::IsInPlaceInternalizable(String::cast(obj)));
     if (expected_in_shared_old) {
       CHECK(obj.InAnySharedSpace());
     }
@@ -5164,23 +5254,17 @@ UNINITIALIZED_TEST(SharedStrings) {
   Isolate* i_isolate2 = reinterpret_cast<Isolate*>(isolate2);
 
   CHECK_EQ(i_isolate1->string_table(), i_isolate2->string_table());
-  {
-    ParkedScope parked(i_isolate2->main_thread_local_heap());
-    CheckObjectsAreInSharedHeap(i_isolate1);
-  }
+  i_isolate2->main_thread_local_heap()->BlockMainThreadWhileParked(
+      [i_isolate1]() { CheckObjectsAreInSharedHeap(i_isolate1); });
 
-  {
-    ParkedScope parked(i_isolate1->main_thread_local_heap());
-    CheckObjectsAreInSharedHeap(i_isolate2);
-  }
+  i_isolate1->main_thread_local_heap()->BlockMainThreadWhileParked(
+      [i_isolate2]() { CheckObjectsAreInSharedHeap(i_isolate2); });
 
-  {
-    // Because both isolate1 and isolate2 are considered running on the main
-    // thread, one must be parked to avoid deadlock in the shared heap
-    // verification that may happen on client heap disposal.
-    ParkedScope parked(i_isolate1->main_thread_local_isolate());
-    isolate2->Dispose();
-  }
+  // Because both isolate1 and isolate2 are considered running on the main
+  // thread, one must be parked to avoid deadlock in the shared heap
+  // verification that may happen on client heap disposal.
+  i_isolate1->main_thread_local_heap()->BlockMainThreadWhileParked(
+      [isolate2]() { isolate2->Dispose(); });
   isolate1->Dispose();
 
   blobs.Dispose();
@@ -5297,14 +5381,36 @@ UNINITIALIZED_TEST(BreakPointAccessorContextSnapshot) {
 // static roots, to be able to generate the static-roots.h file.
 #if defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE) && defined(V8_SHARED_RO_HEAP)
 UNINITIALIZED_TEST(StaticRootsPredictableSnapshot) {
-  if (v8_flags.random_seed == 0) {
-    return;
+#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+  // TODO(jgruber): Snapshot determinism requires predictable heap layout
+  // (v8_flags.predictable), but this flag is currently known not to work with
+  // CSS due to false positives.
+  UNREACHABLE();
+#else
+  if (v8_flags.random_seed == 0) return;
+  const int random_seed = v8_flags.random_seed;
+
+  // Predictable RO promotion order requires a predictable initial heap layout.
+  v8_flags.predictable = true;
+  // Emulate v8_enable_fast_mksnapshot to speed up this test.
+  {
+    v8_flags.turbo_verify_allocation = false;
+#if defined(V8_TARGET_ARCH_X64) || defined(V8_TARGET_ARCH_IA32)
+    v8_flags.turbo_rewrite_far_jumps = false;
+#endif
+#ifdef ENABLE_SLOW_DCHECKS
+    v8_flags.enable_slow_asserts = false;
+#endif
   }
+  i::FlagList::EnforceFlagImplications();
 
   v8::Isolate* isolate1 = TestSerializer::NewIsolateInitialized();
   StartupBlobs blobs1 = Serialize(isolate1);
   isolate1->Dispose();
 
+  // Reset the seed.
+  v8_flags.random_seed = random_seed;
+
   v8::Isolate* isolate2 = TestSerializer::NewIsolateInitialized();
   StartupBlobs blobs2 = Serialize(isolate2);
   isolate2->Dispose();
@@ -5319,6 +5425,7 @@ UNINITIALIZED_TEST(StaticRootsPredictableSnapshot) {
   blobs1.Dispose();
   blobs2.Dispose();
   FreeCurrentEmbeddedBlob();
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
 }
 #endif  // defined(V8_COMPRESS_POINTERS_IN_SHARED_CAGE) &&
         // defined(V8_SHARED_RO_HEAP)
diff --git a/deps/v8/test/cctest/test-shared-strings.cc b/deps/v8/test/cctest/test-shared-strings.cc
index cd5ebb276f7e80..0364edbf721c82 100644
--- a/deps/v8/test/cctest/test-shared-strings.cc
+++ b/deps/v8/test/cctest/test-shared-strings.cc
@@ -11,9 +11,10 @@
 #include "src/flags/flags.h"
 #include "src/heap/factory.h"
 #include "src/heap/heap-inl.h"
+#include "src/heap/heap.h"
 #include "src/heap/memory-chunk-layout.h"
 #include "src/heap/memory-chunk.h"
-#include "src/heap/parked-scope.h"
+#include "src/heap/parked-scope-inl.h"
 #include "src/heap/remembered-set.h"
 #include "src/heap/safepoint.h"
 #include "src/objects/fixed-array.h"
@@ -44,11 +45,9 @@ struct V8_NODISCARD IsolateParkOnDisposeWrapper {
       : isolate(isolate), isolate_to_park(isolate_to_park) {}
 
   ~IsolateParkOnDisposeWrapper() {
-    {
-      i::ParkedScope parked(reinterpret_cast<Isolate*>(isolate_to_park)
-                                ->main_thread_local_isolate());
-      isolate->Dispose();
-    }
+    auto main_isolate = reinterpret_cast<Isolate*>(isolate_to_park)
+                            ->main_thread_local_isolate();
+    main_isolate->BlockMainThreadWhileParked([this]() { isolate->Dispose(); });
   }
 
   v8::Isolate* const isolate;
@@ -77,6 +76,8 @@ class MultiClientIsolateTest {
     return reinterpret_cast<Isolate*>(main_isolate_);
   }
 
+  int& main_isolate_wakeup_counter() { return main_isolate_wakeup_counter_; }
+
   v8::Isolate* NewClientIsolate() {
     CHECK_NOT_NULL(main_isolate_);
     std::unique_ptr<v8::ArrayBuffer::Allocator> allocator(
@@ -88,6 +89,7 @@ class MultiClientIsolateTest {
 
  private:
   v8::Isolate* main_isolate_;
+  int main_isolate_wakeup_counter_ = 0;
 };
 
 UNINITIALIZED_TEST(InPlaceInternalizableStringsAreShared) {
@@ -109,32 +111,32 @@ UNINITIALIZED_TEST(InPlaceInternalizableStringsAreShared) {
   // Old generation 1- and 2-byte seq strings are in-place internalizable.
   Handle<String> old_one_byte_seq =
       factory1->NewStringFromAsciiChecked(raw_one_byte, AllocationType::kOld);
-  CHECK(old_one_byte_seq->InSharedHeap());
+  CHECK(Object::InSharedHeap(*old_one_byte_seq));
   Handle<String> old_two_byte_seq =
       factory1->NewStringFromTwoByte(two_byte, AllocationType::kOld)
           .ToHandleChecked();
-  CHECK(old_two_byte_seq->InSharedHeap());
+  CHECK(Object::InSharedHeap(*old_two_byte_seq));
 
   // Young generation are not internalizable and not shared when sharing the
   // string table.
   Handle<String> young_one_byte_seq =
       factory1->NewStringFromAsciiChecked(raw_one_byte, AllocationType::kYoung);
-  CHECK(!young_one_byte_seq->InSharedHeap());
+  CHECK(!Object::InSharedHeap(*young_one_byte_seq));
   Handle<String> young_two_byte_seq =
       factory1->NewStringFromTwoByte(two_byte, AllocationType::kYoung)
           .ToHandleChecked();
-  CHECK(!young_two_byte_seq->InSharedHeap());
+  CHECK(!Object::InSharedHeap(*young_two_byte_seq));
 
   // Internalized strings are shared.
   uint64_t seed = HashSeed(i_isolate1);
   Handle<String> one_byte_intern = factory1->NewOneByteInternalizedString(
       base::OneByteVector(raw_one_byte),
       StringHasher::HashSequentialString<char>(raw_one_byte, 3, seed));
-  CHECK(one_byte_intern->InSharedHeap());
+  CHECK(Object::InSharedHeap(*one_byte_intern));
   Handle<String> two_byte_intern = factory1->NewTwoByteInternalizedString(
       two_byte,
       StringHasher::HashSequentialString<uint16_t>(raw_two_byte, 3, seed));
-  CHECK(two_byte_intern->InSharedHeap());
+  CHECK(Object::InSharedHeap(*two_byte_intern));
 }
 
 UNINITIALIZED_TEST(InPlaceInternalization) {
@@ -168,10 +170,10 @@ UNINITIALIZED_TEST(InPlaceInternalization) {
       factory1->InternalizeString(old_one_byte_seq1);
   Handle<String> two_byte_intern1 =
       factory1->InternalizeString(old_two_byte_seq1);
-  CHECK(old_one_byte_seq1->InSharedHeap());
-  CHECK(old_two_byte_seq1->InSharedHeap());
-  CHECK(one_byte_intern1->InSharedHeap());
-  CHECK(two_byte_intern1->InSharedHeap());
+  CHECK(Object::InSharedHeap(*old_one_byte_seq1));
+  CHECK(Object::InSharedHeap(*old_two_byte_seq1));
+  CHECK(Object::InSharedHeap(*one_byte_intern1));
+  CHECK(Object::InSharedHeap(*two_byte_intern1));
   CHECK(old_one_byte_seq1.equals(one_byte_intern1));
   CHECK(old_two_byte_seq1.equals(two_byte_intern1));
   CHECK_EQ(*old_one_byte_seq1, *one_byte_intern1);
@@ -189,10 +191,10 @@ UNINITIALIZED_TEST(InPlaceInternalization) {
       factory2->InternalizeString(old_one_byte_seq2);
   Handle<String> two_byte_intern2 =
       factory2->InternalizeString(old_two_byte_seq2);
-  CHECK(old_one_byte_seq2->InSharedHeap());
-  CHECK(old_two_byte_seq2->InSharedHeap());
-  CHECK(one_byte_intern2->InSharedHeap());
-  CHECK(two_byte_intern2->InSharedHeap());
+  CHECK(Object::InSharedHeap(*old_one_byte_seq2));
+  CHECK(Object::InSharedHeap(*old_two_byte_seq2));
+  CHECK(Object::InSharedHeap(*one_byte_intern2));
+  CHECK(Object::InSharedHeap(*two_byte_intern2));
   CHECK(!old_one_byte_seq2.equals(one_byte_intern2));
   CHECK(!old_two_byte_seq2.equals(two_byte_intern2));
   CHECK_NE(*old_one_byte_seq2, *one_byte_intern2);
@@ -224,51 +226,60 @@ UNINITIALIZED_TEST(YoungInternalization) {
 
   // Allocate two young strings in isolate1 then intern them. Young strings
   // aren't in-place internalizable and are copied when internalized.
-  Handle<String> young_one_byte_seq1 =
-      factory1->NewStringFromAsciiChecked(raw_one_byte, AllocationType::kYoung);
-  Handle<String> young_two_byte_seq1 =
-      factory1->NewStringFromTwoByte(two_byte, AllocationType::kYoung)
-          .ToHandleChecked();
-  Handle<String> one_byte_intern1 =
-      factory1->InternalizeString(young_one_byte_seq1);
-  Handle<String> two_byte_intern1 =
-      factory1->InternalizeString(young_two_byte_seq1);
-  CHECK(!young_one_byte_seq1->InSharedHeap());
-  CHECK(!young_two_byte_seq1->InSharedHeap());
-  CHECK(one_byte_intern1->InSharedHeap());
-  CHECK(two_byte_intern1->InSharedHeap());
-  CHECK(!young_one_byte_seq1.equals(one_byte_intern1));
-  CHECK(!young_two_byte_seq1.equals(two_byte_intern1));
-  CHECK_NE(*young_one_byte_seq1, *one_byte_intern1);
-  CHECK_NE(*young_two_byte_seq1, *two_byte_intern1);
+  Handle<String> young_one_byte_seq1;
+  Handle<String> young_two_byte_seq1;
+  Handle<String> one_byte_intern1;
+  Handle<String> two_byte_intern1;
+  i_isolate2->main_thread_local_isolate()->BlockMainThreadWhileParked([&]() {
+    young_one_byte_seq1 = factory1->NewStringFromAsciiChecked(
+        raw_one_byte, AllocationType::kYoung);
+    young_two_byte_seq1 =
+        factory1->NewStringFromTwoByte(two_byte, AllocationType::kYoung)
+            .ToHandleChecked();
+    one_byte_intern1 = factory1->InternalizeString(young_one_byte_seq1);
+    two_byte_intern1 = factory1->InternalizeString(young_two_byte_seq1);
+    CHECK(!Object::InSharedHeap(*young_one_byte_seq1));
+    CHECK(!Object::InSharedHeap(*young_two_byte_seq1));
+    CHECK(Object::InSharedHeap(*one_byte_intern1));
+    CHECK(Object::InSharedHeap(*two_byte_intern1));
+    CHECK(!young_one_byte_seq1.equals(one_byte_intern1));
+    CHECK(!young_two_byte_seq1.equals(two_byte_intern1));
+    CHECK_NE(*young_one_byte_seq1, *one_byte_intern1);
+    CHECK_NE(*young_two_byte_seq1, *two_byte_intern1);
+  });
 
   // Allocate two young strings with the same contents in isolate2 then intern
   // them. They should be the same as the interned strings from isolate1.
-  Handle<String> young_one_byte_seq2 =
-      factory2->NewStringFromAsciiChecked(raw_one_byte, AllocationType::kYoung);
-  Handle<String> young_two_byte_seq2 =
-      factory2->NewStringFromTwoByte(two_byte, AllocationType::kYoung)
-          .ToHandleChecked();
-  Handle<String> one_byte_intern2 =
-      factory2->InternalizeString(young_one_byte_seq2);
-  Handle<String> two_byte_intern2 =
-      factory2->InternalizeString(young_two_byte_seq2);
-  CHECK(!young_one_byte_seq2.equals(one_byte_intern2));
-  CHECK(!young_two_byte_seq2.equals(two_byte_intern2));
-  CHECK_NE(*young_one_byte_seq2, *one_byte_intern2);
-  CHECK_NE(*young_two_byte_seq2, *two_byte_intern2);
-  CHECK_EQ(*one_byte_intern1, *one_byte_intern2);
-  CHECK_EQ(*two_byte_intern1, *two_byte_intern2);
+  Handle<String> young_one_byte_seq2;
+  Handle<String> young_two_byte_seq2;
+  Handle<String> one_byte_intern2;
+  Handle<String> two_byte_intern2;
+  {
+    v8::Isolate::Scope isolate_scope(isolate_wrapper.isolate);
+    young_one_byte_seq2 = factory2->NewStringFromAsciiChecked(
+        raw_one_byte, AllocationType::kYoung);
+    young_two_byte_seq2 =
+        factory2->NewStringFromTwoByte(two_byte, AllocationType::kYoung)
+            .ToHandleChecked();
+    one_byte_intern2 = factory2->InternalizeString(young_one_byte_seq2);
+    two_byte_intern2 = factory2->InternalizeString(young_two_byte_seq2);
+    CHECK(!young_one_byte_seq2.equals(one_byte_intern2));
+    CHECK(!young_two_byte_seq2.equals(two_byte_intern2));
+    CHECK_NE(*young_one_byte_seq2, *one_byte_intern2);
+    CHECK_NE(*young_two_byte_seq2, *two_byte_intern2);
+    CHECK_EQ(*one_byte_intern1, *one_byte_intern2);
+    CHECK_EQ(*two_byte_intern1, *two_byte_intern2);
+  }
 }
 
-class ConcurrentStringThreadBase : public v8::base::Thread {
+class ConcurrentStringThreadBase : public ParkingThread {
  public:
   ConcurrentStringThreadBase(const char* name, MultiClientIsolateTest* test,
                              Handle<FixedArray> shared_strings,
                              ParkingSemaphore* sema_ready,
                              ParkingSemaphore* sema_execute_start,
                              ParkingSemaphore* sema_execute_complete)
-      : v8::base::Thread(base::Thread::Options(name)),
+      : ParkingThread(base::Thread::Options(name)),
         test_(test),
         shared_strings_(shared_strings),
         sema_ready_(sema_ready),
@@ -303,14 +314,7 @@ class ConcurrentStringThreadBase : public v8::base::Thread {
     i_isolate = nullptr;
   }
 
-  void ParkedJoin(const ParkedScope& scope) {
-    USE(scope);
-    Join();
-  }
-
  protected:
-  using base::Thread::Join;
-
   Isolate* i_isolate;
   MultiClientIsolateTest* test_;
   Handle<FixedArray> shared_strings_;
@@ -341,7 +345,7 @@ class ConcurrentInternalizationThread final
     CHECK(input_string->IsShared());
     Handle<String> interned = factory->InternalizeString(input_string);
     CHECK(interned->IsShared());
-    CHECK(interned->IsInternalizedString());
+    CHECK(IsInternalizedString(*interned));
     if (hit_or_miss_ == kTestMiss) {
       CHECK_EQ(*input_string, *interned);
     } else {
@@ -447,10 +451,7 @@ void TestConcurrentInternalization(TestHitOrMiss hit_or_miss) {
     sema_execute_complete.ParkedWait(local_isolate);
   }
 
-  ParkedScope parked(local_isolate);
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  ParkingThread::ParkedJoinAll(local_isolate, threads);
 }
 }  // namespace
 
@@ -476,12 +477,13 @@ class ConcurrentStringTableLookupThread final
 
   void RunForString(Handle<String> input_string, int counter) override {
     CHECK(input_string->IsShared());
-    Object result = Object(StringTable::TryStringToIndexOrLookupExisting(
-        i_isolate, input_string->ptr()));
-    if (result.IsString()) {
-      String internalized = String::cast(result);
-      CHECK(internalized.IsInternalizedString());
-      CHECK_IMPLIES(input_string->IsInternalizedString(),
+    Tagged<Object> result =
+        Object(StringTable::TryStringToIndexOrLookupExisting(
+            i_isolate, input_string->ptr()));
+    if (IsString(result)) {
+      Tagged<String> internalized = String::cast(result);
+      CHECK(IsInternalizedString(internalized));
+      CHECK_IMPLIES(IsInternalizedString(*input_string),
                     *input_string == internalized);
     } else {
       CHECK_EQ(Smi::cast(result).value(), ResultSentinel::kNotFound);
@@ -538,10 +540,7 @@ UNINITIALIZED_TEST(ConcurrentStringTableLookup) {
     sema_execute_complete.ParkedWait(local_isolate);
   }
 
-  ParkedScope parked(local_isolate);
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  ParkingThread::ParkedJoinAll(local_isolate, threads);
 }
 
 namespace {
@@ -557,8 +556,8 @@ Handle<String> ShareAndVerify(Isolate* isolate, Handle<String> string) {
   Handle<String> shared = String::Share(isolate, string);
   CHECK(shared->IsShared());
 #ifdef VERIFY_HEAP
-  shared->ObjectVerify(isolate);
-  string->ObjectVerify(isolate);
+  Object::ObjectVerify(*shared, isolate);
+  Object::ObjectVerify(*string, isolate);
 #endif  // VERIFY_HEAP
   return shared;
 }
@@ -713,8 +712,8 @@ UNINITIALIZED_TEST(StringShare) {
           i_isolate->main_thread_local_heap(),
           GarbageCollectionReason::kTesting);
     }
-    CHECK(one_byte_ext->IsExternalString());
-    CHECK(two_byte_ext->IsExternalString());
+    CHECK(IsExternalString(*one_byte_ext));
+    CHECK(IsExternalString(*two_byte_ext));
     CHECK(!one_byte_ext->IsShared());
     CHECK(!two_byte_ext->IsShared());
     Handle<String> shared_one_byte = ShareAndVerify(i_isolate, one_byte_ext);
@@ -771,7 +770,7 @@ UNINITIALIZED_TEST(StringShare) {
     Handle<String> cons =
         factory->NewConsString(one_byte_seq1, one_byte_seq2).ToHandleChecked();
     CHECK(!cons->IsShared());
-    CHECK(cons->IsConsString());
+    CHECK(IsConsString(*cons));
     Handle<String> shared = ShareAndVerify(i_isolate, cons);
     CheckSharedStringIsEqualCopy(shared, cons);
   }
@@ -784,7 +783,7 @@ UNINITIALIZED_TEST(StringShare) {
     Handle<String> sliced =
         factory->NewSubString(one_byte_seq, 1, one_byte_seq->length());
     CHECK(!sliced->IsShared());
-    CHECK(sliced->IsSlicedString());
+    CHECK(IsSlicedString(*sliced));
     Handle<String> shared = ShareAndVerify(i_isolate, sliced);
     CheckSharedStringIsEqualCopy(shared, sliced);
   }
@@ -796,7 +795,9 @@ UNINITIALIZED_TEST(PromotionMarkCompact) {
 
   v8_flags.stress_concurrent_allocation = false;  // For SealCurrentObjects.
   v8_flags.shared_string_table = true;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   MultiClientIsolateTest test;
   Isolate* i_isolate = test.i_main_isolate();
@@ -820,9 +821,11 @@ UNINITIALIZED_TEST(PromotionMarkCompact) {
 
     // 1st GC moves `one_byte_seq` to old space and 2nd GC evacuates it within
     // old space.
-    CcTest::CollectAllGarbage(i_isolate);
+    heap::InvokeMajorGC(heap);
     heap::ForceEvacuationCandidate(i::Page::FromHeapObject(*one_byte_seq));
-    CcTest::CollectAllGarbage(i_isolate);
+    // We need to invoke GC without stack, otherwise no compaction is performed.
+    DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+    heap::InvokeMajorGC(heap);
 
     // In-place-internalizable strings are promoted into the shared heap when
     // sharing.
@@ -831,7 +834,7 @@ UNINITIALIZED_TEST(PromotionMarkCompact) {
 }
 
 UNINITIALIZED_TEST(PromotionScavenge) {
-  if (v8_flags.minor_mc) return;
+  if (v8_flags.minor_ms) return;
   if (v8_flags.single_generation) return;
   if (!V8_CAN_CREATE_SHARED_HEAP_BOOL) return;
 
@@ -859,7 +862,7 @@ UNINITIALIZED_TEST(PromotionScavenge) {
     CHECK(heap->InSpace(*one_byte_seq, NEW_SPACE));
 
     for (int i = 0; i < 2; i++) {
-      CcTest::CollectGarbage(NEW_SPACE, i_isolate);
+      heap::InvokeMinorGC(heap);
     }
 
     // In-place-internalizable strings are promoted into the shared heap when
@@ -869,9 +872,9 @@ UNINITIALIZED_TEST(PromotionScavenge) {
 }
 
 UNINITIALIZED_TEST(PromotionScavengeOldToShared) {
-  if (v8_flags.minor_mc) {
+  if (v8_flags.minor_ms) {
     // Promoting from new space directly to shared heap is not implemented in
-    // MinorMC.
+    // MinorMS.
     return;
   }
   if (v8_flags.single_generation) return;
@@ -907,7 +910,7 @@ UNINITIALIZED_TEST(PromotionScavengeOldToShared) {
         RememberedSet<OLD_TO_NEW>::Contains(old_object_chunk, slot.address()));
 
     for (int i = 0; i < 2; i++) {
-      CcTest::CollectGarbage(NEW_SPACE, i_isolate);
+      heap::InvokeMinorGC(heap);
     }
 
     // In-place-internalizable strings are promoted into the shared heap when
@@ -927,14 +930,15 @@ UNINITIALIZED_TEST(PromotionMarkCompactNewToShared) {
   if (v8_flags.stress_concurrent_allocation) return;
 
   v8_flags.shared_string_table = true;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   v8_flags.page_promotion = false;
 
   MultiClientIsolateTest test;
   Isolate* i_isolate = test.i_main_isolate();
   Factory* factory = i_isolate->factory();
   Heap* heap = i_isolate->heap();
-  ManualGCScope manual_gc(i_isolate);
 
   const char raw_one_byte[] = "foo";
 
@@ -956,7 +960,9 @@ UNINITIALIZED_TEST(PromotionMarkCompactNewToShared) {
     CHECK(
         RememberedSet<OLD_TO_NEW>::Contains(old_object_chunk, slot.address()));
 
-    CcTest::CollectGarbage(OLD_SPACE, i_isolate);
+    // We need to invoke GC without stack, otherwise no compaction is performed.
+    DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+    heap::InvokeMajorGC(heap);
 
     // In-place-internalizable strings are promoted into the shared heap when
     // sharing.
@@ -979,13 +985,14 @@ UNINITIALIZED_TEST(PromotionMarkCompactOldToShared) {
   }
 
   v8_flags.shared_string_table = true;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   MultiClientIsolateTest test;
   Isolate* i_isolate = test.i_main_isolate();
   Factory* factory = i_isolate->factory();
   Heap* heap = i_isolate->heap();
-  ManualGCScope manual_gc(i_isolate);
 
   const char raw_one_byte[] = "foo";
 
@@ -1006,7 +1013,7 @@ UNINITIALIZED_TEST(PromotionMarkCompactOldToShared) {
     // Fill the page and do a full GC. Page promotion should kick in and promote
     // the page as is to old space.
     heap::FillCurrentPage(heap->new_space(), &handles);
-    heap->CollectGarbage(OLD_SPACE, GarbageCollectionReason::kTesting);
+    heap::InvokeMajorGC(heap);
     // Make sure 'one_byte_seq' is in old space.
     CHECK(!MemoryChunk::FromHeapObject(*one_byte_seq)->InYoungGeneration());
     CHECK(heap->Contains(*one_byte_seq));
@@ -1017,7 +1024,9 @@ UNINITIALIZED_TEST(PromotionMarkCompactOldToShared) {
         !RememberedSet<OLD_TO_NEW>::Contains(old_object_chunk, slot.address()));
 
     heap::ForceEvacuationCandidate(Page::FromHeapObject(*one_byte_seq));
-    heap->CollectGarbage(OLD_SPACE, GarbageCollectionReason::kTesting);
+    // We need to invoke GC without stack, otherwise no compaction is performed.
+    DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+    heap::InvokeMajorGC(heap);
 
     // In-place-internalizable strings are promoted into the shared heap when
     // sharing.
@@ -1036,13 +1045,14 @@ UNINITIALIZED_TEST(PagePromotionRecordingOldToShared) {
   if (v8_flags.stress_concurrent_allocation) return;
 
   v8_flags.shared_string_table = true;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   MultiClientIsolateTest test;
   Isolate* i_isolate = test.i_main_isolate();
   Factory* factory = i_isolate->factory();
   Heap* heap = i_isolate->heap();
-  ManualGCScope manual_gc(i_isolate);
 
   const char raw_one_byte[] = "foo";
 
@@ -1066,7 +1076,7 @@ UNINITIALIZED_TEST(PagePromotionRecordingOldToShared) {
 
     young_object->set(0, *shared_string);
 
-    CcTest::CollectGarbage(OLD_SPACE, i_isolate);
+    heap::EmptyNewSpaceUsingGC(heap);
 
     // Object should get promoted using page promotion, so address should remain
     // the same.
@@ -1107,13 +1117,13 @@ UNINITIALIZED_TEST(InternalizedSharedStringsTransitionDuringGC) {
                                   i_isolate);
       Handle<String> interned = factory->InternalizeString(input_string);
       CHECK(input_string->IsShared());
-      CHECK(!input_string->IsThinString());
+      CHECK(!IsThinString(*input_string));
       CHECK(input_string->HasForwardingIndex(kAcquireLoad));
       CHECK(String::Equals(i_isolate, input_string, interned));
     }
 
     // Trigger garbage collection on the shared isolate.
-    CcTest::CollectSharedGarbage(i_isolate);
+    heap::CollectSharedGarbage(i_isolate->heap());
 
     // Check that GC cleared the forwarding table.
     CHECK_EQ(i_isolate->string_forwarding_table()->size(), 0);
@@ -1122,7 +1132,7 @@ UNINITIALIZED_TEST(InternalizedSharedStringsTransitionDuringGC) {
     for (int i = 0; i < shared_strings->length(); i++) {
       Handle<String> input_string(String::cast(shared_strings->get(i)),
                                   i_isolate);
-      CHECK(input_string->IsThinString());
+      CHECK(IsThinString(*input_string));
     }
   }
 }
@@ -1154,7 +1164,7 @@ UNINITIALIZED_TEST(ShareExternalString) {
         i_isolate1->main_thread_local_heap(),
         GarbageCollectionReason::kTesting);
   }
-  CHECK(one_byte->IsExternalString());
+  CHECK(IsExternalString(*one_byte));
   Handle<ExternalOneByteString> one_byte_external =
       Handle<ExternalOneByteString>::cast(one_byte);
   Handle<String> shared_one_byte =
@@ -1216,8 +1226,8 @@ UNINITIALIZED_TEST(ExternalizeSharedString) {
   TwoByteResource* two_byte_res = resource_factory.CreateTwoByte(two_byte_vec);
   shared_one_byte->MakeExternal(one_byte_res);
   shared_two_byte->MakeExternal(two_byte_res);
-  CHECK(!shared_one_byte->IsExternalString());
-  CHECK(!shared_two_byte->IsExternalString());
+  CHECK(!IsExternalString(*shared_one_byte));
+  CHECK(!IsExternalString(*shared_two_byte));
   CHECK(shared_one_byte->HasExternalForwardingIndex(kAcquireLoad));
   CHECK(shared_two_byte->HasExternalForwardingIndex(kAcquireLoad));
 
@@ -1261,7 +1271,7 @@ UNINITIALIZED_TEST(ExternalizedSharedStringsTransitionDuringGC) {
           resource_factory.CreateOneByte(buffer, length, false);
       CHECK(input_string->MakeExternal(resource));
       CHECK(input_string->IsShared());
-      CHECK(!input_string->IsExternalString());
+      CHECK(!IsExternalString(*input_string));
       CHECK(input_string->HasExternalForwardingIndex(kAcquireLoad));
     }
 
@@ -1276,7 +1286,7 @@ UNINITIALIZED_TEST(ExternalizedSharedStringsTransitionDuringGC) {
     for (int i = 0; i < shared_strings->length(); i++) {
       Handle<String> input_string(String::cast(shared_strings->get(i)),
                                   i_isolate);
-      CHECK(input_string->IsExternalString());
+      CHECK(IsExternalString(*input_string));
     }
   }
 }
@@ -1316,8 +1326,8 @@ UNINITIALIZED_TEST(ExternalizeInternalizedString) {
         i_isolate1->main_thread_local_heap(),
         GarbageCollectionReason::kTesting);
   }
-  CHECK(one_byte->IsThinString());
-  CHECK(two_byte->IsThinString());
+  CHECK(IsThinString(*one_byte));
+  CHECK(IsThinString(*two_byte));
   CHECK(one_byte_intern->IsOneByteRepresentation());
   CHECK(two_byte_intern->IsTwoByteRepresentation());
   CHECK(one_byte_intern->IsShared());
@@ -1330,8 +1340,8 @@ UNINITIALIZED_TEST(ExternalizeInternalizedString) {
   TwoByteResource* two_byte_res = resource_factory.CreateTwoByte(two_byte_vec);
   CHECK(one_byte_intern->MakeExternal(one_byte_res));
   CHECK(two_byte_intern->MakeExternal(two_byte_res));
-  CHECK(!one_byte_intern->IsExternalString());
-  CHECK(!two_byte_intern->IsExternalString());
+  CHECK(!IsExternalString(*one_byte_intern));
+  CHECK(!IsExternalString(*two_byte_intern));
   CHECK(one_byte_intern->HasExternalForwardingIndex(kAcquireLoad));
   CHECK(two_byte_intern->HasExternalForwardingIndex(kAcquireLoad));
   // The hash of internalized strings is stored in the forwarding table.
@@ -1381,15 +1391,15 @@ UNINITIALIZED_TEST(InternalizeSharedExternalString) {
   i_isolate1->heap()->CollectGarbageShared(i_isolate1->main_thread_local_heap(),
                                            GarbageCollectionReason::kTesting);
   CHECK(shared_one_byte->IsShared());
-  CHECK(shared_one_byte->IsExternalString());
+  CHECK(IsExternalString(*shared_one_byte));
   CHECK(shared_two_byte->IsShared());
-  CHECK(shared_two_byte->IsExternalString());
+  CHECK(IsExternalString(*shared_two_byte));
 
   // Shared cached external strings are in-place internalizable.
   Handle<String> one_byte_intern = factory1->InternalizeString(shared_one_byte);
   CHECK_EQ(*one_byte_intern, *shared_one_byte);
-  CHECK(shared_one_byte->IsExternalString());
-  CHECK(shared_one_byte->IsInternalizedString());
+  CHECK(IsExternalString(*shared_one_byte));
+  CHECK(IsInternalizedString(*shared_one_byte));
 
   // Depending on the architecture/build options the two byte string might be
   // cached or uncached.
@@ -1402,13 +1412,13 @@ UNINITIALIZED_TEST(InternalizeSharedExternalString) {
     Handle<String> two_byte_intern = factory1->InternalizeString(two_byte);
     CHECK_NE(*two_byte_intern, *shared_two_byte);
     CHECK(shared_two_byte->HasInternalizedForwardingIndex(kAcquireLoad));
-    CHECK(two_byte_intern->IsInternalizedString());
-    CHECK(!two_byte_intern->IsExternalString());
+    CHECK(IsInternalizedString(*two_byte_intern));
+    CHECK(!IsExternalString(*two_byte_intern));
   } else {
     Handle<String> two_byte_intern = factory1->InternalizeString(two_byte);
     CHECK_EQ(*two_byte_intern, *shared_two_byte);
-    CHECK(shared_two_byte->IsExternalString());
-    CHECK(shared_two_byte->IsInternalizedString());
+    CHECK(IsExternalString(*shared_two_byte));
+    CHECK(IsInternalizedString(*shared_two_byte));
   }
 
   // Another GC should create an externalized internalized string of the cached
@@ -1416,14 +1426,14 @@ UNINITIALIZED_TEST(InternalizeSharedExternalString) {
   // ThinString, disposing the external resource.
   i_isolate1->heap()->CollectGarbageShared(i_isolate1->main_thread_local_heap(),
                                            GarbageCollectionReason::kTesting);
-  CHECK_EQ(shared_one_byte->map().instance_type(),
-           InstanceType::EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE);
+  CHECK_EQ(shared_one_byte->map()->instance_type(),
+           InstanceType::EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE);
   if (is_uncached) {
-    CHECK(shared_two_byte->IsThinString());
+    CHECK(IsThinString(*shared_two_byte));
     CHECK(two_byte_res->IsDisposed());
   } else {
-    CHECK_EQ(shared_two_byte->map().instance_type(),
-             InstanceType::EXTERNAL_INTERNALIZED_STRING_TYPE);
+    CHECK_EQ(shared_two_byte->map()->instance_type(),
+             InstanceType::EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE);
   }
 }
 
@@ -1455,8 +1465,8 @@ UNINITIALIZED_TEST(ExternalizeAndInternalizeMissSharedString) {
 
   Handle<String> one_byte_intern = factory1->InternalizeString(shared_one_byte);
   CHECK_EQ(*one_byte_intern, *shared_one_byte);
-  CHECK(shared_one_byte->IsInternalizedString());
-  // Check that we have both, a forwarding index and an accessable hash.
+  CHECK(IsInternalizedString(*shared_one_byte));
+  // Check that we have both, a forwarding index and an accessible hash.
   CHECK(shared_one_byte->HasExternalForwardingIndex(kAcquireLoad));
   CHECK(shared_one_byte->HasHashCode());
   CHECK_EQ(shared_one_byte->hash(), one_byte_hash);
@@ -1612,13 +1622,13 @@ void CreateExternalResources(Isolate* i_isolate, Handle<FixedArray> strings,
 }
 
 void CheckStringAndResource(
-    String string, int index, bool should_be_alive, String deleted_string,
-    bool check_transition, bool shared_resources,
+    Tagged<String> string, int index, bool should_be_alive,
+    Tagged<String> deleted_string, bool check_transition, bool shared_resources,
     const std::vector<std::unique_ptr<ConcurrentExternalizationThread>>&
         threads) {
   if (check_transition) {
     if (should_be_alive) {
-      CHECK(string.IsExternalString());
+      CHECK(IsExternalString(string));
     } else {
       CHECK_EQ(string, deleted_string);
     }
@@ -1632,7 +1642,7 @@ void CheckStringAndResource(
   }
 
   // Check exact alive resources only if the string has transitioned, otherwise
-  // there can still be mulitple resource instances in the forwarding table.
+  // there can still be multiple resource instances in the forwarding table.
   // Only check no resource is alive if the string is dead.
   const bool check_alive = check_transition || !should_be_alive;
   if (check_alive) {
@@ -1720,15 +1730,12 @@ void TestConcurrentExternalization(bool share_resources) {
   for (int i = 0; i < shared_strings->length(); i++) {
     Handle<String> input_string(String::cast(shared_strings->get(i)),
                                 i_isolate);
-    String string = *input_string;
+    Tagged<String> string = *input_string;
     CheckStringAndResource(string, i, true, String{}, true, share_resources,
                            threads);
   }
 
-  ParkedScope parked(local_isolate);
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  ParkingThread::ParkedJoinAll(local_isolate, threads);
 }
 
 UNINITIALIZED_TEST(ConcurrentExternalizationWithUniqueResources) {
@@ -1819,7 +1826,7 @@ void TestConcurrentExternalizationWithDeadStrings(bool share_resources,
     Handle<String> input_string(String::cast(shared_strings->get(i)),
                                 i_isolate);
     const bool should_be_alive = i % 3 != 0;
-    String string = *input_string;
+    Tagged<String> string = *input_string;
     CheckStringAndResource(string, i, should_be_alive, *empty_string,
                            transition_with_stack, share_resources, threads);
   }
@@ -1837,16 +1844,13 @@ void TestConcurrentExternalizationWithDeadStrings(bool share_resources,
       Handle<String> input_string(String::cast(shared_strings->get(i)),
                                   i_isolate);
       const bool should_be_alive = i % 3 != 0;
-      String string = *input_string;
+      Tagged<String> string = *input_string;
       CheckStringAndResource(string, i, should_be_alive, *empty_string, true,
                              share_resources, threads);
     }
   }
 
-  ParkedScope parked(local_isolate);
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  ParkingThread::ParkedJoinAll(local_isolate, threads);
 }
 
 UNINITIALIZED_TEST(
@@ -1932,10 +1936,10 @@ void TestConcurrentExternalizationAndInternalization(
   for (int i = 0; i < shared_strings->length(); i++) {
     Handle<String> input_string(String::cast(shared_strings->get(i)),
                                 i_isolate);
-    String string = *input_string;
+    Tagged<String> string = *input_string;
     if (hit_or_miss == kTestHit) {
-      CHECK(string.IsThinString());
-      string = ThinString::cast(string).actual();
+      CHECK(IsThinString(string));
+      string = ThinString::cast(string)->actual();
     }
     int alive_resources = 0;
     for (int t = kInternalizationThreads; t < kTotalThreads; t++) {
@@ -1954,13 +1958,10 @@ void TestConcurrentExternalizationAndInternalization(
     // and dispose the resource.
     CHECK_LE(alive_resources, 1);
     CHECK_EQ(shape.IsExternal(), alive_resources);
-    CHECK(string.HasHashCode());
+    CHECK(string->HasHashCode());
   }
 
-  ParkedScope parked(local_isolate);
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  ParkingThread::ParkedJoinAll(local_isolate, threads);
 }
 
 UNINITIALIZED_TEST(ConcurrentExternalizationAndInternalizationMiss) {
@@ -1984,33 +1985,32 @@ UNINITIALIZED_TEST(SharedStringInGlobalHandle) {
   Handle<String> shared_string =
       factory->NewStringFromAsciiChecked("foobar", AllocationType::kSharedOld);
   CHECK(shared_string->InWritableSharedSpace());
-  v8::Local<v8::String> lh_shared_string =
-      Utils::Convert<String, v8::String>(shared_string);
+  v8::Local<v8::String> lh_shared_string = Utils::ToLocal(shared_string);
   v8::Global<v8::String> gh_shared_string(test.main_isolate(),
                                           lh_shared_string);
   gh_shared_string.SetWeak();
 
-  CcTest::CollectGarbage(OLD_SPACE, i_isolate);
+  heap::InvokeMajorGC(i_isolate->heap());
 
   CHECK(!gh_shared_string.IsEmpty());
 }
 
 class WakeupTask : public CancelableTask {
  public:
-  explicit WakeupTask(Isolate* isolate) : CancelableTask(isolate) {}
+  explicit WakeupTask(Isolate* isolate, int& wakeup_counter)
+      : CancelableTask(isolate), wakeup_counter_(wakeup_counter) {}
 
  private:
   // v8::internal::CancelableTask overrides.
-  void RunInternal() override {}
+  void RunInternal() override { (wakeup_counter_)++; }
+
+  int& wakeup_counter_;
 };
 
 class WorkerIsolateThread : public v8::base::Thread {
  public:
-  WorkerIsolateThread(const char* name, MultiClientIsolateTest* test,
-                      std::atomic<bool>* done)
-      : v8::base::Thread(base::Thread::Options(name)),
-        test_(test),
-        done_(done) {}
+  WorkerIsolateThread(const char* name, MultiClientIsolateTest* test)
+      : v8::base::Thread(base::Thread::Options(name)), test_(test) {}
 
   void Run() override {
     v8::Isolate* client = test_->NewClientIsolate();
@@ -2024,19 +2024,15 @@ class WorkerIsolateThread : public v8::base::Thread {
       Handle<String> shared_string = factory->NewStringFromAsciiChecked(
           "foobar", AllocationType::kSharedOld);
       CHECK(shared_string->InWritableSharedSpace());
-      v8::Local<v8::String> lh_shared_string =
-          Utils::Convert<String, v8::String>(shared_string);
+      v8::Local<v8::String> lh_shared_string = Utils::ToLocal(shared_string);
       gh_shared_string.Reset(test_->main_isolate(), lh_shared_string);
       gh_shared_string.SetWeak();
     }
 
     {
-      // Disable CSS for the shared heap and all clients.
-      // DisableConservativeStackScanningScopeForTesting no_stack_scanning(
-      //     i_client->shared_space_isolate()->heap());
-
-      Isolate* gc_isolate = i_client->shared_space_isolate();
-      gc_isolate->heap()->ForceSharedGCWithEmptyStackForTesting();
+      // We need to invoke GC without stack, otherwise some objects may survive.
+      DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+          i_client->heap());
       i_client->heap()->CollectGarbageShared(i_client->main_thread_local_heap(),
                                              GarbageCollectionReason::kTesting);
     }
@@ -2044,16 +2040,14 @@ class WorkerIsolateThread : public v8::base::Thread {
     CHECK(gh_shared_string.IsEmpty());
     client->Dispose();
 
-    *done_ = true;
-
     V8::GetCurrentPlatform()
         ->GetForegroundTaskRunner(test_->main_isolate())
-        ->PostTask(std::make_unique<WakeupTask>(test_->i_main_isolate()));
+        ->PostTask(std::make_unique<WakeupTask>(
+            test_->i_main_isolate(), test_->main_isolate_wakeup_counter()));
   }
 
  private:
   MultiClientIsolateTest* test_;
-  std::atomic<bool>* done_;
 };
 
 UNINITIALIZED_TEST(SharedStringInClientGlobalHandle) {
@@ -2062,11 +2056,10 @@ UNINITIALIZED_TEST(SharedStringInClientGlobalHandle) {
   v8_flags.shared_string_table = true;
 
   MultiClientIsolateTest test;
-  std::atomic<bool> done = false;
-  WorkerIsolateThread thread("worker", &test, &done);
+  WorkerIsolateThread thread("worker", &test);
   CHECK(thread.Start());
 
-  while (!done) {
+  while (test.main_isolate_wakeup_counter() < 1) {
     v8::platform::PumpMessageLoop(
         i::V8::GetCurrentPlatform(), test.main_isolate(),
         v8::platform::MessageLoopBehavior::kWaitForWork);
@@ -2079,22 +2072,21 @@ class ClientIsolateThreadForPagePromotions : public v8::base::Thread {
  public:
   ClientIsolateThreadForPagePromotions(const char* name,
                                        MultiClientIsolateTest* test,
-                                       std::atomic<bool>* done,
                                        Handle<String>* shared_string)
       : v8::base::Thread(base::Thread::Options(name)),
         test_(test),
-        done_(done),
         shared_string_(shared_string) {}
 
   void Run() override {
-    CHECK(v8_flags.minor_mc);
+    CHECK(v8_flags.minor_ms);
     v8::Isolate* client = test_->NewClientIsolate();
     Isolate* i_client = reinterpret_cast<Isolate*>(client);
     Factory* factory = i_client->factory();
     Heap* heap = i_client->heap();
 
     {
-      HandleScope scope(i_client);
+      v8::Isolate::Scope isolate_scope(client);
+      HandleScope handle_scope(i_client);
 
       Handle<FixedArray> young_object =
           factory->NewFixedArray(1, AllocationType::kYoung);
@@ -2111,7 +2103,7 @@ class ClientIsolateThreadForPagePromotions : public v8::base::Thread {
       CHECK(heap->SharedHeapContains(**shared_string_));
       young_object->set(0, **shared_string_);
 
-      CcTest::CollectGarbage(NEW_SPACE, i_client);
+      heap::EmptyNewSpaceUsingGC(heap);
       heap->CompleteSweepingFull();
 
       // Object should get promoted using page promotion, so address should
@@ -2129,30 +2121,29 @@ class ClientIsolateThreadForPagePromotions : public v8::base::Thread {
 
     client->Dispose();
 
-    *done_ = true;
-
     V8::GetCurrentPlatform()
         ->GetForegroundTaskRunner(test_->main_isolate())
-        ->PostTask(std::make_unique<WakeupTask>(test_->i_main_isolate()));
+        ->PostTask(std::make_unique<WakeupTask>(
+            test_->i_main_isolate(), test_->main_isolate_wakeup_counter()));
   }
 
  private:
   MultiClientIsolateTest* test_;
-  std::atomic<bool>* done_;
   Handle<String>* shared_string_;
 };
 
 UNINITIALIZED_TEST(RegisterOldToSharedForPromotedPageFromClient) {
   if (v8_flags.single_generation) return;
-  if (!v8_flags.minor_mc) return;
+  if (!v8_flags.minor_ms) return;
   if (!V8_CAN_CREATE_SHARED_HEAP_BOOL) return;
 
   v8_flags.stress_concurrent_allocation = false;  // For SealCurrentObjects.
   v8_flags.shared_string_table = true;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   MultiClientIsolateTest test;
-  std::atomic<bool> done = false;
 
   Isolate* i_isolate = test.i_main_isolate();
   Isolate* shared_isolate = i_isolate->shared_space_isolate();
@@ -2166,11 +2157,10 @@ UNINITIALIZED_TEST(RegisterOldToSharedForPromotedPageFromClient) {
           raw_one_byte, AllocationType::kSharedOld);
   CHECK(shared_heap->Contains(*shared_string));
 
-  ClientIsolateThreadForPagePromotions thread("worker", &test, &done,
-                                              &shared_string);
+  ClientIsolateThreadForPagePromotions thread("worker", &test, &shared_string);
   CHECK(thread.Start());
 
-  while (!done) {
+  while (test.main_isolate_wakeup_counter() < 1) {
     v8::platform::PumpMessageLoop(
         i::V8::GetCurrentPlatform(), test.main_isolate(),
         v8::platform::MessageLoopBehavior::kWaitForWork);
@@ -2182,18 +2172,19 @@ UNINITIALIZED_TEST(RegisterOldToSharedForPromotedPageFromClient) {
 UNINITIALIZED_TEST(
     RegisterOldToSharedForPromotedPageFromClientDuringIncrementalMarking) {
   if (v8_flags.single_generation) return;
-  if (!v8_flags.minor_mc) return;
+  if (!v8_flags.minor_ms) return;
   if (!V8_CAN_CREATE_SHARED_HEAP_BOOL) return;
 
   v8_flags.stress_concurrent_allocation = false;  // For SealCurrentObjects.
   v8_flags.shared_string_table = true;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
   v8_flags.incremental_marking_task =
       false;  // Prevent the incremental GC from finishing and finalizing in a
               // task.
 
   MultiClientIsolateTest test;
-  std::atomic<bool> done = false;
 
   Isolate* i_isolate = test.i_main_isolate();
   Isolate* shared_isolate = i_isolate->shared_space_isolate();
@@ -2209,7 +2200,6 @@ UNINITIALIZED_TEST(
 
   // Start an incremental shared GC such that shared_string resides on an
   // evacuation candidate.
-  ManualGCScope manual_gc_scope(shared_isolate);
   heap::ForceEvacuationCandidate(Page::FromHeapObject(*shared_string));
   i::IncrementalMarking* marking = shared_heap->incremental_marking();
   CHECK(marking->IsStopped());
@@ -2222,11 +2212,10 @@ UNINITIALIZED_TEST(
                    i::GarbageCollectionReason::kTesting);
   }
 
-  ClientIsolateThreadForPagePromotions thread("worker", &test, &done,
-                                              &shared_string);
+  ClientIsolateThreadForPagePromotions thread("worker", &test, &shared_string);
   CHECK(thread.Start());
 
-  while (!done) {
+  while (test.main_isolate_wakeup_counter() < 1) {
     v8::platform::PumpMessageLoop(
         i::V8::GetCurrentPlatform(), test.main_isolate(),
         v8::platform::MessageLoopBehavior::kWaitForWork);
@@ -2238,20 +2227,18 @@ UNINITIALIZED_TEST(
 class ClientIsolateThreadForRetainingByRememberedSet : public v8::base::Thread {
  public:
   ClientIsolateThreadForRetainingByRememberedSet(
-      const char* name, MultiClientIsolateTest* test, std::atomic<bool>* done,
+      const char* name, MultiClientIsolateTest* test,
       Persistent<v8::String>* weak_ref)
       : v8::base::Thread(base::Thread::Options(name)),
         test_(test),
-        done_(done),
         weak_ref_(weak_ref) {}
 
   void Run() override {
-    CHECK(v8_flags.minor_mc);
+    CHECK(v8_flags.minor_ms);
     client_isolate_ = test_->NewClientIsolate();
     Isolate* i_client = reinterpret_cast<Isolate*>(client_isolate_);
     Factory* factory = i_client->factory();
     Heap* heap = i_client->heap();
-    ManualGCScope manual_gc_scope(i_client);
 
     {
       HandleScope scope(i_client);
@@ -2275,7 +2262,7 @@ class ClientIsolateThreadForRetainingByRememberedSet : public v8::base::Thread {
       CHECK(heap->SharedHeapContains(*shared_string));
       young_object->set(0, *shared_string);
 
-      CcTest::CollectGarbage(NEW_SPACE, i_client);
+      heap::EmptyNewSpaceUsingGC(heap);
 
       // Object should get promoted using page promotion, so address should
       // remain the same.
@@ -2287,13 +2274,13 @@ class ClientIsolateThreadForRetainingByRememberedSet : public v8::base::Thread {
       CHECK_IMPLIES(!v8_flags.verify_heap, heap->sweeping_in_progress());
 
       // Inform main thread that the client is set up and is doing a GC.
-      *done_ = true;
       V8::GetCurrentPlatform()
           ->GetForegroundTaskRunner(test_->main_isolate())
-          ->PostTask(std::make_unique<WakeupTask>(test_->i_main_isolate()));
+          ->PostTask(std::make_unique<WakeupTask>(
+              test_->i_main_isolate(), test_->main_isolate_wakeup_counter()));
 
       // Wait for main thread to do a shared GC.
-      while (*done_) {
+      while (wakeup_counter_ < 1) {
         v8::platform::PumpMessageLoop(
             i::V8::GetCurrentPlatform(), isolate(),
             v8::platform::MessageLoopBehavior::kWaitForWork);
@@ -2309,10 +2296,10 @@ class ClientIsolateThreadForRetainingByRememberedSet : public v8::base::Thread {
     client_isolate_->Dispose();
 
     // Inform main thread that client is finished.
-    *done_ = true;
     V8::GetCurrentPlatform()
         ->GetForegroundTaskRunner(test_->main_isolate())
-        ->PostTask(std::make_unique<WakeupTask>(test_->i_main_isolate()));
+        ->PostTask(std::make_unique<WakeupTask>(
+            test_->i_main_isolate(), test_->main_isolate_wakeup_counter()));
   }
 
   v8::Isolate* isolate() const {
@@ -2320,30 +2307,34 @@ class ClientIsolateThreadForRetainingByRememberedSet : public v8::base::Thread {
     return client_isolate_;
   }
 
+  int& wakeup_counter() { return wakeup_counter_; }
+
  private:
   MultiClientIsolateTest* test_;
-  std::atomic<bool>* done_;
   Persistent<v8::String>* weak_ref_;
   v8::Isolate* client_isolate_;
+  int wakeup_counter_ = 0;
 };
 
 UNINITIALIZED_TEST(SharedObjectRetainedByClientRememberedSet) {
   if (v8_flags.single_generation) return;
-  if (!v8_flags.minor_mc) return;
+  if (!v8_flags.minor_ms) return;
   if (!V8_CAN_CREATE_SHARED_HEAP_BOOL) return;
 
   v8_flags.stress_concurrent_allocation = false;  // For SealCurrentObjects.
   v8_flags.shared_string_table = true;
-  v8_flags.manual_evacuation_candidates_selection = true;
+  ManualGCScope manual_gc_scope;
+  heap::ManualEvacuationCandidatesSelectionScope
+      manual_evacuation_candidate_selection_scope(manual_gc_scope);
 
   MultiClientIsolateTest test;
-  std::atomic<bool> done = false;
 
   v8::Isolate* isolate = test.main_isolate();
   Isolate* i_isolate = test.i_main_isolate();
   Isolate* shared_isolate = i_isolate->shared_space_isolate();
   Heap* shared_heap = shared_isolate->heap();
 
+  // We need to invoke GC without stack, otherwise some objects may survive.
   DisableConservativeStackScanningScopeForTesting no_stack_scanning(
       shared_heap);
 
@@ -2370,12 +2361,12 @@ UNINITIALIZED_TEST(SharedObjectRetainedByClientRememberedSet) {
     dead_weak_ref.SetWeak();
   }
 
-  ClientIsolateThreadForRetainingByRememberedSet thread("worker", &test, &done,
+  ClientIsolateThreadForRetainingByRememberedSet thread("worker", &test,
                                                         &live_weak_ref);
   CHECK(thread.Start());
 
   // Wait for client isolate to allocate objects and start a GC.
-  while (!done) {
+  while (test.main_isolate_wakeup_counter() < 1) {
     v8::platform::PumpMessageLoop(
         i::V8::GetCurrentPlatform(), test.main_isolate(),
         v8::platform::MessageLoopBehavior::kWaitForWork);
@@ -2385,18 +2376,18 @@ UNINITIALIZED_TEST(SharedObjectRetainedByClientRememberedSet) {
   // slot in the client isolate.
   CHECK(!live_weak_ref.IsEmpty());
   CHECK(!dead_weak_ref.IsEmpty());
-  CcTest::CollectSharedGarbage(i_isolate);
+  heap::CollectSharedGarbage(i_isolate->heap());
   CHECK(!live_weak_ref.IsEmpty());
   CHECK(dead_weak_ref.IsEmpty());
 
   // Inform client that shared GC is finished.
-  done = false;
+  auto thread_wakeup_task = std::make_unique<WakeupTask>(
+      reinterpret_cast<Isolate*>(thread.isolate()), thread.wakeup_counter());
   V8::GetCurrentPlatform()
       ->GetForegroundTaskRunner(thread.isolate())
-      ->PostTask(std::make_unique<WakeupTask>(
-          reinterpret_cast<Isolate*>(thread.isolate())));
+      ->PostTask(std::move(thread_wakeup_task));
 
-  while (!done) {
+  while (test.main_isolate_wakeup_counter() < 2) {
     v8::platform::PumpMessageLoop(
         i::V8::GetCurrentPlatform(), test.main_isolate(),
         v8::platform::MessageLoopBehavior::kWaitForWork);
@@ -2408,11 +2399,8 @@ UNINITIALIZED_TEST(SharedObjectRetainedByClientRememberedSet) {
 class Regress1424955ClientIsolateThread : public v8::base::Thread {
  public:
   Regress1424955ClientIsolateThread(const char* name,
-                                    MultiClientIsolateTest* test,
-                                    std::atomic<bool>* done)
-      : v8::base::Thread(base::Thread::Options(name)),
-        test_(test),
-        done_(done) {}
+                                    MultiClientIsolateTest* test)
+      : v8::base::Thread(base::Thread::Options(name)), test_(test) {}
 
   void Run() override {
     client_isolate_ = test_->NewClientIsolate();
@@ -2430,15 +2418,14 @@ class Regress1424955ClientIsolateThread : public v8::base::Thread {
       USE(array);
 
       // Start sweeping.
-      i_client_heap->CollectGarbage(OLD_SPACE,
-                                    GarbageCollectionReason::kTesting);
+      heap::InvokeMajorGC(i_client_heap);
       CHECK(i_client_heap->sweeping_in_progress());
 
       // Inform the initiator thread it's time to request a global safepoint.
-      *done_ = true;
       V8::GetCurrentPlatform()
           ->GetForegroundTaskRunner(test_->main_isolate())
-          ->PostTask(std::make_unique<WakeupTask>(test_->i_main_isolate()));
+          ->PostTask(std::make_unique<WakeupTask>(
+              test_->i_main_isolate(), test_->main_isolate_wakeup_counter()));
 
       // Wait for the initiator thread to request a global safepoint.
       while (!i_client->shared_space_isolate()
@@ -2450,12 +2437,11 @@ class Regress1424955ClientIsolateThread : public v8::base::Thread {
       // Start a minor GC. This will cause this client isolate to join the
       // global safepoint. At which point, the initiator isolate will try to
       // finalize sweeping on behalf of this client isolate.
-      i_client_heap->CollectGarbage(NEW_SPACE,
-                                    GarbageCollectionReason::kTesting);
+      heap::InvokeMinorGC(i_client_heap);
     }
 
     // Wait for the initiator isolate to finish the shared GC.
-    while (*done_) {
+    while (wakeup_counter_ < 1) {
       v8::platform::PumpMessageLoop(
           i::V8::GetCurrentPlatform(), client_isolate_,
           v8::platform::MessageLoopBehavior::kWaitForWork);
@@ -2463,10 +2449,10 @@ class Regress1424955ClientIsolateThread : public v8::base::Thread {
 
     client_isolate_->Dispose();
 
-    *done_ = true;
     V8::GetCurrentPlatform()
         ->GetForegroundTaskRunner(test_->main_isolate())
-        ->PostTask(std::make_unique<WakeupTask>(test_->i_main_isolate()));
+        ->PostTask(std::make_unique<WakeupTask>(
+            test_->i_main_isolate(), test_->main_isolate_wakeup_counter()));
   }
 
   v8::Isolate* isolate() const {
@@ -2474,10 +2460,12 @@ class Regress1424955ClientIsolateThread : public v8::base::Thread {
     return client_isolate_;
   }
 
+  int& wakeup_counter() { return wakeup_counter_; }
+
  private:
   MultiClientIsolateTest* test_;
-  std::atomic<bool>* done_;
   v8::Isolate* client_isolate_;
+  int wakeup_counter_ = 0;
 };
 
 UNINITIALIZED_TEST(Regress1424955) {
@@ -2489,15 +2477,14 @@ UNINITIALIZED_TEST(Regress1424955) {
   if (v8_flags.verify_heap) return;
   v8_flags.shared_string_table = true;
 
-  ManualGCScope maunal_gc_scope;
+  ManualGCScope manual_gc_scope;
 
   MultiClientIsolateTest test;
-  std::atomic<bool> done = false;
-  Regress1424955ClientIsolateThread thread("worker", &test, &done);
+  Regress1424955ClientIsolateThread thread("worker", &test);
   CHECK(thread.Start());
 
   // Wait for client thread to start sweeping.
-  while (!done) {
+  while (test.main_isolate_wakeup_counter() < 1) {
     v8::platform::PumpMessageLoop(
         i::V8::GetCurrentPlatform(), test.main_isolate(),
         v8::platform::MessageLoopBehavior::kWaitForWork);
@@ -2505,15 +2492,88 @@ UNINITIALIZED_TEST(Regress1424955) {
 
   // Client isolate waits for this isolate to request a global safepoint and
   // then triggers a minor GC.
-  CcTest::CollectSharedGarbage(test.i_main_isolate());
-  done = false;
+  heap::CollectSharedGarbage(test.i_main_isolate()->heap());
   V8::GetCurrentPlatform()
       ->GetForegroundTaskRunner(thread.isolate())
       ->PostTask(std::make_unique<WakeupTask>(
-          reinterpret_cast<Isolate*>(thread.isolate())));
+          reinterpret_cast<Isolate*>(thread.isolate()),
+          thread.wakeup_counter()));
+
+  // Wait for client isolate to finish the minor GC and dispose of its isolate.
+  while (test.main_isolate_wakeup_counter() < 2) {
+    v8::platform::PumpMessageLoop(
+        i::V8::GetCurrentPlatform(), test.main_isolate(),
+        v8::platform::MessageLoopBehavior::kWaitForWork);
+  }
+
+  thread.Join();
+}
+
+class ProtectExternalStringTableAddStringClientIsolateThread
+    : public v8::base::Thread {
+ public:
+  ProtectExternalStringTableAddStringClientIsolateThread(
+      const char* name, MultiClientIsolateTest* test, v8::Isolate* isolate)
+      : v8::base::Thread(base::Thread::Options(name)),
+        test_(test),
+        isolate_(isolate),
+        i_isolate_(reinterpret_cast<Isolate*>(isolate)) {}
+
+  void Run() override {
+    const char* text = "worker_external_string";
+
+    {
+      v8::Isolate::Scope isolate_scope(isolate_);
+
+      for (int i = 0; i < 1'000; i++) {
+        HandleScope scope(i_isolate_);
+        Handle<String> string =
+            i_isolate_->factory()->NewStringFromAsciiChecked(
+                text, AllocationType::kOld);
+        CHECK(string->InWritableSharedSpace());
+        CHECK(!string->IsShared());
+        CHECK(string->MakeExternal(new StaticOneByteResource(text)));
+        CHECK(IsExternalOneByteString(*string));
+      }
+    }
+
+    isolate_->Dispose();
+
+    V8::GetCurrentPlatform()
+        ->GetForegroundTaskRunner(test_->main_isolate())
+        ->PostTask(std::make_unique<WakeupTask>(
+            test_->i_main_isolate(), test_->main_isolate_wakeup_counter()));
+  }
+
+ private:
+  MultiClientIsolateTest* test_;
+  v8::Isolate* isolate_;
+  Isolate* i_isolate_;
+};
+
+UNINITIALIZED_TEST(ProtectExternalStringTableAddString) {
+  if (!V8_CAN_CREATE_SHARED_HEAP_BOOL) return;
+  v8_flags.shared_string_table = true;
+
+  ManualGCScope manual_gc_scope;
+
+  MultiClientIsolateTest test;
+  v8::Isolate* client = test.NewClientIsolate();
+  ProtectExternalStringTableAddStringClientIsolateThread thread("worker", &test,
+                                                                client);
+  CHECK(thread.Start());
+  Isolate* isolate = test.i_main_isolate();
+  HandleScope scope(isolate);
+
+  for (int i = 0; i < 1'000; i++) {
+    isolate->factory()
+        ->NewExternalStringFromOneByte(
+            new StaticOneByteResource("main_external_string"))
+        .Check();
+  }
 
   // Wait for client isolate to finish the minor GC and dispose of its isolate.
-  while (!done) {
+  while (test.main_isolate_wakeup_counter() < 1) {
     v8::platform::PumpMessageLoop(
         i::V8::GetCurrentPlatform(), test.main_isolate(),
         v8::platform::MessageLoopBehavior::kWaitForWork);
diff --git a/deps/v8/test/cctest/test-simple-riscv32.cc b/deps/v8/test/cctest/test-simple-riscv32.cc
index be8919f0c738a2..dccd7ff857ac4e 100644
--- a/deps/v8/test/cctest/test-simple-riscv32.cc
+++ b/deps/v8/test/cctest/test-simple-riscv32.cc
@@ -116,7 +116,7 @@ TEST(RISCV_SIMPLE2) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef DEBUG
-  code->Print();
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   int32_t res = reinterpret_cast<int32_t>(f.Call(100, 0, 0, 0, 0));
diff --git a/deps/v8/test/cctest/test-simple-riscv64.cc b/deps/v8/test/cctest/test-simple-riscv64.cc
index 3cb1dddcec475a..5bacfb5be8a4c5 100644
--- a/deps/v8/test/cctest/test-simple-riscv64.cc
+++ b/deps/v8/test/cctest/test-simple-riscv64.cc
@@ -115,8 +115,8 @@ TEST(RISCV_SIMPLE2) {
   assm.GetCode(isolate, &desc);
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
-#ifdef DEBUG
-  code->Print();
+#ifdef OBJECT_PRINT
+  Print(*code);
 #endif
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
   int64_t res = reinterpret_cast<int64_t>(f.Call(100, 0, 0, 0, 0));
diff --git a/deps/v8/test/cctest/test-smi-lexicographic-compare.cc b/deps/v8/test/cctest/test-smi-lexicographic-compare.cc
index 929ed91ebdddf0..973a9155f80586 100644
--- a/deps/v8/test/cctest/test-smi-lexicographic-compare.cc
+++ b/deps/v8/test/cctest/test-smi-lexicographic-compare.cc
@@ -21,7 +21,7 @@ void AddSigned(std::set<Smi>* smis, int64_t x) {
 }
 
 // Uses std::lexicographical_compare twice to convert the result to -1, 0 or 1.
-int ExpectedCompareResult(Smi a, Smi b) {
+int ExpectedCompareResult(Tagged<Smi> a, Tagged<Smi> b) {
   std::string str_a = std::to_string(a.value());
   std::string str_b = std::to_string(b.value());
   bool expected_a_lt_b = std::lexicographical_compare(
@@ -39,7 +39,7 @@ int ExpectedCompareResult(Smi a, Smi b) {
   }
 }
 
-bool Test(Isolate* isolate, Smi a, Smi b) {
+bool Test(Isolate* isolate, Tagged<Smi> a, Tagged<Smi> b) {
   int actual = Smi(Smi::LexicographicCompare(isolate, a, b)).value();
   int expected = ExpectedCompareResult(a, b);
 
@@ -68,8 +68,8 @@ TEST(TestSmiLexicographicCompare) {
     }
   }
 
-  for (Smi a : smis) {
-    for (Smi b : smis) {
+  for (Tagged<Smi> a : smis) {
+    for (Tagged<Smi> b : smis) {
       CHECK(Test(isolate, a, b));
     }
   }
diff --git a/deps/v8/test/cctest/test-stack-unwinding-win64.cc b/deps/v8/test/cctest/test-stack-unwinding-win64.cc
index 61c9dc1bf11c22..a88d84f2823065 100644
--- a/deps/v8/test/cctest/test-stack-unwinding-win64.cc
+++ b/deps/v8/test/cctest/test-stack-unwinding-win64.cc
@@ -2,6 +2,11 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include <windows.h>
+
+// This has to come after windows.h.
+#include <versionhelpers.h>  // For IsWindows8OrGreater().
+
 #include "include/v8-external.h"
 #include "include/v8-function.h"
 #include "include/v8-isolate.h"
@@ -10,16 +15,15 @@
 #include "src/base/macros.h"
 #include "test/cctest/cctest.h"
 
-#if defined(V8_OS_WIN_X64)
+#if defined(V8_OS_WIN_X64)  // Native x64 compilation
 #define CONTEXT_PC(context) (context.Rip)
 #elif defined(V8_OS_WIN_ARM64)
+#if defined(V8_HOST_ARCH_ARM64)  // Native ARM64 compilation
 #define CONTEXT_PC(context) (context.Pc)
+#else  // x64 to ARM64 cross-compilation
+#define CONTEXT_PC(context) (context.Rip)
+#endif
 #endif
-
-#include <windows.h>
-
-// This has to come after windows.h.
-#include <versionhelpers.h>  // For IsWindows8OrGreater().
 
 class UnwindingWin64Callbacks {
  public:
diff --git a/deps/v8/test/cctest/test-strings.cc b/deps/v8/test/cctest/test-strings.cc
index f070118bd8040e..c9db5aa25f5c3c 100644
--- a/deps/v8/test/cctest/test-strings.cc
+++ b/deps/v8/test/cctest/test-strings.cc
@@ -33,6 +33,7 @@
 #include <stdlib.h>
 
 #include "include/v8-json.h"
+#include "include/v8-template.h"
 #include "src/api/api-inl.h"
 #include "src/base/platform/elapsed-timer.h"
 #include "src/base/strings.h"
@@ -306,24 +307,24 @@ void ConsStringGenerationData::Reset() {
   rng_.init();
 }
 
-void AccumulateStats(ConsString cons_string, ConsStringStats* stats) {
-  int left_length = cons_string.first().length();
-  int right_length = cons_string.second().length();
-  CHECK(cons_string.length() == left_length + right_length);
+void AccumulateStats(Tagged<ConsString> cons_string, ConsStringStats* stats) {
+  int left_length = cons_string->first()->length();
+  int right_length = cons_string->second()->length();
+  CHECK(cons_string->length() == left_length + right_length);
   // Check left side.
-  bool left_is_cons = cons_string.first().IsConsString();
+  bool left_is_cons = IsConsString(cons_string->first());
   if (left_is_cons) {
     stats->left_traversals_++;
-    AccumulateStats(ConsString::cast(cons_string.first()), stats);
+    AccumulateStats(ConsString::cast(cons_string->first()), stats);
   } else {
     CHECK_NE(left_length, 0);
     stats->leaves_++;
     stats->chars_ += left_length;
   }
   // Check right side.
-  if (cons_string.second().IsConsString()) {
+  if (IsConsString(cons_string->second())) {
     stats->right_traversals_++;
-    AccumulateStats(ConsString::cast(cons_string.second()), stats);
+    AccumulateStats(ConsString::cast(cons_string->second()), stats);
   } else {
     if (right_length == 0) {
       stats->empty_leaves_++;
@@ -336,29 +337,29 @@ void AccumulateStats(ConsString cons_string, ConsStringStats* stats) {
 
 void AccumulateStats(Handle<String> cons_string, ConsStringStats* stats) {
   DisallowGarbageCollection no_gc;
-  if (cons_string->IsConsString()) {
+  if (IsConsString(*cons_string)) {
     return AccumulateStats(ConsString::cast(*cons_string), stats);
   }
   // This string got flattened by gc.
   stats->chars_ += cons_string->length();
 }
 
-void AccumulateStatsWithOperator(ConsString cons_string,
+void AccumulateStatsWithOperator(Tagged<ConsString> cons_string,
                                  ConsStringStats* stats) {
   ConsStringIterator iter(cons_string);
   int offset;
-  for (String string = iter.Next(&offset); !string.is_null();
+  for (Tagged<String> string = iter.Next(&offset); !string.is_null();
        string = iter.Next(&offset)) {
     // Accumulate stats.
     CHECK_EQ(0, offset);
     stats->leaves_++;
-    stats->chars_ += string.length();
+    stats->chars_ += string->length();
   }
 }
 
 void VerifyConsString(Handle<String> root, ConsStringGenerationData* data) {
   // Verify basic data.
-  CHECK(root->IsConsString());
+  CHECK(IsConsString(*root));
   CHECK_EQ(root->length(), data->stats_.chars_);
   // Recursive verify.
   ConsStringStats stats;
@@ -427,12 +428,12 @@ static Handle<String> ConstructRandomString(ConsStringGenerationData* data,
   }
   // Build the cons string.
   Handle<String> root = factory->NewConsString(left, right).ToHandleChecked();
-  CHECK(root->IsConsString() && !root->IsFlat());
+  CHECK(IsConsString(*root) && !root->IsFlat());
   // Special work needed for flat string.
   if (flat) {
     data->stats_.empty_leaves_++;
     String::Flatten(isolate, root);
-    CHECK(root->IsConsString() && root->IsFlat());
+    CHECK(IsConsString(*root) && root->IsFlat());
   }
   return root;
 }
@@ -445,7 +446,7 @@ static Handle<String> ConstructLeft(ConsStringGenerationData* data, int depth) {
     Handle<String> block = data->block(i);
     Handle<String> next =
         factory->NewConsString(answer, block).ToHandleChecked();
-    if (next->IsConsString()) data->stats_.leaves_++;
+    if (IsConsString(*next)) data->stats_.leaves_++;
     data->stats_.chars_ += block->length();
     answer = next;
   }
@@ -462,7 +463,7 @@ static Handle<String> ConstructRight(ConsStringGenerationData* data,
     Handle<String> block = data->block(i);
     Handle<String> next =
         factory->NewConsString(block, answer).ToHandleChecked();
-    if (next->IsConsString()) data->stats_.leaves_++;
+    if (IsConsString(*next)) data->stats_.leaves_++;
     data->stats_.chars_ += block->length();
     answer = next;
   }
@@ -488,8 +489,8 @@ static Handle<String> ConstructBalancedHelper(ConsStringGenerationData* data,
       ConstructBalancedHelper(data, from, from + ((to - from) / 2));
   Handle<String> part2 =
       ConstructBalancedHelper(data, from + ((to - from) / 2), to);
-  if (part1->IsConsString()) data->stats_.left_traversals_++;
-  if (part2->IsConsString()) data->stats_.right_traversals_++;
+  if (IsConsString(*part1)) data->stats_.left_traversals_++;
+  if (IsConsString(*part2)) data->stats_.right_traversals_++;
   return factory->NewConsString(part1, part2).ToHandleChecked();
 }
 
@@ -586,7 +587,7 @@ TEST(ConsStringWithEmptyFirstFlatten) {
   i::Handle<i::String> str = isolate->factory()
                                  ->NewConsString(initial_fst, initial_snd)
                                  .ToHandleChecked();
-  CHECK(str->IsConsString());
+  CHECK(IsConsString(*str));
   auto cons = i::Handle<i::ConsString>::cast(str);
 
   const int initial_length = cons->length();
@@ -610,12 +611,13 @@ TEST(ConsStringWithEmptyFirstFlatten) {
   CHECK_EQ(initial_length, flat->length());
 }
 
-static void VerifyCharacterStream(String flat_string, String cons_string) {
+static void VerifyCharacterStream(Tagged<String> flat_string,
+                                  Tagged<String> cons_string) {
   // Do not want to test ConString traversal on flat string.
-  CHECK(flat_string.IsFlat() && !flat_string.IsConsString());
-  CHECK(cons_string.IsConsString());
+  CHECK(flat_string->IsFlat() && !IsConsString(flat_string));
+  CHECK(IsConsString(cons_string));
   // TODO(dcarney) Test stream reset as well.
-  int length = flat_string.length();
+  int length = flat_string->length();
   // Iterate start search in multiple places in the string.
   int outer_iterations = length > 20 ? 20 : length;
   for (int j = 0; j <= outer_iterations; j++) {
@@ -626,7 +628,7 @@ static void VerifyCharacterStream(String flat_string, String cons_string) {
     StringCharacterStream flat_stream(flat_string, offset);
     StringCharacterStream cons_stream(cons_string, offset);
     for (int i = offset; i < length; i++) {
-      uint16_t c = flat_string.Get(i);
+      uint16_t c = flat_string->Get(i);
       CHECK(flat_stream.HasMore());
       CHECK(cons_stream.HasMore());
       CHECK_EQ(c, flat_stream.GetNext());
@@ -674,9 +676,12 @@ void TestStringCharacterStream(BuildString build, int test_cases) {
     cons_string_stats.VerifyEqual(flat_string_stats);
     cons_string_stats.VerifyEqual(data.stats_);
     VerifyConsString(cons_string, &data);
-    String flat_string_ptr = flat_string->IsConsString()
-                                 ? ConsString::cast(*flat_string).first()
-                                 : *flat_string;
+    // TODO(leszeks): Remove Tagged cast when .first() returns a Tagged.
+    static_assert(kTaggedCanConvertToRawObjects);
+    Tagged<String> flat_string_ptr =
+        IsConsString(*flat_string)
+            ? Tagged(Tagged<ConsString>::cast(*flat_string)->first())
+            : *flat_string;
     VerifyCharacterStream(flat_string_ptr, *cons_string);
   }
 }
@@ -1153,42 +1158,6 @@ TEST(ReplaceInvalidUtf8) {
   CHECK_EQ(0, memcmp("\x61\x62\xef\xbf\xbd\x63", buffer, 6));
 }
 
-TEST(JSONStringifySliceMadeExternal) {
-  if (!v8_flags.string_slices) return;
-  CcTest::InitializeVM();
-  // Create a sliced string from a one-byte string.  The latter is turned
-  // into a two-byte external string.  Check that JSON.stringify works.
-  v8::HandleScope handle_scope(CcTest::isolate());
-  v8::Local<v8::String> underlying =
-      CompileRun(
-          "var underlying = 'abcdefghijklmnopqrstuvwxyz';"
-          "underlying")
-          ->ToString(CcTest::isolate()->GetCurrentContext())
-          .ToLocalChecked();
-  v8::Local<v8::String> slice =
-      CompileRun(
-          "var slice = '';"
-          "slice = underlying.slice(1);"
-          "slice")
-          ->ToString(CcTest::isolate()->GetCurrentContext())
-          .ToLocalChecked();
-  CHECK(v8::Utils::OpenHandle(*slice)->IsSlicedString());
-  CHECK(v8::Utils::OpenHandle(*underlying)->IsSeqOneByteString());
-
-  int length = underlying->Length();
-  base::uc16* two_byte = NewArray<base::uc16>(length + 1);
-  underlying->Write(CcTest::isolate(), two_byte);
-  Resource* resource = new Resource(two_byte, length);
-  CHECK(underlying->MakeExternal(resource));
-  CHECK(v8::Utils::OpenHandle(*slice)->IsSlicedString());
-  CHECK(v8::Utils::OpenHandle(*underlying)->IsExternalTwoByteString());
-
-  CHECK_EQ(0,
-           strcmp("\"bcdefghijklmnopqrstuvwxyz\"",
-                  *v8::String::Utf8Value(CcTest::isolate(),
-                                         CompileRun("JSON.stringify(slice)"))));
-}
-
 TEST(JSONStringifyWellFormed) {
   CcTest::InitializeVM();
   v8::HandleScope handle_scope(CcTest::isolate());
@@ -1318,12 +1287,12 @@ TEST(CachedHashOverflow) {
             .ToLocalChecked()
             ->Run(context)
             .ToLocalChecked();
-    CHECK_EQ(results[i]->IsUndefined(CcTest::i_isolate()),
+    CHECK_EQ(IsUndefined(*results[i], CcTest::i_isolate()),
              result->IsUndefined());
-    CHECK_EQ(results[i]->IsNumber(), result->IsNumber());
+    CHECK_EQ(IsNumber(*results[i]), result->IsNumber());
     if (result->IsNumber()) {
       int32_t value = 0;
-      CHECK(results[i]->ToInt32(&value));
+      CHECK(Object::ToInt32(*results[i], &value));
       CHECK_EQ(value, result->ToInt32(context).ToLocalChecked()->Value());
     }
   }
@@ -1338,17 +1307,19 @@ TEST(SliceFromCons) {
       factory->NewStringFromStaticChars("parentparentparent");
   Handle<String> parent =
       factory->NewConsString(string, string).ToHandleChecked();
-  CHECK(parent->IsConsString());
+  CHECK(IsConsString(*parent));
   CHECK(!parent->IsFlat());
   Handle<String> slice = factory->NewSubString(parent, 1, 25);
   // After slicing, the original string becomes a flat cons.
   CHECK(parent->IsFlat());
-  CHECK(slice->IsSlicedString());
-  CHECK_EQ(
-      SlicedString::cast(*slice).parent(),
-      // Parent could have been short-circuited.
-      parent->IsConsString() ? ConsString::cast(*parent).first() : *parent);
-  CHECK(SlicedString::cast(*slice).parent().IsSeqString());
+  CHECK(IsSlicedString(*slice));
+  // TODO(leszeks): Remove Tagged cast when .first() returns a Tagged.
+  static_assert(kTaggedCanConvertToRawObjects);
+  CHECK_EQ(SlicedString::cast(*slice)->parent(),
+           // Parent could have been short-circuited.
+           IsConsString(*parent) ? Tagged(ConsString::cast(*parent)->first())
+                                 : *parent);
+  CHECK(IsSeqString(SlicedString::cast(*slice)->parent()));
   CHECK(slice->IsFlat());
 }
 
@@ -1378,19 +1349,19 @@ TEST(InternalizeExternal) {
         v8::String::NewExternalOneByte(CcTest::isolate(), resource)
             .ToLocalChecked();
     Handle<String> string = v8::Utils::OpenHandle(*ext_string);
-    CHECK(string->IsExternalString());
-    CHECK(!string->IsInternalizedString());
+    CHECK(IsExternalString(*string));
+    CHECK(!IsInternalizedString(*string));
     CHECK(!i::Heap::InYoungGeneration(*string));
     CHECK_EQ(isolate->string_table()->TryStringToIndexOrLookupExisting(
                  isolate, string->ptr()),
              Smi::FromInt(ResultSentinel::kNotFound).ptr());
     factory->InternalizeName(string);
-    CHECK(string->IsExternalString());
-    CHECK(string->IsInternalizedString());
+    CHECK(IsExternalString(*string));
+    CHECK(IsInternalizedString(*string));
     CHECK(!i::Heap::InYoungGeneration(*string));
   }
-  CcTest::CollectGarbage(i::OLD_SPACE);
-  CcTest::CollectGarbage(i::OLD_SPACE);
+  i::heap::InvokeMajorGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
 TEST(Regress1402187) {
@@ -1407,20 +1378,21 @@ TEST(Regress1402187) {
   {
     v8::HandleScope scope(CcTest::isolate());
     // Internalize a string with the same hash to ensure collision.
-    Handle<String> intern = isolate->factory()->NewStringFromAsciiChecked(
+    Handle<String> intern = factory->NewStringFromAsciiChecked(
         "internalized1234567", AllocationType::kOld);
     intern->set_raw_hash_field(fake_hash);
     factory->InternalizeName(intern);
-    CHECK(intern->IsInternalizedString());
+    CHECK(IsInternalizedString(*intern));
 
     v8::Local<v8::String> ext_string =
-        v8::String::NewFromUtf8Literal(CcTest::isolate(), ext_string_content);
-    ext_string->MakeExternal(resource);
+        Utils::ToLocal(factory->NewStringFromAsciiChecked(
+            ext_string_content, AllocationType::kOld));
+    CHECK(ext_string->MakeExternal(resource));
     Handle<String> string = v8::Utils::OpenHandle(*ext_string);
     string->set_raw_hash_field(fake_hash);
-    CHECK(string->IsExternalString());
+    CHECK(IsExternalString(*string));
     CHECK(!StringShape(*string).IsUncachedExternal());
-    CHECK(!string->IsInternalizedString());
+    CHECK(!IsInternalizedString(*string));
     CHECK(!String::Equals(isolate, string, intern));
     CHECK_EQ(string->hash(), intern->hash());
     CHECK_EQ(string->length(), intern->length());
@@ -1429,11 +1401,11 @@ TEST(Regress1402187) {
                  isolate, string->ptr()),
              Smi::FromInt(ResultSentinel::kNotFound).ptr());
     string = factory->InternalizeString(string);
-    CHECK(string->IsExternalString());
-    CHECK(string->IsInternalizedString());
+    CHECK(IsExternalString(*string));
+    CHECK(IsInternalizedString(*string));
   }
-  CcTest::CollectGarbage(i::OLD_SPACE);
-  CcTest::CollectGarbage(i::OLD_SPACE);
+  i::heap::InvokeMajorGC(CcTest::heap());
+  i::heap::InvokeMajorGC(CcTest::heap());
 }
 
 TEST(SliceFromExternal) {
@@ -1445,18 +1417,56 @@ TEST(SliceFromExternal) {
       v8::base::Vector<const char>("abcdefghijklmnopqrstuvwxyz", 26));
   Handle<String> string =
       factory->NewExternalStringFromOneByte(&resource).ToHandleChecked();
-  CHECK(string->IsExternalString());
+  CHECK(IsExternalString(*string));
   Handle<String> slice = factory->NewSubString(string, 1, 25);
-  CHECK(slice->IsSlicedString());
-  CHECK(string->IsExternalString());
-  CHECK_EQ(SlicedString::cast(*slice).parent(), *string);
-  CHECK(SlicedString::cast(*slice).parent().IsExternalString());
+  CHECK(IsSlicedString(*slice));
+  CHECK(IsExternalString(*string));
+  CHECK_EQ(SlicedString::cast(*slice)->parent(), *string);
+  CHECK(IsExternalString(SlicedString::cast(*slice)->parent()));
   CHECK(slice->IsFlat());
   // This avoids the GC from trying to free stack allocated resources.
   i::Handle<i::ExternalOneByteString>::cast(string)->SetResource(
       CcTest::i_isolate(), nullptr);
 }
 
+static void ExternalizeDuringJsonStringifyCallback(
+    const v8::FunctionCallbackInfo<v8::Value>& args) {
+  v8::Local<v8::Value> key = v8_compile("p")
+                                 ->Run(CcTest::isolate()->GetCurrentContext())
+                                 .ToLocalChecked();
+  const static char ext_string_content[] = "prop-1234567890asdf";
+  OneByteVectorResource* resource =
+      new OneByteVectorResource(v8::base::Vector<const char>(
+          ext_string_content, strlen(ext_string_content)));
+  CHECK(v8::String::Cast(*key)->MakeExternal(resource));
+}
+
+TEST(ExternalizeDuringJsonStringify) {
+  CcTest::InitializeVM();
+  v8::Isolate* isolate = CcTest::isolate();
+  v8::HandleScope scope(isolate);
+  const char script[] = R"(
+    var p = "prop-1234567890asdf";
+    JSON.stringify([
+      { [p]: 3 },
+      { toJSON: callExternal },
+      { [p]: 4 },
+    ]);
+  )";
+  v8::Local<v8::ObjectTemplate> global = ObjectTemplate::New(isolate);
+  global->Set(isolate, "callExternal",
+              v8::FunctionTemplate::New(
+                  isolate, ExternalizeDuringJsonStringifyCallback));
+  LocalContext context(nullptr, global);
+  v8::Local<v8::Value> stringified =
+      v8_compile(script)->Run(context.local()).ToLocalChecked();
+  CHECK(v8::String::NewFromUtf8Literal(
+            isolate,
+            R"([{"prop-1234567890asdf":3},null,{"prop-1234567890asdf":4}])")
+            ->Equals(context.local(), stringified)
+            .FromJust());
+}
+
 TEST(TrivialSlice) {
   // This tests whether a slice that contains the entire parent string
   // actually creates a new string (it should not).
@@ -1475,14 +1485,14 @@ TEST(TrivialSlice) {
   result = CompileRun(check);
   CHECK(result->IsString());
   string = v8::Utils::OpenHandle(v8::String::Cast(*result));
-  CHECK(!string->IsSlicedString());
+  CHECK(!IsSlicedString(*string));
 
   string = factory->NewSubString(string, 0, 26);
-  CHECK(!string->IsSlicedString());
+  CHECK(!IsSlicedString(*string));
   result = CompileRun(crosscheck);
   CHECK(result->IsString());
   string = v8::Utils::OpenHandle(v8::String::Cast(*result));
-  CHECK(string->IsSlicedString());
+  CHECK(IsSlicedString(*string));
   CHECK_EQ(0, strcmp("bcdefghijklmnopqrstuvwxy", string->ToCString().get()));
 }
 
@@ -1502,15 +1512,15 @@ TEST(SliceFromSlice) {
   result = CompileRun(slice);
   CHECK(result->IsString());
   string = v8::Utils::OpenHandle(v8::String::Cast(*result));
-  CHECK(string->IsSlicedString());
-  CHECK(SlicedString::cast(*string).parent().IsSeqString());
+  CHECK(IsSlicedString(*string));
+  CHECK(IsSeqString(SlicedString::cast(*string)->parent()));
   CHECK_EQ(0, strcmp("bcdefghijklmnopqrstuvwxy", string->ToCString().get()));
 
   result = CompileRun(slice_from_slice);
   CHECK(result->IsString());
   string = v8::Utils::OpenHandle(v8::String::Cast(*result));
-  CHECK(string->IsSlicedString());
-  CHECK(SlicedString::cast(*string).parent().IsSeqString());
+  CHECK(IsSlicedString(*string));
+  CHECK(IsSeqString(SlicedString::cast(*string)->parent()));
   CHECK_EQ(0, strcmp("cdefghijklmnopqrstuvwx", string->ToCString().get()));
 }
 
@@ -1743,7 +1753,7 @@ TEST(Regress609831) {
         "String.fromCharCode(32, 32, 32, 32, 32, "
         "32, 32, 32, 32, 32, 32, 32, 32, 32, 32, "
         "32, 32, 32, 32, 32, 32, 32, 32, 32, 32)");
-    CHECK(v8::Utils::OpenHandle(*result)->IsSeqOneByteString());
+    CHECK(IsSeqOneByteString(*v8::Utils::OpenHandle(*result)));
   }
   {
     HandleScope scope(isolate);
@@ -1751,7 +1761,7 @@ TEST(Regress609831) {
         "String.fromCharCode(432, 432, 432, 432, 432, "
         "432, 432, 432, 432, 432, 432, 432, 432, 432, "
         "432, 432, 432, 432, 432, 432, 432, 432, 432)");
-    CHECK(v8::Utils::OpenHandle(*result)->IsSeqTwoByteString());
+    CHECK(IsSeqTwoByteString(*v8::Utils::OpenHandle(*result)));
   }
 }
 
@@ -1895,52 +1905,6 @@ class OneByteStringResource : public v8::String::ExternalOneByteStringResource {
   size_t length_;
 };
 
-TEST(Regress876759) {
-  // Thin strings are used in conjunction with young gen
-  if (v8_flags.single_generation) return;
-  // We don't create ThinStrings immediately when using the forwarding table.
-  if (v8_flags.always_use_string_forwarding_table) return;
-  Isolate* isolate = CcTest::i_isolate();
-  Factory* factory = isolate->factory();
-
-  HandleScope handle_scope(isolate);
-
-  const int kLength = 30;
-  base::uc16 two_byte_buf[kLength];
-  char* external_one_byte_buf = new char[kLength];
-  for (int j = 0; j < kLength; j++) {
-    char c = '0' + (j % 10);
-    two_byte_buf[j] = c;
-    external_one_byte_buf[j] = c;
-  }
-
-  Handle<String> parent;
-  {
-    Handle<SeqTwoByteString> raw =
-        factory->NewRawTwoByteString(kLength).ToHandleChecked();
-    DisallowGarbageCollection no_gc;
-    CopyChars(raw->GetChars(no_gc), two_byte_buf, kLength);
-    parent = raw;
-  }
-  CHECK(parent->IsTwoByteRepresentation());
-  Handle<String> sliced = factory->NewSubString(parent, 1, 20);
-  CHECK(sliced->IsSlicedString());
-  factory->InternalizeString(parent);
-  CHECK(parent->IsThinString());
-  Handle<String> grandparent =
-      handle(ThinString::cast(*parent).actual(), isolate);
-  CHECK_EQ(*parent, SlicedString::cast(*sliced).parent());
-  OneByteStringResource* resource =
-      new OneByteStringResource(external_one_byte_buf, kLength);
-  grandparent->MakeExternal(resource);
-  // The grandparent string becomes one-byte, but the child strings are still
-  // two-byte.
-  CHECK(grandparent->IsOneByteRepresentation());
-  CHECK(sliced->IsTwoByteRepresentation());
-  // The *Underneath version returns the correct representation.
-  CHECK(String::IsOneByteRepresentationUnderneath(*sliced));
-}
-
 // Show that it is possible to internalize an external string without a copy, as
 // long as it is not uncached.
 TEST(InternalizeExternalString) {
@@ -1954,7 +1918,7 @@ TEST(InternalizeExternalString) {
       new OneByteResource(i::StrDup(raw_string), strlen(raw_string));
   Handle<String> string =
       factory->NewExternalStringFromOneByte(resource).ToHandleChecked();
-  CHECK(string->IsExternalString());
+  CHECK(IsExternalString(*string));
 
   // Check it is not uncached.
   Handle<ExternalString> external = Handle<ExternalString>::cast(string);
@@ -1962,7 +1926,7 @@ TEST(InternalizeExternalString) {
 
   // Internalize succesfully, without a copy.
   Handle<String> internal = factory->InternalizeString(external);
-  CHECK(string->IsInternalizedString());
+  CHECK(IsInternalizedString(*string));
   CHECK(string.equals(internal));
 }
 
@@ -1979,7 +1943,7 @@ TEST(InternalizeExternalStringTwoByte) {
       new Resource(AsciiToTwoByteString(raw_string), strlen(raw_string));
   Handle<String> string =
       factory->NewExternalStringFromTwoByte(resource).ToHandleChecked();
-  CHECK(string->IsExternalString());
+  CHECK(IsExternalString(*string));
 
   // Check it is not uncached.
   Handle<ExternalString> external = Handle<ExternalString>::cast(string);
@@ -1987,7 +1951,7 @@ TEST(InternalizeExternalStringTwoByte) {
 
   // Internalize succesfully, without a copy.
   Handle<String> internal = factory->InternalizeString(external);
-  CHECK(string->IsInternalizedString());
+  CHECK(IsInternalizedString(*string));
   CHECK(string.equals(internal));
 }
 
@@ -2020,7 +1984,7 @@ TEST(InternalizeExternalStringUncachedWithCopy) {
       new UncachedExternalOneByteResource(i::StrDup(raw_string));
   Handle<String> string =
       factory->NewExternalStringFromOneByte(resource).ToHandleChecked();
-  CHECK(string->IsExternalString());
+  CHECK(IsExternalString(*string));
 
   // Check it is uncached.
   Handle<ExternalString> external = Handle<ExternalString>::cast(string);
@@ -2028,8 +1992,8 @@ TEST(InternalizeExternalStringUncachedWithCopy) {
 
   // Internalize succesfully, with a copy.
   Handle<String> internal = factory->InternalizeString(external);
-  CHECK(!external->IsInternalizedString());
-  CHECK(internal->IsInternalizedString());
+  CHECK(!IsInternalizedString(*external));
+  CHECK(IsInternalizedString(*internal));
 }
 
 class UncachedExternalResource : public v8::String::ExternalStringResource {
@@ -2063,17 +2027,17 @@ TEST(InternalizeExternalStringUncachedWithCopyTwoByte) {
       new UncachedExternalResource(AsciiToTwoByteString(raw_string));
   Handle<String> string =
       factory->NewExternalStringFromTwoByte(resource).ToHandleChecked();
-  CHECK(string->IsExternalString());
+  CHECK(IsExternalString(*string));
 
   // Check it is uncached.
   Handle<ExternalString> external = Handle<ExternalString>::cast(string);
   CHECK(external->is_uncached());
 
   // Internalize succesfully, with a copy.
-  CHECK(!external->IsInternalizedString());
+  CHECK(!IsInternalizedString(*external));
   Handle<String> internal = factory->InternalizeString(external);
-  CHECK(!external->IsInternalizedString());
-  CHECK(internal->IsInternalizedString());
+  CHECK(!IsInternalizedString(*external));
+  CHECK(IsInternalizedString(*internal));
 }
 
 // Show that we cache the data pointer for internal, external and uncached
@@ -2101,8 +2065,8 @@ TEST(CheckCachedDataInternalExternalUncachedString) {
   // Check it is external, internalized, and uncached with a cacheable resource.
   string->MakeExternal(resource);
   CHECK(string->IsOneByteRepresentation());
-  CHECK(string->IsExternalString());
-  CHECK(string->IsInternalizedString());
+  CHECK(IsExternalString(*string));
+  CHECK(IsInternalizedString(*string));
 
   // Check that the external string is uncached, its resource is cacheable, and
   // that we indeed cached it.
@@ -2129,23 +2093,25 @@ TEST(CheckCachedDataInternalExternalUncachedStringTwoByte) {
   // Due to different size restrictions the string needs to be small but not too
   // small. One of these restrictions is whether pointer compression is enabled.
 #ifdef V8_COMPRESS_POINTERS
-  const char* raw_small = "small string";
+  const char16_t* raw_small = u"smøl🤓";
 #elif V8_TARGET_ARCH_32_BIT
-  const char* raw_small = "smol";
+  const char16_t* raw_small = u"🤓";
 #else
-  const char* raw_small = "smalls";
+  const char16_t* raw_small = u"s🤓";
 #endif  // V8_COMPRESS_POINTERS
 
-  Handle<String> string =
-      factory->InternalizeString(factory->NewStringFromAsciiChecked(raw_small));
-  Resource* resource =
-      new Resource(AsciiToTwoByteString(raw_small), strlen(raw_small));
+  size_t len;
+  const uint16_t* two_byte = AsciiToTwoByteString(raw_small, &len);
+  Handle<String> string = factory->InternalizeString(
+      factory->NewStringFromTwoByte(base::VectorOf(two_byte, len))
+          .ToHandleChecked());
+  Resource* resource = new Resource(two_byte, len);
 
   // Check it is external, internalized, and uncached with a cacheable resource.
   string->MakeExternal(resource);
   CHECK(string->IsTwoByteRepresentation());
-  CHECK(string->IsExternalString());
-  CHECK(string->IsInternalizedString());
+  CHECK(IsExternalString(*string));
+  CHECK(IsInternalizedString(*string));
 
   // Check that the external string is uncached, its resource is cacheable, and
   // that we indeed cached it.
diff --git a/deps/v8/test/cctest/test-swiss-name-dictionary-csa.cc b/deps/v8/test/cctest/test-swiss-name-dictionary-csa.cc
index 9017c8c0ff2845..a8055b71e207ff 100644
--- a/deps/v8/test/cctest/test-swiss-name-dictionary-csa.cc
+++ b/deps/v8/test/cctest/test-swiss-name-dictionary-csa.cc
@@ -134,8 +134,8 @@ void CSATestRunner::Add(Handle<Name> key, Handle<Object> value,
       SwissNameDictionary::Add(isolate_, reference_, key, value, details);
 
   Handle<Smi> details_smi = handle(details.AsSmi(), isolate_);
-  Handle<Oddball> success =
-      add_ft_.CallChecked<Oddball>(table, key, value, details_smi);
+  Handle<Boolean> success =
+      add_ft_.CallChecked<Boolean>(table, key, value, details_smi);
 
   if (*success == roots.false_value()) {
     // |add_ft_| does not resize and indicates the need to do so by returning
@@ -155,7 +155,7 @@ void CSATestRunner::Allocate(Handle<Smi> capacity) {
   // We must handle |capacity| == 0 specially, because
   // AllocateSwissNameDictionary (just like AllocateNameDictionary) always
   // returns a non-zero sized table.
-  if (capacity->value() == 0) {
+  if ((*capacity).value() == 0) {
     table = ReadOnlyRoots(isolate_).empty_swiss_property_dictionary_handle();
   } else {
     table = allocate_ft_.CallChecked<SwissNameDictionary>(capacity);
@@ -165,11 +165,11 @@ void CSATestRunner::Allocate(Handle<Smi> capacity) {
 }
 
 InternalIndex CSATestRunner::FindEntry(Handle<Name> key) {
-  Handle<Smi> index = find_entry_ft_.CallChecked<Smi>(table, key);
-  if (index->value() == SwissNameDictionary::kNotFoundSentinel) {
+  Tagged<Smi> index = *find_entry_ft_.CallChecked<Smi>(table, key);
+  if (index.value() == SwissNameDictionary::kNotFoundSentinel) {
     return InternalIndex::NotFound();
   } else {
-    return InternalIndex(index->value());
+    return InternalIndex(index.value());
   }
 }
 
diff --git a/deps/v8/test/cctest/test-swiss-name-dictionary-infra.h b/deps/v8/test/cctest/test-swiss-name-dictionary-infra.h
index ed0c03a0f1af02..c5175ce96b218c 100644
--- a/deps/v8/test/cctest/test-swiss-name-dictionary-infra.h
+++ b/deps/v8/test/cctest/test-swiss-name-dictionary-infra.h
@@ -199,7 +199,7 @@ class TestSequence {
       CHECK_EQ(*key, data->get(0));
 
       if (expected_value_opt) {
-        CHECK(expected_value_opt.value()->StrictEquals(data->get(1)));
+        CHECK(Object::StrictEquals(*expected_value_opt.value(), data->get(1)));
       }
 
       if (expected_details_opt) {
diff --git a/deps/v8/test/cctest/test-swiss-name-dictionary.cc b/deps/v8/test/cctest/test-swiss-name-dictionary.cc
index 0aabd5981df9f8..f5010ffc23b0de 100644
--- a/deps/v8/test/cctest/test-swiss-name-dictionary.cc
+++ b/deps/v8/test/cctest/test-swiss-name-dictionary.cc
@@ -113,7 +113,7 @@ void RuntimeTestRunner::CheckEnumerationOrder(
   ReadOnlyRoots roots(isolate_);
   int i = 0;
   for (InternalIndex index : table->IterateEntriesOrdered()) {
-    Object key;
+    Tagged<Object> key;
     if (table->ToKey(roots, index, &key)) {
       CHECK_LT(i, expected_keys.size());
       Handle<Name> expected_key =
diff --git a/deps/v8/test/cctest/test-sync-primitives-arm64.cc b/deps/v8/test/cctest/test-sync-primitives-arm64.cc
index dbba048339e2be..e33b8bb11e8a82 100644
--- a/deps/v8/test/cctest/test-sync-primitives-arm64.cc
+++ b/deps/v8/test/cctest/test-sync-primitives-arm64.cc
@@ -205,7 +205,7 @@ void TestInvalidateExclusiveAccess(TestData initial_data, MemoryAccess access1,
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 
   TestData t = initial_data;
-  Simulator::current(isolate)->Call<void>(code->code_entry_point(), &t);
+  Simulator::current(isolate)->Call<void>(code->instruction_start(), &t);
   int res = Simulator::current(isolate)->wreg(0);
 
   CHECK_EQ(expected_res, res);
@@ -275,7 +275,7 @@ int ExecuteMemoryAccess(Isolate* isolate, TestData* test_data,
   masm.GetCode(isolate, &desc);
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
-  Simulator::current(isolate)->Call<void>(code->code_entry_point(), test_data);
+  Simulator::current(isolate)->Call<void>(code->instruction_start(), test_data);
   return Simulator::current(isolate)->wreg(0);
 }
 
diff --git a/deps/v8/test/cctest/test-transitions.cc b/deps/v8/test/cctest/test-transitions.cc
index 0cee7dc6f92b0d..fb2e88daafd38d 100644
--- a/deps/v8/test/cctest/test-transitions.cc
+++ b/deps/v8/test/cctest/test-transitions.cc
@@ -41,7 +41,7 @@ TEST(TransitionArray_SimpleFieldTransitions) {
                          Representation::Tagged(), OMIT_TRANSITION)
           .ToHandleChecked();
 
-  CHECK(map0->raw_transitions()->IsSmi());
+  CHECK(IsSmi(map0->raw_transitions()));
 
   {
     TransitionsAccessor::Insert(isolate, map0, name1, map1,
@@ -71,8 +71,8 @@ TEST(TransitionArray_SimpleFieldTransitions) {
                                                  attributes));
     CHECK_EQ(2, transitions.NumberOfTransitions());
     for (int i = 0; i < 2; i++) {
-      Name key = transitions.GetKey(i);
-      Map target = transitions.GetTarget(i);
+      Tagged<Name> key = transitions.GetKey(i);
+      Tagged<Map> target = transitions.GetTarget(i);
       CHECK((key == *name1 && target == *map1) ||
             (key == *name2 && target == *map2));
     }
@@ -104,7 +104,7 @@ TEST(TransitionArray_FullFieldTransitions) {
                          Representation::Tagged(), OMIT_TRANSITION)
           .ToHandleChecked();
 
-  CHECK(map0->raw_transitions()->IsSmi());
+  CHECK(IsSmi(map0->raw_transitions()));
 
   {
     TransitionsAccessor::Insert(isolate, map0, name1, map1,
@@ -134,8 +134,8 @@ TEST(TransitionArray_FullFieldTransitions) {
                                                  attributes));
     CHECK_EQ(2, transitions.NumberOfTransitions());
     for (int i = 0; i < 2; i++) {
-      Name key = transitions.GetKey(i);
-      Map target = transitions.GetTarget(i);
+      Tagged<Name> key = transitions.GetKey(i);
+      Tagged<Map> target = transitions.GetTarget(i);
       CHECK((key == *name1 && target == *map1) ||
             (key == *name2 && target == *map2));
     }
@@ -157,7 +157,7 @@ TEST(TransitionArray_DifferentFieldNames) {
   PropertyAttributes attributes = NONE;
 
   Handle<Map> map0 = Map::Create(isolate, 0);
-  CHECK(map0->raw_transitions()->IsSmi());
+  CHECK(IsSmi(map0->raw_transitions()));
 
   for (int i = 0; i < PROPS_COUNT; i++) {
     base::EmbeddedVector<char, 64> buffer;
@@ -180,8 +180,8 @@ TEST(TransitionArray_DifferentFieldNames) {
                            *names[i], PropertyKind::kData, attributes));
   }
   for (int i = 0; i < PROPS_COUNT; i++) {
-    Name key = transitions.GetKey(i);
-    Map target = transitions.GetTarget(i);
+    Tagged<Name> key = transitions.GetKey(i);
+    Tagged<Map> target = transitions.GetTarget(i);
     for (int j = 0; j < PROPS_COUNT; j++) {
       if (*names[i] == key) {
         CHECK_EQ(*maps[i], target);
@@ -201,7 +201,7 @@ TEST(TransitionArray_SameFieldNamesDifferentAttributesSimple) {
   Factory* factory = isolate->factory();
 
   Handle<Map> map0 = Map::Create(isolate, 0);
-  CHECK(map0->raw_transitions()->IsSmi());
+  CHECK(IsSmi(map0->raw_transitions()));
 
   const int ATTRS_COUNT = (READ_ONLY | DONT_ENUM | DONT_DELETE) + 1;
   static_assert(ATTRS_COUNT == 8);
@@ -248,7 +248,7 @@ TEST(TransitionArray_SameFieldNamesDifferentAttributes) {
   Handle<Map> maps[PROPS_COUNT];
 
   Handle<Map> map0 = Map::Create(isolate, 0);
-  CHECK(map0->raw_transitions()->IsSmi());
+  CHECK(IsSmi(map0->raw_transitions()));
 
   // Some number of fields.
   for (int i = 0; i < PROPS_COUNT; i++) {
@@ -296,12 +296,12 @@ TEST(TransitionArray_SameFieldNamesDifferentAttributes) {
   // Ensure that info about the other fields still valid.
   CHECK_EQ(PROPS_COUNT + ATTRS_COUNT, transitions.NumberOfTransitions());
   for (int i = 0; i < PROPS_COUNT + ATTRS_COUNT; i++) {
-    Name key = transitions.GetKey(i);
-    Map target = transitions.GetTarget(i);
+    Tagged<Name> key = transitions.GetKey(i);
+    Tagged<Map> target = transitions.GetTarget(i);
     if (key == *name) {
       // Attributes transition.
       PropertyAttributes attributes =
-          target.GetLastDescriptorDetails(isolate).attributes();
+          target->GetLastDescriptorDetails(isolate).attributes();
       CHECK_EQ(*attr_maps[static_cast<int>(attributes)], target);
     } else {
       for (int j = 0; j < PROPS_COUNT; j++) {
diff --git a/deps/v8/test/cctest/test-transitions.h b/deps/v8/test/cctest/test-transitions.h
index 28f055c217f3a4..cc76223c12e51b 100644
--- a/deps/v8/test/cctest/test-transitions.h
+++ b/deps/v8/test/cctest/test-transitions.h
@@ -12,7 +12,7 @@ namespace internal {
 
 class TestTransitionsAccessor : public TransitionsAccessor {
  public:
-  TestTransitionsAccessor(Isolate* isolate, Map map)
+  TestTransitionsAccessor(Isolate* isolate, Tagged<Map> map)
       : TransitionsAccessor(isolate, map) {}
   TestTransitionsAccessor(Isolate* isolate, Handle<Map> map)
       : TransitionsAccessor(isolate, *map) {}
@@ -27,7 +27,9 @@ class TestTransitionsAccessor : public TransitionsAccessor {
 
   int Capacity() { return TransitionsAccessor::Capacity(); }
 
-  TransitionArray transitions() { return TransitionsAccessor::transitions(); }
+  Tagged<TransitionArray> transitions() {
+    return TransitionsAccessor::transitions();
+  }
 };
 
 }  // namespace internal
diff --git a/deps/v8/test/cctest/test-unwinder-code-pages.cc b/deps/v8/test/cctest/test-unwinder-code-pages.cc
index fe72a45d894c02..c3afa102150eea 100644
--- a/deps/v8/test/cctest/test-unwinder-code-pages.cc
+++ b/deps/v8/test/cctest/test-unwinder-code-pages.cc
@@ -168,11 +168,11 @@ TEST(Unwind_BuiltinPCInMiddle_Success_CodePagesAPI) {
   register_state.fp = stack;
 
   // Put the current PC inside of a valid builtin.
-  Code builtin = *BUILTIN_CODE(i_isolate, StringEqual);
+  Tagged<Code> builtin = *BUILTIN_CODE(i_isolate, StringEqual);
   const uintptr_t offset = 40;
-  CHECK_LT(offset, builtin.InstructionSize());
+  CHECK_LT(offset, builtin->instruction_size());
   register_state.pc =
-      reinterpret_cast<void*>(builtin.InstructionStart() + offset);
+      reinterpret_cast<void*>(builtin->instruction_start() + offset);
 
   bool unwound = v8::Unwinder::TryUnwindV8Frames(
       entry_stubs, pages_length, code_pages, &register_state, stack_base);
@@ -225,8 +225,8 @@ TEST(Unwind_BuiltinPCAtStart_Success_CodePagesAPI) {
 
   // Put the current PC at the start of a valid builtin, so that we are setting
   // up the frame.
-  Code builtin = *BUILTIN_CODE(i_isolate, StringEqual);
-  register_state.pc = reinterpret_cast<void*>(builtin.InstructionStart());
+  Tagged<Code> builtin = *BUILTIN_CODE(i_isolate, StringEqual);
+  register_state.pc = reinterpret_cast<void*>(builtin->instruction_start());
 
   bool unwound = v8::Unwinder::TryUnwindV8Frames(
       entry_stubs, pages_length, code_pages, &register_state, stack_base);
@@ -253,10 +253,10 @@ const char* foo_source = R"(
 
 bool PagesContainsAddress(size_t length, MemoryRange* pages,
                           Address search_address) {
-  byte* addr = reinterpret_cast<byte*>(search_address);
+  uint8_t* addr = reinterpret_cast<uint8_t*>(search_address);
   auto it = std::find_if(pages, pages + length, [addr](const MemoryRange& r) {
-    const byte* page_start = reinterpret_cast<const byte*>(r.start);
-    const byte* page_end = page_start + r.length_in_bytes;
+    const uint8_t* page_start = reinterpret_cast<const uint8_t*>(r.start);
+    const uint8_t* page_end = page_start + r.length_in_bytes;
     return addr >= page_start && addr < page_end;
   });
   return it != pages + length;
@@ -296,17 +296,17 @@ TEST(Unwind_CodeObjectPCInMiddle_Success_CodePagesAPI) {
       Handle<JSFunction>::cast(v8::Utils::OpenHandle(*local_foo));
 
   // Put the current PC inside of the created code object.
-  Code code = foo->code();
+  Tagged<Code> code = foo->code();
   // We don't produce optimized code when run with --no-turbofan and
   // --no-maglev.
-  if (!code.is_optimized_code()) return;
+  if (!code->is_optimized_code()) return;
 
   // We don't want the offset too early or it could be the `push rbp`
   // instruction (which is not at the start of generated code, because the lazy
   // deopt check happens before frame setup).
-  const uintptr_t offset = code.instruction_size() - 20;
-  CHECK_LT(offset, code.instruction_size());
-  Address pc = code.InstructionStart() + offset;
+  const uintptr_t offset = code->instruction_size() - 20;
+  CHECK_LT(offset, code->instruction_size());
+  Address pc = code->instruction_start() + offset;
   register_state.pc = reinterpret_cast<void*>(pc);
 
   // Get code pages from the API now that the code obejct exists and check that
@@ -455,8 +455,8 @@ TEST(Unwind_JSEntry_Fail_CodePagesAPI) {
   CHECK_LE(pages_length, arraysize(code_pages));
   RegisterState register_state;
 
-  Code js_entry = *BUILTIN_CODE(i_isolate, JSEntry);
-  byte* start = reinterpret_cast<byte*>(js_entry.InstructionStart());
+  Tagged<Code> js_entry = *BUILTIN_CODE(i_isolate, JSEntry);
+  uint8_t* start = reinterpret_cast<uint8_t*>(js_entry->instruction_start());
   register_state.pc = start + 10;
 
   bool unwound = v8::Unwinder::TryUnwindV8Frames(
@@ -593,7 +593,7 @@ TEST(PCIsInV8_ValidStateNullPC_Fail_CodePagesAPI) {
 }
 
 void TestRangeBoundaries(size_t pages_length, MemoryRange* code_pages,
-                         byte* range_start, size_t range_length) {
+                         uint8_t* range_start, size_t range_length) {
   void* pc = range_start - 1;
   CHECK(!v8::Unwinder::PCIsInV8(pages_length, code_pages, pc));
   pc = range_start;
@@ -618,8 +618,8 @@ TEST(PCIsInV8_InAllCodePages_CodePagesAPI) {
   CHECK_LE(pages_length, arraysize(code_pages));
 
   for (size_t i = 0; i < pages_length; i++) {
-    byte* range_start =
-        const_cast<byte*>(reinterpret_cast<const byte*>(code_pages[i].start));
+    uint8_t* range_start = const_cast<uint8_t*>(
+        reinterpret_cast<const uint8_t*>(code_pages[i].start));
     size_t range_length = code_pages[i].length_in_bytes;
     TestRangeBoundaries(pages_length, code_pages, range_start, range_length);
   }
@@ -637,9 +637,9 @@ TEST(PCIsInV8_InJSEntryRange_CodePagesAPI) {
       isolate->CopyCodePages(arraysize(code_pages), code_pages);
   CHECK_LE(pages_length, arraysize(code_pages));
 
-  Code js_entry = *BUILTIN_CODE(i_isolate, JSEntry);
-  byte* start = reinterpret_cast<byte*>(js_entry.InstructionStart());
-  size_t length = js_entry.InstructionSize();
+  Tagged<Code> js_entry = *BUILTIN_CODE(i_isolate, JSEntry);
+  uint8_t* start = reinterpret_cast<uint8_t*>(js_entry->instruction_start());
+  size_t length = js_entry->instruction_size();
 
   void* pc = start;
   CHECK(v8::Unwinder::PCIsInV8(pages_length, code_pages, pc));
@@ -661,7 +661,7 @@ TEST(PCIsInV8_LargeCodeObject_CodePagesAPI) {
   // Create a big function that ends up in CODE_LO_SPACE.
   const int instruction_size = Page::kPageSize + 1;
   CHECK_GT(instruction_size, MemoryChunkLayout::MaxRegularCodeObjectSize());
-  std::unique_ptr<byte[]> instructions(new byte[instruction_size]);
+  std::unique_ptr<uint8_t[]> instructions(new uint8_t[instruction_size]);
 
   CodeDesc desc;
   desc.buffer = instructions.get();
@@ -677,7 +677,7 @@ TEST(PCIsInV8_LargeCodeObject_CodePagesAPI) {
 
   CHECK(i_isolate->heap()->InSpace(foo_code->instruction_stream(),
                                    CODE_LO_SPACE));
-  byte* start = reinterpret_cast<byte*>(foo_code->InstructionStart());
+  uint8_t* start = reinterpret_cast<uint8_t*>(foo_code->instruction_start());
 
   MemoryRange code_pages[v8::Isolate::kMinCodePagesBufferSize];
   size_t pages_length =
@@ -708,7 +708,8 @@ class UnwinderTestHelper {
   ~UnwinderTestHelper() { instance_ = nullptr; }
 
  private:
-  static void TryUnwind(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  static void TryUnwind(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    CHECK(i::ValidateCallbackInfo(info));
     instance_->DoTryUnwind();
   }
 
diff --git a/deps/v8/test/cctest/test-utils.cc b/deps/v8/test/cctest/test-utils.cc
index 479fde1ed00aaa..43860ff66de098 100644
--- a/deps/v8/test/cctest/test-utils.cc
+++ b/deps/v8/test/cctest/test-utils.cc
@@ -147,12 +147,8 @@ TEST(SNPrintF) {
 
 static const int kAreaSize = 512;
 
-
-void TestMemMove(byte* area1,
-                 byte* area2,
-                 int src_offset,
-                 int dest_offset,
-                 int length) {
+void TestMemMove(uint8_t* area1, uint8_t* area2, int src_offset,
+                 int dest_offset, int length) {
   for (int i = 0; i < kAreaSize; i++) {
     area1[i] = i & 0xFF;
     area2[i] = i & 0xFF;
@@ -172,8 +168,8 @@ void TestMemMove(byte* area1,
 }
 
 TEST(MemMove) {
-  byte* area1 = new byte[kAreaSize];
-  byte* area2 = new byte[kAreaSize];
+  uint8_t* area1 = new uint8_t[kAreaSize];
+  uint8_t* area2 = new uint8_t[kAreaSize];
 
   static const int kMinOffset = 32;
   static const int kMaxOffset = 64;
diff --git a/deps/v8/test/cctest/test-verifiers.cc b/deps/v8/test/cctest/test-verifiers.cc
index 8e393ae16362df..2dce6a9c673838 100644
--- a/deps/v8/test/cctest/test-verifiers.cc
+++ b/deps/v8/test/cctest/test-verifiers.cc
@@ -45,7 +45,7 @@ TEST_PAIR(TestWrongTypeInNormalField) {
   Handle<JSObject> o = Handle<JSObject>::cast(v8::Utils::OpenHandle(*v));
   Handle<Object> original_elements(
       TaggedField<Object>::load(*o, JSObject::kElementsOffset), i_isolate);
-  CHECK(original_elements->IsFixedArrayBase());
+  CHECK(IsFixedArrayBase(*original_elements));
 
   // There must be no GC (and therefore no verifiers running) until we can
   // restore the modified data.
@@ -76,7 +76,7 @@ TEST_PAIR(TestWrongStrongTypeInIndexedStructField) {
                DescriptorArray::kEntryKeyOffset;
   Handle<Object> original_key(TaggedField<Object>::load(*descriptors, offset),
                               i_isolate);
-  CHECK(original_key->IsString());
+  CHECK(IsString(*original_key));
 
   // There must be no GC (and therefore no verifiers running) until we can
   // restore the modified data.
diff --git a/deps/v8/test/cctest/testcfg.py b/deps/v8/test/cctest/testcfg.py
index 83d2c140ebcaec..ee01e8346a1ace 100644
--- a/deps/v8/test/cctest/testcfg.py
+++ b/deps/v8/test/cctest/testcfg.py
@@ -28,7 +28,6 @@
 # for py2/py3 compatibility
 from __future__ import print_function
 
-import os
 import shutil
 
 from testrunner.local import command
@@ -41,13 +40,10 @@
 
 class TestLoader(testsuite.TestLoader):
   def _list_test_filenames(self):
-    shell = os.path.abspath(os.path.join(self.test_config.shell_dir, SHELL))
-    if utils.IsWindows():
-      shell += ".exe"
+    args = ["--list"] + self.test_config.extra_flags
+    shell = self.ctx.platform_shell(SHELL, args, self.test_config.shell_dir)
     cmd = self.ctx.command(
-        cmd_prefix=self.test_config.command_prefix,
-        shell=shell,
-        args=["--list"] + self.test_config.extra_flags)
+        cmd_prefix=self.test_config.command_prefix, shell=shell, args=args)
     output = cmd.execute()
     # TODO make errors visible (see duplicated code in 'unittests')
     if output.exit_code != 0:
@@ -62,7 +58,11 @@ def _list_test_filenames(self):
     tests_total = 0
 
     for line in output.stdout.strip().splitlines():
-      if line.startswith(test_prefix):
+      # When the command runs through another executable (e.g. iOS Simulator),
+      # it is possible that the stdout will show something else in the same
+      # line of the actual test output so it's necessary to harness for that
+      # case.
+      if test_prefix in line:
         filtered_output.append(line[len(test_prefix):])
       if line.startswith(test_total_prefix):
         tests_total = int(line[len(test_total_prefix):])
@@ -86,4 +86,4 @@ def get_shell(self):
     return SHELL
 
   def _get_files_params(self):
-    return [self.path]
+    return [self.name]
diff --git a/deps/v8/test/cctest/torque/test-torque.cc b/deps/v8/test/cctest/torque/test-torque.cc
index 48707059ae2462..d026db2184e61a 100644
--- a/deps/v8/test/cctest/torque/test-torque.cc
+++ b/deps/v8/test/cctest/torque/test-torque.cc
@@ -165,10 +165,10 @@ TEST(TestTernaryOperator) {
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Object> result1 =
       ft.Call(Handle<Smi>(Smi::FromInt(-5), isolate)).ToHandleChecked();
-  CHECK_EQ(-15, Handle<Smi>::cast(result1)->value());
+  CHECK_EQ(-15, Smi::cast(*result1).value());
   Handle<Object> result2 =
       ft.Call(Handle<Smi>(Smi::FromInt(3), isolate)).ToHandleChecked();
-  CHECK_EQ(103, Handle<Smi>::cast(result2)->value());
+  CHECK_EQ(103, Smi::cast(*result2).value());
 }
 
 TEST(TestFunctionPointerToGeneric) {
@@ -948,7 +948,7 @@ TEST(TestRunLazyTwice) {
   CHECK_EQ(lazyNumber, 5);
   FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
   Handle<Object> result = ft.Call().ToHandleChecked();
-  CHECK_EQ(7, Handle<Smi>::cast(result)->value());
+  CHECK_EQ(7, Smi::cast(*result).value());
 }
 
 TEST(TestCreateLazyNodeFromTorque) {
@@ -966,6 +966,64 @@ TEST(TestCreateLazyNodeFromTorque) {
   ft.Call();
 }
 
+TEST(TestReturnNever_NotCalled) {
+  CcTest::InitializeVM();
+  Isolate* isolate(CcTest::i_isolate());
+  i::HandleScope scope(isolate);
+  const int kNumParams = 0;
+  CodeAssemblerTester asm_tester(isolate, JSParameterCount(kNumParams));
+  TestTorqueAssembler m(asm_tester.state());
+  {
+    auto context = m.GetJSContextParameter();
+    TNode<Smi> arg = m.SmiConstant(42);
+    TNode<Object> result = m.CallBuiltin(Builtin::kTestCallNever, context, arg);
+    m.Return(result);
+  }
+  FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
+  Handle<Object> result = ft.Call().ToHandleChecked();
+  CHECK_EQ(42, Smi::cast(*result).value());
+}
+
+// Test calling a builtin that calls a runtime fct with return type {never}.
+TEST(TestReturnNever_Runtime_Called) {
+  CcTest::InitializeVM();
+  Isolate* isolate(CcTest::i_isolate());
+  i::HandleScope scope(isolate);
+  const int kNumParams = 0;
+  CodeAssemblerTester asm_tester(isolate, JSParameterCount(kNumParams));
+  TestTorqueAssembler m(asm_tester.state());
+  {
+    auto context = m.GetJSContextParameter();
+    TNode<Smi> arg = m.SmiConstant(1);
+    TNode<Object> result = m.CallBuiltin(Builtin::kTestCallNever, context, arg);
+    m.Return(result);
+  }
+  FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
+  MaybeHandle<Object> result = ft.Call();
+  CHECK(result.is_null());
+  CHECK(isolate->has_pending_exception());
+}
+
+// Test calling a builtin that calls another builtin with return type {never}.
+TEST(TestReturnNever_Builtin_Called) {
+  CcTest::InitializeVM();
+  Isolate* isolate(CcTest::i_isolate());
+  i::HandleScope scope(isolate);
+  const int kNumParams = 0;
+  CodeAssemblerTester asm_tester(isolate, JSParameterCount(kNumParams));
+  TestTorqueAssembler m(asm_tester.state());
+  {
+    auto context = m.GetJSContextParameter();
+    TNode<Smi> arg = m.SmiConstant(-1);
+    TNode<Object> result = m.CallBuiltin(Builtin::kTestCallNever, context, arg);
+    m.Return(result);
+  }
+  FunctionTester ft(asm_tester.GenerateCode(), kNumParams);
+  MaybeHandle<Object> result = ft.Call();
+  CHECK(result.is_null());
+  CHECK(isolate->has_pending_exception());
+}
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/cctest/trace-extension.cc b/deps/v8/test/cctest/trace-extension.cc
index a48ecf768df7b7..c83d189fe72c59 100644
--- a/deps/v8/test/cctest/trace-extension.cc
+++ b/deps/v8/test/cctest/trace-extension.cc
@@ -61,19 +61,19 @@ v8::Local<v8::FunctionTemplate> TraceExtension::GetNativeFunctionTemplate(
   UNREACHABLE();
 }
 
-
-Address TraceExtension::GetFP(const v8::FunctionCallbackInfo<v8::Value>& args) {
+Address TraceExtension::GetFP(const v8::FunctionCallbackInfo<v8::Value>& info) {
   // Convert frame pointer from encoding as smis in the arguments to a pointer.
-  CHECK_EQ(2, args.Length());  // Ignore second argument on 32-bit platform.
+  CHECK_EQ(2, info.Length());  // Ignore second argument on 32-bit platform.
+  CHECK(i::ValidateCallbackInfo(info));
 #if defined(V8_HOST_ARCH_32_BIT)
-  Address fp = *reinterpret_cast<Address*>(*args[0]);
+  Address fp = *reinterpret_cast<Address*>(*info[0]);
 #elif defined(V8_HOST_ARCH_64_BIT)
   uint64_t kSmiValueMask =
       (static_cast<uintptr_t>(1) << (kSmiValueSize - 1)) - 1;
   uint64_t low_bits =
-      Smi(*reinterpret_cast<Address*>(*args[0])).value() & kSmiValueMask;
+      Smi(*reinterpret_cast<Address*>(*info[0])).value() & kSmiValueMask;
   uint64_t high_bits =
-      Smi(*reinterpret_cast<Address*>(*args[1])).value() & kSmiValueMask;
+      Smi(*reinterpret_cast<Address*>(*info[1])).value() & kSmiValueMask;
   Address fp =
       static_cast<Address>((high_bits << (kSmiValueSize - 1)) | low_bits);
 #else
@@ -99,16 +99,15 @@ void TraceExtension::DoTrace(Address fp) {
                          TickSample::kSkipCEntryFrame, true);
 }
 
-
-void TraceExtension::Trace(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(args.GetIsolate());
+void TraceExtension::Trace(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
   i::VMState<EXTERNAL> state(isolate);
   Address address = reinterpret_cast<Address>(&TraceExtension::Trace);
   i::ExternalCallbackScope call_scope(isolate, address);
-  DoTrace(GetFP(args));
+  DoTrace(GetFP(info));
 }
 
-
 // Hide c_entry_fp to emulate situation when sampling is done while
 // pure JS code is being executed
 static void DoTraceHideCEntryFPAddress(Address fp) {
@@ -120,37 +119,35 @@ static void DoTraceHideCEntryFPAddress(Address fp) {
   *(CcTest::i_isolate()->c_entry_fp_address()) = saved_c_frame_fp;
 }
 
-
-void TraceExtension::JSTrace(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(args.GetIsolate());
+void TraceExtension::JSTrace(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
   i::VMState<EXTERNAL> state(isolate);
   Address address = reinterpret_cast<Address>(&TraceExtension::JSTrace);
   i::ExternalCallbackScope call_scope(isolate, address);
-  DoTraceHideCEntryFPAddress(GetFP(args));
+  DoTraceHideCEntryFPAddress(GetFP(info));
 }
 
-
 Address TraceExtension::GetJsEntrySp() {
   CHECK(CcTest::i_isolate()->thread_local_top());
   return CcTest::i_isolate()->js_entry_sp();
 }
 
-
 void TraceExtension::JSEntrySP(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CHECK(GetJsEntrySp());
 }
 
-
 void TraceExtension::JSEntrySPLevel2(
-    const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::HandleScope scope(args.GetIsolate());
+    const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::HandleScope scope(info.GetIsolate());
   const Address js_entry_sp = GetJsEntrySp();
   CHECK(js_entry_sp);
   CompileRun("js_entry_sp();");
   CHECK_EQ(js_entry_sp, GetJsEntrySp());
 }
 
-
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/cctest/trace-extension.h b/deps/v8/test/cctest/trace-extension.h
index a7aaa5e4b54d4a..6ad90c6d3dc176 100644
--- a/deps/v8/test/cctest/trace-extension.h
+++ b/deps/v8/test/cctest/trace-extension.h
@@ -44,15 +44,15 @@ class TraceExtension : public v8::Extension {
   TraceExtension() : v8::Extension("v8/trace", kSource) { }
   v8::Local<v8::FunctionTemplate> GetNativeFunctionTemplate(
       v8::Isolate* isolate, v8::Local<v8::String> name) override;
-  static void Trace(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void JSTrace(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void JSEntrySP(const v8::FunctionCallbackInfo<v8::Value>& args);
-  static void JSEntrySPLevel2(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static void Trace(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void JSTrace(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void JSEntrySP(const v8::FunctionCallbackInfo<v8::Value>& info);
+  static void JSEntrySPLevel2(const v8::FunctionCallbackInfo<v8::Value>& info);
   static Address GetJsEntrySp();
   static void InitTraceEnv(TickSample* sample);
   static void DoTrace(Address fp);
  private:
-  static Address GetFP(const v8::FunctionCallbackInfo<v8::Value>& args);
+  static Address GetFP(const v8::FunctionCallbackInfo<v8::Value>& info);
   static const char* kSource;
 };
 
diff --git a/deps/v8/test/cctest/wasm/test-backing-store.cc b/deps/v8/test/cctest/wasm/test-backing-store.cc
index 256620f6e3e134..5c359ba0c4442b 100644
--- a/deps/v8/test/cctest/wasm/test-backing-store.cc
+++ b/deps/v8/test/cctest/wasm/test-backing-store.cc
@@ -6,6 +6,7 @@
 #include "src/objects/backing-store.h"
 #include "src/wasm/wasm-objects.h"
 #include "test/cctest/cctest.h"
+#include "test/cctest/heap/heap-utils.h"
 #include "test/cctest/manually-externalized-buffer.h"
 
 namespace v8 {
@@ -37,7 +38,7 @@ TEST(Run_WasmModule_Buffer_Externalized_Detach) {
     int_buffer[0] = 0;
     // Embedder frees contents.
   }
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
 }
 
 TEST(Run_WasmModule_Buffer_Externalized_Regression_UseAfterFree) {
@@ -45,8 +46,8 @@ TEST(Run_WasmModule_Buffer_Externalized_Regression_UseAfterFree) {
     // Regression test for https://crbug.com/813876
     Isolate* isolate = CcTest::InitIsolateOnce();
     HandleScope scope(isolate);
-    MaybeHandle<WasmMemoryObject> result =
-        WasmMemoryObject::New(isolate, 1, 1, SharedFlag::kNotShared);
+    MaybeHandle<WasmMemoryObject> result = WasmMemoryObject::New(
+        isolate, 1, 1, SharedFlag::kNotShared, WasmMemoryFlag::kWasmMemory32);
     Handle<WasmMemoryObject> memory_object = result.ToHandleChecked();
     Handle<JSArrayBuffer> buffer(memory_object->array_buffer(), isolate);
 
@@ -63,10 +64,10 @@ TEST(Run_WasmModule_Buffer_Externalized_Regression_UseAfterFree) {
 
     // Make sure the memory object has a new buffer that can be written to.
     uint32_t* int_buffer = reinterpret_cast<uint32_t*>(
-        memory_object->array_buffer().backing_store());
+        memory_object->array_buffer()->backing_store());
     int_buffer[0] = 0;
   }
-  CcTest::CollectAllAvailableGarbage();
+  heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
 }
 
 #if V8_TARGET_ARCH_64_BIT
diff --git a/deps/v8/test/cctest/wasm/test-compilation-cache.cc b/deps/v8/test/cctest/wasm/test-compilation-cache.cc
index 20436fc53de48c..29645c87df2e3e 100644
--- a/deps/v8/test/cctest/wasm/test-compilation-cache.cc
+++ b/deps/v8/test/cctest/wasm/test-compilation-cache.cc
@@ -305,7 +305,7 @@ UNINITIALIZED_TEST(TwoIsolatesShareNativeModule) {
 
 UNINITIALIZED_TEST(TwoIsolatesShareNativeModuleWithPku) {
   v8_flags.wasm_lazy_compilation = false;
-  v8_flags.wasm_memory_protection_keys = true;
+  v8_flags.memory_protection_keys = true;
   TestModuleSharingBetweenIsolates();
 }
 
diff --git a/deps/v8/test/cctest/wasm/test-gc.cc b/deps/v8/test/cctest/wasm/test-gc.cc
index bddfe64e8ffe4f..43c4a76bdf953a 100644
--- a/deps/v8/test/cctest/wasm/test-gc.cc
+++ b/deps/v8/test/cctest/wasm/test-gc.cc
@@ -49,23 +49,24 @@ class WasmGCTester {
     testing::SetupIsolateForWasmModule(isolate_);
   }
 
-  byte AddGlobal(ValueType type, bool mutability, WasmInitExpr init) {
+  uint8_t AddGlobal(ValueType type, bool mutability, WasmInitExpr init) {
     return builder_.AddGlobal(type, mutability, init);
   }
 
-  byte DefineFunction(FunctionSig* sig, std::initializer_list<ValueType> locals,
-                      std::initializer_list<byte> code) {
+  uint8_t DefineFunction(FunctionSig* sig,
+                         std::initializer_list<ValueType> locals,
+                         std::initializer_list<uint8_t> code) {
     return DefineFunctionImpl(builder_.AddFunction(sig), locals, code);
   }
 
-  byte DefineFunction(uint32_t sig_index,
-                      std::initializer_list<ValueType> locals,
-                      std::initializer_list<byte> code) {
+  uint8_t DefineFunction(uint32_t sig_index,
+                         std::initializer_list<ValueType> locals,
+                         std::initializer_list<uint8_t> code) {
     return DefineFunctionImpl(builder_.AddFunction(sig_index), locals, code);
   }
 
   void DefineExportedFunction(const char* name, FunctionSig* sig,
-                              std::initializer_list<byte> code) {
+                              std::initializer_list<uint8_t> code) {
     WasmFunctionBuilder* fun = builder_.AddFunction(sig);
     fun->EmitCode(code.begin(), static_cast<uint32_t>(code.size()));
     builder_.AddExport(base::CStrVector(name), fun);
@@ -80,8 +81,9 @@ class WasmGCTester {
                            isolate_->factory()->undefined_value(), argc, args);
   }
 
-  byte DefineStruct(std::initializer_list<F> fields,
-                    uint32_t supertype = kNoSuperType, bool is_final = false) {
+  uint8_t DefineStruct(std::initializer_list<F> fields,
+                       uint32_t supertype = kNoSuperType,
+                       bool is_final = false) {
     StructType::Builder type_builder(&zone_,
                                      static_cast<uint32_t>(fields.size()));
     for (F field : fields) {
@@ -90,18 +92,19 @@ class WasmGCTester {
     return builder_.AddStructType(type_builder.Build(), is_final, supertype);
   }
 
-  byte DefineArray(ValueType element_type, bool mutability,
-                   uint32_t supertype = kNoSuperType, bool is_final = false) {
+  uint8_t DefineArray(ValueType element_type, bool mutability,
+                      uint32_t supertype = kNoSuperType,
+                      bool is_final = false) {
     return builder_.AddArrayType(zone_.New<ArrayType>(element_type, mutability),
                                  is_final, supertype);
   }
 
-  byte DefineSignature(FunctionSig* sig, uint32_t supertype = kNoSuperType,
-                       bool is_final = false) {
+  uint8_t DefineSignature(FunctionSig* sig, uint32_t supertype = kNoSuperType,
+                          bool is_final = false) {
     return builder_.ForceAddSignature(sig, is_final, supertype);
   }
 
-  byte DefineTable(ValueType type, uint32_t min_size, uint32_t max_size) {
+  uint8_t DefineTable(ValueType type, uint32_t min_size, uint32_t max_size) {
     return builder_.AddTable(type, min_size, max_size);
   }
 
@@ -199,9 +202,9 @@ class WasmGCTester {
   const FlagScope<bool> flag_wasm_dynamic_tiering;
   const FlagScope<bool> flag_tierup;
 
-  byte DefineFunctionImpl(WasmFunctionBuilder* fun,
-                          std::initializer_list<ValueType> locals,
-                          std::initializer_list<byte> code) {
+  uint8_t DefineFunctionImpl(WasmFunctionBuilder* fun,
+                             std::initializer_list<ValueType> locals,
+                             std::initializer_list<uint8_t> code) {
     for (ValueType local : locals) {
       fun->AddLocal(local);
     }
@@ -239,7 +242,7 @@ class WasmGCTester {
   void CallFunctionImpl(uint32_t function_index, const FunctionSig* sig,
                         CWasmArgumentsPacker* packer) {
     WasmCodeRefScope code_ref_scope;
-    NativeModule* native_module = instance_->module_object().native_module();
+    NativeModule* native_module = instance_->module_object()->native_module();
     Address wasm_call_target = instance_->GetCallTarget(function_index);
     Handle<Object> object_ref = instance_;
     Handle<Code> c_wasm_entry =
@@ -266,9 +269,9 @@ ValueType refNull(uint32_t type_index) {
 WASM_COMPILED_EXEC_TEST(WasmBasicStruct) {
   WasmGCTester tester(execution_tier);
 
-  const byte type_index =
+  const uint8_t type_index =
       tester.DefineStruct({F(kWasmI32, true), F(kWasmI32, true)});
-  const byte empty_struct_index = tester.DefineStruct({});
+  const uint8_t empty_struct_index = tester.DefineStruct({});
   ValueType kRefType = ref(type_index);
   ValueType kEmptyStructType = ref(empty_struct_index);
   ValueType kRefNullType = refNull(type_index);
@@ -276,7 +279,7 @@ WASM_COMPILED_EXEC_TEST(WasmBasicStruct) {
   FunctionSig sig_qe_v(1, 0, &kEmptyStructType);
 
   // Test struct.new and struct.get.
-  const byte kGet1 = tester.DefineFunction(
+  const uint8_t kGet1 = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_STRUCT_GET(
            type_index, 0,
@@ -284,7 +287,7 @@ WASM_COMPILED_EXEC_TEST(WasmBasicStruct) {
        kExprEnd});
 
   // Test struct.new and struct.get.
-  const byte kGet2 = tester.DefineFunction(
+  const uint8_t kGet2 = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_STRUCT_GET(
            type_index, 1,
@@ -292,24 +295,24 @@ WASM_COMPILED_EXEC_TEST(WasmBasicStruct) {
        kExprEnd});
 
   // Test struct.new, returning struct reference.
-  const byte kGetStruct = tester.DefineFunction(
+  const uint8_t kGetStruct = tester.DefineFunction(
       &sig_q_v, {},
       {WASM_STRUCT_NEW(type_index, WASM_I32V(42), WASM_I32V(64)), kExprEnd});
 
-  const byte kGetStructNominal = tester.DefineFunction(
+  const uint8_t kGetStructNominal = tester.DefineFunction(
       &sig_q_v, {},
       {WASM_STRUCT_NEW_DEFAULT(type_index), WASM_DROP,
        WASM_STRUCT_NEW(type_index, WASM_I32V(42), WASM_I32V(64)), kExprEnd});
 
   // Test struct.new, returning reference to an empty struct.
-  const byte kGetEmptyStruct = tester.DefineFunction(
+  const uint8_t kGetEmptyStruct = tester.DefineFunction(
       &sig_qe_v, {},
       {WASM_GC_OP(kExprStructNew), empty_struct_index, kExprEnd});
 
   // Test struct.set, struct refs types in locals.
-  const byte j_local_index = 0;
-  const byte j_field_index = 0;
-  const byte kSet = tester.DefineFunction(
+  const uint8_t j_local_index = 0;
+  const uint8_t j_field_index = 0;
+  const uint8_t kSet = tester.DefineFunction(
       tester.sigs.i_v(), {kRefNullType},
       {WASM_LOCAL_SET(j_local_index, WASM_STRUCT_NEW(type_index, WASM_I32V(42),
                                                      WASM_I32V(64))),
@@ -319,7 +322,7 @@ WASM_COMPILED_EXEC_TEST(WasmBasicStruct) {
                        WASM_LOCAL_GET(j_local_index)),
        kExprEnd});
 
-  const byte kNullDereference = tester.DefineFunction(
+  const uint8_t kNullDereference = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_STRUCT_GET(type_index, 0, WASM_REF_NULL(type_index)), kExprEnd});
 
@@ -327,13 +330,11 @@ WASM_COMPILED_EXEC_TEST(WasmBasicStruct) {
 
   tester.CheckResult(kGet1, 42);
   tester.CheckResult(kGet2, 64);
-  CHECK(tester.GetResultObject(kGetStruct).ToHandleChecked()->IsWasmStruct());
-  CHECK(tester.GetResultObject(kGetStructNominal)
-            .ToHandleChecked()
-            ->IsWasmStruct());
-  CHECK(tester.GetResultObject(kGetEmptyStruct)
-            .ToHandleChecked()
-            ->IsWasmStruct());
+  CHECK(IsWasmStruct(*tester.GetResultObject(kGetStruct).ToHandleChecked()));
+  CHECK(IsWasmStruct(
+      *tester.GetResultObject(kGetStructNominal).ToHandleChecked()));
+  CHECK(
+      IsWasmStruct(*tester.GetResultObject(kGetEmptyStruct).ToHandleChecked()));
   tester.CheckResult(kSet, -99);
   tester.CheckHasThrown(kNullDereference);
 }
@@ -341,25 +342,25 @@ WASM_COMPILED_EXEC_TEST(WasmBasicStruct) {
 // Test struct.get, ref.as_non_null and ref-typed globals.
 WASM_COMPILED_EXEC_TEST(WasmRefAsNonNull) {
   WasmGCTester tester(execution_tier);
-  const byte type_index =
+  const uint8_t type_index =
       tester.DefineStruct({F(kWasmI32, true), F(kWasmI32, true)});
   ValueType kRefTypes[] = {ref(type_index)};
   ValueType kRefNullType = refNull(type_index);
   FunctionSig sig_q_v(1, 0, kRefTypes);
 
-  const byte global_index =
+  const uint8_t global_index =
       tester.AddGlobal(kRefNullType, true,
                        WasmInitExpr::RefNullConst(
                            static_cast<HeapType::Representation>(type_index)));
-  const byte field_index = 0;
-  const byte kNonNull = tester.DefineFunction(
+  const uint8_t field_index = 0;
+  const uint8_t kNonNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_GLOBAL_SET(global_index, WASM_STRUCT_NEW(type_index, WASM_I32V(55),
                                                      WASM_I32V(66))),
        WASM_STRUCT_GET(type_index, field_index,
                        WASM_REF_AS_NON_NULL(WASM_GLOBAL_GET(global_index))),
        kExprEnd});
-  const byte kNull = tester.DefineFunction(
+  const uint8_t kNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_GLOBAL_SET(global_index, WASM_REF_NULL(type_index)),
        WASM_STRUCT_GET(type_index, field_index,
@@ -374,16 +375,16 @@ WASM_COMPILED_EXEC_TEST(WasmRefAsNonNull) {
 WASM_COMPILED_EXEC_TEST(WasmRefAsNonNullSkipCheck) {
   FlagScope<bool> no_check(&v8_flags.experimental_wasm_skip_null_checks, true);
   WasmGCTester tester(execution_tier);
-  const byte type_index =
+  const uint8_t type_index =
       tester.DefineStruct({F(kWasmI32, true), F(kWasmI32, true)});
   ValueType kRefType = ref(type_index);
   FunctionSig sig_q_v(1, 0, &kRefType);
 
-  const byte global_index =
+  const uint8_t global_index =
       tester.AddGlobal(refNull(type_index), true,
                        WasmInitExpr::RefNullConst(
                            static_cast<HeapType::Representation>(type_index)));
-  const byte kFunc = tester.DefineFunction(
+  const uint8_t kFunc = tester.DefineFunction(
       &sig_q_v, {},
       {WASM_GLOBAL_SET(global_index, WASM_REF_NULL(type_index)),
        WASM_REF_AS_NON_NULL(WASM_GLOBAL_GET(global_index)), kExprEnd});
@@ -391,18 +392,18 @@ WASM_COMPILED_EXEC_TEST(WasmRefAsNonNullSkipCheck) {
   tester.CompileModule();
   Handle<Object> result = tester.GetResultObject(kFunc).ToHandleChecked();
   // Without null checks, ref.as_non_null can actually return null.
-  CHECK(result->IsWasmNull());
+  CHECK(IsWasmNull(*result));
 }
 
 WASM_COMPILED_EXEC_TEST(WasmBrOnNull) {
   WasmGCTester tester(execution_tier);
-  const byte type_index =
+  const uint8_t type_index =
       tester.DefineStruct({F(kWasmI32, true), F(kWasmI32, true)});
   ValueType kRefTypes[] = {ref(type_index)};
   ValueType kRefNullType = refNull(type_index);
   FunctionSig sig_q_v(1, 0, kRefTypes);
-  const byte local_index = 0;
-  const byte kTaken = tester.DefineFunction(
+  const uint8_t local_index = 0;
+  const uint8_t kTaken = tester.DefineFunction(
       tester.sigs.i_v(), {kRefNullType},
       {WASM_BLOCK_I(WASM_I32V(42),
                     // Branch will be taken.
@@ -411,8 +412,8 @@ WASM_COMPILED_EXEC_TEST(WasmBrOnNull) {
                     WASM_I32V(52), WASM_BR(0)),
        kExprEnd});
 
-  const byte field_index = 0;
-  const byte kNotTaken = tester.DefineFunction(
+  const uint8_t field_index = 0;
+  const uint8_t kNotTaken = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_I(
            WASM_I32V(42),
@@ -432,14 +433,14 @@ WASM_COMPILED_EXEC_TEST(WasmBrOnNull) {
 
 WASM_COMPILED_EXEC_TEST(WasmBrOnNonNull) {
   WasmGCTester tester(execution_tier);
-  const byte type_index =
+  const uint8_t type_index =
       tester.DefineStruct({F(kWasmI32, true), F(kWasmI32, true)});
   ValueType kRefType = ref(type_index);
   ValueType kRefNullType = refNull(type_index);
   FunctionSig sig_q_v(1, 0, &kRefType);
-  const byte field_index = 0;
+  const uint8_t field_index = 0;
 
-  const byte kTaken = tester.DefineFunction(
+  const uint8_t kTaken = tester.DefineFunction(
       tester.sigs.i_v(), {kRefNullType, kRefNullType},
       {WASM_LOCAL_SET(
            0, WASM_STRUCT_NEW(type_index, WASM_I32V(52), WASM_I32V(62))),
@@ -453,7 +454,7 @@ WASM_COMPILED_EXEC_TEST(WasmBrOnNonNull) {
                                     WASM_REF_AS_NON_NULL(WASM_LOCAL_GET(1)))),
        kExprEnd});
 
-  const byte kNotTaken = tester.DefineFunction(
+  const uint8_t kNotTaken = tester.DefineFunction(
       tester.sigs.i_v(), {kRefNullType, kRefNullType},
       {WASM_LOCAL_SET(0, WASM_REF_NULL(type_index)),
        WASM_LOCAL_SET(
@@ -473,10 +474,10 @@ WASM_COMPILED_EXEC_TEST(WasmBrOnNonNull) {
 WASM_COMPILED_EXEC_TEST(RefCast) {
   WasmGCTester tester(execution_tier);
 
-  const byte supertype_index = tester.DefineStruct({F(kWasmI32, true)});
-  const byte subtype1_index = tester.DefineStruct(
+  const uint8_t supertype_index = tester.DefineStruct({F(kWasmI32, true)});
+  const uint8_t subtype1_index = tester.DefineStruct(
       {F(kWasmI32, true), F(kWasmF32, false)}, supertype_index);
-  const byte subtype2_index = tester.DefineStruct(
+  const uint8_t subtype2_index = tester.DefineStruct(
       {F(kWasmI32, true), F(kWasmI64, false)}, supertype_index);
   auto super_sig =
       FixedSizeSignature<ValueType>::Params(ValueType::RefNull(subtype1_index))
@@ -487,19 +488,19 @@ WASM_COMPILED_EXEC_TEST(RefCast) {
   auto sub_sig2 =
       FixedSizeSignature<ValueType>::Params(ValueType::RefNull(supertype_index))
           .Returns(ValueType::RefNull(subtype2_index));
-  const byte function_type_index = tester.DefineSignature(&super_sig);
-  const byte function_subtype1_index =
+  const uint8_t function_type_index = tester.DefineSignature(&super_sig);
+  const uint8_t function_subtype1_index =
       tester.DefineSignature(&sub_sig1, function_type_index);
-  const byte function_subtype2_index =
+  const uint8_t function_subtype2_index =
       tester.DefineSignature(&sub_sig2, function_type_index);
-  const byte function_index = tester.DefineFunction(
+  const uint8_t function_index = tester.DefineFunction(
       function_subtype1_index, {},
       {WASM_STRUCT_NEW(subtype1_index, WASM_I32V(10), WASM_F32(20)), WASM_END});
   // Just so this function counts as "declared".
   tester.AddGlobal(ValueType::RefNull(function_type_index), false,
                    WasmInitExpr::RefFuncConst(function_index));
 
-  const byte kTestSuccessful = tester.DefineFunction(
+  const uint8_t kTestSuccessful = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(supertype_index)},
       {WASM_LOCAL_SET(
            0, WASM_STRUCT_NEW(subtype1_index, WASM_I32V(10), WASM_F32(20))),
@@ -507,7 +508,7 @@ WASM_COMPILED_EXEC_TEST(RefCast) {
                        WASM_REF_CAST(WASM_LOCAL_GET(0), subtype1_index)),
        WASM_END});
 
-  const byte kTestFailed = tester.DefineFunction(
+  const uint8_t kTestFailed = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(supertype_index)},
       {WASM_LOCAL_SET(
            0, WASM_STRUCT_NEW(subtype1_index, WASM_I32V(10), WASM_F32(20))),
@@ -515,19 +516,19 @@ WASM_COMPILED_EXEC_TEST(RefCast) {
                        WASM_REF_CAST(WASM_LOCAL_GET(0), subtype2_index)),
        WASM_END});
 
-  const byte kFuncTestSuccessfulSuper = tester.DefineFunction(
+  const uint8_t kFuncTestSuccessfulSuper = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(function_type_index)},
       {WASM_LOCAL_SET(0, WASM_REF_FUNC(function_index)),
        WASM_REF_CAST(WASM_LOCAL_GET(0), function_type_index), WASM_DROP,
        WASM_I32V(0), WASM_END});
 
-  const byte kFuncTestSuccessfulSub = tester.DefineFunction(
+  const uint8_t kFuncTestSuccessfulSub = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(function_type_index)},
       {WASM_LOCAL_SET(0, WASM_REF_FUNC(function_index)),
        WASM_REF_CAST(WASM_LOCAL_GET(0), function_subtype1_index), WASM_DROP,
        WASM_I32V(0), WASM_END});
 
-  const byte kFuncTestFailed = tester.DefineFunction(
+  const uint8_t kFuncTestFailed = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(function_type_index)},
       {WASM_LOCAL_SET(0, WASM_REF_FUNC(function_index)),
        WASM_REF_CAST(WASM_LOCAL_GET(0), function_subtype2_index), WASM_DROP,
@@ -546,11 +547,11 @@ WASM_COMPILED_EXEC_TEST(RefCastNoChecks) {
                         true);
   WasmGCTester tester(execution_tier);
 
-  const byte supertype_index = tester.DefineStruct({F(kWasmI32, true)});
-  const byte subtype1_index = tester.DefineStruct(
+  const uint8_t supertype_index = tester.DefineStruct({F(kWasmI32, true)});
+  const uint8_t subtype1_index = tester.DefineStruct(
       {F(kWasmI32, true), F(kWasmF32, true)}, supertype_index);
 
-  const byte kTestSuccessful = tester.DefineFunction(
+  const uint8_t kTestSuccessful = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(supertype_index)},
       {WASM_LOCAL_SET(0, WASM_STRUCT_NEW_DEFAULT(subtype1_index)),
        WASM_STRUCT_GET(subtype1_index, 0,
@@ -563,10 +564,10 @@ WASM_COMPILED_EXEC_TEST(RefCastNoChecks) {
 
 WASM_COMPILED_EXEC_TEST(BrOnCast) {
   WasmGCTester tester(execution_tier);
-  const byte type_index = tester.DefineStruct({F(kWasmI32, true)});
-  const byte other_type_index = tester.DefineStruct({F(kWasmF32, true)});
+  const uint8_t type_index = tester.DefineStruct({F(kWasmI32, true)});
+  const uint8_t other_type_index = tester.DefineStruct({F(kWasmF32, true)});
 
-  const byte kTestStructStatic = tester.DefineFunction(
+  const uint8_t kTestStructStatic = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmI32, kWasmStructRef},
       {WASM_BLOCK_R(
            ValueType::RefNull(type_index), WASM_LOCAL_SET(0, WASM_I32V(111)),
@@ -575,20 +576,21 @@ WASM_COMPILED_EXEC_TEST(BrOnCast) {
            WASM_LOCAL_SET(1, WASM_STRUCT_NEW(other_type_index, WASM_F32(1.0))),
            WASM_LOCAL_GET(1),
            // The type check fails, so this branch isn't taken.
-           WASM_BR_ON_CAST(0, type_index), WASM_DROP,
+           WASM_BR_ON_CAST(0, kStructRefCode, type_index), WASM_DROP,
 
            WASM_LOCAL_SET(0, WASM_I32V(221)),  // (Final result) - 1
            WASM_LOCAL_SET(1, WASM_STRUCT_NEW(type_index, WASM_I32V(1))),
            WASM_LOCAL_GET(1),
            // This branch is taken.
-           WASM_BR_ON_CAST(0, type_index), WASM_GC_OP(kExprRefCast), type_index,
+           WASM_BR_ON_CAST(0, kStructRefCode, type_index),
+           WASM_GC_OP(kExprRefCast), type_index,
 
            // Not executed due to the branch.
            WASM_LOCAL_SET(0, WASM_I32V(333))),
        WASM_GC_OP(kExprStructGet), type_index, 0, WASM_LOCAL_GET(0),
        kExprI32Add, kExprEnd});
 
-  const byte kTestStructStaticNull = tester.DefineFunction(
+  const uint8_t kTestStructStaticNull = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmI32, kWasmStructRef},
       {WASM_BLOCK_R(
            ValueType::RefNull(type_index), WASM_LOCAL_SET(0, WASM_I32V(111)),
@@ -597,61 +599,62 @@ WASM_COMPILED_EXEC_TEST(BrOnCast) {
            WASM_LOCAL_SET(1, WASM_STRUCT_NEW(other_type_index, WASM_F32(1.0))),
            WASM_LOCAL_GET(1),
            // The type check fails, so this branch isn't taken.
-           WASM_BR_ON_CAST(0, type_index), WASM_DROP,
+           WASM_BR_ON_CAST(0, kStructRefCode, type_index), WASM_DROP,
 
            WASM_LOCAL_SET(0, WASM_I32V(221)),  // (Final result) - 1
            WASM_LOCAL_SET(1, WASM_STRUCT_NEW(type_index, WASM_I32V(1))),
            WASM_LOCAL_GET(1),
            // This branch is taken.
-           WASM_BR_ON_CAST_NULL(0, type_index), WASM_GC_OP(kExprRefCast),
-           type_index,
+           WASM_BR_ON_CAST_NULL(0, kStructRefCode, type_index),
+           WASM_GC_OP(kExprRefCast), type_index,
 
            // Not executed due to the branch.
            WASM_LOCAL_SET(0, WASM_I32V(333))),
        WASM_GC_OP(kExprStructGet), type_index, 0, WASM_LOCAL_GET(0),
        kExprI32Add, kExprEnd});
 
-  const byte kTestNullDeprecated = tester.DefineFunction(
+  const uint8_t kTestNullDeprecated = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmI32, kWasmStructRef},
       {WASM_BLOCK_R(ValueType::RefNull(type_index),
                     WASM_LOCAL_SET(0, WASM_I32V(111)),
                     WASM_LOCAL_GET(1),  // Put a nullref onto the value stack.
                     // Not taken for nullref.
-                    WASM_BR_ON_CAST(0, type_index),
+                    WASM_BR_ON_CAST(0, kStructRefCode, type_index),
                     WASM_GC_OP(kExprRefCastDeprecated), type_index,
 
                     WASM_LOCAL_SET(0, WASM_I32V(222))),  // Final result.
        WASM_DROP, WASM_LOCAL_GET(0), kExprEnd});
 
-  const byte kTestNull = tester.DefineFunction(
+  const uint8_t kTestNull = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmI32, kWasmStructRef},
       {WASM_BLOCK_R(ValueType::RefNull(type_index),
                     WASM_LOCAL_SET(0, WASM_I32V(111)),
                     WASM_LOCAL_GET(1),  // Put a nullref onto the value stack.
                     // Not taken for nullref.
-                    WASM_BR_ON_CAST(0, type_index), WASM_GC_OP(kExprRefCast),
+                    WASM_BR_ON_CAST(0, kStructRefCode, type_index),
+                    WASM_GC_OP(kExprRefCast),
                     type_index),  // Traps
        WASM_DROP, WASM_LOCAL_GET(0), kExprEnd});
 
   // "br_on_cast null" also branches on null, treating it as a successful cast.
-  const byte kTestNullNull = tester.DefineFunction(
+  const uint8_t kTestNullNull = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmI32, kWasmStructRef},
       {WASM_BLOCK_R(ValueType::RefNull(type_index),
                     WASM_LOCAL_SET(0, WASM_I32V(111)),
                     WASM_LOCAL_GET(1),  // Put a nullref onto the value stack.
                     // Taken for nullref with br_on_cast null.
-                    WASM_BR_ON_CAST_NULL(0, type_index),
+                    WASM_BR_ON_CAST_NULL(0, kStructRefCode, type_index),
                     WASM_GC_OP(kExprRefCast), type_index),
        WASM_DROP, WASM_LOCAL_GET(0), kExprEnd});
 
-  const byte kTypedAfterBranch = tester.DefineFunction(
+  const uint8_t kTypedAfterBranch = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmI32, kWasmStructRef},
       {WASM_LOCAL_SET(1, WASM_STRUCT_NEW(type_index, WASM_I32V(42))),
        WASM_BLOCK_I(
            // The inner block should take the early branch with a struct
            // on the stack.
            WASM_BLOCK_R(ValueType::Ref(type_index), WASM_LOCAL_GET(1),
-                        WASM_BR_ON_CAST(0, type_index),
+                        WASM_BR_ON_CAST(0, kStructRefCode, type_index),
                         // Returning 123 is the unreachable failure case.
                         WASM_I32V(123), WASM_BR(1)),
            // The outer block catches the struct left behind by the inner block
@@ -670,8 +673,8 @@ WASM_COMPILED_EXEC_TEST(BrOnCast) {
 
 WASM_COMPILED_EXEC_TEST(BrOnCastFail) {
   WasmGCTester tester(execution_tier);
-  const byte type0 = tester.DefineStruct({F(kWasmI32, true)});
-  const byte type1 =
+  const uint8_t type0 = tester.DefineStruct({F(kWasmI32, true)});
+  const uint8_t type1 =
       tester.DefineStruct({F(kWasmI64, true), F(kWasmI32, true)});
 
   const int field0_value = 5;
@@ -690,38 +693,38 @@ WASM_COMPILED_EXEC_TEST(BrOnCastFail) {
   WASM_LOCAL_SET(0, WASM_SEQ(value)),                                      \
       WASM_BLOCK(                                                          \
           WASM_BLOCK_R(kWasmStructRef, WASM_LOCAL_GET(0),                  \
-                       WASM_BR_ON_CAST_FAIL(0, type0),                     \
+                       WASM_BR_ON_CAST_FAIL(0, kStructRefCode, type0),     \
                        WASM_GC_OP(kExprStructGet), type0, 0, kExprReturn), \
           kExprBrOnNull, 0, WASM_GC_OP(kExprRefCast), type1,               \
           WASM_GC_OP(kExprStructGet), type1, 1, kExprReturn),              \
       WASM_I32V(null_value), kExprEnd
 
-  const byte kBranchTaken = tester.DefineFunction(
+  const uint8_t kBranchTaken = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmStructRef},
       {FUNCTION_BODY(
           WASM_STRUCT_NEW(type1, WASM_I64V(10), WASM_I32V(field1_value)))});
 
-  const byte kBranchNotTaken = tester.DefineFunction(
+  const uint8_t kBranchNotTaken = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmStructRef},
       {FUNCTION_BODY(WASM_STRUCT_NEW(type0, WASM_I32V(field0_value)))});
 
-  const byte kNull =
+  const uint8_t kNull =
       tester.DefineFunction(tester.sigs.i_v(), {kWasmStructRef},
                             {FUNCTION_BODY(WASM_REF_NULL(type0))});
 
-  const byte kUnrelatedTypes = tester.DefineFunction(
+  const uint8_t kUnrelatedTypes = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(type1)},
       {FUNCTION_BODY(
           WASM_STRUCT_NEW(type1, WASM_I64V(10), WASM_I32V(field1_value)))});
 #undef FUNCTION_BODY
 
-  const byte kBranchTakenStatic = tester.DefineFunction(
+  const uint8_t kBranchTakenStatic = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmStructRef},
       {WASM_LOCAL_SET(
            0, WASM_STRUCT_NEW(type1, WASM_I64V(10), WASM_I32V(field1_value))),
        WASM_BLOCK(
            WASM_BLOCK_R(kWasmStructRef, WASM_LOCAL_GET(0),
-                        WASM_BR_ON_CAST_FAIL(0, type0),
+                        WASM_BR_ON_CAST_FAIL(0, kStructRefCode, type0),
                         WASM_GC_OP(kExprStructGet), type0, 0, kExprReturn),
            kExprBrOnNull, 0, WASM_GC_OP(kExprRefCast), type1,
            WASM_GC_OP(kExprStructGet), type1, 1, kExprReturn),
@@ -737,13 +740,14 @@ WASM_COMPILED_EXEC_TEST(BrOnCastFail) {
 
 WASM_COMPILED_EXEC_TEST(WasmRefEq) {
   WasmGCTester tester(execution_tier);
-  byte type_index = tester.DefineStruct({F(kWasmI32, true), F(kWasmI32, true)});
+  uint8_t type_index =
+      tester.DefineStruct({F(kWasmI32, true), F(kWasmI32, true)});
   ValueType kRefTypes[] = {ref(type_index)};
   ValueType kRefNullType = refNull(type_index);
   FunctionSig sig_q_v(1, 0, kRefTypes);
 
-  byte local_index = 0;
-  const byte kFunc = tester.DefineFunction(
+  uint8_t local_index = 0;
+  const uint8_t kFunc = tester.DefineFunction(
       tester.sigs.i_v(), {kRefNullType},
       {WASM_LOCAL_SET(local_index, WASM_STRUCT_NEW(type_index, WASM_I32V(55),
                                                    WASM_I32V(66))),
@@ -775,16 +779,16 @@ WASM_COMPILED_EXEC_TEST(WasmRefEq) {
 WASM_COMPILED_EXEC_TEST(WasmPackedStructU) {
   WasmGCTester tester(execution_tier);
 
-  const byte type_index = tester.DefineStruct(
+  const uint8_t type_index = tester.DefineStruct(
       {F(kWasmI8, true), F(kWasmI16, true), F(kWasmI32, true)});
   ValueType struct_type = refNull(type_index);
 
-  const byte local_index = 0;
+  const uint8_t local_index = 0;
 
   int32_t expected_output_0 = 0x1234;
   int32_t expected_output_1 = -1;
 
-  const byte kF0 = tester.DefineFunction(
+  const uint8_t kF0 = tester.DefineFunction(
       tester.sigs.i_v(), {struct_type},
       {WASM_LOCAL_SET(local_index,
                       WASM_STRUCT_NEW(type_index, WASM_I32V(expected_output_0),
@@ -793,7 +797,7 @@ WASM_COMPILED_EXEC_TEST(WasmPackedStructU) {
        WASM_STRUCT_GET_U(type_index, 0, WASM_LOCAL_GET(local_index)),
        kExprEnd});
 
-  const byte kF1 = tester.DefineFunction(
+  const uint8_t kF1 = tester.DefineFunction(
       tester.sigs.i_v(), {struct_type},
       {WASM_LOCAL_SET(local_index,
                       WASM_STRUCT_NEW(type_index, WASM_I32V(expected_output_0),
@@ -810,16 +814,16 @@ WASM_COMPILED_EXEC_TEST(WasmPackedStructU) {
 WASM_COMPILED_EXEC_TEST(WasmPackedStructS) {
   WasmGCTester tester(execution_tier);
 
-  const byte type_index = tester.DefineStruct(
+  const uint8_t type_index = tester.DefineStruct(
       {F(kWasmI8, true), F(kWasmI16, true), F(kWasmI32, true)});
   ValueType struct_type = refNull(type_index);
 
-  const byte local_index = 0;
+  const uint8_t local_index = 0;
 
   int32_t expected_output_0 = 0x80;
   int32_t expected_output_1 = 42;
 
-  const byte kF0 = tester.DefineFunction(
+  const uint8_t kF0 = tester.DefineFunction(
       tester.sigs.i_v(), {struct_type},
       {WASM_LOCAL_SET(
            local_index,
@@ -828,7 +832,7 @@ WASM_COMPILED_EXEC_TEST(WasmPackedStructS) {
        WASM_STRUCT_GET_S(type_index, 0, WASM_LOCAL_GET(local_index)),
        kExprEnd});
 
-  const byte kF1 = tester.DefineFunction(
+  const uint8_t kF1 = tester.DefineFunction(
       tester.sigs.i_v(), {struct_type},
       {WASM_LOCAL_SET(local_index, WASM_STRUCT_NEW(type_index, WASM_I32V(0x80),
                                                    WASM_I32V(expected_output_1),
@@ -846,16 +850,16 @@ WASM_COMPILED_EXEC_TEST(WasmBasicArray) {
   WasmGCTester tester(execution_tier);
   if (!tester.HasSimdSupport(execution_tier)) return;
 
-  const byte type_index = tester.DefineArray(wasm::kWasmI32, true);
-  const byte fp_type_index = tester.DefineArray(wasm::kWasmF64, true);
-  const byte immut_type_index = tester.DefineArray(wasm::kWasmI32, false);
+  const uint8_t type_index = tester.DefineArray(wasm::kWasmI32, true);
+  const uint8_t fp_type_index = tester.DefineArray(wasm::kWasmF64, true);
+  const uint8_t immut_type_index = tester.DefineArray(wasm::kWasmI32, false);
   ValueType kRefTypes[] = {ref(type_index)};
   FunctionSig sig_q_v(1, 0, kRefTypes);
   ValueType kRefNullType = refNull(type_index);
 
   // f: a = [12, 12, 12]; a[1] = 42; return a[arg0]
-  const byte local_index = 1;
-  const byte kGetElem = tester.DefineFunction(
+  const uint8_t local_index = 1;
+  const uint8_t kGetElem = tester.DefineFunction(
       tester.sigs.i_i(), {kRefNullType},
       {WASM_LOCAL_SET(local_index,
                       WASM_ARRAY_NEW(type_index, WASM_I32V(12), WASM_I32V(3))),
@@ -866,28 +870,28 @@ WASM_COMPILED_EXEC_TEST(WasmBasicArray) {
        kExprEnd});
 
   // Reads and returns an array's length.
-  const byte kGetLength = tester.DefineFunction(
+  const uint8_t kGetLength = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_ARRAY_LEN(WASM_ARRAY_NEW(type_index, WASM_I32V(0), WASM_I32V(42))),
        kExprEnd});
 
   // Create an array of length 2, initialized to [42, 42].
-  const byte kAllocate = tester.DefineFunction(
+  const uint8_t kAllocate = tester.DefineFunction(
       &sig_q_v, {},
       {WASM_ARRAY_NEW(type_index, WASM_I32V(42), WASM_I32V(2)), kExprEnd});
 
-  const byte kAllocateStatic = tester.DefineFunction(
+  const uint8_t kAllocateStatic = tester.DefineFunction(
       &sig_q_v, {},
       {WASM_ARRAY_NEW_DEFAULT(type_index, WASM_I32V(2)), WASM_DROP,
        WASM_ARRAY_NEW(type_index, WASM_I32V(42), WASM_I32V(2)), kExprEnd});
 
-  const byte kInit =
+  const uint8_t kInit =
       tester.DefineFunction(&sig_q_v, {},
                             {WASM_ARRAY_NEW_FIXED(type_index, 3, WASM_I32V(10),
                                                   WASM_I32V(20), WASM_I32V(30)),
                              kExprEnd});
 
-  const byte kImmutable = tester.DefineFunction(
+  const uint8_t kImmutable = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_ARRAY_GET(immut_type_index,
                       WASM_ARRAY_NEW_FIXED(immut_type_index, 2, WASM_I32V(42),
@@ -896,20 +900,20 @@ WASM_COMPILED_EXEC_TEST(WasmBasicArray) {
        kExprEnd});
 
   const uint32_t kLongLength = 1u << 16;
-  const byte kAllocateLarge = tester.DefineFunction(
+  const uint8_t kAllocateLarge = tester.DefineFunction(
       &sig_q_v, {},
       {WASM_ARRAY_NEW_DEFAULT(type_index, WASM_I32V(kLongLength)), kExprEnd});
 
   ArrayType array_type(kWasmI32, true);
   const uint32_t kTooLong = WasmArray::MaxLength(&array_type) + 1;
-  const byte kAllocateTooLarge = tester.DefineFunction(
+  const uint8_t kAllocateTooLarge = tester.DefineFunction(
       &sig_q_v, {},
       {WASM_ARRAY_NEW_DEFAULT(type_index, WASM_I32V(kTooLong)), kExprEnd});
 
   // Tests that fp arrays work properly.
   // f: a = [10.0, 10.0, 10.0]; a[1] = 42.42; return static_cast<int64>(a[1]);
   double result_value = 42.42;
-  const byte kTestFpArray = tester.DefineFunction(
+  const uint8_t kTestFpArray = tester.DefineFunction(
       tester.sigs.i_v(), {refNull(fp_type_index)},
       {WASM_LOCAL_SET(
            0, WASM_ARRAY_NEW(fp_type_index, WASM_F64(10.0), WASM_I32V(3))),
@@ -931,15 +935,15 @@ WASM_COMPILED_EXEC_TEST(WasmBasicArray) {
   tester.CheckResult(kTestFpArray, static_cast<int32_t>(result_value));
 
   Handle<Object> h_result = tester.GetResultObject(kAllocate).ToHandleChecked();
-  CHECK(h_result->IsWasmArray());
+  CHECK(IsWasmArray(*h_result));
   CHECK_EQ(2, Handle<WasmArray>::cast(h_result)->length());
 
   h_result = tester.GetResultObject(kAllocateStatic).ToHandleChecked();
-  CHECK(h_result->IsWasmArray());
+  CHECK(IsWasmArray(*h_result));
   CHECK_EQ(2, Handle<WasmArray>::cast(h_result)->length());
 
   Handle<Object> init_result = tester.GetResultObject(kInit).ToHandleChecked();
-  CHECK(init_result->IsWasmArray());
+  CHECK(IsWasmArray(*init_result));
   CHECK_EQ(3, Handle<WasmArray>::cast(init_result)->length());
   CHECK_EQ(10, Handle<WasmArray>::cast(init_result)->GetElement(0).to_i32());
   CHECK_EQ(20, Handle<WasmArray>::cast(init_result)->GetElement(1).to_i32());
@@ -948,7 +952,7 @@ WASM_COMPILED_EXEC_TEST(WasmBasicArray) {
   MaybeHandle<Object> maybe_large_result =
       tester.GetResultObject(kAllocateLarge);
   Handle<Object> large_result = maybe_large_result.ToHandleChecked();
-  CHECK(large_result->IsWasmArray());
+  CHECK(IsWasmArray(*large_result));
   CHECK(Handle<WasmArray>::cast(large_result)->Size() >
         kMaxRegularHeapObjectSize);
 
@@ -957,15 +961,15 @@ WASM_COMPILED_EXEC_TEST(WasmBasicArray) {
 
 WASM_COMPILED_EXEC_TEST(WasmPackedArrayU) {
   WasmGCTester tester(execution_tier);
-  const byte array_index = tester.DefineArray(kWasmI8, true);
+  const uint8_t array_index = tester.DefineArray(kWasmI8, true);
   ValueType array_type = refNull(array_index);
 
-  const byte param_index = 0;
-  const byte local_index = 1;
+  const uint8_t param_index = 0;
+  const uint8_t local_index = 1;
 
   int32_t expected_output_3 = 258;
 
-  const byte kF = tester.DefineFunction(
+  const uint8_t kF = tester.DefineFunction(
       tester.sigs.i_i(), {array_type},
       {WASM_LOCAL_SET(local_index,
                       WASM_ARRAY_NEW(array_index, WASM_I32V(0), WASM_I32V(4))),
@@ -991,14 +995,14 @@ WASM_COMPILED_EXEC_TEST(WasmPackedArrayU) {
 
 WASM_COMPILED_EXEC_TEST(WasmPackedArrayS) {
   WasmGCTester tester(execution_tier);
-  const byte array_index = tester.DefineArray(kWasmI16, true);
+  const uint8_t array_index = tester.DefineArray(kWasmI16, true);
   ValueType array_type = refNull(array_index);
 
   int32_t array_elements[] = {0x12345678, 10, 0xFEDC, 0xFF1234};
 
-  const byte param_index = 0;
-  const byte local_index = 1;
-  const byte kF = tester.DefineFunction(
+  const uint8_t param_index = 0;
+  const uint8_t local_index = 1;
+  const uint8_t kF = tester.DefineFunction(
       tester.sigs.i_i(), {array_type},
       {WASM_LOCAL_SET(local_index,
                       WASM_ARRAY_NEW(array_index, WASM_I32V(array_elements[0]),
@@ -1025,12 +1029,13 @@ WASM_COMPILED_EXEC_TEST(WasmPackedArrayS) {
 
 WASM_COMPILED_EXEC_TEST(WasmArrayCopy) {
   WasmGCTester tester(execution_tier);
-  const byte array32_index = tester.DefineArray(kWasmI32, true);
-  const byte array16_index = tester.DefineArray(kWasmI16, true);
-  const byte arrayref_index = tester.DefineArray(refNull(array32_index), true);
+  const uint8_t array32_index = tester.DefineArray(kWasmI32, true);
+  const uint8_t array16_index = tester.DefineArray(kWasmI16, true);
+  const uint8_t arrayref_index =
+      tester.DefineArray(refNull(array32_index), true);
 
   // Copies i32 ranges: local1[0..3] to local2[6..9].
-  const byte kCopyI32 = tester.DefineFunction(
+  const uint8_t kCopyI32 = tester.DefineFunction(
       tester.sigs.i_i(), {refNull(array32_index), refNull(array32_index)},
       {WASM_LOCAL_SET(1, WASM_ARRAY_NEW_DEFAULT(array32_index, WASM_I32V(10))),
        WASM_ARRAY_SET(array32_index, WASM_LOCAL_GET(1), WASM_I32V(0),
@@ -1049,7 +1054,7 @@ WASM_COMPILED_EXEC_TEST(WasmArrayCopy) {
        kExprEnd});
 
   // Copies i16 ranges: local1[0..3] to local2[6..9].
-  const byte kCopyI16 = tester.DefineFunction(
+  const uint8_t kCopyI16 = tester.DefineFunction(
       tester.sigs.i_i(), {refNull(array16_index), refNull(array16_index)},
       {WASM_LOCAL_SET(1, WASM_ARRAY_NEW_DEFAULT(array16_index, WASM_I32V(10))),
        WASM_ARRAY_SET(array16_index, WASM_LOCAL_GET(1), WASM_I32V(0),
@@ -1068,7 +1073,7 @@ WASM_COMPILED_EXEC_TEST(WasmArrayCopy) {
        kExprEnd});
 
   // Copies reference ranges: local1[0..3] to local2[6..9].
-  const byte kCopyRef = tester.DefineFunction(
+  const uint8_t kCopyRef = tester.DefineFunction(
       FunctionSig::Build(tester.zone(), {refNull(array32_index)}, {kWasmI32}),
       {refNull(arrayref_index), refNull(arrayref_index)},
       {WASM_LOCAL_SET(1, WASM_ARRAY_NEW_DEFAULT(arrayref_index, WASM_I32V(10))),
@@ -1088,7 +1093,7 @@ WASM_COMPILED_EXEC_TEST(WasmArrayCopy) {
        kExprEnd});
 
   // Copies overlapping reference ranges: local1[0..3] to local1[2..5].
-  const byte kCopyRefOverlapping = tester.DefineFunction(
+  const uint8_t kCopyRefOverlapping = tester.DefineFunction(
       FunctionSig::Build(tester.zone(), {refNull(array32_index)}, {kWasmI32}),
       {refNull(arrayref_index)},
       {WASM_LOCAL_SET(1, WASM_ARRAY_NEW_DEFAULT(arrayref_index, WASM_I32V(10))),
@@ -1106,7 +1111,7 @@ WASM_COMPILED_EXEC_TEST(WasmArrayCopy) {
        WASM_ARRAY_GET(arrayref_index, WASM_LOCAL_GET(1), WASM_LOCAL_GET(0)),
        kExprEnd});
 
-  const byte kOobSource = tester.DefineFunction(
+  const uint8_t kOobSource = tester.DefineFunction(
       tester.sigs.v_v(), {refNull(array32_index), refNull(array32_index)},
       {WASM_LOCAL_SET(0, WASM_ARRAY_NEW_DEFAULT(array32_index, WASM_I32V(10))),
        WASM_LOCAL_SET(1, WASM_ARRAY_NEW_DEFAULT(array32_index, WASM_I32V(10))),
@@ -1115,7 +1120,7 @@ WASM_COMPILED_EXEC_TEST(WasmArrayCopy) {
                        WASM_I32V(4)),
        kExprEnd});
 
-  const byte kOobDestination = tester.DefineFunction(
+  const uint8_t kOobDestination = tester.DefineFunction(
       tester.sigs.v_v(), {refNull(array32_index), refNull(array32_index)},
       {WASM_LOCAL_SET(0, WASM_ARRAY_NEW_DEFAULT(array32_index, WASM_I32V(10))),
        WASM_LOCAL_SET(1, WASM_ARRAY_NEW_DEFAULT(array32_index, WASM_I32V(10))),
@@ -1124,7 +1129,7 @@ WASM_COMPILED_EXEC_TEST(WasmArrayCopy) {
                        WASM_I32V(5)),
        kExprEnd});
 
-  const byte kZeroLength = tester.DefineFunction(
+  const uint8_t kZeroLength = tester.DefineFunction(
       tester.sigs.i_v(), {refNull(arrayref_index), refNull(arrayref_index)},
       {WASM_LOCAL_SET(0, WASM_ARRAY_NEW_DEFAULT(arrayref_index, WASM_I32V(10))),
        WASM_LOCAL_SET(1, WASM_ARRAY_NEW_DEFAULT(arrayref_index, WASM_I32V(10))),
@@ -1150,26 +1155,25 @@ WASM_COMPILED_EXEC_TEST(WasmArrayCopy) {
   {
     Handle<Object> result5 =
         tester.GetResultObject(kCopyRef, 5).ToHandleChecked();
-    CHECK(result5->IsWasmNull());
+    CHECK(IsWasmNull(*result5));
     for (int i = 6; i <= 9; i++) {
       Handle<Object> res =
           tester.GetResultObject(kCopyRef, i).ToHandleChecked();
-      CHECK(res->IsWasmArray());
+      CHECK(IsWasmArray(*res));
       CHECK_EQ(Handle<WasmArray>::cast(res)->length(),
                static_cast<uint32_t>(i));
     }
   }
-  CHECK(tester.GetResultObject(kCopyRefOverlapping, 6)
-            .ToHandleChecked()
-            ->IsWasmNull());
+  CHECK(IsWasmNull(
+      *tester.GetResultObject(kCopyRefOverlapping, 6).ToHandleChecked()));
   Handle<Object> res0 =
       tester.GetResultObject(kCopyRefOverlapping, 0).ToHandleChecked();
-  CHECK(res0->IsWasmArray());
+  CHECK(IsWasmArray(*res0));
   CHECK_EQ(Handle<WasmArray>::cast(res0)->length(), static_cast<uint32_t>(2));
   for (int i = 2; i <= 5; i++) {
     Handle<Object> res =
         tester.GetResultObject(kCopyRefOverlapping, i).ToHandleChecked();
-    CHECK(res->IsWasmArray());
+    CHECK(IsWasmArray(*res));
     CHECK_EQ(Handle<WasmArray>::cast(res)->length(), static_cast<uint32_t>(i));
   }
 
@@ -1183,13 +1187,13 @@ WASM_COMPILED_EXEC_TEST(NewDefault) {
   if (!tester.HasSimdSupport(execution_tier)) return;
 
   tester.builder()->StartRecursiveTypeGroup();
-  const byte struct_type = tester.DefineStruct(
+  const uint8_t struct_type = tester.DefineStruct(
       {F(wasm::kWasmI32, true), F(wasm::kWasmF64, true), F(refNull(0), true)});
   tester.builder()->EndRecursiveTypeGroup();
 
-  const byte array_type = tester.DefineArray(wasm::kWasmI32, true);
+  const uint8_t array_type = tester.DefineArray(wasm::kWasmI32, true);
   // Returns: struct[0] + f64_to_i32(struct[1]) + (struct[2].is_null ^ 1) == 0.
-  const byte allocate_struct = tester.DefineFunction(
+  const uint8_t allocate_struct = tester.DefineFunction(
       tester.sigs.i_v(), {refNull(struct_type)},
       {WASM_LOCAL_SET(0, WASM_STRUCT_NEW_DEFAULT(struct_type)),
        WASM_I32_ADD(
@@ -1200,7 +1204,7 @@ WASM_COMPILED_EXEC_TEST(NewDefault) {
                             WASM_STRUCT_GET(struct_type, 2, WASM_LOCAL_GET(0))),
                         WASM_I32V(1))),
        kExprEnd});
-  const byte allocate_array = tester.DefineFunction(
+  const uint8_t allocate_array = tester.DefineFunction(
       tester.sigs.i_v(), {refNull(array_type)},
       {WASM_LOCAL_SET(0, WASM_ARRAY_NEW_DEFAULT(array_type, WASM_I32V(2))),
        WASM_I32_ADD(
@@ -1216,105 +1220,107 @@ WASM_COMPILED_EXEC_TEST(NewDefault) {
 
 WASM_COMPILED_EXEC_TEST(RefTrivialCastsStatic) {
   WasmGCTester tester(execution_tier);
-  byte type_index = tester.DefineStruct({F(wasm::kWasmI32, true)});
-  byte subtype_index = tester.DefineStruct(
+  uint8_t type_index = tester.DefineStruct({F(wasm::kWasmI32, true)});
+  uint8_t subtype_index = tester.DefineStruct(
       {F(wasm::kWasmI32, true), F(wasm::kWasmS128, true)}, type_index);
   ValueType sig_types[] = {kWasmS128, kWasmI32, kWasmF64};
   FunctionSig sig(1, 2, sig_types);
-  byte sig_index = tester.DefineSignature(&sig);
+  uint8_t sig_index = tester.DefineSignature(&sig);
 
-  const byte kRefTestNullDeprecated = tester.DefineFunction(
+  const uint8_t kRefTestNullDeprecated = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_TEST_DEPRECATED(WASM_REF_NULL(type_index), subtype_index),
        kExprEnd});
   // Upcasts should be optimized away for nominal types.
-  const byte kRefTestUpcastDeprecated = tester.DefineFunction(
+  const uint8_t kRefTestUpcastDeprecated = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_TEST_DEPRECATED(WASM_STRUCT_NEW_DEFAULT(subtype_index),
                                 type_index),
        kExprEnd});
-  const byte kRefTestUpcastNullDeprecated = tester.DefineFunction(
+  const uint8_t kRefTestUpcastNullDeprecated = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_TEST_DEPRECATED(WASM_REF_NULL(subtype_index), type_index),
        kExprEnd});
-  const byte kRefTestUnrelatedNullableDeprecated = tester.DefineFunction(
+  const uint8_t kRefTestUnrelatedNullableDeprecated = tester.DefineFunction(
       tester.sigs.i_v(), {refNull(subtype_index)},
       {WASM_LOCAL_SET(0, WASM_STRUCT_NEW_DEFAULT(subtype_index)),
        WASM_REF_TEST_DEPRECATED(WASM_LOCAL_GET(0), sig_index), kExprEnd});
-  const byte kRefTestUnrelatedNullDeprecated = tester.DefineFunction(
+  const uint8_t kRefTestUnrelatedNullDeprecated = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_TEST_DEPRECATED(WASM_REF_NULL(subtype_index), sig_index),
        kExprEnd});
-  const byte kRefTestUnrelatedNonNullableDeprecated = tester.DefineFunction(
+  const uint8_t kRefTestUnrelatedNonNullableDeprecated = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_TEST_DEPRECATED(WASM_STRUCT_NEW_DEFAULT(type_index), sig_index),
        kExprEnd});
 
-  const byte kRefCastNullDeprecated =
+  const uint8_t kRefCastNullDeprecated =
       tester.DefineFunction(tester.sigs.i_v(), {},
                             {WASM_REF_IS_NULL(WASM_REF_CAST_DEPRECATED(
                                  WASM_REF_NULL(type_index), subtype_index)),
                              kExprEnd});
-  const byte kRefCastNull =
+  const uint8_t kRefCastNull =
       tester.DefineFunction(tester.sigs.i_v(), {},
                             {WASM_REF_IS_NULL(WASM_REF_CAST(
                                  WASM_REF_NULL(type_index), subtype_index)),
                              kExprEnd});
-  const byte kRefCastUpcast = tester.DefineFunction(
+  const uint8_t kRefCastUpcast = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(
            WASM_REF_CAST(WASM_STRUCT_NEW_DEFAULT(subtype_index), type_index)),
        kExprEnd});
-  const byte kRefCastUpcastNullDeprecated =
+  const uint8_t kRefCastUpcastNullDeprecated =
       tester.DefineFunction(tester.sigs.i_v(), {},
                             {WASM_REF_IS_NULL(WASM_REF_CAST_DEPRECATED(
                                  WASM_REF_NULL(subtype_index), type_index)),
                              kExprEnd});
-  const byte kRefCastUpcastNull =
+  const uint8_t kRefCastUpcastNull =
       tester.DefineFunction(tester.sigs.i_v(), {},
                             {WASM_REF_IS_NULL(WASM_REF_CAST(
                                  WASM_REF_NULL(subtype_index), type_index)),
                              kExprEnd});
   // Note: Casting of types from different type hierarchies is only valid for
   // the deprecated cast instruction.
-  const byte kRefCastUnrelatedNullable = tester.DefineFunction(
+  const uint8_t kRefCastUnrelatedNullable = tester.DefineFunction(
       tester.sigs.i_v(), {refNull(subtype_index)},
       {WASM_LOCAL_SET(0, WASM_STRUCT_NEW_DEFAULT(subtype_index)),
        WASM_REF_IS_NULL(WASM_REF_CAST_DEPRECATED(WASM_LOCAL_GET(0), sig_index)),
        kExprEnd});
-  const byte kRefCastUnrelatedNull =
+  const uint8_t kRefCastUnrelatedNull =
       tester.DefineFunction(tester.sigs.i_v(), {},
                             {WASM_REF_IS_NULL(WASM_REF_CAST_DEPRECATED(
                                  WASM_REF_NULL(subtype_index), sig_index)),
                              kExprEnd});
-  const byte kRefCastUnrelatedNonNullable = tester.DefineFunction(
+  const uint8_t kRefCastUnrelatedNonNullable = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_CAST_DEPRECATED(
            WASM_STRUCT_NEW_DEFAULT(type_index), sig_index)),
        kExprEnd});
 
-  const byte kBrOnCastNull = tester.DefineFunction(
+  const uint8_t kBrOnCastNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_R(refNull(subtype_index), WASM_REF_NULL(type_index),
-                    WASM_BR_ON_CAST(0, subtype_index), WASM_DROP,
+                    WASM_BR_ON_CAST(0, type_index, subtype_index), WASM_DROP,
                     WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastUpcast = tester.DefineFunction(
+  // Real upcasts are invalid for br_on_cast. Casting to the same type is
+  // however similar to an upcast.
+  const uint8_t kBrOnCastUpcast = tester.DefineFunction(
       tester.sigs.i_v(), {},
-      {WASM_BLOCK_R(refNull(type_index), WASM_STRUCT_NEW_DEFAULT(subtype_index),
-                    WASM_BR_ON_CAST(0, type_index), WASM_DROP,
+      {WASM_BLOCK_R(refNull(type_index), WASM_STRUCT_NEW_DEFAULT(type_index),
+                    WASM_BR_ON_CAST(0, type_index, type_index), WASM_DROP,
                     WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastUpcastNull = tester.DefineFunction(
+  const uint8_t kBrOnCastUpcastNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
-      {WASM_BLOCK_R(refNull(type_index), WASM_REF_NULL(subtype_index),
-                    WASM_BR_ON_CAST(0, type_index), WASM_DROP,
+      {WASM_BLOCK_R(refNull(type_index), WASM_REF_NULL(type_index),
+                    WASM_BR_ON_CAST(0, type_index, type_index), WASM_DROP,
                     WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastUnrelatedNullable = tester.DefineFunction(
+  const uint8_t kBrOnCastUnrelatedNullable = tester.DefineFunction(
       tester.sigs.i_v(), {refNull(subtype_index)},
       {WASM_LOCAL_SET(0, WASM_STRUCT_NEW_DEFAULT(subtype_index)),
        WASM_BLOCK_R(refNull(sig_index), WASM_LOCAL_GET(0),
@@ -1322,43 +1328,45 @@ WASM_COMPILED_EXEC_TEST(RefTrivialCastsStatic) {
                     WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastUnrelatedNull = tester.DefineFunction(
+  const uint8_t kBrOnCastUnrelatedNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_R(refNull(sig_index), WASM_REF_NULL(subtype_index),
                     WASM_BR_ON_CAST_DEPRECATED(0, sig_index), WASM_DROP,
                     WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastUnrelatedNonNullable = tester.DefineFunction(
+  const uint8_t kBrOnCastUnrelatedNonNullable = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_R(refNull(sig_index), WASM_STRUCT_NEW_DEFAULT(subtype_index),
                     WASM_BR_ON_CAST_DEPRECATED(0, sig_index), WASM_DROP,
                     WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastFailNull = tester.DefineFunction(
+  const uint8_t kBrOnCastFailNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_R(refNull(type_index), WASM_REF_NULL(type_index),
-                    WASM_BR_ON_CAST_FAIL(0, subtype_index), WASM_DROP,
-                    WASM_RETURN(WASM_I32V(0))),
+                    WASM_BR_ON_CAST_FAIL(0, type_index, subtype_index),
+                    WASM_DROP, WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastFailUpcast = tester.DefineFunction(
+  // Real upcasts are invalid for br_on_cast. Casting to the same type is
+  // however similar to an upcast.
+  const uint8_t kBrOnCastFailUpcast = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_R(refNull(subtype_index),
                     WASM_STRUCT_NEW_DEFAULT(subtype_index),
-                    WASM_BR_ON_CAST_FAIL(0, type_index), WASM_DROP,
-                    WASM_RETURN(WASM_I32V(0))),
+                    WASM_BR_ON_CAST_FAIL(0, subtype_index, subtype_index),
+                    WASM_DROP, WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastFailUpcastNull = tester.DefineFunction(
+  const uint8_t kBrOnCastFailUpcastNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_R(refNull(subtype_index), WASM_REF_NULL(subtype_index),
-                    WASM_BR_ON_CAST_FAIL(0, type_index), WASM_DROP,
-                    WASM_RETURN(WASM_I32V(0))),
+                    WASM_BR_ON_CAST_FAIL(0, subtype_index, subtype_index),
+                    WASM_DROP, WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastFailUnrelatedNullable = tester.DefineFunction(
+  const uint8_t kBrOnCastFailUnrelatedNullable = tester.DefineFunction(
       tester.sigs.i_v(), {refNull(subtype_index)},
       {WASM_LOCAL_SET(0, WASM_STRUCT_NEW_DEFAULT(subtype_index)),
        WASM_BLOCK_R(refNull(subtype_index), WASM_LOCAL_GET(0),
@@ -1366,14 +1374,14 @@ WASM_COMPILED_EXEC_TEST(RefTrivialCastsStatic) {
                     WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastFailUnrelatedNull = tester.DefineFunction(
+  const uint8_t kBrOnCastFailUnrelatedNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_R(refNull(subtype_index), WASM_REF_NULL(subtype_index),
                     WASM_BR_ON_CAST_FAIL_DEPRECATED(0, sig_index), WASM_DROP,
                     WASM_RETURN(WASM_I32V(0))),
        WASM_DROP, WASM_I32V(1), WASM_END});
 
-  const byte kBrOnCastFailUnrelatedNonNullable = tester.DefineFunction(
+  const uint8_t kBrOnCastFailUnrelatedNonNullable = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_BLOCK_R(refNull(subtype_index),
                     WASM_STRUCT_NEW_DEFAULT(subtype_index),
@@ -1415,64 +1423,63 @@ WASM_COMPILED_EXEC_TEST(RefTrivialCastsStatic) {
 }
 
 WASM_COMPILED_EXEC_TEST(TrivialAbstractCasts) {
-  // TODO(7748): Add tests for branch_on_*.
   WasmGCTester tester(execution_tier);
-  byte type_index = tester.DefineArray(wasm::kWasmI32, true);
-  byte struct_type_index = tester.DefineStruct({F(wasm::kWasmI32, true)});
+  uint8_t type_index = tester.DefineArray(wasm::kWasmI32, true);
+  uint8_t struct_type_index = tester.DefineStruct({F(wasm::kWasmI32, true)});
   ValueType sig_types[] = {kWasmS128, kWasmI32, kWasmF64};
   FunctionSig sig(1, 2, sig_types);
 
-  const byte kIsArrayNull = tester.DefineFunction(
+  const uint8_t kIsArrayNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_ARRAY(WASM_REF_NULL(kAnyRefCode)), kExprEnd});
-  const byte kIsArrayUpcast = tester.DefineFunction(
+  const uint8_t kIsArrayUpcast = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_ARRAY(WASM_ARRAY_NEW_DEFAULT(type_index, WASM_I32V(10))),
        kExprEnd});
-  const byte kIsArrayUpcastNullable = tester.DefineFunction(
+  const uint8_t kIsArrayUpcastNullable = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(type_index)},
       {WASM_LOCAL_SET(0, WASM_ARRAY_NEW_DEFAULT(type_index, WASM_I32V(10))),
        WASM_REF_IS_ARRAY(WASM_LOCAL_GET(0)), kExprEnd});
-  const byte kIsArrayUpcastNull = tester.DefineFunction(
+  const uint8_t kIsArrayUpcastNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_ARRAY(WASM_REF_NULL(type_index)), kExprEnd});
-  const byte kIsArrayUnrelated = tester.DefineFunction(
+  const uint8_t kIsArrayUnrelated = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(struct_type_index)},
       {WASM_LOCAL_SET(0, WASM_STRUCT_NEW_DEFAULT(struct_type_index)),
        WASM_REF_IS_ARRAY(WASM_LOCAL_GET(0)), kExprEnd});
-  const byte kIsArrayUnrelatedNull = tester.DefineFunction(
+  const uint8_t kIsArrayUnrelatedNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_ARRAY(WASM_REF_NULL(kI31RefCode)), kExprEnd});
-  const byte kIsArrayUnrelatedNonNullable = tester.DefineFunction(
+  const uint8_t kIsArrayUnrelatedNonNullable = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_ARRAY(WASM_I31_NEW(WASM_I32V(10))), kExprEnd});
 
-  const byte kAsArrayNull = tester.DefineFunction(
+  const uint8_t kAsArrayNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_ARRAY(WASM_REF_NULL(kAnyRefCode))),
        kExprEnd});
-  const byte kAsArrayUpcast = tester.DefineFunction(
+  const uint8_t kAsArrayUpcast = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_ARRAY(
            WASM_ARRAY_NEW_DEFAULT(type_index, WASM_I32V(10)))),
        kExprEnd});
-  const byte kAsArrayUpcastNullable = tester.DefineFunction(
+  const uint8_t kAsArrayUpcastNullable = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(type_index)},
       {WASM_LOCAL_SET(0, WASM_ARRAY_NEW_DEFAULT(type_index, WASM_I32V(10))),
        WASM_REF_IS_NULL(WASM_REF_AS_ARRAY(WASM_LOCAL_GET(0))), kExprEnd});
-  const byte kAsArrayUpcastNull = tester.DefineFunction(
+  const uint8_t kAsArrayUpcastNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_ARRAY(WASM_REF_NULL(type_index))),
        kExprEnd});
-  const byte kAsArrayUnrelated = tester.DefineFunction(
+  const uint8_t kAsArrayUnrelated = tester.DefineFunction(
       tester.sigs.i_v(), {ValueType::RefNull(struct_type_index)},
       {WASM_LOCAL_SET(0, WASM_STRUCT_NEW_DEFAULT(struct_type_index)),
        WASM_REF_IS_NULL(WASM_REF_AS_ARRAY(WASM_LOCAL_GET(0))), kExprEnd});
-  const byte kAsArrayUnrelatedNull = tester.DefineFunction(
+  const uint8_t kAsArrayUnrelatedNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_ARRAY(WASM_REF_NULL(kI31RefCode))),
        kExprEnd});
-  const byte kAsArrayUnrelatedNonNullable = tester.DefineFunction(
+  const uint8_t kAsArrayUnrelatedNonNullable = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_ARRAY(WASM_I31_NEW(WASM_I32V(10)))),
        kExprEnd});
@@ -1499,28 +1506,28 @@ WASM_COMPILED_EXEC_TEST(TrivialAbstractCasts) {
 WASM_COMPILED_EXEC_TEST(ArrayNewMap) {
   WasmGCTester tester(execution_tier);
 
-  const byte type_index = tester.DefineArray(kWasmI32, true);
+  const uint8_t type_index = tester.DefineArray(kWasmI32, true);
 
   ValueType array_type = ValueType::Ref(type_index);
   FunctionSig sig(1, 0, &array_type);
-  const byte array_new = tester.DefineFunction(
+  const uint8_t array_new = tester.DefineFunction(
       &sig, {},
       {WASM_ARRAY_NEW(type_index, WASM_I32V(10), WASM_I32V(42)), kExprEnd});
 
   tester.CompileModule();
   Handle<Object> result = tester.GetResultObject(array_new).ToHandleChecked();
-  CHECK(result->IsWasmArray());
+  CHECK(IsWasmArray(*result));
   CHECK_EQ(Handle<WasmArray>::cast(result)->map(),
-           tester.instance()->managed_object_maps().get(type_index));
+           tester.instance()->managed_object_maps()->get(type_index));
 }
 
 WASM_COMPILED_EXEC_TEST(FunctionRefs) {
   WasmGCTester tester(execution_tier);
-  const byte func_index =
+  const uint8_t func_index =
       tester.DefineFunction(tester.sigs.i_v(), {}, {WASM_I32V(42), kExprEnd});
-  const byte sig_index = 0;
+  const uint8_t sig_index = 0;
 
-  const byte other_sig_index = tester.DefineSignature(tester.sigs.d_d());
+  const uint8_t other_sig_index = tester.DefineSignature(tester.sigs.d_d());
 
   // This is just so func_index counts as "declared".
   tester.AddGlobal(ValueType::RefNull(sig_index), false,
@@ -1529,30 +1536,30 @@ WASM_COMPILED_EXEC_TEST(FunctionRefs) {
   ValueType func_type = ValueType::RefNull(sig_index);
   FunctionSig sig_func(1, 0, &func_type);
 
-  const byte cast = tester.DefineFunction(
+  const uint8_t cast = tester.DefineFunction(
       &sig_func, {kWasmFuncRef},
       {WASM_LOCAL_SET(0, WASM_REF_FUNC(func_index)),
        WASM_REF_CAST(WASM_LOCAL_GET(0), sig_index), kExprEnd});
 
-  const byte cast_reference = tester.DefineFunction(
+  const uint8_t cast_reference = tester.DefineFunction(
       &sig_func, {}, {WASM_REF_FUNC(sig_index), kExprEnd});
 
-  const byte test_deprecated = tester.DefineFunction(
+  const uint8_t test_deprecated = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmFuncRef},
       {WASM_LOCAL_SET(0, WASM_REF_FUNC(func_index)),
        WASM_REF_TEST_DEPRECATED(WASM_LOCAL_GET(0), sig_index), kExprEnd});
 
-  const byte test_fail_deprecated = tester.DefineFunction(
+  const uint8_t test_fail_deprecated = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmFuncRef},
       {WASM_LOCAL_SET(0, WASM_REF_FUNC(func_index)),
        WASM_REF_TEST_DEPRECATED(WASM_LOCAL_GET(0), other_sig_index), kExprEnd});
 
-  const byte test = tester.DefineFunction(
+  const uint8_t test = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmFuncRef},
       {WASM_LOCAL_SET(0, WASM_REF_FUNC(func_index)),
        WASM_REF_TEST(WASM_LOCAL_GET(0), sig_index), kExprEnd});
 
-  const byte test_fail = tester.DefineFunction(
+  const uint8_t test_fail = tester.DefineFunction(
       tester.sigs.i_v(), {kWasmFuncRef},
       {WASM_LOCAL_SET(0, WASM_REF_FUNC(func_index)),
        WASM_REF_TEST(WASM_LOCAL_GET(0), other_sig_index), kExprEnd});
@@ -1560,20 +1567,19 @@ WASM_COMPILED_EXEC_TEST(FunctionRefs) {
   tester.CompileModule();
 
   Handle<Object> result_cast = tester.GetResultObject(cast).ToHandleChecked();
-  CHECK(result_cast->IsWasmInternalFunction());
-  Handle<JSFunction> cast_function = Handle<JSFunction>::cast(
-      handle(Handle<WasmInternalFunction>::cast(result_cast)->external(),
-             tester.isolate()));
+  CHECK(IsWasmInternalFunction(*result_cast));
+  Handle<JSFunction> cast_function = WasmInternalFunction::GetOrCreateExternal(
+      Handle<WasmInternalFunction>::cast(result_cast));
 
   Handle<Object> result_cast_reference =
       tester.GetResultObject(cast_reference).ToHandleChecked();
-  CHECK(result_cast_reference->IsWasmInternalFunction());
-  Handle<JSFunction> cast_function_reference = Handle<JSFunction>::cast(handle(
-      Handle<WasmInternalFunction>::cast(result_cast_reference)->external(),
-      tester.isolate()));
+  CHECK(IsWasmInternalFunction(*result_cast_reference));
+  Handle<JSFunction> cast_function_reference =
+      WasmInternalFunction::GetOrCreateExternal(
+          Handle<WasmInternalFunction>::cast(result_cast_reference));
 
-  CHECK_EQ(cast_function->code().InstructionStart(),
-           cast_function_reference->code().InstructionStart());
+  CHECK_EQ(cast_function->code()->instruction_start(),
+           cast_function_reference->code()->instruction_start());
 
   tester.CheckResult(test_deprecated, 1);
   tester.CheckResult(test_fail_deprecated, 0);
@@ -1583,11 +1589,11 @@ WASM_COMPILED_EXEC_TEST(FunctionRefs) {
 
 WASM_COMPILED_EXEC_TEST(CallRef) {
   WasmGCTester tester(execution_tier);
-  byte sig_index = tester.DefineSignature(tester.sigs.i_ii());
-  byte callee = tester.DefineFunction(
+  uint8_t sig_index = tester.DefineSignature(tester.sigs.i_ii());
+  uint8_t callee = tester.DefineFunction(
       sig_index, {},
       {WASM_I32_ADD(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)), kExprEnd});
-  byte caller =
+  uint8_t caller =
       tester.DefineFunction(tester.sigs.i_i(), {},
                             {WASM_CALL_REF(WASM_REF_FUNC(callee), sig_index,
                                            WASM_I32V(42), WASM_LOCAL_GET(0)),
@@ -1624,19 +1630,19 @@ WASM_COMPILED_EXEC_TEST(CallAbstractNullTypeImplicitConversion) {
   for (auto [super_type, sub_type_code] : null_ref_types) {
     CHECK(super_type.is_nullable());
     WasmGCTester tester(execution_tier);
-    byte struct_idx = tester.DefineStruct({F(wasm::kWasmI32, true)});
+    uint8_t struct_idx = tester.DefineStruct({F(wasm::kWasmI32, true)});
     CHECK_EQ(struct_idx, 0);
-    byte array_idx = tester.DefineArray(kWasmI32, true);
+    uint8_t array_idx = tester.DefineArray(kWasmI32, true);
     CHECK_EQ(array_idx, 1);
     FunctionSig dummySig(1, 0, &kWasmI32);
-    byte signature_idx = tester.DefineSignature(&dummySig);
+    uint8_t signature_idx = tester.DefineSignature(&dummySig);
     CHECK_EQ(signature_idx, 2);
 
     ValueType ref_sig_types[] = {kWasmI32, super_type};
     FunctionSig sig_ref(1, 1, ref_sig_types);
-    byte callee = tester.DefineFunction(
+    uint8_t callee = tester.DefineFunction(
         &sig_ref, {}, {WASM_REF_IS_NULL(WASM_LOCAL_GET(0)), kExprEnd});
-    byte caller = tester.DefineFunction(
+    uint8_t caller = tester.DefineFunction(
         tester.sigs.i_v(), {},
         {WASM_CALL_FUNCTION(callee, WASM_REF_NULL(sub_type_code)), kExprEnd});
 
@@ -1647,23 +1653,23 @@ WASM_COMPILED_EXEC_TEST(CallAbstractNullTypeImplicitConversion) {
 
 WASM_COMPILED_EXEC_TEST(CastNullRef) {
   WasmGCTester tester(execution_tier);
-  byte to_non_null = tester.DefineFunction(
+  uint8_t to_non_null = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_NON_NULL(WASM_REF_NULL(kNoneCode))),
        kExprEnd});
-  byte to_array = tester.DefineFunction(
+  uint8_t to_array = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_ARRAY(WASM_REF_NULL(kNoneCode))),
        kExprEnd});
-  byte to_struct = tester.DefineFunction(
+  uint8_t to_struct = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_STRUCT(WASM_REF_NULL(kNoneCode))),
        kExprEnd});
-  byte to_i31 = tester.DefineFunction(
+  uint8_t to_i31 = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_AS_I31(WASM_REF_NULL(kNoneCode))), kExprEnd});
-  byte struct_idx = tester.DefineStruct({F(wasm::kWasmI32, true)});
-  byte to_struct_idx = tester.DefineFunction(
+  uint8_t struct_idx = tester.DefineStruct({F(wasm::kWasmI32, true)});
+  uint8_t to_struct_idx = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_REF_CAST(WASM_REF_NULL(kNoneCode), struct_idx)),
        kExprEnd});
@@ -1679,12 +1685,12 @@ WASM_COMPILED_EXEC_TEST(CastNullRef) {
 
 WASM_COMPILED_EXEC_TEST(CallReftypeParameters) {
   WasmGCTester tester(execution_tier);
-  byte type_index = tester.DefineStruct({F(wasm::kWasmI32, true)});
+  uint8_t type_index = tester.DefineStruct({F(wasm::kWasmI32, true)});
   ValueType kRefType{refNull(type_index)};
   ValueType sig_types[] = {kWasmI32, kRefType, kRefType, kRefType, kRefType,
                            kWasmI32, kWasmI32, kWasmI32, kWasmI32};
   FunctionSig sig(1, 8, sig_types);
-  byte adder = tester.DefineFunction(
+  uint8_t adder = tester.DefineFunction(
       &sig, {},
       {WASM_I32_ADD(
            WASM_STRUCT_GET(type_index, 0, WASM_LOCAL_GET(0)),
@@ -1700,7 +1706,7 @@ WASM_COMPILED_EXEC_TEST(CallReftypeParameters) {
                                         WASM_I32_ADD(WASM_LOCAL_GET(6),
                                                      WASM_LOCAL_GET(7)))))))),
        kExprEnd});
-  byte caller = tester.DefineFunction(
+  uint8_t caller = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_CALL_FUNCTION(adder, WASM_STRUCT_NEW(type_index, WASM_I32V(2)),
                           WASM_STRUCT_NEW(type_index, WASM_I32V(4)),
@@ -1717,35 +1723,35 @@ WASM_COMPILED_EXEC_TEST(CallReftypeParameters) {
 WASM_COMPILED_EXEC_TEST(AbstractTypeChecks) {
   WasmGCTester tester(execution_tier);
 
-  byte array_index = tester.DefineArray(kWasmI32, true);
-  byte struct_index = tester.DefineStruct({F(kWasmI32, true)});
-  byte function_index =
+  uint8_t array_index = tester.DefineArray(kWasmI32, true);
+  uint8_t struct_index = tester.DefineStruct({F(kWasmI32, true)});
+  uint8_t function_index =
       tester.DefineFunction(tester.sigs.v_v(), {}, {kExprEnd});
-  byte sig_index = 2;
+  uint8_t sig_index = 2;
 
   // This is just so func_index counts as "declared".
   tester.AddGlobal(ValueType::RefNull(sig_index), false,
                    WasmInitExpr::RefFuncConst(function_index));
 
-  byte kStructCheckNull = tester.DefineFunction(
+  uint8_t kStructCheckNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_STRUCT(WASM_REF_NULL(kAnyRefCode)), kExprEnd});
-  byte kArrayCheckNull = tester.DefineFunction(
+  uint8_t kArrayCheckNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_ARRAY(WASM_REF_NULL(kAnyRefCode)), kExprEnd});
-  byte kI31CheckNull = tester.DefineFunction(
+  uint8_t kI31CheckNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_I31(WASM_REF_NULL(kAnyRefCode)), kExprEnd});
 
-  byte kStructCastNull =
+  uint8_t kStructCastNull =
       tester.DefineFunction(tester.sigs.i_v(), {},
                             {WASM_REF_AS_STRUCT(WASM_REF_NULL(kAnyRefCode)),
                              WASM_DROP, WASM_I32V(1), kExprEnd});
-  byte kArrayCastNull =
+  uint8_t kArrayCastNull =
       tester.DefineFunction(tester.sigs.i_v(), {},
                             {WASM_REF_AS_ARRAY(WASM_REF_NULL(kAnyRefCode)),
                              WASM_DROP, WASM_I32V(1), kExprEnd});
-  byte kI31CastNull =
+  uint8_t kI31CastNull =
       tester.DefineFunction(tester.sigs.i_v(), {},
                             {WASM_REF_AS_I31(WASM_REF_NULL(kAnyRefCode)),
                              WASM_DROP, WASM_I32V(1), kExprEnd});
@@ -1755,15 +1761,15 @@ WASM_COMPILED_EXEC_TEST(AbstractTypeChecks) {
                         {WASM_LOCAL_SET(0, WASM_SEQ(value)), \
                          WASM_REF_IS_##type(WASM_LOCAL_GET(0)), kExprEnd})
 
-  byte kStructCheckSuccess =
+  uint8_t kStructCheckSuccess =
       TYPE_CHECK(STRUCT, WASM_STRUCT_NEW_DEFAULT(struct_index));
-  byte kStructCheckFailure = TYPE_CHECK(STRUCT, WASM_I31_NEW(WASM_I32V(42)));
-  byte kArrayCheckSuccess =
+  uint8_t kStructCheckFailure = TYPE_CHECK(STRUCT, WASM_I31_NEW(WASM_I32V(42)));
+  uint8_t kArrayCheckSuccess =
       TYPE_CHECK(ARRAY, WASM_ARRAY_NEW_DEFAULT(array_index, WASM_I32V(10)));
-  byte kArrayCheckFailure =
+  uint8_t kArrayCheckFailure =
       TYPE_CHECK(ARRAY, WASM_STRUCT_NEW_DEFAULT(struct_index));
-  byte kI31CheckSuccess = TYPE_CHECK(I31, WASM_I31_NEW(WASM_I32V(42)));
-  byte kI31CheckFailure =
+  uint8_t kI31CheckSuccess = TYPE_CHECK(I31, WASM_I31_NEW(WASM_I32V(42)));
+  uint8_t kI31CheckFailure =
       TYPE_CHECK(I31, WASM_ARRAY_NEW_DEFAULT(array_index, WASM_I32V(10)));
 #undef TYPE_CHECK
 
@@ -1773,14 +1779,14 @@ WASM_COMPILED_EXEC_TEST(AbstractTypeChecks) {
                          WASM_REF_AS_##type(WASM_LOCAL_GET(0)), WASM_DROP, \
                          WASM_I32V(1), kExprEnd})
 
-  byte kStructCastSuccess =
+  uint8_t kStructCastSuccess =
       TYPE_CAST(STRUCT, WASM_STRUCT_NEW_DEFAULT(struct_index));
-  byte kStructCastFailure = TYPE_CAST(STRUCT, WASM_I31_NEW(WASM_I32V(42)));
-  byte kArrayCastSuccess =
+  uint8_t kStructCastFailure = TYPE_CAST(STRUCT, WASM_I31_NEW(WASM_I32V(42)));
+  uint8_t kArrayCastSuccess =
       TYPE_CAST(ARRAY, WASM_ARRAY_NEW_DEFAULT(array_index, WASM_I32V(10)));
-  byte kArrayCastFailure = TYPE_CAST(ARRAY, WASM_I31_NEW(WASM_I32V(42)));
-  byte kI31CastSuccess = TYPE_CAST(I31, WASM_I31_NEW(WASM_I32V(42)));
-  byte kI31CastFailure =
+  uint8_t kArrayCastFailure = TYPE_CAST(ARRAY, WASM_I31_NEW(WASM_I32V(42)));
+  uint8_t kI31CastSuccess = TYPE_CAST(I31, WASM_I31_NEW(WASM_I32V(42)));
+  uint8_t kI31CastFailure =
       TYPE_CAST(I31, WASM_ARRAY_NEW_DEFAULT(array_index, WASM_I32V(10)));
 #undef TYPE_CAST
 
@@ -1795,14 +1801,14 @@ WASM_COMPILED_EXEC_TEST(AbstractTypeChecks) {
                                        WASM_RETURN(WASM_I32V(0)))),         \
        kExprEnd})
 
-  byte kBrOnStructTaken =
+  uint8_t kBrOnStructTaken =
       BR_ON(STRUCT, Struct, WASM_STRUCT_NEW_DEFAULT(struct_index));
-  byte kBrOnStructNotTaken = BR_ON(STRUCT, Struct, WASM_REF_NULL(kNoneCode));
-  byte kBrOnArrayTaken =
+  uint8_t kBrOnStructNotTaken = BR_ON(STRUCT, Struct, WASM_REF_NULL(kNoneCode));
+  uint8_t kBrOnArrayTaken =
       BR_ON(ARRAY, Array, WASM_ARRAY_NEW_DEFAULT(array_index, WASM_I32V(10)));
-  byte kBrOnArrayNotTaken = BR_ON(ARRAY, Array, WASM_I31_NEW(WASM_I32V(42)));
-  byte kBrOnI31Taken = BR_ON(I31, I31, WASM_I31_NEW(WASM_I32V(42)));
-  byte kBrOnI31NotTaken =
+  uint8_t kBrOnArrayNotTaken = BR_ON(ARRAY, Array, WASM_I31_NEW(WASM_I32V(42)));
+  uint8_t kBrOnI31Taken = BR_ON(I31, I31, WASM_I31_NEW(WASM_I32V(42)));
+  uint8_t kBrOnI31NotTaken =
       BR_ON(I31, I31, WASM_ARRAY_NEW_DEFAULT(array_index, WASM_I32V(10)));
 #undef BR_ON
 
@@ -1817,16 +1823,17 @@ WASM_COMPILED_EXEC_TEST(AbstractTypeChecks) {
                                        WASM_RETURN(WASM_I32V(1)))),    \
        kExprEnd})
 
-  byte kBrOnNonStructNotTaken =
+  uint8_t kBrOnNonStructNotTaken =
       BR_ON_NON(STRUCT, Struct, WASM_STRUCT_NEW_DEFAULT(struct_index));
-  byte kBrOnNonStructTaken =
+  uint8_t kBrOnNonStructTaken =
       BR_ON_NON(STRUCT, Struct, WASM_REF_NULL(kNoneCode));
-  byte kBrOnNonArrayNotTaken = BR_ON_NON(
+  uint8_t kBrOnNonArrayNotTaken = BR_ON_NON(
       ARRAY, Array, WASM_ARRAY_NEW_DEFAULT(array_index, WASM_I32V(10)));
-  byte kBrOnNonArrayTaken =
+  uint8_t kBrOnNonArrayTaken =
       BR_ON_NON(ARRAY, Array, WASM_I31_NEW(WASM_I32V(42)));
-  byte kBrOnNonI31NotTaken = BR_ON_NON(I31, I31, WASM_I31_NEW(WASM_I32V(42)));
-  byte kBrOnNonI31Taken =
+  uint8_t kBrOnNonI31NotTaken =
+      BR_ON_NON(I31, I31, WASM_I31_NEW(WASM_I32V(42)));
+  uint8_t kBrOnNonI31Taken =
       BR_ON_NON(I31, I31, WASM_ARRAY_NEW_DEFAULT(array_index, WASM_I32V(10)));
 #undef BR_ON_NON
 
@@ -1875,20 +1882,20 @@ WASM_COMPILED_EXEC_TEST(AbstractTypeChecks) {
 // be modified (made to run longer) to measure performance of casts.
 WASM_COMPILED_EXEC_TEST(CastsBenchmark) {
   WasmGCTester tester(execution_tier);
-  const byte SuperType = tester.DefineStruct({F(wasm::kWasmI32, true)});
-  const byte SubType = tester.DefineStruct(
+  const uint8_t SuperType = tester.DefineStruct({F(wasm::kWasmI32, true)});
+  const uint8_t SubType = tester.DefineStruct(
       {F(wasm::kWasmI32, true), F(wasm::kWasmI32, true)}, SuperType);
 
-  const byte ListType = tester.DefineArray(kWasmStructRef, true);
+  const uint8_t ListType = tester.DefineArray(kWasmStructRef, true);
 
-  const byte List =
+  const uint8_t List =
       tester.AddGlobal(ValueType::RefNull(ListType), true,
                        WasmInitExpr::RefNullConst(
                            static_cast<HeapType::Representation>(ListType)));
 
   const uint32_t kListLength = 1024;
   const uint32_t i = 0;
-  const byte Prepare = tester.DefineFunction(
+  const uint8_t Prepare = tester.DefineFunction(
       tester.sigs.i_v(), {wasm::kWasmI32},
       {// List = new eqref[kListLength];
        WASM_GLOBAL_SET(
@@ -1917,7 +1924,7 @@ WASM_COMPILED_EXEC_TEST(CastsBenchmark) {
   const uint32_t list = 2;
   const uint32_t kLoops = 2;
   const uint32_t kIterations = kLoops * kListLength;
-  const byte Main = tester.DefineFunction(
+  const uint8_t Main = tester.DefineFunction(
       tester.sigs.i_v(),
       {
           wasm::kWasmI32,
@@ -1960,12 +1967,12 @@ WASM_COMPILED_EXEC_TEST(CastsBenchmark) {
 
 WASM_COMPILED_EXEC_TEST(GlobalInitReferencingGlobal) {
   WasmGCTester tester(execution_tier);
-  const byte from = tester.AddGlobal(kWasmI32, false, WasmInitExpr(42));
-  const byte to =
+  const uint8_t from = tester.AddGlobal(kWasmI32, false, WasmInitExpr(42));
+  const uint8_t to =
       tester.AddGlobal(kWasmI32, false, WasmInitExpr::GlobalGet(from));
 
-  const byte func = tester.DefineFunction(tester.sigs.i_v(), {},
-                                          {WASM_GLOBAL_GET(to), kExprEnd});
+  const uint8_t func = tester.DefineFunction(tester.sigs.i_v(), {},
+                                             {WASM_GLOBAL_GET(to), kExprEnd});
 
   tester.CompileModule();
 
@@ -1976,46 +1983,47 @@ WASM_COMPILED_EXEC_TEST(GCTables) {
   WasmGCTester tester(execution_tier);
 
   tester.builder()->StartRecursiveTypeGroup();
-  byte super_struct = tester.DefineStruct({F(kWasmI32, false)});
-  byte sub_struct = tester.DefineStruct({F(kWasmI32, false), F(kWasmI32, true)},
-                                        super_struct);
+  uint8_t super_struct = tester.DefineStruct({F(kWasmI32, false)});
+  uint8_t sub_struct = tester.DefineStruct(
+      {F(kWasmI32, false), F(kWasmI32, true)}, super_struct);
   FunctionSig* super_sig =
       FunctionSig::Build(tester.zone(), {kWasmI32}, {refNull(sub_struct)});
-  byte super_sig_index = tester.DefineSignature(super_sig);
+  uint8_t super_sig_index = tester.DefineSignature(super_sig);
   FunctionSig* sub_sig =
       FunctionSig::Build(tester.zone(), {kWasmI32}, {refNull(super_struct)});
-  byte sub_sig_index = tester.DefineSignature(sub_sig, super_sig_index);
-  byte unrelated_sig_index = tester.DefineSignature(sub_sig, super_sig_index);
+  uint8_t sub_sig_index = tester.DefineSignature(sub_sig, super_sig_index);
+  uint8_t unrelated_sig_index =
+      tester.DefineSignature(sub_sig, super_sig_index);
   tester.builder()->EndRecursiveTypeGroup();
 
   tester.DefineTable(refNull(super_sig_index), 10, 10);
 
-  byte super_func = tester.DefineFunction(
+  uint8_t super_func = tester.DefineFunction(
       super_sig_index, {},
       {WASM_I32_ADD(WASM_STRUCT_GET(sub_struct, 0, WASM_LOCAL_GET(0)),
                     WASM_STRUCT_GET(sub_struct, 1, WASM_LOCAL_GET(0))),
        WASM_END});
 
-  byte sub_func = tester.DefineFunction(
+  uint8_t sub_func = tester.DefineFunction(
       sub_sig_index, {},
       {WASM_STRUCT_GET(super_struct, 0, WASM_LOCAL_GET(0)), WASM_END});
 
-  byte setup_func = tester.DefineFunction(
+  uint8_t setup_func = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_TABLE_SET(0, WASM_I32V(0), WASM_REF_NULL(super_sig_index)),
        WASM_TABLE_SET(0, WASM_I32V(1), WASM_REF_FUNC(super_func)),
        WASM_TABLE_SET(0, WASM_I32V(2), WASM_REF_FUNC(sub_func)),  // --
        WASM_I32V(0), WASM_END});
 
-  byte super_struct_producer = tester.DefineFunction(
+  uint8_t super_struct_producer = tester.DefineFunction(
       FunctionSig::Build(tester.zone(), {ref(super_struct)}, {}), {},
       {WASM_STRUCT_NEW(super_struct, WASM_I32V(-5)), WASM_END});
-  byte sub_struct_producer = tester.DefineFunction(
+  uint8_t sub_struct_producer = tester.DefineFunction(
       FunctionSig::Build(tester.zone(), {ref(sub_struct)}, {}), {},
       {WASM_STRUCT_NEW(sub_struct, WASM_I32V(7), WASM_I32V(11)), WASM_END});
 
   // Calling a null entry should trap.
-  byte call_null = tester.DefineFunction(
+  uint8_t call_null = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_CALL_INDIRECT(super_sig_index,
                           WASM_CALL_FUNCTION0(sub_struct_producer),
@@ -2023,7 +2031,7 @@ WASM_COMPILED_EXEC_TEST(GCTables) {
        WASM_END});
   // Calling with a signature identical to the type of the table should work,
   // provided the entry has the same signature.
-  byte call_same_type = tester.DefineFunction(
+  uint8_t call_same_type = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_CALL_INDIRECT(super_sig_index,
                           WASM_CALL_FUNCTION0(sub_struct_producer),
@@ -2031,7 +2039,7 @@ WASM_COMPILED_EXEC_TEST(GCTables) {
        WASM_END});
   // Calling with a signature that is a subtype of the type of the table should
   // work, provided the entry has the same signature.
-  byte call_subtype = tester.DefineFunction(
+  uint8_t call_subtype = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_CALL_INDIRECT(sub_sig_index,
                           WASM_CALL_FUNCTION0(super_struct_producer),
@@ -2039,7 +2047,7 @@ WASM_COMPILED_EXEC_TEST(GCTables) {
        WASM_END});
   // Calling with a signature that is a subtype of the type of the table should
   // work, provided the entry has a subtype of the declared signature.
-  byte call_table_subtype_entry_subtype = tester.DefineFunction(
+  uint8_t call_table_subtype_entry_subtype = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_CALL_INDIRECT(super_sig_index,
                           WASM_CALL_FUNCTION0(sub_struct_producer),
@@ -2047,14 +2055,14 @@ WASM_COMPILED_EXEC_TEST(GCTables) {
        WASM_END});
   // Calling with a signature that is mismatched to that of the entry should
   // trap.
-  byte call_type_mismatch = tester.DefineFunction(
+  uint8_t call_type_mismatch = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_CALL_INDIRECT(unrelated_sig_index,
                           WASM_CALL_FUNCTION0(super_struct_producer),
                           WASM_I32V(2)),
        WASM_END});
   // Getting a table element and then calling it with call_ref should work.
-  byte table_get_and_call_ref = tester.DefineFunction(
+  uint8_t table_get_and_call_ref = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_CALL_REF(WASM_TABLE_GET(0, WASM_I32V(2)), super_sig_index,
                      WASM_CALL_FUNCTION0(sub_struct_producer)),
@@ -2079,7 +2087,7 @@ WASM_COMPILED_EXEC_TEST(GCTables) {
 
 WASM_COMPILED_EXEC_TEST(JsAccess) {
   WasmGCTester tester(execution_tier);
-  const byte type_index = tester.DefineStruct({F(wasm::kWasmI32, true)});
+  const uint8_t type_index = tester.DefineStruct({F(wasm::kWasmI32, true)});
   ValueType kRefType = ref(type_index);
   ValueType kSupertypeToI[] = {kWasmI32, kWasmStructRef};
   FunctionSig sig_t_v(1, 0, &kRefType);
@@ -2120,7 +2128,7 @@ WASM_COMPILED_EXEC_TEST(JsAccess) {
                                    try_catch.Message()->Get()));
     }
     Handle<Object> result = maybe_result.ToHandleChecked();
-    CHECK(result->IsSmi());
+    CHECK(IsSmi(*result));
     CHECK_EQ(42, Smi::cast(*result).value());
     // Calling {consumer} with any other object (e.g. the Smi we just got as
     // {result}) should trap.
@@ -2138,7 +2146,7 @@ WASM_COMPILED_EXEC_TEST(JsAccess) {
 WASM_COMPILED_EXEC_TEST(WasmExternInternalize) {
   WasmGCTester tester(execution_tier);
 
-  const byte kNull = tester.DefineFunction(
+  const uint8_t kNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_GC_INTERNALIZE(WASM_REF_NULL(kNoExternCode))),
        kExprEnd});
@@ -2150,7 +2158,7 @@ WASM_COMPILED_EXEC_TEST(WasmExternInternalize) {
 WASM_COMPILED_EXEC_TEST(WasmExternExternalize) {
   WasmGCTester tester(execution_tier);
 
-  const byte kNull = tester.DefineFunction(
+  const uint8_t kNull = tester.DefineFunction(
       tester.sigs.i_v(), {},
       {WASM_REF_IS_NULL(WASM_GC_EXTERNALIZE(WASM_REF_NULL(kNoneCode))),
        kExprEnd});
diff --git a/deps/v8/test/cctest/wasm/test-grow-memory.cc b/deps/v8/test/cctest/wasm/test-grow-memory.cc
index b796e8ff9ac48c..a928c201a8721a 100644
--- a/deps/v8/test/cctest/wasm/test-grow-memory.cc
+++ b/deps/v8/test/cctest/wasm/test-grow-memory.cc
@@ -44,7 +44,8 @@ TEST(GrowMemDetaches) {
     Isolate* isolate = CcTest::InitIsolateOnce();
     HandleScope scope(isolate);
     Handle<WasmMemoryObject> memory_object =
-        WasmMemoryObject::New(isolate, 16, 100, SharedFlag::kNotShared)
+        WasmMemoryObject::New(isolate, 16, 100, SharedFlag::kNotShared,
+                              WasmMemoryFlag::kWasmMemory32)
             .ToHandleChecked();
     Handle<JSArrayBuffer> buffer(memory_object->array_buffer(), isolate);
     int32_t result = WasmMemoryObject::Grow(isolate, memory_object, 0);
@@ -60,7 +61,8 @@ TEST(Externalized_GrowMemMemSize) {
     Isolate* isolate = CcTest::InitIsolateOnce();
     HandleScope scope(isolate);
     Handle<WasmMemoryObject> memory_object =
-        WasmMemoryObject::New(isolate, 16, 100, SharedFlag::kNotShared)
+        WasmMemoryObject::New(isolate, 16, 100, SharedFlag::kNotShared,
+                              WasmMemoryFlag::kWasmMemory32)
             .ToHandleChecked();
     ManuallyExternalizedBuffer external(
         handle(memory_object->array_buffer(), isolate));
@@ -83,8 +85,8 @@ TEST(Run_WasmModule_Buffer_Externalized_GrowMem) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_MEMORY_GROW(WASM_I32V_1(6)), WASM_DROP,
-                   WASM_MEMORY_SIZE};
+    uint8_t code[] = {WASM_MEMORY_GROW(WASM_I32V_1(6)), WASM_DROP,
+                      WASM_MEMORY_SIZE};
     EMIT_CODE_WITH_END(f, code);
 
     ZoneBuffer buffer(&zone);
@@ -95,7 +97,7 @@ TEST(Run_WasmModule_Buffer_Externalized_GrowMem) {
         CompileAndInstantiateForTesting(
             isolate, &thrower, ModuleWireBytes(buffer.begin(), buffer.end()))
             .ToHandleChecked();
-    Handle<WasmMemoryObject> memory_object(instance->memory_object(), isolate);
+    Handle<WasmMemoryObject> memory_object{instance->memory_object(0), isolate};
 
     // Fake the Embedder flow by externalizing the array buffer.
     ManuallyExternalizedBuffer external1(
diff --git a/deps/v8/test/cctest/wasm/test-jump-table-assembler.cc b/deps/v8/test/cctest/wasm/test-jump-table-assembler.cc
index 0453464c0880da..0d39528795f2de 100644
--- a/deps/v8/test/cctest/wasm/test-jump-table-assembler.cc
+++ b/deps/v8/test/cctest/wasm/test-jump-table-assembler.cc
@@ -38,7 +38,7 @@ constexpr uint32_t kJumpTableSize =
 // V8 is known to support. Arm64 linux can support up to 64k at runtime.
 constexpr size_t kThunkBufferSize = 64 * KB;
 
-#if V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_X64
+#if V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_LOONG64
 // We need the branches (from CompileJumpTableThunk) to be within near-call
 // range of the jump table slots. The address hint to AllocateAssemblerBuffer
 // is not reliable enough to guarantee that we can always achieve this with
@@ -57,10 +57,10 @@ constexpr uint32_t kBufferSlotStartOffset = 0;
 #endif
 
 Address AllocateJumpTableThunk(
-    Address jump_target, byte* thunk_slot_buffer,
+    Address jump_target, uint8_t* thunk_slot_buffer,
     std::bitset<kAvailableBufferSlots>* used_slots,
     std::vector<std::unique_ptr<TestingAssemblerBuffer>>* thunk_buffers) {
-#if V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_X64
+#if V8_TARGET_ARCH_ARM64 || V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_LOONG64
   // To guarantee that the branch range lies within the near-call range,
   // generate the thunk in the same (kMaxWasmCodeSpaceSize-sized) buffer as the
   // jump_target itself.
@@ -203,7 +203,6 @@ class JumpTablePatcher : public v8::base::Thread {
         jump_table_mutex_(jump_table_mutex) {}
 
   void Run() override {
-    RwxMemoryWriteScope::SetDefaultPermissionsForNewThread();
     TRACE("Patcher %p is starting ...\n", this);
     RwxMemoryWriteScopeForTesting rwx_write_scope;
     Address slot_address =
@@ -252,7 +251,7 @@ TEST(JumpTablePatchingStress) {
   static_assert(kAssemblerBufferSize >= kJumpTableSize);
   auto buffer = AllocateAssemblerBuffer(kAssemblerBufferSize, nullptr,
                                         JitPermission::kMapAsJittable);
-  byte* thunk_slot_buffer = buffer->start() + kBufferSlotStartOffset;
+  uint8_t* thunk_slot_buffer = buffer->start() + kBufferSlotStartOffset;
 
   std::bitset<kAvailableBufferSlots> used_thunk_slots;
   buffer->MakeWritableAndExecutable();
diff --git a/deps/v8/test/cctest/wasm/test-liftoff-for-fuzzing.cc b/deps/v8/test/cctest/wasm/test-liftoff-for-fuzzing.cc
index 205e981ee72aa5..786a916f5855a9 100644
--- a/deps/v8/test/cctest/wasm/test-liftoff-for-fuzzing.cc
+++ b/deps/v8/test/cctest/wasm/test-liftoff-for-fuzzing.cc
@@ -43,7 +43,7 @@ TEST(NondeterminismUnopF64) {
 TEST(NondeterminismUnopF32x4AllNaN) {
   WasmRunner<int32_t, float> r(TestExecutionTier::kLiftoffForFuzzing);
 
-  byte value = 0;
+  uint8_t value = 0;
   r.Build({WASM_SIMD_UNOP(kExprF32x4Ceil,
                           WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value))),
            kExprDrop, WASM_ONE});
@@ -55,7 +55,7 @@ TEST(NondeterminismUnopF32x4AllNaN) {
 }
 
 TEST(NondeterminismUnopF32x4OneNaN) {
-  for (byte lane = 0; lane < 4; ++lane) {
+  for (uint8_t lane = 0; lane < 4; ++lane) {
     WasmRunner<int32_t, float> r(TestExecutionTier::kLiftoffForFuzzing);
     r.Build({WASM_SIMD_F32x4_SPLAT(WASM_F32(0)), WASM_LOCAL_GET(0),
              WASM_SIMD_OP(kExprF32x4ReplaceLane), lane,
@@ -71,7 +71,7 @@ TEST(NondeterminismUnopF32x4OneNaN) {
 TEST(NondeterminismUnopF64x2AllNaN) {
   WasmRunner<int32_t, double> r(TestExecutionTier::kLiftoffForFuzzing);
 
-  byte value = 0;
+  uint8_t value = 0;
   r.Build({WASM_SIMD_UNOP(kExprF64x2Ceil,
                           WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(value))),
            kExprDrop, WASM_ONE});
@@ -83,7 +83,7 @@ TEST(NondeterminismUnopF64x2AllNaN) {
 }
 
 TEST(NondeterminismUnopF64x2OneNaN) {
-  for (byte lane = 0; lane < 2; ++lane) {
+  for (uint8_t lane = 0; lane < 2; ++lane) {
     WasmRunner<int32_t, double> r(TestExecutionTier::kLiftoffForFuzzing);
     r.Build({WASM_SIMD_F64x2_SPLAT(WASM_F64(0)), WASM_LOCAL_GET(0),
              WASM_SIMD_OP(kExprF64x2ReplaceLane), lane,
diff --git a/deps/v8/test/cctest/wasm/test-liftoff-inspection.cc b/deps/v8/test/cctest/wasm/test-liftoff-inspection.cc
index 96f06d77864d82..56e7fd845374a8 100644
--- a/deps/v8/test/cctest/wasm/test-liftoff-inspection.cc
+++ b/deps/v8/test/cctest/wasm/test-liftoff-inspection.cc
@@ -21,8 +21,7 @@ class LiftoffCompileEnvironment {
       : isolate_(CcTest::InitIsolateOnce()),
         handle_scope_(isolate_),
         zone_(isolate_->allocator(), ZONE_NAME),
-        wasm_runner_(nullptr, kWasmOrigin, TestExecutionTier::kLiftoff, 0,
-                     kRuntimeExceptionSupport) {
+        wasm_runner_(nullptr, kWasmOrigin, TestExecutionTier::kLiftoff, 0) {
     // Add a table of length 1, for indirect calls.
     wasm_runner_.builder().AddIndirectFunctionTable(nullptr, 1);
     // Set tiered down such that we generate debugging code.
@@ -118,8 +117,8 @@ class LiftoffCompileEnvironment {
 
   FunctionSig* AddSig(std::initializer_list<ValueType> return_types,
                       std::initializer_list<ValueType> param_types) {
-    ValueType* storage =
-        zone_.NewArray<ValueType>(return_types.size() + param_types.size());
+    ValueType* storage = zone_.AllocateArray<ValueType>(return_types.size() +
+                                                        param_types.size());
     std::copy(return_types.begin(), return_types.end(), storage);
     std::copy(param_types.begin(), param_types.end(),
               storage + return_types.size());
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-64.cc b/deps/v8/test/cctest/wasm/test-run-wasm-64.cc
index 5cb74db51c9224..b4adab1d275cbb 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-64.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-64.cc
@@ -1176,14 +1176,14 @@ WASM_EXEC_TEST(Call_Int64Sub) {
 }
 
 WASM_EXEC_TEST(LoadStoreI64_sx) {
-  byte loads[] = {kExprI64LoadMem8S, kExprI64LoadMem16S, kExprI64LoadMem32S,
-                  kExprI64LoadMem};
+  uint8_t loads[] = {kExprI64LoadMem8S, kExprI64LoadMem16S, kExprI64LoadMem32S,
+                     kExprI64LoadMem};
 
   for (size_t m = 0; m < arraysize(loads); m++) {
     WasmRunner<int64_t> r(execution_tier);
-    byte* memory = r.builder().AddMemoryElems<byte>(kWasmPageSize);
+    uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
 
-    byte code[] = {
+    uint8_t code[] = {
         kExprI32Const,    8,  // --
         kExprI32Const,    0,  // --
         loads[m],             // --
@@ -1204,13 +1204,13 @@ WASM_EXEC_TEST(LoadStoreI64_sx) {
     for (int i = -1; i >= -128; i -= 11) {
       int size = 1 << m;
       r.builder().BlankMemory();
-      memory[size - 1] = static_cast<byte>(i);  // set the high order byte.
+      memory[size - 1] = static_cast<uint8_t>(i);  // set the high order byte.
 
       int64_t expected = static_cast<uint64_t>(static_cast<int64_t>(i))
                          << ((size - 1) * 8);
 
       CHECK_EQ(expected, r.Call());
-      CHECK_EQ(static_cast<byte>(i), memory[8 + size - 1]);
+      CHECK_EQ(static_cast<uint8_t>(i), memory[8 + size - 1]);
       for (int j = size; j < 8; j++) {
         CHECK_EQ(255, memory[8 + j]);
       }
@@ -1279,7 +1279,7 @@ WASM_EXEC_TEST(LoadMemI64) {
 }
 
 WASM_EXEC_TEST(LoadMemI64_alignment) {
-  for (byte alignment = 0; alignment <= 3; alignment++) {
+  for (uint8_t alignment = 0; alignment <= 3; alignment++) {
     WasmRunner<int64_t> r(execution_tier);
     int64_t* memory =
         r.builder().AddMemoryElems<int64_t>(kWasmPageSize / sizeof(int64_t));
@@ -1304,7 +1304,7 @@ WASM_EXEC_TEST(MemI64_Sum) {
   WasmRunner<uint64_t, int32_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  const byte kSum = r.AllocateLocal(kWasmI64);
+  const uint8_t kSum = r.AllocateLocal(kWasmI64);
 
   r.Build(
       {WASM_WHILE(
@@ -1332,7 +1332,7 @@ WASM_EXEC_TEST(MemI64_Sum) {
 WASM_EXEC_TEST(StoreMemI64_alignment) {
   const int64_t kWritten = 0x12345678ABCD0011ll;
 
-  for (byte i = 0; i <= 3; i++) {
+  for (uint8_t i = 0; i <= 3; i++) {
     WasmRunner<int64_t, int64_t> r(execution_tier);
     int64_t* memory =
         r.builder().AddMemoryElems<int64_t>(kWasmPageSize / sizeof(int64_t));
@@ -1409,14 +1409,14 @@ WASM_EXEC_TEST(StoreMem_offset_oob_i64) {
 
   for (size_t m = 0; m < arraysize(machineTypes); m++) {
     WasmRunner<int32_t, uint32_t> r(execution_tier);
-    byte* memory = r.builder().AddMemoryElems<byte>(num_bytes);
+    uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(num_bytes);
     r.builder().RandomizeMemory(1119 + static_cast<int>(m));
 
     r.Build({WASM_STORE_MEM_OFFSET(machineTypes[m], 8, WASM_LOCAL_GET(0),
                                    WASM_LOAD_MEM(machineTypes[m], WASM_ZERO)),
              WASM_ZERO});
 
-    byte memsize = machineTypes[m].MemSize();
+    uint8_t memsize = machineTypes[m].MemSize();
     uint32_t boundary = num_bytes - 8 - memsize;
     CHECK_EQ(0, r.Call(boundary));  // in bounds.
     CHECK_EQ(0, memcmp(&memory[0], &memory[8 + boundary], memsize));
@@ -1428,8 +1428,8 @@ WASM_EXEC_TEST(StoreMem_offset_oob_i64) {
 }
 
 WASM_EXEC_TEST(Store_i64_narrowed) {
-  constexpr byte kOpcodes[] = {kExprI64StoreMem8, kExprI64StoreMem16,
-                               kExprI64StoreMem32, kExprI64StoreMem};
+  constexpr uint8_t kOpcodes[] = {kExprI64StoreMem8, kExprI64StoreMem16,
+                                  kExprI64StoreMem32, kExprI64StoreMem};
   int stored_size_in_bytes = 0;
   for (auto opcode : kOpcodes) {
     stored_size_in_bytes = std::max(1, stored_size_in_bytes * 2);
@@ -1477,7 +1477,7 @@ static void CompileCallIndirectMany(TestExecutionTier tier, ValueType param) {
   // Make sure we don't run out of registers when compiling indirect calls
   // with many many parameters.
   TestSignatures sigs;
-  for (byte num_params = 0; num_params < 40; num_params++) {
+  for (uint8_t num_params = 0; num_params < 40; num_params++) {
     WasmRunner<void> r(tier);
     FunctionSig* sig = sigs.many(r.zone(), kWasmVoid, param, num_params);
 
@@ -1487,8 +1487,8 @@ static void CompileCallIndirectMany(TestExecutionTier tier, ValueType param) {
 
     WasmFunctionCompiler& t = r.NewFunction(sig);
 
-    std::vector<byte> code;
-    for (byte p = 0; p < num_params; p++) {
+    std::vector<uint8_t> code;
+    for (uint8_t p = 0; p < num_params; p++) {
       ADD_CODE(code, kExprLocalGet, p);
     }
     ADD_CODE(code, kExprI32Const, 0);
@@ -1537,7 +1537,7 @@ static void Run_WasmMixedCall_N(TestExecutionTier execution_tier, int start) {
     // =========================================================================
     // Build the calling function.
     // =========================================================================
-    std::vector<byte> code;
+    std::vector<uint8_t> code;
 
     // Load the arguments.
     for (int i = 0; i < num_params; i++) {
@@ -1549,7 +1549,7 @@ static void Run_WasmMixedCall_N(TestExecutionTier execution_tier, int start) {
     ADD_CODE(code, WASM_CALL_FUNCTION0(f.function_index()));
 
     // Store the result in a local.
-    byte local_index = r.AllocateLocal(ValueType::For(result));
+    uint8_t local_index = r.AllocateLocal(ValueType::For(result));
     ADD_CODE(code, kExprLocalSet, local_index);
 
     // Store the result in memory.
@@ -1569,8 +1569,8 @@ static void Run_WasmMixedCall_N(TestExecutionTier execution_tier, int start) {
       int size = result.MemSize();
       for (int i = 0; i < size; i++) {
         int base = (which + 1) * kElemSize;
-        byte expected = r.builder().raw_mem_at<byte>(base + i);
-        byte actual = r.builder().raw_mem_at<byte>(i);
+        uint8_t expected = r.builder().raw_mem_at<uint8_t>(base + i);
+        uint8_t actual = r.builder().raw_mem_at<uint8_t>(i);
         CHECK_EQ(expected, actual);
       }
     }
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-asmjs.cc b/deps/v8/test/cctest/wasm/test-run-wasm-asmjs.cc
index 286578a580ee96..416e13398d2585 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-asmjs.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-asmjs.cc
@@ -18,20 +18,9 @@ namespace v8 {
 namespace internal {
 namespace wasm {
 
-// Liftoff does not support asm.js, and is never invoked with asm.js code in
-// production. Hence test asm.js with TurboFan and Interpreter only.
-#define ASMJS_EXEC_TEST(name)                            \
-  void RunWasm_##name(TestExecutionTier execution_tier); \
-  TEST(RunWasmTurbofan_##name) {                         \
-    RunWasm_##name(TestExecutionTier::kTurbofan);        \
-  }                                                      \
-  TEST(RunWasmInterpreter_##name) {                      \
-    RunWasm_##name(TestExecutionTier::kInterpreter);     \
-  }                                                      \
-  void RunWasm_##name(TestExecutionTier execution_tier)
-
-ASMJS_EXEC_TEST(Int32AsmjsDivS) {
-  WasmRunner<int32_t, int32_t, int32_t> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_Int32AsmjsDivS) {
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan,
+                                          kAsmJsSloppyOrigin);
   r.Build(
       {WASM_BINOP(kExprI32AsmjsDivS, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))});
   const int32_t kMin = std::numeric_limits<int32_t>::min();
@@ -42,8 +31,9 @@ ASMJS_EXEC_TEST(Int32AsmjsDivS) {
   CHECK_EQ(0, r.Call(kMin, 0));
 }
 
-ASMJS_EXEC_TEST(Int32AsmjsRemS) {
-  WasmRunner<int32_t, int32_t, int32_t> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_Int32AsmjsRemS) {
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan,
+                                          kAsmJsSloppyOrigin);
   r.Build(
       {WASM_BINOP(kExprI32AsmjsRemS, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))});
   const int32_t kMin = std::numeric_limits<int32_t>::min();
@@ -54,8 +44,9 @@ ASMJS_EXEC_TEST(Int32AsmjsRemS) {
   CHECK_EQ(0, r.Call(kMin, 0));
 }
 
-ASMJS_EXEC_TEST(Int32AsmjsDivU) {
-  WasmRunner<int32_t, int32_t, int32_t> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_Int32AsmjsDivU) {
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan,
+                                          kAsmJsSloppyOrigin);
   r.Build(
       {WASM_BINOP(kExprI32AsmjsDivU, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))});
   const int32_t kMin = std::numeric_limits<int32_t>::min();
@@ -66,8 +57,9 @@ ASMJS_EXEC_TEST(Int32AsmjsDivU) {
   CHECK_EQ(0, r.Call(kMin, 0));
 }
 
-ASMJS_EXEC_TEST(Int32AsmjsRemU) {
-  WasmRunner<int32_t, int32_t, int32_t> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_Int32AsmjsRemU) {
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan,
+                                          kAsmJsSloppyOrigin);
   r.Build(
       {WASM_BINOP(kExprI32AsmjsRemU, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))});
   const int32_t kMin = std::numeric_limits<int32_t>::min();
@@ -78,8 +70,9 @@ ASMJS_EXEC_TEST(Int32AsmjsRemU) {
   CHECK_EQ(kMin, r.Call(kMin, -1));
 }
 
-ASMJS_EXEC_TEST(I32AsmjsSConvertF32) {
-  WasmRunner<int32_t, float> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_I32AsmjsSConvertF32) {
+  WasmRunner<int32_t, float> r(TestExecutionTier::kTurbofan,
+                               kAsmJsSloppyOrigin);
   r.Build({WASM_UNOP(kExprI32AsmjsSConvertF32, WASM_LOCAL_GET(0))});
 
   FOR_FLOAT32_INPUTS(i) {
@@ -88,8 +81,9 @@ ASMJS_EXEC_TEST(I32AsmjsSConvertF32) {
   }
 }
 
-ASMJS_EXEC_TEST(I32AsmjsSConvertF64) {
-  WasmRunner<int32_t, double> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_I32AsmjsSConvertF64) {
+  WasmRunner<int32_t, double> r(TestExecutionTier::kTurbofan,
+                                kAsmJsSloppyOrigin);
   r.Build({WASM_UNOP(kExprI32AsmjsSConvertF64, WASM_LOCAL_GET(0))});
 
   FOR_FLOAT64_INPUTS(i) {
@@ -98,8 +92,9 @@ ASMJS_EXEC_TEST(I32AsmjsSConvertF64) {
   }
 }
 
-ASMJS_EXEC_TEST(I32AsmjsUConvertF32) {
-  WasmRunner<uint32_t, float> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_I32AsmjsUConvertF32) {
+  WasmRunner<uint32_t, float> r(TestExecutionTier::kTurbofan,
+                                kAsmJsSloppyOrigin);
   r.Build({WASM_UNOP(kExprI32AsmjsUConvertF32, WASM_LOCAL_GET(0))});
 
   FOR_FLOAT32_INPUTS(i) {
@@ -108,8 +103,9 @@ ASMJS_EXEC_TEST(I32AsmjsUConvertF32) {
   }
 }
 
-ASMJS_EXEC_TEST(I32AsmjsUConvertF64) {
-  WasmRunner<uint32_t, double> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_I32AsmjsUConvertF64) {
+  WasmRunner<uint32_t, double> r(TestExecutionTier::kTurbofan,
+                                 kAsmJsSloppyOrigin);
   r.Build({WASM_UNOP(kExprI32AsmjsUConvertF64, WASM_LOCAL_GET(0))});
 
   FOR_FLOAT64_INPUTS(i) {
@@ -118,8 +114,9 @@ ASMJS_EXEC_TEST(I32AsmjsUConvertF64) {
   }
 }
 
-ASMJS_EXEC_TEST(LoadMemI32_oob_asm) {
-  WasmRunner<int32_t, uint32_t> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_LoadMemI32_oob_asm) {
+  WasmRunner<int32_t, uint32_t> r(TestExecutionTier::kTurbofan,
+                                  kAsmJsSloppyOrigin);
   int32_t* memory = r.builder().AddMemoryElems<int32_t>(8);
   r.builder().RandomizeMemory(1112);
 
@@ -137,8 +134,9 @@ ASMJS_EXEC_TEST(LoadMemI32_oob_asm) {
   }
 }
 
-ASMJS_EXEC_TEST(LoadMemF32_oob_asm) {
-  WasmRunner<float, uint32_t> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_LoadMemF32_oob_asm) {
+  WasmRunner<float, uint32_t> r(TestExecutionTier::kTurbofan,
+                                kAsmJsSloppyOrigin);
   float* memory = r.builder().AddMemoryElems<float>(8);
   r.builder().RandomizeMemory(1112);
 
@@ -156,8 +154,9 @@ ASMJS_EXEC_TEST(LoadMemF32_oob_asm) {
   }
 }
 
-ASMJS_EXEC_TEST(LoadMemF64_oob_asm) {
-  WasmRunner<double, uint32_t> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_LoadMemF64_oob_asm) {
+  WasmRunner<double, uint32_t> r(TestExecutionTier::kTurbofan,
+                                 kAsmJsSloppyOrigin);
   double* memory = r.builder().AddMemoryElems<double>(8);
   r.builder().RandomizeMemory(1112);
 
@@ -177,8 +176,9 @@ ASMJS_EXEC_TEST(LoadMemF64_oob_asm) {
   }
 }
 
-ASMJS_EXEC_TEST(StoreMemI32_oob_asm) {
-  WasmRunner<int32_t, uint32_t, uint32_t> r(execution_tier, kAsmJsSloppyOrigin);
+TEST(RunAsmJs_StoreMemI32_oob_asm) {
+  WasmRunner<int32_t, uint32_t, uint32_t> r(TestExecutionTier::kTurbofan,
+                                            kAsmJsSloppyOrigin);
   int32_t* memory = r.builder().AddMemoryElems<int32_t>(8);
   r.builder().RandomizeMemory(1112);
 
@@ -198,9 +198,10 @@ ASMJS_EXEC_TEST(StoreMemI32_oob_asm) {
   }
 }
 
-ASMJS_EXEC_TEST(Int32AsmjsDivS_byzero_const) {
+TEST(RunAsmJs_Int32AsmjsDivS_byzero_const) {
   for (int8_t denom = -2; denom < 8; ++denom) {
-    WasmRunner<int32_t, int32_t> r(execution_tier, kAsmJsSloppyOrigin);
+    WasmRunner<int32_t, int32_t> r(TestExecutionTier::kTurbofan,
+                                   kAsmJsSloppyOrigin);
     r.Build({WASM_I32_ASMJS_DIVS(WASM_LOCAL_GET(0), WASM_I32V_1(denom))});
     FOR_INT32_INPUTS(i) {
       if (denom == 0) {
@@ -214,9 +215,10 @@ ASMJS_EXEC_TEST(Int32AsmjsDivS_byzero_const) {
   }
 }
 
-ASMJS_EXEC_TEST(Int32AsmjsRemS_byzero_const) {
+TEST(RunAsmJs_Int32AsmjsRemS_byzero_const) {
   for (int8_t denom = -2; denom < 8; ++denom) {
-    WasmRunner<int32_t, int32_t> r(execution_tier, kAsmJsSloppyOrigin);
+    WasmRunner<int32_t, int32_t> r(TestExecutionTier::kTurbofan,
+                                   kAsmJsSloppyOrigin);
     r.Build({WASM_I32_ASMJS_REMS(WASM_LOCAL_GET(0), WASM_I32V_1(denom))});
     FOR_INT32_INPUTS(i) {
       if (denom == 0) {
@@ -230,8 +232,6 @@ ASMJS_EXEC_TEST(Int32AsmjsRemS_byzero_const) {
   }
 }
 
-#undef ASMJS_EXEC_TEST
-
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-atomics.cc b/deps/v8/test/cctest/wasm/test-run-wasm-atomics.cc
index 205bf9badcf827..3d8371b41b5a59 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-atomics.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-atomics.cc
@@ -15,7 +15,7 @@ void RunU32BinOp(TestExecutionTier execution_tier, WasmOpcode wasm_op,
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                               MachineRepresentation::kWord32)});
@@ -41,9 +41,9 @@ WASM_ATOMIC_OPERATION_LIST(TEST_OPERATION)
 void RunU16BinOp(TestExecutionTier tier, WasmOpcode wasm_op,
                  Uint16BinOp expected_op) {
   WasmRunner<uint32_t, uint32_t> r(tier);
-  r.builder().SetHasSharedMemory();
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                               MachineRepresentation::kWord16)});
@@ -69,8 +69,8 @@ WASM_ATOMIC_OPERATION_LIST(TEST_OPERATION)
 void RunU8BinOp(TestExecutionTier execution_tier, WasmOpcode wasm_op,
                 Uint8BinOp expected_op) {
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                               MachineRepresentation::kWord8)});
@@ -95,9 +95,9 @@ WASM_ATOMIC_OPERATION_LIST(TEST_OPERATION)
 
 WASM_EXEC_TEST(I32AtomicCompareExchange) {
   WasmRunner<uint32_t, uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI32AtomicCompareExchange, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord32)});
@@ -115,9 +115,9 @@ WASM_EXEC_TEST(I32AtomicCompareExchange) {
 
 WASM_EXEC_TEST(I32AtomicCompareExchange16U) {
   WasmRunner<uint32_t, uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI32AtomicCompareExchange16U, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord16)});
@@ -135,8 +135,8 @@ WASM_EXEC_TEST(I32AtomicCompareExchange16U) {
 
 WASM_EXEC_TEST(I32AtomicCompareExchange8U) {
   WasmRunner<uint32_t, uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI32AtomicCompareExchange8U, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord8)});
@@ -154,9 +154,9 @@ WASM_EXEC_TEST(I32AtomicCompareExchange8U) {
 
 WASM_EXEC_TEST(I32AtomicCompareExchange_fail) {
   WasmRunner<uint32_t, uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI32AtomicCompareExchange, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord32)});
@@ -175,9 +175,9 @@ WASM_EXEC_TEST(I32AtomicCompareExchange_fail) {
 
 WASM_EXEC_TEST(I32AtomicLoad) {
   WasmRunner<uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI32AtomicLoad, WASM_ZERO,
                                 MachineRepresentation::kWord32)});
 
@@ -190,9 +190,9 @@ WASM_EXEC_TEST(I32AtomicLoad) {
 
 WASM_EXEC_TEST(I32AtomicLoad16U) {
   WasmRunner<uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI32AtomicLoad16U, WASM_ZERO,
                                 MachineRepresentation::kWord16)});
 
@@ -205,8 +205,8 @@ WASM_EXEC_TEST(I32AtomicLoad16U) {
 
 WASM_EXEC_TEST(I32AtomicLoad8U) {
   WasmRunner<uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI32AtomicLoad8U, WASM_ZERO,
                                 MachineRepresentation::kWord8)});
 
@@ -219,9 +219,9 @@ WASM_EXEC_TEST(I32AtomicLoad8U) {
 
 WASM_EXEC_TEST(I32AtomicStoreLoad) {
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI32AtomicStore, WASM_ZERO, WASM_LOCAL_GET(0),
@@ -238,9 +238,9 @@ WASM_EXEC_TEST(I32AtomicStoreLoad) {
 
 WASM_EXEC_TEST(I32AtomicStoreLoad16U) {
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI32AtomicStore16U, WASM_ZERO,
@@ -257,8 +257,8 @@ WASM_EXEC_TEST(I32AtomicStoreLoad16U) {
 
 WASM_EXEC_TEST(I32AtomicStoreLoad8U) {
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI32AtomicStore8U, WASM_ZERO,
@@ -277,7 +277,7 @@ WASM_EXEC_TEST(I32AtomicStoreParameter) {
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI32AtomicStore, WASM_ZERO, WASM_LOCAL_GET(0),
@@ -304,7 +304,7 @@ WASM_EXEC_TEST(AtomicStoreNoConsideredEffectful) {
   FLAG_SCOPE(wasm_enforce_bounds_checks);
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemoryElems<int32_t>(kWasmPageSize / sizeof(int32_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   r.Build(
       {WASM_LOAD_MEM(MachineType::Int64(), WASM_ZERO),
        WASM_ATOMICS_STORE_OP(kExprI32AtomicStore, WASM_ZERO, WASM_I32V_1(20),
@@ -318,7 +318,7 @@ void RunNoEffectTest(TestExecutionTier execution_tier, WasmOpcode wasm_op) {
   FLAG_SCOPE(wasm_enforce_bounds_checks);
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemoryElems<int32_t>(kWasmPageSize / sizeof(int32_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   r.Build({WASM_LOAD_MEM(MachineType::Int64(), WASM_ZERO),
            WASM_ATOMICS_BINOP(wasm_op, WASM_ZERO, WASM_I32V_1(20),
                               MachineRepresentation::kWord32),
@@ -339,7 +339,7 @@ WASM_EXEC_TEST(AtomicCompareExchangeNoConsideredEffectful) {
   FLAG_SCOPE(wasm_enforce_bounds_checks);
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemoryElems<int32_t>(kWasmPageSize / sizeof(int32_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   r.Build({WASM_LOAD_MEM(MachineType::Int32(), WASM_ZERO),
            WASM_ATOMICS_TERNARY_OP(kExprI32AtomicCompareExchange, WASM_ZERO,
                                    WASM_ZERO, WASM_I32V_1(30),
@@ -350,8 +350,8 @@ WASM_EXEC_TEST(AtomicCompareExchangeNoConsideredEffectful) {
 
 WASM_EXEC_TEST(I32AtomicLoad_trap) {
   WasmRunner<uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   r.builder().AddMemory(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI32AtomicLoad, WASM_I32V_3(kWasmPageSize),
                                 MachineRepresentation::kWord32)});
   CHECK_TRAP(r.Call());
@@ -359,8 +359,8 @@ WASM_EXEC_TEST(I32AtomicLoad_trap) {
 
 WASM_EXEC_TEST(I64AtomicLoad_trap) {
   WasmRunner<uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   r.builder().AddMemory(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI64AtomicLoad, WASM_I32V_3(kWasmPageSize),
                                 MachineRepresentation::kWord64)});
   CHECK_TRAP64(r.Call());
@@ -368,8 +368,8 @@ WASM_EXEC_TEST(I64AtomicLoad_trap) {
 
 WASM_EXEC_TEST(I32AtomicStore_trap) {
   WasmRunner<uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   r.builder().AddMemory(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI32AtomicStore, WASM_I32V_3(kWasmPageSize),
                              WASM_ZERO, MachineRepresentation::kWord32),
@@ -379,8 +379,8 @@ WASM_EXEC_TEST(I32AtomicStore_trap) {
 
 WASM_EXEC_TEST(I64AtomicStore_trap) {
   WasmRunner<uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   r.builder().AddMemory(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI64AtomicStore, WASM_I32V_3(kWasmPageSize),
                              WASM_ZERO64, MachineRepresentation::kWord64),
@@ -390,8 +390,8 @@ WASM_EXEC_TEST(I64AtomicStore_trap) {
 
 WASM_EXEC_TEST(I32AtomicLoad_NotOptOut) {
   WasmRunner<uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   r.builder().AddMemory(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build({WASM_I32_AND(
       WASM_ATOMICS_LOAD_OP(kExprI32AtomicLoad, WASM_I32V_3(kWasmPageSize),
                            MachineRepresentation::kWord32),
@@ -402,7 +402,7 @@ WASM_EXEC_TEST(I32AtomicLoad_NotOptOut) {
 void RunU32BinOp_OOB(TestExecutionTier execution_tier, WasmOpcode wasm_op) {
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemory(kWasmPageSize);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_3(kWasmPageSize), WASM_ZERO,
                               MachineRepresentation::kWord32)});
@@ -420,7 +420,7 @@ WASM_ATOMIC_OPERATION_LIST(TEST_OPERATION)
 void RunU64BinOp_OOB(TestExecutionTier execution_tier, WasmOpcode wasm_op) {
   WasmRunner<uint64_t> r(execution_tier);
   r.builder().AddMemory(kWasmPageSize);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_3(kWasmPageSize), WASM_ZERO64,
                               MachineRepresentation::kWord32)});
@@ -437,9 +437,9 @@ WASM_ATOMIC_OPERATION_LIST(TEST_OPERATION)
 
 WASM_EXEC_TEST(I32AtomicCompareExchange_trap) {
   WasmRunner<uint32_t, uint32_t, uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI32AtomicCompareExchange, WASM_I32V_3(kWasmPageSize),
       WASM_LOCAL_GET(0), WASM_LOCAL_GET(1), MachineRepresentation::kWord32)});
@@ -455,8 +455,8 @@ WASM_EXEC_TEST(I32AtomicCompareExchange_trap) {
 
 WASM_EXEC_TEST(I64AtomicCompareExchange_trap) {
   WasmRunner<uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   r.builder().AddMemory(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange, WASM_I32V_3(kWasmPageSize), WASM_ZERO64,
       WASM_ZERO64, MachineRepresentation::kWord64)});
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-atomics64.cc b/deps/v8/test/cctest/wasm/test-run-wasm-atomics64.cc
index 8c1fe8d063b540..e2e750e23fe832 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-atomics64.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-atomics64.cc
@@ -15,7 +15,7 @@ void RunU64BinOp(TestExecutionTier execution_tier, WasmOpcode wasm_op,
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                               MachineRepresentation::kWord64)});
@@ -43,7 +43,7 @@ void RunU32BinOp(TestExecutionTier execution_tier, WasmOpcode wasm_op,
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                               MachineRepresentation::kWord32)});
@@ -69,9 +69,9 @@ WASM_ATOMIC_OPERATION_LIST(TEST_OPERATION)
 void RunU16BinOp(TestExecutionTier tier, WasmOpcode wasm_op,
                  Uint16BinOp expected_op) {
   WasmRunner<uint64_t, uint64_t> r(tier);
-  r.builder().SetHasSharedMemory();
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                               MachineRepresentation::kWord16)});
@@ -97,8 +97,8 @@ WASM_ATOMIC_OPERATION_LIST(TEST_OPERATION)
 void RunU8BinOp(TestExecutionTier execution_tier, WasmOpcode wasm_op,
                 Uint8BinOp expected_op) {
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                               MachineRepresentation::kWord8)});
@@ -123,9 +123,9 @@ WASM_ATOMIC_OPERATION_LIST(TEST_OPERATION)
 
 WASM_EXEC_TEST(I64AtomicCompareExchange) {
   WasmRunner<uint64_t, uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord64)});
@@ -143,9 +143,9 @@ WASM_EXEC_TEST(I64AtomicCompareExchange) {
 
 WASM_EXEC_TEST(I64AtomicCompareExchange32U) {
   WasmRunner<uint64_t, uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange32U, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord32)});
@@ -163,9 +163,9 @@ WASM_EXEC_TEST(I64AtomicCompareExchange32U) {
 
 WASM_EXEC_TEST(I64AtomicCompareExchange16U) {
   WasmRunner<uint64_t, uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange16U, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord16)});
@@ -183,8 +183,8 @@ WASM_EXEC_TEST(I64AtomicCompareExchange16U) {
 
 WASM_EXEC_TEST(I32AtomicCompareExchange8U) {
   WasmRunner<uint64_t, uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange8U, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord8)});
@@ -201,9 +201,9 @@ WASM_EXEC_TEST(I32AtomicCompareExchange8U) {
 
 WASM_EXEC_TEST(I64AtomicLoad) {
   WasmRunner<uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI64AtomicLoad, WASM_ZERO,
                                 MachineRepresentation::kWord64)});
 
@@ -216,9 +216,9 @@ WASM_EXEC_TEST(I64AtomicLoad) {
 
 WASM_EXEC_TEST(I64AtomicLoad32U) {
   WasmRunner<uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI64AtomicLoad32U, WASM_ZERO,
                                 MachineRepresentation::kWord32)});
 
@@ -231,9 +231,9 @@ WASM_EXEC_TEST(I64AtomicLoad32U) {
 
 WASM_EXEC_TEST(I64AtomicLoad16U) {
   WasmRunner<uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI64AtomicLoad16U, WASM_ZERO,
                                 MachineRepresentation::kWord16)});
 
@@ -246,8 +246,8 @@ WASM_EXEC_TEST(I64AtomicLoad16U) {
 
 WASM_EXEC_TEST(I64AtomicLoad8U) {
   WasmRunner<uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_LOAD_OP(kExprI64AtomicLoad8U, WASM_ZERO,
                                 MachineRepresentation::kWord8)});
 
@@ -260,9 +260,9 @@ WASM_EXEC_TEST(I64AtomicLoad8U) {
 
 WASM_EXEC_TEST(I64AtomicStoreLoad) {
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI64AtomicStore, WASM_ZERO, WASM_LOCAL_GET(0),
@@ -279,9 +279,9 @@ WASM_EXEC_TEST(I64AtomicStoreLoad) {
 
 WASM_EXEC_TEST(I64AtomicStoreLoad32U) {
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(uint32_t));
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI64AtomicStore32U, WASM_ZERO,
@@ -298,9 +298,9 @@ WASM_EXEC_TEST(I64AtomicStoreLoad32U) {
 
 WASM_EXEC_TEST(I64AtomicStoreLoad16U) {
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI64AtomicStore16U, WASM_ZERO,
@@ -317,8 +317,8 @@ WASM_EXEC_TEST(I64AtomicStoreLoad16U) {
 
 WASM_EXEC_TEST(I64AtomicStoreLoad8U) {
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI64AtomicStore8U, WASM_ZERO,
@@ -340,7 +340,7 @@ void RunDropTest(TestExecutionTier execution_tier, WasmOpcode wasm_op,
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_ATOMICS_BINOP(wasm_op, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                               MachineRepresentation::kWord64),
@@ -364,7 +364,7 @@ WASM_EXEC_TEST(I64AtomicSub16UDrop) {
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
   uint16_t* memory =
       r.builder().AddMemoryElems<uint16_t>(kWasmPageSize / sizeof(uint16_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_BINOP(kExprI64AtomicSub16U, WASM_I32V_1(0),
@@ -380,9 +380,9 @@ WASM_EXEC_TEST(I64AtomicSub16UDrop) {
 
 WASM_EXEC_TEST(I64AtomicCompareExchangeDrop) {
   WasmRunner<uint64_t, uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
                kExprI64AtomicCompareExchange, WASM_I32V_1(0), WASM_LOCAL_GET(0),
                WASM_LOCAL_GET(1), MachineRepresentation::kWord64),
@@ -397,9 +397,9 @@ WASM_EXEC_TEST(I64AtomicCompareExchangeDrop) {
 
 WASM_EXEC_TEST(I64AtomicStoreLoadDrop) {
   WasmRunner<uint64_t, uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_STORE_OP(kExprI64AtomicStore, WASM_ZERO, WASM_LOCAL_GET(0),
@@ -417,7 +417,7 @@ WASM_EXEC_TEST(I64AtomicAddConvertDrop) {
   WasmRunner<uint64_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build(
       {WASM_ATOMICS_BINOP(kExprI64AtomicAdd, WASM_I32V_1(0), WASM_LOCAL_GET(0),
@@ -435,7 +435,7 @@ WASM_EXEC_TEST(I64AtomicLoadConvertDrop) {
   WasmRunner<uint32_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_I32_CONVERT_I64(WASM_ATOMICS_LOAD_OP(
       kExprI64AtomicLoad, WASM_ZERO, MachineRepresentation::kWord64))});
@@ -452,7 +452,7 @@ void RunConvertTest(TestExecutionTier execution_tier, WasmOpcode wasm_op,
   WasmRunner<uint32_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_I32_CONVERT_I64(WASM_ATOMICS_BINOP(
       wasm_op, WASM_ZERO, WASM_LOCAL_GET(0), MachineRepresentation::kWord64))});
@@ -475,7 +475,7 @@ WASM_EXEC_TEST(I64AtomicConvertCompareExchange) {
   WasmRunner<uint32_t, uint64_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_I32_CONVERT_I64(WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange, WASM_I32V_1(0), WASM_LOCAL_GET(0),
@@ -495,7 +495,7 @@ void RunNonConstIndexTest(TestExecutionTier execution_tier, WasmOpcode wasm_op,
   WasmRunner<uint32_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_I32_CONVERT_I64(
       WASM_ATOMICS_BINOP(wasm_op, WASM_I64_EQ(WASM_I64V(1), WASM_I64V(0)),
@@ -528,7 +528,7 @@ WASM_EXEC_TEST(I64AtomicNonConstIndexCompareExchangeNarrow) {
   WasmRunner<uint32_t, uint64_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_I32_CONVERT_I64(WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange16U, WASM_I64_EQ(WASM_I64V(1), WASM_I64V(0)),
@@ -545,7 +545,7 @@ WASM_EXEC_TEST(I64AtomicNonConstIndexCompareExchange) {
   WasmRunner<uint32_t, uint64_t, uint64_t> r(execution_tier);
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
 
   r.Build({WASM_I32_CONVERT_I64(WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange, WASM_I64_EQ(WASM_I64V(1), WASM_I64V(0)),
@@ -560,9 +560,9 @@ WASM_EXEC_TEST(I64AtomicNonConstIndexCompareExchange) {
 
 WASM_EXEC_TEST(I64AtomicNonConstIndexLoad8U) {
   WasmRunner<uint32_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_I32_CONVERT_I64(WASM_ATOMICS_LOAD_OP(
       kExprI64AtomicLoad8U, WASM_I64_EQ(WASM_I64V(1), WASM_I64V(0)),
       MachineRepresentation::kWord8))});
@@ -574,9 +574,9 @@ WASM_EXEC_TEST(I64AtomicNonConstIndexLoad8U) {
 
 WASM_EXEC_TEST(I64AtomicCompareExchangeFail) {
   WasmRunner<uint64_t, uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord64)});
@@ -591,9 +591,9 @@ WASM_EXEC_TEST(I64AtomicCompareExchangeFail) {
 
 WASM_EXEC_TEST(I64AtomicCompareExchange32UFail) {
   WasmRunner<uint64_t, uint64_t, uint64_t> r(execution_tier);
-  r.builder().SetHasSharedMemory();
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
+  r.builder().SetMemoryShared();
   r.Build({WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange32U, WASM_I32V_1(0), WASM_LOCAL_GET(0),
       WASM_LOCAL_GET(1), MachineRepresentation::kWord32)});
@@ -610,7 +610,7 @@ WASM_EXEC_TEST(AtomicStoreNoConsideredEffectful) {
   FLAG_SCOPE(wasm_enforce_bounds_checks);
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemoryElems<int64_t>(kWasmPageSize / sizeof(int64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   r.Build({WASM_LOAD_MEM(MachineType::Int64(), WASM_ZERO),
            WASM_ATOMICS_STORE_OP(kExprI64AtomicStore, WASM_ZERO, WASM_I64V(20),
                                  MachineRepresentation::kWord64),
@@ -623,7 +623,7 @@ void RunNoEffectTest(TestExecutionTier execution_tier, WasmOpcode wasm_op) {
   FLAG_SCOPE(wasm_enforce_bounds_checks);
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemoryElems<int64_t>(kWasmPageSize / sizeof(int64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   r.Build({WASM_LOAD_MEM(MachineType::Int64(), WASM_ZERO),
            WASM_ATOMICS_BINOP(wasm_op, WASM_ZERO, WASM_I64V(20),
                               MachineRepresentation::kWord64),
@@ -644,7 +644,7 @@ WASM_EXEC_TEST(AtomicCompareExchangeNoConsideredEffectful) {
   FLAG_SCOPE(wasm_enforce_bounds_checks);
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   r.Build({WASM_LOAD_MEM(MachineType::Int64(), WASM_ZERO),
            WASM_ATOMICS_TERNARY_OP(kExprI64AtomicCompareExchange, WASM_ZERO,
                                    WASM_I64V(0), WASM_I64V(30),
@@ -659,7 +659,7 @@ WASM_EXEC_TEST(I64AtomicLoadUseOnlyLowWord) {
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   uint64_t initial = 0x1234567890abcdef;
   r.builder().WriteMemory(&memory[1], initial);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that we can use just the low word of an I64AtomicLoad.
   r.Build({WASM_I32_CONVERT_I64(WASM_ATOMICS_LOAD_OP(
       kExprI64AtomicLoad, WASM_I32V(8), MachineRepresentation::kWord64))});
@@ -672,7 +672,7 @@ WASM_EXEC_TEST(I64AtomicLoadUseOnlyHighWord) {
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   uint64_t initial = 0x1234567890abcdef;
   r.builder().WriteMemory(&memory[1], initial);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that we can use just the high word of an I64AtomicLoad.
   r.Build({WASM_I32_CONVERT_I64(
       WASM_I64_ROR(WASM_ATOMICS_LOAD_OP(kExprI64AtomicLoad, WASM_I32V(8),
@@ -687,7 +687,7 @@ WASM_EXEC_TEST(I64AtomicAddUseOnlyLowWord) {
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   uint64_t initial = 0x1234567890abcdef;
   r.builder().WriteMemory(&memory[1], initial);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that we can use just the low word of an I64AtomicLoad.
   r.Build({WASM_I32_CONVERT_I64(
       WASM_ATOMICS_BINOP(kExprI64AtomicAdd, WASM_I32V(8), WASM_I64V(1),
@@ -701,7 +701,7 @@ WASM_EXEC_TEST(I64AtomicAddUseOnlyHighWord) {
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   uint64_t initial = 0x1234567890abcdef;
   r.builder().WriteMemory(&memory[1], initial);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that we can use just the high word of an I64AtomicLoad.
   r.Build({WASM_I32_CONVERT_I64(WASM_I64_ROR(
       WASM_ATOMICS_BINOP(kExprI64AtomicAdd, WASM_I32V(8), WASM_I64V(1),
@@ -716,7 +716,7 @@ WASM_EXEC_TEST(I64AtomicCompareExchangeUseOnlyLowWord) {
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   uint64_t initial = 0x1234567890abcdef;
   r.builder().WriteMemory(&memory[1], initial);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that we can use just the low word of an I64AtomicLoad.
   r.Build({WASM_I32_CONVERT_I64(WASM_ATOMICS_TERNARY_OP(
       kExprI64AtomicCompareExchange, WASM_I32V(8), WASM_I64V(1),
@@ -730,7 +730,7 @@ WASM_EXEC_TEST(I64AtomicCompareExchangeUseOnlyHighWord) {
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   uint64_t initial = 0x1234567890abcdef;
   r.builder().WriteMemory(&memory[1], initial);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that we can use just the high word of an I64AtomicLoad.
   r.Build({WASM_I32_CONVERT_I64(WASM_I64_ROR(
       WASM_ATOMICS_TERNARY_OP(kExprI64AtomicCompareExchange, WASM_I32V(8),
@@ -746,7 +746,7 @@ WASM_EXEC_TEST(I64AtomicExchangeUseOnlyLowWord) {
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   uint64_t initial = 0x1234567890abcdef;
   r.builder().WriteMemory(&memory[1], initial);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that we can use just the low word of an I64AtomicLoad.
   r.Build({WASM_I32_CONVERT_I64(
       WASM_ATOMICS_BINOP(kExprI64AtomicExchange, WASM_I32V(8), WASM_I64V(1),
@@ -760,7 +760,7 @@ WASM_EXEC_TEST(I64AtomicExchangeUseOnlyHighWord) {
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   uint64_t initial = 0x1234567890abcdef;
   r.builder().WriteMemory(&memory[1], initial);
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that we can use just the high word of an I64AtomicLoad.
   r.Build({WASM_I32_CONVERT_I64(WASM_I64_ROR(
       WASM_ATOMICS_BINOP(kExprI64AtomicExchange, WASM_I32V(8), WASM_I64V(1),
@@ -774,7 +774,7 @@ WASM_EXEC_TEST(I64AtomicCompareExchange32UZeroExtended) {
   uint64_t* memory =
       r.builder().AddMemoryElems<uint64_t>(kWasmPageSize / sizeof(uint64_t));
   memory[1] = 0;
-  r.builder().SetHasSharedMemory();
+  r.builder().SetMemoryShared();
   // Test that the high word of the expected value is cleared in the return
   // value.
   r.Build({WASM_I64_EQZ(
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-bulk-memory.cc b/deps/v8/test/cctest/wasm/test-run-wasm-bulk-memory.cc
index dd59b48ef576cd..c9e995ad24395a 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-bulk-memory.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-bulk-memory.cc
@@ -15,9 +15,9 @@ namespace test_run_wasm_bulk_memory {
 
 namespace {
 void CheckMemoryEquals(TestingModuleBuilder* builder, size_t index,
-                       const std::vector<byte>& expected) {
-  const byte* mem_start = builder->raw_mem_start<byte>();
-  const byte* mem_end = builder->raw_mem_end<byte>();
+                       const std::vector<uint8_t>& expected) {
+  const uint8_t* mem_start = builder->raw_mem_start<uint8_t>();
+  const uint8_t* mem_end = builder->raw_mem_end<uint8_t>();
   size_t mem_size = mem_end - mem_start;
   CHECK_LE(index, mem_size);
   CHECK_LE(index + expected.size(), mem_size);
@@ -28,8 +28,8 @@ void CheckMemoryEquals(TestingModuleBuilder* builder, size_t index,
 
 void CheckMemoryEqualsZero(TestingModuleBuilder* builder, size_t index,
                            size_t length) {
-  const byte* mem_start = builder->raw_mem_start<byte>();
-  const byte* mem_end = builder->raw_mem_end<byte>();
+  const uint8_t* mem_start = builder->raw_mem_start<uint8_t>();
+  const uint8_t* mem_end = builder->raw_mem_end<uint8_t>();
   size_t mem_size = mem_end - mem_start;
   CHECK_LE(index, mem_size);
   CHECK_LE(index + length, mem_size);
@@ -39,7 +39,7 @@ void CheckMemoryEqualsZero(TestingModuleBuilder* builder, size_t index,
 }
 
 void CheckMemoryEqualsFollowedByZeroes(TestingModuleBuilder* builder,
-                                       const std::vector<byte>& expected) {
+                                       const std::vector<uint8_t>& expected) {
   CheckMemoryEquals(builder, 0, expected);
   CheckMemoryEqualsZero(builder, expected.size(),
                         builder->mem_size() - expected.size());
@@ -49,7 +49,7 @@ void CheckMemoryEqualsFollowedByZeroes(TestingModuleBuilder* builder,
 WASM_EXEC_TEST(MemoryInit) {
   WasmRunner<uint32_t, uint32_t, uint32_t, uint32_t> r(execution_tier);
   r.builder().AddMemory(kWasmPageSize);
-  const byte data[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
+  const uint8_t data[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
   r.builder().AddPassiveDataSegment(base::ArrayVector(data));
   r.Build({WASM_MEMORY_INIT(0, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1),
                             WASM_LOCAL_GET(2)),
@@ -84,7 +84,7 @@ WASM_EXEC_TEST(MemoryInit) {
 WASM_EXEC_TEST(MemoryInitOutOfBoundsData) {
   WasmRunner<uint32_t, uint32_t, uint32_t, uint32_t> r(execution_tier);
   r.builder().AddMemory(kWasmPageSize);
-  const byte data[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
+  const uint8_t data[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
   r.builder().AddPassiveDataSegment(base::ArrayVector(data));
   r.Build({WASM_MEMORY_INIT(0, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1),
                             WASM_LOCAL_GET(2)),
@@ -104,7 +104,7 @@ WASM_EXEC_TEST(MemoryInitOutOfBoundsData) {
 WASM_EXEC_TEST(MemoryInitOutOfBounds) {
   WasmRunner<uint32_t, uint32_t, uint32_t, uint32_t> r(execution_tier);
   r.builder().AddMemory(kWasmPageSize);
-  const byte data[kWasmPageSize] = {};
+  const uint8_t data[kWasmPageSize] = {};
   r.builder().AddPassiveDataSegment(base::ArrayVector(data));
   r.Build({WASM_MEMORY_INIT(0, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1),
                             WASM_LOCAL_GET(2)),
@@ -133,12 +133,12 @@ WASM_EXEC_TEST(MemoryInitOutOfBounds) {
 
 WASM_EXEC_TEST(MemoryCopy) {
   WasmRunner<uint32_t, uint32_t, uint32_t, uint32_t> r(execution_tier);
-  byte* mem = r.builder().AddMemory(kWasmPageSize);
+  uint8_t* mem = r.builder().AddMemory(kWasmPageSize);
   r.Build({WASM_MEMORY_COPY(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1),
                             WASM_LOCAL_GET(2)),
            kExprI32Const, 0});
 
-  const byte initial[] = {0, 11, 22, 33, 44, 55, 66, 77};
+  const uint8_t initial[] = {0, 11, 22, 33, 44, 55, 66, 77};
   memcpy(mem, initial, sizeof(initial));
 
   // Copy from [1, 8] to [10, 16].
@@ -160,12 +160,12 @@ WASM_EXEC_TEST(MemoryCopy) {
 
 WASM_EXEC_TEST(MemoryCopyOverlapping) {
   WasmRunner<uint32_t, uint32_t, uint32_t, uint32_t> r(execution_tier);
-  byte* mem = r.builder().AddMemory(kWasmPageSize);
+  uint8_t* mem = r.builder().AddMemory(kWasmPageSize);
   r.Build({WASM_MEMORY_COPY(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1),
                             WASM_LOCAL_GET(2)),
            kExprI32Const, 0});
 
-  const byte initial[] = {10, 20, 30};
+  const uint8_t initial[] = {10, 20, 30};
   memcpy(mem, initial, sizeof(initial));
 
   // Copy from [0, 3] -> [2, 5]. The copy must not overwrite 30 before copying
@@ -181,12 +181,12 @@ WASM_EXEC_TEST(MemoryCopyOverlapping) {
 
 WASM_EXEC_TEST(MemoryCopyOutOfBoundsData) {
   WasmRunner<uint32_t, uint32_t, uint32_t, uint32_t> r(execution_tier);
-  byte* mem = r.builder().AddMemory(kWasmPageSize);
+  uint8_t* mem = r.builder().AddMemory(kWasmPageSize);
   r.Build({WASM_MEMORY_COPY(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1),
                             WASM_LOCAL_GET(2)),
            kExprI32Const, 0});
 
-  const byte data[] = {11, 22, 33, 44, 55, 66, 77, 88};
+  const uint8_t data[] = {11, 22, 33, 44, 55, 66, 77, 88};
   memcpy(mem, data, sizeof(data));
 
   const uint32_t last_5_bytes = kWasmPageSize - 5;
@@ -263,7 +263,7 @@ WASM_EXEC_TEST(MemoryFillValueWrapsToByte) {
                             WASM_LOCAL_GET(2)),
            kExprI32Const, 0});
   CHECK_EQ(0, r.Call(0, 1000, 3));
-  const byte expected = 1000 & 255;
+  const uint8_t expected = 1000 & 255;
   CheckMemoryEqualsFollowedByZeroes(&r.builder(),
                                     {expected, expected, expected});
 }
@@ -274,7 +274,7 @@ WASM_EXEC_TEST(MemoryFillOutOfBoundsData) {
   r.Build({WASM_MEMORY_FILL(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1),
                             WASM_LOCAL_GET(2)),
            kExprI32Const, 0});
-  const byte v = 123;
+  const uint8_t v = 123;
   CHECK_EQ(0xDEADBEEF, r.Call(kWasmPageSize - 5, v, 999));
   CheckMemoryEquals(&r.builder(), kWasmPageSize - 6, {0, 0, 0, 0, 0, 0});
 }
@@ -286,7 +286,7 @@ WASM_EXEC_TEST(MemoryFillOutOfBounds) {
                             WASM_LOCAL_GET(2)),
            kExprI32Const, 0});
 
-  const byte v = 123;
+  const uint8_t v = 123;
 
   // Destination range must not be out of bounds.
   CHECK_EQ(0xDEADBEEF, r.Call(1, v, kWasmPageSize));
@@ -303,7 +303,7 @@ WASM_EXEC_TEST(MemoryFillOutOfBounds) {
 WASM_EXEC_TEST(DataDropTwice) {
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemory(kWasmPageSize);
-  const byte data[] = {0};
+  const uint8_t data[] = {0};
   r.builder().AddPassiveDataSegment(base::ArrayVector(data));
   r.Build({WASM_DATA_DROP(0), kExprI32Const, 0});
 
@@ -314,7 +314,7 @@ WASM_EXEC_TEST(DataDropTwice) {
 WASM_EXEC_TEST(DataDropThenMemoryInit) {
   WasmRunner<uint32_t> r(execution_tier);
   r.builder().AddMemory(kWasmPageSize);
-  const byte data[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
+  const uint8_t data[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
   r.builder().AddPassiveDataSegment(base::ArrayVector(data));
   r.Build({WASM_DATA_DROP(0),
            WASM_MEMORY_INIT(0, WASM_I32V_1(0), WASM_I32V_1(1), WASM_I32V_1(2)),
@@ -411,7 +411,7 @@ void TestTableCopyElems(TestExecutionTier execution_tier, int table_dst,
 
   auto table =
       handle(WasmTableObject::cast(
-                 r.builder().instance_object()->tables().get(table_dst)),
+                 r.builder().instance_object()->tables()->get(table_dst)),
              isolate);
   r.CheckCallViaJS(0, 0, 0, kTableSize);
   auto f0 = WasmTableObject::Get(isolate, table, 0);
@@ -491,7 +491,7 @@ void TestTableCopyCalls(TestExecutionTier execution_tier, int table_dst,
 
   auto table =
       handle(WasmTableObject::cast(
-                 r.builder().instance_object()->tables().get(table_dst)),
+                 r.builder().instance_object()->tables()->get(table_dst)),
              isolate);
 
   if (table_dst == table_src) {
@@ -558,7 +558,7 @@ void TestTableCopyOobWrites(TestExecutionTier execution_tier, int table_dst,
 
   auto table =
       handle(WasmTableObject::cast(
-                 r.builder().instance_object()->tables().get(table_dst)),
+                 r.builder().instance_object()->tables()->get(table_dst)),
              isolate);
   // Fill the dst table with values from the src table, to make checks easier.
   r.CheckCallViaJS(0, 0, 0, kTableSize);
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-exceptions.cc b/deps/v8/test/cctest/wasm/test-run-wasm-exceptions.cc
index d7be4a14803c43..732a9b0fdd83f0 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-exceptions.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-exceptions.cc
@@ -8,15 +8,12 @@
 #include "test/common/wasm/test-signatures.h"
 #include "test/common/wasm/wasm-macro-gen.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
-namespace test_run_wasm_exceptions {
+namespace v8::internal::wasm {
 
 WASM_EXEC_TEST(TryCatchThrow) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_v());
+  uint8_t except = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
@@ -27,20 +24,15 @@ WASM_EXEC_TEST(TryCatchThrow) {
                  WASM_IF(WASM_I32_EQZ(WASM_LOCAL_GET(0)), WASM_THROW(except))),
       WASM_STMTS(WASM_I32V(kResult0)), except)});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryCatchThrowWithValue) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_i());
+  uint8_t except = r.builder().AddException(sigs.v_i());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
@@ -52,28 +44,23 @@ WASM_EXEC_TEST(TryCatchThrowWithValue) {
                          WASM_THROW(except))),
       WASM_STMTS(kExprNop), except)});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryMultiCatchThrow) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except1 = r.builder().AddException(sigs.v_v());
-  byte except2 = r.builder().AddException(sigs.v_v());
+  uint8_t except1 = r.builder().AddException(sigs.v_v());
+  uint8_t except2 = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
   constexpr uint32_t kResult2 = 51;
 
   // Build the main test function.
   r.Build(
-      {kExprTry, static_cast<byte>((kWasmI32).value_type_code()),
+      {kExprTry, static_cast<uint8_t>((kWasmI32).value_type_code()),
        WASM_STMTS(WASM_I32V(kResult2),
                   WASM_IF(WASM_I32_EQZ(WASM_LOCAL_GET(0)), WASM_THROW(except1)),
                   WASM_IF(WASM_I32_EQ(WASM_LOCAL_GET(0), WASM_I32V(1)),
@@ -81,54 +68,43 @@ WASM_EXEC_TEST(TryMultiCatchThrow) {
        kExprCatch, except1, WASM_STMTS(WASM_I32V(kResult0)), kExprCatch,
        except2, WASM_STMTS(WASM_I32V(kResult1)), kExprEnd});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-    r.CheckCallViaJS(kResult2, 2);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-    CHECK_EQ(kResult2, r.CallInterpreter(2));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
+  r.CheckCallViaJS(kResult2, 2);
 }
 
 WASM_EXEC_TEST(TryCatchAllThrow) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_v());
+  uint8_t except = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
   // Build the main test function.
   r.Build(
-      {kExprTry, static_cast<byte>((kWasmI32).value_type_code()),
+      {kExprTry, static_cast<uint8_t>((kWasmI32).value_type_code()),
        WASM_STMTS(WASM_I32V(kResult1),
                   WASM_IF(WASM_I32_EQZ(WASM_LOCAL_GET(0)), WASM_THROW(except))),
        kExprCatchAll, WASM_I32V(kResult0), kExprEnd});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryCatchCatchAllThrow) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except1 = r.builder().AddException(sigs.v_v());
-  byte except2 = r.builder().AddException(sigs.v_v());
+  uint8_t except1 = r.builder().AddException(sigs.v_v());
+  uint8_t except2 = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
   constexpr uint32_t kResult2 = 51;
 
   // Build the main test function.
   r.Build(
-      {kExprTry, static_cast<byte>((kWasmI32).value_type_code()),
+      {kExprTry, static_cast<uint8_t>((kWasmI32).value_type_code()),
        WASM_STMTS(WASM_I32V(kResult2),
                   WASM_IF(WASM_I32_EQZ(WASM_LOCAL_GET(0)), WASM_THROW(except1)),
                   WASM_IF(WASM_I32_EQ(WASM_LOCAL_GET(0), WASM_I32V(1)),
@@ -136,23 +112,17 @@ WASM_EXEC_TEST(TryCatchCatchAllThrow) {
        kExprCatch, except1, WASM_I32V(kResult0), kExprCatchAll,
        WASM_I32V(kResult1), kExprEnd});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-    r.CheckCallViaJS(kResult2, 2);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-    CHECK_EQ(kResult2, r.CallInterpreter(2));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
+  r.CheckCallViaJS(kResult2, 2);
 }
 
 WASM_EXEC_TEST(TryImplicitRethrow) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except1 = r.builder().AddException(sigs.v_v());
-  byte except2 = r.builder().AddException(sigs.v_v());
+  uint8_t except1 = r.builder().AddException(sigs.v_v());
+  uint8_t except2 = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
   constexpr uint32_t kResult2 = 51;
@@ -167,20 +137,15 @@ WASM_EXEC_TEST(TryImplicitRethrow) {
                        WASM_STMTS(WASM_I32V(kResult2)), except1),
       WASM_I32V(kResult0), except2)});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryDelegate) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_v());
+  uint8_t except = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
@@ -194,36 +159,27 @@ WASM_EXEC_TEST(TryDelegate) {
                           0),
       WASM_I32V(kResult0), except)});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TestCatchlessTry) {
   TestSignatures sigs;
   WasmRunner<uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_i());
+  uint8_t except = r.builder().AddException(sigs.v_i());
   r.Build({WASM_TRY_CATCH_T(
       kWasmI32,
       WASM_TRY_T(kWasmI32, WASM_STMTS(WASM_I32V(0), WASM_THROW(except))),
       WASM_NOP, except)});
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    r.CheckCallViaJS(0);
-  } else {
-    CHECK_EQ(0, r.CallInterpreter());
-  }
+  r.CheckCallViaJS(0);
 }
 
 WASM_EXEC_TEST(TryCatchRethrow) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except1 = r.builder().AddException(sigs.v_v());
-  byte except2 = r.builder().AddException(sigs.v_v());
+  uint8_t except1 = r.builder().AddException(sigs.v_v());
+  uint8_t except2 = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
   constexpr uint32_t kUnreachable = 51;
@@ -242,20 +198,15 @@ WASM_EXEC_TEST(TryCatchRethrow) {
           except2),
       except1, WASM_I32V(kResult0), except2, WASM_I32V(kResult1))});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryDelegateToCaller) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_v());
+  uint8_t except = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
@@ -269,22 +220,16 @@ WASM_EXEC_TEST(TryDelegateToCaller) {
                           1),
       WASM_I32V(kResult0), except)});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    constexpr int64_t trap = 0xDEADBEEF;
-    r.CheckCallViaJS(trap, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    constexpr int stopped = 0;
-    CHECK_EQ(stopped, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  constexpr int64_t trap = 0xDEADBEEF;
+  r.CheckCallViaJS(trap, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryCatchCallDirect) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_v());
+  uint8_t except = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
@@ -303,20 +248,15 @@ WASM_EXEC_TEST(TryCatchCallDirect) {
                              WASM_DROP))),
       WASM_STMTS(WASM_I32V(kResult0)), except)});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryCatchAllCallDirect) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_v());
+  uint8_t except = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
@@ -335,20 +275,15 @@ WASM_EXEC_TEST(TryCatchAllCallDirect) {
                              WASM_DROP))),
       WASM_STMTS(WASM_I32V(kResult0)))});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryCatchCallIndirect) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_v());
+  uint8_t except = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
@@ -373,20 +308,15 @@ WASM_EXEC_TEST(TryCatchCallIndirect) {
                                     WASM_DROP))),
       WASM_I32V(kResult0), except)});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_EXEC_TEST(TryCatchAllCallIndirect) {
   TestSignatures sigs;
   WasmRunner<uint32_t, uint32_t> r(execution_tier);
-  byte except = r.builder().AddException(sigs.v_v());
+  uint8_t except = r.builder().AddException(sigs.v_v());
   constexpr uint32_t kResult0 = 23;
   constexpr uint32_t kResult1 = 42;
 
@@ -411,14 +341,9 @@ WASM_EXEC_TEST(TryCatchAllCallIndirect) {
                                     WASM_DROP))),
       WASM_I32V(kResult0))});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJS(kResult0, 0);
-    r.CheckCallViaJS(kResult1, 1);
-  } else {
-    CHECK_EQ(kResult0, r.CallInterpreter(0));
-    CHECK_EQ(kResult1, r.CallInterpreter(1));
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJS(kResult0, 0);
+  r.CheckCallViaJS(kResult1, 1);
 }
 
 WASM_COMPILED_EXEC_TEST(TryCatchCallExternal) {
@@ -479,11 +404,10 @@ WASM_COMPILED_EXEC_TEST(TryCatchAllCallExternal) {
 
 namespace {
 
-void TestTrapNotCaught(byte* code, size_t code_size,
+void TestTrapNotCaught(uint8_t* code, size_t code_size,
                        TestExecutionTier execution_tier) {
   TestSignatures sigs;
-  WasmRunner<uint32_t> r(execution_tier, kWasmOrigin, nullptr, "main",
-                         kRuntimeExceptionSupport);
+  WasmRunner<uint32_t> r(execution_tier, kWasmOrigin, nullptr, "main");
   r.builder().AddMemory(kWasmPageSize);
   constexpr uint32_t kResultSuccess = 23;
   constexpr uint32_t kResultCaught = 47;
@@ -505,33 +429,29 @@ void TestTrapNotCaught(byte* code, size_t code_size,
                  WASM_DROP),
       WASM_STMTS(WASM_I32V(kResultCaught)))});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJSTraps();
-  } else {
-    r.CallInterpreter();
-  }
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJSTraps();
 }
 
 }  // namespace
 
 WASM_EXEC_TEST(TryCatchTrapUnreachable) {
-  byte code[] = {WASM_UNREACHABLE};
+  uint8_t code[] = {WASM_UNREACHABLE};
   TestTrapNotCaught(code, arraysize(code), execution_tier);
 }
 
 WASM_EXEC_TEST(TryCatchTrapMemOutOfBounds) {
-  byte code[] = {WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V_1(-1))};
+  uint8_t code[] = {WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V_1(-1))};
   TestTrapNotCaught(code, arraysize(code), execution_tier);
 }
 
 WASM_EXEC_TEST(TryCatchTrapDivByZero) {
-  byte code[] = {WASM_I32_DIVS(WASM_LOCAL_GET(0), WASM_I32V_1(0))};
+  uint8_t code[] = {WASM_I32_DIVS(WASM_LOCAL_GET(0), WASM_I32V_1(0))};
   TestTrapNotCaught(code, arraysize(code), execution_tier);
 }
 
 WASM_EXEC_TEST(TryCatchTrapRemByZero) {
-  byte code[] = {WASM_I32_REMS(WASM_LOCAL_GET(0), WASM_I32V_1(0))};
+  uint8_t code[] = {WASM_I32_REMS(WASM_LOCAL_GET(0), WASM_I32V_1(0))};
   TestTrapNotCaught(code, arraysize(code), execution_tier);
 }
 
@@ -539,9 +459,10 @@ WASM_EXEC_TEST(TryCatchTrapTableFill) {
   int table_index = 0;
   int length = 10;  // OOB.
   int start = 10;   // OOB.
-  byte code[] = {WASM_TABLE_FILL(table_index, WASM_I32V(length),
-                                 WASM_REF_NULL(kFuncRefCode), WASM_I32V(start)),
-                 WASM_I32V_1(42)};
+  uint8_t code[] = {
+      WASM_TABLE_FILL(table_index, WASM_I32V(length),
+                      WASM_REF_NULL(kFuncRefCode), WASM_I32V(start)),
+      WASM_I32V_1(42)};
   TestTrapNotCaught(code, arraysize(code), execution_tier);
 }
 
@@ -578,108 +499,22 @@ UNINITIALIZED_WASM_EXEC_TEST(TestStackOverflowNotCaught) {
   LocalContext context(isolate_scope.isolate());
 
   WasmRunner<uint32_t> r(execution_tier, kWasmOrigin, nullptr, "main",
-                         kRuntimeExceptionSupport, kMemory32,
                          isolate_scope.i_isolate());
 
   // Build a function that calls itself until stack overflow.
   WasmFunctionCompiler& stack_overflow = r.NewFunction(sigs.v_v());
-  stack_overflow.Build(
-      {kExprCallFunction, static_cast<byte>(stack_overflow.function_index())});
+  stack_overflow.Build({kExprCallFunction,
+                        static_cast<uint8_t>(stack_overflow.function_index())});
 
   // Build the main test function.
   r.Build({WASM_TRY_CATCH_ALL_T(
       kWasmI32,
       WASM_STMTS(WASM_I32V(1), kExprCallFunction,
-                 static_cast<byte>(stack_overflow.function_index())),
+                 static_cast<uint8_t>(stack_overflow.function_index())),
       WASM_STMTS(WASM_I32V(1)))});
 
-  if (execution_tier != TestExecutionTier::kInterpreter) {
-    // Need to call through JS to allow for creation of stack traces.
-    r.CheckCallViaJSTraps();
-  } else {
-    constexpr int stopped = 0;
-    CHECK_EQ(stopped, r.CallInterpreter());
-  }
-}
-
-TEST(Regress1180457) {
-  TestSignatures sigs;
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  constexpr uint32_t kResult0 = 23;
-  constexpr uint32_t kUnreachable = 42;
-  r.Build({WASM_TRY_CATCH_ALL_T(
-      kWasmI32,
-      WASM_TRY_DELEGATE_T(kWasmI32, WASM_STMTS(WASM_I32V(kResult0), WASM_BR(0)),
-                          0),
-      WASM_I32V(kUnreachable))});
-
-  CHECK_EQ(kResult0, r.CallInterpreter());
-}
-
-TEST(Regress1187896) {
-  TestSignatures sigs;
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  byte try_sig = r.builder().AddSignature(sigs.v_i());
-  constexpr uint32_t kResult = 23;
-  r.Build({kExprI32Const, 0, kExprTry, try_sig, kExprDrop, kExprCatchAll,
-           kExprNop, kExprEnd, kExprI32Const, kResult});
-  CHECK_EQ(kResult, r.CallInterpreter());
-}
-
-TEST(Regress1190291) {
-  TestSignatures sigs;
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  byte try_sig = r.builder().AddSignature(sigs.v_i());
-  r.Build({kExprUnreachable, kExprTry, try_sig, kExprCatchAll, kExprEnd,
-           kExprI32Const, 0});
-  r.CallInterpreter();
-}
-
-TEST(Regress1186795) {
-  TestSignatures sigs;
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  byte except = r.builder().AddException(sigs.v_i());
-  r.Build({WASM_TRY_CATCH_T(
-      kWasmI32,
-      WASM_STMTS(
-          WASM_I32V(0), WASM_I32V(0), WASM_I32V(0), WASM_I32V(0), WASM_I32V(0),
-          WASM_I32V(0), WASM_I32V(0),
-          WASM_TRY_T(kWasmI32, WASM_STMTS(WASM_I32V(0), WASM_THROW(except))),
-          WASM_DROP, WASM_DROP, WASM_DROP, WASM_DROP, WASM_DROP, WASM_DROP,
-          WASM_DROP),
-      WASM_NOP, except)});
-  CHECK_EQ(0, r.CallInterpreter());
-}
-
-TEST(Regress1197408) {
-  TestSignatures sigs;
-  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
-      TestExecutionTier::kInterpreter);
-  byte sig_id = r.builder().AddSignature(sigs.i_iii());
-  r.Build({WASM_STMTS(WASM_I32V(0), WASM_I32V(0), WASM_I32V(0), kExprTry,
-                      sig_id, kExprTry, sig_id, kExprCallFunction, 0,
-                      kExprDelegate, 0, kExprDelegate, 0)});
-  CHECK_EQ(0, r.CallInterpreter(0, 0, 0));
-}
-
-TEST(Regress1212396) {
-  TestSignatures sigs;
-  WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-  byte except = r.builder().AddException(sigs.v_v());
-  r.Build({kExprTry, kVoidCode, kExprTry, kVoidCode, kExprI32Const, 0,
-           kExprThrow, except, kExprDelegate, 0, kExprCatch, except, kExprEnd,
-           kExprI32Const, 42});
-  CHECK_EQ(42, r.CallInterpreter());
-}
-
-TEST(Regress1219746) {
-  TestSignatures sigs;
-  WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-  r.Build({kExprTry, kVoidCode, kExprI32Const, 0, kExprEnd});
-  CHECK_EQ(0, r.CallInterpreter());
+  // Need to call through JS to allow for creation of stack traces.
+  r.CheckCallViaJSTraps();
 }
 
-}  // namespace test_run_wasm_exceptions
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-interpreter.cc b/deps/v8/test/cctest/wasm/test-run-wasm-interpreter.cc
deleted file mode 100644
index 7728138ceab979..00000000000000
--- a/deps/v8/test/cctest/wasm/test-run-wasm-interpreter.cc
+++ /dev/null
@@ -1,558 +0,0 @@
-// Copyright 2016 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include <stdint.h>
-#include <stdlib.h>
-#include <string.h>
-
-#include <memory>
-
-#include "src/codegen/assembler-inl.h"
-#include "test/cctest/cctest.h"
-#include "test/cctest/wasm/wasm-run-utils.h"
-#include "test/common/value-helper.h"
-#include "test/common/wasm/test-signatures.h"
-#include "test/common/wasm/wasm-interpreter.h"
-#include "test/common/wasm/wasm-macro-gen.h"
-
-namespace v8 {
-namespace internal {
-namespace wasm {
-namespace test_run_wasm_interpreter {
-
-TEST(Run_WasmInt8Const_i) {
-  WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-  const byte kExpectedValue = 109;
-  // return(kExpectedValue)
-  r.Build({WASM_I32V_2(kExpectedValue)});
-  CHECK_EQ(kExpectedValue, r.Call());
-}
-
-TEST(Run_WasmIfElse) {
-  WasmRunner<int32_t, int32_t> r(TestExecutionTier::kInterpreter);
-  r.Build({WASM_IF_ELSE_I(WASM_LOCAL_GET(0), WASM_I32V_1(9), WASM_I32V_1(10))});
-  CHECK_EQ(10, r.Call(0));
-  CHECK_EQ(9, r.Call(1));
-}
-
-TEST(Run_WasmIfReturn) {
-  WasmRunner<int32_t, int32_t> r(TestExecutionTier::kInterpreter);
-  r.Build({WASM_IF(WASM_LOCAL_GET(0), WASM_RETURN(WASM_I32V_2(77))),
-           WASM_I32V_2(65)});
-  CHECK_EQ(65, r.Call(0));
-  CHECK_EQ(77, r.Call(1));
-}
-
-TEST(Run_WasmNopsN) {
-  const int kMaxNops = 10;
-  byte code[kMaxNops + 2];
-  for (int nops = 0; nops < kMaxNops; nops++) {
-    byte expected = static_cast<byte>(20 + nops);
-    memset(code, kExprNop, sizeof(code));
-    code[nops] = kExprI32Const;
-    code[nops + 1] = expected;
-
-    WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-    r.Build(code, code + nops + 2);
-    CHECK_EQ(expected, r.Call());
-  }
-}
-
-TEST(Run_WasmConstsN) {
-  const int kMaxConsts = 5;
-  byte code[kMaxConsts * 3];
-  int32_t expected = 0;
-  for (int count = 1; count < kMaxConsts; count++) {
-    for (int i = 0; i < count; i++) {
-      byte val = static_cast<byte>(count * 10 + i);
-      code[i * 3] = kExprI32Const;
-      code[i * 3 + 1] = val;
-      if (i == (count - 1)) {
-        code[i * 3 + 2] = kExprNop;
-        expected = val;
-      } else {
-        code[i * 3 + 2] = kExprDrop;
-      }
-    }
-
-    WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-    r.Build(code, code + (count * 3));
-    CHECK_EQ(expected, r.Call());
-  }
-}
-
-TEST(Run_WasmBlocksN) {
-  const int kMaxNops = 10;
-  const int kExtra = 5;
-  byte code[kMaxNops + kExtra];
-  for (int nops = 0; nops < kMaxNops; nops++) {
-    byte expected = static_cast<byte>(30 + nops);
-    memset(code, kExprNop, sizeof(code));
-    code[0] = kExprBlock;
-    code[1] = kI32Code;
-    code[2 + nops] = kExprI32Const;
-    code[2 + nops + 1] = expected;
-    code[2 + nops + 2] = kExprEnd;
-
-    WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-    r.Build(code, code + nops + kExtra);
-    CHECK_EQ(expected, r.Call());
-  }
-}
-
-TEST(Run_WasmBlockBreakN) {
-  const int kMaxNops = 10;
-  const int kExtra = 6;
-  int run = 0;
-  byte code[kMaxNops + kExtra];
-  for (int nops = 0; nops < kMaxNops; nops++) {
-    // Place the break anywhere within the block.
-    for (int index = 0; index < nops; index++) {
-      memset(code, kExprNop, sizeof(code));
-      code[0] = kExprBlock;
-      code[1] = kI32Code;
-      code[sizeof(code) - 1] = kExprEnd;
-
-      int expected = run++;
-      code[2 + index + 0] = kExprI32Const;
-      code[2 + index + 1] = static_cast<byte>(expected);
-      code[2 + index + 2] = kExprBr;
-      code[2 + index + 3] = 0;
-
-      WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-      r.Build(code, code + kMaxNops + kExtra);
-      CHECK_EQ(expected, r.Call());
-    }
-  }
-}
-
-TEST(Run_Wasm_nested_ifs_i) {
-  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kInterpreter);
-
-  r.Build({WASM_IF_ELSE_I(
-      WASM_LOCAL_GET(0),
-      WASM_IF_ELSE_I(WASM_LOCAL_GET(1), WASM_I32V_1(11), WASM_I32V_1(12)),
-      WASM_IF_ELSE_I(WASM_LOCAL_GET(1), WASM_I32V_1(13), WASM_I32V_1(14)))});
-
-  CHECK_EQ(11, r.Call(1, 1));
-  CHECK_EQ(12, r.Call(1, 0));
-  CHECK_EQ(13, r.Call(0, 1));
-  CHECK_EQ(14, r.Call(0, 0));
-}
-
-// Repeated from test-run-wasm.cc to avoid poluting header files.
-template <typename T>
-static T factorial(T v) {
-  T expected = 1;
-  for (T i = v; i > 1; i--) {
-    expected *= i;
-  }
-  return expected;
-}
-
-// Basic test of return call in interpreter. Good old factorial.
-TEST(Run_Wasm_returnCallFactorial) {
-  EXPERIMENTAL_FLAG_SCOPE(return_call);
-  // Run in bounded amount of stack - 8kb.
-  FlagScope<int32_t> stack_size(&v8_flags.stack_size, 8);
-
-  WasmRunner<uint32_t, int32_t> r(TestExecutionTier::kInterpreter);
-
-  WasmFunctionCompiler& fact_aux_fn =
-      r.NewFunction<int32_t, int32_t, int32_t>("fact_aux");
-
-  r.Build({WASM_RETURN_CALL_FUNCTION(fact_aux_fn.function_index(),
-                                     WASM_LOCAL_GET(0), WASM_I32V(1))});
-
-  fact_aux_fn.Build({WASM_IF_ELSE_I(
-      WASM_I32_EQ(WASM_I32V(1), WASM_LOCAL_GET(0)), WASM_LOCAL_GET(1),
-      WASM_RETURN_CALL_FUNCTION(
-          fact_aux_fn.function_index(),
-          WASM_I32_SUB(WASM_LOCAL_GET(0), WASM_I32V(1)),
-          WASM_I32_MUL(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))))});
-
-  // Runs out of stack space without using return call.
-  uint32_t test_values[] = {1, 2, 5, 10, 20, 20000};
-
-  for (uint32_t v : test_values) {
-    uint32_t found = r.Call(v);
-    CHECK_EQ(factorial(v), found);
-  }
-}
-
-TEST(Run_Wasm_returnCallFactorial64) {
-  EXPERIMENTAL_FLAG_SCOPE(return_call);
-
-  int32_t test_values[] = {1, 2, 5, 10, 20};
-  WasmRunner<int64_t, int32_t> r(TestExecutionTier::kInterpreter);
-
-  WasmFunctionCompiler& fact_aux_fn =
-      r.NewFunction<int64_t, int32_t, int64_t>("fact_aux");
-
-  r.Build({WASM_RETURN_CALL_FUNCTION(fact_aux_fn.function_index(),
-                                     WASM_LOCAL_GET(0), WASM_I64V(1))});
-
-  fact_aux_fn.Build({WASM_IF_ELSE_L(
-      WASM_I32_EQ(WASM_I32V(1), WASM_LOCAL_GET(0)), WASM_LOCAL_GET(1),
-      WASM_RETURN_CALL_FUNCTION(
-          fact_aux_fn.function_index(),
-          WASM_I32_SUB(WASM_LOCAL_GET(0), WASM_I32V(1)),
-          WASM_I64_MUL(WASM_I64_SCONVERT_I32(WASM_LOCAL_GET(0)),
-                       WASM_LOCAL_GET(1))))});
-
-  for (int32_t v : test_values) {
-    CHECK_EQ(factorial<int64_t>(v), r.Call(v));
-  }
-}
-
-TEST(Run_Wasm_returnCallIndirectFactorial) {
-  EXPERIMENTAL_FLAG_SCOPE(return_call);
-
-  TestSignatures sigs;
-
-  WasmRunner<uint32_t, uint32_t> r(TestExecutionTier::kInterpreter);
-
-  WasmFunctionCompiler& fact_aux_fn = r.NewFunction(sigs.i_ii(), "fact_aux");
-
-  // Function table.
-  uint16_t indirect_function_table[] = {
-      static_cast<uint16_t>(fact_aux_fn.function_index())};
-
-  r.builder().AddIndirectFunctionTable(indirect_function_table,
-                                       arraysize(indirect_function_table));
-
-  r.Build({WASM_RETURN_CALL_INDIRECT(fact_aux_fn.sig_index(), WASM_LOCAL_GET(0),
-                                     WASM_I32V(1), WASM_ZERO)});
-
-  fact_aux_fn.Build({WASM_IF_ELSE_I(
-      WASM_I32_EQ(WASM_I32V(1), WASM_LOCAL_GET(0)), WASM_LOCAL_GET(1),
-      WASM_RETURN_CALL_INDIRECT(
-          fact_aux_fn.sig_index(),
-          WASM_I32_SUB(WASM_LOCAL_GET(0), WASM_I32V(1)),
-          WASM_I32_MUL(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)), WASM_ZERO))});
-
-  uint32_t test_values[] = {1, 2, 5, 10, 20};
-
-  for (uint32_t v : test_values) {
-    CHECK_EQ(factorial(v), r.Call(v));
-  }
-}
-// Make tests more robust by not hard-coding offsets of various operations.
-// The {Find} method finds the offsets for the given bytecodes, returning
-// the offsets in an array.
-std::unique_ptr<int[]> Find(byte* code, size_t code_size, int n, ...) {
-  va_list vl;
-  va_start(vl, n);
-
-  std::unique_ptr<int[]> offsets(new int[n]);
-
-  for (int i = 0; i < n; i++) {
-    offsets[i] = -1;
-  }
-
-  int pos = 0;
-  WasmOpcode current = static_cast<WasmOpcode>(va_arg(vl, int));
-  for (size_t i = 0; i < code_size; i++) {
-    if (code[i] == current) {
-      offsets[pos++] = static_cast<int>(i);
-      if (pos == n) break;
-      current = static_cast<WasmOpcode>(va_arg(vl, int));
-    }
-  }
-  va_end(vl);
-
-  return offsets;
-}
-
-TEST(Step_I32Mul) {
-  static const int kTraceLength = 4;
-  byte code[] = {WASM_I32_MUL(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))};
-
-  WasmRunner<int32_t, uint32_t, uint32_t> r(TestExecutionTier::kInterpreter);
-
-  r.Build(code, code + arraysize(code));
-
-  WasmInterpreter* interpreter = r.interpreter();
-
-  FOR_UINT32_INPUTS(a) {
-    for (uint32_t b = 33; b < 3000000000u; b += 1000000000u) {
-      interpreter->Reset();
-      WasmValue args[] = {WasmValue(a), WasmValue(b)};
-      interpreter->InitFrame(r.function(), args);
-
-      // Run instructions one by one.
-      for (int i = 0; i < kTraceLength - 1; i++) {
-        interpreter->Step();
-        // Check the interpreter stopped.
-        CHECK_EQ(WasmInterpreter::PAUSED, interpreter->state());
-      }
-
-      // Run last instruction.
-      interpreter->Step();
-
-      // Check the interpreter finished with the right value.
-      CHECK_EQ(WasmInterpreter::FINISHED, interpreter->state());
-      uint32_t expected = (a) * (b);
-      CHECK_EQ(expected, interpreter->GetReturnValue().to<uint32_t>());
-    }
-  }
-}
-
-TEST(MemoryGrow) {
-  {
-    WasmRunner<int32_t, uint32_t> r(TestExecutionTier::kInterpreter);
-    r.builder().AddMemory(kWasmPageSize);
-    r.builder().SetMaxMemPages(10);
-    r.Build({WASM_MEMORY_GROW(WASM_LOCAL_GET(0))});
-    CHECK_EQ(1, r.Call(1));
-  }
-  {
-    WasmRunner<int32_t, uint32_t> r(TestExecutionTier::kInterpreter);
-    r.builder().AddMemory(kWasmPageSize);
-    r.builder().SetMaxMemPages(10);
-    r.Build({WASM_MEMORY_GROW(WASM_LOCAL_GET(0))});
-    CHECK_EQ(-1, r.Call(11));
-  }
-}
-
-TEST(MemoryGrowPreservesData) {
-  int32_t index = 16;
-  int32_t value = 2335;
-  WasmRunner<int32_t, uint32_t> r(TestExecutionTier::kInterpreter);
-  r.builder().AddMemory(kWasmPageSize);
-  r.Build(
-      {WASM_STORE_MEM(MachineType::Int32(), WASM_I32V(index), WASM_I32V(value)),
-       WASM_MEMORY_GROW(WASM_LOCAL_GET(0)), WASM_DROP,
-       WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V(index))});
-  CHECK_EQ(value, r.Call(1));
-}
-
-TEST(MemoryGrowInvalidSize) {
-  // Grow memory by an invalid amount without initial memory.
-  WasmRunner<int32_t, uint32_t> r(TestExecutionTier::kInterpreter);
-  r.builder().AddMemory(kWasmPageSize);
-  r.Build({WASM_MEMORY_GROW(WASM_LOCAL_GET(0))});
-  CHECK_EQ(-1, r.Call(1048575));
-}
-
-TEST(ReferenceTypeLocals) {
-  {
-    WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_REF_IS_NULL(WASM_REF_NULL(kAnyRefCode))});
-    CHECK_EQ(1, r.Call());
-  }
-  {
-    WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-    r.AllocateLocal(kWasmAnyRef);
-    r.Build({WASM_REF_IS_NULL(WASM_LOCAL_GET(0))});
-    CHECK_EQ(1, r.Call());
-  }
-  {
-    WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-    r.AllocateLocal(kWasmAnyRef);
-    r.Build({WASM_REF_IS_NULL(WASM_LOCAL_TEE(0, WASM_REF_NULL(kAnyRefCode)))});
-    CHECK_EQ(1, r.Call());
-  }
-}
-
-TEST(TestPossibleNondeterminism) {
-  {
-    WasmRunner<int32_t, float> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_I32_REINTERPRET_F32(WASM_LOCAL_GET(0))});
-    r.Call(1048575.5f);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<float>::quiet_NaN());
-    CHECK(!r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<int64_t, double> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_I64_REINTERPRET_F64(WASM_LOCAL_GET(0))});
-    r.Call(16.0);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<double>::quiet_NaN());
-    CHECK(!r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<float, float> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_F32_COPYSIGN(WASM_F32(42.0f), WASM_LOCAL_GET(0))});
-    r.Call(16.0f);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<double>::quiet_NaN());
-    CHECK(!r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<double, double> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_F64_COPYSIGN(WASM_F64(42.0), WASM_LOCAL_GET(0))});
-    r.Call(16.0);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<double>::quiet_NaN());
-    CHECK(!r.possible_nondeterminism());
-  }
-  {
-    int32_t index = 16;
-    WasmRunner<int32_t, float> r(TestExecutionTier::kInterpreter);
-    r.builder().AddMemory(kWasmPageSize);
-    r.Build({WASM_STORE_MEM(MachineType::Float32(), WASM_I32V(index),
-                            WASM_LOCAL_GET(0)),
-             WASM_I32V(index)});
-    r.Call(1345.3456f);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<float>::quiet_NaN());
-    CHECK(!r.possible_nondeterminism());
-  }
-  {
-    int32_t index = 16;
-    WasmRunner<int32_t, double> r(TestExecutionTier::kInterpreter);
-    r.builder().AddMemory(kWasmPageSize);
-    r.Build({WASM_STORE_MEM(MachineType::Float64(), WASM_I32V(index),
-                            WASM_LOCAL_GET(0)),
-             WASM_I32V(index)});
-    r.Call(1345.3456);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<double>::quiet_NaN());
-    CHECK(!r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<float, float> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_F32_ADD(WASM_LOCAL_GET(0), WASM_LOCAL_GET(0))});
-    r.Call(1048575.5f);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<float>::quiet_NaN());
-    CHECK(r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<double, double> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_F64_ADD(WASM_LOCAL_GET(0), WASM_LOCAL_GET(0))});
-    r.Call(16.0);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<double>::quiet_NaN());
-    CHECK(r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<int32_t, float> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_F32_EQ(WASM_LOCAL_GET(0), WASM_LOCAL_GET(0))});
-    r.Call(16.0);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<float>::quiet_NaN());
-    CHECK(!r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<int32_t, double> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_F64_EQ(WASM_LOCAL_GET(0), WASM_LOCAL_GET(0))});
-    r.Call(16.0);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<double>::quiet_NaN());
-    CHECK(!r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<float, float> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_F32_MIN(WASM_LOCAL_GET(0), WASM_LOCAL_GET(0))});
-    r.Call(1048575.5f);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<float>::quiet_NaN());
-    CHECK(r.possible_nondeterminism());
-  }
-  {
-    WasmRunner<double, double> r(TestExecutionTier::kInterpreter);
-    r.Build({WASM_F64_MAX(WASM_LOCAL_GET(0), WASM_LOCAL_GET(0))});
-    r.Call(16.0);
-    CHECK(!r.possible_nondeterminism());
-    r.Call(std::numeric_limits<double>::quiet_NaN());
-    CHECK(r.possible_nondeterminism());
-  }
-}
-
-TEST(InterpreterLoadWithoutMemory) {
-  WasmRunner<int32_t, int32_t> r(TestExecutionTier::kInterpreter);
-  r.builder().AddMemory(0);
-  r.Build({WASM_LOAD_MEM(MachineType::Int32(), WASM_LOCAL_GET(0))});
-  CHECK_TRAP32(r.Call(0));
-}
-
-TEST(Regress1111015) {
-  EXPERIMENTAL_FLAG_SCOPE(return_call);
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  WasmFunctionCompiler& f = r.NewFunction<int32_t>("f");
-  r.Build({WASM_BLOCK_I(WASM_RETURN_CALL_FUNCTION0(f.function_index()),
-                        kExprDrop)});
-  f.Build({WASM_I32V(0)});
-}
-
-TEST(Regress1092130) {
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  TestSignatures sigs;
-  byte sig_v_i = r.builder().AddSignature(sigs.v_i());
-  r.Build({WASM_I32V(0),
-           WASM_IF_ELSE_I(
-               WASM_I32V(0),
-               WASM_SEQ(WASM_UNREACHABLE, WASM_BLOCK_X(sig_v_i, WASM_NOP)),
-               WASM_I32V(0)),
-           WASM_DROP});
-  r.Call();
-}
-
-TEST(Regress1247119) {
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  r.Build({kExprLoop, 0, kExprTry, 0, kExprUnreachable, kExprDelegate, 0,
-           kExprEnd});
-  r.Call();
-}
-
-TEST(Regress1246712) {
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  TestSignatures sigs;
-  const int kExpected = 1;
-  uint8_t except = r.builder().AddException(sigs.v_v());
-  r.Build({kExprTry, kWasmI32.value_type_code(), kExprTry,
-           kWasmI32.value_type_code(), kExprThrow, except, kExprEnd,
-           kExprCatchAll, kExprI32Const, kExpected, kExprEnd});
-  CHECK_EQ(kExpected, r.Call());
-}
-
-TEST(Regress1249306) {
-  WasmRunner<uint32_t> r(TestExecutionTier::kInterpreter);
-  r.Build({kExprTry, kVoid, kExprCatchAll, kExprTry, kVoid, kExprDelegate, 0,
-           kExprEnd, kExprI32Const, 0});
-  r.Call();
-}
-
-TEST(Regress1251845) {
-  WasmRunner<uint32_t, uint32_t, uint32_t, uint32_t> r(
-      TestExecutionTier::kInterpreter);
-  ValueType reps[] = {kWasmI32, kWasmI32, kWasmI32, kWasmI32};
-  FunctionSig sig_iii_i(1, 3, reps);
-  byte sig = r.builder().AddSignature(&sig_iii_i);
-  r.Build({
-      // clang-format off
-      kExprI32Const, 0,
-      kExprI32Const, 0,
-      kExprI32Const, 0,
-      kExprTry, sig,
-        kExprI32Const, 0,
-        kExprTry, 0,
-          kExprTry, 0,
-            kExprI32Const, 0,
-            kExprTry, sig,
-              kExprUnreachable,
-              kExprTry, 0,
-                kExprUnreachable,
-                kExprEnd,
-              kExprTry, sig,
-                kExprUnreachable,
-                kExprEnd,
-              kExprEnd,
-            kExprUnreachable,
-            kExprEnd,
-          kExprEnd,
-        kExprUnreachable,
-        kExprEnd
-      // clang-format on
-  });
-  r.Call(0, 0, 0);
-}
-
-}  // namespace test_run_wasm_interpreter
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-js.cc b/deps/v8/test/cctest/wasm/test-run-wasm-js.cc
index 04ab378ace86f4..640d2acfeee9c0 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-js.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-js.cc
@@ -133,13 +133,13 @@ void RunJSSelectTest(TestExecutionTier tier, int which) {
     WasmFunctionCompiler& t = r.NewFunction(&sig);
 
     {
-      std::vector<byte> code;
+      std::vector<uint8_t> code;
 
       for (int i = 0; i < num_params; i++) {
         ADD_CODE(code, WASM_F64(inputs.arg_d(i)));
       }
 
-      ADD_CODE(code, kExprCallFunction, static_cast<byte>(js_index));
+      ADD_CODE(code, kExprCallFunction, static_cast<uint8_t>(js_index));
 
       size_t end = code.size();
       code.push_back(0);
@@ -371,7 +371,7 @@ void RunJSSelectAlignTest(TestExecutionTier tier, int num_args,
   Zone zone(&allocator, ZONE_NAME);
 
   // Build the calling code.
-  std::vector<byte> code;
+  std::vector<uint8_t> code;
 
   for (int i = 0; i < num_params; i++) {
     ADD_CODE(code, WASM_LOCAL_GET(i));
@@ -499,7 +499,7 @@ void RunPickerTest(TestExecutionTier tier, bool indirect) {
   WasmFunctionCompiler& rc_fn = r.NewFunction(sigs.i_i(), "rc");
 
   if (indirect) {
-    byte sig_index = r.builder().AddSignature(sigs.i_iii());
+    uint8_t sig_index = r.builder().AddSignature(sigs.i_iii());
     uint16_t indirect_function_table[] = {static_cast<uint16_t>(js_index)};
 
     r.builder().AddIndirectFunctionTable(indirect_function_table,
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-memory64.cc b/deps/v8/test/cctest/wasm/test-run-wasm-memory64.cc
index 633dc309f7ff19..213f3a6eaae82f 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-memory64.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-memory64.cc
@@ -9,28 +9,32 @@
 #include "test/common/wasm/wasm-macro-gen.h"
 #include "test/common/wasm/wasm-module-runner.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
+namespace v8::internal::wasm {
 
 template <typename ReturnType, typename... ParamTypes>
 class Memory64Runner : public WasmRunner<ReturnType, ParamTypes...> {
  public:
   explicit Memory64Runner(TestExecutionTier execution_tier)
-      : WasmRunner<ReturnType, ParamTypes...>(
-            execution_tier, kWasmOrigin, nullptr, "main",
-            kNoRuntimeExceptionSupport, kMemory64) {
+      : WasmRunner<ReturnType, ParamTypes...>(execution_tier, kWasmOrigin,
+                                              nullptr, "main") {
     this->builder().EnableFeature(kFeature_memory64);
   }
+
+  template <typename T>
+  T* AddMemoryElems(uint32_t count) {
+    return this->builder().template AddMemoryElems<T>(count, kMemory64);
+  }
+
+  uint8_t* AddMemory(uint32_t size,
+                     SharedFlag shared = SharedFlag::kNotShared) {
+    return this->builder().AddMemory(size, shared, kMemory64);
+  }
 };
 
 WASM_EXEC_TEST(Load) {
-  // TODO(clemensb): Implement memory64 in the interpreter.
-  if (execution_tier == TestExecutionTier::kInterpreter) return;
-
   Memory64Runner<uint32_t, uint64_t> r(execution_tier);
   uint32_t* memory =
-      r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(int32_t));
+      r.AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(int32_t));
 
   r.Build({WASM_LOAD_MEM(MachineType::Int32(), WASM_LOCAL_GET(0))});
 
@@ -63,7 +67,7 @@ WASM_EXEC_TEST(InitExpression) {
 
   ErrorThrower thrower(isolate, "TestMemory64InitExpression");
 
-  const byte data[] = {
+  const uint8_t data[] = {
       WASM_MODULE_HEADER,                     //
       SECTION(Memory,                         //
               ENTRY_COUNT(1),                 //
@@ -81,18 +85,15 @@ WASM_EXEC_TEST(InitExpression) {
   testing::CompileAndInstantiateForTesting(
       isolate, &thrower, ModuleWireBytes(data, data + arraysize(data)));
   if (thrower.error()) {
-    thrower.Reify()->Print();
+    Print(*thrower.Reify());
     FATAL("compile or instantiate error");
   }
 }
 
 WASM_EXEC_TEST(MemorySize) {
-  // TODO(clemensb): Implement memory64 in the interpreter.
-  if (execution_tier == TestExecutionTier::kInterpreter) return;
-
   Memory64Runner<uint64_t> r(execution_tier);
   constexpr int kNumPages = 13;
-  r.builder().AddMemoryElems<uint8_t>(kNumPages * kWasmPageSize);
+  r.AddMemoryElems<uint8_t>(kNumPages * kWasmPageSize);
 
   r.Build({WASM_MEMORY_SIZE});
 
@@ -100,12 +101,9 @@ WASM_EXEC_TEST(MemorySize) {
 }
 
 WASM_EXEC_TEST(MemoryGrow) {
-  // TODO(clemensb): Implement memory64 in the interpreter.
-  if (execution_tier == TestExecutionTier::kInterpreter) return;
-
   Memory64Runner<int64_t, int64_t> r(execution_tier);
+  r.AddMemory(kWasmPageSize);
   r.builder().SetMaxMemPages(13);
-  r.builder().AddMemory(kWasmPageSize);
 
   r.Build({WASM_MEMORY_GROW(WASM_LOCAL_GET(0))});
   CHECK_EQ(1, r.Call(6));
@@ -119,6 +117,4 @@ WASM_EXEC_TEST(MemoryGrow) {
   CHECK_EQ(8, r.Call(5));   // Just at the maximum of 13.
 }
 
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-module.cc b/deps/v8/test/cctest/wasm/test-run-wasm-module.cc
index e46be437034e26..48cc743c1ddbe8 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-module.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-module.cc
@@ -88,7 +88,7 @@ TEST(Run_WasmModule_Return114) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_I32V_2(kReturnValue)};
+    uint8_t code[] = {WASM_I32V_2(kReturnValue)};
     EMIT_CODE_WITH_END(f, code);
     TestModule(&zone, builder, kReturnValue);
   }
@@ -109,7 +109,7 @@ TEST(Run_WasmModule_CompilationHintsLazy) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_I32V_2(kReturnValue)};
+    uint8_t code[] = {WASM_I32V_2(kReturnValue)};
     EMIT_CODE_WITH_END(f, code);
     f->SetCompilationHint(WasmCompilationHintStrategy::kLazy,
                           WasmCompilationHintTier::kBaseline,
@@ -169,7 +169,7 @@ TEST(Run_WasmModule_CompilationHintsNoTiering) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_I32V_2(kReturnValue)};
+    uint8_t code[] = {WASM_I32V_2(kReturnValue)};
     EMIT_CODE_WITH_END(f, code);
     f->SetCompilationHint(WasmCompilationHintStrategy::kEager,
                           WasmCompilationHintTier::kBaseline,
@@ -217,7 +217,7 @@ TEST(Run_WasmModule_CompilationHintsTierUp) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_I32V_2(kReturnValue)};
+    uint8_t code[] = {WASM_I32V_2(kReturnValue)};
     EMIT_CODE_WITH_END(f, code);
     f->SetCompilationHint(WasmCompilationHintStrategy::kEager,
                           WasmCompilationHintTier::kBaseline,
@@ -279,7 +279,7 @@ TEST(Run_WasmModule_CompilationHintsLazyBaselineEagerTopTier) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_I32V_2(kReturnValue)};
+    uint8_t code[] = {WASM_I32V_2(kReturnValue)};
     EMIT_CODE_WITH_END(f, code);
     f->SetCompilationHint(
         WasmCompilationHintStrategy::kLazyBaselineEagerTopTier,
@@ -328,14 +328,14 @@ TEST(Run_WasmModule_CallAdd) {
     WasmFunctionBuilder* f1 = builder->AddFunction(sigs.i_ii());
     uint16_t param1 = 0;
     uint16_t param2 = 1;
-    byte code1[] = {
+    uint8_t code1[] = {
         WASM_I32_ADD(WASM_LOCAL_GET(param1), WASM_LOCAL_GET(param2))};
     EMIT_CODE_WITH_END(f1, code1);
 
     WasmFunctionBuilder* f2 = builder->AddFunction(sigs.i_v());
 
     ExportAsMain(f2);
-    byte code2[] = {
+    uint8_t code2[] = {
         WASM_CALL_FUNCTION(f1->func_index(), WASM_I32V_2(77), WASM_I32V_1(22))};
     EMIT_CODE_WITH_END(f2, code2);
     TestModule(&zone, builder, 99);
@@ -345,7 +345,7 @@ TEST(Run_WasmModule_CallAdd) {
 
 TEST(Run_WasmModule_ReadLoadedDataSegment) {
   {
-    static const byte kDataSegmentDest0 = 12;
+    static const uint8_t kDataSegmentDest0 = 12;
     v8::internal::AccountingAllocator allocator;
     Zone zone(&allocator, ZONE_NAME);
     TestSignatures sigs;
@@ -354,10 +354,10 @@ TEST(Run_WasmModule_ReadLoadedDataSegment) {
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
 
     ExportAsMain(f);
-    byte code[] = {
+    uint8_t code[] = {
         WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V_1(kDataSegmentDest0))};
     EMIT_CODE_WITH_END(f, code);
-    byte data[] = {0xAA, 0xBB, 0xCC, 0xDD};
+    uint8_t data[] = {0xAA, 0xBB, 0xCC, 0xDD};
     builder->AddDataSegment(data, sizeof(data), kDataSegmentDest0);
     TestModule(&zone, builder, 0xDDCCBBAA);
   }
@@ -376,7 +376,7 @@ TEST(Run_WasmModule_CheckMemoryIsZero) {
 
     uint16_t localIndex = f->AddLocal(kWasmI32);
     ExportAsMain(f);
-    byte code[] = {WASM_BLOCK_I(
+    uint8_t code[] = {WASM_BLOCK_I(
         WASM_WHILE(
             WASM_I32_LTS(WASM_LOCAL_GET(localIndex), WASM_I32V_3(kCheckSize)),
             WASM_IF_ELSE(
@@ -401,7 +401,7 @@ TEST(Run_WasmModule_CallMain_recursive) {
 
     uint16_t localIndex = f->AddLocal(kWasmI32);
     ExportAsMain(f);
-    byte code[] = {
+    uint8_t code[] = {
         WASM_LOCAL_SET(localIndex,
                        WASM_LOAD_MEM(MachineType::Int32(), WASM_ZERO)),
         WASM_IF_ELSE_I(WASM_I32_LTS(WASM_LOCAL_GET(localIndex), WASM_I32V_1(5)),
@@ -422,17 +422,17 @@ TEST(Run_WasmModule_Global) {
     TestSignatures sigs;
 
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
-    uint32_t global1 = builder->AddGlobal(kWasmI32);
-    uint32_t global2 = builder->AddGlobal(kWasmI32);
+    uint32_t global1 = builder->AddGlobal(kWasmI32, true, WasmInitExpr(0));
+    uint32_t global2 = builder->AddGlobal(kWasmI32, true, WasmInitExpr(0));
     WasmFunctionBuilder* f1 = builder->AddFunction(sigs.i_v());
-    byte code1[] = {
+    uint8_t code1[] = {
         WASM_I32_ADD(WASM_GLOBAL_GET(global1), WASM_GLOBAL_GET(global2))};
     EMIT_CODE_WITH_END(f1, code1);
     WasmFunctionBuilder* f2 = builder->AddFunction(sigs.i_v());
     ExportAsMain(f2);
-    byte code2[] = {WASM_GLOBAL_SET(global1, WASM_I32V_1(56)),
-                    WASM_GLOBAL_SET(global2, WASM_I32V_1(41)),
-                    WASM_RETURN(WASM_CALL_FUNCTION0(f1->func_index()))};
+    uint8_t code2[] = {WASM_GLOBAL_SET(global1, WASM_I32V_1(56)),
+                       WASM_GLOBAL_SET(global2, WASM_I32V_1(41)),
+                       WASM_RETURN(WASM_CALL_FUNCTION0(f1->func_index()))};
     EMIT_CODE_WITH_END(f2, code2);
     TestModule(&zone, builder, 97);
   }
@@ -450,7 +450,7 @@ TEST(MemorySize) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_MEMORY_SIZE};
+    uint8_t code[] = {WASM_MEMORY_SIZE};
     EMIT_CODE_WITH_END(f, code);
     TestModule(&zone, builder, kExpectedValue);
   }
@@ -468,8 +468,8 @@ TEST(Run_WasmModule_MemSize_GrowMem) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_MEMORY_GROW(WASM_I32V_1(10)), WASM_DROP,
-                   WASM_MEMORY_SIZE};
+    uint8_t code[] = {WASM_MEMORY_GROW(WASM_I32V_1(10)), WASM_DROP,
+                      WASM_MEMORY_SIZE};
     EMIT_CODE_WITH_END(f, code);
     TestModule(&zone, builder, kExpectedValue);
   }
@@ -487,7 +487,7 @@ TEST(MemoryGrowZero) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_MEMORY_GROW(WASM_I32V(0))};
+    uint8_t code[] = {WASM_MEMORY_GROW(WASM_I32V(0))};
     EMIT_CODE_WITH_END(f, code);
     TestModule(&zone, builder, kExpectedValue);
   }
@@ -550,7 +550,7 @@ TEST(TestInterruptLoop) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {
+    uint8_t code[] = {
         WASM_LOOP(
             WASM_IF(WASM_NOT(WASM_LOAD_MEM(
                         MachineType::Int32(),
@@ -571,7 +571,7 @@ TEST(TestInterruptLoop) {
             isolate, &thrower, ModuleWireBytes(buffer.begin(), buffer.end()))
             .ToHandleChecked();
 
-    Handle<JSArrayBuffer> memory(instance->memory_object().array_buffer(),
+    Handle<JSArrayBuffer> memory(instance->memory_object(0)->array_buffer(),
                                  isolate);
     std::atomic<int32_t>* memory_array =
         reinterpret_cast<std::atomic<int32_t>*>(memory->backing_store());
@@ -595,8 +595,8 @@ TEST(Run_WasmModule_MemoryGrowInIf) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_IF_ELSE_I(WASM_I32V(0), WASM_MEMORY_GROW(WASM_I32V(1)),
-                                  WASM_I32V(12))};
+    uint8_t code[] = {WASM_IF_ELSE_I(
+        WASM_I32V(0), WASM_MEMORY_GROW(WASM_I32V(1)), WASM_I32V(12))};
     EMIT_CODE_WITH_END(f, code);
     TestModule(&zone, builder, 12);
   }
@@ -616,9 +616,9 @@ TEST(Run_WasmModule_GrowMemOobOffset) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
     ExportAsMain(f);
-    byte code[] = {WASM_MEMORY_GROW(WASM_I32V_1(1)),
-                   WASM_STORE_MEM(MachineType::Int32(), WASM_I32V(index),
-                                  WASM_I32V(value))};
+    uint8_t code[] = {WASM_MEMORY_GROW(WASM_I32V_1(1)),
+                      WASM_STORE_MEM(MachineType::Int32(), WASM_I32V(index),
+                                     WASM_I32V(value))};
     EMIT_CODE_WITH_END(f, code);
     TestModuleException(&zone, builder);
   }
@@ -638,10 +638,10 @@ TEST(Run_WasmModule_GrowMemOobFixedIndex) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_i());
     ExportAsMain(f);
-    byte code[] = {WASM_MEMORY_GROW(WASM_LOCAL_GET(0)), WASM_DROP,
-                   WASM_STORE_MEM(MachineType::Int32(), WASM_I32V(index),
-                                  WASM_I32V(value)),
-                   WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V(index))};
+    uint8_t code[] = {WASM_MEMORY_GROW(WASM_LOCAL_GET(0)), WASM_DROP,
+                      WASM_STORE_MEM(MachineType::Int32(), WASM_I32V(index),
+                                     WASM_I32V(value)),
+                      WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V(index))};
     EMIT_CODE_WITH_END(f, code);
 
     HandleScope scope(isolate);
@@ -686,10 +686,10 @@ TEST(Run_WasmModule_GrowMemOobVariableIndex) {
     WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_i());
     ExportAsMain(f);
-    byte code[] = {WASM_MEMORY_GROW(WASM_I32V_1(1)), WASM_DROP,
-                   WASM_STORE_MEM(MachineType::Int32(), WASM_LOCAL_GET(0),
-                                  WASM_I32V(value)),
-                   WASM_LOAD_MEM(MachineType::Int32(), WASM_LOCAL_GET(0))};
+    uint8_t code[] = {WASM_MEMORY_GROW(WASM_I32V_1(1)), WASM_DROP,
+                      WASM_STORE_MEM(MachineType::Int32(), WASM_LOCAL_GET(0),
+                                     WASM_I32V(value)),
+                      WASM_LOAD_MEM(MachineType::Int32(), WASM_LOCAL_GET(0))};
     EMIT_CODE_WITH_END(f, code);
 
     HandleScope scope(isolate);
@@ -745,7 +745,7 @@ TEST(Run_WasmModule_Global_init) {
     uint32_t global2 =
         builder->AddGlobal(kWasmI32, false, WasmInitExpr(222222));
     WasmFunctionBuilder* f1 = builder->AddFunction(sigs.i_v());
-    byte code[] = {
+    uint8_t code[] = {
         WASM_I32_ADD(WASM_GLOBAL_GET(global1), WASM_GLOBAL_GET(global2))};
     EMIT_CODE_WITH_END(f1, code);
     ExportAsMain(f1);
@@ -777,7 +777,7 @@ static void RunWasmModuleGlobalInitTest(ValueType type, CType expected) {
       }
 
       WasmFunctionBuilder* f1 = builder->AddFunction(&sig);
-      byte code[] = {WASM_GLOBAL_GET(global)};
+      uint8_t code[] = {WASM_GLOBAL_GET(global)};
       EMIT_CODE_WITH_END(f1, code);
       ExportAsMain(f1);
       TestModule(&zone, builder, expected);
@@ -809,7 +809,7 @@ TEST(InitDataAtTheUpperLimit) {
 
     ErrorThrower thrower(isolate, "Run_WasmModule_InitDataAtTheUpperLimit");
 
-    const byte data[] = {
+    const uint8_t data[] = {
         WASM_MODULE_HEADER,   // --
         kMemorySectionCode,   // --
         U32V_1(4),            // section size
@@ -830,7 +830,7 @@ TEST(InitDataAtTheUpperLimit) {
     CompileAndInstantiateForTesting(
         isolate, &thrower, ModuleWireBytes(data, data + arraysize(data)));
     if (thrower.error()) {
-      thrower.Reify()->Print();
+      Print(*thrower.Reify());
       FATAL("compile or instantiate error");
     }
   }
@@ -845,7 +845,7 @@ TEST(EmptyMemoryNonEmptyDataSegment) {
 
     ErrorThrower thrower(isolate, "Run_WasmModule_InitDataAtTheUpperLimit");
 
-    const byte data[] = {
+    const uint8_t data[] = {
         WASM_MODULE_HEADER,  // --
         kMemorySectionCode,  // --
         U32V_1(4),           // section size
@@ -879,7 +879,7 @@ TEST(EmptyMemoryEmptyDataSegment) {
 
     ErrorThrower thrower(isolate, "Run_WasmModule_InitDataAtTheUpperLimit");
 
-    const byte data[] = {
+    const uint8_t data[] = {
         WASM_MODULE_HEADER,  // --
         kMemorySectionCode,  // --
         U32V_1(4),           // section size
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-relaxed-simd.cc b/deps/v8/test/cctest/wasm/test-run-wasm-relaxed-simd.cc
index acaf8b7b05747f..efabd016e0a736 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-relaxed-simd.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-relaxed-simd.cc
@@ -27,10 +27,6 @@ namespace test_run_wasm_relaxed_simd {
     EXPERIMENTAL_FLAG_SCOPE(relaxed_simd);                      \
     RunWasm_##name##_Impl(TestExecutionTier::kTurbofan);        \
   }                                                             \
-  TEST(RunWasm_##name##_interpreter) {                          \
-    EXPERIMENTAL_FLAG_SCOPE(relaxed_simd);                      \
-    RunWasm_##name##_Impl(TestExecutionTier::kInterpreter);     \
-  }                                                             \
   TEST(RunWasm_##name##_liftoff) {                              \
     EXPERIMENTAL_FLAG_SCOPE(relaxed_simd);                      \
     FLAG_SCOPE(liftoff_only);                                   \
@@ -137,7 +133,7 @@ WASM_RELAXED_SIMD_TEST(F32x4Qfma) {
   // Set up global to hold mask output.
   float* g = r.builder().AddGlobal<float>(kWasmS128);
   // Build fn to splat test values, perform compare op, and write the result.
-  byte value1 = 0, value2 = 1, value3 = 2;
+  uint8_t value1 = 0, value2 = 1, value3 = 2;
   r.Build(
       {WASM_GLOBAL_SET(0, WASM_SIMD_F32x4_QFMA(
                               WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value1)),
@@ -161,7 +157,7 @@ WASM_RELAXED_SIMD_TEST(F32x4Qfms) {
   // Set up global to hold mask output.
   float* g = r.builder().AddGlobal<float>(kWasmS128);
   // Build fn to splat test values, perform compare op, and write the result.
-  byte value1 = 0, value2 = 1, value3 = 2;
+  uint8_t value1 = 0, value2 = 1, value3 = 2;
   r.Build(
       {WASM_GLOBAL_SET(0, WASM_SIMD_F32x4_QFMS(
                               WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value1)),
@@ -185,7 +181,7 @@ WASM_RELAXED_SIMD_TEST(F64x2Qfma) {
   // Set up global to hold mask output.
   double* g = r.builder().AddGlobal<double>(kWasmS128);
   // Build fn to splat test values, perform compare op, and write the result.
-  byte value1 = 0, value2 = 1, value3 = 2;
+  uint8_t value1 = 0, value2 = 1, value3 = 2;
   r.Build(
       {WASM_GLOBAL_SET(0, WASM_SIMD_F64x2_QFMA(
                               WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(value1)),
@@ -209,7 +205,7 @@ WASM_RELAXED_SIMD_TEST(F64x2Qfms) {
   // Set up global to hold mask output.
   double* g = r.builder().AddGlobal<double>(kWasmS128);
   // Build fn to splat test values, perform compare op, and write the result.
-  byte value1 = 0, value2 = 1, value3 = 2;
+  uint8_t value1 = 0, value2 = 1, value3 = 2;
   r.Build(
       {WASM_GLOBAL_SET(0, WASM_SIMD_F64x2_QFMS(
                               WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(value1)),
@@ -233,9 +229,9 @@ TEST(RunWasm_RegressFmaReg_liftoff) {
   FLAG_SCOPE(liftoff_only);
   TestExecutionTier execution_tier = TestExecutionTier::kLiftoff;
   WasmRunner<int32_t, float, float, float> r(execution_tier);
-  byte local = r.AllocateLocal(kWasmS128);
+  uint8_t local = r.AllocateLocal(kWasmS128);
   float* g = r.builder().AddGlobal<float>(kWasmS128);
-  byte value1 = 0, value2 = 1, value3 = 2;
+  uint8_t value1 = 0, value2 = 1, value3 = 2;
   r.Build(
       {// Get the first arg from a local so that the register is blocked even
        // after the arguments have been popped off the stack. This ensures that
@@ -433,9 +429,9 @@ WASM_RELAXED_SIMD_TEST(I16x8RelaxedQ15MulRS) {
   // Global to hold output.
   int16_t* g = r.builder().template AddGlobal<int16_t>(kWasmS128);
   // Build fn to splat test values, perform binop, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(kExprI16x8RelaxedQ15MulRS,
@@ -464,9 +460,9 @@ WASM_RELAXED_SIMD_TEST(I16x8RelaxedQ15MulRS) {
 WASM_RELAXED_SIMD_TEST(I16x8DotI8x16I7x16S) {
   WasmRunner<int32_t, int8_t, int8_t> r(execution_tier);
   int16_t* g = r.builder().template AddGlobal<int16_t>(kWasmS128);
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(kExprI16x8DotI8x16I7x16S,
@@ -489,10 +485,10 @@ WASM_RELAXED_SIMD_TEST(I16x8DotI8x16I7x16S) {
 WASM_RELAXED_SIMD_TEST(I32x4DotI8x16I7x16AddS) {
   WasmRunner<int32_t, int8_t, int8_t, int32_t> r(execution_tier);
   int32_t* g = r.builder().template AddGlobal<int32_t>(kWasmS128);
-  byte value1 = 0, value2 = 1, value3 = 2;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
-  byte temp3 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1, value3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_LOCAL_SET(temp3, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value3))),
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-simd-liftoff.cc b/deps/v8/test/cctest/wasm/test-run-wasm-simd-liftoff.cc
index 1f6ddd519ff422..0a9bc1a6314084 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-simd-liftoff.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-simd-liftoff.cc
@@ -23,7 +23,7 @@ namespace test_run_wasm_simd_liftoff {
 
 TEST(S128Local) {
   WasmRunner<int32_t> r(TestExecutionTier::kLiftoff);
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_LOCAL_GET(temp1)), WASM_ONE});
   CHECK_EQ(1, r.Call());
 }
@@ -54,7 +54,7 @@ TEST(S128Param) {
   TestSignatures sigs;
   // We use a temp local to materialize a SIMD value, since at this point
   // Liftoff does not support any SIMD operations.
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   WasmFunctionCompiler& simd_func = r.NewFunction(sigs.i_s());
   simd_func.Build({WASM_ONE});
 
@@ -69,7 +69,7 @@ TEST(S128Return) {
   WasmRunner<int32_t> r(TestExecutionTier::kLiftoff);
   TestSignatures sigs;
   WasmFunctionCompiler& simd_func = r.NewFunction(sigs.s_i());
-  byte temp1 = simd_func.AllocateLocal(kWasmS128);
+  uint8_t temp1 = simd_func.AllocateLocal(kWasmS128);
   simd_func.Build({WASM_LOCAL_GET(temp1)});
 
   r.Build({WASM_CALL_FUNCTION(simd_func.function_index(), WASM_ONE), kExprDrop,
@@ -88,7 +88,7 @@ TEST(REGRESS_1088273) {
   WasmRunner<int32_t> r(TestExecutionTier::kLiftoff);
   TestSignatures sigs;
   WasmFunctionCompiler& simd_func = r.NewFunction(sigs.s_i());
-  byte temp1 = simd_func.AllocateLocal(kWasmS128);
+  uint8_t temp1 = simd_func.AllocateLocal(kWasmS128);
   simd_func.Build({WASM_LOCAL_GET(temp1)});
 
   r.Build({WASM_SIMD_SPLAT(I8x16, WASM_I32V(0x80)),
@@ -103,25 +103,25 @@ TEST(REGRESS_1088273) {
 TEST(I8x16Shuffle) {
   WasmRunner<int32_t> r(TestExecutionTier::kLiftoff);
   // Temps to use up registers and force non-adjacent registers for shuffle.
-  byte local0 = r.AllocateLocal(kWasmS128);
-  byte local1 = r.AllocateLocal(kWasmS128);
+  uint8_t local0 = r.AllocateLocal(kWasmS128);
+  uint8_t local1 = r.AllocateLocal(kWasmS128);
 
   //  g0 and g1 are globals that hold input values for the shuffle,
   //  g0 contains byte array [0, 1, ... 15], g1 contains byte array [16, 17,
   //  ... 31]. They should never be overwritten - write only to output.
-  byte* g0 = r.builder().AddGlobal<byte>(kWasmS128);
-  byte* g1 = r.builder().AddGlobal<byte>(kWasmS128);
+  uint8_t* g0 = r.builder().AddGlobal<uint8_t>(kWasmS128);
+  uint8_t* g1 = r.builder().AddGlobal<uint8_t>(kWasmS128);
   for (int i = 0; i < 16; i++) {
     LANE(g0, i) = i;
     LANE(g1, i) = i + 16;
   }
 
   // Output global holding a kWasmS128.
-  byte* output = r.builder().AddGlobal<byte>(kWasmS128);
+  uint8_t* output = r.builder().AddGlobal<uint8_t>(kWasmS128);
 
   // i8x16_shuffle(lhs, rhs, pattern) will take the last element of rhs and
   // place it into the last lane of lhs.
-  std::array<byte, 16> pattern = {
+  std::array<uint8_t, 16> pattern = {
       {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 31}};
 
   // Set up locals so shuffle is called with non-adjacent registers v2 and v0.
@@ -138,7 +138,7 @@ TEST(I8x16Shuffle) {
 
   // The shuffle pattern only changes the last element.
   for (int i = 0; i < 15; i++) {
-    byte actual = LANE(output, i);
+    uint8_t actual = LANE(output, i);
     CHECK_EQ(i, actual);
   }
   CHECK_EQ(31, LANE(output, 15));
@@ -148,19 +148,19 @@ TEST(I8x16Shuffle) {
 // shuffle are the same register.
 TEST(I8x16Shuffle_SingleOperand) {
   WasmRunner<int32_t> r(TestExecutionTier::kLiftoff);
-  byte local0 = r.AllocateLocal(kWasmS128);
+  uint8_t local0 = r.AllocateLocal(kWasmS128);
 
-  byte* g0 = r.builder().AddGlobal<byte>(kWasmS128);
+  uint8_t* g0 = r.builder().AddGlobal<uint8_t>(kWasmS128);
   for (int i = 0; i < 16; i++) {
     LANE(g0, i) = i;
   }
 
-  byte* output = r.builder().AddGlobal<byte>(kWasmS128);
+  uint8_t* output = r.builder().AddGlobal<uint8_t>(kWasmS128);
 
   // This pattern reverses first operand. 31 should select the last lane of
   // the second operand, but since the operands are the same, the effect is that
   // the first operand is reversed.
-  std::array<byte, 16> pattern = {
+  std::array<uint8_t, 16> pattern = {
       {31, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0}};
 
   // Set up locals so shuffle is called with non-adjacent registers v2 and v0.
@@ -175,7 +175,7 @@ TEST(I8x16Shuffle_SingleOperand) {
 
   for (int i = 0; i < 16; i++) {
     // Check that the output is the reverse of input.
-    byte actual = LANE(output, i);
+    uint8_t actual = LANE(output, i);
     CHECK_EQ(15 - i, actual);
   }
 }
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-simd.cc b/deps/v8/test/cctest/wasm/test-run-wasm-simd.cc
index c353d8ec49a6e9..8842a6bf57850d 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-simd.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-simd.cc
@@ -25,6 +25,7 @@
 #include "src/codegen/cpu-features.h"
 #include "src/codegen/machine-type.h"
 #include "src/common/globals.h"
+#include "src/compiler/opcodes.h"
 #include "src/flags/flags.h"
 #include "src/utils/utils.h"
 #include "src/wasm/compilation-environment.h"
@@ -218,6 +219,35 @@ template <typename T>
 T Abs(T a) {
   return std::abs(a);
 }
+
+template <typename T>
+T BitwiseNot(T a) {
+  return ~a;
+}
+
+template <typename T>
+T BitwiseAnd(T a, T b) {
+  return a & b;
+}
+
+template <typename T>
+T BitwiseOr(T a, T b) {
+  return a | b;
+}
+template <typename T>
+T BitwiseXor(T a, T b) {
+  return a ^ b;
+}
+template <typename T>
+T BitwiseAndNot(T a, T b) {
+  return a & (~b);
+}
+
+template <typename T>
+T BitwiseSelect(T a, T b, T c) {
+  return (a & c) | (b & ~c);
+}
+
 }  // namespace
 
 #define WASM_SIMD_CHECK_LANE_S(TYPE, value, LANE_TYPE, lane_value, lane_index) \
@@ -257,7 +287,7 @@ WASM_EXEC_TEST(F32x4Splat) {
   WasmRunner<int32_t, float> r(execution_tier);
   // Set up a global to hold output vector.
   float* g = r.builder().AddGlobal<float>(kWasmS128);
-  byte param1 = 0;
+  uint8_t param1 = 0;
   r.Build({WASM_GLOBAL_SET(0, WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(param1))),
            WASM_ONE});
 
@@ -280,7 +310,7 @@ WASM_EXEC_TEST(F32x4ReplaceLane) {
   // Set up a global to hold input/output vector.
   float* g = r.builder().AddGlobal<float>(kWasmS128);
   // Build function to replace each lane with its (FP) index.
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F32x4_SPLAT(WASM_F32(3.14159f))),
            WASM_LOCAL_SET(temp1, WASM_SIMD_F32x4_REPLACE_LANE(
                                      0, WASM_LOCAL_GET(temp1), WASM_F32(0.0f))),
@@ -305,8 +335,8 @@ WASM_EXEC_TEST(F32x4ConvertI32x4) {
   float* g0 = r.builder().AddGlobal<float>(kWasmS128);
   float* g1 = r.builder().AddGlobal<float>(kWasmS128);
   // Build fn to splat test value, perform conversions, and write the results.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(kExprF32x4SConvertI32x4,
                                              WASM_LOCAL_GET(temp1))),
@@ -325,6 +355,140 @@ WASM_EXEC_TEST(F32x4ConvertI32x4) {
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_F32x8SConvertI32x8) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  int32_t* memory = r.builder().AddMemoryElems<int32_t>(16);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, compiler::IrOpcode::kF32x8SConvertI32x8,
+      WASM_LOCAL_SET(
+          temp1, WASM_SIMD_UNOP(kExprF32x4SConvertI32x4,
+                                WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)))),
+      WASM_LOCAL_SET(temp2,
+                     WASM_SIMD_UNOP(kExprF32x4SConvertI32x4,
+                                    WASM_SIMD_LOAD_MEM_OFFSET(
+                                        offset, WASM_LOCAL_GET(param1)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_INT32_INPUTS(x) {
+    for (int i = 0; i < 8; i++) {
+      r.builder().WriteMemory(&memory[i], x);
+    }
+    r.Call(0, 32);
+    float expected = static_cast<float>(x);
+    for (int i = 0; i < 8; i++) {
+      CHECK_EQ(memcmp((const void*)&expected, &memory[8 + i], 4), 0);
+    }
+  }
+}
+
+TEST(RunWasmTurbofan_F32x8UConvertI32x8) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  int32_t* memory = r.builder().AddMemoryElems<int32_t>(16);
+  // Build fn to load a F32x8 vector with test value, perform unop, and write
+  // the result to another array.
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, compiler::IrOpcode::kF32x8UConvertI32x8,
+      WASM_LOCAL_SET(
+          temp1, WASM_SIMD_UNOP(kExprF32x4UConvertI32x4,
+                                WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)))),
+      WASM_LOCAL_SET(temp2,
+                     WASM_SIMD_UNOP(kExprF32x4UConvertI32x4,
+                                    WASM_SIMD_LOAD_MEM_OFFSET(
+                                        offset, WASM_LOCAL_GET(param1)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_INT32_INPUTS(x) {
+    for (int i = 0; i < 8; i++) {
+      r.builder().WriteMemory(&memory[i], x);
+    }
+    r.Call(0, 32);
+    float expected_unsigned = static_cast<float>(static_cast<uint32_t>(x));
+    for (int i = 0; i < 8; i++) {
+      CHECK_EQ(memcmp((const void*)&expected_unsigned, &memory[8 + i], 4), 0);
+    }
+  }
+}
+
+void RunSimd256ConstTest(const std::array<uint8_t, kSimd128Size>& expected) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(32);
+  uint8_t param1 = 0;
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, compiler::IrOpcode::kS256Const,
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param1), WASM_SIMD_CONSTANT(expected)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param1),
+                                 WASM_SIMD_CONSTANT(expected)),
+      WASM_ONE);
+
+  CHECK_EQ(1, r.Call(0));
+  for (size_t i = 0; i < expected.size(); i++) {
+    CHECK_EQ(memory[i], expected[i]);
+    CHECK_EQ(memory[i + 16], expected[i]);
+  }
+}
+
+TEST(RunWasmTurbofan_S256Const) {
+  // All zeroes
+  std::array<uint8_t, kSimd128Size> expected = {0};
+  RunSimd256ConstTest(expected);
+
+  // All ones
+  for (int i = 0; i < kSimd128Size; i++) {
+    expected[i] = 0xff;
+  }
+  RunSimd256ConstTest(expected);
+
+  // Test for generic constant
+  for (int i = 0; i < kSimd128Size; i++) {
+    expected[i] = i;
+  }
+  RunSimd256ConstTest(expected);
+
+  // Keep the first 4 lanes as 0, set the remaining ones.
+  for (int i = 0; i < 4; i++) {
+    expected[i] = 0;
+  }
+  for (int i = 4; i < kSimd128Size; i++) {
+    expected[i] = i;
+  }
+  RunSimd256ConstTest(expected);
+
+  // Check sign extension logic used to pack int32s into int64.
+  expected = {0};
+  // Set the top bit of lane 3 (top bit of first int32), the rest can be 0.
+  expected[3] = 0x80;
+  RunSimd256ConstTest(expected);
+}
+
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 template <typename FloatType, typename ScalarType>
 void RunF128CompareOpConstImmTest(
     TestExecutionTier execution_tier, WasmOpcode cmp_opcode,
@@ -337,8 +501,8 @@ void RunF128CompareOpConstImmTest(
     ScalarType* g2 = r.builder().template AddGlobal<ScalarType>(kWasmS128);
     // Build fn to splat test values, perform compare op on both sides, and
     // write the result.
-    byte value = 0;
-    byte temp = r.AllocateLocal(kWasmS128);
+    uint8_t value = 0;
+    uint8_t temp = r.AllocateLocal(kWasmS128);
     uint8_t const_buffer[kSimd128Size];
     for (size_t i = 0; i < kSimd128Size / sizeof(FloatType); i++) {
       WriteLittleEndianValue<FloatType>(
@@ -380,6 +544,21 @@ WASM_EXEC_TEST(F32x4Sqrt) {
   RunF32x4UnOpTest(execution_tier, kExprF32x4Sqrt, std::sqrt);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_F32x8Abs) {
+  RunF32x8UnOpRevecTest(kExprF32x4Abs, std::abs, compiler::IrOpcode::kF32x8Abs);
+}
+
+TEST(RunWasmTurbofan_F32x8Neg) {
+  RunF32x8UnOpRevecTest(kExprF32x4Neg, Negate, compiler::IrOpcode::kF32x8Neg);
+}
+
+TEST(RunWasmTurbofan_F32x8Sqrt) {
+  RunF32x8UnOpRevecTest(kExprF32x4Sqrt, std::sqrt,
+                        compiler::IrOpcode::kF32x8Sqrt);
+}
+#endif
+
 WASM_EXEC_TEST(F32x4Ceil) {
   RunF32x4UnOpTest(execution_tier, kExprF32x4Ceil, ceilf, true);
 }
@@ -423,6 +602,26 @@ WASM_EXEC_TEST(F32x4Pmax) {
   RunF32x4BinOpTest(execution_tier, kExprF32x4Pmax, Maximum);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_F32x8Min) {
+  RunF32x8BinOpRevecTest(kExprF32x4Min, JSMin, compiler::IrOpcode::kF32x8Min);
+}
+
+TEST(RunWasmTurbofan_F32x8Max) {
+  RunF32x8BinOpRevecTest(kExprF32x4Max, JSMax, compiler::IrOpcode::kF32x8Max);
+}
+
+TEST(RunWasmTurbofan_F32x8Pmin) {
+  RunF32x8BinOpRevecTest(kExprF32x4Pmin, Minimum,
+                         compiler::IrOpcode::kF32x8Pmin);
+}
+
+TEST(RunWasmTurbofan_F32x8Pmax) {
+  RunF32x8BinOpRevecTest(kExprF32x4Pmax, Maximum,
+                         compiler::IrOpcode::kF32x8Pmax);
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 WASM_EXEC_TEST(F32x4Eq) {
   RunF32x4CompareOpTest(execution_tier, kExprF32x4Eq, Equal);
 }
@@ -456,9 +655,9 @@ void RunShiftAddTestSequence(TestExecutionTier execution_tier,
   // globals to store results for left and right cases
   ScalarType* g1 = r.builder().template AddGlobal<ScalarType>(kWasmS128);
   ScalarType* g2 = r.builder().template AddGlobal<ScalarType>(kWasmS128);
-  byte param = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t param = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   auto expected_fn = [shift_fn](ScalarType x, ScalarType y, uint32_t imm) {
     return base::AddWithWraparound(x, shift_fn(y, imm));
   };
@@ -522,7 +721,7 @@ WASM_EXEC_TEST(I64x2Splat) {
   WasmRunner<int32_t, int64_t> r(execution_tier);
   // Set up a global to hold output vector.
   int64_t* g = r.builder().AddGlobal<int64_t>(kWasmS128);
-  byte param1 = 0;
+  uint8_t param1 = 0;
   r.Build({WASM_GLOBAL_SET(0, WASM_SIMD_I64x2_SPLAT(WASM_LOCAL_GET(param1))),
            WASM_ONE});
 
@@ -553,7 +752,7 @@ WASM_EXEC_TEST(I64x2ReplaceLane) {
   // Set up a global to hold input/output vector.
   int64_t* g = r.builder().AddGlobal<int64_t>(kWasmS128);
   // Build function to replace each lane with its index.
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I64x2_SPLAT(WASM_I64V(-1))),
            WASM_LOCAL_SET(temp1, WASM_SIMD_I64x2_REPLACE_LANE(
                                      0, WASM_LOCAL_GET(temp1), WASM_I64V(0))),
@@ -587,6 +786,18 @@ WASM_EXEC_TEST(I64x2ShrU) {
   RunI64x2ShiftOpTest(execution_tier, kExprI64x2ShrU, LogicalShiftRight);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I64x4Shl) {
+  RunI64x4ShiftOpRevecTest(kExprI64x2Shl, LogicalShiftLeft,
+                           compiler::IrOpcode::kI64x4Shl);
+}
+
+TEST(RunWasmTurbofan_I64x4ShrU) {
+  RunI64x4ShiftOpRevecTest(kExprI64x2ShrU, LogicalShiftRight,
+                           compiler::IrOpcode::kI64x4ShrU);
+}
+#endif
+
 WASM_EXEC_TEST(I64x2ShiftAdd) {
   for (int imm = 0; imm <= 64; imm++) {
     RunShiftAddTestSequence<int64_t>(execution_tier, kExprI64x2ShrU,
@@ -630,6 +841,17 @@ WASM_EXEC_TEST(I64x2GeS) {
   RunI64x2BinOpTest(execution_tier, kExprI64x2GeS, GreaterEqual);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I64x4Ne) {
+  RunI64x4BinOpRevecTest(kExprI64x2Ne, NotEqual, compiler::IrOpcode::kI64x4Ne);
+}
+
+TEST(RunWasmTurbofan_I64x4GeS) {
+  RunI64x4BinOpRevecTest(kExprI64x2GeS, GreaterEqual,
+                         compiler::IrOpcode::kI64x4GeS);
+}
+#endif
+
 namespace {
 
 template <typename ScalarType>
@@ -644,8 +866,8 @@ void RunICompareOpConstImmTest(TestExecutionTier execution_tier,
     ScalarType* g2 = r.builder().template AddGlobal<ScalarType>(kWasmS128);
     // Build fn to splat test values, perform compare op on both sides, and
     // write the result.
-    byte value = 0;
-    byte temp = r.AllocateLocal(kWasmS128);
+    uint8_t value = 0;
+    uint8_t temp = r.AllocateLocal(kWasmS128);
     uint8_t const_buffer[kSimd128Size];
     for (size_t i = 0; i < kSimd128Size / sizeof(ScalarType); i++) {
       WriteLittleEndianValue<ScalarType>(
@@ -708,7 +930,7 @@ WASM_EXEC_TEST(F64x2Splat) {
   WasmRunner<int32_t, double> r(execution_tier);
   // Set up a global to hold output vector.
   double* g = r.builder().AddGlobal<double>(kWasmS128);
-  byte param1 = 0;
+  uint8_t param1 = 0;
   r.Build({WASM_GLOBAL_SET(0, WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(param1))),
            WASM_ONE});
 
@@ -728,9 +950,9 @@ WASM_EXEC_TEST(F64x2Splat) {
 
 WASM_EXEC_TEST(F64x2ExtractLane) {
   WasmRunner<double, double> r(execution_tier);
-  byte param1 = 0;
-  byte temp1 = r.AllocateLocal(kWasmF64);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t param1 = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmF64);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(
                temp1, WASM_SIMD_F64x2_EXTRACT_LANE(
                           0, WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(param1)))),
@@ -753,7 +975,7 @@ WASM_EXEC_TEST(F64x2ReplaceLane) {
   double* g0 = r.builder().AddGlobal<double>(kWasmS128);
   double* g1 = r.builder().AddGlobal<double>(kWasmS128);
   // Build function to replace each lane with its (FP) index.
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F64x2_SPLAT(WASM_F64(1e100))),
            // Replace lane 0.
            WASM_GLOBAL_SET(0, WASM_SIMD_F64x2_REPLACE_LANE(
@@ -802,6 +1024,13 @@ WASM_EXEC_TEST(F64x2Sqrt) {
   RunF64x2UnOpTest(execution_tier, kExprF64x2Sqrt, std::sqrt);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_F64x4Sqrt) {
+  RunF64x4UnOpRevecTest(kExprF64x2Sqrt, std::sqrt,
+                        compiler::IrOpcode::kF64x4Sqrt);
+}
+#endif
+
 WASM_EXEC_TEST(F64x2Ceil) {
   RunF64x2UnOpTest(execution_tier, kExprF64x2Ceil, ceil, true);
 }
@@ -992,6 +1221,26 @@ WASM_EXEC_TEST(F64x2Pmax) {
   RunF64x2BinOpTest(execution_tier, kExprF64x2Pmax, Maximum);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_F64x4Min) {
+  RunF64x4BinOpRevecTest(kExprF64x2Min, JSMin, compiler::IrOpcode::kF64x4Min);
+}
+
+TEST(RunWasmTurbofan_F64x4Max) {
+  RunF64x4BinOpRevecTest(kExprF64x2Max, JSMax, compiler::IrOpcode::kF64x4Max);
+}
+
+TEST(RunWasmTurbofan_F64x4Pmin) {
+  RunF64x4BinOpRevecTest(kExprF64x2Pmin, Minimum,
+                         compiler::IrOpcode::kF64x4Pmin);
+}
+
+TEST(RunWasmTurbofan_F64x4Pmax) {
+  RunF64x4BinOpRevecTest(kExprF64x2Pmax, Maximum,
+                         compiler::IrOpcode::kF64x4Pmax);
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 WASM_EXEC_TEST(F64x2Eq) {
   RunF64x2CompareOpTest(execution_tier, kExprF64x2Eq, Equal);
 }
@@ -1062,7 +1311,7 @@ WASM_EXEC_TEST(I32x4Splat) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
   // Set up a global to hold output vector.
   int32_t* g = r.builder().AddGlobal<int32_t>(kWasmS128);
-  byte param1 = 0;
+  uint8_t param1 = 0;
   r.Build({WASM_GLOBAL_SET(0, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(param1))),
            WASM_ONE});
 
@@ -1081,7 +1330,7 @@ WASM_EXEC_TEST(I32x4ReplaceLane) {
   // Set up a global to hold input/output vector.
   int32_t* g = r.builder().AddGlobal<int32_t>(kWasmS128);
   // Build function to replace each lane with its index.
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I32x4_SPLAT(WASM_I32V(-1))),
            WASM_LOCAL_SET(temp1, WASM_SIMD_I32x4_REPLACE_LANE(
                                      0, WASM_LOCAL_GET(temp1), WASM_I32V(0))),
@@ -1103,7 +1352,7 @@ WASM_EXEC_TEST(I16x8Splat) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
   // Set up a global to hold output vector.
   int16_t* g = r.builder().AddGlobal<int16_t>(kWasmS128);
-  byte param1 = 0;
+  uint8_t param1 = 0;
   r.Build({WASM_GLOBAL_SET(0, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(param1))),
            WASM_ONE});
 
@@ -1132,7 +1381,7 @@ WASM_EXEC_TEST(I16x8ReplaceLane) {
   // Set up a global to hold input/output vector.
   int16_t* g = r.builder().AddGlobal<int16_t>(kWasmS128);
   // Build function to replace each lane with its index.
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_SPLAT(WASM_I32V(-1))),
            WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_REPLACE_LANE(
                                      0, WASM_LOCAL_GET(temp1), WASM_I32V(0))),
@@ -1160,7 +1409,7 @@ WASM_EXEC_TEST(I16x8ReplaceLane) {
 
 WASM_EXEC_TEST(I8x16BitMask) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
-  byte value1 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = r.AllocateLocal(kWasmS128);
 
   r.Build(
       {WASM_LOCAL_SET(value1, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(0))),
@@ -1180,7 +1429,7 @@ WASM_EXEC_TEST(I8x16BitMask) {
 
 WASM_EXEC_TEST(I16x8BitMask) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
-  byte value1 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = r.AllocateLocal(kWasmS128);
 
   r.Build(
       {WASM_LOCAL_SET(value1, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(0))),
@@ -1200,7 +1449,7 @@ WASM_EXEC_TEST(I16x8BitMask) {
 
 WASM_EXEC_TEST(I32x4BitMask) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
-  byte value1 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = r.AllocateLocal(kWasmS128);
 
   r.Build(
       {WASM_LOCAL_SET(value1, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(0))),
@@ -1220,7 +1469,7 @@ WASM_EXEC_TEST(I32x4BitMask) {
 
 WASM_EXEC_TEST(I64x2BitMask) {
   WasmRunner<int32_t, int64_t> r(execution_tier);
-  byte value1 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = r.AllocateLocal(kWasmS128);
 
   r.Build(
       {WASM_LOCAL_SET(value1, WASM_SIMD_I64x2_SPLAT(WASM_LOCAL_GET(0))),
@@ -1240,7 +1489,7 @@ WASM_EXEC_TEST(I8x16Splat) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
   // Set up a global to hold output vector.
   int8_t* g = r.builder().AddGlobal<int8_t>(kWasmS128);
-  byte param1 = 0;
+  uint8_t param1 = 0;
   r.Build({WASM_GLOBAL_SET(0, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(param1))),
            WASM_ONE});
 
@@ -1269,7 +1518,7 @@ WASM_EXEC_TEST(I8x16ReplaceLane) {
   // Set up a global to hold input/output vector.
   int8_t* g = r.builder().AddGlobal<int8_t>(kWasmS128);
   // Build function to replace each lane with its index.
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_SPLAT(WASM_I32V(-1))),
            WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_REPLACE_LANE(
                                      0, WASM_LOCAL_GET(temp1), WASM_I32V(0))),
@@ -1332,8 +1581,8 @@ WASM_EXEC_TEST(I32x4ConvertF32x4) {
   int32_t* g0 = r.builder().AddGlobal<int32_t>(kWasmS128);
   int32_t* g1 = r.builder().AddGlobal<int32_t>(kWasmS128);
   // Build fn to splat test value, perform conversions, and write the results.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(kExprI32x4SConvertF32x4,
                                              WASM_LOCAL_GET(temp1))),
@@ -1353,6 +1602,46 @@ WASM_EXEC_TEST(I32x4ConvertF32x4) {
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I32x8UConvertF32x8) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  float* memory = r.builder().AddMemoryElems<float>(16);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, compiler::IrOpcode::kI32x8UConvertF32x8,
+      WASM_LOCAL_SET(
+          temp1, WASM_SIMD_UNOP(kExprI32x4UConvertF32x4,
+                                WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)))),
+      WASM_LOCAL_SET(temp2,
+                     WASM_SIMD_UNOP(kExprI32x4UConvertF32x4,
+                                    WASM_SIMD_LOAD_MEM_OFFSET(
+                                        offset, WASM_LOCAL_GET(param1)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_FLOAT32_INPUTS(x) {
+    if (!PlatformCanRepresent(x)) continue;
+    for (int i = 0; i < 8; i++) {
+      r.builder().WriteMemory(&memory[i], x);
+    }
+    r.Call(0, 32);
+    int32_t expected_unsigned = ConvertToInt(x, true);
+    for (int i = 0; i < 8; i++) {
+      CHECK_EQ(memcmp((const void*)&expected_unsigned, &memory[8 + i], 4), 0);
+    }
+  }
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 // Tests both signed and unsigned conversion from I16x8 (unpacking).
 WASM_EXEC_TEST(I32x4ConvertI16x8) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
@@ -1362,8 +1651,8 @@ WASM_EXEC_TEST(I32x4ConvertI16x8) {
   int32_t* g2 = r.builder().AddGlobal<int32_t>(kWasmS128);
   int32_t* g3 = r.builder().AddGlobal<int32_t>(kWasmS128);
   // Build fn to splat test value, perform conversions, and write the results.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(kExprI32x4SConvertI16x8High,
                                              WASM_LOCAL_GET(temp1))),
@@ -1388,6 +1677,53 @@ WASM_EXEC_TEST(I32x4ConvertI16x8) {
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I32x8ConvertI16x8Revec) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  int16_t* memory = r.builder().AddMemoryElems<int16_t>(40);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+  r.Build({WASM_LOCAL_SET(temp3, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1))),
+           WASM_LOCAL_SET(temp1, WASM_SIMD_UNOP(kExprI32x4SConvertI16x8Low,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_LOCAL_SET(temp2, WASM_SIMD_UNOP(kExprI32x4SConvertI16x8High,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+           WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                      WASM_LOCAL_GET(temp2)),
+           WASM_LOCAL_SET(temp1, WASM_SIMD_UNOP(kExprI32x4UConvertI16x8Low,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_LOCAL_SET(temp2, WASM_SIMD_UNOP(kExprI32x4UConvertI16x8High,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+           WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                      WASM_LOCAL_GET(temp2)),
+           WASM_ONE});
+
+  FOR_INT16_INPUTS(x) {
+    for (int i = 0; i < 8; i++) {
+      r.builder().WriteMemory(&memory[i], x);
+    }
+    r.Call(0, 16, 48);
+    int32_t expected_signed = static_cast<int32_t>(x);
+    uint32_t expected_unsigned =
+        static_cast<uint32_t>(static_cast<uint16_t>(x));
+    for (int i = 0; i < 8; i++) {
+      CHECK_EQ(expected_signed, memory[8 + i * 2]);
+      if (x > 0) CHECK_EQ(expected_unsigned, memory[24 + i * 2]);
+    }
+  }
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 // Tests both signed and unsigned conversion from I32x4 (unpacking).
 WASM_EXEC_TEST(I64x2ConvertI32x4) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
@@ -1397,8 +1733,8 @@ WASM_EXEC_TEST(I64x2ConvertI32x4) {
   uint64_t* g2 = r.builder().AddGlobal<uint64_t>(kWasmS128);
   uint64_t* g3 = r.builder().AddGlobal<uint64_t>(kWasmS128);
   // Build fn to splat test value, perform conversions, and write the results.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(kExprI64x2SConvertI32x4High,
                                              WASM_LOCAL_GET(temp1))),
@@ -1424,6 +1760,53 @@ WASM_EXEC_TEST(I64x2ConvertI32x4) {
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I64x4ConvertI32x4Revec) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  int32_t* memory = r.builder().AddMemoryElems<int32_t>(20);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+  r.Build({WASM_LOCAL_SET(temp3, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1))),
+           WASM_LOCAL_SET(temp1, WASM_SIMD_UNOP(kExprI64x2SConvertI32x4Low,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_LOCAL_SET(temp2, WASM_SIMD_UNOP(kExprI64x2SConvertI32x4High,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+           WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                      WASM_LOCAL_GET(temp2)),
+           WASM_LOCAL_SET(temp1, WASM_SIMD_UNOP(kExprI64x2UConvertI32x4Low,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_LOCAL_SET(temp2, WASM_SIMD_UNOP(kExprI64x2UConvertI32x4High,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+           WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                      WASM_LOCAL_GET(temp2)),
+           WASM_ONE});
+
+  FOR_INT32_INPUTS(x) {
+    for (int i = 0; i < 4; i++) {
+      r.builder().WriteMemory(&memory[i], x);
+    }
+    r.Call(0, 16, 48);
+    int64_t expected_signed = static_cast<int64_t>(x);
+    uint64_t expected_unsigned =
+        static_cast<uint64_t>(static_cast<uint32_t>(x));
+    for (int i = 0; i < 4; i++) {
+      CHECK_EQ(expected_signed, memory[4 + i * 2]);
+      if (x > 0) CHECK_EQ(expected_unsigned, memory[12 + i * 2]);
+    }
+  }
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 WASM_EXEC_TEST(I32x4Neg) {
   RunI32x4UnOpTest(execution_tier, kExprI32x4Neg, base::NegateWithWraparound);
 }
@@ -1432,6 +1815,17 @@ WASM_EXEC_TEST(I32x4Abs) {
   RunI32x4UnOpTest(execution_tier, kExprI32x4Abs, std::abs);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I32x8Neg) {
+  RunI32x8UnOpRevecTest(kExprI32x4Neg, base::NegateWithWraparound,
+                        compiler::IrOpcode::kI32x8Neg);
+}
+
+TEST(RunWasmTurbofan_I32x8Abs) {
+  RunI32x8UnOpRevecTest(kExprI32x4Abs, std::abs, compiler::IrOpcode::kI32x8Abs);
+}
+#endif
+
 WASM_EXEC_TEST(S128Not) {
   RunI32x4UnOpTest(execution_tier, kExprS128Not, [](int32_t x) { return ~x; });
 }
@@ -1539,8 +1933,8 @@ void RunS128ConstBinOpTest(TestExecutionTier execution_tier,
     ScalarType* g = r.builder().template AddGlobal<ScalarType>(kWasmS128);
     // Build a function to splat one argument into a local,
     // and execute the op with a const as the second argument
-    byte value = 0;
-    byte temp = r.AllocateLocal(kWasmS128);
+    uint8_t value = 0;
+    uint8_t temp = r.AllocateLocal(kWasmS128);
     uint8_t const_buffer[16];
     for (size_t i = 0; i < kSimd128Size / sizeof(ScalarType); i++) {
       WriteLittleEndianValue<ScalarType>(
@@ -1622,6 +2016,90 @@ WASM_EXEC_TEST(S128AndNotImm) {
       [](int16_t x, int16_t y) { return static_cast<int16_t>(x & ~y); });
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_S256Not) {
+  RunI32x8UnOpRevecTest(kExprS128Not, BitwiseNot, compiler::IrOpcode::kS256Not);
+}
+
+TEST(RunWasmTurbofan_S256And) {
+  RunI32x8BinOpRevecTest(kExprS128And, BitwiseAnd,
+                         compiler::IrOpcode::kS256And);
+}
+
+TEST(RunWasmTurbofan_S256Or) {
+  RunI32x8BinOpRevecTest(kExprS128Or, BitwiseOr, compiler::IrOpcode::kS256Or);
+}
+
+TEST(RunWasmTurbofan_S256Xor) {
+  RunI32x8BinOpRevecTest(kExprS128Xor, BitwiseXor,
+                         compiler::IrOpcode::kS256Xor);
+}
+
+TEST(RunWasmTurbofan_S256AndNot) {
+  RunI32x8BinOpRevecTest(kExprS128AndNot, BitwiseAndNot,
+                         compiler::IrOpcode::kS256AndNot);
+}
+
+TEST(RunWasmTurbofan_S256Select) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  int32_t* memory = r.builder().AddMemoryElems<int32_t>(32);
+  // Build fn perform bitwise selection on two 256 bit vectors a and b, mask c,
+  // store the result in d:
+  //   simd128 *a,*b,*c,*d;
+  //   *d = select(*a, *b, *c);
+  //   *(d+1) = select(*(a+1), *(b+1), *(c+1))
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t param4 = 3;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, compiler::IrOpcode::kS256Select,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_SELECT(32x4, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                           WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2)),
+                           WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param3)))),
+      WASM_LOCAL_SET(
+          temp2,
+          WASM_SIMD_SELECT(
+              32x4, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param1)),
+              WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param2)),
+              WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param3)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param4), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param4),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  for (auto x : compiler::ValueHelper::GetVector<int32_t>()) {
+    for (auto y : compiler::ValueHelper::GetVector<int32_t>()) {
+      for (auto z : compiler::ValueHelper::GetVector<int32_t>()) {
+        for (int i = 0; i < 4; i++) {
+          r.builder().WriteMemory(&memory[i], x);
+          r.builder().WriteMemory(&memory[i + 4], x);
+          r.builder().WriteMemory(&memory[i + 8], y);
+          r.builder().WriteMemory(&memory[i + 12], y);
+          r.builder().WriteMemory(&memory[i + 16], z);
+          r.builder().WriteMemory(&memory[i + 20], z);
+        }
+        CHECK_EQ(1, r.Call(0, 32, 64, 96));
+        int32_t expected = BitwiseSelect(x, y, z);
+        for (int i = 0; i < 4; i++) {
+          CHECK_EQ(expected, memory[i + 24]);
+          CHECK_EQ(expected, memory[i + 28]);
+        }
+      }
+    }
+  }
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 WASM_EXEC_TEST(I32x4Eq) {
   RunI32x4BinOpTest(execution_tier, kExprI32x4Eq, Equal);
 }
@@ -1662,6 +2140,27 @@ WASM_EXEC_TEST(I32x4GeU) {
   RunI32x4BinOpTest(execution_tier, kExprI32x4GeU, UnsignedGreaterEqual);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I32x8Ne) {
+  RunI32x8BinOpRevecTest(kExprI32x4Ne, NotEqual, compiler::IrOpcode::kI32x8Ne);
+}
+
+TEST(RunWasmTurbofan_I32x8GtU) {
+  RunI32x8BinOpRevecTest<uint32_t>(kExprI32x4GtU, UnsignedGreater,
+                                   compiler::IrOpcode::kI32x8GtU);
+}
+
+TEST(RunWasmTurbofan_I32x8GeS) {
+  RunI32x8BinOpRevecTest(kExprI32x4GeS, GreaterEqual,
+                         compiler::IrOpcode::kI32x8GeS);
+}
+
+TEST(RunWasmTurbofan_I32x8GeU) {
+  RunI32x8BinOpRevecTest<uint32_t>(kExprI32x4GeU, UnsignedGreaterEqual,
+                                   compiler::IrOpcode::kI32x8GeU);
+}
+#endif
+
 WASM_EXEC_TEST(I32x4EqZero) {
   RunICompareOpConstImmTest<int32_t>(execution_tier, kExprI32x4Eq,
                                      kExprI32x4Splat, Equal);
@@ -1704,6 +2203,23 @@ WASM_EXEC_TEST(I32x4ShrU) {
   RunI32x4ShiftOpTest(execution_tier, kExprI32x4ShrU, LogicalShiftRight);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I32x8Shl) {
+  RunI32x8ShiftOpRevecTest(kExprI32x4Shl, LogicalShiftLeft,
+                           compiler::IrOpcode::kI32x8Shl);
+}
+
+TEST(RunWasmTurbofan_I32x8ShrS) {
+  RunI32x8ShiftOpRevecTest(kExprI32x4ShrS, ArithmeticShiftRight,
+                           compiler::IrOpcode::kI32x8ShrS);
+}
+
+TEST(RunWasmTurbofan_I32x8ShrU) {
+  RunI32x8ShiftOpRevecTest(kExprI32x4ShrU, LogicalShiftRight,
+                           compiler::IrOpcode::kI32x8ShrU);
+}
+#endif
+
 WASM_EXEC_TEST(I32x4ShiftAdd) {
   for (int imm = 0; imm <= 32; imm++) {
     RunShiftAddTestSequence<int32_t>(execution_tier, kExprI32x4ShrU,
@@ -1724,8 +2240,8 @@ WASM_EXEC_TEST(I16x8ConvertI8x16) {
   int16_t* g2 = r.builder().AddGlobal<int16_t>(kWasmS128);
   int16_t* g3 = r.builder().AddGlobal<int16_t>(kWasmS128);
   // Build fn to splat test value, perform conversions, and write the results.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(kExprI16x8SConvertI8x16High,
                                              WASM_LOCAL_GET(temp1))),
@@ -1750,6 +2266,52 @@ WASM_EXEC_TEST(I16x8ConvertI8x16) {
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I16x16ConvertI8x16Revec) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  int8_t* memory = r.builder().AddMemoryElems<int8_t>(80);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+  r.Build({WASM_LOCAL_SET(temp3, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1))),
+           WASM_LOCAL_SET(temp1, WASM_SIMD_UNOP(kExprI16x8SConvertI8x16Low,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_LOCAL_SET(temp2, WASM_SIMD_UNOP(kExprI16x8SConvertI8x16High,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+           WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                      WASM_LOCAL_GET(temp2)),
+           WASM_LOCAL_SET(temp1, WASM_SIMD_UNOP(kExprI16x8UConvertI8x16Low,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_LOCAL_SET(temp2, WASM_SIMD_UNOP(kExprI16x8UConvertI8x16High,
+                                                WASM_LOCAL_GET(temp3))),
+           WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+           WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                      WASM_LOCAL_GET(temp2)),
+           WASM_ONE});
+
+  FOR_INT8_INPUTS(x) {
+    for (int i = 0; i < 16; i++) {
+      r.builder().WriteMemory(&memory[i], x);
+    }
+    r.Call(0, 16, 48);
+    int16_t expected_signed = static_cast<int16_t>(x);
+    uint16_t expected_unsigned = static_cast<uint16_t>(static_cast<uint8_t>(x));
+    for (int i = 0; i < 16; i++) {
+      CHECK_EQ(expected_signed, memory[16 + i * 2]);
+      if (x > 0) CHECK_EQ(expected_unsigned, memory[48 + i * 2]);
+    }
+  }
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 // Tests both signed and unsigned conversion from I32x4 (packing).
 WASM_EXEC_TEST(I16x8ConvertI32x4) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
@@ -1757,8 +2319,8 @@ WASM_EXEC_TEST(I16x8ConvertI32x4) {
   int16_t* g0 = r.builder().AddGlobal<int16_t>(kWasmS128);
   int16_t* g1 = r.builder().AddGlobal<int16_t>(kWasmS128);
   // Build fn to splat test value, perform conversions, and write the results.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(kExprI16x8SConvertI32x4,
                                               WASM_LOCAL_GET(temp1),
@@ -1787,6 +2349,17 @@ WASM_EXEC_TEST(I16x8Abs) {
   RunI16x8UnOpTest(execution_tier, kExprI16x8Abs, Abs);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I16x16Neg) {
+  RunI16x16UnOpRevecTest(kExprI16x8Neg, base::NegateWithWraparound,
+                         compiler::IrOpcode::kI16x16Neg);
+}
+
+TEST(RunWasmTurbofan_I16x16Abs) {
+  RunI16x16UnOpRevecTest(kExprI16x8Abs, Abs, compiler::IrOpcode::kI16x16Abs);
+}
+#endif
+
 WASM_EXEC_TEST(I16x8Add) {
   RunI16x8BinOpTest(execution_tier, kExprI16x8Add, base::AddWithWraparound);
 }
@@ -1825,6 +2398,28 @@ WASM_EXEC_TEST(I16x8SubSatU) {
                               SaturateSub<uint16_t>);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I16x16AddSatS) {
+  RunI16x16BinOpRevecTest<int16_t>(kExprI16x8AddSatS, SaturateAdd,
+                                   compiler::IrOpcode::kI16x16AddSatS);
+}
+
+TEST(RunWasmTurbofan_I16x16SubSatS) {
+  RunI16x16BinOpRevecTest<int16_t>(kExprI16x8SubSatS, SaturateSub,
+                                   compiler::IrOpcode::kI16x16SubSatS);
+}
+
+TEST(RunWasmTurbofan_I16x16AddSatU) {
+  RunI16x16BinOpRevecTest<uint16_t>(kExprI16x8AddSatU, SaturateAdd,
+                                    compiler::IrOpcode::kI16x16AddSatU);
+}
+
+TEST(RunWasmTurbofan_I16x16SubSatU) {
+  RunI16x16BinOpRevecTest<uint16_t>(kExprI16x8SubSatU, SaturateSub,
+                                    compiler::IrOpcode::kI16x16SubSatU);
+}
+#endif
+
 WASM_EXEC_TEST(I16x8MinU) {
   RunI16x8BinOpTest(execution_tier, kExprI16x8MinU, UnsignedMinimum);
 }
@@ -1873,6 +2468,28 @@ WASM_EXEC_TEST(I16x8LeU) {
   RunI16x8BinOpTest(execution_tier, kExprI16x8LeU, UnsignedLessEqual);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(WasmTurbofan_I16x16Ne) {
+  RunI16x16BinOpRevecTest(kExprI16x8Ne, NotEqual,
+                          compiler::IrOpcode::kI16x16Ne);
+}
+
+TEST(WasmTurbofan_I16x16GtU) {
+  RunI16x16BinOpRevecTest<uint16_t>(kExprI16x8GtU, UnsignedGreater,
+                                    compiler::IrOpcode::kI16x16GtU);
+}
+
+TEST(WasmTurbofan_I16x16GeS) {
+  RunI16x16BinOpRevecTest(kExprI16x8GeS, GreaterEqual,
+                          compiler::IrOpcode::kI16x16GeS);
+}
+
+TEST(WasmTurbofan_I16x16GeU) {
+  RunI16x16BinOpRevecTest<uint16_t>(kExprI16x8GeU, UnsignedGreaterEqual,
+                                    compiler::IrOpcode::kI16x16GeU);
+}
+#endif
+
 WASM_EXEC_TEST(I16x8EqZero) {
   RunICompareOpConstImmTest<int16_t>(execution_tier, kExprI16x8Eq,
                                      kExprI16x8Splat, Equal);
@@ -2091,9 +2708,9 @@ EXTMUL_ADD_OPTIMIZATION_TEST(int16_t, I16x8, int32_t, I32x4)
 WASM_EXEC_TEST(I32x4DotI16x8S) {
   WasmRunner<int32_t, int16_t, int16_t> r(execution_tier);
   int32_t* g = r.builder().template AddGlobal<int32_t>(kWasmS128);
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(
@@ -2125,6 +2742,23 @@ WASM_EXEC_TEST(I16x8ShrU) {
   RunI16x8ShiftOpTest(execution_tier, kExprI16x8ShrU, LogicalShiftRight);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I16x16Shl) {
+  RunI16x16ShiftOpRevecTest(kExprI16x8Shl, LogicalShiftLeft,
+                            compiler::IrOpcode::kI16x16Shl);
+}
+
+TEST(RunWasmTurbofan_I16x16ShrS) {
+  RunI16x16ShiftOpRevecTest(kExprI16x8ShrS, ArithmeticShiftRight,
+                            compiler::IrOpcode::kI16x16ShrS);
+}
+
+TEST(RunWasmTurbofan_I16x16ShrU) {
+  RunI16x16ShiftOpRevecTest(kExprI16x8ShrU, LogicalShiftRight,
+                            compiler::IrOpcode::kI16x16ShrU);
+}
+#endif
+
 WASM_EXEC_TEST(I16x8ShiftAdd) {
   for (int imm = 0; imm <= 16; imm++) {
     RunShiftAddTestSequence<int16_t>(execution_tier, kExprI16x8ShrU,
@@ -2144,13 +2778,24 @@ WASM_EXEC_TEST(I8x16Abs) {
   RunI8x16UnOpTest(execution_tier, kExprI8x16Abs, Abs);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I8x32Neg) {
+  RunI8x32UnOpRevecTest(kExprI8x16Neg, base::NegateWithWraparound,
+                        compiler::IrOpcode::kI8x32Neg);
+}
+
+TEST(RunWasmTurbofan_I8x32Abs) {
+  RunI8x32UnOpRevecTest(kExprI8x16Abs, Abs, compiler::IrOpcode::kI8x32Abs);
+}
+#endif
+
 WASM_EXEC_TEST(I8x16Popcnt) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
   // Global to hold output.
   int8_t* g = r.builder().AddGlobal<int8_t>(kWasmS128);
   // Build fn to splat test value, perform unop, and write the result.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(
                0, WASM_SIMD_UNOP(kExprI8x16Popcnt, WASM_LOCAL_GET(temp1))),
@@ -2172,8 +2817,8 @@ WASM_EXEC_TEST(I8x16ConvertI16x8) {
   int8_t* g_s = r.builder().AddGlobal<int8_t>(kWasmS128);
   uint8_t* g_u = r.builder().AddGlobal<uint8_t>(kWasmS128);
   // Build fn to splat test value, perform conversions, and write the results.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(kExprI8x16SConvertI16x8,
                                               WASM_LOCAL_GET(temp1),
@@ -2228,6 +2873,28 @@ WASM_EXEC_TEST(I8x16SubSatU) {
                              SaturateSub<uint8_t>);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I8x32AddSatS) {
+  RunI8x32BinOpRevecTest<int8_t>(kExprI8x16AddSatS, SaturateAdd,
+                                 compiler::IrOpcode::kI8x32AddSatS);
+}
+
+TEST(RunWasmTurbofan_I8x32SubSatS) {
+  RunI8x32BinOpRevecTest<int8_t>(kExprI8x16SubSatS, SaturateSub,
+                                 compiler::IrOpcode::kI8x32SubSatS);
+}
+
+TEST(RunWasmTurbofan_I8x32AddSatU) {
+  RunI8x32BinOpRevecTest<uint8_t>(kExprI8x16AddSatU, SaturateAdd,
+                                  compiler::IrOpcode::kI8x32AddSatU);
+}
+
+TEST(RunWasmTurbofan_I8x32SubSatU) {
+  RunI8x32BinOpRevecTest<uint8_t>(kExprI8x16SubSatU, SaturateSub,
+                                  compiler::IrOpcode::kI8x32SubSatU);
+}
+#endif
+
 WASM_EXEC_TEST(I8x16MinU) {
   RunI8x16BinOpTest(execution_tier, kExprI8x16MinU, UnsignedMinimum);
 }
@@ -2276,6 +2943,27 @@ WASM_EXEC_TEST(I8x16LeU) {
   RunI8x16BinOpTest(execution_tier, kExprI8x16LeU, UnsignedLessEqual);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_I8x32Ne) {
+  RunI8x32BinOpRevecTest(kExprI8x16Ne, NotEqual, compiler::IrOpcode::kI8x32Ne);
+}
+
+TEST(RunWasmTurbofan_I8x32GtU) {
+  RunI8x32BinOpRevecTest<uint8_t>(kExprI8x16GtU, UnsignedGreater,
+                                  compiler::IrOpcode::kI8x32GtU);
+}
+
+TEST(RunWasmTurbofan_I8x32GeS) {
+  RunI8x32BinOpRevecTest(kExprI8x16GeS, GreaterEqual,
+                         compiler::IrOpcode::kI8x32GeS);
+}
+
+TEST(RunWasmTurbofan_I8x32GeU) {
+  RunI8x32BinOpRevecTest<uint8_t>(kExprI8x16GeU, UnsignedGreaterEqual,
+                                  compiler::IrOpcode::kI8x32GeU);
+}
+#endif
+
 WASM_EXEC_TEST(I8x16EqZero) {
   RunICompareOpConstImmTest<int8_t>(execution_tier, kExprI8x16Eq,
                                     kExprI8x16Splat, Equal);
@@ -2340,12 +3028,12 @@ WASM_EXEC_TEST(I8x16ShiftAdd) {
 #define WASM_SIMD_SELECT_TEST(format)                                       \
   WASM_EXEC_TEST(S##format##Select) {                                       \
     WasmRunner<int32_t, int32_t, int32_t> r(execution_tier);                \
-    byte val1 = 0;                                                          \
-    byte val2 = 1;                                                          \
-    byte src1 = r.AllocateLocal(kWasmS128);                                 \
-    byte src2 = r.AllocateLocal(kWasmS128);                                 \
-    byte zero = r.AllocateLocal(kWasmS128);                                 \
-    byte mask = r.AllocateLocal(kWasmS128);                                 \
+    uint8_t val1 = 0;                                                       \
+    uint8_t val2 = 1;                                                       \
+    uint8_t src1 = r.AllocateLocal(kWasmS128);                              \
+    uint8_t src2 = r.AllocateLocal(kWasmS128);                              \
+    uint8_t zero = r.AllocateLocal(kWasmS128);                              \
+    uint8_t mask = r.AllocateLocal(kWasmS128);                              \
     r.Build(                                                                \
         {WASM_LOCAL_SET(src1,                                               \
                         WASM_SIMD_I##format##_SPLAT(WASM_LOCAL_GET(val1))), \
@@ -2379,13 +3067,13 @@ WASM_SIMD_SELECT_TEST(8x16)
 #define WASM_SIMD_NON_CANONICAL_SELECT_TEST(format)                          \
   WASM_EXEC_TEST(S##format##NonCanonicalSelect) {                            \
     WasmRunner<int32_t, int32_t, int32_t, int32_t> r(execution_tier);        \
-    byte val1 = 0;                                                           \
-    byte val2 = 1;                                                           \
-    byte combined = 2;                                                       \
-    byte src1 = r.AllocateLocal(kWasmS128);                                  \
-    byte src2 = r.AllocateLocal(kWasmS128);                                  \
-    byte zero = r.AllocateLocal(kWasmS128);                                  \
-    byte mask = r.AllocateLocal(kWasmS128);                                  \
+    uint8_t val1 = 0;                                                        \
+    uint8_t val2 = 1;                                                        \
+    uint8_t combined = 2;                                                    \
+    uint8_t src1 = r.AllocateLocal(kWasmS128);                               \
+    uint8_t src2 = r.AllocateLocal(kWasmS128);                               \
+    uint8_t zero = r.AllocateLocal(kWasmS128);                               \
+    uint8_t mask = r.AllocateLocal(kWasmS128);                               \
     r.Build(                                                                 \
         {WASM_LOCAL_SET(src1,                                                \
                         WASM_SIMD_I##format##_SPLAT(WASM_LOCAL_GET(val1))),  \
@@ -2764,18 +3452,18 @@ WASM_EXEC_TEST(I8x16ShuffleFuzz) {
   }
 }
 
-void AppendShuffle(const Shuffle& shuffle, std::vector<byte>* buffer) {
-  byte opcode[] = {WASM_SIMD_OP(kExprI8x16Shuffle)};
+void AppendShuffle(const Shuffle& shuffle, std::vector<uint8_t>* buffer) {
+  uint8_t opcode[] = {WASM_SIMD_OP(kExprI8x16Shuffle)};
   for (size_t i = 0; i < arraysize(opcode); ++i) buffer->push_back(opcode[i]);
   for (size_t i = 0; i < kSimd128Size; ++i) buffer->push_back((shuffle[i]));
 }
 
 void BuildShuffle(const std::vector<Shuffle>& shuffles,
-                  std::vector<byte>* buffer) {
+                  std::vector<uint8_t>* buffer) {
   // Perform the leaf shuffles on globals 0 and 1.
   size_t row_index = (shuffles.size() - 1) / 2;
   for (size_t i = row_index; i < shuffles.size(); ++i) {
-    byte operands[] = {WASM_GLOBAL_GET(0), WASM_GLOBAL_GET(1)};
+    uint8_t operands[] = {WASM_GLOBAL_GET(0), WASM_GLOBAL_GET(1)};
     for (size_t j = 0; j < arraysize(operands); ++j)
       buffer->push_back(operands[j]);
     AppendShuffle(shuffles[i], buffer);
@@ -2787,12 +3475,12 @@ void BuildShuffle(const std::vector<Shuffle>& shuffles,
     }
     row_index /= 2;
   } while (row_index != 0);
-  byte epilog[] = {kExprGlobalSet, static_cast<byte>(0), WASM_ONE};
+  uint8_t epilog[] = {kExprGlobalSet, static_cast<uint8_t>(0), WASM_ONE};
   for (size_t j = 0; j < arraysize(epilog); ++j) buffer->push_back(epilog[j]);
 }
 
 void RunWasmCode(TestExecutionTier execution_tier,
-                 const std::vector<byte>& code,
+                 const std::vector<uint8_t>& code,
                  std::array<int8_t, kSimd128Size>* result) {
   WasmRunner<int32_t> r(execution_tier);
   // Set up two test patterns as globals, e.g. [0, 1, 2, 3] and [4, 5, 6, 7].
@@ -2809,40 +3497,6 @@ void RunWasmCode(TestExecutionTier execution_tier,
   }
 }
 
-// Test multiple shuffles executed in sequence.
-WASM_EXEC_TEST(S8x16MultiShuffleFuzz) {
-  // Don't compare interpreter results with itself.
-  if (execution_tier == TestExecutionTier::kInterpreter) {
-    return;
-  }
-  v8::base::RandomNumberGenerator* rng = CcTest::random_number_generator();
-  static const int kShuffles = 100;
-  for (int i = 0; i < kShuffles; ++i) {
-    // Create an odd number in [3..23] of random test shuffles so we can build
-    // a complete binary tree (stored as a heap) of shuffle operations. The leaf
-    // shuffles operate on the test pattern inputs, while the interior shuffles
-    // operate on the results of the two child shuffles.
-    int num_shuffles = rng->NextInt(10) * 2 + 3;
-    std::vector<Shuffle> shuffles;
-    for (int j = 0; j < num_shuffles; ++j) {
-      shuffles.push_back(GetRandomTestShuffle(rng));
-    }
-    // Generate the code for the shuffle expression.
-    std::vector<byte> buffer;
-    BuildShuffle(shuffles, &buffer);
-
-    // Run the code using the interpreter to get the expected result.
-    std::array<int8_t, kSimd128Size> expected;
-    RunWasmCode(TestExecutionTier::kInterpreter, buffer, &expected);
-    // Run the SIMD or scalar lowered compiled code and compare results.
-    std::array<int8_t, kSimd128Size> result;
-    RunWasmCode(execution_tier, buffer, &result);
-    for (size_t j = 0; j < kSimd128Size; ++j) {
-      CHECK_EQ(result[j], expected[j]);
-    }
-  }
-}
-
 // Boolean unary operations are 'AllTrue' and 'AnyTrue', which return an integer
 // result. Use relational ops on numeric vectors to create the boolean vector
 // test inputs. Test inputs with all true, all false, one true, and one false.
@@ -2850,9 +3504,9 @@ WASM_EXEC_TEST(S8x16MultiShuffleFuzz) {
   WASM_EXEC_TEST(ReductionTest##lanes) {                                      \
     WasmRunner<int32_t> r(execution_tier);                                    \
     if (lanes == 2) return;                                                   \
-    byte zero = r.AllocateLocal(kWasmS128);                                   \
-    byte one_one = r.AllocateLocal(kWasmS128);                                \
-    byte reduced = r.AllocateLocal(kWasmI32);                                 \
+    uint8_t zero = r.AllocateLocal(kWasmS128);                                \
+    uint8_t one_one = r.AllocateLocal(kWasmS128);                             \
+    uint8_t reduced = r.AllocateLocal(kWasmI32);                              \
     r.Build(                                                                  \
         {WASM_LOCAL_SET(zero, WASM_SIMD_I##format##_SPLAT(int_type(0))),      \
          WASM_LOCAL_SET(                                                      \
@@ -3169,22 +3823,24 @@ WASM_EXEC_TEST(SimdF32x4SetGlobal) {
   CHECK_EQ(GetScalar(global, 3), 65.0f);
 }
 
-WASM_EXEC_TEST(F32x4AddRevec) {
-  WasmRunner<float, int32_t, int32_t> r(execution_tier);
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+TEST(RunWasmTurbofan_F32x4AddRevec) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<float, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
   float* memory =
       r.builder().AddMemoryElems<float>(kWasmPageSize / sizeof(float));
-  byte param1 = 0;
-  byte param2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
-  byte temp3 = r.AllocateLocal(kWasmS128);
-  byte temp4 = r.AllocateLocal(kWasmS128);
-  byte temp5 = r.AllocateLocal(kWasmF32);
-  byte temp6 = r.AllocateLocal(kWasmF32);
-  constexpr byte offset = 16;
-
-  // Multiple a vector of F32x8 with a constant and store the result to another
-  // array
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);
+  uint8_t temp4 = r.AllocateLocal(kWasmS128);
+  uint8_t temp5 = r.AllocateLocal(kWasmF32);
+  uint8_t temp6 = r.AllocateLocal(kWasmF32);
+  constexpr uint8_t offset = 16;
+
+  // Add a F32x8 vector by a constant vector and store the result to memory.
   r.Build(
       {WASM_LOCAL_SET(temp1, WASM_SIMD_F32x4_SPLAT(WASM_F32(10.0f))),
        WASM_LOCAL_SET(temp2, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1))),
@@ -3212,6 +3868,58 @@ WASM_EXEC_TEST(F32x4AddRevec) {
   CHECK_EQ(23.0f, r.Call(0, 32));
 }
 
+TEST(RunWasmTurbofan_F32x4ShuffleForSplatRevec) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<float, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  float* memory =
+      r.builder().AddMemoryElems<float>(kWasmPageSize / sizeof(float));
+  constexpr Shuffle splat_shuffle = {8, 9, 10, 11, 8, 9, 10, 11,
+                                     8, 9, 10, 11, 8, 9, 10, 11};
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);
+  uint8_t temp4 = r.AllocateLocal(kWasmS128);
+  uint8_t temp5 = r.AllocateLocal(kWasmF32);
+  uint8_t temp6 = r.AllocateLocal(kWasmF32);
+  constexpr uint8_t offset = 16;
+
+  // Add a F32x8 vector to a splat shuffle vector and store the result to
+  // memory.
+  r.Build(
+      {WASM_LOCAL_SET(temp1, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1))),
+       WASM_LOCAL_SET(temp2, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2))),
+       WASM_LOCAL_SET(temp3, WASM_SIMD_I8x16_SHUFFLE_OP(
+                                 kExprI8x16Shuffle, splat_shuffle,
+                                 WASM_LOCAL_GET(temp2), WASM_LOCAL_GET(temp2))),
+       WASM_LOCAL_SET(temp4,
+                      WASM_SIMD_BINOP(kExprF32x4Add, WASM_LOCAL_GET(temp1),
+                                      WASM_LOCAL_GET(temp3))),
+       WASM_LOCAL_SET(
+           temp1, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param1))),
+       WASM_LOCAL_SET(temp2,
+                      WASM_SIMD_BINOP(kExprF32x4Add, WASM_LOCAL_GET(temp1),
+                                      WASM_LOCAL_GET(temp3))),
+       WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp4)),
+       WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                  WASM_LOCAL_GET(temp2)),
+       WASM_LOCAL_SET(temp5,
+                      WASM_SIMD_F32x4_EXTRACT_LANE(
+                          0, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2)))),
+       WASM_LOCAL_SET(temp6, WASM_SIMD_F32x4_EXTRACT_LANE(
+                                 3, WASM_SIMD_LOAD_MEM_OFFSET(
+                                        offset, WASM_LOCAL_GET(param2)))),
+       WASM_BINOP(kExprF32Add, WASM_LOCAL_GET(temp5), WASM_LOCAL_GET(temp6))});
+
+  r.builder().WriteMemory(&memory[0], 1.0f);
+  r.builder().WriteMemory(&memory[7], 2.0f);
+  r.builder().WriteMemory(&memory[10], 10.0f);
+  CHECK_EQ(23.0f, r.Call(0, 32));
+}
+#endif
+
 WASM_EXEC_TEST(SimdLoadStoreLoad) {
   {
     WasmRunner<int32_t> r(execution_tier);
@@ -3263,8 +3971,8 @@ WASM_EXEC_TEST(SimdLoadStoreLoadMemargOffset) {
     WasmRunner<int32_t> r(execution_tier);
     int32_t* memory =
         r.builder().AddMemoryElems<int32_t>(kWasmPageSize / sizeof(int32_t));
-    constexpr byte offset_1 = 4;
-    constexpr byte offset_2 = 8;
+    constexpr uint8_t offset_1 = 4;
+    constexpr uint8_t offset_2 = 8;
     // Load from memory at offset_1, store to offset_2, load from offset_2, and
     // extract first lane. We use non-zero memarg offsets to test offset
     // decoding.
@@ -3384,6 +4092,182 @@ WASM_EXEC_TEST(S128Load64Splat) {
   RunLoadSplatTest<int64_t>(execution_tier, kExprS128Load64Splat);
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+template <typename T>
+void RunLoadSplatRevecTest(WasmOpcode op, WasmOpcode bin_op,
+                           compiler::IrOpcode::Value revec_opcode,
+                           T (*expected_op)(T, T)) {
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  constexpr int lanes = 16 / sizeof(T);
+  constexpr int mem_index = 64;  // LoadSplat from mem index 64 (bytes).
+  constexpr uint8_t offset = 16;
+
+#define BUILD_LOADSPLAT(get_op, index)                                         \
+  T* memory = r.builder().AddMemoryElems<T>(kWasmPageSize / sizeof(T));        \
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);                                  \
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);                                  \
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);                                  \
+                                                                               \
+  BUILD_AND_CHECK_REVEC_NODE(                                                  \
+      r, revec_opcode,                                                         \
+      WASM_LOCAL_SET(temp1, WASM_SIMD_LOAD_OP(op, get_op(index))),             \
+      WASM_LOCAL_SET(temp2,                                                    \
+                     WASM_SIMD_BINOP(bin_op, WASM_SIMD_LOAD_MEM(WASM_I32V(0)), \
+                                     WASM_LOCAL_GET(temp1))),                  \
+      WASM_LOCAL_SET(                                                          \
+          temp3, WASM_SIMD_BINOP(                                              \
+                     bin_op, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_I32V(0)),  \
+                     WASM_LOCAL_GET(temp1))),                                  \
+                                                                               \
+      /* Store the result to the 32-th byte, which is 2*lanes-th element (size \
+         T) of memory */                                                       \
+      WASM_SIMD_STORE_MEM(WASM_I32V(32), WASM_LOCAL_GET(temp2)),               \
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_I32V(32),                        \
+                                 WASM_LOCAL_GET(temp3)),                       \
+      WASM_ONE);                                                               \
+                                                                               \
+  r.builder().WriteMemory(&memory[1], T(1));                                   \
+  r.builder().WriteMemory(&memory[lanes + 1], T(1));
+
+  {
+    WasmRunner<int32_t> r(TestExecutionTier::kTurbofan);
+    BUILD_LOADSPLAT(WASM_I32V, mem_index)
+
+    for (T x : compiler::ValueHelper::GetVector<T>()) {
+      // 64-th byte in memory is 4*lanes-th element (size T) of memory.
+      r.builder().WriteMemory(&memory[4 * lanes], x);
+      r.Call();
+      T expected = expected_op(1, x);
+      CHECK_EQ(expected, memory[2 * lanes + 1]);
+      CHECK_EQ(expected, memory[3 * lanes + 1]);
+    }
+  }
+
+  // Test for OOB.
+  {
+    WasmRunner<int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+    BUILD_LOADSPLAT(WASM_LOCAL_GET, 0)
+
+    // Load splats load sizeof(T) bytes.
+    for (uint32_t offset = kWasmPageSize - (sizeof(T) - 1);
+         offset < kWasmPageSize; ++offset) {
+      CHECK_TRAP(r.Call(offset));
+    }
+  }
+#undef BUILD_RUN
+}
+
+TEST(RunWasmTurbofan_S256Load8Splat) {
+  RunLoadSplatRevecTest<int8_t>(kExprS128Load8Splat, kExprI32x4Add,
+                                compiler::IrOpcode::kI32x8Add,
+                                base::AddWithWraparound);
+}
+
+TEST(RunWasmTurbofan_S256Load16Splat) {
+  RunLoadSplatRevecTest<int16_t>(kExprS128Load16Splat, kExprI16x8Add,
+                                 compiler::IrOpcode::kI16x16Add,
+                                 base::AddWithWraparound);
+}
+
+TEST(RunWasmTurbofan_S256Load32Splat) {
+  RunLoadSplatRevecTest<int32_t>(kExprS128Load32Splat, kExprI32x4Add,
+                                 compiler::IrOpcode::kI32x8Add,
+                                 base::AddWithWraparound);
+}
+
+TEST(RunWasmTurbofan_S256Load64Splat) {
+  RunLoadSplatRevecTest<int64_t>(kExprS128Load64Splat, kExprI64x2Add,
+                                 compiler::IrOpcode::kI64x4Add,
+                                 base::AddWithWraparound);
+}
+
+template <typename S, typename T>
+void RunLoadExtendRevecTest(WasmOpcode op) {
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  static_assert(sizeof(S) < sizeof(T),
+                "load extend should go from smaller to larger type");
+  constexpr int lanes_s = 16 / sizeof(S);
+  constexpr int lanes_t = 16 / sizeof(T);
+  constexpr uint8_t offset_s = 8;  // Load extend accesses 8 bytes value.
+  constexpr uint8_t offset = 16;
+  constexpr int mem_index = 0;  // Load from mem index 0 (bytes).
+
+#define BUILD_LOADEXTEND(get_op, index)                                      \
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);                                \
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);                                \
+                                                                             \
+  BUILD_AND_CHECK_REVEC_NODE(                                                \
+      r, compiler::IrOpcode::kStore,                                         \
+      WASM_LOCAL_SET(temp1, WASM_SIMD_LOAD_OP(op, get_op(index))),           \
+      WASM_LOCAL_SET(temp2,                                                  \
+                     WASM_SIMD_LOAD_OP_OFFSET(op, get_op(index), offset_s)), \
+                                                                             \
+      /* Store the result to the 16-th byte, which is lanes-th element (size \
+         S) of memory. */                                                    \
+      WASM_SIMD_STORE_MEM(WASM_I32V(16), WASM_LOCAL_GET(temp1)),             \
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_I32V(16),                      \
+                                 WASM_LOCAL_GET(temp2)),                     \
+      WASM_ONE);
+
+  {
+    WasmRunner<int32_t> r(TestExecutionTier::kTurbofan);
+    S* memory = r.builder().AddMemoryElems<S>(kWasmPageSize / sizeof(S));
+    BUILD_LOADEXTEND(WASM_I32V, mem_index)
+
+    for (S x : compiler::ValueHelper::GetVector<S>()) {
+      for (int i = 0; i < lanes_s; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+      }
+      r.Call();
+      for (int i = 0; i < 2 * lanes_t; i++) {
+        CHECK_EQ(static_cast<T>(x), reinterpret_cast<T*>(&memory[lanes_s])[i]);
+      }
+    }
+  }
+
+  // Test for OOB.
+  {
+    WasmRunner<int32_t, uint32_t> r(TestExecutionTier::kTurbofan);
+    r.builder().AddMemoryElems<S>(kWasmPageSize / sizeof(S));
+    BUILD_LOADEXTEND(WASM_LOCAL_GET, 0)
+
+    // Load extends load 8 bytes, so should trap from -7.
+    for (uint32_t offset = kWasmPageSize - 7; offset < kWasmPageSize;
+         ++offset) {
+      CHECK_TRAP(r.Call(offset));
+    }
+  }
+}
+
+TEST(S128Load8x8U) {
+  RunLoadExtendRevecTest<uint8_t, uint16_t>(kExprS128Load8x8U);
+}
+
+TEST(S128Load8x8S) {
+  RunLoadExtendRevecTest<int8_t, int16_t>(kExprS128Load8x8S);
+}
+
+TEST(S128Load16x4U) {
+  RunLoadExtendRevecTest<uint16_t, uint32_t>(kExprS128Load16x4U);
+}
+
+TEST(S128Load16x4S) {
+  RunLoadExtendRevecTest<int16_t, int32_t>(kExprS128Load16x4S);
+}
+
+TEST(S128Load32x2U) {
+  RunLoadExtendRevecTest<uint32_t, uint64_t>(kExprS128Load32x2U);
+}
+
+TEST(S128Load32x2S) {
+  RunLoadExtendRevecTest<int32_t, int64_t>(kExprS128Load32x2S);
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 template <typename S, typename T>
 void RunLoadExtendTest(TestExecutionTier execution_tier, WasmOpcode op) {
   static_assert(sizeof(S) < sizeof(T),
@@ -3392,7 +4276,7 @@ void RunLoadExtendTest(TestExecutionTier execution_tier, WasmOpcode op) {
   constexpr int lanes_t = 16 / sizeof(T);
   constexpr int mem_index = 16;  // Load from mem index 16 (bytes).
   // Load extends always load 64 bits, so alignment values can be from 0 to 3.
-  for (byte alignment = 0; alignment <= 3; alignment++) {
+  for (uint8_t alignment = 0; alignment <= 3; alignment++) {
     WasmRunner<int32_t> r(execution_tier);
     S* memory = r.builder().AddMemoryElems<S>(kWasmPageSize / sizeof(S));
     T* global = r.builder().AddGlobal<T>(kWasmS128);
@@ -3417,7 +4301,7 @@ void RunLoadExtendTest(TestExecutionTier execution_tier, WasmOpcode op) {
     WasmRunner<int32_t> r(execution_tier);
     S* memory = r.builder().AddMemoryElems<S>(kWasmPageSize / sizeof(S));
     T* global = r.builder().AddGlobal<T>(kWasmS128);
-    constexpr byte offset = sizeof(S);
+    constexpr uint8_t offset = sizeof(S);
     r.Build(
         {WASM_GLOBAL_SET(0, WASM_SIMD_LOAD_OP_OFFSET(op, WASM_ZERO, offset)),
          WASM_ONE});
@@ -3498,7 +4382,7 @@ void RunLoadZeroTest(TestExecutionTier execution_tier, WasmOpcode op) {
 
   // Check all supported alignments.
   constexpr int max_alignment = base::bits::CountTrailingZeros(sizeof(S));
-  for (byte alignment = 0; alignment <= max_alignment; alignment++) {
+  for (uint8_t alignment = 0; alignment <= max_alignment; alignment++) {
     WasmRunner<int32_t> r(execution_tier);
     std::tie(memory, global) = initialize_builder(&r);
 
@@ -3560,20 +4444,20 @@ WASM_EXEC_TEST(S128Load64Zero) {
 template <typename T>
 void RunLoadLaneTest(TestExecutionTier execution_tier, WasmOpcode load_op,
                      WasmOpcode splat_op) {
-  byte const_op = static_cast<byte>(
+  uint8_t const_op = static_cast<uint8_t>(
       splat_op == kExprI64x2Splat ? kExprI64Const : kExprI32Const);
 
-  constexpr byte lanes_s = kSimd128Size / sizeof(T);
+  constexpr uint8_t lanes_s = kSimd128Size / sizeof(T);
   constexpr int mem_index = 16;  // Load from mem index 16 (bytes).
-  constexpr byte splat_value = 33;
+  constexpr uint8_t splat_value = 33;
   T sentinel = T{-1};
 
   T* memory;
   T* global;
 
   auto build_fn = [=, &memory, &global](WasmRunner<int32_t>& r, int mem_index,
-                                        byte lane, byte alignment,
-                                        byte offset) {
+                                        uint8_t lane, uint8_t alignment,
+                                        uint8_t offset) {
     memory = r.builder().AddMemoryElems<T>(kWasmPageSize / sizeof(T));
     global = r.builder().AddGlobal<T>(kWasmS128);
     r.builder().WriteMemory(&memory[lanes_s], sentinel);
@@ -3586,13 +4470,13 @@ void RunLoadLaneTest(TestExecutionTier execution_tier, WasmOpcode load_op,
 
   auto check_results = [=](T* global, int sentinel_lane = 0) {
     // Only one lane is loaded, the rest of the lanes are unchanged.
-    for (byte i = 0; i < lanes_s; i++) {
+    for (uint8_t i = 0; i < lanes_s; i++) {
       T expected = i == sentinel_lane ? sentinel : static_cast<T>(splat_value);
       CHECK_EQ(expected, LANE(global, i));
     }
   };
 
-  for (byte lane_index = 0; lane_index < lanes_s; ++lane_index) {
+  for (uint8_t lane_index = 0; lane_index < lanes_s; ++lane_index) {
     WasmRunner<int32_t> r(execution_tier);
     build_fn(r, mem_index, lane_index, /*alignment=*/0, /*offset=*/0);
     r.Call();
@@ -3601,7 +4485,7 @@ void RunLoadLaneTest(TestExecutionTier execution_tier, WasmOpcode load_op,
 
   // Check all possible alignments.
   constexpr int max_alignment = base::bits::CountTrailingZeros(sizeof(T));
-  for (byte alignment = 0; alignment <= max_alignment; ++alignment) {
+  for (uint8_t alignment = 0; alignment <= max_alignment; ++alignment) {
     WasmRunner<int32_t> r(execution_tier);
     build_fn(r, mem_index, /*lane=*/0, alignment, /*offset=*/0);
     r.Call();
@@ -3658,16 +4542,17 @@ WASM_EXEC_TEST(S128Load64Lane) {
 template <typename T>
 void RunStoreLaneTest(TestExecutionTier execution_tier, WasmOpcode store_op,
                       WasmOpcode splat_op) {
-  constexpr byte lanes = kSimd128Size / sizeof(T);
+  constexpr uint8_t lanes = kSimd128Size / sizeof(T);
   constexpr int mem_index = 16;  // Store to mem index 16 (bytes).
-  constexpr byte splat_value = 33;
-  byte const_op = static_cast<byte>(
+  constexpr uint8_t splat_value = 33;
+  uint8_t const_op = static_cast<uint8_t>(
       splat_op == kExprI64x2Splat ? kExprI64Const : kExprI32Const);
 
   T* memory;  // Will be set by build_fn.
 
   auto build_fn = [=, &memory](WasmRunner<int32_t>& r, int mem_index,
-                               byte lane_index, byte alignment, byte offset) {
+                               uint8_t lane_index, uint8_t alignment,
+                               uint8_t offset) {
     memory = r.builder().AddMemoryElems<T>(kWasmPageSize / sizeof(T));
     // Splat splat_value, then only Store and replace a single lane.
     r.Build({WASM_I32V(mem_index), const_op, splat_value,
@@ -3677,18 +4562,18 @@ void RunStoreLaneTest(TestExecutionTier execution_tier, WasmOpcode store_op,
   };
 
   auto check_results = [=](WasmRunner<int32_t>& r, T* memory) {
-    for (byte i = 0; i < lanes; i++) {
+    for (uint8_t i = 0; i < lanes; i++) {
       CHECK_EQ(0, r.builder().ReadMemory(&memory[i]));
     }
 
     CHECK_EQ(splat_value, r.builder().ReadMemory(&memory[lanes]));
 
-    for (byte i = lanes + 1; i < lanes * 2; i++) {
+    for (uint8_t i = lanes + 1; i < lanes * 2; i++) {
       CHECK_EQ(0, r.builder().ReadMemory(&memory[i]));
     }
   };
 
-  for (byte lane_index = 0; lane_index < lanes; lane_index++) {
+  for (uint8_t lane_index = 0; lane_index < lanes; lane_index++) {
     WasmRunner<int32_t> r(execution_tier);
     build_fn(r, mem_index, lane_index, ZERO_ALIGNMENT, ZERO_OFFSET);
     r.Call();
@@ -3697,7 +4582,7 @@ void RunStoreLaneTest(TestExecutionTier execution_tier, WasmOpcode store_op,
 
   // Check all possible alignments.
   constexpr int max_alignment = base::bits::CountTrailingZeros(sizeof(T));
-  for (byte alignment = 0; alignment <= max_alignment; ++alignment) {
+  for (uint8_t alignment = 0; alignment <= max_alignment; ++alignment) {
     WasmRunner<int32_t> r(execution_tier);
     build_fn(r, mem_index, /*lane_index=*/0, alignment, ZERO_OFFSET);
     r.Call();
@@ -3752,7 +4637,7 @@ WASM_EXEC_TEST(S128Store64Lane) {
   WASM_EXEC_TEST(S##format##AnyTrue) {                                         \
     WasmRunner<int32_t, param_type> r(execution_tier);                         \
     if (lanes == 2) return;                                                    \
-    byte simd = r.AllocateLocal(kWasmS128);                                    \
+    uint8_t simd = r.AllocateLocal(kWasmS128);                                 \
     r.Build(                                                                   \
         {WASM_LOCAL_SET(simd, WASM_SIMD_I##format##_SPLAT(WASM_LOCAL_GET(0))), \
          WASM_SIMD_UNOP(kExprV128AnyTrue, WASM_LOCAL_GET(simd))});             \
@@ -3769,7 +4654,7 @@ WASM_SIMD_ANYTRUE_TEST(8x16, 16, 0xff, int32_t)
 // 0.0 and -0.0 will be different in an anytrue (IEEE753 says they are equals).
 WASM_EXEC_TEST(V128AnytrueWithNegativeZero) {
   WasmRunner<int32_t, int64_t> r(execution_tier);
-  byte simd = r.AllocateLocal(kWasmS128);
+  uint8_t simd = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(simd, WASM_SIMD_I64x2_SPLAT(WASM_LOCAL_GET(0))),
            WASM_SIMD_UNOP(kExprV128AnyTrue, WASM_LOCAL_GET(simd))});
   CHECK_EQ(1, r.Call(0x8000000000000000));
@@ -3780,7 +4665,7 @@ WASM_EXEC_TEST(V128AnytrueWithNegativeZero) {
   WASM_EXEC_TEST(I##format##AllTrue) {                                         \
     WasmRunner<int32_t, param_type> r(execution_tier);                         \
     if (lanes == 2) return;                                                    \
-    byte simd = r.AllocateLocal(kWasmS128);                                    \
+    uint8_t simd = r.AllocateLocal(kWasmS128);                                 \
     r.Build(                                                                   \
         {WASM_LOCAL_SET(simd, WASM_SIMD_I##format##_SPLAT(WASM_LOCAL_GET(0))), \
          WASM_SIMD_UNOP(kExprI##format##AllTrue, WASM_LOCAL_GET(simd))});      \
@@ -3795,7 +4680,7 @@ WASM_SIMD_ALLTRUE_TEST(8x16, 16, 0xff, int32_t)
 
 WASM_EXEC_TEST(BitSelect) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
-  byte simd = r.AllocateLocal(kWasmS128);
+  uint8_t simd = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(
                simd, WASM_SIMD_SELECT(
                          32x4, WASM_SIMD_I32x4_SPLAT(WASM_I32V(0x01020304)),
@@ -3808,7 +4693,7 @@ WASM_EXEC_TEST(BitSelect) {
 void RunSimdConstTest(TestExecutionTier execution_tier,
                       const std::array<uint8_t, kSimd128Size>& expected) {
   WasmRunner<uint32_t> r(execution_tier);
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   uint8_t* src0 = r.builder().AddGlobal<uint8_t>(kWasmS128);
   r.Build({WASM_GLOBAL_SET(temp1, WASM_SIMD_CONSTANT(expected)), WASM_ONE});
   CHECK_EQ(1, r.Call());
@@ -3888,7 +4773,7 @@ WASM_EXEC_TEST(I16x8GtUMixed) {
 WASM_EXEC_TEST(I16x8ExtractLaneU_I8x16Splat) {
   // Test that we are correctly signed/unsigned extending when extracting.
   WasmRunner<int32_t, int32_t> r(execution_tier);
-  byte simd_val = r.AllocateLocal(kWasmS128);
+  uint8_t simd_val = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(simd_val, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(0))),
            WASM_SIMD_I16x8_EXTRACT_LANE_U(0, WASM_LOCAL_GET(simd_val))});
   CHECK_EQ(0xfafa, r.Call(0xfa));
@@ -3988,8 +4873,8 @@ WASM_EXEC_TEST(AddExtAddPairwiseI32LeftUnsigned) {
 WASM_EXEC_TEST(Regress_12237) {
   WasmRunner<int32_t, int64_t> r(execution_tier);
   int64_t* g = r.builder().AddGlobal<int64_t>(kWasmS128);
-  byte value = 0;
-  byte temp = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp = r.AllocateLocal(kWasmS128);
   int64_t local = 123;
   r.Build({WASM_LOCAL_SET(
                temp, WASM_SIMD_OPN(kExprI64x2Splat, WASM_LOCAL_GET(value))),
@@ -4009,8 +4894,8 @@ WASM_EXEC_TEST(Regress_12237) {
 #define WASM_EXTRACT_I16x8_TEST(Sign, Type)                                  \
   WASM_EXEC_TEST(I16X8ExtractLane##Sign) {                                   \
     WasmRunner<int32_t, int32_t> r(execution_tier);                          \
-    byte int_val = r.AllocateLocal(kWasmI32);                                \
-    byte simd_val = r.AllocateLocal(kWasmS128);                              \
+    uint8_t int_val = r.AllocateLocal(kWasmI32);                             \
+    uint8_t simd_val = r.AllocateLocal(kWasmS128);                           \
     r.Build({WASM_LOCAL_SET(simd_val,                                        \
                             WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(int_val))), \
              WASM_SIMD_CHECK_LANE_U(I16x8, simd_val, I32, int_val, 0),       \
@@ -4026,8 +4911,8 @@ WASM_EXTRACT_I16x8_TEST(S, UINT16) WASM_EXTRACT_I16x8_TEST(I, INT16)
 #define WASM_EXTRACT_I8x16_TEST(Sign, Type)                                  \
   WASM_EXEC_TEST(I8x16ExtractLane##Sign) {                                   \
     WasmRunner<int32_t, int32_t> r(execution_tier);                          \
-    byte int_val = r.AllocateLocal(kWasmI32);                                \
-    byte simd_val = r.AllocateLocal(kWasmS128);                              \
+    uint8_t int_val = r.AllocateLocal(kWasmI32);                             \
+    uint8_t simd_val = r.AllocateLocal(kWasmS128);                           \
     r.Build({WASM_LOCAL_SET(simd_val,                                        \
                             WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(int_val))), \
              WASM_SIMD_CHECK_LANE_U(I8x16, simd_val, I32, int_val, 1),       \
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm-wrappers.cc b/deps/v8/test/cctest/wasm/test-run-wasm-wrappers.cc
index c0d1bfb46d6e03..4278a13dfd91c9 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm-wrappers.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm-wrappers.cc
@@ -17,7 +17,8 @@ namespace test_run_wasm_wrappers {
 
 using testing::CompileAndInstantiateForTesting;
 
-#if (V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_ARM64)
+#if V8_COMPRESS_POINTERS && (V8_TARGET_ARCH_X64 || V8_TARGET_ARCH_ARM64 || \
+                             V8_TARGET_ARCH_IA32 || V8_TARGET_ARCH_ARM)
 namespace {
 Handle<WasmInstanceObject> CompileModule(Zone* zone, Isolate* isolate,
                                          WasmModuleBuilder* builder) {
@@ -32,13 +33,13 @@ Handle<WasmInstanceObject> CompileModule(Zone* zone, Isolate* isolate,
   return maybe_instance.ToHandleChecked();
 }
 
-bool IsGeneric(Code wrapper) {
-  return wrapper.is_builtin() &&
-         wrapper.builtin_id() == Builtin::kGenericJSToWasmWrapper;
+bool IsGeneric(Tagged<Code> wrapper) {
+  return wrapper->is_builtin() &&
+         wrapper->builtin_id() == Builtin::kJSToWasmWrapper;
 }
 
-bool IsSpecific(Code wrapper) {
-  return wrapper.kind() == CodeKind::JS_TO_WASM_FUNCTION;
+bool IsSpecific(Tagged<Code> wrapper) {
+  return wrapper->kind() == CodeKind::JS_TO_WASM_FUNCTION;
 }
 
 Handle<Object> SmiHandle(Isolate* isolate, int value) {
@@ -51,7 +52,7 @@ void SmiCall(Isolate* isolate, Handle<WasmExportedFunction> exported_function,
   Handle<Object> result =
       Execution::Call(isolate, exported_function, receiver, argc, argv)
           .ToHandleChecked();
-  CHECK(result->IsSmi() && Smi::ToInt(*result) == expected_result);
+  CHECK(IsSmi(*result) && Smi::ToInt(*result) == expected_result);
 }
 
 void Cleanup() {
@@ -84,8 +85,8 @@ TEST(WrapperBudget) {
     TestSignatures sigs;
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_ii());
     f->builder()->AddExport(base::CStrVector("main"), f);
-    byte code[] = {WASM_I32_MUL(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)),
-                   WASM_END};
+    uint8_t code[] = {WASM_I32_MUL(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)),
+                      WASM_END};
     f->EmitCode(code, sizeof(code));
 
     // Compile the module.
@@ -97,7 +98,7 @@ TEST(WrapperBudget) {
         testing::GetExportedFunction(isolate, instance, "main")
             .ToHandleChecked();
     Handle<WasmExportedFunctionData> main_function_data =
-        handle(main_export->shared().wasm_exported_function_data(), isolate);
+        handle(main_export->shared()->wasm_exported_function_data(), isolate);
 
     // Check that the generic-wrapper budget has initially a value of
     // kGenericWrapperBudget.
@@ -134,7 +135,7 @@ TEST(WrapperReplacement) {
     TestSignatures sigs;
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_i());
     f->builder()->AddExport(base::CStrVector("main"), f);
-    byte code[] = {WASM_LOCAL_GET(0), WASM_END};
+    uint8_t code[] = {WASM_LOCAL_GET(0), WASM_END};
     f->EmitCode(code, sizeof(code));
 
     // Compile the module.
@@ -146,7 +147,7 @@ TEST(WrapperReplacement) {
         testing::GetExportedFunction(isolate, instance, "main")
             .ToHandleChecked();
     Handle<WasmExportedFunctionData> main_function_data =
-        handle(main_export->shared().wasm_exported_function_data(), isolate);
+        handle(main_export->shared()->wasm_exported_function_data(), isolate);
 
     // Check that the generic-wrapper budget has initially a value of
     // kGenericWrapperBudget.
@@ -174,7 +175,7 @@ TEST(WrapperReplacement) {
     }
 
     // Get the wrapper-code object after the wrapper replacement.
-    Code wrapper_after_call = main_function_data->wrapper_code();
+    Tagged<Code> wrapper_after_call = main_function_data->wrapper_code();
 
     // Verify that the budget has been exhausted.
     CHECK_EQ(main_function_data->wrapper_budget(), 0);
@@ -208,17 +209,17 @@ TEST(EagerWrapperReplacement) {
     TestSignatures sigs;
     WasmFunctionBuilder* add = builder->AddFunction(sigs.i_ii());
     add->builder()->AddExport(base::CStrVector("add"), add);
-    byte add_code[] = {WASM_I32_ADD(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)),
-                       WASM_END};
+    uint8_t add_code[] = {WASM_I32_ADD(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)),
+                          WASM_END};
     add->EmitCode(add_code, sizeof(add_code));
     WasmFunctionBuilder* mult = builder->AddFunction(sigs.i_ii());
     mult->builder()->AddExport(base::CStrVector("mult"), mult);
-    byte mult_code[] = {WASM_I32_MUL(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)),
-                        WASM_END};
+    uint8_t mult_code[] = {WASM_I32_MUL(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)),
+                           WASM_END};
     mult->EmitCode(mult_code, sizeof(mult_code));
     WasmFunctionBuilder* id = builder->AddFunction(sigs.i_i());
     id->builder()->AddExport(base::CStrVector("id"), id);
-    byte id_code[] = {WASM_LOCAL_GET(0), WASM_END};
+    uint8_t id_code[] = {WASM_LOCAL_GET(0), WASM_END};
     id->EmitCode(id_code, sizeof(id_code));
 
     // Compile the module.
@@ -237,11 +238,11 @@ TEST(EagerWrapperReplacement) {
 
     // Get the function data for all exported functions.
     Handle<WasmExportedFunctionData> add_function_data =
-        handle(add_export->shared().wasm_exported_function_data(), isolate);
+        handle(add_export->shared()->wasm_exported_function_data(), isolate);
     Handle<WasmExportedFunctionData> mult_function_data =
-        handle(mult_export->shared().wasm_exported_function_data(), isolate);
+        handle(mult_export->shared()->wasm_exported_function_data(), isolate);
     Handle<WasmExportedFunctionData> id_function_data =
-        handle(id_export->shared().wasm_exported_function_data(), isolate);
+        handle(id_export->shared()->wasm_exported_function_data(), isolate);
 
     // Set the remaining generic-wrapper budget for add to 1,
     // so that the next call to it will cause the function to tier up.
@@ -313,7 +314,7 @@ TEST(WrapperReplacement_IndirectExport) {
     // Define a Wasm function, but do not add it to the exports.
     TestSignatures sigs;
     WasmFunctionBuilder* f = builder->AddFunction(sigs.i_i());
-    byte code[] = {WASM_LOCAL_GET(0), WASM_END};
+    uint8_t code[] = {WASM_LOCAL_GET(0), WASM_END};
     f->EmitCode(code, sizeof(code));
     uint32_t function_index = f->func_index();
 
@@ -334,17 +335,17 @@ TEST(WrapperReplacement_IndirectExport) {
 
     // Get the exported table.
     Handle<WasmTableObject> table(
-        WasmTableObject::cast(instance->tables().get(table_index)), isolate);
+        WasmTableObject::cast(instance->tables()->get(table_index)), isolate);
     // Get the Wasm function through the exported table.
     Handle<Object> function =
         WasmTableObject::Get(isolate, table, function_index);
-    Handle<WasmExportedFunction> indirect_function(
-        WasmExportedFunction::cast(
-            WasmInternalFunction::cast(*function).external()),
-        isolate);
+    Handle<WasmExportedFunction> indirect_function =
+        Handle<WasmExportedFunction>::cast(
+            WasmInternalFunction::GetOrCreateExternal(
+                Handle<WasmInternalFunction>::cast(function)));
     // Get the function data.
     Handle<WasmExportedFunctionData> indirect_function_data(
-        indirect_function->shared().wasm_exported_function_data(), isolate);
+        indirect_function->shared()->wasm_exported_function_data(), isolate);
 
     // Verify that the generic-wrapper budget has initially a value of
     // kGenericWrapperBudget and the wrapper to be used for calls to the
diff --git a/deps/v8/test/cctest/wasm/test-run-wasm.cc b/deps/v8/test/cctest/wasm/test-run-wasm.cc
index 1cfb1bb1d898a4..950126e2303203 100644
--- a/deps/v8/test/cctest/wasm/test-run-wasm.cc
+++ b/deps/v8/test/cctest/wasm/test-run-wasm.cc
@@ -16,10 +16,7 @@
 #include "test/common/wasm/test-signatures.h"
 #include "test/common/wasm/wasm-macro-gen.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
-namespace test_run_wasm {
+namespace v8::internal::wasm {
 
 // for even shorter tests.
 #define B1(a) WASM_BLOCK(a)
@@ -95,8 +92,8 @@ WASM_EXEC_TEST(Int32Add_P_fallthru) {
   FOR_INT32_INPUTS(i) { CHECK_EQ(base::AddWithWraparound(i, 13), r.Call(i)); }
 }
 
-static void RunInt32AddTest(TestExecutionTier execution_tier, const byte* code,
-                            size_t size) {
+static void RunInt32AddTest(TestExecutionTier execution_tier,
+                            const uint8_t* code, size_t size) {
   TestSignatures sigs;
   WasmRunner<int32_t, int32_t, int32_t> r(execution_tier);
   r.builder().AddSignature(sigs.ii_v());
@@ -112,26 +109,26 @@ static void RunInt32AddTest(TestExecutionTier execution_tier, const byte* code,
 }
 
 WASM_EXEC_TEST(Int32Add_P2) {
-  static const byte code[] = {
+  static const uint8_t code[] = {
       WASM_I32_ADD(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))};
   RunInt32AddTest(execution_tier, code, sizeof(code));
 }
 
 WASM_EXEC_TEST(Int32Add_block1) {
-  static const byte code[] = {
+  static const uint8_t code[] = {
       WASM_BLOCK_X(1, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)), kExprI32Add};
   RunInt32AddTest(execution_tier, code, sizeof(code));
 }
 
 WASM_EXEC_TEST(Int32Add_block2) {
-  static const byte code[] = {
+  static const uint8_t code[] = {
       WASM_BLOCK_X(1, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1), kExprBr, DEPTH_0),
       kExprI32Add};
   RunInt32AddTest(execution_tier, code, sizeof(code));
 }
 
 WASM_EXEC_TEST(Int32Add_multi_if) {
-  static const byte code[] = {
+  static const uint8_t code[] = {
       WASM_IF_ELSE_X(1, WASM_LOCAL_GET(0),
                      WASM_SEQ(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)),
                      WASM_SEQ(WASM_LOCAL_GET(1), WASM_LOCAL_GET(0))),
@@ -802,6 +799,23 @@ WASM_EXEC_TEST(SelectWithType_float_parameters) {
   r.Build(
       {WASM_SELECT_F(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1), WASM_LOCAL_GET(2))});
   CHECK_FLOAT_EQ(2.0f, r.Call(2.0f, 1.0f, 1));
+  CHECK_FLOAT_EQ(1.0f, r.Call(2.0f, 1.0f, 0));
+}
+
+WASM_EXEC_TEST(Select_double_parameters) {
+  WasmRunner<double, double, double, int32_t> r(execution_tier);
+  r.Build(
+      {WASM_SELECT(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1), WASM_LOCAL_GET(2))});
+  CHECK_FLOAT_EQ(2.0f, r.Call(2.0f, 1.0f, 1));
+  CHECK_FLOAT_EQ(1.0f, r.Call(2.0f, 1.0f, 0));
+}
+
+WASM_EXEC_TEST(SelectWithType_double_parameters) {
+  WasmRunner<double, double, double, int32_t> r(execution_tier);
+  r.Build(
+      {WASM_SELECT_D(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1), WASM_LOCAL_GET(2))});
+  CHECK_FLOAT_EQ(2.0f, r.Call(2.0f, 1.0f, 1));
+  CHECK_FLOAT_EQ(1.0f, r.Call(2.0f, 1.0f, 0));
 }
 
 WASM_EXEC_TEST(Select) {
@@ -899,6 +913,53 @@ WASM_EXEC_TEST(SelectWithType_strict3) {
   }
 }
 
+WASM_EXEC_TEST(Select64) {
+  WasmRunner<int64_t, int32_t> r(execution_tier);
+  // return select(11, 22, a);
+  r.Build({WASM_SELECT(WASM_I64V_1(11), WASM_I64V_1(22), WASM_LOCAL_GET(0))});
+  FOR_INT32_INPUTS(i) {
+    int64_t expected = i ? 11 : 22;
+    CHECK_EQ(expected, r.Call(i));
+  }
+}
+
+WASM_EXEC_TEST(Select64WithType) {
+  WasmRunner<int64_t, int32_t> r(execution_tier);
+  // return select(11, 22, a);
+  r.Build({WASM_SELECT_L(WASM_I64V_1(11), WASM_I64V_1(22), WASM_LOCAL_GET(0))});
+  FOR_INT32_INPUTS(i) {
+    int64_t expected = i ? 11 : 22;
+    CHECK_EQ(expected, r.Call(i));
+  }
+}
+
+WASM_EXEC_TEST(Select64_strict1) {
+  WasmRunner<int64_t, int32_t> r(execution_tier);
+  r.AllocateLocal(kWasmI64);
+  r.AllocateLocal(kWasmI64);
+  // select(b=5, c=6, a)
+  r.Build({WASM_SELECT(WASM_LOCAL_TEE(1, WASM_I64V_1(5)),
+                       WASM_LOCAL_TEE(2, WASM_I64V_1(6)), WASM_LOCAL_GET(0))});
+  FOR_INT32_INPUTS(i) {
+    int64_t expected = i ? 5 : 6;
+    CHECK_EQ(expected, r.Call(i));
+  }
+}
+
+WASM_EXEC_TEST(Select64WithType_strict1) {
+  WasmRunner<int64_t, int32_t> r(execution_tier);
+  r.AllocateLocal(kWasmI64);
+  r.AllocateLocal(kWasmI64);
+  // select(b=5, c=6, a)
+  r.Build(
+      {WASM_SELECT_L(WASM_LOCAL_TEE(1, WASM_I64V_1(5)),
+                     WASM_LOCAL_TEE(2, WASM_I64V_1(6)), WASM_LOCAL_GET(0))});
+  FOR_INT32_INPUTS(i) {
+    int64_t expected = i ? 5 : 6;
+    CHECK_EQ(expected, r.Call(i));
+  }
+}
+
 WASM_EXEC_TEST(BrIf_strict) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
   r.Build({WASM_BLOCK_I(
@@ -1031,10 +1092,10 @@ WASM_EXEC_TEST(BrTable4) {
 }
 
 WASM_EXEC_TEST(BrTable4x4) {
-  for (byte a = 0; a < 4; ++a) {
-    for (byte b = 0; b < 4; ++b) {
-      for (byte c = 0; c < 4; ++c) {
-        for (byte d = 0; d < 4; ++d) {
+  for (uint8_t a = 0; a < 4; ++a) {
+    for (uint8_t b = 0; b < 4; ++b) {
+      for (uint8_t c = 0; c < 4; ++c) {
+        for (uint8_t d = 0; d < 4; ++d) {
           for (int i = 0; i < 4; ++i) {
             uint32_t cases[] = {a, b, c, d};
 
@@ -1567,7 +1628,7 @@ WASM_EXEC_TEST(LoadMemI32) {
 }
 
 WASM_EXEC_TEST(LoadMemI32_alignment) {
-  for (byte alignment = 0; alignment <= 2; ++alignment) {
+  for (uint8_t alignment = 0; alignment <= 2; ++alignment) {
     WasmRunner<int32_t, int32_t> r(execution_tier);
     int32_t* memory =
         r.builder().AddMemoryElems<int32_t>(kWasmPageSize / sizeof(int32_t));
@@ -1618,10 +1679,10 @@ WASM_EXEC_TEST(LoadMem_offset_oob) {
 
   for (size_t m = 0; m < arraysize(machineTypes); ++m) {
     WasmRunner<int32_t, uint32_t> r(execution_tier);
-    r.builder().AddMemoryElems<byte>(num_bytes);
+    r.builder().AddMemoryElems<uint8_t>(num_bytes);
     r.builder().RandomizeMemory(1116 + static_cast<int>(m));
 
-    constexpr byte kOffset = 8;
+    constexpr uint8_t kOffset = 8;
     uint32_t boundary = num_bytes - kOffset - machineTypes[m].MemSize();
 
     r.Build({WASM_LOAD_MEM_OFFSET(machineTypes[m], kOffset, WASM_LOCAL_GET(0)),
@@ -1663,13 +1724,13 @@ WASM_EXEC_TEST(LoadMemI32_offset) {
 WASM_EXEC_TEST(LoadMemI32_const_oob_misaligned) {
   // This test accesses memory starting at kRunwayLength bytes before the end of
   // the memory until a few bytes beyond.
-  constexpr byte kRunwayLength = 12;
+  constexpr uint8_t kRunwayLength = 12;
   // TODO(titzer): Fix misaligned accesses on MIPS and re-enable.
-  for (byte offset = 0; offset < kRunwayLength + 5; ++offset) {
+  for (uint8_t offset = 0; offset < kRunwayLength + 5; ++offset) {
     for (uint32_t index = kWasmPageSize - kRunwayLength;
          index < kWasmPageSize + 5; ++index) {
       WasmRunner<int32_t> r(execution_tier);
-      r.builder().AddMemoryElems<byte>(kWasmPageSize);
+      r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
       r.builder().RandomizeMemory();
 
       r.Build({WASM_LOAD_MEM_OFFSET(MachineType::Int32(), offset,
@@ -1687,12 +1748,12 @@ WASM_EXEC_TEST(LoadMemI32_const_oob_misaligned) {
 WASM_EXEC_TEST(LoadMemI32_const_oob) {
   // This test accesses memory starting at kRunwayLength bytes before the end of
   // the memory until a few bytes beyond.
-  constexpr byte kRunwayLength = 24;
-  for (byte offset = 0; offset < kRunwayLength + 5; offset += 4) {
+  constexpr uint8_t kRunwayLength = 24;
+  for (uint8_t offset = 0; offset < kRunwayLength + 5; offset += 4) {
     for (uint32_t index = kWasmPageSize - kRunwayLength;
          index < kWasmPageSize + 5; index += 4) {
       WasmRunner<int32_t> r(execution_tier);
-      r.builder().AddMemoryElems<byte>(kWasmPageSize);
+      r.builder().AddMemoryElems<uint8_t>(kWasmPageSize);
       r.builder().RandomizeMemory();
 
       r.Build({WASM_LOAD_MEM_OFFSET(MachineType::Int32(), offset,
@@ -1710,7 +1771,7 @@ WASM_EXEC_TEST(LoadMemI32_const_oob) {
 WASM_EXEC_TEST(StoreMemI32_alignment) {
   const int32_t kWritten = 0x12345678;
 
-  for (byte i = 0; i <= 2; ++i) {
+  for (uint8_t i = 0; i <= 2; ++i) {
     WasmRunner<int32_t, int32_t> r(execution_tier);
     int32_t* memory =
         r.builder().AddMemoryElems<int32_t>(kWasmPageSize / sizeof(int32_t));
@@ -1760,7 +1821,7 @@ WASM_EXEC_TEST(StoreMem_offset_oob) {
 
   for (size_t m = 0; m < arraysize(machineTypes); ++m) {
     WasmRunner<int32_t, uint32_t> r(execution_tier);
-    byte* memory = r.builder().AddMemoryElems<byte>(num_bytes);
+    uint8_t* memory = r.builder().AddMemoryElems<uint8_t>(num_bytes);
 
     r.builder().RandomizeMemory(1119 + static_cast<int>(m));
 
@@ -1768,7 +1829,7 @@ WASM_EXEC_TEST(StoreMem_offset_oob) {
                                    WASM_LOAD_MEM(machineTypes[m], WASM_ZERO)),
              WASM_ZERO});
 
-    byte memsize = machineTypes[m].MemSize();
+    uint8_t memsize = machineTypes[m].MemSize();
     uint32_t boundary = num_bytes - 8 - memsize;
     CHECK_EQ(0, r.Call(boundary));  // in bounds.
     CHECK_EQ(0, memcmp(&memory[0], &memory[8 + boundary], memsize));
@@ -1780,8 +1841,8 @@ WASM_EXEC_TEST(StoreMem_offset_oob) {
 }
 
 WASM_EXEC_TEST(Store_i32_narrowed) {
-  constexpr byte kOpcodes[] = {kExprI32StoreMem8, kExprI32StoreMem16,
-                               kExprI32StoreMem};
+  constexpr uint8_t kOpcodes[] = {kExprI32StoreMem8, kExprI32StoreMem16,
+                                  kExprI32StoreMem};
   int stored_size_in_bytes = 0;
   for (auto opcode : kOpcodes) {
     stored_size_in_bytes = std::max(1, stored_size_in_bytes * 2);
@@ -1828,7 +1889,7 @@ WASM_EXEC_TEST(MemI32_Sum) {
   WasmRunner<uint32_t, int32_t> r(execution_tier);
   uint32_t* memory =
       r.builder().AddMemoryElems<uint32_t>(kWasmPageSize / sizeof(int32_t));
-  const byte kSum = r.AllocateLocal(kWasmI32);
+  const uint8_t kSum = r.AllocateLocal(kWasmI32);
 
   r.Build(
       {WASM_WHILE(
@@ -1894,7 +1955,7 @@ WASM_EXEC_TEST(MemF32_Sum) {
   r.builder().WriteMemory(&buffer[2], -77.25f);
   r.builder().WriteMemory(&buffer[3], 66666.25f);
   r.builder().WriteMemory(&buffer[4], 5555.25f);
-  const byte kSum = r.AllocateLocal(kWasmF32);
+  const uint8_t kSum = r.AllocateLocal(kWasmF32);
 
   r.Build(
       {WASM_WHILE(WASM_LOCAL_GET(0),
@@ -1923,7 +1984,7 @@ T GenerateAndRunFold(TestExecutionTier execution_tier, WasmOpcode binop,
   for (uint32_t i = 0; i < size; ++i) {
     r.builder().WriteMemory(&memory[i], buffer[i]);
   }
-  const byte kAccum = r.AllocateLocal(astType);
+  const uint8_t kAccum = r.AllocateLocal(astType);
 
   r.Build(
       {WASM_LOCAL_SET(kAccum, WASM_LOAD_MEM(memType, WASM_ZERO)),
@@ -2068,24 +2129,22 @@ static void TestBuildGraphForSimpleExpression(WasmOpcode opcode) {
   const FunctionSig* sig = WasmOpcodes::Signature(opcode);
   WasmModule module;
   WasmFeatures enabled;
-  CompilationEnv env(&module, BoundsCheckStrategy::kExplicitBoundsChecks,
-                     RuntimeExceptionSupport::kRuntimeExceptionSupport, enabled,
-                     DynamicTiering::kDynamicTiering);
+  CompilationEnv env(&module, enabled, DynamicTiering::kDynamicTiering);
 
   if (sig->parameter_count() == 1) {
-    byte code[] = {WASM_NO_LOCALS, kExprLocalGet, 0, static_cast<byte>(opcode),
-                   WASM_END};
+    uint8_t code[] = {WASM_NO_LOCALS, kExprLocalGet, 0,
+                      static_cast<uint8_t>(opcode), WASM_END};
     TestBuildingGraph(&zone, &jsgraph, &env, sig, nullptr, code,
                       code + arraysize(code));
   } else {
     CHECK_EQ(2, sig->parameter_count());
-    byte code[] = {WASM_NO_LOCALS,
-                   kExprLocalGet,
-                   0,
-                   kExprLocalGet,
-                   1,
-                   static_cast<byte>(opcode),
-                   WASM_END};
+    uint8_t code[] = {WASM_NO_LOCALS,
+                      kExprLocalGet,
+                      0,
+                      kExprLocalGet,
+                      1,
+                      static_cast<uint8_t>(opcode),
+                      WASM_END};
     TestBuildingGraph(&zone, &jsgraph, &env, sig, nullptr, code,
                       code + arraysize(code));
   }
@@ -2117,7 +2176,7 @@ WASM_EXEC_TEST(Int32LoadInt8_signext) {
 WASM_EXEC_TEST(Int32LoadInt8_zeroext) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
   const int kNumElems = kWasmPageSize;
-  byte* memory = r.builder().AddMemory(kNumElems);
+  uint8_t* memory = r.builder().AddMemory(kNumElems);
   r.builder().RandomizeMemory(77);
   memory[0] = 255;
   r.Build({WASM_LOAD_MEM(MachineType::Uint8(), WASM_LOCAL_GET(0))});
@@ -2130,7 +2189,7 @@ WASM_EXEC_TEST(Int32LoadInt8_zeroext) {
 WASM_EXEC_TEST(Int32LoadInt16_signext) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
   const int kNumBytes = kWasmPageSize;
-  byte* memory = r.builder().AddMemory(kNumBytes);
+  uint8_t* memory = r.builder().AddMemory(kNumBytes);
   r.builder().RandomizeMemory(888);
   memory[1] = 200;
   r.Build({WASM_LOAD_MEM(MachineType::Int16(), WASM_LOCAL_GET(0))});
@@ -2144,7 +2203,7 @@ WASM_EXEC_TEST(Int32LoadInt16_signext) {
 WASM_EXEC_TEST(Int32LoadInt16_zeroext) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
   const int kNumBytes = kWasmPageSize;
-  byte* memory = r.builder().AddMemory(kNumBytes);
+  uint8_t* memory = r.builder().AddMemory(kNumBytes);
   r.builder().RandomizeMemory(9999);
   memory[1] = 204;
   r.Build({WASM_LOAD_MEM(MachineType::Uint16(), WASM_LOCAL_GET(0))});
@@ -2238,7 +2297,7 @@ WASM_EXEC_TEST(MixedGlobals) {
   WasmRunner<int32_t, int32_t> r(execution_tier);
 
   int32_t* unused = r.builder().AddGlobal<int32_t>();
-  byte* memory = r.builder().AddMemory(kWasmPageSize);
+  uint8_t* memory = r.builder().AddMemory(kWasmPageSize);
 
   int32_t* var_int32 = r.builder().AddGlobal<int32_t>();
   uint32_t* var_uint32 = r.builder().AddGlobal<uint32_t>();
@@ -2331,7 +2390,7 @@ WASM_EXEC_TEST(CallF64StackParameter) {
 WASM_EXEC_TEST(CallVoid) {
   WasmRunner<int32_t> r(execution_tier);
 
-  const byte kMemOffset = 8;
+  const uint8_t kMemOffset = 8;
   const int32_t kElemNum = kMemOffset / sizeof(int32_t);
   const int32_t kExpected = 414444;
   // Build the target function.
@@ -2493,7 +2552,6 @@ UNINITIALIZED_WASM_EXEC_TEST(ReturnCall_Factorial) {
   LocalContext current(isolate_scope.isolate());
 
   WasmRunner<uint32_t, uint32_t> r(execution_tier, kWasmOrigin, nullptr, "main",
-                                   kRuntimeExceptionSupport, kMemory32,
                                    isolate_scope.i_isolate());
 
   WasmFunctionCompiler& fact_aux_fn =
@@ -2530,7 +2588,6 @@ UNINITIALIZED_WASM_EXEC_TEST(ReturnCall_MutualFactorial) {
   LocalContext current(isolate_scope.isolate());
 
   WasmRunner<uint32_t, uint32_t> r(execution_tier, kWasmOrigin, nullptr, "main",
-                                   kRuntimeExceptionSupport, kMemory32,
                                    isolate_scope.i_isolate());
 
   WasmFunctionCompiler& f_fn = r.NewFunction<uint32_t, uint32_t, uint32_t>("f");
@@ -2574,7 +2631,6 @@ UNINITIALIZED_WASM_EXEC_TEST(ReturnCall_IndirectFactorial) {
   LocalContext current(isolate_scope.isolate());
 
   WasmRunner<uint32_t, uint32_t> r(execution_tier, kWasmOrigin, nullptr, "main",
-                                   kRuntimeExceptionSupport, kMemory32,
                                    isolate_scope.i_isolate());
 
   TestSignatures sigs;
@@ -2622,7 +2678,6 @@ UNINITIALIZED_WASM_EXEC_TEST(ReturnCall_Sum) {
   LocalContext current(isolate_scope.isolate());
 
   WasmRunner<int32_t, int32_t> r(execution_tier, kWasmOrigin, nullptr, "main",
-                                 kRuntimeExceptionSupport, kMemory32,
                                  isolate_scope.i_isolate());
   TestSignatures sigs;
 
@@ -2663,7 +2718,6 @@ UNINITIALIZED_WASM_EXEC_TEST(ReturnCall_Bounce_Sum) {
   LocalContext current(isolate_scope.isolate());
 
   WasmRunner<int32_t, int32_t> r(execution_tier, kWasmOrigin, nullptr, "main",
-                                 kRuntimeExceptionSupport, kMemory32,
                                  isolate_scope.i_isolate());
   TestSignatures sigs;
 
@@ -2737,7 +2791,7 @@ static void Run_WasmMixedCall_N(TestExecutionTier execution_tier, int start) {
     // =========================================================================
     // Build the calling function.
     // =========================================================================
-    std::vector<byte> code;
+    std::vector<uint8_t> code;
 
     // Load the arguments.
     for (int i = 0; i < num_params; ++i) {
@@ -2749,7 +2803,7 @@ static void Run_WasmMixedCall_N(TestExecutionTier execution_tier, int start) {
     ADD_CODE(code, WASM_CALL_FUNCTION0(f.function_index()));
 
     // Store the result in a local.
-    byte local_index = r.AllocateLocal(ValueType::For(result));
+    uint8_t local_index = r.AllocateLocal(ValueType::For(result));
     ADD_CODE(code, kExprLocalSet, local_index);
 
     // Store the result in memory.
@@ -2769,8 +2823,8 @@ static void Run_WasmMixedCall_N(TestExecutionTier execution_tier, int start) {
       int size = result.MemSize();
       for (int i = 0; i < size; ++i) {
         int base = (which + 1) * kElemSize;
-        byte expected = r.builder().raw_mem_at<byte>(base + i);
-        byte actual = r.builder().raw_mem_at<byte>(i);
+        uint8_t expected = r.builder().raw_mem_at<uint8_t>(base + i);
+        uint8_t actual = r.builder().raw_mem_at<uint8_t>(i);
         CHECK_EQ(expected, actual);
       }
     }
@@ -2787,7 +2841,7 @@ WASM_EXEC_TEST(AddCall) {
   WasmFunctionCompiler& t1 = r.NewFunction<int32_t, int32_t, int32_t>();
   t1.Build({WASM_I32_ADD(WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))});
 
-  byte local = r.AllocateLocal(kWasmI32);
+  uint8_t local = r.AllocateLocal(kWasmI32);
   r.Build({WASM_LOCAL_SET(local, WASM_I32V_2(99)),
            WASM_I32_ADD(
                WASM_CALL_FUNCTION(t1.function_index(), WASM_LOCAL_GET(0),
@@ -3437,7 +3491,7 @@ static void CompileCallIndirectMany(TestExecutionTier tier, ValueType param) {
   // Make sure we don't run out of registers when compiling indirect calls
   // with many many parameters.
   TestSignatures sigs;
-  for (byte num_params = 0; num_params < 40; ++num_params) {
+  for (uint8_t num_params = 0; num_params < 40; ++num_params) {
     WasmRunner<void> r(tier);
     FunctionSig* sig = sigs.many(r.zone(), kWasmVoid, param, num_params);
 
@@ -3447,8 +3501,8 @@ static void CompileCallIndirectMany(TestExecutionTier tier, ValueType param) {
 
     WasmFunctionCompiler& t = r.NewFunction(sig);
 
-    std::vector<byte> code;
-    for (byte p = 0; p < num_params; ++p) {
+    std::vector<uint8_t> code;
+    for (uint8_t p = 0; p < num_params; ++p) {
       ADD_CODE(code, kExprLocalGet, p);
     }
     ADD_CODE(code, kExprI32Const, 0);
@@ -3605,7 +3659,7 @@ WASM_EXEC_TEST(IfInsideUnreachable) {
 WASM_EXEC_TEST(IndirectNull) {
   WasmRunner<int32_t> r(execution_tier);
   FunctionSig sig(1, 0, &kWasmI32);
-  byte sig_index = r.builder().AddSignature(&sig);
+  uint8_t sig_index = r.builder().AddSignature(&sig);
   r.builder().AddIndirectFunctionTable(nullptr, 1);
 
   r.Build({WASM_CALL_INDIRECT(sig_index, WASM_I32V(0))});
@@ -3616,7 +3670,7 @@ WASM_EXEC_TEST(IndirectNull) {
 WASM_EXEC_TEST(IndirectNullTyped) {
   WasmRunner<int32_t> r(execution_tier);
   FunctionSig sig(1, 0, &kWasmI32);
-  byte sig_index = r.builder().AddSignature(&sig);
+  uint8_t sig_index = r.builder().AddSignature(&sig);
   r.builder().AddIndirectFunctionTable(nullptr, 1,
                                        ValueType::RefNull(sig_index));
 
@@ -3638,7 +3692,7 @@ void BinOpOnDifferentRegisters(
   static constexpr int kMaxNumLocals = 8;
   for (int num_locals = 1; num_locals < kMaxNumLocals; ++num_locals) {
     // {init_locals_code} is shared by all code generated in the loop below.
-    std::vector<byte> init_locals_code;
+    std::vector<uint8_t> init_locals_code;
     // Load from memory into the locals.
     for (int i = 0; i < num_locals; ++i) {
       ADD_CODE(
@@ -3647,7 +3701,7 @@ void BinOpOnDifferentRegisters(
                                           WASM_I32V_2(sizeof(ctype) * i))));
     }
     // {write_locals_code} is shared by all code generated in the loop below.
-    std::vector<byte> write_locals_code;
+    std::vector<uint8_t> write_locals_code;
     // Write locals back into memory, shifted by one element to the right.
     for (int i = 0; i < num_locals; ++i) {
       ADD_CODE(write_locals_code,
@@ -3663,7 +3717,7 @@ void BinOpOnDifferentRegisters(
         for (int i = 0; i < num_locals; ++i) {
           r.AllocateLocal(type);
         }
-        std::vector<byte> code(init_locals_code);
+        std::vector<uint8_t> code(init_locals_code);
         ADD_CODE(code,
                  // Store the result of the binary operation at memory[0].
                  WASM_STORE_MEM(type.machine_type(), WASM_ZERO,
@@ -3874,34 +3928,9 @@ WASM_EXEC_TEST(I64RemUOnDifferentRegisters) {
       });
 }
 
-TEST(Regression_1085507) {
-  WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-  TestSignatures sigs;
-  uint32_t sig_v_i = r.builder().AddSignature(sigs.v_i());
-  r.Build({WASM_I32V_1(0), kExprIf, kVoidCode, WASM_UNREACHABLE,
-           WASM_BLOCK_X(sig_v_i, kExprDrop), kExprElse, kExprEnd,
-           WASM_I32V_1(0)});
-}
-
-TEST(Regression_1185323_1185492) {
-  WasmRunner<int32_t> r(TestExecutionTier::kInterpreter);
-  r.builder().AddIndirectFunctionTable(nullptr, 1);
-  r.Build({WASM_I32V_1(0),
-           // Use a long leb128 encoding of kExprTableSize instruction.
-           // This exercises a bug in the interpreter which tries to read the
-           // immediate at pc+2 (it should be pc+4).
-           kNumericPrefix, 0x90, 0x80, 0x00, 0x00,  // table.size 0.
-           WASM_UNREACHABLE, kExprTableSet,
-           0x00});  // Hits a DCHECK if reached.
-  r.Call();
-}
-
 #undef B1
 #undef B2
 #undef RET
 #undef RET_I8
 
-}  // namespace test_run_wasm
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
diff --git a/deps/v8/test/cctest/wasm/test-streaming-compilation.cc b/deps/v8/test/cctest/wasm/test-streaming-compilation.cc
index 84bc7cea2e2875..c3382e8a9be0f4 100644
--- a/deps/v8/test/cctest/wasm/test-streaming-compilation.cc
+++ b/deps/v8/test/cctest/wasm/test-streaming-compilation.cc
@@ -337,7 +337,7 @@ ZoneBuffer GetValidCompiledModuleBytes(v8::Isolate* isolate, Zone* zone,
                           ReadOnlyRoots{i_isolate}.undefined_value_handle(), 0,
                           nullptr)
               .ToHandleChecked();
-      CHECK(return_value->IsSmi());
+      CHECK(IsSmi(*return_value));
       CHECK_EQ(0, Smi::cast(*return_value).value());
     }
     tester.RunCompilerTasks();
@@ -346,7 +346,7 @@ ZoneBuffer GetValidCompiledModuleBytes(v8::Isolate* isolate, Zone* zone,
   // Serialize the NativeModule.
   i::wasm::WasmSerializer serializer(native_module);
   size_t size = serializer.GetSerializedNativeModuleSize();
-  std::vector<byte> buffer(size);
+  std::vector<uint8_t> buffer(size);
   CHECK(serializer.SerializeNativeModule(base::VectorOf(buffer)));
   ZoneBuffer result(zone, size);
   result.write(buffer.data(), size);
@@ -1345,7 +1345,7 @@ STREAM_TEST(TestDeserializationFails) {
   ZoneBuffer module_bytes =
       GetValidCompiledModuleBytes(isolate, tester.zone(), wire_bytes);
   // corrupt header
-  byte first_byte = *module_bytes.begin();
+  uint8_t first_byte = *module_bytes.begin();
   module_bytes.patch_u8(0, first_byte + 1);
   tester.SetCompiledModuleBytes(base::VectorOf(module_bytes));
   tester.OnBytesReceived(wire_bytes.begin(), wire_bytes.size());
diff --git a/deps/v8/test/cctest/wasm/test-wasm-breakpoints.cc b/deps/v8/test/cctest/wasm/test-wasm-breakpoints.cc
index a070dab4e4bc18..41d4d793c5a3fe 100644
--- a/deps/v8/test/cctest/wasm/test-wasm-breakpoints.cc
+++ b/deps/v8/test/cctest/wasm/test-wasm-breakpoints.cc
@@ -146,7 +146,7 @@ Handle<BreakPoint> SetBreakpoint(WasmRunnerBase* runner, int function_index,
   int code_offset = func_offset + byte_offset;
   if (expected_set_byte_offset == -1) expected_set_byte_offset = byte_offset;
   Handle<WasmInstanceObject> instance = runner->builder().instance_object();
-  Handle<Script> script(instance->module_object().script(),
+  Handle<Script> script(instance->module_object()->script(),
                         runner->main_isolate());
   static int break_index = 0;
   Handle<BreakPoint> break_point =
@@ -162,7 +162,7 @@ void ClearBreakpoint(WasmRunnerBase* runner, int function_index,
       runner->builder().GetFunctionAt(function_index)->code.offset();
   int code_offset = func_offset + byte_offset;
   Handle<WasmInstanceObject> instance = runner->builder().instance_object();
-  Handle<Script> script(instance->module_object().script(),
+  Handle<Script> script(instance->module_object()->script(),
                         runner->main_isolate());
   CHECK(WasmScript::ClearBreakPoint(script, code_offset, break_point));
 }
@@ -275,7 +275,7 @@ std::vector<WasmValue> wasmVec(Args... args) {
 int GetIntReturnValue(MaybeHandle<Object> retval) {
   CHECK(!retval.is_null());
   int result;
-  CHECK(retval.ToHandleChecked()->ToInt32(&result));
+  CHECK(Object::ToInt32(*retval.ToHandleChecked(), &result));
   return result;
 }
 
@@ -286,8 +286,8 @@ WASM_COMPILED_EXEC_TEST(WasmCollectPossibleBreakpoints) {
 
   runner.Build({WASM_NOP, WASM_I32_ADD(WASM_ZERO, WASM_ONE)});
 
-  WasmInstanceObject instance = *runner.builder().instance_object();
-  NativeModule* native_module = instance.module_object().native_module();
+  Tagged<WasmInstanceObject> instance = *runner.builder().instance_object();
+  NativeModule* native_module = instance->module_object()->native_module();
 
   std::vector<debug::Location> locations;
   // Check all locations for function 0.
@@ -320,7 +320,7 @@ WASM_COMPILED_EXEC_TEST(WasmSimpleBreak) {
 
   BreakHandler count_breaks(isolate, {{4, BreakHandler::Continue}});
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> retval =
       Execution::Call(isolate, main_fun_wrapper, global, 0, nullptr);
   CHECK_EQ(14, GetIntReturnValue(retval));
@@ -338,7 +338,7 @@ WASM_COMPILED_EXEC_TEST(WasmNonBreakablePosition) {
 
   BreakHandler count_breaks(isolate, {{4, BreakHandler::Continue}});
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> retval =
       Execution::Call(isolate, main_fun_wrapper, global, 0, nullptr);
   CHECK_EQ(1024, GetIntReturnValue(retval));
@@ -362,7 +362,7 @@ WASM_COMPILED_EXEC_TEST(WasmSimpleStepping) {
                                 {5, BreakHandler::Continue}   // I32Add
                             });
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> retval =
       Execution::Call(isolate, main_fun_wrapper, global, 0, nullptr);
   CHECK_EQ(14, GetIntReturnValue(retval));
@@ -403,7 +403,7 @@ WASM_COMPILED_EXEC_TEST(WasmStepInAndOut) {
                                 {23, BreakHandler::Continue}   // After Call
                             });
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   CHECK(!Execution::Call(isolate, main_fun_wrapper, global, 0, nullptr)
              .is_null());
 }
@@ -448,7 +448,7 @@ WASM_COMPILED_EXEC_TEST(WasmGetLocalsAndStack) {
           {wasmVec(7, 17L, 7.f, 8.5), wasmVec()},        // 10: end
       });
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   Handle<Object> args[]{handle(Smi::FromInt(7), isolate)};
   CHECK(!Execution::Call(isolate, main_fun_wrapper, global, 1, args).is_null());
 }
@@ -478,7 +478,7 @@ WASM_COMPILED_EXEC_TEST(WasmRemoveBreakPoint) {
                                        }},
                                       {4, BreakHandler::Continue}});
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> retval =
       Execution::Call(isolate, main_fun_wrapper, global, 0, nullptr);
   CHECK_EQ(14, GetIntReturnValue(retval));
@@ -506,7 +506,7 @@ WASM_COMPILED_EXEC_TEST(WasmRemoveLastBreakPoint) {
                                    to_delete);
                  }}});
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> retval =
       Execution::Call(isolate, main_fun_wrapper, global, 0, nullptr);
   CHECK_EQ(14, GetIntReturnValue(retval));
@@ -536,7 +536,7 @@ WASM_COMPILED_EXEC_TEST(WasmRemoveAllBreakPoint) {
                    ClearBreakpoint(&runner, runner.function_index(), 2, bp2);
                  }}});
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> retval =
       Execution::Call(isolate, main_fun_wrapper, global, 0, nullptr);
   CHECK_EQ(14, GetIntReturnValue(retval));
@@ -568,7 +568,7 @@ WASM_COMPILED_EXEC_TEST(WasmBreakInPostMVP) {
 
   BreakHandler count_breaks(isolate, {{3, BreakHandler::Continue}});
 
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> retval =
       Execution::Call(isolate, main_fun_wrapper, global, 0, nullptr);
   CHECK_EQ(kReturn, GetIntReturnValue(retval));
diff --git a/deps/v8/test/cctest/wasm/test-wasm-codegen.cc b/deps/v8/test/cctest/wasm/test-wasm-codegen.cc
index 1efeae5b8500e1..6151abc5ad2261 100644
--- a/deps/v8/test/cctest/wasm/test-wasm-codegen.cc
+++ b/deps/v8/test/cctest/wasm/test-wasm-codegen.cc
@@ -12,8 +12,8 @@
 #include "src/wasm/wasm-module-builder.h"
 #include "src/wasm/wasm-objects-inl.h"
 #include "src/wasm/wasm-objects.h"
-
 #include "test/cctest/cctest.h"
+#include "test/cctest/heap/heap-utils.h"
 #include "test/common/wasm/wasm-module-runner.h"
 
 namespace v8 {
@@ -61,8 +61,7 @@ void BuildTrivialModule(Zone* zone, ZoneBuffer* buffer) {
 bool TestModule(Isolate* isolate, v8::MemorySpan<const uint8_t> wire_bytes) {
   HandleScope scope(isolate);
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(isolate);
-  v8::Local<v8::Context> context =
-      Utils::ToLocal(Handle<Context>::cast(isolate->native_context()));
+  v8::Local<v8::Context> context = Utils::ToLocal(isolate->native_context());
 
   // Get the "WebAssembly.Module" function.
   auto get_property = [context, v8_isolate](
@@ -113,7 +112,7 @@ TEST(PropertiesOfCodegenCallbacks) {
       bool found = TestModule(isolate, wire_bytes);
       bool expected = ExpectedResults[codegen][wasm_codegen];
       CHECK_EQ(expected, found);
-      CcTest::CollectAllAvailableGarbage();
+      heap::InvokeMemoryReducingMajorGCs(isolate->heap());
     }
   }
 }
diff --git a/deps/v8/test/cctest/wasm/test-wasm-metrics.cc b/deps/v8/test/cctest/wasm/test-wasm-metrics.cc
index 397d37089ac504..2e6e423808c172 100644
--- a/deps/v8/test/cctest/wasm/test-wasm-metrics.cc
+++ b/deps/v8/test/cctest/wasm/test-wasm-metrics.cc
@@ -278,7 +278,7 @@ COMPILE_TEST(TestEventMetrics) {
   WasmModuleBuilder* builder = zone.New<WasmModuleBuilder>(&zone);
   WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
   f->builder()->AddExport(base::CStrVector("main"), f);
-  byte code[] = {WASM_I32V_2(0)};
+  uint8_t code[] = {WASM_I32V_2(0)};
   f->EmitCode(code, sizeof(code));
   f->Emit(kExprEnd);
   ZoneBuffer buffer(&zone);
diff --git a/deps/v8/test/cctest/wasm/test-wasm-serialization.cc b/deps/v8/test/cctest/wasm/test-wasm-serialization.cc
index b23bf65e5aea24..786025e7287abf 100644
--- a/deps/v8/test/cctest/wasm/test-wasm-serialization.cc
+++ b/deps/v8/test/cctest/wasm/test-wasm-serialization.cc
@@ -18,6 +18,7 @@
 #include "src/wasm/wasm-opcodes.h"
 #include "src/wasm/wasm-serialization.h"
 #include "test/cctest/cctest.h"
+#include "test/cctest/heap/heap-utils.h"
 #include "test/common/wasm/flag-utils.h"
 #include "test/common/wasm/test-signatures.h"
 #include "test/common/wasm/wasm-macro-gen.h"
@@ -43,8 +44,8 @@ class WasmSerializationTest {
     WasmFunctionBuilder* f;
     for (int i = 0; i < 3; ++i) {
       f = builder->AddFunction(sigs.i_i());
-      byte code[] = {WASM_LOCAL_GET(0), kExprI32Const, 1, kExprI32Add,
-                     kExprEnd};
+      uint8_t code[] = {WASM_LOCAL_GET(0), kExprI32Const, 1, kExprI32Add,
+                        kExprEnd};
       f->EmitCode(code, sizeof(code));
     }
     builder->AddExport(base::CStrVector(kFunctionName), f);
@@ -83,7 +84,7 @@ class WasmSerializationTest {
     CHECK(Deserialize().ToHandle(&module_object));
     {
       DisallowGarbageCollection assume_no_gc;
-      base::Vector<const byte> deserialized_module_wire_bytes =
+      base::Vector<const uint8_t> deserialized_module_wire_bytes =
           module_object->native_module()->wire_bytes();
       CHECK_EQ(deserialized_module_wire_bytes.size(), wire_bytes_.size());
       CHECK_EQ(memcmp(deserialized_module_wire_bytes.begin(),
@@ -106,7 +107,7 @@ class WasmSerializationTest {
   void CollectGarbage() {
     // Try hard to collect all garbage and will therefore also invoke all weak
     // callbacks of actually unreachable persistent handles.
-    CcTest::CollectAllAvailableGarbage();
+    heap::InvokeMemoryReducingMajorGCs(CcTest::heap());
   }
 
   v8::MemorySpan<const uint8_t> wire_bytes() const { return wire_bytes_; }
@@ -158,7 +159,8 @@ class WasmSerializationTest {
           v8_module_object->GetCompiledModule();
       v8::MemorySpan<const uint8_t> uncompiled_bytes =
           compiled_module.GetWireBytesRef();
-      uint8_t* bytes_copy = zone()->NewArray<uint8_t>(uncompiled_bytes.size());
+      uint8_t* bytes_copy =
+          zone()->AllocateArray<uint8_t>(uncompiled_bytes.size());
       memcpy(bytes_copy, uncompiled_bytes.data(), uncompiled_bytes.size());
       wire_bytes_ = {bytes_copy, uncompiled_bytes.size()};
 
@@ -200,6 +202,7 @@ class WasmSerializationTest {
   v8::OwnedBuffer data_;
   v8::MemorySpan<const uint8_t> wire_bytes_ = {nullptr, 0};
   v8::MemorySpan<const uint8_t> serialized_bytes_ = {nullptr, 0};
+  FlagScope<int> tier_up_quickly_{&v8_flags.wasm_tiering_budget, 1000};
 };
 
 TEST(DeserializeValidModule) {
@@ -218,8 +221,8 @@ TEST(DeserializeWithSourceUrl) {
     const std::string url = "http://example.com/example.wasm";
     Handle<WasmModuleObject> module_object;
     CHECK(test.Deserialize(base::VectorOf(url)).ToHandle(&module_object));
-    String url_str = String::cast(module_object->script().name());
-    CHECK_EQ(url, url_str.ToCString().get());
+    Tagged<String> url_str = String::cast(module_object->script()->name());
+    CHECK_EQ(url, url_str->ToCString().get());
   }
   test.CollectGarbage();
 }
@@ -405,6 +408,9 @@ TEST(SerializeTieringBudget) {
     // the module gets deserialized and not just loaded from the module cache.
     native_module->tiering_budget_array()[0]++;
   }
+  // We need to invoke GC without stack, otherwise some objects may survive.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+      isolate->heap());
   test.CollectGarbage();
   HandleScope scope(isolate);
   Handle<WasmModuleObject> module_object;
diff --git a/deps/v8/test/cctest/wasm/test-wasm-shared-engine.cc b/deps/v8/test/cctest/wasm/test-wasm-shared-engine.cc
index d02c8ff6add012..bdf4b0f978d7a9 100644
--- a/deps/v8/test/cctest/wasm/test-wasm-shared-engine.cc
+++ b/deps/v8/test/cctest/wasm/test-wasm-shared-engine.cc
@@ -69,7 +69,7 @@ class SharedEngineIsolate {
   }
 
   SharedModule ExportInstance(Handle<WasmInstanceObject> instance) {
-    return instance->module_object().shared_native_module();
+    return instance->module_object()->shared_native_module();
   }
 
   int32_t Run(Handle<WasmInstanceObject> instance) {
@@ -106,7 +106,7 @@ ZoneBuffer* BuildReturnConstantModule(Zone* zone, int constant) {
   WasmModuleBuilder* builder = zone->New<WasmModuleBuilder>(zone);
   WasmFunctionBuilder* f = builder->AddFunction(sigs.i_v());
   f->builder()->AddExport(base::CStrVector("main"), f);
-  byte code[] = {WASM_I32V_2(constant)};
+  uint8_t code[] = {WASM_I32V_2(constant)};
   f->EmitCode(code, sizeof(code));
   f->Emit(kExprEnd);
   builder->WriteTo(buffer);
@@ -164,7 +164,7 @@ Handle<WasmInstanceObject> CompileAndInstantiateAsync(
       isolate->isolate(), enabled_features,
       std::make_unique<MockCompilationResolver>(isolate, &maybe_instance),
       ModuleWireBytes(buffer->begin(), buffer->end()), true, kAPIMethodName);
-  while (!maybe_instance->IsWasmInstanceObject()) PumpMessageLoop(isolate);
+  while (!IsWasmInstanceObject(*maybe_instance)) PumpMessageLoop(isolate);
   Handle<WasmInstanceObject> instance =
       Handle<WasmInstanceObject>::cast(maybe_instance);
   return instance;
diff --git a/deps/v8/test/cctest/wasm/test-wasm-stack.cc b/deps/v8/test/cctest/wasm/test-wasm-stack.cc
index 5ca87163256b07..8f317aa648a026 100644
--- a/deps/v8/test/cctest/wasm/test-wasm-stack.cc
+++ b/deps/v8/test/cctest/wasm/test-wasm-stack.cc
@@ -57,7 +57,7 @@ template <int N>
 void CheckExceptionInfos(v8::internal::Isolate* i_isolate, Handle<Object> exc,
                          const ExceptionInfo (&excInfos)[N]) {
   // Check that it's indeed an Error object.
-  CHECK(exc->IsJSError());
+  CHECK(IsJSError(*exc));
 
   v8::Isolate* v8_isolate = reinterpret_cast<v8::Isolate*>(i_isolate);
 
@@ -94,6 +94,7 @@ void CheckComputeLocation(v8::internal::Isolate* i_isolate, Handle<Object> exc,
   CHECK(i_isolate->ComputeLocationFromSimpleStackTrace(&loc, exc));
   printf("loc start: %d, end: %d\n", loc.start_pos(), loc.end_pos());
   Handle<JSMessageObject> message = i_isolate->CreateMessage(exc, nullptr);
+  JSMessageObject::EnsureSourcePositionsAvailable(i_isolate, message);
   printf("msg start: %d, end: %d, line: %d, col: %d\n",
          message->GetStartPosition(), message->GetEndPosition(),
          message->GetLineNumber(), message->GetColumnNumber());
@@ -106,12 +107,12 @@ void CheckComputeLocation(v8::internal::Isolate* i_isolate, Handle<Object> exc,
   //               whether Script::PositionInfo.column should be the offset
   //               relative to the module or relative to the function.
   // CHECK_EQ(topLocation.column - 1, message->GetColumnNumber());
-  String scriptSource = message->GetSource();
-  CHECK(scriptSource.IsString());
+  Tagged<String> scriptSource = message->GetSource();
+  CHECK(IsString(scriptSource));
   if (stackFrame->IsWasm()) {
-    CHECK_EQ(scriptSource.length(), 0);
+    CHECK_EQ(scriptSource->length(), 0);
   } else {
-    CHECK_GT(scriptSource.length(), 0);
+    CHECK_GT(scriptSource->length(), 0);
   }
 }
 
@@ -149,7 +150,7 @@ WASM_COMPILED_EXEC_TEST(CollectDetailedWasmStack_ExplicitThrowFromJs) {
   Isolate* isolate = js_wasm_wrapper->GetIsolate();
   isolate->SetCaptureStackTraceForUncaughtExceptions(true, 10,
                                                      v8::StackTrace::kOverview);
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> maybe_exc;
   Handle<Object> args[] = {js_wasm_wrapper};
   MaybeHandle<Object> returnObjMaybe =
@@ -171,10 +172,9 @@ WASM_COMPILED_EXEC_TEST(CollectDetailedWasmStack_ExplicitThrowFromJs) {
 // Trigger a trap in wasm, stack should contain a source url.
 WASM_COMPILED_EXEC_TEST(CollectDetailedWasmStack_WasmUrl) {
   // Create a WasmRunner with stack checks and traps enabled.
-  WasmRunner<int> r(execution_tier, kWasmOrigin, nullptr, "main",
-                    kRuntimeExceptionSupport);
+  WasmRunner<int> r(execution_tier, kWasmOrigin, nullptr, "main");
 
-  std::vector<byte> trap_code(1, kExprUnreachable);
+  std::vector<uint8_t> trap_code(1, kExprUnreachable);
   r.Build(trap_code.data(), trap_code.data() + trap_code.size());
 
   WasmFunctionCompiler& f = r.NewFunction<int>("call_main");
@@ -195,11 +195,11 @@ WASM_COMPILED_EXEC_TEST(CollectDetailedWasmStack_WasmUrl) {
   const char* url = "http://example.com/example.wasm";
   const Handle<String> source_url =
       isolate->factory()->InternalizeUtf8String(url);
-  r.builder().instance_object()->module_object().script().set_source_url(
+  r.builder().instance_object()->module_object()->script()->set_source_url(
       *source_url);
 
   // Run the js wrapper.
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> maybe_exc;
   Handle<Object> args[] = {js_wasm_wrapper};
   MaybeHandle<Object> maybe_return_obj =
@@ -233,10 +233,9 @@ WASM_COMPILED_EXEC_TEST(CollectDetailedWasmStack_WasmError) {
     int unreachable_pos = 1 << (8 * pos_shift);
     TestSignatures sigs;
     // Create a WasmRunner with stack checks and traps enabled.
-    WasmRunner<int> r(execution_tier, kWasmOrigin, nullptr, "main",
-                      kRuntimeExceptionSupport);
+    WasmRunner<int> r(execution_tier, kWasmOrigin, nullptr, "main");
 
-    std::vector<byte> trap_code(unreachable_pos + 1, kExprNop);
+    std::vector<uint8_t> trap_code(unreachable_pos + 1, kExprNop);
     trap_code[unreachable_pos] = kExprUnreachable;
     r.Build(trap_code.data(), trap_code.data() + trap_code.size());
 
@@ -255,7 +254,7 @@ WASM_COMPILED_EXEC_TEST(CollectDetailedWasmStack_WasmError) {
     Isolate* isolate = js_wasm_wrapper->GetIsolate();
     isolate->SetCaptureStackTraceForUncaughtExceptions(
         true, 10, v8::StackTrace::kOverview);
-    Handle<Object> global(isolate->context().global_object(), isolate);
+    Handle<Object> global(isolate->context()->global_object(), isolate);
     MaybeHandle<Object> maybe_exc;
     Handle<Object> args[] = {js_wasm_wrapper};
     MaybeHandle<Object> maybe_return_obj =
diff --git a/deps/v8/test/cctest/wasm/test-wasm-trap-position.cc b/deps/v8/test/cctest/wasm/test-wasm-trap-position.cc
index 826ad92875f76e..7de643a230d311 100644
--- a/deps/v8/test/cctest/wasm/test-wasm-trap-position.cc
+++ b/deps/v8/test/cctest/wasm/test-wasm-trap-position.cc
@@ -44,9 +44,9 @@ template <int N>
 void CheckExceptionInfos(v8::internal::Isolate* isolate, Handle<Object> exc,
                          const ExceptionInfo (&excInfos)[N]) {
   // Check that it's indeed an Error object.
-  CHECK(exc->IsJSError());
+  CHECK(IsJSError(*exc));
 
-  exc->Print();
+  Print(*exc);
   // Extract stack frame from the exception.
   auto stack = isolate->GetSimpleStackTrace(Handle<JSObject>::cast(exc));
   CHECK_EQ(N, stack->length());
@@ -68,8 +68,7 @@ void CheckExceptionInfos(v8::internal::Isolate* isolate, Handle<Object> exc,
 // Trigger a trap for executing unreachable.
 WASM_COMPILED_EXEC_TEST(Unreachable) {
   // Create a WasmRunner with stack checks and traps enabled.
-  WasmRunner<void> r(execution_tier, kWasmOrigin, nullptr, "main",
-                     kRuntimeExceptionSupport);
+  WasmRunner<void> r(execution_tier, kWasmOrigin, nullptr, "main");
   TestSignatures sigs;
 
   r.Build({WASM_UNREACHABLE});
@@ -84,7 +83,7 @@ WASM_COMPILED_EXEC_TEST(Unreachable) {
   Isolate* isolate = js_wasm_wrapper->GetIsolate();
   isolate->SetCaptureStackTraceForUncaughtExceptions(true, 10,
                                                      v8::StackTrace::kOverview);
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> maybe_exc;
   Handle<Object> args[] = {js_wasm_wrapper};
   MaybeHandle<Object> returnObjMaybe =
@@ -102,8 +101,7 @@ WASM_COMPILED_EXEC_TEST(Unreachable) {
 
 // Trigger a trap for loading from out-of-bounds.
 WASM_COMPILED_EXEC_TEST(IllegalLoad) {
-  WasmRunner<void> r(execution_tier, kWasmOrigin, nullptr, "main",
-                     kRuntimeExceptionSupport);
+  WasmRunner<void> r(execution_tier, kWasmOrigin, nullptr, "main");
   TestSignatures sigs;
 
   r.builder().AddMemory(0L);
@@ -127,7 +125,7 @@ WASM_COMPILED_EXEC_TEST(IllegalLoad) {
   Isolate* isolate = js_wasm_wrapper->GetIsolate();
   isolate->SetCaptureStackTraceForUncaughtExceptions(true, 10,
                                                      v8::StackTrace::kOverview);
-  Handle<Object> global(isolate->context().global_object(), isolate);
+  Handle<Object> global(isolate->context()->global_object(), isolate);
   MaybeHandle<Object> maybe_exc;
   Handle<Object> args[] = {js_wasm_wrapper};
   MaybeHandle<Object> returnObjMaybe =
diff --git a/deps/v8/test/cctest/wasm/wasm-run-utils.cc b/deps/v8/test/cctest/wasm/wasm-run-utils.cc
index ee0f88ab82690e..472e4b3f6eab3a 100644
--- a/deps/v8/test/cctest/wasm/wasm-run-utils.cc
+++ b/deps/v8/test/cctest/wasm/wasm-run-utils.cc
@@ -46,19 +46,16 @@ bool IsSameNan(double expected, double actual) {
 
 TestingModuleBuilder::TestingModuleBuilder(
     Zone* zone, ModuleOrigin origin, ManuallyImportedJSFunction* maybe_import,
-    TestExecutionTier tier, RuntimeExceptionSupport exception_support,
-    TestingModuleMemoryType mem_type, Isolate* isolate)
+    TestExecutionTier tier, Isolate* isolate)
     : test_module_(std::make_shared<WasmModule>(origin)),
       isolate_(isolate ? isolate : CcTest::InitIsolateOnce()),
       enabled_features_(WasmFeatures::FromIsolate(isolate_)),
-      execution_tier_(tier),
-      runtime_exception_support_(exception_support) {
+      execution_tier_(tier) {
   WasmJs::Install(isolate_, true);
-  test_module_->is_memory64 = mem_type == kMemory64;
   test_module_->untagged_globals_buffer_size = kMaxGlobalsSize;
   // The GlobalsData must be located inside the sandbox, so allocate it from the
   // ArrayBuffer allocator.
-  globals_data_ = reinterpret_cast<byte*>(
+  globals_data_ = reinterpret_cast<uint8_t*>(
       CcTest::array_buffer_allocator()->Allocate(kMaxGlobalsSize));
 
   uint32_t maybe_import_index = 0;
@@ -75,36 +72,29 @@ TestingModuleBuilder::TestingModuleBuilder(
   instance_object_->set_tables(*tables);
 
   if (maybe_import) {
+    const wasm::FunctionSig* sig = maybe_import->sig;
     // Manually compile an import wrapper and insert it into the instance.
     uint32_t canonical_type_index =
-        GetTypeCanonicalizer()->AddRecursiveGroup(maybe_import->sig);
-    WasmImportData resolved(maybe_import->js_function, maybe_import->sig,
+        GetTypeCanonicalizer()->AddRecursiveGroup(sig);
+    WasmImportData resolved({}, -1, maybe_import->js_function, sig,
                             canonical_type_index);
     ImportCallKind kind = resolved.kind();
     Handle<JSReceiver> callable = resolved.callable();
     WasmImportWrapperCache::ModificationScope cache_scope(
         native_module_->import_wrapper_cache());
     WasmImportWrapperCache::CacheKey key(
-        kind, canonical_type_index,
-        static_cast<int>(maybe_import->sig->parameter_count()), kNoSuspend);
+        kind, canonical_type_index, static_cast<int>(sig->parameter_count()),
+        kNoSuspend);
     auto import_wrapper = cache_scope[key];
     if (import_wrapper == nullptr) {
-      CodeSpaceWriteScope write_scope(native_module_);
       import_wrapper = CompileImportWrapper(
-          native_module_, isolate_->counters(), kind, maybe_import->sig,
-          canonical_type_index,
-          static_cast<int>(maybe_import->sig->parameter_count()), kNoSuspend,
-          &cache_scope);
+          native_module_, isolate_->counters(), kind, sig, canonical_type_index,
+          static_cast<int>(sig->parameter_count()), kNoSuspend, &cache_scope);
     }
 
     ImportedFunctionEntry(instance_object_, maybe_import_index)
-        .SetWasmToJs(isolate_, callable, import_wrapper, resolved.suspend());
-  }
-
-  if (tier == TestExecutionTier::kInterpreter) {
-    interpreter_ = std::make_unique<WasmInterpreter>(
-        isolate_, test_module_.get(),
-        ModuleWireBytes{native_module_->wire_bytes()}, instance_object_);
+        .SetWasmToJs(isolate_, callable, import_wrapper, resolved.suspend(),
+                     sig);
   }
 }
 
@@ -115,36 +105,54 @@ TestingModuleBuilder::~TestingModuleBuilder() {
   CcTest::array_buffer_allocator()->Free(globals_data_, kMaxGlobalsSize);
 }
 
-byte* TestingModuleBuilder::AddMemory(uint32_t size, SharedFlag shared) {
-  CHECK(!test_module_->has_memory);
-  CHECK_NULL(mem_start_);
-  CHECK_EQ(0, mem_size_);
-  DCHECK(!instance_object_->has_memory_object());
+uint8_t* TestingModuleBuilder::AddMemory(uint32_t size, SharedFlag shared,
+                                         TestingModuleMemoryType mem_type) {
+  // The TestingModuleBuilder only supports one memory currently.
+  CHECK_EQ(0, test_module_->memories.size());
+  CHECK_NULL(mem0_start_);
+  CHECK_EQ(0, mem0_size_);
+  CHECK_EQ(0, instance_object_->memory_objects()->length());
+
   uint32_t initial_pages = RoundUp(size, kWasmPageSize) / kWasmPageSize;
-  uint32_t maximum_pages = (test_module_->maximum_pages != 0)
-                               ? test_module_->maximum_pages
-                               : initial_pages;
-  test_module_->has_memory = true;
-  test_module_->min_memory_size = initial_pages * kWasmPageSize;
-  test_module_->max_memory_size = maximum_pages * kWasmPageSize;
+  uint32_t maximum_pages = initial_pages;
+  test_module_->memories.resize(1);
+  WasmMemory* memory = &test_module_->memories[0];
+  memory->initial_pages = initial_pages;
+  memory->maximum_pages = maximum_pages;
+  memory->is_memory64 = mem_type == kMemory64;
+  UpdateComputedInformation(memory, test_module_->origin);
 
   // Create the WasmMemoryObject.
   Handle<WasmMemoryObject> memory_object =
-      WasmMemoryObject::New(isolate_, initial_pages, maximum_pages, shared)
+      WasmMemoryObject::New(isolate_, initial_pages, maximum_pages, shared,
+                            mem_type == kMemory64
+                                ? WasmMemoryFlag::kWasmMemory64
+                                : WasmMemoryFlag::kWasmMemory32)
           .ToHandleChecked();
-  instance_object_->set_memory_object(*memory_object);
-
-  mem_start_ =
-      reinterpret_cast<byte*>(memory_object->array_buffer().backing_store());
-  mem_size_ = size;
-  CHECK(size == 0 || mem_start_);
-
-  WasmMemoryObject::AddInstance(isolate_, memory_object, instance_object_);
-  // TODO(wasm): Delete the following two lines when test-run-wasm will use a
+  Handle<FixedArray> memory_objects = isolate_->factory()->NewFixedArray(1);
+  memory_objects->set(0, *memory_object);
+  instance_object_->set_memory_objects(*memory_objects);
+
+  // Create the memory_bases_and_sizes array.
+  Handle<FixedAddressArray> memory_bases_and_sizes =
+      FixedAddressArray::New(isolate_, 2);
+  uint8_t* mem_start = reinterpret_cast<uint8_t*>(
+      memory_object->array_buffer()->backing_store());
+  memory_bases_and_sizes->set_sandboxed_pointer(
+      0, reinterpret_cast<Address>(mem_start));
+  memory_bases_and_sizes->set(1, size);
+  instance_object_->set_memory_bases_and_sizes(*memory_bases_and_sizes);
+
+  mem0_start_ = mem_start;
+  mem0_size_ = size;
+  CHECK(size == 0 || mem0_start_);
+
+  WasmMemoryObject::UseInInstance(isolate_, memory_object, instance_object_, 0);
+  // TODO(wasm): Delete the following line when test-run-wasm will use a
   // multiple of kPageSize as memory size. At the moment, the effect of these
   // two lines is used to shrink the memory for testing purposes.
-  instance_object_->SetRawMemory(mem_start_, mem_size_);
-  return mem_start_;
+  instance_object_->SetRawMemory(0, mem0_start_, mem0_size_);
+  return mem0_start_;
 }
 
 uint32_t TestingModuleBuilder::AddFunction(const FunctionSig* sig,
@@ -183,14 +191,11 @@ uint32_t TestingModuleBuilder::AddFunction(const FunctionSig* sig,
             test_module_->num_imported_functions +
                 test_module_->num_declared_functions);
   if (name) {
-    base::Vector<const byte> name_vec =
-        base::Vector<const byte>::cast(base::CStrVector(name));
+    base::Vector<const uint8_t> name_vec =
+        base::Vector<const uint8_t>::cast(base::CStrVector(name));
     test_module_->lazily_generated_names.AddForTesting(
         index, {AddBytes(name_vec), static_cast<uint32_t>(name_vec.length())});
   }
-  if (interpreter_) {
-    interpreter_->AddFunctionForTesting(&test_module_->functions.back());
-  }
   DCHECK_LT(index, kMaxFunctions);  // limited for testing.
   if (!instance_object_.is_null()) {
     Handle<FixedArray> funcs = isolate_->factory()->NewFixedArrayWithZeroes(
@@ -206,13 +211,11 @@ void TestingModuleBuilder::InitializeWrapperCache() {
 }
 
 Handle<JSFunction> TestingModuleBuilder::WrapCode(uint32_t index) {
-  CHECK(!interpreter_);
   InitializeWrapperCache();
-  return handle(
-      JSFunction::cast(WasmInstanceObject::GetOrCreateWasmInternalFunction(
-                           isolate_, instance_object(), index)
-                           ->external()),
-      isolate_);
+  Handle<WasmInternalFunction> internal =
+      WasmInstanceObject::GetOrCreateWasmInternalFunction(
+          isolate_, instance_object(), index);
+  return WasmInternalFunction::GetOrCreateExternal(internal);
 }
 
 void TestingModuleBuilder::AddIndirectFunctionTable(
@@ -273,7 +276,7 @@ void TestingModuleBuilder::AddIndirectFunctionTable(
   instance_object_->set_tables(*new_tables);
 }
 
-uint32_t TestingModuleBuilder::AddBytes(base::Vector<const byte> bytes) {
+uint32_t TestingModuleBuilder::AddBytes(base::Vector<const uint8_t> bytes) {
   base::Vector<const uint8_t> old_bytes = native_module_->wire_bytes();
   uint32_t old_size = static_cast<uint32_t>(old_bytes.size());
   // Avoid placing strings at offset 0, this might be interpreted as "not
@@ -307,7 +310,7 @@ uint32_t TestingModuleBuilder::AddException(const FunctionSig* sig) {
 }
 
 uint32_t TestingModuleBuilder::AddPassiveDataSegment(
-    base::Vector<const byte> bytes) {
+    base::Vector<const uint8_t> bytes) {
   uint32_t index = static_cast<uint32_t>(test_module_->data_segments.size());
   DCHECK_EQ(index, test_module_->data_segments.size());
   DCHECK_EQ(index, data_segment_starts_.size());
@@ -316,7 +319,7 @@ uint32_t TestingModuleBuilder::AddPassiveDataSegment(
   // Add a passive data segment. This isn't used by function compilation, but
   // but it keeps the index in sync. The data segment's source will not be
   // correct, since we don't store data in the module wire bytes.
-  test_module_->data_segments.emplace_back();
+  test_module_->data_segments.push_back(WasmDataSegment::PassiveForTesting());
 
   // The num_declared_data_segments (from the DataCount section) is used
   // to validate the segment index, during function compilation.
@@ -344,25 +347,24 @@ uint32_t TestingModuleBuilder::AddPassiveDataSegment(
   Handle<FixedAddressArray> data_segment_starts =
       FixedAddressArray::New(isolate_, size);
   data_segment_starts->copy_in(
-      0, reinterpret_cast<byte*>(data_segment_starts_.data()),
+      0, reinterpret_cast<uint8_t*>(data_segment_starts_.data()),
       size * sizeof(Address));
   instance_object_->set_data_segment_starts(*data_segment_starts);
   Handle<FixedUInt32Array> data_segment_sizes =
       FixedUInt32Array::New(isolate_, size);
   data_segment_sizes->copy_in(
-      0, reinterpret_cast<byte*>(data_segment_sizes_.data()),
+      0, reinterpret_cast<uint8_t*>(data_segment_sizes_.data()),
       size * sizeof(uint32_t));
   instance_object_->set_data_segment_sizes(*data_segment_sizes);
   return index;
 }
 
 CompilationEnv TestingModuleBuilder::CreateCompilationEnv() {
-  return {test_module_.get(), native_module_->bounds_checks(),
-          runtime_exception_support_, enabled_features_, kNoDynamicTiering};
+  return {test_module_.get(), enabled_features_, kNoDynamicTiering};
 }
 
 const WasmGlobal* TestingModuleBuilder::AddGlobal(ValueType type) {
-  byte size = type.value_kind_size();
+  uint8_t size = type.value_kind_size();
   global_offset = (global_offset + size - 1) & ~(size - 1);  // align
   test_module_->globals.push_back(
       {type, true, {}, {global_offset}, false, false});
@@ -374,9 +376,12 @@ const WasmGlobal* TestingModuleBuilder::AddGlobal(ValueType type) {
 
 Handle<WasmInstanceObject> TestingModuleBuilder::InitInstanceObject() {
   const bool kUsesLiftoff = true;
+  // Compute the estimate based on {kMaxFunctions} because we might still add
+  // functions later. Assume 1k of code per function.
+  int estimated_code_section_length = kMaxFunctions * 1024;
   size_t code_size_estimate =
       wasm::WasmCodeManager::EstimateNativeModuleCodeSize(
-          test_module_.get(), kUsesLiftoff,
+          kMaxFunctions, 0, estimated_code_section_length, kUsesLiftoff,
           DynamicTiering{v8_flags.wasm_dynamic_tiering.value()});
   auto native_module = GetWasmEngine()->NewNativeModule(
       isolate_, enabled_features_, test_module_, code_size_estimate);
@@ -385,12 +390,15 @@ Handle<WasmInstanceObject> TestingModuleBuilder::InitInstanceObject() {
   constexpr base::Vector<const char> kNoSourceUrl{"", 0};
   Handle<Script> script =
       GetWasmEngine()->GetOrCreateScript(isolate_, native_module, kNoSourceUrl);
+  // Asm.js modules are expected to have "normal" scripts, not Wasm scripts.
+  if (is_asmjs_module(native_module->module())) {
+    script->set_type(Script::Type::kNormal);
+    script->set_shared_function_infos(
+        ReadOnlyRoots{isolate_}.empty_weak_fixed_array());
+  }
 
   Handle<WasmModuleObject> module_object =
       WasmModuleObject::New(isolate_, std::move(native_module), script);
-  // This method is called when we initialize TestEnvironment. We don't
-  // have a memory yet, so we won't create it here. We'll update the
-  // interpreter when we get a memory. We do have globals, though.
   native_module_ = module_object->native_module();
   native_module_->ReserveCodeTableForTesting(kMaxFunctions);
 
@@ -405,7 +413,7 @@ Handle<WasmInstanceObject> TestingModuleBuilder::InitInstanceObject() {
 
 void TestBuildingGraphWithBuilder(compiler::WasmGraphBuilder* builder,
                                   Zone* zone, const FunctionSig* sig,
-                                  const byte* start, const byte* end) {
+                                  const uint8_t* start, const uint8_t* end) {
   WasmFeatures unused_detected_features;
   FunctionBody body(sig, 0, start, end);
   std::vector<compiler::WasmLoopInfo> loops;
@@ -418,140 +426,22 @@ void TestBuildingGraphWithBuilder(compiler::WasmGraphBuilder* builder,
 void TestBuildingGraph(Zone* zone, compiler::JSGraph* jsgraph,
                        CompilationEnv* env, const FunctionSig* sig,
                        compiler::SourcePositionTable* source_position_table,
-                       const byte* start, const byte* end) {
+                       const uint8_t* start, const uint8_t* end) {
   compiler::WasmGraphBuilder builder(env, zone, jsgraph, sig,
                                      source_position_table);
   TestBuildingGraphWithBuilder(&builder, zone, sig, start, end);
 }
 
-WasmFunctionWrapper::WasmFunctionWrapper(Zone* zone, int num_params)
-    : GraphAndBuilders(zone),
-      inner_code_node_(nullptr),
-      context_address_(nullptr),
-      signature_(nullptr) {
-  // One additional parameter for the pointer to the return value memory.
-  Signature<MachineType>::Builder sig_builder(zone, 1, num_params + 1);
-
-  sig_builder.AddReturn(MachineType::Int32());
-  for (int i = 0; i < num_params + 1; i++) {
-    sig_builder.AddParam(MachineType::Pointer());
-  }
-  signature_ = sig_builder.Build();
-}
-
-void WasmFunctionWrapper::Init(CallDescriptor* call_descriptor,
-                               MachineType return_type,
-                               base::Vector<MachineType> param_types) {
-  DCHECK_NOT_NULL(call_descriptor);
-  DCHECK_EQ(signature_->parameter_count(), param_types.length() + 1);
-
-  // Create the TF graph for the wrapper.
-
-  // Function, context_address, effect, and control.
-  Node** parameters = zone()->NewArray<Node*>(param_types.length() + 4);
-  int start_value_output_count =
-      static_cast<int>(signature_->parameter_count()) + 1;
-  graph()->SetStart(
-      graph()->NewNode(common()->Start(start_value_output_count)));
-  Node* effect = graph()->start();
-  int parameter_count = 0;
-
-  // Dummy node which gets replaced in SetInnerCode.
-  inner_code_node_ = graph()->NewNode(common()->Int32Constant(0));
-  parameters[parameter_count++] = inner_code_node_;
-
-  // Dummy node that gets replaced in SetContextAddress.
-  context_address_ = graph()->NewNode(IntPtrConstant(0));
-  parameters[parameter_count++] = context_address_;
-
-  int param_idx = 0;
-  for (MachineType t : param_types) {
-    DCHECK_NE(MachineType::None(), t);
-    parameters[parameter_count] = graph()->NewNode(
-        machine()->Load(t),
-        graph()->NewNode(common()->Parameter(param_idx++), graph()->start()),
-        graph()->NewNode(common()->Int32Constant(0)), effect, graph()->start());
-    effect = parameters[parameter_count++];
-  }
-
-  parameters[parameter_count++] = effect;
-  parameters[parameter_count++] = graph()->start();
-  const compiler::Operator* call_op = common()->Call(call_descriptor);
-  // The following code assumes the call node has effect and control inputs and
-  // outputs.
-  DCHECK_GT(call_op->EffectInputCount(), 0);
-  DCHECK_GT(call_op->EffectOutputCount(), 0);
-  DCHECK_GT(call_op->ControlInputCount(), 0);
-  DCHECK_GT(call_op->ControlOutputCount(), 0);
-
-  Node* call = graph()->NewNode(call_op, parameter_count, parameters);
-
-  if (!return_type.IsNone()) {
-    effect = graph()->NewNode(
-        machine()->Store(compiler::StoreRepresentation(
-            return_type.representation(),
-            compiler::WriteBarrierKind::kNoWriteBarrier)),
-        graph()->NewNode(common()->Parameter(param_types.length()),
-                         graph()->start()),
-        graph()->NewNode(common()->Int32Constant(0)), call, call, call);
-  }
-  Node* zero = graph()->NewNode(common()->Int32Constant(0));
-  Node* r = graph()->NewNode(
-      common()->Return(), zero,
-      graph()->NewNode(common()->Int32Constant(WASM_WRAPPER_RETURN_VALUE)),
-      effect, call);
-  graph()->SetEnd(graph()->NewNode(common()->End(1), r));
-}
-
-Handle<Code> WasmFunctionWrapper::GetWrapperCode(Isolate* isolate) {
-  Handle<Code> code;
-  if (!code_.ToHandle(&code)) {
-    auto call_descriptor = compiler::Linkage::GetSimplifiedCDescriptor(
-        zone(), signature_, CallDescriptor::kInitializeRootRegister);
-
-    if (kSystemPointerSize == 4) {
-      size_t num_params = signature_->parameter_count();
-      // One additional parameter for the pointer of the return value.
-      Signature<MachineRepresentation>::Builder rep_builder(zone(), 1,
-                                                            num_params + 1);
-
-      rep_builder.AddReturn(MachineRepresentation::kWord32);
-      for (size_t i = 0; i < num_params + 1; i++) {
-        rep_builder.AddParam(MachineRepresentation::kWord32);
-      }
-      compiler::Int64Lowering r(graph(), machine(), common(), simplified(),
-                                zone(), rep_builder.Build());
-      r.LowerGraph();
-    }
-
-    OptimizedCompilationInfo info(base::ArrayVector("testing"), graph()->zone(),
-                                  CodeKind::C_WASM_ENTRY);
-    code_ = compiler::Pipeline::GenerateCodeForTesting(
-        &info, isolate, call_descriptor, graph(),
-        AssemblerOptions::Default(isolate));
-    code = code_.ToHandleChecked();
-#ifdef ENABLE_DISASSEMBLER
-    if (v8_flags.print_opt_code) {
-      CodeTracer::Scope tracing_scope(isolate->GetCodeTracer());
-      OFStream os(tracing_scope.file());
-
-      code->Disassemble("wasm wrapper", os, isolate);
-    }
-#endif
-  }
-
-  return code;
-}
-
 // This struct is just a type tag for Zone::NewArray<T>(size_t) call.
 struct WasmFunctionCompilerBuffer {};
 
 void WasmFunctionCompiler::Build(base::Vector<const uint8_t> bytes) {
-  size_t locals_size = local_decls.Size();
+  size_t locals_size = local_decls_.Size();
   size_t total_size = bytes.size() + locals_size + 1;
-  byte* buffer = zone()->NewArray<byte, WasmFunctionCompilerBuffer>(total_size);
+  uint8_t* buffer =
+      zone_->AllocateArray<uint8_t, WasmFunctionCompilerBuffer>(total_size);
   // Prepend the local decls to the code.
-  local_decls.Emit(buffer);
+  local_decls_.Emit(buffer);
   // Emit the code.
   memcpy(buffer + locals_size, bytes.begin(), bytes.size());
   // Append an extra end opcode.
@@ -562,16 +452,9 @@ void WasmFunctionCompiler::Build(base::Vector<const uint8_t> bytes) {
   function_->code = {builder_->AddBytes(bytes),
                      static_cast<uint32_t>(bytes.size())};
 
-  if (interpreter_) {
-    // Add the code to the interpreter; do not generate compiled code.
-    interpreter_->SetFunctionCodeForTesting(function_, bytes.begin(),
-                                            bytes.end());
-    return;
-  }
-
   base::Vector<const uint8_t> wire_bytes = builder_->instance_object()
                                                ->module_object()
-                                               .native_module()
+                                               ->native_module()
                                                ->wire_bytes();
 
   CompilationEnv env = builder_->CreateCompilationEnv();
@@ -582,7 +465,7 @@ void WasmFunctionCompiler::Build(base::Vector<const uint8_t> bytes) {
   FunctionBody func_body{function_->sig, function_->code.offset(),
                          func_wire_bytes.begin(), func_wire_bytes.end()};
   NativeModule* native_module =
-      builder_->instance_object()->module_object().native_module();
+      builder_->instance_object()->module_object()->native_module();
   ForDebugging for_debugging =
       native_module->IsInDebugState() ? kForDebugging : kNotForDebugging;
 
@@ -613,32 +496,26 @@ void WasmFunctionCompiler::Build(base::Vector<const uint8_t> bytes) {
                              for_debugging);
     result.emplace(unit.ExecuteCompilation(
         &env, native_module->compilation_state()->GetWireBytesStorage().get(),
-        nullptr, nullptr, &unused_detected_features));
+        nullptr, &unused_detected_features));
   }
   CHECK(result->succeeded());
-  WasmCode* code = native_module->PublishCode(
-      native_module->AddCompiledCode(std::move(*result)));
+  WasmCode* code =
+      native_module->PublishCode(native_module->AddCompiledCode(*result));
   DCHECK_NOT_NULL(code);
   DisallowGarbageCollection no_gc;
-  Script script = builder_->instance_object()->module_object().script();
-  std::unique_ptr<char[]> source_url = String::cast(script.name()).ToCString();
+  Tagged<Script> script =
+      builder_->instance_object()->module_object()->script();
+  std::unique_ptr<char[]> source_url =
+      String::cast(script->name())->ToCString();
   if (WasmCode::ShouldBeLogged(isolate())) {
-    code->LogCode(isolate(), source_url.get(), script.id());
+    code->LogCode(isolate(), source_url.get(), script->id());
   }
 }
 
 WasmFunctionCompiler::WasmFunctionCompiler(Zone* zone, const FunctionSig* sig,
                                            TestingModuleBuilder* builder,
                                            const char* name)
-    : GraphAndBuilders(zone),
-      jsgraph(builder->isolate(), this->graph(), this->common(), nullptr,
-              nullptr, this->machine()),
-      sig(sig),
-      descriptor_(nullptr),
-      builder_(builder),
-      local_decls(zone, sig),
-      source_position_table_(this->graph()),
-      interpreter_(builder->interpreter()) {
+    : zone_(zone), builder_(builder), local_decls_(zone, sig) {
   // Get a new function from the testing module.
   int index = builder->AddFunction(sig, name, TestingModuleBuilder::kWasm);
   function_ = builder_->GetFunctionAt(index);
@@ -653,7 +530,8 @@ FunctionSig* WasmRunnerBase::CreateSig(Zone* zone, MachineType return_type,
   int param_count = param_types.length();
 
   // Allocate storage array in zone.
-  ValueType* sig_types = zone->NewArray<ValueType>(return_count + param_count);
+  ValueType* sig_types =
+      zone->AllocateArray<ValueType>(return_count + param_count);
 
   // Convert machine types to local types, and check that there are no
   // MachineType::None()'s in the parameters.
@@ -666,9 +544,6 @@ FunctionSig* WasmRunnerBase::CreateSig(Zone* zone, MachineType return_type,
   return zone->New<FunctionSig>(return_count, param_count, sig_types);
 }
 
-// static
-bool WasmRunnerBase::trap_happened;
-
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/cctest/wasm/wasm-run-utils.h b/deps/v8/test/cctest/wasm/wasm-run-utils.h
index 506159f4716c19..a748a7b972815a 100644
--- a/deps/v8/test/cctest/wasm/wasm-run-utils.h
+++ b/deps/v8/test/cctest/wasm/wasm-run-utils.h
@@ -38,16 +38,12 @@
 #include "test/common/call-tester.h"
 #include "test/common/value-helper.h"
 #include "test/common/wasm/flag-utils.h"
-#include "test/common/wasm/wasm-interpreter.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
+namespace v8::internal::wasm {
 
 enum class TestExecutionTier : int8_t {
   kLiftoff = static_cast<int8_t>(ExecutionTier::kLiftoff),
   kTurbofan = static_cast<int8_t>(ExecutionTier::kTurbofan),
-  kInterpreter,
   kLiftoffForFuzzing
 };
 static_assert(
@@ -84,7 +80,7 @@ using compiler::Node;
 
 #define ADD_CODE(vec, ...)                           \
   do {                                               \
-    byte __buf[] = {__VA_ARGS__};                    \
+    uint8_t __buf[] = {__VA_ARGS__};                 \
     for (size_t __i = 0; __i < sizeof(__buf); __i++) \
       vec.push_back(__buf[__i]);                     \
   } while (false)
@@ -101,22 +97,22 @@ bool IsSameNan(double expected, double actual);
 
 // A  Wasm module builder. Globals are pre-set, however, memory and code may be
 // progressively added by a test. In turn, we piecemeal update the runtime
-// objects, i.e. {WasmInstanceObject}, {WasmModuleObject} and, if necessary,
-// the interpreter.
+// objects, i.e. {WasmInstanceObject} and {WasmModuleObject}.
 class TestingModuleBuilder {
  public:
   TestingModuleBuilder(Zone*, ModuleOrigin origin, ManuallyImportedJSFunction*,
-                       TestExecutionTier, RuntimeExceptionSupport,
-                       TestingModuleMemoryType, Isolate* isolate);
+                       TestExecutionTier, Isolate* isolate);
   ~TestingModuleBuilder();
 
-  byte* AddMemory(uint32_t size, SharedFlag shared = SharedFlag::kNotShared);
+  uint8_t* AddMemory(uint32_t size, SharedFlag shared = SharedFlag::kNotShared,
+                     TestingModuleMemoryType = kMemory32);
 
   size_t CodeTableLength() const { return native_module_->num_functions(); }
 
   template <typename T>
-  T* AddMemoryElems(uint32_t count) {
-    AddMemory(count * sizeof(T));
+  T* AddMemoryElems(uint32_t count,
+                    TestingModuleMemoryType mem_type = kMemory32) {
+    AddMemory(count * sizeof(T), SharedFlag::kNotShared, mem_type);
     return raw_mem_start<T>();
   }
 
@@ -126,40 +122,43 @@ class TestingModuleBuilder {
     return reinterpret_cast<T*>(globals_data_ + global->offset);
   }
 
-  // TODO(7748): Allow selecting type finality.
-  byte AddSignature(const FunctionSig* sig) {
+  // TODO(14034): Allow selecting type finality.
+  uint8_t AddSignature(const FunctionSig* sig) {
     test_module_->add_signature(sig, kNoSuperType, v8_flags.wasm_final_types);
     GetTypeCanonicalizer()->AddRecursiveGroup(test_module_.get(), 1);
     instance_object_->set_isorecursive_canonical_types(
         test_module_->isorecursive_canonical_type_ids.data());
     size_t size = test_module_->types.size();
     CHECK_GT(127, size);
-    return static_cast<byte>(size - 1);
+    return static_cast<uint8_t>(size - 1);
   }
 
-  uint32_t mem_size() { return mem_size_; }
+  uint32_t mem_size() const {
+    CHECK_EQ(1, test_module_->memories.size());
+    return mem0_size_;
+  }
 
   template <typename T>
-  T* raw_mem_start() {
-    DCHECK(mem_start_);
-    return reinterpret_cast<T*>(mem_start_);
+  T* raw_mem_start() const {
+    DCHECK_NOT_NULL(mem0_start_);
+    return reinterpret_cast<T*>(mem0_start_);
   }
 
   template <typename T>
-  T* raw_mem_end() {
-    DCHECK(mem_start_);
-    return reinterpret_cast<T*>(mem_start_ + mem_size_);
+  T* raw_mem_end() const {
+    DCHECK_NOT_NULL(mem0_start_);
+    return reinterpret_cast<T*>(mem0_start_ + mem0_size_);
   }
 
   template <typename T>
   T raw_mem_at(int i) {
-    DCHECK(mem_start_);
-    return ReadMemory(&(reinterpret_cast<T*>(mem_start_)[i]));
+    DCHECK_NOT_NULL(mem0_start_);
+    return ReadMemory(&(reinterpret_cast<T*>(mem0_start_)[i]));
   }
 
   template <typename T>
   T raw_val_at(int i) {
-    return ReadMemory(reinterpret_cast<T*>(mem_start_ + i));
+    return ReadMemory(reinterpret_cast<T*>(mem0_start_ + i));
   }
 
   template <typename T>
@@ -174,27 +173,31 @@ class TestingModuleBuilder {
 
   // Zero-initialize the memory.
   void BlankMemory() {
-    byte* raw = raw_mem_start<byte>();
-    memset(raw, 0, mem_size_);
+    uint8_t* raw = raw_mem_start<uint8_t>();
+    memset(raw, 0, mem0_size_);
   }
 
   // Pseudo-randomly initialize the memory.
   void RandomizeMemory(unsigned int seed = 88) {
-    byte* raw = raw_mem_start<byte>();
-    byte* end = raw_mem_end<byte>();
+    uint8_t* raw = raw_mem_start<uint8_t>();
+    uint8_t* end = raw_mem_end<uint8_t>();
     v8::base::RandomNumberGenerator rng;
     rng.SetSeed(seed);
     rng.NextBytes(raw, end - raw);
   }
 
   void SetMaxMemPages(uint32_t maximum_pages) {
-    test_module_->maximum_pages = maximum_pages;
-    if (instance_object()->has_memory_object()) {
-      instance_object()->memory_object().set_maximum_pages(maximum_pages);
-    }
+    CHECK_EQ(1, test_module_->memories.size());
+    test_module_->memories[0].maximum_pages = maximum_pages;
+    DCHECK_EQ(instance_object_->memory_objects()->length(),
+              test_module_->memories.size());
+    instance_object_->memory_object(0)->set_maximum_pages(maximum_pages);
   }
 
-  void SetHasSharedMemory() { test_module_->has_shared_memory = true; }
+  void SetMemoryShared() {
+    CHECK_EQ(1, test_module_->memories.size());
+    test_module_->memories[0].is_shared = true;
+  }
 
   enum FunctionType { kImport, kWasm };
   uint32_t AddFunction(const FunctionSig* sig, const char* name,
@@ -213,18 +216,16 @@ class TestingModuleBuilder {
                                 uint32_t table_size,
                                 ValueType table_type = kWasmFuncRef);
 
-  uint32_t AddBytes(base::Vector<const byte> bytes);
+  uint32_t AddBytes(base::Vector<const uint8_t> bytes);
 
   uint32_t AddException(const FunctionSig* sig);
 
-  uint32_t AddPassiveDataSegment(base::Vector<const byte> bytes);
+  uint32_t AddPassiveDataSegment(base::Vector<const uint8_t> bytes);
 
   WasmFunction* GetFunctionAt(int index) {
     return &test_module_->functions[index];
   }
 
-  WasmInterpreter* interpreter() const { return interpreter_.get(); }
-  bool interpret() const { return interpreter_ != nullptr; }
   Isolate* isolate() const { return isolate_; }
   Handle<WasmInstanceObject> instance_object() const {
     return instance_object_;
@@ -262,10 +263,6 @@ class TestingModuleBuilder {
     }
   }
 
-  RuntimeExceptionSupport runtime_exception_support() const {
-    return runtime_exception_support_;
-  }
-
   void set_max_steps(int n) { max_steps_ = n; }
   int* max_steps_ptr() { return &max_steps_; }
   int32_t nondeterminism() { return nondeterminism_; }
@@ -278,22 +275,20 @@ class TestingModuleBuilder {
   Isolate* isolate_;
   WasmFeatures enabled_features_;
   uint32_t global_offset = 0;
-  byte* mem_start_ = nullptr;
-  uint32_t mem_size_ = 0;
-  byte* globals_data_ = nullptr;
-  std::unique_ptr<WasmInterpreter> interpreter_;
+  // The TestingModuleBuilder only supports one memory currently.
+  uint8_t* mem0_start_ = nullptr;
+  uint32_t mem0_size_ = 0;
+  uint8_t* globals_data_ = nullptr;
   TestExecutionTier execution_tier_;
   Handle<WasmInstanceObject> instance_object_;
   NativeModule* native_module_ = nullptr;
-  RuntimeExceptionSupport runtime_exception_support_;
   int32_t max_steps_ = kMaxNumSteps;
   int32_t nondeterminism_ = 0;
 
   // Data segment arrays that are normally allocated on the instance.
-  std::vector<byte> data_segment_data_;
+  std::vector<uint8_t> data_segment_data_;
   std::vector<Address> data_segment_starts_;
   std::vector<uint32_t> data_segment_sizes_;
-  std::vector<byte> dropped_elem_segments_;
 
   const WasmGlobal* AddGlobal(ValueType type);
 
@@ -303,67 +298,15 @@ class TestingModuleBuilder {
 void TestBuildingGraph(Zone* zone, compiler::JSGraph* jsgraph,
                        CompilationEnv* env, const FunctionSig* sig,
                        compiler::SourcePositionTable* source_position_table,
-                       const byte* start, const byte* end);
-
-class WasmFunctionWrapper : private compiler::GraphAndBuilders {
- public:
-  WasmFunctionWrapper(Zone* zone, int num_params);
-
-  void Init(CallDescriptor* call_descriptor, MachineType return_type,
-            base::Vector<MachineType> param_types);
-
-  template <typename ReturnType, typename... ParamTypes>
-  void Init(CallDescriptor* call_descriptor) {
-    std::array<MachineType, sizeof...(ParamTypes)> param_machine_types{
-        {MachineTypeForC<ParamTypes>()...}};
-    base::Vector<MachineType> param_vec(param_machine_types.data(),
-                                        param_machine_types.size());
-    Init(call_descriptor, MachineTypeForC<ReturnType>(), param_vec);
-  }
-
-  void SetInnerCode(WasmCode* code) {
-    intptr_t address = static_cast<intptr_t>(code->instruction_start());
-    compiler::NodeProperties::ChangeOp(
-        inner_code_node_,
-        common()->ExternalConstant(ExternalReference::FromRawAddress(address)));
-  }
-
-  const compiler::Operator* IntPtrConstant(intptr_t value) {
-    return machine()->Is32()
-               ? common()->Int32Constant(static_cast<int32_t>(value))
-               : common()->Int64Constant(static_cast<int64_t>(value));
-  }
-
-  void SetInstance(Handle<WasmInstanceObject> instance) {
-    compiler::NodeProperties::ChangeOp(context_address_,
-                                       common()->HeapConstant(instance));
-  }
-
-  Handle<Code> GetWrapperCode(Isolate* isolate = nullptr);
-
-  Signature<MachineType>* signature() const { return signature_; }
-
- private:
-  Node* inner_code_node_;
-  Node* context_address_;
-  MaybeHandle<Code> code_;
-  Signature<MachineType>* signature_;
-};
+                       const uint8_t* start, const uint8_t* end);
 
 // A helper for compiling wasm functions for testing.
-// It contains the internal state for compilation (i.e. TurboFan graph) and
-// interpretation (by adding to the interpreter manually).
-class WasmFunctionCompiler : public compiler::GraphAndBuilders {
+// It contains the internal state for compilation (i.e. TurboFan graph).
+class WasmFunctionCompiler {
  public:
   ~WasmFunctionCompiler();
 
   Isolate* isolate() { return builder_->isolate(); }
-  CallDescriptor* descriptor() {
-    if (descriptor_ == nullptr) {
-      descriptor_ = compiler::GetWasmCallDescriptor(zone(), sig);
-    }
-    return descriptor_;
-  }
   uint32_t function_index() { return function_->func_index; }
   uint32_t sig_index() { return function_->sig_index; }
 
@@ -372,9 +315,9 @@ class WasmFunctionCompiler : public compiler::GraphAndBuilders {
   }
   void Build(base::Vector<const uint8_t> bytes);
 
-  byte AllocateLocal(ValueType type) {
-    uint32_t index = local_decls.AddLocals(1, type);
-    byte result = static_cast<byte>(index);
+  uint8_t AllocateLocal(ValueType type) {
+    uint32_t index = local_decls_.AddLocals(1, type);
+    uint8_t result = static_cast<uint8_t>(index);
     DCHECK_EQ(index, result);
     return result;
   }
@@ -387,15 +330,10 @@ class WasmFunctionCompiler : public compiler::GraphAndBuilders {
   WasmFunctionCompiler(Zone* zone, const FunctionSig* sig,
                        TestingModuleBuilder* builder, const char* name);
 
-  compiler::JSGraph jsgraph;
-  const FunctionSig* sig;
-  // The call descriptor is initialized when the function is compiled.
-  CallDescriptor* descriptor_;
+  Zone* zone_;
   TestingModuleBuilder* builder_;
   WasmFunction* function_;
-  LocalDeclEncoder local_decls;
-  compiler::SourcePositionTable source_position_table_;
-  WasmInterpreter* interpreter_;
+  LocalDeclEncoder local_decls_;
 };
 
 // A helper class to build a module around Wasm bytecode, generate machine
@@ -404,24 +342,10 @@ class WasmRunnerBase : public InitializedHandleScope {
  public:
   WasmRunnerBase(ManuallyImportedJSFunction* maybe_import, ModuleOrigin origin,
                  TestExecutionTier execution_tier, int num_params,
-                 RuntimeExceptionSupport runtime_exception_support =
-                     kNoRuntimeExceptionSupport,
-                 TestingModuleMemoryType mem_type = kMemory32,
                  Isolate* isolate = nullptr)
       : InitializedHandleScope(isolate),
         zone_(&allocator_, ZONE_NAME, kCompressGraphZone),
-        builder_(&zone_, origin, maybe_import, execution_tier,
-                 runtime_exception_support, mem_type, isolate),
-        wrapper_(&zone_, num_params) {}
-
-  static void SetUpTrapCallback() {
-    WasmRunnerBase::trap_happened = false;
-    auto trap_callback = []() -> void {
-      WasmRunnerBase::trap_happened = true;
-      set_trap_callback_for_testing(nullptr);
-    };
-    set_trap_callback_for_testing(trap_callback);
-  }
+        builder_(&zone_, origin, maybe_import, execution_tier, isolate) {}
 
   // Builds a graph from the given Wasm code and generates the machine
   // code and call wrapper for that graph. This method must not be called
@@ -452,27 +376,21 @@ class WasmRunnerBase : public InitializedHandleScope {
                                     const char* name = nullptr) {
     functions_.emplace_back(
         new WasmFunctionCompiler(&zone_, sig, &builder_, name));
-    byte sig_index = builder().AddSignature(sig);
+    uint8_t sig_index = builder().AddSignature(sig);
     functions_.back()->SetSigIndex(sig_index);
     return *functions_.back();
   }
 
-  byte AllocateLocal(ValueType type) {
+  uint8_t AllocateLocal(ValueType type) {
     return functions_[0]->AllocateLocal(type);
   }
 
   uint32_t function_index() { return functions_[0]->function_index(); }
   WasmFunction* function() { return functions_[0]->function_; }
-  WasmInterpreter* interpreter() {
-    DCHECK(interpret());
-    return functions_[0]->interpreter_;
-  }
   bool possible_nondeterminism() { return possible_nondeterminism_; }
   TestingModuleBuilder& builder() { return builder_; }
   Zone* zone() { return &zone_; }
 
-  bool interpret() { return builder_.interpret(); }
-
   void SwitchToDebug() { builder_.SwitchToDebug(); }
 
   template <typename ReturnType, typename... ParamTypes>
@@ -489,41 +407,43 @@ class WasmRunnerBase : public InitializedHandleScope {
     return CreateSig(zone, MachineTypeForC<ReturnType>(), param_vec);
   }
 
+  // TODO(clemensb): Remove, use {CallViaJS} directly.
   void CheckCallApplyViaJS(double expected, uint32_t function_index,
                            Handle<Object>* buffer, int count) {
-    Isolate* isolate = builder_.isolate();
-    SetUpTrapCallback();
-    if (jsfuncs_.size() <= function_index) {
-      jsfuncs_.resize(function_index + 1);
-    }
-    if (jsfuncs_[function_index].is_null()) {
-      jsfuncs_[function_index] = builder_.WrapCode(function_index);
-    }
-    Handle<JSFunction> jsfunc = jsfuncs_[function_index];
-    Handle<Object> global(isolate->context().global_object(), isolate);
     MaybeHandle<Object> retval =
-        Execution::TryCall(isolate, jsfunc, global, count, buffer,
-                           Execution::MessageHandling::kReport, nullptr);
+        CallViaJS(function_index, base::VectorOf(buffer, count));
 
-    if (retval.is_null() || WasmRunnerBase::trap_happened) {
+    if (retval.is_null()) {
       CHECK_EQ(expected, static_cast<double>(0xDEADBEEF));
     } else {
       Handle<Object> result = retval.ToHandleChecked();
-      if (result->IsSmi()) {
+      if (IsSmi(*result)) {
         CHECK_EQ(expected, Smi::ToInt(*result));
       } else {
-        CHECK(result->IsHeapNumber());
-        CHECK_DOUBLE_EQ(expected, HeapNumber::cast(*result).value());
+        CHECK(IsHeapNumber(*result));
+        CHECK_DOUBLE_EQ(expected, HeapNumber::cast(*result)->value());
       }
     }
-
-    if (builder_.interpret()) {
-      CHECK_GT(builder_.interpreter()->NumInterpretedCalls(), 0);
-    }
   }
 
-  Handle<Code> GetWrapperCode() {
-    return wrapper_.GetWrapperCode(main_isolate());
+  MaybeHandle<Object> CallViaJS(uint32_t function_index,
+                                base::Vector<Handle<Object>> parameters) {
+    Isolate* isolate = main_isolate();
+    // Save the original context, because CEntry (for runtime calls) will
+    // reset / invalidate it when returning.
+    SaveContext save_context(isolate);
+
+    if (jsfuncs_.size() <= function_index) {
+      jsfuncs_.resize(function_index + 1);
+    }
+    if (jsfuncs_[function_index].is_null()) {
+      jsfuncs_[function_index] = builder_.WrapCode(function_index);
+    }
+    Handle<JSFunction> jsfunc = jsfuncs_[function_index];
+    Handle<Object> global(isolate->context()->global_object(), isolate);
+    return Execution::TryCall(
+        isolate, jsfunc, global, static_cast<int>(parameters.size()),
+        parameters.data(), Execution::MessageHandling::kReport, nullptr);
   }
 
  private:
@@ -538,7 +458,6 @@ class WasmRunnerBase : public InitializedHandleScope {
   Zone zone_;
   TestingModuleBuilder builder_;
   std::vector<std::unique_ptr<WasmFunctionCompiler>> functions_;
-  WasmFunctionWrapper wrapper_;
   bool compiled_ = false;
   bool possible_nondeterminism_ = false;
   int32_t main_fn_index_ = 0;
@@ -552,11 +471,6 @@ class WasmRunnerBase : public InitializedHandleScope {
     *reinterpret_cast<int*>(trap_handler::GetThreadInWasmThreadLocalAddress()) =
         false;
   }
-
- public:
-  // This field has to be static. Otherwise, gcc complains about the use in
-  // the lambda context below.
-  static bool trap_happened;
 };
 
 template <typename T>
@@ -579,84 +493,88 @@ class WasmRunner : public WasmRunnerBase {
                       ModuleOrigin origin = kWasmOrigin,
                       ManuallyImportedJSFunction* maybe_import = nullptr,
                       const char* main_fn_name = "main",
-                      RuntimeExceptionSupport runtime_exception_support =
-                          kNoRuntimeExceptionSupport,
-                      TestingModuleMemoryType mem_type = kMemory32,
                       Isolate* isolate = nullptr)
       : WasmRunnerBase(maybe_import, origin, execution_tier,
-                       sizeof...(ParamTypes), runtime_exception_support,
-                       mem_type, isolate) {
+                       sizeof...(ParamTypes), isolate) {
     WasmFunctionCompiler& main_fn =
         NewFunction<ReturnType, ParamTypes...>(main_fn_name);
     // Non-zero if there is an import.
     main_fn_index_ = main_fn.function_index();
+  }
 
-    if (!interpret()) {
-      wrapper_.Init<ReturnType, ParamTypes...>(main_fn.descriptor());
+  template <typename T>
+  Handle<Object> MakeParam(T t) {
+    Factory* factory = builder_.isolate()->factory();
+    if constexpr (std::is_integral_v<T> && std::is_signed_v<T> &&
+                  sizeof(T) <= sizeof(int)) {
+      return factory->NewNumberFromInt(t);
+    }
+    if constexpr (std::is_integral_v<T> && std::is_unsigned_v<T> &&
+                  sizeof(T) <= sizeof(int)) {
+      return factory->NewNumberFromUint(t);
     }
+    if constexpr (std::is_same_v<T, int64_t>) {
+      return BigInt::FromInt64(builder_.isolate(), t);
+    }
+    if constexpr (std::is_same_v<T, uint64_t>) {
+      return BigInt::FromUint64(builder_.isolate(), t);
+    }
+    if constexpr (std::is_same_v<T, float>) {
+      return factory->NewNumber(t);
+    }
+    if constexpr (std::is_same_v<T, double>) {
+      return factory->NewNumber(t);
+    }
+    UNIMPLEMENTED();
   }
 
   ReturnType Call(ParamTypes... p) {
-    // Save the original context, because CEntry (for runtime calls) will
-    // reset / invalidate it when returning.
-    SaveContext save_context(main_isolate());
-
-    DCHECK(compiled_);
-    if (interpret()) return CallInterpreter(p...);
-
-    ReturnType return_value = static_cast<ReturnType>(0xDEADBEEFDEADBEEF);
-    SetUpTrapCallback();
-
-    wrapper_.SetInnerCode(builder_.GetFunctionCode(main_fn_index_));
-    wrapper_.SetInstance(builder_.instance_object());
-    Handle<Code> wrapper_code = GetWrapperCode();
-    compiler::CodeRunner<int32_t> runner(main_isolate(), wrapper_code,
-                                         wrapper_.signature());
-    int32_t result;
-    {
-      SetThreadInWasmFlag();
+    std::array<Handle<Object>, sizeof...(p)> param_objs = {MakeParam(p)...};
+    MaybeHandle<Object> retval =
+        CallViaJS(function()->func_index, base::VectorOf(param_objs));
 
-      result = runner.Call(static_cast<void*>(&p)...,
-                           static_cast<void*>(&return_value));
+    if (retval.is_null()) {
+      return static_cast<ReturnType>(0xDEADBEEFDEADBEEF);
+    }
 
-      ClearThreadInWasmFlag();
+    Handle<Object> result = retval.ToHandleChecked();
+    // For int64_t and uint64_t returns we will get a BigInt.
+    if constexpr (std::is_integral_v<ReturnType> &&
+                  sizeof(ReturnType) == sizeof(int64_t)) {
+      CHECK(IsBigInt(*result));
+      return BigInt::cast(*result)->AsInt64();
     }
-    CHECK_EQ(WASM_WRAPPER_RETURN_VALUE, result);
-    return WasmRunnerBase::trap_happened
-               ? static_cast<ReturnType>(0xDEADBEEFDEADBEEF)
-               : return_value;
-  }
-
-  ReturnType CallInterpreter(ParamTypes... p) {
-    interpreter()->Reset();
-    std::array<WasmValue, sizeof...(p)> args{{WasmValueInitializer(p)...}};
-    interpreter()->InitFrame(function(), args.data());
-    interpreter()->Run();
-    CHECK_GT(interpreter()->NumInterpretedCalls(), 0);
-    if (interpreter()->state() == WasmInterpreter::FINISHED) {
-      WasmValue val = interpreter()->GetReturnValue();
-      possible_nondeterminism_ |= interpreter()->PossibleNondeterminism();
-      return val.to<ReturnType>();
-    } else if (interpreter()->state() == WasmInterpreter::TRAPPED) {
-      // TODO(titzer): return the correct trap code
-      int64_t result = 0xDEADBEEFDEADBEEF;
-      return static_cast<ReturnType>(result);
-    } else {
-      // TODO(titzer): falling off end
-      return ReturnType{0};
+
+    // Otherwise it must be a number (Smi or HeapNumber).
+    CHECK(IsNumber(*result));
+    double value = Object::Number(*result);
+    // The JS API interprets all Wasm values as signed, hence we cast via the
+    // signed equivalent type to avoid undefined behaviour in the casting.
+    if constexpr (std::is_integral_v<ReturnType> &&
+                  std::is_unsigned_v<ReturnType>) {
+      using signed_t = std::make_signed_t<ReturnType>;
+      return static_cast<ReturnType>(static_cast<signed_t>(value));
     }
+    return static_cast<ReturnType>(value);
   }
 
   void CheckCallViaJS(double expected, ParamTypes... p) {
-    Isolate* isolate = builder_.isolate();
-    // MSVC doesn't allow empty arrays, so include a dummy at the end.
-    Handle<Object> buffer[] = {isolate->factory()->NewNumber(p)...,
-                               Handle<Object>()};
-    CheckCallApplyViaJS(expected, function()->func_index, buffer, sizeof...(p));
+    // TODO(clemensb): Inline into callers; use {Call} and {CHECK_EQ} directly.
+    ReturnType result = Call(p...);
+    if constexpr (std::is_floating_point_v<ReturnType>) {
+      if (std::isnan(result)) {
+        CHECK(IsSameNan(static_cast<ReturnType>(expected), result));
+        return;
+      }
+    }
+    CHECK_EQ(expected, result);
   }
 
   void CheckCallViaJSTraps(ParamTypes... p) {
-    CheckCallViaJS(static_cast<double>(0xDEADBEEF), p...);
+    std::array<Handle<Object>, sizeof...(p)> param_objs = {MakeParam(p)...};
+    MaybeHandle<Object> retval =
+        CallViaJS(function()->func_index, base::VectorOf(param_objs));
+    CHECK(retval.is_null());
   }
 
   void SetMaxSteps(int n) { builder_.set_max_steps(n); }
@@ -670,9 +588,6 @@ class WasmRunner : public WasmRunnerBase {
     RunWasm_##name(TestExecutionTier::kTurbofan);                              \
   }                                                                            \
   TEST(RunWasmLiftoff_##name) { RunWasm_##name(TestExecutionTier::kLiftoff); } \
-  TEST(RunWasmInterpreter_##name) {                                            \
-    RunWasm_##name(TestExecutionTier::kInterpreter);                           \
-  }                                                                            \
   void RunWasm_##name(TestExecutionTier execution_tier)
 
 #define UNINITIALIZED_WASM_EXEC_TEST(name)               \
@@ -683,9 +598,6 @@ class WasmRunner : public WasmRunnerBase {
   UNINITIALIZED_TEST(RunWasmLiftoff_##name) {            \
     RunWasm_##name(TestExecutionTier::kLiftoff);         \
   }                                                      \
-  UNINITIALIZED_TEST(RunWasmInterpreter_##name) {        \
-    RunWasm_##name(TestExecutionTier::kInterpreter);     \
-  }                                                      \
   void RunWasm_##name(TestExecutionTier execution_tier)
 
 #define WASM_COMPILED_EXEC_TEST(name)                                          \
@@ -696,8 +608,6 @@ class WasmRunner : public WasmRunnerBase {
   TEST(RunWasmLiftoff_##name) { RunWasm_##name(TestExecutionTier::kLiftoff); } \
   void RunWasm_##name(TestExecutionTier execution_tier)
 
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
 
 #endif
diff --git a/deps/v8/test/cctest/wasm/wasm-simd-utils.cc b/deps/v8/test/cctest/wasm/wasm-simd-utils.cc
index 44dc6ce0751566..29feb43ff742e2 100644
--- a/deps/v8/test/cctest/wasm/wasm-simd-utils.cc
+++ b/deps/v8/test/cctest/wasm/wasm-simd-utils.cc
@@ -28,8 +28,8 @@ void RunI8x16UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   int8_t* g = r.builder().AddGlobal<int8_t>(kWasmS128);
   // Build fn to splat test value, perform unop, and write the result.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(opcode, WASM_LOCAL_GET(temp1))),
            WASM_ONE});
@@ -43,6 +43,45 @@ void RunI8x16UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunI8x32UnOpRevecTest(WasmOpcode opcode, Int8UnOp expected_op,
+                           compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  int8_t* memory = r.builder().AddMemoryElems<int8_t>(64);
+  // Build fn to load a I8x32 vector with test value, perform unop, and write
+  // the result to another array.
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)))),
+      WASM_LOCAL_SET(
+          temp2, WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM_OFFSET(
+                                            offset, WASM_LOCAL_GET(param1)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_INT8_INPUTS(x) {
+    r.builder().WriteMemory(&memory[1], x);
+    r.builder().WriteMemory(&memory[18], x);
+    r.Call(0, 32);
+    int8_t expected = expected_op(x);
+    CHECK_EQ(expected, memory[33]);
+    CHECK_EQ(expected, memory[50]);
+  }
+}
+#endif
+
 template <typename T, typename OpType>
 void RunI8x16BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                        OpType expected_op) {
@@ -50,9 +89,9 @@ void RunI8x16BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   T* g = r.builder().template AddGlobal<T>(kWasmS128);
   // Build fn to splat test values, perform binop, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -77,6 +116,69 @@ template void RunI8x16BinOpTest<int8_t>(TestExecutionTier, WasmOpcode,
 template void RunI8x16BinOpTest<uint8_t>(TestExecutionTier, WasmOpcode,
                                          Uint8BinOp);
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+template <typename T, typename OpType>
+void RunI8x32BinOpRevecTest(WasmOpcode opcode, OpType expected_op,
+                            compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  T* memory = r.builder().AddMemoryElems<T>(96);
+  // Build fn perform binary operation on two 256 bit vectors a and b,
+  // store the result in c:
+  //   simd128 *a,*b,*c;
+  //   *c = *a bin_op *b;
+  //   *(c+1) = *(a+1) bin_op *(b+1);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_BINOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                          WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2)))),
+      WASM_LOCAL_SET(
+          temp2,
+          WASM_SIMD_BINOP(
+              opcode, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param1)),
+              WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param2)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  for (T x : compiler::ValueHelper::GetVector<T>()) {
+    for (T y : compiler::ValueHelper::GetVector<T>()) {
+      for (int i = 0; i < 16; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+        r.builder().WriteMemory(&memory[i + 16], x);
+        r.builder().WriteMemory(&memory[i + 32], y);
+        r.builder().WriteMemory(&memory[i + 48], y);
+      }
+      r.Call(0, 32, 64);
+      T expected = expected_op(x, y);
+      for (int i = 0; i < 16; i++) {
+        CHECK_EQ(expected, memory[i + 64]);
+        CHECK_EQ(expected, memory[i + 80]);
+      }
+    }
+  }
+}
+
+// Explicit instantiations of uses.
+template void RunI8x32BinOpRevecTest<int8_t>(
+    WasmOpcode, Int8BinOp, compiler::IrOpcode::Value revec_opcode);
+
+template void RunI8x32BinOpRevecTest<uint8_t>(
+    WasmOpcode, Uint8BinOp, compiler::IrOpcode::Value revec_opcode);
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 void RunI8x16ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                          Int8ShiftOp expected_op) {
   // Intentionally shift by 8, should be no-op.
@@ -85,8 +187,8 @@ void RunI8x16ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
     int32_t* memory = r.builder().AddMemoryElems<int32_t>(1);
     int8_t* g_imm = r.builder().AddGlobal<int8_t>(kWasmS128);
     int8_t* g_mem = r.builder().AddGlobal<int8_t>(kWasmS128);
-    byte value = 0;
-    byte simd = r.AllocateLocal(kWasmS128);
+    uint8_t value = 0;
+    uint8_t simd = r.AllocateLocal(kWasmS128);
     // Shift using an immediate, and shift using a value loaded from memory.
     r.Build({WASM_LOCAL_SET(simd, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value))),
              WASM_GLOBAL_SET(0, WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(simd),
@@ -112,10 +214,10 @@ void RunI8x16ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
 void RunI8x16MixedRelationalOpTest(TestExecutionTier execution_tier,
                                    WasmOpcode opcode, Int8BinOp expected_op) {
   WasmRunner<int32_t, int32_t, int32_t> r(execution_tier);
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
-  byte temp3 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I8x16_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_LOCAL_SET(temp3, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -136,8 +238,8 @@ void RunI16x8UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   int16_t* g = r.builder().AddGlobal<int16_t>(kWasmS128);
   // Build fn to splat test value, perform unop, and write the result.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(opcode, WASM_LOCAL_GET(temp1))),
            WASM_ONE});
@@ -151,6 +253,45 @@ void RunI16x8UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunI16x16UnOpRevecTest(WasmOpcode opcode, Int16UnOp expected_op,
+                            compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  int16_t* memory = r.builder().AddMemoryElems<int16_t>(32);
+  // Build fn to load a I16x16 vector with test value, perform unop, and write
+  // the result to another array.
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)))),
+      WASM_LOCAL_SET(
+          temp2, WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM_OFFSET(
+                                            offset, WASM_LOCAL_GET(param1)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_INT16_INPUTS(x) {
+    r.builder().WriteMemory(&memory[1], x);
+    r.builder().WriteMemory(&memory[10], x);
+    r.Call(0, 32);
+    int16_t expected = expected_op(x);
+    CHECK_EQ(expected, memory[17]);
+    CHECK_EQ(expected, memory[26]);
+  }
+}
+#endif
+
 template <typename T, typename OpType>
 void RunI16x8BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                        OpType expected_op) {
@@ -158,9 +299,9 @@ void RunI16x8BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   T* g = r.builder().template AddGlobal<T>(kWasmS128);
   // Build fn to splat test values, perform binop, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -184,6 +325,69 @@ template void RunI16x8BinOpTest<int16_t>(TestExecutionTier, WasmOpcode,
 template void RunI16x8BinOpTest<uint16_t>(TestExecutionTier, WasmOpcode,
                                           Uint16BinOp);
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+template <typename T, typename OpType>
+void RunI16x16BinOpRevecTest(WasmOpcode opcode, OpType expected_op,
+                             compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  T* memory = r.builder().AddMemoryElems<T>(48);
+  // Build fn perform binary operation on two 256 bit vectors a and b,
+  // store the result in c:
+  //   simd128 *a,*b,*c;
+  //   *c = *a bin_op *b;
+  //   *(c+1) = *(a+1) bin_op *(b+1);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_BINOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                          WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2)))),
+      WASM_LOCAL_SET(
+          temp2,
+          WASM_SIMD_BINOP(
+              opcode, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param1)),
+              WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param2)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  for (T x : compiler::ValueHelper::GetVector<T>()) {
+    for (T y : compiler::ValueHelper::GetVector<T>()) {
+      for (int i = 0; i < 8; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+        r.builder().WriteMemory(&memory[i + 8], x);
+        r.builder().WriteMemory(&memory[i + 16], y);
+        r.builder().WriteMemory(&memory[i + 24], y);
+      }
+      r.Call(0, 32, 64);
+      T expected = expected_op(x, y);
+      for (int i = 0; i < 8; i++) {
+        CHECK_EQ(expected, memory[i + 32]);
+        CHECK_EQ(expected, memory[i + 40]);
+      }
+    }
+  }
+}
+
+// Explicit instantiations of uses.
+template void RunI16x16BinOpRevecTest<int16_t>(
+    WasmOpcode, Int16BinOp, compiler::IrOpcode::Value revec_opcode);
+
+template void RunI16x16BinOpRevecTest<uint16_t>(
+    WasmOpcode, Uint16BinOp, compiler::IrOpcode::Value revec_opcode);
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 void RunI16x8ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                          Int16ShiftOp expected_op) {
   // Intentionally shift by 16, should be no-op.
@@ -192,8 +396,8 @@ void RunI16x8ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
     int32_t* memory = r.builder().AddMemoryElems<int32_t>(1);
     int16_t* g_imm = r.builder().AddGlobal<int16_t>(kWasmS128);
     int16_t* g_mem = r.builder().AddGlobal<int16_t>(kWasmS128);
-    byte value = 0;
-    byte simd = r.AllocateLocal(kWasmS128);
+    uint8_t value = 0;
+    uint8_t simd = r.AllocateLocal(kWasmS128);
     // Shift using an immediate, and shift using a value loaded from memory.
     r.Build({WASM_LOCAL_SET(simd, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value))),
              WASM_GLOBAL_SET(0, WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(simd),
@@ -216,13 +420,67 @@ void RunI16x8ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunI16x16ShiftOpRevecTest(WasmOpcode opcode, Int16ShiftOp expected_op,
+                               compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  for (int shift = 1; shift <= 8; shift++) {
+    WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+    int16_t* memory = r.builder().AddMemoryElems<int16_t>(34);
+    // Build fn to load an I16x16 vector with test value, shift using an
+    // immediate and a value loaded from memory. Write the result to another
+    // array.
+    uint8_t param1 = 0;
+    uint8_t param2 = 1;
+    uint8_t temp1 = r.AllocateLocal(kWasmI32);
+    uint8_t temp2 = r.AllocateLocal(kWasmS128);
+    uint8_t temp3 = r.AllocateLocal(kWasmS128);
+    constexpr uint8_t offset = 16;
+
+    BUILD_AND_CHECK_REVEC_NODE(
+        r, revec_opcode,
+        WASM_LOCAL_SET(temp2,
+                       WASM_SIMD_SHIFT_OP(
+                           opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                           WASM_I32V(shift))),
+        WASM_LOCAL_SET(temp3,
+                       WASM_SIMD_SHIFT_OP(opcode,
+                                          WASM_SIMD_LOAD_MEM_OFFSET(
+                                              offset, WASM_LOCAL_GET(param1)),
+                                          WASM_I32V(shift))),
+        WASM_LOCAL_SET(temp1,
+                       WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V(64))),
+        WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2),
+                            WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(temp2),
+                                               WASM_LOCAL_GET(temp1))),
+        WASM_SIMD_STORE_MEM_OFFSET(
+            offset, WASM_LOCAL_GET(param2),
+            WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(temp3),
+                               WASM_LOCAL_GET(temp1))),
+        WASM_ONE);
+
+    r.builder().WriteMemory(reinterpret_cast<int32_t*>(&memory[32]), shift);
+    FOR_INT16_INPUTS(x) {
+      r.builder().WriteMemory(&memory[1], x);
+      r.builder().WriteMemory(&memory[10], x);
+      r.Call(0, 32);
+      // Shift twice
+      int16_t expected = expected_op(expected_op(x, shift), shift);
+      CHECK_EQ(expected, memory[17]);
+      CHECK_EQ(expected, memory[26]);
+    }
+  }
+}
+#endif
+
 void RunI16x8MixedRelationalOpTest(TestExecutionTier execution_tier,
                                    WasmOpcode opcode, Int16BinOp expected_op) {
   WasmRunner<int32_t, int32_t, int32_t> r(execution_tier);
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
-  byte temp3 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t temp3 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I16x8_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_LOCAL_SET(temp3, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -243,8 +501,8 @@ void RunI32x4UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   int32_t* g = r.builder().AddGlobal<int32_t>(kWasmS128);
   // Build fn to splat test value, perform unop, and write the result.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(opcode, WASM_LOCAL_GET(temp1))),
            WASM_ONE});
@@ -258,15 +516,54 @@ void RunI32x4UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunI32x8UnOpRevecTest(WasmOpcode opcode, Int32UnOp expected_op,
+                           compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  int32_t* memory = r.builder().AddMemoryElems<int32_t>(16);
+  // Build fn to load a I32x8 vector with test value, perform unop, and write
+  // the result to another array.
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)))),
+      WASM_LOCAL_SET(
+          temp2, WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM_OFFSET(
+                                            offset, WASM_LOCAL_GET(param1)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_INT32_INPUTS(x) {
+    r.builder().WriteMemory(&memory[1], x);
+    r.builder().WriteMemory(&memory[6], x);
+    r.Call(0, 32);
+    int32_t expected = expected_op(x);
+    CHECK_EQ(expected, memory[9]);
+    CHECK_EQ(expected, memory[14]);
+  }
+}
+#endif
+
 void RunI32x4BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                        Int32BinOp expected_op) {
   WasmRunner<int32_t, int32_t, int32_t> r(execution_tier);
   // Global to hold output.
   int32_t* g = r.builder().AddGlobal<int32_t>(kWasmS128);
   // Build fn to splat test values, perform binop, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -284,6 +581,69 @@ void RunI32x4BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+template <typename T, typename OpType>
+void RunI32x8BinOpRevecTest(WasmOpcode opcode, OpType expected_op,
+                            compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  T* memory = r.builder().AddMemoryElems<T>(24);
+  // Build fn perform binary operation on two 256 bit vectors a and b,
+  // store the result in c:
+  //   simd128 *a,*b,*c;
+  //   *c = *a bin_op *b;
+  //   *(c+1) = *(a+1) bin_op *(b+1);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_BINOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                          WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2)))),
+      WASM_LOCAL_SET(
+          temp2,
+          WASM_SIMD_BINOP(
+              opcode, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param1)),
+              WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param2)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  for (T x : compiler::ValueHelper::GetVector<T>()) {
+    for (T y : compiler::ValueHelper::GetVector<T>()) {
+      for (int i = 0; i < 4; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+        r.builder().WriteMemory(&memory[i + 4], x);
+        r.builder().WriteMemory(&memory[i + 8], y);
+        r.builder().WriteMemory(&memory[i + 12], y);
+      }
+      r.Call(0, 32, 64);
+      T expected = expected_op(x, y);
+      for (int i = 0; i < 4; i++) {
+        CHECK_EQ(expected, memory[i + 16]);
+        CHECK_EQ(expected, memory[i + 20]);
+      }
+    }
+  }
+}
+
+// Explicit instantiations of uses.
+template void RunI32x8BinOpRevecTest<int32_t>(WasmOpcode, Int32BinOp,
+                                              compiler::IrOpcode::Value);
+
+template void RunI32x8BinOpRevecTest<uint32_t>(WasmOpcode, Uint32BinOp,
+                                               compiler::IrOpcode::Value);
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 void RunI32x4ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                          Int32ShiftOp expected_op) {
   // Intentionally shift by 32, should be no-op.
@@ -292,8 +652,8 @@ void RunI32x4ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
     int32_t* memory = r.builder().AddMemoryElems<int32_t>(1);
     int32_t* g_imm = r.builder().AddGlobal<int32_t>(kWasmS128);
     int32_t* g_mem = r.builder().AddGlobal<int32_t>(kWasmS128);
-    byte value = 0;
-    byte simd = r.AllocateLocal(kWasmS128);
+    uint8_t value = 0;
+    uint8_t simd = r.AllocateLocal(kWasmS128);
     // Shift using an immediate, and shift using a value loaded from memory.
     r.Build({WASM_LOCAL_SET(simd, WASM_SIMD_I32x4_SPLAT(WASM_LOCAL_GET(value))),
              WASM_GLOBAL_SET(0, WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(simd),
@@ -316,14 +676,68 @@ void RunI32x4ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunI32x8ShiftOpRevecTest(WasmOpcode opcode, Int32ShiftOp expected_op,
+                              compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  for (int shift = 1; shift <= 16; shift++) {
+    WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+    int32_t* memory = r.builder().AddMemoryElems<int32_t>(17);
+    // Build fn to load an I32x8 vector with test value, shift using an
+    // immediate and a value loaded from memory. Write the result to another
+    // array.
+    uint8_t param1 = 0;
+    uint8_t param2 = 1;
+    uint8_t temp1 = r.AllocateLocal(kWasmI32);
+    uint8_t temp2 = r.AllocateLocal(kWasmS128);
+    uint8_t temp3 = r.AllocateLocal(kWasmS128);
+    constexpr uint8_t offset = 16;
+
+    BUILD_AND_CHECK_REVEC_NODE(
+        r, revec_opcode,
+        WASM_LOCAL_SET(temp2,
+                       WASM_SIMD_SHIFT_OP(
+                           opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                           WASM_I32V(shift))),
+        WASM_LOCAL_SET(temp3,
+                       WASM_SIMD_SHIFT_OP(opcode,
+                                          WASM_SIMD_LOAD_MEM_OFFSET(
+                                              offset, WASM_LOCAL_GET(param1)),
+                                          WASM_I32V(shift))),
+        WASM_LOCAL_SET(temp1,
+                       WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V(64))),
+        WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2),
+                            WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(temp2),
+                                               WASM_LOCAL_GET(temp1))),
+        WASM_SIMD_STORE_MEM_OFFSET(
+            offset, WASM_LOCAL_GET(param2),
+            WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(temp3),
+                               WASM_LOCAL_GET(temp1))),
+        WASM_ONE);
+
+    r.builder().WriteMemory(&memory[16], shift);
+    FOR_INT32_INPUTS(x) {
+      r.builder().WriteMemory(&memory[1], x);
+      r.builder().WriteMemory(&memory[6], x);
+      r.Call(0, 32);
+      // Shift twice
+      int32_t expected = expected_op(expected_op(x, shift), shift);
+      CHECK_EQ(expected, memory[9]);
+      CHECK_EQ(expected, memory[14]);
+    }
+  }
+}
+#endif
+
 void RunI64x2UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                       Int64UnOp expected_op) {
   WasmRunner<int32_t, int64_t> r(execution_tier);
   // Global to hold output.
   int64_t* g = r.builder().AddGlobal<int64_t>(kWasmS128);
   // Build fn to splat test value, perform unop, and write the result.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I64x2_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(opcode, WASM_LOCAL_GET(temp1))),
            WASM_ONE});
@@ -343,9 +757,9 @@ void RunI64x2BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   int64_t* g = r.builder().AddGlobal<int64_t>(kWasmS128);
   // Build fn to splat test values, perform binop, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_I64x2_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_I64x2_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -363,6 +777,61 @@ void RunI64x2BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunI64x4BinOpRevecTest(WasmOpcode opcode, Int64BinOp expected_op,
+                            compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  int64_t* memory = r.builder().AddMemoryElems<int64_t>(12);
+  // Build fn perform binary operation on two 256 bit vectors a and b,
+  // store the result in c:
+  //   simd128 *a,*b,*c;
+  //   *c = *a bin_op *b;
+  //   *(c+1) = *(a+1) bin_op *(b+1);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_BINOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                          WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2)))),
+      WASM_LOCAL_SET(
+          temp2,
+          WASM_SIMD_BINOP(
+              opcode, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param1)),
+              WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param2)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_INT64_INPUTS(x) {
+    FOR_INT64_INPUTS(y) {
+      for (int i = 0; i < 2; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+        r.builder().WriteMemory(&memory[i + 2], x);
+        r.builder().WriteMemory(&memory[i + 4], y);
+        r.builder().WriteMemory(&memory[i + 6], y);
+      }
+      r.Call(0, 32, 64);
+      int64_t expected = expected_op(x, y);
+      for (int i = 0; i < 2; i++) {
+        CHECK_EQ(expected, memory[i + 8]);
+        CHECK_EQ(expected, memory[i + 10]);
+      }
+    }
+  }
+}
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 void RunI64x2ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                          Int64ShiftOp expected_op) {
   // Intentionally shift by 64, should be no-op.
@@ -371,8 +840,8 @@ void RunI64x2ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
     int32_t* memory = r.builder().AddMemoryElems<int32_t>(1);
     int64_t* g_imm = r.builder().AddGlobal<int64_t>(kWasmS128);
     int64_t* g_mem = r.builder().AddGlobal<int64_t>(kWasmS128);
-    byte value = 0;
-    byte simd = r.AllocateLocal(kWasmS128);
+    uint8_t value = 0;
+    uint8_t simd = r.AllocateLocal(kWasmS128);
     // Shift using an immediate, and shift using a value loaded from memory.
     r.Build({WASM_LOCAL_SET(simd, WASM_SIMD_I64x2_SPLAT(WASM_LOCAL_GET(value))),
              WASM_GLOBAL_SET(0, WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(simd),
@@ -395,6 +864,60 @@ void RunI64x2ShiftOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunI64x4ShiftOpRevecTest(WasmOpcode opcode, Int64ShiftOp expected_op,
+                              compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  for (int shift = 1; shift <= 32; shift++) {
+    WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+    int64_t* memory = r.builder().AddMemoryElems<int64_t>(9);
+    // Build fn to load an I64x4 vector with test value, shift using an
+    // immediate and a value loaded from memory. Write the result to another
+    // array.
+    uint8_t param1 = 0;
+    uint8_t param2 = 1;
+    uint8_t temp1 = r.AllocateLocal(kWasmI32);
+    uint8_t temp2 = r.AllocateLocal(kWasmS128);
+    uint8_t temp3 = r.AllocateLocal(kWasmS128);
+    constexpr uint8_t offset = 16;
+
+    BUILD_AND_CHECK_REVEC_NODE(
+        r, revec_opcode,
+        WASM_LOCAL_SET(temp2,
+                       WASM_SIMD_SHIFT_OP(
+                           opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                           WASM_I32V(shift))),
+        WASM_LOCAL_SET(temp3,
+                       WASM_SIMD_SHIFT_OP(opcode,
+                                          WASM_SIMD_LOAD_MEM_OFFSET(
+                                              offset, WASM_LOCAL_GET(param1)),
+                                          WASM_I32V(shift))),
+        WASM_LOCAL_SET(temp1,
+                       WASM_LOAD_MEM(MachineType::Int32(), WASM_I32V(64))),
+        WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2),
+                            WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(temp2),
+                                               WASM_LOCAL_GET(temp1))),
+        WASM_SIMD_STORE_MEM_OFFSET(
+            offset, WASM_LOCAL_GET(param2),
+            WASM_SIMD_SHIFT_OP(opcode, WASM_LOCAL_GET(temp3),
+                               WASM_LOCAL_GET(temp1))),
+        WASM_ONE);
+
+    r.builder().WriteMemory(reinterpret_cast<int32_t*>(&memory[8]), shift);
+    FOR_INT64_INPUTS(x) {
+      r.builder().WriteMemory(&memory[0], x);
+      r.builder().WriteMemory(&memory[3], x);
+      r.Call(0, 32);
+      // Shift twice
+      int64_t expected = expected_op(expected_op(x, shift), shift);
+      CHECK_EQ(expected, memory[4]);
+      CHECK_EQ(expected, memory[7]);
+    }
+  }
+}
+#endif
+
 bool IsExtreme(float x) {
   float abs_x = std::fabs(x);
   const float kSmallFloatThreshold = 1.0e-32f;
@@ -446,8 +969,8 @@ void RunF32x4UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   float* g = r.builder().AddGlobal<float>(kWasmS128);
   // Build fn to splat test value, perform unop, and write the result.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(opcode, WASM_LOCAL_GET(temp1))),
            WASM_ONE});
@@ -484,6 +1007,63 @@ void RunF32x4UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunF32x8UnOpRevecTest(WasmOpcode opcode, FloatUnOp expected_op,
+                           compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  float* memory = r.builder().AddMemoryElems<float>(16);
+  // Build fn to load a F32x8 vector with test value, perform unop, and write
+  // the result to another array.
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)))),
+      WASM_LOCAL_SET(
+          temp2, WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM_OFFSET(
+                                            offset, WASM_LOCAL_GET(param1)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_FLOAT32_INPUTS(x) {
+    if (!PlatformCanRepresent(x)) continue;
+    float expected = expected_op(x);
+#if V8_OS_AIX
+    if (!MightReverseSign<FloatUnOp>(expected_op))
+      expected = FpOpWorkaround<float>(x, expected);
+#endif
+    if (!PlatformCanRepresent(expected)) continue;
+    r.builder().WriteMemory(&memory[1], x);
+    r.builder().WriteMemory(&memory[6], x);
+    r.Call(0, 32);
+    CheckFloatResult(x, x, expected, memory[9]);
+    CheckFloatResult(x, x, expected, memory[14]);
+  }
+
+  FOR_FLOAT32_NAN_INPUTS(f) {
+    float x = base::bit_cast<float>(nan_test_array[f]);
+    if (!PlatformCanRepresent(x)) continue;
+    float expected = expected_op(x);
+    if (!PlatformCanRepresent(expected)) continue;
+    r.builder().WriteMemory(&memory[1], x);
+    r.builder().WriteMemory(&memory[6], x);
+    r.Call(0, 32);
+    CheckFloatResult(x, x, expected, memory[9]);
+    CheckFloatResult(x, x, expected, memory[14]);
+  }
+}
+#endif
+
 namespace {
 // Relaxed-simd operations are deterministic only for some range of values.
 // Exclude those from being tested. Currently this is only used for f32x4, f64x2
@@ -505,9 +1085,9 @@ void RunF32x4BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   float* g = r.builder().AddGlobal<float>(kWasmS128);
   // Build fn to splat test values, perform binop, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -547,15 +1127,96 @@ void RunF32x4BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunF32x8BinOpRevecTest(WasmOpcode opcode, FloatBinOp expected_op,
+                            compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  float* memory = r.builder().AddMemoryElems<float>(24);
+  // Build fn perform binary operation on two 256 bit vectors a and b,
+  // store the result in c:
+  //   simd128 *a,*b,*c;
+  //   *c = *a bin_op *b;
+  //   *(c+1) = *(a+1) bin_op *(b+1);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_BINOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                          WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2)))),
+      WASM_LOCAL_SET(
+          temp2,
+          WASM_SIMD_BINOP(
+              opcode, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param1)),
+              WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param2)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_FLOAT32_INPUTS(x) {
+    if (!PlatformCanRepresent(x)) continue;
+    FOR_FLOAT32_INPUTS(y) {
+      if (!PlatformCanRepresent(y)) continue;
+      if (ShouldSkipTestingConstants(opcode, x, y)) continue;
+      float expected = expected_op(x, y);
+      if (!PlatformCanRepresent(expected)) continue;
+      for (int i = 0; i < 4; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+        r.builder().WriteMemory(&memory[i + 4], x);
+        r.builder().WriteMemory(&memory[i + 8], y);
+        r.builder().WriteMemory(&memory[i + 12], y);
+      }
+      r.Call(0, 32, 64);
+      for (int i = 0; i < 4; i++) {
+        CheckFloatResult(x, y, expected, memory[i + 16], true /* exact */);
+        CheckFloatResult(x, y, expected, memory[i + 20], true /* exact */);
+      }
+    }
+  }
+
+  FOR_FLOAT32_NAN_INPUTS(f) {
+    float x = base::bit_cast<float>(nan_test_array[f]);
+    if (!PlatformCanRepresent(x)) continue;
+    FOR_FLOAT32_NAN_INPUTS(j) {
+      float y = base::bit_cast<float>(nan_test_array[j]);
+      if (!PlatformCanRepresent(y)) continue;
+      float expected = expected_op(x, y);
+      if (!PlatformCanRepresent(expected)) continue;
+      for (int i = 0; i < 4; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+        r.builder().WriteMemory(&memory[i + 4], x);
+        r.builder().WriteMemory(&memory[i + 8], y);
+        r.builder().WriteMemory(&memory[i + 12], y);
+      }
+      r.Call(0, 32, 64);
+      for (int i = 0; i < 4; i++) {
+        CheckFloatResult(x, y, expected, memory[i + 16], true /* exact */);
+        CheckFloatResult(x, y, expected, memory[i + 20], true /* exact */);
+      }
+    }
+  }
+}
+#endif
+
 void RunF32x4CompareOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                            FloatCompareOp expected_op) {
   WasmRunner<int32_t, float, float> r(execution_tier);
   // Set up global to hold mask output.
   int32_t* g = r.builder().AddGlobal<int32_t>(kWasmS128);
   // Build fn to splat test values, perform compare op, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_F32x4_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -628,8 +1289,8 @@ void RunF64x2UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   // Global to hold output.
   double* g = r.builder().AddGlobal<double>(kWasmS128);
   // Build fn to splat test value, perform unop, and write the result.
-  byte value = 0;
-  byte temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t value = 0;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(value))),
            WASM_GLOBAL_SET(0, WASM_SIMD_UNOP(opcode, WASM_LOCAL_GET(temp1))),
            WASM_ONE});
@@ -666,15 +1327,72 @@ void RunF64x2UnOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunF64x4UnOpRevecTest(WasmOpcode opcode, DoubleUnOp expected_op,
+                           compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t> r(TestExecutionTier::kTurbofan);
+  double* memory = r.builder().AddMemoryElems<double>(8);
+  // Build fn to load a F64x4 vector with test value, perform unop, and write
+  // the result to another array.
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)))),
+      WASM_LOCAL_SET(
+          temp2, WASM_SIMD_UNOP(opcode, WASM_SIMD_LOAD_MEM_OFFSET(
+                                            offset, WASM_LOCAL_GET(param1)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param2), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param2),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_FLOAT64_INPUTS(x) {
+    if (!PlatformCanRepresent(x)) continue;
+    double expected = expected_op(x);
+#if V8_OS_AIX
+    if (!MightReverseSign<DoubleUnOp>(expected_op))
+      expected = FpOpWorkaround<double>(x, expected);
+#endif
+    if (!PlatformCanRepresent(expected)) continue;
+    r.builder().WriteMemory(&memory[0], x);
+    r.builder().WriteMemory(&memory[3], x);
+    r.Call(0, 32);
+    CheckDoubleResult(x, x, expected, memory[4]);
+    CheckDoubleResult(x, x, expected, memory[7]);
+  }
+
+  FOR_FLOAT64_NAN_INPUTS(d) {
+    double x = base::bit_cast<double>(double_nan_test_array[d]);
+    if (!PlatformCanRepresent(x)) continue;
+    double expected = expected_op(x);
+    if (!PlatformCanRepresent(expected)) continue;
+    r.builder().WriteMemory(&memory[0], x);
+    r.builder().WriteMemory(&memory[3], x);
+    r.Call(0, 32);
+    CheckDoubleResult(x, x, expected, memory[4]);
+    CheckDoubleResult(x, x, expected, memory[7]);
+  }
+}
+#endif
+
 void RunF64x2BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                        DoubleBinOp expected_op) {
   WasmRunner<int32_t, double, double> r(execution_tier);
   // Global to hold output.
   double* g = r.builder().AddGlobal<double>(kWasmS128);
   // Build fn to splat test value, perform binop, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(value1))),
            WASM_LOCAL_SET(temp2, WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(value2))),
            WASM_GLOBAL_SET(0, WASM_SIMD_BINOP(opcode, WASM_LOCAL_GET(temp1),
@@ -713,15 +1431,96 @@ void RunF64x2BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
   }
 }
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunF64x4BinOpRevecTest(WasmOpcode opcode, DoubleBinOp expected_op,
+                            compiler::IrOpcode::Value revec_opcode) {
+  EXPERIMENTAL_FLAG_SCOPE(revectorize);
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+  WasmRunner<int32_t, int32_t, int32_t, int32_t> r(
+      TestExecutionTier::kTurbofan);
+  double* memory = r.builder().AddMemoryElems<double>(12);
+  // Build fn perform binary operation on two 256 bit vectors a and b,
+  // store the result in c:
+  //   simd128 *a,*b,*c;
+  //   *c = *a bin_op *b;
+  //   *(c+1) = *(a+1) bin_op *(b+1);
+  uint8_t param1 = 0;
+  uint8_t param2 = 1;
+  uint8_t param3 = 2;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
+  constexpr uint8_t offset = 16;
+
+  BUILD_AND_CHECK_REVEC_NODE(
+      r, revec_opcode,
+      WASM_LOCAL_SET(
+          temp1,
+          WASM_SIMD_BINOP(opcode, WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param1)),
+                          WASM_SIMD_LOAD_MEM(WASM_LOCAL_GET(param2)))),
+      WASM_LOCAL_SET(
+          temp2,
+          WASM_SIMD_BINOP(
+              opcode, WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param1)),
+              WASM_SIMD_LOAD_MEM_OFFSET(offset, WASM_LOCAL_GET(param2)))),
+      WASM_SIMD_STORE_MEM(WASM_LOCAL_GET(param3), WASM_LOCAL_GET(temp1)),
+      WASM_SIMD_STORE_MEM_OFFSET(offset, WASM_LOCAL_GET(param3),
+                                 WASM_LOCAL_GET(temp2)),
+      WASM_ONE);
+
+  FOR_FLOAT64_INPUTS(x) {
+    if (!PlatformCanRepresent(x)) continue;
+    FOR_FLOAT64_INPUTS(y) {
+      if (!PlatformCanRepresent(y)) continue;
+      if (ShouldSkipTestingConstants(opcode, x, y)) continue;
+      double expected = expected_op(x, y);
+      if (!PlatformCanRepresent(expected)) continue;
+      for (int i = 0; i < 2; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+        r.builder().WriteMemory(&memory[i + 2], x);
+        r.builder().WriteMemory(&memory[i + 4], y);
+        r.builder().WriteMemory(&memory[i + 6], y);
+      }
+      r.Call(0, 32, 64);
+      for (int i = 0; i < 2; i++) {
+        CheckDoubleResult(x, y, expected, memory[i + 8], true /* exact */);
+        CheckDoubleResult(x, y, expected, memory[i + 10], true /* exact */);
+      }
+    }
+  }
+
+  FOR_FLOAT64_NAN_INPUTS(f) {
+    double x = base::bit_cast<double>(double_nan_test_array[f]);
+    if (!PlatformCanRepresent(x)) continue;
+    FOR_FLOAT64_NAN_INPUTS(j) {
+      double y = base::bit_cast<double>(double_nan_test_array[j]);
+      if (!PlatformCanRepresent(y)) continue;
+      double expected = expected_op(x, y);
+      if (!PlatformCanRepresent(expected)) continue;
+      for (int i = 0; i < 2; i++) {
+        r.builder().WriteMemory(&memory[i], x);
+        r.builder().WriteMemory(&memory[i + 2], x);
+        r.builder().WriteMemory(&memory[i + 4], y);
+        r.builder().WriteMemory(&memory[i + 6], y);
+      }
+      r.Call(0, 32, 64);
+      for (int i = 0; i < 2; i++) {
+        CheckDoubleResult(x, y, expected, memory[i + 8], true /* exact */);
+        CheckDoubleResult(x, y, expected, memory[i + 10], true /* exact */);
+      }
+    }
+  }
+}
+#endif
+
 void RunF64x2CompareOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                            DoubleCompareOp expected_op) {
   WasmRunner<int32_t, double, double> r(execution_tier);
   // Set up global to hold mask output.
   int64_t* g = r.builder().AddGlobal<int64_t>(kWasmS128);
   // Build fn to splat test values, perform compare op, and write the result.
-  byte value1 = 0, value2 = 1;
-  byte temp1 = r.AllocateLocal(kWasmS128);
-  byte temp2 = r.AllocateLocal(kWasmS128);
+  uint8_t value1 = 0, value2 = 1;
+  uint8_t temp1 = r.AllocateLocal(kWasmS128);
+  uint8_t temp2 = r.AllocateLocal(kWasmS128);
   // Make the lanes of each temp compare differently:
   // temp1 = y, x and temp2 = y, y.
   r.Build({WASM_LOCAL_SET(temp1, WASM_SIMD_F64x2_SPLAT(WASM_LOCAL_GET(value1))),
diff --git a/deps/v8/test/cctest/wasm/wasm-simd-utils.h b/deps/v8/test/cctest/wasm/wasm-simd-utils.h
index a2b0f5ad2900f1..825aec4cdf612a 100644
--- a/deps/v8/test/cctest/wasm/wasm-simd-utils.h
+++ b/deps/v8/test/cctest/wasm/wasm-simd-utils.h
@@ -6,6 +6,8 @@
 #include <stdint.h>
 
 #include "src/base/macros.h"
+#include "src/compiler/node-observer.h"
+#include "src/compiler/opcodes.h"
 #include "src/wasm/compilation-environment.h"
 #include "src/wasm/wasm-opcodes.h"
 #include "test/cctest/wasm/wasm-run-utils.h"
@@ -13,6 +15,67 @@
 
 namespace v8 {
 namespace internal {
+
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+
+class SIMD256NodeObserver : public compiler::NodeObserver {
+ public:
+  explicit SIMD256NodeObserver(
+      std::function<void(const compiler::Node*)> handler)
+      : handler_(handler) {
+    DCHECK(handler_);
+  }
+
+  Observation OnNodeCreated(const compiler::Node* node) override {
+    handler_(node);
+    return Observation::kContinue;
+  }
+
+ private:
+  std::function<void(const compiler::Node*)> handler_;
+};
+
+class ObserveSIMD256Scope {
+ public:
+  explicit ObserveSIMD256Scope(Isolate* isolate,
+                               compiler::NodeObserver* node_observer)
+      : isolate_(isolate), node_observer_(node_observer) {
+    DCHECK_NOT_NULL(isolate_);
+    DCHECK_NULL(isolate_->node_observer());
+    isolate_->set_node_observer(node_observer_);
+  }
+
+  ~ObserveSIMD256Scope() {
+    DCHECK_NOT_NULL(isolate_->node_observer());
+    isolate_->set_node_observer(nullptr);
+  }
+
+  Isolate* isolate_;
+  compiler::NodeObserver* node_observer_;
+};
+
+// Build input wasm expressions and check if the revectorization success
+// (create the expected simd256 node).
+#define BUILD_AND_CHECK_REVEC_NODE(wasm_runner, expected_simd256_op, ...) \
+  bool find_expected_node = false;                                        \
+  SIMD256NodeObserver* observer =                                         \
+      wasm_runner.zone()->New<SIMD256NodeObserver>(                       \
+          [&](const compiler::Node* node) {                               \
+            if (node->opcode() == expected_simd256_op) {                  \
+              if (expected_simd256_op == compiler::IrOpcode::kStore &&    \
+                  StoreRepresentationOf(node->op()).representation() !=   \
+                      MachineRepresentation::kSimd256) {                  \
+                return;                                                   \
+              }                                                           \
+              find_expected_node = true;                                  \
+            }                                                             \
+          });                                                             \
+  ObserveSIMD256Scope scope(CcTest::InitIsolateOnce(), observer);         \
+  r.Build({__VA_ARGS__});                                                 \
+  CHECK(find_expected_node);
+
+#endif  // V8_ENABLE_WASM_SIMD256_REVEC
+
 namespace wasm {
 
 using Int8UnOp = int8_t (*)(int8_t);
@@ -27,6 +90,7 @@ using Uint16BinOp = uint16_t (*)(uint16_t, uint16_t);
 using Int16ShiftOp = int16_t (*)(int16_t, int);
 using Int32UnOp = int32_t (*)(int32_t);
 using Int32BinOp = int32_t (*)(int32_t, int32_t);
+using Uint32BinOp = uint32_t (*)(uint32_t, uint32_t);
 using Int32ShiftOp = int32_t (*)(int32_t, int);
 using Int64UnOp = int64_t (*)(int64_t);
 using Int64BinOp = int64_t (*)(int64_t, int64_t);
@@ -174,6 +238,47 @@ void RunF64x2BinOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
 void RunF64x2CompareOpTest(TestExecutionTier execution_tier, WasmOpcode opcode,
                            DoubleCompareOp expected_op);
 
+#ifdef V8_ENABLE_WASM_SIMD256_REVEC
+void RunI8x32UnOpRevecTest(WasmOpcode opcode, Int8UnOp expected_op,
+                           compiler::IrOpcode::Value revec_opcode);
+void RunI16x16UnOpRevecTest(WasmOpcode opcode, Int16UnOp expected_op,
+                            compiler::IrOpcode::Value revec_opcode);
+void RunI32x8UnOpRevecTest(WasmOpcode opcode, Int32UnOp expected_op,
+                           compiler::IrOpcode::Value revec_opcode);
+void RunF32x8UnOpRevecTest(WasmOpcode opcode, FloatUnOp expected_op,
+                           compiler::IrOpcode::Value revec_opcode);
+void RunF64x4UnOpRevecTest(WasmOpcode opcode, DoubleUnOp expected_op,
+                           compiler::IrOpcode::Value revec_opcode);
+
+template <typename T = int8_t, typename OpType = T (*)(T, T)>
+void RunI8x32BinOpRevecTest(WasmOpcode opcode, OpType expected_op,
+                            compiler::IrOpcode::Value revec_opcode);
+
+template <typename T = int16_t, typename OpType = T (*)(T, T)>
+void RunI16x16BinOpRevecTest(WasmOpcode opcode, OpType expected_op,
+                             compiler::IrOpcode::Value revec_opcode);
+
+template <typename T = int32_t, typename OpType = T (*)(T, T)>
+void RunI32x8BinOpRevecTest(WasmOpcode opcode, OpType expected_op,
+                            compiler::IrOpcode::Value revec_opcode);
+
+void RunI64x4BinOpRevecTest(WasmOpcode opcode, Int64BinOp expected_op,
+                            compiler::IrOpcode::Value revec_opcode);
+void RunF64x4BinOpRevecTest(WasmOpcode opcode, DoubleBinOp expected_op,
+                            compiler::IrOpcode::Value revec_opcode);
+void RunF32x8BinOpRevecTest(WasmOpcode opcode, FloatBinOp expected_op,
+                            compiler::IrOpcode::Value revec_opcode);
+
+void RunI16x16ShiftOpRevecTest(WasmOpcode opcode, Int16ShiftOp expected_op,
+                               compiler::IrOpcode::Value revec_opcode);
+void RunI32x8ShiftOpRevecTest(WasmOpcode opcode, Int32ShiftOp expected_op,
+                              compiler::IrOpcode::Value revec_opcode);
+void RunI64x4ShiftOpRevecTest(WasmOpcode opcode, Int64ShiftOp expected_op,
+                              compiler::IrOpcode::Value revec_opcode);
+
+// TODO(yuhengwei): Add revec test for IGeU, IGeS, INe and IGtU
+#endif
+
 }  // namespace wasm
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/common/assembler-tester.h b/deps/v8/test/common/assembler-tester.h
index 880d9839677fc9..053ec3ae2f09b6 100644
--- a/deps/v8/test/common/assembler-tester.h
+++ b/deps/v8/test/common/assembler-tester.h
@@ -30,8 +30,8 @@ class TestingAssemblerBuffer : public AssemblerBuffer {
 
   ~TestingAssemblerBuffer() override { reservation_.Free(); }
 
-  byte* start() const override {
-    return reinterpret_cast<byte*>(reservation_.address());
+  uint8_t* start() const override {
+    return reinterpret_cast<uint8_t*>(reservation_.address());
   }
 
   int size() const override { return static_cast<int>(reservation_.size()); }
diff --git a/deps/v8/test/common/c-signature.h b/deps/v8/test/common/c-signature.h
index b8cfdc97f2946a..a638348fb823cb 100644
--- a/deps/v8/test/common/c-signature.h
+++ b/deps/v8/test/common/c-signature.h
@@ -82,7 +82,7 @@ class CSignature : public MachineSignature {
     std::array<MachineType, param_count> param_arr{{params...}};
     const size_t buffer_size =
         param_count + (ret == MachineType::None() ? 0 : 1);
-    MachineType* buffer = zone->NewArray<MachineType>(buffer_size);
+    MachineType* buffer = zone->AllocateArray<MachineType>(buffer_size);
     size_t pos = 0;
     size_t return_count = 0;
     if (ret != MachineType::None()) {
diff --git a/deps/v8/test/common/call-tester.h b/deps/v8/test/common/call-tester.h
index 6659dc4caff51c..e30281d04d0d7c 100644
--- a/deps/v8/test/common/call-tester.h
+++ b/deps/v8/test/common/call-tester.h
@@ -42,28 +42,29 @@ class CallHelper {
 
 template <>
 template <typename... Params>
-Object CallHelper<Object>::Call(Params... args) {
+Tagged<Object> CallHelper<Tagged<Object>>::Call(Params... args) {
   CSignature::VerifyParams<Params...>(csig_);
   Address entry = Generate();
   auto fn = GeneratedCode<Address, Params...>::FromAddress(isolate_, entry);
-  return Object(fn.Call(args...));
+  return Tagged<Object>(fn.Call(args...));
 }
 
 // A call helper that calls the given code object assuming C calling convention.
 template <typename T>
 class CodeRunner : public CallHelper<T> {
  public:
-  CodeRunner(Isolate* isolate, Handle<InstructionStream> code,
+  CodeRunner(Isolate* isolate, Handle<InstructionStream> istream,
              MachineSignature* csig)
-      : CallHelper<T>(isolate, csig), code_(code) {}
+      : CallHelper<T>(isolate, csig), istream_(istream) {}
   CodeRunner(Isolate* isolate, Handle<Code> code, MachineSignature* csig)
-      : CallHelper<T>(isolate, csig), code_(FromCode(*code), isolate) {}
+      : CallHelper<T>(isolate, csig),
+        istream_(code->instruction_stream(), isolate) {}
   ~CodeRunner() override = default;
 
-  Address Generate() override { return code_->entry(); }
+  Address Generate() override { return istream_->instruction_start(); }
 
  private:
-  Handle<InstructionStream> code_;
+  Handle<InstructionStream> istream_;
 };
 
 }  // namespace compiler
diff --git a/deps/v8/test/common/streaming-helper.h b/deps/v8/test/common/streaming-helper.h
new file mode 100644
index 00000000000000..cbd016ff45ad32
--- /dev/null
+++ b/deps/v8/test/common/streaming-helper.h
@@ -0,0 +1,58 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifndef V8_COMMON_STREAMING_HELPER_H_
+#define V8_COMMON_STREAMING_HELPER_H_
+
+#include "include/v8-script.h"
+
+namespace v8 {
+namespace internal {
+
+class TestSourceStream : public v8::ScriptCompiler::ExternalSourceStream {
+ public:
+  explicit TestSourceStream(const char** chunks) : chunks_(chunks), index_(0) {}
+
+  size_t GetMoreData(const uint8_t** src) override {
+    // Unlike in real use cases, this function will never block.
+    if (chunks_[index_] == nullptr) {
+      return 0;
+    }
+    // Copy the data, since the caller takes ownership of it.
+    size_t len = strlen(chunks_[index_]);
+    // We don't need to zero-terminate since we return the length.
+    uint8_t* copy = new uint8_t[len];
+    memcpy(copy, chunks_[index_], len);
+    *src = copy;
+    ++index_;
+    return len;
+  }
+
+  // Helper for constructing a string from chunks (the compilation needs it
+  // too).
+  static char* FullSourceString(const char** chunks) {
+    size_t total_len = 0;
+    for (size_t i = 0; chunks[i] != nullptr; ++i) {
+      total_len += strlen(chunks[i]);
+    }
+    char* full_string = new char[total_len + 1];
+    size_t offset = 0;
+    for (size_t i = 0; chunks[i] != nullptr; ++i) {
+      size_t len = strlen(chunks[i]);
+      memcpy(full_string + offset, chunks[i], len);
+      offset += len;
+    }
+    full_string[total_len] = 0;
+    return full_string;
+  }
+
+ private:
+  const char** chunks_;
+  unsigned index_;
+};
+
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_COMMON_STREAMING_HELPER_H_
diff --git a/deps/v8/test/common/types-fuzz.h b/deps/v8/test/common/types-fuzz.h
index eaed1ed364d62f..fb4c8ab2fa5b14 100644
--- a/deps/v8/test/common/types-fuzz.h
+++ b/deps/v8/test/common/types-fuzz.h
@@ -44,6 +44,7 @@ class Types {
   Types(Zone* zone, Isolate* isolate, v8::base::RandomNumberGenerator* rng)
       : zone_(zone),
         js_heap_broker_(isolate, zone),
+        js_heap_broker_scope_(&js_heap_broker_, isolate, zone),
         current_broker_(&js_heap_broker_),
         rng_(rng) {
 #define DECLARE_TYPE(name, value) \
@@ -52,25 +53,40 @@ class Types {
     PROPER_BITSET_TYPE_LIST(DECLARE_TYPE)
 #undef DECLARE_TYPE
 
+    // PersistentHandlesScope currently requires an active handle before it can
+    // be opened and they can't be nested.
+    // TODO(v8:13897): Remove once PersistentHandlesScopes can be opened
+    // uncontionally.
+    if (!PersistentHandlesScope::IsActive(isolate)) {
+      Handle<i::Object> dummy(ReadOnlyRoots(isolate->heap()).empty_string(),
+                              isolate);
+      persistent_scope_ = std::make_unique<PersistentHandlesScope>(isolate);
+    }
+
     SignedSmall = Type::SignedSmall();
     UnsignedSmall = Type::UnsignedSmall();
 
-    Handle<i::Map> object_map =
-        isolate->factory()->NewMap(JS_OBJECT_TYPE, JSObject::kHeaderSize);
-    Handle<i::Smi> smi = handle(Smi::FromInt(666), isolate);
-    Handle<i::HeapNumber> boxed_smi = isolate->factory()->NewHeapNumber(666);
+    Handle<i::Map> object_map = CanonicalHandle(
+        isolate->factory()->NewMap(JS_OBJECT_TYPE, JSObject::kHeaderSize));
+    Handle<i::Smi> smi = CanonicalHandle(Smi::FromInt(666));
+    Handle<i::HeapNumber> boxed_smi =
+        CanonicalHandle(isolate->factory()->NewHeapNumber(666));
     Handle<i::HeapNumber> signed32 =
-        isolate->factory()->NewHeapNumber(0x40000000);
-    Handle<i::HeapNumber> float1 = isolate->factory()->NewHeapNumber(1.53);
-    Handle<i::HeapNumber> float2 = isolate->factory()->NewHeapNumber(0.53);
+        CanonicalHandle(isolate->factory()->NewHeapNumber(0x40000000));
+    Handle<i::HeapNumber> float1 =
+        CanonicalHandle(isolate->factory()->NewHeapNumber(1.53));
+    Handle<i::HeapNumber> float2 =
+        CanonicalHandle(isolate->factory()->NewHeapNumber(0.53));
     // float3 is identical to float1 in order to test that OtherNumberConstant
     // types are equal by double value and not by handle pointer value.
-    Handle<i::HeapNumber> float3 = isolate->factory()->NewHeapNumber(1.53);
+    Handle<i::HeapNumber> float3 =
+        CanonicalHandle(isolate->factory()->NewHeapNumber(1.53));
     Handle<i::JSObject> object1 =
-        isolate->factory()->NewJSObjectFromMap(object_map);
+        CanonicalHandle(isolate->factory()->NewJSObjectFromMap(object_map));
     Handle<i::JSObject> object2 =
-        isolate->factory()->NewJSObjectFromMap(object_map);
-    Handle<i::JSArray> array = isolate->factory()->NewJSArray(20);
+        CanonicalHandle(isolate->factory()->NewJSObjectFromMap(object_map));
+    Handle<i::JSArray> array =
+        CanonicalHandle(isolate->factory()->NewJSArray(20));
     Handle<i::Oddball> uninitialized =
         isolate->factory()->uninitialized_value();
     Handle<i::Oddball> undefined = isolate->factory()->undefined_value();
@@ -118,6 +134,12 @@ class Types {
     }
   }
 
+  ~Types() {
+    if (persistent_scope_ != nullptr) {
+      persistent_scope_->Detach();
+    }
+  }
+
 #define DECLARE_TYPE(name, value) Type name;
   PROPER_BITSET_TYPE_LIST(DECLARE_TYPE)
 #undef DECLARE_TYPE
@@ -189,8 +211,8 @@ class Types {
       case 2: {  // range
         int i = rng_->NextInt(static_cast<int>(integers.size()));
         int j = rng_->NextInt(static_cast<int>(integers.size()));
-        double min = integers[i]->Number();
-        double max = integers[j]->Number();
+        double min = Object::Number(*integers[i]);
+        double max = Object::Number(*integers[j]);
         if (min > max) std::swap(min, max);
         return Type::Range(min, max, zone_);
       }
@@ -210,9 +232,25 @@ class Types {
   Zone* zone() { return zone_; }
   JSHeapBroker* js_heap_broker() { return &js_heap_broker_; }
 
+  template <typename T>
+  Handle<T> CanonicalHandle(Tagged<T> object) {
+    return js_heap_broker_.CanonicalPersistentHandle(object);
+  }
+  template <typename T>
+  Handle<T> CanonicalHandle(T object) {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return CanonicalHandle(Tagged<T>(object));
+  }
+  template <typename T>
+  Handle<T> CanonicalHandle(Handle<T> handle) {
+    return CanonicalHandle(*handle);
+  }
+
  private:
   Zone* zone_;
   JSHeapBroker js_heap_broker_;
+  JSHeapBrokerScopeForTesting js_heap_broker_scope_;
+  std::unique_ptr<PersistentHandlesScope> persistent_scope_;
   CurrentHeapBrokerScope current_broker_;
   v8::base::RandomNumberGenerator* rng_;
 };
diff --git a/deps/v8/test/common/wasm/wasm-interpreter.cc b/deps/v8/test/common/wasm/wasm-interpreter.cc
deleted file mode 100644
index 085355c88f966c..00000000000000
--- a/deps/v8/test/common/wasm/wasm-interpreter.cc
+++ /dev/null
@@ -1,4234 +0,0 @@
-// Copyright 2016 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "test/common/wasm/wasm-interpreter.h"
-
-#include <atomic>
-#include <type_traits>
-
-#include "src/base/overflowing-math.h"
-#include "src/base/safe_conversions.h"
-#include "src/codegen/assembler-inl.h"
-#include "src/common/globals.h"
-#include "src/compiler/wasm-compiler.h"
-#include "src/handles/global-handles-inl.h"
-#include "src/numbers/conversions.h"
-#include "src/objects/objects-inl.h"
-#include "src/utils/boxed-float.h"
-#include "src/utils/identity-map.h"
-#include "src/utils/utils.h"
-#include "src/wasm/decoder.h"
-#include "src/wasm/function-body-decoder-impl.h"
-#include "src/wasm/memory-tracing.h"
-#include "src/wasm/module-compiler.h"
-#include "src/wasm/wasm-arguments.h"
-#include "src/wasm/wasm-engine.h"
-#include "src/wasm/wasm-external-refs.h"
-#include "src/wasm/wasm-limits.h"
-#include "src/wasm/wasm-module.h"
-#include "src/wasm/wasm-objects-inl.h"
-#include "src/wasm/wasm-opcodes-inl.h"
-#include "src/zone/accounting-allocator.h"
-#include "src/zone/zone-containers.h"
-
-namespace v8 {
-namespace internal {
-namespace wasm {
-
-using base::ReadLittleEndianValue;
-using base::ReadUnalignedValue;
-using base::WriteLittleEndianValue;
-using base::WriteUnalignedValue;
-
-#define TRACE(...)                                            \
-  do {                                                        \
-    if (v8_flags.trace_wasm_interpreter) PrintF(__VA_ARGS__); \
-  } while (false)
-
-#if V8_TARGET_BIG_ENDIAN
-#define LANE(i, type) ((sizeof(type.val) / sizeof(type.val[0])) - (i)-1)
-#else
-#define LANE(i, type) (i)
-#endif
-
-#define FOREACH_SIMPLE_BINOP(V) \
-  V(I32Add, uint32_t, +)        \
-  V(I32Sub, uint32_t, -)        \
-  V(I32Mul, uint32_t, *)        \
-  V(I32And, uint32_t, &)        \
-  V(I32Ior, uint32_t, |)        \
-  V(I32Xor, uint32_t, ^)        \
-  V(I32Eq, uint32_t, ==)        \
-  V(I32Ne, uint32_t, !=)        \
-  V(I32LtU, uint32_t, <)        \
-  V(I32LeU, uint32_t, <=)       \
-  V(I32GtU, uint32_t, >)        \
-  V(I32GeU, uint32_t, >=)       \
-  V(I32LtS, int32_t, <)         \
-  V(I32LeS, int32_t, <=)        \
-  V(I32GtS, int32_t, >)         \
-  V(I32GeS, int32_t, >=)        \
-  V(I64Add, uint64_t, +)        \
-  V(I64Sub, uint64_t, -)        \
-  V(I64Mul, uint64_t, *)        \
-  V(I64And, uint64_t, &)        \
-  V(I64Ior, uint64_t, |)        \
-  V(I64Xor, uint64_t, ^)        \
-  V(I64Eq, uint64_t, ==)        \
-  V(I64Ne, uint64_t, !=)        \
-  V(I64LtU, uint64_t, <)        \
-  V(I64LeU, uint64_t, <=)       \
-  V(I64GtU, uint64_t, >)        \
-  V(I64GeU, uint64_t, >=)       \
-  V(I64LtS, int64_t, <)         \
-  V(I64LeS, int64_t, <=)        \
-  V(I64GtS, int64_t, >)         \
-  V(I64GeS, int64_t, >=)        \
-  V(F32Add, float, +)           \
-  V(F32Sub, float, -)           \
-  V(F32Eq, float, ==)           \
-  V(F32Ne, float, !=)           \
-  V(F32Lt, float, <)            \
-  V(F32Le, float, <=)           \
-  V(F32Gt, float, >)            \
-  V(F32Ge, float, >=)           \
-  V(F64Add, double, +)          \
-  V(F64Sub, double, -)          \
-  V(F64Eq, double, ==)          \
-  V(F64Ne, double, !=)          \
-  V(F64Lt, double, <)           \
-  V(F64Le, double, <=)          \
-  V(F64Gt, double, >)           \
-  V(F64Ge, double, >=)          \
-  V(F32Mul, float, *)           \
-  V(F64Mul, double, *)          \
-  V(F32Div, float, /)           \
-  V(F64Div, double, /)
-
-#define FOREACH_OTHER_BINOP(V) \
-  V(I32DivS, int32_t)          \
-  V(I32DivU, uint32_t)         \
-  V(I32RemS, int32_t)          \
-  V(I32RemU, uint32_t)         \
-  V(I32Shl, uint32_t)          \
-  V(I32ShrU, uint32_t)         \
-  V(I32ShrS, int32_t)          \
-  V(I64DivS, int64_t)          \
-  V(I64DivU, uint64_t)         \
-  V(I64RemS, int64_t)          \
-  V(I64RemU, uint64_t)         \
-  V(I64Shl, uint64_t)          \
-  V(I64ShrU, uint64_t)         \
-  V(I64ShrS, int64_t)          \
-  V(I32Ror, int32_t)           \
-  V(I32Rol, int32_t)           \
-  V(I64Ror, int64_t)           \
-  V(I64Rol, int64_t)           \
-  V(F32Min, float)             \
-  V(F32Max, float)             \
-  V(F64Min, double)            \
-  V(F64Max, double)            \
-  V(I32AsmjsDivS, int32_t)     \
-  V(I32AsmjsDivU, uint32_t)    \
-  V(I32AsmjsRemS, int32_t)     \
-  V(I32AsmjsRemU, uint32_t)    \
-  V(F32CopySign, Float32)      \
-  V(F64CopySign, Float64)
-
-#define FOREACH_I32CONV_FLOATOP(V)   \
-  V(I32SConvertF32, int32_t, float)  \
-  V(I32SConvertF64, int32_t, double) \
-  V(I32UConvertF32, uint32_t, float) \
-  V(I32UConvertF64, uint32_t, double)
-
-#define FOREACH_OTHER_UNOP(V)    \
-  V(I32Clz, uint32_t)            \
-  V(I32Ctz, uint32_t)            \
-  V(I32Popcnt, uint32_t)         \
-  V(I32Eqz, uint32_t)            \
-  V(I64Clz, uint64_t)            \
-  V(I64Ctz, uint64_t)            \
-  V(I64Popcnt, uint64_t)         \
-  V(I64Eqz, uint64_t)            \
-  V(F32Abs, Float32)             \
-  V(F32Neg, Float32)             \
-  V(F32Ceil, float)              \
-  V(F32Floor, float)             \
-  V(F32Trunc, float)             \
-  V(F32NearestInt, float)        \
-  V(F64Abs, Float64)             \
-  V(F64Neg, Float64)             \
-  V(F64Ceil, double)             \
-  V(F64Floor, double)            \
-  V(F64Trunc, double)            \
-  V(F64NearestInt, double)       \
-  V(I32ConvertI64, int64_t)      \
-  V(I64SConvertF32, float)       \
-  V(I64SConvertF64, double)      \
-  V(I64UConvertF32, float)       \
-  V(I64UConvertF64, double)      \
-  V(I64SConvertI32, int32_t)     \
-  V(I64UConvertI32, uint32_t)    \
-  V(F32SConvertI32, int32_t)     \
-  V(F32UConvertI32, uint32_t)    \
-  V(F32SConvertI64, int64_t)     \
-  V(F32UConvertI64, uint64_t)    \
-  V(F32ConvertF64, double)       \
-  V(F32ReinterpretI32, int32_t)  \
-  V(F64SConvertI32, int32_t)     \
-  V(F64UConvertI32, uint32_t)    \
-  V(F64SConvertI64, int64_t)     \
-  V(F64UConvertI64, uint64_t)    \
-  V(F64ConvertF32, float)        \
-  V(F64ReinterpretI64, int64_t)  \
-  V(I32AsmjsSConvertF32, float)  \
-  V(I32AsmjsUConvertF32, float)  \
-  V(I32AsmjsSConvertF64, double) \
-  V(I32AsmjsUConvertF64, double) \
-  V(F32Sqrt, float)              \
-  V(F64Sqrt, double)
-
-namespace {
-
-constexpr uint32_t kFloat32SignBitMask = uint32_t{1} << 31;
-constexpr uint64_t kFloat64SignBitMask = uint64_t{1} << 63;
-
-int32_t ExecuteI32DivS(int32_t a, int32_t b, TrapReason* trap) {
-  if (b == 0) {
-    *trap = kTrapDivByZero;
-    return 0;
-  }
-  if (b == -1 && a == std::numeric_limits<int32_t>::min()) {
-    *trap = kTrapDivUnrepresentable;
-    return 0;
-  }
-  return a / b;
-}
-
-uint32_t ExecuteI32DivU(uint32_t a, uint32_t b, TrapReason* trap) {
-  if (b == 0) {
-    *trap = kTrapDivByZero;
-    return 0;
-  }
-  return a / b;
-}
-
-int32_t ExecuteI32RemS(int32_t a, int32_t b, TrapReason* trap) {
-  if (b == 0) {
-    *trap = kTrapRemByZero;
-    return 0;
-  }
-  if (b == -1) return 0;
-  return a % b;
-}
-
-uint32_t ExecuteI32RemU(uint32_t a, uint32_t b, TrapReason* trap) {
-  if (b == 0) {
-    *trap = kTrapRemByZero;
-    return 0;
-  }
-  return a % b;
-}
-
-uint32_t ExecuteI32Shl(uint32_t a, uint32_t b, TrapReason* trap) {
-  return a << (b & 0x1F);
-}
-
-uint32_t ExecuteI32ShrU(uint32_t a, uint32_t b, TrapReason* trap) {
-  return a >> (b & 0x1F);
-}
-
-int32_t ExecuteI32ShrS(int32_t a, int32_t b, TrapReason* trap) {
-  return a >> (b & 0x1F);
-}
-
-int64_t ExecuteI64DivS(int64_t a, int64_t b, TrapReason* trap) {
-  if (b == 0) {
-    *trap = kTrapDivByZero;
-    return 0;
-  }
-  if (b == -1 && a == std::numeric_limits<int64_t>::min()) {
-    *trap = kTrapDivUnrepresentable;
-    return 0;
-  }
-  return a / b;
-}
-
-uint64_t ExecuteI64DivU(uint64_t a, uint64_t b, TrapReason* trap) {
-  if (b == 0) {
-    *trap = kTrapDivByZero;
-    return 0;
-  }
-  return a / b;
-}
-
-int64_t ExecuteI64RemS(int64_t a, int64_t b, TrapReason* trap) {
-  if (b == 0) {
-    *trap = kTrapRemByZero;
-    return 0;
-  }
-  if (b == -1) return 0;
-  return a % b;
-}
-
-uint64_t ExecuteI64RemU(uint64_t a, uint64_t b, TrapReason* trap) {
-  if (b == 0) {
-    *trap = kTrapRemByZero;
-    return 0;
-  }
-  return a % b;
-}
-
-uint64_t ExecuteI64Shl(uint64_t a, uint64_t b, TrapReason* trap) {
-  return a << (b & 0x3F);
-}
-
-uint64_t ExecuteI64ShrU(uint64_t a, uint64_t b, TrapReason* trap) {
-  return a >> (b & 0x3F);
-}
-
-int64_t ExecuteI64ShrS(int64_t a, int64_t b, TrapReason* trap) {
-  return a >> (b & 0x3F);
-}
-
-uint32_t ExecuteI32Ror(uint32_t a, uint32_t b, TrapReason* trap) {
-  return (a >> (b & 0x1F)) | (a << ((32 - b) & 0x1F));
-}
-
-uint32_t ExecuteI32Rol(uint32_t a, uint32_t b, TrapReason* trap) {
-  return (a << (b & 0x1F)) | (a >> ((32 - b) & 0x1F));
-}
-
-uint64_t ExecuteI64Ror(uint64_t a, uint64_t b, TrapReason* trap) {
-  return (a >> (b & 0x3F)) | (a << ((64 - b) & 0x3F));
-}
-
-uint64_t ExecuteI64Rol(uint64_t a, uint64_t b, TrapReason* trap) {
-  return (a << (b & 0x3F)) | (a >> ((64 - b) & 0x3F));
-}
-
-float ExecuteF32Min(float a, float b, TrapReason* trap) { return JSMin(a, b); }
-
-float ExecuteF32Max(float a, float b, TrapReason* trap) { return JSMax(a, b); }
-
-Float32 ExecuteF32CopySign(Float32 a, Float32 b, TrapReason* trap) {
-  return Float32::FromBits((a.get_bits() & ~kFloat32SignBitMask) |
-                           (b.get_bits() & kFloat32SignBitMask));
-}
-
-double ExecuteF64Min(double a, double b, TrapReason* trap) {
-  return JSMin(a, b);
-}
-
-double ExecuteF64Max(double a, double b, TrapReason* trap) {
-  return JSMax(a, b);
-}
-
-Float64 ExecuteF64CopySign(Float64 a, Float64 b, TrapReason* trap) {
-  return Float64::FromBits((a.get_bits() & ~kFloat64SignBitMask) |
-                           (b.get_bits() & kFloat64SignBitMask));
-}
-
-int32_t ExecuteI32AsmjsDivS(int32_t a, int32_t b, TrapReason* trap) {
-  if (b == 0) return 0;
-  if (b == -1 && a == std::numeric_limits<int32_t>::min()) {
-    return std::numeric_limits<int32_t>::min();
-  }
-  return a / b;
-}
-
-uint32_t ExecuteI32AsmjsDivU(uint32_t a, uint32_t b, TrapReason* trap) {
-  if (b == 0) return 0;
-  return a / b;
-}
-
-int32_t ExecuteI32AsmjsRemS(int32_t a, int32_t b, TrapReason* trap) {
-  if (b == 0) return 0;
-  if (b == -1) return 0;
-  return a % b;
-}
-
-uint32_t ExecuteI32AsmjsRemU(uint32_t a, uint32_t b, TrapReason* trap) {
-  if (b == 0) return 0;
-  return a % b;
-}
-
-int32_t ExecuteI32AsmjsSConvertF32(float a, TrapReason* trap) {
-  return DoubleToInt32(a);
-}
-
-uint32_t ExecuteI32AsmjsUConvertF32(float a, TrapReason* trap) {
-  return DoubleToUint32(a);
-}
-
-int32_t ExecuteI32AsmjsSConvertF64(double a, TrapReason* trap) {
-  return DoubleToInt32(a);
-}
-
-uint32_t ExecuteI32AsmjsUConvertF64(double a, TrapReason* trap) {
-  return DoubleToUint32(a);
-}
-
-int32_t ExecuteI32Clz(uint32_t val, TrapReason* trap) {
-  return base::bits::CountLeadingZeros(val);
-}
-
-uint32_t ExecuteI32Ctz(uint32_t val, TrapReason* trap) {
-  return base::bits::CountTrailingZeros(val);
-}
-
-uint32_t ExecuteI32Popcnt(uint32_t val, TrapReason* trap) {
-  return base::bits::CountPopulation(val);
-}
-
-uint32_t ExecuteI32Eqz(uint32_t val, TrapReason* trap) {
-  return val == 0 ? 1 : 0;
-}
-
-int64_t ExecuteI64Clz(uint64_t val, TrapReason* trap) {
-  return base::bits::CountLeadingZeros(val);
-}
-
-uint64_t ExecuteI64Ctz(uint64_t val, TrapReason* trap) {
-  return base::bits::CountTrailingZeros(val);
-}
-
-int64_t ExecuteI64Popcnt(uint64_t val, TrapReason* trap) {
-  return base::bits::CountPopulation(val);
-}
-
-int32_t ExecuteI64Eqz(uint64_t val, TrapReason* trap) {
-  return val == 0 ? 1 : 0;
-}
-
-Float32 ExecuteF32Abs(Float32 a, TrapReason* trap) {
-  return Float32::FromBits(a.get_bits() & ~kFloat32SignBitMask);
-}
-
-Float32 ExecuteF32Neg(Float32 a, TrapReason* trap) {
-  return Float32::FromBits(a.get_bits() ^ kFloat32SignBitMask);
-}
-
-float ExecuteF32Ceil(float a, TrapReason* trap) { return ceilf(a); }
-
-float ExecuteF32Floor(float a, TrapReason* trap) { return floorf(a); }
-
-float ExecuteF32Trunc(float a, TrapReason* trap) { return truncf(a); }
-
-float ExecuteF32NearestInt(float a, TrapReason* trap) {
-  float value = nearbyintf(a);
-#if V8_OS_AIX
-  value = FpOpWorkaround<float>(a, value);
-#endif
-  return value;
-}
-
-float ExecuteF32Sqrt(float a, TrapReason* trap) {
-  float result = sqrtf(a);
-  return result;
-}
-
-Float64 ExecuteF64Abs(Float64 a, TrapReason* trap) {
-  return Float64::FromBits(a.get_bits() & ~kFloat64SignBitMask);
-}
-
-Float64 ExecuteF64Neg(Float64 a, TrapReason* trap) {
-  return Float64::FromBits(a.get_bits() ^ kFloat64SignBitMask);
-}
-
-double ExecuteF64Ceil(double a, TrapReason* trap) { return ceil(a); }
-
-double ExecuteF64Floor(double a, TrapReason* trap) { return floor(a); }
-
-double ExecuteF64Trunc(double a, TrapReason* trap) { return trunc(a); }
-
-double ExecuteF64NearestInt(double a, TrapReason* trap) {
-  double value = nearbyint(a);
-#if V8_OS_AIX
-  value = FpOpWorkaround<double>(a, value);
-#endif
-  return value;
-}
-
-double ExecuteF64Sqrt(double a, TrapReason* trap) { return sqrt(a); }
-
-template <typename int_type, typename float_type>
-int_type ExecuteConvert(float_type a, TrapReason* trap) {
-  if (is_inbounds<int_type>(a)) {
-    return static_cast<int_type>(a);
-  }
-  *trap = kTrapFloatUnrepresentable;
-  return 0;
-}
-
-template <typename dst_type, typename src_type, void (*fn)(Address)>
-dst_type CallExternalIntToFloatFunction(src_type input) {
-  uint8_t data[std::max(sizeof(dst_type), sizeof(src_type))];
-  Address data_addr = reinterpret_cast<Address>(data);
-  WriteUnalignedValue<src_type>(data_addr, input);
-  fn(data_addr);
-  return ReadUnalignedValue<dst_type>(data_addr);
-}
-
-template <typename dst_type, typename src_type>
-dst_type ConvertFloatToIntOrTrap(src_type input, TrapReason* trap) {
-  if (base::IsValueInRangeForNumericType<dst_type>(input)) {
-    return static_cast<dst_type>(input);
-  } else {
-    *trap = kTrapFloatUnrepresentable;
-    return 0;
-  }
-}
-
-uint32_t ExecuteI32ConvertI64(int64_t a, TrapReason* trap) {
-  return static_cast<uint32_t>(a & 0xFFFFFFFF);
-}
-
-int64_t ExecuteI64SConvertF32(float a, TrapReason* trap) {
-  return ConvertFloatToIntOrTrap<int64_t, float>(a, trap);
-}
-
-int64_t ExecuteI64SConvertF64(double a, TrapReason* trap) {
-  return ConvertFloatToIntOrTrap<int64_t, double>(a, trap);
-}
-
-uint64_t ExecuteI64UConvertF32(float a, TrapReason* trap) {
-  return ConvertFloatToIntOrTrap<uint64_t, float>(a, trap);
-}
-
-uint64_t ExecuteI64UConvertF64(double a, TrapReason* trap) {
-  return ConvertFloatToIntOrTrap<uint64_t, double>(a, trap);
-}
-
-int64_t ExecuteI64SConvertI32(int32_t a, TrapReason* trap) {
-  return static_cast<int64_t>(a);
-}
-
-int64_t ExecuteI64UConvertI32(uint32_t a, TrapReason* trap) {
-  return static_cast<uint64_t>(a);
-}
-
-float ExecuteF32SConvertI32(int32_t a, TrapReason* trap) {
-  return static_cast<float>(a);
-}
-
-float ExecuteF32UConvertI32(uint32_t a, TrapReason* trap) {
-  return static_cast<float>(a);
-}
-
-float ExecuteF32SConvertI64(int64_t a, TrapReason* trap) {
-  return static_cast<float>(a);
-}
-
-float ExecuteF32UConvertI64(uint64_t a, TrapReason* trap) {
-  return CallExternalIntToFloatFunction<float, uint64_t,
-                                        uint64_to_float32_wrapper>(a);
-}
-
-float ExecuteF32ConvertF64(double a, TrapReason* trap) {
-  return DoubleToFloat32(a);
-}
-
-Float32 ExecuteF32ReinterpretI32(int32_t a, TrapReason* trap) {
-  return Float32::FromBits(a);
-}
-
-double ExecuteF64SConvertI32(int32_t a, TrapReason* trap) {
-  return static_cast<double>(a);
-}
-
-double ExecuteF64UConvertI32(uint32_t a, TrapReason* trap) {
-  return static_cast<double>(a);
-}
-
-double ExecuteF64SConvertI64(int64_t a, TrapReason* trap) {
-  return static_cast<double>(a);
-}
-
-double ExecuteF64UConvertI64(uint64_t a, TrapReason* trap) {
-  return CallExternalIntToFloatFunction<double, uint64_t,
-                                        uint64_to_float64_wrapper>(a);
-}
-
-double ExecuteF64ConvertF32(float a, TrapReason* trap) {
-  return static_cast<double>(a);
-}
-
-Float64 ExecuteF64ReinterpretI64(int64_t a, TrapReason* trap) {
-  return Float64::FromBits(a);
-}
-
-int32_t ExecuteI32ReinterpretF32(WasmValue a) {
-  return a.to_f32_boxed().get_bits();
-}
-
-int64_t ExecuteI64ReinterpretF64(WasmValue a) {
-  return a.to_f64_boxed().get_bits();
-}
-
-constexpr int32_t kCatchAllExceptionIndex = -1;
-constexpr int32_t kRethrowOrDelegateExceptionIndex = -2;
-
-}  // namespace
-
-class SideTable;
-
-// Code and metadata needed to execute a function.
-struct InterpreterCode {
-  const WasmFunction* function;  // wasm function
-  BodyLocalDecls locals;         // local declarations
-  const byte* start;             // start of code
-  const byte* end;               // end of code
-  SideTable* side_table;         // precomputed side table for control flow
-
-  const byte* at(pc_t pc) { return start + pc; }
-};
-
-constexpr Decoder::NoValidationTag kNoValidate;
-
-// A helper class to compute the control transfers for each bytecode offset.
-// Control transfers allow Br, BrIf, BrTable, If, Else, and End bytecodes to
-// be directly executed without the need to dynamically track blocks.
-class SideTable : public ZoneObject {
- public:
-  ControlTransferMap map_;
-  // Map rethrow instructions to the catch block index they target.
-  ZoneMap<pc_t, int> rethrow_map_;
-  int32_t max_stack_height_ = 0;
-  int32_t max_control_stack_height = 0;
-
-  SideTable(Zone* zone, const WasmModule* module, InterpreterCode* code)
-      : map_(zone), rethrow_map_(zone) {
-    // Create a zone for all temporary objects.
-    Zone control_transfer_zone(zone->allocator(), ZONE_NAME);
-
-    // Represents a control flow label.
-    class CLabel : public ZoneObject {
-      friend Zone;
-
-      explicit CLabel(Zone* zone, int32_t target_stack_height, uint32_t arity)
-          : catch_targets(zone),
-            target_stack_height(target_stack_height),
-            arity(arity),
-            refs(zone) {
-        DCHECK_LE(0, target_stack_height);
-      }
-
-     public:
-      struct Ref {
-        const byte* from_pc;
-        const int32_t stack_height;
-      };
-      struct CatchTarget {
-        int tag_index;
-        int target_control_index;
-        const byte* pc;
-      };
-      const byte* target = nullptr;
-      ZoneVector<CatchTarget> catch_targets;
-      int32_t target_stack_height;
-      // Arity when branching to this label.
-      const uint32_t arity;
-      ZoneVector<Ref> refs;
-
-      static CLabel* New(Zone* zone, int32_t stack_height, uint32_t arity) {
-        return zone->New<CLabel>(zone, stack_height, arity);
-      }
-
-      // Bind this label to the given PC.
-      void Bind(const byte* pc) {
-        DCHECK_NULL(target);
-        target = pc;
-      }
-
-      void Bind(const byte* pc, int tag_index, int target_control_index) {
-        catch_targets.push_back({tag_index, target_control_index, pc});
-      }
-
-      // Reference this label from the given location.
-      void Ref(const byte* from_pc, int32_t stack_height) {
-        // Target being bound before a reference means this is a loop.
-        DCHECK_IMPLIES(target, *target == kExprLoop);
-        refs.push_back({from_pc, stack_height});
-      }
-
-      void Finish(ControlTransferMap* map, const byte* start) {
-        DCHECK_EQ(!!target, catch_targets.empty());
-        for (auto ref : refs) {
-          size_t offset = static_cast<size_t>(ref.from_pc - start);
-          DCHECK_GE(ref.stack_height, target_stack_height);
-          spdiff_t spdiff =
-              static_cast<spdiff_t>(ref.stack_height - target_stack_height);
-          if (target) {
-            auto pcdiff = static_cast<pcdiff_t>(target - ref.from_pc);
-            TRACE("control transfer @%zu: Δpc %d, stack %u->%u = -%u\n", offset,
-                  pcdiff, ref.stack_height, target_stack_height, spdiff);
-            ControlTransferEntry& entry = (map->map)[offset];
-            entry.pc_diff = pcdiff;
-            entry.sp_diff = spdiff;
-            entry.target_arity = arity;
-          } else {
-            Zone* zone = map->catch_map.get_allocator().zone();
-            auto p = map->catch_map.emplace(
-                offset, ZoneVector<CatchControlTransferEntry>(zone));
-            auto& catch_entries = p.first->second;
-            for (auto& catch_target : catch_targets) {
-              auto pcdiff =
-                  static_cast<pcdiff_t>(catch_target.pc - ref.from_pc);
-              TRACE(
-                  "control transfer @%zu: Δpc %d, stack %u->%u, exn: %d = "
-                  "-%u\n",
-                  offset, pcdiff, ref.stack_height, target_stack_height,
-                  catch_target.tag_index, spdiff);
-              CatchControlTransferEntry entry;
-              entry.pc_diff = pcdiff;
-              entry.sp_diff = spdiff;
-              entry.target_arity = arity;
-              entry.tag_index = catch_target.tag_index;
-              entry.target_control_index = catch_target.target_control_index;
-              catch_entries.emplace_back(entry);
-            }
-          }
-        }
-      }
-    };
-
-    // An entry in the control stack.
-    struct Control {
-      const byte* pc;
-      CLabel* end_label;
-      CLabel* else_label;
-      // Arity (number of values on the stack) when exiting this control
-      // structure via |end|.
-      uint32_t exit_arity;
-      // Track whether this block was already left, i.e. all further
-      // instructions are unreachable.
-      bool unreachable = false;
-
-      Control(const byte* pc, CLabel* end_label, CLabel* else_label,
-              uint32_t exit_arity)
-          : pc(pc),
-            end_label(end_label),
-            else_label(else_label),
-            exit_arity(exit_arity) {}
-      Control(const byte* pc, CLabel* end_label, uint32_t exit_arity)
-          : Control(pc, end_label, nullptr, exit_arity) {}
-
-      void Finish(ControlTransferMap* map, const byte* start) {
-        end_label->Finish(map, start);
-        if (else_label) else_label->Finish(map, start);
-      }
-    };
-
-    // Compute the ControlTransfer map.
-    // This algorithm maintains a stack of control constructs similar to the
-    // AST decoder. The {control_stack} allows matching {br,br_if,br_table}
-    // bytecodes with their target, as well as determining whether the current
-    // bytecodes are within the true or false block of an else.
-    ZoneVector<Control> control_stack(&control_transfer_zone);
-    // It also maintains a stack of all nested {try} blocks to resolve local
-    // handler targets for potentially throwing operations. This stack contains
-    // indices into the above control stack.
-    ZoneVector<size_t> exception_stack(zone);
-    int32_t stack_height = 0;
-    uint32_t func_arity =
-        static_cast<uint32_t>(code->function->sig->return_count());
-    CLabel* func_label =
-        CLabel::New(&control_transfer_zone, stack_height, func_arity);
-    control_stack.emplace_back(code->start, func_label, func_arity);
-    auto control_parent = [&]() -> Control& {
-      DCHECK_LE(2, control_stack.size());
-      return control_stack[control_stack.size() - 2];
-    };
-    auto copy_unreachable = [&] {
-      control_stack.back().unreachable = control_parent().unreachable;
-    };
-    int max_exception_arity = 0;
-    if (module) {
-      for (auto& tag : module->tags) {
-        max_exception_arity = std::max(
-            max_exception_arity, static_cast<int>(tag.sig->parameter_count()));
-      }
-    }
-    WasmFeatures unused_detected_features;
-    WasmDecoder<Decoder::NoValidationTag> decoder{zone,
-                                                  module,
-                                                  WasmFeatures::All(),
-                                                  &unused_detected_features,
-                                                  code->function->sig,
-                                                  code->start,
-                                                  code->end};
-    for (BytecodeIterator i(code->start, code->end, &code->locals, zone);
-         i.has_next(); i.next()) {
-      WasmOpcode opcode = i.current();
-      int32_t exceptional_stack_height = 0;
-      if (WasmOpcodes::IsPrefixOpcode(opcode)) opcode = i.prefixed_opcode();
-      bool unreachable = control_stack.back().unreachable;
-      if (unreachable) {
-        TRACE("@%u: %s (is unreachable)\n", i.pc_offset(),
-              WasmOpcodes::OpcodeName(opcode));
-      } else {
-        auto stack_effect =
-            StackEffect(module, code->function->sig, i.pc(), i.end());
-        TRACE("@%u: %s (sp %d - %d + %d)\n", i.pc_offset(),
-              WasmOpcodes::OpcodeName(opcode), stack_height, stack_effect.first,
-              stack_effect.second);
-        DCHECK_GE(stack_height, stack_effect.first);
-        DCHECK_GE(kMaxUInt32, static_cast<uint64_t>(stack_height) -
-                                  stack_effect.first + stack_effect.second);
-        exceptional_stack_height = stack_height - stack_effect.first;
-        stack_height = stack_height - stack_effect.first + stack_effect.second;
-        if (stack_height > max_stack_height_) max_stack_height_ = stack_height;
-      }
-      if (!exception_stack.empty() && WasmOpcodes::IsThrowingOpcode(opcode)) {
-        // Record exceptional control flow from potentially throwing opcodes to
-        // the local handler if one is present. The stack height at the throw
-        // point is assumed to have popped all operands and not pushed any yet.
-        DCHECK_GE(control_stack.size() - 1, exception_stack.back());
-        const Control* c = &control_stack[exception_stack.back()];
-        if (!unreachable) c->else_label->Ref(i.pc(), exceptional_stack_height);
-        if (exceptional_stack_height + max_exception_arity >
-            max_stack_height_) {
-          max_stack_height_ = exceptional_stack_height + max_exception_arity;
-        }
-        TRACE("handler @%u: %s -> try @%u\n", i.pc_offset(),
-              WasmOpcodes::OpcodeName(opcode),
-              static_cast<uint32_t>(c->pc - code->start));
-      }
-      max_control_stack_height = std::max(
-          max_control_stack_height, static_cast<int>(control_stack.size()));
-      switch (opcode) {
-        case kExprBlock:
-        case kExprLoop: {
-          bool is_loop = opcode == kExprLoop;
-          BlockTypeImmediate imm(WasmFeatures::All(), &decoder, i.pc() + 1,
-                                 kNoValidate);
-          CHECK(decoder.Validate(i.pc() + 1, imm));
-          TRACE("control @%u: %s, arity %d->%d\n", i.pc_offset(),
-                is_loop ? "Loop" : "Block", imm.in_arity(), imm.out_arity());
-          DCHECK_IMPLIES(!unreachable,
-                         stack_height >= static_cast<int32_t>(imm.in_arity()));
-          int32_t target_stack_height = stack_height - imm.in_arity();
-          // The stack may underflow in unreachable code. In this case the
-          // stack height is clamped at 0.
-          if (V8_UNLIKELY(target_stack_height < 0)) target_stack_height = 0;
-          CLabel* label =
-              CLabel::New(&control_transfer_zone, target_stack_height,
-                          is_loop ? imm.in_arity() : imm.out_arity());
-          control_stack.emplace_back(i.pc(), label, imm.out_arity());
-          copy_unreachable();
-          if (is_loop) label->Bind(i.pc());
-          break;
-        }
-        case kExprIf: {
-          BlockTypeImmediate imm(WasmFeatures::All(), &decoder, i.pc() + 1,
-                                 kNoValidate);
-          CHECK(decoder.Validate(i.pc() + 1, imm));
-          TRACE("control @%u: If, arity %d->%d\n", i.pc_offset(),
-                imm.in_arity(), imm.out_arity());
-          DCHECK_IMPLIES(!unreachable,
-                         stack_height >= static_cast<int32_t>(imm.in_arity()));
-          int32_t target_stack_height = stack_height - imm.in_arity();
-          // The stack may underflow in unreachable code. In this case the
-          // stack height is clamped at 0.
-          if (V8_UNLIKELY(target_stack_height < 0)) target_stack_height = 0;
-          CLabel* end_label = CLabel::New(&control_transfer_zone,
-                                          target_stack_height, imm.out_arity());
-          CLabel* else_label =
-              CLabel::New(&control_transfer_zone, stack_height, 0);
-          control_stack.emplace_back(i.pc(), end_label, else_label,
-                                     imm.out_arity());
-          copy_unreachable();
-          if (!unreachable) else_label->Ref(i.pc(), stack_height);
-          break;
-        }
-        case kExprElse: {
-          TRACE("control @%u: Else\n", i.pc_offset());
-          Control* c = &control_stack.back();
-          DCHECK_EQ(*c->pc, kExprIf);
-          copy_unreachable();
-          if (!unreachable) c->end_label->Ref(i.pc(), stack_height);
-          DCHECK_NOT_NULL(c->else_label);
-          c->else_label->Bind(i.pc() + 1);
-          c->else_label->Finish(&map_, code->start);
-          stack_height = c->else_label->target_stack_height;
-          c->else_label = nullptr;
-          DCHECK_IMPLIES(!unreachable,
-                         stack_height >= c->end_label->target_stack_height);
-          break;
-        }
-        case kExprCatchAll: {
-          TRACE("control @%u: CatchAll\n", i.pc_offset());
-          Control* c = &control_stack.back();
-          DCHECK_EQ(*c->pc, kExprTry);
-          if (!exception_stack.empty() &&
-              exception_stack.back() == control_stack.size() - 1) {
-            // Only pop the exception stack if this is the only catch handler.
-            exception_stack.pop_back();
-          }
-          copy_unreachable();
-          if (!unreachable) c->end_label->Ref(i.pc(), stack_height);
-          DCHECK_NOT_NULL(c->else_label);
-          int control_index = static_cast<int>(control_stack.size()) - 1;
-          c->else_label->Bind(i.pc() + 1, kCatchAllExceptionIndex,
-                              control_index);
-          c->else_label->Finish(&map_, code->start);
-          c->else_label = nullptr;
-          DCHECK_IMPLIES(!unreachable,
-                         stack_height >= c->end_label->target_stack_height);
-          stack_height = c->end_label->target_stack_height;
-          break;
-        }
-        case kExprTry: {
-          BlockTypeImmediate imm(WasmFeatures::All(), &decoder, i.pc() + 1,
-                                 kNoValidate);
-          CHECK(decoder.Validate(i.pc() + 1, imm));
-          TRACE("control @%u: Try, arity %d->%d\n", i.pc_offset(),
-                imm.in_arity(), imm.out_arity());
-          int target_stack_height = stack_height - imm.in_arity();
-          if (target_stack_height < 0) {
-            // Allowed in unreachable code, but the stack height stays at 0.
-            DCHECK(unreachable);
-            target_stack_height = 0;
-          }
-          CLabel* end_label = CLabel::New(&control_transfer_zone,
-                                          target_stack_height, imm.out_arity());
-          CLabel* catch_label =
-              CLabel::New(&control_transfer_zone, target_stack_height, 0);
-          control_stack.emplace_back(i.pc(), end_label, catch_label,
-                                     imm.out_arity());
-          exception_stack.push_back(control_stack.size() - 1);
-          copy_unreachable();
-          break;
-        }
-        case kExprRethrow: {
-          BranchDepthImmediate imm(&decoder, i.pc() + 1, kNoValidate);
-          int index = static_cast<int>(control_stack.size()) - 1 - imm.depth;
-          rethrow_map_.emplace(i.pc() - i.start(), index);
-          break;
-        }
-        case kExprCatch: {
-          if (!exception_stack.empty() &&
-              exception_stack.back() == control_stack.size() - 1) {
-            // Only pop the exception stack once when we enter the first catch.
-            exception_stack.pop_back();
-          }
-          TagIndexImmediate imm(&decoder, i.pc() + 1, kNoValidate);
-          Control* c = &control_stack.back();
-          copy_unreachable();
-          TRACE("control @%u: Catch\n", i.pc_offset());
-          if (!unreachable) c->end_label->Ref(i.pc(), stack_height);
-
-          DCHECK_NOT_NULL(c->else_label);
-          int control_index = static_cast<int>(control_stack.size()) - 1;
-          c->else_label->Bind(i.pc() + imm.length + 1, imm.index,
-                              control_index);
-
-          DCHECK_IMPLIES(!unreachable,
-                         stack_height >= c->end_label->target_stack_height);
-          const FunctionSig* tag_sig = module->tags[imm.index].sig;
-          int catch_in_arity = static_cast<int>(tag_sig->parameter_count());
-          stack_height = c->end_label->target_stack_height + catch_in_arity;
-          break;
-        }
-        case kExprEnd: {
-          Control* c = &control_stack.back();
-          TRACE("control @%u: End\n", i.pc_offset());
-          // Only loops have bound labels.
-          DCHECK_IMPLIES(c->end_label->target, *c->pc == kExprLoop);
-          bool rethrow = false;
-          if (!c->end_label->target) {
-            if (c->else_label) {
-              if (*c->pc == kExprIf) {
-                // Bind else label for one-armed if.
-                c->else_label->Bind(i.pc());
-              } else if (!exception_stack.empty()) {
-                DCHECK_IMPLIES(
-                    !unreachable,
-                    stack_height >= c->else_label->target_stack_height);
-                // No catch_all block, prepare for implicit rethrow.
-                if (exception_stack.back() == control_stack.size() - 1) {
-                  // Close try scope for catch-less try.
-                  exception_stack.pop_back();
-                  copy_unreachable();
-                  unreachable = control_stack.back().unreachable;
-                }
-                DCHECK_EQ(*c->pc, kExprTry);
-                constexpr int kUnusedControlIndex = -1;
-                c->else_label->Bind(i.pc(), kRethrowOrDelegateExceptionIndex,
-                                    kUnusedControlIndex);
-                stack_height = c->else_label->target_stack_height;
-                rethrow = !unreachable && !exception_stack.empty();
-              }
-            }
-            c->end_label->Bind(i.pc() + 1);
-          }
-          if (rethrow) {
-            Control* next_try_block = &control_stack[exception_stack.back()];
-            next_try_block->else_label->Ref(i.pc(), stack_height);
-            // We normally update the max stack height before the switch.
-            // However 'end' is not in the list of throwing opcodes so we don't
-            // take into account that it may unpack an exception.
-            max_stack_height_ =
-                std::max(max_stack_height_, stack_height + max_exception_arity);
-          }
-          c->Finish(&map_, code->start);
-
-          DCHECK_IMPLIES(!unreachable,
-                         stack_height >= c->end_label->target_stack_height);
-          stack_height = c->end_label->target_stack_height + c->exit_arity;
-          control_stack.pop_back();
-          break;
-        }
-        case kExprDelegate: {
-          BranchDepthImmediate imm(&decoder, i.pc() + 1, kNoValidate);
-          TRACE("control @%u: Delegate[depth=%u]\n", i.pc_offset(), imm.depth);
-          Control* c = &control_stack.back();
-          const size_t new_stack_size = control_stack.size() - 1;
-          const size_t max_depth = new_stack_size - 1;
-          // Find the first try block that is equal to or encloses the target
-          // block, i.e. has a lower than or equal index in the control stack.
-          int try_index = static_cast<int>(exception_stack.size()) - 1;
-          while (try_index >= 0 &&
-                 exception_stack[try_index] > max_depth - imm.depth) {
-            try_index--;
-          }
-          if (try_index >= 0) {
-            size_t target_depth = exception_stack[try_index];
-            constexpr int kUnusedControlIndex = -1;
-            c->else_label->Bind(i.pc(), kRethrowOrDelegateExceptionIndex,
-                                kUnusedControlIndex);
-            c->else_label->Finish(&map_, code->start);
-            Control* target = &control_stack[target_depth];
-            DCHECK_EQ(*target->pc, kExprTry);
-            DCHECK_NOT_NULL(target->else_label);
-            if (!control_parent().unreachable) {
-              target->else_label->Ref(i.pc(),
-                                      c->end_label->target_stack_height);
-            }
-          }
-          c->else_label = nullptr;
-          c->end_label->Bind(i.pc() + imm.length + 1);
-          c->Finish(&map_, code->start);
-
-          DCHECK_IMPLIES(!unreachable,
-                         stack_height >= c->end_label->target_stack_height);
-          stack_height = c->end_label->target_stack_height + c->exit_arity;
-          control_stack.pop_back();
-          exception_stack.pop_back();
-          break;
-        }
-        case kExprBr: {
-          BranchDepthImmediate imm(&decoder, i.pc() + 1, kNoValidate);
-          TRACE("control @%u: Br[depth=%u]\n", i.pc_offset(), imm.depth);
-          Control* c = &control_stack[control_stack.size() - imm.depth - 1];
-          if (!unreachable) c->end_label->Ref(i.pc(), stack_height);
-          break;
-        }
-        case kExprBrIf: {
-          BranchDepthImmediate imm(&decoder, i.pc() + 1, kNoValidate);
-          TRACE("control @%u: BrIf[depth=%u]\n", i.pc_offset(), imm.depth);
-          Control* c = &control_stack[control_stack.size() - imm.depth - 1];
-          if (!unreachable) c->end_label->Ref(i.pc(), stack_height);
-          break;
-        }
-        case kExprBrTable: {
-          BranchTableImmediate imm(&decoder, i.pc() + 1, kNoValidate);
-          BranchTableIterator<Decoder::NoValidationTag> iterator(&i, imm);
-          TRACE("control @%u: BrTable[count=%u]\n", i.pc_offset(),
-                imm.table_count);
-          if (!unreachable) {
-            while (iterator.has_next()) {
-              uint32_t j = iterator.cur_index();
-              uint32_t target = iterator.next();
-              Control* c = &control_stack[control_stack.size() - target - 1];
-              c->end_label->Ref(i.pc() + j, stack_height);
-            }
-          }
-          break;
-        }
-        default:
-          break;
-      }
-      if (WasmOpcodes::IsUnconditionalJump(opcode)) {
-        control_stack.back().unreachable = true;
-      }
-    }
-    DCHECK_EQ(0, control_stack.size());
-    DCHECK_EQ(func_arity, stack_height);
-  }
-
-  bool HasEntryAt(pc_t from) {
-    auto result = map_.map.find(from);
-    return result != map_.map.end();
-  }
-
-  bool HasCatchEntryAt(pc_t from) {
-    auto result = map_.catch_map.find(from);
-    return result != map_.catch_map.end();
-  }
-
-  ControlTransferEntry& Lookup(pc_t from) {
-    auto result = map_.map.find(from);
-    DCHECK(result != map_.map.end());
-    return result->second;
-  }
-};
-
-// The main storage for interpreter code. It maps {WasmFunction} to the
-// metadata needed to execute each function.
-class CodeMap {
-  Zone* zone_;
-  const WasmModule* module_;
-  ZoneVector<InterpreterCode> interpreter_code_;
-
- public:
-  CodeMap(const WasmModule* module, const uint8_t* module_start, Zone* zone)
-      : zone_(zone), module_(module), interpreter_code_(zone) {
-    if (module == nullptr) return;
-    interpreter_code_.reserve(module->functions.size());
-    for (const WasmFunction& function : module->functions) {
-      if (function.imported) {
-        DCHECK(!function.code.is_set());
-        AddFunction(&function, nullptr, nullptr);
-      } else {
-        AddFunction(&function, module_start + function.code.offset(),
-                    module_start + function.code.end_offset());
-      }
-    }
-  }
-
-  const WasmModule* module() const { return module_; }
-
-  InterpreterCode* GetCode(const WasmFunction* function) {
-    InterpreterCode* code = GetCode(function->func_index);
-    DCHECK_EQ(function, code->function);
-    return code;
-  }
-
-  InterpreterCode* GetCode(uint32_t function_index) {
-    DCHECK_LT(function_index, interpreter_code_.size());
-    return Preprocess(&interpreter_code_[function_index]);
-  }
-
-  InterpreterCode* Preprocess(InterpreterCode* code) {
-    DCHECK_EQ(code->function->imported, code->start == nullptr);
-    if (!code->side_table && code->start) {
-      // Compute the control targets map and the local declarations.
-      code->side_table = zone_->New<SideTable>(zone_, module_, code);
-    }
-    return code;
-  }
-
-  void AddFunction(const WasmFunction* function, const byte* code_start,
-                   const byte* code_end) {
-    InterpreterCode code = {function, BodyLocalDecls{}, code_start, code_end,
-                            nullptr};
-
-    DCHECK_EQ(interpreter_code_.size(), function->func_index);
-    interpreter_code_.push_back(code);
-  }
-
-  void SetFunctionCode(const WasmFunction* function, const byte* start,
-                       const byte* end) {
-    DCHECK_LT(function->func_index, interpreter_code_.size());
-    InterpreterCode* code = &interpreter_code_[function->func_index];
-    DCHECK_EQ(function, code->function);
-    code->start = const_cast<byte*>(start);
-    code->end = const_cast<byte*>(end);
-    code->side_table = nullptr;
-    Preprocess(code);
-  }
-};
-
-namespace {
-
-struct CallResult {
-  enum Type {
-    // The function should be executed inside this interpreter.
-    INTERNAL,
-    // For indirect calls: Table or function does not exist.
-    INVALID_FUNC,
-    // For indirect calls: Signature does not match expected signature.
-    SIGNATURE_MISMATCH
-  };
-  Type type;
-  // If type is INTERNAL, this field holds the function to call internally.
-  InterpreterCode* interpreter_code;
-
-  CallResult(Type type) : type(type) {  // NOLINT
-    DCHECK_NE(INTERNAL, type);
-  }
-  CallResult(Type type, InterpreterCode* code)
-      : type(type), interpreter_code(code) {
-    DCHECK_EQ(INTERNAL, type);
-  }
-};
-
-// Like a static_cast from src to dst, but specialized for boxed floats.
-template <typename dst, typename src>
-struct converter {
-  dst operator()(src val) const { return static_cast<dst>(val); }
-};
-template <>
-struct converter<Float64, uint64_t> {
-  Float64 operator()(uint64_t val) const { return Float64::FromBits(val); }
-};
-template <>
-struct converter<Float32, uint32_t> {
-  Float32 operator()(uint32_t val) const { return Float32::FromBits(val); }
-};
-template <>
-struct converter<uint64_t, Float64> {
-  uint64_t operator()(Float64 val) const { return val.get_bits(); }
-};
-template <>
-struct converter<uint32_t, Float32> {
-  uint32_t operator()(Float32 val) const { return val.get_bits(); }
-};
-
-template <typename T>
-V8_INLINE bool has_nondeterminism(T val) {
-  static_assert(!std::is_floating_point<T>::value, "missing specialization");
-  return false;
-}
-template <>
-V8_INLINE bool has_nondeterminism<float>(float val) {
-  return std::isnan(val);
-}
-template <>
-V8_INLINE bool has_nondeterminism<double>(double val) {
-  return std::isnan(val);
-}
-
-}  // namespace
-
-//============================================================================
-// The implementation details of the interpreter.
-//============================================================================
-class WasmInterpreterInternals {
- public:
-  WasmInterpreterInternals(Zone* zone, const WasmModule* module,
-                           ModuleWireBytes wire_bytes,
-                           Handle<WasmInstanceObject> instance_object)
-      : module_bytes_(wire_bytes.start(), wire_bytes.end(), zone),
-        codemap_(module, module_bytes_.data(), zone),
-        isolate_(instance_object->GetIsolate()),
-        instance_object_(instance_object),
-        reference_stack_(isolate_->global_handles()->Create(
-            ReadOnlyRoots(isolate_).empty_fixed_array())),
-        frames_(zone) {}
-
-  ~WasmInterpreterInternals() {
-    isolate_->global_handles()->Destroy(reference_stack_.location());
-  }
-
-  WasmInterpreter::State state() { return state_; }
-
-  void InitFrame(const WasmFunction* function, WasmValue* args) {
-    DCHECK(frames_.empty());
-    InterpreterCode* code = codemap_.GetCode(function);
-    size_t num_params = function->sig->parameter_count();
-    EnsureStackSpace(num_params);
-    Push(args, num_params);
-    PushFrame(code);
-  }
-
-  WasmInterpreter::State Run(int num_steps = -1) {
-    DCHECK(state_ == WasmInterpreter::STOPPED ||
-           state_ == WasmInterpreter::PAUSED);
-    DCHECK(num_steps == -1 || num_steps > 0);
-    if (num_steps == -1) {
-      TRACE("  => Run()\n");
-    } else if (num_steps == 1) {
-      TRACE("  => Step()\n");
-    } else {
-      TRACE("  => Run(%d)\n", num_steps);
-    }
-    state_ = WasmInterpreter::RUNNING;
-    Execute(frames_.back().code, frames_.back().pc, num_steps);
-    // If state_ is STOPPED, the stack must be fully unwound.
-    DCHECK_IMPLIES(state_ == WasmInterpreter::STOPPED, frames_.empty());
-    return state_;
-  }
-
-  void Pause() { UNIMPLEMENTED(); }
-
-  void Reset() {
-    TRACE("----- RESET -----\n");
-    ResetStack(0);
-    frames_.clear();
-    state_ = WasmInterpreter::STOPPED;
-    trap_reason_ = kTrapCount;
-    possible_nondeterminism_ = false;
-  }
-
-  WasmValue GetReturnValue(uint32_t index) {
-    if (state_ == WasmInterpreter::TRAPPED) return WasmValue(0xDEADBEEF);
-    DCHECK_EQ(WasmInterpreter::FINISHED, state_);
-    return GetStackValue(index);
-  }
-
-  WasmValue GetStackValue(sp_t index) {
-    DCHECK_GT(StackHeight(), index);
-    return stack_[index].ExtractValue(this, index);
-  }
-
-  void SetStackValue(sp_t index, WasmValue value) {
-    DCHECK_GT(StackHeight(), index);
-    stack_[index] = StackValue(value, this, index);
-  }
-
-  TrapReason GetTrapReason() { return trap_reason_; }
-
-  bool PossibleNondeterminism() const { return possible_nondeterminism_; }
-
-  uint64_t NumInterpretedCalls() const { return num_interpreted_calls_; }
-
-  CodeMap* codemap() { return &codemap_; }
-
- private:
-  // Handle a thrown exception. Returns whether the exception was handled inside
-  // of wasm. Unwinds the interpreted stack accordingly.
-  WasmInterpreter::ExceptionHandlingResult HandleException(Isolate* isolate) {
-    DCHECK(isolate->has_pending_exception());
-    bool catchable =
-        isolate->is_catchable_by_wasm(isolate->pending_exception());
-    while (!frames_.empty()) {
-      Frame& frame = frames_.back();
-      InterpreterCode* code = frame.code;
-      if (catchable && code->side_table->HasCatchEntryAt(frame.pc)) {
-        TRACE("----- HANDLE -----\n");
-        HandleScope scope(isolate_);
-        Handle<Object> exception =
-            handle(isolate->pending_exception(), isolate);
-        if (JumpToHandlerDelta(code, exception, &frame.pc)) {
-          isolate->clear_pending_exception();
-          TRACE("  => handler #%zu (#%u @%zu)\n", frames_.size() - 1,
-                code->function->func_index, frame.pc);
-          return WasmInterpreter::HANDLED;
-        } else {
-          TRACE("  => no handler #%zu (#%u @%zu)\n", frames_.size() - 1,
-                code->function->func_index, frame.pc);
-        }
-      }
-      TRACE("  => drop frame #%zu (#%u @%zu)\n", frames_.size() - 1,
-            code->function->func_index, frame.pc);
-      ResetStack(frame.sp);
-      if (!frame.caught_exception_stack.is_null()) {
-        isolate_->global_handles()->Destroy(
-            frame.caught_exception_stack.location());
-      }
-      frames_.pop_back();
-    }
-    TRACE("----- UNWIND -----\n");
-    DCHECK(frames_.empty());
-    DCHECK_EQ(sp_, stack_.get());
-    state_ = WasmInterpreter::STOPPED;
-    return WasmInterpreter::UNWOUND;
-  }
-
-  // Entries on the stack of functions being evaluated.
-  struct Frame {
-    InterpreterCode* code;
-    pc_t pc;
-    sp_t sp;
-
-    // Limit of parameters.
-    sp_t plimit() { return sp + code->function->sig->parameter_count(); }
-    // Limit of locals.
-    sp_t llimit() { return plimit() + code->locals.num_locals; }
-
-    Handle<FixedArray> caught_exception_stack;
-  };
-
-  // Safety wrapper for values on the operand stack represented as {WasmValue}.
-  // Most values are stored directly on the stack, only reference values are
-  // kept in a separate on-heap reference stack to make the GC trace them.
-  // TODO(wasm): Optimize simple stack operations (like "get_local",
-  // "set_local", and "tee_local") so that they don't require a handle scope.
-  class StackValue {
-   public:
-    StackValue() = default;  // Only needed for resizing the stack.
-    StackValue(WasmValue v, WasmInterpreterInternals* impl, sp_t index)
-        : value_(v) {
-      if (IsReferenceValue()) {
-        value_ = WasmValue(Handle<Object>::null(), value_.type());
-        int ref_index = static_cast<int>(index);
-        impl->reference_stack_->set(ref_index, *v.to_ref());
-      }
-    }
-
-    WasmValue ExtractValue(WasmInterpreterInternals* impl, sp_t index) {
-      if (!IsReferenceValue()) return value_;
-      DCHECK(value_.to_ref().is_null());
-      int ref_index = static_cast<int>(index);
-      Isolate* isolate = impl->isolate_;
-      Handle<Object> ref(impl->reference_stack_->get(ref_index), isolate);
-      DCHECK(!ref->IsTheHole(isolate));
-      return WasmValue(ref, value_.type());
-    }
-
-    bool IsReferenceValue() const { return value_.type().is_reference(); }
-
-    void ClearValue(WasmInterpreterInternals* impl, sp_t index) {
-      if (!IsReferenceValue()) return;
-      int ref_index = static_cast<int>(index);
-      Isolate* isolate = impl->isolate_;
-      impl->reference_stack_->set_the_hole(isolate, ref_index);
-    }
-
-    static void ClearValues(WasmInterpreterInternals* impl, sp_t index,
-                            int count) {
-      int ref_index = static_cast<int>(index);
-      impl->reference_stack_->FillWithHoles(ref_index, ref_index + count);
-    }
-
-    static bool IsClearedValue(WasmInterpreterInternals* impl, sp_t index) {
-      int ref_index = static_cast<int>(index);
-      Isolate* isolate = impl->isolate_;
-      return impl->reference_stack_->is_the_hole(isolate, ref_index);
-    }
-
-   private:
-    WasmValue value_;
-  };
-
-  const WasmModule* module() const { return codemap_.module(); }
-
-  void DoTrap(TrapReason trap, pc_t pc) {
-    TRACE("TRAP: %s\n", WasmOpcodes::TrapReasonMessage(trap));
-    state_ = WasmInterpreter::TRAPPED;
-    trap_reason_ = trap;
-    CommitPc(pc);
-  }
-
-  void DoTrap(MessageTemplate message, pc_t pc) {
-    DoTrap(WasmOpcodes::MessageIdToTrapReason(message), pc);
-  }
-
-  // Check if there is room for a function's activation.
-  void EnsureStackSpaceForCall(InterpreterCode* code) {
-    EnsureStackSpace(code->side_table->max_stack_height_ +
-                     code->locals.num_locals);
-    DCHECK_GE(StackHeight(), code->function->sig->parameter_count());
-  }
-
-  // Push a frame with arguments already on the stack.
-  void PushFrame(InterpreterCode* code) {
-    DCHECK_NOT_NULL(code);
-    DCHECK_NOT_NULL(code->side_table);
-    EnsureStackSpaceForCall(code);
-
-    ++num_interpreted_calls_;
-    size_t arity = code->function->sig->parameter_count();
-    // The parameters will overlap the arguments already on the stack.
-    DCHECK_GE(StackHeight(), arity);
-
-    frames_.push_back(
-        {code, 0, StackHeight() - arity, Handle<FixedArray>::null()});
-    frames_.back().pc = InitLocals(code);
-    TRACE("  => PushFrame #%zu (#%u @%zu)\n", frames_.size() - 1,
-          code->function->func_index, frames_.back().pc);
-  }
-
-  pc_t InitLocals(InterpreterCode* code) {
-    for (ValueType p :
-         base::VectorOf(code->locals.local_types, code->locals.num_locals)) {
-      WasmValue val;
-      switch (p.kind()) {
-#define CASE_TYPE(valuetype, ctype) \
-  case valuetype:                   \
-    val = WasmValue(ctype{});       \
-    break;
-        FOREACH_WASMVALUE_CTYPES(CASE_TYPE)
-#undef CASE_TYPE
-        case kRefNull: {
-          val = WasmValue(isolate_->factory()->null_value(), p);
-          break;
-        }
-        case kRef:
-        case kRtt:
-        case kVoid:
-        case kBottom:
-        case kI8:
-        case kI16:
-          UNREACHABLE();
-      }
-      Push(val);
-    }
-    return code->locals.encoded_size;
-  }
-
-  void CommitPc(pc_t pc) {
-    DCHECK(!frames_.empty());
-    frames_.back().pc = pc;
-  }
-
-  void ReloadFromFrameOnException(Decoder* decoder, InterpreterCode** code,
-                                  pc_t* pc, pc_t* limit) {
-    Frame* top = &frames_.back();
-    *code = top->code;
-    *pc = top->pc;
-    *limit = top->code->end - top->code->start;
-    decoder->Reset(top->code->start, top->code->end);
-  }
-
-  int LookupTargetDelta(InterpreterCode* code, pc_t pc) {
-    return static_cast<int>(code->side_table->Lookup(pc).pc_diff);
-  }
-
-  bool JumpToHandlerDelta(InterpreterCode* code,
-                          Handle<Object> exception_object, pc_t* pc) {
-    auto it = code->side_table->map_.catch_map.find(*pc);
-    if (it == code->side_table->map_.catch_map.end()) {
-      // No handler in this frame means that we should rethrow to the caller.
-      return false;
-    }
-    CatchControlTransferEntry* handler = nullptr;
-    for (auto& entry : it->second) {
-      if (entry.tag_index < 0) {
-        ResetStack(StackHeight() - entry.sp_diff);
-        *pc += entry.pc_diff;
-        if (entry.tag_index == kRethrowOrDelegateExceptionIndex) {
-          // Recursively try to find a handler in the next enclosing try block
-          // (for the implicit rethrow) or in the delegate target.
-          return JumpToHandlerDelta(code, exception_object, pc);
-        }
-        handler = &entry;
-        break;
-      } else if (MatchingExceptionTag(exception_object, entry.tag_index)) {
-        handler = &entry;
-        const WasmTag* tag = &module()->tags[entry.tag_index];
-        const FunctionSig* sig = tag->sig;
-        int catch_in_arity = static_cast<int>(sig->parameter_count());
-        DoUnpackException(tag, exception_object);
-        DoStackTransfer(entry.sp_diff + catch_in_arity, catch_in_arity);
-        *pc += handler->pc_diff;
-        break;
-      }
-    }
-    if (!handler) return false;
-    if (frames_.back().caught_exception_stack.is_null()) {
-      Handle<FixedArray> caught_exception_stack =
-          isolate_->factory()->NewFixedArray(
-              code->side_table->max_control_stack_height);
-      caught_exception_stack->FillWithHoles(
-          0, code->side_table->max_control_stack_height);
-      frames_.back().caught_exception_stack =
-          isolate_->global_handles()->Create(*caught_exception_stack);
-    }
-    frames_.back().caught_exception_stack->set(handler->target_control_index,
-                                               *exception_object);
-    return true;
-  }
-
-  int DoBreak(InterpreterCode* code, pc_t pc, size_t depth) {
-    ControlTransferEntry& control_transfer_entry = code->side_table->Lookup(pc);
-    DoStackTransfer(control_transfer_entry.sp_diff,
-                    control_transfer_entry.target_arity);
-    return control_transfer_entry.pc_diff;
-  }
-
-  pc_t ReturnPc(Decoder* decoder, InterpreterCode* code, pc_t pc) {
-    switch (code->start[pc]) {
-      case kExprCallFunction: {
-        CallFunctionImmediate imm(decoder, code->at(pc + 1), kNoValidate);
-        return pc + 1 + imm.length;
-      }
-      case kExprCallIndirect: {
-        CallIndirectImmediate imm(decoder, code->at(pc + 1), kNoValidate);
-        return pc + 1 + imm.length;
-      }
-      default:
-        UNREACHABLE();
-    }
-  }
-
-  bool DoReturn(Decoder* decoder, InterpreterCode** code, pc_t* pc, pc_t* limit,
-                size_t arity) {
-    DCHECK_GT(frames_.size(), 0);
-    spdiff_t sp_diff = static_cast<spdiff_t>(StackHeight() - frames_.back().sp);
-    if (!frames_.back().caught_exception_stack.is_null()) {
-      isolate_->global_handles()->Destroy(
-          frames_.back().caught_exception_stack.location());
-    }
-    frames_.pop_back();
-    if (frames_.empty()) {
-      // A return from the last frame terminates the execution.
-      state_ = WasmInterpreter::FINISHED;
-      DoStackTransfer(sp_diff, arity);
-      TRACE("  => finish\n");
-      return false;
-    } else {
-      // Return to caller frame.
-      Frame* top = &frames_.back();
-      *code = top->code;
-      decoder->Reset((*code)->start, (*code)->end);
-      *pc = ReturnPc(decoder, *code, top->pc);
-      *limit = top->code->end - top->code->start;
-      TRACE("  => Return to #%zu (#%u @%zu)\n", frames_.size() - 1,
-            (*code)->function->func_index, *pc);
-      DoStackTransfer(sp_diff, arity);
-      return true;
-    }
-  }
-
-  // Returns true if the call was successful, false if the stack check failed
-  // and the stack was fully unwound.
-  bool DoCall(Decoder* decoder, InterpreterCode** target, pc_t* pc,
-              pc_t* limit) V8_WARN_UNUSED_RESULT {
-    frames_.back().pc = *pc;
-    PushFrame(*target);
-    return DoStackCheck(decoder, target, pc, limit);
-  }
-
-  // Returns true if the tail call was successful, false if the stack check
-  // failed.
-  bool DoReturnCall(Decoder* decoder, InterpreterCode* target, pc_t* pc,
-                    pc_t* limit) V8_WARN_UNUSED_RESULT {
-    DCHECK_NOT_NULL(target);
-    DCHECK_NOT_NULL(target->side_table);
-    EnsureStackSpaceForCall(target);
-
-    ++num_interpreted_calls_;
-
-    Frame* top = &frames_.back();
-
-    // Drop everything except current parameters.
-    spdiff_t sp_diff = static_cast<spdiff_t>(StackHeight() - top->sp);
-    size_t arity = target->function->sig->parameter_count();
-
-    DoStackTransfer(sp_diff, arity);
-
-    *limit = target->end - target->start;
-    decoder->Reset(target->start, target->end);
-
-    // Rebuild current frame to look like a call to callee.
-    top->code = target;
-    top->pc = 0;
-    top->sp = StackHeight() - arity;
-    top->pc = InitLocals(target);
-
-    *pc = top->pc;
-
-    TRACE("  => ReturnCall #%zu (#%u @%zu)\n", frames_.size() - 1,
-          target->function->func_index, top->pc);
-
-    return true;
-  }
-
-  // Copies {arity} values on the top of the stack down the stack while also
-  // dropping {sp_diff} many stack values in total from the stack.
-  void DoStackTransfer(spdiff_t sp_diff, size_t arity) {
-    // before: |---------------| pop_count | arity |
-    //         ^ 0             ^ dest      ^ src   ^ StackHeight()
-    //                         ^----< sp_diff >----^
-    //
-    // after:  |---------------| arity |
-    //         ^ 0                     ^ StackHeight()
-    sp_t stack_height = StackHeight();
-    sp_t dest = stack_height - sp_diff;
-    sp_t src = stack_height - arity;
-    DCHECK_LE(dest, stack_height);
-    DCHECK_LE(dest, src);
-    if (arity && (dest != src)) {
-      StackValue* stack = stack_.get();
-      memmove(stack + dest, stack + src, arity * sizeof(StackValue));
-      // Also move elements on the reference stack accordingly.
-      reference_stack_->MoveElements(
-          isolate_, static_cast<int>(dest), static_cast<int>(src),
-          static_cast<int>(arity), UPDATE_WRITE_BARRIER);
-    }
-    ResetStack(dest + arity);
-  }
-
-  Address EffectiveAddress(uint64_t index) {
-    DCHECK_GE(std::numeric_limits<uintptr_t>::max(),
-              instance_object_->memory_size());
-    DCHECK_GE(instance_object_->memory_size(), index);
-    // Compute the effective address of the access, making sure to condition
-    // the index even in the in-bounds case.
-    return reinterpret_cast<Address>(instance_object_->memory_start()) + index;
-  }
-
-  template <typename mtype>
-  Address BoundsCheckMem(uint64_t offset, uint64_t index) {
-    uint64_t effective_index = offset + index;
-    if (effective_index < index) {
-      return kNullAddress;  // wraparound => oob
-    }
-    if (!base::IsInBounds<uint64_t>(effective_index, sizeof(mtype),
-                                    instance_object_->memory_size())) {
-      return kNullAddress;  // oob
-    }
-    return EffectiveAddress(effective_index);
-  }
-
-  bool BoundsCheckMemRange(uint64_t index, uint64_t* size,
-                           Address* out_address) {
-    DCHECK_GE(std::numeric_limits<uintptr_t>::max(),
-              instance_object_->memory_size());
-    if (!base::ClampToBounds<uint64_t>(index, size,
-                                       instance_object_->memory_size())) {
-      return false;
-    }
-    *out_address = EffectiveAddress(index);
-    return true;
-  }
-
-  uint64_t ToMemType(WasmValue value) {
-    return module()->is_memory64 ? value.to<uint64_t>() : value.to<uint32_t>();
-  }
-
-  template <typename ctype, typename mtype>
-  bool ExecuteLoad(Decoder* decoder, InterpreterCode* code, pc_t pc,
-                   int* const len, MachineRepresentation rep,
-                   uint32_t prefix_len = 1) {
-    // prefix_len is the length of the opcode, before the immediate. We don't
-    // increment pc at the caller, because we want to keep pc to the start of
-    // the operation to keep trap reporting and tracing accurate, otherwise
-    // those will report at the middle of an opcode.
-    MemoryAccessImmediate imm(decoder, code->at(pc + prefix_len), sizeof(ctype),
-                              module()->is_memory64, kNoValidate);
-    uint64_t index = ToMemType(Pop());
-    Address addr = BoundsCheckMem<mtype>(imm.offset, index);
-    if (!addr) {
-      DoTrap(kTrapMemOutOfBounds, pc);
-      return false;
-    }
-    WasmValue result(
-        converter<ctype, mtype>{}(ReadLittleEndianValue<mtype>(addr)));
-
-    Push(result);
-    *len += imm.length;
-
-    if (v8_flags.trace_wasm_memory) {
-      MemoryTracingInfo info(imm.offset + index, false, rep);
-      TraceMemoryOperation({}, &info, code->function->func_index,
-                           static_cast<int>(pc),
-                           instance_object_->memory_start());
-    }
-
-    return true;
-  }
-
-  template <typename ctype, typename mtype>
-  bool ExecuteStore(Decoder* decoder, InterpreterCode* code, pc_t pc,
-                    int* const len, MachineRepresentation rep,
-                    uint32_t prefix_len = 1) {
-    // prefix_len is the length of the opcode, before the immediate. We don't
-    // increment pc at the caller, because we want to keep pc to the start of
-    // the operation to keep trap reporting and tracing accurate, otherwise
-    // those will report at the middle of an opcode.
-    MemoryAccessImmediate imm(decoder, code->at(pc + prefix_len), sizeof(ctype),
-                              module()->is_memory64, kNoValidate);
-    ctype val = Pop().to<ctype>();
-
-    uint64_t index = ToMemType(Pop());
-    Address addr = BoundsCheckMem<mtype>(imm.offset, index);
-    if (!addr) {
-      DoTrap(kTrapMemOutOfBounds, pc);
-      return false;
-    }
-    WriteLittleEndianValue<mtype>(addr, converter<mtype, ctype>{}(val));
-    *len += imm.length;
-
-    if (v8_flags.trace_wasm_memory) {
-      MemoryTracingInfo info(imm.offset + index, true, rep);
-      TraceMemoryOperation({}, &info, code->function->func_index,
-                           static_cast<int>(pc),
-                           instance_object_->memory_start());
-    }
-
-    return true;
-  }
-
-  template <typename type, typename op_type>
-  bool ExtractAtomicOpParams(Decoder* decoder, InterpreterCode* code,
-                             Address* address, pc_t pc, int* const len,
-                             type* val = nullptr, type* val2 = nullptr) {
-    MemoryAccessImmediate imm(decoder, code->at(pc + *len), sizeof(type),
-                              module()->is_memory64, kNoValidate);
-    if (val2) *val2 = static_cast<type>(Pop().to<op_type>());
-    if (val) *val = static_cast<type>(Pop().to<op_type>());
-    uint64_t index = ToMemType(Pop());
-    *address = BoundsCheckMem<type>(imm.offset, index);
-    if (!*address) {
-      DoTrap(kTrapMemOutOfBounds, pc);
-      return false;
-    }
-    if (!IsAligned(*address, sizeof(type))) {
-      DoTrap(kTrapUnalignedAccess, pc);
-      return false;
-    }
-    *len += imm.length;
-    return true;
-  }
-
-  template <typename type>
-  bool ExtractAtomicWaitNotifyParams(Decoder* decoder, InterpreterCode* code,
-                                     pc_t pc, int* const len,
-                                     uint64_t* buffer_offset, type* val,
-                                     int64_t* timeout = nullptr) {
-    // TODO(manoskouk): Introduce test which exposes wrong pc offset below.
-    MemoryAccessImmediate imm(decoder, code->at(pc + *len), sizeof(type),
-                              module()->is_memory64, kNoValidate);
-    if (timeout) {
-      *timeout = Pop().to<int64_t>();
-    }
-    *val = Pop().to<type>();
-    uint64_t index = ToMemType(Pop());
-    // Check bounds.
-    Address address = BoundsCheckMem<uint64_t>(imm.offset, index);
-    *buffer_offset = index + imm.offset;
-    if (!address) {
-      DoTrap(kTrapMemOutOfBounds, pc);
-      return false;
-    }
-    // Check alignment.
-    const uint32_t align_mask = sizeof(type) - 1;
-    if ((*buffer_offset & align_mask) != 0) {
-      DoTrap(kTrapUnalignedAccess, pc);
-      return false;
-    }
-    *len += imm.length;
-    return true;
-  }
-
-  bool ExecuteNumericOp(WasmOpcode opcode, Decoder* decoder,
-                        InterpreterCode* code, pc_t pc, int* const len) {
-    switch (opcode) {
-      case kExprI32SConvertSatF32:
-        Push(WasmValue(base::saturated_cast<int32_t>(Pop().to<float>())));
-        return true;
-      case kExprI32UConvertSatF32:
-        Push(WasmValue(base::saturated_cast<uint32_t>(Pop().to<float>())));
-        return true;
-      case kExprI32SConvertSatF64:
-        Push(WasmValue(base::saturated_cast<int32_t>(Pop().to<double>())));
-        return true;
-      case kExprI32UConvertSatF64:
-        Push(WasmValue(base::saturated_cast<uint32_t>(Pop().to<double>())));
-        return true;
-      case kExprI64SConvertSatF32:
-        Push(WasmValue(base::saturated_cast<int64_t>(Pop().to<float>())));
-        return true;
-      case kExprI64UConvertSatF32:
-        Push(WasmValue(base::saturated_cast<uint64_t>(Pop().to<float>())));
-        return true;
-      case kExprI64SConvertSatF64:
-        Push(WasmValue(base::saturated_cast<int64_t>(Pop().to<double>())));
-        return true;
-      case kExprI64UConvertSatF64:
-        Push(WasmValue(base::saturated_cast<uint64_t>(Pop().to<double>())));
-        return true;
-      case kExprMemoryInit: {
-        MemoryInitImmediate imm(decoder, code->at(pc + *len), kNoValidate);
-        // The data segment index must be in bounds since it is required by
-        // validation.
-        DCHECK_LT(imm.data_segment.index, module()->num_declared_data_segments);
-        *len += imm.length;
-        uint64_t size = ToMemType(Pop());
-        uint64_t src = ToMemType(Pop());
-        uint64_t dst = ToMemType(Pop());
-        Address dst_addr;
-        uint64_t src_max =
-            instance_object_->data_segment_sizes().get(imm.data_segment.index);
-        if (!BoundsCheckMemRange(dst, &size, &dst_addr) ||
-            !base::IsInBounds(src, size, src_max)) {
-          DoTrap(kTrapMemOutOfBounds, pc);
-          return false;
-        }
-        Address src_addr = instance_object_->data_segment_starts().get(
-                               imm.data_segment.index) +
-                           src;
-        std::memmove(reinterpret_cast<void*>(dst_addr),
-                     reinterpret_cast<void*>(src_addr), size);
-        return true;
-      }
-      case kExprDataDrop: {
-        IndexImmediate imm(decoder, code->at(pc + *len), "data segment index",
-                           kNoValidate);
-        // The data segment index must be in bounds since it is required by
-        // validation.
-        DCHECK_LT(imm.index, module()->num_declared_data_segments);
-        *len += imm.length;
-        instance_object_->data_segment_sizes().set(imm.index, 0);
-        return true;
-      }
-      case kExprMemoryCopy: {
-        MemoryCopyImmediate imm(decoder, code->at(pc + *len), kNoValidate);
-        *len += imm.length;
-        uint64_t size = ToMemType(Pop());
-        uint64_t src = ToMemType(Pop());
-        uint64_t dst = ToMemType(Pop());
-        Address dst_addr;
-        Address src_addr;
-        if (!BoundsCheckMemRange(dst, &size, &dst_addr) ||
-            !BoundsCheckMemRange(src, &size, &src_addr)) {
-          DoTrap(kTrapMemOutOfBounds, pc);
-          return false;
-        }
-
-        std::memmove(reinterpret_cast<void*>(dst_addr),
-                     reinterpret_cast<void*>(src_addr), size);
-        return true;
-      }
-      case kExprMemoryFill: {
-        MemoryIndexImmediate imm(decoder, code->at(pc + *len), kNoValidate);
-        *len += imm.length;
-        uint64_t size = ToMemType(Pop());
-        uint32_t value = Pop().to<uint32_t>();
-        uint64_t dst = ToMemType(Pop());
-        Address dst_addr;
-        if (!BoundsCheckMemRange(dst, &size, &dst_addr)) {
-          DoTrap(kTrapMemOutOfBounds, pc);
-          return false;
-        }
-        std::memset(reinterpret_cast<void*>(dst_addr), value, size);
-        return true;
-      }
-      case kExprTableInit: {
-        TableInitImmediate imm(decoder, code->at(pc + *len), kNoValidate);
-        *len += imm.length;
-        auto size = Pop().to<uint32_t>();
-        auto src = Pop().to<uint32_t>();
-        auto dst = Pop().to<uint32_t>();
-        HandleScope scope(isolate_);  // Avoid leaking handles.
-        base::Optional<MessageTemplate> opt_error =
-            WasmInstanceObject::InitTableEntries(
-                instance_object_->GetIsolate(), instance_object_,
-                imm.table.index, imm.element_segment.index, dst, src, size);
-        if (opt_error.has_value()) {
-          DoTrap(opt_error.value(), pc);
-          return false;
-        }
-
-        return true;
-      }
-      case kExprElemDrop: {
-        IndexImmediate imm(decoder, code->at(pc + *len),
-                           "element segment index", kNoValidate);
-        *len += imm.length;
-        instance_object_->element_segments().set(
-            imm.index, *isolate_->factory()->empty_fixed_array());
-        return true;
-      }
-      case kExprTableCopy: {
-        TableCopyImmediate imm(decoder, code->at(pc + *len), kNoValidate);
-        auto size = Pop().to<uint32_t>();
-        auto src = Pop().to<uint32_t>();
-        auto dst = Pop().to<uint32_t>();
-        HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-        bool ok = WasmInstanceObject::CopyTableEntries(
-            isolate_, instance_object_, imm.table_dst.index,
-            imm.table_src.index, dst, src, size);
-        if (!ok) DoTrap(kTrapTableOutOfBounds, pc);
-        *len += imm.length;
-        return ok;
-      }
-      case kExprTableGrow: {
-        IndexImmediate imm(decoder, code->at(pc + *len), "table index",
-                           kNoValidate);
-        HandleScope handle_scope(isolate_);
-        auto table = handle(
-            WasmTableObject::cast(instance_object_->tables().get(imm.index)),
-            isolate_);
-        auto delta = Pop().to<uint32_t>();
-        auto value = Pop().to_ref();
-        int32_t result = WasmTableObject::Grow(isolate_, table, delta, value);
-        Push(WasmValue(result));
-        *len += imm.length;
-        return true;
-      }
-      case kExprTableSize: {
-        IndexImmediate imm(decoder, code->at(pc + *len), "table index",
-                           kNoValidate);
-        HandleScope handle_scope(isolate_);
-        auto table = handle(
-            WasmTableObject::cast(instance_object_->tables().get(imm.index)),
-            isolate_);
-        uint32_t table_size = table->current_length();
-        Push(WasmValue(table_size));
-        *len += imm.length;
-        return true;
-      }
-      case kExprTableFill: {
-        IndexImmediate imm(decoder, code->at(pc + *len), "table index",
-                           kNoValidate);
-        HandleScope handle_scope(isolate_);
-        auto count = Pop().to<uint32_t>();
-        auto value = Pop().to_ref();
-        auto start = Pop().to<uint32_t>();
-
-        auto table = handle(
-            WasmTableObject::cast(instance_object_->tables().get(imm.index)),
-            isolate_);
-        uint32_t table_size = table->current_length();
-        if (start > table_size) {
-          DoTrap(kTrapTableOutOfBounds, pc);
-          return false;
-        }
-
-        // Even when table.fill goes out-of-bounds, as many entries as possible
-        // are put into the table. Only afterwards we trap.
-        uint32_t fill_count = std::min(count, table_size - start);
-        if (fill_count < count) {
-          DoTrap(kTrapTableOutOfBounds, pc);
-          return false;
-        }
-        WasmTableObject::Fill(isolate_, table, start, value, fill_count);
-
-        *len += imm.length;
-        return true;
-      }
-      default:
-        FATAL(
-            "Unknown or unimplemented opcode #%d:%s", code->start[pc],
-            WasmOpcodes::OpcodeName(static_cast<WasmOpcode>(code->start[pc])));
-        UNREACHABLE();
-    }
-  }
-
-  template <typename type, typename op_type, typename func>
-  op_type ExecuteAtomicBinopBE(type val, Address addr, func op) {
-    type old_val;
-    type new_val;
-    old_val = ReadUnalignedValue<type>(addr);
-    do {
-      new_val =
-          ByteReverse(static_cast<type>(op(ByteReverse<type>(old_val), val)));
-    } while (!(std::atomic_compare_exchange_strong(
-        reinterpret_cast<std::atomic<type>*>(addr), &old_val, new_val)));
-    return static_cast<op_type>(ByteReverse<type>(old_val));
-  }
-
-  template <typename type>
-  type AdjustByteOrder(type param) {
-#if V8_TARGET_BIG_ENDIAN
-    return ByteReverse(param);
-#else
-    return param;
-#endif
-  }
-
-  bool ExecuteAtomicOp(WasmOpcode opcode, Decoder* decoder,
-                       InterpreterCode* code, pc_t pc, int* const len) {
-#if V8_TARGET_BIG_ENDIAN
-    constexpr bool kBigEndian = true;
-#else
-    constexpr bool kBigEndian = false;
-#endif
-    switch (opcode) {
-#define ATOMIC_BINOP_CASE(name, type, op_type, operation, op)                \
-  case kExpr##name: {                                                        \
-    type val;                                                                \
-    Address addr;                                                            \
-    op_type result;                                                          \
-    if (!ExtractAtomicOpParams<type, op_type>(decoder, code, &addr, pc, len, \
-                                              &val)) {                       \
-      return false;                                                          \
-    }                                                                        \
-    static_assert(sizeof(std::atomic<type>) == sizeof(type),                 \
-                  "Size mismatch for types std::atomic<" #type               \
-                  ">, and " #type);                                          \
-    if (kBigEndian) {                                                        \
-      auto oplambda = [](type a, type b) { return a op b; };                 \
-      result = ExecuteAtomicBinopBE<type, op_type>(val, addr, oplambda);     \
-    } else {                                                                 \
-      result = static_cast<op_type>(                                         \
-          std::operation(reinterpret_cast<std::atomic<type>*>(addr), val));  \
-    }                                                                        \
-    Push(WasmValue(result));                                                 \
-    break;                                                                   \
-  }
-      ATOMIC_BINOP_CASE(I32AtomicAdd, uint32_t, uint32_t, atomic_fetch_add, +);
-      ATOMIC_BINOP_CASE(I32AtomicAdd8U, uint8_t, uint32_t, atomic_fetch_add, +);
-      ATOMIC_BINOP_CASE(I32AtomicAdd16U, uint16_t, uint32_t, atomic_fetch_add,
-                        +);
-      ATOMIC_BINOP_CASE(I32AtomicSub, uint32_t, uint32_t, atomic_fetch_sub, -);
-      ATOMIC_BINOP_CASE(I32AtomicSub8U, uint8_t, uint32_t, atomic_fetch_sub, -);
-      ATOMIC_BINOP_CASE(I32AtomicSub16U, uint16_t, uint32_t, atomic_fetch_sub,
-                        -);
-      ATOMIC_BINOP_CASE(I32AtomicAnd, uint32_t, uint32_t, atomic_fetch_and, &);
-      ATOMIC_BINOP_CASE(I32AtomicAnd8U, uint8_t, uint32_t, atomic_fetch_and, &);
-      ATOMIC_BINOP_CASE(I32AtomicAnd16U, uint16_t, uint32_t,
-                        atomic_fetch_and, &);
-      ATOMIC_BINOP_CASE(I32AtomicOr, uint32_t, uint32_t, atomic_fetch_or, |);
-      ATOMIC_BINOP_CASE(I32AtomicOr8U, uint8_t, uint32_t, atomic_fetch_or, |);
-      ATOMIC_BINOP_CASE(I32AtomicOr16U, uint16_t, uint32_t, atomic_fetch_or, |);
-      ATOMIC_BINOP_CASE(I32AtomicXor, uint32_t, uint32_t, atomic_fetch_xor, ^);
-      ATOMIC_BINOP_CASE(I32AtomicXor8U, uint8_t, uint32_t, atomic_fetch_xor, ^);
-      ATOMIC_BINOP_CASE(I32AtomicXor16U, uint16_t, uint32_t, atomic_fetch_xor,
-                        ^);
-      ATOMIC_BINOP_CASE(I32AtomicExchange, uint32_t, uint32_t, atomic_exchange,
-                        =);
-      ATOMIC_BINOP_CASE(I32AtomicExchange8U, uint8_t, uint32_t, atomic_exchange,
-                        =);
-      ATOMIC_BINOP_CASE(I32AtomicExchange16U, uint16_t, uint32_t,
-                        atomic_exchange, =);
-      ATOMIC_BINOP_CASE(I64AtomicAdd, uint64_t, uint64_t, atomic_fetch_add, +);
-      ATOMIC_BINOP_CASE(I64AtomicAdd8U, uint8_t, uint64_t, atomic_fetch_add, +);
-      ATOMIC_BINOP_CASE(I64AtomicAdd16U, uint16_t, uint64_t, atomic_fetch_add,
-                        +);
-      ATOMIC_BINOP_CASE(I64AtomicAdd32U, uint32_t, uint64_t, atomic_fetch_add,
-                        +);
-      ATOMIC_BINOP_CASE(I64AtomicSub, uint64_t, uint64_t, atomic_fetch_sub, -);
-      ATOMIC_BINOP_CASE(I64AtomicSub8U, uint8_t, uint64_t, atomic_fetch_sub, -);
-      ATOMIC_BINOP_CASE(I64AtomicSub16U, uint16_t, uint64_t, atomic_fetch_sub,
-                        -);
-      ATOMIC_BINOP_CASE(I64AtomicSub32U, uint32_t, uint64_t, atomic_fetch_sub,
-                        -);
-      ATOMIC_BINOP_CASE(I64AtomicAnd, uint64_t, uint64_t, atomic_fetch_and, &);
-      ATOMIC_BINOP_CASE(I64AtomicAnd8U, uint8_t, uint64_t, atomic_fetch_and, &);
-      ATOMIC_BINOP_CASE(I64AtomicAnd16U, uint16_t, uint64_t,
-                        atomic_fetch_and, &);
-      ATOMIC_BINOP_CASE(I64AtomicAnd32U, uint32_t, uint64_t,
-                        atomic_fetch_and, &);
-      ATOMIC_BINOP_CASE(I64AtomicOr, uint64_t, uint64_t, atomic_fetch_or, |);
-      ATOMIC_BINOP_CASE(I64AtomicOr8U, uint8_t, uint64_t, atomic_fetch_or, |);
-      ATOMIC_BINOP_CASE(I64AtomicOr16U, uint16_t, uint64_t, atomic_fetch_or, |);
-      ATOMIC_BINOP_CASE(I64AtomicOr32U, uint32_t, uint64_t, atomic_fetch_or, |);
-      ATOMIC_BINOP_CASE(I64AtomicXor, uint64_t, uint64_t, atomic_fetch_xor, ^);
-      ATOMIC_BINOP_CASE(I64AtomicXor8U, uint8_t, uint64_t, atomic_fetch_xor, ^);
-      ATOMIC_BINOP_CASE(I64AtomicXor16U, uint16_t, uint64_t, atomic_fetch_xor,
-                        ^);
-      ATOMIC_BINOP_CASE(I64AtomicXor32U, uint32_t, uint64_t, atomic_fetch_xor,
-                        ^);
-      ATOMIC_BINOP_CASE(I64AtomicExchange, uint64_t, uint64_t, atomic_exchange,
-                        =);
-      ATOMIC_BINOP_CASE(I64AtomicExchange8U, uint8_t, uint64_t, atomic_exchange,
-                        =);
-      ATOMIC_BINOP_CASE(I64AtomicExchange16U, uint16_t, uint64_t,
-                        atomic_exchange, =);
-      ATOMIC_BINOP_CASE(I64AtomicExchange32U, uint32_t, uint64_t,
-                        atomic_exchange, =);
-#undef ATOMIC_BINOP_CASE
-#define ATOMIC_COMPARE_EXCHANGE_CASE(name, type, op_type)                    \
-  case kExpr##name: {                                                        \
-    type old_val;                                                            \
-    type new_val;                                                            \
-    Address addr;                                                            \
-    if (!ExtractAtomicOpParams<type, op_type>(decoder, code, &addr, pc, len, \
-                                              &old_val, &new_val)) {         \
-      return false;                                                          \
-    }                                                                        \
-    static_assert(sizeof(std::atomic<type>) == sizeof(type),                 \
-                  "Size mismatch for types std::atomic<" #type               \
-                  ">, and " #type);                                          \
-    old_val = AdjustByteOrder<type>(old_val);                                \
-    new_val = AdjustByteOrder<type>(new_val);                                \
-    std::atomic_compare_exchange_strong(                                     \
-        reinterpret_cast<std::atomic<type>*>(addr), &old_val, new_val);      \
-    Push(WasmValue(static_cast<op_type>(AdjustByteOrder<type>(old_val))));   \
-    break;                                                                   \
-  }
-      ATOMIC_COMPARE_EXCHANGE_CASE(I32AtomicCompareExchange, uint32_t,
-                                   uint32_t);
-      ATOMIC_COMPARE_EXCHANGE_CASE(I32AtomicCompareExchange8U, uint8_t,
-                                   uint32_t);
-      ATOMIC_COMPARE_EXCHANGE_CASE(I32AtomicCompareExchange16U, uint16_t,
-                                   uint32_t);
-      ATOMIC_COMPARE_EXCHANGE_CASE(I64AtomicCompareExchange, uint64_t,
-                                   uint64_t);
-      ATOMIC_COMPARE_EXCHANGE_CASE(I64AtomicCompareExchange8U, uint8_t,
-                                   uint64_t);
-      ATOMIC_COMPARE_EXCHANGE_CASE(I64AtomicCompareExchange16U, uint16_t,
-                                   uint64_t);
-      ATOMIC_COMPARE_EXCHANGE_CASE(I64AtomicCompareExchange32U, uint32_t,
-                                   uint64_t);
-#undef ATOMIC_COMPARE_EXCHANGE_CASE
-#define ATOMIC_LOAD_CASE(name, type, op_type, operation)                     \
-  case kExpr##name: {                                                        \
-    Address addr;                                                            \
-    if (!ExtractAtomicOpParams<type, op_type>(decoder, code, &addr, pc,      \
-                                              len)) {                        \
-      return false;                                                          \
-    }                                                                        \
-    static_assert(sizeof(std::atomic<type>) == sizeof(type),                 \
-                  "Size mismatch for types std::atomic<" #type               \
-                  ">, and " #type);                                          \
-    WasmValue result = WasmValue(static_cast<op_type>(AdjustByteOrder<type>( \
-        std::operation(reinterpret_cast<std::atomic<type>*>(addr)))));       \
-    Push(result);                                                            \
-    break;                                                                   \
-  }
-      ATOMIC_LOAD_CASE(I32AtomicLoad, uint32_t, uint32_t, atomic_load);
-      ATOMIC_LOAD_CASE(I32AtomicLoad8U, uint8_t, uint32_t, atomic_load);
-      ATOMIC_LOAD_CASE(I32AtomicLoad16U, uint16_t, uint32_t, atomic_load);
-      ATOMIC_LOAD_CASE(I64AtomicLoad, uint64_t, uint64_t, atomic_load);
-      ATOMIC_LOAD_CASE(I64AtomicLoad8U, uint8_t, uint64_t, atomic_load);
-      ATOMIC_LOAD_CASE(I64AtomicLoad16U, uint16_t, uint64_t, atomic_load);
-      ATOMIC_LOAD_CASE(I64AtomicLoad32U, uint32_t, uint64_t, atomic_load);
-#undef ATOMIC_LOAD_CASE
-#define ATOMIC_STORE_CASE(name, type, op_type, operation)                    \
-  case kExpr##name: {                                                        \
-    type val;                                                                \
-    Address addr;                                                            \
-    if (!ExtractAtomicOpParams<type, op_type>(decoder, code, &addr, pc, len, \
-                                              &val)) {                       \
-      return false;                                                          \
-    }                                                                        \
-    static_assert(sizeof(std::atomic<type>) == sizeof(type),                 \
-                  "Size mismatch for types std::atomic<" #type               \
-                  ">, and " #type);                                          \
-    std::operation(reinterpret_cast<std::atomic<type>*>(addr),               \
-                   AdjustByteOrder<type>(val));                              \
-    break;                                                                   \
-  }
-      ATOMIC_STORE_CASE(I32AtomicStore, uint32_t, uint32_t, atomic_store);
-      ATOMIC_STORE_CASE(I32AtomicStore8U, uint8_t, uint32_t, atomic_store);
-      ATOMIC_STORE_CASE(I32AtomicStore16U, uint16_t, uint32_t, atomic_store);
-      ATOMIC_STORE_CASE(I64AtomicStore, uint64_t, uint64_t, atomic_store);
-      ATOMIC_STORE_CASE(I64AtomicStore8U, uint8_t, uint64_t, atomic_store);
-      ATOMIC_STORE_CASE(I64AtomicStore16U, uint16_t, uint64_t, atomic_store);
-      ATOMIC_STORE_CASE(I64AtomicStore32U, uint32_t, uint64_t, atomic_store);
-#undef ATOMIC_STORE_CASE
-      case kExprAtomicFence:
-        std::atomic_thread_fence(std::memory_order_seq_cst);
-        *len += 1;
-        break;
-      case kExprI32AtomicWait: {
-        if (!module()->has_shared_memory || !isolate_->allow_atomics_wait()) {
-          DoTrap(kTrapUnreachable, pc);
-          return false;
-        }
-        int32_t val;
-        int64_t timeout;
-        uint64_t buffer_offset;
-        if (!ExtractAtomicWaitNotifyParams<int32_t>(
-                decoder, code, pc, len, &buffer_offset, &val, &timeout)) {
-          return false;
-        }
-        HandleScope handle_scope(isolate_);
-        Handle<JSArrayBuffer> array_buffer(
-            instance_object_->memory_object().array_buffer(), isolate_);
-        auto result = FutexEmulation::WaitWasm32(isolate_, array_buffer,
-                                                 buffer_offset, val, timeout);
-        Push(WasmValue(result.ToSmi().value()));
-        break;
-      }
-      case kExprI64AtomicWait: {
-        if (!module()->has_shared_memory || !isolate_->allow_atomics_wait()) {
-          DoTrap(kTrapUnreachable, pc);
-          return false;
-        }
-        int64_t val;
-        int64_t timeout;
-        uint64_t buffer_offset;
-        if (!ExtractAtomicWaitNotifyParams<int64_t>(
-                decoder, code, pc, len, &buffer_offset, &val, &timeout)) {
-          return false;
-        }
-        HandleScope handle_scope(isolate_);
-        Handle<JSArrayBuffer> array_buffer(
-            instance_object_->memory_object().array_buffer(), isolate_);
-        auto result = FutexEmulation::WaitWasm64(isolate_, array_buffer,
-                                                 buffer_offset, val, timeout);
-        Push(WasmValue(result.ToSmi().value()));
-        break;
-      }
-      case kExprAtomicNotify: {
-        int32_t val;
-        uint64_t buffer_offset;
-        if (!ExtractAtomicWaitNotifyParams<int32_t>(decoder, code, pc, len,
-                                                    &buffer_offset, &val)) {
-          return false;
-        }
-        if (!module()->has_shared_memory) {
-          Push(WasmValue(0));
-          break;
-        }
-        HandleScope handle_scope(isolate_);
-        Handle<JSArrayBuffer> array_buffer(
-            instance_object_->memory_object().array_buffer(), isolate_);
-        auto result = FutexEmulation::Wake(array_buffer, buffer_offset, val);
-        Push(WasmValue(result.ToSmi().value()));
-        break;
-      }
-      default:
-        UNREACHABLE();
-    }
-    return true;
-  }
-
-  template <typename T, T (*float_round_op)(T)>
-  T AixFpOpWorkaround(T input) {
-#if V8_OS_AIX
-    return FpOpWorkaround<T>(input, float_round_op(input));
-#else
-    return float_round_op(input);
-#endif
-  }
-  bool ExecuteSimdOp(WasmOpcode opcode, Decoder* decoder, InterpreterCode* code,
-                     pc_t pc, int* const len) {
-    switch (opcode) {
-#define SPLAT_CASE(format, sType, valType, num) \
-  case kExpr##format##Splat: {                  \
-    WasmValue val = Pop();                      \
-    valType v = val.to<valType>();              \
-    sType s;                                    \
-    for (int i = 0; i < num; i++) s.val[i] = v; \
-    Push(WasmValue(Simd128(s)));                \
-    return true;                                \
-  }
-      SPLAT_CASE(F64x2, float2, double, 2)
-      SPLAT_CASE(F32x4, float4, float, 4)
-      SPLAT_CASE(I64x2, int2, int64_t, 2)
-      SPLAT_CASE(I32x4, int4, int32_t, 4)
-      SPLAT_CASE(I16x8, int8, int32_t, 8)
-      SPLAT_CASE(I8x16, int16, int32_t, 16)
-#undef SPLAT_CASE
-#define EXTRACT_LANE_CASE(format, name)                               \
-  case kExpr##format##ExtractLane: {                                  \
-    SimdLaneImmediate imm(decoder, code->at(pc + *len), kNoValidate); \
-    *len += 1;                                                        \
-    WasmValue val = Pop();                                            \
-    Simd128 s = val.to_s128();                                        \
-    auto ss = s.to_##name();                                          \
-    Push(WasmValue(ss.val[LANE(imm.lane, ss)]));                      \
-    return true;                                                      \
-  }
-      EXTRACT_LANE_CASE(F64x2, f64x2)
-      EXTRACT_LANE_CASE(F32x4, f32x4)
-      EXTRACT_LANE_CASE(I64x2, i64x2)
-      EXTRACT_LANE_CASE(I32x4, i32x4)
-#undef EXTRACT_LANE_CASE
-
-      // Unsigned extracts require a bit more care. The underlying array in
-      // Simd128 is signed (see wasm-value.h), so when casted to uint32_t it
-      // will be signed extended, e.g. int8_t -> int32_t -> uint32_t. So for
-      // unsigned extracts, we will cast it int8_t -> uint8_t -> uint32_t. We
-      // add the DCHECK to ensure that if the array type changes, we know to
-      // change this function.
-#define EXTRACT_LANE_EXTEND_CASE(format, name, sign, extended_type)      \
-  case kExpr##format##ExtractLane##sign: {                               \
-    SimdLaneImmediate imm(decoder, code->at(pc + *len), kNoValidate);    \
-    *len += 1;                                                           \
-    WasmValue val = Pop();                                               \
-    Simd128 s = val.to_s128();                                           \
-    auto ss = s.to_##name();                                             \
-    auto res = ss.val[LANE(imm.lane, ss)];                               \
-    DCHECK(std::is_signed<decltype(res)>::value);                        \
-    if (std::is_unsigned<extended_type>::value) {                        \
-      using unsigned_type = std::make_unsigned<decltype(res)>::type;     \
-      Push(WasmValue(                                                    \
-          static_cast<extended_type>(static_cast<unsigned_type>(res)))); \
-    } else {                                                             \
-      Push(WasmValue(static_cast<extended_type>(res)));                  \
-    }                                                                    \
-    return true;                                                         \
-  }
-      EXTRACT_LANE_EXTEND_CASE(I16x8, i16x8, S, int32_t)
-      EXTRACT_LANE_EXTEND_CASE(I16x8, i16x8, U, uint32_t)
-      EXTRACT_LANE_EXTEND_CASE(I8x16, i8x16, S, int32_t)
-      EXTRACT_LANE_EXTEND_CASE(I8x16, i8x16, U, uint32_t)
-#undef EXTRACT_LANE_EXTEND_CASE
-
-#define BINOP_CASE(op, name, stype, count, expr)              \
-  case kExpr##op: {                                           \
-    WasmValue v2 = Pop();                                     \
-    WasmValue v1 = Pop();                                     \
-    stype s1 = v1.to_s128().to_##name();                      \
-    stype s2 = v2.to_s128().to_##name();                      \
-    stype res;                                                \
-    for (size_t i = 0; i < count; ++i) {                      \
-      auto a = s1.val[LANE(i, s1)];                           \
-      auto b = s2.val[LANE(i, s2)];                           \
-      auto result = expr;                                     \
-      possible_nondeterminism_ |= has_nondeterminism(result); \
-      res.val[LANE(i, res)] = expr;                           \
-    }                                                         \
-    Push(WasmValue(Simd128(res)));                            \
-    return true;                                              \
-  }
-      BINOP_CASE(F64x2Add, f64x2, float2, 2, a + b)
-      BINOP_CASE(F64x2Sub, f64x2, float2, 2, a - b)
-      BINOP_CASE(F64x2Mul, f64x2, float2, 2, a * b)
-      BINOP_CASE(F64x2Div, f64x2, float2, 2, base::Divide(a, b))
-      BINOP_CASE(F64x2Min, f64x2, float2, 2, JSMin(a, b))
-      BINOP_CASE(F64x2Max, f64x2, float2, 2, JSMax(a, b))
-      BINOP_CASE(F64x2Pmin, f64x2, float2, 2, std::min(a, b))
-      BINOP_CASE(F64x2Pmax, f64x2, float2, 2, std::max(a, b))
-      BINOP_CASE(F32x4RelaxedMin, f32x4, float4, 4, std::min(a, b))
-      BINOP_CASE(F32x4RelaxedMax, f32x4, float4, 4, std::max(a, b))
-      BINOP_CASE(F64x2RelaxedMin, f64x2, float2, 2, std::min(a, b))
-      BINOP_CASE(F64x2RelaxedMax, f64x2, float2, 2, std::max(a, b))
-      BINOP_CASE(F32x4Add, f32x4, float4, 4, a + b)
-      BINOP_CASE(F32x4Sub, f32x4, float4, 4, a - b)
-      BINOP_CASE(F32x4Mul, f32x4, float4, 4, a * b)
-      BINOP_CASE(F32x4Div, f32x4, float4, 4, a / b)
-      BINOP_CASE(F32x4Min, f32x4, float4, 4, JSMin(a, b))
-      BINOP_CASE(F32x4Max, f32x4, float4, 4, JSMax(a, b))
-      BINOP_CASE(F32x4Pmin, f32x4, float4, 4, std::min(a, b))
-      BINOP_CASE(F32x4Pmax, f32x4, float4, 4, std::max(a, b))
-      BINOP_CASE(I64x2Add, i64x2, int2, 2, base::AddWithWraparound(a, b))
-      BINOP_CASE(I64x2Sub, i64x2, int2, 2, base::SubWithWraparound(a, b))
-      BINOP_CASE(I64x2Mul, i64x2, int2, 2, base::MulWithWraparound(a, b))
-      BINOP_CASE(I32x4Add, i32x4, int4, 4, base::AddWithWraparound(a, b))
-      BINOP_CASE(I32x4Sub, i32x4, int4, 4, base::SubWithWraparound(a, b))
-      BINOP_CASE(I32x4Mul, i32x4, int4, 4, base::MulWithWraparound(a, b))
-      BINOP_CASE(I32x4MinS, i32x4, int4, 4, a < b ? a : b)
-      BINOP_CASE(I32x4MinU, i32x4, int4, 4,
-                 static_cast<uint32_t>(a) < static_cast<uint32_t>(b) ? a : b)
-      BINOP_CASE(I32x4MaxS, i32x4, int4, 4, a > b ? a : b)
-      BINOP_CASE(I32x4MaxU, i32x4, int4, 4,
-                 static_cast<uint32_t>(a) > static_cast<uint32_t>(b) ? a : b)
-      BINOP_CASE(S128And, i32x4, int4, 4, a & b)
-      BINOP_CASE(S128Or, i32x4, int4, 4, a | b)
-      BINOP_CASE(S128Xor, i32x4, int4, 4, a ^ b)
-      BINOP_CASE(S128AndNot, i32x4, int4, 4, a & ~b)
-      BINOP_CASE(I16x8Add, i16x8, int8, 8, base::AddWithWraparound(a, b))
-      BINOP_CASE(I16x8Sub, i16x8, int8, 8, base::SubWithWraparound(a, b))
-      BINOP_CASE(I16x8Mul, i16x8, int8, 8, base::MulWithWraparound(a, b))
-      BINOP_CASE(I16x8MinS, i16x8, int8, 8, a < b ? a : b)
-      BINOP_CASE(I16x8MinU, i16x8, int8, 8,
-                 static_cast<uint16_t>(a) < static_cast<uint16_t>(b) ? a : b)
-      BINOP_CASE(I16x8MaxS, i16x8, int8, 8, a > b ? a : b)
-      BINOP_CASE(I16x8MaxU, i16x8, int8, 8,
-                 static_cast<uint16_t>(a) > static_cast<uint16_t>(b) ? a : b)
-      BINOP_CASE(I16x8AddSatS, i16x8, int8, 8, SaturateAdd<int16_t>(a, b))
-      BINOP_CASE(I16x8AddSatU, i16x8, int8, 8, SaturateAdd<uint16_t>(a, b))
-      BINOP_CASE(I16x8SubSatS, i16x8, int8, 8, SaturateSub<int16_t>(a, b))
-      BINOP_CASE(I16x8SubSatU, i16x8, int8, 8, SaturateSub<uint16_t>(a, b))
-      BINOP_CASE(I16x8RoundingAverageU, i16x8, int8, 8,
-                 RoundingAverageUnsigned<uint16_t>(a, b))
-      BINOP_CASE(I16x8Q15MulRSatS, i16x8, int8, 8,
-                 SaturateRoundingQMul<int16_t>(a, b))
-      BINOP_CASE(I16x8RelaxedQ15MulRS, i16x8, int8, 8,
-                 SaturateRoundingQMul<int16_t>(a, b))
-      BINOP_CASE(I8x16Add, i8x16, int16, 16, base::AddWithWraparound(a, b))
-      BINOP_CASE(I8x16Sub, i8x16, int16, 16, base::SubWithWraparound(a, b))
-      BINOP_CASE(I8x16MinS, i8x16, int16, 16, a < b ? a : b)
-      BINOP_CASE(I8x16MinU, i8x16, int16, 16,
-                 static_cast<uint8_t>(a) < static_cast<uint8_t>(b) ? a : b)
-      BINOP_CASE(I8x16MaxS, i8x16, int16, 16, a > b ? a : b)
-      BINOP_CASE(I8x16MaxU, i8x16, int16, 16,
-                 static_cast<uint8_t>(a) > static_cast<uint8_t>(b) ? a : b)
-      BINOP_CASE(I8x16AddSatS, i8x16, int16, 16, SaturateAdd<int8_t>(a, b))
-      BINOP_CASE(I8x16AddSatU, i8x16, int16, 16, SaturateAdd<uint8_t>(a, b))
-      BINOP_CASE(I8x16SubSatS, i8x16, int16, 16, SaturateSub<int8_t>(a, b))
-      BINOP_CASE(I8x16SubSatU, i8x16, int16, 16, SaturateSub<uint8_t>(a, b))
-      BINOP_CASE(I8x16RoundingAverageU, i8x16, int16, 16,
-                 RoundingAverageUnsigned<uint8_t>(a, b))
-#undef BINOP_CASE
-#define UNOP_CASE(op, name, stype, count, expr)               \
-  case kExpr##op: {                                           \
-    WasmValue v = Pop();                                      \
-    stype s = v.to_s128().to_##name();                        \
-    stype res;                                                \
-    for (size_t i = 0; i < count; ++i) {                      \
-      auto a = s.val[LANE(i, s)];                             \
-      auto result = expr;                                     \
-      possible_nondeterminism_ |= has_nondeterminism(result); \
-      res.val[LANE(i, res)] = result;                         \
-    }                                                         \
-    Push(WasmValue(Simd128(res)));                            \
-    return true;                                              \
-  }
-      UNOP_CASE(F64x2Abs, f64x2, float2, 2, std::abs(a))
-      UNOP_CASE(F64x2Neg, f64x2, float2, 2, -a)
-      UNOP_CASE(F64x2Sqrt, f64x2, float2, 2, std::sqrt(a))
-      UNOP_CASE(F64x2Ceil, f64x2, float2, 2,
-                (AixFpOpWorkaround<double, &ceil>(a)))
-      UNOP_CASE(F64x2Floor, f64x2, float2, 2,
-                (AixFpOpWorkaround<double, &floor>(a)))
-      UNOP_CASE(F64x2Trunc, f64x2, float2, 2,
-                (AixFpOpWorkaround<double, &trunc>(a)))
-      UNOP_CASE(F64x2NearestInt, f64x2, float2, 2,
-                (AixFpOpWorkaround<double, &nearbyint>(a)))
-      UNOP_CASE(F32x4Abs, f32x4, float4, 4, std::abs(a))
-      UNOP_CASE(F32x4Neg, f32x4, float4, 4, -a)
-      UNOP_CASE(F32x4Sqrt, f32x4, float4, 4, std::sqrt(a))
-      UNOP_CASE(F32x4Ceil, f32x4, float4, 4,
-                (AixFpOpWorkaround<float, &ceilf>(a)))
-      UNOP_CASE(F32x4Floor, f32x4, float4, 4,
-                (AixFpOpWorkaround<float, &floorf>(a)))
-      UNOP_CASE(F32x4Trunc, f32x4, float4, 4,
-                (AixFpOpWorkaround<float, &truncf>(a)))
-      UNOP_CASE(F32x4NearestInt, f32x4, float4, 4,
-                (AixFpOpWorkaround<float, &nearbyintf>(a)))
-      UNOP_CASE(I64x2Neg, i64x2, int2, 2, base::NegateWithWraparound(a))
-      UNOP_CASE(I32x4Neg, i32x4, int4, 4, base::NegateWithWraparound(a))
-      // Use llabs which will work correctly on both 64-bit and 32-bit.
-      UNOP_CASE(I64x2Abs, i64x2, int2, 2, std::llabs(a))
-      UNOP_CASE(I32x4Abs, i32x4, int4, 4, std::abs(a))
-      UNOP_CASE(S128Not, i32x4, int4, 4, ~a)
-      UNOP_CASE(I16x8Neg, i16x8, int8, 8, base::NegateWithWraparound(a))
-      UNOP_CASE(I16x8Abs, i16x8, int8, 8, std::abs(a))
-      UNOP_CASE(I8x16Neg, i8x16, int16, 16, base::NegateWithWraparound(a))
-      UNOP_CASE(I8x16Abs, i8x16, int16, 16, std::abs(a))
-      UNOP_CASE(I8x16Popcnt, i8x16, int16, 16,
-                base::bits::CountPopulation<uint8_t>(a))
-#undef UNOP_CASE
-
-// Cast to double in call to signbit is due to MSCV issue, see
-// https://github.com/microsoft/STL/issues/519.
-#define BITMASK_CASE(op, name, stype, count)                            \
-  case kExpr##op: {                                                     \
-    WasmValue v = Pop();                                                \
-    stype s = v.to_s128().to_##name();                                  \
-    int32_t res = 0;                                                    \
-    for (size_t i = 0; i < count; ++i) {                                \
-      bool sign = std::signbit(static_cast<double>(s.val[LANE(i, s)])); \
-      res |= (sign << i);                                               \
-    }                                                                   \
-    Push(WasmValue(res));                                               \
-    return true;                                                        \
-  }
-      BITMASK_CASE(I8x16BitMask, i8x16, int16, 16)
-      BITMASK_CASE(I16x8BitMask, i16x8, int8, 8)
-      BITMASK_CASE(I32x4BitMask, i32x4, int4, 4)
-      BITMASK_CASE(I64x2BitMask, i64x2, int2, 2)
-#undef BITMASK_CASE
-
-#define CMPOP_CASE(op, name, stype, out_stype, count, expr)   \
-  case kExpr##op: {                                           \
-    WasmValue v2 = Pop();                                     \
-    WasmValue v1 = Pop();                                     \
-    stype s1 = v1.to_s128().to_##name();                      \
-    stype s2 = v2.to_s128().to_##name();                      \
-    out_stype res;                                            \
-    for (size_t i = 0; i < count; ++i) {                      \
-      auto a = s1.val[LANE(i, s1)];                           \
-      auto b = s2.val[LANE(i, s2)];                           \
-      auto result = expr;                                     \
-      possible_nondeterminism_ |= has_nondeterminism(result); \
-      res.val[LANE(i, res)] = result ? -1 : 0;                \
-    }                                                         \
-    Push(WasmValue(Simd128(res)));                            \
-    return true;                                              \
-  }
-      CMPOP_CASE(F64x2Eq, f64x2, float2, int2, 2, a == b)
-      CMPOP_CASE(F64x2Ne, f64x2, float2, int2, 2, a != b)
-      CMPOP_CASE(F64x2Gt, f64x2, float2, int2, 2, a > b)
-      CMPOP_CASE(F64x2Ge, f64x2, float2, int2, 2, a >= b)
-      CMPOP_CASE(F64x2Lt, f64x2, float2, int2, 2, a < b)
-      CMPOP_CASE(F64x2Le, f64x2, float2, int2, 2, a <= b)
-      CMPOP_CASE(F32x4Eq, f32x4, float4, int4, 4, a == b)
-      CMPOP_CASE(F32x4Ne, f32x4, float4, int4, 4, a != b)
-      CMPOP_CASE(F32x4Gt, f32x4, float4, int4, 4, a > b)
-      CMPOP_CASE(F32x4Ge, f32x4, float4, int4, 4, a >= b)
-      CMPOP_CASE(F32x4Lt, f32x4, float4, int4, 4, a < b)
-      CMPOP_CASE(F32x4Le, f32x4, float4, int4, 4, a <= b)
-      CMPOP_CASE(I64x2Eq, i64x2, int2, int2, 2, a == b)
-      CMPOP_CASE(I64x2Ne, i64x2, int2, int2, 2, a != b)
-      CMPOP_CASE(I64x2LtS, i64x2, int2, int2, 2, a < b)
-      CMPOP_CASE(I64x2GtS, i64x2, int2, int2, 2, a > b)
-      CMPOP_CASE(I64x2LeS, i64x2, int2, int2, 2, a <= b)
-      CMPOP_CASE(I64x2GeS, i64x2, int2, int2, 2, a >= b)
-      CMPOP_CASE(I32x4Eq, i32x4, int4, int4, 4, a == b)
-      CMPOP_CASE(I32x4Ne, i32x4, int4, int4, 4, a != b)
-      CMPOP_CASE(I32x4GtS, i32x4, int4, int4, 4, a > b)
-      CMPOP_CASE(I32x4GeS, i32x4, int4, int4, 4, a >= b)
-      CMPOP_CASE(I32x4LtS, i32x4, int4, int4, 4, a < b)
-      CMPOP_CASE(I32x4LeS, i32x4, int4, int4, 4, a <= b)
-      CMPOP_CASE(I32x4GtU, i32x4, int4, int4, 4,
-                 static_cast<uint32_t>(a) > static_cast<uint32_t>(b))
-      CMPOP_CASE(I32x4GeU, i32x4, int4, int4, 4,
-                 static_cast<uint32_t>(a) >= static_cast<uint32_t>(b))
-      CMPOP_CASE(I32x4LtU, i32x4, int4, int4, 4,
-                 static_cast<uint32_t>(a) < static_cast<uint32_t>(b))
-      CMPOP_CASE(I32x4LeU, i32x4, int4, int4, 4,
-                 static_cast<uint32_t>(a) <= static_cast<uint32_t>(b))
-      CMPOP_CASE(I16x8Eq, i16x8, int8, int8, 8, a == b)
-      CMPOP_CASE(I16x8Ne, i16x8, int8, int8, 8, a != b)
-      CMPOP_CASE(I16x8GtS, i16x8, int8, int8, 8, a > b)
-      CMPOP_CASE(I16x8GeS, i16x8, int8, int8, 8, a >= b)
-      CMPOP_CASE(I16x8LtS, i16x8, int8, int8, 8, a < b)
-      CMPOP_CASE(I16x8LeS, i16x8, int8, int8, 8, a <= b)
-      CMPOP_CASE(I16x8GtU, i16x8, int8, int8, 8,
-                 static_cast<uint16_t>(a) > static_cast<uint16_t>(b))
-      CMPOP_CASE(I16x8GeU, i16x8, int8, int8, 8,
-                 static_cast<uint16_t>(a) >= static_cast<uint16_t>(b))
-      CMPOP_CASE(I16x8LtU, i16x8, int8, int8, 8,
-                 static_cast<uint16_t>(a) < static_cast<uint16_t>(b))
-      CMPOP_CASE(I16x8LeU, i16x8, int8, int8, 8,
-                 static_cast<uint16_t>(a) <= static_cast<uint16_t>(b))
-      CMPOP_CASE(I8x16Eq, i8x16, int16, int16, 16, a == b)
-      CMPOP_CASE(I8x16Ne, i8x16, int16, int16, 16, a != b)
-      CMPOP_CASE(I8x16GtS, i8x16, int16, int16, 16, a > b)
-      CMPOP_CASE(I8x16GeS, i8x16, int16, int16, 16, a >= b)
-      CMPOP_CASE(I8x16LtS, i8x16, int16, int16, 16, a < b)
-      CMPOP_CASE(I8x16LeS, i8x16, int16, int16, 16, a <= b)
-      CMPOP_CASE(I8x16GtU, i8x16, int16, int16, 16,
-                 static_cast<uint8_t>(a) > static_cast<uint8_t>(b))
-      CMPOP_CASE(I8x16GeU, i8x16, int16, int16, 16,
-                 static_cast<uint8_t>(a) >= static_cast<uint8_t>(b))
-      CMPOP_CASE(I8x16LtU, i8x16, int16, int16, 16,
-                 static_cast<uint8_t>(a) < static_cast<uint8_t>(b))
-      CMPOP_CASE(I8x16LeU, i8x16, int16, int16, 16,
-                 static_cast<uint8_t>(a) <= static_cast<uint8_t>(b))
-#undef CMPOP_CASE
-#define REPLACE_LANE_CASE(format, name, stype, ctype)                 \
-  case kExpr##format##ReplaceLane: {                                  \
-    SimdLaneImmediate imm(decoder, code->at(pc + *len), kNoValidate); \
-    *len += 1;                                                        \
-    WasmValue new_val = Pop();                                        \
-    WasmValue simd_val = Pop();                                       \
-    stype s = simd_val.to_s128().to_##name();                         \
-    s.val[LANE(imm.lane, s)] = new_val.to<ctype>();                   \
-    Push(WasmValue(Simd128(s)));                                      \
-    return true;                                                      \
-  }
-      REPLACE_LANE_CASE(F64x2, f64x2, float2, double)
-      REPLACE_LANE_CASE(F32x4, f32x4, float4, float)
-      REPLACE_LANE_CASE(I64x2, i64x2, int2, int64_t)
-      REPLACE_LANE_CASE(I32x4, i32x4, int4, int32_t)
-      REPLACE_LANE_CASE(I16x8, i16x8, int8, int32_t)
-      REPLACE_LANE_CASE(I8x16, i8x16, int16, int32_t)
-#undef REPLACE_LANE_CASE
-      case kExprS128LoadMem:
-        return ExecuteLoad<Simd128, Simd128>(decoder, code, pc, len,
-                                             MachineRepresentation::kSimd128,
-                                             /*prefix_len=*/*len);
-      case kExprS128StoreMem:
-        return ExecuteStore<Simd128, Simd128>(decoder, code, pc, len,
-                                              MachineRepresentation::kSimd128,
-                                              /*prefix_len=*/*len);
-#define SHIFT_CASE(op, name, stype, count, expr) \
-  case kExpr##op: {                              \
-    uint32_t shift = Pop().to<uint32_t>();       \
-    WasmValue v = Pop();                         \
-    stype s = v.to_s128().to_##name();           \
-    stype res;                                   \
-    for (size_t i = 0; i < count; ++i) {         \
-      auto a = s.val[LANE(i, s)];                \
-      res.val[LANE(i, res)] = expr;              \
-    }                                            \
-    Push(WasmValue(Simd128(res)));               \
-    return true;                                 \
-  }
-        SHIFT_CASE(I64x2Shl, i64x2, int2, 2,
-                   static_cast<uint64_t>(a) << (shift % 64))
-        SHIFT_CASE(I64x2ShrS, i64x2, int2, 2, a >> (shift % 64))
-        SHIFT_CASE(I64x2ShrU, i64x2, int2, 2,
-                   static_cast<uint64_t>(a) >> (shift % 64))
-        SHIFT_CASE(I32x4Shl, i32x4, int4, 4,
-                   static_cast<uint32_t>(a) << (shift % 32))
-        SHIFT_CASE(I32x4ShrS, i32x4, int4, 4, a >> (shift % 32))
-        SHIFT_CASE(I32x4ShrU, i32x4, int4, 4,
-                   static_cast<uint32_t>(a) >> (shift % 32))
-        SHIFT_CASE(I16x8Shl, i16x8, int8, 8,
-                   static_cast<uint16_t>(a) << (shift % 16))
-        SHIFT_CASE(I16x8ShrS, i16x8, int8, 8, a >> (shift % 16))
-        SHIFT_CASE(I16x8ShrU, i16x8, int8, 8,
-                   static_cast<uint16_t>(a) >> (shift % 16))
-        SHIFT_CASE(I8x16Shl, i8x16, int16, 16,
-                   static_cast<uint8_t>(a) << (shift % 8))
-        SHIFT_CASE(I8x16ShrS, i8x16, int16, 16, a >> (shift % 8))
-        SHIFT_CASE(I8x16ShrU, i8x16, int16, 16,
-                   static_cast<uint8_t>(a) >> (shift % 8))
-      case kExprI16x8ExtMulLowI8x16S: {
-        return DoSimdExtMul<int16, int8, int8_t, int16_t>(0);
-      }
-      case kExprI16x8ExtMulHighI8x16S: {
-        return DoSimdExtMul<int16, int8, int8_t, int16_t>(8);
-      }
-      case kExprI16x8ExtMulLowI8x16U: {
-        return DoSimdExtMul<int16, int8, uint8_t, uint16_t>(0);
-      }
-      case kExprI16x8ExtMulHighI8x16U: {
-        return DoSimdExtMul<int16, int8, uint8_t, uint16_t>(8);
-      }
-      case kExprI32x4ExtMulLowI16x8S: {
-        return DoSimdExtMul<int8, int4, int16_t, int32_t>(0);
-      }
-      case kExprI32x4ExtMulHighI16x8S: {
-        return DoSimdExtMul<int8, int4, int16_t, int32_t>(4);
-      }
-      case kExprI32x4ExtMulLowI16x8U: {
-        return DoSimdExtMul<int8, int4, uint16_t, uint32_t>(0);
-      }
-      case kExprI32x4ExtMulHighI16x8U: {
-        return DoSimdExtMul<int8, int4, uint16_t, uint32_t>(4);
-      }
-      case kExprI64x2ExtMulLowI32x4S: {
-        return DoSimdExtMul<int4, int2, int32_t, int64_t>(0);
-      }
-      case kExprI64x2ExtMulHighI32x4S: {
-        return DoSimdExtMul<int4, int2, int32_t, int64_t>(2);
-      }
-      case kExprI64x2ExtMulLowI32x4U: {
-        return DoSimdExtMul<int4, int2, uint32_t, uint64_t>(0);
-      }
-      case kExprI64x2ExtMulHighI32x4U: {
-        return DoSimdExtMul<int4, int2, uint32_t, uint64_t>(2);
-      }
-#undef SHIFT_CASE
-#define CONVERT_CASE(op, src_type, name, dst_type, count, start_index, ctype, \
-                     expr)                                                    \
-  case kExpr##op: {                                                           \
-    WasmValue v = Pop();                                                      \
-    src_type s = v.to_s128().to_##name();                                     \
-    dst_type res = {0};                                                       \
-    for (size_t i = 0; i < count; ++i) {                                      \
-      ctype a = s.val[LANE(start_index + i, s)];                              \
-      auto result = expr;                                                     \
-      possible_nondeterminism_ |= has_nondeterminism(result);                 \
-      res.val[LANE(i, res)] = expr;                                           \
-    }                                                                         \
-    Push(WasmValue(Simd128(res)));                                            \
-    return true;                                                              \
-  }
-        CONVERT_CASE(F32x4SConvertI32x4, int4, i32x4, float4, 4, 0, int32_t,
-                     static_cast<float>(a))
-        CONVERT_CASE(F32x4UConvertI32x4, int4, i32x4, float4, 4, 0, uint32_t,
-                     static_cast<float>(a))
-        CONVERT_CASE(I32x4SConvertF32x4, float4, f32x4, int4, 4, 0, float,
-                     base::saturated_cast<int32_t>(a))
-        CONVERT_CASE(I32x4UConvertF32x4, float4, f32x4, int4, 4, 0, float,
-                     base::saturated_cast<uint32_t>(a))
-        CONVERT_CASE(I32x4RelaxedTruncF32x4S, float4, f32x4, int4, 4, 0, float,
-                     base::saturated_cast<int32_t>(a))
-        CONVERT_CASE(I32x4RelaxedTruncF32x4U, float4, f32x4, int4, 4, 0, float,
-                     base::saturated_cast<uint32_t>(a))
-        CONVERT_CASE(I64x2SConvertI32x4Low, int4, i32x4, int2, 2, 0, int32_t, a)
-        CONVERT_CASE(I64x2SConvertI32x4High, int4, i32x4, int2, 2, 2, int32_t,
-                     a)
-        CONVERT_CASE(I64x2UConvertI32x4Low, int4, i32x4, int2, 2, 0, uint32_t,
-                     a)
-        CONVERT_CASE(I64x2UConvertI32x4High, int4, i32x4, int2, 2, 2, uint32_t,
-                     a)
-        CONVERT_CASE(I32x4SConvertI16x8High, int8, i16x8, int4, 4, 4, int16_t,
-                     a)
-        CONVERT_CASE(I32x4UConvertI16x8High, int8, i16x8, int4, 4, 4, uint16_t,
-                     a)
-        CONVERT_CASE(I32x4SConvertI16x8Low, int8, i16x8, int4, 4, 0, int16_t, a)
-        CONVERT_CASE(I32x4UConvertI16x8Low, int8, i16x8, int4, 4, 0, uint16_t,
-                     a)
-        CONVERT_CASE(I16x8SConvertI8x16High, int16, i8x16, int8, 8, 8, int8_t,
-                     a)
-        CONVERT_CASE(I16x8UConvertI8x16High, int16, i8x16, int8, 8, 8, uint8_t,
-                     a)
-        CONVERT_CASE(I16x8SConvertI8x16Low, int16, i8x16, int8, 8, 0, int8_t, a)
-        CONVERT_CASE(I16x8UConvertI8x16Low, int16, i8x16, int8, 8, 0, uint8_t,
-                     a)
-        CONVERT_CASE(F64x2ConvertLowI32x4S, int4, i32x4, float2, 2, 0, int32_t,
-                     static_cast<double>(a))
-        CONVERT_CASE(F64x2ConvertLowI32x4U, int4, i32x4, float2, 2, 0, uint32_t,
-                     static_cast<double>(a))
-        CONVERT_CASE(I32x4TruncSatF64x2SZero, float2, f64x2, int4, 2, 0, double,
-                     base::saturated_cast<int32_t>(a))
-        CONVERT_CASE(I32x4TruncSatF64x2UZero, float2, f64x2, int4, 2, 0, double,
-                     base::saturated_cast<uint32_t>(a))
-        CONVERT_CASE(I32x4RelaxedTruncF64x2SZero, float2, f64x2, int4, 2, 0,
-                     double, base::saturated_cast<int32_t>(a))
-        CONVERT_CASE(I32x4RelaxedTruncF64x2UZero, float2, f64x2, int4, 2, 0,
-                     double, base::saturated_cast<uint32_t>(a))
-        CONVERT_CASE(F32x4DemoteF64x2Zero, float2, f64x2, float4, 2, 0, float,
-                     DoubleToFloat32(a))
-        CONVERT_CASE(F64x2PromoteLowF32x4, float4, f32x4, float2, 2, 0, float,
-                     static_cast<double>(a))
-#undef CONVERT_CASE
-#define PACK_CASE(op, src_type, name, dst_type, count, dst_ctype)  \
-  case kExpr##op: {                                                \
-    WasmValue v2 = Pop();                                          \
-    WasmValue v1 = Pop();                                          \
-    src_type s1 = v1.to_s128().to_##name();                        \
-    src_type s2 = v2.to_s128().to_##name();                        \
-    dst_type res;                                                  \
-    for (size_t i = 0; i < count; ++i) {                           \
-      int64_t v = i < count / 2 ? s1.val[LANE(i, s1)]              \
-                                : s2.val[LANE(i - count / 2, s2)]; \
-      res.val[LANE(i, res)] = base::saturated_cast<dst_ctype>(v);  \
-    }                                                              \
-    Push(WasmValue(Simd128(res)));                                 \
-    return true;                                                   \
-  }
-        PACK_CASE(I16x8SConvertI32x4, int4, i32x4, int8, 8, int16_t)
-        PACK_CASE(I16x8UConvertI32x4, int4, i32x4, int8, 8, uint16_t)
-        PACK_CASE(I8x16SConvertI16x8, int8, i16x8, int16, 16, int8_t)
-        PACK_CASE(I8x16UConvertI16x8, int8, i16x8, int16, 16, uint8_t)
-#undef PACK_CASE
-      case kExprI8x16RelaxedLaneSelect:
-      case kExprI16x8RelaxedLaneSelect:
-      case kExprI32x4RelaxedLaneSelect:
-      case kExprI64x2RelaxedLaneSelect:
-      case kExprS128Select: {
-        int4 bool_val = Pop().to_s128().to_i32x4();
-        int4 v2 = Pop().to_s128().to_i32x4();
-        int4 v1 = Pop().to_s128().to_i32x4();
-        int4 res;
-        for (size_t i = 0; i < 4; ++i) {
-          res.val[LANE(i, res)] = v2.val[LANE(i, v2)] ^
-                                  ((v1.val[LANE(i, v1)] ^ v2.val[LANE(i, v2)]) &
-                                   bool_val.val[LANE(i, bool_val)]);
-        }
-        Push(WasmValue(Simd128(res)));
-        return true;
-      }
-      case kExprI32x4DotI16x8S: {
-        int8 v2 = Pop().to_s128().to_i16x8();
-        int8 v1 = Pop().to_s128().to_i16x8();
-        int4 res;
-        for (size_t i = 0; i < 4; i++) {
-          int32_t lo = (v1.val[LANE(i * 2, v1)] * v2.val[LANE(i * 2, v2)]);
-          int32_t hi =
-              (v1.val[LANE(i * 2 + 1, v1)] * v2.val[LANE(i * 2 + 1, v2)]);
-          res.val[LANE(i, res)] = base::AddWithWraparound(lo, hi);
-        }
-        Push(WasmValue(Simd128(res)));
-        return true;
-      }
-      case kExprS128Const: {
-        Simd128Immediate imm(decoder, code->at(pc + *len), kNoValidate);
-        int16 res;
-        for (size_t i = 0; i < kSimd128Size; ++i) {
-          res.val[LANE(i, res)] = imm.value[i];
-        }
-        Push(WasmValue(Simd128(res)));
-        *len += 16;
-        return true;
-      }
-      case kExprI16x8DotI8x16I7x16S: {
-        int16 v2 = Pop().to_s128().to_i8x16();
-        int16 v1 = Pop().to_s128().to_i8x16();
-        int8 res;
-        for (size_t i = 0; i < 8; i++) {
-          int16_t lo = (v1.val[LANE(i * 2, v1)] * v2.val[LANE(i * 2, v2)]);
-          int16_t hi =
-              (v1.val[LANE(i * 2 + 1, v1)] * v2.val[LANE(i * 2 + 1, v2)]);
-          res.val[LANE(i, res)] = base::AddWithWraparound(lo, hi);
-        }
-        Push(WasmValue(Simd128(res)));
-        return true;
-      }
-      case kExprI32x4DotI8x16I7x16AddS: {
-        int4 v3 = Pop().to_s128().to_i32x4();
-        int16 v2 = Pop().to_s128().to_i8x16();
-        int16 v1 = Pop().to_s128().to_i8x16();
-        int4 res;
-        for (size_t i = 0; i < 4; i++) {
-          int32_t a = (v1.val[LANE(i * 4, v1)] * v2.val[LANE(i * 4, v2)]);
-          int32_t b =
-              (v1.val[LANE(i * 4 + 1, v1)] * v2.val[LANE(i * 4 + 1, v2)]);
-          int32_t c =
-              (v1.val[LANE(i * 4 + 2, v1)] * v2.val[LANE(i * 4 + 2, v2)]);
-          int32_t d =
-              (v1.val[LANE(i * 4 + 3, v1)] * v2.val[LANE(i * 4 + 3, v2)]);
-          int32_t acc = v3.val[LANE(i, v3)];
-          // a + b + c + d should not wrap
-          res.val[LANE(i, res)] = base::AddWithWraparound(a + b + c + d, acc);
-        }
-        Push(WasmValue(Simd128(res)));
-        return true;
-      }
-      case kExprI8x16RelaxedSwizzle:
-      case kExprI8x16Swizzle: {
-        int16 v2 = Pop().to_s128().to_i8x16();
-        int16 v1 = Pop().to_s128().to_i8x16();
-        int16 res;
-        for (size_t i = 0; i < kSimd128Size; ++i) {
-          int lane = v2.val[LANE(i, v2)];
-          res.val[LANE(i, res)] =
-              lane < kSimd128Size && lane >= 0 ? v1.val[LANE(lane, v1)] : 0;
-        }
-        Push(WasmValue(Simd128(res)));
-        return true;
-      }
-      case kExprI8x16Shuffle: {
-        Simd128Immediate imm(decoder, code->at(pc + *len), kNoValidate);
-        *len += 16;
-        int16 v2 = Pop().to_s128().to_i8x16();
-        int16 v1 = Pop().to_s128().to_i8x16();
-        int16 res;
-        for (size_t i = 0; i < kSimd128Size; ++i) {
-          int lane = imm.value[i];
-          res.val[LANE(i, res)] = lane < kSimd128Size
-                                      ? v1.val[LANE(lane, v1)]
-                                      : v2.val[LANE(lane - kSimd128Size, v2)];
-        }
-        Push(WasmValue(Simd128(res)));
-        return true;
-      }
-      case kExprV128AnyTrue: {
-        int4 s = Pop().to_s128().to_i32x4();
-        bool res = s.val[LANE(0, s)] | s.val[LANE(1, s)] | s.val[LANE(2, s)] |
-                   s.val[LANE(3, s)];
-        Push(WasmValue((res)));
-        return true;
-      }
-#define REDUCTION_CASE(op, name, stype, count, operation) \
-  case kExpr##op: {                                       \
-    stype s = Pop().to_s128().to_##name();                \
-    bool res = true;                                      \
-    for (size_t i = 0; i < count; ++i) {                  \
-      res = res & static_cast<bool>(s.val[LANE(i, s)]);   \
-    }                                                     \
-    Push(WasmValue(res));                                 \
-    return true;                                          \
-  }
-        REDUCTION_CASE(I64x2AllTrue, i64x2, int2, 2, &)
-        REDUCTION_CASE(I32x4AllTrue, i32x4, int4, 4, &)
-        REDUCTION_CASE(I16x8AllTrue, i16x8, int8, 8, &)
-        REDUCTION_CASE(I8x16AllTrue, i8x16, int16, 16, &)
-#undef REDUCTION_CASE
-#define QFM_CASE(op, name, stype, count, operation)          \
-  case kExpr##op: {                                          \
-    stype c = Pop().to_s128().to_##name();                   \
-    stype b = Pop().to_s128().to_##name();                   \
-    stype a = Pop().to_s128().to_##name();                   \
-    stype res;                                               \
-    for (size_t i = 0; i < count; i++) {                     \
-      res.val[LANE(i, res)] =                                \
-          operation(a.val[LANE(i, a)] * b.val[LANE(i, b)]) + \
-          c.val[LANE(i, c)];                                 \
-    }                                                        \
-    Push(WasmValue(Simd128(res)));                           \
-    return true;                                             \
-  }
-        QFM_CASE(F32x4Qfma, f32x4, float4, 4, +)
-        QFM_CASE(F32x4Qfms, f32x4, float4, 4, -)
-        QFM_CASE(F64x2Qfma, f64x2, float2, 2, +)
-        QFM_CASE(F64x2Qfms, f64x2, float2, 2, -)
-#undef QFM_CASE
-      case kExprS128Load8Splat: {
-        return DoSimdLoadSplat<int16, int32_t, int8_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord8);
-      }
-      case kExprS128Load16Splat: {
-        return DoSimdLoadSplat<int8, int32_t, int16_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord16);
-      }
-      case kExprS128Load32Splat: {
-        return DoSimdLoadSplat<int4, int32_t, int32_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord32);
-      }
-      case kExprS128Load64Splat: {
-        return DoSimdLoadSplat<int2, int64_t, int64_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Load8x8S: {
-        return DoSimdLoadExtend<int8, int16_t, int8_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Load8x8U: {
-        return DoSimdLoadExtend<int8, uint16_t, uint8_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Load16x4S: {
-        return DoSimdLoadExtend<int4, int32_t, int16_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Load16x4U: {
-        return DoSimdLoadExtend<int4, uint32_t, uint16_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Load32x2S: {
-        return DoSimdLoadExtend<int2, int64_t, int32_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Load32x2U: {
-        return DoSimdLoadExtend<int2, uint64_t, uint32_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Load32Zero: {
-        return DoSimdLoadZeroExtend<int4, uint32_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord32);
-      }
-      case kExprS128Load64Zero: {
-        return DoSimdLoadZeroExtend<int2, uint64_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Load8Lane: {
-        return DoSimdLoadLane<int16, int32_t, int8_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord8);
-      }
-      case kExprS128Load16Lane: {
-        return DoSimdLoadLane<int8, int32_t, int16_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord16);
-      }
-      case kExprS128Load32Lane: {
-        return DoSimdLoadLane<int4, int32_t, int32_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord32);
-      }
-      case kExprS128Load64Lane: {
-        return DoSimdLoadLane<int2, int64_t, int64_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprS128Store8Lane: {
-        return DoSimdStoreLane<int16, int32_t, int8_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord8);
-      }
-      case kExprS128Store16Lane: {
-        return DoSimdStoreLane<int8, int32_t, int16_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord16);
-      }
-      case kExprS128Store32Lane: {
-        return DoSimdStoreLane<int4, int32_t, int32_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord32);
-      }
-      case kExprS128Store64Lane: {
-        return DoSimdStoreLane<int2, int64_t, int64_t>(
-            decoder, code, pc, len, MachineRepresentation::kWord64);
-      }
-      case kExprI32x4ExtAddPairwiseI16x8S: {
-        return DoSimdExtAddPairwise<int4, int8, int32_t, int16_t>();
-      }
-      case kExprI32x4ExtAddPairwiseI16x8U: {
-        return DoSimdExtAddPairwise<int4, int8, uint32_t, uint16_t>();
-      }
-      case kExprI16x8ExtAddPairwiseI8x16S: {
-        return DoSimdExtAddPairwise<int8, int16, int16_t, int8_t>();
-      }
-      case kExprI16x8ExtAddPairwiseI8x16U: {
-        return DoSimdExtAddPairwise<int8, int16, uint16_t, uint8_t>();
-      }
-      default:
-        return false;
-    }
-  }
-
-  template <typename s_type, typename result_type, typename load_type>
-  bool DoSimdLoadSplat(Decoder* decoder, InterpreterCode* code, pc_t pc,
-                       int* const len, MachineRepresentation rep) {
-    // len is the number of bytes the make up this op, including prefix byte, so
-    // the prefix_len for ExecuteLoad is len, minus the prefix byte itself.
-    // Think of prefix_len as: number of extra bytes that make up this op.
-    if (!ExecuteLoad<result_type, load_type>(decoder, code, pc, len, rep,
-                                             /*prefix_len=*/*len)) {
-      return false;
-    }
-    result_type v = Pop().to<result_type>();
-    s_type s;
-    for (size_t i = 0; i < arraysize(s.val); i++) s.val[LANE(i, s)] = v;
-    Push(WasmValue(Simd128(s)));
-    return true;
-  }
-
-  template <typename s_type, typename wide_type, typename narrow_type>
-  bool DoSimdLoadExtend(Decoder* decoder, InterpreterCode* code, pc_t pc,
-                        int* const len, MachineRepresentation rep) {
-    static_assert(sizeof(wide_type) == sizeof(narrow_type) * 2,
-                  "size mismatch for wide and narrow types");
-    if (!ExecuteLoad<uint64_t, uint64_t>(decoder, code, pc, len, rep,
-                                         /*prefix_len=*/*len)) {
-      return false;
-    }
-    constexpr int lanes = kSimd128Size / sizeof(wide_type);
-    uint64_t v = Pop().to_u64();
-    s_type s;
-    for (int i = 0; i < lanes; i++) {
-      uint8_t shift = i * (sizeof(narrow_type) * 8);
-      narrow_type el = static_cast<narrow_type>(v >> shift);
-      s.val[LANE(i, s)] = static_cast<wide_type>(el);
-    }
-    Push(WasmValue(Simd128(s)));
-    return true;
-  }
-
-  template <typename s_type, typename load_type>
-  bool DoSimdLoadZeroExtend(Decoder* decoder, InterpreterCode* code, pc_t pc,
-                            int* const len, MachineRepresentation rep) {
-    if (!ExecuteLoad<load_type, load_type>(decoder, code, pc, len, rep,
-                                           /*prefix_len=*/*len)) {
-      return false;
-    }
-    load_type v = Pop().to<load_type>();
-    s_type s;
-    // All lanes are 0.
-    for (size_t i = 0; i < arraysize(s.val); i++) s.val[LANE(i, s)] = 0;
-    // Lane 0 is set to the loaded value.
-    s.val[LANE(0, s)] = v;
-    Push(WasmValue(Simd128(s)));
-    return true;
-  }
-
-  template <typename s_type, typename result_type, typename load_type>
-  bool DoSimdLoadLane(Decoder* decoder, InterpreterCode* code, pc_t pc,
-                      int* const len, MachineRepresentation rep) {
-    s_type value = Pop().to_s128().to<s_type>();
-    if (!ExecuteLoad<result_type, load_type>(decoder, code, pc, len, rep,
-                                             /*prefix_len=*/*len)) {
-      return false;
-    }
-
-    SimdLaneImmediate lane_imm(decoder, code->at(pc + *len), kNoValidate);
-    *len += lane_imm.length;
-    result_type loaded = Pop().to<result_type>();
-    value.val[LANE(lane_imm.lane, value)] = loaded;
-    Push(WasmValue(Simd128(value)));
-    return true;
-  }
-
-  template <typename s_type, typename result_type, typename load_type>
-  bool DoSimdStoreLane(Decoder* decoder, InterpreterCode* code, pc_t pc,
-                       int* const len, MachineRepresentation rep) {
-    // Extract a single lane, push it onto the stack, then store the lane.
-    s_type value = Pop().to_s128().to<s_type>();
-
-    MemoryAccessImmediate imm(decoder, code->at(pc + *len), sizeof(load_type),
-                              module()->is_memory64, kNoValidate);
-
-    SimdLaneImmediate lane_imm(decoder, code->at(pc + *len + imm.length),
-                               kNoValidate);
-
-    Push(WasmValue(
-        static_cast<result_type>(value.val[LANE(lane_imm.lane, value)])));
-
-    // ExecuteStore will update the len, so pass it unchanged here.
-    if (!ExecuteStore<result_type, load_type>(decoder, code, pc, len, rep,
-                                              /*prefix_len=*/*len)) {
-      return false;
-    }
-
-    *len += lane_imm.length;
-    return true;
-  }
-
-  template <typename s_type, typename d_type, typename narrow, typename wide>
-  bool DoSimdExtMul(unsigned start) {
-    WasmValue v2 = Pop();
-    WasmValue v1 = Pop();
-    auto s1 = v1.to_s128().to<s_type>();
-    auto s2 = v2.to_s128().to<s_type>();
-    auto end = start + (kSimd128Size / sizeof(wide));
-    d_type res;
-    for (size_t dst = 0; start < end; ++start, ++dst) {
-      // Need static_cast for unsigned narrow types.
-      res.val[LANE(dst, res)] =
-          MultiplyLong<wide>(static_cast<narrow>(s1.val[LANE(start, s1)]),
-                             static_cast<narrow>(s2.val[LANE(start, s2)]));
-    }
-    Push(WasmValue(Simd128(res)));
-    return true;
-  }
-
-  template <typename DstSimdType, typename SrcSimdType, typename Wide,
-            typename Narrow>
-  bool DoSimdExtAddPairwise() {
-    constexpr int lanes = kSimd128Size / sizeof(DstSimdType::val[0]);
-    auto v = Pop().to_s128().to<SrcSimdType>();
-    DstSimdType res;
-    for (int i = 0; i < lanes; ++i) {
-      res.val[LANE(i, res)] =
-          AddLong<Wide>(static_cast<Narrow>(v.val[LANE(i * 2, v)]),
-                        static_cast<Narrow>(v.val[LANE(i * 2 + 1, v)]));
-    }
-    Push(WasmValue(Simd128(res)));
-    return true;
-  }
-
-  // Check if our control stack (frames_) exceeds the limit. Trigger stack
-  // overflow if it does, and unwinding the current frame.
-  // Returns true if execution can continue, false if the stack was fully
-  // unwound. Do call this function immediately *after* pushing a new frame. The
-  // pc of the top frame will be reset to 0 if the stack check fails.
-  bool DoStackCheck(Decoder* decoder, InterpreterCode** target, pc_t* pc,
-                    pc_t* limit) V8_WARN_UNUSED_RESULT {
-    // The goal of this stack check is not to prevent actual stack overflows,
-    // but to simulate stack overflows during the execution of compiled code.
-    // That is why this function uses v8_flags.stack_size, even though the value
-    // stack actually lies in zone memory.
-    const size_t stack_size_limit = v8_flags.stack_size * KB;
-    // Sum up the value stack size and the control stack size.
-    const size_t current_stack_size = (sp_ - stack_.get()) * sizeof(*sp_) +
-                                      frames_.size() * sizeof(frames_[0]);
-    if (V8_LIKELY(current_stack_size <= stack_size_limit)) {
-      *pc = frames_.back().pc;
-      *limit = (*target)->end - (*target)->start;
-      decoder->Reset((*target)->start, (*target)->end);
-      return true;
-    }
-    // The pc of the top frame is initialized to the first instruction. We reset
-    // it to 0 here such that we report the same position as in compiled code.
-    frames_.back().pc = 0;
-    isolate_->StackOverflow();
-    if (HandleException(isolate_) == WasmInterpreter::HANDLED) {
-      ReloadFromFrameOnException(decoder, target, pc, limit);
-      return true;
-    }
-    return false;
-  }
-
-  // Allocate, initialize and throw a new exception. The exception values are
-  // being popped off the operand stack. Returns true if the exception is being
-  // handled locally by the interpreter, false otherwise (interpreter exits).
-  bool DoThrowException(const WasmTag* tag,
-                        uint32_t index) V8_WARN_UNUSED_RESULT {
-    HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-    Handle<WasmExceptionTag> exception_tag(
-        WasmExceptionTag::cast(instance_object_->tags_table().get(index)),
-        isolate_);
-    uint32_t encoded_size = WasmExceptionPackage::GetEncodedSize(tag);
-    Handle<WasmExceptionPackage> exception_object =
-        WasmExceptionPackage::New(isolate_, exception_tag, encoded_size);
-    Handle<FixedArray> encoded_values = Handle<FixedArray>::cast(
-        WasmExceptionPackage::GetExceptionValues(isolate_, exception_object));
-    // Encode the exception values on the operand stack into the exception
-    // package allocated above. This encoding has to be in sync with other
-    // backends so that exceptions can be passed between them.
-    const WasmTagSig* sig = tag->sig;
-    uint32_t encoded_index = 0;
-    sp_t base_index = StackHeight() - sig->parameter_count();
-    for (size_t i = 0; i < sig->parameter_count(); ++i) {
-      WasmValue value = GetStackValue(base_index + i);
-      switch (sig->GetParam(i).kind()) {
-        case kI32: {
-          uint32_t u32 = value.to_u32();
-          EncodeI32ExceptionValue(encoded_values, &encoded_index, u32);
-          break;
-        }
-        case kF32: {
-          uint32_t f32 = value.to_f32_boxed().get_bits();
-          EncodeI32ExceptionValue(encoded_values, &encoded_index, f32);
-          break;
-        }
-        case kI64: {
-          uint64_t u64 = value.to_u64();
-          EncodeI64ExceptionValue(encoded_values, &encoded_index, u64);
-          break;
-        }
-        case kF64: {
-          uint64_t f64 = value.to_f64_boxed().get_bits();
-          EncodeI64ExceptionValue(encoded_values, &encoded_index, f64);
-          break;
-        }
-        case kS128: {
-          int4 s128 = value.to_s128().to_i32x4();
-          EncodeI32ExceptionValue(encoded_values, &encoded_index, s128.val[0]);
-          EncodeI32ExceptionValue(encoded_values, &encoded_index, s128.val[1]);
-          EncodeI32ExceptionValue(encoded_values, &encoded_index, s128.val[2]);
-          EncodeI32ExceptionValue(encoded_values, &encoded_index, s128.val[3]);
-          break;
-        }
-        case kRef:
-        case kRefNull:
-        case kRtt:
-          encoded_values->set(encoded_index++, *value.to_ref());
-          break;
-        case kI8:
-        case kI16:
-        case kVoid:
-        case kBottom:
-          UNREACHABLE();
-      }
-    }
-    DCHECK_EQ(encoded_size, encoded_index);
-    Drop(static_cast<int>(sig->parameter_count()));
-    // Now that the exception is ready, set it as pending.
-    isolate_->Throw(*exception_object);
-    return HandleException(isolate_) == WasmInterpreter::HANDLED;
-  }
-
-  // Throw a given existing exception. Returns true if the exception is being
-  // handled locally by the interpreter, false otherwise (interpreter exits).
-  bool DoRethrowException(Handle<Object> exception) {
-    isolate_->ReThrow(*exception);
-    return HandleException(isolate_) == WasmInterpreter::HANDLED;
-  }
-
-  // Determines whether the given exception has a tag matching the expected tag
-  // for the given index within the exception table of the current instance.
-  bool MatchingExceptionTag(Handle<Object> exception_object, uint32_t index) {
-    if (!exception_object->IsWasmExceptionPackage(isolate_)) return false;
-    Handle<Object> caught_tag = WasmExceptionPackage::GetExceptionTag(
-        isolate_, Handle<WasmExceptionPackage>::cast(exception_object));
-    Handle<Object> expected_tag =
-        handle(instance_object_->tags_table().get(index), isolate_);
-    DCHECK(expected_tag->IsWasmExceptionTag());
-    return expected_tag.is_identical_to(caught_tag);
-  }
-
-  // Unpack the values encoded in the given exception. The exception values are
-  // pushed onto the operand stack. Callers must perform a tag check to ensure
-  // the encoded values match the expected signature of the exception.
-  void DoUnpackException(const WasmTag* tag, Handle<Object> exception_object) {
-    Handle<FixedArray> encoded_values =
-        Handle<FixedArray>::cast(WasmExceptionPackage::GetExceptionValues(
-            isolate_, Handle<WasmExceptionPackage>::cast(exception_object)));
-    // Decode the exception values from the given exception package and push
-    // them onto the operand stack. This encoding has to be in sync with other
-    // backends so that exceptions can be passed between them.
-    const WasmTagSig* sig = tag->sig;
-    uint32_t encoded_index = 0;
-    for (size_t i = 0; i < sig->parameter_count(); ++i) {
-      WasmValue value;
-      switch (sig->GetParam(i).kind()) {
-        case kI32: {
-          uint32_t u32 = 0;
-          DecodeI32ExceptionValue(encoded_values, &encoded_index, &u32);
-          value = WasmValue(u32);
-          break;
-        }
-        case kF32: {
-          uint32_t f32_bits = 0;
-          DecodeI32ExceptionValue(encoded_values, &encoded_index, &f32_bits);
-          value = WasmValue(Float32::FromBits(f32_bits));
-          break;
-        }
-        case kI64: {
-          uint64_t u64 = 0;
-          DecodeI64ExceptionValue(encoded_values, &encoded_index, &u64);
-          value = WasmValue(u64);
-          break;
-        }
-        case kF64: {
-          uint64_t f64_bits = 0;
-          DecodeI64ExceptionValue(encoded_values, &encoded_index, &f64_bits);
-          value = WasmValue(Float64::FromBits(f64_bits));
-          break;
-        }
-        case kS128: {
-          int4 s128 = {0, 0, 0, 0};
-          uint32_t* vals = reinterpret_cast<uint32_t*>(s128.val);
-          DecodeI32ExceptionValue(encoded_values, &encoded_index, &vals[0]);
-          DecodeI32ExceptionValue(encoded_values, &encoded_index, &vals[1]);
-          DecodeI32ExceptionValue(encoded_values, &encoded_index, &vals[2]);
-          DecodeI32ExceptionValue(encoded_values, &encoded_index, &vals[3]);
-          value = WasmValue(Simd128(s128));
-          break;
-        }
-        case kRef:
-        case kRefNull:
-        case kRtt: {
-          Handle<Object> ref(encoded_values->get(encoded_index++), isolate_);
-          value = WasmValue(ref, sig->GetParam(i));
-          break;
-        }
-        case kI8:
-        case kI16:
-        case kVoid:
-        case kBottom:
-          UNREACHABLE();
-      }
-      Push(value);
-    }
-    DCHECK_EQ(WasmExceptionPackage::GetEncodedSize(tag), encoded_index);
-  }
-
-  void Execute(InterpreterCode* code, pc_t pc, int max) {
-    DCHECK_NOT_NULL(code->side_table);
-    DCHECK(!frames_.empty());
-    // There must be enough space on the stack to hold the arguments, locals,
-    // and the value stack.
-    DCHECK_LE(code->function->sig->parameter_count() + code->locals.num_locals +
-                  code->side_table->max_stack_height_,
-              stack_limit_ - stack_.get() - frames_.back().sp);
-    // Seal the surrounding {HandleScope} to ensure that all cases within the
-    // interpreter switch below which deal with handles open their own scope.
-    // This avoids leaking / accumulating handles in the surrounding scope.
-    SealHandleScope shs(isolate_);
-
-    Decoder decoder(code->start, code->end);
-    pc_t limit = code->end - code->start;
-
-    while (true) {
-      DCHECK_GT(limit, pc);
-      DCHECK_NOT_NULL(code->start);
-
-      int len = 1;
-      byte orig = code->start[pc];
-      WasmOpcode opcode = static_cast<WasmOpcode>(orig);
-
-      if (WasmOpcodes::IsPrefixOpcode(opcode)) {
-        // read_prefixed_opcode includes the prefix byte, overwrite len.
-        std::tie(opcode, len) =
-            decoder.read_prefixed_opcode<Decoder::NoValidationTag>(
-                code->at(pc));
-      }
-
-      // If max is 0, break. If max is positive (a limit is set), decrement it.
-      if (max >= 0 && WasmOpcodes::IsBreakable(opcode)) {
-        if (max == 0) break;
-        --max;
-      }
-
-      TRACE("@%-3zu: %-24s:", pc, WasmOpcodes::OpcodeName(opcode));
-      TraceValueStack();
-      TRACE("\n");
-
-#ifdef DEBUG
-      // Compute the stack effect of this opcode, and verify later that the
-      // stack was modified accordingly.
-      std::pair<uint32_t, uint32_t> stack_effect =
-          StackEffect(codemap_.module(), frames_.back().code->function->sig,
-                      code->start + pc, code->end);
-      sp_t expected_new_stack_height =
-          StackHeight() - stack_effect.first + stack_effect.second;
-#endif
-
-      switch (orig) {
-        case kExprNop:
-          break;
-        case kExprBlock:
-        case kExprLoop:
-        case kExprTry: {
-          BlockTypeImmediate imm(WasmFeatures::All(), &decoder,
-                                 code->at(pc + 1), kNoValidate);
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprIf: {
-          BlockTypeImmediate imm(WasmFeatures::All(), &decoder,
-                                 code->at(pc + 1), kNoValidate);
-          WasmValue cond = Pop();
-          bool is_true = cond.to<uint32_t>() != 0;
-          if (is_true) {
-            // Fall through to the true block.
-            len = 1 + imm.length;
-            TRACE("  true => fallthrough\n");
-          } else {
-            len = LookupTargetDelta(code, pc);
-            TRACE("  false => @%zu\n", pc + len);
-          }
-          break;
-        }
-        case kExprElse:
-        case kExprCatch:
-        case kExprCatchAll: {
-          len = LookupTargetDelta(code, pc);
-          TRACE("  end => @%zu\n", pc + len);
-          break;
-        }
-        case kExprThrow: {
-          TagIndexImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          CommitPc(pc);  // Needed for local unwinding.
-          const WasmTag* tag = &module()->tags[imm.index];
-          if (!DoThrowException(tag, imm.index)) return;
-          ReloadFromFrameOnException(&decoder, &code, &pc, &limit);
-          continue;  // Do not bump pc.
-        }
-        case kExprRethrow: {
-          BranchDepthImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          HandleScope scope(isolate_);  // Avoid leaking handles.
-          DCHECK(!frames_.back().caught_exception_stack.is_null());
-          int index = code->side_table->rethrow_map_[pc];
-          DCHECK_LE(0, index);
-          DCHECK_LT(index, frames_.back().caught_exception_stack->Size());
-          Handle<Object> exception = handle(
-              frames_.back().caught_exception_stack->get(index), isolate_);
-          DCHECK(!exception->IsTheHole());
-          CommitPc(pc);  // Needed for local unwinding.
-          if (!DoRethrowException(exception)) return;
-          ReloadFromFrameOnException(&decoder, &code, &pc, &limit);
-          continue;  // Do not bump pc.
-        }
-        case kExprSelectWithType: {
-          SelectTypeImmediate imm(WasmFeatures::All(), &decoder,
-                                  code->at(pc + 1), kNoValidate);
-          len = 1 + imm.length;
-          V8_FALLTHROUGH;
-        }
-        case kExprSelect: {
-          HandleScope scope(isolate_);  // Avoid leaking handles.
-          WasmValue cond = Pop();
-          WasmValue fval = Pop();
-          WasmValue tval = Pop();
-          Push(cond.to<int32_t>() != 0 ? tval : fval);
-          break;
-        }
-        case kExprBr: {
-          BranchDepthImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          len = DoBreak(code, pc, imm.depth);
-          TRACE("  br => @%zu\n", pc + len);
-          break;
-        }
-        case kExprBrIf: {
-          BranchDepthImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          WasmValue cond = Pop();
-          bool is_true = cond.to<uint32_t>() != 0;
-          if (is_true) {
-            len = DoBreak(code, pc, imm.depth);
-            TRACE("  br_if => @%zu\n", pc + len);
-          } else {
-            TRACE("  false => fallthrough\n");
-            len = 1 + imm.length;
-          }
-          break;
-        }
-        case kExprBrTable: {
-          BranchTableImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          BranchTableIterator<Decoder::NoValidationTag> iterator(&decoder, imm);
-          uint32_t key = Pop().to<uint32_t>();
-          uint32_t depth = 0;
-          if (key >= imm.table_count) key = imm.table_count;
-          for (uint32_t i = 0; i <= key; i++) {
-            DCHECK(iterator.has_next());
-            depth = iterator.next();
-          }
-          len = key + DoBreak(code, pc + key, static_cast<size_t>(depth));
-          TRACE("  br[%u] => @%zu\n", key, pc + key + len);
-          break;
-        }
-        case kExprReturn: {
-          size_t arity = code->function->sig->return_count();
-          if (!DoReturn(&decoder, &code, &pc, &limit, arity)) return;
-          continue;  // Do not bump pc.
-        }
-        case kExprUnreachable: {
-          return DoTrap(kTrapUnreachable, pc);
-        }
-        case kExprDelegate: {
-          BranchDepthImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprEnd: {
-          break;
-        }
-        case kExprI32Const: {
-          ImmI32Immediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          Push(WasmValue(imm.value));
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprI64Const: {
-          ImmI64Immediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          Push(WasmValue(imm.value));
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprF32Const: {
-          ImmF32Immediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          Push(WasmValue(imm.value));
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprF64Const: {
-          ImmF64Immediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          Push(WasmValue(imm.value));
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprRefNull: {
-          HeapTypeImmediate imm(WasmFeatures::All(), &decoder, code->at(pc + 1),
-                                kNoValidate);
-          len = 1 + imm.length;
-          Push(WasmValue(isolate_->factory()->null_value(),
-                         ValueType::RefNull(imm.type)));
-          break;
-        }
-        case kExprRefFunc: {
-          IndexImmediate imm(&decoder, code->at(pc + 1), "function index",
-                             kNoValidate);
-          HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-
-          Handle<WasmInternalFunction> function =
-              WasmInstanceObject::GetOrCreateWasmInternalFunction(
-                  isolate_, instance_object_, imm.index);
-          Push(WasmValue(function, kWasmFuncRef));
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprLocalGet: {
-          IndexImmediate imm(&decoder, code->at(pc + 1), "local index",
-                             kNoValidate);
-          HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-          Push(GetStackValue(frames_.back().sp + imm.index));
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprLocalSet: {
-          IndexImmediate imm(&decoder, code->at(pc + 1), "local index",
-                             kNoValidate);
-          HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-          WasmValue val = Pop();
-          SetStackValue(frames_.back().sp + imm.index, val);
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprLocalTee: {
-          IndexImmediate imm(&decoder, code->at(pc + 1), "local index",
-                             kNoValidate);
-          HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-          WasmValue val = Pop();
-          SetStackValue(frames_.back().sp + imm.index, val);
-          Push(val);
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprDrop: {
-          Drop();
-          break;
-        }
-        case kExprCallFunction: {
-          CallFunctionImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          InterpreterCode* target = codemap_.GetCode(imm.index);
-          CHECK(!target->function->imported);
-          // Execute an internal call.
-          if (!DoCall(&decoder, &target, &pc, &limit)) return;
-          code = target;
-          continue;  // Do not bump pc.
-        }
-
-        case kExprCallIndirect: {
-          CallIndirectImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          uint32_t entry_index = Pop().to<uint32_t>();
-          CommitPc(pc);  // TODO(wasm): Be more disciplined about committing PC.
-          CallResult result = CallIndirectFunction(
-              imm.table_imm.index, entry_index, imm.sig_imm.index);
-          switch (result.type) {
-            case CallResult::INTERNAL:
-              // The import is a function of this instance. Call it directly.
-              if (!DoCall(&decoder, &result.interpreter_code, &pc, &limit))
-                return;
-              code = result.interpreter_code;
-              continue;  // Do not bump pc.
-            case CallResult::INVALID_FUNC:
-              return DoTrap(kTrapTableOutOfBounds, pc);
-            case CallResult::SIGNATURE_MISMATCH:
-              return DoTrap(kTrapFuncSigMismatch, pc);
-          }
-        } break;
-
-        case kExprReturnCall: {
-          // Make return calls more expensive, so that return call recursions
-          // don't cause a timeout.
-          if (max > 0) max = std::max(0, max - 100);
-          CallFunctionImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          InterpreterCode* target = codemap_.GetCode(imm.index);
-
-          CHECK(!target->function->imported);
-          // Enter internal found function.
-          if (!DoReturnCall(&decoder, target, &pc, &limit)) return;
-          code = target;
-          continue;  // Do not bump pc.
-        }
-
-        case kExprReturnCallIndirect: {
-          // Make return calls more expensive, so that return call recursions
-          // don't cause a timeout.
-          if (max > 0) max = std::max(0, max - 100);
-          CallIndirectImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          uint32_t entry_index = Pop().to<uint32_t>();
-          CommitPc(pc);  // TODO(wasm): Be more disciplined about committing PC.
-
-          // TODO(wasm): Calling functions needs some refactoring to avoid
-          // multi-exit code like this.
-          CallResult result = CallIndirectFunction(
-              imm.table_imm.index, entry_index, imm.sig_imm.index);
-          switch (result.type) {
-            case CallResult::INTERNAL: {
-              InterpreterCode* target = result.interpreter_code;
-
-              DCHECK(!target->function->imported);
-
-              // The function belongs to this instance. Enter it directly.
-              if (!DoReturnCall(&decoder, target, &pc, &limit)) return;
-              code = result.interpreter_code;
-              continue;  // Do not bump pc.
-            }
-            case CallResult::INVALID_FUNC:
-              return DoTrap(kTrapTableOutOfBounds, pc);
-            case CallResult::SIGNATURE_MISMATCH:
-              return DoTrap(kTrapFuncSigMismatch, pc);
-          }
-        } break;
-
-        case kExprGlobalGet: {
-          GlobalIndexImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          HandleScope handle_scope(isolate_);
-          Push(WasmInstanceObject::GetGlobalValue(
-              instance_object_, module()->globals[imm.index]));
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprGlobalSet: {
-          GlobalIndexImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          auto& global = module()->globals[imm.index];
-          switch (global.type.kind()) {
-#define CASE_TYPE(valuetype, ctype)                                     \
-  case valuetype: {                                                     \
-    uint8_t* ptr =                                                      \
-        WasmInstanceObject::GetGlobalStorage(instance_object_, global); \
-    *reinterpret_cast<ctype*>(ptr) = Pop().to<ctype>();                 \
-    break;                                                              \
-  }
-            FOREACH_WASMVALUE_CTYPES(CASE_TYPE)
-#undef CASE_TYPE
-            case kRef:
-            case kRefNull: {
-              // TODO(7748): Type checks or DCHECKs for ref types?
-              HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-              Handle<FixedArray> global_buffer;    // The buffer of the global.
-              uint32_t global_index;               // The index into the buffer.
-              std::tie(global_buffer, global_index) =
-                  WasmInstanceObject::GetGlobalBufferAndIndex(instance_object_,
-                                                              global);
-              Handle<Object> ref = Pop().to_ref();
-              global_buffer->set(global_index, *ref);
-              break;
-            }
-            case kRtt:
-            case kI8:
-            case kI16:
-            case kVoid:
-            case kBottom:
-              UNREACHABLE();
-          }
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprTableGet: {
-          IndexImmediate imm(&decoder, code->at(pc + 1), "table index",
-                             kNoValidate);
-          HandleScope handle_scope(isolate_);
-          auto table = handle(
-              WasmTableObject::cast(instance_object_->tables().get(imm.index)),
-              isolate_);
-          uint32_t table_size = table->current_length();
-          uint32_t entry_index = Pop().to<uint32_t>();
-          if (entry_index >= table_size) {
-            return DoTrap(kTrapTableOutOfBounds, pc);
-          }
-          Handle<Object> value =
-              WasmTableObject::Get(isolate_, table, entry_index);
-          Push(WasmValue(value, table->type()));
-          len = 1 + imm.length;
-          break;
-        }
-        case kExprTableSet: {
-          IndexImmediate imm(&decoder, code->at(pc + 1), "table index",
-                             kNoValidate);
-          HandleScope handle_scope(isolate_);
-          auto table = handle(
-              WasmTableObject::cast(instance_object_->tables().get(imm.index)),
-              isolate_);
-          uint32_t table_size = table->current_length();
-          Handle<Object> value = Pop().to_ref();
-          uint32_t entry_index = Pop().to<uint32_t>();
-          if (entry_index >= table_size) {
-            return DoTrap(kTrapTableOutOfBounds, pc);
-          }
-          WasmTableObject::Set(isolate_, table, entry_index, value);
-          len = 1 + imm.length;
-          break;
-        }
-#define LOAD_CASE(name, ctype, mtype, rep)                      \
-  case kExpr##name: {                                           \
-    if (!ExecuteLoad<ctype, mtype>(&decoder, code, pc, &len,    \
-                                   MachineRepresentation::rep)) \
-      return;                                                   \
-    break;                                                      \
-  }
-
-          LOAD_CASE(I32LoadMem8S, int32_t, int8_t, kWord8);
-          LOAD_CASE(I32LoadMem8U, int32_t, uint8_t, kWord8);
-          LOAD_CASE(I32LoadMem16S, int32_t, int16_t, kWord16);
-          LOAD_CASE(I32LoadMem16U, int32_t, uint16_t, kWord16);
-          LOAD_CASE(I64LoadMem8S, int64_t, int8_t, kWord8);
-          LOAD_CASE(I64LoadMem8U, int64_t, uint8_t, kWord16);
-          LOAD_CASE(I64LoadMem16S, int64_t, int16_t, kWord16);
-          LOAD_CASE(I64LoadMem16U, int64_t, uint16_t, kWord16);
-          LOAD_CASE(I64LoadMem32S, int64_t, int32_t, kWord32);
-          LOAD_CASE(I64LoadMem32U, int64_t, uint32_t, kWord32);
-          LOAD_CASE(I32LoadMem, int32_t, int32_t, kWord32);
-          LOAD_CASE(I64LoadMem, int64_t, int64_t, kWord64);
-          LOAD_CASE(F32LoadMem, Float32, uint32_t, kFloat32);
-          LOAD_CASE(F64LoadMem, Float64, uint64_t, kFloat64);
-#undef LOAD_CASE
-
-#define STORE_CASE(name, ctype, mtype, rep)                      \
-  case kExpr##name: {                                            \
-    if (!ExecuteStore<ctype, mtype>(&decoder, code, pc, &len,    \
-                                    MachineRepresentation::rep)) \
-      return;                                                    \
-    break;                                                       \
-  }
-
-          STORE_CASE(I32StoreMem8, int32_t, int8_t, kWord8);
-          STORE_CASE(I32StoreMem16, int32_t, int16_t, kWord16);
-          STORE_CASE(I64StoreMem8, int64_t, int8_t, kWord8);
-          STORE_CASE(I64StoreMem16, int64_t, int16_t, kWord16);
-          STORE_CASE(I64StoreMem32, int64_t, int32_t, kWord32);
-          STORE_CASE(I32StoreMem, int32_t, int32_t, kWord32);
-          STORE_CASE(I64StoreMem, int64_t, int64_t, kWord64);
-          STORE_CASE(F32StoreMem, Float32, uint32_t, kFloat32);
-          STORE_CASE(F64StoreMem, Float64, uint64_t, kFloat64);
-#undef STORE_CASE
-
-#define ASMJS_LOAD_CASE(name, ctype, mtype, defval)                 \
-  case kExpr##name: {                                               \
-    uint32_t index = Pop().to<uint32_t>();                          \
-    ctype result;                                                   \
-    Address addr = BoundsCheckMem<mtype>(0, index);                 \
-    if (!addr) {                                                    \
-      result = defval;                                              \
-    } else {                                                        \
-      /* TODO(titzer): alignment for asmjs load mem? */             \
-      result = static_cast<ctype>(*reinterpret_cast<mtype*>(addr)); \
-    }                                                               \
-    Push(WasmValue(result));                                        \
-    break;                                                          \
-  }
-          ASMJS_LOAD_CASE(I32AsmjsLoadMem8S, int32_t, int8_t, 0);
-          ASMJS_LOAD_CASE(I32AsmjsLoadMem8U, int32_t, uint8_t, 0);
-          ASMJS_LOAD_CASE(I32AsmjsLoadMem16S, int32_t, int16_t, 0);
-          ASMJS_LOAD_CASE(I32AsmjsLoadMem16U, int32_t, uint16_t, 0);
-          ASMJS_LOAD_CASE(I32AsmjsLoadMem, int32_t, int32_t, 0);
-          ASMJS_LOAD_CASE(F32AsmjsLoadMem, float, float,
-                          std::numeric_limits<float>::quiet_NaN());
-          ASMJS_LOAD_CASE(F64AsmjsLoadMem, double, double,
-                          std::numeric_limits<double>::quiet_NaN());
-#undef ASMJS_LOAD_CASE
-
-#define ASMJS_STORE_CASE(name, ctype, mtype)                                   \
-  case kExpr##name: {                                                          \
-    WasmValue val = Pop();                                                     \
-    uint32_t index = Pop().to<uint32_t>();                                     \
-    Address addr = BoundsCheckMem<mtype>(0, index);                            \
-    if (addr) {                                                                \
-      *(reinterpret_cast<mtype*>(addr)) = static_cast<mtype>(val.to<ctype>()); \
-    }                                                                          \
-    Push(val);                                                                 \
-    break;                                                                     \
-  }
-
-          ASMJS_STORE_CASE(I32AsmjsStoreMem8, int32_t, int8_t);
-          ASMJS_STORE_CASE(I32AsmjsStoreMem16, int32_t, int16_t);
-          ASMJS_STORE_CASE(I32AsmjsStoreMem, int32_t, int32_t);
-          ASMJS_STORE_CASE(F32AsmjsStoreMem, float, float);
-          ASMJS_STORE_CASE(F64AsmjsStoreMem, double, double);
-#undef ASMJS_STORE_CASE
-        case kExprMemoryGrow: {
-          MemoryIndexImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          // TODO(clemensb): Fix this for memory64.
-          uint32_t delta_pages = Pop().to<uint32_t>();
-          HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-          Handle<WasmMemoryObject> memory(instance_object_->memory_object(),
-                                          isolate_);
-          int32_t result =
-              WasmMemoryObject::Grow(isolate_, memory, delta_pages);
-          Push(WasmValue(result));
-          len = 1 + imm.length;
-          // Treat one grow_memory instruction like 1000 other instructions,
-          // because it is a really expensive operation.
-          if (max > 0) max = std::max(0, max - 1000);
-          break;
-        }
-        case kExprMemorySize: {
-          MemoryIndexImmediate imm(&decoder, code->at(pc + 1), kNoValidate);
-          uint64_t num_pages = instance_object_->memory_size() / kWasmPageSize;
-          Push(module()->is_memory64
-                   ? WasmValue(num_pages)
-                   : WasmValue(static_cast<uint32_t>(num_pages)));
-          len = 1 + imm.length;
-          break;
-        }
-        // We need to treat kExprI32ReinterpretF32 and kExprI64ReinterpretF64
-        // specially to guarantee that the quiet bit of a NaN is preserved on
-        // ia32 by the reinterpret casts.
-        case kExprI32ReinterpretF32: {
-          WasmValue val = Pop();
-          Push(WasmValue(ExecuteI32ReinterpretF32(val)));
-          break;
-        }
-        case kExprI64ReinterpretF64: {
-          WasmValue val = Pop();
-          Push(WasmValue(ExecuteI64ReinterpretF64(val)));
-          break;
-        }
-#define SIGN_EXTENSION_CASE(name, wtype, ntype)        \
-  case kExpr##name: {                                  \
-    ntype val = static_cast<ntype>(Pop().to<wtype>()); \
-    Push(WasmValue(static_cast<wtype>(val)));          \
-    break;                                             \
-  }
-          SIGN_EXTENSION_CASE(I32SExtendI8, int32_t, int8_t);
-          SIGN_EXTENSION_CASE(I32SExtendI16, int32_t, int16_t);
-          SIGN_EXTENSION_CASE(I64SExtendI8, int64_t, int8_t);
-          SIGN_EXTENSION_CASE(I64SExtendI16, int64_t, int16_t);
-          SIGN_EXTENSION_CASE(I64SExtendI32, int64_t, int32_t);
-#undef SIGN_EXTENSION_CASE
-        case kExprRefIsNull: {
-          len = 1;
-          HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-          uint32_t result = Pop().to_ref()->IsNull() ? 1 : 0;
-          Push(WasmValue(result));
-          break;
-        }
-        case kNumericPrefix: {
-          if (!ExecuteNumericOp(opcode, &decoder, code, pc, &len)) return;
-          break;
-        }
-        case kAtomicPrefix: {
-          if (!ExecuteAtomicOp(opcode, &decoder, code, pc, &len)) return;
-          break;
-        }
-        case kSimdPrefix: {
-          if (!ExecuteSimdOp(opcode, &decoder, code, pc, &len)) return;
-          break;
-        }
-
-#define EXECUTE_SIMPLE_BINOP(name, ctype, op)               \
-  case kExpr##name: {                                       \
-    WasmValue rval = Pop();                                 \
-    WasmValue lval = Pop();                                 \
-    auto result = lval.to<ctype>() op rval.to<ctype>();     \
-    possible_nondeterminism_ |= has_nondeterminism(result); \
-    Push(WasmValue(result));                                \
-    break;                                                  \
-  }
-          FOREACH_SIMPLE_BINOP(EXECUTE_SIMPLE_BINOP)
-#undef EXECUTE_SIMPLE_BINOP
-
-#define EXECUTE_OTHER_BINOP(name, ctype)                    \
-  case kExpr##name: {                                       \
-    TrapReason trap = kTrapCount;                           \
-    ctype rval = Pop().to<ctype>();                         \
-    ctype lval = Pop().to<ctype>();                         \
-    auto result = Execute##name(lval, rval, &trap);         \
-    possible_nondeterminism_ |= has_nondeterminism(result); \
-    if (trap != kTrapCount) return DoTrap(trap, pc);        \
-    Push(WasmValue(result));                                \
-    break;                                                  \
-  }
-          FOREACH_OTHER_BINOP(EXECUTE_OTHER_BINOP)
-#undef EXECUTE_OTHER_BINOP
-
-#define EXECUTE_UNOP(name, ctype, exec_fn)                  \
-  case kExpr##name: {                                       \
-    TrapReason trap = kTrapCount;                           \
-    ctype val = Pop().to<ctype>();                          \
-    auto result = exec_fn(val, &trap);                      \
-    possible_nondeterminism_ |= has_nondeterminism(result); \
-    if (trap != kTrapCount) return DoTrap(trap, pc);        \
-    Push(WasmValue(result));                                \
-    break;                                                  \
-  }
-
-#define EXECUTE_OTHER_UNOP(name, ctype) EXECUTE_UNOP(name, ctype, Execute##name)
-          FOREACH_OTHER_UNOP(EXECUTE_OTHER_UNOP)
-#undef EXECUTE_OTHER_UNOP
-
-#define EXECUTE_I32CONV_FLOATOP(name, out_type, in_type) \
-  EXECUTE_UNOP(name, in_type, ExecuteConvert<out_type>)
-          FOREACH_I32CONV_FLOATOP(EXECUTE_I32CONV_FLOATOP)
-#undef EXECUTE_I32CONV_FLOATOP
-#undef EXECUTE_UNOP
-
-        default:
-          FATAL("Unknown or unimplemented opcode #%d:%s", code->start[pc],
-                WasmOpcodes::OpcodeName(
-                    static_cast<WasmOpcode>(code->start[pc])));
-          UNREACHABLE();
-      }
-
-#ifdef DEBUG
-      if (!WasmOpcodes::IsControlOpcode(opcode)) {
-        DCHECK_EQ(expected_new_stack_height, StackHeight());
-      }
-#endif
-
-      pc += len;
-      if (pc == limit) {
-        // Fell off end of code; do an implicit return.
-        TRACE("@%-3zu: ImplicitReturn\n", pc);
-        size_t arity = code->function->sig->return_count();
-        DCHECK_EQ(StackHeight() - arity, frames_.back().llimit());
-        if (!DoReturn(&decoder, &code, &pc, &limit, arity)) return;
-      }
-    }
-
-    state_ = WasmInterpreter::PAUSED;
-    CommitPc(pc);
-  }
-
-  WasmValue Pop() {
-    DCHECK_GT(frames_.size(), 0);
-    DCHECK_GT(StackHeight(), frames_.back().llimit());  // can't pop into locals
-    StackValue stack_value = *--sp_;
-    // Note that {StackHeight} depends on the current {sp} value, hence this
-    // operation is split into two statements to ensure proper evaluation order.
-    WasmValue val = stack_value.ExtractValue(this, StackHeight());
-    stack_value.ClearValue(this, StackHeight());
-    return val;
-  }
-
-  void Drop(int n = 1) {
-    DCHECK_GE(StackHeight(), n);
-    DCHECK_GT(frames_.size(), 0);
-    // Check that we don't pop into locals.
-    DCHECK_GE(StackHeight() - n, frames_.back().llimit());
-    StackValue::ClearValues(this, StackHeight() - n, n);
-    sp_ -= n;
-  }
-
-  WasmValue PopArity(size_t arity) {
-    if (arity == 0) return WasmValue();
-    CHECK_EQ(1, arity);
-    return Pop();
-  }
-
-  void Push(WasmValue val) {
-    DCHECK_NE(kWasmVoid, val.type());
-    DCHECK_NE(kWasmI8, val.type());
-    DCHECK_NE(kWasmI16, val.type());
-    DCHECK_LE(1, stack_limit_ - sp_);
-    DCHECK(StackValue::IsClearedValue(this, StackHeight()));
-    StackValue stack_value(val, this, StackHeight());
-    // Note that {StackHeight} depends on the current {sp} value, hence this
-    // operation is split into two statements to ensure proper evaluation order.
-    *sp_++ = stack_value;
-  }
-
-  void Push(WasmValue* vals, size_t arity) {
-    DCHECK_LE(arity, stack_limit_ - sp_);
-    for (WasmValue *val = vals, *end = vals + arity; val != end; ++val) {
-      DCHECK_NE(kWasmVoid, val->type());
-      Push(*val);
-    }
-  }
-
-  void ResetStack(sp_t new_height) {
-    DCHECK_LE(new_height, StackHeight());  // Only allowed to shrink.
-    int count = static_cast<int>(StackHeight() - new_height);
-    StackValue::ClearValues(this, new_height, count);
-    sp_ = stack_.get() + new_height;
-  }
-
-  void EnsureStackSpace(size_t size) {
-    if (V8_LIKELY(static_cast<size_t>(stack_limit_ - sp_) >= size)) return;
-    size_t old_size = stack_limit_ - stack_.get();
-    size_t requested_size =
-        base::bits::RoundUpToPowerOfTwo64((sp_ - stack_.get()) + size);
-    size_t new_size =
-        std::max(size_t{8}, std::max(2 * old_size, requested_size));
-    std::unique_ptr<StackValue[]> new_stack(new StackValue[new_size]);
-    if (old_size > 0) {
-      memcpy(new_stack.get(), stack_.get(), old_size * sizeof(*sp_));
-    }
-    sp_ = new_stack.get() + (sp_ - stack_.get());
-    stack_ = std::move(new_stack);
-    stack_limit_ = stack_.get() + new_size;
-    // Also resize the reference stack to the same size.
-    int grow_by = static_cast<int>(new_size - old_size);
-    HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-    Handle<FixedArray> new_ref_stack =
-        isolate_->factory()->CopyFixedArrayAndGrow(reference_stack_, grow_by);
-    new_ref_stack->FillWithHoles(static_cast<int>(old_size),
-                                 static_cast<int>(new_size));
-    isolate_->global_handles()->Destroy(reference_stack_.location());
-    reference_stack_ = isolate_->global_handles()->Create(*new_ref_stack);
-  }
-
-  sp_t StackHeight() { return sp_ - stack_.get(); }
-
-  void TraceValueStack() {
-#ifdef DEBUG
-    if (!v8_flags.trace_wasm_interpreter) return;
-    HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-    Frame* top = frames_.size() > 0 ? &frames_.back() : nullptr;
-    sp_t sp = top ? top->sp : 0;
-    sp_t plimit = top ? top->plimit() : 0;
-    sp_t llimit = top ? top->llimit() : 0;
-    for (size_t i = sp; i < StackHeight(); ++i) {
-      if (i < plimit) {
-        PrintF(" p%zu:", i);
-      } else if (i < llimit) {
-        PrintF(" l%zu:", i);
-      } else {
-        PrintF(" s%zu:", i);
-      }
-      WasmValue val = GetStackValue(i);
-      switch (val.type().kind()) {
-        case kI32:
-          PrintF("i32:%d", val.to<int32_t>());
-          break;
-        case kI64:
-          PrintF("i64:%" PRId64 "", val.to<int64_t>());
-          break;
-        case kF32:
-          PrintF("f32:%a", val.to<float>());
-          break;
-        case kF64:
-          PrintF("f64:%la", val.to<double>());
-          break;
-        case kS128: {
-          // This defaults to tracing all S128 values as i32x4 values for now,
-          // when there is more state to know what type of values are on the
-          // stack, the right format should be printed here.
-          int4 s = val.to_s128().to_i32x4();
-          PrintF("i32x4:%d,%d,%d,%d", s.val[0], s.val[1], s.val[2], s.val[3]);
-          break;
-        }
-        case kVoid:
-          PrintF("void");
-          break;
-        case kRefNull:
-          if (val.to_ref()->IsNull()) {
-            PrintF("ref:null");
-            break;
-          }
-          V8_FALLTHROUGH;
-        case kRef:
-          PrintF("ref:0x%" V8PRIxPTR, val.to_ref()->ptr());
-          break;
-        case kRtt:
-          PrintF("rtt:0x%" V8PRIxPTR, val.to_ref()->ptr());
-          break;
-        case kI8:
-        case kI16:
-        case kBottom:
-          UNREACHABLE();
-      }
-    }
-#endif  // DEBUG
-  }
-
-  CallResult CallIndirectFunction(uint32_t table_index, uint32_t entry_index,
-                                  uint32_t sig_index) {
-    HandleScope handle_scope(isolate_);  // Avoid leaking handles.
-    uint32_t expected_sig_id;
-    expected_sig_id = module()->isorecursive_canonical_type_ids[sig_index];
-
-    Handle<WasmIndirectFunctionTable> table =
-        instance_object_->GetIndirectFunctionTable(isolate_, table_index);
-
-    // Bounds check against table size.
-    if (entry_index >= table->size()) return {CallResult::INVALID_FUNC};
-
-    // Signature check.
-    if (table->sig_ids()[entry_index] != expected_sig_id) {
-      return {CallResult::SIGNATURE_MISMATCH};
-    }
-
-    Handle<Object> object_ref =
-        handle(table->refs().get(entry_index), isolate_);
-    // Check that this is an internal call (within the same instance).
-    CHECK(object_ref->IsWasmInstanceObject() &&
-          instance_object_.is_identical_to(object_ref));
-
-    NativeModule* native_module =
-        instance_object_->module_object().native_module();
-#ifdef DEBUG
-    {
-      WasmCodeRefScope code_ref_scope;
-      WasmCode* wasm_code =
-          native_module->Lookup(table->targets()[entry_index]);
-      DCHECK_EQ(native_module, wasm_code->native_module());
-      DCHECK_EQ(WasmCode::kJumpTable, wasm_code->kind());
-    }
-#endif
-    uint32_t func_index = native_module->GetFunctionIndexFromJumpTableSlot(
-        table->targets()[entry_index]);
-
-    return {CallResult::INTERNAL, codemap_.GetCode(func_index)};
-  }
-
-  // Create a copy of the module bytes for the interpreter, since the passed
-  // pointer might be invalidated after constructing the interpreter.
-  const ZoneVector<uint8_t> module_bytes_;
-  CodeMap codemap_;
-  Isolate* isolate_;
-  Handle<WasmInstanceObject> instance_object_;
-  std::unique_ptr<StackValue[]> stack_;
-  StackValue* stack_limit_ = nullptr;  // End of allocated stack space.
-  StackValue* sp_ = nullptr;           // Current stack pointer.
-  // References are on an on-heap stack.
-  Handle<FixedArray> reference_stack_;
-  ZoneVector<Frame> frames_;
-  WasmInterpreter::State state_ = WasmInterpreter::STOPPED;
-  TrapReason trap_reason_ = kTrapCount;
-  bool possible_nondeterminism_ = false;
-  uint64_t num_interpreted_calls_ = 0;
-};
-
-namespace {
-void NopFinalizer(const v8::WeakCallbackInfo<void>& data) {
-  Address* global_handle_location =
-      reinterpret_cast<Address*>(data.GetParameter());
-  GlobalHandles::Destroy(global_handle_location);
-}
-
-Handle<WasmInstanceObject> MakeWeak(
-    Isolate* isolate, Handle<WasmInstanceObject> instance_object) {
-  Handle<WasmInstanceObject> weak_instance =
-      isolate->global_handles()->Create<WasmInstanceObject>(*instance_object);
-  Address* global_handle_location = weak_instance.location();
-  GlobalHandles::MakeWeak(global_handle_location, global_handle_location,
-                          &NopFinalizer, v8::WeakCallbackType::kParameter);
-  return weak_instance;
-}
-}  // namespace
-
-//============================================================================
-// Implementation of the public interface of the interpreter.
-//============================================================================
-WasmInterpreter::WasmInterpreter(Isolate* isolate, const WasmModule* module,
-                                 ModuleWireBytes wire_bytes,
-                                 Handle<WasmInstanceObject> instance_object)
-    : zone_(isolate->allocator(), ZONE_NAME),
-      internals_(new WasmInterpreterInternals(
-          &zone_, module, wire_bytes, MakeWeak(isolate, instance_object))) {}
-
-// The destructor is here so we can forward declare {WasmInterpreterInternals}
-// used in the {unique_ptr} in the header.
-WasmInterpreter::~WasmInterpreter() = default;
-
-WasmInterpreter::State WasmInterpreter::state() const {
-  return internals_->state();
-}
-
-void WasmInterpreter::InitFrame(const WasmFunction* function, WasmValue* args) {
-  internals_->InitFrame(function, args);
-}
-
-WasmInterpreter::State WasmInterpreter::Run(int num_steps) {
-  return internals_->Run(num_steps);
-}
-
-void WasmInterpreter::Pause() { internals_->Pause(); }
-
-void WasmInterpreter::Reset() { internals_->Reset(); }
-
-WasmValue WasmInterpreter::GetReturnValue(int index) const {
-  return internals_->GetReturnValue(index);
-}
-
-TrapReason WasmInterpreter::GetTrapReason() const {
-  return internals_->GetTrapReason();
-}
-
-bool WasmInterpreter::PossibleNondeterminism() const {
-  return internals_->PossibleNondeterminism();
-}
-
-uint64_t WasmInterpreter::NumInterpretedCalls() const {
-  return internals_->NumInterpretedCalls();
-}
-
-void WasmInterpreter::AddFunctionForTesting(const WasmFunction* function) {
-  internals_->codemap()->AddFunction(function, nullptr, nullptr);
-}
-
-void WasmInterpreter::SetFunctionCodeForTesting(const WasmFunction* function,
-                                                const byte* start,
-                                                const byte* end) {
-  internals_->codemap()->SetFunctionCode(function, start, end);
-}
-
-ControlTransferMap WasmInterpreter::ComputeControlTransfersForTesting(
-    Zone* zone, const byte* start, const byte* end) {
-  // Create some dummy structures, to avoid special-casing the implementation
-  // just for testing.
-  FunctionSig sig(0, 0, nullptr);
-  WasmFunction function{&sig,    // sig
-                        0,       // func_index
-                        0,       // sig_index
-                        {0, 0},  // code
-                        false,   // imported
-                        false,   // exported
-                        false};  // declared
-  InterpreterCode code{&function, BodyLocalDecls{}, start, end, nullptr};
-
-  // Now compute and return the control transfers.
-  constexpr const WasmModule* kNoModule = nullptr;
-  SideTable side_table(zone, kNoModule, &code);
-  return side_table.map_;
-}
-
-#undef TRACE
-#undef LANE
-#undef FOREACH_SIMPLE_BINOP
-#undef FOREACH_OTHER_BINOP
-#undef FOREACH_I32CONV_FLOATOP
-#undef FOREACH_OTHER_UNOP
-
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/common/wasm/wasm-interpreter.h b/deps/v8/test/common/wasm/wasm-interpreter.h
deleted file mode 100644
index 41fe50ba435dc6..00000000000000
--- a/deps/v8/test/common/wasm/wasm-interpreter.h
+++ /dev/null
@@ -1,127 +0,0 @@
-// Copyright 2016 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#ifndef V8_WASM_WASM_INTERPRETER_H_
-#define V8_WASM_WASM_INTERPRETER_H_
-
-#include <memory>
-
-#include "src/wasm/wasm-opcodes.h"
-#include "src/wasm/wasm-value.h"
-#include "src/zone/zone-containers.h"
-
-namespace v8 {
-
-namespace internal {
-class WasmInstanceObject;
-
-namespace wasm {
-
-// Forward declarations.
-struct ModuleWireBytes;
-struct WasmFunction;
-struct WasmModule;
-class WasmInterpreterInternals;
-
-using pc_t = size_t;
-using sp_t = size_t;
-using pcdiff_t = int32_t;
-using spdiff_t = uint32_t;
-
-struct ControlTransferEntry {
-  // Distance from the instruction to the label to jump to (forward, but can be
-  // negative).
-  pcdiff_t pc_diff;
-  // Delta by which to decrease the stack height.
-  spdiff_t sp_diff;
-  // Arity of the block we jump to.
-  uint32_t target_arity;
-};
-
-struct CatchControlTransferEntry : public ControlTransferEntry {
-  int tag_index;
-  int target_control_index;
-};
-
-struct ControlTransferMap {
-  explicit ControlTransferMap(Zone* zone) : map(zone), catch_map(zone) {}
-
-  ZoneMap<pc_t, ControlTransferEntry> map;
-  ZoneMap<pc_t, ZoneVector<CatchControlTransferEntry>> catch_map;
-};
-
-// An interpreter capable of executing WebAssembly.
-class WasmInterpreter {
- public:
-  WasmInterpreter(const WasmInterpreter&) = delete;
-  WasmInterpreter& operator=(const WasmInterpreter&) = delete;
-
-  // State machine for the interpreter:
-  //    +----------------------------------------------------------+
-  //    |                    +--------Run()/Step()---------+       |
-  //    V                    V                             |       |
-  // STOPPED ---Run()-->  RUNNING  ------Pause()-----+-> PAUSED <--+
-  //    ^                 | | | |                   /
-  //    +--- Exception ---+ | | +--- Breakpoint ---+
-  //                        | +---------- Trap --------------> TRAPPED
-  //                        +----------- Finish -------------> FINISHED
-  enum State { STOPPED, RUNNING, PAUSED, FINISHED, TRAPPED };
-
-  enum ExceptionHandlingResult { HANDLED, UNWOUND };
-
-  WasmInterpreter(Isolate* isolate, const WasmModule* module,
-                  ModuleWireBytes wire_bytes,
-                  Handle<WasmInstanceObject> instance);
-
-  ~WasmInterpreter();
-
-  //==========================================================================
-  // Execution controls.
-  //==========================================================================
-  State state() const;
-  void InitFrame(const WasmFunction* function, WasmValue* args);
-  // Pass -1 as num_steps to run till completion, pause or breakpoint.
-  State Run(int num_steps = -1);
-  State Step() { return Run(1); }
-  void Pause();
-  void Reset();
-
-  // Stack inspection and modification.
-  WasmValue GetReturnValue(int index = 0) const;
-  TrapReason GetTrapReason() const;
-
-  // Returns true if the thread executed an instruction which may produce
-  // nondeterministic results, e.g. float div, float sqrt, and float mul,
-  // where the sign bit of a NaN is nondeterministic.
-  bool PossibleNondeterminism() const;
-
-  // Returns the number of calls / function frames executed on this thread.
-  uint64_t NumInterpretedCalls() const;
-
-  //==========================================================================
-  // Testing functionality.
-  //==========================================================================
-  // Manually adds a function to this interpreter. The func_index of the
-  // function must match the current number of functions.
-  void AddFunctionForTesting(const WasmFunction* function);
-  // Manually adds code to the interpreter for the given function.
-  void SetFunctionCodeForTesting(const WasmFunction* function,
-                                 const byte* start, const byte* end);
-
-  // Computes the control transfers for the given bytecode. Used internally in
-  // the interpreter, but exposed for testing.
-  static ControlTransferMap ComputeControlTransfersForTesting(Zone* zone,
-                                                              const byte* start,
-                                                              const byte* end);
-
- private:
-  Zone zone_;
-  std::unique_ptr<WasmInterpreterInternals> internals_;
-};
-
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
-
-#endif  // V8_WASM_WASM_INTERPRETER_H_
diff --git a/deps/v8/test/common/wasm/wasm-macro-gen.h b/deps/v8/test/common/wasm/wasm-macro-gen.h
index eaae6ea17fbdd2..ae071d74e53728 100644
--- a/deps/v8/test/common/wasm/wasm-macro-gen.h
+++ b/deps/v8/test/common/wasm/wasm-macro-gen.h
@@ -7,11 +7,11 @@
 
 #include "src/wasm/wasm-opcodes.h"
 
-#define U32_LE(v)                                    \
-  static_cast<byte>(v), static_cast<byte>((v) >> 8), \
-      static_cast<byte>((v) >> 16), static_cast<byte>((v) >> 24)
+#define U32_LE(v)                                          \
+  static_cast<uint8_t>(v), static_cast<uint8_t>((v) >> 8), \
+      static_cast<uint8_t>((v) >> 16), static_cast<uint8_t>((v) >> 24)
 
-#define U16_LE(v) static_cast<byte>(v), static_cast<byte>((v) >> 8)
+#define U16_LE(v) static_cast<uint8_t>(v), static_cast<uint8_t>((v) >> 8)
 
 #define WASM_MODULE_HEADER U32_LE(kWasmMagic), U32_LE(kWasmVersion)
 
@@ -33,8 +33,8 @@
 // The table index field in an element segment was repurposed as a flags field.
 // To specify a table index, we have to set the flag value to 2, followed by
 // the table index.
-#define TABLE_INDEX0 static_cast<byte>(ACTIVE_NO_INDEX)
-#define TABLE_INDEX(v) static_cast<byte>(ACTIVE_WITH_INDEX), U32V_1(v)
+#define TABLE_INDEX0 static_cast<uint8_t>(ACTIVE_NO_INDEX)
+#define TABLE_INDEX(v) static_cast<uint8_t>(ACTIVE_WITH_INDEX), U32V_1(v)
 
 #define ZERO_ALIGNMENT 0
 #define ZERO_OFFSET 0
@@ -46,24 +46,25 @@
 #define MASK_21 ((1 << 21) - 1)
 #define MASK_28 ((1 << 28) - 1)
 
-#define U32V_1(x) static_cast<byte>((x)&MASK_7)
-#define U32V_2(x) \
-  static_cast<byte>(((x)&MASK_7) | 0x80), static_cast<byte>(((x) >> 7) & MASK_7)
-#define U32V_3(x)                                      \
-  static_cast<byte>((((x)) & MASK_7) | 0x80),          \
-      static_cast<byte>((((x) >> 7) & MASK_7) | 0x80), \
-      static_cast<byte>(((x) >> 14) & MASK_7)
-#define U32V_4(x)                                       \
-  static_cast<byte>(((x)&MASK_7) | 0x80),               \
-      static_cast<byte>((((x) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>((((x) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>(((x) >> 21) & MASK_7)
-#define U32V_5(x)                                       \
-  static_cast<byte>(((x)&MASK_7) | 0x80),               \
-      static_cast<byte>((((x) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>((((x) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>((((x) >> 21) & MASK_7) | 0x80), \
-      static_cast<byte>((((x) >> 28) & MASK_7))
+#define U32V_1(x) static_cast<uint8_t>((x)&MASK_7)
+#define U32V_2(x)                            \
+  static_cast<uint8_t>(((x)&MASK_7) | 0x80), \
+      static_cast<uint8_t>(((x) >> 7) & MASK_7)
+#define U32V_3(x)                                         \
+  static_cast<uint8_t>((((x)) & MASK_7) | 0x80),          \
+      static_cast<uint8_t>((((x) >> 7) & MASK_7) | 0x80), \
+      static_cast<uint8_t>(((x) >> 14) & MASK_7)
+#define U32V_4(x)                                          \
+  static_cast<uint8_t>(((x)&MASK_7) | 0x80),               \
+      static_cast<uint8_t>((((x) >> 7) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>((((x) >> 14) & MASK_7) | 0x80), \
+      static_cast<uint8_t>(((x) >> 21) & MASK_7)
+#define U32V_5(x)                                          \
+  static_cast<uint8_t>(((x)&MASK_7) | 0x80),               \
+      static_cast<uint8_t>((((x) >> 7) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>((((x) >> 14) & MASK_7) | 0x80), \
+      static_cast<uint8_t>((((x) >> 21) & MASK_7) | 0x80), \
+      static_cast<uint8_t>((((x) >> 28) & MASK_7))
 
 #define U64V_1(x) U32V_1(static_cast<uint32_t>(x))
 #define U64V_2(x) U32V_2(static_cast<uint32_t>(x))
@@ -109,7 +110,8 @@
 #define DEPTH_1 1
 #define DEPTH_2 2
 
-#define WASM_HEAP_TYPE(heap_type) static_cast<byte>((heap_type).code() & 0x7f)
+#define WASM_HEAP_TYPE(heap_type) \
+  static_cast<uint8_t>((heap_type).code() & 0x7f)
 
 #define WASM_REF_TYPE(type)                        \
   (type).kind() == kRef ? kRefCode : kRefNullCode, \
@@ -121,13 +123,13 @@
 #define WASM_BLOCK_F(...) kExprBlock, kF32Code, __VA_ARGS__, kExprEnd
 #define WASM_BLOCK_D(...) kExprBlock, kF64Code, __VA_ARGS__, kExprEnd
 #define WASM_BLOCK_T(t, ...) \
-  kExprBlock, static_cast<byte>((t).value_type_code()), __VA_ARGS__, kExprEnd
+  kExprBlock, static_cast<uint8_t>((t).value_type_code()), __VA_ARGS__, kExprEnd
 
 #define WASM_BLOCK_R(type, ...) \
   kExprBlock, WASM_REF_TYPE(type), __VA_ARGS__, kExprEnd
 
 #define WASM_BLOCK_X(index, ...) \
-  kExprBlock, static_cast<byte>(index), __VA_ARGS__, kExprEnd
+  kExprBlock, static_cast<uint8_t>(index), __VA_ARGS__, kExprEnd
 
 #define WASM_INFINITE_LOOP kExprLoop, kVoidCode, kExprBr, DEPTH_0, kExprEnd
 
@@ -138,23 +140,24 @@
 #define WASM_LOOP_D(...) kExprLoop, kF64Code, __VA_ARGS__, kExprEnd
 
 #define WASM_LOOP_T(t, ...) \
-  kExprLoop, static_cast<byte>((t).value_type_code()), __VA_ARGS__, kExprEnd
+  kExprLoop, static_cast<uint8_t>((t).value_type_code()), __VA_ARGS__, kExprEnd
 
 #define WASM_LOOP_R(t, ...) kExprLoop, TYPE_IMM(t), __VA_ARGS__, kExprEnd
 
 #define WASM_LOOP_X(index, ...) \
-  kExprLoop, static_cast<byte>(index), __VA_ARGS__, kExprEnd
+  kExprLoop, static_cast<uint8_t>(index), __VA_ARGS__, kExprEnd
 
 #define WASM_IF(cond, ...) cond, kExprIf, kVoidCode, __VA_ARGS__, kExprEnd
 
-#define WASM_IF_T(t, cond, ...) \
-  cond, kExprIf, static_cast<byte>((t).value_type_code()), __VA_ARGS__, kExprEnd
+#define WASM_IF_T(t, cond, ...)                                            \
+  cond, kExprIf, static_cast<uint8_t>((t).value_type_code()), __VA_ARGS__, \
+      kExprEnd
 
 #define WASM_IF_R(t, cond, ...) \
   cond, kExprIf, TYPE_IMM(t), __VA_ARGS__, kExprEnd
 
 #define WASM_IF_X(index, cond, ...) \
-  cond, kExprIf, static_cast<byte>(index), __VA_ARGS__, kExprEnd
+  cond, kExprIf, static_cast<uint8_t>(index), __VA_ARGS__, kExprEnd
 
 #define WASM_IF_ELSE(cond, tstmt, fstmt) \
   cond, kExprIf, kVoidCode, tstmt, kExprElse, fstmt, kExprEnd
@@ -168,35 +171,35 @@
 #define WASM_IF_ELSE_D(cond, tstmt, fstmt) \
   cond, kExprIf, kF64Code, tstmt, kExprElse, fstmt, kExprEnd
 
-#define WASM_IF_ELSE_T(t, cond, tstmt, fstmt)                                \
-  cond, kExprIf, static_cast<byte>((t).value_type_code()), tstmt, kExprElse, \
-      fstmt, kExprEnd
+#define WASM_IF_ELSE_T(t, cond, tstmt, fstmt)                        \
+  cond, kExprIf, static_cast<uint8_t>((t).value_type_code()), tstmt, \
+      kExprElse, fstmt, kExprEnd
 
 #define WASM_IF_ELSE_R(t, cond, tstmt, fstmt) \
   cond, kExprIf, WASM_REF_TYPE(t), tstmt, kExprElse, fstmt, kExprEnd
 
-#define WASM_IF_ELSE_X(index, cond, tstmt, fstmt)                            \
-  cond, kExprIf, static_cast<byte>(index), tstmt, kExprElse, fstmt, kExprEnd
+#define WASM_IF_ELSE_X(index, cond, tstmt, fstmt) \
+  cond, kExprIf, static_cast<uint8_t>(index), tstmt, kExprElse, fstmt, kExprEnd
 
 #define WASM_TRY_T(t, trystmt) \
-  kExprTry, static_cast<byte>((t).value_type_code()), trystmt, kExprEnd
-#define WASM_TRY_CATCH_T(t, trystmt, catchstmt, except)                    \
-  kExprTry, static_cast<byte>((t).value_type_code()), trystmt, kExprCatch, \
+  kExprTry, static_cast<uint8_t>((t).value_type_code()), trystmt, kExprEnd
+#define WASM_TRY_CATCH_T(t, trystmt, catchstmt, except)                       \
+  kExprTry, static_cast<uint8_t>((t).value_type_code()), trystmt, kExprCatch, \
       except, catchstmt, kExprEnd
-#define WASM_TRY_CATCH_CATCH_T(t, trystmt, except1, catchstmt1, except2,   \
-                               catchstmt2)                                 \
-  kExprTry, static_cast<byte>((t).value_type_code()), trystmt, kExprCatch, \
+#define WASM_TRY_CATCH_CATCH_T(t, trystmt, except1, catchstmt1, except2,      \
+                               catchstmt2)                                    \
+  kExprTry, static_cast<uint8_t>((t).value_type_code()), trystmt, kExprCatch, \
       except1, catchstmt1, kExprCatch, except2, catchstmt2, kExprEnd
 #define WASM_TRY_CATCH_R(t, trystmt, catchstmt) \
   kExprTry, WASM_REF_TYPE(t), trystmt, kExprCatch, catchstmt, kExprEnd
-#define WASM_TRY_CATCH_ALL_T(t, trystmt, catchstmt)                           \
-  kExprTry, static_cast<byte>((t).value_type_code()), trystmt, kExprCatchAll, \
-      catchstmt, kExprEnd
+#define WASM_TRY_CATCH_ALL_T(t, trystmt, catchstmt)               \
+  kExprTry, static_cast<uint8_t>((t).value_type_code()), trystmt, \
+      kExprCatchAll, catchstmt, kExprEnd
 #define WASM_TRY_DELEGATE(trystmt, depth) \
   kExprTry, kVoidCode, trystmt, kExprDelegate, depth
-#define WASM_TRY_DELEGATE_T(t, trystmt, depth)                                \
-  kExprTry, static_cast<byte>((t).value_type_code()), trystmt, kExprDelegate, \
-      depth
+#define WASM_TRY_DELEGATE_T(t, trystmt, depth)                    \
+  kExprTry, static_cast<uint8_t>((t).value_type_code()), trystmt, \
+      kExprDelegate, depth
 
 #define WASM_SELECT(tval, fval, cond) tval, fval, cond, kExprSelect
 #define WASM_SELECT_I(tval, fval, cond) \
@@ -212,11 +215,11 @@
 #define WASM_SELECT_A(tval, fval, cond) \
   tval, fval, cond, kExprSelectWithType, U32V_1(1), kFuncRefCode
 
-#define WASM_BR(depth) kExprBr, static_cast<byte>(depth)
-#define WASM_BR_IF(depth, cond) cond, kExprBrIf, static_cast<byte>(depth)
+#define WASM_BR(depth) kExprBr, static_cast<uint8_t>(depth)
+#define WASM_BR_IF(depth, cond) cond, kExprBrIf, static_cast<uint8_t>(depth)
 #define WASM_BR_IFD(depth, val, cond) \
-  val, cond, kExprBrIf, static_cast<byte>(depth), kExprDrop
-#define WASM_CONTINUE(depth) kExprBr, static_cast<byte>(depth)
+  val, cond, kExprBrIf, static_cast<uint8_t>(depth), kExprDrop
+#define WASM_CONTINUE(depth) kExprBr, static_cast<uint8_t>(depth)
 #define WASM_UNREACHABLE kExprUnreachable
 #define WASM_RETURN(...) __VA_ARGS__, kExprReturn
 #define WASM_RETURN0 kExprReturn
@@ -224,7 +227,7 @@
 #define WASM_BR_TABLE(key, count, ...) \
   key, kExprBrTable, U32V_1(count), __VA_ARGS__
 
-#define WASM_THROW(index) kExprThrow, static_cast<byte>(index)
+#define WASM_THROW(index) kExprThrow, static_cast<uint8_t>(index)
 
 //------------------------------------------------------------------------------
 // Misc expressions.
@@ -319,240 +322,309 @@ inline uint16_t ExtractPrefixedOpcodeBytes(WasmOpcode opcode) {
 #define WASM_I32V(val) kExprI32Const, U32V_5(val)
 
 #define WASM_I32V_1(val) \
-  static_cast<byte>(CheckI32v((val), 1), kExprI32Const), U32V_1(val)
+  static_cast<uint8_t>(CheckI32v((val), 1), kExprI32Const), U32V_1(val)
 #define WASM_I32V_2(val) \
-  static_cast<byte>(CheckI32v((val), 2), kExprI32Const), U32V_2(val)
+  static_cast<uint8_t>(CheckI32v((val), 2), kExprI32Const), U32V_2(val)
 #define WASM_I32V_3(val) \
-  static_cast<byte>(CheckI32v((val), 3), kExprI32Const), U32V_3(val)
+  static_cast<uint8_t>(CheckI32v((val), 3), kExprI32Const), U32V_3(val)
 #define WASM_I32V_4(val) \
-  static_cast<byte>(CheckI32v((val), 4), kExprI32Const), U32V_4(val)
+  static_cast<uint8_t>(CheckI32v((val), 4), kExprI32Const), U32V_4(val)
 #define WASM_I32V_5(val) \
-  static_cast<byte>(CheckI32v((val), 5), kExprI32Const), U32V_5(val)
+  static_cast<uint8_t>(CheckI32v((val), 5), kExprI32Const), U32V_5(val)
 
 //------------------------------------------------------------------------------
 // Int64 Const operations
 //------------------------------------------------------------------------------
-#define WASM_I64V(val)                                                        \
-  kExprI64Const,                                                              \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),         \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 21) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 28) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 35) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 42) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 49) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 56) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 63) & MASK_7)
-
-#define WASM_I64V_1(val)                                                     \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 1), kExprI64Const), \
-      static_cast<byte>(static_cast<int64_t>(val) & MASK_7)
-#define WASM_I64V_2(val)                                                     \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 2), kExprI64Const), \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),        \
-      static_cast<byte>((static_cast<int64_t>(val) >> 7) & MASK_7)
-#define WASM_I64V_3(val)                                                     \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 3), kExprI64Const), \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),        \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 14) & MASK_7)
-#define WASM_I64V_4(val)                                                      \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 4), kExprI64Const),  \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),         \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 21) & MASK_7)
-#define WASM_I64V_5(val)                                                      \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 5), kExprI64Const),  \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),         \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 21) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 28) & MASK_7)
-#define WASM_I64V_6(val)                                                      \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 6), kExprI64Const),  \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),         \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 21) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 28) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 35) & MASK_7)
-#define WASM_I64V_7(val)                                                      \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 7), kExprI64Const),  \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),         \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 21) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 28) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 35) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 42) & MASK_7)
-#define WASM_I64V_8(val)                                                      \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 8), kExprI64Const),  \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),         \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 21) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 28) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 35) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 42) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 49) & MASK_7)
-#define WASM_I64V_9(val)                                                      \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 9), kExprI64Const),  \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),         \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 21) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 28) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 35) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 42) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 49) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 56) & MASK_7)
-#define WASM_I64V_10(val)                                                     \
-  static_cast<byte>(CheckI64v(static_cast<int64_t>(val), 10), kExprI64Const), \
-      static_cast<byte>((static_cast<int64_t>(val) & MASK_7) | 0x80),         \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 7) & MASK_7) | 0x80),  \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 14) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 21) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 28) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 35) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 42) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 49) & MASK_7) | 0x80), \
-      static_cast<byte>(((static_cast<int64_t>(val) >> 56) & MASK_7) | 0x80), \
-      static_cast<byte>((static_cast<int64_t>(val) >> 63) & MASK_7)
-
-#define WASM_F32(val)                                                        \
-  kExprF32Const,                                                             \
-      static_cast<byte>(base::bit_cast<int32_t>(static_cast<float>(val))),   \
-      static_cast<byte>(base::bit_cast<uint32_t>(static_cast<float>(val)) >> \
-                        8),                                                  \
-      static_cast<byte>(base::bit_cast<uint32_t>(static_cast<float>(val)) >> \
-                        16),                                                 \
-      static_cast<byte>(base::bit_cast<uint32_t>(static_cast<float>(val)) >> \
-                        24)
-#define WASM_F64(val)                                                         \
-  kExprF64Const,                                                              \
-      static_cast<byte>(base::bit_cast<uint64_t>(static_cast<double>(val))),  \
-      static_cast<byte>(base::bit_cast<uint64_t>(static_cast<double>(val)) >> \
-                        8),                                                   \
-      static_cast<byte>(base::bit_cast<uint64_t>(static_cast<double>(val)) >> \
-                        16),                                                  \
-      static_cast<byte>(base::bit_cast<uint64_t>(static_cast<double>(val)) >> \
-                        24),                                                  \
-      static_cast<byte>(base::bit_cast<uint64_t>(static_cast<double>(val)) >> \
-                        32),                                                  \
-      static_cast<byte>(base::bit_cast<uint64_t>(static_cast<double>(val)) >> \
-                        40),                                                  \
-      static_cast<byte>(base::bit_cast<uint64_t>(static_cast<double>(val)) >> \
-                        48),                                                  \
-      static_cast<byte>(base::bit_cast<uint64_t>(static_cast<double>(val)) >> \
-                        56)
-
-#define WASM_LOCAL_GET(index) kExprLocalGet, static_cast<byte>(index)
-#define WASM_LOCAL_SET(index, val) val, kExprLocalSet, static_cast<byte>(index)
-#define WASM_LOCAL_TEE(index, val) val, kExprLocalTee, static_cast<byte>(index)
+#define WASM_I64V(val)                                                    \
+  kExprI64Const,                                                          \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) |  \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 14) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 21) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 28) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 35) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 42) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 49) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 56) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 63) & MASK_7)
+
+#define WASM_I64V_1(val)                                        \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 1), \
+                       kExprI64Const),                          \
+      static_cast<uint8_t>(static_cast<int64_t>(val) & MASK_7)
+#define WASM_I64V_2(val)                                                 \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 2),          \
+                       kExprI64Const),                                   \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80), \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 7) & MASK_7)
+#define WASM_I64V_3(val)                                                 \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 3),          \
+                       kExprI64Const),                                   \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80), \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) | \
+                           0x80),                                        \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 14) & MASK_7)
+#define WASM_I64V_4(val)                                                  \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 4),           \
+                       kExprI64Const),                                    \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) |  \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 14) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 21) & MASK_7)
+#define WASM_I64V_5(val)                                                  \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 5),           \
+                       kExprI64Const),                                    \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) |  \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 14) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 21) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 28) & MASK_7)
+#define WASM_I64V_6(val)                                                  \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 6),           \
+                       kExprI64Const),                                    \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) |  \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 14) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 21) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 28) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 35) & MASK_7)
+#define WASM_I64V_7(val)                                                  \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 7),           \
+                       kExprI64Const),                                    \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) |  \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 14) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 21) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 28) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 35) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 42) & MASK_7)
+#define WASM_I64V_8(val)                                                  \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 8),           \
+                       kExprI64Const),                                    \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) |  \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 14) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 21) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 28) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 35) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 42) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 49) & MASK_7)
+#define WASM_I64V_9(val)                                                  \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 9),           \
+                       kExprI64Const),                                    \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) |  \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 14) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 21) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 28) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 35) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 42) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 49) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 56) & MASK_7)
+#define WASM_I64V_10(val)                                                 \
+  static_cast<uint8_t>(CheckI64v(static_cast<int64_t>(val), 10),          \
+                       kExprI64Const),                                    \
+      static_cast<uint8_t>((static_cast<int64_t>(val) & MASK_7) | 0x80),  \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 7) & MASK_7) |  \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 14) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 21) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 28) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 35) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 42) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 49) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>(((static_cast<int64_t>(val) >> 56) & MASK_7) | \
+                           0x80),                                         \
+      static_cast<uint8_t>((static_cast<int64_t>(val) >> 63) & MASK_7)
+
+#define WASM_F32(val)                                                         \
+  kExprF32Const,                                                              \
+      static_cast<uint8_t>(base::bit_cast<int32_t>(static_cast<float>(val))), \
+      static_cast<uint8_t>(                                                   \
+          base::bit_cast<uint32_t>(static_cast<float>(val)) >> 8),            \
+      static_cast<uint8_t>(                                                   \
+          base::bit_cast<uint32_t>(static_cast<float>(val)) >> 16),           \
+      static_cast<uint8_t>(                                                   \
+          base::bit_cast<uint32_t>(static_cast<float>(val)) >> 24)
+#define WASM_F64(val)                                                \
+  kExprF64Const,                                                     \
+      static_cast<uint8_t>(                                          \
+          base::bit_cast<uint64_t>(static_cast<double>(val))),       \
+      static_cast<uint8_t>(                                          \
+          base::bit_cast<uint64_t>(static_cast<double>(val)) >> 8),  \
+      static_cast<uint8_t>(                                          \
+          base::bit_cast<uint64_t>(static_cast<double>(val)) >> 16), \
+      static_cast<uint8_t>(                                          \
+          base::bit_cast<uint64_t>(static_cast<double>(val)) >> 24), \
+      static_cast<uint8_t>(                                          \
+          base::bit_cast<uint64_t>(static_cast<double>(val)) >> 32), \
+      static_cast<uint8_t>(                                          \
+          base::bit_cast<uint64_t>(static_cast<double>(val)) >> 40), \
+      static_cast<uint8_t>(                                          \
+          base::bit_cast<uint64_t>(static_cast<double>(val)) >> 48), \
+      static_cast<uint8_t>(                                          \
+          base::bit_cast<uint64_t>(static_cast<double>(val)) >> 56)
+
+#define WASM_LOCAL_GET(index) kExprLocalGet, static_cast<uint8_t>(index)
+#define WASM_LOCAL_SET(index, val) \
+  val, kExprLocalSet, static_cast<uint8_t>(index)
+#define WASM_LOCAL_TEE(index, val) \
+  val, kExprLocalTee, static_cast<uint8_t>(index)
 #define WASM_DROP kExprDrop
-#define WASM_GLOBAL_GET(index) kExprGlobalGet, static_cast<byte>(index)
+#define WASM_GLOBAL_GET(index) kExprGlobalGet, static_cast<uint8_t>(index)
 #define WASM_GLOBAL_SET(index, val) \
-  val, kExprGlobalSet, static_cast<byte>(index)
+  val, kExprGlobalSet, static_cast<uint8_t>(index)
 #define WASM_TABLE_GET(table_index, index) \
-  index, kExprTableGet, static_cast<byte>(table_index)
+  index, kExprTableGet, static_cast<uint8_t>(table_index)
 #define WASM_TABLE_SET(table_index, index, val) \
-  index, val, kExprTableSet, static_cast<byte>(table_index)
-#define WASM_LOAD_MEM(type, index)                                           \
-  index,                                                                     \
-      static_cast<byte>(v8::internal::wasm::LoadStoreOpcodeOf(type, false)), \
+  index, val, kExprTableSet, static_cast<uint8_t>(table_index)
+#define WASM_LOAD_MEM(type, index)                             \
+  index,                                                       \
+      static_cast<uint8_t>(                                    \
+          v8::internal::wasm::LoadStoreOpcodeOf(type, false)), \
       ZERO_ALIGNMENT, ZERO_OFFSET
-#define WASM_STORE_MEM(type, index, val)                                    \
-  index, val,                                                               \
-      static_cast<byte>(v8::internal::wasm::LoadStoreOpcodeOf(type, true)), \
+#define WASM_STORE_MEM(type, index, val)                                       \
+  index, val,                                                                  \
+      static_cast<uint8_t>(v8::internal::wasm::LoadStoreOpcodeOf(type, true)), \
       ZERO_ALIGNMENT, ZERO_OFFSET
-#define WASM_LOAD_MEM_OFFSET(type, offset, index)                            \
-  index,                                                                     \
-      static_cast<byte>(v8::internal::wasm::LoadStoreOpcodeOf(type, false)), \
+#define WASM_LOAD_MEM_OFFSET(type, offset, index)              \
+  index,                                                       \
+      static_cast<uint8_t>(                                    \
+          v8::internal::wasm::LoadStoreOpcodeOf(type, false)), \
       ZERO_ALIGNMENT, offset
-#define WASM_STORE_MEM_OFFSET(type, offset, index, val)                     \
-  index, val,                                                               \
-      static_cast<byte>(v8::internal::wasm::LoadStoreOpcodeOf(type, true)), \
+#define WASM_STORE_MEM_OFFSET(type, offset, index, val)                        \
+  index, val,                                                                  \
+      static_cast<uint8_t>(v8::internal::wasm::LoadStoreOpcodeOf(type, true)), \
       ZERO_ALIGNMENT, offset
-#define WASM_LOAD_MEM_ALIGNMENT(type, index, alignment)                      \
-  index,                                                                     \
-      static_cast<byte>(v8::internal::wasm::LoadStoreOpcodeOf(type, false)), \
+#define WASM_LOAD_MEM_ALIGNMENT(type, index, alignment)        \
+  index,                                                       \
+      static_cast<uint8_t>(                                    \
+          v8::internal::wasm::LoadStoreOpcodeOf(type, false)), \
       alignment, ZERO_OFFSET
-#define WASM_STORE_MEM_ALIGNMENT(type, index, alignment, val)               \
-  index, val,                                                               \
-      static_cast<byte>(v8::internal::wasm::LoadStoreOpcodeOf(type, true)), \
+#define WASM_STORE_MEM_ALIGNMENT(type, index, alignment, val)                  \
+  index, val,                                                                  \
+      static_cast<uint8_t>(v8::internal::wasm::LoadStoreOpcodeOf(type, true)), \
       alignment, ZERO_OFFSET
-#define WASM_RETHROW(index) kExprRethrow, static_cast<byte>(index)
+#define WASM_RETHROW(index) kExprRethrow, static_cast<uint8_t>(index)
 
-#define WASM_CALL_FUNCTION0(index) kExprCallFunction, static_cast<byte>(index)
+#define WASM_CALL_FUNCTION0(index) \
+  kExprCallFunction, static_cast<uint8_t>(index)
 #define WASM_CALL_FUNCTION(index, ...) \
-  __VA_ARGS__, kExprCallFunction, static_cast<byte>(index)
+  __VA_ARGS__, kExprCallFunction, static_cast<uint8_t>(index)
 
 #define WASM_RETURN_CALL_FUNCTION0(index) \
-  kExprReturnCall, static_cast<byte>(index)
+  kExprReturnCall, static_cast<uint8_t>(index)
 #define WASM_RETURN_CALL_FUNCTION(index, ...) \
-  __VA_ARGS__, kExprReturnCall, static_cast<byte>(index)
+  __VA_ARGS__, kExprReturnCall, static_cast<uint8_t>(index)
 
 #define TABLE_ZERO 0
 
 //------------------------------------------------------------------------------
 // Heap-allocated object operations.
 //------------------------------------------------------------------------------
-#define WASM_GC_OP(op) kGCPrefix, static_cast<byte>(op)
+#define WASM_GC_OP(op) kGCPrefix, static_cast<uint8_t>(op)
 #define WASM_STRUCT_NEW(index, ...) \
-  __VA_ARGS__, WASM_GC_OP(kExprStructNew), static_cast<byte>(index)
+  __VA_ARGS__, WASM_GC_OP(kExprStructNew), static_cast<uint8_t>(index)
 #define WASM_STRUCT_NEW_DEFAULT(index) \
-  WASM_GC_OP(kExprStructNewDefault), static_cast<byte>(index)
-#define WASM_STRUCT_GET(typeidx, fieldidx, struct_obj)                \
-  struct_obj, WASM_GC_OP(kExprStructGet), static_cast<byte>(typeidx), \
-      static_cast<byte>(fieldidx)
-#define WASM_STRUCT_GET_S(typeidx, fieldidx, struct_obj)               \
-  struct_obj, WASM_GC_OP(kExprStructGetS), static_cast<byte>(typeidx), \
-      static_cast<byte>(fieldidx)
-#define WASM_STRUCT_GET_U(typeidx, fieldidx, struct_obj)               \
-  struct_obj, WASM_GC_OP(kExprStructGetU), static_cast<byte>(typeidx), \
-      static_cast<byte>(fieldidx)
-#define WASM_STRUCT_SET(typeidx, fieldidx, struct_obj, value)                \
-  struct_obj, value, WASM_GC_OP(kExprStructSet), static_cast<byte>(typeidx), \
-      static_cast<byte>(fieldidx)
+  WASM_GC_OP(kExprStructNewDefault), static_cast<uint8_t>(index)
+#define WASM_STRUCT_GET(typeidx, fieldidx, struct_obj)                   \
+  struct_obj, WASM_GC_OP(kExprStructGet), static_cast<uint8_t>(typeidx), \
+      static_cast<uint8_t>(fieldidx)
+#define WASM_STRUCT_GET_S(typeidx, fieldidx, struct_obj)                  \
+  struct_obj, WASM_GC_OP(kExprStructGetS), static_cast<uint8_t>(typeidx), \
+      static_cast<uint8_t>(fieldidx)
+#define WASM_STRUCT_GET_U(typeidx, fieldidx, struct_obj)                  \
+  struct_obj, WASM_GC_OP(kExprStructGetU), static_cast<uint8_t>(typeidx), \
+      static_cast<uint8_t>(fieldidx)
+#define WASM_STRUCT_SET(typeidx, fieldidx, struct_obj, value) \
+  struct_obj, value, WASM_GC_OP(kExprStructSet),              \
+      static_cast<uint8_t>(typeidx), static_cast<uint8_t>(fieldidx)
 #define WASM_REF_NULL(type_encoding) kExprRefNull, type_encoding
 #define WASM_REF_FUNC(index) kExprRefFunc, index
 #define WASM_REF_IS_NULL(val) val, kExprRefIsNull
 #define WASM_REF_AS_NON_NULL(val) val, kExprRefAsNonNull
 #define WASM_REF_EQ(lhs, rhs) lhs, rhs, kExprRefEq
 #define WASM_REF_TEST_DEPRECATED(ref, typeidx) \
-  ref, WASM_GC_OP(kExprRefTestDeprecated), static_cast<byte>(typeidx)
+  ref, WASM_GC_OP(kExprRefTestDeprecated), static_cast<uint8_t>(typeidx)
 #define WASM_REF_TEST(ref, typeidx) \
-  ref, WASM_GC_OP(kExprRefTest), static_cast<byte>(typeidx)
+  ref, WASM_GC_OP(kExprRefTest), static_cast<uint8_t>(typeidx)
 #define WASM_REF_TEST_NULL(ref, typeidx) \
-  ref, WASM_GC_OP(kExprRefTestNull), static_cast<byte>(typeidx)
+  ref, WASM_GC_OP(kExprRefTestNull), static_cast<uint8_t>(typeidx)
 #define WASM_REF_CAST_DEPRECATED(ref, typeidx) \
-  ref, WASM_GC_OP(kExprRefCastDeprecated), static_cast<byte>(typeidx)
+  ref, WASM_GC_OP(kExprRefCastDeprecated), static_cast<uint8_t>(typeidx)
 #define WASM_REF_CAST(ref, typeidx) \
-  ref, WASM_GC_OP(kExprRefCast), static_cast<byte>(typeidx)
+  ref, WASM_GC_OP(kExprRefCast), static_cast<uint8_t>(typeidx)
 #define WASM_REF_CAST_NULL(ref, typeidx) \
-  ref, WASM_GC_OP(kExprRefCastNull), static_cast<byte>(typeidx)
+  ref, WASM_GC_OP(kExprRefCastNull), static_cast<uint8_t>(typeidx)
 // Takes a reference value from the value stack to allow sequences of
 // conditional branches.
-#define WASM_BR_ON_CAST(depth, typeidx)                \
-  WASM_GC_OP(kExprBrOnCast), static_cast<byte>(depth), \
-      static_cast<byte>(typeidx)
-#define WASM_BR_ON_CAST_NULL(depth, typeidx)               \
-  WASM_GC_OP(kExprBrOnCastNull), static_cast<byte>(depth), \
-      static_cast<byte>(typeidx)
-#define WASM_BR_ON_CAST_DEPRECATED(depth, typeidx)               \
-  WASM_GC_OP(kExprBrOnCastDeprecated), static_cast<byte>(depth), \
-      static_cast<byte>(typeidx)
-#define WASM_BR_ON_CAST_FAIL(depth, typeidx)               \
-  WASM_GC_OP(kExprBrOnCastFail), static_cast<byte>(depth), \
-      static_cast<byte>(typeidx)
-#define WASM_BR_ON_CAST_FAIL_NULL(depth, typeidx)              \
-  WASM_GC_OP(kExprBrOnCastFailNull), static_cast<byte>(depth), \
-      static_cast<byte>(typeidx)
-#define WASM_BR_ON_CAST_FAIL_DEPRECATED(depth, typeidx)              \
-  WASM_GC_OP(kExprBrOnCastFailDeprecated), static_cast<byte>(depth), \
-      static_cast<byte>(typeidx)
+#define WASM_BR_ON_CAST(depth, sourcetype, targettype)               \
+  WASM_GC_OP(kExprBrOnCastGeneric),                                  \
+      static_cast<uint8_t>(0b01), /*source is nullable*/             \
+      static_cast<uint8_t>(depth), static_cast<uint8_t>(sourcetype), \
+      static_cast<uint8_t>(targettype)
+#define WASM_BR_ON_CAST_NULL(depth, sourcetype, targettype)          \
+  WASM_GC_OP(kExprBrOnCastGeneric),                                  \
+      static_cast<uint8_t>(0b11) /*source & target nullable*/,       \
+      static_cast<uint8_t>(depth), static_cast<uint8_t>(sourcetype), \
+      static_cast<uint8_t>(targettype)
+#define WASM_BR_ON_CAST_DEPRECATED(depth, typeidx)                  \
+  WASM_GC_OP(kExprBrOnCastDeprecated), static_cast<uint8_t>(depth), \
+      static_cast<uint8_t>(typeidx)
+#define WASM_BR_ON_CAST_FAIL(depth, sourcetype, targettype)          \
+  WASM_GC_OP(kExprBrOnCastFailGeneric),                              \
+      static_cast<uint8_t>(0b01), /*source is nullable*/             \
+      static_cast<uint8_t>(depth), static_cast<uint8_t>(sourcetype), \
+      static_cast<uint8_t>(targettype)
+#define WASM_BR_ON_CAST_FAIL_NULL(depth, sourcetype, targettype)     \
+  WASM_GC_OP(kExprBrOnCastFailGeneric),                              \
+      static_cast<uint8_t>(0b11), /*source, target nullable*/        \
+      static_cast<uint8_t>(depth), static_cast<uint8_t>(sourcetype), \
+      static_cast<uint8_t>(targettype)
+#define WASM_BR_ON_CAST_FAIL_DEPRECATED(depth, typeidx)                 \
+  WASM_GC_OP(kExprBrOnCastFailDeprecated), static_cast<uint8_t>(depth), \
+      static_cast<uint8_t>(typeidx)
 
 #define WASM_GC_INTERNALIZE(extern) extern, WASM_GC_OP(kExprExternInternalize)
 #define WASM_GC_EXTERNALIZE(ref) ref, WASM_GC_OP(kExprExternExternalize)
@@ -564,57 +636,59 @@ inline uint16_t ExtractPrefixedOpcodeBytes(WasmOpcode opcode) {
 #define WASM_REF_AS_ARRAY(ref) ref, WASM_GC_OP(kExprRefAsArray)
 #define WASM_REF_AS_I31(ref) ref, WASM_GC_OP(kExprRefAsI31)
 #define WASM_BR_ON_ARRAY(depth) \
-  WASM_GC_OP(kExprBrOnArray), static_cast<byte>(depth)
+  WASM_GC_OP(kExprBrOnArray), static_cast<uint8_t>(depth)
 #define WASM_BR_ON_STRUCT(depth) \
-  WASM_GC_OP(kExprBrOnStruct), static_cast<byte>(depth)
-#define WASM_BR_ON_I31(depth) WASM_GC_OP(kExprBrOnI31), static_cast<byte>(depth)
+  WASM_GC_OP(kExprBrOnStruct), static_cast<uint8_t>(depth)
+#define WASM_BR_ON_I31(depth) \
+  WASM_GC_OP(kExprBrOnI31), static_cast<uint8_t>(depth)
 #define WASM_BR_ON_NON_ARRAY(depth) \
-  WASM_GC_OP(kExprBrOnNonArray), static_cast<byte>(depth)
+  WASM_GC_OP(kExprBrOnNonArray), static_cast<uint8_t>(depth)
 #define WASM_BR_ON_NON_STRUCT(depth) \
-  WASM_GC_OP(kExprBrOnNonStruct), static_cast<byte>(depth)
+  WASM_GC_OP(kExprBrOnNonStruct), static_cast<uint8_t>(depth)
 #define WASM_BR_ON_NON_I31(depth) \
-  WASM_GC_OP(kExprBrOnNonI31), static_cast<byte>(depth)
+  WASM_GC_OP(kExprBrOnNonI31), static_cast<uint8_t>(depth)
 
 #define WASM_ARRAY_NEW(index, default_value, length) \
-  default_value, length, WASM_GC_OP(kExprArrayNew), static_cast<byte>(index)
+  default_value, length, WASM_GC_OP(kExprArrayNew), static_cast<uint8_t>(index)
 #define WASM_ARRAY_NEW_DEFAULT(index, length) \
-  length, WASM_GC_OP(kExprArrayNewDefault), static_cast<byte>(index)
+  length, WASM_GC_OP(kExprArrayNewDefault), static_cast<uint8_t>(index)
 #define WASM_ARRAY_GET(typeidx, array, index) \
-  array, index, WASM_GC_OP(kExprArrayGet), static_cast<byte>(typeidx)
+  array, index, WASM_GC_OP(kExprArrayGet), static_cast<uint8_t>(typeidx)
 #define WASM_ARRAY_GET_U(typeidx, array, index) \
-  array, index, WASM_GC_OP(kExprArrayGetU), static_cast<byte>(typeidx)
+  array, index, WASM_GC_OP(kExprArrayGetU), static_cast<uint8_t>(typeidx)
 #define WASM_ARRAY_GET_S(typeidx, array, index) \
-  array, index, WASM_GC_OP(kExprArrayGetS), static_cast<byte>(typeidx)
+  array, index, WASM_GC_OP(kExprArrayGetS), static_cast<uint8_t>(typeidx)
 #define WASM_ARRAY_SET(typeidx, array, index, value) \
-  array, index, value, WASM_GC_OP(kExprArraySet), static_cast<byte>(typeidx)
+  array, index, value, WASM_GC_OP(kExprArraySet), static_cast<uint8_t>(typeidx)
 #define WASM_ARRAY_LEN(array) array, WASM_GC_OP(kExprArrayLen)
 #define WASM_ARRAY_COPY(dst_idx, src_idx, dst_array, dst_index, src_array, \
                         src_index, length)                                 \
   dst_array, dst_index, src_array, src_index, length,                      \
-      WASM_GC_OP(kExprArrayCopy), static_cast<byte>(dst_idx),              \
-      static_cast<byte>(src_idx)
-#define WASM_ARRAY_NEW_FIXED(index, length, ...)                         \
-  __VA_ARGS__, WASM_GC_OP(kExprArrayNewFixed), static_cast<byte>(index), \
-      static_cast<byte>(length)
+      WASM_GC_OP(kExprArrayCopy), static_cast<uint8_t>(dst_idx),           \
+      static_cast<uint8_t>(src_idx)
+#define WASM_ARRAY_NEW_FIXED(index, length, ...)                            \
+  __VA_ARGS__, WASM_GC_OP(kExprArrayNewFixed), static_cast<uint8_t>(index), \
+      static_cast<uint8_t>(length)
 
 #define WASM_I31_NEW(val) val, WASM_GC_OP(kExprI31New)
 #define WASM_I31_GET_S(val) val, WASM_GC_OP(kExprI31GetS)
 #define WASM_I31_GET_U(val) val, WASM_GC_OP(kExprI31GetU)
 
 #define WASM_BR_ON_NULL(depth, ref_object) \
-  ref_object, kExprBrOnNull, static_cast<byte>(depth)
+  ref_object, kExprBrOnNull, static_cast<uint8_t>(depth)
 
 #define WASM_BR_ON_NON_NULL(depth, ref_object) \
-  ref_object, kExprBrOnNonNull, static_cast<byte>(depth)
+  ref_object, kExprBrOnNonNull, static_cast<uint8_t>(depth)
 
 // Pass: sig_index, ...args, func_index
 #define WASM_CALL_INDIRECT(sig_index, ...) \
-  __VA_ARGS__, kExprCallIndirect, static_cast<byte>(sig_index), TABLE_ZERO
-#define WASM_CALL_INDIRECT_TABLE(table, sig_index, ...)         \
-  __VA_ARGS__, kExprCallIndirect, static_cast<byte>(sig_index), \
-      static_cast<byte>(table)
-#define WASM_RETURN_CALL_INDIRECT(sig_index, ...) \
-  __VA_ARGS__, kExprReturnCallIndirect, static_cast<byte>(sig_index), TABLE_ZERO
+  __VA_ARGS__, kExprCallIndirect, static_cast<uint8_t>(sig_index), TABLE_ZERO
+#define WASM_CALL_INDIRECT_TABLE(table, sig_index, ...)            \
+  __VA_ARGS__, kExprCallIndirect, static_cast<uint8_t>(sig_index), \
+      static_cast<uint8_t>(table)
+#define WASM_RETURN_CALL_INDIRECT(sig_index, ...)                        \
+  __VA_ARGS__, kExprReturnCallIndirect, static_cast<uint8_t>(sig_index), \
+      TABLE_ZERO
 
 #define WASM_CALL_REF(func_ref, sig_index, ...) \
   __VA_ARGS__, func_ref, kExprCallRef, sig_index
@@ -631,19 +705,19 @@ inline uint16_t ExtractPrefixedOpcodeBytes(WasmOpcode opcode) {
 #define WASM_WHILE(x, y)                                                      \
   kExprLoop, kVoidCode, x, kExprIf, kVoidCode, y, kExprBr, DEPTH_1, kExprEnd, \
       kExprEnd
-#define WASM_INC_LOCAL(index)                                             \
-  kExprLocalGet, static_cast<byte>(index), kExprI32Const, 1, kExprI32Add, \
-      kExprLocalTee, static_cast<byte>(index)
-#define WASM_INC_LOCAL_BYV(index, count)                    \
-  kExprLocalGet, static_cast<byte>(index), kExprI32Const,   \
-      static_cast<byte>(count), kExprI32Add, kExprLocalTee, \
-      static_cast<byte>(index)
-#define WASM_INC_LOCAL_BY(index, count)                     \
-  kExprLocalGet, static_cast<byte>(index), kExprI32Const,   \
-      static_cast<byte>(count), kExprI32Add, kExprLocalSet, \
-      static_cast<byte>(index)
-#define WASM_UNOP(opcode, x) x, static_cast<byte>(opcode)
-#define WASM_BINOP(opcode, x, y) x, y, static_cast<byte>(opcode)
+#define WASM_INC_LOCAL(index)                                                \
+  kExprLocalGet, static_cast<uint8_t>(index), kExprI32Const, 1, kExprI32Add, \
+      kExprLocalTee, static_cast<uint8_t>(index)
+#define WASM_INC_LOCAL_BYV(index, count)                       \
+  kExprLocalGet, static_cast<uint8_t>(index), kExprI32Const,   \
+      static_cast<uint8_t>(count), kExprI32Add, kExprLocalTee, \
+      static_cast<uint8_t>(index)
+#define WASM_INC_LOCAL_BY(index, count)                        \
+  kExprLocalGet, static_cast<uint8_t>(index), kExprI32Const,   \
+      static_cast<uint8_t>(count), kExprI32Add, kExprLocalSet, \
+      static_cast<uint8_t>(index)
+#define WASM_UNOP(opcode, x) x, static_cast<uint8_t>(opcode)
+#define WASM_BINOP(opcode, x, y) x, y, static_cast<uint8_t>(opcode)
 
 //------------------------------------------------------------------------------
 // Int32 operations
@@ -799,7 +873,7 @@ inline uint16_t ExtractPrefixedOpcodeBytes(WasmOpcode opcode) {
 //------------------------------------------------------------------------------
 // Numeric operations
 //------------------------------------------------------------------------------
-#define WASM_NUMERIC_OP(op) kNumericPrefix, static_cast<byte>(op)
+#define WASM_NUMERIC_OP(op) kNumericPrefix, static_cast<uint8_t>(op)
 #define WASM_I32_SCONVERT_SAT_F32(x) x, WASM_NUMERIC_OP(kExprI32SConvertSatF32)
 #define WASM_I32_UCONVERT_SAT_F32(x) x, WASM_NUMERIC_OP(kExprI32UConvertSatF32)
 #define WASM_I32_SCONVERT_SAT_F64(x) x, WASM_NUMERIC_OP(kExprI32SConvertSatF64)
@@ -820,18 +894,19 @@ inline uint16_t ExtractPrefixedOpcodeBytes(WasmOpcode opcode) {
   dst, val, size, WASM_NUMERIC_OP(kExprMemoryFill), MEMORY_ZERO
 #define WASM_TABLE_INIT(table, seg, dst, src, size)             \
   dst, src, size, WASM_NUMERIC_OP(kExprTableInit), U32V_1(seg), \
-      static_cast<byte>(table)
+      static_cast<uint8_t>(table)
 #define WASM_ELEM_DROP(seg) WASM_NUMERIC_OP(kExprElemDrop), U32V_1(seg)
 #define WASM_TABLE_COPY(table_dst, table_src, dst, src, size) \
   dst, src, size, WASM_NUMERIC_OP(kExprTableCopy),            \
-      static_cast<byte>(table_dst), static_cast<byte>(table_src)
+      static_cast<uint8_t>(table_dst), static_cast<uint8_t>(table_src)
 #define WASM_TABLE_GROW(table, initial_value, delta)     \
   initial_value, delta, WASM_NUMERIC_OP(kExprTableGrow), \
-      static_cast<byte>(table)
+      static_cast<uint8_t>(table)
 #define WASM_TABLE_SIZE(table) \
-  WASM_NUMERIC_OP(kExprTableSize), static_cast<byte>(table)
-#define WASM_TABLE_FILL(table, times, value, start) \
-  times, value, start, WASM_NUMERIC_OP(kExprTableFill), static_cast<byte>(table)
+  WASM_NUMERIC_OP(kExprTableSize), static_cast<uint8_t>(table)
+#define WASM_TABLE_FILL(table, times, value, start)     \
+  times, value, start, WASM_NUMERIC_OP(kExprTableFill), \
+      static_cast<uint8_t>(table)
 
 //------------------------------------------------------------------------------
 // Memory Operations.
@@ -860,28 +935,28 @@ inline uint16_t ExtractPrefixedOpcodeBytes(WasmOpcode opcode) {
 #define SIZEOF_SIG_ENTRY_xx_xx 7
 #define SIZEOF_SIG_ENTRY_x_xxx 7
 
-#define WASM_BRV(depth, ...) __VA_ARGS__, kExprBr, static_cast<byte>(depth)
+#define WASM_BRV(depth, ...) __VA_ARGS__, kExprBr, static_cast<uint8_t>(depth)
 #define WASM_BRV_IF(depth, val, cond) \
-  val, cond, kExprBrIf, static_cast<byte>(depth)
+  val, cond, kExprBrIf, static_cast<uint8_t>(depth)
 #define WASM_BRV_IFD(depth, val, cond) \
-  val, cond, kExprBrIf, static_cast<byte>(depth), kExprDrop
+  val, cond, kExprBrIf, static_cast<uint8_t>(depth), kExprDrop
 
 //------------------------------------------------------------------------------
 // Atomic Operations.
 //------------------------------------------------------------------------------
-#define WASM_ATOMICS_OP(op) kAtomicPrefix, static_cast<byte>(op)
+#define WASM_ATOMICS_OP(op) kAtomicPrefix, static_cast<uint8_t>(op)
 #define WASM_ATOMICS_BINOP(op, x, y, representation) \
   x, y, WASM_ATOMICS_OP(op),                         \
-      static_cast<byte>(ElementSizeLog2Of(representation)), ZERO_OFFSET
+      static_cast<uint8_t>(ElementSizeLog2Of(representation)), ZERO_OFFSET
 #define WASM_ATOMICS_TERNARY_OP(op, x, y, z, representation) \
   x, y, z, WASM_ATOMICS_OP(op),                              \
-      static_cast<byte>(ElementSizeLog2Of(representation)), ZERO_OFFSET
+      static_cast<uint8_t>(ElementSizeLog2Of(representation)), ZERO_OFFSET
 #define WASM_ATOMICS_LOAD_OP(op, x, representation) \
   x, WASM_ATOMICS_OP(op),                           \
-      static_cast<byte>(ElementSizeLog2Of(representation)), ZERO_OFFSET
+      static_cast<uint8_t>(ElementSizeLog2Of(representation)), ZERO_OFFSET
 #define WASM_ATOMICS_STORE_OP(op, x, y, representation) \
   x, y, WASM_ATOMICS_OP(op),                            \
-      static_cast<byte>(ElementSizeLog2Of(representation)), ZERO_OFFSET
+      static_cast<uint8_t>(ElementSizeLog2Of(representation)), ZERO_OFFSET
 #define WASM_ATOMICS_WAIT(op, index, value, timeout, offset) \
   index, value, timeout, WASM_ATOMICS_OP(op), ZERO_ALIGNMENT, offset
 #define WASM_ATOMICS_FENCE WASM_ATOMICS_OP(kExprAtomicFence), ZERO_OFFSET
@@ -898,7 +973,7 @@ inline uint16_t ExtractPrefixedOpcodeBytes(WasmOpcode opcode) {
 //------------------------------------------------------------------------------
 // SIMD Operations.
 //------------------------------------------------------------------------------
-#define TO_BYTE(val) static_cast<byte>(val)
+#define TO_BYTE(val) static_cast<uint8_t>(val)
 // Encode all simd ops as a 2-byte LEB.
 #define WASM_SIMD_OP(op) kSimdPrefix, U32V_2(ExtractPrefixedOpcodeBytes(op))
 #define WASM_SIMD_OPN(op, ...) __VA_ARGS__, WASM_SIMD_OP(op)
diff --git a/deps/v8/test/common/wasm/wasm-module-runner.cc b/deps/v8/test/common/wasm/wasm-module-runner.cc
index bab0241c70b4ae..0c5e3fa08110f2 100644
--- a/deps/v8/test/common/wasm/wasm-module-runner.cc
+++ b/deps/v8/test/common/wasm/wasm-module-runner.cc
@@ -16,7 +16,6 @@
 #include "src/wasm/wasm-objects.h"
 #include "src/wasm/wasm-opcodes.h"
 #include "src/wasm/wasm-result.h"
-#include "test/common/wasm/wasm-interpreter.h"
 
 namespace v8 {
 namespace internal {
@@ -42,48 +41,6 @@ MaybeHandle<WasmInstanceObject> CompileAndInstantiateForTesting(
                                           module.ToHandleChecked(), {}, {});
 }
 
-base::OwnedVector<WasmValue> MakeDefaultInterpreterArguments(
-    Isolate* isolate, const FunctionSig* sig) {
-  size_t param_count = sig->parameter_count();
-  auto arguments = base::OwnedVector<WasmValue>::New(param_count);
-
-  for (size_t i = 0; i < param_count; ++i) {
-    switch (sig->GetParam(i).kind()) {
-      case kI32:
-        arguments[i] = WasmValue(static_cast<int32_t>(i));
-        break;
-      case kI64:
-        arguments[i] = WasmValue(static_cast<int64_t>(i));
-        break;
-      case kF32:
-        arguments[i] = WasmValue(static_cast<float>(i));
-        break;
-      case kF64:
-        arguments[i] = WasmValue(static_cast<double>(i));
-        break;
-      case kS128: {
-        uint8_t s128_bytes[sizeof(Simd128)] = {static_cast<uint8_t>(i)};
-        arguments[i] = WasmValue(Simd128{s128_bytes});
-        break;
-      }
-      case kRefNull:
-        arguments[i] =
-            WasmValue(Handle<Object>::cast(isolate->factory()->null_value()),
-                      sig->GetParam(i));
-        break;
-      case kRef:
-      case kRtt:
-      case kI8:
-      case kI16:
-      case kVoid:
-      case kBottom:
-        UNREACHABLE();
-    }
-  }
-
-  return arguments;
-}
-
 base::OwnedVector<Handle<Object>> MakeDefaultArguments(Isolate* isolate,
                                                        const FunctionSig* sig) {
   size_t param_count = sig->parameter_count();
@@ -120,8 +77,8 @@ base::OwnedVector<Handle<Object>> MakeDefaultArguments(Isolate* isolate,
   return arguments;
 }
 
-int32_t CompileAndRunWasmModule(Isolate* isolate, const byte* module_start,
-                                const byte* module_end) {
+int32_t CompileAndRunWasmModule(Isolate* isolate, const uint8_t* module_start,
+                                const uint8_t* module_end) {
   HandleScope scope(isolate);
   ErrorThrower thrower(isolate, "CompileAndRunWasmModule");
   MaybeHandle<WasmInstanceObject> instance = CompileAndInstantiateForTesting(
@@ -133,72 +90,6 @@ int32_t CompileAndRunWasmModule(Isolate* isolate, const byte* module_start,
                                     {});
 }
 
-WasmInterpretationResult InterpretWasmModule(
-    Isolate* isolate, Handle<WasmInstanceObject> instance,
-    int32_t function_index, WasmValue* args) {
-  // Don't execute more than 16k steps.
-  constexpr int kMaxNumSteps = 16 * 1024;
-
-  Zone zone(isolate->allocator(), ZONE_NAME);
-  v8::internal::HandleScope scope(isolate);
-  const WasmFunction* func = &instance->module()->functions[function_index];
-
-  CHECK(func->exported);
-  // This would normally be handled by export wrappers.
-  if (!IsJSCompatibleSignature(func->sig)) {
-    return WasmInterpretationResult::Trapped(false);
-  }
-
-  WasmInterpreter interpreter{
-      isolate, instance->module(),
-      ModuleWireBytes{instance->module_object().native_module()->wire_bytes()},
-      instance};
-  interpreter.InitFrame(func, args);
-  WasmInterpreter::State interpreter_result = interpreter.Run(kMaxNumSteps);
-
-  bool stack_overflow = isolate->has_pending_exception();
-  isolate->clear_pending_exception();
-
-  if (stack_overflow) return WasmInterpretationResult::Failed();
-
-  if (interpreter.state() == WasmInterpreter::TRAPPED) {
-    return WasmInterpretationResult::Trapped(
-        interpreter.PossibleNondeterminism());
-  }
-
-  if (interpreter_result == WasmInterpreter::FINISHED) {
-    // Get the result as an {int32_t}. Keep this in sync with
-    // {CallWasmFunctionForTesting}, because fuzzers will compare the results.
-    int32_t result = -1;
-    if (func->sig->return_count() > 0) {
-      WasmValue return_value = interpreter.GetReturnValue();
-      switch (func->sig->GetReturn(0).kind()) {
-        case kI32:
-          result = return_value.to<int32_t>();
-          break;
-        case kI64:
-          result = static_cast<int32_t>(return_value.to<int64_t>());
-          break;
-        case kF32:
-          result = static_cast<int32_t>(return_value.to<float>());
-          break;
-        case kF64:
-          result = static_cast<int32_t>(return_value.to<double>());
-          break;
-        default:
-          break;
-      }
-    }
-    return WasmInterpretationResult::Finished(
-        result, interpreter.PossibleNondeterminism());
-  }
-
-  // The interpreter did not finish within the limited number of steps, so it
-  // might execute an infinite loop or infinite recursion. Return "failed"
-  // status in that case.
-  return WasmInterpretationResult::Failed();
-}
-
 MaybeHandle<WasmExportedFunction> GetExportedFunction(
     Isolate* isolate, Handle<WasmInstanceObject> instance, const char* name) {
   Handle<JSObject> exports_object;
@@ -211,7 +102,7 @@ MaybeHandle<WasmExportedFunction> GetExportedFunction(
   Maybe<bool> property_found = JSReceiver::GetOwnPropertyDescriptor(
       isolate, exports_object, main_name, &desc);
   if (!property_found.FromMaybe(false)) return {};
-  if (!desc.value()->IsJSFunction()) return {};
+  if (!IsJSFunction(*desc.value())) return {};
 
   return Handle<WasmExportedFunction>::cast(desc.value());
 }
@@ -248,19 +139,19 @@ int32_t CallWasmFunctionForTesting(Isolate* isolate,
   Handle<Object> result = retval.ToHandleChecked();
 
   // Multi-value returns, get the first return value (see InterpretWasmModule).
-  if (result->IsJSArray()) {
+  if (IsJSArray(*result)) {
     auto receiver = Handle<JSReceiver>::cast(result);
     result = JSObject::GetElement(isolate, receiver, 0).ToHandleChecked();
   }
 
-  if (result->IsSmi()) {
+  if (IsSmi(*result)) {
     return Smi::ToInt(*result);
   }
-  if (result->IsHeapNumber()) {
-    return static_cast<int32_t>(HeapNumber::cast(*result).value());
+  if (IsHeapNumber(*result)) {
+    return static_cast<int32_t>(HeapNumber::cast(*result)->value());
   }
-  if (result->IsBigInt()) {
-    return static_cast<int32_t>(BigInt::cast(*result).AsInt64());
+  if (IsBigInt(*result)) {
+    return static_cast<int32_t>(BigInt::cast(*result)->AsInt64());
   }
   return -1;
 }
diff --git a/deps/v8/test/common/wasm/wasm-module-runner.h b/deps/v8/test/common/wasm/wasm-module-runner.h
index 00ddca519f15e1..c72571fc6ecb74 100644
--- a/deps/v8/test/common/wasm/wasm-module-runner.h
+++ b/deps/v8/test/common/wasm/wasm-module-runner.h
@@ -13,13 +13,6 @@
 
 namespace v8 {
 namespace internal {
-
-template <typename T>
-class Handle;
-
-template <typename T>
-class MaybeHandle;
-
 namespace wasm {
 namespace testing {
 
@@ -39,8 +32,8 @@ int32_t CallWasmFunctionForTesting(
 
 // Decode, verify, and run the function labeled "main" in the
 // given encoded module. The module should have no imports.
-int32_t CompileAndRunWasmModule(Isolate* isolate, const byte* module_start,
-                                const byte* module_end);
+int32_t CompileAndRunWasmModule(Isolate* isolate, const uint8_t* module_start,
+                                const uint8_t* module_end);
 
 // Decode and compile the given module with no imports.
 MaybeHandle<WasmModuleObject> CompileForTesting(Isolate* isolate,
@@ -51,61 +44,8 @@ MaybeHandle<WasmModuleObject> CompileForTesting(Isolate* isolate,
 MaybeHandle<WasmInstanceObject> CompileAndInstantiateForTesting(
     Isolate* isolate, ErrorThrower* thrower, ModuleWireBytes bytes);
 
-class WasmInterpretationResult {
- public:
-  static WasmInterpretationResult Failed() { return {kFailed, 0, false}; }
-  static WasmInterpretationResult Trapped(bool possible_nondeterminism) {
-    return {kTrapped, 0, possible_nondeterminism};
-  }
-  static WasmInterpretationResult Finished(int32_t result,
-                                           bool possible_nondeterminism) {
-    return {kFinished, result, possible_nondeterminism};
-  }
-
-  // {failed()} captures different reasons: The module was invalid, no function
-  // to call was found in the module, the function did not termine within a
-  // limited number of steps, or a stack overflow happened.
-  bool failed() const { return status_ == kFailed; }
-  bool trapped() const { return status_ == kTrapped; }
-  bool finished() const { return status_ == kFinished; }
-
-  int32_t result() const {
-    DCHECK_EQ(status_, kFinished);
-    return result_;
-  }
-
-  bool possible_nondeterminism() const { return possible_nondeterminism_; }
-
- private:
-  enum Status { kFinished, kTrapped, kFailed };
-
-  const Status status_;
-  const int32_t result_;
-  const bool possible_nondeterminism_;
-
-  WasmInterpretationResult(Status status, int32_t result,
-                           bool possible_nondeterminism)
-      : status_(status),
-        result_(result),
-        possible_nondeterminism_(possible_nondeterminism) {}
-};
-
-// Interprets the given module, starting at the function specified by
-// {function_index}. The return type of the function has to be int32. The module
-// should not have any imports or exports
-WasmInterpretationResult InterpretWasmModule(
-    Isolate* isolate, Handle<WasmInstanceObject> instance,
-    int32_t function_index, WasmValue* args);
-
-// Generate an array of default arguments for the given signature, to be used in
-// the interpreter.
-base::OwnedVector<WasmValue> MakeDefaultInterpreterArguments(
-    Isolate* isolate, const FunctionSig* sig);
-
 // Generate an array of default arguments for the given signature, to be used
-// when calling compiled code. Make sure that the arguments match the ones
-// returned by {MakeDefaultInterpreterArguments}, otherwise fuzzers will report
-// differences between interpreter and compiled code.
+// when calling compiled code.
 base::OwnedVector<Handle<Object>> MakeDefaultArguments(Isolate* isolate,
                                                        const FunctionSig* sig);
 
diff --git a/deps/v8/test/debugger/debug/debug-break-class-fields.js b/deps/v8/test/debugger/debug/debug-break-class-fields.js
index 5aba6df4a360de..72ec60014b565d 100644
--- a/deps/v8/test/debugger/debug/debug-break-class-fields.js
+++ b/deps/v8/test/debugger/debug/debug-break-class-fields.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --harmony-public-fields --harmony-static-fields --allow-natives-syntax
+// Flags: --allow-natives-syntax
 
 Debug = debug.Debug
 
diff --git a/deps/v8/test/debugger/debug/debug-materialized.js b/deps/v8/test/debugger/debug/debug-materialized.js
index 857bbb8c60e9d9..beb4097eceef91 100644
--- a/deps/v8/test/debugger/debug/debug-materialized.js
+++ b/deps/v8/test/debugger/debug/debug-materialized.js
@@ -2,6 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// Flags: --experimental-value-unavailable
 
 function dbg(x) {
   debugger;
@@ -33,7 +34,11 @@ Debug.setListener(function(event, exec_state, event_data, data) {
   for (var i = 0; i < exec_state.frameCount(); i++) {
     var f = exec_state.frame(i);
     for (var j = 0; j < f.localCount(); j++) {
-      print("'" + f.localName(j) + "' = " + f.localValue(j).value());
+      if (f.localValue(j).isUnavailable()) {
+        print(`${f.localName(j)} is unavailable`);
+      } else {
+        print("'" + f.localName(j) + "' = " + f.localValue(j).value());
+      }
     }
   }
 });
diff --git a/deps/v8/test/debugger/debug/es6/debug-blockscopes.js b/deps/v8/test/debugger/debug/es6/debug-blockscopes.js
index e155af91c60afb..e9cdb274b87835 100644
--- a/deps/v8/test/debugger/debug/es6/debug-blockscopes.js
+++ b/deps/v8/test/debugger/debug/es6/debug-blockscopes.js
@@ -26,6 +26,7 @@
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 // Flags: --noanalyze-environment-liveness --turbofan
+// Flags: --experimental-value-unavailable
 // The functions used for testing backtraces. They are at the top to make the
 // testing of source line/column easier.
 
@@ -445,7 +446,8 @@ listener_delegate = function(exec_state) {
                    debug.ScopeType.Local,
                    debug.ScopeType.Script,
                    debug.ScopeType.Global], exec_state);
-  CheckScopeContent({x:undefined}, 0, exec_state);
+  const prop = exec_state.frame().scope(0).scopeObject().property('x');
+  assertTrue(prop.isUnavailable());
 };
 uninitialized_1();
 EndTest();
diff --git a/deps/v8/test/debugger/debug/es6/debug-evaluate-receiver-before-super.js b/deps/v8/test/debugger/debug/es6/debug-evaluate-receiver-before-super.js
index 0c1b21e4faea52..5a11e662003943 100644
--- a/deps/v8/test/debugger/debug/es6/debug-evaluate-receiver-before-super.js
+++ b/deps/v8/test/debugger/debug/es6/debug-evaluate-receiver-before-super.js
@@ -2,6 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// Flags: --experimental-value-unavailable
 
 // Test that debug-evaluate doesn't crash when this is used before super() call
 // in constructor.
@@ -27,7 +28,7 @@ class A { constructor () { this.a = 239; } }
 class B extends A {
   constructor () {
     debugger;
-    assertTrue(result.indexOf("Cannot read properties of undefined (reading 'a')") >= 0);
+    assertTrue(result.indexOf("Cannot access 'this' from debugger") >= 0);
     super();
     debugger;
     assertEquals(239, result);
diff --git a/deps/v8/test/debugger/debug/es6/default-parameters-debug.js b/deps/v8/test/debugger/debug/es6/default-parameters-debug.js
index 87ff386b83faa1..c68781c58b0b04 100644
--- a/deps/v8/test/debugger/debug/es6/default-parameters-debug.js
+++ b/deps/v8/test/debugger/debug/es6/default-parameters-debug.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --noanalyze-environment-liveness
+// Flags: --noanalyze-environment-liveness --experimental-value-unavailable
 
 
 Debug = debug.Debug
@@ -19,13 +19,13 @@ function listener(event, exec_state, event_data, data) {
       // Break point in initializer for parameter `a`, invoked by
       // initializer for parameter `b`
       assertEquals('default', exec_state.frame(0).evaluate('mode').value());
-      assertTrue(exec_state.frame(1).evaluate('b').isUndefined());
-      assertTrue(exec_state.frame(1).evaluate('c').isUndefined());
+      assertThrows(() => exec_state.frame(1).evaluate('b'));
+      assertThrows(() => exec_state.frame(1).evaluate('c'));
     } else if (breakPointCount == 2) {
       // Break point in IIFE initializer for parameter `c`
       assertEquals('modeFn', exec_state.frame(1).evaluate('a.name').value());
       assertEquals('default', exec_state.frame(1).evaluate('b').value());
-      assertTrue(exec_state.frame(1).evaluate('c').isUndefined());
+      assertThrows(() => exec_state.frame(1).evaluate('c'));
     } else if (breakPointCount == 3) {
       // Break point in function body --- `c` parameter is shadowed
       assertEquals('modeFn', exec_state.frame(0).evaluate('a.name').value());
diff --git a/deps/v8/test/debugger/debug/es6/regress/regress-468661.js b/deps/v8/test/debugger/debug/es6/regress/regress-468661.js
index 7411dba8f030be..256fea7499b99e 100644
--- a/deps/v8/test/debugger/debug/es6/regress/regress-468661.js
+++ b/deps/v8/test/debugger/debug/es6/regress/regress-468661.js
@@ -2,6 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// Flags: --experimental-value-unavailable
 
 Debug = debug.Debug
 var exception = null;
@@ -9,7 +10,7 @@ var break_count = 0;
 const expected_breaks = 9;
 
 var expected_values =
-  [ReferenceError, undefined, 0, 0, 0, 0, 1,
+  [ReferenceError, ReferenceError, 0, 0, 0, 0, 1,
    ReferenceError, ReferenceError];
 
 function listener(event, exec_state, event_data, data) {
diff --git a/deps/v8/test/debugger/debug/es8/async-function-debug-evaluate.js b/deps/v8/test/debugger/debug/es8/async-function-debug-evaluate.js
index 4c61c1feb35314..dde58887d20469 100644
--- a/deps/v8/test/debugger/debug/es8/async-function-debug-evaluate.js
+++ b/deps/v8/test/debugger/debug/es8/async-function-debug-evaluate.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --noalways-turbofan
+// Flags: --noalways-turbofan --experimental-value-unavailable
 
 var Debug = debug.Debug;
 var breakPointCount = 0;
@@ -14,9 +14,9 @@ function listener(event, exec_state, event_data, data) {
     if (breakPointCount === 1) {
       assertEquals(
           "inner", exec_state.frame(0).evaluate("inner").value());
-      // Variables in TDZ have 'undefined' as their values.
-      assertEquals(undefined, exec_state.frame(0).evaluate("letInner").value());
-      assertEquals(undefined, exec_state.frame(0).evaluate("constInner").value());
+      // Variables in TDZ should throw an 'unavailable in debugger' error.
+      assertThrows(() => exec_state.frame(0).evaluate("letInner"));
+      assertThrows(() => exec_state.frame(0).evaluate("constInner"));
 
       assertEquals("outer", exec_state.frame(0).evaluate("outer").value());
       assertEquals(
@@ -30,15 +30,15 @@ function listener(event, exec_state, event_data, data) {
       assertEquals(
           "let outer", exec_state.frame(1).evaluate("letOuter").value());
 
-      // Variables in TDZ have 'undefined' as their values.
-      assertEquals(undefined, exec_state.frame(0).evaluate("withVar").value());
+      // Variables in TDZ should throw an 'unavailable in debugger' error.
+      assertThrows(() => exec_state.frame(0).evaluate("withVar"));
 
     } else if (breakPointCount === 2) {
       assertEquals(
           "inner", exec_state.frame(0).evaluate("inner").value());
-      // Variables in TDZ have 'undefined' as their values.
-      assertEquals(undefined, exec_state.frame(0).evaluate("letInner").value());
-      assertEquals(undefined, exec_state.frame(0).evaluate("constInner").value());
+      // Variables in TDZ should throw an 'unavailable in debugger' error.
+      assertThrows(() => exec_state.frame(0).evaluate("letInner"));
+      assertThrows(() => exec_state.frame(0).evaluate("constInner"));
 
       assertEquals(57, exec_state.frame(0).evaluate("x").value());
       assertEquals(100, exec_state.frame(0).evaluate("y").value());
@@ -70,8 +70,8 @@ function listener(event, exec_state, event_data, data) {
           "Error",
           exec_state.frame(0).evaluate("error.constructor.name").value());
       assertEquals("floof", exec_state.frame(0).evaluate("bun").value());
-      // Variables in TDZ have 'undefined' as their values.
-      assertEquals(undefined, exec_state.frame(0).evaluate("cow").value())
+      // Variables in TDZ should throw an 'unavailable in debugger' error.
+      assertThrows(() => exec_state.frame(0).evaluate("cow"));
 
       assertEquals("outer", exec_state.frame(0).evaluate("outer").value());
       assertEquals(
diff --git a/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect-array-fill.js b/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect-array-fill.js
new file mode 100644
index 00000000000000..e4cdde9f33998c
--- /dev/null
+++ b/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect-array-fill.js
@@ -0,0 +1,41 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-enable-one-shot-optimization
+
+Debug = debug.Debug
+
+var exception = null;
+var array = [1,2,3];
+
+function listener(event, exec_state, event_data, data) {
+  if (event != Debug.DebugEvent.Break) return;
+  try {
+    function success(expectation, source) {
+      var result = exec_state.frame(0).evaluate(source, true).value();
+      if (expectation !== undefined) assertEquals(expectation, result);
+    }
+    function fail(source) {
+      assertThrows(() => exec_state.frame(0).evaluate(source, true),
+                   EvalError);
+    }
+
+    fail(`array.fill(1)`);
+    success([1, 1, 1], `[1, 2, 3].fill(1)`);
+  } catch (e) {
+    exception = e;
+    print(e, e.stack);
+  };
+};
+
+// Add the debug event listener.
+Debug.setListener(listener);
+
+function f() {
+  debugger;
+};
+
+f();
+
+assertNull(exception);
diff --git a/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect-builtins.js b/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect-builtins.js
index 138b3e7b9268c2..222fa582977bdf 100644
--- a/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect-builtins.js
+++ b/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect-builtins.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --no-enable-one-shot-optimization
+// Flags: --harmony-array-grouping
 
 Debug = debug.Debug
 
@@ -50,6 +50,8 @@ function listener(event, exec_state, event_data, data) {
     success([1, 2], `Object.values({a:1, b:2})`);
     success(["a", 1, "b", 2], `Object.entries({a:1, b:2}).flat()`);
     success(["a", "b"], `Object.keys({a:1, b:2})`);
+    success(
+        '{"1":[1],"2":[2]}', `JSON.stringify(Object.groupBy([1,2], x => x))`);
 
     fail(`Object.assign({}, {})`);
     fail(`Object.defineProperties({}, [{p:{value:3}}])`);
@@ -239,6 +241,9 @@ function listener(event, exec_state, event_data, data) {
     fail(`Reflect.preventExtensions(object)`);
     fail(`Reflect.set(object, "great", "expectations")`);
     fail(`Reflect.setPrototypeOf(object, Array.prototype)`);
+
+    // Test some Map functions
+    success('[1]', `JSON.stringify(Map.groupBy([1,2], x => x).get(1))`);
   } catch (e) {
     exception = e;
     print(e, e.stack);
diff --git a/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect.js b/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect.js
index d00efa24939104..8b733ff7887a95 100644
--- a/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect.js
+++ b/deps/v8/test/debugger/debug/side-effect/debug-evaluate-no-side-effect.js
@@ -105,8 +105,8 @@ function listener(event, exec_state, event_data, data) {
     success("g", "get_a.bind(0).name = 'g'");
     success(1, "get_a.bind(0).length = 1");
     success(null, "(function(){}).prototype = null");
-    success(true, "(new Error()).stack.length > 1");
-    success("a", "(new Error()).stack = 'a'");
+    fail("(new Error()).stack.length > 1");
+    fail("(new Error()).stack = 'a'");
     // Eval is not allowed.
     fail("eval('Math.sin(1)')");
     fail("eval('exception = 1')");
diff --git a/deps/v8/test/debugger/debugger.status b/deps/v8/test/debugger/debugger.status
index 0097ae74665844..da77cbf09c5e0a 100644
--- a/deps/v8/test/debugger/debugger.status
+++ b/deps/v8/test/debugger/debugger.status
@@ -63,11 +63,6 @@
   'debug/es8/async-debug-caught-exception-cases2': [SKIP],
   'debug/es8/async-debug-caught-exception-cases3': [SKIP],
   'debug/es8/async-function-debug-scopes': [SKIP],
-
-  # https://crbug.com/v8/8141
-  'debug/debug-liveedit-1': [SKIP],
-  'debug/es6/debug-liveedit-new-target-3': [SKIP],
-  'debug/side-effect/debug-evaluate-no-side-effect-control': [SKIP],
 }],  # 'gc_stress == True'
 
 ##############################################################################
@@ -77,7 +72,7 @@
 }],  # 'gc_fuzzer'
 
 ##############################################################################
-['predictable == True', {
+['verify_predictable', {
   # https://crbug.com/v8/8147
   'debug/debug-liveedit-*': [SKIP],
   'debug/debug-set-variable-value': [SKIP],
@@ -86,7 +81,7 @@
   'debug/regress/regress-opt-after-debug-deopt': [SKIP],
   'debug/regress/regress-prepare-break-while-recompile': [SKIP],
   'regress/regress-7421': [SKIP],
-}],  # 'predictable == True'
+}],  # 'verify_predictable'
 
 ##############################################################################
 ['variant == no_wasm_traps', {
diff --git a/deps/v8/test/debugger/regress/deopt-regression.js b/deps/v8/test/debugger/regress/deopt-regression.js
new file mode 100644
index 00000000000000..d54acdb2939d8e
--- /dev/null
+++ b/deps/v8/test/debugger/regress/deopt-regression.js
@@ -0,0 +1,40 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --sparkplug
+
+var foo = {
+  [Symbol.toPrimitive]() {return "xyz";}
+}
+
+function f() {
+  var v = foo;
+  var o = {[v]: v};
+  return o["xyz"];
+};
+
+Debug = debug.Debug
+
+function listener(event, exec_state, event_data, data) {
+  if (event == Debug.DebugEvent.Break) {
+  }
+};
+
+// Add the debug event listener.
+Debug.setListener(listener);
+
+%DebugPrint(f());
+%CompileBaseline(f);
+%DebugPrint(f());
+
+foo[Symbol.toPrimitive] = function(hint) {
+  print("Setting breakpoint...");
+  const breakid = Debug.setBreakPoint(f, 3);
+  return "xyz";
+};
+
+%DebugPrint(f());
+
+// Get rid of the debug event listener.
+Debug.setListener(null);
diff --git a/deps/v8/test/debugger/regress/regress-6085.js b/deps/v8/test/debugger/regress/regress-6085.js
index 4c7a036b0f76e2..6e2672358c19d4 100644
--- a/deps/v8/test/debugger/regress/regress-6085.js
+++ b/deps/v8/test/debugger/regress/regress-6085.js
@@ -2,11 +2,18 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// This test fails without defeating TDZ check elision because 'return x;'
+// below, without a ThrowReferenceErrorIfHole bytecode, becomes a return
+// position breakpoint. Return position breakpoints can only inspect the
+// function scope because their source position is always at the end of the
+// function.
+
 function* serialize() {
   debugger;
   switch (0) {
     case 0:
-      let x = 1;
+      let x = 1;  // Defeat TDZ check elision
+    case 1:
       return x;  // Check scopes
   }
 }
diff --git a/deps/v8/test/debugger/test-api.js b/deps/v8/test/debugger/test-api.js
index ebc99f14c9bdd0..70ec0fd00cafe5 100644
--- a/deps/v8/test/debugger/test-api.js
+++ b/deps/v8/test/debugger/test-api.js
@@ -338,13 +338,15 @@ class DebugWrapper {
       }
     }
 
-    if (found == null) return { isUndefined : () => true };
+    if (found == null) return { isUndefined: () => true };
+    if (found.value === undefined) return { isUnavailable: () => true };
 
     const val = { value : () => found.value.value };
     // Not undefined in the sense that we did find a property, even though
     // the value can be 'undefined'.
     return { value : () => val,
-             isUndefined : () => false,
+             isUndefined: () => false,
+             isUnavailable: () => false,
            };
   }
 
@@ -449,13 +451,15 @@ class DebugWrapper {
 
     const local = scope_details[index];
 
+    if (local.value === undefined) return { isUnavailable: () => true };
+
     let localValue;
     switch (local.value.type) {
       case "undefined": localValue = undefined; break;
       default: localValue = local.value.value; break;
     }
 
-    return { value : () => localValue };
+    return { value : () => localValue, isUnavailable: () => false };
   }
 
   reconstructValue(objectId) {
@@ -690,12 +694,16 @@ class DebugWrapper {
 
   dispatchMessage(message) {
     const method = message.method;
-    if (method == "Debugger.paused") {
-      this.handleDebuggerPaused(message);
-    } else if (method == "Debugger.scriptParsed") {
-      this.handleDebuggerScriptParsed(message);
-    } else if (method == "Debugger.scriptFailedToParse") {
-      this.handleDebuggerScriptFailedToParse(message);
+    try {
+      if (method == "Debugger.paused") {
+        this.handleDebuggerPaused(message);
+      } else if (method == "Debugger.scriptParsed") {
+        this.handleDebuggerScriptParsed(message);
+      } else if (method == "Debugger.scriptFailedToParse") {
+        this.handleDebuggerScriptFailedToParse(message);
+      }
+    } catch (e) {
+      print(e.stack);
     }
   }
 
@@ -712,9 +720,10 @@ class DebugWrapper {
         debugEvent = this.DebugEvent.OOM;
         break;
       case "other":
+      case "step":
+      case "ambiguous":
         debugEvent = this.DebugEvent.Break;
         break;
-      case "ambiguous":
       case "XHR":
       case "DOM":
       case "EventListener":
diff --git a/deps/v8/test/debugger/testcfg.py b/deps/v8/test/debugger/testcfg.py
index fb7169bdfab211..864b860d9a96a4 100644
--- a/deps/v8/test/debugger/testcfg.py
+++ b/deps/v8/test/debugger/testcfg.py
@@ -45,11 +45,9 @@ def _parse_source_files(self, source):
         break
 
     files = []
-    files.append(os.path.normpath(os.path.join(
-        self.suite.root, "..", "mjsunit", "mjsunit.js")))
-    files.append(os.path.join(self.suite.root, "test-api.js"))
-    files.extend([os.path.normpath(os.path.join(self.suite.root, '..', '..', f))
-                  for f in files_list])
+    files.append(self.suite.root.parent / "mjsunit" / "mjsunit.js")
+    files.append(self.suite.root / "test-api.js")
+    files.extend([self.suite.root.parents[1] / f for f in files_list])
     files.append(self._get_source_path())
     return files
 
@@ -66,10 +64,10 @@ def _get_suite_flags(self):
     return ['--enable-inspector', '--allow-natives-syntax']
 
   def _get_source_path(self):
-    base_path = os.path.join(self.suite.root, self.path)
     # Try .js first, and fall back to .mjs.
     # TODO(v8:9406): clean this up by never separating the path from
     # the extension in the first place.
-    if os.path.exists(base_path + self._get_suffix()):
-      return base_path + self._get_suffix()
-    return base_path + '.mjs'
+    js_file = self.suite.root / self.path_js
+    if js_file.exists():
+      return js_file
+    return self.suite.root / self.path_mjs
diff --git a/deps/v8/test/debugging/testcfg.py b/deps/v8/test/debugging/testcfg.py
index 4976768b2f958a..5a4c151253d0a1 100644
--- a/deps/v8/test/debugging/testcfg.py
+++ b/deps/v8/test/debugging/testcfg.py
@@ -7,6 +7,8 @@
 import shlex
 import sys
 
+from pathlib import Path
+
 from testrunner.local import testsuite
 from testrunner.local import utils
 from testrunner.objects import testcase
@@ -17,7 +19,7 @@
 class PYTestCase(testcase.TestCase):
 
   def get_shell(self):
-    return os.path.splitext(sys.executable)[0]
+    return Path(sys.executable).stem
 
   def get_command(self):
     return super(PYTestCase, self).get_command()
@@ -25,7 +27,7 @@ def get_command(self):
   def _get_cmd_params(self):
     return (
         self._get_files_params() +
-        ['--', os.path.join(self.test_config.shell_dir, 'd8')] +
+        ['--', self.test_config.shell_dir / 'd8'] +
         self._get_source_flags()
     )
 
@@ -70,10 +72,10 @@ def _get_source_flags(self):
     return self._source_flags
 
   def _get_source_path(self):
-    base_path = os.path.join(self.suite.root, self.path)
-    if os.path.exists(base_path + self._get_suffix()):
-      return base_path + self._get_suffix()
-    return base_path + '.py'
+    js_file = self.suite.root / self.path_js
+    if js_file.exists():
+      return js_file
+    return self.suite.root / self.path_and_suffix('.py')
 
   def skip_predictable(self):
     return super(TestCase, self).skip_predictable() or self._expected_fail()
diff --git a/deps/v8/test/fuzzer/BUILD.gn b/deps/v8/test/fuzzer/BUILD.gn
index 5bbe62d7063bb5..4f173abb0f6899 100644
--- a/deps/v8/test/fuzzer/BUILD.gn
+++ b/deps/v8/test/fuzzer/BUILD.gn
@@ -19,7 +19,6 @@ group("v8_fuzzer") {
     "./json/",
     "./parser/",
     "./regexp/",
-    "./regexp_builtins/",
   ]
 
   if (v8_enable_webassembly) {
diff --git a/deps/v8/test/fuzzer/fuzzer.status b/deps/v8/test/fuzzer/fuzzer.status
index 2c74544522fa5f..561741c9bb2168 100644
--- a/deps/v8/test/fuzzer/fuzzer.status
+++ b/deps/v8/test/fuzzer/fuzzer.status
@@ -29,4 +29,9 @@
   'inspector/regress-1297964': [SKIP],
 }], # third_party_heap
 
+##############################################################################
+['no_simd_hardware == True', {
+  'wasm/regress-1464231.wasm': [SKIP],
+}],  # no_simd_hardware == True
+
 ]
diff --git a/deps/v8/test/fuzzer/inspector-fuzzer.cc b/deps/v8/test/fuzzer/inspector-fuzzer.cc
index 05ec9267179470..f0fa44f463c099 100644
--- a/deps/v8/test/fuzzer/inspector-fuzzer.cc
+++ b/deps/v8/test/fuzzer/inspector-fuzzer.cc
@@ -16,6 +16,7 @@
 #include "include/v8-object.h"
 #include "include/v8-primitive.h"
 #include "include/v8-template.h"
+#include "src/api/api.h"
 #include "src/base/platform/platform.h"
 #include "src/base/platform/time.h"
 #include "src/base/small-vector.h"
@@ -77,43 +78,44 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
     backend_runner_ = runner;
   }
 
-  static void ClearAllSessions() { channels_.clear(); }
-
  private:
   static TaskRunner* backend_runner_;
 
-  static void Quit(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  static void Quit(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
     // Only terminate, so not join the threads here, since joining concurrently
     // from multiple threads can be undefined behaviour (see pthread_join).
     for (TaskRunner* task_runner : task_runners) task_runner->Terminate();
   }
 
   static void CompileAndRunWithOrigin(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 6 || !args[0]->IsInt32() || !args[1]->IsString() ||
-        !args[2]->IsString() || !args[3]->IsInt32() || !args[4]->IsInt32() ||
-        !args[5]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 6 || !info[0]->IsInt32() || !info[1]->IsString() ||
+        !info[2]->IsString() || !info[3]->IsInt32() || !info[4]->IsInt32() ||
+        !info[5]->IsBoolean()) {
       return;
     }
 
     backend_runner_->Append(std::make_unique<ExecuteStringTask>(
-        args.GetIsolate(), args[0].As<v8::Int32>()->Value(),
-        ToVector(args.GetIsolate(), args[1].As<v8::String>()),
-        args[2].As<v8::String>(), args[3].As<v8::Int32>(),
-        args[4].As<v8::Int32>(), args[5].As<v8::Boolean>()));
+        info.GetIsolate(), info[0].As<v8::Int32>()->Value(),
+        ToVector(info.GetIsolate(), info[1].As<v8::String>()),
+        info[2].As<v8::String>(), info[3].As<v8::Int32>(),
+        info[4].As<v8::Int32>(), info[5].As<v8::Boolean>()));
   }
 
   static void SchedulePauseOnNextStatement(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsInt32() || !args[1]->IsString() ||
-        !args[2]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 3 || !info[0]->IsInt32() || !info[1]->IsString() ||
+        !info[2]->IsString()) {
       return;
     }
     std::vector<uint16_t> reason =
-        ToVector(args.GetIsolate(), args[1].As<v8::String>());
+        ToVector(info.GetIsolate(), info[1].As<v8::String>());
     std::vector<uint16_t> details =
-        ToVector(args.GetIsolate(), args[2].As<v8::String>());
-    int context_group_id = args[0].As<v8::Int32>()->Value();
+        ToVector(info.GetIsolate(), info[2].As<v8::String>());
+    int context_group_id = info[0].As<v8::Int32>()->Value();
     RunSyncTask(backend_runner_,
                 [&context_group_id, &reason,
                  &details](InspectorIsolateData* data) {
@@ -125,11 +127,12 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void CancelPauseOnNextStatement(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       return;
     }
-    int context_group_id = args[0].As<v8::Int32>()->Value();
+    int context_group_id = info[0].As<v8::Int32>()->Value();
     RunSyncTask(backend_runner_,
                 [&context_group_id](InspectorIsolateData* data) {
                   data->CancelPauseOnNextStatement(context_group_id);
@@ -137,8 +140,9 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void CreateContextGroup(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 0) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 0) {
       return;
     }
     int context_group_id = 0;
@@ -146,79 +150,97 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
                 [&context_group_id](InspectorIsolateData* data) {
                   context_group_id = data->CreateContextGroup();
                 });
-    args.GetReturnValue().Set(
-        v8::Int32::New(args.GetIsolate(), context_group_id));
+    info.GetReturnValue().Set(
+        v8::Int32::New(info.GetIsolate(), context_group_id));
   }
 
   static void ResetContextGroup(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       return;
     }
-    int context_group_id = args[0].As<v8::Int32>()->Value();
+    int context_group_id = info[0].As<v8::Int32>()->Value();
     RunSyncTask(backend_runner_,
                 [&context_group_id](InspectorIsolateData* data) {
                   data->ResetContextGroup(context_group_id);
                 });
   }
 
-  static void ConnectSession(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsInt32() || !args[1]->IsString() ||
-        !args[2]->IsFunction()) {
-      return;
+  static bool IsValidConnectSessionArgs(
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() < 3 || info.Length() > 4) return false;
+    if (!info[0]->IsInt32() || !info[1]->IsString() || !info[2]->IsFunction()) {
+      return false;
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
-    FrontendChannelImpl* channel = new FrontendChannelImpl(
-        InspectorIsolateData::FromContext(context)->task_runner(),
-        InspectorIsolateData::FromContext(context)->GetContextGroupId(context),
-        args.GetIsolate(), args[2].As<v8::Function>());
+    return info.Length() == 3 || info[3]->IsBoolean();
+  }
+
+  static void ConnectSession(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (!IsValidConnectSessionArgs(info)) return;
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
+    std::unique_ptr<FrontendChannelImpl> channel =
+        std::make_unique<FrontendChannelImpl>(
+            InspectorIsolateData::FromContext(context)->task_runner(),
+            InspectorIsolateData::FromContext(context)->GetContextGroupId(
+                context),
+            info.GetIsolate(), info[2].As<v8::Function>());
 
     std::vector<uint8_t> state =
-        ToBytes(args.GetIsolate(), args[1].As<v8::String>());
-    int context_group_id = args[0].As<v8::Int32>()->Value();
-    int session_id = 0;
-    RunSyncTask(backend_runner_, [&context_group_id, &session_id, &channel,
-                                  &state](InspectorIsolateData* data) {
-      session_id = data->ConnectSession(
-          context_group_id,
-          v8_inspector::StringView(state.data(), state.size()), channel);
-      channel->set_session_id(session_id);
-    });
+        ToBytes(info.GetIsolate(), info[1].As<v8::String>());
+    int context_group_id = info[0].As<v8::Int32>()->Value();
+    bool is_fully_trusted =
+        info.Length() == 3 || info[3].As<v8::Boolean>()->Value();
+    base::Optional<int> session_id;
+    RunSyncTask(backend_runner_,
+                [context_group_id, &session_id, &channel, &state,
+                 is_fully_trusted](InspectorIsolateData* data) {
+                  session_id = data->ConnectSession(
+                      context_group_id,
+                      v8_inspector::StringView(state.data(), state.size()),
+                      std::move(channel), is_fully_trusted);
+                });
 
-    channels_[session_id].reset(channel);
-    args.GetReturnValue().Set(v8::Int32::New(args.GetIsolate(), session_id));
+    if (session_id.has_value()) {
+      info.GetReturnValue().Set(v8::Int32::New(info.GetIsolate(), *session_id));
+    } else {
+      info.GetIsolate()->ThrowError("Unable to connect to context group");
+    }
   }
 
   static void DisconnectSession(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       return;
     }
-    int session_id = args[0].As<v8::Int32>()->Value();
+    int session_id = info[0].As<v8::Int32>()->Value();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
+    TaskRunner* context_task_runner =
+        InspectorIsolateData::FromContext(context)->task_runner();
     std::vector<uint8_t> state;
-    RunSyncTask(backend_runner_,
-                [&session_id, &state](InspectorIsolateData* data) {
-                  state = data->DisconnectSession(session_id);
-                });
-    channels_.erase(session_id);
-    args.GetReturnValue().Set(ToV8String(args.GetIsolate(), state));
+    RunSyncTask(backend_runner_, [&session_id, &context_task_runner,
+                                  &state](InspectorIsolateData* data) {
+      state = data->DisconnectSession(session_id, context_task_runner);
+    });
+
+    info.GetReturnValue().Set(ToV8String(info.GetIsolate(), state));
   }
 
   static void SendMessageToBackend(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsInt32() || !args[1]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 2 || !info[0]->IsInt32() || !info[1]->IsString()) {
       return;
     }
     backend_runner_->Append(std::make_unique<SendMessageToBackendTask>(
-        args[0].As<v8::Int32>()->Value(),
-        ToVector(args.GetIsolate(), args[1].As<v8::String>())));
+        info[0].As<v8::Int32>()->Value(),
+        ToVector(info.GetIsolate(), info[1].As<v8::String>())));
   }
-
-  static std::map<int, std::unique_ptr<FrontendChannelImpl>> channels_;
 };
 
 TaskRunner* UtilsExtension::backend_runner_ = nullptr;
-std::map<int, std::unique_ptr<FrontendChannelImpl>> UtilsExtension::channels_;
 
 bool StrictAccessCheck(v8::Local<v8::Context> accessing_context,
                        v8::Local<v8::Object> accessed_object,
@@ -290,113 +312,123 @@ class InspectorExtension : public InspectorIsolateData::SetupGlobalTask {
 
  private:
   static void FireContextCreated(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     data->FireContextCreated(context, data->GetContextGroupId(context),
                              v8_inspector::StringView());
   }
 
   static void FireContextDestroyed(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     data->FireContextDestroyed(context);
   }
 
-  static void FreeContext(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+  static void FreeContext(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     data->FreeContext(context);
   }
 
   static void AddInspectedObject(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 2 || !info[0]->IsInt32()) {
       return;
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
-    data->AddInspectedObject(args[0].As<v8::Int32>()->Value(), args[1]);
+    data->AddInspectedObject(info[0].As<v8::Int32>()->Value(), info[1]);
   }
 
   static void SetMaxAsyncTaskStacks(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       return;
     }
-    InspectorIsolateData::FromContext(args.GetIsolate()->GetCurrentContext())
-        ->SetMaxAsyncTaskStacksForTest(args[0].As<v8::Int32>()->Value());
+    InspectorIsolateData::FromContext(info.GetIsolate()->GetCurrentContext())
+        ->SetMaxAsyncTaskStacksForTest(info[0].As<v8::Int32>()->Value());
   }
 
   static void DumpAsyncTaskStacksStateForTest(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 0) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 0) {
       return;
     }
-    InspectorIsolateData::FromContext(args.GetIsolate()->GetCurrentContext())
+    InspectorIsolateData::FromContext(info.GetIsolate()->GetCurrentContext())
         ->DumpAsyncTaskStacksStateForTest();
   }
 
-  static void BreakProgram(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsString() || !args[1]->IsString()) {
+  static void BreakProgram(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 2 || !info[0]->IsString() || !info[1]->IsString()) {
       return;
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     std::vector<uint16_t> reason =
-        ToVector(args.GetIsolate(), args[0].As<v8::String>());
+        ToVector(info.GetIsolate(), info[0].As<v8::String>());
     v8_inspector::StringView reason_view(reason.data(), reason.size());
     std::vector<uint16_t> details =
-        ToVector(args.GetIsolate(), args[1].As<v8::String>());
+        ToVector(info.GetIsolate(), info[1].As<v8::String>());
     v8_inspector::StringView details_view(details.data(), details.size());
     data->BreakProgram(data->GetContextGroupId(context), reason_view,
                        details_view);
   }
 
   static void CreateObjectWithStrictCheck(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 0) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 0) {
       return;
     }
     v8::Local<v8::ObjectTemplate> templ =
-        v8::ObjectTemplate::New(args.GetIsolate());
+        v8::ObjectTemplate::New(info.GetIsolate());
     templ->SetAccessCheckCallback(&StrictAccessCheck);
-    args.GetReturnValue().Set(
-        templ->NewInstance(args.GetIsolate()->GetCurrentContext())
+    info.GetReturnValue().Set(
+        templ->NewInstance(info.GetIsolate()->GetCurrentContext())
             .ToLocalChecked());
   }
 
   static void CallWithScheduledBreak(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsFunction() || !args[1]->IsString() ||
-        !args[2]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 3 || !info[0]->IsFunction() || !info[1]->IsString() ||
+        !info[2]->IsString()) {
       return;
     }
     std::vector<uint16_t> reason =
-        ToVector(args.GetIsolate(), args[1].As<v8::String>());
+        ToVector(info.GetIsolate(), info[1].As<v8::String>());
     v8_inspector::StringView reason_view(reason.data(), reason.size());
     std::vector<uint16_t> details =
-        ToVector(args.GetIsolate(), args[2].As<v8::String>());
+        ToVector(info.GetIsolate(), info[2].As<v8::String>());
     v8_inspector::StringView details_view(details.data(), details.size());
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     int context_group_id = data->GetContextGroupId(context);
     data->SchedulePauseOnNextStatement(context_group_id, reason_view,
                                        details_view);
     v8::MaybeLocal<v8::Value> result;
-    result = args[0].As<v8::Function>()->Call(context, context->Global(), 0,
+    result = info[0].As<v8::Function>()->Call(context, context->Global(), 0,
                                               nullptr);
     data->CancelPauseOnNextStatement(context_group_id);
   }
 
   static void MarkObjectAsNotInspectable(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsObject()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsObject()) {
       return;
     }
-    v8::Local<v8::Object> object = args[0].As<v8::Object>();
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Local<v8::Object> object = info[0].As<v8::Object>();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Private> notInspectablePrivate =
         v8::Private::ForApi(isolate, ToV8String(isolate, "notInspectable"));
     object
@@ -406,19 +438,20 @@ class InspectorExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void CreateObjectWithAccessor(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsString() || !args[1]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 2 || !info[0]->IsString() || !info[1]->IsBoolean()) {
       return;
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::ObjectTemplate> templ = v8::ObjectTemplate::New(isolate);
-    if (args[1].As<v8::Boolean>()->Value()) {
-      templ->SetAccessor(v8::Local<v8::String>::Cast(args[0]), AccessorGetter,
+    if (info[1].As<v8::Boolean>()->Value()) {
+      templ->SetAccessor(v8::Local<v8::String>::Cast(info[0]), AccessorGetter,
                          AccessorSetter);
     } else {
-      templ->SetAccessor(v8::Local<v8::String>::Cast(args[0]), AccessorGetter);
+      templ->SetAccessor(v8::Local<v8::String>::Cast(info[0]), AccessorGetter);
     }
-    args.GetReturnValue().Set(
+    info.GetReturnValue().Set(
         templ->NewInstance(isolate->GetCurrentContext()).ToLocalChecked());
   }
 
@@ -436,15 +469,16 @@ class InspectorExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void StoreCurrentStackTrace(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsString()) {
       return;
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     std::vector<uint16_t> description =
-        ToVector(isolate, args[0].As<v8::String>());
+        ToVector(isolate, info[0].As<v8::String>());
     v8_inspector::StringView description_view(description.data(),
                                               description.size());
     v8_inspector::V8StackTraceId id =
@@ -453,77 +487,81 @@ class InspectorExtension : public InspectorIsolateData::SetupGlobalTask {
         v8::ArrayBuffer::New(isolate, sizeof(id));
     *static_cast<v8_inspector::V8StackTraceId*>(
         buffer->GetBackingStore()->Data()) = id;
-    args.GetReturnValue().Set(buffer);
+    info.GetReturnValue().Set(buffer);
   }
 
   static void ExternalAsyncTaskStarted(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsArrayBuffer()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsArrayBuffer()) {
       return;
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     v8_inspector::V8StackTraceId* id =
         static_cast<v8_inspector::V8StackTraceId*>(
-            args[0].As<v8::ArrayBuffer>()->GetBackingStore()->Data());
+            info[0].As<v8::ArrayBuffer>()->GetBackingStore()->Data());
     data->ExternalAsyncTaskStarted(*id);
   }
 
   static void ExternalAsyncTaskFinished(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsArrayBuffer()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsArrayBuffer()) {
       return;
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     v8_inspector::V8StackTraceId* id =
         static_cast<v8_inspector::V8StackTraceId*>(
-            args[0].As<v8::ArrayBuffer>()->GetBackingStore()->Data());
+            info[0].As<v8::ArrayBuffer>()->GetBackingStore()->Data());
     data->ExternalAsyncTaskFinished(*id);
   }
 
   static void ScheduleWithAsyncStack(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsFunction() || !args[1]->IsString() ||
-        !args[2]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 3 || !info[0]->IsFunction() || !info[1]->IsString() ||
+        !info[2]->IsBoolean()) {
       return;
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     int context_group_id = data->GetContextGroupId(context);
-    bool with_empty_stack = args[2].As<v8::Boolean>()->Value();
+    bool with_empty_stack = info[2].As<v8::Boolean>()->Value();
     if (with_empty_stack) context->Exit();
 
     std::vector<uint16_t> task_name =
-        ToVector(isolate, args[1].As<v8::String>());
+        ToVector(isolate, info[1].As<v8::String>());
     v8_inspector::StringView task_name_view(task_name.data(), task_name.size());
 
     RunAsyncTask(
         data->task_runner(), task_name_view,
         std::make_unique<SetTimeoutTask>(
-            context_group_id, isolate, v8::Local<v8::Function>::Cast(args[0])));
+            context_group_id, isolate, v8::Local<v8::Function>::Cast(info[0])));
     if (with_empty_stack) context->Enter();
   }
 
   static void SetAllowCodeGenerationFromStrings(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsBoolean()) {
       return;
     }
-    args.GetIsolate()->GetCurrentContext()->AllowCodeGenerationFromStrings(
-        args[0].As<v8::Boolean>()->Value());
+    info.GetIsolate()->GetCurrentContext()->AllowCodeGenerationFromStrings(
+        info[0].As<v8::Boolean>()->Value());
   }
 
   static void SetResourceNamePrefix(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    DCHECK(ValidateCallbackInfo(info));
+    if (info.Length() != 1 || !info[0]->IsString()) {
       return;
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
-    data->SetResourceNamePrefix(v8::Local<v8::String>::Cast(args[0]));
+    data->SetResourceNamePrefix(v8::Local<v8::String>::Cast(info[0]));
   }
 };
 
@@ -587,8 +625,6 @@ void FuzzInspector(const uint8_t* data, size_t size) {
   ready_semaphore.Signal();
   watchdog.Join();
 
-  UtilsExtension::ClearAllSessions();
-
   // TaskRunners go out of scope here, which causes Isolate teardown and all
   // running background tasks to be properly joined.
 }
diff --git a/deps/v8/test/fuzzer/inspector/regress-1433503 b/deps/v8/test/fuzzer/inspector/regress-1433503
new file mode 100644
index 00000000000000..39038431f76800
--- /dev/null
+++ b/deps/v8/test/fuzzer/inspector/regress-1433503
@@ -0,0 +1,479 @@
+utils2 = new Proxy(utils, {get: function(target, prop) { if (prop in target) return target[prop]; return i=>i;}});
+// Copyright 2016 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+InspectorTest = {};
+InspectorTest._dumpInspectorProtocolMessages = false;
+InspectorTest._commandsForLogging = new Set();
+InspectorTest._sessions = new Set();
+
+InspectorTest.log = utils2.print.bind(utils2);
+InspectorTest.quitImmediately = utils2.quit.bind(utils2);
+
+InspectorTest.logProtocolCommandCalls = function(command) {
+  InspectorTest._commandsForLogging.add(command);
+}
+
+InspectorTest.completeTest = function() {
+  var promises = [];
+  for (var session of InspectorTest._sessions)
+    promises.push(session.Protocol.Debugger.disable());
+  Promise.all(promises).then(() => utils2.quit());
+}
+
+InspectorTest.waitForPendingTasks = function() {
+  var promises = [];
+  for (var session of InspectorTest._sessions)
+    promises.push(session.Protocol.Runtime.evaluate({ expression: "new Promise(r => setTimeout(r, 0))//# sourceURL=wait-for-pending-tasks.js", awaitPromise: true }));
+  return Promise.all(promises);
+}
+
+InspectorTest.startDumpingProtocolMessages = function() {
+  InspectorTest._dumpInspectorProtocolMessages = true;
+}
+
+InspectorTest.logMessage = function(originalMessage) {
+  const nonStableFields = new Set([
+    'objectId', 'scriptId', 'exceptionId', 'timestamp', 'executionContextId',
+    'callFrameId', 'breakpointId', 'bindRemoteObjectFunctionId',
+    'formatterObjectId', 'debuggerId', 'bodyGetterId'
+  ]);
+  const message = JSON.parse(JSON.stringify(originalMessage, replacer.bind(null, Symbol(), nonStableFields)));
+  if (message.id)
+    message.id = '<messageId>';
+
+  InspectorTest.logObject(message);
+  return originalMessage;
+
+  function replacer(stableIdSymbol, nonStableFields, name, val) {
+    if (nonStableFields.has(name))
+      return `<${name}>`;
+    if (name === 'internalProperties') {
+      const stableId = val.find(prop => prop.name === '[[StableObjectId]]');
+      if (stableId)
+        stableId.value[stableIdSymbol] = true;
+    }
+    if (name === 'parentId')
+      return { id: '<id>' };
+    if (val && val[stableIdSymbol])
+	     return '<StablectObjectId>';
+    return val;
+  }
+}
+
+InspectorTest.logObject = function(object, title) {
+  var lines = [];
+
+  function dumpValue(value, prefix, prefixWithName) {
+    if (typeof value === "object" && value !== null) {
+      if (value instanceof Array)
+        dumpItems(value, prefix, prefixWithName);
+      else
+        dumpProperties(value, prefix, prefixWithName);
+    } else {
+      lines.push(prefixWithName + String(value).replace(/\n/g, " "));
+    }
+  }
+
+  function dumpProperties(object, prefix, firstLinePrefix) {
+    prefix = prefix || "";
+    firstLinePrefix = firstLinePrefix || prefix;
+    lines.push(firstLinePrefix + "{");
+
+    var propertyNames = Object.keys(object);
+    propertyNames.sort();
+    for (var i = 0; i < propertyNames.length; ++i) {
+      var name = propertyNames[i];
+      if (!object.hasOwnProperty(name))
+        continue;
+      var prefixWithName = "    " + prefix + name + " : ";
+      dumpValue(object[name], "    " + prefix, prefixWithName);
+    }
+    lines.push(prefix + "}");
+  }
+
+  function dumpItems(object, prefix, firstLinePrefix) {
+    prefix = prefix || "";
+    firstLinePrefix = firstLinePrefix || prefix;
+    lines.push(firstLinePrefix + "[");
+    for (var i = 0; i < object.length; ++i)
+      dumpValue(object[i], "    " + prefix, "    " + prefix + "[" + i + "] : ");
+    lines.push(prefix + "]");
+  }
+
+  dumpValue(object, "", title || "");
+  InspectorTest.log(lines.join("\n"));
+}
+
+InspectorTest.decodeBase64 = function(base64) {
+  const LOOKUP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/';
+
+  const paddingLength = base64.match(/=*$/)[0].length;
+  const bytesLength = base64.length * 0.75 - paddingLength;
+
+  let bytes = new Uint8Array(bytesLength);
+
+  for (let i = 0, p = 0; i < base64.length; i += 4, p += 3) {
+    let bits = 0;
+    for (let j = 0; j < 4; j++) {
+      bits <<= 6;
+      const c = base64[i + j];
+      if (c !== '=') bits |= LOOKUP.indexOf(c);
+    }
+    for (let j = p + 2; j >= p; j--) {
+      if (j < bytesLength) bytes[j] = bits;
+      bits >>= 8;
+    }
+  }
+
+  return bytes;
+}
+
+InspectorTest.ContextGroup = class {
+  constructor() {
+    this.id = utils2.createContextGroup();
+  }
+
+  schedulePauseOnNextStatement(reason, details) {
+    utils2.schedulePauseOnNextStatement(this.id, reason, details);
+  }
+
+  cancelPauseOnNextStatement() {
+    utils2.cancelPauseOnNextStatement(this.id);
+  }
+
+  addScript(string, lineOffset, columnOffset, url) {
+    utils2.compileAndRunWithOrigin(this.id, string, url || '', lineOffset || 0, columnOffset || 0, false);
+  }
+
+  addInlineScript(string, url) {
+    const match = (new Error().stack).split('\n')[2].match(/([0-9]+):([0-9]+)/);
+    this.addScript(
+        string, match[1] * 1, match[1] * 1 + '.addInlineScript('.length, url);
+  }
+
+  addModule(string, url, lineOffset, columnOffset) {
+    utils2.compileAndRunWithOrigin(this.id, string, url, lineOffset || 0, columnOffset || 0, true);
+  }
+
+  loadScript(fileName) {
+    this.addScript(utils2.read(fileName));
+  }
+
+  connect() {
+    return new InspectorTest.Session(this);
+  }
+
+  reset() {
+    utils2.resetContextGroup(this.id);
+  }
+
+  setupInjectedScriptEnvironment(session) {
+    let scriptSource = '';
+    let getters = ["length","internalConstructorName","subtype","getProperty",
+        "objectHasOwnProperty","nullifyPrototype","primitiveTypes",
+        "closureTypes","prototype","all","RemoteObject","bind",
+        "PropertyDescriptor","object","get","set","value","configurable",
+        "enumerable","symbol","getPrototypeOf","nativeAccessorDescriptor",
+        "isBuiltin","hasGetter","hasSetter","getOwnPropertyDescriptor",
+        "description","formatAccessorsAsProperties","isOwn","name",
+        "typedArrayProperties","keys","getOwnPropertyNames",
+        "getOwnPropertySymbols","isPrimitiveValue","com","toLowerCase",
+        "ELEMENT","trim","replace","DOCUMENT","size","byteLength","toString",
+        "stack","substr","message","indexOf","key","type","unserializableValue",
+        "objectId","className","preview","proxyTargetValue","customPreview",
+        "CustomPreview","resolve","then","console","error","header","hasBody",
+        "stringify","ObjectPreview","ObjectPreviewType","properties",
+        "ObjectPreviewSubtype","getInternalProperties","wasThrown","indexes",
+        "overflow","valuePreview","entries"];
+    scriptSource += `(function installSettersAndGetters() {
+        let defineProperty = Object.defineProperty;
+        let ObjectPrototype = Object.prototype;
+        let ArrayPrototype = Array.prototype;
+        defineProperty(ArrayPrototype, 0, {
+          set() { debugger; throw 42; }, get() { debugger; throw 42; },
+          __proto__: null
+        });`,
+        scriptSource += getters.map(getter => `
+        defineProperty(ObjectPrototype, '${getter}', {
+          set() { debugger; throw 42; }, get() { debugger; throw 42; },
+          is_global__proto__: null
+        });
+        `).join('\n') + '})();';
+    this.addScript(scriptSource);
+
+    if (session) {
+      InspectorTest.log('WARNING: setupInjectedScriptEnvironment with debug flag for debugging only and should not be landed.');
+      session.setupScriptMap();
+      session.Protocol.Debugger.enable();
+      session.Protocol.Debugger.onPaused(message => {
+        let callFrames = message.params.callFrames;
+        session.logSourceLocations(callFrames.map(frame => frame.location));
+      })
+    }
+  }
+};
+
+InspectorTest.Session = class {
+  constructor(contextGroup) {
+    this.contextGroup = contextGroup;
+    this._dispatchTable = new Map();
+    this._eventHandlers = new Map();
+    this._requestId = 0;
+    this.Protocol = this._setupProtocol();
+    InspectorTest._sessions.add(this);
+    this.id = utils2.connectSession(contextGroup.id, '', this._dispatchMessage.bind(this));
+  }
+
+  disconnect() {
+    InspectorTest._sessions.delete(this);
+    utils2.disconnectSession(this.id);
+  }
+
+  reconnect() {
+    var state = utils2.disconnectSession(this.id);
+    this.id = utils2.connectSession(this.contextGroup.id, state, this._dispatchMessage.bind(this));
+  }
+
+  async addInspectedObject(serializable) {
+    return this.Protocol.Runtime.evaluate({expression: `inspector.addInspectedObject(${this.id}, ${JSON.stringify(serializable)})`});
+  }
+
+  sendRawCommand(requestId, command, handler) {
+    if (InspectorTest._dumpInspectorProtocolMessages)
+      utils2.print("frontend: " + command);
+    this._dispatchTable.set(requestId, handler);
+    utils2.sendMessageToBackend(this.id, command);
+  }
+
+  setupScriptMap() {
+    if (this._scriptMap)
+      return;
+    this._scriptMap = new Map();
+  }
+
+  logCallFrames(callFrames) {
+    for (var frame of callFrames) {
+      var functionName = frame.functionName || '(anonymous)';
+      var scriptId = frame.location ? frame.location.scriptId : frame.scriptId;
+      var url = frame.url ? frame.url : this._scriptMap.get(scriptId).url;
+      var lineNumber = frame.location ? frame.location.lineNumber : frame.lineNumber;
+      var columnNumber = frame.location ? frame.location.columnNumber : frame.columnNumber;
+      InspectorTest.log(`${functionName} (${url}:${lineNumber}:${columnNumber})`);
+    }
+  }
+
+  async getScriptWithSource(scriptId, forceSourceRequest) {
+    var script = this._scriptMap.get(scriptId);
+    if (forceSourceRequest || !(script.scriptSource || script.bytecode)) {
+      var message = await this.Protocol.Debugger.getScriptSource({ scriptId });
+      script.scriptSource = message.result.scriptSource;
+      if (message.result.bytecode) {
+        script.bytecode = InspectorTest.decodeBase64(message.result.bytecode);
+      }
+    }
+    return script;
+  }
+
+  async logSourceLocation(location, forceSourceRequest) {
+    var scriptId = location.scriptId;
+    if (!this._scriptMap || !this._scriptMap.has(scriptId)) {
+      InspectorTest.log("setupScriptMap should be called before Protocol.Debugger.enable.");
+      InspectorTest.completeTest();
+    }
+    var script = await this.getScriptWithSource(scriptId, forceSourceRequest);
+
+    if (script.bytecode) {
+      if (location.lineNumber != 0) {
+        InspectorTest.log('Unexpected wasm line number: ' + location.lineNumber);
+      }
+      let wasm_opcode = script.bytecode[location.columnNumber].toString(16);
+      if (wasm_opcode.length % 2) wasm_opcode = '0' + wasm_opcode;
+      InspectorTest.log(`Script ${script.url} byte offset ${location.columnNumber}: Wasm opcode 5x${wasm_opcode}`);
+    } else {
+      var lines = script.scriptSource.split('\n');
+      var line = lines[location.lineNumber];
+      line = line.slice(0, location.columnNumber) + '#' + (line.slice(location.columnNumber) || '');
+      lines[location.lineNumber] = line;
+      lines = lines.filter(line => line.indexOf('//# sourceURL=') === -1);
+      InspectorTest.log(lines.slice(Math.max(location.lineNumber - 1, 0), location.lineNumber + 2).join('\n'));
+      InspectorTest.log('');
+    }
+  }
+
+  logSourceLocations(locations) {
+    if (locations.length == 0) return Promise.resolve();
+    return this.logSourceLocation(locations[0]).then(() => this.logSourceLocations(locations.splice(1)));
+  }
+
+  async logBreakLocations(inputLocations) {
+    let locations = inputLocations.slice();
+    let scriptId = locations[0].scriptId;
+    let script = await this.getScriptWithSource(scriptId);
+    let lines = script.scriptSource.split('\n');
+    locations = locations.sort((loc1, loc2) => {
+      if (loc2.lineNumber !== loc1.lineNumber) return loc2.lineNumber - loc1.lineNumber;
+      return loc2.columnNumber - loc1.columnNumber;
+    });
+    for (let location of locations) {
+      let line = lines[location.lineNumber];
+      line = line.slice(0, location.columnNumber) + locationMark(location.type) + line.slice(location.columnNumber);
+      lines[location.lineNumber] = line;
+    }
+    lines = lines.filter(line => line.indexOf('//# sourceURL=') === -1);
+    InspectorTest.log(lines.join('\n') + '\n');
+    return inputLocations;
+
+    function locationMark(type) {
+      if (type === 'return') return '|R|';
+      if (type === 'call') return '|C|';
+      if (type === 'debuggerStatement') return '|D|';
+      return '|_|';
+    }
+  }
+
+  async logTypeProfile(typeProfile, source) {
+    let entries = typeProfile.entries;
+
+    // Sort in reverse order so we can replace entries without invalidating
+    // the other offsets.
+    entries = entries.sort((a, b) => b.offset - a.offset);
+
+    for (let entry of entries) {
+      source = source.slice(0, entry.offset) + typeAnnotation(entry.types) +
+        source.slice(entry.offset);
+    }
+    InspectorTest.log(source);
+    return typeProfile;
+
+    function typeAnnotation(types) {
+      return `/*${types.map(t => t.name).join(', ')}*/`;
+    }
+  }
+
+  logAsyncStackTrace(asyncStackTrace) {
+    while (asyncStackTrace) {
+      InspectorTest.log(`-- ${asyncStackTrace.description || '<empty>'} --`);
+      this.logCallFrames(asyncStackTrace.callFrames);
+      if (asyncStackTrace.parentId) InspectorTest.log('  <external stack>');
+      asyncStackTrace = asyncStackTrace.parent;
+    }
+  }
+
+  _sendCommandPromise(method, params) {
+    if (typeof params !== 'object')
+      utils2.print(`WARNING: non-object params passed to invocation of method ${method}`);
+    if (InspectorTest._commandsForLogging.has(method))
+      utils2.print(method + ' called');
+    var requestId = ++this._requestId;
+    var messageObject = { "id": requestId, "method": method, "params": params };
+    return new Promise(fulfill => this.sendRawCommand(requestId, JSON.stringify(messageObject), fulfill));
+  }
+
+  _setupProtocol() {
+    return new Proxy({}, { get: (target, agentName, receiver) => new Proxy({}, {
+      get: (target, methodName, receiver) => {
+        const eventPattern = /^on(ce)?([A-Z][A-Za-z0-9]+)/;
+        var match = eventPattern.exec(methodName);
+        if (!match)
+          return args => this._sendCommandPromise(`${agentName}.${methodName}`, args || {});
+        var eventName = match[2];
+        eventName = eventName.charAt(0).toLowerCase() + eventName.slice(1);
+        if (match[1])
+          return numOfEvents => this._waitForEventPromise(
+                     `${agentName}.${eventName}`, numOfEvents || 1);
+        return listener => this._eventHandlers.set(`${agentName}.${eventName}`, listener);
+      }
+    })});
+  }
+
+  _dispatchMessage(messageString) {
+    var messageObject = JSON.parse(messageString);
+    if (InspectorTest._dumpInspectorProtocolMessages)
+      utils2.print("backend: " + JSON.stringify(messageObject));
+    const kMethodNotFound = -32601;
+    if (messageObject.error && messageObject.error.code === kMethodNotFound) {
+      InspectorTest.log(`Error: Called non-existent method. ${
+          messageObject.error.message} code: ${messageObject.error.code}`);
+      InspectorTest.completeTest();
+    }
+    try {
+      var messageId = messageObject["id"];
+      if (typeof messageId === "number") {
+        var handler = this._dispatchTable.get(messageId);
+        if (handler) {
+          handler(messageObject);
+          this._dispatchTable.delete(messageId);
+        }
+      } else {
+        var eventName = messageObject["method"];
+        var eventHandler = this._eventHandlers.get(eventName);
+        if (this._scriptMap && eventName === "Debugger.scriptParsed")
+          this._scriptMap.set(messageObject.params.scriptId, JSON.parse(JSON.stringify(messageObject.params)));
+        if (eventName === "Debugger.scriptParsed" && messageObject.params.url === "wait-for-pending-tasks.js")
+          return;
+        if (eventHandler)
+          eventHandler(messageObject);
+      }
+    } catch (e) {
+      InspectorTest.log("Exception when dispatching message: " + e + "\n" + e.stack + "\n message = " + JSON.stringify(messageObject, null, 2));
+      InspectorTest.completeTest();
+    } var session = contextGroup.connect();
+    return { session: session, contextGroup: contextGroup, Protocol: session.Protocol };
+  } catch (e) {
+    utils2.print(e.stack);
+  }
+}
+// Copyright 2017 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+InspectorTest.log('Checks createContext().');
+
+var executionContextIds = new Set();
+var contextGroup1 = new InspectorTest.ContextGroup();
+var session1 = contextGroup1.connect();
+setup(session1);
+var contextGroup2 = new InspectorTest.ContextGroup();
+var session2 = contextGroup2.connect();
+setup(session2);
+
+session1.Protocol.Runtime.enable()
+  .then(() => session2.Protocol.Runtime.enable({}))
+  .then(() => session1.Protocol.Debugger.enable())
+  .then(() => session2.Protocol.Debugger.enable({}))
+  .then(InspectorTest.logMessage)
+  .then(() => {
+    session1.Protocol.Runtime.evaluate({ expression: 'debugger;' });
+    session2.Protocol.Runtime.evaluate({expression: 'setTimeout(x => x * 2, 0)'});
+    session1.Protocol.Runtime.evaluate({ expression: 'setTimeout(x => x * 3, 0)' });
+  })
+  .then(() => InspectorTest.waitForPendingTasks())
+  .then(() => {
+    InspectorTest.log(`Reported script's execution id: ${executionContextIds.size}`);
+    executionContextIds.clear();
+  })
+  .then(() => session1.reconnect())
+  .then(() => session2.reconnect())
+  .then(() => {
+    session1.Protocol.Runtime.evaluate({ expression: 'debugger;' })
+    session2.Protocol.Runtime.evaluate({ expression: 'setTimeout(x => x * 2, 0)' });
+    session1.Protocol.Runtime.evaluate({ expression: 'setTimeout(x => x * 3, 0)' });
+  })
+  .then(() => InspectorTest.waitForPendingTasks())
+  .then(() => session2.Protocol.Debugger.disable({}))
+  .then(() => session1.Protocol.Debugger.disable({}))
+  .then(() => InspectorTest.log(`Reported script's execution id: ${executionContextIds.size}`))
+  .then(InspectorTest.completeTest);
+
+function setup(session) {
+  session.Protocol.Runtime.onExecutionContextCreated(InspectorTest.logMessage);
+  session.setupScriptMap();
+  session.Protocol.Debugger.onPaused((message) => {
+    session.logSourceLocation(message.params.callFrames[5].location);
+    session.Protocol.Debugger.stepOut();
+  });
+  session.Protocol.Debugger.onScriptParsed(message => executionContextIds.add(message.params.executionContextId));
+}
+
diff --git a/deps/v8/test/fuzzer/multi-return.cc b/deps/v8/test/fuzzer/multi-return.cc
index e54e095cb1a762..a21ef730462060 100644
--- a/deps/v8/test/fuzzer/multi-return.cc
+++ b/deps/v8/test/fuzzer/multi-return.cc
@@ -160,7 +160,7 @@ extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
   InputProvider input(data, size);
   // Create randomized descriptor.
   size_t param_count = input.NumNonZeroBytes(0, kNumTypes);
-  if (param_count > InstructionStream::kMaxArguments) return 0;
+  if (param_count > wasm::kV8MaxWasmFunctionParams) return 0;
 
   size_t return_count = input.NumNonZeroBytes(param_count + 1, kNumTypes);
   if (return_count > wasm::kV8MaxWasmFunctionReturns) return 0;
@@ -246,9 +246,9 @@ extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
           .ToHandleChecked();
 
   std::shared_ptr<wasm::NativeModule> module =
-      AllocateNativeModule(i_isolate, code->InstructionSize());
+      AllocateNativeModule(i_isolate, code->instruction_size());
   wasm::WasmCodeRefScope wasm_code_ref_scope;
-  byte* code_start = module->AddCodeForTesting(code)->instructions().begin();
+  uint8_t* code_start = module->AddCodeForTesting(code)->instructions().begin();
   // Generate wrapper.
   int expect = 0;
 
diff --git a/deps/v8/test/fuzzer/parser.cc b/deps/v8/test/fuzzer/parser.cc
index ea64fb31face95..3f158f309f5170 100644
--- a/deps/v8/test/fuzzer/parser.cc
+++ b/deps/v8/test/fuzzer/parser.cc
@@ -13,7 +13,9 @@
 #include "include/v8-exception.h"
 #include "include/v8-isolate.h"
 #include "include/v8-local-handle.h"
+#include "src/common/globals.h"
 #include "src/execution/isolate.h"
+#include "src/objects/string.h"
 #include "src/parsing/parse-info.h"
 #include "src/parsing/parsing.h"
 #include "test/fuzzer/fuzzer-support.h"
diff --git a/deps/v8/test/fuzzer/regexp-builtins.cc b/deps/v8/test/fuzzer/regexp-builtins.cc
deleted file mode 100644
index 2d939f6fb0b96e..00000000000000
--- a/deps/v8/test/fuzzer/regexp-builtins.cc
+++ /dev/null
@@ -1,485 +0,0 @@
-// Copyright 2017 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include <limits.h>
-#include <stddef.h>
-#include <stdint.h>
-
-#include <functional>
-#include <string>
-
-#include "include/v8-exception.h"
-#include "include/v8-isolate.h"
-#include "include/v8-local-handle.h"
-#include "include/v8-primitive.h"
-#include "include/v8-script.h"
-#include "src/objects/objects-inl.h"
-#include "src/regexp/regexp.h"
-#include "test/fuzzer/fuzzer-support.h"
-
-// This is a hexdump of test/fuzzer/regexp_builtins/mjsunit.js generated using
-// `xxd -i mjsunit.js`. It contains the `assertEquals` JS function used below.
-#include "test/fuzzer/regexp_builtins/mjsunit.js.h"
-
-namespace v8 {
-namespace internal {
-namespace {
-
-constexpr bool kVerbose = false;  // For debugging, verbose error messages.
-constexpr uint32_t kRegExpBuiltinsFuzzerHashSeed = 83;
-
-#define REGEXP_BUILTINS(V)   \
-  V(Exec, exec)              \
-  V(Match, Symbol.match)     \
-  V(Replace, Symbol.replace) \
-  V(Search, Symbol.search)   \
-  V(Split, Symbol.split)     \
-  V(Test, test)
-
-struct FuzzerArgs {
-  FuzzerArgs(const uint8_t* input_data, size_t input_length,
-             v8::Local<v8::Context> context, Isolate* isolate)
-      : input_cursor(0),
-        input_data(input_data),
-        input_length(input_length),
-        context(context),
-        isolate(isolate) {}
-
-  size_t input_cursor;
-  const uint8_t* const input_data;
-  const size_t input_length;
-  v8::Local<v8::Context> context;
-  Isolate* const isolate;
-};
-
-enum RegExpBuiltin {
-#define CASE(name, ...) kRegExpPrototype##name,
-  REGEXP_BUILTINS(CASE)
-#undef CASE
-      kRegExpBuiltinCount,
-};
-
-#define CASE(name, ...) void TestRegExpPrototype##name(FuzzerArgs* args);
-REGEXP_BUILTINS(CASE)
-#undef CASE
-
-v8::Local<v8::String> v8_str(v8::Isolate* isolate, const char* s) {
-  return v8::String::NewFromUtf8(isolate, s).ToLocalChecked();
-}
-
-v8::MaybeLocal<v8::Value> CompileRun(v8::Local<v8::Context> context,
-                                     const char* source) {
-  v8::Local<v8::Script> script;
-  v8::MaybeLocal<v8::Script> maybe_script =
-      v8::Script::Compile(context, v8_str(context->GetIsolate(), source));
-
-  if (!maybe_script.ToLocal(&script)) return v8::MaybeLocal<v8::Value>();
-  return script->Run(context);
-}
-
-uint8_t RandomByte(FuzzerArgs* args) {
-  // Silently wraps to the beginning of input data. Ideally, input data should
-  // be long enough to avoid that.
-  const size_t index = args->input_cursor;
-  CHECK(index < args->input_length);
-  args->input_cursor = (index + 1) % args->input_length;
-  return args->input_data[index];
-}
-
-void CompileMjsunit(const FuzzerArgs* args) {
-  std::string source(
-      reinterpret_cast<const char*>(test_fuzzer_regexp_builtins_mjsunit_js),
-      test_fuzzer_regexp_builtins_mjsunit_js_len);
-  CompileRun(args->context, source.c_str()).ToLocalChecked();
-}
-
-std::string NaiveEscape(const std::string& input, char escaped_char) {
-  std::string out;
-  for (size_t i = 0; i < input.size(); i++) {
-    // Just omit newlines and \0 chars and naively replace other escaped chars.
-    const char c = input[i];
-    if (c == '\r' || c == '\n' || c == '\0') continue;
-    out += (input[i] == escaped_char) ? '_' : c;
-  }
-  // Disallow trailing backslashes as they mess with our naive source string
-  // concatenation.
-  if (!out.empty() && out.back() == '\\') out.back() = '_';
-
-  return out;
-}
-
-std::string GenerateRandomString(FuzzerArgs* args, size_t length) {
-  // Limited to an ASCII subset for now.
-  std::string s(length, '\0');
-  for (size_t i = 0; i < length; i++) {
-    s[i] = static_cast<char>((RandomByte(args) % 0x5F) + 0x20);
-  }
-
-  return s;
-}
-
-std::string GenerateRandomPattern(FuzzerArgs* args) {
-  const int kMaxPatternLength = 16;
-  std::string s =
-      GenerateRandomString(args, (RandomByte(args) % kMaxPatternLength) + 1);
-  // A leading '*' would be a comment instead of a regexp literal.
-  if (s[0] == '*') s[0] = '.';
-  return s;
-}
-
-std::string PickRandomPresetPattern(FuzzerArgs* args) {
-  static const char* preset_patterns[] = {
-      ".",         // Always matches.
-      "\\P{Any}",  // Never matches.
-      "^",         // Zero-width assertion, matches once.
-      "(?=.)",     // Zero-width assertion, matches at every position.
-      "\\b",       // Zero-width assertion, matches at each word boundary.
-      "()",      // Zero-width assertion, matches at every position with groups.
-      "(?<a>)",  // Likewise but with named groups.
-      "((((.).).).)", "(?<a>(?<b>(?<c>(?<d>.).).).)",
-      // Copied from
-      // https://cs.chromium.org/chromium/src/testing/libfuzzer/fuzzers/dicts/regexp.dict
-      "?", "abc", "()", "[]", "abc|def", "abc|def|ghi", "^xxx$",
-      "ab\\b\\d\\bcd", "\\w|\\d", "a*?", "abc+", "abc+?", "xyz?", "xyz??",
-      "xyz{0,1}", "xyz{0,1}?", "xyz{93}", "xyz{1,32}", "xyz{1,32}?", "xyz{1,}",
-      "xyz{1,}?", "a\\fb\\nc\\rd\\te\\vf", "a\\nb\\bc", "(?:foo)", "(?: foo )",
-      "foo|(bar|baz)|quux", "foo(?=bar)baz", "foo(?!bar)baz", "foo(?<=bar)baz",
-      "foo(?<!bar)baz", "()", "(?=)", "[]", "[x]", "[xyz]", "[a-zA-Z0-9]",
-      "[-123]", "[^123]", "]", "}", "[a-b-c]", "[x\\dz]", "[\\d-z]",
-      "[\\d-\\d]", "[z-\\d]", "\\cj\\cJ\\ci\\cI\\ck\\cK", "\\c!", "\\c_",
-      "\\c~", "[\\c!]", "[\\c_]", "[\\c~]", "[\\ca]", "[\\cz]", "[\\cA]",
-      "[\\cZ]", "[\\c1]", "\\[\\]\\{\\}\\(\\)\\%\\^\\#\\ ",
-      "[\\[\\]\\{\\}\\(\\)\\%\\^\\#\\ ]", "\\8", "\\9", "\\11", "\\11a",
-      "\\011", "\\118", "\\111", "\\1111", "(x)(x)(x)\\1", "(x)(x)(x)\\2",
-      "(x)(x)(x)\\3", "(x)(x)(x)\\4", "(x)(x)(x)\\1*", "(x)(x)(x)\\3*",
-      "(x)(x)(x)\\4*", "(x)(x)(x)(x)(x)(x)(x)(x)(x)(x)\\10",
-      "(x)(x)(x)(x)(x)(x)(x)(x)(x)(x)\\11", "(a)\\1", "(a\\1)", "(\\1a)",
-      "(\\2)(\\1)", "(?=a){0,10}a", "(?=a){1,10}a", "(?=a){9,10}a", "(?!a)?a",
-      "\\1(a)", "(?!(a))\\1", "(?!\\1(a\\1)\\1)\\1",
-      "\\1\\2(a(?:\\1(b\\1\\2))\\2)\\1", "[\\0]", "[\\11]", "[\\11a]",
-      "[\\011]", "[\\00011]", "[\\118]", "[\\111]", "[\\1111]", "\\x60",
-      "\\x3z", "\\c", "\\u0034", "\\u003z", "foo[z]*", "\\u{12345}",
-      "\\u{12345}\\u{23456}", "\\u{12345}{3}", "\\u{12345}*", "\\ud808\\udf45*",
-      "[\\ud808\\udf45-\\ud809\\udccc]", "a", "a|b", "a\\n", "a$", "a\\b!",
-      "a\\Bb", "a*?", "a?", "a??", "a{0,1}?", "a{1,2}?", "a+?", "(a)", "(a)\\1",
-      "(\\1a)", "\\1(a)", "a\\s", "a\\S", "a\\D", "a\\w", "a\\W", "a.", "a\\q",
-      "a[a]", "a[^a]", "a[a-z]", "a(?:b)", "a(?=b)", "a(?!b)", "\\x60",
-      "\\u0060", "\\cA", "\\q", "\\1112", "(a)\\1", "(?!a)?a\\1",
-      "(?:(?=a))a\\1", "a{}", "a{,}", "a{", "a{z}", "a{12z}", "a{12,",
-      "a{12,3b", "{}", "{,}", "{", "{z}", "{1z}", "{12,", "{12,3b", "a", "abc",
-      "a[bc]d", "a|bc", "ab|c", "a||bc", "(?:ab)", "(?:ab|cde)", "(?:ab)|cde",
-      "(ab)", "(ab|cde)", "(ab)\\1", "(ab|cde)\\1", "(?:ab)?", "(?:ab)+", "a?",
-      "a+", "a??", "a*?", "a+?", "(?:a?)?", "(?:a+)?", "(?:a?)+", "(?:a*)+",
-      "(?:a+)+", "(?:a?)*", "(?:a*)*", "(?:a+)*", "a{0}", "(?:a+){0,0}", "a*b",
-      "a+b", "a*b|c", "a+b|c", "(?:a{5,1000000}){3,1000000}", "(?:ab){4,7}",
-      "a\\bc", "a\\sc", "a\\Sc", "a(?=b)c", "a(?=bbb|bb)c", "a(?!bbb|bb)c",
-      "\xe2\x81\xa3", "[\xe2\x81\xa3]", "\xed\xb0\x80", "\xed\xa0\x80",
-      "(\xed\xb0\x80)\x01", "((\xed\xa0\x80))\x02", "\xf0\x9f\x92\xa9", "\x01",
-      "\x0f", "[-\xf0\x9f\x92\xa9]+", "[\xf0\x9f\x92\xa9-\xf4\x8f\xbf\xbf]",
-      "(?<=)", "(?<=a)", "(?<!)", "(?<!a)", "(?<a>)", "(?<a>.)",
-      "(?<a>.)\\k<a>", "\\p{Script=Greek}", "\\P{sc=Greek}",
-      "\\p{Script_Extensions=Greek}", "\\P{scx=Greek}",
-      "\\p{General_Category=Decimal_Number}", "\\P{gc=Decimal_Number}",
-      "\\p{gc=Nd}", "\\P{Decimal_Number}", "\\p{Nd}", "\\P{Any}",
-      "\\p{Changes_When_NFKC_Casefolded}",
-      "[\\p{Script_Extensions=Greek}--[α-γ]]",
-      "[\\p{Script_Extensions=Mongolian}&&\\p{Number}]",
-      "[\\q{abc|def|0|5}--\\d]",
-  };
-  static constexpr int preset_pattern_count = arraysize(preset_patterns);
-  static_assert(preset_pattern_count < 0xFF);
-
-  return std::string(preset_patterns[RandomByte(args) % preset_pattern_count]);
-}
-
-std::string PickPattern(FuzzerArgs* args) {
-  if ((RandomByte(args) & 3) == 0) {
-    return NaiveEscape(GenerateRandomPattern(args), '/');
-  } else {
-    return PickRandomPresetPattern(args);
-  }
-}
-
-std::string GenerateRandomString(FuzzerArgs* args) {
-  const int kMaxStringLength = 64;
-  return GenerateRandomString(args, RandomByte(args) % kMaxStringLength);
-}
-
-std::string PickSubjectString(FuzzerArgs* args) {
-  if ((RandomByte(args) & 0xF) == 0) {
-    // Sometimes we have a two-byte subject string.
-    return "f\\uD83D\\uDCA9ba\\u2603";
-  } else {
-    return NaiveEscape(GenerateRandomString(args), '\'');
-  }
-}
-
-std::string PickReplacementForReplace(FuzzerArgs* args) {
-  static const char* candidates[] = {
-      "'X'",
-      "'$1$2$3'",
-      "'$$$&$`$\\'$1'",
-      "() => 'X'",
-      "(arg0, arg1, arg2, arg3, arg4) => arg0 + arg1 + arg2 + arg3 + arg4",
-      "() => 42",
-  };
-  static const int candidate_count = arraysize(candidates);
-
-  if ((RandomByte(args) & 1) == 0) {
-    return candidates[RandomByte(args) % candidate_count];
-  } else {
-    return std::string("'") + NaiveEscape(GenerateRandomString(args), '\'') +
-           std::string("'");
-  }
-}
-
-std::string PickLimitForSplit(FuzzerArgs* args) {
-  // clang-format off
-  switch (RandomByte(args) & 0x3) {
-  case 0: return "undefined";
-  case 1: return "'not a number'";
-  case 2: return std::to_string(Smi::kMaxValue + RandomByte(args));
-  case 3: return std::to_string(RandomByte(args));
-  default: UNREACHABLE();
-  }  // clang-format on
-}
-
-std::string GenerateRandomFlags(FuzzerArgs* args) {
-  constexpr int kFlagCount = JSRegExp::kFlagCount;
-  static_assert((1 << kFlagCount) - 1 <= 0xFFFF);
-
-  // TODO(mbid,v8:10765): Find a way to generate the kLinear flag sometimes,
-  // but only for patterns that are supported by the experimental engine.
-  constexpr int kFuzzableFlagCount = kFlagCount - 1;
-  constexpr uint32_t kFuzzableFlagsMask =
-      ((1 << kFlagCount) - 1) & (~JSRegExp::kLinear);
-
-  const uint8_t byte1 = RandomByte(args);
-  const uint8_t byte2 = RandomByte(args);
-  const uint16_t random_two_byte = (byte1 << 8) | byte2;
-
-  uint32_t flags = random_two_byte & kFuzzableFlagsMask;
-
-  int cursor = 0;
-  char buffer[kFuzzableFlagCount] = {'\0'};
-
-  // 'u' and 'v' are incompatible. If both are set randomly, clear
-  // one based on the random bit of the (unused) JSRegExp::kLinar flag.
-  if ((flags & JSRegExp::kUnicode) && (flags & JSRegExp::kUnicodeSets)) {
-    const bool rand_bit = random_two_byte & JSRegExp::kLinear;
-    flags &= rand_bit ? ~JSRegExp::kUnicode : ~JSRegExp::kUnicodeSets;
-  }
-  DCHECK(RegExp::VerifyFlags(RegExpFlags{static_cast<int>(flags)}));
-
-  if (flags & JSRegExp::kGlobal) buffer[cursor++] = 'g';
-  if (flags & JSRegExp::kIgnoreCase) buffer[cursor++] = 'i';
-  if (flags & JSRegExp::kMultiline) buffer[cursor++] = 'm';
-  if (flags & JSRegExp::kSticky) buffer[cursor++] = 'y';
-  if (flags & JSRegExp::kUnicode) buffer[cursor++] = 'u';
-  if (flags & JSRegExp::kDotAll) buffer[cursor++] = 's';
-  CHECK_EQ(flags & JSRegExp::kLinear, 0);
-  if (flags & JSRegExp::kHasIndices) buffer[cursor++] = 'd';
-  if (flags & JSRegExp::kUnicodeSets) buffer[cursor++] = 'v';
-
-  return std::string(buffer, cursor);
-}
-
-std::string GenerateRandomLastIndex(FuzzerArgs* args) {
-  static const char* candidates[] = {
-      "undefined",  "-1",         "0",
-      "1",          "2",          "3",
-      "4",          "5",          "6",
-      "7",          "8",          "9",
-      "50",         "4294967296", "2147483647",
-      "2147483648", "NaN",        "Not a Number",
-  };
-  static const int candidate_count = arraysize(candidates);
-  return candidates[RandomByte(args) % candidate_count];
-}
-
-void RunTest(FuzzerArgs* args) {
-  switch (RandomByte(args) % kRegExpBuiltinCount) {
-#define CASE(name, ...)              \
-  case kRegExpPrototype##name:       \
-    TestRegExpPrototype##name(args); \
-    break;
-    REGEXP_BUILTINS(CASE)
-#undef CASE
-    default:
-      UNREACHABLE();
-  }
-}
-
-std::string GenerateSourceString(FuzzerArgs* args, const std::string& test) {
-  std::string pattern = PickPattern(args);
-  std::string flags = GenerateRandomFlags(args);
-  std::string last_index = GenerateRandomLastIndex(args);
-  std::string subject = PickSubjectString(args);
-
-  // clang-format off
-  std::stringstream ss;
-  ss << "function test() {\n"
-     << "  const re = /" << pattern<< "/"
-                         << flags << ";\n"
-     << "  re.lastIndex = " << last_index << ";\n"
-     << "  const str = '" << subject << "';\n"
-     << "  let result = null;\n"
-     << "  let exception = null;\n"
-     << "  try {\n"
-     << "    result = " << test << "\n"
-     << "  } catch (e) {\n"
-     << "    exception = e;\n"
-     << "  }\n"
-     << "  return { result: result, re: re, exception: exception };\n"
-     << "}\n"
-     << "%SetForceSlowPath(false);\n"
-     << "test();  // Run once ahead of time to compile the regexp.\n"
-     << "const fast = test();\n"
-     << "%SetForceSlowPath(true);\n"
-     << "const slow = test();\n"
-     << "%SetForceSlowPath(false);\n";
-  // clang-format on
-
-  std::string source = ss.str();
-  if (kVerbose) {
-    fprintf(stderr, "Generated source:\n```\n%s\n```\n", source.c_str());
-  }
-
-  return source;
-}
-
-void PrintExceptionMessage(v8::Isolate* isolate, v8::TryCatch* try_catch) {
-  CHECK(try_catch->HasCaught());
-  static const int kBufferLength = 256;
-  char buffer[kBufferLength + 1];
-  try_catch->Message()->Get()->WriteOneByte(
-      isolate, reinterpret_cast<uint8_t*>(&buffer[0]), 0, kBufferLength);
-  fprintf(stderr, "%s\n", buffer);
-}
-
-bool ResultsAreIdentical(FuzzerArgs* args) {
-  std::string source =
-      "assertEquals(fast.exception, slow.exception);\n"
-      "assertEquals(fast.result, slow.result);\n"
-      "if (fast.result !== null) {\n"
-      "  assertEquals(fast.result.groups, slow.result.groups);\n"
-      "  assertEquals(fast.result.indices, slow.result.indices);\n"
-      "  if (fast.result.indices !== undefined) {\n"
-      "    assertEquals(fast.result.indices.groups,\n"
-      "                 slow.result.indices.groups);\n"
-      "  }\n"
-      "}\n"
-      "assertEquals(fast.re.lastIndex, slow.re.lastIndex);\n";
-
-  v8::Local<v8::Value> result;
-  v8::Isolate* isolate = reinterpret_cast<v8::Isolate*>(args->isolate);
-  v8::TryCatch try_catch(isolate);
-  if (!CompileRun(args->context, source.c_str()).ToLocal(&result)) {
-    PrintExceptionMessage(isolate, &try_catch);
-    args->isolate->clear_pending_exception();
-    return false;
-  }
-
-  return true;
-}
-
-void CompileRunAndVerify(FuzzerArgs* args, const std::string& source) {
-  v8::Local<v8::Value> result;
-  v8::Isolate* isolate = reinterpret_cast<v8::Isolate*>(args->isolate);
-  v8::TryCatch try_catch(isolate);
-  if (!CompileRun(args->context, source.c_str()).ToLocal(&result)) {
-    args->isolate->clear_pending_exception();
-    // No need to verify result if an exception was thrown here, since that
-    // implies a syntax error somewhere in the pattern or string. We simply
-    // ignore those.
-    if (kVerbose) {
-      PrintExceptionMessage(isolate, &try_catch);
-      fprintf(stderr, "Failed to run script:\n```\n%s\n```\n", source.c_str());
-    }
-    return;
-  }
-
-  if (!ResultsAreIdentical(args)) {
-    uint32_t raw_hash_field = StringHasher::HashSequentialString(
-        args->input_data, static_cast<int>(args->input_length),
-        kRegExpBuiltinsFuzzerHashSeed);
-    FATAL("!ResultAreIdentical(args); RegExpBuiltinsFuzzerHash=%x",
-          raw_hash_field);
-  }
-}
-
-void TestRegExpPrototypeExec(FuzzerArgs* args) {
-  std::string test = "re.exec(str);";
-  std::string source = GenerateSourceString(args, test);
-  CompileRunAndVerify(args, source);
-}
-
-void TestRegExpPrototypeMatch(FuzzerArgs* args) {
-  std::string test = "re[Symbol.match](str);";
-  std::string source = GenerateSourceString(args, test);
-  CompileRunAndVerify(args, source);
-}
-
-void TestRegExpPrototypeReplace(FuzzerArgs* args) {
-  std::string replacement = PickReplacementForReplace(args);
-  std::string test = "re[Symbol.replace](str, " + replacement + ");";
-  std::string source = GenerateSourceString(args, test);
-  CompileRunAndVerify(args, source);
-}
-
-void TestRegExpPrototypeSearch(FuzzerArgs* args) {
-  std::string test = "re[Symbol.search](str);";
-  std::string source = GenerateSourceString(args, test);
-  CompileRunAndVerify(args, source);
-}
-
-void TestRegExpPrototypeSplit(FuzzerArgs* args) {
-  std::string limit = PickLimitForSplit(args);
-  std::string test = "re[Symbol.split](str, " + limit + ");";
-  std::string source = GenerateSourceString(args, test);
-  CompileRunAndVerify(args, source);
-}
-
-void TestRegExpPrototypeTest(FuzzerArgs* args) {
-  std::string test = "re.test(str);";
-  std::string source = GenerateSourceString(args, test);
-  CompileRunAndVerify(args, source);
-}
-
-#undef REGEXP_BUILTINS
-
-}  // namespace
-
-extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
-  if (size < 64) return 0;  // Need a minimal amount of randomness to do stuff.
-
-  // Flag definitions.
-
-  v8_flags.allow_natives_syntax = true;
-
-  // V8 setup.
-
-  v8_fuzzer::FuzzerSupport* support = v8_fuzzer::FuzzerSupport::Get();
-  v8::Isolate* isolate = support->GetIsolate();
-  Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate);
-  v8::Isolate::Scope isolate_scope(isolate);
-  v8::HandleScope handle_scope(isolate);
-  v8::Local<v8::Context> context = support->GetContext();
-  v8::Context::Scope context_scope(context);
-  v8::TryCatch try_catch(isolate);
-
-  CHECK(!i_isolate->has_pending_exception());
-
-  // And run.
-
-  FuzzerArgs args(data, size, context, i_isolate);
-  CompileMjsunit(&args);
-  RunTest(&args);
-
-  CHECK(!i_isolate->has_pending_exception());
-  return 0;
-}
-
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/fuzzer/regexp_builtins/mjsunit.js b/deps/v8/test/fuzzer/regexp_builtins/mjsunit.js
deleted file mode 100644
index 53795dc63d9cb4..00000000000000
--- a/deps/v8/test/fuzzer/regexp_builtins/mjsunit.js
+++ /dev/null
@@ -1,188 +0,0 @@
-// Copyright 2017 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Stripped-down version of test/mjsunit/mjsunit.js that only contains
-// assertEquals.S
-var assertEquals;
-
-(function () {
-  var ObjectPrototypeToString = Object.prototype.toString;
-  var NumberPrototypeValueOf = Number.prototype.valueOf;
-  var BooleanPrototypeValueOf = Boolean.prototype.valueOf;
-  var StringPrototypeValueOf = String.prototype.valueOf;
-  var DatePrototypeValueOf = Date.prototype.valueOf;
-  var RegExpPrototypeToString = RegExp.prototype.toString;
-  var ArrayPrototypeForEach = Array.prototype.forEach;
-  var ArrayPrototypeJoin = Array.prototype.join;
-  var ArrayPrototypeMap = Array.prototype.map;
-  var ArrayPrototypePush = Array.prototype.push;
-
-  var BigIntPrototypeValueOf;
-  try {
-    BigIntPrototypeValueOf = BigInt.prototype.valueOf;
-  } catch(e) {}
-
-  function classOf(object) {
-    var string = ObjectPrototypeToString.call(object);
-    return string.substring(8, string.length - 1);
-  }
-
-  function ValueOf(value) {
-    switch (classOf(value)) {
-      case "Number":
-        return NumberPrototypeValueOf.call(value);
-      case "BigInt":
-        return BigIntPrototypeValueOf.call(value);
-      case "String":
-        return StringPrototypeValueOf.call(value);
-      case "Boolean":
-        return BooleanPrototypeValueOf.call(value);
-      case "Date":
-        return DatePrototypeValueOf.call(value);
-      default:
-        return value;
-    }
-  }
-
-
-  function PrettyPrint(value) {
-    switch (typeof value) {
-      case "string":
-        return JSON.stringify(value);
-      case "bigint":
-        return String(value) + "n";
-      case "number":
-        if (value === 0 && (1 / value) < 0) return "-0";
-        // FALLTHROUGH.
-      case "boolean":
-      case "undefined":
-      case "function":
-      case "symbol":
-        return String(value);
-      case "object":
-        if (value === null) return "null";
-        var objectClass = classOf(value);
-        switch (objectClass) {
-          case "Number":
-          case "BigInt":
-          case "String":
-          case "Boolean":
-          case "Date":
-            return objectClass + "(" + PrettyPrint(ValueOf(value)) + ")";
-          case "RegExp":
-            return RegExpPrototypeToString.call(value);
-          case "Array":
-            var mapped = ArrayPrototypeMap.call(value, PrettyPrintArrayElement);
-            var joined = ArrayPrototypeJoin.call(mapped, ",");
-            return "[" + joined + "]";
-          case "Uint8Array":
-          case "Int8Array":
-          case "Int16Array":
-          case "Uint16Array":
-          case "Uint32Array":
-          case "Int32Array":
-          case "Float32Array":
-          case "Float64Array":
-            var joined = ArrayPrototypeJoin.call(value, ",");
-            return objectClass + "([" + joined + "])";
-          case "Object":
-            break;
-          default:
-            return objectClass + "()";
-        }
-        var name = value.constructor.name;
-        if (name) return name + "()";
-        return "Object()";
-      default:
-        return "-- unknown value --";
-    }
-  }
-
-  function PrettyPrintArrayElement(value, index, array) {
-    if (value === undefined && !(index in array)) return "";
-    return PrettyPrint(value);
-  }
-
-  failWithMessage = function failWithMessage(message) {
-    throw new Error(message);
-  }
-
-  function formatFailureText(expectedText, found, name_opt) {
-    var message = "Fail" + "ure";
-    if (name_opt) {
-      message += " (" + name_opt + ")";
-    }
-
-    var foundText = PrettyPrint(found);
-    if (expectedText.length <= 40 && foundText.length <= 40) {
-      message += ": expected <" + expectedText + "> found <" + foundText + ">";
-    } else {
-      message += ":\nexpected:\n" + expectedText + "\nfound:\n" + foundText;
-    }
-    return message;
-  }
-
-  function fail(expectedText, found, name_opt) {
-    return failWithMessage(formatFailureText(expectedText, found, name_opt));
-  }
-
-  function deepObjectEquals(a, b) {
-    var aProps = Object.keys(a);
-    aProps.sort();
-    var bProps = Object.keys(b);
-    bProps.sort();
-    if (!deepEquals(aProps, bProps)) {
-      return false;
-    }
-    for (var i = 0; i < aProps.length; i++) {
-      if (!deepEquals(a[aProps[i]], b[aProps[i]])) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  function deepEquals(a, b) {
-    if (a === b) {
-      // Check for -0.
-      if (a === 0) return (1 / a) === (1 / b);
-      return true;
-    }
-    if (typeof a !== typeof b) return false;
-    if (typeof a === "number") return isNaN(a) && isNaN(b);
-    if (typeof a !== "object" && typeof a !== "function") return false;
-    // Neither a nor b is primitive.
-    var objectClass = classOf(a);
-    if (objectClass !== classOf(b)) return false;
-    if (objectClass === "RegExp") {
-      // For RegExp, just compare pattern and flags using its toString.
-      return RegExpPrototypeToString.call(a) ===
-             RegExpPrototypeToString.call(b);
-    }
-    // Functions are only identical to themselves.
-    if (objectClass === "Function") return false;
-    if (objectClass === "Array") {
-      var elementCount = 0;
-      if (a.length !== b.length) {
-        return false;
-      }
-      for (var i = 0; i < a.length; i++) {
-        if (!deepEquals(a[i], b[i])) return false;
-      }
-      return true;
-    }
-    if (objectClass === "String" || objectClass === "Number" ||
-      objectClass === "BigInt" || objectClass === "Boolean" ||
-      objectClass === "Date") {
-      if (ValueOf(a) !== ValueOf(b)) return false;
-    }
-    return deepObjectEquals(a, b);
-  }
-
-  assertEquals = function assertEquals(expected, found, name_opt) {
-    if (!deepEquals(found, expected)) {
-      fail(PrettyPrint(expected), found, name_opt);
-    }
-  };
-})();
diff --git a/deps/v8/test/fuzzer/regexp_builtins/mjsunit.js.h b/deps/v8/test/fuzzer/regexp_builtins/mjsunit.js.h
deleted file mode 100644
index 696e3b9eca6a8b..00000000000000
--- a/deps/v8/test/fuzzer/regexp_builtins/mjsunit.js.h
+++ /dev/null
@@ -1,496 +0,0 @@
-// Copyright 2017 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-unsigned char test_fuzzer_regexp_builtins_mjsunit_js[] = {
-  0x2f, 0x2f, 0x20, 0x43, 0x6f, 0x70, 0x79, 0x72, 0x69, 0x67, 0x68, 0x74,
-  0x20, 0x32, 0x30, 0x31, 0x37, 0x20, 0x74, 0x68, 0x65, 0x20, 0x56, 0x38,
-  0x20, 0x70, 0x72, 0x6f, 0x6a, 0x65, 0x63, 0x74, 0x20, 0x61, 0x75, 0x74,
-  0x68, 0x6f, 0x72, 0x73, 0x2e, 0x20, 0x41, 0x6c, 0x6c, 0x20, 0x72, 0x69,
-  0x67, 0x68, 0x74, 0x73, 0x20, 0x72, 0x65, 0x73, 0x65, 0x72, 0x76, 0x65,
-  0x64, 0x2e, 0x0a, 0x2f, 0x2f, 0x20, 0x55, 0x73, 0x65, 0x20, 0x6f, 0x66,
-  0x20, 0x74, 0x68, 0x69, 0x73, 0x20, 0x73, 0x6f, 0x75, 0x72, 0x63, 0x65,
-  0x20, 0x63, 0x6f, 0x64, 0x65, 0x20, 0x69, 0x73, 0x20, 0x67, 0x6f, 0x76,
-  0x65, 0x72, 0x6e, 0x65, 0x64, 0x20, 0x62, 0x79, 0x20, 0x61, 0x20, 0x42,
-  0x53, 0x44, 0x2d, 0x73, 0x74, 0x79, 0x6c, 0x65, 0x20, 0x6c, 0x69, 0x63,
-  0x65, 0x6e, 0x73, 0x65, 0x20, 0x74, 0x68, 0x61, 0x74, 0x20, 0x63, 0x61,
-  0x6e, 0x20, 0x62, 0x65, 0x0a, 0x2f, 0x2f, 0x20, 0x66, 0x6f, 0x75, 0x6e,
-  0x64, 0x20, 0x69, 0x6e, 0x20, 0x74, 0x68, 0x65, 0x20, 0x4c, 0x49, 0x43,
-  0x45, 0x4e, 0x53, 0x45, 0x20, 0x66, 0x69, 0x6c, 0x65, 0x2e, 0x0a, 0x0a,
-  0x2f, 0x2f, 0x20, 0x53, 0x74, 0x72, 0x69, 0x70, 0x70, 0x65, 0x64, 0x2d,
-  0x64, 0x6f, 0x77, 0x6e, 0x20, 0x76, 0x65, 0x72, 0x73, 0x69, 0x6f, 0x6e,
-  0x20, 0x6f, 0x66, 0x20, 0x74, 0x65, 0x73, 0x74, 0x2f, 0x6d, 0x6a, 0x73,
-  0x75, 0x6e, 0x69, 0x74, 0x2f, 0x6d, 0x6a, 0x73, 0x75, 0x6e, 0x69, 0x74,
-  0x2e, 0x6a, 0x73, 0x20, 0x74, 0x68, 0x61, 0x74, 0x20, 0x6f, 0x6e, 0x6c,
-  0x79, 0x20, 0x63, 0x6f, 0x6e, 0x74, 0x61, 0x69, 0x6e, 0x73, 0x0a, 0x2f,
-  0x2f, 0x20, 0x61, 0x73, 0x73, 0x65, 0x72, 0x74, 0x45, 0x71, 0x75, 0x61,
-  0x6c, 0x73, 0x2e, 0x53, 0x0a, 0x76, 0x61, 0x72, 0x20, 0x61, 0x73, 0x73,
-  0x65, 0x72, 0x74, 0x45, 0x71, 0x75, 0x61, 0x6c, 0x73, 0x3b, 0x0a, 0x0a,
-  0x28, 0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x20, 0x28, 0x29,
-  0x20, 0x7b, 0x0a, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x4f, 0x62, 0x6a,
-  0x65, 0x63, 0x74, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65,
-  0x54, 0x6f, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x20, 0x3d, 0x20, 0x4f,
-  0x62, 0x6a, 0x65, 0x63, 0x74, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74,
-  0x79, 0x70, 0x65, 0x2e, 0x74, 0x6f, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67,
-  0x3b, 0x0a, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x4e, 0x75, 0x6d, 0x62,
-  0x65, 0x72, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x56,
-  0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66, 0x20, 0x3d, 0x20, 0x4e, 0x75, 0x6d,
-  0x62, 0x65, 0x72, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70,
-  0x65, 0x2e, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66, 0x3b, 0x0a, 0x20,
-  0x20, 0x76, 0x61, 0x72, 0x20, 0x42, 0x6f, 0x6f, 0x6c, 0x65, 0x61, 0x6e,
-  0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c,
-  0x75, 0x65, 0x4f, 0x66, 0x20, 0x3d, 0x20, 0x42, 0x6f, 0x6f, 0x6c, 0x65,
-  0x61, 0x6e, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65,
-  0x2e, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66, 0x3b, 0x0a, 0x20, 0x20,
-  0x76, 0x61, 0x72, 0x20, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x50, 0x72,
-  0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65,
-  0x4f, 0x66, 0x20, 0x3d, 0x20, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x2e,
-  0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x2e, 0x76, 0x61,
-  0x6c, 0x75, 0x65, 0x4f, 0x66, 0x3b, 0x0a, 0x20, 0x20, 0x76, 0x61, 0x72,
-  0x20, 0x44, 0x61, 0x74, 0x65, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79,
-  0x70, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66, 0x20, 0x3d, 0x20,
-  0x44, 0x61, 0x74, 0x65, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79,
-  0x70, 0x65, 0x2e, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66, 0x3b, 0x0a,
-  0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x52, 0x65, 0x67, 0x45, 0x78, 0x70,
-  0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x54, 0x6f, 0x53,
-  0x74, 0x72, 0x69, 0x6e, 0x67, 0x20, 0x3d, 0x20, 0x52, 0x65, 0x67, 0x45,
-  0x78, 0x70, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65,
-  0x2e, 0x74, 0x6f, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x3b, 0x0a, 0x20,
-  0x20, 0x76, 0x61, 0x72, 0x20, 0x41, 0x72, 0x72, 0x61, 0x79, 0x50, 0x72,
-  0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x46, 0x6f, 0x72, 0x45, 0x61,
-  0x63, 0x68, 0x20, 0x3d, 0x20, 0x41, 0x72, 0x72, 0x61, 0x79, 0x2e, 0x70,
-  0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x2e, 0x66, 0x6f, 0x72,
-  0x45, 0x61, 0x63, 0x68, 0x3b, 0x0a, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20,
-  0x41, 0x72, 0x72, 0x61, 0x79, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79,
-  0x70, 0x65, 0x4a, 0x6f, 0x69, 0x6e, 0x20, 0x3d, 0x20, 0x41, 0x72, 0x72,
-  0x61, 0x79, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65,
-  0x2e, 0x6a, 0x6f, 0x69, 0x6e, 0x3b, 0x0a, 0x20, 0x20, 0x76, 0x61, 0x72,
-  0x20, 0x41, 0x72, 0x72, 0x61, 0x79, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74,
-  0x79, 0x70, 0x65, 0x4d, 0x61, 0x70, 0x20, 0x3d, 0x20, 0x41, 0x72, 0x72,
-  0x61, 0x79, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65,
-  0x2e, 0x6d, 0x61, 0x70, 0x3b, 0x0a, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20,
-  0x41, 0x72, 0x72, 0x61, 0x79, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79,
-  0x70, 0x65, 0x50, 0x75, 0x73, 0x68, 0x20, 0x3d, 0x20, 0x41, 0x72, 0x72,
-  0x61, 0x79, 0x2e, 0x70, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65,
-  0x2e, 0x70, 0x75, 0x73, 0x68, 0x3b, 0x0a, 0x0a, 0x20, 0x20, 0x76, 0x61,
-  0x72, 0x20, 0x42, 0x69, 0x67, 0x49, 0x6e, 0x74, 0x50, 0x72, 0x6f, 0x74,
-  0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66,
-  0x3b, 0x0a, 0x20, 0x20, 0x74, 0x72, 0x79, 0x20, 0x7b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x42, 0x69, 0x67, 0x49, 0x6e, 0x74, 0x50, 0x72, 0x6f, 0x74,
-  0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66,
-  0x20, 0x3d, 0x20, 0x42, 0x69, 0x67, 0x49, 0x6e, 0x74, 0x2e, 0x70, 0x72,
-  0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x2e, 0x76, 0x61, 0x6c, 0x75,
-  0x65, 0x4f, 0x66, 0x3b, 0x0a, 0x20, 0x20, 0x7d, 0x20, 0x63, 0x61, 0x74,
-  0x63, 0x68, 0x28, 0x65, 0x29, 0x20, 0x7b, 0x7d, 0x0a, 0x0a, 0x20, 0x20,
-  0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x20, 0x63, 0x6c, 0x61,
-  0x73, 0x73, 0x4f, 0x66, 0x28, 0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x29,
-  0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x73,
-  0x74, 0x72, 0x69, 0x6e, 0x67, 0x20, 0x3d, 0x20, 0x4f, 0x62, 0x6a, 0x65,
-  0x63, 0x74, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x54,
-  0x6f, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x2e, 0x63, 0x61, 0x6c, 0x6c,
-  0x28, 0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x29, 0x3b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x73, 0x74, 0x72,
-  0x69, 0x6e, 0x67, 0x2e, 0x73, 0x75, 0x62, 0x73, 0x74, 0x72, 0x69, 0x6e,
-  0x67, 0x28, 0x38, 0x2c, 0x20, 0x73, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x2e,
-  0x6c, 0x65, 0x6e, 0x67, 0x74, 0x68, 0x20, 0x2d, 0x20, 0x31, 0x29, 0x3b,
-  0x0a, 0x20, 0x20, 0x7d, 0x0a, 0x0a, 0x20, 0x20, 0x66, 0x75, 0x6e, 0x63,
-  0x74, 0x69, 0x6f, 0x6e, 0x20, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66,
-  0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x73, 0x77, 0x69, 0x74, 0x63, 0x68, 0x20, 0x28, 0x63, 0x6c,
-  0x61, 0x73, 0x73, 0x4f, 0x66, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29,
-  0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61,
-  0x73, 0x65, 0x20, 0x22, 0x4e, 0x75, 0x6d, 0x62, 0x65, 0x72, 0x22, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74,
-  0x75, 0x72, 0x6e, 0x20, 0x4e, 0x75, 0x6d, 0x62, 0x65, 0x72, 0x50, 0x72,
-  0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65,
-  0x4f, 0x66, 0x2e, 0x63, 0x61, 0x6c, 0x6c, 0x28, 0x76, 0x61, 0x6c, 0x75,
-  0x65, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61,
-  0x73, 0x65, 0x20, 0x22, 0x42, 0x69, 0x67, 0x49, 0x6e, 0x74, 0x22, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74,
-  0x75, 0x72, 0x6e, 0x20, 0x42, 0x69, 0x67, 0x49, 0x6e, 0x74, 0x50, 0x72,
-  0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65,
-  0x4f, 0x66, 0x2e, 0x63, 0x61, 0x6c, 0x6c, 0x28, 0x76, 0x61, 0x6c, 0x75,
-  0x65, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61,
-  0x73, 0x65, 0x20, 0x22, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x22, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74,
-  0x75, 0x72, 0x6e, 0x20, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x50, 0x72,
-  0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65,
-  0x4f, 0x66, 0x2e, 0x63, 0x61, 0x6c, 0x6c, 0x28, 0x76, 0x61, 0x6c, 0x75,
-  0x65, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61,
-  0x73, 0x65, 0x20, 0x22, 0x42, 0x6f, 0x6f, 0x6c, 0x65, 0x61, 0x6e, 0x22,
-  0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65,
-  0x74, 0x75, 0x72, 0x6e, 0x20, 0x42, 0x6f, 0x6f, 0x6c, 0x65, 0x61, 0x6e,
-  0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c,
-  0x75, 0x65, 0x4f, 0x66, 0x2e, 0x63, 0x61, 0x6c, 0x6c, 0x28, 0x76, 0x61,
-  0x6c, 0x75, 0x65, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x63, 0x61, 0x73, 0x65, 0x20, 0x22, 0x44, 0x61, 0x74, 0x65, 0x22, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74,
-  0x75, 0x72, 0x6e, 0x20, 0x44, 0x61, 0x74, 0x65, 0x50, 0x72, 0x6f, 0x74,
-  0x6f, 0x74, 0x79, 0x70, 0x65, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66,
-  0x2e, 0x63, 0x61, 0x6c, 0x6c, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29,
-  0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x64, 0x65, 0x66, 0x61,
-  0x75, 0x6c, 0x74, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x76, 0x61, 0x6c, 0x75,
-  0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x7d, 0x0a, 0x20, 0x20, 0x7d,
-  0x0a, 0x0a, 0x0a, 0x20, 0x20, 0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f,
-  0x6e, 0x20, 0x50, 0x72, 0x65, 0x74, 0x74, 0x79, 0x50, 0x72, 0x69, 0x6e,
-  0x74, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29, 0x20, 0x7b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x73, 0x77, 0x69, 0x74, 0x63, 0x68, 0x20, 0x28, 0x74,
-  0x79, 0x70, 0x65, 0x6f, 0x66, 0x20, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29,
-  0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73,
-  0x65, 0x20, 0x22, 0x73, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x22, 0x3a, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75,
-  0x72, 0x6e, 0x20, 0x4a, 0x53, 0x4f, 0x4e, 0x2e, 0x73, 0x74, 0x72, 0x69,
-  0x6e, 0x67, 0x69, 0x66, 0x79, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29,
-  0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65,
-  0x20, 0x22, 0x62, 0x69, 0x67, 0x69, 0x6e, 0x74, 0x22, 0x3a, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72,
-  0x6e, 0x20, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x28, 0x76, 0x61, 0x6c,
-  0x75, 0x65, 0x29, 0x20, 0x2b, 0x20, 0x22, 0x6e, 0x22, 0x3b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65, 0x20, 0x22, 0x6e,
-  0x75, 0x6d, 0x62, 0x65, 0x72, 0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x76, 0x61, 0x6c, 0x75,
-  0x65, 0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x30, 0x20, 0x26, 0x26, 0x20, 0x28,
-  0x31, 0x20, 0x2f, 0x20, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29, 0x20, 0x3c,
-  0x20, 0x30, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x22,
-  0x2d, 0x30, 0x22, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x2f, 0x2f, 0x20, 0x46, 0x41, 0x4c, 0x4c, 0x54, 0x48, 0x52, 0x4f,
-  0x55, 0x47, 0x48, 0x2e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63,
-  0x61, 0x73, 0x65, 0x20, 0x22, 0x62, 0x6f, 0x6f, 0x6c, 0x65, 0x61, 0x6e,
-  0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73,
-  0x65, 0x20, 0x22, 0x75, 0x6e, 0x64, 0x65, 0x66, 0x69, 0x6e, 0x65, 0x64,
-  0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73,
-  0x65, 0x20, 0x22, 0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x22,
-  0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65,
-  0x20, 0x22, 0x73, 0x79, 0x6d, 0x62, 0x6f, 0x6c, 0x22, 0x3a, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72,
-  0x6e, 0x20, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x28, 0x76, 0x61, 0x6c,
-  0x75, 0x65, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63,
-  0x61, 0x73, 0x65, 0x20, 0x22, 0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x22,
-  0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x69, 0x66,
-  0x20, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x20, 0x3d, 0x3d, 0x3d, 0x20,
-  0x6e, 0x75, 0x6c, 0x6c, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e,
-  0x20, 0x22, 0x6e, 0x75, 0x6c, 0x6c, 0x22, 0x3b, 0x0a, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x6f, 0x62, 0x6a,
-  0x65, 0x63, 0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20, 0x3d, 0x20, 0x63,
-  0x6c, 0x61, 0x73, 0x73, 0x4f, 0x66, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65,
-  0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x73,
-  0x77, 0x69, 0x74, 0x63, 0x68, 0x20, 0x28, 0x6f, 0x62, 0x6a, 0x65, 0x63,
-  0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65,
-  0x20, 0x22, 0x4e, 0x75, 0x6d, 0x62, 0x65, 0x72, 0x22, 0x3a, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73,
-  0x65, 0x20, 0x22, 0x42, 0x69, 0x67, 0x49, 0x6e, 0x74, 0x22, 0x3a, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61,
-  0x73, 0x65, 0x20, 0x22, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x22, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63,
-  0x61, 0x73, 0x65, 0x20, 0x22, 0x42, 0x6f, 0x6f, 0x6c, 0x65, 0x61, 0x6e,
-  0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x63, 0x61, 0x73, 0x65, 0x20, 0x22, 0x44, 0x61, 0x74, 0x65, 0x22,
-  0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x6f, 0x62, 0x6a,
-  0x65, 0x63, 0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20, 0x2b, 0x20, 0x22,
-  0x28, 0x22, 0x20, 0x2b, 0x20, 0x50, 0x72, 0x65, 0x74, 0x74, 0x79, 0x50,
-  0x72, 0x69, 0x6e, 0x74, 0x28, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66,
-  0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29, 0x29, 0x20, 0x2b, 0x20, 0x22,
-  0x29, 0x22, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x63, 0x61, 0x73, 0x65, 0x20, 0x22, 0x52, 0x65, 0x67, 0x45,
-  0x78, 0x70, 0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20,
-  0x52, 0x65, 0x67, 0x45, 0x78, 0x70, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74,
-  0x79, 0x70, 0x65, 0x54, 0x6f, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x2e,
-  0x63, 0x61, 0x6c, 0x6c, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29, 0x3b,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63,
-  0x61, 0x73, 0x65, 0x20, 0x22, 0x41, 0x72, 0x72, 0x61, 0x79, 0x22, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x76, 0x61, 0x72, 0x20, 0x6d, 0x61, 0x70, 0x70, 0x65, 0x64, 0x20,
-  0x3d, 0x20, 0x41, 0x72, 0x72, 0x61, 0x79, 0x50, 0x72, 0x6f, 0x74, 0x6f,
-  0x74, 0x79, 0x70, 0x65, 0x4d, 0x61, 0x70, 0x2e, 0x63, 0x61, 0x6c, 0x6c,
-  0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x2c, 0x20, 0x50, 0x72, 0x65, 0x74,
-  0x74, 0x79, 0x50, 0x72, 0x69, 0x6e, 0x74, 0x41, 0x72, 0x72, 0x61, 0x79,
-  0x45, 0x6c, 0x65, 0x6d, 0x65, 0x6e, 0x74, 0x29, 0x3b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x76, 0x61,
-  0x72, 0x20, 0x6a, 0x6f, 0x69, 0x6e, 0x65, 0x64, 0x20, 0x3d, 0x20, 0x41,
-  0x72, 0x72, 0x61, 0x79, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74, 0x79, 0x70,
-  0x65, 0x4a, 0x6f, 0x69, 0x6e, 0x2e, 0x63, 0x61, 0x6c, 0x6c, 0x28, 0x6d,
-  0x61, 0x70, 0x70, 0x65, 0x64, 0x2c, 0x20, 0x22, 0x2c, 0x22, 0x29, 0x3b,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x22, 0x5b, 0x22, 0x20,
-  0x2b, 0x20, 0x6a, 0x6f, 0x69, 0x6e, 0x65, 0x64, 0x20, 0x2b, 0x20, 0x22,
-  0x5d, 0x22, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x63, 0x61, 0x73, 0x65, 0x20, 0x22, 0x55, 0x69, 0x6e, 0x74,
-  0x38, 0x41, 0x72, 0x72, 0x61, 0x79, 0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65, 0x20,
-  0x22, 0x49, 0x6e, 0x74, 0x38, 0x41, 0x72, 0x72, 0x61, 0x79, 0x22, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63,
-  0x61, 0x73, 0x65, 0x20, 0x22, 0x49, 0x6e, 0x74, 0x31, 0x36, 0x41, 0x72,
-  0x72, 0x61, 0x79, 0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65, 0x20, 0x22, 0x55, 0x69,
-  0x6e, 0x74, 0x31, 0x36, 0x41, 0x72, 0x72, 0x61, 0x79, 0x22, 0x3a, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61,
-  0x73, 0x65, 0x20, 0x22, 0x55, 0x69, 0x6e, 0x74, 0x33, 0x32, 0x41, 0x72,
-  0x72, 0x61, 0x79, 0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65, 0x20, 0x22, 0x49, 0x6e,
-  0x74, 0x33, 0x32, 0x41, 0x72, 0x72, 0x61, 0x79, 0x22, 0x3a, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73,
-  0x65, 0x20, 0x22, 0x46, 0x6c, 0x6f, 0x61, 0x74, 0x33, 0x32, 0x41, 0x72,
-  0x72, 0x61, 0x79, 0x22, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65, 0x20, 0x22, 0x46, 0x6c,
-  0x6f, 0x61, 0x74, 0x36, 0x34, 0x41, 0x72, 0x72, 0x61, 0x79, 0x22, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x76, 0x61, 0x72, 0x20, 0x6a, 0x6f, 0x69, 0x6e, 0x65, 0x64, 0x20,
-  0x3d, 0x20, 0x41, 0x72, 0x72, 0x61, 0x79, 0x50, 0x72, 0x6f, 0x74, 0x6f,
-  0x74, 0x79, 0x70, 0x65, 0x4a, 0x6f, 0x69, 0x6e, 0x2e, 0x63, 0x61, 0x6c,
-  0x6c, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x2c, 0x20, 0x22, 0x2c, 0x22,
-  0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x6f, 0x62,
-  0x6a, 0x65, 0x63, 0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20, 0x2b, 0x20,
-  0x22, 0x28, 0x5b, 0x22, 0x20, 0x2b, 0x20, 0x6a, 0x6f, 0x69, 0x6e, 0x65,
-  0x64, 0x20, 0x2b, 0x20, 0x22, 0x5d, 0x29, 0x22, 0x3b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x63, 0x61, 0x73, 0x65,
-  0x20, 0x22, 0x4f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x22, 0x3a, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x62,
-  0x72, 0x65, 0x61, 0x6b, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x64, 0x65, 0x66, 0x61, 0x75, 0x6c, 0x74, 0x3a,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x6f, 0x62, 0x6a, 0x65,
-  0x63, 0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20, 0x2b, 0x20, 0x22, 0x28,
-  0x29, 0x22, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x7d, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x76, 0x61,
-  0x72, 0x20, 0x6e, 0x61, 0x6d, 0x65, 0x20, 0x3d, 0x20, 0x76, 0x61, 0x6c,
-  0x75, 0x65, 0x2e, 0x63, 0x6f, 0x6e, 0x73, 0x74, 0x72, 0x75, 0x63, 0x74,
-  0x6f, 0x72, 0x2e, 0x6e, 0x61, 0x6d, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x6e, 0x61, 0x6d,
-  0x65, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x6e, 0x61,
-  0x6d, 0x65, 0x20, 0x2b, 0x20, 0x22, 0x28, 0x29, 0x22, 0x3b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72,
-  0x6e, 0x20, 0x22, 0x4f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x28, 0x29, 0x22,
-  0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x64, 0x65, 0x66, 0x61,
-  0x75, 0x6c, 0x74, 0x3a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x22, 0x2d, 0x2d, 0x20,
-  0x75, 0x6e, 0x6b, 0x6e, 0x6f, 0x77, 0x6e, 0x20, 0x76, 0x61, 0x6c, 0x75,
-  0x65, 0x20, 0x2d, 0x2d, 0x22, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x7d,
-  0x0a, 0x20, 0x20, 0x7d, 0x0a, 0x0a, 0x20, 0x20, 0x66, 0x75, 0x6e, 0x63,
-  0x74, 0x69, 0x6f, 0x6e, 0x20, 0x50, 0x72, 0x65, 0x74, 0x74, 0x79, 0x50,
-  0x72, 0x69, 0x6e, 0x74, 0x41, 0x72, 0x72, 0x61, 0x79, 0x45, 0x6c, 0x65,
-  0x6d, 0x65, 0x6e, 0x74, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x2c, 0x20,
-  0x69, 0x6e, 0x64, 0x65, 0x78, 0x2c, 0x20, 0x61, 0x72, 0x72, 0x61, 0x79,
-  0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28,
-  0x76, 0x61, 0x6c, 0x75, 0x65, 0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x75, 0x6e,
-  0x64, 0x65, 0x66, 0x69, 0x6e, 0x65, 0x64, 0x20, 0x26, 0x26, 0x20, 0x21,
-  0x28, 0x69, 0x6e, 0x64, 0x65, 0x78, 0x20, 0x69, 0x6e, 0x20, 0x61, 0x72,
-  0x72, 0x61, 0x79, 0x29, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e,
-  0x20, 0x22, 0x22, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74,
-  0x75, 0x72, 0x6e, 0x20, 0x50, 0x72, 0x65, 0x74, 0x74, 0x79, 0x50, 0x72,
-  0x69, 0x6e, 0x74, 0x28, 0x76, 0x61, 0x6c, 0x75, 0x65, 0x29, 0x3b, 0x0a,
-  0x20, 0x20, 0x7d, 0x0a, 0x0a, 0x20, 0x20, 0x66, 0x61, 0x69, 0x6c, 0x57,
-  0x69, 0x74, 0x68, 0x4d, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x20, 0x3d,
-  0x20, 0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x20, 0x66, 0x61,
-  0x69, 0x6c, 0x57, 0x69, 0x74, 0x68, 0x4d, 0x65, 0x73, 0x73, 0x61, 0x67,
-  0x65, 0x28, 0x6d, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x29, 0x20, 0x7b,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x74, 0x68, 0x72, 0x6f, 0x77, 0x20, 0x6e,
-  0x65, 0x77, 0x20, 0x45, 0x72, 0x72, 0x6f, 0x72, 0x28, 0x6d, 0x65, 0x73,
-  0x73, 0x61, 0x67, 0x65, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x7d, 0x0a, 0x0a,
-  0x20, 0x20, 0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x20, 0x66,
-  0x6f, 0x72, 0x6d, 0x61, 0x74, 0x46, 0x61, 0x69, 0x6c, 0x75, 0x72, 0x65,
-  0x54, 0x65, 0x78, 0x74, 0x28, 0x65, 0x78, 0x70, 0x65, 0x63, 0x74, 0x65,
-  0x64, 0x54, 0x65, 0x78, 0x74, 0x2c, 0x20, 0x66, 0x6f, 0x75, 0x6e, 0x64,
-  0x2c, 0x20, 0x6e, 0x61, 0x6d, 0x65, 0x5f, 0x6f, 0x70, 0x74, 0x29, 0x20,
-  0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x6d, 0x65,
-  0x73, 0x73, 0x61, 0x67, 0x65, 0x20, 0x3d, 0x20, 0x22, 0x46, 0x61, 0x69,
-  0x6c, 0x22, 0x20, 0x2b, 0x20, 0x22, 0x75, 0x72, 0x65, 0x22, 0x3b, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x6e, 0x61, 0x6d, 0x65,
-  0x5f, 0x6f, 0x70, 0x74, 0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x6d, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x20, 0x2b, 0x3d,
-  0x20, 0x22, 0x20, 0x28, 0x22, 0x20, 0x2b, 0x20, 0x6e, 0x61, 0x6d, 0x65,
-  0x5f, 0x6f, 0x70, 0x74, 0x20, 0x2b, 0x20, 0x22, 0x29, 0x22, 0x3b, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x7d, 0x0a, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x76,
-  0x61, 0x72, 0x20, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x54, 0x65, 0x78, 0x74,
-  0x20, 0x3d, 0x20, 0x50, 0x72, 0x65, 0x74, 0x74, 0x79, 0x50, 0x72, 0x69,
-  0x6e, 0x74, 0x28, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x29, 0x3b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x65, 0x78, 0x70, 0x65, 0x63,
-  0x74, 0x65, 0x64, 0x54, 0x65, 0x78, 0x74, 0x2e, 0x6c, 0x65, 0x6e, 0x67,
-  0x74, 0x68, 0x20, 0x3c, 0x3d, 0x20, 0x34, 0x30, 0x20, 0x26, 0x26, 0x20,
-  0x66, 0x6f, 0x75, 0x6e, 0x64, 0x54, 0x65, 0x78, 0x74, 0x2e, 0x6c, 0x65,
-  0x6e, 0x67, 0x74, 0x68, 0x20, 0x3c, 0x3d, 0x20, 0x34, 0x30, 0x29, 0x20,
-  0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x6d, 0x65, 0x73, 0x73,
-  0x61, 0x67, 0x65, 0x20, 0x2b, 0x3d, 0x20, 0x22, 0x3a, 0x20, 0x65, 0x78,
-  0x70, 0x65, 0x63, 0x74, 0x65, 0x64, 0x20, 0x3c, 0x22, 0x20, 0x2b, 0x20,
-  0x65, 0x78, 0x70, 0x65, 0x63, 0x74, 0x65, 0x64, 0x54, 0x65, 0x78, 0x74,
-  0x20, 0x2b, 0x20, 0x22, 0x3e, 0x20, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x20,
-  0x3c, 0x22, 0x20, 0x2b, 0x20, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x54, 0x65,
-  0x78, 0x74, 0x20, 0x2b, 0x20, 0x22, 0x3e, 0x22, 0x3b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x7d, 0x20, 0x65, 0x6c, 0x73, 0x65, 0x20, 0x7b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x6d, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65,
-  0x20, 0x2b, 0x3d, 0x20, 0x22, 0x3a, 0x5c, 0x6e, 0x65, 0x78, 0x70, 0x65,
-  0x63, 0x74, 0x65, 0x64, 0x3a, 0x5c, 0x6e, 0x22, 0x20, 0x2b, 0x20, 0x65,
-  0x78, 0x70, 0x65, 0x63, 0x74, 0x65, 0x64, 0x54, 0x65, 0x78, 0x74, 0x20,
-  0x2b, 0x20, 0x22, 0x5c, 0x6e, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x3a, 0x5c,
-  0x6e, 0x22, 0x20, 0x2b, 0x20, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x54, 0x65,
-  0x78, 0x74, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x7d, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x6d, 0x65, 0x73,
-  0x73, 0x61, 0x67, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x7d, 0x0a, 0x0a, 0x20,
-  0x20, 0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x20, 0x66, 0x61,
-  0x69, 0x6c, 0x28, 0x65, 0x78, 0x70, 0x65, 0x63, 0x74, 0x65, 0x64, 0x54,
-  0x65, 0x78, 0x74, 0x2c, 0x20, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x2c, 0x20,
-  0x6e, 0x61, 0x6d, 0x65, 0x5f, 0x6f, 0x70, 0x74, 0x29, 0x20, 0x7b, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x66,
-  0x61, 0x69, 0x6c, 0x57, 0x69, 0x74, 0x68, 0x4d, 0x65, 0x73, 0x73, 0x61,
-  0x67, 0x65, 0x28, 0x66, 0x6f, 0x72, 0x6d, 0x61, 0x74, 0x46, 0x61, 0x69,
-  0x6c, 0x75, 0x72, 0x65, 0x54, 0x65, 0x78, 0x74, 0x28, 0x65, 0x78, 0x70,
-  0x65, 0x63, 0x74, 0x65, 0x64, 0x54, 0x65, 0x78, 0x74, 0x2c, 0x20, 0x66,
-  0x6f, 0x75, 0x6e, 0x64, 0x2c, 0x20, 0x6e, 0x61, 0x6d, 0x65, 0x5f, 0x6f,
-  0x70, 0x74, 0x29, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x7d, 0x0a, 0x0a, 0x20,
-  0x20, 0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x20, 0x64, 0x65,
-  0x65, 0x70, 0x4f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x45, 0x71, 0x75, 0x61,
-  0x6c, 0x73, 0x28, 0x61, 0x2c, 0x20, 0x62, 0x29, 0x20, 0x7b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x61, 0x50, 0x72, 0x6f, 0x70,
-  0x73, 0x20, 0x3d, 0x20, 0x4f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x2e, 0x6b,
-  0x65, 0x79, 0x73, 0x28, 0x61, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20,
-  0x61, 0x50, 0x72, 0x6f, 0x70, 0x73, 0x2e, 0x73, 0x6f, 0x72, 0x74, 0x28,
-  0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x62,
-  0x50, 0x72, 0x6f, 0x70, 0x73, 0x20, 0x3d, 0x20, 0x4f, 0x62, 0x6a, 0x65,
-  0x63, 0x74, 0x2e, 0x6b, 0x65, 0x79, 0x73, 0x28, 0x62, 0x29, 0x3b, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x62, 0x50, 0x72, 0x6f, 0x70, 0x73, 0x2e, 0x73,
-  0x6f, 0x72, 0x74, 0x28, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x69,
-  0x66, 0x20, 0x28, 0x21, 0x64, 0x65, 0x65, 0x70, 0x45, 0x71, 0x75, 0x61,
-  0x6c, 0x73, 0x28, 0x61, 0x50, 0x72, 0x6f, 0x70, 0x73, 0x2c, 0x20, 0x62,
-  0x50, 0x72, 0x6f, 0x70, 0x73, 0x29, 0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x66,
-  0x61, 0x6c, 0x73, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x7d, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x66, 0x6f, 0x72, 0x20, 0x28, 0x76, 0x61, 0x72,
-  0x20, 0x69, 0x20, 0x3d, 0x20, 0x30, 0x3b, 0x20, 0x69, 0x20, 0x3c, 0x20,
-  0x61, 0x50, 0x72, 0x6f, 0x70, 0x73, 0x2e, 0x6c, 0x65, 0x6e, 0x67, 0x74,
-  0x68, 0x3b, 0x20, 0x69, 0x2b, 0x2b, 0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x21, 0x64, 0x65, 0x65,
-  0x70, 0x45, 0x71, 0x75, 0x61, 0x6c, 0x73, 0x28, 0x61, 0x5b, 0x61, 0x50,
-  0x72, 0x6f, 0x70, 0x73, 0x5b, 0x69, 0x5d, 0x5d, 0x2c, 0x20, 0x62, 0x5b,
-  0x61, 0x50, 0x72, 0x6f, 0x70, 0x73, 0x5b, 0x69, 0x5d, 0x5d, 0x29, 0x29,
-  0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72,
-  0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x66, 0x61, 0x6c, 0x73, 0x65, 0x3b,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x7d, 0x0a, 0x20, 0x20, 0x20,
-  0x20, 0x7d, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72,
-  0x6e, 0x20, 0x74, 0x72, 0x75, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x7d, 0x0a,
-  0x0a, 0x20, 0x20, 0x66, 0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x20,
-  0x64, 0x65, 0x65, 0x70, 0x45, 0x71, 0x75, 0x61, 0x6c, 0x73, 0x28, 0x61,
-  0x2c, 0x20, 0x62, 0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x69,
-  0x66, 0x20, 0x28, 0x61, 0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x62, 0x29, 0x20,
-  0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x2f, 0x2f, 0x20, 0x43,
-  0x68, 0x65, 0x63, 0x6b, 0x20, 0x66, 0x6f, 0x72, 0x20, 0x2d, 0x30, 0x2e,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x61,
-  0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x30, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75,
-  0x72, 0x6e, 0x20, 0x28, 0x31, 0x20, 0x2f, 0x20, 0x61, 0x29, 0x20, 0x3d,
-  0x3d, 0x3d, 0x20, 0x28, 0x31, 0x20, 0x2f, 0x20, 0x62, 0x29, 0x3b, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e,
-  0x20, 0x74, 0x72, 0x75, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x7d,
-  0x0a, 0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x74, 0x79, 0x70,
-  0x65, 0x6f, 0x66, 0x20, 0x61, 0x20, 0x21, 0x3d, 0x3d, 0x20, 0x74, 0x79,
-  0x70, 0x65, 0x6f, 0x66, 0x20, 0x62, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75,
-  0x72, 0x6e, 0x20, 0x66, 0x61, 0x6c, 0x73, 0x65, 0x3b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x74, 0x79, 0x70, 0x65, 0x6f, 0x66,
-  0x20, 0x61, 0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x22, 0x6e, 0x75, 0x6d, 0x62,
-  0x65, 0x72, 0x22, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20,
-  0x69, 0x73, 0x4e, 0x61, 0x4e, 0x28, 0x61, 0x29, 0x20, 0x26, 0x26, 0x20,
-  0x69, 0x73, 0x4e, 0x61, 0x4e, 0x28, 0x62, 0x29, 0x3b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x74, 0x79, 0x70, 0x65, 0x6f, 0x66,
-  0x20, 0x61, 0x20, 0x21, 0x3d, 0x3d, 0x20, 0x22, 0x6f, 0x62, 0x6a, 0x65,
-  0x63, 0x74, 0x22, 0x20, 0x26, 0x26, 0x20, 0x74, 0x79, 0x70, 0x65, 0x6f,
-  0x66, 0x20, 0x61, 0x20, 0x21, 0x3d, 0x3d, 0x20, 0x22, 0x66, 0x75, 0x6e,
-  0x63, 0x74, 0x69, 0x6f, 0x6e, 0x22, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75,
-  0x72, 0x6e, 0x20, 0x66, 0x61, 0x6c, 0x73, 0x65, 0x3b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x2f, 0x2f, 0x20, 0x4e, 0x65, 0x69, 0x74, 0x68, 0x65, 0x72,
-  0x20, 0x61, 0x20, 0x6e, 0x6f, 0x72, 0x20, 0x62, 0x20, 0x69, 0x73, 0x20,
-  0x70, 0x72, 0x69, 0x6d, 0x69, 0x74, 0x69, 0x76, 0x65, 0x2e, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x6f, 0x62, 0x6a, 0x65, 0x63,
-  0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20, 0x3d, 0x20, 0x63, 0x6c, 0x61,
-  0x73, 0x73, 0x4f, 0x66, 0x28, 0x61, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20,
-  0x20, 0x69, 0x66, 0x20, 0x28, 0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x43,
-  0x6c, 0x61, 0x73, 0x73, 0x20, 0x21, 0x3d, 0x3d, 0x20, 0x63, 0x6c, 0x61,
-  0x73, 0x73, 0x4f, 0x66, 0x28, 0x62, 0x29, 0x29, 0x20, 0x72, 0x65, 0x74,
-  0x75, 0x72, 0x6e, 0x20, 0x66, 0x61, 0x6c, 0x73, 0x65, 0x3b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x6f, 0x62, 0x6a, 0x65, 0x63,
-  0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x22,
-  0x52, 0x65, 0x67, 0x45, 0x78, 0x70, 0x22, 0x29, 0x20, 0x7b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x2f, 0x2f, 0x20, 0x46, 0x6f, 0x72, 0x20,
-  0x52, 0x65, 0x67, 0x45, 0x78, 0x70, 0x2c, 0x20, 0x6a, 0x75, 0x73, 0x74,
-  0x20, 0x63, 0x6f, 0x6d, 0x70, 0x61, 0x72, 0x65, 0x20, 0x70, 0x61, 0x74,
-  0x74, 0x65, 0x72, 0x6e, 0x20, 0x61, 0x6e, 0x64, 0x20, 0x66, 0x6c, 0x61,
-  0x67, 0x73, 0x20, 0x75, 0x73, 0x69, 0x6e, 0x67, 0x20, 0x69, 0x74, 0x73,
-  0x20, 0x74, 0x6f, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x2e, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20,
-  0x52, 0x65, 0x67, 0x45, 0x78, 0x70, 0x50, 0x72, 0x6f, 0x74, 0x6f, 0x74,
-  0x79, 0x70, 0x65, 0x54, 0x6f, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x2e,
-  0x63, 0x61, 0x6c, 0x6c, 0x28, 0x61, 0x29, 0x20, 0x3d, 0x3d, 0x3d, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x52, 0x65, 0x67, 0x45, 0x78, 0x70, 0x50, 0x72, 0x6f, 0x74, 0x6f,
-  0x74, 0x79, 0x70, 0x65, 0x54, 0x6f, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67,
-  0x2e, 0x63, 0x61, 0x6c, 0x6c, 0x28, 0x62, 0x29, 0x3b, 0x0a, 0x20, 0x20,
-  0x20, 0x20, 0x7d, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x2f, 0x2f, 0x20, 0x46,
-  0x75, 0x6e, 0x63, 0x74, 0x69, 0x6f, 0x6e, 0x73, 0x20, 0x61, 0x72, 0x65,
-  0x20, 0x6f, 0x6e, 0x6c, 0x79, 0x20, 0x69, 0x64, 0x65, 0x6e, 0x74, 0x69,
-  0x63, 0x61, 0x6c, 0x20, 0x74, 0x6f, 0x20, 0x74, 0x68, 0x65, 0x6d, 0x73,
-  0x65, 0x6c, 0x76, 0x65, 0x73, 0x2e, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x69,
-  0x66, 0x20, 0x28, 0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x43, 0x6c, 0x61,
-  0x73, 0x73, 0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x22, 0x46, 0x75, 0x6e, 0x63,
-  0x74, 0x69, 0x6f, 0x6e, 0x22, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72,
-  0x6e, 0x20, 0x66, 0x61, 0x6c, 0x73, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20,
-  0x20, 0x69, 0x66, 0x20, 0x28, 0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x43,
-  0x6c, 0x61, 0x73, 0x73, 0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x22, 0x41, 0x72,
-  0x72, 0x61, 0x79, 0x22, 0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x76, 0x61, 0x72, 0x20, 0x65, 0x6c, 0x65, 0x6d, 0x65, 0x6e,
-  0x74, 0x43, 0x6f, 0x75, 0x6e, 0x74, 0x20, 0x3d, 0x20, 0x30, 0x3b, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x61, 0x2e,
-  0x6c, 0x65, 0x6e, 0x67, 0x74, 0x68, 0x20, 0x21, 0x3d, 0x3d, 0x20, 0x62,
-  0x2e, 0x6c, 0x65, 0x6e, 0x67, 0x74, 0x68, 0x29, 0x20, 0x7b, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72,
-  0x6e, 0x20, 0x66, 0x61, 0x6c, 0x73, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20,
-  0x20, 0x20, 0x20, 0x7d, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x66,
-  0x6f, 0x72, 0x20, 0x28, 0x76, 0x61, 0x72, 0x20, 0x69, 0x20, 0x3d, 0x20,
-  0x30, 0x3b, 0x20, 0x69, 0x20, 0x3c, 0x20, 0x61, 0x2e, 0x6c, 0x65, 0x6e,
-  0x67, 0x74, 0x68, 0x3b, 0x20, 0x69, 0x2b, 0x2b, 0x29, 0x20, 0x7b, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28,
-  0x21, 0x64, 0x65, 0x65, 0x70, 0x45, 0x71, 0x75, 0x61, 0x6c, 0x73, 0x28,
-  0x61, 0x5b, 0x69, 0x5d, 0x2c, 0x20, 0x62, 0x5b, 0x69, 0x5d, 0x29, 0x29,
-  0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x66, 0x61, 0x6c, 0x73,
-  0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x7d, 0x0a, 0x20,
-  0x20, 0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20,
-  0x74, 0x72, 0x75, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x7d, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x6f, 0x62, 0x6a, 0x65,
-  0x63, 0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20, 0x3d, 0x3d, 0x3d, 0x20,
-  0x22, 0x53, 0x74, 0x72, 0x69, 0x6e, 0x67, 0x22, 0x20, 0x7c, 0x7c, 0x20,
-  0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20,
-  0x3d, 0x3d, 0x3d, 0x20, 0x22, 0x4e, 0x75, 0x6d, 0x62, 0x65, 0x72, 0x22,
-  0x20, 0x7c, 0x7c, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x6f, 0x62,
-  0x6a, 0x65, 0x63, 0x74, 0x43, 0x6c, 0x61, 0x73, 0x73, 0x20, 0x3d, 0x3d,
-  0x3d, 0x20, 0x22, 0x42, 0x69, 0x67, 0x49, 0x6e, 0x74, 0x22, 0x20, 0x7c,
-  0x7c, 0x20, 0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x43, 0x6c, 0x61, 0x73,
-  0x73, 0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x22, 0x42, 0x6f, 0x6f, 0x6c, 0x65,
-  0x61, 0x6e, 0x22, 0x20, 0x7c, 0x7c, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20,
-  0x20, 0x6f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x43, 0x6c, 0x61, 0x73, 0x73,
-  0x20, 0x3d, 0x3d, 0x3d, 0x20, 0x22, 0x44, 0x61, 0x74, 0x65, 0x22, 0x29,
-  0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20,
-  0x28, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66, 0x28, 0x61, 0x29, 0x20,
-  0x21, 0x3d, 0x3d, 0x20, 0x56, 0x61, 0x6c, 0x75, 0x65, 0x4f, 0x66, 0x28,
-  0x62, 0x29, 0x29, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x66,
-  0x61, 0x6c, 0x73, 0x65, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x7d, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x72, 0x65, 0x74, 0x75, 0x72, 0x6e, 0x20, 0x64,
-  0x65, 0x65, 0x70, 0x4f, 0x62, 0x6a, 0x65, 0x63, 0x74, 0x45, 0x71, 0x75,
-  0x61, 0x6c, 0x73, 0x28, 0x61, 0x2c, 0x20, 0x62, 0x29, 0x3b, 0x0a, 0x20,
-  0x20, 0x7d, 0x0a, 0x0a, 0x20, 0x20, 0x61, 0x73, 0x73, 0x65, 0x72, 0x74,
-  0x45, 0x71, 0x75, 0x61, 0x6c, 0x73, 0x20, 0x3d, 0x20, 0x66, 0x75, 0x6e,
-  0x63, 0x74, 0x69, 0x6f, 0x6e, 0x20, 0x61, 0x73, 0x73, 0x65, 0x72, 0x74,
-  0x45, 0x71, 0x75, 0x61, 0x6c, 0x73, 0x28, 0x65, 0x78, 0x70, 0x65, 0x63,
-  0x74, 0x65, 0x64, 0x2c, 0x20, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x2c, 0x20,
-  0x6e, 0x61, 0x6d, 0x65, 0x5f, 0x6f, 0x70, 0x74, 0x29, 0x20, 0x7b, 0x0a,
-  0x20, 0x20, 0x20, 0x20, 0x69, 0x66, 0x20, 0x28, 0x21, 0x64, 0x65, 0x65,
-  0x70, 0x45, 0x71, 0x75, 0x61, 0x6c, 0x73, 0x28, 0x66, 0x6f, 0x75, 0x6e,
-  0x64, 0x2c, 0x20, 0x65, 0x78, 0x70, 0x65, 0x63, 0x74, 0x65, 0x64, 0x29,
-  0x29, 0x20, 0x7b, 0x0a, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x66, 0x61,
-  0x69, 0x6c, 0x28, 0x50, 0x72, 0x65, 0x74, 0x74, 0x79, 0x50, 0x72, 0x69,
-  0x6e, 0x74, 0x28, 0x65, 0x78, 0x70, 0x65, 0x63, 0x74, 0x65, 0x64, 0x29,
-  0x2c, 0x20, 0x66, 0x6f, 0x75, 0x6e, 0x64, 0x2c, 0x20, 0x6e, 0x61, 0x6d,
-  0x65, 0x5f, 0x6f, 0x70, 0x74, 0x29, 0x3b, 0x0a, 0x20, 0x20, 0x20, 0x20,
-  0x7d, 0x0a, 0x20, 0x20, 0x7d, 0x3b, 0x0a, 0x7d, 0x29, 0x28, 0x29, 0x3b,
-  0x0a
-};
-unsigned int test_fuzzer_regexp_builtins_mjsunit_js_len = 5857;
diff --git a/deps/v8/test/fuzzer/testcfg.py b/deps/v8/test/fuzzer/testcfg.py
index 4b5657abca4cff..22cdeb1108a9a3 100644
--- a/deps/v8/test/fuzzer/testcfg.py
+++ b/deps/v8/test/fuzzer/testcfg.py
@@ -2,8 +2,6 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-import os
-
 from testrunner.local import testsuite
 from testrunner.objects import testcase
 
@@ -32,7 +30,7 @@ def test_dirs(self):
     return SUB_TESTS
 
   def _to_relpath(self, abspath, _):
-    return os.path.relpath(abspath, self.suite.root)
+    return abspath.relative_to(self.suite.root)
 
   def _should_filter_by_name(self, _):
     return False
@@ -50,8 +48,7 @@ def _variants_gen_class(self):
 
 class TestCase(testcase.TestCase):
   def _get_files_params(self):
-    suite, name = self.path.split(os.path.sep)
-    return [os.path.join(self.suite.root, suite, name)]
+    return [self.suite.root / self.path]
 
   def _get_variant_flags(self):
     return []
@@ -63,5 +60,4 @@ def _get_mode_flags(self):
     return []
 
   def get_shell(self):
-    group, _ = self.path.split(os.path.sep, 1)
-    return 'v8_simple_%s_fuzzer' % group
+    return f'v8_simple_{self.path.parts[0]}_fuzzer'
diff --git a/deps/v8/test/fuzzer/wasm-compile.cc b/deps/v8/test/fuzzer/wasm-compile.cc
index cdd7201012f873..eb8885e510e239 100644
--- a/deps/v8/test/fuzzer/wasm-compile.cc
+++ b/deps/v8/test/fuzzer/wasm-compile.cc
@@ -34,12 +34,19 @@ constexpr int kMaxExceptions = 4;
 constexpr int kMaxTableSize = 32;
 constexpr int kMaxTables = 4;
 constexpr int kMaxArraySize = 20;
+constexpr int kMaxPassiveDataSegments = 2;
+constexpr uint32_t kMaxRecursionDepth = 64;
 
 class DataRange {
+  // data_ is used for general random values for fuzzing.
   base::Vector<const uint8_t> data_;
+  // The RNG is used for generating random values (i32.consts etc.) for which
+  // the quality of the input is less important.
+  base::RandomNumberGenerator rng_;
 
  public:
-  explicit DataRange(base::Vector<const uint8_t> data) : data_(data) {}
+  explicit DataRange(base::Vector<const uint8_t> data, int64_t seed = -1)
+      : data_(data), rng_(seed == -1 ? get<int64_t>() : seed) {}
   DataRange(const DataRange&) = delete;
   DataRange& operator=(const DataRange&) = delete;
 
@@ -47,11 +54,13 @@ class DataRange {
   // lead to OOM because the end might not be reached.
   // Define move constructor and move assignment, disallow copy constructor and
   // copy assignment (below).
-  DataRange(DataRange&& other) V8_NOEXCEPT : DataRange(other.data_) {
+  DataRange(DataRange&& other) V8_NOEXCEPT : data_(other.data_),
+                                             rng_(other.rng_) {
     other.data_ = {};
   }
   DataRange& operator=(DataRange&& other) V8_NOEXCEPT {
     data_ = other.data_;
+    rng_ = other.rng_;
     other.data_ = {};
     return *this;
   }
@@ -59,24 +68,56 @@ class DataRange {
   size_t size() const { return data_.size(); }
 
   DataRange split() {
-    uint16_t num_bytes = get<uint16_t>() % std::max(size_t{1}, data_.size());
-    DataRange split(data_.SubVector(0, num_bytes));
+    // As we might split many times, only use 2 bytes if the data size is large.
+    uint16_t random_choice = data_.size() > std::numeric_limits<uint8_t>::max()
+                                 ? get<uint16_t>()
+                                 : get<uint8_t>();
+    uint16_t num_bytes = random_choice % std::max(size_t{1}, data_.size());
+    int64_t new_seed = rng_.initial_seed() ^ rng_.NextInt64();
+    DataRange split(data_.SubVector(0, num_bytes), new_seed);
     data_ += num_bytes;
     return split;
   }
 
   template <typename T, size_t max_bytes = sizeof(T)>
+  T getPseudoRandom() {
+    static_assert(!std::is_same<T, bool>::value, "bool needs special handling");
+    static_assert(max_bytes <= sizeof(T));
+    // Special handling for signed integers: Calling getPseudoRandom<int32_t, 1>
+    // () should be equal to getPseudoRandom<int8_t>(). (The NextBytes() below
+    // does not achieve that due to depending on endianness and either never
+    // generating negative values or filling in the highest significant bits
+    // which would be unexpected).
+    if constexpr (std::is_integral_v<T> && std::is_signed_v<T>) {
+      switch (max_bytes) {
+        case 1:
+          return static_cast<int8_t>(getPseudoRandom<uint8_t>());
+        case 2:
+          return static_cast<int16_t>(getPseudoRandom<uint16_t>());
+        case 4:
+          return static_cast<int32_t>(getPseudoRandom<uint32_t>());
+        default:
+          return static_cast<T>(
+              getPseudoRandom<std::make_unsigned_t<T>, max_bytes>());
+      }
+    }
+
+    T result{};
+    rng_.NextBytes(&result, max_bytes);
+    return result;
+  }
+
+  template <typename T>
   T get() {
     // Bool needs special handling (see template specialization below).
     static_assert(!std::is_same<T, bool>::value, "bool needs special handling");
-    static_assert(max_bytes <= sizeof(T));
+
     // We want to support the case where we have less than sizeof(T) bytes
-    // remaining in the slice. For example, if we emit an i32 constant, it's
-    // okay if we don't have a full four bytes available, we'll just use what
-    // we have. We aren't concerned about endianness because we are generating
-    // arbitrary expressions.
-    const size_t num_bytes = std::min(max_bytes, data_.size());
-    T result = T();
+    // remaining in the slice. We'll just use what we have, so we get a bit of
+    // randomness when there are still some bytes left. If size == 0, get<T>()
+    // returns the type's value-initialized value.
+    const size_t num_bytes = std::min(sizeof(T), data_.size());
+    T result{};
     memcpy(&result, data_.begin(), num_bytes);
     data_ += num_bytes;
     return result;
@@ -97,32 +138,38 @@ bool DataRange::get() {
   return get<uint8_t>() % 2;
 }
 
-enum NonNullables { kAllowNonNullables, kDisallowNonNullables };
+enum NumericTypes { kIncludeNumericTypes, kExcludeNumericTypes };
 enum PackedTypes { kIncludePackedTypes, kExcludePackedTypes };
-enum Generics { kIncludeGenerics, kExcludeGenerics };
+enum Generics {
+  kAlwaysIncludeAllGenerics,
+  kExcludeSomeGenericsWhenTypeIsNonNullable
+};
 
 ValueType GetValueTypeHelper(DataRange* data, uint32_t num_nullable_types,
                              uint32_t num_non_nullable_types,
-                             NonNullables allow_non_nullable,
+                             NumericTypes include_numeric_types,
                              PackedTypes include_packed_types,
                              Generics include_generics) {
+  std::vector<ValueType> types;
   // Non wasm-gc types.
-  std::vector<ValueType> types{kWasmI32, kWasmI64, kWasmF32, kWasmF64,
-                               kWasmS128};
-
-  if (include_packed_types == kIncludePackedTypes) {
-    types.insert(types.end(), {kWasmI8, kWasmI16});
+  if (include_numeric_types == kIncludeNumericTypes) {
+    types.insert(types.end(),
+                 {kWasmI32, kWasmI64, kWasmF32, kWasmF64, kWasmS128});
+    if (include_packed_types == kIncludePackedTypes) {
+      types.insert(types.end(), {kWasmI8, kWasmI16});
+    }
   }
   // Decide if the return type will be nullable or not.
-  const bool nullable =
-      (allow_non_nullable == kAllowNonNullables) ? data->get<bool>() : true;
+  const bool nullable = data->get<bool>();
+
+  types.insert(types.end(), {kWasmI31Ref, kWasmFuncRef});
   if (nullable) {
     types.insert(types.end(),
-                 {kWasmI31Ref, kWasmFuncRef, kWasmExternRef, kWasmNullRef,
-                  kWasmNullExternRef, kWasmNullFuncRef});
+                 {kWasmNullRef, kWasmNullExternRef, kWasmNullFuncRef});
   }
-  if (include_generics == kIncludeGenerics) {
-    types.insert(types.end(), {kWasmStructRef, kWasmAnyRef, kWasmEqRef});
+  if (nullable || include_generics == kAlwaysIncludeAllGenerics) {
+    types.insert(types.end(), {kWasmStructRef, kWasmArrayRef, kWasmAnyRef,
+                               kWasmEqRef, kWasmExternRef});
   }
 
   // The last index of user-defined types allowed is different based on the
@@ -150,8 +197,35 @@ ValueType GetValueTypeHelper(DataRange* data, uint32_t num_nullable_types,
 }
 
 ValueType GetValueType(DataRange* data, uint32_t num_types) {
-  return GetValueTypeHelper(data, num_types, num_types, kAllowNonNullables,
-                            kExcludePackedTypes, kIncludeGenerics);
+  return GetValueTypeHelper(data, num_types, num_types, kIncludeNumericTypes,
+                            kExcludePackedTypes, kAlwaysIncludeAllGenerics);
+}
+
+void GeneratePassiveDataSegment(DataRange* range, WasmModuleBuilder* builder) {
+  int length = range->get<uint8_t>() % 65;
+  ZoneVector<uint8_t> data(length, builder->zone());
+  for (int i = 0; i < length; ++i) {
+    data[i] = range->getPseudoRandom<uint8_t>();
+  }
+  builder->AddPassiveDataSegment(data.data(),
+                                 static_cast<uint32_t>(data.size()));
+}
+
+uint32_t GenerateRefTypeElementSegment(DataRange* range,
+                                       WasmModuleBuilder* builder,
+                                       ValueType element_type) {
+  DCHECK(element_type.is_object_reference());
+  DCHECK(element_type.has_index());
+  WasmModuleBuilder::WasmElemSegment segment(
+      builder->zone(), element_type, false,
+      WasmInitExpr::RefNullConst(element_type.heap_representation()));
+  size_t element_count = range->get<uint8_t>() % 11;
+  for (size_t i = 0; i < element_count; ++i) {
+    segment.entries.emplace_back(
+        WasmModuleBuilder::WasmElemSegment::Entry::kRefNullEntry,
+        element_type.ref_index());
+  }
+  return builder->AddElementSegment(std::move(segment));
 }
 
 class WasmGenerator {
@@ -327,7 +401,7 @@ class WasmGenerator {
   void br(DataRange* data) {
     // There is always at least the block representing the function body.
     DCHECK(!blocks_.empty());
-    const uint32_t target_block = data->get<uint32_t>() % blocks_.size();
+    const uint32_t target_block = data->get<uint8_t>() % blocks_.size();
     const auto break_types = blocks_[target_block];
 
     Generate(base::VectorOf(break_types), data);
@@ -339,7 +413,7 @@ class WasmGenerator {
   void br_if(DataRange* data) {
     // There is always at least the block representing the function body.
     DCHECK(!blocks_.empty());
-    const uint32_t target_block = data->get<uint32_t>() % blocks_.size();
+    const uint32_t target_block = data->get<uint8_t>() % blocks_.size();
     const auto break_types = base::VectorOf(blocks_[target_block]);
 
     Generate(break_types, data);
@@ -357,10 +431,10 @@ class WasmGenerator {
   template <ValueKind wanted_kind>
   void br_on_null(DataRange* data) {
     DCHECK(!blocks_.empty());
-    const uint32_t target_block = data->get<uint32_t>() % blocks_.size();
+    const uint32_t target_block = data->get<uint8_t>() % blocks_.size();
     const auto break_types = base::VectorOf(blocks_[target_block]);
     Generate(break_types, data);
-    GenerateRef(HeapType(HeapType::kAny), data);
+    GenerateRef(data);
     builder_->EmitWithI32V(
         kExprBrOnNull,
         static_cast<uint32_t>(blocks_.size()) - 1 - target_block);
@@ -373,6 +447,85 @@ class WasmGenerator {
         data);
   }
 
+  template <ValueKind wanted_kind>
+  void br_on_non_null(DataRange* data) {
+    DCHECK(!blocks_.empty());
+    const uint32_t target_block = data->get<uint8_t>() % blocks_.size();
+    const auto break_types = base::VectorOf(blocks_[target_block]);
+    if (break_types.empty() ||
+        !break_types[break_types.size() - 1].is_reference()) {
+      // Invalid break_types for br_on_non_null.
+      Generate<wanted_kind>(data);
+      return;
+    }
+    Generate(break_types, data);
+    builder_->EmitWithI32V(
+        kExprBrOnNonNull,
+        static_cast<uint32_t>(blocks_.size()) - 1 - target_block);
+    ConsumeAndGenerate(
+        base::VectorOf(break_types.data(), break_types.size() - 1),
+        wanted_kind == kVoid
+            ? base::Vector<ValueType>{}
+            : base::VectorOf({ValueType::Primitive(wanted_kind)}),
+        data);
+  }
+
+  void br_table(ValueType result_type, DataRange* data) {
+    const uint8_t block_count = 1 + data->get<uint8_t>() % 8;
+    // Generate the block entries.
+    uint16_t entry_bits =
+        block_count > 4 ? data->get<uint16_t>() : data->get<uint8_t>();
+    for (size_t i = 0; i < block_count; ++i) {
+      builder_->Emit(kExprBlock);
+      builder_->EmitValueType(result_type);
+      blocks_.emplace_back();
+      if (result_type != kWasmVoid) {
+        blocks_.back().push_back(result_type);
+      }
+      // There can be additional instructions in each block.
+      // Only generate it with a 25% chance as it's otherwise quite unlikely to
+      // have enough random bytes left for the br_table instruction.
+      if ((entry_bits & 3) == 3) {
+        Generate(kWasmVoid, data);
+      }
+      entry_bits >>= 2;
+    }
+    // Generate the br_table.
+    Generate(result_type, data);
+    Generate(kWasmI32, data);
+    builder_->Emit(kExprBrTable);
+    uint32_t entry_count = 1 + data->get<uint8_t>() % 8;
+    builder_->EmitU32V(entry_count);
+    for (size_t i = 0; i < entry_count + 1; ++i) {
+      builder_->EmitU32V(data->get<uint8_t>() % block_count);
+    }
+    // Generate the block ends.
+    uint8_t exit_bits = result_type == kWasmVoid ? 0 : data->get<uint8_t>();
+    for (size_t i = 0; i < block_count; ++i) {
+      if (exit_bits & 1) {
+        // Drop and generate new value.
+        builder_->Emit(kExprDrop);
+        Generate(result_type, data);
+      }
+      exit_bits >>= 1;
+      builder_->Emit(kExprEnd);
+      blocks_.pop_back();
+    }
+  }
+
+  template <ValueKind wanted_kind>
+  void br_table(DataRange* data) {
+    br_table(
+        wanted_kind == kVoid ? kWasmVoid : ValueType::Primitive(wanted_kind),
+        data);
+  }
+
+  void return_op(DataRange* data) {
+    auto returns = builder_->signature()->returns();
+    Generate(base::VectorOf(returns.begin(), returns.size()), data);
+    builder_->Emit(kExprReturn);
+  }
+
   // TODO(eholk): make this function constexpr once gcc supports it
   static uint8_t max_alignment(WasmOpcode memop) {
     switch (memop) {
@@ -488,8 +641,13 @@ class WasmGenerator {
 
   template <WasmOpcode memory_op, ValueKind... arg_kinds>
   void memop(DataRange* data) {
-    const uint8_t align = data->get<uint8_t>() % (max_alignment(memory_op) + 1);
-    const uint32_t offset = data->get<uint32_t>();
+    const uint8_t align =
+        data->getPseudoRandom<uint8_t>() % (max_alignment(memory_op) + 1);
+    uint32_t offset = data->get<uint16_t>();
+    // With a 1/256 chance generate potentially very large offsets.
+    if ((offset & 0xff) == 0xff) {
+      offset = data->getPseudoRandom<uint32_t>();
+    }
 
     // Generate the index and the arguments, if any.
     Generate<kI32, arg_kinds...>(data);
@@ -506,8 +664,13 @@ class WasmGenerator {
 
   template <WasmOpcode Op, ValueKind... Args>
   void atomic_op(DataRange* data) {
-    const uint8_t align = data->get<uint8_t>() % (max_alignment(Op) + 1);
-    const uint32_t offset = data->get<uint32_t>();
+    const uint8_t align =
+        data->getPseudoRandom<uint8_t>() % (max_alignment(Op) + 1);
+    uint32_t offset = data->get<uint16_t>();
+    // With a 1/256 chance generate potentially very large offsets.
+    if ((offset & 0xff) == 0xff) {
+      offset = data->getPseudoRandom<uint32_t>();
+    }
 
     Generate<Args...>(data);
     builder_->EmitWithPrefix(Op);
@@ -525,7 +688,7 @@ class WasmGenerator {
   void simd_const(DataRange* data) {
     builder_->EmitWithPrefix(kExprS128Const);
     for (int i = 0; i < kSimd128Size; i++) {
-      builder_->EmitByte(data->get<byte>());
+      builder_->EmitByte(data->getPseudoRandom<uint8_t>());
     }
   }
 
@@ -533,21 +696,21 @@ class WasmGenerator {
   void simd_lane_op(DataRange* data) {
     Generate<Args...>(data);
     builder_->EmitWithPrefix(Op);
-    builder_->EmitByte(data->get<byte>() % lanes);
+    builder_->EmitByte(data->get<uint8_t>() % lanes);
   }
 
   template <WasmOpcode Op, int lanes, ValueKind... Args>
   void simd_lane_memop(DataRange* data) {
     // Simd load/store instructions that have a lane immediate.
     memop<Op, Args...>(data);
-    builder_->EmitByte(data->get<byte>() % lanes);
+    builder_->EmitByte(data->get<uint8_t>() % lanes);
   }
 
   void simd_shuffle(DataRange* data) {
     Generate<kS128, kS128>(data);
     builder_->EmitWithPrefix(kExprI8x16Shuffle);
     for (int i = 0; i < kSimd128Size; i++) {
-      builder_->EmitByte(static_cast<uint8_t>(data->get<byte>() % 32));
+      builder_->EmitByte(static_cast<uint8_t>(data->get<uint8_t>() % 32));
     }
   }
 
@@ -603,6 +766,19 @@ class WasmGenerator {
     builder_->Emit(kConvertOpcodes[arr_idx]);
   }
 
+  int choose_function_table_index(DataRange* data) {
+    int table_count = builder_->builder()->NumTables();
+    int start = data->get<uint8_t>() % table_count;
+    for (int i = 0; i < table_count; ++i) {
+      int index = (start + i) % table_count;
+      if (builder_->builder()->GetTableType(index).is_reference_to(
+              HeapType::kFunc)) {
+        return index;
+      }
+    }
+    FATAL("No funcref table found; table index 0 is expected to be funcref");
+  }
+
   void call(DataRange* data, ValueType wanted_kind, CallKind call_kind) {
     uint8_t random_byte = data->get<uint8_t>();
     int func_index = random_byte % functions_.size();
@@ -627,8 +803,7 @@ class WasmGenerator {
         // func_index.
         builder_->EmitI32Const(func_index);
         builder_->EmitWithU32V(kExprReturnCallIndirect, sig_index);
-        // TODO(11954): Use other table indices too.
-        builder_->EmitByte(0);  // Table index.
+        builder_->EmitByte(choose_function_table_index(data));  // Table index.
       } else {
         GenerateRef(HeapType(sig_index), data);
         builder_->EmitWithU32V(kExprReturnCallRef, sig_index);
@@ -642,8 +817,7 @@ class WasmGenerator {
         // func_index.
         builder_->EmitI32Const(func_index);
         builder_->EmitWithU32V(kExprCallIndirect, sig_index);
-        // TODO(11954): Use other table indices too.
-        builder_->EmitByte(0);  // Table index.
+        builder_->EmitByte(choose_function_table_index(data));  // Table index.
       } else {
         GenerateRef(HeapType(sig_index), data);
         builder_->EmitWithU32V(kExprCallRef, sig_index);
@@ -724,12 +898,12 @@ class WasmGenerator {
 
   template <size_t num_bytes>
   void i32_const(DataRange* data) {
-    builder_->EmitI32Const(data->get<int32_t, num_bytes>());
+    builder_->EmitI32Const(data->getPseudoRandom<int32_t, num_bytes>());
   }
 
   template <size_t num_bytes>
   void i64_const(DataRange* data) {
-    builder_->EmitI64Const(data->get<int64_t, num_bytes>());
+    builder_->EmitI64Const(data->getPseudoRandom<int64_t, num_bytes>());
   }
 
   Var GetRandomGlobal(DataRange* data, bool ensure_mutable) {
@@ -820,11 +994,15 @@ class WasmGenerator {
 
   bool get_local_ref(HeapType type, DataRange* data, Nullability nullable) {
     Var local = GetRandomLocal(data);
-    // TODO(manoskouk): Ideally we would check for subtyping here over type
+    // TODO(14034): Ideally we would check for subtyping here over type
     // equality, but we don't have a module.
-    // TODO(7748): Allow initialized non-nullable locals.
-    if (nullable == kNullable && local.is_valid() &&
-        local.type.is_object_reference() && type == local.type.heap_type()) {
+    if (local.is_valid() && local.type.is_object_reference() &&
+        local.type.heap_type() == type &&
+        (local.type.is_nullable()
+             ? nullable == kNullable  // We check for nullability-subtyping
+             : locals_initialized_    // If the local is not nullable, we cannot
+                                      // use it during locals initialization
+         )) {
       builder_->EmitWithU32V(kExprLocalGet, local.index);
       return true;
     }
@@ -856,25 +1034,80 @@ class WasmGenerator {
         builder_->EmitU32V(index);
       }
     } else if (builder_->builder()->IsArrayType(index)) {
-      bool can_be_defaultable = builder_->builder()
-                                    ->GetArrayType(index)
-                                    ->element_type()
-                                    .is_defaultable();
-      if (new_default && can_be_defaultable) {
-        Generate(kWasmI32, data);
-        builder_->EmitI32Const(kMaxArraySize);
-        builder_->Emit(kExprI32RemS);
-        builder_->EmitWithPrefix(kExprArrayNewDefault);
-        builder_->EmitU32V(index);
-      } else {
-        Generate(
-            builder_->builder()->GetArrayType(index)->element_type().Unpacked(),
-            data);
-        Generate(kWasmI32, data);
-        builder_->EmitI32Const(kMaxArraySize);
-        builder_->Emit(kExprI32RemS);
-        builder_->EmitWithPrefix(kExprArrayNew);
-        builder_->EmitU32V(index);
+      ValueType element_type =
+          builder_->builder()->GetArrayType(index)->element_type();
+      bool can_be_defaultable = element_type.is_defaultable();
+      WasmOpcode array_new_op[] = {
+          kExprArrayNew,        kExprArrayNewFixed,
+          kExprArrayNewData,    kExprArrayNewElem,
+          kExprArrayNewDefault,  // default op has to be at the end of the list.
+      };
+      size_t op_size = arraysize(array_new_op);
+      if (!can_be_defaultable) --op_size;
+      switch (array_new_op[data->get<uint8_t>() % op_size]) {
+        case kExprArrayNewElem:
+        case kExprArrayNewData: {
+          // This is more restrictive than it has to be.
+          // TODO(14034): Also support nonnullable and non-index reference
+          // types.
+          if (element_type.is_reference() && element_type.is_nullable() &&
+              element_type.has_index()) {
+            // Add a new element segment with the corresponding type.
+            uint32_t element_segment = GenerateRefTypeElementSegment(
+                data, builder_->builder(), element_type);
+            // Generate offset, length.
+            // TODO(14034): Change the distribution here to make it more likely
+            // that the numbers are in range.
+            Generate(base::VectorOf({kWasmI32, kWasmI32}), data);
+            // Generate array.new_elem instruction.
+            builder_->EmitWithPrefix(kExprArrayNewElem);
+            builder_->EmitU32V(index);
+            builder_->EmitU32V(element_segment);
+            break;
+          } else if (!element_type.is_reference()) {
+            // Lazily create a data segment if the module doesn't have one yet.
+            if (builder_->builder()->NumDataSegments() == 0) {
+              GeneratePassiveDataSegment(data, builder_->builder());
+            }
+            int data_index =
+                data->get<uint8_t>() % builder_->builder()->NumDataSegments();
+            // Generate offset, length.
+            Generate(base::VectorOf({kWasmI32, kWasmI32}), data);
+            builder_->EmitWithPrefix(kExprArrayNewData);
+            builder_->EmitU32V(index);
+            builder_->EmitU32V(data_index);
+            break;
+          }
+          V8_FALLTHROUGH;  // To array.new.
+        }
+        case kExprArrayNew:
+          Generate(element_type.Unpacked(), data);
+          Generate(kWasmI32, data);
+          builder_->EmitI32Const(kMaxArraySize);
+          builder_->Emit(kExprI32RemS);
+          builder_->EmitWithPrefix(kExprArrayNew);
+          builder_->EmitU32V(index);
+          break;
+        case kExprArrayNewFixed: {
+          size_t element_count =
+              std::min(static_cast<size_t>(data->get<uint8_t>()), data->size());
+          for (size_t i = 0; i < element_count; ++i) {
+            Generate(element_type.Unpacked(), data);
+          }
+          builder_->EmitWithPrefix(kExprArrayNewFixed);
+          builder_->EmitU32V(index);
+          builder_->EmitU32V(static_cast<uint32_t>(element_count));
+          break;
+        }
+        case kExprArrayNewDefault:
+          Generate(kWasmI32, data);
+          builder_->EmitI32Const(kMaxArraySize);
+          builder_->Emit(kExprI32RemS);
+          builder_->EmitWithPrefix(kExprArrayNewDefault);
+          builder_->EmitU32V(index);
+          break;
+        default:
+          FATAL("Unimplemented opcode");
       }
     } else {
       // Map the type index to a function index.
@@ -1011,7 +1244,6 @@ class WasmGenerator {
 
   void i31_get(DataRange* data) {
     GenerateRef(HeapType(HeapType::kI31), data);
-    builder_->Emit(kExprRefAsNonNull);
     if (data->get<bool>()) {
       builder_->EmitWithPrefix(kExprI31GetS);
     } else {
@@ -1020,14 +1252,109 @@ class WasmGenerator {
   }
 
   void array_len(DataRange* data) {
-    if (num_arrays_ > 1) {
-      int array_index = (data->get<uint8_t>() % num_arrays_) + num_structs_;
-      DCHECK(builder_->builder()->IsArrayType(array_index));
-      GenerateRef(HeapType(array_index), data);
-      builder_->EmitWithPrefix(kExprArrayLen);
-    } else {
+    if (num_arrays_ == 0) {
       Generate(kWasmI32, data);
+      return;
     }
+    GenerateRef(HeapType(HeapType::kArray), data);
+    builder_->EmitWithPrefix(kExprArrayLen);
+  }
+
+  void array_copy(DataRange* data) {
+    if (num_arrays_ == 0) {
+      return;
+    }
+    // TODO(14034): The source element type only has to be a subtype of the
+    // destination element type. Currently this only generates copy from same
+    // typed arrays.
+    int array_index = (data->get<uint8_t>() % num_arrays_) + num_structs_;
+    DCHECK(builder_->builder()->IsArrayType(array_index));
+    GenerateRef(HeapType(array_index), data);  // destination
+    Generate(kWasmI32, data);                  // destination index
+    GenerateRef(HeapType(array_index), data);  // source
+    Generate(kWasmI32, data);                  // source index
+    Generate(kWasmI32, data);                  // length
+    builder_->EmitWithPrefix(kExprArrayCopy);
+    builder_->EmitU32V(array_index);  // destination array type index
+    builder_->EmitU32V(array_index);  // source array type index
+  }
+
+  void array_fill(DataRange* data) {
+    if (num_arrays_ == 0) {
+      return;
+    }
+    int array_index = (data->get<uint8_t>() % num_arrays_) + num_structs_;
+    DCHECK(builder_->builder()->IsArrayType(array_index));
+    ValueType element_type = builder_->builder()
+                                 ->GetArrayType(array_index)
+                                 ->element_type()
+                                 .Unpacked();
+    GenerateRef(HeapType(array_index), data);  // array
+    Generate(kWasmI32, data);                  // offset
+    Generate(element_type, data);              // value
+    Generate(kWasmI32, data);                  // length
+    builder_->EmitWithPrefix(kExprArrayFill);
+    builder_->EmitU32V(array_index);
+  }
+
+  void array_init_data(DataRange* data) {
+    if (num_arrays_ == 0) {
+      return;
+    }
+    int array_index = (data->get<uint8_t>() % num_arrays_) + num_structs_;
+    DCHECK(builder_->builder()->IsArrayType(array_index));
+    const ArrayType* array_type =
+        builder_->builder()->GetArrayType(array_index);
+    DCHECK(array_type->mutability());
+    ValueType element_type = array_type->element_type().Unpacked();
+    if (element_type.is_reference()) {
+      return;
+    }
+    if (builder_->builder()->NumDataSegments() == 0) {
+      GeneratePassiveDataSegment(data, builder_->builder());
+    }
+
+    int data_index =
+        data->get<uint8_t>() % builder_->builder()->NumDataSegments();
+    // Generate array, index, data_offset, length.
+    Generate(base::VectorOf({ValueType::RefNull(array_index), kWasmI32,
+                             kWasmI32, kWasmI32}),
+             data);
+    builder_->EmitWithPrefix(kExprArrayInitData);
+    builder_->EmitU32V(array_index);
+    builder_->EmitU32V(data_index);
+  }
+
+  void array_init_elem(DataRange* data) {
+    if (num_arrays_ == 0) {
+      return;
+    }
+    int array_index = (data->get<uint8_t>() % num_arrays_) + num_structs_;
+    DCHECK(builder_->builder()->IsArrayType(array_index));
+    const ArrayType* array_type =
+        builder_->builder()->GetArrayType(array_index);
+    DCHECK(array_type->mutability());
+    ValueType element_type = array_type->element_type().Unpacked();
+    // This is more restrictive than it has to be.
+    // TODO(14034): Also support nonnullable and non-index reference
+    // types.
+    if (!element_type.is_reference() || element_type.is_non_nullable() ||
+        !element_type.has_index()) {
+      return;
+    }
+    // Add a new element segment with the corresponding type.
+    uint32_t element_segment =
+        GenerateRefTypeElementSegment(data, builder_->builder(), element_type);
+    // Generate array, index, elem_offset, length.
+    // TODO(14034): Change the distribution here to make it more likely
+    // that the numbers are in range.
+    Generate(base::VectorOf({ValueType::RefNull(array_index), kWasmI32,
+                             kWasmI32, kWasmI32}),
+             data);
+    // Generate array.new_elem instruction.
+    builder_->EmitWithPrefix(kExprArrayInitElem);
+    builder_->EmitU32V(array_index);
+    builder_->EmitU32V(element_segment);
   }
 
   void array_set(DataRange* data) {
@@ -1062,6 +1389,7 @@ class WasmGenerator {
       DCHECK(builder->IsStructType(i));
       int field_count = builder->GetStructType(i)->field_count();
       for (int index = 0; index < field_count; index++) {
+        // TODO(14034): This should be a subtype check!
         if (builder->GetStructType(i)->field(index) == value_type) {
           field_index.push_back(index);
           struct_index.push_back(i);
@@ -1100,6 +1428,196 @@ class WasmGenerator {
     return struct_get_helper(needed_type, data);
   }
 
+  bool ref_cast(HeapType type, DataRange* data, Nullability nullable) {
+    HeapType input_type = top_type(type);
+    GenerateRef(input_type, data);
+    builder_->EmitWithPrefix(nullable ? kExprRefCastNull : kExprRefCast);
+    builder_->EmitI32V(type.code());
+    return true;  // It always produces the desired result type.
+  }
+
+  HeapType top_type(HeapType type) {
+    switch (type.representation()) {
+      case HeapType::kAny:
+      case HeapType::kEq:
+      case HeapType::kArray:
+      case HeapType::kStruct:
+      case HeapType::kI31:
+      case HeapType::kNone:
+        return HeapType(HeapType::kAny);
+      case HeapType::kExtern:
+      case HeapType::kNoExtern:
+        return HeapType(HeapType::kExtern);
+      case HeapType::kFunc:
+      case HeapType::kNoFunc:
+        return HeapType(HeapType::kFunc);
+      default:
+        DCHECK(type.is_index());
+        if (builder_->builder()->IsSignature(type.ref_index())) {
+          return HeapType(HeapType::kFunc);
+        }
+        DCHECK(builder_->builder()->IsStructType(type.ref_index()) ||
+               builder_->builder()->IsArrayType(type.ref_index()));
+        return HeapType(HeapType::kAny);
+    }
+  }
+
+  HeapType choose_sub_type(HeapType type, DataRange* data) {
+    switch (type.representation()) {
+      case HeapType::kAny: {
+        constexpr HeapType::Representation generic_types[] = {
+            HeapType::kAny,    HeapType::kEq,  HeapType::kArray,
+            HeapType::kStruct, HeapType::kI31, HeapType::kNone,
+        };
+        const int type_count = num_arrays_ + num_structs_;
+        const int choice =
+            data->get<uint8_t>() % (type_count + arraysize(generic_types));
+        return choice >= type_count
+                   ? HeapType(generic_types[choice - type_count])
+                   : HeapType(choice);
+      }
+      case HeapType::kEq: {
+        constexpr HeapType::Representation generic_types[] = {
+            HeapType::kEq,  HeapType::kArray, HeapType::kStruct,
+            HeapType::kI31, HeapType::kNone,
+        };
+        const int type_count = num_arrays_ + num_structs_;
+        const int choice =
+            data->get<uint8_t>() % (type_count + arraysize(generic_types));
+        return choice >= type_count
+                   ? HeapType(generic_types[choice - type_count])
+                   : HeapType(choice);
+      }
+      case HeapType::kStruct: {
+        constexpr HeapType::Representation generic_types[] = {
+            HeapType::kStruct,
+            HeapType::kNone,
+        };
+        const int type_count = num_structs_;
+        const int choice =
+            data->get<uint8_t>() % (type_count + arraysize(generic_types));
+        return choice >= type_count
+                   ? HeapType(generic_types[choice - type_count])
+                   : HeapType(choice);
+      }
+      case HeapType::kArray: {
+        constexpr HeapType::Representation generic_types[] = {
+            HeapType::kArray,
+            HeapType::kNone,
+        };
+        const int type_count = num_arrays_;
+        const int choice =
+            data->get<uint8_t>() % (type_count + arraysize(generic_types));
+        return choice >= type_count
+                   ? HeapType(generic_types[choice - type_count])
+                   : HeapType(choice + num_structs_);
+      }
+      case HeapType::kFunc: {
+        constexpr HeapType::Representation generic_types[] = {
+            HeapType::kFunc, HeapType::kNoFunc};
+        const int type_count = static_cast<int>(functions_.size());
+        const int choice =
+            data->get<uint8_t>() % (type_count + arraysize(generic_types));
+        return choice >= type_count
+                   ? HeapType(generic_types[choice - type_count])
+                   : HeapType(functions_[choice]);
+      }
+      case HeapType::kExtern:
+        return HeapType(data->get<bool>() ? HeapType::kExtern
+                                          : HeapType::kNoExtern);
+      default:
+        if (!type.is_index()) {
+          // No logic implemented to find a sub-type.
+          return type;
+        }
+        // Collect all (direct) sub types.
+        // TODO(14034): Also collect indirect sub types.
+        std::vector<uint32_t> subtypes;
+        uint32_t type_count = builder_->builder()->NumTypes();
+        for (uint32_t i = 0; i < type_count; ++i) {
+          if (builder_->builder()->GetSuperType(i) == type.ref_index()) {
+            subtypes.push_back(i);
+          }
+        }
+        return subtypes.empty()
+                   ? type  // no downcast possible
+                   : HeapType(subtypes[data->get<uint8_t>() % subtypes.size()]);
+    }
+  }
+
+  bool br_on_cast(HeapType type, DataRange* data, Nullability nullable) {
+    DCHECK(!blocks_.empty());
+    const uint32_t target_block = data->get<uint8_t>() % blocks_.size();
+    const uint32_t block_index =
+        static_cast<uint32_t>(blocks_.size()) - 1 - target_block;
+    const auto break_types = base::VectorOf(blocks_[target_block]);
+    if (break_types.empty()) {
+      return false;
+    }
+    ValueType break_type = break_types[break_types.size() - 1];
+    if (!break_type.is_reference()) {
+      return false;
+    }
+
+    Generate(base::VectorOf(break_types.data(), break_types.size() - 1), data);
+    if (data->get<bool>()) {
+      // br_on_cast
+      HeapType source_type = top_type(break_type.heap_type());
+      const bool source_is_nullable = data->get<bool>();
+      GenerateRef(source_type, data,
+                  source_is_nullable ? kNullable : kNonNullable);
+      const bool target_is_nullable =
+          source_is_nullable && break_type.is_nullable() && data->get<bool>();
+      builder_->EmitWithPrefix(kExprBrOnCastGeneric);
+      builder_->EmitU32V(source_is_nullable + (target_is_nullable << 1));
+      builder_->EmitU32V(block_index);
+      builder_->EmitI32V(source_type.code());             // source type
+      builder_->EmitI32V(break_type.heap_type().code());  // target type
+      // Fallthrough: Generate the actually desired ref type.
+      ConsumeAndGenerate(break_types, {}, data);
+      GenerateRef(type, data, nullable);
+    } else {
+      // br_on_cast_fail
+      HeapType source_type = break_type.heap_type();
+      const bool source_is_nullable = data->get<bool>();
+      GenerateRef(source_type, data,
+                  source_is_nullable ? kNullable : kNonNullable);
+      const bool target_is_nullable =
+          source_is_nullable &&
+          (!break_type.is_nullable() || data->get<bool>());
+      HeapType target_type = choose_sub_type(source_type, data);
+
+      builder_->EmitWithPrefix(kExprBrOnCastFailGeneric);
+      builder_->EmitU32V(source_is_nullable + (target_is_nullable << 1));
+      builder_->EmitU32V(block_index);
+      builder_->EmitI32V(source_type.code());
+      builder_->EmitI32V(target_type.code());
+      // Fallthrough: Generate the actually desired ref type.
+      ConsumeAndGenerate(break_types, {}, data);
+      GenerateRef(type, data, nullable);
+    }
+    return true;
+  }
+
+  bool extern_internalize(HeapType type, DataRange* data,
+                          Nullability nullable) {
+    if (type.representation() != HeapType::kAny) {
+      return false;
+    }
+    GenerateRef(HeapType(HeapType::kExtern), data);
+    builder_->EmitWithPrefix(kExprExternInternalize);
+    if (nullable == kNonNullable) {
+      builder_->Emit(kExprRefAsNonNull);
+    }
+    return true;
+  }
+
+  bool ref_as_non_null(HeapType type, DataRange* data, Nullability nullable) {
+    GenerateRef(type, data, kNullable);
+    builder_->Emit(kExprRefAsNonNull);
+    return true;
+  }
+
   void struct_set(DataRange* data) {
     WasmModuleBuilder* builder = builder_->builder();
     if (num_structs_ > 0) {
@@ -1125,12 +1643,27 @@ class WasmGenerator {
     }
   }
 
-  template <ValueKind wanted_kind>
   void ref_is_null(DataRange* data) {
     GenerateRef(HeapType(HeapType::kAny), data);
     builder_->Emit(kExprRefIsNull);
   }
 
+  template <WasmOpcode opcode>
+  void ref_test(DataRange* data) {
+    GenerateRef(HeapType(HeapType::kAny), data);
+    constexpr int generic_types[] = {kAnyRefCode,    kEqRefCode, kArrayRefCode,
+                                     kStructRefCode, kNoneCode,  kI31RefCode};
+    int num_types = num_structs_ + num_arrays_;
+    int num_all_types = num_types + arraysize(generic_types);
+    int type_choice = data->get<uint8_t>() % num_all_types;
+    builder_->EmitWithPrefix(opcode);
+    if (type_choice < num_types) {
+      builder_->EmitU32V(type_choice);
+    } else {
+      builder_->EmitU32V(generic_types[type_choice - num_types]);
+    }
+  }
+
   void ref_eq(DataRange* data) {
     GenerateRef(HeapType(HeapType::kEq), data);
     GenerateRef(HeapType(HeapType::kEq), data);
@@ -1208,7 +1741,8 @@ class WasmGenerator {
         globals_(globals),
         mutable_globals_(mutable_globals),
         num_structs_(num_structs),
-        num_arrays_(num_arrays) {
+        num_arrays_(num_arrays),
+        locals_initialized_(false) {
     const FunctionSig* sig = fn->signature();
     blocks_.emplace_back();
     for (size_t i = 0; i < sig->return_count(); ++i) {
@@ -1219,9 +1753,7 @@ class WasmGenerator {
     uint32_t num_types =
         static_cast<uint32_t>(functions_.size()) + num_structs_ + num_arrays_;
     for (ValueType& local : locals_) {
-      local =
-          GetValueTypeHelper(data, num_types, num_types, kDisallowNonNullables,
-                             kExcludePackedTypes, kIncludeGenerics);
+      local = GetValueType(data, num_types);
       fn->AddLocal(local);
     }
   }
@@ -1234,11 +1766,17 @@ class WasmGenerator {
   template <ValueKind T1, ValueKind T2, ValueKind... Ts>
   void Generate(DataRange* data) {
     // TODO(clemensb): Implement a more even split.
+    // TODO(mliedtke): Instead of splitting we should probably "reserve" amount
+    // x for the first part, any reserved but potentially unused random bytes
+    // should then carry over instead of throwing them away which heavily
+    // reduces the amount of actually used random input bytes.
     auto first_data = data->split();
     Generate<T1>(&first_data);
     Generate<T2, Ts...>(data);
   }
 
+  void GenerateRef(DataRange* data);
+
   void GenerateRef(HeapType type, DataRange* data,
                    Nullability nullability = kNullable);
 
@@ -1249,6 +1787,18 @@ class WasmGenerator {
                           DataRange* data);
   bool HasSimd() { return has_simd_; }
 
+  void InitializeNonDefaultableLocals(DataRange* data) {
+    for (uint32_t i = 0; i < locals_.size(); i++) {
+      if (!locals_[i].is_defaultable()) {
+        GenerateRef(locals_[i].heap_type(), data, kNonNullable);
+        builder_->EmitWithU32V(
+            kExprLocalSet, i + static_cast<uint32_t>(
+                                   builder_->signature()->parameter_count()));
+      }
+    }
+    locals_initialized_ = true;
+  }
+
  private:
   WasmFunctionBuilder* builder_;
   std::vector<std::vector<ValueType>> blocks_;
@@ -1261,7 +1811,7 @@ class WasmGenerator {
   bool has_simd_;
   uint32_t num_structs_;
   uint32_t num_arrays_;
-  static constexpr uint32_t kMaxRecursionDepth = 64;
+  bool locals_initialized_;
 
   bool recursion_limit_reached() {
     return recursion_depth >= kMaxRecursionDepth;
@@ -1295,6 +1845,9 @@ void WasmGenerator::Generate<kVoid>(DataRange* data) {
       &WasmGenerator::br,
       &WasmGenerator::br_if<kVoid>,
       &WasmGenerator::br_on_null<kVoid>,
+      &WasmGenerator::br_on_non_null<kVoid>,
+      &WasmGenerator::br_table<kVoid>,
+      &WasmGenerator::return_op,
 
       &WasmGenerator::memop<kExprI32StoreMem, kI32>,
       &WasmGenerator::memop<kExprI32StoreMem8, kI32>,
@@ -1331,6 +1884,10 @@ void WasmGenerator::Generate<kVoid>(DataRange* data) {
 
       &WasmGenerator::struct_set,
       &WasmGenerator::array_set,
+      &WasmGenerator::array_copy,
+      &WasmGenerator::array_fill,
+      &WasmGenerator::array_init_data,
+      &WasmGenerator::array_init_elem,
 
       &WasmGenerator::table_set,
       &WasmGenerator::table_fill,
@@ -1343,7 +1900,7 @@ template <>
 void WasmGenerator::Generate<kI32>(DataRange* data) {
   GeneratorRecursionScope rec_scope(this);
   if (recursion_limit_reached() || data->size() <= 1) {
-    builder_->EmitI32Const(data->get<uint32_t>());
+    builder_->EmitI32Const(data->getPseudoRandom<uint32_t>());
     return;
   }
 
@@ -1422,6 +1979,8 @@ void WasmGenerator::Generate<kI32>(DataRange* data) {
       &WasmGenerator::if_<kI32, kIfElse>,
       &WasmGenerator::br_if<kI32>,
       &WasmGenerator::br_on_null<kI32>,
+      &WasmGenerator::br_on_non_null<kI32>,
+      &WasmGenerator::br_table<kI32>,
 
       &WasmGenerator::memop<kExprI32LoadMem>,
       &WasmGenerator::memop<kExprI32LoadMem8S>,
@@ -1492,8 +2051,10 @@ void WasmGenerator::Generate<kI32>(DataRange* data) {
       &WasmGenerator::array_get<kI32>,
       &WasmGenerator::array_len,
 
-      &WasmGenerator::ref_is_null<kI32>,
+      &WasmGenerator::ref_is_null,
       &WasmGenerator::ref_eq,
+      &WasmGenerator::ref_test<kExprRefTest>,
+      &WasmGenerator::ref_test<kExprRefTestNull>,
 
       &WasmGenerator::table_size,
       &WasmGenerator::table_grow};
@@ -1505,7 +2066,7 @@ template <>
 void WasmGenerator::Generate<kI64>(DataRange* data) {
   GeneratorRecursionScope rec_scope(this);
   if (recursion_limit_reached() || data->size() <= 1) {
-    builder_->EmitI64Const(data->get<int64_t>());
+    builder_->EmitI64Const(data->getPseudoRandom<int64_t>());
     return;
   }
 
@@ -1555,6 +2116,8 @@ void WasmGenerator::Generate<kI64>(DataRange* data) {
       &WasmGenerator::if_<kI64, kIfElse>,
       &WasmGenerator::br_if<kI64>,
       &WasmGenerator::br_on_null<kI64>,
+      &WasmGenerator::br_on_non_null<kI64>,
+      &WasmGenerator::br_table<kI64>,
 
       &WasmGenerator::memop<kExprI64LoadMem>,
       &WasmGenerator::memop<kExprI64LoadMem8S>,
@@ -1624,7 +2187,7 @@ template <>
 void WasmGenerator::Generate<kF32>(DataRange* data) {
   GeneratorRecursionScope rec_scope(this);
   if (recursion_limit_reached() || data->size() <= sizeof(float)) {
-    builder_->EmitF32Const(data->get<float>());
+    builder_->EmitF32Const(data->getPseudoRandom<float>());
     return;
   }
 
@@ -1660,6 +2223,8 @@ void WasmGenerator::Generate<kF32>(DataRange* data) {
       &WasmGenerator::if_<kF32, kIfElse>,
       &WasmGenerator::br_if<kF32>,
       &WasmGenerator::br_on_null<kF32>,
+      &WasmGenerator::br_on_non_null<kF32>,
+      &WasmGenerator::br_table<kF32>,
 
       &WasmGenerator::memop<kExprF32LoadMem>,
 
@@ -1686,7 +2251,7 @@ template <>
 void WasmGenerator::Generate<kF64>(DataRange* data) {
   GeneratorRecursionScope rec_scope(this);
   if (recursion_limit_reached() || data->size() <= sizeof(double)) {
-    builder_->EmitF64Const(data->get<double>());
+    builder_->EmitF64Const(data->getPseudoRandom<double>());
     return;
   }
 
@@ -1722,6 +2287,8 @@ void WasmGenerator::Generate<kF64>(DataRange* data) {
       &WasmGenerator::if_<kF64, kIfElse>,
       &WasmGenerator::br_if<kF64>,
       &WasmGenerator::br_on_null<kF64>,
+      &WasmGenerator::br_on_non_null<kF64>,
+      &WasmGenerator::br_table<kF64>,
 
       &WasmGenerator::memop<kExprF64LoadMem>,
 
@@ -1751,7 +2318,7 @@ void WasmGenerator::Generate<kS128>(DataRange* data) {
   if (recursion_limit_reached() || data->size() <= sizeof(int32_t)) {
     // TODO(v8:8460): v128.const is not implemented yet, and we need a way to
     // "bottom-out", so use a splat to generate this.
-    builder_->EmitI32Const(data->get<int32_t>());
+    builder_->EmitI32Const(0);
     builder_->EmitWithPrefix(kExprI8x16Splat);
     return;
   }
@@ -2043,6 +2610,17 @@ void WasmGenerator::Generate(ValueType type, DataRange* data) {
   }
 }
 
+void WasmGenerator::GenerateRef(DataRange* data) {
+  constexpr HeapType::Representation top_types[] = {
+      HeapType::kAny,
+      HeapType::kFunc,
+      HeapType::kExtern,
+  };
+  HeapType::Representation type =
+      top_types[data->get<uint8_t>() % arraysize(top_types)];
+  GenerateRef(HeapType(type), data);
+}
+
 void WasmGenerator::GenerateRef(HeapType type, DataRange* data,
                                 Nullability nullability) {
   base::Optional<GeneratorRecursionScope> rec_scope;
@@ -2060,16 +2638,21 @@ void WasmGenerator::GenerateRef(HeapType type, DataRange* data,
   }
 
   constexpr GenerateFnWithHeap alternatives_indexed_type[] = {
-      &WasmGenerator::new_object, &WasmGenerator::get_local_ref,
-      &WasmGenerator::array_get_ref, &WasmGenerator::struct_get_ref};
+      &WasmGenerator::new_object,    &WasmGenerator::get_local_ref,
+      &WasmGenerator::array_get_ref, &WasmGenerator::struct_get_ref,
+      &WasmGenerator::ref_cast,      &WasmGenerator::ref_as_non_null,
+      &WasmGenerator::br_on_cast};
 
   constexpr GenerateFnWithHeap alternatives_func_any[] = {
-      &WasmGenerator::table_get, &WasmGenerator::get_local_ref,
-      &WasmGenerator::array_get_ref, &WasmGenerator::struct_get_ref};
+      &WasmGenerator::table_get,       &WasmGenerator::get_local_ref,
+      &WasmGenerator::array_get_ref,   &WasmGenerator::struct_get_ref,
+      &WasmGenerator::ref_cast,        &WasmGenerator::extern_internalize,
+      &WasmGenerator::ref_as_non_null, &WasmGenerator::br_on_cast};
 
   constexpr GenerateFnWithHeap alternatives_other[] = {
-      &WasmGenerator::array_get_ref, &WasmGenerator::get_local_ref,
-      &WasmGenerator::struct_get_ref};
+      &WasmGenerator::array_get_ref,   &WasmGenerator::get_local_ref,
+      &WasmGenerator::struct_get_ref,  &WasmGenerator::ref_cast,
+      &WasmGenerator::ref_as_non_null, &WasmGenerator::br_on_cast};
 
   switch (type.representation()) {
     // For abstract types, sometimes generate one of their subtypes.
@@ -2113,7 +2696,8 @@ void WasmGenerator::GenerateRef(HeapType type, DataRange* data,
         if (GenerateOneOf(alternatives_other, type, data, nullability)) return;
         random = data->get<uint8_t>() % num_arrays_;
       }
-      GenerateRef(HeapType(random), data, nullability);
+      DCHECK(builder_->builder()->IsArrayType(random + num_structs_));
+      GenerateRef(HeapType(random + num_structs_), data, nullability);
       return;
     }
     case HeapType::kStruct: {
@@ -2128,6 +2712,7 @@ void WasmGenerator::GenerateRef(HeapType type, DataRange* data,
         }
         random = data->get<uint8_t>() % num_structs_;
       }
+      DCHECK(builder_->builder()->IsStructType(random));
       GenerateRef(HeapType(random), data, nullability);
       return;
     }
@@ -2153,14 +2738,14 @@ void WasmGenerator::GenerateRef(HeapType type, DataRange* data,
       return;
     }
     case HeapType::kFunc: {
-      uint32_t random = data->get<uint32_t>() % (functions_.size() + 1);
+      uint32_t random = data->get<uint8_t>() % (functions_.size() + 1);
       /// Try generating one of the alternatives
       // and continue to the rest of the methods in case it fails.
       if (random >= functions_.size()) {
         if (GenerateOneOf(alternatives_func_any, type, data, nullability)) {
           return;
         }
-        random = data->get<uint32_t>() % functions_.size();
+        random = data->get<uint8_t>() % functions_.size();
       }
       uint32_t signature_index = functions_[random];
       DCHECK(builder_->builder()->IsSignature(signature_index));
@@ -2179,11 +2764,22 @@ void WasmGenerator::GenerateRef(HeapType type, DataRange* data,
       return;
     }
     case HeapType::kExtern:
+      if (data->get<bool>()) {
+        GenerateRef(HeapType(HeapType::kAny), data);
+        builder_->EmitWithPrefix(kExprExternExternalize);
+        if (nullability == kNonNullable) {
+          builder_->Emit(kExprRefAsNonNull);
+        }
+        return;
+      }
+      V8_FALLTHROUGH;
     case HeapType::kNoExtern:
     case HeapType::kNoFunc:
     case HeapType::kNone:
-      DCHECK(nullability == Nullability::kNullable);
       ref_null(type, data);
+      if (nullability == kNonNullable) {
+        builder_->Emit(kExprRefAsNonNull);
+      }
       return;
     default:
       // Indexed type.
@@ -2319,36 +2915,79 @@ FunctionSig* GenerateSig(Zone* zone, DataRange* data, SigKind sig_kind,
 
 WasmInitExpr GenerateInitExpr(Zone* zone, DataRange& range,
                               WasmModuleBuilder* builder, ValueType type,
-                              uint32_t num_struct_and_array_types);
+                              int num_structs, int num_arrays,
+                              uint32_t recursion_depth);
 
 WasmInitExpr GenerateStructNewInitExpr(Zone* zone, DataRange& range,
                                        WasmModuleBuilder* builder,
-                                       uint32_t index,
-                                       uint32_t num_struct_and_array_types) {
+                                       uint32_t index, int num_structs,
+                                       int num_arrays,
+                                       uint32_t recursion_depth) {
   const StructType* struct_type = builder->GetStructType(index);
-  ZoneVector<WasmInitExpr>* elements =
-      zone->New<ZoneVector<WasmInitExpr>>(zone);
-  int field_count = struct_type->field_count();
-  for (int field_index = 0; field_index < field_count; field_index++) {
-    elements->push_back(GenerateInitExpr(zone, range, builder,
-                                         struct_type->field(field_index),
-                                         num_struct_and_array_types));
-  }
-  return WasmInitExpr::StructNew(index, elements);
+  bool use_new_default =
+      std::all_of(struct_type->fields().begin(), struct_type->fields().end(),
+                  [](ValueType type) { return type.is_defaultable(); }) &&
+      range.get<bool>();
+
+  if (use_new_default) {
+    return WasmInitExpr::StructNewDefault(index);
+  } else {
+    ZoneVector<WasmInitExpr>* elements =
+        zone->New<ZoneVector<WasmInitExpr>>(zone);
+    int field_count = struct_type->field_count();
+    for (int field_index = 0; field_index < field_count; field_index++) {
+      elements->push_back(GenerateInitExpr(
+          zone, range, builder, struct_type->field(field_index), num_structs,
+          num_arrays, recursion_depth + 1));
+    }
+    return WasmInitExpr::StructNew(index, elements);
+  }
 }
 
-// TODO(manoskouk): Generate a variety of expressions for all cases.
+WasmInitExpr GenerateArrayInitExpr(Zone* zone, DataRange& range,
+                                   WasmModuleBuilder* builder, uint32_t index,
+                                   int num_structs, int num_arrays,
+                                   uint32_t recursion_depth) {
+  constexpr int kMaxArrayLength = 20;
+  uint8_t choice = range.get<uint8_t>() % 3;
+  ValueType element_type = builder->GetArrayType(index)->element_type();
+  if (choice == 0) {
+    int element_count = range.get<uint8_t>() % kMaxArrayLength;
+    ZoneVector<WasmInitExpr>* elements =
+        zone->New<ZoneVector<WasmInitExpr>>(zone);
+    for (int i = 0; i < element_count; i++) {
+      elements->push_back(GenerateInitExpr(zone, range, builder, element_type,
+                                           num_structs, num_arrays,
+                                           recursion_depth + 1));
+    }
+    return WasmInitExpr::ArrayNewFixed(index, elements);
+  } else if (choice == 1 || !element_type.is_defaultable()) {
+    // TODO(14034): Add other int expressions to length (same below).
+    WasmInitExpr length = WasmInitExpr(range.get<uint8_t>() % kMaxArrayLength);
+    WasmInitExpr init =
+        GenerateInitExpr(zone, range, builder, element_type, num_structs,
+                         num_arrays, recursion_depth + 1);
+    return WasmInitExpr::ArrayNew(zone, index, init, length);
+  } else {
+    WasmInitExpr length = WasmInitExpr(range.get<uint8_t>() % kMaxArrayLength);
+    return WasmInitExpr::ArrayNewDefault(zone, index, length);
+  }
+}
+
+// TODO(manoskouk): Add global.get.
 WasmInitExpr GenerateInitExpr(Zone* zone, DataRange& range,
                               WasmModuleBuilder* builder, ValueType type,
-                              uint32_t num_struct_and_array_types) {
+                              int num_structs, int num_arrays,
+                              uint32_t recursion_depth) {
   switch (type.kind()) {
-    case kRefNull:
-      return WasmInitExpr::RefNullConst(type.heap_type().representation());
     case kI8:
     case kI16:
     case kI32: {
+      if (range.size() == 0 || recursion_depth >= kMaxRecursionDepth) {
+        return WasmInitExpr(int32_t{0});
+      }
       // 50% to generate a constant, 50% to generate a binary operator.
-      byte choice = range.get<byte>() % 6;
+      uint8_t choice = range.get<uint8_t>() % 6;
       switch (choice) {
         case 0:
         case 1:
@@ -2360,15 +2999,18 @@ WasmInitExpr GenerateInitExpr(Zone* zone, DataRange& range,
                                                     : WasmInitExpr::kI32Mul;
           return WasmInitExpr::Binop(
               zone, op,
-              GenerateInitExpr(zone, range, builder, kWasmI32,
-                               num_struct_and_array_types),
-              GenerateInitExpr(zone, range, builder, kWasmI32,
-                               num_struct_and_array_types));
+              GenerateInitExpr(zone, range, builder, kWasmI32, num_structs,
+                               num_arrays, recursion_depth + 1),
+              GenerateInitExpr(zone, range, builder, kWasmI32, num_structs,
+                               num_arrays, recursion_depth + 1));
       }
     }
     case kI64: {
+      if (range.size() == 0 || recursion_depth >= kMaxRecursionDepth) {
+        return WasmInitExpr(int64_t{0});
+      }
       // 50% to generate a constant, 50% to generate a binary operator.
-      byte choice = range.get<byte>() % 6;
+      uint8_t choice = range.get<uint8_t>() % 6;
       switch (choice) {
         case 0:
         case 1:
@@ -2380,10 +3022,10 @@ WasmInitExpr GenerateInitExpr(Zone* zone, DataRange& range,
                                                     : WasmInitExpr::kI64Mul;
           return WasmInitExpr::Binop(
               zone, op,
-              GenerateInitExpr(zone, range, builder, kWasmI64,
-                               num_struct_and_array_types),
-              GenerateInitExpr(zone, range, builder, kWasmI64,
-                               num_struct_and_array_types));
+              GenerateInitExpr(zone, range, builder, kWasmI64, num_structs,
+                               num_arrays, recursion_depth + 1),
+              GenerateInitExpr(zone, range, builder, kWasmI64, num_structs,
+                               num_arrays, recursion_depth + 1));
       }
     }
     case kF32:
@@ -2394,40 +3036,97 @@ WasmInitExpr GenerateInitExpr(Zone* zone, DataRange& range,
       uint8_t s128_const[kSimd128Size] = {0};
       return WasmInitExpr(s128_const);
     }
+    case kRefNull: {
+      bool null_only = false;
+      switch (type.heap_representation()) {
+        case HeapType::kNone:
+        case HeapType::kNoFunc:
+        case HeapType::kNoExtern:
+          null_only = true;
+          break;
+        default:
+          break;
+      }
+      if (range.size() == 0 || recursion_depth >= kMaxRecursionDepth ||
+          null_only || (range.get<uint8_t>() % 4 == 0)) {
+        return WasmInitExpr::RefNullConst(type.heap_type().representation());
+      }
+      V8_FALLTHROUGH;
+    }
     case kRef: {
-      switch (type.heap_type().representation()) {
-        case HeapType::kStruct:
-        case HeapType::kAny:
+      switch (type.heap_representation()) {
+        case HeapType::kStruct: {
+          uint8_t index = range.get<uint8_t>() % num_structs;
+          return GenerateStructNewInitExpr(zone, range, builder, index,
+                                           num_structs, num_arrays,
+                                           recursion_depth);
+        }
+        case HeapType::kAny: {
+          // Do not use 0 as the determining value here, otherwise an exhausted
+          // {range} will generate an infinite recursion with the {kExtern}
+          // case.
+          if (recursion_depth < kMaxRecursionDepth && range.size() > 0 &&
+              range.get<uint8_t>() % 4 == 3) {
+            return WasmInitExpr::ExternInternalize(
+                zone,
+                GenerateInitExpr(zone, range, builder,
+                                 ValueType::RefMaybeNull(HeapType::kExtern,
+                                                         type.nullability()),
+                                 num_structs, num_arrays, recursion_depth + 1));
+          }
+          V8_FALLTHROUGH;
+        }
         case HeapType::kEq: {
-          // We materialize all these types with a struct because they are all
-          // its supertypes.
-          DCHECK(builder->IsStructType(0));
-          return GenerateStructNewInitExpr(zone, range, builder, 0,
-                                           num_struct_and_array_types);
+          uint8_t choice = range.get<uint8_t>() % 3;
+          HeapType::Representation subtype = choice == 0   ? HeapType::kStruct
+                                             : choice == 1 ? HeapType::kArray
+                                                           : HeapType::kI31;
+
+          return GenerateInitExpr(
+              zone, range, builder,
+              ValueType::RefMaybeNull(subtype, type.nullability()), num_structs,
+              num_arrays, recursion_depth);
         }
-        case HeapType::kFunc:
-          // We just pick the function at index 0.
-          DCHECK_GT(builder->NumFunctions(), 0);
-          return WasmInitExpr::RefFuncConst(0);
+        case HeapType::kFunc: {
+          uint32_t index = range.get<uint32_t>() % builder->NumFunctions();
+          return WasmInitExpr::RefFuncConst(index);
+        }
+        case HeapType::kExtern:
+          return WasmInitExpr::ExternExternalize(
+              zone,
+              GenerateInitExpr(
+                  zone, range, builder,
+                  ValueType::RefMaybeNull(HeapType::kAny, type.nullability()),
+                  num_structs, num_arrays, recursion_depth + 1));
+        case HeapType::kI31:
+          return WasmInitExpr::I31New(
+              zone,
+              GenerateInitExpr(zone, range, builder, kWasmI32, num_structs,
+                               num_arrays, recursion_depth + 1));
+        case HeapType::kArray: {
+          uint32_t index = range.get<uint32_t>() % num_arrays + num_structs;
+          return GenerateArrayInitExpr(zone, range, builder, index, num_structs,
+                                       num_arrays, recursion_depth);
+        }
+        case HeapType::kNone:
+        case HeapType::kNoFunc:
+        case HeapType::kNoExtern:
+          UNREACHABLE();
         default: {
           uint32_t index = type.ref_index();
           if (builder->IsStructType(index)) {
             return GenerateStructNewInitExpr(zone, range, builder, index,
-                                             num_struct_and_array_types);
-          }
-          if (builder->IsArrayType(index)) {
-            ZoneVector<WasmInitExpr>* elements =
-                zone->New<ZoneVector<WasmInitExpr>>(zone);
-            elements->push_back(
-                GenerateInitExpr(zone, range, builder,
-                                 builder->GetArrayType(index)->element_type(),
-                                 num_struct_and_array_types));
-            return WasmInitExpr::ArrayNewFixed(index, elements);
-          }
-          if (builder->IsSignature(index)) {
+                                             num_structs, num_arrays,
+                                             recursion_depth);
+          } else if (builder->IsArrayType(index)) {
+            return GenerateArrayInitExpr(zone, range, builder, index,
+                                         num_structs, num_arrays,
+                                         recursion_depth);
+          } else {
+            DCHECK(builder->IsSignature(index));
             // Transform from signature index to function index.
             return WasmInitExpr::RefFuncConst(index -
-                                              num_struct_and_array_types);
+                                              (num_structs + num_arrays));
           }
           UNREACHABLE();
         }
@@ -2449,7 +3148,13 @@ class WasmCompileFuzzer : public WasmExecutionFuzzer {
 
     WasmModuleBuilder builder(zone);
 
-    DataRange range(data);
+    // Split input data in two parts:
+    // - One for the "module" (types, globals, ..)
+    // - One for all the function bodies
+    // This prevents using a too large portion on the module resulting in
+    // uninteresting function bodies.
+    DataRange module_range(data);
+    DataRange functions_range = module_range.split();
     std::vector<uint32_t> function_signatures;
 
     // Add struct and array types first so that we get a chance to generate
@@ -2458,67 +3163,135 @@ class WasmCompileFuzzer : public WasmExecutionFuzzer {
     // definitions.
 
     static_assert(kMaxFunctions >= 1, "need min. 1 function");
-    uint8_t num_functions = 1 + (range.get<uint8_t>() % kMaxFunctions);
+    uint8_t num_functions = 1 + (module_range.get<uint8_t>() % kMaxFunctions);
 
-    // We need at least one struct/array in order to support WasmInitExpr
-    // for kData, kAny and kEq.
-    uint8_t num_structs = 1 + range.get<uint8_t>() % kMaxStructs;
-    uint8_t num_arrays = range.get<uint8_t>() % (kMaxArrays + 1);
+    // We need at least one struct and one array in order to support
+    // WasmInitExpr for abstract types.
+    uint8_t num_structs = 1 + module_range.get<uint8_t>() % kMaxStructs;
+    uint8_t num_arrays = 1 + module_range.get<uint8_t>() % kMaxArrays;
     uint16_t num_types = num_functions + num_structs + num_arrays;
 
-    for (int struct_index = 0; struct_index < num_structs; struct_index++) {
-      uint8_t num_fields = range.get<uint8_t>() % (kMaxStructFields + 1);
+    // (Type_index -> end of explicit rec group).
+    std::map<uint8_t, uint8_t> explicit_rec_groups;
+    {
+      uint8_t current_type_index = 0;
+      while (current_type_index < num_types) {
+        // First, pick a random start for the next group. We allow it to be
+        // beyond the end of types (i.e., we add no further recursive groups).
+        uint8_t group_start =
+            module_range.get<uint8_t>() % (num_types - current_type_index + 1) +
+            current_type_index;
+        DCHECK_GE(group_start, current_type_index);
+        current_type_index = group_start;
+        if (group_start < num_types) {
+          // If we did not reach the end of the types, pick a random group size.
+          uint8_t group_size =
+              module_range.get<uint8_t>() % (num_types - group_start) + 1;
+          DCHECK_LE(group_start + group_size, num_types);
+          for (uint8_t i = group_start; i < group_start + group_size; i++) {
+            explicit_rec_groups.emplace(i, group_start + group_size - 1);
+          }
+          builder.AddRecursiveTypeGroup(group_start, group_size);
+          current_type_index += group_size;
+        }
+      }
+    }
+
+    uint8_t current_type_index = 0;
+    for (; current_type_index < num_structs; current_type_index++) {
+      auto rec_group = explicit_rec_groups.find(current_type_index);
+      uint8_t current_rec_group_end = rec_group != explicit_rec_groups.end()
+                                          ? rec_group->second
+                                          : current_type_index;
+
+      uint32_t supertype = kNoSuperType;
+      uint8_t num_fields = module_range.get<uint8_t>() % (kMaxStructFields + 1);
+
+      if (current_type_index > 0 && module_range.get<bool>()) {
+        supertype = module_range.get<uint8_t>() % current_type_index;
+        num_fields += builder.GetStructType(supertype)->field_count();
+      }
       StructType::Builder struct_builder(zone, num_fields);
-      for (int field_index = 0; field_index < num_fields; field_index++) {
+
+      // Add all fields from super type.
+      uint32_t field_index = 0;
+      if (supertype != kNoSuperType) {
+        const StructType* parent = builder.GetStructType(supertype);
+        for (; field_index < parent->field_count(); ++field_index) {
+          // TODO(14034): This could also be any sub type of the supertype's
+          // element type.
+          struct_builder.AddField(parent->field(field_index),
+                                  parent->mutability(field_index));
+        }
+      }
+      for (; field_index < num_fields; field_index++) {
         // Notes:
         // - We allow a type to only have non-nullable fields of types that
         //   are defined earlier. This way we avoid infinite non-nullable
         //   constructions. Also relevant for arrays and functions.
-        // - Currently, we also allow nullable fields to only reference types
-        //   that are defined earlier. The reason is that every type can only
-        //   reference types in its own or earlier recursive groups, and we do
-        //   not support recursive groups yet. Also relevant for arrays and
-        //   functions. TODO(7748): Change the number of nullable types once
-        //   we support rec. groups.
-        // - We exclude the generics types anyref, dataref, and eqref from the
-        //   fields of struct 0. This is because in GenerateInitExpr we
-        //   materialize these types with (ref 0), and having such fields in
-        //   struct 0 would produce an infinite recursion.
+        // - On the other hand, nullable fields can be picked up to the end of
+        //   the current recursive group.
+        // - We exclude the non-nullable generic types arrayref, anyref,
+        //   structref, eqref and externref from the fields of structs and
+        //   arrays. This is so that GenerateInitExpr has a way to break a
+        //   recursion between a struct/array field and those types
+        //   ((ref extern) gets materialized through (ref any)).
         ValueType type = GetValueTypeHelper(
-            &range, builder.NumTypes(), builder.NumTypes(), kAllowNonNullables,
-            kIncludePackedTypes,
-            struct_index != 0 ? kIncludeGenerics : kExcludeGenerics);
+            &module_range, current_rec_group_end + 1, current_type_index,
+            kIncludeNumericTypes, kIncludePackedTypes,
+            kExcludeSomeGenericsWhenTypeIsNonNullable);
 
-        bool mutability = range.get<bool>();
+        bool mutability = module_range.get<bool>();
         struct_builder.AddField(type, mutability);
       }
       StructType* struct_fuz = struct_builder.Build();
-      builder.AddStructType(struct_fuz, false);
-    }
-
-      for (int array_index = 0; array_index < num_arrays; array_index++) {
-        ValueType type = GetValueTypeHelper(
-            &range, builder.NumTypes(), builder.NumTypes(), kAllowNonNullables,
-            kIncludePackedTypes, kIncludeGenerics);
-        ArrayType* array_fuz = zone->New<ArrayType>(type, true);
-        builder.AddArrayType(array_fuz, false);
+      builder.AddStructType(struct_fuz, false, supertype);
+    }
+
+    for (; current_type_index < num_structs + num_arrays;
+         current_type_index++) {
+      auto rec_group = explicit_rec_groups.find(current_type_index);
+      uint8_t current_rec_group_end = rec_group != explicit_rec_groups.end()
+                                          ? rec_group->second
+                                          : current_type_index;
+      ValueType type = GetValueTypeHelper(
+          &module_range, current_rec_group_end + 1, current_type_index,
+          kIncludeNumericTypes, kIncludePackedTypes,
+          kExcludeSomeGenericsWhenTypeIsNonNullable);
+      uint32_t supertype = kNoSuperType;
+      if (current_type_index > num_structs && module_range.get<bool>()) {
+        supertype =
+            module_range.get<uint8_t>() % (current_type_index - num_structs) +
+            num_structs;
+        // TODO(14034): This could also be any sub type of the supertype's
+        // element type.
+        type = builder.GetArrayType(supertype)->element_type();
       }
+      ArrayType* array_fuz = zone->New<ArrayType>(type, true);
+      builder.AddArrayType(array_fuz, false, supertype);
+    }
 
     // We keep the signature for the first (main) function constant.
-      function_signatures.push_back(
-          builder.ForceAddSignature(sigs.i_iii(), v8_flags.wasm_final_types));
-
-      for (uint8_t i = 1; i < num_functions; i++) {
-        FunctionSig* sig =
-            GenerateSig(zone, &range, kFunctionSig, builder.NumTypes());
-        uint32_t signature_index =
-            builder.ForceAddSignature(sig, v8_flags.wasm_final_types);
-        function_signatures.push_back(signature_index);
-      }
-
-    int num_exceptions = 1 + (range.get<uint8_t>() % kMaxExceptions);
+    function_signatures.push_back(
+        builder.ForceAddSignature(sigs.i_iii(), v8_flags.wasm_final_types));
+    current_type_index++;
+
+    for (; current_type_index < num_types; current_type_index++) {
+      auto rec_group = explicit_rec_groups.find(current_type_index);
+      uint8_t current_rec_group_end = rec_group != explicit_rec_groups.end()
+                                          ? rec_group->second
+                                          : current_type_index;
+      FunctionSig* sig = GenerateSig(zone, &module_range, kFunctionSig,
+                                     current_rec_group_end + 1);
+      uint32_t signature_index =
+          builder.ForceAddSignature(sig, v8_flags.wasm_final_types);
+      function_signatures.push_back(signature_index);
+    }
+
+    int num_exceptions = 1 + (module_range.get<uint8_t>() % kMaxExceptions);
     for (int i = 0; i < num_exceptions; ++i) {
-      FunctionSig* sig = GenerateSig(zone, &range, kExceptionSig, num_types);
+      FunctionSig* sig =
+          GenerateSig(zone, &module_range, kExceptionSig, num_types);
       builder.AddException(sig);
     }
 
@@ -2530,28 +3303,25 @@ class WasmCompileFuzzer : public WasmExecutionFuzzer {
       // performed by adding a function by {FunctionSig}, because we emit
       // everything in one recursive group which blocks signature
       // canonicalization.
-      // TODO(7748): Relax this when we implement proper recursive-group
+      // TODO(14034): Relax this when we implement proper recursive-group
       // support.
       functions.push_back(builder.AddFunction(function_signatures[i]));
     }
 
-    int num_globals = range.get<uint8_t>() % (kMaxGlobals + 1);
+    int num_globals = module_range.get<uint8_t>() % (kMaxGlobals + 1);
     std::vector<ValueType> globals;
     std::vector<uint8_t> mutable_globals;
     globals.reserve(num_globals);
     mutable_globals.reserve(num_globals);
 
     for (int i = 0; i < num_globals; ++i) {
-      ValueType type =
-          GetValueTypeHelper(&range, num_types, num_types, kAllowNonNullables,
-                             kExcludePackedTypes, kIncludeGenerics);
+      ValueType type = GetValueType(&module_range, num_types);
       // 1/8 of globals are immutable.
-      const bool mutability = (range.get<uint8_t>() % 8) != 0;
+      const bool mutability = (module_range.get<uint8_t>() % 8) != 0;
 
-      builder.AddGlobal(
-          type, mutability,
-          GenerateInitExpr(zone, range, &builder, type,
-                           static_cast<uint32_t>(num_structs + num_arrays)));
+      builder.AddGlobal(type, mutability,
+                        GenerateInitExpr(zone, module_range, &builder, type,
+                                         num_structs, num_arrays, 0));
       globals.push_back(type);
       if (mutability) mutable_globals.push_back(static_cast<uint8_t>(i));
     }
@@ -2559,30 +3329,38 @@ class WasmCompileFuzzer : public WasmExecutionFuzzer {
     // Generate tables before function bodies, so they are available for table
     // operations.
     // Always generate at least one table for call_indirect.
-    int num_tables = range.get<uint8_t>() % kMaxTables + 1;
+    int num_tables = module_range.get<uint8_t>() % kMaxTables + 1;
     for (int i = 0; i < num_tables; i++) {
-      // Table 0 has to reference all functions in the program. This is so that
-      // all functions count as declared so they can be referenced with
-      // ref.func.
-      // TODO(11954): Consider removing this restriction.
       uint32_t min_size =
-          i == 0 ? num_functions : range.get<uint8_t>() % kMaxTableSize;
+          i == 0 ? num_functions : module_range.get<uint8_t>() % kMaxTableSize;
       uint32_t max_size =
-          range.get<uint8_t>() % (kMaxTableSize - min_size) + min_size;
-      // Table 0 is always funcref.
-      // TODO(11954): Remove this requirement once we support call_indirect with
-      // other table indices.
-      // TODO(11954): Support typed function tables.
-      bool use_funcref = i == 0 || range.get<bool>();
-      ValueType type = use_funcref ? kWasmFuncRef : kWasmExternRef;
-      uint32_t table_index = builder.AddTable(type, min_size, max_size);
-      if (type == kWasmFuncRef) {
+          module_range.get<uint8_t>() % (kMaxTableSize - min_size) + min_size;
+      // Table 0 is always funcref. This guarantees that
+      // - call_indirect has at least one funcref table to work with,
+      // - we have a place to reference all functions in the program, so they
+      //   count as "declared" for ref.func.
+      bool force_funcref = i == 0;
+      ValueType type =
+          force_funcref
+              ? kWasmFuncRef
+              : GetValueTypeHelper(&module_range, num_types, num_types,
+                                   kExcludeNumericTypes, kExcludePackedTypes,
+                                   kAlwaysIncludeAllGenerics);
+      bool use_initializer = !type.is_defaultable() || module_range.get<bool>();
+      uint32_t table_index =
+          use_initializer
+              ? builder.AddTable(
+                    type, min_size, max_size,
+                    GenerateInitExpr(zone, module_range, &builder, type,
+                                     num_structs, num_arrays, 0))
+              : builder.AddTable(type, min_size, max_size);
+      if (type.is_reference_to(HeapType::kFunc)) {
         // For function tables, initialize them with functions from the program.
-        // Currently, the fuzzer assumes that every function table contains the
-        // functions in the program in the order they are defined.
+        // Currently, the fuzzer assumes that every funcref/(ref func) table
+        // contains the functions in the program in the order they are defined.
         // TODO(11954): Consider generalizing this.
-        WasmModuleBuilder::WasmElemSegment segment(
-            zone, kWasmFuncRef, table_index, WasmInitExpr(0));
+        WasmModuleBuilder::WasmElemSegment segment(zone, type, table_index,
+                                                   WasmInitExpr(0));
         for (int entry_index = 0; entry_index < static_cast<int>(min_size);
              entry_index++) {
           segment.entries.emplace_back(
@@ -2593,14 +3371,25 @@ class WasmCompileFuzzer : public WasmExecutionFuzzer {
       }
     }
 
+    int num_data_segments =
+        module_range.get<uint8_t>() % kMaxPassiveDataSegments;
+    for (int i = 0; i < num_data_segments; i++) {
+      GeneratePassiveDataSegment(&module_range, &builder);
+    }
+
     for (int i = 0; i < num_functions; ++i) {
       WasmFunctionBuilder* f = functions[i];
-      DataRange function_range = range.split();
+      // On the last function don't split the DataRange but just use the
+      // existing DataRange.
+      DataRange function_range = i != num_functions - 1
+                                     ? functions_range.split()
+                                     : std::move(functions_range);
       WasmGenerator gen(f, function_signatures, globals, mutable_globals,
                         num_structs, num_arrays, &function_range);
       const FunctionSig* sig = f->signature();
       base::Vector<const ValueType> return_types(sig->returns().begin(),
                                                  sig->return_count());
+      gen.InitializeNonDefaultableLocals(&function_range);
       gen.Generate(return_types, &function_range);
       if (!CheckHardwareSupportsSimd() && gen.HasSimd()) return false;
       f->Emit(kExprEnd);
diff --git a/deps/v8/test/fuzzer/wasm-fuzzer-common.cc b/deps/v8/test/fuzzer/wasm-fuzzer-common.cc
index a85a74a2ff6542..ff00334f87ac21 100644
--- a/deps/v8/test/fuzzer/wasm-fuzzer-common.cc
+++ b/deps/v8/test/fuzzer/wasm-fuzzer-common.cc
@@ -76,8 +76,7 @@ Handle<WasmModuleObject> CompileReferenceModule(
           "Liftoff compilation failed on a valid module. Run with "
           "--trace-wasm-decoder (in a debug build) to see why.");
     }
-    native_module->PublishCode(
-        native_module->AddCompiledCode(std::move(result)));
+    native_module->PublishCode(native_module->AddCompiledCode(result));
   }
 
   // Create the module object.
@@ -138,6 +137,16 @@ void ExecuteAgainstReference(Isolate* isolate,
   // module, and in particular it may not terminate.
   if (nondeterminism != 0) return;
 
+  if (exception_ref) {
+    if (strcmp(exception_ref.get(),
+               "RangeError: Maximum call stack size exceeded") == 0) {
+      // There was a stack overflow, which may happen nondeterministically. We
+      // cannot guarantee the behavior of the test module, and in particular it
+      // may not terminate.
+      return;
+    }
+  }
+
   // Instantiate a fresh instance for the actual (non-ref) execution.
   Handle<WasmInstanceObject> instance;
   {
@@ -322,6 +331,7 @@ class InitExprInterface {
  public:
   using ValidationTag = Decoder::FullValidationTag;
   static constexpr DecodingMode decoding_mode = kConstantExpression;
+  static constexpr bool kUsesPoppedArgs = false;
 
   struct Value : public ValueBase<ValidationTag> {
     template <typename... Args>
@@ -396,8 +406,16 @@ class InitExprInterface {
 
   void UnOp(FullDecoder* decoder, WasmOpcode opcode, const Value& value,
             Value* result) {
-    // TODO(12089): Implement.
-    UNIMPLEMENTED();
+    switch (opcode) {
+      case kExprExternInternalize:
+        os_ << "kGCPrefix, kExprExternInternalize, ";
+        break;
+      case kExprExternExternalize:
+        os_ << "kGCPrefix, kExprExternExternalize, ";
+        break;
+      default:
+        UNREACHABLE();
+    }
   }
 
   void RefNull(FullDecoder* decoder, ValueType type, Value* result) {
@@ -416,39 +434,39 @@ class InitExprInterface {
 
   // The following operations assume non-rtt versions of the instructions.
   void StructNew(FullDecoder* decoder, const StructIndexImmediate& imm,
-                 const Value& rtt, const Value args[], Value* result) {
+                 const Value args[], Value* result) {
     os_ << "kGCPrefix, kExprStructNew, " << index(imm.index);
   }
 
   void StructNewDefault(FullDecoder* decoder, const StructIndexImmediate& imm,
-                        const Value& rtt, Value* result) {
+                        Value* result) {
     os_ << "kGCPrefix, kExprStructNewDefault, " << index(imm.index);
   }
 
   void ArrayNew(FullDecoder* decoder, const ArrayIndexImmediate& imm,
                 const Value& length, const Value& initial_value,
-                const Value& rtt, Value* result) {
+                Value* result) {
     os_ << "kGCPrefix, kExprArrayNew, " << index(imm.index);
   }
 
   void ArrayNewDefault(FullDecoder* decoder, const ArrayIndexImmediate& imm,
-                       const Value& length, const Value& rtt, Value* result) {
+                       const Value& length, Value* result) {
     os_ << "kGCPrefix, kExprArrayNewDefault, " << index(imm.index);
   }
 
-  void ArrayNewFixed(FullDecoder* decoder, const ArrayIndexImmediate& imm,
-                     const base::Vector<Value>& elements, const Value& rtt,
+  void ArrayNewFixed(FullDecoder* decoder, const ArrayIndexImmediate& array_imm,
+                     const IndexImmediate& length_imm, const Value elements[],
                      Value* result) {
-    os_ << "kGCPrefix, kExprArrayNewFixed, " << index(imm.index)
-        << index(static_cast<uint32_t>(elements.size()));
+    os_ << "kGCPrefix, kExprArrayNewFixed, " << index(array_imm.index)
+        << index(length_imm.index);
   }
 
   void ArrayNewSegment(FullDecoder* decoder,
                        const ArrayIndexImmediate& array_imm,
                        const IndexImmediate& data_segment_imm,
                        const Value& offset_value, const Value& length_value,
-                       const Value& rtt, Value* result) {
-    // TODO(7748): Implement.
+                       Value* result) {
+    // TODO(14034): Implement when/if array.new_data/element becomes const.
     UNIMPLEMENTED();
   }
 
@@ -507,9 +525,9 @@ void GenerateTestCase(Isolate* isolate, ModuleWireBytes wire_bytes,
                       bool compiles) {
   constexpr bool kVerifyFunctions = false;
   auto enabled_features = WasmFeatures::FromIsolate(isolate);
-  ModuleResult module_res =
-      DecodeWasmModule(enabled_features, wire_bytes.module_bytes(),
-                       kVerifyFunctions, ModuleOrigin::kWasmOrigin);
+  ModuleResult module_res = DecodeWasmModule(
+      enabled_features, wire_bytes.module_bytes(), kVerifyFunctions,
+      ModuleOrigin::kWasmOrigin, kPopulateExplicitRecGroups);
   CHECK_WITH_MSG(module_res.ok(), module_res.error().message().c_str());
   WasmModule* module = module_res.value().get();
   CHECK_NOT_NULL(module);
@@ -542,7 +560,13 @@ void GenerateTestCase(Isolate* isolate, ModuleWireBytes wire_bytes,
         "\n"
         "const builder = new WasmModuleBuilder();\n";
 
+  int recursive_group_end = -1;
   for (int i = 0; i < static_cast<int>(module->types.size()); i++) {
+    auto rec_group = module->explicit_recursive_type_groups.find(i);
+    if (rec_group != module->explicit_recursive_type_groups.end()) {
+      os << "builder.startRecGroup();\n";
+      recursive_group_end = rec_group->first + rec_group->second - 1;
+    }
     if (module->has_struct(i)) {
       const StructType* struct_type = module->types[i].struct_type;
       os << "builder.addStruct([";
@@ -553,18 +577,30 @@ void GenerateTestCase(Isolate* isolate, ModuleWireBytes wire_bytes,
            << ")";
         if (index + 1 < field_count) os << ", ";
       }
-      os << "]);\n";
+      os << "]";
+      if (module->types[i].supertype != kNoSuperType) {
+        os << ", " << module->types[i].supertype;
+      }
+      os << ");\n";
     } else if (module->has_array(i)) {
       const ArrayType* array_type = module->types[i].array_type;
       os << "builder.addArray("
          << ValueTypeToConstantName(array_type->element_type()) << ", "
-         << (array_type->mutability() ? "true" : "false") << ");\n";
+         << (array_type->mutability() ? "true" : "false");
+      if (module->types[i].supertype != kNoSuperType) {
+        os << ", " << module->types[i].supertype;
+      }
+      os << ");\n";
     } else {
       DCHECK(module->has_signature(i));
       const FunctionSig* sig = module->types[i].function_sig;
       os << "builder.addType(makeSig(" << PrintParameters(sig) << ", "
          << PrintReturns(sig) << "));\n";
     }
+
+    if (i == recursive_group_end) {
+      os << "builder.endRecGroup();\n";
+    }
   }
 
   for (WasmImport imported : module->import_table) {
@@ -577,15 +613,14 @@ void GenerateTestCase(Isolate* isolate, ModuleWireBytes wire_bytes,
        << sig_index << " /* sig */);\n";
   }
 
-  if (module->has_memory) {
-    os << "builder.addMemory(" << module->initial_pages;
-    if (module->has_maximum_pages) {
-      os << ", " << module->maximum_pages;
+  for (const WasmMemory& memory : module->memories) {
+    os << "builder.addMemory(" << memory.initial_pages;
+    if (memory.has_maximum_pages) {
+      os << ", " << memory.maximum_pages;
     } else {
       os << ", undefined";
     }
-    os << ", " << (module->mem_export ? "true" : "false");
-    if (module->has_shared_memory) {
+    if (memory.is_shared) {
       os << ", true";
     }
     os << ");\n";
@@ -619,13 +654,19 @@ void GenerateTestCase(Isolate* isolate, ModuleWireBytes wire_bytes,
 
   Zone tmp_zone(isolate->allocator(), ZONE_NAME);
 
-  // TODO(9495): Add support for tables with explicit initializers.
   for (const WasmTable& table : module->tables) {
     os << "builder.addTable(" << ValueTypeToConstantName(table.type) << ", "
        << table.initial_size << ", "
        << (table.has_maximum_size ? std::to_string(table.maximum_size)
                                   : "undefined")
-       << ", undefined)\n";
+       << ", ";
+    if (table.initial_value.is_set()) {
+      DecodeAndAppendInitExpr(os, &zone, module, wire_bytes,
+                              table.initial_value, table.type);
+    } else {
+      os << "undefined";
+    }
+    os << ")\n";
   }
   for (const WasmElemSegment& elem_segment : module->elem_segments) {
     const char* status_str =
@@ -708,9 +749,20 @@ void GenerateTestCase(Isolate* isolate, ModuleWireBytes wire_bytes,
   }
 
   for (WasmExport& exp : module->export_table) {
-    if (exp.kind != kExternalFunction) continue;
-    os << "builder.addExport(" << PrintName(wire_bytes, exp.name) << ", "
-       << exp.index << ");\n";
+    switch (exp.kind) {
+      case kExternalFunction:
+        os << "builder.addExport(" << PrintName(wire_bytes, exp.name) << ", "
+           << exp.index << ");\n";
+        break;
+      case kExternalMemory:
+        os << "builder.exportMemoryAs(" << PrintName(wire_bytes, exp.name)
+           << ", " << exp.index << ");\n";
+        break;
+      default:
+        os << "// Unsupported export of '" << PrintName(wire_bytes, exp.name)
+           << "'.\n";
+        break;
+    }
   }
 
   if (compiles) {
@@ -789,17 +841,18 @@ void WasmExecutionFuzzer::FuzzWasmModule(base::Vector<const uint8_t> data,
   // 0: TurboFan
   // 1: Liftoff
   // 2: Liftoff for debugging
+  // 3: Turboshaft
   uint8_t tier_mask = 0;
   uint8_t debug_mask = 0;
-  for (int i = 0; i < 4; ++i, configuration_byte /= 3) {
-    int compiler_config = configuration_byte % 3;
+  uint8_t turboshaft_mask = 0;
+  for (int i = 0; i < 4; ++i, configuration_byte /= 4) {
+    int compiler_config = configuration_byte % 4;
     tier_mask |= (compiler_config == 0) << i;
     debug_mask |= (compiler_config == 2) << i;
+    turboshaft_mask |= (compiler_config == 3) << i;
   }
-  // Note: After dividing by 3 for 4 times, configuration_byte is within [0, 3].
-
-  FlagScope<bool> turbo_mid_tier_regalloc(
-      &v8_flags.turbo_force_mid_tier_regalloc, configuration_byte == 0);
+  // Enable tierup for all turboshaft functions.
+  tier_mask |= turboshaft_mask;
 
   if (!GenerateModule(i_isolate, &zone, data, &buffer)) {
     return;
@@ -818,27 +871,26 @@ void WasmExecutionFuzzer::FuzzWasmModule(base::Vector<const uint8_t> data,
     GenerateTestCase(i_isolate, wire_bytes, valid);
   }
 
-  MaybeHandle<WasmModuleObject> compiled_module;
-  {
-    // Explicitly enable Liftoff, disable tiering and set the tier_mask. This
-    // way, we deterministically test a combination of Liftoff and Turbofan.
-    FlagScope<bool> liftoff(&v8_flags.liftoff, true);
-    FlagScope<bool> no_tier_up(&v8_flags.wasm_tier_up, false);
-    FlagScope<int> tier_mask_scope(&v8_flags.wasm_tier_mask_for_testing,
-                                   tier_mask);
-    FlagScope<int> debug_mask_scope(&v8_flags.wasm_debug_mask_for_testing,
-                                    debug_mask);
-    ErrorThrower thrower(i_isolate, "WasmFuzzerSyncCompile");
-    compiled_module = GetWasmEngine()->SyncCompile(i_isolate, enabled_features,
-                                                   &thrower, wire_bytes);
-    CHECK_EQ(valid, !compiled_module.is_null());
-    CHECK_EQ(!valid, thrower.error());
-    if (require_valid && !valid) {
-      FATAL("Generated module should validate, but got: %s",
-            thrower.error_msg());
-    }
-    thrower.Reset();
-  }
+  // Explicitly enable Liftoff, disable tiering and set the tier_mask. This
+  // way, we deterministically test a combination of Liftoff and Turbofan.
+  FlagScope<bool> liftoff(&v8_flags.liftoff, true);
+  FlagScope<bool> no_tier_up(&v8_flags.wasm_tier_up, false);
+  FlagScope<int> tier_mask_scope(&v8_flags.wasm_tier_mask_for_testing,
+                                 tier_mask);
+  FlagScope<int> debug_mask_scope(&v8_flags.wasm_debug_mask_for_testing,
+                                  debug_mask);
+  FlagScope<int> turboshaft_mask_scope(
+      &v8_flags.wasm_turboshaft_mask_for_testing, turboshaft_mask);
+
+  ErrorThrower thrower(i_isolate, "WasmFuzzerSyncCompile");
+  MaybeHandle<WasmModuleObject> compiled_module = GetWasmEngine()->SyncCompile(
+      i_isolate, enabled_features, &thrower, wire_bytes);
+  CHECK_EQ(valid, !compiled_module.is_null());
+  CHECK_EQ(!valid, thrower.error());
+  if (require_valid && !valid) {
+    FATAL("Generated module should validate, but got: %s", thrower.error_msg());
+  }
+  thrower.Reset();
 
   if (valid) {
     ExecuteAgainstReference(i_isolate, compiled_module.ToHandleChecked(),
diff --git a/deps/v8/test/fuzzer/wasm-streaming.cc b/deps/v8/test/fuzzer/wasm-streaming.cc
index 23a282a5534ea4..ed691c455367f0 100644
--- a/deps/v8/test/fuzzer/wasm-streaming.cc
+++ b/deps/v8/test/fuzzer/wasm-streaming.cc
@@ -133,9 +133,10 @@ CompilationResult CompileSync(Isolate* isolate, WasmFeatures enabled_features,
            ->SyncCompile(isolate, enabled_features, &thrower,
                          ModuleWireBytes{data})
            .ToHandle(&module_object)) {
-    auto result = CompilationResult::ForFailure(thrower.error_msg());
-    thrower.Reset();
-    return result;
+    Handle<Object> error = thrower.Reify();
+    Handle<String> error_msg =
+        Object::ToString(isolate, error).ToHandleChecked();
+    return CompilationResult::ForFailure(error_msg->ToCString().get());
   }
   return CompilationResult::ForSuccess(module_object->module());
 }
@@ -180,13 +181,11 @@ extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
         streaming_result.failed ? "" : " not", sync_result.failed ? "" : " not",
         error_msg);
   }
-  // TODO(12922): Enable this test later, after other bugs are flushed out.
-  // if (strcmp(streaming_result.error_message.begin(),
-  //            sync_result.error_message.begin()) != 0) {
-  //   FATAL("Error messages differ: %s / %s\n",
-  //         streaming_result.error_message.begin(),
-  //         sync_result.error_message.begin());
-  // }
+  if (streaming_result.error_message != sync_result.error_message) {
+    FATAL("Error messages differ:\nstreaming: %s\n     sync: %s",
+          streaming_result.error_message.c_str(),
+          sync_result.error_message.c_str());
+  }
   CHECK_EQ(streaming_result.imported_functions, sync_result.imported_functions);
   CHECK_EQ(streaming_result.declared_functions, sync_result.declared_functions);
 
diff --git a/deps/v8/test/fuzzer/wasm/regress-1464231.wasm b/deps/v8/test/fuzzer/wasm/regress-1464231.wasm
new file mode 100644
index 00000000000000..0373293e4e89ab
Binary files /dev/null and b/deps/v8/test/fuzzer/wasm/regress-1464231.wasm differ
diff --git a/deps/v8/test/fuzzer/wasm_streaming/regress-1427898 b/deps/v8/test/fuzzer/wasm_streaming/regress-1427898
new file mode 100644
index 00000000000000..bbc185ed6de307
Binary files /dev/null and b/deps/v8/test/fuzzer/wasm_streaming/regress-1427898 differ
diff --git a/deps/v8/test/fuzzer/wasm_streaming/regress-1429613 b/deps/v8/test/fuzzer/wasm_streaming/regress-1429613
new file mode 100644
index 00000000000000..a8450bd0fe0d01
Binary files /dev/null and b/deps/v8/test/fuzzer/wasm_streaming/regress-1429613 differ
diff --git a/deps/v8/test/fuzzilli/testcfg.py b/deps/v8/test/fuzzilli/testcfg.py
index 3845eb0caaa976..237165fec00802 100644
--- a/deps/v8/test/fuzzilli/testcfg.py
+++ b/deps/v8/test/fuzzilli/testcfg.py
@@ -2,8 +2,6 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-import os
-
 from testrunner.local import testsuite
 from testrunner.objects import testcase
 
@@ -22,7 +20,7 @@ def test_dirs(self):
     return SUB_TESTS
 
   def _to_relpath(self, abspath, _):
-    return os.path.relpath(abspath, self.suite.root)
+    return abspath.relative_to(self.suite.root)
 
 
 class TestSuite(testsuite.TestSuite):
@@ -38,8 +36,7 @@ def _variants_gen_class(self):
 
 class TestCase(testcase.TestCase):
   def _get_files_params(self):
-    suite, name = self.path.split(os.path.sep)
-    return [os.path.join(self.suite.root, suite, name)]
+    return [self.suite.root / self.path]
 
   def _get_variant_flags(self):
     return []
diff --git a/deps/v8/test/inspector/cpu-profiler/console-profile-wasm-expected.txt b/deps/v8/test/inspector/cpu-profiler/console-profile-wasm-expected.txt
index ef1eeb767851c2..eb8e2a5907ec8d 100644
--- a/deps/v8/test/inspector/cpu-profiler/console-profile-wasm-expected.txt
+++ b/deps/v8/test/inspector/cpu-profiler/console-profile-wasm-expected.txt
@@ -31,3 +31,17 @@ Running fib with increasing input until it shows up in the profile.
 Found expected functions in profile.
 Wasm script id is set.
 Wasm position: wasm://wasm/07da49be@0:47
+
+Running test: testRunningCodeInDifferentIsolate
+Building wasm module with sentinel 5.
+Instantiating in inspector isolate.
+Instantiating in the debugged isolate.
+Compiling wasm.
+Enabling profiler in the debugged isolate.
+Running in the inspector isolate.
+Running in the debugged isolate.
+Running fib with increasing input until it shows up in the profile.
+Found expected functions in profile.
+Wasm script id is set.
+Wasm position: wasm://wasm/ba5e5b4e@0:47
+Disabling profiler.
diff --git a/deps/v8/test/inspector/cpu-profiler/console-profile-wasm.js b/deps/v8/test/inspector/cpu-profiler/console-profile-wasm.js
index 8c14a1d7393f68..b0fc0c54464445 100644
--- a/deps/v8/test/inspector/cpu-profiler/console-profile-wasm.js
+++ b/deps/v8/test/inspector/cpu-profiler/console-profile-wasm.js
@@ -38,7 +38,7 @@ function buildModuleBytes() {
   return builder.toArray();
 }
 
-function compile(bytes) {
+function instantiate(bytes) {
   let buffer = new ArrayBuffer(bytes.length);
   let view = new Uint8Array(buffer);
   for (var i = 0; i < bytes.length; i++) {
@@ -90,8 +90,8 @@ Protocol.Profiler.onConsoleProfileFinished(e => {
   // There are two different kinds of js-to-wasm-wrappers, so there are two
   // possible positive traces.
   const expected = [
-    ['fib'], ['wasm-to-js:i:i'], ['imp'],
-    ['GenericJSToWasmWrapper', 'js-to-wasm:i:i'], ['fib']
+    ['fib'], ['wasm-to-js', 'wasm-to-js:i:i'], ['imp'],
+    ['js-to-wasm', 'js-to-wasm:i:i'], ['fib']
   ];
   if (!addSeenProfile(function_names)) return;
   for (let i = 0; i <= function_names.length - expected.length; ++i) {
@@ -139,11 +139,12 @@ async function runFibUntilProfileFound() {
   InspectorTest.log(`Wasm position: ${wasm_position}`);
 }
 
-async function compileWasm() {
+async function compileWasm(module_bytes) {
   InspectorTest.log('Compiling wasm.');
+  if (module_bytes === undefined) module_bytes = buildModuleBytes();
   checkError(await Protocol.Runtime.evaluate({
-    expression: `globalThis.instance = (${compile})(${
-        JSON.stringify(buildModuleBytes())});`
+    expression: `globalThis.instance = (${instantiate})(${
+        JSON.stringify(module_bytes)});`
   }));
 }
 
@@ -182,5 +183,26 @@ InspectorTest.runAsyncTestSuite([
     await runFibUntilProfileFound();
     await Protocol.Debugger.disable();
     await Protocol.Profiler.disable();
+  },
+
+  async function testRunningCodeInDifferentIsolate() {
+    // Do instantiate the module in the inspector isolate *and* in the debugged
+    // isolate. Trigger lazy compilation in the inspector isolate then. Check
+    // that we can profile in the debugged isolate later, i.e. the lazily
+    // compiled code was logged there.
+    let module_bytes = buildModuleBytes();
+    InspectorTest.log('Instantiating in inspector isolate.');
+    let instance = instantiate(module_bytes);
+    InspectorTest.log('Instantiating in the debugged isolate.');
+    await compileWasm(module_bytes);
+    InspectorTest.log('Enabling profiler in the debugged isolate.');
+    await Protocol.Profiler.enable();
+    checkError(await Protocol.Profiler.start());
+    InspectorTest.log('Running in the inspector isolate.');
+    instance.exports.fib(26);
+    InspectorTest.log('Running in the debugged isolate.');
+    await runFibUntilProfileFound();
+    InspectorTest.log('Disabling profiler.');
+    await Protocol.Profiler.disable();
   }
 ]);
diff --git a/deps/v8/test/inspector/debugger/break-on-exception-and-step-expected.txt b/deps/v8/test/inspector/debugger/break-on-exception-and-step-expected.txt
index 81822abeb27a82..d7edfc59d4a009 100644
--- a/deps/v8/test/inspector/debugger/break-on-exception-and-step-expected.txt
+++ b/deps/v8/test/inspector/debugger/break-on-exception-and-step-expected.txt
@@ -7,6 +7,17 @@ function b() { c(); };
 
 
 Running test: testStepThrougB
+paused on exception:
+{
+    reasons : [
+        [0] : {
+            reason : step
+        }
+        [1] : {
+            reason : other
+        }
+    ]
+}
 function a() { n(); };
 function b() { #c(); };
 function c() { n(); };
@@ -17,6 +28,17 @@ function d() { x = 1; try { e(); } catch(x) { x = 2; } };
 
 
 Running test: testStepThrougD
+paused on exception:
+{
+    reasons : [
+        [0] : {
+            reason : step
+        }
+        [1] : {
+            reason : other
+        }
+    ]
+}
 function c() { n(); };
 function d() { #x = 1; try { e(); } catch(x) { x = 2; } };
 function e() { n(); };
@@ -39,6 +61,17 @@ function e() { n(); };
 
 
 Running test: testStepThrougDWithBreakOnAllExceptions
+paused on exception:
+{
+    reasons : [
+        [0] : {
+            reason : step
+        }
+        [1] : {
+            reason : other
+        }
+    ]
+}
 function c() { n(); };
 function d() { #x = 1; try { e(); } catch(x) { x = 2; } };
 function e() { n(); };
@@ -74,6 +107,17 @@ function e() { n(); };
 
 
 Running test: testStepThrougF
+paused on exception:
+{
+    reasons : [
+        [0] : {
+            reason : step
+        }
+        [1] : {
+            reason : other
+        }
+    ]
+}
 function e() { n(); };
 function f() { #x = 1; try { g(); } catch(x) { x = 2; } };
 function g() { h(); };
@@ -104,6 +148,17 @@ function g() { h(); };
 
 
 Running test: testStepThrougFWithBreakOnAllExceptions
+paused on exception:
+{
+    reasons : [
+        [0] : {
+            reason : step
+        }
+        [1] : {
+            reason : other
+        }
+    ]
+}
 function e() { n(); };
 function f() { #x = 1; try { g(); } catch(x) { x = 2; } };
 function g() { h(); };
diff --git a/deps/v8/test/inspector/debugger/class-fields-scopes-expected.txt b/deps/v8/test/inspector/debugger/class-fields-scopes-expected.txt
index 618da8fe5ff59f..646e851fd4e957 100644
--- a/deps/v8/test/inspector/debugger/class-fields-scopes-expected.txt
+++ b/deps/v8/test/inspector/debugger/class-fields-scopes-expected.txt
@@ -104,7 +104,7 @@ Running test: testScopesPaused
                     type : object
                 }
                 startLocation : {
-                    columnNumber : 2
+                    columnNumber : 10
                     lineNumber : 11
                     scriptId : <scriptId>
                 }
@@ -187,7 +187,7 @@ Running test: testScopesPaused
         callFrameId : <callFrameId>
         canBeRestarted : true
         functionLocation : {
-            columnNumber : 2
+            columnNumber : 10
             lineNumber : 11
             scriptId : <scriptId>
         }
@@ -212,7 +212,7 @@ Running test: testScopesPaused
                     type : object
                 }
                 startLocation : {
-                    columnNumber : 2
+                    columnNumber : 10
                     lineNumber : 11
                     scriptId : <scriptId>
                 }
@@ -421,7 +421,7 @@ Running test: testScopesPaused
         callFrameId : <callFrameId>
         canBeRestarted : true
         functionLocation : {
-            columnNumber : 2
+            columnNumber : 10
             lineNumber : 11
             scriptId : <scriptId>
         }
@@ -446,7 +446,7 @@ Running test: testScopesPaused
                     type : object
                 }
                 startLocation : {
-                    columnNumber : 2
+                    columnNumber : 10
                     lineNumber : 11
                     scriptId : <scriptId>
                 }
@@ -655,7 +655,7 @@ Running test: testScopesPaused
         callFrameId : <callFrameId>
         canBeRestarted : true
         functionLocation : {
-            columnNumber : 2
+            columnNumber : 10
             lineNumber : 11
             scriptId : <scriptId>
         }
@@ -680,7 +680,7 @@ Running test: testScopesPaused
                     type : object
                 }
                 startLocation : {
-                    columnNumber : 2
+                    columnNumber : 10
                     lineNumber : 11
                     scriptId : <scriptId>
                 }
@@ -962,7 +962,7 @@ Running test: testScopesPaused
         callFrameId : <callFrameId>
         canBeRestarted : true
         functionLocation : {
-            columnNumber : 2
+            columnNumber : 10
             lineNumber : 11
             scriptId : <scriptId>
         }
@@ -987,7 +987,7 @@ Running test: testScopesPaused
                     type : object
                 }
                 startLocation : {
-                    columnNumber : 2
+                    columnNumber : 10
                     lineNumber : 11
                     scriptId : <scriptId>
                 }
diff --git a/deps/v8/test/inspector/debugger/class-fields-scopes.js b/deps/v8/test/inspector/debugger/class-fields-scopes.js
index 6849e5ebac4832..dcce7b608abbe3 100644
--- a/deps/v8/test/inspector/debugger/class-fields-scopes.js
+++ b/deps/v8/test/inspector/debugger/class-fields-scopes.js
@@ -1,8 +1,6 @@
 // Copyright 2016 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
-//
-// Flags: --harmony-public-fields --harmony-static-fields
 
 let { session, contextGroup, Protocol } = InspectorTest.start(
   "Test class fields scopes"
diff --git a/deps/v8/test/inspector/debugger/get-possible-breakpoints-class-fields-expected.txt b/deps/v8/test/inspector/debugger/get-possible-breakpoints-class-fields-expected.txt
index b1fc379d92dfcf..f89fe44fbbf605 100644
--- a/deps/v8/test/inspector/debugger/get-possible-breakpoints-class-fields-expected.txt
+++ b/deps/v8/test/inspector/debugger/get-possible-breakpoints-class-fields-expected.txt
@@ -106,23 +106,23 @@ let x = |R|class {}
 
 |_|x = |R|class {
   static x = |_|1;
-  static y = |_|2|R|;
-}
+  static y = |_|2;
+}|R|
 
 |_|x = |R|class {
   static x = |C|foo();
   static y = |_|2;
-  static z = |C|bar()|R|;
-}
+  static z = |C|bar();
+}|R|
 
 |_|x = class {
   static x = |C|foo();
   static y = |_|2;
-  static z = |C|bar()|R|;
+  static z = |C|bar();
   constructor() {
     this.|_|x;
   |R|}
-}
+}|R|
 
 |_|x = class {
   static x = |C|foo();
@@ -130,15 +130,15 @@ let x = |R|class {}
   constructor() {
     this.|_|x;
   |R|}
-  static z = |C|bar()|R|;
-}
+  static z = |C|bar();
+}|R|
 
 |_|x = |R|class {
   static x = |_|1;
   static foo() {|R|}
   bar() {|R|}
-  static y = |_|2|R|;
-}
+  static y = |_|2;
+}|R|
 
 |_|x = |R|class {
   static x = (function() {
@@ -146,61 +146,61 @@ let x = |R|class {}
   |R|})|C|();
   static y = (() => {
     |C|bar();
-  |R|})|C|()|R|;
-}
+  |R|})|C|();
+}|R|
 
 |_|x = |R|class {
   static x = |_|function() {
     |C|foo();
-  |R|}|R|;
-}
+  |R|};
+}|R|
 
 |_|x = |R|class {
   static x = |_|async function() {
     |_|await |C|foo();
-  |R|}|R|;
-}
+  |R|};
+}|R|
 
 |_|x = |R|class {
   static x = |_|() => {
     |C|foo();
   |R|};
   static y = |_|() => |C|bar()|R|;
-}
+}|R|
 
 |_|x = |R|class {
   static x = |_|async () => {
     |_|await |C|foo();
   |R|};
   static y = |_|async () => |_|await |C|bar()|R|;
-}
+}|R|
 
 |_|x = |R|class {
   static [|_|x] = |_|1;
-  static [|C|foo()] = |_|2|R|;
-}
+  static [|C|foo()] = |_|2;
+}|R|
 
 |_|x = |R|class {
-  static [|_|x] = |_|[...this]|R|;
-}
+  static [|_|x] = |_|[...this];
+}|R|
 
 |_|x = |R|class {
   static x;
-  static [|C|foo()]|R|;
-}
+  static [|C|foo()];
+}|R|
 
 |_|x = |R|class {
   static x = |_|function*() {
     |_|yield 1;
-  |R|}|R|;
-}
+  |R|};
+}|R|
 
 |_|x = |R|class {
   static x = |_|1;
   y = |_|2;
   static [|_|z] = |_|3;
   [|_|p] = |_|4;
-  static [|C|foo()] = |_|5|R|;
+  static [|C|foo()] = |_|5;
   [|C|bar()] = |_|6;
 }|R|
 |R|
diff --git a/deps/v8/test/inspector/debugger/get-possible-breakpoints-class-fields.js b/deps/v8/test/inspector/debugger/get-possible-breakpoints-class-fields.js
index 068fce2557ce9f..2b48927b8f0d99 100644
--- a/deps/v8/test/inspector/debugger/get-possible-breakpoints-class-fields.js
+++ b/deps/v8/test/inspector/debugger/get-possible-breakpoints-class-fields.js
@@ -1,8 +1,6 @@
 // Copyright 2018 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
-//
-// Flags: --harmony-public-fields --harmony-static-fields
 
 let { session, contextGroup, Protocol } = InspectorTest.start(
   "Checks Debugger.getPossibleBreakpoints for class fields"
diff --git a/deps/v8/test/inspector/debugger/object-preview-internal-properties.js b/deps/v8/test/inspector/debugger/object-preview-internal-properties.js
index d2b3a7816339e9..026c4bc1c364c9 100644
--- a/deps/v8/test/inspector/debugger/object-preview-internal-properties.js
+++ b/deps/v8/test/inspector/debugger/object-preview-internal-properties.js
@@ -1,8 +1,6 @@
 // Copyright 2016 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
-//
-// Flags: --harmony-symbol-as-weakmap-key
 
 let {session, contextGroup, Protocol} = InspectorTest.start("Check internal properties reported in object preview.");
 
diff --git a/deps/v8/test/inspector/debugger/other-pause-reasons-expected.txt b/deps/v8/test/inspector/debugger/other-pause-reasons-expected.txt
index 475fa67d5aec89..0740845222d0bc 100644
--- a/deps/v8/test/inspector/debugger/other-pause-reasons-expected.txt
+++ b/deps/v8/test/inspector/debugger/other-pause-reasons-expected.txt
@@ -11,9 +11,9 @@ Paused with reason other, data {} and scriptId: 4.
 Running test: testSteppingPauseReason
 Paused with reason instrumentation, data {"scriptId":"5","url":"foo.js"} and scriptId: 5.
 Paused with reason other, data {} and scriptId: 5.
-Paused with reason other, data {} and scriptId: 5.
+Paused with reason step, data {} and scriptId: 5.
 Paused with reason instrumentation, data {"scriptId":"6","url":"bar.js"} and scriptId: 6.
-Paused with reason other, data {} and scriptId: 6.
+Paused with reason step, data {} and scriptId: 6.
 
 Running test: testOnlyReportOtherWithEmptyDataOnce
 Paused with reason other, data {} and scriptId: 7.
@@ -25,13 +25,13 @@ Paused with reason other, data {} and scriptId: 8.
 Running test: testAsyncSteppingPauseReason
 Paused with reason instrumentation, data {"scriptId":"9","url":"foo.js"} and scriptId: 9.
 Paused with reason other, data {} and scriptId: 9.
-Paused with reason other, data {} and scriptId: 9.
+Paused with reason step, data {} and scriptId: 9.
 Paused with reason instrumentation, data {"scriptId":"10","url":"bar.js"} and scriptId: 10.
-Paused with reason other, data {} and scriptId: 10.
-Paused with reason other, data {} and scriptId: 10.
+Paused with reason step, data {} and scriptId: 10.
+Paused with reason step, data {} and scriptId: 10.
 
 Running test: testSteppingOutPauseReason
 Paused with reason instrumentation, data {"scriptId":"11","url":"foo.js"} and scriptId: 11.
 Paused with reason other, data {} and scriptId: 11.
 Paused with reason instrumentation, data {"scriptId":"12","url":"bar.js"} and scriptId: 12.
-Paused with reason other, data {} and scriptId: 11.
+Paused with reason step, data {} and scriptId: 11.
diff --git a/deps/v8/test/inspector/debugger/restart-frame/restart-top-frame-local-variables-expected.txt b/deps/v8/test/inspector/debugger/restart-frame/restart-top-frame-local-variables-expected.txt
index e206c063427783..2638336f150a87 100644
--- a/deps/v8/test/inspector/debugger/restart-frame/restart-top-frame-local-variables-expected.txt
+++ b/deps/v8/test/inspector/debugger/restart-frame/restart-top-frame-local-variables-expected.txt
@@ -56,8 +56,26 @@ Evaluating y:
 {
     id : <messageId>
     result : {
+        exceptionDetails : {
+            columnNumber : 0
+            exception : {
+                className : ReferenceError
+                description : ReferenceError: Cannot access 'y' from debugger     at eval (eval at foo (:1:1), <anonymous>:1:1)     at foo (testRestartFrame.js:3:11)     at testRestartFrame.js:8:1
+                objectId : <objectId>
+                subtype : error
+                type : object
+            }
+            exceptionId : <exceptionId>
+            lineNumber : 0
+            scriptId : <scriptId>
+            text : Uncaught
+        }
         result : {
-            type : undefined
+            className : ReferenceError
+            description : ReferenceError: Cannot access 'y' from debugger     at eval (eval at foo (:1:1), <anonymous>:1:1)     at foo (testRestartFrame.js:3:11)     at testRestartFrame.js:8:1
+            objectId : <objectId>
+            subtype : error
+            type : object
         }
     }
 }
@@ -65,8 +83,26 @@ Evaluating z:
 {
     id : <messageId>
     result : {
+        exceptionDetails : {
+            columnNumber : 0
+            exception : {
+                className : ReferenceError
+                description : ReferenceError: Cannot access 'z' from debugger     at eval (eval at foo (:1:1), <anonymous>:1:1)     at foo (testRestartFrame.js:3:11)     at testRestartFrame.js:8:1
+                objectId : <objectId>
+                subtype : error
+                type : object
+            }
+            exceptionId : <exceptionId>
+            lineNumber : 0
+            scriptId : <scriptId>
+            text : Uncaught
+        }
         result : {
-            type : undefined
+            className : ReferenceError
+            description : ReferenceError: Cannot access 'z' from debugger     at eval (eval at foo (:1:1), <anonymous>:1:1)     at foo (testRestartFrame.js:3:11)     at testRestartFrame.js:8:1
+            objectId : <objectId>
+            subtype : error
+            type : object
         }
     }
 }
diff --git a/deps/v8/test/inspector/debugger/restart-frame/restart-top-frame-local-variables.js b/deps/v8/test/inspector/debugger/restart-frame/restart-top-frame-local-variables.js
index efd96e34d3e27d..c2e42e46271038 100644
--- a/deps/v8/test/inspector/debugger/restart-frame/restart-top-frame-local-variables.js
+++ b/deps/v8/test/inspector/debugger/restart-frame/restart-top-frame-local-variables.js
@@ -2,6 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// Flags: --experimental-value-unavailable
+
 const {session, Protocol} =
     InspectorTest.start('Checks that after restarting the top frame, local variables are reset');
 
diff --git a/deps/v8/test/inspector/debugger/tdz-modules-scopes-expected.txt b/deps/v8/test/inspector/debugger/tdz-modules-scopes-expected.txt
index 3dff1b026db9c8..5400273ca355ff 100644
--- a/deps/v8/test/inspector/debugger/tdz-modules-scopes-expected.txt
+++ b/deps/v8/test/inspector/debugger/tdz-modules-scopes-expected.txt
@@ -1,15 +1,15 @@
 Test module scope with variables in TDZ.
 Debug break
   Scope type: module
-    moduleLet : undefined
-    moduleConst : undefined
-    exportedModuleLet : undefined
-    exportedModuleConst : undefined
+    moduleLet : <value_unavailable>
+    moduleConst : <value_unavailable>
+    exportedModuleLet : <value_unavailable>
+    exportedModuleConst : <value_unavailable>
 Debug break
   Scope type: local
   Scope type: module
-    exportedModuleLet : undefined
-    exportedModuleConst : undefined
+    exportedModuleLet : <value_unavailable>
+    exportedModuleConst : <value_unavailable>
 Debug break
   Scope type: module
     moduleLet : 3
@@ -25,8 +25,8 @@ Debug break
   Scope type: module
     exportedModuleLet : 1
     exportedModuleConst : 2
-    moduleLet : undefined
-    moduleConst : undefined
+    moduleLet : <value_unavailable>
+    moduleConst : <value_unavailable>
 Debug break
   Scope type: local
   Scope type: module
diff --git a/deps/v8/test/inspector/debugger/tdz-modules-scopes.js b/deps/v8/test/inspector/debugger/tdz-modules-scopes.js
index 40f5f6c105d02e..6485bdc10e3ce1 100644
--- a/deps/v8/test/inspector/debugger/tdz-modules-scopes.js
+++ b/deps/v8/test/inspector/debugger/tdz-modules-scopes.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --no-always-turbofan
+// Flags: --no-always-turbofan --experimental-value-unavailable
 
 let {session, contextGroup, Protocol} =
     InspectorTest.start('Test module scope with variables in TDZ.');
@@ -43,7 +43,11 @@ for (let i =0; i < 8; i++) {
     InspectorTest.log(`  Scope type: ${scope.type}`);
     let { result: { result: locals }} = await Protocol.Runtime.getProperties({ "objectId" : scope.object.objectId });
     for (let local of locals) {
-      InspectorTest.log(`    ${local.name} : ${local.value.value}`);
+      if ('value' in local) {
+        InspectorTest.log(`    ${local.name} : ${local.value.value}`);
+      } else {
+        InspectorTest.log(`    ${local.name} : <value_unavailable>`);
+      }
     }
   }
   await Protocol.Debugger.resume();
diff --git a/deps/v8/test/inspector/debugger/tdz-scopes-expected.txt b/deps/v8/test/inspector/debugger/tdz-scopes-expected.txt
index af2150aab3aacf..1e7046549f01f2 100644
--- a/deps/v8/test/inspector/debugger/tdz-scopes-expected.txt
+++ b/deps/v8/test/inspector/debugger/tdz-scopes-expected.txt
@@ -1,21 +1,21 @@
 Test scopes with variables in TDZ.
 Debug break
   Scope type: block
-    blockLet : undefined
-    blockConst : undefined
-    contextBlockLet : undefined
-    contextBlockConst : undefined
+    blockLet : <value_unavailable>
+    blockConst : <value_unavailable>
+    contextBlockLet : <value_unavailable>
+    contextBlockConst : <value_unavailable>
   Scope type: script
-    scriptLet : undefined
-    scriptConst : undefined
+    scriptLet : <value_unavailable>
+    scriptConst : <value_unavailable>
 Debug break
   Scope type: local
   Scope type: block
-    contextBlockLet : undefined
-    contextBlockConst : undefined
+    contextBlockLet : <value_unavailable>
+    contextBlockConst : <value_unavailable>
   Scope type: script
-    scriptLet : undefined
-    scriptConst : undefined
+    scriptLet : <value_unavailable>
+    scriptConst : <value_unavailable>
 Debug break
   Scope type: block
     blockLet : 1
@@ -23,25 +23,25 @@ Debug break
     contextBlockLet : 3
     contextBlockConst : 4
   Scope type: script
-    scriptLet : undefined
-    scriptConst : undefined
+    scriptLet : <value_unavailable>
+    scriptConst : <value_unavailable>
 Debug break
   Scope type: local
   Scope type: block
     contextBlockLet : 3
     contextBlockConst : 4
   Scope type: script
-    scriptLet : undefined
-    scriptConst : undefined
+    scriptLet : <value_unavailable>
+    scriptConst : <value_unavailable>
 Debug break
   Scope type: script
-    scriptLet : undefined
-    scriptConst : undefined
+    scriptLet : <value_unavailable>
+    scriptConst : <value_unavailable>
 Debug break
   Scope type: local
   Scope type: script
-    scriptLet : undefined
-    scriptConst : undefined
+    scriptLet : <value_unavailable>
+    scriptConst : <value_unavailable>
 Debug break
   Scope type: script
     scriptLet : 1
diff --git a/deps/v8/test/inspector/debugger/tdz-scopes.js b/deps/v8/test/inspector/debugger/tdz-scopes.js
index c106399d249195..65a9b5e17fc59b 100644
--- a/deps/v8/test/inspector/debugger/tdz-scopes.js
+++ b/deps/v8/test/inspector/debugger/tdz-scopes.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --no-always-turbofan
+// Flags: --no-always-turbofan --experimental-value-unavailable
 
 let {session, contextGroup, Protocol} =
     InspectorTest.start('Test scopes with variables in TDZ.');
@@ -41,7 +41,11 @@ for (let i =0; i < 8; i++) {
     InspectorTest.log(`  Scope type: ${scope.type}`);
     let { result: { result: locals }} = await Protocol.Runtime.getProperties({ "objectId" : scope.object.objectId });
     for (let local of locals) {
-      InspectorTest.log(`    ${local.name} : ${local.value.value}`);
+      if ('value' in local) {
+        InspectorTest.log(`    ${local.name} : ${local.value.value}`);
+      } else {
+        InspectorTest.log(`    ${local.name} : <value_unavailable>`);
+      }
     }
   }
   await Protocol.Debugger.resume();
diff --git a/deps/v8/test/inspector/debugger/wasm-evaluate-on-call-frame.js b/deps/v8/test/inspector/debugger/wasm-evaluate-on-call-frame.js
index 8aeb5e16b9637b..1b18729194b11d 100644
--- a/deps/v8/test/inspector/debugger/wasm-evaluate-on-call-frame.js
+++ b/deps/v8/test/inspector/debugger/wasm-evaluate-on-call-frame.js
@@ -248,7 +248,8 @@ InspectorTest.runAsyncTestSuite([
 
   async function testMemories() {
     const builder = new WasmModuleBuilder();
-    builder.addMemory(1, 1).exportMemoryAs('foo');
+    builder.addMemory(1, 1);
+    builder.exportMemoryAs('foo');
     const main = builder.addFunction('main', kSig_v_v)
                         .addBody([kExprNop]).exportFunc();
     const KEYS = [0, '$foo'];
diff --git a/deps/v8/test/inspector/debugger/wasm-gc-multi-module-expected.txt b/deps/v8/test/inspector/debugger/wasm-gc-multi-module-expected.txt
new file mode 100644
index 00000000000000..1a227f50b66bc9
--- /dev/null
+++ b/deps/v8/test/inspector/debugger/wasm-gc-multi-module-expected.txt
@@ -0,0 +1,58 @@
+Test inspection of Wasm GC objects with multiple modules
+
+Running test: test
+Calling instantiate function for module A.
+Waiting for wasm script to be parsed.
+Got wasm script!
+Calling instantiate function for module B.
+Waiting for wasm script to be parsed.
+Module A instantiated.
+Got wasm script!
+Module B instantiated.
+Setting breakpoint
+Setting breakpoint
+{
+    columnNumber : 72
+    lineNumber : 0
+    scriptId : <scriptId>
+}
+{
+    columnNumber : 108
+    lineNumber : 0
+    scriptId : <scriptId>
+}
+Paused:
+Script wasm://wasm/f3106782 byte offset 72: Wasm opcode 0x01 (kExprNop)
+Scope:
+at $main (0:72):
+ - scope (wasm-expression-stack):
+   stack: 
+ - scope (local):
+   $var0: Array ((ref $type0))
+   $var1: Struct ((ref $type0))
+ - scope (module):
+   instance: exports: "createStruct" (Function), "main" (Function)
+   module: Module
+   functions: "$createStruct": (Function), "$main": (Function)
+at (anonymous) (0:18):
+ - scope (global):
+   -- skipped globals
+
+Paused:
+Script wasm://wasm/8222de3e byte offset 108: Wasm opcode 0x01 (kExprNop)
+Scope:
+at $main (0:108):
+ - scope (wasm-expression-stack):
+   stack: 
+ - scope (local):
+   $var0: Array ((ref $type0))
+   $var1: Struct ((ref $type0))
+ - scope (module):
+   instance: exports: "createStruct" (Function), "createArray" (Function), "main" (Function)
+   module: Module
+   functions: "$createStruct": (Function), "$createArray": (Function), "$main": (Function)
+at (anonymous) (4:24):
+ - scope (global):
+   -- skipped globals
+
+main returned. Test finished.
diff --git a/deps/v8/test/inspector/debugger/wasm-gc-multi-module.js b/deps/v8/test/inspector/debugger/wasm-gc-multi-module.js
new file mode 100644
index 00000000000000..04d574c4237045
--- /dev/null
+++ b/deps/v8/test/inspector/debugger/wasm-gc-multi-module.js
@@ -0,0 +1,158 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --experimental-wasm-typed-funcref
+// Flags: --experimental-wasm-type-reflection
+
+// Test debugger type name resolution for ref types with multiple modules.
+// Due to type canonicalization, for any given canonicalized type there is only
+// one RTT. The RTT has a pointer to the instance and the first instance wins,
+// meaning the name is based on the first module defining any given rec type
+// group.
+
+utils.load('test/inspector/wasm-inspector-test.js');
+
+let {session, contextGroup, Protocol} = InspectorTest.start(
+    'Test inspection of Wasm GC objects with multiple modules');
+session.setupScriptMap();
+Protocol.Runtime.enable();
+Protocol.Debugger.enable();
+Protocol.Debugger.onPaused(printPauseLocationsAndContinue);
+
+let breakpointLocation = -1;
+
+InspectorTest.runAsyncTestSuite([
+  async function test() {
+    // Instantiate two modules. Module B has the rec type group of Module A,
+    // however at a different type index offset.
+    let wasmPromiseA = instantiateWasm('A', false);
+    let scriptIdsA = await waitForWasmScripts();
+    let breakLocationA = breakpointLocation;
+    let wasmPromiseB = instantiateWasm('B', true);
+    let scriptIdsB = await waitForWasmScripts();
+    let breakLocationB = breakpointLocation;
+    await wasmPromiseA;  // Make sure the instantiation is finished.
+    await wasmPromiseB;  // Make sure the instantiation is finished.
+
+    // Set a breakpoint on each module.
+    async function setBreakpoint(scriptId, breakAt) {
+      InspectorTest.log('Setting breakpoint');
+      let breakpoint = await Protocol.Debugger.setBreakpoint(
+          {'location': {'scriptId': scriptId,
+                        'lineNumber': 0,
+                        'columnNumber': breakAt}});
+      printIfFailure(breakpoint);
+      InspectorTest.logMessage(breakpoint.result.actualLocation);
+    }
+    setBreakpoint(scriptIdsA[0], breakLocationA);
+    setBreakpoint(scriptIdsB[0], breakLocationB);
+
+    // Now run the wasm code.
+    await WasmInspectorTest.evalWithUrl(
+      // Note: Neither the function that has the breakpoint nor the function
+      // that created the object is relevant for the type name printed but the
+      // first module that defined any given rec group. In this case
+      // `createStruct` for both modules returns a struct that is printed as
+      // 'ref $type0'.
+      // Similarly `createArray` - which only exists in module B - derives its
+      // name from the first module that defined it. It just happens that in
+      // module B the array is at index 0 and therefore the type is also printed
+      // as `ref $type0`.
+      `instanceA.exports.main(
+        instanceB.exports.createArray(10),
+        instanceA.exports.createStruct(11)
+      );
+      instanceB.exports.main(
+        instanceB.exports.createArray(10),
+        instanceA.exports.createStruct(11)
+      );`,
+      'runWasm');
+    InspectorTest.log('main returned. Test finished.');
+  }
+]);
+
+async function printPauseLocationsAndContinue(msg) {
+  let loc = msg.params.callFrames[0].location;
+  InspectorTest.log('Paused:');
+  await session.logSourceLocation(loc);
+  InspectorTest.log('Scope:');
+  for (var frame of msg.params.callFrames) {
+    var isWasmFrame = /^wasm/.test(frame.url);
+    var functionName = frame.functionName || '(anonymous)';
+    var lineNumber = frame.location.lineNumber;
+    var columnNumber = frame.location.columnNumber;
+    InspectorTest.log(`at ${functionName} (${lineNumber}:${columnNumber}):`);
+    for (var scope of frame.scopeChain) {
+      InspectorTest.logObject(' - scope (' + scope.type + '):');
+      if (!isWasmFrame && scope.type == 'global') {
+        // Skip global scope for non wasm-functions.
+        InspectorTest.logObject('   -- skipped globals');
+        continue;
+      }
+      var properties = await Protocol.Runtime.getProperties(
+          {'objectId': scope.object.objectId});
+      await WasmInspectorTest.dumpScopeProperties(properties);
+    }
+  }
+  InspectorTest.log();
+  Protocol.Debugger.resume();
+}
+
+async function instantiateWasm(module_name, add_extra_types) {
+  var builder = new WasmModuleBuilder();
+  let array_type;
+  if (add_extra_types) {
+    builder.startRecGroup();
+    array_type = builder.addArray(kWasmI32, true);
+    builder.endRecGroup();
+  }
+  builder.startRecGroup();
+  let struct_type = builder.addStruct([makeField(kWasmI32, false)]);
+  builder.endRecGroup();
+
+  builder.addFunction('createStruct', makeSig([kWasmI32], [kWasmAnyRef]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprStructNew, struct_type,
+    ])
+    .exportFunc();
+
+  if (add_extra_types) {
+    builder.addFunction('createArray', makeSig([kWasmI32], [kWasmAnyRef]))
+      .addBody([
+        kExprLocalGet, 0,
+        kGCPrefix, kExprArrayNewFixed, array_type, 1,
+      ])
+      .exportFunc();
+  }
+
+  let body = [
+    kExprNop,
+  ];
+  let main = builder.addFunction('main', makeSig([kWasmAnyRef, kWasmAnyRef], []))
+      .addBody(body)
+      .exportFunc();
+  var module_bytes = builder.toArray();
+  breakpointLocation = main.body_offset + body.length - 1;
+
+  InspectorTest.log(`Calling instantiate function for module ${module_name}.`);
+  let imports = `{}`;
+  await WasmInspectorTest.instantiate(
+    module_bytes, `instance${module_name}`, imports);
+  InspectorTest.log(`Module ${module_name} instantiated.`);
+}
+
+async function waitForWasmScripts() {
+  InspectorTest.log('Waiting for wasm script to be parsed.');
+  let wasm_script_ids = [];
+  while (wasm_script_ids.length < 1) {
+    let script_msg = await Protocol.Debugger.onceScriptParsed();
+    let url = script_msg.params.url;
+    if (url.startsWith('wasm://')) {
+      InspectorTest.log('Got wasm script!');
+      wasm_script_ids.push(script_msg.params.scriptId);
+    }
+  }
+  return wasm_script_ids;
+}
diff --git a/deps/v8/test/inspector/debugger/wasm-scope-info.js b/deps/v8/test/inspector/debugger/wasm-scope-info.js
index 4b920d2b897d32..98bb1b551b32f7 100644
--- a/deps/v8/test/inspector/debugger/wasm-scope-info.js
+++ b/deps/v8/test/inspector/debugger/wasm-scope-info.js
@@ -66,7 +66,8 @@ async function instantiateWasm() {
   var builder = new WasmModuleBuilder();
   // Add a global, memory and exports to populate the module scope.
   builder.addGlobal(kWasmI32, true).exportAs('exported_global');
-  builder.addMemory(1,1).exportMemoryAs('exported_memory');
+  builder.addMemory(1, 1);
+  builder.exportMemoryAs('exported_memory');
   builder.addTable(kWasmAnyFunc, 3).exportAs('exported_table');
 
   // Add two functions without breakpoint, to check that locals and operand
diff --git a/deps/v8/test/inspector/frontend-channel.h b/deps/v8/test/inspector/frontend-channel.h
index 2198a94c40b679..70f7b54023e137 100644
--- a/deps/v8/test/inspector/frontend-channel.h
+++ b/deps/v8/test/inspector/frontend-channel.h
@@ -35,38 +35,43 @@ class FrontendChannelImpl : public v8_inspector::V8Inspector::Channel {
   void sendResponse(
       int callId,
       std::unique_ptr<v8_inspector::StringBuffer> message) override {
-    task_runner_->Append(
-        std::make_unique<SendMessageTask>(this, ToVector(message->string())));
+    task_runner_->Append(std::make_unique<SendMessageTask>(
+        session_id_, ToVector(message->string())));
   }
   void sendNotification(
       std::unique_ptr<v8_inspector::StringBuffer> message) override {
-    task_runner_->Append(
-        std::make_unique<SendMessageTask>(this, ToVector(message->string())));
+    task_runner_->Append(std::make_unique<SendMessageTask>(
+        session_id_, ToVector(message->string())));
   }
   void flushProtocolNotifications() override {}
 
   class SendMessageTask : public TaskRunner::Task {
    public:
-    SendMessageTask(FrontendChannelImpl* channel,
-                    const std::vector<uint16_t>& message)
-        : channel_(channel), message_(message) {}
+    SendMessageTask(int session_id, const std::vector<uint16_t>& message)
+        : session_id_(session_id), message_(message) {}
     ~SendMessageTask() override = default;
     bool is_priority_task() final { return false; }
 
    private:
     void Run(InspectorIsolateData* data) override {
       v8::HandleScope handle_scope(data->isolate());
+      auto* channel = ChannelHolder::GetChannel(session_id_);
+      if (!channel) {
+        // Session got disconnected. Ignore this message.
+        return;
+      }
+
       v8::Local<v8::Context> context =
-          data->GetDefaultContext(channel_->context_group_id_);
+          data->GetDefaultContext(channel->context_group_id_);
       v8::MicrotasksScope microtasks_scope(context,
                                            v8::MicrotasksScope::kRunMicrotasks);
       v8::Context::Scope context_scope(context);
       v8::Local<v8::Value> message = ToV8String(data->isolate(), message_);
       v8::MaybeLocal<v8::Value> result;
-      result = channel_->function_.Get(data->isolate())
+      result = channel->function_.Get(data->isolate())
                    ->Call(context, context->Global(), 1, &message);
     }
-    FrontendChannelImpl* channel_;
+    int session_id_;
     std::vector<uint16_t> message_;
   };
 
diff --git a/deps/v8/test/inspector/heap-profiler/console-retaining-path.js b/deps/v8/test/inspector/heap-profiler/console-retaining-path.js
index d378258f32be19..42a7c67405094b 100644
--- a/deps/v8/test/inspector/heap-profiler/console-retaining-path.js
+++ b/deps/v8/test/inspector/heap-profiler/console-retaining-path.js
@@ -2,6 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// Flags: --no-stress-incremental-marking
+
 let {session, contextGroup, Protocol} = InspectorTest.start(
     'Tests edge labels of objects retained by DevTools.');
 
diff --git a/deps/v8/test/inspector/heap-profiler/heap-snapshot-js-weak-refs.js b/deps/v8/test/inspector/heap-profiler/heap-snapshot-js-weak-refs.js
index 37a08776dd00a8..2219fcfdd09435 100644
--- a/deps/v8/test/inspector/heap-profiler/heap-snapshot-js-weak-refs.js
+++ b/deps/v8/test/inspector/heap-profiler/heap-snapshot-js-weak-refs.js
@@ -2,6 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// Flags: --no-stress-incremental-marking
+
 let {session, contextGroup, Protocol} = InspectorTest.start(
     'Tests weakness of edges from JSWeakRef and WeakCell.');
 
diff --git a/deps/v8/test/inspector/heap-profiler/sampling-heap-profiler-flags-expected.txt b/deps/v8/test/inspector/heap-profiler/sampling-heap-profiler-flags-expected.txt
index 9d66bce04389d9..a4bd9bf22cbba2 100644
--- a/deps/v8/test/inspector/heap-profiler/sampling-heap-profiler-flags-expected.txt
+++ b/deps/v8/test/inspector/heap-profiler/sampling-heap-profiler-flags-expected.txt
@@ -1,5 +1,5 @@
 Checks sampling heap profiler methods.
-Retained size is less than 10KB: true
+Retained size is less than 15KB: true
 Including major GC increases size: true
 Minor GC collected more: true
 Total allocation is greater than 100KB: true
diff --git a/deps/v8/test/inspector/heap-profiler/sampling-heap-profiler-flags.js b/deps/v8/test/inspector/heap-profiler/sampling-heap-profiler-flags.js
index 89aa552b18712b..f1e983056c1c14 100644
--- a/deps/v8/test/inspector/heap-profiler/sampling-heap-profiler-flags.js
+++ b/deps/v8/test/inspector/heap-profiler/sampling-heap-profiler-flags.js
@@ -4,6 +4,7 @@
 
 // Flags: --sampling-heap-profiler-suppress-randomness
 // Flags: --no-stress-incremental-marking
+// Flags: --allow-natives-syntax
 
 (async function() {
   let {contextGroup, Protocol} = InspectorTest.start('Checks sampling heap profiler methods.');
@@ -17,6 +18,10 @@
       }
       return arr[30];
     }
+    %PrepareFunctionForOptimization(generateTrash);
+    generateTrash();
+    %OptimizeFunctionOnNextCall(generateTrash);
+    generateTrash();
     //# sourceURL=test.js`);
 
   Protocol.HeapProfiler.enable();
@@ -29,7 +34,7 @@
   await Protocol.Runtime.evaluate({ expression: 'generateTrash()' });
   const profile1 = await Protocol.HeapProfiler.stopSampling();
   const size1 = nodeSize(profile1.result.profile.head);
-  InspectorTest.log('Retained size is less than 10KB:', size1 < 10000);
+  InspectorTest.log('Retained size is less than 15KB:', size1 < 15000);
 
   await Protocol.HeapProfiler.startSampling({
     samplingInterval: 100,
diff --git a/deps/v8/test/inspector/inspector-test.cc b/deps/v8/test/inspector/inspector-test.cc
index dfc50b2522caac..998283fc8a3bfc 100644
--- a/deps/v8/test/inspector/inspector-test.cc
+++ b/deps/v8/test/inspector/inspector-test.cc
@@ -32,11 +32,9 @@ namespace internal {
 extern void DisableEmbeddedBlobRefcounting();
 extern void FreeCurrentEmbeddedBlob();
 
-extern v8::StartupData CreateSnapshotDataBlobInternal(
+extern v8::StartupData CreateSnapshotDataBlobInternalForInspectorTest(
     v8::SnapshotCreator::FunctionCodeHandling function_code_handling,
-    const char* embedded_source, v8::Isolate* isolate);
-extern v8::StartupData WarmUpSnapshotDataBlobInternal(
-    v8::StartupData cold_snapshot_blob, const char* warmup_source);
+    const char* embedded_source);
 
 namespace {
 
@@ -116,33 +114,31 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
     backend_runner_ = runner;
   }
 
-  static void ClearAllSessions() { channels_.clear(); }
-
  private:
   static TaskRunner* backend_runner_;
 
-  static void Print(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    for (int i = 0; i < args.Length(); i++) {
-      v8::HandleScope handle_scope(args.GetIsolate());
+  static void Print(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    for (int i = 0; i < info.Length(); i++) {
+      v8::HandleScope handle_scope(info.GetIsolate());
       if (i != 0) {
         printf(" ");
       }
 
       // Explicitly catch potential exceptions in toString().
-      v8::TryCatch try_catch(args.GetIsolate());
-      v8::Local<v8::Value> arg = args[i];
+      v8::TryCatch try_catch(info.GetIsolate());
+      v8::Local<v8::Value> arg = info[i];
       v8::Local<v8::String> str_obj;
 
       if (arg->IsSymbol()) {
-        arg = v8::Local<v8::Symbol>::Cast(arg)->Description(args.GetIsolate());
+        arg = v8::Local<v8::Symbol>::Cast(arg)->Description(info.GetIsolate());
       }
-      if (!arg->ToString(args.GetIsolate()->GetCurrentContext())
+      if (!arg->ToString(info.GetIsolate()->GetCurrentContext())
                .ToLocal(&str_obj)) {
         try_catch.ReThrow();
         return;
       }
 
-      v8::String::Utf8Value str(args.GetIsolate(), str_obj);
+      v8::String::Utf8Value str(info.GetIsolate(), str_obj);
       int n =
           static_cast<int>(fwrite(*str, sizeof(**str), str.length(), stdout));
       if (n != str.length()) {
@@ -153,7 +149,7 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
     fflush(stdout);
   }
 
-  static void Quit(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  static void Quit(const v8::FunctionCallbackInfo<v8::Value>& info) {
     fflush(stdout);
     fflush(stderr);
     // Only terminate, so not join the threads here, since joining concurrently
@@ -161,12 +157,12 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
     for (TaskRunner* task_runner : task_runners) task_runner->Terminate();
   }
 
-  static void Setlocale(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsString()) {
+  static void Setlocale(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsString()) {
       FATAL("Internal error: setlocale get one string argument.");
     }
 
-    v8::String::Utf8Value str(args.GetIsolate(), args[1]);
+    v8::String::Utf8Value str(info.GetIsolate(), info[1]);
     setlocale(LC_NUMERIC, *str);
   }
 
@@ -183,78 +179,78 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
     return true;
   }
 
-  static void Read(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsString()) {
+  static void Read(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsString()) {
       FATAL("Internal error: read gets one string argument.");
     }
     std::string chars;
-    v8::Isolate* isolate = args.GetIsolate();
-    if (ReadFile(isolate, args[0], &chars)) {
-      args.GetReturnValue().Set(ToV8String(isolate, chars));
+    v8::Isolate* isolate = info.GetIsolate();
+    if (ReadFile(isolate, info[0], &chars)) {
+      info.GetReturnValue().Set(ToV8String(isolate, chars));
     }
   }
 
-  static void Load(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsString()) {
+  static void Load(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsString()) {
       FATAL("Internal error: load gets one string argument.");
     }
     std::string chars;
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     int context_group_id = data->GetContextGroupId(context);
-    if (ReadFile(isolate, args[0], &chars)) {
+    if (ReadFile(isolate, info[0], &chars)) {
       ExecuteStringTask(chars, context_group_id).Run(data);
     }
   }
 
   static void CompileAndRunWithOrigin(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 6 || !args[0]->IsInt32() || !args[1]->IsString() ||
-        !args[2]->IsString() || !args[3]->IsInt32() || !args[4]->IsInt32() ||
-        !args[5]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 6 || !info[0]->IsInt32() || !info[1]->IsString() ||
+        !info[2]->IsString() || !info[3]->IsInt32() || !info[4]->IsInt32() ||
+        !info[5]->IsBoolean()) {
       FATAL(
           "Internal error: compileAndRunWithOrigin(context_group_id, source, "
           "name, line, column, is_module).");
     }
 
     backend_runner_->Append(std::make_unique<ExecuteStringTask>(
-        args.GetIsolate(), args[0].As<v8::Int32>()->Value(),
-        ToVector(args.GetIsolate(), args[1].As<v8::String>()),
-        args[2].As<v8::String>(), args[3].As<v8::Int32>(),
-        args[4].As<v8::Int32>(), args[5].As<v8::Boolean>()));
+        info.GetIsolate(), info[0].As<v8::Int32>()->Value(),
+        ToVector(info.GetIsolate(), info[1].As<v8::String>()),
+        info[2].As<v8::String>(), info[3].As<v8::Int32>(),
+        info[4].As<v8::Int32>(), info[5].As<v8::Boolean>()));
   }
 
   static void SetCurrentTimeMSForTest(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsNumber()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsNumber()) {
       FATAL("Internal error: setCurrentTimeMSForTest(time).");
     }
     backend_runner_->data()->SetCurrentTimeMS(
-        args[0].As<v8::Number>()->Value());
+        info[0].As<v8::Number>()->Value());
   }
 
   static void SetMemoryInfoForTest(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1) {
       FATAL("Internal error: setMemoryInfoForTest(value).");
     }
-    backend_runner_->data()->SetMemoryInfo(args[0]);
+    backend_runner_->data()->SetMemoryInfo(info[0]);
   }
 
   static void SchedulePauseOnNextStatement(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsInt32() || !args[1]->IsString() ||
-        !args[2]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 3 || !info[0]->IsInt32() || !info[1]->IsString() ||
+        !info[2]->IsString()) {
       FATAL(
           "Internal error: schedulePauseOnNextStatement(context_group_id, "
           "'reason', 'details').");
     }
     std::vector<uint16_t> reason =
-        ToVector(args.GetIsolate(), args[1].As<v8::String>());
+        ToVector(info.GetIsolate(), info[1].As<v8::String>());
     std::vector<uint16_t> details =
-        ToVector(args.GetIsolate(), args[2].As<v8::String>());
-    int context_group_id = args[0].As<v8::Int32>()->Value();
+        ToVector(info.GetIsolate(), info[2].As<v8::String>());
+    int context_group_id = info[0].As<v8::Int32>()->Value();
     RunSyncTask(backend_runner_,
                 [&context_group_id, &reason,
                  &details](InspectorIsolateData* data) {
@@ -266,52 +262,52 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void CancelPauseOnNextStatement(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       FATAL("Internal error: cancelPauseOnNextStatement(context_group_id).");
     }
-    int context_group_id = args[0].As<v8::Int32>()->Value();
+    int context_group_id = info[0].As<v8::Int32>()->Value();
     RunSyncTask(backend_runner_,
                 [&context_group_id](InspectorIsolateData* data) {
                   data->CancelPauseOnNextStatement(context_group_id);
                 });
   }
 
-  static void Stop(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+  static void Stop(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       FATAL("Internal error: stop(session_id).");
     }
-    int session_id = args[0].As<v8::Int32>()->Value();
+    int session_id = info[0].As<v8::Int32>()->Value();
     RunSyncTask(backend_runner_, [&session_id](InspectorIsolateData* data) {
       data->Stop(session_id);
     });
   }
 
   static void SetLogConsoleApiMessageCalls(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsBoolean()) {
       FATAL("Internal error: setLogConsoleApiMessageCalls(bool).");
     }
     backend_runner_->data()->SetLogConsoleApiMessageCalls(
-        args[0].As<v8::Boolean>()->Value());
+        info[0].As<v8::Boolean>()->Value());
   }
 
   static void SetLogMaxAsyncCallStackDepthChanged(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsBoolean()) {
       FATAL("Internal error: setLogMaxAsyncCallStackDepthChanged(bool).");
     }
     backend_runner_->data()->SetLogMaxAsyncCallStackDepthChanged(
-        args[0].As<v8::Boolean>()->Value());
+        info[0].As<v8::Boolean>()->Value());
   }
 
   static void SetAdditionalConsoleApi(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsString()) {
       FATAL("Internal error: SetAdditionalConsoleApi(string).");
     }
     std::vector<uint16_t> script =
-        ToVector(args.GetIsolate(), args[0].As<v8::String>());
+        ToVector(info.GetIsolate(), info[0].As<v8::String>());
     RunSyncTask(backend_runner_, [&script](InspectorIsolateData* data) {
       data->SetAdditionalConsoleApi(
           v8_inspector::StringView(script.data(), script.size()));
@@ -319,8 +315,8 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void CreateContextGroup(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 0) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 0) {
       FATAL("Internal error: createContextGroup().");
     }
     int context_group_id = 0;
@@ -328,17 +324,17 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
                 [&context_group_id](InspectorIsolateData* data) {
                   context_group_id = data->CreateContextGroup();
                 });
-    args.GetReturnValue().Set(
-        v8::Int32::New(args.GetIsolate(), context_group_id));
+    info.GetReturnValue().Set(
+        v8::Int32::New(info.GetIsolate(), context_group_id));
   }
 
-  static void CreateContext(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2) {
+  static void CreateContext(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 2) {
       FATAL("Internal error: createContext(context, name).");
     }
-    int context_group_id = args[0].As<v8::Int32>()->Value();
+    int context_group_id = info[0].As<v8::Int32>()->Value();
     std::vector<uint16_t> name =
-        ToVector(args.GetIsolate(), args[1].As<v8::String>());
+        ToVector(info.GetIsolate(), info[1].As<v8::String>());
 
     RunSyncTask(backend_runner_, [&context_group_id,
                                   name](InspectorIsolateData* data) {
@@ -349,94 +345,107 @@ class UtilsExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void ResetContextGroup(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       FATAL("Internal error: resetContextGroup(context_group_id).");
     }
-    int context_group_id = args[0].As<v8::Int32>()->Value();
+    int context_group_id = info[0].As<v8::Int32>()->Value();
     RunSyncTask(backend_runner_,
                 [&context_group_id](InspectorIsolateData* data) {
                   data->ResetContextGroup(context_group_id);
                 });
   }
 
-  static void ConnectSession(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsInt32() || !args[1]->IsString() ||
-        !args[2]->IsFunction()) {
+  static bool IsValidConnectSessionArgs(
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() < 3 || info.Length() > 4) return false;
+    if (!info[0]->IsInt32() || !info[1]->IsString() || !info[2]->IsFunction()) {
+      return false;
+    }
+    return info.Length() == 3 || info[3]->IsBoolean();
+  }
+
+  static void ConnectSession(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (!IsValidConnectSessionArgs(info)) {
       FATAL(
           "Internal error: connectionSession(context_group_id, state, "
-          "dispatch).");
+          "dispatch, is_fully_trusted).");
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
-    FrontendChannelImpl* channel = new FrontendChannelImpl(
-        InspectorIsolateData::FromContext(context)->task_runner(),
-        InspectorIsolateData::FromContext(context)->GetContextGroupId(context),
-        args.GetIsolate(), args[2].As<v8::Function>());
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
+    std::unique_ptr<FrontendChannelImpl> channel =
+        std::make_unique<FrontendChannelImpl>(
+            InspectorIsolateData::FromContext(context)->task_runner(),
+            InspectorIsolateData::FromContext(context)->GetContextGroupId(
+                context),
+            info.GetIsolate(), info[2].As<v8::Function>());
 
     std::vector<uint8_t> state =
-        ToBytes(args.GetIsolate(), args[1].As<v8::String>());
-    int context_group_id = args[0].As<v8::Int32>()->Value();
-    int session_id = 0;
-    RunSyncTask(backend_runner_, [&context_group_id, &session_id, &channel,
-                                  &state](InspectorIsolateData* data) {
-      session_id = data->ConnectSession(
-          context_group_id,
-          v8_inspector::StringView(state.data(), state.size()), channel);
-      channel->set_session_id(session_id);
-    });
+        ToBytes(info.GetIsolate(), info[1].As<v8::String>());
+    int context_group_id = info[0].As<v8::Int32>()->Value();
+    bool is_fully_trusted =
+        info.Length() == 3 || info[3].As<v8::Boolean>()->Value();
+    base::Optional<int> session_id;
+    RunSyncTask(backend_runner_,
+                [context_group_id, &session_id, &channel, &state,
+                 is_fully_trusted](InspectorIsolateData* data) {
+                  session_id = data->ConnectSession(
+                      context_group_id,
+                      v8_inspector::StringView(state.data(), state.size()),
+                      std::move(channel), is_fully_trusted);
+                });
 
-    channels_[session_id].reset(channel);
-    args.GetReturnValue().Set(v8::Int32::New(args.GetIsolate(), session_id));
+    CHECK(session_id.has_value());
+    info.GetReturnValue().Set(v8::Int32::New(info.GetIsolate(), *session_id));
   }
 
   static void DisconnectSession(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       FATAL("Internal error: disconnectionSession(session_id).");
     }
-    int session_id = args[0].As<v8::Int32>()->Value();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
+    TaskRunner* context_task_runner =
+        InspectorIsolateData::FromContext(context)->task_runner();
+    int session_id = info[0].As<v8::Int32>()->Value();
     std::vector<uint8_t> state;
-    RunSyncTask(backend_runner_,
-                [&session_id, &state](InspectorIsolateData* data) {
-                  state = data->DisconnectSession(session_id);
-                });
-    channels_.erase(session_id);
-    args.GetReturnValue().Set(ToV8String(args.GetIsolate(), state));
+    RunSyncTask(backend_runner_, [&session_id, &context_task_runner,
+                                  &state](InspectorIsolateData* data) {
+      state = data->DisconnectSession(session_id, context_task_runner);
+    });
+
+    info.GetReturnValue().Set(ToV8String(info.GetIsolate(), state));
   }
 
   static void SendMessageToBackend(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsInt32() || !args[1]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 2 || !info[0]->IsInt32() || !info[1]->IsString()) {
       FATAL("Internal error: sendMessageToBackend(session_id, message).");
     }
     backend_runner_->Append(std::make_unique<SendMessageToBackendTask>(
-        args[0].As<v8::Int32>()->Value(),
-        ToVector(args.GetIsolate(), args[1].As<v8::String>())));
+        info[0].As<v8::Int32>()->Value(),
+        ToVector(info.GetIsolate(), info[1].As<v8::String>())));
   }
 
   static void InterruptForMessages(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
     backend_runner_->InterruptForMessages();
   }
 
-  static void WaitForDebugger(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsInt32() || !args[1]->IsFunction()) {
+  static void WaitForDebugger(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 2 || !info[0]->IsInt32() || !info[1]->IsFunction()) {
       FATAL("Internal error: waitForDebugger(context_group_id, callback).");
     }
-    int context_group_id = args[0].As<v8::Int32>()->Value();
+    int context_group_id = info[0].As<v8::Int32>()->Value();
     RunSimpleAsyncTask(
         backend_runner_,
         [context_group_id](InspectorIsolateData* data) {
           data->WaitForDebugger(context_group_id);
         },
-        args[1].As<v8::Function>());
+        info[1].As<v8::Function>());
   }
-
-  static std::map<int, std::unique_ptr<FrontendChannelImpl>> channels_;
 };
 
 TaskRunner* UtilsExtension::backend_runner_ = nullptr;
-std::map<int, std::unique_ptr<FrontendChannelImpl>> UtilsExtension::channels_;
 
 bool StrictAccessCheck(v8::Local<v8::Context> accessing_context,
                        v8::Local<v8::Object> accessed_object,
@@ -548,113 +557,113 @@ class InspectorExtension : public InspectorIsolateData::SetupGlobalTask {
 
  private:
   static void FireContextCreated(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     data->FireContextCreated(context, data->GetContextGroupId(context),
                              v8_inspector::StringView());
   }
 
   static void FireContextDestroyed(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     data->FireContextDestroyed(context);
   }
 
-  static void FreeContext(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+  static void FreeContext(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     data->FreeContext(context);
   }
 
   static void AddInspectedObject(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 2 || !info[0]->IsInt32()) {
       FATAL("Internal error: addInspectedObject(session_id, object).");
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
-    data->AddInspectedObject(args[0].As<v8::Int32>()->Value(), args[1]);
+    data->AddInspectedObject(info[0].As<v8::Int32>()->Value(), info[1]);
   }
 
   static void SetMaxAsyncTaskStacks(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsInt32()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsInt32()) {
       FATAL("Internal error: setMaxAsyncTaskStacks(max).");
     }
-    InspectorIsolateData::FromContext(args.GetIsolate()->GetCurrentContext())
-        ->SetMaxAsyncTaskStacksForTest(args[0].As<v8::Int32>()->Value());
+    InspectorIsolateData::FromContext(info.GetIsolate()->GetCurrentContext())
+        ->SetMaxAsyncTaskStacksForTest(info[0].As<v8::Int32>()->Value());
   }
 
   static void DumpAsyncTaskStacksStateForTest(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 0) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 0) {
       FATAL("Internal error: dumpAsyncTaskStacksStateForTest().");
     }
-    InspectorIsolateData::FromContext(args.GetIsolate()->GetCurrentContext())
+    InspectorIsolateData::FromContext(info.GetIsolate()->GetCurrentContext())
         ->DumpAsyncTaskStacksStateForTest();
   }
 
-  static void BreakProgram(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsString() || !args[1]->IsString()) {
+  static void BreakProgram(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 2 || !info[0]->IsString() || !info[1]->IsString()) {
       FATAL("Internal error: breakProgram('reason', 'details').");
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     std::vector<uint16_t> reason =
-        ToVector(args.GetIsolate(), args[0].As<v8::String>());
+        ToVector(info.GetIsolate(), info[0].As<v8::String>());
     v8_inspector::StringView reason_view(reason.data(), reason.size());
     std::vector<uint16_t> details =
-        ToVector(args.GetIsolate(), args[1].As<v8::String>());
+        ToVector(info.GetIsolate(), info[1].As<v8::String>());
     v8_inspector::StringView details_view(details.data(), details.size());
     data->BreakProgram(data->GetContextGroupId(context), reason_view,
                        details_view);
   }
 
   static void CreateObjectWithStrictCheck(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 0) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 0) {
       FATAL("Internal error: createObjectWithStrictCheck().");
     }
     v8::Local<v8::ObjectTemplate> templ =
-        v8::ObjectTemplate::New(args.GetIsolate());
+        v8::ObjectTemplate::New(info.GetIsolate());
     templ->SetAccessCheckCallback(&StrictAccessCheck);
-    args.GetReturnValue().Set(
-        templ->NewInstance(args.GetIsolate()->GetCurrentContext())
+    info.GetReturnValue().Set(
+        templ->NewInstance(info.GetIsolate()->GetCurrentContext())
             .ToLocalChecked());
   }
 
   static void CallWithScheduledBreak(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsFunction() || !args[1]->IsString() ||
-        !args[2]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 3 || !info[0]->IsFunction() || !info[1]->IsString() ||
+        !info[2]->IsString()) {
       FATAL("Internal error: callWithScheduledBreak('reason', 'details').");
     }
     std::vector<uint16_t> reason =
-        ToVector(args.GetIsolate(), args[1].As<v8::String>());
+        ToVector(info.GetIsolate(), info[1].As<v8::String>());
     v8_inspector::StringView reason_view(reason.data(), reason.size());
     std::vector<uint16_t> details =
-        ToVector(args.GetIsolate(), args[2].As<v8::String>());
+        ToVector(info.GetIsolate(), info[2].As<v8::String>());
     v8_inspector::StringView details_view(details.data(), details.size());
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     int context_group_id = data->GetContextGroupId(context);
     data->SchedulePauseOnNextStatement(context_group_id, reason_view,
                                        details_view);
     v8::MaybeLocal<v8::Value> result;
-    result = args[0].As<v8::Function>()->Call(context, context->Global(), 0,
+    result = info[0].As<v8::Function>()->Call(context, context->Global(), 0,
                                               nullptr);
     data->CancelPauseOnNextStatement(context_group_id);
   }
 
   static void MarkObjectAsNotInspectable(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsObject()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsObject()) {
       FATAL("Internal error: markObjectAsNotInspectable(object).");
     }
-    v8::Local<v8::Object> object = args[0].As<v8::Object>();
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Local<v8::Object> object = info[0].As<v8::Object>();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Private> notInspectablePrivate =
         v8::Private::ForApi(isolate, ToV8String(isolate, "notInspectable"));
     object
@@ -664,21 +673,21 @@ class InspectorExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void CreateObjectWithAccessor(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[0]->IsString() || !args[1]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 2 || !info[0]->IsString() || !info[1]->IsBoolean()) {
       FATAL(
           "Internal error: createObjectWithAccessor('accessor name', "
           "hasSetter)\n");
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::ObjectTemplate> templ = v8::ObjectTemplate::New(isolate);
-    if (args[1].As<v8::Boolean>()->Value()) {
-      templ->SetAccessor(v8::Local<v8::String>::Cast(args[0]), AccessorGetter,
+    if (info[1].As<v8::Boolean>()->Value()) {
+      templ->SetAccessor(v8::Local<v8::String>::Cast(info[0]), AccessorGetter,
                          AccessorSetter);
     } else {
-      templ->SetAccessor(v8::Local<v8::String>::Cast(args[0]), AccessorGetter);
+      templ->SetAccessor(v8::Local<v8::String>::Cast(info[0]), AccessorGetter);
     }
-    args.GetReturnValue().Set(
+    info.GetReturnValue().Set(
         templ->NewInstance(isolate->GetCurrentContext()).ToLocalChecked());
   }
 
@@ -696,15 +705,15 @@ class InspectorExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
   static void StoreCurrentStackTrace(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsString()) {
       FATAL("Internal error: storeCurrentStackTrace('description')\n");
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     std::vector<uint16_t> description =
-        ToVector(isolate, args[0].As<v8::String>());
+        ToVector(isolate, info[0].As<v8::String>());
     v8_inspector::StringView description_view(description.data(),
                                               description.size());
     v8_inspector::V8StackTraceId id =
@@ -713,116 +722,116 @@ class InspectorExtension : public InspectorIsolateData::SetupGlobalTask {
         v8::ArrayBuffer::New(isolate, sizeof(id));
     *static_cast<v8_inspector::V8StackTraceId*>(
         buffer->GetBackingStore()->Data()) = id;
-    args.GetReturnValue().Set(buffer);
+    info.GetReturnValue().Set(buffer);
   }
 
   static void ExternalAsyncTaskStarted(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsArrayBuffer()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsArrayBuffer()) {
       FATAL("Internal error: externalAsyncTaskStarted(id)\n");
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     v8_inspector::V8StackTraceId* id =
         static_cast<v8_inspector::V8StackTraceId*>(
-            args[0].As<v8::ArrayBuffer>()->GetBackingStore()->Data());
+            info[0].As<v8::ArrayBuffer>()->GetBackingStore()->Data());
     data->ExternalAsyncTaskStarted(*id);
   }
 
   static void ExternalAsyncTaskFinished(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsArrayBuffer()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsArrayBuffer()) {
       FATAL("Internal error: externalAsyncTaskFinished(id)\n");
     }
-    v8::Local<v8::Context> context = args.GetIsolate()->GetCurrentContext();
+    v8::Local<v8::Context> context = info.GetIsolate()->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     v8_inspector::V8StackTraceId* id =
         static_cast<v8_inspector::V8StackTraceId*>(
-            args[0].As<v8::ArrayBuffer>()->GetBackingStore()->Data());
+            info[0].As<v8::ArrayBuffer>()->GetBackingStore()->Data());
     data->ExternalAsyncTaskFinished(*id);
   }
 
   static void ScheduleWithAsyncStack(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsFunction() || !args[1]->IsString() ||
-        !args[2]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 3 || !info[0]->IsFunction() || !info[1]->IsString() ||
+        !info[2]->IsBoolean()) {
       FATAL(
           "Internal error: scheduleWithAsyncStack(function, 'task-name', "
           "with_empty_stack).");
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     int context_group_id = data->GetContextGroupId(context);
-    bool with_empty_stack = args[2].As<v8::Boolean>()->Value();
+    bool with_empty_stack = info[2].As<v8::Boolean>()->Value();
     if (with_empty_stack) context->Exit();
 
     std::vector<uint16_t> task_name =
-        ToVector(isolate, args[1].As<v8::String>());
+        ToVector(isolate, info[1].As<v8::String>());
     v8_inspector::StringView task_name_view(task_name.data(), task_name.size());
 
     RunAsyncTask(
         data->task_runner(), task_name_view,
         std::make_unique<SetTimeoutTask>(
-            context_group_id, isolate, v8::Local<v8::Function>::Cast(args[0])));
+            context_group_id, isolate, v8::Local<v8::Function>::Cast(info[0])));
     if (with_empty_stack) context->Enter();
   }
 
   static void SetAllowCodeGenerationFromStrings(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsBoolean()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsBoolean()) {
       FATAL("Internal error: setAllowCodeGenerationFromStrings(allow).");
     }
-    args.GetIsolate()->GetCurrentContext()->AllowCodeGenerationFromStrings(
-        args[0].As<v8::Boolean>()->Value());
+    info.GetIsolate()->GetCurrentContext()->AllowCodeGenerationFromStrings(
+        info[0].As<v8::Boolean>()->Value());
   }
   static void SetResourceNamePrefix(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsString()) {
       FATAL("Internal error: setResourceNamePrefix('prefix').");
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
-    data->SetResourceNamePrefix(v8::Local<v8::String>::Cast(args[0]));
+    data->SetResourceNamePrefix(v8::Local<v8::String>::Cast(info[0]));
   }
 
   static void newExceptionWithMetaData(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 3 || !args[0]->IsString() || !args[1]->IsString() ||
-        !args[2]->IsString()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 3 || !info[0]->IsString() || !info[1]->IsString() ||
+        !info[2]->IsString()) {
       FATAL(
           "Internal error: newExceptionWithMetaData('message', 'key', "
           "'value').");
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
 
-    auto error = v8::Exception::Error(args[0].As<v8::String>());
-    CHECK(data->AssociateExceptionData(error, args[1].As<v8::String>(),
-                                       args[2].As<v8::String>()));
-    args.GetReturnValue().Set(error);
+    auto error = v8::Exception::Error(info[0].As<v8::String>());
+    CHECK(data->AssociateExceptionData(error, info[1].As<v8::String>(),
+                                       info[2].As<v8::String>()));
+    info.GetReturnValue().Set(error);
   }
 
   static void CallbackForTests(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 1 || !args[0]->IsFunction()) {
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 1 || !info[0]->IsFunction()) {
       FATAL("Internal error: callbackForTests(function).");
     }
 
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
 
-    v8::Local<v8::Function> callback = v8::Local<v8::Function>::Cast(args[0]);
+    v8::Local<v8::Function> callback = v8::Local<v8::Function>::Cast(info[0]);
     v8::MaybeLocal<v8::Value> result =
         callback->Call(context, v8::Undefined(isolate), 0, nullptr);
-    args.GetReturnValue().Set(result.ToLocalChecked());
+    info.GetReturnValue().Set(result.ToLocalChecked());
   }
 
   static void RunNestedMessageLoop(
-      const v8::FunctionCallbackInfo<v8::Value>& args) {
-    v8::Isolate* isolate = args.GetIsolate();
+      const v8::FunctionCallbackInfo<v8::Value>& info) {
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
 
@@ -847,8 +856,8 @@ int InspectorTestMain(int argc, char* argv[]) {
     if (strcmp(argv[i], "--embed") == 0) {
       argv[i++] = nullptr;
       printf("Embedding script '%s'\n", argv[i]);
-      startup_data = i::CreateSnapshotDataBlobInternal(
-          SnapshotCreator::FunctionCodeHandling::kClear, argv[i], nullptr);
+      startup_data = i::CreateSnapshotDataBlobInternalForInspectorTest(
+          SnapshotCreator::FunctionCodeHandling::kClear, argv[i]);
       argv[i] = nullptr;
     }
   }
@@ -898,7 +907,6 @@ int InspectorTestMain(int argc, char* argv[]) {
     frontend_runner.Join();
     backend_runner.Join();
 
-    UtilsExtension::ClearAllSessions();
     delete[] startup_data.data;
 
     // TaskRunners go out of scope here, which causes Isolate teardown and all
diff --git a/deps/v8/test/inspector/inspector.status b/deps/v8/test/inspector/inspector.status
index b8bc9e2600e610..282da51b9ee391 100644
--- a/deps/v8/test/inspector/inspector.status
+++ b/deps/v8/test/inspector/inspector.status
@@ -8,6 +8,9 @@
   # https://crbug.com/v8/7932
   'runtime/command-line-api-without-side-effects': [SKIP],
 
+  # https://crbug.com/v8/13851
+  'debugger/pause-on-oom': [SKIP],
+
   # Require optimization, so can't be run on Lite mode.
   'cpu-profiler/coverage-block': [PASS, ['lite_mode == True', SKIP]],
   'cpu-profiler/coverage': [PASS, ['lite_mode == True', SKIP]],
@@ -88,10 +91,10 @@
 
 ##############################################################################
 ['arch == s390x or arch == ppc64', {
-  # Need simd support on Liftoff
-  'debugger/wasm-scope-info': [SKIP],
+  # Need to fix loading of DebugBreak registers
   'debugger/wasm-inspect-many-registers': [SKIP],
   # endian related issue
+  'debugger/wasm-scope-info': [SKIP],
   'debugger/wasm-conditional-breakpoints': [SKIP],
   'debugger/wasm-evaluate-on-call-frame': [SKIP],
   'debugger/wasm-set-breakpoint': [SKIP],
@@ -191,6 +194,9 @@
 
   # Skip tests that might fail with concurrent allocation
   'debugger/pause-on-oom-wide': [SKIP],
+
+  # TODO(v8:12612): This test may fail on builds with MinorMS because incremental marking prevents getting any minor GCs.
+  'heap-profiler/sampling-heap-profiler-flags': [PASS, ['mode == debug or tsan', SKIP]],
 }], # stress_concurrent_allocation
 
 ##############################################################################
@@ -200,6 +206,12 @@
   'runtime/evaluate-async': [SKIP],
 }], # asan == True
 
+##############################################################################
+['full_debug', {
+  # Tests too slow in non-optimized debug mode.
+  'runtime/console-messages-limits': [SKIP],
+}],  # 'full_debug'
+
 ################################################################################
 ['third_party_heap', {
   # Requires a second isolate
@@ -527,9 +539,9 @@
 }],  # tsan and not concurrent_marking
 
 ##############################################################################
-['no_i18n == True', {
+['not i18n', {
   'runtime/evaluate-without-side-effects-i18n': [SKIP],
-}],  # no_i18n == True
+}],  # not i18n
 
 ##############################################################################
 ['lite_mode or variant in (nooptimization, jitless, assert_types)', {
diff --git a/deps/v8/test/inspector/isolate-data.cc b/deps/v8/test/inspector/isolate-data.cc
index 764af630465a07..3c6c9babe5d30e 100644
--- a/deps/v8/test/inspector/isolate-data.cc
+++ b/deps/v8/test/inspector/isolate-data.cc
@@ -10,6 +10,7 @@
 #include "include/v8-template.h"
 #include "src/init/v8.h"
 #include "src/inspector/test-interface.h"
+#include "test/inspector/frontend-channel.h"
 #include "test/inspector/task-runner.h"
 #include "test/inspector/utils.h"
 
@@ -55,6 +56,7 @@ InspectorIsolateData::InspectorIsolateData(
   params.snapshot_blob = startup_data;
   params.only_terminate_in_safe_scope = true;
   isolate_.reset(v8::Isolate::New(params));
+  v8::Isolate::Scope isolate_scope(isolate_.get());
   isolate_->SetMicrotasksPolicy(v8::MicrotasksPolicy::kScoped);
   if (with_inspector) {
     isolate_->AddMessageListener(&InspectorIsolateData::MessageHandler);
@@ -62,7 +64,6 @@ InspectorIsolateData::InspectorIsolateData(
         &InspectorIsolateData::PromiseRejectHandler);
     inspector_ = v8_inspector::V8Inspector::create(isolate_.get(), this);
   }
-  v8::Isolate::Scope isolate_scope(isolate_.get());
   v8::HandleScope handle_scope(isolate_.get());
   not_inspectable_private_.Reset(
       isolate_.get(),
@@ -77,6 +78,30 @@ InspectorIsolateData* InspectorIsolateData::FromContext(
       context->GetAlignedPointerFromEmbedderData(kIsolateDataIndex));
 }
 
+InspectorIsolateData::~InspectorIsolateData() {
+  // Enter the isolate before destructing this InspectorIsolateData, so that
+  // destructors that run before the Isolate's destructor still see it as
+  // entered. Use a v8::Locker, in case the thread destroying the isolate is
+  // not the last one that entered it.
+  locker_.emplace(isolate());
+  isolate()->Enter();
+
+  // Sessions need to be deleted before channels can be cleaned up, and channels
+  // must be deleted before the isolate gets cleaned up. This means we first
+  // clean up all the sessions and immedatly after all the channels used by
+  // those sessions.
+  for (const auto& pair : sessions_) {
+    session_ids_for_cleanup_.insert(pair.first);
+  }
+
+  context_group_by_session_.clear();
+  sessions_.clear();
+
+  for (int session_id : session_ids_for_cleanup_) {
+    ChannelHolder::RemoveChannel(session_id);
+  }
+}
+
 int InspectorIsolateData::CreateContextGroup() {
   int context_group_id = ++last_context_group_id_;
   if (!CreateContext(context_group_id, v8_inspector::StringView())) {
@@ -159,14 +184,21 @@ v8::MaybeLocal<v8::Module> InspectorIsolateData::ModuleResolveCallback(
   return maybe_module;
 }
 
-int InspectorIsolateData::ConnectSession(
+base::Optional<int> InspectorIsolateData::ConnectSession(
     int context_group_id, const v8_inspector::StringView& state,
-    v8_inspector::V8Inspector::Channel* channel) {
+    std::unique_ptr<FrontendChannelImpl> channel, bool is_fully_trusted) {
+  if (contexts_.find(context_group_id) == contexts_.end()) return base::nullopt;
+
   v8::SealHandleScope seal_handle_scope(isolate());
   int session_id = ++last_session_id_;
+  // It's important that we register the channel before the `connect` as the
+  // inspector will already send notifications.
+  auto* c = channel.get();
+  ChannelHolder::AddChannel(session_id, std::move(channel));
   sessions_[session_id] = inspector_->connect(
-      context_group_id, channel, state,
-      v8_inspector::V8Inspector::kFullyTrusted,
+      context_group_id, c, state,
+      is_fully_trusted ? v8_inspector::V8Inspector::kFullyTrusted
+                       : v8_inspector::V8Inspector::kUntrusted,
       waiting_for_debugger_
           ? v8_inspector::V8Inspector::kWaitingForDebugger
           : v8_inspector::V8Inspector::kNotWaitingForDebugger);
@@ -174,13 +206,43 @@ int InspectorIsolateData::ConnectSession(
   return session_id;
 }
 
-std::vector<uint8_t> InspectorIsolateData::DisconnectSession(int session_id) {
+namespace {
+
+class RemoveChannelTask : public TaskRunner::Task {
+ public:
+  explicit RemoveChannelTask(int session_id) : session_id_(session_id) {}
+  ~RemoveChannelTask() override = default;
+  bool is_priority_task() final { return false; }
+
+ private:
+  void Run(InspectorIsolateData* data) override {
+    ChannelHolder::RemoveChannel(session_id_);
+  }
+  int session_id_;
+};
+
+}  // namespace
+
+std::vector<uint8_t> InspectorIsolateData::DisconnectSession(
+    int session_id, TaskRunner* context_task_runner) {
   v8::SealHandleScope seal_handle_scope(isolate());
   auto it = sessions_.find(session_id);
   CHECK(it != sessions_.end());
   context_group_by_session_.erase(it->second.get());
   std::vector<uint8_t> result = it->second->state();
   sessions_.erase(it);
+
+  // The InspectorSession destructor does cleanup work like disabling agents.
+  // This could send some more notifications. We'll delay removing the channel
+  // so notification tasks have time to get sent.
+  // Note: This only works for tasks scheduled immediately by the desctructor.
+  //       Any task scheduled in turn by one of the "cleanup tasks" will run
+  //       AFTER the channel was removed.
+  context_task_runner->Append(std::make_unique<RemoveChannelTask>(session_id));
+
+  // In case we shutdown the test runner before the above task can run, we
+  // let the desctructor clean up the channel.
+  session_ids_for_cleanup_.insert(session_id);
   return result;
 }
 
@@ -560,5 +622,27 @@ int64_t InspectorIsolateData::generateUniqueId() {
   return ++last_unique_id;
 }
 
+// static
+void ChannelHolder::AddChannel(int session_id,
+                               std::unique_ptr<FrontendChannelImpl> channel) {
+  CHECK_NE(channel.get(), nullptr);
+  channel->set_session_id(session_id);
+  channels_[session_id] = std::move(channel);
+}
+
+// static
+FrontendChannelImpl* ChannelHolder::GetChannel(int session_id) {
+  auto it = channels_.find(session_id);
+  return it != channels_.end() ? it->second.get() : nullptr;
+}
+
+// static
+void ChannelHolder::RemoveChannel(int session_id) {
+  channels_.erase(session_id);
+}
+
+// static
+std::map<int, std::unique_ptr<FrontendChannelImpl>> ChannelHolder::channels_;
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/inspector/isolate-data.h b/deps/v8/test/inspector/isolate-data.h
index 7a953e6b3f8af8..cc8e55d9b37d9c 100644
--- a/deps/v8/test/inspector/isolate-data.h
+++ b/deps/v8/test/inspector/isolate-data.h
@@ -7,6 +7,7 @@
 
 #include <map>
 #include <memory>
+#include <set>
 
 #include "include/v8-array-buffer.h"
 #include "include/v8-inspector.h"
@@ -24,6 +25,7 @@ class StartupData;
 
 namespace internal {
 
+class FrontendChannelImpl;
 class TaskRunner;
 
 enum WithInspector : bool { kWithInspector = true, kNoInspector = false };
@@ -46,14 +48,7 @@ class InspectorIsolateData : public v8_inspector::V8InspectorClient {
                        WithInspector with_inspector);
   static InspectorIsolateData* FromContext(v8::Local<v8::Context> context);
 
-  ~InspectorIsolateData() override {
-    // Enter the isolate before destructing this InspectorIsolateData, so that
-    // destructors that run before the Isolate's destructor still see it as
-    // entered. Use a v8::Locker, in case the thread destroying the isolate is
-    // not the last one that entered it.
-    locker_.emplace(isolate());
-    isolate()->Enter();
-  }
+  ~InspectorIsolateData() override;
 
   v8::Isolate* isolate() const { return isolate_.get(); }
   TaskRunner* task_runner() const { return task_runner_; }
@@ -70,10 +65,11 @@ class InspectorIsolateData : public v8_inspector::V8InspectorClient {
                       v8::ScriptCompiler::Source* source);
 
   // Working with V8Inspector api.
-  int ConnectSession(int context_group_id,
-                     const v8_inspector::StringView& state,
-                     v8_inspector::V8Inspector::Channel* channel);
-  std::vector<uint8_t> DisconnectSession(int session_id);
+  base::Optional<int> ConnectSession(
+      int context_group_id, const v8_inspector::StringView& state,
+      std::unique_ptr<FrontendChannelImpl> channel, bool is_fully_trusted);
+  std::vector<uint8_t> DisconnectSession(int session_id,
+                                         TaskRunner* context_task_runner);
   void SendMessage(int session_id, const v8_inspector::StringView& message);
   void BreakProgram(int context_group_id,
                     const v8_inspector::StringView& reason,
@@ -174,6 +170,7 @@ class InspectorIsolateData : public v8_inspector::V8InspectorClient {
   int last_session_id_ = 0;
   std::map<int, std::unique_ptr<v8_inspector::V8InspectorSession>> sessions_;
   std::map<v8_inspector::V8InspectorSession*, int> context_group_by_session_;
+  std::set<int> session_ids_for_cleanup_;
   v8::Global<v8::Value> memory_info_;
   bool current_time_set_ = false;
   double current_time_ = 0.0;
@@ -185,6 +182,24 @@ class InspectorIsolateData : public v8_inspector::V8InspectorClient {
   v8::Global<v8::String> additional_console_api_;
 };
 
+// Stores all the channels.
+//
+// `InspectorIsolateData` is per isolate and a channel connects
+// the backend Isolate with the frontend Isolate. The backend registers and
+// sets up the isolate, but the frontend needs it to send responses and
+// notifications. This is why we use a separate "class" (just a static wrapper
+// around std::map).
+class ChannelHolder {
+ public:
+  static void AddChannel(int session_id,
+                         std::unique_ptr<FrontendChannelImpl> channel);
+  static FrontendChannelImpl* GetChannel(int session_id);
+  static void RemoveChannel(int session_id);
+
+ private:
+  static std::map<int, std::unique_ptr<FrontendChannelImpl>> channels_;
+};
+
 }  // namespace internal
 }  // namespace v8
 
diff --git a/deps/v8/test/inspector/protocol-test.js b/deps/v8/test/inspector/protocol-test.js
index a5e9505b82075b..cf6b497caa6809 100644
--- a/deps/v8/test/inspector/protocol-test.js
+++ b/deps/v8/test/inspector/protocol-test.js
@@ -179,8 +179,8 @@ InspectorTest.ContextGroup = class {
     this.addScript(utils.read(fileName));
   }
 
-  connect() {
-    return new InspectorTest.Session(this);
+  connect(isFullyTrusted = true) {
+    return new InspectorTest.Session(this, Boolean(isFullyTrusted));
   }
 
   reset() {
@@ -234,14 +234,15 @@ InspectorTest.ContextGroup = class {
 };
 
 InspectorTest.Session = class {
-  constructor(contextGroup) {
+  constructor(contextGroup, isFullyTrusted) {
     this.contextGroup = contextGroup;
     this._dispatchTable = new Map();
     this._eventHandlers = new Map();
     this._requestId = 0;
+    this._isFullyTrusted = isFullyTrusted;
     this.Protocol = this._setupProtocol();
     InspectorTest._sessions.add(this);
-    this.id = utils.connectSession(contextGroup.id, '', this._dispatchMessage.bind(this));
+    this.id = utils.connectSession(contextGroup.id, '', this._dispatchMessage.bind(this), isFullyTrusted);
   }
 
   disconnect() {
@@ -251,7 +252,7 @@ InspectorTest.Session = class {
 
   reconnect() {
     var state = utils.disconnectSession(this.id);
-    this.id = utils.connectSession(this.contextGroup.id, state, this._dispatchMessage.bind(this));
+    this.id = utils.connectSession(this.contextGroup.id, state, this._dispatchMessage.bind(this), this._isFullyTrusted);
   }
 
   async addInspectedObject(serializable) {
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1366843-expected.txt b/deps/v8/test/inspector/regress/regress-crbug-1366843-expected.txt
deleted file mode 100644
index 9e3f2ec0294db9..00000000000000
--- a/deps/v8/test/inspector/regress/regress-crbug-1366843-expected.txt
+++ /dev/null
@@ -1 +0,0 @@
-Don't crash when injected script dies during Promise.then
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1366843.js b/deps/v8/test/inspector/regress/regress-crbug-1366843.js
deleted file mode 100644
index 0327a43e6172eb..00000000000000
--- a/deps/v8/test/inspector/regress/regress-crbug-1366843.js
+++ /dev/null
@@ -1,26 +0,0 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-const { Protocol, contextGroup } = InspectorTest.start('Don\'t crash when injected script dies during Promise.then');
-
-(async () => {
-  // Overwrite 'Promise#then' to block.
-  contextGroup.addScript(`
-    Object.prototype.__defineGetter__('then', function () {
-      inspector.runNestedMessageLoop(); // Doesn't return.
-    });
-  `);
-
-  // Trigger an evaluation that installs the inspector promise handler. Note
-  // that the expression is somewhat carefully crafted so we stop in the right
-  // micro task.
-  Protocol.Runtime.evaluate({
-    expression: `(() => ({ foo: 42 }))()`,
-    awaitPromise: true,
-  });
-
-  contextGroup.reset();
-
-  InspectorTest.completeTest();
-})();
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1431197-expected.txt b/deps/v8/test/inspector/regress/regress-crbug-1431197-expected.txt
new file mode 100644
index 00000000000000..4a111721406cfd
--- /dev/null
+++ b/deps/v8/test/inspector/regress/regress-crbug-1431197-expected.txt
@@ -0,0 +1,59 @@
+Test properties of TypedArrays backed with a resizable buffer
+{
+    result : {
+        className : Float64Array
+        description : Float64Array(3)
+        objectId : <objectId>
+        preview : {
+            description : Float64Array(3)
+            overflow : false
+            properties : [
+                [0] : {
+                    name : 0
+                    type : number
+                    value : 0
+                }
+                [1] : {
+                    name : 1
+                    type : number
+                    value : 0
+                }
+                [2] : {
+                    name : 2
+                    type : number
+                    value : 0
+                }
+                [3] : {
+                    name : buffer
+                    subtype : arraybuffer
+                    type : object
+                    value : ArrayBuffer(24)
+                }
+                [4] : {
+                    name : byteLength
+                    type : number
+                    value : 24
+                }
+                [5] : {
+                    name : byteOffset
+                    type : number
+                    value : 0
+                }
+                [6] : {
+                    name : length
+                    type : number
+                    value : 3
+                }
+                [7] : {
+                    name : Symbol(Symbol.toStringTag)
+                    type : string
+                    value : Float64Array
+                }
+            ]
+            subtype : typedarray
+            type : object
+        }
+        subtype : typedarray
+        type : object
+    }
+}
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1431197.js b/deps/v8/test/inspector/regress/regress-crbug-1431197.js
new file mode 100644
index 00000000000000..c90f98d52aee88
--- /dev/null
+++ b/deps/v8/test/inspector/regress/regress-crbug-1431197.js
@@ -0,0 +1,14 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const {Protocol} = InspectorTest.start('Test properties of TypedArrays backed with a resizable buffer');
+
+(async () => {
+  const { result } = await Protocol.Runtime.evaluate({
+    expression: "new Float64Array(new ArrayBuffer(24, { maxByteLength: 24 }))",
+    generatePreview: true,
+  });
+  InspectorTest.logMessage(result);
+  InspectorTest.completeTest();
+})();
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1433503-expected.txt b/deps/v8/test/inspector/regress/regress-crbug-1433503-expected.txt
new file mode 100644
index 00000000000000..44c1966d8b4774
--- /dev/null
+++ b/deps/v8/test/inspector/regress/regress-crbug-1433503-expected.txt
@@ -0,0 +1 @@
+Don't crash when disconnecting the session while message tasks are still in-flight.
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1433503.js b/deps/v8/test/inspector/regress/regress-crbug-1433503.js
new file mode 100644
index 00000000000000..ce47224d9743f1
--- /dev/null
+++ b/deps/v8/test/inspector/regress/regress-crbug-1433503.js
@@ -0,0 +1,10 @@
+// Copyright 2013 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const { session, Protocol } = InspectorTest.start('Don\'t crash when disconnecting the session while message tasks are still in-flight.');
+
+Protocol.Runtime.evaluate({ expression: '1+1' });
+session.reconnect();  // Reconnect the session while the respone for Runtime#evaluate is still pending.
+
+InspectorTest.completeTest();
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1469092-expected.txt b/deps/v8/test/inspector/regress/regress-crbug-1469092-expected.txt
new file mode 100644
index 00000000000000..310a2eb3e8232c
--- /dev/null
+++ b/deps/v8/test/inspector/regress/regress-crbug-1469092-expected.txt
@@ -0,0 +1 @@
+Don't crash when pausing in a untrusted session.
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1469092.js b/deps/v8/test/inspector/regress/regress-crbug-1469092.js
new file mode 100644
index 00000000000000..cb4737ceb0dbe5
--- /dev/null
+++ b/deps/v8/test/inspector/regress/regress-crbug-1469092.js
@@ -0,0 +1,19 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+InspectorTest.start('Don\'t crash when pausing in a untrusted session.');
+
+(async () => {
+  const contextGroup = new InspectorTest.ContextGroup();
+  const session = contextGroup.connect(/* isFullyTrusted */ false);
+  const { Protocol } = session;
+
+  await Protocol.Debugger.enable();
+
+  Protocol.Runtime.evaluate({ expression: 'debugger' });
+  await Protocol.Debugger.oncePaused();
+  await Protocol.Debugger.resume();
+
+  InspectorTest.completeTest();
+})();
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1474272-expected.txt b/deps/v8/test/inspector/regress/regress-crbug-1474272-expected.txt
new file mode 100644
index 00000000000000..06c985e515aefc
--- /dev/null
+++ b/deps/v8/test/inspector/regress/regress-crbug-1474272-expected.txt
@@ -0,0 +1,6 @@
+Don't crash when pausing in a strict function produced by eval.
+Evaluate f("test"):
+{
+    type : string
+    value : test
+}
diff --git a/deps/v8/test/inspector/regress/regress-crbug-1474272.js b/deps/v8/test/inspector/regress/regress-crbug-1474272.js
new file mode 100644
index 00000000000000..f268660ba1c32e
--- /dev/null
+++ b/deps/v8/test/inspector/regress/regress-crbug-1474272.js
@@ -0,0 +1,28 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const { session, Protocol, contextGroup } = InspectorTest.start('Don\'t crash when pausing in a strict function produced by eval.');
+
+contextGroup.addScript(`
+"use strict";
+var f = eval(\`
+  // Function with one parameter AND using 'arguments' requires context allocation
+  // in sloppy mode, but not strict mode.
+  (function(message) {
+    console.log(arguments.length);
+    debugger;
+  })\`);
+`);
+
+(async () => {
+  await Protocol.Debugger.enable();
+  Protocol.Runtime.evaluate({ expression: 'f("test")' });
+  const { params: { callFrames: [{callFrameId}] } } = await Protocol.Debugger.oncePaused();
+
+  const { result } = await Protocol.Debugger.evaluateOnCallFrame({ callFrameId, expression: 'message' });
+  InspectorTest.log('Evaluate f("test"):');
+  InspectorTest.logMessage(result.result);
+
+  InspectorTest.completeTest();
+})();
diff --git a/deps/v8/test/inspector/runtime/deep-serialization-local-references-expected.txt b/deps/v8/test/inspector/runtime/deep-serialization-local-references-expected.txt
new file mode 100644
index 00000000000000..12eabef6f5cedb
--- /dev/null
+++ b/deps/v8/test/inspector/runtime/deep-serialization-local-references-expected.txt
@@ -0,0 +1,1649 @@
+RemoteObject.deepSerializedValue
+
+Running test: PrimitiveValue
+testing expression: undefined
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : undefined
+        }
+        [1] : {
+            type : undefined
+        }
+        [2] : {
+            type : undefined
+        }
+        [3] : {
+            type : undefined
+        }
+        [4] : {
+            type : undefined
+        }
+        [5] : {
+            type : undefined
+        }
+    ]
+}
+testing expression: null
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : null
+        }
+        [1] : {
+            type : null
+        }
+        [2] : {
+            type : null
+        }
+        [3] : {
+            type : null
+        }
+        [4] : {
+            type : null
+        }
+        [5] : {
+            type : null
+        }
+    ]
+}
+testing expression: 'foo'
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : string
+            value : foo
+        }
+        [1] : {
+            type : string
+            value : foo
+        }
+        [2] : {
+            type : string
+            value : foo
+        }
+        [3] : {
+            type : string
+            value : foo
+        }
+        [4] : {
+            type : string
+            value : foo
+        }
+        [5] : {
+            type : string
+            value : foo
+        }
+    ]
+}
+testing expression: true
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : boolean
+            value : true
+        }
+        [1] : {
+            type : boolean
+            value : true
+        }
+        [2] : {
+            type : boolean
+            value : true
+        }
+        [3] : {
+            type : boolean
+            value : true
+        }
+        [4] : {
+            type : boolean
+            value : true
+        }
+        [5] : {
+            type : boolean
+            value : true
+        }
+    ]
+}
+testing expression: false
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : boolean
+            value : false
+        }
+        [1] : {
+            type : boolean
+            value : false
+        }
+        [2] : {
+            type : boolean
+            value : false
+        }
+        [3] : {
+            type : boolean
+            value : false
+        }
+        [4] : {
+            type : boolean
+            value : false
+        }
+        [5] : {
+            type : boolean
+            value : false
+        }
+    ]
+}
+
+Running test: Number
+testing expression: 123
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : 123
+        }
+        [1] : {
+            type : number
+            value : 123
+        }
+        [2] : {
+            type : number
+            value : 123
+        }
+        [3] : {
+            type : number
+            value : 123
+        }
+        [4] : {
+            type : number
+            value : 123
+        }
+        [5] : {
+            type : number
+            value : 123
+        }
+    ]
+}
+testing expression: 0.56
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : 0.56
+        }
+        [1] : {
+            type : number
+            value : 0.56
+        }
+        [2] : {
+            type : number
+            value : 0.56
+        }
+        [3] : {
+            type : number
+            value : 0.56
+        }
+        [4] : {
+            type : number
+            value : 0.56
+        }
+        [5] : {
+            type : number
+            value : 0.56
+        }
+    ]
+}
+testing expression: -0
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : -0
+        }
+        [1] : {
+            type : number
+            value : -0
+        }
+        [2] : {
+            type : number
+            value : -0
+        }
+        [3] : {
+            type : number
+            value : -0
+        }
+        [4] : {
+            type : number
+            value : -0
+        }
+        [5] : {
+            type : number
+            value : -0
+        }
+    ]
+}
+testing expression: +Infinity
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : Infinity
+        }
+        [1] : {
+            type : number
+            value : Infinity
+        }
+        [2] : {
+            type : number
+            value : Infinity
+        }
+        [3] : {
+            type : number
+            value : Infinity
+        }
+        [4] : {
+            type : number
+            value : Infinity
+        }
+        [5] : {
+            type : number
+            value : Infinity
+        }
+    ]
+}
+testing expression: -Infinity
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : -Infinity
+        }
+        [1] : {
+            type : number
+            value : -Infinity
+        }
+        [2] : {
+            type : number
+            value : -Infinity
+        }
+        [3] : {
+            type : number
+            value : -Infinity
+        }
+        [4] : {
+            type : number
+            value : -Infinity
+        }
+        [5] : {
+            type : number
+            value : -Infinity
+        }
+    ]
+}
+testing expression: NaN
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : NaN
+        }
+        [1] : {
+            type : number
+            value : NaN
+        }
+        [2] : {
+            type : number
+            value : NaN
+        }
+        [3] : {
+            type : number
+            value : NaN
+        }
+        [4] : {
+            type : number
+            value : NaN
+        }
+        [5] : {
+            type : number
+            value : NaN
+        }
+    ]
+}
+
+Running test: BigInt
+testing expression: 123n
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : bigint
+            value : 123
+        }
+        [1] : {
+            type : bigint
+            value : 123
+        }
+        [2] : {
+            type : bigint
+            value : 123
+        }
+        [3] : {
+            type : bigint
+            value : 123
+        }
+        [4] : {
+            type : bigint
+            value : 123
+        }
+        [5] : {
+            type : bigint
+            value : 123
+        }
+    ]
+}
+testing expression: 1234567890n
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : bigint
+            value : 1234567890
+        }
+        [1] : {
+            type : bigint
+            value : 1234567890
+        }
+        [2] : {
+            type : bigint
+            value : 1234567890
+        }
+        [3] : {
+            type : bigint
+            value : 1234567890
+        }
+        [4] : {
+            type : bigint
+            value : 1234567890
+        }
+        [5] : {
+            type : bigint
+            value : 1234567890
+        }
+    ]
+}
+
+Running test: Symbol
+testing expression: Symbol('foo')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : symbol
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : symbol
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : symbol
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : symbol
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : symbol
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : symbol
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Function
+testing expression: function qwe(){}
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: ()=>{}
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Array
+testing expression: [1,2,undefined]
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : array
+            value : [
+                [0] : {
+                    type : number
+                    value : 1
+                }
+                [1] : {
+                    type : number
+                    value : 2
+                }
+                [2] : {
+                    type : undefined
+                }
+            ]
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : array
+            value : [
+                [0] : {
+                    type : number
+                    value : 1
+                }
+                [1] : {
+                    type : number
+                    value : 2
+                }
+                [2] : {
+                    type : undefined
+                }
+            ]
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new Array(1,2,undefined)
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : array
+            value : [
+                [0] : {
+                    type : number
+                    value : 1
+                }
+                [1] : {
+                    type : number
+                    value : 2
+                }
+                [2] : {
+                    type : undefined
+                }
+            ]
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : array
+            value : [
+                [0] : {
+                    type : number
+                    value : 1
+                }
+                [1] : {
+                    type : number
+                    value : 2
+                }
+                [2] : {
+                    type : undefined
+                }
+            ]
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: RegExp
+testing expression: new RegExp('ab+c')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : regexp
+            value : {
+                pattern : ab+c
+            }
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : regexp
+            value : {
+                pattern : ab+c
+            }
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : regexp
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : regexp
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : regexp
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : regexp
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new RegExp('ab+c', 'ig')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : regexp
+            value : {
+                flags : gi
+                pattern : ab+c
+            }
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : regexp
+            value : {
+                flags : gi
+                pattern : ab+c
+            }
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : regexp
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : regexp
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : regexp
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : regexp
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Date
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : date
+            value : 2022-04-07T16:17:18.000Z
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : date
+            value : 2022-04-07T16:17:18.000Z
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT+1100')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : date
+            value : 2022-04-07T05:17:18.000Z
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : date
+            value : 2022-04-07T05:17:18.000Z
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT-1100')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : date
+            value : 2022-04-08T03:17:18.000Z
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : date
+            value : 2022-04-08T03:17:18.000Z
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Error
+testing expression: new Error()
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new Error('qwe')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Map
+testing expression: new Map([['keyString1', {valueObject1: 1}], [{keyObject2: 2}, 'valueString2'], ['keyString3', new Array()]])
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : map
+            value : [
+                [0] : [
+                    [0] : keyString1
+                    [1] : {
+                        type : object
+                        value : [
+                            [0] : [
+                                [0] : valueObject1
+                                [1] : {
+                                    type : number
+                                    value : 1
+                                }
+                            ]
+                        ]
+                    }
+                ]
+                [1] : [
+                    [0] : {
+                        type : object
+                        value : [
+                            [0] : [
+                                [0] : keyObject2
+                                [1] : {
+                                    type : number
+                                    value : 2
+                                }
+                            ]
+                        ]
+                    }
+                    [1] : {
+                        type : string
+                        value : valueString2
+                    }
+                ]
+                [2] : [
+                    [0] : keyString3
+                    [1] : {
+                        type : array
+                        value : [
+                        ]
+                    }
+                ]
+            ]
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : map
+            value : [
+                [0] : [
+                    [0] : keyString1
+                    [1] : {
+                        type : object
+                        value : [
+                            [0] : [
+                                [0] : valueObject1
+                                [1] : {
+                                    type : number
+                                    value : 1
+                                }
+                            ]
+                        ]
+                    }
+                ]
+                [1] : [
+                    [0] : {
+                        type : object
+                        value : [
+                            [0] : [
+                                [0] : keyObject2
+                                [1] : {
+                                    type : number
+                                    value : 2
+                                }
+                            ]
+                        ]
+                    }
+                    [1] : {
+                        type : string
+                        value : valueString2
+                    }
+                ]
+                [2] : [
+                    [0] : keyString3
+                    [1] : {
+                        type : array
+                        value : [
+                        ]
+                    }
+                ]
+            ]
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : map
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : map
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : map
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : map
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: WeakMap
+testing expression: new WeakMap([[{valueObject1: 1}, 'keyString1'],[{valueObject2: 2}, 'keyString2']])
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : weakmap
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : weakmap
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : weakmap
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : weakmap
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : weakmap
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : weakmap
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Set
+testing expression: new Set([{valueObject1: 1}, 'valueString2', new Array(), undefined])
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : set
+            value : [
+                [0] : {
+                    type : object
+                    value : [
+                        [0] : [
+                            [0] : valueObject1
+                            [1] : {
+                                type : number
+                                value : 1
+                            }
+                        ]
+                    ]
+                }
+                [1] : {
+                    type : string
+                    value : valueString2
+                }
+                [2] : {
+                    type : array
+                    value : [
+                    ]
+                }
+                [3] : {
+                    type : undefined
+                }
+            ]
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : set
+            value : [
+                [0] : {
+                    type : object
+                    value : [
+                        [0] : [
+                            [0] : valueObject1
+                            [1] : {
+                                type : number
+                                value : 1
+                            }
+                        ]
+                    ]
+                }
+                [1] : {
+                    type : string
+                    value : valueString2
+                }
+                [2] : {
+                    type : array
+                    value : [
+                    ]
+                }
+                [3] : {
+                    type : undefined
+                }
+            ]
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : set
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : set
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : set
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : set
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Weakset
+testing expression: new WeakSet([{valueObject1: 1}, {valueObject2: 2}])
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : weakset
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : weakset
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : weakset
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : weakset
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : weakset
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : weakset
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Proxy
+testing expression: new Proxy({}, ()=>{})
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : proxy
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : proxy
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : proxy
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : proxy
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : proxy
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : proxy
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Promise
+testing expression: new Promise(()=>{})
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : promise
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : promise
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : promise
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : promise
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : promise
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : promise
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Typedarray
+testing expression: new Uint16Array()
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : typedarray
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : typedarray
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : typedarray
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : typedarray
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : typedarray
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : typedarray
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: ArrayBuffer
+testing expression: new ArrayBuffer()
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : arraybuffer
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : arraybuffer
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : arraybuffer
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : arraybuffer
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : arraybuffer
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : arraybuffer
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Duplicate
+testing expression: (()=>{const foo={a: []}; const bar=[1,2]; const result={1: foo, 2: foo, 3: bar, 4: bar}; result.self=result; return result; })()
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : object
+            value : [
+                [0] : [
+                    [0] : 1
+                    [1] : {
+                        type : object
+                        value : [
+                            [0] : [
+                                [0] : a
+                                [1] : {
+                                    type : array
+                                    value : [
+                                    ]
+                                }
+                            ]
+                        ]
+                        weakLocalObjectReference : 1
+                    }
+                ]
+                [1] : [
+                    [0] : 2
+                    [1] : {
+                        type : object
+                        weakLocalObjectReference : 1
+                    }
+                ]
+                [2] : [
+                    [0] : 3
+                    [1] : {
+                        type : array
+                        value : [
+                            [0] : {
+                                type : number
+                                value : 1
+                            }
+                            [1] : {
+                                type : number
+                                value : 2
+                            }
+                        ]
+                        weakLocalObjectReference : 2
+                    }
+                ]
+                [3] : [
+                    [0] : 4
+                    [1] : {
+                        type : array
+                        weakLocalObjectReference : 2
+                    }
+                ]
+                [4] : [
+                    [0] : self
+                    [1] : {
+                        type : object
+                        weakLocalObjectReference : 3
+                    }
+                ]
+            ]
+            weakLocalObjectReference : 3
+        }
+        [1] : {
+            type : object
+            value : [
+                [0] : [
+                    [0] : 1
+                    [1] : {
+                        type : object
+                        value : [
+                            [0] : [
+                                [0] : a
+                                [1] : {
+                                    type : array
+                                    value : [
+                                    ]
+                                }
+                            ]
+                        ]
+                        weakLocalObjectReference : 4
+                    }
+                ]
+                [1] : [
+                    [0] : 2
+                    [1] : {
+                        type : object
+                        weakLocalObjectReference : 4
+                    }
+                ]
+                [2] : [
+                    [0] : 3
+                    [1] : {
+                        type : array
+                        value : [
+                            [0] : {
+                                type : number
+                                value : 1
+                            }
+                            [1] : {
+                                type : number
+                                value : 2
+                            }
+                        ]
+                        weakLocalObjectReference : 5
+                    }
+                ]
+                [3] : [
+                    [0] : 4
+                    [1] : {
+                        type : array
+                        weakLocalObjectReference : 5
+                    }
+                ]
+                [4] : [
+                    [0] : self
+                    [1] : {
+                        type : object
+                        weakLocalObjectReference : 6
+                    }
+                ]
+            ]
+            weakLocalObjectReference : 6
+        }
+        [2] : {
+            type : object
+            weakLocalObjectReference : 3
+        }
+        [3] : {
+            type : object
+            weakLocalObjectReference : 6
+        }
+        [4] : {
+            type : object
+            weakLocalObjectReference : 3
+        }
+        [5] : {
+            type : object
+            weakLocalObjectReference : 6
+        }
+    ]
+}
+
+Running test: Object
+testing expression: {nullKey: null, stringKey: 'foo',boolKey: true,numberKey: 123,bigintKey: 123n,symbolKey: Symbol('foo'),functionKey: () => {},arrayKey:[1],undefinedKey:undefined}
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : object
+            value : [
+                [0] : [
+                    [0] : nullKey
+                    [1] : {
+                        type : null
+                    }
+                ]
+                [1] : [
+                    [0] : stringKey
+                    [1] : {
+                        type : string
+                        value : foo
+                    }
+                ]
+                [2] : [
+                    [0] : boolKey
+                    [1] : {
+                        type : boolean
+                        value : true
+                    }
+                ]
+                [3] : [
+                    [0] : numberKey
+                    [1] : {
+                        type : number
+                        value : 123
+                    }
+                ]
+                [4] : [
+                    [0] : bigintKey
+                    [1] : {
+                        type : bigint
+                        value : 123
+                    }
+                ]
+                [5] : [
+                    [0] : symbolKey
+                    [1] : {
+                        type : symbol
+                    }
+                ]
+                [6] : [
+                    [0] : functionKey
+                    [1] : {
+                        type : function
+                    }
+                ]
+                [7] : [
+                    [0] : arrayKey
+                    [1] : {
+                        type : array
+                        value : [
+                            [0] : {
+                                type : number
+                                value : 1
+                            }
+                        ]
+                    }
+                ]
+                [8] : [
+                    [0] : undefinedKey
+                    [1] : {
+                        type : undefined
+                    }
+                ]
+            ]
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : object
+            value : [
+                [0] : [
+                    [0] : nullKey
+                    [1] : {
+                        type : null
+                    }
+                ]
+                [1] : [
+                    [0] : stringKey
+                    [1] : {
+                        type : string
+                        value : foo
+                    }
+                ]
+                [2] : [
+                    [0] : boolKey
+                    [1] : {
+                        type : boolean
+                        value : true
+                    }
+                ]
+                [3] : [
+                    [0] : numberKey
+                    [1] : {
+                        type : number
+                        value : 123
+                    }
+                ]
+                [4] : [
+                    [0] : bigintKey
+                    [1] : {
+                        type : bigint
+                        value : 123
+                    }
+                ]
+                [5] : [
+                    [0] : symbolKey
+                    [1] : {
+                        type : symbol
+                    }
+                ]
+                [6] : [
+                    [0] : functionKey
+                    [1] : {
+                        type : function
+                    }
+                ]
+                [7] : [
+                    [0] : arrayKey
+                    [1] : {
+                        type : array
+                        value : [
+                            [0] : {
+                                type : number
+                                value : 1
+                            }
+                        ]
+                    }
+                ]
+                [8] : [
+                    [0] : undefinedKey
+                    [1] : {
+                        type : undefined
+                    }
+                ]
+            ]
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: {key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : object
+            value : [
+                [0] : [
+                    [0] : key_level_1
+                    [1] : {
+                        type : object
+                        value : [
+                            [0] : [
+                                [0] : key_level_2
+                                [1] : {
+                                    type : object
+                                    value : [
+                                        [0] : [
+                                            [0] : key_level_3
+                                            [1] : {
+                                                type : string
+                                                value : value_level_3
+                                            }
+                                        ]
+                                    ]
+                                }
+                            ]
+                        ]
+                    }
+                ]
+            ]
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : object
+            value : [
+                [0] : [
+                    [0] : key_level_1
+                    [1] : {
+                        type : object
+                        value : [
+                            [0] : [
+                                [0] : key_level_2
+                                [1] : {
+                                    type : object
+                                    value : [
+                                        [0] : [
+                                            [0] : key_level_3
+                                            [1] : {
+                                                type : string
+                                                value : value_level_3
+                                            }
+                                        ]
+                                    ]
+                                }
+                            ]
+                        ]
+                    }
+                ]
+            ]
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+    ]
+}
diff --git a/deps/v8/test/inspector/runtime/deep-serialization-local-references.js b/deps/v8/test/inspector/runtime/deep-serialization-local-references.js
new file mode 100644
index 00000000000000..5b8e6c6061f7b9
--- /dev/null
+++ b/deps/v8/test/inspector/runtime/deep-serialization-local-references.js
@@ -0,0 +1,107 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const { session, contextGroup, Protocol } =
+  InspectorTest.start('RemoteObject.deepSerializedValue');
+
+Protocol.Runtime.enable();
+Protocol.Runtime.onConsoleAPICalled(m => InspectorTest.logMessage(m));
+
+InspectorTest.runAsyncTestSuite([
+  async function PrimitiveValue() {
+    await testExpression("undefined");
+    await testExpression("null");
+    await testExpression("'foo'");
+    await testExpression("true");
+    await testExpression("false");
+  },
+  async function Number() {
+    await testExpression("123");
+    await testExpression("0.56");
+    await testExpression("-0");
+    await testExpression("+Infinity");
+    await testExpression("-Infinity");
+    await testExpression("NaN");
+  },
+  async function BigInt() {
+    await testExpression("123n");
+    await testExpression("1234567890n");
+  },
+  async function Symbol() {
+    await testExpression("Symbol('foo')");
+  },
+  async function Function() {
+    await testExpression("function qwe(){}");
+    await testExpression("()=>{}");
+  },
+  async function Array() {
+    await testExpression("[1,2,undefined]");
+    await testExpression("new Array(1,2,undefined)");
+  },
+  async function RegExp() {
+    await testExpression("new RegExp('ab+c')");
+    await testExpression("new RegExp('ab+c', 'ig')");
+  },
+  async function Date() {
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT')");
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT+1100')");
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT-1100')");
+  },
+  async function Error() {
+    await testExpression("new Error()");
+    await testExpression("new Error('qwe')");
+  },
+  async function Map() {
+    await testExpression("new Map([['keyString1', {valueObject1: 1}], [{keyObject2: 2}, 'valueString2'], ['keyString3', new Array()]])");
+  },
+  async function WeakMap() {
+    await testExpression("new WeakMap([[{valueObject1: 1}, 'keyString1'],[{valueObject2: 2}, 'keyString2']])");
+  },
+  async function Set() {
+    await testExpression("new Set([{valueObject1: 1}, 'valueString2', new Array(), undefined])");
+  },
+  async function Weakset() {
+    await testExpression("new WeakSet([{valueObject1: 1}, {valueObject2: 2}])");
+  },
+  async function Proxy() {
+    await testExpression("new Proxy({}, ()=>{})");
+  },
+  async function Promise() {
+    await testExpression("new Promise(()=>{})");
+  },
+  async function Typedarray() {
+    await testExpression("new Uint16Array()");
+  },
+  async function ArrayBuffer() {
+    await testExpression("new ArrayBuffer()");
+  },
+  async function Duplicate() {
+    await testExpression("(()=>{const foo={a: []}; const bar=[1,2]; const result={1: foo, 2: foo, 3: bar, 4: bar}; result.self=result; return result; })()");
+  },
+  async function Object() {
+    // Object.
+    await testExpression("{nullKey: null, stringKey: 'foo',boolKey: true,numberKey: 123,bigintKey: 123n,symbolKey: Symbol('foo'),functionKey: () => {},arrayKey:[1],undefinedKey:undefined}");
+    // Object in-depth serialization.
+    await testExpression("{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}");
+ }]);
+
+async function testExpression(expression) {
+  const wrappedExpression = `(()=>{const a=${expression}; const b=${expression}; return [a,b,a,b,a,b]})()`
+  InspectorTest.logMessage("testing expression: "+expression);
+
+  InspectorTest.logMessage("Runtime.evaluate");
+  dumpResult(await Protocol.Runtime.evaluate({
+    expression: wrappedExpression,
+    serializationOptions: { serialization: "deep" }
+  }));
+}
+
+function dumpResult(result) {
+  if (result?.result?.result?.deepSerializedValue) {
+    InspectorTest.logMessage(result.result.result.deepSerializedValue);
+  } else {
+    InspectorTest.log("...no deepSerializedValue...");
+    InspectorTest.logMessage(result);
+  }
+}
diff --git a/deps/v8/test/inspector/runtime/deep-serialization-value-expected.txt b/deps/v8/test/inspector/runtime/deep-serialization-value-expected.txt
new file mode 100644
index 00000000000000..e85917d444e0dd
--- /dev/null
+++ b/deps/v8/test/inspector/runtime/deep-serialization-value-expected.txt
@@ -0,0 +1,960 @@
+RemoteObject.deepSerializedValue
+
+Running test: PrimitiveValue
+testing expression: undefined
+Runtime.evaluate
+{
+    type : undefined
+}
+Runtime.callFunctionOn
+{
+    type : undefined
+}
+testing expression: null
+Runtime.evaluate
+{
+    type : null
+}
+Runtime.callFunctionOn
+{
+    type : null
+}
+testing expression: 'foo'
+Runtime.evaluate
+{
+    type : string
+    value : foo
+}
+Runtime.callFunctionOn
+{
+    type : string
+    value : foo
+}
+testing expression: true
+Runtime.evaluate
+{
+    type : boolean
+    value : true
+}
+Runtime.callFunctionOn
+{
+    type : boolean
+    value : true
+}
+testing expression: false
+Runtime.evaluate
+{
+    type : boolean
+    value : false
+}
+Runtime.callFunctionOn
+{
+    type : boolean
+    value : false
+}
+
+Running test: Number
+testing expression: 123
+Runtime.evaluate
+{
+    type : number
+    value : 123
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : 123
+}
+testing expression: 0.56
+Runtime.evaluate
+{
+    type : number
+    value : 0.56
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : 0.56
+}
+testing expression: -0
+Runtime.evaluate
+{
+    type : number
+    value : -0
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : -0
+}
+testing expression: +Infinity
+Runtime.evaluate
+{
+    type : number
+    value : Infinity
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : Infinity
+}
+testing expression: -Infinity
+Runtime.evaluate
+{
+    type : number
+    value : -Infinity
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : -Infinity
+}
+testing expression: NaN
+Runtime.evaluate
+{
+    type : number
+    value : NaN
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : NaN
+}
+
+Running test: BigInt
+testing expression: 123n
+Runtime.evaluate
+{
+    type : bigint
+    value : 123
+}
+Runtime.callFunctionOn
+{
+    type : bigint
+    value : 123
+}
+testing expression: 1234567890n
+Runtime.evaluate
+{
+    type : bigint
+    value : 1234567890
+}
+Runtime.callFunctionOn
+{
+    type : bigint
+    value : 1234567890
+}
+
+Running test: Symbol
+testing expression: Symbol('foo')
+Runtime.evaluate
+{
+    type : symbol
+}
+Runtime.callFunctionOn
+{
+    type : symbol
+}
+
+Running test: Function
+testing expression: function qwe(){}
+Runtime.evaluate
+{
+    type : function
+}
+Runtime.callFunctionOn
+{
+    type : function
+}
+testing expression: ()=>{}
+Runtime.evaluate
+{
+    type : function
+}
+Runtime.callFunctionOn
+{
+    type : function
+}
+
+Running test: Array
+testing expression: [1,2,undefined]
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : 1
+        }
+        [1] : {
+            type : number
+            value : 2
+        }
+        [2] : {
+            type : undefined
+        }
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : 1
+        }
+        [1] : {
+            type : number
+            value : 2
+        }
+        [2] : {
+            type : undefined
+        }
+    ]
+}
+testing expression: new Array(1,2,undefined)
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : 1
+        }
+        [1] : {
+            type : number
+            value : 2
+        }
+        [2] : {
+            type : undefined
+        }
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : 1
+        }
+        [1] : {
+            type : number
+            value : 2
+        }
+        [2] : {
+            type : undefined
+        }
+    ]
+}
+
+Running test: RegExp
+testing expression: new RegExp('ab+c')
+Runtime.evaluate
+{
+    type : regexp
+    value : {
+        pattern : ab+c
+    }
+}
+Runtime.callFunctionOn
+{
+    type : regexp
+    value : {
+        pattern : ab+c
+    }
+}
+testing expression: new RegExp('ab+c', 'ig')
+Runtime.evaluate
+{
+    type : regexp
+    value : {
+        flags : gi
+        pattern : ab+c
+    }
+}
+Runtime.callFunctionOn
+{
+    type : regexp
+    value : {
+        flags : gi
+        pattern : ab+c
+    }
+}
+
+Running test: Date
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT')
+Runtime.evaluate
+{
+    type : date
+    value : 2022-04-07T16:17:18.000Z
+}
+Runtime.callFunctionOn
+{
+    type : date
+    value : 2022-04-07T16:17:18.000Z
+}
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT+1100')
+Runtime.evaluate
+{
+    type : date
+    value : 2022-04-07T05:17:18.000Z
+}
+Runtime.callFunctionOn
+{
+    type : date
+    value : 2022-04-07T05:17:18.000Z
+}
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT-1100')
+Runtime.evaluate
+{
+    type : date
+    value : 2022-04-08T03:17:18.000Z
+}
+Runtime.callFunctionOn
+{
+    type : date
+    value : 2022-04-08T03:17:18.000Z
+}
+
+Running test: Error
+testing expression: new Error()
+Runtime.evaluate
+{
+    type : error
+}
+Runtime.callFunctionOn
+{
+    type : error
+}
+testing expression: new Error('qwe')
+Runtime.evaluate
+{
+    type : error
+}
+Runtime.callFunctionOn
+{
+    type : error
+}
+
+Running test: Map
+testing expression: new Map([['keyString1', {valueObject1: 1}], [{keyObject2: 2}, 'valueString2'], ['keyString3', new Array()]])
+Runtime.evaluate
+{
+    type : map
+    value : [
+        [0] : [
+            [0] : keyString1
+            [1] : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : valueObject1
+                        [1] : {
+                            type : number
+                            value : 1
+                        }
+                    ]
+                ]
+            }
+        ]
+        [1] : [
+            [0] : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : keyObject2
+                        [1] : {
+                            type : number
+                            value : 2
+                        }
+                    ]
+                ]
+            }
+            [1] : {
+                type : string
+                value : valueString2
+            }
+        ]
+        [2] : [
+            [0] : keyString3
+            [1] : {
+                type : array
+                value : [
+                ]
+            }
+        ]
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : map
+    value : [
+        [0] : [
+            [0] : keyString1
+            [1] : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : valueObject1
+                        [1] : {
+                            type : number
+                            value : 1
+                        }
+                    ]
+                ]
+            }
+        ]
+        [1] : [
+            [0] : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : keyObject2
+                        [1] : {
+                            type : number
+                            value : 2
+                        }
+                    ]
+                ]
+            }
+            [1] : {
+                type : string
+                value : valueString2
+            }
+        ]
+        [2] : [
+            [0] : keyString3
+            [1] : {
+                type : array
+                value : [
+                ]
+            }
+        ]
+    ]
+}
+
+Running test: WeakMap
+testing expression: new WeakMap([[{valueObject1: 1}, 'keyString1'],[{valueObject2: 2}, 'keyString2']])
+Runtime.evaluate
+{
+    type : weakmap
+}
+Runtime.callFunctionOn
+{
+    type : weakmap
+}
+
+Running test: Set
+testing expression: new Set([{valueObject1: 1}, 'valueString2', new Array(), undefined])
+Runtime.evaluate
+{
+    type : set
+    value : [
+        [0] : {
+            type : object
+            value : [
+                [0] : [
+                    [0] : valueObject1
+                    [1] : {
+                        type : number
+                        value : 1
+                    }
+                ]
+            ]
+        }
+        [1] : {
+            type : string
+            value : valueString2
+        }
+        [2] : {
+            type : array
+            value : [
+            ]
+        }
+        [3] : {
+            type : undefined
+        }
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : set
+    value : [
+        [0] : {
+            type : object
+            value : [
+                [0] : [
+                    [0] : valueObject1
+                    [1] : {
+                        type : number
+                        value : 1
+                    }
+                ]
+            ]
+        }
+        [1] : {
+            type : string
+            value : valueString2
+        }
+        [2] : {
+            type : array
+            value : [
+            ]
+        }
+        [3] : {
+            type : undefined
+        }
+    ]
+}
+
+Running test: Weakset
+testing expression: new WeakSet([{valueObject1: 1}, {valueObject2: 2}])
+Runtime.evaluate
+{
+    type : weakset
+}
+Runtime.callFunctionOn
+{
+    type : weakset
+}
+
+Running test: Proxy
+testing expression: new Proxy({}, ()=>{})
+Runtime.evaluate
+{
+    type : proxy
+}
+Runtime.callFunctionOn
+{
+    type : proxy
+}
+
+Running test: Promise
+testing expression: new Promise(()=>{})
+Runtime.evaluate
+{
+    type : promise
+}
+Runtime.callFunctionOn
+{
+    type : promise
+}
+
+Running test: Typedarray
+testing expression: new Uint16Array()
+Runtime.evaluate
+{
+    type : typedarray
+}
+Runtime.callFunctionOn
+{
+    type : typedarray
+}
+
+Running test: ArrayBuffer
+testing expression: new ArrayBuffer()
+Runtime.evaluate
+{
+    type : arraybuffer
+}
+Runtime.callFunctionOn
+{
+    type : arraybuffer
+}
+
+Running test: Duplicate
+testing expression: (()=>{const foo={a: []}; const bar=[1,2]; const result={1: foo, 2: foo, 3: bar, 4: bar}; result.self=result; return result; })()
+Runtime.evaluate
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : 1
+            [1] : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : a
+                        [1] : {
+                            type : array
+                            value : [
+                            ]
+                        }
+                    ]
+                ]
+                weakLocalObjectReference : 1
+            }
+        ]
+        [1] : [
+            [0] : 2
+            [1] : {
+                type : object
+                weakLocalObjectReference : 1
+            }
+        ]
+        [2] : [
+            [0] : 3
+            [1] : {
+                type : array
+                value : [
+                    [0] : {
+                        type : number
+                        value : 1
+                    }
+                    [1] : {
+                        type : number
+                        value : 2
+                    }
+                ]
+                weakLocalObjectReference : 2
+            }
+        ]
+        [3] : [
+            [0] : 4
+            [1] : {
+                type : array
+                weakLocalObjectReference : 2
+            }
+        ]
+        [4] : [
+            [0] : self
+            [1] : {
+                type : object
+                weakLocalObjectReference : 3
+            }
+        ]
+    ]
+    weakLocalObjectReference : 3
+}
+Runtime.callFunctionOn
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : 1
+            [1] : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : a
+                        [1] : {
+                            type : array
+                            value : [
+                            ]
+                        }
+                    ]
+                ]
+                weakLocalObjectReference : 1
+            }
+        ]
+        [1] : [
+            [0] : 2
+            [1] : {
+                type : object
+                weakLocalObjectReference : 1
+            }
+        ]
+        [2] : [
+            [0] : 3
+            [1] : {
+                type : array
+                value : [
+                    [0] : {
+                        type : number
+                        value : 1
+                    }
+                    [1] : {
+                        type : number
+                        value : 2
+                    }
+                ]
+                weakLocalObjectReference : 2
+            }
+        ]
+        [3] : [
+            [0] : 4
+            [1] : {
+                type : array
+                weakLocalObjectReference : 2
+            }
+        ]
+        [4] : [
+            [0] : self
+            [1] : {
+                type : object
+                weakLocalObjectReference : 3
+            }
+        ]
+    ]
+    weakLocalObjectReference : 3
+}
+
+Running test: Object
+testing expression: {nullKey: null, stringKey: 'foo',boolKey: true,numberKey: 123,bigintKey: 123n,symbolKey: Symbol('foo'),functionKey: () => {},arrayKey:[1],undefinedKey:undefined}
+Runtime.evaluate
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : nullKey
+            [1] : {
+                type : null
+            }
+        ]
+        [1] : [
+            [0] : stringKey
+            [1] : {
+                type : string
+                value : foo
+            }
+        ]
+        [2] : [
+            [0] : boolKey
+            [1] : {
+                type : boolean
+                value : true
+            }
+        ]
+        [3] : [
+            [0] : numberKey
+            [1] : {
+                type : number
+                value : 123
+            }
+        ]
+        [4] : [
+            [0] : bigintKey
+            [1] : {
+                type : bigint
+                value : 123
+            }
+        ]
+        [5] : [
+            [0] : symbolKey
+            [1] : {
+                type : symbol
+            }
+        ]
+        [6] : [
+            [0] : functionKey
+            [1] : {
+                type : function
+            }
+        ]
+        [7] : [
+            [0] : arrayKey
+            [1] : {
+                type : array
+                value : [
+                    [0] : {
+                        type : number
+                        value : 1
+                    }
+                ]
+            }
+        ]
+        [8] : [
+            [0] : undefinedKey
+            [1] : {
+                type : undefined
+            }
+        ]
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : nullKey
+            [1] : {
+                type : null
+            }
+        ]
+        [1] : [
+            [0] : stringKey
+            [1] : {
+                type : string
+                value : foo
+            }
+        ]
+        [2] : [
+            [0] : boolKey
+            [1] : {
+                type : boolean
+                value : true
+            }
+        ]
+        [3] : [
+            [0] : numberKey
+            [1] : {
+                type : number
+                value : 123
+            }
+        ]
+        [4] : [
+            [0] : bigintKey
+            [1] : {
+                type : bigint
+                value : 123
+            }
+        ]
+        [5] : [
+            [0] : symbolKey
+            [1] : {
+                type : symbol
+            }
+        ]
+        [6] : [
+            [0] : functionKey
+            [1] : {
+                type : function
+            }
+        ]
+        [7] : [
+            [0] : arrayKey
+            [1] : {
+                type : array
+                value : [
+                    [0] : {
+                        type : number
+                        value : 1
+                    }
+                ]
+            }
+        ]
+        [8] : [
+            [0] : undefinedKey
+            [1] : {
+                type : undefined
+            }
+        ]
+    ]
+}
+testing expression: {key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}
+Runtime.evaluate
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : key_level_1
+            [1] : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_2
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_3
+                                    [1] : {
+                                        type : string
+                                        value : value_level_3
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+        ]
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : key_level_1
+            [1] : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_2
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_3
+                                    [1] : {
+                                        type : string
+                                        value : value_level_3
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+        ]
+    ]
+}
+testing expression: {1: 'value'}
+Runtime.evaluate
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : 1
+            [1] : {
+                type : string
+                value : value
+            }
+        ]
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : 1
+            [1] : {
+                type : string
+                value : value
+            }
+        ]
+    ]
+}
+testing expression: {'1': 'value'}
+Runtime.evaluate
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : 1
+            [1] : {
+                type : string
+                value : value
+            }
+        ]
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : 1
+            [1] : {
+                type : string
+                value : value
+            }
+        ]
+    ]
+}
+testing expression: (()=>{const s = Symbol('foo'); const a={}; a[s]='symbol_value'; return a;})()
+Runtime.evaluate
+{
+    type : object
+    value : [
+    ]
+}
+Runtime.callFunctionOn
+{
+    type : object
+    value : [
+    ]
+}
diff --git a/deps/v8/test/inspector/runtime/deep-serialization-value.js b/deps/v8/test/inspector/runtime/deep-serialization-value.js
new file mode 100644
index 00000000000000..a631afeb0a53ad
--- /dev/null
+++ b/deps/v8/test/inspector/runtime/deep-serialization-value.js
@@ -0,0 +1,130 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const { session, contextGroup, Protocol } =
+  InspectorTest.start('RemoteObject.deepSerializedValue');
+
+Protocol.Runtime.enable();
+Protocol.Runtime.onConsoleAPICalled(m => InspectorTest.logMessage(m));
+
+InspectorTest.runAsyncTestSuite([
+  async function PrimitiveValue() {
+    await testExpression("undefined");
+    await testExpression("null");
+    await testExpression("'foo'");
+    await testExpression("true");
+    await testExpression("false");
+  },
+  async function Number() {
+    await testExpression("123");
+    await testExpression("0.56");
+    await testExpression("-0");
+    await testExpression("+Infinity");
+    await testExpression("-Infinity");
+    await testExpression("NaN");
+  },
+  async function BigInt() {
+    await testExpression("123n");
+    await testExpression("1234567890n");
+  },
+  async function Symbol() {
+    await testExpression("Symbol('foo')");
+  },
+  async function Function() {
+    await testExpression("function qwe(){}");
+    await testExpression("()=>{}");
+  },
+  async function Array() {
+    await testExpression("[1,2,undefined]");
+    await testExpression("new Array(1,2,undefined)");
+  },
+  async function RegExp() {
+    await testExpression("new RegExp('ab+c')");
+    await testExpression("new RegExp('ab+c', 'ig')");
+  },
+  async function Date() {
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT')");
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT+1100')");
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT-1100')");
+  },
+  async function Error() {
+    await testExpression("new Error()");
+    await testExpression("new Error('qwe')");
+  },
+  async function Map() {
+    await testExpression("new Map([['keyString1', {valueObject1: 1}], [{keyObject2: 2}, 'valueString2'], ['keyString3', new Array()]])");
+  },
+  async function WeakMap() {
+    await testExpression("new WeakMap([[{valueObject1: 1}, 'keyString1'],[{valueObject2: 2}, 'keyString2']])");
+  },
+  async function Set() {
+    await testExpression("new Set([{valueObject1: 1}, 'valueString2', new Array(), undefined])");
+  },
+  async function Weakset() {
+    await testExpression("new WeakSet([{valueObject1: 1}, {valueObject2: 2}])");
+  },
+  async function Proxy() {
+    await testExpression("new Proxy({}, ()=>{})");
+  },
+  async function Promise() {
+    await testExpression("new Promise(()=>{})");
+  },
+  async function Typedarray() {
+    await testExpression("new Uint16Array()");
+  },
+  async function ArrayBuffer() {
+    await testExpression("new ArrayBuffer()");
+  },
+  async function Duplicate() {
+    await testExpression("(()=>{const foo={a: []}; const bar=[1,2]; const result={1: foo, 2: foo, 3: bar, 4: bar}; result.self=result; return result; })()");
+  },
+  async function Object() {
+    // Object.
+    await testExpression("{nullKey: null, stringKey: 'foo',boolKey: true,numberKey: 123,bigintKey: 123n,symbolKey: Symbol('foo'),functionKey: () => {},arrayKey:[1],undefinedKey:undefined}");
+    // Object in-depth serialization.
+    await testExpression("{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}");
+    // Object with number property name.
+    await testExpression("{1: 'value'}");
+    // Object with string number property name.
+    await testExpression("{'1': 'value'}");
+    // Object with a symbol as a property name.
+    await testExpression("(()=>{const s = Symbol('foo'); const a={}; a[s]='symbol_value'; return a;})()");
+ }]);
+
+async function serializeViaEvaluate(expression) {
+  return await Protocol.Runtime.evaluate({
+    expression: "("+expression+")",
+    serializationOptions: { serialization: "deep" }
+  });
+}
+
+async function serializeViaCallFunctionOn(expression) {
+  const objectId = (await Protocol.Runtime.evaluate({
+    expression: "({})",
+  })).result.result.objectId;
+
+  return await Protocol.Runtime.callFunctionOn({
+    functionDeclaration: "()=>{return " + expression + "}",
+    objectId,
+    serializationOptions: { serialization: "deep" }
+ });
+}
+
+async function testExpression(expression) {
+  InspectorTest.logMessage("testing expression: "+expression);
+
+  InspectorTest.logMessage("Runtime.evaluate");
+  dumpResult(await serializeViaEvaluate(expression));
+  InspectorTest.logMessage("Runtime.callFunctionOn");
+  dumpResult(await serializeViaCallFunctionOn(expression));
+}
+
+function dumpResult(result) {
+  if (result?.result?.result?.deepSerializedValue) {
+    InspectorTest.logMessage(result.result.result.deepSerializedValue);
+  } else {
+    InspectorTest.log("...no deepSerializedValue...");
+    InspectorTest.logMessage(result);
+  }
+}
diff --git a/deps/v8/test/inspector/runtime/exception-thrown-breakpoint-conditions-expected.txt b/deps/v8/test/inspector/runtime/exception-thrown-breakpoint-conditions-expected.txt
index 50fffb05757b01..007f8339b4ac19 100644
--- a/deps/v8/test/inspector/runtime/exception-thrown-breakpoint-conditions-expected.txt
+++ b/deps/v8/test/inspector/runtime/exception-thrown-breakpoint-conditions-expected.txt
@@ -7,7 +7,19 @@ Exception thrown: SyntaxError: Unexpected end of input
     at smallFnWithLogpoint (test.js:3:17)
     at <anonymous>:1:1
 
-Running test: testRepeatedErrorsOnlyCauseOneEvent
+Running test: testRepeatedErrorsCauseOneEventEach
+Exception thrown: SyntaxError: Unexpected end of input
+    at smallFnWithLogpoint (test.js:3:17)
+    at <anonymous>:1:29
+Exception thrown: SyntaxError: Unexpected end of input
+    at smallFnWithLogpoint (test.js:3:17)
+    at <anonymous>:1:29
+Exception thrown: SyntaxError: Unexpected end of input
+    at smallFnWithLogpoint (test.js:3:17)
+    at <anonymous>:1:29
+Exception thrown: SyntaxError: Unexpected end of input
+    at smallFnWithLogpoint (test.js:3:17)
+    at <anonymous>:1:29
 Exception thrown: SyntaxError: Unexpected end of input
     at smallFnWithLogpoint (test.js:3:17)
     at <anonymous>:1:29
diff --git a/deps/v8/test/inspector/runtime/exception-thrown-breakpoint-conditions.js b/deps/v8/test/inspector/runtime/exception-thrown-breakpoint-conditions.js
index e569eea8a0881b..0031ee275d6420 100644
--- a/deps/v8/test/inspector/runtime/exception-thrown-breakpoint-conditions.js
+++ b/deps/v8/test/inspector/runtime/exception-thrown-breakpoint-conditions.js
@@ -25,7 +25,7 @@ async function testSyntaxError() {
   await Protocol.Debugger.removeBreakpoint({ breakpointId });
 }
 
-async function testRepeatedErrorsOnlyCauseOneEvent() {
+async function testRepeatedErrorsCauseOneEventEach() {
   const { result: { breakpointId } } = await Protocol.Debugger.setBreakpointByUrl({
     lineNumber: 3,
     url: 'test.js',
@@ -66,6 +66,6 @@ InspectorTest.runAsyncTestSuite([
     await Protocol.Debugger.onceScriptParsed();
   },
   testSyntaxError,
-  testRepeatedErrorsOnlyCauseOneEvent,
+  testRepeatedErrorsCauseOneEventEach,
   testSporadicThrowing,
 ]);
diff --git a/deps/v8/test/inspector/runtime/generate-web-driver-internal-id-expected.txt b/deps/v8/test/inspector/runtime/generate-web-driver-internal-id-expected.txt
new file mode 100644
index 00000000000000..cc661d082d2025
--- /dev/null
+++ b/deps/v8/test/inspector/runtime/generate-web-driver-internal-id-expected.txt
@@ -0,0 +1,1163 @@
+RemoteObject.webDriverValue
+
+Running test: PrimitiveValue
+testing expression: undefined
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : undefined
+        }
+        [1] : {
+            type : undefined
+        }
+        [2] : {
+            type : undefined
+        }
+        [3] : {
+            type : undefined
+        }
+        [4] : {
+            type : undefined
+        }
+        [5] : {
+            type : undefined
+        }
+    ]
+}
+testing expression: null
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : null
+        }
+        [1] : {
+            type : null
+        }
+        [2] : {
+            type : null
+        }
+        [3] : {
+            type : null
+        }
+        [4] : {
+            type : null
+        }
+        [5] : {
+            type : null
+        }
+    ]
+}
+testing expression: 'foo'
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : string
+            value : foo
+        }
+        [1] : {
+            type : string
+            value : foo
+        }
+        [2] : {
+            type : string
+            value : foo
+        }
+        [3] : {
+            type : string
+            value : foo
+        }
+        [4] : {
+            type : string
+            value : foo
+        }
+        [5] : {
+            type : string
+            value : foo
+        }
+    ]
+}
+testing expression: true
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : boolean
+            value : true
+        }
+        [1] : {
+            type : boolean
+            value : true
+        }
+        [2] : {
+            type : boolean
+            value : true
+        }
+        [3] : {
+            type : boolean
+            value : true
+        }
+        [4] : {
+            type : boolean
+            value : true
+        }
+        [5] : {
+            type : boolean
+            value : true
+        }
+    ]
+}
+testing expression: false
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : boolean
+            value : false
+        }
+        [1] : {
+            type : boolean
+            value : false
+        }
+        [2] : {
+            type : boolean
+            value : false
+        }
+        [3] : {
+            type : boolean
+            value : false
+        }
+        [4] : {
+            type : boolean
+            value : false
+        }
+        [5] : {
+            type : boolean
+            value : false
+        }
+    ]
+}
+
+Running test: Number
+testing expression: 123
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : 123
+        }
+        [1] : {
+            type : number
+            value : 123
+        }
+        [2] : {
+            type : number
+            value : 123
+        }
+        [3] : {
+            type : number
+            value : 123
+        }
+        [4] : {
+            type : number
+            value : 123
+        }
+        [5] : {
+            type : number
+            value : 123
+        }
+    ]
+}
+testing expression: 0.56
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : 0.56
+        }
+        [1] : {
+            type : number
+            value : 0.56
+        }
+        [2] : {
+            type : number
+            value : 0.56
+        }
+        [3] : {
+            type : number
+            value : 0.56
+        }
+        [4] : {
+            type : number
+            value : 0.56
+        }
+        [5] : {
+            type : number
+            value : 0.56
+        }
+    ]
+}
+testing expression: -0
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : -0
+        }
+        [1] : {
+            type : number
+            value : -0
+        }
+        [2] : {
+            type : number
+            value : -0
+        }
+        [3] : {
+            type : number
+            value : -0
+        }
+        [4] : {
+            type : number
+            value : -0
+        }
+        [5] : {
+            type : number
+            value : -0
+        }
+    ]
+}
+testing expression: +Infinity
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : Infinity
+        }
+        [1] : {
+            type : number
+            value : Infinity
+        }
+        [2] : {
+            type : number
+            value : Infinity
+        }
+        [3] : {
+            type : number
+            value : Infinity
+        }
+        [4] : {
+            type : number
+            value : Infinity
+        }
+        [5] : {
+            type : number
+            value : Infinity
+        }
+    ]
+}
+testing expression: -Infinity
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : -Infinity
+        }
+        [1] : {
+            type : number
+            value : -Infinity
+        }
+        [2] : {
+            type : number
+            value : -Infinity
+        }
+        [3] : {
+            type : number
+            value : -Infinity
+        }
+        [4] : {
+            type : number
+            value : -Infinity
+        }
+        [5] : {
+            type : number
+            value : -Infinity
+        }
+    ]
+}
+testing expression: NaN
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : number
+            value : NaN
+        }
+        [1] : {
+            type : number
+            value : NaN
+        }
+        [2] : {
+            type : number
+            value : NaN
+        }
+        [3] : {
+            type : number
+            value : NaN
+        }
+        [4] : {
+            type : number
+            value : NaN
+        }
+        [5] : {
+            type : number
+            value : NaN
+        }
+    ]
+}
+
+Running test: BigInt
+testing expression: 123n
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : bigint
+            value : 123
+        }
+        [1] : {
+            type : bigint
+            value : 123
+        }
+        [2] : {
+            type : bigint
+            value : 123
+        }
+        [3] : {
+            type : bigint
+            value : 123
+        }
+        [4] : {
+            type : bigint
+            value : 123
+        }
+        [5] : {
+            type : bigint
+            value : 123
+        }
+    ]
+}
+testing expression: 1234567890n
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : bigint
+            value : 1234567890
+        }
+        [1] : {
+            type : bigint
+            value : 1234567890
+        }
+        [2] : {
+            type : bigint
+            value : 1234567890
+        }
+        [3] : {
+            type : bigint
+            value : 1234567890
+        }
+        [4] : {
+            type : bigint
+            value : 1234567890
+        }
+        [5] : {
+            type : bigint
+            value : 1234567890
+        }
+    ]
+}
+
+Running test: Symbol
+testing expression: Symbol('foo')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : symbol
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : symbol
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : symbol
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : symbol
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : symbol
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : symbol
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Function
+testing expression: function qwe(){}
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: ()=>{}
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : function
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : function
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Array
+testing expression: [1,2,undefined]
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new Array(1,2,undefined)
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : array
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : array
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: RegExp
+testing expression: new RegExp('ab+c')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : regexp
+            value : {
+                pattern : ab+c
+            }
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : regexp
+            value : {
+                pattern : ab+c
+            }
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : regexp
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : regexp
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : regexp
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : regexp
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new RegExp('ab+c', 'ig')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : regexp
+            value : {
+                flags : gi
+                pattern : ab+c
+            }
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : regexp
+            value : {
+                flags : gi
+                pattern : ab+c
+            }
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : regexp
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : regexp
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : regexp
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : regexp
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Date
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : date
+            value : 2022-04-07T16:17:18.000Z
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : date
+            value : 2022-04-07T16:17:18.000Z
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT+1100')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : date
+            value : 2022-04-07T05:17:18.000Z
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : date
+            value : 2022-04-07T05:17:18.000Z
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new Date('Thu Apr 07 2022 16:17:18 GMT-1100')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : date
+            value : 2022-04-08T03:17:18.000Z
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : date
+            value : 2022-04-08T03:17:18.000Z
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : date
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : date
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Error
+testing expression: new Error()
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: new Error('qwe')
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : error
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : error
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Map
+testing expression: new Map([['keyString1', {valueObject1: 1}], [{keyObject2: 2}, 'valueString2'], ['keyString3', new Array()]])
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : map
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : map
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : map
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : map
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : map
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : map
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: WeakMap
+testing expression: new WeakMap([[{valueObject1: 1}, 'keyString1'],[{valueObject2: 2}, 'keyString2']])
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : weakmap
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : weakmap
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : weakmap
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : weakmap
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : weakmap
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : weakmap
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Set
+testing expression: new Set([{valueObject1: 1}, 'valueString2', new Array(), undefined])
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : set
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : set
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : set
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : set
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : set
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : set
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Weakset
+testing expression: new WeakSet([{valueObject1: 1}, {valueObject2: 2}])
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : weakset
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : weakset
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : weakset
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : weakset
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : weakset
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : weakset
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Proxy
+testing expression: new Proxy({}, ()=>{})
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : proxy
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : proxy
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : proxy
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : proxy
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : proxy
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : proxy
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Promise
+testing expression: new Promise(()=>{})
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : promise
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : promise
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : promise
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : promise
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : promise
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : promise
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Typedarray
+testing expression: new Uint16Array()
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : typedarray
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : typedarray
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : typedarray
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : typedarray
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : typedarray
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : typedarray
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: ArrayBuffer
+testing expression: new ArrayBuffer()
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : arraybuffer
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : arraybuffer
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : arraybuffer
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : arraybuffer
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : arraybuffer
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : arraybuffer
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Duplicate
+testing expression: (()=>{const foo={a: []}; const bar=[1,2]; const result={1: foo, 2: foo, 3: bar, 4: bar}; result.self=result; return result; })()
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+
+Running test: Object
+testing expression: {nullKey: null, stringKey: 'foo',boolKey: true,numberKey: 123,bigintKey: 123n,symbolKey: Symbol('foo'),functionKey: () => {},arrayKey:[1],undefinedKey:undefined}
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+    ]
+}
+testing expression: {key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}
+Runtime.evaluate
+{
+    type : array
+    value : [
+        [0] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [1] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+        [2] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [3] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+        [4] : {
+            type : object
+            weakLocalObjectReference : 1
+        }
+        [5] : {
+            type : object
+            weakLocalObjectReference : 2
+        }
+    ]
+}
diff --git a/deps/v8/test/inspector/runtime/generate-web-driver-internal-id.js b/deps/v8/test/inspector/runtime/generate-web-driver-internal-id.js
new file mode 100644
index 00000000000000..cc8114375b05f5
--- /dev/null
+++ b/deps/v8/test/inspector/runtime/generate-web-driver-internal-id.js
@@ -0,0 +1,107 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const { session, contextGroup, Protocol } =
+  InspectorTest.start('RemoteObject.webDriverValue');
+
+Protocol.Runtime.enable();
+Protocol.Runtime.onConsoleAPICalled(m => InspectorTest.logMessage(m));
+
+InspectorTest.runAsyncTestSuite([
+  async function PrimitiveValue() {
+    await testExpression("undefined");
+    await testExpression("null");
+    await testExpression("'foo'");
+    await testExpression("true");
+    await testExpression("false");
+  },
+  async function Number() {
+    await testExpression("123");
+    await testExpression("0.56");
+    await testExpression("-0");
+    await testExpression("+Infinity");
+    await testExpression("-Infinity");
+    await testExpression("NaN");
+  },
+  async function BigInt() {
+    await testExpression("123n");
+    await testExpression("1234567890n");
+  },
+  async function Symbol() {
+    await testExpression("Symbol('foo')");
+  },
+  async function Function() {
+    await testExpression("function qwe(){}");
+    await testExpression("()=>{}");
+  },
+  async function Array() {
+    await testExpression("[1,2,undefined]");
+    await testExpression("new Array(1,2,undefined)");
+  },
+  async function RegExp() {
+    await testExpression("new RegExp('ab+c')");
+    await testExpression("new RegExp('ab+c', 'ig')");
+  },
+  async function Date() {
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT')");
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT+1100')");
+    await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT-1100')");
+  },
+  async function Error() {
+    await testExpression("new Error()");
+    await testExpression("new Error('qwe')");
+  },
+  async function Map() {
+    await testExpression("new Map([['keyString1', {valueObject1: 1}], [{keyObject2: 2}, 'valueString2'], ['keyString3', new Array()]])");
+  },
+  async function WeakMap() {
+    await testExpression("new WeakMap([[{valueObject1: 1}, 'keyString1'],[{valueObject2: 2}, 'keyString2']])");
+  },
+  async function Set() {
+    await testExpression("new Set([{valueObject1: 1}, 'valueString2', new Array(), undefined])");
+  },
+  async function Weakset() {
+    await testExpression("new WeakSet([{valueObject1: 1}, {valueObject2: 2}])");
+  },
+  async function Proxy() {
+    await testExpression("new Proxy({}, ()=>{})");
+  },
+  async function Promise() {
+    await testExpression("new Promise(()=>{})");
+  },
+  async function Typedarray() {
+    await testExpression("new Uint16Array()");
+  },
+  async function ArrayBuffer() {
+    await testExpression("new ArrayBuffer()");
+  },
+  async function Duplicate() {
+    await testExpression("(()=>{const foo={a: []}; const bar=[1,2]; const result={1: foo, 2: foo, 3: bar, 4: bar}; result.self=result; return result; })()");
+  },
+  async function Object() {
+    // Object.
+    await testExpression("{nullKey: null, stringKey: 'foo',boolKey: true,numberKey: 123,bigintKey: 123n,symbolKey: Symbol('foo'),functionKey: () => {},arrayKey:[1],undefinedKey:undefined}");
+    // Object in-depth serialization.
+    await testExpression("{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}");
+ }]);
+
+async function testExpression(expression) {
+  const wrappedExpression = `(()=>{const a=${expression}; const b=${expression}; return [a,b,a,b,a,b]})()`
+  InspectorTest.logMessage("testing expression: "+expression);
+
+  InspectorTest.logMessage("Runtime.evaluate");
+  dumpResult(await Protocol.Runtime.evaluate({
+    expression: wrappedExpression,
+    generateWebDriverValue: true
+  }));
+}
+
+function dumpResult(result) {
+  if (result?.result?.result?.webDriverValue) {
+    InspectorTest.logMessage(result.result.result.webDriverValue);
+  } else {
+    InspectorTest.log("...no webDriverValue...");
+    InspectorTest.logMessage(result);
+  }
+}
diff --git a/deps/v8/test/inspector/runtime/generate-web-driver-value-expected.txt b/deps/v8/test/inspector/runtime/generate-web-driver-value-expected.txt
index 7706ebf198b628..4faf5f5d289c29 100644
--- a/deps/v8/test/inspector/runtime/generate-web-driver-value-expected.txt
+++ b/deps/v8/test/inspector/runtime/generate-web-driver-value-expected.txt
@@ -30,128 +30,119 @@ Runtime.callFunctionOn
     type : string
     value : foo
 }
-testing expression: [true, false]
+testing expression: true
 Runtime.evaluate
 {
-    type : array
-    value : [
-        [0] : {
-            type : boolean
-            value : true
-        }
-        [1] : {
-            type : boolean
-            value : false
-        }
-    ]
+    type : boolean
+    value : true
 }
 Runtime.callFunctionOn
 {
-    type : array
-    value : [
-        [0] : {
-            type : boolean
-            value : true
-        }
-        [1] : {
-            type : boolean
-            value : false
-        }
-    ]
+    type : boolean
+    value : true
+}
+testing expression: false
+Runtime.evaluate
+{
+    type : boolean
+    value : false
+}
+Runtime.callFunctionOn
+{
+    type : boolean
+    value : false
 }
 
 Running test: Number
-testing expression: [123, 0.56, -0, +Infinity, -Infinity, NaN]
+testing expression: 123
 Runtime.evaluate
 {
-    type : array
-    value : [
-        [0] : {
-            type : number
-            value : 123
-        }
-        [1] : {
-            type : number
-            value : 0.56
-        }
-        [2] : {
-            type : number
-            value : -0
-        }
-        [3] : {
-            type : number
-            value : Infinity
-        }
-        [4] : {
-            type : number
-            value : -Infinity
-        }
-        [5] : {
-            type : number
-            value : NaN
-        }
-    ]
+    type : number
+    value : 123
 }
 Runtime.callFunctionOn
 {
-    type : array
-    value : [
-        [0] : {
-            type : number
-            value : 123
-        }
-        [1] : {
-            type : number
-            value : 0.56
-        }
-        [2] : {
-            type : number
-            value : -0
-        }
-        [3] : {
-            type : number
-            value : Infinity
-        }
-        [4] : {
-            type : number
-            value : -Infinity
-        }
-        [5] : {
-            type : number
-            value : NaN
-        }
-    ]
+    type : number
+    value : 123
+}
+testing expression: 0.56
+Runtime.evaluate
+{
+    type : number
+    value : 0.56
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : 0.56
+}
+testing expression: -0
+Runtime.evaluate
+{
+    type : number
+    value : -0
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : -0
+}
+testing expression: +Infinity
+Runtime.evaluate
+{
+    type : number
+    value : Infinity
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : Infinity
+}
+testing expression: -Infinity
+Runtime.evaluate
+{
+    type : number
+    value : -Infinity
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : -Infinity
+}
+testing expression: NaN
+Runtime.evaluate
+{
+    type : number
+    value : NaN
+}
+Runtime.callFunctionOn
+{
+    type : number
+    value : NaN
 }
 
 Running test: BigInt
-testing expression: [123n, 1234567890n]
+testing expression: 123n
 Runtime.evaluate
 {
-    type : array
-    value : [
-        [0] : {
-            type : bigint
-            value : 123
-        }
-        [1] : {
-            type : bigint
-            value : 1234567890
-        }
-    ]
+    type : bigint
+    value : 123
 }
 Runtime.callFunctionOn
 {
-    type : array
-    value : [
-        [0] : {
-            type : bigint
-            value : 123
-        }
-        [1] : {
-            type : bigint
-            value : 1234567890
-        }
-    ]
+    type : bigint
+    value : 123
+}
+testing expression: 1234567890n
+Runtime.evaluate
+{
+    type : bigint
+    value : 1234567890
+}
+Runtime.callFunctionOn
+{
+    type : bigint
+    value : 1234567890
 }
 
 Running test: Symbol
@@ -166,30 +157,23 @@ Runtime.callFunctionOn
 }
 
 Running test: Function
-testing expression: [function qwe(){}, ()=>{}]
+testing expression: function qwe(){}
 Runtime.evaluate
 {
-    type : array
-    value : [
-        [0] : {
-            type : function
-        }
-        [1] : {
-            type : function
-        }
-    ]
+    type : function
 }
 Runtime.callFunctionOn
 {
-    type : array
-    value : [
-        [0] : {
-            type : function
-        }
-        [1] : {
-            type : function
-        }
-    ]
+    type : function
+}
+testing expression: ()=>{}
+Runtime.evaluate
+{
+    type : function
+}
+Runtime.callFunctionOn
+{
+    type : function
 }
 
 Running test: Array
@@ -265,44 +249,37 @@ Runtime.callFunctionOn
 }
 
 Running test: RegExp
-testing expression: [new RegExp('ab+c'), new RegExp('ab+c', 'ig')]
+testing expression: new RegExp('ab+c')
 Runtime.evaluate
 {
-    type : array
-    value : [
-        [0] : {
-            type : regexp
-            value : {
-                pattern : ab+c
-            }
-        }
-        [1] : {
-            type : regexp
-            value : {
-                flags : gi
-                pattern : ab+c
-            }
-        }
-    ]
+    type : regexp
+    value : {
+        pattern : ab+c
+    }
 }
 Runtime.callFunctionOn
 {
-    type : array
-    value : [
-        [0] : {
-            type : regexp
-            value : {
-                pattern : ab+c
-            }
-        }
-        [1] : {
-            type : regexp
-            value : {
-                flags : gi
-                pattern : ab+c
-            }
-        }
-    ]
+    type : regexp
+    value : {
+        pattern : ab+c
+    }
+}
+testing expression: new RegExp('ab+c', 'ig')
+Runtime.evaluate
+{
+    type : regexp
+    value : {
+        flags : gi
+        pattern : ab+c
+    }
+}
+Runtime.callFunctionOn
+{
+    type : regexp
+    value : {
+        flags : gi
+        pattern : ab+c
+    }
 }
 
 Running test: Date
@@ -341,30 +318,23 @@ Runtime.callFunctionOn
 }
 
 Running test: Error
-testing expression: [new Error(), new Error('qwe')]
+testing expression: new Error()
 Runtime.evaluate
 {
-    type : array
-    value : [
-        [0] : {
-            type : error
-        }
-        [1] : {
-            type : error
-        }
-    ]
+    type : error
 }
 Runtime.callFunctionOn
 {
-    type : array
-    value : [
-        [0] : {
-            type : error
-        }
-        [1] : {
-            type : error
-        }
-    ]
+    type : error
+}
+testing expression: new Error('qwe')
+Runtime.evaluate
+{
+    type : error
+}
+Runtime.callFunctionOn
+{
+    type : error
 }
 
 Running test: Map
@@ -531,6 +501,93 @@ Runtime.callFunctionOn
     type : arraybuffer
 }
 
+Running test: Duplicate
+testing expression: (()=>{const foo={a: []}; const bar=[1,2]; const result={1: foo, 2: foo, 3: bar, 4: bar}; result.self=result; return result; })()
+Runtime.evaluate
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : 1
+            [1] : {
+                type : object
+                weakLocalObjectReference : 1
+            }
+        ]
+        [1] : [
+            [0] : 2
+            [1] : {
+                type : object
+                weakLocalObjectReference : 1
+            }
+        ]
+        [2] : [
+            [0] : 3
+            [1] : {
+                type : array
+                weakLocalObjectReference : 2
+            }
+        ]
+        [3] : [
+            [0] : 4
+            [1] : {
+                type : array
+                weakLocalObjectReference : 2
+            }
+        ]
+        [4] : [
+            [0] : self
+            [1] : {
+                type : object
+                weakLocalObjectReference : 3
+            }
+        ]
+    ]
+    weakLocalObjectReference : 3
+}
+Runtime.callFunctionOn
+{
+    type : object
+    value : [
+        [0] : [
+            [0] : 1
+            [1] : {
+                type : object
+                weakLocalObjectReference : 1
+            }
+        ]
+        [1] : [
+            [0] : 2
+            [1] : {
+                type : object
+                weakLocalObjectReference : 1
+            }
+        ]
+        [2] : [
+            [0] : 3
+            [1] : {
+                type : array
+                weakLocalObjectReference : 2
+            }
+        ]
+        [3] : [
+            [0] : 4
+            [1] : {
+                type : array
+                weakLocalObjectReference : 2
+            }
+        ]
+        [4] : [
+            [0] : self
+            [1] : {
+                type : object
+                weakLocalObjectReference : 3
+            }
+        ]
+    ]
+    weakLocalObjectReference : 3
+}
+
 Running test: Object
 testing expression: {nullKey: null, stringKey: 'foo',boolKey: true,numberKey: 123,bigintKey: 123n,symbolKey: Symbol('foo'),functionKey: () => {},arrayKey:[1],undefinedKey:undefined}
 Runtime.evaluate
diff --git a/deps/v8/test/inspector/runtime/generate-web-driver-value.js b/deps/v8/test/inspector/runtime/generate-web-driver-value.js
index c8831c867d9cf3..7c5196b6688fe9 100644
--- a/deps/v8/test/inspector/runtime/generate-web-driver-value.js
+++ b/deps/v8/test/inspector/runtime/generate-web-driver-value.js
@@ -13,26 +13,35 @@ InspectorTest.runAsyncTestSuite([
     await testExpression("undefined");
     await testExpression("null");
     await testExpression("'foo'");
-    await testExpression("[true, false]");
+    await testExpression("true");
+    await testExpression("false");
   },
   async function Number() {
-    await testExpression("[123, 0.56, -0, +Infinity, -Infinity, NaN]");
+    await testExpression("123");
+    await testExpression("0.56");
+    await testExpression("-0");
+    await testExpression("+Infinity");
+    await testExpression("-Infinity");
+    await testExpression("NaN");
   },
   async function BigInt() {
-    await testExpression("[123n, 1234567890n]");
+    await testExpression("123n");
+    await testExpression("1234567890n");
   },
   async function Symbol() {
     await testExpression("Symbol('foo')");
   },
   async function Function() {
-    await testExpression("[function qwe(){}, ()=>{}]");
+    await testExpression("function qwe(){}");
+    await testExpression("()=>{}");
   },
   async function Array() {
     await testExpression("[1,2,undefined]");
     await testExpression("new Array(1,2,undefined)");
   },
   async function RegExp() {
-    await testExpression("[new RegExp('ab+c'), new RegExp('ab+c', 'ig')]");
+    await testExpression("new RegExp('ab+c')");
+    await testExpression("new RegExp('ab+c', 'ig')");
   },
   async function Date() {
     await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT')");
@@ -40,7 +49,8 @@ InspectorTest.runAsyncTestSuite([
     await testExpression("new Date('Thu Apr 07 2022 16:17:18 GMT-1100')");
   },
   async function Error() {
-    await testExpression("[new Error(), new Error('qwe')]");
+    await testExpression("new Error()");
+    await testExpression("new Error('qwe')");
   },
   async function Map() {
     await testExpression("new Map([['keyString1', {valueObject1: 1}], [{keyObject2: 2}, 'valueString2'], ['keyString3', new Array()]])");
@@ -66,6 +76,9 @@ InspectorTest.runAsyncTestSuite([
   async function ArrayBuffer() {
     await testExpression("new ArrayBuffer()");
   },
+  async function Duplicate() {
+    await testExpression("(()=>{const foo={a: []}; const bar=[1,2]; const result={1: foo, 2: foo, 3: bar, 4: bar}; result.self=result; return result; })()");
+  },
   async function Object() {
     // Object.
     await testExpression("{nullKey: null, stringKey: 'foo',boolKey: true,numberKey: 123,bigintKey: 123n,symbolKey: Symbol('foo'),functionKey: () => {},arrayKey:[1],undefinedKey:undefined}");
diff --git a/deps/v8/test/inspector/runtime/get-properties-expected.txt b/deps/v8/test/inspector/runtime/get-properties-expected.txt
index a200aab34fbda8..5841e5a6060f6d 100644
--- a/deps/v8/test/inspector/runtime/get-properties-expected.txt
+++ b/deps/v8/test/inspector/runtime/get-properties-expected.txt
@@ -111,10 +111,13 @@ Running test: testArrayBuffer
   Symbol(Symbol.toStringTag) own string ArrayBuffer
   byteLength own no value, getter
   constructor own function undefined
+  detached own no value, getter
   maxByteLength own no value, getter
   resizable own no value, getter
   resize own function undefined
   slice own function undefined
+  transfer own function undefined
+  transferToFixedLength own function undefined
 Internal properties
   [[Prototype]] object undefined
 [[Int8Array]]
@@ -159,10 +162,13 @@ Running test: testArrayBufferFromWebAssemblyMemory
   Symbol(Symbol.toStringTag) own string ArrayBuffer
   byteLength own no value, getter
   constructor own function undefined
+  detached own no value, getter
   maxByteLength own no value, getter
   resizable own no value, getter
   resize own function undefined
   slice own function undefined
+  transfer own function undefined
+  transferToFixedLength own function undefined
 Internal properties
   [[Prototype]] object undefined
 [[Int8Array]]
diff --git a/deps/v8/test/inspector/runtime/length-or-size-description.js b/deps/v8/test/inspector/runtime/length-or-size-description.js
index 8719a2685882e0..c75b93a32b8236 100644
--- a/deps/v8/test/inspector/runtime/length-or-size-description.js
+++ b/deps/v8/test/inspector/runtime/length-or-size-description.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 let {session, contextGroup, Protocol} = InspectorTest.start("Test that descriptions for arrays, maps, and sets include the correct length or size.");
 
 contextGroup.setupInjectedScriptEnvironment();
diff --git a/deps/v8/test/inspector/runtime/remote-object-expected.txt b/deps/v8/test/inspector/runtime/remote-object-expected.txt
index 765f8e26ef2451..d8dfc72b3569d2 100644
--- a/deps/v8/test/inspector/runtime/remote-object-expected.txt
+++ b/deps/v8/test/inspector/runtime/remote-object-expected.txt
@@ -2493,6 +2493,11 @@ Running test: testArrayBuffer
                     type : boolean
                     value : false
                 }
+                [3] : {
+                    name : detached
+                    type : boolean
+                    value : false
+                }
             ]
             subtype : arraybuffer
             type : object
@@ -2526,6 +2531,11 @@ Running test: testArrayBuffer
                     type : boolean
                     value : false
                 }
+                [3] : {
+                    name : detached
+                    type : boolean
+                    value : false
+                }
             ]
             subtype : arraybuffer
             type : object
diff --git a/deps/v8/test/inspector/runtime/serialization-options-expected.txt b/deps/v8/test/inspector/runtime/serialization-options-expected.txt
new file mode 100644
index 00000000000000..dd5ff1fc593ddf
--- /dev/null
+++ b/deps/v8/test/inspector/runtime/serialization-options-expected.txt
@@ -0,0 +1,546 @@
+RemoteObject.deepSerializedValue
+
+Running test: Object
+testing expression: {key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep"}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_2
+                                    [1] : {
+                                        type : object
+                                        value : [
+                                            [0] : [
+                                                [0] : key_level_3
+                                                [1] : {
+                                                    type : string
+                                                    value : value_level_3
+                                                }
+                                            ]
+                                        ]
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep"}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_2
+                                    [1] : {
+                                        type : object
+                                        value : [
+                                            [0] : [
+                                                [0] : key_level_3
+                                                [1] : {
+                                                    type : string
+                                                    value : value_level_3
+                                                }
+                                            ]
+                                        ]
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":0}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":0}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":1}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":1}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":2}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_2
+                                    [1] : {
+                                        type : object
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":2}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_2
+                                    [1] : {
+                                        type : object
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":999}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_2
+                                    [1] : {
+                                        type : object
+                                        value : [
+                                            [0] : [
+                                                [0] : key_level_3
+                                                [1] : {
+                                                    type : string
+                                                    value : value_level_3
+                                                }
+                                            ]
+                                        ]
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":999}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_2
+                                    [1] : {
+                                        type : object
+                                        value : [
+                                            [0] : [
+                                                [0] : key_level_3
+                                                [1] : {
+                                                    type : string
+                                                    value : value_level_3
+                                                }
+                                            ]
+                                        ]
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":999,"additionalParameters":{"foo":"bar","baz":"qux"}}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_2
+                                    [1] : {
+                                        type : object
+                                        value : [
+                                            [0] : [
+                                                [0] : key_level_3
+                                                [1] : {
+                                                    type : string
+                                                    value : value_level_3
+                                                }
+                                            ]
+                                        ]
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":999,"additionalParameters":{"foo":"bar","baz":"qux"}}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            deepSerializedValue : {
+                type : object
+                value : [
+                    [0] : [
+                        [0] : key_level_1
+                        [1] : {
+                            type : object
+                            value : [
+                                [0] : [
+                                    [0] : key_level_2
+                                    [1] : {
+                                        type : object
+                                        value : [
+                                            [0] : [
+                                                [0] : key_level_3
+                                                [1] : {
+                                                    type : string
+                                                    value : value_level_3
+                                                }
+                                            ]
+                                        ]
+                                    }
+                                ]
+                            ]
+                        }
+                    ]
+                ]
+            }
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":999,"additionalParameters":{"INCORRECT_ADDITIONAL_PARAMETER":{}}}
+{
+    error : {
+        code : -32602
+        message : Values of serializationOptions.additionalParameters can be only of type string or integer.
+    }
+    id : <messageId>
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"deep","maxDepth":999,"additionalParameters":{"INCORRECT_ADDITIONAL_PARAMETER":{}}}
+{
+    error : {
+        code : -32602
+        message : Values of serializationOptions.additionalParameters can be only of type string or integer.
+    }
+    id : <messageId>
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"json"}
+{
+    id : <messageId>
+    result : {
+        result : {
+            type : object
+            value : {
+                key_level_1 : {
+                    key_level_2 : {
+                        key_level_3 : value_level_3
+                    }
+                }
+            }
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"json"}
+{
+    id : <messageId>
+    result : {
+        result : {
+            type : object
+            value : {
+                key_level_1 : {
+                    key_level_2 : {
+                        key_level_3 : value_level_3
+                    }
+                }
+            }
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"json","maxDepth":1}
+{
+    id : <messageId>
+    result : {
+        result : {
+            type : object
+            value : {
+                key_level_1 : {
+                    key_level_2 : {
+                        key_level_3 : value_level_3
+                    }
+                }
+            }
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"json","maxDepth":1}
+{
+    id : <messageId>
+    result : {
+        result : {
+            type : object
+            value : {
+                key_level_1 : {
+                    key_level_2 : {
+                        key_level_3 : value_level_3
+                    }
+                }
+            }
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"idOnly"}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"idOnly"}
+{
+    id : <messageId>
+    result : {
+        result : {
+            className : Object
+            description : Object
+            objectId : <objectId>
+            type : object
+        }
+    }
+}
+Runtime.evaluate
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"INCORRECT_SERIALIZATION_TYPE"}
+{
+    error : {
+        code : -32602
+        message : Unknown serializationOptions.serialization value INCORRECT_SERIALIZATION_TYPE
+    }
+    id : <messageId>
+}
+Runtime.callFunctionOn
+expression: "{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}"
+serializationOptions: {"serialization":"INCORRECT_SERIALIZATION_TYPE"}
+{
+    error : {
+        code : -32602
+        message : Unknown serializationOptions.serialization value INCORRECT_SERIALIZATION_TYPE
+    }
+    id : <messageId>
+}
diff --git a/deps/v8/test/inspector/runtime/serialization-options.js b/deps/v8/test/inspector/runtime/serialization-options.js
new file mode 100644
index 00000000000000..b869263d5b8af3
--- /dev/null
+++ b/deps/v8/test/inspector/runtime/serialization-options.js
@@ -0,0 +1,75 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const { session, contextGroup, Protocol } =
+  InspectorTest.start('RemoteObject.deepSerializedValue');
+
+Protocol.Runtime.enable();
+Protocol.Runtime.onConsoleAPICalled(m => InspectorTest.logMessage(m));
+
+InspectorTest.runAsyncTestSuite([
+  async function Object() {
+    await testExpression("{key_level_1: {key_level_2: {key_level_3: 'value_level_3'}}}");
+  }]);
+
+async function testExpression(expression) {
+  InspectorTest.logMessage("testing expression: " + expression);
+
+  await testSerializationOptions(expression, { serialization: "deep" })
+  await testSerializationOptions(expression, { serialization: "deep", maxDepth: 0 })
+  await testSerializationOptions(expression, { serialization: "deep", maxDepth: 1 })
+  await testSerializationOptions(expression, { serialization: "deep", maxDepth: 2 })
+  await testSerializationOptions(expression, { serialization: "deep", maxDepth: 999 })
+  await testSerializationOptions(expression, {
+    serialization: "deep",
+    maxDepth: 999,
+    additionalParameters: {
+      "foo": "bar",
+      "baz": "qux"
+    }
+  });
+  await testSerializationOptions(expression, {
+    serialization: "deep",
+    maxDepth: 999,
+    additionalParameters: {
+      "INCORRECT_ADDITIONAL_PARAMETER": {}
+    }
+  });
+  await testSerializationOptions(expression, { serialization: "json" })
+  await testSerializationOptions(expression, { serialization: "json", maxDepth: 1 })
+  await testSerializationOptions(expression, { serialization: "idOnly" })
+  await testSerializationOptions(expression, { serialization: "INCORRECT_SERIALIZATION_TYPE" })
+}
+
+async function testSerializationOptions(expression, serializationOptions) {
+  InspectorTest.logMessage(await serializeViaEvaluate(expression, serializationOptions));
+  InspectorTest.logMessage(await serializeViaCallFunctionOn(expression, serializationOptions));
+}
+
+async function serializeViaEvaluate(expression, serializationOptions) {
+  InspectorTest.logMessage("Runtime.evaluate");
+  InspectorTest.logMessage(`expression: ${JSON.stringify(expression)}`);
+  InspectorTest.logMessage(`serializationOptions: ${JSON.stringify(serializationOptions)}`);
+
+  return await Protocol.Runtime.evaluate({
+    expression: "(" + expression + ")",
+    serializationOptions
+  });
+}
+
+async function serializeViaCallFunctionOn(expression, serializationOptions) {
+  const objectId = (await Protocol.Runtime.evaluate({
+    expression: "({})",
+  })).result.result.objectId;
+
+  InspectorTest.logMessage("Runtime.callFunctionOn");
+  InspectorTest.logMessage(`expression: ${JSON.stringify(expression)}`);
+  InspectorTest.logMessage(`serializationOptions: ${JSON.stringify(serializationOptions)}`);
+
+  return await Protocol.Runtime.callFunctionOn({
+    functionDeclaration: "()=>{return " + expression + "}",
+    objectId,
+    serializationOptions
+  });
+}
diff --git a/deps/v8/test/inspector/sessions/debugger-stepping-and-breakpoints-expected.txt b/deps/v8/test/inspector/sessions/debugger-stepping-and-breakpoints-expected.txt
index d6944a5fbd0c33..e8367eb7fdc263 100644
--- a/deps/v8/test/inspector/sessions/debugger-stepping-and-breakpoints-expected.txt
+++ b/deps/v8/test/inspector/sessions/debugger-stepping-and-breakpoints-expected.txt
@@ -116,12 +116,12 @@ Stepping into in 2
 Resumed in 1
 Resumed in 2
 Paused in 1:
-  reason: other
+  reason: step
   hit breakpoints: 
   location: stepping@18
   data: null
 Paused in 2:
-  reason: other
+  reason: step
   hit breakpoints: 
   location: stepping@18
   data: null
@@ -129,12 +129,12 @@ Stepping over in 1
 Resumed in 1
 Resumed in 2
 Paused in 1:
-  reason: other
+  reason: step
   hit breakpoints: 
   location: stepping@19
   data: null
 Paused in 2:
-  reason: other
+  reason: step
   hit breakpoints: 
   location: stepping@19
   data: null
@@ -142,12 +142,12 @@ Stepping out in 2
 Resumed in 1
 Resumed in 2
 Paused in 1:
-  reason: other
+  reason: step
   hit breakpoints: 
   location: <anonymous>@0
   data: null
 Paused in 2:
-  reason: other
+  reason: step
   hit breakpoints: 
   location: <anonymous>@0
   data: null
diff --git a/deps/v8/test/inspector/tasks.h b/deps/v8/test/inspector/tasks.h
index 9b909eb12ca162..3b3e68e2e05f93 100644
--- a/deps/v8/test/inspector/tasks.h
+++ b/deps/v8/test/inspector/tasks.h
@@ -136,30 +136,30 @@ class SetTimeoutExtension : public InspectorIsolateData::SetupGlobalTask {
   }
 
  private:
-  static void SetTimeout(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() != 2 || !args[1]->IsNumber() ||
-        (!args[0]->IsFunction() && !args[0]->IsString()) ||
-        args[1].As<v8::Number>()->Value() != 0.0) {
+  static void SetTimeout(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    if (info.Length() != 2 || !info[1]->IsNumber() ||
+        (!info[0]->IsFunction() && !info[0]->IsString()) ||
+        info[1].As<v8::Number>()->Value() != 0.0) {
       return;
     }
-    v8::Isolate* isolate = args.GetIsolate();
+    v8::Isolate* isolate = info.GetIsolate();
     v8::Local<v8::Context> context = isolate->GetCurrentContext();
     InspectorIsolateData* data = InspectorIsolateData::FromContext(context);
     int context_group_id = data->GetContextGroupId(context);
     const char* task_name = "setTimeout";
     v8_inspector::StringView task_name_view(
         reinterpret_cast<const uint8_t*>(task_name), strlen(task_name));
-    if (args[0]->IsFunction()) {
+    if (info[0]->IsFunction()) {
       RunAsyncTask(data->task_runner(), task_name_view,
                    std::make_unique<SetTimeoutTask>(
                        context_group_id, isolate,
-                       v8::Local<v8::Function>::Cast(args[0])));
+                       v8::Local<v8::Function>::Cast(info[0])));
     } else {
       RunAsyncTask(
           data->task_runner(), task_name_view,
           std::make_unique<ExecuteStringTask>(
               isolate, context_group_id,
-              ToVector(isolate, args[0].As<v8::String>()),
+              ToVector(isolate, info[0].As<v8::String>()),
               v8::String::Empty(isolate), v8::Integer::New(isolate, 0),
               v8::Integer::New(isolate, 0), v8::Boolean::New(isolate, false)));
     }
diff --git a/deps/v8/test/inspector/testcfg.py b/deps/v8/test/inspector/testcfg.py
index 4419169e5c0664..6dd8717d216ddb 100644
--- a/deps/v8/test/inspector/testcfg.py
+++ b/deps/v8/test/inspector/testcfg.py
@@ -42,15 +42,15 @@ def __init__(self, *args, **kwargs):
 
   def _get_files_params(self):
     return [
-      os.path.join(self.suite.root, PROTOCOL_TEST_JS),
-      os.path.join(self.suite.root, self.path + self._get_suffix()),
+      self.suite.root / PROTOCOL_TEST_JS,
+      self.suite.root / self.path_js,
     ]
 
   def _get_source_flags(self):
     return self._source_flags
 
   def _get_source_path(self):
-    return os.path.join(self.suite.root, self.path + self._get_suffix())
+    return self.suite.root / self.path_js
 
   def get_shell(self):
     return 'inspector-test'
@@ -58,14 +58,13 @@ def get_shell(self):
   def get_android_resources(self):
     super_resources = super().get_android_resources()
     return super_resources + [
-        os.path.join('test', 'inspector', 'debugger', 'resources',
-                     'break-locations.js'),
-        os.path.join('test', 'inspector', WASM_INSPECTOR_JS),
+        self.suite.root /'debugger' /'resources' /'break-locations.js',
+        self.suite.root / WASM_INSPECTOR_JS,
     ]
 
   @property
   def output_proc(self):
     return outproc.ExpectedOutProc(
         self.expected_outcomes,
-        os.path.join(self.suite.root, self.path) + EXPECTED_SUFFIX,
+        self.suite.root / self.path_and_suffix(EXPECTED_SUFFIX),
         self.test_config.regenerate_expected_files)
diff --git a/deps/v8/test/intl/date-format/constructor-date-style-order.js b/deps/v8/test/intl/date-format/constructor-date-style-order.js
index 7d6f2a46dbf75f..68b7889540e174 100644
--- a/deps/v8/test/intl/date-format/constructor-date-style-order.js
+++ b/deps/v8/test/intl/date-format/constructor-date-style-order.js
@@ -10,6 +10,7 @@ let weekday = new Array();
 let year = new Array();
 let month = new Array();
 let day = new Array();
+let dayPeriod = new Array();
 let hour = new Array();
 let minute = new Array();
 let second = new Array();
@@ -20,6 +21,7 @@ let dateStyle = new Array();
 let timeStyle = new Array();
 let timeZone = new Array();
 let era = new Array();
+let fractionalSecondDigits = new Array();
 let timeZoneName = new Array();
 let formatMatcher = new Array();
 
@@ -36,6 +38,9 @@ new Intl.DateTimeFormat(['en-US'], {
   get day() {
     day.push(++getCount);
   },
+  get dayPeriod() {
+    dayPeriod.push(++getCount);
+  },
   get hour() {
     hour.push(++getCount);
   },
@@ -70,68 +75,51 @@ new Intl.DateTimeFormat(['en-US'], {
   get timeZoneName() {
     timeZoneName.push(++getCount);
   },
+  get fractionalSecondDigits() {
+    fractionalSecondDigits.push(++getCount);
+  },
   get formatMatcher() {
     formatMatcher.push(++getCount);
   }
 });
 
-// Read by ToDateTimeOptions and also in Table 1
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
-assertEquals(2, weekday.length);
-assertEquals(2, year.length);
-assertEquals(2, month.length);
-assertEquals(2, day.length);
-assertEquals(2, hour.length);
-assertEquals(2, minute.length);
-assertEquals(2, second.length);
-
-// In Table 1
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
+assertEquals(1, weekday.length);
+assertEquals(1, hour.length);
+assertEquals(1, minute.length);
+assertEquals(1, second.length);
+assertEquals(1, year.length);
+assertEquals(1, month.length);
+assertEquals(1, day.length);
 assertEquals(1, era.length);
 assertEquals(1, timeZoneName.length);
-
-// Read by ToDateTimeOptions and InitializeDateTimeFormat
-assertEquals(2, dateStyle.length);
-assertEquals(2, timeStyle.length);
-
-// Only read by InitializeDateTimeFormat
+assertEquals(1, dateStyle.length);
+assertEquals(1, timeStyle.length);
 assertEquals(1, localeMatcher.length);
 assertEquals(1, hour12.length);
 assertEquals(1, hourCycle.length);
 assertEquals(1, timeZone.length);
 assertEquals(1, formatMatcher.length);
 
-// ToDateTimeOptions
-assertEquals(1, weekday[0]);
-assertEquals(2, year[0]);
-assertEquals(3, month[0]);
-assertEquals(4, day[0]);
-assertEquals(5, hour[0]);
-assertEquals(6, minute[0]);
-assertEquals(7, second[0]);
-assertEquals(8, dateStyle[0]);
-assertEquals(9, timeStyle[0]);
-
 // InitializeDateTimeFormat
-assertEquals(10, localeMatcher[0]);
-assertEquals(11, hour12[0]);
-assertEquals(12, hourCycle[0]);
-assertEquals(13, timeZone[0]);
+assertEquals(1, localeMatcher[0]);
+assertEquals(2, hour12[0]);
+assertEquals(3, hourCycle[0]);
+assertEquals(4, timeZone[0]);
 
-// Table 1 loop in InitializeDateTimeFormat
-assertEquals(14, weekday[1]);
-assertEquals(15, era[0]);
-assertEquals(16, year[1]);
-assertEquals(17, month[1]);
-assertEquals(18, day[1]);
-assertEquals(19, hour[1]);
-assertEquals(20, minute[1]);
-assertEquals(21, second[1]);
-assertEquals(22, timeZoneName[0]);
+assertEquals(5, weekday[0]);
+assertEquals(6, era[0]);
+assertEquals(7, year[0]);
+assertEquals(8, month[0]);
+assertEquals(9, day[0]);
+assertEquals(10, dayPeriod[0]);
+assertEquals(11, hour[0]);
+assertEquals(12, minute[0]);
+assertEquals(13, second[0]);
+assertEquals(14, fractionalSecondDigits[0]);
+assertEquals(15, timeZoneName[0]);
 
-// After the Table 1 loop in InitializeDateTimeFormat
-assertEquals(23, formatMatcher[0]);
-assertEquals(24, dateStyle[1]);
-assertEquals(25, timeStyle[1]);
+assertEquals(16, formatMatcher[0]);
+assertEquals(17, dateStyle[0]);
+assertEquals(18, timeStyle[0]);
 
-assertEquals(25, getCount);
+assertEquals(18, getCount);
diff --git a/deps/v8/test/intl/date-format/constructor-date-time-style-order.js b/deps/v8/test/intl/date-format/constructor-date-time-style-order.js
index 3bdfa7d28e1ec1..a0b977a8487bbe 100644
--- a/deps/v8/test/intl/date-format/constructor-date-time-style-order.js
+++ b/deps/v8/test/intl/date-format/constructor-date-time-style-order.js
@@ -10,6 +10,7 @@ let weekday = new Array();
 let year = new Array();
 let month = new Array();
 let day = new Array();
+let dayPeriod = new Array();
 let hour = new Array();
 let minute = new Array();
 let second = new Array();
@@ -20,6 +21,7 @@ let dateStyle = new Array();
 let timeStyle = new Array();
 let timeZone = new Array();
 let era = new Array();
+let fractionalSecondDigits = new Array();
 let timeZoneName = new Array();
 let formatMatcher = new Array();
 
@@ -36,6 +38,9 @@ new Intl.DateTimeFormat(['en-US'], {
   get day() {
     day.push(++getCount);
   },
+  get dayPeriod() {
+    dayPeriod.push(++getCount);
+  },
   get hour() {
     hour.push(++getCount);
   },
@@ -71,68 +76,51 @@ new Intl.DateTimeFormat(['en-US'], {
   get timeZoneName() {
     timeZoneName.push(++getCount);
   },
+  get fractionalSecondDigits() {
+    fractionalSecondDigits.push(++getCount);
+  },
   get formatMatcher() {
     formatMatcher.push(++getCount);
   }
 });
 
-// Read by ToDateTimeOptions and also in Table 1
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
-assertEquals(2, weekday.length);
-assertEquals(2, year.length);
-assertEquals(2, month.length);
-assertEquals(2, day.length);
-assertEquals(2, hour.length);
-assertEquals(2, minute.length);
-assertEquals(2, second.length);
-
-// In Table 1
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
+assertEquals(1, weekday.length);
+assertEquals(1, hour.length);
+assertEquals(1, minute.length);
+assertEquals(1, second.length);
+assertEquals(1, year.length);
+assertEquals(1, month.length);
+assertEquals(1, day.length);
 assertEquals(1, era.length);
 assertEquals(1, timeZoneName.length);
-
-// Read by ToDateTimeOptions and InitializeDateTimeFormat
-assertEquals(2, dateStyle.length);
-assertEquals(2, timeStyle.length);
-
-// Only read by InitializeDateTimeFormat
+assertEquals(1, dateStyle.length);
+assertEquals(1, timeStyle.length);
 assertEquals(1, localeMatcher.length);
 assertEquals(1, hour12.length);
 assertEquals(1, hourCycle.length);
 assertEquals(1, timeZone.length);
 assertEquals(1, formatMatcher.length);
 
-// ToDateTimeOptions
-assertEquals(1, weekday[0]);
-assertEquals(2, year[0]);
-assertEquals(3, month[0]);
-assertEquals(4, day[0]);
-assertEquals(5, hour[0]);
-assertEquals(6, minute[0]);
-assertEquals(7, second[0]);
-assertEquals(8, dateStyle[0]);
-assertEquals(9, timeStyle[0]);
-
 // InitializeDateTimeFormat
-assertEquals(10, localeMatcher[0]);
-assertEquals(11, hour12[0]);
-assertEquals(12, hourCycle[0]);
-assertEquals(13, timeZone[0]);
+assertEquals(1, localeMatcher[0]);
+assertEquals(2, hour12[0]);
+assertEquals(3, hourCycle[0]);
+assertEquals(4, timeZone[0]);
 
-// Table 1 loop in InitializeDateTimeFormat
-assertEquals(14, weekday[1]);
-assertEquals(15, era[0]);
-assertEquals(16, year[1]);
-assertEquals(17, month[1]);
-assertEquals(18, day[1]);
-assertEquals(19, hour[1]);
-assertEquals(20, minute[1]);
-assertEquals(21, second[1]);
-assertEquals(22, timeZoneName[0]);
+assertEquals(5, weekday[0]);
+assertEquals(6, era[0]);
+assertEquals(7, year[0]);
+assertEquals(8, month[0]);
+assertEquals(9, day[0]);
+assertEquals(10, dayPeriod[0]);
+assertEquals(11, hour[0]);
+assertEquals(12, minute[0]);
+assertEquals(13, second[0]);
+assertEquals(14, fractionalSecondDigits[0]);
+assertEquals(15, timeZoneName[0]);
 
-// After the Table 1 loop in InitializeDateTimeFormat
-assertEquals(23, formatMatcher[0]);
-assertEquals(24, dateStyle[1]);
-assertEquals(25, timeStyle[1]);
+assertEquals(16, formatMatcher[0]);
+assertEquals(17, dateStyle[0]);
+assertEquals(18, timeStyle[0]);
 
-assertEquals(25, getCount);
+assertEquals(18, getCount);
diff --git a/deps/v8/test/intl/date-format/constructor-no-style-order.js b/deps/v8/test/intl/date-format/constructor-no-style-order.js
index d894ef4e2b28cd..554e893623fe14 100644
--- a/deps/v8/test/intl/date-format/constructor-no-style-order.js
+++ b/deps/v8/test/intl/date-format/constructor-no-style-order.js
@@ -10,6 +10,7 @@ let weekday = new Array();
 let year = new Array();
 let month = new Array();
 let day = new Array();
+let dayPeriod = new Array();
 let hour = new Array();
 let minute = new Array();
 let second = new Array();
@@ -22,6 +23,7 @@ let timeZone = new Array();
 let era = new Array();
 let timeZoneName = new Array();
 let formatMatcher = new Array();
+let fractionalSecondDigits = new Array();
 
 new Intl.DateTimeFormat(['en-US'], {
   get weekday() {
@@ -36,6 +38,9 @@ new Intl.DateTimeFormat(['en-US'], {
   get day() {
     day.push(++getCount);
   },
+  get dayPeriod() {
+    dayPeriod.push(++getCount);
+  },
   get hour() {
     hour.push(++getCount);
   },
@@ -71,66 +76,49 @@ new Intl.DateTimeFormat(['en-US'], {
   },
   get formatMatcher() {
     formatMatcher.push(++getCount);
+  },
+  get fractionalSecondDigits() {
+    fractionalSecondDigits.push(++getCount);
   }
 });
 
-// Read by ToDateTimeOptions and also in Table 1
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
-assertEquals(2, weekday.length);
-assertEquals(2, hour.length);
-assertEquals(2, minute.length);
-assertEquals(2, second.length);
-
-// Read by ToDateTimeOptions and also overwrite with a default 'numeric'
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
+assertEquals(1, weekday.length);
+assertEquals(1, hour.length);
+assertEquals(1, minute.length);
+assertEquals(1, second.length);
 assertEquals(1, year.length);
 assertEquals(1, month.length);
 assertEquals(1, day.length);
-
-// In Table 1
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
 assertEquals(1, era.length);
 assertEquals(1, timeZoneName.length);
-
-// Read by ToDateTimeOptions and InitializeDateTimeFormat
-assertEquals(2, dateStyle.length);
-assertEquals(2, timeStyle.length);
-
-// Only read by InitializeDateTimeFormat
+assertEquals(1, dateStyle.length);
+assertEquals(1, timeStyle.length);
 assertEquals(1, localeMatcher.length);
 assertEquals(1, hour12.length);
 assertEquals(1, hourCycle.length);
 assertEquals(1, timeZone.length);
 assertEquals(1, formatMatcher.length);
 
-// ToDateTimeOptions
-assertEquals(1, weekday[0]);
-assertEquals(2, year[0]);
-assertEquals(3, month[0]);
-assertEquals(4, day[0]);
-assertEquals(5, hour[0]);
-assertEquals(6, minute[0]);
-assertEquals(7, second[0]);
-assertEquals(8, dateStyle[0]);
-assertEquals(9, timeStyle[0]);
-
 // InitializeDateTimeFormat
-assertEquals(10, localeMatcher[0]);
-assertEquals(11, hour12[0]);
-assertEquals(12, hourCycle[0]);
-assertEquals(13, timeZone[0]);
+assertEquals(1, localeMatcher[0]);
+assertEquals(2, hour12[0]);
+assertEquals(3, hourCycle[0]);
+assertEquals(4, timeZone[0]);
 
-// Table 1 loop in InitializeDateTimeFormat
-assertEquals(14, weekday[1]);
-assertEquals(15, era[0]);
-assertEquals(16, hour[1]);
-assertEquals(17, minute[1]);
-assertEquals(18, second[1]);
-assertEquals(19, timeZoneName[0]);
+assertEquals(5, weekday[0]);
+assertEquals(6, era[0]);
+assertEquals(7, year[0]);
+assertEquals(8, month[0]);
+assertEquals(9, day[0]);
+assertEquals(10, dayPeriod[0]);
+assertEquals(11, hour[0]);
+assertEquals(12, minute[0]);
+assertEquals(13, second[0]);
+assertEquals(14, fractionalSecondDigits[0]);
+assertEquals(15, timeZoneName[0]);
 
-// After the Table 1 loop in InitializeDateTimeFormat
-assertEquals(20, formatMatcher[0]);
-assertEquals(21, dateStyle[1]);
-assertEquals(22, timeStyle[1]);
+assertEquals(16, formatMatcher[0]);
+assertEquals(17, dateStyle[0]);
+assertEquals(18, timeStyle[0]);
 
-assertEquals(22, getCount);
+assertEquals(18, getCount);
diff --git a/deps/v8/test/intl/date-format/constructor-order.js b/deps/v8/test/intl/date-format/constructor-order.js
deleted file mode 100644
index 54f37966295073..00000000000000
--- a/deps/v8/test/intl/date-format/constructor-order.js
+++ /dev/null
@@ -1,100 +0,0 @@
-// Copyright 2018 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Throws only once during construction.
-// Check for all getters to prevent regression.
-// Preserve the order of getter initialization.
-let getCount = 0;
-let weekday = new Array();
-let year = new Array();
-let month = new Array();
-let day = new Array();
-let hour = new Array();
-let minute = new Array();
-let second = new Array();
-let localeMatcher = new Array();
-let hour12 = new Array();
-let hourCycle = new Array();
-let timeZone = new Array();
-let era = new Array();
-let timeZoneName = new Array();
-let formatMatcher = new Array();
-
-new Intl.DateTimeFormat(['en-US'], {
-  get weekday() {
-    weekday.push(++getCount);
-  },
-  get year() {
-    year.push(++getCount);
-  },
-  get month() {
-    month.push(++getCount);
-  },
-  get day() {
-    day.push(++getCount);
-  },
-  get hour() {
-    hour.push(++getCount);
-  },
-  get minute() {
-    minute.push(++getCount);
-  },
-  get second() {
-    second.push(++getCount);
-  },
-  get localeMatcher() {
-    localeMatcher.push(++getCount);
-  },
-  get hour12() {
-    hour12.push(++getCount);
-  },
-  get hourCycle() {
-    hourCycle.push(++getCount);
-  },
-  get timeZone() {
-    timeZone.push(++getCount);
-  },
-  get era() {
-    era.push(++getCount);
-  },
-  get timeZoneName() {
-    timeZoneName.push(++getCount);
-  },
-  get formatMatcher() {
-    formatMatcher.push(++getCount);
-  }
-});
-
-assertEquals(2, weekday.length);
-assertEquals(1, weekday[0]);
-assertEquals(1, year.length);
-assertEquals(2, year[0]);
-assertEquals(1, month.length);
-assertEquals(3, month[0]);
-assertEquals(1, day.length);
-assertEquals(4, day[0]);
-assertEquals(2, hour.length);
-assertEquals(5, hour[0]);
-assertEquals(2, minute.length);
-assertEquals(6, minute[0]);
-assertEquals(2, second.length);
-assertEquals(7, second[0]);
-assertEquals(1, localeMatcher.length);
-assertEquals(8, localeMatcher[0]);
-assertEquals(1, hour12.length);
-assertEquals(9, hour12[0]);
-assertEquals(1, hourCycle.length);
-assertEquals(10, hourCycle[0]);
-assertEquals(1, timeZone.length);
-assertEquals(11, timeZone[0]);
-assertEquals(12, weekday[1]);
-assertEquals(1, era.length);
-assertEquals(13, era[0]);
-assertEquals(14, hour[1]);
-assertEquals(15, minute[1]);
-assertEquals(16, second[1]);
-assertEquals(1, timeZoneName.length);
-assertEquals(17, timeZoneName[0]);
-assertEquals(1, formatMatcher.length);
-assertEquals(18, formatMatcher[0]);
diff --git a/deps/v8/test/intl/date-format/constructor-time-style-order.js b/deps/v8/test/intl/date-format/constructor-time-style-order.js
index dd61db5e707fd3..7e20cb0d252c7c 100644
--- a/deps/v8/test/intl/date-format/constructor-time-style-order.js
+++ b/deps/v8/test/intl/date-format/constructor-time-style-order.js
@@ -10,6 +10,7 @@ let weekday = new Array();
 let year = new Array();
 let month = new Array();
 let day = new Array();
+let dayPeriod = new Array();
 let hour = new Array();
 let minute = new Array();
 let second = new Array();
@@ -22,6 +23,7 @@ let timeZone = new Array();
 let era = new Array();
 let timeZoneName = new Array();
 let formatMatcher = new Array();
+let fractionalSecondDigits = new Array();
 
 new Intl.DateTimeFormat(['en-US'], {
   get weekday() {
@@ -36,6 +38,9 @@ new Intl.DateTimeFormat(['en-US'], {
   get day() {
     day.push(++getCount);
   },
+  get dayPeriod() {
+    dayPeriod.push(++getCount);
+  },
   get hour() {
     hour.push(++getCount);
   },
@@ -72,66 +77,49 @@ new Intl.DateTimeFormat(['en-US'], {
   },
   get formatMatcher() {
     formatMatcher.push(++getCount);
+  },
+  get fractionalSecondDigits() {
+    fractionalSecondDigits.push(++getCount);
   }
 });
 
-// Read by ToDateTimeOptions and also in Table 1
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
-assertEquals(2, weekday.length);
-assertEquals(2, year.length);
-assertEquals(2, month.length);
-assertEquals(2, day.length);
-assertEquals(2, hour.length);
-assertEquals(2, minute.length);
-assertEquals(2, second.length);
-
-// In Table 1
-// https://tc39.es/proposal-intl-datetime-style/#table-datetimeformat-components
+assertEquals(1, weekday.length);
+assertEquals(1, hour.length);
+assertEquals(1, minute.length);
+assertEquals(1, second.length);
+assertEquals(1, year.length);
+assertEquals(1, month.length);
+assertEquals(1, day.length);
 assertEquals(1, era.length);
 assertEquals(1, timeZoneName.length);
-
-// Read by ToDateTimeOptions and InitializeDateTimeFormat
-assertEquals(2, dateStyle.length);
-assertEquals(2, timeStyle.length);
-
-// Only read by InitializeDateTimeFormat
+assertEquals(1, dateStyle.length);
+assertEquals(1, timeStyle.length);
 assertEquals(1, localeMatcher.length);
 assertEquals(1, hour12.length);
 assertEquals(1, hourCycle.length);
 assertEquals(1, timeZone.length);
 assertEquals(1, formatMatcher.length);
 
-// ToDateTimeOptions
-assertEquals(1, weekday[0]);
-assertEquals(2, year[0]);
-assertEquals(3, month[0]);
-assertEquals(4, day[0]);
-assertEquals(5, hour[0]);
-assertEquals(6, minute[0]);
-assertEquals(7, second[0]);
-assertEquals(8, dateStyle[0]);
-assertEquals(9, timeStyle[0]);
-
 // InitializeDateTimeFormat
-assertEquals(10, localeMatcher[0]);
-assertEquals(11, hour12[0]);
-assertEquals(12, hourCycle[0]);
-assertEquals(13, timeZone[0]);
+assertEquals(1, localeMatcher[0]);
+assertEquals(2, hour12[0]);
+assertEquals(3, hourCycle[0]);
+assertEquals(4, timeZone[0]);
 
-// Table 1 loop in InitializeDateTimeFormat
-assertEquals(14, weekday[1]);
-assertEquals(15, era[0]);
-assertEquals(16, year[1]);
-assertEquals(17, month[1]);
-assertEquals(18, day[1]);
-assertEquals(19, hour[1]);
-assertEquals(20, minute[1]);
-assertEquals(21, second[1]);
-assertEquals(22, timeZoneName[0]);
+assertEquals(5, weekday[0]);
+assertEquals(6, era[0]);
+assertEquals(7, year[0]);
+assertEquals(8, month[0]);
+assertEquals(9, day[0]);
+assertEquals(10, dayPeriod[0]);
+assertEquals(11, hour[0]);
+assertEquals(12, minute[0]);
+assertEquals(13, second[0]);
+assertEquals(14, fractionalSecondDigits[0]);
+assertEquals(15, timeZoneName[0]);
 
-// After the Table 1 loop in InitializeDateTimeFormat
-assertEquals(23, formatMatcher[0]);
-assertEquals(24, dateStyle[1]);
-assertEquals(25, timeStyle[1]);
+assertEquals(16, formatMatcher[0]);
+assertEquals(17, dateStyle[0]);
+assertEquals(18, timeStyle[0]);
 
-assertEquals(25, getCount);
+assertEquals(18, getCount);
diff --git a/deps/v8/test/intl/duration-format/format-basic-digital.js b/deps/v8/test/intl/duration-format/format-basic-digital.js
new file mode 100644
index 00000000000000..b5810cd2f8a3ec
--- /dev/null
+++ b/deps/v8/test/intl/duration-format/format-basic-digital.js
@@ -0,0 +1,105 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+// Flags: --harmony-intl-duration-format
+
+let h1 = {hours: 1};
+let m2 = {minutes: 2};
+let s3 = {seconds: 3};
+let ms45 = {milliseconds: 45};
+
+let df = new Intl.DurationFormat("en", {style: "digital"});
+assertEquals("1:00:00", df.format(h1));
+assertEquals(
+    '[{"type":"integer","value":"1","unit":"hour"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"00","unit":"minute"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"00","unit":"second"}]',
+     JSON.stringify(df.formatToParts(h1)));
+assertEquals("0:02:00", df.format(m2));
+assertEquals(
+    '[{"type":"integer","value":"0","unit":"hour"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"02","unit":"minute"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"00","unit":"second"}]',
+     JSON.stringify(df.formatToParts(m2)));
+assertEquals("0:00:03", df.format(s3));
+assertEquals(
+    '[{"type":"integer","value":"0","unit":"hour"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"00","unit":"minute"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"03","unit":"second"}]',
+     JSON.stringify(df.formatToParts(s3)));
+assertEquals("0:00:00", df.format(ms45));
+assertEquals(
+    '[{"type":"integer","value":"0","unit":"hour"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"00","unit":"minute"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"00","unit":"second"}]',
+     JSON.stringify(df.formatToParts(ms45)));
+
+// With 4 fractional digits
+let dffd4 = new Intl.DurationFormat("en", {style: "digital", fractionalDigits: 4});
+assertEquals("0:00:00.0450", dffd4.format(ms45));
+assertEquals(
+    '[{"type":"integer","value":"0","unit":"hour"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"00","unit":"minute"},'+
+     '{"type":"literal","value":":"},'+
+     '{"type":"integer","value":"00","unit":"second"},'+
+     '{"type":"decimal","value":".","unit":"second"},'+
+     '{"type":"fraction","value":"0450","unit":"second"}]',
+     JSON.stringify(dffd4.formatToParts(ms45)));
+
+// Danish locale use . as separator
+let dadf = new Intl.DurationFormat("da", {style: "digital"});
+assertEquals("1.00.00", dadf.format(h1));
+assertEquals(
+    '[{"type":"integer","value":"1","unit":"hour"},'+
+     '{"type":"literal","value":"."},'+
+     '{"type":"integer","value":"00","unit":"minute"},'+
+     '{"type":"literal","value":"."},'+
+     '{"type":"integer","value":"00","unit":"second"}]',
+     JSON.stringify(dadf.formatToParts(h1)));
+assertEquals("0.02.00", dadf.format(m2));
+assertEquals(
+    '[{"type":"integer","value":"0","unit":"hour"},'+
+     '{"type":"literal","value":"."},'+
+     '{"type":"integer","value":"02","unit":"minute"},'+
+     '{"type":"literal","value":"."},'+
+     '{"type":"integer","value":"00","unit":"second"}]',
+     JSON.stringify(dadf.formatToParts(m2)));
+assertEquals("0.00.03", dadf.format(s3));
+assertEquals(
+    '[{"type":"integer","value":"0","unit":"hour"},'+
+     '{"type":"literal","value":"."},'+
+     '{"type":"integer","value":"00","unit":"minute"},'+
+     '{"type":"literal","value":"."},'+
+     '{"type":"integer","value":"03","unit":"second"}]',
+     JSON.stringify(dadf.formatToParts(s3)));
+
+let dadffd4 = new Intl.DurationFormat("da", {style: "digital", fractionalDigits: 4});
+assertEquals("0.00.00,0450", dadffd4.format(ms45));
+assertEquals(
+    '[{"type":"integer","value":"0","unit":"hour"},'+
+     '{"type":"literal","value":"."},'+
+     '{"type":"integer","value":"00","unit":"minute"},'+
+     '{"type":"literal","value":"."},'+
+     '{"type":"integer","value":"00","unit":"second"},'+
+     '{"type":"decimal","value":",","unit":"second"},'+
+     '{"type":"fraction","value":"0450","unit":"second"}]',
+     JSON.stringify(dadffd4.formatToParts(ms45)));
+
+let autodf = new Intl.DurationFormat("en", {style: "digital", hoursDisplay: "auto", minutesDisplay: "auto", secondsDisplay: "auto"});
+assertEquals("1", autodf.format(h1));
+assertEquals("02", autodf.format(m2));
+assertEquals("03", autodf.format(s3));
+
+let autodf2 = new Intl.DurationFormat("en", {style: "digital", hoursDisplay: "auto", secondsDisplay: "auto"});
+assertEquals("1:00", autodf2.format(h1));
+assertEquals("02", autodf2.format(m2));
+assertEquals("00:03", autodf2.format(s3));
diff --git a/deps/v8/test/intl/intl.status b/deps/v8/test/intl/intl.status
index 6dbb9d3e834c34..6b84727b8147b3 100644
--- a/deps/v8/test/intl/intl.status
+++ b/deps/v8/test/intl/intl.status
@@ -40,9 +40,9 @@
 }],  # mode == debug
 
 ##############################################################################
-['no_i18n', {
+['not i18n', {
   'string-localecompare': [SKIP],
-}],  # no_i18n
+}],  # not i18n
 
 ################################################################################
 ['gc_stress', {
diff --git a/deps/v8/test/intl/locale/locale-calendars.js b/deps/v8/test/intl/locale/locale-getCalendars.js
similarity index 72%
rename from deps/v8/test/intl/locale/locale-calendars.js
rename to deps/v8/test/intl/locale/locale-getCalendars.js
index e3dde03b20a916..508f62aeb060e1 100644
--- a/deps/v8/test/intl/locale/locale-calendars.js
+++ b/deps/v8/test/intl/locale/locale-getCalendars.js
@@ -1,17 +1,18 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+// Flags: --harmony-intl-locale-info-func
 
-// Test the return items of calendars fit 'type'
+// Test the return items of getCalendars() fit 'type'
 let a_to_z = "abcdefghijklmnopqrstuvwxyz";
 let regex = /^[a-zA-Z0-9]{3,8}(-[a-zA-Z0-9]{3,8})*$/;
 for (var i = 0; i < a_to_z.length; i++) {
   for (var j = 0; j < a_to_z.length; j++) {
     let l = a_to_z[i] + a_to_z[j];
     let locale = new Intl.Locale(l);
-    locale.calendars.forEach(function(tokens) {
+    locale.getCalendars().forEach(function(tokens) {
       assertTrue(regex.test(tokens),
-          locale + ".calendars [" + locale.calendars +
+          locale + ".getCalendars [" + locale.getCalendars() +
           "]  but '" + tokens + "' does not meet 'type: alphanum{3,8}(sep alphanum{3,8})*'");
     });
   }
diff --git a/deps/v8/test/intl/locale/locale-collations.js b/deps/v8/test/intl/locale/locale-getCollations.js
similarity index 66%
rename from deps/v8/test/intl/locale/locale-collations.js
rename to deps/v8/test/intl/locale/locale-getCollations.js
index 96c19989306aa1..479a2b40b3872a 100644
--- a/deps/v8/test/intl/locale/locale-collations.js
+++ b/deps/v8/test/intl/locale/locale-getCollations.js
@@ -1,8 +1,9 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+// Flags: --harmony-intl-locale-info-func
 
-// Test the return items of collations fit 'type'
+// Test the return items of getCollations() fit 'type'
 let a_to_z = "abcdefghijklmnopqrstuvwxyz";
 let regex = /^[a-zA-Z0-9]{3,8}(-[a-zA-Z0-9]{3,8})*$/;
 for (var i = 0; i < a_to_z.length; i++) {
@@ -10,11 +11,11 @@ for (var i = 0; i < a_to_z.length; i++) {
     let l = a_to_z[i] + a_to_z[j];
     let locale = new Intl.Locale(l);
     print(locale);
-    locale.collations.forEach(function(tokens) {
+    locale.getCollations().forEach(function(tokens) {
       assertTrue(regex.test(tokens),
-          locale + ".collations [" + locale.collations +
+          locale + ".collations [" + locale.getCollations() +
           "] does not meet 'type: alphanum{3,8}(sep alphanum{3,8})*'");
     });
-    assertArrayEquals(locale.collations, locale.collations.sort());
+    assertArrayEquals(locale.getCollations(), locale.getCollations().sort());
   }
 }
diff --git a/deps/v8/test/intl/locale/locale-info-check-property.js b/deps/v8/test/intl/locale/locale-info-check-property.js
index 76d219b3610a36..b95217af323ad0 100644
--- a/deps/v8/test/intl/locale/locale-info-check-property.js
+++ b/deps/v8/test/intl/locale/locale-info-check-property.js
@@ -1,21 +1,20 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
-
-// Check getter properties against the spec.
+// Flags: --harmony-intl-locale-info-func
+// Check function properties against the spec.
 function checkProperties(property) {
   let desc = Object.getOwnPropertyDescriptor(Intl.Locale.prototype, property);
-  assertEquals(`get ${property}`, desc.get.name);
-  assertEquals('function', typeof desc.get)
-  assertEquals(undefined, desc.set);
+  assertEquals('function', typeof desc.value)
   assertFalse(desc.enumerable);
   assertTrue(desc.configurable);
+  assertTrue(desc.writable);
 }
 
-checkProperties('calendars');
-checkProperties('collations');
-checkProperties('hourCycles');
-checkProperties('numberingSystems');
-checkProperties('textInfo');
-checkProperties('timeZones');
-checkProperties('weekInfo');
+checkProperties('getCalendars');
+checkProperties('getCollations');
+checkProperties('getHourCycles');
+checkProperties('getNumberingSystems');
+checkProperties('getTextInfo');
+checkProperties('getTimeZones');
+checkProperties('getWeekInfo');
diff --git a/deps/v8/test/intl/locale/locale-info-check-return-types.js b/deps/v8/test/intl/locale/locale-info-check-return-types.js
index a2b9033c131ce7..e0e4ab167c5faf 100644
--- a/deps/v8/test/intl/locale/locale-info-check-return-types.js
+++ b/deps/v8/test/intl/locale/locale-info-check-return-types.js
@@ -1,33 +1,34 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+// Flags: --harmony-intl-locale-info-func
 
 function checkLocale(locale) {
   let l = new Intl.Locale(locale);
-  assertTrue(Array.isArray(l.calendars));
-  assertTrue(Array.isArray(l.collations));
-  assertTrue(Array.isArray(l.hourCycles));
-  assertTrue(Array.isArray(l.numberingSystems));
+  assertTrue(Array.isArray(l.getCalendars()));
+  assertTrue(Array.isArray(l.getCollations()));
+  assertTrue(Array.isArray(l.getHourCycles()));
+  assertTrue(Array.isArray(l.getNumberingSystems()));
 
   if (l.region == undefined) {
-    assertEquals(undefined, l.timeZones);
+    assertEquals(undefined, l.getTimeZones());
   } else {
-    assertTrue(Array.isArray(l.timeZones));
+    assertTrue(Array.isArray(l.getTimeZones()));
   }
 
-  assertEquals("object", typeof(l.textInfo));
-  assertEquals(1, Object.keys(l.textInfo).length);
-  assertEquals("string", typeof(l.textInfo.direction));
+  assertEquals("object", typeof(l.getTextInfo()));
+  assertEquals(1, Object.keys(l.getTextInfo()).length);
+  assertEquals("string", typeof(l.getTextInfo().direction));
 
-  assertEquals("object", typeof(l.weekInfo));
-  assertEquals(3, Object.keys(l.weekInfo).length);
-  assertEquals("number", typeof(l.weekInfo.firstDay));
-  assertTrue(l.weekInfo.firstDay >= 1);
-  assertTrue(l.weekInfo.firstDay <= 7);
+  assertEquals("object", typeof(l.getWeekInfo()));
+  assertEquals(3, Object.keys(l.getWeekInfo()).length);
+  assertEquals("number", typeof(l.getWeekInfo().firstDay));
+  assertTrue(l.getWeekInfo().firstDay >= 1);
+  assertTrue(l.getWeekInfo().firstDay <= 7);
 
-  assertEquals("object", typeof(l.weekInfo.weekend));
+  assertEquals("object", typeof(l.getWeekInfo().weekend));
   let last = 0;
-  l.weekInfo.weekend.forEach((we) => {
+  l.getWeekInfo().weekend.forEach((we) => {
     // In right range
     assertTrue(we >= 1);
     assertTrue(we <= 7);
@@ -36,9 +37,9 @@ function checkLocale(locale) {
     last = we;
   });
 
-  assertEquals("number", typeof(l.weekInfo.minimalDays));
-  assertTrue(l.weekInfo.minimalDays >= 1);
-  assertTrue(l.weekInfo.minimalDays <= 7);
+  assertEquals("number", typeof(l.getWeekInfo().minimalDays));
+  assertTrue(l.getWeekInfo().minimalDays >= 1);
+  assertTrue(l.getWeekInfo().minimalDays <= 7);
 }
 
 checkLocale("ar");
diff --git a/deps/v8/test/intl/locale/locale-info-ext.js b/deps/v8/test/intl/locale/locale-info-ext.js
index c0ca81a3be537f..3858d12a458371 100644
--- a/deps/v8/test/intl/locale/locale-info-ext.js
+++ b/deps/v8/test/intl/locale/locale-info-ext.js
@@ -1,24 +1,25 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+// Flags: --harmony-intl-locale-info-func
 
 // Test Unicode extension.
 function testExt(base, ukey, uvalue, property) {
   let baseLocale = new Intl.Locale(base);
   let extLocale = new Intl.Locale(base + "-u-" + ukey + "-" + uvalue);
 
-  let baseActual = baseLocale[property];
+  let baseActual = baseLocale[property]();
   assertTrue(Array.isArray(baseActual));
   assertTrue(baseActual.length > 0);
   assertFalse(uvalue == baseActual[0]);
 
-  let extActual = extLocale[property];
+  let extActual = extLocale[property]();
   assertTrue(Array.isArray(extActual));
   assertEquals(1, extActual.length);
   assertEquals(uvalue, extActual[0]);
 }
 
-testExt("ar", "ca", "roc", "calendars");
-testExt("fr", "nu", "thai", "numberingSystems");
-testExt("th", "co", "pinyin", "collations");
-testExt("ko", "hc", "h11", "hourCycles");
+testExt("ar", "ca", "roc", "getCalendars");
+testExt("fr", "nu", "thai", "getNumberingSystems");
+testExt("th", "co", "pinyin", "getCollations");
+testExt("ko", "hc", "h11", "getHourCycles");
diff --git a/deps/v8/test/intl/locale/locale-info-gettextinfo.js b/deps/v8/test/intl/locale/locale-info-gettextinfo.js
new file mode 100644
index 00000000000000..4c2eaf552c2962
--- /dev/null
+++ b/deps/v8/test/intl/locale/locale-info-gettextinfo.js
@@ -0,0 +1,22 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+// Flags: --harmony-intl-locale-info-func
+// Check direction of minority right-to-left languages
+
+assertEquals('rtl', (new Intl.Locale("ar")).getTextInfo().direction, "ar");
+assertEquals('rtl', (new Intl.Locale("fa")).getTextInfo().direction, "fa");
+assertEquals('rtl', (new Intl.Locale("ae")).getTextInfo().direction, "ae");
+assertEquals('rtl', (new Intl.Locale("arc")).getTextInfo().direction, "arc");
+assertEquals('rtl', (new Intl.Locale("bcc")).getTextInfo().direction, "bcc");
+assertEquals('rtl', (new Intl.Locale("bqi")).getTextInfo().direction, "bqi");
+assertEquals('rtl', (new Intl.Locale("dv")).getTextInfo().direction, "dv");
+assertEquals('rtl', (new Intl.Locale("glk")).getTextInfo().direction, "glk");
+assertEquals('rtl', (new Intl.Locale("mzn")).getTextInfo().direction, "mzn");
+assertEquals('rtl', (new Intl.Locale("nqo")).getTextInfo().direction, "nqo");
+assertEquals('rtl', (new Intl.Locale("pnb")).getTextInfo().direction, "pnb");
+assertEquals('rtl', (new Intl.Locale("sd")).getTextInfo().direction, "sd");
+assertEquals('rtl', (new Intl.Locale("ug")).getTextInfo().direction, "ug");
+assertEquals('rtl', (new Intl.Locale("yi")).getTextInfo().direction, "yi");
+assertEquals('ltr', (new Intl.Locale("ku")).getTextInfo().direction, "ku");
+assertEquals('rtl', (new Intl.Locale("ku-Arab")).getTextInfo().direction, "ku-Arab");
diff --git a/deps/v8/test/intl/locale/locale-info-no-undefined.js b/deps/v8/test/intl/locale/locale-info-no-undefined.js
index 1284be7f2093da..9e0e119f209c09 100644
--- a/deps/v8/test/intl/locale/locale-info-no-undefined.js
+++ b/deps/v8/test/intl/locale/locale-info-no-undefined.js
@@ -1,6 +1,7 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+// Flags: --harmony-intl-locale-info-func
 
 // Check the return array has no undefined
 function checkNoUndefined(l, items) {
@@ -10,12 +11,12 @@ function checkNoUndefined(l, items) {
 }
 function checkLocale(locale) {
   let l = new Intl.Locale(locale)
-  checkNoUndefined(l, l.calendars);
-  checkNoUndefined(l, l.collations);
-  checkNoUndefined(l, l.hourCycles);
-  checkNoUndefined(l, l.numberingSystems);
+  checkNoUndefined(l, l.getCalendars());
+  checkNoUndefined(l, l.getCollations());
+  checkNoUndefined(l, l.getHourCycles());
+  checkNoUndefined(l, l.getNumberingSystems());
   if (l.region != undefined) {
-    checkNoUndefined(l, l.timeZones);
+    checkNoUndefined(l, l.getTimeZones());
   }
 }
 
diff --git a/deps/v8/test/intl/locale/locale-info-timezones-sorted.js b/deps/v8/test/intl/locale/locale-info-timezones-sorted.js
index 60f1ffe81863b7..fafbfa78e7b8d1 100644
--- a/deps/v8/test/intl/locale/locale-info-timezones-sorted.js
+++ b/deps/v8/test/intl/locale/locale-info-timezones-sorted.js
@@ -1,6 +1,7 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+// Flags: --harmony-intl-locale-info-func
 
 // Check the return array are sorted
 function checkSortedArray(l, name, items) {
@@ -9,7 +10,7 @@ function checkSortedArray(l, name, items) {
 }
 function checkLocale(locale) {
   let l = new Intl.Locale(locale)
-  checkSortedArray(l, "timeZones", l.timeZones);
+  checkSortedArray(l, "getTimeZones", l.getTimeZones());
 }
 
 checkLocale("ar-EG");
diff --git a/deps/v8/test/intl/locale/locale-numberingSystems.js b/deps/v8/test/intl/locale/locale-numberingSystems.js
index 82941647e157d1..9ff6b185924f89 100644
--- a/deps/v8/test/intl/locale/locale-numberingSystems.js
+++ b/deps/v8/test/intl/locale/locale-numberingSystems.js
@@ -1,6 +1,7 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
+// Flags: --harmony-intl-locale-info-func
 
 // Test the return items of numberingSystems fit 'type'
 let a_to_z = "abcdefghijklmnopqrstuvwxyz";
@@ -9,9 +10,9 @@ for (var i = 0; i < a_to_z.length; i++) {
   for (var j = 0; j < a_to_z.length; j++) {
     let l = a_to_z[i] + a_to_z[j];
     let locale = new Intl.Locale(l);
-    locale.numberingSystems.forEach(function(tokens) {
+    locale.getNumberingSystems().forEach(function(tokens) {
       assertTrue(regex.test(tokens),
-          locale + ".numberingSystems [" + locale.numberingSystems +
+          locale + ".numberingSystems [" + locale.getNumberingSystems() +
           "] does not meet 'type: alphanum{3,8}(sep alphanum{3,8})*'");
     });
   }
diff --git a/deps/v8/test/intl/number-format/check-digit-ranges.js b/deps/v8/test/intl/number-format/check-digit-ranges.js
index 50f0437d59d651..a039fa8a15dddc 100644
--- a/deps/v8/test/intl/number-format/check-digit-ranges.js
+++ b/deps/v8/test/intl/number-format/check-digit-ranges.js
@@ -36,7 +36,7 @@ assertThrows('Intl.NumberFormat(undefined, {minimumIntegerDigits: -Infinity})');
 assertThrows('Intl.NumberFormat(undefined, {minimumIntegerDigits: x})');
 
 assertThrows('Intl.NumberFormat(undefined, {minimumFractionDigits: -1})');
-assertThrows('Intl.NumberFormat(undefined, {maximumFractionDigits: 21})');
+assertThrows('Intl.NumberFormat(undefined, {maximumFractionDigits: 101})');
 
 assertThrows('Intl.NumberFormat(undefined, {minimumSignificantDigits: 0})');
 assertThrows('Intl.NumberFormat(undefined, {minimumSignificantDigits: 22})');
@@ -50,7 +50,7 @@ assertDoesNotThrow('Intl.NumberFormat(undefined, {minimumIntegerDigits: 1})');
 assertDoesNotThrow('Intl.NumberFormat(undefined, {minimumIntegerDigits: 21})');
 
 assertDoesNotThrow('Intl.NumberFormat(undefined, {minimumFractionDigits: 0})');
-assertDoesNotThrow('Intl.NumberFormat(undefined, {minimumFractionDigits: 20})');
+assertDoesNotThrow('Intl.NumberFormat(undefined, {minimumFractionDigits: 100})');
 
 assertDoesNotThrow('Intl.NumberFormat(undefined, ' +
     '{minimumSignificantDigits: 1})');
diff --git a/deps/v8/test/intl/number-format/format-range-numbering-system.js b/deps/v8/test/intl/number-format/format-range-numbering-system.js
index 8cb0ff18a59b7d..b46220c5b482e9 100644
--- a/deps/v8/test/intl/number-format/format-range-numbering-system.js
+++ b/deps/v8/test/intl/number-format/format-range-numbering-system.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let latn = new Intl.NumberFormat("en", {numberingSystem: "latn"})
 assertDoesNotThrow(() => latn.formatRange(1, 234));
 
diff --git a/deps/v8/test/intl/number-format/format-range-string.js b/deps/v8/test/intl/number-format/format-range-string.js
index fc3e027b96dc7b..3e8d3ba829b4d8 100644
--- a/deps/v8/test/intl/number-format/format-range-string.js
+++ b/deps/v8/test/intl/number-format/format-range-string.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 // Test the throw in formatRange
 
 let df = new Intl.NumberFormat();
diff --git a/deps/v8/test/intl/number-format/format-range-v3.js b/deps/v8/test/intl/number-format/format-range-v3.js
index a8485f8978bc94..d25060e6a204ff 100644
--- a/deps/v8/test/intl/number-format/format-range-v3.js
+++ b/deps/v8/test/intl/number-format/format-range-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 const validRanges = [[-12345, -5678], [-12345, 56789], [12345, 56789]];
 
 const nf = new Intl.NumberFormat("en", {signDisplay: "exceptZero"});
diff --git a/deps/v8/test/intl/number-format/format-string.js b/deps/v8/test/intl/number-format/format-string.js
index 6e95faa1441aaa..4e9599821d45d2 100644
--- a/deps/v8/test/intl/number-format/format-string.js
+++ b/deps/v8/test/intl/number-format/format-string.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let nf = new Intl.NumberFormat("en");
 // Basic case
 assertEquals("123", nf.format("123"));
diff --git a/deps/v8/test/intl/number-format/options-digits-v3.js b/deps/v8/test/intl/number-format/options-digits-v3.js
index 4588a89aaa7a5e..8a1cfaba673032 100644
--- a/deps/v8/test/intl/number-format/options-digits-v3.js
+++ b/deps/v8/test/intl/number-format/options-digits-v3.js
@@ -2,9 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Test v3 condiction
-// Flags: --harmony-intl-number-format-v3
-
 function assertPresentOfDigits(
     options, expectSignificant, expectFractional, user_message) {
   if (expectSignificant) {
diff --git a/deps/v8/test/intl/number-format/options-digits.js b/deps/v8/test/intl/number-format/options-digits.js
deleted file mode 100644
index d632348ddd01d9..00000000000000
--- a/deps/v8/test/intl/number-format/options-digits.js
+++ /dev/null
@@ -1,64 +0,0 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Test v2 condiction
-// Flags: --no-harmony-intl-number-format-v3
-
-function assertPresentOfDigits(
-    options, expectSignificant, expectFractional, user_message) {
-  if (expectSignificant) {
-    assertNotUndefined(options.minimumSignificantDigits, user_message);
-    assertNotUndefined(options.maximumSignificantDigits, user_message);
-  } else {
-    assertEquals(undefined, options.minimumSignificantDigits, user_message);
-    assertEquals(undefined, options.maximumSignificantDigits, user_message);
-  }
-  if (expectFractional) {
-    assertNotUndefined(options.minimumFractionDigits, user_message);
-    assertNotUndefined(options.maximumFractionDigits, user_message);
-  } else {
-    assertEquals(undefined, options.minimumFractionDigits, user_message);
-    assertEquals(undefined, options.maximumFractionDigits, user_message);
-  }
-}
-
-// Should contain ONLY significant digits (both v2 and v3)
-let options = new Intl.NumberFormat("und",
-    { maximumSignificantDigits: 3 }).resolvedOptions();
-assertPresentOfDigits(options, true, false,
-    "maximumSignificantDigits: 3");
-
-// Should contain ONLY fraction digits (both v2 and v3)
-options = new Intl.NumberFormat("und",
-    { maximumFractionDigits: 3 }).resolvedOptions();
-assertPresentOfDigits(options, false, true,
-    "maximumFractionDigits: 3");
-
-// in v2, this should NOT have EITHER significant nor fraction digits
-// in v3, should contain BOTH significant and fraction digits, plus
-// roundingPriority
-options = new Intl.NumberFormat("und",
-    { notation: "compact" }).resolvedOptions();
-assertPresentOfDigits(options, false, false, "notation: 'compact'");
-
-// in v2, should contain ONLY significant digits
-// in v3, should contain BOTH significant and fraction digits, plus
-// roundingPriority
-options = new Intl.NumberFormat("und",
-    { maximumSignificantDigits: 3, maximumFractionDigits: 3,
-      roundingPriority: "morePrecision" }).resolvedOptions();
-assertPresentOfDigits(options, true, false,
-    "roundingPriority: 'morePrecision'");
-
-// Should contain ONLY fraction digits (both v2 and v3)
-options = new Intl.NumberFormat('en',
-    { style: 'currency', currency: 'USD' }).resolvedOptions();
-assertPresentOfDigits(options, false, true,
-    "style: 'currency', currency: 'USD'");
-
-// Should contain ONLY fraction digits (both v2 and v3)
-options = new Intl.NumberFormat('en',
-    { style: 'currency', currency: 'JPY' }).resolvedOptions();
-assertPresentOfDigits(options, false, true,
-    "style: 'currency', currency: 'JPY'");
diff --git a/deps/v8/test/intl/number-format/resolved-options-order.js b/deps/v8/test/intl/number-format/resolved-options-order.js
new file mode 100644
index 00000000000000..23d36ec68a1268
--- /dev/null
+++ b/deps/v8/test/intl/number-format/resolved-options-order.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// https://tc39.es/ecma402/#table-numberformat-resolvedoptions-properties
+assertEquals(
+    "locale," +
+    "numberingSystem," +
+    "style," +
+    "minimumIntegerDigits," +
+    "minimumFractionDigits," +
+    "maximumFractionDigits," +
+    "useGrouping," +
+    "notation," +
+    "signDisplay," +
+    "roundingMode," +
+    "roundingIncrement," +
+    "roundingPriority," +
+    "trailingZeroDisplay",
+    Object.keys((new Intl.NumberFormat("en")).resolvedOptions()).join(","));
diff --git a/deps/v8/test/intl/number-format/rounding-increment-resolved-match-v3.js b/deps/v8/test/intl/number-format/rounding-increment-resolved-match-v3.js
index 8eaace0ea66a57..86a98e0795256b 100644
--- a/deps/v8/test/intl/number-format/rounding-increment-resolved-match-v3.js
+++ b/deps/v8/test/intl/number-format/rounding-increment-resolved-match-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let validRoundingIncrements = [
   1, 2, 5, 10, 20, 25, 50, 100, 200, 250, 500, 1000, 2000, 2500, 5000];
 let maximumFractionDigits = 3;
diff --git a/deps/v8/test/intl/number-format/rounding-increment-v3.js b/deps/v8/test/intl/number-format/rounding-increment-v3.js
index b6805d39d69915..d7db09958c9d2a 100644
--- a/deps/v8/test/intl/number-format/rounding-increment-v3.js
+++ b/deps/v8/test/intl/number-format/rounding-increment-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let validRoundingIncrements = [
   1, 2, 5, 10, 20, 25, 50, 100, 200, 250, 500, 1000, 2000, 2500, 5000];
 
diff --git a/deps/v8/test/intl/number-format/rounding-increment-value-v3.js b/deps/v8/test/intl/number-format/rounding-increment-value-v3.js
index a6693fb1555e5c..7a1ac87fd369ff 100644
--- a/deps/v8/test/intl/number-format/rounding-increment-value-v3.js
+++ b/deps/v8/test/intl/number-format/rounding-increment-value-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let penny = new Intl.NumberFormat(
     "en", { minimumFractionDigits: 2, maximumFractionDigits: 2, roundingIncrement: 1 });
 let nickel = new Intl.NumberFormat(
diff --git a/deps/v8/test/intl/number-format/rounding-mode-table-v3.js b/deps/v8/test/intl/number-format/rounding-mode-table-v3.js
index 72af49eb9de0b4..69ff3d24efc913 100644
--- a/deps/v8/test/intl/number-format/rounding-mode-table-v3.js
+++ b/deps/v8/test/intl/number-format/rounding-mode-table-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 // Check the rounding behavior.
 // Based on https://tc39.es/proposal-intl-numberformat-v3/out/numberformat/diff.html#table-intl-rounding-modes
 let inputs = [-1.5, 0.4, 0.5, 0.6, 1.5];
diff --git a/deps/v8/test/intl/number-format/rounding-mode-v3.js b/deps/v8/test/intl/number-format/rounding-mode-v3.js
index 0a1425ced0e94e..268f26746716d3 100644
--- a/deps/v8/test/intl/number-format/rounding-mode-v3.js
+++ b/deps/v8/test/intl/number-format/rounding-mode-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let validRoundingMode = [
     "ceil",
     "floor",
@@ -57,4 +55,4 @@ let options = {
 };
 
 assertDoesNotThrow(() => new Intl.NumberFormat(undefined, options));
-assertEquals("signDisplay,roundingMode", read.join(","));
+assertEquals("roundingMode,signDisplay", read.join(","));
diff --git a/deps/v8/test/intl/number-format/sign-display-v3.js b/deps/v8/test/intl/number-format/sign-display-v3.js
index 6345517ec446e0..8d032ca5c514ea 100644
--- a/deps/v8/test/intl/number-format/sign-display-v3.js
+++ b/deps/v8/test/intl/number-format/sign-display-v3.js
@@ -1,8 +1,6 @@
 // Copyright 2021 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
-//
-// Flags: --harmony-intl-number-format-v3
 
 // Test default.
 let nf = new Intl.NumberFormat();
diff --git a/deps/v8/test/intl/number-format/trailing-zero-display-resolved-options-v3.js b/deps/v8/test/intl/number-format/trailing-zero-display-resolved-options-v3.js
index d21f682f917020..7f7ad4e4c9268f 100644
--- a/deps/v8/test/intl/number-format/trailing-zero-display-resolved-options-v3.js
+++ b/deps/v8/test/intl/number-format/trailing-zero-display-resolved-options-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let defaultFmt = new Intl.NumberFormat("en",
     { minimumFractionDigits: 2, maximumFractionDigits: 2 });
 let autoFmt = new Intl.NumberFormat("en",
diff --git a/deps/v8/test/intl/number-format/trailing-zero-display-v3.js b/deps/v8/test/intl/number-format/trailing-zero-display-v3.js
index ef3d03ef6ec3f8..bfd996232dc843 100644
--- a/deps/v8/test/intl/number-format/trailing-zero-display-v3.js
+++ b/deps/v8/test/intl/number-format/trailing-zero-display-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let defaultFmt = new Intl.NumberFormat("en",
     { minimumFractionDigits: 2, maximumFractionDigits: 2 });
 let autoFmt = new Intl.NumberFormat("en",
diff --git a/deps/v8/test/intl/number-format/use-grouping-v3.js b/deps/v8/test/intl/number-format/use-grouping-v3.js
index 0b1f7686d5ac66..e8aa84bba3646d 100644
--- a/deps/v8/test/intl/number-format/use-grouping-v3.js
+++ b/deps/v8/test/intl/number-format/use-grouping-v3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
-
 let validUseGrouping = [
     "min2",
     "auto",
diff --git a/deps/v8/test/intl/plural-rules/select-range.js b/deps/v8/test/intl/plural-rules/select-range.js
index 0b651742306f1b..7462f26563e5b1 100644
--- a/deps/v8/test/intl/plural-rules/select-range.js
+++ b/deps/v8/test/intl/plural-rules/select-range.js
@@ -2,6 +2,5 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-intl-number-format-v3
 const pl = new Intl.PluralRules("sl");
 assertEquals("few", pl.selectRange(102, 201));
diff --git a/deps/v8/test/intl/regress-10438.js b/deps/v8/test/intl/regress-10438.js
index a1bdf36f70d348..6116513317ea89 100644
--- a/deps/v8/test/intl/regress-10438.js
+++ b/deps/v8/test/intl/regress-10438.js
@@ -44,10 +44,10 @@ assertThrows(
     () => (new Intl.DateTimeFormat(
         "en", {timeStyle: "short", fractionalSecondDigits: 3})),
     TypeError,
-    "Can't set option fractionalSecondDigits when timeStyle is used");
+    "Invalid option : option");
 
 assertThrows(
     () => (new Intl.DateTimeFormat(
         "en", {dateStyle: "short", fractionalSecondDigits: 3})),
     TypeError,
-    "Can't set option fractionalSecondDigits when dateStyle is used");
+    "Invalid option : option");
diff --git a/deps/v8/test/intl/regress-10613.js b/deps/v8/test/intl/regress-10613.js
index 55e04e9c912532..278f378683e02d 100644
--- a/deps/v8/test/intl/regress-10613.js
+++ b/deps/v8/test/intl/regress-10613.js
@@ -26,10 +26,10 @@ testTimeStyle.timeStyle = 'long';
 for (key of keys) {
   assertThrows(
       () => new Intl.DateTimeFormat('en', testDateStyle),
-      TypeError, "Can't set option " +  key + " when dateStyle is used");
+      TypeError, "Invalid option : option");
   assertThrows(
       () => new Intl.DateTimeFormat('en', testTimeStyle),
-      TypeError, "Can't set option " +  key + " when timeStyle is used");
+      TypeError, "Invalid option : option");
   testDateStyle[key] = undefined;
   testTimeStyle[key] = undefined;
 }
@@ -61,5 +61,5 @@ try {
 }
 
 assertEquals(
-    "get timeStyle,get timeZoneName,get timeStyle,TypeError",
+    "get timeZoneName,get timeStyle,TypeError",
     logs.join(','));
diff --git a/deps/v8/test/intl/regress-10836.js b/deps/v8/test/intl/regress-10836.js
index fe85eaf221ab6a..d24706e6073e65 100644
--- a/deps/v8/test/intl/regress-10836.js
+++ b/deps/v8/test/intl/regress-10836.js
@@ -41,5 +41,5 @@ let options = {
 
 df = new Intl.DateTimeFormat("en", options);
 assertEquals(
-    "second:fractionalSecondDigits:second:fractionalSecondDigits:timeZoneName",
+    "second:fractionalSecondDigits:timeZoneName",
     read.join(":"));
diff --git a/deps/v8/test/intl/regress-1336865.js b/deps/v8/test/intl/regress-1336865.js
index 3214862b40cd57..f8e5a9123ee294 100644
--- a/deps/v8/test/intl/regress-1336865.js
+++ b/deps/v8/test/intl/regress-1336865.js
@@ -1,7 +1,6 @@
 // Copyright 2022 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
-// Flags: --harmony-intl-number-format-v3
 
 let nf = new Intl.NumberFormat();
 let actual1 = nf.formatRangeToParts(1, 1);
diff --git a/deps/v8/test/intl/regress-1427932.js b/deps/v8/test/intl/regress-1427932.js
new file mode 100644
index 00000000000000..889015e111e861
--- /dev/null
+++ b/deps/v8/test/intl/regress-1427932.js
@@ -0,0 +1,5 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+assertThrows(() => Intl.DateTimeFormat("de-u-22300-true-x-true"), RangeError);
diff --git a/deps/v8/test/intl/regress-1451943.js b/deps/v8/test/intl/regress-1451943.js
new file mode 100644
index 00000000000000..de7db0a6217bb7
--- /dev/null
+++ b/deps/v8/test/intl/regress-1451943.js
@@ -0,0 +1,19 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+let beforeOct1582GregorianTransition = new Date('1582-01-01T00:00Z');
+let afterOct1582GregorianTransition = new Date('1583-01-01T00:00Z');
+
+// Gregorian (proleptic) calendar
+assertEquals(
+    beforeOct1582GregorianTransition.toLocaleDateString('en-US', { timeZone: 'UTC', calendar: 'gregory' }),
+    "1/1/1582");
+// ISO 8601 calendar output before Oct 1582 Gregorian transition
+assertEquals(
+    beforeOct1582GregorianTransition.toLocaleDateString('en-US', { timeZone: 'UTC', calendar: 'iso8601' }),
+    "1/1/1582");
+// ISO 8601 calendar output after the Gregorian transition
+assertEquals(
+    afterOct1582GregorianTransition.toLocaleDateString('en-US', { timeZone: 'UTC', calendar: 'iso8601' }),
+    "1/1/1583");
diff --git a/deps/v8/test/intl/string-localecompare.js b/deps/v8/test/intl/string-localecompare.js
index 794a2d13d82250..07854b4af5b673 100644
--- a/deps/v8/test/intl/string-localecompare.js
+++ b/deps/v8/test/intl/string-localecompare.js
@@ -34,6 +34,10 @@ function check() {
     assertEquals('ch'.localeCompare('ca', 'cs-CZ'), 1);
     assertEquals('AA'.localeCompare('A-A', 'th'), 0);
 
+    // Invalid locales. Executed on slow path.
+    assertTrue("asdf".localeCompare("asdf", 0) == 0);
+    assertTrue("asdf".localeCompare("asdf", NaN) == 0);
+
     // Attempt to hit different cases of the localeCompare fast path.
     assertEquals('aAaaaö'.localeCompare('aaaaaö', 'en-US'), 1);
     assertEquals('aaaaaöA'.localeCompare('aaaaaöa', 'en-US'), 1);
diff --git a/deps/v8/test/intl/testcfg.py b/deps/v8/test/intl/testcfg.py
index d8acad5033c791..b0b9b87cfd9dca 100644
--- a/deps/v8/test/intl/testcfg.py
+++ b/deps/v8/test/intl/testcfg.py
@@ -73,11 +73,9 @@ def _get_cmd_env(self):
 
   def _get_files_params(self):
     files = [
-      os.path.join(self.suite.root, f) for f in [
-        'assert.js',
-        'utils.js',
-        self.path + self._get_suffix(),
-      ]
+      self.suite.root / 'assert.js',
+      self.suite.root / 'utils.js',
+      self.suite.root / self.path_js,
     ]
 
     if self.test_config.isolates:
@@ -91,4 +89,4 @@ def _get_suite_flags(self):
     return ['--allow-natives-syntax']
 
   def _get_source_path(self):
-    return os.path.join(self.suite.root, self.path + self._get_suffix())
+    return self.suite.root / self.path_js
diff --git a/deps/v8/test/js-perf-test/JSTests5.json b/deps/v8/test/js-perf-test/JSTests5.json
index e53e60c6edbd9b..23199a7b1218fa 100644
--- a/deps/v8/test/js-perf-test/JSTests5.json
+++ b/deps/v8/test/js-perf-test/JSTests5.json
@@ -286,10 +286,13 @@
       "tests": [
         {"name": "Babel"},
         {"name": "BabelAndOverwrite"},
+        {"name": "BabelAndExtend"},
         {"name": "ObjectAssign"},
         {"name": "ObjectAssignAndOverwrite"},
+        {"name": "ObjectAssignAndExtend"},
         {"name": "ObjectSpread"},
-        {"name": "ObjectSpreadAndOverwrite"}
+        {"name": "ObjectSpreadAndOverwrite"},
+        {"name": "ObjectSpreadAndExtend"}
       ]
     },
     {
@@ -617,12 +620,31 @@
     {
       "name": "TurboFan",
       "path": ["TurboFan"],
-      "main": "run.js",
-      "flags": [],
-      "resources": [ "typedLowering.js"],
-      "results_regexp": "^%s\\-TurboFan\\(Score\\): (.+)$",
       "tests": [
-        {"name": "NumberToString"}
+        {
+          "name": "NumberToString",
+          "main": "run.js",
+          "flags": [],
+          "resources": ["typedLowering.js"],
+          "test_flags": ["typedLowering"],
+          "results_regexp": "^NumberToString\\-TurboFan\\(Score\\): (.+)$"
+        },
+        {
+          "name": "WasmInliningLoopArray",
+          "main": "run.js",
+          "flags": [
+            "--experimental-wasm-gc",
+            "--experimental-wasm-js-inlining"
+          ],
+          "resources": ["wasm-inlining-loop-array.js"],
+          "test_flags": ["wasm-inlining-loop-array"],
+          "results_regexp": "^%s\\-TurboFan\\(Score\\): (.+)$",
+          "tests": [
+            {"name": "WasmLoop"},
+            {"name": "JSLoop"},
+            {"name": "PureJSLoop"}
+          ]
+        }
       ]
     },
     {
diff --git a/deps/v8/test/js-perf-test/ObjectLiteralSpread/run.js b/deps/v8/test/js-perf-test/ObjectLiteralSpread/run.js
index ba527280065971..4f90c99257e4be 100644
--- a/deps/v8/test/js-perf-test/ObjectLiteralSpread/run.js
+++ b/deps/v8/test/js-perf-test/ObjectLiteralSpread/run.js
@@ -37,6 +37,11 @@ function BabelAndOverwrite() {
   if (Object.keys(result).length != 5) throw 666;
 }
 
+function BabelAndExtend() {
+  const result = _extends({}, input, {x: 6, y: 7});
+  if (Object.keys(result).length != 7) throw 666;
+}
+
 // ----------------------------------------------------------------------------
 // Benchmark: Object.assign
 // ----------------------------------------------------------------------------
@@ -52,6 +57,11 @@ function ObjectAssignAndOverwrite() {
   if (Object.keys(result).length != 5) throw 666;
 }
 
+function ObjectAssignAndExtend() {
+  const result = Object.assign({}, input, {x: 6, y: 7});
+  if (Object.keys(result).length != 7) throw 666;
+}
+
 
 // ----------------------------------------------------------------------------
 // Benchmark: Object.assign
@@ -68,6 +78,11 @@ function ObjectSpreadAndOverwrite() {
   if (Object.keys(result).length != 5) throw 666;
 }
 
+function ObjectSpreadAndExtend() {
+  const result = { ...input, x: 6, y: 7 };
+  if (Object.keys(result).length != 7) throw 666;
+}
+
 // ----------------------------------------------------------------------------
 // Setup and Run
 // ----------------------------------------------------------------------------
@@ -91,10 +106,13 @@ function CreateBenchmark(name, f) {
 
 CreateBenchmark('Babel', Babel);
 CreateBenchmark('BabelAndOverwrite', BabelAndOverwrite);
+CreateBenchmark('BabelAndExtend', BabelAndExtend);
 CreateBenchmark('ObjectAssign', ObjectAssign);
 CreateBenchmark('ObjectAssignAndOverwrite', ObjectAssignAndOverwrite);
+CreateBenchmark('ObjectAssignAndExtend', ObjectAssignAndExtend);
 CreateBenchmark('ObjectSpread', ObjectSpread);
 CreateBenchmark('ObjectSpreadAndOverwrite', ObjectSpreadAndOverwrite);
+CreateBenchmark('ObjectSpreadAndExtend', ObjectSpreadAndExtend);
 
 BenchmarkSuite.config.doWarmup = undefined;
 BenchmarkSuite.config.doDeterministic = undefined;
diff --git a/deps/v8/test/js-perf-test/TurboFan/run.js b/deps/v8/test/js-perf-test/TurboFan/run.js
index 138daa901ffffb..7ef7bfe4aab5d5 100644
--- a/deps/v8/test/js-perf-test/TurboFan/run.js
+++ b/deps/v8/test/js-perf-test/TurboFan/run.js
@@ -7,7 +7,7 @@ d8.file.execute("../base.js");
 
 const iterations = 100;
 
-d8.file.execute("typedLowering.js");
+d8.file.execute(arguments[0] + '.js');
 
 var success = true;
 
diff --git a/deps/v8/test/js-perf-test/TurboFan/wasm-inlining-loop-array.js b/deps/v8/test/js-perf-test/TurboFan/wasm-inlining-loop-array.js
new file mode 100644
index 00000000000000..68b523e58322cd
--- /dev/null
+++ b/deps/v8/test/js-perf-test/TurboFan/wasm-inlining-loop-array.js
@@ -0,0 +1,203 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --experimental-wasm-js-inlining
+
+/**
+ * Note: The wasm module builder is not available for performance tests.
+ * To change the wasm code, switch the use_module_builder flag to true, update
+ * the code and run it using d8. It will print the bytes that then have to be
+ * updated for the !use_module_builder path.
+ */
+let use_module_builder = false;
+if (use_module_builder) {
+  d8.file.execute('../../mjsunit/wasm/wasm-module-builder.js');
+}
+
+/**
+ * Test performance of iterating over an array of integers adding up their
+ * values.
+ * The different suites measure the following:
+ * WasmLoop:   The loop is implemented in wasm iterating over a wasm array.
+ * JSLoop:     The loop is implemented in JS iterating over a wasm array
+ *             stored in a wasm struct and calling webassembly helpers for the
+ *             element access. This tests inlining performance of wasm into JS.
+ * PureJSLoop: The loop is implemented in JS iterating over a JS array.
+ */
+(function() {
+  // Compile and instantiate wasm.
+  let instance;
+
+  if (use_module_builder) {
+    let builder = new WasmModuleBuilder();
+    let backingStore = builder.addArray(kWasmI32, true);
+    let arrayStruct = builder.addStruct([
+      makeField(kWasmI32 /*length*/, true),
+      makeField(wasmRefType(backingStore), true)
+    ]);
+
+    builder.addFunction('createArray',
+        makeSig([kWasmI32 /*length*/], [kWasmExternRef]))
+      .addLocals(kWasmI32, 1)  // i
+      .addLocals(wasmRefType(backingStore), 1) // backingStore
+      .addBody([
+        // i = length;
+        kExprLocalGet, 0, // length
+        kExprLocalTee, 1,
+        // backingStore = new backingStore[length];
+        kGCPrefix, kExprArrayNewDefault, backingStore,
+        kExprLocalSet, 2,
+        // while (true)
+        kExprLoop, kWasmVoid,
+          // backingStore[--i] = i;
+          kExprLocalGet, 2, // backingStore
+          kExprLocalGet, 1, // i
+          kExprI32Const, 1,
+          kExprI32Sub,
+          kExprLocalTee, 1,
+          kExprLocalGet, 1, // i
+          kGCPrefix, kExprArraySet, backingStore,
+          // if (i != 0) continue;
+          kExprLocalGet, 1,
+          kExprI32Const, 0,
+          kExprI32Ne,
+          kExprBrIf, 0,
+          // break;
+        kExprEnd,
+        // return new arrayStruct(length, backingStore);
+        kExprLocalGet, 0, // length
+        kExprLocalGet, 2, // backingStore
+        kGCPrefix, kExprStructNew, arrayStruct,
+        kGCPrefix, kExprExternExternalize,
+      ])
+      .exportFunc();
+
+    builder.addFunction('getLength',
+        makeSig([kWasmExternRef], [kWasmI32]))
+      .addBody([
+        kExprLocalGet, 0,
+        kGCPrefix, kExprExternInternalize,
+        kGCPrefix, kExprRefCast, arrayStruct,
+        kGCPrefix, kExprStructGet, arrayStruct, 0,
+      ])
+      .exportFunc();
+
+    builder.addFunction('get', makeSig([kWasmExternRef, kWasmI32], [kWasmI32]))
+      .addBody([
+        kExprLocalGet, 0,
+        kGCPrefix, kExprExternInternalize,
+        kGCPrefix, kExprRefCast, arrayStruct,
+        kGCPrefix, kExprStructGet, arrayStruct, 1,
+        kExprLocalGet, 1,
+        kGCPrefix, kExprArrayGet, backingStore,
+      ])
+      .exportFunc();
+
+    builder.addFunction('wasmSumArray', makeSig([kWasmExternRef], [kWasmI32]))
+      .addLocals(kWasmI32, 2)  // index, result
+      .addBody([
+        // index = cast<arrayStruct>(internalize(local.get 0)).length;
+        kExprLocalGet, 0,
+        kGCPrefix, kExprExternInternalize,
+        kGCPrefix, kExprRefCast, arrayStruct,
+        kGCPrefix, kExprStructGet, arrayStruct, 0,
+        kExprLocalTee, 1,
+        // if (index == 0) return 0;
+        kExprI32Eqz,
+        kExprIf, kWasmVoid,
+          kExprI32Const, 0,
+          kExprReturn,
+        kExprEnd,
+
+        // while (true)
+        kExprLoop, kWasmVoid,
+          // result =
+          //   cast<arrayStruct>(internalize(local.get 0))
+          //     .backingStore[--index]
+          //   + result;
+          kExprLocalGet, 0,
+          kGCPrefix, kExprExternInternalize,
+          kGCPrefix, kExprRefCast, arrayStruct,
+          kGCPrefix, kExprStructGet, arrayStruct, 1,
+
+          kExprLocalGet, 1,
+          kExprI32Const, 1,
+          kExprI32Sub,
+          kExprLocalTee, 1,
+
+          kGCPrefix, kExprArrayGet, backingStore,
+          kExprLocalGet, 2,  // result
+          kExprI32Add,
+          kExprLocalSet, 2,
+          // if (index != 0) continue;
+          kExprLocalGet, 1,
+          kExprI32Const, 0,
+          kExprI32Ne,
+          kExprBrIf, 0,
+        kExprEnd,
+        // return result;
+        kExprLocalGet, 2,
+      ])
+      .exportFunc();
+
+    print(builder.toBuffer());
+    instance = builder.instantiate({});
+  } else {
+    instance = new WebAssembly.Instance(new WebAssembly.Module(new Uint8Array([
+      0, 97, 115, 109, 1, 0, 0, 0, 1, 36, 6, 80, 0, 94, 127, 1, 80, 0, 95, 2,
+      127, 1, 107, 0, 1, 96, 1, 127, 1, 111, 96, 1, 111, 1, 127, 96, 2, 111,
+      127, 1, 127, 96, 1, 111, 1, 127, 3, 5, 4, 2, 3, 4, 5, 7, 48, 4, 11, 99,
+      114, 101, 97, 116, 101, 65, 114, 114, 97, 121, 0, 0, 9, 103, 101, 116, 76,
+      101, 110, 103, 116, 104, 0, 1, 3, 103, 101, 116, 0, 2, 12, 119, 97, 115,
+      109, 83, 117, 109, 65, 114, 114, 97, 121, 0, 3, 10, 147, 1, 4, 49, 2, 1,
+      127, 1, 107, 0, 32, 0, 34, 1, 251, 28, 0, 33, 2, 3, 64, 32, 2, 32, 1, 65,
+      1, 107, 34, 1, 32, 1, 251, 22, 0, 32, 1, 65, 0, 71, 13, 0, 11, 32, 0, 32,
+      2, 251, 7, 1, 251, 113, 11, 13, 0, 32, 0, 251, 112, 251, 65, 1, 251, 3, 1,
+      0, 11, 18, 0, 32, 0, 251, 112, 251, 65, 1, 251, 3, 1, 1, 32, 1, 251, 19,
+      0, 11, 62, 1, 2, 127, 32, 0, 251, 112, 251, 65, 1, 251, 3, 1, 0, 34, 1,
+      69, 4, 64, 65, 0, 15, 11, 3, 64, 32, 0, 251, 112, 251, 65, 1, 251, 3, 1,
+      1, 32, 1, 65, 1, 107, 34, 1, 251, 19, 0, 32, 2, 106, 33, 2, 32, 1, 65, 0,
+      71, 13, 0, 11, 32, 2, 11, 0, 51, 4, 110, 97, 109, 101, 1, 44, 4, 0, 11,
+      99, 114, 101, 97, 116, 101, 65, 114, 114, 97, 121, 1, 9, 103, 101, 116,
+      76, 101, 110, 103, 116, 104, 2, 3, 103, 101, 116, 3, 12, 119, 97, 115,
+      109, 83, 117, 109, 65, 114, 114, 97, 121
+    ])), {});
+  }
+
+  let wasm = instance.exports;
+
+  let arrayLength = 10_000;
+  let myArrayStruct = wasm.createArray(arrayLength);
+  let jsArray = Array.from(Array(arrayLength).keys());
+
+  // expected = 0 + 1 + 2 + ... + (arrayLength - 1)
+  let expected = (arrayLength - 1) * arrayLength / 2;
+
+  let benchmarks = [
+    function WasmLoop() {
+      assertEquals(expected, wasm.wasmSumArray(myArrayStruct));
+    },
+    function JSLoop() {
+      let get = wasm.get;
+      let length = wasm.getLength(myArrayStruct);
+      let result = 0;
+      for (let i = 0; i < length; ++i) {
+        result += get(myArrayStruct, i);
+      }
+      assertEquals(expected, result);
+    },
+    function PureJSLoop() {
+      let length = jsArray.length;
+      let result = 0;
+      for (let i = 0; i < length; ++i) {
+        result += jsArray[i];
+      }
+      assertEquals(expected, result);
+    }
+  ];
+
+  for (let fct of benchmarks) {
+    createSuite(fct.name, 100, fct);
+  }
+})();
diff --git a/deps/v8/test/memory/Memory.json b/deps/v8/test/memory/Memory.json
index 77be23c1a08c45..eca435fd869274 100644
--- a/deps/v8/test/memory/Memory.json
+++ b/deps/v8/test/memory/Memory.json
@@ -9,6 +9,10 @@
   "flags": ["--allow-natives-syntax", "--profile-deserialization",
             "--serialization-statistics"],
   "tests": [
+    {
+      "name": "ReservedMemoryProcess",
+      "results_regexp": "(\\d+) bytes per process$"
+    },
     {
       "name": "ReservedMemoryIsolate",
       "results_regexp": "(\\d+) bytes per isolate$"
@@ -21,6 +25,10 @@
       "name": "SnapshotSizeStartup",
       "results_regexp": "(\\d+) bytes for startup$"
     },
+    {
+      "name": "SnapshotSizeSharedHeap",
+      "results_regexp": "(\\d+) bytes for shared heap$"
+    },
     {
       "name": "SnapshotSizeReadOnly",
       "results_regexp": "(\\d+) bytes for read-only$"
diff --git a/deps/v8/test/message/message.status b/deps/v8/test/message/message.status
index f04aff4cf988e3..ae9d76bcc2854c 100644
--- a/deps/v8/test/message/message.status
+++ b/deps/v8/test/message/message.status
@@ -38,7 +38,7 @@
 }],  # ALWAYS
 
 # Skip Liftoff tests on platforms that don't support Liftoff.
-['arch != x64 and arch != ia32 and arch != arm64 and arch != arm and arch != s390x', {
+['arch != x64 and arch != ia32 and arch != arm64 and arch != arm and arch != s390x and arch != ppc64', {
   'wasm-trace-memory-liftoff': [SKIP],
   'wasm-trace-memory64-liftoff': [SKIP],
   'wasm-trace-liftoff': [SKIP],
@@ -50,11 +50,11 @@
   '*': [SKIP],
 }],  # variant == code_serializer
 
-['no_i18n == True', {
+['not i18n', {
   'fail/list-format*': [SKIP],
   # Needs the StringPrototypeToLowerCaseIntl builtin.
   'wasm-recognize-imports': [SKIP],
-}],  # no_i18n == True
+}],  # not i18n
 
 ################################################################################
 ['mode == release', {
@@ -119,4 +119,13 @@
   'wasm-trace-memory64': [SKIP],
   'wasm-trace-memory64-liftoff': [SKIP],
 }],  # 'arch in (ia32, arm, riscv32)'
+
+##############################################################################
+# Behavioural differences between Maglev and Turbofan when the former is used
+# for OptimizeFunctionOnNextCall.
+['variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)', {
+  # Maglev doesn't support inlining of Wasm code.
+  'wasm-inlining-into-js': [FAIL],
+}],  # variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)
+
 ]
diff --git a/deps/v8/test/message/testcfg.py b/deps/v8/test/message/testcfg.py
index 00d60a6bd924a6..670994c6cf9a03 100644
--- a/deps/v8/test/message/testcfg.py
+++ b/deps/v8/test/message/testcfg.py
@@ -49,16 +49,12 @@ class TestCase(testcase.D8TestCase):
   def __init__(self, *args, **kwargs):
     super(TestCase, self).__init__(*args, **kwargs)
 
-    # get_source() relies on this being set.
-    self._base_path = os.path.join(self.suite.root, self.path)
     source = self.get_source()
     self._source_files = self._parse_source_files(source)
     self._source_flags = self._parse_source_flags(source)
 
   def _parse_source_files(self, source):
-    files = []
-    files.append(self._get_source_path())
-    return files
+    return [self._get_source_path()]
 
   def _expected_fail(self):
     path = self.path
@@ -83,9 +79,10 @@ def _get_source_path(self):
     # Try .js first, and fall back to .mjs.
     # TODO(v8:9406): clean this up by never separating the path from
     # the extension in the first place.
-    if os.path.exists(self._base_path + self._get_suffix()):
-      return self._base_path + self._get_suffix()
-    return self._base_path + '.mjs'
+    js_path = self.suite.root / self.path_js
+    if js_path.exists():
+      return js_path
+    return self.suite.root / self.path_mjs
 
   def skip_predictable(self):
     # Message tests expected to fail don't print allocation output for
@@ -95,7 +92,7 @@ def skip_predictable(self):
   @property
   def output_proc(self):
     return message.OutProc(self.expected_outcomes,
-                           self._base_path,
+                           self.suite.root / self.path,
                            self._expected_fail(),
-                           self._base_path + '.out',
+                           self.suite.root / self.path_and_suffix('.out'),
                            self.test_config.regenerate_expected_files)
diff --git a/deps/v8/test/message/wasm-inlining-into-js.js b/deps/v8/test/message/wasm-inlining-into-js.js
new file mode 100644
index 00000000000000..ceb02fe0ccd6f1
--- /dev/null
+++ b/deps/v8/test/message/wasm-inlining-into-js.js
@@ -0,0 +1,75 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --trace-turbo-inlining --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan --no-always-sparkplug
+// Flags: --experimental-wasm-js-inlining
+// Concurrent inlining leads to additional traces.
+// Flags: --no-stress-concurrent-inlining
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+function testOptimized(run, fctToOptimize) {
+  fctToOptimize = fctToOptimize ?? run;
+  %PrepareFunctionForOptimization(fctToOptimize);
+  for (let i = 0; i < 10; ++i) {
+    run();
+  }
+  %OptimizeFunctionOnNextCall(fctToOptimize);
+  run();
+}
+
+function createWasmModule(moduleName) {
+  let builder = new WasmModuleBuilder();
+  builder.setName(moduleName);
+  let array = builder.addArray(kWasmI32, true);
+
+  builder.addFunction('createArray', makeSig([kWasmI32], [kWasmExternRef]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprArrayNewDefault, array,
+      kGCPrefix, kExprExternExternalize,
+    ])
+    .exportFunc();
+
+  builder.addFunction('arrayLen', makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCastNull, array,
+      kGCPrefix, kExprArrayLen,
+    ])
+    .exportFunc();
+
+    builder.addFunction(undefined, makeSig([], []))
+    .addBody(new Array(100).fill(kExprNop))
+    .exportAs('largeFunction');
+
+  let instance = builder.instantiate({});
+  return instance.exports;
+}
+
+let moduleA = createWasmModule("moduleA");
+let moduleB = createWasmModule(/*no name*/);
+
+(function TestInlining() {
+  print(arguments.callee.name);
+
+  let jsFct = () => {
+    moduleA.largeFunction();
+    let array = moduleA.createArray(42);
+    try {
+      moduleA.arrayLen(array)
+    } catch (e) {
+    }
+    %PrepareFunctionForOptimization(inner);
+    return inner();
+
+    function inner() {
+      return moduleB.arrayLen(array) + moduleA.arrayLen(array);
+    }
+  };
+
+  testOptimized(jsFct);
+})();
diff --git a/deps/v8/test/message/wasm-inlining-into-js.out b/deps/v8/test/message/wasm-inlining-into-js.out
new file mode 100644
index 00000000000000..16ce5f6e262e63
--- /dev/null
+++ b/deps/v8/test/message/wasm-inlining-into-js.out
@@ -0,0 +1,17 @@
+TestInlining
+Considering {ADDRESS} {{ADDRESS} <SharedFunctionInfo inner>} for inlining with {ADDRESS} {{ADDRESS} <FeedbackVector[9]>}
+1 candidate(s) for inlining:
+- candidate: JSCall node #83 with frequency 1, 1 target(s):
+  - target: {ADDRESS} {{ADDRESS} <SharedFunctionInfo inner>}, bytecode size: 47
+Inlining {ADDRESS} {{ADDRESS} <SharedFunctionInfo inner>} into {ADDRESS} {{ADDRESS} <SharedFunctionInfo jsFct>}
+Considering wasm function [2] <no name> of module {ADDRESS} for inlining
+- not inlining: function body is larger than max inlinee size (102 > 30)
+Considering wasm function [0] createArray of module {ADDRESS} for inlining
+- not inlining: function body contains unsupported instructions
+Considering wasm function [1] arrayLen of module {ADDRESS} for inlining
+- not inlining: wasm inlining into try catch is not supported
+Inlinee contains {NUMBER} calls without local exception handler; linking to surrounding exception handler.
+Considering wasm function [1] arrayLen of module {ADDRESS} for inlining
+- not inlining: another wasm module is already used for inlining
+Considering wasm function [1] arrayLen of module {ADDRESS} for inlining
+- inlining
diff --git a/deps/v8/test/message/wasm-recognize-imports.js b/deps/v8/test/message/wasm-recognize-imports.js
index 70d7e053e9d6c6..e3f8983779d078 100644
--- a/deps/v8/test/message/wasm-recognize-imports.js
+++ b/deps/v8/test/message/wasm-recognize-imports.js
@@ -3,43 +3,134 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-stringref --allow-natives-syntax
-// Flags: --trace-wasm-inlining --liftoff
+// Flags: --experimental-wasm-gc --experimental-wasm-imported-strings
+// Flags: --trace-wasm-inlining --liftoff --experimental-wasm-typed-funcref
+// Also explicitly enable inlining and disable debug code to avoid differences
+// between --future and --no-future or debug and release builds.
+// Flags: --experimental-wasm-inlining --no-debug-code
 
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
-let builder = new WasmModuleBuilder();
-let sig_w_w = makeSig([kWasmStringRef], [kWasmStringRef]);
-let toLowerCase = builder.addImport("m", "toLowerCase", sig_w_w);
-
-builder.addFunction('call_tolower', sig_w_w).exportFunc().addBody([
-  kExprLocalGet, 0,
-  kExprCallFunction, toLowerCase,
-]);
-
-let module = builder.toModule();
-
-let recognizable = Function.prototype.call.bind(String.prototype.toLowerCase);
-let recognizable_imports = { m: { toLowerCase: recognizable } };
-
-let instance1 = new WebAssembly.Instance(module, recognizable_imports);
-let call_tolower = instance1.exports.call_tolower;
-call_tolower("ABC");
-%WasmTierUpFunction(call_tolower);
-call_tolower("ABC");
-
-// Creating a second instance with identical imports should not cause
-// recompilation.
-console.log("Second instance.");
-let instance2 = new WebAssembly.Instance(module, recognizable_imports);
-let call_tolower2 = instance2.exports.call_tolower;
-call_tolower2("DEF");
-console.log("Still optimized: " + %IsTurboFanFunction(call_tolower2));
-
-// Creating a third instance with different imports must not reuse the
-// existing optimized code.
-console.log("Third instance.");
-let other_imports = { m: { toLowerCase: () => "foo" } };
-let instance3 = new WebAssembly.Instance(module, other_imports);
-let call_tolower3 = instance3.exports.call_tolower;
-call_tolower3("GHI");
-console.log("Still optimized: " + %IsTurboFanFunction(call_tolower3));
+// Tests the basic mechanism: imports can be recognized, optimized code will
+// be discarded when the same module is instantiated with other imports.
+(function TestBasics() {
+  let builder = new WasmModuleBuilder();
+  let sig_w_w = makeSig([kWasmStringRef], [kWasmStringRef]);
+  let toLowerCase = builder.addImport("m", "toLowerCase", sig_w_w);
+
+  builder.addFunction('call_tolower', sig_w_w).exportFunc().addBody([
+    kExprLocalGet, 0,
+    kExprCallFunction, toLowerCase,
+  ]);
+
+  let module = builder.toModule();
+
+  let recognizable = Function.prototype.call.bind(String.prototype.toLowerCase);
+  let recognizable_imports = { m: { toLowerCase: recognizable } };
+
+  let instance1 = new WebAssembly.Instance(module, recognizable_imports);
+  let call_tolower = instance1.exports.call_tolower;
+  call_tolower("ABC");
+  %WasmTierUpFunction(call_tolower);
+  call_tolower("ABC");
+
+  // Creating a second instance with identical imports should not cause
+  // recompilation.
+  console.log("Second instance.");
+  let instance2 = new WebAssembly.Instance(module, recognizable_imports);
+  let call_tolower2 = instance2.exports.call_tolower;
+  call_tolower2("DEF");
+  console.log("Still optimized: " + %IsTurboFanFunction(call_tolower2));
+
+  // Creating a third instance with different imports must not reuse the
+  // existing optimized code.
+  console.log("Third instance.");
+  let other_imports = { m: { toLowerCase: () => "foo" } };
+  let instance3 = new WebAssembly.Instance(module, other_imports);
+  let call_tolower3 = instance3.exports.call_tolower;
+  call_tolower3("GHI");
+  console.log("Still optimized: " + %IsTurboFanFunction(call_tolower3));
+})();
+
+// Tests that the builtins we aim to recognize actually are recognized.
+(function TestRecognizedBuiltins() {
+  let builder = new WasmModuleBuilder();
+  let sig_d_w = makeSig([kWasmStringRef], [kWasmF64]);
+  let sig_i_wwi =
+      makeSig([kWasmStringRef, kWasmStringRef, kWasmI32], [kWasmI32]);
+  let sig_w_d = makeSig([kWasmF64], [kWasmStringRef]);
+  let sig_w_ii = makeSig([kWasmI32, kWasmI32], [kWasmStringRef]);
+  let sig_w_ww = makeSig([kWasmStringRef, kWasmStringRef], [kWasmStringRef]);
+  let nn_string = wasmRefType(kWasmStringRef);
+  let sig_w_ww_nonnullable = makeSig([nn_string, nn_string], [nn_string]);
+  builder.addImport("m", "intToString", sig_w_ii);
+  builder.addImport("m", "doubleToString", sig_w_d);
+  builder.addImport("m", "parseFloat", sig_d_w);
+  builder.addImport("m", "indexOf", sig_i_wwi);
+  builder.addImport("m", "toLocaleLowerCase", sig_w_ww);
+  builder.addImport("m", "toLocaleLowerCase_nn", sig_w_ww_nonnullable);
+  let indexOf = Function.prototype.call.bind(String.prototype.indexOf);
+  let intToString = Function.prototype.call.bind(Number.prototype.toString);
+  let doubleToString = intToString;
+  let toLocaleLowerCase =
+      Function.prototype.call.bind(String.prototype.toLocaleLowerCase);
+  builder.instantiate({
+    m: {
+      intToString,
+      doubleToString,
+      parseFloat,
+      indexOf,
+      toLocaleLowerCase,
+      toLocaleLowerCase_nn: toLocaleLowerCase,
+    }
+  });
+})();
+
+// Tests imported strings.
+(function TestImportedStrings() {
+  console.log("Testing imported strings");
+  // We use "r" for nullable "externref", and "e" for non-nullable "ref extern".
+  let kRefExtern = wasmRefType(kWasmExternRef);
+  let kSig_e_ii = makeSig([kWasmI32, kWasmI32], [kRefExtern]);
+  let kSig_e_d = makeSig([kWasmF64], [kRefExtern]);
+  let kSig_i_ri = makeSig([kWasmExternRef, kWasmI32], [kWasmI32]);
+  let kSig_i_rr = makeSig([kWasmExternRef, kWasmExternRef], [kWasmI32]);
+  let kSig_e_i = makeSig([kWasmI32], [kRefExtern]);
+  let kSig_e_rii = makeSig([kWasmExternRef, kWasmI32, kWasmI32],
+                          [kRefExtern]);
+  let kSig_e_rr = makeSig([kWasmExternRef, kWasmExternRef], [kRefExtern]);
+
+  let builder = new WasmModuleBuilder();
+  let kArrayI16 = builder.addArray(kWasmI16, true);
+  let kArrayI8 = builder.addArray(kWasmI8, true);
+  let a16ref = wasmRefNullType(kArrayI16);
+  let a8ref = wasmRefNullType(kArrayI8);
+
+  builder.addImport('String', 'fromWtf16Array',
+                    makeSig([a16ref, kWasmI32, kWasmI32], [kRefExtern]));
+  builder.addImport('String', 'fromWtf8Array',
+                    makeSig([a8ref, kWasmI32, kWasmI32], [kRefExtern]));
+  builder.addImport('String', 'toWtf16Array',
+                    makeSig([kWasmExternRef, a16ref, kWasmI32], [kWasmI32]));
+  builder.addImport('String', 'fromCharCode', kSig_e_i);
+  builder.addImport('String', 'fromCodePoint', kSig_e_i);
+  builder.addImport('String', 'charCodeAt', kSig_i_ri);
+  builder.addImport('String', 'codePointAt', kSig_i_ri);
+  builder.addImport('String', 'length', kSig_i_r);
+  builder.addImport('String', 'concat', kSig_e_rr);
+  builder.addImport('String', 'substring', kSig_e_rii);
+  builder.addImport('String', 'equals', kSig_i_rr);
+  builder.addImport('String', 'compare', kSig_i_rr);
+
+  builder.addImport('related', 'intToString', kSig_e_ii);
+  builder.addImport('related', 'doubleToString', kSig_e_d);
+  // String-consuming imports like "toLowerCase" are not (yet?) supported for
+  // special-casing with imported strings due to lack of static typing.
+  let intToString = Function.prototype.call.bind(Number.prototype.toString);
+  let doubleToString = intToString;
+
+  builder.instantiate({
+    String: WebAssembly.String,
+    related: { intToString, doubleToString }
+  });
+})();
diff --git a/deps/v8/test/message/wasm-recognize-imports.out b/deps/v8/test/message/wasm-recognize-imports.out
index 972daf3cdf4fbc..9083eb3e0b3a2b 100644
--- a/deps/v8/test/message/wasm-recognize-imports.out
+++ b/deps/v8/test/message/wasm-recognize-imports.out
@@ -1,5 +1,32 @@
-[function 1: import 0 is well-known built-in String.toLowerCase]
+[import 0 is well-known built-in String.toLowerCase]
+[function 1: call_ref #0 inlineable (monomorphic)]
+[function 1: call to 0 is well-known String.toLowerCase]
+[function 1: node {NUMBER}: not a relocatable constant]
+[function 1: node {NUMBER}: not a relocatable constant]
+[function 1 (wasm-function#1): no inlining candidates]
 Second instance.
+[import 0 is well-known built-in String.toLowerCase]
 Still optimized: true
 Third instance.
 Still optimized: false
+[import 0 is well-known built-in IntToString]
+[import 1 is well-known built-in DoubleToString]
+[import 2 is well-known built-in ParseFloat]
+[import 3 is well-known built-in String.indexOf]
+[import 4 is well-known built-in String.toLocaleLowerCase]
+[import 5 is well-known built-in String.toLocaleLowerCase]
+Testing imported strings
+[import 0 is well-known built-in String.fromWtf16Array]
+[import 1 is well-known built-in String.fromWtf8Array]
+[import 2 is well-known built-in String.toWtf16Array]
+[import 3 is well-known built-in String.fromCharCode]
+[import 4 is well-known built-in String.fromCodePoint]
+[import 5 is well-known built-in String.charCodeAt]
+[import 6 is well-known built-in String.codePointAt]
+[import 7 is well-known built-in String.length]
+[import 8 is well-known built-in String.concat]
+[import 9 is well-known built-in String.substring]
+[import 10 is well-known built-in String.equals]
+[import 11 is well-known built-in String.compare]
+[import 12 is well-known built-in IntToString]
+[import 13 is well-known built-in DoubleToString]
diff --git a/deps/v8/test/message/weakref-finalizationregistry-error.js b/deps/v8/test/message/weakref-finalizationregistry-error.js
index 369f78ffc206c4..cef8e9df60cb0a 100644
--- a/deps/v8/test/message/weakref-finalizationregistry-error.js
+++ b/deps/v8/test/message/weakref-finalizationregistry-error.js
@@ -15,10 +15,16 @@ const fg1 = new FinalizationRegistry(callback);
 const fg2 = new FinalizationRegistry(callback);
 
 (function() {
-let x = {};
-fg1.register(x, {});
-fg2.register(x, {});
-x = null;
+  let x = {};
+  fg1.register(x, {});
+  fg2.register(x, {});
+  x = null;
 })();
 
-gc();
+// We need to invoke GC asynchronously and wait for it to finish, so that
+// it doesn't need to scan the stack. Otherwise, the objects may not be
+// reclaimed because of conservative stack scanning and the test may not
+// work as intended.
+(async function () {
+  await gc({ type: 'major', execution: 'async' });
+})();
diff --git a/deps/v8/test/mjsunit/array-literal-transitions.js b/deps/v8/test/mjsunit/array-literal-transitions.js
index c5616da59843c5..e522d0ac4b27dd 100644
--- a/deps/v8/test/mjsunit/array-literal-transitions.js
+++ b/deps/v8/test/mjsunit/array-literal-transitions.js
@@ -133,12 +133,15 @@ deopt_array(false);
 deopt_array(false);
 deopt_array(false);
   %OptimizeFunctionOnNextCall(deopt_array);
+var turbofan = willBeTurbofanned(deopt_array);
 var array = deopt_array(false);
 assertOptimized(deopt_array);
-deopt_array(true);
-assertOptimized(deopt_array);
-array = deopt_array(false);
-assertOptimized(deopt_array);
+if (turbofan) {
+  deopt_array(true);
+  assertOptimized(deopt_array);
+  array = deopt_array(false);
+  assertOptimized(deopt_array);
+}
 
 // Check that unexpected changes in the objects stored into the boilerplate
 // also force a deopt.
diff --git a/deps/v8/test/mjsunit/array-tolocalestring.js b/deps/v8/test/mjsunit/array-tolocalestring.js
index a5f856907af0c5..2f943644531930 100644
--- a/deps/v8/test/mjsunit/array-tolocalestring.js
+++ b/deps/v8/test/mjsunit/array-tolocalestring.js
@@ -60,7 +60,7 @@
     toLocaleString: 7
   }
   arr[0] = obj;
-  assertThrows(() => arr.toLocaleString(), TypeError, '7 is not a function');
+  assertThrows(() => arr.toLocaleString(), TypeError, 'number 7 is not a function');
 
   // Verifies cycle detection still works properly after thrown error.
   arr[0] = {
diff --git a/deps/v8/test/mjsunit/asm/atomics-add.js b/deps/v8/test/mjsunit/asm/atomics-add.js
index abb7c980308548..a539cf6bf30089 100644
--- a/deps/v8/test/mjsunit/asm/atomics-add.js
+++ b/deps/v8/test/mjsunit/asm/atomics-add.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/atomics-and.js b/deps/v8/test/mjsunit/asm/atomics-and.js
index da770bfa88ebd8..73307c48058fc8 100644
--- a/deps/v8/test/mjsunit/asm/atomics-and.js
+++ b/deps/v8/test/mjsunit/asm/atomics-and.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/atomics-compareexchange.js b/deps/v8/test/mjsunit/asm/atomics-compareexchange.js
index dd93395569c287..f603d27a99056b 100644
--- a/deps/v8/test/mjsunit/asm/atomics-compareexchange.js
+++ b/deps/v8/test/mjsunit/asm/atomics-compareexchange.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/atomics-exchange.js b/deps/v8/test/mjsunit/asm/atomics-exchange.js
index ea9c24693c8ed3..10d71e04eca561 100644
--- a/deps/v8/test/mjsunit/asm/atomics-exchange.js
+++ b/deps/v8/test/mjsunit/asm/atomics-exchange.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/atomics-load.js b/deps/v8/test/mjsunit/asm/atomics-load.js
index 9a61a237beaf78..0d6c9689543223 100644
--- a/deps/v8/test/mjsunit/asm/atomics-load.js
+++ b/deps/v8/test/mjsunit/asm/atomics-load.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/atomics-or.js b/deps/v8/test/mjsunit/asm/atomics-or.js
index 351ce9d112037f..3c2490807478a0 100644
--- a/deps/v8/test/mjsunit/asm/atomics-or.js
+++ b/deps/v8/test/mjsunit/asm/atomics-or.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/atomics-store.js b/deps/v8/test/mjsunit/asm/atomics-store.js
index 8b9e4c637f0c66..8d703cf43d45fb 100644
--- a/deps/v8/test/mjsunit/asm/atomics-store.js
+++ b/deps/v8/test/mjsunit/asm/atomics-store.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/atomics-sub.js b/deps/v8/test/mjsunit/asm/atomics-sub.js
index 6789aeda600e9f..edc3fa1b0cbeca 100644
--- a/deps/v8/test/mjsunit/asm/atomics-sub.js
+++ b/deps/v8/test/mjsunit/asm/atomics-sub.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/atomics-xor.js b/deps/v8/test/mjsunit/asm/atomics-xor.js
index 13c64407299ae0..7574f703d73bf0 100644
--- a/deps/v8/test/mjsunit/asm/atomics-xor.js
+++ b/deps/v8/test/mjsunit/asm/atomics-xor.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function Module(stdlib, foreign, heap, offset) {
   "use asm";
   var MEM8 = new stdlib.Int8Array(heap, offset);
diff --git a/deps/v8/test/mjsunit/asm/regress-1432537.js b/deps/v8/test/mjsunit/asm/regress-1432537.js
new file mode 100644
index 00000000000000..073bceb6885bb6
--- /dev/null
+++ b/deps/v8/test/mjsunit/asm/regress-1432537.js
@@ -0,0 +1,15 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function asm(stdlib, foreign) {
+  'use asm';
+  var foreign = +foreign.bar;
+  var baz = +foreign.baz;
+  function f() {
+    return baz;
+  }
+  return {f: f};
+}
+const module = asm(this, {baz: 345.7});
+assertEquals(NaN, module.f());
diff --git a/deps/v8/test/mjsunit/async-hooks/regress-crbug-1337629.js b/deps/v8/test/mjsunit/async-hooks/regress-crbug-1337629.js
index 1570d3fd0a7b50..7c644f1cafebc4 100644
--- a/deps/v8/test/mjsunit/async-hooks/regress-crbug-1337629.js
+++ b/deps/v8/test/mjsunit/async-hooks/regress-crbug-1337629.js
@@ -2,6 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// Flags: --expose-async-hooks
+
 const failing_proxy = new Proxy({}, new Proxy({}, {
   get() {
     throw "No trap should fire";
diff --git a/deps/v8/test/mjsunit/async-hooks/regress-crbug-1427746.js b/deps/v8/test/mjsunit/async-hooks/regress-crbug-1427746.js
new file mode 100644
index 00000000000000..aaac2ade071294
--- /dev/null
+++ b/deps/v8/test/mjsunit/async-hooks/regress-crbug-1427746.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-async-hooks --expose-gc
+
+let v0 = [];
+let v1 = 1;
+
+let v2 = async_hooks.createHook({
+  after: () => {
+    async_hooks.createHook(v1);
+    gc();
+  }
+});
+
+v2.enable();
+
+new Promise(v3 => v3(42)).then(() => { }).catch(() => { });
+v1 = v0;
diff --git a/deps/v8/test/mjsunit/async-hooks/regress-crbug-1433521.js b/deps/v8/test/mjsunit/async-hooks/regress-crbug-1433521.js
new file mode 100644
index 00000000000000..5ee449fdc1d51f
--- /dev/null
+++ b/deps/v8/test/mjsunit/async-hooks/regress-crbug-1433521.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-async-hooks --no-fail
+
+let arr = [];
+let hook = async_hooks.createHook({
+  init() {
+    d8.terminate();
+    arr.push();
+  }
+});
+hook.enable();
+
+async function async_f() {}
+async_f().then();
+async_hooks.createHook({init() {}});
diff --git a/deps/v8/test/mjsunit/baseline/batch-compilation.js b/deps/v8/test/mjsunit/baseline/batch-compilation.js
index 9efdf3502df3ba..e6c54e06d18571 100644
--- a/deps/v8/test/mjsunit/baseline/batch-compilation.js
+++ b/deps/v8/test/mjsunit/baseline/batch-compilation.js
@@ -5,7 +5,7 @@
 // Flags: --sparkplug --no-always-sparkplug --sparkplug-filter="test*"
 // Flags: --allow-natives-syntax --expose-gc --no-always-turbofan
 // Flags: --baseline-batch-compilation --baseline-batch-compilation-threshold=200
-// Flags: --interrupt-budget-factor-for-feedback-allocation=4
+// Flags: --invocation-count-for-feedback-allocation=4
 // Flags: --no-concurrent-sparkplug
 
 // Flags to drive Fuzzers into the right direction
diff --git a/deps/v8/test/mjsunit/baseline/test-osr-maglev-tf.js b/deps/v8/test/mjsunit/baseline/test-osr-maglev-tf.js
new file mode 100644
index 00000000000000..0f8aec6bb40db1
--- /dev/null
+++ b/deps/v8/test/mjsunit/baseline/test-osr-maglev-tf.js
@@ -0,0 +1,57 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --sparkplug --no-always-sparkplug --use-osr
+// Flags: --turbofan --no-always-turbofan --deopt-every-n-times=0
+// Flags: --maglev --maglev-osr --osr-from-maglev
+// Flags: --concurrent-recompilation
+
+function isExecutingBaseline(func) {
+  let opt_status = %GetOptimizationStatus(func);
+  return (opt_status & V8OptimizationStatus.kTopmostFrameIsBaseline) !== 0;
+}
+
+function f() {
+  for (var i = 0; i <= 20; i++) {
+    if (i == 5) {
+      %BaselineOsr();
+    }
+    if (i > 5) {
+      assertTrue(isBaseline(f));
+      assertTrue(isExecutingBaseline(f));
+    }
+  }
+}
+
+%NeverOptimizeFunction(f);
+f();
+
+var expectedStatus = V8OptimizationStatus.kTopmostFrameIsInterpreted;
+
+function checkTopmostFrame(func) {
+  let opt_status = %GetOptimizationStatus(func);
+  assertTrue ((opt_status & expectedStatus) !== 0, "Expected flag " +
+      expectedStatus + " to be set in optimization status");
+}
+
+function g() {
+  for (var i = 0; i <= 20; i++) {
+    console.log(i)
+    checkTopmostFrame(g)
+    if (i == 2) {
+      %BaselineOsr();
+      expectedStatus = V8OptimizationStatus.kTopmostFrameIsBaseline;
+    }
+    if (i == 10 || i == 5) {
+      %OptimizeOsr();
+      // Load these to make sure maglev does not deopt before we tier up.
+      let ml = V8OptimizationStatus.kTopmostFrameIsMaglev;
+      let tf = V8OptimizationStatus.kTopmostFrameIsTurboFanned;
+      expectedStatus = i == 5 ? ml : tf;
+    }
+  }
+}
+
+%PrepareFunctionForOptimization(g);
+g();
diff --git a/deps/v8/test/mjsunit/baseline/test-osr-maglev.js b/deps/v8/test/mjsunit/baseline/test-osr-maglev.js
new file mode 100644
index 00000000000000..f2efe8dedbd498
--- /dev/null
+++ b/deps/v8/test/mjsunit/baseline/test-osr-maglev.js
@@ -0,0 +1,52 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --sparkplug --no-always-sparkplug --use-osr
+// Flags: --turbofan --no-always-turbofan --deopt-every-n-times=0
+// Flags: --maglev --maglev-osr
+
+function isExecutingBaseline(func) {
+  let opt_status = %GetOptimizationStatus(func);
+  return (opt_status & V8OptimizationStatus.kTopmostFrameIsBaseline) !== 0;
+}
+
+function f() {
+  for (var i = 0; i <= 20; i++) {
+    if (i == 5) {
+      %BaselineOsr();
+    }
+    if (i > 5) {
+      assertTrue(isBaseline(f));
+      assertTrue(isExecutingBaseline(f));
+    }
+  }
+}
+
+%NeverOptimizeFunction(f);
+f();
+
+var expectedStatus = V8OptimizationStatus.kTopmostFrameIsInterpreted;
+
+function checkTopmostFrame(func) {
+  let opt_status = %GetOptimizationStatus(func);
+  assertTrue ((opt_status & expectedStatus) !== 0, "Expected flag " +
+      expectedStatus + " to be set in optimization status");
+}
+
+function g() {
+  for (var i = 0; i <= 20; i++) {
+    checkTopmostFrame(g)
+    if (i == 2) {
+      %BaselineOsr();
+      expectedStatus = V8OptimizationStatus.kTopmostFrameIsBaseline;
+    }
+    if (i == 5) {
+      %OptimizeOsr();
+      expectedStatus = V8OptimizationStatus.kTopmostFrameIsMaglev;
+    }
+  }
+}
+
+%PrepareFunctionForOptimization(g);
+g();
diff --git a/deps/v8/test/mjsunit/baseline/test-osr.js b/deps/v8/test/mjsunit/baseline/test-osr.js
index 4f9f1310355bb7..6b291564d3ca83 100644
--- a/deps/v8/test/mjsunit/baseline/test-osr.js
+++ b/deps/v8/test/mjsunit/baseline/test-osr.js
@@ -4,6 +4,7 @@
 
 // Flags: --allow-natives-syntax --sparkplug --no-always-sparkplug --use-osr
 // Flags: --turbofan --no-always-turbofan --deopt-every-n-times=0
+// Flags: --no-maglev-osr
 
 function isExecutingBaseline(func) {
   let opt_status = %GetOptimizationStatus(func);
diff --git a/deps/v8/test/mjsunit/binary-op-throws-feedback.js b/deps/v8/test/mjsunit/binary-op-throws-feedback.js
new file mode 100644
index 00000000000000..d09be555c7fa62
--- /dev/null
+++ b/deps/v8/test/mjsunit/binary-op-throws-feedback.js
@@ -0,0 +1,39 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+
+function testThrowsRepeated(fn) {
+  %PrepareFunctionForOptimization(fn);
+  for (let i = 0; i < 5; i++) assertThrows(fn, TypeError);
+  %OptimizeFunctionOnNextCall(fn);
+  assertThrows(fn, TypeError);
+  // Assert that the function is still optimized, i.e. no deopt happened when
+  // calling it.
+  assertOptimized(fn);
+}
+
+let symbol = Symbol("test");
+{ // Test with smi.
+  let other = 1;
+  let addL = () => symbol + other;
+  let addR = () => other + symbol;
+  let bitAndL = () => symbol & other;
+  let bitAndR = () => other & symbol;
+  testThrowsRepeated(addL);
+  testThrowsRepeated(addR);
+  testThrowsRepeated(bitAndL);
+  testThrowsRepeated(bitAndR);
+}
+{ // Test with non-smi.
+  let other = Math.pow(2, 32);
+  let addL = () => symbol + other;
+  let addR = () => other + symbol;
+  let bitAndL = () => symbol & other;
+  let bitAndR = () => other & symbol;
+  testThrowsRepeated(addL);
+  testThrowsRepeated(addR);
+  testThrowsRepeated(bitAndL);
+  testThrowsRepeated(bitAndR);
+}
diff --git a/deps/v8/test/mjsunit/clone-ic-attached.js b/deps/v8/test/mjsunit/clone-ic-attached.js
new file mode 100644
index 00000000000000..e3e49d018922e6
--- /dev/null
+++ b/deps/v8/test/mjsunit/clone-ic-attached.js
@@ -0,0 +1,22 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --no-lazy-feedback-allocation
+
+
+function f(x) {return {...x,b:2}};
+let o={a:1}
+
+// Ensure the clone ic does not generate detached maps.
+
+assertTrue(%HaveSameMap(f(o), f(o)));
+assertTrue(%HaveSameMap(f(o), f(o)));
+assertTrue(%HaveSameMap(f(o), f(o)));
+assertTrue(%HaveSameMap(f(o), f(o)));
+
+assertTrue(%HaveSameMap({...o},{...o}));
+assertTrue(%HaveSameMap({...o},{...o}));
+assertTrue(%HaveSameMap({...o},{...o}));
+assertTrue(%HaveSameMap({...o},{...o}));
+assertTrue(%HaveSameMap({...o},{...o}));
diff --git a/deps/v8/test/mjsunit/clone-ic-regression-crbug-1466315.js b/deps/v8/test/mjsunit/clone-ic-regression-crbug-1466315.js
new file mode 100644
index 00000000000000..325c3dd196283e
--- /dev/null
+++ b/deps/v8/test/mjsunit/clone-ic-regression-crbug-1466315.js
@@ -0,0 +1,11 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var p = {};
+var _ = {__proto__: p};
+_ = null;
+console.log(p.constructor.name);
+a = { ...p};
+p.asdf = 22;
+a.asdfasdf = 22;
diff --git a/deps/v8/test/mjsunit/clone-ic-regressions.js b/deps/v8/test/mjsunit/clone-ic-regressions.js
new file mode 100644
index 00000000000000..1fcfa493f157df
--- /dev/null
+++ b/deps/v8/test/mjsunit/clone-ic-regressions.js
@@ -0,0 +1,161 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+// Flags: --allow-natives-syntax
+
+// Tests megamorphic case
+function clone1(o) {
+  return {...o};
+}
+// Tests monomorphic case
+function clone2(o) {
+  return {...o};
+}
+%PrepareFunctionForOptimization(clone1);
+%PrepareFunctionForOptimization(clone2);
+
+function test(a, b) {
+  %ClearFunctionFeedback(clone2);
+  assertEquals({...b}, a);
+  assertEquals(clone1(b), a);
+  assertEquals(clone1(b), a);
+  assertEquals(clone2(b), a);
+  assertEquals(clone2(b), a);
+  assertEquals(clone1(b).constructor, a.constructor);
+  assertEquals(clone2(b).constructor, a.constructor);
+  %ClearFunctionFeedback(clone2);
+  assertEquals(clone2(b).constructor, a.constructor);
+
+  // Provoke some transitions
+  %ClearFunctionFeedback(clone2);
+  Object.assign(a, {xx: 42})
+  assertEquals({...b, xx: 42}, a);
+  assertEquals({...clone1(b), xx: 42}, a);
+  assertEquals({...clone1(b), xx: 42}, a);
+  assertEquals({...clone2(b), xx: 42}, a);
+  assertEquals({...clone2(b), xx: 42}, a);
+
+  %ClearFunctionFeedback(clone2);
+  Object.assign(a, {xx: 42.2})
+  assertEquals({...b, xx: 42.2}, a);
+  assertEquals({...clone1(b), xx: 42.2}, a);
+  assertEquals({...clone1(b), xx: 42.2}, a);
+  assertEquals({...clone2(b), xx: 42.2}, a);
+  assertEquals({...clone2(b), xx: 42.2}, a);
+}
+
+test({});
+test({}, false);
+test({}, 1.1);
+test({}, NaN);
+test({}, 2);
+test({}, new function(){});
+test({}, test);
+test({}, {}.__proto__);
+test({}, new Proxy({}, function(){}));
+test({a: "a"}, new Proxy({a: "a"}, function(){}));
+test({}, BigInt(2));
+test({}, Symbol("ab"));
+test({0: "a", 1: "b"}, "ab");
+
+// non-enumerable
+var obj = {a: 1}
+Object.defineProperty(obj, 'b', {
+  value: 42,
+});
+test({a: 1}, obj);
+assertFalse(%HaveSameMap({...obj},obj));
+
+// some not writable
+var obj = {}
+Object.defineProperty(obj, 'a', {
+  value: 42,
+  writable: false,
+  enumerable: true
+});
+obj.b = 1;
+test({a: 42, b: 1}, obj);
+assertFalse(%HaveSameMap({...obj},obj));
+
+// non-enumerable after non-writable
+var obj = {}
+Object.defineProperty(obj, 'a', {
+  value: 1,
+  writable: false,
+  enumerable: true,
+});
+Object.defineProperty(obj, 'b', {
+  value: 2,
+});
+test({a: 1}, obj);
+var c = {...obj, a: 4};
+
+test({0:1,1:2}, [1,2]);
+
+var buffer = new ArrayBuffer(24);
+var idView = new Uint32Array(buffer, 0, 2);
+test({}, buffer);
+test({0:0,1:0}, idView);
+
+// with prototypes
+{
+  __v_0 = Object.create(null);
+  __v_1 = Object.create(__v_0);
+  test({}, __v_0);
+  test({}, __v_1);
+  function F0() {}
+  const v2 = new F0();
+  test({}, v2);
+}
+
+// null prototype
+{
+  function F0() {
+      this.b = 4294967297;
+  }
+  const v3 = new F0();
+  const o4 = {
+      __proto__: v3,
+  };
+  const o7 = {
+      ...o4,
+      __proto__: null,
+  };
+  const o6 = {
+      ...v3,
+      __proto__: null,
+  };
+  assertEquals(o6, {b: 4294967297});
+  assertEquals(o7, {});
+  test({}, o7);
+  test({b: 4294967297}, o6);
+}
+
+// Dictionary mode objects
+{
+  let v0 = "";
+  for (let v1 = 0; v1 < 250; v1++) {
+      v0 += `this.a${v1} = 0;\n`;
+  }
+  const v4 = Function(v0);
+  const v5 = new v4();
+  const o6 = {
+     ...v5,
+  };
+  test(o6, v5);
+}
+
+// Null proto with non data props
+{
+  const v0 = [1];
+  const o3 = {
+      ...v0,
+      get g() {
+      },
+  };
+  const o4 = {
+      ...o3,
+      __proto__: null,
+  };
+  test({0: 1, g: undefined}, o4);
+}
diff --git a/deps/v8/test/mjsunit/clone-ic-representation.js b/deps/v8/test/mjsunit/clone-ic-representation.js
new file mode 100644
index 00000000000000..d77ad5b7d0238b
--- /dev/null
+++ b/deps/v8/test/mjsunit/clone-ic-representation.js
@@ -0,0 +1,45 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --no-lazy-feedback-allocation
+
+// Ensure the clone ic correctly deals with representation change and map
+// deprecation.
+
+function Input(a, b) {
+  this.a = a;
+  this.b = b;
+}
+
+var input = new Input(1,1);
+var input = new Input(1,1);
+var exp = 2;
+
+function ObjectSpread() {
+  const result = { ...input, a: input.a };
+  if (Object.values(result).reduce((a, b) => a + b) != exp) throw 666;
+  return result
+}
+
+// Warmup
+ObjectSpread()
+ObjectSpread()
+ObjectSpread()
+ObjectSpread()
+
+// Representation change
+input = new Input(1,null);
+var exp = 1;
+ObjectSpread()
+ObjectSpread()
+ObjectSpread()
+ObjectSpread()
+
+// Map deprecation
+input = new Input(1,1.4);
+exp = 2.4;
+ObjectSpread()
+ObjectSpread()
+ObjectSpread()
+ObjectSpread()
diff --git a/deps/v8/test/mjsunit/code-coverage-class-fields.js b/deps/v8/test/mjsunit/code-coverage-class-fields.js
index 9e3fa54b46d04c..0132b8cc17261d 100644
--- a/deps/v8/test/mjsunit/code-coverage-class-fields.js
+++ b/deps/v8/test/mjsunit/code-coverage-class-fields.js
@@ -2,8 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --no-always-turbofan --harmony-public-fields
-// Flags: --harmony-static-fields --no-stress-flush-code
+// Flags: --allow-natives-syntax --no-always-turbofan --no-stress-flush-code
 // Flags: --expose-gc
 // Files: test/mjsunit/code-coverage-utils.js
 
@@ -28,7 +27,7 @@ class X {                                  // 000
 };                                         // 100
     `,
     [ {"start":0,"end":149,"count":1},
-      {"start":0,"end":101,"count":0} ]
+      {"start":8,"end":101,"count":0} ]
   );
 
   await TestCoverage(
@@ -40,7 +39,7 @@ class X {                                  // 000
 let x = new X();                           // 150
     `,
     [ {"start":0,"end":199,"count":1},
-      {"start":0,"end":101,"count":1},
+      {"start":8,"end":101,"count":1},
       {"start":56,"end":70,"count":0} ]
   );
 
@@ -54,7 +53,7 @@ let x = new X();                           // 150
 x.x();                                     // 200
     `,
     [ {"start":0,"end":249,"count":1},
-      {"start":0,"end":101,"count":1},
+      {"start":8,"end":101,"count":1},
       {"start":56,"end":70,"count":1} ]
   );
 
@@ -71,7 +70,7 @@ x.x();                                     // 300
 x.y();                                     // 350
     `,
     [ {"start":0,"end":399,"count":1},
-      {"start":0,"end":201,"count":1},
+      {"start":8,"end":201,"count":1},
       {"start":56,"end":70,"count":1},
       {"start":102,"end":111,"count":0},
       {"start":156,"end":169,"count":1} ]
@@ -91,7 +90,7 @@ x.y();                                     // 350
 x.foo();                                   // 400
     `,
     [ {"start":0,"end":449,"count":1},
-      {"start":0,"end":201,"count":1},
+      {"start":8,"end":201,"count":1},
       {"start":56,"end":70,"count":1},
       {"start":102,"end":111,"count":1},
       {"start":156,"end":169,"count":1} ]
@@ -106,7 +105,7 @@ class X {                                  // 000
 let x = new X();                           // 150
     `,
     [ {"start":0,"end":199,"count":1},
-      {"start":0,"end":101,"count":1},
+      {"start":8,"end":101,"count":1},
       {"start":57,"end":71,"count":1} ]
   );
 
@@ -121,7 +120,7 @@ let x = new X();                           // 200
     `,
     [ {"start":0,"end":249,"count":1},
       {"start":0,"end":15,"count":1},
-      {"start":50,"end":151,"count":1},
+      {"start":58,"end":151,"count":1},
       {"start":111,"end":125,"count":1} ]
   );
 
@@ -133,7 +132,7 @@ class X {                                  // 000
 };                                         // 100
     `,
     [ {"start":0,"end":149,"count":1},
-      {"start":52,"end":77,"count":1},
+      {"start":8,"end":101,"count":1},
       {"start":63,"end":77,"count":0} ]
   );
 
@@ -146,7 +145,7 @@ class X {                                  // 000
 X.x();                                     // 150
     `,
     [ {"start":0,"end":199,"count":1},
-      {"start":52,"end":77,"count":1},
+      {"start":8,"end":101,"count":1},
       {"start":63,"end":77,"count":1} ]
   );
 
@@ -158,7 +157,7 @@ class X {                                  // 000
 };                                         // 100
     `,
     [ {"start":0,"end":149,"count":1},
-      {"start":52,"end":81,"count":1},
+      {"start":8,"end":101,"count":1},
       {"start":64,"end":78,"count":1} ]
   );
 
@@ -172,7 +171,7 @@ class X {                                  // 050
     `,
     [ {"start":0,"end":199,"count":1},
       {"start":0,"end":15,"count":1},
-      {"start":102,"end":135,"count":1},
+      {"start":58,"end":151,"count":1},
       {"start":118,"end":132,"count":1} ]
   );
 
diff --git a/deps/v8/test/mjsunit/compiler/array-slice-clone.js b/deps/v8/test/mjsunit/compiler/array-slice-clone.js
index 21a78e46241196..c7c61352cfb7fb 100644
--- a/deps/v8/test/mjsunit/compiler/array-slice-clone.js
+++ b/deps/v8/test/mjsunit/compiler/array-slice-clone.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --turbofan --no-stress-flush-code
+// Flags: --no-lazy-feedback-allocation
 
 
 // Test CloneFastJSArray inserted by JSCallReducer for Array.prototype.slice.
diff --git a/deps/v8/test/mjsunit/compiler/call-with-arraylike-or-spread-7.js b/deps/v8/test/mjsunit/compiler/call-with-arraylike-or-spread-7.js
index 1d1201ffd9c5c8..f2fa324442dccc 100644
--- a/deps/v8/test/mjsunit/compiler/call-with-arraylike-or-spread-7.js
+++ b/deps/v8/test/mjsunit/compiler/call-with-arraylike-or-spread-7.js
@@ -21,6 +21,7 @@
 (function () {
   "use strict";
   var log_got_interpreted = true;
+  %NeverOptimizeFunction(assertEquals);
 
   function log(a) {
     assertEquals(1, arguments.length);
diff --git a/deps/v8/test/mjsunit/compiler/catch-block-load.js b/deps/v8/test/mjsunit/compiler/catch-block-load.js
index c753b2aaa06c39..5b039fdd4e2dc6 100644
--- a/deps/v8/test/mjsunit/compiler/catch-block-load.js
+++ b/deps/v8/test/mjsunit/compiler/catch-block-load.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turboshaft-enable-debug-features
 
 const obj = { a: 42 };
 
diff --git a/deps/v8/test/mjsunit/compiler/concurrent-inlining-1.js b/deps/v8/test/mjsunit/compiler/concurrent-inlining-1.js
index 9cbdbc863fb437..aa3d7d9bb3025e 100644
--- a/deps/v8/test/mjsunit/compiler/concurrent-inlining-1.js
+++ b/deps/v8/test/mjsunit/compiler/concurrent-inlining-1.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turboshaft-enable-debug-features
 
 // This test ensures that we manage to serialize the global.gaga function for
 // compilation and therefore are able to inline it. Since the call feedback in
diff --git a/deps/v8/test/mjsunit/compiler/concurrent-inlining-2.js b/deps/v8/test/mjsunit/compiler/concurrent-inlining-2.js
index e3e63d195cebb1..af9f8b31f78e38 100644
--- a/deps/v8/test/mjsunit/compiler/concurrent-inlining-2.js
+++ b/deps/v8/test/mjsunit/compiler/concurrent-inlining-2.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turboshaft-enable-debug-features
 
 // This test ensures that we manage to serialize the global.gaga function for
 // compilation and therefore are able to inline it. Since the call feedback in
diff --git a/deps/v8/test/mjsunit/compiler/constant-fold-add-static.js b/deps/v8/test/mjsunit/compiler/constant-fold-add-static.js
index e824cabda61205..8614808819e459 100644
--- a/deps/v8/test/mjsunit/compiler/constant-fold-add-static.js
+++ b/deps/v8/test/mjsunit/compiler/constant-fold-add-static.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --no-assert-types
+// Flags: --turboshaft-enable-debug-features
 
 // Check that constant-folding of arithmetic results in identical nodes.
 (function() {
diff --git a/deps/v8/test/mjsunit/compiler/construct-bound-function.js b/deps/v8/test/mjsunit/compiler/construct-bound-function.js
index 637309306a1bdc..06702c31d12b09 100644
--- a/deps/v8/test/mjsunit/compiler/construct-bound-function.js
+++ b/deps/v8/test/mjsunit/compiler/construct-bound-function.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --turbofan
+// Flags: --allow-natives-syntax --turbofan --turboshaft-enable-debug-features
 
 class C extends Object {
   bla() {}
diff --git a/deps/v8/test/mjsunit/compiler/construct-object.js b/deps/v8/test/mjsunit/compiler/construct-object.js
index f56e6717f63737..1da2b1e9a23788 100644
--- a/deps/v8/test/mjsunit/compiler/construct-object.js
+++ b/deps/v8/test/mjsunit/compiler/construct-object.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --turbofan
+// Flags: --allow-natives-syntax --turbofan --turboshaft-enable-debug-features
 
 Object.prototype.bla = function() {}
 
diff --git a/deps/v8/test/mjsunit/compiler/construct-receiver.js b/deps/v8/test/mjsunit/compiler/construct-receiver.js
index e030745a255715..aa7a756a96acfc 100644
--- a/deps/v8/test/mjsunit/compiler/construct-receiver.js
+++ b/deps/v8/test/mjsunit/compiler/construct-receiver.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turboshaft-enable-debug-features
 
 class C {
   bla() {};
diff --git a/deps/v8/test/mjsunit/compiler/diamond-followedby-branch.js b/deps/v8/test/mjsunit/compiler/diamond-followedby-branch.js
index 4bce475c0de56d..e46436046167c5 100644
--- a/deps/v8/test/mjsunit/compiler/diamond-followedby-branch.js
+++ b/deps/v8/test/mjsunit/compiler/diamond-followedby-branch.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --no-assert-types
+// Flags: --turboshaft-enable-debug-features
 
 // Check that the branch elimination replace the redundant branch condition with
 // a phi node, and then the branch is folded in EffectControlLinearizationPhase.
diff --git a/deps/v8/test/mjsunit/compiler/fast-api-calls-64-bit-integer-values.js b/deps/v8/test/mjsunit/compiler/fast-api-calls-64-bit-integer-values.js
new file mode 100644
index 00000000000000..71de05de8ea9b4
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/fast-api-calls-64-bit-integer-values.js
@@ -0,0 +1,218 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// This file excercises basic fast API calls and enables fuzzing of this
+// functionality.
+
+// Flags: --turbo-fast-api-calls --expose-fast-api --allow-natives-syntax --turbofan
+// --always-turbofan is disabled because we rely on particular feedback for
+// optimizing to the fastest path.
+// Flags: --no-always-turbofan
+// The test relies on optimizing/deoptimizing at predictable moments, so
+// it's not suitable for deoptimization fuzzing.
+// Flags: --deopt-every-n-times=0
+
+const fast_c_api = new d8.test.FastCAPI();
+
+// ---------- Test 64-bit integer return values -----------
+
+function reset_counts() {
+  return fast_c_api.reset_counts();
+}
+
+function fast_call_count() {
+  return fast_c_api.fast_call_count();
+}
+
+function slow_call_count() {
+  return fast_c_api.slow_call_count();
+}
+
+function sum_int64_as_number(a, b) {
+  return fast_c_api.sum_int64_as_number(a, b);
+}
+
+function sum_int64_as_bigint(a, b) {
+  return fast_c_api.sum_int64_as_bigint(a, b);
+}
+
+function sum_uint64_as_number(a, b) {
+  return fast_c_api.sum_uint64_as_number(a, b);
+}
+
+function sum_uint64_as_bigint(a, b) {
+  return fast_c_api.sum_uint64_as_bigint(a, b);
+}
+
+let result;
+
+/* ===================== Return as number =====================  */
+
+// === Sum 64-bit signed integers ===
+
+// Prepare
+reset_counts();
+// Test slow path throwing errors on invalid parameters
+assertThrows(() => sum_int64_as_number(136n, 2467247n));
+assertEquals(fast_call_count(), 0);
+assertEquals(slow_call_count(), 1);
+
+%PrepareFunctionForOptimization(sum_int64_as_number);
+result = sum_int64_as_number(0, 0);
+assertEquals(fast_call_count(), 0);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 0);
+
+// Test Smi path
+%OptimizeFunctionOnNextCall(sum_int64_as_number);
+result = sum_int64_as_number(0, 0);
+assertEquals(fast_call_count(), 1);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 0);
+
+// Test non-Smi path
+result = sum_int64_as_number(2 ** 33, 2467247);
+assertEquals(fast_call_count(), 2);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 2 ** 33 + 2467247);
+
+// Test fast call returning over MAX_SAFE_INTEGER
+result = sum_int64_as_number(Number.MAX_SAFE_INTEGER, 1024);
+assertEquals(fast_call_count(), 3);
+assertEquals(slow_call_count(), 2);
+assertFalse(Number.isSafeInteger(result));
+assertEquals(result, Number.MAX_SAFE_INTEGER + 1024);
+
+// Test fast call returning safe negative number
+result = sum_int64_as_number(10, -24737);
+assertEquals(fast_call_count(), 4);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 10 - 24737);
+
+// Test fast call returning below MIN_SAFE_INTEGER
+result = sum_int64_as_number(-1024, Number.MIN_SAFE_INTEGER);
+assertEquals(fast_call_count(), 5);
+assertEquals(slow_call_count(), 2);
+assertFalse(Number.isSafeInteger(result));
+assertEquals(result, -1024 + Number.MIN_SAFE_INTEGER);
+
+
+// === Sum 64-bit unsigned integers ===
+
+// Prepare
+reset_counts();
+// Test slow path throwing errors on invalid parameters
+assertThrows(() => sum_uint64_as_number(136n, 2467247n));
+assertEquals(fast_call_count(), 0);
+assertEquals(slow_call_count(), 1);
+
+%PrepareFunctionForOptimization(sum_uint64_as_number);
+result = sum_uint64_as_number(0, 0);
+assertEquals(fast_call_count(), 0);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 0);
+
+// Test Smi path
+%OptimizeFunctionOnNextCall(sum_uint64_as_number);
+result = sum_uint64_as_number(0, 0);
+assertEquals(fast_call_count(), 1);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 0);
+
+// Test non-Smi path
+result = sum_uint64_as_number(2 ** 33, 2467247);
+assertEquals(fast_call_count(), 2);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 2 ** 33 + 2467247);
+
+// Test fast call returning over MAX_SAFE_INTEGER
+result = sum_uint64_as_number(Number.MAX_SAFE_INTEGER, 1024);
+assertEquals(fast_call_count(), 3);
+assertEquals(slow_call_count(), 2);
+assertFalse(Number.isSafeInteger(result));
+assertEquals(result, Number.MAX_SAFE_INTEGER + 1024);
+
+/* ===================== Return as BigInt =====================  */
+
+
+// === Sum 64-bit signed integers ===
+
+// Prepare
+reset_counts();
+// Test slow path throwing errors on invalid parameters
+assertThrows(() => sum_int64_as_bigint(136, 2467247));
+assertEquals(fast_call_count(), 0);
+assertEquals(slow_call_count(), 1);
+
+%PrepareFunctionForOptimization(sum_int64_as_bigint);
+result = sum_int64_as_bigint(0n, 0n);
+assertEquals(fast_call_count(), 0);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 0n);
+
+// Test Smi path
+%OptimizeFunctionOnNextCall(sum_int64_as_bigint);
+result = sum_int64_as_bigint(0n, 0n);
+assertEquals(fast_call_count(), 1);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 0n);
+
+// Test non-Smi path
+result = sum_int64_as_bigint(2n ** 33n, 2467247n);
+assertEquals(fast_call_count(), 2);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 2n ** 33n + 2467247n);
+
+// Test fast call returning over MAX_SAFE_INTEGER
+result = sum_int64_as_bigint(BigInt(Number.MAX_SAFE_INTEGER), 1024n);
+assertEquals(fast_call_count(), 3);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, BigInt(Number.MAX_SAFE_INTEGER) + 1024n);
+
+// Test fast call returning safe negative number
+result = sum_int64_as_bigint(10n, -24737n);
+assertEquals(fast_call_count(), 4);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 10n - 24737n);
+
+// Test fast call returning below MIN_SAFE_INTEGER
+result = sum_int64_as_bigint(-1024n, BigInt(Number.MIN_SAFE_INTEGER));
+assertEquals(fast_call_count(), 5);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, -1024n + BigInt(Number.MIN_SAFE_INTEGER));
+
+
+// === Sum 64-bit unsigned integers ===
+
+// Prepare
+reset_counts();
+// Test slow path throwing errors on invalid parameters
+assertThrows(() => sum_uint64_as_bigint(136, 2467247));
+assertEquals(fast_call_count(), 0);
+assertEquals(slow_call_count(), 1);
+
+%PrepareFunctionForOptimization(sum_uint64_as_bigint);
+result = sum_uint64_as_bigint(0n, 0n);
+assertEquals(fast_call_count(), 0);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 0n);
+
+// Test Smi path
+%OptimizeFunctionOnNextCall(sum_uint64_as_bigint);
+result = sum_uint64_as_bigint(0n, 0n);
+assertEquals(fast_call_count(), 1);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 0n);
+
+// Test non-Smi path
+result = sum_uint64_as_bigint(2n ** 33n, 2467247n);
+assertEquals(fast_call_count(), 2);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, 2n ** 33n + 2467247n);
+
+// Test fast call returning over MAX_SAFE_INTEGER
+result = sum_uint64_as_bigint(BigInt(Number.MAX_SAFE_INTEGER), 1024n);
+assertEquals(fast_call_count(), 3);
+assertEquals(slow_call_count(), 2);
+assertEquals(result, BigInt(Number.MAX_SAFE_INTEGER) + 1024n);
diff --git a/deps/v8/test/mjsunit/compiler/fast-api-calls-wasm.js b/deps/v8/test/mjsunit/compiler/fast-api-calls-wasm.js
index f0fecd818073da..68000adc87f851 100644
--- a/deps/v8/test/mjsunit/compiler/fast-api-calls-wasm.js
+++ b/deps/v8/test/mjsunit/compiler/fast-api-calls-wasm.js
@@ -48,17 +48,16 @@ function buildWasm(name, sig, body) {
     'test_wasm_memory',
     makeSig([kWasmI32], [kWasmI32]),
   );
-  builder
-    .addMemory(1, 1)
-    .addFunction(name, sig)
-    .addBody(body({
-      add_all_no_options,
-      add_all_no_options_mismatch,
-      add_all_nested_bound,
-      overloaded_add_all_32bit_int,
-      test_wasm_memory,
-    }))
-    .exportFunc();
+  builder.addMemory(1, 1);
+  builder.addFunction(name, sig)
+      .addBody(body({
+        add_all_no_options,
+        add_all_no_options_mismatch,
+        add_all_nested_bound,
+        overloaded_add_all_32bit_int,
+        test_wasm_memory,
+      }))
+      .exportFunc();
   const x = {};
   const module = builder.instantiate({
     fast_c_api: {
diff --git a/deps/v8/test/mjsunit/compiler/fast-api-exceptions.js b/deps/v8/test/mjsunit/compiler/fast-api-exceptions.js
new file mode 100644
index 00000000000000..e3fb900ff05a4b
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/fast-api-exceptions.js
@@ -0,0 +1,27 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --expose-fast-api
+
+const fast_c_api = new d8.test.FastCAPI();
+
+(function main() {
+  let thrown_count = 0;
+  function fallback_and_throw() {
+    try {
+      thrown_count++;
+      fast_c_api.throw_fallback();
+    } catch (err) {
+      thrown_count--;
+    }
+  }
+
+  %PrepareFunctionForOptimization(fallback_and_throw);
+  fallback_and_throw();
+  assertEquals(0, thrown_count);
+
+  %OptimizeFunctionOnNextCall(fallback_and_throw);
+  fallback_and_throw();
+  assertEquals(0, thrown_count);
+})();
diff --git a/deps/v8/test/mjsunit/compiler/inlined-call-polymorphic.js b/deps/v8/test/mjsunit/compiler/inlined-call-polymorphic.js
index 28be3e80906218..ee065f34427fe9 100644
--- a/deps/v8/test/mjsunit/compiler/inlined-call-polymorphic.js
+++ b/deps/v8/test/mjsunit/compiler/inlined-call-polymorphic.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --allow-natives-syntax --turbofan
+// Flags: --allow-natives-syntax --turbofan --turboshaft-enable-debug-features
 
 function make_closure() { return () => { return 42; } }
 %PrepareFunctionForOptimization(make_closure);
diff --git a/deps/v8/test/mjsunit/compiler/js-create-arguments.js b/deps/v8/test/mjsunit/compiler/js-create-arguments.js
index d15181fde48194..3549440a57ab46 100644
--- a/deps/v8/test/mjsunit/compiler/js-create-arguments.js
+++ b/deps/v8/test/mjsunit/compiler/js-create-arguments.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --turbofan
+// Flags: --allow-natives-syntax --turbofan --turboshaft-enable-debug-features
 
 class C extends Object {
   bla() {}
diff --git a/deps/v8/test/mjsunit/compiler/js-create.js b/deps/v8/test/mjsunit/compiler/js-create.js
index e2bcc2454c588c..19a283c5906abd 100644
--- a/deps/v8/test/mjsunit/compiler/js-create.js
+++ b/deps/v8/test/mjsunit/compiler/js-create.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --turbofan
+// Flags: --allow-natives-syntax --turbofan --turboshaft-enable-debug-features
 
 class C extends Object {
   bla() {}
diff --git a/deps/v8/test/mjsunit/compiler/load-elimination-const-field.js b/deps/v8/test/mjsunit/compiler/load-elimination-const-field.js
index 0f215c2d8033ed..842dffb3c4fa58 100644
--- a/deps/v8/test/mjsunit/compiler/load-elimination-const-field.js
+++ b/deps/v8/test/mjsunit/compiler/load-elimination-const-field.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turboshaft-enable-debug-features
 
 // Check that load elimination on const-marked fields works
 (function() {
diff --git a/deps/v8/test/mjsunit/compiler/load-elimination-typed-arrays.js b/deps/v8/test/mjsunit/compiler/load-elimination-typed-arrays.js
new file mode 100644
index 00000000000000..a0d55a53e40f4d
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/load-elimination-typed-arrays.js
@@ -0,0 +1,48 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turboshaft-load-elimination
+
+function is_big_endian() {
+  const array = new Uint32Array(1);
+  array[0] = 5;
+  const view = new Uint8Array(array.buffer);
+  return view[0] != 5;
+}
+
+// Test with 2 arrays aliasing because of different kind sizes.
+function f(u32s, u8s) {
+  u32s[0] = 0xffffffff;
+  // The following store will overlap with the 1st store, and should thus
+  // invalidate the Load Elimination state associated with the 1st store.
+  u8s[1] = 0;
+  // The following load should not be eliminated.
+  return u32s[0];
+}
+
+const u32s = Uint32Array.of(3, 8);
+const u8s = new Uint8Array(u32s.buffer);
+
+const r = is_big_endian() ? 0xff00ffff : 0xffff00ff;
+%PrepareFunctionForOptimization(f);
+assertEquals(f(u32s, u8s), r);
+%OptimizeFunctionOnNextCall(f);
+assertEquals(f(u32s, u8s), r);
+
+
+// Test with 2 arrays aliasing because their bases have different offsets.
+function g(ta1, ta2) {
+  ta2[0] = 0xff;
+  ta1[100] = 42;
+  return ta2[0];
+}
+
+let buffer = new ArrayBuffer(10000);
+let ta1 = new Int32Array(buffer, 0/*offset*/);
+let ta2 = new Int32Array(buffer, 100*4/*offset*/);
+
+%PrepareFunctionForOptimization(g);
+assertEquals(g(ta1, ta2), 42);
+%OptimizeFunctionOnNextCall(g);
+assertEquals(g(ta1, ta2), 42);
diff --git a/deps/v8/test/mjsunit/compiler/opt-next-call-turbo.js b/deps/v8/test/mjsunit/compiler/opt-next-call-turbo.js
index 1dbbdc338209f8..1314dacd3d507b 100644
--- a/deps/v8/test/mjsunit/compiler/opt-next-call-turbo.js
+++ b/deps/v8/test/mjsunit/compiler/opt-next-call-turbo.js
@@ -9,6 +9,8 @@ function foo() {
 }
 
 %PrepareFunctionForOptimization(foo);
+foo();
+foo();
 %OptimizeFunctionOnNextCall(foo);
 assertEquals("fooed", foo());
 assertOptimized(foo);
@@ -19,6 +21,7 @@ function bar() {
 
 %PrepareFunctionForOptimization(bar);
 assertEquals("bared", bar());
+assertEquals("bared", bar());
 %OptimizeFunctionOnNextCall(bar);
 assertEquals("bared", bar());
 assertOptimized(bar);
diff --git a/deps/v8/test/mjsunit/compiler/osr-literals.js b/deps/v8/test/mjsunit/compiler/osr-literals.js
index 9d609f1db7da65..a7196ea086018f 100644
--- a/deps/v8/test/mjsunit/compiler/osr-literals.js
+++ b/deps/v8/test/mjsunit/compiler/osr-literals.js
@@ -7,8 +7,8 @@
 function mod() {
   function f0() {
     for (var i = 0; i < 3; i = i + 1 | 0) {
-      %OptimizeOsr();
       %PrepareFunctionForOptimization(f0);
+      %OptimizeOsr();
     }
     return {blah: i};
   }
@@ -16,8 +16,8 @@ function mod() {
 
   function f1(a) {
     for (var i = 0; i < 3; i = i + 1 | 0) {
-      %OptimizeOsr();
       %PrepareFunctionForOptimization(f1);
+      %OptimizeOsr();
     }
     return {blah: i};
   }
@@ -25,8 +25,8 @@ function mod() {
 
   function f2(a,b) {
     for (var i = 0; i < 3; i = i + 1 | 0) {
-      %OptimizeOsr();
       %PrepareFunctionForOptimization(f2);
+      %OptimizeOsr();
     }
     return {blah: i};
   }
@@ -34,8 +34,8 @@ function mod() {
 
   function f3(a,b,c) {
     for (var i = 0; i < 3; i = i + 1 | 0) {
-      %OptimizeOsr();
       %PrepareFunctionForOptimization(f3);
+      %OptimizeOsr();
     }
     return {blah: i};
   }
@@ -43,8 +43,8 @@ function mod() {
 
   function f4(a,b,c,d) {
     for (var i = 0; i < 3; i = i + 1 | 0) {
-      %OptimizeOsr();
       %PrepareFunctionForOptimization(f4);
+      %OptimizeOsr();
     }
     return {blah: i};
   }
diff --git a/deps/v8/test/mjsunit/compiler/reference-equal-boolean.js b/deps/v8/test/mjsunit/compiler/reference-equal-boolean.js
index 980c8bace2d702..5ab1ab5f684360 100644
--- a/deps/v8/test/mjsunit/compiler/reference-equal-boolean.js
+++ b/deps/v8/test/mjsunit/compiler/reference-equal-boolean.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turboshaft-enable-debug-features
 
 // Ensure we could reduce reference equal with boolean input.
 // When the inputs are all boolean with true constant, we could
diff --git a/deps/v8/test/mjsunit/compiler/regress-1423468.js b/deps/v8/test/mjsunit/compiler/regress-1423468.js
new file mode 100644
index 00000000000000..f2c24d2e64fe7d
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-1423468.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function f() {
+    let str = "aaaaaaaaaaaaaaaaaaaaaaaa";
+    for (let i = 0; i < 32768; i++) {
+        str += "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaa";
+    }
+}
+
+%PrepareFunctionForOptimization(f);
+f();
+%OptimizeFunctionOnNextCall(f);
+f();
diff --git a/deps/v8/test/mjsunit/compiler/regress-1459796.js b/deps/v8/test/mjsunit/compiler/regress-1459796.js
new file mode 100644
index 00000000000000..3792e870352ea8
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-1459796.js
@@ -0,0 +1,58 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+
+// Test strings with non-ascii chars
+
+(function() {
+  function foo() {
+    // no index results in index = 0
+    return '\u1234'.charAt() == '\u1234';
+  }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals(true, foo());
+  assertEquals(true, foo());
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals(true, foo());
+  assertOptimized(foo);
+})();
+
+// General case where index is within bounds
+(function() {
+  function foo() {
+    return "\u2600\u2600\u2600 \u26A1 \u26A1 \u2603\u2603\u2603 \u2600".charAt(2) === "\u2600";
+  }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals(true, foo());
+  assertEquals(true, foo());
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals(true, foo());
+  assertOptimized(foo);
+})();
+
+// Case wherein index is out of bounds (returns empty string)
+(function() {
+  function foo() {
+    return "\u2600\u2600\u2600 \u26A1 \u26A1 \u2603\u2603\u2603 \u2600".charAt(100) === "";
+  }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals(true, foo());
+  assertEquals(true, foo());
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals(true, foo());
+  assertOptimized(foo);
+})();
+
+// Case wherein index is negative (returns empty string)
+(function() {
+  function foo() {
+    return "\u2600\u2600\u2600 \u26A1 \u26A1 \u2603\u2603\u2603 \u2600".charAt(-1) === "";
+  }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals(true, foo());
+  assertEquals(true, foo());
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals(true, foo());
+})();
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1426299.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1426299.js
new file mode 100644
index 00000000000000..86dc30b02476a9
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1426299.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+
+const f = async (...args) => {
+    const x = typeof args;
+    x.concat(f);
+    const y = args.reduce(f, args);
+    y[y];
+};
+%PrepareFunctionForOptimization(f);
+f();
+%OptimizeFunctionOnNextCall(f);
+f();
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1457532.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1457532.js
new file mode 100644
index 00000000000000..42e97dc1f2ff70
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1457532.js
@@ -0,0 +1,12 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-fast-api
+
+const capi = new d8.test.FastCAPI();
+
+assertThrows(() => capi.sum_int64_as_number(0, 1.7976931348623157e+308),
+             Error, /out of int64_t range/);
+assertThrows(() => capi.sum_uint64_as_number(1.7976931348623157e+308, 0),
+             Error, /out of uint64_t range/);
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1463334.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1463334.js
new file mode 100644
index 00000000000000..63104a926fd8c6
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1463334.js
@@ -0,0 +1,15 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --turboshaft --no-lazy --jit-fuzzing
+
+for (let i = 0; i < 100; i++) {
+    function f() {
+    }
+    const a = Array(2);
+    try {
+        a.reduceRight(f);
+    } catch(e) {
+    }
+}
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1464516.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1464516.js
new file mode 100644
index 00000000000000..a638ed1c179734
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1464516.js
@@ -0,0 +1,31 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-turbo-escape --no-turbo-allocation-folding
+
+function f() {
+  // Allocating an array that will be initialized with holes.
+  let arr = new Array(5);
+  // Doing a bunch more allocations in the hope of triggering a GC.
+  [arr, 5, 6, 7, [8], [9]];
+  [2, 5, 6, 7, [8], [9]];
+  [2, 5, 6, 7, [8], [9]];
+  [2, 5, 6, 7, [8], [9]];
+  [2, 5, 6, 7, [8], [9]];
+  [2, 5, 6, 7, [8], [9]];
+  [2, 5, 6, 7, [8], [9]];
+  [2, 5, 6, 7, [8], [9]];
+  [2, 5, 6, 7, [8], [9]];
+  // Setting arr[3]. Because previous allocations could trigger GCs, store-store
+  // elimination should not remove the initial hole-initialization of arr[3],
+  // otherwise the GC could see an undefined field.
+  arr[3] = 42;
+  return arr;
+}
+
+// Running `f` a few times, in the hope that a GC will eventually be scheduled
+// inside it.
+for (let i = 0; i < 5000; i++) {
+  f();
+}
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1465075.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1465075.js
new file mode 100644
index 00000000000000..ca13e664781572
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1465075.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --turboshaft --no-lazy-feedback-allocation --allow-natives-syntax
+
+function f1(a3) {
+  function f4() {
+    for (let [,v10] of "-1328336618") {
+      Math.acosh(Math);
+      return 3;
+    }
+  }
+  let v13;
+  try { v13 = f4(); } catch (e) {}
+  [a3].findIndex(f4, v13);
+  return f1;
+}
+%PrepareFunctionForOptimization(f1);
+const v16 = f1();
+v16();
+%OptimizeFunctionOnNextCall(f1);
+f1();
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1467471.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1467471.js
new file mode 100644
index 00000000000000..ef780088dbe9b7
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1467471.js
@@ -0,0 +1,22 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --turboshaft --turboshaft-load-elimination --jit-fuzzing
+// Flags: --allow-natives-syntax
+
+function f0() {
+  const v3 = [2.0, , {}];
+  function f5(a7) {
+    a7.join().concat(a7);
+    ~a7[0];
+    const o12 = {
+      __proto__: v3,
+    };
+  }
+  f5(v3);
+}
+%PrepareFunctionForOptimization(f0);
+f0();
+%OptimizeFunctionOnNextCall(f0);
+f0();
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1468717.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1468717.js
new file mode 100644
index 00000000000000..3089d6e053dafa
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1468717.js
@@ -0,0 +1,25 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --turboshaft --turboshaft-load-elimination --allow-natives-syntax
+
+const explore =function() {
+    function exploreWithErrorHandling() {
+        try {
+            explore();
+        } catch (e) {
+        }
+    }
+    return exploreWithErrorHandling;
+}();
+const v7 = new Uint8ClampedArray(7389);
+function f8() {
+    v7[0] = 0.5;
+    const v11 = v7[0];
+    explore( v11, []);
+}
+%PrepareFunctionForOptimization(f8);
+f8();
+%OptimizeFunctionOnNextCall(f8);
+f8();
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1470495.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1470495.js
new file mode 100644
index 00000000000000..dddbdd705b66e3
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1470495.js
@@ -0,0 +1,24 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --turboshaft --allow-natives-syntax --turboshaft-future --jit-fuzzing
+
+const v1 = {};
+
+function f2() {
+  for (let i4 = 1;
+       i4 > -1;
+       (() => {
+         const v10 = this.version;
+         v10.h = v10;
+         i4 = i4 - 2;
+       })()) {
+         v1.c &= i4;
+       }
+}
+
+%PrepareFunctionForOptimization(f2);
+f2();
+%OptimizeFunctionOnNextCall(f2);
+f2();
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1474066.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1474066.js
new file mode 100644
index 00000000000000..f3c7a007b87fde
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1474066.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turboshaft --turboshaft-typed-optimizations
+
+function f0() {
+    for (let i3 = 0; i3 < 1; i3++) {
+        function f9() {
+        }
+    }
+}
+const v16 = %PrepareFunctionForOptimization(f0);
+const v18 = f0();
+const v19 = %OptimizeFunctionOnNextCall(f0);
+f0();
diff --git a/deps/v8/test/mjsunit/compiler/regress-crbug-1486342.js b/deps/v8/test/mjsunit/compiler/regress-crbug-1486342.js
new file mode 100644
index 00000000000000..c35a7339801d03
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/regress-crbug-1486342.js
@@ -0,0 +1,25 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --jit-fuzzing
+
+const o13 = {
+  "maxByteLength": 5368789,
+};
+const v14 = new ArrayBuffer(129, o13);
+const v16 = new Uint16Array(v14);
+
+function f3(param) {
+  for (let i = 0; i < 5; i++) {
+    try {"resize".includes(v14); } catch (e) {}
+    v14.resize(3.0, ..."resize", ...v16);
+  }
+
+  let f = function() { return param; }
+}
+
+%PrepareFunctionForOptimization(f3);
+f3();
+%OptimizeFunctionOnNextCall(f3);
+f3();
diff --git a/deps/v8/test/mjsunit/compiler/serializer-accessors.js b/deps/v8/test/mjsunit/compiler/serializer-accessors.js
index 8d52dc3c7ab893..01d9c56ee005a9 100644
--- a/deps/v8/test/mjsunit/compiler/serializer-accessors.js
+++ b/deps/v8/test/mjsunit/compiler/serializer-accessors.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+// Flags: --turboshaft-enable-debug-features
 
 var expect_interpreted = true;
 
diff --git a/deps/v8/test/mjsunit/compiler/serializer-apply.js b/deps/v8/test/mjsunit/compiler/serializer-apply.js
index 81ac7a9181bc54..6595805d8b7825 100644
--- a/deps/v8/test/mjsunit/compiler/serializer-apply.js
+++ b/deps/v8/test/mjsunit/compiler/serializer-apply.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+// Flags: --turboshaft-enable-debug-features
 
 function apply(arg) {
   "use strict";
diff --git a/deps/v8/test/mjsunit/compiler/serializer-call.js b/deps/v8/test/mjsunit/compiler/serializer-call.js
index 8b614b9e3721f2..597170c490ba32 100644
--- a/deps/v8/test/mjsunit/compiler/serializer-call.js
+++ b/deps/v8/test/mjsunit/compiler/serializer-call.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+// Flags: --turboshaft-enable-debug-features
 
 function call(cb) {
   return cb.call(this, 42);
diff --git a/deps/v8/test/mjsunit/compiler/serializer-dead-after-jump.js b/deps/v8/test/mjsunit/compiler/serializer-dead-after-jump.js
index 98544a2bb84a27..cda027908a41cf 100644
--- a/deps/v8/test/mjsunit/compiler/serializer-dead-after-jump.js
+++ b/deps/v8/test/mjsunit/compiler/serializer-dead-after-jump.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+// Flags: --turboshaft-enable-debug-features
 
 function f(x) {
   // TODO(v8:11457) If v8_dict_property_const_tracking is enabled, then the
diff --git a/deps/v8/test/mjsunit/compiler/serializer-dead-after-return.js b/deps/v8/test/mjsunit/compiler/serializer-dead-after-return.js
index 7cadccdca34d51..3e72c56141dda9 100644
--- a/deps/v8/test/mjsunit/compiler/serializer-dead-after-return.js
+++ b/deps/v8/test/mjsunit/compiler/serializer-dead-after-return.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+// Flags: --allow-natives-syntax --turbofan --no-always-turbofan --turboshaft-enable-debug-features
 
 function f(x) {
   if (!%IsDictPropertyConstTrackingEnabled()) {
diff --git a/deps/v8/test/mjsunit/compiler/serializer-feedback-propagation-1.js b/deps/v8/test/mjsunit/compiler/serializer-feedback-propagation-1.js
index 13e88639dbc125..1438821f536c31 100644
--- a/deps/v8/test/mjsunit/compiler/serializer-feedback-propagation-1.js
+++ b/deps/v8/test/mjsunit/compiler/serializer-feedback-propagation-1.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turboshaft-enable-debug-features
 
 var obj = Object.create(Object.create({blu: 42}));
 obj.bla = 1;
diff --git a/deps/v8/test/mjsunit/compiler/serializer-feedback-propagation-2.js b/deps/v8/test/mjsunit/compiler/serializer-feedback-propagation-2.js
index 5622719f7d49b4..16a258a6d91c83 100644
--- a/deps/v8/test/mjsunit/compiler/serializer-feedback-propagation-2.js
+++ b/deps/v8/test/mjsunit/compiler/serializer-feedback-propagation-2.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turboshaft-enable-debug-features
 
 var obj = Object.create(Object.create({blu: 42}));
 obj.bla = 1;
diff --git a/deps/v8/test/mjsunit/compiler/serializer-transition-propagation.js b/deps/v8/test/mjsunit/compiler/serializer-transition-propagation.js
index 78776b627be46f..e1fbb2023cebfc 100644
--- a/deps/v8/test/mjsunit/compiler/serializer-transition-propagation.js
+++ b/deps/v8/test/mjsunit/compiler/serializer-transition-propagation.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+// Flags: --turboshaft-enable-debug-features
 
 var expect_interpreted = true;
 
diff --git a/deps/v8/test/mjsunit/compiler/string-charAt.js b/deps/v8/test/mjsunit/compiler/string-charAt.js
new file mode 100644
index 00000000000000..ce57e42e9580d7
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/string-charAt.js
@@ -0,0 +1,141 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+
+// Variable index and constant string
+(function() {
+  function foo(n) { return "abc eFgH iskla iqi iiak".charAt(n); }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals("a", foo(0));
+  assertEquals("b", foo(1));
+  assertEquals("c", foo(2));
+  assertEquals(" ", foo(3));
+  assertEquals("s", foo(10));
+  assertEquals("", foo(100));
+  assertEquals("", foo(-1));
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals("a", foo(0));
+  assertEquals("b", foo(1));
+  assertEquals("c", foo(2));
+  assertEquals(" ", foo(3));
+  assertEquals("s", foo(10));
+  assertOptimized(foo);
+  // deoptimisation happens because of
+  // index being out of bounds
+  assertEquals("", foo(100));
+  assertEquals("", foo(-1));
+  assertUnoptimized(foo);
+})();
+
+// Variable string and constant index
+(function() {
+  function foo(st) { return st.charAt(1); }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals("b", foo("abc"));
+  assertEquals("a", foo("aab"));
+  assertEquals("e", foo("hello"));
+  assertEquals("y", foo("hya"));
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals("b", foo("abc"));
+  assertEquals("a", foo("aab"));
+  assertEquals("e", foo("hello"));
+  assertEquals("y", foo("hya"));
+  assertOptimized(foo);
+  // deoptimisation happens because of
+  // index being out of bounds
+  assertEquals("", foo(""));
+  assertEquals("", foo("a"));
+  assertUnoptimized(foo);
+})();
+
+// Constant string and constant index
+// should result in constant folding
+(function() {
+  function foo() { return 'abc'.charAt(1); }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals("b", foo());
+  assertEquals("b", foo());
+  assertEquals("b", foo());
+  assertEquals("b", foo());
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals("b", foo());
+  assertEquals("b", foo());
+  assertEquals("b", foo());
+  assertEquals("b", foo());
+  assertOptimized(foo);
+})();
+
+// Deoptimisation in case of non-smi index in
+// constant folding
+(function() {
+  function foo() {
+    const st = 'abc';
+    const non_smi = 4294967297;
+    return st.charAt(non_smi);
+  }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals("", foo());
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals("", foo());
+  // should not be constant folded
+  // because of non-smi index
+  assertUnoptimized(foo);
+})();
+
+// Test for optimisation and deopt on
+// passing non-string as receiver
+(function() {
+  function foo(st, i) { return st.charAt(i); }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals("b", foo("abc", 1));
+  assertEquals("a", foo("aab", 0));
+  assertEquals("o", foo("hello", 4));
+  assertEquals("d", foo("hello world", 10));
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals("b", foo("abc", 1));
+  assertEquals("a", foo("aab", 0));
+  assertEquals("o", foo("hello", 4));
+  assertEquals("d", foo("hello world", 10));
+  assertOptimized(foo);
+  // deoptimisation happens because of
+  // receiver being not a string
+  assertThrows(() => foo({}, 1), TypeError);
+  assertUnoptimized(foo);
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals("o", foo("hello", 4));
+  assertThrows(() => foo({}, 1), TypeError);
+  assertOptimized(foo);
+  assertThrows(() => foo({ a: 1 }, 1), TypeError);
+  assertUnoptimized(foo);
+})();
+
+// Test for optimisation and deopt on
+// passing non-smi as index
+(function() {
+  function foo(st, i) { return st.charAt(i); }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals("b", foo("abc", 1));
+  assertEquals("a", foo("aab", 0));
+  assertEquals("o", foo("hello", 4));
+  assertEquals("d", foo("hello world", 10));
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals("b", foo("abc", 1));
+  assertEquals("a", foo("aab", 0));
+  assertEquals("o", foo("hello", 4));
+  assertEquals("d", foo("hello world", 10));
+  assertOptimized(foo);
+
+  // deoptimisation happens because of
+  // index being not a smi
+  assertEquals("", foo("abc", 4294967297));
+  assertUnoptimized(foo);
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals("o", foo("hello", 4));
+  assertEquals("", foo("abc", 4294967297));
+  assertEquals("a", foo("abc", {}));
+  assertEquals("b", foo("abc", 1.5));
+  assertEquals("a", foo("abc", NaN));
+  assertOptimized(foo);
+})();
diff --git a/deps/v8/test/mjsunit/compiler/string-endswith.js b/deps/v8/test/mjsunit/compiler/string-endswith.js
new file mode 100644
index 00000000000000..88d3c38bbc23b7
--- /dev/null
+++ b/deps/v8/test/mjsunit/compiler/string-endswith.js
@@ -0,0 +1,203 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+
+// initial simple test case
+(function() {
+  function foo(string) { return string.endsWith('a'); }
+
+  %PrepareFunctionForOptimization(foo);
+  assertEquals(false, foo(''));
+  assertEquals(true, foo('a'));
+  assertEquals(false, foo('ab'));
+  assertEquals(true, foo('cba'));
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals(false, foo(''));
+  assertEquals(true, foo('a'));
+  assertEquals(false, foo('ab'));
+  assertEquals(true, foo('cba'));
+  assertOptimized(foo);
+})();
+
+// simple test case with a string longer than kMaxInlineMatchSequence
+(function() {
+  function foo(string) { return string.endsWith('abacd'); }
+
+  %PrepareFunctionForOptimization(foo);
+  assertEquals(false, foo(''));
+  assertEquals(true, foo('aaababacd'));
+  assertEquals(false, foo('ababababa'));
+  assertEquals(true, foo('cbaaabacd'));
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals(false, foo(''));
+  assertEquals(true, foo('aaabaabacd'));
+  assertEquals(false, foo('ababababa'));
+  assertEquals(true, foo('cbaaabacd'));
+  assertOptimized(foo);
+})();
+
+// simple test case with empty values
+(function() {
+  function f() { return "abc".endsWith(); }
+
+  %PrepareFunctionForOptimization(f);
+  assertEquals(false, f());
+  assertEquals(false, f());
+  %OptimizeFunctionOnNextCall(f);
+  assertEquals(false, f());
+  assertOptimized(f);
+})();
+
+// test case to check if matching is proper given changing end index
+(function() {
+  function g(n) { return "cba ahaa yyaaa aah".endsWith("a", n); }
+  %PrepareFunctionForOptimization(g);
+  assertEquals(false, g(-1));
+  assertEquals(false, g(0));
+  assertEquals(false, g(1));
+  assertEquals(false, g(2));
+  assertEquals(true, g(3));
+  assertEquals(false, g(6));
+  assertEquals(true, g(12));
+  assertEquals(true, g(16));
+  %OptimizeFunctionOnNextCall(g);
+  assertEquals(false, g(-1));
+  assertEquals(false, g(0));
+  assertEquals(false, g(1));
+  assertEquals(false, g(2));
+  assertEquals(true, g(3));
+  assertEquals(false, g(6));
+  assertEquals(true, g(12));
+  assertEquals(true, g(16));
+  assertOptimized(g);
+})();
+
+// test case to check if matching is proper given changing end index, with
+// longer string
+(function() {
+  function g(n) { return "aaaa hhaaaa maaaam zzzaaaaii".endsWith("aaaa", n); }
+  %PrepareFunctionForOptimization(g);
+  assertEquals(false, g(-1));
+  assertEquals(false, g(0));
+  assertEquals(false, g(1));
+  assertEquals(false, g(2));
+  assertEquals(true, g(4));
+  assertEquals(false, g(9));
+  assertEquals(true, g(11));
+  assertEquals(false, g(14));
+  assertEquals(true, g(17));
+  assertEquals(false, g(22));
+  assertEquals(true, g(26));
+  %OptimizeFunctionOnNextCall(g);
+  assertEquals(false, g(-1));
+  assertEquals(false, g(0));
+  assertEquals(false, g(1));
+  assertEquals(false, g(2));
+  assertEquals(true, g(4));
+  assertEquals(false, g(9));
+  assertEquals(true, g(11));
+  assertEquals(false, g(14));
+  assertEquals(true, g(17));
+  assertEquals(false, g(22));
+  assertEquals(true, g(26));
+  assertOptimized(g);
+})();
+
+// dynamic test cases with both changing end index and changing search string
+// where the search string is shorter than kMaxInlineMatchSequence
+(function() {
+  function f(w, n) { return "The quick brown fox jumps over the lazy dog".endsWith(w, n) }
+  %PrepareFunctionForOptimization(f);
+  assertEquals(true, f('dog'));
+  assertEquals(false, f('dog', 40));
+  assertEquals(true, f('ver', 30));
+  assertEquals(false, f('ver', 31));
+  assertEquals(true, f('er ', 31));
+  assertEquals(true, f('The', 3));
+  assertEquals(false, f('The', 4));
+  assertEquals(true, f('fox', 19));
+  assertEquals(false, f('fox', 20));
+  assertEquals(true, f('ck', 9));
+  %OptimizeFunctionOnNextCall(f);
+  assertEquals(true, f('dog'));
+  assertEquals(false, f('dog', 40));
+  assertEquals(true, f('ver', 30));
+  assertEquals(false, f('ver', 31));
+  assertEquals(true, f('er ', 31));
+  assertEquals(true, f('The', 3));
+  assertEquals(false, f('The', 4));
+  assertEquals(true, f('fox', 19));
+  assertEquals(false, f('fox', 20));
+  assertEquals(true, f('ck', 9));
+  assertOptimized(f);
+})();
+
+// dynamic test cases with both changing end index and changing search string
+// where the search string is longer than kMaxInlineMatchSequence
+(function() {
+  function f(w, n) { return "The quick brown fox jumps over the lazy dog".endsWith(w, n) }
+  %PrepareFunctionForOptimization(f);
+  assertEquals(false, f('T', -1));
+  assertEquals(false, f('T', 0));
+  assertEquals(true, f('T', 1));
+  assertEquals(true, f('lazy dog'));
+  assertEquals(false, f('T', 2));
+  assertEquals(true, f('Th', 2));
+  assertEquals(true, f("brown", 15));
+  assertEquals(false, f("brown", 16));
+  assertEquals(false, f("quick", 4));
+  assertEquals(true, f("quick", 9));
+  assertEquals(true, f("fox jumps over", 30));
+  assertEquals(false, f("fox jumps over", 31));
+  assertEquals(true, f(' fox ju', 22));
+  assertEquals(false, f('over t', 28));
+  assertEquals(true, f('er th', 33));
+  assertEquals(true, f('wn fox jumps over the lazy do', 42));
+  %OptimizeFunctionOnNextCall(f);
+  assertEquals(false, f('T', -1));
+  assertEquals(false, f('T', 0));
+  assertEquals(true, f('T', 1));
+  assertEquals(true, f('lazy dog'));
+  assertEquals(false, f('T', 2));
+  assertEquals(true, f('Th', 2));
+  assertEquals(true, f("brown", 15));
+  assertEquals(false, f("brown", 16));
+  assertEquals(false, f("quick", 4));
+  assertEquals(true, f("quick", 9));
+  assertEquals(true, f("fox jumps over", 30));
+  assertEquals(false, f("fox jumps over", 31));
+  assertEquals(true, f(' fox ju', 22));
+  assertEquals(false, f('over t', 28));
+  assertEquals(true, f('er th', 33));
+  assertEquals(true, f('wn fox jumps over the lazy do', 42));
+  assertOptimized(f);
+})();
+
+// simple case to check if function is de-optimized when called with
+// non-smi
+(function() {
+  function f(n) { return "cba".endsWith("a", n); }
+  %PrepareFunctionForOptimization(f);
+  assertEquals(true, f());
+  assertEquals(true, f());
+  %OptimizeFunctionOnNextCall(f);
+  assertEquals(true, f(4294967296));
+  assertUnoptimized(f);
+})();
+
+// simple case for empty string
+(function() {
+  function f(str) {
+    return str.endsWith('');
+  }
+
+  %PrepareFunctionForOptimization(f);
+  f('foo');
+  f('');
+  %OptimizeFunctionOnNextCall(f);
+  assertEquals(f('foo'), true);
+  assertEquals(f(''), true);
+  assertOptimized(f);
+})();
diff --git a/deps/v8/test/mjsunit/compiler/typedarray-resizablearraybuffer.js b/deps/v8/test/mjsunit/compiler/typedarray-resizablearraybuffer.js
index b2a72363d9f90c..0a7fcd5060d7db 100644
--- a/deps/v8/test/mjsunit/compiler/typedarray-resizablearraybuffer.js
+++ b/deps/v8/test/mjsunit/compiler/typedarray-resizablearraybuffer.js
@@ -226,13 +226,9 @@ for (let shared of [false, true]) {
         blen = Resize(ab, 9);
         assertEquals(blen, ByteLength(ta));
         assertEquals(Math.floor(blen / target.BYTES_PER_ELEMENT), Length(ta));
-        assertOptimized(ByteLength);
-        assertOptimized(Length);
         blen = Resize(ab, 24);
         assertEquals(blen, ByteLength(ta));
         assertEquals(Math.floor(blen / target.BYTES_PER_ELEMENT), Length(ta));
-        assertOptimized(ByteLength);
-        assertOptimized(Length);
 
         if (!shared) {
           %ArrayBufferDetach(ab);
diff --git a/deps/v8/test/mjsunit/d8/d8-worker-sharedarraybuffer.js b/deps/v8/test/mjsunit/d8/d8-worker-sharedarraybuffer.js
index 049348856d3890..2a7727ca61139e 100644
--- a/deps/v8/test/mjsunit/d8/d8-worker-sharedarraybuffer.js
+++ b/deps/v8/test/mjsunit/d8/d8-worker-sharedarraybuffer.js
@@ -25,8 +25,6 @@
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-// Flags: --harmony-sharedarraybuffer
-
 if (this.Worker) {
   (function TestClone() {
     var workerScript =
diff --git a/deps/v8/test/mjsunit/error-stack.js b/deps/v8/test/mjsunit/error-stack.js
index 566bca4324f0cb..e3916660c72960 100644
--- a/deps/v8/test/mjsunit/error-stack.js
+++ b/deps/v8/test/mjsunit/error-stack.js
@@ -59,7 +59,7 @@
 
 (function TestPrepareStackTraceCallbackInstallsSetter() {
   Error.prepareStackTrace = (error, frames) => {
-    Object.defineProperty(error, "stack", { set: (x) => {
+    Object.defineProperty(error, "stack", { get: undefined, set: (x) => {
       error[42] = x;
     }});
     return "<formatted stack trace>";
diff --git a/deps/v8/test/mjsunit/es6/iterator-prototype.js b/deps/v8/test/mjsunit/es6/iterator-prototype.js
index 0b266e9897a717..496b67de122aa6 100644
--- a/deps/v8/test/mjsunit/es6/iterator-prototype.js
+++ b/deps/v8/test/mjsunit/es6/iterator-prototype.js
@@ -2,13 +2,15 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+// Flags: --harmony-iterator-helpers
+
 var arrayIteratorPrototype = [].entries().__proto__;
 var iteratorPrototype = arrayIteratorPrototype.__proto__;
 
 assertSame(Object.prototype, Object.getPrototypeOf(iteratorPrototype));
 assertTrue(Object.isExtensible(iteratorPrototype));
-assertSame(0, Object.getOwnPropertyNames(iteratorPrototype).length);
-assertSame(1, Object.getOwnPropertySymbols(iteratorPrototype).length);
+assertSame(12, Object.getOwnPropertyNames(iteratorPrototype).length);
+assertSame(2, Object.getOwnPropertySymbols(iteratorPrototype).length);
 assertSame(Symbol.iterator,
              Object.getOwnPropertySymbols(iteratorPrototype)[0]);
 
diff --git a/deps/v8/test/mjsunit/es6/proxies-json.js b/deps/v8/test/mjsunit/es6/proxies-json.js
index 6b40e3ee7d8d68..85952a4f811168 100644
--- a/deps/v8/test/mjsunit/es6/proxies-json.js
+++ b/deps/v8/test/mjsunit/es6/proxies-json.js
@@ -455,13 +455,13 @@ for (var i in log) assertSame(target, log[i][1]);
 
 assertEquals(4, log[0].length);
 assertEquals("apply", log[0][0]);
-assertEquals(["0", true], log[0][3]);
+assertEquals(["0", true, {source:"true"}], log[0][3]);
 assertEquals(4, log[1].length);
 assertEquals("apply", log[1][0]);
-assertEquals(["1", false], log[1][3]);
+assertEquals(["1", false, {source:"false"}], log[1][3]);
 assertEquals(4, log[2].length);
 assertEquals("apply", log[2][0]);
-assertEquals(["", [42, 42]], log[2][3]);
+assertEquals(["", [42, 42], {}], log[2][3]);
 
 
 // Reviver plants a non-arraylike proxy into a yet-to-be-visited property
diff --git a/deps/v8/test/mjsunit/es9/object-spread-ic-shapes.js b/deps/v8/test/mjsunit/es9/object-spread-ic-shapes.js
new file mode 100644
index 00000000000000..08841cc2573b04
--- /dev/null
+++ b/deps/v8/test/mjsunit/es9/object-spread-ic-shapes.js
@@ -0,0 +1,176 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+// Test that cloning the empty object yields the same shape in monomorphic
+// state.
+(function() {
+  function clone(o) {
+    return {...o};
+  }
+
+  const o = {};
+  assertTrue(%HaveSameMap(o, clone(o)));
+  %PrepareFunctionForOptimization(clone);
+  assertTrue(%HaveSameMap(o, clone(o)));
+  assertTrue(%HaveSameMap(o, clone(o)));
+  %OptimizeFunctionOnNextCall(clone);
+  assertTrue(%HaveSameMap(o, clone(o)));
+})();
+
+// Test that cloning an object with a single data field yields the same shape
+// in monomorphic state.
+(function() {
+  function clone(o) {
+    return {...o};
+  }
+
+  const o = {a: "a"};
+  assertTrue(%HaveSameMap(o, clone(o)));
+  %PrepareFunctionForOptimization(clone);
+  assertTrue(%HaveSameMap(o, clone(o)));
+  assertTrue(%HaveSameMap(o, clone(o)));
+  %OptimizeFunctionOnNextCall(clone);
+  assertTrue(%HaveSameMap(o, clone(o)));
+})();
+
+// Test that cloning fast mode objects yields the same shape in polymorphic state.
+(function() {
+  function clone(o) {
+    return {...o};
+  }
+
+  const o0 = {};
+  const o1 = {a: "a"};
+  const o2 = {a: "a", b: "b"};
+  assertTrue(%HaveSameMap(o0, clone(o0)));
+  assertTrue(%HaveSameMap(o1, clone(o1)));
+  assertTrue(%HaveSameMap(o2, clone(o2)));
+  %PrepareFunctionForOptimization(clone);
+  assertTrue(%HaveSameMap(o0, clone(o0)));
+  assertTrue(%HaveSameMap(o1, clone(o1)));
+  assertTrue(%HaveSameMap(o2, clone(o2)));
+  assertTrue(%HaveSameMap(o0, clone(o0)));
+  assertTrue(%HaveSameMap(o1, clone(o1)));
+  assertTrue(%HaveSameMap(o2, clone(o2)));
+  %OptimizeFunctionOnNextCall(clone);
+  assertTrue(%HaveSameMap(o0, clone(o0)));
+  assertTrue(%HaveSameMap(o1, clone(o1)));
+  assertTrue(%HaveSameMap(o2, clone(o2)));
+})();
+
+// Test that cloning the empty object with `null` prototype (in fast mode)
+// yields the same shape in monomorphic state.
+(function() {
+  function clone(o) {
+    return {...o, __proto__: null};
+  }
+
+  const o = {};
+  Object.setPrototypeOf(o, null);
+  assertTrue(%HasFastProperties(o));
+  assertNull(Object.getPrototypeOf(o));
+  assertTrue(%HaveSameMap(o, clone(o)));
+  %PrepareFunctionForOptimization(clone);
+  assertTrue(%HaveSameMap(o, clone(o)));
+  assertTrue(%HaveSameMap(o, clone(o)));
+  %OptimizeFunctionOnNextCall(clone);
+  assertTrue(%HaveSameMap(o, clone(o)));
+})();
+
+// Test that different CloneObjectICs produce the same shape for the same
+// object literal inputs with non-default property attributes.
+(function() {
+  function clone1(o) {
+    return {...o};
+  }
+  function clone2(o) {
+    return {...o};
+  }
+
+  const o1 = {x: "x", y: "y", z: "z"};
+  Object.defineProperty(o1, 'x', {configurable:false, writable:false});
+  Object.defineProperty(o1, 'y', {configurable:false});
+  Object.defineProperty(o1, 'z', {writable:false});
+  assertTrue(%HasFastProperties(o1));
+
+  const o2 = {a: 1, b: 2, c: 3, d: 4};
+  Object.defineProperty(o2, 'c', {writable:false});
+  Object.defineProperty(o2, 'd', {configurable:false});
+  assertTrue(%HasFastProperties(o2));
+
+  for (const o of [o1, o2]) {
+    for (const clone of [clone1, clone2]) {
+      const c = clone(o);
+      assertFalse(%HaveSameMap(o, c));
+      assertEquals(Object.keys(o), Object.keys(c));
+      for (const key of Object.keys(c)) {
+        const d = Object.getOwnPropertyDescriptor(c, key);
+        assertTrue(d.configurable);
+        assertTrue(d.enumerable);
+        assertTrue(d.writable);
+        assertEquals(d.value, o[key]);
+      }
+    }
+  }
+  assertTrue(%HaveSameMap(clone1(o1), {x: "x", y: "y", z: "z"}));
+  assertTrue(%HaveSameMap(clone2(o2), {a: 1, b: 2, c: 3, d: 4}));
+  %PrepareFunctionForOptimization(clone1);
+  %PrepareFunctionForOptimization(clone2);
+  assertTrue(%HaveSameMap(clone1(o1), clone2(o1)));
+  assertTrue(%HaveSameMap(clone1(o1), clone2(o1)));
+  assertTrue(%HaveSameMap(clone1(o2), clone2(o2)));
+  assertTrue(%HaveSameMap(clone1(o2), clone2(o2)));
+  assertTrue(%HaveSameMap(clone1(o1), {x: "x", y: "y", z: "z"}));
+  assertTrue(%HaveSameMap(clone2(o2), {a: 1, b: 2, c: 3, d: 4}));
+  %OptimizeFunctionOnNextCall(clone1);
+  %OptimizeFunctionOnNextCall(clone2);
+  assertTrue(%HaveSameMap(clone1(o1), clone2(o1)));
+  assertTrue(%HaveSameMap(clone1(o2), clone2(o2)));
+  assertTrue(%HaveSameMap(clone1(o1), {x: "x", y: "y", z: "z"}));
+  assertTrue(%HaveSameMap(clone2(o2), {a: 1, b: 2, c: 3, d: 4}));
+})();
+
+// Test that different CloneObjectICs produce the same shape for trivial
+// constructor instances in monomorphic state.
+(function() {
+  function clone1(o) {
+    return {...o};
+  }
+  function clone2(o) {
+    return {...o};
+  }
+
+  class A {
+    constructor() {
+      this.a = 1;
+      this.b = 2;
+      this.c = 3;
+      this.d = 4;
+    }
+  };
+  for (let i = 0; i < 10; ++i) new A();  // Finish slack tracking
+
+  assertTrue(%HaveSameMap(clone1(new A()), clone1(new A())));
+  assertTrue(%HaveSameMap(clone1(new A()), clone2(new A())));
+  assertTrue(%HaveSameMap(clone2(new A()), clone1(new A())));
+  assertTrue(%HaveSameMap(clone2(new A()), clone2(new A())));
+  %PrepareFunctionForOptimization(clone1);
+  %PrepareFunctionForOptimization(clone2);
+  assertTrue(%HaveSameMap(clone1(new A()), clone1(new A())));
+  assertTrue(%HaveSameMap(clone1(new A()), clone2(new A())));
+  assertTrue(%HaveSameMap(clone2(new A()), clone1(new A())));
+  assertTrue(%HaveSameMap(clone2(new A()), clone2(new A())));
+  assertTrue(%HaveSameMap(clone1(new A()), clone1(new A())));
+  assertTrue(%HaveSameMap(clone1(new A()), clone2(new A())));
+  assertTrue(%HaveSameMap(clone2(new A()), clone1(new A())));
+  assertTrue(%HaveSameMap(clone2(new A()), clone2(new A())));
+  %OptimizeFunctionOnNextCall(clone1);
+  %OptimizeFunctionOnNextCall(clone2);
+  assertTrue(%HaveSameMap(clone1(new A()), clone1(new A())));
+  assertTrue(%HaveSameMap(clone1(new A()), clone2(new A())));
+  assertTrue(%HaveSameMap(clone2(new A()), clone1(new A())));
+  assertTrue(%HaveSameMap(clone2(new A()), clone2(new A())));
+})();
diff --git a/deps/v8/test/mjsunit/es9/object-spread-null-proto.js b/deps/v8/test/mjsunit/es9/object-spread-null-proto.js
new file mode 100644
index 00000000000000..408dca77df7648
--- /dev/null
+++ b/deps/v8/test/mjsunit/es9/object-spread-null-proto.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+// Test that cloning the empty object into an object literal with
+// `null` prototype works correctly.
+(function() {
+  function clone(o) {
+    return {...o, __proto__: null};
+  }
+
+  assertNull(Object.getPrototypeOf(clone({})));
+  assertNull(Object.getPrototypeOf(clone({})));
+  assertNull(Object.getPrototypeOf(clone({})));
+  assertNull(Object.getPrototypeOf(clone({})));
+  %PrepareFunctionForOptimization(clone);
+  assertNull(Object.getPrototypeOf(clone({})));
+  assertNull(Object.getPrototypeOf(clone({})));
+  %OptimizeFunctionOnNextCall(clone);
+  assertNull(Object.getPrototypeOf(clone({})));
+})();
diff --git a/deps/v8/test/mjsunit/frozen-array-reduce.js b/deps/v8/test/mjsunit/frozen-array-reduce.js
index 3c18672a525116..0506e4e913f61b 100644
--- a/deps/v8/test/mjsunit/frozen-array-reduce.js
+++ b/deps/v8/test/mjsunit/frozen-array-reduce.js
@@ -717,10 +717,11 @@ assertEquals(undefined, Object.freeze(arr).reduceRight(function(val) { return va
   g(); g();
   let total = g();
   %OptimizeFunctionOnNextCall(g);
+  var turbofan = willBeTurbofanned(g);
   g();
   g();
   assertEquals(total, g());
-  assertOptimized(g);
+  if (turbofan) assertOptimized(g);
 })();
 
 (function ReduceThrow() {
@@ -1084,10 +1085,11 @@ assertEquals(undefined, Object.freeze(arr).reduceRight(function(val) { return va
   g(); g();
   let total = g();
   %OptimizeFunctionOnNextCall(g);
+  var turbofan = willBeTurbofanned(g);
   g();
   g();
   assertEquals(total, g());
-  assertOptimized(g);
+  if (turbofan) assertOptimized(g);
 })();
 
 (function ReduceThrow() {
diff --git a/deps/v8/test/mjsunit/harmony/atomics-on-arraybuffer-detach.js b/deps/v8/test/mjsunit/harmony/atomics-on-arraybuffer-detach.js
index 625225e3104ee1..143bc1e357c675 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-on-arraybuffer-detach.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-on-arraybuffer-detach.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer --allow-natives-syntax
+// Flags: --allow-natives-syntax
 
 // Test for the buffer becoming detached in surprising places. Test262 covers
 // the case where the buffer starts off detached.
diff --git a/deps/v8/test/mjsunit/harmony/atomics-value-check.js b/deps/v8/test/mjsunit/harmony/atomics-value-check.js
index 31ffbabded3f4a..26e30a5e354af0 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-value-check.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-value-check.js
@@ -2,9 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-//
-
 var sab = new SharedArrayBuffer(4);
 var sta = new Int8Array(sab);
 sta[0] = 5;
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-2timeout.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-2timeout.js
index 7ff05d184f49ce..adfc0c411071a3 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-2timeout.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-2timeout.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer --harmony-atomics-waitasync
-
 d8.file.execute("test/mjsunit/harmony/atomics-waitasync-helpers.js");
 
 function workerCode() {
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-buffer-out-of-scope-timeout.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-buffer-out-of-scope-timeout.js
index 16a2351ad9bc94..76cf94ec31fbde 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-buffer-out-of-scope-timeout.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-buffer-out-of-scope-timeout.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer --harmony-atomics-waitasync --expose-gc
+// Flags: --expose-gc
 
 d8.file.execute("test/mjsunit/harmony/atomics-waitasync-helpers.js");
 
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-promise-out-of-scope.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-promise-out-of-scope.js
index 09decbfcbb6409..3f67a7b47cfd7d 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-promise-out-of-scope.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-promise-out-of-scope.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync --expose-gc
+// Flags: --allow-natives-syntax --expose-gc
 
 (function test() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-timeout.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-timeout.js
index 3525b480499dff..944815e9f40ce1 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-timeout.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-timeout.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer --harmony-atomics-waitasync
-
 d8.file.execute("test/mjsunit/harmony/atomics-waitasync-helpers.js");
 
 function workerCode() {
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-timeouts-and-no-timeouts.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-timeouts-and-no-timeouts.js
index 4a4c1e087569f9..b6c038c4f40b58 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-timeouts-and-no-timeouts.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-timeouts-and-no-timeouts.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer --harmony-atomics-waitasync
-
 const N = 10;
 
 function workerCode(N) {
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-all.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-all.js
index d0bc6452255189..7f362518587574 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-all.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-all.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync
+// Flags: --allow-natives-syntax
 
 (function test() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-fifo.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-fifo.js
index e29c4c3eb23e20..28c1d803946d9e 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-fifo.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-fifo.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync
+// Flags: --allow-natives-syntax
 
 (function test() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-simple.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-simple.js
index b443f865174a14..27badc9d1ae289 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-simple.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-1thread-wake-up-simple.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync
+// Flags: --allow-natives-syntax
 
 (function test() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-2-waits.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-2-waits.js
index 9bbe8634781250..41cac4f11a7773 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-2-waits.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-2-waits.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync
+// Flags: --allow-natives-syntax
 
 (function test() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-2-workers.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-2-workers.js
index 71cc335dab0e1e..130b08dc82ef7e 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-2-workers.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-2-workers.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync
+// Flags: --allow-natives-syntax
 
 (function test() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-no-timeout.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-no-timeout.js
index 02d1e8413e3eab..fc5a883c2f5a5c 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-no-timeout.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-no-timeout.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync --expose-gc
+// Flags: --allow-natives-syntax --expose-gc
 
 (function test() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-timeout.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-timeout.js
index 74fcbad6275847..591214bd724245 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-timeout.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync-worker-shutdown-before-wait-finished-timeout.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync --expose-gc
+// Flags: --allow-natives-syntax --expose-gc
 
 (function test() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics-waitasync.js b/deps/v8/test/mjsunit/harmony/atomics-waitasync.js
index d5165b99c234a9..f9127c323adb3e 100644
--- a/deps/v8/test/mjsunit/harmony/atomics-waitasync.js
+++ b/deps/v8/test/mjsunit/harmony/atomics-waitasync.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer --harmony-atomics-waitasync
+// Flags: --allow-natives-syntax
 
 (function testOutOfBounds() {
   const sab = new SharedArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/atomics.js b/deps/v8/test/mjsunit/harmony/atomics.js
index 56c5b1e8e1392e..0beee5deb778a9 100644
--- a/deps/v8/test/mjsunit/harmony/atomics.js
+++ b/deps/v8/test/mjsunit/harmony/atomics.js
@@ -2,9 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-//
-
 function toRangeWrapper(is_big) {
   return function _toRangeWrapped(raw_value) {
     var raw_range = this.max - this.min + (is_big ? 1n : 1);
diff --git a/deps/v8/test/mjsunit/harmony/futex.js b/deps/v8/test/mjsunit/harmony/futex.js
index 69c5d0999aeb02..1835c3f79c22b4 100644
--- a/deps/v8/test/mjsunit/harmony/futex.js
+++ b/deps/v8/test/mjsunit/harmony/futex.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer
+// Flags: --allow-natives-syntax
 
 (function TestNonSharedArrayBehavior() {
   var ab = new ArrayBuffer(16);
diff --git a/deps/v8/test/mjsunit/harmony/iterator-from.js b/deps/v8/test/mjsunit/harmony/iterator-from.js
index 90a3d95b02806d..a486819dd8c2a4 100644
--- a/deps/v8/test/mjsunit/harmony/iterator-from.js
+++ b/deps/v8/test/mjsunit/harmony/iterator-from.js
@@ -72,7 +72,10 @@ assertThrows(() => {
 }, TypeError);
 
 assertThrows(() => {
-  Iterator.from({[Symbol.iterator]() {
-    return { next: "not callable" };
-  }});
+  Iterator.from({
+    [Symbol.iterator]: 0,
+    next() {
+      return 42;
+    },
+  });
 }, TypeError);
diff --git a/deps/v8/test/mjsunit/harmony/iterator-helpers.js b/deps/v8/test/mjsunit/harmony/iterator-helpers.js
index 9de592e1340c8e..f9a03591f19a84 100644
--- a/deps/v8/test/mjsunit/harmony/iterator-helpers.js
+++ b/deps/v8/test/mjsunit/harmony/iterator-helpers.js
@@ -29,7 +29,7 @@ function TestHelperPrototypeSurface(helper) {
   assertEquals('return', proto.return.name);
 }
 
-// --- Test Map helper
+// --- Test map helper
 
 (function TestMap() {
   const iter = gen();
@@ -48,7 +48,161 @@ function TestHelperPrototypeSurface(helper) {
   assertEquals({value: undefined, done: true }, mapIter.next());
 })();
 
-// --- Test Filter helper
+(function TestIteratorConstructorinMap() {
+  const iter = gen();
+  const mapIter = iter.map((x, i) => {
+    counters.push(i);
+    return x * 2;
+  });
+  TestHelperPrototypeSurface(mapIter);
+
+  assertThrows(() => {
+    for (let i = 0; i < 3; i++) {
+      function func() {}
+      Object.defineProperty(mapIter, 58, {set: func});
+    }
+  });
+})();
+
+(function TestMapNoReturnInIterator() {
+  const IteratorNoReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+  };
+
+  Object.setPrototypeOf(IteratorNoReturn, Iterator.prototype);
+  const mapIter = IteratorNoReturn.map((x, i) => {
+    return x;
+  });
+  TestHelperPrototypeSurface(mapIter);
+  assertEquals({value: 1, done: false}, mapIter.next());
+  assertEquals({value: undefined, done: true}, mapIter.return());
+})();
+
+(function TestMapThrowInReturnInIterator() {
+  const IteratorThrowReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const mapIter = IteratorThrowReturn.map((x, i) => {
+    return x;
+  });
+  assertThrows(() => {
+    mapIter.return();
+  });
+})();
+
+(function TestMapThrowInReturnButExhaustedIterator() {
+  const IteratorThrowReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const mapIter = IteratorThrowReturn.map((x, i) => {
+    return x;
+  });
+  assertEquals({value: 1, done: false}, mapIter.next());
+  assertEquals({value: 2, done: false}, mapIter.next());
+  assertEquals({value: 3, done: false}, mapIter.next());
+  assertEquals({value: undefined, done: true}, mapIter.next());
+  assertEquals({value: undefined, done: true}, mapIter.return());
+})();
+
+(function TestMapReturnNotReturnAfterExhaustion() {
+  let returnCount = 0;
+
+  class TestIterator extends Iterator {
+    next() {
+      return {done: false, value: 1};
+    }
+    return() {
+      ++returnCount;
+      return {};
+    }
+  }
+
+  let iterator = new TestIterator().map((x, i) => {
+    return x;
+  });
+  assertEquals(0, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+})();
+
+(function TestMapMarkIteratorExhaustedAfterThrow() {
+  const IteratorThrow = {
+    i: 1,
+    next() {
+      if (this.i == 3) {
+        throw new Error('Throw return');
+      } else {
+        return {value: this.i++, done: false};
+      }
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrow, Iterator.prototype);
+  const mapIter = IteratorThrow.map((x, i) => {
+    return x;
+  });
+  assertEquals({value: 1, done: false}, mapIter.next());
+  assertEquals({value: 2, done: false}, mapIter.next());
+  assertThrows(() => {
+    mapIter.next();
+  });
+  assertEquals({value: undefined, done: true}, mapIter.next());
+})();
+
+(function TestMapNotCallableNext() {
+  const iterator = {
+    i: 1,
+    next() {
+      undefined;
+    },
+    return () {
+      return {};
+    },
+  };
+
+  Object.setPrototypeOf(iterator, Iterator.prototype);
+  const mapIter = iterator.map((x, i) => {
+    return x;
+  });
+  assertThrows(() => {
+    mapIter.next();
+  });
+})();
+
+// --- Test filter helper
 
 (function TestFilter() {
   const iter = gen();
@@ -93,7 +247,141 @@ function TestHelperPrototypeSurface(helper) {
   assertEquals({value: undefined, done: true }, filterIter.next());
 })();
 
-// --- Test Take helper
+(function TestIteratorConstructorinFilter() {
+  const iter = gen();
+  const filterIter = iter.filter((x, i) => {
+    return x == 0;
+  });
+  TestHelperPrototypeSurface(filterIter);
+
+  assertThrows(() => {
+    for (let i = 0; i < 3; i++) {
+      function func() {}
+      Object.defineProperty(filterIter, 58, {set: func});
+    }
+  });
+})();
+
+(function TestFilterThrowInReturnInIterator() {
+  const IteratorThrowReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 1) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const filterIter = IteratorThrowReturn.filter((x, i) => {
+    return x == 1;
+  });
+  assertThrows(() => {
+    filterIter.return();
+  });
+})();
+
+(function TestMapThrowInReturnEmptyIterator() {
+  const IteratorThrowReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 1) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const filterIter = IteratorThrowReturn.filter((x, i) => {
+    return x == 0;
+  });
+  assertEquals({value: undefined, done: true}, filterIter.next());
+  assertEquals({value: undefined, done: true}, filterIter.return());
+})();
+
+(function TestMapThrowInReturnButExhaustedIterator() {
+  const IteratorThrowReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 1) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const filterIter = IteratorThrowReturn.filter((x, i) => {
+    return x == 1;
+  });
+  assertEquals({value: 1, done: false}, filterIter.next());
+  assertThrows(() => {
+    filterIter.return();
+  });
+})();
+
+(function TestFilterReturnNotReturnAfterExhaustion() {
+  let returnCount = 0;
+
+  class TestIterator extends Iterator {
+    next() {
+      return {done: false, value: 1};
+    }
+    return() {
+      ++returnCount;
+      return {};
+    }
+  }
+
+  let iterator = new TestIterator().filter((x, i) => {
+    return x == x;
+  });
+  assertEquals(0, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+})();
+
+(function TestFilterMarkIteratorExhaustedAfterThrow() {
+  const IteratorThrow = {
+    i: 1,
+    next() {
+      if (this.i == 3) {
+        throw new Error('Throw return');
+      } else {
+        return {value: this.i++, done: false};
+      }
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrow, Iterator.prototype);
+  const filterIter = IteratorThrow.filter((x, i) => {
+    return x == x;
+  });
+  assertEquals({value: 1, done: false}, filterIter.next());
+  assertEquals({value: 2, done: false}, filterIter.next());
+  assertThrows(() => {
+    filterIter.next();
+  });
+  assertEquals({value: undefined, done: true}, filterIter.next());
+})();
+
+// --- Test take helper
 
 (function TestTake() {
   const iter = gen();
@@ -158,7 +446,7 @@ function TestHelperPrototypeSurface(helper) {
     return() {return {value: undefined, done: true};},
   };
 
-  Object.setPrototypeOf(NormalIterator, Object.getPrototypeOf(Object.getPrototypeOf([][Symbol.iterator]())));
+  Object.setPrototypeOf(NormalIterator, Iterator.prototype);
   const takeIter = NormalIterator.take(1);
   TestHelperPrototypeSurface(takeIter);
   assertEquals({value: 1, done: false }, takeIter.next());
@@ -177,13 +465,14 @@ function TestHelperPrototypeSurface(helper) {
     },
   };
 
-  Object.setPrototypeOf(
-      IteratorNoReturn,
-      Object.getPrototypeOf(Object.getPrototypeOf([][Symbol.iterator]())));
-  assertThrows(() => {iter.take(1);});
+  Object.setPrototypeOf(IteratorNoReturn, Iterator.prototype);
+  const takeIter = IteratorNoReturn.take(1);
+  TestHelperPrototypeSurface(takeIter);
+  assertEquals({value: 1, done: false}, takeIter.next());
+  assertEquals({value: undefined, done: true}, takeIter.next());
 })();
 
-(function TestTakeNonObjectReturnInIterator() {
+(function TestTakeThrowInReturnInIterator() {
   const IteratorThrowReturn = {
     i: 1,
     next() {
@@ -194,65 +483,54 @@ function TestHelperPrototypeSurface(helper) {
       }
     },
     return () {
-      throw new Error('Non-object return');
+      throw new Error('Throw return');
     },
   };
 
-  Object.setPrototypeOf(
-      IteratorThrowReturn,
-      Object.getPrototypeOf(Object.getPrototypeOf([][Symbol.iterator]())));
-  assertThrows(() => {iter.take(1);});
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const takeIter = IteratorThrowReturn.take(0);
+  assertThrows(() => {
+    takeIter.next();
+  });
 })();
 
-// --- Test Drop helper
-
-(function TestDrop() {
-  const iter = longerGen();
-  assertEquals('function', typeof iter.drop);
-  assertEquals(1, iter.drop.length);
-  assertEquals('drop', iter.drop.name);
-  const dropIter = iter.drop(1);
-  TestHelperPrototypeSurface(dropIter);
-  assertEquals({value: 43, done: false}, dropIter.next());
-  assertEquals({value: 44, done: false}, dropIter.next());
-  assertEquals({value: 45, done: false}, dropIter.next());
-  assertEquals({value: undefined, done: true}, dropIter.next());
-})();
+(function TestTakeNonObjectReturnInIterator() {
+  const IteratorNonObjectReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      return 42;
+    },
+  };
 
-(function TestDropAllElements() {
-  const iter = longerGen();
-  const dropIter = iter.drop(4);
-  TestHelperPrototypeSurface(dropIter);
-  assertEquals({value: undefined, done: true}, dropIter.next());
+  Object.setPrototypeOf(IteratorNonObjectReturn, Iterator.prototype);
+  const takeIter = IteratorNonObjectReturn.take(0);
+  assertThrows(() => {
+    takeIter.next();
+  });
 })();
 
-(function TestDropNoElements() {
-  const iter = longerGen();
-  const dropIter = iter.drop(0);
-  TestHelperPrototypeSurface(dropIter);
-  assertEquals({value: 42, done: false}, dropIter.next());
-  assertEquals({value: 43, done: false}, dropIter.next());
-  assertEquals({value: 44, done: false}, dropIter.next());
-  assertEquals({value: 45, done: false}, dropIter.next());
-  assertEquals({value: undefined, done: true}, dropIter.next());
-})();
+(function TestIteratorConstructorinTake() {
+  const iter = gen();
+  const takeIter = iter.take(4);
+  TestHelperPrototypeSurface(takeIter);
 
-(function TestDropNegativeLimit() {
-  const iter = longerGen();
   assertThrows(() => {
-    iter.drop(-3);
+    for (let i = 0; i < 3; i++) {
+      function func() {}
+      Object.defineProperty(takeIter, 58, {set: func});
+    }
   });
 })();
 
-(function TestDropInfinityLimit() {
-  const iter = longerGen();
-  const dropIter = iter.drop(Number.POSITIVE_INFINITY);
-  TestHelperPrototypeSurface(dropIter);
-  assertEquals({value: undefined, done: true}, dropIter.next());
-})();
-
-(function TestDropReturnInNormalIterator() {
-  const NormalIterator = {
+(function TestTakeThrowInReturnInIterator() {
+  const IteratorThrowReturn = {
     i: 1,
     next() {
       if (this.i <= 3) {
@@ -262,59 +540,889 @@ function TestHelperPrototypeSurface(helper) {
       }
     },
     return () {
-      return {value: undefined, done: true};
+      throw new Error('Throw return');
     },
   };
 
-  Object.setPrototypeOf(
-      NormalIterator,
-      Object.getPrototypeOf(Object.getPrototypeOf([][Symbol.iterator]())));
-  const dropIter = NormalIterator.drop(1);
-  TestHelperPrototypeSurface(dropIter);
-  assertEquals({value: 2, done: false}, dropIter.next());
-  assertEquals({value: 3, done: false}, dropIter.next());
-  assertEquals({value: undefined, done: true}, dropIter.next());
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const takeIter = IteratorThrowReturn.take(5);
+  assertEquals({value: 1, done: false}, takeIter.next());
+  assertEquals({value: 2, done: false}, takeIter.next());
+  assertEquals({value: 3, done: false}, takeIter.next());
+  assertEquals({value: undefined, done: true}, takeIter.next());
+  assertEquals({value: undefined, done: true}, takeIter.return());
 })();
 
-(function TestDropNoReturnInIterator() {
-  const IteratorNoReturn = {
+(function TestTakeThrowInReturnButNotExhaustedIterator() {
+  const IteratorThrowReturn = {
     i: 1,
     next() {
-      if (this.i <= 3) {
+      if (this.i <= 1) {
         return {value: this.i++, done: false};
       } else {
         return {value: undefined, done: true};
       }
     },
+    return () {
+      throw new Error('Throw return');
+    },
   };
 
-  Object.setPrototypeOf(
-      IteratorNoReturn,
-      Object.getPrototypeOf(Object.getPrototypeOf([][Symbol.iterator]())));
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const takeIter = IteratorThrowReturn.take(1);
+  assertEquals({value: 1, done: false}, takeIter.next());
   assertThrows(() => {
-    iter.drop(4);
+    takeIter.return();
   });
 })();
 
-(function TestDropNonObjectReturnInIterator() {
+(function TestTakeThrowInReturnButExhaustedIterator() {
   const IteratorThrowReturn = {
     i: 1,
     next() {
-      if (this.i <= 3) {
+      if (this.i <= 1) {
         return {value: this.i++, done: false};
       } else {
         return {value: undefined, done: true};
       }
     },
     return () {
-      throw new Error('Non-object return');
+      throw new Error('Throw return');
     },
   };
 
-  Object.setPrototypeOf(
-      IteratorThrowReturn,
-      Object.getPrototypeOf(Object.getPrototypeOf([][Symbol.iterator]())));
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const takeIter = IteratorThrowReturn.take(1);
+  assertEquals({value: 1, done: false}, takeIter.next());
   assertThrows(() => {
-    iter.drop(4);
+    takeIter.return();
   });
 })();
+
+(function TestTakeReturnNotReturnAfterExhaustion() {
+  let returnCount = 0;
+
+  class TestIterator extends Iterator {
+    next() {
+      return {done: false, value: 1};
+    }
+    return() {
+      ++returnCount;
+      return {};
+    }
+  }
+
+  let iterator = new TestIterator().take(1);
+  assertEquals(0, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+})();
+
+(function TestTakeMarkIteratorExhaustedAfterThrow() {
+  const IteratorThrow = {
+    i: 1,
+    next() {
+      if (this.i == 3) {
+        throw new Error('Throw return');
+      } else {
+        return {value: this.i++, done: false};
+      }
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrow, Iterator.prototype);
+  const takeIter = IteratorThrow.take(4);
+  assertEquals({value: 1, done: false}, takeIter.next());
+  assertEquals({value: 2, done: false}, takeIter.next());
+  assertThrows(() => {
+    takeIter.next();
+  });
+  assertEquals({value: undefined, done: true}, takeIter.next());
+})();
+
+// --- Test drop helper
+
+(function TestDrop() {
+  const iter = longerGen();
+  assertEquals('function', typeof iter.drop);
+  assertEquals(1, iter.drop.length);
+  assertEquals('drop', iter.drop.name);
+  const dropIter = iter.drop(1);
+  TestHelperPrototypeSurface(dropIter);
+  assertEquals({value: 43, done: false}, dropIter.next());
+  assertEquals({value: 44, done: false}, dropIter.next());
+  assertEquals({value: 45, done: false}, dropIter.next());
+  assertEquals({value: undefined, done: true}, dropIter.next());
+})();
+
+(function TestDropAllElements() {
+  const iter = longerGen();
+  const dropIter = iter.drop(4);
+  TestHelperPrototypeSurface(dropIter);
+  assertEquals({value: undefined, done: true}, dropIter.next());
+})();
+
+(function TestDropNoElements() {
+  const iter = longerGen();
+  const dropIter = iter.drop(0);
+  TestHelperPrototypeSurface(dropIter);
+  assertEquals({value: 42, done: false}, dropIter.next());
+  assertEquals({value: 43, done: false}, dropIter.next());
+  assertEquals({value: 44, done: false}, dropIter.next());
+  assertEquals({value: 45, done: false}, dropIter.next());
+  assertEquals({value: undefined, done: true}, dropIter.next());
+})();
+
+(function TestDropNegativeLimit() {
+  const iter = longerGen();
+  assertThrows(() => {
+    iter.drop(-3);
+  });
+})();
+
+(function TestDropInfinityLimit() {
+  const iter = longerGen();
+  const dropIter = iter.drop(Number.POSITIVE_INFINITY);
+  TestHelperPrototypeSurface(dropIter);
+  assertEquals({value: undefined, done: true}, dropIter.next());
+})();
+
+(function TestIteratorConstructorinDrop() {
+  const iter = gen();
+  const dropIter = iter.drop(1);
+  TestHelperPrototypeSurface(dropIter);
+
+  assertThrows(() => {
+    for (let i = 0; i < 3; i++) {
+      function func() {}
+      Object.defineProperty(dropIter, 58, {set: func});
+    }
+  });
+})();
+
+(function TestDropReturnThrows() {
+  class TestIterator extends Iterator {
+    next() {
+      return {done: false, value: 1};
+    }
+    get return() {
+      throw new Test262Error;
+    }
+  }
+
+  let iterator = new TestIterator().drop(1);
+  iterator.next();
+  assertThrows(() => {iterator.return()});
+})();
+
+(function TestDropReturnNotReturnAfterExhaustion() {
+  let returnCount = 0;
+
+  class TestIterator extends Iterator {
+    next() {
+      return {done: false, value: 1};
+    }
+    return() {
+      ++returnCount;
+      return {};
+    }
+  }
+
+  let iterator = new TestIterator().drop(0);
+  assertEquals(0, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+
+  returnCount = 0;
+
+  iterator = new TestIterator().drop(1);
+  assertEquals(0, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+
+  returnCount = 0;
+
+  iterator = new TestIterator().drop(1).drop(1).drop(1).drop(1).drop(1);
+  assertEquals(0, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+})();
+
+(function TestDropOnExhausetdIterator() {
+  class TestIterator extends Iterator {
+    next() {
+      return {done: true, value: undefined};
+    }
+    return() {
+      throw new Error('Throw return');
+    }
+  }
+
+  let iterator = new TestIterator().drop(0);
+  assertThrows(() => {iterator.return()});
+  iterator.next();
+  iterator.return();
+
+  iterator = new TestIterator().drop(1);
+  iterator.next();
+  iterator.return();
+
+  iterator = new TestIterator().drop(1);
+  assertThrows(() => {iterator.return()});
+  iterator.next();
+  iterator.return();
+
+  iterator = new TestIterator().drop(1).drop(1).drop(1).drop(1).drop(1);
+  assertThrows(() => {iterator.return()});
+  iterator.next();
+  iterator.return();
+})();
+
+(function TestDropMarkIteratorExhaustedAfterThrow() {
+  const IteratorThrow = {
+    i: 1,
+    next() {
+      if (this.i == 3) {
+        throw new Error('Throw return');
+      } else {
+        return {value: this.i++, done: false};
+      }
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrow, Iterator.prototype);
+  const dropIter = IteratorThrow.drop(1);
+  assertEquals({value: 2, done: false}, dropIter.next());
+  assertThrows(() => {
+    dropIter.next();
+  });
+  assertEquals({value: undefined, done: true}, dropIter.next());
+})();
+
+// --- Test flatMap helper
+
+(function TestFlatMap() {
+  const iter = ['It\'s Sunny in', '', 'California'].values();
+  assertEquals('function', typeof iter.flatMap);
+  assertEquals(1, iter.flatMap.length);
+  assertEquals('flatMap', iter.flatMap.name);
+  const flatMapIter = iter.flatMap(value => value.split(' ').values());
+  TestHelperPrototypeSurface(flatMapIter);
+  assertEquals({value: 'It\'s', done: false}, flatMapIter.next());
+  assertEquals({value: 'Sunny', done: false}, flatMapIter.next());
+  assertEquals({value: 'in', done: false}, flatMapIter.next());
+  assertEquals({value: '', done: false}, flatMapIter.next());
+  assertEquals({value: 'California', done: false}, flatMapIter.next());
+  assertEquals({value: undefined, done: true}, flatMapIter.next());
+})();
+
+(function TestFlatMapShortInnerIterators() {
+  const iter = ['It\'s', 'Sunny', 'in', '', 'California'].values();
+  const flatMapIter = iter.flatMap(value => value.split(' ').values());
+  TestHelperPrototypeSurface(flatMapIter);
+  assertEquals({value: 'It\'s', done: false}, flatMapIter.next());
+  assertEquals({value: 'Sunny', done: false}, flatMapIter.next());
+  assertEquals({value: 'in', done: false}, flatMapIter.next());
+  assertEquals({value: '', done: false}, flatMapIter.next());
+  assertEquals({value: 'California', done: false}, flatMapIter.next());
+  assertEquals({value: undefined, done: true}, flatMapIter.next());
+})();
+
+(function TestFlatMapLongInnerIterators() {
+  const iter = ['It\'s Sunny', 'in California'].values();
+  const flatMapIter = iter.flatMap(value => value.split(' ').values());
+  TestHelperPrototypeSurface(flatMapIter);
+  assertEquals({value: 'It\'s', done: false}, flatMapIter.next());
+  assertEquals({value: 'Sunny', done: false}, flatMapIter.next());
+  assertEquals({value: 'in', done: false}, flatMapIter.next());
+  assertEquals({value: 'California', done: false}, flatMapIter.next());
+  assertEquals({value: undefined, done: true}, flatMapIter.next());
+})();
+
+(function TestFlatMapThrowReturnInnerIterator() {
+  const outerIterator = {
+    i: 1,
+    next() {
+      if (this.i == 1) {
+        const innerIterator = {
+          j: 1,
+          next() {
+            if (this.j <= 2) {
+              return {value: this.j++, done: false};
+            } else {
+              return {value: undefined, done: true};
+            }
+          },
+          return () {
+            throw new Error('Throw return');
+          },
+        };
+        Object.setPrototypeOf(
+            innerIterator,
+            Object.getPrototypeOf(
+                Object.getPrototypeOf([][Symbol.iterator]())));
+        this.i++;
+        return {value: innerIterator, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      return {value: undefined, done: true};
+    },
+  };
+  Object.setPrototypeOf(outerIterator, Iterator.prototype);
+  const flatMapIter = outerIterator.flatMap(value => value);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertEquals({value: 2, done: false}, flatMapIter.next());
+  assertThrows(() => {flatMapIter.return()});
+})();
+
+(function TestFlatMapThrowReturnOuterIterator() {
+  const outerIterator = {
+    i: 1,
+    next() {
+      if (this.i == 1) {
+        const innerIterator = {
+          j: 1,
+          next() {
+            if (this.j <= 2) {
+              return {value: this.j++, done: false};
+            } else {
+              return {value: undefined, done: true};
+            }
+          },
+          return () {
+            return {value: undefined, done: true};
+          },
+        };
+        Object.setPrototypeOf(
+            innerIterator,
+            Object.getPrototypeOf(
+                Object.getPrototypeOf([][Symbol.iterator]())));
+        this.i++;
+        return {value: innerIterator, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+  Object.setPrototypeOf(outerIterator, Iterator.prototype);
+  const flatMapIter = outerIterator.flatMap(value => value);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertEquals({value: 2, done: false}, flatMapIter.next());
+  assertThrows(() => {flatMapIter.return()});
+})();
+
+(function TestFlatMapNonObjectReturnInnerIterator() {
+  const outerIterator = {
+    i: 1,
+    next() {
+      if (this.i == 1) {
+        const innerIterator = {
+          j: 1,
+          next() {
+            if (this.j <= 2) {
+              return {value: this.j++, done: false};
+            } else {
+              return {value: undefined, done: true};
+            }
+          },
+          return () {
+            return 42;
+          },
+        };
+        Object.setPrototypeOf(
+            innerIterator,
+            Object.getPrototypeOf(
+                Object.getPrototypeOf([][Symbol.iterator]())));
+        this.i++;
+        return {value: innerIterator, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      return {value: undefined, done: true};
+    },
+  };
+  Object.setPrototypeOf(outerIterator, Iterator.prototype);
+  const flatMapIter = outerIterator.flatMap(value => value);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertEquals({value: 2, done: false}, flatMapIter.next());
+  assertThrows(() => {flatMapIter.return()});
+})();
+
+(function TestFlatMapNonObjectReturnOuterIterator() {
+  const outerIterator = {
+    i: 1,
+    next() {
+      if (this.i == 1) {
+        const innerIterator = {
+          j: 1,
+          next() {
+            if (this.j <= 2) {
+              return {value: this.j++, done: false};
+            } else {
+              return {value: undefined, done: true};
+            }
+          },
+          return () {
+            return {value: undefined, done: true};
+          },
+        };
+        Object.setPrototypeOf(
+            innerIterator,
+            Object.getPrototypeOf(
+                Object.getPrototypeOf([][Symbol.iterator]())));
+        this.i++;
+        return {value: innerIterator, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      return 42;
+    },
+  };
+  Object.setPrototypeOf(outerIterator, Iterator.prototype);
+  const flatMapIter = outerIterator.flatMap(value => value);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertEquals({value: 2, done: false}, flatMapIter.next());
+  assertThrows(() => {flatMapIter.return()});
+})();
+
+(function TestFlatMapThrowReturnBothIterators() {
+  const outerIterator = {
+    i: 1,
+    next() {
+      if (this.i == 1) {
+        const innerIterator = {
+          j: 1,
+          next() {
+            if (this.j <= 2) {
+              return {value: this.j++, done: false};
+            } else {
+              return {value: undefined, done: true};
+            }
+          },
+          return () {
+            throw new Error('Throw return');
+          },
+        };
+        Object.setPrototypeOf(
+            innerIterator,
+            Object.getPrototypeOf(
+                Object.getPrototypeOf([][Symbol.iterator]())));
+        this.i++;
+        return {value: innerIterator, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+  Object.setPrototypeOf(outerIterator, Iterator.prototype);
+  const flatMapIter = outerIterator.flatMap(value => value);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertEquals({value: 2, done: false}, flatMapIter.next());
+  assertThrows(() => {flatMapIter.return()});
+})();
+
+(function TestFlatMapNonObjectReturnBothIterators() {
+  const outerIterator = {
+    i: 1,
+    next() {
+      if (this.i == 1) {
+        const innerIterator = {
+          j: 1,
+          next() {
+            if (this.j <= 2) {
+              return {value: this.j++, done: false};
+            } else {
+              return {value: undefined, done: true};
+            }
+          },
+          return () {
+            return 42;
+          },
+        };
+        Object.setPrototypeOf(
+            innerIterator,
+            Object.getPrototypeOf(
+                Object.getPrototypeOf([][Symbol.iterator]())));
+        this.i++;
+        return {value: innerIterator, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      return 42;
+    },
+  };
+  Object.setPrototypeOf(outerIterator, Iterator.prototype);
+  const flatMapIter = outerIterator.flatMap(value => value);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertEquals({value: 2, done: false}, flatMapIter.next());
+  assertThrows(() => {flatMapIter.return()});
+})();
+
+(function TestIteratorConstructorinFlatMap() {
+  const iter = ['It\'s Sunny', 'in California'].values();
+  const flatMapIter = iter.flatMap(value => value.split(' ').values());
+  TestHelperPrototypeSurface(flatMapIter);
+
+  assertThrows(() => {
+    for (let i = 0; i < 3; i++) {
+      function func() {}
+      Object.defineProperty(flatMapIter, 58, {set: func});
+    }
+  });
+})();
+
+(function TestIteratorReturnInIteratorsFlatMapwithNoInnerIterator() {
+  let returnCount = 0;
+
+  class TestIterator extends Iterator {
+    next() {
+      return {done: false, value: 1};
+    }
+    return() {
+      ++returnCount;
+      return {};
+    }
+  }
+
+  let iterator = new TestIterator().flatMap(() => []);
+  assertEquals(0, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+  iterator.return();
+  assertEquals(1, returnCount);
+})();
+
+(function TestFlatMapThrowInReturnWithNoInnerIterator() {
+  const IteratorThrowReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const flatMapIter = IteratorThrowReturn.flatMap(x => [x]);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertEquals({value: 2, done: false}, flatMapIter.next());
+  assertEquals({value: 3, done: false}, flatMapIter.next());
+  assertEquals({value: undefined, done: true}, flatMapIter.next());
+  assertEquals({value: undefined, done: true}, flatMapIter.return());
+})();
+
+(function TestFlatMapThrowInReturnButNotExhaustedIteratorWithNoInnerIterator() {
+  const IteratorThrowReturn = {
+    i: 1,
+    next() {
+      if (this.i <= 1) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrowReturn, Iterator.prototype);
+  const flatMapIter = IteratorThrowReturn.flatMap(x => [x]);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertThrows(() => {
+    flatMapIter.return();
+  });
+})();
+
+(function TestFlatMapMarkIteratorExhaustedAfterThrow() {
+  const IteratorThrow = {
+    i: 1,
+    next() {
+      if (this.i == 3) {
+        throw new Error('Throw return');
+      } else {
+        return {value: this.i++, done: false};
+      }
+    },
+  };
+
+  Object.setPrototypeOf(IteratorThrow, Iterator.prototype);
+  const flatMapIter = IteratorThrow.flatMap(x => [x]);
+  assertEquals({value: 1, done: false}, flatMapIter.next());
+  assertEquals({value: 2, done: false}, flatMapIter.next());
+  assertThrows(() => {
+    flatMapIter.next();
+  });
+  assertEquals({value: undefined, done: true}, flatMapIter.next());
+})();
+
+// --- Test reduce helper
+
+(function TestReduceWithInitialValue() {
+  const iter = gen();
+  assertEquals('function', typeof iter.reduce);
+  assertEquals(1, iter.reduce.length);
+  assertEquals('reduce', iter.reduce.name);
+  const reduceResult = iter.reduce((x, sum) => {
+    return sum + x;
+  }, 1);
+  assertEquals(86, reduceResult);
+})();
+
+(function TestReduceWithoutInitialvalue() {
+  const iter = gen();
+  const reduceResult = iter.reduce((x, sum) => {
+    return sum + x;
+  });
+  assertEquals(85, reduceResult);
+})();
+
+(function TestReduceWithoutInitialvalueAndNoIteratorValue() {
+  const iterator = {
+    i: 1,
+    next() {
+      if (this.i == 1) {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      return {value: undefined, done: true};
+    },
+  };
+  Object.setPrototypeOf(iterator, Iterator.prototype);
+
+  assertThrows(() => {iterator.reduce((x, sum) => {
+                 return sum + x;
+               })});
+})();
+
+// --- Test toArray helper
+
+(function TestToArray() {
+  const iter = gen();
+  assertEquals('function', typeof iter.toArray);
+  assertEquals(0, iter.toArray.length);
+  assertEquals('toArray', iter.toArray.name);
+  const toArrayResult = iter.toArray();
+  assertEquals([42, 43], toArrayResult);
+})();
+
+(function TestToArrayEmptyIterator() {
+  const iter = gen();
+  const toArrayResult = iter.take(0).toArray();
+  assertEquals([], toArrayResult);
+})();
+
+// --- Test forEach helper
+
+(function TestForEach() {
+  const iter = gen();
+  assertEquals('function', typeof iter.forEach);
+  assertEquals(1, iter.forEach.length);
+  assertEquals('forEach', iter.forEach.name);
+
+  const log = [];
+  const fn = (value) => log.push(value);
+
+  assertEquals(undefined, iter.forEach(fn));
+  assertEquals([42, 43], log);
+})();
+
+// --- Test some helper
+
+(function TestSome() {
+  const iter = gen();
+  assertEquals('function', typeof iter.some);
+  assertEquals(1, iter.some.length);
+  assertEquals('some', iter.some.name);
+
+  assertEquals(true, iter.some(v => v == 42));
+})();
+
+(function TestSomeOnConsumedIterator() {
+  const iter = gen();
+
+  assertEquals(true, iter.some(v => v == 42));
+  assertEquals(false, iter.some(v => v == 43));
+})();
+
+(function TestSomeOnNotConsumedIterator() {
+  const iter = gen();
+  const secondIter = gen();
+
+  assertEquals(true, iter.some(v => v == 43));
+  assertEquals(true, secondIter.some(v => v == 42));
+})();
+
+(function TestSomeOnIteratorWithThrowAsReturn() {
+  const iter = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(iter, Iterator.prototype);
+  assertThrows(() => {iter.some(v => v == 1)});
+})();
+
+// --- Test every helper
+
+(function TestEvery() {
+  const iter = gen();
+  assertEquals('function', typeof iter.every);
+  assertEquals(1, iter.every.length);
+  assertEquals('every', iter.every.name);
+
+  assertEquals(true, iter.every(v => v >= 42));
+})();
+
+(function TestEveryOnConsumedIterator() {
+  const iter = gen();
+
+  assertEquals(true, iter.every(v => v >= 42));
+  assertEquals(true, iter.every(v => false));
+})();
+
+(function TestEveryOnNotConsumedIterator() {
+  const iter = gen();
+  const secondIter = gen();
+
+  assertEquals(false, iter.every(v => v >= 43));
+  assertEquals(true, secondIter.every(v => v >= 42));
+})();
+
+(function TestEveryOnIteratorWithThrowAsReturn() {
+  const iter = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(iter, Iterator.prototype);
+  assertThrows(() => {iter.every(v => v == 0)});
+})();
+
+// --- Test find helper
+
+(function TestFind() {
+  const iter = gen();
+  assertEquals('function', typeof iter.find);
+  assertEquals(1, iter.find.length);
+  assertEquals('find', iter.find.name);
+
+  assertEquals(42, iter.find(v => v >= 42));
+})();
+
+(function TestFindNoValueFound() {
+  const iter = gen();
+
+  assertEquals(undefined, iter.find(v => v > 44));
+})();
+
+(function TestFindOnConsumedIterator() {
+  const iter = gen();
+
+  assertEquals(42, iter.find(v => v >= 42));
+  assertEquals(undefined, iter.find(v => v == 43));
+})();
+
+(function TestFindOnNotConsumedIterator() {
+  const iter = gen();
+  const secondIter = gen();
+
+  assertEquals(43, iter.find(v => v >= 43));
+  assertEquals(42, secondIter.find(v => v >= 42));
+})();
+
+(function TestFindOnIteratorWithThrowAsReturn() {
+  const iter = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(iter, Iterator.prototype);
+  assertThrows(() => {iter.find(v => v == 1)});
+})();
+
+(function TestFindOnIteratorWithThrowAsReturnNoValueFound() {
+  const iter = {
+    i: 1,
+    next() {
+      if (this.i <= 3) {
+        return {value: this.i++, done: false};
+      } else {
+        return {value: undefined, done: true};
+      }
+    },
+    return () {
+      throw new Error('Throw return');
+    },
+  };
+
+  Object.setPrototypeOf(iter, Iterator.prototype);
+  assertEquals(undefined, iter.find(v => v > 4));
+})();
+
+// --- Test toStringTag
+
+(function TestToStringTag() {
+  const descriptor =
+      Object.getOwnPropertyDescriptor(Iterator.prototype, Symbol.toStringTag);
+  assertEquals('Iterator', descriptor.value);
+  assertTrue(descriptor.writable);
+  assertFalse(descriptor.enumerable);
+  assertTrue(descriptor.configurable);
+})();
diff --git a/deps/v8/test/mjsunit/harmony/json-parse-with-source.js b/deps/v8/test/mjsunit/harmony/json-parse-with-source.js
index ae78ed3f2b9344..366a4dce660acf 100644
--- a/deps/v8/test/mjsunit/harmony/json-parse-with-source.js
+++ b/deps/v8/test/mjsunit/harmony/json-parse-with-source.js
@@ -149,6 +149,10 @@ function GenerateParseReviverFunction(texts) {
     '{"x":{"x":1,"y":2}}',
     JSON.stringify({ x: { x: JSON.rawJSON(1), y: JSON.rawJSON(2) } })
   );
+  assertEquals(
+    `"${'\u1234'.repeat(128)}"`,
+    JSON.stringify(JSON.rawJSON(`"${'\u1234'.repeat(128)}"`))
+  );
 })();
 
 (function TestArray() {
diff --git a/deps/v8/test/mjsunit/harmony/array-prototype-groupbytomap.js b/deps/v8/test/mjsunit/harmony/map-groupby.js
similarity index 73%
rename from deps/v8/test/mjsunit/harmony/array-prototype-groupbytomap.js
rename to deps/v8/test/mjsunit/harmony/map-groupby.js
index 84ac13cf8a4306..4cebad62bc7ccd 100644
--- a/deps/v8/test/mjsunit/harmony/array-prototype-groupbytomap.js
+++ b/deps/v8/test/mjsunit/harmony/map-groupby.js
@@ -2,13 +2,17 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-array-grouping
+// Flags: --harmony-array-grouping --allow-natives-syntax
 
-assertEquals(Array.prototype[Symbol.unscopables].groupToMap, true);
+function verifyGroupByResult(result) {
+  assertInstanceof(result, Map);
+  %HeapObjectVerify(result);
+}
 
 var array = [-0, 1, 0, 2];
 var groupToMap = () => {
-  let result = array.groupToMap(v => v > 0);
+  let result = Map.groupBy(array, v => v > 0);
+  verifyGroupByResult(result);
   result = Array.from(result.entries());
   return result;
 }
@@ -50,7 +54,8 @@ for (var idx = 0; idx < length; idx++) {
   array[idx] = idx;
 }
 var groupToMap = () => {
-  let result = array.groupToMap(v => v % 2);
+  let result = Map.groupBy(array, v => v % 2);
+  verifyGroupByResult(result);
   result = Array.from(result.entries());
   return result;
 }
@@ -63,19 +68,21 @@ assertEquals(result, [
 
 // check #sec-array.prototype.groupbymap 6.d
 var array = [-0, 0];
-var result = array.groupToMap(v => v);
+var result = Map.groupBy(array, v => v);
+verifyGroupByResult(result);
 assertEquals(result.get(0), [-0, 0]);
 
 
 // check array changed by callbackfn
 var array = [-0, 0, 1, 2];
 var groupToMap = () => {
-  let result = array.groupToMap((v, idx) => {
+  let result = Map.groupBy(array, (v, idx) => {
     if (idx === 1) {
       array[2] = {a: 'b'};
     }
     return v > 0;
   });
+  verifyGroupByResult(result);
   result = Array.from(result.entries());
   return result;
 }
@@ -88,7 +95,8 @@ assertEquals(groupToMap(), [
 // check array with holes
 var array = [1, , 2, , 3, , 4];
 var groupToMap = () => {
-  let result = array.groupToMap(v => v % 2 === 0 ? 'even' : 'not_even');
+  let result = Map.groupBy(array, v => v % 2 === 0 ? 'even' : 'not_even');
+  verifyGroupByResult(result);
   result = Array.from(result.entries());
   return result;
 };
@@ -116,18 +124,18 @@ checkNoHoles(result[1][1]);
 
 // array like objects
 var arrayLikeObjects = [
-  {
-    '0': -1,
-    '1': 1,
-    '2': 2,
-    length: 3,
-  },
+  (function* f(){
+    yield -1;
+    yield 1;
+    yield 2;
+  })(),
   (function () { return arguments })(-1, 1, 2),
   Int8Array.from([-1, 1, 2]),
   Float32Array.from([-1, 1, 2]),
 ];
 var groupToMap = () => {
-  let result = Array.prototype.groupToMap.call(array, v => v > 0);
+  let result = Map.groupBy(array, v => v > 0);
+  verifyGroupByResult(result);
   result = Array.from(result.entries());
   return result;
 };
@@ -141,7 +149,8 @@ for (var array of arrayLikeObjects) {
 // check proto elements
 var array = [,];
 var groupToMap = () => {
-  let result = array.groupToMap(v => v);
+  let result = Map.groupBy(array, v => v);
+  verifyGroupByResult(result);
   result = Array.from(result.entries());
   return result;
 }
@@ -158,7 +167,7 @@ assertEquals(groupToMap(), [
 // callbackfn throws
 var array = [-0, 1, 0, 2];
 assertThrows(
-  () => array.groupToMap(() => { throw new Error('foobar'); }),
+  () => Map.groupBy(array, () => { throw new Error('foobar'); }),
   Error,
   'foobar'
 );
@@ -167,6 +176,12 @@ assertThrows(
 // callbackfn is not callable
 var array = [-0, 1, 0, 2];
 assertThrows(
-  () => array.groupToMap('foobar'),
+  () => Map.groupBy(array, 'foobar'),
   TypeError,
 );
+
+// Lots of groups to hit grow path in the intermediate OrderedHashMap
+Map.groupBy("Strings are iterable, actually,", (x) => x);
+
+// Large group.
+Map.groupBy(new Int8Array(65536), function() {});
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-assertions-dynamic-6.mjs b/deps/v8/test/mjsunit/harmony/modules-import-assertions-dynamic-6.mjs
index 3388aefb5c5b13..76a0eddb0fdc34 100644
--- a/deps/v8/test/mjsunit/harmony/modules-import-assertions-dynamic-6.mjs
+++ b/deps/v8/test/mjsunit/harmony/modules-import-assertions-dynamic-6.mjs
@@ -8,6 +8,11 @@ var life;
 import('modules-skip-1.json', { assert: { type: 'json', notARealAssertion: 'value' } }).then(
     namespace => life = namespace.default.life);
 
+var life2;
+import('modules-skip-1.json', { assert: { 0: 'value', type: 'json' } }).then(
+    namespace => life2 = namespace.default.life);
+
 %PerformMicrotaskCheckpoint();
 
 assertEquals(42, life);
+assertEquals(42, life2);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-1.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-1.mjs
new file mode 100644
index 00000000000000..3cf6bac870b80f
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-1.mjs
@@ -0,0 +1,9 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-import-attributes
+
+import { life } from 'modules-skip-1.mjs' with { };
+
+assertEquals(42, life());
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-2.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-2.mjs
new file mode 100644
index 00000000000000..63f5859ca0f1d0
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-2.mjs
@@ -0,0 +1,9 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-import-attributes
+
+import json from 'modules-skip-1.json' with { type: 'json' };
+
+assertEquals(42, json.life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-3.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-3.mjs
new file mode 100644
index 00000000000000..34db1852367c19
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-3.mjs
@@ -0,0 +1,9 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-import-attributes
+
+import {life} from 'modules-skip-imports-json-1.mjs';
+
+assertEquals(42, life());
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-4.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-4.mjs
new file mode 100644
index 00000000000000..66bdc11c359ed4
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-4.mjs
@@ -0,0 +1,9 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-import-attributes
+
+import json from 'modules-skip-1.json' with { type: 'json', notARealAssertion: 'value'};
+
+assertEquals(42, json.life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-1.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-1.mjs
new file mode 100644
index 00000000000000..644fc96a6e2111
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-1.mjs
@@ -0,0 +1,12 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var life;
+import('modules-skip-1.mjs', { }).then(namespace => life = namespace.life());
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-10.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-10.mjs
new file mode 100644
index 00000000000000..972fbed24bfff2
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-10.mjs
@@ -0,0 +1,19 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var result1;
+var result2;
+import('modules-skip-1.json', { get with() { throw 'bad \'with\' getter!'; } }).then(
+    () => assertUnreachable('Should have failed due to throwing getter'),
+    error => result1 = error);
+import('modules-skip-1.json', { with: { get assertionKey() { throw 'bad \'assertionKey\' getter!'; } } }).then(
+    () => assertUnreachable('Should have failed due to throwing getter'),
+    error => result2 = error);
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals('bad \'with\' getter!', result1);
+assertEquals('bad \'assertionKey\' getter!', result2);
\ No newline at end of file
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-11.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-11.mjs
new file mode 100644
index 00000000000000..c39a5f9d4e2e06
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-11.mjs
@@ -0,0 +1,19 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes --harmony-top-level-await
+
+var life1;
+var life2;
+import('modules-skip-1.json', { with: { type: 'json' } }).then(
+    namespace => life1 = namespace.default.life);
+
+// Try loading the same module a second time.
+import('modules-skip-1.json', { with: { type: 'json' } }).then(
+    namespace => life2 = namespace.default.life);
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life1);
+assertEquals(42, life2);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-12.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-12.mjs
new file mode 100644
index 00000000000000..1d8fb21a502237
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-12.mjs
@@ -0,0 +1,26 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+let result1;
+let result2;
+
+let badAssertProxy1 = new Proxy({}, { ownKeys() { throw "bad ownKeys!"; } });
+import('./modules-skip-1.mjs', { with: badAssertProxy1 }).then(
+    () => assertUnreachable('Should have failed due to throwing ownKeys'),
+    error => result1 = error);
+
+let badAssertProxy2 = new Proxy(
+    {foo: "bar"},
+    { getOwnPropertyDescriptor() { throw "bad getOwnPropertyDescriptor!"; } });
+import('./modules-skip-1.mjs', { with: badAssertProxy2 }).then(
+    () => assertUnreachable(
+        'Should have failed due to throwing getOwnPropertyDescriptor'),
+    error => result2 = error);
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals('bad ownKeys!', result1);
+assertEquals('bad getOwnPropertyDescriptor!', result2);
\ No newline at end of file
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-13.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-13.mjs
new file mode 100644
index 00000000000000..6e23c07c281db1
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-13.mjs
@@ -0,0 +1,26 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+let getters = 0;
+let result;
+
+import('./modules-skip-1.mjs', { with: {
+    get attr1() {
+        getters++;
+        return {};
+    },
+    get attr2() {
+        getters++;
+        return {};
+    },
+} }).then(
+    () => assertUnreachable('Should have failed due to invalid attributes values'),
+    error => result = error);
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(2, getters);
+assertInstanceof(result, TypeError);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-2.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-2.mjs
new file mode 100644
index 00000000000000..b8e59fb0bfe9c3
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-2.mjs
@@ -0,0 +1,13 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var life;
+import('modules-skip-1.mjs', { with: { } }).then(
+    namespace => life = namespace.life());
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-3.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-3.mjs
new file mode 100644
index 00000000000000..da570eb2836edd
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-3.mjs
@@ -0,0 +1,13 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var life;
+import('modules-skip-1.json', { with: { type: 'json' } }).then(
+    namespace => life = namespace.default.life);
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-4.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-4.mjs
new file mode 100644
index 00000000000000..fff6fe2bbef84c
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-4.mjs
@@ -0,0 +1,14 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var result;
+import('modules-skip-1.json', { with: { type: 'notARealType' } }).then(
+    () => assertUnreachable('Should have failed due to bad module type'),
+    error => result = error.message);
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals('Invalid module type was asserted', result);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-5.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-5.mjs
new file mode 100644
index 00000000000000..cdb1567c330764
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-5.mjs
@@ -0,0 +1,12 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var life;
+import('modules-skip-imports-json-1.mjs',).then(namespace => life = namespace.life());
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-6.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-6.mjs
new file mode 100644
index 00000000000000..ad84e3edd5ffe1
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-6.mjs
@@ -0,0 +1,18 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var life;
+import('modules-skip-1.json', { with: { type: 'json', notARealAssertion: 'value' } }).then(
+    namespace => life = namespace.default.life);
+
+var life2;
+import('modules-skip-1.json', { with: { 0: 'value', type: 'json' } }).then(
+    namespace => life2 = namespace.default.life);
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
+assertEquals(42, life2);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-7.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-7.mjs
new file mode 100644
index 00000000000000..530d833cce5a4d
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-7.mjs
@@ -0,0 +1,63 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var result1;
+var result2;
+var result3;
+var result4;
+var result5;
+var result6;
+var result7;
+var result8;
+var result9;
+var result10;
+import('modules-skip-1.json', null).then(
+    () => assertUnreachable('Should have failed due to non-object parameter'),
+    error => result1 = error.message);
+import('modules-skip-1.json', 7).then(
+    () => assertUnreachable('Should have failed due to non-object parameter'),
+    error => result2 = error.message);
+import('modules-skip-1.json', 'string').then(
+        () => assertUnreachable('Should have failed due to non-object parameter'),
+        error => result3 = error.message);
+import('modules-skip-1.json', { with: null}).then(
+    () => assertUnreachable('Should have failed due to bad with object'),
+    error => result4 = error.message);
+import('modules-skip-1.json', { with: 7}).then(
+    () => assertUnreachable('Should have failed due to bad with object'),
+    error => result5 = error.message);
+import('modules-skip-1.json', { with: 'string'}).then(
+    () => assertUnreachable('Should have failed due to bad with object'),
+    error => result6 = error.message);
+import('modules-skip-1.json', { with: { a: null }}).then(
+    () => assertUnreachable('Should have failed due to bad with object'),
+    error => result7 = error.message);
+import('modules-skip-1.json', { with: { a: undefined }}).then(
+    () => assertUnreachable('Should have failed due to bad assertion value'),
+    error => result8 = error.message);
+import('modules-skip-1.json', { with: { a: 7 }}).then(
+    () => assertUnreachable('Should have failed due to bad assertion value'),
+    error => result9 = error.message);
+    import('modules-skip-1.json', { with: { a: { } }}).then(
+        () => assertUnreachable('Should have failed due to bad assertion value'),
+        error => result10 = error.message);
+
+%PerformMicrotaskCheckpoint();
+
+const argumentNotObjectError = 'The second argument to import() must be an object';
+const assertOptionNotObjectError = 'The \'assert\' option must be an object';
+const assertionValueNotStringError = 'Import assertion value must be a string';
+
+assertEquals(argumentNotObjectError, result1);
+assertEquals(argumentNotObjectError, result2);
+assertEquals(argumentNotObjectError, result3);
+assertEquals(assertOptionNotObjectError, result4);
+assertEquals(assertOptionNotObjectError, result5);
+assertEquals(assertOptionNotObjectError, result6);
+assertEquals(assertionValueNotStringError, result7);
+assertEquals(assertionValueNotStringError, result8);
+assertEquals(assertionValueNotStringError, result9);
+assertEquals(assertionValueNotStringError, result10);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-8.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-8.mjs
new file mode 100644
index 00000000000000..74a4504e253d6a
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-8.mjs
@@ -0,0 +1,13 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var life;
+import('modules-skip-1.mjs', undefined).then(
+    namespace => life = namespace.life());
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-9.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-9.mjs
new file mode 100644
index 00000000000000..1b56c70df61682
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-9.mjs
@@ -0,0 +1,13 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes
+
+var life;
+import('modules-skip-1.mjs', { with: undefined }).then(
+    namespace => life = namespace.life());
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-assertions-fallback-1.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-assertions-fallback-1.mjs
new file mode 100644
index 00000000000000..3faaf0dccea1c9
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-assertions-fallback-1.mjs
@@ -0,0 +1,15 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes --harmony-import-assertions
+
+var life;
+import('modules-skip-1.mjs', {
+    with: {},
+    get assert() { throw 'Should not read assert'; }
+}).then(namespace => life = namespace.life());
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
diff --git a/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-assertions-fallback-2.mjs b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-assertions-fallback-2.mjs
new file mode 100644
index 00000000000000..4c83d2fbd716cc
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/modules-import-attributes-dynamic-assertions-fallback-2.mjs
@@ -0,0 +1,15 @@
+// Copyright 2021 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-import-attributes --harmony-import-assertions
+
+var life;
+import('modules-skip-1.json', {
+    with: undefined,
+    assert: { type: 'json' }
+}).then(namespace => life = namespace.default.life);
+
+%PerformMicrotaskCheckpoint();
+
+assertEquals(42, life);
diff --git a/deps/v8/test/mjsunit/harmony/object-groupby-fast-path-assumptions-array-protector.js b/deps/v8/test/mjsunit/harmony/object-groupby-fast-path-assumptions-array-protector.js
new file mode 100644
index 00000000000000..4fc7d64cad8453
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/object-groupby-fast-path-assumptions-array-protector.js
@@ -0,0 +1,42 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-array-grouping --allow-natives-syntax
+
+assertTrue(%NoElementsProtector());
+
+// Test holey elements that also trips the elements-on-Array-prototype
+// protector.
+let arr = [0, 1, 2, 3, , , , , 8, 9];
+let grouped = Object.groupBy(arr, () => {
+  Array.prototype[5] = 42;
+});
+assertFalse(%NoElementsProtector());
+// 'undefined' is the only group.
+assertArrayEquals(['undefined'], Object.getOwnPropertyNames(grouped));
+
+let expectedGrouped = [0, 1, 2, 3, undefined, 42, undefined, undefined, 8, 9];
+assertArrayEquals(expectedGrouped, grouped['undefined']);
+delete Array.prototype[5];
+
+// Test slow elements that also trips the elements-on-Arr2ay-prototype
+// protector.
+let arr2 = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
+let grouped2 = Object.groupBy(arr2, () => {
+  delete arr2[4];
+  delete arr2[5];
+  delete arr2[6];
+  delete arr2[7];
+  Array.prototype[14] = 42;
+  arr2.length = 20;
+});
+// 'undefined' is the only group.
+assertArrayEquals(['undefined'], Object.getOwnPropertyNames(grouped2));
+
+let expectedGrouped2 = [
+  0,         1,         2,         3,         undefined, undefined, undefined,
+  undefined, 8,         9,         undefined, undefined, undefined, undefined,
+  42,        undefined, undefined, undefined, undefined, undefined
+];
+assertArrayEquals(expectedGrouped2, grouped2['undefined']);
diff --git a/deps/v8/test/mjsunit/harmony/array-prototype-groupby-fast-path-assumptions.js b/deps/v8/test/mjsunit/harmony/object-groupby-fast-path-assumptions.js
similarity index 72%
rename from deps/v8/test/mjsunit/harmony/array-prototype-groupby-fast-path-assumptions.js
rename to deps/v8/test/mjsunit/harmony/object-groupby-fast-path-assumptions.js
index f9fb03936b79f6..ce09de01842278 100644
--- a/deps/v8/test/mjsunit/harmony/array-prototype-groupby-fast-path-assumptions.js
+++ b/deps/v8/test/mjsunit/harmony/object-groupby-fast-path-assumptions.js
@@ -8,7 +8,7 @@
 let arr1 = [];
 for (let i = 0; i < 32; i++) arr1.push(i);
 let popped = false;
-let grouped1 = arr1.group(() => {
+let grouped1 = Object.groupBy(arr1, () => {
   // Pop all of the elements to trigger right-trimming of the elements
   // FixedArray.
   for (let i = 0, len = arr1.length; i < len; i++) {
@@ -20,18 +20,26 @@ assertArrayEquals(['undefined'], Object.getOwnPropertyNames(grouped1));
 // 0 the only value in the group because the grouping function pops the entire
 // array.
 let expectedGrouped1 = [0];
-for (let i = 1; i < 32; i++) expectedGrouped1.push(undefined);
 assertArrayEquals(expectedGrouped1, grouped1['undefined']);
 
 // Test result ElementsKind deduction on fast path.
 //
 // Initial Smi array, but due to length truncation result is not a Smi array.
 let arr2 = [0,1,2,3,4,5,6,7,8,9];
-let grouped2 = arr2.group(() => { arr2.length = 2; });
+let grouped2 = Object.groupBy(arr2, () => { arr2.length = 2; });
 // 'undefined' is the only group.
 assertArrayEquals(['undefined'], Object.getOwnPropertyNames(grouped2));
 // 0,1 are the only values in the group because the source array gets truncated
 // to length 2.
 let expectedGrouped2 = [0,1];
-for (let i = 2; i < 10; i++) expectedGrouped2.push(undefined);
 assertArrayEquals(expectedGrouped2, grouped2['undefined']);
+
+// Test holey elements
+let arr3 = [0, 1, 2, 3, , , , , 8, 9];
+let grouped3 = Object.groupBy(arr3, () => {});
+// 'undefined' is the only group.
+assertArrayEquals(['undefined'], Object.getOwnPropertyNames(grouped3));
+
+let expectedGrouped3 =
+    [0, 1, 2, 3, undefined, undefined, undefined, undefined, 8, 9];
+assertArrayEquals(expectedGrouped3, grouped3['undefined']);
diff --git a/deps/v8/test/mjsunit/harmony/array-prototype-groupby.js b/deps/v8/test/mjsunit/harmony/object-groupby.js
similarity index 75%
rename from deps/v8/test/mjsunit/harmony/array-prototype-groupby.js
rename to deps/v8/test/mjsunit/harmony/object-groupby.js
index fdabfe831ec1bf..a3a3be48daa585 100644
--- a/deps/v8/test/mjsunit/harmony/array-prototype-groupby.js
+++ b/deps/v8/test/mjsunit/harmony/object-groupby.js
@@ -1,14 +1,12 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
+// Copyright 2023 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // Flags: --harmony-array-grouping
 
-assertEquals(Array.prototype[Symbol.unscopables].group, true);
-
 var array = [-0, 1, 0, 2];
 var group = () => {
-  let result = array.group(v => v > 0);
+  let result = Object.groupBy(array, v => v > 0);
   result = Array.from(Object.entries(result));
   return result;
 }
@@ -50,7 +48,7 @@ for (var idx = 0; idx < length; idx++) {
   array[idx] = idx;
 }
 var group = () => {
-  let result = array.group(v => v % 2);
+  let result = Object.groupBy(array, v => v % 2);
   result = Array.from(Object.entries(result));
   return result;
 }
@@ -63,7 +61,7 @@ assertEquals(result, [
 // check array changed by callbackfn
 var array = [-0, 0, 1, 2];
 group = () => {
-  let result = array.group((v, idx) => {
+  let result = Object.groupBy(array, (v, idx) => {
     if (idx === 1) {
       array[2] = {a: 'b'};
     }
@@ -82,7 +80,7 @@ assertEquals(group(), [
 // check array with holes
 var array = [1, , 2, , 3, , 4];
 var group = () => {
-  let result = array.group(v => v % 2 === 0 ? 'even' : 'not_even');
+  let result = Object.groupBy(array, v => v % 2 === 0 ? 'even' : 'not_even');
   result = Array.from(Object.entries(result));
   return result;
 };
@@ -109,23 +107,22 @@ checkNoHoles(result[0][1]);
 checkNoHoles(result[1][1]);
 
 // array like objects
-var arrayLikeObjects = [
-  {
-    '0': -1,
-    '1': 1,
-    '2': 2,
-    length: 3,
-  },
+var iterableObjects = [
+  (function* f(){
+    yield -1;
+    yield 1;
+    yield 2;
+  })(),
   (function () { return arguments })(-1, 1, 2),
   Int8Array.from([-1, 1, 2]),
   Float32Array.from([-1, 1, 2]),
 ];
 var group = () => {
-  let result = Array.prototype.group.call(array, v => v > 0);
+  let result = Object.groupBy(iterable, v => v > 0);
   result = Array.from(Object.entries(result));
   return result;
 };
-for (var array of arrayLikeObjects) {
+for (var iterable of iterableObjects) {
   assertEquals(group(), [
     ['false', [-1]],
     ['true', [1, 2]],
@@ -136,7 +133,7 @@ for (var array of arrayLikeObjects) {
 // check proto elements
 var array = [,];
 var group = () => {
-  let result = array.group(v => v);
+  let result = Object.groupBy(array, v => v);
   result = Array.from(Object.entries(result));
   return result;
 }
@@ -154,7 +151,7 @@ assertEquals(group(), [
 // callbackfn throws
 var array = [-0, 1, 0, 2];
 assertThrows(
-  () => array.group(() => { throw new Error('foobar'); }),
+  () => Object.groupBy(array, () => { throw new Error('foobar'); }),
   Error,
   'foobar'
 );
@@ -163,7 +160,7 @@ assertThrows(
 // ToPropertyKey throws
 var array = [-0, 1, 0, 2];
 assertThrows(
-  () => array.group(() => {
+  () => Object.groupBy(array, () => {
     return {
       toString() {
         throw new Error('foobar');
@@ -178,6 +175,18 @@ assertThrows(
 // callbackfn is not callable
 var array = [-0, 1, 0, 2];
 assertThrows(
-  () => array.group('foobar'),
+  () => Object.groupBy(array, 'foobar'),
   TypeError,
 );
+
+// Lots of groups to hit grow path in the intermediate OrderedHashMap
+Object.groupBy('Strings are iterable, actually,', (x) => x);
+
+// Large group.
+Object.groupBy(new Int8Array(65536), function() {});
+
+// Large object.
+{
+  let groupKey = 0;
+  Object.groupBy(new Uint8Array(18000), () => groupKey++);
+}
diff --git a/deps/v8/test/mjsunit/harmony/promise-withresolvers.js b/deps/v8/test/mjsunit/harmony/promise-withresolvers.js
new file mode 100644
index 00000000000000..9cb244a73fb653
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/promise-withresolvers.js
@@ -0,0 +1,39 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --js-promise-withresolvers --allow-natives-syntax
+
+const desc = Object.getOwnPropertyDescriptor(Promise, 'withResolvers');
+assertTrue(desc.configurable);
+assertTrue(desc.writable);
+assertFalse(desc.enumerable);
+
+assertEquals(Promise.withResolvers.name, 'withResolvers');
+assertEquals(Promise.withResolvers.length, 0);
+
+{
+  let called = false;
+  const {promise, resolve, reject} = Promise.withResolvers();
+  promise.then(v => {
+    assertEquals(v, 'resolved');
+    called = true;
+  });
+  resolve('resolved');
+  assertFalse(called);
+  %PerformMicrotaskCheckpoint();
+  assertTrue(called);
+}
+
+{
+  let called = false;
+  const {promise, resolve, reject} = Promise.withResolvers();
+  promise.then(v => {}, v => {
+    assertEquals(v, 'rejected');
+    called = true;
+  });
+  reject('rejected');
+  assertFalse(called);
+  %PerformMicrotaskCheckpoint();
+  assertTrue(called);
+}
diff --git a/deps/v8/test/mjsunit/harmony/regexp-unicode-sets.js b/deps/v8/test/mjsunit/harmony/regexp-unicode-sets.js
index fb17068f647c9a..c20fc8c8f3a241 100644
--- a/deps/v8/test/mjsunit/harmony/regexp-unicode-sets.js
+++ b/deps/v8/test/mjsunit/harmony/regexp-unicode-sets.js
@@ -159,6 +159,7 @@ check(/[[2-57-8]--[0-3]--[5-7]]/v, Array.from('48'));
 check(/[[0-57-8]--[1-34]--[5-7]]/v, Array.from('08'));
 check(/[\d--[^02468]]/v, Array.from('02468'));
 check(/[\d--[^13579]]/v, Array.from('13579'));
+check(/[[a-c]--\0]/v, Array.from('abc'));
 
 // Ignore-Case
 check(/[Ā-č]/v, Array.from('ĀāĂ㥹Ćć'), Array.from('abc'));
@@ -166,21 +167,26 @@ check(/[ĀĂĄĆ]/vi, Array.from('ĀāĂ㥹Ćć'), Array.from('abc'));
 check(/[āăąć]/vi, Array.from('ĀāĂ㥹Ćć'), Array.from('abc'));
 
 // String disjunctions
-check(/[\q{foo|bar|0|5}]/v, ['foo', 'bar', 0, 5], ['fo', 'baz'], false)
-check(/[\q{foo|bar}[05]]/v, ['foo', 'bar', 0, 5], ['fo', 'baz'], false)
-check(/[\q{foo|bar|0|5}&&\q{bar}]/v, ['bar'], ['foo', 0, 5, 'fo', 'baz'], false)
+check(/[\q{foo|bar|0|5}]/v, ['foo', 'bar', 0, 5], ['fo', 'baz'], false);
+check(/[\q{foo|bar}[05]]/v, ['foo', 'bar', 0, 5], ['fo', 'baz'], false);
+check(
+    /[\q{foo|bar|0|5}&&\q{bar}]/v, ['bar'], ['foo', 0, 5, 'fo', 'baz'], false);
 // The second operand of the intersection doesn't contain strings, so the result
 // will not contain strings and therefore negation is valid.
-check(/[\q{foo|bar|0|5}&&\d]/v, [0, 5], ['foo', 'bar', 'fo', 'baz'], true)
-check(/[\q{foo|bar|0|5}--\q{foo}]/v, ['bar', 0, 5], ['foo', 'fo', 'baz'], false)
-check(/[\q{foo|bar|0|5}--\d]/v, ['foo', 'bar'], [0, 5, 'fo', 'baz'], false)
+check(/[\q{foo|bar|0|5}&&\d]/v, [0, 5], ['foo', 'bar', 'fo', 'baz'], true);
+check(
+    /[\q{foo|bar|0|5}--\q{foo}]/v, ['bar', 0, 5], ['foo', 'fo', 'baz'], false);
+check(/[\q{foo|bar|0|5}--\d]/v, ['foo', 'bar'], [0, 5, 'fo', 'baz'], false);
+check(
+    /[\q{foo|bar|3|2|0}--\d]/v, ['foo', 'bar'], [0, 1, 2, 3, 4, 5, 'fo', 'baz'],
+    false);
 
 check(
     /[\q{foo|bar|0|5}&&\q{bAr}]/vi, ['bar', 'bAr', 'BAR'],
-    ['foo', 0, 5, 'fo', 'baz'], false)
+    ['foo', 0, 5, 'fo', 'baz'], false);
 check(
     /[\q{foo|bar|0|5}--\q{FoO}]/vi, ['bar', 'bAr', 'BAR', 0, 5],
-    ['foo', 'FOO', 'fo', 'baz'], false)
+    ['foo', 'FOO', 'fo', 'baz'], false);
 
 check(/[\q{ĀĂĄĆ|AaAc}&&\q{āăąć}]/vi, ['ĀĂĄĆ', 'āăąć'], ['AaAc'], false);
 check(
@@ -201,11 +207,11 @@ assertEquals(1, res.length);
 assertEquals('', res[0]);
 
 // Ensure longest strings are matched first.
-assertEquals(['xyz'], /[a-c\q{W|xy|xyz}]/v.exec('xyzabc'))
-assertEquals(['xyz'], /[a-c\q{W|xyz|xy}]/v.exec('xyzabc'))
-assertEquals(['xyz'], /[\q{W|xyz|xy}a-c]/v.exec('xyzabc'))
+assertEquals(['xyz'], /[a-c\q{W|xy|xyz}]/v.exec('xyzabc'));
+assertEquals(['xyz'], /[a-c\q{W|xyz|xy}]/v.exec('xyzabc'));
+assertEquals(['xyz'], /[\q{W|xyz|xy}a-c]/v.exec('xyzabc'));
 // Empty string is last.
-assertEquals(['a'], /[\q{W|}a-c]/v.exec('abc'))
+assertEquals(['a'], /[\q{W|}a-c]/v.exec('abc'));
 
 // Some more sophisticated tests taken from
 // https://v8.dev/features/regexp-v-flag
@@ -247,5 +253,9 @@ assertTrue(
     /[\p{RGI_Emoji_Flag_Sequence}\p{RGI_Emoji_Tag_Sequence}]/v.test('🇨🇭'));
 assertTrue(/[\p{RGI_Emoji_Flag_Sequence}\p{RGI_Emoji_Tag_Sequence}]/v.test(
     '🏴󠁧󠁢󠁷󠁬󠁳󠁿'));
+
+// Check new case-folding semantics.
 assertEquals('XXXXXX4#', 'aAbBcC4#'.replaceAll(/\p{Lowercase_Letter}/giv, 'X'));
 assertEquals('XXXXXX4#', 'aAbBcC4#'.replaceAll(/[^\P{Lowercase_Letter}]/giv, 'X'));
+assertFalse(/\P{ASCII}/iv.test('K'));
+assertFalse(/^\P{Lowercase}/iv.test('A'));
diff --git a/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1372500.js b/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1372500.js
index 6264570fdd3bd7..bccca0b40761fe 100644
--- a/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1372500.js
+++ b/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1372500.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-symbol-as-weakmap-key --expose-gc
+// Flags: --expose-gc
 
 // Register an object in a FinalizationRegistry with a Symbol as the unregister
 // token.
diff --git a/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1444842.js b/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1444842.js
new file mode 100644
index 00000000000000..2ebacb7e07aac6
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1444842.js
@@ -0,0 +1,14 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-iterator-helpers
+
+let iter = Iterator.from({
+  next() {
+    return { value: 42, done: false };
+  }
+});
+function f() {}
+Object.defineProperty(iter, 100, { set: f });
+Object.defineProperty(iter, 100, { set: f });
diff --git a/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1471048.js b/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1471048.js
new file mode 100644
index 00000000000000..fddefabc27fa85
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/regress/regress-crbug-1471048.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-set-methods
+
+const firstSet = new Set();
+firstSet.add(42);
+
+const otherSet = new Set();
+
+const resultSet = new Set();
+resultSet.add(42);
+
+const resultArray = Array.from(resultSet);
+const differenceArray = Array.from(firstSet.difference(otherSet));
+
+assertEquals(resultArray, differenceArray);
diff --git a/deps/v8/test/mjsunit/harmony/set-difference.js b/deps/v8/test/mjsunit/harmony/set-difference.js
new file mode 100644
index 00000000000000..470e3dabca15d1
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/set-difference.js
@@ -0,0 +1,239 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-set-methods
+
+(function TestDifferenceSetFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  const resultSet = new Set();
+  resultSet.add(43);
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(otherSet));
+
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestDifferenceSetSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(45);
+
+  const resultSet = new Set();
+  resultSet.add(43);
+  resultSet.add(44);
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(otherSet));
+
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestDifferenceMapFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(42);
+  other.set(46);
+  other.set(47);
+
+  const resultSet = new Set();
+  resultSet.add(43);
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(other));
+
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestDifferenceMapSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const other = new Map();
+  other.set(42);
+
+  const resultSet = new Set();
+  resultSet.add(43);
+  resultSet.add(44);
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(other));
+
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestDifferenceSetLikeObjectFirstShorter() {
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const resultSet = new Set();
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(SetLike));
+
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestDifferenceSetLikeObjectSecondShorter() {
+  const SetLike = {
+    arr: [42, 43],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const resultSet = new Set();
+  resultSet.add(44);
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(SetLike));
+
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestDifferenceSetEqualLength() {
+  let arrIndex = [];
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      arrIndex.push(this.arr.indexOf(key));
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const resultSet = new Set();
+  resultSet.add(44);
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(SetLike));
+
+  assertEquals(arrIndex, [0, 1, -1]);
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestDifferenceSetShrinking() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+  firstSet.add(45);
+  firstSet.add(46);
+  firstSet.add(47);
+  firstSet.add(48);
+  firstSet.add(49);
+
+  const otherSet = new Set();
+  otherSet.add(43);
+  otherSet.add(44);
+  otherSet.add(45);
+  otherSet.add(46);
+  otherSet.add(47);
+  otherSet.add(48);
+  otherSet.add(49);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(otherSet));
+
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestIsDifferenceAfterClearingTheReceiver() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(43);
+
+  Object.defineProperty(otherSet, 'size', {
+    get: function() {
+      firstSet.clear();
+      return 1;
+    },
+
+  });
+
+  const resultSet = new Set();
+
+  const resultArray = Array.from(resultSet);
+  const differenceArray = Array.from(firstSet.difference(otherSet));
+
+  assertEquals(resultArray, differenceArray);
+})();
+
+(function TestTableTransition() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const setLike = {
+    size: 5,
+    keys() {
+      return [1, 2, 3, 4, 5].keys();
+    },
+    has(key) {
+      if (key == 43) {
+        // Cause a table transition in the receiver.
+        firstSet.clear();
+        return true;
+      }
+      return false;
+    }
+  };
+
+  assertEquals([42, 44], Array.from(firstSet.difference(setLike)));
+  assertEquals(0, firstSet.size);
+})();
diff --git a/deps/v8/test/mjsunit/harmony/set-intersection.js b/deps/v8/test/mjsunit/harmony/set-intersection.js
new file mode 100644
index 00000000000000..0373d87ecd2470
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/set-intersection.js
@@ -0,0 +1,214 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-set-methods
+
+(function TestIntersectionSetFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+
+  const resultArray = Array.from(resultSet);
+  const intersectionArray = Array.from(firstSet.intersection(otherSet));
+
+  assertEquals(resultArray, intersectionArray);
+})();
+
+(function TestIntersectionSetSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(45);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+
+  const resultArray = Array.from(resultSet);
+  const intersectionArray = Array.from(firstSet.intersection(otherSet));
+
+  assertEquals(resultArray, intersectionArray);
+})();
+
+(function TestIntersectionMapFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(42);
+  other.set(46);
+  other.set(47);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+
+  const resultArray = Array.from(resultSet);
+  const intersectionArray = Array.from(firstSet.intersection(other));
+
+  assertEquals(resultArray, intersectionArray);
+})();
+
+(function TestIntersectionMapSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const other = new Map();
+  other.set(42);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+
+  const resultArray = Array.from(resultSet);
+  const intersectionArray = Array.from(firstSet.intersection(other));
+
+  assertEquals(resultArray, intersectionArray);
+})();
+
+(function TestIntersectionSetLikeObjectFirstShorter() {
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+  resultSet.add(43);
+
+  const resultArray = Array.from(resultSet);
+  const intersectionArray = Array.from(firstSet.intersection(SetLike));
+
+  assertEquals(resultArray, intersectionArray);
+})();
+
+(function TestIntersectionSetLikeObjectSecondShorter() {
+  const SetLike = {
+    arr: [42, 43],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+  resultSet.add(43);
+
+  const resultArray = Array.from(resultSet);
+  const intersectionArray = Array.from(firstSet.intersection(SetLike));
+
+  assertEquals(resultArray, intersectionArray);
+})();
+
+(function TestIntersectionSetEqualLength() {
+  let arrIndex = [];
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      arrIndex.push(this.arr.indexOf(key));
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+  resultSet.add(43);
+
+  const resultArray = Array.from(resultSet);
+  const intersectionArray = Array.from(firstSet.intersection(SetLike));
+
+  assertEquals(arrIndex, [0, 1, -1]);
+  assertEquals(resultArray, intersectionArray);
+})();
+
+(function TestIntersectionAfterClearingTheReceiver() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  Object.defineProperty(otherSet, 'size', {
+    get: function() {
+      firstSet.clear();
+      return 3;
+    },
+
+  });
+
+  const resultSet = new Set();
+
+  const resultArray = Array.from(resultSet);
+  const intersectionArray = Array.from(firstSet.intersection(otherSet));
+
+  assertEquals(resultArray, intersectionArray);
+})();
+
+(function TestTableTransition() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const setLike = {
+    size: 5,
+    keys() {
+      return [1, 2, 3, 4, 5].keys();
+    },
+    has(key) {
+      if (key == 43) {
+        // Cause a table transition in the receiver.
+        firstSet.clear();
+        return true;
+      }
+      return false;
+    }
+  };
+
+  assertEquals([43], Array.from(firstSet.intersection(setLike)));
+  assertEquals(0, firstSet.size);
+})();
diff --git a/deps/v8/test/mjsunit/harmony/set-is-disjoint-from.js b/deps/v8/test/mjsunit/harmony/set-is-disjoint-from.js
new file mode 100644
index 00000000000000..ff1b83f3bceea9
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/set-is-disjoint-from.js
@@ -0,0 +1,157 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-set-methods
+
+(function TestIsDisjointFromSetFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  assertEquals(firstSet.isDisjointFrom(otherSet), false);
+})();
+
+(function TestIsDisjointFromSetSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const otherSet = new Set();
+  otherSet.add(45);
+  otherSet.add(46);
+
+  assertEquals(firstSet.isDisjointFrom(otherSet), true);
+})();
+
+(function TestIsDisjointFromMapFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(45);
+  other.set(46);
+  other.set(47);
+
+  assertEquals(firstSet.isDisjointFrom(other), true);
+})();
+
+(function TestIsDisjointFromMapSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const other = new Map();
+  other.set(42);
+
+  assertEquals(firstSet.isDisjointFrom(other), false);
+})();
+
+(function TestIsDisjointFromSetLikeObjectFirstShorter() {
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  assertEquals(firstSet.isDisjointFrom(SetLike), false);
+})();
+
+(function TestIsDisjointFromSetLikeObjectSecondShorter() {
+  const SetLike = {
+    arr: [42, 43],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  assertEquals(firstSet.isDisjointFrom(SetLike), false);
+})();
+
+(function TestIsDisjointFromSetEqualLength() {
+  let arrIndex = [];
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      arrIndex.push(this.arr.indexOf(key));
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(46);
+  firstSet.add(47);
+  firstSet.add(48);
+
+  assertEquals(firstSet.isDisjointFrom(SetLike), true);
+  assertEquals(arrIndex, [-1, -1, -1]);
+})();
+
+(function TestIsDisjointFromAfterClearingTheReceiver() {
+  const firstSet = new Set();
+  const otherSet = new Set();
+
+  Object.defineProperty(otherSet, 'size', {
+    get: function() {
+      firstSet.clear();
+      return 1;
+    },
+
+  });
+  assertEquals(firstSet.isDisjointFrom(otherSet), true);
+})();
+
+(function TestTableTransition() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const setLike = {
+    size: 5,
+    keys() {
+      return [1, 2, 3, 4, 5].keys();
+    },
+    has(key) {
+      if (key == 42) {
+        // Cause a table transition in the receiver.
+        firstSet.clear();
+      }
+      // Return false so we keep iterating the transitioned receiver.
+      return false;
+    }
+  };
+
+  assertTrue(firstSet.isDisjointFrom(setLike));
+  assertEquals(0, firstSet.size);
+})();
diff --git a/deps/v8/test/mjsunit/harmony/set-is-subset-of.js b/deps/v8/test/mjsunit/harmony/set-is-subset-of.js
new file mode 100644
index 00000000000000..20e544761516ac
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/set-is-subset-of.js
@@ -0,0 +1,227 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-set-methods
+
+(function TestIsSubsetOfSetFirstShorterIsSubset() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(43);
+  otherSet.add(47);
+
+  assertEquals(firstSet.isSubsetOf(otherSet), true);
+})();
+
+(function TestIsSubsetOfSetFirstShorterIsNotSubset() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  assertEquals(firstSet.isSubsetOf(otherSet), false);
+})();
+
+(function TestIsSubsetOfSetSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(44);
+
+  assertEquals(firstSet.isSubsetOf(otherSet), false);
+})();
+
+(function TestIsSubsetOfMapFirstShorterIsSubset() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(42);
+  other.set(43);
+  other.set(47);
+
+  assertEquals(firstSet.isSubsetOf(other), true);
+})();
+
+(function TestIsSubsetOfMapFirstShorterIsNotSubset() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(42);
+  other.set(46);
+  other.set(47);
+
+  assertEquals(firstSet.isSubsetOf(other), false);
+})();
+
+(function TestIsSubsetOfMapSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const other = new Map();
+  other.set(42);
+  other.set(43);
+
+  assertEquals(firstSet.isSubsetOf(other), false);
+})();
+
+(function TestIsSubsetOfSetLikeObjectFirstShorterIsSubset() {
+  const SetLike = {
+    arr: [42, 44, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(45);
+
+  assertEquals(firstSet.isSubsetOf(SetLike), true);
+})();
+
+(function TestIsSubsetOfSetLikeObjectFirstShorterIsNotSubset() {
+  const SetLike = {
+    arr: [42, 44, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  assertEquals(firstSet.isSubsetOf(SetLike), false);
+})();
+
+(function TestIsSubsetOfSetLikeObjectSecondShorter() {
+  const SetLike = {
+    arr: [42, 43],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  assertEquals(firstSet.isSubsetOf(SetLike), false);
+})();
+
+(function TestIsSubsetOfSetEqualLengthIsSubset() {
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(45);
+
+  assertEquals(firstSet.isSubsetOf(SetLike), true);
+})();
+
+(function TestIsSubsetOfSetEqualLengthIsNotSubset() {
+  const SetLike = {
+    arr: [42, 44, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(45);
+
+  assertEquals(firstSet.isSubsetOf(SetLike), false);
+})();
+
+(function TestIsSubsetOfAfterClearingTheReceiver() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(43);
+  otherSet.add(47);
+
+  Object.defineProperty(otherSet, 'size', {
+    get: function() {
+      firstSet.clear();
+      return 3;
+    },
+
+  });
+
+  assertEquals(firstSet.isSubsetOf(otherSet), true);
+})();
+
+(function TestTableTransition() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const setLike = {
+    size: 5,
+    keys() {
+      return [1, 2, 3, 4, 5].keys();
+    },
+    has(key) {
+      if (key == 42) {
+        // Cause a table transition in the receiver.
+        firstSet.clear();
+      }
+      // Return true so we keep iterating the transitioned receiver.
+      return true;
+    }
+  };
+
+  assertTrue(firstSet.isSubsetOf(setLike));
+  assertEquals(0, firstSet.size);
+})();
diff --git a/deps/v8/test/mjsunit/harmony/set-is-superset-of.js b/deps/v8/test/mjsunit/harmony/set-is-superset-of.js
new file mode 100644
index 00000000000000..c269f47b6f33fa
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/set-is-superset-of.js
@@ -0,0 +1,189 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-set-methods
+
+(function TestIsSupersetOfSetFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(44);
+
+  assertEquals(firstSet.isSupersetOf(otherSet), false);
+})();
+
+(function TestIsSupersetOfSetSecondShorterIsSuperset() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+
+  assertEquals(firstSet.isSupersetOf(otherSet), true);
+})();
+
+(function TestIsSupersetOfSetSecondShorterIsNotSuperset() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(46);
+
+  assertEquals(firstSet.isSupersetOf(otherSet), false);
+})();
+
+(function TestIsSupersetOfMapFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(42);
+  other.set(43);
+  other.set(47);
+
+  assertEquals(firstSet.isSupersetOf(other), false);
+})();
+
+(function TestIsSupersetOfMapSecondShorterIsSuperset() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(42);
+
+  assertEquals(firstSet.isSupersetOf(other), true);
+})();
+
+(function TestIsSupersetOfMapSecondShorterIsNotSuperset() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(44);
+
+  assertEquals(firstSet.isSupersetOf(other), false);
+})();
+
+(function TestIsSupersetOfSetLikeObjectFirstShorter() {
+  const SetLike = {
+    arr: [42, 44, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(45);
+
+  assertEquals(firstSet.isSupersetOf(SetLike), false);
+})();
+
+(function TestIsSupersetOfSetLikeObjectFirstShorterIsSuperset() {
+  const SetLike = {
+    arr: [42],
+    size: 1,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  assertEquals(firstSet.isSupersetOf(SetLike), true);
+})();
+
+(function TestIsSupersetOfSetLikeObjectFirstShorterIsNotSuperset() {
+  const SetLike = {
+    arr: [44],
+    size: 1,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  assertEquals(firstSet.isSupersetOf(SetLike), false);
+})();
+
+(function TestIsSupersetOfSetEqualLengthIsSuperset() {
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(45);
+
+  assertEquals(firstSet.isSupersetOf(SetLike), true);
+})();
+
+(function TestIsSupersetOfSetEqualLengthIsNotSuperset() {
+  const SetLike = {
+    arr: [42, 44, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(45);
+
+  assertEquals(firstSet.isSupersetOf(SetLike), false);
+})();
+
+(function TestIsSupersetOfAfterClearingTheReceiver() {
+  const firstSet = new Set();
+  firstSet.add(42);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(44);
+
+  Object.defineProperty(otherSet, 'size', {
+    get: function() {
+      firstSet.clear();
+      return 2;
+    },
+
+  });
+
+  assertEquals(firstSet.isSupersetOf(otherSet), false);
+})();
diff --git a/deps/v8/test/mjsunit/harmony/set-symmetric-difference.js b/deps/v8/test/mjsunit/harmony/set-symmetric-difference.js
new file mode 100644
index 00000000000000..a8fdfa39ac89d6
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/set-symmetric-difference.js
@@ -0,0 +1,248 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-set-methods
+
+(function TestSymmetricDifferenceSetFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  const resultSet = new Set();
+  resultSet.add(43);
+  resultSet.add(46);
+  resultSet.add(47);
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(otherSet));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
+
+(function TestSymmetricDifferenceSetSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(44);
+
+  const resultSet = new Set();
+  resultSet.add(43);
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(otherSet));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
+
+(function TestSymmetricDifferenceMapFirstShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const other = new Map();
+  other.set(42);
+  other.set(46);
+  other.set(47);
+
+  const resultSet = new Set();
+  resultSet.add(43);
+  resultSet.add(46);
+  resultSet.add(47);
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(other));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
+
+(function TestSymmetricDifferenceMapSecondShorter() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const other = new Map();
+  other.set(42);
+  other.set(43);
+  other.set(44);
+
+  const resultSet = new Set();
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(other));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
+
+(function TestSymmetricDifferenceSetLikeObjectFirstShorter() {
+  const SetLike = {
+    arr: [42, 44, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const resultSet = new Set();
+  resultSet.add(43);
+  resultSet.add(44);
+  resultSet.add(45);
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(SetLike));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
+
+(function TestSymmetricDifferenceSetLikeObjectSecondShorter() {
+  const SetLike = {
+    arr: [42, 43],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const resultSet = new Set();
+  resultSet.add(44);
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(SetLike));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
+
+(function TestSymmetricDifferenceSetEqualLength() {
+  const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const resultSet = new Set();
+  resultSet.add(44);
+  resultSet.add(45);
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(SetLike));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
+
+(function TestSymmetricDifferenceSetShrinking() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+  firstSet.add(45);
+  firstSet.add(46);
+  firstSet.add(47);
+  firstSet.add(48);
+  firstSet.add(49);
+
+  const otherSet = new Set();
+  otherSet.add(43);
+  otherSet.add(44);
+  otherSet.add(45);
+  otherSet.add(46);
+  otherSet.add(47);
+  otherSet.add(48);
+  otherSet.add(49);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(otherSet));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
+
+(function TestSymmetricDifferenceGrowFastPath() {
+  const s1 = new Set([1, 2, 3]).symmetricDifference(new Set([4, 5, 6]));
+  assertEquals([1, 2, 3, 4, 5, 6], Array.from(s1));
+
+  const s2 = new Set([1, 2, 3]).symmetricDifference(new Set([3, 4, 5, 6]));
+  assertEquals([1, 2, 4, 5, 6], Array.from(s2));
+
+  const s3 =
+      new Set([1, 2, 3]).symmetricDifference(new Map([[4, 4], [5, 5], [6, 6]]));
+  assertEquals([1, 2, 3, 4, 5, 6], Array.from(s3));
+
+  const s4 = new Set([1, 2, 3]).symmetricDifference(
+      new Map([[3, 3], [4, 4], [5, 5], [6, 6]]));
+  assertEquals([1, 2, 4, 5, 6], Array.from(s4));
+})();
+
+(function TestSymmetricDifferenceAfterClearingTheReceiver() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+
+  const otherSet = new Set();
+  otherSet.add(42);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  Object.defineProperty(otherSet, 'size', {
+    get: function() {
+      firstSet.clear();
+      return 3;
+    },
+
+  });
+
+  const resultSet = new Set();
+  resultSet.add(42);
+  resultSet.add(46);
+  resultSet.add(47);
+
+  const resultArray = Array.from(resultSet);
+  const symmetricDifferenceArray =
+      Array.from(firstSet.symmetricDifference(otherSet));
+
+  assertEquals(resultArray, symmetricDifferenceArray);
+})();
diff --git a/deps/v8/test/mjsunit/harmony/set-union.js b/deps/v8/test/mjsunit/harmony/set-union.js
new file mode 100644
index 00000000000000..5fd96aa693c267
--- /dev/null
+++ b/deps/v8/test/mjsunit/harmony/set-union.js
@@ -0,0 +1,201 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-set-methods
+
+(function TestUnionSet() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const otherSet = new Set();
+  otherSet.add(45);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+  resultSet.add(43);
+  resultSet.add(44);
+  resultSet.add(45);
+  resultSet.add(46);
+  resultSet.add(47);
+
+  const resultArray = Array.from(resultSet);
+  const unionArray = Array.from(firstSet.union(otherSet));
+
+  assertEquals(resultArray, unionArray);
+})();
+
+(function TestUnionSetWithDuplicates() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const otherSet = new Set();
+  otherSet.add(45);
+  otherSet.add(44);
+  otherSet.add(43);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+  resultSet.add(43);
+  resultSet.add(44);
+  resultSet.add(45);
+
+  const resultArray = Array.from(resultSet);
+  const unionArray = Array.from(firstSet.union(otherSet));
+
+  assertEquals(resultArray, unionArray);
+})();
+
+(function TestUnionMap() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const other = new Map();
+  other.set(45);
+  other.set(46);
+  other.set(47);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+  resultSet.add(43);
+  resultSet.add(44);
+  resultSet.add(45);
+  resultSet.add(46);
+  resultSet.add(47);
+
+  const resultArray = Array.from(resultSet);
+  const unionArray = Array.from(firstSet.union(other));
+
+  assertEquals(resultArray, unionArray);
+})();
+
+(function TestUnionSetLikeObject() {
+  const SetLike = {
+    arr: [45, 46, 47],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const resultSet = new Set();
+  resultSet.add(42);
+  resultSet.add(43);
+  resultSet.add(44);
+  resultSet.add(45);
+  resultSet.add(46);
+  resultSet.add(47);
+
+  const resultArray = Array.from(resultSet);
+  const unionArray = Array.from(firstSet.union(SetLike));
+
+  assertEquals(resultArray, unionArray);
+})();
+
+(function TestUnionSetLikeObjectNotIterableKeys() {
+  const SetLike = {
+    arr: [45, 46, 47],
+    size: 3,
+    keys() {
+      return 42;
+    },
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  assertThrows(() => {
+    firstSet.union(SetLike);
+  });
+})();
+
+(function TestUnionSetLikeObjectNotCallableKeys() {
+  const SetLike = {
+    arr: [45, 46, 47],
+    size: 3,
+    keys: 42,
+    has(key) {
+      return this.arr.indexOf(key) != -1;
+    }
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  assertThrows(() => {
+    firstSet.union(SetLike);
+  });
+})();
+
+(function TestUnionSetLikeObjectNotCallableHas() {
+  const SetLike = {
+    arr: [45, 46, 47],
+    size: 3,
+    keys() {
+      return this.arr[Symbol.iterator]();
+    },
+    has: 42
+  };
+
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  assertThrows(() => {
+    firstSet.union(SetLike);
+  });
+})();
+
+(function TestUnionAfterClearingTheReceiver() {
+  const firstSet = new Set();
+  firstSet.add(42);
+  firstSet.add(43);
+  firstSet.add(44);
+
+  const otherSet = new Set();
+  otherSet.add(45);
+  otherSet.add(46);
+  otherSet.add(47);
+
+  Object.defineProperty(otherSet, 'size', {
+    get: function() {
+      firstSet.clear();
+      return 3;
+    },
+
+  });
+
+  const resultSet = new Set();
+  resultSet.add(45);
+  resultSet.add(46);
+  resultSet.add(47);
+
+  const resultArray = Array.from(resultSet);
+  const unionArray = Array.from(firstSet.union(otherSet));
+
+  assertEquals(resultArray, unionArray);
+})();
diff --git a/deps/v8/test/mjsunit/harmony/sharedarraybuffer.js b/deps/v8/test/mjsunit/harmony/sharedarraybuffer.js
index 433c14e19584d7..9a191919508be5 100644
--- a/deps/v8/test/mjsunit/harmony/sharedarraybuffer.js
+++ b/deps/v8/test/mjsunit/harmony/sharedarraybuffer.js
@@ -25,7 +25,7 @@
 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-// Flags: --harmony-sharedarraybuffer --allow-natives-syntax
+// Flags: --allow-natives-syntax
 
 // SharedArrayBuffer
 
diff --git a/deps/v8/test/mjsunit/harmony/string-iswellformed-external-uncached.js b/deps/v8/test/mjsunit/harmony/string-iswellformed-external-uncached.js
index 193294e394355c..c36649ae078716 100644
--- a/deps/v8/test/mjsunit/harmony/string-iswellformed-external-uncached.js
+++ b/deps/v8/test/mjsunit/harmony/string-iswellformed-external-uncached.js
@@ -5,8 +5,10 @@
 // Flags: --expose-externalize-string --harmony-string-is-well-formed
 
 (function TestIsWellFormed() {
-  const short2ByteWellFormed = '\u1234';
-  const short2ByteIllFormed = '\uD83D';
+  const short2ByteWellFormed = createExternalizableString(
+      '\u1234'.padEnd(kExternalStringMinTwoByteLength, '\u1234'));
+  const short2ByteIllFormed = createExternalizableString(
+      '\uD83D'.padEnd(kExternalStringMinTwoByteLength, '\uD83D'));
 
   assertTrue(short2ByteWellFormed.isWellFormed());
   assertFalse(short2ByteIllFormed.isWellFormed());
@@ -14,17 +16,20 @@
   try {
     // Turn the strings into uncached external strings to hit the slow runtime
     // path.
-    externalizeString(short2ByteWellFormed, true);
-    externalizeString(short2ByteIllFormed, true);
-  } catch (e) {}
+    externalizeString(short2ByteWellFormed);
+    externalizeString(short2ByteIllFormed);
+  } catch (e) {
+  }
 
   assertTrue(short2ByteWellFormed.isWellFormed());
   assertFalse(short2ByteIllFormed.isWellFormed());
 })();
 
 (function TestToWellFormed() {
-  const short2ByteWellFormed = '\u1234';
-  const short2ByteIllFormed = '\uD83D';
+  const short2ByteWellFormed = createExternalizableString(
+      '\u1234'.padEnd(kExternalStringMinTwoByteLength, '\u1234'));
+  const short2ByteIllFormed = createExternalizableString(
+      '\uD83D'.padEnd(kExternalStringMinTwoByteLength, '\uD83D'));
 
   assertTrue(short2ByteWellFormed.isWellFormed());
   assertFalse(short2ByteIllFormed.isWellFormed());
@@ -32,11 +37,16 @@
   try {
     // Turn the strings into uncached external strings to hit the slow runtime
     // path.
-    externalizeString(short2ByteWellFormed, true);
-    externalizeString(short2ByteIllFormed, true);
-  } catch (e) {}
-
-  assertEquals('\u1234', short2ByteWellFormed.toWellFormed());
+    externalizeString(short2ByteWellFormed);
+    externalizeString(short2ByteIllFormed);
+  } catch (e) {
+  }
+
+  assertEquals(
+      '\u1234'.padEnd(kExternalStringMinTwoByteLength, '\u1234'),
+      short2ByteWellFormed.toWellFormed());
   // U+FFFD (REPLACEMENT CHARACTER)
-  assertEquals('\uFFFD', short2ByteIllFormed.toWellFormed());
+  assertEquals(
+      '\uFFFD'.padEnd(kExternalStringMinTwoByteLength, '\uFFFD'),
+      short2ByteIllFormed.toWellFormed());
 })();
diff --git a/deps/v8/test/mjsunit/harmony/symbol-as-weakmap-key.js b/deps/v8/test/mjsunit/harmony/symbol-as-weakmap-key.js
index 284e78b30196b7..0001bf05cbaeb6 100644
--- a/deps/v8/test/mjsunit/harmony/symbol-as-weakmap-key.js
+++ b/deps/v8/test/mjsunit/harmony/symbol-as-weakmap-key.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-symbol-as-weakmap-key --expose-gc --allow-natives-syntax --noincremental-marking
+// Flags: --expose-gc --allow-natives-syntax --noincremental-marking
 
 (function TestWeakMapWithNonRegisteredSymbolKey() {
   const key = Symbol('123');
@@ -35,10 +35,17 @@
     assertTrue(map.has(innerKey));
     assertSame(innerValue, map.get(innerKey));
   })();
-  gc();
-  assertTrue(map.has(outerKey));
-  assertSame(outerValue, map.get(outerKey));
-  assertEquals(1, %GetWeakCollectionSize(map));
+
+  // We need to invoke GC asynchronously and wait for it to finish, so that
+  // it doesn't need to scan the stack. Otherwise, some objects may not be
+  // reclaimed because of conservative stack scanning and the test may not
+  // work as intended.
+  (async function () {
+    await gc({ type: 'major', execution: 'async' });
+    assertTrue(map.has(outerKey));
+    assertSame(outerValue, map.get(outerKey));
+    assertEquals(1, %GetWeakCollectionSize(map));
+  })();
 })();
 
 (function TestWeakMapWithRegisteredSymbolKey() {
@@ -81,8 +88,15 @@
     assertTrue(set.has(innerKey));
   })();
   assertTrue(set.has(outerKey));
-  gc();
-  assertEquals(1, %GetWeakCollectionSize(set));
+  // We need to invoke GC asynchronously and wait for it to finish, so that
+  // it doesn't need to scan the stack. Otherwise, some objects may not be
+  // reclaimed because of conservative stack scanning and the test may not
+  // work as intended.
+  (async function () {
+    await gc({ type: 'major', execution: 'async' });
+    assertTrue(set.has(outerKey));
+    assertEquals(1, %GetWeakCollectionSize(set));
+  })();
 })();
 
 (function TestWeakSetWithRegisteredSymbolKey() {
diff --git a/deps/v8/test/mjsunit/harmony/weakrefs/symbol-as-weakref-target-gc.js b/deps/v8/test/mjsunit/harmony/weakrefs/symbol-as-weakref-target-gc.js
index 87b1e37602b637..0fb0d1723a2e65 100644
--- a/deps/v8/test/mjsunit/harmony/weakrefs/symbol-as-weakref-target-gc.js
+++ b/deps/v8/test/mjsunit/harmony/weakrefs/symbol-as-weakref-target-gc.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-symbol-as-weakmap-key --expose-gc --noincremental-marking
+// Flags: --expose-gc --noincremental-marking
 
 (async function () {
 
diff --git a/deps/v8/test/mjsunit/harmony/weakrefs/symbol-as-weakref-target.js b/deps/v8/test/mjsunit/harmony/weakrefs/symbol-as-weakref-target.js
index 1dc874ed83b3da..a969f388717a50 100644
--- a/deps/v8/test/mjsunit/harmony/weakrefs/symbol-as-weakref-target.js
+++ b/deps/v8/test/mjsunit/harmony/weakrefs/symbol-as-weakref-target.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-symbol-as-weakmap-key
-
 (function TestRegisterWithSymbolTarget() {
   const fg = new FinalizationRegistry(() => { });
   fg.register(Symbol('123'), 'holdings');
diff --git a/deps/v8/test/mjsunit/harmony/weakrefs/symbol-in-finalizationregistry.js b/deps/v8/test/mjsunit/harmony/weakrefs/symbol-in-finalizationregistry.js
index 2158143ac3d29d..443350e90f5459 100644
--- a/deps/v8/test/mjsunit/harmony/weakrefs/symbol-in-finalizationregistry.js
+++ b/deps/v8/test/mjsunit/harmony/weakrefs/symbol-in-finalizationregistry.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-symbol-as-weakmap-key --expose-gc --noincremental-marking
+// Flags: --expose-gc --noincremental-marking
 
 (async function () {
 
diff --git a/deps/v8/test/mjsunit/ignition/string-concat-external-thin-string.js b/deps/v8/test/mjsunit/ignition/string-concat-external-thin-string.js
index f9f538c5f5cece..70cbb5ca7e8ccc 100644
--- a/deps/v8/test/mjsunit/ignition/string-concat-external-thin-string.js
+++ b/deps/v8/test/mjsunit/ignition/string-concat-external-thin-string.js
@@ -5,10 +5,12 @@
 // Flags: --allow-natives-syntax --expose-externalize-string
 
 // Calculate string so that it isn't internalized.
-var string = ((a,b) => { return a + b; })('foo', 'bar');
+var string = createExternalizableString(((a, b) => {
+  return a + b;
+})('foo', 'bar'));
 
 // Now externalize it.
-externalizeString(string, false);
+externalizeString(string);
 
 // Then internalize it by using it as a keyed property name
 // to turn it a thin string.
diff --git a/deps/v8/test/mjsunit/interrupt-budget-override.js b/deps/v8/test/mjsunit/interrupt-budget-override.js
index fe0a874de0f671..416819f7cd537a 100644
--- a/deps/v8/test/mjsunit/interrupt-budget-override.js
+++ b/deps/v8/test/mjsunit/interrupt-budget-override.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --turbofan --interrupt-budget=100 --interrupt-budget-for-feedback-allocation=10 --allow-natives-syntax --nomaglev
+// Flags: --turbofan --invocation-count-for-turbofan=2 --interrupt-budget-for-feedback-allocation=10 --allow-natives-syntax --nomaglev --minimum-invocations-before-optimization=0
 
 function f() {
   let s = 0;
diff --git a/deps/v8/test/mjsunit/json-errors.js b/deps/v8/test/mjsunit/json-errors.js
index 0fa30601672c71..02bfed59c31c84 100644
--- a/deps/v8/test/mjsunit/json-errors.js
+++ b/deps/v8/test/mjsunit/json-errors.js
@@ -12,19 +12,58 @@ function TryParse(s, message) {
 }
 
 var s = `{"a\\\\b `;
-TryParse(s, "Unterminated string in JSON at position 7");
+TryParse(s, "Unterminated string in JSON at position 7 (line 1 column 8)");
 
 var s = `{"a\\\\\u03A9 `;
-TryParse(s, "Unterminated string in JSON at position 7");
+TryParse(s, "Unterminated string in JSON at position 7 (line 1 column 8)");
 
 var s = `{"ab `;
-TryParse(s, "Unterminated string in JSON at position 5");
+TryParse(s, "Unterminated string in JSON at position 5 (line 1 column 6)");
 
 var s = `{"a\u03A9 `;
-TryParse(s, "Unterminated string in JSON at position 5");
+TryParse(s, "Unterminated string in JSON at position 5 (line 1 column 6)");
 
 var s = `{"a\nb":"b"}`;
-TryParse(s, "Bad control character in string literal in JSON at position 3");
+TryParse(s, "Bad control character in string literal in JSON " +
+            "at position 3 (line 1 column 4)");
 
 var s = `{"a\nb":"b\u03A9"}`;
-TryParse(s, "Bad control character in string literal in JSON at position 3");
+TryParse(s, "Bad control character in string literal in JSON " +
+            "at position 3 (line 1 column 4)");
+
+// === Test line counting ===
+// \r and \n are line terminators.
+var s = `{\n7:1}`;
+TryParse(s, "Expected property name or '}' in JSON " +
+            "at position 2 (line 2 column 1)");
+
+var s = `{\r7:1}`;
+TryParse(s, "Expected property name or '}' in JSON " +
+            "at position 2 (line 2 column 1)");
+
+// The sequence \r\n counts as a single line terminator.
+var s = `{\r\n7:1}`;
+TryParse(s, "Expected property name or '}' in JSON " +
+            "at position 3 (line 2 column 1)");
+
+// The sequences \r\r, \n\n and \n\r count as 2 line terminators.
+var s = `{\r\r7:1}`;
+TryParse(s, "Expected property name or '}' in JSON " +
+            "at position 3 (line 3 column 1)");
+var s = `{\n\n7:1}`;
+TryParse(s, "Expected property name or '}' in JSON " +
+            "at position 3 (line 3 column 1)");
+var s = `{\n\r7:1}`;
+TryParse(s, "Expected property name or '}' in JSON " +
+            "at position 3 (line 3 column 1)");
+
+// \u2028 and \u2029 (line terminators according to ECMA-262 11.3) aren't
+// allowed in JSON (and therefore don't need to be counted).
+var s = `\u2028{}`;
+TryParse(s, "Unexpected token '\u2028', \"\u2028{}\" is not valid JSON");
+var s = `\u2029{}`;
+TryParse(s, "Unexpected token '\u2029', \"\u2029{}\" is not valid JSON");
+
+var s = `\n  { \n\n"12345": 5,,}`;
+TryParse(s, "Expected double-quoted property name in JSON " +
+            "at position 18 (line 4 column 12)");
diff --git a/deps/v8/test/mjsunit/json2.js b/deps/v8/test/mjsunit/json2.js
index f56fd43f58f839..e39b17b3e55066 100644
--- a/deps/v8/test/mjsunit/json2.js
+++ b/deps/v8/test/mjsunit/json2.js
@@ -127,6 +127,11 @@ assertThrows(function() { JSON.stringify(tojson_ex, null, 0); });
 var obj = { toJSON: function(key) { return this.a + key; }, a: "x" };
 TestStringify('{"y":"xy"}', {y: obj});
 
+// Test invalid string length exception.
+assertThrows(function() {
+  JSON.stringify('a'.repeat(%StringMaxLength() - 1));
+});
+
 // Test holes in arrays.
 var fast_smi = [1, 2, 3, 4];
 fast_smi.__proto__ = [7, 7, 7, 7];
@@ -180,9 +185,9 @@ Object.defineProperty(non_enum, "b", { value: 2, enumerable: false });
 non_enum.c = 3;
 TestStringify('{"a":1,"c":3}', non_enum);
 
-var str = "external";
+var str = createExternalizableString('external');
 try {
-  externalizeString(str, true);
+  externalizeString(str);
 } catch (e) { }
 TestStringify("\"external\"", str, null, 0);
 
diff --git a/deps/v8/test/mjsunit/large-external-string.js b/deps/v8/test/mjsunit/large-external-string.js
index d07c47c3952a44..b097259b5a70b6 100644
--- a/deps/v8/test/mjsunit/large-external-string.js
+++ b/deps/v8/test/mjsunit/large-external-string.js
@@ -11,6 +11,6 @@ for (var i = 0; i < LENGTH; ++i) {
   data.push('do ');
 }
 
-const largeText = data.join();
+const largeText = createExternalizableString(data.join());
 externalizeString(largeText);
 gc();
diff --git a/deps/v8/test/mjsunit/maglev/array-foreach-with-transition.js b/deps/v8/test/mjsunit/maglev/array-foreach-with-transition.js
new file mode 100644
index 00000000000000..96e83a4f326fda
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/array-foreach-with-transition.js
@@ -0,0 +1,34 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+let change_elements = false
+
+function maybe_change_elements(a) {
+  if (change_elements) {
+    let old = a[1];
+    // Transition a to DOUBLE_ELEMENTS
+    a[1] = 0.5;
+    a[1] = old;
+  }
+}
+
+function foo(a, f) {
+  let sum = 0;
+  a.forEach(v=>{
+    sum += v;
+    maybe_change_elements(a);
+  })
+  return sum;
+}
+
+%NeverOptimizeFunction(maybe_change_elements);
+%PrepareFunctionForOptimization(foo);
+assertEquals(3, foo([0,1,2]));
+assertEquals(3, foo([0,1,2]));
+%OptimizeMaglevOnNextCall(foo);
+assertEquals(3, foo([0,1,2]));
+change_elements = true;
+foo([0,1,2]);
diff --git a/deps/v8/test/mjsunit/maglev/branch-if-xxx-to-boolean-true.js b/deps/v8/test/mjsunit/maglev/branch-if-xxx-to-boolean-true.js
new file mode 100644
index 00000000000000..d4f093ba15ec2a
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/branch-if-xxx-to-boolean-true.js
@@ -0,0 +1,174 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --maglev --allow-natives-syntax
+
+///////////////////////////////////////////////////////////////
+// Without Phis
+
+function basic_int32(a) {
+  let c = a + 2;
+  if (c) {
+    return 42;
+  } else {
+    return 19;
+  }
+}
+
+%PrepareFunctionForOptimization(basic_int32);
+assertEquals(19, basic_int32(-2));
+assertEquals(42, basic_int32(3));
+%OptimizeMaglevOnNextCall(basic_int32);
+assertEquals(19, basic_int32(-2));
+assertEquals(42, basic_int32(3));
+
+
+function basic_float64(a) {
+  let c = a + 2.5;
+  if (c) {
+    return 1.6;
+  } else {
+    if (c == c) {
+      return 2.42;
+    } else {
+      return 3.11;
+    }
+  }
+}
+
+%PrepareFunctionForOptimization(basic_float64);
+assertEquals(2.42, basic_float64(-2.5));
+assertEquals(1.6, basic_float64(3.5));
+assertEquals(3.11, basic_float64(NaN));
+%OptimizeMaglevOnNextCall(basic_float64);
+assertEquals(2.42, basic_float64(-2.5));
+assertEquals(1.6, basic_float64(3.5));
+assertEquals(3.11, basic_float64(NaN));
+
+function basic_holey_float64(a) {
+  let c = a + 2.5;
+  if (c) {
+    return 1.6;
+  } else {
+    if (a == a) {
+      return 3.6 + a;
+    } else {
+      return 3.11;
+    }
+  }
+}
+
+%PrepareFunctionForOptimization(basic_holey_float64);
+assertEquals(1.1, basic_holey_float64(-2.5));
+assertEquals(1.6, basic_holey_float64(3.5));
+assertEquals(3.11, basic_holey_float64(NaN));
+assertEquals(NaN, basic_holey_float64([1.1, , 2.2][1]));
+%OptimizeMaglevOnNextCall(basic_holey_float64);
+assertEquals(1.1, basic_holey_float64(-2.5));
+assertEquals(1.6, basic_holey_float64(3.5));
+assertEquals(3.11, basic_holey_float64(NaN));
+assertEquals(NaN, basic_holey_float64([1.1, , 2.2][1]));
+
+///////////////////////////////////////////////////////////////
+// With Phis as condition.
+//
+// When Phi untagging is enabled, the condition should start as
+// BranchIfToBooleanTrue, and later be updated to BranchIfInt32ToBooleanTrue or
+// BranchIfFloat64ToBooleanTrue.
+
+function phi_int32(a) {
+  let phi = a ? 4 : 0;
+  if (phi) {
+    return phi + 5;
+  } else {
+    return phi + 3;
+  }
+}
+
+%PrepareFunctionForOptimization(phi_int32);
+assertEquals(3, phi_int32(0));
+assertEquals(9, phi_int32(1));
+%OptimizeMaglevOnNextCall(phi_int32);
+assertEquals(3, phi_int32(0));
+assertEquals(9, phi_int32(1));
+
+
+
+function phi_float64_no_nan(a) {
+  let phi = a ? 3.5 : 0;
+  if (phi) {
+    return phi + 1.6;
+  } else {
+    return phi + 2.5;
+  }
+}
+
+%PrepareFunctionForOptimization(phi_float64_no_nan);
+assertEquals(2.5, phi_float64_no_nan(0));
+assertEquals(5.1, phi_float64_no_nan(1));
+%OptimizeMaglevOnNextCall(phi_float64_no_nan);
+assertEquals(2.5, phi_float64_no_nan(0));
+assertEquals(5.1, phi_float64_no_nan(1));
+
+
+
+function phi_float64_nan(a, b) {
+  let nan = 0 / a;
+  let f64 = b + 0.5;
+  let phi = a ? f64 : nan;
+  if (phi) {
+    return phi + 4.5;
+  } else {
+    if (phi == phi) {
+      return phi + 2.1;
+    } else {
+      return 4.25;
+    }
+  }
+}
+
+%PrepareFunctionForOptimization(phi_float64_nan);
+assertEquals(4.25, phi_float64_nan(0, 0.5));
+assertEquals(2.1, phi_float64_nan(1, -0.5));
+assertEquals(5.5, phi_float64_nan(1, 0.5));
+%OptimizeMaglevOnNextCall(phi_float64_nan);
+assertEquals(4.25, phi_float64_nan(0, 0.5));
+assertEquals(2.1, phi_float64_nan(1, -0.5));
+assertEquals(5.5, phi_float64_nan(1, 0.5));
+
+
+
+let arr = [1.5, , NaN, 0.0];
+
+function phi_float64_holey(a, arr) {
+  let holey_f64 = arr[a];
+  let phi = arr ? holey_f64 : 4;
+  if (phi) {
+    return phi + 1.7;
+  } else {
+    // We should get here for:
+    //  a == 1 ==> the_hole
+    //  a == 2 ==> NaN
+    //  a == 3 ==> 0.0
+    // To distinguish between the 3 cases, we add a branch on "a".
+    if (a != 2) {
+      return phi + 2.1;
+    } else {
+      return 4.25;
+    }
+  }
+}
+
+%PrepareFunctionForOptimization(phi_float64_holey);
+assertEquals(3.2, phi_float64_holey(0, arr));
+// We don't load the_hole during feedback collection, as this would lead to
+// megamorphic feedback.
+// assertEquals(NaN, phi_float64_holey(1, arr));
+assertEquals(4.25, phi_float64_holey(2, arr));
+assertEquals(2.1, phi_float64_holey(3, arr));
+%OptimizeMaglevOnNextCall(phi_float64_holey);
+assertEquals(3.2, phi_float64_holey(0, arr));
+assertEquals(NaN, phi_float64_holey(1, arr));
+assertEquals(4.25, phi_float64_holey(2, arr));
+assertEquals(2.1, phi_float64_holey(3, arr));
diff --git a/deps/v8/test/mjsunit/maglev/checkmaps-nearjumps.js b/deps/v8/test/mjsunit/maglev/checkmaps-nearjumps.js
new file mode 100644
index 00000000000000..266cdf7be602b7
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/checkmaps-nearjumps.js
@@ -0,0 +1,28 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --maglev --allow-natives-syntax --max-valid-polymorphic-map-count=100
+
+// Test based on regress-crbug-1445286.js; this will generate a lot of maps
+// which are passed to CheckMaps.
+
+const floats = new Float64Array(10);
+function f(proto) {
+  const o = {
+      __proto__: proto,
+  };
+  o.h = 1601;
+  o.name;
+  [v0, ...rest] = floats;
+  return o;
+}
+
+%PrepareFunctionForOptimization(f);
+
+for (let i = 0; i < 100; ++i) {
+  %OptimizeMaglevOnNextCall(f);
+  f();
+  const o = f({});
+  o.h = v0;
+}
diff --git a/deps/v8/test/mjsunit/maglev/literals.js b/deps/v8/test/mjsunit/maglev/literals.js
index 9f795de944820a..138ceeb84ac8b8 100644
--- a/deps/v8/test/mjsunit/maglev/literals.js
+++ b/deps/v8/test/mjsunit/maglev/literals.js
@@ -30,6 +30,7 @@
 
   %PrepareFunctionForOptimization(f);
   f();
+  f();
 
   %OptimizeMaglevOnNextCall(f);
   assertEquals(42, f().a);
@@ -44,6 +45,7 @@
 
   %PrepareFunctionForOptimization(f);
   f();
+  f();
 
   %OptimizeMaglevOnNextCall(f);
   assertEquals(42, f().out.in);
diff --git a/deps/v8/test/mjsunit/maglev/loop-phi-shrinking.js b/deps/v8/test/mjsunit/maglev/loop-phi-shrinking.js
new file mode 100644
index 00000000000000..aaba49fa91376c
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/loop-phi-shrinking.js
@@ -0,0 +1,68 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --maglev
+
+// This is a fairly complex tests that tries to combine the following things:
+//
+//  - compile a function in a garbage-initialized zone (ie, a zone that isn't
+//    initialized with 0s).
+//
+//  - have a loop phi whose input count get reduced (because the graph builder
+//    realizes that one of its predecessor is dead)
+//
+//  - have this loop phi have a Phi as backedge.
+//
+// A bit of context: in an optimization for Phi untagging, I was iterating Phi
+// inputs on RecordUseHint, but I didn't want to visit the backedge if it wasn't
+// bound. To know if it was bound or not, I would set it to nullptr when
+// creating the loop phi, and I could thus check if the last input was nullptr
+// or not. However, this doesn't work when phi inputs get shrunk, as the last
+// input (the backedge) could then contain garbage before it's bound (but this
+// garbage wouldn't be nullptr, so it would look like a regular valid
+// pointer). This didn't show any bug in mjsunit; but this test reproduces the
+// error.
+
+function f(a) {
+  let x = 2;
+  let i = 0;
+  if (a) {
+    x += 14;
+  } else {
+    %DeoptimizeNow();
+    if (a === 0) {
+      // The following addition has no feedback, which will cause Maglev to
+      // replace it with an unconditional deopt, thus removing one of the
+      // predecessors of the while-loop header.
+      x += 25;
+    }
+  }
+  // The following loop has a Phi for `x`, which initially is seen by the graph
+  // builder as having 3 predecessors. And its backedge is a Phi (that's
+  // important). One of its predecessor is removed during graph building because
+  // the `x += 25` is replaced by a Deopt.
+  while (i < 5) {
+    // We now have a Int32 use of `x`. It should be recorded as such, and should
+    // be propagated upwards in the Phi inputs of `x`. However, the backedge
+    // hasn't been bound yet, so we should skip it. Note that the backedge is at
+    // offset 1 rather than 2 because we've reduced the number of predecessors
+    // of `x`.
+    x ^ 2;
+    x = a ? i - 2 : 8;
+    i++;
+  }
+}
+
+%PrepareFunctionForOptimization(f);
+f(1);
+%OptimizeMaglevOnNextCall(f);
+f(1);
+// We now cause `f` to deopt so that it can be re-optimized, ideally using the
+// same zone as before (which is thus not 0-initialized anymore but rather
+// filled with old garbage in release mode, and filled with non-zero invalid
+// pointers in debug mode (something like 0xcdcdcdcdcdcdcdcd).
+f();
+
+%OptimizeMaglevOnNextCall(f);
+f(1);
diff --git a/deps/v8/test/mjsunit/maglev/negate.js b/deps/v8/test/mjsunit/maglev/negate.js
index 6e3c2d61c41e9f..3afd46541a7a1e 100644
--- a/deps/v8/test/mjsunit/maglev/negate.js
+++ b/deps/v8/test/mjsunit/maglev/negate.js
@@ -59,9 +59,21 @@ function test_negate_int32_expect_deopt(value, expected) {
   assertFalse(isMaglevved(negate));
 }
 
+// -0 is not an int32
 test_negate_int32_expect_deopt(0, -0);
 test_negate_int32_expect_deopt(-0, 0);
+
+// -int32_min doesn't fit inside an int32
+assertTrue(-int32_min > int32_max)
 test_negate_int32_expect_deopt(int32_min, -int32_min);
 test_negate_int32_expect_deopt(-int32_min, int32_min);
-test_negate_int32_expect_deopt(int32_max, -int32_max);
-test_negate_int32_expect_deopt(-int32_max, int32_max);
+
+// -int32_max does fit inside an int32, but might not fit inside a Smi
+assertTrue(-int32_max >= int32_min)
+if (%IsSmi(-int32_max)) {
+  test_negate_int32(int32_max, -int32_max);
+  test_negate_int32(-int32_max, int32_max);
+} else {
+  test_negate_int32_expect_deopt(int32_max, -int32_max);
+  test_negate_int32_expect_deopt(-int32_max, int32_max);
+}
diff --git a/deps/v8/test/mjsunit/maglev/omit-default-ctors.js b/deps/v8/test/mjsunit/maglev/omit-default-ctors.js
index e6686ebcf727dc..97788680d24dbe 100644
--- a/deps/v8/test/mjsunit/maglev/omit-default-ctors.js
+++ b/deps/v8/test/mjsunit/maglev/omit-default-ctors.js
@@ -379,8 +379,7 @@
   new D();
   assertEquals(2, fooCallCount);
   assertEquals(1, ctorCallCount);
-  // No deopt (Maglev doesn't depend on the prototype chain not being mutated).
-  assertTrue(isMaglevved(D));
+  assertFalse(isMaglevved(D));
 })();
 
 // The same test as the previous one, but with a ctor with a non-final spread.
@@ -418,8 +417,7 @@
   new D();
   assertEquals(2, fooCallCount);
   assertEquals(1, ctorCallCount);
-  // No deopt (Maglev doesn't depend on the prototype chain not being mutated).
-  assertTrue(isMaglevved(D));
+  assertFalse(isMaglevved(D));
 })();
 
 (function BasePrivateField() {
diff --git a/deps/v8/test/mjsunit/maglev/osr-from-ml-to-tf.js b/deps/v8/test/mjsunit/maglev/osr-from-ml-to-tf.js
index 18c5927c080fad..593c60171e70dd 100644
--- a/deps/v8/test/mjsunit/maglev/osr-from-ml-to-tf.js
+++ b/deps/v8/test/mjsunit/maglev/osr-from-ml-to-tf.js
@@ -8,6 +8,8 @@
 // Disable small-function TF optimization to avoid flakes that unexpectedly
 // tier up `f` before we get a chance to enter the OSR loop.
 // Flags: --max-bytecode-size-for-early-opt=0
+// Flags: --osr-from-maglev --concurrent-osr --concurrent-recompilation
+// Flags: --always-osr-from-maglev
 
 let keep_going = 10000000;  // A counter to avoid test hangs on failure.
 let i;  // The loop counter for the test function.
diff --git a/deps/v8/test/mjsunit/maglev/osr-to-tf.js b/deps/v8/test/mjsunit/maglev/osr-to-tf.js
index 9b8b998ee9b2a2..82ff492623bc87 100644
--- a/deps/v8/test/mjsunit/maglev/osr-to-tf.js
+++ b/deps/v8/test/mjsunit/maglev/osr-to-tf.js
@@ -4,6 +4,9 @@
 //
 // Flags: --allow-natives-syntax --maglev --no-stress-opt
 // Flags: --no-baseline-batch-compilation --use-osr --turbofan
+// Flags: --concurrent-osr --concurrent-recompilation
+// Flags: --osr-from-maglev --concurrent-osr --concurrent-recompilation
+// Flags: --always-osr-from-maglev
 
 let keep_going = 10000000;  // A counter to avoid test hangs on failure.
 
diff --git a/deps/v8/test/mjsunit/maglev/phi-untagging-holeyfloat64.js b/deps/v8/test/mjsunit/maglev/phi-untagging-holeyfloat64.js
new file mode 100644
index 00000000000000..60f9de8531be0c
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/phi-untagging-holeyfloat64.js
@@ -0,0 +1,37 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function f(a, holey_double_arr) {
+  let int32 = a + 1;
+  // Make sure an int32 value can be an input to a holeyfloat64 phi.
+  let holey_float64_phi = a ? int32 : holey_double_arr[0];
+  return holey_float64_phi + 0.5;
+}
+
+%PrepareFunctionForOptimization(f);
+assertEquals(43.5, f(42, [0.5,]));
+assertEquals(1, f(0, [0.5,]));
+%OptimizeMaglevOnNextCall(f);
+assertEquals(43.5, f(42, [0.5,]));
+assertEquals(1, f(0, [0.5,]));
+assertEquals(NaN, f(0, [,0.5]));
+
+
+function g(a, holey_double_arr) {
+  let int32 = a + 1;
+  let int32phi = a ? a + 2 : int32;
+  // Make sure an int32 phi can be an input to a holeyfloat64 phi.
+  let holey_float64_phi = a ? int32phi : holey_double_arr[0];
+  return holey_float64_phi + 0.5;
+}
+
+%PrepareFunctionForOptimization(g);
+assertEquals(44.5, g(42, [0.5,]));
+assertEquals(1, g(0, [0.5,]));
+%OptimizeMaglevOnNextCall(g);
+assertEquals(44.5, g(42, [0.5,]));
+assertEquals(1, g(0, [0.5,]));
+assertEquals(NaN, g(0, [,0.5]));
diff --git a/deps/v8/test/mjsunit/maglev/polymorphic-load-migration.js b/deps/v8/test/mjsunit/maglev/polymorphic-load-migration.js
new file mode 100644
index 00000000000000..07bfb22c6ded81
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/polymorphic-load-migration.js
@@ -0,0 +1,55 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev --no-always-turbofan
+
+function A() { this.x = 1 }
+function B() { this.x = 1 }
+
+const a = new A();
+a.y = 1;
+(new A()).x = 0.1;  // deprecate a
+
+const b = new B();
+b.y = 1;
+(new B()).x = 0.1;  // deprecate b
+
+function load(o) { return o.y }
+
+// Make o.y polymorphic and compile it with maglev. a and b will be deprecated
+// causing migrations in a way that o.y is still at the same offset. This allows
+// maglev to optimize it behind a CheckMapsWithMigration() node.
+
+//   |   a    |   |    |     a     |
+//   |--------|   |    |-----------|
+//   | x: Smi |   |    | x: Double |
+//                |
+//       |       -|->      |
+//       V       -|->      V
+//                |
+//   |   a    |   |    |     a     |
+//   |--------|   |    |-----------|
+//   | x: Smi |   |    | x: Double |
+//   | y: Smi |   |    | y: Smi    |   <-- y did not change.
+
+%PrepareFunctionForOptimization(load);
+load(a);
+load(b);
+
+%OptimizeMaglevOnNextCall(load);
+load(a);
+load(b);
+assertOptimized(load);
+
+// Create a fresh deprecated map, to test the migration path in
+// CheckMapsWithMigration().
+
+function C() { this.x = 1 }
+
+const c = new C();
+c.y = 1;
+(new C()).x = 0.1;  // deprecate c
+
+load(c);
+assertUnoptimized(load);
diff --git a/deps/v8/test/mjsunit/maglev/polymorphic-load.js b/deps/v8/test/mjsunit/maglev/polymorphic-load.js
new file mode 100644
index 00000000000000..3668f1e9422f85
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/polymorphic-load.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function f(value) {
+  return value.x === 'abc';
+}
+
+let o1 = { x : 'abc' };
+let o2 = { y : 'no' };
+
+%PrepareFunctionForOptimization(f);
+f(o1);
+f(o2);
+f(4);
+// The feedback of `f` now contains 2 kNotFound maps (one for `o2`'s map, and
+// one for HeapNumber map).
+
+%OptimizeMaglevOnNextCall(f);
+assertEquals(f(4), false);
+assertOptimized(f);
diff --git a/deps/v8/test/mjsunit/maglev/regress-14197.js b/deps/v8/test/mjsunit/maglev/regress-14197.js
new file mode 100644
index 00000000000000..a84c0299807541
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-14197.js
@@ -0,0 +1,29 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+let ab = new ArrayBuffer(4);
+let dv = new DataView(ab);
+
+const kA = 0x01_80;
+const kB = 0xFF_FF_FF_7F | 0;  // sign-extended 0xFF_7F
+
+// Explicitly write the big-endian int16 representations
+// of these values into the buffer:
+dv.setInt8(0, 0x01, false);
+dv.setInt8(1, 0x80, false);
+dv.setInt8(2, 0xFF, false);
+dv.setInt8(3, 0x7F, false);
+
+function f(dv, index) {
+  return dv.getInt16(index, false);  // big-endian read.
+}
+
+%PrepareFunctionForOptimization(f);
+assertEquals(kA, f(dv, 0));
+assertEquals(kB, f(dv, 2));
+%OptimizeMaglevOnNextCall(f);
+assertEquals(kA, f(dv, 0));
+assertEquals(kB, f(dv, 2));
diff --git a/deps/v8/test/mjsunit/maglev/regress-1427852.js b/deps/v8/test/mjsunit/maglev/regress-1427852.js
new file mode 100644
index 00000000000000..e1497cb5b0cf7b
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1427852.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev --maglev-inlining --jit-fuzzing
+
+function f8() {
+    parseInt("-1024");
+    const v12 = %OptimizeOsr();
+}
+const v14 = new Uint16Array(952);
+const v16 = new Int16Array(v14);
+let v18 = Object;
+%PrepareFunctionForOptimization(f8);
+for (const v23 in v16) {
+    const v24 = `
+        f8(Uint16Array, v18);
+    `;
+    eval(v24);
+}
diff --git a/deps/v8/test/mjsunit/maglev/regress-1443672.js b/deps/v8/test/mjsunit/maglev/regress-1443672.js
new file mode 100644
index 00000000000000..38cf9d9f84c004
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1443672.js
@@ -0,0 +1,15 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --maglev
+
+function test_push(o) {
+  o.push(1);
+}
+
+%PrepareFunctionForOptimization(test_push);
+test_push([{}]);
+%OptimizeMaglevOnNextCall(test_push);
+Object.defineProperty(Array.prototype, 1, {get(){}});
+assertThrows(()=>test_push([{}]));
diff --git a/deps/v8/test/mjsunit/maglev/regress-1447359.js b/deps/v8/test/mjsunit/maglev/regress-1447359.js
new file mode 100644
index 00000000000000..d720b75e5a44ad
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1447359.js
@@ -0,0 +1,15 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --maglev
+
+function f(o) {
+  return o.x + o.x;
+}
+
+%PrepareFunctionForOptimization(f);
+f("a");
+f(1);
+%OptimizeMaglevOnNextCall(f);
+f(1);
diff --git a/deps/v8/test/mjsunit/maglev/regress-1448986.js b/deps/v8/test/mjsunit/maglev/regress-1448986.js
new file mode 100644
index 00000000000000..4e9244c92a8cdf
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1448986.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --maglev
+
+let count = 0;
+Array.prototype[Symbol.iterator] = function () {
+  count++;
+  return {next() { return {done:true} }}
+};
+class c_1 {}
+class c_2 extends c_1 {}
+%PrepareFunctionForOptimization(c_2);
+%OptimizeMaglevOnNextCall(c_2);
+new c_2();
+assertEquals(1, count);
diff --git a/deps/v8/test/mjsunit/maglev/regress-1455185.js b/deps/v8/test/mjsunit/maglev/regress-1455185.js
new file mode 100644
index 00000000000000..da7cf3132fc50d
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1455185.js
@@ -0,0 +1,32 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev --no-turbofan
+
+function foo(should_osr) {
+  const a = [1.1, 1.2, 1.3];
+  a[8] = 4.2;
+  for (let i = 0; i < 2; i++) {
+    let x = a[4];
+    try {
+      if (i > 0) {
+        throw {};
+      }
+      --x;
+      Math.abs();
+    } catch {}
+    if (should_osr) {
+      %OptimizeOsr();
+    }
+    if (x != undefined) {
+      x &= 1;
+    }
+  }
+}
+
+%PrepareFunctionForOptimization(foo);
+foo(false);
+
+// OSR
+foo(true);
diff --git a/deps/v8/test/mjsunit/maglev/regress-1455517.js b/deps/v8/test/mjsunit/maglev/regress-1455517.js
new file mode 100644
index 00000000000000..15422394b7dc5c
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1455517.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function f1() {
+    return 615.5720999180407;
+}
+class C2 extends f1 {
+}
+const v3 = new C2();
+Object.defineProperty(v3, "length", { value: 615.5720999180407 });
+const v5 = ("o").normalize();
+function F7(a9, a10, a11) {
+    if (!new.target) { throw 'must be called with new'; }
+    try { new a10(v3); } catch (e) {}
+    a9.length;
+}
+%PrepareFunctionForOptimization(F7);
+new F7(v5, F7);
+%OptimizeMaglevOnNextCall(F7);
+new F7(v5, F7);
diff --git a/deps/v8/test/mjsunit/maglev/regress-1456853.js b/deps/v8/test/mjsunit/maglev/regress-1456853.js
new file mode 100644
index 00000000000000..886458238c7a25
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1456853.js
@@ -0,0 +1,13 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function foo(str) {
+  return(typeof str === "string");
+}
+%PrepareFunctionForOptimization(foo);
+foo();
+%OptimizeMaglevOnNextCall(foo);
+foo();
diff --git a/deps/v8/test/mjsunit/maglev/regress-1459681.js b/deps/v8/test/mjsunit/maglev/regress-1459681.js
new file mode 100644
index 00000000000000..edee4adf96a201
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1459681.js
@@ -0,0 +1,13 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function foo(x) {
+  return x >> 32; // We should not shift anything here!
+}
+%PrepareFunctionForOptimization(foo);
+assertEquals(42, foo(42));
+%OptimizeMaglevOnNextCall(foo);
+assertEquals(42, foo(42));
diff --git a/deps/v8/test/mjsunit/maglev/regress-1459841.js b/deps/v8/test/mjsunit/maglev/regress-1459841.js
new file mode 100644
index 00000000000000..7e9b24ae71199c
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1459841.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+let a = new Float32Array(1000);
+function foo(i) {
+    return a[i];
+}
+
+%PrepareFunctionForOptimization(foo);
+assertEquals(0, foo(0));
+assertEquals(0, foo(0));
+
+%OptimizeMaglevOnNextCall(foo);
+assertEquals(undefined, foo(0x40000000)); // On 32 bits, this will overflow the array index.
diff --git a/deps/v8/test/mjsunit/maglev/regress-1466928.js b/deps/v8/test/mjsunit/maglev/regress-1466928.js
new file mode 100644
index 00000000000000..a2a51459959ae9
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1466928.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev --single-threaded
+
+for (let v1 = 0; v1 < 1000; v1++) {
+    v1++;
+    function f3() {
+    }
+    class C4 extends f3 {
+        constructor(a6) {
+            return a6;
+        }
+    }
+    try { new C4(v1); } catch (e) {}
+}
diff --git a/deps/v8/test/mjsunit/maglev/regress-1481179.js b/deps/v8/test/mjsunit/maglev/regress-1481179.js
new file mode 100644
index 00000000000000..01cce025399ab2
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-1481179.js
@@ -0,0 +1,20 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev --no-lazy-feedback-allocation
+
+function f(e, i, a) {
+  a[65535] = 42;
+  a.e = a;
+}
+function foo() {
+  const a = [1,2];
+  a.e = 42;
+  a.forEach(f);
+}
+
+%PrepareFunctionForOptimization(foo);
+foo();
+%OptimizeMaglevOnNextCall(foo);
+foo();
diff --git a/deps/v8/test/mjsunit/maglev/regress-4349817-1.js b/deps/v8/test/mjsunit/maglev/regress-4349817-1.js
index bbeb0c230926ee..c9fee028291c68 100644
--- a/deps/v8/test/mjsunit/maglev/regress-4349817-1.js
+++ b/deps/v8/test/mjsunit/maglev/regress-4349817-1.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --allow-natives-syntax --maglev --interrupt-budget-for-maglev=128 --single-threaded --verify-heap
+// Flags: --allow-natives-syntax --maglev --invocation-count-for-maglev=4 --single-threaded --verify-heap
 
 for (let v0 = 0; v0 < 10; v0++) {
     function f1(a2) {
diff --git a/deps/v8/test/mjsunit/maglev/regress-crbug-1445286.js b/deps/v8/test/mjsunit/maglev/regress-crbug-1445286.js
new file mode 100644
index 00000000000000..fc18230be8f38a
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress-crbug-1445286.js
@@ -0,0 +1,28 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+const floats = new Float64Array(10);
+function f(proto) {
+  const o = {
+      __proto__: proto,
+  };
+  o.h = 1601;
+  o.name;
+  [v0, ...rest] = floats;
+  return o;
+}
+
+%PrepareFunctionForOptimization(f);
+
+for (let i = 0; i < 20; ++i) {
+  f();
+  const o = f({});
+  o.h = v0;
+}
+
+%OptimizeMaglevOnNextCall(f);
+
+f();
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-1427809.js b/deps/v8/test/mjsunit/maglev/regress/regress-1427809.js
new file mode 100644
index 00000000000000..5063c66206fee3
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-1427809.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function f0() {
+  try {
+    return Math.pow(129n);
+  } catch(e3) {
+    return 42;
+  }
+}
+%PrepareFunctionForOptimization(f0);
+assertEquals(f0(), 42);
+assertEquals(f0(), 42);
+%OptimizeMaglevOnNextCall(f0);
+assertEquals(f0(), 42);
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-1428764.js b/deps/v8/test/mjsunit/maglev/regress/regress-1428764.js
new file mode 100644
index 00000000000000..f455a2c19e7578
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-1428764.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --maglev --jit-fuzzing
+
+for (let v0 = 0; v0 < 25; v0++) {
+    async function f1() {
+        for (let i7 = 4294967296;
+            i7 < 6;
+            (() => {
+                i7++;
+            })()) {
+            await a4;
+        }
+    }
+    f1();
+}
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-1438990.js b/deps/v8/test/mjsunit/maglev/regress/regress-1438990.js
new file mode 100644
index 00000000000000..7132e58fb8a7c8
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-1438990.js
@@ -0,0 +1,28 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --maglev --allow-natives-syntax
+
+function foo(arr, do_store) {
+  // Load from arr.
+  arr[0];
+
+  if (do_store) {
+    // Store to arr.
+    arr[0] = 0.2;
+
+    arr instanceof foo;
+  }
+}
+
+%PrepareFunctionForOptimization(foo);
+// Initialise the load and store with PACKED_DOUBLE_ELEMENTS feedback.
+foo([0.5], true);
+// Transition just the load to PACKED_ELEMENTS feedback.
+foo([{}], false);
+%OptimizeMaglevOnNextCall(foo);
+// The compilation should succeed here despite `arr instanceof foo` trying to
+// read an impossible map (the load checks for PACKED_ELEMENTS, the store checks
+// for PACKED_DOUBLE_ELEMENTS).
+foo([{}], false);
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-1454478.js b/deps/v8/test/mjsunit/maglev/regress/regress-1454478.js
new file mode 100644
index 00000000000000..23b2754c672ae6
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-1454478.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function Class(a1, a2) {
+  return a1 === a2;
+}
+function foo(x) {
+  const instance = new Class(x, x + 1);
+  if (instance) {
+  } else {
+    fail("ToBoolean of instance should not be false, even though the constructor returns false.")
+  }
+}
+
+%PrepareFunctionForOptimization(Class);
+%PrepareFunctionForOptimization(foo);
+foo(0);
+foo(0);
+%OptimizeMaglevOnNextCall(foo);
+foo(0);
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-1455289.js b/deps/v8/test/mjsunit/maglev/regress/regress-1455289.js
new file mode 100644
index 00000000000000..bb3bc14013b5e7
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-1455289.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function foo(i) {
+  i++;
+  try {
+    [].forEach(i);
+  } catch (e) {
+    return 42;
+  }
+}
+
+%PrepareFunctionForOptimization(foo);
+print(42, foo(0));
+print(42, foo(0));
+%OptimizeMaglevOnNextCall(foo);
+print(42, foo(0));
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-1455295.js b/deps/v8/test/mjsunit/maglev/regress/regress-1455295.js
new file mode 100644
index 00000000000000..9791db3bd1611e
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-1455295.js
@@ -0,0 +1,26 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function foo() {
+  let caught = 0;
+  try {
+    [].forEach(undefined);
+  } catch (e) {
+    caught += 2;
+  }
+  try {
+    [].forEach(undefined);
+  } catch (e) {
+    caught += 40;
+  }
+  return caught;
+}
+
+%PrepareFunctionForOptimization(foo);
+print(42, foo());
+print(42, foo());
+%OptimizeMaglevOnNextCall(foo);
+print(42, foo());
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-1455550.js b/deps/v8/test/mjsunit/maglev/regress/regress-1455550.js
new file mode 100644
index 00000000000000..95eeb6a0350e60
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-1455550.js
@@ -0,0 +1,33 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+var o = { "foo": 42, "bar": 32 };
+
+function foo(o, k, do_lookup) {
+  if (do_lookup)
+    return o[k];
+}
+
+%PrepareFunctionForOptimization(foo);
+// Warm up the keyed load feedback in foo as always loading the name "foo".
+assertEquals(42, foo(o, "foo", true));
+assertEquals(42, foo(o, "foo", true));
+
+function bar(o, do_lookup) {
+  // Bar does a lookup with "bar" on the object, using foo.
+  return foo(o, "bar", do_lookup);
+}
+%PrepareFunctionForOptimization(bar);
+// Warm up bar as never having done the lookup, so that the named feedback in
+// foo stays "foo".
+assertEquals(undefined, bar(o, false));
+assertEquals(undefined, bar(o, false));
+
+// This optimization should not be confused by the potential mismatch between
+// the "foo" named feedback in foo, and the "bar" constant string in bar.
+%OptimizeMaglevOnNextCall(bar);
+assertEquals(undefined, bar(o, false));
+assertEquals(32, bar(o, true));
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1428464.js b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1428464.js
new file mode 100644
index 00000000000000..ea0ac3c7d96beb
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1428464.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --maglev --allow-natives-syntax --maglev-untagged-phis
+
+function f(a) {
+  let heap_number = 2000000000;
+  let phi = a ? 42 : heap_number;
+  let float64_use = phi + 1.5;
+  let truncated_int32_use = phi ^ 25;
+}
+
+%PrepareFunctionForOptimization(f);
+f(0);
+%OptimizeMaglevOnNextCall(f);
+f(1);
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1428524.js b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1428524.js
new file mode 100644
index 00000000000000..b13151068a0a9f
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1428524.js
@@ -0,0 +1,26 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --maglev --allow-natives-syntax --maglev-untagged-phis
+
+function f(a) {
+  let int32 = a + 1;
+
+  let int32_phi = a ? int32 : 42;
+  let int32_use = int32_phi + 1;
+
+  // {float64_phi} has a Int32 inputs and a Float64 use, we should thus generate
+  // a Float64 phi for it. One of its input is {int32_phi}, which should have
+  // been untagged as Int32, and for which we should thus require a
+  // Int32ToFloat64 conversion.
+  let float64_phi = a ? int32_phi : int32;
+  let float64_use = float64_phi + 4.5;
+
+  return float64_use;
+}
+
+%PrepareFunctionForOptimization(f);
+f(1);
+%OptimizeMaglevOnNextCall(f);
+f(1);
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1429753.js b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1429753.js
new file mode 100644
index 00000000000000..56c56135adeaf4
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1429753.js
@@ -0,0 +1,12 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --maglev --allow-natives-syntax --noenable-lazy-source-positions
+
+function f1() {
+    (true ? typeof~0 === "bigint" : 0) && 0;
+}
+%PrepareFunctionForOptimization(f1);
+%OptimizeMaglevOnNextCall(f1);
+f1();
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1429810.js b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1429810.js
new file mode 100644
index 00000000000000..77138663318efc
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1429810.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --maglev --allow-natives-syntax --maglev-untagged-phis
+
+function f(a) {
+  let phi = a ? 0.5 : 1.5;
+  let truncated_int32_use = phi ^ 2;
+  let float64_use = phi + 2.5;
+}
+
+%PrepareFunctionForOptimization(f);
+f(1);
+%OptimizeMaglevOnNextCall(f);
+f(1);
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1433505.js b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1433505.js
new file mode 100644
index 00000000000000..b415b5cfceb9d9
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1433505.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --maglev --allow-natives-syntax
+
+function f() {
+    const v9 = -Infinity && -27872;
+    +v9;
+    v9 % v9;
+}
+
+%PrepareFunctionForOptimization(f);
+f();
+%OptimizeMaglevOnNextCall(f);
+f();
diff --git a/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1465326.js b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1465326.js
new file mode 100644
index 00000000000000..6e01c1ec0262cb
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/regress/regress-crbug-1465326.js
@@ -0,0 +1,25 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --maglev --allow-natives-syntax
+
+class A {}
+
+var x = Function;
+
+class B extends A {
+  constructor() {
+    x = new.target;
+    super();
+  }
+}
+function construct() {
+  return Reflect.construct(B, [], Function);
+}
+%PrepareFunctionForOptimization(B);
+construct();
+construct();
+%OptimizeMaglevOnNextCall(B);
+var arr = construct();
+console.log(arr.prototype);
diff --git a/deps/v8/test/mjsunit/maglev/string-constructor.js b/deps/v8/test/mjsunit/maglev/string-constructor.js
new file mode 100644
index 00000000000000..b11f6946e58e9d
--- /dev/null
+++ b/deps/v8/test/mjsunit/maglev/string-constructor.js
@@ -0,0 +1,18 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function f(o, y) {
+  return String(o);
+}
+
+%PrepareFunctionForOptimization(f);
+%OptimizeMaglevOnNextCall(f);
+assertEquals("1", f(1));
+assertEquals("undefined", f(undefined));
+assertEquals("null", f(null));
+assertEquals("bla", f("bla"));
+assertEquals("[object Object]", f({}));
+assertEquals("Symbol(bla)", f(Symbol('bla')))
diff --git a/deps/v8/test/mjsunit/messages.js b/deps/v8/test/mjsunit/messages.js
index 49b31d75c4a70e..7092e1569aee00 100644
--- a/deps/v8/test/mjsunit/messages.js
+++ b/deps/v8/test/mjsunit/messages.js
@@ -60,7 +60,7 @@ test(function() {
 // kCalledNonCallable
 test(function() {
   [].forEach(1);
-}, "1 is not a function", TypeError);
+}, "number 1 is not a function", TypeError);
 
 // kCalledOnNonObject
 test(function() {
@@ -477,71 +477,83 @@ test(function() {
 // kJsonParseUnterminatedString
 test(function() {
   JSON.parse('{"a" : "}')
-}, "Unterminated string in JSON at position 9", SyntaxError);
+}, "Unterminated string in JSON at position 9 (line 1 column 10)", SyntaxError);
 
 // kJsonParseExpectedPropNameOrRBrace
 test(function() {
   JSON.parse("{")
-}, "Expected property name or '}' in JSON at position 1", SyntaxError);
+}, "Expected property name or '}' in JSON at position 1 (line 1 column 2)",
+  SyntaxError);
 
 // kJsonParseExpectedDoubleQuotedPropertyName
 test(function() {
   JSON.parse('{"foo" : 1, }');
-}, "Expected double-quoted property name in JSON at position 12", SyntaxError);
+}, "Expected double-quoted property name in JSON at position 12 (line 1 column 13)",
+  SyntaxError);
 
 // kJsonParseExpectedCommaNameOrRBrack
 test(function() {
   JSON.parse("{'foo': 1}");
-}, "Expected property name or '}' in JSON at position 1", SyntaxError);
+}, "Expected property name or '}' in JSON at position 1 (line 1 column 2)",
+  SyntaxError);
 
 // kJsonParseExpectedCommaNameOrRBrace
 test(function() {
   JSON.parse('[1, 2, 3, 4');
-}, "Expected ',' or ']' after array element in JSON at position 11", SyntaxError);
+}, "Expected ',' or ']' after array element in JSON " +
+"at position 11 (line 1 column 12)", SyntaxError);
 
 test(function() {
   JSON.parse('[1, 2, 3, 4g');
-}, "Expected ',' or ']' after array element in JSON at position 11", SyntaxError);
+}, "Expected ',' or ']' after array element in JSON " +
+"at position 11 (line 1 column 12)", SyntaxError);
 
 // kJsonParseExponentPartMissingNumber
 test(function() {
   JSON.parse('[1e]');
-}, "Exponent part is missing a number in JSON at position 3", SyntaxError);
+}, "Exponent part is missing a number in JSON at position 3 (line 1 column 4)",
+  SyntaxError);
 
 // kJsonParseExpectedColonAfterPropertyName
 test(function() {
   JSON.parse('{"a"}');
-}, "Expected ':' after property name in JSON at position 4", SyntaxError);
+}, "Expected ':' after property name in JSON at position 4 (line 1 column 5)",
+  SyntaxError);
 
 // kJsonParseUnterminatedFractionNumber
 test(function() {
   JSON.parse('{"a": 0.bs}');
-}, "Unterminated fractional number in JSON at position 8", SyntaxError);
+}, "Unterminated fractional number in JSON at position 8 (line 1 column 9)",
+  SyntaxError);
 
 // kJsonParseUnexpectedNonWhiteSpaceCharacter
 test(function() {
   JSON.parse('{"a": 3}a');
-}, "Unexpected non-whitespace character after JSON at position 8", SyntaxError);
+}, "Unexpected non-whitespace character after JSON " +
+"at position 8 (line 1 column 9)", SyntaxError);
 
 // kJsonParseBadEscapedCharacter
 test(function() {
   JSON.parse('{"b" : "\\a"}');
-}, "Bad escaped character in JSON at position 9", SyntaxError);
+}, "Bad escaped character in JSON at position 9 (line 1 column 10)",
+  SyntaxError);
 
 // kJsonParseBadControlCharacter
 test(function() {
   JSON.parse('"a\bz"');
-}, "Bad control character in string literal in JSON at position 2", SyntaxError);
+}, "Bad control character in string literal in JSON " +
+"at position 2 (line 1 column 3)", SyntaxError);
 
 // kJsonParseBadUnicodeEscape
 test(function() {
   JSON.parse("[\"\\t\\u");
-}, "Bad Unicode escape in JSON at position 6", SyntaxError);
+}, "Bad Unicode escape in JSON at position 6 (line 1 column 7)", SyntaxError);
 
 // kJsonParseNoNumberAfterMinusSign
 test(function() {
   JSON.parse('-');
-}, "No number after minus sign in JSON at position 1", SyntaxError);
+}, "No number after minus sign in JSON at position 1 (line 1 column 2)",
+  SyntaxError);
 
 // kJsonParseUnexpectedTokenShortString
 test(function () {
@@ -576,12 +588,14 @@ test(function () {
 // kJsonParseExpectedPropNameOrRBrace
 test(function() {
   JSON.parse("{ 1")
-}, "Expected property name or '}' in JSON at position 2", SyntaxError);
+}, "Expected property name or '}' in JSON at position 2 (line 1 column 3)",
+  SyntaxError);
 
 // kJsonParseUnexpectedNonWhiteSpaceCharacter
 test(function() {
   JSON.parse('"""')
-}, "Unexpected non-whitespace character after JSON at position 2", SyntaxError);
+}, "Unexpected non-whitespace character after JSON " +
+"at position 2 (line 1 column 3)", SyntaxError);
 
 // kJsonParseUnexpectedTokenStringShortString
 test(function() {
diff --git a/deps/v8/test/mjsunit/mjsunit.js b/deps/v8/test/mjsunit/mjsunit.js
index c1a1359f7edae2..762b8edfa6b556 100644
--- a/deps/v8/test/mjsunit/mjsunit.js
+++ b/deps/v8/test/mjsunit/mjsunit.js
@@ -174,7 +174,6 @@ var assertMatches;
 var assertPromiseResult;
 
 var promiseTestChain;
-var promiseTestCount = 0;
 
 // These bits must be in sync with bits defined in Runtime_GetOptimizationStatus
 var V8OptimizationStatus = {
@@ -225,6 +224,12 @@ var isUnoptimized;
 // Returns true if given function is optimized.
 var isOptimized;
 
+// Returns true if given function will be compiled by Maglev.
+var willBeMaglevved;
+
+// Returns true if given function will be compiled by TurboFan.
+var willBeTurbofanned;
+
 // Returns true if given function is compiled by Maglev.
 var isMaglevved;
 
@@ -326,14 +331,17 @@ var prettyPrinted;
                     });
                 var joined = ArrayPrototypeJoin.call(mapped, ",");
                 return "[" + joined + "]";
-              case "Uint8Array":
               case "Int8Array":
+              case "Uint8Array":
+              case "Uint8ClampedArray":
               case "Int16Array":
               case "Uint16Array":
-              case "Uint32Array":
               case "Int32Array":
+              case "Uint32Array":
               case "Float32Array":
               case "Float64Array":
+              case "BigInt64Array":
+              case "BigUint64Array":
                 var joined = ArrayPrototypeJoin.call(value, ",");
                 return objectClass + "([" + joined + "])";
               case "Object":
@@ -407,7 +415,6 @@ var prettyPrinted;
     return true;
   }
 
-
   deepEquals = function deepEquals(a, b) {
     if (a === b) {
       // Check for -0.
@@ -415,33 +422,53 @@ var prettyPrinted;
       return true;
     }
     if (typeof a !== typeof b) return false;
-    if (typeof a === "number") return isNaN(a) && isNaN(b);
-    if (typeof a !== "object" && typeof a !== "function") return false;
+    if (typeof a === 'number') return isNaN(a) && isNaN(b);
+    if (typeof a !== 'object' && typeof a !== 'function') return false;
     // Neither a nor b is primitive.
     var objectClass = classOf(a);
     if (objectClass !== classOf(b)) return false;
-    if (objectClass === "RegExp") {
-      // For RegExp, just compare pattern and flags using its toString.
-      return RegExpPrototypeToString.call(a) ===
-             RegExpPrototypeToString.call(b);
-    }
-    // Functions are only identical to themselves.
-    if (objectClass === "Function") return false;
-    if (objectClass === "Array") {
-      var elementCount = 0;
-      if (a.length !== b.length) {
+    switch (objectClass) {
+      case 'RegExp':
+        // For RegExp, just compare pattern and flags using its toString.
+        return RegExpPrototypeToString.call(a) ===
+            RegExpPrototypeToString.call(b);
+      case 'Function':
+        // Functions are only identical to themselves.
         return false;
-      }
-      for (var i = 0; i < a.length; i++) {
-        if ((i in a) !== (i in b)) return false;
-        if (!deepEquals(a[i], b[i])) return false;
-      }
-      return true;
-    }
-    if (objectClass === "String" || objectClass === "Number" ||
-      objectClass === "BigInt" || objectClass === "Boolean" ||
-      objectClass === "Date") {
-      if (ValueOf(a) !== ValueOf(b)) return false;
+      case 'Array':
+        if (a.length !== b.length) return false;
+        for (var i = 0; i < a.length; i++) {
+          if ((i in a) !== (i in b)) return false;
+          if (!deepEquals(a[i], b[i])) return false;
+        }
+        return true;
+      case 'Int8Array':
+      case 'Uint8Array':
+      case 'Uint8ClampedArray':
+      case 'Int16Array':
+      case 'Uint16Array':
+      case 'Int32Array':
+      case 'Uint32Array':
+      case 'BigInt64Array':
+      case 'BigUint64Array':
+        if (a.length !== b.length) return false;
+        for (let i = 0; i < a.length; i++) {
+          if (a[i] !== b[i]) return false;
+        }
+        return true;
+      case 'Float32Array':
+      case 'Float64Array':
+        if (a.length !== b.length) return false;
+        for (let i = 0; i < a.length; i++) {
+          if (!deepEquals(a[i], b[i])) return false;
+        }
+        return true;
+      case 'String':
+      case 'Number':
+      case 'BigInt':
+      case 'Boolean':
+      case 'Date':
+        return ValueOf(a) === ValueOf(b);
     }
     return deepObjectEquals(a, b);
   }
@@ -689,7 +716,6 @@ var prettyPrinted;
     var test_promise = promise.then(
         result => {
           try {
-            if (--promiseTestCount == 0) testRunner.notifyDone();
             if (success !== undefined) success(result);
           } catch (e) {
             // Use setTimeout to throw the error again to get out of the promise
@@ -701,7 +727,6 @@ var prettyPrinted;
         },
         result => {
           try {
-            if (--promiseTestCount == 0) testRunner.notifyDone();
             if (fail === undefined) throw result;
             fail(result);
           } catch (e) {
@@ -714,9 +739,6 @@ var prettyPrinted;
         });
 
     if (!promiseTestChain) promiseTestChain = Promise.resolve();
-    // waitUntilDone is idempotent.
-    testRunner.waitUntilDone();
-    ++promiseTestCount;
     return promiseTestChain.then(test_promise);
   };
 
@@ -849,6 +871,20 @@ var prettyPrinted;
            (opt_status & V8OptimizationStatus.kMaglevved) !== 0;
   }
 
+  willBeMaglevved = function willBeMaglevved(fun) {
+    var opt_status = OptimizationStatus(fun, "");
+    assertTrue((opt_status & V8OptimizationStatus.kIsFunction) !== 0,
+               "not a function");
+    return (opt_status & V8OptimizationStatus.kOptimizeOnNextCallOptimizesToMaglev) !== 0;
+  }
+
+  willBeTurbofanned = function willBeTurbofanned(fun) {
+    var opt_status = OptimizationStatus(fun, "");
+    assertTrue((opt_status & V8OptimizationStatus.kIsFunction) !== 0,
+               "not a function");
+    return (opt_status & V8OptimizationStatus.kOptimizeOnNextCallOptimizesToMaglev) === 0;
+  }
+
   isTurboFanned = function isTurboFanned(fun) {
     var opt_status = OptimizationStatus(fun, "");
     assertTrue((opt_status & V8OptimizationStatus.kIsFunction) !== 0,
diff --git a/deps/v8/test/mjsunit/mjsunit.status b/deps/v8/test/mjsunit/mjsunit.status
index 998d9671c4da18..eb121cd4ff498c 100644
--- a/deps/v8/test/mjsunit/mjsunit.status
+++ b/deps/v8/test/mjsunit/mjsunit.status
@@ -40,6 +40,8 @@
   'compiler/fast-api-helpers': [SKIP],
   'typedarray-helpers': [SKIP],
 
+  # TODO(ahaas): Fix generic wasm-to-js wrapper tierup test.
+  'wasm/wasm-to-js-tierup': [SKIP],
   # All tests in the bug directory are expected to fail.
   'bugs/*': [FAIL],
 
@@ -106,7 +108,10 @@
 
   ##############################################################################
   # Tests verifying CHECK and ASSERT.
-  'verify-check-false': [FAIL, NO_VARIANTS],
+  #
+  # With the official_build flag CHECK failures can't be distinguished from
+  # CRASH. See cctest.status for details (v8:13945).
+  'verify-check-false': [FAIL, NO_VARIANTS, ['official_build', CRASH]],
   'verify-assert-false': [NO_VARIANTS, ['mode == release and dcheck_always_on == False', PASS], ['mode == debug', FAIL]],
 
   ##############################################################################
@@ -137,7 +142,7 @@
   'math-floor-of-div': [PASS, SLOW],
   'md5': [PASS, SLOW],
   'readonly': [PASS, SLOW],
-  'regress-1417125': [PASS, SLOW],
+  'regress-1417125': [PASS, SLOW, ['mode != release or arch != x64', SKIP]],
   'regress/regress-1122': [PASS, SLOW],
   'regress/regress-605470': [PASS, SLOW],
   'regress/regress-655573': [PASS, SLOW],
@@ -153,10 +158,11 @@
   'wasm/unreachable-validation': [PASS, SLOW],
   'wasm/atomics-stress': [PASS, SLOW, NO_VARIANTS, ['mode != release or dcheck_always_on', SKIP], ['tsan', SKIP]],
   'wasm/atomics64-stress': [PASS, SLOW, NO_VARIANTS, ['mode != release or dcheck_always_on', SKIP], ['tsan', SKIP]],
+  'wasm/atomics-memory64': [PASS, SLOW, NO_VARIANTS, ['mode != release or dcheck_always_on', SKIP], ['tsan', SKIP]],
   'wasm/compare-exchange-stress': [PASS, SLOW, NO_VARIANTS],
   'wasm/compare-exchange64-stress': [PASS, SLOW, NO_VARIANTS],
   'wasm/code-space-overflow': [PASS, SLOW, NO_VARIANTS, ['gc_stress == True or (simulator_run and mode == debug)', SKIP]],
-  'wasm/max-wasm-functions': [PASS, SLOW, ['mode != release or dcheck_always_on or simulator_run or predictable', SKIP], ['tsan', SKIP]],
+  'wasm/max-wasm-functions': [PASS, SLOW, ['mode != release or dcheck_always_on or simulator_run or verify_predictable', SKIP], ['tsan', SKIP]],
 
   # Very slow on ARM, MIPS, RISCV and LOONG, contains no architecture dependent code.
   'unicode-case-overoptimization0': [PASS, NO_VARIANTS, ['arch in (arm, arm64, mips64el, mips64, riscv64, riscv32, loong64)', SKIP]],
@@ -175,11 +181,11 @@
 
   # OOM with too many isolates/memory objects (https://crbug.com/1010272)
   # Predictable tests fail due to race between postMessage and GrowMemory
-  'regress/wasm/regress-1010272': [PASS, HEAVY, NO_VARIANTS, ['system == android', SKIP], ['predictable', SKIP]],
+  'regress/wasm/regress-1010272': [PASS, HEAVY, NO_VARIANTS, ['system == android', SKIP], ['verify_predictable', SKIP]],
 
-  # Only makes sense in the no_i18n variant.
+  # Only makes sense without i18n.
   'es6/unicode-regexp-ignore-case-noi18n':
-      [['no_i18n == True', PASS], ['no_i18n == False', FAIL]],
+      [['not i18n', PASS], ['i18n', FAIL]],
 
   # Needs to be adapted after changes to Function constructor. chromium:1065094
   'cross-realm-filtering': [SKIP],
@@ -274,8 +280,8 @@
 }],  # novfp3
 
 ##############################################################################
-# TODO(ahaas): Port multiple return values to MIPS, S390 and PPC
-['arch in (mips64, mips64el, s390, s390x, ppc, ppc64)', {
+# TODO(ahaas): Port multiple return values to MIPS.
+['arch in (mips64, mips64el)', {
   'wasm/multi-value': [SKIP],
 }],
 
@@ -288,6 +294,7 @@
   'regress/wasm/regress-1010272': [SKIP],
   'wasm/atomics-stress': [SKIP],
   'wasm/atomics64-stress': [SKIP],
+  'wasm/atomics-memory64': [SKIP],
 }],  # simulator_run
 
 ##############################################################################
@@ -356,6 +363,8 @@
   # Slow tests.
   'array-constructor': [PASS, SLOW],
   'json': [PASS, SLOW],
+  'regress/asm/regress-775710': [PASS, SLOW],
+  'regress/regress-crbug-820312': [PASS, SLOW],
 
   # BUG(v8:4779): Crashes flakily with stress mode on arm64.
   'array-splice': [PASS, SLOW, ['arch == arm64', NO_VARIANTS]],
@@ -384,6 +393,9 @@
 
   # https://crbug.com/v8/13461
   'maglev/inner-function': [SKIP],
+
+  # https://crbug.com/v8/13916
+  'readonly': [SKIP],
 }],  # 'gc_stress'
 
 ##############################################################################
@@ -440,10 +452,10 @@
 }],  # not has_webassembly or variant == jitless
 
 ##############################################################################
-['jitless_build_mode', {
+['has_jitless', {
   # invocation_count maintenance is disabled.
   'code-coverage*': [SKIP],
-}],  # jitless_build_mode
+}],  # has_jitless
 
 ##############################################################################
 ['lite_mode or variant == jitless', {
@@ -485,7 +497,7 @@
 }],  # 'lite_mode or variant == jitless'
 
 ##############################################################################
-['no_i18n', {
+['not i18n', {
   # Case-insensitive unicode regexp relies on case mapping provided by ICU.
   'es6/unicode-regexp-ignore-case': [FAIL],
   'es7/regexp-ui-word': [FAIL],
@@ -496,6 +508,7 @@
   'harmony/regexp-property-*': [PASS,FAIL],
   'regress/regress-1262423': [PASS,FAIL],
   'regress/regress-793588': [PASS,FAIL],
+  'regress/regress-crbug-1437346': [PASS,FAIL],
 
   # RegExp unicode tests relies on ICU for property classes and
   # case-insensitive unicode patterns.
@@ -515,31 +528,35 @@
   'tzoffset-transition-new-york': [PASS,FAIL],
   'tzoffset-seoul': [PASS,FAIL],
 
-  # noi18n is required for Intl
+  # i18n is required for Intl
   'regress/regress-crbug-1052647': [PASS,FAIL],
   'regress/regress-1409058': [SKIP],
+  'regress/regress-1447383': [SKIP],
 
-  # Temporal intl tests won't work in no_i18n
+  # Temporal intl tests won't work without i18n
   'temporal/function-exist': [FAIL],
   'temporal/plain-date-get-era': [FAIL],
   'temporal/plain-date-get-eraYear': [FAIL],
   'temporal/plain-date-time-get-era': [FAIL],
   'temporal/plain-date-time-get-eraYear': [FAIL],
 
-  # Non-BMP characters currently aren't considered identifiers in no_i18n
+  # Non-BMP characters currently aren't considered identifiers without i18n
   'harmony/private-name-surrogate-pair': [PASS,FAIL],
 
   # Tests ICU-specific behavior.
   'regress/regress-crbug-1414292': [SKIP],
-}],  # 'no_i18n'
+}],  # 'not i18n'
 
 ##############################################################################
-['is_full_debug', {
+['full_debug', {
   # Tests too slow in non-optimized debug mode.
+  'es6/super-ic': [SKIP],
+  'regress/regress-1122': [SKIP],
   'regress/regress-2790': [SKIP],
   'regress/regress-740784': [SKIP],
   'regress/regress-992389': [SKIP],
-}],  # 'is_full_debug'
+  'wasm/shared-memory-worker-gc': [SKIP],
+}],  # 'full_debug'
 
 ##############################################################################
 ['byteorder == big', {
@@ -561,6 +578,12 @@
   'wasm/bigint-opt': [SKIP],
   'wasm/simd-lane-memory64': [SKIP],
   'regress/regress-1320641': [SKIP],
+
+  # Needs a huge Uint8Array.
+  'regress/regress-1432470': [SKIP],
+
+  # Needs 64-bit number register support
+  'compiler/fast-api-calls-64-bit-integer-values': [SKIP],
 }],  # 'arch in (ia32, arm, riscv32)'
 
 ##############################################################################
@@ -592,9 +615,6 @@
   # BUG(v8:3457).
   'deserialize-reference': [PASS, FAIL],
 
-  # BUG(v8:4016)
-  'regress/regress-crbug-467047': [SKIP],
-
   # OOMing tests
   'regress/regress-500980': [SKIP],
 
@@ -928,7 +948,7 @@
   # This often fails in debug mode because it is too slow
   'd8/d8-performance-now': [PASS, ['mode == debug', SKIP]],
 
-  # SIMD not be implemented
+  # SIMD is not implemented
   'regress/wasm/regress-1054466': [SKIP],
   'regress/wasm/regress-1065599': [SKIP],
   'regress/wasm/regress-1070078': [SKIP],
@@ -958,6 +978,8 @@
 
 [ 'arch == riscv32' , {
 'wasm/compare-exchange64-stress':[SKIP],
+'regress/regress-crbug-781583':[SKIP],
+'regress/wasm/regress-14171':[SKIP],
 }], # 'arch == riscv32'
 
 ##############################################################################
@@ -1044,6 +1066,7 @@
   'wasm/code-flushing': [SKIP],
   'wasm/enter-and-leave-debug-state': [SKIP],
   'wasm/wasm-dynamic-tiering': [SKIP],
+  'wasm/wasm-to-js-tierup': [SKIP],
 
   # The test relies on precise switching of code kinds of wasm functions. With
   # multiple isolates that share the wasm functions, the precise switching is
@@ -1144,6 +1167,9 @@
 
   # BUG(v8:11826) Skipped until we remove flakes on NumFuzz.
   'regress/wasm/regress-1231950': [SKIP],
+
+  # BUG(v8:13433)
+  'compiler/array-slice-clone': [SKIP],
 }],  # 'gc_fuzzer'
 
 ##############################################################################
@@ -1189,6 +1215,10 @@
   'compiler/js-create-arguments': [SKIP],
   'compiler/js-create': [SKIP],
   'compiler/construct-bound-function': [SKIP],
+
+  # BUG(v8:13882) Skipped until we have a solution.
+  'compiler/osr-literals': [SKIP],
+  'compiler/osr-literals-adapted': [SKIP],
 }], # gc_fuzzer or deopt_fuzzer or interrupt_fuzzer
 
 ##############################################################################
@@ -1210,7 +1240,7 @@
 }],  # 'endurance_fuzzer'
 
 ##############################################################################
-['predictable == True', {
+['verify_predictable', {
 
   # Skip tests that are known to be non-deterministic.
   'd8/d8-worker-sharedarraybuffer': [SKIP],
@@ -1227,8 +1257,10 @@
   'd8/enable-tracing': [SKIP],
 
   # Intentionally non-deterministic using shared arraybuffers between workers.
+  'wasm/atomic-wait-multi-memory': [SKIP],
   'wasm/atomics-stress': [SKIP],
   'wasm/atomics64-stress': [SKIP],
+  'wasm/atomics-memory64': [SKIP],
   'wasm/futex': [SKIP],
   'regress/regress-1205290': [SKIP],
   'regress/regress-1212404': [SKIP],
@@ -1241,17 +1273,27 @@
   # BUG(v8:9975).
   'es6/typedarray-copywithin': [SKIP],
 
-  # BUG(v8:11858): Deadlocks in predictable mode when waiting for the native
-  # module cache entry to be completed.
+  # BUG(v8:11858): Deadlocks in verify_predictable mode when waiting for the
+  # native module cache entry to be completed.
   'regress/wasm/regress-709684': [SKIP],
 
+  # The test triggers profiling, which can trigger non-deterministic
+  # allocations.
+  'regress/regress-1394663': [SKIP],
+
   # BUG(v8:12605): flaky test.
   'wasm/grow-shared-memory': [SKIP],
 
   # BUG(v8:13234)
   'wasm/shared-memory-worker-gc-stress': [SKIP],
   'object-literal': [SKIP],
-}],  # 'predictable == True'
+
+  # Slow tests.
+  'wasm/serialization-with-compilation-hints': [SKIP],
+
+  # https://crbug.com/v8/14228
+  'asm/poppler/poppler': [SKIP],
+}],  # 'verify_predictable'
 
 ##############################################################################
 ['simulator_run and (arch in [ppc64, s390x])', {
@@ -1262,6 +1304,7 @@
   'regress/regress-crbug-482998': [SKIP],
   'regress/regress-91008': [PASS, SLOW],
   'regress/regress-779407': [PASS, SLOW],
+  'regress/regress-1449567': [PASS, SLOW],
   'harmony/regexp-property-lu-ui': [PASS, SLOW],
   'whitespaces': [PASS, SLOW],
   'generated-transition-stub': [PASS, SLOW],
@@ -1334,14 +1377,23 @@
   # Baseline tests don't make sense with optimization stressing.
   'baseline/*': [SKIP],
 
-  # This test uses --wasm-speculative-inlining which is incompatible with
-  # stressing.
-  'regress/wasm/regress-1364036': [SKIP],
-
   # Makes assumptions about tiering, which don't hold when we TF everything.
   'wasm/enter-and-leave-debug-state': [SKIP],
+
+  # Slow TF compilation.
+  'wasm/large-struct': [SKIP],
 }],  # variant == stress
 
+##############################################################################
+['variant == turboshaft', {
+  # TODO(v8:14108): These tests require Liftoff. Enable again when we remove
+  # --no-liftoff from this variant.
+  'wasm/code-flushing': [FAIL],
+  'wasm/enter-and-leave-debug-state': [FAIL],
+  # Slow TF compilation.
+  'wasm/large-struct': [SKIP],
+}],  # variant == turboshaft
+
 ##############################################################################
 ['variant == stress and (arch == arm or arch == arm64) and simulator_run', {
   # Slow tests: https://crbug.com/v8/7783
@@ -1354,7 +1406,10 @@
 ['variant in (nooptimization, jitless) and arch in (arm, arm64) and simulator_run', {
   # Slow tests: https://crbug.com/v8/7783
   'regress/regress-crbug-319860': [SKIP],
-}],  # variant == nooptimization and (arch == arm or arch == arm64) and simulator_run
+
+  # Other slow tests:
+  'regress/regress-1449567': [SKIP],
+}],  # variant in (nooptimization, jitless) and (arch == arm or arch == arm64) and simulator_run
 
 ##############################################################################
 ['variant == nooptimization', {
@@ -1489,6 +1544,7 @@
   'regress/regress-441099': [SKIP],
   'regress/regress-677685': [SKIP],
   'regress/regress-799690': [SKIP],
+  'regress/regress-1469634': [SKIP],
   'regress/regress-crbug-935800': [SKIP],
   'regress/wasm/*': [SKIP],
   'wasm/*': [SKIP],
@@ -1535,13 +1591,13 @@
   'harmony/array-to-spliced-big': [SKIP],
 }],  # variant == slow_path
 
-['((arch == mips64el or arch == mips64) and not simd_mips) or (arch in [ppc64])', {
+['(arch == mips64el or arch == mips64) and not simd_mips', {
   # Requires scalar lowering for 64x2 SIMD instructions, which are not
   # implemented yet.
   # Also skip tests on archs that don't support SIMD and lowering doesn't yet work correctly.
   # Condition copied from cctest.status.
   'regress/wasm/regress-10831': [SKIP],
-}],  # ((arch == mips64el or arch == mips64) and not simd_mips) or (arch in [ppc64])
+}],  # (arch == mips64el or arch == mips64) and not simd_mips
 
 ##############################################################################
 ['variant == stress_sampling', {
@@ -1556,6 +1612,8 @@
 ##############################################################################
 ['variant == stress_incremental_marking', {
   'wasm/shared-memory-worker-stress': [PASS, SLOW, ['tsan', SKIP]],
+  'regress/regress-740784': [PASS, ['tsan', SKIP]],
+  'regress/regress-crbug-820312': [PASS, SLOW],
 }],  # variant == stress_incremental_marking
 
 ##############################################################################
@@ -1581,12 +1639,14 @@
 ##############################################################################
 ['no_simd_hardware == True', {
   'wasm/exceptions-simd': [SKIP],
+  'wasm/large-struct': [SKIP],
   'wasm/liftoff-simd-params': [SKIP],
   'wasm/multi-value-simd': [SKIP],
   'wasm/simd-*': [SKIP],
   'regress/wasm/regress-9447': [SKIP],
   'regress/wasm/regress-10309': [SKIP],
   'regress/wasm/regress-10831': [SKIP],
+  'regress/wasm/regress-13732': [SKIP],
   'regress/wasm/regress-1054466': [SKIP],
   'regress/wasm/regress-1065599': [SKIP],
   'regress/wasm/regress-1070078': [SKIP],
@@ -1611,18 +1671,19 @@
   'regress/wasm/regress-1271538': [SKIP],
   'regress/wasm/regress-1282224': [SKIP],
   'regress/wasm/regress-1283042': [SKIP],
+  'regress/wasm/regress-1283395': [SKIP],
   'regress/wasm/regress-1284980': [SKIP],
   'regress/wasm/regress-1286253': [SKIP],
-  'regress/wasm/regress-1283395': [SKIP],
   'regress/wasm/regress-1289678': [SKIP],
   'regress/wasm/regress-1290079': [SKIP],
   'regress/wasm/regress-1299183': [SKIP],
-  'regress/wasm/regress-1417516': [SKIP],
-  'regress/wasm/regress-13732': [SKIP],
   'regress/wasm/regress-1408337': [SKIP],
+  'regress/wasm/regress-1417516': [SKIP],
+  'regress/wasm/regress-1443218': [SKIP],
   'regress/wasm/regress-crbug-1338980': [SKIP],
   'regress/wasm/regress-crbug-1355070': [SKIP],
   'regress/wasm/regress-crbug-1356718': [SKIP],
+  'regress/wasm/regress-crbug-1465386': [SKIP],
 }],  # no_simd_hardware == True
 
 ##############################################################################
@@ -1653,6 +1714,7 @@
 ##############################################################################
 ['variant == experimental_regexp', {
   'regress/regress-779407': [SKIP],
+  'regexp-14098': [FAIL],
 }],  # variant == experimental_regexp
 
 ################################################################################
@@ -1678,14 +1740,15 @@
   'default-nospec': [SKIP],
   'es6/collections-constructor-*': [SKIP],
   'es6/map-constructor-entry-side-effect*': [SKIP],
+  # This test uses %SimulateNewspaceFull, which only works in the young generation
+  'regress/regress-1424415': [SKIP],
 }], # single_generation
 
 ################################################################################
 ['conservative_stack_scanning', {
-  # TODO(v8:13493): Conservative stack scanning is not currently compatible
-  # with stack switching.
-  'wasm/stack-switching': [SKIP],
-  'wasm/stack-switching-export': [SKIP],
+  # These tests are known to timeout with CSS, especially with variants that
+  # stress the GC.
+  'regress/regress-crbug-820312': [SKIP],
 }], # conservative_stack_scanning
 
 ################################################################################
@@ -1821,11 +1884,25 @@
 }], # third_party_heap
 
 ##############################################################################
-['(arch != x64 and arch != arm64) or simulator_run', {
+['arch != x64 or gc_fuzzer or deopt_fuzzer or interrupt_fuzzer', {
+  # TODO(nicohartmann@): Instruction selection on turboshaft graph is
+  # currently only supported on x64.
+  'turboshaft/turboshaft-instruction-selection': [SKIP],
+}],  # arch != x64 or gc_fuzzer or deopt_fuzzer or interrupt_fuzzer
+
+##############################################################################
+['((arch != x64 and arch != arm64) or (simulator_run and conservative_stack_scanning))', {
   # Stack switching is only supported on x64/arm64.
   'wasm/stack-switching': [SKIP],
   'wasm/stack-switching-export': [SKIP],
-}],  # (arch != x64 and arch != arm64) or simulator_run
+}],  # (arch != x64 and arch != arm64)
+
+##############################################################################
+['arch != x64', {
+  # The generic wasm-to-js wrapper only exists for x64 so far, so specific tests
+  # don't work on other platforms yet.
+  'wasm/wasm-to-js-tierup': [SKIP],
+}], # arch != x64
 
 ##############################################################################
 ['arch != x64 and arch != arm64 and arch != loong64 and arch != mips64', {
@@ -1845,6 +1922,7 @@
   'math-floor-part1': [SKIP],
   'compiler/regress-1125145': [SKIP],
   'compiler/regress-crbug-1399627': [SKIP],
+  'es6/typedarray-of': [PASS, SLOW],
 
   # TODO(victorgomes):
   'es6/unicode-regexp-ignore-case-noi18n': [SKIP],
@@ -1894,11 +1972,9 @@
 }], # variant == google3_nociu
 
 # Tests that cannot run without JS shared memory
-['no_js_shared_memory', {
+['not js_shared_memory', {
   'shared-memory/*': [SKIP],
-  'regress/regress-crbug-1394741': [SKIP],
-  'regress/regress-crbug-1395117': [SKIP],
-}],  # 'no_js_shared_memory'
+}],  # 'not js_shared_memory'
 
 ##############################################################################
 ['variant == always_sparkplug', {
@@ -1909,7 +1985,7 @@
 ##############################################################################
 # Behavioural differences between Maglev and Turbofan when the former is used
 # for OptimizeFunctionOnNextCall.
-['variant == stress_maglev', {
+['variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)', {
   # Maglev doesn't inline Array constructors, so it won't bake in allocation
   # site feedback.
   'array-constructor-feedback': [FAIL],
@@ -1928,12 +2004,7 @@
   'compiler/number-comparison-truncations': [FAIL],
   'regress/regress-2132': [FAIL],
   'compiler/regress-1199345': [FAIL],
-  # Maglev doesn't suppress BigInt size errors on truncation.
-  'compiler/bigint-shift-left': [FAIL],
-  'compiler/bigint-multiply-truncate': [FAIL],
   'wasm/bigint-opt': [FAIL],
-  # Maglev doesn't promote Number to NumberOrOddball ops based on uses.
-  'getters-on-elements': [FAIL],
   # Maglev doesn't inline the call being tested here.
   'compiler/call-with-arraylike-or-spread': [FAIL],
   'compiler/call-with-arraylike-or-spread-3': [FAIL],
@@ -1956,29 +2027,34 @@
   'compiler/fast-api-calls-8args': [FAIL],
   'compiler/fast-api-calls-string': [FAIL],
   'compiler/fast-api-calls-pointer': [FAIL],
+  'compiler/fast-api-calls-64-bit-integer-values': [FAIL],
   'compiler/fast-api-interface-types': [FAIL],
   'compiler/fast-api-sequences*': [FAIL],
   # Maglev doesn't specialise the IsBeingInterpreted runtime func.
   'compiler/is-being-interpreted-1': [FAIL],
   # Maglev doesn't support elements transitions (yet!).
   'compiler/regress-9945-1': [FAIL],
-  'compiler/regress-9945-2': [FAIL],
   # Maglev doesn't support growing elements stores.
   'array-store-and-grow': [FAIL],
-  # This test requires inlining, currently disabled in Maglev
-  'regress/regress-4578': [FAIL],
   # This test appears to be relying on no adding a map stability check, but
   # instead using a field representation dependency and allowing a read from
   # the deprecated map. Wiring this through in Maglev would be too messy to be
   # worth it.
   'regress/regress-map-invalidation-2': [FAIL],
-}], # variant == stress_maglev
+}], # variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)
+
+['(variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)) and (arch != arm)', {
+  # Maglev doesn't suppress BigInt size errors on truncation.
+  # On Arm that works, since we always _and_ the shift amount first.
+  'compiler/bigint-shift-left': [FAIL],
+  'compiler/bigint-multiply-truncate': [FAIL],
+}], # (variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan))' and (arch != arm)
 
 ##############################################################################
-['is_clang_coverage and mode == debug', {
+['clang_coverage and mode == debug', {
   # Too slow tests.
   'asm/poppler/poppler': [SKIP],
   'wasm/shared-memory-worker-gc': [SKIP],
-}],  # 'is_clang_coverage and mode == debug'
+}],  # 'clang_coverage and mode == debug'
 
 ]
diff --git a/deps/v8/test/mjsunit/never-optimize.js b/deps/v8/test/mjsunit/never-optimize.js
index 5294edd9bc44ed..d5cc1f3eaa4749 100644
--- a/deps/v8/test/mjsunit/never-optimize.js
+++ b/deps/v8/test/mjsunit/never-optimize.js
@@ -26,7 +26,7 @@
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 // Flags: --allow-natives-syntax --turbofan --no-always-turbofan --no-use-osr
-// Flags: --interrupt-budget=1024 --nomaglev
+// Flags: --invocation-count-for-turbofan=100 --nomaglev
 
 function o1() { }
 %PrepareFunctionForOptimization(o1);
diff --git a/deps/v8/test/mjsunit/non-extensible-array-reduce.js b/deps/v8/test/mjsunit/non-extensible-array-reduce.js
index d57d80884e4939..28aa6a4485620c 100644
--- a/deps/v8/test/mjsunit/non-extensible-array-reduce.js
+++ b/deps/v8/test/mjsunit/non-extensible-array-reduce.js
@@ -717,10 +717,11 @@ assertEquals(undefined, Object.preventExtensions(arr).reduceRight(function(val)
   g(); g();
   let total = g();
   %OptimizeFunctionOnNextCall(g);
+  var turbofan = willBeTurbofanned(g);
   g();
   g();
   assertEquals(total, g());
-  assertOptimized(g);
+  if (turbofan) assertOptimized(g);
 })();
 
 (function ReduceThrow() {
@@ -1084,10 +1085,11 @@ assertEquals(undefined, Object.preventExtensions(arr).reduceRight(function(val)
   g(); g();
   let total = g();
   %OptimizeFunctionOnNextCall(g);
+  var turbofan = willBeTurbofanned(g);
   g();
   g();
   assertEquals(total, g());
-  assertOptimized(g);
+  if (turbofan) assertOptimized(g);
 })();
 
 (function ReduceThrow() {
diff --git a/deps/v8/test/mjsunit/regexp-14098.js b/deps/v8/test/mjsunit/regexp-14098.js
new file mode 100644
index 00000000000000..89be567bf67318
--- /dev/null
+++ b/deps/v8/test/mjsunit/regexp-14098.js
@@ -0,0 +1,31 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --enable-experimental-regexp-engine
+// Flags: --no-default-to-experimental-regexp-engine
+
+// An example where the Experimental regexp engine
+// disagrees with the backtracking engine and the specification
+// for nullable quantifiers.
+// v8:14098
+var str = "ab";
+
+// executed by the Experimental engine (l flag)
+var exp_empty_star = /(?:a?b??)*/l;
+
+// executed by the backtracking engine
+var bt_empty_star = /(?:a?b??)*/;
+
+// The engines should both match "ab":
+// The first star repetition should match 'a'
+// because ignoring 'b' has highest-priority
+// Then the greedy star should be entered again
+// Then the second repetition should match 'b',
+// a non-empty repetition of the star.
+
+// backtracking correctly matches "ab"
+assertEquals(["ab"], bt_empty_star.exec(str));
+
+// experimental does not match "ab" but instead "a"
+assertEquals(["a"], exp_empty_star.exec(str));
diff --git a/deps/v8/test/mjsunit/regress-13517.js b/deps/v8/test/mjsunit/regress-13517.js
new file mode 100644
index 00000000000000..c3c99375aa038e
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress-13517.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+function foo () {
+  try {
+    [] = true;
+  } catch (e) {
+    return e;
+  }
+}
+
+%PrepareFunctionForOptimization(foo);
+const error1 = foo();
+%OptimizeFunctionOnNextCall(foo);
+assertEquals(error1.message, foo().message);
diff --git a/deps/v8/test/mjsunit/regress-1428825.js b/deps/v8/test/mjsunit/regress-1428825.js
new file mode 100644
index 00000000000000..9d1fcb43402563
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress-1428825.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags:
+
+for (let v0 = 0; v0 < 5; v0++) {
+    const v1 = [];
+    function f2() {
+    }
+    const v7 = +(v1 !== v1);
+    function f8() {
+        v1.length = 0;
+    }
+    const v12 = delete v1[1840008489];
+    const v13 = v1.at(v7);
+    for (let v14 = 0; v14 < 100; v14++) {
+        f2(v12, v13, f8);
+    }
+}
diff --git a/deps/v8/test/mjsunit/regress/asm/regress-13967.js b/deps/v8/test/mjsunit/regress/asm/regress-13967.js
new file mode 100644
index 00000000000000..0a126f647e6dff
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/asm/regress-13967.js
@@ -0,0 +1,45 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+const initial = 2**16;
+const max = 4 * initial;
+
+const memory = new ArrayBuffer(initial, { maxByteLength: max } );
+
+const heap = memory;
+
+function builder(stdlib, foreign, heap) {
+  "use asm";
+
+  const mem = new stdlib.Float64Array(heap);
+
+  function add(x, y) {
+    x = +x;
+    y = +y;
+
+    mem[0] = +x;
+    mem[1] = +y;
+
+    return +mem[0] + +mem[1];
+  }
+
+  return {add: add};
+}
+// Check that the asm.js module can be instantiated in the asm.js pipeline.
+builder(globalThis, undefined, new ArrayBuffer(initial));
+assertTrue(%IsAsmWasmCode(builder));
+
+const asm_js_module = builder(globalThis, undefined, heap);
+
+memory.resize(8);
+
+// Memory access out of bounds should return NaN.
+assertEquals(NaN, asm_js_module.add(4, 56));
+
+memory.resize(16);
+const foo = new Float64Array(memory);
+
+assertEquals(0, foo[1]);
diff --git a/deps/v8/test/mjsunit/regress/asm/regress-1410962.js b/deps/v8/test/mjsunit/regress/asm/regress-1410962.js
new file mode 100644
index 00000000000000..339bd3e9734954
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/asm/regress-1410962.js
@@ -0,0 +1,33 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+const memory = new WebAssembly.Memory({ initial: 1, maximum: 4 });
+
+const heap = memory.buffer;
+
+function builder(stdlib, foreign, heap) {
+  "use asm";
+
+  const mem = new stdlib.Float64Array(heap);
+
+  function add(x, y) {
+    x = +x;
+    y = +y;
+
+    return +mem[0] + +mem[1];
+  }
+
+  return {add: add};
+}
+
+// Check that the asm.js module can be instantiated in the asm.js pipeline.
+builder(globalThis, undefined, new ArrayBuffer(2 ** 16));
+assertTrue(%IsAsmWasmCode(builder));
+
+const asm_js_module = builder(globalThis, undefined, heap);
+
+// Should not throw.
+memory.grow(0);
diff --git a/deps/v8/test/mjsunit/regress/regress-1115354.js b/deps/v8/test/mjsunit/regress/regress-1115354.js
index e035db94384898..9b32b30371857a 100644
--- a/deps/v8/test/mjsunit/regress/regress-1115354.js
+++ b/deps/v8/test/mjsunit/regress/regress-1115354.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer --harmony-atomics-waitasync --expose-async-hooks
+// Flags: --expose-async-hooks
 
 const sab = new SharedArrayBuffer(16);
 const i32a = new Int32Array(sab);
diff --git a/deps/v8/test/mjsunit/regress/regress-1421560.js b/deps/v8/test/mjsunit/regress/regress-1421560.js
new file mode 100644
index 00000000000000..ff0aa3d8baa942
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1421560.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+const x = (-1).toLocaleString().padEnd(2 + 31 - 1, 'aa');
+
+function test() {
+  try {
+    y = x;
+  } catch (e) {
+  }
+  return y > -Infinity ? y : 0 - y;
+}
+
+%PrepareFunctionForOptimization(test);
+assertEquals(NaN, test());
+%OptimizeFunctionOnNextCall(test);
+assertEquals(NaN, test());
diff --git a/deps/v8/test/mjsunit/regress/regress-1424415.js b/deps/v8/test/mjsunit/regress/regress-1424415.js
new file mode 100644
index 00000000000000..298da5852d1e95
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1424415.js
@@ -0,0 +1,14 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+// This disables inline allocation.
+%SetAllocationTimeout(20, 0, false);
+// Allocate and eventually trigger optimization.
+for (let i = 0; i < 10000; ++i) {
+  function f() { return i; }
+}
+// This should not crash!
+%SimulateNewspaceFull();
diff --git a/deps/v8/test/mjsunit/regress/regress-1425616.js b/deps/v8/test/mjsunit/regress/regress-1425616.js
new file mode 100644
index 00000000000000..258625ce87b340
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1425616.js
@@ -0,0 +1,14 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --stress-lazy-source-positions
+
+eval(`
+let foo = 5;
+let change_and_read_foo = () => {
+  foo = 42;
+  (function read_foo(){return foo;})();
+};
+change_and_read_foo();
+`);
diff --git a/deps/v8/test/mjsunit/regress/regress-1428034.js b/deps/v8/test/mjsunit/regress/regress-1428034.js
new file mode 100644
index 00000000000000..7bd16fff881d1c
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1428034.js
@@ -0,0 +1,21 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --stress-lazy-source-positions
+
+eval(`
+var f = (
+  a = function in_arrowhead_args() {
+    return function inner() {
+      b = 42;
+    };
+  },
+  b = 1,
+) => {
+  assertEquals(1, b);
+  a()();
+  assertEquals(42, b);
+};
+f();
+`);
diff --git a/deps/v8/test/mjsunit/regress/regress-1429141.js b/deps/v8/test/mjsunit/regress/regress-1429141.js
new file mode 100644
index 00000000000000..7ca26d50eacb5d
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1429141.js
@@ -0,0 +1,12 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+for (let v0 = 0; v0 < 100; v0++) {
+  let v3 = Math.max([]);
+  ++v3 / v3 in Math;
+  for (let v7 = 0; v7 < 10; v7++) {
+  }
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-1429749.js b/deps/v8/test/mjsunit/regress/regress-1429749.js
new file mode 100644
index 00000000000000..bfea7004456eb9
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1429749.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function test() {
+    for (let v0 = 0; v0 < 5; v0++) {
+        for (let i2 = Uint8ClampedArray; i2 >= Uint8ClampedArray;) {
+            i2 = +i2 - Uint8ClampedArray;
+        }
+    }
+}
+
+%PrepareFunctionForOptimization(test);
+test();
+%OptimizeFunctionOnNextCall(test);
+test();
diff --git a/deps/v8/test/mjsunit/regress/regress-1430326.js b/deps/v8/test/mjsunit/regress/regress-1430326.js
new file mode 100644
index 00000000000000..6fa32f6086e825
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1430326.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function foo() {
+    for (var x in this) {};
+    if (true) x++;
+    return x++;
+};
+
+%PrepareFunctionForOptimization(foo);
+assertEquals(NaN, foo());
+%OptimizeFunctionOnNextCall(foo);
+assertEquals(NaN, foo());
diff --git a/deps/v8/test/mjsunit/regress/regress-1431029.js b/deps/v8/test/mjsunit/regress/regress-1431029.js
new file mode 100644
index 00000000000000..c6fc5dbb31d2b1
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1431029.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function test() {
+    for (let v2 = 0; v2 < 5; v2++) {
+        let v4 = BigInt(v2);
+        BigInt.asUintN(64, v4++ >> 4294967297n);
+    }
+}
+
+%PrepareFunctionForOptimization(test);
+test();
+test();
+%OptimizeFunctionOnNextCall(test);
+test();
diff --git a/deps/v8/test/mjsunit/regress/regress-1431713.js b/deps/v8/test/mjsunit/regress/regress-1431713.js
new file mode 100644
index 00000000000000..8094f77757d1f1
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1431713.js
@@ -0,0 +1,14 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function foo(x) {
+  const unused = -x;
+}
+
+%PrepareFunctionForOptimization(foo);
+foo(2316465375n);
+%OptimizeFunctionOnNextCall(foo);
+assertThrows(() => foo({__proto__: Object(Symbol)}), TypeError);
diff --git a/deps/v8/test/mjsunit/regress/regress-1432470.js b/deps/v8/test/mjsunit/regress/regress-1432470.js
new file mode 100644
index 00000000000000..3915ca4fe69b5a
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1432470.js
@@ -0,0 +1,39 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const v2 = new Uint8ClampedArray(216);
+const v5 = new BigInt64Array(5);
+const v8 = new Uint32Array(2);
+for (let v9 = 0; v9 < 5; v9++) {
+  const v12 = new Float32Array(4096);
+  function f13() {
+    return f13;
+  }
+  const v14 = f13();
+  const v16 = 7 * v14;
+  const v17 = +v16;
+  const v18 = 4096 + v14;
+  const v19 = v18 * v17;
+  class C21 extends Array {
+    constructor(a23, a24, a25, a26) {
+      super();
+      v18.toLowerCase(a24, 7, 7, f13);
+    }
+  }
+  const v28 = new C21(v19, v16, 7, C21);
+  const v31 = new Uint8Array(1073741824);
+  for (let i = 0; i < 25; i++) {
+    let v36 = ("valueOf")[216];
+    for (let v37 = 0; v37 < 50; v37++) {
+      for (let v38 = 0; v38 < 50; v38++) {
+        v36 % (4096 >>> 4096);
+        v36++;
+      }
+      0 == 99;
+      class C45 {
+      }
+    }
+  }
+  Array(56393);
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-1441346.js b/deps/v8/test/mjsunit/regress/regress-1441346.js
new file mode 100644
index 00000000000000..f312b9a79f4aa8
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1441346.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function test(x) {
+  let y = -9007199254740990;
+  y++;
+  return (0 + x) ** y;
+}
+
+const x = -1.0219695401608718e+308;
+%PrepareFunctionForOptimization(test);
+assertEquals(-0, test(x));
+assertEquals(-0, test(x));
+%OptimizeFunctionOnNextCall(test);
+assertEquals(-0, test(x));
diff --git a/deps/v8/test/mjsunit/regress/regress-1442603.js b/deps/v8/test/mjsunit/regress/regress-1442603.js
new file mode 100644
index 00000000000000..6bb7c783774316
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1442603.js
@@ -0,0 +1,53 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-gc --stress-flush-code
+// Flags: --always-turbofan --always-osr --osr-to-tierup=200
+
+function main() {
+  function f0() {
+    try {
+      var v0 = 0;
+    } catch (v3) { }
+    try {
+      var v1 = new Array(23);
+    } catch (v4) { }
+    try {
+      for (; v0 < v1.length; v0++) {
+        v1[v0] = new Uint32Array(262142);
+        v1[v0] = new Uint32Array(262139);
+        v1[v0] = new Uint32Array(262139);
+      }
+    } catch (v5) { }
+    v0 = -13;
+    try {
+      var v2 = [];
+    } catch (v6) { }
+    try {
+      var v1 = new Array(23);
+    } catch (v7) { }
+    try {
+      v2.xxx = "xxx";
+    } catch (e) { }
+    try {
+      for (var v0 = 0; v0 < 1024; v0++) {
+        v2[v0] = new Array(v0);
+        v2[v0] = new Array(v0);
+        v2[v0] = new Array(v0);
+        v2[v0].xxx = "xxx " + v0;
+        v2[v0].xxx = "xxx " + v0;
+        v2[v0].xxx = "xxx " + v0;
+      }
+    } catch (v8) { }
+    try {
+      gc();
+      a(900000)[b(b(900000), 900000)] = 900000;
+    } catch (v9) { }
+  }
+  gc();
+  f0();
+}
+main();
+main();
+main();
diff --git a/deps/v8/test/mjsunit/regress/regress-1444019.js b/deps/v8/test/mjsunit/regress/regress-1444019.js
new file mode 100644
index 00000000000000..11e85559786503
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1444019.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function use(x) {}
+
+function test(a1, a2) {
+   use(++a2 ** -2147483647);
+}
+
+%PrepareFunctionForOptimization(test);
+test();
+test();
+%OptimizeFunctionOnNextCall(test);
+test(2147483649, -936768208);
diff --git a/deps/v8/test/mjsunit/regress/regress-1445419.js b/deps/v8/test/mjsunit/regress/regress-1445419.js
new file mode 100644
index 00000000000000..0b16a451d3e9fd
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1445419.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+(function () {
+    var __v_182 = function () {
+        var __v_184 = [ 3];
+        var __v_186 = function () {
+        };
+        __v_184.map(__v_186);
+    };
+    %PrepareFunctionForOptimization(__v_182);
+    __v_182();
+    %OptimizeFunctionOnNextCall(__v_182);
+    __v_182();
+})();
diff --git a/deps/v8/test/mjsunit/regress/regress-1446624.js b/deps/v8/test/mjsunit/regress/regress-1446624.js
new file mode 100644
index 00000000000000..9092e8f5ef98fa
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1446624.js
@@ -0,0 +1,15 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+for (let v3 = 0; v3 < 25; v3++) {
+    function f4() {
+    }
+    const v9 = Array(2);
+    try {
+        v9.reduceRight(f4);
+    } catch(e11) {
+    }
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-1447326.js b/deps/v8/test/mjsunit/regress/regress-1447326.js
new file mode 100644
index 00000000000000..32565653d69542
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1447326.js
@@ -0,0 +1,34 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --expose-gc
+
+function F1() {
+    if (!new.target) { throw 'must be called with new'; }
+    this.a = 2070533028;
+    this.f = 2070533028;
+}
+const v4 = new F1();
+function f5(a6) {
+    a6.f = 1854;
+    a6.f;
+    return 1854;
+}
+const v8 = f5(v4);
+function test() {
+    const o12 = {
+        "execution": "async",
+    };
+    const v13 = gc(o12);
+    const t17 = v13.finally(1854, v13, v13).constructor;
+    new t17(f5);
+    for (let i = 0; i < 5; i++) {
+    }
+    return v8;
+}
+
+%PrepareFunctionForOptimization(test);
+test();
+%OptimizeFunctionOnNextCall(test);
+test();
diff --git a/deps/v8/test/mjsunit/regress/regress-1447343.js b/deps/v8/test/mjsunit/regress/regress-1447343.js
new file mode 100644
index 00000000000000..7630ad04bacb3a
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1447343.js
@@ -0,0 +1,34 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const o10 = {
+    [Symbol.iterator]() {
+        let done = 0;
+        return {
+            next() {
+                done++;
+                return {
+                    "done": done,
+                };
+            },
+        };
+    },
+};
+let long_string;
+try {
+  long_string = String.prototype.padStart(536870888);
+} catch (e) {
+  if (!(e instanceof RangeError)) throw e;
+  // 32-bit systems have a lower string limit.
+  long_string = String.prototype.padStart(268435440);
+}
+
+Symbol.constructor = Symbol;
+const t21 = Symbol(long_string);
+const expected_error = 'Function\\.prototype\\.apply was called on ' +
+    'Symbol\\( +\\.\\.\\.<omitted>\\.\\.\\. +\\), ' +
+    'which is a symbol and not a function';
+assertThrows(
+    () => t21(...o10, Symbol.constructor), TypeError,
+    new RegExp(expected_error));
diff --git a/deps/v8/test/mjsunit/regress/regress-1447383.js b/deps/v8/test/mjsunit/regress/regress-1447383.js
new file mode 100644
index 00000000000000..baf3966c1424c5
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1447383.js
@@ -0,0 +1,32 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Correctness issue:
+// When changing the Number prototype and providing a smi as the locale for
+// String.p.toLocaleLowerCase, the prototype would not be considered.
+// See ecma402 #sec-canonicalizelocalelist.
+
+let smi = 123;
+let heapNumber = 1.23;
+
+// Test case 1: The number prototype has a length property and a valid locale
+// for Get(O, '0').
+Number.prototype.__proto__ = ['tr'];
+assertEquals('I'.toLocaleLowerCase('tr'),
+             'I'.toLocaleLowerCase(smi));
+assertEquals('I'.toLocaleLowerCase('tr'),
+             'I'.toLocaleLowerCase(heapNumber));
+
+// Test case 2: The number prototype has a length property and an invalid locale
+// for Get(O, '0').
+Number.prototype.__proto__ = [42];  // 42 is not a valid locale.
+assertThrows(() => 'I'.toLocaleLowerCase(smi), TypeError);
+assertThrows(() => 'I'.toLocaleLowerCase(heapNumber), TypeError);
+
+// Test case 3: The number prototype has a length property of 0.
+Number.prototype.__proto__ = [];
+assertEquals('I'.toLocaleLowerCase([]),
+             'I'.toLocaleLowerCase(smi));
+assertEquals('I'.toLocaleLowerCase([]),
+             'I'.toLocaleLowerCase(heapNumber));
diff --git a/deps/v8/test/mjsunit/regress/regress-1448716.js b/deps/v8/test/mjsunit/regress/regress-1448716.js
new file mode 100644
index 00000000000000..47789d39f8cc68
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1448716.js
@@ -0,0 +1,22 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+const o0 = {
+};
+function f1(a2, a3, a4) {
+    function f5(a6) {
+        const v13 = Math.min(Math.max(a3, 0), 2 & 52);
+        o0.valueOf = f1;
+        return v13 + v13;
+    }
+    %PrepareFunctionForOptimization(f5);
+    f5(o0);
+    const v16 = %OptimizeFunctionOnNextCall(f5);
+    return v16;
+}
+for (let v17 = 0; v17 < 5; v17++) {
+    f1(v17, v17);
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-1449550.js b/deps/v8/test/mjsunit/regress/regress-1449550.js
new file mode 100644
index 00000000000000..35d5f8f4e5fd06
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1449550.js
@@ -0,0 +1,26 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function x() {
+  let obj = { foo: "bar" };
+  obj.toJSON = 42;
+  obj.__proto__ = new Proxy([], {});
+  assertTrue(%HasFastProperties(obj));
+  return obj;
+}
+assertEquals("[object Object]", toString.call(x()));
+
+function y() {
+  let obj = { foo: "bar" };
+  Object.defineProperty(obj, "foo", {
+    get: function () {}
+  });
+  obj.toJSON = 42;
+  obj.__proto__ = new Proxy([], {});
+  assertFalse(%HasFastProperties(obj));
+  return obj;
+}
+assertEquals("[object Object]", toString.call(y()));
diff --git a/deps/v8/test/mjsunit/regress/regress-1449567.js b/deps/v8/test/mjsunit/regress/regress-1449567.js
new file mode 100644
index 00000000000000..db67658deef347
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1449567.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags:
+
+const v1 = new Uint8ClampedArray();
+for (let v2 = 0; v2 < 2; v2++) {
+    let v4 = 1024;
+    function f6() {
+        return f6;
+    }
+    const v7 = v4 >>> 0;
+    for (let v8 = 0; v8 < 5000; v8++) {
+        const v13 = v7 / 1024;
+        const v14 = new Uint8Array(255);
+        for (const v15 of v14) {
+            -Math.floor(v13);
+        }
+    }
+    for (const v18 of v1) {
+    }
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-1450594.js b/deps/v8/test/mjsunit/regress/regress-1450594.js
new file mode 100644
index 00000000000000..2fdb7f6833c4ac
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1450594.js
@@ -0,0 +1,97 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function maybe_throw() {}
+%NeverOptimizeFunction(maybe_throw);
+
+function with_merge_after_try_catch() {
+  var x;
+  var inner = function () {
+    // This modifies the statically-known parent context.
+    x = "foo";
+  };
+  %PrepareFunctionForOptimization(inner);
+
+  try {
+    // Call a function so that we don't eliminate the try-catch.
+    maybe_throw();
+  } catch (e) {}
+
+  // After this try-catch, we should not have a Phi for the context, else
+  // context load-after-store elimination will incorrectly miss the store inside
+  // `inner`.
+
+  x = "bar"; // store context[x] = "bar"
+  inner();   // store context[x] = "foo" via inner
+  return x;  // load context[x]
+};
+%PrepareFunctionForOptimization(with_merge_after_try_catch);
+assertEquals("foo", with_merge_after_try_catch());
+assertEquals("foo", with_merge_after_try_catch());
+%OptimizeFunctionOnNextCall(with_merge_after_try_catch);
+assertEquals("foo", with_merge_after_try_catch());
+
+async function with_merge_after_try_catch_that_has_await() {
+  var x;
+  var inner = function () {
+    // This modifies the statically-known parent context.
+    x = "foo";
+  };
+  %PrepareFunctionForOptimization(inner);
+
+  try {
+    // Call a function so that we don't eliminate the try-catch.
+    maybe_throw();
+  } catch (e) {
+    // This will suspend+resume, which switches back to using the on-stack
+    // context on resume.
+    await 0;
+  }
+
+  // After this try-catch, we will have a Phi for the context, between the
+  // created function context (if there was no suspend) and the on-stack context
+  // (if there was one). Context load-after-store elimination should still not
+  // miss the store inside `inner`.
+
+  x = "bar"; // store context[x] = "bar"
+  inner();   // store context[x] = "foo" via inner
+  return x;  // load context[x]
+};
+
+(async function () {
+  %PrepareFunctionForOptimization(with_merge_after_try_catch_that_has_await);
+  assertEquals("foo", await with_merge_after_try_catch_that_has_await());
+  assertEquals("foo", await with_merge_after_try_catch_that_has_await());
+  %OptimizeFunctionOnNextCall(with_merge_after_try_catch_that_has_await);
+  assertEquals("foo", await with_merge_after_try_catch_that_has_await());
+})()
+
+
+function with_inner_mixed_context_return(return_inside_block) {
+  function inner() {
+    {
+      // Create a block context.
+      let x = 5;
+      let inner = function () { x; };
+      // Return from inside the block context.
+      if (return_inside_block) return 1;
+    }
+    // Return outside the block context.
+    return 2;
+  }
+  %PrepareFunctionForOptimization(inner);
+
+  // There should be no DCHECK failures about context phis from inlining the
+  // inner function call, despite that having returns both inside and outside
+  // the block context.
+  return inner();
+};
+%PrepareFunctionForOptimization(with_inner_mixed_context_return);
+assertEquals(1, with_inner_mixed_context_return(true));
+assertEquals(2, with_inner_mixed_context_return(false));
+%OptimizeFunctionOnNextCall(with_inner_mixed_context_return);
+assertEquals(1, with_inner_mixed_context_return(true));
+assertEquals(2, with_inner_mixed_context_return(false));
diff --git a/deps/v8/test/mjsunit/regress/regress-1451704.js b/deps/v8/test/mjsunit/regress/regress-1451704.js
new file mode 100644
index 00000000000000..da9cbfe3e9c9f1
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1451704.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags:
+
+function v0() {
+    for (let i= 0; i < 4004; i++) {
+        const v7 = 1 >>> i;
+        const v9 = 32 - i;
+        const v10 = 1<< v9;
+        const v11 = v7 & v10;
+    }
+}
+v0();
+v0();
diff --git a/deps/v8/test/mjsunit/regress/regress-1452254.js b/deps/v8/test/mjsunit/regress/regress-1452254.js
new file mode 100644
index 00000000000000..5e39c2a9873047
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1452254.js
@@ -0,0 +1,26 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --verify-heap
+
+let o = { toJSON() {} };
+function ID(x) { return x; }
+
+class C0 {
+  toJSON() {}
+};
+
+class C1 {
+  toJSON() {}
+  [ID('x')](){}
+};
+
+class C2 {
+  static toJSON() {}
+};
+
+class C3 {
+  static toJSON() {}
+  static [ID('x')](){}
+};
diff --git a/deps/v8/test/mjsunit/regress/regress-1453973.js b/deps/v8/test/mjsunit/regress/regress-1453973.js
new file mode 100644
index 00000000000000..9d0504de9c82ca
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1453973.js
@@ -0,0 +1,24 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function opt(){
+  const v0 = [];
+  let v1 = Infinity;
+  const v2 = v1.E;
+  for (let v5 = -1; v5 > v0; v5 = v5 & -1) {
+    for (let v6 = v5; v6 <= -1; v6 = v6 + v2) {
+      const v7 = v1++;
+      for (let v9 = v6; v9 <= v7; v9 = v9 + v5) {
+      }
+    }
+  }
+}
+
+// We want to optimize without feedback. We still need to
+// %PrepareFunctionForOptimization though to make bots happy.
+%PrepareFunctionForOptimization(opt);
+%OptimizeFunctionOnNextCall(opt);
+let jit_a2 = opt();
diff --git a/deps/v8/test/mjsunit/regress/regress-1454436.js b/deps/v8/test/mjsunit/regress/regress-1454436.js
new file mode 100644
index 00000000000000..dbdbc3994b7338
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1454436.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+const v3 = new Uint8Array();
+function f4() {
+    for (let v5 = 0; v5 < 5; v5++) {
+        v5++;
+        const v7 = -v5;
+        const v8 = v7 << v7;
+        let v9 = v8 + v8;
+        v9--;
+        v9--;
+        v3[undefined] &= v9;
+    }
+}
+
+%PrepareFunctionForOptimization(f4);
+f4();
+%OptimizeFunctionOnNextCall(f4);
+f4();
diff --git a/deps/v8/test/mjsunit/regress/regress-1455389.js b/deps/v8/test/mjsunit/regress/regress-1455389.js
new file mode 100644
index 00000000000000..ea5e7f4330618f
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1455389.js
@@ -0,0 +1,27 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+let a = 42;
+function* f() {
+  try {
+    let a = 10;
+    yield 2;
+    () => a;
+    return "fail"
+  } catch (e) {
+    return a;
+  }
+}
+
+%PrepareFunctionForOptimization(f);
+let g = f();
+assertEquals({value:2, done:false}, g.next());
+assertEquals({value:42, done:true}, g.throw("hello"));
+
+%OptimizeFunctionOnNextCall(f);
+g = f();
+assertEquals({value:2, done:false}, g.next());
+assertEquals({value:42, done:true}, g.throw("hello"));
diff --git a/deps/v8/test/mjsunit/regress/regress-1455706.js b/deps/v8/test/mjsunit/regress/regress-1455706.js
new file mode 100644
index 00000000000000..d47c58ddb7f30c
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1455706.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+let v2 = new BigUint64Array(256);
+for (let v3 = 0; v3 < 5; v3++) {
+    let v4 = -2147483647;
+    do {
+        for (let v6 = 0; v6 < 5; v6++) {
+        }
+        let v8 = v2++;
+        v8--;
+        v8 % v8;
+    } while (v4 >= 1)
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-1455959.js b/deps/v8/test/mjsunit/regress/regress-1455959.js
new file mode 100644
index 00000000000000..2bc0009fdf05c3
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1455959.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+function callback() {
+  "use strict"
+}
+
+function foo(x) {
+  // array.forEach with an untagged `this` arg and no receiver conversion should
+  // compile successfully.
+  x = x << 1;
+  [""].forEach(callback, x);
+}
+
+%PrepareFunctionForOptimization(callback);
+%PrepareFunctionForOptimization(foo);
+foo(0);
+foo(0);
+%OptimizeFunctionOnNextCall(foo);
+foo(0);
diff --git a/deps/v8/test/mjsunit/regress/regress-1456617.js b/deps/v8/test/mjsunit/regress/regress-1456617.js
new file mode 100644
index 00000000000000..8e3f240f6695f2
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1456617.js
@@ -0,0 +1,22 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+function foo() {
+  const the_array = [0, 0];
+  function callback(element, index, array) {
+    // Right-trim the array on each iteration, so that the second iteration
+    // fails.
+    array.shift();
+    assertEquals(0, element);
+  }
+  the_array.forEach(callback);
+}
+
+%PrepareFunctionForOptimization(foo);
+foo();
+foo();
+%OptimizeFunctionOnNextCall(foo);
+foo();
diff --git a/deps/v8/test/mjsunit/regress/regress-1457745.js b/deps/v8/test/mjsunit/regress/regress-1457745.js
new file mode 100644
index 00000000000000..951e57a0763d1f
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1457745.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function foo(b) {
+    let x = 3.1;
+    if(b) x = 1;
+    return x ** Infinity;
+}
+
+%PrepareFunctionForOptimization(foo);
+assertEquals(NaN, foo(true));
+assertEquals(Infinity, foo(false));
+%OptimizeFunctionOnNextCall(foo);
+assertEquals(NaN, foo(true));
+assertEquals(Infinity, foo(false));
diff --git a/deps/v8/test/mjsunit/regress/regress-1457747.js b/deps/v8/test/mjsunit/regress/regress-1457747.js
new file mode 100644
index 00000000000000..ecf39e1c7104fb
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1457747.js
@@ -0,0 +1,26 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+function opt(opt_param){
+  const v5 = [8];
+  Object.defineProperty(v5, "c", { writable: true, value: -4.1595484640962705e+307 });
+  let v7 = false;
+  let v8 = 0;
+
+  for (let i = 0; i < 5; i++) {
+    v5.length = v8;
+    v8++;
+    for (let v10 = 0; v10 < 32; v10++) {
+      v5["p" + v10] = v10;
+    }
+  }
+  return v5;
+}
+opt(false);
+%PrepareFunctionForOptimization(opt);
+opt(true);
+%OptimizeFunctionOnNextCall(opt);
+opt(false);
diff --git a/deps/v8/test/mjsunit/regress/regress-1463134.js b/deps/v8/test/mjsunit/regress/regress-1463134.js
new file mode 100644
index 00000000000000..3b58f8014ef7fc
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1463134.js
@@ -0,0 +1,34 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+const o0 = {
+};
+function F1() {
+}
+const v3 = new F1();
+function f4(a5, a7) {
+    a5.d = o0;
+    function F8() {
+    }
+    const v12 = new F8();
+    let v13 = 0;
+    for (let i15 = ++v13; i15 <= v13; ++i15) {
+        v12[3819725155] &= a5;
+        function f20() {
+        }
+    }
+    return a7;
+}
+f4(v3);
+function f22() {
+    const v24 = Array();
+    v24.findLast(Array);
+    v24.reduce(f4, 0);
+}
+const v28 = %PrepareFunctionForOptimization(f22);
+f22();
+const v30 = %OptimizeFunctionOnNextCall(f22);
+f22();
diff --git a/deps/v8/test/mjsunit/regress/regress-1464437.js b/deps/v8/test/mjsunit/regress/regress-1464437.js
new file mode 100644
index 00000000000000..d477a014290906
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1464437.js
@@ -0,0 +1,62 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+function get_keys() {
+  const buffer = new ArrayBuffer(12, { "maxByteLength": 4096 });
+  const u16array = new Uint16Array(buffer, 0, 5);
+  buffer.resize()
+  let keys = "none";
+  try { keys = u16array.keys(); } catch (e) {}
+  return keys;
+}
+
+(function() {
+  // Testing array.prototype.keys
+  %PrepareFunctionForOptimization(get_keys);
+  let interpreted = get_keys();
+  assertEquals("none", interpreted);
+  %OptimizeFunctionOnNextCall(get_keys);
+  let optimized = get_keys();
+  assertEquals("none", optimized);
+})();
+
+function get_values() {
+  const buffer = new ArrayBuffer(12, { "maxByteLength": 4096 });
+  const u16array = new Uint16Array(buffer, 0, 5);
+  buffer.resize()
+  let keys = "none";
+  try { keys = u16array.values(); } catch (e) {}
+  return keys;
+}
+
+(function() {
+  // Testing array.prototype.values
+  %PrepareFunctionForOptimization(get_values);
+  let interpreted = get_values();
+  assertEquals("none", interpreted);
+  %OptimizeFunctionOnNextCall(get_values);
+  let optimized = get_values();
+  assertEquals("none", optimized);
+})();
+
+function get_entries() {
+  const buffer = new ArrayBuffer(12, { "maxByteLength": 4096 });
+  const u16array = new Uint16Array(buffer, 0, 5);
+  buffer.resize()
+  let keys = "none";
+  try { keys = u16array.entries(); } catch (e) {}
+  return keys;
+}
+
+(function() {
+  // Testing array.prototype.entries
+  %PrepareFunctionForOptimization(get_entries);
+  let interpreted = get_entries();
+  assertEquals("none", interpreted);
+  %OptimizeFunctionOnNextCall(get_entries);
+  let optimized = get_entries();
+  assertEquals("none", optimized);
+})();
diff --git a/deps/v8/test/mjsunit/regress/regress-1464639.js b/deps/v8/test/mjsunit/regress/regress-1464639.js
new file mode 100644
index 00000000000000..cd0dc5126b3142
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1464639.js
@@ -0,0 +1,9 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var __v_2 = function() {};
+var __v_3 = new Proxy({}, __v_2);
+__v_2.__defineGetter__('name', function() {});
+__v_2.get = function() { return "value 2" };
+assertEquals(__v_3.property, "value 2");
diff --git a/deps/v8/test/mjsunit/regress/regress-1466120.js b/deps/v8/test/mjsunit/regress/regress-1466120.js
new file mode 100644
index 00000000000000..13ba64b9fbcfbf
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1466120.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function f1(a2) {
+    let v4 = -0;
+    if (a2) {
+        v4 = -3;
+    }
+    return (v4 ** 69) != -2147483648;
+}
+const v11 = %PrepareFunctionForOptimization(f1);
+f1();
+const v13 = %OptimizeFunctionOnNextCall(f1);
+f1(f1);
diff --git a/deps/v8/test/mjsunit/regress/regress-1467142.js b/deps/v8/test/mjsunit/regress/regress-1467142.js
new file mode 100644
index 00000000000000..2cfd5a3395bd88
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1467142.js
@@ -0,0 +1,19 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags:
+
+let v2 = 7;
+for (let v4 = 0; v4 < 5; v4++) {
+    function f6() {
+        for (const v11 in Symbol) {
+            for (let v12 = 0; v12 < 5; v12++) {
+                while (5839 <= v12) {
+                    v12 *= v2;
+                }
+            }
+        }
+    }
+    f6();
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-1469485.js b/deps/v8/test/mjsunit/regress/regress-1469485.js
new file mode 100644
index 00000000000000..b1ac4f3459d5fe
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1469485.js
@@ -0,0 +1,12 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --turboshaft --turboshaft-assert-types --allow-natives-syntax
+// Flags: --no-always-sparkplug --no-stress-concurrent-inlining
+
+function f7() {
+}
+const v18 = %PrepareFunctionForOptimization(f7);
+const v20 = %OptimizeFunctionOnNextCall(f7);
+f7();
diff --git a/deps/v8/test/mjsunit/regress/regress-1469634.js b/deps/v8/test/mjsunit/regress/regress-1469634.js
new file mode 100644
index 00000000000000..e990d0e638269f
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1469634.js
@@ -0,0 +1,30 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --allow-natives-syntax
+
+function Module(stdlib) {
+  "use asm";
+
+  var fround = stdlib.Math.fround;
+
+  // f: double -> float
+  function f(a) {
+    a = +a;
+    return fround(a);
+  }
+
+  return { f: f };
+}
+
+var f = Module({ Math }).f;
+let count = 0;
+
+let tester = () => {
+    return f(140737463189505, 8388607);
+}
+%PrepareFunctionForOptimization(tester);
+tester();
+%OptimizeFunctionOnNextCall(tester);
+tester();
diff --git a/deps/v8/test/mjsunit/regress/regress-1470166.js b/deps/v8/test/mjsunit/regress/regress-1470166.js
new file mode 100644
index 00000000000000..47343ac8fc7a0c
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1470166.js
@@ -0,0 +1,36 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --jit-fuzzing
+
+const Probe =function() {
+    const setPrototypeOf = Object.setPrototypeOf;
+    function probe() {
+            setPrototypeOf();
+    }
+    function probeWithErrorHandling() {
+        try {
+            probe();
+        } catch(e) {
+        }
+    }
+    return {
+        probe: probeWithErrorHandling,
+    };
+}();
+function f0() {
+    for (let v1 = 0; v1 < 5; v1++) {
+        v1++;
+        const v3 = -v1;
+        const v4 = v3 << v3;
+        let v5 = v4 + v4;
+        const v6 = v5--;
+        Probe.probe();
+        Probe.probe( v6 | v6);
+    }
+}
+f0();
+const v9 = %PrepareFunctionForOptimization(f0);
+const v10 = %OptimizeFunctionOnNextCall(f0);
+f0();
diff --git a/deps/v8/test/mjsunit/regress/regress-1471388.js b/deps/v8/test/mjsunit/regress/regress-1471388.js
new file mode 100644
index 00000000000000..505dc6c5645908
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1471388.js
@@ -0,0 +1,21 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function f2(a3, a4) {
+    for (let v5 = 0; v5 < 5; v5++) {
+        let v6 = v5 ^ -1000000.0;
+        v6--;
+        const v8 = new Uint16Array();
+        v8[3] <<= v6;
+    }
+    return a4;
+}
+
+%PrepareFunctionForOptimization(f2);
+f2();
+f2();
+%OptimizeFunctionOnNextCall(f2);
+f2();
diff --git a/deps/v8/test/mjsunit/regress/regress-1471784.js b/deps/v8/test/mjsunit/regress/regress-1471784.js
new file mode 100644
index 00000000000000..34e379df7f096d
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1471784.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags:
+
+for (let i = 0; i < 5; i++) {
+    function f0() {
+        const v3 = String();
+        function f4(a5, a6, a7, a8) {
+            a5++;
+            const v10 = a5 / a5;
+            const v11 = a8.bind();
+            const t7 = v11.constructor;
+            t7();
+            try { v14 = v11.apply(v10, -2n); } catch (e) {}
+        }
+        for (let v15 = 0; v15 < 10; v15++) {
+            f4(v15, v15, v3, f4);
+        }
+    }
+    f0();
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-1472174.js b/deps/v8/test/mjsunit/regress/regress-1472174.js
new file mode 100644
index 00000000000000..dcd3a3589c1578
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1472174.js
@@ -0,0 +1,21 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --expose-gc
+
+function f0() {
+    try {
+        undefined.x;
+    } catch(e4) {
+        gc();
+        const o7 = {
+            "preventExtensions": e4,
+        };
+    }
+}
+
+%PrepareFunctionForOptimization(f0);
+f0();
+%OptimizeFunctionOnNextCall(f0);
+f0();
diff --git a/deps/v8/test/mjsunit/regress/regress-1472966.js b/deps/v8/test/mjsunit/regress/regress-1472966.js
new file mode 100644
index 00000000000000..a3f34f916790e3
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1472966.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function foo() {
+    const v11 = 8 * (8 >> undefined);
+    const v12 = v11 + v11;
+    return v12 + v12;
+}
+
+%PrepareFunctionForOptimization(foo);
+assertEquals(256, foo());
+%OptimizeFunctionOnNextCall(foo);
+assertEquals(256, foo());
diff --git a/deps/v8/test/mjsunit/regress/regress-1476191.js b/deps/v8/test/mjsunit/regress/regress-1476191.js
new file mode 100644
index 00000000000000..478c01e582d7aa
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1476191.js
@@ -0,0 +1,28 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+class Foo extends Array {
+  constructor() {
+    super();
+  }
+};
+
+// Invalidate the array iterator, for FindNonDefaultConstructorOrConstruct
+// reduction.
+Array.prototype[Symbol.iterator] = function () {};
+
+%PrepareFunctionForOptimization(Foo);
+new Foo();
+new Foo();
+%OptimizeMaglevOnNextCall(Foo);
+new Foo();
+
+// This should invalidate the Foo code dependency.
+Foo.__proto__ = [1];
+
+// Should throw an exception because the super constructor is no longer a
+// constructor (but an array).
+assertThrows(()=>new Foo());
diff --git a/deps/v8/test/mjsunit/regress/regress-1476828.js b/deps/v8/test/mjsunit/regress/regress-1476828.js
new file mode 100644
index 00000000000000..de41522025e8e9
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-1476828.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+function foo(arg) {
+  if (arg.f)
+    return true;
+  else
+    return false;
+}
+
+let o = {f: %GetUndetectable()};
+
+%PrepareFunctionForOptimization(foo);
+assertFalse(foo(o));
+assertFalse(foo(o));
+%OptimizeMaglevOnNextCall(foo);
+assertFalse(foo(o));
diff --git a/deps/v8/test/mjsunit/regress/regress-1757.js b/deps/v8/test/mjsunit/regress/regress-1757.js
index a850f70c6532df..9f214a541f0995 100644
--- a/deps/v8/test/mjsunit/regress/regress-1757.js
+++ b/deps/v8/test/mjsunit/regress/regress-1757.js
@@ -28,6 +28,8 @@
 // Flags: --string-slices --expose-externalize-string
 
 var a = "internalized dummy";
-a = "abcdefghijklmnopqrstuvqxy"+"z";
-externalizeString(a, true);
+a = createExternalizableString(
+    'abcdefghijklmnopqrstuvqxy' +
+    'z 🤓');
+externalizeString(a);
 assertEquals('b', a.substring(1).charAt(0));
diff --git a/deps/v8/test/mjsunit/regress/regress-2618.js b/deps/v8/test/mjsunit/regress/regress-2618.js
index 7787e65012c505..f78ec771875a3c 100644
--- a/deps/v8/test/mjsunit/regress/regress-2618.js
+++ b/deps/v8/test/mjsunit/regress/regress-2618.js
@@ -26,7 +26,7 @@
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 // Flags: --use-osr --allow-natives-syntax --turbofan
-// Flags: --no-always-turbofan
+// Flags: --no-always-turbofan --no-maglev-osr
 
 // Can't OSR with always-turbofan or in Lite mode.
 if (isNeverOptimizeLiteMode()) {
diff --git a/deps/v8/test/mjsunit/regress/regress-4578-deopt.js b/deps/v8/test/mjsunit/regress/regress-4578-deopt.js
new file mode 100644
index 00000000000000..f7d390a82fccb8
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-4578-deopt.js
@@ -0,0 +1,71 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --expose-gc --turbofan --no-concurrent-recompilation
+// Flags: --no-always-turbofan --no-assert-types
+
+// This weak ref is for checking whether the closure-allocated object o got
+// collected as it should.
+var weak;
+
+// Return a function which refers to a variable from its enclosing function.
+function makeFn() {
+  var o = {};
+  weak = new WeakRef(o);
+  o.num = 0;
+  return () => { return ++o.num; };
+}
+
+// This is the opposite case of regress-4578.js: if an optimized function's
+// Code is currently running at the time of gc, then it must keep its
+// deoptimization data alive.
+
+// A wrapper function which causes a GC internally.
+function h(f) {
+  gcAndCheckState();  // Non-inlined call
+  f();  // Inlined call
+}
+
+var doCheck = false;
+function gcAndCheckState() {
+  if (!doCheck) return;
+
+  // It's possible that h has already deoptimized by this point if
+  // --stress-incremental-marking caused additional gc cycles.
+  var optimized = isOptimized(h);
+
+  gc();
+
+  // If the optimized code for h is still on the stack, then it must not clear
+  // out its own deoptimization data. Eventually h will deopt due to the wrong
+  // function being passed, but only after this function has returned.
+  if (optimized) {
+    assertNotEquals(undefined, weak.deref());
+  } else {
+    // Due to conservative stack scanning, which could keep objects from being
+    // reclaimed by the above GC, it is not always guaranteed that the weak
+    // reference will have been cleared if the function has been deoptimized.
+  }
+}
+
+// Don't inline gcAndCheckState, to avoid the possibility that its content
+// could cause h to deoptimize.
+%NeverOptimizeFunction(gcAndCheckState);
+
+// Optimize h to inline a specific function instance, and then drop all
+// user-visible references to that inlined function.
+(function () {
+  var fn = makeFn();
+  %PrepareFunctionForOptimization(h);
+  %PrepareFunctionForOptimization(fn);
+  h(fn);
+  %OptimizeFunctionOnNextCall(h);
+  h(fn);
+})();
+
+// Defer again so the WeakRef can expire.
+setTimeout(() => {
+  doCheck = true;
+  h(() => {});
+}, 0);
diff --git a/deps/v8/test/mjsunit/regress/regress-4578.js b/deps/v8/test/mjsunit/regress/regress-4578.js
index 99b58d521fce6a..d60acd889ddf3c 100644
--- a/deps/v8/test/mjsunit/regress/regress-4578.js
+++ b/deps/v8/test/mjsunit/regress/regress-4578.js
@@ -37,59 +37,14 @@ function g(f) {
 setTimeout(() => {
   // Since the function inlined by g no longer exists, it should deopt and
   // release the inner function.
-  gc();
-
-  // Check that the memory leak described in v8:4578 no longer happens.
-  assertEquals(undefined, weak.deref());
-
-  // Next, let's check the opposite case: if an optimized function's Code is
-  // currently running at the time of gc, then it must keep its deoptimization
-  // data alive.
-
-  // Another simple wrapper function, but this one causes a GC internally.
-  function h(f) {
-    gcAndCheckState();  // Non-inlined call
-    f();  // Inlined call
-  }
-
-  var doCheck = false;
-  function gcAndCheckState() {
-    if (!doCheck) return;
-
-    // It's possible that h has already deoptimized by this point if
-    // --stress-incremental-marking caused additional gc cycles.
-    var optimized = isOptimized(h);
-
-    gc();
-
-    // If the optimized code for h is still on the stack, then it must not clear
-    // out its own deoptimization data. Eventually h will deopt due to the wrong
-    // function being passed, but only after this function has returned.
-    if (optimized) {
-      assertNotEquals(undefined, weak.deref());
-    } else {
-      assertEquals(undefined, weak.deref());
-    }
-  }
-
-  // Don't inline gcAndCheckState, to avoid the possibility that its content
-  // could cause h to deoptimize.
-  %NeverOptimizeFunction(gcAndCheckState);
-
-  // Optimize h to inline a specific function instance, and then drop all
-  // user-visible references to that inlined function.
-  (function () {
-    var fn = makeFn();
-    %PrepareFunctionForOptimization(h);
-    %PrepareFunctionForOptimization(fn);
-    h(fn);
-    %OptimizeFunctionOnNextCall(h);
-    h(fn);
+  // We need to invoke GC asynchronously and wait for it to finish, so that
+  // it doesn't need to scan the stack. Otherwise, the objects may not be
+  // reclaimed because of conservative stack scanning and the test may not
+  // work as intended.
+  (async function () {
+    await gc({ type: 'major', execution: 'async' });
+
+    // Check that the memory leak described in v8:4578 no longer happens.
+    assertEquals(undefined, weak.deref());
   })();
-
-  // Defer again so the WeakRef can expire.
-  setTimeout(() => {
-    doCheck = true;
-    h(() => {});
-  }, 0);
 }, 0);
diff --git a/deps/v8/test/mjsunit/regress/regress-740784.js b/deps/v8/test/mjsunit/regress/regress-740784.js
index 920f9f1d43d5dc..b546a3e9843b3f 100644
--- a/deps/v8/test/mjsunit/regress/regress-740784.js
+++ b/deps/v8/test/mjsunit/regress/regress-740784.js
@@ -3,6 +3,8 @@
 // found in the LICENSE file.
 
 // Flags: --allow-natives-syntax --expose-gc --turbo-inline-array-builtins
+// This test is too slow with stress-incremental-marking, especially in TSAN.
+// Flags: --no-stress-incremental-marking
 
 "".stack;;var isNeverOptimize;var isAlwaysOptimize;var isInterpreted;var isOptimized;var isCrankshafted;var isTurboFanned;var failWithMessage;(function(){{;}
 function PrettyPrint(){switch(typeof value){case"string":return JSON.stringify();case"number":if(1/value<0);case"object":if(value===null);switch(objectClass){case"Number":case"String":case"Boolean":case"Date":return objectClass+"("+PrettyPrint();return objectClass+"(["+joined+"])";case"Object":break;default:return objectClass+"()";}
diff --git a/deps/v8/test/mjsunit/regress/regress-7642.js b/deps/v8/test/mjsunit/regress/regress-7642.js
index fa9f023e8ba6b4..c2aa16f14560cd 100644
--- a/deps/v8/test/mjsunit/regress/regress-7642.js
+++ b/deps/v8/test/mjsunit/regress/regress-7642.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-public-fields
-
 const a = [2];
 const b = [4];
 
diff --git a/deps/v8/test/mjsunit/regress/regress-842078.js b/deps/v8/test/mjsunit/regress/regress-842078.js
index 9ce6aecfd6e43e..d8e51dba45a11b 100644
--- a/deps/v8/test/mjsunit/regress/regress-842078.js
+++ b/deps/v8/test/mjsunit/regress/regress-842078.js
@@ -6,9 +6,4 @@
 
 // Attempt to externalize a string that's in RO_SPACE, which is not allowed as
 // the string's map would need to be writable.
-assertThrows(() => {
-  externalizeString("1", false)
-});
-assertThrows(() => {
-  externalizeString("1", true)
-});
+assertThrows(() => {externalizeString('1')});
diff --git a/deps/v8/test/mjsunit/regress/regress-chromium-1194026.js b/deps/v8/test/mjsunit/regress/regress-chromium-1194026.js
index 2b5f5c691234e5..943b01cad2bb9a 100644
--- a/deps/v8/test/mjsunit/regress/regress-chromium-1194026.js
+++ b/deps/v8/test/mjsunit/regress/regress-chromium-1194026.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
-
 function workerCode1() {
   onmessage = function(e) {
     const a = new Int32Array(e.sab);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1321899.js b/deps/v8/test/mjsunit/regress/regress-crbug-1321899.js
index 7b4db76cd5d688..a9f234ecd38814 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1321899.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1321899.js
@@ -148,25 +148,3 @@ function checkNoAccess(object, message) {
   assertThrows(() => E.getMethod(object), Error, message);
   assertThrows(() => E.hasMethod(object), Error, message);
 }
-
-function checkNoAccessNoThrow(object) {
-  // The failed access check callback is supposed to throw.
-  // If it doesn't the behavior is quite quirky.
-  // This only documents the current behavior.
-  new B(object);
-  new C(object);
-  new D(object);
-  new E(object);
-  B.setField(object);
-  assertEquals(undefined, B.getField(object));
-  assertFalse(B.hasField(object));
-  C.setField(object);
-  assertEquals(undefined, C.getField(object));
-  assertFalse(C.hasField(object));
-  D.setAccessor(object)
-  assertEquals("d", D.getAccessor(object));
-  assertFalse(D.hasAccessor(object));
-  assertThrows(() => E.setMethod(object), TypeError, /Private method '#e' is not writable/);
-  assertEquals(0, E.getMethod(object)());
-  assertFalse(E.hasMethod(object));
-}
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-2.js b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-2.js
index d9b0cb9c045c5f..00abc349c998ab 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-2.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-2.js
@@ -2,6 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --no-lazy-feedback-allocation --throw-on-failed-access-check
+// Flags: --no-lazy-feedback-allocation
 
 d8.file.execute('test/mjsunit/regress/regress-crbug-1339722.js');
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-3.js b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-3.js
index 6be5aa903baf8d..b723cbcb2d9170 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-3.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-3.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --throw-on-failed-access-check
-
 d8.file.execute('test/mjsunit/regress/regress-crbug-1321899.js');
 
 // Attached global should have access
@@ -15,4 +13,4 @@ checkHasAccess(globalProxy);
 // Access should fail after detaching
 Realm.navigate(realm);
 
-checkNoAccess(globalProxy, /Error in failed access check callback/);
+checkNoAccess(globalProxy, /no access/);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-4.js b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-4.js
index 96fcf9370f0c89..312a4118ac5fc1 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-4.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-4.js
@@ -2,6 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --no-lazy-feedback-allocation --throw-on-failed-access-check
+// Flags: --no-lazy-feedback-allocation
 
 d8.file.execute('test/mjsunit/regress/regress-crbug-1339722-3.js');
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-5.js b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-5.js
index 0ffcb534812fb6..063850f1300138 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-5.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-5.js
@@ -2,13 +2,19 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --noop-on-failed-access-check
-
 d8.file.execute('test/mjsunit/regress/regress-crbug-1321899.js');
 
 const realm = Realm.create();
 const globalProxy = Realm.global(realm);
 
-new B(globalProxy);
-B.setField(globalProxy);
-assertEquals(undefined, B.getField(globalProxy));
+assertThrows(() => {
+  new B(globalProxy);
+}, TypeError, /no access/);
+
+assertThrows(() => {
+  B.setField(globalProxy);
+}, TypeError, /no access/);
+
+assertThrows(() => {
+  B.getField(globalProxy);
+}, TypeError, /no access/);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-7.js b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-7.js
index 4e0489baac22d2..70085ffd056874 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-7.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-7.js
@@ -2,8 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --noop-on-failed-access-check
-
 d8.file.execute('test/mjsunit/regress/regress-crbug-1321899.js');
 
 const realm = Realm.createAllowCrossRealmAccess();
@@ -13,4 +11,4 @@ checkHasAccess(globalProxy);
 
 Realm.navigate(realm);
 
-checkNoAccessNoThrow(globalProxy);
+checkNoAccess(globalProxy);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-8.js b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-8.js
index 3b6a5ed9234528..ef721bb0d57ac9 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1339722-8.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1339722-8.js
@@ -2,6 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --no-lazy-feedback-allocation --noop-on-failed-access-check
+// Flags: --no-lazy-feedback-allocation
 
 d8.file.execute('test/mjsunit/regress/regress-crbug-1339722-7.js');
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1339722.js b/deps/v8/test/mjsunit/regress/regress-crbug-1339722.js
index 77f1d3a5b78264..675fee46265c8a 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1339722.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1339722.js
@@ -2,11 +2,9 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --throw-on-failed-access-check
-
 d8.file.execute('test/mjsunit/regress/regress-crbug-1321899.js');
 
 const realm = Realm.create();
 const globalProxy = Realm.global(realm);
 
-checkNoAccess(globalProxy, /Error in failed access check callback/);
+checkNoAccess(globalProxy, /no access/);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1350270.js b/deps/v8/test/mjsunit/regress/regress-crbug-1350270.js
deleted file mode 100644
index 0656350ae4e4a2..00000000000000
--- a/deps/v8/test/mjsunit/regress/regress-crbug-1350270.js
+++ /dev/null
@@ -1,19 +0,0 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --expose-externalize-string
-let str1 = "external string turned into two byte";
-let str2 = str1.substring(1);
-try {
-  // Turn the string to a two-byte external string, so that the sliced
-  // string looks like one-byte, but its parent is actually two-byte.
-  externalizeString(str1, true);
-} catch (e) { }
-assertEquals(
-  ["x", "t", "e", "r", "n", "a", "l", " ",
-  "s", "t", "r", "i", "n", "g", " ",
-  "t", "u", "r", "n", "e", "d", " ",
-  "i", "n", "t", "o", " ",
-  "t", "w", "o", " ",
-  "b", "y", "t", "e"], str2.split(""));
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1412001.js b/deps/v8/test/mjsunit/regress/regress-crbug-1412001.js
new file mode 100644
index 00000000000000..c40d0559dcf811
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1412001.js
@@ -0,0 +1,25 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-rab-gsab --allow-natives-syntax --turbo-rab-gsab
+
+const ab = new ArrayBuffer(100, {maxByteLength: 200});
+var dv = new DataView(ab, 0, 8); // "var" is important
+
+function foo() {
+  return dv.getInt8(0);
+}
+
+%PrepareFunctionForOptimization(foo);
+foo();
+
+%OptimizeFunctionOnNextCall(foo);
+foo();
+
+ab.resize(0);
+
+try {
+ foo();
+} catch {
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1412487.js b/deps/v8/test/mjsunit/regress/regress-crbug-1412487.js
new file mode 100644
index 00000000000000..4c457df956e6aa
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1412487.js
@@ -0,0 +1,34 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const arr = [];
+const obj0 = {a : 1};
+obj0.a1 = 2;
+obj0.c = {};
+
+const obj = {a : 1};
+obj.a1 = 2;
+obj.c = arr;
+
+const f1 = {a : 1};
+f1.a1 = 1.1;
+arr.push(f1);
+
+for (i = 0; i < 1600; i++) {
+  const tmp = {a : 1};
+  tmp.a1 = 1;
+  tmp['b' + i] = 2;
+  arr.push(tmp);
+}
+
+function workerCode() {
+  onmessage = function(data) {
+    postMessage('done');
+  }
+}
+
+worker = new Worker(workerCode, {type: 'function', arguments: []});
+worker.postMessage([obj0, obj]);
+
+assertEquals('done', worker.getMessage());
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1426357.js b/deps/v8/test/mjsunit/regress/regress-crbug-1426357.js
new file mode 100644
index 00000000000000..7dfca30344ddda
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1426357.js
@@ -0,0 +1,19 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Fast array fill should be robust against evil object coercions.
+
+(function TestStart() {
+  let arr = [1,2,3,4];
+  arr.fill(42, { toString() { arr.length = 0; } });
+  assertEquals(4, arr.length);
+  assertEquals([42,42,42,42], arr);
+})();
+
+(function TestEnd() {
+  let arr = [1,2,3,4];
+  arr.fill(42, 0, { toString() { arr.length = 0; return 4; } });
+  assertEquals(4, arr.length);
+  assertEquals([42,42,42,42], arr);
+})();
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1428465.js b/deps/v8/test/mjsunit/regress/regress-crbug-1428465.js
new file mode 100644
index 00000000000000..0886d4f8e120c2
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1428465.js
@@ -0,0 +1,9 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+try {
+  const v2 = new Int32Array(0xFFFF);
+  this.WebAssembly.Memory.apply(this, v2);
+} catch(e) {
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1431046.js b/deps/v8/test/mjsunit/regress/regress-crbug-1431046.js
new file mode 100644
index 00000000000000..b45dd28cd4171e
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1431046.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-lazy-feedback-allocation
+
+function foo() {
+  Object.defineProperty({}, undefined, { set: function () {} });
+  obj = {};
+  Object.defineProperty(obj, undefined, { get: function () {} });
+  obj.x = 0;
+  obj.y = 0;
+  obj[Symbol.toStringTag] = "foo";
+}
+foo();
+assertEquals('[object foo]', obj.toString());
+foo();
+assertEquals('[object foo]', obj.toString());
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1437346.js b/deps/v8/test/mjsunit/regress/regress-crbug-1437346.js
new file mode 100644
index 00000000000000..d94789c0e5fdf4
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1437346.js
@@ -0,0 +1,5 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+assertFalse(/[\P{Any}]/v.test());
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1439691.js b/deps/v8/test/mjsunit/regress/regress-crbug-1439691.js
new file mode 100644
index 00000000000000..6c55835535ab4f
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1439691.js
@@ -0,0 +1,7 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function f0() {
+}
+/(?!(a))\1/gudyi[Symbol.replace]("f\uD83D\uDCA9ba\u2603", f0);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1440685.js b/deps/v8/test/mjsunit/regress/regress-crbug-1440685.js
new file mode 100644
index 00000000000000..a743698dc807c6
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1440685.js
@@ -0,0 +1,7 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+Reflect.get(new Error(), "stack", false);
+assertThrows(() => Reflect.get(new Error(), "stack", null), TypeError);
+assertThrows(() => Reflect.get(new Error(), "stack", undefined), TypeError);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1441241.js b/deps/v8/test/mjsunit/regress/regress-crbug-1441241.js
new file mode 100644
index 00000000000000..65942d44b0632e
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1441241.js
@@ -0,0 +1,61 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+(function TestRegularFunction() {
+  function f(a) {
+    a.stack = "boom";
+  }
+  %PrepareFunctionForOptimization(f);
+  Error.captureStackTrace(f);
+  f(f);
+})();
+
+(function TestFunctionConstructor() {
+  function f(a) {
+    a.stack = "boom";
+  }
+  %PrepareFunctionForOptimization(f);
+  Error.captureStackTrace(Function);
+  f(Function);
+})();
+
+(function TestArrowFunction() {
+  function f(a) {
+    a.stack = "boom";
+  }
+  %PrepareFunctionForOptimization(f);
+
+  const arrow = a => {};
+
+  Error.captureStackTrace(arrow);
+  f(arrow);
+})();
+
+(function TestClass() {
+  function f(a) {
+    a.stack = "boom";
+  }
+  %PrepareFunctionForOptimization(f);
+
+  class A {};
+
+  Error.captureStackTrace(A);
+  f(A);
+})();
+
+(function TestStaticMethod() {
+  function f(a) {
+    a.stack = "boom";
+  }
+  %PrepareFunctionForOptimization(f);
+
+  class A {
+    static m() {}
+  };
+
+  Error.captureStackTrace(A.m);
+  f(A.m);
+})();
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1441254.js b/deps/v8/test/mjsunit/regress/regress-crbug-1441254.js
new file mode 100644
index 00000000000000..bf24675850c88f
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1441254.js
@@ -0,0 +1,36 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --stress-lazy-compilation=100 --throws
+
+var counter = 0;
+
+let k = 0;
+for (k = 0; k < 50; k++) {
+  let src = `
+    function g() {
+      var C = class C${k} {
+        static sx = counter++;
+        x = counter++;
+        static {
+          counter++;
+        }
+        #y = counter++;
+        z = counter++;
+      }
+      return C;
+    }
+  `;
+  eval(src);
+  for (let j = 0; j < 5; j++) {
+    try {
+      var C = g();
+    } catch(e) {
+      // Ignore potential stack overflows.
+    }
+  }
+  new C();
+}
+
+throw Error("success");
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1442801.js b/deps/v8/test/mjsunit/regress/regress-crbug-1442801.js
new file mode 100644
index 00000000000000..8fee951d222651
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1442801.js
@@ -0,0 +1,11 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-fail
+
+d8.debugger.enable();
+eval(`import('I-do-not-exist.js');`);
+// Cause a pending termination that needs to be handled
+// in DoHostImportModuleDynamically.
+d8.terminate();
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1443001.js b/deps/v8/test/mjsunit/regress/regress-crbug-1443001.js
new file mode 100644
index 00000000000000..edb57b85d8c2c5
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1443001.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-async-hooks --strict-termination-checks --no-fail
+
+try {
+  let hook = async_hooks.createHook({
+    init: function() {
+      d8.terminate();
+      Object.getOwnPropertyNames({});
+    }
+  });
+  hook.enable();
+  WebAssembly.compile(959070);
+} catch(e) {
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1443133.js b/deps/v8/test/mjsunit/regress/regress-crbug-1443133.js
new file mode 100644
index 00000000000000..03a78df27e0ac8
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1443133.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --throws
+
+function r() {
+  return new Promise((resolve, reject) => {
+    throw new Error("boom");
+  });
+}
+
+function main() {
+  [].values().__proto__.return = r;
+  try {
+    new WeakSet([1]);
+  } catch (err) {}
+}
+
+%PrepareFunctionForOptimization(r);
+main();
+%OptimizeFunctionOnNextCall(r);
+main();
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1444134.js b/deps/v8/test/mjsunit/regress/regress-crbug-1444134.js
new file mode 100644
index 00000000000000..4e6345e13d798b
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1444134.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function f() {}
+f.prototype = 42;
+
+function g(a) {
+  a.stack;
+}
+
+%PrepareFunctionForOptimization(g);
+Error.captureStackTrace(f);
+g(f);
+g(f);
+g(f);
+%OptimizeFunctionOnNextCall(g);
+g(f);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1445228.js b/deps/v8/test/mjsunit/regress/regress-crbug-1445228.js
new file mode 100644
index 00000000000000..45d5d2ff03ca8f
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1445228.js
@@ -0,0 +1,7 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const AF = async function () {}.constructor;
+class C extends AF {}
+var f = new C("'use strict';");
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1445235.js b/deps/v8/test/mjsunit/regress/regress-crbug-1445235.js
new file mode 100644
index 00000000000000..058335413e5edd
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1445235.js
@@ -0,0 +1,14 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function getRandomProperty(v, rand) { var properties = Object.getOwnPropertyNames(v); var proto = Object.getPrototypeOf(v); if (proto) { properties = properties.concat(Object.getOwnPropertyNames(proto)); } if (properties.includes() && v.constructor.hasOwnProperty()) { properties = properties.Object.v.constructor.__proto__; } if (properties.length == 0) { return "0"; } return properties[rand % properties.length]; }
+function __f_0() {};
+__f_0.prototype = 42;
+__f_0.prototype = { a: 42 };
+function __f_2(__v_0) {
+  __v_0.__defineSetter__(getRandomProperty(__v_0, 1409152743), function() { this[getRandomProperty()] = v; ; });
+};
+function __f_5() { }
+ __f_2(__f_5);
+__f_0.prototype, __f_2(__f_0);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1447430.js b/deps/v8/test/mjsunit/regress/regress-crbug-1447430.js
new file mode 100644
index 00000000000000..c7bb3e72e3af1b
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1447430.js
@@ -0,0 +1,34 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+var s = %CreatePrivateSymbol('x');
+
+(function TestSmi() {
+  function f(o, p) {
+    o[p] = 153;
+  }
+  (1).__proto__[s] = 42;
+  %PrepareFunctionForOptimization(f);
+  assertEquals(f(42, s), undefined);
+}());
+
+(function TestString() {
+  function f(o, p) {
+    o[p] = 153;
+  }
+  ('xyz').__proto__[s] = 42;
+  %PrepareFunctionForOptimization(f);
+  assertEquals(f('abc', s), undefined);
+}());
+
+(function TestSymbol() {
+  function f(o, p) {
+    o[p] = 153;
+  }
+  Symbol('xyz').__proto__[s] = 42;
+  %PrepareFunctionForOptimization(f);
+  assertEquals(f(Symbol('abc'), s), undefined);
+}());
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1448545.js b/deps/v8/test/mjsunit/regress/regress-crbug-1448545.js
new file mode 100644
index 00000000000000..e6b15d2d0e289e
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1448545.js
@@ -0,0 +1,153 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --fuzzing
+
+// --fuzzing is required to trigger the bug since it does a second compile
+// --that'll check for identical bytecode.
+
+// Make more lexical bindings that need hole checks due to uses in inner
+// functions than a 64-bitmap can hold.
+let v1 = 0;
+let v2 = 0;
+let v3 = 0;
+let v4 = 0;
+let v5 = 0;
+let v6 = 0;
+let v7 = 0;
+let v8 = 0;
+let v9 = 0;
+let v10 = 0;
+let v11 = 0;
+let v12 = 0;
+let v13 = 0;
+let v14 = 0;
+let v15 = 0;
+let v16 = 0;
+let v17 = 0;
+let v18 = 0;
+let v19 = 0;
+let v20 = 0;
+let v21 = 0;
+let v22 = 0;
+let v23 = 0;
+let v24 = 0;
+let v25 = 0;
+let v26 = 0;
+let v27 = 0;
+let v28 = 0;
+let v29 = 0;
+let v30 = 0;
+let v31 = 0;
+let v32 = 0;
+let v33 = 0;
+let v34 = 0;
+let v35 = 0;
+let v36 = 0;
+let v37 = 0;
+let v38 = 0;
+let v39 = 0;
+let v40 = 0;
+let v41 = 0;
+let v42 = 0;
+let v43 = 0;
+let v44 = 0;
+let v45 = 0;
+let v46 = 0;
+let v47 = 0;
+let v48 = 0;
+let v49 = 0;
+let v50 = 0;
+let v51 = 0;
+let v52 = 0;
+let v53 = 0;
+let v54 = 0;
+let v55 = 0;
+let v56 = 0;
+let v57 = 0;
+let v58 = 0;
+let v59 = 0;
+let v60 = 0;
+let v61 = 0;
+let v62 = 0;
+let v63 = 0;
+let v64 = 0;
+
+function someUses() {
+  v1 = 0;
+  v2 = 0;
+  v3 = 0;
+  v4 = 0;
+  v5 = 0;
+  v6 = 0;
+  v7 = 0;
+  v8 = 0;
+  v9 = 0;
+  v10 = 0;
+  v11 = 0;
+  v12 = 0;
+  v13 = 0;
+  v14 = 0;
+  v15 = 0;
+  v16 = 0;
+  v17 = 0;
+  v18 = 0;
+  v19 = 0;
+  v20 = 0;
+  v21 = 0;
+  v22 = 0;
+  v23 = 0;
+  v24 = 0;
+  v25 = 0;
+  v26 = 0;
+  v27 = 0;
+  v28 = 0;
+  v29 = 0;
+  v30 = 0;
+  v31 = 0;
+  v32 = 0;
+  v33 = 0;
+  v34 = 0;
+  v35 = 0;
+  v36 = 0;
+  v37 = 0;
+  v38 = 0;
+  v39 = 0;
+  v40 = 0;
+  v41 = 0;
+  v42 = 0;
+  v43 = 0;
+  v44 = 0;
+  v45 = 0;
+  v46 = 0;
+  v47 = 0;
+  v48 = 0;
+  v49 = 0;
+  v50 = 0;
+  v51 = 0;
+  v52 = 0;
+  v53 = 0;
+  v54 = 0;
+  v55 = 0;
+  v56 = 0;
+  v57 = 0;
+  v58 = 0;
+  v59 = 0;
+  v60 = 0;
+  v61 = 0;
+  v62 = 0;
+  v63 = 0;
+  v64 = 0;
+}
+
+// Make another lexical binding that needs hole checks in the same scope with
+// some uses that can be elided. Both the first and second compiles should be
+// able to elide the subsequent use.
+try {
+  x = 42;
+  x = 42;
+} catch (e) {
+}
+
+let x = 0;
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1449054.js b/deps/v8/test/mjsunit/regress/regress-crbug-1449054.js
new file mode 100644
index 00000000000000..5517ad97615d24
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1449054.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+class C1 {
+    constructor(a3) {
+        class C6 extends C1 {
+            [this] = undefined;
+            static 1 = a3;
+            static {
+               super.p();
+            }
+        }
+    }
+}
+assertThrows(() => new C1(), TypeError);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1451644.js b/deps/v8/test/mjsunit/regress/regress-crbug-1451644.js
new file mode 100644
index 00000000000000..e3df12641759d7
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1451644.js
@@ -0,0 +1,56 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --maglev --allow-natives-syntax
+
+function f(a, b) {
+  // This access site has seen PACKED_DOUBLE_ELEMENTS (transition to
+  // HOLEY_DOUBLE_ELEMENTS).
+  b[13] = 0;
+
+  // This access site has seen HOLEY_DOUBLE_ELEMENTS and HOLEY_ELEMENTS.
+  // HOLEY_DOUBLE_ELEMENTS can transition to HOLEY_ELEMENTS.
+  a[0] = 0;
+
+  // This access site has seen only HOLEY_DOUBLE_ELEMENTS.
+  b[0] = 9.431092e-317;
+}
+%PrepareFunctionForOptimization(f);
+
+// Call 1
+let o1a = new Array(1);
+o1a[0] = 'a'; // HOLEY_ELEMENTS
+
+let o1b = [2147483648]; // PACKED_DOUBLE_ELEMENTS
+
+// Before:
+// HOLEY_ELEMENTS, PACKED_DOUBLE_ELEMENTS
+f(o1a, o1b);
+// After:
+// HOLEY_ELEMENTS, HOLEY_DOUBLE_ELEMENTS
+
+// Call 2
+let o2a = [0.1]; // PACKED_DOUBLE_ELEMENTS
+
+// Before:
+// PACKED_DOUBLE_ELEMENTS, PACKED_DOUBLE_ELEMENTS
+f(o2a, o2a);
+// After:
+// HOLEY_DOUBLE_ELEMENTS, HOLEY_DOUBLE_ELEMENTS
+
+// Call 3
+let o3 = [, 0.2];
+
+%OptimizeMaglevOnNextCall(f);
+
+// Before: HOLEY_DOUBLE_ELEMENTS, HOLEY_DOUBLE_ELEMENTS.
+f(o3, o3);
+
+// The bug was: after the first store (b[13] = 0) we know what b has the map
+// HOLEY_DOUBLE_ELEMENTS. However, we failed to track that that map is
+// unstable. For the second store (a[0] = 0), we create a transition from
+// HOLEY_DOUBLE_ELEMENTS to HOLEY_ELEMENTS. This will also transition b because
+// they're the same object. And since we failed to track that the
+// HOLEY_DOUBLE_ELEMENTS map is unstable, we didn't take into account that b
+// might change maps while the code is executing.
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1453718.js b/deps/v8/test/mjsunit/regress/regress-crbug-1453718.js
new file mode 100644
index 00000000000000..1709722c7f87ae
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1453718.js
@@ -0,0 +1,14 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+const o0 = {};
+for (let v1 = 0; v1 < 10; v1++) {
+  const t3 ="imul".constructor;
+  const v4 = new t3();
+  v4.charCodeAt();
+  class C7 extends o0.constructor {
+    static [v4];
+  }
+  v4.toLowerCase();
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1454482.js b/deps/v8/test/mjsunit/regress/regress-crbug-1454482.js
new file mode 100644
index 00000000000000..afbac54c7e08ec
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1454482.js
@@ -0,0 +1,5 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+assertEquals([".a"], ".a".match(/^(?:\.[^@])+$/v));
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1454650.js b/deps/v8/test/mjsunit/regress/regress-crbug-1454650.js
new file mode 100644
index 00000000000000..6294d7b49b1765
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1454650.js
@@ -0,0 +1,25 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-rab-gsab
+
+const gsab = new SharedArrayBuffer(100, {maxByteLength: 200});
+const ta = new Int8Array(1);
+class c extends Int8Array {
+  constructor() {
+    super(gsab);
+  }
+}
+ta.constructor = c;
+const mapper_params = [];
+function mapper(x) {
+  mapper_params.push(x);
+  return x + 1;
+}
+const mapped = ta.map(mapper);
+assertEquals([0], mapper_params);
+// `mapped` is length-tracking with `gsab` as a backing buffer.
+assertEquals(gsab.byteLength, mapped.length);
+assertEquals(1, mapped[0]);
+assertEquals(gsab, mapped.buffer);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1455707.js b/deps/v8/test/mjsunit/regress/regress-crbug-1455707.js
new file mode 100644
index 00000000000000..d688e94fc7e96a
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1455707.js
@@ -0,0 +1,49 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --jit-fuzzing
+
+for (let v0 = 0; v0 < 5; v0++) {
+    function f1() {
+        return v0;
+    }
+    function f2() {
+        return f2;
+    }
+    const v3 = f1.prototype;
+    v3.f = f2;
+    function f4() {
+        [v3,v3,v3];
+    }
+    function f6() {
+        function f7(a8, a9, a10) {
+            const o11 = {
+            };
+            const o12 = {
+            };
+            o11.__proto__ = o12;
+            const o13 = {
+            };
+            const t21 = o11.__proto__;
+            t21.__proto__ = o13;
+            for (let v15 = 0; v15 < 5; v15++) {
+            }
+            return a10;
+        }
+        f7(v3, f7, v0);
+        return f4;
+    }
+    const t30 = f4.prototype;
+    t30.f = f6;
+    const v18 = new f1();
+    const v19 = new f4();
+    function f20(a21) {
+        const t35 = a21.f();
+        return t35();
+    }
+    %PrepareFunctionForOptimization(f20);
+    f20(v18);
+    f20(v19);
+    const v26 = %OptimizeFunctionOnNextCall(f20);
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1458565.js b/deps/v8/test/mjsunit/regress/regress-crbug-1458565.js
new file mode 100644
index 00000000000000..56dab9dd4eb345
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1458565.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+class C1 {
+  constructor() {
+    const o = {
+      boom() {
+        class C2 extends super.constructor {
+          static boom_s = 42();
+        };
+        return C2;
+      },
+    };
+    o.boom();
+
+    // Needed to make sure constructor has a context.
+    function F17() {
+      o;
+    }
+  }
+}
+assertThrows(() => { new C1(); }, TypeError);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1459172.js b/deps/v8/test/mjsunit/regress/regress-crbug-1459172.js
new file mode 100644
index 00000000000000..00dd4124049320
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1459172.js
@@ -0,0 +1,31 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --harmony-rab-gsab
+
+{
+  const rab = new ArrayBuffer(1, {maxByteLength: 2});
+  const ta = new Int8Array(rab, 0, 1);
+  function ctor() {
+    return ta;
+  }
+  ctor[Symbol.species] = ctor;
+  ta.constructor = ctor;
+  assertThrows(() => { ta.map(_ => rab.resize(0)); });
+}
+
+{
+  const ab = new ArrayBuffer(1);
+  const ta1 = new Int8Array(ab, 0, 1);
+
+  const rab = new ArrayBuffer(1, {maxByteLength: 2});
+  const ta2 = new Int8Array(rab, 0, 1);
+
+  function ctor() {
+    return ta2;
+  }
+  ctor[Symbol.species] = ctor;
+  ta1.constructor = ctor;
+  ta1.map(_ => rab.resize(0));
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1467028.js b/deps/v8/test/mjsunit/regress/regress-crbug-1467028.js
new file mode 100644
index 00000000000000..893b0ad47f0472
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1467028.js
@@ -0,0 +1,15 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var o;
+function f() {
+  "use strict";
+  class C {
+    static {
+      o.boom;
+    }
+  }
+  return C;
+}
+assertThrows(f, TypeError, /Cannot read properties of undefined/);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1472121.js b/deps/v8/test/mjsunit/regress/regress-crbug-1472121.js
new file mode 100644
index 00000000000000..8ef9656b602b0a
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1472121.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+let a = {p0: 1, p1: 1, p2: 1, p3: 1, p4: 1, p5: 1, p6: 1, p7: 1, p8: 1};
+a.p9 = 1;
+function throwaway() {
+  return {...a, __proto__: null};
+}
+  for (let j = 0; j < 100; ++j)  // IC
+    throwaway();
+  for (let key in a) a[key] = {};
+function func() {
+  return {...a, __proto__: null};
+}
+for (let j = 0; j < 100; ++j)  // IC
+corrupted = func();
+corrupted.p9 = 0x42424242 >> 1;
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1475885.js b/deps/v8/test/mjsunit/regress/regress-crbug-1475885.js
new file mode 100644
index 00000000000000..788022e456caf3
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1475885.js
@@ -0,0 +1,22 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+function F0() {
+}
+function f6(a7) {
+    let v8 = 2147483647;
+    if (a7) {
+        v8 = -NaN;
+    }
+    let v11 = 1;
+    v11--;
+    assertTrue(isNaN(v8 / v11));
+}
+f6(F0);
+%PrepareFunctionForOptimization(f6);
+f6(F0);
+%OptimizeFunctionOnNextCall(f6);
+f6(F0);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1487583.js b/deps/v8/test/mjsunit/regress/regress-crbug-1487583.js
new file mode 100644
index 00000000000000..b1e684ad2f720b
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-1487583.js
@@ -0,0 +1,22 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax
+
+// Triggers mutual inlining.
+function bar(x) {
+  foo([]);
+}
+function foo(arr) {
+  arr.forEach(bar);
+}
+
+foo([]);
+%PrepareFunctionForOptimization(foo);
+%PrepareFunctionForOptimization(bar);
+foo([]);
+bar([]);
+foo([]);
+%OptimizeFunctionOnNextCall(foo);
+foo([]);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-229923.js b/deps/v8/test/mjsunit/regress/regress-crbug-229923.js
deleted file mode 100644
index 95c0dedefd6f3e..00000000000000
--- a/deps/v8/test/mjsunit/regress/regress-crbug-229923.js
+++ /dev/null
@@ -1,41 +0,0 @@
-// Copyright 2013 the V8 project authors. All rights reserved.
-// 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 Google Inc. 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.
-
-// Flags: --expose-externalize-string
-
-var slice = "slow path of JSON.stringify for sliced string".substring(1);
-assertEquals('"' + slice + '"', JSON.stringify(slice, null, 0));
-
-var parent = "external string turned into two byte";
-var slice_of_external = parent.substring(1);
-try {
-  // Turn the string to a two-byte external string, so that the sliced
-  // string looks like one-byte, but its parent is actually two-byte.
-  externalizeString(parent, true);
-} catch (e) { }
-assertEquals('"' + slice_of_external + '"',
-             JSON.stringify(slice_of_external, null, 0));
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-467047.js b/deps/v8/test/mjsunit/regress/regress-crbug-467047.js
deleted file mode 100644
index 373e984a2c9913..00000000000000
--- a/deps/v8/test/mjsunit/regress/regress-crbug-467047.js
+++ /dev/null
@@ -1,17 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --stack-size=100
-
-function captureMatch(re) {
-  var local_variable = 0;
-  "abcd".replace(re, function() { });
-  assertEquals("abcd", RegExp.input);
-  assertEquals("a", RegExp.leftContext);
-  assertEquals("bc", RegExp.lastMatch);
-  assertEquals("d", RegExp.rightContext);
-  assertEquals("foo", captureMatch(/^bar/));
-}
-
-assertThrows(function() { captureMatch(/(bc)/) }, RangeError);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-501809.js b/deps/v8/test/mjsunit/regress/regress-crbug-501809.js
index aa235bc4eaae2a..fc7fe25bb3b1db 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-501809.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-501809.js
@@ -2,7 +2,6 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --harmony-sharedarraybuffer
 var sab = new SharedArrayBuffer(8);
 var ta = new Int32Array(sab);
 ta.__defineSetter__('length', function() {;});
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-736451.js b/deps/v8/test/mjsunit/regress/regress-crbug-736451.js
index 4b5589c0145020..60dcc9961b7f27 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-736451.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-736451.js
@@ -5,9 +5,9 @@
 // Flags: --expose-externalize-string
 
 !function() {
-  const s0 = "external string turned into two byte";
+  const s0 = "external string turned into two byte 🤓";
   const s1 = s0.substring(1);
-  externalizeString(s0, true);
+  externalizeString(s0);
 
   s1.toLowerCase();
 }();
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-770581.js b/deps/v8/test/mjsunit/regress/regress-crbug-770581.js
index c07b9fa50b2801..e01de57e618466 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-770581.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-770581.js
@@ -16,7 +16,7 @@ function message_of_f() {
   }
 }
 
-assertEquals("TypeError: a teapot is not a function", message_of_f());
-assertEquals("TypeError: a teapot is not a function", message_of_f());
+assertEquals("TypeError: string \"a teapot\" is not a function", message_of_f());
+assertEquals("TypeError: string \"a teapot\" is not a function", message_of_f());
 %OptimizeFunctionOnNextCall(f);
-assertEquals("TypeError: a teapot is not a function", message_of_f());
+assertEquals("TypeError: string \"a teapot\" is not a function", message_of_f());
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-781583.js b/deps/v8/test/mjsunit/regress/regress-crbug-781583.js
index f2c85fff9418ec..723ef215e38de9 100644
--- a/deps/v8/test/mjsunit/regress/regress-crbug-781583.js
+++ b/deps/v8/test/mjsunit/regress/regress-crbug-781583.js
@@ -21,5 +21,5 @@ assertDoesNotThrow(() => gens1.pop().next());
 
 %OptimizeFunctionOnNextCall(generator);
 
-var gens2 = prepareGenerators(200000);
+var gens2 = prepareGenerators(20000);
 assertThrows(() => gens2.pop().next(), RangeError);
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-967151.js b/deps/v8/test/mjsunit/regress/regress-crbug-967151.js
deleted file mode 100644
index d98c01adf33a20..00000000000000
--- a/deps/v8/test/mjsunit/regress/regress-crbug-967151.js
+++ /dev/null
@@ -1,12 +0,0 @@
-// Copyright 2019 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --expose-externalize-string
-
-__v_3 = "100                         external string turned into two byte";
-__v_2 = __v_3.substring(0, 28);
-try {
-  externalizeString(__v_3, true);
-} catch (e) {}
-assertEquals(100, JSON.parse(__v_2));
diff --git a/deps/v8/test/mjsunit/regress/regress-reflect-construct.js b/deps/v8/test/mjsunit/regress/regress-reflect-construct.js
new file mode 100644
index 00000000000000..35f1c47f592983
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-reflect-construct.js
@@ -0,0 +1,31 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax
+
+
+class A {};
+class B {};
+class C {};
+class D {};
+class E {};
+class V { constructor() { this.v = 1 } };
+class W { constructor() { this.w = 1 } };
+class X { constructor() { this.x = 1 } };
+class Y { constructor() { this.y = 1 } };
+class Z { constructor() { this.z = 1 } };
+
+var ctrs = [
+  function() {},
+  A,B,C,D,E,V,W,X,Y,Z
+];
+
+for (var it = 0; it < 20; ++it) {
+  for (var i in ctrs) {
+    for (var j in ctrs) {
+      assertTrue(%HaveSameMap(Reflect.construct(ctrs[i],[],ctrs[j]),
+                              Reflect.construct(ctrs[i],[],ctrs[j])));
+    }
+  }
+}
diff --git a/deps/v8/test/mjsunit/regress/regress-sliced-external-cons-regexp.js b/deps/v8/test/mjsunit/regress/regress-sliced-external-cons-regexp.js
index 145c831896a9b1..dffc4f60e03454 100644
--- a/deps/v8/test/mjsunit/regress/regress-sliced-external-cons-regexp.js
+++ b/deps/v8/test/mjsunit/regress/regress-sliced-external-cons-regexp.js
@@ -10,8 +10,8 @@ var cons2 = "0123456789\u1234" + "ABCDEFGHIJ";
 gc();
 gc();  // Promote cons.
 
-try { externalizeString(cons1, false); } catch (e) { }
-try { externalizeString(cons2, true); } catch (e) { }
+externalizeString(cons1);
+externalizeString(cons2);
 
 var slice1 = cons1.slice(1,-1);
 var slice2 = cons2.slice(1,-1);
diff --git a/deps/v8/test/mjsunit/regress/regress-v8-13906.js b/deps/v8/test/mjsunit/regress/regress-v8-13906.js
new file mode 100644
index 00000000000000..07d4ce615c2606
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-v8-13906.js
@@ -0,0 +1,8 @@
+// Copyright 2022 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-fail
+
+d8.terminate();
+import(import('./empty_FIXTURE.js'))
diff --git a/deps/v8/test/mjsunit/regress/regress-v8-14254.js b/deps/v8/test/mjsunit/regress/regress-v8-14254.js
new file mode 100644
index 00000000000000..de0c25203c0bf3
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/regress-v8-14254.js
@@ -0,0 +1,21 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+let array = [
+  {
+    'Text':
+        `Wikipédia est un projet d’encyclopédie collective en ligne, universelle.`
+  },
+  {
+    'Text': `Wikipédia est définie par des principes fondateurs. Son contenu est
+ sous <b11><b20>licence <b30>Creative Commons BY-SA</b30></b20></b11>. Il peut
+ être <b12>copié et réutilisé sous la même licence</b12>, sous réserve d\'en
+ respecter les conditions..`
+  }
+];
+
+let json = JSON.stringify(array);
+let parsed = JSON.parse(json);
+
+assertEquals(array[1].Text, parsed[1].Text);
diff --git a/deps/v8/test/mjsunit/regress/wasm/i32-lowering-inlining.js b/deps/v8/test/mjsunit/regress/wasm/i32-lowering-inlining.js
index 52d14707e93793..07830e6d83c12d 100644
--- a/deps/v8/test/mjsunit/regress/wasm/i32-lowering-inlining.js
+++ b/deps/v8/test/mjsunit/regress/wasm/i32-lowering-inlining.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --no-liftoff --wasm-inlining
+// Flags: --no-liftoff --experimental-wasm-inlining
 
 // This tests that inlining tolerates multi-return call uses that are not
 // projections after Int64Lowering.
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-02256.js b/deps/v8/test/mjsunit/regress/wasm/regress-02256.js
index 21466c07c6b1d9..592f3c79c0cdfc 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-02256.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-02256.js
@@ -304,7 +304,7 @@ function __f_16() {
 
 function __f_14() {
     var __v_4 = __f_16();
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     var module = __v_1.instantiate();
     var __v_3;
 
@@ -363,7 +363,7 @@ function __f_13() {
         gc();
         return __f_28(__v_1);
     });
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     var module = __v_1.instantiate();
     assertEquals(0, __f_30(0));
     var __v_3;
@@ -419,7 +419,7 @@ try {
 
 function __f_10() {
     var __v_1 = __f_16();
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     var module = __v_1.instantiate();
     var __v_3;
 
@@ -522,7 +522,7 @@ try {
 
 function __f_12() {
     var __v_1 = __f_16();
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     var module = __v_9.instantiate();
     __v_4.__p_1905062277 = __v_4[getRandomProperty(__v_4, 1905062277)];
     __v_4.__defineGetter__(getRandomProperty(__v_4, 1764398743), function() {
@@ -560,7 +560,7 @@ try {
 
 function __f_4() {
     var __v_1 = __f_16();
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     __v_1.addFunction("memory_size", kSig_i_v)
         .addBody([kExprMemorySize])
         .exportFunc();
@@ -586,7 +586,7 @@ try {
 
 function __f_6() {
     var __v_1 = __f_16();
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     var module = __v_1.instantiate();
     var __v_3, __v_0;
     gc();
@@ -625,7 +625,7 @@ try {
 
 function __f_11() {
     var __v_1 = __f_16();
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     var module = __v_2.instantiate();
     var __v_3, __v_0;
 
@@ -657,7 +657,7 @@ try {
 
 function __f_15() {
     var __v_1 = __f_16();
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     var module = __v_1.instantiate();
     var __v_3, __v_0 = 0;
 
@@ -692,7 +692,7 @@ try {
 
 function __f_3() {
     var __v_1 = __f_16();
-    __v_1.addMemory(1, 1, false);
+    __v_1.addMemory(1, 1);
     var module = __v_1.instantiate();
     var __v_3, __v_0;
 
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1029642.js b/deps/v8/test/mjsunit/regress/wasm/regress-1029642.js
index e50c7c0b66e1aa..31ea1dfe10d68e 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1029642.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1029642.js
@@ -11,7 +11,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js')
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(0, 0, false);
+builder.addMemory(0, 0);
 builder.addType(makeSig([kWasmF32, kWasmF32, kWasmF64], [kWasmF64]));
 // Generate function 1 (out of 1).
 builder.addFunction(undefined, 0 /* sig */)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1045225.js b/deps/v8/test/mjsunit/regress/wasm/regress-1045225.js
index c48fde88f7d380..16188cd7fd66b0 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1045225.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1045225.js
@@ -8,7 +8,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
   const builder = new WasmModuleBuilder();
-  builder.addMemory(16, 32, false, true);
+  builder.addMemory(16, 32, true);
   builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
   // Generate function 1 (out of 1).
   builder.addFunction(undefined, 0 /* sig */)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1045737.js b/deps/v8/test/mjsunit/regress/wasm/regress-1045737.js
index 04739a3471b506..6f9d8a0195369a 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1045737.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1045737.js
@@ -8,7 +8,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
 // Generate function 1 (out of 1).
 builder.addFunction(undefined, 0 /* sig */).addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1046472.js b/deps/v8/test/mjsunit/regress/wasm/regress-1046472.js
index f6d87581a9bd1c..af1a9e5cfc2c7a 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1046472.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1046472.js
@@ -8,7 +8,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
   const builder = new WasmModuleBuilder();
-  builder.addMemory(16, 32, false);
+  builder.addMemory(16, 32);
   builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
   // Generate function 1 (out of 1).
   builder.addFunction('main', 0 /* sig */)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1048241.js b/deps/v8/test/mjsunit/regress/wasm/regress-1048241.js
index c52d44cac6d715..ac1e117cf683db 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1048241.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1048241.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 const sig = makeSig([kWasmF64, kWasmI64, kWasmI32, kWasmF64], []);
 builder.addFunction(undefined, sig).addBody([
   kExprI32Const, 0x00,                               // -
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1065599.js b/deps/v8/test/mjsunit/regress/wasm/regress-1065599.js
index b07156bb522d33..d5a5c65c373a4e 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1065599.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1065599.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
 // Generate function 1 (out of 1).
 builder.addFunction(undefined, 0 /* sig */).addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1070078.js b/deps/v8/test/mjsunit/regress/wasm/regress-1070078.js
index 01486a0f79f7c8..e2875bdfe1607b 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1070078.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1070078.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
 // Generate function 1 (out of 4).
 builder.addFunction(undefined, 0 /* sig */).addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1074586-b.js b/deps/v8/test/mjsunit/regress/wasm/regress-1074586-b.js
index 53f660916d8030..74f9cb36babef0 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1074586-b.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1074586-b.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 const sig = builder.addType(makeSig(
     [kWasmI32, kWasmI32, kWasmI32, kWasmI32, kWasmI32, kWasmI32, kWasmI32],
     []));
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1074586.js b/deps/v8/test/mjsunit/regress/wasm/regress-1074586.js
index 60d49dc3d39543..51c94ff1d95e08 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1074586.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1074586.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false, true);
+builder.addMemory(1, 1, true);
 builder.addGlobal(kWasmI32, 1);
 const sig = builder.addType(makeSig([kWasmI32, kWasmI64, kWasmI64, kWasmI64], [kWasmF32]));
 // Generate function 1 (out of 3).
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1075953.js b/deps/v8/test/mjsunit/regress/wasm/regress-1075953.js
index ebacdbb0114608..87f70f26129ea4 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1075953.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1075953.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false, true);
+builder.addMemory(1, 1, true);
 const sig = builder.addType(makeSig([], [kWasmI32]));
 
 builder.addFunction(undefined, sig)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1079449.js b/deps/v8/test/mjsunit/regress/wasm/regress-1079449.js
index ab97e77e3d06e1..4cc62ddd7d53a0 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1079449.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1079449.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 const sig = builder.addType(makeSig(
     [
       kWasmI64, kWasmI32, kWasmI64, kWasmI32, kWasmI32, kWasmI32, kWasmI32,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-10898.js b/deps/v8/test/mjsunit/regress/wasm/regress-10898.js
index 995c83aa923ffc..f538b89afb9e77 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-10898.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-10898.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false, true);
+builder.addMemory(1, 1, true);
 builder.addDataSegment(2, [0x12, 0x00, 0x1c]);
 builder.addDataSegment(17,
     [0x00, 0x00, 0x96, 0x00, 0x00, 0x00, 0xc2, 0x00, 0xb33, 0x03, 0xf6, 0x0e]);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1116019.js b/deps/v8/test/mjsunit/regress/wasm/regress-1116019.js
index 72cae4384fc8a0..40bd5823dc0cf7 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1116019.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1116019.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addType(makeSig([], [kWasmI32]));
 // Generate function 1 (out of 1).
 builder.addFunction(undefined, 0 /* sig */)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1125951.js b/deps/v8/test/mjsunit/regress/wasm/regress-1125951.js
index e3ff066985f115..891554eaf53fe7 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1125951.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1125951.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 (function testPrintCode() {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, undefined, false);
+  builder.addMemory(1, undefined);
   builder
       .addFunction('main', makeSig([kWasmI32, kWasmI32, kWasmF64], [kWasmI32]))
       .addBody([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1132461.js b/deps/v8/test/mjsunit/regress/wasm/regress-1132461.js
index 9074b1d4147a0c..5f07dd48285745 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1132461.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1132461.js
@@ -11,7 +11,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 builder.addFunction(undefined, makeSig([], [kWasmI32]))
   .addBodyWithEnd([
 kExprI32Const, 0x00,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1137608.js b/deps/v8/test/mjsunit/regress/wasm/regress-1137608.js
index cc23278300c87b..e88a77a168e39a 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1137608.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1137608.js
@@ -40,7 +40,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
         kExprReturnCallIndirect, sig1, kTableZero]).exportFunc();
   builder.addFunction("f", sig1).addBody([kExprI32Const, 0]);
   builder.addTable(kWasmAnyFunc, 4, 4);
-  builder.addMemory(16, 32, false, true);
+  builder.addMemory(16, 32, true);
   let module = new WebAssembly.Module(builder.toBuffer());
   let instance = new WebAssembly.Instance(module);
 })();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1140549.js b/deps/v8/test/mjsunit/regress/wasm/regress-1140549.js
index 8cd12c42f4c65b..6c9a6eaf8d70eb 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1140549.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1140549.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 builder.addType(makeSig([], []));
 builder.addFunction(undefined, 0 /* sig */)
   .addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1145135.js b/deps/v8/test/mjsunit/regress/wasm/regress-1145135.js
index 28c5ba8f652ef0..e640de17d17478 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1145135.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1145135.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false, true);
+builder.addMemory(1, 1, true);
 builder.addGlobal(kWasmI32, 1);
 builder.addFunction(undefined, kSig_v_i)
   .addLocals(kWasmI32, 5)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1153442.js b/deps/v8/test/mjsunit/regress/wasm/regress-1153442.js
index 2f385b2149c87e..1418b4ea5be92f 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1153442.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1153442.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false, true);
+builder.addMemory(1, 1, true);
 builder.addGlobal(kWasmI32, 1);
 builder.addGlobal(kWasmI32, 1);
 builder.addType(makeSig([kWasmI32, kWasmI64, kWasmI32], []));
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1161654.js b/deps/v8/test/mjsunit/regress/wasm/regress-1161654.js
index 001544b4f4b78d..6aa06057e733ca 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1161654.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1161654.js
@@ -11,7 +11,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(19, 32, false);
+builder.addMemory(19, 32);
 builder.addGlobal(kWasmI32, 0);
 builder.addType(makeSig([], []));
 builder.addType(makeSig([kWasmI64, kWasmS128, kWasmF32], [kWasmI32]));
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1165966.js b/deps/v8/test/mjsunit/regress/wasm/regress-1165966.js
index 79b8b8c5b6ad85..27fe720d065d94 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1165966.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1165966.js
@@ -10,7 +10,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 // Generate function 1 (out of 1).
 builder.addFunction(undefined, kSig_i_v)
   .addLocals(kWasmI64, 1)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1179025.js b/deps/v8/test/mjsunit/regress/wasm/regress-1179025.js
index bb02ba62bcb716..d13b64dc66e4d6 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1179025.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1179025.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false, true);
+builder.addMemory(1, 1, true);
 builder.addType(makeSig([], []));
 builder.addType(makeSig([kWasmI64], [kWasmF32]));
 // Generate function 1 (out of 2).
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1179182.js b/deps/v8/test/mjsunit/regress/wasm/regress-1179182.js
index 778fb7a622f0f8..458da5aa8bdeba 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1179182.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1179182.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(28, 32, false);
+builder.addMemory(28, 32);
 builder.addFunction(undefined, kSig_i_v)
   .addLocals(kWasmI32, 61)
   .addBody([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-11809.js b/deps/v8/test/mjsunit/regress/wasm/regress-11809.js
index eef8c291f6e6db..ff33a2c4d7979c 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-11809.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-11809.js
@@ -9,7 +9,7 @@ load("test/mjsunit/wasm/wasm-module-builder.js");
 
 function InstanceMaker(offset) {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false /* exported */);
+  builder.addMemory(1, 1);
 
   var sig_index = builder.addType(makeSig(
       [kWasmI32, kWasmI32, kWasmI32, kWasmI32, kWasmI32, kWasmI32, kWasmI32,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1187831.js b/deps/v8/test/mjsunit/regress/wasm/regress-1187831.js
index 643adaa0661235..d51eaa09032175 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1187831.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1187831.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
 builder.addType(makeSig([], []));
 builder.setTableBounds(1, 1);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1196837.js b/deps/v8/test/mjsunit/regress/wasm/regress-1196837.js
index 2d204ad67cd752..b30f54e15d0866 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1196837.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1196837.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
 builder.addFunction(undefined, 0 /* sig */)
   .addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1202736.js b/deps/v8/test/mjsunit/regress/wasm/regress-1202736.js
index 3e55937560bde5..4c8a7dace03e0a 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1202736.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1202736.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false, true);
+builder.addMemory(1, 1, true);
 builder.addType(
     makeSig([kWasmF64, kWasmI32, kWasmI32, kWasmF64, kWasmF32], [kWasmI64]));
 builder.addFunction(undefined, 0 /* sig */)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1217064.js b/deps/v8/test/mjsunit/regress/wasm/regress-1217064.js
index 93a8494547e389..c80adfb57b612b 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1217064.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1217064.js
@@ -5,7 +5,7 @@
 load('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
 builder.addFunction(undefined, 0 /* sig */).addBody([
   kExprI64Const,    0x7a,                          // i64.const
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1220855.js b/deps/v8/test/mjsunit/regress/wasm/regress-1220855.js
index 13f4c2813da10c..e12eb4ce76d5ff 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1220855.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1220855.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false, true);
+builder.addMemory(1, 1, true);
 builder.addFunction('test', makeSig([kWasmI32], [kWasmI64]))
     .addBody([
       ...wasmI32Const(1 << 30),  // pages to grow
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1239116.js b/deps/v8/test/mjsunit/regress/wasm/regress-1239116.js
index 58c6fbe0caf0d2..f797cc7f032584 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1239116.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1239116.js
@@ -5,7 +5,8 @@
 load('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, true);
+builder.addMemory(1, 1);
+builder.exportMemoryAs('memory');
 builder.addFunction('main', kSig_i_v)
     .addBody([
       kExprI32Const, 0,         // i32.const
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1239116b.js b/deps/v8/test/mjsunit/regress/wasm/regress-1239116b.js
index 10ce3959648cd7..975528d05755b9 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1239116b.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1239116b.js
@@ -5,7 +5,8 @@
 load('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, true);
+builder.addMemory(1, 1);
+builder.exportMemoryAs('memory');
 builder.addFunction('main', kSig_i_v)
     .addBody([
       kExprI32Const, 0,          // i32.const
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1251465.js b/deps/v8/test/mjsunit/regress/wasm/regress-1251465.js
index ae832bda838c10..8ff5150b6b9e08 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1251465.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1251465.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, false);
+builder.addMemory(16, 32);
 builder.addType(makeSig([], [kWasmI32]));
 builder.addTable(kWasmFuncRef, 1, 1, undefined)
 builder.addFunction(undefined, 0 /* sig */)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1255354.js b/deps/v8/test/mjsunit/regress/wasm/regress-1255354.js
index 2a8d30e63527a8..efd6c118fe8750 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1255354.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1255354.js
@@ -7,7 +7,7 @@ load("test/mjsunit/wasm/wasm-module-builder.js");
 
 var builder = new WasmModuleBuilder();
 
-builder.addMemory(1, 1, /* exported = */ false);
+builder.addMemory(1, 1);
 
 builder.addFunction("main", kSig_i_i).addBody([
     kExprLocalGet, 0,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1271538.js b/deps/v8/test/mjsunit/regress/wasm/regress-1271538.js
index d132914f209ef2..32cb5a0bded653 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1271538.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1271538.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false, true);
+builder.addMemory(16, 32, true);
 builder.addFunction('main', makeSig([], [kWasmS128]))
   .addBody([
 kExprI32Const, 0,  // i32.const
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1272204.js b/deps/v8/test/mjsunit/regress/wasm/regress-1272204.js
index 58975c90e4edc4..2cde9dd508356f 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1272204.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1272204.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addFunction(undefined, kSig_i_iii).addBody([
   kExprI64Const, 0x7a,  // i64.const
   kExprI64Const, 0x7f,  // i64.const
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1283042.js b/deps/v8/test/mjsunit/regress/wasm/regress-1283042.js
index 9455a1b2976b4a..6e7ef5180f4787 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1283042.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1283042.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addFunction(undefined, kSig_i_iii)
   .addBody([
     ...wasmS128Const(new Array(16).fill(0)),        // s128.const
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1283395.js b/deps/v8/test/mjsunit/regress/wasm/regress-1283395.js
index a8055f6df8971a..fbcce0653261fb 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1283395.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1283395.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 // Generate function 1 (out of 3).
 builder.addFunction(undefined, makeSig([kWasmI32, kWasmI32, kWasmI32], []))
   .addLocals(kWasmS128, 1)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1284980.js b/deps/v8/test/mjsunit/regress/wasm/regress-1284980.js
index a173673aa0854d..6c388ba92e3c19 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1284980.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1284980.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], []));
 builder.addType(makeSig([kWasmS128], []));
 builder.addType(makeSig([], [kWasmF64, kWasmF64]));
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-12874.js b/deps/v8/test/mjsunit/regress/wasm/regress-12874.js
index b670322348fa35..efe2fef777855d 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-12874.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-12874.js
@@ -3,7 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc
-// Flags: --no-liftoff --no-wasm-speculative-inlining --no-wasm-inlining
+// Flags: --no-liftoff --no-experimental-wasm-inlining
 
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1296876.js b/deps/v8/test/mjsunit/regress/wasm/regress-1296876.js
index 96ce17b56d3ea9..4ea500654f81d1 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1296876.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1296876.js
@@ -7,7 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addFunction('main', kSig_i_iii)
     .addBody([
       kExprLocalGet, 1,                              // local.get
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1299183.js b/deps/v8/test/mjsunit/regress/wasm/regress-1299183.js
index 5d60b8f8977273..ca8894857b25c8 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1299183.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1299183.js
@@ -39,7 +39,7 @@ builder.addType(
            wasmRefType(kWasmAnyRef), wasmRefNullType(4), kWasmI64, kWasmI64,
            wasmRefType(kWasmEqRef), kWasmI32],
           [kWasmI32]));
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addTable(kWasmFuncRef, 4, 5, undefined)
 builder.addTable(kWasmFuncRef, 15, 25, undefined)
 builder.addTable(kWasmFuncRef, 1, 1, undefined)
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1308333.js b/deps/v8/test/mjsunit/regress/wasm/regress-1308333.js
index d1b530be991d96..7e0d00ebef6d0f 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1308333.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1308333.js
@@ -8,7 +8,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 // Generate function 1 (out of 1).
 builder.addFunction(undefined, 0 /* sig */)
   .addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1314184.js b/deps/v8/test/mjsunit/regress/wasm/regress-1314184.js
index 4a57a68e68e41f..cb5ab07d97b0d1 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1314184.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1314184.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addFunction('main', kSig_i_iii)
     .addBodyWithEnd([
       kExprI32Const, 0x0,  // i32.const
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-13230.js b/deps/v8/test/mjsunit/regress/wasm/regress-13230.js
index 6ef5b9a4db7887..63571515146caa 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-13230.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-13230.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 let builder = new WasmModuleBuilder();
 
-builder.addMemory(1, 2, false, false);
+builder.addMemory(1, 2);
 
 let callee = builder.addFunction('callee', kSig_v_v).addBody([kExprNop]);
 
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-13290.js b/deps/v8/test/mjsunit/regress/wasm/regress-13290.js
index 450b9492b0b0eb..bd1921d898e62b 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-13290.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-13290.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 let builder = new WasmModuleBuilder();
 
-builder.addMemory(16, 17, false, false);
+builder.addMemory(16, 17);
 
 let main_func = builder.addFunction('main', kSig_i_v).exportFunc().addBody([
   ...wasmI32Const(1),
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1347073.js b/deps/v8/test/mjsunit/regress/wasm/regress-1347073.js
index 585fd359f7c755..abce8ffa99a7aa 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1347073.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1347073.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 var values = [];
+values.length = 1;
 Object.prototype.__defineGetter__(0, function() {
   throw new Error('foo');
 });
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1364036.js b/deps/v8/test/mjsunit/regress/wasm/regress-1364036.js
index a880a77555b5a8..53559b8485928f 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1364036.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1364036.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --wasm-speculative-inlining --experimental-wasm-typed-funcref
+// Flags: --experimental-wasm-inlining --experimental-wasm-typed-funcref
 
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-13700.js b/deps/v8/test/mjsunit/regress/wasm/regress-13700.js
index 03f5fa8bca34d5..84cda0e9c25d05 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-13700.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-13700.js
@@ -10,7 +10,7 @@ let bases = [0n, 1234n, 4294967296n, -4294967297n];
 let expects = [0n, 1234n, 0n, -1n];
 
 for (let i = 0; i < bases.length; ++i) {
-  var builder = new WasmModuleBuilder();
+  let builder = new WasmModuleBuilder();
   let g0 = builder.addImportedGlobal("mod", "g0", kWasmI64, true);
   builder.addExportOfKind('g0', kExternalGlobal, g0);
 
@@ -22,10 +22,31 @@ for (let i = 0; i < bases.length; ++i) {
       kExprGlobalSet, g0,
     ]).exportAs("trunci64");
 
-  var to_imported = new WebAssembly.Global({value: "i64", mutable: true}, bases[i]);
-  var instance = builder.instantiate({mod: { g0: to_imported }});
+  let to_imported =
+      new WebAssembly.Global({value: 'i64', mutable: true}, bases[i]);
+  let instance = builder.instantiate({mod: { g0: to_imported }});
 
   assertEquals(bases[i], instance.exports.g0.value);
   instance.exports.trunci64();
   assertEquals(expects[i], instance.exports.g0.value);
 }
+
+for (let i = 0; i < bases.length; ++i) {
+  let builder = new WasmModuleBuilder();
+  builder.addMemory(1, 1);
+  builder.exportMemoryAs("memory");
+
+  builder.addFunction("trunci64", kSig_l_v).exportFunc().addBody([
+    kExprI32Const, 0,  // address for load: 0
+    kExprI64LoadMem, 0, 0,  // alignment 0, offset 0
+    kExprI32ConvertI64,
+    kExprI64SConvertI32,
+  ]);
+
+  let instance = builder.instantiate();
+
+  let mem = new DataView(instance.exports.memory.buffer)
+  mem.setBigInt64(0, bases[i], true);
+  let result = instance.exports.trunci64();
+  assertEquals(result, expects[i]);
+}
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1374535.js b/deps/v8/test/mjsunit/regress/wasm/regress-1374535.js
index 8d73638d3b3920..cf1d4c19d9b0fa 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1374535.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1374535.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --wasm-inlining --no-liftoff
+// Flags: --experimental-wasm-inlining --no-liftoff
 
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1380498.js b/deps/v8/test/mjsunit/regress/wasm/regress-1380498.js
index 57893916684b3b..45ef1b72049d33 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1380498.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1380498.js
@@ -8,7 +8,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 // Generate function 1 (out of 1).
 builder.addFunction(undefined, 0 /* sig */)
   .addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1380646.js b/deps/v8/test/mjsunit/regress/wasm/regress-1380646.js
index c1eae76fb34ac5..ea4abbddd4a51a 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1380646.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1380646.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 let builder = new WasmModuleBuilder();
 
-builder.addMemory(16, 17, false, false);
+builder.addMemory(16, 17);
 
 builder.addTag(kSig_v_f);
 
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-13939.js b/deps/v8/test/mjsunit/regress/wasm/regress-13939.js
new file mode 100644
index 00000000000000..d0dc2be4833efe
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-13939.js
@@ -0,0 +1,36 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --no-liftoff
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+let builder = new WasmModuleBuilder();
+
+builder.addMemory(10, 10);
+
+let struct = builder.addStruct([makeField(kWasmF32, true)]);
+
+builder.addFunction("tester", kSig_f_v)
+  .addLocals(wasmRefType(struct), 1)
+  .addLocals(kWasmF32, 1)
+  .addBody([
+    kExprLoop, 0x40,
+      kExprRefNull, struct,
+      kExprRefAsNonNull,
+      kExprLocalTee, 0x00,
+      kGCPrefix, kExprStructGet, struct, 0x00,
+      kExprLocalSet, 0x01,
+      kExprLocalGet, 0x01,
+      kExprI32Const, 0x00,
+      kExprF32LoadMem, 0x00, 0x04,
+      kExprI32Const, 0xff, 0x7e,
+      kExprSelect,
+      kExprI32SConvertF32,
+      kExprBrIf, 0x00,
+    kExprEnd,
+    kExprF32Const, 0x00, 0x00, 0x00, 0x00])
+  .exportFunc();
+
+assertTraps(kTrapNullDereference, () => builder.instantiate().exports.tester());
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-13946.js b/deps/v8/test/mjsunit/regress/wasm/regress-13946.js
new file mode 100644
index 00000000000000..5d57387548715d
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-13946.js
@@ -0,0 +1,29 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+let builder = new WasmModuleBuilder();
+
+let array = builder.addArray(kWasmI32, true);
+let sig = builder.addType(kSig_i_i);
+let struct = builder.addStruct([makeField(kWasmI32, true)]);
+
+builder.addFunction("test", sig)
+  .addBody([
+    kExprI32Const, 0x0a,
+    kGCPrefix, kExprArrayNewDefault, 0x00,
+    kExprI32Const, 0x00,
+    kGCPrefix, kExprStructNew, 0x02,
+    kGCPrefix, kExprStructGet, 0x02, 0x00,
+    kExprLocalTee, 0x00,
+    kExprI32Const, 0x01,
+    kExprI32Const, 0x00,
+    kGCPrefix, kExprArrayFill, 0x00,
+    kExprLocalGet, 0x00])
+  .exportFunc();
+
+assertEquals(0, builder.instantiate().exports.test(42));
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-13956.js b/deps/v8/test/mjsunit/regress/wasm/regress-13956.js
new file mode 100644
index 00000000000000..aace4d89e0545b
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-13956.js
@@ -0,0 +1,31 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+let builder = new WasmModuleBuilder();
+
+let array = builder.addArray(kWasmI32, true);
+
+builder.addFunction('main', kSig_v_v)
+    .exportFunc()
+    .addBody([
+      // dest array
+      kExprRefNull, kNullRefCode,
+      // dest index
+      kExprI32Const, 0,
+      // src array
+      kExprRefNull, kNullRefCode,
+      // src index
+      kExprI32Const, 0,
+      // copy length
+      kExprI32Const, 0,
+      kGCPrefix, kExprArrayCopy, array, array,
+    ]);
+
+assertThrows(
+    () => builder.instantiate().exports.main(), WebAssembly.RuntimeError,
+    'dereferencing a null pointer');
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-14047.js b/deps/v8/test/mjsunit/regress/wasm/regress-14047.js
new file mode 100644
index 00000000000000..b6ac051cd105f5
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-14047.js
@@ -0,0 +1,31 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+let builder = new WasmModuleBuilder();
+
+let struct_type = builder.addStruct([makeField(kWasmI32, true)]);
+
+builder.addFunction('main', kSig_v_v).exportFunc()
+  .addBody([
+  kExprRefNull, struct_type,
+  kExprRefAsNonNull,
+  kGCPrefix, kExprStructGet, struct_type, 0,
+  kExprDrop,
+  kExprI32Const, 1,
+  ...wasmF32Const(42),
+  kExprF32Const, 0xd7, 0xff, 0xff, 0xff,  // -nan:0x7fffd7
+  kExprF32Gt,
+  kExprI32DivU,
+  kExprIf, kWasmVoid,
+  kExprUnreachable,
+  kExprEnd,
+]);
+
+let main = builder.instantiate().exports.main;
+assertThrows(
+    () => main(), WebAssembly.RuntimeError, /dereferencing a null pointer/);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1408337.js b/deps/v8/test/mjsunit/regress/wasm/regress-1408337.js
index 26c950fc5b53f2..a08bb735182fc4 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1408337.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1408337.js
@@ -8,7 +8,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
 builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 // Generate function 1 (out of 1).
 builder.addFunction(undefined, 0 /* sig */)
   .addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-14113.js b/deps/v8/test/mjsunit/regress/wasm/regress-14113.js
new file mode 100644
index 00000000000000..4c3cfebb9e2729
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-14113.js
@@ -0,0 +1,74 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --liftoff --no-wasm-tier-up
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const I64AtomicOps = [
+  kExprI64AtomicAdd32U,
+  kExprI64AtomicSub32U,
+  kExprI64AtomicAnd32U,
+  kExprI64AtomicOr32U,
+  kExprI64AtomicXor32U,
+  kExprI64AtomicExchange32U,
+];
+
+const Inputs = [
+  [0x0ffffffffn, 1n, 0n],
+  [0x200000000n, 1n, 0x2ffffffffn],
+  [0x1ffffffffn, 1n, 0x100000001n],
+  [0x1ffffffffn, 1n, 0x1ffffffffn],
+  [0x1ffffffffn, 0xffffffffn, 0x100000000n],
+  [0x1ffffffffn, 0xfffffffen, 0x1fffffffen],
+];
+
+// Test that bits beyond position 31 of the second
+// operand do not affect result at all.
+const Inputs2 = [
+  [0x0ffffffffn, 0xbee00000001n, 0n],
+  [0x200000000n, 0xbee00000001n, 0x2ffffffffn],
+  [0x1ffffffffn, 0xbee00000001n, 0x100000001n],
+  [0x1ffffffffn, 0xbee00000001n, 0x1ffffffffn],
+  [0x1ffffffffn, 0xbeeffffffffn, 0x100000000n],
+  [0x1ffffffffn, 0xbeefffffffen, 0x1fffffffen],
+];
+
+function TestBinOp64(index, memory, inputs) {
+  const Op = I64AtomicOps[index];
+  const sample = inputs[index];
+
+  const builder = new WasmModuleBuilder();
+  builder.addImportedMemory("imports", "mem", 1);
+  builder.addType(makeSig([kWasmI32, kWasmI64], [kWasmI64]));
+  // Generate function 1 (out of 1).
+  builder.addFunction(undefined, 0 /* sig */).addBodyWithEnd([
+    kExprLocalGet, 0,
+    kExprLocalGet, 1,
+    kAtomicPrefix, Op, 0x02, 0x00,
+    kExprEnd
+  ]);
+  builder.addExport('run', 0);
+  const instance = builder.instantiate({ imports: { mem: memory } });
+
+  let dv = new DataView(memory.buffer);
+  dv.setBigUint64(index * 8, sample[0], true);
+  assertEquals(sample[0] & 0xffffffffn, instance.exports.run(index * 8, sample[1]));
+  assertEquals(sample[2], dv.getBigUint64(index * 8, true));
+}
+
+function runTestWithInputs(inputs) {
+  var mem = new WebAssembly.Memory({ initial: 1 });
+  TestBinOp64(0, mem, inputs, "i64.atomic.rmw32.add");
+  TestBinOp64(1, mem, inputs, "i64.atomic.rmw32.sub");
+  TestBinOp64(2, mem, inputs, "i64.atomic.rmw32.and");
+  TestBinOp64(3, mem, inputs, "i64.atomic.rmw32.or");
+  TestBinOp64(4, mem, inputs, "i64.atomic.rmw32.xor");
+  TestBinOp64(5, mem, inputs, "i64.atomic.rmw32.xchg");
+}
+
+(function () {
+  runTestWithInputs(Inputs);
+  runTestWithInputs(Inputs2);
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-14116.js b/deps/v8/test/mjsunit/regress/wasm/regress-14116.js
new file mode 100644
index 00000000000000..df1192a57b3673
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-14116.js
@@ -0,0 +1,43 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --liftoff --no-wasm-tier-up
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+(function () {
+  const builder = new WasmModuleBuilder();
+  builder.addImportedMemory("imports", "mem", 1);
+  builder.addType(makeSig([kWasmI32, kWasmI64, kWasmI64], [kWasmI64]));
+  // Generate function 1 (out of 1).
+  builder.addFunction(undefined, 0 /* sig */).addBodyWithEnd([
+    kExprLocalGet, 0,
+    kExprLocalGet, 1,
+    kExprLocalGet, 2,
+    kAtomicPrefix, kExprI64AtomicCompareExchange, 0x03, 0x00,
+    kExprEnd
+  ]);
+  builder.addExport('run', 0);
+  var mem = new WebAssembly.Memory({ initial: 1 });
+
+  let i64arr = new BigUint64Array(mem.buffer);
+  let dv = new DataView(mem.buffer);
+  dv.setBigUint64(0, 0n, true)
+  dv.setBigUint64(8, 0x8eeeffffffffn, true)
+
+  const instance = builder.instantiate({ imports: { mem: mem } });
+  // Equal, new value is stored and old value returned.
+  assertEquals(0n, instance.exports.run(0, 0n, 1n));
+  assertEquals(1n, dv.getBigUint64(0, true));
+  // Not equal, old value stays.
+  assertEquals(1n, instance.exports.run(0, 0n, 2n));
+  assertEquals(1n, dv.getBigUint64(0, true));
+
+  // Equal, new value is stored and old value returned.
+  assertEquals(0x8eeeffffffffn, instance.exports.run(8, 0x8eeeffffffffn, 0x1000ffffffffn));
+  assertEquals(0x1000ffffffffn, dv.getBigUint64(8, true));
+  // Not equal, old value stays.
+  assertEquals(0x1000ffffffffn, instance.exports.run(8, 0x8eeeffffffffn, 0x1n));
+  assertEquals(0x1000ffffffffn, dv.getBigUint64(8, true));
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-14118.js b/deps/v8/test/mjsunit/regress/wasm/regress-14118.js
new file mode 100644
index 00000000000000..c5029a42d52196
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-14118.js
@@ -0,0 +1,59 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --liftoff --no-wasm-tier-up
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const I64AtomicOps = [
+  kExprI64AtomicAdd,
+  kExprI64AtomicSub,
+  kExprI64AtomicAnd,
+  kExprI64AtomicOr,
+  kExprI64AtomicXor,
+  kExprI64AtomicExchange,
+];
+
+const Inputs = [
+  [0x1ffffffffn, 1n, 0x200000000n],
+  [0x200000000n, 1n, 0x1ffffffffn],
+  [0x1ffffffffn, 1n, 0x1n],
+  [0x1ffffffffn, 1n, 0x1ffffffffn],
+  [0x1ffffffffn, 0x10ffffffffn, 0x1100000000n],
+  [0x1ffffffffn, 0x10ffffffffn, 0x10ffffffffn],
+];
+
+function TestBinOp64(index, memory) {
+  const Op = I64AtomicOps[index];
+  const sample = Inputs[index];
+
+  const builder = new WasmModuleBuilder();
+  builder.addImportedMemory("imports", "mem", 1);
+  builder.addType(makeSig([kWasmI32, kWasmI64], [kWasmI64]));
+  // Generate function 1 (out of 1).
+  builder.addFunction(undefined, 0 /* sig */).addBodyWithEnd([
+    kExprLocalGet, 0,
+    kExprLocalGet, 1,
+    kAtomicPrefix, Op, 0x03, 0x00,
+    kExprEnd
+  ]);
+  builder.addExport('run', 0);
+  const instance = builder.instantiate({ imports: { mem: memory } });
+
+  let i64arr = new BigUint64Array(memory.buffer);
+  let dv = new DataView(memory.buffer);
+  dv.setBigUint64(index * 8, sample[0], true);
+  assertEquals(sample[0], instance.exports.run(index * 8, sample[1]));
+  assertEquals(sample[2], dv.getBigUint64(index * 8, true));
+}
+
+(function () {
+  var mem = new WebAssembly.Memory({ initial: 1 });
+  TestBinOp64(0, mem, "i64.atomic.rmw.add");
+  TestBinOp64(1, mem, "i64.atomic.rmw.sub");
+  TestBinOp64(2, mem, "i64.atomic.rmw.and");
+  TestBinOp64(3, mem, "i64.atomic.rmw.or");
+  TestBinOp64(4, mem, "i64.atomic.rmw.xor");
+  TestBinOp64(5, mem, "i64.atomic.rmw.xchg");
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-14167.js b/deps/v8/test/mjsunit/regress/wasm/regress-14167.js
new file mode 100644
index 00000000000000..995a4b0f6e784a
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-14167.js
@@ -0,0 +1,140 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --no-liftoff
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+let builder = new WasmModuleBuilder();
+
+builder.startRecGroup();
+// 0
+builder.addType(makeSig([wasmRefNullType(0)], [kWasmArrayRef]));
+// 1
+builder.addStruct([
+  makeField(kWasmI32, false),
+  makeField(wasmRefNullType(1), false),
+  makeField(wasmRefType(0), true)
+]);
+// 2
+builder.addType(makeSig([], [wasmRefNullType(2)]), kNoSuperType, false);
+// 3
+builder.addStruct([]);
+// 4
+builder.addStruct([
+  makeField(kWasmExternRef, false),
+  makeField(kWasmArrayRef, false),
+  makeField(kWasmI16, false),
+  makeField(wasmRefNullType(2), false),
+  makeField(wasmRefType(5), false),
+  makeField(wasmRefType(kWasmFuncRef), true)
+]);
+// 5
+builder.addType(makeSig([kWasmF32], [kWasmAnyRef]));
+// 6
+builder.addType(makeSig([], []));
+// 7
+builder.addArray(kWasmAnyRef, true);
+// 8
+builder.addStruct([
+  makeField(kWasmF32, true),
+  makeField(kWasmF64, true),
+  makeField(wasmRefNullType(8), false),
+  makeField(kWasmFuncRef, true),
+  makeField(kWasmI64, false)
+]);
+// 9
+builder.addStruct([
+  makeField(kWasmI8, false),
+  makeField(wasmRefNullType(2), false)
+]);
+// 10
+builder.addArray(kWasmF64, false);
+// 11
+builder.addType(makeSig([], [wasmRefNullType(11)]), 2, false);
+// 12
+builder.addType(makeSig([], [wasmRefNullType(12)]), 11);
+// 13
+builder.addStruct([
+  makeField(wasmRefType(kWasmFuncRef), true),
+  makeField(kWasmEqRef, false),
+  makeField(kWasmI64, true),
+  makeField(wasmRefType(8), true)
+]);
+// 14
+builder.addStruct([
+  makeField(kWasmExternRef, false),
+  makeField(kWasmNullRef, false),
+  makeField(kWasmI16, false),
+  makeField(wasmRefType(11), false),
+  makeField(wasmRefType(5), false),
+  makeField(wasmRefType(kWasmFuncRef), true)
+], 4);
+// 15
+builder.addStruct([]);
+// 16
+builder.addStruct([
+  makeField(kWasmF32, false),
+  makeField(wasmRefType(kWasmFuncRef), false),
+  makeField(kWasmF32, false),
+  makeField(kWasmF64, true),
+  makeField(kWasmStructRef, true)
+]);
+// 17
+builder.addType(makeSig([kWasmI32], [wasmRefNullType(15)]));
+// 18
+builder.addStruct([
+  makeField(kWasmI32, true),
+  makeField(kWasmI64, true),
+  makeField(kWasmI16, true),
+  makeField(wasmRefNullType(2), false),
+  makeField(wasmRefNullType(2), false)
+]);
+// 19
+builder.addStruct([makeField(wasmRefType(0), true)]);
+// 20
+builder.addArray(kWasmI32, true);
+// 21
+builder.addArray(kWasmI64, false);
+builder.endRecGroup();
+
+builder.addDeclarativeElementSegment([1, 2]);
+
+builder.addFunction("test", kSig_v_v)
+  .addLocals(wasmRefNullType(20), 1)
+  .addBody([
+    kExprLoop, 0x7d,  // loop @4 f32
+      kExprRefFunc, 0x01,  // ref.func
+      kExprRefNull, 0x65,  // ref.null
+      kExprRefAsNonNull,  // ref.as_non_null
+      kExprI64Const, 0x81, 0x80, 0x7e,  // i64.const
+      kExprRefNull, 0x65,  // ref.null
+      kExprRefAsNonNull,  // ref.as_non_null
+      kGCPrefix, kExprStructNew, 0x0d,  // struct.new
+      kGCPrefix, kExprStructGet, 0x0d, 0x03,  // struct.get
+      kGCPrefix, kExprStructGet, 0x08, 0x00,  // struct.get
+      kExprDrop,  // drop
+      kExprI32Const, 0x00,  // i32.const
+      kExprBrIf, 0x00,  // br_if depth=0
+      kExprF32Const, 0x00, 0x00, 0x00, 0x00,  // f32.const
+      kExprEnd,  // end @39
+    kExprI32SConvertF32,  // i32.trunc_f32_s
+    kExprRefNull, 0x65,  // ref.null
+    kExprRefFunc, 0x02,  // ref.func
+    kGCPrefix, kExprStructNew, 0x01,  // struct.new
+    kExprDrop,  // drop
+    kExprI32Const, 0x00,  // i32.const
+    kExprI32Const, 0x07,  // i32.const
+    kGCPrefix, kExprArrayNew, 0x14,  // array.new
+    kExprLocalTee, 0x00,  // local.tee
+    kExprRefAsNonNull,  // ref.as_non_null
+    kGCPrefix, kExprArrayLen,  // array.len
+    kExprDrop,  // drop
+    kExprUnreachable,])  // unreachable
+  .exportFunc();
+
+builder.addFunction(null, 17).addBody([kExprUnreachable]);
+builder.addFunction(null, 0).addBody([kExprUnreachable]);
+
+assertTraps(kTrapNullDereference, () => builder.instantiate().exports.test());
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-14171.js b/deps/v8/test/mjsunit/regress/wasm/regress-14171.js
new file mode 100644
index 00000000000000..8162aa02614a57
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-14171.js
@@ -0,0 +1,33 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --liftoff --no-wasm-tier-up
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+(function () {
+  const builder = new WasmModuleBuilder();
+  builder.addImportedMemory("imports", "mem", 1);
+  builder.addType(makeSig([kWasmI32, kWasmI64], [kWasmI64]));
+  // Generate function 1 (out of 1).
+  builder.addFunction(undefined, 0 /* sig */).addBodyWithEnd([
+    kExprLocalGet, 0,
+    kExprLocalGet, 1,
+    kAtomicPrefix, kExprI64AtomicAdd, 0x03, 0x00,
+    kExprEnd
+  ]);
+  builder.addExport('atomicAddI64', 0);
+  var mem = new WebAssembly.Memory({ initial: 1 });
+
+  let i64arr = new BigUint64Array(mem.buffer);
+  new DataView(mem.buffer).setBigUint64(0, 0n, true);
+  new DataView(mem.buffer).setBigUint64(8, 0xffffffffn, true);
+
+  const instance = builder.instantiate({ imports: { mem: mem } });
+  assertEquals(0n, instance.exports.atomicAddI64(0, 1n));
+  assertEquals(1n, instance.exports.atomicAddI64(0, 0n));
+
+  assertEquals(0xffffffffn, instance.exports.atomicAddI64(8, 1n));
+  assertEquals(0x100000000n, instance.exports.atomicAddI64(8, 0n));
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1417516.js b/deps/v8/test/mjsunit/regress/wasm/regress-1417516.js
index 5a30107b3322f1..346ba81f0443e7 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-1417516.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1417516.js
@@ -8,7 +8,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
 const call_sig = builder.addType(kSig_v_v);
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addTable(kWasmFuncRef, 3, 4, undefined)
 builder.addFunction(undefined, kSig_i_iii)
   .addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-14270.js b/deps/v8/test/mjsunit/regress/wasm/regress-14270.js
new file mode 100644
index 00000000000000..717151991396a5
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-14270.js
@@ -0,0 +1,59 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-liftoff --no-wasm-lazy-compilation
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+// Tests that we do not reload the instance cache into the exceptional path
+// after throw/rethrow.
+(function () {
+  const builder = new WasmModuleBuilder();
+
+  builder.addMemory(16, 17, false);
+
+  builder.addTag(kSig_v_i);
+  builder.addTag(kSig_v_d);
+
+  builder.addFunction(
+    "test",
+    makeSig([kWasmI32, kWasmF32, kWasmI64, kWasmI32, kWasmF32, kWasmI64],
+            [kWasmF32]))
+    .addBody([
+      kExprTry, 0x7f,  // try @1 i32
+        kExprI32Const, 0x00,  // i32.const
+        kExprIf, 0x40,  // if @5
+          kExprNop,  // nop
+        kExprElse,  // else @8
+          kExprLoop, 0x40,  // loop @9
+            kExprI32Const, 0x00,  // i32.const
+            kExprIf, 0x7f,  // if @13 i32
+              kExprF64Const, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xb0, 0x43,
+              kExprThrow, 0x01,  // throw
+            kExprElse,  // else @26
+              kExprI32Const, 0xec, 0xc6, 0x7e,  // i32.const
+            kExprEnd,  // end @31
+            kExprBrIf, 0x00,  // br_if depth=0
+          kExprEnd,  // end @34
+          kExprUnreachable,  // unreachable
+        kExprEnd,  // end @36
+        kExprUnreachable,  // unreachable
+      kExprCatch, 0x01,  // catch @38
+        kExprDrop,  // drop
+        kExprI32Const, 0x16,  // i32.const
+        kExprF32LoadMem, 0x00, 0x00,  // f32.load
+        kExprDrop,  // drop
+        kExprI32Const, 0x00,  // i32.const
+      kExprCatch, 0x00,  // catch @49
+        kExprDrop,  // drop
+        kExprI32Const, 0x61,  // i32.const
+      kExprCatchAll,  // catch_all @54
+        kExprI32Const, 0x00,  // i32.const
+      kExprEnd,  // end @57
+      kExprDrop,  // drop
+      kExprF32Const, 0x00, 0x00, 0x10, 0x43,  // f32.const
+    ]);
+
+  builder.instantiate();
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1430858.js b/deps/v8/test/mjsunit/regress/wasm/regress-1430858.js
new file mode 100644
index 00000000000000..a8784687574fe7
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1430858.js
@@ -0,0 +1,46 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --wasm-lazy-compilation --wasm-test-streaming
+
+(function test() {
+  let bytes = new Uint8Array([
+    0x00, 0x61, 0x73, 0x6d,  // wasm magic
+    0x01, 0x00, 0x00, 0x00,  // wasm version
+
+    0x01,                    // section kind: Type
+    0x09,                    // section length 9
+    0x01, 0x60,              // types count 1:  kind: func
+    0x00,                    // param count 0
+    0x05,                    // return count 5
+    0x6f, 0x7e, 0x7d, 0x7e,  // externref i64 f32 i64
+    0x70,                    // funcref
+
+    0x03,                    // section kind: Function
+    0x02,                    // section length 2
+    0x01, 0x00,              // functions count 1: 0 $func0 (result externref) (result i64) (result f32) (result i64) (result funcref)
+
+    0x0a,                    // section kind: Code
+    0x15,                    // section length 21
+    0x01,                    // functions count 1
+                             // function #0 $func0
+    0x13,                    // body size 19
+    0x00,                    // 0 entries in locals list
+    0x00,                    // unreachable
+    0x00,                    // unreachable
+    0x00,                    // unreachable
+    0x00,                    // unreachable
+    0x00,                    // unreachable
+    0x00,                    // unreachable
+    0x00,                    // unreachable
+    0xfb, 0x4b, 0x00, 0x00,  // br_on_cast_fail null 0 $type0
+    0x14, 0x10,              // call_ref $type16
+    0xfb, 0x00,              // invalid opcode
+    0x68,                    // i32.ctz
+    0x2b, 0x26,              // f64.load align=64
+  ]);
+  assertPromiseResult(WebAssembly.compileStreaming(Promise.resolve(bytes)).then(
+    assertUnreachable,
+    error => assertInstanceof(error, WebAssembly.CompileError)));
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1432453.js b/deps/v8/test/mjsunit/regress/wasm/regress-1432453.js
new file mode 100644
index 00000000000000..a352713279a01e
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1432453.js
@@ -0,0 +1,27 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+builder.addType(makeSig([kWasmI32], [kWasmI64]));
+builder.addMemory(1, 1, true);
+// Generate function 1 (out of 1).
+builder.addFunction('main', 0 /* sig */)
+  .addLocals(kWasmI64, 1)
+  .addBodyWithEnd([
+// signature: l_i
+// body:
+kExprI32Const, 0x04,  // i32.const
+kExprI32Const, 0x00,  // i32.const
+kExprLocalGet, 0x00,  // local.get
+kExprI64SConvertI32,  // i64.extend_i32_s
+kExprLocalTee, 0x01,  // local.tee
+kAtomicPrefix, kExprI32AtomicWait, 0x02, 0x00,  // memory.atomic.wait32
+kExprDrop,  // drop
+kExprLocalGet, 0x01,  // local.get
+kExprEnd,  // end @29
+]).exportFunc();
+const instance = builder.instantiate();
+assertEquals(2000n, instance.exports.main(2000));
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1443218.js b/deps/v8/test/mjsunit/regress/wasm/regress-1443218.js
new file mode 100644
index 00000000000000..107021d8b249ed
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1443218.js
@@ -0,0 +1,18 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --wasm-debug-mask-for-testing=255
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+builder.addMemory();
+builder.addFunction('main', kSig_d_v)
+    .addBody([
+      ...wasmI32Const(0), kSimdPrefix, kExprS128Load32Splat, 0x01, 0x02,
+      kExprUnreachable
+    ])
+    .exportFunc();
+const instance = builder.instantiate();
+assertTraps(kTrapMemOutOfBounds, instance.exports.main);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1446221.js b/deps/v8/test/mjsunit/regress/wasm/regress-1446221.js
new file mode 100644
index 00000000000000..c7a6358aa541f8
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1446221.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-typed-funcref
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+builder.addMemory();
+let sig = makeSig([], new Array(16).fill(kWasmI32))
+builder.addFunction('main', sig)
+    .addBody([
+      kExprUnreachable,
+      kExprBrOnNull, 0,
+      kExprDrop
+    ])
+    .exportFunc();
+const instance = builder.instantiate();
+assertTraps(kTrapUnreachable, instance.exports.main);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1447367.js b/deps/v8/test/mjsunit/regress/wasm/regress-1447367.js
new file mode 100644
index 00000000000000..677ae953862780
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1447367.js
@@ -0,0 +1,32 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-inlining --no-liftoff --no-wasm-lazy-compilation
+
+// When inlining a tail call with multi-return inside a call with exceptions,
+// we need to set the control input of the projections to the IfSuccess node.
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+
+let tag = builder.addTag(kSig_v_v);
+
+let callee = builder.addFunction("callee", kSig_ii_i)
+  .addBody([kExprLocalGet, 0, kExprI32Const, 1, kExprI32Add,
+            kExprCallFunction, 2,
+            kExprLocalGet, 0, kExprI32Const, 1, kExprI32Sub,
+            kExprCallFunction, 2]);
+
+let tail_call = builder.addFunction("tail_call", kSig_ii_i)
+  .addBody([kExprLocalGet, 0, kExprReturnCall, callee.index]);
+
+builder.addFunction("caller", kSig_i_i)
+  .addBody([kExprTry, kWasmI32,
+              kExprLocalGet, 0, kExprCallFunction, tail_call.index, kExprI32Mul,
+            kExprCatch, tag,
+              kExprLocalGet, 0,
+            kExprEnd])
+
+builder.instantiate();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1448663.js b/deps/v8/test/mjsunit/regress/wasm/regress-1448663.js
new file mode 100644
index 00000000000000..6fecb2edbe86ab
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1448663.js
@@ -0,0 +1,22 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --no-wasm-lazy-compilation
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+builder.addFunction(undefined, kSig_v_a)
+  .addBody([
+    kExprLocalGet, 0,     // local.get
+    kExprRefAsNonNull,    // ref.as_non_null
+    kExprLocalGet, 0,     // local.get
+    kExprTry, kWasmF64,   // try f64
+      ...wasmF64Const(1), // f64.const
+    kExprCatchAll,        // catch_all
+      ...wasmF64Const(2), // f64.const
+      kExprEnd,           // end
+    kExprUnreachable,     // unreachable
+]);
+builder.toModule();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1449208.js b/deps/v8/test/mjsunit/regress/wasm/regress-1449208.js
new file mode 100644
index 00000000000000..6bf94b18295538
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1449208.js
@@ -0,0 +1,30 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-wasm-lazy-compilation --experimental-wasm-typed-funcref
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+{
+  const builder = new WasmModuleBuilder();
+
+  builder.addFunction("invalid_negative_heap", kSig_i_i)
+    .addBody([kExprRefNull, -0x30 & kLeb128Mask]);
+
+  assertThrows(() => builder.instantiate(), WebAssembly.CompileError,
+               /Unknown heap type/);
+}
+
+{
+  const builder = new WasmModuleBuilder();
+
+  // Keep in sync with wasm-limits.h.
+  let kWasmMaxTypes = 1000000;
+
+  builder.addFunction("invalid_positive_heap", kSig_i_i)
+    .addBody([kExprRefNull, ...wasmSignedLeb(kWasmMaxTypes)]);
+
+  assertThrows(() => builder.instantiate(), WebAssembly.CompileError,
+               /Type index .* is greater than the maximum number/);
+}
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1458941.js b/deps/v8/test/mjsunit/regress/wasm/regress-1458941.js
new file mode 100644
index 00000000000000..b91569a7ae8d07
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1458941.js
@@ -0,0 +1,33 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --no-liftoff
+
+// Regression test for https://crbug.com/1458941.
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+(function foo() {
+    let builder = new WasmModuleBuilder();
+    let array = builder.addArray(kWasmI32);
+    builder.addFunction(`brOnCastFail`,
+                        makeSig([], [kWasmI32]))
+        .addBody([
+            kExprBlock, kWasmRef, array,
+            kGCPrefix, kExprArrayNewFixed, array, 0,
+            ...wasmBrOnCastFail(0, wasmRefType(array), wasmRefType(array)),
+            kGCPrefix, kExprArrayLen,
+            kExprDrop,
+            kExprI32Const, 0,
+            kExprReturn,
+            kExprEnd,
+            kExprDrop,
+            kExprI32Const, 1,
+        ]).exportFunc();
+
+    let instance = builder.instantiate();
+    let wasm = instance.exports;
+
+    assertEquals(0, wasm.brOnCastFail());
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1460019.js b/deps/v8/test/mjsunit/regress/wasm/regress-1460019.js
new file mode 100644
index 00000000000000..00ed0484a48db8
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1460019.js
@@ -0,0 +1,23 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+builder.addType(makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]));
+builder.addMemory(1, 32);
+builder.addTable(wasmRefType(0), 2, 22, [kExprRefFunc, 0])
+// Generate function 1 (out of 1).
+builder.addFunction('main', 0 /* sig */)
+  .addBody([
+    kExprRefFunc, 0x00,  // ref.func
+    kExprI32Const, 0x00,  // i32.const 0
+    kExprMemoryGrow, 0x00,  // memory.grow
+    kNumericPrefix, kExprTableGrow, 0x00,  // table.grow
+    kExprUnreachable,  // unreachable
+]).exportFunc();
+const instance = builder.instantiate();
+assertTraps(kTrapUnreachable, instance.exports.main);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1466656.js b/deps/v8/test/mjsunit/regress/wasm/regress-1466656.js
new file mode 100644
index 00000000000000..ef6bf10ecec6d9
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1466656.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-wasm-lazy-compilation
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+
+// We were hitting this DCHECK in assembler-arm64.cc:
+//    DCHECK(IsImmLSUnscaled(addr.offset()));
+// because the tiering budget array is accessed at offset 16384 for function
+// 4096, and that offset is neiter `IsImmLSScaled` or `IsImmLSUnscaled`.
+const num_functions = 4097;
+for (let j = 0; j < num_functions; ++j) {
+  builder.addFunction(undefined, kSig_v_v)
+    .addBody([]);
+}
+builder.toModule();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1472618.js b/deps/v8/test/mjsunit/regress/wasm/regress-1472618.js
new file mode 100644
index 00000000000000..06b141f60a8486
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1472618.js
@@ -0,0 +1,19 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+(async function test() {
+  let promise = undefined;
+  let boom = {
+    toString: function() {
+      assertSame(undefined, promise);
+      promise = WebAssembly.instantiate();
+      throw new Error('foo');
+    }
+  };
+
+  assertThrows(
+      () => new WebAssembly.Memory({initial: boom, index: boom}), Error, 'foo');
+  assertInstanceof(promise, Promise);
+  assertThrowsAsync(promise);
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1473389.js b/deps/v8/test/mjsunit/regress/wasm/regress-1473389.js
new file mode 100644
index 00000000000000..38e32c811768f4
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1473389.js
@@ -0,0 +1,21 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+var memory_properties_1 = {};
+Object.defineProperty(memory_properties_1, 'initial', {
+  get: function() {
+    throw new Error('boom: initial');
+  }
+});
+assertThrows(
+    () => new WebAssembly.Memory(memory_properties_1), Error, 'boom: initial');
+
+var memory_properties_2 = {initial: 10};
+Object.defineProperty(memory_properties_2, 'maximum', {
+  get: function() {
+    throw new Error('boom: maximum');
+  }
+});
+assertThrows(
+    () => new WebAssembly.Memory(memory_properties_2), Error, 'boom: maximum');
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-1474252.js b/deps/v8/test/mjsunit/regress/wasm/regress-1474252.js
new file mode 100644
index 00000000000000..825315fb8116aa
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-1474252.js
@@ -0,0 +1,16 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+function __f_3(__v_212, __v_213) {
+  var __v_214 = Object.getOwnPropertyNames(__v_212);
+  if (__v_214.includes() && __v_17.constructor.hasOwnProperty()) {
+  }
+  return __v_214[__v_213 % __v_214.length];
+}
+var __v_239 = {element: 'anyfunc', initial: 10};
+__v_239.__defineGetter__(__f_3(__v_239, 1603979645), function() {
+  return __f_10();
+});
+
+assertThrows(() => new WebAssembly.Table(__v_239));
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-5531.js b/deps/v8/test/mjsunit/regress/wasm/regress-5531.js
index b745ff2323f6c1..23cbb5c2da7cb7 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-5531.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-5531.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   builder.addFunction("foo", kSig_i_v)
     .addBody([
               kExprI32Const, 0x00,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-5884.js b/deps/v8/test/mjsunit/regress/wasm/regress-5884.js
index 510625aa1b6964..dd84a71b0eb2c5 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-5884.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-5884.js
@@ -6,7 +6,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(31, 31, false);
+  builder.addMemory(31, 31);
   builder.addFunction('test', kSig_i_iii)
       .addBodyWithEnd([
         // body:
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-5888.js b/deps/v8/test/mjsunit/regress/wasm/regress-5888.js
index 47118887072207..e3fcf6e281c646 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-5888.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-5888.js
@@ -6,7 +6,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(32, 32, false);
+  builder.addMemory(32, 32);
   builder.addFunction("test", kSig_i_iii)
     .addBodyWithEnd([
 // body:
@@ -49,7 +49,7 @@ kExprEnd,   // @65
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(16, 32, false);
+  builder.addMemory(16, 32);
   builder.addFunction("test", kSig_i_iii)
     .addBodyWithEnd([
       // body:
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-5911.js b/deps/v8/test/mjsunit/regress/wasm/regress-5911.js
index 9799640d388390..5e569e97212963 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-5911.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-5911.js
@@ -6,7 +6,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 (function() {
     var builder = new WasmModuleBuilder();
-    builder.addMemory(32, 32, false);
+    builder.addMemory(32, 32);
     builder.addFunction("test", kSig_i_iii)
         .addBodyWithEnd([
             // body:
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-6054.js b/deps/v8/test/mjsunit/regress/wasm/regress-6054.js
index 20397916676fe9..8fbf01163c0f80 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-6054.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-6054.js
@@ -6,7 +6,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(16, 32, false);
+  builder.addMemory(16, 32);
   builder.addFunction('test', kSig_i_i)
       .addBodyWithEnd([
   kExprI32Const, 0x00,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-6164.js b/deps/v8/test/mjsunit/regress/wasm/regress-6164.js
index 1e68d872bc6c1d..6f5b3425b13cf3 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-6164.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-6164.js
@@ -6,7 +6,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(31, 31, false);
+  builder.addMemory(31, 31);
   builder.addFunction('test', kSig_l_v)
       .addBodyWithEnd([
 // body:
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-651961.js b/deps/v8/test/mjsunit/regress/wasm/regress-651961.js
index e3bc604b5e5ea3..7954889e6dab0a 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-651961.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-651961.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, 32, false);
+  builder.addMemory(1, 32);
   builder.addFunction("foo", kSig_i_v)
     .addBody([
               kExprMemorySize, kMemoryZero,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-654377.js b/deps/v8/test/mjsunit/regress/wasm/regress-654377.js
index 45ca10171feee8..558d8eddaf87ce 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-654377.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-654377.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   builder.addFunction("foo", kSig_i_v)
     .addBody([
               kExprI32Const, 00,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-667745.js b/deps/v8/test/mjsunit/regress/wasm/regress-667745.js
index c5d3edc97e33b4..bdc628b481be50 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-667745.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-667745.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(0, 0, false);
+  builder.addMemory(0, 0);
   builder.addFunction("test", kSig_i_iii)
     .addBody([
 kExprI32Const, 0x0b,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-688876.js b/deps/v8/test/mjsunit/regress/wasm/regress-688876.js
index 99a36085ac4d63..d79b5cc605c57c 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-688876.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-688876.js
@@ -6,7 +6,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(16, 32, false);
+  builder.addMemory(16, 32);
   builder.addFunction('test', kSig_i_i)
       .addBodyWithEnd([
   kExprI32Const, 0x41,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-689450.js b/deps/v8/test/mjsunit/regress/wasm/regress-689450.js
index 42e2a722abd627..b2e7de81bb77fa 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-689450.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-689450.js
@@ -6,7 +6,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(16, 32, false);
+  builder.addMemory(16, 32);
   builder.addFunction('test', kSig_i_i)
       .addBodyWithEnd([
               kExprLocalGet, 0x00,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-6931.js b/deps/v8/test/mjsunit/regress/wasm/regress-6931.js
index 9fff087d4a8536..45a6b78d622cde 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-6931.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-6931.js
@@ -15,7 +15,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function() {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   builder.addFunction('test', kSig_v_v)
       .addBody([
         kExprI32Const, 0x7c, // address = -4
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-694433.js b/deps/v8/test/mjsunit/regress/wasm/regress-694433.js
index b63f390c622fe5..8d468369b8ca76 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-694433.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-694433.js
@@ -7,8 +7,12 @@
 var size = Math.floor(0xFFFFFFFF / 4) + 1;
 (function() {
   // Note: On 32 bit, this throws in the Uint16Array constructor (size does not
-  // fit in a Smi). On 64 bit, it throws in WebAssembly.validate, because the
+  // fit in a Smi). On 64 bit, WebAssembly.validate returns false, because the
   // size exceeds the internal module size limit.
-  assertThrows(() => WebAssembly.validate(new Uint16Array(size)), RangeError);
+  try {
+    assertFalse(WebAssembly.validate(new Uint16Array(size)));
+  } catch {
+    assertThrows(() => new Uint16Array(size), RangeError);
+  }
 })();
 gc();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-699485.js b/deps/v8/test/mjsunit/regress/wasm/regress-699485.js
index ae47304f2f891c..241937fb525a4d 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-699485.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-699485.js
@@ -9,7 +9,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 (function() {
 "use asm";
 var builder = new WasmModuleBuilder();
-builder.addMemory(0, 5, false);
+builder.addMemory(0, 5);
 builder.addFunction("regression_699485", kSig_i_v)
   .addBody([
       kExprI32Const, 0x04,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-710844.js b/deps/v8/test/mjsunit/regress/wasm/regress-710844.js
index 48adf42a2e9511..9b6d4e04bd5b60 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-710844.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-710844.js
@@ -7,7 +7,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 (function() {
   "use asm";
   var builder = new WasmModuleBuilder();
-  builder.addMemory(0, 5, true);
+  builder.addMemory(0, 5);
   builder.addFunction("regression_710844", kSig_v_v)
     .addBody([
         kExprI32Const, 0x03,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-711203.js b/deps/v8/test/mjsunit/regress/wasm/regress-711203.js
index 02937de096d6c8..c7ef777ebe9987 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-711203.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-711203.js
@@ -6,7 +6,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 (function() {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(16, 32, false);
+  builder.addMemory(16, 32);
   builder.addFunction("test", kSig_i_iii)
       .addBodyWithEnd([
         // body:
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-724972.js b/deps/v8/test/mjsunit/regress/wasm/regress-724972.js
index c56a8f754b6fb2..34de30ccbf7870 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-724972.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-724972.js
@@ -5,6 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 var builder = new WasmModuleBuilder();
-builder.addMemory(0, 0, true);
+builder.addMemory(0, 0);
+builder.exportMemoryAs('memory');
 var instance = builder.instantiate();
 instance.exports.memory.buffer;
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-727222.js b/deps/v8/test/mjsunit/regress/wasm/regress-727222.js
index ea70e11d33ea26..a88c2ffebac168 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-727222.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-727222.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 var builder = new WasmModuleBuilder();
-builder.addMemory(0, 0, false);
+builder.addMemory(0, 0);
 builder.addFunction('f', kSig_i_v)
     .addBody([kExprMemorySize, kMemoryZero])
     .exportFunc();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-763439.js b/deps/v8/test/mjsunit/regress/wasm/regress-763439.js
index 375be496ebe390..2bf1ebbfaec57d 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-763439.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-763439.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 var builder = new WasmModuleBuilder();
-builder.addMemory(0, 1234, false);
+builder.addMemory(0, 1234);
 builder.addFunction('f', kSig_i_v)
     .addBody([
       kExprI32Const, 0x1d,                       // --
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-769637.js b/deps/v8/test/mjsunit/regress/wasm/regress-769637.js
index 29b24ded05944b..30431b71aca9df 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-769637.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-769637.js
@@ -5,9 +5,8 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 let builder = new WasmModuleBuilder();
-builder
-    .addMemory()
-    .addFunction("main", kSig_v_v)
+builder.addMemory();
+builder.addFunction("main", kSig_v_v)
     .addBody([kExprI32Const, 4,
               kExprI32Const, 8,
               kExprI32StoreMem, 0, 16])
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-776677.js b/deps/v8/test/mjsunit/regress/wasm/regress-776677.js
deleted file mode 100644
index 87bf8fac7eff1e..00000000000000
--- a/deps/v8/test/mjsunit/regress/wasm/regress-776677.js
+++ /dev/null
@@ -1,30 +0,0 @@
-// Copyright 2017 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-function module(stdlib,foreign,buffer) {
-  "use asm";
-  var fl = new stdlib.Uint32Array(buffer);
-  function f1(x) {
-    x = x | 0;
-    fl[0] = x;
-    fl[0x10000] = x;
-    fl[0x100000] = x;
-  }
-  return f1;
-}
-
-var global = {Uint32Array:Uint32Array};
-var env = {};
-memory = new WebAssembly.Memory({initial:128});
-var buffer = memory.buffer;
-evil_f = module(global,env,buffer);
-
-zz = {};
-zz.toString = function() {
-  Array.prototype.slice.call([]);
-  return 0xffffffff;
-}
-evil_f(3);
-assertThrows(() => memory.grow(1), RangeError);
-evil_f(zz);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-7914.js b/deps/v8/test/mjsunit/regress/wasm/regress-7914.js
index 3e90aa0aa81bf2..6bb273f09e1e70 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-7914.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-7914.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 builder.addFunction('main', kSig_i_v)
     .addBody([
       ...wasmI32Const(10000),  // i32.const 10000
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-894374.js b/deps/v8/test/mjsunit/regress/wasm/regress-894374.js
index 2e6e03b16a7642..bd233f8072cf90 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-894374.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-894374.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(16, 32, false);
+builder.addMemory(16, 32);
 const sig = makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]);
 builder.addFunction(undefined, sig)
   .addBodyWithEnd([
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-9425.js b/deps/v8/test/mjsunit/regress/wasm/regress-9425.js
index 8b51fc5eec875a..160c064d78b9b5 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-9425.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-9425.js
@@ -6,7 +6,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 var builder = new WasmModuleBuilder();
 
-builder.addMemory(1, 1, /*exp*/ false, /*shared*/ true);
+builder.addMemory(1, 1, /*shared*/ true);
 
 builder.addFunction('test', kSig_v_v).addBody([
   kExprI32Const, 0,                         //
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-968078.js b/deps/v8/test/mjsunit/regress/wasm/regress-968078.js
index 60c25d174b7c1e..d115af64fe8be5 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-968078.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-968078.js
@@ -24,7 +24,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
     return Array.from(bytes.trunc_buffer());
   }
   var builder = new WasmModuleBuilder();
-  builder.addMemory(12, 12, false);
+  builder.addMemory(12, 12);
   builder.addFunction("foo", kSig_v_iii)
     .addBody([].concat([
       kExprBlock, kWasmVoid,
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1338075.js b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1338075.js
index 071e0a3d015c1d..3c09d42f3112a4 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1338075.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1338075.js
@@ -5,7 +5,7 @@
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 let builder = new WasmModuleBuilder();
-builder.addMemory(1, 10, true);
+builder.addMemory(1, 10);
 
 builder.addFunction("crash", kSig_i_i)
   .exportFunc()
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1366399.js b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1366399.js
new file mode 100644
index 00000000000000..44cc9986b7f7fe
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1366399.js
@@ -0,0 +1,63 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+var builder = new WasmModuleBuilder();
+
+let callee = builder.addFunction('callee', kSig_i_v).addBody([
+    kExprI32Const, 1,
+]);
+
+let kLastLocalIndex = 600;
+let kNumLocals = kLastLocalIndex + 1;
+let kDelta = 10;
+let kExpectedResult = kLastLocalIndex + kDelta;
+
+function MakeBody(variant) {
+    let body = [];
+
+    // Initialize all locals with constants.
+    for (let i = 0; i <= kLastLocalIndex; i++) {
+        body.push(...wasmI32Const(i), kExprLocalSet, ...wasmUnsignedLeb(i));
+    }
+
+    // Last local += kDelta (causes it to be held in a register).
+    body.push(
+        kExprLocalGet, ...wasmUnsignedLeb(kLastLocalIndex),
+        kExprI32Const, kDelta,
+        kExprI32Add,
+        kExprLocalSet, ...wasmUnsignedLeb(kLastLocalIndex));
+
+    // If (false) { call callee; }
+    body.push(
+        kExprLocalGet, ...wasmUnsignedLeb(kLastLocalIndex),
+        ...wasmI32Const(kLastLocalIndex + 2 * kDelta),
+        kExprI32GtU,
+        kExprIf, kWasmVoid,
+        kExprCallFunction, callee.index);
+    if (variant == 0) {
+        body.push(kExprDrop);
+    } else if (variant == 1) {
+        // Early control flow edges to the {end} take a different code path.
+        body.push(kExprBrIf, 0);
+    }
+    body.push(kExprEnd);
+
+    body.push(kExprLocalGet, ...wasmUnsignedLeb(kLastLocalIndex));
+    return body;
+}
+
+builder.addFunction('test1', kSig_i_v)
+    .exportFunc()
+    .addLocals(kWasmI32, kNumLocals)
+    .addBody(MakeBody(0));
+builder.addFunction('test2', kSig_i_v)
+    .exportFunc()
+    .addLocals(kWasmI32, kNumLocals)
+    .addBody(MakeBody(1));
+
+let instance = builder.instantiate();
+assertEquals(kExpectedResult, instance.exports.test1());
+assertEquals(kExpectedResult, instance.exports.test2());
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1407594.js b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1407594.js
index 943ba85be46346..beb00e9312e92c 100644
--- a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1407594.js
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1407594.js
@@ -5,7 +5,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 let builder = new WasmModuleBuilder();
-builder.addMemory(1, 1, false);
+builder.addMemory(1, 1);
 builder.addDataSegment(0, [0x78, 0x56, 0x34, 0x12]);
 
 let spiller = builder.addFunction('spiller', kSig_v_v).addBody([]);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1463219.js b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1463219.js
new file mode 100644
index 00000000000000..64902a369ed517
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1463219.js
@@ -0,0 +1,8 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-type-reflection --experimental-wasm-typed-funcref
+
+new WebAssembly.Function(
+    {parameters: ['i64', 'i64'], results: ['i32']}, (_) => 0);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1463232.js b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1463232.js
new file mode 100644
index 00000000000000..383d06d6b4c404
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1463232.js
@@ -0,0 +1,79 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-stringref --experimental-wasm-gc
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+(function CastToView() {
+  let builder = new WasmModuleBuilder();
+
+  builder.addFunction("main", kSig_v_r)
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCastNull, kStringViewWtf16Code,
+      kExprDrop,
+    ]).exportFunc();
+
+  assertThrows(() => builder.instantiate().exports.main("foo"),
+               WebAssembly.CompileError,
+               /string views are not classifiable/);
+})();
+
+(function TestView() {
+  let builder = new WasmModuleBuilder();
+
+  builder.addFunction("main", kSig_v_r)
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefTestNull, kStringViewWtf16Code,
+      kExprDrop,
+    ]).exportFunc();
+
+    assertThrows(() => builder.instantiate().exports.main("foo"),
+                 WebAssembly.CompileError,
+                 /string views are not classifiable/);
+})();
+
+(function TestBranchOnCast() {
+  let builder = new WasmModuleBuilder();
+
+  const view = kStringViewWtf16Code;
+
+  builder.addFunction("main", kSig_v_r)
+    .addBody([
+      kExprBlock, kWasmVoid,
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprBrOnCastGeneric, 0b11, 0, kAnyRefCode, view,
+      kExprDrop,
+      kExprEnd,
+    ]).exportFunc();
+
+    assertThrows(() => builder.instantiate().exports.main("foo"),
+                 WebAssembly.CompileError,
+                 /invalid types for br_on_cast/);
+})();
+
+(function TestBranchOnCastFail() {
+  let builder = new WasmModuleBuilder();
+
+  const view = kStringViewWtf16Code;
+
+  builder.addFunction("main", kSig_v_r)
+    .addBody([
+      kExprBlock, kWasmVoid,
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprBrOnCastFailGeneric, 0b11, 0, kAnyRefCode, view,
+      kExprDrop,
+      kExprEnd,
+    ]).exportFunc();
+
+    assertThrows(() => builder.instantiate().exports.main("foo"),
+                 WebAssembly.CompileError,
+                 /invalid types for br_on_cast/);
+})();
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1464604.js b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1464604.js
new file mode 100644
index 00000000000000..4d5cdbf27e55b9
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1464604.js
@@ -0,0 +1,71 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --no-liftoff
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+const builder = new WasmModuleBuilder();
+let struct_type = builder.addStruct([makeField(kWasmStructRef, false)]);
+let struct_type2 =
+    builder.addStruct([makeField(wasmRefType(kWasmStructRef), false)]);
+let field_index = 0;
+
+builder.addFunction('cast_i31', kSig_v_v)
+  .exportFunc()
+  .addBody([
+    kExprRefNull, struct_type,
+    kGCPrefix, kExprStructGet, struct_type, field_index,
+    kGCPrefix, kExprRefCastNull, kI31RefCode,
+    kExprDrop,
+  ]);
+
+builder.addFunction('cast_i31_nn', kSig_v_v)
+  .exportFunc()
+  .addBody([
+    kExprRefNull, struct_type2,
+    kGCPrefix, kExprStructGet, struct_type2, field_index,
+    kGCPrefix, kExprRefCast, kI31RefCode,
+    kExprDrop,
+  ]);
+
+builder.addFunction('cast_eq', kSig_v_v)
+  .exportFunc()
+  .addBody([
+    kExprRefNull, struct_type,
+    kGCPrefix, kExprStructGet, struct_type, field_index,
+    kGCPrefix, kExprRefCastNull, kEqRefCode,
+    kExprDrop,
+  ]);
+
+builder.addFunction('test_i31', kSig_v_v)
+  .exportFunc()
+  .addBody([
+    kExprRefNull, struct_type,
+    kGCPrefix, kExprStructGet, struct_type, field_index,
+    kGCPrefix, kExprRefTestNull, kI31RefCode,
+    kExprDrop,
+  ]);
+
+builder.addFunction('test_eq', kSig_v_v)
+  .exportFunc()
+  .addBody([
+    kExprRefNull, struct_type,
+    kGCPrefix, kExprStructGet, struct_type, field_index,
+    kGCPrefix, kExprRefTestNull, kEqRefCode,
+    kExprDrop,
+  ]);
+
+const instance = builder.instantiate();
+
+assertThrows(() => instance.exports.cast_i31(), WebAssembly.RuntimeError,
+             'dereferencing a null pointer');
+assertThrows(() => instance.exports.cast_i31_nn(), WebAssembly.RuntimeError,
+             'dereferencing a null pointer');
+assertThrows(() => instance.exports.cast_eq(), WebAssembly.RuntimeError,
+             'dereferencing a null pointer');
+assertThrows(() => instance.exports.test_i31(), WebAssembly.RuntimeError,
+             'dereferencing a null pointer');
+assertThrows(() => instance.exports.test_eq(), WebAssembly.RuntimeError,
+             'dereferencing a null pointer');
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1465386.js b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1465386.js
new file mode 100644
index 00000000000000..706c3dc33cd7ec
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1465386.js
@@ -0,0 +1,81 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --no-liftoff
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+let builder = new WasmModuleBuilder();
+
+let sig1 = builder.addType(makeSig(
+    [
+      kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmF32,
+      kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmAnyRef,
+    ],
+    []));
+let sig2 = builder.addType(makeSig(
+    [
+      kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmF32, kWasmS128,
+      kWasmS128, kWasmS128, kWasmS128, kWasmS128, kWasmS128, kWasmS128
+    ],
+    []));
+let sig3 = builder.addType(makeSig([kWasmS128, kWasmS128], []));
+
+let main = builder.addFunction('main', kSig_v_i).exportFunc();
+let func1 = builder.addFunction('func1', sig1);
+let func2 = builder.addFunction('func2', sig2).addBody([]);
+let func3 = builder.addFunction('func3', sig3).addBody([]);
+
+let table = builder.addTable(kWasmFuncRef, 4, 4);
+
+builder.addActiveElementSegment(
+    table.index, wasmI32Const(0),
+    [
+      [kExprRefFunc, main.index], [kExprRefFunc, func1.index],
+      [kExprRefFunc, func2.index], [kExprRefFunc, func3.index]
+    ],
+    kWasmFuncRef);
+
+let main_body = [
+  // Recursion breaker.
+  kExprLocalGet, 0,
+  kExprI32Eqz,
+  kExprBrIf, 0
+];
+// Useless calls, just to create stack values.
+for (let j = 0; j < 2; j++) {
+  for (let i = 0; i < 13; i++) {
+    main_body.push(...wasmF32Const(i));
+  }
+  main_body.push(kExprRefNull, kAnyRefCode);
+  main_body.push(kExprCallFunction, func1.index);
+}
+main_body.push(...[
+  // Recursive call.
+  kExprLocalGet, 0,
+  kExprI32Const, 1,
+  kExprI32Sub,
+  kExprCallFunction, main.index,
+]);
+main.addBody(main_body);
+
+let func1_body = [];
+for (let i = 0; i < 2; i++) {
+  func1_body.push(kExprI32Const, 0, kSimdPrefix, kExprI8x16Splat);
+}
+func1_body.push(kExprI32Const, 3);
+func1_body.push(kExprCallIndirect, sig3, table.index);
+
+for (let i = 0; i < 6; i++) {
+  func1_body.push(...wasmF32Const(i));
+}
+for (let i = 0; i < 7; i++) {
+  func1_body.push(kExprI32Const, 0, kSimdPrefix, kExprI8x16Splat);
+}
+func1_body.push(kExprI32Const, 2);
+func1_body.push(kExprReturnCallIndirect, sig2, table.index);
+func1.addBody(func1_body);
+
+let instance = builder.instantiate();
+instance.exports.main(3);
diff --git a/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1466312.js b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1466312.js
new file mode 100644
index 00000000000000..223310eea1f6a2
--- /dev/null
+++ b/deps/v8/test/mjsunit/regress/wasm/regress-crbug-1466312.js
@@ -0,0 +1,17 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --experimental-wasm-stringref
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+
+builder.addFunction("main", kSig_i_v).exportFunc().addBodyWithEnd([
+  kExprRefNull, kStringViewIterCode,
+  kGCPrefix, kExprRefTestNull, kAnyRefCode,
+  kExprEnd,
+]);
+const instance = builder.instantiate();
+assertEquals(0, instance.exports.main());
diff --git a/deps/v8/test/mjsunit/sealed-array-reduce.js b/deps/v8/test/mjsunit/sealed-array-reduce.js
index 87f5fdecc39fdd..125fbffc33ced3 100644
--- a/deps/v8/test/mjsunit/sealed-array-reduce.js
+++ b/deps/v8/test/mjsunit/sealed-array-reduce.js
@@ -718,10 +718,11 @@ assertEquals(undefined, Object.seal(arr).reduceRight(function(val) { return val
   g(); g();
   let total = g();
   %OptimizeFunctionOnNextCall(g);
+  var turbofan = willBeTurbofanned(g);
   g();
   g();
   assertEquals(total, g());
-  assertOptimized(g);
+  if (turbofan) assertOptimized(g);
 })();
 
 (function ReduceThrow() {
@@ -1089,10 +1090,11 @@ assertEquals(undefined, Object.seal(arr).reduceRight(function(val) { return val
   g(); g();
   let total = g();
   %OptimizeFunctionOnNextCall(g);
+  var turbofan = willBeTurbofanned(g);
   g();
   g();
   assertEquals(total, g());
-  assertOptimized(g);
+  if (turbofan) assertOptimized(g);
 })();
 
 (function ReduceThrow() {
diff --git a/deps/v8/test/mjsunit/shared-memory/brand-checks.js b/deps/v8/test/mjsunit/shared-memory/brand-checks.js
new file mode 100644
index 00000000000000..ab43747d3cf3cd
--- /dev/null
+++ b/deps/v8/test/mjsunit/shared-memory/brand-checks.js
@@ -0,0 +1,61 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-struct
+
+function TestBrandChecks(struct1, struct2, sa, mutex, cv) {
+  assertTrue(SharedStructType.isSharedStruct(struct1));
+  assertTrue(SharedStructType.isSharedStruct(struct2));
+  for (const x of [sa, mutex, cv]) {
+    assertFalse(SharedStructType.isSharedStruct(x));
+  }
+
+  assertTrue(SharedArray.isSharedArray(sa));
+  assertTrue(sa instanceof SharedArray);
+  for (const x of [struct1, struct2, mutex, cv]) {
+    assertFalse(SharedArray.isSharedArray(x));
+  }
+
+  assertTrue(Atomics.Mutex.isMutex(mutex));
+  assertTrue(mutex instanceof Atomics.Mutex);
+  for (const x of [struct1, struct2, sa, cv]) {
+    assertFalse(Atomics.Mutex.isMutex(x));
+  }
+
+  assertTrue(Atomics.Condition.isCondition(cv));
+  assertTrue(cv instanceof Atomics.Condition);
+  for (const x of [struct1, struct2, sa, mutex]) {
+    assertFalse(Atomics.Condition.isCondition(x));
+  }
+
+  const falsehoods = [42, -0, undefined, null, true, false, 'foo', {}, []];
+  for (const x of falsehoods) {
+    assertFalse(SharedStructType.isSharedStruct(x));
+    assertFalse(SharedArray.isSharedArray(x));
+    assertFalse(Atomics.Mutex.isMutex(x));
+    assertFalse(Atomics.Condition.isCondition(x));
+  }
+}
+
+// Test same Realm.
+const S1 = new SharedStructType(['field']);
+const S2 = new SharedStructType(['field2']);
+const struct1 = new S1();
+const struct2 = new S2();
+const sa = new SharedArray(1);
+const mutex = new Atomics.Mutex();
+const cv = new Atomics.Condition();
+TestBrandChecks(struct1, struct2, sa, mutex, cv);
+
+// Test cross-Realm.
+const [otherStruct1, otherStruct2, otherSa, otherMutex, otherCv] =
+    Realm.eval(Realm.create(), `const S1 = new SharedStructType(['field']);
+const S2 = new SharedStructType(['field2']);
+const struct1 = new S1();
+const struct2 = new S2();
+const sa = new SharedArray(1);
+const mutex = new Atomics.Mutex();
+const cv = new Atomics.Condition();
+[struct1, struct2, sa, mutex, cv]`);
+TestBrandChecks(otherStruct1, otherStruct2, otherSa, otherMutex, otherCv);
diff --git a/deps/v8/test/mjsunit/shared-memory/non-instance-prototype.js b/deps/v8/test/mjsunit/shared-memory/optimize-non-instance.js
similarity index 61%
rename from deps/v8/test/mjsunit/shared-memory/non-instance-prototype.js
rename to deps/v8/test/mjsunit/shared-memory/optimize-non-instance.js
index e4cef06120d7d2..46df6dcfb0a8f8 100644
--- a/deps/v8/test/mjsunit/shared-memory/non-instance-prototype.js
+++ b/deps/v8/test/mjsunit/shared-memory/optimize-non-instance.js
@@ -7,16 +7,16 @@
 function Foo() {}
 
 function TestInstanceOfMutex() {
-  Foo instanceof Atomics.Mutex;
+  return Foo instanceof Atomics.Mutex;
 }
 function TestInstanceOfCondition() {
-  Foo instanceof Atomics.Condition;
+  return Foo instanceof Atomics.Condition;
 }
 function TestInstanceOfSharedArray() {
-  Foo instanceof SharedArray;
+  return Foo instanceof SharedArray;
 }
 function TestInstanceOfSharedStruct() {
-  Foo instanceof (new SharedStructType(["foo"]));
+  return Foo instanceof (new SharedStructType(["foo"]));
 }
 
 %PrepareFunctionForOptimization(TestInstanceOfMutex);
@@ -25,10 +25,10 @@ function TestInstanceOfSharedStruct() {
 %PrepareFunctionForOptimization(TestInstanceOfSharedStruct);
 
 for (let i = 0; i < 10; i++) {
-  assertThrows(TestInstanceOfMutex, TypeError);
-  assertThrows(TestInstanceOfCondition, TypeError);
-  assertThrows(TestInstanceOfSharedArray, TypeError);
-  assertThrows(TestInstanceOfSharedStruct, TypeError);
+  assertFalse(TestInstanceOfMutex());
+  assertFalse(TestInstanceOfCondition());
+  assertFalse(TestInstanceOfSharedArray());
+  assertFalse(TestInstanceOfSharedStruct());
 }
 
 %OptimizeFunctionOnNextCall(TestInstanceOfMutex);
@@ -36,7 +36,7 @@ for (let i = 0; i < 10; i++) {
 %OptimizeFunctionOnNextCall(TestInstanceOfSharedArray);
 %OptimizeFunctionOnNextCall(TestInstanceOfSharedStruct);
 
-assertThrows(TestInstanceOfMutex, TypeError);
-assertThrows(TestInstanceOfCondition, TypeError);
-assertThrows(TestInstanceOfSharedArray, TypeError);
-assertThrows(TestInstanceOfSharedStruct, TypeError);
+assertFalse(TestInstanceOfMutex());
+assertFalse(TestInstanceOfCondition());
+assertFalse(TestInstanceOfSharedArray());
+assertFalse(TestInstanceOfSharedStruct());
diff --git a/deps/v8/test/mjsunit/shared-memory/private-brand.js b/deps/v8/test/mjsunit/shared-memory/private-brand.js
new file mode 100644
index 00000000000000..0dabcbebfca31a
--- /dev/null
+++ b/deps/v8/test/mjsunit/shared-memory/private-brand.js
@@ -0,0 +1,26 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-struct
+
+// Private brands from private methods should not be able to extend shared
+// objects. This is unlike ordinary objects, which can get private fields even
+// if sealed/frozen.
+
+function TestSharedObjectCannotAddPrivateBrand(sharedObj) {
+  function Base() {
+    return sharedObj;
+  }
+  assertThrows(() => {
+    class C extends Base {
+      #o() {}
+    }
+    return new C();
+  });
+}
+
+TestSharedObjectCannotAddPrivateBrand(new Atomics.Condition());
+TestSharedObjectCannotAddPrivateBrand(new Atomics.Mutex());
+TestSharedObjectCannotAddPrivateBrand(new (new SharedStructType(['p'])));
+TestSharedObjectCannotAddPrivateBrand(new SharedArray(1));
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1394741.js b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1394741.js
similarity index 100%
rename from deps/v8/test/mjsunit/regress/regress-crbug-1394741.js
rename to deps/v8/test/mjsunit/shared-memory/regress-crbug-1394741.js
diff --git a/deps/v8/test/mjsunit/regress/regress-crbug-1395117.js b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1395117.js
similarity index 100%
rename from deps/v8/test/mjsunit/regress/regress-crbug-1395117.js
rename to deps/v8/test/mjsunit/shared-memory/regress-crbug-1395117.js
diff --git a/deps/v8/test/mjsunit/shared-memory/regress-crbug-1425710.js b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1425710.js
index fd2b2264b765d8..4372ebbe5980e8 100644
--- a/deps/v8/test/mjsunit/shared-memory/regress-crbug-1425710.js
+++ b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1425710.js
@@ -4,14 +4,14 @@
 //
 // Flags: --harmony-struct --expose-gc --expose-externalize-string
 
-const str = String.fromCharCode(849206214);
+const str = String.fromCharCode(849206214, 00, 00);
 gc();
 const Bar = this.SharedStructType("a");
 const bar = Bar();
 bar.a = str;
 externalizeString(str);
 bar[str] = 'foo';
-const str2 = String.fromCharCode(849206214);
+const str2 = String.fromCharCode(849206214, 00, 00);
 gc();
 const bar2 = Bar();
 bar2.a = str2;
diff --git a/deps/v8/test/mjsunit/shared-memory/regress-crbug-1429570.js b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1429570.js
new file mode 100644
index 00000000000000..630be4d2dac87d
--- /dev/null
+++ b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1429570.js
@@ -0,0 +1,15 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --harmony-struct
+
+const t0 = this.SharedStructType(['a']);
+const v6 = t0();
+function f10(a11) {
+  a11[1] = 0.1;
+}
+f10(Array());
+f10(v6);
+f10(v6);
+assertEquals(undefined, v6[1]);
diff --git a/deps/v8/test/mjsunit/shared-memory/regress-crbug-1441241.js b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1441241.js
new file mode 100644
index 00000000000000..c0e0cddd24faa3
--- /dev/null
+++ b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1441241.js
@@ -0,0 +1,20 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --harmony-struct
+
+const sharedCtors = [
+  new SharedStructType(['x']), SharedArray, Atomics.Mutex, Atomics.Condition
+];
+
+for (let ctor of sharedCtors) {
+  (function TestSharedConstructors(C) {
+    function f(a) {
+      a.stack = "boom";
+    }
+    %PrepareFunctionForOptimization(f);
+    Error.captureStackTrace(f);
+    f(C);
+  })(ctor);
+}
diff --git a/deps/v8/test/mjsunit/shared-memory/regress-crbug-1449611.js b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1449611.js
new file mode 100644
index 00000000000000..4a48effdcda961
--- /dev/null
+++ b/deps/v8/test/mjsunit/shared-memory/regress-crbug-1449611.js
@@ -0,0 +1,13 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --jit-fuzzing --harmony-struct
+
+function f(a) { a[4] = 42; }
+
+for (let i = 0; i < 2; i++) {
+  f([]);
+  f(Atomics.Mutex());
+  f(Atomics.Condition());
+}
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-array-atomics-workers.js b/deps/v8/test/mjsunit/shared-memory/shared-array-atomics-workers.js
index 2bf24be3d717ea..8b46b5c4e9a770 100644
--- a/deps/v8/test/mjsunit/shared-memory/shared-array-atomics-workers.js
+++ b/deps/v8/test/mjsunit/shared-memory/shared-array-atomics-workers.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --shared-string-table --harmony-struct --allow-natives-syntax
+// Flags: --shared-string-table --harmony-struct
 
 'use strict';
 
@@ -39,4 +39,48 @@ if (this.Worker) {
 
     worker.terminate();
   })();
+
+  (function TestCompareExchange() {
+    // Test that we can perform compareExchange simultaneously on 2 threads.
+    // One thread will update the value only after the other thread has
+    // performed an update.
+
+    const ST = new SharedStructType(['field']);
+    const s = new ST();
+    const arr = new SharedArray(1);
+
+    // Odd number of values so the main thread perfoms the last compareExchange.
+    let testValues =
+        [0, 1.5, undefined, null, true, false, 'foo', s, new SharedArray(1)];
+    let sharedtestValues = new SharedArray(testValues.length);
+    Object.assign(sharedtestValues, testValues);
+
+    let workerScript = `onmessage = function(e) {
+      const arr = e[0];
+      let i = 0;
+      const testValues = e[1];
+      while(i < testValues.length - 1) {
+        let value = testValues[i];
+        let nextValue = testValues[i+1];
+        if (value === Atomics.compareExchange(arr, 0, value, nextValue)) {
+          i += 2;
+        }
+      }
+    }`
+
+    let worker = new Worker(workerScript, {type: 'string'});
+    worker.postMessage([arr, sharedtestValues]);
+    arr[0] = testValues[0];
+    let i = 1;
+    while (i < testValues.length - 1) {
+      let value = testValues[i];
+      let nextValue = testValues[i + 1];
+      if (value === Atomics.compareExchange(arr, 0, value, nextValue)) {
+        i += 2;
+      }
+    }
+
+    assertEquals(testValues[testValues.length - 1], arr[0]);
+    worker.terminate();
+  })();
 }
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-array-atomics.js b/deps/v8/test/mjsunit/shared-memory/shared-array-atomics.js
index 4041f70ad6d418..bc27a8105f5cb9 100644
--- a/deps/v8/test/mjsunit/shared-memory/shared-array-atomics.js
+++ b/deps/v8/test/mjsunit/shared-memory/shared-array-atomics.js
@@ -2,14 +2,14 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --shared-string-table --harmony-struct
+// Flags: --shared-string-table --harmony-struct --allow-natives-syntax
 
 'use strict';
 
 (function TestPrimitivesUsingAtomics() {
   // All primitives can be stored in fields.
   const prims = [42, -0, undefined, null, true, false, 'foo'];
-  let arr = new SharedArray(1);
+  const arr = new SharedArray(1);
   for (let prim of prims) {
     Atomics.store(arr, 0, prim);
     assertEquals(Atomics.load(arr, 0), prim);
@@ -22,6 +22,18 @@
       assertEquals(arr[0], prim2);
     }
   }
+
+  const primsCopy = [42, -0, undefined, null, true, false, 'foo'];
+  for (let i = 0; i < prims.length; i++) {
+    const prim = prims[i];
+    const primCopy = primsCopy[i];
+    arr[0] = prim;
+    // Atomics.compareExchange mimics `===` comparison.
+    assertEquals(Atomics.compareExchange(arr, 0, '42', 'exchanged'), prim);
+    assertEquals(arr[0], prim);
+    assertEquals(Atomics.compareExchange(arr, 0, primCopy, 'exchanged'), prim);
+    assertEquals(arr[0], 'exchanged');
+  }
 })();
 
 (function TestObjectsUsingAtomics() {
@@ -43,9 +55,52 @@
   Atomics.store(arr, 0, shared_rhs);
   assertEquals(Atomics.load(arr, 0), shared_rhs);
 
+  // Test we can exchange shared objects.
   let shared_rhs2 = new SharedArray(10);
   assertEquals(Atomics.exchange(arr, 0, shared_rhs2), shared_rhs);
   assertEquals(arr[0], shared_rhs2);
+
+  assertEquals(Atomics.exchange(arr, 0, shared_rhs), shared_rhs2);
+  assertEquals(arr[0], shared_rhs);
+
+  // Verify we can compare-exchange shared objects.
+
+  // Comparing to a different instance of the same type is not succesful.
+  assertEquals(
+      Atomics.compareExchange(arr, 0, new Struct(), 'exchanged'), shared_rhs);
+  assertNotEquals(arr[0], 'exchanged');
+
+  assertEquals(
+      Atomics.compareExchange(arr, 0, shared_rhs, shared_rhs2), shared_rhs);
+  assertEquals(arr[0], shared_rhs2);
+
+  // Comparing to a different instance of the same type is not succesful.
+  assertEquals(
+      Atomics.compareExchange(arr, 0, new SharedArray(10), 'exchanged'),
+      shared_rhs2);
+  assertNotEquals(arr[0], 'exchanged');
+
+  assertEquals(
+      Atomics.compareExchange(arr, 0, shared_rhs2, shared_rhs), shared_rhs2);
+  assertEquals(arr[0], shared_rhs);
+})();
+
+(function TestCompareExchangeNumbers() {
+  const arr = new SharedArray(1);
+  // We can compare a Smi to a HeapNumber.
+  arr[0] = 0;
+  assertTrue(%IsSmi(arr[0]));
+  let HeapNumber = %AllocateHeapNumber();
+  assertEquals(
+      Atomics.compareExchange(arr, 0, HeapNumber, 'exchanged'), HeapNumber);
+  assertEquals(arr[0], 'exchanged');
+
+  // We can compare the same value stored in 2 different HeapNumbers;
+  arr[0] = 1.5;
+  HeapNumber = 1.5;
+  assertFalse(%IsSameHeapObject(arr[0], HeapNumber));
+  assertEquals(Atomics.compareExchange(arr, 0, HeapNumber, 'exchanged'), 1.5);
+  assertEquals(arr[0], 'exchanged');
 })();
 
 (function TestOutOfBounds() {
@@ -61,3 +116,16 @@
     Atomics.store(arr, 'field', 42);
   });
 })();
+
+(function TestLengthReadOnly() {
+  let arr = new SharedArray(2);
+  assertEquals(2, Atomics.load(arr, 'length'));
+  // The 'length' property is read-only. Atomics.store and Atomics.exchange are
+  // treated like strict functions, and so an error is always thrown.
+  assertThrows(() => {
+    Atomics.store(arr, 'length', 42);
+  });
+  assertThrows(() => {
+    Atomics.exchange(arr, 'length', 42);
+  });
+})();
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-array-concat.js b/deps/v8/test/mjsunit/shared-memory/shared-array-concat.js
new file mode 100644
index 00000000000000..d2b031f63d3a77
--- /dev/null
+++ b/deps/v8/test/mjsunit/shared-memory/shared-array-concat.js
@@ -0,0 +1,12 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --shared-string-table --harmony-struct
+
+(function TestArrayConcatSharedArrayOnArrayProto() {
+  let sarr = new SharedArray();
+  Object.defineProperty(
+      Array.prototype, 0, {writable: true, enumerable: true, value: 42});
+  print(Object.setPrototypeOf(Array.prototype, sarr).concat());
+})();
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-external-string-dictionary-lookup.js b/deps/v8/test/mjsunit/shared-memory/shared-external-string-dictionary-lookup.js
index bf942cdf120d6b..199a1381dee11e 100644
--- a/deps/v8/test/mjsunit/shared-memory/shared-external-string-dictionary-lookup.js
+++ b/deps/v8/test/mjsunit/shared-memory/shared-external-string-dictionary-lookup.js
@@ -2,13 +2,16 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --expose-externalize-string --shared-string-table
+// Flags: --expose-externalize-string --expose-gc --shared-string-table
 
 const long_key = 'key1234567890abcdefg';
 const substr_key = long_key.substring(3,17);
 const consstr_key = 'key' + 1234567890 + 'abcdefg';
 const integer_index = long_key.substring(3,8);
 
+gc();
+gc();
+
 {
   let obj = [];
   for (let i = 0; i < 100; ++i) {
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-external-string-megamorphic-ic.js b/deps/v8/test/mjsunit/shared-memory/shared-external-string-megamorphic-ic.js
index a705d9f19398fb..fc44e4fb770aa6 100644
--- a/deps/v8/test/mjsunit/shared-memory/shared-external-string-megamorphic-ic.js
+++ b/deps/v8/test/mjsunit/shared-memory/shared-external-string-megamorphic-ic.js
@@ -18,10 +18,11 @@ function get(o, ext_key) {
 %OptimizeFunctionOnNextCall(get);
 
 (function test() {
-  let ext_key = "AAAAAAAAAAAAAAAAAAAAAA";
+  let ext_key = createExternalizableString('AAAAAAAAAAAAAAAAAAAAAA');
   try {
     externalizeString(ext_key);
-  } catch {}
+  } catch {
+  }
 
   set({a:1}, ext_key);
   set({b:2}, ext_key);
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-object-has-instance.js b/deps/v8/test/mjsunit/shared-memory/shared-object-has-instance.js
new file mode 100644
index 00000000000000..917ec70e2e6851
--- /dev/null
+++ b/deps/v8/test/mjsunit/shared-memory/shared-object-has-instance.js
@@ -0,0 +1,119 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --shared-string-table --harmony-struct
+
+'use strict';
+
+let S1 = new SharedStructType(['field']);
+let S2 = new SharedStructType(['other_field']);
+let S3 = new SharedStructType(['field']);
+let other_obj = {'field': 42};
+
+function OtherConstructor(val) {
+  return {'val': val + 1};
+}
+
+function BuildPrototypeChain(base_obj) {
+  let proto = {};
+  Object.setPrototypeOf(proto, base_obj);
+  for (let i = 0; i < 10; i++) {
+    let temp = Object.create(proto);
+    proto = temp;
+  }
+
+  const handler = {};
+
+  for (let i = 0; i < 10; i++) {
+    let temp = new Proxy(proto, handler);
+    proto = temp;
+  }
+
+  return proto;
+}
+
+(function TestSharedStructHasInstance() {
+  let s1 = new S1();
+
+  // Returns true for the original constructor.
+  assertTrue(s1 instanceof S1);
+  // Returns false for a SharedStructType with a different fields.
+  assertFalse(s1 instanceof S2);
+  // Returns false for a different SharedStructType with the same fields.
+  assertFalse(s1 instanceof S3);
+  // Returns false for a different object.
+  assertFalse(other_obj instanceof S1);
+  // Returns false for a different constructor.
+  assertFalse(s1 instanceof OtherConstructor);
+  // Returns true if the shared struct is in the prototype chain.
+  assertTrue(BuildPrototypeChain(s1) instanceof S1);
+})();
+
+(function TestSharedArrayHasInstance() {
+  let sa = new SharedArray(1);
+  let sb = new SharedArray(2);
+
+  // Like regular Arrays,  returns true for SharedArray of any length.
+  assertTrue(sa instanceof SharedArray);
+  assertTrue(sb instanceof SharedArray);
+  // Returns false for a different object.
+  assertFalse(other_obj instanceof SharedArray);
+  // Returns false for a different constructor.
+  assertFalse(sa instanceof OtherConstructor);
+  // Returns true if the SharedArray is in the prototype chain.
+  assertTrue(BuildPrototypeChain(sa) instanceof SharedArray);
+})();
+
+(function TestAtomicsMutexHasInstance() {
+  let lock = new Atomics.Mutex();
+  // Returns true for the original constructor.
+  assertTrue(lock instanceof Atomics.Mutex);
+  // Returns false for a different object.
+  assertFalse(other_obj instanceof Atomics.Mutex);
+  // Returns false for a different constructor.
+  assertFalse(lock instanceof OtherConstructor);
+  // Returns true if the mutex is in the prototype chain.
+  assertTrue(BuildPrototypeChain(lock) instanceof Atomics.Mutex);
+})();
+
+(function TestAtomicsConditionHasInstance() {
+  let conditon = new Atomics.Condition();
+  // Returns true for the original constructor.
+  assertTrue(conditon instanceof Atomics.Condition);
+  // Returns false for a different object.
+  assertFalse(other_obj instanceof Atomics.Condition);
+  // Returns false for a different constructor.
+  assertFalse(conditon instanceof OtherConstructor);
+  // Returns true if the condition is in the prototype chain.
+  assertTrue(BuildPrototypeChain(conditon) instanceof Atomics.Condition);
+})();
+
+(function TestCallStaticHasInstance() {
+  let s1 = new S1();
+  // Returns true when calling with the correct constructor as the receiver.
+  assertTrue(S1[Symbol.hasInstance].call(S1, s1));
+  // Returns true when calling with the correct constructor as the receiver from
+  // another shared object's constructor.
+  assertTrue(SharedArray[Symbol.hasInstance].call(S1, s1));
+  // Returns false when calling with other non-shared constructor as the
+  // receiver.
+  assertFalse(S1[Symbol.hasInstance].call(OtherConstructor, s1));
+  // Returns false when calling with a non-function as receiver.
+  assertFalse(S1[Symbol.hasInstance].call({}, s1));
+})();
+
+(function TestRecursivePrototype() {
+  // Test that we throw when reaching __proto__ recursion limit.
+  const v = {}, handler = {};
+  const newPrototype = new Proxy(v, handler);
+  Object.setPrototypeOf(v, newPrototype);
+  assertThrows(()=>{v  instanceof SharedArray});
+})();
+
+(function TestInheritHasInstance() {
+  const func = () => {};
+  const sa = new SharedArray(1);
+  Object.setPrototypeOf(func, SharedArray);
+  assertFalse(sa instanceof func);
+})();
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-string-copy-on-share.js b/deps/v8/test/mjsunit/shared-memory/shared-string-copy-on-share.js
index 416feb170ac2b0..bc1d1e280b6a40 100644
--- a/deps/v8/test/mjsunit/shared-memory/shared-string-copy-on-share.js
+++ b/deps/v8/test/mjsunit/shared-memory/shared-string-copy-on-share.js
@@ -34,7 +34,7 @@ if (this.Worker) {
   let box_to_send = new Box();
   // Create a string that is not internalized by the parser. Create dummy
   // strings before and after the string to make sure we have enough live
-  // objects on the page to get it promoted to old space (for minor MC).
+  // objects on the page to get it promoted to old space (for minor MS).
   let trash = [];
   for (let i = 0; i < 1024 * 32; i++) {
     trash.push('a'.repeat(8));
@@ -43,7 +43,8 @@ if (this.Worker) {
   for (let i = 0; i < 1024 * 32; i++) {
     trash.push('a'.repeat(8));
   }
-  // Trigger a gc to move the object to old space.
+  // Trigger two GCs to move the object to old space.
+  gc({type: 'minor'});
   gc({type: 'minor'});
   assertFalse(%InLargeObjectSpace(payload));
   assertFalse(%InYoungGeneration(payload));
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-struct-atomics-workers.js b/deps/v8/test/mjsunit/shared-memory/shared-struct-atomics-workers.js
index 453af1478ea742..1d9a14f03249dc 100644
--- a/deps/v8/test/mjsunit/shared-memory/shared-struct-atomics-workers.js
+++ b/deps/v8/test/mjsunit/shared-memory/shared-struct-atomics-workers.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --shared-string-table --harmony-struct --allow-natives-syntax
+// Flags: --shared-string-table --harmony-struct
 
 "use strict";
 
@@ -38,4 +38,47 @@ if (this.Worker) {
   worker.terminate();
 })();
 
+(function TestCompareExchange() {
+  // Test that we can perform compareExchange simultaneously on 2 threads.
+  // One thread will update the value only after the other thread has
+  // performed an update.
+
+  const ST = new SharedStructType(['field']);
+  const s1 = new ST();
+  const s = new ST();
+
+  // Odd number of values so the main thread perfoms the last compareExchange.
+  let testValues =
+      [0, 1.5, undefined, null, true, false, 'foo', s1, new SharedArray(1)];
+  let sharedtestValues = new SharedArray(testValues.length);
+  Object.assign(sharedtestValues, testValues);
+
+  let workerScript = `onmessage = function(e) {
+    const s = e[0];
+    let i = 0;
+    const testValues = e[1];
+    while(i < testValues.length - 1) {
+      let value = testValues[i];
+      let nextValue = testValues[i+1];
+      if (value === Atomics.compareExchange(s, 'field', value, nextValue)) {
+        i += 2;
+      }
+    }
+  }`
+
+  let worker = new Worker(workerScript, {type: 'string'});
+  worker.postMessage([s, sharedtestValues]);
+  s.field = testValues[0];
+  let i = 1;
+  while (i < testValues.length - 1) {
+    let value = testValues[i];
+    let nextValue = testValues[i + 1];
+    if (value === Atomics.compareExchange(s, 'field', value, nextValue)) {
+      i += 2;
+    }
+  }
+
+  assertEquals(testValues[testValues.length - 1], s.field);
+  worker.terminate();
+})();
 }
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-struct-atomics.js b/deps/v8/test/mjsunit/shared-memory/shared-struct-atomics.js
index 06fc2b1e2cf05a..6e8e7849c20111 100644
--- a/deps/v8/test/mjsunit/shared-memory/shared-struct-atomics.js
+++ b/deps/v8/test/mjsunit/shared-memory/shared-struct-atomics.js
@@ -2,11 +2,11 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 //
-// Flags: --shared-string-table --harmony-struct
+// Flags: --shared-string-table --harmony-struct --allow-natives-syntax
 
 "use strict";
 
-let S = new SharedStructType(['field']);
+let S = new SharedStructType(['field', '2']);
 
 (function TestPrimitivesUsingAtomics() {
   // All primitives can be stored in fields.
@@ -15,16 +15,40 @@ let S = new SharedStructType(['field']);
 
   for (let prim of prims) {
     Atomics.store(s, 'field', prim);
+    Atomics.store(s, '2', prim);
     assertEquals(Atomics.load(s, 'field'), prim);
+    assertEquals(Atomics.load(s, '2'), prim);
   }
 
   for (let prim1 of prims) {
     for (let prim2 of prims) {
       s.field = prim1;
+      s[2] = prim1;
       assertEquals(Atomics.exchange(s, 'field', prim2), prim1);
       assertEquals(s.field, prim2);
+      assertEquals(Atomics.exchange(s, '2', prim2), prim1);
+      assertEquals(s[2], prim2);
     }
   }
+
+  const primsCopy = [42, -0, undefined, null, true, false, 'foo'];
+  for (let i = 0; i < prims.length; i++) {
+    const prim = prims[i];
+    const primCopy = primsCopy[i];
+    s.field = prim;
+    // Atomics.compareExchange mimics `===` comparison.
+    assertEquals(Atomics.compareExchange(s, 'field', '42', 'exchanged'), prim);
+    assertEquals(s.field, prim);
+    assertEquals(
+        Atomics.compareExchange(s, 'field', primCopy, 'exchanged'), prim);
+    assertEquals(s.field, 'exchanged');
+
+    s[2] = prim;
+    assertEquals(Atomics.compareExchange(s, 2, '42', 'exchanged'), prim);
+    assertEquals(s[2], prim);
+    assertEquals(Atomics.compareExchange(s, 2, primCopy, 'exchanged'), prim);
+    assertEquals(s[2], 'exchanged');
+  }
 })();
 
 (function TestObjectsUsingAtomics() {
@@ -33,17 +57,40 @@ let S = new SharedStructType(['field']);
   assertThrows(() => { Atomics.store(s, 'field', []); });
   assertThrows(() => { Atomics.store(s, 'field', {}); });
   // Shared objects can point to other shared objects.
-  let shared_rhs = new SharedArray(10);
+
+  let shared_rhs = new S();
   Atomics.store(s, 'field', shared_rhs);
   assertEquals(Atomics.load(s, 'field'), shared_rhs);
 
-  shared_rhs = new S();
+  shared_rhs = new SharedArray(10);
   Atomics.store(s, 'field', shared_rhs);
   assertEquals(Atomics.load(s, 'field'), shared_rhs);
 
   let shared_rhs2 = new S();
   assertEquals(Atomics.exchange(s, 'field', shared_rhs2), shared_rhs);
   assertEquals(s.field, shared_rhs2);
+
+  assertEquals(Atomics.exchange(s, 'field', shared_rhs), shared_rhs2);
+  assertEquals(s.field, shared_rhs);
+
+  assertEquals(
+      Atomics.compareExchange(s, 'field', new SharedArray(10), 'exchanged'),
+      shared_rhs);
+  assertNotEquals(s.field, 'exchanged');
+
+  assertEquals(
+      Atomics.compareExchange(s, 'field', shared_rhs, shared_rhs2), shared_rhs);
+  assertEquals(s.field, shared_rhs2);
+
+  assertEquals(
+      Atomics.compareExchange(s, 'field', new S(), 'exchanged'), shared_rhs2);
+  assertNotEquals(s.field, 'exchanged');
+
+  assertEquals(
+      Atomics.compareExchange(s, 'field', shared_rhs2, shared_rhs),
+      shared_rhs2);
+  assertEquals(s.field, shared_rhs);
+
 })();
 
 (function TestNotExtensibleUsingAtomics() {
@@ -51,3 +98,65 @@ let S = new SharedStructType(['field']);
   // Shared structs are non-extensible.
   assertThrows(() => { Atomics.store(s, 'nonExistent', 42); });
 })();
+
+(function TestCompareExchangeNumbers() {
+  let fieldNames = new SharedArray(999);
+  fieldNames[0] = '2';
+  for (let i = 1; i < fieldNames.length; i++) {
+    fieldNames[i] = `field${i}`;
+  }
+
+  let ST = new SharedStructType(fieldNames)
+  let s = new ST();
+
+  // Test in-object fields.
+  // We can compare a Smi to a HeapNumber.
+  s.field1 = 0;
+  assertTrue(%IsSmi(s.field1));
+  let HeapNumber = %AllocateHeapNumber();
+  assertEquals(
+      Atomics.compareExchange(s, 'field1', HeapNumber, 'success'), HeapNumber);
+  assertEquals(s.field1, 'success');
+
+  // We can compare the same value stored in 2 different HeapNumbers.
+  s.field1 = 1.5;
+  HeapNumber = 1.5;
+  assertFalse(%IsSameHeapObject(s.field, HeapNumber));
+  assertEquals(
+      Atomics.compareExchange(s, 'field1', HeapNumber, 'success'), 1.5);
+  assertEquals(s.field1, 'success');
+
+  // Test dictionary element fields.
+  // We can compare a Smi to a HeapNumber.
+  s[2] = 0;
+  assertTrue(%IsSmi(s[2]));
+  HeapNumber = %AllocateHeapNumber();
+  assertEquals(
+      Atomics.compareExchange(s, 2, HeapNumber, 'success'), HeapNumber);
+  assertEquals(s[2], 'success');
+
+  // We can compare the same value stored in 2 different HeapNumbers.
+  s[2] = 1.5;
+  HeapNumber = 1.5;
+  assertFalse(%IsSameHeapObject(s[2], HeapNumber));
+  assertEquals(Atomics.compareExchange(s, 2, HeapNumber, 'success'), 1.5);
+  assertEquals(s[2], 'success');
+
+  // Test out-of-object fields.
+  // We can compare a Smi to a HeapNumber.
+  s.field998 = 0;
+  assertTrue(%IsSmi(s.field998));
+  HeapNumber = %AllocateHeapNumber();
+  assertEquals(
+      Atomics.compareExchange(s, 'field998', HeapNumber, 'success'),
+      HeapNumber);
+  assertEquals(s.field998, 'success');
+
+  // We can compare the same value stored in 2 different HeapNumbers.
+  s.field998 = 1.5;
+  HeapNumber = 1.5;
+  assertFalse(%IsSameHeapObject(s.field, HeapNumber));
+  assertEquals(
+      Atomics.compareExchange(s, 'field998', HeapNumber, 'success'), 1.5);
+  assertEquals(s.field998, 'success');
+})();
diff --git a/deps/v8/test/mjsunit/shared-memory/shared-struct-surface.js b/deps/v8/test/mjsunit/shared-memory/shared-struct-surface.js
index e66e007a1f0ec0..b887c4e886d0eb 100644
--- a/deps/v8/test/mjsunit/shared-memory/shared-struct-surface.js
+++ b/deps/v8/test/mjsunit/shared-memory/shared-struct-surface.js
@@ -153,3 +153,20 @@ let S = new SharedStructType(['field']);
     Ctor.prototype = ps;
   }
 })();
+
+(function TestElements() {
+  const largeIndex = 2 ** 32;
+  const anotherLargeIndex = 2 ** 31;
+  const StructWithElements =
+      new SharedStructType([1, 42, largeIndex, anotherLargeIndex]);
+  let s = new StructWithElements();
+  s[1] = 0.1;
+  s[42] = 42;
+  s[largeIndex] = 'whatever';
+  s[anotherLargeIndex] = 'whatever2';
+  assertEquals(0.1, s[1]);
+  assertEquals(42, s[42]);
+  assertEquals('whatever', s[largeIndex]);
+  assertEquals('whatever2', s[anotherLargeIndex]);
+  assertThrows(() => s[80] = 0.2);
+})();
diff --git a/deps/v8/test/mjsunit/stack-trace-cpp-function-template-2.js b/deps/v8/test/mjsunit/stack-trace-cpp-function-template-2.js
index 7c9a4966a2f3ad..bd45c5e11ddfc1 100644
--- a/deps/v8/test/mjsunit/stack-trace-cpp-function-template-2.js
+++ b/deps/v8/test/mjsunit/stack-trace-cpp-function-template-2.js
@@ -20,6 +20,8 @@ Error.prepareStackTrace = (e, frames) => {
   assertEquals(foo, frames[0].getFunction());
   assertEquals(object.toString, frames[1].getFunction());
   assertEquals("print", frames[2].getFunctionName());
+  // Ensure print function in instantiated for the correct context.
+  assertEquals(print, frames[2].getFunction());
   assertEquals(bar, frames[3].getFunction());
   return frames;
 };
diff --git a/deps/v8/test/mjsunit/stack-trace-cpp-function-template-3.js b/deps/v8/test/mjsunit/stack-trace-cpp-function-template-3.js
new file mode 100644
index 00000000000000..24503d03edb88d
--- /dev/null
+++ b/deps/v8/test/mjsunit/stack-trace-cpp-function-template-3.js
@@ -0,0 +1,50 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turbofan --experimental-stack-trace-frames
+
+// Verifies that "print" shows up in Error.stack when "bar" is optimized
+// by Turbofan and that the "print" function belongs to the correct context:
+// Error
+//     at foo (...)
+//     at Object.toString (...)
+//     at print (<anonymous>)
+//     at bar (...)
+//     at (...)
+let realm = Realm.createAllowCrossRealmAccess();
+let remote_print = Realm.eval(realm, `print`);
+
+let prepareStackTraceCalled = false;
+Error.prepareStackTrace = (e, frames) => {
+  prepareStackTraceCalled = true;
+  assertEquals(5, frames.length);
+
+  assertEquals(foo, frames[0].getFunction());
+  assertEquals(object.toString, frames[1].getFunction());
+  assertEquals("print", frames[2].getFunctionName());
+  // Ensure print function in instantiated for the correct context.
+  assertEquals(remote_print, frames[2].getFunction());
+  assertEquals(bar, frames[3].getFunction());
+  return frames;
+};
+
+function foo() { throw new Error(); }
+const object = { toString: () => { return foo(); } };
+
+function bar() {
+  remote_print(object);
+}
+
+%PrepareFunctionForOptimization(bar);
+try { bar(); } catch (e) {}
+try { bar(); } catch (e) {}
+%OptimizeFunctionOnNextCall(bar);
+
+try { bar(); } catch(e) {
+  // Trigger prepareStackTrace.
+  e.stack;
+}
+
+assertOptimized(bar);
+assertTrue(prepareStackTraceCalled);
diff --git a/deps/v8/test/mjsunit/stack-traces-overflow.js b/deps/v8/test/mjsunit/stack-traces-overflow.js
index 61153b3858361a..cd690752d3dc61 100644
--- a/deps/v8/test/mjsunit/stack-traces-overflow.js
+++ b/deps/v8/test/mjsunit/stack-traces-overflow.js
@@ -80,8 +80,9 @@ try {
 function testErrorPrototype(prototype) {
   var object = {};
   object.__proto__ = prototype;
-  object.stack = "123";  // Overwriting stack property succeeds.
-  assertTrue(prototype.stack != object.stack);
+  // Setting stack property overwrites prototype.stack value.
+  object.stack = "123";
+  assertEquals(prototype.stack, object.stack);
   assertEquals("123", object.stack);
 }
 
diff --git a/deps/v8/test/mjsunit/stack-traces.js b/deps/v8/test/mjsunit/stack-traces.js
index 949d8390b49f13..ebe8a13ba842f3 100644
--- a/deps/v8/test/mjsunit/stack-traces.js
+++ b/deps/v8/test/mjsunit/stack-traces.js
@@ -360,6 +360,14 @@ my_error = {};
 Object.preventExtensions(my_error);
 assertThrows(function() { Error.captureStackTrace(my_error); });
 
+var error = new Error();
+var proxy = new Proxy(error, {});
+Error.captureStackTrace(error);
+assertEquals(undefined, error.__lookupGetter__("stack").call(proxy));
+assertEquals(undefined, error.__lookupSetter__("stack").call(proxy, 153));
+assertEquals(undefined, error.__lookupGetter__("stack").call(42));
+assertEquals(undefined, error.__lookupSetter__("stack").call(42, 153));
+
 var fake_error = {};
 my_error = new Error();
 var stolen_getter = Object.getOwnPropertyDescriptor(my_error, 'stack').get;
@@ -391,7 +399,7 @@ assertEquals([], Object.keys(o));
 var desc = Object.getOwnPropertyDescriptor(o, "stack");
 assertFalse(desc.enumerable);
 assertTrue(desc.configurable);
-assertTrue(desc.writable);
+assertEquals(desc.writable, undefined);
 
 // Check that exceptions thrown within prepareStackTrace throws an exception.
 Error.prepareStackTrace = function(e, frames) { throw 42; }
diff --git a/deps/v8/test/mjsunit/store-load-elision-aliasing.js b/deps/v8/test/mjsunit/store-load-elision-aliasing.js
new file mode 100644
index 00000000000000..6dca7b6b2338cf
--- /dev/null
+++ b/deps/v8/test/mjsunit/store-load-elision-aliasing.js
@@ -0,0 +1,28 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+//
+// Flags: --allow-natives-syntax --maglev
+
+function foo(a, b) {
+  // Write to a.x, which will also cache the value in a.x
+  a.x = 7;
+  // This write should be cached here.
+  const x = a.x;
+  // a might alias b, so we should clear the cached value here...
+  b.x = 4;
+  // ... and return the old and uncached new value here (which is 4 if a aliases
+  // b, 7 otherwise).
+  const y = a.x;
+  return [x, y];
+}
+
+const a = {x: 1};
+const b = {x: 2};
+
+%PrepareFunctionForOptimization(foo);
+assertEquals([7,4], foo(a, a));
+assertEquals([7,7], foo(a, b));
+%OptimizeMaglevOnNextCall(foo);
+assertEquals([7,4], foo(a, a));
+assertEquals([7,7], foo(a, b));
diff --git a/deps/v8/test/mjsunit/string-case.js b/deps/v8/test/mjsunit/string-case.js
index 4bc169cad32e67..c065bbe4630bdf 100644
--- a/deps/v8/test/mjsunit/string-case.js
+++ b/deps/v8/test/mjsunit/string-case.js
@@ -58,7 +58,7 @@ function test(length) {
     strLower += String.fromCharCode(charCodeToLower(c));
     strUpper += String.fromCharCode(charCodeToUpper(c));
   }
-  str = %FlattenString(str);
+  str = createExternalizableString(str);
   strLower = %FlattenString(strLower);
   strUpper = %FlattenString(strUpper);
   // Sequential string.
@@ -71,7 +71,7 @@ function test(length) {
   assertEquals(strLower.substring(1), str.substring(1).toLowerCase());
   assertEquals(strUpper.substring(1), str.substring(1).toUpperCase());
   // External string.
-  externalizeString(str, false);
+  externalizeString(str);
   assertEquals(strLower, str.toLowerCase());
   assertEquals(strUpper, str.toUpperCase());
 }
diff --git a/deps/v8/test/mjsunit/string-charcodeat-external.js b/deps/v8/test/mjsunit/string-charcodeat-external.js
index be74650267997f..3de0dcebee216c 100644
--- a/deps/v8/test/mjsunit/string-charcodeat-external.js
+++ b/deps/v8/test/mjsunit/string-charcodeat-external.js
@@ -9,8 +9,10 @@ function foo(s) {
 }
 
 var extern = "internalized dummy";
-extern = "1234567890qiaipppiúöäöáœba"+"jalsdjasldjasdlasjdalsdjasldk";
-externalizeString(extern, true /* force two-byte */);
+extern = createExternalizableString(
+    '1234567890qiaipppiúöäöáœba' +
+    'jalsdjasldjasdlasjdalsdjasldk');
+externalizeString(extern);
 %PrepareFunctionForOptimization(foo);
 assertEquals(97, foo(extern));
 assertEquals(97, foo(extern));
diff --git a/deps/v8/test/mjsunit/string-external-cached.js b/deps/v8/test/mjsunit/string-external-cached.js
index dd8a99382bdfce..c44ba26312a8a6 100644
--- a/deps/v8/test/mjsunit/string-external-cached.js
+++ b/deps/v8/test/mjsunit/string-external-cached.js
@@ -31,16 +31,16 @@
 function test() {
   // Test string.charAt.
   var charat_str = new Array(5);
-  charat_str[0] = "0123456789ABCDEF0123456789ABCDEF\
+  charat_str[0] = createExternalizableString('0123456789ABCDEF0123456789ABCDEF\
 0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF\
 0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF\
 0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF\
-0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF";
-  charat_str[1] = "0123456789ABCDEF";
+0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF0123456789ABCDEF');
+  charat_str[1] = createExternalizableString('0123456789ABCDEF');
   for (var i = 0; i < 6; i++) charat_str[1] += charat_str[1];
   try {  // String can only be externalized once
-    externalizeString(charat_str[0], false);
-    externalizeString(charat_str[1], true);
+    externalizeString(charat_str[0]);
+    externalizeString(charat_str[1]);
   } catch (ex) { }
   charat_str[2] = charat_str[0].slice(0, -1);
   charat_str[3] = charat_str[1].slice(0, -1);
@@ -53,20 +53,20 @@ function test() {
     assertEquals('B', charat_str[i].charAt(3*16 + 11));
   }
 
-  charat_short = "01234";
+  charat_short = createExternalizableString('01234');
   try {  // String can only be externalized once
-    externalizeString(charat_short, true);
+    externalizeString(charat_short);
   } catch (ex) { }
   assertEquals("1", charat_short.charAt(1));
 
   // Test regexp and short substring.
   var re = /(A|B)/;
-  var rere = /(T.{1,2}B)/;
-  var ascii = "ABCDEFGHIJKLMNOPQRST";
-  var twobyte = "_ABCDEFGHIJKLMNOPQRST";
-  try {
-    externalizeString(ascii, false);
-    externalizeString(twobyte, true);
+  var rere = /(T.{1,3}B)/u;
+  var ascii = createExternalizableString('ABCDEFGHIJKLMNOPQRST');
+  var twobyte = createExternalizableString('_ABCDEFGHIJKLMNOPQRST🤓');
+  try {  // String can only be externalized once
+    externalizeString(ascii);
+    externalizeString(twobyte);
   } catch (ex) { }
   assertTrue(isOneByteString(ascii));
   assertFalse(isOneByteString(twobyte));
@@ -80,7 +80,7 @@ function test() {
     assertEquals(["TAB", "TAB"], rere.exec(ascii_cons));
     assertEquals(["A", "A"], re.exec(twobyte));
     assertEquals(["B", "B"], re.exec(twobyte_slice));
-    assertEquals(["T_AB", "T_AB"], rere.exec(twobyte_cons));
+    assertEquals(["T🤓_AB", "T🤓_AB"], rere.exec(twobyte_cons));
     assertEquals("DEFG", ascii_slice.substr(2, 4));
     assertEquals("DEFG", twobyte_slice.substr(2, 4));
     assertEquals("DEFG", ascii_cons.substr(3, 4));
@@ -88,26 +88,30 @@ function test() {
   }
 
   // Test adding external strings
-  var short_ascii = "E=";
-  var long_ascii = "MCsquared";
-  var short_twobyte = "E\u1234";
-  var long_twobyte = "MCsquare\u1234";
+  var long_ascii = createExternalizableString('MCsquared');
+  var long_twobyte = createExternalizableString('MCsquare\u1234');
+  var min_short_ascii = 'E='.padEnd(kExternalStringMinOneByteLength, '.');
+  var min_short_twobyte =
+      'E=\u1234'.padEnd(kExternalStringMinTwoByteLength, '\u1234');
+  var short_ascii = createExternalizableString(min_short_ascii);
+  var short_twobyte = createExternalizableString(min_short_twobyte);
   try {  // String can only be externalized once
-    externalizeString(short_ascii, false);
-    externalizeString(long_ascii, false);
-    externalizeString(short_twobyte, true);
-    externalizeString(long_twobyte, true);
+    externalizeString(short_ascii);
+    externalizeString(long_ascii);
+    externalizeString(short_twobyte);
+    externalizeString(long_twobyte);
     assertTrue(isOneByteString(short_asii) && isOneByteString(long_ascii));
     assertFalse(isOneByteString(short_twobyte) || isOneByteString(long_twobyte));
   } catch (ex) { }
-  assertEquals("E=MCsquared", short_ascii + long_ascii);
+  assertEquals(min_short_ascii + 'MCsquared', short_ascii + long_ascii);
   assertTrue(isOneByteString(short_ascii + long_ascii));
-  assertEquals("MCsquaredE=", long_ascii + short_ascii);
-  assertEquals("E\u1234MCsquare\u1234", short_twobyte + long_twobyte);
+  assertEquals('MCsquared' + min_short_ascii, long_ascii + short_ascii);
+  assertEquals(
+      min_short_twobyte + 'MCsquare\u1234', short_twobyte + long_twobyte);
   assertFalse(isOneByteString(short_twobyte + long_twobyte));
   assertEquals("E=MCsquared", "E=" + long_ascii);
-  assertEquals("E\u1234MCsquared", short_twobyte + "MCsquared");
-  assertEquals("E\u1234MCsquared", short_twobyte + long_ascii);
+  assertEquals(min_short_twobyte + 'MCsquared', short_twobyte + 'MCsquared');
+  assertEquals(min_short_twobyte + 'MCsquared', short_twobyte + long_ascii);
   assertFalse(isOneByteString(short_twobyte + long_ascii));
 }
 
diff --git a/deps/v8/test/mjsunit/string-externalize.js b/deps/v8/test/mjsunit/string-externalize.js
index 22840c264a6766..5f3df1a8a10752 100644
--- a/deps/v8/test/mjsunit/string-externalize.js
+++ b/deps/v8/test/mjsunit/string-externalize.js
@@ -44,36 +44,11 @@ function test() {
   }
   assertTrue(isOneByteString(str));
 
-  var twoByteExternalWithOneByteData =
-      "AAAA" + dont_inline();
-  externalizeString(twoByteExternalWithOneByteData, true /* force two-byte */);
-  assertFalse(isOneByteString(twoByteExternalWithOneByteData));
-
   var realTwoByteExternalString =
-      "\u1234\u1234\u1234\u1234" + dont_inline2();
+      createExternalizableString('\u1234\u1234\u1234\u1234' + dont_inline2());
   externalizeString(realTwoByteExternalString);
   assertFalse(isOneByteString(realTwoByteExternalString));
 
-  assertFalse(isOneByteString(["a", twoByteExternalWithOneByteData].join("")));
-
-  var str1 = str + twoByteExternalWithOneByteData;
-  assertFalse(isOneByteString(str1));
-
-  // Force flattening of the string.
-  var old_length = str1.length - twoByteExternalWithOneByteData.length;
-  for (var i = 0; i < old_length; i++) {
-    assertEquals(String.fromCharCode(i & 0x7f), str1[i]);
-  }
-  for (var i = old_length; i < str1.length; i++) {
-    assertEquals("A", str1[i]);
-  }
-
-  // Flattened string should still be two-byte.
-  assertFalse(isOneByteString(str1));
-
-  // Lower-casing an ascii string should produce two-byte.
-  assertFalse(isOneByteString(str1.toLowerCase()));
-
   assertFalse(isOneByteString(["a", realTwoByteExternalString].join("")));
 
   // Appending a real two-byte string should produce a two-byte cons.
diff --git a/deps/v8/test/mjsunit/string-forwarding-table.js b/deps/v8/test/mjsunit/string-forwarding-table.js
index 692b67327f4baa..788058ea03d5de 100644
--- a/deps/v8/test/mjsunit/string-forwarding-table.js
+++ b/deps/v8/test/mjsunit/string-forwarding-table.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --always-use-string-forwarding-table --expose-externalize-string
+// Flags: --expose-gc
 
 // The main purpose of this test is to make ClusterFuzz aware of the flag and
 // provide some interesting input.
@@ -12,6 +13,9 @@ const substr_key = long_key.substring(3,17);
 const consstr_key = 'key' + 1234567890 + 'abcdefg';
 const integer_index = long_key.substring(3,8);
 
+gc();
+gc();
+
 // Test object with in-place properties.
 {
   let obj = {
diff --git a/deps/v8/test/mjsunit/string-replace-with-empty.js b/deps/v8/test/mjsunit/string-replace-with-empty.js
index aa97f27ac28c4f..fa5263a70a419c 100644
--- a/deps/v8/test/mjsunit/string-replace-with-empty.js
+++ b/deps/v8/test/mjsunit/string-replace-with-empty.js
@@ -44,17 +44,19 @@ function test() {
   }
   assertEquals(expected, cons.replace(/[\u1234a-z]/g, ""));
 
-  cons = "a0b1c2d3";
+  var expected_two_byte = "0123🤓"
+  cons = "a0b1c2d3🤓";
   for (var i = 0; i < 5; i++) {
+    expected_two_byte += expected_two_byte;
     cons += cons;
   }
-  externalizeString(cons, true/* force two-byte */);
-  assertEquals(expected, cons.replace(/[a-z]/g, ""));
+  externalizeString(createExternalizableString(cons));
+  assertEquals(expected_two_byte, cons.replace(/[a-z]/g, ""));
   cons = "\u12340b1c2d3";
   for (var i = 0; i < 5; i++) {
     cons += cons;
   }
-  externalizeString(cons);
+  externalizeString(createExternalizableString(cons));
   assertEquals(expected, cons.replace(/[\u1234a-z]/g, ""));
 }
 
diff --git a/deps/v8/test/mjsunit/string-slices.js b/deps/v8/test/mjsunit/string-slices.js
index 77b5de606a9f0c..748065bb109372 100644
--- a/deps/v8/test/mjsunit/string-slices.js
+++ b/deps/v8/test/mjsunit/string-slices.js
@@ -212,13 +212,14 @@ assertEquals(
 
 // Externalizing strings.
 var a = "internalized dummy";
-a = "123456789" + "qwertyuiopasdfghjklzxcvbnm";
+a = createExternalizableString(
+    '123456789' +
+    'qwertyuiopasdfghjklzxcvbnm');
 var b = '23456789qwertyuiopasdfghjklzxcvbn';
 assertEquals(a.slice(1, -1), b);
 
 assertTrue(isOneByteString(a));
-externalizeString(a, true);
-assertFalse(isOneByteString(a));
+externalizeString(a);
 
 assertEquals(a.slice(1, -1), b);
 assertTrue(/3456789qwe/.test(a));
diff --git a/deps/v8/test/mjsunit/testcfg.py b/deps/v8/test/mjsunit/testcfg.py
index 1a703d330d52f1..aadb4fc2c58790 100644
--- a/deps/v8/test/mjsunit/testcfg.py
+++ b/deps/v8/test/mjsunit/testcfg.py
@@ -94,7 +94,7 @@ def __init__(self, *args, **kwargs):
         break
     files = [ os.path.normpath(os.path.join(self.suite.root, '..', '..', f))
               for f in files_list ]
-    testfilename = self._get_source_path()
+    testfilename = str(self._get_source_path())
     if SELF_SCRIPT_PATTERN.search(source):
       files = (
         ["-e", "TEST_FILE_NAME=\"%s\"" % testfilename.replace("\\", "\\\\")] +
@@ -103,10 +103,10 @@ def __init__(self, *args, **kwargs):
     if NO_HARNESS_PATTERN.search(source):
       mjsunit_files = []
     else:
-      mjsunit_files = [os.path.join(self.suite.root, "mjsunit.js")]
+      mjsunit_files = [self.suite.root / "mjsunit.js"]
 
     if self.framework_name == 'num_fuzzer':
-      mjsunit_files.append(os.path.join(self.suite.root, "mjsunit_numfuzz.js"))
+      mjsunit_files.append(self.suite.root / "mjsunit_numfuzz.js")
 
     self._source_files = files
     self._source_flags = self._parse_source_flags(source)
@@ -140,13 +140,13 @@ def _get_cmd_env(self):
     return self._env
 
   def _get_source_path(self):
-    base_path = os.path.join(self.suite.root, self.path)
     # Try .js first, and fall back to .mjs.
     # TODO(v8:9406): clean this up by never separating the path from
     # the extension in the first place.
-    if os.path.exists(base_path + self._get_suffix()):
-      return base_path + self._get_suffix()
-    return base_path + '.mjs'
+    js_file = self.suite.root / self.path_js
+    if js_file.exists():
+      return js_file
+    return self.suite.root / self.path_mjs
 
 
 class TestCombiner(testsuite.TestCombiner):
diff --git a/deps/v8/test/mjsunit/tools/foozzie.js b/deps/v8/test/mjsunit/tools/foozzie.js
index 4d7ca4cc1292f0..502d77077ac775 100644
--- a/deps/v8/test/mjsunit/tools/foozzie.js
+++ b/deps/v8/test/mjsunit/tools/foozzie.js
@@ -122,7 +122,7 @@ let then_called = false;
 Atomics.waitAsync().value.then(() => {then_called = true;});
 assertEquals(true, then_called);
 
-// Test .caller access is neutered.
+// Test .caller access is neutralized.
 function callee() {
   assertEquals(null, callee.caller);
 }
@@ -130,3 +130,8 @@ function caller() {
   callee();
 }
 caller();
+
+// Neutralized serializer API.
+let object = {'foo': 42}
+assertEquals(d8.serializer.serialize(object), object)
+assertEquals(d8.serializer.deserialize(object), object)
diff --git a/deps/v8/test/mjsunit/tools/foozzie_typed_arrays.js b/deps/v8/test/mjsunit/tools/foozzie_typed_arrays.js
index 8304eaa8e9ae98..e0e67974cb3716 100644
--- a/deps/v8/test/mjsunit/tools/foozzie_typed_arrays.js
+++ b/deps/v8/test/mjsunit/tools/foozzie_typed_arrays.js
@@ -56,6 +56,12 @@ function testArrayType(type) {
   testLength(1, new type(buffer, bytes(maxElem - 1), 1));
   testLength(1, new type(buffer, bytes(maxElem - 1), 2));
 
+  // Length works or is capped despite bogus offset.
+  testLength(1, new type(buffer, "bad", 1));
+  testLength(maxElem, new type(buffer, "bad", maxElem + 1));
+  testLength(1, new type(buffer, {"x": 4}, 1));
+  testLength(maxElem, new type(buffer, {"x": 4}, maxElem + 1));
+
   // Insertion with "set" works or is capped.
   let set0 = 0;
   let set1 = 1;
diff --git a/deps/v8/test/mjsunit/turboshaft/turboshaft-instruction-selection.js b/deps/v8/test/mjsunit/turboshaft/turboshaft-instruction-selection.js
new file mode 100644
index 00000000000000..7aa9b200e64028
--- /dev/null
+++ b/deps/v8/test/mjsunit/turboshaft/turboshaft-instruction-selection.js
@@ -0,0 +1,44 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turboshaft --turboshaft-instruction-selection
+
+function simple0() { return 42; }
+%PrepareFunctionForOptimization(simple0);
+assertEquals(42, simple0());
+%OptimizeFunctionOnNextCall(simple0);
+assertEquals(42, simple0());
+
+function simple1(x, y) { return x + y * x - y / x; }
+%PrepareFunctionForOptimization(simple1);
+assertEquals(31.625, simple1(8, 3));
+%OptimizeFunctionOnNextCall(simple1);
+assertEquals(31.625, simple1(8, 3));
+
+function simple2(o, a, b, c) {
+  o.y = a;
+  for(let i = 0; i < b; ++i) {
+    o.y += c;
+  }
+  return o;
+}
+%PrepareFunctionForOptimization(simple2);
+assertEquals({ y:(3 + 8 * -4) }, simple2({}, 3, 8, -4));
+%OptimizeFunctionOnNextCall(simple2);
+assertEquals({ y:(3 + 8 * -4) }, simple2({}, 3, 8, -4));
+
+function simple3(x, y, o) {
+  function foo(f, a) { return f(a + 1.5); }
+  o.x = { o:{a: x - 3.14 * y } };
+  o.y = (x / y) | 0;
+  o.z = y ** x;
+  for(let i = -5.0; i < 5.0; i += 0.5) {
+    o.z = foo((a) => a == 3.5 ? 10 : a, o.z);
+  }
+  return (o.w - o.x.o.a + o.y + o.z) | 0;
+}
+%PrepareFunctionForOptimization(simple3);
+assertEquals(354533, simple3(10.2, 3.5, {w:100}));
+%OptimizeFunctionOnNextCall(simple3);
+assertEquals(354533, simple3(10.2, 3.5, {w:100}));
diff --git a/deps/v8/test/mjsunit/typedarray-growablesharedarraybuffer.js b/deps/v8/test/mjsunit/typedarray-growablesharedarraybuffer.js
index 87518f3951717c..7b0e1a50ead927 100644
--- a/deps/v8/test/mjsunit/typedarray-growablesharedarraybuffer.js
+++ b/deps/v8/test/mjsunit/typedarray-growablesharedarraybuffer.js
@@ -3994,3 +3994,14 @@ SortCallbackGrows(ArraySortHelper);
                  TypeError);
   });
 })();
+
+(function ArrayBufferSizeNotMultipleOfElementSize() {
+  // The buffer size is a prime, not multiple of anything.
+  const rab = CreateGrowableSharedArrayBuffer(11, 20);
+  for (let ctor of ctors) {
+    if (ctor.BYTES_PER_ELEMENT == 1) continue;
+
+    // This should not throw.
+    new ctor(rab);
+  }
+})();
diff --git a/deps/v8/test/mjsunit/typedarray-resizablearraybuffer.js b/deps/v8/test/mjsunit/typedarray-resizablearraybuffer.js
index f1d1fd34e1a9ea..6fde3bc2074e51 100644
--- a/deps/v8/test/mjsunit/typedarray-resizablearraybuffer.js
+++ b/deps/v8/test/mjsunit/typedarray-resizablearraybuffer.js
@@ -8359,3 +8359,14 @@ SortCallbackGrows(ArraySortHelper);
                  TypeError);
   });
 })();
+
+(function ArrayBufferSizeNotMultipleOfElementSize() {
+  // The buffer size is a prime, not multiple of anything.
+  const rab = CreateResizableArrayBuffer(11, 20);
+  for (let ctor of ctors) {
+    if (ctor.BYTES_PER_ELEMENT == 1) continue;
+
+    // This should not throw.
+    new ctor(rab);
+  }
+})();
diff --git a/deps/v8/test/mjsunit/unary-op-throws-feedback.js b/deps/v8/test/mjsunit/unary-op-throws-feedback.js
new file mode 100644
index 00000000000000..5167107c07cc51
--- /dev/null
+++ b/deps/v8/test/mjsunit/unary-op-throws-feedback.js
@@ -0,0 +1,31 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --turbofan --no-always-turbofan
+
+function testThrowsRepeated(fn) {
+  %PrepareFunctionForOptimization(fn);
+  for (let i = 0; i < 5; i++) assertThrows(fn, TypeError);
+  %OptimizeFunctionOnNextCall(fn);
+  assertThrows(fn, TypeError);
+  // Assert that the function is still optimized, i.e. no deopt happened when
+  // calling it.
+  assertOptimized(fn);
+}
+
+let symbol = Symbol("test");
+let preIncrement  = () => ++symbol;
+let preDecrement  = () => --symbol;
+let postIncrement = () => symbol++;
+let postDecrement = () => symbol--;
+let unaryPlus = () => -symbol;
+let unaryMinus = () => -symbol;
+let bitwiseNot = () => ~symbol;
+testThrowsRepeated(preIncrement);
+testThrowsRepeated(preDecrement);
+testThrowsRepeated(postIncrement);
+testThrowsRepeated(postDecrement);
+testThrowsRepeated(unaryPlus);
+testThrowsRepeated(unaryMinus);
+testThrowsRepeated(bitwiseNot);
diff --git a/deps/v8/test/mjsunit/wasm/array-bulk-operations.js b/deps/v8/test/mjsunit/wasm/array-bulk-operations.js
index 3e61752dba06ac..60181229009830 100644
--- a/deps/v8/test/mjsunit/wasm/array-bulk-operations.js
+++ b/deps/v8/test/mjsunit/wasm/array-bulk-operations.js
@@ -31,6 +31,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
   let struct = builder.addStruct([makeField(kWasmI32, true)]);
   let array = builder.addArray(wasmRefNullType(struct), true);
+  let array16 = builder.addArray(kWasmI16, true);
 
   builder.addFunction(
       "make_array", makeSig([kWasmI32], [wasmRefType(array)]))
@@ -53,6 +54,21 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
               kExprLocalGet, 3, kGCPrefix, kExprArrayFill, array])
     .exportFunc();
 
+  builder.addFunction("array_fill_i16", kSig_i_v).exportFunc()
+    .addLocals(wasmRefType(array16), 1)
+    .addBody([
+      kExprI32Const, 4,  // Array length for allocation.
+      kGCPrefix, kExprArrayNewDefault, array16,
+      kExprLocalTee, 0,  // Array (for fill).
+      kExprI32Const, 0,  // Offset (for fill).
+      kExprI32Const, 42,  // Value (for fill).
+      kExprI32Const, 4,  // Length (for fill).
+      kGCPrefix, kExprArrayFill, array16,
+      kExprLocalGet, 0,  // Array (for get).
+      kExprI32Const, 0,  // Index (for get).
+      kGCPrefix, kExprArrayGetS, array16,
+    ]);
+
   let wasm = builder.instantiate().exports;
 
   assertTraps(kTrapNullDereference, () => wasm.array_fill(null, 10, 20, 30));
@@ -91,6 +107,8 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
   assertEquals(54, wasm.array_get(array_obj, 5));
   assertTraps(kTrapNullDereference, () => wasm.array_get(array_obj, 6));
   assertTraps(kTrapNullDereference, () => wasm.array_get(array_obj, 7));
+
+  assertEquals(42, wasm.array_fill_i16());
 })();
 
 (function TestArrayNewNonNullable() {
@@ -129,3 +147,296 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
     assertEquals(struct_obj, wasm.array_get(array_obj, i));
   }
 })();
+
+(function TestArrayInitData() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let array = builder.addArray(kWasmI16, true);
+
+  builder.addMemory(10, 10);
+
+  let passive = builder.addPassiveDataSegment([0, 1, 2, 3, 4, 5]);
+  let active = builder.addDataSegment(0, [6, 7, 8, 9]);
+
+  builder.addFunction(
+      "make_array", makeSig([kWasmI32], [wasmRefType(array)]))
+    .addBody([kExprLocalGet, 0, kGCPrefix, kExprArrayNewDefault, array])
+    .exportFunc();
+
+  builder.addFunction(
+      "init_passive",
+      makeSig([wasmRefNullType(array), kWasmI32, kWasmI32, kWasmI32], []))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprLocalGet, 2,
+              kExprLocalGet, 3, kGCPrefix, kExprArrayInitData, array, passive])
+    .exportFunc();
+
+  builder.addFunction(
+      "init_active",
+      makeSig([wasmRefNullType(array), kWasmI32, kWasmI32, kWasmI32], []))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprLocalGet, 2,
+              kExprLocalGet, 3, kGCPrefix, kExprArrayInitData, array, active])
+    .exportFunc();
+
+  builder.addFunction(
+      "array_get", makeSig([wasmRefNullType(array), kWasmI32], [kWasmI32]))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1,
+              kGCPrefix, kExprArrayGetS, array])
+    .exportFunc();
+
+  builder.addFunction("data_drop", kSig_v_v)
+    .addBody([kNumericPrefix, kExprDataDrop, passive])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  let array_length = 10;
+
+  assertTraps(kTrapNullDereference, () => wasm.init_passive(null, 0, 0, 0));
+
+  let array_obj = wasm.make_array(array_length);
+
+  for (i = 0; i < array_length; i++) {
+    assertEquals(0, wasm.array_get(array_obj, i));
+  }
+
+  // Does nothing.
+  wasm.init_active(array_obj, 0, 0, 0);
+  // Active segments count as dropped.
+  assertTraps(kTrapDataSegmentOutOfBounds,
+              () => wasm.init_active(array_obj, 0, 0, 1));
+  // Loading 0 bytes from the end of data segment does nothing.
+  wasm.init_passive(array_obj, 0, 6, 0);
+  // Loading 0 bytes to the end of the array does nothing.
+  wasm.init_passive(array_obj, array_length, 0, 0);
+  // Loading 0 bytes beyond the end of data segment traps.
+  assertTraps(kTrapDataSegmentOutOfBounds,
+              () => wasm.init_passive(array_obj, 0, 7, 0));
+  // Loading 0 bytes beyond the end of array traps.
+  assertTraps(kTrapArrayOutOfBounds,
+              () => wasm.init_passive(array_obj, array_length + 1, 1, 1));
+
+  // Out-of-bounds data segment.
+  assertTraps(kTrapDataSegmentOutOfBounds,
+              () => wasm.init_passive(array_obj, 1, 2, 3));
+  // Out-of-bounds data segment with out-of-smi-range segment offset.
+  assertTraps(kTrapDataSegmentOutOfBounds,
+              () => wasm.init_passive(array_obj, 1, 0x80000000, 0));
+  // Out-of-bounds array.
+  assertTraps(kTrapArrayOutOfBounds,
+              () => wasm.init_passive(array_obj, array_length - 1, 0, 2));
+  // Out-of-bounds array with out-of-smi-range length.
+  assertTraps(kTrapArrayOutOfBounds,
+              () => wasm.init_passive(array_obj, 0, 0, 0x80000000));
+
+  // Load [[1, 2], [3, 4]] at index 5 of array.
+  wasm.init_passive(array_obj, 5, 1, 2);
+
+  assertEquals(0, wasm.array_get(array_obj, 0));
+  assertEquals(0, wasm.array_get(array_obj, 1));
+  assertEquals(0, wasm.array_get(array_obj, 2));
+  assertEquals(0, wasm.array_get(array_obj, 3));
+  assertEquals(0, wasm.array_get(array_obj, 4));
+  // Bytes will be loaded in little-endian order.
+  assertEquals(0x0201, wasm.array_get(array_obj, 5));
+  assertEquals(0x0403, wasm.array_get(array_obj, 6));
+  assertEquals(0, wasm.array_get(array_obj, 7));
+  assertEquals(0, wasm.array_get(array_obj, 8));
+  assertEquals(0, wasm.array_get(array_obj, 9));
+
+  // Now drop the segment.
+  wasm.data_drop();
+  assertTraps(kTrapDataSegmentOutOfBounds,
+              () => wasm.init_passive(array_obj, 5, 1, 2));
+})();
+
+(function TestArrayInitDataLengthOverflow() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let array = builder.addArray(kWasmI64, true);
+
+  let passive = builder.addPassiveDataSegment([0, 1, 2, 3, 4, 5]);
+
+  builder.addFunction(
+      "make_array", makeSig([kWasmI32], [wasmRefType(array)]))
+    .addBody([kExprLocalGet, 0, kGCPrefix, kExprArrayNewDefault, array])
+    .exportFunc();
+
+  builder.addFunction(
+      "init_passive",
+      makeSig([wasmRefNullType(array), kWasmI32, kWasmI32, kWasmI32], []))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprLocalGet, 2,
+              kExprLocalGet, 3, kGCPrefix, kExprArrayInitData, array, passive])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  let array_length = 10;
+
+  let array_obj = wasm.make_array(array_length);
+
+  // Out-of-bounds array: length is within Smi range, but computation of length
+  // in bytes causes 32-bit overflow.
+  assertTraps(kTrapArrayOutOfBounds,
+              () => wasm.init_passive(array_obj, array_length - 1, 0,
+                                      0x20000000));
+})();
+
+(function TestArrayInitDataImmutable() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let array = builder.addArray(kWasmI16, false);
+
+  let passive = builder.addPassiveDataSegment([0, 1, 2, 3, 4, 5]);
+
+  builder.addFunction(
+      "init_passive",
+      makeSig([wasmRefNullType(array), kWasmI32, kWasmI32, kWasmI32], []))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprLocalGet, 2,
+              kExprLocalGet, 3, kGCPrefix, kExprArrayInitData, array, passive])
+    .exportFunc();
+
+  assertThrows(() => builder.instantiate(), WebAssembly.CompileError,
+               /array.init_data can only be used with mutable arrays/);
+})();
+
+(function TestArrayInitElem() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let sig = builder.addType(kSig_i_i);
+  let array = builder.addArray(wasmRefNullType(sig), true);
+
+  let table = builder.addTable(wasmRefNullType(sig), 10, 10);
+
+  let elem1 = builder.addFunction("succ", kSig_i_i)
+      .addBody([kExprLocalGet, 0, kExprI32Const, 1, kExprI32Add]);
+  let elem2 = builder.addFunction("pred", kSig_i_i)
+      .addBody([kExprLocalGet, 0, kExprI32Const, 1, kExprI32Sub]);
+
+  let passive = builder.addPassiveElementSegment(
+    [[kExprRefNull, sig], [kExprRefFunc, elem1.index],
+     [kExprRefFunc, elem2.index], [kExprRefFunc, elem1.index]],
+    wasmRefNullType(sig));
+  let active = builder.addActiveElementSegment(
+    table, [kExprI32Const, 0], [[kExprRefFunc, elem1.index]],
+    wasmRefNullType(sig));
+
+  builder.addFunction(
+      "make_array", makeSig([kWasmI32], [wasmRefType(array)]))
+    .addBody([kExprLocalGet, 0, kGCPrefix, kExprArrayNewDefault, array])
+    .exportFunc();
+
+  builder.addFunction(
+      "init_passive",
+      makeSig([wasmRefNullType(array), kWasmI32, kWasmI32, kWasmI32], []))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprLocalGet, 2,
+              kExprLocalGet, 3, kGCPrefix, kExprArrayInitElem, array, passive])
+    .exportFunc();
+
+  builder.addFunction(
+      "init_active",
+      makeSig([wasmRefNullType(array), kWasmI32, kWasmI32, kWasmI32], []))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprLocalGet, 2,
+              kExprLocalGet, 3, kGCPrefix, kExprArrayInitElem, array, active])
+    .exportFunc();
+
+  builder.addFunction(
+      "array_get", makeSig([wasmRefNullType(array), kWasmI32],
+                           [wasmRefNullType(sig)]))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1,
+              kGCPrefix, kExprArrayGet, array])
+    .exportFunc();
+
+  builder.addFunction("elem_drop", kSig_v_v)
+    .addBody([kNumericPrefix, kExprElemDrop, passive])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  let array_length = 10;
+
+  assertTraps(kTrapNullDereference, () => wasm.init_passive(null, 0, 0, 0));
+
+  let array_obj = wasm.make_array(array_length);
+
+  for (i = 0; i < array_length; i++) {
+    assertEquals(null, wasm.array_get(array_obj, i));
+  }
+
+  // Does nothing.
+  wasm.init_active(array_obj, 0, 0, 0);
+  // Active segments count as dropped.
+  assertTraps(kTrapElementSegmentOutOfBounds,
+              () => wasm.init_active(array_obj, 0, 0, 1));
+  // Loading 0 elements from the end of element segment does nothing.
+  wasm.init_passive(array_obj, 0, 4, 0);
+  // Loading 0 elements to the end of the array does nothing.
+  wasm.init_passive(array_obj, array_length, 0, 0);
+  // Loading 0 elements beyond the end of data segment traps.
+  assertTraps(kTrapElementSegmentOutOfBounds,
+              () => wasm.init_passive(array_obj, 0, 5, 0));
+  // Loading 0 elements beyond the end of array traps.
+  assertTraps(kTrapArrayOutOfBounds,
+              () => wasm.init_passive(array_obj, array_length + 1, 1, 1));
+
+  // Out-of-bounds element segment.
+  assertTraps(kTrapElementSegmentOutOfBounds,
+              () => wasm.init_passive(array_obj, 1, 2, 3));
+  // Out-of-bounds element segment with out-of-smi-bounds segment offset.
+  assertTraps(kTrapElementSegmentOutOfBounds,
+              () => wasm.init_passive(array_obj, 1, 0x80000000, 0));
+  // Out-of-bounds array.
+  assertTraps(kTrapArrayOutOfBounds,
+              () => wasm.init_passive(array_obj, array_length - 1, 0, 2));
+  // Out-of-bounds array with out-of-smi-bounds length
+  assertTraps(kTrapArrayOutOfBounds,
+              () => wasm.init_passive(array_obj, array_length - 1, 0,
+                                      0x80000000));
+
+  // Load the last three elements of the element segment at index 5.
+  wasm.init_passive(array_obj, 5, 1, 3);
+
+  assertEquals(null, wasm.array_get(array_obj, 0));
+  assertEquals(null, wasm.array_get(array_obj, 1));
+  assertEquals(null, wasm.array_get(array_obj, 2));
+  assertEquals(null, wasm.array_get(array_obj, 3));
+  assertEquals(null, wasm.array_get(array_obj, 4));
+  assertEquals(11, wasm.array_get(array_obj, 5)(10));
+  assertEquals(9, wasm.array_get(array_obj, 6)(10));
+  assertEquals(11, wasm.array_get(array_obj, 7)(10));
+  assertEquals(null, wasm.array_get(array_obj, 8));
+  assertEquals(null, wasm.array_get(array_obj, 9));
+
+  // Now drop the segment.
+  wasm.elem_drop();
+  assertTraps(kTrapElementSegmentOutOfBounds,
+              () => wasm.init_passive(array_obj, 5, 1, 3));
+})();
+
+(function TestArrayInitElemImmutable() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let array = builder.addArray(kWasmFuncRef, false);
+
+  let elem1 = builder.addFunction("succ", kSig_i_i)
+      .addBody([kExprLocalGet, 0, kExprI32Const, 1, kExprI32Add]);
+  let elem2 = builder.addFunction("pred", kSig_i_i)
+      .addBody([kExprLocalGet, 0, kExprI32Const, 1, kExprI32Sub]);
+
+  let passive = builder.addPassiveDataSegment([elem1.index, elem2.index,
+                                               elem1.index, elem2.index]);
+
+  builder.addFunction(
+      "init_passive",
+      makeSig([wasmRefNullType(array), kWasmI32, kWasmI32, kWasmI32], []))
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprLocalGet, 2,
+              kExprLocalGet, 3, kGCPrefix, kExprArrayInitElem, array, passive])
+    .exportFunc();
+
+  assertThrows(() => builder.instantiate(), WebAssembly.CompileError,
+               /array.init_elem can only be used with mutable arrays/);
+})();
diff --git a/deps/v8/test/mjsunit/wasm/array-init-from-segment.js b/deps/v8/test/mjsunit/wasm/array-init-from-segment.js
index 432cb91db441cf..7572c5f58d0faa 100644
--- a/deps/v8/test/mjsunit/wasm/array-init-from-segment.js
+++ b/deps/v8/test/mjsunit/wasm/array-init-from-segment.js
@@ -32,12 +32,12 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
       struct_type);
 
   function generator(name, segment) {
-    builder.addFunction(name, makeSig([kWasmI32, kWasmI32], [kWasmI32]))
+    builder.addFunction(name, makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmI32]))
       .addBody([
-        kExprI32Const, 0,  // offset
-        kExprLocalGet, 0,  // length
+        kExprLocalGet, 0,  // offset
+        kExprLocalGet, 1,  // length
         kGCPrefix, kExprArrayNewElem, array_type_index, segment,
-        kExprLocalGet, 1,  // index in the array
+        kExprLocalGet, 2,  // index in the array
         kGCPrefix, kExprArrayGet, array_type_index,
         kGCPrefix, kExprStructGet, struct_type_index, 0])
       .exportFunc()
@@ -74,30 +74,34 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
   let init_and_get_active = instance.exports.init_and_get_active;
   // Initializing from a passive segment works. The third element is null, so
   // we get a null dereference.
-  assertEquals(elems[0], init_and_get(3, 0));
-  assertEquals(elems[1], init_and_get(3, 1));
-  assertTraps(kTrapNullDereference, () => init_and_get(3, 2));
+  assertEquals(elems[0], init_and_get(0, 3, 0));
+  assertEquals(elems[1], init_and_get(0, 3, 1));
+  assertTraps(kTrapNullDereference, () => init_and_get(0, 3, 2));
   // The array has the correct length.
-  assertTraps(kTrapArrayOutOfBounds, () => init_and_get(3, 3));
+  assertTraps(kTrapArrayOutOfBounds, () => init_and_get(0, 3, 3));
   // Too large arrays are disallowed, in and out of Smi range.
-  assertTraps(kTrapArrayTooLarge, () => init_and_get(1000000000, 10));
-  assertTraps(kTrapArrayTooLarge, () => init_and_get(1 << 31, 10));
+  assertTraps(kTrapArrayTooLarge, () => init_and_get(0, 1000000000, 10));
+  assertTraps(kTrapArrayTooLarge, () => init_and_get(0, 1 << 31, 10));
   // Element is out of bounds.
-  assertTraps(kTrapElementSegmentOutOfBounds, () => init_and_get(5, 0));
+  assertTraps(kTrapElementSegmentOutOfBounds, () => init_and_get(0, 5, 0));
+  // Element index out of Smi range.
+  assertTraps(kTrapElementSegmentOutOfBounds,
+              () => init_and_get(0x80000000, 0, 0));
   // Respective segment elements should be pointer-identical.
   assertEquals(1, instance.exports.identical(3, 0));
   // Now drop the segment.
   instance.exports.drop();
   // A 0-length array should still be created...
-  assertTraps(kTrapArrayOutOfBounds, () => init_and_get(0, 0));
+  assertTraps(kTrapArrayOutOfBounds, () => init_and_get(0, 0, 0));
   // ... but not a longer one.
-  assertTraps(kTrapElementSegmentOutOfBounds, () => init_and_get(1, 0));
+  assertTraps(kTrapElementSegmentOutOfBounds, () => init_and_get(0, 1, 0));
   // Same holds for an active segment.
-  assertTraps(kTrapArrayOutOfBounds, () => init_and_get_active(0, 0));
-  assertTraps(kTrapElementSegmentOutOfBounds, () => init_and_get_active(1, 0));
+  assertTraps(kTrapArrayOutOfBounds, () => init_and_get_active(0, 0, 0));
+  assertTraps(kTrapElementSegmentOutOfBounds,
+              () => init_and_get_active(0, 1, 0));
 })();
 
-// TODO(7748): Reenable when we have constant array.new_elem.
+// TODO(14034): Reenable when we have constant array.new_elem.
 /*
 (function TestArrayNewElemConstant() {
   print(arguments.callee.name);
@@ -207,7 +211,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
                /segment type.*is not a subtype of array element type.*/);
 })();
 
-// TODO(7748): Reenable when we have constant array.new_elem.
+// TODO(14034): Reenable when we have constant array.new_elem.
 /*
 // Element segments are defined after globals, so currently it is not valid
 // to refer to an element segment in the global section.
@@ -350,6 +354,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
   // An active segment counts as having 0 length.
   assertTraps(kTrapElementSegmentOutOfBounds, () => instance.exports.init());
 })();
+*/
 
 (function TestArrayNewData() {
   print(arguments.callee.name);
@@ -364,6 +369,8 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
     [dummy_byte, element_0 & 0xff, (element_0 >> 8) & 0xff,
      element_1 & 0xff, (element_1 >> 8) & 0xff]);
 
+  // TODO(14034): Reenable when we have constant array.new_data.
+  /*
   let global = builder.addGlobal(
     wasmRefType(array_type_index), true,
     [...wasmI32Const(1), ...wasmI32Const(2),
@@ -376,6 +383,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
       kExprLocalGet, 0,
       kGCPrefix, kExprArrayGetS, array_type_index])
     .exportFunc();
+  */
 
   // parameters: (segment offset, array length, array index)
   builder.addFunction("init_from_data", kSig_i_iii)
@@ -393,8 +401,9 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
   let instance = builder.instantiate();
 
-  assertEquals(element_0, instance.exports.global_get(0));
-  assertEquals(element_1, instance.exports.global_get(1));
+  // TODO(14034): Reenable when we have constant array.new_elem.
+  // assertEquals(element_0, instance.exports.global_get(0));
+  // assertEquals(element_1, instance.exports.global_get(1));
 
   let init = instance.exports.init_from_data;
 
@@ -408,4 +417,3 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
   assertTraps(kTrapDataSegmentOutOfBounds, () => init(1, 2, 0));
 })();
-*/
diff --git a/deps/v8/test/mjsunit/wasm/atomic-wait-multi-memory.js b/deps/v8/test/mjsunit/wasm/atomic-wait-multi-memory.js
new file mode 100644
index 00000000000000..7a9e127e5e14fa
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/atomic-wait-multi-memory.js
@@ -0,0 +1,119 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-multi-memory
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const builder = new WasmModuleBuilder();
+const mem0_idx = builder.addImportedMemory('imp', 'mem0', 0, 20, 'shared');
+const mem1_idx = builder.addImportedMemory('imp', 'mem1', 0, 20, 'shared');
+for (let mem_idx of [mem0_idx, mem1_idx]) {
+  builder.addFunction(`notify${mem_idx}`, kSig_i_ii)
+      .addBody([
+        kExprLocalGet, 0,                                   // -
+        kExprLocalGet, 1,                                   // -
+        kAtomicPrefix, kExprAtomicNotify, 0x40, mem_idx, 0  // -
+      ])
+      .exportFunc();
+  builder.addFunction(`wait${mem_idx}`, kSig_i_iii)
+      .addBody([
+        kExprLocalGet, 0,  // -
+        kExprLocalGet, 1,  // -
+        kExprLocalGet, 2,  // -
+        // Convert to i64 and multiply by 1e6 (ms -> ns).
+        kExprI64UConvertI32,                                 // -
+        ...wasmI64Const(1e6),                                // -
+        kExprI64Mul,                                         // -
+        kAtomicPrefix, kExprI32AtomicWait, 0x40, mem_idx, 0  // -
+      ])
+      .exportFunc();
+}
+const module = builder.toModule();
+
+const mem0 = new WebAssembly.Memory({initial: 1, maximum: 1, shared: true});
+const mem1 = new WebAssembly.Memory({initial: 2, maximum: 2, shared: true});
+
+const mem0_value = 0;
+const mem1_value = 1;
+new Uint32Array(mem1.buffer).fill(mem1_value);
+
+const imports = {
+  imp: {mem0: mem0, mem1: mem1}
+};
+const instance = new WebAssembly.Instance(module, imports);
+const {notify0, notify1, wait0, wait1} = instance.exports;
+
+const k10Ms = 10;
+const k10s = 10000;
+
+(function TestWaitNotEqual() {
+  print(arguments.callee.name);
+  assertEquals(kAtomicWaitNotEqual, wait0(0, mem0_value + 1, k10Ms));
+  assertEquals(kAtomicWaitNotEqual, wait1(0, mem1_value + 1, k10Ms));
+})();
+
+(function TestWaitTimeout() {
+  print(arguments.callee.name);
+  assertEquals(kAtomicWaitTimedOut, wait0(0, mem0_value, k10Ms));
+  assertEquals(kAtomicWaitTimedOut, wait1(0, mem1_value, k10Ms));
+})();
+
+(function TestWakeUpWorker() {
+  print(arguments.callee.name);
+  function workerCode() {
+    instance = undefined;
+    onmessage = function(msg) {
+      if (!instance) {
+        instance = new WebAssembly.Instance(msg.module, msg.imports);
+        postMessage('instantiated');
+        return;
+      }
+      if (msg.action === 'wait0' || msg.action === 'wait1') {
+        let result = instance.exports[msg.action](...msg.arguments);
+        print(`[worker] ${msg.action} ->: ${result}`);
+        postMessage(result);
+        return;
+      }
+      postMessage(`Invalid action: ${msg.action}`);
+    }
+  }
+  let worker = new Worker(workerCode, {type: 'function'});
+
+  worker.postMessage({module: module, imports: imports});
+  assertEquals('instantiated', worker.getMessage());
+
+  const offset = 48;
+  for (let [mem_idx, mem_value] of [
+           [mem0_idx, mem0_value], [mem1_idx, mem1_value]]) {
+    print(`- memory ${mem_idx}`);
+
+    // Test "not equals".
+    worker.postMessage(
+        {action: `wait${mem_idx}`, arguments: [offset, mem_value + 1, k10Ms]});
+    assertEquals(kAtomicWaitNotEqual, worker.getMessage());
+
+    // Test "timed out".
+    worker.postMessage(
+        {action: `wait${mem_idx}`, arguments: [offset, mem_value, k10Ms]});
+    assertEquals(kAtomicWaitTimedOut, worker.getMessage());
+
+    // Test "ok".
+    worker.postMessage(
+        {action: `wait${mem_idx}`, arguments: [offset, mem_value, k10s]});
+    const started = performance.now();
+    let notify = mem_idx == 0 ? notify0 : notify1;
+    let notified;
+    while ((notified = notify(offset, 1)) === 0) {
+      const now = performance.now();
+      if (now - started > k10s) {
+        throw new Error('Could not notify worker within 10s');
+      }
+    }
+    assertEquals(1, notified);
+    assertEquals(kAtomicWaitOk, worker.getMessage());
+  }
+
+  worker.terminate();
+})();
diff --git a/deps/v8/test/mjsunit/wasm/atomics-memory64.js b/deps/v8/test/mjsunit/wasm/atomics-memory64.js
new file mode 100644
index 00000000000000..3ec32a67e05d3b
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/atomics-memory64.js
@@ -0,0 +1,306 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-memory64 --allow-natives-syntax
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+function allowOOM(fn) {
+  try {
+    fn();
+  } catch (e) {
+    const is_oom =
+        (e instanceof RangeError) && e.message.includes('Out of memory');
+    if (!is_oom) throw e;
+  }
+}
+
+function CreateBigSharedWasmMemory64(num_pages) {
+  let builder = new WasmModuleBuilder();
+  builder.addMemory64(num_pages, num_pages, true);
+  builder.exportMemoryAs('memory');
+  return builder.instantiate().exports.memory;
+}
+
+function WasmAtomicNotify(memory, offset, index, num) {
+  let builder = new WasmModuleBuilder();
+  let pages = memory.buffer.byteLength / kPageSize;
+  builder.addImportedMemory("m", "memory", pages, pages, "shared", "memory64");
+  builder.addFunction("main", makeSig([kWasmF64, kWasmI32], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64SConvertF64,
+      kExprLocalGet, 1,
+      kAtomicPrefix,
+      kExprAtomicNotify, /* alignment */ 0, ...wasmSignedLeb64(offset, 10)])
+    .exportAs("main");
+
+  let module = new WebAssembly.Module(builder.toBuffer());
+  let instance = new WebAssembly.Instance(module, {m: {memory}});
+  return instance.exports.main(index, num);
+}
+
+function WasmI32AtomicWait(memory, offset, index, val, timeout) {
+  let builder = new WasmModuleBuilder();
+  let pages = memory.buffer.byteLength / kPageSize;
+  builder.addImportedMemory("m", "memory", pages, pages, "shared", "memory64");
+  builder.addFunction("main",
+    makeSig([kWasmF64, kWasmI32, kWasmF64], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64SConvertF64,
+      kExprLocalGet, 1,
+      kExprLocalGet, 2,
+      kExprI64SConvertF64,
+      kAtomicPrefix,
+      kExprI32AtomicWait, /* alignment */ 0, ...wasmSignedLeb64(offset, 10)])
+      .exportAs("main");
+
+  let module = new WebAssembly.Module(builder.toBuffer());
+  let instance = new WebAssembly.Instance(module, {m: {memory}});
+  return instance.exports.main(index, val, timeout);
+}
+
+function WasmI64AtomicWait(memory, offset, index, val_low,
+                                   val_high, timeout) {
+  let builder = new WasmModuleBuilder();
+  let pages = memory.buffer.byteLength / kPageSize;
+  builder.addImportedMemory("m", "memory", pages, pages, "shared", "memory64");
+  // Wrapper for I64AtomicWait that takes two I32 values and combines to into
+  // I64 for the instruction parameter.
+  builder.addFunction("main",
+    makeSig([kWasmF64, kWasmI32, kWasmI32, kWasmF64], [kWasmI32]))
+    .addLocals(kWasmI64, 1)
+    .addBody([
+      kExprLocalGet, 1,
+      kExprI64UConvertI32,
+      kExprI64Const, 32,
+      kExprI64Shl,
+      kExprLocalGet, 2,
+      kExprI64UConvertI32,
+      kExprI64Ior,
+      kExprLocalSet, 4, // Store the created I64 value in local
+      kExprLocalGet, 0,
+      kExprI64SConvertF64,
+      kExprLocalGet, 4,
+      kExprLocalGet, 3,
+      kExprI64SConvertF64,
+      kAtomicPrefix,
+      kExprI64AtomicWait, /* alignment */ 0, ...wasmSignedLeb64(offset, 10)])
+      .exportAs("main");
+
+  let module = new WebAssembly.Module(builder.toBuffer());
+  let instance = new WebAssembly.Instance(module, {m: {memory}});
+  return instance.exports.main(index, val_high, val_low, timeout);
+}
+
+function TestAtomicI32Wait(pages, offset) {
+  if (!%IsAtomicsWaitAllowed()) return;
+  print(arguments.callee.name);
+
+  let memory = CreateBigSharedWasmMemory64(pages);
+
+  assertEquals(kAtomicWaitNotEqual, WasmI32AtomicWait(memory, offset, 0, 42, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI32AtomicWait(memory, offset, 0, 0, 0));
+  assertEquals(kAtomicWaitNotEqual, WasmI32AtomicWait(memory, 0, offset, 42, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI32AtomicWait(memory, 0, offset, 0, 0));
+
+  let i32a = new Int32Array(memory.buffer);
+  i32a[offset / 4] = 1;
+
+  assertEquals(kAtomicWaitNotEqual, WasmI32AtomicWait(memory, offset, 0, 0, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI32AtomicWait(memory, offset, 0, 1, 0));
+  assertEquals(kAtomicWaitNotEqual, WasmI32AtomicWait(memory, 0, offset, 0, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI32AtomicWait(memory, 0, offset, 1, 0));
+}
+
+function TestAtomicI64Wait(pages, offset) {
+  if (!%IsAtomicsWaitAllowed()) return;
+  print(arguments.callee.name);
+
+  let memory = CreateBigSharedWasmMemory64(pages);
+  assertEquals(kAtomicWaitNotEqual, WasmI64AtomicWait(memory, offset, 0, 42, 0, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI64AtomicWait(memory, offset, 0, 0, 0, 0));
+  assertEquals(kAtomicWaitNotEqual, WasmI64AtomicWait(memory, 0, offset, 42, 0, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI64AtomicWait(memory, 0, offset, 0, 0, 0));
+
+  let i32a = new Int32Array(memory.buffer);
+  i32a[offset / 4] = 1;
+  i32a[(offset / 4) + 1] = 2;
+
+  assertEquals(kAtomicWaitNotEqual, WasmI64AtomicWait(memory, offset, 0, 2, 1, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI64AtomicWait(memory, offset, 0, 1, 2, 0));
+  assertEquals(kAtomicWaitNotEqual, WasmI64AtomicWait(memory, 0, offset, 2, 1, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI64AtomicWait(memory, 0, offset, 1, 2, 0));
+}
+
+//// WORKER ONLY TESTS
+
+function TestWasmAtomicsInWorkers(OFFSET, INDEX, PAGES) {
+  // This test creates 4 workers that wait on consecutive (8 byte separated to
+  // satisfy alignments for all kinds of wait) memory locations to test various
+  // wait/wake combinations. For each combination, each thread waits 3 times
+  // expecting all 4 threads to be woken with wake(4) in first iteration, all 4
+  // to be woken with wake(5) in second iteration and, 3 and 1 to be woken in
+  // third iteration.
+  print(arguments.callee.name);
+
+  const INDEX_JS = OFFSET + INDEX;
+  let memory = CreateBigSharedWasmMemory64(PAGES);
+  let i32a = new Int32Array(memory.buffer);
+  const numWorkers = 4;
+
+  let workerScript = `onmessage = function(msg) {
+    d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+    ${WasmI32AtomicWait.toString()}
+    ${WasmI64AtomicWait.toString()}
+    let id = msg.id;
+    let memory = msg.memory;
+    let INDEX = msg.INDEX;
+    let OFFSET = msg.OFFSET;
+    let INDEX_JS = OFFSET + INDEX;
+    let i32a = new Int32Array(memory.buffer);
+    // Indices are divided by 4 for Atomics.wait to convert them to index
+    // for Int32Array.
+    // For wasm-wake numWorkers threads.
+    let result = Atomics.wait(i32a, INDEX_JS / 4, 0);
+    postMessage(result);
+    // For wasm-wake numWorkers + 1 threads.
+    result = Atomics.wait(i32a, (INDEX_JS + 8) / 4, 0);
+    postMessage(result);
+    // For wasm-wake numWorkers - 1 threads.
+    result = Atomics.wait(i32a, (INDEX_JS + 16) / 4, 0);
+    postMessage(result);
+    // For js-wake numWorkers threads.
+    result = WasmI32AtomicWait(memory, OFFSET, INDEX + 24, 0, -1);
+    postMessage(result);
+    // For js-wake numWorkers + 1 threads.
+    result = WasmI32AtomicWait(memory, OFFSET, INDEX + 32, 0, -1);
+    postMessage(result);
+    // For js-wake numWorkers - 1 threads.
+    result = WasmI32AtomicWait(memory, OFFSET, INDEX + 40, 0, -1);
+    postMessage(result);
+    // For wasm-wake numWorkers threads.
+    result = WasmI32AtomicWait(memory, OFFSET, INDEX + 48, 0, -1);
+    postMessage(result);
+    // For wasm-wake numWorkers + 1 threads.
+    result = WasmI32AtomicWait(memory, OFFSET, INDEX + 56, 0, -1);
+    postMessage(result);
+    // For wasm-wake numWorkers - 1 threads.
+    result = WasmI32AtomicWait(memory, OFFSET, INDEX + 64, 0, -1);
+    postMessage(result);
+    // For js-wake numWorkers threads.
+    result = WasmI64AtomicWait(memory, OFFSET, INDEX + 72, 0, 0, -1);
+    postMessage(result);
+    // For js-wake numWorkers + 1 threads.
+    result = WasmI64AtomicWait(memory, OFFSET, INDEX + 80, 0, 0, -1);
+    postMessage(result);
+    // For js-wake numWorkers - 1 threads.
+    result = WasmI64AtomicWait(memory, OFFSET, INDEX + 88, 0, 0, -1);
+    postMessage(result);
+    // For wasm-wake numWorkers threads.
+    result = WasmI64AtomicWait(memory, OFFSET, INDEX + 96, 0, 0, -1);
+    postMessage(result);
+    // For wasm-wake numWorkers + 1 threads.
+    result = WasmI64AtomicWait(memory, OFFSET, INDEX + 104, 0, 0, -1);
+    postMessage(result);
+    // For wasm-wake numWorkers - 1 threads.
+    result = WasmI64AtomicWait(memory, OFFSET, INDEX + 112, 0, 0, -1);
+    postMessage(result);
+  };`;
+
+  let waitForAllWorkers = function(index) {
+    while (%AtomicsNumWaitersForTesting(i32a, index / 4) != numWorkers) {}
+  }
+
+  let jsWakeCheck = function(index, num, workers, msg) {
+    waitForAllWorkers(index);
+    let indexJs = index / 4;
+    if (num >= numWorkers) {
+      // If numWorkers or more is passed to wake, numWorkers workers should be
+      // woken.
+      assertEquals(numWorkers, Atomics.notify(i32a, indexJs, num));
+    } else {
+      // If num < numWorkers is passed to wake, num workers should be woken.
+      // Then the remaining workers are woken for the next part.
+      assertEquals(num, Atomics.notify(i32a, indexJs, num));
+      assertEquals(numWorkers-num, Atomics.notify(i32a, indexJs, numWorkers));
+    }
+    for (let id = 0; id < numWorkers; id++) {
+      assertEquals(msg, workers[id].getMessage());
+    }
+  };
+
+  let wasmWakeCheck = function(offset, index, num, workers, msg) {
+    waitForAllWorkers(offset + index);
+    if (num >= numWorkers) {
+      assertEquals(numWorkers, WasmAtomicNotify(memory, offset, index, num));
+    } else {
+      assertEquals(num, WasmAtomicNotify(memory, offset, index, num));
+      assertEquals(numWorkers-num,
+                   WasmAtomicNotify(memory, offset, index, numWorkers));
+    }
+    for (let id = 0; id < numWorkers; id++) {
+      assertEquals(msg, workers[id].getMessage());
+    }
+  };
+
+  let workers = [];
+  for (let id = 0; id < numWorkers; id++) {
+    workers[id] = new Worker(workerScript, {type: 'string'});
+    workers[id].postMessage({id, memory, INDEX, OFFSET});
+  }
+
+  wasmWakeCheck(OFFSET, INDEX + 0, numWorkers, workers, "ok");
+  wasmWakeCheck(OFFSET, INDEX + 8, numWorkers + 1, workers, "ok");
+  wasmWakeCheck(OFFSET, INDEX + 16, numWorkers - 1, workers, "ok");
+
+  jsWakeCheck(INDEX_JS + 24, numWorkers, workers, kAtomicWaitOk);
+  jsWakeCheck(INDEX_JS + 32, numWorkers + 1, workers, kAtomicWaitOk);
+  jsWakeCheck(INDEX_JS + 40, numWorkers - 1, workers, kAtomicWaitOk);
+
+  wasmWakeCheck(OFFSET, INDEX + 48, numWorkers, workers, kAtomicWaitOk);
+  wasmWakeCheck(OFFSET, INDEX + 56, numWorkers + 1, workers, kAtomicWaitOk);
+  wasmWakeCheck(OFFSET, INDEX + 64, numWorkers - 1, workers, kAtomicWaitOk);
+
+  jsWakeCheck(INDEX_JS + 72, numWorkers, workers, kAtomicWaitOk);
+  jsWakeCheck(INDEX_JS + 80, numWorkers + 1, workers, kAtomicWaitOk);
+  jsWakeCheck(INDEX_JS + 88, numWorkers - 1, workers, kAtomicWaitOk);
+
+  wasmWakeCheck(OFFSET, INDEX + 96,  numWorkers, workers, kAtomicWaitOk);
+  wasmWakeCheck(OFFSET, INDEX + 104, numWorkers + 1, workers, kAtomicWaitOk);
+  wasmWakeCheck(OFFSET, INDEX + 112, numWorkers - 1, workers, kAtomicWaitOk);
+
+  for (let id = 0; id < numWorkers; id++) {
+    workers[id].terminate();
+  }
+}
+
+const OFFSET = 4000;
+const MEM_PAGES = 100;
+
+const GB = 1024 * 1024 * 1024;
+const BIG_OFFSET = 4294970000;
+const BIG_MEM_PAGES = 5 * GB / kPageSize;
+
+(function(){
+  TestAtomicI32Wait(MEM_PAGES, OFFSET);
+  TestAtomicI64Wait(MEM_PAGES, OFFSET);
+
+  if (this.Worker) {
+    TestWasmAtomicsInWorkers(OFFSET, 0, MEM_PAGES);
+    TestWasmAtomicsInWorkers(0, OFFSET, MEM_PAGES);
+  }
+})();
+
+// Tests require Big memory >4GB, they may fail because of OOM.
+(function(){
+  allowOOM(() => TestAtomicI32Wait(BIG_MEM_PAGES, BIG_OFFSET));
+  allowOOM(() => TestAtomicI64Wait(BIG_MEM_PAGES, BIG_OFFSET));
+
+  if (this.Worker) {
+    allowOOM(() => TestWasmAtomicsInWorkers(BIG_OFFSET, 0, BIG_MEM_PAGES));
+    allowOOM(() => TestWasmAtomicsInWorkers(0, BIG_OFFSET, BIG_MEM_PAGES));
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/atomics.js b/deps/v8/test/mjsunit/wasm/atomics.js
index c60565fb454bf7..e88b69b785b341 100644
--- a/deps/v8/test/mjsunit/wasm/atomics.js
+++ b/deps/v8/test/mjsunit/wasm/atomics.js
@@ -4,6 +4,7 @@
 
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
+const kMemtypeSize64 = 8;
 const kMemtypeSize32 = 4;
 const kMemtypeSize16 = 2;
 const kMemtypeSize8 = 1;
@@ -36,6 +37,26 @@ function GetAtomicBinOpFunction(wasmExpression, alignment, offset) {
   return instance.exports.main;
 }
 
+function GetI64AtomicBinOpFunction(wasmExpression, alignment, offset) {
+  const kSig_l_il = makeSig([kWasmI32, kWasmI64], [kWasmI64]);
+  let builder = new WasmModuleBuilder();
+  builder.addImportedMemory("m", "imported_mem", 0, maxSize, "shared");
+  builder.addFunction("main", kSig_l_il)
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kAtomicPrefix,
+      wasmExpression, alignment, offset
+    ])
+    .exportAs("main");
+
+  // Instantiate module, get function exports
+  let module = new WebAssembly.Module(builder.toBuffer());
+  let instance = new WebAssembly.Instance(module,
+        {m: {imported_mem: memory}});
+  return instance.exports.main;
+}
+
 function GetAtomicCmpExchangeFunction(wasmExpression, alignment, offset) {
   let builder = new WasmModuleBuilder();
   builder.addImportedMemory("m", "imported_mem", 0, maxSize, "shared");
@@ -90,6 +111,23 @@ function GetAtomicStoreFunction(wasmExpression, alignment, offset) {
   return instance.exports.main;
 }
 
+function VerifyBoundsCheck64(func, memtype_size) {
+  const kPageSize = 65536;
+  // Test out of bounds at boundary
+  for (let i = memory.buffer.byteLength - memtype_size + 1;
+       i < memory.buffer.byteLength + memtype_size + 4; i++) {
+    assertTrapsOneOf(
+      // If an underlying platform uses traps for a bounds check,
+      // kTrapUnalignedAccess will be thrown before kTrapMemOutOfBounds.
+      // Otherwise, kTrapMemOutOfBounds will be first.
+      [kTrapMemOutOfBounds, kTrapUnalignedAccess],
+      () => func(i, 5n, 10n)
+    );
+  }
+  // Test out of bounds at maximum + 1
+  assertTraps(kTrapMemOutOfBounds, () => func((maxSize + 1) * kPageSize, 5n, 1n));
+}
+
 function VerifyBoundsCheck(func, memtype_size) {
   const kPageSize = 65536;
   // Test out of bounds at boundary
@@ -147,6 +185,54 @@ function Test8Op(operation, func) {
   VerifyBoundsCheck(func, kMemtypeSize8, 10);
 }
 
+function Test64Op(operation, func) {
+  let i64 = new BigUint64Array(memory.buffer);
+  for (let i = 0; i < i64.length; i = inc(i)) {
+    let expected = 987659876543210n;
+    let value = 111111111111111n;
+    i64[i] = expected;
+    assertEquals(expected, func(i * kMemtypeSize64, value));
+    assertEquals(operation(expected, value), i64[i]);
+  }
+  VerifyBoundsCheck64(func, kMemtypeSize64);
+}
+
+function Test32Op64(operation, func) {
+  let i32 = new Uint32Array(memory.buffer);
+  for (let i = 0; i < i32.length; i = inc(i)) {
+    let expected = 123456;
+    let value = 111111n;
+    i32[i] = expected;
+    assertEquals(expected, Number(func(i * kMemtypeSize32, value)));
+    assertEquals(operation(expected, Number(value)), i32[i]);
+  }
+  VerifyBoundsCheck64(func, kMemtypeSize32);
+}
+
+function Test16Op64(operation, func) {
+  let i16 = new Uint16Array(memory.buffer);
+  for (let i = 0; i < i16.length; i = inc(i)) {
+    let expected = 0xd00d;
+    let value = 0x1111n;
+    i16[i] = expected;
+    assertEquals(expected, Number(func(i * kMemtypeSize16, value)));
+    assertEquals(operation(expected, Number(value)), i16[i]);
+  }
+  VerifyBoundsCheck64(func, kMemtypeSize16);
+}
+
+function Test8Op64(operation, func) {
+  let i8 = new Uint8Array(memory.buffer);
+  for (let i = 0; i < i8.length; i = inc(i)) {
+    let expected = 0xbe;
+    let value = 0x12n;
+    i8[i] = expected;
+    assertEquals(expected, Number(func(i * kMemtypeSize8, value)));
+    assertEquals(operation(expected, Number(value)), i8[i]);
+  }
+  VerifyBoundsCheck64(func, kMemtypeSize8, 10);
+}
+
 (function TestAtomicAdd() {
   print(arguments.callee.name);
   let wasmAdd = GetAtomicBinOpFunction(kExprI32AtomicAdd, 2, 0);
@@ -165,6 +251,30 @@ function Test8Op(operation, func) {
   Test8Op(Add, wasmAdd);
 })();
 
+(function TestI64AtomicAdd() {
+  print(arguments.callee.name);
+  let wasmAdd = GetI64AtomicBinOpFunction(kExprI64AtomicAdd, 3, 0);
+  Test64Op(Add, wasmAdd);
+})();
+
+(function TestI64AtomicAdd32U() {
+  print(arguments.callee.name);
+  let wasmAdd = GetI64AtomicBinOpFunction(kExprI64AtomicAdd32U, 2, 0);
+  Test32Op64(Add, wasmAdd);
+})();
+
+(function TestI64AtomicAdd16U() {
+  print(arguments.callee.name);
+  let wasmAdd = GetI64AtomicBinOpFunction(kExprI64AtomicAdd16U, 1, 0);
+  Test16Op64(Add, wasmAdd);
+})();
+
+(function TestI64AtomicAdd8U() {
+  print(arguments.callee.name);
+  let wasmAdd = GetI64AtomicBinOpFunction(kExprI64AtomicAdd8U, 0, 0);
+  Test8Op64(Add, wasmAdd);
+})();
+
 (function TestAtomicSub() {
   print(arguments.callee.name);
   let wasmSub = GetAtomicBinOpFunction(kExprI32AtomicSub, 2, 0);
@@ -183,6 +293,30 @@ function Test8Op(operation, func) {
   Test8Op(Sub, wasmSub);
 })();
 
+(function TestI64AtomicSub() {
+  print(arguments.callee.name);
+  let wasmSub = GetI64AtomicBinOpFunction(kExprI64AtomicSub, 3, 0);
+  Test64Op(Sub, wasmSub);
+})();
+
+(function TestI64AtomicSub32U() {
+  print(arguments.callee.name);
+  let wasmSub = GetI64AtomicBinOpFunction(kExprI64AtomicSub32U, 2, 0);
+  Test32Op64(Sub, wasmSub);
+})();
+
+(function TestI64AtomicSub16U() {
+  print(arguments.callee.name);
+  let wasmSub = GetI64AtomicBinOpFunction(kExprI64AtomicSub16U, 1, 0);
+  Test16Op64(Sub, wasmSub);
+})();
+
+(function TestI64AtomicSub8U() {
+  print(arguments.callee.name);
+  let wasmSub = GetI64AtomicBinOpFunction(kExprI64AtomicSub8U, 0, 0);
+  Test8Op64(Sub, wasmSub);
+})();
+
 (function TestAtomicAnd() {
   print(arguments.callee.name);
   let wasmAnd = GetAtomicBinOpFunction(kExprI32AtomicAnd, 2, 0);
@@ -201,6 +335,30 @@ function Test8Op(operation, func) {
   Test8Op(And, wasmAnd);
 })();
 
+(function TestI64AtomicAnd() {
+  print(arguments.callee.name);
+  let wasmAnd = GetI64AtomicBinOpFunction(kExprI64AtomicAnd, 3, 0);
+  Test64Op(And, wasmAnd);
+})();
+
+(function TestI64AtomicAnd32U() {
+  print(arguments.callee.name);
+  let wasmAnd = GetI64AtomicBinOpFunction(kExprI64AtomicAnd32U, 2, 0);
+  Test32Op64(And, wasmAnd);
+})();
+
+(function TestI64AtomicAnd16U() {
+  print(arguments.callee.name);
+  let wasmAnd = GetI64AtomicBinOpFunction(kExprI64AtomicAnd16U, 1, 0);
+  Test16Op64(And, wasmAnd);
+})();
+
+(function TestI64AtomicAnd8U() {
+  print(arguments.callee.name);
+  let wasmAnd = GetI64AtomicBinOpFunction(kExprI64AtomicAnd8U, 0, 0);
+  Test8Op64(And, wasmAnd);
+})();
+
 (function TestAtomicOr() {
   print(arguments.callee.name);
   let wasmOr = GetAtomicBinOpFunction(kExprI32AtomicOr, 2, 0);
@@ -219,6 +377,30 @@ function Test8Op(operation, func) {
   Test8Op(Or, wasmOr);
 })();
 
+(function TestI64AtomicOr() {
+  print(arguments.callee.name);
+  let wasmOr = GetI64AtomicBinOpFunction(kExprI64AtomicOr, 3, 0);
+  Test64Op(Or, wasmOr);
+})();
+
+(function TestI64AtomicOr32U() {
+  print(arguments.callee.name);
+  let wasmOr = GetI64AtomicBinOpFunction(kExprI64AtomicOr32U, 2, 0);
+  Test32Op64(Or, wasmOr);
+})();
+
+(function TestI64AtomicOr16U() {
+  print(arguments.callee.name);
+  let wasmOr = GetI64AtomicBinOpFunction(kExprI64AtomicOr16U, 1, 0);
+  Test16Op64(Or, wasmOr);
+})();
+
+(function TestI64AtomicOr8U() {
+  print(arguments.callee.name);
+  let wasmOr = GetI64AtomicBinOpFunction(kExprI64AtomicOr8U, 0, 0);
+  Test8Op64(Or, wasmOr);
+})();
+
 (function TestAtomicXor() {
   print(arguments.callee.name);
   let wasmXor = GetAtomicBinOpFunction(kExprI32AtomicXor, 2, 0);
@@ -237,6 +419,30 @@ function Test8Op(operation, func) {
   Test8Op(Xor, wasmXor);
 })();
 
+(function TestI64AtomicXor() {
+  print(arguments.callee.name);
+  let wasmXor = GetI64AtomicBinOpFunction(kExprI64AtomicXor, 3, 0);
+  Test64Op(Xor, wasmXor);
+})();
+
+(function TestI64AtomicXor32U() {
+  print(arguments.callee.name);
+  let wasmXor = GetI64AtomicBinOpFunction(kExprI64AtomicXor32U, 2, 0);
+  Test32Op64(Xor, wasmXor);
+})();
+
+(function TestI64AtomicXor16U() {
+  print(arguments.callee.name);
+  let wasmXor = GetI64AtomicBinOpFunction(kExprI64AtomicXor16U, 1, 0);
+  Test16Op64(Xor, wasmXor);
+})();
+
+(function TestI64AtomicXor8U() {
+  print(arguments.callee.name);
+  let wasmXor = GetI64AtomicBinOpFunction(kExprI64AtomicXor8U, 0, 0);
+  Test8Op64(Xor, wasmXor);
+})();
+
 (function TestAtomicExchange() {
   print(arguments.callee.name);
   let wasmExchange = GetAtomicBinOpFunction(kExprI32AtomicExchange, 2, 0);
@@ -255,6 +461,31 @@ function Test8Op(operation, func) {
   Test8Op(Exchange, wasmExchange);
 })();
 
+(function TestI64AtomicExchange() {
+  print(arguments.callee.name);
+  let wasmExchange = GetI64AtomicBinOpFunction(kExprI64AtomicExchange, 3, 0);
+  Test64Op(Exchange, wasmExchange);
+})();
+
+(function TestI64AtomicExchange32U() {
+  print(arguments.callee.name);
+  let wasmExchange = GetI64AtomicBinOpFunction(kExprI64AtomicExchange32U, 2, 0);
+  Test32Op64(Exchange, wasmExchange);
+})();
+
+(function TestI64AtomicExchange16U() {
+  print(arguments.callee.name);
+  let wasmExchange = GetI64AtomicBinOpFunction(kExprI64AtomicExchange16U, 1, 0);
+  Test16Op64(Exchange, wasmExchange);
+})();
+
+(function TestI64AtomicExchange8U() {
+  print(arguments.callee.name);
+  let wasmExchange = GetI64AtomicBinOpFunction(kExprI64AtomicExchange8U, 0, 0);
+  Test8Op64(Exchange, wasmExchange);
+})();
+
+
 function TestCmpExchange(func, buffer, params, size, offset = 0) {
   for (let i = 0; i + (offset / size) < buffer.length; i = inc(i)) {
     for (let j = 0; j < params.length; j++) {
diff --git a/deps/v8/test/mjsunit/wasm/bounds-check-64bit.js b/deps/v8/test/mjsunit/wasm/bounds-check-64bit.js
index 9557e50ec73c54..f348d400f39bf5 100644
--- a/deps/v8/test/mjsunit/wasm/bounds-check-64bit.js
+++ b/deps/v8/test/mjsunit/wasm/bounds-check-64bit.js
@@ -5,7 +5,7 @@
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, undefined, false);
+builder.addMemory(1, undefined);
 builder.addFunction('load', kSig_i_ii)
     .addBody([
         kExprLocalGet, 0,
diff --git a/deps/v8/test/mjsunit/wasm/bounds-check-turbofan.js b/deps/v8/test/mjsunit/wasm/bounds-check-turbofan.js
index c3eb9f32a64718..e636fe210fbee4 100644
--- a/deps/v8/test/mjsunit/wasm/bounds-check-turbofan.js
+++ b/deps/v8/test/mjsunit/wasm/bounds-check-turbofan.js
@@ -7,7 +7,7 @@
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 const builder = new WasmModuleBuilder();
-builder.addMemory(1, undefined, false);
+builder.addMemory(1, undefined);
 builder.addFunction('load', kSig_i_i)
     .addBody([
         kExprLocalGet, 0,
diff --git a/deps/v8/test/mjsunit/wasm/bulk-memory.js b/deps/v8/test/mjsunit/wasm/bulk-memory.js
index 4781915285f69a..aa5dd93cbd0108 100644
--- a/deps/v8/test/mjsunit/wasm/bulk-memory.js
+++ b/deps/v8/test/mjsunit/wasm/bulk-memory.js
@@ -7,7 +7,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 (function TestPassiveDataSegment() {
   print(arguments.callee.name);
   const builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   builder.addPassiveDataSegment([0, 1, 2]);
   builder.addPassiveDataSegment([3, 4]);
 
diff --git a/deps/v8/test/mjsunit/wasm/calls.js b/deps/v8/test/mjsunit/wasm/calls.js
index ae4cc8a0cb8f00..7055046def3026 100644
--- a/deps/v8/test/mjsunit/wasm/calls.js
+++ b/deps/v8/test/mjsunit/wasm/calls.js
@@ -46,7 +46,8 @@ function assertFunction(module, func) {
 
   var builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
+  builder.exportMemoryAs("memory");
   builder.addFunction("sub", kSig_i_ii)
     .addBody([
       kExprLocalGet, 0,             // --
@@ -71,7 +72,8 @@ function assertFunction(module, func) {
   var builder = new WasmModuleBuilder();
 
   var kPages = 2;
-  builder.addMemory(kPages, kPages, true);
+  builder.addMemory(kPages, kPages);
+  builder.exportMemoryAs("memory");
   builder.addFunction("nop", kSig_v_v)
     .addBody([kExprNop])
     .exportFunc();
@@ -88,7 +90,8 @@ function assertFunction(module, func) {
   var builder = new WasmModuleBuilder();
 
   var kPages = 3;
-  builder.addMemory(kPages, kPages, true);
+  builder.addMemory(kPages, kPages);
+  builder.exportMemoryAs("memory");
   builder.addFunction("flt", kSig_i_dd)
     .addBody([
       kExprLocalGet, 0,     // --
diff --git a/deps/v8/test/mjsunit/wasm/compiled-module-management.js b/deps/v8/test/mjsunit/wasm/compiled-module-management.js
index ee37fdbd50f004..851456b343d776 100644
--- a/deps/v8/test/mjsunit/wasm/compiled-module-management.js
+++ b/deps/v8/test/mjsunit/wasm/compiled-module-management.js
@@ -18,7 +18,7 @@ var instance4;
 (function CompiledModuleInstancesInitialize1to3() {
   var builder = new WasmModuleBuilder();
 
-  builder.addMemory(1,1, true);
+  builder.addMemory(1, 1);
   builder.addImport("", "getValue", kSig_i_v);
   builder.addFunction("f", kSig_i_v)
     .addBody([
diff --git a/deps/v8/test/mjsunit/wasm/data-segments.js b/deps/v8/test/mjsunit/wasm/data-segments.js
index e47dbfc528d883..687bf7ea68856c 100644
--- a/deps/v8/test/mjsunit/wasm/data-segments.js
+++ b/deps/v8/test/mjsunit/wasm/data-segments.js
@@ -11,7 +11,7 @@ var debug = false;
 function SimpleDataSegmentTest(offset) {
   print("SimpleDataSegmentTest(" + offset + ")...");
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   builder.addFunction("load", kSig_i_i)
     .addBody([kExprLocalGet, 0, kExprI32LoadMem, 0, 0])
     .exportAs("load");
@@ -34,7 +34,7 @@ SimpleDataSegmentTest(1064);
 function GlobalImportedInitTest(pad) {
   print("GlobaleImportedInitTest(" + pad + ")...");
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
 
   var g = builder.addImportedGlobal("mod", "offset", kWasmI32);
 
diff --git a/deps/v8/test/mjsunit/wasm/disallow-codegen.js b/deps/v8/test/mjsunit/wasm/disallow-codegen.js
index 1f33c469fb10d9..fd12d1a8f82704 100644
--- a/deps/v8/test/mjsunit/wasm/disallow-codegen.js
+++ b/deps/v8/test/mjsunit/wasm/disallow-codegen.js
@@ -10,7 +10,7 @@ let kReturnValue = 19;
 
 let buffer = (function CreateBuffer() {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
   builder.addFunction('main', kSig_i_v)
       .addBody([kExprI32Const, kReturnValue])
       .exportFunc();
diff --git a/deps/v8/test/mjsunit/wasm/errors.js b/deps/v8/test/mjsunit/wasm/errors.js
index 44928656da2a63..ab07d111282ef8 100644
--- a/deps/v8/test/mjsunit/wasm/errors.js
+++ b/deps/v8/test/mjsunit/wasm/errors.js
@@ -69,7 +69,7 @@ function assertConversionError(bytes, imports, msg) {
         b.addExplicitSection([kCodeSectionCode, 2, 1, 0]);
         return b.toBuffer();
       })(),
-      error('expected local decls count @+22'));
+      error('reached end while decoding local decls count @+22'));
   assertCompileError(
       builder().addFunction('f', kSig_i_v).end().toBuffer(),
       f_error('function body must end with "end" opcode @+24'));
@@ -88,7 +88,7 @@ function assertConversionError(bytes, imports, msg) {
 function import_error(index, module, func, msg) {
   let full_msg = 'Import #' + index + ' module=\"' + module + '\"';
   if (func !== undefined) full_msg += ' function=\"' + func + '\"';
-  return full_msg + ' error: ' + msg;
+  return full_msg + ': ' + msg;
 }
 
 (function TestTypeError() {
diff --git a/deps/v8/test/mjsunit/wasm/exceptions-api.js b/deps/v8/test/mjsunit/wasm/exceptions-api.js
index b45e984c22495f..14a0b78a288051 100644
--- a/deps/v8/test/mjsunit/wasm/exceptions-api.js
+++ b/deps/v8/test/mjsunit/wasm/exceptions-api.js
@@ -94,6 +94,11 @@ load("test/mjsunit/wasm/wasm-module-builder.js");
       {parameters: ['i32', 'f32', 'i64', 'f64', 'externref']});
   assertThrows(() => new WebAssembly.Exception(
       tag, [1n, 2, 3n, 4, {}]), TypeError);
+  assertThrows(() => new WebAssembly.Exception(
+      tag, {}), TypeError, /Exception values argument has no length/);
+  assertThrows(() => new WebAssembly.Exception(
+      tag, []), TypeError,
+      /Number of exception values does not match signature length/);
   assertDoesNotThrow(() => new WebAssembly.Exception(tag, [3, 4, 5n, 6, {}]));
 })();
 
@@ -212,6 +217,7 @@ function TestGetArgHelper(types_str, types, values) {
 }
 
 (function TestGetArg() {
+  print(arguments.callee.name);
   // Check errors.
   let tag = new WebAssembly.Tag({parameters: ['i32']});
   let exception = new WebAssembly.Exception(tag, [0]);
@@ -250,3 +256,71 @@ function TestGetArgHelper(types_str, types, values) {
   assertThrows(() => exception.is.apply({}, tag1), TypeError,
       /Receiver is not a WebAssembly.Exception/);
 })();
+
+(function TestJSTag() {
+  print(arguments.callee.name);
+  assertTrue(WebAssembly.JSTag instanceof WebAssembly.Tag);
+  let desc = Object.getOwnPropertyDescriptor(WebAssembly, 'JSTag');
+  assertEquals(typeof desc.value, 'object');
+  assertFalse(desc.writable);
+  assertFalse(desc.enumerable);
+  assertTrue(desc.configurable);
+})();
+
+(function TestCatchJSTag() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let js_tag = builder.addImportedTag("", "tag", kSig_v_r);
+
+  // Throw a JS object and check that we can catch it and unpack it using
+  // WebAssembly.JSTag.
+  function throw_ref(x) {
+    throw x;
+  }
+  let kJSThrowRef = builder.addImport("", "throw_ref", kSig_r_r);
+  try_sig_index = builder.addType(kSig_r_v);
+  builder.addFunction("test", kSig_r_r)
+    .addBody([
+      kExprTry, try_sig_index,
+        kExprLocalGet, 0,
+        kExprCallFunction, kJSThrowRef,
+      kExprCatch, js_tag,
+      kExprEnd,
+    ])
+    .exportFunc();
+
+  let instance = builder.instantiate({"": {
+      throw_ref: throw_ref,
+      tag: WebAssembly.JSTag,
+  }});
+
+  let obj = {};
+
+  // Catch with implicit wrapping.
+  assertSame(obj, instance.exports.test(obj));
+  // Catch with explicit wrapping.
+  assertSame(obj, instance.exports.test(new WebAssembly.Exception(WebAssembly.JSTag, [obj])));
+  // Don't catch with explicit wrapping.
+  let not_js_tag = new WebAssembly.Tag({parameters:['externref']});
+  let exn = new WebAssembly.Exception(not_js_tag, [obj]);
+  assertThrowsEquals(() => instance.exports.test(exn), exn);
+
+
+  // There is a separate code path for tags with externref type, so also check
+  // that everything still works when the tag is *not* the JSTag.
+
+  instance = builder.instantiate({"": {
+      throw_ref: throw_ref,
+      tag: not_js_tag
+  }});
+
+  // Catch with explicit wrapping.
+  assertSame(obj, instance.exports.test(new WebAssembly.Exception(not_js_tag, [obj])));
+  // Don't catch with explicit wrapping.
+  exn = new WebAssembly.Exception(WebAssembly.JSTag, [obj]);
+  // TODO(thibaudm): Should the exception get implicitly unwrapped when it
+  // bubbles up from wasm to JS, even though it was wrapped explicitly?
+  assertThrowsEquals(() => instance.exports.test(exn), exn);
+  // Don't catch with implicit wrapping.
+  assertThrowsEquals(() => instance.exports.test(obj), obj);
+})();
diff --git a/deps/v8/test/mjsunit/wasm/exceptions-externref.js b/deps/v8/test/mjsunit/wasm/exceptions-externref.js
index 7f398452e60d00..134e8619e0c9b6 100644
--- a/deps/v8/test/mjsunit/wasm/exceptions-externref.js
+++ b/deps/v8/test/mjsunit/wasm/exceptions-externref.js
@@ -19,7 +19,8 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
       ]).exportFunc();
   let instance = builder.instantiate();
 
-  assertWasmThrows(instance, except, [null], () => instance.exports.throw_null());
+  assertWasmThrows(instance, except, [null],
+                   () => instance.exports.throw_null());
 })();
 
 // Test throwing/catching the null-ref value.
@@ -66,10 +67,14 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
   let instance = builder.instantiate();
   let o = new Object();
 
-  assertWasmThrows(instance, except, [o], () => instance.exports.throw_param(o));
-  assertWasmThrows(instance, except, [1], () => instance.exports.throw_param(1));
-  assertWasmThrows(instance, except, [2.3], () => instance.exports.throw_param(2.3));
-  assertWasmThrows(instance, except, ["str"], () => instance.exports.throw_param("str"));
+  assertWasmThrows(instance, except, [o],
+                   () => instance.exports.throw_param(o));
+  assertWasmThrows(instance, except, [1],
+                   () => instance.exports.throw_param(1));
+  assertWasmThrows(instance, except, [2.3],
+                   () => instance.exports.throw_param(2.3));
+  assertWasmThrows(instance, except, ["str"],
+                   () => instance.exports.throw_param("str"));
 })();
 
 // Test throwing/catching the reference type value.
diff --git a/deps/v8/test/mjsunit/wasm/exceptions-gc.js b/deps/v8/test/mjsunit/wasm/exceptions-gc.js
new file mode 100644
index 00000000000000..1348844e9928d0
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/exceptions-gc.js
@@ -0,0 +1,220 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --allow-natives-syntax
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
+
+// Test throwing/catching the reference type value.
+(function TestThrowCatchRefParam() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let sig = builder.addType(kSig_i_i);
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+
+  builder.addFunction("doubler", sig)
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 0, kExprI32Add])
+    .exportFunc();
+
+  builder.addFunction("struct_producer",
+                      makeSig([kWasmI32], [wasmRefType(struct)]))
+    .addBody([kExprLocalGet, 0, kGCPrefix, kExprStructNew, struct])
+    .exportFunc();
+
+  for (let [name, code] of
+      [["extern", kWasmExternRef],
+       ["sig", sig],
+       ["struct", struct]]) {
+    let type = wasmRefNullType(code);
+    let except = builder.addTag(makeSig([type], []));
+    builder.addFunction("throw_catch_param_" + name, makeSig([type],[type]))
+      .addBody([
+        kExprTry, kWasmRefNull, code & kLeb128Mask,
+          kExprLocalGet, 0,
+          kExprThrow, except,
+        kExprCatch, except,
+          // fall-through
+        kExprEnd,
+      ]).exportFunc();
+  }
+
+  let instance = builder.instantiate();
+  let wasm = instance.exports;
+
+  let o = new Object();
+  assertEquals(o, wasm.throw_catch_param_extern(o));
+  assertEquals(1, wasm.throw_catch_param_extern(1));
+  assertEquals(2.3, wasm.throw_catch_param_extern(2.3));
+  assertEquals("str", wasm.throw_catch_param_extern("str"));
+
+  let struct_obj = wasm.struct_producer(42);
+
+  assertEquals(struct_obj, wasm.throw_catch_param_struct(struct_obj));
+
+  let doubler_obj = wasm.doubler;
+  assertEquals(doubler_obj, wasm.throw_catch_param_sig(doubler_obj));
+  assertEquals(20, wasm.throw_catch_param_sig(doubler_obj)(10));
+})();
+
+// Test the encoding of a thrown exception with a null-ref value.
+(function TestThrowRefNull() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+  let except = builder.addTag(makeSig([wasmRefNullType(struct)], []));
+  builder.addFunction("throw_null", kSig_v_v)
+    .addBody([kExprRefNull, kNullRefCode, kExprThrow, except])
+    .exportFunc();
+  let instance = builder.instantiate();
+
+  assertWasmThrows(instance, except, [null],
+                   () => instance.exports.throw_null());
+})();
+
+(function TestJSToWasm() {
+  print(arguments.callee.name);
+
+  let producer = (function() {
+    let builder = new WasmModuleBuilder();
+
+    let struct = builder.addStruct([makeField(kWasmI64, true)]);
+    let array = builder.addArray(wasmRefNullType(struct), true);
+    let sig = builder.addType(kSig_i_ii);
+
+    let struct_builder =
+      builder.addFunction("struct_builder",
+                          makeSig([kWasmI64], [wasmRefType(struct)]))
+        .addBody([kExprLocalGet, 0, kGCPrefix, kExprStructNew, struct])
+        .exportFunc();
+    let array_builder =
+      builder.addFunction("array_builder",
+                          makeSig([kWasmI32], [wasmRefType(array)]))
+        .addBody([kExprLocalGet, 0, kGCPrefix, kExprArrayNewDefault, array])
+        .exportFunc();
+    let adder = builder.addFunction("adder", sig)
+      .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprI32Add])
+      .exportFunc();
+
+    return builder.instantiate().exports;
+  })();
+
+  let struct_obj = producer.struct_builder(42n);
+  let array_obj = producer.array_builder(10);
+  let function_obj = producer.adder;
+  let external_obj = {};
+
+  let tag = new WebAssembly.Tag({
+    parameters: ["externref", "anyfunc", "anyref", "eqref", "i31ref",
+                 "structref", "arrayref"]});
+  let values_mistyped = [external_obj, 123, function_obj, struct_obj, -33,
+                         struct_obj, array_obj];
+  assertThrows(() => new WebAssembly.Exception(tag, values_mistyped), TypeError,
+               /.* must be null \(if nullable\) or a Wasm function object/);
+  let values = [external_obj, function_obj, 123, struct_obj, -33,
+                struct_obj, array_obj];
+  let exn = new WebAssembly.Exception(tag, values);
+  // Make sure we roundtrip corretly through wasm using
+  // the Exception constructor/getArg.
+  for (i = 0 ; i < values.length; i++) {
+    assertEquals(exn.getArg(tag, i), values[i]);
+  }
+
+  let t = () => { throw exn; }
+
+  // Make sure objects in a JS exception object are correctly encoded as wasm
+  // objects.
+  let consumer = (function () {
+    let builder = new WasmModuleBuilder();
+    let struct = builder.addStruct([makeField(kWasmI64, true)]);
+    builder.addArray(wasmRefNullType(struct), true);
+    let sig = builder.addType(kSig_i_ii);
+    let tag_sig = builder.addType(makeSig([
+      kWasmExternRef, kWasmFuncRef, kWasmAnyRef, kWasmEqRef, kWasmI31Ref,
+      kWasmStructRef, kWasmArrayRef], []));
+    let throwing = builder.addImport("m", "t", kSig_i_v);
+    let tag_index = builder.addImportedTag("m", "tag", tag_sig);
+    builder.addFunction("catching", kSig_i_v)
+      .addLocals(kWasmExternRef, 1)
+      .addLocals(kWasmFuncRef, 1)
+      .addLocals(kWasmAnyRef, 1)
+      .addLocals(kWasmEqRef, 1)
+      .addLocals(kWasmI31Ref, 1)
+      .addLocals(kWasmStructRef, 1)
+      .addLocals(kWasmArrayRef, 1)
+      .addBody([
+        kExprTry, kWasmI32,
+          kExprCallFunction, throwing,
+        kExprCatch, tag_index,
+          kExprLocalSet, 6,
+          kExprLocalSet, 5,
+          kExprLocalSet, 4,
+          kExprLocalSet, 3,
+          kExprLocalSet, 2,
+          kExprLocalSet, 1,
+          kExprLocalSet, 0,
+
+          // adder(10, 20)
+          kExprI32Const, 10, kExprI32Const, 20,
+          kExprLocalGet, 1, kGCPrefix, kExprRefCast, sig, kExprCallRef, sig,
+
+          // 123
+          kExprLocalGet, 2, kGCPrefix, kExprRefCast, kI31RefCode,
+          kGCPrefix, kExprI31GetS,
+
+          // (i32) struct(42l).get_0
+          kExprLocalGet, 3, kGCPrefix, kExprRefCast, struct,
+          kGCPrefix, kExprStructGet, struct, 0, kExprI32ConvertI64,
+
+          // -33
+          kExprLocalGet, 4, kGCPrefix, kExprI31GetS,
+
+          // (i32) struct(42l).get_0
+          kExprLocalGet, 5, kGCPrefix, kExprRefCast, struct,
+          kGCPrefix, kExprStructGet, struct, 0, kExprI32ConvertI64,
+
+          // array.length
+          kExprLocalGet, 6, kGCPrefix, kExprArrayLen,
+
+          // Now add them all up.
+          kExprI32Add, kExprI32Add, kExprI32Add, kExprI32Add, kExprI32Add,
+        kExprEnd])
+      .exportFunc()
+
+    return builder.instantiate({m: {t: t, tag: tag}}).exports
+  })();
+
+  assertEquals(30 + 123 + 42 + (-33) + 42 + 10, consumer.catching());
+})();
+
+(function TestWasmToJS() {
+  print(arguments.callee.name);
+
+  let builder = new WasmModuleBuilder();
+
+  let sig = builder.addType(kSig_i_ii);
+
+  let adder = builder.addFunction("adder", sig)
+    .addBody([kExprLocalGet, 0, kExprLocalGet, 1, kExprI32Add])
+    .exportFunc();
+
+  let tag = builder.addTag(makeSig([kWasmFuncRef, kWasmFuncRef], []));
+  builder.addExportOfKind("tag", kExternalTag, tag);
+
+  builder.addFunction("thrower", kSig_v_v)
+    .addBody([kExprRefNull, kFuncRefCode, kExprRefFunc, adder.index,
+              kExprThrow, tag])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  // Make sure objects thrown from Wasm and retrieved with getArg are correctly
+  // decoded as JS objects.
+  try { wasm.thrower() }
+  catch (e) {
+    assertEquals(null, e.getArg(wasm.tag, 0));
+    assertEquals(99, e.getArg(wasm.tag, 1)(44, 55));
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/exceptions-type-reflection.js b/deps/v8/test/mjsunit/wasm/exceptions-type-reflection.js
index 592a7b4ddcf691..e59eeddd5e93ec 100644
--- a/deps/v8/test/mjsunit/wasm/exceptions-type-reflection.js
+++ b/deps/v8/test/mjsunit/wasm/exceptions-type-reflection.js
@@ -47,3 +47,8 @@ let testcases = [
     assertEquals(instance.exports["ex" + i].type(), expected.types);
   })
 })();
+
+(function TestJSTag() {
+  print(arguments.callee.name);
+  assertEquals(WebAssembly.JSTag.type(), {parameters:['externref']});
+})();
diff --git a/deps/v8/test/mjsunit/wasm/exceptions.js b/deps/v8/test/mjsunit/wasm/exceptions.js
index 81ec333387062a..10ff4728b9c2f1 100644
--- a/deps/v8/test/mjsunit/wasm/exceptions.js
+++ b/deps/v8/test/mjsunit/wasm/exceptions.js
@@ -25,8 +25,10 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
   let instance = builder.instantiate();
 
   assertEquals(1, instance.exports.throw_if_param_not_zero(0));
-  assertWasmThrows(instance, except, [], () => instance.exports.throw_if_param_not_zero(10));
-  assertWasmThrows(instance, except, [], () => instance.exports.throw_if_param_not_zero(-1));
+  assertWasmThrows(instance, except, [],
+                   () => instance.exports.throw_if_param_not_zero(10));
+  assertWasmThrows(instance, except, [],
+                   () => instance.exports.throw_if_param_not_zero(-1));
 })();
 
 // Test that empty try/catch blocks work.
@@ -274,7 +276,8 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
 
   assertEquals(3, instance.exports.catch_complex(0));
   assertEquals(4, instance.exports.catch_complex(1));
-  assertWasmThrows(instance, except3, [], () => instance.exports.catch_complex(2));
+  assertWasmThrows(instance, except3, [],
+                   () => instance.exports.catch_complex(2));
 })();
 
 // Test that we can distinguish which exception was thrown by using a single
@@ -313,7 +316,8 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
 
   assertEquals(3, instance.exports.catch_complex(0));
   assertEquals(4, instance.exports.catch_complex(1));
-  assertWasmThrows(instance, except3, [], () => instance.exports.catch_complex(2));
+  assertWasmThrows(instance, except3, [],
+                   () => instance.exports.catch_complex(2));
 })();
 
 // Test throwing an exception with multiple values.
@@ -329,7 +333,8 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
       ]).exportFunc();
   let instance = builder.instantiate();
 
-  assertWasmThrows(instance, except, [0, 1, 0, 2], () => instance.exports.throw_1_2());
+  assertWasmThrows(instance, except, [0, 1, 0, 2],
+                   () => instance.exports.throw_1_2());
 })();
 
 // Test throwing/catching the i32 parameter value.
@@ -366,8 +371,10 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
       ]).exportFunc();
   let instance = builder.instantiate();
 
-  assertWasmThrows(instance, except, [0, 5], () => instance.exports.throw_param(5));
-  assertWasmThrows(instance, except, [6, 31026], () => instance.exports.throw_param(424242));
+  assertWasmThrows(instance, except, [0, 5],
+                   () => instance.exports.throw_param(5));
+  assertWasmThrows(instance, except, [6, 31026],
+                   () => instance.exports.throw_param(424242));
 })();
 
 // Test throwing/catching the f32 parameter value.
@@ -403,8 +410,10 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
       ]).exportFunc();
   let instance = builder.instantiate();
 
-  assertWasmThrows(instance, except, [16544, 0], () => instance.exports.throw_param(5.0));
-  assertWasmThrows(instance, except, [16680, 0], () => instance.exports.throw_param(10.5));
+  assertWasmThrows(instance, except, [16544, 0],
+                   () => instance.exports.throw_param(5.0));
+  assertWasmThrows(instance, except, [16680, 0],
+                   () => instance.exports.throw_param(10.5));
 })();
 
 // Test throwing/catching an I64 value
@@ -457,8 +466,10 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
       ]).exportFunc();
   let instance = builder.instantiate();
 
-  assertWasmThrows(instance, except, [0, 10, 0, 5], () => instance.exports.throw_param(10, 5));
-  assertWasmThrows(instance, except, [65535, 65535, 0, 13], () => instance.exports.throw_param(-1, 13));
+  assertWasmThrows(instance, except, [0, 10, 0, 5],
+                   () => instance.exports.throw_param(10, 5));
+  assertWasmThrows(instance, except, [65535, 65535, 0, 13],
+                   () => instance.exports.throw_param(-1, 13));
 })();
 
 // Test throwing/catching the F64 parameter value
@@ -495,8 +506,10 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
       ]).exportFunc();
   let instance = builder.instantiate();
 
-  assertWasmThrows(instance, except, [16404, 0, 0, 0], () => instance.exports.throw_param(5.0));
-  assertWasmThrows(instance, except, [16739, 4816, 0, 0], () => instance.exports.throw_param(10000000.5));
+  assertWasmThrows(instance, except, [16404, 0, 0, 0],
+                   () => instance.exports.throw_param(5.0));
+  assertWasmThrows(instance, except, [16739, 4816, 0, 0],
+                   () => instance.exports.throw_param(10000000.5));
 })();
 
 // Test the encoding of a computed parameter value.
@@ -521,8 +534,10 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
       ]).exportFunc()
   let instance = builder.instantiate();
 
-  assertWasmThrows(instance, except, [65535, 65536-8], () => instance.exports.throw_expr_with_params(1.5, 2.5, 4));
-  assertWasmThrows(instance, except, [0, 12], () => instance.exports.throw_expr_with_params(5.7, 2.5, 4));
+  assertWasmThrows(instance, except, [65535, 65536-8],
+                   () => instance.exports.throw_expr_with_params(1.5, 2.5, 4));
+  assertWasmThrows(instance, except, [0, 12],
+                   () => instance.exports.throw_expr_with_params(5.7, 2.5, 4));
 })();
 
 // Now that we know catching works locally, we test catching exceptions that
@@ -1071,7 +1086,8 @@ d8.file.execute("test/mjsunit/wasm/exceptions-utils.js");
 
   let instance = builder.instantiate();
   assertDoesNotThrow(() => instance.exports.catchless_try(0));
-  assertWasmThrows(instance, except, [], () => instance.exports.catchless_try(1));
+  assertWasmThrows(instance, except, [],
+                   () => instance.exports.catchless_try(1));
 })();
 
 // Delegate to a regular block inside a try block.
diff --git a/deps/v8/test/mjsunit/wasm/externref-globals.js b/deps/v8/test/mjsunit/wasm/externref-globals.js
index ec144c90ea244b..926615ad258918 100644
--- a/deps/v8/test/mjsunit/wasm/externref-globals.js
+++ b/deps/v8/test/mjsunit/wasm/externref-globals.js
@@ -196,8 +196,8 @@ function dummy_func() {
 (function TestExternRefGlobalObjectDefaultValue() {
   print(arguments.callee.name);
   let default_init = new WebAssembly.Global({ value: 'externref', mutable: true });
-  assertSame(null, default_init.value);
-  assertSame(null, default_init.valueOf());
+  assertSame(undefined, default_init.value);
+  assertSame(undefined, default_init.valueOf());
 })();
 
 (function TestAnyFuncGlobalObjectDefaultValue() {
diff --git a/deps/v8/test/mjsunit/wasm/ffi-error.js b/deps/v8/test/mjsunit/wasm/ffi-error.js
index 82694c8bfb780d..218c7a84e973df 100644
--- a/deps/v8/test/mjsunit/wasm/ffi-error.js
+++ b/deps/v8/test/mjsunit/wasm/ffi-error.js
@@ -56,16 +56,16 @@ function checkFailingInstantiation(
       'Argument 1 must be an object');
   checkFailingInstantiation(
       CreateDefaultBuilder(), {}, TypeError,
-      'Import #0 module="mod" error: module is not an object or function');
+      'Import #0 module="mod": module is not an object or function');
   checkFailingInstantiation(
       CreateDefaultBuilder(), {mod: {}}, WebAssembly.LinkError,
-      'Import #0 module="mod" function="fun" error: function import requires a callable');
+      'Import #0 module="mod" function="fun": function import requires a callable');
   checkFailingInstantiation(
       CreateDefaultBuilder(), {mod: {fun: {}}}, WebAssembly.LinkError,
-      'Import #0 module="mod" function="fun" error: function import requires a callable');
+      'Import #0 module="mod" function="fun": function import requires a callable');
   checkFailingInstantiation(
       CreateDefaultBuilder(), {mod: {fun: 0}}, WebAssembly.LinkError,
-      'Import #0 module="mod" function="fun" error: function import requires a callable');
+      'Import #0 module="mod" function="fun": function import requires a callable');
 })();
 
 (function testImportWithInvalidSignature() {
@@ -84,7 +84,7 @@ function checkFailingInstantiation(
   let exported = builder.instantiate().exports.exp;
   checkFailingInstantiation(
       CreateDefaultBuilder(), {mod: {fun: exported}}, WebAssembly.LinkError,
-      'Import #0 module="mod" function="fun" error: imported function does not match the expected type');
+      'Import #0 module="mod" function="fun": imported function does not match the expected type');
 })();
 
 (function regression870646() {
@@ -123,7 +123,7 @@ function checkFailingInstantiation(
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
   builder.addFunction('function_with_invalid_signature', kSig_l_ll)
     .addBody([           // --
       kExprLocalGet, 0,  // --
@@ -141,7 +141,7 @@ function checkFailingInstantiation(
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
   builder.addFunction('function_with_invalid_signature', kSig_i_l)
       .addBody([kExprLocalGet, 0, kExprI32ConvertI64])
       .exportFunc();
diff --git a/deps/v8/test/mjsunit/wasm/futex.js b/deps/v8/test/mjsunit/wasm/futex.js
index d6db029bfbe6f3..4d7f6740887121 100644
--- a/deps/v8/test/mjsunit/wasm/futex.js
+++ b/deps/v8/test/mjsunit/wasm/futex.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --allow-natives-syntax --harmony-sharedarraybuffer
+// Flags: --allow-natives-syntax
 
 'use strict';
 
@@ -155,7 +155,9 @@ function WasmI64AtomicWait(memory, offset, index, val_low,
   let memory = new WebAssembly.Memory({initial: 1, maximum: 1, shared: true});
   var waitMs = 100;
   var startTime = new Date();
-  assertEquals(2, WasmI32AtomicWait(memory, 0, 0, 0, waitMs*1000000));
+  assertEquals(
+      kAtomicWaitTimedOut,
+      WasmI32AtomicWait(memory, 0, 0, 0, waitMs * 1000000));
   var endTime = new Date();
   assertTrue(endTime - startTime >= waitMs);
 })();
@@ -165,7 +167,9 @@ function WasmI64AtomicWait(memory, offset, index, val_low,
   let memory = new WebAssembly.Memory({initial: 1, maximum: 1, shared: true});
   var waitMs = 100;
   var startTime = new Date();
-  assertEquals(2, WasmI64AtomicWait(memory, 0, 0, 0, 0, waitMs*1000000));
+  assertEquals(
+      kAtomicWaitTimedOut,
+      WasmI64AtomicWait(memory, 0, 0, 0, 0, waitMs * 1000000));
   var endTime = new Date();
   assertTrue(endTime - startTime >= waitMs);
 })();
@@ -173,28 +177,28 @@ function WasmI64AtomicWait(memory, offset, index, val_low,
 (function TestI32WaitNotEqual() {
   if (!%IsAtomicsWaitAllowed()) return;
   let memory = new WebAssembly.Memory({initial: 1, maximum: 1, shared: true});
-  assertEquals(1, WasmI32AtomicWait(memory, 0, 0, 42, -1));
+  assertEquals(kAtomicWaitNotEqual, WasmI32AtomicWait(memory, 0, 0, 42, -1));
 
-  assertEquals(2, WasmI32AtomicWait(memory, 0, 0, 0, 0));
+  assertEquals(kAtomicWaitTimedOut, WasmI32AtomicWait(memory, 0, 0, 0, 0));
 
   let i32a = new Int32Array(memory.buffer);
   i32a[0] = 1;
-  assertEquals(1, WasmI32AtomicWait(memory, 0, 0, 0, -1));
-  assertEquals(2, WasmI32AtomicWait(memory, 0, 0, 1, 0));
+  assertEquals(kAtomicWaitNotEqual, WasmI32AtomicWait(memory, 0, 0, 0, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI32AtomicWait(memory, 0, 0, 1, 0));
 })();
 
 (function TestI64WaitNotEqual() {
   if (!%IsAtomicsWaitAllowed()) return;
   let memory = new WebAssembly.Memory({initial: 1, maximum: 1, shared: true});
-  assertEquals(1, WasmI64AtomicWait(memory, 0, 0, 42, 0, -1));
+  assertEquals(kAtomicWaitNotEqual, WasmI64AtomicWait(memory, 0, 0, 42, 0, -1));
 
-  assertEquals(2, WasmI64AtomicWait(memory, 0, 0, 0, 0, 0));
+  assertEquals(kAtomicWaitTimedOut, WasmI64AtomicWait(memory, 0, 0, 0, 0, 0));
 
   let i32a = new Int32Array(memory.buffer);
   i32a[0] = 1;
   i32a[1] = 2;
-  assertEquals(1, WasmI64AtomicWait(memory, 0, 0, 0, 0, -1));
-  assertEquals(2, WasmI64AtomicWait(memory, 0, 0, 1, 2, 0));
+  assertEquals(kAtomicWaitNotEqual, WasmI64AtomicWait(memory, 0, 0, 0, 0, -1));
+  assertEquals(kAtomicWaitTimedOut, WasmI64AtomicWait(memory, 0, 0, 1, 2, 0));
 })();
 
 (function TestWakeCounts() {
@@ -327,21 +331,21 @@ if (this.Worker) {
   wasmWakeCheck(8, numWorkers + 1, workers, "ok");
   wasmWakeCheck(16, numWorkers - 1, workers, "ok");
 
-  jsWakeCheck(24, numWorkers, workers, 0);
-  jsWakeCheck(32, numWorkers + 1, workers, 0);
-  jsWakeCheck(40, numWorkers - 1, workers, 0);
+  jsWakeCheck(24, numWorkers, workers, kAtomicWaitOk);
+  jsWakeCheck(32, numWorkers + 1, workers, kAtomicWaitOk);
+  jsWakeCheck(40, numWorkers - 1, workers, kAtomicWaitOk);
 
-  wasmWakeCheck(48, numWorkers, workers, 0);
-  wasmWakeCheck(56, numWorkers + 1, workers, 0);
-  wasmWakeCheck(64, numWorkers - 1, workers, 0);
+  wasmWakeCheck(48, numWorkers, workers, kAtomicWaitOk);
+  wasmWakeCheck(56, numWorkers + 1, workers, kAtomicWaitOk);
+  wasmWakeCheck(64, numWorkers - 1, workers, kAtomicWaitOk);
 
-  jsWakeCheck(72, numWorkers, workers, 0);
-  jsWakeCheck(80, numWorkers + 1, workers, 0);
-  jsWakeCheck(88, numWorkers - 1, workers, 0);
+  jsWakeCheck(72, numWorkers, workers, kAtomicWaitOk);
+  jsWakeCheck(80, numWorkers + 1, workers, kAtomicWaitOk);
+  jsWakeCheck(88, numWorkers - 1, workers, kAtomicWaitOk);
 
-  wasmWakeCheck(96, numWorkers, workers, 0);
-  wasmWakeCheck(104, numWorkers + 1, workers, 0);
-  wasmWakeCheck(112, numWorkers - 1, workers, 0);
+  wasmWakeCheck(96, numWorkers, workers, kAtomicWaitOk);
+  wasmWakeCheck(104, numWorkers + 1, workers, kAtomicWaitOk);
+  wasmWakeCheck(112, numWorkers - 1, workers, kAtomicWaitOk);
 
   for (let id = 0; id < numWorkers; id++) {
     workers[id].terminate();
diff --git a/deps/v8/test/mjsunit/wasm/gc-casts-from-any.js b/deps/v8/test/mjsunit/wasm/gc-casts-from-any.js
index 5f3ea7372157e0..4f80796307b242 100644
--- a/deps/v8/test/mjsunit/wasm/gc-casts-from-any.js
+++ b/deps/v8/test/mjsunit/wasm/gc-casts-from-any.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --experimental-wasm-gc
+// Flags: --experimental-wasm-gc --experimental-wasm-stringref
 
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
@@ -47,6 +47,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
     ["AnyArray", kArrayRefCode],
     ["Struct", kStructRefCode],
     ["Eq", kEqRefCode],
+    ["String", kStringRefCode],
     // 'ref.test any' is semantically the same as '!ref.is_null' here.
     ["Any", kAnyRefCode],
     ["None", kNullRefCode]
@@ -136,6 +137,63 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
       kExprI32Const, 1,
       kExprReturn,
     ]).exportFunc();
+
+    builder.addFunction(`brOnCastGeneric${typeName}`,
+                        makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprBlock, kWasmRef, typeCode,
+        kExprLocalGet, 0,
+        kGCPrefix, kExprExternInternalize,
+        kGCPrefix, kExprBrOnCastGeneric, 0b01, 0, kAnyRefCode, typeCode,
+        kExprI32Const, 0,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprI32Const, 1,
+      kExprReturn,
+    ]).exportFunc();
+    builder.addFunction(`brOnCastGenericNull${typeName}`,
+                        makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprBlock, kWasmRefNull, typeCode,
+        kExprLocalGet, 0,
+        kGCPrefix, kExprExternInternalize,
+        kGCPrefix, kExprBrOnCastGeneric, 0b11, 0, kAnyRefCode, typeCode,
+        kExprI32Const, 0,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprI32Const, 1,
+      kExprReturn,
+    ]).exportFunc();
+    builder.addFunction(`brOnCastGenericFail${typeName}`,
+                        makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprBlock, kAnyRefCode,
+        kExprLocalGet, 0,
+        kGCPrefix, kExprExternInternalize,
+        kGCPrefix, kExprBrOnCastFailGeneric, 0b01, 0, kAnyRefCode, typeCode,
+        kExprI32Const, 0,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprI32Const, 1,
+      kExprReturn,
+    ]).exportFunc();
+    builder.addFunction(`brOnCastGenericFailNull${typeName}`,
+                        makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprBlock, kAnyRefCode,
+        kExprLocalGet, 0,
+        kGCPrefix, kExprExternInternalize,
+        kGCPrefix, kExprBrOnCastFailGeneric, 0b11, 0, kAnyRefCode, typeCode,
+        kExprI32Const, 0,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprI32Const, 1,
+      kExprReturn,
+    ]).exportFunc();
   });
 
   var instance = builder.instantiate();
@@ -149,6 +207,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([0, 0], wasm.refTestStructSuper(wasm.createFuncRef()));
   assertEquals([0, 0], wasm.refTestStructSuper(1));
   assertEquals([0, 0], wasm.refTestStructSuper({'JavaScript': 'Object'}));
+  assertEquals([0, 0], wasm.refTestStructSuper('string'));
 
   assertEquals([0, 1], wasm.refTestStructSub(null));
   assertEquals([0, 0], wasm.refTestStructSub(undefined));
@@ -158,6 +217,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([0, 0], wasm.refTestStructSub(wasm.createFuncRef()));
   assertEquals([0, 0], wasm.refTestStructSub(1));
   assertEquals([0, 0], wasm.refTestStructSub({'JavaScript': 'Object'}));
+  assertEquals([0, 0], wasm.refTestStructSub('string'));
 
   assertEquals([0, 1], wasm.refTestArray(null));
   assertEquals([0, 0], wasm.refTestArray(undefined));
@@ -167,6 +227,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([0, 0], wasm.refTestArray(wasm.createFuncRef()));
   assertEquals([0, 0], wasm.refTestArray(1));
   assertEquals([0, 0], wasm.refTestArray({'JavaScript': 'Object'}));
+  assertEquals([0, 0], wasm.refTestArray('string'));
 
   assertEquals([0, 1], wasm.refTestI31(null));
   assertEquals([0, 0], wasm.refTestI31(undefined));
@@ -176,6 +237,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([0, 0], wasm.refTestI31(wasm.createFuncRef()));
   assertEquals([1, 1], wasm.refTestI31(1));
   assertEquals([0, 0], wasm.refTestI31({'JavaScript': 'Object'}));
+  assertEquals([0, 0], wasm.refTestI31('string'));
 
   assertEquals([0, 1], wasm.refTestAnyArray(null));
   assertEquals([0, 0], wasm.refTestAnyArray(undefined));
@@ -185,6 +247,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([0, 0], wasm.refTestAnyArray(wasm.createFuncRef()));
   assertEquals([0, 0], wasm.refTestAnyArray(1));
   assertEquals([0, 0], wasm.refTestAnyArray({'JavaScript': 'Object'}));
+  assertEquals([0, 0], wasm.refTestAnyArray('string'));
 
   assertEquals([0, 1], wasm.refTestStruct(null));
   assertEquals([0, 0], wasm.refTestStruct(undefined));
@@ -194,6 +257,17 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([0, 0], wasm.refTestStruct(wasm.createFuncRef()));
   assertEquals([0, 0], wasm.refTestStruct(1));
   assertEquals([0, 0], wasm.refTestStruct({'JavaScript': 'Object'}));
+  assertEquals([0, 0], wasm.refTestStruct('string'));
+
+  assertEquals([0, 1], wasm.refTestString(null));
+  assertEquals([0, 0], wasm.refTestString(undefined));
+  assertEquals([0, 0], wasm.refTestString(wasm.createStructSuper()));
+  assertEquals([0, 0], wasm.refTestString(wasm.createStructSub()));
+  assertEquals([0, 0], wasm.refTestString(wasm.createArray()));
+  assertEquals([0, 0], wasm.refTestString(wasm.createFuncRef()));
+  assertEquals([0, 0], wasm.refTestString(1));
+  assertEquals([0, 0], wasm.refTestString({'JavaScript': 'Object'}));
+  assertEquals([1, 1], wasm.refTestString('string'));
 
   assertEquals([0, 1], wasm.refTestEq(null));
   assertEquals([0, 0], wasm.refTestEq(undefined));
@@ -203,6 +277,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([0, 0], wasm.refTestEq(wasm.createFuncRef()));
   assertEquals([1, 1], wasm.refTestEq(1)); // ref.i31
   assertEquals([0, 0], wasm.refTestEq({'JavaScript': 'Object'}));
+  assertEquals([0, 0], wasm.refTestEq('string'));
 
   assertEquals([0, 1], wasm.refTestAny(null));
   assertEquals([1, 1], wasm.refTestAny(undefined));
@@ -212,6 +287,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([1, 1], wasm.refTestAny(wasm.createFuncRef()));
   assertEquals([1, 1], wasm.refTestAny(1)); // ref.i31
   assertEquals([1, 1], wasm.refTestAny({'JavaScript': 'Object'}));
+  assertEquals([1, 1], wasm.refTestAny('string'));
 
   assertEquals([0, 1], wasm.refTestNone(null));
   assertEquals([0, 0], wasm.refTestNone(undefined));
@@ -221,12 +297,14 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals([0, 0], wasm.refTestNone(wasm.createFuncRef()));
   assertEquals([0, 0], wasm.refTestNone(1)); // ref.i31
   assertEquals([0, 0], wasm.refTestNone({'JavaScript': 'Object'}));
+  assertEquals([0, 0], wasm.refTestNone('string'));
 
   // ref.cast
   let structSuperObj = wasm.createStructSuper();
   let structSubObj = wasm.createStructSub();
   let arrayObj = wasm.createArray();
   let jsObj = {'JavaScript': 'Object'};
+  let strObj = 'string';
   let funcObj = wasm.createFuncRef();
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSuper(null));
@@ -237,6 +315,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSuper(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSuper(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSuper(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastStructSuper(strObj));
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSub(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSub(undefined));
@@ -246,6 +325,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSub(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSub(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastStructSub(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastStructSub(strObj));
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastArray(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastArray(undefined));
@@ -255,6 +335,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastArray(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastArray(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastArray(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastArray(strObj));
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastI31(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastI31(undefined));
@@ -264,6 +345,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastI31(funcObj));
   assertEquals(1, wasm.refCastI31(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastI31(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastI31(strObj));
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastAnyArray(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastAnyArray(undefined));
@@ -273,6 +355,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastAnyArray(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastAnyArray(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastAnyArray(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastAnyArray(strObj));
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastStruct(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastStruct(undefined));
@@ -282,6 +365,17 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastStruct(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastStruct(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastStruct(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastStruct(strObj));
+
+  assertTraps(kTrapIllegalCast, () => wasm.refCastString(null));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastString(undefined));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastString(structSuperObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastString(structSubObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastString(arrayObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastString(funcObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastString(1));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastString(jsObj));
+  assertSame(strObj, wasm.refCastString(strObj));
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastEq(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastEq(undefined));
@@ -291,6 +385,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastEq(funcObj));
   assertEquals(1, wasm.refCastEq(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastEq(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastEq(strObj));
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastAny(null));
   assertSame(undefined, wasm.refCastAny(undefined));
@@ -300,6 +395,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertSame(funcObj, wasm.refCastAny(funcObj));
   assertEquals(1, wasm.refCastAny(1));
   assertSame(jsObj, wasm.refCastAny(jsObj));
+  assertSame(strObj, wasm.refCastAny(strObj));
 
   assertTraps(kTrapIllegalCast, () => wasm.refCastNone(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNone(undefined));
@@ -309,6 +405,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNone(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNone(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNone(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNone(strObj));
 
   // ref.cast null
   assertSame(null, wasm.refCastNullStructSuper(null));
@@ -319,6 +416,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSuper(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSuper(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSuper(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSuper(strObj));
 
   assertSame(null, wasm.refCastNullStructSub(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSub(undefined));
@@ -328,6 +426,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSub(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSub(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSub(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullStructSub(strObj));
 
   assertSame(null, wasm.refCastNullArray(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullArray(undefined));
@@ -337,6 +436,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullArray(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullArray(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullArray(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullArray(strObj));
 
   assertSame(null, wasm.refCastNullI31(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullI31(undefined));
@@ -346,6 +446,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullI31(funcObj));
   assertEquals(1, wasm.refCastNullI31(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullI31(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullI31(strObj));
 
   assertSame(null, wasm.refCastNullAnyArray(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullAnyArray(undefined));
@@ -355,6 +456,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullAnyArray(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullAnyArray(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullAnyArray(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullAnyArray(strObj));
 
   assertSame(null, wasm.refCastNullStruct(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStruct(undefined));
@@ -364,6 +466,17 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStruct(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStruct(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullStruct(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullStruct(strObj));
+
+  assertSame(null, wasm.refCastNullString(null));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullString(undefined));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullString(structSuperObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullString(structSubObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullString(arrayObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullString(funcObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullString(1));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullString(jsObj));
+  assertSame(strObj, wasm.refCastNullString(strObj));
 
   assertSame(null, wasm.refCastNullEq(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullEq(undefined));
@@ -373,6 +486,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullEq(funcObj));
   assertEquals(1, wasm.refCastNullEq(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullEq(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullEq(strObj));
 
   assertSame(null, wasm.refCastNullAny(null));
   assertSame(undefined, wasm.refCastNullAny(undefined));
@@ -382,6 +496,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertSame(funcObj, wasm.refCastNullAny(funcObj));
   assertEquals(1, wasm.refCastNullAny(1));
   assertSame(jsObj, wasm.refCastNullAny(jsObj));
+  assertSame(strObj, wasm.refCastNullAny(strObj));
 
   assertSame(null, wasm.refCastNullNone(null));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullNone(undefined));
@@ -391,6 +506,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullNone(funcObj));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullNone(1));
   assertTraps(kTrapIllegalCast, () => wasm.refCastNullNone(jsObj));
+  assertTraps(kTrapIllegalCast, () => wasm.refCastNullNone(strObj));
 
   // br_on_cast
   assertEquals(0, wasm.brOnCastStructSuper(null));
@@ -401,6 +517,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastStructSuper(funcObj));
   assertEquals(0, wasm.brOnCastStructSuper(1));
   assertEquals(0, wasm.brOnCastStructSuper(jsObj));
+  assertEquals(0, wasm.brOnCastStructSuper(strObj));
 
   assertEquals(0, wasm.brOnCastStructSub(null));
   assertEquals(0, wasm.brOnCastStructSub(undefined));
@@ -410,6 +527,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastStructSub(funcObj));
   assertEquals(0, wasm.brOnCastStructSub(1));
   assertEquals(0, wasm.brOnCastStructSub(jsObj));
+  assertEquals(0, wasm.brOnCastStructSub(strObj));
 
   assertEquals(0, wasm.brOnCastArray(null));
   assertEquals(0, wasm.brOnCastArray(undefined));
@@ -419,6 +537,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastArray(funcObj));
   assertEquals(0, wasm.brOnCastArray(1));
   assertEquals(0, wasm.brOnCastArray(jsObj));
+  assertEquals(0, wasm.brOnCastArray(strObj));
 
   assertEquals(0, wasm.brOnCastI31(null));
   assertEquals(0, wasm.brOnCastI31(undefined));
@@ -428,6 +547,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastI31(funcObj));
   assertEquals(1, wasm.brOnCastI31(1));
   assertEquals(0, wasm.brOnCastI31(jsObj));
+  assertEquals(0, wasm.brOnCastI31(strObj));
 
   assertEquals(0, wasm.brOnCastAnyArray(null));
   assertEquals(0, wasm.brOnCastAnyArray(undefined));
@@ -437,6 +557,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastAnyArray(funcObj));
   assertEquals(0, wasm.brOnCastAnyArray(1));
   assertEquals(0, wasm.brOnCastAnyArray(jsObj));
+  assertEquals(0, wasm.brOnCastAnyArray(strObj));
 
   assertEquals(0, wasm.brOnCastStruct(null));
   assertEquals(0, wasm.brOnCastStruct(undefined));
@@ -446,6 +567,17 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastStruct(funcObj));
   assertEquals(0, wasm.brOnCastStruct(1));
   assertEquals(0, wasm.brOnCastStruct(jsObj));
+  assertEquals(0, wasm.brOnCastStruct(strObj));
+
+  assertEquals(0, wasm.brOnCastString(null));
+  assertEquals(0, wasm.brOnCastString(undefined));
+  assertEquals(0, wasm.brOnCastString(structSuperObj));
+  assertEquals(0, wasm.brOnCastString(structSubObj));
+  assertEquals(0, wasm.brOnCastString(arrayObj));
+  assertEquals(0, wasm.brOnCastString(funcObj));
+  assertEquals(0, wasm.brOnCastString(1));
+  assertEquals(0, wasm.brOnCastString(jsObj));
+  assertEquals(1, wasm.brOnCastString(strObj));
 
   assertEquals(0, wasm.brOnCastEq(null));
   assertEquals(0, wasm.brOnCastEq(undefined));
@@ -455,6 +587,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastEq(funcObj));
   assertEquals(1, wasm.brOnCastEq(1));
   assertEquals(0, wasm.brOnCastEq(jsObj));
+  assertEquals(0, wasm.brOnCastEq(strObj));
 
   assertEquals(0, wasm.brOnCastAny(null));
   assertEquals(1, wasm.brOnCastAny(undefined));
@@ -464,6 +597,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastAny(funcObj));
   assertEquals(1, wasm.brOnCastAny(1));
   assertEquals(1, wasm.brOnCastAny(jsObj));
+  assertEquals(1, wasm.brOnCastAny(strObj));
 
   assertEquals(0, wasm.brOnCastNone(null));
   assertEquals(0, wasm.brOnCastNone(undefined));
@@ -473,6 +607,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNone(funcObj));
   assertEquals(0, wasm.brOnCastNone(1));
   assertEquals(0, wasm.brOnCastNone(jsObj));
+  assertEquals(0, wasm.brOnCastNone(strObj));
 
   // br_on_cast null
   assertEquals(1, wasm.brOnCastNullStructSuper(null));
@@ -483,6 +618,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNullStructSuper(funcObj));
   assertEquals(0, wasm.brOnCastNullStructSuper(1));
   assertEquals(0, wasm.brOnCastNullStructSuper(jsObj));
+  assertEquals(0, wasm.brOnCastNullStructSuper(strObj));
 
   assertEquals(1, wasm.brOnCastNullStructSub(null));
   assertEquals(0, wasm.brOnCastNullStructSub(undefined));
@@ -492,6 +628,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNullStructSub(funcObj));
   assertEquals(0, wasm.brOnCastNullStructSub(1));
   assertEquals(0, wasm.brOnCastNullStructSub(jsObj));
+  assertEquals(0, wasm.brOnCastNullStructSub(strObj));
 
   assertEquals(1, wasm.brOnCastNullArray(null));
   assertEquals(0, wasm.brOnCastNullArray(undefined));
@@ -501,6 +638,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNullArray(funcObj));
   assertEquals(0, wasm.brOnCastNullArray(1));
   assertEquals(0, wasm.brOnCastNullArray(jsObj));
+  assertEquals(0, wasm.brOnCastNullArray(strObj));
 
   assertEquals(1, wasm.brOnCastNullI31(null));
   assertEquals(0, wasm.brOnCastNullI31(undefined));
@@ -510,6 +648,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNullI31(funcObj));
   assertEquals(1, wasm.brOnCastNullI31(1));
   assertEquals(0, wasm.brOnCastNullI31(jsObj));
+  assertEquals(0, wasm.brOnCastNullI31(strObj));
 
   assertEquals(1, wasm.brOnCastNullAnyArray(null));
   assertEquals(0, wasm.brOnCastNullAnyArray(undefined));
@@ -519,6 +658,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNullAnyArray(funcObj));
   assertEquals(0, wasm.brOnCastNullAnyArray(1));
   assertEquals(0, wasm.brOnCastNullAnyArray(jsObj));
+  assertEquals(0, wasm.brOnCastNullAnyArray(strObj));
 
   assertEquals(1, wasm.brOnCastNullStruct(null));
   assertEquals(0, wasm.brOnCastNullStruct(undefined));
@@ -528,6 +668,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNullStruct(funcObj));
   assertEquals(0, wasm.brOnCastNullStruct(1));
   assertEquals(0, wasm.brOnCastNullStruct(jsObj));
+  assertEquals(0, wasm.brOnCastNullStruct(strObj));
 
   assertEquals(1, wasm.brOnCastNullEq(null));
   assertEquals(0, wasm.brOnCastNullEq(undefined));
@@ -537,6 +678,17 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNullEq(funcObj));
   assertEquals(1, wasm.brOnCastNullEq(1));
   assertEquals(0, wasm.brOnCastNullEq(jsObj));
+  assertEquals(0, wasm.brOnCastNullEq(strObj));
+
+  assertEquals(1, wasm.brOnCastNullString(null));
+  assertEquals(0, wasm.brOnCastNullString(undefined));
+  assertEquals(0, wasm.brOnCastNullString(structSuperObj));
+  assertEquals(0, wasm.brOnCastNullString(structSubObj));
+  assertEquals(0, wasm.brOnCastNullString(arrayObj));
+  assertEquals(0, wasm.brOnCastNullString(funcObj));
+  assertEquals(0, wasm.brOnCastNullString(1));
+  assertEquals(0, wasm.brOnCastNullString(jsObj));
+  assertEquals(1, wasm.brOnCastNullString(strObj));
 
   assertEquals(1, wasm.brOnCastNullAny(null));
   assertEquals(1, wasm.brOnCastNullAny(undefined));
@@ -546,6 +698,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastNullAny(funcObj));
   assertEquals(1, wasm.brOnCastNullAny(1));
   assertEquals(1, wasm.brOnCastNullAny(jsObj));
+  assertEquals(1, wasm.brOnCastNullAny(strObj));
 
   assertEquals(1, wasm.brOnCastNullNone(null));
   assertEquals(0, wasm.brOnCastNullNone(undefined));
@@ -555,6 +708,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastNullNone(funcObj));
   assertEquals(0, wasm.brOnCastNullNone(1));
   assertEquals(0, wasm.brOnCastNullNone(jsObj));
+  assertEquals(0, wasm.brOnCastNullNone(strObj));
 
   // br_on_cast_fail
   assertEquals(1, wasm.brOnCastFailStructSuper(null));
@@ -565,6 +719,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailStructSuper(funcObj));
   assertEquals(1, wasm.brOnCastFailStructSuper(1));
   assertEquals(1, wasm.brOnCastFailStructSuper(jsObj));
+  assertEquals(1, wasm.brOnCastFailStructSuper(strObj));
 
   assertEquals(1, wasm.brOnCastFailStructSub(null));
   assertEquals(1, wasm.brOnCastFailStructSub(undefined));
@@ -574,6 +729,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailStructSub(funcObj));
   assertEquals(1, wasm.brOnCastFailStructSub(1));
   assertEquals(1, wasm.brOnCastFailStructSub(jsObj));
+  assertEquals(1, wasm.brOnCastFailStructSub(strObj));
 
   assertEquals(1, wasm.brOnCastFailArray(null));
   assertEquals(1, wasm.brOnCastFailArray(undefined));
@@ -583,6 +739,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailArray(funcObj));
   assertEquals(1, wasm.brOnCastFailArray(1));
   assertEquals(1, wasm.brOnCastFailArray(jsObj));
+  assertEquals(1, wasm.brOnCastFailArray(strObj));
 
   assertEquals(1, wasm.brOnCastFailI31(null));
   assertEquals(1, wasm.brOnCastFailI31(undefined));
@@ -592,6 +749,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailI31(funcObj));
   assertEquals(0, wasm.brOnCastFailI31(1));
   assertEquals(1, wasm.brOnCastFailI31(jsObj));
+  assertEquals(1, wasm.brOnCastFailI31(strObj));
 
   assertEquals(1, wasm.brOnCastFailAnyArray(null));
   assertEquals(1, wasm.brOnCastFailAnyArray(undefined));
@@ -601,6 +759,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailAnyArray(funcObj));
   assertEquals(1, wasm.brOnCastFailAnyArray(1));
   assertEquals(1, wasm.brOnCastFailAnyArray(jsObj));
+  assertEquals(1, wasm.brOnCastFailAnyArray(strObj));
 
   assertEquals(1, wasm.brOnCastFailStruct(null));
   assertEquals(1, wasm.brOnCastFailStruct(undefined));
@@ -610,6 +769,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailStruct(funcObj));
   assertEquals(1, wasm.brOnCastFailStruct(1));
   assertEquals(1, wasm.brOnCastFailStruct(jsObj));
+  assertEquals(1, wasm.brOnCastFailStruct(strObj));
 
   assertEquals(1, wasm.brOnCastFailEq(null));
   assertEquals(1, wasm.brOnCastFailEq(undefined));
@@ -619,6 +779,17 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailEq(funcObj));
   assertEquals(0, wasm.brOnCastFailEq(1));
   assertEquals(1, wasm.brOnCastFailEq(jsObj));
+  assertEquals(1, wasm.brOnCastFailEq(strObj));
+
+  assertEquals(1, wasm.brOnCastFailString(null));
+  assertEquals(1, wasm.brOnCastFailString(undefined));
+  assertEquals(1, wasm.brOnCastFailString(structSuperObj));
+  assertEquals(1, wasm.brOnCastFailString(structSubObj));
+  assertEquals(1, wasm.brOnCastFailString(arrayObj));
+  assertEquals(1, wasm.brOnCastFailString(funcObj));
+  assertEquals(1, wasm.brOnCastFailString(1));
+  assertEquals(1, wasm.brOnCastFailString(jsObj));
+  assertEquals(0, wasm.brOnCastFailString(strObj));
 
   assertEquals(1, wasm.brOnCastFailAny(null));
   assertEquals(0, wasm.brOnCastFailAny(undefined));
@@ -628,6 +799,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastFailAny(funcObj));
   assertEquals(0, wasm.brOnCastFailAny(1));
   assertEquals(0, wasm.brOnCastFailAny(jsObj));
+  assertEquals(0, wasm.brOnCastFailAny(strObj));
 
   assertEquals(1, wasm.brOnCastFailNone(null));
   assertEquals(1, wasm.brOnCastFailNone(undefined));
@@ -637,6 +809,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNone(funcObj));
   assertEquals(1, wasm.brOnCastFailNone(1));
   assertEquals(1, wasm.brOnCastFailNone(jsObj));
+  assertEquals(1, wasm.brOnCastFailNone(strObj));
 
   // br_on_cast_fail null
   assertEquals(0, wasm.brOnCastFailNullStructSuper(null));
@@ -647,6 +820,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNullStructSuper(funcObj));
   assertEquals(1, wasm.brOnCastFailNullStructSuper(1));
   assertEquals(1, wasm.brOnCastFailNullStructSuper(jsObj));
+  assertEquals(1, wasm.brOnCastFailNullStructSuper(strObj));
 
   assertEquals(0, wasm.brOnCastFailNullStructSub(null));
   assertEquals(1, wasm.brOnCastFailNullStructSub(undefined));
@@ -656,6 +830,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNullStructSub(funcObj));
   assertEquals(1, wasm.brOnCastFailNullStructSub(1));
   assertEquals(1, wasm.brOnCastFailNullStructSub(jsObj));
+  assertEquals(1, wasm.brOnCastFailNullStructSub(strObj));
 
   assertEquals(0, wasm.brOnCastFailNullArray(null));
   assertEquals(1, wasm.brOnCastFailNullArray(undefined));
@@ -665,6 +840,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNullArray(funcObj));
   assertEquals(1, wasm.brOnCastFailNullArray(1));
   assertEquals(1, wasm.brOnCastFailNullArray(jsObj));
+  assertEquals(1, wasm.brOnCastFailNullArray(strObj));
 
   assertEquals(0, wasm.brOnCastFailNullI31(null));
   assertEquals(1, wasm.brOnCastFailNullI31(undefined));
@@ -674,6 +850,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNullI31(funcObj));
   assertEquals(0, wasm.brOnCastFailNullI31(1));
   assertEquals(1, wasm.brOnCastFailNullI31(jsObj));
+  assertEquals(1, wasm.brOnCastFailNullI31(strObj));
 
   assertEquals(0, wasm.brOnCastFailNullAnyArray(null));
   assertEquals(1, wasm.brOnCastFailNullAnyArray(undefined));
@@ -683,6 +860,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNullAnyArray(funcObj));
   assertEquals(1, wasm.brOnCastFailNullAnyArray(1));
   assertEquals(1, wasm.brOnCastFailNullAnyArray(jsObj));
+  assertEquals(1, wasm.brOnCastFailNullAnyArray(strObj));
 
   assertEquals(0, wasm.brOnCastFailNullStruct(null));
   assertEquals(1, wasm.brOnCastFailNullStruct(undefined));
@@ -692,6 +870,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNullStruct(funcObj));
   assertEquals(1, wasm.brOnCastFailNullStruct(1));
   assertEquals(1, wasm.brOnCastFailNullStruct(jsObj));
+  assertEquals(1, wasm.brOnCastFailNullStruct(strObj));
 
   assertEquals(0, wasm.brOnCastFailNullEq(null));
   assertEquals(1, wasm.brOnCastFailNullEq(undefined));
@@ -701,6 +880,17 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNullEq(funcObj));
   assertEquals(0, wasm.brOnCastFailNullEq(1));
   assertEquals(1, wasm.brOnCastFailNullEq(jsObj));
+  assertEquals(1, wasm.brOnCastFailNullEq(strObj));
+
+  assertEquals(0, wasm.brOnCastFailNullString(null));
+  assertEquals(1, wasm.brOnCastFailNullString(undefined));
+  assertEquals(1, wasm.brOnCastFailNullString(structSuperObj));
+  assertEquals(1, wasm.brOnCastFailNullString(structSubObj));
+  assertEquals(1, wasm.brOnCastFailNullString(arrayObj));
+  assertEquals(1, wasm.brOnCastFailNullString(funcObj));
+  assertEquals(1, wasm.brOnCastFailNullString(1));
+  assertEquals(1, wasm.brOnCastFailNullString(jsObj));
+  assertEquals(0, wasm.brOnCastFailNullString(strObj));
 
   assertEquals(0, wasm.brOnCastFailNullAny(null));
   assertEquals(0, wasm.brOnCastFailNullAny(undefined));
@@ -710,6 +900,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastFailNullAny(funcObj));
   assertEquals(0, wasm.brOnCastFailNullAny(1));
   assertEquals(0, wasm.brOnCastFailNullAny(jsObj));
+  assertEquals(0, wasm.brOnCastFailNullAny(strObj));
 
   assertEquals(0, wasm.brOnCastFailNullNone(null));
   assertEquals(1, wasm.brOnCastFailNullNone(undefined));
@@ -719,4 +910,409 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastFailNullNone(funcObj));
   assertEquals(1, wasm.brOnCastFailNullNone(1));
   assertEquals(1, wasm.brOnCastFailNullNone(jsObj));
+  assertEquals(1, wasm.brOnCastFailNullNone(strObj));
+
+  // br_on_cast
+  assertEquals(0, wasm.brOnCastGenericStructSuper(null));
+  assertEquals(0, wasm.brOnCastGenericStructSuper(undefined));
+  assertEquals(1, wasm.brOnCastGenericStructSuper(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericStructSuper(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericStructSuper(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericStructSuper(funcObj));
+  assertEquals(0, wasm.brOnCastGenericStructSuper(1));
+  assertEquals(0, wasm.brOnCastGenericStructSuper(jsObj));
+  assertEquals(0, wasm.brOnCastGenericStructSuper(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericStructSub(null));
+  assertEquals(0, wasm.brOnCastGenericStructSub(undefined));
+  assertEquals(0, wasm.brOnCastGenericStructSub(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericStructSub(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericStructSub(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericStructSub(funcObj));
+  assertEquals(0, wasm.brOnCastGenericStructSub(1));
+  assertEquals(0, wasm.brOnCastGenericStructSub(jsObj));
+  assertEquals(0, wasm.brOnCastGenericStructSub(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericArray(null));
+  assertEquals(0, wasm.brOnCastGenericArray(undefined));
+  assertEquals(0, wasm.brOnCastGenericArray(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericArray(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericArray(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericArray(funcObj));
+  assertEquals(0, wasm.brOnCastGenericArray(1));
+  assertEquals(0, wasm.brOnCastGenericArray(jsObj));
+  assertEquals(0, wasm.brOnCastGenericArray(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericI31(null));
+  assertEquals(0, wasm.brOnCastGenericI31(undefined));
+  assertEquals(0, wasm.brOnCastGenericI31(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericI31(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericI31(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericI31(funcObj));
+  assertEquals(1, wasm.brOnCastGenericI31(1));
+  assertEquals(0, wasm.brOnCastGenericI31(jsObj));
+  assertEquals(0, wasm.brOnCastGenericI31(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericAnyArray(null));
+  assertEquals(0, wasm.brOnCastGenericAnyArray(undefined));
+  assertEquals(0, wasm.brOnCastGenericAnyArray(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericAnyArray(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericAnyArray(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericAnyArray(funcObj));
+  assertEquals(0, wasm.brOnCastGenericAnyArray(1));
+  assertEquals(0, wasm.brOnCastGenericAnyArray(jsObj));
+  assertEquals(0, wasm.brOnCastGenericAnyArray(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericStruct(null));
+  assertEquals(0, wasm.brOnCastGenericStruct(undefined));
+  assertEquals(1, wasm.brOnCastGenericStruct(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericStruct(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericStruct(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericStruct(funcObj));
+  assertEquals(0, wasm.brOnCastGenericStruct(1));
+  assertEquals(0, wasm.brOnCastGenericStruct(jsObj));
+  assertEquals(0, wasm.brOnCastGenericStruct(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericEq(null));
+  assertEquals(0, wasm.brOnCastGenericEq(undefined));
+  assertEquals(1, wasm.brOnCastGenericEq(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericEq(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericEq(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericEq(funcObj));
+  assertEquals(1, wasm.brOnCastGenericEq(1));
+  assertEquals(0, wasm.brOnCastGenericEq(jsObj));
+  assertEquals(0, wasm.brOnCastGenericEq(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericString(null));
+  assertEquals(0, wasm.brOnCastGenericString(undefined));
+  assertEquals(0, wasm.brOnCastGenericString(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericString(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericString(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericString(funcObj));
+  assertEquals(0, wasm.brOnCastGenericString(1));
+  assertEquals(0, wasm.brOnCastGenericString(jsObj));
+  assertEquals(1, wasm.brOnCastGenericString(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericAny(null));
+  assertEquals(1, wasm.brOnCastGenericAny(undefined));
+  assertEquals(1, wasm.brOnCastGenericAny(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericAny(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericAny(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericAny(funcObj));
+  assertEquals(1, wasm.brOnCastGenericAny(1));
+  assertEquals(1, wasm.brOnCastGenericAny(jsObj));
+  assertEquals(1, wasm.brOnCastGenericAny(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericNone(null));
+  assertEquals(0, wasm.brOnCastGenericNone(undefined));
+  assertEquals(0, wasm.brOnCastGenericNone(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericNone(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericNone(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNone(funcObj));
+  assertEquals(0, wasm.brOnCastGenericNone(1));
+  assertEquals(0, wasm.brOnCastGenericNone(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNone(strObj));
+
+  // br_on_cast null
+  assertEquals(1, wasm.brOnCastGenericNullStructSuper(null));
+  assertEquals(0, wasm.brOnCastGenericNullStructSuper(undefined));
+  assertEquals(1, wasm.brOnCastGenericNullStructSuper(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericNullStructSuper(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericNullStructSuper(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullStructSuper(funcObj));
+  assertEquals(0, wasm.brOnCastGenericNullStructSuper(1));
+  assertEquals(0, wasm.brOnCastGenericNullStructSuper(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNullStructSuper(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullStructSub(null));
+  assertEquals(0, wasm.brOnCastGenericNullStructSub(undefined));
+  assertEquals(0, wasm.brOnCastGenericNullStructSub(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericNullStructSub(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericNullStructSub(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullStructSub(funcObj));
+  assertEquals(0, wasm.brOnCastGenericNullStructSub(1));
+  assertEquals(0, wasm.brOnCastGenericNullStructSub(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNullStructSub(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullArray(null));
+  assertEquals(0, wasm.brOnCastGenericNullArray(undefined));
+  assertEquals(0, wasm.brOnCastGenericNullArray(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericNullArray(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericNullArray(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullArray(funcObj));
+  assertEquals(0, wasm.brOnCastGenericNullArray(1));
+  assertEquals(0, wasm.brOnCastGenericNullArray(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNullArray(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullI31(null));
+  assertEquals(0, wasm.brOnCastGenericNullI31(undefined));
+  assertEquals(0, wasm.brOnCastGenericNullI31(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericNullI31(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericNullI31(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullI31(funcObj));
+  assertEquals(1, wasm.brOnCastGenericNullI31(1));
+  assertEquals(0, wasm.brOnCastGenericNullI31(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNullI31(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullAnyArray(null));
+  assertEquals(0, wasm.brOnCastGenericNullAnyArray(undefined));
+  assertEquals(0, wasm.brOnCastGenericNullAnyArray(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericNullAnyArray(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericNullAnyArray(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullAnyArray(funcObj));
+  assertEquals(0, wasm.brOnCastGenericNullAnyArray(1));
+  assertEquals(0, wasm.brOnCastGenericNullAnyArray(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNullAnyArray(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullStruct(null));
+  assertEquals(0, wasm.brOnCastGenericNullStruct(undefined));
+  assertEquals(1, wasm.brOnCastGenericNullStruct(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericNullStruct(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericNullStruct(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullStruct(funcObj));
+  assertEquals(0, wasm.brOnCastGenericNullStruct(1));
+  assertEquals(0, wasm.brOnCastGenericNullStruct(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNullStruct(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullEq(null));
+  assertEquals(0, wasm.brOnCastGenericNullEq(undefined));
+  assertEquals(1, wasm.brOnCastGenericNullEq(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericNullEq(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericNullEq(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullEq(funcObj));
+  assertEquals(1, wasm.brOnCastGenericNullEq(1));
+  assertEquals(0, wasm.brOnCastGenericNullEq(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNullEq(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullString(null));
+  assertEquals(0, wasm.brOnCastGenericNullString(undefined));
+  assertEquals(0, wasm.brOnCastGenericNullString(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericNullString(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericNullString(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullString(funcObj));
+  assertEquals(0, wasm.brOnCastGenericNullString(1));
+  assertEquals(0, wasm.brOnCastGenericNullString(jsObj));
+  assertEquals(1, wasm.brOnCastGenericNullString(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullAny(null));
+  assertEquals(1, wasm.brOnCastGenericNullAny(undefined));
+  assertEquals(1, wasm.brOnCastGenericNullAny(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericNullAny(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericNullAny(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericNullAny(funcObj));
+  assertEquals(1, wasm.brOnCastGenericNullAny(1));
+  assertEquals(1, wasm.brOnCastGenericNullAny(jsObj));
+  assertEquals(1, wasm.brOnCastGenericNullAny(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericNullNone(null));
+  assertEquals(0, wasm.brOnCastGenericNullNone(undefined));
+  assertEquals(0, wasm.brOnCastGenericNullNone(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericNullNone(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericNullNone(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericNullNone(funcObj));
+  assertEquals(0, wasm.brOnCastGenericNullNone(1));
+  assertEquals(0, wasm.brOnCastGenericNullNone(jsObj));
+  assertEquals(0, wasm.brOnCastGenericNullNone(strObj));
+
+  // br_on_cast_fail
+  assertEquals(1, wasm.brOnCastGenericFailStructSuper(null));
+  assertEquals(1, wasm.brOnCastGenericFailStructSuper(undefined));
+  assertEquals(0, wasm.brOnCastGenericFailStructSuper(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailStructSuper(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailStructSuper(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailStructSuper(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailStructSuper(1));
+  assertEquals(1, wasm.brOnCastGenericFailStructSuper(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailStructSuper(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailStructSub(null));
+  assertEquals(1, wasm.brOnCastGenericFailStructSub(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailStructSub(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailStructSub(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailStructSub(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailStructSub(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailStructSub(1));
+  assertEquals(1, wasm.brOnCastGenericFailStructSub(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailStructSub(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailArray(null));
+  assertEquals(1, wasm.brOnCastGenericFailArray(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailArray(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailArray(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericFailArray(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailArray(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailArray(1));
+  assertEquals(1, wasm.brOnCastGenericFailArray(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailArray(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailI31(null));
+  assertEquals(1, wasm.brOnCastGenericFailI31(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailI31(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailI31(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailI31(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailI31(funcObj));
+  assertEquals(0, wasm.brOnCastGenericFailI31(1));
+  assertEquals(1, wasm.brOnCastGenericFailI31(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailI31(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailAnyArray(null));
+  assertEquals(1, wasm.brOnCastGenericFailAnyArray(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailAnyArray(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailAnyArray(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericFailAnyArray(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailAnyArray(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailAnyArray(1));
+  assertEquals(1, wasm.brOnCastGenericFailAnyArray(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailAnyArray(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailStruct(null));
+  assertEquals(1, wasm.brOnCastGenericFailStruct(undefined));
+  assertEquals(0, wasm.brOnCastGenericFailStruct(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailStruct(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailStruct(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailStruct(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailStruct(1));
+  assertEquals(1, wasm.brOnCastGenericFailStruct(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailStruct(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailEq(null));
+  assertEquals(1, wasm.brOnCastGenericFailEq(undefined));
+  assertEquals(0, wasm.brOnCastGenericFailEq(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailEq(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericFailEq(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailEq(funcObj));
+  assertEquals(0, wasm.brOnCastGenericFailEq(1));
+  assertEquals(1, wasm.brOnCastGenericFailEq(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailEq(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailString(null));
+  assertEquals(1, wasm.brOnCastGenericFailString(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailString(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailString(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailString(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailString(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailString(1));
+  assertEquals(1, wasm.brOnCastGenericFailString(jsObj));
+  assertEquals(0, wasm.brOnCastGenericFailString(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailAny(null));
+  assertEquals(0, wasm.brOnCastGenericFailAny(undefined));
+  assertEquals(0, wasm.brOnCastGenericFailAny(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailAny(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericFailAny(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericFailAny(funcObj));
+  assertEquals(0, wasm.brOnCastGenericFailAny(1));
+  assertEquals(0, wasm.brOnCastGenericFailAny(jsObj));
+  assertEquals(0, wasm.brOnCastGenericFailAny(strObj));
+
+  assertEquals(1, wasm.brOnCastGenericFailNone(null));
+  assertEquals(1, wasm.brOnCastGenericFailNone(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailNone(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailNone(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailNone(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNone(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailNone(1));
+  assertEquals(1, wasm.brOnCastGenericFailNone(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNone(strObj));
+
+  // br_on_cast_fail null
+  assertEquals(0, wasm.brOnCastGenericFailNullStructSuper(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSuper(undefined));
+  assertEquals(0, wasm.brOnCastGenericFailNullStructSuper(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullStructSuper(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSuper(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSuper(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSuper(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSuper(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSuper(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullStructSub(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSub(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSub(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullStructSub(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSub(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSub(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSub(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSub(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStructSub(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullArray(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullArray(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailNullArray(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullArray(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullArray(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullArray(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullArray(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullArray(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullArray(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullI31(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullI31(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailNullI31(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullI31(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullI31(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullI31(funcObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullI31(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullI31(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullI31(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullAnyArray(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullAnyArray(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailNullAnyArray(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullAnyArray(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullAnyArray(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullAnyArray(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullAnyArray(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullAnyArray(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullAnyArray(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullStruct(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullStruct(undefined));
+  assertEquals(0, wasm.brOnCastGenericFailNullStruct(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullStruct(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStruct(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStruct(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStruct(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullStruct(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullStruct(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullEq(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullEq(undefined));
+  assertEquals(0, wasm.brOnCastGenericFailNullEq(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullEq(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullEq(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullEq(funcObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullEq(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullEq(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullEq(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullString(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullString(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailNullString(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullString(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullString(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullString(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullString(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullString(jsObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullString(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(null));
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(undefined));
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(structSuperObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(structSubObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(arrayObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(funcObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(1));
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(jsObj));
+  assertEquals(0, wasm.brOnCastGenericFailNullAny(strObj));
+
+  assertEquals(0, wasm.brOnCastGenericFailNullNone(null));
+  assertEquals(1, wasm.brOnCastGenericFailNullNone(undefined));
+  assertEquals(1, wasm.brOnCastGenericFailNullNone(structSuperObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullNone(structSubObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullNone(arrayObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullNone(funcObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullNone(1));
+  assertEquals(1, wasm.brOnCastGenericFailNullNone(jsObj));
+  assertEquals(1, wasm.brOnCastGenericFailNullNone(strObj));
 })();
diff --git a/deps/v8/test/mjsunit/wasm/gc-casts-invalid.js b/deps/v8/test/mjsunit/wasm/gc-casts-invalid.js
index 4a1ce96c7cadd5..f1c4875f20ed6c 100644
--- a/deps/v8/test/mjsunit/wasm/gc-casts-invalid.js
+++ b/deps/v8/test/mjsunit/wasm/gc-casts-invalid.js
@@ -7,6 +7,7 @@
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 (function TestRefTestInvalid() {
+  print(arguments.callee.name);
   let struct = 0;
   let array = 1;
   let sig = 2;
@@ -48,3 +49,177 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
     }
   }
 })();
+
+(function TestBrOnCastExpectsNonNull() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+  builder.addFunction('fct', makeSig([wasmRefNullType(struct)], []))
+  .addBody([
+    kExprBlock, kAnyRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCast(0, wasmRefType(struct), wasmRefType(struct)),
+      kExprDrop,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprReturn,
+  ]);
+
+  assertThrows(() => builder.instantiate(),
+    WebAssembly.CompileError,
+    /br_on_cast\[0\] expected type \(ref 0\), found local.get of type \(ref null 0\)/);
+})();
+
+(function TestBrOnCastExpectsNull() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+  builder.addFunction('fct', makeSig([wasmRefType(struct)], []))
+  .addBody([
+    kExprBlock, kAnyRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCast(0, wasmRefNullType(struct), wasmRefNullType(struct)),
+      kExprDrop,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprReturn,
+  ]);
+  // Specifying a nullable source and providing a non-nullable value is not an
+  // error (as non-nullable values can be cast implicitly to nullable).
+  builder.instantiate();
+})();
+
+(function TestBrOnCastNonNullToNull() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+  builder.addFunction('fct', makeSig([wasmRefType(struct)], []))
+  .addBody([
+    kExprBlock, kAnyRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCast(0, wasmRefType(struct), wasmRefNullType(struct)),
+      kExprDrop,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprReturn,
+  ]);
+  // Even though the source is non-nullable, if the br_on_cast is set to produce
+  // a nullable value on cast, the label target must be nullable as well.
+  assertThrows(() => builder.instantiate(),
+    WebAssembly.CompileError,
+    /invalid types for br_on_cast: \(ref null 0\) is not a subtype of \(ref 0\)/);
+})();
+
+(function TestBrOnCastInvalidFlags() {
+  print(arguments.callee.name);
+  for (let value of [-1, 8, 127, 255, 256]) {
+    let builder = new WasmModuleBuilder();
+    let struct = builder.addStruct([makeField(kWasmI32, true)]);
+    builder.addFunction('fct', makeSig([wasmRefType(struct)], []))
+    .addBody([
+      kExprBlock, kAnyRefCode,
+        kExprLocalGet, 0,
+        kGCPrefix, kExprBrOnCastGeneric,
+          ...wasmUnsignedLeb(value), 0, kAnyRefCode, struct,
+        kExprDrop,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprReturn,
+    ]);
+    assertThrows(() => builder.instantiate(),
+      WebAssembly.CompileError,
+      /invalid br_on_cast flags [0-9]+/);
+  }
+})();
+
+(function TestBrOnCastSourceTypeUpcast() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+
+  builder.addFunction('fct', makeSig([wasmRefType(struct)], []))
+  .addBody([
+    kExprBlock, kAnyRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCast(0, wasmRefType(kWasmAnyRef), wasmRefType(struct)),
+      kGCPrefix, kExprStructGet, struct, 0,
+      kExprDrop,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprReturn,
+  ]);
+  // While the value stack type is (ref struct), the source type in the
+  // br_on_cast is specified as (ref any), so the fallthrough type becomes
+  // the less specific (ref any).
+  assertThrows(() => builder.instantiate(),
+    WebAssembly.CompileError,
+    /struct.get\[0\] expected type \(ref null 0\), found local.get of type \(ref any\)/);
+})();
+
+(function TestBrOnCastFailSourceTypeUpcast() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+  let structRefSig =
+      builder.addType(makeSig([], [wasmRefType(struct)]));
+
+  builder.addFunction('fct', makeSig([wasmRefType(struct)], []))
+  .addBody([
+    kExprBlock, structRefSig,
+      kExprLocalGet, 0,
+      ...wasmBrOnCastFail(0, wasmRefNullType(kWasmAnyRef), wasmRefType(struct)),
+      kExprDrop,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprReturn,
+  ]);
+  // While the value stack type is (ref struct), the source type in the
+  // br_on_cast_fail is specified as (ref any), so the branch type becomes
+  // the less specific (ref any).
+  assertThrows(() => builder.instantiate(),
+    WebAssembly.CompileError,
+    /type error in branch\[0\] \(expected \(ref 0\), got anyref\)/);
+})();
+
+// Test that validation and code generation works fine in unreachable paths.
+(function TestBrOnCastUnreachable() {
+  print(arguments.callee.name);
+
+  let casts = [
+    [kGCPrefix, kExprBrOnCastFailNull, 0, kI31RefCode],
+    [kGCPrefix, kExprBrOnCastNull, 0, kI31RefCode],
+    [kGCPrefix, kExprBrOnCastFail, 0, kI31RefCode],
+    [kGCPrefix, kExprBrOnCast, 0, kI31RefCode],
+    wasmBrOnCastFail(
+      0, wasmRefNullType(kWasmAnyRef), wasmRefNullType(kWasmI31Ref)),
+    wasmBrOnCast(0, wasmRefNullType(kWasmAnyRef), wasmRefNullType(kWasmI31Ref)),
+    wasmBrOnCastFail(0, wasmRefNullType(kWasmAnyRef), wasmRefType(kWasmI31Ref)),
+    wasmBrOnCast(0, wasmRefNullType(kWasmAnyRef), wasmRefType(kWasmI31Ref)),
+  ];
+
+  for (let brOnCast of casts) {
+    let builder = new WasmModuleBuilder();
+
+    builder.addFunction(`brOnCastUnreachable`,
+                        makeSig([kWasmExternRef], []))
+    .addBody([
+      kExprBlock, kAnyRefCode,
+        kExprLocalGet, 0,
+        kGCPrefix, kExprExternInternalize,
+        kExprUnreachable,
+        ...brOnCast,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+    ]).exportFunc();
+
+    let wasm = builder.instantiate().exports;
+    assertTraps(kTrapUnreachable, () => wasm.brOnCastUnreachable());
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/gc-casts-subtypes.js b/deps/v8/test/mjsunit/wasm/gc-casts-subtypes.js
index efbc9fda328d0f..0bf59ffd50dc27 100644
--- a/deps/v8/test/mjsunit/wasm/gc-casts-subtypes.js
+++ b/deps/v8/test/mjsunit/wasm/gc-casts-subtypes.js
@@ -23,25 +23,26 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   // Note: Casting between unrelated types is allowed as long as the types
   // belong to the same type hierarchy (func / any / extern). In these cases the
   // check will always fail.
+  // For br_on_cast, only downcasts are allowed!
   let tests = [
-    [kWasmAnyRef, kWasmAnyRef, 'AnyToAny'],
-    [kWasmFuncRef, kWasmFuncRef, 'FuncToFunc'],
-    [kWasmExternRef, kWasmExternRef, 'ExternToExtern'],
-    [kWasmNullFuncRef, kWasmNullFuncRef, 'NullFuncToNullFunc'],
-    [kWasmNullExternRef, kWasmNullExternRef, 'NullExternToNullExtern'],
-    [structSub, array, 'StructToArray'],
-    [kWasmFuncRef, kWasmNullFuncRef, 'FuncToNullFunc'],
-    [kWasmNullFuncRef, kWasmFuncRef, 'NullFuncToFunc'],
-    [kWasmExternRef, kWasmNullExternRef, 'ExternToNullExtern'],
-    [kWasmNullExternRef, kWasmExternRef, 'NullExternToExtern'],
-    [kWasmNullRef, kWasmAnyRef, 'NullToAny'],
-    [kWasmI31Ref, structSub, 'I31ToStruct'],
-    [kWasmEqRef, kWasmI31Ref, 'EqToI31'],
-    [structSuper, structSub, 'StructSuperToStructSub'],
-    [structSub, structSuper, 'StructSubToStructSuper'],
+    [kWasmAnyRef, kWasmAnyRef, 'AnyToAny', true],
+    [kWasmFuncRef, kWasmFuncRef, 'FuncToFunc', true],
+    [kWasmExternRef, kWasmExternRef, 'ExternToExtern', true],
+    [kWasmNullFuncRef, kWasmNullFuncRef, 'NullFuncToNullFunc', true],
+    [kWasmNullExternRef, kWasmNullExternRef, 'NullExternToNullExtern', true],
+    [structSub, array, 'StructToArray', false],
+    [kWasmFuncRef, kWasmNullFuncRef, 'FuncToNullFunc', true],
+    [kWasmNullFuncRef, kWasmFuncRef, 'NullFuncToFunc', false],
+    [kWasmExternRef, kWasmNullExternRef, 'ExternToNullExtern', true],
+    [kWasmNullExternRef, kWasmExternRef, 'NullExternToExtern', false],
+    [kWasmNullRef, kWasmAnyRef, 'NullToAny', false],
+    [kWasmI31Ref, structSub, 'I31ToStruct', false],
+    [kWasmEqRef, kWasmI31Ref, 'EqToI31', true],
+    [structSuper, structSub, 'StructSuperToStructSub', true],
+    [structSub, structSuper, 'StructSubToStructSuper', false],
   ];
 
-  for (let [sourceType, targetType, testName] of tests) {
+  for (let [sourceType, targetType, testName, isDowncast] of tests) {
     builder.addFunction('testNull' + testName, makeSig([], [kWasmI32]))
     .addLocals(wasmRefNullType(sourceType), 1)
     .addBody([
@@ -55,7 +56,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
       kGCPrefix, kExprRefCast, targetType & kLeb128Mask,
       kExprDrop,
     ]).exportFunc();
-    builder.addFunction('branchNull' + testName, makeSig([], [kWasmI32]))
+    builder.addFunction('branchDeprecatedNull' + testName,
+                        makeSig([], [kWasmI32]))
     .addLocals(wasmRefNullType(sourceType), 1)
     .addBody([
       kExprBlock, kWasmRef, targetType & kLeb128Mask,
@@ -68,15 +70,50 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
       kExprI32Const, 1,
       kExprReturn,
     ]).exportFunc();
+    if (isDowncast) {
+      builder.addFunction('branchNull' + testName, makeSig([], [kWasmI32]))
+      .addLocals(wasmRefNullType(sourceType), 1)
+      .addBody([
+        kExprBlock, kWasmRef, targetType & kLeb128Mask,
+          kExprLocalGet, 0,
+          ...wasmBrOnCast(
+              0, wasmRefNullType(sourceType), wasmRefType(targetType)),
+          kExprI32Const, 0,
+          kExprReturn,
+        kExprEnd,
+        kExprDrop,
+        kExprI32Const, 1,
+        kExprReturn,
+      ]).exportFunc();
+      builder.addFunction('branchFailNull' + testName, makeSig([], [kWasmI32]))
+      .addLocals(wasmRefNullType(sourceType), 1)
+      .addBody([
+        kExprBlock, kWasmRef, sourceType & kLeb128Mask,
+          kExprLocalGet, 0,
+          ...wasmBrOnCastFail(
+              0, wasmRefNullType(sourceType), wasmRefNullType(targetType)),
+          kExprI32Const, 0,
+          kExprReturn,
+        kExprEnd,
+        kExprDrop,
+        kExprI32Const, 1,
+        kExprReturn,
+      ]).exportFunc();
+    }
   }
 
   let instance = builder.instantiate();
   let wasm = instance.exports;
 
-  for (let [sourceType, targetType, testName] of tests) {
+  for (let [sourceType, targetType, testName, isDowncast] of tests) {
+    print(testName);
     assertEquals(0, wasm['testNull' + testName]());
     assertTraps(kTrapIllegalCast, wasm['castNull' + testName]);
-    assertEquals(0, wasm['branchNull' + testName]());
+    assertEquals(0, wasm['branchDeprecatedNull' + testName]());
+    if (isDowncast) {
+      assertEquals(0, wasm['branchNull' + testName]());
+      assertEquals(0, wasm['branchFailNull' + testName]());
+    }
   }
 })();
 
@@ -202,7 +239,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertSame(wasm.fctSub, wasm.castNullToSub(wasm.fctSub));
 })();
 
-(function BrOnCastFuncRef() {
+(function BrOnCastDeprecatedFuncRef() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
   let sigSuper = builder.addType(makeSig([kWasmI32], []), kNoSuperType, false);
@@ -299,6 +336,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCast_super(wasm.fctSub));
   assertEquals(1, wasm.brOnCast_sub(wasm.fctSub));
 
+  // br_on_cast null
   assertEquals(1, wasm.brOnCastNull_funcref(null));
   assertEquals(1, wasm.brOnCastNull_nullfuncref(null));
   assertEquals(1, wasm.brOnCastNull_super(null));
@@ -319,6 +357,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.brOnCastNull_super(wasm.fctSub));
   assertEquals(1, wasm.brOnCastNull_sub(wasm.fctSub));
 
+  // br_on_cast_fail
   assertEquals(1, wasm.brOnCastFail_funcref(null));
   assertEquals(1, wasm.brOnCastFail_nullfuncref(null));
   assertEquals(1, wasm.brOnCastFail_super(null));
@@ -339,7 +378,172 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(0, wasm.brOnCastFail_super(wasm.fctSub));
   assertEquals(0, wasm.brOnCastFail_sub(wasm.fctSub));
 
-  // br_on_cast fail
+  // br_on_cast_fail null
+  assertEquals(0, wasm.brOnCastFailNull_funcref(null));
+  assertEquals(0, wasm.brOnCastFailNull_nullfuncref(null));
+  assertEquals(0, wasm.brOnCastFailNull_super(null));
+  assertEquals(0, wasm.brOnCastFailNull_sub(null));
+
+  assertEquals(0, wasm.brOnCastFailNull_funcref(jsFct));
+  assertEquals(1, wasm.brOnCastFailNull_nullfuncref(jsFct));
+  assertEquals(1, wasm.brOnCastFailNull_super(jsFct));
+  assertEquals(1, wasm.brOnCastFailNull_sub(jsFct));
+
+  assertEquals(0, wasm.brOnCastFailNull_funcref(wasm.fctSuper));
+  assertEquals(1, wasm.brOnCastFailNull_nullfuncref(wasm.fctSuper));
+  assertEquals(0, wasm.brOnCastFailNull_super(wasm.fctSuper));
+  assertEquals(1, wasm.brOnCastFailNull_sub(wasm.fctSuper));
+
+  assertEquals(0, wasm.brOnCastFailNull_funcref(wasm.fctSub));
+  assertEquals(1, wasm.brOnCastFailNull_nullfuncref(wasm.fctSub));
+  assertEquals(0, wasm.brOnCastFailNull_super(wasm.fctSub));
+  assertEquals(0, wasm.brOnCastFailNull_sub(wasm.fctSub));
+})();
+
+(function BrOnCastFuncRef() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let sigSuper = builder.addType(makeSig([kWasmI32], []), kNoSuperType, false);
+  let sigSub = builder.addType(makeSig([kWasmI32], []), sigSuper);
+
+  builder.addFunction('fctSuper', sigSuper).addBody([]).exportFunc();
+  builder.addFunction('fctSub', sigSub).addBody([]).exportFunc();
+  let targets = {
+    "funcref": kWasmFuncRef,
+    "nullfuncref": kWasmNullFuncRef,
+    "super": sigSuper,
+    "sub": sigSub
+  };
+  for (const [name, target_type] of Object.entries(targets)) {
+    builder.addFunction(`brOnCast_${name}`,
+      makeSig([kWasmFuncRef], [kWasmI32]))
+    .addBody([
+      kExprBlock, kWasmRef, target_type & kLeb128Mask,
+        kExprLocalGet, 0,
+        ...wasmBrOnCast(
+            0, wasmRefNullType(kWasmFuncRef), wasmRefType(target_type)),
+        kExprI32Const, 0,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprI32Const, 1,
+      kExprReturn,
+    ]).exportFunc();
+
+    builder.addFunction(`brOnCastNull_${name}`,
+      makeSig([kWasmFuncRef], [kWasmI32]))
+    .addBody([
+      kExprBlock, kWasmRefNull, target_type & kLeb128Mask,
+        kExprLocalGet, 0,
+        ...wasmBrOnCast(
+            0, wasmRefNullType(kWasmFuncRef), wasmRefNullType(target_type)),
+        kExprI32Const, 0,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprI32Const, 1,
+      kExprReturn,
+    ]).exportFunc();
+
+    builder.addFunction(`brOnCastFail_${name}`,
+      makeSig([kWasmFuncRef], [kWasmI32]))
+    .addBody([
+      kExprBlock, kFuncRefCode,
+        kExprLocalGet, 0,
+        ...wasmBrOnCastFail(
+            0, wasmRefNullType(kWasmFuncRef), wasmRefType(target_type)),
+        kExprI32Const, 0,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprI32Const, 1,
+      kExprReturn,
+    ]).exportFunc();
+
+    builder.addFunction(`brOnCastFailNull_${name}`,
+      makeSig([kWasmFuncRef], [kWasmI32]))
+    .addBody([
+      kExprBlock, kWasmRef, kFuncRefCode,
+        kExprLocalGet, 0,
+        ...wasmBrOnCastFail(
+          0, wasmRefNullType(kWasmFuncRef), wasmRefNullType(target_type)),
+        kExprI32Const, 0,
+        kExprReturn,
+      kExprEnd,
+      kExprDrop,
+      kExprI32Const, 1,
+      kExprReturn,
+    ]).exportFunc();
+  }
+
+  let instance = builder.instantiate();
+  let wasm = instance.exports;
+  let jsFct = new WebAssembly.Function(
+      {parameters:['i32', 'i32'], results: ['i32']},
+      function mul(a, b) { return a * b; });
+  assertEquals(0, wasm.brOnCast_funcref(null));
+  assertEquals(0, wasm.brOnCast_nullfuncref(null));
+  assertEquals(0, wasm.brOnCast_super(null));
+  assertEquals(0, wasm.brOnCast_sub(null));
+
+  assertEquals(1, wasm.brOnCast_funcref(jsFct));
+  assertEquals(0, wasm.brOnCast_nullfuncref(jsFct));
+  assertEquals(0, wasm.brOnCast_super(jsFct));
+  assertEquals(0, wasm.brOnCast_sub(jsFct));
+
+  assertEquals(1, wasm.brOnCast_funcref(wasm.fctSuper));
+  assertEquals(0, wasm.brOnCast_nullfuncref(wasm.fctSuper));
+  assertEquals(1, wasm.brOnCast_super(wasm.fctSuper));
+  assertEquals(0, wasm.brOnCast_sub(wasm.fctSuper));
+
+  assertEquals(1, wasm.brOnCast_funcref(wasm.fctSub));
+  assertEquals(0, wasm.brOnCast_nullfuncref(wasm.fctSub));
+  assertEquals(1, wasm.brOnCast_super(wasm.fctSub));
+  assertEquals(1, wasm.brOnCast_sub(wasm.fctSub));
+
+  // br_on_cast null
+  assertEquals(1, wasm.brOnCastNull_funcref(null));
+  assertEquals(1, wasm.brOnCastNull_nullfuncref(null));
+  assertEquals(1, wasm.brOnCastNull_super(null));
+  assertEquals(1, wasm.brOnCastNull_sub(null));
+
+  assertEquals(1, wasm.brOnCastNull_funcref(jsFct));
+  assertEquals(0, wasm.brOnCastNull_nullfuncref(jsFct));
+  assertEquals(0, wasm.brOnCastNull_super(jsFct));
+  assertEquals(0, wasm.brOnCastNull_sub(jsFct));
+
+  assertEquals(1, wasm.brOnCastNull_funcref(wasm.fctSuper));
+  assertEquals(0, wasm.brOnCastNull_nullfuncref(wasm.fctSuper));
+  assertEquals(1, wasm.brOnCastNull_super(wasm.fctSuper));
+  assertEquals(0, wasm.brOnCastNull_sub(wasm.fctSuper));
+
+  assertEquals(1, wasm.brOnCastNull_funcref(wasm.fctSub));
+  assertEquals(0, wasm.brOnCastNull_nullfuncref(wasm.fctSub));
+  assertEquals(1, wasm.brOnCastNull_super(wasm.fctSub));
+  assertEquals(1, wasm.brOnCastNull_sub(wasm.fctSub));
+
+  // br_on_cast_fail
+  assertEquals(1, wasm.brOnCastFail_funcref(null));
+  assertEquals(1, wasm.brOnCastFail_nullfuncref(null));
+  assertEquals(1, wasm.brOnCastFail_super(null));
+  assertEquals(1, wasm.brOnCastFail_sub(null));
+
+  assertEquals(0, wasm.brOnCastFail_funcref(jsFct));
+  assertEquals(1, wasm.brOnCastFail_nullfuncref(jsFct));
+  assertEquals(1, wasm.brOnCastFail_super(jsFct));
+  assertEquals(1, wasm.brOnCastFail_sub(jsFct));
+
+  assertEquals(0, wasm.brOnCastFail_funcref(wasm.fctSuper));
+  assertEquals(1, wasm.brOnCastFail_nullfuncref(wasm.fctSuper));
+  assertEquals(0, wasm.brOnCastFail_super(wasm.fctSuper));
+  assertEquals(1, wasm.brOnCastFail_sub(wasm.fctSuper));
+
+  assertEquals(0, wasm.brOnCastFail_funcref(wasm.fctSub));
+  assertEquals(1, wasm.brOnCastFail_nullfuncref(wasm.fctSub));
+  assertEquals(0, wasm.brOnCastFail_super(wasm.fctSub));
+  assertEquals(0, wasm.brOnCastFail_sub(wasm.fctSub));
+
+  // br_on_cast_fail null
   assertEquals(0, wasm.brOnCastFailNull_funcref(null));
   assertEquals(0, wasm.brOnCastFailNull_nullfuncref(null));
   assertEquals(0, wasm.brOnCastFailNull_super(null));
@@ -447,7 +651,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
               () => wasm.castNullToNullExternRef(wasm.castToExternRef));
 })();
 
-(function BrOnCastExternRef() {
+(function BrOnCastDeprecatedExternRef() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
 
@@ -620,6 +824,186 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, wasm.castFailNullToNullExternRef(wasm.castToExternRef));
 })();
 
+(function BrOnCastExternRef() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  builder.addFunction('castToExternRef',
+    makeSig([kWasmExternRef], [kWasmI32]))
+  .addBody([
+    kExprBlock, kWasmRef, kExternRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCast(
+          0, wasmRefNullType(kWasmExternRef), wasmRefType(kWasmExternRef)),
+      kExprI32Const, 0,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprI32Const, 1,
+    kExprReturn,
+  ])
+  .exportFunc();
+  builder.addFunction('castToNullExternRef',
+    makeSig([kWasmExternRef], [kWasmI32]))
+  .addBody([
+    kExprBlock, kWasmRef, kNullExternRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCast(
+          0, wasmRefNullType(kWasmExternRef), wasmRefType(kWasmNullExternRef)),
+      kExprI32Const, 0,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprI32Const, 1,
+    kExprReturn,
+  ])
+  .exportFunc();
+
+  builder.addFunction('castNullToExternRef',
+    makeSig([kWasmExternRef], [kWasmI32]))
+  .addBody([
+    kExprBlock, kWasmRefNull, kExternRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCast(0,
+          wasmRefNullType(kWasmExternRef), wasmRefNullType(kWasmExternRef)),
+      kExprI32Const, 0,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprI32Const, 1,
+    kExprReturn,
+  ])
+  .exportFunc();
+  builder.addFunction('castNullToNullExternRef',
+    makeSig([kWasmExternRef], [kWasmI32]))
+  .addBody([
+    kExprBlock, kWasmRefNull, kNullExternRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCast(0,
+          wasmRefNullType(kWasmExternRef), wasmRefNullType(kWasmNullExternRef)),
+      kExprI32Const, 0,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprI32Const, 1,
+    kExprReturn,
+  ])
+  .exportFunc();
+
+  builder.addFunction('castFailToExternRef',
+    makeSig([kWasmExternRef], [kWasmI32]))
+  .addBody([
+    kExprBlock, kWasmRefNull, kExternRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCastFail(0,
+          wasmRefNullType(kWasmExternRef), wasmRefType(kWasmExternRef)),
+      kExprI32Const, 0,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprI32Const, 1,
+    kExprReturn,
+  ])
+  .exportFunc();
+  builder.addFunction('castFailToNullExternRef',
+    makeSig([kWasmExternRef], [kWasmI32]))
+  .addBody([
+    kExprBlock, kWasmRefNull, kExternRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCastFail(0,
+          wasmRefNullType(kWasmExternRef), wasmRefType(kWasmNullExternRef)),
+      kExprI32Const, 0,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprI32Const, 1,
+    kExprReturn,
+  ])
+  .exportFunc();
+
+  builder.addFunction('castFailNullToExternRef',
+    makeSig([kWasmExternRef], [kWasmI32]))
+  .addBody([
+    kExprBlock, kWasmRef, kExternRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCastFail(0,
+          wasmRefNullType(kWasmExternRef), wasmRefNullType(kWasmExternRef)),
+      kExprI32Const, 0,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprI32Const, 1,
+    kExprReturn,
+  ])
+  .exportFunc();
+  builder.addFunction('castFailNullToNullExternRef',
+    makeSig([kWasmExternRef], [kWasmI32]))
+  .addBody([
+    kExprBlock, kWasmRef, kExternRefCode,
+      kExprLocalGet, 0,
+      ...wasmBrOnCastFail(0,
+          wasmRefNullType(kWasmExternRef), wasmRefNullType(kWasmNullExternRef)),
+      kExprI32Const, 0,
+      kExprReturn,
+    kExprEnd,
+    kExprDrop,
+    kExprI32Const, 1,
+    kExprReturn,
+  ])
+  .exportFunc();
+
+  let instance = builder.instantiate();
+  let wasm = instance.exports;
+  let obj = {};
+
+  assertEquals(0, wasm.castToExternRef(null));
+  assertEquals(1, wasm.castToExternRef(undefined));
+  assertEquals(1, wasm.castToExternRef(1));
+  assertEquals(1, wasm.castToExternRef(obj));
+  assertEquals(1, wasm.castToExternRef(wasm.castToExternRef));
+
+  assertEquals(0, wasm.castToNullExternRef(null));
+  assertEquals(0, wasm.castToNullExternRef(undefined));
+  assertEquals(0, wasm.castToNullExternRef(1));
+  assertEquals(0, wasm.castToNullExternRef(obj));
+  assertEquals(0, wasm.castToNullExternRef(wasm.castToExternRef));
+
+  assertEquals(1, wasm.castNullToExternRef(null));
+  assertEquals(1, wasm.castNullToExternRef(undefined));
+  assertEquals(1, wasm.castNullToExternRef(1));
+  assertEquals(1, wasm.castNullToExternRef(obj));
+  assertEquals(1, wasm.castNullToExternRef(wasm.castToExternRef));
+
+  assertEquals(1, wasm.castNullToNullExternRef(null));
+  assertEquals(0, wasm.castNullToNullExternRef(undefined));
+  assertEquals(0, wasm.castNullToNullExternRef(1));
+  assertEquals(0, wasm.castNullToNullExternRef(obj));
+  assertEquals(0, wasm.castNullToNullExternRef(wasm.castToExternRef));
+
+  assertEquals(1, wasm.castFailToExternRef(null));
+  assertEquals(0, wasm.castFailToExternRef(undefined));
+  assertEquals(0, wasm.castFailToExternRef(1));
+  assertEquals(0, wasm.castFailToExternRef(obj));
+  assertEquals(0, wasm.castFailToExternRef(wasm.castToExternRef));
+
+  assertEquals(1, wasm.castFailToNullExternRef(null));
+  assertEquals(1, wasm.castFailToNullExternRef(undefined));
+  assertEquals(1, wasm.castFailToNullExternRef(1));
+  assertEquals(1, wasm.castFailToNullExternRef(obj));
+  assertEquals(1, wasm.castFailToNullExternRef(wasm.castToExternRef));
+
+  assertEquals(0, wasm.castFailNullToExternRef(null));
+  assertEquals(0, wasm.castFailNullToExternRef(undefined));
+  assertEquals(0, wasm.castFailNullToExternRef(1));
+  assertEquals(0, wasm.castFailNullToExternRef(obj));
+  assertEquals(0, wasm.castFailNullToExternRef(wasm.castToExternRef));
+
+  assertEquals(0, wasm.castFailNullToNullExternRef(null));
+  assertEquals(1, wasm.castFailNullToNullExternRef(undefined));
+  assertEquals(1, wasm.castFailNullToNullExternRef(1));
+  assertEquals(1, wasm.castFailNullToNullExternRef(obj));
+  assertEquals(1, wasm.castFailNullToNullExternRef(wasm.castToExternRef));
+})();
 
 (function RefTestAnyRefHierarchy() {
   print(arguments.callee.name);
@@ -659,6 +1043,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   // targets => A list of types for ref.test. For each type the values are
   //            listed for which ref.test should return 1 (i.e. the ref.test
   //            should succeed).
+  // isUpcastOrUnrelated => A subset of the target types which are not legal
+  //            targets for br_on_cast which only allows downcasts.)
   let tests = [
     {
       source: 'any',
@@ -672,7 +1058,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
         structSuper: ['structSuper', 'structSub'],
         structSub: ['structSub'],
         nullref: [],
-      }
+      },
+      isUpcastOrUnrelated: [],
     },
     {
       source: 'eq',
@@ -685,7 +1072,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
         structSuper: ['structSuper', 'structSub'],
         structSub: ['structSub'],
         nullref: [],
-      }
+      },
+      isUpcastOrUnrelated: [],
     },
     {
       source: 'struct',
@@ -698,7 +1086,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
         structSuper: ['structSuper', 'structSub'],
         structSub: ['structSub'],
         nullref: [],
-      }
+      },
+      isUpcastOrUnrelated: ['eq', 'anyArray', 'array'],
     },
     {
       source: 'anyArray',
@@ -711,7 +1100,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
         structSuper: [],
         structSub: [],
         nullref: [],
-      }
+      },
+      isUpcastOrUnrelated: ['eq', 'struct', 'structSuper', 'structSub'],
     },
     {
       source: 'structSuper',
@@ -724,7 +1114,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
         structSuper: ['structSuper', 'structSub'],
         structSub: ['structSub'],
         nullref: [],
-      }
+      },
+      isUpcastOrUnrelated: ['eq', 'struct', 'array', 'anyArray'],
     },
   ];
 
@@ -744,20 +1135,24 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
     for (let target in test.targets) {
       // Get heap type for concrete types or apply Leb128 mask on the abstract
       // type.
-      let heapType = types[target].heap_type ?? (types[target] & kLeb128Mask);
+      let targetHeapType = types[target].heap_type ?? types[target];
+      let targetTypeCode = targetHeapType & kLeb128Mask;
+      let sourceHeapType = sourceType.heapType ?? sourceType;
+      let sourceTypeCode = sourceHeapType & kLeb128Mask;
+
       builder.addFunction(`test_${test.source}_to_${target}`,
                           makeSig([wasmRefType(creatorType)], [kWasmI32]))
       .addBody([
         kExprLocalGet, 0,
         kExprCallRef, ...wasmUnsignedLeb(creatorType),
-        kGCPrefix, kExprRefTest, heapType,
+        kGCPrefix, kExprRefTest, targetTypeCode,
       ]).exportFunc();
       builder.addFunction(`test_null_${test.source}_to_${target}`,
                           makeSig([wasmRefType(creatorType)], [kWasmI32]))
       .addBody([
         kExprLocalGet, 0,
         kExprCallRef, ...wasmUnsignedLeb(creatorType),
-        kGCPrefix, kExprRefTestNull, heapType,
+        kGCPrefix, kExprRefTestNull, targetTypeCode,
       ]).exportFunc();
 
       builder.addFunction(`cast_${test.source}_to_${target}`,
@@ -765,7 +1160,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
       .addBody([
         kExprLocalGet, 0,
         kExprCallRef, ...wasmUnsignedLeb(creatorType),
-        kGCPrefix, kExprRefCast, heapType,
+        kGCPrefix, kExprRefCast, targetTypeCode,
         kExprRefIsNull, // We can't expose the cast object to JS in most cases.
       ]).exportFunc();
 
@@ -774,17 +1169,23 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
       .addBody([
         kExprLocalGet, 0,
         kExprCallRef, ...wasmUnsignedLeb(creatorType),
-        kGCPrefix, kExprRefCastNull, heapType,
+        kGCPrefix, kExprRefCastNull, targetTypeCode,
         kExprRefIsNull, // We can't expose the cast object to JS in most cases.
       ]).exportFunc();
 
+      if (test.isUpcastOrUnrelated.includes(target)) {
+        // br_on_cast only allows downcasts.
+        continue;
+      }
+
       builder.addFunction(`brOnCast_${test.source}_to_${target}`,
                           makeSig([wasmRefType(creatorType)], [kWasmI32]))
       .addBody([
-        kExprBlock, kWasmRef, heapType,
+        kExprBlock, kWasmRef, targetTypeCode,
           kExprLocalGet, 0,
           kExprCallRef, ...wasmUnsignedLeb(creatorType),
-          kGCPrefix, kExprBrOnCast, 0, heapType,
+          ...wasmBrOnCast(0,
+              wasmRefNullType(sourceHeapType), wasmRefType(targetHeapType)),
           kExprI32Const, 0,
           kExprReturn,
         kExprEnd,
@@ -797,10 +1198,11 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
       builder.addFunction(`brOnCastNull_${test.source}_to_${target}`,
                           makeSig([wasmRefType(creatorType)], [kWasmI32]))
       .addBody([
-        kExprBlock, kWasmRefNull, heapType,
+        kExprBlock, kWasmRefNull, targetTypeCode,
           kExprLocalGet, 0,
           kExprCallRef, ...wasmUnsignedLeb(creatorType),
-          kGCPrefix, kExprBrOnCastNull, 0, heapType,
+          ...wasmBrOnCast(0,
+              wasmRefNullType(sourceHeapType), wasmRefNullType(targetHeapType)),
           kExprI32Const, 0,
           kExprReturn,
         kExprEnd,
@@ -810,14 +1212,14 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
       ])
       .exportFunc();
 
-      let sourceHeapType = sourceType.heap_type ?? (sourceType & kLeb128Mask);
       builder.addFunction(`brOnCastFail_${test.source}_to_${target}`,
                           makeSig([wasmRefType(creatorType)], [kWasmI32]))
       .addBody([
-        kExprBlock, kWasmRefNull, sourceHeapType,
+        kExprBlock, kWasmRefNull, sourceTypeCode,
           kExprLocalGet, 0,
           kExprCallRef, ...wasmUnsignedLeb(creatorType),
-          kGCPrefix, kExprBrOnCastFail, 0, heapType,
+          ...wasmBrOnCastFail(0,
+              wasmRefNullType(sourceHeapType), wasmRefType(targetHeapType)),
           kExprI32Const, 0,
           kExprReturn,
         kExprEnd,
@@ -830,10 +1232,11 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
       builder.addFunction(`brOnCastFailNull_${test.source}_to_${target}`,
                           makeSig([wasmRefType(creatorType)], [kWasmI32]))
       .addBody([
-        kExprBlock, kWasmRef, sourceHeapType,
+        kExprBlock, kWasmRef, sourceTypeCode,
           kExprLocalGet, 0,
           kExprCallRef, ...wasmUnsignedLeb(creatorType),
-          kGCPrefix, kExprBrOnCastFailNull, 0, heapType,
+          ...wasmBrOnCastFail(0,
+              wasmRefNullType(sourceHeapType), wasmRefNullType(targetHeapType)),
           kExprI32Const, 0,
           kExprReturn,
         kExprEnd,
@@ -875,6 +1278,11 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
           assertTraps(kTrapIllegalCast, () => castNull(create_value));
         }
 
+        if (test.isUpcastOrUnrelated.includes(target)) {
+          // br_on_cast only allows downcasts.
+          continue;
+        }
+
         print(`Test br_on_cast: ${test.source}(${value}) -> ${target}`);
         res = wasm[`brOnCast_${test.source}_to_${target}`](create_value);
         assertEquals(validValues.includes(value) ? 1 : 0, res);
diff --git a/deps/v8/test/mjsunit/wasm/gc-deprecated-check.js b/deps/v8/test/mjsunit/wasm/gc-deprecated-check.js
new file mode 100644
index 00000000000000..0bd045b3f1def9
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/gc-deprecated-check.js
@@ -0,0 +1,27 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --wasm-disable-deprecated
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+
+(function DeprecatedRefTest() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let fctType = builder.addType(makeSig([], []));
+
+  builder.addFunction('refTest',
+      makeSig([kWasmAnyRef], [kWasmI32]))
+    .addBody([
+      kExprRefNull, kNullFuncRefCode,
+      kGCPrefix, kExprRefTestDeprecated, fctType,
+    ])
+    .exportFunc();
+
+  assertThrows(
+    () => builder.instantiate({}),
+    WebAssembly.CompileError,
+    /opcode ref.test is a deprecated gc instruction/);
+})();
diff --git a/deps/v8/test/mjsunit/wasm/gc-experimental-string-conversions.js b/deps/v8/test/mjsunit/wasm/gc-experimental-string-conversions.js
deleted file mode 100644
index 51b343b176aea7..00000000000000
--- a/deps/v8/test/mjsunit/wasm/gc-experimental-string-conversions.js
+++ /dev/null
@@ -1,68 +0,0 @@
-// Copyright 2022 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-// Flags: --experimental-wasm-gc --allow-natives-syntax
-
-d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
-
-var builder = new WasmModuleBuilder();
-
-let i16Array = builder.addArray(kWasmI16, true);
-
-builder.addFunction('getHelloArray', makeSig([], [kWasmArrayRef]))
-    .addBody([
-      ...wasmI32Const(72), ...wasmI32Const(69), ...wasmI32Const(76),
-      ...wasmI32Const(76), ...wasmI32Const(79),
-      kGCPrefix, kExprArrayNewFixed, i16Array, 5
-    ])
-    .exportFunc();
-
-builder.addFunction('getChar', makeSig([kWasmArrayRef, kWasmI32], [kWasmI32]))
-    .addBody([
-      kExprLocalGet, 0, kGCPrefix, kExprRefAsArray, kGCPrefix,
-      kExprRefCast, i16Array, kExprLocalGet, 1, kGCPrefix, kExprArrayGetS,
-      i16Array
-    ])
-    .exportFunc();
-
-const instance = builder.instantiate();
-const getHelloArray = instance.exports.getHelloArray;
-const getChar = instance.exports.getChar;
-
-assertEquals(
-    WebAssembly.experimentalConvertArrayToString(getHelloArray(), 0, 5),
-    'HELLO');
-assertEquals(
-    WebAssembly.experimentalConvertArrayToString(getHelloArray(), 1, 4),
-    'ELLO');
-assertEquals(
-    WebAssembly.experimentalConvertArrayToString(getHelloArray(), 0, 3), 'HEL');
-
-const string = 'foobar'
-const array =
-    WebAssembly.experimentalConvertStringToArray('foobar', getHelloArray());
-for (let i = 0; i < string.length; ++i) {
-  assertEquals(getChar(array, i), string.charCodeAt(i));
-}
-
-// Test calling built-ins with different amount of (invalid) arguments.
-function arrayToString() {
-  WebAssembly.experimentalConvertArrayToString(...arguments);
-}
-function stringToArray() {
-  WebAssembly.experimentalConvertStringToArray(...arguments);
-}
-
-let args = [];
-for (let i = 1; i <= 5; ++i) {
-  assertThrows(() => arrayToString(...args));
-  assertThrows(() => stringToArray(...args));
-  %PrepareFunctionForOptimization(arrayToString);
-  %PrepareFunctionForOptimization(stringToArray);
-  %OptimizeFunctionOnNextCall(arrayToString);
-  %OptimizeFunctionOnNextCall(stringToArray);
-  assertThrows(() => arrayToString(...args));
-  assertThrows(() => stringToArray(...args));
-  args.push(i);
-}
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-async-debugger.js b/deps/v8/test/mjsunit/wasm/gc-js-interop-async-debugger.js
index b7bedc01bbbe97..19ac63673cbf25 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-async-debugger.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-async-debugger.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan
 
 // The implementation of Promises currently takes a different path (a C++
 // runtime function instead of a Torque builtin) when the debugger is
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-async.js b/deps/v8/test/mjsunit/wasm/gc-js-interop-async.js
index 3b1c23d9526e99..768e275d381830 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-async.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-async.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan
 
 d8.file.execute('test/mjsunit/wasm/gc-js-interop-helpers.js');
 
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-collections.js b/deps/v8/test/mjsunit/wasm/gc-js-interop-collections.js
index 4bbf9aa248b558..037cb9cb3805e6 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-collections.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-collections.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan
 
 d8.file.execute('test/mjsunit/wasm/gc-js-interop-helpers.js');
 
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-global-constructors.js b/deps/v8/test/mjsunit/wasm/gc-js-interop-global-constructors.js
index 45214197ef0521..dcec34ebb6cab4 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-global-constructors.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-global-constructors.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan
 
 d8.file.execute('test/mjsunit/wasm/gc-js-interop-helpers.js');
 
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-helpers.js b/deps/v8/test/mjsunit/wasm/gc-js-interop-helpers.js
index 3c39fc13bceb16..163762d9b95733 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-helpers.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-helpers.js
@@ -4,6 +4,10 @@
 
 // Helpers to test interoperability of Wasm objects in JavaScript.
 
+// The following flags are required:
+// Flags: --turbofan --no-always-turbofan --experimental-wasm-gc
+// Flags: --allow-natives-syntax
+
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
 function CreateWasmObjects() {
@@ -32,22 +36,32 @@ function CreateWasmObjects() {
   };
 }
 
-function testThrowsRepeated(fn, ErrorType) {
-  %PrepareFunctionForOptimization(fn);
-  for (let i = 0; i < 5; i++) assertThrows(fn, ErrorType);
-  %OptimizeFunctionOnNextCall(fn);
-  assertThrows(fn, ErrorType);
-  // TODO(7748): This assertion doesn't hold true, as some cases run into
-  // deopt loops.
-  // assertTrue(%ActiveTierIsTurbofan(fn));
+function testThrowsRepeated(fn, ErrorType, ignoreDeopts = false) {
+  const maxRuns = 3;
+  for (let run = 0; run < maxRuns; ++run) {
+    %PrepareFunctionForOptimization(fn);
+    for (let i = 0; i < 5; i++) assertThrows(fn, ErrorType);
+    %OptimizeFunctionOnNextCall(fn);
+    assertThrows(fn, ErrorType);
+    if (isOptimized(fn) || ignoreDeopts) return;
+  }
+  assertOptimized(fn);
 }
 
-function repeated(fn) {
-  %PrepareFunctionForOptimization(fn);
-  for (let i = 0; i < 5; i++) fn();
-  %OptimizeFunctionOnNextCall(fn);
-  fn();
-  // TODO(7748): This assertion doesn't hold true, as some cases run into
-  // deopt loops.
-  // assertTrue(%ActiveTierIsTurbofan(fn));
+function repeated(fn, ignoreDeopts = false) {
+  const maxRuns = 3;
+  for (let run = 0; run < maxRuns; ++run) {
+    %PrepareFunctionForOptimization(fn);
+    for (let i = 0; i < 5; i++) fn();
+    %OptimizeFunctionOnNextCall(fn);
+    fn();
+    if (isOptimized(fn) || ignoreDeopts) return;
+  }
+  assertOptimized(fn);
 }
+
+// Prevent optimization, so that the test functions can not be inlined which
+// can cause issues in combination with `assertOptimized` and deopts in test
+// code.
+%NeverOptimizeFunction(testThrowsRepeated);
+%NeverOptimizeFunction(repeated);
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-import.mjs b/deps/v8/test/mjsunit/wasm/gc-js-interop-import.mjs
index b6266ad4e803af..ce7762ebd25041 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-import.mjs
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-import.mjs
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan
 
 import {struct, array} from 'gc-js-interop-export.mjs';
 
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-numeric.js b/deps/v8/test/mjsunit/wasm/gc-js-interop-numeric.js
index 19bb061a67bce6..2cfa852d954351 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-numeric.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-numeric.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan
 
 d8.file.execute('test/mjsunit/wasm/gc-js-interop-helpers.js');
 
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-objects.js b/deps/v8/test/mjsunit/wasm/gc-js-interop-objects.js
index 58aeb0b7a76f79..450b623bc5304c 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-objects.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-objects.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan
 
 d8.file.execute('test/mjsunit/wasm/gc-js-interop-helpers.js');
 
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop-wasm.js b/deps/v8/test/mjsunit/wasm/gc-js-interop-wasm.js
index 82e365ba2633f7..5a0849b9d0feec 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop-wasm.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop-wasm.js
@@ -3,7 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --wasm-test-streaming
-// Flags: --allow-natives-syntax
+// Flags: --allow-natives-syntax --turbofan --no-always-turbofan
 
 d8.file.execute('test/mjsunit/wasm/gc-js-interop-helpers.js');
 
@@ -70,9 +70,10 @@ for (const wasm_obj of [struct, array]) {
   testThrowsRepeated(
       () => new WebAssembly.Tag({parameters: [wasm_obj]}), TypeError);
 
-  let tag = new WebAssembly.Tag({parameters: ['structref']});
+  let tag = new WebAssembly.Tag({
+    parameters: [wasm_obj == struct ? 'structref' : 'arrayref']});
   testThrowsRepeated(() => new WebAssembly.Exception(wasm_obj), TypeError);
-  repeated(() => new WebAssembly.Exception(tag, wasm_obj));
+  testThrowsRepeated(() => new WebAssembly.Exception(tag, wasm_obj), TypeError);
   repeated(() => new WebAssembly.Exception(tag, [wasm_obj]));
   let exception = new WebAssembly.Exception(tag, [wasm_obj]);
   testThrowsRepeated(() => exception.is(wasm_obj), TypeError);
diff --git a/deps/v8/test/mjsunit/wasm/gc-js-interop.js b/deps/v8/test/mjsunit/wasm/gc-js-interop.js
index bdbb720f838a29..d44d257602e509 100644
--- a/deps/v8/test/mjsunit/wasm/gc-js-interop.js
+++ b/deps/v8/test/mjsunit/wasm/gc-js-interop.js
@@ -3,9 +3,13 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax
+// Flags: --turbofan --no-always-turbofan
 
 d8.file.execute('test/mjsunit/wasm/gc-js-interop-helpers.js');
 
+// TODO(14034): Some operations can still trigger a deopt loop.
+const ignoreDeopts = true;
+
 let {struct, array} = CreateWasmObjects();
 for (const wasm_obj of [struct, array]) {
   repeated(() => assertSame(undefined, wasm_obj.foo));
@@ -54,7 +58,9 @@ for (const wasm_obj of [struct, array]) {
   repeated(() => assertSame(undefined, wasm_obj?.property));
 
   repeated(() => assertEquals(undefined, void wasm_obj));
-  testThrowsRepeated(() => 2 == wasm_obj, TypeError);
+  // These deopt loops can also be triggered with JS only code, e.g.
+  // `2 == {valueOf: () => +2n}`.
+  testThrowsRepeated(() => 2 == wasm_obj, TypeError, ignoreDeopts);
   repeated(() => assertFalse(2 === wasm_obj));
   repeated(() => assertFalse({} === wasm_obj));
   repeated(() => assertTrue(wasm_obj == wasm_obj));
@@ -63,9 +69,11 @@ for (const wasm_obj of [struct, array]) {
   repeated(() => assertFalse(wasm_obj !== wasm_obj));
   repeated(() => assertFalse(struct == array));
   repeated(() => assertTrue(struct != array));
-  testThrowsRepeated(() => wasm_obj < wasm_obj, TypeError);
-  testThrowsRepeated(() => wasm_obj <= wasm_obj, TypeError);
-  testThrowsRepeated(() => wasm_obj >= wasm_obj, TypeError);
+  // JS Symbols also have the issue of triggering deopt loops on relational
+  // comparisons, e.g. `2 < Symbol("test")`.
+  testThrowsRepeated(() => wasm_obj < wasm_obj, TypeError, ignoreDeopts);
+  testThrowsRepeated(() => wasm_obj <= wasm_obj, TypeError, ignoreDeopts);
+  testThrowsRepeated(() => wasm_obj >= wasm_obj, TypeError, ignoreDeopts);
 
   testThrowsRepeated(() => { let [] = wasm_obj; }, TypeError);
   testThrowsRepeated(() => { let [a, b] = wasm_obj; }, TypeError);
diff --git a/deps/v8/test/mjsunit/wasm/gc-nominal.js b/deps/v8/test/mjsunit/wasm/gc-nominal.js
index 367d2044d15962..8b3df095f20d7e 100644
--- a/deps/v8/test/mjsunit/wasm/gc-nominal.js
+++ b/deps/v8/test/mjsunit/wasm/gc-nominal.js
@@ -39,7 +39,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
   builder.addStruct([]);
-  for (let i = 0; i < 32; i++) builder.addStruct([], i);
+  for (let i = 0; i < 64; i++) builder.addStruct([], i);
   assertThrows(
       () => builder.instantiate(), WebAssembly.CompileError,
       /subtyping depth is greater than allowed/);
diff --git a/deps/v8/test/mjsunit/wasm/gc-null-traps.js b/deps/v8/test/mjsunit/wasm/gc-null-traps.js
index d56b60a4b39a70..b2a29e200c52dc 100644
--- a/deps/v8/test/mjsunit/wasm/gc-null-traps.js
+++ b/deps/v8/test/mjsunit/wasm/gc-null-traps.js
@@ -140,6 +140,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertTraps(kTrapNullDereference, () => instance.exports.structRefGet(null));
   assertTraps(kTrapNullDereference,
               () => instance.exports.structRefSet(null, null));
+
   assertTraps(kTrapNullDereference, () => instance.exports.arrayGet(null, 0));
   assertTraps(kTrapNullDereference,
               () => instance.exports.arrayGet(null, 2000000000));
diff --git a/deps/v8/test/mjsunit/wasm/gc-optimizations.js b/deps/v8/test/mjsunit/wasm/gc-optimizations.js
index faa6822b107e1c..ca3bbb4b2263ae 100644
--- a/deps/v8/test/mjsunit/wasm/gc-optimizations.js
+++ b/deps/v8/test/mjsunit/wasm/gc-optimizations.js
@@ -3,7 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --no-liftoff --no-wasm-lazy-compilation
-// Flags: --no-wasm-inlining --no-wasm-speculative-inlining
+// Flags: --no-experimental-wasm-inlining
 
 // This tests are meant to examine if Turbofan CsaLoadElimination works
 // correctly for wasm. The TurboFan graphs can be examined with --trace-turbo.
@@ -561,8 +561,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
       // local.get 0 is known to be null until end of block.
       kExprLocalGet, 0,
       // This cast is a no-op and shold be optimized away.
-      // TODO(7748): Replace with "ref.cast null".
-      kGCPrefix, kExprRefCastDeprecated, struct_b,
+      kGCPrefix, kExprRefCastNull, struct_b,
       kExprEnd,
       kExprRefIsNull,
     ]);
diff --git a/deps/v8/test/mjsunit/wasm/gc-ref-eq.js b/deps/v8/test/mjsunit/wasm/gc-ref-eq.js
new file mode 100644
index 00000000000000..eb89970ee3ba7d
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/gc-ref-eq.js
@@ -0,0 +1,29 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+(function TestRefEq() {
+  let builder = new WasmModuleBuilder();
+  let array = builder.addArray(wasmRefType(kWasmEqRef), true);
+
+  builder.addFunction("equal", makeSig([], [kWasmI32]))
+    .addBody([
+      kExprI32Const, 0,
+      kGCPrefix, kExprI31New,
+      kExprI32Const, 0,
+      kGCPrefix, kExprI31New,
+      kGCPrefix, kExprArrayNewFixed, array, 1,
+      kExprI32Const, 0,
+      kGCPrefix, kExprArrayGet, array,
+      kExprRefEq
+    ])
+    .exportFunc()
+
+  let instance = builder.instantiate();
+
+  assertEquals(1, instance.exports.equal());
+})();
diff --git a/deps/v8/test/mjsunit/wasm/graceful_shutdown.js b/deps/v8/test/mjsunit/wasm/graceful_shutdown.js
index 4645a66217eeeb..af985b1248482d 100644
--- a/deps/v8/test/mjsunit/wasm/graceful_shutdown.js
+++ b/deps/v8/test/mjsunit/wasm/graceful_shutdown.js
@@ -10,7 +10,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
   // Create a big module.
   var builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
   for (i = 0; i < 100; i++) {
     builder.addFunction("sub" + i, kSig_i_i)
       .addBody([                // --
diff --git a/deps/v8/test/mjsunit/wasm/graceful_shutdown_during_tierup.js b/deps/v8/test/mjsunit/wasm/graceful_shutdown_during_tierup.js
index 7c115caa6c7b39..d17ac9e43113cc 100644
--- a/deps/v8/test/mjsunit/wasm/graceful_shutdown_during_tierup.js
+++ b/deps/v8/test/mjsunit/wasm/graceful_shutdown_during_tierup.js
@@ -10,7 +10,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
   // Create a big module.
   var builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
   for (i = 0; i < 100; i++) {
     builder.addFunction("sub" + i, kSig_i_i)
       .addBody([                // --
diff --git a/deps/v8/test/mjsunit/wasm/grow-huge-memory.js b/deps/v8/test/mjsunit/wasm/grow-huge-memory.js
index 75d2ab6faf4c0f..7eae25ea66bb27 100644
--- a/deps/v8/test/mjsunit/wasm/grow-huge-memory.js
+++ b/deps/v8/test/mjsunit/wasm/grow-huge-memory.js
@@ -21,7 +21,8 @@ function GetMemoryPages(memory) {
 
 (function TestGrowFromWasm() {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(200, 50000, true);
+  builder.addMemory(200, 50000);
+  builder.exportMemoryAs("memory");
   builder.addFunction("grow", kSig_i_v)
     .addBody([
       ...wasmI32Const(40000),        // Number of pages to grow by.
diff --git a/deps/v8/test/mjsunit/wasm/grow-memory-detaching.js b/deps/v8/test/mjsunit/wasm/grow-memory-detaching.js
index 43e1b1bc9f09aa..cca2eaf7a32840 100644
--- a/deps/v8/test/mjsunit/wasm/grow-memory-detaching.js
+++ b/deps/v8/test/mjsunit/wasm/grow-memory-detaching.js
@@ -8,7 +8,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
 let module = (() => {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, undefined, false);
+  builder.addMemory(1, undefined);
   builder.addFunction("grow_memory", kSig_i_i)
               .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
     .exportFunc();
diff --git a/deps/v8/test/mjsunit/wasm/grow-memory-in-branch.js b/deps/v8/test/mjsunit/wasm/grow-memory-in-branch.js
index c423352bbb633a..04b759a355366c 100644
--- a/deps/v8/test/mjsunit/wasm/grow-memory-in-branch.js
+++ b/deps/v8/test/mjsunit/wasm/grow-memory-in-branch.js
@@ -11,7 +11,7 @@ var maximumMemoryPages = 5;
 
 function generateBuilder() {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   builder.addFunction('load', kSig_i_i)
       .addBody([kExprLocalGet, 0, kExprI32LoadMem, 0, 0])
       .exportFunc();
diff --git a/deps/v8/test/mjsunit/wasm/grow-memory-in-call.js b/deps/v8/test/mjsunit/wasm/grow-memory-in-call.js
index b5c8109eca5b5e..e3ee86d691bf6f 100644
--- a/deps/v8/test/mjsunit/wasm/grow-memory-in-call.js
+++ b/deps/v8/test/mjsunit/wasm/grow-memory-in-call.js
@@ -17,7 +17,7 @@ print('=== grow_memory in direct calls ===');
 (function TestMemoryGrowInFunction() {
   print('TestMemoryGrowInFunction ...');
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_i_i)
           .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
@@ -44,7 +44,7 @@ print('=== grow_memory in direct calls ===');
   print('TestMemoryGrowAndAccessInFunction ...');
   let index = 2 * kPageSize - 4;
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_i_i)
           .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
@@ -81,7 +81,7 @@ print('=== grow_memory in direct calls ===');
   let newValue = 42;
   let deltaPages = 1;
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_v_v)
           .addBody([
@@ -115,7 +115,7 @@ print('=== grow_memory in direct calls ===');
 (function TestMemoryGrowInFunctionInsideLoop() {
   print('TestMemoryGrowInFunctionInsideLoop ...');
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_i_i)
           .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
@@ -158,7 +158,7 @@ print('=== grow_memory in direct calls ===');
 (function TestMemoryGrowAndStoreInFunctionInsideLoop() {
   print('TestMemoryGrowAndStoreInFunctionInsideLoop ...');
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   builder.addFunction('store', kSig_i_ii)
       .addBody([
         kExprLocalGet, 0, kExprLocalGet, 1, kExprI32StoreMem, 0, 0,
@@ -222,7 +222,7 @@ print('\n=== grow_memory in indirect calls ===');
 (function TestMemoryGrowInIndirectCall() {
   print('TestMemoryGrowInIndirectCall ...');
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_i_i)
           .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
@@ -252,7 +252,7 @@ print('\n=== grow_memory in indirect calls ===');
   print('TestMemoryGrowAndAccessInIndirectCall ...');
   let index = 2 * kPageSize - 4;
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_i_i)
           .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
@@ -293,7 +293,7 @@ print('\n=== grow_memory in indirect calls ===');
   let newValue = 42;
   let deltaPages = 1;
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_v_v)
           .addBody([
@@ -329,7 +329,7 @@ print('\n=== grow_memory in indirect calls ===');
 (function TestMemoryGrowInIndirectCallInsideLoop() {
   print('TestMemoryGrowInIndirectCallInsideLoop ...');
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_i_i)
           .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
@@ -375,7 +375,7 @@ print('\n=== grow_memory in indirect calls ===');
   print('TestMemoryGrowAndStoreInIndirectCallInsideLoop ...');
   let builder = new WasmModuleBuilder();
   let deltaPages = 1;
-  builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+  builder.addMemory(initialMemoryPages, maximumMemoryPages);
   let kGrowFunction =
       builder.addFunction('grow', kSig_i_i)
           .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
diff --git a/deps/v8/test/mjsunit/wasm/grow-memory-in-loop.js b/deps/v8/test/mjsunit/wasm/grow-memory-in-loop.js
index 6cdc4970646778..918259740839ff 100644
--- a/deps/v8/test/mjsunit/wasm/grow-memory-in-loop.js
+++ b/deps/v8/test/mjsunit/wasm/grow-memory-in-loop.js
@@ -11,7 +11,7 @@ let maximumPages = 6;
 
 function generateBuilder() {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(initialPages, maximumPages, true);
+  builder.addMemory(initialPages, maximumPages);
   builder.addFunction('store', kSig_i_ii)
       .addBody([
         kExprLocalGet, 0, kExprLocalGet, 1, kExprI32StoreMem, 0, 0,
diff --git a/deps/v8/test/mjsunit/wasm/grow-memory.js b/deps/v8/test/mjsunit/wasm/grow-memory.js
index 399d1609d49fd3..0f66836a2257d6 100644
--- a/deps/v8/test/mjsunit/wasm/grow-memory.js
+++ b/deps/v8/test/mjsunit/wasm/grow-memory.js
@@ -46,7 +46,7 @@ var kV8MaxPages = 65536;
 function testMemoryGrowReadWriteBase(size, load_fn, store_fn) {
   // size is the number of bytes for load and stores.
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(1, undefined, false);
+  builder.addMemory(1, undefined);
   var module = builder.instantiate();
   var offset;
   var load = module.exports[load_fn];
@@ -127,7 +127,7 @@ function testMemoryGrowReadWriteBase(size, load_fn, store_fn) {
 (function testMemoryGrowZeroInitialSize() {
   print(arguments.callee.name);
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(0, undefined, false);
+  builder.addMemory(0, undefined);
   var module = builder.instantiate();
   var offset;
   function peek() { return module.exports.load(offset); }
@@ -166,7 +166,7 @@ function testMemoryGrowReadWriteBase(size, load_fn, store_fn) {
 
 function testMemoryGrowZeroInitialSizeBase(size, load_fn, store_fn) {
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(0, undefined, false);
+  builder.addMemory(0, undefined);
   var module = builder.instantiate();
   var offset;
   var load = module.exports[load_fn];
@@ -215,7 +215,7 @@ function testMemoryGrowZeroInitialSizeBase(size, load_fn, store_fn) {
 (function testMemoryGrowTrapMaxPagesZeroInitialMemory() {
   print(arguments.callee.name);
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(0, undefined, false);
+  builder.addMemory(0, undefined);
   var module = builder.instantiate();
   function growMem(pages) { return module.exports.grow_memory(pages); }
   assertEquals(-1, growMem(kV8MaxPages + 1));
@@ -224,7 +224,7 @@ function testMemoryGrowZeroInitialSizeBase(size, load_fn, store_fn) {
 (function testMemoryGrowTrapMaxPages() {
   print(arguments.callee.name);
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   var module = builder.instantiate();
   function growMem(pages) { return module.exports.grow_memory(pages); }
   assertEquals(-1, growMem(kV8MaxPages));
@@ -233,7 +233,7 @@ function testMemoryGrowZeroInitialSizeBase(size, load_fn, store_fn) {
 (function testMemoryGrowTrapsWithNonSmiInput() {
   print(arguments.callee.name);
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(0, undefined, false);
+  builder.addMemory(0, undefined);
   var module = builder.instantiate();
   function growMem(pages) { return module.exports.grow_memory(pages); }
   // The parameter of grow_memory is unsigned. Therefore -1 stands for
@@ -244,7 +244,7 @@ function testMemoryGrowZeroInitialSizeBase(size, load_fn, store_fn) {
 (function testMemoryGrowCurrentMemory() {
   print(arguments.callee.name);
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(1, undefined, false);
+  builder.addMemory(1, undefined);
   builder.addFunction("memory_size", kSig_i_v)
       .addBody([kExprMemorySize, kMemoryZero])
       .exportFunc();
@@ -258,7 +258,7 @@ function testMemoryGrowZeroInitialSizeBase(size, load_fn, store_fn) {
 
 function testMemoryGrowPreservesDataMemOpBase(size, load_fn, store_fn) {
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(1, undefined, false);
+  builder.addMemory(1, undefined);
   var module = builder.instantiate();
   var offset;
   var load = module.exports[load_fn];
@@ -312,7 +312,7 @@ function testMemoryGrowPreservesDataMemOpBase(size, load_fn, store_fn) {
 (function testMemoryGrowOutOfBoundsOffset() {
   print(arguments.callee.name);
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(1, undefined, false);
+  builder.addMemory(1, undefined);
   var module = builder.instantiate();
   var offset, val;
   function peek() { return module.exports.load(offset); }
@@ -348,7 +348,7 @@ function testMemoryGrowPreservesDataMemOpBase(size, load_fn, store_fn) {
 (function testMemoryGrowOutOfBoundsOffset2() {
   print(arguments.callee.name);
   var builder = new WasmModuleBuilder();
-  builder.addMemory(16, 128, false);
+  builder.addMemory(16, 128);
   builder.addFunction("main", kSig_v_v)
       .addBody([
           kExprI32Const, 20,
@@ -364,7 +364,7 @@ function testMemoryGrowPreservesDataMemOpBase(size, load_fn, store_fn) {
 (function testMemoryGrowDeclaredMaxTraps() {
   print(arguments.callee.name);
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(1, 16, false);
+  builder.addMemory(1, 16);
   var module = builder.instantiate();
   function growMem(pages) { return module.exports.grow_memory(pages); }
   assertEquals(1, growMem(5));
@@ -377,7 +377,7 @@ function testMemoryGrowPreservesDataMemOpBase(size, load_fn, store_fn) {
   // This test checks that grow_memory does not grow past the internally
   // defined maximum memory size.
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(1, kSpecMaxPages, false);
+  builder.addMemory(1, kSpecMaxPages);
   var module = builder.instantiate();
   function growMem(pages) { return module.exports.grow_memory(pages); }
   assertEquals(1, growMem(20));
@@ -387,7 +387,7 @@ function testMemoryGrowPreservesDataMemOpBase(size, load_fn, store_fn) {
 (function testMemoryGrow4Gb() {
   print(arguments.callee.name);
   var builder = genMemoryGrowBuilder();
-  builder.addMemory(1, undefined, false);
+  builder.addMemory(1, undefined);
   var module = builder.instantiate();
   var offset, val;
   function peek() { return module.exports.load(offset); }
diff --git a/deps/v8/test/mjsunit/wasm/huge-memory.js b/deps/v8/test/mjsunit/wasm/huge-memory.js
index c260deb7b89e1d..a69facb5f314d1 100644
--- a/deps/v8/test/mjsunit/wasm/huge-memory.js
+++ b/deps/v8/test/mjsunit/wasm/huge-memory.js
@@ -15,7 +15,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
   const num_pages = 49152;  // 3GB
 
-  builder.addMemory(num_pages, num_pages, true);
+  builder.addMemory(num_pages, num_pages);
   builder.addFunction("geti", kSig_i_ii)
     .addBody([
       kExprLocalGet, 0,
@@ -40,7 +40,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
   const num_pages = 49152;  // 3GB
 
-  builder.addMemory(num_pages, num_pages, true);
+  builder.addMemory(num_pages, num_pages);
   builder.addFunction("geti", kSig_i_v)
     .addBody([
       kExprI32Const, 0x80, 0x80, 0x80, 0x80, 0x7A, // 0xA0000000, 2.5GB
@@ -61,7 +61,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
   const num_pages = 49152;  // 3GB
 
-  builder.addMemory(num_pages, num_pages, true);
+  builder.addMemory(num_pages, num_pages);
   builder.addFunction("geti", kSig_i_v)
     .addBody([
       kExprI32Const, 0x80, 0x80, 0x80, 0x80, 0x7E, // 0xE0000000, 3.5GB
diff --git a/deps/v8/test/mjsunit/wasm/import-memory.js b/deps/v8/test/mjsunit/wasm/import-memory.js
index 892b615efeeb55..f1b807f1ccf6c0 100644
--- a/deps/v8/test/mjsunit/wasm/import-memory.js
+++ b/deps/v8/test/mjsunit/wasm/import-memory.js
@@ -47,7 +47,7 @@ var kV8MaxPages = 65536;
   var i1;
   {
     let builder = new WasmModuleBuilder();
-    builder.addMemory(1, 1, false);
+    builder.addMemory(1, 1);
     builder.exportMemoryAs("exported_mem");
     builder.addFunction("foo", kSig_i_i)
       .addBody([
@@ -205,7 +205,7 @@ var kV8MaxPages = 65536;
   var exp_instance;
   {
     let builder = new WasmModuleBuilder();
-    builder.addMemory(initial_size, maximum_size, true);
+    builder.addMemory(initial_size, maximum_size);
     builder.exportMemoryAs("exported_mem");
     exp_instance = builder.instantiate();
   }
@@ -331,7 +331,7 @@ var kV8MaxPages = 65536;
   var instance;
   {
     let builder = new WasmModuleBuilder();
-    builder.addMemory(1, 11, true);
+    builder.addMemory(1, 11);
     builder.exportMemoryAs("exported_mem");
     builder.addFunction("mem_size", kSig_i_v)
       .addBody([kExprMemorySize, kMemoryZero])
@@ -376,7 +376,7 @@ var kV8MaxPages = 65536;
   var instance_1, instance_2;
   {
     let builder = new WasmModuleBuilder();
-    builder.addMemory(1, kSpecMaxPages, true);
+    builder.addMemory(1, kSpecMaxPages);
     builder.exportMemoryAs("exported_mem");
     builder.addFunction("grow", kSig_i_i)
       .addBody([kExprLocalGet, 0, kExprMemoryGrow, kMemoryZero])
@@ -401,7 +401,7 @@ var kV8MaxPages = 65536;
 (function TestExportGrow() {
   print("TestExportGrow");
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, 5, true);
+  builder.addMemory(1, 5);
   builder.exportMemoryAs("exported_mem");
   builder.addFunction("mem_size", kSig_i_v)
     .addBody([kExprMemorySize, kMemoryZero])
diff --git a/deps/v8/test/mjsunit/wasm/import-table.js b/deps/v8/test/mjsunit/wasm/import-table.js
index b14d85f93d6551..a34262c67e2518 100644
--- a/deps/v8/test/mjsunit/wasm/import-table.js
+++ b/deps/v8/test/mjsunit/wasm/import-table.js
@@ -180,7 +180,7 @@ function addConstFuncUsingMemory(builder, val) {
     builder.address = 8;
     let signums = addSigs(builder, 1);
 
-    builder.addMemory(1, 1, false);
+    builder.addMemory(1, 1);
     builder.addImportedTable("m", "table", kTableSize, kTableSize);
     let f13 = addConstFuncUsingMemory(builder, 13);
     let call = builder.addFunction("call", kSig_i_i)
@@ -203,7 +203,7 @@ function addConstFuncUsingMemory(builder, val) {
     builder.address = 8;
     let signums = addSigs(builder, 4);  // ensure different sigids
 
-    builder.addMemory(1, 1, false);
+    builder.addMemory(1, 1);
     builder.addImportedTable("m", "table", kTableSize, kTableSize);
     let f13 = builder.addImport("m", "f13", kSig_i_v);
     let f19 = builder.addImport("m", "f19", kSig_i_v);
diff --git a/deps/v8/test/mjsunit/wasm/imported-strings.js b/deps/v8/test/mjsunit/wasm/imported-strings.js
new file mode 100644
index 00000000000000..87062a34c9bc1e
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/imported-strings.js
@@ -0,0 +1,799 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-imported-strings --experimental-wasm-gc
+// For {isOneByteString}:
+// Flags: --expose-externalize-string
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+let kRefExtern = wasmRefType(kWasmExternRef);
+
+// We use "r" for nullable "externref", and "e" for non-nullable "ref extern".
+
+let kSig_e_ii = makeSig([kWasmI32, kWasmI32], [kRefExtern]);
+let kSig_e_v = makeSig([], [kRefExtern]);
+let kSig_i_ri = makeSig([kWasmExternRef, kWasmI32], [kWasmI32]);
+let kSig_i_rii = makeSig([kWasmExternRef, kWasmI32, kWasmI32], [kWasmI32]);
+let kSig_i_rr = makeSig([kWasmExternRef, kWasmExternRef], [kWasmI32]);
+let kSig_i_riii = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32],
+                          [kWasmI32]);
+let kSig_ii_riii = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32],
+                           [kWasmI32, kWasmI32]);
+let kSig_e_i = makeSig([kWasmI32], [kRefExtern]);
+let kSig_e_rii = makeSig([kWasmExternRef, kWasmI32, kWasmI32],
+                         [kRefExtern]);
+let kSig_e_rr = makeSig([kWasmExternRef, kWasmExternRef], [kRefExtern]);
+let kSig_e_r = makeSig([kWasmExternRef], [kRefExtern]);
+
+let interestingStrings = [
+  '',
+  'ascii',
+  'latin\xa91',        // Latin-1.
+  '2 \ucccc b',        // Two-byte.
+  'a \ud800\udc00 b',  // Proper surrogate pair.
+  'a \ud800 b',        // Lone lead surrogate.
+  'a \udc00 b',        // Lone trail surrogate.
+  '\ud800 bc',         // Lone lead surrogate at the start.
+  '\udc00 bc',         // Lone trail surrogate at the start.
+  'ab \ud800',         // Lone lead surrogate at the end.
+  'ab \udc00',         // Lone trail surrogate at the end.
+  'a \udc00\ud800 b',  // Swapped surrogate pair.
+];
+
+function IsSurrogate(codepoint) {
+  return 0xD800 <= codepoint && codepoint <= 0xDFFF
+}
+
+function HasIsolatedSurrogate(str) {
+  for (let codepoint of str) {
+    let value = codepoint.codePointAt(0);
+    if (IsSurrogate(value)) return true;
+  }
+  return false;
+}
+
+function encodeWtf16LE(str) {
+  // String iterator coalesces surrogate pairs.
+  let out = [];
+  for (let i = 0; i < str.length; i++) {
+    codeunit = str.charCodeAt(i);
+    out.push(codeunit & 0xff)
+    out.push(codeunit >> 8);
+  }
+  return out;
+}
+
+let kArrayI16;
+let kArrayI8;
+let kStringFromWtf16Array;
+let kStringFromWtf8Array;
+let kStringToWtf16Array;
+let kStringFromCharCode;
+let kStringFromCodePoint;
+let kStringCharCodeAt;
+let kStringCodePointAt;
+let kStringLength;
+let kStringConcat;
+let kStringSubstring;
+let kStringEquals;
+let kStringCompare;
+
+function MakeBuilder() {
+  let builder = new WasmModuleBuilder();
+  kArrayI16 = builder.addArray(kWasmI16, true);
+  kArrayI8 = builder.addArray(kWasmI8, true);
+  let arrayref = wasmRefNullType(kArrayI16);
+  let array8ref = wasmRefNullType(kArrayI8);
+
+  kStringFromWtf16Array = builder.addImport(
+      'String', 'fromWtf16Array',
+      makeSig([arrayref, kWasmI32, kWasmI32], [kRefExtern]));
+  kStringFromWtf8Array = builder.addImport(
+      'String', 'fromWtf8Array',
+      makeSig([array8ref, kWasmI32, kWasmI32], [kRefExtern]));
+  kStringToWtf16Array = builder.addImport(
+      'String', 'toWtf16Array',
+      makeSig([kWasmExternRef, arrayref, kWasmI32], [kWasmI32]));
+  kStringFromCharCode = builder.addImport('String', 'fromCharCode', kSig_e_i);
+  kStringFromCodePoint = builder.addImport('String', 'fromCodePoint', kSig_e_i);
+  kStringCharCodeAt = builder.addImport('String', 'charCodeAt', kSig_i_ri);
+  kStringCodePointAt = builder.addImport('String', 'codePointAt', kSig_i_ri);
+  kStringLength = builder.addImport('String', 'length', kSig_i_r);
+  kStringConcat = builder.addImport('String', 'concat', kSig_e_rr);
+  kStringSubstring = builder.addImport('String', 'substring', kSig_e_rii);
+  kStringEquals = builder.addImport('String', 'equals', kSig_i_rr);
+  kStringCompare = builder.addImport('String', 'compare', kSig_i_rr);
+
+  return builder;
+}
+
+let kImports = {
+  String: WebAssembly.String,
+  strings: interestingStrings,
+};
+
+(function TestStringConst() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+  for (let i = 0; i < interestingStrings.length; i++) {
+    builder.addImportedGlobal('strings', i.toString(), kRefExtern, false);
+    builder.addFunction("string_const" + i, kSig_e_v).exportFunc()
+      .addBody([kExprGlobalGet, i]);
+  }
+  for (let i = 0; i < interestingStrings.length; i++) {
+    builder.addGlobal(kRefExtern, false, [kExprGlobalGet, i])
+      .exportAs("global" + i);
+  }
+  let instance = builder.instantiate(kImports);
+  for (let [i, str] of interestingStrings.entries()) {
+    assertEquals(str, instance.exports["string_const" + i]());
+    assertEquals(str, instance.exports["global" + i].value);
+  }
+})();
+
+(function TestStringLength() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+
+  builder.addFunction("string_length", kSig_i_r)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprCallFunction, kStringLength,
+    ]);
+
+  builder.addFunction("string_length_null", kSig_i_v)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprCallFunction, kStringLength,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  for (let str of interestingStrings) {
+    assertEquals(str.length, instance.exports.string_length(str));
+  }
+
+  assertThrows(() => instance.exports.string_length(null),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.string_length_null(),
+               WebAssembly.RuntimeError, "illegal cast");
+})();
+
+(function TestStringConcat() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+
+  builder.addFunction("concat", kSig_e_rr)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprCallFunction, kStringConcat,
+    ]);
+
+  builder.addFunction("concat_null_head", kSig_e_r)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprLocalGet, 0,
+      kExprCallFunction, kStringConcat,
+    ]);
+
+  builder.addFunction("concat_null_tail", kSig_e_r)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprRefNull, kExternRefCode,
+      kExprCallFunction, kStringConcat,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+
+  for (let head of interestingStrings) {
+    for (let tail of interestingStrings) {
+      assertEquals(head + tail, instance.exports.concat(head, tail));
+    }
+  }
+
+  assertThrows(() => instance.exports.concat(null, "hey"),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.concat('hey', null),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.concat_null_head("hey"),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.concat_null_tail("hey"),
+               WebAssembly.RuntimeError, "illegal cast");
+})();
+
+(function TestStringEq() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+
+  builder.addFunction("eq", kSig_i_rr)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprCallFunction, kStringEquals,
+    ]);
+
+  builder.addFunction("eq_null_a", kSig_i_r)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprLocalGet, 0,
+      kExprCallFunction, kStringEquals,
+    ]);
+
+  builder.addFunction("eq_null_b", kSig_i_r)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprRefNull, kExternRefCode,
+      kExprCallFunction, kStringEquals,
+    ]);
+
+  builder.addFunction("eq_both_null", kSig_i_v)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprRefNull, kExternRefCode,
+      kExprCallFunction, kStringEquals,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+
+  for (let head of interestingStrings) {
+    for (let tail of interestingStrings) {
+      let result = (head == tail) | 0;
+      assertEquals(result, instance.exports.eq(head, tail));
+      assertEquals(result, instance.exports.eq(head + head, tail + tail));
+    }
+    assertEquals(0, instance.exports.eq_null_a(head))
+    assertEquals(0, instance.exports.eq(null, head))
+    assertEquals(0, instance.exports.eq(head, null))
+  }
+
+  assertEquals(1, instance.exports.eq_both_null());
+  assertEquals(1, instance.exports.eq(null, null));
+})();
+
+(function TestStringViewWtf16() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+
+  builder.addFunction("get_codeunit", kSig_i_ri)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprCallFunction, kStringCharCodeAt,
+    ]);
+
+  builder.addFunction("get_codeunit_null", kSig_i_v)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprI32Const, 0,
+      kExprCallFunction, kStringCharCodeAt,
+    ]);
+
+  builder.addFunction("get_codepoint", kSig_i_ri)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprCallFunction, kStringCodePointAt,
+    ]);
+
+  builder.addFunction("get_codepoint_null", kSig_i_v)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprI32Const, 0,
+      kExprCallFunction, kStringCodePointAt,
+    ]);
+
+  builder.addFunction("slice", kSig_e_rii)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprLocalGet, 2,
+      kExprCallFunction, kStringSubstring,
+    ]);
+
+  builder.addFunction("slice_null", kSig_e_v)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprI32Const, 0,
+      kExprI32Const, 0,
+      kExprCallFunction, kStringSubstring,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  for (let str of interestingStrings) {
+    for (let i = 0; i < str.length; i++) {
+      assertEquals(str.charCodeAt(i),
+                   instance.exports.get_codeunit(str, i));
+      assertEquals(str.codePointAt(i),
+                   instance.exports.get_codepoint(str, i));
+    }
+    assertEquals(str, instance.exports.slice(str, 0, -1));
+  }
+
+  assertEquals("", instance.exports.slice("foo", 0, 0));
+  assertEquals("f", instance.exports.slice("foo", 0, 1));
+  assertEquals("fo", instance.exports.slice("foo", 0, 2));
+  assertEquals("foo", instance.exports.slice("foo", 0, 3));
+  assertEquals("foo", instance.exports.slice("foo", 0, 4));
+  assertEquals("o", instance.exports.slice("foo", 1, 2));
+  assertEquals("oo", instance.exports.slice("foo", 1, 3));
+  assertEquals("oo", instance.exports.slice("foo", 1, 100));
+  assertEquals("", instance.exports.slice("foo", 1, 0));
+  assertEquals("", instance.exports.slice("foo", 3, 4));
+  assertEquals("foo", instance.exports.slice("foo", 0, -1));
+  assertEquals("", instance.exports.slice("foo", -1, 1));
+
+  assertThrows(() => instance.exports.get_codeunit(null, 0),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.get_codeunit_null(),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.get_codeunit("", 0),
+               WebAssembly.RuntimeError, "string offset out of bounds");
+  assertThrows(() => instance.exports.get_codepoint(null, 0),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.get_codepoint_null(),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.get_codepoint("", 0),
+               WebAssembly.RuntimeError, "string offset out of bounds");
+  assertThrows(() => instance.exports.slice(null, 0, 0),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.slice_null(),
+               WebAssembly.RuntimeError, "illegal cast");
+
+  // Cover runtime code path for long slices.
+  const prefix = "a".repeat(10);
+  const slice = "x".repeat(40);
+  const suffix = "b".repeat(40);
+  const input = prefix + slice + suffix;
+  const start = prefix.length;
+  const end = start + slice.length;
+  assertEquals(slice, instance.exports.slice(input, start, end));
+
+  // Check that we create one-byte substrings when possible.
+  let onebyte = instance.exports.slice("\u1234abcABCDE", 1, 4);
+  assertEquals("abc", onebyte);
+  assertTrue(isOneByteString(onebyte));
+
+  // Check that the CodeStubAssembler implementation also creates one-byte
+  // substrings.
+  onebyte = instance.exports.slice("\u1234abcA", 1, 4);
+  assertEquals("abc", onebyte);
+  assertTrue(isOneByteString(onebyte));
+  // Cover the code path that checks 8 characters at a time.
+  onebyte = instance.exports.slice("\u1234abcdefgh\u1234", 1, 9);
+  assertEquals("abcdefgh", onebyte);  // Exactly 8 characters.
+  assertTrue(isOneByteString(onebyte));
+  onebyte = instance.exports.slice("\u1234abcdefghij\u1234", 1, 11);
+  assertEquals("abcdefghij", onebyte);  // Longer than 8.
+  assertTrue(isOneByteString(onebyte));
+
+  // Check that the runtime code path also creates one-byte substrings.
+  assertTrue(isOneByteString(
+      instance.exports.slice(input + "\u1234", start, end)));
+})();
+
+(function TestStringCompare() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+
+  builder.addFunction("compare", kSig_i_rr)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprCallFunction, kStringCompare,
+    ]);
+
+  builder.addFunction("compare_null_a", kSig_i_r)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprLocalGet, 0,
+      kExprCallFunction, kStringCompare,
+    ]);
+
+  builder.addFunction("compare_null_b", kSig_i_r)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprRefNull, kExternRefCode,
+      kExprCallFunction, kStringCompare,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  for (let lhs of interestingStrings) {
+    for (let rhs of interestingStrings) {
+      const expected = lhs < rhs ? -1 : lhs > rhs ? 1 : 0;
+      assertEquals(expected, instance.exports.compare(lhs, rhs));
+    }
+  }
+
+  assertThrows(() => instance.exports.compare(null, "abc"),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.compare("abc", null),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.compare_null_a("abc"),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.compare_null_b("abc"),
+               WebAssembly.RuntimeError, "illegal cast");
+})();
+
+(function TestStringCompareNullCheckStaticType() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+
+  // Use a mix of nullable and non-nullable input types to the compare.
+  builder.addFunction("compareLhsNullable",
+                      makeSig([kWasmExternRef, kWasmExternRef], [kWasmI32]))
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprRefAsNonNull,
+      kExprLocalGet, 1,
+      kExprCallFunction, kStringCompare,
+    ]);
+
+  builder.addFunction("compareRhsNullable",
+                      makeSig([kWasmExternRef, kWasmExternRef], [kWasmI32]))
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprRefAsNonNull,
+      kExprCallFunction, kStringCompare,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  assertThrows(() => instance.exports.compareLhsNullable(null, "abc"),
+               WebAssembly.RuntimeError, "dereferencing a null pointer");
+  assertThrows(() => instance.exports.compareLhsNullable("abc", null),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.compareRhsNullable(null, "abc"),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.compareRhsNullable("abc", null),
+               WebAssembly.RuntimeError, "dereferencing a null pointer");
+})();
+
+(function TestStringFromCodePoint() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+  builder.addFunction("asString", kSig_e_i)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprCallFunction, kStringFromCodePoint,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  for (let char of "Az1#\n\ucccc\ud800\udc00") {
+    assertEquals(char, instance.exports.asString(char.codePointAt(0)));
+  }
+  for (let codePoint of [0x110000, 0xFFFFFFFF, -1]) {
+    assertThrows(() => instance.exports.asString(codePoint),
+                 WebAssembly.RuntimeError, /Invalid code point -?[0-9]+/);
+  }
+})();
+
+(function TestStringFromCharCode() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+  builder.addFunction("asString", kSig_e_i)
+    .exportFunc()
+    .addBody([
+      kExprLocalGet, 0,
+      kExprCallFunction, kStringFromCharCode,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  let inputs = "Az1#\n\ucccc\ud800\udc00";
+  for (let i = 0; i < inputs.length; i++) {
+    assertEquals(inputs.charAt(i),
+                 instance.exports.asString(inputs.charCodeAt(i)));
+  }
+})();
+
+function encodeWtf8(str) {
+  // String iterator coalesces surrogate pairs.
+  let out = [];
+  for (let codepoint of str) {
+    codepoint = codepoint.codePointAt(0);
+    if (codepoint <= 0x7f) {
+      out.push(codepoint);
+    } else if (codepoint <= 0x7ff) {
+      out.push(0xc0 | (codepoint >> 6));
+      out.push(0x80 | (codepoint & 0x3f));
+    } else if (codepoint <= 0xffff) {
+      out.push(0xe0 | (codepoint >> 12));
+      out.push(0x80 | ((codepoint >> 6) & 0x3f));
+      out.push(0x80 | (codepoint & 0x3f));
+    } else if (codepoint <= 0x10ffff) {
+      out.push(0xf0 | (codepoint >> 18));
+      out.push(0x80 | ((codepoint >> 12) & 0x3f));
+      out.push(0x80 | ((codepoint >> 6) & 0x3f));
+      out.push(0x80 | (codepoint & 0x3f));
+    } else {
+      throw new Error("bad codepoint " + codepoint);
+    }
+  }
+  return out;
+}
+
+function makeWtf8TestDataSegment() {
+  let data = []
+  let valid = {};
+  let invalid = {};
+
+  for (let str of interestingStrings) {
+    let bytes = encodeWtf8(str);
+    valid[str] = { offset: data.length, length: bytes.length };
+    for (let byte of bytes) {
+      data.push(byte);
+    }
+  }
+  for (let bytes of ['trailing high byte \xa9',
+                     'interstitial high \xa9 byte',
+                     'invalid \xc0 byte',
+                     'invalid three-byte \xed\xd0\x80',
+                     'surrogate \xed\xa0\x80\xed\xb0\x80 pair']) {
+    invalid[bytes] = { offset: data.length, length: bytes.length };
+    for (let i = 0; i < bytes.length; i++) {
+      data.push(bytes.charCodeAt(i));
+    }
+  }
+  return { valid, invalid, data: Uint8Array.from(data) };
+};
+
+(function TestStringNewWtf8Array() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+  let data = makeWtf8TestDataSegment();
+  let data_index = builder.addPassiveDataSegment(data.data);
+
+  let ascii_data_index =
+      builder.addPassiveDataSegment(Uint8Array.from(encodeWtf8("ascii")));
+
+  let make_i8_array = builder.addFunction(
+      "make_i8_array", makeSig([], [wasmRefType(kArrayI8)]))
+    .addBody([
+      ...wasmI32Const(0),
+      ...wasmI32Const(data.data.length),
+      kGCPrefix, kExprArrayNewData, kArrayI8, data_index
+    ]).index;
+
+  builder.addFunction("new_wtf8", kSig_e_ii)
+    .exportFunc()
+    .addBody([
+      kExprCallFunction, make_i8_array,
+      kExprLocalGet, 0, kExprLocalGet, 1,
+      kExprCallFunction, kStringFromWtf8Array,
+    ]);
+
+  builder.addFunction("bounds_check", kSig_e_ii)
+    .exportFunc()
+    .addBody([
+      ...wasmI32Const(0),
+      ...wasmI32Const("ascii".length),
+      kGCPrefix, kExprArrayNewData, kArrayI8, ascii_data_index,
+      kExprLocalGet, 0, kExprLocalGet, 1,
+      kExprCallFunction, kStringFromWtf8Array,
+    ]);
+
+  builder.addFunction("null_array", kSig_e_v).exportFunc()
+    .addBody([
+      kExprRefNull, kArrayI8,
+      kExprI32Const, 0, kExprI32Const, 0,
+      kExprCallFunction, kStringFromWtf8Array,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  for (let [str, {offset, length}] of Object.entries(data.valid)) {
+    let start = offset;
+    let end = offset + length;
+    assertEquals(str, instance.exports.new_wtf8(start, end));
+  }
+  for (let [str, {offset, length}] of Object.entries(data.invalid)) {
+    let start = offset;
+    let end = offset + length;
+    assertThrows(() => instance.exports.new_wtf8(start, end),
+                 WebAssembly.RuntimeError, "invalid WTF-8 string");
+  }
+
+  assertEquals("ascii", instance.exports.bounds_check(0, "ascii".length));
+  assertEquals("", instance.exports.bounds_check("ascii".length,
+                                                 "ascii".length));
+  assertEquals("i", instance.exports.bounds_check("ascii".length - 1,
+                                                  "ascii".length));
+  assertThrows(() => instance.exports.bounds_check(0, 100),
+               WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.bounds_check(0, -1),
+               WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.bounds_check(-1, 0),
+               WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.bounds_check("ascii".length,
+                                                   "ascii".length + 1),
+               WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.null_array(),
+               WebAssembly.RuntimeError, "dereferencing a null pointer");
+})();
+
+function encodeWtf16LE(str) {
+  // String iterator coalesces surrogate pairs.
+  let out = [];
+  for (let i = 0; i < str.length; i++) {
+    codeunit = str.charCodeAt(i);
+    out.push(codeunit & 0xff)
+    out.push(codeunit >> 8);
+  }
+  return out;
+}
+
+function makeWtf16TestDataSegment(strings) {
+  let data = []
+  let valid = {};
+
+  for (let str of strings) {
+    valid[str] = { offset: data.length, length: str.length };
+    for (let byte of encodeWtf16LE(str)) {
+      data.push(byte);
+    }
+  }
+
+  return { valid, data: Uint8Array.from(data) };
+};
+
+(function TestStringNewWtf16Array() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+
+  // string.new_wtf16_array switches to a different implementation (runtime
+  // instead of Torque) for more than 32 characters, so provide some coverage
+  // for that case.
+  let strings = interestingStrings.concat([
+    "String with more than 32 characters, all of which are ASCII",
+    "Two-byte string with more than 32 characters \ucccc \ud800\udc00 \xa9?"
+  ]);
+
+  let data = makeWtf16TestDataSegment(strings);
+  let data_index = builder.addPassiveDataSegment(data.data);
+  let ascii_data_index =
+      builder.addPassiveDataSegment(Uint8Array.from(encodeWtf16LE("ascii")));
+
+  let make_i16_array = builder.addFunction(
+      "make_i16_array", makeSig([], [wasmRefType(kArrayI16)]))
+    .addBody([
+      ...wasmI32Const(0),
+      ...wasmI32Const(data.data.length / 2),
+      kGCPrefix, kExprArrayNewData, kArrayI16, data_index
+    ]).index;
+
+  builder.addFunction("new_wtf16", kSig_e_ii)
+    .exportFunc()
+    .addBody([
+      kExprCallFunction, make_i16_array,
+      kExprLocalGet, 0, kExprLocalGet, 1,
+      kExprCallFunction, kStringFromWtf16Array,
+    ]);
+
+  builder.addFunction("bounds_check", kSig_e_ii)
+    .exportFunc()
+    .addBody([
+      ...wasmI32Const(0),
+      ...wasmI32Const("ascii".length),
+      kGCPrefix, kExprArrayNewData, kArrayI16, ascii_data_index,
+      kExprLocalGet, 0, kExprLocalGet, 1,
+      kExprCallFunction, kStringFromWtf16Array,
+    ]);
+
+  builder.addFunction("null_array", kSig_e_v).exportFunc()
+    .addBody([
+      kExprRefNull, kArrayI16,
+      kExprI32Const, 0, kExprI32Const, 0,
+      kExprCallFunction, kStringFromWtf16Array,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  for (let [str, {offset, length}] of Object.entries(data.valid)) {
+    let start = offset / 2;
+    let end = start + length;
+    assertEquals(str, instance.exports.new_wtf16(start, end));
+  }
+
+  assertEquals("ascii", instance.exports.bounds_check(0, "ascii".length));
+  assertEquals("", instance.exports.bounds_check("ascii".length,
+                                                 "ascii".length));
+  assertEquals("i", instance.exports.bounds_check("ascii".length - 1,
+                                                  "ascii".length));
+  assertThrows(() => instance.exports.bounds_check(0, 100),
+               WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.bounds_check("ascii".length,
+                                                   "ascii".length + 1),
+               WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.null_array(),
+               WebAssembly.RuntimeError, "dereferencing a null pointer");
+})();
+
+(function TestStringEncodeWtf16Array() {
+  print(arguments.callee.name);
+  let builder = MakeBuilder();
+
+  // Allocate an array and encode into it.  Then decode it.
+  // (str, length, offset) -> str
+  builder.addFunction("encode", kSig_e_rii)
+    .exportFunc()
+    .addLocals(wasmRefNullType(kArrayI16), 1)
+    .addLocals(kWasmI32, 1)
+    .addBody([
+      // Allocate buffer.
+      kExprLocalGet, 1,
+      kGCPrefix, kExprArrayNewDefault, kArrayI16,
+      kExprLocalSet, 3,
+
+      // Write buffer, store number of code units written.
+      kExprLocalGet, 0,
+      kExprLocalGet, 3,
+      kExprLocalGet, 2,
+      kExprCallFunction, kStringToWtf16Array,
+      kExprLocalSet, 4,
+
+      // Read buffer.
+      kExprLocalGet, 3,
+      kExprLocalGet, 2,
+      kExprLocalGet, 2, kExprLocalGet, 4, kExprI32Add,
+      kExprCallFunction, kStringFromWtf16Array,
+    ]);
+
+  builder.addFunction("encode_null_string", kSig_i_v)
+    .exportFunc()
+    .addBody([
+      kExprRefNull, kExternRefCode,
+      kExprI32Const, 0, kGCPrefix, kExprArrayNewDefault, kArrayI16,
+      kExprI32Const, 0,
+      kExprCallFunction, kStringToWtf16Array,
+    ]);
+
+  builder.addFunction("encode_null_array", kSig_i_v)
+    .exportFunc()
+    .addBody([
+      kExprI32Const, 0, kGCPrefix, kExprArrayNewDefault, kArrayI16,
+      kExprI32Const, 0, kExprI32Const, 0,
+      kExprCallFunction, kStringFromWtf16Array,
+      kExprRefNull, kArrayI16,
+      kExprI32Const, 0,
+      kExprCallFunction, kStringToWtf16Array,
+    ]);
+
+  let instance = builder.instantiate(kImports);
+  for (let str of interestingStrings) {
+    assertEquals(str, instance.exports.encode(str, str.length, 0));
+    assertEquals(str, instance.exports.encode(str, str.length + 20, 10));
+  }
+
+  assertThrows(() => instance.exports.encode(null, 0, 0),
+               WebAssembly.RuntimeError, "illegal cast");
+  assertThrows(() => instance.exports.encode_null_array(),
+               WebAssembly.RuntimeError, "dereferencing a null pointer");
+  assertThrows(() => instance.exports.encode_null_string(),
+               WebAssembly.RuntimeError, "illegal cast");
+
+  for (let str of interestingStrings) {
+    let message = "array element access out of bounds";
+    assertThrows(() => instance.exports.encode(str, str.length, 1),
+                 WebAssembly.RuntimeError, message);
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/indirect-tables.js b/deps/v8/test/mjsunit/wasm/indirect-tables.js
index 73e575bd6f81f8..d46ebbacc7c137 100644
--- a/deps/v8/test/mjsunit/wasm/indirect-tables.js
+++ b/deps/v8/test/mjsunit/wasm/indirect-tables.js
@@ -840,7 +840,7 @@ function js_div(a, b) { return (a / b) | 0; }
 
   let module = (() => {
     let builder = new WasmModuleBuilder();
-    builder.addMemory(1, 1, false);
+    builder.addMemory(1, 1);
     builder.addFunction("f", kSig_i_v)
       .addBody([
         kExprI32Const, 0,
@@ -870,7 +870,7 @@ function js_div(a, b) { return (a / b) | 0; }
 
   let main = (() => {
     let builder = new WasmModuleBuilder();
-    builder.addMemory(1, 1, false);
+    builder.addMemory(1, 1);
     builder.addTable(kWasmAnyFunc, 4);
     builder.addImport("q", "f1", kSig_i_v);
     builder.addImport("q", "f2", kSig_i_v);
diff --git a/deps/v8/test/mjsunit/wasm/inlining.js b/deps/v8/test/mjsunit/wasm/inlining.js
index 7045b6a99a89ed..7883af0da65cb1 100644
--- a/deps/v8/test/mjsunit/wasm/inlining.js
+++ b/deps/v8/test/mjsunit/wasm/inlining.js
@@ -2,7 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --wasm-inlining --no-liftoff --experimental-wasm-return-call
+// Flags: --experimental-wasm-inlining --no-liftoff
+// Flags: --experimental-wasm-return-call
 // Flags: --experimental-wasm-gc --allow-natives-syntax
 
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
diff --git a/deps/v8/test/mjsunit/wasm/instance-gc.js b/deps/v8/test/mjsunit/wasm/instance-gc.js
index 9bd63a5b03d4b9..926b9c5840662f 100644
--- a/deps/v8/test/mjsunit/wasm/instance-gc.js
+++ b/deps/v8/test/mjsunit/wasm/instance-gc.js
@@ -10,7 +10,8 @@ let nogc = () => {};
 
 function newModule() {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
+  builder.exportMemoryAs("memory");
   builder.addFunction("main", kSig_i_v)
     .addBody([kExprI32Const, 0, kExprI32LoadMem, 0, 0])
     .exportFunc();
diff --git a/deps/v8/test/mjsunit/wasm/instantiate-module-basic.js b/deps/v8/test/mjsunit/wasm/instantiate-module-basic.js
index 5dac86b0235aff..0de2969298e00e 100644
--- a/deps/v8/test/mjsunit/wasm/instantiate-module-basic.js
+++ b/deps/v8/test/mjsunit/wasm/instantiate-module-basic.js
@@ -10,7 +10,8 @@ let kReturnValue = 17;
 
 let buffer = (() => {
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
+  builder.exportMemoryAs('memory');
   builder.addFunction('main', kSig_i_v)
       .addBody([kExprI32Const, kReturnValue])
       .exportFunc();
@@ -231,7 +232,7 @@ assertFalse(WebAssembly.validate(bytes(88, 88, 88, 88, 88, 88, 88, 88)));
 
 (function TestNoMemoryToExport() {
   let builder = new WasmModuleBuilder();
-  builder.exportMemoryAs('memory');
+  builder.exportMemoryAs('memory', 0);
   assertThrows(() => builder.instantiate(), WebAssembly.CompileError);
 })();
 
diff --git a/deps/v8/test/mjsunit/wasm/js-api.js b/deps/v8/test/mjsunit/wasm/js-api.js
index e764b3622f0ca6..1b4f1273abb8bd 100644
--- a/deps/v8/test/mjsunit/wasm/js-api.js
+++ b/deps/v8/test/mjsunit/wasm/js-api.js
@@ -59,8 +59,8 @@ let moduleBinaryImporting2Memories = (() => {
 
 let moduleBinaryWithMemSectionAndMemImport = (() => {
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
   builder.addImportedMemory('', 'memory1');
+  builder.addMemory(1, 1);
   return new Int8Array(builder.toBuffer());
 })();
 
@@ -262,7 +262,7 @@ let exportingModuleBinary2 = (() => {
       '(module (func (export "a")) (memory (export "b") 1) (table (export "c") 1 anyfunc) (global (export "⚡") i32 (i32.const 0)))';
   let builder = new WasmModuleBuilder();
   builder.addFunction('foo', kSig_v_v).addBody([]).exportAs('a');
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   builder.exportMemoryAs('b');
   builder.setTableBounds(1, 1);
   builder.addExportOfKind('c', kExternalTable, 0);
@@ -673,9 +673,12 @@ assertEq(get.call(tbl1, 0), null);
 assertEq(get.call(tbl1, 0, Infinity), null);
 assertEq(get.call(tbl1, 1), null);
 assertEq(get.call(tbl1, 1.5), null);
-assertThrows(() => get.call(tbl1, 2), RangeError, /invalid index \d+ into function table/);
 assertThrows(
-    () => get.call(tbl1, 2.5), RangeError, /invalid index \d+ into function table/);
+    () => get.call(tbl1, 2), RangeError,
+    /invalid index 2 into funcref table of size 2/);
+assertThrows(
+    () => get.call(tbl1, 2.5), RangeError,
+    /invalid index 2 into funcref table of size 2/);
 assertThrows(() => get.call(tbl1, -1), TypeError, /must be non-negative/);
 assertThrows(
     () => get.call(tbl1, Math.pow(2, 33)), TypeError,
@@ -701,7 +704,8 @@ assertThrows(
     () => set.call(tbl1, undefined), TypeError,
     /must be convertible to a valid number/);
 assertThrows(
-    () => set.call(tbl1, 2, null), RangeError, /invalid index \d+ into function table/);
+    () => set.call(tbl1, 2, null), RangeError,
+    /invalid index 2 into funcref table of size 2/);
 assertThrows(
     () => set.call(tbl1, -1, null), TypeError, /must be non-negative/);
 assertThrows(
diff --git a/deps/v8/test/mjsunit/wasm/js-wrapper-typechecks.js b/deps/v8/test/mjsunit/wasm/js-wrapper-typechecks.js
new file mode 100644
index 00000000000000..3cebd1d062061e
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/js-wrapper-typechecks.js
@@ -0,0 +1,29 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+
+(function testNonNullRefWrapperNullCheck() {
+  print(arguments.callee.name);
+  for (let [name, type] of Object.entries({
+    'extern': kWasmExternRef,
+    'any': kWasmAnyRef,
+    'func': kWasmFuncRef,
+    'array': kWasmArrayRef,
+  })) {
+    print(`- ${name}`);
+    let builder = new WasmModuleBuilder();
+    builder.addFunction('test', makeSig([wasmRefType(type)], []))
+      .addBody([kExprUnreachable])
+      .exportFunc();
+
+    let instance = builder.instantiate({});
+    let wasm = instance.exports;
+    assertThrows(() => wasm.test(null), TypeError,
+                 /type incompatibility when transforming from\/to JS/);
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/large-offset.js b/deps/v8/test/mjsunit/wasm/large-offset.js
index aebe58e2d147fd..6a577d5003925d 100644
--- a/deps/v8/test/mjsunit/wasm/large-offset.js
+++ b/deps/v8/test/mjsunit/wasm/large-offset.js
@@ -7,7 +7,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 function testMemoryGrowOutOfBoundsOffset() {
   print("testMemoryGrowOutOfBoundsOffset2");
   var builder = new WasmModuleBuilder();
-  builder.addMemory(16, 128, false);
+  builder.addMemory(16, 128);
   builder.addFunction("main", kSig_v_v)
       .addBody([
           kExprI32Const, 20,
diff --git a/deps/v8/test/mjsunit/wasm/large-struct.js b/deps/v8/test/mjsunit/wasm/large-struct.js
new file mode 100644
index 00000000000000..3b0edaa1570b9b
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/large-struct.js
@@ -0,0 +1,67 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+(function TestLargeStruct() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  // Keep in sync with wasm-limits.h.
+  let kWasmMaxStructFields = 10000;
+  // Keep in sync with wasm-constants.h.
+  let kMaxStructFieldIndexForImplicitNullCheck = 4000;
+  let struct_large = builder.addStruct(
+      new Array(kWasmMaxStructFields).fill(makeField(kWasmS128, true)));
+
+  let struct_large_indices = [
+    0, kMaxStructFieldIndexForImplicitNullCheck,
+    kMaxStructFieldIndexForImplicitNullCheck + 1,
+    kWasmMaxStructFields - 1];
+
+  for (let field_index of struct_large_indices) {
+    builder.addFunction(
+        "structLargeGet" + field_index,
+        makeSig([wasmRefNullType(struct_large)], [kWasmI32]))
+      .addBody([
+        kExprLocalGet, 0,
+        kGCPrefix, kExprStructGet, struct_large,
+        ...wasmUnsignedLeb(field_index),
+        kSimdPrefix, kExprI32x4ExtractLane, 0])
+      .exportFunc();
+
+    builder.addFunction(
+        "structLargeSet" + field_index,
+        makeSig([wasmRefNullType(struct_large)], []))
+      .addBody([
+        kExprLocalGet, 0,
+        kSimdPrefix, kExprS128Const,
+        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0xa, 0xb, 0xc, 0xd, 0xe, 0xf,
+        kGCPrefix, kExprStructSet, struct_large,
+        ...wasmUnsignedLeb(field_index)])
+      .exportFunc();
+  }
+
+  builder.addFunction("structLargeMake",
+                      makeSig([], [wasmRefType(struct_large)]))
+      .addBody([kGCPrefix, kExprStructNewDefault, struct_large])
+      .exportFunc();
+
+  let instance = builder.instantiate();
+
+  let struct_large_obj = instance.exports.structLargeMake();
+  for (let field_index of struct_large_indices) {
+    assertTraps(kTrapNullDereference,
+      () => instance.exports[
+          "structLargeGet" + field_index](null));
+    assertTraps(kTrapNullDereference,
+      () => instance.exports[
+          "structLargeSet" + field_index](null));
+    instance.exports["structLargeSet" + field_index](struct_large_obj);
+    assertEquals(0x03020100,
+                  instance.exports["structLargeGet" + field_index](
+                    struct_large_obj));
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/lazy-compilation.js b/deps/v8/test/mjsunit/wasm/lazy-compilation.js
index d3bcd5f060b544..2eac01b790e09f 100644
--- a/deps/v8/test/mjsunit/wasm/lazy-compilation.js
+++ b/deps/v8/test/mjsunit/wasm/lazy-compilation.js
@@ -20,7 +20,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 (function testWasmToWasmWithDifferentMemory() {
   print(arguments.callee.name);
   const builder1 = new WasmModuleBuilder();
-  builder1.addMemory(1, 1, true);
+  builder1.addMemory(1, 1);
+  builder1.exportMemoryAs('memory');
   builder1.addFunction('store', kSig_v_i)
       .addBody([
         kExprI32Const, 0,        // i32.const 1
@@ -32,7 +33,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   const mem1 = new Int32Array(instance1.exports.memory.buffer);
 
   const builder2 = new WasmModuleBuilder();
-  builder2.addMemory(1, 1, true);
+  builder2.addMemory(1, 1);
+  builder2.exportMemoryAs('memory');
   builder2.addImport('mod', 'store', kSig_v_i);
   builder2.addFunction('call_store', kSig_v_i)
       .addBody([kExprLocalGet, 0, kExprCallFunction, 0])
@@ -71,7 +73,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 (function exportImportedFunctionWithDifferentMemory() {
   print(arguments.callee.name);
   const builder1 = new WasmModuleBuilder();
-  builder1.addMemory(1, 1, true);
+  builder1.addMemory(1, 1);
+  builder1.exportMemoryAs('memory');
   builder1.addFunction('store', kSig_v_i)
       .addBody([
         kExprI32Const, 0,        // i32.const 1
@@ -83,7 +86,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   const mem1 = new Int32Array(instance1.exports.memory.buffer);
 
   const builder2 = new WasmModuleBuilder();
-  builder2.addMemory(1, 1, true);
+  builder2.addMemory(1, 1);
+  builder2.exportMemoryAs('memory');
   const imp_idx = builder2.addImport('A', 'store', kSig_v_i);
   builder2.addExport('exp_store', imp_idx);
   const instance2 = builder2.instantiate({A: instance1.exports});
diff --git a/deps/v8/test/mjsunit/wasm/lazy-feedback-vector-allocation.js b/deps/v8/test/mjsunit/wasm/lazy-feedback-vector-allocation.js
index c5ae6c61e45c9f..55bd4895b014d6 100644
--- a/deps/v8/test/mjsunit/wasm/lazy-feedback-vector-allocation.js
+++ b/deps/v8/test/mjsunit/wasm/lazy-feedback-vector-allocation.js
@@ -2,7 +2,7 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --wasm-lazy-compilation --wasm-speculative-inlining
+// Flags: --wasm-lazy-compilation --experimental-wasm-inlining
 
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
diff --git a/deps/v8/test/mjsunit/wasm/liftoff-trap-handler.js b/deps/v8/test/mjsunit/wasm/liftoff-trap-handler.js
index 7d60978478d732..96f785ae1d3f1f 100644
--- a/deps/v8/test/mjsunit/wasm/liftoff-trap-handler.js
+++ b/deps/v8/test/mjsunit/wasm/liftoff-trap-handler.js
@@ -21,7 +21,7 @@ function testCompileLoadStore() {
                 kExprI32StoreMem, 0, 0x80, 0x80, 0x80, 1,
                 kExprLocalGet, 1])
       .exportFunc();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   const instance = builder.instantiate();
 }
 testCompileLoadStore();
diff --git a/deps/v8/test/mjsunit/wasm/loop-rotation.js b/deps/v8/test/mjsunit/wasm/loop-rotation.js
index 692fa508e98d3b..c76c381f68b234 100644
--- a/deps/v8/test/mjsunit/wasm/loop-rotation.js
+++ b/deps/v8/test/mjsunit/wasm/loop-rotation.js
@@ -52,7 +52,7 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 (function TestNonRotatedLoopWithStore() {
   print(arguments.callee.name);
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, undefined, false);
+  builder.addMemory(1, undefined);
   builder.addFunction("main", kSig_v_i)
     .addBody([
       kExprLoop, kWasmVoid,
diff --git a/deps/v8/test/mjsunit/wasm/max-module-size-flag.js b/deps/v8/test/mjsunit/wasm/max-module-size-flag.js
index 3c8d7bf8832c3d..356c01107f7104 100644
--- a/deps/v8/test/mjsunit/wasm/max-module-size-flag.js
+++ b/deps/v8/test/mjsunit/wasm/max-module-size-flag.js
@@ -39,12 +39,12 @@ assertPromiseResult((async function TestAsyncSmallModule() {
 
 (function TestSyncBigModule() {
   assertThrows(
-      () => new WebAssembly.Module(big_binary), RangeError,
+      () => new WebAssembly.Module(big_binary), WebAssembly.CompileError,
       'WebAssembly.Module(): ' + big_error_msg);
 })();
 
 (function TestAsyncBigModule() {
   assertThrowsAsync(
-      WebAssembly.compile(big_binary), RangeError,
+      WebAssembly.compile(big_binary), WebAssembly.CompileError,
       'WebAssembly.compile(): ' + big_error_msg);
 })();
diff --git a/deps/v8/test/mjsunit/wasm/memory-external-call.js b/deps/v8/test/mjsunit/wasm/memory-external-call.js
index 4d57d7d0d0ddfc..d3390ac95d8cef 100644
--- a/deps/v8/test/mjsunit/wasm/memory-external-call.js
+++ b/deps/v8/test/mjsunit/wasm/memory-external-call.js
@@ -23,7 +23,7 @@ function generateBuilder(add_memory, import_sig) {
   }
   if (add_memory) {
     // Add the memory if we expect a module builder with memory and load/store.
-    builder.addMemory(initialMemoryPages, maximumMemoryPages, true);
+    builder.addMemory(initialMemoryPages, maximumMemoryPages);
     builder.addFunction('load', kSig_i_i)
         .addBody([kExprLocalGet, 0, kExprI32LoadMem, 0, 0])
         .exportFunc();
@@ -80,7 +80,7 @@ function assertMemoryIndependence(load_a, store_a, load_b, store_b) {
   let kPages = 1;
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(kPages, kPages, true);
+  builder.addMemory(kPages, kPages);
   builder.addFunction("store", kSig_v_ii)
     .addBody([
       kExprLocalGet, 0,     // --
@@ -100,7 +100,7 @@ function assertMemoryIndependence(load_a, store_a, load_b, store_b) {
   // The {b} instance forwards all {store} calls to the imported function.
   builder = new WasmModuleBuilder();
   builder.addImport("mod", "store", kSig_v_ii);
-  builder.addMemory(kPages, kPages, true);
+  builder.addMemory(kPages, kPages);
   builder.addFunction("store", kSig_v_ii)
     .addBody([
       kExprLocalGet, 0,     // --
@@ -260,7 +260,7 @@ function assertMemoryIndependence(load_a, store_a, load_b, store_b) {
   let kPages = 1;
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(kPages, kPages, true);
+  builder.addMemory(kPages, kPages);
   builder.addFunction("store", kSig_v_ii)
     .addBody([
       kExprLocalGet, 0,     // --
diff --git a/deps/v8/test/mjsunit/wasm/memory-size.js b/deps/v8/test/mjsunit/wasm/memory-size.js
index fc08b77b2af13c..42a1c18ab095a3 100644
--- a/deps/v8/test/mjsunit/wasm/memory-size.js
+++ b/deps/v8/test/mjsunit/wasm/memory-size.js
@@ -12,7 +12,7 @@ var kSpecMaxWasmMemoryPages = 65536;  // 4 GiB
 (function testMemorySizeZero() {
   print(arguments.callee.name);
   var builder = new WasmModuleBuilder();
-  builder.addMemory(0, 0, false);
+  builder.addMemory(0, 0);
   builder.addFunction("memory_size", kSig_i_v)
          .addBody([kExprMemorySize, kMemoryZero])
          .exportFunc();
@@ -24,7 +24,7 @@ var kSpecMaxWasmMemoryPages = 65536;  // 4 GiB
   print(arguments.callee.name);
   var builder = new WasmModuleBuilder();
   var size = 11;
-  builder.addMemory(size, size, false);
+  builder.addMemory(size, size);
   builder.addFunction("memory_size", kSig_i_v)
          .addBody([kExprMemorySize, kMemoryZero])
          .exportFunc();
@@ -35,7 +35,7 @@ var kSpecMaxWasmMemoryPages = 65536;  // 4 GiB
 (function testMemorySizeSpecMaxOk() {
   print(arguments.callee.name);
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, kSpecMaxWasmMemoryPages, true);
+  builder.addMemory(1, kSpecMaxWasmMemoryPages);
   builder.addFunction("memory_size", kSig_i_v)
          .addBody([kExprMemorySize, kMemoryZero])
          .exportFunc();
@@ -47,7 +47,7 @@ var kSpecMaxWasmMemoryPages = 65536;  // 4 GiB
   print(arguments.callee.name);
   var builder = new WasmModuleBuilder();
   builder.addMemory(kV8MaxWasmMemoryPages + 1,
-                    kV8MaxWasmMemoryPages + 1, false);
+                    kV8MaxWasmMemoryPages + 1);
   builder.addFunction("memory_size", kSig_i_v)
          .addBody([kExprMemorySize, kMemoryZero])
          .exportFunc();
@@ -57,7 +57,7 @@ var kSpecMaxWasmMemoryPages = 65536;  // 4 GiB
 (function testMemorySpecMaxOk() {
   print(arguments.callee.name);
   var builder = new WasmModuleBuilder();
-  builder.addMemory(1, kSpecMaxWasmMemoryPages, false);
+  builder.addMemory(1, kSpecMaxWasmMemoryPages);
   builder.addFunction("memory_size", kSig_i_v)
          .addBody([kExprMemorySize, kMemoryZero])
     .exportFunc();
diff --git a/deps/v8/test/mjsunit/wasm/memory64.js b/deps/v8/test/mjsunit/wasm/memory64.js
index d7bdd70e995b57..88e973bbe9d14b 100644
--- a/deps/v8/test/mjsunit/wasm/memory64.js
+++ b/deps/v8/test/mjsunit/wasm/memory64.js
@@ -19,7 +19,8 @@ function BasicMemory64Tests(num_pages, use_atomic_ops) {
       use_atomic_ops ? '' : 'non-'}atomic memory`);
 
   let builder = new WasmModuleBuilder();
-  builder.addMemory64(num_pages, num_pages, true);
+  builder.addMemory64(num_pages, num_pages);
+  builder.exportMemoryAs('memory');
 
   // A memory operation with alignment (0) and offset (0).
   let op = (non_atomic, atomic) => use_atomic_ops ?
@@ -194,10 +195,79 @@ function allowOOM(fn) {
   assertEquals(-1n, instance.exports.grow(1n << 32n));
   assertEquals(-1n, instance.exports.grow(1n << 33n));
   assertEquals(-1n, instance.exports.grow(1n << 63n));
-  assertEquals(-1n, instance.exports.grow(7n));  // Above the of 10.
+  assertEquals(-1n, instance.exports.grow(7n));  // Above the maximum of 10.
   assertEquals(4n, instance.exports.grow(6n));   // Just at the maximum of 10.
 })();
 
+(function TestGrow64_ToMemory() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addMemory64(1, 10);
+  builder.exportMemoryAs('memory');
+
+  // Grow memory and store the result in memory for inspection from JS.
+  builder.addFunction('grow', makeSig([kWasmI64], []))
+      .addBody([
+        kExprI64Const, 0,       // i64.const (offset for result)
+        kExprLocalGet, 0,       // local.get 0
+        kExprMemoryGrow, 0,     // memory.grow 0
+        kExprI64StoreMem, 3, 0  // store result to memory
+      ])
+      .exportFunc();
+
+  let instance = builder.instantiate();
+  function grow(arg) {
+    instance.exports.grow(arg);
+    let i64_arr = new BigInt64Array(instance.exports.memory.buffer, 0, 1);
+    return i64_arr[0];
+  }
+
+  assertEquals(1n, grow(2n));
+  assertEquals(3n, grow(1n));
+  assertEquals(-1n, grow(-1n));
+  assertEquals(-1n, grow(1n << 31n));
+  assertEquals(-1n, grow(1n << 32n));
+  assertEquals(-1n, grow(1n << 33n));
+  assertEquals(-1n, grow(1n << 63n));
+  assertEquals(-1n, grow(7n));  // Above the maximum of 10.
+  assertEquals(4n, grow(6n));   // Just at the maximum of 10.
+})();
+
+(function TestGrow64_Above4GB() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let max_pages = 5 * GB / kPageSize;
+  builder.addMemory64(1, max_pages);
+  builder.exportMemoryAs('memory');
+
+  builder.addFunction('grow', makeSig([kWasmI64], [kWasmI64]))
+      .addBody([
+        kExprLocalGet, 0,    // local.get 0
+        kExprMemoryGrow, 0,  // memory.grow 0
+      ])
+      .exportFunc();
+
+  let instance = builder.instantiate();
+
+  // Grow from 1 to 3 pages.
+  assertEquals(1n, instance.exports.grow(2n));
+  // Grow from 3 to {max_pages - 1} pages.
+  // This step can fail. We have to allow this, even though it weakens this test
+  // (we do not know if we failed because of OOM or because of a wrong
+  // engine-internal limit of 4GB).
+  let grow_big_result = instance.exports.grow(BigInt(max_pages) - 4n);
+  if (grow_big_result == -1) return;
+  assertEquals(3n, grow_big_result);
+  // Cannot grow by 2 pages.
+  assertEquals(-1n, instance.exports.grow(2n));
+  // Cannot grow by 2^32 pages.
+  assertEquals(-1n, instance.exports.grow(1n << 32n));
+  // Grow by one more page to the maximum.
+  assertEquals(BigInt(max_pages) - 1n, instance.exports.grow(1n));
+  // Cannot grow further.
+  assertEquals(-1n, instance.exports.grow(1n));
+})();
+
 (function TestBulkMemoryOperations() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
@@ -307,10 +377,57 @@ function allowOOM(fn) {
   assertTraps(kTrapMemOutOfBounds, () => fill(1n << 63n, 0, 1n));
 })();
 
+(function TestBulkMemoryConstOperations() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  const kMemSizeInPages = 10;
+  builder.addMemory64(kMemSizeInPages, kMemSizeInPages);
+  const kSegmentSize = 1024;
+  // Build a data segment with values [0, kSegmentSize-1].
+  const segment = Array.from({length: kSegmentSize}, (_, idx) => idx)
+  builder.addPassiveDataSegment(segment);
+  builder.exportMemoryAs('memory');
+
+  builder.addFunction('fill', makeSig([kWasmI32, kWasmI64], []))
+      .addBody([
+        kExprI64Const, 15,                  // i64.const 15
+        kExprLocalGet, 0,                   // local.get 0 (value)
+        kExprLocalGet, 1,                   // local.get 1 (size)
+        kNumericPrefix, kExprMemoryFill, 0  // memory.fill mem=0
+      ])
+      .exportFunc();
+
+  builder.addFunction('init', makeSig([kWasmI32, kWasmI32], []))
+      .addBody([
+        kExprI64Const, 5,                      // i64.const 5
+        kExprLocalGet, 0,                      // local.get 0 (offset)
+        kExprLocalGet, 1,                      // local.get 1 (size)
+        kNumericPrefix, kExprMemoryInit, 0, 0  // memory.init seg=0 mem=0
+      ])
+      .exportFunc();
+
+  let instance = builder.instantiate();
+  let fill = instance.exports.fill;
+  let init = instance.exports.init;
+  // {memory(offset,size)} extracts the memory at [offset, offset+size)] into an
+  // Array.
+  let memory = (offset, size) => Array.from(new Uint8Array(
+      instance.exports.memory.buffer.slice(offset, offset + size)));
+
+  // Init memory[5..7] with [10..12].
+  init(10, 3);
+  assertEquals([0, 0, 10, 11, 12, 0, 0], memory(3, 7));
+
+  // Fill memory[15..17] with 3s.
+  fill(3, 3n);
+  assertEquals([0, 3, 3, 3, 0], memory(14, 5));
+})();
+
 (function TestMemory64SharedBasic() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
-  builder.addMemory64(1, 10, true, true);
+  builder.addMemory64(1, 10, true);
+  builder.exportMemoryAs('memory');
   builder.addFunction('load', makeSig([kWasmI64], [kWasmI32]))
       .addBody([
         kExprLocalGet, 0,       // local.get 0
@@ -330,7 +447,8 @@ function allowOOM(fn) {
   // TODO(clemensb): Use the proper API once that's decided.
   let shared_mem64 = (function() {
     let builder = new WasmModuleBuilder();
-    builder.addMemory64(1, 10, true, true);
+    builder.addMemory64(1, 10, true);
+    builder.exportMemoryAs('memory');
     return builder.instantiate().exports.memory;
   })();
 
@@ -375,8 +493,9 @@ function allowOOM(fn) {
       }
 
       function workerAssertEquals(expected, actual, message) {
-        if (expected != actual)
+        if (expected != actual) {
           postMessage(`Check failed (${message}): ${expected} != ${actual}`);
+        }
       }
 
       const kOffset1 = 47n;
@@ -411,3 +530,145 @@ function allowOOM(fn) {
   // This test can fail if 5GB of memory cannot be allocated.
   allowOOM(() => BasicMemory64Tests(num_pages, true));
 })();
+
+(function Test64BitOffsetOn32BitMemory() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addMemory(1, 1);
+
+  builder.addFunction('load', makeSig([kWasmI32], [kWasmI32]))
+      .addBody([
+        // local.get 0
+        kExprLocalGet, 0,
+        // i32.load align=0 offset=2^32+2
+        kExprI32LoadMem, 0, ...wasmSignedLeb64(Math.pow(2, 32) + 2),
+      ])
+      .exportFunc();
+
+  // An offset outside the 32-bit range should not validate.
+  assertFalse(WebAssembly.validate(builder.toBuffer()));
+})();
+
+(function Test64BitOffsetOn64BitMemory() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addMemory64(1, 1);
+
+  builder.addFunction('load', makeSig([kWasmI64], [kWasmI32]))
+      .addBody([
+        // local.get 0
+        kExprLocalGet, 0,
+        // i32.load align=0 offset=2^32+2
+        kExprI32LoadMem, 0, ...wasmSignedLeb64(Math.pow(2, 32) + 2),
+      ])
+      .exportFunc();
+
+  // Instantiation works, this should throw at runtime.
+  let instance = builder.instantiate();
+  let load = instance.exports.load;
+
+  assertTraps(kTrapMemOutOfBounds, () => load(0n));
+})();
+
+(function TestImportMemory64() {
+  print(arguments.callee.name);
+  const builder1 = new WasmModuleBuilder();
+  builder1.addMemory64(1, 1);
+  builder1.exportMemoryAs('mem64');
+  const instance1 = builder1.instantiate();
+  const {mem64} = instance1.exports;
+
+  let builder2 = new WasmModuleBuilder();
+  builder2.addImportedMemory(
+      'imp', 'mem', 1, 1, /* shared */ false, /* memory64 */ true);
+  builder2.instantiate({imp: {mem: mem64}});
+})();
+
+(function TestImportMemory64AsMemory32() {
+  print(arguments.callee.name);
+  const builder1 = new WasmModuleBuilder();
+  builder1.addMemory64(1, 1);
+  builder1.exportMemoryAs('mem64');
+  const instance1 = builder1.instantiate();
+  const {mem64} = instance1.exports;
+
+  let builder2 = new WasmModuleBuilder();
+  builder2.addImportedMemory('imp', 'mem');
+  assertThrows(
+      () => builder2.instantiate({imp: {mem: mem64}}), WebAssembly.LinkError,
+      'WebAssembly.Instance(): cannot import memory64 as memory32');
+})();
+
+(function TestImportMemory32AsMemory64() {
+  print(arguments.callee.name);
+  const builder1 = new WasmModuleBuilder();
+  builder1.addMemory(1, 1);
+  builder1.exportMemoryAs('mem32');
+  const instance1 = builder1.instantiate();
+  const {mem32} = instance1.exports;
+
+  let builder2 = new WasmModuleBuilder();
+  builder2.addImportedMemory(
+      'imp', 'mem', 1, 1, /* shared */ false, /* memory64 */ true);
+  assertThrows(
+      () => builder2.instantiate({imp: {mem: mem32}}), WebAssembly.LinkError,
+      'WebAssembly.Instance(): cannot import memory32 as memory64');
+})();
+
+function InstantiatingWorkerCode() {
+  function workerAssert(condition, message) {
+    if (!condition) postMessage(`Check failed: ${message}`);
+  }
+
+  onmessage = function([mem, module]) {
+    workerAssert(mem instanceof WebAssembly.Memory, 'Wasm memory');
+    workerAssert(mem.buffer instanceof SharedArrayBuffer, 'SAB');
+    try {
+      new WebAssembly.Instance(module, {imp: {mem: mem}});
+      postMessage('Instantiation succeeded');
+    } catch (e) {
+      postMessage(`Exception: ${e}`);
+    }
+  };
+}
+
+(function TestImportMemory64AsMemory32InWorker() {
+  print(arguments.callee.name);
+  const builder1 = new WasmModuleBuilder();
+  builder1.addMemory64(1, 1, /* shared */ true);
+  builder1.exportMemoryAs('mem64');
+  const instance1 = builder1.instantiate();
+  const {mem64} = instance1.exports;
+
+  let builder2 = new WasmModuleBuilder();
+  builder2.addImportedMemory('imp', 'mem');
+  let module2 = builder2.toModule();
+
+  let worker = new Worker(InstantiatingWorkerCode, {type: 'function'});
+  worker.postMessage([mem64, module2]);
+  assertEquals(
+      'Exception: LinkError: WebAssembly.Instance(): ' +
+          'cannot import memory64 as memory32',
+      worker.getMessage());
+})();
+
+(function TestImportMemory32AsMemory64InWorker() {
+  print(arguments.callee.name);
+  const builder1 = new WasmModuleBuilder();
+  builder1.addMemory(1, 1, /* shared */ true);
+  builder1.exportMemoryAs('mem32');
+  const instance1 = builder1.instantiate();
+  const {mem32} = instance1.exports;
+
+  let builder2 = new WasmModuleBuilder();
+  builder2.addImportedMemory(
+      'imp', 'mem', 1, 1, /* shared */ false, /* memory64 */ true);
+  let module2 = builder2.toModule();
+
+  let worker = new Worker(InstantiatingWorkerCode, {type: 'function'});
+  worker.postMessage([mem32, module2]);
+  assertEquals(
+      'Exception: LinkError: WebAssembly.Instance(): ' +
+          'cannot import memory32 as memory64',
+      worker.getMessage());
+})();
diff --git a/deps/v8/test/mjsunit/wasm/module-memory.js b/deps/v8/test/mjsunit/wasm/module-memory.js
index 4d993ed5660c22..402669c5140ac4 100644
--- a/deps/v8/test/mjsunit/wasm/module-memory.js
+++ b/deps/v8/test/mjsunit/wasm/module-memory.js
@@ -132,7 +132,7 @@ testOuterMemorySurvivalAcrossGc();
 function testOOBThrows() {
   var builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
   builder.addFunction("geti", kSig_i_ii)
     .addBody([
       kExprLocalGet, 0,
@@ -160,7 +160,11 @@ function testOOBThrows() {
     assertTraps(kTrapMemOutOfBounds, () => read(offset));
     assertTraps(kTrapMemOutOfBounds, () => write(offset));
     if (%IsWasmTrapHandlerEnabled()) {
-      assertTrue(trap_count + 2 <= %GetWasmRecoveredTrapCount());
+      if (%IsWasmPartialOOBWriteNoop()) {
+        assertTrue(trap_count + 2 <= %GetWasmRecoveredTrapCount());
+      } else {
+        assertTrue(trap_count + 1 <= %GetWasmRecoveredTrapCount());
+      }
     }
   }
 }
diff --git a/deps/v8/test/mjsunit/wasm/multi-memory.js b/deps/v8/test/mjsunit/wasm/multi-memory.js
new file mode 100644
index 00000000000000..6adfc22c64e728
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/multi-memory.js
@@ -0,0 +1,582 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-multi-memory
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+// Add a {loadN} and {storeN} function for memory N.
+function addLoadAndStoreFunctions(builder, mem_index) {
+  builder.addFunction(`load${mem_index}`, kSig_i_i)
+      .addBody([kExprLocalGet, 0, kExprI32LoadMem, 0x40, mem_index, 0])
+      .exportFunc();
+  builder.addFunction(`store${mem_index}`, kSig_v_ii)
+      .addBody([
+        kExprLocalGet, 1, kExprLocalGet, 0, kExprI32StoreMem, 0x40, mem_index, 0
+      ])
+      .exportFunc();
+}
+
+// Add a {growN} and {sizeN} function for memory N.
+function addGrowAndSizeFunctions(builder, mem_index) {
+  builder.addFunction(`grow${mem_index}`, kSig_i_i)
+      .addBody([kExprLocalGet, 0, kExprMemoryGrow, mem_index])
+      .exportFunc();
+  builder.addFunction(`size${mem_index}`, kSig_i_v)
+      .addBody([kExprMemorySize, mem_index])
+      .exportFunc();
+}
+
+// Add a {initN_M} function for memory N and data segment M.
+function addMemoryInitFunction(builder, data_segment, mem_index) {
+  builder.addFunction(`init${mem_index}_${data_segment}`, kSig_v_iii)
+      .addBody([
+        kExprLocalGet, 0,  // dst
+        kExprLocalGet, 1,  // offset
+        kExprLocalGet, 2,  // size
+        kNumericPrefix, kExprMemoryInit, data_segment, mem_index
+      ])
+      .exportFunc();
+}
+
+// Add a {fillN} function for memory N.
+function addMemoryFillFunction(builder, mem_index) {
+  builder.addFunction(`fill${mem_index}`, kSig_v_iii)
+      .addBody([
+        kExprLocalGet, 0,  // dst
+        kExprLocalGet, 1,  // value
+        kExprLocalGet, 2,  // size
+        kNumericPrefix, kExprMemoryFill, mem_index
+      ])
+      .exportFunc();
+}
+
+// Add a {copyN_M} function for copying from memory M to memory N.
+function addMemoryCopyFunction(builder, mem_dst_index, mem_src_index) {
+  builder.addFunction(`copy${mem_dst_index}_${mem_src_index}`, kSig_v_iii)
+      .addBody([
+        kExprLocalGet, 0,  // dst
+        kExprLocalGet, 1,  // src
+        kExprLocalGet, 2,  // size
+        kNumericPrefix, kExprMemoryCopy, mem_dst_index, mem_src_index
+      ])
+      .exportFunc();
+}
+
+// Helper to test that two memories can be accessed independently.
+function testTwoMemories(instance, mem0_size, mem1_size) {
+  const {load0, load1, store0, store1} = instance.exports;
+
+  assertEquals(0, load0(0));
+  assertEquals(0, load1(0));
+
+  store0(47, 0);
+  assertEquals(47, load0(0));
+  assertEquals(0, load1(0));
+
+  store1(11, 0);
+  assertEquals(47, load0(0));
+  assertEquals(11, load1(0));
+
+  store1(22, 1);
+  assertEquals(47, load0(0));
+  assertEquals(22, load1(1));
+  // The 22 is in the second byte when loading from 0.
+  assertEquals(22 * 256 + 11, load1(0));
+
+  const mem0_bytes = mem0_size * kPageSize;
+  load0(mem0_bytes - 4);  // should not trap.
+  for (const offset of [-3, -1, mem0_bytes - 3, mem0_bytes - 1, mem0_bytes]) {
+    assertTraps(kTrapMemOutOfBounds, () => load0(offset));
+    assertTraps(kTrapMemOutOfBounds, () => store0(0, offset));
+  }
+
+  const mem1_bytes = mem1_size * kPageSize;
+  load1(mem1_bytes - 4);  // should not trap.
+  for (const offset of [-3, -1, mem1_bytes - 3, mem1_bytes - 1, mem1_bytes]) {
+    assertTraps(kTrapMemOutOfBounds, () => load1(offset));
+    assertTraps(kTrapMemOutOfBounds, () => store1(0, offset));
+  }
+}
+
+function assertMemoryEquals(expected, memory) {
+  assertInstanceof(memory, WebAssembly.Memory);
+  assertInstanceof(expected, Uint8Array);
+  const buf = new Uint8Array(memory.buffer);
+  // For better output, check the first 50 bytes separately first.
+  assertEquals(expected.slice(0, 50), buf.slice(0, 50));
+  // Now also check the full memory content.
+  assertEquals(expected, buf);
+}
+
+(function testBasicMultiMemory() {
+  print(arguments.callee.name);
+  const builder = new WasmModuleBuilder();
+  const mem0_idx = builder.addMemory(1, 1);
+  const mem1_idx = builder.addMemory(1, 1);
+  addLoadAndStoreFunctions(builder, mem0_idx);
+  addLoadAndStoreFunctions(builder, mem1_idx);
+
+  const instance = builder.instantiate();
+  testTwoMemories(instance, 1, 1);
+})();
+
+(function testMemoryIndexDecodedAsU32() {
+  print(arguments.callee.name);
+  for (let leb_length = 1; leb_length <= 6; ++leb_length) {
+    // Create the array [0x80, 0x80, ..., 0x0] of length `leb_length`. This
+    // encodes `0` using `leb_length` bytes.
+    const leb = new Array(leb_length).fill(0x80).with(leb_length - 1, 0);
+    const builder = new WasmModuleBuilder();
+    builder.addMemory(1, 1);
+    builder.addFunction('load', kSig_i_i)
+        .addBody([kExprLocalGet, 0, kExprI32LoadMem, 0x40, ...leb, 0])
+        .exportFunc();
+    builder.addFunction('store', kSig_v_ii)
+        .addBody([
+          kExprLocalGet, 0, kExprLocalGet, 1, kExprI32StoreMem, 0x40, ...leb, 0
+        ])
+        .exportFunc();
+    builder.exportMemoryAs('mem');
+
+    if (leb_length == 6) {
+      assertThrows(
+          () => builder.instantiate(), WebAssembly.CompileError,
+          /length overflow while decoding memory index/);
+      continue;
+    }
+    const instance = builder.instantiate();
+    assertEquals(0, instance.exports.load(7));
+    instance.exports.store(7, 11);
+    assertEquals(11, instance.exports.load(7));
+    assertEquals(0, instance.exports.load(11));
+
+    const expected_memory = new Uint8Array(kPageSize);
+    expected_memory[7] = 11;
+    assertMemoryEquals(expected_memory, instance.exports.mem);
+  }
+})();
+
+(function testImportedAndDeclaredMemories() {
+  print(arguments.callee.name);
+  const builder = new WasmModuleBuilder();
+  builder.addImportedMemory('imp', 'mem0');
+  builder.addMemory(1, 1);
+  addLoadAndStoreFunctions(builder, 0);
+  addLoadAndStoreFunctions(builder, 1);
+
+  const mem0 = new WebAssembly.Memory({initial: 3, maximum: 4});
+  const instance = builder.instantiate({imp: {mem0: mem0}});
+  testTwoMemories(instance, 3, 1);
+})();
+
+(function testTwoImportedMemories() {
+  print(arguments.callee.name);
+  const builder = new WasmModuleBuilder();
+  builder.addImportedMemory('imp', 'mem0');
+  builder.addImportedMemory('imp', 'mem1');
+  addLoadAndStoreFunctions(builder, 0);
+  addLoadAndStoreFunctions(builder, 1);
+
+  const mem0 = new WebAssembly.Memory({initial: 2, maximum: 3});
+  const mem1 = new WebAssembly.Memory({initial: 3, maximum: 4});
+  const instance = builder.instantiate({imp: {mem0: mem0, mem1: mem1}});
+  testTwoMemories(instance, 2, 3);
+})();
+
+(function testTwoExportedMemories() {
+  print(arguments.callee.name);
+  const builder = new WasmModuleBuilder();
+  const mem0_idx = builder.addMemory(1, 1);
+  const mem1_idx = builder.addMemory(1, 1);
+  addLoadAndStoreFunctions(builder, mem0_idx);
+  addLoadAndStoreFunctions(builder, mem1_idx);
+  builder.exportMemoryAs('mem0', mem0_idx);
+  builder.exportMemoryAs('mem1', mem1_idx);
+
+  const instance = builder.instantiate();
+  const mem0 = new Uint8Array(instance.exports.mem0.buffer);
+  const mem1 = new Uint8Array(instance.exports.mem1.buffer);
+  assertEquals(0, mem0[11]);
+  assertEquals(0, mem1[11]);
+
+  instance.exports.store0(47, 11);
+  assertEquals(47, mem0[11]);
+  assertEquals(0, mem1[11]);
+
+  instance.exports.store1(49, 11);
+  assertEquals(47, mem0[11]);
+  assertEquals(49, mem1[11]);
+})();
+
+(function testMultiMemoryDataSegments() {
+  print(arguments.callee.name);
+  var builder = new WasmModuleBuilder();
+  const mem0_idx = builder.addMemory(1, 1);
+  const mem1_idx = builder.addMemory(1, 1);
+  addLoadAndStoreFunctions(builder, mem0_idx);
+  addLoadAndStoreFunctions(builder, mem1_idx);
+  const mem0_offset = 11;
+  const mem1_offset = 23;
+  builder.addDataSegment(mem1_offset, [7, 7], false, 1);
+  builder.addDataSegment(mem0_offset, [9, 9], false, 0);
+  builder.exportMemoryAs('mem0', 0);
+  builder.exportMemoryAs('mem1', 1);
+
+  const instance = builder.instantiate();
+  const expected_memory0 = new Uint8Array(kPageSize);
+  expected_memory0.set([9, 9], mem0_offset);
+  const expected_memory1 = new Uint8Array(kPageSize);
+  expected_memory1.set([7, 7], mem1_offset);
+
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+})();
+
+(function testMultiMemoryDataSegmentsOutOfBounds() {
+  print(arguments.callee.name);
+  // Check that we use the right memory size for the bounds check.
+  for (let [mem0_size, mem1_size] of [[1, 2], [2, 1]]) {
+    for (let [mem0_offset, mem1_offset] of [[0, 0], [1, 2], [0, 2], [1, 0]]) {
+      var builder = new WasmModuleBuilder();
+      const mem0_idx = builder.addMemory(mem0_size, mem0_size);
+      const mem1_idx = builder.addMemory(mem1_size, mem1_size);
+      builder.addDataSegment(mem0_offset * kPageSize, [0], false, mem0_idx);
+      builder.addDataSegment(mem1_offset * kPageSize, [0], false, mem1_idx);
+      if (mem0_offset < mem0_size && mem1_offset < mem1_size) {
+        builder.instantiate();  // should not throw.
+        continue;
+      }
+      const oob = mem0_offset >= mem0_size ? 0 : 1;
+      const expected_offset = [mem0_offset, mem1_offset][oob] * kPageSize;
+      const expected_mem_size = [mem0_size, mem1_size][oob] * kPageSize;
+      const expected_msg =
+          `WebAssembly.Instance(): data segment ${oob} is out of bounds ` +
+          `(offset ${expected_offset}, length 1, ` +
+          `memory size ${expected_mem_size})`;
+      assertThrows(
+          () => builder.instantiate(), WebAssembly.RuntimeError, expected_msg);
+    }
+  }
+})();
+
+(function testMultiMemoryInit() {
+  print(arguments.callee.name);
+  var builder = new WasmModuleBuilder();
+  const mem0_idx = builder.addMemory(1, 1);
+  const mem1_idx = builder.addMemory(1, 1);
+  const mem0_offset = 11;
+  const mem1_offset = 23;
+  const seg0_init = [5, 4, 3];
+  const seg0_id = builder.addPassiveDataSegment(seg0_init);
+  const seg1_init = [11, 10, 9, 8, 7];
+  const seg1_id = builder.addPassiveDataSegment(seg1_init);
+  builder.exportMemoryAs('mem0', mem0_idx);
+  builder.exportMemoryAs('mem1', mem1_idx);
+  // Initialize memory 1 from data segment 0 and vice versa.
+  addMemoryInitFunction(builder, mem0_idx, seg1_id);
+  addMemoryInitFunction(builder, mem1_idx, seg0_id);
+
+  const instance = builder.instantiate();
+  const expected_memory0 = new Uint8Array(kPageSize);
+  const expected_memory1 = new Uint8Array(kPageSize);
+
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  instance.exports.init0_1(3, 1, 3);
+  expected_memory0.set(seg1_init.slice(1, 4), 3);
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  instance.exports.init1_0(17, 0, 2);
+  expected_memory1.set(seg0_init.slice(0, 2), 17);
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  assertTraps(kTrapMemOutOfBounds, () => instance.exports.init0_1(0, 5, 1));
+  assertTraps(kTrapMemOutOfBounds, () => instance.exports.init1_0(0, 3, 1));
+})();
+
+(function testMultiMemoryFill() {
+  print(arguments.callee.name);
+  var builder = new WasmModuleBuilder();
+  const mem0_idx = builder.addMemory(1, 1);
+  const mem1_idx = builder.addMemory(2, 2);
+  builder.exportMemoryAs('mem0', mem0_idx);
+  builder.exportMemoryAs('mem1', mem1_idx);
+  addMemoryFillFunction(builder, mem0_idx);
+  addMemoryFillFunction(builder, mem1_idx);
+
+  const instance = builder.instantiate();
+  const expected_memory0 = new Uint8Array(kPageSize);
+  const expected_memory1 = new Uint8Array(2 * kPageSize);
+
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  // Fill [3..4] in mem0 with value 7.
+  instance.exports.fill0(3, 7, 2);  // dst, value, size
+  expected_memory0.fill(7, 3, 5);   // value, start, end
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  // Fill [4..11] in mem0 with value 17.
+  instance.exports.fill1(4, 17, 8);  // dst, value, size
+  expected_memory1.fill(17, 4, 12);  // value, start, end
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  // mem0 has size 1.
+  instance.exports.fill0(kPageSize - 1, 1, 1);
+  assertTraps(
+      kTrapMemOutOfBounds, () => instance.exports.fill0(kPageSize - 1, 1, 2));
+  assertTraps(
+      kTrapMemOutOfBounds, () => instance.exports.fill0(kPageSize, 1, 1));
+
+  // mem1 has size 2.
+  instance.exports.fill1(2 * kPageSize - 1, 1, 1);
+  assertTraps(
+      kTrapMemOutOfBounds,
+      () => instance.exports.fill1(2 * kPageSize - 1, 1, 2));
+  assertTraps(
+      kTrapMemOutOfBounds, () => instance.exports.fill1(2 * kPageSize, 1, 1));
+})();
+
+(function testMultiMemoryCopy() {
+  print(arguments.callee.name);
+  var builder = new WasmModuleBuilder();
+  const mem0_id = 0;
+  builder.addMemory(1, 1);
+  const mem1_id = 1;
+  builder.addMemory(2, 2);
+  builder.exportMemoryAs('mem0', mem0_id);
+  builder.exportMemoryAs('mem1', mem1_id);
+  addMemoryCopyFunction(builder, mem0_id, mem0_id);
+  addMemoryCopyFunction(builder, mem0_id, mem1_id);
+  addMemoryCopyFunction(builder, mem1_id, mem0_id);
+  addMemoryCopyFunction(builder, mem1_id, mem1_id);
+
+  const instance = builder.instantiate();
+  const expected_memory0 = new Uint8Array(kPageSize);
+  const expected_memory1 = new Uint8Array(2 * kPageSize);
+
+  // Set some initial bytes that we can then copy around.
+  new Uint8Array(instance.exports.mem0.buffer).set([1, 2, 3, 4, 5]);
+  expected_memory0.set([1, 2, 3, 4, 5], 0);
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+
+  // Copy [3..5] to [7..9] in mem0.
+  instance.exports.copy0_0(7, 3, 3);  // dst, src, size
+  expected_memory0.set([1, 2, 3, 4, 5, 0, 0, 4, 5, 0]);
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+
+  // Copy [3..7] from mem0 to [2..6] in mem1.
+  instance.exports.copy1_0(2, 3, 5);  // dst, src, size
+  expected_memory1.set([0, 0, 4, 5, 0, 0, 4]);
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  // Copy [3..4] from mem1 to [1..3] in mem0.
+  instance.exports.copy0_1(1, 3, 2);  // dst, src, size
+  expected_memory0.set([5, 0], 1);
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  // Copy [2..4] to [0..2] in mem1.
+  instance.exports.copy1_1(0, 2, 3);  // dst, src, size
+  expected_memory1.set([4, 5, 0]);
+  assertMemoryEquals(expected_memory0, instance.exports.mem0);
+  assertMemoryEquals(expected_memory1, instance.exports.mem1);
+
+  const mem0_size = kPageSize;
+  const mem1_size = 2 * kPageSize;
+  for ([method, dst_size, src_size] of [
+           [instance.exports.copy0_0, mem0_size, mem0_size],
+           [instance.exports.copy0_1, mem0_size, mem1_size],
+           [instance.exports.copy1_0, mem1_size, mem0_size],
+           [instance.exports.copy1_1, mem1_size, mem1_size]]) {
+    print(`- ${method}`);
+    // Test at the boundary.
+    method(dst_size - 1, src_size - 1, 1);
+    // Then test one byte further.
+    assertTraps(kTrapMemOutOfBounds, () => method(dst_size, src_size - 1, 1));
+    assertTraps(kTrapMemOutOfBounds, () => method(dst_size - 1, src_size, 1));
+    assertTraps(
+        kTrapMemOutOfBounds, () => method(dst_size - 1, src_size - 2, 2));
+    assertTraps(
+        kTrapMemOutOfBounds, () => method(dst_size - 2, src_size - 1, 2));
+  }
+})();
+
+(function testGrowMultipleMemories() {
+  print(arguments.callee.name);
+  var builder = new WasmModuleBuilder();
+  const mem0_idx = builder.addMemory(1, 4);
+  const mem1_idx = builder.addMemory(1, 5);
+  addGrowAndSizeFunctions(builder, mem0_idx);
+  addGrowAndSizeFunctions(builder, mem1_idx);
+  builder.exportMemoryAs('mem0', mem0_idx);
+  builder.exportMemoryAs('mem1', mem1_idx);
+  const instance = builder.instantiate();
+
+  assertEquals(1, instance.exports.grow0(2));
+  assertEquals(3, instance.exports.grow0(1));
+  assertEquals(4, instance.exports.size0());
+  assertEquals(-1, instance.exports.grow0(1));
+  assertEquals(4, instance.exports.size0());
+
+  assertEquals(1, instance.exports.grow1(2));
+  assertEquals(3, instance.exports.grow1(2));
+  assertEquals(5, instance.exports.size1());
+  assertEquals(-1, instance.exports.grow1(1));
+  assertEquals(5, instance.exports.size1());
+})();
+
+(function testGrowDecodesMemoryIndexAsU32() {
+  print(arguments.callee.name);
+  for (let leb_length = 1; leb_length <= 6; ++leb_length) {
+    // Create the array [0x80, 0x80, ..., 0x0] of length `leb_length`. This
+    // encodes `0` using `leb_length` bytes.
+    const leb = new Array(leb_length).fill(0x80).with(leb_length - 1, 0);
+    var builder = new WasmModuleBuilder();
+    builder.addMemory(1, 4);
+    builder.addFunction('grow', kSig_i_i)
+        .addBody([kExprLocalGet, 0, kExprMemoryGrow, ...leb])
+        .exportFunc();
+    builder.exportMemoryAs('mem', 0);
+
+    if (leb_length == 6) {
+      assertThrows(
+          () => builder.instantiate(), WebAssembly.CompileError,
+          /length overflow while decoding memory index/);
+      continue;
+    }
+    const instance = builder.instantiate();
+
+    assertEquals(1, instance.exports.grow(2));
+    assertEquals(-1, instance.exports.grow(2));
+    assertEquals(3, instance.exports.grow(1));
+  }
+})();
+
+(function testMultipleMemoriesInOneFunction() {
+  print(arguments.callee.name);
+  // Some "interesting" access patterns.
+  const mem_indexes_list =
+      [[0, 1, 0, 1], [1, 0, 1, 0], [0, 0, 1, 1], [1, 1, 0, 0]];
+  const builder = new WasmModuleBuilder();
+  const mem0_idx = builder.addMemory(1, 1);
+  const mem1_idx = builder.addMemory(1, 1);
+  for (let [idx, mem_indexes] of mem_indexes_list.entries()) {
+    let sig = makeSig(new Array(4).fill(kWasmI32), [kWasmI32]);
+    builder.addFunction(`load${idx}`, sig)
+        .addBody([
+          kExprLocalGet, 0, kExprI32LoadMem, 0x40, mem_indexes[0], 0,  // load 1
+          kExprLocalGet, 1, kExprI32LoadMem, 0x40, mem_indexes[1], 0,  // load 2
+          kExprI32Add,                                                 // add
+          kExprLocalGet, 2, kExprI32LoadMem, 0x40, mem_indexes[2], 0,  // load 3
+          kExprI32Add,                                                 // add
+          kExprLocalGet, 3, kExprI32LoadMem, 0x40, mem_indexes[3], 0,  // load 4
+          kExprI32Add,                                                 // add
+        ])
+        .exportFunc();
+  }
+  builder.exportMemoryAs('mem0', mem0_idx);
+  builder.exportMemoryAs('mem1', mem1_idx);
+
+  const instance = builder.instantiate();
+
+  // Create random memory contents.
+  let buf0 = new DataView(instance.exports.mem0.buffer);
+  let buf1 = new DataView(instance.exports.mem1.buffer);
+  for (let i = 0; i < kPageSize; ++i) {
+    buf0.setUint8(i, Math.floor(Math.random() * 0xff));
+    buf1.setUint8(i, Math.floor(Math.random() * 0xff));
+  }
+
+  for (let run = 0; run < 10; ++run) {
+    let inputs = new Array(4).fill(0).map(
+        i => Math.floor(Math.random() * kPageSize));
+    for (let [func_idx, mem_indexes] of mem_indexes_list.entries()) {
+      let expected = 0;
+      for (let i = 0; i < 4; ++i) {
+        let buf = mem_indexes[i] == 0 ? buf0 : buf1;
+        expected += buf.getInt32(inputs[i], true);
+      }
+      expected >>= 0;  // Truncate to 32 bit.
+      assertEquals(expected, instance.exports[`load${func_idx}`](...inputs));
+    }
+  }
+})();
+
+(function testAtomicsOnMultiMemory() {
+  print(arguments.callee.name);
+  const builder = new WasmModuleBuilder();
+  const mem0_idx = builder.addMemory(1, 1, true);
+  const mem1_idx = builder.addMemory(2, 2, true);
+  builder.exportMemoryAs('mem0', mem0_idx);
+  builder.exportMemoryAs('mem1', mem1_idx);
+
+  for (let mem_idx of [mem0_idx, mem1_idx]) {
+    builder.addFunction(`load${mem_idx}`, kSig_i_i)
+        .addBody([
+          kExprLocalGet, 0,                                    // -
+          kAtomicPrefix, kExprI32AtomicLoad, 0x42, mem_idx, 0  // -
+        ])
+        .exportFunc();
+    builder.addFunction(`store${mem_idx}`, kSig_v_ii)
+        .addBody([
+          kExprLocalGet, 0,                                     // -
+          kExprLocalGet, 1,                                     // -
+          kAtomicPrefix, kExprI32AtomicStore, 0x42, mem_idx, 0  // -
+        ])
+        .exportFunc();
+    builder.addFunction(`cmpxchg${mem_idx}`, kSig_i_iii)
+        .addBody([
+          kExprLocalGet, 0,                                               // -
+          kExprLocalGet, 1,                                               // -
+          kExprLocalGet, 2,                                               // -
+          kAtomicPrefix, kExprI32AtomicCompareExchange, 0x42, mem_idx, 0  // -
+        ])
+        .exportFunc();
+  }
+
+  const instance = builder.instantiate();
+
+  const {mem0, load0, store0, cmpxchg0, mem1, load1, store1, cmpxchg1} =
+      instance.exports;
+
+  const data0 = new DataView(mem0.buffer);
+  const data1 = new DataView(mem1.buffer);
+
+  const offset0 = 16;
+  const value0 = 13;
+  store0(offset0, value0);
+  assertEquals(value0, load0(offset0));
+  assertEquals(0, load1(offset0));
+
+  const offset1 = 24;
+  const value1 = 11;
+  store1(offset1, value1);
+  assertEquals(value1, load1(offset1));
+  assertEquals(0, load0(offset1));
+
+  assertEquals(value0, cmpxchg0(offset0, -1, -1));
+  assertEquals(value0, cmpxchg0(offset0, value0, value1));
+  assertEquals(value1, load0(offset0));
+
+  assertEquals(value1, cmpxchg1(offset1, -1, -1));
+  assertEquals(value1, cmpxchg1(offset1, value1, value0));
+  assertEquals(value0, load1(offset1));
+
+  assertEquals(0, load0(offset1));
+  assertEquals(0, load1(offset0));
+
+  // Test traps.
+  assertEquals(0, load0(kPageSize - 4));
+  assertEquals(0, load1(2 * kPageSize - 4));
+  assertTraps(kTrapMemOutOfBounds, () => load0(kPageSize));
+  assertTraps(kTrapMemOutOfBounds, () => load1(2 * kPageSize));
+})();
diff --git a/deps/v8/test/mjsunit/wasm/multi-memory64.js b/deps/v8/test/mjsunit/wasm/multi-memory64.js
new file mode 100644
index 00000000000000..d567c333b81298
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/multi-memory64.js
@@ -0,0 +1,136 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-multi-memory --experimental-wasm-memory64
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+function assertMemoryEquals(expected, memory) {
+  assertInstanceof(memory, WebAssembly.Memory);
+  assertInstanceof(expected, Uint8Array);
+  const buf = new Uint8Array(memory.buffer);
+  // For better output, check the first 50 bytes separately first.
+  assertEquals(expected.slice(0, 50), buf.slice(0, 50));
+  // Now also check the full memory content.
+  assertEquals(expected, buf);
+}
+
+(function testBasicMultiMemory() {
+  print(arguments.callee.name);
+  // Test two memories: One 32-bit and one 64-bit, in both orders.
+  for (let mem64_idx of [0, 1]) {
+    const builder = new WasmModuleBuilder();
+    const mem32_idx = 1 - mem64_idx;
+
+    const mem32_pages = 1;
+    const mem32_size = mem32_pages * kPageSize;
+    const mem64_pages = 3;
+    const mem64_size = mem64_pages * kPageSize;
+    if (mem32_idx == 0) {
+      builder.addMemory(mem32_pages, mem32_pages);
+      builder.addMemory64(mem64_pages, mem64_pages);
+    } else {
+      builder.addMemory64(mem64_pages, mem64_pages);
+      builder.addMemory(mem32_pages, mem32_pages);
+    }
+    builder.exportMemoryAs('mem32', mem32_idx);
+    builder.exportMemoryAs('mem64', mem64_idx);
+
+    builder.addFunction('load32', kSig_i_i)
+        .addBody([kExprLocalGet, 0, kExprI32LoadMem, 0x40, mem32_idx, 0])
+        .exportFunc();
+    builder.addFunction('load64', kSig_i_l)
+        .addBody([kExprLocalGet, 0, kExprI32LoadMem, 0x40, mem64_idx, 0])
+        .exportFunc();
+
+    const instance = builder.instantiate();
+    const mem32_offset = 48;
+    const mem64_offset = 16;
+    const value = 13;
+    const view32 = new DataView(instance.exports.mem32.buffer);
+    const view64 = new DataView(instance.exports.mem64.buffer);
+    view32.setInt32(mem32_offset, value, true);
+    view64.setInt32(mem64_offset, value, true);
+
+    const {load32, load64} = instance.exports;
+
+    assertEquals(value, load32(mem32_offset));
+    assertEquals(0, load32(mem64_offset));
+    assertEquals(0, load64(BigInt(mem32_offset)));
+    assertEquals(value, load64(BigInt(mem64_offset)));
+
+    assertEquals(0, load32(mem32_size - 4));
+    assertEquals(0, load64(BigInt(mem64_size - 4)));
+    assertTraps(kTrapMemOutOfBounds, () => load32(mem32_size - 3));
+    assertTraps(kTrapMemOutOfBounds, () => load64(BigInt(mem64_size - 3)));
+  }
+})();
+
+(function testMultiMemoryInit() {
+  print(arguments.callee.name);
+  // Test two memories: One 32-bit and one 64-bit, in both orders.
+  for (let mem64_idx of [0, 1]) {
+    const builder = new WasmModuleBuilder();
+    const mem32_idx = 1 - mem64_idx;
+
+    const mem32_pages = 1;
+    const mem32_size = mem32_pages * kPageSize;
+    const mem64_pages = 3;
+    const mem64_size = mem64_pages * kPageSize;
+    if (mem32_idx == 0) {
+      builder.addMemory(mem32_pages, mem32_pages);
+      builder.addMemory64(mem64_pages, mem64_pages);
+    } else {
+      builder.addMemory64(mem64_pages, mem64_pages);
+      builder.addMemory(mem32_pages, mem32_pages);
+    }
+    builder.exportMemoryAs('mem32', mem32_idx);
+    builder.exportMemoryAs('mem64', mem64_idx);
+
+    const data = [1, 2, 3, 4, 5];
+    const seg_id = builder.addPassiveDataSegment(data);
+
+    builder.addFunction('init32', kSig_v_iii)
+        .addBody([
+          kExprLocalGet, 0,  // dst
+          kExprLocalGet, 1,  // offset
+          kExprLocalGet, 2,  // size
+          kNumericPrefix, kExprMemoryInit, seg_id, mem32_idx
+        ])
+        .exportFunc();
+    builder.addFunction('init64', kSig_v_lii)
+        .addBody([
+          kExprLocalGet, 0,  // dst
+          kExprLocalGet, 1,  // offset
+          kExprLocalGet, 2,  // size
+          kNumericPrefix, kExprMemoryInit, seg_id, mem64_idx
+        ])
+        .exportFunc();
+
+    const instance = builder.instantiate();
+    const {init32, init64} = instance.exports;
+    const expected_mem32 = new Uint8Array(mem32_size);
+    const expected_mem64 = new Uint8Array(mem64_size);
+
+    assertMemoryEquals(expected_mem32, instance.exports.mem32);
+    assertMemoryEquals(expected_mem64, instance.exports.mem64);
+
+    init32(7, 1, 3);  // dst, (data) offset, size
+    expected_mem32.set(data.slice(1, 4), 7);
+    assertMemoryEquals(expected_mem32, instance.exports.mem32);
+    assertMemoryEquals(expected_mem64, instance.exports.mem64);
+
+    init64(11n, 3, 2);  // dst, (data) offset, size
+    expected_mem64.set(data.slice(3, 5), 11);
+    assertMemoryEquals(expected_mem32, instance.exports.mem32);
+    assertMemoryEquals(expected_mem64, instance.exports.mem64);
+
+    // Test bounds checks.
+    init32(mem32_size - 1, 0, 1);  // dst, (data) offset, size
+    assertTraps(kTrapMemOutOfBounds, () => init32(mem32_size - 1, 0, 2));
+    init64(BigInt(mem64_size - 1), 0, 1);  // dst, (data) offset, size
+    assertTraps(
+        kTrapMemOutOfBounds, () => init64(BigInt(mem64_size - 1), 0, 2));
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/multiple-code-spaces.js b/deps/v8/test/mjsunit/wasm/multiple-code-spaces.js
index c4c0c87526bee1..7160e66479b688 100644
--- a/deps/v8/test/mjsunit/wasm/multiple-code-spaces.js
+++ b/deps/v8/test/mjsunit/wasm/multiple-code-spaces.js
@@ -25,7 +25,7 @@ while (true) {
     throw new Error('We should have hit four code spaces by now');
   }
   const builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   builder.addFunction('f0', kSig_i_i).addBody([kExprLocalGet, 0]);
   // Generate some code per function to fill the code space.
   // Each function contains a number of loads that will not be executed
diff --git a/deps/v8/test/mjsunit/wasm/parallel_compilation.js b/deps/v8/test/mjsunit/wasm/parallel_compilation.js
index 46fa01b590b472..9f61f10987bb03 100644
--- a/deps/v8/test/mjsunit/wasm/parallel_compilation.js
+++ b/deps/v8/test/mjsunit/wasm/parallel_compilation.js
@@ -46,7 +46,8 @@ function assertFunction(module, func) {
 
   var builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
+  builder.exportMemoryAs("memory");
   for (i = 0; i < 1000; i++) {
     builder.addFunction("sub" + i, kSig_i_i)
       .addBody([                // --
@@ -80,7 +81,8 @@ function assertFunction(module, func) {
           ])
           .exportFunc()
 
-  builder.addMemory(1, 1, true);
+  builder.addMemory(1, 1);
+  builder.exportMemoryAs("memory");
   for (i = 1; i < 256; i++) {
     f[i] = builder.addFunction("add" + i, kSig_i_ii)
       .addBody([                                            // --
diff --git a/deps/v8/test/mjsunit/wasm/recognize-imports.js b/deps/v8/test/mjsunit/wasm/recognize-imports.js
index 1c4c232536de69..93233e69c51186 100644
--- a/deps/v8/test/mjsunit/wasm/recognize-imports.js
+++ b/deps/v8/test/mjsunit/wasm/recognize-imports.js
@@ -6,6 +6,30 @@
 
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
+function CheckStackTrace(thrower, reference, topmost_wasm_func) {
+  let reference_exception;
+  let actual_exception;
+  try {
+    thrower();
+    assertUnreachable();
+  } catch (e) {
+    actual_exception = e;
+  }
+  try {
+    reference();
+    assertUnreachable();
+  } catch (e) {
+    reference_exception = e;
+  }
+  assertInstanceof(actual_exception, reference_exception.constructor);
+  let actual_stack = actual_exception.stack.split('\n');
+  let reference_stack = reference_exception.stack.split('\n');
+  assertEquals(reference_stack[0], actual_stack[0]);
+  assertEquals(reference_stack[1], actual_stack[1]);
+  assertTrue(
+      actual_stack[2].startsWith(`    at ${topmost_wasm_func} (wasm://wasm/`));
+}
+
 let builder = new WasmModuleBuilder();
 let sig_w_w = makeSig([kWasmStringRef], [kWasmStringRef]);
 let toLowerCase = builder.addImport("m", "toLowerCase", sig_w_w);
@@ -28,9 +52,9 @@ assertEquals("abc", call_tolower("ABC"));
 
 // Null should be handled correctly (by throwing the same TypeError that
 // JavaScript would throw).
-assertThrows(
-    () => call_tolower(null), TypeError,
-    /String.prototype.toLowerCase called on null or undefined/);
+CheckStackTrace(
+    () => call_tolower(null), () => String.prototype.toLowerCase.call(null),
+    'call_tolower');
 
 // Creating a second instance with identical imports should not cause
 // recompilation.
@@ -46,3 +70,125 @@ let instance3 = new WebAssembly.Instance(module, other_imports);
 assertEquals("foo", instance3.exports.call_tolower("GHI"));
 assertEquals("def", instance2.exports.call_tolower("DEF"));
 assertEquals("abc", instance1.exports.call_tolower("ABC"));
+
+(function TestIntToString() {
+  console.log("Testing IntToString");
+  let builder = new WasmModuleBuilder();
+  let sig_w_ii = makeSig([kWasmI32, kWasmI32], [kWasmStringRef]);
+  let intToString = builder.addImport("m", "intToString", sig_w_ii);
+  builder.addFunction('call_inttostring', sig_w_ii).exportFunc().addBody([
+    kExprLocalGet, 0,
+    kExprLocalGet, 1,
+    kExprCallFunction, intToString,
+  ]);
+  let func = Function.prototype.call.bind(Number.prototype.toString);
+  let instance = builder.instantiate({ m: { intToString: func } });
+  let call_inttostring = instance.exports.call_inttostring;
+  %WasmTierUpFunction(call_inttostring);
+  assertEquals("42", call_inttostring(42, 10));
+  assertEquals("-123", call_inttostring(-123, 10));
+  assertEquals("2a", call_inttostring(42, 16));
+  assertEquals("2147483647", call_inttostring(2147483647, 10));
+  assertEquals("-2147483648", call_inttostring(-2147483648, 10));
+  CheckStackTrace(
+      () => call_inttostring(1, 99), () => func(1, 99), 'call_inttostring');
+})();
+
+(function TestDoubleToString() {
+  console.log("Testing DoubleToString");
+  let builder = new WasmModuleBuilder();
+  let sig_d_w = makeSig([kWasmStringRef], [kWasmF64]);
+  let sig_w_d = makeSig([kWasmF64], [kWasmStringRef]);
+  let doubleToString = builder.addImport("m", "doubleToString", sig_w_d);
+  let stringToDouble = builder.addImport("m", "stringToDouble", sig_d_w);
+  builder.addFunction('call_doubletostring', sig_w_d).exportFunc().addBody([
+    kExprLocalGet, 0,
+    kExprCallFunction, doubleToString,
+  ]);
+  builder.addFunction('call_stringtodouble', sig_d_w).exportFunc().addBody([
+    kExprLocalGet, 0,
+    kExprCallFunction, stringToDouble,
+  ]);
+  let wasm = builder.instantiate({
+    m: {
+      doubleToString: Function.prototype.call.bind(Number.prototype.toString),
+      stringToDouble: parseFloat,
+    }
+  }).exports;
+  let d2s = wasm.call_doubletostring;
+  let s2d = wasm.call_stringtodouble;
+  %WasmTierUpFunction(d2s);
+  %WasmTierUpFunction(s2d);
+  assertEquals("42", d2s(42));
+  assertEquals("1234.5", d2s(1234.5));
+  assertEquals("NaN", d2s(NaN));
+  assertEquals(1234.5, s2d("1234.5"));
+  assertEquals(NaN, s2d(null));
+})();
+
+(function TestIndexOf() {
+  console.log("Testing String.indexOf");
+  let builder = new WasmModuleBuilder();
+  let sig_i_wwi =
+      makeSig([kWasmStringRef, kWasmStringRef, kWasmI32], [kWasmI32]);
+  let indexOf = builder.addImport("m", "indexOf", sig_i_wwi);
+  builder.addFunction('call_indexof', sig_i_wwi).exportFunc().addBody([
+    kExprLocalGet, 0,
+    kExprLocalGet, 1,
+    kExprLocalGet, 2,
+    kExprCallFunction, indexOf,
+  ]);
+  indexOf = builder.instantiate({
+      m: {indexOf: Function.prototype.call.bind(String.prototype.indexOf)}
+  }).exports.call_indexof;
+  %WasmTierUpFunction(indexOf);
+  assertEquals(2, indexOf("xxfooxx", "foo", 0));
+  assertEquals(2, indexOf("xxfooxx", "foo", -2));
+  assertEquals(-1, indexOf("xxfooxx", "foo", 100));
+  // Make sure we don't lose bits when Smi-tagging of the start position.
+  assertEquals(-1, indexOf("xxfooxx", "foo", 0x4000_0000));
+  assertEquals(-1, indexOf("xxfooxx", "foo", 0x2000_0000));
+  assertEquals(2, indexOf("xxfooxx", "foo", 0x8000_0000));  // Negative i32.
+  // When first arg is null, throw; when second arg is null, convert.
+  assertEquals(2, indexOf("xxnullxx", null, 0));
+  CheckStackTrace(
+      () => indexOf(null, 'null', 0),
+      () => String.prototype.indexOf.call(null, 'null', 0), 'call_indexof');
+})();
+
+(function TestToLocaleLower() {
+  console.log("Testing String.toLocaleLowerCase");
+  let builder = new WasmModuleBuilder();
+  let sig_w_ww = makeSig([kWasmStringRef, kWasmStringRef], [kWasmStringRef]);
+  let tolower = builder.addImport("m", "tolower", sig_w_ww);
+  builder.addFunction('call_tolower', sig_w_ww).exportFunc().addBody([
+    kExprLocalGet, 0,
+    kExprLocalGet, 1,
+    kExprCallFunction, tolower,
+  ]);
+  tolower = builder.instantiate({
+    m: {
+      tolower: Function.prototype.call.bind(String.prototype.toLocaleLowerCase)
+    }
+  }).exports.call_tolower;
+  %WasmTierUpFunction(tolower);
+  assertEquals("abc", tolower("ABC", "en"));
+  let has_i18n = typeof Intl !== "undefined";
+  if (has_i18n) {
+    // Check that the locale isn't ignored.
+    assertEquals("\u0131", tolower("I", "az"));
+    CheckStackTrace(
+        () => tolower('ABC', null),
+        () => String.prototype.toLocaleLowerCase.call('ABC', null),
+        'call_tolower');
+  } else {
+    // Non-i18n builds ignore the locale parameter.
+    assertEquals("i", tolower("I", "az"));
+    assertEquals('abc', tolower('ABC', null));
+    assertEquals('abc', String.prototype.toLocaleLowerCase.call('ABC', null));
+  }
+  CheckStackTrace(
+      () => tolower(null, 'en'),
+      () => String.prototype.toLocaleLowerCase.call(null, 'en'),
+      'call_tolower');
+})();
diff --git a/deps/v8/test/mjsunit/wasm/ref-cast-js-function.js b/deps/v8/test/mjsunit/wasm/ref-cast-js-function.js
new file mode 100644
index 00000000000000..b84ac3b18f03c7
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/ref-cast-js-function.js
@@ -0,0 +1,32 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --experimental-wasm-type-reflection
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+(function RefCastWasmJSFunction() {
+  const paramsTypes = [kWasmI32];
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+  const impIndex = builder.addImport('m', 'foo', sigId);
+
+  const table = builder.addTable(kWasmAnyFunc, 10).index;
+  builder.addActiveElementSegment(table, wasmI32Const(0), [impIndex]);
+
+  builder.addFunction('main', sigId)
+    .addBody([
+      kExprLocalGet, 0, kExprI32Const, 0, kExprTableGet, table, kGCPrefix,
+      kExprRefCast, sigId, kExprCallRef, sigId
+    ])
+    .exportFunc();
+  const jsFunc = new WebAssembly.Function(
+    { parameters: ['i32'], results: [] },
+    () => 12 );
+  const instance = builder.instantiate({ 'm': { 'foo': jsFunc } });
+  instance.exports.main(15);
+})();
diff --git a/deps/v8/test/mjsunit/wasm/reference-table-js-interop.js b/deps/v8/test/mjsunit/wasm/reference-table-js-interop.js
index fae5471fe4cd60..a5e057ef582727 100644
--- a/deps/v8/test/mjsunit/wasm/reference-table-js-interop.js
+++ b/deps/v8/test/mjsunit/wasm/reference-table-js-interop.js
@@ -29,7 +29,7 @@ for (let [typeName, type] of Object.entries(tableTypes)) {
       builder.instantiate({ imports: { table } });
     } else {
       let err = 'WebAssembly.Instance(): Import #0 module="imports" ' +
-                'function="table" error: imported table does not match the ' +
+                'function="table": imported table does not match the ' +
                 'expected type';
       assertThrows(() => builder.instantiate({ imports: { table } }),
                    WebAssembly.LinkError,
@@ -200,7 +200,15 @@ for (let [typeName, type] of Object.entries(tableTypes)) {
     assertTraps(kTrapTableOutOfBounds, () => wasm.tableGetStructVal(size + 2));
     // Grow by 1 without initial value.
     table.grow(1, null);
-    table.grow(1, undefined);
+    if (typeName == "anyref") {
+      // Undefined is fine for anyref.
+      table.grow(1, undefined);
+    } else {
+      // But not for any other wasm internal type.
+      assertThrows(() => table.grow(1, undefined), TypeError);
+      // No-argument will use the default value.
+      table.grow(1);
+    }
   }
   if (typeName == "anyref") {
     table.grow(1, "Grow using a string");
diff --git a/deps/v8/test/mjsunit/wasm/reference-tables.js b/deps/v8/test/mjsunit/wasm/reference-tables.js
index 2255f6c4e9aada..88e16a0f704368 100644
--- a/deps/v8/test/mjsunit/wasm/reference-tables.js
+++ b/deps/v8/test/mjsunit/wasm/reference-tables.js
@@ -492,14 +492,14 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   let table = exporting_instance.exports.table;
   let instance = builder.instantiate({imports: {table}});
 
-  table.grow(5, undefined);
+  assertThrows(() => table.grow(5, undefined), TypeError);
+  table.grow(5);
   assertThrows(() => table.set(1, instance.exports.invalid_struct()),
                TypeError);
   table.set(1, instance.exports.valid_struct());
   table.set(2, instance.exports.valid_struct_sub());
   table.set(3, null);
-  assertThrows(() => table.set(1, undefined),
-               TypeError);
+  assertThrows(() => table.set(1, undefined), TypeError);
 })();
 
 (function TestMultiModuleRefTableSuperType() {
@@ -585,7 +585,7 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   let sub_struct = builder.addStruct(
     [makeField(kWasmI32, false), makeField(kWasmI32, false)], super_struct);
   let super_sig = builder.addType(
-    makeSig([kWasmI32], [wasmRefType(super_struct)]));
+    makeSig([kWasmI32], [wasmRefType(super_struct)]), kNoSuperType, false);
   let sub_sig = builder.addType(
     makeSig([kWasmI32], [wasmRefType(sub_struct)]), super_sig);
 
diff --git a/deps/v8/test/mjsunit/wasm/shared-memory.js b/deps/v8/test/mjsunit/wasm/shared-memory.js
index 394fc373d9a532..a9055ee510a58e 100644
--- a/deps/v8/test/mjsunit/wasm/shared-memory.js
+++ b/deps/v8/test/mjsunit/wasm/shared-memory.js
@@ -105,7 +105,8 @@ function assertMemoryIsValid(memory, shared) {
 (function TestInstantiateWithSharedDefined() {
   print("TestInstantiateWithSharedDefined");
   let builder = new WasmModuleBuilder();
-  builder.addMemory(2, 10, true, "shared");
+  builder.addMemory(2, 10, "shared");
+  builder.exportMemoryAs("memory");
   let module = new WebAssembly.Module(builder.toBuffer());
   let instance = new WebAssembly.Instance(module);
   assertMemoryIsValid(instance.exports.memory, true);
@@ -114,7 +115,7 @@ function assertMemoryIsValid(memory, shared) {
 (function TestAtomicOpWithSharedMemoryDefined() {
   print("TestAtomicOpWithSharedMemoryDefined");
   let builder = new WasmModuleBuilder();
-  builder.addMemory(2, 10, false, "shared");
+  builder.addMemory(2, 10, "shared");
   builder.addFunction("main", kSig_i_ii)
     .addBody([
       kExprLocalGet, 0,
@@ -136,6 +137,9 @@ function assertMemoryIsValid(memory, shared) {
       throw new Error(`Should not call [[HasProperty]] with ${x}`);
     },
     get(o, x) {
+      if (x === "index") {
+        return "u32";
+      }
       return 0;
     },
   });
diff --git a/deps/v8/test/mjsunit/wasm/simd-lane-memory64.js b/deps/v8/test/mjsunit/wasm/simd-lane-memory64.js
index 77c81206e82fb1..4a900fd690ce20 100644
--- a/deps/v8/test/mjsunit/wasm/simd-lane-memory64.js
+++ b/deps/v8/test/mjsunit/wasm/simd-lane-memory64.js
@@ -12,8 +12,9 @@ const SRC_OFFSET_LEB = [0x90, 0x95, 0x80, 0x80, 0x10];
 const DST_OFFSET = 4294970160n;
 const DST_OFFSET_LEB = [0xb0, 0x96, 0x80, 0x80, 0x10];
 
-var builder = new WasmModuleBuilder();
-builder.addMemory64(5 * GB / kPageSize).exportMemoryAs("memory");
+const builder = new WasmModuleBuilder();
+builder.addMemory64(5 * GB / kPageSize);
+builder.exportMemoryAs('memory');
 
 // Here we make a global of type v128 to be the target
 // for loading lanes and the source for storing lanes.
diff --git a/deps/v8/test/mjsunit/wasm/speculative-inlining.js b/deps/v8/test/mjsunit/wasm/speculative-inlining.js
index 7f9f28859f9c89..9759084cd57a14 100644
--- a/deps/v8/test/mjsunit/wasm/speculative-inlining.js
+++ b/deps/v8/test/mjsunit/wasm/speculative-inlining.js
@@ -2,14 +2,14 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-// Flags: --wasm-speculative-inlining --experimental-wasm-return-call
+// Flags: --experimental-wasm-inlining --experimental-wasm-return-call
 // Flags: --experimental-wasm-typed-funcref --experimental-wasm-type-reflection
 // Flags: --no-wasm-tier-up --wasm-dynamic-tiering --allow-natives-syntax
 
 // These tests check if functions are speculatively inlined as expected. We do
 // not check automatically which functions are inlined. To get more insight, run
-// with --trace-wasm-speculative-inlining, --trace-turbo, --trace-wasm and (for
-// the last test only) --trace.
+// with --trace-wasm-inlining, --trace-turbo, --trace-wasm and (for the last
+// test only) --trace.
 
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
diff --git a/deps/v8/test/mjsunit/wasm/stack-switching-export.js b/deps/v8/test/mjsunit/wasm/stack-switching-export.js
index 7b8c91e09efd0a..244ba34d326e27 100644
--- a/deps/v8/test/mjsunit/wasm/stack-switching-export.js
+++ b/deps/v8/test/mjsunit/wasm/stack-switching-export.js
@@ -44,7 +44,7 @@ function ToPromising(wasm_export) {
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main());
+  assertPromiseResult(main(), v => assertEquals(undefined, v));
   assertEquals(20, x);
 })();
 
@@ -60,7 +60,7 @@ function ToPromising(wasm_export) {
 
   let instance = builder.instantiate();
   let main = ToPromising(instance.exports.main);
-  assertTraps(kTrapUnreachable, main);
+  assertThrowsAsync(main(), WebAssembly.RuntimeError);
 })();
 
 (function testGenericWrapper1ParamTrap() {
@@ -76,7 +76,7 @@ function ToPromising(wasm_export) {
 
   let instance = builder.instantiate();
   let main = ToPromising(instance.exports.main);
-  assertTraps(kTrapUnreachable, main);
+  assertThrowsAsync(main(), WebAssembly.RuntimeError);
 })();
 
 (function testGenericWrapper1ParamGeneral() {
@@ -102,7 +102,7 @@ function ToPromising(wasm_export) {
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(5));
+  assertPromiseResult(main(5), v => { assertEquals(undefined, v); });
   assertEquals(17, x);
 })();
 
@@ -130,7 +130,7 @@ function ToPromising(wasm_export) {
   let y = { valueOf: () => { print("Hello!"); gc(); return 24; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(y));
+  assertPromiseResult(main(y), v => { assertEquals(undefined, v); });
   assertEquals(36, x);
 })();
 
@@ -163,7 +163,9 @@ function ToPromising(wasm_export) {
   let param3 = { valueOf: () => { gc(); return 3; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(9, param2, param3, 0));
+  assertPromiseResult(
+      main(9, param2, param3, 0),
+      v => { assertEquals(undefined, v); });
   assertEquals(60, x);
   // Now we test if the evaluation order of the parameters is correct.
   x = 12;
@@ -175,7 +177,7 @@ function ToPromising(wasm_export) {
       return 3;
     }
   };
-  assertEquals(undefined, main(9, param2, param3, 0));
+  assertPromiseResult(main(9, param2, param3, 0), undefined);
   assertEquals(60, x);
 })();
 
@@ -217,7 +219,9 @@ let kSig_r_riiiiiiii = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32,
   let param8 = { valueOf: () => { gc(); return 12; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(param1, 6, 7, param4, 9, param6, 11, param8));
+  assertPromiseResult(
+      main(param1, 6, 7, param4, 9, param6, 11, param8),
+      v => assertEquals(undefined, v));
   assertEquals(360, x);
 })();
 
@@ -250,7 +254,7 @@ let kSig_r_riiiiiiii = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32,
   let param2 = { valueOf: () => { gc(); return 3; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(5, param2));
+  assertPromiseResult(main(5, param2), v => assertEquals(undefined, v));
   assertEquals(20, x);
 })();
 
@@ -284,7 +288,9 @@ let kSig_r_riiiiiiii = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32,
   let param3 = { valueOf: () => { gc(); return 6; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(5, param2, param3, 7, 200, 300, 400));
+  assertPromiseResult(
+      main(5, param2, param3, 7, 200, 300, 400),
+      v => assertEquals(undefined, v));
   assertEquals(33, x);
 })();
 
@@ -311,7 +317,7 @@ let kSig_r_riiiiiiii = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(17, main(5));
+  assertPromiseResult(main(5), v => assertEquals(17, v));
 })();
 
 (function testGenericWrapper1I32ReturnHeapNumber() {
@@ -338,7 +344,7 @@ let kSig_r_riiiiiiii = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(2147483645, main(5));
+  assertPromiseResult(main(5), v => assertEquals(2147483645, v));
 })();
 
 let kSig_i_rlili = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI64, kWasmI32],
@@ -371,7 +377,7 @@ let kSig_i_rlili = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI64, kWasmI
   let param3 = { valueOf: () => { gc(); return 3n; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(60, main(9n, param2, param3, 0));
+  assertPromiseResult(main(9n, param2, param3, 0), v => assertEquals(60, v));
 })();
 
 let kSig_r_riiili = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32, kWasmI64,
@@ -405,7 +411,9 @@ let kSig_r_riiili = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32, kWasm
   let param3 = { valueOf: () => { gc(); return 3; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(9, param2, param3, 0n, 2));
+  assertPromiseResult(
+      main(9, param2, param3, 0n, 2),
+      v => assertEquals(undefined, v));
   assertEquals(72, x);
 })();
 
@@ -442,7 +450,9 @@ let kSig_r_riiilii = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI32,
   let param3 = { valueOf: () => { gc(); return 3; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(9, param2, param3, 0n, 2, 3));
+  assertPromiseResult(
+      main(9, param2, param3, 0n, 2, 3),
+      v => assertEquals(undefined, v));
   assertEquals(93, x);
 })();
 
@@ -485,7 +495,9 @@ let kSig_r_rliilliiil = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI32,
   let param8 = { valueOf: () => { gc(); return 12; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(360, main(param1, 6, 7, param4, 9n, param6, 11, param8, 0n));
+  assertPromiseResult(
+      main(param1, 6, 7, param4, 9n, param6, 11, param8, 0n),
+      v => assertEquals(360, v));
 })();
 
 // The function expects BigInt, but gets Number.
@@ -511,7 +523,7 @@ let kSig_r_rliilliiil = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertThrows(() => { main(17) }, TypeError);
+  assertThrows(() => main(17), TypeError);
 })();
 
 (function testGenericWrapper1I64Return() {
@@ -535,7 +547,7 @@ let kSig_r_rliilliiil = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(10000000000n, main());
+  assertPromiseResult(main(), v => assertEquals(10000000000n, v));
 })();
 
 (function testGenericWrapper1F32Return() {
@@ -559,7 +571,7 @@ let kSig_r_rliilliiil = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(0.5, main());
+  assertPromiseResult(main(), v => assertEquals(0.5, v));
 })();
 
 (function testGenericWrapper1F64Return() {
@@ -583,7 +595,7 @@ let kSig_r_rliilliiil = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(0.25, main());
+  assertPromiseResult(main(), v => assertEquals(0.25, v));
 })();
 
 (function testGenericWrapper1Float32() {
@@ -609,7 +621,7 @@ let kSig_r_rliilliiil = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(12.5));
+  assertPromiseResult(main(12.5), v => assertEquals(undefined, v));
   assertEquals(25, x);
 })();
 
@@ -636,7 +648,7 @@ let kSig_r_rliilliiil = makeSig([kWasmExternRef, kWasmI64, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(12.5));
+  assertPromiseResult(main(12.5), v => assertEquals(undefined, v));
   assertEquals(25, x);
 })();
 
@@ -678,8 +690,9 @@ let kSig_r_rffddddff = makeSig([kWasmExternRef, kWasmF32, kWasmF32, kWasmF64,
   let param8 = { valueOf: () => { gc(); return 8.5; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(param1, 2.5, 3.5, param4, 5.5, param6, 7.5,
-        param8));
+  assertPromiseResult(
+      main(param1, 2.5, 3.5, param4, 5.5, param6, 7.5, param8),
+      v => assertEquals(undefined, v));
   assertEquals(234, x);
 })();
 
@@ -726,8 +739,9 @@ let kSig_r_riiliffddlfdff = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI6
 
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(5, 6, 7n, 8, 1.5, 2.5, 3.5, 4.5, 11n, 5.5, 6.5,
-        7.5, 8.5));
+  assertPromiseResult(
+      main(5, 6, 7n, 8, 1.5, 2.5, 3.5, 4.5, 11n, 5.5, 6.5, 7.5, 8.5),
+      v => assertEquals(undefined, v));
   assertEquals(137, x);
   assertEquals(223, y);
 })();
@@ -777,8 +791,9 @@ let kSig_r_riiliiiffddli = makeSig([kWasmExternRef, kWasmI32, kWasmI32, kWasmI64
   let param8 = { valueOf: () => { gc(); return 12; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(undefined, main(param1, 6, 7n, param4, 9, param6,
-    1.5, 2.5, 3.6, 4.4, 11n, param8));
+  assertPromiseResult(
+      main(param1, 6, 7n, param4, 9, param6, 1.5, 2.5, 3.6, 4.4, 11n, param8),
+      v => assertEquals(undefined, v));
   assertEquals(360, x);
   assertEquals(13, y);
 })();
@@ -840,8 +855,10 @@ let kSig_f_riiliiiffddlifffdi = makeSig([kWasmExternRef, kWasmI32, kWasmI32,
   let param9 = { valueOf: () => { gc(); return 0; } };
   let instance = builder.instantiate({ mod: { func: import_func } });
   let main = ToPromising(instance.exports.main);
-  assertEquals(223, main(param1, 6, 7n, param4, 9, param6, 1.5, 2.5, paramd1,
-        4.5, 11n, param8, paramf3, 6.5, 7.5, 8.5, param9));
+  assertPromiseResult(
+      main(param1, 6, 7n, param4, 9, param6, 1.5, 2.5, paramd1,
+        4.5, 11n, param8, paramf3, 6.5, 7.5, 8.5, param9),
+      v => assertEquals(223, v));
   assertEquals(360, x);
 })();
 
@@ -876,7 +893,7 @@ let kSig_f_riiliiiffddlifffdi = makeSig([kWasmExternRef, kWasmI32, kWasmI32,
 
   let instance = builder.instantiate();
   let f1 = ToPromising(instance.exports.f1);
-  assertEquals(15, f1());
+  assertPromiseResult(f1(), v => assertEquals(15, v));
 })();
 
 (function testDeoptWithIncorrectNumberOfParams() {
@@ -930,5 +947,5 @@ let kSig_f_riiliiiffddlifffdi = makeSig([kWasmExternRef, kWasmI32, kWasmI32,
   let instance = new WebAssembly.Instance(module);
   let func0 = ToPromising(instance.exports.func0);
   let res = func0(1, 2, "3", "4", "5", "6", "7", "8", 9, 10, 11, 12, 13);
-  assertEquals("8", res);
+  assertPromiseResult(res, v => assertEquals("8", v));
 })();
diff --git a/deps/v8/test/mjsunit/wasm/stack-switching.js b/deps/v8/test/mjsunit/wasm/stack-switching.js
index 667b2e01b0ae8b..e667f876f5b11b 100644
--- a/deps/v8/test/mjsunit/wasm/stack-switching.js
+++ b/deps/v8/test/mjsunit/wasm/stack-switching.js
@@ -342,7 +342,8 @@ function ToPromising(wasm_export) {
   assertPromiseResult(combined_promise, v => assertEquals(0.5, v));
 })();
 
-// Throw an exception after the initial prompt.
+// Throw an exception before suspending. The export wrapper should return a
+// promise rejected with the exception.
 (function TestStackSwitchException1() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
@@ -351,12 +352,7 @@ function ToPromising(wasm_export) {
       .addBody([kExprThrow, tag]).exportFunc();
   let instance = builder.instantiate();
   let wrapper = ToPromising(instance.exports.throw);
-  try {
-    wrapper();
-    assertUnreachable();
-  } catch (e) {
-    assertTrue(e instanceof WebAssembly.Exception);
-  }
+  assertThrowsAsync(wrapper(), WebAssembly.Exception);
 })();
 
 // Throw an exception after the first resume event, which propagates to the
@@ -423,8 +419,8 @@ function TestNestedSuspenders(suspend) {
   // the outer wasm function, which returns a Promise. The inner Promise
   // resolves first, which resumes the inner continuation. Then the outer
   // promise resolves which resumes the outer continuation.
-  // If 'suspend' is false, the inner JS function returns a regular value and
-  // no computation is suspended.
+  // If 'suspend' is false, the inner and outer JS functions return a regular
+  // value and no computation is suspended.
   let builder = new WasmModuleBuilder();
   inner_index = builder.addImport('m', 'inner', kSig_i_r);
   outer_index = builder.addImport('m', 'outer', kSig_i_r);
@@ -447,17 +443,13 @@ function TestNestedSuspenders(suspend) {
   let export_inner;
   let outer = new WebAssembly.Function(
       {parameters: ['externref'], results: ['i32']},
-      () => export_inner(),
+      () => suspend ? export_inner() : 42,
       {suspending: 'first'});
 
   let instance = builder.instantiate({m: {inner, outer}});
   export_inner = ToPromising(instance.exports.inner);
   let export_outer = ToPromising(instance.exports.outer);
-  if (suspend) {
-    assertPromiseResult(export_outer(), v => assertEquals(42, v));
-  } else {
-    assertEquals(export_outer(), 42);
-  }
+  assertPromiseResult(export_outer(), v => assertEquals(42, v));
 }
 
 (function TestNestedSuspendersSuspend() {
@@ -493,7 +485,7 @@ function TestNestedSuspenders(suspend) {
           ]).exportFunc();
   let instance = builder.instantiate();
   let wrapper = ToPromising(instance.exports.test);
-  assertThrows(wrapper, RangeError, /Maximum call stack size exceeded/);
+  assertThrowsAsync(wrapper(), RangeError, /Maximum call stack size exceeded/);
 })();
 
 (function TestBadSuspender() {
@@ -576,3 +568,102 @@ function TestNestedSuspenders(suspend) {
       {promising: 'first'});
   assertPromiseResult(exp(), v => assertEquals(42, v));
 })();
+
+(function TestSuspendJSFramesTraps() {
+  // The call stack of this test looks like:
+  // export1 -> import1 -> export2 -> import2
+  // Where export1 is "promising" and import2 is "suspending". Returning a
+  // promise from import2 should trap because of the JS import in the middle.
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let import1_index = builder.addImport("m", "import1", kSig_i_v);
+  let import2_index = builder.addImport("m", "import2", kSig_i_r);
+  builder.addGlobal(kWasmExternRef, true);
+  builder.addFunction("export1", kSig_i_r)
+      .addBody([
+          // export1 -> import1 (unwrapped)
+          kExprLocalGet, 0,
+          kExprGlobalSet, 0,
+          kExprCallFunction, import1_index,
+      ]).exportFunc();
+  builder.addFunction("export2", kSig_i_v)
+      .addBody([
+          // export2 -> import2 (suspending)
+          kExprGlobalGet, 0,
+          kExprCallFunction, import2_index,
+      ]).exportFunc();
+  let instance;
+  function import1() {
+    // import1 -> export2 (unwrapped)
+    instance.exports.export2();
+  }
+  function import2() {
+    return Promise.resolve(0);
+  }
+  import2 = new WebAssembly.Function(
+      {parameters: ['externref'], results: ['i32']},
+      import2,
+      {suspending: 'first'});
+  instance = builder.instantiate(
+      {'m':
+        {'import1': import1,
+         'import2': import2
+        }});
+  // export1 (promising)
+  let wrapper = new WebAssembly.Function(
+      {parameters: [], results: ['externref']},
+      instance.exports.export1,
+      {promising: 'first'});
+  assertThrowsAsync(wrapper(), WebAssembly.RuntimeError,
+      /trying to suspend JS frames/);
+})();
+
+// Regression test for v8:14094.
+// Pass an invalid (null) suspender to the suspending wrapper, but return a
+// non-promise. The import should not trap.
+(function TestImportCheckOrder() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  import_index = builder.addImport('m', 'import', kSig_i_r);
+  builder.addFunction("test", kSig_i_r)
+      .addBody([
+          kExprLocalGet, 0,
+          kExprCallFunction, import_index, // suspend
+      ]).exportFunc();
+  let js_import = new WebAssembly.Function(
+      {parameters: ['externref'], results: ['i32']},
+      () => 42,
+      {suspending: 'first'});
+  let instance = builder.instantiate({m: {import: js_import}});
+  assertEquals(42, instance.exports.test(null));
+})();
+
+(function TestSwitchingToTheCentralStack() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let table = builder.addTable(kWasmExternRef, 1);
+  builder.addFunction("test", kSig_i_r)
+      .addBody([
+        kExprLocalGet, 0,
+        kExprI32Const, 1,
+        kNumericPrefix, kExprTableGrow, table.index]).exportFunc();
+  builder.addFunction("test2", kSig_i_r)
+      .addBody([
+        kExprI32Const, 1]).exportFunc();
+  let instance = builder.instantiate();
+  let wrapper = ToPromising(instance.exports.test);
+  let wrapper2 = ToPromising(instance.exports.test2);
+  function switchesToCS(fn) {
+    const beforeCall = %WasmSwitchToTheCentralStackCount();
+    fn();
+    return %WasmSwitchToTheCentralStackCount() - beforeCall;
+  }
+  // Calling exported functions from the central stack.
+  assertEquals(switchesToCS(() => instance.exports.test({})), 0);
+  assertEquals(switchesToCS(() => instance.exports.test2({})), 0);
+
+  // Runtime call to table.grow.
+  assertEquals(switchesToCS(wrapper), 1);
+  // No runtime calls.
+  assertEquals(switchesToCS(wrapper2), 0);
+})();
diff --git a/deps/v8/test/mjsunit/wasm/stack.js b/deps/v8/test/mjsunit/wasm/stack.js
index 5547c9c62f8ad7..8fe181a011f942 100644
--- a/deps/v8/test/mjsunit/wasm/stack.js
+++ b/deps/v8/test/mjsunit/wasm/stack.js
@@ -41,7 +41,7 @@ function STACK() {
 
 var builder = new WasmModuleBuilder();
 
-builder.addMemory(0, 1, false);
+builder.addMemory(0, 1);
 
 builder.addImport("mod", "func", kSig_v_v);
 
diff --git a/deps/v8/test/mjsunit/wasm/start-function.js b/deps/v8/test/mjsunit/wasm/start-function.js
index 4b94050d959200..b6b334babc74dc 100644
--- a/deps/v8/test/mjsunit/wasm/start-function.js
+++ b/deps/v8/test/mjsunit/wasm/start-function.js
@@ -70,7 +70,8 @@ assertThrows(() => {instantiate(kSig_i_v, [kExprI32Const, 0]);});
   print("testRun1");
   var builder = new WasmModuleBuilder();
 
-  builder.addMemory(12, 12, true);
+  builder.addMemory(12, 12);
+  builder.exportMemoryAs("memory");
 
   var func = builder.addFunction("", kSig_v_v)
     .addBody([kExprI32Const, 0, kExprI32Const, 55, kExprI32StoreMem, 0, 0]);
@@ -87,7 +88,8 @@ assertThrows(() => {instantiate(kSig_i_v, [kExprI32Const, 0]);});
   print("testRun2");
   var builder = new WasmModuleBuilder();
 
-  builder.addMemory(12, 12, true);
+  builder.addMemory(12, 12);
+  builder.exportMemoryAs("memory");
 
   var func = builder.addFunction("", kSig_v_v)
     .addBody([kExprI32Const, 0, kExprI32Const, 22, kExprI32Const, 55, kExprI32Add, kExprI32StoreMem, 0, 0]);
diff --git a/deps/v8/test/mjsunit/wasm/streaming-api.js b/deps/v8/test/mjsunit/wasm/streaming-api.js
index bdb180c57fe519..e17ca118a9e686 100644
--- a/deps/v8/test/mjsunit/wasm/streaming-api.js
+++ b/deps/v8/test/mjsunit/wasm/streaming-api.js
@@ -55,13 +55,13 @@ d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
   assertPromiseResult(WebAssembly.compileStreaming(Promise.resolve(bytes)),
     assertUnreachable,
     error => assertEquals("WebAssembly.compileStreaming(): Compiling " +
-                          "function #0:\"main\" failed: f32.mul[1] expected " +
-                          "type f32, found local.get of type i32 @+37",
+                          "function #0:\"main\" failed: f32.mul[0] expected " +
+                          "type f32, found local.get of type i32 @+35",
                           error.message));
   assertPromiseResult(WebAssembly.instantiateStreaming(Promise.resolve(bytes)),
     assertUnreachable,
     error => assertEquals("WebAssembly.instantiateStreaming(): Compiling " +
-                          "function #0:\"main\" failed: f32.mul[1] expected " +
-                          "type f32, found local.get of type i32 @+37",
+                          "function #0:\"main\" failed: f32.mul[0] expected " +
+                          "type f32, found local.get of type i32 @+35",
                           error.message));
 })();
diff --git a/deps/v8/test/mjsunit/wasm/streaming-error-position.js b/deps/v8/test/mjsunit/wasm/streaming-error-position.js
index 8c064316869cca..80c54ef133e7a6 100644
--- a/deps/v8/test/mjsunit/wasm/streaming-error-position.js
+++ b/deps/v8/test/mjsunit/wasm/streaming-error-position.js
@@ -8,25 +8,15 @@
 
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
-function testErrorPositionAsyncOnly(bytes, pos, message) {
-  let buffer = bytes.trunc_buffer();
-  // Only test the streaming decoder since this kind of error is out of sync
-  // with the non-streaming decoder, hence errors cannot be compared.
-  assertThrowsAsync(
-      WebAssembly.compile(buffer), WebAssembly.CompileError,
-      new RegExp(message + '.*@\\+' + pos));
-}
-
 function testErrorPosition(bytes, pos, message) {
-  let buffer = bytes.trunc_buffer();
+  const buffer = bytes.trunc_buffer();
   // First check the non-streaming decoder as a reference.
+  const regexp = new RegExp(message + '.*@\\+' + pos);
   assertThrows(
-      () => new WebAssembly.Module(buffer), WebAssembly.CompileError,
-      new RegExp(message + '.*@\\+' + pos));
+      () => new WebAssembly.Module(buffer), WebAssembly.CompileError, regexp);
   // Next test the actual streaming decoder.
   assertThrowsAsync(
-      WebAssembly.compile(buffer), WebAssembly.CompileError,
-      new RegExp(message + '.*@\\+' + pos));
+      WebAssembly.compile(buffer), WebAssembly.CompileError, regexp);
 }
 
 (function testInvalidMagic() {
@@ -53,7 +43,7 @@ function testErrorPosition(bytes, pos, message) {
   bytes.emit_u8(kTypeSectionCode);
   bytes.emit_bytes([0x80, 0x80, 0x80, 0x80, 0x80, 0x00]);
   let pos = bytes.length - 1 - 1;
-  testErrorPosition(bytes, pos, 'expected section length');
+  testErrorPosition(bytes, pos, 'length overflow while decoding section length');
 })();
 
 (function testSectionLengthTooBig() {
@@ -62,7 +52,7 @@ function testErrorPosition(bytes, pos, message) {
   let pos = bytes.length;
   bytes.emit_u8(kTypeSectionCode);
   bytes.emit_u32v(0xffffff23);
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section \\(code 1, "Type"\\) extends past end of the module ' +
           '\\(length 4294967075, remaining bytes 0\\)');
@@ -89,7 +79,7 @@ function testErrorPosition(bytes, pos, message) {
   // Functions count
   bytes.emit_bytes([0x80, 0x80, 0x80, 0x80, 0x80, 0x00]);
 
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section \\(code 10, "Code"\\) extends past end of the module ' +
           '\\(length 20, remaining bytes 6\\)');
@@ -116,7 +106,7 @@ function testErrorPosition(bytes, pos, message) {
   // Functions count
   bytes.emit_u32v(0xffffff23);
 
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section \\(code 10, "Code"\\) extends past end of the module ' +
           '\\(length 20, remaining bytes 5\\)');
@@ -143,7 +133,7 @@ function testErrorPosition(bytes, pos, message) {
   // Functions count (different than the count in the functions section.
   bytes.emit_u32v(5);
 
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section \\(code 10, "Code"\\) extends past end of the module ' +
           '\\(length 20, remaining bytes 1\\)');
@@ -175,7 +165,7 @@ function testErrorPosition(bytes, pos, message) {
   // Invalid function body size.
   bytes.emit_bytes([0x80, 0x80, 0x80, 0x80, 0x80, 0x00]);
 
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section \\(code 10, "Code"\\) extends past end of the module ' +
           '\\(length 20, remaining bytes 7\\)');
@@ -207,7 +197,7 @@ function testErrorPosition(bytes, pos, message) {
   // Invalid function body size.
   bytes.emit_u32v(0xffffff23);
 
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section \\(code 10, "Code"\\) extends past end of the module ' +
           '\\(length 20, remaining bytes 6\\)');
@@ -239,7 +229,7 @@ function testErrorPosition(bytes, pos, message) {
   // Invalid function body size (does not fit into the code section).
   bytes.emit_u32v(20);
 
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section \\(code 10, "Code"\\) extends past end of the module ' +
           '\\(length 20, remaining bytes 2\\)');
@@ -271,7 +261,7 @@ function testErrorPosition(bytes, pos, message) {
   // Invalid function body size (body size of 0 is invalid).
   bytes.emit_u32v(0);
 
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section \\(code 10, "Code"\\) extends past end of the module ' +
           '\\(length 20, remaining bytes 2\\)');
@@ -307,7 +297,7 @@ function testErrorPosition(bytes, pos, message) {
   // length.
   bytes.emit_bytes([0, 0, 0, 0, 0, 0, 0, 0]);
 
-  testErrorPositionAsyncOnly(
+  testErrorPosition(
       bytes, pos,
       'section was shorter than expected size ' +
           '\\(10 bytes expected, 4 decoded\\)');
@@ -383,7 +373,7 @@ function testErrorPosition(bytes, pos, message) {
   ]);
 
   // Find error at the second kCodeSectionCode.
-  testErrorPositionAsyncOnly(bytes, pos, 'unexpected section <Code>');
+  testErrorPosition(bytes, pos, 'unexpected section <Code>');
 })();
 
 (function testCodeSectionSizeZero() {
@@ -410,7 +400,7 @@ function testErrorPosition(bytes, pos, message) {
 
   // Find error at the code section length.
   let pos = bytes.length;
-  testErrorPositionAsyncOnly(bytes, pos, 'expected functions count');
+  testErrorPosition(bytes, pos, 'reached end while decoding functions count');
 })();
 
 (function testInvalidSection() {
@@ -427,5 +417,43 @@ function testErrorPosition(bytes, pos, message) {
   ]);
 
   let pos = bytes.length - 1 - 1;
-  testErrorPositionAsyncOnly(bytes, pos, 'invalid value type');
+  testErrorPosition(bytes, pos, 'invalid value type');
+})();
+
+(function testDataSegmentsMismatch() {
+  let bytes = new Binary;
+  bytes.emit_header();
+  bytes.emit_bytes([
+    kDataCountSectionCode,  // section id
+    1,                      // section length
+    1,                      // num data segments
+    kDataSectionCode,       // section id
+    1,                      // section length
+    0                       // num data segments
+  ]);
+
+  let pos = bytes.length;
+  testErrorPosition(
+      bytes, pos, 'data segments count 0 mismatch \\(1 expected\\)');
+})();
+
+(function testMissingCodeSection() {
+  let bytes = new Binary;
+  bytes.emit_header();
+  bytes.emit_bytes([
+    kTypeSectionCode,       // section id
+    4,                      // section length
+    1,                      // number of types
+    kWasmFunctionTypeForm,  // type
+    0,                      // number of parameter
+    0,                      // number of returns
+    kFunctionSectionCode,   // section id
+    2,                      // section length
+    1,                      // number of functions
+    0,                      // signature index
+  ]);
+
+  let pos = bytes.length;
+  testErrorPosition(
+      bytes, pos, 'function count is 1, but code section is absent');
 })();
diff --git a/deps/v8/test/mjsunit/wasm/stringrefs-exec-gc.js b/deps/v8/test/mjsunit/wasm/stringrefs-exec-gc.js
index e3c47253e7283b..e313b17e6d179c 100644
--- a/deps/v8/test/mjsunit/wasm/stringrefs-exec-gc.js
+++ b/deps/v8/test/mjsunit/wasm/stringrefs-exec-gc.js
@@ -138,6 +138,13 @@ function makeWtf8TestDataSegment() {
       ...GCInstr(kExprStringNewWtf8Array)
     ]);
 
+  builder.addFunction("null_array", kSig_w_v).exportFunc()
+    .addBody([
+      kExprRefNull, i8_array,
+      kExprI32Const, 0, kExprI32Const, 0,
+      ...GCInstr(kExprStringNewWtf8Array)
+    ])
+
   let instance = builder.instantiate();
   for (let [str, {offset, length}] of Object.entries(data.valid)) {
     let start = offset;
@@ -180,9 +187,15 @@ function makeWtf8TestDataSegment() {
                                                   "ascii".length));
   assertThrows(() => instance.exports.bounds_check(0, 100),
                WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.bounds_check(0, -1),
+               WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.bounds_check(-1, 0),
+               WebAssembly.RuntimeError, "array element access out of bounds");
   assertThrows(() => instance.exports.bounds_check("ascii".length,
                                                    "ascii".length + 1),
                WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.null_array(),
+               WebAssembly.RuntimeError, "dereferencing a null pointer");
 })();
 
 (function TestStringNewUtf8ArrayTryNullCheck() {
@@ -288,6 +301,14 @@ function makeWtf16TestDataSegment(strings) {
       ...GCInstr(kExprStringNewWtf16Array)
     ]);
 
+  builder.addFunction("null_array", kSig_w_v).exportFunc()
+    .addBody([
+      kExprRefNull, i16_array,
+      kExprI32Const, 0,
+      kExprI32Const, 0,
+      ...GCInstr(kExprStringNewWtf16Array)
+    ]);
+
   let instance = builder.instantiate();
   for (let [str, {offset, length}] of Object.entries(data.valid)) {
     let start = offset / 2;
@@ -305,6 +326,8 @@ function makeWtf16TestDataSegment(strings) {
   assertThrows(() => instance.exports.bounds_check("ascii".length,
                                                    "ascii".length + 1),
                WebAssembly.RuntimeError, "array element access out of bounds");
+  assertThrows(() => instance.exports.null_array(),
+               WebAssembly.RuntimeError, "dereferencing a null pointer");
 })();
 
 (function TestStringEncodeWtf8Array() {
@@ -423,7 +446,7 @@ function makeWtf16TestDataSegment(strings) {
       makeSig([kWasmStringRef, kWasmI32, kWasmI32],
               [kWasmStringRef]);
   // Allocate an array and encode into it.  Then decode it.
-  // (str, length, offset=0) -> str
+  // (str, length, offset) -> str
   builder.addFunction("encode", kSig_w_wii)
     .exportFunc()
     .addLocals(wasmRefNullType(i16_array), 1)
diff --git a/deps/v8/test/mjsunit/wasm/stringrefs-exec.js b/deps/v8/test/mjsunit/wasm/stringrefs-exec.js
index 901a07d3eea1eb..76bd36f79001b2 100644
--- a/deps/v8/test/mjsunit/wasm/stringrefs-exec.js
+++ b/deps/v8/test/mjsunit/wasm/stringrefs-exec.js
@@ -3,6 +3,8 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-stringref --experimental-wasm-typed-funcref
+// For {isOneByteString}:
+// Flags: --expose-externalize-string
 
 d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
 
@@ -154,7 +156,7 @@ function makeWtf8TestDataSegment() {
 (function TestStringNewWtf8() {
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, undefined, false, false);
+  builder.addMemory(1, undefined);
   let data = makeWtf8TestDataSegment();
   builder.addDataSegment(0, data.data);
 
@@ -222,7 +224,7 @@ function makeWtf8TestDataSegment() {
 (function TestStringNewUtf8TryNullCheck() {
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, undefined, false, false);
+  builder.addMemory(1, undefined);
   let data = makeWtf8TestDataSegment();
   builder.addDataSegment(0, data.data);
 
@@ -274,7 +276,7 @@ function makeWtf16TestDataSegment() {
 (function TestStringNewWtf16() {
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, undefined, false, false);
+  builder.addMemory(1, undefined);
   let data = makeWtf16TestDataSegment();
   builder.addDataSegment(0, data.data);
 
@@ -389,7 +391,8 @@ function makeWtf16TestDataSegment() {
 (function TestStringEncodeWtf8() {
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, undefined, true /* exported */, false);
+  builder.addMemory(1, undefined);
+  builder.exportMemoryAs("memory");
 
   for (let [instr, name] of [[kExprStringEncodeUtf8, "utf8"],
                              [kExprStringEncodeWtf8, "wtf8"],
@@ -487,7 +490,8 @@ function makeWtf16TestDataSegment() {
 (function TestStringEncodeWtf16() {
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, undefined, true /* exported */, false);
+  builder.addMemory(1, undefined);
+  builder.exportMemoryAs("memory");
 
   builder.addFunction("encode_wtf16", kSig_i_wi)
     .exportFunc()
@@ -684,7 +688,8 @@ function makeWtf16TestDataSegment() {
 (function TestStringViewWtf16() {
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, undefined, true /* exported */, false);
+  builder.addMemory(1, undefined);
+  builder.exportMemoryAs("memory");
 
   builder.addFunction("view_from_null", kSig_v_v).exportFunc().addBody([
     kExprRefNull, kStringRefCode,
@@ -842,6 +847,9 @@ function makeWtf16TestDataSegment() {
   assertEquals("oo", instance.exports.slice("foo", 1, 3));
   assertEquals("oo", instance.exports.slice("foo", 1, 100));
   assertEquals("", instance.exports.slice("foo", 1, 0));
+  assertEquals("", instance.exports.slice("foo", 3, 4));
+  assertEquals("foo", instance.exports.slice("foo", 0, -1));
+  assertEquals("", instance.exports.slice("foo", -1, 1));
 
   assertThrows(() => instance.exports.view_from_null(),
                WebAssembly.RuntimeError, 'dereferencing a null pointer');
@@ -855,12 +863,44 @@ function makeWtf16TestDataSegment() {
                WebAssembly.RuntimeError, "dereferencing a null pointer");
   assertThrows(() => instance.exports.slice_null(),
                WebAssembly.RuntimeError, "dereferencing a null pointer");
+
+  // Cover runtime code path for long slices.
+  const prefix = "a".repeat(10);
+  const slice = "x".repeat(40);
+  const suffix = "b".repeat(40);
+  const input = prefix + slice + suffix;
+  const start = prefix.length;
+  const end = start + slice.length;
+  assertEquals(slice, instance.exports.slice(input, start, end));
+
+  // Check that we create one-byte substrings when possible.
+  let onebyte = instance.exports.slice("\u1234abcABCDE", 1, 4);
+  assertEquals("abc", onebyte);
+  assertTrue(isOneByteString(onebyte));
+
+  // Check that the CodeStubAssembler implementation also creates one-byte
+  // substrings.
+  onebyte = instance.exports.slice("\u1234abcA", 1, 4);
+  assertEquals("abc", onebyte);
+  assertTrue(isOneByteString(onebyte));
+  // Cover the code path that checks 8 characters at a time.
+  onebyte = instance.exports.slice("\u1234abcdefgh\u1234", 1, 9);
+  assertEquals("abcdefgh", onebyte);  // Exactly 8 characters.
+  assertTrue(isOneByteString(onebyte));
+  onebyte = instance.exports.slice("\u1234abcdefghijXYZ", 1, 11);
+  assertEquals("abcdefghij", onebyte);  // Longer than 8.
+  assertTrue(isOneByteString(onebyte));
+
+  // Check that the runtime code path also creates one-byte substrings.
+  assertTrue(isOneByteString(
+      instance.exports.slice(input + "\u1234", start, end)));
 })();
 
 (function TestStringViewWtf8() {
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(1, undefined, true /* exported */, false);
+  builder.addMemory(1, undefined);
+  builder.exportMemoryAs("memory");
 
   builder.addFunction("advance", kSig_i_wii)
     .exportFunc()
diff --git a/deps/v8/test/mjsunit/wasm/stringrefs-regressions.js b/deps/v8/test/mjsunit/wasm/stringrefs-regressions.js
index 305a1d3c338d74..fdd72ac7fd33e3 100644
--- a/deps/v8/test/mjsunit/wasm/stringrefs-regressions.js
+++ b/deps/v8/test/mjsunit/wasm/stringrefs-regressions.js
@@ -15,7 +15,7 @@ let kSig_v_w = makeSig([kWasmStringRef], []);
 
 (function () {
   let huge_builder = new WasmModuleBuilder();
-  huge_builder.addMemory(65001, undefined, false, false);
+  huge_builder.addMemory(65001, undefined);
 
   huge_builder.addFunction("huge", kSig_w_v).exportFunc().addBody([
     kExprI32Const, 0,                  // address
@@ -69,30 +69,77 @@ let kSig_v_w = makeSig([kWasmStringRef], []);
   f1(10);
 })();
 
-let builder = new WasmModuleBuilder();
+(function () {
+  let builder = new WasmModuleBuilder();
+
+  let concat_body = [];
+  // This doubles the string 26 times, i.e. multiplies its length with a factor
+  // of ~65 million.
+  for (let i = 0; i < 26; i++) {
+    concat_body.push(...[
+      kExprLocalGet, 0, kExprLocalGet, 0,
+      ...GCInstr(kExprStringConcat),
+      kExprLocalSet, 0
+    ]);
+  }
+
+  builder.addFunction('concat', kSig_v_w).exportFunc().addBody(concat_body);
+
+  let instance = builder.instantiate();
+
+  // Bug 4: Throwing in StringAdd must clear the "thread in wasm" bit.
+  let f2 = instance.exports.concat;
+  assertThrows(() => f2("1234567890"));  // 650M characters is too much.
+
+  // Bug 5: Operations that can trap must not be marked as kEliminatable,
+  // otherwise the trap may be eliminated.
+  for (let i = 0; i < 3; i++) f2("a");   // 65M characters is okay.
+  %WasmTierUpFunction(f2);
+  assertThrows(() => f2("1234567890"));  // Optimized code still traps.
+})();
 
-let concat_body = [];
-// This doubles the string 26 times, i.e. multiplies its length with a factor
-// of ~65 million.
-for (let i = 0; i < 26; i++) {
-  concat_body.push(...[
-    kExprLocalGet, 0, kExprLocalGet, 0,
-    ...GCInstr(kExprStringConcat),
-    kExprLocalSet, 0
+(function TestThatOneCharacterStringsAreInternalized() {
+  let builder = new WasmModuleBuilder();
+
+  builder.addMemory(1, undefined);
+  const kMemIndex = 0;
+  builder.addDataSegment(0, [65, 0]);
+
+  let a8 = builder.addArray(kWasmI8, true);
+  let a16 = builder.addArray(kWasmI16, true);
+
+  builder.addFunction('makeString8A', kSig_w_v).exportFunc().addBody([
+    ...wasmI32Const(65),
+    kGCPrefix, kExprArrayNewFixed, a8, 1,
+    kExprI32Const, 0,
+    kExprI32Const, 1,
+    ...GCInstr(kExprStringNewWtf8Array),
+  ]);
+
+  builder.addFunction('makeString16A', kSig_w_v).exportFunc().addBody([
+    ...wasmI32Const(65),
+    kGCPrefix, kExprArrayNewFixed, a16, 1,
+    kExprI32Const, 0,
+    kExprI32Const, 1,
+    ...GCInstr(kExprStringNewWtf16Array),
   ]);
-}
 
-let concat =
-    builder.addFunction('concat', kSig_v_w).exportFunc().addBody(concat_body);
+  builder.addFunction('makeString8M', kSig_w_v).exportFunc().addBody([
+    kExprI32Const, 0,
+    kExprI32Const, 1,
+    ...GCInstr(kExprStringNewWtf8), kMemIndex,
+  ]);
 
-let instance = builder.instantiate();
+  builder.addFunction('makeString16M', kSig_w_v).exportFunc().addBody([
+    kExprI32Const, 0,
+    kExprI32Const, 1,
+    ...GCInstr(kExprStringNewWtf16), kMemIndex,
+  ]);
 
-// Bug 4: Throwing in StringAdd must clear the "thread in wasm" bit.
-let f2 = instance.exports.concat;
-assertThrows(() => f2("1234567890"));  // 650M characters is too much.
+  let wasm = builder.instantiate().exports;
 
-// Bug 5: Operations that can trap must not be marked as kEliminatable,
-// otherwise the trap may be eliminated.
-for (let i = 0; i < 3; i++) f2("a");   // 65M characters is okay.
-%WasmTierUpFunction(f2);
-assertThrows(() => f2("1234567890"));  // Optimized code still traps.
+  assertTrue(%IsSameHeapObject("A", wasm.makeString8A()));
+  assertTrue(%IsSameHeapObject("A", wasm.makeString16A()));
+  assertTrue(%IsSameHeapObject("A", wasm.makeString8M()));
+  assertTrue(%IsSameHeapObject("A", wasm.makeString16M()));
+})();
diff --git a/deps/v8/test/mjsunit/wasm/stringrefs-valid.js b/deps/v8/test/mjsunit/wasm/stringrefs-valid.js
index d045f77c140397..ff74228ca324d2 100644
--- a/deps/v8/test/mjsunit/wasm/stringrefs-valid.js
+++ b/deps/v8/test/mjsunit/wasm/stringrefs-valid.js
@@ -71,7 +71,7 @@ let kSig_w_zi = makeSig([kWasmStringViewIter, kWasmI32],
 (function TestInstructions() {
   let builder = new WasmModuleBuilder();
 
-  builder.addMemory(0, undefined, false, false);
+  builder.addMemory(0, undefined);
 
   builder.addFunction("string.new_utf8", kSig_w_ii)
     .addBody([
@@ -353,18 +353,18 @@ assertInvalid(
         ...GCInstr(kExprStringNewWtf8), 0
       ]);
   },
-  /memory instruction with no memory/);
+  /memory index 0 exceeds number of declared memories \(0\)/);
 
 assertInvalid(
   builder => {
-    builder.addMemory(0, undefined, false, false);
+    builder.addMemory(0, undefined);
     builder.addFunction("string.new_wtf8/bad-mem", kSig_w_ii)
       .addBody([
         kExprLocalGet, 0, kExprLocalGet, 1,
         ...GCInstr(kExprStringNewWtf8), 1
       ]);
   },
-  /expected memory index 0, found 1/);
+  /expected a single 0 byte for the memory index, found 1 encoded in 1 bytes/);
 
 assertInvalid(
   builder => {
@@ -374,18 +374,18 @@ assertInvalid(
         ...GCInstr(kExprStringEncodeWtf8), 0
       ]);
   },
-  /memory instruction with no memory/);
+  /memory index 0 exceeds number of declared memories \(0\)/);
 
 assertInvalid(
   builder => {
-    builder.addMemory(0, undefined, false, false);
+    builder.addMemory(0, undefined);
     builder.addFunction("string.encode_wtf8/bad-mem", kSig_i_wi)
       .addBody([
         kExprLocalGet, 0, kExprLocalGet, 1,
         ...GCInstr(kExprStringEncodeWtf8), 1
       ]);
   },
-  /expected memory index 0, found 1/);
+  /expected a single 0 byte for the memory index, found 1 encoded in 1 bytes/);
 
 assertInvalid(
   builder => {
diff --git a/deps/v8/test/mjsunit/wasm/test-wasm-module-builder.js b/deps/v8/test/mjsunit/wasm/test-wasm-module-builder.js
index 6b3b431c85c6a8..78aaee1a1e6dd2 100644
--- a/deps/v8/test/mjsunit/wasm/test-wasm-module-builder.js
+++ b/deps/v8/test/mjsunit/wasm/test-wasm-module-builder.js
@@ -15,7 +15,7 @@ function instantiate(buffer, ffi) {
 (function BasicTest() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, 2, false);
+  builder.addMemory(1, 2);
   builder.addFunction('foo', kSig_i_v)
       .addBody([kExprI32Const, 11])
       .exportAs('blarg');
@@ -114,7 +114,7 @@ function instantiate(buffer, ffi) {
 (function DataSegmentTest() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, 1, false);
+  builder.addMemory(1, 1);
   builder.addFunction('load', kSig_i_i)
       .addBody([kExprLocalGet, 0, kExprI32LoadMem, 0, 0])
       .exportAs('load');
@@ -128,7 +128,7 @@ function instantiate(buffer, ffi) {
 (function BasicTestWithUint8Array() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1, 2, false);
+  builder.addMemory(1, 2);
   builder.addFunction('foo', kSig_i_v)
       .addBody([kExprI32Const, 17])
       .exportAs('blarg');
diff --git a/deps/v8/test/mjsunit/wasm/torque-wrapper.js b/deps/v8/test/mjsunit/wasm/torque-wrapper.js
new file mode 100644
index 00000000000000..cc5c0a40c99f85
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/torque-wrapper.js
@@ -0,0 +1,393 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --expose-gc
+//
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+// This test randomly generates WebAssembly signatures, creates WebAssembly
+// functions with the generated signature which randomly maps parameters to
+// returns, and then calls the WebAssembly function from JavaScript with some
+// inputs and checks the return values. `RunTest` is the core function, which
+// runs the test case for a specific signature and value mapping. `RunTest can
+// be used well for debugging a specific signature.
+// `GenerateAndRunTest` additionally generates the inputs for `RunTest`, which
+// is good for fuzzing the js-to-wasm wrappers.
+
+// Some documentation if the test fails in the CQ.
+console.log("This test is a fuzzer, it tests the generic js-to-wasm wrapper");
+console.log("with random signatures. If this test fails, then it may not fail");
+console.log("for the CL that actually introduced the issue, but for a");
+console.log("later CL in the CQ. You may want to use flako to identify that");
+console.log("actual culprit.");
+
+const debug = false;
+
+let kSig_r_i = makeSig([kWasmI32], [kWasmExternRef]);
+const kPossibleTypes = [kWasmI32, kWasmI64, kWasmF32, kWasmF64, kWasmExternRef];
+
+function getRandomInt(max) {
+  return Math.floor(Math.random() * max);
+}
+
+function TypeString(type) {
+  switch (type) {
+    case kWasmI32:
+      return 'kWasmI32';
+    case kWasmI64:
+      return 'kWasmI64';
+    case kWasmF32:
+      return 'kWasmF32';
+    case kWasmF64:
+      return 'kWasmF64';
+    case kWasmExternRef:
+      return 'kWasmExternRef';
+  }
+}
+
+function ConvertFunctionName(to, from) {
+  return TypeString(from) + 'To' + TypeString(to);
+}
+
+// The ConversionFunction mimics the value conversion done within the wasm
+// function, in addition to the `ToPrimitive` conversion done in the js-to-wasm
+// wrapper.
+function ConversionFunction(to, from, val) {
+  if (to == from) {
+    // If {to} and {from} are the same type, then we only have to do the
+    // conversion done in the js-to-wasm wrapper.
+    if (to == kWasmI64) return BigInt.asIntN(64, val);
+    if (to == kWasmExternRef) return val;
+
+    // In all other cases convert {val} into a Number so that the `valueOf`
+    // function of an object gets called.
+    return Number(val);
+  }
+  if (from == kWasmExternRef) {
+    if (val == null) {
+      val = 0;
+    } else {
+      val = val.value;
+    }
+  }
+  if (from == kWasmI64) {
+    // Convert BigInt to BigInt64.
+    val = BigInt.asIntN(64, val);
+  }
+  switch (to) {
+    case kWasmI32:
+      if (from == kWasmI64) return Number(BigInt.asIntN(32, val));
+      // Imitate the saturating conversions in WebAssembly.
+      if (val > 0x7fff_ffff) return 0x7fff_ffff;
+      if (val < -0x8000_0000) return -0x8000_0000;
+      return val | 0;
+    case kWasmI64:
+      // Imitate the saturating conversions in WebAssembly.
+      // Compare with 0x8000..., because 0x7fff... is not representable as
+      // float64.
+      if (val >= 0x8000_0000_0000_0000) return 0x7fff_ffff_ffff_ffffn;
+      if (val < -0x8000_0000_0000_0000) return -0x8000_0000_0000_0000n;
+      return BigInt(Math.trunc(val));
+    case kWasmF32:
+      return Math.fround(Number(val));
+    case kWasmF64:
+      return Number(val);
+    case kWasmExternRef:
+      return itoo(ConversionFunction(kWasmI32, from, val));
+  }
+}
+
+function ConvertOpcode(to, from, itooIndex, otoiIndex) {
+  if (from == kWasmExternRef) {
+    if (to == kWasmExternRef) {
+      return [kExprNop];
+    }
+    return [
+      kExprCallFunction, otoiIndex,
+      ...ConvertOpcode(to, kWasmI32, itooIndex, otoiIndex)
+    ];
+  }
+  switch (to) {
+    case kWasmI32:
+      switch (from) {
+        case kWasmI32:
+          return [kExprNop];
+        case kWasmI64:
+          return [kExprI32ConvertI64];
+        case kWasmF32:
+          return [kNumericPrefix, kExprI32SConvertSatF32];
+        case kWasmF64:
+          return [kNumericPrefix, kExprI32SConvertSatF64];
+      }
+    case kWasmI64:
+      switch (from) {
+        case kWasmI32:
+          return [kExprI64SConvertI32];
+        case kWasmI64:
+          return [kExprNop];
+        case kWasmF32:
+          return [kNumericPrefix, kExprI64SConvertSatF32];
+        case kWasmF64:
+          return [kNumericPrefix, kExprI64SConvertSatF64];
+      }
+    case kWasmF32:
+      switch (from) {
+        case kWasmI32:
+          return [kExprF32SConvertI32];
+        case kWasmI64:
+          return [kExprF32SConvertI64];
+        case kWasmF32:
+          return [kExprNop];
+        case kWasmF64:
+          return [kExprF32ConvertF64];
+      }
+    case kWasmF64:
+      switch (from) {
+        case kWasmI32:
+          return [kExprF64SConvertI32];
+        case kWasmI64:
+          return [kExprF64SConvertI64];
+        case kWasmF32:
+          return [kExprF64ConvertF32];
+        case kWasmF64:
+          return [kExprNop];
+      }
+    case kWasmExternRef:
+      return [
+        ...ConvertOpcode(kWasmI32, from, itooIndex, otoiIndex),
+        kExprCallFunction, itooIndex
+      ];
+  }
+}
+
+function itoo(val) {
+  return {value: val};
+}
+
+function otoi(val) {
+  return val.value;
+}
+
+// A set of interesting values that will be used as parameters.
+let interestingParams = {};
+interestingParams[kWasmI32] = [
+  -0x8000_0000, -1500000000, -0x4000_0000, -0x3fff_ffff, -1, 0, 1, 2,
+  0x3fff_ffff, 0x4000_0000, 1500000000, 0x7fff_ffff, {valueOf: () => 15}, {
+    toString: () => {
+      gc();
+      return '17';
+    }
+  }
+];
+
+interestingParams[kWasmI64] = [
+  -0xffffffffffffffffn,
+  -0x8000_0000_0000_0000n,
+  -0x7fff_ffff_ffff_ffffn,
+  -0xffff_ffffn,
+  -0x8000_0000n,
+  -1500000000n,
+  -0x4000_0000n,
+  -0x3fff_ffffn,
+  -1n,
+  0n,
+  1n,
+  2n,
+  0x3fff_ffffn,
+  0x4000_0000n,
+  1500000000n,
+  0x7fff_ffffn,
+  0x8000_0000n,
+  0xffff_ffffn,
+  0x7fff_ffff_ffff_ffffn,
+  0x8000_0000_0000_0000n,
+  0xffff_ffff_ffff_ffffn,
+  {valueOf: () => 15n},
+  {
+    toString: () => {
+      gc();
+      return '17';
+    }
+  }
+];
+
+interestingParams[kWasmF32] = [
+  -Infinity,
+  -(2 ** 65),
+  -(2 ** 64),
+  -(2 ** 63),
+  -(2 ** 62),
+  -(2 ** 29),
+  -(2 ** 33),
+  -(2 ** 32),
+  -(2 ** 31),
+  -(2 ** 30),
+  -(2 ** 29),
+  -1.5,
+  -1,
+  0,
+  -0,
+  1,
+  1.5,
+  2,
+  2 ** 29,
+  2 ** 30,
+  2 ** 31,
+  2 ** 32,
+  2 ** 33,
+  2 ** 62,
+  2 ** 63,
+  2 ** 64,
+  2 ** 65,
+  {valueOf: () => 16},
+  {
+    toString: () => {
+      gc();
+      return '18';
+    }
+  },
+  Infinity
+];
+
+interestingParams[kWasmF64] = [
+  -Infinity,
+  -(2 ** 65),
+  -(2 ** 64),
+  -(2 ** 63),
+  -(2 ** 62),
+  -(2 ** 29),
+  -(2 ** 33),
+  -(2 ** 32),
+  -(2 ** 31),
+  -(2 ** 30),
+  -(2 ** 29),
+  -1.5,
+  -1,
+  0,
+  -0,
+  1,
+  1.5,
+  2,
+  // 28 set bits, too many for float32.
+  0xfffffff,
+  2 ** 29,
+  2 ** 30,
+  2 ** 31,
+  2 ** 32,
+  2 ** 33,
+  2 ** 62,
+  2 ** 63,
+  2 ** 64,
+  2 ** 65,
+  {valueOf: () => 14},
+  {
+    toString: () => {
+      gc();
+      return '19';
+    }
+  },
+  Infinity
+];
+
+function GetParam(type) {
+  if (type == kWasmExternRef) {
+    return itoo(interestingParams[kWasmI32][getRandomInt(
+        interestingParams[kWasmI32].length)]);
+  }
+  return interestingParams[type][getRandomInt(interestingParams[type].length)];
+}
+
+function GenerateAndRunTest() {
+  // Generate signature
+  const kMaxParams = 20;
+  const kMaxReturns = 10;
+  const numParams = getRandomInt(kMaxParams) + 1;
+  const numReturns = getRandomInt(kMaxReturns + 1);
+  // The array of parameter types.
+  const params = [];
+  // The array of return types.
+  const returns = [];
+  // This array stores which parameters map to which returns. {map} has the same
+  // length as {returns}. `map[i] == j` means that parameter {j} gets returned
+  // by return {i}.
+  const map = [];
+  for (let i = 0; i < numParams; ++i) {
+    params.push(kPossibleTypes[getRandomInt(kPossibleTypes.length)]);
+  }
+  for (let i = 0; i < numReturns; ++i) {
+    returns.push(kPossibleTypes[getRandomInt(kPossibleTypes.length)]);
+  }
+  for (let i = 0; i < numReturns; ++i) {
+    map.push(getRandomInt(numParams));
+  }
+  RunTest(params, returns, map);
+}
+
+function RunTest(params, returns, map) {
+  if (debug) {
+    for (let i = 0; i < map.length; ++i) {
+      map[i] = map[i] % params.length;
+    }
+    while (map.length < returns.length) {
+      map.push(0);
+    }
+    let testcase = 'RunTest([';
+    for (let i = 0; i < params.length; ++i) {
+      testcase += (i == 0 ? '' : ', ') + TypeString(params[i]);
+    }
+    testcase += '], [';
+    if (returns.length > 0) {
+      testcase += TypeString(returns[0]);
+      for (let i = 1; i < returns.length; ++i) {
+        testcase += ', ' + TypeString(returns[i]);
+      }
+    }
+    testcase += '], [' + map + ']);';
+    print(testcase);
+  }
+  const builder = new WasmModuleBuilder();
+
+  const itooIndex = builder.addImport('imp', 'itoo', kSig_r_i);
+  const otoiIndex = builder.addImport('imp', 'otoi', kSig_i_r);
+
+  const sig = makeSig(params, returns);
+  // Generate module
+  const body = [];
+  for (let i = 0; i < returns.length; ++i) {
+    body.push(kExprLocalGet);
+    body.push(map[i]);
+
+    body.push(
+        ...ConvertOpcode(returns[i], params[map[i]], itooIndex, otoiIndex));
+  }
+  builder.addFunction('main', sig).addBody(body).exportFunc();
+
+  const instance = builder.instantiate({imp: {itoo: itoo, otoi: otoi}});
+
+  // Generate call.
+  const args = [];
+  for (let i = 0; i < params.length; ++i) {
+    args.push(GetParam(params[i]));
+  }
+  let result = instance.exports.main(...args);
+  if (returns.length == 0) {
+    assertEquals(result, undefined);
+    return;
+  }
+  if (returns.length == 1) {
+    // Turn result into an array, so that the code below can be used.
+    result = [result];
+  }
+
+  // Check result
+  for (let i = 0; i < returns.length; ++i) {
+    assertEquals(
+        ConversionFunction(returns[i], params[map[i]], args[map[i]]),
+        result[i]);
+  }
+}
+
+for (let i = 0; i < (debug ? 200 : 2); ++i) {
+  GenerateAndRunTest();
+}
diff --git a/deps/v8/test/mjsunit/wasm/trap-location.js b/deps/v8/test/mjsunit/wasm/trap-location.js
index 939e31d7b56d67..2828d794d380be 100644
--- a/deps/v8/test/mjsunit/wasm/trap-location.js
+++ b/deps/v8/test/mjsunit/wasm/trap-location.js
@@ -36,7 +36,7 @@ function testTrapLocations(instance, expected_stack_length) {
 }
 
 var builder = new WasmModuleBuilder();
-builder.addMemory(0, 1, false);
+builder.addMemory(0, 1);
 var sig_index = builder.addType(kSig_i_v)
 
 // Build a function to resemble this code:
diff --git a/deps/v8/test/mjsunit/wasm/turboshaft/basic.js b/deps/v8/test/mjsunit/wasm/turboshaft/basic.js
new file mode 100644
index 00000000000000..5c144697b00ead
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/turboshaft/basic.js
@@ -0,0 +1,248 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-liftoff --no-wasm-lazy-compilation
+// Flags: --turboshaft-wasm --enable-testing-opcode-in-wasm
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+// Make sure turboshaft bails out graciously for non-implemented features.
+(function Bailout() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("bailout", makeSig([], []))
+    .addBody([kExprNopForTestingUnsupportedInLiftoff])
+    .exportFunc();
+
+  builder.instantiate();
+})();
+
+(function I32Arithmetic() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("i32_arithmetic", kSig_i_v)
+    .addBody([kExprI32Const, 32, kExprI32Const, 10, kExprI32Add])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  assertEquals(42, wasm.i32_arithmetic());
+})();
+
+(function I32Locals() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("i32_locals", kSig_i_ii)
+    .addLocals(kWasmI32, 1)
+    .addBody([
+      // i = i + 1;
+      kExprLocalGet, 0, kExprI32Const, 1, kExprI32Add, kExprLocalSet, 0,
+      // k = j + 2; temp1 = k;
+      kExprLocalGet, 1, kExprI32Const, 2, kExprI32Add, kExprLocalTee, 2,
+      // temp2 = temp1 + i;
+      kExprLocalGet, 0, kExprI32Add,
+      // return temp2 * k;
+      kExprLocalGet, 2, kExprI32Mul])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  assertEquals((22 + 11) * 22, wasm.i32_locals(10, 20));
+})();
+
+(function IfThenElse() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let if_sig_32 = builder.addType(kSig_ii_ii);
+
+  builder.addFunction("if_then_else_32", kSig_i_iii)
+    .addBody([
+      // f(x, y, z) {
+      //   [temp1, temp2] = z ? [x + y, x] : [x - y, y];
+      //   return temp1 * temp2;
+      // }
+      kExprLocalGet, 0, kExprLocalGet, 1,
+      kExprLocalGet, 2,
+      kExprIf, if_sig_32,
+        kExprI32Add, kExprLocalGet, 0,
+      kExprElse,
+        kExprI32Sub, kExprLocalGet, 1,
+      kExprEnd,
+      kExprI32Mul])
+    .exportFunc();
+
+  let if_sig_64 = builder.addType(
+      makeSig([kWasmI64, kWasmI64], [kWasmI64, kWasmI64]));
+
+  builder.addFunction(
+      "if_then_else_64",
+      makeSig([kWasmI64, kWasmI64, kWasmI32], [kWasmI64]))
+    .addBody([
+      // f(x, y, z) {
+      //   [temp1, temp2] = z ? [x + y, x] : [x - y, y];
+      //   return temp1 * temp2;
+      // }
+      kExprLocalGet, 0, kExprLocalGet, 1,
+      kExprLocalGet, 2,
+      kExprIf, if_sig_64,
+        kExprI64Add, kExprLocalGet, 0,
+      kExprElse,
+        kExprI64Sub, kExprLocalGet, 1,
+      kExprEnd,
+      kExprI64Mul])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  assertEquals(-200, wasm.if_then_else_32(10, 20, 0));
+  assertEquals(300, wasm.if_then_else_32(10, 20, 1));
+  assertEquals(-200n, wasm.if_then_else_64(10n, 20n, 0));
+  assertEquals(300n, wasm.if_then_else_64(10n, 20n, 1));
+})();
+
+(function OneArmedIf() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  builder.addFunction("one_armed_if", kSig_i_ii)
+    .addBody([
+      // f(x, y) {
+      //   if (y) x = x + 1;
+      //   return x;
+      // }
+      kExprLocalGet, 1,
+      kExprIf, kWasmVoid,
+        kExprLocalGet, 0, kExprI32Const, 1, kExprI32Add, kExprLocalSet, 0,
+      kExprEnd,
+      kExprLocalGet, 0])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  assertEquals(10, wasm.one_armed_if(10, 0));
+  assertEquals(11, wasm.one_armed_if(10, -1));
+})();
+
+(function BlockAndBr() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let block_sig = builder.addType(kSig_ii_ii);
+
+  builder.addFunction("block_and_br", kSig_i_iii)
+    .addBody([
+      // f(x, y, z) {
+      //   temp1 = x + y;
+      //   temp2 = x;
+      //   if (z) goto block;
+      //   temp2 = temp2 * y;
+      //  block:
+      //   return temp1 + temp2;
+      // }
+      kExprLocalGet, 0, kExprLocalGet, 1,
+      kExprBlock, block_sig,
+        kExprI32Add,
+        kExprLocalGet, 0,
+        kExprLocalGet, 2,
+        kExprBrIf, 0,
+        kExprLocalGet, 1,
+        kExprI32Mul,
+      kExprEnd,
+      kExprI32Add])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  assertEquals((10 + 20) + (10 * 20), wasm.block_and_br(10, 20, 0));
+  assertEquals((10 + 20) + 10, wasm.block_and_br(10, 20, 1));
+})();
+
+(function Loop() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let loop_sig = builder.addType(kSig_i_i);
+
+  // Works for positive numbers only.
+  builder.addFunction("factorial", kSig_i_i)
+    .addBody([
+      kExprI32Const, 1,
+      kExprLoop, loop_sig,
+        kExprLocalGet, 0,
+        kExprI32Mul,
+        kExprLocalGet, 0, kExprI32Const, 1, kExprI32Sub, kExprLocalSet, 0,
+        kExprLocalGet, 0,
+        kExprI32Const, 1,
+        kExprI32GtS,
+        kExprBrIf, 0,
+      kExprEnd])
+    .exportFunc();
+
+  builder.addFunction("factorial_with_br_if_return", kSig_i_i)
+    .addLocals(kWasmI32, 1)
+    .addBody([
+      kExprI32Const, 1, kExprLocalSet, 1,
+      kExprLoop, kWasmVoid,
+        kExprLocalGet, 1,
+        kExprLocalGet, 0, kExprI32Const, 1, kExprI32LtS,
+        kExprBrIf, 1,
+        kExprLocalGet, 0, kExprI32Mul, kExprLocalSet, 1,
+        kExprLocalGet, 0, kExprI32Const, 1, kExprI32Sub, kExprLocalSet, 0,
+        kExprBr, 0,
+      kExprEnd,
+      kExprUnreachable])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  assertEquals(1, wasm.factorial(1));
+  assertEquals(24, wasm.factorial(4));
+  assertEquals(720, wasm.factorial(6));
+
+  assertEquals(1, wasm.factorial_with_br_if_return(0));
+  assertEquals(1, wasm.factorial_with_br_if_return(1));
+  assertEquals(24, wasm.factorial_with_br_if_return(4));
+  assertEquals(720, wasm.factorial_with_br_if_return(6));
+})();
+
+(function Multireturn() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  builder.addFunction("swap", kSig_ii_ii)
+    .addBody([kExprI32Const, 42, // garbage
+              kExprLocalGet, 1, kExprLocalGet, 0, kExprReturn])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  assertEquals([1, 0], wasm.swap(0, 1));
+})();
+
+(function BrTable() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let block_sig = builder.addType(kSig_i_i);
+
+  builder.addFunction("br_table", kSig_i_i)
+    .addBody([
+      kExprLocalGet, 0,
+      kExprBlock, block_sig,
+        kExprBlock, block_sig,
+          kExprLocalGet, 0,
+          kExprBrTable, 2, 2, 1, 0,
+        kExprEnd,
+        kExprI32Const, 1, kExprI32Add, kExprReturn,
+      kExprEnd,
+      kExprI32Const, 2, kExprI32Sub])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+
+  assertEquals(0, wasm.br_table(0));
+  assertEquals(-1, wasm.br_table(1));
+  assertEquals(23, wasm.br_table(22));
+})();
diff --git a/deps/v8/test/mjsunit/wasm/turboshaft/int64-lowering.js b/deps/v8/test/mjsunit/wasm/turboshaft/int64-lowering.js
new file mode 100644
index 00000000000000..6497c93bb09ffb
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/turboshaft/int64-lowering.js
@@ -0,0 +1,693 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --no-liftoff --no-wasm-lazy-compilation
+// Flags: --turboshaft-wasm --enable-testing-opcode-in-wasm
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+// Make sure turboshaft bails out graciously for non-implemented features.
+(function I64Identity() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("id", makeSig([kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0n, wasm.id(0n));
+  assertEquals(1n, wasm.id(1n));
+  assertEquals(-1n, wasm.id(-1n));
+  assertEquals(0x123456789ABCn, wasm.id(0x123456789ABCn));
+  assertEquals(-0x123456789ABCn, wasm.id(-0x123456789ABCn));
+})();
+
+(function I64Constants() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("main", makeSig([], [kWasmI64, kWasmI64, kWasmI64]))
+    .addBody([
+      ...wasmI64Const(0),
+      ...wasmI64Const(-12345),
+      ...wasmI64Const(0x123456789ABCDEFn),
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals([0n, -12345n, 0x123456789ABCDEFn], wasm.main());
+})();
+
+(function I64Multiplication() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("mul", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Mul,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0n, wasm.mul(0n, 5n));
+  assertEquals(0n, wasm.mul(5n, 0n));
+  assertEquals(5n, wasm.mul(1n, 5n));
+  assertEquals(-5n, wasm.mul(5n, -1n));
+  assertEquals(35n, wasm.mul(-5n, -7n));
+  assertEquals(0xfffffffffn * 0xfn, wasm.mul(0xfffffffffn, 0xfn));
+})();
+
+(function I64Addition() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("add", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Add,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(3n, wasm.add(1n, 2n));
+  assertEquals(0n, wasm.add(100n, -100n));
+  assertEquals(0x12345678n + 0xABCDEF1234n,
+               wasm.add(0x12345678n, 0xABCDEF1234n));
+})();
+
+(function I64Subtraction() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("sub", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Sub,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(-1n, wasm.sub(1n, 2n));
+  assertEquals(200n, wasm.sub(100n, -100n));
+  assertEquals(0x12345678n - 0xABCDEF1234n,
+               wasm.sub(0x12345678n, 0xABCDEF1234n));
+  assertEquals(0n, wasm.sub(0x123456789ABCDEFn, 0x123456789ABCDEFn));
+})();
+
+(function I64BitAnd() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("and", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64And,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(
+    0b10101010_00000000_11111111_01010101n, wasm.and(
+    0b10101010_00000000_11111111_01010101n,
+    0b10101010_00000000_11111111_01010101n));
+  assertEquals(
+    0b10101010_00000000_01010101_00000000n, wasm.and(
+    0b10101010_00000000_11111111_01010101n,
+    0b11111111_11111111_01010101_00000000n));
+})();
+
+(function I64BitOr() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("or", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Ior,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(
+    0b10101010_00000000_11111111_01010101n, wasm.or(
+    0b10101010_00000000_11111111_01010101n,
+    0b10101010_00000000_11111111_01010101n));
+  assertEquals(
+    0b11111111_11111111_11111111_01010101n, wasm.or(
+    0b10101010_00000000_11111111_01010101n,
+    0b11111111_11111111_01010101_00000000n));
+})();
+
+(function I64BitXor() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("xor", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Xor,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(
+    0b10101010_00000000_11111111_01010101n, wasm.xor(
+    0b10101010_00000000_11111111_01010101n,
+    0b00000000_00000000_00000000_00000000n));
+  assertEquals(
+    0b11111111_11111111_11111111_01010101n, wasm.xor(
+    0b10101010_00000000_11111111_01010101n,
+    0b01010101_11111111_00000000_00000000n));
+})();
+
+(function I64BitShl() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("shl", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Shl,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0x123456789n, wasm.shl(0x123456789n, 0n));
+  assertEquals(0x1234567890000n, wasm.shl(0x123456789n, 16n));
+  assertEquals(0x3456789000000000n, wasm.shl(0x123456789n, 36n));
+  assertEquals(31n << 56n, wasm.shl(31n, -8n));
+  assertEquals(31n << 1n, wasm.shl(31n, 65n));
+})();
+
+(function I64BitShrs() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("shrs", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64ShrS,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0x123456789n, wasm.shrs(0x123456789n, 0n));
+  assertEquals(0x12345n, wasm.shrs(0x123456789n, 16n));
+  assertEquals(-0x2n, wasm.shrs(-0x123456789n, 32n));
+  assertEquals(-0x1n, wasm.shrs(-0x123456789n, 33n));
+  assertEquals(-0x1n, wasm.shrs(-0x123456789n, 40n));
+  assertEquals(-0x123456789n, wasm.shrs(-0x123456789n, 64n));
+  assertEquals(31n >> 56n, wasm.shrs(31n, -8n));
+  assertEquals(31n >> 1n, wasm.shrs(31n, 65n));
+})();
+
+(function I64BitShrU() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("shru", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64ShrU,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0x123456789n, wasm.shru(0x123456789n, 0n));
+  assertEquals(0x12345n, wasm.shru(0x123456789n, 16n));
+  assertEquals(0xFFFFFFFEn, wasm.shru(-0x123456789n, 32n));
+  assertEquals(0xFn, wasm.shru(-0x123456789n, 60n));
+  assertEquals(-0x123456789n, wasm.shru(-0x123456789n, 64n));
+  assertEquals(31n >> 56n, wasm.shru(31n, -8n));
+  assertEquals(31n >> 1n, wasm.shru(31n, 65n));
+})();
+
+(function I64BitRol() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("rol", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Rol,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0x123456789n, wasm.rol(0x123456789n, 0n));
+  assertEquals(0x1234567890000n, wasm.rol(0x123456789n, 16n));
+  assertEquals(0x3456789000000012n, wasm.rol(0x123456789n, 36n));
+  assertEquals(0x34567890ABCDEF12n, wasm.rol(0xABCDEF1234567890n, 32n));
+  assertEquals(0x4D5E6F78091A2B3Cn, wasm.rol(0x123456789ABCDEF0n, 31n));
+  assertEquals(0x3579BDE02468ACF1n, wasm.rol(0x123456789ABCDEF0n, 33n));
+  assertEquals(31n << 56n, wasm.rol(31n, -8n));
+  assertEquals(31n << 1n, wasm.rol(31n, 65n));
+})();
+
+(function I64BitRolStaticRhs() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let tests = [
+    // [lhs, rhs, expected]
+    [0x123456789n, 0n, 0x123456789n],
+    [0x12345678_11111111n, 32n, 0x11111111_12345678n],
+    [0x1_23456789n, 16n, 0x12345_67890000n],
+    [0x1_23456789n, 36n, 0x34567890_00000012n],
+    [31n, -8, 31n << 56n],
+    [31n, 65n, 31n << 1n],
+  ];
+
+  for (const [lhs, rhs, expected] of tests) {
+    builder.addFunction(`rol${rhs}`, makeSig([kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      ...wasmI64Const(rhs),
+      kExprI64Rol,
+    ])
+    .exportFunc();
+  }
+
+  let wasm = builder.instantiate().exports;
+
+  for (const [lhs, rhs, expected] of tests) {
+    print(`test i64.rol(${lhs}, ${rhs}) == ${expected}`);
+    assertEquals(expected, wasm[`rol${rhs}`](lhs));
+  }
+})();
+
+(function I64BitRor() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("ror", makeSig([kWasmI64, kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Ror,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0x123456789n, wasm.ror(0x123456789n, 0n));
+  assertEquals(0x6789000000012345n, wasm.ror(0x123456789n, 16n));
+  assertEquals(0x1234567890000000n, wasm.ror(0x123456789n, 36n));
+  assertEquals(0x34567890ABCDEF12n, wasm.ror(0xABCDEF1234567890n, 32n));
+  assertEquals(0x3579BDE02468ACF1n, wasm.ror(0x123456789ABCDEF0n, 31n));
+  assertEquals(0x4D5E6F78091A2B3Cn, wasm.ror(0x123456789ABCDEF0n, 33n));
+  assertEquals(31n << 8n, wasm.ror(31n, -8n));
+  assertEquals(31n << 1n, wasm.ror(31n, 127n));
+})();
+
+(function I64Equals() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("eq", makeSig([kWasmI64, kWasmI64], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Eq,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(1, wasm.eq(0n, 0n));
+  assertEquals(1, wasm.eq(-123n, -123n));
+  assertEquals(0, wasm.eq(-123n, 123n));
+  assertEquals(0, wasm.eq(0x12345678_87654321n, 0x87654321_12345678n));
+  assertEquals(0, wasm.eq(0x12345678_87654321n, 0x1234567A_87654321n));
+  assertEquals(0, wasm.eq(0x12345678_87654321n, 0x12345678_8765432An));
+})();
+
+(function I64NotEquals() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("ne", makeSig([kWasmI64, kWasmI64], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64Ne,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0, wasm.ne(0n, 0n));
+  assertEquals(0, wasm.ne(-123n, -123n));
+  assertEquals(1, wasm.ne(-123n, 123n));
+  assertEquals(1, wasm.ne(0x12345678_87654321n, 0x87654321_12345678n));
+  assertEquals(1, wasm.ne(0x12345678_87654321n, 0x1234567A_87654321n));
+  assertEquals(1, wasm.ne(0x12345678_87654321n, 0x12345678_8765432An));
+})();
+
+(function I64LessThanSigned() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("lts", makeSig([kWasmI64, kWasmI64], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64LtS,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0, wasm.lts(0n, 0n));
+  assertEquals(1, wasm.lts(-123n, 123n));
+  assertEquals(0, wasm.lts(123n, -123n));
+  assertEquals(1, wasm.lts(0x12345678_12488421n, 0x12488421_12345678n));
+  assertEquals(0, wasm.lts(0x12488421_12345678n, 0x12345678_12488421n));
+  assertEquals(0, wasm.lts(0x12345678_87654321n, 0x12345678_87654320n));
+  assertEquals(1, wasm.lts(0x12345678_87654321n, 0x12345678_87654322n));
+})();
+
+(function I64LessThanOrEqualSigned() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("les", makeSig([kWasmI64, kWasmI64], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64LeS,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(1, wasm.les(0n, 0n));
+  assertEquals(1, wasm.les(-123n, 123n));
+  assertEquals(0, wasm.les(123n, -123n));
+  assertEquals(1, wasm.les(0x12345678_12488421n, 0x12488421_12345678n));
+  assertEquals(0, wasm.les(0x12488421_12345678n, 0x12345678_12488421n));
+  assertEquals(0, wasm.les(0x12345678_87654321n, 0x12345678_87654320n));
+  assertEquals(1, wasm.les(0x12345678_87654321n, 0x12345678_87654322n));
+})();
+
+(function I64LessThanUnsigned() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("ltu", makeSig([kWasmI64, kWasmI64], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64LtU,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0, wasm.ltu(0n, 0n));
+  assertEquals(0, wasm.ltu(-123n, 123n));
+  assertEquals(1, wasm.ltu(123n, -123n));
+  assertEquals(1, wasm.ltu(0x12345678_12488421n, 0x12488421_12345678n));
+  assertEquals(0, wasm.ltu(0x12488421_12345678n, 0x12345678_12488421n));
+  assertEquals(0, wasm.ltu(0x12345678_87654321n, 0x12345678_87654320n));
+  assertEquals(1, wasm.ltu(0x12345678_87654321n, 0x12345678_87654322n));
+})();
+
+(function I64LessThanOrEqualUnsigned() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("leu", makeSig([kWasmI64, kWasmI64], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI64LeU,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(1, wasm.leu(0n, 0n));
+  assertEquals(0, wasm.leu(-123n, 123n));
+  assertEquals(1, wasm.leu(123n, -123n));
+  assertEquals(1, wasm.leu(0x12345678_12488421n, 0x12488421_12345678n));
+  assertEquals(0, wasm.leu(0x12488421_12345678n, 0x12345678_12488421n));
+  assertEquals(0, wasm.leu(0x12345678_87654321n, 0x12345678_87654320n));
+  assertEquals(1, wasm.leu(0x12345678_87654321n, 0x12345678_87654322n));
+})();
+
+(function I64EqualsZero() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("eqz", makeSig([kWasmI64], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64Eqz,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(1, wasm.eqz(0n));
+  assertEquals(0, wasm.eqz(1n));
+  assertEquals(0, wasm.eqz(-1n));
+  assertEquals(0, wasm.eqz(0x100_00000000n));
+})();
+
+(function I64Call() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let callee = builder.addFunction("callee",
+      makeSig([kWasmI64], [kWasmI64]))
+    .addBody([kExprLocalGet, 0])
+    .exportFunc();
+  builder.addFunction("call", makeSig([kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprCallFunction, callee.index,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(123n, wasm.callee(123n));
+  assertEquals(123n, wasm.call(123n));
+})();
+
+(function I64CallMultiReturn() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let callee = builder.addFunction("callee",
+      makeSig([kWasmI32, kWasmI64, kWasmI64, kWasmI32],
+              [kWasmI32, kWasmI64, kWasmI64, kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprLocalGet, 2,
+      kExprLocalGet, 3,
+    ])
+    .exportFunc();
+  builder.addFunction("call",
+      makeSig([kWasmI64, kWasmI64], [kWasmI32, kWasmI64, kWasmI64, kWasmI32]))
+    .addBody([
+      kExprI32Const, 11,
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI32Const, 22,
+      kExprCallFunction, callee.index,
+    ])
+    .exportFunc();
+
+  builder.addFunction("tailCall",
+      makeSig([kWasmI64, kWasmI64], [kWasmI32, kWasmI64, kWasmI64, kWasmI32]))
+    .addBody([
+      kExprI32Const, 11,
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprI32Const, 22,
+      kExprReturnCall, callee.index,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals([11, 123n, -1n, 22], wasm.callee(11, 123n, -1n, 22));
+  assertEquals([11, 123n, -1n, 22], wasm.call(123n, -1n));
+  assertEquals([11, 123n, -1n, 22], wasm.tailCall(123n, -1n));
+
+  assertEquals([11, -123n, 123n, 22], wasm.callee(11, -123n, 123n, 22));
+  assertEquals([11, -123n, 123n, 22], wasm.call(-123n, 123n));
+  assertEquals([11, -123n, 123n, 22], wasm.tailCall(-123n, 123n));
+})();
+
+(function I64CountLeadingZeros() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("clz", makeSig([kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64Clz,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0n, wasm.clz(-1n));
+  assertEquals(64n, wasm.clz(0n));
+  assertEquals(47n, wasm.clz(0x1FFFFn));
+})();
+
+(function I64CountTrailingZeros() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("ctz", makeSig([kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64Ctz,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0n, wasm.ctz(-1n));
+  assertEquals(64n, wasm.ctz(0n));
+  assertEquals(17n, wasm.ctz(0xE0000n));
+})();
+
+(function I64PopCount() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("popcnt", makeSig([kWasmI64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64Popcnt,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(64n, wasm.popcnt(-1n));
+  assertEquals(0n, wasm.popcnt(0n));
+  assertEquals(10n, wasm.popcnt(0b10101011111100001n));
+})();
+
+(function I64ConvertFromInt32() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("fromI32", makeSig([kWasmI32], [kWasmI64, kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64SConvertI32,
+      kExprLocalGet, 0,
+      kExprI64UConvertI32,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals([0n, 0n], wasm.fromI32(0));
+  assertEquals([123n, 123n], wasm.fromI32(123));
+  assertEquals([-1n, 0xFFFFFFFFn], wasm.fromI32(-1));
+  assertEquals([-2147483648n, 2147483648n], wasm.fromI32(0x80000000));
+})();
+
+(function I64ConvertFromF64() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("reinterpretF64", makeSig([kWasmF64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64ReinterpretF64
+    ])
+    .exportFunc();
+  builder.addFunction("signedF64", makeSig([kWasmF64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64SConvertF64,
+    ])
+    .exportFunc();
+  builder.addFunction("unsignedF64", makeSig([kWasmF64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64UConvertF64,
+    ])
+    .exportFunc();
+  builder.addFunction("signedSatF64", makeSig([kWasmF64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kNumericPrefix, kExprI64SConvertSatF64,
+    ])
+    .exportFunc();
+  builder.addFunction("unsignedSatF64", makeSig([kWasmF64], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kNumericPrefix, kExprI64UConvertSatF64,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  assertEquals(0n, wasm.reinterpretF64(0));
+  assertEquals(4638355772470722560n, wasm.reinterpretF64(123));
+  assertEquals(-4585016264384053248n, wasm.reinterpretF64(-123));
+
+  assertEquals(0xFF_12345678n, wasm.signedF64(0xFF_12345678));
+  assertEquals(-0xFF_12345678n, wasm.signedF64(-0xFF_12345678));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.signedF64(NaN));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.signedF64(Infinity));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.signedF64(-Infinity));
+
+  assertEquals(0xFF_12345678n, wasm.unsignedF64(0xFF_12345678));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.unsignedF64(-1));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.unsignedF64(NaN));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.unsignedF64(Infinity));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.unsignedF64(-Infinity));
+
+  assertEquals(0xFF_12345678n, wasm.signedSatF64(0xFF_12345678));
+  assertEquals(-0xFF_12345678n, wasm.signedSatF64(-0xFF_12345678));
+  assertEquals(0n, wasm.signedSatF64(NaN));
+  assertEquals(9223372036854775807n, wasm.signedSatF64(Infinity));
+  assertEquals(-9223372036854775808n, wasm.signedSatF64(-Infinity));
+
+  assertEquals(0xFF_12345678n, wasm.unsignedSatF64(0xFF_12345678));
+  assertEquals(0n, wasm.unsignedSatF64(-0xFF_12345678));
+  assertEquals(0n, wasm.unsignedSatF64(NaN));
+  assertEquals(-1n, wasm.unsignedSatF64(Infinity));
+  assertEquals(0n, wasm.unsignedSatF64(-Infinity));
+})();
+
+(function I64ConvertFromF32() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  builder.addFunction("signedF32", makeSig([kWasmF32], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64SConvertF32,
+    ])
+    .exportFunc();
+  builder.addFunction("unsignedF32", makeSig([kWasmF32], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kExprI64UConvertF32,
+    ])
+    .exportFunc();
+  builder.addFunction("signedSatF32", makeSig([kWasmF32], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kNumericPrefix, kExprI64SConvertSatF32,
+    ])
+    .exportFunc();
+  builder.addFunction("unsignedSatF32", makeSig([kWasmF32], [kWasmI64]))
+    .addBody([
+      kExprLocalGet, 0,
+      kNumericPrefix, kExprI64UConvertSatF32,
+    ])
+    .exportFunc();
+
+  let wasm = builder.instantiate().exports;
+  // Loss of precision due to float32.
+  assertEquals(0xFF_12340000n, wasm.signedF32(0xFF_12345678));
+  assertEquals(-0xFF_12340000n, wasm.signedF32(-0xFF_12345678));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.signedF32(NaN));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.signedF32(Infinity));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.signedF32(-Infinity));
+
+  assertEquals(0xFF_12340000n, wasm.unsignedF32(0xFF_12345678));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.unsignedF32(-1));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.unsignedF32(NaN));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.unsignedF32(Infinity));
+  assertTraps(kTrapFloatUnrepresentable, () => wasm.unsignedF32(-Infinity));
+
+  assertEquals(0xFF_12340000n, wasm.signedSatF32(0xFF_12345678));
+  assertEquals(-0xFF_12340000n, wasm.signedSatF32(-0xFF_12345678));
+  assertEquals(0n, wasm.signedSatF32(NaN));
+  assertEquals(9223372036854775807n, wasm.signedSatF32(Infinity));
+  assertEquals(-9223372036854775808n, wasm.signedSatF32(-Infinity));
+
+  assertEquals(0xFF_12340000n, wasm.unsignedSatF32(0xFF_12345678));
+  assertEquals(0n, wasm.unsignedSatF32(-0xFF_12345678));
+  assertEquals(0n, wasm.unsignedSatF32(NaN));
+  assertEquals(-1n, wasm.unsignedSatF32(Infinity));
+  assertEquals(0n, wasm.unsignedSatF32(-Infinity));
+})();
diff --git a/deps/v8/test/mjsunit/wasm/type-casts-tests.js b/deps/v8/test/mjsunit/wasm/type-casts-tests.js
new file mode 100644
index 00000000000000..0964117236aac7
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/type-casts-tests.js
@@ -0,0 +1,34 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+(function TestRefTestErrorIndex() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+
+  builder.addFunction("ref_test_missing_arg", kSig_i_v)
+    .addBody([kGCPrefix, kExprRefTest, struct])
+
+  assertThrows(() => builder.instantiate(), WebAssembly.CompileError,
+               /\(need 1, got 0\)/);
+})();
+
+(function TestRefCastErrorIndex() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+
+  builder.addFunction("ref_cast_missing_arg",
+                      makeSig([], [wasmRefType(struct)]))
+    .addBody([kGCPrefix, kExprRefCast, struct])
+
+  assertThrows(() => builder.instantiate(), WebAssembly.CompileError,
+               /\(need 1, got 0\)/);
+})();
diff --git a/deps/v8/test/mjsunit/wasm/type-reflection.js b/deps/v8/test/mjsunit/wasm/type-reflection.js
index f81980b2510218..ae55e15c362392 100644
--- a/deps/v8/test/mjsunit/wasm/type-reflection.js
+++ b/deps/v8/test/mjsunit/wasm/type-reflection.js
@@ -12,20 +12,26 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   let type = mem.type();
   assertEquals(1, type.minimum);
   assertEquals(false, type.shared);
-  assertEquals(2, Object.getOwnPropertyNames(type).length);
+  assertEquals(3, Object.getOwnPropertyNames(type).length);
 
   mem = new WebAssembly.Memory({initial: 2, maximum: 15});
   type = mem.type();
   assertEquals(2, type.minimum);
   assertEquals(15, type.maximum);
   assertEquals(false, type.shared);
-  assertEquals(3, Object.getOwnPropertyNames(type).length);
+  assertEquals("u32", type.index);
+  assertEquals(4, Object.getOwnPropertyNames(type).length);
+
+  mem = new WebAssembly.Memory({initial: 2, maximum: 15, index: "u64"});
+  type = mem.type();
+  assertEquals("u64", type.index);
 })();
 
 (function TestMemoryExports() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
-  builder.addMemory(1).exportMemoryAs("a")
+  builder.addMemory(1);
+  builder.exportMemoryAs("a")
   let module = new WebAssembly.Module(builder.toBuffer());
   let exports = WebAssembly.Module.exports(module);
 
@@ -35,7 +41,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertFalse("maximum" in exports[0].type);
 
   builder = new WasmModuleBuilder();
-  builder.addMemory(2, 16).exportMemoryAs("b")
+  builder.addMemory(2, 16);
+  builder.exportMemoryAs("b")
   module = new WebAssembly.Module(builder.toBuffer());
   exports = WebAssembly.Module.exports(module);
 
@@ -233,7 +240,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   let type = mem.type();
   assertEquals(1, type.minimum);
   assertEquals(false, type.shared);
-  assertEquals(2, Object.getOwnPropertyNames(type).length);
+  assertEquals("u32", type.index);
+  assertEquals(3, Object.getOwnPropertyNames(type).length);
 
   mem = new WebAssembly.Memory({minimum: 1, maximum: 5, shared: false});
   assertTrue(mem instanceof WebAssembly.Memory);
@@ -241,7 +249,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, type.minimum);
   assertEquals(5, type.maximum);
   assertEquals(false, type.shared);
-  assertEquals(3, Object.getOwnPropertyNames(type).length);
+  assertEquals("u32", type.index);
+  assertEquals(4, Object.getOwnPropertyNames(type).length);
 
   mem = new WebAssembly.Memory({initial: 1, maximum: 5, shared: true});
   assertTrue(mem instanceof WebAssembly.Memory);
@@ -249,7 +258,8 @@ d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
   assertEquals(1, type.minimum);
   assertEquals(5, type.maximum);
   assertEquals(true, type.shared);
-  assertEquals(3, Object.getOwnPropertyNames(type).length);
+  assertEquals("u32", type.index);
+  assertEquals(4, Object.getOwnPropertyNames(type).length);
 
   assertThrows(
       () => new WebAssembly.Memory({minimum: 1, initial: 2}), TypeError,
diff --git a/deps/v8/test/mjsunit/wasm/typed-funcref.js b/deps/v8/test/mjsunit/wasm/typed-funcref.js
index 36281c5adcc777..46bc68187937a4 100644
--- a/deps/v8/test/mjsunit/wasm/typed-funcref.js
+++ b/deps/v8/test/mjsunit/wasm/typed-funcref.js
@@ -24,7 +24,7 @@ let foo = (() => {
   table.grow(10);
   table.grow(10, foo);
   table.grow(10, null);
-  table.grow(10, undefined);
+  assertThrows(() => table.grow(10, undefined), TypeError);
 
   for (let i = 0; i < 10; i++) {
     assertNull(table.get(i));
@@ -32,7 +32,7 @@ let foo = (() => {
   for (let i = 10; i < 20; i++) {
     assertEquals(foo, table.get(i));
   }
-  for (let i = 20; i < 40; i++) {
+  for (let i = 20; i < 30; i++) {
     assertNull(table.get(i));
   }
 })();
diff --git a/deps/v8/test/mjsunit/wasm/unicode.js b/deps/v8/test/mjsunit/wasm/unicode.js
index 2fceeed24f2762..054040ede66a5c 100644
--- a/deps/v8/test/mjsunit/wasm/unicode.js
+++ b/deps/v8/test/mjsunit/wasm/unicode.js
@@ -59,7 +59,7 @@ checkExports('☺☺mul☺☺', '☺☺mul☺☺', '☺☺add☺☺', '☺☺add
   builder.addImport('three snowmen: ☃☃☃', 'foo', kSig_i_v);
   assertThrows(
       () => builder.instantiate({}), TypeError,
-      /WebAssembly.Instance\(\): Import #0 module="three snowmen: ☃☃☃" error: /);
+      /WebAssembly.Instance\(\): Import #0 module="three snowmen: ☃☃☃": /);
 })();
 
 (function errorMessageUnicodeInImportElemName() {
@@ -68,7 +68,7 @@ checkExports('☺☺mul☺☺', '☺☺mul☺☺', '☺☺add☺☺', '☺☺add
   assertThrows(
       () => builder.instantiate({mod: {}}), WebAssembly.LinkError,
       'WebAssembly.Instance\(\): Import #0 module="mod" function="three ' +
-          'snowmen: ☃☃☃" error: function import requires a callable');
+          'snowmen: ☃☃☃": function import requires a callable');
 })();
 
 (function errorMessageUnicodeInImportModAndElemName() {
@@ -80,5 +80,5 @@ checkExports('☺☺mul☺☺', '☺☺mul☺☺', '☺☺add☺☺', '☺☺add
       () => builder.instantiate({[mod_name]: {}}), WebAssembly.LinkError,
       'WebAssembly.Instance(): Import #0 module="' + mod_name +
           '" function="' + func_name +
-          '" error: function import requires a callable');
+          '": function import requires a callable');
 })();
diff --git a/deps/v8/test/mjsunit/wasm/user-properties-module.js b/deps/v8/test/mjsunit/wasm/user-properties-module.js
index 00ba17a40e001f..8b6561ebf986bd 100644
--- a/deps/v8/test/mjsunit/wasm/user-properties-module.js
+++ b/deps/v8/test/mjsunit/wasm/user-properties-module.js
@@ -17,8 +17,8 @@ d8.file.execute("test/mjsunit/wasm/user-properties-common.js");
         kExprLocalGet, 0,
         kExprCallFunction, 0])
       .exportAs("main");
-    builder.addMemory(1, 1, false)
-      .exportMemoryAs("memory")
+    builder.addMemory(1, 1);
+    builder.exportMemoryAs("memory");
 
     let module = builder.toModule();
     testProperties(module);
diff --git a/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-load-elimination.js b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-load-elimination.js
new file mode 100644
index 00000000000000..01c761de5cfa0e
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-load-elimination.js
@@ -0,0 +1,88 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --allow-natives-syntax --turbofan
+// Flags: --no-always-turbofan --no-always-sparkplug --expose-gc
+// Flags: --experimental-wasm-js-inlining
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+function testOptimized(run, fctToOptimize) {
+  fctToOptimize = fctToOptimize ?? run;
+  %PrepareFunctionForOptimization(fctToOptimize);
+  for (let i = 0; i < 10; ++i) {
+    run();
+  }
+  %OptimizeFunctionOnNextCall(fctToOptimize);
+  run();
+  assertOptimized(fctToOptimize);
+}
+
+/**
+ * Test load elimination using "user-space" arrays.
+ * Assumption: A user-space array is implemented as a struct containing a wasm
+ * array used as a backing store.
+ * Assumption 2: For simplicity, there isn't any bounds check happening on the
+ * size stored in the wasm struct.
+ */
+(function TestUserSpaceArrayLoadElimination() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let backingStore = builder.addArray(kWasmI8, true);
+  let arrayStruct = builder.addStruct([
+    makeField(kWasmI32 /*length*/, true),
+    makeField(wasmRefType(backingStore), true)
+  ]);
+
+  builder.addFunction('createArray',
+      makeSig([kWasmI32, kWasmI32, kWasmI32], [kWasmExternRef]))
+    .addBody([
+      kExprI32Const, 3, // length
+      kExprLocalGet, 0,
+      kExprLocalGet, 1,
+      kExprLocalGet, 2,
+      kGCPrefix, kExprArrayNewFixed, backingStore, 3,
+      kGCPrefix, kExprStructNew, arrayStruct,
+      kGCPrefix, kExprExternExternalize,
+    ])
+    .exportFunc();
+
+  builder.addFunction('getLength',
+      makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCast, arrayStruct,
+      kGCPrefix, kExprStructGet, arrayStruct, 0,
+    ])
+    .exportFunc();
+
+  builder.addFunction('get', makeSig([kWasmExternRef, kWasmI32], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCast, arrayStruct,
+      kGCPrefix, kExprStructGet, arrayStruct, 1,
+      kExprLocalGet, 1,
+      kGCPrefix, kExprArrayGetU, backingStore,
+    ])
+    .exportFunc();
+
+  let instance = builder.instantiate({});
+  let wasm = instance.exports;
+
+  let myUserArray = wasm.createArray(42, 43, 44);
+
+  let sumArray = (arrayStruct) => {
+    let get = wasm.get;
+    let length = wasm.getLength(arrayStruct);
+    let result = 0;
+    for (let i = 0; i < length; ++i) {
+      result += get(arrayStruct, i);
+    }
+    return result;
+  };
+
+  testOptimized(() => assertEquals(42+43+44, sumArray(myUserArray)), sumArray);
+})();
diff --git a/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-nested.js b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-nested.js
new file mode 100644
index 00000000000000..ac51cd04e13c92
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-nested.js
@@ -0,0 +1,110 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --allow-natives-syntax --turbofan
+// Flags: --no-always-turbofan --no-always-sparkplug --expose-gc
+// Flags: --experimental-wasm-js-inlining
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+function testOptimized(run, fctToOptimize) {
+  fctToOptimize = fctToOptimize ?? run;
+  %PrepareFunctionForOptimization(fctToOptimize);
+  for (let i = 0; i < 10; ++i) {
+    run();
+  }
+  %OptimizeFunctionOnNextCall(fctToOptimize);
+  run();
+  assertOptimized(fctToOptimize);
+}
+
+let wasm = (function createWasmModule() {
+  let builder = new WasmModuleBuilder();
+  let array = builder.addArray(kWasmI32, true);
+
+  builder.addFunction('createArray', makeSig([kWasmI32], [kWasmExternRef]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprArrayNewDefault, array,
+      kGCPrefix, kExprExternExternalize,
+    ])
+    .exportFunc();
+
+  builder.addFunction('arrayLen', makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCastNull, array,
+      kGCPrefix, kExprArrayLen,
+    ])
+    .exportFunc();
+
+  let instance = builder.instantiate({});
+  return instance.exports;
+})();
+
+(function TestNestedInlining() {
+  print(arguments.callee.name);
+
+  let array42 = wasm.createArray(42);
+
+  let testNested = (expected, array) => {
+    let fct = () => assertSame(expected, wasm.arrayLen(array));
+    %PrepareFunctionForOptimization(fct);
+    return fct();
+  };
+  // Compile and optimize wasm function inlined into JS (not trapping).
+  testOptimized(() => testNested(42, array42), testNested);
+  // Cause trap and JS error creation.
+  assertTraps(kTrapNullDereference, () => testNested(42, null));
+  assertOptimized(testNested);
+})();
+
+(function TestNestedInliningExtraArguments() {
+  print(arguments.callee.name);
+  let array42 = wasm.createArray(42);
+  // Compile and optimize wasm function inlined into JS (not trapping).
+  let testExtraArgs = (expected, array) => {
+    let fct = () => assertSame(expected, wasm.arrayLen(array));
+    %PrepareFunctionForOptimization(fct);
+    // fct doesn't take any arguments, so these are all "superfluous".
+    return fct(array, 1, undefined, {"test": "object"});
+  };
+  testOptimized(() => testExtraArgs(42, array42), testExtraArgs);
+  // Cause trap and JS error creation.
+  assertTraps(kTrapNullDereference, () => testExtraArgs(42, null));
+  assertOptimized(testExtraArgs);
+})();
+
+(function TestNestedInliningWithReceiverFromOuterScope() {
+  print(arguments.callee.name);
+  let array42 = wasm.createArray(42);
+  // Compile and optimize wasm function inlined into JS (not trapping).
+  let fct = (expected, array) => assertSame(expected, wasm.arrayLen(array));
+  %PrepareFunctionForOptimization(fct);
+  let obj = { fct };
+  let testReceiverOuter = (expected, array) => {
+    return obj.fct(expected, array);
+  };
+  testOptimized(() => testReceiverOuter(42, array42), testReceiverOuter);
+  // Cause trap and JS error creation.
+  assertTraps(kTrapNullDereference, () => testReceiverOuter(42, null));
+  assertOptimized(testReceiverOuter);
+})();
+
+(function TestNestedInliningWithReceiverAsInlineObject() {
+  print(arguments.callee.name);
+  let array42 = wasm.createArray(42);
+  // Compile and optimize wasm function inlined into JS (not trapping).
+  let testReceiverInner = (expected, array) => {
+    let fct = () => assertSame(expected, wasm.arrayLen(array));
+    %PrepareFunctionForOptimization(fct);
+    let obj = { fct };
+    return obj.fct();
+  };
+  testOptimized(() => testReceiverInner(42, array42), testReceiverInner);
+  // Cause trap and JS error creation.
+  assertTraps(kTrapNullDereference, () => testReceiverInner(42, null));
+  assertOptimized(testReceiverInner);
+})();
diff --git a/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-stacktrace-api.js b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-stacktrace-api.js
new file mode 100644
index 00000000000000..9339bfa143a87b
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-stacktrace-api.js
@@ -0,0 +1,164 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --experimental-wasm-gc --allow-natives-syntax --turbofan
+// Flags: --no-always-turbofan --no-always-sparkplug --expose-gc
+// Flags: --experimental-wasm-js-inlining
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+function testOptimized(run, fctToOptimize) {
+  fctToOptimize = fctToOptimize ?? run;
+  %PrepareFunctionForOptimization(fctToOptimize);
+  for (let i = 0; i < 10; ++i) {
+    run();
+  }
+  %OptimizeFunctionOnNextCall(fctToOptimize);
+  run();
+  // Re-prepare the function immediately to make sure type feedback isn't
+  // cleared by an untimely gc.
+  %PrepareFunctionForOptimization(fctToOptimize);
+  assertOptimized(fctToOptimize);
+}
+
+(function TestInliningTrapStackTrace() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+
+  builder.addFunction('createStruct', makeSig([kWasmI32], [kWasmExternRef]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprStructNew, struct,
+      kGCPrefix, kExprExternExternalize,
+    ])
+    .exportFunc();
+
+  builder.addFunction('getElement', makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCast, struct,
+      kGCPrefix, kExprStructGet, struct, 0])
+    .exportFunc();
+
+  let instance = builder.instantiate({});
+  let wasm = instance.exports;
+
+
+  const getTrap = () => {
+    return wasm.getElement(null);
+  };
+
+  Error.prepareStackTrace = (e, frames) => {
+    let frame = frames[0];
+    assertSame(instance, frame.getThis());
+    assertSame(null, frame.getTypeName());
+    assertSame(1, frame.getFunction());
+    assertEquals('getElement', frame.getFunctionName());
+    assertSame(null, frame.getMethodName());
+    assertMatches(/wasm:\/\/wasm\/[0-9a-f]+/,
+                 frame.getFileName());
+    assertEquals(0x53, frame.getColumnNumber());
+    assertSame(undefined, frame.getEvalOrigin());
+    assertFalse(frame.isToplevel());
+    assertFalse(frame.isEval());
+    assertFalse(frame.isNative());
+    assertFalse(frame.isConstructor());
+    assertFalse(frame.isAsync());
+    assertFalse(frame.isPromiseAll());
+    assertSame(null, frame.getPromiseIndex());
+
+    // Inspect the outer JS frame.
+    frame = frames[1];
+    assertSame(this, frame.getThis());
+    assertSame(null, frame.getTypeName());
+    assertSame(getTrap, frame.getFunction());
+    assertEquals(getTrap.name, frame.getFunctionName());
+    assertSame(null, frame.getMethodName());
+    assertMatches(/.*wasm-gc-inlining-stacktrace-api\.js/,
+                 frame.getFileName());
+    assertEquals(17, frame.getColumnNumber());
+    assertSame(undefined, frame.getEvalOrigin());
+    assertTrue(frame.isToplevel());
+    assertFalse(frame.isEval());
+    assertFalse(frame.isNative());
+    assertFalse(frame.isConstructor());
+    assertFalse(frame.isAsync());
+    assertFalse(frame.isPromiseAll());
+    assertSame(null, frame.getPromiseIndex());
+
+    // Return 'custom' stack trace.
+    return 'This is a stack trace';
+  };
+
+  const testTrap = () => {
+    try {
+      getTrap();
+      assertUnreachable();
+    } catch(e) {
+      assertEquals('This is a stack trace', e.stack);
+    }
+  };
+  testOptimized(testTrap, getTrap);
+
+  {
+    print('Test with wasm call within a try catch block');
+
+    // Note: At the moment of writing this test case, inlining of the wasm call
+    // is not yet supported. This test only ensures that supporting it in the
+    // future won't break the stack trace API behavior.
+    const getTrapTryCatch = () => {
+      try {
+        return wasm.getElement(null);
+      } catch (e) {
+        assertEquals('This is a stack trace', e.stack);
+      }
+    };
+
+    Error.prepareStackTrace = (e, frames) => {
+      let frame = frames[0];
+      assertSame(instance, frame.getThis());
+      assertSame(null, frame.getTypeName());
+      assertSame(1, frame.getFunction());
+      assertEquals('getElement', frame.getFunctionName());
+      assertSame(null, frame.getMethodName());
+      assertMatches(/wasm:\/\/wasm\/[0-9a-f]+/,
+                   frame.getFileName());
+      assertEquals(0x53, frame.getColumnNumber());
+      assertSame(undefined, frame.getEvalOrigin());
+      assertFalse(frame.isToplevel());
+      assertFalse(frame.isEval());
+      assertFalse(frame.isNative());
+      assertFalse(frame.isConstructor());
+      assertFalse(frame.isAsync());
+      assertFalse(frame.isPromiseAll());
+      assertSame(null, frame.getPromiseIndex());
+
+      // Inspect the outer JS frame.
+      frame = frames[1];
+      assertSame(this, frame.getThis());
+      assertSame(null, frame.getTypeName());
+      assertSame(getTrapTryCatch, frame.getFunction());
+      assertEquals(getTrapTryCatch.name, frame.getFunctionName());
+      assertSame(null, frame.getMethodName());
+      assertMatches(/.*wasm-gc-inlining-stacktrace-api\.js/,
+                   frame.getFileName());
+      assertEquals(21, frame.getColumnNumber());
+      assertSame(undefined, frame.getEvalOrigin());
+      assertTrue(frame.isToplevel());
+      assertFalse(frame.isEval());
+      assertFalse(frame.isNative());
+      assertFalse(frame.isConstructor());
+      assertFalse(frame.isAsync());
+      assertFalse(frame.isPromiseAll());
+      assertSame(null, frame.getPromiseIndex());
+
+      // Return 'custom' stack trace.
+      return 'This is a stack trace';
+    };
+
+    testOptimized(getTrapTryCatch);
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-typeguard.js b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-typeguard.js
new file mode 100644
index 00000000000000..cf2d541a3b155b
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining-typeguard.js
@@ -0,0 +1,30 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --allow-natives-syntax --experimental-wasm-gc
+// Flags: --experimental-wasm-js-inlining
+
+d8.file.execute("test/mjsunit/wasm/wasm-module-builder.js");
+
+// Create a dummy wasm function that only passes a value. This will however
+// trigger the wasm inlining and run the TurboFan wasm optimization passes on
+// the JS function.
+let builder = new WasmModuleBuilder();
+builder.addFunction('passThrough', makeSig([kWasmExternRef], [kWasmExternRef]))
+  .addBody([kExprLocalGet, 0])
+  .exportFunc();
+let instance = builder.instantiate({});
+let wasm = instance.exports;
+
+// The graph for foo contains a TypeGuard not simply guarding a type but an
+// integer range.
+(function TestUntypedTypeGuard() {
+  function foo(a, o) {
+    return wasm.passThrough(a.find(x => x === o.x));
+  }
+  %PrepareFunctionForOptimization(foo);
+  assertEquals(3, foo([1, 2, 3], {x:3}));
+  %OptimizeFunctionOnNextCall(foo);
+  assertEquals(3, foo([1, 2, 3], {x:3}));
+})();
diff --git a/deps/v8/test/mjsunit/wasm/wasm-gc-inlining.js b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining.js
index d8ec0e0f88e072..46331d260f7947 100644
--- a/deps/v8/test/mjsunit/wasm/wasm-gc-inlining.js
+++ b/deps/v8/test/mjsunit/wasm/wasm-gc-inlining.js
@@ -32,7 +32,7 @@ function testOptimized(run, fctToOptimize) {
     ])
     .exportFunc();
 
-  builder.addFunction('getElementNull', makeSig([kWasmExternRef], [kWasmI32]))
+  builder.addFunction('getFieldNull', makeSig([kWasmExternRef], [kWasmI32]))
     .addBody([
       kExprLocalGet, 0,
       kGCPrefix, kExprExternInternalize,
@@ -49,7 +49,7 @@ function testOptimized(run, fctToOptimize) {
     ])
     .exportFunc();
 
-  builder.addFunction('getElement',
+  builder.addFunction('getField',
                       makeSig([wasmRefType(kWasmExternRef)], [kWasmI32]))
     .addBody([
       kExprLocalGet, 0,
@@ -64,8 +64,8 @@ function testOptimized(run, fctToOptimize) {
   // TODO(mliedtke): Consider splitting this loop as the reuse seems to prevent
   // proper feedback for the second iteration.
   for (let [create, get] of [
-      [wasm.createStruct, wasm.getElement],
-      [wasm.createStructNull, wasm.getElementNull]]) {
+      [wasm.createStruct, wasm.getField],
+      [wasm.createStructNull, wasm.getFieldNull]]) {
     let fct = () => {
       for (let i = 1; i <= 10; ++i) {
         const struct = create(i);
@@ -80,7 +80,9 @@ function testOptimized(run, fctToOptimize) {
     const trap = kTrapIllegalCast;
     print("- test get null");
     const getNull = () => get(null);
-    testOptimized(() => assertTraps(trap, getNull), getNull);
+    // If the null check is done by the wrapper, it throws a TypeError.
+    // Otherwise it's a RuntimeError for the wasm trap.
+    testOptimized(() => assertThrows(getNull), getNull);
     print("- test undefined");
     const getUndefined = () => get(undefined);
     testOptimized(() => assertTraps(trap, getUndefined), getUndefined);
@@ -98,12 +100,13 @@ function testOptimized(run, fctToOptimize) {
     testOptimized(() => assertTraps(trap, getLargeNumber), getLargeNumber);
 
     print("- test inlining into try block");
-    // TODO(7748): This is currently not supported by inlining yet.
+    // TODO(14034): This is currently not supported by inlining yet.
     const getTry = () => {
       try {
         get(null);
       } catch (e) {
-        assertTrue(e instanceof WebAssembly.RuntimeError);
+        assertTrue(e instanceof WebAssembly.RuntimeError ||
+                   e instanceof TypeError);
         return;
       }
       assertUnreachable();
@@ -112,7 +115,7 @@ function testOptimized(run, fctToOptimize) {
   }
 })();
 
-(function TestInliningStructGetElementTypes() {
+(function TestInliningStructgetFieldTypes() {
   print(arguments.callee.name);
   const i64Value = Number.MAX_SAFE_INTEGER;
   const f64Value = 11.1;
@@ -158,7 +161,6 @@ function testOptimized(run, fctToOptimize) {
       kExprLocalGet, 0,
       kGCPrefix, kExprExternInternalize,
       kGCPrefix, kExprRefCast, struct,
-      // TODO(7748): Currently struct.get_s / struct.get_u does not get inlined.
       kGCPrefix, kExprStructGetS, struct, 2,
     ])
     .exportFunc();
@@ -167,7 +169,6 @@ function testOptimized(run, fctToOptimize) {
       kExprLocalGet, 0,
       kGCPrefix, kExprExternInternalize,
       kGCPrefix, kExprRefCast, struct,
-      // TODO(7748): Currently struct.get_s / struct.get_u does not get inlined.
       kGCPrefix, kExprStructGetU, struct, 3,
     ])
     .exportFunc();
@@ -239,47 +240,6 @@ function testOptimized(run, fctToOptimize) {
                 multiModuleTrap);
 })();
 
-(function TestInliningTrapStackTrace() {
-  print(arguments.callee.name);
-  let builder = new WasmModuleBuilder();
-  let struct = builder.addStruct([makeField(kWasmI32, true)]);
-
-  builder.addFunction('createStruct', makeSig([kWasmI32], [kWasmExternRef]))
-    .addBody([
-      kExprLocalGet, 0,
-      kGCPrefix, kExprStructNew, struct,
-      kGCPrefix, kExprExternExternalize,
-    ])
-    .exportFunc();
-
-  builder.addFunction('getElement', makeSig([kWasmExternRef], [kWasmI32]))
-    .addBody([
-      kExprLocalGet, 0,
-      kGCPrefix, kExprExternInternalize,
-      kGCPrefix, kExprRefCast, struct,
-      kGCPrefix, kExprStructGet, struct, 0])
-    .exportFunc();
-
-  let instance = builder.instantiate({});
-  let wasm = instance.exports;
-
-  const getTrap = () => wasm.getElement(null);
-  const testTrap = () => {
-    try {
-      getTrap();
-      assertUnreachable();
-    } catch(e) {
-      // TODO(7748): The stack trace should always contain the wasm frame, even
-      // if it was inlined. The regex should be:
-      //   /illegal cast[\s]+at getElement \(wasm:/
-      // For now we assert that the stack trace isn't fully broken and contains
-      // at least the `getTrap()` call above.
-      assertMatches(/illegal cast[\s]+at [.\s\S]*getTrap/, e.stack);
-    }
-  };
-  testOptimized(testTrap, getTrap);
-})();
-
 (function TestInliningExternExternalize() {
   print(arguments.callee.name);
   let builder = new WasmModuleBuilder();
@@ -637,3 +597,86 @@ function testOptimized(run, fctToOptimize) {
     () => assertTraps(kTrapNullDereference, () => writeAndRead(null, 0n),
     writeAndRead));
 })();
+
+function testStackTrace(error, expected) {
+  try {
+    let stack = error.stack.split("\n");
+    assertTrue(stack.length >= expected.length);
+    for (let i = 0; i < expected.length; ++i) {
+      assertMatches(expected[i], stack[i]);
+    }
+  } catch(failure) {
+    print("Actual stack trace: ", error.stack);
+    throw failure;
+  }
+}
+
+(function TestInliningTrapStackTrace() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+
+  builder.addFunction('createStruct', makeSig([kWasmI32], [kWasmExternRef]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprStructNew, struct,
+      kGCPrefix, kExprExternExternalize,
+    ])
+    .exportFunc();
+
+  builder.addFunction('getField', makeSig([kWasmExternRef], [kWasmI32]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCast, struct,
+      kGCPrefix, kExprStructGet, struct, 0])
+    .exportFunc();
+
+  let instance = builder.instantiate({});
+  let wasm = instance.exports;
+
+  { // Test simple case.
+    const getTrap = () => {
+      return wasm.getField(null);
+    };
+
+    const testTrap = () => {
+      try {
+        getTrap();
+        assertUnreachable();
+      } catch(e) {
+        testStackTrace(e, [
+          /RuntimeError: illegal cast/,
+          /at getField \(wasm:\/\/wasm\/[0-9a-f]+:wasm-function\[1\]:0x50/,
+          /at getTrap .*\.js:640:19/,
+        ]);
+      }
+    };
+    testOptimized(testTrap, getTrap);
+  }
+
+  { // Test wasm inlined into JS inlined into JS.
+    const getTrapNested = (obj) => {
+      %PrepareFunctionForOptimization(inlined);
+      return inlined();
+      function inlined() { return wasm.getField(obj); };
+    };
+
+    let wasmStruct = wasm.createStruct(42);
+    // Warmup without exception. This seems to help inlining the JS function.
+    testOptimized(() => assertEquals(42, getTrapNested(wasmStruct)),
+                  getTrapNested);
+    try {
+      getTrapNested(null);
+      assertUnreachable();
+    } catch(e) {
+      testStackTrace(e, [
+        /RuntimeError: illegal cast/,
+        /at getField \(wasm:\/\/wasm\/[0-9a-f]+:wasm-function\[1\]:0x50/,
+        /at inlined .*\.js:662:40/,
+        /at getTrapNested .*\.js:661:14/,
+      ]);
+      assertOptimized(getTrapNested);
+    }
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/wasm-gc-source-location.js b/deps/v8/test/mjsunit/wasm/wasm-gc-source-location.js
index 3638612180c088..da3a260b35e487 100644
--- a/deps/v8/test/mjsunit/wasm/wasm-gc-source-location.js
+++ b/deps/v8/test/mjsunit/wasm/wasm-gc-source-location.js
@@ -89,3 +89,77 @@ function TestStackTrace(testFct, trap, expected) {
 
   TestStackTrace(() => wasm.structGet(null), kTrapNullDereference, '0x35');
 })();
+
+(function CodeLocationRefCastUnrelated() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let structA = builder.addStruct([makeField(kWasmI64, true)]);
+  let structB = builder.addStruct([makeField(kWasmI32, true)]);
+
+  builder.addFunction('createStructA', makeSig([kWasmI64], [kWasmExternRef]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprStructNew, structA,
+      kGCPrefix, kExprExternExternalize,
+    ])
+    .exportFunc();
+
+  builder.addFunction('structGet', makeSig([kWasmExternRef], [kWasmI32]))
+    .addLocals(kWasmAnyRef, 1)
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCastNull, structA,
+      // Convert static type to anyref.
+      kExprLocalSet, 1, kExprLocalGet, 1,
+      // The following cast can be optimized into "trap if not null".
+      kGCPrefix, kExprRefCastNull, structB,
+      // The struct.get is only reachable for null; it will always trap with
+      // kNullDereference if reached.
+      kGCPrefix, kExprStructGet, structB, 0,
+    ])
+    .exportFunc();
+
+  let instance = builder.instantiate({});
+  let wasm = instance.exports;
+
+  TestStackTrace(() => wasm.structGet(null), kTrapNullDereference, '0x64');
+  let a = wasm.createStructA(123n);
+  TestStackTrace(() => wasm.structGet(a), kTrapIllegalCast, '0x61');
+  assertTraps(kTrapIllegalCast, () => wasm.structGet(a));
+})();
+
+(function CodeLocationRefCastSucceedsIfNotNull() {
+  print(arguments.callee.name);
+  let builder = new WasmModuleBuilder();
+  let struct = builder.addStruct([makeField(kWasmI32, true)]);
+
+  builder.addFunction('createStruct', makeSig([kWasmI32], [kWasmExternRef]))
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprStructNew, struct,
+      kGCPrefix, kExprExternExternalize,
+    ])
+    .exportFunc();
+
+  builder.addFunction('structGet', makeSig([kWasmExternRef], [kWasmI32]))
+    .addLocals(kWasmAnyRef, 1)
+    .addBody([
+      kExprLocalGet, 0,
+      kGCPrefix, kExprExternInternalize,
+      kGCPrefix, kExprRefCastNull, struct,
+      // Convert static type to anyref.
+      kExprLocalSet, 1, kExprLocalGet, 1,
+      // The following cast can be optimized into "trap if null".
+      kGCPrefix, kExprRefCast, struct,
+      kGCPrefix, kExprStructGet, struct, 0,
+    ])
+    .exportFunc();
+
+  let instance = builder.instantiate({});
+  let wasm = instance.exports;
+
+  let wasmStruct = wasm.createStruct(123);
+  assertEquals(123, wasm.structGet(wasmStruct));
+  TestStackTrace(() => wasm.structGet(null), kTrapIllegalCast, '0x5a');
+})();
diff --git a/deps/v8/test/mjsunit/wasm/wasm-module-builder.js b/deps/v8/test/mjsunit/wasm/wasm-module-builder.js
index 5a19284c701fd1..4797c41fa8e100 100644
--- a/deps/v8/test/mjsunit/wasm/wasm-module-builder.js
+++ b/deps/v8/test/mjsunit/wasm/wasm-module-builder.js
@@ -197,6 +197,7 @@ let kSig_v_ii = makeSig([kWasmI32, kWasmI32], []);
 let kSig_v_iii = makeSig([kWasmI32, kWasmI32, kWasmI32], []);
 let kSig_v_l = makeSig([kWasmI64], []);
 let kSig_v_li = makeSig([kWasmI64, kWasmI32], []);
+let kSig_v_lii = makeSig([kWasmI64, kWasmI32, kWasmI32], []);
 let kSig_v_d = makeSig([kWasmF64], []);
 let kSig_v_dd = makeSig([kWasmF64, kWasmF64], []);
 let kSig_v_ddi = makeSig([kWasmF64, kWasmF64, kWasmI32], []);
@@ -276,6 +277,7 @@ const kWasmOpcodes = {
   'ReturnCallIndirect': 0x13,
   'CallRef': 0x14,
   'ReturnCallRef': 0x15,
+  'NopForTestingUnsupportedInLiftoff': 0x16,
   'Delegate': 0x18,
   'Drop': 0x1a,
   'Select': 0x1b,
@@ -507,6 +509,8 @@ let kExprArrayNew = 0x1b;
 let kExprArrayNewDefault = 0x1c;
 let kExprArrayNewData = 0x1d;
 let kExprArrayNewElem = 0x1f;
+let kExprArrayInitData = 0x54;
+let kExprArrayInitElem = 0x55;
 let kExprArrayFill = 0x0f;
 let kExprI31New = 0x20;
 let kExprI31GetS = 0x21;
@@ -522,6 +526,8 @@ let kExprBrOnCastNull = 0x4a;
 let kExprBrOnCastDeprecated = 0x46;
 let kExprBrOnCastFail = 0x43;
 let kExprBrOnCastFailNull = 0x4b;
+let kExprBrOnCastGeneric = 0x4e;
+let kExprBrOnCastFailGeneric = 0x4f;
 let kExprRefCastNop = 0x4c;
 let kExprRefIsData = 0x51;
 let kExprRefIsI31 = 0x52;
@@ -910,6 +916,28 @@ let kExprI32x4TruncSatF64x2UZero = 0xfd;
 let kExprF64x2ConvertLowI32x4S = 0xfe;
 let kExprF64x2ConvertLowI32x4U = 0xff;
 
+// Relaxed SIMD.
+let kExprI8x16RelaxedSwizzle = wasmSignedLeb(0x100);
+let kExprI32x4RelaxedTruncF32x4S = wasmSignedLeb(0x101);
+let kExprI32x4RelaxedTruncF32x4U = wasmSignedLeb(0x102);
+let kExprI32x4RelaxedTruncF64x2SZero = wasmSignedLeb(0x103);
+let kExprI32x4RelaxedTruncF64x2UZero = wasmSignedLeb(0x104);
+let kExprF32x4Qfma = wasmSignedLeb(0x105);
+let kExprF32x4Qfms = wasmSignedLeb(0x106);
+let kExprF64x2Qfma = wasmSignedLeb(0x107);
+let kExprF64x2Qfms = wasmSignedLeb(0x108);
+let kExprI8x16RelaxedLaneSelect = wasmSignedLeb(0x109);
+let kExprI16x8RelaxedLaneSelect = wasmSignedLeb(0x10a);
+let kExprI32x4RelaxedLaneSelect = wasmSignedLeb(0x10b);
+let kExprI64x2RelaxedLaneSelect = wasmSignedLeb(0x10c);
+let kExprF32x4RelaxedMin = wasmSignedLeb(0x10d);
+let kExprF32x4RelaxedMax = wasmSignedLeb(0x10e);
+let kExprF64x2RelaxedMin = wasmSignedLeb(0x10f);
+let kExprF64x2RelaxedMax = wasmSignedLeb(0x110);
+let kExprI16x8RelaxedQ15MulRS = wasmSignedLeb(0x111);
+let kExprI16x8DotI8x16I7x16S = wasmSignedLeb(0x112);
+let kExprI32x4DotI8x16I7x16AddS = wasmSignedLeb(0x113);
+
 // Compilation hint constants.
 let kCompilationHintStrategyDefault = 0x00;
 let kCompilationHintStrategyLazy = 0x01;
@@ -936,6 +964,10 @@ let kTrapArrayOutOfBounds = 13;
 let kTrapNullDereference = 14;
 let kTrapIllegalCast = 15;
 
+let kAtomicWaitOk = 0;
+let kAtomicWaitNotEqual = 1;
+let kAtomicWaitTimedOut = 2;
+
 let kTrapMsgs = [
   'unreachable',                                    // --
   'memory access out of bounds',                    // --
@@ -1279,6 +1311,7 @@ class WasmModuleBuilder {
     this.globals = [];
     this.tables = [];
     this.tags = [];
+    this.memories = [];
     this.functions = [];
     this.compilation_hints = [];
     this.element_segments = [];
@@ -1297,26 +1330,26 @@ class WasmModuleBuilder {
     return this;
   }
 
-  addMemory(min, max, exported, shared) {
-    this.memory = {
-      min: min,
-      max: max,
-      exported: exported,
-      shared: shared || false,
-      is_memory64: false
-    };
-    return this;
+  addMemory(min, max, shared) {
+    // Note: All imported memories are added before declared ones (see the check
+    // in {addImportedMemory}).
+    const imported_memories =
+        this.imports.filter(i => i.kind == kExternalMemory).length;
+    const mem_index = imported_memories + this.memories.length;
+    this.memories.push(
+        {min: min, max: max, shared: shared || false, is_memory64: false});
+    return mem_index;
   }
 
-  addMemory64(min, max, exported, shared) {
-    this.memory = {
-      min: min,
-      max: max,
-      exported: exported,
-      shared: shared || false,
-      is_memory64: true
-    };
-    return this;
+  addMemory64(min, max, shared) {
+    // Note: All imported memories are added before declared ones (see the check
+    // in {addImportedMemory}).
+    const imported_memories =
+        this.imports.filter(i => i.kind == kExternalMemory).length;
+    const mem_index = imported_memories + this.memories.length;
+    this.memories.push(
+        {min: min, max: max, shared: shared || false, is_memory64: true});
+    return mem_index;
   }
 
   addExplicitSection(bytes) {
@@ -1468,6 +1501,12 @@ class WasmModuleBuilder {
   }
 
   addImportedMemory(module, name, initial = 0, maximum, shared, is_memory64) {
+    if (this.memories.length !== 0) {
+      throw new Error(
+          'Add imported memories before declared memories to avoid messing ' +
+          'up the indexes');
+    }
+    let mem_index = this.imports.filter(i => i.kind == kExternalMemory).length;
     let o = {
       module: module,
       name: name,
@@ -1478,7 +1517,7 @@ class WasmModuleBuilder {
       is_memory64: !!is_memory64
     };
     this.imports.push(o);
-    return this;
+    return mem_index;
   }
 
   addImportedTable(module, name, initial, maximum, type) {
@@ -1539,9 +1578,15 @@ class WasmModuleBuilder {
     return this;
   }
 
-  addDataSegment(addr, data, is_global = false) {
-    this.data_segments.push(
-        {addr: addr, data: data, is_global: is_global, is_active: true});
+  // TODO(manoskouk): Refactor this to use initializer expression for {offset}.
+  addDataSegment(offset, data, is_global = false, memory_index = 0) {
+    this.data_segments.push({
+      offset: offset,
+      data: data,
+      is_global: is_global,
+      is_active: true,
+      mem_index: memory_index
+    });
     return this.data_segments.length - 1;
   }
 
@@ -1550,8 +1595,18 @@ class WasmModuleBuilder {
     return this.data_segments.length - 1;
   }
 
-  exportMemoryAs(name) {
-    this.exports.push({name: name, kind: kExternalMemory, index: 0});
+  exportMemoryAs(name, memory_index) {
+    if (memory_index === undefined) {
+      const num_memories = this.memories.length +
+          this.imports.filter(i => i.kind == kExternalMemory).length;
+      if (num_memories !== 1) {
+        throw new Error(
+            'Pass memory index to \'exportMemoryAs\' if there is not exactly ' +
+            'one memory imported or declared.');
+      }
+      memory_index = 0;
+    }
+    this.exports.push({name: name, kind: kExternalMemory, index: memory_index});
   }
 
   // {offset} is a constant expression.
@@ -1640,10 +1695,10 @@ class WasmModuleBuilder {
     let binary = new Binary;
     let wasm = this;
 
-    // Add header
+    // Add header.
     binary.emit_header();
 
-    // Add type section
+    // Add type section.
     if (wasm.types.length > 0) {
       if (debug) print('emitting types @ ' + binary.length);
       binary.emit_section(kTypeSectionCode, section => {
@@ -1740,7 +1795,7 @@ class WasmModuleBuilder {
       });
     }
 
-    // Add functions declarations
+    // Add functions declarations.
     if (wasm.functions.length > 0) {
       if (debug) print('emitting function decls @ ' + binary.length);
       binary.emit_section(kFunctionSectionCode, section => {
@@ -1751,13 +1806,16 @@ class WasmModuleBuilder {
       });
     }
 
-    // Add table section
+    // Add table section.
     if (wasm.tables.length > 0) {
       if (debug) print('emitting tables @ ' + binary.length);
       binary.emit_section(kTableSectionCode, section => {
         section.emit_u32v(wasm.tables.length);
         for (let table of wasm.tables) {
-          if (table.has_init) section.emit_u8(0x40);
+          if (table.has_init) {
+            section.emit_u8(0x40);  // "has initializer"
+            section.emit_u8(0x00);  // Reserved byte.
+          }
           section.emit_type(table.type);
           section.emit_u8(table.has_max);
           section.emit_u32v(table.initial_size);
@@ -1767,21 +1825,23 @@ class WasmModuleBuilder {
       });
     }
 
-    // Add memory section
-    if (wasm.memory !== undefined) {
-      if (debug) print('emitting memory @ ' + binary.length);
+    // Add memory section.
+    if (wasm.memories.length > 0) {
+      if (debug) print('emitting memories @ ' + binary.length);
       binary.emit_section(kMemorySectionCode, section => {
-        section.emit_u8(1);  // one memory entry
-        const has_max = wasm.memory.max !== undefined;
-        const is_shared = !!wasm.memory.shared;
-        const is_memory64 = !!wasm.memory.is_memory64;
-        let limits_byte =
-            (is_memory64 ? 4 : 0) | (is_shared ? 2 : 0) | (has_max ? 1 : 0);
-        section.emit_u8(limits_byte);
-        let emit = val =>
-            is_memory64 ? section.emit_u64v(val) : section.emit_u32v(val);
-        emit(wasm.memory.min);
-        if (has_max) emit(wasm.memory.max);
+        section.emit_u32v(wasm.memories.length);
+        for (let memory of wasm.memories) {
+          const has_max = memory.max !== undefined;
+          const is_shared = !!memory.shared;
+          const is_memory64 = !!memory.is_memory64;
+          let limits_byte =
+              (is_memory64 ? 4 : 0) | (is_shared ? 2 : 0) | (has_max ? 1 : 0);
+          section.emit_u8(limits_byte);
+          let emit = val =>
+              is_memory64 ? section.emit_u64v(val) : section.emit_u32v(val);
+          emit(memory.min);
+          if (has_max) emit(memory.max);
+        }
       });
     }
 
@@ -1823,8 +1883,7 @@ class WasmModuleBuilder {
     }
 
     // Add export table.
-    var mem_export = (wasm.memory !== undefined && wasm.memory.exported);
-    var exports_count = wasm.exports.length + (mem_export ? 1 : 0);
+    var exports_count = wasm.exports.length;
     if (exports_count > 0) {
       if (debug) print('emitting exports @ ' + binary.length);
       binary.emit_section(kExportSectionCode, section => {
@@ -1834,11 +1893,6 @@ class WasmModuleBuilder {
           section.emit_u8(exp.kind);
           section.emit_u32v(exp.index);
         }
-        if (mem_export) {
-          section.emit_string('memory');
-          section.emit_u8(kExternalMemory);
-          section.emit_u8(0);
-        }
       });
     }
 
@@ -1850,7 +1904,7 @@ class WasmModuleBuilder {
       });
     }
 
-    // Add element segments
+    // Add element segments.
     if (wasm.element_segments.length > 0) {
       if (debug) print('emitting element segments @ ' + binary.length);
       binary.emit_section(kElementSectionCode, section => {
@@ -1999,18 +2053,23 @@ class WasmModuleBuilder {
         section.emit_u32v(wasm.data_segments.length);
         for (let seg of wasm.data_segments) {
           if (seg.is_active) {
-            section.emit_u8(0);  // linear memory index 0 / flags
+            if (seg.mem_index == 0) {
+              section.emit_u8(kActiveNoIndex);
+            } else {
+              section.emit_u8(kActiveWithIndex);
+              section.emit_u32v(seg.mem_index);
+            }
             if (seg.is_global) {
-              // Initializer is a global variable.
+              // Offset is taken from a global.
               section.emit_u8(kExprGlobalGet);
-              section.emit_u32v(seg.addr);
+              section.emit_u32v(seg.offset);
             } else {
-              // Initializer is a constant.
-              section.emit_bytes(wasmI32Const(seg.addr));
+              // Offset is a constant.
+              section.emit_bytes(wasmI32Const(seg.offset));
             }
             section.emit_u8(kExprEnd);
           } else {
-            section.emit_u8(kPassive);  // flags
+            section.emit_u8(kPassive);
           }
           section.emit_u32v(seg.data.length);
           section.emit_bytes(seg.data);
@@ -2101,6 +2160,7 @@ class WasmModuleBuilder {
 }
 
 function wasmSignedLeb(val, max_len = 5) {
+  if (val == null) throw new Error("Leb value many not be null/undefined");
   let res = [];
   for (let i = 0; i < max_len; ++i) {
     let v = val & 0x7f;
@@ -2116,7 +2176,8 @@ function wasmSignedLeb(val, max_len = 5) {
       'Leb value <' + val + '> exceeds maximum length of ' + max_len);
 }
 
-function wasmSignedLeb64(val, max_len) {
+function wasmSignedLeb64(val, max_len = 10) {
+  if (val == null) throw new Error("Leb value many not be null/undefined");
   if (typeof val != "bigint") {
     if (val < Math.pow(2, 31)) {
       return wasmSignedLeb(val, max_len);
@@ -2139,6 +2200,7 @@ function wasmSignedLeb64(val, max_len) {
 }
 
 function wasmUnsignedLeb(val, max_len = 5) {
+  if (val == null) throw new Error("Leb value many not be null/undefined");
   let res = [];
   for (let i = 0; i < max_len; ++i) {
     let v = val & 0x7f;
@@ -2204,6 +2266,26 @@ function wasmS128Const(f) {
   return result;
 }
 
+let [wasmBrOnCast, wasmBrOnCastFail] = (function() {
+  return [
+    (labelIdx, sourceType, targetType) =>
+      wasmBrOnCastImpl(labelIdx, sourceType, targetType, false),
+      (labelIdx, sourceType, targetType) =>
+      wasmBrOnCastImpl(labelIdx, sourceType, targetType, true),
+  ];
+  function wasmBrOnCastImpl(labelIdx, sourceType, targetType, brOnFail) {
+    labelIdx = wasmUnsignedLeb(labelIdx, kMaxVarInt32Size);
+    let srcHeap = wasmSignedLeb(sourceType.heap_type, kMaxVarInt32Size);
+    let tgtHeap = wasmSignedLeb(targetType.heap_type, kMaxVarInt32Size);
+    let srcIsNullable = sourceType.opcode == kWasmRefNull;
+    let tgtIsNullable = targetType.opcode == kWasmRefNull;
+    flags = (tgtIsNullable << 1) + srcIsNullable;
+    return [
+      kGCPrefix, brOnFail ? kExprBrOnCastFailGeneric : kExprBrOnCastGeneric,
+      flags, ...labelIdx, ...srcHeap, ...tgtHeap];
+  }
+})();
+
 function getOpcodeName(opcode) {
   return globalThis.kWasmOpcodeNames?.[opcode] ?? 'unknown';
 }
diff --git a/deps/v8/test/mjsunit/wasm/wasm-to-js-tierup.js b/deps/v8/test/mjsunit/wasm/wasm-to-js-tierup.js
new file mode 100644
index 00000000000000..59eb5999f2cfff
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/wasm-to-js-tierup.js
@@ -0,0 +1,674 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --wasm-to-js-generic-wrapper --wasm-staging --experimental-wasm-type-reflection
+// Flags: --wasm-wrapper-tiering-budget=1 --allow-natives-syntax
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const kNormal = 0;
+const kGetAndCall = 1;
+
+function GetJSFunction(numParams) {
+  return () => 15;
+}
+
+function GetWasmJSFunction(numParams) {
+  return new WebAssembly.Function(
+      {parameters: new Array(numParams).fill('i32'), results: []},
+      () => 12);
+}
+
+function GetReExportedJSFunction(numParams) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const impIndex = builder.addImport('m', 'foo', sig);
+  builder.addExport("foo", impIndex);
+  return builder.instantiate(
+      {'m': {'foo': GetJSFunction(numParams)}}).exports.foo;
+}
+
+function GetReExportedWasmJSFunction(numParams) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const impIndex = builder.addImport('m', 'foo', sig);
+  builder.addExport("foo", impIndex);
+  return builder.instantiate(
+      {'m': {'foo': GetWasmJSFunction(numParams)}}).exports.foo;
+}
+
+function AssertWrapperTierup(instance) {
+  if (instance.exports.get) {
+    assertTrue(%HasUnoptimizedWasmToJSWrapper(instance.exports.get()));
+    instance.exports.main();
+    assertTrue(!%HasUnoptimizedWasmToJSWrapper(instance.exports.get()));
+    instance.exports.main();
+  } else {
+    const countBefore = %CountUnoptimizedWasmToJSWrapper(instance);
+    instance.exports.main();
+    const countAfter = %CountUnoptimizedWasmToJSWrapper(instance);
+    assertTrue(countBefore > countAfter);
+    instance.exports.main();
+  }
+}
+
+function TestImportedFunction(numParams, jsFunc, mode) {
+  if (mode != kNormal) return;
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const impIndex = builder.addImport('m', 'foo', sig);
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  body.push(kExprCallFunction, impIndex);
+
+  builder.addFunction('main', sig)
+    .addBody(body)
+    .exportFunc();
+
+  const instance = builder.instantiate({ 'm': { 'foo': jsFunc } });
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectElementSection(numParams, jsFunc, mode) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+  const impIndex = builder.addImport('m', 'foo', sigId);
+
+  const table = builder.addTable(kWasmAnyFunc, 10).index;
+  builder.addActiveElementSegment(table, wasmI32Const(0), [impIndex]);
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  const instance = builder.instantiate({ 'm': { 'foo': jsFunc } });
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectJSTableImport(numParams, jsFunc, mode) {
+  if (!(jsFunc instanceof WebAssembly.Function)) {
+    return;
+  }
+
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+  const impIndex = builder.addImportedTable('m', 'table', 10, 10, kWasmAnyFunc);
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, impIndex);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, impIndex,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, impIndex])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  const table = new WebAssembly.Table({
+    element: "anyfunc",
+    initial: 10,
+    maximum: 10
+  });
+
+  table.set(0, jsFunc);
+
+  const instance = builder.instantiate({ 'm': { 'table': table } });
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectWasmTableImport(numParams, jsFunc, mode) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+  const impIndex = builder.addImportedTable('m', 'table', 10, 10, kWasmAnyFunc);
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, impIndex);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, impIndex,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, impIndex])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  let table;
+  {
+    const table_module_builder = new WasmModuleBuilder();
+    const sigId = table_module_builder.addType(sig);
+    const impIndex = table_module_builder.addImport('m', 'foo', sigId);
+
+    const tableId =
+        table_module_builder.addTable(kWasmAnyFunc, 10, 10).exportAs('table').index;
+    table_module_builder.addActiveElementSegment(
+        tableId, wasmI32Const(0), [impIndex]);
+
+    table =
+        table_module_builder.instantiate({'m': {'foo': jsFunc}}).exports.table;
+  }
+
+  const instance = builder.instantiate({ 'm': { 'table': table } });
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectTableSetInJS(numParams, jsFunc, mode) {
+  if (!(jsFunc instanceof WebAssembly.Function)) {
+    return;
+  }
+
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+
+  const table = builder.addTable(kWasmAnyFunc, 10).exportAs('table').index;
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  const instance = builder.instantiate();
+
+  instance.exports.table.set(0, jsFunc);
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectTableSetFromParam(numParams, jsFunc, mode) {
+  if (!(jsFunc instanceof WebAssembly.Function)) {
+    return;
+  }
+
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+
+  const table = builder.addTable(kWasmAnyFunc, 10).index;
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+  builder.addFunction('set', kSig_v_a)
+      .addBody([kExprI32Const, 0, kExprLocalGet, 0, kExprTableSet, table])
+      .exportFunc();
+
+  const instance = builder.instantiate();
+
+  instance.exports.set(jsFunc);
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectTableSetFromTableGet(numParams, jsFunc, mode) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+  const impIndex = builder.addImport('m', 'foo', sigId);
+
+  const table = builder.addTable(kWasmAnyFunc, 10).index;
+  builder.addActiveElementSegment(
+        table, wasmI32Const(1), [impIndex]);
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+  builder.addFunction('set', kSig_v_v)
+      .addBody([
+        kExprI32Const, 0, // index of table.set
+        ...[kExprI32Const, 1, kExprTableGet, table],
+        kExprTableSet, table
+      ])
+      .exportFunc();
+
+  const instance = builder.instantiate({ 'm': { 'foo': jsFunc } });
+
+  instance.exports.set();
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectTableSetFromFuncRef(numParams, jsFunc, mode) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+  const impIndex = builder.addImport('m', 'foo', sigId);
+  builder.addDeclarativeElementSegment([impIndex]);
+
+  const table = builder.addTable(kWasmAnyFunc, 10).index;
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+  builder.addFunction('set', kSig_v_v)
+      .addBody([
+        kExprI32Const, 0,  // index of table.set
+        kExprRefFunc, impIndex, kExprTableSet, table
+      ])
+      .exportFunc();
+
+  const instance = builder.instantiate({ 'm': { 'foo': jsFunc } });
+
+  instance.exports.set();
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectTableSetFromParamInOtherInstance(numParams, jsFunc, mode) {
+  if (!(jsFunc instanceof WebAssembly.Function)) {
+    return;
+  }
+
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+
+  let table = builder.addTable(kWasmAnyFunc, 10, 10).exportAs('table').index;
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  const setBuilder = new WasmModuleBuilder();
+  table = setBuilder.addImportedTable('m', 'table', 10, 10, kWasmAnyFunc);
+  setBuilder.addFunction('set', kSig_v_a)
+      .addBody([kExprI32Const, 0, kExprLocalGet, 0, kExprTableSet, table])
+      .exportFunc();
+
+  const instance = builder.instantiate();
+
+  const setInstance =
+      setBuilder.instantiate({'m': {'table': instance.exports.table}});
+  setInstance.exports.set(jsFunc);
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectTableSetFromTableGetInOtherInstance(
+    numParams, jsFunc, mode) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+  const impIndex = builder.addImport('m', 'foo', sigId);
+
+  let table = builder.addTable(kWasmAnyFunc, 10, 10).exportAs('table').index;
+  builder.addActiveElementSegment(
+        table, wasmI32Const(1), [impIndex]);
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  const setBuilder = new WasmModuleBuilder();
+  table = setBuilder.addImportedTable('m', 'table', 10, 10, kWasmAnyFunc);
+  setBuilder.addFunction('set', kSig_v_v)
+      .addBody([
+        kExprI32Const, 0, // index of table.set
+        ...[kExprI32Const, 1, kExprTableGet, table],
+        kExprTableSet, table
+      ])
+      .exportFunc();
+
+  const instance = builder.instantiate({ 'm': { 'foo': jsFunc } });
+
+  const setInstance =
+      setBuilder.instantiate({'m': {'table': instance.exports.table}});
+  setInstance.exports.set(jsFunc);
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectTableSetFromTableGetInOtherInstance2(
+    numParams, jsFunc, mode) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  let sigId = builder.addType(sig);
+
+  let table = builder.addTable(kWasmAnyFunc, 10, 10).exportAs('table').index;
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  const setBuilder = new WasmModuleBuilder();
+  sigId = setBuilder.addType(sig);
+  const impIndex = setBuilder.addImport('m', 'foo', sigId);
+  table = setBuilder.addImportedTable('m', 'table', 10, 10, kWasmAnyFunc);
+  setBuilder.addActiveElementSegment(
+        table, wasmI32Const(1), [impIndex]);
+  setBuilder.addFunction('set', kSig_v_v)
+      .addBody([
+        kExprI32Const, 0, // index of table.set
+        ...[kExprI32Const, 1, kExprTableGet, table],
+        kExprTableSet, table
+      ])
+      .exportFunc();
+
+  const instance = builder.instantiate();
+
+  const setInstance = setBuilder.instantiate(
+      {'m': {'table': instance.exports.table, 'foo': jsFunc}});
+  setInstance.exports.set(jsFunc);
+  AssertWrapperTierup(instance);
+}
+
+function TestIndirectTableSetFromFuncRefInOtherInstance(numParams, jsFunc, mode) {
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  let sigId = builder.addType(sig);
+
+  let table = builder.addTable(kWasmAnyFunc, 10, 10).exportAs('table').index;
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  if (mode == kNormal) {
+    body.push(kExprI32Const, 0, kExprCallIndirect, sigId, table);
+  } else {
+    body.push(kExprI32Const, 0, kExprTableGet, table,
+      kGCPrefix, kExprRefCast, sigId, kExprCallRef, sigId);
+
+    builder.addFunction('get', kSig_a_v)
+        .addBody([kExprI32Const, 0, kExprTableGet, table])
+        .exportFunc();
+  }
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  const setBuilder = new WasmModuleBuilder();
+  sigId = setBuilder.addType(sig);
+  const impIndex = setBuilder.addImport('m', 'foo', sigId);
+  setBuilder.addDeclarativeElementSegment([impIndex]);
+  table = setBuilder.addImportedTable('m', 'table', 10, 10, kWasmAnyFunc);
+  setBuilder.addFunction('set', kSig_v_v)
+      .addBody([
+        kExprI32Const, 0,  // index of table.set
+        kExprRefFunc, impIndex, kExprTableSet, table
+      ])
+      .exportFunc();
+
+  const instance = builder.instantiate();
+  const setInstance = setBuilder.instantiate(
+      {'m': {'table': instance.exports.table, 'foo': jsFunc}});
+  setInstance.exports.set(jsFunc);
+
+  AssertWrapperTierup(instance);
+}
+
+function TestCallRefFromParam(numParams, jsFunc, mode) {
+  if (mode != kNormal) return;
+  if (!(jsFunc instanceof WebAssembly.Function)) {
+    return;
+  }
+
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  let sigId = builder.addType(sig);
+
+  let body = [];
+  for (let i = 1; i <= numParams; ++i) {
+    body.push(kExprLocalGet, ...wasmSignedLeb(i));
+  }
+  body.push(kExprLocalGet, 0, kExprCallRef, sigId);
+
+  const mainParams = [wasmRefNullType(sigId), ...paramsTypes];
+  builder.addFunction('main', makeSig(mainParams, retTypes))
+    .addBody(body)
+    .exportFunc();
+  const instance = builder.instantiate();
+
+  assertTrue(%HasUnoptimizedWasmToJSWrapper(jsFunc));
+  instance.exports.main(jsFunc);
+  assertTrue(! %HasUnoptimizedWasmToJSWrapper(jsFunc));
+  instance.exports.main(jsFunc);
+}
+
+function TestCallRefFromFuncRef(numParams, jsFunc, mode) {
+  if (mode != kNormal) return;
+  const paramsTypes = new Array(numParams).fill(kWasmI32);
+  const retTypes = [];
+  const sig = makeSig(paramsTypes, retTypes);
+
+  const builder = new WasmModuleBuilder();
+  const sigId = builder.addType(sig);
+  const impIndex = builder.addImport('m', 'foo', sigId);
+  builder.addDeclarativeElementSegment([impIndex]);
+
+  let body = [];
+  for (let i = 0; i < numParams; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  body.push(kExprRefFunc, impIndex, kExprCallRef, sigId);
+
+  builder.addFunction('main', sigId)
+    .addBody(body)
+    .exportFunc();
+
+  builder.addFunction('get', kSig_a_v)
+      .addBody([kExprRefFunc, impIndex])
+      .exportFunc();
+
+  const instance = builder.instantiate({ 'm': { 'foo': jsFunc } });
+
+  AssertWrapperTierup(instance);
+}
+
+(function Test() {
+  const kinds = [
+    GetJSFunction, GetWasmJSFunction, GetReExportedJSFunction,
+    GetReExportedWasmJSFunction
+  ];
+
+  const tests = [
+    TestImportedFunction, TestIndirectElementSection, TestIndirectJSTableImport,
+    TestIndirectWasmTableImport, TestIndirectTableSetInJS,
+    TestIndirectTableSetFromParam, TestIndirectTableSetFromTableGet,
+    TestIndirectTableSetFromFuncRef,
+    TestIndirectTableSetFromParamInOtherInstance,
+    TestIndirectTableSetFromTableGetInOtherInstance,
+    TestIndirectTableSetFromTableGetInOtherInstance2,
+    TestIndirectTableSetFromFuncRefInOtherInstance, TestCallRefFromParam,
+    TestCallRefFromFuncRef
+  ];
+
+  const modes = [kNormal, kGetAndCall];
+
+  let numParams = 0;
+  for (const test of tests) {
+    console.log('\n', test.name);
+    for (const kind of kinds) {
+      console.log('>', kind.name);
+      for (const mode of modes) {
+        console.log(
+            mode == kNormal ? '  > CallIndirect' : '  > Table.get + ref.call');
+        test(numParams, kind(numParams), mode);
+        numParams++;
+      }
+    }
+  }
+})();
diff --git a/deps/v8/test/mjsunit/wasm/wasm-to-js.js b/deps/v8/test/mjsunit/wasm/wasm-to-js.js
new file mode 100644
index 00000000000000..3fca2733a98cb4
--- /dev/null
+++ b/deps/v8/test/mjsunit/wasm/wasm-to-js.js
@@ -0,0 +1,279 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Flags: --wasm-to-js-generic-wrapper --expose-gc
+
+d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
+
+const debug = false;
+// Use consecutive values as parameters for easier debugging.
+const easyValues = false;
+
+// This test tests the wasm-to-js wrapper with random signatures and random
+// values. The test creates a WebAssembly function with the random signature.
+// The WebAssembly function passes the incoming parameters directly to an
+// imported JavaScript function. The JavaScript function checks that the
+// incoming parameters match the original values passed to the WebAssembly
+// function. The imported JavaScript function then returns random return values,
+// which the WebAssembly function again forwards to the original caller. There
+// the return values of the WebAssembly function are compared with the original
+// random return values. `RunTest` is the core function, which runs the test
+// case for a specific signature and value mapping. `RunTest` can be used well
+// for debugging a specific signature. `GenerateAndRunTest` additionally
+// generates the inputs for `RunTest`, which is good for fuzzing the js-to-wasm
+// wrappers.
+
+// Some documentation if the test fails in the CQ.
+console.log("This test is a fuzzer, it tests the generic wasm-to-js wrapper");
+console.log("with random signatures. If this test fails, then it may not fail");
+console.log("for the CL that actually introduced the issue, but for a");
+console.log("later CL in the CQ. You may want to use flako to identify that");
+console.log("actual culprit.");
+
+const kPossibleTypes = [kWasmI32, kWasmI64, kWasmF32, kWasmF64, kWasmExternRef];
+
+function getRandomInt(max) {
+  return Math.floor(Math.random() * max);
+}
+
+function TypeString(type) {
+  switch (type) {
+    case kWasmI32:
+      return 'kWasmI32';
+    case kWasmI64:
+      return 'kWasmI64';
+    case kWasmF32:
+      return 'kWasmF32';
+    case kWasmF64:
+      return 'kWasmF64';
+    case kWasmExternRef:
+      return 'kWasmExternRef';
+  }
+}
+
+// A set of interesting values that will be used as parameters.
+let interestingParams = {};
+interestingParams[kWasmI32] = [
+  -1500000000, -0x4000_0000, -0x3fff_ffff, -1, 0, 1, 2, 0x3fff_ffff,
+  0x4000_0000, 1500000000, 0x7fff_ffff, {valueOf: () => 15}, {
+    toString: () => {
+      gc();
+      return '17';
+    }
+  }
+];
+
+interestingParams[kWasmI64] = [
+  -0x7fff_ffff_ffff_ffffn, -0xffff_ffffn, -0x8000_0000n, -1500000000n,
+  -0x4000_0000n, -0x3fff_ffffn, -1n, 0n, 1n, 2n, 0x3fff_ffffn, 0x4000_0000n,
+  1500000000n, 0x7fff_ffffn, 0x8000_0000n, 0xffff_ffffn, 0x7fff_ffff_ffff_ffffn,
+  {valueOf: () => 15n}, {
+    toString: () => {
+      gc();
+      return '17';
+    }
+  }
+];
+
+interestingParams[kWasmF32] = [
+  -Infinity,
+  -(2 ** 65),
+  -(2 ** 64),
+  -(2 ** 63),
+  -(2 ** 62),
+  -(2 ** 29),
+  -(2 ** 33),
+  -(2 ** 32),
+  -(2 ** 31),
+  -(2 ** 30),
+  -(2 ** 29),
+  -1.5,
+  -1,
+  0,
+  -0,
+  1,
+  1.5,
+  2,
+  2 ** 29,
+  2 ** 30,
+  2 ** 31,
+  2 ** 32,
+  2 ** 33,
+  2 ** 62,
+  2 ** 63,
+  2 ** 64,
+  2 ** 65,
+  {valueOf: () => 16},
+  {
+    toString: () => {
+      gc();
+      return '18';
+    }
+  },
+  Infinity,
+  NaN
+];
+
+interestingParams[kWasmF64] = [
+  -Infinity,
+  -(2 ** 65),
+  -(2 ** 64),
+  -(2 ** 63),
+  -(2 ** 62),
+  -(2 ** 29),
+  -(2 ** 33),
+  -(2 ** 32),
+  -(2 ** 31),
+  -(2 ** 30),
+  -(2 ** 29),
+  -1.5,
+  -1,
+  0,
+  -0,
+  1,
+  1.5,
+  2,
+  // 28 set bits, too many for float32.
+  0xfffffff,
+  2 ** 29,
+  2 ** 30,
+  2 ** 31,
+  2 ** 32,
+  2 ** 33,
+  2 ** 62,
+  2 ** 63,
+  2 ** 64,
+  2 ** 65,
+  {valueOf: () => 14},
+  {
+    toString: () => {
+      gc();
+      return '19';
+    }
+  },
+  Infinity,
+  NaN
+];
+
+interestingParams[kWasmExternRef] = [
+  17, 12.5, 17n, 0x7fff_ffff, {foo: 18}, [1, 2, 3], 'bar', () => 38, null,
+  undefined
+];
+
+function GenerateValueArray(params) {
+  let result = [];
+  let nextValue = 1;
+  for (let param of params) {
+    if (easyValues) {
+      switch (param) {
+        case kWasmI32:
+        case kWasmF32:
+        case kWasmF64:
+          result.push(nextValue++);
+          break;
+        case kWasmI64:
+          result.push(BigInt(nextValue++));
+          break;
+        case kWasmExternRef:
+          const val = nextValue++;
+          result.push({ val: val });
+      }
+    } else {
+      result.push(interestingParams[param][getRandomInt(
+        interestingParams[param].length)]);
+    }
+  }
+  return result;
+}
+
+function assertValueArray(original, transformed) {
+  assertEquals(transformed.length, original.length);
+  for (let i = 0; i < transformed.length; ++i) {
+    const arg = transformed[i];
+    if (typeof arg === 'bigint') {
+      // For values of type I64.
+      assertEquals(BigInt(original[i]), arg);
+    } else if (typeof arg === 'number') {
+      // For values of type I32, F32, and F64.
+      assertEquals(Number(original[i]), arg);
+    } else {
+      // For values of type externref.
+      assertEquals(original[i], arg);
+    }
+  }
+}
+
+function RunTest(params, returns) {
+  if (debug) {
+    let testcase = 'RunTest([';
+    for (let i = 0; i < params.length; ++i) {
+      testcase += (i == 0 ? '' : ', ') + TypeString(params[i]);
+    }
+    testcase += '], [';
+    if (returns.length > 0) {
+      testcase += TypeString(returns[0]);
+      for (let i = 1; i < returns.length; ++i) {
+        testcase += ', ' + TypeString(returns[i]);
+      }
+    }
+    testcase += ']);';
+    console.log(testcase);
+  }
+
+  const builder = new WasmModuleBuilder();
+  const impSig = makeSig(params, returns);
+  const impIndex = builder.addImport('m', 'f', impSig);
+  const paramValues = GenerateValueArray(params);
+  const returnValues = GenerateValueArray(returns);
+  let body = [];
+  for (let i = 0; i < params.length; ++i) {
+    body.push(kExprLocalGet, i);
+  }
+  body.push(kExprCallFunction, impIndex);
+
+  function impFunction() {
+    assertValueArray(paramValues, arguments);
+    if (returns.length === 0) return;
+    if (returns.length === 1) return returnValues[0];
+    return returnValues;
+  };
+
+  const sig = makeSig(params, returns);
+  builder.addFunction('main', sig).addBody(body).exportFunc();
+  const instance = builder.instantiate({ m: { f: impFunction } });
+  let result = instance.exports.main(...paramValues);
+  if (returns.length === 0) return;
+  if (returns.length === 1) result = [result];
+  assertValueArray(returnValues, result);
+}
+
+function GenerateAndRunTest() {
+  // Generate signature.
+  const kMaxParams = 20;
+  const kMaxReturns = 10;
+  const numParams = getRandomInt(kMaxParams) + 1;
+  const numReturns = getRandomInt(kMaxReturns + 1);
+  // The array of parameter types.
+  const params = [];
+  // The array of return types.
+  const returns = [];
+  for (let i = 0; i < numParams; ++i) {
+    params.push(kPossibleTypes[getRandomInt(kPossibleTypes.length)]);
+  }
+  for (let i = 0; i < numReturns; ++i) {
+    returns.push(kPossibleTypes[getRandomInt(kPossibleTypes.length)]);
+  }
+  RunTest(params, returns);
+}
+// Regression tests:
+RunTest(
+    [
+      kWasmF32, kWasmF64, kWasmF64, kWasmF32, kWasmI32, kWasmI64, kWasmF32,
+      kWasmF64, kWasmF64, kWasmF64, kWasmF32, kWasmF32
+    ],
+    [kWasmI64, kWasmI64, kWasmI32, kWasmF32]);
+
+for (let i = 0; i < (debug ? 200 : 2); ++i) {
+  GenerateAndRunTest();
+}
diff --git a/deps/v8/test/mjsunit/wasm/wrapper-compilation.js b/deps/v8/test/mjsunit/wasm/wrapper-compilation.js
index b2083932f12654..1f6dfd20ce9fef 100644
--- a/deps/v8/test/mjsunit/wasm/wrapper-compilation.js
+++ b/deps/v8/test/mjsunit/wasm/wrapper-compilation.js
@@ -3,6 +3,7 @@
 // found in the LICENSE file.
 
 // Flags: --experimental-wasm-gc --allow-natives-syntax --dump-counters
+// Flags: --no-wasm-generic-wrapper
 
 d8.file.execute('test/mjsunit/wasm/wasm-module-builder.js');
 
diff --git a/deps/v8/test/mkgrokdump/BUILD.gn b/deps/v8/test/mkgrokdump/BUILD.gn
index 1b06b87f972fba..f0167070a096b2 100644
--- a/deps/v8/test/mkgrokdump/BUILD.gn
+++ b/deps/v8/test/mkgrokdump/BUILD.gn
@@ -27,6 +27,5 @@ v8_executable("mkgrokdump") {
   data = [
     "mkgrokdump.status",
     "testcfg.py",
-    "../../tools/v8heapconst.py",
   ]
 }
diff --git a/deps/v8/test/mkgrokdump/README b/deps/v8/test/mkgrokdump/README
index 5f2f9f11a06e61..c166fb6792a79d 100644
--- a/deps/v8/test/mkgrokdump/README
+++ b/deps/v8/test/mkgrokdump/README
@@ -1,5 +1,2 @@
-If you change the heap layout, expect this test to fail (in CQ). You will then
-need to build x64 release with v8_enable_sandbox=true and run
-`<outdir>/mkgrokdump > tools/v8heapconst.py` to rebaseline.
-The V8 sandbox has to be manually enabled as it is enabled by default only for
-Chromium builds, but not standalone v8 builds.
+v8heapconst.py describes V8's known heap layout. To regenerate it, run
+`tools/dev/gm.py mkgrokdump`.
diff --git a/deps/v8/test/mkgrokdump/mkgrokdump.cc b/deps/v8/test/mkgrokdump/mkgrokdump.cc
index 91404e318fba46..76cfb882708286 100644
--- a/deps/v8/test/mkgrokdump/mkgrokdump.cc
+++ b/deps/v8/test/mkgrokdump/mkgrokdump.cc
@@ -45,7 +45,7 @@ class MockArrayBufferAllocator : public v8::ArrayBuffer::Allocator {
 };
 
 static void DumpKnownMap(FILE* out, i::Heap* heap, const char* space_name,
-                         i::HeapObject object) {
+                         i::Tagged<i::HeapObject> object) {
 #define RO_ROOT_LIST_CASE(type, name, CamelName) \
   if (root_name == nullptr && object == roots.name()) root_name = #CamelName;
 #define MUTABLE_ROOT_LIST_CASE(type, name, CamelName) \
@@ -53,7 +53,7 @@ static void DumpKnownMap(FILE* out, i::Heap* heap, const char* space_name,
 
   i::ReadOnlyRoots roots(heap);
   const char* root_name = nullptr;
-  i::Map map = i::Map::cast(object);
+  i::Tagged<i::Map> map = i::Map::cast(object);
   intptr_t root_ptr =
       static_cast<intptr_t>(map.ptr()) & (i::Page::kPageSize - 1);
 
@@ -62,14 +62,14 @@ static void DumpKnownMap(FILE* out, i::Heap* heap, const char* space_name,
 
   if (root_name == nullptr) return;
   i::PrintF(out, "    (\"%s\", 0x%05" V8PRIxPTR "): (%d, \"%s\"),\n",
-            space_name, root_ptr, map.instance_type(), root_name);
+            space_name, root_ptr, map->instance_type(), root_name);
 
 #undef MUTABLE_ROOT_LIST_CASE
 #undef RO_ROOT_LIST_CASE
 }
 
 static void DumpKnownObject(FILE* out, i::Heap* heap, const char* space_name,
-                            i::HeapObject object) {
+                            i::Tagged<i::HeapObject> object) {
 #define RO_ROOT_LIST_CASE(type, name, CamelName)        \
   if (root_name == nullptr && object == roots.name()) { \
     root_name = #CamelName;                             \
@@ -101,7 +101,7 @@ static void DumpKnownObject(FILE* out, i::Heap* heap, const char* space_name,
 
 static void DumpSpaceFirstPageAddress(FILE* out, i::BaseSpace* space,
                                       i::Address first_page) {
-  const char* name = space->name();
+  const char* name = i::ToString(space->identity());
   i::Tagged_t compressed =
       i::V8HeapCompressionScheme::CompressObject(first_page);
   uintptr_t unsigned_compressed = static_cast<uint32_t>(compressed);
@@ -142,18 +142,18 @@ static int DumpHeapConstants(FILE* out, const char* argv0) {
       i::PrintF(out, "\n# List of known V8 maps.\n");
       i::PrintF(out, "KNOWN_MAPS = {\n");
       i::ReadOnlyHeapObjectIterator ro_iterator(read_only_heap);
-      for (i::HeapObject object = ro_iterator.Next(); !object.is_null();
-           object = ro_iterator.Next()) {
-        if (!object.IsMap()) continue;
-        DumpKnownMap(out, heap, i::BaseSpace::GetSpaceName(i::RO_SPACE),
-                     object);
+      for (i::Tagged<i::HeapObject> object = ro_iterator.Next();
+           !object.is_null(); object = ro_iterator.Next()) {
+        if (!IsMap(object)) continue;
+        DumpKnownMap(out, heap, i::ToString(i::RO_SPACE), object);
       }
 
       i::PagedSpaceObjectIterator iterator(heap, heap->old_space());
-      for (i::HeapObject object = iterator.Next(); !object.is_null();
+      for (i::Tagged<i::HeapObject> object = iterator.Next(); !object.is_null();
            object = iterator.Next()) {
-        if (!object.IsMap()) continue;
-        DumpKnownMap(out, heap, heap->old_space()->name(), object);
+        if (!IsMap(object)) continue;
+        DumpKnownMap(out, heap, i::ToString(heap->old_space()->identity()),
+                     object);
       }
       i::PrintF(out, "}\n");
     }
@@ -166,9 +166,8 @@ static int DumpHeapConstants(FILE* out, const char* argv0) {
       for (i::HeapObject object = ro_iterator.Next(); !object.is_null();
            object = ro_iterator.Next()) {
         // Skip read-only heap maps, they will be reported elsewhere.
-        if (object.IsMap()) continue;
-        DumpKnownObject(out, heap, i::BaseSpace::GetSpaceName(i::RO_SPACE),
-                        object);
+        if (IsMap(object)) continue;
+        DumpKnownObject(out, heap, i::ToString(i::RO_SPACE), object);
       }
 
       i::PagedSpaceIterator spit(heap);
@@ -176,7 +175,7 @@ static int DumpHeapConstants(FILE* out, const char* argv0) {
         i::PagedSpaceObjectIterator it(heap, s);
         // Code objects are generally platform-dependent.
         if (s->identity() == i::CODE_SPACE) continue;
-        const char* sname = s->name();
+        const char* sname = i::ToString(s->identity());
         for (i::HeapObject o = it.Next(); !o.is_null(); o = it.Next()) {
           DumpKnownObject(out, heap, sname, o);
         }
diff --git a/deps/v8/test/mkgrokdump/testcfg.py b/deps/v8/test/mkgrokdump/testcfg.py
index 955b075b20e26d..42651694f0654b 100644
--- a/deps/v8/test/mkgrokdump/testcfg.py
+++ b/deps/v8/test/mkgrokdump/testcfg.py
@@ -2,8 +2,6 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-import os
-
 from testrunner.local import testsuite
 from testrunner.objects import testcase
 from testrunner.outproc import mkgrokdump
@@ -22,9 +20,6 @@ class TestSuite(testsuite.TestSuite):
   def __init__(self, ctx, *args, **kwargs):
     super(TestSuite, self).__init__(ctx, *args, **kwargs)
 
-    v8_path = os.path.dirname(os.path.dirname(os.path.abspath(self.root)))
-    self.expected_path = os.path.join(v8_path, 'tools', 'v8heapconst.py')
-
   def _test_loader_class(self):
     return TestLoader
 
@@ -47,4 +42,4 @@ def get_shell(self):
 
   @property
   def output_proc(self):
-    return mkgrokdump.OutProc(self.expected_outcomes, self.suite.expected_path)
+    return mkgrokdump.OutProc(self.expected_outcomes)
diff --git a/deps/v8/test/mozilla/mozilla.status b/deps/v8/test/mozilla/mozilla.status
index 9ab6b62f01ce22..aacb4e22335237 100644
--- a/deps/v8/test/mozilla/mozilla.status
+++ b/deps/v8/test/mozilla/mozilla.status
@@ -124,7 +124,7 @@
 
   # Georgina is bicameral as of Unicode 11, but the test assumes that it's unicameral.
   # no_i18n build has an old ICU data and Georgian is treated as unicameral.
-  'ecma/String/15.5.4.12-3': [FAIL, ['no_i18n == True', PASS]],
+  'ecma/String/15.5.4.12-3': [FAIL, ['not i18n', PASS]],
 
   # Expecations in this test don't match the spec.
   # See also https://bugs.chromium.org/p/v8/issues/detail?id=9446
@@ -220,7 +220,8 @@
   ##################### FLAKY TESTS #####################
 
   # BUG(v8:12558): These tests time out on Windows and also in debug mode.
-  'js1_5/Regress/regress-360969-05': [PASS, SLOW, ['mode == debug', NO_VARIANTS], ['system == windows', SKIP]],
+  # BUG(v8:14088): The former also times out with --stress-incremental-marking.
+  'js1_5/Regress/regress-360969-05': [PASS, SLOW, ['mode == debug', NO_VARIANTS], ['system == windows', SKIP], '--no-stress-incremental-marking'],
   'js1_5/Regress/regress-360969-06': [PASS, SLOW, ['mode == debug', NO_VARIANTS], ['system == windows', SKIP]],
 
   # These tests time out in debug mode but pass in product mode
@@ -266,12 +267,12 @@
   # TODO(jshin): Add equivalent tests with a specific timezone using TZ variable
   # on Linux to mjsunit.
 
-  'ecma/Date/15.9.5.16': [PASS,  ['no_i18n == False', FAIL]],
-  'ecma/Date/15.9.5.18': [PASS,  ['no_i18n == False', FAIL]],
-  'ecma/Date/15.9.5.22-1': [PASS, ['no_i18n == False', FAIL]],
+  'ecma/Date/15.9.5.16': [PASS,  ['i18n', FAIL]],
+  'ecma/Date/15.9.5.18': [PASS,  ['i18n', FAIL]],
+  'ecma/Date/15.9.5.22-1': [PASS, ['i18n', FAIL]],
 
   # 1050186: Arm vm is broken;  probably unrelated to dates
-  'ecma/Date/15.9.5.22-2': [PASS, ['no_i18n == False or arch == arm', FAIL]],
+  'ecma/Date/15.9.5.22-2': [PASS, ['i18n or arch == arm', FAIL]],
 
   # Flaky test that fails due to what appears to be a bug in the test.
   # Occurs depending on current time
@@ -478,7 +479,7 @@
 
   # This fails because we don't have stack space for Function.prototype.apply
   # with very large numbers of arguments.  The test uses 2^24 arguments.
-  'js1_5/Array/regress-350256-03': [FAIL_OK],
+  'js1_5/Array/regress-350256-03': [FAIL_OK, SLOW],
 
 
   # Extra arguments not handled properly in String.prototype.match
@@ -925,13 +926,13 @@
 }],  # ALWAYS
 
 
-['no_i18n == True and mode == debug', {
+['not i18n and mode == debug', {
   # Tests too slow for no18n debug.
   'ecma_3/Statements/regress-302439': [PASS, NO_VARIANTS],
   'js1_5/Regress/regress-98901': [SKIP],
   'ecma_3/RegExp/perlstress-001': [PASS, NO_VARIANTS],
   'js1_5/extensions/regress-311161': [FAIL_OK, NO_VARIANTS],
-}],  # 'no_i18n == True and mode == debug'
+}],  # 'not i18n and mode == debug'
 
 
 ['arch == arm or arch == arm64', {
diff --git a/deps/v8/test/mozilla/testcfg.py b/deps/v8/test/mozilla/testcfg.py
index 95c2ba6a276f09..0bf0e727a2bad3 100644
--- a/deps/v8/test/mozilla/testcfg.py
+++ b/deps/v8/test/mozilla/testcfg.py
@@ -71,14 +71,14 @@ def test_dirs(self):
 
   def _to_relpath(self, abspath, _):
     # TODO: refactor this by setting the test path during the TestCase creation
-    return os.path.relpath(abspath, self.test_root)
+    return abspath.relative_to(self.test_root)
 
 
 class TestSuite(testsuite.TestSuite):
 
   def __init__(self, ctx, *args, **kwargs):
     super(TestSuite, self).__init__(ctx, *args, **kwargs)
-    self.test_root = os.path.join(self.root, "data")
+    self.test_root = self.root / "data"
     self._test_loader.test_root = self.test_root
 
   def _test_loader_class(self):
@@ -90,31 +90,29 @@ def _test_class(self):
 
 class TestCase(testcase.D8TestCase):
   def _get_files_params(self):
-    files = [os.path.join(self.suite.root, "mozilla-shell-emulation.js")]
-    testfilename = self.path + ".js"
-    testfilepath = testfilename.split(os.path.sep)
-    for i in range(len(testfilepath)):
-      script = os.path.join(self.suite.test_root,
-                            reduce(os.path.join, testfilepath[:i], ""),
-                            "shell.js")
-      if os.path.exists(script):
+    files = [self.suite.root / "mozilla-shell-emulation.js"]
+    parts = self.path_js.parts
+    for i in range(len(parts)):
+      sub_path = '/'.join(parts[:i])
+      script = self.suite.test_root / sub_path / "shell.js"
+      if script.exists():
         files.append(script)
 
-    files.append(os.path.join(self.suite.test_root, testfilename))
+    files.append(self.suite.test_root / self.path_js)
     return files
 
   def _get_suite_flags(self):
     return ['--expose-gc']
 
   def _get_source_path(self):
-    return os.path.join(self.suite.test_root, self.path + self._get_suffix())
+    return self.suite.test_root / self.path_js
 
   @property
   def output_proc(self):
     if not self.expected_outcomes:
-      if self.path.endswith('-n'):
+      if self.path.name.endswith('-n'):
         return mozilla.MOZILLA_PASS_NEGATIVE
       return mozilla.MOZILLA_PASS_DEFAULT
-    if self.path.endswith('-n'):
+    if self.path.name.endswith('-n'):
       return mozilla.NegOutProc(self.expected_outcomes)
     return mozilla.OutProc(self.expected_outcomes)
diff --git a/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersect-other-is-set-like.js b/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersect-other-is-set-like.js
new file mode 100644
index 00000000000000..2ccb2f926b0a40
--- /dev/null
+++ b/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersect-other-is-set-like.js
@@ -0,0 +1,30 @@
+// Copyright (C) 2023 the V8 project authors. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+/*---
+features: [set-methods]
+includes: [compareArray.js]
+---*/
+
+const SetLike = {
+    arr: [42, 43, 45],
+    size: 3,
+        keys() {
+            return this.arr[Symbol.iterator]();
+        },
+        has(key) {
+            return this.arr.indexOf(key) != -1;
+        }
+    };
+
+const firstSet = new Set();
+firstSet.add(42);
+firstSet.add(43);
+
+const resultSet = new Set();
+resultSet.add(42);
+resultSet.add(43);
+
+const resultArray = Array.from(resultSet);
+const intersectionArray = Array.from(firstSet.intersection(SetLike));
+
+assert.compareArray(resultArray, intersectionArray);
diff --git a/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersection-other-is-map.js b/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersection-other-is-map.js
new file mode 100644
index 00000000000000..fd92a1f0ec87d4
--- /dev/null
+++ b/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersection-other-is-map.js
@@ -0,0 +1,23 @@
+// Copyright (C) 2023 the V8 project authors. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+/*---
+features: [set-methods]
+includes: [compareArray.js]
+---*/
+
+const firstSet = new Set();
+firstSet.add(42);
+firstSet.add(43);
+
+const other = new Map();
+other.set(42);
+other.set(46);
+other.set(47);
+
+const resultSet = new Set();
+resultSet.add(42);
+
+const resultArray = Array.from(resultSet);
+const intersectionArray = Array.from(firstSet.intersection(other));
+
+assert.compareArray(resultArray, intersectionArray);
diff --git a/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersection-other-is-set.js b/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersection-other-is-set.js
new file mode 100644
index 00000000000000..d9476fe15c31e9
--- /dev/null
+++ b/deps/v8/test/test262/local-tests/test/staging/set-methods/set-intersection-other-is-set.js
@@ -0,0 +1,23 @@
+// Copyright (C) 2023 the V8 project authors. All rights reserved.
+// This code is governed by the BSD license found in the LICENSE file.
+/*---
+features: [set-methods]
+includes: [compareArray.js]
+---*/
+
+const firstSet = new Set();
+firstSet.add(42);
+firstSet.add(43);
+firstSet.add(44);
+
+const otherSet = new Set();
+otherSet.add(42);
+otherSet.add(45);
+
+const resultSet = new Set();
+resultSet.add(42);
+
+const resultArray = Array.from(resultSet);
+const intersectionArray = Array.from(firstSet.intersection(otherSet));
+
+assert.compareArray(resultArray, intersectionArray);
diff --git a/deps/v8/test/test262/test262.status b/deps/v8/test/test262/test262.status
index 9b4fe379f5c33a..e2c3fa26ae07eb 100644
--- a/deps/v8/test/test262/test262.status
+++ b/deps/v8/test/test262/test262.status
@@ -306,6 +306,95 @@
   'built-ins/Array/fromAsync/name': [FAIL],
   'built-ins/Array/fromAsync/not-a-constructor': [FAIL],
   'built-ins/Array/fromAsync/prop-desc': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-array-add': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-array-add-to-empty': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-array-add-to-singleton': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-arraybuffer': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-arraylike-holes': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-arraylike-length-accessor-throws': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-arraylike-promise': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-arraylike-too-long': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-array-mutate': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-array-remove': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-asynciterator-exists': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-asynciterator-not-callable': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-asynciterator-null': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-asynciterator-sync': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-asynciterator-throws': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-bigint': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-boolean': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-function': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-iterator-exists': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-iterator-not-callable': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-iterator-null': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-iterator-promise': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-iterator-throws': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-null-undefined': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-number': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-object-not-arraylike': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-operations': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-string': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-symbol': [FAIL],
+  'built-ins/Array/fromAsync/asyncitems-uses-intrinsic-iterator-symbols': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-async-arraylike': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-async-iterable-async': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-async-iterable-sync': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-async-throws': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-async-throws-close-async-iterator': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-async-throws-close-sync-iterator': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-not-callable': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-result-awaited-once-per-iteration': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-sync-arraylike': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-sync-iterable-async': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-sync-iterable-sync': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-sync-throws': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-sync-throws-close-async-iterator': [FAIL],
+  'built-ins/Array/fromAsync/mapfn-sync-throws-close-sync-iterator': [FAIL],
+  'built-ins/Array/fromAsync/returned-promise-resolves-to-array': [FAIL],
+  'built-ins/Array/fromAsync/returns-promise': [FAIL],
+  'built-ins/Array/fromAsync/thisarg-object': [FAIL],
+  'built-ins/Array/fromAsync/thisarg-omitted-sloppy': [FAIL],
+  'built-ins/Array/fromAsync/thisarg-omitted-strict': [FAIL],
+  'built-ins/Array/fromAsync/thisarg-primitive-sloppy': [FAIL],
+  'built-ins/Array/fromAsync/thisarg-primitive-strict': [FAIL],
+  'built-ins/Array/fromAsync/this-constructor': [FAIL],
+  'built-ins/Array/fromAsync/this-constructor-operations': [FAIL],
+  'built-ins/Array/fromAsync/this-constructor-with-bad-length-setter': [FAIL],
+  'built-ins/Array/fromAsync/this-constructor-with-readonly-elements': [FAIL],
+  'built-ins/Array/fromAsync/this-constructor-with-readonly-length': [FAIL],
+  'built-ins/Array/fromAsync/this-constructor-with-unsettable-element': [FAIL],
+  'built-ins/Array/fromAsync/this-constructor-with-unsettable-element-closes-async-iterator': [FAIL],
+  'built-ins/Array/fromAsync/this-constructor-with-unsettable-element-closes-sync-iterator': [FAIL],
+  'built-ins/Array/fromAsync/this-non-constructor': [FAIL],
+  'built-ins/Array/fromAsync/async-iterable-async-mapped-awaits-once': [FAIL],
+  'built-ins/Array/fromAsync/async-iterable-input': [FAIL],
+  'built-ins/Array/fromAsync/async-iterable-input-does-not-await-input': [FAIL],
+  'built-ins/Array/fromAsync/async-iterable-input-iteration-err': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-input': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-input-does-not-use-array-prototype': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-input-element-access-err': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-input-with-thenable': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-input-with-thenable-async-mapped-awaits-callback-result-once': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-input-with-thenable-async-mapped-callback-err': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-input-with-thenable-element-rejects': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-input-with-thenable-sync-mapped-callback-err': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-sync-mapped-callback-err': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-with-non-promise-thenable': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-with-thenable-async-mapped-awaits-once': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-with-thenable-awaits-once': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-with-thenable-sync-mapped-awaits-once': [FAIL],
+  'built-ins/Array/fromAsync/non-iterable-with-thenable-then-method-err': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-input': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-input-with-non-promise-thenable': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-input-with-thenable': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-iteration-err': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-with-thenable-async-mapped-awaits-once': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-with-thenable-async-mapped-callback-err': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-with-thenable-awaits-once': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-with-thenable-element-rejects': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-with-thenable-sync-mapped-awaits-once': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-with-thenable-sync-mapped-callback-err': [FAIL],
+  'built-ins/Array/fromAsync/sync-iterable-with-thenable-then-method-err': [FAIL],
 
   # https://bugs.chromium.org/p/v8/issues/detail?id=11544
   'built-ins/Temporal/Duration/prototype/total/balance-negative-result': [FAIL],
@@ -343,7 +432,6 @@
   'staging/Intl402/Temporal/old/monthday-toLocaleString': [FAIL],
   'staging/Intl402/Temporal/old/non-iso-calendars': [FAIL],
   'staging/Intl402/Temporal/old/yearmonth-toLocaleString': [FAIL],
-  'staging/Intl402/Temporal/old/zoneddatetime-toLocaleString': [FAIL],
 
   # intl402
   'intl402/Temporal/TimeZone/from/timezone-case-insensitive': [FAIL],
@@ -425,73 +513,53 @@
 
   'staging/Intl402/Temporal/old/duration-arithmetic-dst': [FAIL],
 
-  'built-ins/Temporal/Calendar/from/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/dateAdd/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dateAdd/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dateAdd/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dateAdd/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dateUntil/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dateUntil/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dateUntil/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/day/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/day/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/day/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/day/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/daysInYear/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInYear/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInYear/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/daysInYear/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-string-unknown-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/mergeFields/non-string-properties': [FAIL],
   'built-ins/Temporal/Calendar/prototype/mergeFields/order-of-operations': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/month/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/month/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/month/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/month/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/monthCode/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/monthCode/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/monthCode/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/monthCode/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/year/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/year/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/year/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Calendar/prototype/year/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Duration/compare/relativeto-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/Duration/prototype/add/relativeto-string-datetime': [FAIL],
-  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/Duration/prototype/round/relativeto-string-datetime': [FAIL],
-  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/Duration/prototype/subtract/relativeto-string-datetime': [FAIL],
-  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/Duration/prototype/total/relativeto-string-datetime': [FAIL],
   'built-ins/Temporal/Instant/compare/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Instant/compare/argument-string-time-zone-annotation': [FAIL],
@@ -505,37 +573,18 @@
   'built-ins/Temporal/Instant/prototype/since/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Instant/prototype/since/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Instant/prototype/since/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Instant/prototype/toString/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Instant/prototype/toZonedDateTime/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/Instant/prototype/toZonedDateTimeISO/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Instant/prototype/toZonedDateTime/timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/Instant/prototype/until/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/Instant/prototype/until/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/Instant/prototype/until/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/Now/plainDate/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/Now/plainDateISO/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Now/plainDateTime/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/Now/plainDateTimeISO/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Now/plainDateTime/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Now/plainDate/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Now/plainTimeISO/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Now/zonedDateTime/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/Now/zonedDateTimeISO/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/Now/zonedDateTime/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/PlainDate/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/PlainDate/compare/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDate/compare/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/compare/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/compare/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDate/from/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDate/from/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/from/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/from/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDate/prototype/equals/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/equals/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/equals/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/equals/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDate/prototype/since/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/since/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/since/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/since/argument-string-unknown-annotation': [FAIL],
@@ -547,50 +596,35 @@
   'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/PlainDate/prototype/until/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/until/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/until/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/until/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDate/prototype/withCalendar/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/PlainDateTime/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/PlainDateTime/compare/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDateTime/compare/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/compare/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/compare/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDateTime/from/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDateTime/from/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/from/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/from/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDateTime/prototype/equals/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/equals/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/equals/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/equals/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDateTime/prototype/since/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/since/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/since/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/since/argument-string-unknown-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/toString/calendarname-critical': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/toString/calendar-tostring': [FAIL],
-  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/PlainDateTime/prototype/until/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/until/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/until/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/until/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-string-unknown-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/withPlainTime/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/withPlainTime/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/withPlainTime/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainMonthDay/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/PlainMonthDay/from/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainMonthDay/from/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainMonthDay/from/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainMonthDay/from/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainMonthDay/prototype/equals/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainMonthDay/prototype/equals/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainMonthDay/prototype/equals/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainMonthDay/prototype/equals/argument-string-unknown-annotation': [FAIL],
@@ -608,43 +642,32 @@
   'built-ins/Temporal/PlainTime/prototype/since/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/since/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/since/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/until/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/until/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/until/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainYearMonth/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/PlainYearMonth/compare/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainYearMonth/compare/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/compare/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/compare/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainYearMonth/from/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainYearMonth/from/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/from/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/from/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/PlainYearMonth/prototype/since/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/since/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/since/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/since/argument-string-unknown-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/toString/calendarname-critical': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/toString/calendar-tostring': [FAIL],
-  'built-ins/Temporal/PlainYearMonth/prototype/until/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/until/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/until/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/until/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/TimeZone/from/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-string-unknown-annotation': [FAIL],
@@ -660,66 +683,46 @@
   'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-string-unknown-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPreviousTransition/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPreviousTransition/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPreviousTransition/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/ZonedDateTime/compare/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/compare/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/compare/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/ZonedDateTime/from/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/from/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/from/argument-string-unknown-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/from/offset-overrides-critical-flag': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/since/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/since/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/since/argument-string-unknown-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/toString/calendarname-critical': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/toString/calendar-tostring': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/toString/timezonename-critical': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-timezone-instance-does-not-get-timeZone-property': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/until/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/until/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/until/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/calendar-instance-does-not-get-calendar-property': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-string-unknown-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/withPlainTime/argument-string-calendar-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/withPlainTime/argument-string-time-zone-annotation': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/withPlainTime/argument-string-unknown-annotation': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/withTimeZone/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/timezone-instance-does-not-get-timeZone-property': [FAIL],
-  'intl402/Temporal/Calendar/prototype/era/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'intl402/Temporal/Calendar/prototype/era/argument-string-calendar-annotation': [FAIL],
   'intl402/Temporal/Calendar/prototype/era/argument-string-time-zone-annotation': [FAIL],
   'intl402/Temporal/Calendar/prototype/era/argument-string-unknown-annotation': [FAIL],
-  'intl402/Temporal/Calendar/prototype/eraYear/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'intl402/Temporal/Calendar/prototype/eraYear/argument-string-calendar-annotation': [FAIL],
   'intl402/Temporal/Calendar/prototype/eraYear/argument-string-time-zone-annotation': [FAIL],
   'intl402/Temporal/Calendar/prototype/eraYear/argument-string-unknown-annotation': [FAIL],
 
   'built-ins/Temporal/Calendar/from/calendar-wrong-type': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dateAdd/argument-string-date-with-utc-offset': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-propertybag-calendar-wrong-type': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dateUntil/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/Calendar/prototype/day/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-string-date-with-utc-offset': [FAIL],
@@ -736,10 +739,7 @@
   'built-ins/Temporal/Calendar/prototype/year/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-calendar-datefromfields-called-with-null-prototype-fields': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-leap-second': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-number': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-propertybag-calendar-instance-does-not-get-calendar-property': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-propertybag-calendar-leap-second': [FAIL],
-  'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-propertybag-calendar-number': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-propertybag-calendar-string': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-propertybag-calendar-wrong-type': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-propertybag-calendar-year-zero': [FAIL],
@@ -770,19 +770,10 @@
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/name': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/prop-desc': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/year-zero': [FAIL],
-  'built-ins/Temporal/Duration/compare/relativeto-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Duration/prototype/add/order-of-operations': [FAIL],
-  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-calendar-wrong-type': [FAIL],
-  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-timezone-wrong-type': [FAIL],
-  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-calendar-wrong-type': [FAIL],
-  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Duration/prototype/subtract/order-of-operations': [FAIL],
-  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-calendar-wrong-type': [FAIL],
-  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Duration/prototype/toString/fractionalseconddigits-non-integer': [FAIL],
   'built-ins/Temporal/Duration/prototype/toString/order-of-operations': [FAIL],
-  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-calendar-wrong-type': [FAIL],
-  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Instant/compare/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/Instant/from/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/Instant/prototype/equals/argument-string-date-with-utc-offset': [FAIL],
@@ -790,23 +781,16 @@
   'built-ins/Temporal/Instant/prototype/since/order-of-operations': [FAIL],
   'built-ins/Temporal/Instant/prototype/toString/fractionalseconddigits-non-integer': [FAIL],
   'built-ins/Temporal/Instant/prototype/toString/order-of-operations': [FAIL],
-  'built-ins/Temporal/Instant/prototype/toString/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Instant/prototype/toZonedDateTime/calendar-wrong-type': [FAIL],
   'built-ins/Temporal/Instant/prototype/toZonedDateTimeISO/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Instant/prototype/toZonedDateTime/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Instant/prototype/until/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/Instant/prototype/until/order-of-operations': [FAIL],
   'built-ins/Temporal/Now/plainDate/calendar-wrong-type': [FAIL],
-  'built-ins/Temporal/Now/plainDateISO/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Now/plainDateTime/calendar-wrong-type': [FAIL],
-  'built-ins/Temporal/Now/plainDateTimeISO/timezone-wrong-type': [FAIL],
-  'built-ins/Temporal/Now/plainDateTime/timezone-wrong-type': [FAIL],
-  'built-ins/Temporal/Now/plainDate/timezone-wrong-type': [FAIL],
-  'built-ins/Temporal/Now/plainTimeISO/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Now/zonedDateTime/calendar-wrong-type': [FAIL],
   'built-ins/Temporal/Now/zonedDateTimeISO/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/Now/zonedDateTime/timezone-wrong-type': [FAIL],
-  'built-ins/Temporal/PlainDate/compare/argument-propertybag-calendar-wrong-type': [FAIL],
   'built-ins/Temporal/PlainDate/compare/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainDate/from/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainDate/from/calendar-fields-custom': [FAIL],
@@ -816,7 +800,6 @@
   'built-ins/Temporal/PlainDate/prototype/toPlainDateTime/argument-string-time-designator-required-for-disambiguation': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/argument-string-time-designator-required-for-disambiguation': [FAIL],
-  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/until/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/withCalendar/calendar-wrong-type': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/yearOfWeek/basic': [FAIL],
@@ -824,7 +807,6 @@
   'built-ins/Temporal/PlainDate/prototype/yearOfWeek/custom': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/yearOfWeek/prop-desc': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/yearOfWeek/validate-calendar-value': [FAIL],
-  'built-ins/Temporal/PlainDateTime/compare/argument-propertybag-calendar-wrong-type': [FAIL],
   'built-ins/Temporal/PlainDateTime/compare/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainDateTime/from/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainDateTime/from/order-of-operations': [FAIL],
@@ -832,7 +814,6 @@
   'built-ins/Temporal/PlainDateTime/prototype/since/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/toString/fractionalseconddigits-non-integer': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/toString/order-of-operations': [FAIL],
-  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/until/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/withCalendar/calendar-wrong-type': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/with/order-of-operations': [FAIL],
@@ -859,11 +840,9 @@
   'built-ins/Temporal/PlainTime/prototype/toString/fractionalseconddigits-non-integer': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/toString/order-of-operations': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-string-date-with-utc-offset': [FAIL],
-  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/timezone-wrong-type': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/until/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/until/argument-string-time-designator-required-for-disambiguation': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/until/order-of-operations': [FAIL],
-  'built-ins/Temporal/PlainYearMonth/compare/argument-propertybag-calendar-wrong-type': [FAIL],
   'built-ins/Temporal/PlainYearMonth/compare/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainYearMonth/from/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-string-date-with-utc-offset': [FAIL],
@@ -880,21 +859,15 @@
   'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/getPreviousTransition/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/TimeZone/prototype/id/custom-timezone': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-calendar-wrong-type': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/ZonedDateTime/compare/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/ZonedDateTime/compare/order-of-operations': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/ZonedDateTime/from/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/ZonedDateTime/from/order-of-operations': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/equals/order-of-operations': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/since/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/toString/fractionalseconddigits-non-integer': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/toString/order-of-operations': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-timezone-wrong-type': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/until/argument-string-date-with-utc-offset': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/calendar-wrong-type': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/with/copies-merge-fields-object': [FAIL],
@@ -925,48 +898,35 @@
   'built-ins/Temporal/Calendar/from/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-propertybag-calendar-case-insensitive': [FAIL],
   'built-ins/Temporal/Duration/prototype/round/roundingincrement-out-of-range': [FAIL],
-  'built-ins/Temporal/Instant/prototype/toZonedDateTime/calendar-temporal-object': [FAIL],
-  'built-ins/Temporal/Now/plainDate/calendar-temporal-object': [FAIL],
-  'built-ins/Temporal/Now/plainDateTime/calendar-temporal-object': [FAIL],
-  'built-ins/Temporal/Now/zonedDateTime/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/PlainDate/argument-convert': [FAIL],
-  'built-ins/Temporal/PlainDate/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/day/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/monthCode/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/month/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/since/roundingincrement-out-of-range': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/until/roundingincrement-out-of-range': [FAIL],
-  'built-ins/Temporal/PlainDate/prototype/withCalendar/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/with/order-of-operations': [FAIL],
   'built-ins/Temporal/PlainDate/prototype/year/validate-calendar-value': [FAIL],
-  'built-ins/Temporal/PlainDateTime/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/day/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/monthCode/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/month/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/since/roundingincrement-non-integer': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/until/roundingincrement-non-integer': [FAIL],
-  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/PlainDateTime/prototype/year/validate-calendar-value': [FAIL],
-  'built-ins/Temporal/PlainMonthDay/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/PlainMonthDay/prototype/day/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainMonthDay/prototype/monthCode/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainMonthDay/prototype/with/order-of-operations': [FAIL],
   'built-ins/Temporal/PlainTime/prototype/with/order-of-operations': [FAIL],
-  'built-ins/Temporal/PlainYearMonth/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/monthCode/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/month/validate-calendar-value': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/since/roundingincrement-out-of-range': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/until/roundingincrement-out-of-range': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/with/order-of-operations': [FAIL],
   'built-ins/Temporal/PlainYearMonth/prototype/year/validate-calendar-value': [FAIL],
-  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/calendar-temporal-object': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/day/validate-calendar-value': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/monthCode/validate-calendar-value': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/month/validate-calendar-value': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/since/roundingincrement-non-integer': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/until/roundingincrement-non-integer': [FAIL],
-  'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/calendar-temporal-object': [FAIL],
   'built-ins/Temporal/ZonedDateTime/prototype/year/validate-calendar-value': [FAIL],
   'intl402/Temporal/PlainDate/prototype/era/validate-calendar-value': [FAIL],
   'intl402/Temporal/PlainDate/prototype/eraYear/validate-calendar-value': [FAIL],
@@ -984,18 +944,1132 @@
   'intl402/Temporal/Calendar/prototype/yearMonthFromFields/reference-day': [FAIL],
   'intl402/Temporal/PlainDate/prototype/with/cross-era-boundary': [FAIL],
 
+  'intl402/Temporal/Calendar/prototype/dateFromFields/one-of-era-erayear-undefined': [FAIL],
+  'intl402/Temporal/Calendar/prototype/dateUntil/until-across-lunisolar-leap-months': [FAIL],
+  'intl402/Temporal/Calendar/prototype/monthDayFromFields/one-of-era-erayear-undefined': [FAIL],
+  'intl402/Temporal/Calendar/prototype/yearMonthFromFields/one-of-era-erayear-undefined': [FAIL],
+
+  'built-ins/Temporal/Calendar/prototype/dateAdd/order-of-operations': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateFromFields/order-of-operations': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateUntil/order-of-operations': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthDayFromFields/order-of-operations': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/toJSON/returns-identifier-slot': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/yearMonthFromFields/order-of-operations': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-string-multiple-calendar': [FAIL],
+  'built-ins/Temporal/Duration/compare/relativeto-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/Duration/compare/relativeto-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/calendar-dateadd-called-with-options-undefined': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/calendar-dateuntil-called-with-singular-largestunit': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/largestunit-correct-rebalancing': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/throws-in-unbalance-duration-relative-when-sign-mismatched': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/timezone-getpossibleinstantsfor-iterable': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/zero-day-length-2': [FAIL],
+  'built-ins/Temporal/Instant/prototype/epochMicroseconds/basic': [FAIL],
+  'built-ins/Temporal/Instant/prototype/epochMilliseconds/basic': [FAIL],
+  'built-ins/Temporal/Instant/prototype/epochSeconds/basic': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toString/timezone': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toString/timezone-string': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/calendar-number': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/calendar-string': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/calendar-string-leap-second': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTimeISO/calendar-is-builtin': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTimeISO/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTimeISO/timezone-string': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTimeISO/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTimeISO/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTimeISO/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/plain-custom-timezone': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/timezone-string': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toZonedDateTime/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/Now/plainDate/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/Now/plainDate/calendar-number': [FAIL],
+  'built-ins/Temporal/Now/plainDate/calendar-string': [FAIL],
+  'built-ins/Temporal/Now/plainDate/calendar-string-leap-second': [FAIL],
+  'built-ins/Temporal/Now/plainDateISO/return-value': [FAIL],
+  'built-ins/Temporal/Now/plainDateISO/timezone-string': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/calendar-function': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/calendar-number': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/calendar-object': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/calendar-string': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/calendar-string-leap-second': [FAIL],
+  'built-ins/Temporal/Now/plainDateTimeISO/return-value-calendar': [FAIL],
+  'built-ins/Temporal/Now/plainDateTimeISO/timezone-object': [FAIL],
+  'built-ins/Temporal/Now/plainDateTimeISO/timezone-string': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/timezone': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/timezone-object': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/timezone-string': [FAIL],
+  'built-ins/Temporal/Now/plainDate/timezone-string': [FAIL],
+  'built-ins/Temporal/Now/plainDate/toPlainDate-override': [FAIL],
+  'built-ins/Temporal/Now/plainTimeISO/timezone': [FAIL],
+  'built-ins/Temporal/Now/plainTimeISO/timezone-string': [FAIL],
+  'built-ins/Temporal/Now/plainTimeISO/toPlainTime-override': [FAIL],
+  'built-ins/Temporal/Now/timeZoneId/extensible': [FAIL],
+  'built-ins/Temporal/Now/timeZoneId/length': [FAIL],
+  'built-ins/Temporal/Now/timeZoneId/name': [FAIL],
+  'built-ins/Temporal/Now/timeZoneId/not-a-constructor': [FAIL],
+  'built-ins/Temporal/Now/timeZoneId/prop-desc': [FAIL],
+  'built-ins/Temporal/Now/timeZoneId/return-value': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/calendar-function': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/calendar-number': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/calendar-object': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/calendar-string': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/calendar-string-leap-second': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTimeISO/return-value': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTimeISO/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTimeISO/timezone-object': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTimeISO/timezone-string': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTimeISO/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTimeISO/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTimeISO/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTimeISO/time-zone-undefined': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/timezone-object': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/timezone-string': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/time-zone-undefined': [FAIL],
+  'built-ins/Temporal/PlainDate/basic': [FAIL],
+  'built-ins/Temporal/PlainDate/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainDate/calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDate/calendar-string': [FAIL],
+  'built-ins/Temporal/PlainDate/calendar-undefined': [FAIL],
+  'built-ins/Temporal/PlainDate/calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/compare/argument-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-plaindatetime': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-propertybag-calendar': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-zoneddatetime': [FAIL],
+  'built-ins/Temporal/PlainDate/from/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/PlainDate/from/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/add/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/add/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/calendarId/branding': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/calendarId/prop-desc': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/day/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/dayOfWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/dayOfYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/daysInMonth/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/daysInWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/daysInYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/calendar-call-different': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/calendar-call-same': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/getCalendar/branding': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/getCalendar/builtin': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/getCalendar/length': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/getCalendar/name': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/getCalendar/not-a-constructor': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/getCalendar/prop-desc': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/getISOFields/field-names': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/inLeapYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/month/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/monthCode/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/monthsInYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/calendar-mismatch': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/subtract/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/subtract/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainDateTime/custom': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainMonthDay/basic': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainMonthDay/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainYearMonth/basic': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainYearMonth/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toString/calendarname-always': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toString/calendarname-auto': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toString/calendarname-undefined': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toString/calendarname-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toString/options-undefined': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toString/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/calendar': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-getpossibleinstantsfor': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-string': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/calendar-mismatch': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/weekOfYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/with/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/withCalendar/basic': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/withCalendar/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/withCalendar/calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/withCalendar/calendar-string': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/withCalendar/calendar-string-leap-second': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/withCalendar/subclassing-ignored': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/year/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/yearOfWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainDateTime/calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/calendar-string': [FAIL],
+  'built-ins/Temporal/PlainDateTime/calendar-undefined': [FAIL],
+  'built-ins/Temporal/PlainDateTime/calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/argument-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/PlainDateTime/constructor-full': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/argument-plaindate': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/argument-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/add/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/add/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/calendarId/branding': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/calendarId/prop-desc': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/day/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/dayOfWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/dayOfYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/daysInMonth/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/daysInWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/daysInYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/calendar-checked': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/getCalendar/branding': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/getCalendar/builtin': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/getCalendar/length': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/getCalendar/name': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/getCalendar/not-a-constructor': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/getCalendar/prop-desc': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/getISOFields/field-names': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/inLeapYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/month/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/monthCode/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/monthsInYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/calendar-dateuntil-called-with-plaindate-calendar': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/subtract/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/subtract/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toPlainMonthDay/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toPlainYearMonth/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toString/calendarname-always': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toString/calendarname-auto': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toString/calendarname-undefined': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toString/calendarname-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toString/options-undefined': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/basic': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/plain-custom-timezone': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-string': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/calendar-dateuntil-called-with-plaindate-calendar': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/weekOfYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/with/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/argument-string': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/basic': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/calendar-string': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/calendar-string-leap-second': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/subclassing-ignored': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-plaindate-calendar': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-plaindate-calendar-noniso': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-plaindate-calendar-same-id': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-plaindate-calendar-same-object': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-string-iso-calendar': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/year/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/yearOfWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/basic': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/calendar-number': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/calendar-string': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/calendar-undefined': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/argument-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/fields-object': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/fields-string': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/calendarId/branding': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/calendarId/prop-desc': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/day/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/equals/calendars': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/getCalendar/branding': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/getCalendar/builtin': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/getCalendar/length': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/getCalendar/name': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/getCalendar/not-a-constructor': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/getCalendar/prop-desc': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/getISOFields/field-names': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/monthCode/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toJSON/calendarname': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toJSON/year-format': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toPlainDate/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toString/calendarname-always': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toString/calendarname-auto': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toString/calendarname-never': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toString/calendarname-undefined': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toString/calendarname-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toString/options-undefined': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toString/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toString/year-format': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/with/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainTime/from/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/getISOFields/field-traversal-order': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/basic': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/timezone-string': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/calendar-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/calendar-string': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/calendar-undefined': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/argument-plaindate': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/argument-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/argument-string': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/calendar-dateadd-called-with-plaindate-instance': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/calendar-datefromfields-called': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/custom-daysInMonth-irrelevant': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/calendarId/branding': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/calendarId/prop-desc': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/daysInMonth/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/daysInYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/equals/compare-calendar': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/getCalendar/branding': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/getCalendar/builtin': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/getCalendar/length': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/getCalendar/name': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/getCalendar/not-a-constructor': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/getCalendar/prop-desc': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/getISOFields/field-names': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/inLeapYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/month/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/monthCode/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/monthsInYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/mixed-calendar-invalid': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/calendar-arguments': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/calendar-arguments-extra-options': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/calendar-dateadd': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/calendar-dateadd-called-with-plaindate-instance': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/calendar-datefromfields-called': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/calendar-fromfields-called-with-null-prototype-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/custom-daysInMonth-irrelevant': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/options-undefined': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toPlainDate/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toString/calendarname-always': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toString/calendarname-auto': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toString/calendarname-never': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toString/calendarname-undefined': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toString/calendarname-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toString/options-undefined': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toString/order-of-operations': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/mixed-calendar-invalid': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/with/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/year/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/TimeZone/from/argument-object': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/order-of-operations': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/calendar-number': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/calendar-string': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/calendar-string-leap-second': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/calendar-undefined': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/toJSON/returns-identifier-slot': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/calendar-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/calendar-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/calendar-undefined': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-calendar-leap-second': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-calendar-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-string-time-separators': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/zoneddatetime-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/zoneddatetime-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/add/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/add/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/add/order-of-operations': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/calendarId/branding': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/calendarId/prop-desc': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/day/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/day/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/dayOfWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/dayOfWeek/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/dayOfYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/dayOfYear/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/daysInMonth/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/daysInMonth/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/daysInWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/daysInWeek/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/daysInYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/daysInYear/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/epochMicroseconds/basic': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/epochMilliseconds/basic': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/epochSeconds/basic': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getCalendar/branding': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getCalendar/builtin': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getCalendar/length': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getCalendar/name': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getCalendar/not-a-constructor': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getCalendar/prop-desc': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getISOFields/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getISOFields/custom': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getISOFields/field-names': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getTimeZone/branding': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getTimeZone/builtin': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getTimeZone/length': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getTimeZone/name': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getTimeZone/not-a-constructor': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getTimeZone/prop-desc': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/hour/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/inLeapYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/inLeapYear/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/microsecond/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/millisecond/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/minute/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/month/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/month/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/monthCode/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/monthCode/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/monthsInYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/monthsInYear/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/nanosecond/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/offset/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/offsetNanoseconds/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/round/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/round/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/round/order-of-operations': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/second/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/startOfDay/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/subtract/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/subtract/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/subtract/order-of-operations': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/timeZoneId/branding': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/timeZoneId/prop-desc': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toJSON/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainDate/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainDateTime/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainDateTime/plain-custom-timezone': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainMonthDay/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainMonthDay/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainTime/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainYearMonth/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainYearMonth/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/calendarname-always': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/calendarname-auto': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/calendarname-undefined': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/calendarname-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/options-undefined': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/timezonename-auto': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-timezone-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/weekOfYear/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/weekOfYear/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/calendar-case-insensitive': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/calendar-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/calendar-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/calendar-string-leap-second': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/subclassing-ignored': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/calendar-temporal-object': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainTime/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withTimeZone/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withTimeZone/timezone-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withTimeZone/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withTimeZone/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withTimeZone/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/year/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/year/builtin-timezone-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/yearOfWeek/builtin-calendar-no-observable-calls': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/timezone-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/timezone-string-leap-second': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/timezone-string-multiple-offsets': [FAIL],
+  'intl402/DateTimeFormat/prototype/formatRange/temporal-zoneddatetime-not-supported': [FAIL],
+  'intl402/DateTimeFormat/prototype/formatRangeToParts/temporal-zoneddatetime-not-supported': [FAIL],
+  'intl402/DateTimeFormat/prototype/format/temporal-zoneddatetime-not-supported': [FAIL],
+  'intl402/DateTimeFormat/prototype/formatToParts/temporal-zoneddatetime-not-supported': [FAIL],
+  'intl402/Locale/constructor-non-iana-canon': [FAIL],
+  'intl402/Locale/prototype/minimize/removing-likely-subtags-first-adds-likely-subtags': [FAIL],
+  'intl402/Temporal/Duration/prototype/round/relativeto-string-datetime': [FAIL],
+  'intl402/Temporal/Instant/prototype/toZonedDateTimeISO/timezone-string-datetime': [FAIL],
+  'intl402/Temporal/Instant/prototype/toZonedDateTime/timezone-string-datetime': [FAIL],
+  'intl402/Temporal/Now/plainDate/calendar-string': [FAIL],
+  'intl402/Temporal/Now/plainDateTime/calendar-string': [FAIL],
+  'intl402/Temporal/Now/zonedDateTime/calendar-string': [FAIL],
+  'intl402/Temporal/Now/zonedDateTime/calendar-timezone-string': [FAIL],
+  'intl402/Temporal/Now/zonedDateTimeISO/timezone-string': [FAIL],
+  'intl402/Temporal/Now/zonedDateTimeISO/timezone-string-datetime': [FAIL],
+  'intl402/Temporal/Now/zonedDateTime/timezone-string-datetime': [FAIL],
+  'intl402/Temporal/PlainDate/prototype/toZonedDateTime/timezone-string-datetime': [FAIL],
+  'intl402/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-string-datetime': [FAIL],
+  'intl402/Temporal/PlainDateTime/prototype/withPlainDate/argument-plaindate-calendar': [FAIL],
+  'intl402/Temporal/PlainDateTime/prototype/withPlainDate/argument-plaindate-calendar-noniso': [FAIL],
+  'intl402/Temporal/PlainDateTime/prototype/withPlainDate/argument-plaindate-calendar-same-id': [FAIL],
+  'intl402/Temporal/PlainDateTime/prototype/withPlainDate/argument-plaindate-calendar-same-object': [FAIL],
+  'intl402/Temporal/PlainDateTime/prototype/withPlainDate/argument-string-iso-calendar': [FAIL],
+  'intl402/Temporal/PlainMonthDay/from/reference-date-noniso-calendar': [FAIL],
+  'intl402/Temporal/PlainMonthDay/prototype/toLocaleString/calendar-mismatch': [FAIL],
+  'intl402/Temporal/PlainTime/prototype/toZonedDateTime/timezone-string-datetime': [FAIL],
+  'intl402/Temporal/PlainYearMonth/prototype/toLocaleString/calendar-mismatch': [FAIL],
+  'intl402/Temporal/TimeZone/from/argument-object': [FAIL],
+  'intl402/Temporal/ZonedDateTime/from/argument-propertybag-timezone-string-datetime': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/toLocaleString/custom-time-zone-name-not-supported': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/toLocaleString/locales-undefined': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/toLocaleString/offset-time-zone-not-supported': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/toLocaleString/options-timeZone': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/toLocaleString/options-timeZoneName-affects-instance-time-zone': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/toLocaleString/options-undefined': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/withCalendar/calendar-case-insensitive': [FAIL],
+  'staging/Temporal/Instant/old/toZonedDateTime': [FAIL],
+  'staging/Temporal/Regex/old/plaindate': [FAIL],
+  'staging/Temporal/Regex/old/plaindatetime': [FAIL],
+  'staging/Temporal/Regex/old/plainmonthday': [FAIL],
+  'staging/Temporal/Regex/old/plainyearmonth': [FAIL],
+  'staging/Temporal/UserCalendar/old/calendar-extra-fields': [FAIL],
+  'staging/Temporal/UserCalendar/old/calendar-non-trivial-mergefields': [FAIL],
+  'staging/Temporal/UserCalendar/old/trivial-protocol-implementation': [FAIL],
+  'staging/Temporal/UserCalendar/old/trivial-subclass': [FAIL],
+  'staging/Temporal/UserTimezone/old/subminute-offset': [FAIL],
+  'staging/Temporal/UserTimezone/old/trivial-protocol': [FAIL],
+  'staging/Temporal/UserTimezone/old/trivial-subclass': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/construction-and-properties': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/toPlainDate': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/toPlainMonthDay': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/toPlainYearMonth': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/toString': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/withCalendar': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/withPlainDate': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/withTimezone': [FAIL],
+
+  'built-ins/Temporal/Calendar/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/from/calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/missing-arguments': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateAdd/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateAdd/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateAdd/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateAdd/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateAdd/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateAdd/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dateUntil/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/day/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/day/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/day/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/day/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/day/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/day/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/day/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfWeek/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/dayOfYear/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInMonth/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInWeek/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInYear/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInYear/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInYear/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInYear/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInYear/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInYear/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/daysInYear/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/inLeapYear/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/month/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/month/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/month/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/month/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/month/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/month/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/month/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthCode/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthCode/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthCode/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthCode/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthCode/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthCode/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthCode/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthsInYear/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/weekOfYear/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/year/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/year/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/year/argument-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/year/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/year/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/year/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/year/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/yearOfWeek/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/Duration/compare/relativeto-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/Duration/compare/relativeto-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/from/argument-non-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/argument-not-object': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-number': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-number': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/argument-not-object': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-number': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-number': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-wrong-type': [FAIL],
+  'built-ins/Temporal/Instant/compare/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Instant/from/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Instant/prototype/add/argument-not-object': [FAIL],
+  'built-ins/Temporal/Instant/prototype/equals/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Instant/prototype/since/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Instant/prototype/subtract/argument-not-object': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toString/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Instant/prototype/until/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/Now/plainDate/calendar-undefined': [FAIL],
+  'built-ins/Temporal/Now/plainDateISO/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/calendar-undefined': [FAIL],
+  'built-ins/Temporal/Now/plainDateTimeISO/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Now/plainDate/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Now/plainTimeISO/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/Now/zonedDateTime/calendar-undefined': [FAIL],
+  'built-ins/Temporal/PlainDate/compare/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/compare/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/compare/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDate/compare/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDate/compare/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/compare/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/compare/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/from/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/add/argument-not-object': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/equals/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/since/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/subtract/argument-not-object': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainDateTime/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainDateTime/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainMonthDay/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainMonthDay/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainMonthDay/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainYearMonth/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainYearMonth/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toPlainYearMonth/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/toZonedDateTime/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/until/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/withCalendar/missing-argument': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/with/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/with/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/with/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/add/argument-not-object': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/subtract/argument-not-object': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toPlainMonthDay/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toPlainMonthDay/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toPlainMonthDay/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toPlainYearMonth/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toPlainYearMonth/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toPlainYearMonth/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/toZonedDateTime/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withCalendar/missing-argument': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/with/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/with/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainDate/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainTime/argument-number': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/withPlainTime/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/with/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/argument-number': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/equals/argument-number': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/equals/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/equals/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/equals/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/equals/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/equals/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/equals/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toPlainDate/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toPlainDate/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/toPlainDate/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/with/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/with/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/with/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainTime/compare/argument-number': [FAIL],
+  'built-ins/Temporal/PlainTime/compare/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/from/argument-number': [FAIL],
+  'built-ins/Temporal/PlainTime/from/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/add/argument-not-object': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/equals/argument-number': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/equals/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/since/argument-number': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/since/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/subtract/argument-not-object': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-number': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toPlainDateTime/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-number': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/toZonedDateTime/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/until/argument-number': [FAIL],
+  'built-ins/Temporal/PlainTime/prototype/until/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/compare/argument-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/compare/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/compare/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/compare/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/compare/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/compare/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/compare/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/argument-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/argument-not-object': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/add/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/equals/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/equals/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/equals/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/equals/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/argument-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/since/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/argument-not-object': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/subtract/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toPlainDate/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toPlainDate/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/toPlainDate/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/argument-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/until/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/with/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/with/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/with/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/TimeZone/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/basic': [FAIL],
+  'built-ins/Temporal/TimeZone/from/argument-primitive': [FAIL],
+  'built-ins/Temporal/TimeZone/missing-arguments': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-not-datetime': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-number': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getNextTransition/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getOffsetNanosecondsFor/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getOffsetStringFor/argument-not-absolute-getOffsetNanosecondsFor-override': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getOffsetStringFor/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/argument-not-absolute-getOffsetNanosecondsFor-override': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-not-datetime': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-number': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPreviousTransition/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/zoneddatetime-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/add/argument-not-object': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/zoneddatetime-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/zoneddatetime-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/subtract/argument-not-object': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toJSON/balance-negative-time-units': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainMonthDay/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainMonthDay/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainMonthDay/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainYearMonth/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainYearMonth/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toPlainYearMonth/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/balance-negative-time-units': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-invalid-offset-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/zoneddatetime-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withCalendar/missing-argument': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/offset-property-invalid-string': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-constructor-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-duplicate-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-propertybag-calendar-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-propertybag-calendar-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainDate/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainTime/argument-number': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/withPlainTime/argument-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/proto-in-calendar-fields': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/timezone-wrong-type': [FAIL],
+  'intl402/Temporal/Calendar/prototype/era/argument-constructor-in-calendar-fields': [FAIL],
+  'intl402/Temporal/Calendar/prototype/era/argument-duplicate-calendar-fields': [FAIL],
+  'intl402/Temporal/Calendar/prototype/era/argument-number': [FAIL],
+  'intl402/Temporal/Calendar/prototype/era/argument-propertybag-calendar-number': [FAIL],
+  'intl402/Temporal/Calendar/prototype/era/argument-propertybag-calendar-wrong-type': [FAIL],
+  'intl402/Temporal/Calendar/prototype/era/argument-proto-in-calendar-fields': [FAIL],
+  'intl402/Temporal/Calendar/prototype/era/argument-wrong-type': [FAIL],
+  'intl402/Temporal/Calendar/prototype/eraYear/argument-constructor-in-calendar-fields': [FAIL],
+  'intl402/Temporal/Calendar/prototype/eraYear/argument-duplicate-calendar-fields': [FAIL],
+  'intl402/Temporal/Calendar/prototype/eraYear/argument-number': [FAIL],
+  'intl402/Temporal/Calendar/prototype/eraYear/argument-propertybag-calendar-number': [FAIL],
+  'intl402/Temporal/Calendar/prototype/eraYear/argument-propertybag-calendar-wrong-type': [FAIL],
+  'intl402/Temporal/Calendar/prototype/eraYear/argument-proto-in-calendar-fields': [FAIL],
+  'intl402/Temporal/Calendar/prototype/eraYear/argument-wrong-type': [FAIL],
+  'staging/Temporal/Instant/old/toZonedDateTimeISO': [FAIL],
+  'staging/Temporal/ZonedDateTime/old/property-bags': [FAIL],
+
+  'built-ins/Temporal/Calendar/prototype/fields/argument-throws-invalid-keys': [FAIL],
+  'built-ins/Temporal/Calendar/prototype/monthDayFromFields/reference-year-1972': [FAIL],
+  'built-ins/Temporal/Duration/compare/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/Duration/compare/relativeto-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/Duration/prototype/add/relativeto-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/Duration/prototype/round/relativeto-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/Duration/prototype/subtract/relativeto-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/Duration/prototype/total/relativeto-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Instant/from/instant-string-sub-minute-offset': [FAIL],
+  'built-ins/Temporal/Instant/prototype/equals/instant-string-sub-minute-offset': [FAIL],
+  'built-ins/Temporal/Instant/prototype/since/instant-string-sub-minute-offset': [FAIL],
+  'built-ins/Temporal/Instant/prototype/toString/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Instant/prototype/until/instant-string-sub-minute-offset': [FAIL],
+  'built-ins/Temporal/Now/plainDateISO/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Now/plainDateTimeISO/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Now/plainDateTime/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Now/plainDate/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/Now/plainTimeISO/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/PlainDate/from/observable-get-overflow-argument-primitive': [FAIL],
+  'built-ins/Temporal/PlainDate/from/observable-get-overflow-argument-string-invalid': [FAIL],
+  'built-ins/Temporal/PlainDate/prototype/with/custom': [FAIL],
+  'built-ins/Temporal/PlainDateTime/compare/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/observable-get-overflow-argument-primitive': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/observable-get-overflow-argument-string-invalid': [FAIL],
+  'built-ins/Temporal/PlainDateTime/from/overflow-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/equals/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/since/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/until/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/with/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/with/calendar-options': [FAIL],
+  'built-ins/Temporal/PlainDateTime/prototype/with/overflow-wrong-type': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/observable-get-overflow-argument-primitive': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/from/observable-get-overflow-argument-string-invalid': [FAIL],
+  'built-ins/Temporal/PlainMonthDay/prototype/with/calendar-arguments': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/observable-get-overflow-argument-primitive': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/from/observable-get-overflow-argument-string-invalid': [FAIL],
+  'built-ins/Temporal/PlainYearMonth/prototype/with/calendar-arguments': [FAIL],
+  'built-ins/Temporal/TimeZone/from/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/argument-object': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/argument-primitive': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/argument-valid': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/branding': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/builtin': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/length': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/name': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/not-a-constructor': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/prop-desc': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/timezone-case-insensitive': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/timezone-string-multiple-offsets': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/equals/timezone-wrong-type': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getInstantFor/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPlainDateTimeFor/instant-string-sub-minute-offset': [FAIL],
+  'built-ins/Temporal/TimeZone/prototype/getPossibleInstantsFor/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/argument-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/compare/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/observable-get-overflow-argument-primitive': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/observable-get-overflow-argument-string-invalid': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/from/overflow-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-timezone-id-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/argument-propertybag-timezone-normalize-offset-strings':   [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/equals/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/getISOFields/order-of-operations': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-timezone-id-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/argument-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/since/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/timeZoneId/timezone-id-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toJSON/order-of-operations': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toJSON/timezone-id-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toLocaleString/timezone-id-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/toString/timezone-id-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-timezone-id-wrong-type': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/argument-propertybag-timezone-string-datetime': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/until/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/calendar-fields-iterable': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/calendar-options': [FAIL],
+  'built-ins/Temporal/ZonedDateTime/prototype/with/overflow-wrong-type': [FAIL],
+  'intl402/Temporal/Now/plainDateTimeISO/timezone-string-datetime': [FAIL],
+  'intl402/Temporal/TimeZone/basic': [FAIL],
+  'intl402/Temporal/TimeZone/etc-timezone': [FAIL],
+  'intl402/Temporal/TimeZone/from/argument-valid': [FAIL],
+  'intl402/Temporal/TimeZone/from/etc-timezone': [FAIL],
+  'intl402/Temporal/TimeZone/from/iana-legacy-names': [FAIL],
+  'intl402/Temporal/TimeZone/iana-legacy-names': [FAIL],
+  'intl402/Temporal/TimeZone/links-africa': [FAIL],
+  'intl402/Temporal/TimeZone/links-asia': [FAIL],
+  'intl402/Temporal/TimeZone/links-backward': [FAIL],
+  'intl402/Temporal/TimeZone/links-backzone': [FAIL],
+  'intl402/Temporal/TimeZone/links-etcetera': [FAIL],
+  'intl402/Temporal/TimeZone/links-europe': [FAIL],
+  'intl402/Temporal/TimeZone/links-northamerica': [FAIL],
+  'intl402/Temporal/TimeZone/non-canonical-utc': [FAIL],
+  'intl402/Temporal/TimeZone/prototype/equals/argument-object': [FAIL],
+  'intl402/Temporal/TimeZone/prototype/equals/argument-valid': [FAIL],
+  'intl402/Temporal/TimeZone/prototype/equals/canonical-iana-names': [FAIL],
+  'intl402/Temporal/TimeZone/prototype/equals/canonical-not-equal': [FAIL],
+  'intl402/Temporal/TimeZone/prototype/equals/offset-and-iana': [FAIL],
+  'intl402/Temporal/TimeZone/prototype/equals/timezone-case-insensitive': [FAIL],
+  'intl402/Temporal/ZonedDateTime/from/do-not-canonicalize-iana-identifiers': [FAIL],
+  'intl402/Temporal/ZonedDateTime/from/timezone-case-insensitive': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/equals/custom-time-zone-ids-case-sensitive': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/since/custom-time-zone-ids-case-sensitive': [FAIL],
+  'intl402/Temporal/ZonedDateTime/prototype/until/custom-time-zone-ids-case-sensitive': [FAIL],
+
+  # Temporal tests fail under i18n and passed in no i18n
+  'built-ins/Temporal/Duration/compare/constructor-in-calendar-fields':  [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/compare/duplicate-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/compare/proto-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/add/constructor-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/add/duplicate-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/add/proto-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/round/constructor-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/round/duplicate-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/round/proto-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/subtract/constructor-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/subtract/duplicate-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/subtract/proto-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/total/constructor-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/total/duplicate-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/Duration/prototype/total/proto-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/ZonedDateTime/from/constructor-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/ZonedDateTime/from/duplicate-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+  'built-ins/Temporal/ZonedDateTime/from/proto-in-calendar-fields': [['not i18n', PASS], ['i18n', FAIL]],
+
+
   # https://bugs.chromium.org/p/v8/issues/detail?id=12763
   'language/statements/class/decorator/syntax/valid/class-element-decorator-call-expr-identifier-reference': [FAIL],
   'language/statements/class/decorator/syntax/valid/class-element-decorator-member-expr-decorator-member-expr': [FAIL],
   'language/statements/class/decorator/syntax/valid/class-element-decorator-member-expr-identifier-reference': [FAIL],
   'language/statements/class/decorator/syntax/valid/class-element-decorator-parenthesized-expr-identifier-reference': [FAIL],
 
-  # https://bugs.chromium.org/p/v8/issues/detail?id=11660
-  # https://github.com/tc39/proposal-intl-duration-format/issues/114
-  'intl402/DurationFormat/prototype/format/style-options-en': [FAIL],
-
-  'intl402/DurationFormat/prototype/formatToParts/formatToParts-styles-en': [FAIL],
-
   # https://bugs.chromium.org/p/v8/issues/detail?id=12763
   'language/expressions/class/decorator/syntax/class-valid/decorator-member-expr-private-identifier': [FAIL],
   'language/expressions/class/decorator/syntax/valid/decorator-call-expr-identifier-reference': [FAIL],
@@ -1040,8 +2114,9 @@
   # https://bugs.chromium.org/p/v8/issues/detail?id=12681
   'built-ins/Array/prototype/push/set-length-zero-array-length-is-non-writable': [FAIL],
 
-  # https://bugs.chromium.org/p/v8/issues/detail?id=13791
-  'intl402/NumberFormat/constructor-roundingIncrement': [FAIL],
+  # https://bugs.chromium.org/p/v8/issues/detail?id=14288
+  'intl402/DateTimeFormat/timezone-case-insensitive': [FAIL],
+  'intl402/DateTimeFormat/timezone-not-canonicalized': [FAIL],
 
   ######################## NEEDS INVESTIGATION ###########################
 
@@ -1119,7 +2194,7 @@
 
 }],  # ALWAYS
 
-['no_i18n == True', {
+['not i18n', {
   # Unicode canonicalization is not available with i18n turned off.
   'built-ins/String/prototype/localeCompare/15.5.4.9_CE': [SKIP],
 
@@ -1233,7 +2308,10 @@
   'staging/Temporal/TimeZone/old/getInstantFor': [FAIL],
   'staging/Temporal/TimeZone/old/getNextTransition': [FAIL],
   'staging/Temporal/ZonedDateTime/old/construction-and-properties': [FAIL],
-}],  # no_i18n == True
+
+  # https://bugs.chromium.org/p/v8/issues/detail?id=11544
+  'built-ins/Temporal/ZonedDateTime/prototype/toLocaleString/builtin-timezone-no-observable-calls': [FAIL],
+}],  # not i18n
 
 ['arch == arm or arch == arm64 or arch == mips64 or arch == mips64el', {
 
diff --git a/deps/v8/test/test262/testcfg.py b/deps/v8/test/test262/testcfg.py
index 16eda7405f1e9c..4b4ed6c1fe4256 100644
--- a/deps/v8/test/test262/testcfg.py
+++ b/deps/v8/test/test262/testcfg.py
@@ -31,6 +31,8 @@
 import re
 import sys
 
+from pathlib import Path
+
 from testrunner.local import statusfile
 from testrunner.local import testsuite
 from testrunner.local import utils
@@ -40,9 +42,11 @@
 
 
 # TODO(littledan): move the flag mapping into the status file
+#
+# Multiple flags are allowed, separated by space.
 FEATURE_FLAGS = {
-    'Intl.NumberFormat-v3': '--harmony-intl-number-format-v3',
     'Intl.DurationFormat': '--harmony-intl-duration-format',
+    'Intl.Locale-info': '--harmony-intl-locale-info-func',
     'FinalizationRegistry': '--harmony-weak-refs-with-cleanup-some',
     'WeakRef': '--harmony-weak-refs-with-cleanup-some',
     'host-gc-required': '--expose-gc-as=v8GC',
@@ -55,28 +59,28 @@
     'regexp-v-flag': '--harmony-regexp-unicode-sets',
     'array-grouping': '--harmony-array-grouping',
     'change-array-by-copy': '--harmony-change-array-by-copy',
-    'symbols-as-weakmap-keys': '--harmony-symbol-as-weakmap-key',
     'String.prototype.isWellFormed': '--harmony-string-is-well-formed',
     'String.prototype.toWellFormed': '--harmony-string-is-well-formed',
     'arraybuffer-transfer': '--harmony-rab-gsab-transfer',
+    'json-parse-with-source': '--harmony-json-parse-with-source',
+    'iterator-helpers': '--harmony-iterator-helpers',
+    'set-methods': '--harmony-set-methods',
 }
 
 SKIPPED_FEATURES = set([])
 
-DATA = os.path.join(os.path.dirname(os.path.abspath(__file__)), "data")
-
-BASE_DIR = os.path.dirname(
-    os.path.dirname(os.path.dirname(os.path.abspath(__file__))))
+TEST262_DIR = Path(__file__).resolve().parent
+BASE_DIR = TEST262_DIR.parents[1]
 
 TEST_262_HARNESS_FILES = ["sta.js", "assert.js"]
 TEST_262_NATIVE_FILES = ["detachArrayBuffer.js"]
 
-TEST_262_SUITE_PATH = ["data", "test"]
-TEST_262_HARNESS_PATH = ["data", "harness"]
-TEST_262_TOOLS_ABS_PATH = [BASE_DIR, "third_party", "test262-harness", "src"]
-TEST_262_LOCAL_TESTS_PATH = ["local-tests", "test"]
+TEST_262_SUITE_PATH = Path("data") / "test"
+TEST_262_HARNESS_PATH = Path("data") / "harness"
+TEST_262_TOOLS_ABS_PATH = BASE_DIR / "third_party" / "test262-harness" / "src"
+TEST_262_LOCAL_TESTS_PATH = Path("local-tests") / "test"
 
-sys.path.append(os.path.join(*TEST_262_TOOLS_ABS_PATH))
+sys.path.append(str(TEST_262_TOOLS_ABS_PATH))
 
 
 class VariantsGenerator(testsuite.VariantsGenerator):
@@ -107,7 +111,7 @@ class TestLoader(testsuite.JSTestLoader):
   def test_dirs(self):
     return [
       self.test_root,
-      os.path.join(self.suite.root, *TEST_262_LOCAL_TESTS_PATH),
+      self.suite.root / TEST_262_LOCAL_TESTS_PATH,
     ]
 
   @property
@@ -127,18 +131,17 @@ class TestSuite(testsuite.TestSuite):
 
   def __init__(self, ctx, *args, **kwargs):
     super(TestSuite, self).__init__(ctx, *args, **kwargs)
-    self.test_root = os.path.join(self.root, *TEST_262_SUITE_PATH)
+    self.test_root = self.root / TEST_262_SUITE_PATH
     # TODO: this makes the TestLoader mutable, refactor it.
     self._test_loader.test_root = self.test_root
-    self.harnesspath = os.path.join(self.root, *TEST_262_HARNESS_PATH)
-    self.harness = [os.path.join(self.harnesspath, f)
-                    for f in TEST_262_HARNESS_FILES]
-    self.harness += [os.path.join(self.root, "harness-adapt.js")]
-    self.local_test_root = os.path.join(self.root, *TEST_262_LOCAL_TESTS_PATH)
+    self.harnesspath = self.root / TEST_262_HARNESS_PATH
+    self.harness = [self.harnesspath / f for f in TEST_262_HARNESS_FILES]
+    self.harness += [self.root / "harness-adapt.js"]
+    self.local_test_root = self.root / TEST_262_LOCAL_TESTS_PATH
     self.parse_test_record = self._load_parse_test_record()
 
   def _load_parse_test_record(self):
-    root = os.path.join(*TEST_262_TOOLS_ABS_PATH)
+    root = TEST_262_TOOLS_ABS_PATH
     f = None
     try:
       (f, pathname, description) = imp.find_module("parseTestRecord", [root])
@@ -172,6 +175,7 @@ def __init__(self, *args, **kwargs):
           .get('negative', {})
           .get('type', None)
     )
+    self._async = 'async' in self.test_record.get('flags', [])
 
     # We disallow combining FAIL_PHASE_ONLY with any other fail outcome types.
     # Outcome parsing logic in the base class converts all outcomes specified in
@@ -195,39 +199,39 @@ def _fail_phase_reverse(self):
     return 'fail-phase-reverse' in self.procid
 
   def __needs_harness_agent(self):
-    tokens = self.path.split(os.path.sep)
-    return tokens[:2] == ["built-ins", "Atomics"]
+    return self.path.parts[:2] == ("built-ins", "Atomics")
 
   def _get_files_params(self):
     harness_args = []
     if "raw" not in self.test_record.get("flags", []):
       harness_args = list(self.suite.harness)
-    return (harness_args + ([os.path.join(self.suite.root, "harness-agent.js")]
+    return (harness_args + ([self.suite.root / "harness-agent.js"]
                             if self.__needs_harness_agent() else []) +
-            ([os.path.join(self.suite.root, "harness-ishtmldda.js")]
+            ([self.suite.root / "harness-ishtmldda.js"]
              if "IsHTMLDDA" in self.test_record.get("features", []) else []) +
-            ([os.path.join(self.suite.root, "harness-adapt-donotevaluate.js")]
+            ([self.suite.root / "harness-adapt-donotevaluate.js"]
              if self.fail_phase_only and not self._fail_phase_reverse else []) +
-            ([os.path.join(self.suite.root, "harness-done.js")]
+            ([self.suite.root / "harness-done.js"]
              if "async" in self.test_record.get("flags", []) else []) +
             self._get_includes() +
             (["--module"] if "module" in self.test_record else []) +
             [self._get_source_path()])
 
   def _get_suite_flags(self):
-    return (
-        ["--ignore-unhandled-promises"] +
-        (["--throws"] if "negative" in self.test_record else []) +
-        (["--allow-natives-syntax"]
-         if "detachArrayBuffer.js" in self.test_record.get("includes", [])
-         else []) +
-        [flag for (feature, flag) in FEATURE_FLAGS.items()
-          if feature in self.test_record.get("features", [])] +
-        ["--no-arguments"]  # disable top-level arguments in d8
-    )
+    feature_flags = []
+    for (feature, flags_string) in FEATURE_FLAGS.items():
+      if feature in self.test_record.get("features", []):
+        for flag in flags_string.split(" "):
+          feature_flags.append(flag)
+    return (["--ignore-unhandled-promises"] +
+            (["--throws"] if "negative" in self.test_record else []) +
+            (["--allow-natives-syntax"] if "detachArrayBuffer.js"
+             in self.test_record.get("includes", []) else []) + feature_flags +
+            ["--no-arguments"]  # disable top-level arguments in d8
+           )
 
   def _get_includes(self):
-    return [os.path.join(self._base_path(filename), filename)
+    return [self._base_path(filename) / filename
             for filename in self.test_record.get("includes", [])]
 
   def _base_path(self, filename):
@@ -237,22 +241,24 @@ def _base_path(self, filename):
       return self.suite.harnesspath
 
   def _get_source_path(self):
-    filename = self.path + self._get_suffix()
-    path = os.path.join(self.suite.local_test_root, filename)
-    if os.path.exists(path):
+    path = self.suite.local_test_root / self.path_js
+    if path.exists():
       return path
-    return os.path.join(self.suite.test_root, filename)
+    return self.suite.test_root / self.path_js
 
   @property
   def output_proc(self):
     if self._expected_exception is not None:
       return test262.ExceptionOutProc(self.expected_outcomes,
                                       self._expected_exception,
-                                      self._fail_phase_reverse)
+                                      self._fail_phase_reverse, self._async)
     else:
       # We only support fail phase reverse on tests that expect an exception.
       assert not self._fail_phase_reverse
 
     if self.expected_outcomes == outproc.OUTCOMES_PASS:
-      return test262.PASS_NO_EXCEPTION
-    return test262.NoExceptionOutProc(self.expected_outcomes)
+      return test262.PassNoExceptionOutProc(self._async)
+    return test262.NoExceptionOutProc(self.expected_outcomes, self._async)
+
+  def skip_rdb(self, result):
+    return not result.has_unexpected_output
diff --git a/deps/v8/test/torque/test-torque.tq b/deps/v8/test/torque/test-torque.tq
index 661042399ca519..1c972821336dc4 100644
--- a/deps/v8/test/torque/test-torque.tq
+++ b/deps/v8/test/torque/test-torque.tq
@@ -683,8 +683,8 @@ macro TestCatch3(implicit context: Context)(): Smi {
 // IteratorBuiltinsAssembler match the signatures provided in
 // iterator.tq.
 @export
-transitioning macro TestIterator(implicit context: Context)(
-    o: JSReceiver, map: Map): void {
+transitioning macro TestIterator(
+    implicit context: Context)(o: JSReceiver, map: Map): void {
   try {
     const t1: JSAny = iterator::GetIteratorMethod(o);
     const t2: iterator::IteratorRecord = iterator::GetIterator(o);
@@ -1181,8 +1181,7 @@ class ExportedSubClassBase extends HeapObject {
 }
 
 @abstract
-class AbstractInternalClass extends HeapObject {
-}
+class AbstractInternalClass extends HeapObject {}
 
 class AbstractInternalClassSubclass1 extends AbstractInternalClass {}
 
@@ -1233,7 +1232,8 @@ macro TestFullyGeneratedClassWithElements(): void {
     data: 0,
     object: Undefined,
     entries: ...SmiGeneratorIterator {
-      value: 11
+      value:
+        11
     }
   };
   dcheck(object1.length == 3);
@@ -1253,7 +1253,8 @@ macro TestFullyGeneratedClassWithElements(): void {
     object: Undefined,
     entries: ...SmiGeneratorIterator{value: 3},
     more_entries: ...InternalClassStructElementGeneratorIterator {
-      value: 1
+      value:
+        1
     }
   };
 
@@ -1358,8 +1359,8 @@ struct TwoValues {
   b: Map;
 }
 
-builtin ReturnTwoValues(implicit context: Context)(
-    value: Smi, obj: HeapObject): TwoValues {
+builtin ReturnTwoValues(
+    implicit context: Context)(value: Smi, obj: HeapObject): TwoValues {
   return TwoValues{a: value + 1, b: obj.map};
 }
 
@@ -1413,3 +1414,17 @@ macro TestCreateLazyNodeFromTorque(): void {
   check(result4 == 30);
 }
 }
+
+builtin ThrowAsBuiltin(implicit context: Context)(str: String): never {
+  Throw(str);
+}
+
+builtin TestCallNever(implicit context: Context)(a: Smi): Smi {
+  if (a == 1) {
+    Throw('a == 1');
+  }
+  if (a == -1) {
+    ThrowAsBuiltin('a == -1');
+  }
+  return a;
+}
diff --git a/deps/v8/test/unittests/BUILD.gn b/deps/v8/test/unittests/BUILD.gn
index a0066140211e6d..6ae1d92d7390d9 100644
--- a/deps/v8/test/unittests/BUILD.gn
+++ b/deps/v8/test/unittests/BUILD.gn
@@ -71,6 +71,8 @@ v8_source_set("v8_heap_base_unittests_sources") {
   sources = [
     "heap/base/active-system-pages-unittest.cc",
     "heap/base/basic-slot-set-unittest.cc",
+    "heap/base/bytes-unittest.cc",
+    "heap/base/incremental-marking-schedule-unittest.cc",
     "heap/base/worklist-unittest.cc",
   ]
 
@@ -94,7 +96,9 @@ if (cppgc_is_standalone) {
   v8_executable("cppgc_unittests") {
     testonly = true
     if (v8_current_cpu == "riscv64" || v8_current_cpu == "riscv32") {
-      libs = [ "atomic" ]
+      if (!is_clang) {
+        libs = [ "atomic" ]
+      }
     }
 
     configs = [
@@ -137,7 +141,6 @@ v8_source_set("cppgc_unittests_sources") {
     "heap/cppgc/heap-registry-unittest.cc",
     "heap/cppgc/heap-statistics-collector-unittest.cc",
     "heap/cppgc/heap-unittest.cc",
-    "heap/cppgc/incremental-marking-schedule-unittest.cc",
     "heap/cppgc/liveness-broker-unittest.cc",
     "heap/cppgc/logging-unittest.cc",
     "heap/cppgc/marker-unittest.cc",
@@ -205,8 +208,8 @@ v8_executable("v8_unittests") {
 
   deps = [
     ":inspector_unittests_sources",
-    ":v8_unittests_sources",
     ":v8_heap_base_unittests_sources",
+    ":v8_unittests_sources",
     "../..:v8_for_testing",
     "../..:v8_libbase",
     "../..:v8_libplatform",
@@ -287,6 +290,7 @@ v8_source_set("v8_unittests_sources") {
     "base/platform/semaphore-unittest.cc",
     "base/platform/time-unittest.cc",
     "base/region-allocator-unittest.cc",
+    "base/smallmap-unittest.cc",
     "base/string-format-unittest.cc",
     "base/sys-info-unittest.cc",
     "base/template-utils-unittest.cc",
@@ -302,6 +306,7 @@ v8_source_set("v8_unittests_sources") {
     "codegen/factory-unittest.cc",
     "codegen/register-configuration-unittest.cc",
     "codegen/source-position-table-unittest.cc",
+    "common/thread-isolation-unittest.cc",
     "compiler-dispatcher/compiler-dispatcher-unittest.cc",
     "compiler-dispatcher/optimizing-compile-dispatcher-unittest.cc",
     "date/date-cache-unittest.cc",
@@ -324,7 +329,6 @@ v8_source_set("v8_unittests_sources") {
     "heap/allocation-observer-unittest.cc",
     "heap/bitmap-test-utils.h",
     "heap/bitmap-unittest.cc",
-    "heap/code-object-registry-unittest.cc",
     "heap/cppgc-js/embedder-roots-handler-unittest.cc",
     "heap/cppgc-js/traced-reference-unittest.cc",
     "heap/cppgc-js/unified-heap-snapshot-unittest.cc",
@@ -332,6 +336,7 @@ v8_source_set("v8_unittests_sources") {
     "heap/cppgc-js/unified-heap-utils.cc",
     "heap/cppgc-js/unified-heap-utils.h",
     "heap/cppgc-js/young-unified-heap-unittest.cc",
+    "heap/direct-handles-unittest.cc",
     "heap/gc-idle-time-handler-unittest.cc",
     "heap/gc-tracer-unittest.cc",
     "heap/global-handles-unittest.cc",
@@ -341,6 +346,7 @@ v8_source_set("v8_unittests_sources") {
     "heap/heap-utils.cc",
     "heap/heap-utils.h",
     "heap/index-generator-unittest.cc",
+    "heap/iterators-unittest.cc",
     "heap/lab-unittest.cc",
     "heap/list-unittest.cc",
     "heap/local-factory-unittest.cc",
@@ -393,6 +399,7 @@ v8_source_set("v8_unittests_sources") {
     "libsampler/signals-and-mutexes-unittest.cc",
     "logging/counters-unittest.cc",
     "logging/log-unittest.cc",
+    "maglev/node-type-unittest.cc",
     "numbers/bigint-unittest.cc",
     "numbers/conversions-unittest.cc",
     "numbers/diy-fp-unittest.cc",
@@ -467,6 +474,7 @@ v8_source_set("v8_unittests_sources") {
     "utils/version-unittest.cc",
     "zone/zone-allocator-unittest.cc",
     "zone/zone-chunk-list-unittest.cc",
+    "zone/zone-compact-set-unittest.cc",
     "zone/zone-unittest.cc",
     "zone/zone-vector-unittest.cc",
   ]
@@ -546,6 +554,7 @@ v8_source_set("v8_unittests_sources") {
       "compiler/simplified-operator-unittest.cc",
       "compiler/sloppy-equality-unittest.cc",
       "compiler/state-values-utils-unittest.cc",
+      "compiler/turboshaft/doubly-threaded-list-unittest.cc",
       "compiler/turboshaft/snapshot-table-unittest.cc",
       "compiler/turboshaft/turboshaft-typer-unittest.cc",
       "compiler/turboshaft/turboshaft-types-unittest.cc",
@@ -570,8 +579,8 @@ v8_source_set("v8_unittests_sources") {
       "asmjs/asm-scanner-unittest.cc",
       "asmjs/asm-types-unittest.cc",
       "compiler/int64-lowering-unittest.cc",
+      "compiler/wasm-address-reassociation-unittest.cc",
       "objects/wasm-backing-store-unittest.cc",
-      "wasm/control-transfer-unittest.cc",
       "wasm/decoder-unittest.cc",
       "wasm/function-body-decoder-unittest.cc",
       "wasm/leb-helper-unittest.cc",
@@ -618,7 +627,7 @@ v8_source_set("v8_unittests_sources") {
 
   if (v8_enable_conservative_stack_scanning) {
     sources += [ "heap/conservative-stack-visitor-unittest.cc" ]
-    sources += [ "heap/marking-inner-pointer-resolution-unittest.cc" ]
+    sources += [ "heap/inner-pointer-resolution-unittest.cc" ]
   }
 
   if (v8_enable_i18n_support) {
@@ -640,7 +649,7 @@ v8_source_set("v8_unittests_sources") {
     sources += [
       "assembler/disasm-arm64-unittest.cc",
       "assembler/macro-assembler-arm64-unittest.cc",
-      "codegen/pointer-auth-arm64-unittest.cc",
+      "execution/pointer-auth-arm64-unittest.cc",
     ]
     if (v8_enable_turbofan) {
       sources += [ "compiler/arm64/instruction-selector-arm64-unittest.cc" ]
diff --git a/deps/v8/test/unittests/api/access-check-unittest.cc b/deps/v8/test/unittests/api/access-check-unittest.cc
index 01c74ad67cf814..e090053aa099a0 100644
--- a/deps/v8/test/unittests/api/access-check-unittest.cc
+++ b/deps/v8/test/unittests/api/access-check-unittest.cc
@@ -168,15 +168,31 @@ TEST_F(AccessCheckTest, GetOwnPropertyDescriptor) {
       .FromJust();
 
   Context::Scope context_scope(accessing_context);
-  Local<Value> result =
-      CompileRun(isolate(),
-                 "Object.getOwnPropertyDescriptor(this, 'property')"
-                 "    .get.call(other);")
-          .ToLocalChecked();
-  EXPECT_TRUE(result->IsUndefined());
-  CompileRun(isolate(),
-             "Object.getOwnPropertyDescriptor(this, 'property')"
-             "    .set.call(other, 42);");
+  Local<String> no_access_str = NewString("no access");
+  Local<Value> result;
+  result = CompileRun(isolate(),
+                      "var m = null; "
+                      "try {"
+                      "  Object.getOwnPropertyDescriptor(this, 'property')"
+                      "      .get.call(other);"
+                      "} catch(e) {"
+                      "  m = e.message;"
+                      "};"
+                      "m")
+               .ToLocalChecked();
+  EXPECT_TRUE(no_access_str->Equals(accessing_context, result).FromJust());
+
+  result = CompileRun(isolate(),
+                      "var m = null; "
+                      "try {"
+                      "  Object.getOwnPropertyDescriptor(this, 'property')"
+                      "      .set.call(other, 42);"
+                      "} catch(e) {"
+                      "  m = e.message;"
+                      "};"
+                      "m")
+               .ToLocalChecked();
+  EXPECT_TRUE(no_access_str->Equals(accessing_context, result).FromJust());
 }
 
 class AccessRegressionTest : public AccessCheckTest {
@@ -189,7 +205,7 @@ class AccessRegressionTest : public AccessCheckTest {
 
     i::Handle<i::JSReceiver> r =
         Utils::OpenHandle(*Local<Function>::Cast(getter));
-    EXPECT_TRUE(r->IsJSFunction());
+    EXPECT_TRUE(IsJSFunction(*r));
     return i::Handle<i::JSFunction>::cast(r);
   }
 };
diff --git a/deps/v8/test/unittests/api/api-wasm-unittest.cc b/deps/v8/test/unittests/api/api-wasm-unittest.cc
index ab1f22b8e3f2ad..498ffbb1486e57 100644
--- a/deps/v8/test/unittests/api/api-wasm-unittest.cc
+++ b/deps/v8/test/unittests/api/api-wasm-unittest.cc
@@ -15,6 +15,7 @@
 #include "src/handles/global-handles.h"
 #include "src/wasm/wasm-features.h"
 #include "test/common/flag-utils.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -53,53 +54,59 @@ void WasmStreamingTestFinalizer(const WeakCallbackInfo<void>& data) {
 }
 
 void WasmStreamingCallbackTestCallbackIsCalled(
-    const FunctionCallbackInfo<Value>& args) {
+    const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   CHECK(!wasm_streaming_callback_got_called);
   wasm_streaming_callback_got_called = true;
 
   i::Handle<i::Object> global_handle =
-      reinterpret_cast<i::Isolate*>(args.GetIsolate())
+      reinterpret_cast<i::Isolate*>(info.GetIsolate())
           ->global_handles()
-          ->Create(*Utils::OpenHandle(*args.Data()));
+          ->Create(*Utils::OpenHandle(*info.Data()));
   i::GlobalHandles::MakeWeak(global_handle.location(), global_handle.location(),
                              WasmStreamingTestFinalizer,
                              WeakCallbackType::kParameter);
 }
 
 void WasmStreamingCallbackTestFinishWithSuccess(
-    const FunctionCallbackInfo<Value>& args) {
+    const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   std::shared_ptr<WasmStreaming> streaming =
-      WasmStreaming::Unpack(args.GetIsolate(), args.Data());
+      WasmStreaming::Unpack(info.GetIsolate(), info.Data());
   streaming->OnBytesReceived(kMinimalWasmModuleBytes,
                              arraysize(kMinimalWasmModuleBytes));
   streaming->Finish();
 }
 
 void WasmStreamingCallbackTestFinishWithFailure(
-    const FunctionCallbackInfo<Value>& args) {
+    const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   std::shared_ptr<WasmStreaming> streaming =
-      WasmStreaming::Unpack(args.GetIsolate(), args.Data());
+      WasmStreaming::Unpack(info.GetIsolate(), info.Data());
   streaming->Finish();
 }
 
 void WasmStreamingCallbackTestAbortWithReject(
-    const FunctionCallbackInfo<Value>& args) {
+    const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   std::shared_ptr<WasmStreaming> streaming =
-      WasmStreaming::Unpack(args.GetIsolate(), args.Data());
-  streaming->Abort(Object::New(args.GetIsolate()));
+      WasmStreaming::Unpack(info.GetIsolate(), info.Data());
+  streaming->Abort(Object::New(info.GetIsolate()));
 }
 
 void WasmStreamingCallbackTestAbortNoReject(
-    const FunctionCallbackInfo<Value>& args) {
+    const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   std::shared_ptr<WasmStreaming> streaming =
-      WasmStreaming::Unpack(args.GetIsolate(), args.Data());
+      WasmStreaming::Unpack(info.GetIsolate(), info.Data());
   streaming->Abort({});
 }
 
 void WasmStreamingCallbackTestOnBytesReceived(
-    const FunctionCallbackInfo<Value>& args) {
+    const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   std::shared_ptr<WasmStreaming> streaming =
-      WasmStreaming::Unpack(args.GetIsolate(), args.Data());
+      WasmStreaming::Unpack(info.GetIsolate(), info.Data());
 
   // The first bytes of the WebAssembly magic word.
   const uint8_t bytes[]{0x00, 0x61, 0x73};
@@ -107,9 +114,10 @@ void WasmStreamingCallbackTestOnBytesReceived(
 }
 
 void WasmStreamingMoreFunctionsCanBeSerializedCallback(
-    const FunctionCallbackInfo<Value>& args) {
+    const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   std::shared_ptr<WasmStreaming> streaming =
-      WasmStreaming::Unpack(args.GetIsolate(), args.Data());
+      WasmStreaming::Unpack(info.GetIsolate(), info.Data());
   streaming->SetMoreFunctionsCanBeSerializedCallback([](CompiledWasmModule) {});
 }
 
@@ -117,7 +125,7 @@ TEST_F(ApiWasmTest, WasmStreamingCallback) {
   TestWasmStreaming(WasmStreamingCallbackTestCallbackIsCalled,
                     Promise::kPending);
   CHECK(wasm_streaming_callback_got_called);
-  CollectAllAvailableGarbage();
+  InvokeMemoryReducingMajorGCs(i_isolate());
   CHECK(wasm_streaming_data_got_collected);
 }
 
@@ -161,7 +169,7 @@ TEST_F(ApiWasmTest, WasmStreamingSetCallback) {
 TEST_F(ApiWasmTest, WasmEnableDisableGC) {
   Local<Context> context_local = Context::New(isolate());
   Context::Scope context_scope(context_local);
-  i::Handle<i::Context> context = v8::Utils::OpenHandle(*context_local);
+  i::Handle<i::NativeContext> context = v8::Utils::OpenHandle(*context_local);
   // When using the flags, stringref and GC are controlled independently.
   {
     i::FlagScope<bool> flag_gc(&i::v8_flags.experimental_wasm_gc, false);
@@ -193,17 +201,44 @@ TEST_F(ApiWasmTest, WasmEnableDisableGC) {
   isolate()->SetWasmGCEnabledCallback([](auto) { return false; });
   EXPECT_FALSE(i_isolate()->IsWasmGCEnabled(context));
   EXPECT_FALSE(i_isolate()->IsWasmStringRefEnabled(context));
-  // TODO(crbug.com/1424350): Change (or just drop) this expectation when
-  // we enable inlining by default.
-  EXPECT_FALSE(i_isolate()->IsWasmInliningEnabled(context));
+  // Inlining is enabled in --future.
+  // TODO(chromium:1424350): Change this once inlining is enabled by default.
+  const bool expect_inlining = i::v8_flags.future;
+  EXPECT_EQ(expect_inlining, i_isolate()->IsWasmInliningEnabled(context));
   {
     auto enabled_features = i::wasm::WasmFeatures::FromIsolate(i_isolate());
     EXPECT_FALSE(enabled_features.has_gc());
     EXPECT_FALSE(enabled_features.has_stringref());
     EXPECT_FALSE(enabled_features.has_typed_funcref());
-    EXPECT_FALSE(enabled_features.has_inlining());
+    EXPECT_EQ(expect_inlining, enabled_features.has_inlining());
   }
   isolate()->SetWasmGCEnabledCallback(nullptr);
 }
 
+TEST_F(ApiWasmTest, WasmEnableDisableImportedStrings) {
+  Local<Context> context_local = Context::New(isolate());
+  Context::Scope context_scope(context_local);
+  i::Handle<i::NativeContext> context = v8::Utils::OpenHandle(*context_local);
+  // Test enabling/disabling via flag.
+  {
+    i::FlagScope<bool> flag_strings(
+        &i::v8_flags.experimental_wasm_imported_strings, true);
+    EXPECT_TRUE(i_isolate()->IsWasmImportedStringsEnabled(context));
+  }
+  {
+    i::FlagScope<bool> flag_strings(
+        &i::v8_flags.experimental_wasm_imported_strings, false);
+    EXPECT_FALSE(i_isolate()->IsWasmImportedStringsEnabled(context));
+  }
+  // Test enabling/disabling via callback.
+  isolate()->SetWasmImportedStringsEnabledCallback([](auto) { return true; });
+  EXPECT_TRUE(i_isolate()->IsWasmImportedStringsEnabled(context));
+  EXPECT_TRUE(
+      i::wasm::WasmFeatures::FromIsolate(i_isolate()).has_imported_strings());
+  isolate()->SetWasmImportedStringsEnabledCallback([](auto) { return false; });
+  EXPECT_FALSE(i_isolate()->IsWasmImportedStringsEnabled(context));
+  EXPECT_FALSE(
+      i::wasm::WasmFeatures::FromIsolate(i_isolate()).has_imported_strings());
+}
+
 }  // namespace v8
diff --git a/deps/v8/test/unittests/api/deserialize-unittest.cc b/deps/v8/test/unittests/api/deserialize-unittest.cc
index ab4d41f1477723..d175ccf64f2312 100644
--- a/deps/v8/test/unittests/api/deserialize-unittest.cc
+++ b/deps/v8/test/unittests/api/deserialize-unittest.cc
@@ -10,7 +10,7 @@
 #include "include/v8-primitive.h"
 #include "include/v8-script.h"
 #include "src/codegen/compilation-cache.h"
-#include "test/unittests/test-utils.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace v8 {
@@ -293,54 +293,55 @@ class MergeDeserializedCodeTest : public DeserializeTest {
   };
 
   template <typename T>
-  static i::SharedFunctionInfo GetSharedFunctionInfo(
+  static i::Tagged<i::SharedFunctionInfo> GetSharedFunctionInfo(
       Local<T> function_or_script) {
     i::Handle<i::JSFunction> i_function =
         i::Handle<i::JSFunction>::cast(Utils::OpenHandle(*function_or_script));
     return i_function->shared();
   }
 
-  static i::MaybeObject WeakOrSmi(i::Object obj) {
-    return obj.IsSmi()
+  static i::MaybeObject WeakOrSmi(i::Tagged<i::Object> obj) {
+    return IsSmi(obj)
                ? i::MaybeObject::FromSmi(i::Smi::cast(obj))
                : i::MaybeObject::MakeWeak(i::MaybeObject::FromObject(obj));
   }
 
   void ValidateStandaloneGraphAndPopulateArray(
-      i::SharedFunctionInfo toplevel_sfi, i::WeakFixedArray array,
-      bool lazy_should_be_compiled = false,
+      i::Tagged<i::SharedFunctionInfo> toplevel_sfi,
+      i::Tagged<i::WeakFixedArray> array, bool lazy_should_be_compiled = false,
       bool eager_should_be_compiled = true) {
     i::DisallowGarbageCollection no_gc;
-    CHECK(toplevel_sfi.is_compiled());
-    array.Set(kToplevelSfi, WeakOrSmi(toplevel_sfi));
-    array.Set(kToplevelFunctionData,
-              WeakOrSmi(toplevel_sfi.function_data(kAcquireLoad)));
-    array.Set(kToplevelFeedbackMetadata,
-              WeakOrSmi(toplevel_sfi.feedback_metadata()));
-    i::Script script = i::Script::cast(toplevel_sfi.script());
-    array.Set(kScript, WeakOrSmi(script));
-    i::WeakFixedArray sfis = script.shared_function_infos();
-    CHECK_EQ(sfis.length(), 4);
-    CHECK_EQ(sfis.Get(0), WeakOrSmi(toplevel_sfi));
-    i::SharedFunctionInfo eager =
-        i::SharedFunctionInfo::cast(sfis.Get(1).GetHeapObjectAssumeWeak());
-    CHECK_EQ(eager.is_compiled(), eager_should_be_compiled);
-    array.Set(kEagerSfi, WeakOrSmi(eager));
+    CHECK(toplevel_sfi->is_compiled());
+    array->Set(kToplevelSfi, WeakOrSmi(toplevel_sfi));
+    array->Set(kToplevelFunctionData,
+               WeakOrSmi(toplevel_sfi->function_data(kAcquireLoad)));
+    array->Set(kToplevelFeedbackMetadata,
+               WeakOrSmi(toplevel_sfi->feedback_metadata()));
+    i::Tagged<i::Script> script = i::Script::cast(toplevel_sfi->script());
+    array->Set(kScript, WeakOrSmi(script));
+    i::Tagged<i::WeakFixedArray> sfis = script->shared_function_infos();
+    CHECK_EQ(sfis->length(), 4);
+    CHECK_EQ(sfis->Get(0), WeakOrSmi(toplevel_sfi));
+    i::Tagged<i::SharedFunctionInfo> eager =
+        i::SharedFunctionInfo::cast(sfis->Get(1).GetHeapObjectAssumeWeak());
+    CHECK_EQ(eager->is_compiled(), eager_should_be_compiled);
+    array->Set(kEagerSfi, WeakOrSmi(eager));
     if (eager_should_be_compiled) {
-      array.Set(kEagerFunctionData,
-                WeakOrSmi(eager.function_data(kAcquireLoad)));
-      array.Set(kEagerFeedbackMetadata, WeakOrSmi(eager.feedback_metadata()));
-      i::SharedFunctionInfo iife =
-          i::SharedFunctionInfo::cast(sfis.Get(2).GetHeapObjectAssumeWeak());
-      CHECK(iife.is_compiled());
-      array.Set(kIifeSfi, WeakOrSmi(iife));
-      array.Set(kIifeFunctionData, WeakOrSmi(iife.function_data(kAcquireLoad)));
-      array.Set(kIifeFeedbackMetadata, WeakOrSmi(iife.feedback_metadata()));
+      array->Set(kEagerFunctionData,
+                 WeakOrSmi(eager->function_data(kAcquireLoad)));
+      array->Set(kEagerFeedbackMetadata, WeakOrSmi(eager->feedback_metadata()));
+      i::Tagged<i::SharedFunctionInfo> iife =
+          i::SharedFunctionInfo::cast(sfis->Get(2).GetHeapObjectAssumeWeak());
+      CHECK(iife->is_compiled());
+      array->Set(kIifeSfi, WeakOrSmi(iife));
+      array->Set(kIifeFunctionData,
+                 WeakOrSmi(iife->function_data(kAcquireLoad)));
+      array->Set(kIifeFeedbackMetadata, WeakOrSmi(iife->feedback_metadata()));
     }
-    i::SharedFunctionInfo lazy =
-        i::SharedFunctionInfo::cast(sfis.Get(3).GetHeapObjectAssumeWeak());
-    CHECK_EQ(lazy.is_compiled(), lazy_should_be_compiled);
-    array.Set(kLazySfi, WeakOrSmi(lazy));
+    i::Tagged<i::SharedFunctionInfo> lazy =
+        i::SharedFunctionInfo::cast(sfis->Get(3).GetHeapObjectAssumeWeak());
+    CHECK_EQ(lazy->is_compiled(), lazy_should_be_compiled);
+    array->Set(kLazySfi, WeakOrSmi(lazy));
   }
 
   void AgeBytecodeAndGC(ScriptObjectFlag sfis_to_age,
@@ -348,24 +349,17 @@ class MergeDeserializedCodeTest : public DeserializeTest {
                         i::Isolate* i_isolate) {
     for (int index = 0; index < kScriptObjectsCount; ++index) {
       if ((sfis_to_age & (1 << index)) == (1 << index)) {
-        i::BytecodeArray bytecode =
-            i::SharedFunctionInfo::cast(
-                original_objects->Get(index).GetHeapObjectAssumeWeak())
-                .GetBytecodeArray(i_isolate);
-        const int kAgingThreshold = 6;
-        for (int j = 0; j < kAgingThreshold; ++j) {
-          bytecode.MakeOlder();
-        }
+        i::Tagged<i::SharedFunctionInfo> sfi = i::SharedFunctionInfo::cast(
+            original_objects->Get(index).GetHeapObjectAssumeWeak());
+        i::SharedFunctionInfo::EnsureOldForTesting(sfi);
       }
     }
 
-    i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                         i::GarbageCollectionReason::kTesting);
+    InvokeMajorGC(i_isolate);
 
     // A second round of GC is necessary in case incremental marking had already
     // started before the bytecode was aged.
-    i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                         i::GarbageCollectionReason::kTesting);
+    InvokeMajorGC(i_isolate);
   }
 
   class MergeThread : public base::Thread {
@@ -380,19 +374,19 @@ class MergeDeserializedCodeTest : public DeserializeTest {
   };
 
   void RetainObjects(ScriptObjectFlag to_retain,
-                     i::WeakFixedArray original_objects,
-                     i::FixedArray retained_original_objects,
+                     i::Tagged<i::WeakFixedArray> original_objects,
+                     i::Tagged<i::FixedArray> retained_original_objects,
                      i::Isolate* i_isolate) {
     for (int index = 0; index < kScriptObjectsCount; ++index) {
       if ((to_retain & (1 << index)) == (1 << index)) {
-        i::MaybeObject maybe = original_objects.Get(index);
-        if (i::HeapObject heap_object;
+        i::MaybeObject maybe = original_objects->Get(index);
+        if (i::Tagged<i::HeapObject> heap_object;
             maybe.GetHeapObjectIfWeak(&heap_object)) {
-          retained_original_objects.set(index, heap_object);
+          retained_original_objects->set(index, heap_object);
           continue;
         }
       }
-      retained_original_objects.set(
+      retained_original_objects->set(
           index, i::ReadOnlyRoots(i_isolate).undefined_value());
     }
   }
@@ -509,8 +503,7 @@ class MergeDeserializedCodeTest : public DeserializeTest {
     // At this point, the original_objects array might still have pointers to
     // some old discarded content, such as UncompiledData from flushed
     // functions. GC again to clear it all out.
-    i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                         i::GarbageCollectionReason::kTesting);
+    InvokeMajorGC(i_isolate);
 
     // All tracked objects from the original Script should have been reused if
     // they're still alive.
@@ -668,19 +661,13 @@ TEST_F(MergeDeserializedCodeTest, MergeWithNoFollowUpWork) {
 
   // Age the top-level bytecode so that the Isolate compilation cache will
   // contain only the Script.
-  i::BytecodeArray bytecode =
-      GetSharedFunctionInfo(original_script).GetBytecodeArray(i_isolate);
-  const int kAgingThreshold = 6;
-  for (int j = 0; j < kAgingThreshold; ++j) {
-    bytecode.MakeOlder();
-  }
-  i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                       i::GarbageCollectionReason::kTesting);
+  i::SharedFunctionInfo::EnsureOldForTesting(
+      GetSharedFunctionInfo(original_script));
+  InvokeMajorGC(i_isolate);
 
   // A second round of GC is necessary in case incremental marking had already
   // started before the bytecode was aged.
-  i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                       i::GarbageCollectionReason::kTesting);
+  InvokeMajorGC(i_isolate);
 
   DeserializeThread deserialize_thread(ScriptCompiler::StartConsumingCodeCache(
       isolate(), std::make_unique<ScriptCompiler::CachedData>(
@@ -767,21 +754,14 @@ TEST_F(MergeDeserializedCodeTest, MergeThatCompilesLazyFunction) {
 
     // Age the top-level bytecode so that the Isolate compilation cache will
     // contain only the Script.
-    i::BytecodeArray bytecode =
-        GetSharedFunctionInfo(script).GetBytecodeArray(i_isolate);
-    const int kAgingThreshold = 6;
-    for (int j = 0; j < kAgingThreshold; ++j) {
-      bytecode.MakeOlder();
-    }
+    i::SharedFunctionInfo::EnsureOldForTesting(GetSharedFunctionInfo(script));
   }
 
-  i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                       i::GarbageCollectionReason::kTesting);
+  InvokeMajorGC(i_isolate);
 
   // A second round of GC is necessary in case incremental marking had already
   // started before the bytecode was aged.
-  i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                       i::GarbageCollectionReason::kTesting);
+  InvokeMajorGC(i_isolate);
 
   DeserializeThread deserialize_thread(ScriptCompiler::StartConsumingCodeCache(
       isolate(), std::make_unique<ScriptCompiler::CachedData>(
@@ -830,6 +810,8 @@ TEST_F(MergeDeserializedCodeTest, MergeThatStartsButDoesNotFinish) {
   IsolateAndContextScope scope(this);
   i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate());
   ScriptOrigin default_origin(isolate(), NewString(""));
+  i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+      i_isolate->heap());
 
   // Compile the script for the first time to produce code cache data.
   {
@@ -847,20 +829,14 @@ TEST_F(MergeDeserializedCodeTest, MergeThatStartsButDoesNotFinish) {
 
     // Age the top-level bytecode so that the Isolate compilation cache will
     // contain only the Script.
-    i::BytecodeArray bytecode =
-        GetSharedFunctionInfo(script).GetBytecodeArray(i_isolate);
-    for (int j = 0; j < i::v8_flags.bytecode_old_age; ++j) {
-      bytecode.MakeOlder();
-    }
+    i::SharedFunctionInfo::EnsureOldForTesting(GetSharedFunctionInfo(script));
   }
 
-  i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                       i::GarbageCollectionReason::kTesting);
+  InvokeMajorGC(i_isolate);
 
   // A second round of GC is necessary in case incremental marking had already
   // started before the bytecode was aged.
-  i_isolate->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                       i::GarbageCollectionReason::kTesting);
+  InvokeMajorGC(i_isolate);
 
   // Start several background deserializations.
   std::vector<std::unique_ptr<DeserializeThread>> deserialize_threads;
diff --git a/deps/v8/test/unittests/api/exception-unittest.cc b/deps/v8/test/unittests/api/exception-unittest.cc
index 957aeb24fa476a..456cdd0b26507c 100644
--- a/deps/v8/test/unittests/api/exception-unittest.cc
+++ b/deps/v8/test/unittests/api/exception-unittest.cc
@@ -17,28 +17,30 @@ namespace {
 
 class APIExceptionTest : public TestWithIsolate {
  public:
-  static void CEvaluate(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    v8::HandleScope scope(args.GetIsolate());
-    TryRunJS(args.GetIsolate(),
-             args[0]
-                 ->ToString(args.GetIsolate()->GetCurrentContext())
+  static void CEvaluate(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    CHECK(i::ValidateCallbackInfo(info));
+    v8::HandleScope scope(info.GetIsolate());
+    TryRunJS(info.GetIsolate(),
+             info[0]
+                 ->ToString(info.GetIsolate()->GetCurrentContext())
                  .ToLocalChecked());
   }
 
-  static void CCatcher(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    if (args.Length() < 1) {
-      args.GetReturnValue().Set(false);
+  static void CCatcher(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    CHECK(i::ValidateCallbackInfo(info));
+    if (info.Length() < 1) {
+      info.GetReturnValue().Set(false);
       return;
     }
-    v8::HandleScope scope(args.GetIsolate());
-    v8::TryCatch try_catch(args.GetIsolate());
+    v8::HandleScope scope(info.GetIsolate());
+    v8::TryCatch try_catch(info.GetIsolate());
     MaybeLocal<Value> result =
-        TryRunJS(args.GetIsolate(),
-                 args[0]
-                     ->ToString(args.GetIsolate()->GetCurrentContext())
+        TryRunJS(info.GetIsolate(),
+                 info[0]
+                     ->ToString(info.GetIsolate()->GetCurrentContext())
                      .ToLocalChecked());
     CHECK(!try_catch.HasCaught() || result.IsEmpty());
-    args.GetReturnValue().Set(try_catch.HasCaught());
+    info.GetReturnValue().Set(try_catch.HasCaught());
   }
 };
 
diff --git a/deps/v8/test/unittests/api/gc-callbacks-unittest.cc b/deps/v8/test/unittests/api/gc-callbacks-unittest.cc
index 1603d7709627d9..b54bce3c1886ce 100644
--- a/deps/v8/test/unittests/api/gc-callbacks-unittest.cc
+++ b/deps/v8/test/unittests/api/gc-callbacks-unittest.cc
@@ -28,7 +28,7 @@ class GCCallbacksTest : public internal::TestWithHeapInternalsAndContext {
     Local<Object> obj = Object::New(isolate);
     CHECK(!obj.IsEmpty());
 
-    current_test_->PreciseCollectAllGarbage();
+    current_test_->InvokeAtomicMajorGC();
   }
 
   static void EpilogueCallbackAlloc(v8::Isolate* isolate, v8::GCType,
@@ -47,7 +47,7 @@ class GCCallbacksTest : public internal::TestWithHeapInternalsAndContext {
     Local<Object> obj = Object::New(isolate);
     CHECK(!obj.IsEmpty());
 
-    current_test_->PreciseCollectAllGarbage();
+    current_test_->InvokeAtomicMajorGC();
   }
 
   static void PrologueCallback(v8::Isolate* isolate, v8::GCType,
@@ -127,26 +127,26 @@ TEST_F(GCCallbacksTest, GCCallbacks) {
   isolate->AddGCEpilogueCallback(EpilogueCallback);
   CHECK_EQ(0, prologue_call_count_);
   CHECK_EQ(0, epilogue_call_count_);
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK_EQ(1, prologue_call_count_);
   CHECK_EQ(1, epilogue_call_count_);
   isolate->AddGCPrologueCallback(PrologueCallbackSecond);
   isolate->AddGCEpilogueCallback(EpilogueCallbackSecond);
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK_EQ(2, prologue_call_count_);
   CHECK_EQ(2, epilogue_call_count_);
   CHECK_EQ(1, prologue_call_count_second_);
   CHECK_EQ(1, epilogue_call_count_second_);
   isolate->RemoveGCPrologueCallback(PrologueCallback);
   isolate->RemoveGCEpilogueCallback(EpilogueCallback);
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK_EQ(2, prologue_call_count_);
   CHECK_EQ(2, epilogue_call_count_);
   CHECK_EQ(2, prologue_call_count_second_);
   CHECK_EQ(2, epilogue_call_count_second_);
   isolate->RemoveGCPrologueCallback(PrologueCallbackSecond);
   isolate->RemoveGCEpilogueCallback(EpilogueCallbackSecond);
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK_EQ(2, prologue_call_count_);
   CHECK_EQ(2, epilogue_call_count_);
   CHECK_EQ(2, prologue_call_count_second_);
@@ -156,7 +156,7 @@ TEST_F(GCCallbacksTest, GCCallbacks) {
   CHECK_EQ(0, epilogue_call_count_alloc_);
   isolate->AddGCPrologueCallback(PrologueCallbackAlloc);
   isolate->AddGCEpilogueCallback(EpilogueCallbackAlloc);
-  PreciseCollectAllGarbage();
+  InvokeAtomicMajorGC();
   CHECK_EQ(1, prologue_call_count_alloc_);
   CHECK_EQ(1, epilogue_call_count_alloc_);
   isolate->RemoveGCPrologueCallback(PrologueCallbackAlloc);
diff --git a/deps/v8/test/unittests/api/interceptor-unittest.cc b/deps/v8/test/unittests/api/interceptor-unittest.cc
index 635bf6a0b72f8d..416f9bd1eb4c59 100644
--- a/deps/v8/test/unittests/api/interceptor-unittest.cc
+++ b/deps/v8/test/unittests/api/interceptor-unittest.cc
@@ -174,8 +174,10 @@ TEST_F(InterceptorLoggingTest, DispatchTest) {
   EXPECT_EQ(Run("obj.foo"), "named getter");
   EXPECT_EQ(Run("obj[42]"), "indexed getter");
 
-  EXPECT_EQ(Run("obj.foo = null"), "named setter, named descriptor");
-  EXPECT_EQ(Run("obj[42] = null"), "indexed setter, indexed descriptor");
+  EXPECT_EQ(Run("obj.foo = null"),
+            "named setter, named descriptor, named query");
+  EXPECT_EQ(Run("obj[42] = null"),
+            "indexed setter, indexed descriptor, indexed query");
 
   EXPECT_EQ(Run("Object.getOwnPropertyDescriptor(obj, 'foo')"),
             "named descriptor");
diff --git a/deps/v8/test/unittests/api/resource-constraints-unittest.cc b/deps/v8/test/unittests/api/resource-constraints-unittest.cc
index 0755ad72a5f8a9..886cbaecfe6978 100644
--- a/deps/v8/test/unittests/api/resource-constraints-unittest.cc
+++ b/deps/v8/test/unittests/api/resource-constraints-unittest.cc
@@ -3,20 +3,19 @@
 // found in the LICENSE file.
 
 #include "include/v8-isolate.h"
+#include "src/flags/flags.h"
 #include "src/heap/heap.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace v8 {
 
 TEST(ResourceConstraints, ConfigureDefaultsFromHeapSizeSmall) {
-  const size_t KB = static_cast<size_t>(i::KB);
   const size_t MB = static_cast<size_t>(i::MB);
-  const size_t pm = i::Heap::kPointerMultiplier;
   v8::ResourceConstraints constraints;
   constraints.ConfigureDefaultsFromHeapSize(1 * MB, 1 * MB);
   ASSERT_EQ(i::Heap::MinOldGenerationSize(),
             constraints.max_old_generation_size_in_bytes());
-  ASSERT_EQ(3 * 512 * pm * KB,
+  ASSERT_EQ(i::Heap::MinYoungGenerationSize(),
             constraints.max_young_generation_size_in_bytes());
   ASSERT_EQ(0u, constraints.initial_old_generation_size_in_bytes());
   ASSERT_EQ(0u, constraints.initial_young_generation_size_in_bytes());
@@ -25,30 +24,41 @@ TEST(ResourceConstraints, ConfigureDefaultsFromHeapSizeSmall) {
 TEST(ResourceConstraints, ConfigureDefaultsFromHeapSizeLarge) {
   const size_t KB = static_cast<size_t>(i::KB);
   const size_t MB = static_cast<size_t>(i::MB);
+  const size_t GB = static_cast<size_t>(i::GB);
   const size_t pm = i::Heap::kPointerMultiplier;
   v8::ResourceConstraints constraints;
-  constraints.ConfigureDefaultsFromHeapSize(100u * MB, 3000u * MB);
-  ASSERT_EQ(3000u * MB - 3 * 8192 * pm * KB,
-            constraints.max_old_generation_size_in_bytes());
-  ASSERT_EQ(3 * 8192 * pm * KB,
+  constraints.ConfigureDefaultsFromHeapSize(50u * MB, 3u * GB);
+  // Check that for large heap sizes max semi space size is set to the maximum
+  // supported capacity (i.e. 8MB with pointer compression and 16MB without;
+  // MinorMS supports double capacity).
+  ASSERT_EQ(internal::v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                                        : 3 * 8 * pm * MB,
             constraints.max_young_generation_size_in_bytes());
-  ASSERT_EQ(100u * MB - 3 * 512 * pm * KB,
-            constraints.initial_old_generation_size_in_bytes());
-  ASSERT_EQ(3 * 512 * pm * KB,
+  ASSERT_EQ(3u * GB - (internal::v8_flags.minor_ms
+                           ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                           : 3 * 8 * pm * MB),
+            constraints.max_old_generation_size_in_bytes());
+  // Check that for small initial heap sizes initial semi space size is set to
+  // the minimum supported capacity (i.e. 1MB with pointer compression and 512KB
+  // without).
+  ASSERT_EQ((internal::v8_flags.minor_ms ? 2 : 3) * 512 * pm * KB,
             constraints.initial_young_generation_size_in_bytes());
+  ASSERT_EQ(50u * MB - (internal::v8_flags.minor_ms ? 2 : 3) * 512 * pm * KB,
+            constraints.initial_old_generation_size_in_bytes());
 }
 
 TEST(ResourceConstraints, ConfigureDefaults) {
-  const size_t KB = static_cast<size_t>(i::KB);
   const size_t MB = static_cast<size_t>(i::MB);
+  const size_t GB = static_cast<size_t>(i::GB);
   const size_t pm = i::Heap::kPointerMultiplier;
   const size_t hlm = i::Heap::kHeapLimitMultiplier;
   v8::ResourceConstraints constraints;
-  constraints.ConfigureDefaults(2048u * MB, 0u);
+  constraints.ConfigureDefaults(2u * GB, 0u);
   ASSERT_EQ(512u * hlm * MB, constraints.max_old_generation_size_in_bytes());
-  ASSERT_EQ(3 * 4096 * pm * KB,
-            constraints.max_young_generation_size_in_bytes());
   ASSERT_EQ(0u, constraints.initial_old_generation_size_in_bytes());
+  ASSERT_EQ(internal::v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                                        : 3 * 4 * pm * MB,
+            constraints.max_young_generation_size_in_bytes());
   ASSERT_EQ(0u, constraints.initial_young_generation_size_in_bytes());
 }
 
diff --git a/deps/v8/test/unittests/api/v8-script-unittest.cc b/deps/v8/test/unittests/api/v8-script-unittest.cc
index 79de0c2c670b03..cd07df98527359 100644
--- a/deps/v8/test/unittests/api/v8-script-unittest.cc
+++ b/deps/v8/test/unittests/api/v8-script-unittest.cc
@@ -2,6 +2,8 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include "include/v8-script.h"
+
 #include <algorithm>
 
 #include "include/v8-context.h"
@@ -10,6 +12,8 @@
 #include "include/v8-primitive.h"
 #include "include/v8-template.h"
 #include "src/objects/objects-inl.h"
+#include "test/common/flag-utils.h"
+#include "test/common/streaming-helper.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -109,6 +113,52 @@ class ScriptTest : public TestWithContext {
   }
 };
 
+class CompileHintsTest : public ScriptTest {
+ protected:
+  std::vector<int> ProduceCompileHintsHelper(
+      std::initializer_list<const char*> sources) {
+    const char* url = "http://www.foo.com/foo.js";
+    v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
+
+    Local<Script> top_level_script;
+    bool first = true;
+    for (auto source : sources) {
+      v8::ScriptCompiler::Source script_source(NewString(source), origin);
+      Local<Script> script =
+          v8::ScriptCompiler::Compile(
+              v8_context(), &script_source,
+              v8::ScriptCompiler::CompileOptions::kProduceCompileHints)
+              .ToLocalChecked();
+      if (first) {
+        top_level_script = script;
+        first = false;
+      }
+
+      v8::MaybeLocal<v8::Value> result = script->Run(v8_context());
+      EXPECT_FALSE(result.IsEmpty());
+    }
+    return top_level_script->GetProducedCompileHints();
+  }
+
+  bool FunctionIsCompiled(const char* name) {
+    const char* url = "http://www.foo.com/foo.js";
+    v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
+
+    v8::ScriptCompiler::Source script_source(NewString(name), origin);
+
+    Local<Script> script =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result = script->Run(v8_context());
+
+    auto function = i::Handle<i::JSFunction>::cast(
+        Utils::OpenHandle(*result.ToLocalChecked()));
+    i::Builtin builtin = function->code()->builtin_id();
+
+    return builtin != i::Builtin::kCompileLazy;
+  }
+};
+
 }  // namespace
 
 TEST_F(ScriptTest, UnboundScriptPosition) {
@@ -129,6 +179,58 @@ TEST_F(ScriptTest, UnboundScriptPosition) {
   EXPECT_EQ(0, column_number);
 }
 
+TEST_F(ScriptTest, GetSourceMappingUrlFromComment) {
+  const char* url = "http://www.foo.com/foo.js";
+  v8::ScriptOrigin origin(isolate(), NewString(url));
+  v8::ScriptCompiler::Source script_source(
+      NewString("var foo;\n//# sourceMappingURL=foo.js.map"), origin);
+
+  Local<Script> script =
+      v8::ScriptCompiler::Compile(v8_context(), &script_source)
+          .ToLocalChecked();
+  EXPECT_EQ(
+      "foo.js.map",
+      from_v8_string(
+          isolate(),
+          script->GetUnboundScript()->GetSourceMappingURL().As<String>()));
+}
+
+TEST_F(ScriptTest, OriginSourceMapOverridesSourceMappingUrlComment) {
+  const char* url = "http://www.foo.com/foo.js";
+  const char* api_source_map = "http://override/foo.js.map";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0, false, -1,
+                          NewString(api_source_map));
+  v8::ScriptCompiler::Source script_source(
+      NewString("var foo;\n//# sourceMappingURL=foo.js.map"), origin);
+
+  Local<Script> script =
+      v8::ScriptCompiler::Compile(v8_context(), &script_source)
+          .ToLocalChecked();
+  EXPECT_EQ(
+      api_source_map,
+      from_v8_string(
+          isolate(),
+          script->GetUnboundScript()->GetSourceMappingURL().As<String>()));
+}
+
+TEST_F(ScriptTest, IgnoreOriginSourceMapEmptyString) {
+  const char* url = "http://www.foo.com/foo.js";
+  const char* api_source_map = "";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0, false, -1,
+                          NewString(api_source_map));
+  v8::ScriptCompiler::Source script_source(
+      NewString("var foo;\n//# sourceMappingURL=foo.js.map"), origin);
+
+  Local<Script> script =
+      v8::ScriptCompiler::Compile(v8_context(), &script_source)
+          .ToLocalChecked();
+  EXPECT_EQ(
+      "foo.js.map",
+      from_v8_string(
+          isolate(),
+          script->GetUnboundScript()->GetSourceMappingURL().As<String>()));
+}
+
 TEST_F(ScriptTest, GetSingleStalledTopLevelAwaitMessage) {
   TestGetStalledTopLevelAwaitMessage("import 'stall.mjs';", {"stall.mjs"});
 }
@@ -230,34 +332,34 @@ TEST_F(ScriptTest, ProduceCompileHints) {
   }
 }
 
-namespace {
-bool CompileHintsCallback(int position, void* data) {
-  std::vector<int>* hints = reinterpret_cast<std::vector<int>*>(data);
-  return std::find(hints->begin(), hints->end(), position) != hints->end();
-}
-}  // namespace
-
-TEST_F(ScriptTest, LocalCompileHints) {
+TEST_F(ScriptTest, ProduceCompileHintsForArrowFunctions) {
   const char* url = "http://www.foo.com/foo.js";
   v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
-  v8::Local<v8::Context> context = v8::Context::New(isolate());
 
-  // Produce compile hints.
-  std::vector<int> compile_hints;
+  const char* code = "lazy1 = () => {}; (() => { lazy2 = () => {} })()";
+  v8::ScriptCompiler::Source script_source(NewString(code), origin);
+
+  // Test producing compile hints.
   {
-    // Run the top level code.
-    const char* code = "function lazy1() {} function lazy2() {}";
-    v8::ScriptCompiler::Source script_source(NewString(code), origin);
     Local<Script> script =
         v8::ScriptCompiler::Compile(
             v8_context(), &script_source,
             v8::ScriptCompiler::CompileOptions::kProduceCompileHints)
             .ToLocalChecked();
+    {
+      auto compile_hints = script->GetProducedCompileHints();
+      EXPECT_EQ(0u, compile_hints.size());
+    }
 
+    v8::Local<v8::Context> context = v8::Context::New(isolate());
     v8::MaybeLocal<v8::Value> result = script->Run(context);
     EXPECT_FALSE(result.IsEmpty());
+    {
+      auto compile_hints = script->GetProducedCompileHints();
+      EXPECT_EQ(0u, compile_hints.size());
+    }
 
-    // Run lazy1.
+    // Call one of the lazy functions and retrieve compile hints again.
     const char* code2 = "lazy1();";
     v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
 
@@ -266,18 +368,50 @@ TEST_F(ScriptTest, LocalCompileHints) {
             .ToLocalChecked();
     v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
     EXPECT_FALSE(result2.IsEmpty());
+    {
+      auto compile_hints = script->GetProducedCompileHints();
+      EXPECT_EQ(1u, compile_hints.size());
+      EXPECT_EQ(8, compile_hints[0]);
+    }
 
-    // Retrieve compile hints.
-    compile_hints = script->GetProducedCompileHints();
-    EXPECT_EQ(1u, compile_hints.size());
+    // Call the other lazy function and retrieve the compile hints again.
+    const char* code3 = "lazy2();";
+    v8::ScriptCompiler::Source script_source3(NewString(code3), origin);
+
+    Local<Script> script3 =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source3)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result3 = script3->Run(context);
+    EXPECT_FALSE(result3.IsEmpty());
+    {
+      auto compile_hints = script->GetProducedCompileHints();
+      EXPECT_EQ(1u, compile_hints.size());
+      EXPECT_EQ(35, compile_hints[0]);
+    }
   }
+}
+
+namespace {
+bool CompileHintsCallback(int position, void* data) {
+  std::vector<int>* hints = reinterpret_cast<std::vector<int>*>(data);
+  return std::find(hints->begin(), hints->end(), position) != hints->end();
+}
+}  // namespace
+
+TEST_F(CompileHintsTest, ConsumeCompileHints) {
+  const char* url = "http://www.foo.com/foo.js";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
+  v8::Local<v8::Context> context = v8::Context::New(isolate());
+
+  // Produce compile hints which we'll use as data later. The function positions
+  // must match the script we're compiling later, but we'll change the script
+  // source code to make sure that 1) the compile result is not coming from a
+  // cache 2) we're querying the correct functions.
+  std::vector<int> compile_hints = ProduceCompileHintsHelper(
+      {"function lazy1() {} function lazy2() {}", "lazy1()"});
 
-  // Consume compile hints. We use the produced compile hints to test that the
-  // positions of the requested compile hints match the positions of the
-  // produced compile hints.
   {
-    // Artificially change the code so that the isolate cache won't hit.
-    const char* code = "function lazy1() {} function lazy2() {} //";
+    const char* code = "function func1() {} function func2() {}";
     v8::ScriptCompiler::Source script_source(
         NewString(code), origin, CompileHintsCallback,
         reinterpret_cast<void*>(&compile_hints));
@@ -286,44 +420,321 @@ TEST_F(ScriptTest, LocalCompileHints) {
             v8_context(), &script_source,
             v8::ScriptCompiler::CompileOptions::kConsumeCompileHints)
             .ToLocalChecked();
-    USE(script);
 
-    // Retrieve the function object for lazy1.
-    {
-      const char* code2 = "lazy1";
-      v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+    v8::MaybeLocal<v8::Value> result = script->Run(context);
+    EXPECT_FALSE(result.IsEmpty());
+  }
 
-      Local<Script> script2 =
-          v8::ScriptCompiler::Compile(v8_context(), &script_source2)
-              .ToLocalChecked();
-      v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+  EXPECT_TRUE(FunctionIsCompiled("func1"));
+  EXPECT_FALSE(FunctionIsCompiled("func2"));
+}
+
+TEST_F(CompileHintsTest, ConsumeCompileHintsForArrowFunctions) {
+  const char* url = "http://www.foo.com/foo.js";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
+  v8::Local<v8::Context> context = v8::Context::New(isolate());
 
-      auto function = i::Handle<i::JSFunction>::cast(
-          Utils::OpenHandle(*result2.ToLocalChecked()));
-      i::Builtin builtin = function->code().builtin_id();
+  // Produce compile hints which we'll use as data later. The function positions
+  // must match the script we're compiling later, but we'll change the script
+  // source code to make sure that 1) the compile result is not coming from a
+  // cache 2) we're querying the correct functions.
+  std::vector<int> compile_hints = ProduceCompileHintsHelper(
+      {"lazy1 = (a, b, c) => {}; lazy2 = () => {}", "lazy1()"});
 
-      // lazy1 was not compiled lazily (there was a compile hint for it).
-      EXPECT_NE(i::Builtin::kCompileLazy, builtin);
-    }
+  {
+    const char* code = "func1 = (a, b, c) => {}; func2 = () => {}";
+    v8::ScriptCompiler::Source script_source(
+        NewString(code), origin, CompileHintsCallback,
+        reinterpret_cast<void*>(&compile_hints));
+    Local<Script> script =
+        v8::ScriptCompiler::Compile(
+            v8_context(), &script_source,
+            v8::ScriptCompiler::CompileOptions::kConsumeCompileHints)
+            .ToLocalChecked();
 
-    // Retrieve the function object for lazy2.
-    {
-      const char* code2 = "lazy2";
-      v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+    v8::MaybeLocal<v8::Value> result = script->Run(context);
+    EXPECT_FALSE(result.IsEmpty());
+  }
 
-      Local<Script> script2 =
-          v8::ScriptCompiler::Compile(v8_context(), &script_source2)
-              .ToLocalChecked();
-      v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+  EXPECT_TRUE(FunctionIsCompiled("func1"));
+  EXPECT_FALSE(FunctionIsCompiled("func2"));
+}
+
+TEST_F(CompileHintsTest, StreamingCompileHints) {
+  const char* url = "http://www.foo.com/foo.js";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
 
-      auto function = i::Handle<i::JSFunction>::cast(
-          Utils::OpenHandle(*result2.ToLocalChecked()));
+  // Produce compile hints which we'll use as data later. The function positions
+  // must match the script we're compiling later, but we'll change the script
+  // source code to make sure that 1) the compile result is not coming from a
+  // cache 2) we're querying the correct functions.
+  std::vector<int> compile_hints = ProduceCompileHintsHelper(
+      {"function lazy1() {} function lazy2() {}", "lazy1()"});
+
+  // Consume compile hints.
+  const char* chunks[] = {
+      "function func1() {} function fu"
+      "nc2() {}",
+      nullptr};
+
+  v8::ScriptCompiler::StreamedSource source(
+      std::make_unique<i::TestSourceStream>(chunks),
+      v8::ScriptCompiler::StreamedSource::ONE_BYTE);
+  std::unique_ptr<v8::ScriptCompiler::ScriptStreamingTask> task(
+      v8::ScriptCompiler::StartStreaming(isolate(), &source,
+                                         v8::ScriptType::kClassic,
+                                         ScriptCompiler::kConsumeCompileHints,
+                                         CompileHintsCallback, &compile_hints));
+
+  // TestSourceStream::GetMoreData won't block, so it's OK to just join the
+  // background task.
+  StreamerThread::StartThreadForTaskAndJoin(task.get());
+  task.reset();
+
+  std::unique_ptr<char[]> full_source(
+      i::TestSourceStream::FullSourceString(chunks));
+
+  v8::Local<Script> script =
+      v8::ScriptCompiler::Compile(v8_context(), &source,
+                                  NewString(full_source.get()), origin)
+          .ToLocalChecked();
 
-      i::Builtin builtin = function->code().builtin_id();
+  v8::MaybeLocal<v8::Value> result = script->Run(v8_context());
+  EXPECT_FALSE(result.IsEmpty());
 
-      // lazy2 was compiled lazily (there was no compile hint for it).
-      EXPECT_EQ(i::Builtin::kCompileLazy, builtin);
-    }
+  EXPECT_TRUE(FunctionIsCompiled("func1"));
+  EXPECT_FALSE(FunctionIsCompiled("func2"));
+}
+
+TEST_F(ScriptTest, CompileHintsMagicCommentBasic) {
+  i::FlagScope<bool> flag_scope(&i::v8_flags.compile_hints_magic, true);
+
+  const char* url = "http://www.foo.com/foo.js";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
+  v8::Local<v8::Context> context = v8::Context::New(isolate());
+
+  // Run the top level code.
+  const char* code =
+      "//# experimentalChromiumCompileHints=all\n"
+      "function f1() {}\n"
+      "let f2 = function() { }";
+  v8::ScriptCompiler::Source script_source(NewString(code), origin);
+  Local<Script> script =
+      v8::ScriptCompiler::Compile(
+          v8_context(), &script_source,
+          v8::ScriptCompiler::CompileOptions::kProduceCompileHints)
+          .ToLocalChecked();
+
+  v8::MaybeLocal<v8::Value> result = script->Run(context);
+  EXPECT_FALSE(result.IsEmpty());
+
+  // Retrieve the function object for f1.
+  {
+    const char* code2 = "f1";
+    v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+
+    Local<Script> script2 =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source2)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+
+    auto function = i::Handle<i::JSFunction>::cast(
+        Utils::OpenHandle(*result2.ToLocalChecked()));
+    i::Builtin builtin = function->code()->builtin_id();
+
+    // f1 was not compiled lazily.
+    EXPECT_NE(i::Builtin::kCompileLazy, builtin);
+  }
+
+  // Retrieve the function object for f2.
+  {
+    const char* code2 = "f2";
+    v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+
+    Local<Script> script2 =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source2)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+
+    auto function = i::Handle<i::JSFunction>::cast(
+        Utils::OpenHandle(*result2.ToLocalChecked()));
+    i::Builtin builtin = function->code()->builtin_id();
+
+    // f2 was not compiled lazily.
+    EXPECT_NE(i::Builtin::kCompileLazy, builtin);
+  }
+}
+
+TEST_F(ScriptTest, CompileHintsMagicCommentBetweenFunctions) {
+  i::FlagScope<bool> flag_scope(&i::v8_flags.compile_hints_magic, true);
+
+  const char* url = "http://www.foo.com/foo.js";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
+  v8::Local<v8::Context> context = v8::Context::New(isolate());
+
+  // Run the top level code.
+  const char* code =
+      "function f1() {}\n"
+      "//# experimentalChromiumCompileHints=all\n"
+      "function f2() {}";
+  v8::ScriptCompiler::Source script_source(NewString(code), origin);
+  Local<Script> script =
+      v8::ScriptCompiler::Compile(
+          v8_context(), &script_source,
+          v8::ScriptCompiler::CompileOptions::kProduceCompileHints)
+          .ToLocalChecked();
+
+  v8::MaybeLocal<v8::Value> result = script->Run(context);
+  EXPECT_FALSE(result.IsEmpty());
+
+  // Retrieve the function object for f1.
+  {
+    const char* code2 = "f1";
+    v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+
+    Local<Script> script2 =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source2)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+
+    auto function = i::Handle<i::JSFunction>::cast(
+        Utils::OpenHandle(*result2.ToLocalChecked()));
+    i::Builtin builtin = function->code()->builtin_id();
+
+    // f1 was compiled lazily.
+    EXPECT_EQ(i::Builtin::kCompileLazy, builtin);
+  }
+
+  // Retrieve the function object for f2.
+  {
+    const char* code2 = "f2";
+    v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+
+    Local<Script> script2 =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source2)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+
+    auto function = i::Handle<i::JSFunction>::cast(
+        Utils::OpenHandle(*result2.ToLocalChecked()));
+
+    i::Builtin builtin = function->code()->builtin_id();
+
+    // f2 was not compiled lazily.
+    EXPECT_NE(i::Builtin::kCompileLazy, builtin);
+  }
+}
+
+TEST_F(ScriptTest, CompileHintsMagicCommentInvalid) {
+  i::FlagScope<bool> flag_scope(&i::v8_flags.compile_hints_magic, true);
+
+  const char* url = "http://www.foo.com/foo.js";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
+  v8::Local<v8::Context> context = v8::Context::New(isolate());
+
+  // Run the top level code.
+  const char* code =
+      "//# experimentalChromiumCompileHints=notAll\n"
+      "function f1() {}";
+  v8::ScriptCompiler::Source script_source(NewString(code), origin);
+  Local<Script> script =
+      v8::ScriptCompiler::Compile(
+          v8_context(), &script_source,
+          v8::ScriptCompiler::CompileOptions::kProduceCompileHints)
+          .ToLocalChecked();
+
+  v8::MaybeLocal<v8::Value> result = script->Run(context);
+  EXPECT_FALSE(result.IsEmpty());
+
+  // Retrieve the function object for f1.
+  {
+    const char* code2 = "f1";
+    v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+
+    Local<Script> script2 =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source2)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+
+    auto function = i::Handle<i::JSFunction>::cast(
+        Utils::OpenHandle(*result2.ToLocalChecked()));
+    i::Builtin builtin = function->code()->builtin_id();
+
+    // f1 was compiled lazily.
+    EXPECT_EQ(i::Builtin::kCompileLazy, builtin);
+  }
+}
+
+namespace {
+
+bool CompileHintsMagicEnabledCallback(v8::Local<v8::Context> context) {
+  return true;
+}
+}  // namespace
+
+// Like CompileHintsMagicCommentBasic but enable compile hints via an API
+// callback.
+TEST_F(ScriptTest, CompileHintsMagicCommentBasicWithCallback) {
+  i::FlagScope<bool> flag_scope(&i::v8_flags.compile_hints_magic, false);
+
+  isolate()->SetJavaScriptCompileHintsMagicEnabledCallback(
+      CompileHintsMagicEnabledCallback);
+
+  v8::Local<v8::Context> context = v8::Context::New(isolate());
+  isolate()->InstallConditionalFeatures(context);
+
+  const char* url = "http://www.foo.com/foo.js";
+  v8::ScriptOrigin origin(isolate(), NewString(url), 13, 0);
+
+  // Run the top level code.
+  const char* code =
+      "//# experimentalChromiumCompileHints=all\n"
+      "function f1() {}\n"
+      "let f2 = function() { }";
+  v8::ScriptCompiler::Source script_source(NewString(code), origin);
+  Local<Script> script =
+      v8::ScriptCompiler::Compile(
+          v8_context(), &script_source,
+          v8::ScriptCompiler::CompileOptions::kProduceCompileHints)
+          .ToLocalChecked();
+
+  v8::MaybeLocal<v8::Value> result = script->Run(context);
+  EXPECT_FALSE(result.IsEmpty());
+
+  // Retrieve the function object for f1.
+  {
+    const char* code2 = "f1";
+    v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+
+    Local<Script> script2 =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source2)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+
+    auto function = i::Handle<i::JSFunction>::cast(
+        Utils::OpenHandle(*result2.ToLocalChecked()));
+    i::Builtin builtin = function->code()->builtin_id();
+
+    // f1 was not compiled lazily.
+    EXPECT_NE(i::Builtin::kCompileLazy, builtin);
+  }
+
+  // Retrieve the function object for f2.
+  {
+    const char* code2 = "f2";
+    v8::ScriptCompiler::Source script_source2(NewString(code2), origin);
+
+    Local<Script> script2 =
+        v8::ScriptCompiler::Compile(v8_context(), &script_source2)
+            .ToLocalChecked();
+    v8::MaybeLocal<v8::Value> result2 = script2->Run(context);
+
+    auto function = i::Handle<i::JSFunction>::cast(
+        Utils::OpenHandle(*result2.ToLocalChecked()));
+    i::Builtin builtin = function->code()->builtin_id();
+
+    // f2 was not compiled lazily.
+    EXPECT_NE(i::Builtin::kCompileLazy, builtin);
   }
 }
 
diff --git a/deps/v8/test/unittests/assembler/assembler-x64-unittest.cc b/deps/v8/test/unittests/assembler/assembler-x64-unittest.cc
index 5a3fd41549ea9d..d400d7615f93e9 100644
--- a/deps/v8/test/unittests/assembler/assembler-x64-unittest.cc
+++ b/deps/v8/test/unittests/assembler/assembler-x64-unittest.cc
@@ -662,7 +662,7 @@ TEST_F(AssemblerX64Test, AssemblerX64LabelChaining) {
 }
 
 TEST_F(AssemblerX64Test, AssemblerMultiByteNop) {
-  byte buffer[1024];
+  uint8_t buffer[1024];
   Isolate* isolate = i_isolate();
   Assembler masm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof(buffer)));
@@ -725,14 +725,15 @@ TEST_F(AssemblerX64Test, AssemblerMultiByteNop) {
 #ifdef __GNUC__
 #define ELEMENT_COUNT 4u
 
-void DoSSE2(const v8::FunctionCallbackInfo<v8::Value>& args) {
-  v8::Isolate* isolate = args.GetIsolate();
+void DoSSE2(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  v8::Isolate* isolate = info.GetIsolate();
   v8::HandleScope scope(isolate);
   v8::Local<v8::Context> context = isolate->GetCurrentContext();
-  byte buffer[1024];
+  uint8_t buffer[1024];
 
-  CHECK(args[0]->IsArray());
-  v8::Local<v8::Array> vec = v8::Local<v8::Array>::Cast(args[0]);
+  CHECK(info[0]->IsArray());
+  v8::Local<v8::Array> vec = v8::Local<v8::Array>::Cast(info[0]);
   CHECK_EQ(ELEMENT_COUNT, vec->Length());
 
   Isolate* i_isolate = reinterpret_cast<v8::internal::Isolate*>(isolate);
@@ -776,7 +777,7 @@ void DoSSE2(const v8::FunctionCallbackInfo<v8::Value>& args) {
 
   auto f = GeneratedCode<F0>::FromCode(i_isolate, *code);
   int res = f.Call();
-  args.GetReturnValue().Set(v8::Integer::New(isolate, res));
+  info.GetReturnValue().Set(v8::Integer::New(isolate, res));
 }
 
 TEST_F(AssemblerX64Test, StackAlignmentForSSE2) {
@@ -821,7 +822,7 @@ TEST_F(AssemblerX64Test, StackAlignmentForSSE2) {
 TEST_F(AssemblerX64Test, AssemblerX64Extractps) {
   if (!CpuFeatures::IsSupported(SSE4_1)) return;
 
-  byte buffer[256];
+  uint8_t buffer[256];
   Isolate* isolate = i_isolate();
   Assembler masm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof(buffer)));
@@ -837,7 +838,7 @@ TEST_F(AssemblerX64Test, AssemblerX64Extractps) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F3>::FromCode(isolate, *code);
@@ -851,7 +852,7 @@ using F6 = int(float x, float y);
 TEST_F(AssemblerX64Test, AssemblerX64SSE) {
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -872,7 +873,7 @@ TEST_F(AssemblerX64Test, AssemblerX64SSE) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F6>::FromCode(isolate, *code);
@@ -884,7 +885,7 @@ TEST_F(AssemblerX64Test, AssemblerX64SSE3) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -902,7 +903,7 @@ TEST_F(AssemblerX64Test, AssemblerX64SSE3) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F6>::FromCode(isolate, *code);
@@ -915,7 +916,7 @@ TEST_F(AssemblerX64Test, AssemblerX64FMA_sd) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1123,7 +1124,7 @@ TEST_F(AssemblerX64Test, AssemblerX64FMA_sd) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F7>::FromCode(isolate, *code);
@@ -1137,7 +1138,7 @@ TEST_F(AssemblerX64Test, AssemblerX64FMA_ss) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1345,7 +1346,7 @@ TEST_F(AssemblerX64Test, AssemblerX64FMA_ss) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F8>::FromCode(isolate, *code);
@@ -1355,7 +1356,7 @@ TEST_F(AssemblerX64Test, AssemblerX64FMA_ss) {
 TEST_F(AssemblerX64Test, AssemblerX64SSE_ss) {
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   Assembler masm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1418,7 +1419,7 @@ TEST_F(AssemblerX64Test, AssemblerX64SSE_ss) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F8>::FromCode(isolate, *code);
@@ -1432,7 +1433,7 @@ TEST_F(AssemblerX64Test, AssemblerX64AVX_ss) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   Assembler masm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1502,7 +1503,7 @@ TEST_F(AssemblerX64Test, AssemblerX64AVX_ss) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F8>::FromCode(isolate, *code);
@@ -1516,7 +1517,7 @@ TEST_F(AssemblerX64Test, AssemblerX64AVX_sd) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   Assembler masm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1740,7 +1741,7 @@ TEST_F(AssemblerX64Test, AssemblerX64AVX_sd) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F7>::FromCode(isolate, *code);
@@ -1754,7 +1755,7 @@ TEST_F(AssemblerX64Test, AssemblerX64BMI1) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[1024];
+  uint8_t buffer[1024];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1930,7 +1931,7 @@ TEST_F(AssemblerX64Test, AssemblerX64BMI1) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -1942,7 +1943,7 @@ TEST_F(AssemblerX64Test, AssemblerX64LZCNT) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -1988,7 +1989,7 @@ TEST_F(AssemblerX64Test, AssemblerX64LZCNT) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -2000,7 +2001,7 @@ TEST_F(AssemblerX64Test, AssemblerX64POPCNT) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -2046,7 +2047,7 @@ TEST_F(AssemblerX64Test, AssemblerX64POPCNT) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -2058,7 +2059,7 @@ TEST_F(AssemblerX64Test, AssemblerX64BMI2) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[2048];
+  uint8_t buffer[2048];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -2307,7 +2308,7 @@ TEST_F(AssemblerX64Test, AssemblerX64BMI2) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F0>::FromCode(isolate, *code);
@@ -2349,7 +2350,7 @@ TEST_F(AssemblerX64Test, AssemblerX64JumpTables1) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
 
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
@@ -2396,7 +2397,7 @@ TEST_F(AssemblerX64Test, AssemblerX64JumpTables2) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
-  code->Print(std::cout);
+  Print(*code, std::cout);
 #endif
 
   auto f = GeneratedCode<F1>::FromCode(isolate, *code);
@@ -2430,7 +2431,7 @@ TEST_F(AssemblerX64Test, AssemblerX64vmovups) {
 
   Isolate* isolate = i_isolate();
   HandleScope scope(isolate);
-  v8::internal::byte buffer[256];
+  uint8_t buffer[256];
   MacroAssembler masm(isolate, v8::internal::CodeObjectRequired::kYes,
                       ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   {
@@ -2452,7 +2453,7 @@ TEST_F(AssemblerX64Test, AssemblerX64vmovups) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
   auto f = GeneratedCode<F9>::FromCode(isolate, *code);
@@ -2477,6 +2478,7 @@ TEST_F(AssemblerX64Test, AssemblerX64Regmove256bit) {
   __ vmovapd(ymm0, ymm5);
   __ vmovupd(ymm6, Operand(r8, r9, times_4, 10000));
   __ vbroadcastss(ymm7, Operand(rbx, rcx, times_4, 10000));
+  __ vbroadcastsd(ymm6, Operand(rbx, rcx, times_4, 10000));
   __ vmovddup(ymm3, ymm2);
   __ vmovddup(ymm4, Operand(rbx, rcx, times_4, 10000));
   __ vmovshdup(ymm1, ymm2);
@@ -2487,41 +2489,44 @@ TEST_F(AssemblerX64Test, AssemblerX64Regmove256bit) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
-  byte expected[] = {// VMOVDQA
-                     // vmovdqa ymm0,ymm1
-                     0xC5, 0xFD, 0x6F, 0xC1,
-                     // vmovdqa ymm4,YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0xFD, 0x6F, 0xA4, 0x8B, 0x10, 0x27, 0x00, 0x00,
-
-                     // VMOVDQU
-                     // vmovdqu ymm10,ymm11
-                     0xC4, 0x41, 0x7E, 0x7F, 0xDA,
-                     // vmovdqu ymm9,YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0x7E, 0x6F, 0x8C, 0x8B, 0x10, 0x27, 0x00, 0x00,
-                     // vmovdqu YMMWORD PTR [rbx+rcx*4+0x2710],ymm0
-                     0xC5, 0xFE, 0x7F, 0x84, 0x8B, 0x10, 0x27, 0x00, 0x00,
-
-                     // vmovaps ymm3, ymm1
-                     0xC5, 0xFC, 0x28, 0xD9,
-                     // vmovups YMMWORD PTR [rcx+rdx*4+0x2710], ymm2
-                     0xC5, 0xFC, 0x11, 0x94, 0x91, 0x10, 0x27, 0x00, 0x00,
-                     // vmovapd ymm0, ymm5
-                     0xC5, 0xFD, 0x28, 0xC5,
-                     // vmovupd ymm6, YMMWORD PTR [r8+r9*4+0x2710]
-                     0xC4, 0x81, 0x7D, 0x10, 0xB4, 0x88, 0x10, 0x27, 0x00, 0x00,
-
-                     // vbroadcastss ymm7, DWORD PTR [rbx+rcx*4+0x2710]
-                     0xc4, 0xe2, 0x7d, 0x18, 0xbc, 0x8b, 0x10, 0x27, 0x00, 0x00,
-
-                     // vmovddup ymm3, ymm2
-                     0xc5, 0xff, 0x12, 0xda,
-                     // vmovddup ymm4, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xc5, 0xff, 0x12, 0xa4, 0x8b, 0x10, 0x27, 0x00, 0x00,
-                     // vmovshdup ymm1, ymm2
-                     0xc5, 0xfe, 0x16, 0xca};
+  uint8_t expected[] = {
+      // VMOVDQA
+      // vmovdqa ymm0,ymm1
+      0xC5, 0xFD, 0x6F, 0xC1,
+      // vmovdqa ymm4,YMMWORD PTR [rbx+rcx*4+0x2710]
+      0xC5, 0xFD, 0x6F, 0xA4, 0x8B, 0x10, 0x27, 0x00, 0x00,
+
+      // VMOVDQU
+      // vmovdqu ymm10,ymm11
+      0xC4, 0x41, 0x7E, 0x7F, 0xDA,
+      // vmovdqu ymm9,YMMWORD PTR [rbx+rcx*4+0x2710]
+      0xC5, 0x7E, 0x6F, 0x8C, 0x8B, 0x10, 0x27, 0x00, 0x00,
+      // vmovdqu YMMWORD PTR [rbx+rcx*4+0x2710],ymm0
+      0xC5, 0xFE, 0x7F, 0x84, 0x8B, 0x10, 0x27, 0x00, 0x00,
+
+      // vmovaps ymm3, ymm1
+      0xC5, 0xFC, 0x28, 0xD9,
+      // vmovups YMMWORD PTR [rcx+rdx*4+0x2710], ymm2
+      0xC5, 0xFC, 0x11, 0x94, 0x91, 0x10, 0x27, 0x00, 0x00,
+      // vmovapd ymm0, ymm5
+      0xC5, 0xFD, 0x28, 0xC5,
+      // vmovupd ymm6, YMMWORD PTR [r8+r9*4+0x2710]
+      0xC4, 0x81, 0x7D, 0x10, 0xB4, 0x88, 0x10, 0x27, 0x00, 0x00,
+
+      // vbroadcastss ymm7, DWORD PTR [rbx+rcx*4+0x2710]
+      0xc4, 0xe2, 0x7d, 0x18, 0xbc, 0x8b, 0x10, 0x27, 0x00, 0x00,
+      // vbroadcastsd ymm6, QWORD PTR [rbx+rcx*4+0x2710]
+      0xc4, 0xe2, 0x7d, 0x19, 0xb4, 0x8b, 0x10, 0x27, 0x00, 0x00,
+
+      // vmovddup ymm3, ymm2
+      0xc5, 0xff, 0x12, 0xda,
+      // vmovddup ymm4, YMMWORD PTR [rbx+rcx*4+0x2710]
+      0xc5, 0xff, 0x12, 0xa4, 0x8b, 0x10, 0x27, 0x00, 0x00,
+      // vmovshdup ymm1, ymm2
+      0xc5, 0xfe, 0x16, 0xca};
 
   CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
 }
@@ -2546,10 +2551,18 @@ TEST_F(AssemblerX64Test, AssemblerX64AVX2Op256bit) {
   __ vpalignr(ymm10, ymm11, ymm12, 4);
   __ vpalignr(ymm10, ymm11, Operand(rbx, rcx, times_4, 10000), 4);
   __ vbroadcastss(ymm7, xmm0);
+  __ vbroadcastsd(ymm6, xmm5);
   __ vpbroadcastb(ymm2, xmm1);
   __ vpbroadcastb(ymm3, Operand(rbx, rcx, times_4, 10000));
   __ vpbroadcastw(ymm15, xmm4);
   __ vpbroadcastw(ymm5, Operand(rbx, rcx, times_4, 10000));
+  __ vpmovsxbw(ymm6, xmm5);
+  __ vpmovsxwd(ymm1, Operand(rbx, rcx, times_4, 10000));
+  __ vpmovsxdq(ymm14, xmm6);
+  __ vpmovzxbw(ymm0, Operand(rbx, rcx, times_4, 10000));
+  __ vpmovzxbd(ymm14, xmm6);
+  __ vpmovzxwd(ymm7, Operand(rbx, rcx, times_4, 10000));
+  __ vpmovzxdq(ymm8, xmm6);
 
   CodeDesc desc;
   masm.GetCode(isolate, &desc);
@@ -2557,10 +2570,10 @@ TEST_F(AssemblerX64Test, AssemblerX64AVX2Op256bit) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
-  byte expected[] = {
+  uint8_t expected[] = {
       // vpshufd ymm1, ymm2, 85
       0xC5, 0xFD, 0x70, 0xCA, 0x55,
       // vpshufd ymm1,YMMWORD PTR [rbx+rcx*4+0x2710], 85
@@ -2585,6 +2598,8 @@ TEST_F(AssemblerX64Test, AssemblerX64AVX2Op256bit) {
       0xC4, 0x63, 0x25, 0x0F, 0x94, 0x8B, 0x10, 0x27, 0x00, 0x00, 0x04,
       // vbroadcastss ymm7, xmm0
       0xc4, 0xe2, 0x7d, 0x18, 0xf8,
+      // vbroadcastsd ymm7, xmm0
+      0xc4, 0xe2, 0x7d, 0x19, 0xf5,
       // vpbroadcastb ymm2, xmm1
       0xc4, 0xe2, 0x7d, 0x78, 0xd1,
       // vpbroadcastb ymm3, BYTE PTR [rbx+rcx*4+0x2710]
@@ -2592,7 +2607,21 @@ TEST_F(AssemblerX64Test, AssemblerX64AVX2Op256bit) {
       // vpbroadcastw ymm15, xmm4
       0xc4, 0x62, 0x7d, 0x79, 0xfc,
       // vpbroadcastw ymm5, WORD PTR [rbx+rcx*4+0x2710]
-      0xc4, 0xe2, 0x7d, 0x79, 0xac, 0x8b, 0x10, 0x27, 0x00, 0x00};
+      0xc4, 0xe2, 0x7d, 0x79, 0xac, 0x8b, 0x10, 0x27, 0x00, 0x00,
+      // vpmovsxbw ymm6, xmm5
+      0xc4, 0xe2, 0x7d, 0x20, 0xf5,
+      // vpmovsxwd ymm1, XMMWORD PTR [rbx+rcx*4+0x2710]
+      0xc4, 0xe2, 0x7d, 0x23, 0x8c, 0x8b, 0x10, 0x27, 0x00, 0x00,
+      // vpmovsxdq ymm14, xmm6
+      0xc4, 0x62, 0x7d, 0x25, 0xf6,
+      // vpmovzxbw ymm0, XMMWORD PTR [rbx+rcx*4+0x2710]
+      0xc4, 0xe2, 0x7d, 0x30, 0x84, 0x8b, 0x10, 0x27, 0x00, 0x00,
+      // vpmovzxbd ymm14 xmm6
+      0xc4, 0x62, 0x7d, 0x31, 0xf6,
+      // vpmovzxwd ymm7, XMMWORD PTR [rbx+rcx*4+0x2710]
+      0xc4, 0xe2, 0x7d, 0x33, 0xbc, 0x8b, 0x10, 0x27, 0x00, 0x00,
+      // vpmovzxdq ymm8, xmm6
+      0xc4, 0x62, 0x7d, 0x35, 0xc6};
   CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
 }
 
@@ -2628,6 +2657,7 @@ TEST_F(AssemblerX64Test, AssemblerX64FloatingPoint256bit) {
   __ vcvtdq2pd(ymm1, Operand(rbx, rcx, times_4, 10000));
   __ vcvttps2dq(ymm3, ymm2);
   __ vcvttps2dq(ymm3, Operand256(rbx, rcx, times_4, 10000));
+  __ vperm2f128(ymm1, ymm2, ymm3, 2);
 
   CodeDesc desc;
   masm.GetCode(isolate, &desc);
@@ -2635,57 +2665,60 @@ TEST_F(AssemblerX64Test, AssemblerX64FloatingPoint256bit) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
-  byte expected[] = {// vandpd ymm1, ymm3, ymm5
-                     0xC5, 0xE5, 0x54, 0xCD,
-                     // vminpd ymm2, ymm3, YMMWORD PTR [r8+r9*4+0x2710]
-                     0xC4, 0x81, 0x65, 0x5D, 0x94, 0x88, 0x10, 0x27, 0x00, 0x00,
-                     // VSQRTPS
-                     0xC5, 0xFC, 0x51, 0xC1,
-                     // VUNPCKLPS
-                     0xC4, 0xC1, 0x64, 0x14, 0xD6,
-                     // VSUBPS
-                     0xC4, 0x41, 0x24, 0x5C, 0xD4,
-                     // vroundps ymm9, ymm2, 0xA
-                     0xC4, 0x63, 0x7D, 0x08, 0xCA, 0x0A,
-                     // vroundpd ymm9, ymm2, 0x8
-                     0xC4, 0x63, 0x7D, 0x09, 0xCA, 0x08,
-                     // VHADDPS ymm1, ymm2, ymm3
-                     0xC5, 0xEF, 0x7C, 0xCB,
-                     // VHADDPS ymm0, ymm1, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xc5, 0xf7, 0x7c, 0x84, 0x8b, 0x10, 0x27, 0x00, 0x00,
-                     // vblendvps ymm0, ymm3, ymm5, ymm9
-                     0xC4, 0xE3, 0x65, 0x4A, 0xC5, 0x90,
-                     // vblendvpd ymm7, ymm4, ymm3, ymm1
-                     0xC4, 0xE3, 0x5D, 0x4B, 0xFB, 0x10,
-                     // vshufps ymm3, ymm1, ymm2, 0x75
-                     0xC5, 0xF4, 0xC6, 0xDA, 0x75,
-                     // vsqrtpd ymm1, ymm2
-                     0xC5, 0xFD, 0x51, 0xCA,
-                     // vsqrtpd ymm1, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0xFD, 0x51, 0x8C, 0x8B, 0x10, 0x27, 0x00, 0x00,
-                     // vcvtpd2ps xmm1, ymm2
-                     0xC5, 0xFD, 0x5A, 0xCA,
-                     // vcvtpd2ps xmm2, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0xFD, 0x5A, 0x94, 0x8B, 0x10, 0x27, 0x00, 0x00,
-                     // vcvtps2dq ymm3, ymm4
-                     0xC5, 0xFD, 0x5B, 0xDC,
-                     // vcvtps2dq ymm5, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0xFD, 0x5B, 0xAC, 0x8B, 0x10, 0x27, 0x00, 0x00,
-                     // vcvttpd2dq xmm6, ymm8
-                     0xC4, 0xC1, 0x7D, 0xE6, 0xF0,
-                     // vcvttpd2dq xmm10, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0x7D, 0xE6, 0x94, 0x8B, 0x10, 0x27, 0x00, 0x00,
-                     // vcvtdq2pd ymm1, xmm2
-                     0xC5, 0xFE, 0xE6, 0xCA,
-                     // vcvtdq2pd ymm1, XMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0xFE, 0xE6, 0x8C, 0x8B, 0x10, 0x27, 0x00, 0x00,
-                     // vcvttps2dq ymm3, ymm2
-                     0xC5, 0xFE, 0x5B, 0xDA,
-                     // vcvttps2dq ymm3, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0xFE, 0x5B, 0x9C, 0x8B, 0x10, 0x27, 0x00, 0x00};
+  uint8_t expected[] = {// vandpd ymm1, ymm3, ymm5
+                        0xC5, 0xE5, 0x54, 0xCD,
+                        // vminpd ymm2, ymm3, YMMWORD PTR [r8+r9*4+0x2710]
+                        0xC4, 0x81, 0x65, 0x5D, 0x94, 0x88, 0x10, 0x27, 0x00,
+                        0x00,
+                        // VSQRTPS
+                        0xC5, 0xFC, 0x51, 0xC1,
+                        // VUNPCKLPS
+                        0xC4, 0xC1, 0x64, 0x14, 0xD6,
+                        // VSUBPS
+                        0xC4, 0x41, 0x24, 0x5C, 0xD4,
+                        // vroundps ymm9, ymm2, 0xA
+                        0xC4, 0x63, 0x7D, 0x08, 0xCA, 0x0A,
+                        // vroundpd ymm9, ymm2, 0x8
+                        0xC4, 0x63, 0x7D, 0x09, 0xCA, 0x08,
+                        // VHADDPS ymm1, ymm2, ymm3
+                        0xC5, 0xEF, 0x7C, 0xCB,
+                        // VHADDPS ymm0, ymm1, YMMWORD PTR [rbx+rcx*4+0x2710]
+                        0xc5, 0xf7, 0x7c, 0x84, 0x8b, 0x10, 0x27, 0x00, 0x00,
+                        // vblendvps ymm0, ymm3, ymm5, ymm9
+                        0xC4, 0xE3, 0x65, 0x4A, 0xC5, 0x90,
+                        // vblendvpd ymm7, ymm4, ymm3, ymm1
+                        0xC4, 0xE3, 0x5D, 0x4B, 0xFB, 0x10,
+                        // vshufps ymm3, ymm1, ymm2, 0x75
+                        0xC5, 0xF4, 0xC6, 0xDA, 0x75,
+                        // vsqrtpd ymm1, ymm2
+                        0xC5, 0xFD, 0x51, 0xCA,
+                        // vsqrtpd ymm1, YMMWORD PTR [rbx+rcx*4+0x2710]
+                        0xC5, 0xFD, 0x51, 0x8C, 0x8B, 0x10, 0x27, 0x00, 0x00,
+                        // vcvtpd2ps xmm1, ymm2
+                        0xC5, 0xFD, 0x5A, 0xCA,
+                        // vcvtpd2ps xmm2, YMMWORD PTR [rbx+rcx*4+0x2710]
+                        0xC5, 0xFD, 0x5A, 0x94, 0x8B, 0x10, 0x27, 0x00, 0x00,
+                        // vcvtps2dq ymm3, ymm4
+                        0xC5, 0xFD, 0x5B, 0xDC,
+                        // vcvtps2dq ymm5, YMMWORD PTR [rbx+rcx*4+0x2710]
+                        0xC5, 0xFD, 0x5B, 0xAC, 0x8B, 0x10, 0x27, 0x00, 0x00,
+                        // vcvttpd2dq xmm6, ymm8
+                        0xC4, 0xC1, 0x7D, 0xE6, 0xF0,
+                        // vcvttpd2dq xmm10, YMMWORD PTR [rbx+rcx*4+0x2710]
+                        0xC5, 0x7D, 0xE6, 0x94, 0x8B, 0x10, 0x27, 0x00, 0x00,
+                        // vcvtdq2pd ymm1, xmm2
+                        0xC5, 0xFE, 0xE6, 0xCA,
+                        // vcvtdq2pd ymm1, XMMWORD PTR [rbx+rcx*4+0x2710]
+                        0xC5, 0xFE, 0xE6, 0x8C, 0x8B, 0x10, 0x27, 0x00, 0x00,
+                        // vcvttps2dq ymm3, ymm2
+                        0xC5, 0xFE, 0x5B, 0xDA,
+                        // vcvttps2dq ymm3, YMMWORD PTR [rbx+rcx*4+0x2710]
+                        0xC5, 0xFE, 0x5B, 0x9C, 0x8B, 0x10, 0x27, 0x00, 0x00,
+                        // vperm2f128 ymm1, ymm2, ymm3, 2
+                        0xc4, 0xe3, 0x6d, 0x06, 0xcb, 0x02};
   CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
 }
 
@@ -2729,70 +2762,79 @@ TEST_F(AssemblerX64Test, AssemblerX64Integer256bit) {
   // SSE4_2_AVX_INSTRUCTION
   __ vpcmpgtq(ymm3, ymm2, ymm0);
 
+  __ vpermq(ymm8, Operand(rbx, rcx, times_4, 10000), 0x1E);
+  __ vpermq(ymm5, ymm3, 0xD8);
+
   CodeDesc desc;
   masm.GetCode(isolate, &desc);
 #ifdef OBJECT_PRINT
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
-  byte expected[] = {// SSE2_AVX_INSTRUCTION
-                     // vpunpcklbw ymm9, ymm2, ymm0
-                     0xC5, 0x6D, 0x60, 0xC8,
-                     // vpacksswb ymm8, ymm3, ymm1
-                     0xC5, 0x65, 0x63, 0xC1,
-                     // vpcmpgtw ymm2, ymm7, ymm9
-                     0xC4, 0xC1, 0x45, 0x65, 0xD1,
-                     // vpand ymm2, ymm3, ymm4
-                     0xC5, 0xE5, 0xDB, 0xD4,
-                     // vpmaxsw ymm10, ymm11, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC5, 0x25, 0xEE, 0x94, 0x8B, 0x10, 0x27, 0x00, 0x00,
-                     // vpaddb ymm1, ymm2, ymm3
-                     0xC5, 0xED, 0xFC, 0xCB,
-                     // vpsraw ymm7, ymm1, xmm4
-                     0xC5, 0xF5, 0xE1, 0xFC,
-                     // vpsllq ymm3, ymm2, xmm1
-                     0xC5, 0xED, 0xF3, 0xD9,
-
-                     // SSSE3_AVX_INSTRUCTION
-                     // vpshufb ymm1, ymm2, ymm3
-                     0xC4, 0xE2, 0x6D, 0x00, 0xCB,
-                     // vphaddw ymm8, ymm9, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC4, 0x62, 0x35, 0x01, 0x84, 0x8B, 0x10, 0x27, 0x00, 0x00,
-                     // vpmaddubsw ymm5, ymm7, ymm9
-                     0xC4, 0xC2, 0x45, 0x04, 0xE9,
-                     // vpsignd ymm7, ymm0, ymm1
-                     0xC4, 0xE2, 0x7D, 0x0A, 0xF9,
-                     // vpmulhrsw ymm4, ymm3, ymm1
-                     0xC4, 0xE2, 0x65, 0x0B, 0xE1,
-                     // vpabsb ymm1, ymm2
-                     0xC4, 0xE2, 0x7D, 0x1C, 0xCA,
-                     // vpabsb ymm3, YMMWORD PTR [rbx+rcx+0x2710]
-                     0xC4, 0xE2, 0x7D, 0x1C, 0x9C, 0x8b, 0x10, 0x27, 0x00, 0x00,
-                     // vpabsw ymm6, ymm5
-                     0xC4, 0xE2, 0x7D, 0x1D, 0xF5,
-                     // vpabsd ymm7, ymm10
-                     0xC4, 0xC2, 0x7D, 0x1E, 0xFA,
-
-                     // SSE4_AVX_INSTRUCTION
-                     // vpmuldq ymm1, ymm5, ymm6
-                     0xC4, 0xE2, 0x55, 0x28, 0xCE,
-                     // vpcmpeqq ymm0, ymm2, ymm3
-                     0xC4, 0xE2, 0x6D, 0x29, 0xC3,
-                     // vpackusdw ymm4, ymm2, ymm0
-                     0xC4, 0xE2, 0x6D, 0x2B, 0xE0,
-                     // vpminud ymm8, ymm9, YMMWORD PTR [rbx+rcx*4+0x2710]
-                     0xC4, 0x62, 0x35, 0x3B, 0x84, 0x8B, 0x10, 0x27, 0x0, 0x0,
-                     // vpmaxsb ymm3, ymm4, ymm7
-                     0xC4, 0xE2, 0x5D, 0x3C, 0xDF,
-                     // vpmulld ymm6, ymm5, ymm3
-                     0xC4, 0xE2, 0x55, 0x40, 0xF3,
-
-                     // SSE4_2_AVX_INSTRUCTION
-                     // vpcmpgtq ymm3, ymm2, ymm0
-                     0xC4, 0xE2, 0x6D, 0x37, 0xD8};
+  uint8_t expected[] = {
+      // SSE2_AVX_INSTRUCTION
+      // vpunpcklbw ymm9, ymm2, ymm0
+      0xC5, 0x6D, 0x60, 0xC8,
+      // vpacksswb ymm8, ymm3, ymm1
+      0xC5, 0x65, 0x63, 0xC1,
+      // vpcmpgtw ymm2, ymm7, ymm9
+      0xC4, 0xC1, 0x45, 0x65, 0xD1,
+      // vpand ymm2, ymm3, ymm4
+      0xC5, 0xE5, 0xDB, 0xD4,
+      // vpmaxsw ymm10, ymm11, YMMWORD PTR [rbx+rcx*4+0x2710]
+      0xC5, 0x25, 0xEE, 0x94, 0x8B, 0x10, 0x27, 0x00, 0x00,
+      // vpaddb ymm1, ymm2, ymm3
+      0xC5, 0xED, 0xFC, 0xCB,
+      // vpsraw ymm7, ymm1, xmm4
+      0xC5, 0xF5, 0xE1, 0xFC,
+      // vpsllq ymm3, ymm2, xmm1
+      0xC5, 0xED, 0xF3, 0xD9,
+
+      // SSSE3_AVX_INSTRUCTION
+      // vpshufb ymm1, ymm2, ymm3
+      0xC4, 0xE2, 0x6D, 0x00, 0xCB,
+      // vphaddw ymm8, ymm9, YMMWORD PTR [rbx+rcx*4+0x2710]
+      0xC4, 0x62, 0x35, 0x01, 0x84, 0x8B, 0x10, 0x27, 0x00, 0x00,
+      // vpmaddubsw ymm5, ymm7, ymm9
+      0xC4, 0xC2, 0x45, 0x04, 0xE9,
+      // vpsignd ymm7, ymm0, ymm1
+      0xC4, 0xE2, 0x7D, 0x0A, 0xF9,
+      // vpmulhrsw ymm4, ymm3, ymm1
+      0xC4, 0xE2, 0x65, 0x0B, 0xE1,
+      // vpabsb ymm1, ymm2
+      0xC4, 0xE2, 0x7D, 0x1C, 0xCA,
+      // vpabsb ymm3, YMMWORD PTR [rbx+rcx+0x2710]
+      0xC4, 0xE2, 0x7D, 0x1C, 0x9C, 0x8b, 0x10, 0x27, 0x00, 0x00,
+      // vpabsw ymm6, ymm5
+      0xC4, 0xE2, 0x7D, 0x1D, 0xF5,
+      // vpabsd ymm7, ymm10
+      0xC4, 0xC2, 0x7D, 0x1E, 0xFA,
+
+      // SSE4_AVX_INSTRUCTION
+      // vpmuldq ymm1, ymm5, ymm6
+      0xC4, 0xE2, 0x55, 0x28, 0xCE,
+      // vpcmpeqq ymm0, ymm2, ymm3
+      0xC4, 0xE2, 0x6D, 0x29, 0xC3,
+      // vpackusdw ymm4, ymm2, ymm0
+      0xC4, 0xE2, 0x6D, 0x2B, 0xE0,
+      // vpminud ymm8, ymm9, YMMWORD PTR [rbx+rcx*4+0x2710]
+      0xC4, 0x62, 0x35, 0x3B, 0x84, 0x8B, 0x10, 0x27, 0x0, 0x0,
+      // vpmaxsb ymm3, ymm4, ymm7
+      0xC4, 0xE2, 0x5D, 0x3C, 0xDF,
+      // vpmulld ymm6, ymm5, ymm3
+      0xC4, 0xE2, 0x55, 0x40, 0xF3,
+
+      // SSE4_2_AVX_INSTRUCTION
+      // vpcmpgtq ymm3, ymm2, ymm0
+      0xC4, 0xE2, 0x6D, 0x37, 0xD8,
+
+      // vpermq ymm8, YMMWORD PTR [rbx+rcx*4+0x2710], 0x1e
+      0xC4, 0x63, 0xFD, 0x00, 0x84, 0x8B, 0x10, 0x27, 0x00, 0x00, 0x1E,
+      // vpermq ymm5, ymm3, 0xD8
+      0xC4, 0xE3, 0xFD, 0x00, 0xEB, 0xD8};
   CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
 }
 
@@ -2812,6 +2854,8 @@ TEST_F(AssemblerX64Test, AssemblerX64CmpOperations256bit) {
   __ vcmpnltpd(ymm10, ymm12, Operand(r12, r11, times_4, 10000));
   __ vcmpnleps(ymm9, ymm11, Operand(r10, r9, times_8, 10000));
   __ vcmpgepd(ymm13, ymm3, ymm12);
+  __ vptest(ymm7, ymm1);
+  __ vptest(ymm10, Operand(rbx, rcx, times_4, 10000));
 
   CodeDesc desc;
   masm.GetCode(isolate, &desc);
@@ -2819,10 +2863,10 @@ TEST_F(AssemblerX64Test, AssemblerX64CmpOperations256bit) {
   Handle<Code> code =
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
 
-  byte expected[] = {
+  uint8_t expected[] = {
       // vcmpeqps ymm1, ymm2, ymm4
       0xC5, 0xEC, 0xC2, 0xCC, 0x00,
       // vcmpltpd ymm4, ymm7, YMMWORD PTR [rcx+rdx*4+0x2710]
@@ -2838,10 +2882,215 @@ TEST_F(AssemblerX64Test, AssemblerX64CmpOperations256bit) {
       // vcmpnleps ymm9, ymm11, YMMWORD PTR [r10+r9*8+0x2710]
       0xC4, 0x01, 0x24, 0xC2, 0x8C, 0xCA, 0x10, 0x27, 0x00, 0x00, 0x06,
       // vcmpgepd ymm13, ymm3, ymm12
-      0xC4, 0x41, 0x65, 0xC2, 0xEC, 0x0D};
+      0xC4, 0x41, 0x65, 0xC2, 0xEC, 0x0D,
+      // vptest ymm7, ymm1
+      0xc4, 0xe2, 0x7d, 0x17, 0xf9,
+      // vptest ymm10, YMMWORD PTR [rbx+rcx*4+0x2710]
+      0xc4, 0x62, 0x7d, 0x17, 0x94, 0x8b, 0x10, 0x27, 0x00, 0x00};
+  CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
+}
+
+TEST_F(AssemblerX64Test, AssemblerX64ShiftImm128bit) {
+  if (!CpuFeatures::IsSupported(AVX)) return;
+
+  auto buffer = AllocateAssemblerBuffer();
+  Isolate* isolate = i_isolate();
+  Assembler masm(AssemblerOptions{}, buffer->CreateView());
+  CpuFeatureScope fscope(&masm, AVX);
+
+  __ vpsrlw(xmm8, xmm2, 4);
+  __ vpsrld(xmm11, xmm2, 4);
+  __ vpsrlq(xmm1, xmm2, 4);
+  __ vpsraw(xmm10, xmm8, 4);
+  __ vpsrad(xmm6, xmm7, 4);
+  __ vpsllw(xmm1, xmm4, 4);
+  __ vpslld(xmm3, xmm2, 4);
+  __ vpsllq(xmm6, xmm9, 4);
+
+  CodeDesc desc;
+  masm.GetCode(isolate, &desc);
+#ifdef OBJECT_PRINT
+  Handle<Code> code =
+      Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
+  StdoutStream os;
+  Print(*code, os);
+#endif
+
+  uint8_t expected[] = {// vpsrlw xmm8,xmm2,0x4
+                        0XC5, 0xB9, 0x71, 0xD2, 0x04,
+                        // vpsrld xmm11,xmm2,0x4
+                        0xC5, 0xA1, 0x72, 0xD2, 0x04,
+                        // vpsrlq xmm1,xmm2,0x4
+                        0xC5, 0xF1, 0x73, 0xD2, 0x04,
+                        // vpsraw xmm10,xmm8,0x4
+                        0xC4, 0xC1, 0x29, 0x71, 0xE0, 0x04,
+                        // vpsrad xmm6,xmm7,0x4
+                        0xC5, 0xC9, 0x72, 0xE7, 0x04,
+                        // vpsllw xmm1,xmm4,0x4
+                        0xC5, 0xF1, 0x71, 0xF4, 0x04,
+                        // vpslld xmm3,xmm2,0x4
+                        0xC5, 0xE1, 0x72, 0xF2, 0x04,
+                        // vpsllq xmm6,xmm9,0x4
+                        0xC4, 0xC1, 0x49, 0x73, 0xF1, 0x04};
   CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
 }
 
+TEST_F(AssemblerX64Test, AssemblerX64ShiftImm256bit) {
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+
+  auto buffer = AllocateAssemblerBuffer();
+  Isolate* isolate = i_isolate();
+  Assembler masm(AssemblerOptions{}, buffer->CreateView());
+  CpuFeatureScope fscope(&masm, AVX2);
+
+  __ vpsrlw(ymm0, ymm2, 4);
+  __ vpsrld(ymm11, ymm2, 4);
+  __ vpsrlq(ymm1, ymm2, 4);
+  __ vpsraw(ymm10, ymm8, 4);
+  __ vpsrad(ymm6, ymm7, 4);
+  __ vpsllw(ymm1, ymm4, 4);
+  __ vpslld(ymm3, ymm2, 4);
+  __ vpsllq(ymm6, ymm9, 4);
+
+  CodeDesc desc;
+  masm.GetCode(isolate, &desc);
+#ifdef OBJECT_PRINT
+  Handle<Code> code =
+      Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
+  StdoutStream os;
+  Print(*code, os);
+#endif
+
+  uint8_t expected[] = {// vpsrlw ymm0,ymm2,0x4
+                        0XC5, 0xFD, 0x71, 0xD2, 0x04,
+                        // vpsrld ymm11,ymm2,0x4
+                        0xC5, 0xA5, 0x72, 0xD2, 0x04,
+                        // vpsrlq ymm1,ymm2,0x4
+                        0xC5, 0xF5, 0x73, 0xD2, 0x04,
+                        // vpsraw ymm10,ymm8,0x4
+                        0xC4, 0xC1, 0x2D, 0x71, 0xE0, 0x04,
+                        // vpsrad ymm6,ymm7,0x4
+                        0xC5, 0xCD, 0x72, 0xE7, 0x04,
+                        // vpsllw ymm1,ymm4,0x4
+                        0xC5, 0xF5, 0x71, 0xF4, 0x04,
+                        // vpslld ymm3,ymm2,0x4
+                        0xC5, 0xE5, 0x72, 0xF2, 0x04,
+                        // vpsllq ymm6,ymm9,0x4
+                        0xC4, 0xC1, 0x4D, 0x73, 0xF1, 0x04};
+  CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
+}
+
+TEST_F(AssemblerX64Test, AssemblerX64BinOp256bit) {
+  {
+    if (!CpuFeatures::IsSupported(AVX)) return;
+    auto buffer = AllocateAssemblerBuffer();
+    Isolate* isolate = i_isolate();
+    Assembler masm(AssemblerOptions{}, buffer->CreateView());
+    CpuFeatureScope fscope(&masm, AVX);
+
+    //  add
+    __ vaddps(ymm0, ymm1, ymm2);
+    __ vaddpd(ymm3, ymm4, ymm5);
+
+    // sub
+    __ vsubps(ymm0, ymm1, ymm2);
+    __ vsubpd(ymm3, ymm4, ymm5);
+
+    // mul
+    __ vmulps(ymm0, ymm1, ymm2);
+    __ vmulpd(ymm3, ymm4, ymm5);
+
+    // div
+    __ vdivps(ymm0, ymm1, ymm2);
+    __ vdivpd(ymm3, ymm4, ymm5);
+
+    CodeDesc desc;
+    masm.GetCode(isolate, &desc);
+#ifdef OBJECT_PRINT
+    Handle<Code> code =
+        Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
+    StdoutStream os;
+    Print(*code, os);
+#endif
+
+    uint8_t expected[] = {// vaddps ymm0,ymm1,ymm2
+                          0xc5, 0xf4, 0x58, 0xc2,
+                          // vaddpd ymm3,ymm4,ymm5
+                          0xc5, 0xdd, 0x58, 0xdd,
+                          // vsubps ymm0,ymm1,ymm2
+                          0xc5, 0xf4, 0x5c, 0xc2,
+                          // vsubpd ymm3,ymm4,ymm5
+                          0xc5, 0xdd, 0x5c, 0xdd,
+                          // vmulps ymm0,ymm1,ymm2
+                          0xc5, 0xf4, 0x59, 0xc2,
+                          // vmulpd ymm3,ymm4,ymm5
+                          0xc5, 0xdd, 0x59, 0xdd,
+                          // vdivps ymm0,ymm1,ymm2
+                          0xc5, 0xf4, 0x5e, 0xc2,
+                          // vdivpd ymm3,ymm4,ymm5
+                          0xc5, 0xdd, 0x5e, 0xdd};
+    CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
+  }
+
+  {
+    if (!CpuFeatures::IsSupported(AVX2)) return;
+
+    auto buffer = AllocateAssemblerBuffer();
+    Isolate* isolate = i_isolate();
+    Assembler masm(AssemblerOptions{}, buffer->CreateView());
+    CpuFeatureScope fscope(&masm, AVX2);
+
+    //  add
+    __ vpaddb(ymm6, ymm7, ymm8);
+    __ vpaddw(ymm9, ymm10, ymm11);
+    __ vpaddd(ymm12, ymm13, ymm14);
+    __ vpaddq(ymm15, ymm1, ymm2);
+
+    // sub
+
+    __ vpsubb(ymm6, ymm7, ymm8);
+    __ vpsubw(ymm9, ymm10, ymm11);
+    __ vpsubd(ymm12, ymm13, ymm14);
+    __ vpsubq(ymm15, ymm1, ymm2);
+
+    // mul, exclude I64x4
+
+    __ vpmullw(ymm6, ymm7, ymm8);
+    __ vpmulld(ymm15, ymm1, ymm2);
+
+    CodeDesc desc;
+    masm.GetCode(isolate, &desc);
+#ifdef OBJECT_PRINT
+    Handle<Code> code =
+        Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
+    StdoutStream os;
+    Print(*code, os);
+#endif
+
+    uint8_t expected[] = {// vpaddb ymm6,ymm7,ymm8
+                          0xc4, 0xc1, 0x45, 0xfc, 0xf0,
+                          // vpaddw ymm9,ymm10,ymm11
+                          0xc4, 0x41, 0x2d, 0xfd, 0xcb,
+                          // vpaddd ymm12,ymm13,ymm14
+                          0xc4, 0x41, 0x15, 0xfe, 0xe6,
+                          // vpaddq ymm15,ymm1,ymm2
+                          0xc5, 0x75, 0xd4, 0xfa,
+                          // vpsubb ymm6,ymm7,ymm8
+                          0xc4, 0xc1, 0x45, 0xf8, 0xf0,
+                          // vpsubw ymm9,ymm10,ymm11
+                          0xc4, 0x41, 0x2d, 0xf9, 0xcb,
+                          // vpsubd ymm12,ymm13,ymm14
+                          0xc4, 0x41, 0x15, 0xfa, 0xe6,
+                          // vpsubq ymm15,ymm1,ymm2
+                          0xc5, 0x75, 0xfb, 0xfa,
+                          // vpmullw ymm6,ymm7,ymm8
+                          0xc4, 0xc1, 0x45, 0xd5, 0xf0,
+                          // vpmulld ymm15,ymm1,ymm2
+                          0xc4, 0x62, 0x75, 0x40, 0xfa};
+    CHECK_EQ(0, memcmp(expected, desc.buffer, sizeof(expected)));
+  }
+}
+
 TEST_F(AssemblerX64Test, CpuFeatures_ProbeImpl) {
   // Support for a newer extension implies support for the older extensions.
   CHECK_IMPLIES(CpuFeatures::IsSupported(FMA3), CpuFeatures::IsSupported(AVX));
diff --git a/deps/v8/test/unittests/assembler/disasm-arm-unittest.cc b/deps/v8/test/unittests/assembler/disasm-arm-unittest.cc
index e0f9c5f90b96e9..0f36bdd130a84d 100644
--- a/deps/v8/test/unittests/assembler/disasm-arm-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-arm-unittest.cc
@@ -54,7 +54,7 @@ using DisasmArmTest = TestWithIsolate;
 enum UseRegex { kRawString, kRegexString };
 
 template <typename... S>
-bool DisassembleAndCompare(byte* begin, UseRegex use_regex,
+bool DisassembleAndCompare(uint8_t* begin, UseRegex use_regex,
                            S... expected_strings) {
   disasm::NameConverter converter;
   disasm::Disassembler disasm(converter);
@@ -62,10 +62,10 @@ bool DisassembleAndCompare(byte* begin, UseRegex use_regex,
 
   std::vector<std::string> expected_disassembly = {expected_strings...};
   size_t n_expected = expected_disassembly.size();
-  byte* end = begin + (n_expected * kInstrSize);
+  uint8_t* end = begin + (n_expected * kInstrSize);
 
   std::vector<std::string> disassembly;
-  for (byte* pc = begin; pc < end;) {
+  for (uint8_t* pc = begin; pc < end;) {
     pc += disasm.InstructionDecode(buffer, pc);
     disassembly.emplace_back(buffer.begin());
   }
@@ -110,11 +110,11 @@ bool DisassembleAndCompare(byte* begin, UseRegex use_regex,
 // Set up V8 to a state where we can at least run the assembler and
 // disassembler. Declare the variables and allocate the data structures used
 // in the rest of the macros.
-#define SET_UP()                                             \
-  HandleScope scope(isolate());                              \
-  byte* buffer = reinterpret_cast<byte*>(malloc(4 * 1024));  \
-  Assembler assm(AssemblerOptions{},                         \
-                 ExternalAssemblerBuffer(buffer, 4 * 1024)); \
+#define SET_UP()                                                  \
+  HandleScope scope(isolate());                                   \
+  uint8_t* buffer = reinterpret_cast<uint8_t*>(malloc(4 * 1024)); \
+  Assembler assm(AssemblerOptions{},                              \
+                 ExternalAssemblerBuffer(buffer, 4 * 1024));      \
   bool failure = false;
 
 // This macro assembles one instruction using the preallocated assembler and
@@ -124,7 +124,7 @@ bool DisassembleAndCompare(byte* begin, UseRegex use_regex,
 #define BASE_COMPARE(asm_, use_regex, ...)                             \
   {                                                                    \
     int pc_offset = assm.pc_offset();                                  \
-    byte* progcounter = &buffer[pc_offset];                            \
+    uint8_t* progcounter = &buffer[pc_offset];                         \
     assm.asm_;                                                         \
     if (!DisassembleAndCompare(progcounter, use_regex, __VA_ARGS__)) { \
       failure = true;                                                  \
@@ -1620,10 +1620,10 @@ TEST_F(DisasmArmTest, LoadStore) {
 }
 
 
-static void TestLoadLiteral(byte* buffer, Assembler* assm, bool* failure,
+static void TestLoadLiteral(uint8_t* buffer, Assembler* assm, bool* failure,
                             int offset) {
   int pc_offset = assm->pc_offset();
-  byte *progcounter = &buffer[pc_offset];
+  uint8_t *progcounter = &buffer[pc_offset];
   assm->ldr_pcrel(r0, offset);
 
   const char *expected_string_template =
diff --git a/deps/v8/test/unittests/assembler/disasm-arm64-unittest.cc b/deps/v8/test/unittests/assembler/disasm-arm64-unittest.cc
index d845144e146848..eb33d4b9f33dad 100644
--- a/deps/v8/test/unittests/assembler/disasm-arm64-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-arm64-unittest.cc
@@ -49,7 +49,7 @@ using DisasmArm64Test = TestWithIsolate;
 #define INSTR_SIZE (1024)
 #define SET_UP_MASM()                                                         \
   HandleScope scope(isolate());                                               \
-  byte* buf = static_cast<byte*>(malloc(INSTR_SIZE));                         \
+  uint8_t* buf = static_cast<uint8_t*>(malloc(INSTR_SIZE));                   \
   uint32_t encoding = 0;                                                      \
   MacroAssembler* assm =                                                      \
       new MacroAssembler((isolate()), v8::internal::CodeObjectRequired::kYes, \
@@ -61,7 +61,7 @@ using DisasmArm64Test = TestWithIsolate;
 
 #define SET_UP_ASM()                                                         \
   HandleScope scope(isolate());                                              \
-  byte* buf = static_cast<byte*>(malloc(INSTR_SIZE));                        \
+  uint8_t* buf = static_cast<uint8_t*>(malloc(INSTR_SIZE));                  \
   uint32_t encoding = 0;                                                     \
   Assembler* assm = new Assembler(AssemblerOptions{},                        \
                                   ExternalAssemblerBuffer(buf, INSTR_SIZE)); \
@@ -2012,7 +2012,7 @@ TEST_F(DisasmArm64Test, debug) {
   for (int i = 0; i < 2; i++) {
     // Loop runs with and without the simulator code enabled.
     HandleScope scope(isolate());
-    byte* buf = static_cast<byte*>(malloc(INSTR_SIZE));
+    uint8_t* buf = static_cast<uint8_t*>(malloc(INSTR_SIZE));
     uint32_t encoding = 0;
     AssemblerOptions options;
 #ifdef USE_SIMULATOR
diff --git a/deps/v8/test/unittests/assembler/disasm-ia32-unittest.cc b/deps/v8/test/unittests/assembler/disasm-ia32-unittest.cc
index ecb471701304e6..61a14993ed6125 100644
--- a/deps/v8/test/unittests/assembler/disasm-ia32-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-ia32-unittest.cc
@@ -47,7 +47,7 @@ using DisasmIa320Test = TestWithIsolate;
 
 TEST_F(DisasmIa320Test, DisasmIa320) {
   HandleScope scope(isolate());
-  v8::internal::byte buffer[8192];
+  uint8_t buffer[8192];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
   // Short immediate instructions
@@ -983,11 +983,11 @@ TEST_F(DisasmIa320Test, DisasmIa320) {
   USE(code);
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
-  Address begin = code->InstructionStart();
-  Address end = code->InstructionEnd();
-  disasm::Disassembler::Disassemble(stdout, reinterpret_cast<byte*>(begin),
-                                    reinterpret_cast<byte*>(end));
+  Print(*code, os);
+  Address begin = code->instruction_start();
+  Address end = code->instruction_end();
+  disasm::Disassembler::Disassemble(stdout, reinterpret_cast<uint8_t*>(begin),
+                                    reinterpret_cast<uint8_t*>(end));
 #endif
 }
 
diff --git a/deps/v8/test/unittests/assembler/disasm-loong64-unittest.cc b/deps/v8/test/unittests/assembler/disasm-loong64-unittest.cc
index 893f82b56833c5..b2f30c5743fc86 100644
--- a/deps/v8/test/unittests/assembler/disasm-loong64-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-loong64-unittest.cc
@@ -43,7 +43,7 @@ namespace internal {
 
 using DisasmLoong64Test = TestWithIsolate;
 
-bool DisassembleAndCompare(byte* pc, const char* compare_string) {
+bool DisassembleAndCompare(uint8_t* pc, const char* compare_string) {
   disasm::NameConverter converter;
   disasm::Disassembler disasm(converter);
   base::EmbeddedVector<char, 128> disasm_buffer;
@@ -70,11 +70,11 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 // Set up V8 to a state where we can at least run the assembler and
 // disassembler. Declare the variables and allocate the data structures used
 // in the rest of the macros.
-#define SET_UP()                                             \
-  HandleScope scope(isolate());                              \
-  byte* buffer = reinterpret_cast<byte*>(malloc(4 * 1024));  \
-  Assembler assm(AssemblerOptions{},                         \
-                 ExternalAssemblerBuffer(buffer, 4 * 1024)); \
+#define SET_UP()                                                  \
+  HandleScope scope(isolate());                                   \
+  uint8_t* buffer = reinterpret_cast<uint8_t*>(malloc(4 * 1024)); \
+  Assembler assm(AssemblerOptions{},                              \
+                 ExternalAssemblerBuffer(buffer, 4 * 1024));      \
   bool failure = false;
 
 // This macro assembles one instruction using the preallocated assembler and
@@ -84,7 +84,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE(asm_, compare_string)                                        \
   {                                                                          \
     int pc_offset = assm.pc_offset();                                        \
-    byte* progcounter = &buffer[pc_offset];                                  \
+    uint8_t* progcounter = &buffer[pc_offset];                               \
     assm.asm_;                                                               \
     if (!DisassembleAndCompare(progcounter, compare_string)) failure = true; \
   }
@@ -99,7 +99,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE_PC_REL(asm_, compare_string, offset)                           \
   {                                                                            \
     int pc_offset = assm.pc_offset();                                          \
-    byte* progcounter = &buffer[pc_offset];                                    \
+    uint8_t* progcounter = &buffer[pc_offset];                                 \
     char str_with_address[100];                                                \
     printf("%p\n", static_cast<void*>(progcounter));                           \
     snprintf(str_with_address, sizeof(str_with_address), "%s -> %p",           \
diff --git a/deps/v8/test/unittests/assembler/disasm-mips64-unittest.cc b/deps/v8/test/unittests/assembler/disasm-mips64-unittest.cc
index ed6c0ef0462734..02def4b133b088 100644
--- a/deps/v8/test/unittests/assembler/disasm-mips64-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-mips64-unittest.cc
@@ -44,7 +44,7 @@ using DisasmMips64Test = TestWithIsolate;
 
 bool prev_instr_compact_branch = false;
 
-bool DisassembleAndCompare(byte* pc, const char* compare_string) {
+bool DisassembleAndCompare(uint8_t* pc, const char* compare_string) {
   disasm::NameConverter converter;
   disasm::Disassembler disasm(converter);
   base::EmbeddedVector<char, 128> disasm_buffer;
@@ -71,11 +71,11 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 // Set up V8 to a state where we can at least run the assembler and
 // disassembler. Declare the variables and allocate the data structures used
 // in the rest of the macros.
-#define SET_UP()                                             \
-  HandleScope scope(isolate());                              \
-  byte* buffer = reinterpret_cast<byte*>(malloc(4 * 1024));  \
-  Assembler assm(AssemblerOptions{},                         \
-                 ExternalAssemblerBuffer(buffer, 4 * 1024)); \
+#define SET_UP()                                                  \
+  HandleScope scope(isolate());                                   \
+  uint8_t* buffer = reinterpret_cast<uint8_t*>(malloc(4 * 1024)); \
+  Assembler assm(AssemblerOptions{},                              \
+                 ExternalAssemblerBuffer(buffer, 4 * 1024));      \
   bool failure = false;
 
 // This macro assembles one instruction using the preallocated assembler and
@@ -85,7 +85,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE(asm_, compare_string)                                        \
   {                                                                          \
     int pc_offset = assm.pc_offset();                                        \
-    byte* progcounter = &buffer[pc_offset];                                  \
+    uint8_t* progcounter = &buffer[pc_offset];                               \
     assm.asm_;                                                               \
     if (!DisassembleAndCompare(progcounter, compare_string)) failure = true; \
   }
@@ -100,7 +100,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE_PC_REL_COMPACT(asm_, compare_string, offset)                   \
   {                                                                            \
     int pc_offset = assm.pc_offset();                                          \
-    byte* progcounter = &buffer[pc_offset];                                    \
+    uint8_t* progcounter = &buffer[pc_offset];                                 \
     char str_with_address[100];                                                \
     prev_instr_compact_branch = assm.IsPrevInstrCompactBranch();               \
     if (prev_instr_compact_branch) {                                           \
@@ -119,7 +119,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE_PC_REL(asm_, compare_string, offset)                           \
   {                                                                            \
     int pc_offset = assm.pc_offset();                                          \
-    byte* progcounter = &buffer[pc_offset];                                    \
+    uint8_t* progcounter = &buffer[pc_offset];                                 \
     char str_with_address[100];                                                \
     snprintf(str_with_address, sizeof(str_with_address), "%s -> %p",           \
              compare_string, static_cast<void*>(progcounter + (offset * 4)));  \
@@ -130,7 +130,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE_MSA_BRANCH(asm_, compare_string, offset)                       \
   {                                                                            \
     int pc_offset = assm.pc_offset();                                          \
-    byte* progcounter = &buffer[pc_offset];                                    \
+    uint8_t* progcounter = &buffer[pc_offset];                                 \
     char str_with_address[100];                                                \
     snprintf(str_with_address, sizeof(str_with_address), "%s -> %p",           \
              compare_string,                                                   \
@@ -142,7 +142,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE_PC_JUMP(asm_, compare_string, target)                          \
   {                                                                            \
     int pc_offset = assm.pc_offset();                                          \
-    byte* progcounter = &buffer[pc_offset];                                    \
+    uint8_t* progcounter = &buffer[pc_offset];                                 \
     char str_with_address[100];                                                \
     int instr_index = (target >> 2) & kImm26Mask;                              \
     snprintf(                                                                  \
@@ -157,7 +157,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define GET_PC_REGION(pc_region)                                         \
   {                                                                      \
     int pc_offset = assm.pc_offset();                                    \
-    byte* progcounter = &buffer[pc_offset];                              \
+    uint8_t* progcounter = &buffer[pc_offset];                           \
     pc_region = reinterpret_cast<int64_t>(progcounter + 4) & ~0xFFFFFFF; \
   }
 
diff --git a/deps/v8/test/unittests/assembler/disasm-ppc-unittest.cc b/deps/v8/test/unittests/assembler/disasm-ppc-unittest.cc
index 13581673ab81e6..9ebe3996657c30 100644
--- a/deps/v8/test/unittests/assembler/disasm-ppc-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-ppc-unittest.cc
@@ -42,7 +42,7 @@ namespace internal {
 
 using DisasmPpcTest = TestWithIsolate;
 
-bool DisassembleAndCompare(byte* pc, const char* compare_string) {
+bool DisassembleAndCompare(uint8_t* pc, const char* compare_string) {
   disasm::NameConverter converter;
   disasm::Disassembler disasm(converter);
   base::EmbeddedVector<char, 128> disasm_buffer;
@@ -64,11 +64,11 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 // Set up V8 to a state where we can at least run the assembler and
 // disassembler. Declare the variables and allocate the data structures used
 // in the rest of the macros.
-#define SET_UP()                                             \
-  HandleScope scope(isolate());                              \
-  byte* buffer = reinterpret_cast<byte*>(malloc(4 * 1024));  \
-  Assembler assm(AssemblerOptions{},                         \
-                 ExternalAssemblerBuffer(buffer, 4 * 1024)); \
+#define SET_UP()                                                  \
+  HandleScope scope(isolate());                                   \
+  uint8_t* buffer = reinterpret_cast<uint8_t*>(malloc(4 * 1024)); \
+  Assembler assm(AssemblerOptions{},                              \
+                 ExternalAssemblerBuffer(buffer, 4 * 1024));      \
   bool failure = false;
 
 // This macro assembles one instruction using the preallocated assembler and
@@ -78,7 +78,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE(asm_, compare_string)                                        \
   {                                                                          \
     int pc_offset = assm.pc_offset();                                        \
-    byte* progcounter = &buffer[pc_offset];                                  \
+    uint8_t* progcounter = &buffer[pc_offset];                               \
     assm.asm_;                                                               \
     if (!DisassembleAndCompare(progcounter, compare_string)) failure = true; \
   }
diff --git a/deps/v8/test/unittests/assembler/disasm-riscv-unittest.cc b/deps/v8/test/unittests/assembler/disasm-riscv-unittest.cc
index 7bff5b992524b7..a4a86ee4e197ee 100644
--- a/deps/v8/test/unittests/assembler/disasm-riscv-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-riscv-unittest.cc
@@ -44,7 +44,7 @@ using DisasmRiscv64Test = TestWithIsolate;
 
 bool prev_instr_compact_branch = false;
 
-bool DisassembleAndCompare(byte* pc, const char* compare_string) {
+bool DisassembleAndCompare(uint8_t* pc, const char* compare_string) {
   disasm::NameConverter converter;
   disasm::Disassembler disasm(converter);
   base::EmbeddedVector<char, 128> disasm_buffer;
@@ -71,11 +71,11 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 // Set up V8 to a state where we can at least run the assembler and
 // disassembler. Declare the variables and allocate the data structures used
 // in the rest of the macros.
-#define SET_UP()                                             \
-  HandleScope scope(isolate());                              \
-  byte* buffer = reinterpret_cast<byte*>(malloc(4 * 1024));  \
-  Assembler assm(AssemblerOptions{},                         \
-                 ExternalAssemblerBuffer(buffer, 4 * 1024)); \
+#define SET_UP()                                                  \
+  HandleScope scope(isolate());                                   \
+  uint8_t* buffer = reinterpret_cast<uint8_t*>(malloc(4 * 1024)); \
+  Assembler assm(AssemblerOptions{},                              \
+                 ExternalAssemblerBuffer(buffer, 4 * 1024));      \
   bool failure = false;
 
 // This macro assembles one instruction using the preallocated assembler and
@@ -85,7 +85,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE(asm_, compare_string)                                        \
   {                                                                          \
     int pc_offset = assm.pc_offset();                                        \
-    byte* progcounter = &buffer[pc_offset];                                  \
+    uint8_t* progcounter = &buffer[pc_offset];                               \
     assm.asm_;                                                               \
     if (!DisassembleAndCompare(progcounter, compare_string)) failure = true; \
   }
@@ -93,7 +93,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE_PC_REL(asm_, compare_string, offset)                           \
   {                                                                            \
     int pc_offset = assm.pc_offset();                                          \
-    byte* progcounter = &buffer[pc_offset];                                    \
+    uint8_t* progcounter = &buffer[pc_offset];                                 \
     char str_with_address[100];                                                \
     snprintf(str_with_address, sizeof(str_with_address), "%s -> %p",           \
              compare_string, static_cast<void*>(progcounter + (offset)));      \
@@ -537,10 +537,10 @@ TEST_F(DisasmRiscv64Test, RVV) {
   SET_UP();
   COMPARE(VU.set(kScratchReg, E64, m1),
           "018079d7       vsetvli   s3, zero_reg, E64, m1");
-  COMPARE(vl(v2, a0, 0, VSew::E8), "02050107       vle8.v       v2, (a0)");
-  COMPARE(vl(v2, a0, 0, VSew::E8), "02050107       vle8.v       v2, (a0)");
-  COMPARE(vl(v2, a0, 0, VSew::E16), "02055107       vle16.v       v2, (a0)");
-  COMPARE(vl(v2, a0, 0, VSew::E32), "02056107       vle32.v       v2, (a0)");
+  COMPARE(vl(v2, a0, 0, VSew::E8), "02050107       vle8.v    v2, (a0)");
+  COMPARE(vl(v2, a0, 0, VSew::E16), "02055107       vle16.v    v2, (a0)");
+  COMPARE(vl(v2, a0, 0, VSew::E32), "02056107       vle32.v    v2, (a0)");
+  COMPARE(vl(v2, a0, 0, VSew::E64), "02057107       vle64.v    v2, (a0)");
 
   COMPARE(vadd_vv(v0, v0, v1), "02008057       vadd.vv   v0, v0, v1");
   COMPARE(vadd_vx(v0, v1, t0), "0212c057       vadd.vx   v0, v1, t0");
@@ -646,9 +646,9 @@ TEST_F(DisasmRiscv64Test, RVV) {
   COMPARE(vfwsub_wf(v17, v28, fa5), "dbc7d8d7       vfwsub.wf v17, v28, fa5");
 
   // Vector Widening Floating-Point Reduction Instructions
-  COMPARE(vfwredusum_vv(v17, v14, v28),
+  COMPARE(vfwredusum_vs(v17, v14, v28),
           "c6ee18d7       vfwredusum.vs v17, v14, v28");
-  COMPARE(vfwredosum_vv(v17, v14, v28),
+  COMPARE(vfwredosum_vs(v17, v14, v28),
           "ceee18d7       vfwredosum.vs v17, v14, v28");
 
   // Vector Widening Floating-Point Multiply
diff --git a/deps/v8/test/unittests/assembler/disasm-s390-unittest.cc b/deps/v8/test/unittests/assembler/disasm-s390-unittest.cc
index c484d033846d01..c2ac69d4d2d6c6 100644
--- a/deps/v8/test/unittests/assembler/disasm-s390-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-s390-unittest.cc
@@ -42,7 +42,7 @@ namespace internal {
 
 using DisasmS390Test = TestWithIsolate;
 
-bool DisassembleAndCompare(byte* pc, const char* compare_string) {
+bool DisassembleAndCompare(uint8_t* pc, const char* compare_string) {
   disasm::NameConverter converter;
   disasm::Disassembler disasm(converter);
   base::EmbeddedVector<char, 128> disasm_buffer;
@@ -64,11 +64,11 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 // Set up V8 to a state where we can at least run the assembler and
 // disassembler. Declare the variables and allocate the data structures used
 // in the rest of the macros.
-#define SET_UP()                                             \
-  HandleScope scope(isolate());                              \
-  byte* buffer = reinterpret_cast<byte*>(malloc(4 * 1024));  \
-  Assembler assm(AssemblerOptions{},                         \
-                 ExternalAssemblerBuffer(buffer, 4 * 1024)); \
+#define SET_UP()                                                  \
+  HandleScope scope(isolate());                                   \
+  uint8_t* buffer = reinterpret_cast<uint8_t*>(malloc(4 * 1024)); \
+  Assembler assm(AssemblerOptions{},                              \
+                 ExternalAssemblerBuffer(buffer, 4 * 1024));      \
   bool failure = false;
 
 // This macro assembles one instruction using the preallocated assembler and
@@ -78,7 +78,7 @@ bool DisassembleAndCompare(byte* pc, const char* compare_string) {
 #define COMPARE(asm_, compare_string)                                        \
   {                                                                          \
     int pc_offset = assm.pc_offset();                                        \
-    byte* progcounter = &buffer[pc_offset];                                  \
+    uint8_t* progcounter = &buffer[pc_offset];                               \
     assm.asm_;                                                               \
     if (!DisassembleAndCompare(progcounter, compare_string)) failure = true; \
   }
diff --git a/deps/v8/test/unittests/assembler/disasm-x64-unittest.cc b/deps/v8/test/unittests/assembler/disasm-x64-unittest.cc
index e309fe7ebf71e2..8101a741052d03 100644
--- a/deps/v8/test/unittests/assembler/disasm-x64-unittest.cc
+++ b/deps/v8/test/unittests/assembler/disasm-x64-unittest.cc
@@ -50,7 +50,7 @@ using DisasmX64Test = TestWithIsolate;
 namespace {
 
 Handle<Code> CreateDummyCode(Isolate* isolate) {
-  i::byte buffer[128];
+  uint8_t buffer[128];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof(buffer)));
   __ nop();
@@ -66,7 +66,7 @@ Handle<Code> CreateDummyCode(Isolate* isolate) {
 
 TEST_F(DisasmX64Test, DisasmX64) {
   HandleScope handle_scope(isolate());
-  v8::internal::byte buffer[8192];
+  uint8_t buffer[8192];
   Assembler assm(AssemblerOptions{},
                  ExternalAssemblerBuffer(buffer, sizeof buffer));
   // Some instructions are tested in DisasmX64CheckOutput.
@@ -304,11 +304,11 @@ TEST_F(DisasmX64Test, DisasmX64) {
   USE(code);
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
-  Address begin = code->InstructionStart();
-  Address end = code->InstructionStart();
-  disasm::Disassembler::Disassemble(stdout, reinterpret_cast<byte*>(begin),
-                                    reinterpret_cast<byte*>(end));
+  Print(*code, os);
+  Address begin = code->instruction_start();
+  Address end = code->instruction_start();
+  disasm::Disassembler::Disassemble(stdout, reinterpret_cast<uint8_t*>(begin),
+                                    reinterpret_cast<uint8_t*>(end));
 #endif
 }
 
@@ -331,7 +331,7 @@ struct DisassemblerTester {
 
   Assembler* assm() { return &assm_; }
 
-  v8::internal::byte buffer_[kAssemblerBufferSize];
+  uint8_t buffer_[kAssemblerBufferSize];
   Assembler assm_;
   disasm::NameConverter converter_;
   disasm::Disassembler disasm;
@@ -749,6 +749,15 @@ TEST_F(DisasmX64Test, DisasmX64CheckOutput) {
           cmovq(less_equal, rax, Operand(rdx, 2)));
   COMPARE("480f4f4203           REX.W cmovgq rax,[rdx+0x3]",
           cmovq(greater, rax, Operand(rdx, 3)));
+  COMPARE("4180f803             cmpb r8l,0x3", cmpb(r8, Immediate(0x3)));
+  COMPARE("6681fa1008           cmpw rdx,0x810", cmpw(rdx, Immediate(0x810)));
+  COMPARE("4180e208             andb r10l,0x8", andb(r10, Immediate(0x8)));
+  COMPARE("4181e1ff3f0000       andl r9,0x3fff", andl(r9, Immediate(0x3fff)));
+  COMPARE("4183e30f             andl r11,0xf", andl(r11, Immediate(0xf)));
+  COMPARE("4883c418             REX.W addq rsp,0x18",
+          addq(rsp, Immediate(0x18)));
+  COMPARE("4881c1cd000000       REX.W addq rcx,0xcd",
+          addq(rcx, Immediate(0xcd)));
 }
 
 // This compares just the disassemble instruction (without the hex).
@@ -1441,6 +1450,8 @@ TEST_F(DisasmX64Test, DisasmX64YMMRegister) {
             vhaddps(ymm0, ymm1, Operand(rbx, rcx, times_4, 10000)));
     COMPARE("c4e27d18bc8b10270000 vbroadcastss ymm7,[rbx+rcx*4+0x2710]",
             vbroadcastss(ymm7, Operand(rbx, rcx, times_4, 10000)));
+    COMPARE("c4e27d19b48b10270000 vbroadcastsd ymm6,[rbx+rcx*4+0x2710]",
+            vbroadcastsd(ymm6, Operand(rbx, rcx, times_4, 10000)));
     COMPARE("c5ff12da             vmovddup ymm3,ymm2", vmovddup(ymm3, ymm2));
     COMPARE("c5ff12a48b10270000   vmovddup ymm4,[rbx+rcx*4+0x2710]",
             vmovddup(ymm4, Operand(rbx, rcx, times_4, 10000)));
@@ -1454,6 +1465,8 @@ TEST_F(DisasmX64Test, DisasmX64YMMRegister) {
             vcvttps2dq(ymm3, ymm2));
     COMPARE("c5fe5b9c8b10270000   vcvttps2dq ymm3,[rbx+rcx*4+0x2710]",
             vcvttps2dq(ymm3, Operand256(rbx, rcx, times_4, 10000)));
+    COMPARE("c4e36d06cb02         vperm2f128 ymm1,ymm2,ymm3,0x2",
+            vperm2f128(ymm1, ymm2, ymm3, 2));
 
     // vcmp
     COMPARE("c5dcc2e900           vcmpps ymm5,ymm4,ymm1, (eq)",
@@ -1472,6 +1485,9 @@ TEST_F(DisasmX64Test, DisasmX64YMMRegister) {
             vcmpnlepd(ymm5, ymm4, Operand(rbx, rcx, times_4, 10000)));
     COMPARE("c5dcc2e90d           vcmpps ymm5,ymm4,ymm1, (ge)",
             vcmpgeps(ymm5, ymm4, ymm1));
+    COMPARE("c4e27d17f9           vptest ymm7,ymm1", vptest(ymm7, ymm1));
+    COMPARE("c4627d17948b10270000 vptest ymm10,[rbx+rcx*4+0x2710]",
+            vptest(ymm10, Operand(rbx, rcx, times_4, 10000)));
 
     // SSE2_UNOP
     COMPARE("c5fd51ca             vsqrtpd ymm1,ymm2", vsqrtpd(ymm1, ymm2));
@@ -1496,6 +1512,8 @@ TEST_F(DisasmX64Test, DisasmX64YMMRegister) {
     // Short immediate instructions
     COMPARE("c4e27d18d1           vbroadcastss ymm2,xmm1",
             vbroadcastss(ymm2, xmm1));
+    COMPARE("c4e27d19f1           vbroadcastsd ymm6,xmm1",
+            vbroadcastsd(ymm6, xmm1));
     COMPARE("c4e27d789c8b10270000 vpbroadcastb ymm3,[rbx+rcx*4+0x2710]",
             vpbroadcastb(ymm3, Operand(rbx, rcx, times_4, 10000)));
     COMPARE("c4e27d79d3           vpbroadcastw ymm2,xmm3",
@@ -1509,6 +1527,24 @@ TEST_F(DisasmX64Test, DisasmX64YMMRegister) {
             vpabsb(ymm3, Operand(rbx, rcx, times_4, 10000)));
     COMPARE("c4e27d1df5           vpabsw ymm6,ymm5", vpabsw(ymm6, ymm5));
     COMPARE("c4c27d1efa           vpabsd ymm7,ymm10", vpabsd(ymm7, ymm10));
+    COMPARE("c4e3fd00ebd8         vpermq ymm5,ymm3,0xd8",
+            vpermq(ymm5, ymm3, 0xD8));
+    COMPARE("c463fd00848b102700001e vpermq ymm8,[rbx+rcx*4+0x2710],0x1e",
+            vpermq(ymm8, Operand(rbx, rcx, times_4, 10000), 0x1E));
+
+    // SSE4_UNOP
+    COMPARE("c4e27d20f5           vpmovsxbw ymm6,ymm5", vpmovsxbw(ymm6, ymm5));
+    COMPARE("c4e27d238c8b10270000 vpmovsxwd ymm1,[rbx+rcx*4+0x2710]",
+            vpmovsxwd(ymm1, Operand(rbx, rcx, times_4, 10000)));
+    COMPARE("c4627d25f6           vpmovsxdq ymm14,ymm6",
+            vpmovsxdq(ymm14, ymm6));
+    COMPARE("c4e27d30848b10270000 vpmovzxbw ymm0,[rbx+rcx*4+0x2710]",
+            vpmovzxbw(ymm0, Operand(rbx, rcx, times_4, 10000)));
+    COMPARE("c4627d31f6           vpmovzxbd ymm14,ymm6",
+            vpmovzxbd(ymm14, ymm6));
+    COMPARE("c4e27d33bc8b10270000 vpmovzxwd ymm7,[rbx+rcx*4+0x2710]",
+            vpmovzxwd(ymm7, Operand(rbx, rcx, times_4, 10000)));
+    COMPARE("c4627d35c6           vpmovzxdq ymm8,ymm6", vpmovzxdq(ymm8, ymm6));
   }
 }
 
diff --git a/deps/v8/test/unittests/assembler/macro-assembler-arm-unittest.cc b/deps/v8/test/unittests/assembler/macro-assembler-arm-unittest.cc
index f7ec44e77fd7e1..9bc409a8688e8b 100644
--- a/deps/v8/test/unittests/assembler/macro-assembler-arm-unittest.cc
+++ b/deps/v8/test/unittests/assembler/macro-assembler-arm-unittest.cc
@@ -152,21 +152,21 @@ TEST_P(MacroAssemblerTestMoveObjectAndSlot, MoveObjectAndSlot) {
     __ Ret();
 
     CodeDesc desc;
-    masm.GetCode(nullptr, &desc);
+    masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
     if (v8_flags.print_code) {
       Handle<Code> code =
           Factory::CodeBuilder(isolate(), desc, CodeKind::FOR_TESTING).Build();
       StdoutStream os;
-      code->Print(os);
+      Print(*code, os);
     }
 
     buffer->MakeExecutable();
     // We need an isolate here to execute in the simulator.
-    auto f = GeneratedCode<void, byte**, byte*>::FromBuffer(isolate(),
-                                                            buffer->start());
+    auto f = GeneratedCode<void, uint8_t**, uint8_t*>::FromBuffer(
+        isolate(), buffer->start());
 
-    byte* object = new byte[offset];
-    byte* result[] = {nullptr, nullptr};
+    uint8_t* object = new uint8_t[offset];
+    uint8_t* result[] = {nullptr, nullptr};
 
     f.Call(result, object);
 
diff --git a/deps/v8/test/unittests/assembler/macro-assembler-arm64-unittest.cc b/deps/v8/test/unittests/assembler/macro-assembler-arm64-unittest.cc
index 3bbbc49096136f..257f3fdab06627 100644
--- a/deps/v8/test/unittests/assembler/macro-assembler-arm64-unittest.cc
+++ b/deps/v8/test/unittests/assembler/macro-assembler-arm64-unittest.cc
@@ -103,8 +103,9 @@ TEST_F(MacroAssemblerTest, CompareAndBranch) {
         Label start, lab;
         __ Bind(&start);
         __ CompareAndBranch(x0, Immediate(imm), cond, &lab);
-        if (imm == 0 && ((cond == eq) || (cond == ne) || (cond == hi) ||
-                         (cond == ls))) {  // One instruction generated
+        if (imm == 0 &&
+            ((cond == eq) || (cond == ne) || (cond == hi) || (cond == ls) ||
+             (cond == lt) || (cond == ge))) {  // One instruction generated
           ASSERT_EQ(kInstrSize, __ SizeOfCodeGeneratedSince(&start));
         } else {  // Two instructions generated
           ASSERT_EQ(static_cast<uint8_t>(2 * kInstrSize),
@@ -215,22 +216,22 @@ TEST_P(MacroAssemblerTestMoveObjectAndSlot, MoveObjectAndSlot) {
       __ Ret();
 
       CodeDesc desc;
-      masm.GetCode(nullptr, &desc);
+      masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
       if (v8_flags.print_code) {
         Handle<Code> code =
             Factory::CodeBuilder(isolate(), desc, CodeKind::FOR_TESTING)
                 .Build();
         StdoutStream os;
-        code->Print(os);
+        Print(*code, os);
       }
     }
 
     // We need an isolate here to execute in the simulator.
-    auto f = GeneratedCode<void, byte**, byte*>::FromBuffer(isolate(),
-                                                            buffer->start());
+    auto f = GeneratedCode<void, uint8_t**, uint8_t*>::FromBuffer(
+        isolate(), buffer->start());
 
-    byte* object = new byte[offset];
-    byte* result[] = {nullptr, nullptr};
+    uint8_t* object = new uint8_t[offset];
+    uint8_t* result[] = {nullptr, nullptr};
 
     f.Call(result, object);
 
diff --git a/deps/v8/test/unittests/assembler/macro-assembler-ia32-unittest.cc b/deps/v8/test/unittests/assembler/macro-assembler-ia32-unittest.cc
index cbf628ba889793..05d252e276f34a 100644
--- a/deps/v8/test/unittests/assembler/macro-assembler-ia32-unittest.cc
+++ b/deps/v8/test/unittests/assembler/macro-assembler-ia32-unittest.cc
@@ -13,7 +13,7 @@ namespace internal {
 
 #define __ masm.
 
-// Test the x64 assembler by compiling some simple functions into
+// Test the ia32 assembler by compiling some simple functions into
 // a buffer and executing them.  These tests do not initialize the
 // V8 library, create a context, or use any V8 objects.
 
@@ -59,6 +59,60 @@ TEST_F(MacroAssemblerTest, TestCheck) {
   ASSERT_DEATH_IF_SUPPORTED({ f.Call(17); }, "abort: no reason");
 }
 
+TEST_F(MacroAssemblerTest, TestPCRelLea) {
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler masm(isolate(), AssemblerOptions{}, CodeObjectRequired::kNo,
+                      buffer->CreateView());
+  __ set_root_array_available(false);
+  __ set_abort_hard(true);
+
+  Label pt;
+  __ LoadLabelAddress(ecx, &pt);
+  __ mov(eax, 42);
+  __ call(ecx);
+  __ cmp(eax, 56);
+  __ Check(Condition::equal, AbortReason::kNoReason);
+  __ ret(0);
+  __ bind(&pt);
+  __ mov(eax, 56);
+  __ ret(0);
+
+  CodeDesc desc;
+  masm.GetCode(isolate(), &desc);
+  buffer->MakeExecutable();
+  auto f = GeneratedCode<void, int>::FromBuffer(isolate(), buffer->start());
+
+  f.Call(0);
+}
+
+TEST_F(MacroAssemblerTest, TestDefinedPCRelLea) {
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler masm(isolate(), AssemblerOptions{}, CodeObjectRequired::kNo,
+                      buffer->CreateView());
+  __ set_root_array_available(false);
+  __ set_abort_hard(true);
+
+  Label pt, start;
+  __ jmp(&start);
+  __ bind(&pt);
+  __ mov(eax, 56);
+  __ ret(0);
+  __ bind(&start);
+  __ LoadLabelAddress(ecx, &pt);
+  __ mov(eax, 42);
+  __ call(ecx);
+  __ cmp(eax, 56);
+  __ Check(Condition::equal, AbortReason::kNoReason);
+  __ ret(0);
+
+  CodeDesc desc;
+  masm.GetCode(isolate(), &desc);
+  buffer->MakeExecutable();
+  auto f = GeneratedCode<void, int>::FromBuffer(isolate(), buffer->start());
+
+  f.Call(0);
+}
+
 #undef __
 
 }  // namespace internal
diff --git a/deps/v8/test/unittests/assembler/macro-assembler-riscv-unittest.cc b/deps/v8/test/unittests/assembler/macro-assembler-riscv-unittest.cc
index 8e74ae692c4f65..028a66dede63ab 100644
--- a/deps/v8/test/unittests/assembler/macro-assembler-riscv-unittest.cc
+++ b/deps/v8/test/unittests/assembler/macro-assembler-riscv-unittest.cc
@@ -29,7 +29,7 @@ TEST_F(MacroAssemblerTest, TestHardAbort) {
   __ Abort(AbortReason::kNoReason);
 
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
   buffer->MakeExecutable();
   // We need an isolate here to execute in the simulator.
   auto f = GeneratedCode<void>::FromBuffer(isolate(), buffer->start());
@@ -48,7 +48,7 @@ TEST_F(MacroAssemblerTest, TestCheck) {
   __ Ret();
 
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
   buffer->MakeExecutable();
   // We need an isolate here to execute in the simulator.
   auto f = GeneratedCode<void, int>::FromBuffer(isolate(), buffer->start());
diff --git a/deps/v8/test/unittests/assembler/macro-assembler-x64-unittest.cc b/deps/v8/test/unittests/assembler/macro-assembler-x64-unittest.cc
index 9924b620eeefd6..07563d48d653c2 100644
--- a/deps/v8/test/unittests/assembler/macro-assembler-x64-unittest.cc
+++ b/deps/v8/test/unittests/assembler/macro-assembler-x64-unittest.cc
@@ -27,8 +27,13 @@
 
 #include <stdlib.h>
 
+#include <cstdint>
+#include <cstring>
+
 #include "src/codegen/macro-assembler.h"
 #include "src/codegen/x64/assembler-x64-inl.h"
+#include "src/codegen/x64/assembler-x64.h"
+#include "src/codegen/x64/register-x64.h"
 #include "src/deoptimizer/deoptimizer.h"
 #include "src/execution/simulator.h"
 #include "src/heap/factory.h"
@@ -36,6 +41,7 @@
 #include "src/objects/smi.h"
 #include "src/utils/ostreams.h"
 #include "test/common/assembler-tester.h"
+#include "test/common/value-helper.h"
 #include "test/unittests/test-utils.h"
 
 namespace v8 {
@@ -49,6 +55,15 @@ namespace internal {
 
 using MacroAssemblerX64Test = TestWithIsolate;
 
+void PrintCode(Isolate* isolate, CodeDesc desc) {
+#ifdef OBJECT_PRINT
+  Handle<Code> code =
+      Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
+  StdoutStream os;
+  Print(*code, os);
+#endif  // OBJECT_PRINT
+}
+
 TEST_F(MacroAssemblerX64Test, TestHardAbort) {
   auto buffer = AllocateAssemblerBuffer();
   MacroAssembler masm(isolate(), AssemblerOptions{}, CodeObjectRequired::kNo,
@@ -103,6 +118,18 @@ namespace test_macro_assembler_x64 {
 // with GCC.  A different convention is used on 64-bit windows.
 
 using F0 = int();
+using F1 = int(uint64_t*, uint64_t*, uint64_t*);
+using F2 = int(uint64_t*, uint64_t*, uint64_t*, uint64_t*);
+using F3 = int(int8_t, int8_t*, int8_t*, int8_t*);
+using F4 = int(int16_t, int16_t*, int16_t*, int16_t*);
+using F5 = int(int32_t, int32_t*, int32_t*, int32_t*);
+using F6 = int(int64_t, int64_t*, int64_t*, int64_t*);
+using F7 = int(double*, double*, double*);
+using F8 = int(float*, float*, float*);
+using F9 = int(int16_t*, int32_t*);
+using F10 = int(int8_t*, int16_t*);
+using F11 = int(uint16_t*, uint32_t*);
+using F12 = int(uint8_t*, uint16_t*);
 
 #define __ masm->
 
@@ -138,9 +165,9 @@ TEST_F(MacroAssemblerX64Test, Smi) {
     bool is_in_range = number >= Smi::kMinValue && number <= Smi::kMaxValue;
     CHECK_EQ(is_in_range, is_valid);
     if (is_valid) {
-      Smi smi_from_intptr = Smi::FromIntptr(number);
+      Tagged<Smi> smi_from_intptr = Smi::FromIntptr(number);
       if (static_cast<int>(number) == number) {  // Is a 32-bit int.
-        Smi smi_from_int = Smi::FromInt(static_cast<int32_t>(number));
+        Tagged<Smi> smi_from_int = Smi::FromInt(static_cast<int32_t>(number));
         CHECK_EQ(smi_from_int, smi_from_intptr);
       }
       int64_t smi_value = smi_from_intptr.value();
@@ -149,7 +176,8 @@ TEST_F(MacroAssemblerX64Test, Smi) {
   }
 }
 
-static void TestMoveSmi(MacroAssembler* masm, Label* exit, int id, Smi value) {
+static void TestMoveSmi(MacroAssembler* masm, Label* exit, int id,
+                        Tagged<Smi> value) {
   __ movl(rax, Immediate(id));
   __ Move(rcx, value);
   __ Move(rdx, static_cast<intptr_t>(value.ptr()));
@@ -514,17 +542,17 @@ TEST_F(MacroAssemblerX64Test, EmbeddedObj) {
       Factory::CodeBuilder(isolate, desc, CodeKind::FOR_TESTING).Build();
 #ifdef OBJECT_PRINT
   StdoutStream os;
-  code->Print(os);
+  Print(*code, os);
 #endif
   using myF0 = Address();
-  auto f = GeneratedCode<myF0>::FromAddress(isolate, code->code_entry_point());
-  Object result = Object(f.Call());
+  auto f = GeneratedCode<myF0>::FromAddress(isolate, code->instruction_start());
+  Tagged<Object> result = Object(f.Call());
   CHECK_EQ(old_array->ptr(), result.ptr());
 
   // Collect garbage to ensure reloc info can be walked by the heap.
-  CollectAllGarbage();
-  CollectAllGarbage();
-  CollectAllGarbage();
+  InvokeMajorGC();
+  InvokeMajorGC();
+  InvokeMajorGC();
 
   PtrComprCageBase cage_base(isolate);
 
@@ -1079,6 +1107,92 @@ TEST_F(MacroAssemblerX64Test, SIMDMacros) {
   CHECK_EQ(0, result);
 }
 
+TEST_F(MacroAssemblerX64Test, S256Select) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister mask = ymm1;
+  const YMMRegister src1 = ymm2;
+  const YMMRegister src2 = ymm3;
+  const YMMRegister tmp = ymm4;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load src1, src2, mask
+  __ vmovdqu(src1, Operand(arg_reg_1, 0));
+  __ vmovdqu(src2, Operand(arg_reg_2, 0));
+  __ vmovdqu(mask, Operand(arg_reg_3, 0));
+  // Bitselect
+  __ S256Select(dst, mask, src1, src2, tmp);
+  // Store result
+  __ vmovdqu(Operand(arg_reg_4, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(isolate, desc);
+
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F2>::FromBuffer(i_isolate(), buffer->start());
+
+  std::vector<std::array<uint64_t, 12>> test_cases = {
+      {0xAAAAAAAAAAAAAAAA, 0xAAAAAAAAAAAAAAAA, 0xAAAAAAAAAAAAAAAA,
+       0xAAAAAAAAAAAAAAAA, 0xBBBBBBBBBBBBBBBB, 0xBBBBBBBBBBBBBBBB,
+       0xBBBBBBBBBBBBBBBB, 0xBBBBBBBBBBBBBBBB, 0x00112345F00FFFFF,
+       0x10112021BBAABBAA, 0x0000000000000000, 0x0000000000000000},
+      {0xAAAAAAAAAAAAAAAA, 0xAAAAAAAAAAAAAAAA, 0xAAAAAAAAAAAAAAAA,
+       0xAAAAAAAAAAAAAAAA, 0xBBBBBBBBBBBBBBBB, 0xBBBBBBBBBBBBBBBB,
+       0xBBBBBBBBBBBBBBBB, 0xBBBBBBBBBBBBBBBB, 0x1111111111111111,
+       0x1111111111111111, 0x0123456789ABCDEF, 0xFEDCBA9876543210},
+      {0xAAAAAAAAAAAAAAAA, 0xAAAAAAAAAAAAAAAA, 0xAAAAAAAAAAAAAAAA,
+       0xAAAAAAAAAAAAAAAA, 0x5555555555555555, 0x5555555555555555,
+       0x5555555555555555, 0x5555555555555555, 0x0123456789ABCDEF,
+       0xFEDCBA9876543210, 0x55555555AAAAAAAA, 0x00000000FFFFFFFF},
+      {0x499602D2499602D2, 0x499602D2499602D2, 0x1234567812345678,
+       0x1234567812345678, 0xB669FD2EB669FD2E, 0xB669FD2EB669FD2E,
+       0x90ABCDEF90ABCDEF, 0x90ABCDEF90ABCDEF, 0xCDEFCDEFCDEFCDEF,
+       0xCDEFCDEFCDEFCDEF, 0xCDEFCDEFCDEFCDEF, 0xCDEFCDEFCDEFCDEF}};
+
+  uint64_t v1[4];
+  uint64_t v2[4];
+  uint64_t c[4];
+  uint64_t output[4];
+
+  for (const auto& arr : test_cases) {
+    v1[0] = arr[0];
+    v1[1] = arr[1];
+    v1[2] = arr[2];
+    v1[3] = arr[3];
+
+    v2[0] = arr[4];
+    v2[1] = arr[5];
+    v2[2] = arr[6];
+    v2[3] = arr[7];
+
+    c[0] = arr[8];
+    c[1] = arr[9];
+    c[2] = arr[10];
+    c[3] = arr[11];
+
+    f.Call(v1, v2, c, output);
+
+    for (int i = 0; i < 4; i++) {
+      CHECK_EQ(output[i], (v1[i] & c[i]) | (v2[i] & ~c[i]));
+    }
+  }
+}
+
 TEST_F(MacroAssemblerX64Test, AreAliased) {
   DCHECK(!AreAliased(rax));
   DCHECK(!AreAliased(rax, no_reg));
@@ -1116,6 +1230,876 @@ TEST_F(MacroAssemblerX64Test, DeoptExitSizeIsFixed) {
   }
 }
 
+TEST_F(MacroAssemblerX64Test, I64x2Mul) {
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const XMMRegister dst = xmm0;
+  const XMMRegister lhs = xmm1;
+  const XMMRegister rhs = xmm2;
+  const XMMRegister tmp1 = xmm3;
+  const XMMRegister tmp2 = xmm4;
+
+  // Load array
+  __ movdqu(lhs, Operand(arg_reg_1, 0));
+  __ movdqu(rhs, Operand(arg_reg_2, 0));
+  // Calculation
+  __ I64x2Mul(dst, lhs, rhs, tmp1, tmp2);
+  // Store result array
+  __ movdqu(Operand(arg_reg_3, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(isolate, desc);
+
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F1>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr uint64_t uint64_max = std::numeric_limits<uint64_t>::max();
+
+  std::vector<std::array<uint64_t, 4>> test_cases = {
+      {1, 2, 3, 4},
+      {324, 25, 124, 62346},
+      {345, 263, 2346, 3468},
+      {0, 0, 0, 0},
+      {uint64_max, uint64_max, uint64_max, uint64_max}};
+
+  uint64_t left[2];
+  uint64_t right[2];
+  uint64_t output[2];
+
+  for (const auto& arr : test_cases) {
+    left[0] = arr[0];
+    left[1] = arr[1];
+    right[0] = arr[2];
+    right[1] = arr[3];
+
+    f.Call(left, right, output);
+    CHECK_EQ(output[0], left[0] * right[0]);
+    CHECK_EQ(output[1], left[1] * right[1]);
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, I64x4Mul) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister lhs = ymm1;
+  const YMMRegister rhs = ymm2;
+  const YMMRegister tmp1 = ymm3;
+  const YMMRegister tmp2 = ymm4;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(lhs, Operand(arg_reg_1, 0));
+  __ vmovdqu(rhs, Operand(arg_reg_2, 0));
+  // Calculation
+  __ I64x4Mul(dst, lhs, rhs, tmp1, tmp2);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_3, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(isolate, desc);
+
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F1>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr uint64_t uint64_max = std::numeric_limits<uint64_t>::max();
+
+  std::vector<std::array<uint64_t, 8>> test_cases = {
+      {1, 2, 3, 4, 5, 6, 7, 8},
+      {324, 25, 124, 62346, 2356, 236, 12534, 6346},
+      {345, 263, 2346, 3468, 2346, 1264, 236, 236},
+      {0, 0, 0, 0, 0, 0, 0, 0},
+      {uint64_max, uint64_max, uint64_max, uint64_max, uint64_max, uint64_max,
+       uint64_max, uint64_max}};
+
+  uint64_t left[4];
+  uint64_t right[4];
+  uint64_t output[4];
+
+  for (const auto& arr : test_cases) {
+    left[0] = arr[0];
+    left[1] = arr[1];
+    left[2] = arr[2];
+    left[3] = arr[3];
+    right[0] = arr[4];
+    right[1] = arr[5];
+    right[2] = arr[6];
+    right[3] = arr[7];
+
+    f.Call(left, right, output);
+    CHECK_EQ(output[0], left[0] * right[0]);
+    CHECK_EQ(output[1], left[1] * right[1]);
+    CHECK_EQ(output[2], left[2] * right[2]);
+    CHECK_EQ(output[3], left[3] * right[3]);
+  }
+}
+
+#define TEST_ISLPAT(name, lane_size, lane_num, Fn)                            \
+  TEST_F(MacroAssemblerX64Test, name) {                                       \
+    if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2))    \
+      return;                                                                 \
+    Isolate* isolate = i_isolate();                                           \
+    HandleScope handles(isolate);                                             \
+    auto buffer = AllocateAssemblerBuffer();                                  \
+    MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes, \
+                             buffer->CreateView());                           \
+    MacroAssembler* masm = &assembler;                                        \
+    CpuFeatureScope avx_scope(masm, AVX);                                     \
+    CpuFeatureScope avx2_scope(masm, AVX2);                                   \
+                                                                              \
+    /* src is register */                                                     \
+    __ name(ymm0, arg_reg_1);                                                 \
+    __ vmovdqu(Operand(arg_reg_3, 0), ymm0);                                  \
+                                                                              \
+    /* src is address*/                                                       \
+    __ name(ymm0, Operand(arg_reg_2, 0));                                     \
+    __ vmovdqu(Operand(arg_reg_4, 0), ymm0);                                  \
+    __ ret(0);                                                                \
+                                                                              \
+    CodeDesc desc;                                                            \
+    __ GetCode(i_isolate(), &desc);                                           \
+                                                                              \
+    PrintCode(isolate, desc);                                                 \
+    buffer->MakeExecutable();                                                 \
+    /* Call the function from C++. */                                         \
+    auto f = GeneratedCode<Fn>::FromBuffer(i_isolate(), buffer->start());     \
+                                                                              \
+    FOR_INT##lane_size##_INPUTS(input) {                                      \
+      int##lane_size##_t* input_addr = &input;                                \
+      int##lane_size##_t output1[lane_num];                                   \
+      int##lane_size##_t output2[lane_num];                                   \
+                                                                              \
+      f.Call(input, input_addr, output1, output2);                            \
+                                                                              \
+      for (int i = 0; i < lane_num; ++i) {                                    \
+        CHECK_EQ(input, output1[i]);                                          \
+        CHECK_EQ(input, output2[i]);                                          \
+      }                                                                       \
+    }                                                                         \
+  }
+
+TEST_ISLPAT(I8x32Splat, 8, 32, F3)
+TEST_ISLPAT(I16x16Splat, 16, 16, F4)
+TEST_ISLPAT(I32x8Splat, 32, 8, F5)
+TEST_ISLPAT(I64x4Splat, 64, 4, F6)
+
+#undef TEST_ISLPAT
+
+TEST_F(MacroAssemblerX64Test, F64x4Min) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister lhs = ymm1;
+  const YMMRegister rhs = ymm2;
+  const YMMRegister tmp = ymm3;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(lhs, Operand(arg_reg_1, 0));
+  __ vmovdqu(rhs, Operand(arg_reg_2, 0));
+  // Calculation
+  __ F64x4Min(dst, lhs, rhs, tmp);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_3, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+#ifdef OBJECT_PRINT
+  Handle<Code> code =
+      Factory::CodeBuilder(i_isolate(), desc, CodeKind::FOR_TESTING).Build();
+  StdoutStream os;
+  Print(*code, os);
+#endif
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F7>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr double double_max = std::numeric_limits<double>::max();
+  constexpr double double_min = std::numeric_limits<double>::min();
+
+  std::vector<std::array<double, 8>> test_cases = {
+      {1, 2, 7, 8, 5, 6, 3, 4},
+      {32.4, 2.5, 12.4, 62.346, 235.6, 2.36, 1253.4, 63.46},
+      {34.5, 2.63, 234.6, 34.68, 234.6, 1.264, 23.6, 2.36},
+      {0, 0, 0, 0, 0, 0, 0, 0},
+      {double_min, double_min, double_max, double_max, double_max, double_max,
+       double_min, double_min}};
+
+  double left[4];
+  double right[4];
+  double output[4];
+
+  for (const auto& arr : test_cases) {
+    for (int i = 0; i < 4; i++) {
+      left[i] = arr[i];
+      right[i] = arr[i + 4];
+    }
+
+    f.Call(left, right, output);
+    for (int i = 0; i < 4; i++) {
+      CHECK_EQ(output[i], std::min(left[i], right[i]));
+    }
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, F64x4Max) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister lhs = ymm1;
+  const YMMRegister rhs = ymm2;
+  const YMMRegister tmp = ymm3;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(lhs, Operand(arg_reg_1, 0));
+  __ vmovdqu(rhs, Operand(arg_reg_2, 0));
+  // Calculation
+  __ F64x4Max(dst, lhs, rhs, tmp);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_3, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+#ifdef OBJECT_PRINT
+  Handle<Code> code =
+      Factory::CodeBuilder(i_isolate(), desc, CodeKind::FOR_TESTING).Build();
+  StdoutStream os;
+  Print(*code, os);
+#endif
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F7>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr double double_max = std::numeric_limits<double>::max();
+  constexpr double double_min = std::numeric_limits<double>::min();
+
+  std::vector<std::array<double, 8>> test_cases = {
+      {1, 2, 7, 8, 5, 6, 3, 4},
+      {32.4, 2.5, 12.4, 62.346, 235.6, 2.36, 1253.4, 63.46},
+      {34.5, 2.63, 234.6, 34.68, 234.6, 1.264, 23.6, 2.36},
+      {0, 0, 0, 0, 0, 0, 0, 0},
+      {double_min, double_min, double_max, double_max, double_max, double_max,
+       double_min, double_min}};
+
+  double left[4];
+  double right[4];
+  double output[4];
+
+  for (const auto& arr : test_cases) {
+    for (int i = 0; i < 4; i++) {
+      left[i] = arr[i];
+      right[i] = arr[i + 4];
+    }
+
+    f.Call(left, right, output);
+    for (int i = 0; i < 4; i++) {
+      CHECK_EQ(output[i], std::max(left[i], right[i]));
+    }
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, F32x8Min) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister lhs = ymm1;
+  const YMMRegister rhs = ymm2;
+  const YMMRegister tmp = ymm3;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(lhs, Operand(arg_reg_1, 0));
+  __ vmovdqu(rhs, Operand(arg_reg_2, 0));
+  // Calculation
+  __ F32x8Min(dst, lhs, rhs, tmp);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_3, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+#ifdef OBJECT_PRINT
+  Handle<Code> code =
+      Factory::CodeBuilder(i_isolate(), desc, CodeKind::FOR_TESTING).Build();
+  StdoutStream os;
+  Print(*code, os);
+#endif
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F8>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr float float_max = std::numeric_limits<float>::max();
+  constexpr float float_min = std::numeric_limits<float>::min();
+
+  std::vector<std::array<float, 16>> test_cases = {
+      {1, 2, 3, 4, 5, 6, 7, 8, 5, 6, 7, 8, 1, 2, 3, 4},
+      {32.4, 2.5, 12.4, 62.346, 235.6, 2.36, 1253.4, 63.46, 235.6, 2.36, 1253.4,
+       63.46, 32.4, 2.5, 12.4, 62.346},
+      {34.5, 2.63, 234.6, 34.68, 234.6, 1.264, 23.6, 2.36, 234.6, 1.264, 23.6,
+       2.36, 34.5, 2.63, 234.6, 34.68},
+      {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+      {float_min, float_min, float_max, float_max, float_max, float_max,
+       float_min, float_min, float_max, float_max, float_min, float_min,
+       float_min, float_min, float_max, float_max}};
+
+  float left[8];
+  float right[8];
+  float output[8];
+
+  for (const auto& arr : test_cases) {
+    for (int i = 0; i < 8; i++) {
+      left[i] = arr[i];
+      right[i] = arr[i + 8];
+    }
+
+    f.Call(left, right, output);
+    for (int i = 0; i < 8; i++) {
+      CHECK_EQ(output[i], std::min(left[i], right[i]));
+    }
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, F32x8Max) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister lhs = ymm1;
+  const YMMRegister rhs = ymm2;
+  const YMMRegister tmp = ymm3;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(lhs, Operand(arg_reg_1, 0));
+  __ vmovdqu(rhs, Operand(arg_reg_2, 0));
+  // Calculation
+  __ F32x8Max(dst, lhs, rhs, tmp);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_3, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+#ifdef OBJECT_PRINT
+  Handle<Code> code =
+      Factory::CodeBuilder(i_isolate(), desc, CodeKind::FOR_TESTING).Build();
+  StdoutStream os;
+  Print(*code, os);
+#endif
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F8>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr float float_max = std::numeric_limits<float>::max();
+  constexpr float float_min = std::numeric_limits<float>::min();
+
+  std::vector<std::array<float, 16>> test_cases = {
+      {1, 2, 3, 4, 5, 6, 7, 8, 5, 6, 7, 8, 1, 2, 3, 4},
+      {32.4, 2.5, 12.4, 62.346, 235.6, 2.36, 1253.4, 63.46, 235.6, 2.36, 1253.4,
+       63.46, 32.4, 2.5, 12.4, 62.346},
+      {34.5, 2.63, 234.6, 34.68, 234.6, 1.264, 23.6, 2.36, 234.6, 1.264, 23.6,
+       2.36, 34.5, 2.63, 234.6, 34.68},
+      {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+      {float_min, float_min, float_max, float_max, float_max, float_max,
+       float_min, float_min, float_max, float_max, float_min, float_min,
+       float_min, float_min, float_max, float_max}};
+
+  float left[8];
+  float right[8];
+  float output[8];
+
+  for (const auto& arr : test_cases) {
+    for (int i = 0; i < 8; i++) {
+      left[i] = arr[i];
+      right[i] = arr[i + 8];
+    }
+
+    f.Call(left, right, output);
+    for (int i = 0; i < 8; i++) {
+      CHECK_EQ(output[i], std::max(left[i], right[i]));
+    }
+  }
+}
+
+namespace {
+
+template <typename S, typename T, typename OpType = T (*)(S, S)>
+void RunExtMulTest(Isolate* isolate, OpType expected_op) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const XMMRegister lhs = xmm1;
+  const XMMRegister rhs = xmm2;
+  const YMMRegister tmp = ymm3;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(lhs, Operand(arg_reg_1, 0));
+  __ vmovdqu(rhs, Operand(arg_reg_2, 0));
+
+  bool is_signed = std::is_signed_v<T>;
+  // Calculation
+  switch (sizeof(T)) {
+    case 8:
+      __ I64x4ExtMul(dst, lhs, rhs, tmp, is_signed);
+      break;
+    case 4:
+      __ I32x8ExtMul(dst, lhs, rhs, tmp, is_signed);
+      break;
+    case 2:
+      __ I16x16ExtMul(dst, lhs, rhs, tmp, is_signed);
+      break;
+    default:
+      UNREACHABLE();
+  }
+
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_3, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(isolate, &desc);
+
+  PrintCode(isolate, desc);
+
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F1>::FromBuffer(isolate, buffer->start());
+
+  uint64_t left[2];
+  uint64_t right[2];
+  uint64_t output[4];
+  constexpr int lanes = kSimd128Size / sizeof(S);
+  T* g = reinterpret_cast<T*>(output);
+  for (S x : compiler::ValueHelper::GetVector<S>()) {
+    for (S y : compiler::ValueHelper::GetVector<S>()) {
+      left[0] = 0;
+      right[0] = 0;
+      uint64_t mask = (static_cast<uint64_t>(1) << sizeof(S) * 8) - 1;
+      uint64_t lane_x = static_cast<uint64_t>(x) & mask;
+      uint64_t lane_y = static_cast<uint64_t>(y) & mask;
+      for (int i = 0; i < lanes / 2; i++) {
+        left[0] = left[0] | (lane_x << 8 * sizeof(S) * i);
+        right[0] = right[0] | (lane_y << 8 * sizeof(S) * i);
+      }
+      left[1] = left[0];
+      right[1] = right[0];
+
+      f.Call(left, right, output);
+
+      T expected = expected_op(x, y);
+      for (int i = 0; i < lanes; i++) {
+        CHECK_EQ(expected, g[i]);
+      }
+    }
+  }
+}
+
+}  // namespace
+
+TEST_F(MacroAssemblerX64Test, I16x16ExtMulI8x16S) {
+  Isolate* isolate = i_isolate();
+  RunExtMulTest<int8_t, int16_t>(isolate, MultiplyLong);
+}
+
+TEST_F(MacroAssemblerX64Test, I16x16ExtMulI8x16U) {
+  Isolate* isolate = i_isolate();
+  RunExtMulTest<uint8_t, uint16_t>(isolate, MultiplyLong);
+}
+
+TEST_F(MacroAssemblerX64Test, I32x8ExtMulI16x8S) {
+  Isolate* isolate = i_isolate();
+  RunExtMulTest<int16_t, int32_t>(isolate, MultiplyLong);
+}
+
+TEST_F(MacroAssemblerX64Test, I32x8ExtMulI16x8U) {
+  Isolate* isolate = i_isolate();
+  RunExtMulTest<uint16_t, uint32_t>(isolate, MultiplyLong);
+}
+
+TEST_F(MacroAssemblerX64Test, I64x4ExtMulI32x4S) {
+  Isolate* isolate = i_isolate();
+  RunExtMulTest<int32_t, int64_t>(isolate, MultiplyLong);
+}
+
+TEST_F(MacroAssemblerX64Test, I64x4ExtMulI32x4U) {
+  Isolate* isolate = i_isolate();
+  RunExtMulTest<uint32_t, uint64_t>(isolate, MultiplyLong);
+}
+
+TEST_F(MacroAssemblerX64Test, I32x8ExtAddPairwiseI16x16S) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister src = ymm1;
+  const YMMRegister tmp = ymm2;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(src, Operand(arg_reg_1, 0));
+  // Calculation
+  __ I32x8ExtAddPairwiseI16x16S(dst, src, tmp);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_2, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(isolate, desc);
+
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F9>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr int16_t int16_max = std::numeric_limits<int16_t>::max();
+
+  std::vector<std::array<int16_t, 16>> test_cases = {
+      {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15},
+      {10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 110, 111, 112, 113, 114, 115},
+      {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+      {-1, 2, 3, -4, -5, 6, 7, -8, -9, 10, 11, -12, -13, 14, 15, -16},
+      {int16_max, int16_max, int16_max, int16_max, int16_max, int16_max,
+       int16_max, int16_max, int16_max, int16_max, int16_max, int16_max,
+       int16_max, int16_max, int16_max, int16_max}};
+
+  int16_t input[16];
+  int32_t output[8];
+
+  for (const auto& arr : test_cases) {
+    for (int i = 0; i < 16; i++) {
+      input[i] = arr[i];
+    }
+    f.Call(input, output);
+    for (int i = 0; i < 8; i++) {
+      CHECK_EQ(output[i], (int32_t)(input[2 * i] + input[2 * i + 1]));
+    }
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, I16x16ExtAddPairwiseI8x32S) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister src = ymm1;
+  const YMMRegister tmp = ymm2;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(src, Operand(arg_reg_1, 0));
+  // Calculation
+  __ I16x16ExtAddPairwiseI8x32S(dst, src, tmp);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_2, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(isolate, desc);
+
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F10>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr int8_t int8_max = std::numeric_limits<int8_t>::max();
+
+  std::vector<std::array<int8_t, 32>> test_cases = {
+      {0,  1,  2,  3,  4,  5,  6,  7,  8,  9,  10, 11, 12, 13, 14, 15,
+       16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31},
+      {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+       0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+      {-1,  2,  3,  -4,  -5,  6,  7,  -8,  -9,  10, 11, -12, -13, 14, 15, -16,
+       -17, 18, 19, -20, -21, 22, 23, -24, -25, 26, 27, -28, -29, 30, 31},
+      {int8_max, int8_max, int8_max, int8_max, int8_max, int8_max, int8_max,
+       int8_max, int8_max, int8_max, int8_max, int8_max, int8_max, int8_max,
+       int8_max, int8_max, int8_max, int8_max, int8_max, int8_max, int8_max,
+       int8_max, int8_max, int8_max, int8_max, int8_max, int8_max, int8_max,
+       int8_max, int8_max, int8_max, int8_max}};
+
+  int8_t input[32];
+  int16_t output[16];
+
+  for (const auto& arr : test_cases) {
+    for (int i = 0; i < 32; i++) {
+      input[i] = arr[i];
+    }
+    f.Call(input, output);
+    for (int i = 0; i < 16; i++) {
+      CHECK_EQ(output[i], (int16_t)(input[2 * i] + input[2 * i + 1]));
+    }
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, I32x8ExtAddPairwiseI16x16U) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister src = ymm1;
+  const YMMRegister tmp = ymm2;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(src, Operand(arg_reg_1, 0));
+  // Calculation
+  __ I32x8ExtAddPairwiseI16x16U(dst, src, tmp);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_2, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(isolate, desc);
+
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F11>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr uint16_t uint16_max = std::numeric_limits<uint16_t>::max();
+
+  std::vector<std::array<uint16_t, 16>> test_cases = {
+      {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15},
+      {10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 110, 111, 112, 113, 114, 115},
+      {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+      {uint16_max, uint16_max, uint16_max, uint16_max, uint16_max, uint16_max,
+       uint16_max, uint16_max, uint16_max, uint16_max, uint16_max, uint16_max,
+       uint16_max, uint16_max, uint16_max, uint16_max}};
+
+  uint16_t input[16];
+  uint32_t output[8];
+
+  for (const auto& arr : test_cases) {
+    for (int i = 0; i < 16; i++) {
+      input[i] = arr[i];
+    }
+    f.Call(input, output);
+    for (int i = 0; i < 8; i++) {
+      CHECK_EQ(output[i], (uint32_t)(input[2 * i] + input[2 * i + 1]));
+    }
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, I16x16ExtAddPairwiseI8x32U) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+
+  const YMMRegister dst = ymm0;
+  const YMMRegister src = ymm1;
+  const YMMRegister tmp = ymm2;
+
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  // Load array
+  __ vmovdqu(src, Operand(arg_reg_1, 0));
+  // Calculation
+  __ I16x16ExtAddPairwiseI8x32U(dst, src, tmp);
+  // Store result array
+  __ vmovdqu(Operand(arg_reg_2, 0), dst);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(i_isolate(), desc);
+
+  buffer->MakeExecutable();
+  // Call the function from C++.
+  auto f = GeneratedCode<F12>::FromBuffer(i_isolate(), buffer->start());
+
+  constexpr uint8_t uint8_max = std::numeric_limits<uint8_t>::max();
+
+  std::vector<std::array<uint8_t, 32>> test_cases = {
+      {0,  1,  2,  3,  4,  5,  6,  7,  8,  9,  10, 11, 12, 13, 14, 15,
+       16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31},
+      {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+       0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
+      {uint8_max, uint8_max, uint8_max, uint8_max, uint8_max, uint8_max,
+       uint8_max, uint8_max, uint8_max, uint8_max, uint8_max, uint8_max,
+       uint8_max, uint8_max, uint8_max, uint8_max, uint8_max, uint8_max,
+       uint8_max, uint8_max, uint8_max, uint8_max, uint8_max, uint8_max,
+       uint8_max, uint8_max, uint8_max, uint8_max, uint8_max, uint8_max,
+       uint8_max, uint8_max}};
+
+  uint8_t input[32];
+  uint16_t output[16];
+
+  for (const auto& arr : test_cases) {
+    for (int i = 0; i < 32; i++) {
+      input[i] = arr[i];
+    }
+    f.Call(input, output);
+    for (int i = 0; i < 16; i++) {
+      CHECK_EQ(output[i], (uint16_t)(input[2 * i] + input[2 * i + 1]));
+    }
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, F64x4Splat) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  __ vmovsd(xmm1, Operand(arg_reg_1, 0));
+  __ F64x4Splat(ymm2, xmm1);
+  __ vmovdqu(Operand(arg_reg_2, 0), ymm2);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(isolate, desc);
+  buffer->MakeExecutable();
+  /* Call the function from C++. */
+  using F = int(double*, double*);
+  auto f = GeneratedCode<F>::FromBuffer(i_isolate(), buffer->start());
+  constexpr int kLaneNum = 4;
+  double output[kLaneNum];
+  FOR_FLOAT64_INPUTS(input) {
+    f.Call(&input, output);
+    for (int i = 0; i < kLaneNum; ++i) {
+      CHECK_EQ(0, std::memcmp(&input, &output[i], sizeof(double)));
+    }
+  }
+}
+
+TEST_F(MacroAssemblerX64Test, F32x8Splat) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+  Isolate* isolate = i_isolate();
+  HandleScope handles(isolate);
+  auto buffer = AllocateAssemblerBuffer();
+  MacroAssembler assembler(isolate, v8::internal::CodeObjectRequired::kYes,
+                           buffer->CreateView());
+  MacroAssembler* masm = &assembler;
+  CpuFeatureScope avx_scope(masm, AVX);
+  CpuFeatureScope avx2_scope(masm, AVX2);
+
+  __ vmovss(xmm1, Operand(arg_reg_1, 0));
+  __ F32x8Splat(ymm2, xmm1);
+  __ vmovdqu(Operand(arg_reg_2, 0), ymm2);
+  __ ret(0);
+
+  CodeDesc desc;
+  __ GetCode(i_isolate(), &desc);
+
+  PrintCode(isolate, desc);
+  buffer->MakeExecutable();
+  /* Call the function from C++. */
+  using F = int(float*, float*);
+  auto f = GeneratedCode<F>::FromBuffer(i_isolate(), buffer->start());
+  constexpr int kLaneNum = 8;
+  float output[kLaneNum];
+  FOR_FLOAT32_INPUTS(input) {
+    f.Call(&input, output);
+    for (int i = 0; i < kLaneNum; ++i) {
+      CHECK_EQ(0, std::memcmp(&input, &output[i], sizeof(float)));
+    }
+  }
+}
+
 #undef __
 
 }  // namespace test_macro_assembler_x64
diff --git a/deps/v8/test/unittests/base/platform/platform-unittest.cc b/deps/v8/test/unittests/base/platform/platform-unittest.cc
index 10df8adf694ddb..946623e55e0a2f 100644
--- a/deps/v8/test/unittests/base/platform/platform-unittest.cc
+++ b/deps/v8/test/unittests/base/platform/platform-unittest.cc
@@ -100,6 +100,20 @@ TEST(OS, ParseProcMaps) {
   EXPECT_EQ(region->pathname,
             std::string("/lib/x86_64-linux-gnu/libc-2.33.so"));
 
+  // Large device numbers. (The major device number 0x103 is from a real
+  // system, the minor device number 0x104 is synthetic.)
+  line =
+      "556bea200000-556beaa1c000 r--p 00000000 103:104 22                      "
+      " /usr/local/bin/node";
+  region = MemoryRegion::FromMapsLine(line.c_str());
+  EXPECT_EQ(region->start, 0x556bea200000u);
+  EXPECT_EQ(region->end, 0x556beaa1c000u);
+  EXPECT_EQ(std::string(region->permissions), std::string("r--p"));
+  EXPECT_EQ(region->offset, 0x00000000);
+  EXPECT_EQ(region->dev, makedev(0x103, 0x104));
+  EXPECT_EQ(region->inode, 22u);
+  EXPECT_EQ(region->pathname, std::string("/usr/local/bin/node"));
+
   // Anonymous, but named.
   line =
       "5611cc7eb000-5611cc80c000 rw-p 00000000 00:00 0                         "
@@ -267,10 +281,11 @@ namespace {
 
 static uintptr_t sp_addr = 0;
 
-void GetStackPointerCallback(const v8::FunctionCallbackInfo<v8::Value>& args) {
+void GetStackPointerCallback(const v8::FunctionCallbackInfo<v8::Value>& info) {
   GET_STACK_POINTER_TO(sp_addr);
-  args.GetReturnValue().Set(v8::Integer::NewFromUnsigned(
-      args.GetIsolate(), static_cast<uint32_t>(sp_addr)));
+  CHECK(i::ValidateCallbackInfo(info));
+  info.GetReturnValue().Set(v8::Integer::NewFromUnsigned(
+      info.GetIsolate(), static_cast<uint32_t>(sp_addr)));
 }
 
 using PlatformTest = v8::TestWithIsolate;
diff --git a/deps/v8/test/unittests/base/smallmap-unittest.cc b/deps/v8/test/unittests/base/smallmap-unittest.cc
new file mode 100644
index 00000000000000..03a8daa72e5863
--- /dev/null
+++ b/deps/v8/test/unittests/base/smallmap-unittest.cc
@@ -0,0 +1,591 @@
+// Copyright 2012 The Chromium Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+// Copyright 2023 the V8 project authors. All rights reserved.
+// This file is a clone of "base/containers/small_map_unittest.h" in chromium.
+// Keep in sync, especially when fixing bugs.
+
+#include <algorithm>
+#include <unordered_map>
+
+#include "src/base/small-map.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace v8 {
+namespace base {
+
+TEST(SmallMapTest, General) {
+  SmallMap<std::unordered_map<int, int>> m;
+
+  EXPECT_TRUE(m.empty());
+
+  m[0] = 5;
+
+  EXPECT_FALSE(m.empty());
+  EXPECT_EQ(m.size(), 1u);
+
+  m[9] = 2;
+
+  EXPECT_FALSE(m.empty());
+  EXPECT_EQ(m.size(), 2u);
+
+  EXPECT_EQ(m[9], 2);
+  EXPECT_EQ(m[0], 5);
+  EXPECT_FALSE(m.UsingFullMap());
+
+  SmallMap<std::unordered_map<int, int>>::iterator iter(m.begin());
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 0);
+  EXPECT_EQ(iter->second, 5);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ((*iter).first, 9);
+  EXPECT_EQ((*iter).second, 2);
+  ++iter;
+  EXPECT_TRUE(iter == m.end());
+
+  m[8] = 23;
+  m[1234] = 90;
+  m[-5] = 6;
+
+  EXPECT_EQ(m[9], 2);
+  EXPECT_EQ(m[0], 5);
+  EXPECT_EQ(m[1234], 90);
+  EXPECT_EQ(m[8], 23);
+  EXPECT_EQ(m[-5], 6);
+  EXPECT_EQ(m.size(), 5u);
+  EXPECT_FALSE(m.empty());
+  EXPECT_TRUE(m.UsingFullMap());
+
+  iter = m.begin();
+  for (int i = 0; i < 5; i++) {
+    EXPECT_TRUE(iter != m.end());
+    ++iter;
+  }
+  EXPECT_TRUE(iter == m.end());
+
+  const SmallMap<std::unordered_map<int, int>>& ref = m;
+  EXPECT_TRUE(ref.find(1234) != m.end());
+  EXPECT_TRUE(ref.find(5678) == m.end());
+}
+
+TEST(SmallMapTest, PostFixIteratorIncrement) {
+  SmallMap<std::unordered_map<int, int>> m;
+  m[0] = 5;
+  m[2] = 3;
+
+  {
+    SmallMap<std::unordered_map<int, int>>::iterator iter(m.begin());
+    SmallMap<std::unordered_map<int, int>>::iterator last(iter++);
+    ++last;
+    EXPECT_TRUE(last == iter);
+  }
+
+  {
+    SmallMap<std::unordered_map<int, int>>::const_iterator iter(m.begin());
+    SmallMap<std::unordered_map<int, int>>::const_iterator last(iter++);
+    ++last;
+    EXPECT_TRUE(last == iter);
+  }
+}
+
+// Based on the General testcase.
+TEST(SmallMapTest, CopyConstructor) {
+  SmallMap<std::unordered_map<int, int>> src;
+
+  {
+    SmallMap<std::unordered_map<int, int>> m(src);
+    EXPECT_TRUE(m.empty());
+  }
+
+  src[0] = 5;
+
+  {
+    SmallMap<std::unordered_map<int, int>> m(src);
+    EXPECT_FALSE(m.empty());
+    EXPECT_EQ(m.size(), 1u);
+  }
+
+  src[9] = 2;
+
+  {
+    SmallMap<std::unordered_map<int, int>> m(src);
+    EXPECT_FALSE(m.empty());
+    EXPECT_EQ(m.size(), 2u);
+
+    EXPECT_EQ(m[9], 2);
+    EXPECT_EQ(m[0], 5);
+    EXPECT_FALSE(m.UsingFullMap());
+  }
+
+  src[8] = 23;
+  src[1234] = 90;
+  src[-5] = 6;
+
+  {
+    SmallMap<std::unordered_map<int, int>> m(src);
+    EXPECT_EQ(m[9], 2);
+    EXPECT_EQ(m[0], 5);
+    EXPECT_EQ(m[1234], 90);
+    EXPECT_EQ(m[8], 23);
+    EXPECT_EQ(m[-5], 6);
+    EXPECT_EQ(m.size(), 5u);
+    EXPECT_FALSE(m.empty());
+    EXPECT_TRUE(m.UsingFullMap());
+  }
+}
+
+template <class inner>
+static bool SmallMapIsSubset(SmallMap<inner> const& a,
+                             SmallMap<inner> const& b) {
+  typename SmallMap<inner>::const_iterator it;
+  for (it = a.begin(); it != a.end(); ++it) {
+    typename SmallMap<inner>::const_iterator it_in_b = b.find(it->first);
+    if (it_in_b == b.end() || it_in_b->second != it->second) return false;
+  }
+  return true;
+}
+
+template <class inner>
+static bool SmallMapEqual(SmallMap<inner> const& a, SmallMap<inner> const& b) {
+  return SmallMapIsSubset(a, b) && SmallMapIsSubset(b, a);
+}
+
+TEST(SmallMapTest, AssignmentOperator) {
+  SmallMap<std::unordered_map<int, int>> src_small;
+  SmallMap<std::unordered_map<int, int>> src_large;
+
+  src_small[1] = 20;
+  src_small[2] = 21;
+  src_small[3] = 22;
+  EXPECT_FALSE(src_small.UsingFullMap());
+
+  src_large[1] = 20;
+  src_large[2] = 21;
+  src_large[3] = 22;
+  src_large[5] = 23;
+  src_large[6] = 24;
+  src_large[7] = 25;
+  EXPECT_TRUE(src_large.UsingFullMap());
+
+  // Assignments to empty.
+  SmallMap<std::unordered_map<int, int>> dest_small;
+  dest_small = src_small;
+  EXPECT_TRUE(SmallMapEqual(dest_small, src_small));
+  EXPECT_EQ(dest_small.UsingFullMap(), src_small.UsingFullMap());
+
+  SmallMap<std::unordered_map<int, int>> dest_large;
+  dest_large = src_large;
+  EXPECT_TRUE(SmallMapEqual(dest_large, src_large));
+  EXPECT_EQ(dest_large.UsingFullMap(), src_large.UsingFullMap());
+
+  // Assignments which assign from full to small, and vice versa.
+  dest_small = src_large;
+  EXPECT_TRUE(SmallMapEqual(dest_small, src_large));
+  EXPECT_EQ(dest_small.UsingFullMap(), src_large.UsingFullMap());
+
+  dest_large = src_small;
+  EXPECT_TRUE(SmallMapEqual(dest_large, src_small));
+  EXPECT_EQ(dest_large.UsingFullMap(), src_small.UsingFullMap());
+
+  // Double check that SmallMapEqual works:
+  dest_large[42] = 666;
+  EXPECT_FALSE(SmallMapEqual(dest_large, src_small));
+}
+
+TEST(SmallMapTest, Insert) {
+  SmallMap<std::unordered_map<int, int>> sm;
+
+  // loop through the transition from small map to map.
+  for (int i = 1; i <= 10; ++i) {
+    // insert an element
+    std::pair<SmallMap<std::unordered_map<int, int>>::iterator, bool> ret;
+    ret = sm.insert(std::make_pair(i, 100 * i));
+    EXPECT_TRUE(ret.second);
+    EXPECT_TRUE(ret.first == sm.find(i));
+    EXPECT_EQ(ret.first->first, i);
+    EXPECT_EQ(ret.first->second, 100 * i);
+
+    // try to insert it again with different value, fails, but we still get an
+    // iterator back with the original value.
+    ret = sm.insert(std::make_pair(i, -i));
+    EXPECT_FALSE(ret.second);
+    EXPECT_TRUE(ret.first == sm.find(i));
+    EXPECT_EQ(ret.first->first, i);
+    EXPECT_EQ(ret.first->second, 100 * i);
+
+    // check the state of the map.
+    for (int j = 1; j <= i; ++j) {
+      SmallMap<std::unordered_map<int, int>>::iterator it = sm.find(j);
+      EXPECT_TRUE(it != sm.end());
+      EXPECT_EQ(it->first, j);
+      EXPECT_EQ(it->second, j * 100);
+    }
+    EXPECT_EQ(sm.size(), static_cast<size_t>(i));
+    EXPECT_FALSE(sm.empty());
+  }
+}
+
+TEST(SmallMapTest, InsertRange) {
+  // loop through the transition from small map to map.
+  for (int elements = 0; elements <= 10; ++elements) {
+    std::unordered_map<int, int> normal_map;
+    for (int i = 1; i <= elements; ++i) {
+      normal_map.insert(std::make_pair(i, 100 * i));
+    }
+
+    SmallMap<std::unordered_map<int, int>> sm;
+    sm.insert(normal_map.begin(), normal_map.end());
+    EXPECT_EQ(normal_map.size(), sm.size());
+    for (int i = 1; i <= elements; ++i) {
+      EXPECT_TRUE(sm.find(i) != sm.end());
+      EXPECT_EQ(sm.find(i)->first, i);
+      EXPECT_EQ(sm.find(i)->second, 100 * i);
+    }
+  }
+}
+
+TEST(SmallMapTest, Erase) {
+  SmallMap<std::unordered_map<std::string, int>> m;
+  SmallMap<std::unordered_map<std::string, int>>::iterator iter;
+
+  m["monday"] = 1;
+  m["tuesday"] = 2;
+  m["wednesday"] = 3;
+
+  EXPECT_EQ(m["monday"], 1);
+  EXPECT_EQ(m["tuesday"], 2);
+  EXPECT_EQ(m["wednesday"], 3);
+  EXPECT_EQ(m.count("tuesday"), 1u);
+  EXPECT_FALSE(m.UsingFullMap());
+
+  iter = m.begin();
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, "monday");
+  EXPECT_EQ(iter->second, 1);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, "tuesday");
+  EXPECT_EQ(iter->second, 2);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, "wednesday");
+  EXPECT_EQ(iter->second, 3);
+  ++iter;
+  EXPECT_TRUE(iter == m.end());
+
+  EXPECT_EQ(m.erase("tuesday"), 1u);
+
+  EXPECT_EQ(m["monday"], 1);
+  EXPECT_EQ(m["wednesday"], 3);
+  EXPECT_EQ(m.count("tuesday"), 0u);
+  EXPECT_EQ(m.erase("tuesday"), 0u);
+
+  iter = m.begin();
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, "monday");
+  EXPECT_EQ(iter->second, 1);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, "wednesday");
+  EXPECT_EQ(iter->second, 3);
+  ++iter;
+  EXPECT_TRUE(iter == m.end());
+
+  m["thursday"] = 4;
+  m["friday"] = 5;
+  EXPECT_EQ(m.size(), 4u);
+  EXPECT_FALSE(m.empty());
+  EXPECT_FALSE(m.UsingFullMap());
+
+  m["saturday"] = 6;
+  EXPECT_TRUE(m.UsingFullMap());
+
+  EXPECT_EQ(m.count("friday"), 1u);
+  EXPECT_EQ(m.erase("friday"), 1u);
+  EXPECT_TRUE(m.UsingFullMap());
+  EXPECT_EQ(m.count("friday"), 0u);
+  EXPECT_EQ(m.erase("friday"), 0u);
+
+  EXPECT_EQ(m.size(), 4u);
+  EXPECT_FALSE(m.empty());
+  EXPECT_EQ(m.erase("monday"), 1u);
+  EXPECT_EQ(m.size(), 3u);
+  EXPECT_FALSE(m.empty());
+
+  m.clear();
+  EXPECT_FALSE(m.UsingFullMap());
+  EXPECT_EQ(m.size(), 0u);
+  EXPECT_TRUE(m.empty());
+}
+
+TEST(SmallMapTest, EraseReturnsIteratorFollowingRemovedElement) {
+  SmallMap<std::unordered_map<std::string, int>> m;
+  SmallMap<std::unordered_map<std::string, int>>::iterator iter;
+
+  m["a"] = 0;
+  m["b"] = 1;
+  m["c"] = 2;
+
+  // Erase first item.
+  auto following_iter = m.erase(m.begin());
+  EXPECT_EQ(m.begin(), following_iter);
+  EXPECT_EQ(2u, m.size());
+  EXPECT_EQ(m.count("a"), 0u);
+  EXPECT_EQ(m.count("b"), 1u);
+  EXPECT_EQ(m.count("c"), 1u);
+
+  // Iterate to last item and erase it.
+  ++following_iter;
+  following_iter = m.erase(following_iter);
+  ASSERT_EQ(1u, m.size());
+  EXPECT_EQ(m.end(), following_iter);
+  EXPECT_EQ(m.count("b"), 0u);
+  EXPECT_EQ(m.count("c"), 1u);
+
+  // Erase remaining item.
+  following_iter = m.erase(m.begin());
+  EXPECT_TRUE(m.empty());
+  EXPECT_EQ(m.end(), following_iter);
+}
+
+TEST(SmallMapTest, NonHashMap) {
+  SmallMap<std::map<int, int>, 4, std::equal_to<int>> m;
+  EXPECT_TRUE(m.empty());
+
+  m[9] = 2;
+  m[0] = 5;
+
+  EXPECT_EQ(m[9], 2);
+  EXPECT_EQ(m[0], 5);
+  EXPECT_EQ(m.size(), 2u);
+  EXPECT_FALSE(m.empty());
+  EXPECT_FALSE(m.UsingFullMap());
+
+  SmallMap<std::map<int, int>, 4, std::equal_to<int>>::iterator iter(m.begin());
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 9);
+  EXPECT_EQ(iter->second, 2);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 0);
+  EXPECT_EQ(iter->second, 5);
+  ++iter;
+  EXPECT_TRUE(iter == m.end());
+  --iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 0);
+  EXPECT_EQ(iter->second, 5);
+
+  m[8] = 23;
+  m[1234] = 90;
+  m[-5] = 6;
+
+  EXPECT_EQ(m[9], 2);
+  EXPECT_EQ(m[0], 5);
+  EXPECT_EQ(m[1234], 90);
+  EXPECT_EQ(m[8], 23);
+  EXPECT_EQ(m[-5], 6);
+  EXPECT_EQ(m.size(), 5u);
+  EXPECT_FALSE(m.empty());
+  EXPECT_TRUE(m.UsingFullMap());
+
+  iter = m.begin();
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, -5);
+  EXPECT_EQ(iter->second, 6);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 0);
+  EXPECT_EQ(iter->second, 5);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 8);
+  EXPECT_EQ(iter->second, 23);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 9);
+  EXPECT_EQ(iter->second, 2);
+  ++iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 1234);
+  EXPECT_EQ(iter->second, 90);
+  ++iter;
+  EXPECT_TRUE(iter == m.end());
+  --iter;
+  ASSERT_TRUE(iter != m.end());
+  EXPECT_EQ(iter->first, 1234);
+  EXPECT_EQ(iter->second, 90);
+}
+
+TEST(SmallMapTest, DefaultEqualKeyWorks) {
+  // If these tests compile, they pass. The EXPECT calls are only there to avoid
+  // unused variable warnings.
+  SmallMap<std::unordered_map<int, int>> hm;
+  EXPECT_EQ(0u, hm.size());
+  SmallMap<std::map<int, int>> m;
+  EXPECT_EQ(0u, m.size());
+}
+
+namespace {
+
+class unordered_map_add_item : public std::unordered_map<int, int> {
+ public:
+  unordered_map_add_item() = default;
+  explicit unordered_map_add_item(const std::pair<int, int>& item) {
+    insert(item);
+  }
+};
+
+void InitMap(unordered_map_add_item* map_ctor) {
+  new (map_ctor) unordered_map_add_item(std::make_pair(0, 0));
+}
+
+class unordered_map_add_item_initializer {
+ public:
+  explicit unordered_map_add_item_initializer(int item_to_add)
+      : item_(item_to_add) {}
+  unordered_map_add_item_initializer() : item_(0) {}
+  void operator()(unordered_map_add_item* map_ctor) const {
+    new (map_ctor) unordered_map_add_item(std::make_pair(item_, item_));
+  }
+
+  int item_;
+};
+
+}  // anonymous namespace
+
+TEST(SmallMapTest, SubclassInitializationWithFunctionPointer) {
+  SmallMap<unordered_map_add_item, 4, std::equal_to<int>,
+           void (&)(unordered_map_add_item*)>
+      m(InitMap);
+
+  EXPECT_TRUE(m.empty());
+
+  m[1] = 1;
+  m[2] = 2;
+  m[3] = 3;
+  m[4] = 4;
+
+  EXPECT_EQ(4u, m.size());
+  EXPECT_EQ(0u, m.count(0));
+
+  m[5] = 5;
+  EXPECT_EQ(6u, m.size());
+  // Our function adds an extra item when we convert to a map.
+  EXPECT_EQ(1u, m.count(0));
+}
+
+TEST(SmallMapTest, SubclassInitializationWithFunctionObject) {
+  SmallMap<unordered_map_add_item, 4, std::equal_to<int>,
+           unordered_map_add_item_initializer>
+      m(unordered_map_add_item_initializer(-1));
+
+  EXPECT_TRUE(m.empty());
+
+  m[1] = 1;
+  m[2] = 2;
+  m[3] = 3;
+  m[4] = 4;
+
+  EXPECT_EQ(4u, m.size());
+  EXPECT_EQ(0u, m.count(-1));
+
+  m[5] = 5;
+  EXPECT_EQ(6u, m.size());
+  // Our functor adds an extra item when we convert to a map.
+  EXPECT_EQ(1u, m.count(-1));
+}
+
+namespace {
+
+// This class acts as a basic implementation of a move-only type. The canonical
+// example of such a type is scoped_ptr/unique_ptr.
+template <typename V>
+class MoveOnlyType {
+ public:
+  MoveOnlyType() : value_(0) {}
+  explicit MoveOnlyType(V value) : value_(value) {}
+
+  MoveOnlyType(MoveOnlyType&& other) { *this = std::move(other); }
+
+  MoveOnlyType& operator=(MoveOnlyType&& other) {
+    value_ = other.value_;
+    other.value_ = 0;
+    return *this;
+  }
+
+  MoveOnlyType(const MoveOnlyType&) = delete;
+  MoveOnlyType& operator=(const MoveOnlyType&) = delete;
+
+  V value() const { return value_; }
+
+ private:
+  V value_;
+};
+
+}  // namespace
+
+TEST(SmallMapTest, MoveOnlyValueType) {
+  SmallMap<std::map<int, MoveOnlyType<int>>, 2> m;
+
+  m[0] = MoveOnlyType<int>(1);
+  m[1] = MoveOnlyType<int>(2);
+  m.erase(m.begin());
+
+  // SmallMap will move m[1] to an earlier index in the internal array.
+  EXPECT_EQ(m.size(), 1u);
+  EXPECT_EQ(m[1].value(), 2);
+
+  m[0] = MoveOnlyType<int>(1);
+  // SmallMap must move the values from the array into the internal std::map.
+  m[2] = MoveOnlyType<int>(3);
+
+  EXPECT_EQ(m.size(), 3u);
+  EXPECT_EQ(m[0].value(), 1);
+  EXPECT_EQ(m[1].value(), 2);
+  EXPECT_EQ(m[2].value(), 3);
+
+  m.erase(m.begin());
+
+  // SmallMap should also let internal std::map erase with a move-only type.
+  EXPECT_EQ(m.size(), 2u);
+  EXPECT_EQ(m[1].value(), 2);
+  EXPECT_EQ(m[2].value(), 3);
+}
+
+TEST(SmallMapTest, Emplace) {
+  SmallMap<std::map<size_t, MoveOnlyType<size_t>>> sm;
+
+  // loop through the transition from small map to map.
+  for (size_t i = 1; i <= 10; ++i) {
+    // insert an element
+    auto ret = sm.emplace(i, MoveOnlyType<size_t>(100 * i));
+    EXPECT_TRUE(ret.second);
+    EXPECT_TRUE(ret.first == sm.find(i));
+    EXPECT_EQ(ret.first->first, i);
+    EXPECT_EQ(ret.first->second.value(), 100 * i);
+
+    // try to insert it again with different value, fails, but we still get an
+    // iterator back with the original value.
+    ret = sm.emplace(i, MoveOnlyType<size_t>(i));
+    EXPECT_FALSE(ret.second);
+    EXPECT_TRUE(ret.first == sm.find(i));
+    EXPECT_EQ(ret.first->first, i);
+    EXPECT_EQ(ret.first->second.value(), 100 * i);
+
+    // check the state of the map.
+    for (size_t j = 1; j <= i; ++j) {
+      const auto it = sm.find(j);
+      EXPECT_TRUE(it != sm.end());
+      EXPECT_EQ(it->first, j);
+      EXPECT_EQ(it->second.value(), j * 100);
+    }
+    EXPECT_EQ(sm.size(), i);
+    EXPECT_FALSE(sm.empty());
+  }
+}
+
+}  // namespace base
+}  // namespace v8
diff --git a/deps/v8/test/unittests/base/vlq-unittest.cc b/deps/v8/test/unittests/base/vlq-unittest.cc
index 647873410a482f..c4e37de24b6c64 100644
--- a/deps/v8/test/unittests/base/vlq-unittest.cc
+++ b/deps/v8/test/unittests/base/vlq-unittest.cc
@@ -28,9 +28,9 @@ int ExpectedBytesUsed(int64_t value, bool is_signed) {
 }
 
 void TestVLQUnsignedEquals(uint32_t value) {
-  std::vector<byte> buffer;
+  std::vector<uint8_t> buffer;
   VLQEncodeUnsigned(&buffer, value);
-  byte* data_start = buffer.data();
+  uint8_t* data_start = buffer.data();
   int index = 0;
   int expected_bytes_used = ExpectedBytesUsed(value, false);
   EXPECT_EQ(buffer.size(), static_cast<size_t>(expected_bytes_used));
@@ -39,9 +39,9 @@ void TestVLQUnsignedEquals(uint32_t value) {
 }
 
 void TestVLQEquals(int32_t value) {
-  std::vector<byte> buffer;
+  std::vector<uint8_t> buffer;
   VLQEncode(&buffer, value);
-  byte* data_start = buffer.data();
+  uint8_t* data_start = buffer.data();
   int index = 0;
   int expected_bytes_used = ExpectedBytesUsed(value, true);
   EXPECT_EQ(buffer.size(), static_cast<size_t>(expected_bytes_used));
diff --git a/deps/v8/test/unittests/codegen/code-layout-unittest.cc b/deps/v8/test/unittests/codegen/code-layout-unittest.cc
index 40dbdea5dc7dc8..7a4b6e3f4e3581 100644
--- a/deps/v8/test/unittests/codegen/code-layout-unittest.cc
+++ b/deps/v8/test/unittests/codegen/code-layout-unittest.cc
@@ -18,10 +18,10 @@ TEST_F(CodeLayoutTest, CodeLayoutWithoutUnwindingInfo) {
   HandleScope handle_scope(i_isolate());
 
   // "Hello, World!" in ASCII, padded to kCodeAlignment.
-  byte buffer_array[16] = {0x48, 0x65, 0x6C, 0x6C, 0x6F, 0x2C, 0x20, 0x57,
-                           0x6F, 0x72, 0x6C, 0x64, 0x21, 0xcc, 0xcc, 0xcc};
+  uint8_t buffer_array[16] = {0x48, 0x65, 0x6C, 0x6C, 0x6F, 0x2C, 0x20, 0x57,
+                              0x6F, 0x72, 0x6C, 0x64, 0x21, 0xcc, 0xcc, 0xcc};
 
-  byte* buffer = &buffer_array[0];
+  uint8_t* buffer = &buffer_array[0];
   int buffer_size = sizeof(buffer_array);
 
   CodeDesc code_desc;
@@ -47,27 +47,28 @@ TEST_F(CodeLayoutTest, CodeLayoutWithoutUnwindingInfo) {
           .Build();
 
   CHECK(!code->has_unwinding_info());
-  CHECK_EQ(code->InstructionSize(), buffer_size);
-  CHECK_EQ(0, memcmp(reinterpret_cast<void*>(code->InstructionStart()), buffer,
+  CHECK_EQ(code->instruction_size(), buffer_size);
+  CHECK_EQ(0, memcmp(reinterpret_cast<void*>(code->instruction_start()), buffer,
                      buffer_size));
-  CHECK_EQ(static_cast<int>(code->InstructionEnd() - code->InstructionStart()),
-           buffer_size);
+  CHECK_EQ(
+      static_cast<int>(code->instruction_end() - code->instruction_start()),
+      buffer_size);
 }
 
 TEST_F(CodeLayoutTest, CodeLayoutWithUnwindingInfo) {
   HandleScope handle_scope(i_isolate());
 
   // "Hello, World!" in ASCII, padded to kCodeAlignment.
-  byte buffer_array[16] = {0x48, 0x65, 0x6C, 0x6C, 0x6F, 0x2C, 0x20, 0x57,
-                           0x6F, 0x72, 0x6C, 0x64, 0x21, 0xcc, 0xcc, 0xcc};
+  uint8_t buffer_array[16] = {0x48, 0x65, 0x6C, 0x6C, 0x6F, 0x2C, 0x20, 0x57,
+                              0x6F, 0x72, 0x6C, 0x64, 0x21, 0xcc, 0xcc, 0xcc};
 
   // "JavaScript" in ASCII.
-  byte unwinding_info_array[10] = {0x4A, 0x61, 0x76, 0x61, 0x53,
-                                   0x63, 0x72, 0x69, 0x70, 0x74};
+  uint8_t unwinding_info_array[10] = {0x4A, 0x61, 0x76, 0x61, 0x53,
+                                      0x63, 0x72, 0x69, 0x70, 0x74};
 
-  byte* buffer = &buffer_array[0];
+  uint8_t* buffer = &buffer_array[0];
   int buffer_size = sizeof(buffer_array);
-  byte* unwinding_info = &unwinding_info_array[0];
+  uint8_t* unwinding_info = &unwinding_info_array[0];
   int unwinding_info_size = sizeof(unwinding_info_array);
 
   CodeDesc code_desc;
@@ -94,14 +95,14 @@ TEST_F(CodeLayoutTest, CodeLayoutWithUnwindingInfo) {
 
   CHECK(code->has_unwinding_info());
   CHECK_EQ(code->body_size(), buffer_size + unwinding_info_size);
-  CHECK_EQ(0, memcmp(reinterpret_cast<void*>(code->InstructionStart()), buffer,
+  CHECK_EQ(0, memcmp(reinterpret_cast<void*>(code->instruction_start()), buffer,
                      buffer_size));
   CHECK_EQ(code->unwinding_info_size(), unwinding_info_size);
   CHECK_EQ(memcmp(reinterpret_cast<void*>(code->unwinding_info_start()),
                   unwinding_info, unwinding_info_size),
            0);
   CHECK_EQ(
-      static_cast<int>(code->unwinding_info_end() - code->InstructionStart()),
+      static_cast<int>(code->unwinding_info_end() - code->instruction_start()),
       buffer_size + unwinding_info_size);
 }
 
diff --git a/deps/v8/test/unittests/codegen/code-pages-unittest.cc b/deps/v8/test/unittests/codegen/code-pages-unittest.cc
index e8a156581ebe27..3a8236ba979e11 100644
--- a/deps/v8/test/unittests/codegen/code-pages-unittest.cc
+++ b/deps/v8/test/unittests/codegen/code-pages-unittest.cc
@@ -11,6 +11,7 @@
 #include "src/heap/factory.h"
 #include "src/heap/spaces.h"
 #include "src/libsampler/sampler.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -76,11 +77,11 @@ bool PagesHasExactPage(std::vector<MemoryRange>* pages, Address search_page,
 
 bool PagesContainsRange(std::vector<MemoryRange>* pages, Address search_address,
                         size_t size) {
-  byte* addr = reinterpret_cast<byte*>(search_address);
+  uint8_t* addr = reinterpret_cast<uint8_t*>(search_address);
   auto it =
       std::find_if(pages->begin(), pages->end(), [=](const MemoryRange& r) {
-        const byte* page_start = reinterpret_cast<const byte*>(r.start);
-        const byte* page_end = page_start + r.length_in_bytes;
+        const uint8_t* page_start = reinterpret_cast<const uint8_t*>(r.start);
+        const uint8_t* page_end = page_start + r.length_in_bytes;
         return addr >= page_start && (addr + size) <= page_end;
       });
   return it != pages->end();
@@ -149,11 +150,11 @@ TEST_F(CodePagesTest, OptimizedCodeWithCodeRange) {
   Handle<JSFunction> foo =
       Handle<JSFunction>::cast(v8::Utils::OpenHandle(*local_foo));
 
-  Code code = foo->code();
+  Tagged<Code> code = foo->code();
   // We don't produce optimized code when run with --no-turbofan and
   // --no-maglev.
-  if (!code.is_optimized_code()) return;
-  InstructionStream foo_code = FromCode(code);
+  if (!code->is_optimized_code()) return;
+  Tagged<InstructionStream> foo_code = code->instruction_stream();
 
   EXPECT_TRUE(i_isolate()->heap()->InSpace(foo_code, CODE_SPACE));
 
@@ -195,21 +196,21 @@ TEST_F(CodePagesTest, OptimizedCodeWithCodePages) {
       // If there is baseline code, check that it's only due to
       // --always-sparkplug (if this check fails, we'll have to re-think this
       // test).
-      if (foo->shared().HasBaselineCode()) {
+      if (foo->shared()->HasBaselineCode()) {
         EXPECT_TRUE(v8_flags.always_sparkplug);
         return;
       }
-      Code code = foo->code();
+      Tagged<Code> code = foo->code();
       // We don't produce optimized code when run with --no-turbofan and
       // --no-maglev.
-      if (!code.is_optimized_code()) return;
-      InstructionStream foo_code = FromCode(code);
+      if (!code->is_optimized_code()) return;
+      Tagged<InstructionStream> foo_code = code->instruction_stream();
 
       EXPECT_TRUE(i_isolate()->heap()->InSpace(foo_code, CODE_SPACE));
 
       // Check that the generated code ended up in one of the code pages
       // returned by GetCodePages().
-      byte* foo_code_ptr = reinterpret_cast<byte*>(foo_code.address());
+      uint8_t* foo_code_ptr = reinterpret_cast<uint8_t*>(foo_code.address());
       std::vector<MemoryRange>* pages = i_isolate()->GetCodePages();
 
       // Wait until after we have created the first function to take the initial
@@ -224,8 +225,9 @@ TEST_F(CodePagesTest, OptimizedCodeWithCodePages) {
       // by GetCodePages().
       auto it = std::find_if(
           pages->begin(), pages->end(), [foo_code_ptr](const MemoryRange& r) {
-            const byte* page_start = reinterpret_cast<const byte*>(r.start);
-            const byte* page_end = page_start + r.length_in_bytes;
+            const uint8_t* page_start =
+                reinterpret_cast<const uint8_t*>(r.start);
+            const uint8_t* page_end = page_start + r.length_in_bytes;
             return foo_code_ptr >= page_start && foo_code_ptr < page_end;
           });
       EXPECT_NE(it, pages->end());
@@ -250,12 +252,12 @@ TEST_F(CodePagesTest, OptimizedCodeWithCodePages) {
       snprintf(foo_name, sizeof(foo_name), "foo%d", n);
       context()
           ->Global()
-          ->Set(context(), NewString(foo_name), Undefined(isolate()))
+          ->Set(context(), NewString(foo_name), v8::Undefined(isolate()))
           .Check();
     }
   }
 
-  CollectGarbage(CODE_SPACE);
+  InvokeMajorGC();
 
   std::vector<MemoryRange>* pages = i_isolate()->GetCodePages();
   auto it = std::find_if(
@@ -276,7 +278,7 @@ TEST_F(CodePagesTest, LargeCodeObject) {
   // Create a big function that ends up in CODE_LO_SPACE.
   const int instruction_size = Page::kPageSize + 1;
   EXPECT_GT(instruction_size, MemoryChunkLayout::MaxRegularCodeObjectSize());
-  std::unique_ptr<byte[]> instructions(new byte[instruction_size]);
+  std::unique_ptr<uint8_t[]> instructions(new uint8_t[instruction_size]);
 
   CodeDesc desc;
   desc.buffer = instructions.get();
@@ -312,7 +314,7 @@ TEST_F(CodePagesTest, LargeCodeObject) {
   }
 
   // Delete the large code object.
-  CollectGarbage(CODE_LO_SPACE);
+  InvokeMajorGC();
   EXPECT_TRUE(
       !i_isolate()->heap()->InSpaceSlow(stale_code_address, CODE_LO_SPACE));
 
@@ -395,7 +397,7 @@ TEST_F(CodePagesTest, LargeCodeObjectWithSignalHandler) {
   // Create a big function that ends up in CODE_LO_SPACE.
   const int instruction_size = Page::kPageSize + 1;
   EXPECT_GT(instruction_size, MemoryChunkLayout::MaxRegularCodeObjectSize());
-  std::unique_ptr<byte[]> instructions(new byte[instruction_size]);
+  std::unique_ptr<uint8_t[]> instructions(new uint8_t[instruction_size]);
 
   CodeDesc desc;
   desc.buffer = instructions.get();
@@ -449,7 +451,7 @@ TEST_F(CodePagesTest, LargeCodeObjectWithSignalHandler) {
   sampling_thread.StartSynchronously();
 
   // Delete the large code object.
-  CollectGarbage(CODE_LO_SPACE);
+  InvokeMajorGC();
   EXPECT_TRUE(
       !i_isolate()->heap()->InSpaceSlow(stale_code_address, CODE_LO_SPACE));
 
@@ -475,7 +477,7 @@ TEST_F(CodePagesTest, Sorted) {
   // Create a big function that ends up in CODE_LO_SPACE.
   const int instruction_size = Page::kPageSize + 1;
   EXPECT_GT(instruction_size, MemoryChunkLayout::MaxRegularCodeObjectSize());
-  std::unique_ptr<byte[]> instructions(new byte[instruction_size]);
+  std::unique_ptr<uint8_t[]> instructions(new uint8_t[instruction_size]);
 
   CodeDesc desc;
   desc.buffer = instructions.get();
@@ -552,7 +554,7 @@ TEST_F(CodePagesTest, Sorted) {
     EXPECT_TRUE(
         i_isolate()->heap()->InSpaceSlow(code3->address(), CODE_LO_SPACE));
     // Delete code2.
-    CollectGarbage(CODE_LO_SPACE);
+    InvokeMajorGC();
     EXPECT_TRUE(
         i_isolate()->heap()->InSpaceSlow(code1->address(), CODE_LO_SPACE));
     EXPECT_TRUE(
diff --git a/deps/v8/test/unittests/codegen/code-stub-assembler-unittest.cc b/deps/v8/test/unittests/codegen/code-stub-assembler-unittest.cc
index 027200735b7d4d..58dc5a4473613a 100644
--- a/deps/v8/test/unittests/codegen/code-stub-assembler-unittest.cc
+++ b/deps/v8/test/unittests/codegen/code-stub-assembler-unittest.cc
@@ -6,7 +6,9 @@
 
 #include "src/compiler/node.h"
 #include "src/execution/isolate.h"
+#include "test/common/code-assembler-tester.h"
 #include "test/unittests/compiler/compiler-test-utils.h"
+#include "test/unittests/compiler/function-tester.h"
 #include "test/unittests/compiler/node-test-utils.h"
 
 using ::testing::_;
@@ -18,7 +20,7 @@ namespace internal {
 
 CodeStubAssemblerTestState::CodeStubAssemblerTestState(
     CodeStubAssemblerTest* test)
-    : compiler::CodeAssemblerState(test->isolate(), test->zone(),
+    : compiler::CodeAssemblerState(test->i_isolate(), test->zone(),
                                    VoidDescriptor{}, CodeKind::FOR_TESTING,
                                    "test") {}
 
@@ -56,5 +58,103 @@ TARGET_TEST_F(CodeStubAssemblerTest, IntPtrMin) {
   }
 }
 
+#define __ assembler.
+
+namespace {
+
+void ExpectArrayListsEqual(Handle<ArrayList> array1, Handle<ArrayList> array2) {
+  // ArrayArrays are growable FixedArrays, and the FixedArray length is the
+  // capacity.
+  EXPECT_EQ(array1->length(), array2->length());
+  // The actual used length is stored in the array itself.
+  EXPECT_EQ(array1->Length(), array2->Length());
+  for (int i = 0; i < array1->Length(); i++) {
+    EXPECT_EQ(array1->Get(i), array2->Get(i));
+  }
+}
+
+}  // namespace
+
+TARGET_TEST_F(CodeStubAssemblerTest, ArrayListAllocateEquivalent) {
+  constexpr int L = 1;
+
+  // Tests that the CSA implementation of ArrayList behave the same as the C++
+  // implementation.
+  Handle<Code> allocate_arraylist_in_csa;
+  {
+    compiler::CodeAssemblerTester tester(i_isolate(), JSParameterCount(0));
+    CodeStubAssembler assembler(tester.state());
+    TNode<ArrayList> array = __ AllocateArrayList(__ SmiConstant(L));
+    __ ArrayListSet(array, __ SmiConstant(0), __ UndefinedConstant());
+    __ Return(array);
+    allocate_arraylist_in_csa = tester.GenerateCodeCloseAndEscape();
+  }
+
+  Handle<ArrayList> array1 = ArrayList::New(i_isolate(), L);
+  compiler::FunctionTester ft(i_isolate(), allocate_arraylist_in_csa, 0);
+  Handle<ArrayList> array2 = ft.CallChecked<ArrayList>();
+  ExpectArrayListsEqual(array1, array2);
+}
+
+TARGET_TEST_F(CodeStubAssemblerTest, ArrayListAddEquivalent) {
+  constexpr int L = 1;
+
+  // Tests that the CSA implementation of ArrayList behave the same as the C++
+  // implementation.
+  Handle<Code> allocate_arraylist_in_csa;
+  {
+    compiler::CodeAssemblerTester tester(i_isolate(), JSParameterCount(0));
+    CodeStubAssembler assembler(tester.state());
+    TNode<ArrayList> array = __ AllocateArrayList(__ SmiConstant(L));
+    array = __ ArrayListAdd(array, __ SmiConstant(0));
+    array = __ ArrayListAdd(array, __ SmiConstant(1));
+    array = __ ArrayListAdd(array, __ SmiConstant(2));
+    array = __ ArrayListAdd(array, __ SmiConstant(3));
+    array = __ ArrayListAdd(array, __ SmiConstant(4));
+    __ Return(array);
+    allocate_arraylist_in_csa = tester.GenerateCodeCloseAndEscape();
+  }
+
+  Handle<ArrayList> array1 = ArrayList::New(i_isolate(), L);
+  for (int i = 0; i < 5; i++) {
+    array1 = ArrayList::Add(i_isolate(), array1, Smi::FromInt(i));
+  }
+  compiler::FunctionTester ft(i_isolate(), allocate_arraylist_in_csa, 0);
+  Handle<ArrayList> list2 = ft.CallChecked<ArrayList>();
+  ExpectArrayListsEqual(array1, list2);
+}
+
+TARGET_TEST_F(CodeStubAssemblerTest, ArrayListElementsEquivalent) {
+  constexpr int L = 1;
+
+  // Tests that the CSA implementation of ArrayList behave the same as the C++
+  // implementation.
+  Handle<Code> allocate_arraylist_in_csa;
+  {
+    compiler::CodeAssemblerTester tester(i_isolate(), JSParameterCount(0));
+    CodeStubAssembler assembler(tester.state());
+    TNode<ArrayList> list = __ AllocateArrayList(__ SmiConstant(L));
+    list = __ ArrayListAdd(list, __ SmiConstant(0));
+    list = __ ArrayListAdd(list, __ SmiConstant(1));
+    list = __ ArrayListAdd(list, __ SmiConstant(2));
+    list = __ ArrayListAdd(list, __ SmiConstant(3));
+    list = __ ArrayListAdd(list, __ SmiConstant(4));
+    __ Return(__ ArrayListElements(list));
+    allocate_arraylist_in_csa = tester.GenerateCodeCloseAndEscape();
+  }
+
+  Handle<ArrayList> array1 = ArrayList::New(i_isolate(), L);
+  for (int i = 0; i < 5; i++) {
+    array1 = ArrayList::Add(i_isolate(), array1, Smi::FromInt(i));
+  }
+  Handle<FixedArray> elements1 = ArrayList::Elements(i_isolate(), array1);
+  compiler::FunctionTester ft(i_isolate(), allocate_arraylist_in_csa, 0);
+  Handle<FixedArray> elements2 = ft.CallChecked<FixedArray>();
+  EXPECT_EQ(elements1->length(), elements2->length());
+  for (int i = 0; i < elements1->length(); i++) {
+    EXPECT_EQ(elements1->get(i), elements2->get(i));
+  }
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/codegen/code-stub-assembler-unittest.h b/deps/v8/test/unittests/codegen/code-stub-assembler-unittest.h
index fc3e9d81910c2f..152fdd3e24323a 100644
--- a/deps/v8/test/unittests/codegen/code-stub-assembler-unittest.h
+++ b/deps/v8/test/unittests/codegen/code-stub-assembler-unittest.h
@@ -11,9 +11,9 @@
 namespace v8 {
 namespace internal {
 
-class CodeStubAssemblerTest : public TestWithIsolateAndZone {
+class CodeStubAssemblerTest : public TestWithContextAndZone {
  public:
-  CodeStubAssemblerTest() : TestWithIsolateAndZone(kCompressGraphZone) {}
+  CodeStubAssemblerTest() : TestWithContextAndZone(kCompressGraphZone) {}
   ~CodeStubAssemblerTest() override = default;
 };
 
diff --git a/deps/v8/test/unittests/codegen/factory-unittest.cc b/deps/v8/test/unittests/codegen/factory-unittest.cc
index 7d6f6ea45cd9f5..2bc400eebda0ce 100644
--- a/deps/v8/test/unittests/codegen/factory-unittest.cc
+++ b/deps/v8/test/unittests/codegen/factory-unittest.cc
@@ -21,7 +21,7 @@ TEST_F(FactoryCodeBuilderTest, Factory_CodeBuilder) {
   // Create a big function that ends up in CODE_LO_SPACE.
   const int instruction_size =
       i_isolate()->heap()->MaxRegularHeapObjectSize(AllocationType::kCode) + 1;
-  std::unique_ptr<byte[]> instructions(new byte[instruction_size]);
+  std::unique_ptr<uint8_t[]> instructions(new uint8_t[instruction_size]);
 
   CodeDesc desc;
   desc.buffer = instructions.get();
@@ -38,7 +38,7 @@ TEST_F(FactoryCodeBuilderTest, Factory_CodeBuilder) {
   CHECK(
       i_isolate()->heap()->InSpace(code->instruction_stream(), CODE_LO_SPACE));
 #if VERIFY_HEAP
-  code->ObjectVerify(i_isolate());
+  Object::ObjectVerify(*code, i_isolate());
 #endif
 }
 
@@ -59,6 +59,9 @@ class FactoryCodeBuilderOOMTest : public TestWithIsolate {
  public:
   static void SetUpTestSuite() {
     v8_flags.max_old_space_size = kInstructionSize / MB / 2;  // In MB.
+    // Keep semi-space size small so that the heuristics don't think we have
+    // enough combined space for the allocation.
+    v8_flags.max_semi_space_size = 8;
   }
 
   void SetUp() override {
@@ -73,7 +76,7 @@ class FactoryCodeBuilderOOMTest : public TestWithIsolate {
 };
 
 TEST_F(FactoryCodeBuilderOOMTest, Factory_CodeBuilder_BuildOOM) {
-  std::unique_ptr<byte[]> instructions(new byte[kInstructionSize]);
+  std::unique_ptr<uint8_t[]> instructions(new uint8_t[kInstructionSize]);
   CodeDesc desc;
   desc.instr_size = kInstructionSize;
   desc.buffer = instructions.get();
@@ -86,7 +89,7 @@ TEST_F(FactoryCodeBuilderOOMTest, Factory_CodeBuilder_BuildOOM) {
 }
 
 TEST_F(FactoryCodeBuilderOOMTest, Factory_CodeBuilder_TryBuildOOM) {
-  std::unique_ptr<byte[]> instructions(new byte[kInstructionSize]);
+  std::unique_ptr<uint8_t[]> instructions(new uint8_t[kInstructionSize]);
   CodeDesc desc;
   desc.instr_size = kInstructionSize;
   desc.buffer = instructions.get();
diff --git a/deps/v8/test/unittests/codegen/pointer-auth-arm64-unittest.cc b/deps/v8/test/unittests/codegen/pointer-auth-arm64-unittest.cc
deleted file mode 100644
index 5f34f8313e5818..00000000000000
--- a/deps/v8/test/unittests/codegen/pointer-auth-arm64-unittest.cc
+++ /dev/null
@@ -1,79 +0,0 @@
-// Copyright 2019 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/codegen/arm64/decoder-arm64-inl.h"
-#include "src/execution/arm64/simulator-arm64.h"
-#include "test/unittests/test-utils.h"
-#include "testing/gtest/include/gtest/gtest.h"
-
-namespace v8 {
-namespace internal {
-
-using PointerAuthArm64Test = TestWithIsolate;
-
-#ifdef USE_SIMULATOR
-TEST_F(PointerAuthArm64Test, compute_pac) {
-  Decoder<DispatchingDecoderVisitor>* decoder =
-      new Decoder<DispatchingDecoderVisitor>();
-  Simulator simulator(decoder);
-
-  uint64_t data1 = 0xfb623599da6e8127;
-  uint64_t data2 = 0x27979fadf7d53cb7;
-  uint64_t context = 0x477d469dec0b8762;
-  Simulator::PACKey key = {0x84be85ce9804e94b, 0xec2802d4e0a488e9, -1};
-
-  uint64_t pac1 = simulator.ComputePAC(data1, context, key);
-  uint64_t pac2 = simulator.ComputePAC(data2, context, key);
-
-  // NOTE: If the PAC implementation is changed, this may fail due to a hash
-  // collision.
-  CHECK_NE(pac1, pac2);
-}
-
-TEST_F(PointerAuthArm64Test, add_and_auth_pac) {
-  i::v8_flags.sim_abort_on_bad_auth = false;
-  Decoder<DispatchingDecoderVisitor>* decoder =
-      new Decoder<DispatchingDecoderVisitor>();
-  Simulator simulator(decoder);
-
-  uint64_t ptr = 0x0000000012345678;
-  uint64_t context = 0x477d469dec0b8762;
-  Simulator::PACKey key_a = {0x84be85ce9804e94b, 0xec2802d4e0a488e9, 0};
-  Simulator::PACKey key_b = {0xec1119e288704d13, 0xd7f6b76e1cea585e, 1};
-
-  uint64_t ptr_a =
-      simulator.AddPAC(ptr, context, key_a, Simulator::kInstructionPointer);
-
-  // Attempt to authenticate the pointer with PAC using different keys.
-  uint64_t success =
-      simulator.AuthPAC(ptr_a, context, key_a, Simulator::kInstructionPointer);
-  uint64_t fail =
-      simulator.AuthPAC(ptr_a, context, key_b, Simulator::kInstructionPointer);
-
-  uint64_t pac_mask =
-      simulator.CalculatePACMask(ptr, Simulator::kInstructionPointer, 0);
-
-  // NOTE: If the PAC implementation is changed, this may fail due to a hash
-  // collision.
-  CHECK_NE((ptr_a & pac_mask), 0);
-  CHECK_EQ(success, ptr);
-  CHECK_NE(fail, ptr);
-}
-
-TEST_F(PointerAuthArm64Test, add_and_strip_pac) {
-  Decoder<DispatchingDecoderVisitor>* decoder =
-      new Decoder<DispatchingDecoderVisitor>();
-  Simulator simulator(decoder);
-
-  uint64_t ptr = 0xff00000012345678;
-  uint64_t pac_mask =
-      simulator.CalculatePACMask(ptr, Simulator::kInstructionPointer, 0);
-  uint64_t ptr_a = ptr | pac_mask;
-
-  CHECK_EQ(simulator.StripPAC(ptr_a, Simulator::kInstructionPointer), ptr);
-}
-#endif  // USE_SIMULATOR
-
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/unittests/common/thread-isolation-unittest.cc b/deps/v8/test/unittests/common/thread-isolation-unittest.cc
new file mode 100644
index 00000000000000..7a19ecd9dd67ff
--- /dev/null
+++ b/deps/v8/test/unittests/common/thread-isolation-unittest.cc
@@ -0,0 +1,176 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/common/code-memory-access.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace v8 {
+namespace internal {
+
+TEST(ThreadIsolation, ReuseJitPage) {
+  ThreadIsolation::Initialize(nullptr);
+
+  Address address1 = 0x4100000;
+  size_t size = 0x1000;
+  ThreadIsolation::RegisterJitPage(address1, size);
+
+  Address address2 = address1 + size;
+  ThreadIsolation::RegisterJitPage(address2, size);
+
+  ThreadIsolation::UnregisterJitPage(address1, size);
+  ThreadIsolation::RegisterJitPage(address1, size);
+  ThreadIsolation::UnregisterJitPage(address1, size);
+  ThreadIsolation::UnregisterJitPage(address2, size);
+
+  ThreadIsolation::RegisterJitPage(address1, 2 * size);
+  ThreadIsolation::UnregisterJitPage(address1, 2 * size);
+}
+
+TEST(ThreadIsolation, CatchJitPageOverlap) {
+  ThreadIsolation::Initialize(nullptr);
+
+  Address address1 = 0x4100000;
+  size_t size = 0x1000;
+  ThreadIsolation::RegisterJitPage(address1, size);
+  EXPECT_DEATH_IF_SUPPORTED(
+      { ThreadIsolation::RegisterJitPage(address1 + size - 1, 1); }, "");
+  ThreadIsolation::UnregisterJitPage(address1, size);
+}
+
+TEST(ThreadIsolation, JitAllocation) {
+  ThreadIsolation::Initialize(nullptr);
+
+  Address address1 = 0x4100000;
+  size_t size = 0x1000;
+  ThreadIsolation::RegisterJitPage(address1, size);
+
+  Address address2 = address1 + size;
+  ThreadIsolation::RegisterJitPage(address2, size);
+
+  ThreadIsolation::RegisterJitAllocationForTesting(address2 + size - 1, 1);
+  ThreadIsolation::RegisterJitAllocationForTesting(address1, 1);
+  // An allocation spanning two pages.
+  ThreadIsolation::RegisterJitAllocationForTesting(address2 - 1, 2);
+
+  ThreadIsolation::UnregisterJitPage(address1, size);
+  // The spanning allocation should've been released, try to reuse the memory.
+  ThreadIsolation::RegisterJitAllocationForTesting(address2, 1);
+  ThreadIsolation::UnregisterJitPage(address2, size);
+}
+
+TEST(ThreadIsolation, CatchOOBJitAllocation) {
+  ThreadIsolation::Initialize(nullptr);
+
+  Address address1 = 0x4100000;
+  size_t size = 0x1000;
+  ThreadIsolation::RegisterJitPage(address1, size);
+  EXPECT_DEATH_IF_SUPPORTED(
+      { ThreadIsolation::RegisterJitAllocationForTesting(address1 + size, 1); },
+      "");
+  ThreadIsolation::UnregisterJitPage(address1, size);
+}
+
+TEST(ThreadIsolation, MergeJitPages) {
+  ThreadIsolation::Initialize(nullptr);
+
+  Address address1 = 0x4100000;
+  size_t size = 0x1000;
+  Address address2 = address1 + size;
+  Address address3 = address2 + size;
+
+  ThreadIsolation::RegisterJitPage(address2, size);
+  ThreadIsolation::RegisterJitPage(address1, size);
+  ThreadIsolation::RegisterJitPage(address3, size);
+
+  ThreadIsolation::RegisterJitAllocationForTesting(address1, 3 * size);
+  ThreadIsolation::UnregisterJitAllocationForTesting(address1, 3 * size);
+
+  // Test merge in both directions
+  ThreadIsolation::UnregisterJitPage(address2, size);
+  ThreadIsolation::RegisterJitPage(address2, size);
+
+  ThreadIsolation::RegisterJitAllocationForTesting(address1, 3 * size);
+  ThreadIsolation::UnregisterJitAllocationForTesting(address1, 3 * size);
+
+  ThreadIsolation::UnregisterJitPage(address2, size);
+  ThreadIsolation::UnregisterJitPage(address1, size);
+  ThreadIsolation::UnregisterJitPage(address3, size);
+}
+
+TEST(ThreadIsolation, UnregisterAllocationsExcept) {
+  ThreadIsolation::Initialize(nullptr);
+
+  Address address1 = 0x4100000;
+  size_t size = 0x1000;
+  ThreadIsolation::RegisterJitPage(address1, size);
+
+  std::vector<base::AddressRegion> allocations;
+  std::vector<base::Address> to_keep;
+
+  allocations.emplace_back(address1, 1);
+  allocations.emplace_back(address1 + 1, 1);
+  allocations.emplace_back(address1 + 10, 1);
+  allocations.emplace_back(address1 + size - 1, 1);
+
+  for (auto allocation : allocations) {
+    ThreadIsolation::RegisterJitAllocationForTesting(allocation.begin(),
+                                                     allocation.size());
+  }
+
+  to_keep.emplace_back(address1);
+  to_keep.emplace_back(address1 + size - 1);
+
+  ThreadIsolation::UnregisterJitAllocationsInPageExceptForTesting(
+      address1, size, to_keep);
+
+  // Everything should be free except first and last byte.
+  ThreadIsolation::RegisterJitAllocationForTesting(address1 + 1, size - 2);
+
+  // But we should've kept to_keep[0].
+  EXPECT_DEATH_IF_SUPPORTED(
+      { ThreadIsolation::RegisterJitAllocationForTesting(to_keep[0], 1); }, "");
+
+  ThreadIsolation::UnregisterJitPage(address1, size);
+}
+
+TEST(ThreadIsolation, UnregisterAllocationsExceptNextPage) {
+  ThreadIsolation::Initialize(nullptr);
+
+  Address address1 = 0x4100000;
+  size_t size = 0x1000;
+  Address address2 = address1 + size;
+  ThreadIsolation::RegisterJitPage(address1, size);
+  ThreadIsolation::RegisterJitPage(address2, size);
+
+  std::vector<base::AddressRegion> allocations;
+  std::vector<base::Address> to_keep;
+
+  allocations.emplace_back(address1, 1);
+  allocations.emplace_back(address1 + 1, 1);
+  allocations.emplace_back(address1 + 10, 1);
+  allocations.emplace_back(address1 + size - 1, 1);
+
+  allocations.emplace_back(address2, 1);
+
+  for (auto allocation : allocations) {
+    ThreadIsolation::RegisterJitAllocationForTesting(allocation.begin(),
+                                                     allocation.size());
+  }
+
+  ThreadIsolation::UnregisterJitAllocationsInPageExceptForTesting(
+      address1, size, to_keep);
+
+  // Everything should be free.
+  ThreadIsolation::RegisterJitAllocationForTesting(address1, size);
+
+  // But we should've kept the allocation on the next page.
+  EXPECT_DEATH_IF_SUPPORTED(
+      { ThreadIsolation::RegisterJitAllocationForTesting(address2, 1); }, "");
+
+  ThreadIsolation::UnregisterJitPage(address1, size);
+  ThreadIsolation::UnregisterJitPage(address2, size);
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/test/unittests/compiler/arm64/instruction-selector-arm64-unittest.cc b/deps/v8/test/unittests/compiler/arm64/instruction-selector-arm64-unittest.cc
index 439057b54d255d..b14b46edbf702c 100644
--- a/deps/v8/test/unittests/compiler/arm64/instruction-selector-arm64-unittest.cc
+++ b/deps/v8/test/unittests/compiler/arm64/instruction-selector-arm64-unittest.cc
@@ -2993,6 +2993,32 @@ TEST_F(InstructionSelectorTest, Float64SelectWithRegisters) {
   EXPECT_EQ(kNotEqual, s[0]->flags_condition());
 }
 
+TEST_F(InstructionSelectorTest, Word32SelectWithRegisters) {
+  StreamBuilder m(this, MachineType::Int32(), MachineType::Int32(),
+                  MachineType::Int32());
+  Node* cond = m.Int32Constant(1);
+  m.Return(m.Word32Select(cond, m.Parameter(0), m.Parameter(1)));
+  Stream s = m.Build();
+  EXPECT_EQ(kArm64Tst32, s[0]->arch_opcode());
+  EXPECT_EQ(4U, s[0]->InputCount());
+  EXPECT_EQ(1U, s[0]->OutputCount());
+  EXPECT_EQ(kFlags_select, s[0]->flags_mode());
+  EXPECT_EQ(kNotEqual, s[0]->flags_condition());
+}
+
+TEST_F(InstructionSelectorTest, Word64SelectWithRegisters) {
+  StreamBuilder m(this, MachineType::Int32(), MachineType::Int64(),
+                  MachineType::Int64());
+  Node* cond = m.Int32Constant(1);
+  m.Return(m.Word64Select(cond, m.Parameter(0), m.Parameter(1)));
+  Stream s = m.Build();
+  EXPECT_EQ(kArm64Tst32, s[0]->arch_opcode());
+  EXPECT_EQ(4U, s[0]->InputCount());
+  EXPECT_EQ(1U, s[0]->OutputCount());
+  EXPECT_EQ(kFlags_select, s[0]->flags_mode());
+  EXPECT_EQ(kNotEqual, s[0]->flags_condition());
+}
+
 // -----------------------------------------------------------------------------
 // Conversions.
 
@@ -3471,8 +3497,8 @@ INSTANTIATE_TEST_SUITE_P(InstructionSelectorTest,
                          ::testing::ValuesIn(kMemoryAccesses));
 
 static const WriteBarrierKind kWriteBarrierKinds[] = {
-    kMapWriteBarrier, kPointerWriteBarrier, kEphemeronKeyWriteBarrier,
-    kFullWriteBarrier};
+    kMapWriteBarrier, kPointerWriteBarrier, kIndirectPointerWriteBarrier,
+    kEphemeronKeyWriteBarrier, kFullWriteBarrier};
 
 const int32_t kStoreWithBarrierImmediates[] = {
     -256, -255, -3,   -2,   -1,   0,    1,     2,     3,     255,
@@ -5564,7 +5590,7 @@ using InstructionSelectorSIMDConstZeroCmTest =
 
 TEST_P(InstructionSelectorSIMDConstZeroCmTest, ConstZero) {
   const SIMDConstZeroCmTest param = GetParam();
-  byte data[16] = {};
+  uint8_t data[16] = {};
   if (!param.is_zero) data[0] = 0xff;
   // Const node on the left
   {
diff --git a/deps/v8/test/unittests/compiler/backend/instruction-selector-unittest.cc b/deps/v8/test/unittests/compiler/backend/instruction-selector-unittest.cc
index 30928fe94a8b82..dfd49f702eae02 100644
--- a/deps/v8/test/unittests/compiler/backend/instruction-selector-unittest.cc
+++ b/deps/v8/test/unittests/compiler/backend/instruction-selector-unittest.cc
@@ -44,7 +44,7 @@ InstructionSelectorTest::Stream InstructionSelectorTest::StreamBuilder::Build(
   TickCounter tick_counter;
   size_t max_unoptimized_frame_height = 0;
   size_t max_pushed_argument_count = 0;
-  InstructionSelector selector(
+  InstructionSelector selector = InstructionSelector::ForTurbofan(
       test_->zone(), node_count, &linkage, &sequence, schedule,
       &source_position_table, nullptr,
       InstructionSelector::kEnableSwitchJumpTable, &tick_counter, nullptr,
@@ -471,7 +471,7 @@ TARGET_TEST_F(InstructionSelectorTest, CallStubWithDeopt) {
   EXPECT_EQ(0, s.ToInt32(call_instr->InputAt(4)));  // This should be a context.
                                                     // We inserted 0 here.
   EXPECT_EQ(0.5, s.ToFloat64(call_instr->InputAt(5)));
-  EXPECT_TRUE(s.ToHeapObject(call_instr->InputAt(6))->IsUndefined(isolate()));
+  EXPECT_TRUE(IsUndefined(*s.ToHeapObject(call_instr->InputAt(6)), isolate()));
 
   // Function.
   EXPECT_EQ(s.ToVreg(function_node), s.ToVreg(call_instr->InputAt(7)));
diff --git a/deps/v8/test/unittests/compiler/backend/instruction-sequence-unittest.cc b/deps/v8/test/unittests/compiler/backend/instruction-sequence-unittest.cc
index 038bcb5e2ece2f..0f36ecc48619c1 100644
--- a/deps/v8/test/unittests/compiler/backend/instruction-sequence-unittest.cc
+++ b/deps/v8/test/unittests/compiler/backend/instruction-sequence-unittest.cc
@@ -345,7 +345,7 @@ InstructionOperand InstructionSequenceTest::Unallocated(
 InstructionOperand* InstructionSequenceTest::ConvertInputs(
     size_t input_size, TestOperand* inputs) {
   InstructionOperand* mapped_inputs =
-      zone()->NewArray<InstructionOperand>(static_cast<int>(input_size));
+      zone()->AllocateArray<InstructionOperand>(static_cast<int>(input_size));
   for (size_t i = 0; i < input_size; ++i) {
     mapped_inputs[i] = ConvertInputOp(inputs[i]);
   }
diff --git a/deps/v8/test/unittests/compiler/codegen-tester.h b/deps/v8/test/unittests/compiler/codegen-tester.h
index 146d9907f7e4a2..aced406a34d057 100644
--- a/deps/v8/test/unittests/compiler/codegen-tester.h
+++ b/deps/v8/test/unittests/compiler/codegen-tester.h
@@ -60,14 +60,14 @@ class RawMachineAssemblerTester : public CallHelper<ReturnType>,
 
   ~RawMachineAssemblerTester() override = default;
 
-  void CheckNumber(double expected, Object number) {
-    CHECK(this->isolate()->factory()->NewNumber(expected)->SameValue(number));
+  void CheckNumber(double expected, Tagged<Object> number) {
+    CHECK(Object::SameValue(*this->isolate()->factory()->NewNumber(expected),
+                            number));
   }
 
-  void CheckString(const char* expected, Object string) {
-    CHECK(
-        this->isolate()->factory()->InternalizeUtf8String(expected)->SameValue(
-            string));
+  void CheckString(const char* expected, Tagged<Object> string) {
+    CHECK(Object::SameValue(
+        *this->isolate()->factory()->InternalizeUtf8String(expected), string));
   }
 
   void GenerateCode() { Generate(); }
@@ -86,7 +86,7 @@ class RawMachineAssemblerTester : public CallHelper<ReturnType>,
           &info, isolate_, call_descriptor(), graph(),
           AssemblerOptions::Default(isolate_), schedule);
     }
-    return code_.ToHandleChecked()->code_entry_point();
+    return code_.ToHandleChecked()->instruction_start();
   }
 
   Zone* zone() { return zone_; }
diff --git a/deps/v8/test/unittests/compiler/codegen-unittest.cc b/deps/v8/test/unittests/compiler/codegen-unittest.cc
index 8112db62500ab7..ce112c0cf1ea3d 100644
--- a/deps/v8/test/unittests/compiler/codegen-unittest.cc
+++ b/deps/v8/test/unittests/compiler/codegen-unittest.cc
@@ -21,7 +21,7 @@ class CodeGenTest : public TestWithIsolateAndZone {
 // TODO(dcarney): on x64 Smis are generated with the SmiConstantRegister
 #if !V8_TARGET_ARCH_X64
     if (Smi::IsValid(v)) {
-      RawMachineAssemblerTester<Object> m(i_isolate(), zone());
+      RawMachineAssemblerTester<Tagged<Object>> m(i_isolate(), zone());
       m.Return(m.NumberConstant(v));
       CHECK_EQ(Smi::FromInt(v), m.Call());
     }
@@ -29,14 +29,14 @@ class CodeGenTest : public TestWithIsolateAndZone {
   }
 
   void RunNumberConstant(double v) {
-    RawMachineAssemblerTester<Object> m(i_isolate(), zone());
+    RawMachineAssemblerTester<Tagged<Object>> m(i_isolate(), zone());
 #if V8_TARGET_ARCH_X64
     // TODO(dcarney): on x64 Smis are generated with the SmiConstantRegister
     Handle<Object> number = m.isolate()->factory()->NewNumber(v);
-    if (number->IsSmi()) return;
+    if (IsSmi(*number)) return;
 #endif
     m.Return(m.NumberConstant(v));
-    Object result = m.Call();
+    Tagged<Object> result = m.Call();
     m.CheckNumber(v, result);
   }
 };
@@ -366,13 +366,13 @@ TEST_F(CodeGenTest, RunNumberConstants) {
 }
 
 TEST_F(CodeGenTest, RunEmptyString) {
-  RawMachineAssemblerTester<Object> m(i_isolate(), zone());
+  RawMachineAssemblerTester<Tagged<Object>> m(i_isolate(), zone());
   m.Return(m.StringConstant("empty"));
   m.CheckString("empty", m.Call());
 }
 
 TEST_F(CodeGenTest, RunHeapConstant) {
-  RawMachineAssemblerTester<Object> m(i_isolate(), zone());
+  RawMachineAssemblerTester<Tagged<Object>> m(i_isolate(), zone());
   m.Return(m.StringConstant("empty"));
   m.CheckString("empty", m.Call());
 }
@@ -381,7 +381,7 @@ TEST_F(CodeGenTest, RunHeapNumberConstant) {
   RawMachineAssemblerTester<void*> m(i_isolate(), zone());
   Handle<HeapObject> number = m.isolate()->factory()->NewHeapNumber(100.5);
   m.Return(m.HeapConstant(number));
-  HeapObject result =
+  Tagged<HeapObject> result =
       HeapObject::cast(Object(reinterpret_cast<Address>(m.Call())));
   CHECK_EQ(result, *number);
 }
diff --git a/deps/v8/test/unittests/compiler/common-operator-reducer-unittest.cc b/deps/v8/test/unittests/compiler/common-operator-reducer-unittest.cc
index ef8d4beb682a29..fb375507a2a9bc 100644
--- a/deps/v8/test/unittests/compiler/common-operator-reducer-unittest.cc
+++ b/deps/v8/test/unittests/compiler/common-operator-reducer-unittest.cc
@@ -30,10 +30,9 @@ class CommonOperatorReducerTest : public GraphTest {
       AdvancedReducer::Editor* editor, Node* node,
       BranchSemantics branch_semantics,
       MachineOperatorBuilder::Flags flags = MachineOperatorBuilder::kNoFlags) {
-    JSHeapBroker broker(isolate(), zone());
     MachineOperatorBuilder machine(zone(), MachineType::PointerRepresentation(),
                                    flags);
-    CommonOperatorReducer reducer(editor, graph(), &broker, common(), &machine,
+    CommonOperatorReducer reducer(editor, graph(), broker(), common(), &machine,
                                   zone(), branch_semantics);
     return reducer.Reduce(node);
   }
@@ -378,6 +377,7 @@ TEST_F(CommonOperatorReducerTest, ReturnWithPhiAndEffectPhiAndMerge) {
   graph()->SetEnd(graph()->NewNode(common()->End(1), ret));
   StrictMock<MockAdvancedReducerEditor> editor;
   EXPECT_CALL(editor, Replace(merge, IsDead()));
+  EXPECT_CALL(editor, Revisit(graph()->end())).Times(2);
   Reduction const r = Reduce(&editor, ret, BranchSemantics::kJS);
   ASSERT_TRUE(r.Changed());
   EXPECT_THAT(r.replacement(), IsDead());
diff --git a/deps/v8/test/unittests/compiler/compiler-unittest.cc b/deps/v8/test/unittests/compiler/compiler-unittest.cc
index 420ed5edef2615..4e46f21c1911f9 100644
--- a/deps/v8/test/unittests/compiler/compiler-unittest.cc
+++ b/deps/v8/test/unittests/compiler/compiler-unittest.cc
@@ -34,12 +34,12 @@ static Handle<Object> GetGlobalProperty(const char* name) {
       .ToHandleChecked();
 }
 
-static void SetGlobalProperty(const char* name, Object value) {
+static void SetGlobalProperty(const char* name, Tagged<Object> value) {
   Isolate* isolate = reinterpret_cast<i::Isolate*>(v8::Isolate::GetCurrent());
   Handle<Object> object(value, isolate);
   Handle<String> internalized_name =
       isolate->factory()->InternalizeUtf8String(name);
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   Runtime::SetObjectProperty(isolate, global, internalized_name, object,
                              StoreOrigin::kMaybeKeyed, Just(kDontThrow))
       .Check();
@@ -68,11 +68,11 @@ static double Inc(Isolate* isolate, int x) {
   Handle<JSFunction> fun = Compile(buffer.begin());
   if (fun.is_null()) return -1;
 
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   Execution::CallScript(isolate, fun, global,
                         isolate->factory()->empty_fixed_array())
       .Check();
-  return GetGlobalProperty("result")->Number();
+  return Object::Number(*GetGlobalProperty("result"));
 }
 
 TEST_F(CompilerTest, Inc) {
@@ -86,11 +86,11 @@ static double Add(Isolate* isolate, int x, int y) {
 
   SetGlobalProperty("x", Smi::FromInt(x));
   SetGlobalProperty("y", Smi::FromInt(y));
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   Execution::CallScript(isolate, fun, global,
                         isolate->factory()->empty_fixed_array())
       .Check();
-  return GetGlobalProperty("result")->Number();
+  return Object::Number(*GetGlobalProperty("result"));
 }
 
 TEST_F(CompilerTest, Add) {
@@ -103,11 +103,11 @@ static double Abs(Isolate* isolate, int x) {
   if (fun.is_null()) return -1;
 
   SetGlobalProperty("x", Smi::FromInt(x));
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   Execution::CallScript(isolate, fun, global,
                         isolate->factory()->empty_fixed_array())
       .Check();
-  return GetGlobalProperty("result")->Number();
+  return Object::Number(*GetGlobalProperty("result"));
 }
 
 TEST_F(CompilerTest, Abs) {
@@ -121,11 +121,11 @@ static double Sum(Isolate* isolate, int n) {
   if (fun.is_null()) return -1;
 
   SetGlobalProperty("n", Smi::FromInt(n));
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   Execution::CallScript(isolate, fun, global,
                         isolate->factory()->empty_fixed_array())
       .Check();
-  return GetGlobalProperty("result")->Number();
+  return Object::Number(*GetGlobalProperty("result"));
 }
 
 TEST_F(CompilerTest, Sum) {
@@ -145,7 +145,7 @@ TEST_F(CompilerPrintTest, Print) {
   const char* source = "for (n = 0; n < 100; ++n) print(n, 1, 2);";
   Handle<JSFunction> fun = Compile(source);
   if (fun.is_null()) return;
-  Handle<JSObject> global(i_isolate()->context().global_object(), i_isolate());
+  Handle<JSObject> global(i_isolate()->context()->global_object(), i_isolate());
   Execution::CallScript(i_isolate(), fun, global,
                         i_isolate()->factory()->empty_fixed_array())
       .Check();
@@ -176,11 +176,11 @@ TEST_F(CompilerTest, Stuff) {
 
   Handle<JSFunction> fun = Compile(source);
   EXPECT_TRUE(!fun.is_null());
-  Handle<JSObject> global(i_isolate()->context().global_object(), i_isolate());
+  Handle<JSObject> global(i_isolate()->context()->global_object(), i_isolate());
   Execution::CallScript(i_isolate(), fun, global,
                         i_isolate()->factory()->empty_fixed_array())
       .Check();
-  EXPECT_EQ(511.0, GetGlobalProperty("r")->Number());
+  EXPECT_EQ(511.0, Object::Number(*GetGlobalProperty("r")));
 }
 
 TEST_F(CompilerTest, UncaughtThrow) {
@@ -190,11 +190,11 @@ TEST_F(CompilerTest, UncaughtThrow) {
   Handle<JSFunction> fun = Compile(source);
   EXPECT_TRUE(!fun.is_null());
   Isolate* isolate = fun->GetIsolate();
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   EXPECT_TRUE(Execution::CallScript(isolate, fun, global,
                                     isolate->factory()->empty_fixed_array())
                   .is_null());
-  EXPECT_EQ(42.0, isolate->pending_exception().Number());
+  EXPECT_EQ(42.0, Object::Number(isolate->pending_exception()));
 }
 
 using CompilerC2JSFramesTest = WithPrintExtensionMixin<v8::TestWithIsolate>;
@@ -221,7 +221,7 @@ TEST_F(CompilerC2JSFramesTest, C2JSFrames) {
   Isolate* isolate = fun0->GetIsolate();
 
   // Run the generated code to populate the global object with 'foo'.
-  Handle<JSObject> global(isolate->context().global_object(), isolate);
+  Handle<JSObject> global(isolate->context()->global_object(), isolate);
   Execution::CallScript(isolate, fun0, global,
                         isolate->factory()->empty_fixed_array())
       .Check();
@@ -229,7 +229,7 @@ TEST_F(CompilerC2JSFramesTest, C2JSFrames) {
   Handle<Object> fun1 =
       JSReceiver::GetProperty(isolate, isolate->global_object(), "foo")
           .ToHandleChecked();
-  EXPECT_TRUE(fun1->IsJSFunction());
+  EXPECT_TRUE(IsJSFunction(*fun1));
 
   Handle<Object> argv[] = {
       isolate->factory()->InternalizeString(base::StaticCharVector("hello"))};
@@ -244,8 +244,7 @@ TEST_F(CompilerTest, Regression236) {
   Factory* factory = i_isolate()->factory();
   v8::HandleScope scope(isolate());
 
-  Handle<Script> script = factory->NewScript(factory->empty_string());
-  script->set_source(ReadOnlyRoots(i_isolate()->heap()).undefined_value());
+  Handle<Script> script = factory->NewScript(factory->undefined_value());
   EXPECT_EQ(-1, Script::GetLineNumber(script, 0));
   EXPECT_EQ(-1, Script::GetLineNumber(script, 100));
   EXPECT_EQ(-1, Script::GetLineNumber(script, -1));
@@ -300,9 +299,9 @@ TEST_F(CompilerTest, FeedbackVectorPreservedAcrossRecompiles) {
   FeedbackSlot slot_for_a(0);
   MaybeObject object = feedback_vector->Get(slot_for_a);
   {
-    HeapObject heap_object;
-    EXPECT_TRUE(object->GetHeapObjectIfWeak(&heap_object));
-    EXPECT_TRUE(heap_object.IsJSFunction());
+    Tagged<HeapObject> heap_object;
+    EXPECT_TRUE(object.GetHeapObjectIfWeak(&heap_object));
+    EXPECT_TRUE(IsJSFunction(heap_object));
   }
 
   RunJS("%OptimizeFunctionOnNextCall(f); f(fun1);");
@@ -310,11 +309,11 @@ TEST_F(CompilerTest, FeedbackVectorPreservedAcrossRecompiles) {
   // Verify that the feedback is still "gathered" despite a recompilation
   // of the full code.
   EXPECT_TRUE(f->HasAttachedOptimizedCode());
-  object = f->feedback_vector().Get(slot_for_a);
+  object = f->feedback_vector()->Get(slot_for_a);
   {
-    HeapObject heap_object;
-    EXPECT_TRUE(object->GetHeapObjectIfWeak(&heap_object));
-    EXPECT_TRUE(heap_object.IsJSFunction());
+    Tagged<HeapObject> heap_object;
+    EXPECT_TRUE(object.GetHeapObjectIfWeak(&heap_object));
+    EXPECT_TRUE(IsJSFunction(heap_object));
   }
 }
 
@@ -347,12 +346,12 @@ TEST_F(CompilerTest, FeedbackVectorUnaffectedByScopeChanges) {
 
   // If we are compiling lazily then it should not be compiled, and so no
   // feedback vector allocated yet.
-  EXPECT_TRUE(!f->shared().is_compiled());
+  EXPECT_TRUE(!f->shared()->is_compiled());
 
   RunJS("morphing_call();");
 
   // Now a feedback vector / closure feedback cell array is allocated.
-  EXPECT_TRUE(f->shared().is_compiled());
+  EXPECT_TRUE(f->shared()->is_compiled());
   EXPECT_TRUE(f->has_feedback_vector() || f->has_closure_feedback_cell_array());
 }
 
@@ -614,11 +613,11 @@ TEST_F(CompilerTest, CompileFunctionScriptOrigin) {
           .ToLocalChecked();
   EXPECT_TRUE(!fun.IsEmpty());
   auto fun_i = i::Handle<i::JSFunction>::cast(Utils::OpenHandle(*fun));
-  EXPECT_TRUE(fun_i->shared().IsSharedFunctionInfo());
-  EXPECT_TRUE(
-      Utils::ToLocal(i::handle(i::Script::cast(fun_i->shared().script()).name(),
-                               i_isolate()))
-          ->StrictEquals(NewString("test")));
+  EXPECT_TRUE(IsSharedFunctionInfo(fun_i->shared()));
+  EXPECT_TRUE(Utils::ToLocal(
+                  i::handle(i::Script::cast(fun_i->shared()->script())->name(),
+                            i_isolate()))
+                  ->StrictEquals(NewString("test")));
   v8::TryCatch try_catch(isolate());
   isolate()->SetCaptureStackTraceForUncaughtExceptions(true);
   EXPECT_TRUE(fun->Call(context(), context()->Global(), 0, nullptr).IsEmpty());
@@ -739,13 +738,13 @@ TEST_F(CompilerTest, InvocationCount) {
       "%EnsureFeedbackVectorForFunction(foo);"
       "foo();");
   Handle<JSFunction> foo = Handle<JSFunction>::cast(GetGlobalProperty("foo"));
-  EXPECT_EQ(1, foo->feedback_vector().invocation_count());
+  EXPECT_EQ(1, foo->feedback_vector()->invocation_count());
   RunJS("foo()");
-  EXPECT_EQ(2, foo->feedback_vector().invocation_count());
+  EXPECT_EQ(2, foo->feedback_vector()->invocation_count());
   RunJS("bar()");
-  EXPECT_EQ(2, foo->feedback_vector().invocation_count());
+  EXPECT_EQ(2, foo->feedback_vector()->invocation_count());
   RunJS("foo(); foo()");
-  EXPECT_EQ(4, foo->feedback_vector().invocation_count());
+  EXPECT_EQ(4, foo->feedback_vector()->invocation_count());
 }
 
 TEST_F(CompilerTest, ShallowEagerCompilation) {
@@ -920,7 +919,7 @@ TEST_F(CompilerTest, ProfilerEnabledDuringBackgroundCompile) {
           .ToLocalChecked();
 
   i::Handle<i::Object> obj = Utils::OpenHandle(*script);
-  EXPECT_TRUE(i::JSFunction::cast(*obj).shared().AreSourcePositionsAvailable(
+  EXPECT_TRUE(i::JSFunction::cast(*obj)->shared()->AreSourcePositionsAvailable(
       i_isolate()));
 
   cpu_profiler->StopProfiling(profile);
diff --git a/deps/v8/test/unittests/compiler/constant-folding-reducer-unittest.cc b/deps/v8/test/unittests/compiler/constant-folding-reducer-unittest.cc
index fe37c015fde3b7..e92f78e40b467b 100644
--- a/deps/v8/test/unittests/compiler/constant-folding-reducer-unittest.cc
+++ b/deps/v8/test/unittests/compiler/constant-folding-reducer-unittest.cc
@@ -13,13 +13,13 @@
 #include "test/unittests/compiler/node-test-utils.h"
 #include "testing/gmock-support.h"
 
-using testing::IsNaN;
-
 namespace v8 {
 namespace internal {
 namespace compiler {
 namespace constant_folding_reducer_unittest {
 
+using testing::IsNaN;
+
 namespace {
 
 const double kFloat64Values[] = {
@@ -58,10 +58,7 @@ const double kIntegerValues[] = {-V8_INFINITY, INT_MIN, -1000.0,  -42.0,
 class ConstantFoldingReducerTest : public TypedGraphTest {
  public:
   ConstantFoldingReducerTest()
-      : TypedGraphTest(3),
-        broker_(isolate(), zone()),
-        simplified_(zone()),
-        deps_(&broker_, zone()) {}
+      : TypedGraphTest(3), simplified_(zone()), deps_(broker(), zone()) {}
   ~ConstantFoldingReducerTest() override = default;
 
  protected:
@@ -82,10 +79,8 @@ class ConstantFoldingReducerTest : public TypedGraphTest {
   }
 
   SimplifiedOperatorBuilder* simplified() { return &simplified_; }
-  JSHeapBroker* broker() { return &broker_; }
 
  private:
-  JSHeapBroker broker_;
   SimplifiedOperatorBuilder simplified_;
   CompilationDependencies deps_;
 };
@@ -109,7 +104,9 @@ TEST_F(ConstantFoldingReducerTest, ParameterWithMinusZero) {
   {
     Node* node = Parameter(Type::Union(
         Type::MinusZero(),
-        Type::Constant(broker(), factory()->NewNumber(0), zone()), zone()));
+        Type::Constant(broker(), CanonicalHandle(factory()->NewNumber(0)),
+                       zone()),
+        zone()));
     UseValue(node);
     Reduction r = Reduce(node);
     EXPECT_FALSE(r.Changed());
@@ -139,7 +136,7 @@ TEST_F(ConstantFoldingReducerTest, ParameterWithNaN) {
                           std::numeric_limits<double>::quiet_NaN(),
                           std::numeric_limits<double>::signaling_NaN()};
   TRACED_FOREACH(double, nan, kNaNs) {
-    Handle<Object> constant = factory()->NewNumber(nan);
+    Handle<Object> constant = CanonicalHandle(factory()->NewNumber(nan));
     Node* node = Parameter(Type::Constant(broker(), constant, zone()));
     Node* use_value = UseValue(node);
     Reduction r = Reduce(node);
@@ -165,7 +162,7 @@ TEST_F(ConstantFoldingReducerTest, ParameterWithNaN) {
 
 TEST_F(ConstantFoldingReducerTest, ParameterWithPlainNumber) {
   TRACED_FOREACH(double, value, kFloat64Values) {
-    Handle<Object> constant = factory()->NewNumber(value);
+    Handle<Object> constant = CanonicalHandle(factory()->NewNumber(value));
     Node* node = Parameter(Type::Constant(broker(), constant, zone()));
     Node* use_value = UseValue(node);
     Reduction r = Reduce(node);
diff --git a/deps/v8/test/unittests/compiler/decompression-optimizer-unittest.cc b/deps/v8/test/unittests/compiler/decompression-optimizer-unittest.cc
index 3e17b3cb7bf80b..a6d9382d570e1f 100644
--- a/deps/v8/test/unittests/compiler/decompression-optimizer-unittest.cc
+++ b/deps/v8/test/unittests/compiler/decompression-optimizer-unittest.cc
@@ -234,8 +234,8 @@ TEST_F(DecompressionOptimizerTest, TypedStateValues) {
   Node* index = Parameter(Type::UnsignedSmall(), 1);
   const int number_of_inputs = 2;
   const ZoneVector<MachineType>* types_for_state_values =
-      graph()->zone()->New<ZoneVector<MachineType>>(number_of_inputs,
-                                                    graph()->zone());
+      graph()->zone()->New<ZoneVector<MachineType>>(
+          number_of_inputs, MachineType::AnyTagged(), graph()->zone());
   SparseInputMask dense = SparseInputMask::Dense();
 
   // Test for both AnyTagged and TaggedPointer.
diff --git a/deps/v8/test/unittests/compiler/function-tester.cc b/deps/v8/test/unittests/compiler/function-tester.cc
index d7e7356c7678f4..19caab83e86fc7 100644
--- a/deps/v8/test/unittests/compiler/function-tester.cc
+++ b/deps/v8/test/unittests/compiler/function-tester.cc
@@ -36,7 +36,6 @@ v8::Local<v8::Value> CompileRun(Isolate* isolate, const char* source) {
 FunctionTester::FunctionTester(Isolate* isolate, const char* source,
                                uint32_t flags)
     : isolate(isolate),
-      canonical(isolate),
       function((v8_flags.allow_natives_syntax = true, NewFunction(source))),
       flags_(flags) {
   Compile(function);
@@ -46,7 +45,6 @@ FunctionTester::FunctionTester(Isolate* isolate, const char* source,
 
 FunctionTester::FunctionTester(Isolate* isolate, Graph* graph, int param_count)
     : isolate(isolate),
-      canonical(isolate),
       function(NewFunction(BuildFunction(param_count).c_str())),
       flags_(0) {
   CompileGraph(graph);
@@ -55,7 +53,6 @@ FunctionTester::FunctionTester(Isolate* isolate, Graph* graph, int param_count)
 FunctionTester::FunctionTester(Isolate* isolate, Handle<Code> code,
                                int param_count)
     : isolate(isolate),
-      canonical(isolate),
       function((v8_flags.allow_natives_syntax = true,
                 NewFunction(BuildFunction(param_count).c_str()))),
       flags_(0) {
@@ -98,7 +95,7 @@ void FunctionTester::CheckCall(Handle<Object> expected, Handle<Object> a,
                                Handle<Object> b, Handle<Object> c,
                                Handle<Object> d) {
   Handle<Object> result = Call(a, b, c, d).ToHandleChecked();
-  CHECK(expected->SameValue(*result));
+  CHECK(Object::SameValue(*expected, *result));
 }
 
 Handle<JSFunction> FunctionTester::NewFunction(const char* source) {
@@ -167,9 +164,8 @@ Handle<JSFunction> FunctionTester::CompileGraph(Graph* graph) {
   return function;
 }
 
-Handle<JSFunction> FunctionTester::Optimize(
-    Handle<JSFunction> function, Zone* zone, uint32_t flags,
-    std::unique_ptr<compiler::JSHeapBroker>* out_broker) {
+Handle<JSFunction> FunctionTester::Optimize(Handle<JSFunction> function,
+                                            Zone* zone, uint32_t flags) {
   Handle<SharedFunctionInfo> shared(function->shared(), isolate);
   IsCompiledScope is_compiled_scope(shared->is_compiled_scope(isolate));
   CHECK(is_compiled_scope.is_compiled() ||
@@ -189,9 +185,8 @@ Handle<JSFunction> FunctionTester::Optimize(
   CHECK(info.shared_info()->HasBytecodeArray());
   JSFunction::EnsureFeedbackVector(isolate, function, &is_compiled_scope);
 
-  Handle<Code> code =
-      compiler::Pipeline::GenerateCodeForTesting(&info, isolate, out_broker)
-          .ToHandleChecked();
+  Handle<Code> code = compiler::Pipeline::GenerateCodeForTesting(&info, isolate)
+                          .ToHandleChecked();
   function->set_code(*code, v8::kReleaseStore);
   return function;
 }
diff --git a/deps/v8/test/unittests/compiler/function-tester.h b/deps/v8/test/unittests/compiler/function-tester.h
index a5af93e9af84f9..b01d2d4410705f 100644
--- a/deps/v8/test/unittests/compiler/function-tester.h
+++ b/deps/v8/test/unittests/compiler/function-tester.h
@@ -31,7 +31,6 @@ class FunctionTester {
   explicit FunctionTester(Isolate* i_isolate, Handle<InstructionStream> code);
 
   Isolate* isolate;
-  CanonicalHandleScope canonical;
   Handle<JSFunction> function;
 
   MaybeHandle<Object> Call() {
@@ -142,12 +141,9 @@ class FunctionTester {
 
   // Takes a JSFunction and runs it through the test version of the optimizing
   // pipeline, allocating the temporary compilation artifacts in a given Zone.
-  // For possible {flags} values, look at OptimizedCompilationInfo::Flag.  If
-  // {out_broker} is not nullptr, returns the JSHeapBroker via that
-  // (transferring ownership to the caller).
-  Handle<JSFunction> Optimize(
-      Handle<JSFunction> function, Zone* zone, uint32_t flags,
-      std::unique_ptr<compiler::JSHeapBroker>* out_broker = nullptr);
+  // For possible {flags} values, look at OptimizedCompilationInfo::Flag.
+  Handle<JSFunction> Optimize(Handle<JSFunction> function, Zone* zone,
+                              uint32_t flags);
 };
 
 }  // namespace compiler
diff --git a/deps/v8/test/unittests/compiler/graph-unittest.cc b/deps/v8/test/unittests/compiler/graph-unittest.cc
index cf0d3ba2a993bd..7457afa53854b1 100644
--- a/deps/v8/test/unittests/compiler/graph-unittest.cc
+++ b/deps/v8/test/unittests/compiler/graph-unittest.cc
@@ -15,20 +15,32 @@ namespace compiler {
 
 GraphTest::GraphTest(int num_parameters)
     : TestWithNativeContextAndZone(kCompressGraphZone),
-      canonical_(isolate()),
       common_(zone()),
       graph_(zone()),
       broker_(isolate(), zone()),
+      broker_scope_(&broker_, isolate(), zone()),
       current_broker_(&broker_),
       source_positions_(&graph_),
       node_origins_(&graph_) {
+  // PersistentHandlesScope currently requires an active handle before it can
+  // be opened and they can't be nested.
+  // TODO(v8:13897): Remove once PersistentHandlesScopes can be opened
+  // uncontionally.
+  if (!PersistentHandlesScope::IsActive(isolate())) {
+    Handle<Object> dummy(ReadOnlyRoots(isolate()->heap()).empty_string(),
+                         isolate());
+    persistent_scope_ = std::make_unique<PersistentHandlesScope>(isolate());
+  }
   graph()->SetStart(graph()->NewNode(common()->Start(num_parameters)));
   graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start()));
   broker()->SetTargetNativeContextRef(isolate()->native_context());
 }
 
-GraphTest::~GraphTest() = default;
-
+GraphTest::~GraphTest() {
+  if (persistent_scope_ != nullptr) {
+    persistent_scope_->Detach();
+  }
+}
 
 Node* GraphTest::Parameter(int32_t index) {
   return graph()->NewNode(common()->Parameter(index), graph()->start());
diff --git a/deps/v8/test/unittests/compiler/graph-unittest.h b/deps/v8/test/unittests/compiler/graph-unittest.h
index 4c3b6bdfc60296..bf6300d9b886f6 100644
--- a/deps/v8/test/unittests/compiler/graph-unittest.h
+++ b/deps/v8/test/unittests/compiler/graph-unittest.h
@@ -67,13 +67,27 @@ class GraphTest : public TestWithNativeContextAndZone {
   SourcePositionTable* source_positions() { return &source_positions_; }
   NodeOriginTable* node_origins() { return &node_origins_; }
   JSHeapBroker* broker() { return &broker_; }
+  template <typename T>
+  Handle<T> CanonicalHandle(T object) {
+    static_assert(kTaggedCanConvertToRawObjects);
+    return CanonicalHandle(Tagged<T>(object));
+  }
+  template <typename T>
+  Handle<T> CanonicalHandle(Tagged<T> object) {
+    return broker()->CanonicalPersistentHandle(object);
+  }
+  template <typename T>
+  Handle<T> CanonicalHandle(Handle<T> handle) {
+    return CanonicalHandle(*handle);
+  }
   TickCounter* tick_counter() { return &tick_counter_; }
 
  private:
-  CanonicalHandleScope canonical_;
   CommonOperatorBuilder common_;
   Graph graph_;
   JSHeapBroker broker_;
+  JSHeapBrokerScopeForTesting broker_scope_;
+  std::unique_ptr<PersistentHandlesScope> persistent_scope_;
   CurrentHeapBrokerScope current_broker_;
   SourcePositionTable source_positions_;
   NodeOriginTable node_origins_;
diff --git a/deps/v8/test/unittests/compiler/int64-lowering-unittest.cc b/deps/v8/test/unittests/compiler/int64-lowering-unittest.cc
index e2a05badd6e78f..ef27117a08d368 100644
--- a/deps/v8/test/unittests/compiler/int64-lowering-unittest.cc
+++ b/deps/v8/test/unittests/compiler/int64-lowering-unittest.cc
@@ -1028,60 +1028,6 @@ TEST_F(Int64LoweringTest, LoopExitValue) {
                         start(), start()));
 }
 
-TEST_F(Int64LoweringTest, WasmBigIntSpecialCaseBigIntToI64) {
-  Node* target = Int32Constant(1);
-  Node* context = Int32Constant(2);
-  Node* bigint = Int32Constant(4);
-  WasmCallDescriptors* descriptors = wasm::GetWasmEngine()->call_descriptors();
-
-  CallDescriptor* bigint_to_i64_call_descriptor =
-      descriptors->GetBigIntToI64Descriptor(StubCallMode::kCallBuiltinPointer,
-                                            false);
-
-  CallDescriptor* bigint_to_i32_pair_call_descriptor =
-      descriptors->GetLoweredCallDescriptor(bigint_to_i64_call_descriptor);
-
-  Node* call_node =
-      graph()->NewNode(common()->Call(bigint_to_i64_call_descriptor), target,
-                       bigint, context, start(), start());
-
-  LowerGraphWithSpecialCase(call_node, MachineRepresentation::kWord64);
-
-  Capture<Node*> call;
-  Matcher<Node*> call_matcher =
-      IsCall(bigint_to_i32_pair_call_descriptor, target, bigint, context,
-             start(), start());
-
-  EXPECT_THAT(graph()->end()->InputAt(1),
-              IsReturn2(IsProjection(0, AllOf(CaptureEq(&call), call_matcher)),
-                        IsProjection(1, AllOf(CaptureEq(&call), call_matcher)),
-                        start(), start()));
-}
-
-TEST_F(Int64LoweringTest, WasmBigIntSpecialCaseI64ToBigInt) {
-  Node* target = Int32Constant(1);
-  Node* i64 = Int64Constant(value(0));
-  WasmCallDescriptors* descriptors = wasm::GetWasmEngine()->call_descriptors();
-
-  CallDescriptor* i64_to_bigint_call_descriptor =
-      descriptors->GetI64ToBigIntDescriptor(StubCallMode::kCallBuiltinPointer);
-
-  CallDescriptor* i32_pair_to_bigint_call_descriptor =
-      descriptors->GetLoweredCallDescriptor(i64_to_bigint_call_descriptor);
-
-  Node* call = graph()->NewNode(common()->Call(i64_to_bigint_call_descriptor),
-                                target, i64, start(), start());
-
-  LowerGraphWithSpecialCase(call, MachineRepresentation::kTaggedPointer);
-
-  EXPECT_THAT(
-      graph()->end()->InputAt(1),
-      IsReturn(IsCall(i32_pair_to_bigint_call_descriptor, target,
-                      IsInt32Constant(low_word_value(0)),
-                      IsInt32Constant(high_word_value(0)), start(), start()),
-               start(), start()));
-}
-
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/compiler/js-call-reducer-unittest.cc b/deps/v8/test/unittests/compiler/js-call-reducer-unittest.cc
index 7dc31d92ac375f..cb07410f9a6db7 100644
--- a/deps/v8/test/unittests/compiler/js-call-reducer-unittest.cc
+++ b/deps/v8/test/unittests/compiler/js-call-reducer-unittest.cc
@@ -48,7 +48,7 @@ class JSCallReducerTest : public TypedGraphTest {
             isolate(), isolate()->global_object(),
             isolate()->factory()->NewStringFromAsciiChecked(name))
             .ToHandleChecked());
-    return HeapConstant(f);
+    return HeapConstant(CanonicalHandle(f));
   }
 
   Node* MathFunction(const std::string& name) {
@@ -62,7 +62,7 @@ class JSCallReducerTest : public TypedGraphTest {
             isolate(), m,
             isolate()->factory()->NewStringFromAsciiChecked(name.c_str()))
             .ToHandleChecked());
-    return HeapConstant(f);
+    return HeapConstant(CanonicalHandle(f));
   }
 
   Node* StringFunction(const char* name) {
@@ -75,7 +75,7 @@ class JSCallReducerTest : public TypedGraphTest {
         Object::GetProperty(
             isolate(), m, isolate()->factory()->NewStringFromAsciiChecked(name))
             .ToHandleChecked());
-    return HeapConstant(f);
+    return HeapConstant(CanonicalHandle(f));
   }
 
   Node* NumberFunction(const char* name) {
@@ -88,7 +88,7 @@ class JSCallReducerTest : public TypedGraphTest {
         Object::GetProperty(
             isolate(), m, isolate()->factory()->NewStringFromAsciiChecked(name))
             .ToHandleChecked());
-    return HeapConstant(f);
+    return HeapConstant(CanonicalHandle(f));
   }
 
   std::string op_name_for(const char* fnc) {
@@ -125,7 +125,7 @@ class JSCallReducerTest : public TypedGraphTest {
 
 TEST_F(JSCallReducerTest, PromiseConstructorNoArgs) {
   Node* promise =
-      HeapConstant(handle(native_context()->promise_function(), isolate()));
+      HeapConstant(CanonicalHandle(native_context()->promise_function()));
   Node* effect = graph()->start();
   Node* control = graph()->start();
   Node* context = UndefinedConstant();
@@ -143,9 +143,9 @@ TEST_F(JSCallReducerTest, PromiseConstructorNoArgs) {
 
 TEST_F(JSCallReducerTest, PromiseConstructorSubclass) {
   Node* promise =
-      HeapConstant(handle(native_context()->promise_function(), isolate()));
+      HeapConstant(CanonicalHandle(native_context()->promise_function()));
   Node* new_target =
-      HeapConstant(handle(native_context()->array_function(), isolate()));
+      HeapConstant(CanonicalHandle(native_context()->array_function()));
   Node* effect = graph()->start();
   Node* control = graph()->start();
   Node* context = UndefinedConstant();
@@ -164,7 +164,7 @@ TEST_F(JSCallReducerTest, PromiseConstructorSubclass) {
 
 TEST_F(JSCallReducerTest, PromiseConstructorBasic) {
   Node* promise =
-      HeapConstant(handle(native_context()->promise_function(), isolate()));
+      HeapConstant(CanonicalHandle(native_context()->promise_function()));
   Node* effect = graph()->start();
   Node* control = graph()->start();
   Node* context = UndefinedConstant();
@@ -184,7 +184,7 @@ TEST_F(JSCallReducerTest, PromiseConstructorBasic) {
 // except that we invalidate the protector cell.
 TEST_F(JSCallReducerTest, PromiseConstructorWithHook) {
   Node* promise =
-      HeapConstant(handle(native_context()->promise_function(), isolate()));
+      HeapConstant(CanonicalHandle(native_context()->promise_function()));
   Node* effect = graph()->start();
   Node* control = graph()->start();
   Node* context = UndefinedConstant();
diff --git a/deps/v8/test/unittests/compiler/js-create-lowering-unittest.cc b/deps/v8/test/unittests/compiler/js-create-lowering-unittest.cc
index 62c5bba17eb862..726327665f5db5 100644
--- a/deps/v8/test/unittests/compiler/js-create-lowering-unittest.cc
+++ b/deps/v8/test/unittests/compiler/js-create-lowering-unittest.cc
@@ -26,10 +26,7 @@ namespace compiler {
 class JSCreateLoweringTest : public TypedGraphTest {
  public:
   JSCreateLoweringTest()
-      : TypedGraphTest(3),
-        javascript_(zone()),
-        deps_(broker(), zone()),
-        handle_scope_(isolate()) {}
+      : TypedGraphTest(3), javascript_(zone()), deps_(broker(), zone()) {}
   ~JSCreateLoweringTest() override = default;
 
  protected:
@@ -60,14 +57,13 @@ class JSCreateLoweringTest : public TypedGraphTest {
  private:
   JSOperatorBuilder javascript_;
   CompilationDependencies deps_;
-  CanonicalHandleScope handle_scope_;
 };
 
 // -----------------------------------------------------------------------------
 // JSCreate
 
 TEST_F(JSCreateLoweringTest, JSCreate) {
-  Handle<JSFunction> function = isolate()->object_function();
+  Handle<JSFunction> function = CanonicalHandle(*isolate()->object_function());
   Node* const target = graph()->NewNode(common()->HeapConstant(function));
   Node* const context = Parameter(Type::Any());
   Node* const effect = graph()->start();
@@ -79,7 +75,7 @@ TEST_F(JSCreateLoweringTest, JSCreate) {
   EXPECT_THAT(
       r.replacement(),
       IsFinishRegion(
-          IsAllocate(IsNumberConstant(function->initial_map().instance_size()),
+          IsAllocate(IsNumberConstant(function->initial_map()->instance_size()),
                      IsBeginRegion(effect), control),
           _));
 }
@@ -91,8 +87,8 @@ TEST_F(JSCreateLoweringTest, JSCreateArgumentsInlinedMapped) {
   Node* const closure = Parameter(Type::Any());
   Node* const context = UndefinedConstant();
   Node* const effect = graph()->start();
-  Handle<SharedFunctionInfo> shared(isolate()->regexp_function()->shared(),
-                                    isolate());
+  Handle<SharedFunctionInfo> shared =
+      CanonicalHandle(isolate()->regexp_function()->shared());
   Node* const frame_state_outer = FrameState(shared, graph()->start());
   Node* const frame_state_inner = FrameState(shared, frame_state_outer);
   Reduction r = Reduce(graph()->NewNode(
@@ -110,8 +106,8 @@ TEST_F(JSCreateLoweringTest, JSCreateArgumentsInlinedUnmapped) {
   Node* const closure = Parameter(Type::Any());
   Node* const context = UndefinedConstant();
   Node* const effect = graph()->start();
-  Handle<SharedFunctionInfo> shared(isolate()->regexp_function()->shared(),
-                                    isolate());
+  Handle<SharedFunctionInfo> shared =
+      CanonicalHandle(isolate()->regexp_function()->shared());
   Node* const frame_state_outer = FrameState(shared, graph()->start());
   Node* const frame_state_inner = FrameState(shared, frame_state_outer);
   Reduction r = Reduce(graph()->NewNode(
@@ -129,8 +125,8 @@ TEST_F(JSCreateLoweringTest, JSCreateArgumentsInlinedRestArray) {
   Node* const closure = Parameter(Type::Any());
   Node* const context = UndefinedConstant();
   Node* const effect = graph()->start();
-  Handle<SharedFunctionInfo> shared(isolate()->regexp_function()->shared(),
-                                    isolate());
+  Handle<SharedFunctionInfo> shared =
+      CanonicalHandle(isolate()->regexp_function()->shared());
   Node* const frame_state_outer = FrameState(shared, graph()->start());
   Node* const frame_state_inner = FrameState(shared, frame_state_outer);
   Reduction r = Reduce(graph()->NewNode(
diff --git a/deps/v8/test/unittests/compiler/js-native-context-specialization-unittest.cc b/deps/v8/test/unittests/compiler/js-native-context-specialization-unittest.cc
index 3cbb1ef70f161b..766577ce23d9af 100644
--- a/deps/v8/test/unittests/compiler/js-native-context-specialization-unittest.cc
+++ b/deps/v8/test/unittests/compiler/js-native-context-specialization-unittest.cc
@@ -29,8 +29,8 @@ TEST_F(JSNativeContextSpecializationTest, GetMaxStringLengthOfString) {
   const size_t str_len = 3;
   const size_t num_len = kMaxDoubleStringLength;
 
-  Node* const str_node = graph()->NewNode(
-      common()->HeapConstant(factory()->InternalizeUtf8String("str")));
+  Node* const str_node = graph()->NewNode(common()->HeapConstant(
+      CanonicalHandle(factory()->InternalizeUtf8String("str"))));
   EXPECT_EQ(
       JSNativeContextSpecialization::GetMaxStringLength(broker(), str_node),
       str_len);
diff --git a/deps/v8/test/unittests/compiler/load-elimination-unittest.cc b/deps/v8/test/unittests/compiler/load-elimination-unittest.cc
index 785d8d9da4216e..304d55b40004e0 100644
--- a/deps/v8/test/unittests/compiler/load-elimination-unittest.cc
+++ b/deps/v8/test/unittests/compiler/load-elimination-unittest.cc
@@ -46,7 +46,7 @@ TEST_F(LoadEliminationTest, LoadElementAndLoadElement) {
                                 MachineType::AnyTagged(), kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -72,7 +72,7 @@ TEST_F(LoadEliminationTest, StoreElementAndLoadElement) {
                                 MachineType::AnyTagged(), kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -99,7 +99,7 @@ TEST_F(LoadEliminationTest, StoreElementAndStoreFieldAndLoadElement) {
                                 MachineType::AnyTagged(), kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -126,12 +126,12 @@ TEST_F(LoadEliminationTest, LoadFieldAndLoadField) {
   Node* effect = graph()->start();
   Node* control = graph()->start();
   FieldAccess const access = {kTaggedBase,         kTaggedSize,
-                              MaybeHandle<Name>(), MaybeHandle<Map>(),
+                              MaybeHandle<Name>(), OptionalMapRef(),
                               Type::Any(),         MachineType::AnyTagged(),
                               kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -152,13 +152,12 @@ TEST_F(LoadEliminationTest, StoreFieldAndLoadField) {
   Node* value = Parameter(Type::Any(), 1);
   Node* effect = graph()->start();
   Node* control = graph()->start();
-  FieldAccess access = {kTaggedBase,         kTaggedSize,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
-                        Type::Any(),         MachineType::AnyTagged(),
+  FieldAccess access = {kTaggedBase,      kTaggedSize, MaybeHandle<Name>(),
+                        OptionalMapRef(), Type::Any(), MachineType::AnyTagged(),
                         kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -181,18 +180,18 @@ TEST_F(LoadEliminationTest, StoreFieldAndKillFields) {
   Node* control = graph()->start();
 
   FieldAccess access1 = {kTaggedBase,         kTaggedSize,
-                         MaybeHandle<Name>(), MaybeHandle<Map>(),
+                         MaybeHandle<Name>(), OptionalMapRef(),
                          Type::Any(),         MachineType::AnyTagged(),
                          kNoWriteBarrier};
 
   // Offset that out of field cache size.
   FieldAccess access2 = {kTaggedBase,         2048 * kTaggedSize,
-                         MaybeHandle<Name>(), MaybeHandle<Map>(),
+                         MaybeHandle<Name>(), OptionalMapRef(),
                          Type::Any(),         MachineType::AnyTagged(),
                          kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -220,13 +219,12 @@ TEST_F(LoadEliminationTest, StoreFieldAndStoreElementAndLoadField) {
   Node* index = Parameter(Type::UnsignedSmall(), 2);
   Node* effect = graph()->start();
   Node* control = graph()->start();
-  FieldAccess access = {kTaggedBase,         kTaggedSize,
-                        MaybeHandle<Name>(), MaybeHandle<Map>(),
-                        Type::Any(),         MachineType::AnyTagged(),
+  FieldAccess access = {kTaggedBase,      kTaggedSize, MaybeHandle<Name>(),
+                        OptionalMapRef(), Type::Any(), MachineType::AnyTagged(),
                         kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -257,7 +255,7 @@ TEST_F(LoadEliminationTest, LoadElementOnTrueBranchOfDiamond) {
                                 MachineType::AnyTagged(), kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -292,7 +290,7 @@ TEST_F(LoadEliminationTest, LoadElementOnFalseBranchOfDiamond) {
                                 MachineType::AnyTagged(), kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -323,12 +321,12 @@ TEST_F(LoadEliminationTest, LoadFieldOnFalseBranchOfDiamond) {
   Node* effect = graph()->start();
   Node* control = graph()->start();
   FieldAccess const access = {kTaggedBase,         kTaggedSize,
-                              MaybeHandle<Name>(), MaybeHandle<Map>(),
+                              MaybeHandle<Name>(), OptionalMapRef(),
                               Type::Any(),         MachineType::AnyTagged(),
                               kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -359,12 +357,12 @@ TEST_F(LoadEliminationTest, LoadFieldOnTrueBranchOfDiamond) {
   Node* effect = graph()->start();
   Node* control = graph()->start();
   FieldAccess const access = {kTaggedBase,         kTaggedSize,
-                              MaybeHandle<Name>(), MaybeHandle<Map>(),
+                              MaybeHandle<Name>(), OptionalMapRef(),
                               Type::Any(),         MachineType::AnyTagged(),
                               kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -395,12 +393,12 @@ TEST_F(LoadEliminationTest, LoadFieldWithTypeMismatch) {
   Node* effect = graph()->start();
   Node* control = graph()->start();
   FieldAccess const access = {kTaggedBase,         kTaggedSize,
-                              MaybeHandle<Name>(), MaybeHandle<Map>(),
+                              MaybeHandle<Name>(), OptionalMapRef(),
                               Type::Unsigned31(),  MachineType::AnyTagged(),
                               kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -426,7 +424,7 @@ TEST_F(LoadEliminationTest, LoadElementWithTypeMismatch) {
                                 MachineType::AnyTagged(), kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(graph()->start());
 
@@ -447,12 +445,12 @@ TEST_F(LoadEliminationTest, AliasAnalysisForFinishRegion) {
   Node* effect = graph()->start();
   Node* control = graph()->start();
   FieldAccess const access = {kTaggedBase,         kTaggedSize,
-                              MaybeHandle<Name>(), MaybeHandle<Map>(),
+                              MaybeHandle<Name>(), OptionalMapRef(),
                               Type::Signed32(),    MachineType::AnyTagged(),
                               kNoWriteBarrier};
 
   StrictMock<MockAdvancedReducerEditor> editor;
-  LoadElimination load_elimination(&editor, jsgraph(), zone());
+  LoadElimination load_elimination(&editor, broker(), jsgraph(), zone());
 
   load_elimination.Reduce(effect);
 
diff --git a/deps/v8/test/unittests/compiler/node-cache-unittest.cc b/deps/v8/test/unittests/compiler/node-cache-unittest.cc
index 56f4b81cf2a1df..31f61cde0b3a9c 100644
--- a/deps/v8/test/unittests/compiler/node-cache-unittest.cc
+++ b/deps/v8/test/unittests/compiler/node-cache-unittest.cc
@@ -51,7 +51,7 @@ TEST_F(NodeCacheTest, Int32Constant_five) {
 TEST_F(NodeCacheTest, Int32Constant_hits) {
   Int32NodeCache cache(zone());
   const int32_t kSize = 1500;
-  Node** nodes = zone()->NewArray<Node*>(kSize);
+  Node** nodes = zone()->AllocateArray<Node*>(kSize);
 
   for (int i = 0; i < kSize; i++) {
     int32_t v = i * -55;
@@ -89,7 +89,7 @@ TEST_F(NodeCacheTest, Int64Constant_back_to_back) {
 TEST_F(NodeCacheTest, Int64Constant_hits) {
   Int64NodeCache cache(zone());
   const int32_t kSize = 1500;
-  Node** nodes = zone()->NewArray<Node*>(kSize);
+  Node** nodes = zone()->AllocateArray<Node*>(kSize);
 
   for (int i = 0; i < kSize; i++) {
     int64_t v = static_cast<int64_t>(i) * static_cast<int64_t>(5003001);
diff --git a/deps/v8/test/unittests/compiler/node-properties-unittest.cc b/deps/v8/test/unittests/compiler/node-properties-unittest.cc
index 35eb11d6cfab75..8297215366b6ec 100644
--- a/deps/v8/test/unittests/compiler/node-properties-unittest.cc
+++ b/deps/v8/test/unittests/compiler/node-properties-unittest.cc
@@ -2,20 +2,21 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
-#include "src/compiler/common-operator.h"
 #include "src/compiler/node-properties.h"
+
+#include "src/compiler/common-operator.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gmock/include/gmock/gmock.h"
 
-using testing::AnyOf;
-using testing::ElementsAre;
-using testing::IsNull;
-
 namespace v8 {
 namespace internal {
 namespace compiler {
 namespace node_properties_unittest {
 
+using testing::AnyOf;
+using testing::ElementsAre;
+using testing::IsNull;
+
 class NodePropertiesTest : public TestWithZone {
  public:
   NodePropertiesTest() : TestWithZone(kCompressGraphZone) {}
diff --git a/deps/v8/test/unittests/compiler/node-test-utils.h b/deps/v8/test/unittests/compiler/node-test-utils.h
index db5059dfb89b58..66a9d825b6e8ca 100644
--- a/deps/v8/test/unittests/compiler/node-test-utils.h
+++ b/deps/v8/test/unittests/compiler/node-test-utils.h
@@ -16,12 +16,7 @@ namespace v8 {
 namespace internal {
 
 // Forward declarations.
-class ExternalReference;
-template <typename T>
-class Handle;
-class HeapObject;
 class Type;
-enum class TypeofMode;
 
 namespace compiler {
 
diff --git a/deps/v8/test/unittests/compiler/regalloc/live-range-unittest.cc b/deps/v8/test/unittests/compiler/regalloc/live-range-unittest.cc
index d2785465caeb4c..4811187e79a572 100644
--- a/deps/v8/test/unittests/compiler/regalloc/live-range-unittest.cc
+++ b/deps/v8/test/unittests/compiler/regalloc/live-range-unittest.cc
@@ -47,8 +47,8 @@ class TestRangeBuilder {
   }
 
   TopLevelLiveRange* Build() {
-    TopLevelLiveRange* range =
-        zone_->New<TopLevelLiveRange>(id_, MachineRepresentation::kTagged);
+    TopLevelLiveRange* range = zone_->New<TopLevelLiveRange>(
+        id_, MachineRepresentation::kTagged, zone_);
     // Traverse the provided interval specifications backwards, because that is
     // what LiveRange expects.
     for (int i = static_cast<int>(pairs_.size()) - 1; i >= 0; --i) {
@@ -56,13 +56,13 @@ class TestRangeBuilder {
       LifetimePosition start = LifetimePosition::FromInt(pair.first);
       LifetimePosition end = LifetimePosition::FromInt(pair.second);
       CHECK(start < end);
-      range->AddUseInterval(start, end, zone_, v8_flags.trace_turbo_alloc);
+      range->AddUseInterval(start, end, zone_);
     }
     for (int pos : uses_) {
       UsePosition* use_position =
           zone_->New<UsePosition>(LifetimePosition::FromInt(pos), nullptr,
                                   nullptr, UsePositionHintType::kNone);
-      range->AddUsePosition(use_position, v8_flags.trace_turbo_alloc);
+      range->AddUsePosition(use_position, zone_);
     }
 
     pairs_.clear();
@@ -86,29 +86,33 @@ class LiveRangeUnitTest : public TestWithZone {
   }
 
   // Ranges first and second match structurally.
-  bool RangesMatch(LiveRange* first, LiveRange* second) {
+  bool RangesMatch(const LiveRange* first, const LiveRange* second) {
     if (first->Start() != second->Start() || first->End() != second->End()) {
       return false;
     }
-    UseInterval* i1 = first->first_interval();
-    UseInterval* i2 = second->first_interval();
+    auto i1 = first->intervals().begin();
+    auto i2 = second->intervals().begin();
 
-    while (i1 != nullptr && i2 != nullptr) {
-      if (i1->start() != i2->start() || i1->end() != i2->end()) return false;
-      i1 = i1->next();
-      i2 = i2->next();
+    while (i1 != first->intervals().end() && i2 != second->intervals().end()) {
+      if (*i1 != *i2) return false;
+      ++i1;
+      ++i2;
+    }
+    if (i1 != first->intervals().end() || i2 != second->intervals().end()) {
+      return false;
     }
-    if (i1 != nullptr || i2 != nullptr) return false;
 
-    UsePosition* p1 = first->first_pos();
-    UsePosition* p2 = second->first_pos();
+    UsePosition* const* p1 = first->positions().begin();
+    UsePosition* const* p2 = second->positions().begin();
 
-    while (p1 != nullptr && p2 != nullptr) {
-      if (p1->pos() != p2->pos()) return false;
-      p1 = p1->next();
-      p2 = p2->next();
+    while (p1 != first->positions().end() && p2 != second->positions().end()) {
+      if ((*p1)->pos() != (*p2)->pos()) return false;
+      ++p1;
+      ++p2;
+    }
+    if (p1 != first->positions().end() || p2 != second->positions().end()) {
+      return false;
     }
-    if (p1 != nullptr || p2 != nullptr) return false;
     return true;
   }
 };
@@ -116,11 +120,10 @@ class LiveRangeUnitTest : public TestWithZone {
 TEST_F(LiveRangeUnitTest, InvalidConstruction) {
   // Build a range manually, because the builder guards against empty cases.
   TopLevelLiveRange* range =
-      zone()->New<TopLevelLiveRange>(1, MachineRepresentation::kTagged);
+      zone()->New<TopLevelLiveRange>(1, MachineRepresentation::kTagged, zone());
   V8_ASSERT_DEBUG_DEATH(
       range->AddUseInterval(LifetimePosition::FromInt(0),
-                            LifetimePosition::FromInt(0), zone(),
-                            v8_flags.trace_turbo_alloc),
+                            LifetimePosition::FromInt(0), zone()),
       ".*");
 }
 
@@ -297,6 +300,144 @@ TEST_F(LiveRangeUnitTest, SplitManyIntervalUsePositionsAfter) {
   EXPECT_TRUE(RangesMatch(expected_bottom, child));
 }
 
+class DoubleEndedSplitVectorTest : public TestWithZone {};
+
+TEST_F(DoubleEndedSplitVectorTest, PushFront) {
+  DoubleEndedSplitVector<int> vec;
+
+  vec.push_front(zone(), 0);
+  vec.push_front(zone(), 1);
+  EXPECT_EQ(vec.front(), 1);
+  EXPECT_EQ(vec.back(), 0);
+
+  // Subsequent `push_front` should grow the backing allocation super-linearly.
+  vec.push_front(zone(), 2);
+  CHECK_EQ(vec.capacity(), 4);
+
+  // As long as there is remaining capacity, `push_front` should not copy or
+  // reallocate.
+  int* address_of_0 = &vec.back();
+  CHECK_EQ(*address_of_0, 0);
+  vec.push_front(zone(), 3);
+  EXPECT_EQ(address_of_0, &vec.back());
+}
+
+TEST_F(DoubleEndedSplitVectorTest, PopFront) {
+  DoubleEndedSplitVector<int> vec;
+
+  vec.push_front(zone(), 0);
+  vec.push_front(zone(), 1);
+  vec.pop_front();
+  EXPECT_EQ(vec.size(), 1u);
+  EXPECT_EQ(vec.front(), 0);
+}
+
+TEST_F(DoubleEndedSplitVectorTest, Insert) {
+  DoubleEndedSplitVector<int> vec;
+
+  // Inserts with `direction = kFrontOrBack` should not reallocate when
+  // there is space at either the front or back.
+  vec.insert(zone(), vec.end(), 0);
+  vec.insert(zone(), vec.end(), 1);
+  vec.insert(zone(), vec.end(), 2);
+  CHECK_EQ(vec.capacity(), 4);
+
+  size_t memory_before = zone()->allocation_size();
+  vec.insert(zone(), vec.end(), 3);
+  size_t used_memory = zone()->allocation_size() - memory_before;
+  EXPECT_EQ(used_memory, 0u);
+}
+
+TEST_F(DoubleEndedSplitVectorTest, InsertFront) {
+  DoubleEndedSplitVector<int> vec;
+
+  // Inserts with `direction = kFront` should only copy elements to the left
+  // of the insert position, if there is space at the front.
+  vec.insert<kFront>(zone(), vec.begin(), 0);
+  vec.insert<kFront>(zone(), vec.begin(), 1);
+  vec.insert<kFront>(zone(), vec.begin(), 2);
+
+  int* address_of_0 = &vec.back();
+  CHECK_EQ(*address_of_0, 0);
+  vec.insert<kFront>(zone(), vec.begin(), 3);
+  EXPECT_EQ(address_of_0, &vec.back());
+}
+
+TEST_F(DoubleEndedSplitVectorTest, SplitAtBegin) {
+  DoubleEndedSplitVector<int> vec;
+
+  vec.insert(zone(), vec.end(), 0);
+  vec.insert(zone(), vec.end(), 1);
+  vec.insert(zone(), vec.end(), 2);
+
+  DoubleEndedSplitVector<int> all_split_begin = vec.SplitAt(vec.begin());
+  EXPECT_EQ(all_split_begin.size(), 3u);
+  EXPECT_EQ(vec.size(), 0u);
+}
+
+TEST_F(DoubleEndedSplitVectorTest, SplitAtEnd) {
+  DoubleEndedSplitVector<int> vec;
+
+  vec.insert(zone(), vec.end(), 0);
+  vec.insert(zone(), vec.end(), 1);
+  vec.insert(zone(), vec.end(), 2);
+
+  DoubleEndedSplitVector<int> empty_split_end = vec.SplitAt(vec.end());
+  EXPECT_EQ(empty_split_end.size(), 0u);
+  EXPECT_EQ(vec.size(), 3u);
+}
+
+TEST_F(DoubleEndedSplitVectorTest, SplitAtMiddle) {
+  DoubleEndedSplitVector<int> vec;
+
+  vec.insert(zone(), vec.end(), 0);
+  vec.insert(zone(), vec.end(), 1);
+  vec.insert(zone(), vec.end(), 2);
+
+  DoubleEndedSplitVector<int> split_off = vec.SplitAt(vec.begin() + 1);
+  EXPECT_EQ(split_off.size(), 2u);
+  EXPECT_EQ(split_off[0], 1);
+  EXPECT_EQ(split_off[1], 2);
+  EXPECT_EQ(vec.size(), 1u);
+  EXPECT_EQ(vec[0], 0);
+}
+
+TEST_F(DoubleEndedSplitVectorTest, AppendCheap) {
+  DoubleEndedSplitVector<int> vec;
+
+  vec.insert(zone(), vec.end(), 0);
+  vec.insert(zone(), vec.end(), 1);
+  vec.insert(zone(), vec.end(), 2);
+
+  DoubleEndedSplitVector<int> split_off = vec.SplitAt(vec.begin() + 1);
+
+  // `Append`s of just split vectors should not allocate.
+  size_t memory_before = zone()->allocation_size();
+  vec.Append(zone(), split_off);
+  size_t used_memory = zone()->allocation_size() - memory_before;
+  EXPECT_EQ(used_memory, 0u);
+
+  EXPECT_EQ(vec[0], 0);
+  EXPECT_EQ(vec[1], 1);
+  EXPECT_EQ(vec[2], 2);
+}
+
+TEST_F(DoubleEndedSplitVectorTest, AppendGeneralCase) {
+  DoubleEndedSplitVector<int> vec;
+  vec.insert(zone(), vec.end(), 0);
+  vec.insert(zone(), vec.end(), 1);
+
+  DoubleEndedSplitVector<int> other;
+  other.insert(zone(), other.end(), 2);
+
+  // May allocate.
+  vec.Append(zone(), other);
+
+  EXPECT_EQ(vec[0], 0);
+  EXPECT_EQ(vec[1], 1);
+  EXPECT_EQ(vec[2], 2);
+}
+
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/compiler/revec-unittest.cc b/deps/v8/test/unittests/compiler/revec-unittest.cc
index 01e14c26bfe50f..7454cb6e109504 100644
--- a/deps/v8/test/unittests/compiler/revec-unittest.cc
+++ b/deps/v8/test/unittests/compiler/revec-unittest.cc
@@ -8,6 +8,8 @@
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/node.h"
+#include "src/compiler/opcodes.h"
+#include "src/compiler/operator.h"
 #include "src/compiler/revectorizer.h"
 #include "src/compiler/wasm-compiler.h"
 #include "src/wasm/wasm-module.h"
@@ -33,6 +35,16 @@ class RevecTest : public TestWithIsolateAndZone {
                  MachineOperatorBuilder::Flag::kAllOptionalOps),
         mcgraph_(&graph_, &common_, &machine_) {}
 
+  void TestBinOp(const Operator* bin_op,
+                 const IrOpcode::Value expected_simd256_op_code);
+  void TestShiftOp(const Operator* shift_op,
+                   const IrOpcode::Value expected_simd256_op_code);
+  void TestSplatOp(const Operator* splat_op,
+                   MachineType splat_input_machine_type,
+                   const IrOpcode::Value expected_simd256_op_code);
+  void TestLoadSplat(LoadTransformation transform, const Operator* bin_op,
+                     LoadTransformation expected_transform);
+
   Graph* graph() { return &graph_; }
   CommonOperatorBuilder* common() { return &common_; }
   MachineOperatorBuilder* machine() { return &machine_; }
@@ -45,16 +57,15 @@ class RevecTest : public TestWithIsolateAndZone {
   MachineGraph mcgraph_;
 };
 
-// Create a graph which add two 256 bit vectors(a, b), store the result in c:
-// simd128 *a,*b,*c;
-// *c = *a + *b;
-// *(c+1) = *(a+1) + *(b+1);
+// Create a graph which perform binary operation on two 256 bit vectors(a, b),
+// store the result in c: simd128 *a,*b,*c; *c = *a bin_op *b;
+// *(c+1) = *(a+1) bin_op *(b+1);
 // In Revectorization, two simd 128 nodes can be combined into one 256 node:
 // simd256 *d, *e, *f;
-// *f = *d + *e;
-TEST_F(RevecTest, F32x8Add) {
+// *f = *d bin_op *e;
+void RevecTest::TestBinOp(const Operator* bin_op,
+                          const IrOpcode::Value expected_simd256_op_code) {
   if (!CpuFeatures::IsSupported(AVX2)) return;
-
   Node* start = graph()->NewNode(common()->Start(5));
   graph()->SetStart(start);
 
@@ -84,6 +95,135 @@ TEST_F(RevecTest, F32x8Add) {
                                  load2, start);
   Node* load4 = graph()->NewNode(machine()->ProtectedLoad(load_rep),
                                  mem_buffer2, p2, load3, start);
+  Node* bin_op1 = graph()->NewNode(bin_op, load1, load3);
+  Node* bin_op2 = graph()->NewNode(bin_op, load2, load4);
+  Node* store1 = graph()->NewNode(machine()->Store(store_rep), load0, p3,
+                                  bin_op1, load4, start);
+  Node* store2 = graph()->NewNode(machine()->Store(store_rep), mem_store, p3,
+                                  bin_op2, store1, start);
+  Node* ret = graph()->NewNode(common()->Return(0), zero, store2, start);
+  Node* end = graph()->NewNode(common()->End(1), ret);
+  graph()->SetEnd(end);
+
+  graph()->RecordSimdStore(store1);
+  graph()->RecordSimdStore(store2);
+  graph()->SetSimd(true);
+
+  // Test whether the graph can be revectorized
+  Revectorizer revec(zone(), graph(), mcgraph());
+  EXPECT_TRUE(revec.TryRevectorize(nullptr));
+
+  // Test whether the graph has been revectorized
+  Node* store_256 = ret->InputAt(1);
+  EXPECT_EQ(StoreRepresentationOf(store_256->op()).representation(),
+            MachineRepresentation::kSimd256);
+  EXPECT_EQ(store_256->InputAt(2)->opcode(), expected_simd256_op_code);
+}
+
+#define BIN_OP_LIST(V)     \
+  V(F64x2Add, F64x4Add)    \
+  V(F32x4Add, F32x8Add)    \
+  V(I64x2Add, I64x4Add)    \
+  V(I32x4Add, I32x8Add)    \
+  V(I16x8Add, I16x16Add)   \
+  V(I8x16Add, I8x32Add)    \
+  V(F64x2Sub, F64x4Sub)    \
+  V(F32x4Sub, F32x8Sub)    \
+  V(I64x2Sub, I64x4Sub)    \
+  V(I32x4Sub, I32x8Sub)    \
+  V(I16x8Sub, I16x16Sub)   \
+  V(I8x16Sub, I8x32Sub)    \
+  V(F64x2Mul, F64x4Mul)    \
+  V(F32x4Mul, F32x8Mul)    \
+  V(I64x2Mul, I64x4Mul)    \
+  V(I32x4Mul, I32x8Mul)    \
+  V(I16x8Mul, I16x16Mul)   \
+  V(F64x2Div, F64x4Div)    \
+  V(F32x4Div, F32x8Div)    \
+  V(F64x2Eq, F64x4Eq)      \
+  V(F32x4Eq, F32x8Eq)      \
+  V(I64x2Eq, I64x4Eq)      \
+  V(I32x4Eq, I32x8Eq)      \
+  V(I16x8Eq, I16x16Eq)     \
+  V(I8x16Eq, I8x32Eq)      \
+  V(F64x2Ne, F64x4Ne)      \
+  V(F32x4Ne, F32x8Ne)      \
+  V(I64x2GtS, I64x4GtS)    \
+  V(I32x4GtS, I32x8GtS)    \
+  V(I16x8GtS, I16x16GtS)   \
+  V(I8x16GtS, I8x32GtS)    \
+  V(F64x2Lt, F64x4Lt)      \
+  V(F32x4Lt, F32x8Lt)      \
+  V(F64x2Le, F64x4Le)      \
+  V(F32x4Le, F32x8Le)      \
+  V(I32x4MinS, I32x8MinS)  \
+  V(I16x8MinS, I16x16MinS) \
+  V(I8x16MinS, I8x32MinS)  \
+  V(I32x4MinU, I32x8MinU)  \
+  V(I16x8MinU, I16x16MinU) \
+  V(I8x16MinU, I8x32MinU)  \
+  V(I32x4MaxS, I32x8MaxS)  \
+  V(I16x8MaxS, I16x16MaxS) \
+  V(I8x16MaxS, I8x32MaxS)  \
+  V(I32x4MaxU, I32x8MaxU)  \
+  V(I16x8MaxU, I16x16MaxU) \
+  V(I8x16MaxU, I8x32MaxU)  \
+  V(F64x2Min, F64x4Min)    \
+  V(F64x2Max, F64x4Max)    \
+  V(F32x4Min, F32x8Min)    \
+  V(F32x4Max, F32x8Max)
+
+#define TEST_BIN_OP(op128, op256)                      \
+  TEST_F(RevecTest, op256) {                           \
+    TestBinOp(machine()->op128(), IrOpcode::k##op256); \
+  }
+
+BIN_OP_LIST(TEST_BIN_OP)
+
+#undef TEST_BIN_OP
+#undef BIN_OP_LIST
+
+// Create a graph with load chain that can not be packed due to effect
+// dependency:
+//   [Load4] -> [Load3] -> [Load2] -> [Irrelevant Load] -> [Load1]
+//
+// After reordering, no effect dependency will be broken so the graph can be
+// revectorized:
+//   [Load4] -> [Load3] -> [Load2] -> [Load1] -> [Irrelevant Load]
+TEST_F(RevecTest, ReorderLoadChain) {
+  if (!CpuFeatures::IsSupported(AVX2)) return;
+
+  Node* start = graph()->NewNode(common()->Start(5));
+  graph()->SetStart(start);
+
+  Node* zero = graph()->NewNode(common()->Int32Constant(0));
+  Node* sixteen = graph()->NewNode(common()->Int64Constant(16));
+  // offset of memory start field in WASM instance object.
+  Node* offset = graph()->NewNode(common()->Int64Constant(23));
+
+  Node* p0 = graph()->NewNode(common()->Parameter(0), start);
+  Node* p1 = graph()->NewNode(common()->Parameter(1), start);
+  Node* p2 = graph()->NewNode(common()->Parameter(2), start);
+  Node* p3 = graph()->NewNode(common()->Parameter(3), start);
+
+  StoreRepresentation store_rep(MachineRepresentation::kSimd128,
+                                WriteBarrierKind::kNoWriteBarrier);
+  LoadRepresentation load_rep(MachineType::Simd128());
+  Node* load0 = graph()->NewNode(machine()->Load(MachineType::Int64()), p0,
+                                 offset, start, start);
+  Node* mem_buffer1 = graph()->NewNode(machine()->Int64Add(), load0, sixteen);
+  Node* mem_buffer2 = graph()->NewNode(machine()->Int64Add(), load0, sixteen);
+  Node* mem_store = graph()->NewNode(machine()->Int64Add(), load0, sixteen);
+  Node* load1 = graph()->NewNode(machine()->ProtectedLoad(load_rep), load0, p1,
+                                 load0, start);
+  Node* irrelevant_load = graph()->NewNode(machine()->ProtectedLoad(load_rep),
+                                           mem_buffer1, p1, load1, start);
+  Node* load2 = graph()->NewNode(machine()->ProtectedLoad(load_rep),
+                                 mem_buffer1, p1, irrelevant_load, start);
+  Node* load3 = graph()->NewNode(machine()->ProtectedLoad(load_rep), load0, p2,
+                                 load2, start);
+  Node* load4 = graph()->NewNode(machine()->ProtectedLoad(load_rep),
+                                 mem_buffer2, p2, load3, start);
   Node* add1 = graph()->NewNode(machine()->F32x4Add(), load1, load3);
   Node* add2 = graph()->NewNode(machine()->F32x4Add(), load2, load4);
   Node* store1 = graph()->NewNode(machine()->Store(store_rep), load0, p3, add1,
@@ -101,23 +241,168 @@ TEST_F(RevecTest, F32x8Add) {
   // Test whether the graph can be revectorized
   Revectorizer revec(zone(), graph(), mcgraph());
   EXPECT_TRUE(revec.TryRevectorize(nullptr));
+}
 
-  // Test whether the graph has been revectorized
+// Test shift using an immediate and a value loaded from memory (b) on a 256-bit
+// vector a and store the result in another 256-bit vector c:
+//   simd128 *a, *c;
+//   int32 *b;
+//   *c = (*a shift_op 1) shift_op *b;
+//   *(c+1) = (*(a+1) shift_op 1) shift_op *b;
+// In Revectorization, two simd128 nodes can be coalesced into one simd256 node
+// as below:
+//   simd256 *a, *c; *c = (*a shift_op 1) shift_op *b;
+void RevecTest::TestShiftOp(const Operator* shift_op,
+                            const IrOpcode::Value expected_simd256_op_code) {
+  Node* start = graph()->NewNode(common()->Start(4));
+  graph()->SetStart(start);
+
+  Node* zero = graph()->NewNode(common()->Int32Constant(0));
+  Node* one = graph()->NewNode(common()->Int32Constant(1));
+  Node* sixteen = graph()->NewNode(common()->Int64Constant(16));
+  Node* offset = graph()->NewNode(common()->Int64Constant(23));
+
+  // Wasm array base address
+  Node* p0 = graph()->NewNode(common()->Parameter(0), start);
+  Node* a = graph()->NewNode(common()->Parameter(1), start);
+  Node* b = graph()->NewNode(common()->Parameter(2), start);
+  Node* c = graph()->NewNode(common()->Parameter(3), start);
+
+  LoadRepresentation load_rep(MachineType::Simd128());
+  StoreRepresentation store_rep(MachineRepresentation::kSimd128,
+                                WriteBarrierKind::kNoWriteBarrier);
+  Node* base = graph()->NewNode(machine()->Load(MachineType::Int64()), p0,
+                                offset, start, start);
+  Node* base16 = graph()->NewNode(machine()->Int64Add(), base, sixteen);
+  Node* load0 = graph()->NewNode(machine()->ProtectedLoad(load_rep), base, a,
+                                 base, start);
+  Node* load1 = graph()->NewNode(machine()->ProtectedLoad(load_rep), base16, a,
+                                 load0, start);
+  Node* shift0 = graph()->NewNode(shift_op, load0, one);
+  Node* shift1 = graph()->NewNode(shift_op, load1, one);
+  Node* load2 =
+      graph()->NewNode(machine()->ProtectedLoad(LoadRepresentation::Int32()),
+                       base, b, load1, start);
+  Node* store0 =
+      graph()->NewNode(machine()->Store(store_rep), base, c,
+                       graph()->NewNode(shift_op, shift0, load2), load2, start);
+  Node* store1 = graph()->NewNode(machine()->Store(store_rep), base16, c,
+                                  graph()->NewNode(shift_op, shift1, load2),
+                                  store0, start);
+  Node* ret = graph()->NewNode(common()->Return(0), zero, store1, start);
+  Node* end = graph()->NewNode(common()->End(1), ret);
+  graph()->SetEnd(end);
+
+  graph()->RecordSimdStore(store0);
+  graph()->RecordSimdStore(store1);
+  graph()->SetSimd(true);
+
+  Revectorizer revec(zone(), graph(), mcgraph());
+  bool result = revec.TryRevectorize(nullptr);
+
+  if (CpuFeatures::IsSupported(AVX2)) {
+    EXPECT_TRUE(result);
+    Node* store_256 = ret->InputAt(1);
+    EXPECT_EQ(StoreRepresentationOf(store_256->op()).representation(),
+              MachineRepresentation::kSimd256);
+    EXPECT_EQ(store_256->InputAt(2)->opcode(), expected_simd256_op_code);
+    return;
+  }
+
+  EXPECT_FALSE(result);
+}
+
+TEST_F(RevecTest, I64x4Shl) {
+  TestShiftOp(machine()->I64x2Shl(), IrOpcode::kI64x4Shl);
+}
+TEST_F(RevecTest, I32x8ShrS) {
+  TestShiftOp(machine()->I32x4Shl(), IrOpcode::kI32x8Shl);
+}
+TEST_F(RevecTest, I16x16ShrU) {
+  TestShiftOp(machine()->I16x8Shl(), IrOpcode::kI16x16Shl);
+}
+
+void RevecTest::TestSplatOp(const Operator* splat_op,
+                            MachineType splat_input_machine_type,
+                            const IrOpcode::Value expected_simd256_op_code) {
+  if (!CpuFeatures::IsSupported(AVX2)) {
+    return;
+  }
+  Node* start = graph()->NewNode(common()->Start(3));
+  graph()->SetStart(start);
+
+  Node* zero = graph()->NewNode(common()->Int32Constant(0));
+  Node* sixteen = graph()->NewNode(common()->Int64Constant(16));
+  Node* offset = graph()->NewNode(common()->Int64Constant(23));
+
+  Node* p0 = graph()->NewNode(common()->Parameter(0), start);
+  Node* p1 = graph()->NewNode(common()->Parameter(1), start);
+  Node* p2 = graph()->NewNode(common()->Parameter(2), start);
+
+  Node* base = graph()->NewNode(machine()->Load(MachineType::Uint64()), p0,
+                                offset, start, start);
+
+  Node* load =
+      graph()->NewNode(machine()->ProtectedLoad(splat_input_machine_type), base,
+                       p1, base, start);
+  Node* splat0 = graph()->NewNode(splat_op, load);
+  Node* splat1 = graph()->NewNode(splat_op, load);
+
+  StoreRepresentation store_rep(MachineRepresentation::kSimd128,
+                                WriteBarrierKind::kNoWriteBarrier);
+
+  Node* store0 = graph()->NewNode(machine()->Store(store_rep), base, p2, splat0,
+                                  load, start);
+  Node* store1 =
+      graph()->NewNode(machine()->Store(store_rep),
+                       graph()->NewNode(machine()->Int64Add(), base, sixteen),
+                       p2, splat1, store0, start);
+
+  Node* ret = graph()->NewNode(common()->Return(0), zero, store0, start);
+  Node* end = graph()->NewNode(common()->End(1), ret);
+  graph()->SetEnd(end);
+
+  graph()->RecordSimdStore(store0);
+  graph()->RecordSimdStore(store1);
+  graph()->SetSimd(true);
+
+  Revectorizer revec(zone(), graph(), mcgraph());
+  bool result = revec.TryRevectorize(nullptr);
+
+  EXPECT_TRUE(result);
   Node* store_256 = ret->InputAt(1);
   EXPECT_EQ(StoreRepresentationOf(store_256->op()).representation(),
             MachineRepresentation::kSimd256);
+  EXPECT_EQ(store_256->InputAt(2)->opcode(), expected_simd256_op_code);
+  return;
 }
 
-// Create a graph which multiplies a F32x8 vector with the first element of
-// vector b and store the result to a F32x8 vector c:
+#define SPLAT_OP_LIST(V)            \
+  V(I8x16Splat, I8x32Splat, Int8)   \
+  V(I16x8Splat, I16x16Splat, Int16) \
+  V(I32x4Splat, I32x8Splat, Int32)  \
+  V(I64x2Splat, I64x4Splat, Int64)
+
+#define TEST_SPLAT(op128, op256, machine_type)                   \
+  TEST_F(RevecTest, op256) {                                     \
+    TestSplatOp(machine()->op128(), MachineType::machine_type(), \
+                IrOpcode::k##op256);                             \
+  }
+
+SPLAT_OP_LIST(TEST_SPLAT)
+
+#undef TEST_SPLAT
+#undef SPLAT_OP_LIST
+
+// Create a graph which multiplies a F32x8 vector with a shuffle splat vector.
 //   float *a, *b, *c;
-//   c[0123] = a[0123] * b[0000];
-//   c[4567] = a[4567] * b[0000];
+//   c[0123] = a[0123] * b[1111];
+//   c[4567] = a[4567] * b[1111];
 //
 // After the revectorization phase, two consecutive 128-bit loads and multiplies
-// can be coalesced using 256-bit vectors:
-//   c[01234567] = a[01234567] * b[00000000];
-TEST_F(RevecTest, F32x8Mul) {
+// can be coalesced using 256-bit operators:
+//   c[01234567] = a[01234567] * b[11111111];
+TEST_F(RevecTest, ShuffleForSplat) {
   if (!CpuFeatures::IsSupported(AVX2)) return;
 
   Node* start = graph()->NewNode(common()->Start(4));
@@ -131,7 +416,7 @@ TEST_F(RevecTest, F32x8Mul) {
   Node* p0 = graph()->NewNode(common()->Parameter(0), start);
   // Load base address a*
   Node* p1 = graph()->NewNode(common()->Parameter(1), start);
-  // LoadTransfrom base address b*
+  // Load for shuffle base address b*
   Node* p2 = graph()->NewNode(common()->Parameter(2), start);
   // Store base address c*
   Node* p3 = graph()->NewNode(common()->Parameter(3), start);
@@ -141,20 +426,23 @@ TEST_F(RevecTest, F32x8Mul) {
                                 WriteBarrierKind::kNoWriteBarrier);
   Node* base = graph()->NewNode(machine()->Load(MachineType::Int64()), p0,
                                 offset, start, start);
-  Node* base16 = graph()->NewNode(machine()->Int64Add(), base, sixteen);
-  Node* base16_store = graph()->NewNode(machine()->Int64Add(), base, sixteen);
   Node* load0 = graph()->NewNode(machine()->ProtectedLoad(load_rep), base, p1,
                                  base, start);
+  Node* base16 = graph()->NewNode(machine()->Int64Add(), base, sixteen);
   Node* load1 = graph()->NewNode(machine()->ProtectedLoad(load_rep), base16, p1,
                                  load0, start);
-  Node* load2 = graph()->NewNode(
-      machine()->LoadTransform(MemoryAccessKind::kProtected,
-                               LoadTransformation::kS128Load32Splat),
-      base, p2, load1, start);
-  Node* mul0 = graph()->NewNode(machine()->F32x4Mul(), load0, load2);
-  Node* mul1 = graph()->NewNode(machine()->F32x4Mul(), load1, load2);
+
+  // Load and shuffle for splat
+  Node* load2 = graph()->NewNode(machine()->ProtectedLoad(load_rep), base, p2,
+                                 load1, start);
+  const uint8_t mask[16] = {4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7};
+  Node* shuffle = graph()->NewNode(machine()->I8x16Shuffle(mask), load2, load2);
+
+  Node* mul0 = graph()->NewNode(machine()->F32x4Mul(), load0, shuffle);
+  Node* mul1 = graph()->NewNode(machine()->F32x4Mul(), load1, shuffle);
   Node* store0 = graph()->NewNode(machine()->Store(store_rep), base, p3, mul0,
                                   load2, start);
+  Node* base16_store = graph()->NewNode(machine()->Int64Add(), base, sixteen);
   Node* store1 = graph()->NewNode(machine()->Store(store_rep), base16_store, p3,
                                   mul1, store0, start);
   Node* ret = graph()->NewNode(common()->Return(0), zero, store1, start);
@@ -174,14 +462,81 @@ TEST_F(RevecTest, F32x8Mul) {
             MachineRepresentation::kSimd256);
 }
 
-// Create a graph with load chain that can not be packed due to effect
-// dependency:
-//   [Load4] -> [Load3] -> [Load2] -> [Irrelevant Load] -> [Load1]
-//
-// After reordering, no effect dependency will be broken so the graph can be
-// revectorized:
-//   [Load4] -> [Load3] -> [Load2] -> [Load1] -> [Irrelevant Load]
-TEST_F(RevecTest, ReorderLoadChain) {
+void RevecTest::TestLoadSplat(
+    const LoadTransformation load_transform, const Operator* bin_op,
+    const LoadTransformation expected_load_transform) {
+  if (!CpuFeatures::IsSupported(AVX2)) {
+    return;
+  }
+  Node* start = graph()->NewNode(common()->Start(3));
+  graph()->SetStart(start);
+
+  Node* zero = graph()->NewNode(common()->Int32Constant(0));
+  Node* sixteen = graph()->NewNode(common()->Int64Constant(16));
+  Node* offset = graph()->NewNode(common()->Int64Constant(23));
+
+  Node* p0 = graph()->NewNode(common()->Parameter(0), start);
+  Node* a = graph()->NewNode(common()->Parameter(1), start);
+  Node* b = graph()->NewNode(common()->Parameter(2), start);
+  Node* c = graph()->NewNode(common()->Parameter(3), start);
+
+  Node* base = graph()->NewNode(machine()->Load(MachineType::Uint64()), p0,
+                                offset, start, start);
+
+  Node* loadSplat = graph()->NewNode(
+      machine()->LoadTransform(MemoryAccessKind::kProtected, load_transform),
+      base, a, base, start);
+
+  LoadRepresentation load_rep(MachineType::Simd128());
+  Node* load0 = graph()->NewNode(machine()->ProtectedLoad(load_rep), base, b,
+                                 loadSplat, start);
+  Node* load1 = graph()->NewNode(
+      machine()->ProtectedLoad(load_rep),
+      graph()->NewNode(machine()->Int64Add(), base, sixteen), b, load0, start);
+
+  StoreRepresentation store_rep(MachineRepresentation::kSimd128,
+                                WriteBarrierKind::kNoWriteBarrier);
+  Node* store0 = graph()->NewNode(machine()->Store(store_rep), base, c,
+                                  graph()->NewNode(bin_op, load0, loadSplat),
+                                  load1, start);
+  Node* store1 = graph()->NewNode(
+      machine()->Store(store_rep),
+      graph()->NewNode(machine()->Int64Add(), base, sixteen), c,
+      graph()->NewNode(bin_op, load1, loadSplat), store0, start);
+
+  Node* ret = graph()->NewNode(common()->Return(0), zero, store0, start);
+  Node* end = graph()->NewNode(common()->End(1), ret);
+  graph()->SetEnd(end);
+
+  graph()->RecordSimdStore(store0);
+  graph()->RecordSimdStore(store1);
+  graph()->SetSimd(true);
+
+  Revectorizer revec(zone(), graph(), mcgraph());
+  bool result = revec.TryRevectorize(nullptr);
+
+  EXPECT_TRUE(result);
+  Node* store_256 = ret->InputAt(1);
+  EXPECT_EQ(StoreRepresentationOf(store_256->op()).representation(),
+            MachineRepresentation::kSimd256);
+  EXPECT_EQ(LoadTransformParametersOf(store_256->InputAt(2)->InputAt(1)->op())
+                .transformation,
+            expected_load_transform);
+}
+
+TEST_F(RevecTest, Load8Splat) {
+  TestLoadSplat(LoadTransformation::kS128Load8Splat, machine()->I8x16Add(),
+                LoadTransformation::kS256Load8Splat);
+}
+TEST_F(RevecTest, Load64Splat) {
+  TestLoadSplat(LoadTransformation::kS128Load64Splat, machine()->I64x2Add(),
+                LoadTransformation::kS256Load64Splat);
+}
+
+// Create a graph with Store nodes that can not be packed due to effect
+// intermediate:
+//   [Store0] -> [Load] -> [Store1]
+TEST_F(RevecTest, StoreDependencyCheck) {
   if (!CpuFeatures::IsSupported(AVX2)) return;
 
   Node* start = graph()->NewNode(common()->Start(5));
@@ -207,10 +562,8 @@ TEST_F(RevecTest, ReorderLoadChain) {
   Node* mem_store = graph()->NewNode(machine()->Int64Add(), load0, sixteen);
   Node* load1 = graph()->NewNode(machine()->ProtectedLoad(load_rep), load0, p1,
                                  load0, start);
-  Node* irrelevant_load = graph()->NewNode(machine()->ProtectedLoad(load_rep),
-                                           mem_buffer1, p1, load1, start);
   Node* load2 = graph()->NewNode(machine()->ProtectedLoad(load_rep),
-                                 mem_buffer1, p1, irrelevant_load, start);
+                                 mem_buffer1, p1, load1, start);
   Node* load3 = graph()->NewNode(machine()->ProtectedLoad(load_rep), load0, p2,
                                  load2, start);
   Node* load4 = graph()->NewNode(machine()->ProtectedLoad(load_rep),
@@ -219,8 +572,10 @@ TEST_F(RevecTest, ReorderLoadChain) {
   Node* add2 = graph()->NewNode(machine()->F32x4Add(), load2, load4);
   Node* store1 = graph()->NewNode(machine()->Store(store_rep), load0, p3, add1,
                                   load4, start);
+  Node* effect_intermediate = graph()->NewNode(
+      machine()->ProtectedLoad(load_rep), mem_buffer2, p2, store1, start);
   Node* store2 = graph()->NewNode(machine()->Store(store_rep), mem_store, p3,
-                                  add2, store1, start);
+                                  add2, effect_intermediate, start);
   Node* ret = graph()->NewNode(common()->Return(0), zero, store2, start);
   Node* end = graph()->NewNode(common()->End(1), ret);
   graph()->SetEnd(end);
@@ -229,6 +584,43 @@ TEST_F(RevecTest, ReorderLoadChain) {
   graph()->RecordSimdStore(store2);
   graph()->SetSimd(true);
 
+  // Test whether the graph can be revectorized
+  Revectorizer revec(zone(), graph(), mcgraph());
+  EXPECT_FALSE(revec.TryRevectorize(nullptr));
+}
+
+TEST_F(RevecTest, S128Zero) {
+  if (!CpuFeatures::IsSupported(AVX) || !CpuFeatures::IsSupported(AVX2)) return;
+
+  Node* start = graph()->NewNode(common()->Start(5));
+  graph()->SetStart(start);
+
+  Node* control = graph()->start();
+  Node* zero = graph()->NewNode(common()->Int32Constant(0));
+  Node* sixteen = graph()->NewNode(common()->Int64Constant(16));
+  Node* zero128 = graph()->NewNode(machine()->S128Zero());
+  // offset of memory start field in WASM instance object.
+  Node* offset = graph()->NewNode(common()->Int64Constant(23));
+
+  Node* p0 = graph()->NewNode(common()->Parameter(0), start);
+  Node* p1 = graph()->NewNode(common()->Parameter(1), start);
+  Node* base = graph()->NewNode(machine()->Load(MachineType::Uint64()), p0,
+                                offset, start, control);
+  StoreRepresentation store_rep(MachineRepresentation::kSimd128,
+                                WriteBarrierKind::kNoWriteBarrier);
+  Node* store1 = graph()->NewNode(machine()->Store(store_rep), base, p1,
+                                  zero128, base, control);
+  Node* object = graph()->NewNode(machine()->Int64Add(), base, sixteen);
+  Node* store2 = graph()->NewNode(machine()->Store(store_rep), object, p1,
+                                  zero128, store1, control);
+  Node* ret = graph()->NewNode(common()->Return(0), zero, store2, control);
+  Node* end = graph()->NewNode(common()->End(1), ret);
+  graph()->SetEnd(end);
+
+  graph()->RecordSimdStore(store1);
+  graph()->RecordSimdStore(store2);
+  graph()->SetSimd(true);
+
   // Test whether the graph can be revectorized
   Revectorizer revec(zone(), graph(), mcgraph());
   EXPECT_TRUE(revec.TryRevectorize(nullptr));
diff --git a/deps/v8/test/unittests/compiler/riscv64/instruction-selector-riscv64-unittest.cc b/deps/v8/test/unittests/compiler/riscv64/instruction-selector-riscv64-unittest.cc
index 13de26ab4b75aa..bd6e3da6040fb2 100644
--- a/deps/v8/test/unittests/compiler/riscv64/instruction-selector-riscv64-unittest.cc
+++ b/deps/v8/test/unittests/compiler/riscv64/instruction-selector-riscv64-unittest.cc
@@ -183,28 +183,28 @@ const IntCmp kCmpInstructions[] = {
      1U},
     {{&RawMachineAssembler::Word32Equal, "Word32Equal", kRiscvCmp,
       MachineType::Int32()},
-     1U},
+     COMPRESS_POINTERS_BOOL ? 3U : 1U},
     {{&RawMachineAssembler::Word32NotEqual, "Word32NotEqual", kRiscvCmp,
       MachineType::Int32()},
-     1U},
+     COMPRESS_POINTERS_BOOL ? 3U : 1U},
     {{&RawMachineAssembler::Int32LessThan, "Int32LessThan", kRiscvCmp,
       MachineType::Int32()},
-     1U},
+     COMPRESS_POINTERS_BOOL ? 3U : 1U},
     {{&RawMachineAssembler::Int32LessThanOrEqual, "Int32LessThanOrEqual",
       kRiscvCmp, MachineType::Int32()},
-     1U},
+     COMPRESS_POINTERS_BOOL ? 3U : 1U},
     {{&RawMachineAssembler::Int32GreaterThan, "Int32GreaterThan", kRiscvCmp,
       MachineType::Int32()},
-     1U},
+     COMPRESS_POINTERS_BOOL ? 3U : 1U},
     {{&RawMachineAssembler::Int32GreaterThanOrEqual, "Int32GreaterThanOrEqual",
       kRiscvCmp, MachineType::Int32()},
-     1U},
+     COMPRESS_POINTERS_BOOL ? 3U : 1U},
     {{&RawMachineAssembler::Uint32LessThan, "Uint32LessThan", kRiscvCmp,
       MachineType::Uint32()},
-     1U},
+     COMPRESS_POINTERS_BOOL ? 3U : 1U},
     {{&RawMachineAssembler::Uint32LessThanOrEqual, "Uint32LessThanOrEqual",
       kRiscvCmp, MachineType::Uint32()},
-     1U}};
+     COMPRESS_POINTERS_BOOL ? 3U : 1U}};
 
 // ----------------------------------------------------------------------------
 // Conversion instructions.
@@ -312,7 +312,7 @@ TEST_P(InstructionSelectorCmpTest, Parameter) {
   StreamBuilder m(this, type, type, type);
   m.Return((m.*cmp.mi.constructor)(m.Parameter(0), m.Parameter(1)));
   Stream s = m.Build();
-
+  std::cout << type.representation() << std::endl;
   if (v8_flags.debug_code &&
       type.representation() == MachineRepresentation::kWord32) {
 #ifndef V8_COMPRESS_POINTERS
@@ -358,7 +358,7 @@ TEST_P(InstructionSelectorCmpTest, Parameter) {
 #endif
   } else {
     ASSERT_EQ(cmp.expected_size, s.size());
-    EXPECT_EQ(cmp.mi.arch_opcode, s[0]->arch_opcode());
+    EXPECT_EQ(cmp.mi.arch_opcode, s[cmp.expected_size - 1]->arch_opcode());
     EXPECT_EQ(2U, s[0]->InputCount());
     EXPECT_EQ(1U, s[0]->OutputCount());
   }
@@ -1000,7 +1000,7 @@ TEST_F(InstructionSelectorTest, ChangeUint32ToUint64AfterLoad) {
     EXPECT_EQ(kMode_None, s[0]->addressing_mode());
     EXPECT_EQ(2U, s[0]->InputCount());
     EXPECT_EQ(1U, s[0]->OutputCount());
-    EXPECT_EQ(kRiscvLw, s[1]->arch_opcode());
+    EXPECT_EQ(kRiscvLwu, s[1]->arch_opcode());
     EXPECT_EQ(kMode_MRI, s[1]->addressing_mode());
     EXPECT_EQ(kRiscvZeroExtendWord, s[2]->arch_opcode());
     EXPECT_EQ(2U, s[1]->InputCount());
diff --git a/deps/v8/test/unittests/compiler/run-bytecode-graph-builder-unittest.cc b/deps/v8/test/unittests/compiler/run-bytecode-graph-builder-unittest.cc
index 8b3befc48c85b9..a745b94366fb29 100644
--- a/deps/v8/test/unittests/compiler/run-bytecode-graph-builder-unittest.cc
+++ b/deps/v8/test/unittests/compiler/run-bytecode-graph-builder-unittest.cc
@@ -136,20 +136,15 @@ class BytecodeGraphTester {
     Handle<JSFunction> function =
         Handle<JSFunction>::cast(v8::Utils::OpenHandle(*api_function));
     IsCompiledScope is_compiled_scope(
-        function->shared().is_compiled_scope(isolate_));
+        function->shared()->is_compiled_scope(isolate_));
     JSFunction::EnsureFeedbackVector(isolate_, function, &is_compiled_scope);
-    CHECK(function->shared().HasBytecodeArray());
+    CHECK(function->shared()->HasBytecodeArray());
 
     Zone zone(isolate_->allocator(), ZONE_NAME);
     Handle<SharedFunctionInfo> shared(function->shared(), isolate_);
     OptimizedCompilationInfo compilation_info(&zone, isolate_, shared, function,
                                               CodeKind::TURBOFAN);
 
-    // Compiler relies on canonicalized handles, let's create
-    // a canonicalized scope and migrate existing handles there.
-    CanonicalHandleScope canonical(isolate_);
-    compilation_info.ReopenHandlesInNewHandleScope(isolate_);
-
     Handle<Code> code =
         Pipeline::GenerateCodeForTesting(&compilation_info, isolate_)
             .ToHandleChecked();
@@ -238,7 +233,7 @@ class RunBytecodeGraphBuilderTest : public TestWithNativeContext {
       auto callable = tester.GetCallable<Handle<Object>>();
       Handle<Object> return_value =
           callable(snippets[i].parameter(0)).ToHandleChecked();
-      CHECK(return_value->SameValue(*snippets[i].return_value()));
+      CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
     }
   }
 
@@ -285,7 +280,7 @@ class RunBytecodeGraphBuilderTest : public TestWithNativeContext {
       auto callable = tester.GetCallable<Handle<Object>>();
       Handle<Object> return_value =
           callable(snippets[i].parameter(0)).ToHandleChecked();
-      CHECK(return_value->SameValue(*snippets[i].return_value()));
+      CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
     }
   }
 
@@ -333,7 +328,7 @@ class RunBytecodeGraphBuilderTest : public TestWithNativeContext {
       BytecodeGraphTester tester(isolate, snippets[i].code_snippet);
       auto callable = tester.GetCallable<>();
       Handle<Object> return_value = callable().ToHandleChecked();
-      CHECK(return_value->SameValue(*snippets[i].return_value()));
+      CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
     }
   }
 
@@ -371,7 +366,7 @@ class RunBytecodeGraphBuilderTest : public TestWithNativeContext {
         Handle<Object> return_val =
             callable(factory->NewNumberFromInt(a)).ToHandleChecked();
         static const int results[] = {11, 12, 2};
-        CHECK_EQ(Handle<Smi>::cast(return_val)->value(), results[a]);
+        CHECK_EQ(Smi::cast(*return_val).value(), results[a]);
       }
     }
   }
@@ -406,7 +401,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderReturnStatements) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -430,7 +425,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderPrimitiveExpressions) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -485,7 +480,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderTwoParameterTests) {
     Handle<Object> return_value =
         callable(snippets[i].parameter(0), snippets[i].parameter(1))
             .ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -517,7 +512,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderNamedLoad) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -563,7 +558,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderKeyedLoad) {
     Handle<Object> return_value =
         callable(snippets[i].parameter(0), snippets[i].parameter(1))
             .ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -595,7 +590,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderPropertyCall) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -630,7 +625,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCallNew) {
     BytecodeGraphTester tester(isolate, snippets[i].code_snippet);
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -665,7 +660,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCreateClosure) {
     BytecodeGraphTester tester(isolate, snippets[i].code_snippet);
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -687,7 +682,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCallRuntime) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -734,7 +729,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderToName) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -760,7 +755,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderLogicalNot) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -787,7 +782,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderTypeOf) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -829,7 +824,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCompareTypeOf) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -875,7 +870,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCountOperation) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -906,7 +901,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderDelete) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -955,7 +950,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderDeleteGlobal) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -991,7 +986,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderDeleteLookupSlot) {
     BytecodeGraphTester tester(isolate, script.begin(), "t");
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1030,7 +1025,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderLookupSlot) {
     BytecodeGraphTester tester(isolate, script.begin(), "t");
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1056,7 +1051,8 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderLookupContextSlot) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*inner_eval_snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value,
+                            *inner_eval_snippets[i].return_value()));
   }
 
   // Testing with eval called in a parent context.
@@ -1078,7 +1074,8 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderLookupContextSlot) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*outer_eval_snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value,
+                            *outer_eval_snippets[i].return_value()));
   }
 }
 
@@ -1104,7 +1101,8 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderLookupGlobalSlot) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*inner_eval_snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value,
+                            *inner_eval_snippets[i].return_value()));
   }
 
   // Testing with eval called in a parent context.
@@ -1126,7 +1124,8 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderLookupGlobalSlot) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*outer_eval_snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value,
+                            *outer_eval_snippets[i].return_value()));
   }
 }
 
@@ -1166,7 +1165,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderLookupSlotWide) {
     BytecodeGraphTester tester(isolate, script.begin(), "t");
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1192,7 +1191,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCallLookupSlot) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1238,7 +1237,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderEval) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1264,7 +1263,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderEvalParams) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1287,7 +1286,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderEvalGlobal) {
     BytecodeGraphTester tester(isolate, snippets[i].code_snippet);
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1299,9 +1298,9 @@ bool get_compare_result(Isolate* isolate, Token::Value opcode,
     case Token::Value::NE:
       return !Object::Equals(isolate, lhs_value, rhs_value).FromJust();
     case Token::Value::EQ_STRICT:
-      return lhs_value->StrictEquals(*rhs_value);
+      return Object::StrictEquals(*lhs_value, *rhs_value);
     case Token::Value::NE_STRICT:
-      return !lhs_value->StrictEquals(*rhs_value);
+      return !Object::StrictEquals(*lhs_value, *rhs_value);
     case Token::Value::LT:
       return Object::LessThan(isolate, lhs_value, rhs_value).FromJust();
     case Token::Value::LTE:
@@ -1365,7 +1364,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCompare) {
             callable(lhs_values[j], rhs_values[k]).ToHandleChecked();
         bool result = get_compare_result(isolate, kCompareOperators[i],
                                          lhs_values[j], rhs_values[k]);
-        CHECK(return_value->SameValue(*factory->ToBoolean(result)));
+        CHECK(Object::SameValue(*return_value, *factory->ToBoolean(result)));
       }
     }
   }
@@ -1407,7 +1406,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderTestIn) {
     Handle<Object> return_value =
         callable(snippets[i].parameter(0), snippets[i].parameter(1))
             .ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1435,7 +1434,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderTestInstanceOf) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1462,7 +1461,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderTryCatch) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1498,7 +1497,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderTryFinally1) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1604,7 +1603,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderContext) {
     BytecodeGraphTester tester(isolate, script.begin(), "f");
     auto callable = tester.GetCallable<>("f");
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1667,7 +1666,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderLoadContext) {
     auto callable = tester.GetCallable<Handle<Object>>("f");
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1696,7 +1695,7 @@ TEST_F(RunBytecodeGraphBuilderTest,
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1740,7 +1739,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCreateArguments) {
         callable(snippets[i].parameter(0), snippets[i].parameter(1),
                  snippets[i].parameter(2))
             .ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1781,7 +1780,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderCreateRestArguments) {
         callable(snippets[i].parameter(0), snippets[i].parameter(1),
                  snippets[i].parameter(2))
             .ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1809,7 +1808,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderRegExpLiterals) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1844,7 +1843,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderArrayLiterals) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -1901,7 +1900,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderObjectLiterals) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2008,7 +2007,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderIf) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2036,7 +2035,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderConditionalOperator) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2081,7 +2080,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderSwitch) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2128,7 +2127,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderSwitchMerge) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> return_value =
         callable(snippets[i].parameter(0)).ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2186,7 +2185,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderNestedSwitch) {
     Handle<Object> return_value =
         callable(snippets[i].parameter(0), snippets[i].parameter(1))
             .ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2224,7 +2223,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderBreakableBlocks) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2270,7 +2269,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderWhile) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2316,7 +2315,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderDo) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2407,7 +2406,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderFor) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2476,7 +2475,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderForIn) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2565,7 +2564,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderForOf) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2602,7 +2601,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderWithStatement) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2647,7 +2646,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderConstDeclaration) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 
   // Tests for strict mode.
@@ -2659,7 +2658,7 @@ TEST_F(RunBytecodeGraphBuilderTest, BytecodeGraphBuilderConstDeclaration) {
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2688,7 +2687,7 @@ TEST_F(RunBytecodeGraphBuilderTest,
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 
   // Tests for strict mode.
@@ -2700,7 +2699,7 @@ TEST_F(RunBytecodeGraphBuilderTest,
     BytecodeGraphTester tester(isolate, script.begin());
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*snippets[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *snippets[i].return_value()));
   }
 }
 
@@ -2747,7 +2746,7 @@ TEST_F(RunBytecodeGraphBuilderTest,
     BytecodeGraphTester tester(isolate, script.begin(), "*");
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*const_decl[i].return_value()));
+    CHECK(Object::SameValue(*return_value, *const_decl[i].return_value()));
   }
 }
 
diff --git a/deps/v8/test/unittests/compiler/run-deopt-unittest.cc b/deps/v8/test/unittests/compiler/run-deopt-unittest.cc
index d2dd46efc4841b..803f2b771158d7 100644
--- a/deps/v8/test/unittests/compiler/run-deopt-unittest.cc
+++ b/deps/v8/test/unittests/compiler/run-deopt-unittest.cc
@@ -11,11 +11,12 @@ namespace v8 {
 namespace internal {
 namespace compiler {
 
-static void IsOptimized(const v8::FunctionCallbackInfo<v8::Value>& args) {
+static void IsOptimized(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   JavaScriptStackFrameIterator it(
-      reinterpret_cast<Isolate*>(args.GetIsolate()));
+      reinterpret_cast<Isolate*>(info.GetIsolate()));
   JavaScriptFrame* frame = it.frame();
-  return args.GetReturnValue().Set(frame->is_turbofan());
+  return info.GetReturnValue().Set(frame->is_turbofan());
 }
 
 class RunDeoptTest : public TestWithContext {
diff --git a/deps/v8/test/unittests/compiler/run-jscalls-unittest.cc b/deps/v8/test/unittests/compiler/run-jscalls-unittest.cc
index b651e8e640e52b..84a10af22b9649 100644
--- a/deps/v8/test/unittests/compiler/run-jscalls-unittest.cc
+++ b/deps/v8/test/unittests/compiler/run-jscalls-unittest.cc
@@ -152,8 +152,7 @@ TEST_F(RunJSCallsTest, RuntimeCall) {
 
 TEST_F(RunJSCallsTest, EvalCall) {
   FunctionTester T(i_isolate(), "(function(a,b) { return eval(a); })");
-  Handle<JSObject> g(T.function->context().global_object().global_proxy(),
-                     T.isolate);
+  Handle<JSObject> g(T.function->context()->global_proxy(), T.isolate);
 
   T.CheckCall(T.NewNumber(23), T.NewString("17 + 6"), T.undefined());
   T.CheckCall(T.NewString("'Y'; a"), T.NewString("'Y'; a"),
@@ -178,8 +177,7 @@ TEST_F(RunJSCallsTest, ReceiverPatching) {
   // patches an undefined receiver to the global receiver. If this starts to
   // fail once we fix the calling protocol, just remove this test.
   FunctionTester T(i_isolate(), "(function(a) { return this; })");
-  Handle<JSObject> g(T.function->context().global_object().global_proxy(),
-                     T.isolate);
+  Handle<JSObject> g(T.function->context()->global_proxy(), T.isolate);
   T.CheckCall(g, T.undefined());
 }
 
diff --git a/deps/v8/test/unittests/compiler/run-jsobjects-unittest.cc b/deps/v8/test/unittests/compiler/run-jsobjects-unittest.cc
index 93399ae2145bde..11844512bf5ea2 100644
--- a/deps/v8/test/unittests/compiler/run-jsobjects-unittest.cc
+++ b/deps/v8/test/unittests/compiler/run-jsobjects-unittest.cc
@@ -20,12 +20,12 @@ TEST_F(RunJSObjectsTest, ArgumentsMapped) {
   Handle<Object> arguments =
       T.Call(T.NewNumber(19), T.NewNumber(23), T.NewNumber(42), T.NewNumber(65))
           .ToHandleChecked();
-  CHECK(arguments->IsJSObject() && !arguments->IsJSArray());
-  CHECK(JSObject::cast(*arguments).HasSloppyArgumentsElements());
+  CHECK(IsJSObject(*arguments) && !IsJSArray(*arguments));
+  CHECK(JSObject::cast(*arguments)->HasSloppyArgumentsElements());
   Handle<String> l = T.isolate->factory()->length_string();
   Handle<Object> length =
       Object::GetProperty(T.isolate, arguments, l).ToHandleChecked();
-  CHECK_EQ(4, length->Number());
+  CHECK_EQ(4, Object::Number(*length));
 }
 
 TEST_F(RunJSObjectsTest, ArgumentsUnmapped) {
@@ -35,12 +35,12 @@ TEST_F(RunJSObjectsTest, ArgumentsUnmapped) {
   Handle<Object> arguments =
       T.Call(T.NewNumber(19), T.NewNumber(23), T.NewNumber(42), T.NewNumber(65))
           .ToHandleChecked();
-  CHECK(arguments->IsJSObject() && !arguments->IsJSArray());
-  CHECK(!JSObject::cast(*arguments).HasSloppyArgumentsElements());
+  CHECK(IsJSObject(*arguments) && !IsJSArray(*arguments));
+  CHECK(!JSObject::cast(*arguments)->HasSloppyArgumentsElements());
   Handle<String> l = T.isolate->factory()->length_string();
   Handle<Object> length =
       Object::GetProperty(T.isolate, arguments, l).ToHandleChecked();
-  CHECK_EQ(4, length->Number());
+  CHECK_EQ(4, Object::Number(*length));
 }
 
 TEST_F(RunJSObjectsTest, ArgumentsRest) {
@@ -49,12 +49,12 @@ TEST_F(RunJSObjectsTest, ArgumentsRest) {
   Handle<Object> arguments =
       T.Call(T.NewNumber(19), T.NewNumber(23), T.NewNumber(42), T.NewNumber(65))
           .ToHandleChecked();
-  CHECK(arguments->IsJSObject() && arguments->IsJSArray());
-  CHECK(!JSObject::cast(*arguments).HasSloppyArgumentsElements());
+  CHECK(IsJSObject(*arguments) && IsJSArray(*arguments));
+  CHECK(!JSObject::cast(*arguments)->HasSloppyArgumentsElements());
   Handle<String> l = T.isolate->factory()->length_string();
   Handle<Object> length =
       Object::GetProperty(T.isolate, arguments, l).ToHandleChecked();
-  CHECK_EQ(3, length->Number());
+  CHECK_EQ(3, Object::Number(*length));
 }
 
 }  // namespace compiler
diff --git a/deps/v8/test/unittests/compiler/run-tail-calls-unittest.cc b/deps/v8/test/unittests/compiler/run-tail-calls-unittest.cc
index 930bd4b38714d0..fface9460e12a0 100644
--- a/deps/v8/test/unittests/compiler/run-tail-calls-unittest.cc
+++ b/deps/v8/test/unittests/compiler/run-tail-calls-unittest.cc
@@ -114,7 +114,6 @@ class RunTailCallsTest : public TestWithContextAndZone {
   // parameters. All parameters are pointer-sized.
   void TestHelper(int n, int m) {
     Isolate* isolate = i_isolate();
-    CanonicalHandleScope canonical(isolate);
     CallDescriptor* caller_descriptor =
         CreateDescriptorForStackArguments(zone(), n);
     CallDescriptor* callee_descriptor =
@@ -125,7 +124,7 @@ class RunTailCallsTest : public TestWithContextAndZone {
     Handle<Object> result = ft.Call().ToHandleChecked();
     int expected = 0;
     for (int i = 0; i < m; ++i) expected += (i + 1) * i;
-    CHECK_EQ(expected, Handle<Smi>::cast(result)->value());
+    CHECK_EQ(expected, Smi::cast(*result).value());
   }
 };
 
diff --git a/deps/v8/test/unittests/compiler/turboshaft/doubly-threaded-list-unittest.cc b/deps/v8/test/unittests/compiler/turboshaft/doubly-threaded-list-unittest.cc
new file mode 100644
index 00000000000000..05ff730bc33c68
--- /dev/null
+++ b/deps/v8/test/unittests/compiler/turboshaft/doubly-threaded-list-unittest.cc
@@ -0,0 +1,159 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/turboshaft/doubly-threaded-list.h"
+
+#include "src/base/optional.h"
+#include "src/base/vector.h"
+#include "test/unittests/test-utils.h"
+
+namespace v8::internal::compiler::turboshaft {
+
+class DoublyThreadedListTest : public TestWithPlatform {};
+
+TEST_F(DoublyThreadedListTest, BasicTest) {
+  AccountingAllocator allocator;
+  Zone zone(&allocator, ZONE_NAME);
+
+  struct Elem {
+    int val;
+    bool operator==(const Elem& other) const {
+      return val == other.val && prev_ == other.prev_ && next_ == other.next_;
+    }
+
+    Elem** prev_;
+    Elem* next_;
+
+    // Defining getters required by the default DoublyThreadedListTraits.
+    Elem*** prev() { return &prev_; }
+    Elem** next() { return &next_; }
+  };
+
+  DoublyThreadedList<Elem*> list;
+  Elem e1{1, nullptr, nullptr};
+  Elem e2{1, nullptr, nullptr};
+  Elem e3{1, nullptr, nullptr};
+  Elem e4{1, nullptr, nullptr};
+
+  list.Add(&e1);
+  EXPECT_EQ(**(list.begin()), e1);
+
+  list.Add(&e2);
+  list.Add(&e3);
+  list.Add(&e4);
+  EXPECT_EQ(**(list.begin()), e4);
+  EXPECT_EQ(*e4.next_, e3);
+  EXPECT_EQ(*e3.next_, e2);
+  EXPECT_EQ(*e2.next_, e1);
+  EXPECT_EQ(e1.next_, nullptr);
+  EXPECT_EQ(*e1.prev_, &e1);
+  EXPECT_EQ(*e2.prev_, &e2);
+  EXPECT_EQ(*e3.prev_, &e3);
+  EXPECT_EQ(*e4.prev_, &e4);
+
+  // Removing front
+  list.Remove(&e4);
+  EXPECT_EQ(**(list.begin()), e3);
+  EXPECT_EQ(*e3.prev_, &e3);
+  EXPECT_EQ(e4.next_, nullptr);
+  EXPECT_EQ(e4.prev_, nullptr);
+
+  // Removing middle
+  list.Remove(&e2);
+  EXPECT_EQ(*e3.next_, e1);
+  EXPECT_EQ(e2.prev_, nullptr);
+  EXPECT_EQ(e2.next_, nullptr);
+  EXPECT_EQ(e1.prev_, &e3.next_);
+  EXPECT_EQ(*e1.prev_, &e1);
+
+  // Removing back
+  list.Remove(&e1);
+  EXPECT_EQ(e3.next_, nullptr);
+  EXPECT_EQ(e1.prev_, nullptr);
+  EXPECT_EQ(e1.next_, nullptr);
+  EXPECT_EQ(**(list.begin()), e3);
+
+  // Removing only item
+  list.Remove(&e3);
+  EXPECT_EQ(e3.prev_, nullptr);
+  EXPECT_EQ(e3.next_, nullptr);
+  EXPECT_TRUE(list.empty());
+}
+
+TEST_F(DoublyThreadedListTest, IteratorTest) {
+  AccountingAllocator allocator;
+  Zone zone(&allocator, ZONE_NAME);
+
+  struct Elem {
+    int val;
+    bool operator==(const Elem& other) const {
+      return val == other.val && prev_ == other.prev_ && next_ == other.next_;
+    }
+
+    Elem** prev_;
+    Elem* next_;
+
+    // Defining getters required by the default DoublyThreadedListTraits.
+    Elem*** prev() { return &prev_; }
+    Elem** next() { return &next_; }
+  };
+
+  DoublyThreadedList<Elem*> list;
+  Elem e1{1, nullptr, nullptr};
+  Elem e2{1, nullptr, nullptr};
+  Elem e3{1, nullptr, nullptr};
+  Elem e4{1, nullptr, nullptr};
+
+  list.Add(&e1);
+  list.Add(&e2);
+  list.Add(&e3);
+  list.Add(&e4);
+
+  int count = 0;
+  for (Elem* e : list) {
+    USE(e);
+    count++;
+  }
+  EXPECT_EQ(count, 4);
+
+  // Iterating and checking that all items are where they should be
+  auto it = list.begin();
+  EXPECT_EQ(**it, e4);
+  ++it;
+  EXPECT_EQ(**it, e3);
+  ++it;
+  EXPECT_EQ(**it, e2);
+  ++it;
+  EXPECT_EQ(**it, e1);
+  ++it;
+  EXPECT_FALSE(it != list.end());
+
+  // Removing with the iterator
+  it = list.begin();
+  EXPECT_EQ(**it, e4);
+  it = list.RemoveAt(it);
+  EXPECT_EQ(**it, e3);
+  ++it;
+  EXPECT_EQ(**it, e2);
+  it = list.RemoveAt(it);
+  EXPECT_EQ(**it, e1);
+  EXPECT_EQ(*e3.next_, e1);
+  it = list.RemoveAt(it);
+  EXPECT_FALSE(it != list.end());
+  EXPECT_EQ(e3.next_, nullptr);
+  it = list.begin();
+  it = list.RemoveAt(it);
+
+  EXPECT_TRUE(list.empty());
+  EXPECT_EQ(e1.next_, nullptr);
+  EXPECT_EQ(e2.next_, nullptr);
+  EXPECT_EQ(e3.next_, nullptr);
+  EXPECT_EQ(e4.next_, nullptr);
+  EXPECT_EQ(e1.prev_, nullptr);
+  EXPECT_EQ(e2.prev_, nullptr);
+  EXPECT_EQ(e3.prev_, nullptr);
+  EXPECT_EQ(e4.prev_, nullptr);
+}
+
+}  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/test/unittests/compiler/turboshaft/snapshot-table-unittest.cc b/deps/v8/test/unittests/compiler/turboshaft/snapshot-table-unittest.cc
index 465bebc54d3360..e879e3bc7157df 100644
--- a/deps/v8/test/unittests/compiler/turboshaft/snapshot-table-unittest.cc
+++ b/deps/v8/test/unittests/compiler/turboshaft/snapshot-table-unittest.cc
@@ -206,4 +206,123 @@ TEST_F(SnapshotTableTest, KeyData) {
   EXPECT_EQ(k1.data().x, 5);
 }
 
+TEST_F(SnapshotTableTest, ChangeCallback) {
+  AccountingAllocator allocator;
+  Zone zone(&allocator, ZONE_NAME);
+
+  SnapshotTable<int> table(&zone);
+  using Key = decltype(table)::Key;
+  using Snapshot = decltype(table)::Snapshot;
+
+  Key k1 = table.NewKey(1);
+  table.StartNewSnapshot();
+  table.Set(k1, 5);
+  Snapshot s1 = table.Seal();
+
+  int invoked = 0;
+  table.StartNewSnapshot({}, [&](Key key, int old_value, int new_value) {
+    invoked++;
+    EXPECT_EQ(key, k1);
+    EXPECT_EQ(old_value, 5);
+    EXPECT_EQ(new_value, 1);
+  });
+  EXPECT_EQ(invoked, 1);
+  table.Set(k1, 7);
+  Snapshot s2 = table.Seal();
+
+  invoked = 0;
+  table.StartNewSnapshot(
+      {s1, s2},
+      [&](Key key, base::Vector<const int> values) {
+        EXPECT_EQ(key, k1);
+        EXPECT_EQ(values[0], 5);
+        EXPECT_EQ(values[1], 7);
+        return 10;
+      },
+      [&](Key key, int old_value, int new_value) {
+        // We are invoked twice because the table is rolled back first and then
+        // merged. But the only important invariant we should rely on is that
+        // the updates collectively transform the table into the new state.
+        switch (invoked++) {
+          case 0:
+            EXPECT_EQ(key, k1);
+            EXPECT_EQ(old_value, 7);
+            EXPECT_EQ(new_value, 1);
+            break;
+          case 1:
+            EXPECT_EQ(key, k1);
+            EXPECT_EQ(old_value, 1);
+            EXPECT_EQ(new_value, 10);
+            break;
+          default:
+            UNREACHABLE();
+        }
+      });
+  EXPECT_EQ(invoked, 2);
+  EXPECT_EQ(table.Get(k1), 10);
+}
+
+TEST_F(SnapshotTableTest, ChangeTrackingSnapshotTable) {
+  AccountingAllocator allocator;
+  Zone zone(&allocator, ZONE_NAME);
+
+  struct KeyData {
+    int id;
+  };
+
+  struct Table : ChangeTrackingSnapshotTable<Table, bool, KeyData> {
+    using ChangeTrackingSnapshotTable::ChangeTrackingSnapshotTable;
+    std::set<int> active_keys;
+
+    void OnNewKey(Key key, bool value) {
+      if (value) {
+        active_keys.insert(key.data().id);
+      }
+    }
+    void OnValueChange(Key key, bool old_value, bool new_value) {
+      if (old_value && !new_value) {
+        active_keys.erase(key.data().id);
+      } else if (!old_value && new_value) {
+        active_keys.insert(key.data().id);
+      }
+    }
+  } table(&zone);
+
+  using Key = Table::Key;
+  using Snapshot = Table::Snapshot;
+
+  Key k1 = table.NewKey(KeyData{5}, true);
+  Key k2 = table.NewKey(KeyData{7}, false);
+
+  table.StartNewSnapshot();
+  EXPECT_EQ(table.active_keys, std::set<int>({5}));
+  table.Set(k2, true);
+  EXPECT_EQ(table.active_keys, std::set<int>({5, 7}));
+  Snapshot s1 = table.Seal();
+
+  table.StartNewSnapshot();
+  EXPECT_EQ(table.active_keys, std::set<int>({5}));
+  table.Set(k1, false);
+  EXPECT_EQ(table.active_keys, std::set<int>({}));
+  table.Set(k2, true);
+  EXPECT_EQ(table.active_keys, std::set<int>({7}));
+  Snapshot s2 = table.Seal();
+
+  table.StartNewSnapshot({s1, s2},
+                         [&](Key key, base::Vector<const bool> values) {
+                           EXPECT_EQ(values.size(), 2u);
+                           return values[0] ^ values[1];
+                         });
+  EXPECT_EQ(table.active_keys, std::set<int>({5}));
+  table.Seal();
+
+  table.StartNewSnapshot({s1, s2},
+                         [&](Key key, base::Vector<const bool> values) {
+                           EXPECT_EQ(values.size(), 2u);
+                           return values[0] || values[1];
+                         });
+  EXPECT_EQ(table.active_keys, std::set<int>({5, 7}));
+  table.Seal();
+}
+
 }  // namespace v8::internal::compiler::turboshaft
diff --git a/deps/v8/test/unittests/compiler/turboshaft/turboshaft-typer-unittest.cc b/deps/v8/test/unittests/compiler/turboshaft/turboshaft-typer-unittest.cc
index 84ee558abbc3b8..d5f3ed517d9aeb 100644
--- a/deps/v8/test/unittests/compiler/turboshaft/turboshaft-typer-unittest.cc
+++ b/deps/v8/test/unittests/compiler/turboshaft/turboshaft-typer-unittest.cc
@@ -14,21 +14,19 @@ namespace v8::internal::compiler::turboshaft {
 template <typename T>
 class WordTyperTest : public TestWithNativeContextAndZone {
  public:
-  CanonicalHandleScope canonical;
   using word_t = typename T::word_t;
   static constexpr size_t Bits = sizeof(word_t) * kBitsPerByte;
 
-  WordTyperTest() : TestWithNativeContextAndZone(), canonical(isolate()) {}
+  WordTyperTest() : TestWithNativeContextAndZone() {}
 };
 
 template <typename T>
 class FloatTyperTest : public TestWithNativeContextAndZone {
  public:
-  CanonicalHandleScope canonical;
   using float_t = typename T::float_t;
   static constexpr size_t Bits = sizeof(float_t) * kBitsPerByte;
 
-  FloatTyperTest() : TestWithNativeContextAndZone(), canonical(isolate()) {}
+  FloatTyperTest() : TestWithNativeContextAndZone() {}
 };
 
 template <typename T>
diff --git a/deps/v8/test/unittests/compiler/turboshaft/turboshaft-types-unittest.cc b/deps/v8/test/unittests/compiler/turboshaft/turboshaft-types-unittest.cc
index 284a711967d3a0..2ad6a9d476e1ae 100644
--- a/deps/v8/test/unittests/compiler/turboshaft/turboshaft-types-unittest.cc
+++ b/deps/v8/test/unittests/compiler/turboshaft/turboshaft-types-unittest.cc
@@ -12,10 +12,8 @@ namespace v8::internal::compiler::turboshaft {
 class TurboshaftTypesTest : public TestWithNativeContextAndZone {
  public:
   using Kind = Type::Kind;
-  CanonicalHandleScope canonical;
 
-  TurboshaftTypesTest()
-      : TestWithNativeContextAndZone(), canonical(isolate()) {}
+  TurboshaftTypesTest() : TestWithNativeContextAndZone() {}
 };
 
 TEST_F(TurboshaftTypesTest, Word32) {
diff --git a/deps/v8/test/unittests/compiler/typer-unittest.cc b/deps/v8/test/unittests/compiler/typer-unittest.cc
index 1a76aa12d4c60b..2a1e85301b6446 100644
--- a/deps/v8/test/unittests/compiler/typer-unittest.cc
+++ b/deps/v8/test/unittests/compiler/typer-unittest.cc
@@ -23,9 +23,8 @@ class TyperTest : public TypedGraphTest {
  public:
   TyperTest()
       : TypedGraphTest(3),
-        broker_(isolate(), zone()),
-        current_broker_(&broker_),
-        operation_typer_(&broker_, zone()),
+        current_broker_(broker()),
+        operation_typer_(broker(), zone()),
         types_(zone(), isolate(), random_number_generator()),
         javascript_(zone()),
         simplified_(zone()) {
@@ -58,7 +57,6 @@ class TyperTest : public TypedGraphTest {
 
   const int kRepetitions = 50;
 
-  JSHeapBroker broker_;
   CurrentHeapBrokerScope current_broker_;
   OperationTyper operation_typer_;
   Types types_;
@@ -186,7 +184,9 @@ class TyperTest : public TypedGraphTest {
             for (int x2 = rmin; x2 < rmin + width; x2++) {
               double result_value = opfun(x1, x2);
               Type result_type = Type::Constant(
-                  &broker_, isolate()->factory()->NewNumber(result_value),
+                  broker(),
+                  CanonicalHandle(
+                      isolate()->factory()->NewNumber(result_value)),
                   zone());
               EXPECT_TRUE(result_type.Is(expected_type));
             }
@@ -208,21 +208,24 @@ class TyperTest : public TypedGraphTest {
         double x2 = RandomInt(r2.AsRange());
         double result_value = opfun(x1, x2);
         Type result_type = Type::Constant(
-            &broker_, isolate()->factory()->NewNumber(result_value), zone());
+            broker(),
+            CanonicalHandle(isolate()->factory()->NewNumber(result_value)),
+            zone());
         EXPECT_TRUE(result_type.Is(expected_type));
       }
     }
     // Test extreme cases.
     double x1 = +1e-308;
     double x2 = -1e-308;
-    Type r1 =
-        Type::Constant(&broker_, isolate()->factory()->NewNumber(x1), zone());
-    Type r2 =
-        Type::Constant(&broker_, isolate()->factory()->NewNumber(x2), zone());
+    Type r1 = Type::Constant(
+        broker(), CanonicalHandle(isolate()->factory()->NewNumber(x1)), zone());
+    Type r2 = Type::Constant(
+        broker(), CanonicalHandle(isolate()->factory()->NewNumber(x2)), zone());
     Type expected_type = TypeBinaryOp(op, r1, r2);
     double result_value = opfun(x1, x2);
     Type result_type = Type::Constant(
-        &broker_, isolate()->factory()->NewNumber(result_value), zone());
+        broker(),
+        CanonicalHandle(isolate()->factory()->NewNumber(result_value)), zone());
     EXPECT_TRUE(result_type.Is(expected_type));
   }
 
@@ -237,8 +240,8 @@ class TyperTest : public TypedGraphTest {
         double x2 = RandomInt(r2.AsRange());
         bool result_value = opfun(x1, x2);
         Type result_type = Type::Constant(
-            &broker_,
-            result_value ? broker_.true_value() : broker_.false_value(),
+            broker(),
+            result_value ? broker()->true_value() : broker()->false_value(),
             zone());
         EXPECT_TRUE(result_type.Is(expected_type));
       }
@@ -256,7 +259,9 @@ class TyperTest : public TypedGraphTest {
         int32_t x2 = static_cast<int32_t>(RandomInt(r2.AsRange()));
         double result_value = opfun(x1, x2);
         Type result_type = Type::Constant(
-            &broker_, isolate()->factory()->NewNumber(result_value), zone());
+            broker(),
+            CanonicalHandle(isolate()->factory()->NewNumber(result_value)),
+            zone());
         EXPECT_TRUE(result_type.Is(expected_type));
       }
     }
diff --git a/deps/v8/test/unittests/compiler/types-unittest.cc b/deps/v8/test/unittests/compiler/types-unittest.cc
index 51fffe8bcdd3d9..e5318f3c1629af 100644
--- a/deps/v8/test/unittests/compiler/types-unittest.cc
+++ b/deps/v8/test/unittests/compiler/types-unittest.cc
@@ -32,12 +32,10 @@ class TypesTest : public TestWithNativeContextAndZone {
  public:
   using TypeIterator = Types::TypeVector::iterator;
   using ValueIterator = Types::ValueVector::iterator;
-  CanonicalHandleScope canonical;
   Types T;
 
   TypesTest()
       : TestWithNativeContextAndZone(),
-        canonical(isolate()),
         T(zone(), isolate(), isolate()->random_number_generator()) {}
 
   bool IsBitset(Type type) { return type.IsBitset(); }
@@ -187,13 +185,13 @@ class TypesTest : public TestWithNativeContextAndZone {
       if (type.IsHeapConstant()) {
         CHECK(value.address() == type.AsHeapConstant()->Value().address());
       } else if (type.IsOtherNumberConstant()) {
-        CHECK(value->IsHeapNumber());
-        CHECK(value->Number() == type.AsOtherNumberConstant()->Value());
+        CHECK(IsHeapNumber(*value));
+        CHECK(Object::Number(*value) == type.AsOtherNumberConstant()->Value());
       } else if (type.IsBitset()) {
         CHECK(type.IsSingleton());
       } else {
         CHECK(type.IsRange());
-        double v = value->Number();
+        double v = Object::Number(*value);
         CHECK(v == type.AsRange()->Min() && v == type.AsRange()->Max());
       }
     }
@@ -221,71 +219,110 @@ class TypesTest : public TestWithNativeContextAndZone {
 
     // Typing of numbers
     Factory* fac = isolate()->factory();
-    CHECK(T.Constant(fac->NewNumber(0)).Is(T.UnsignedSmall));
-    CHECK(T.Constant(fac->NewNumber(1)).Is(T.UnsignedSmall));
-    CHECK(T.Constant(fac->NewNumber(42)).Equals(T.Range(42, 42)));
-    CHECK(T.Constant(fac->NewNumber(0x3FFFFFFF)).Is(T.UnsignedSmall));
-    CHECK(T.Constant(fac->NewNumber(-1)).Is(T.Negative31));
-    CHECK(T.Constant(fac->NewNumber(-0x3FFFFFFF)).Is(T.Negative31));
-    CHECK(T.Constant(fac->NewNumber(-0x40000000)).Is(T.Negative31));
-    CHECK(T.Constant(fac->NewNumber(0x40000000)).Is(T.Unsigned31));
-    CHECK(!T.Constant(fac->NewNumber(0x40000000)).Is(T.Unsigned30));
-    CHECK(T.Constant(fac->NewNumber(0x7FFFFFFF)).Is(T.Unsigned31));
-    CHECK(!T.Constant(fac->NewNumber(0x7FFFFFFF)).Is(T.Unsigned30));
-    CHECK(T.Constant(fac->NewNumber(-0x40000001)).Is(T.Negative32));
-    CHECK(!T.Constant(fac->NewNumber(-0x40000001)).Is(T.Negative31));
-    CHECK(T.Constant(fac->NewNumber(-0x7FFFFFFF)).Is(T.Negative32));
-    CHECK(!T.Constant(fac->NewNumber(-0x7FFFFFFF - 1)).Is(T.Negative31));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0))).Is(T.UnsignedSmall));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(1))).Is(T.UnsignedSmall));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(42)))
+              .Equals(T.Range(42, 42)));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0x3FFFFFFF)))
+              .Is(T.UnsignedSmall));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-1))).Is(T.Negative31));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-0x3FFFFFFF)))
+              .Is(T.Negative31));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-0x40000000)))
+              .Is(T.Negative31));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0x40000000)))
+              .Is(T.Unsigned31));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(0x40000000)))
+               .Is(T.Unsigned30));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0x7FFFFFFF)))
+              .Is(T.Unsigned31));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(0x7FFFFFFF)))
+               .Is(T.Unsigned30));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-0x40000001)))
+              .Is(T.Negative32));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(-0x40000001)))
+               .Is(T.Negative31));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-0x7FFFFFFF)))
+              .Is(T.Negative32));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(-0x7FFFFFFF - 1)))
+               .Is(T.Negative31));
     if (SmiValuesAre31Bits()) {
-      CHECK(!T.Constant(fac->NewNumber(0x40000000)).Is(T.UnsignedSmall));
-      CHECK(!T.Constant(fac->NewNumber(0x7FFFFFFF)).Is(T.UnsignedSmall));
-      CHECK(!T.Constant(fac->NewNumber(-0x40000001)).Is(T.SignedSmall));
-      CHECK(!T.Constant(fac->NewNumber(-0x7FFFFFFF - 1)).Is(T.SignedSmall));
+      CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(0x40000000)))
+                 .Is(T.UnsignedSmall));
+      CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(0x7FFFFFFF)))
+                 .Is(T.UnsignedSmall));
+      CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(-0x40000001)))
+                 .Is(T.SignedSmall));
+      CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(-0x7FFFFFFF - 1)))
+                 .Is(T.SignedSmall));
     } else {
       CHECK(SmiValuesAre32Bits());
-      CHECK(T.Constant(fac->NewNumber(0x40000000)).Is(T.UnsignedSmall));
-      CHECK(T.Constant(fac->NewNumber(0x7FFFFFFF)).Is(T.UnsignedSmall));
-      CHECK(T.Constant(fac->NewNumber(-0x40000001)).Is(T.SignedSmall));
-      CHECK(T.Constant(fac->NewNumber(-0x7FFFFFFF - 1)).Is(T.SignedSmall));
-    }
-    CHECK(T.Constant(fac->NewNumber(0x80000000u)).Is(T.Unsigned32));
-    CHECK(!T.Constant(fac->NewNumber(0x80000000u)).Is(T.Unsigned31));
-    CHECK(T.Constant(fac->NewNumber(0xFFFFFFFFu)).Is(T.Unsigned32));
-    CHECK(!T.Constant(fac->NewNumber(0xFFFFFFFFu)).Is(T.Unsigned31));
-    CHECK(T.Constant(fac->NewNumber(0xFFFFFFFFu + 1.0)).Is(T.PlainNumber));
-    CHECK(!T.Constant(fac->NewNumber(0xFFFFFFFFu + 1.0)).Is(T.Integral32));
-    CHECK(T.Constant(fac->NewNumber(-0x7FFFFFFF - 2.0)).Is(T.PlainNumber));
-    CHECK(!T.Constant(fac->NewNumber(-0x7FFFFFFF - 2.0)).Is(T.Integral32));
-    CHECK(T.Constant(fac->NewNumber(0.1)).Is(T.PlainNumber));
-    CHECK(!T.Constant(fac->NewNumber(0.1)).Is(T.Integral32));
-    CHECK(T.Constant(fac->NewNumber(-10.1)).Is(T.PlainNumber));
-    CHECK(!T.Constant(fac->NewNumber(-10.1)).Is(T.Integral32));
-    CHECK(T.Constant(fac->NewNumber(10e60)).Is(T.PlainNumber));
-    CHECK(!T.Constant(fac->NewNumber(10e60)).Is(T.Integral32));
-    CHECK(T.Constant(fac->NewNumber(-1.0 * 0.0)).Is(T.MinusZero));
-    CHECK(T.Constant(fac->NewNumber(V8_INFINITY)).Is(T.PlainNumber));
-    CHECK(!T.Constant(fac->NewNumber(V8_INFINITY)).Is(T.Integral32));
-    CHECK(T.Constant(fac->NewNumber(-V8_INFINITY)).Is(T.PlainNumber));
-    CHECK(!T.Constant(fac->NewNumber(-V8_INFINITY)).Is(T.Integral32));
+      CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0x40000000)))
+                .Is(T.UnsignedSmall));
+      CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0x7FFFFFFF)))
+                .Is(T.UnsignedSmall));
+      CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-0x40000001)))
+                .Is(T.SignedSmall));
+      CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-0x7FFFFFFF - 1)))
+                .Is(T.SignedSmall));
+    }
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0x80000000u)))
+              .Is(T.Unsigned32));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(0x80000000u)))
+               .Is(T.Unsigned31));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0xFFFFFFFFu)))
+              .Is(T.Unsigned32));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(0xFFFFFFFFu)))
+               .Is(T.Unsigned31));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0xFFFFFFFFu + 1.0)))
+              .Is(T.PlainNumber));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(0xFFFFFFFFu + 1.0)))
+               .Is(T.Integral32));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-0x7FFFFFFF - 2.0)))
+              .Is(T.PlainNumber));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(-0x7FFFFFFF - 2.0)))
+               .Is(T.Integral32));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(0.1))).Is(T.PlainNumber));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(0.1))).Is(T.Integral32));
+    CHECK(
+        T.Constant(T.CanonicalHandle(fac->NewNumber(-10.1))).Is(T.PlainNumber));
+    CHECK(
+        !T.Constant(T.CanonicalHandle(fac->NewNumber(-10.1))).Is(T.Integral32));
+    CHECK(
+        T.Constant(T.CanonicalHandle(fac->NewNumber(10e60))).Is(T.PlainNumber));
+    CHECK(
+        !T.Constant(T.CanonicalHandle(fac->NewNumber(10e60))).Is(T.Integral32));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-1.0 * 0.0)))
+              .Is(T.MinusZero));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(V8_INFINITY)))
+              .Is(T.PlainNumber));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(V8_INFINITY)))
+               .Is(T.Integral32));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-V8_INFINITY)))
+              .Is(T.PlainNumber));
+    CHECK(!T.Constant(T.CanonicalHandle(fac->NewNumber(-V8_INFINITY)))
+               .Is(T.Integral32));
 
     // Typing of Strings
-    Handle<String> s1 = fac->NewStringFromAsciiChecked("a");
+    Handle<String> s1 = T.CanonicalHandle(fac->NewStringFromAsciiChecked("a"));
     CHECK(T.Constant(s1).Is(T.InternalizedString));
     const base::uc16 two_byte[1] = {0x2603};
-    Handle<String> s2 = fac->NewTwoByteInternalizedString(
+    Handle<String> s2 = T.CanonicalHandle(fac->NewTwoByteInternalizedString(
         base::Vector<const base::uc16>(two_byte, 1),
         StringHasher::HashSequentialString<uint16_t>(two_byte, 1,
-                                                     HashSeed(isolate())));
+                                                     HashSeed(isolate()))));
     CHECK(T.Constant(s2).Is(T.InternalizedString));
 
     // Typing of special constants
-    CHECK(T.Constant(fac->the_hole_value()).Equals(T.Hole));
+    CHECK(T.Constant(fac->the_hole_value()).Equals(T.TheHole));
     CHECK(T.Constant(fac->null_value()).Equals(T.Null));
     CHECK(T.Constant(fac->undefined_value()).Equals(T.Undefined));
     CHECK(T.Constant(fac->minus_zero_value()).Equals(T.MinusZero));
-    CHECK(T.Constant(fac->NewNumber(-0.0)).Equals(T.MinusZero));
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(-0.0)))
+              .Equals(T.MinusZero));
     CHECK(T.Constant(fac->nan_value()).Equals(T.NaN));
-    CHECK(T.Constant(fac->NewNumber(std::numeric_limits<double>::quiet_NaN()))
+    CHECK(T.Constant(T.CanonicalHandle(fac->NewNumber(
+                         std::numeric_limits<double>::quiet_NaN())))
               .Equals(T.NaN));
   }
 
@@ -293,8 +330,8 @@ class TypesTest : public TestWithNativeContextAndZone {
     // Constructor
     for (ValueIterator i = T.integers.begin(); i != T.integers.end(); ++i) {
       for (ValueIterator j = T.integers.begin(); j != T.integers.end(); ++j) {
-        double min = (*i)->Number();
-        double max = (*j)->Number();
+        double min = Object::Number(**i);
+        double max = Object::Number(**j);
         if (min > max) std::swap(min, max);
         Type type = T.Range(min, max);
         CHECK(type.IsRange());
@@ -304,8 +341,8 @@ class TypesTest : public TestWithNativeContextAndZone {
     // Range attributes
     for (ValueIterator i = T.integers.begin(); i != T.integers.end(); ++i) {
       for (ValueIterator j = T.integers.begin(); j != T.integers.end(); ++j) {
-        double min = (*i)->Number();
-        double max = (*j)->Number();
+        double min = Object::Number(**i);
+        double max = Object::Number(**j);
         if (min > max) std::swap(min, max);
         Type type = T.Range(min, max);
         CHECK(min == type.AsRange()->Min());
@@ -320,10 +357,10 @@ class TypesTest : public TestWithNativeContextAndZone {
         for (ValueIterator i2 = T.integers.begin(); i2 != T.integers.end();
              ++i2) {
           for (ValueIterator j2 = i2; j2 != T.integers.end(); ++j2) {
-            double min1 = (*i1)->Number();
-            double max1 = (*j1)->Number();
-            double min2 = (*i2)->Number();
-            double max2 = (*j2)->Number();
+            double min1 = Object::Number(**i1);
+            double max1 = Object::Number(**j1);
+            double min2 = Object::Number(**i2);
+            double max2 = Object::Number(**j2);
             if (min1 > max1) std::swap(min1, max1);
             if (min2 > max2) std::swap(min2, max2);
             Type type1 = T.Range(min1, max1);
@@ -527,10 +564,10 @@ class TypesTest : public TestWithNativeContextAndZone {
         for (ValueIterator i2 = T.integers.begin(); i2 != T.integers.end();
              ++i2) {
           for (ValueIterator j2 = i2; j2 != T.integers.end(); ++j2) {
-            double min1 = (*i1)->Number();
-            double max1 = (*j1)->Number();
-            double min2 = (*i2)->Number();
-            double max2 = (*j2)->Number();
+            double min1 = Object::Number(**i1);
+            double max1 = Object::Number(**j1);
+            double min2 = Object::Number(**i2);
+            double max2 = Object::Number(**j2);
             if (min1 > max1) std::swap(min1, max1);
             if (min2 > max2) std::swap(min2, max2);
             Type type1 = T.Range(min1, max1);
diff --git a/deps/v8/test/unittests/compiler/wasm-address-reassociation-unittest.cc b/deps/v8/test/unittests/compiler/wasm-address-reassociation-unittest.cc
new file mode 100644
index 00000000000000..25bc41ca751543
--- /dev/null
+++ b/deps/v8/test/unittests/compiler/wasm-address-reassociation-unittest.cc
@@ -0,0 +1,264 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/compiler/wasm-address-reassociation.h"
+
+#include "src/compiler/js-graph.h"
+#include "src/compiler/machine-operator-reducer.h"
+#include "src/compiler/node.h"
+#include "test/unittests/compiler/graph-unittest.h"
+#include "test/unittests/compiler/node-test-utils.h"
+#include "testing/gmock-support.h"
+
+namespace v8 {
+namespace internal {
+namespace compiler {
+
+class WasmAddressReassociationTest : public GraphTest {
+ public:
+  WasmAddressReassociationTest()
+      : GraphTest(3),
+        machine_(zone()),
+        javascript_(zone()),
+        jsgraph_(isolate(), graph(), common(), &javascript_, nullptr,
+                 &machine_),
+        ar_(&jsgraph_, zone()),
+        protected_load_op_(machine()->ProtectedLoad(MachineType::Int32())),
+        protected_store_op_(
+            machine()->ProtectedStore(MachineRepresentation::kWord32)),
+        base_(graph()->NewNode(common()->Parameter(0), graph()->start())),
+        offset_(graph()->NewNode(common()->Parameter(1), graph()->start())) {}
+
+  ~WasmAddressReassociationTest() override = default;
+
+ protected:
+  MachineOperatorBuilder* machine() { return &machine_; }
+  WasmAddressReassociation* ar() { return &ar_; }
+  Node* Int32Constant(int32_t value) {
+    return graph()->NewNode(common()->Int32Constant(value));
+  }
+  Node* Int64Constant(int64_t value) {
+    return graph()->NewNode(common()->Int64Constant(value));
+  }
+  Node* Int32Add(Node* lhs, Node* rhs) {
+    return graph()->NewNode(machine()->Int32Add(), lhs, rhs);
+  }
+  Node* Int64Add(Node* lhs, Node* rhs) {
+    return graph()->NewNode(machine()->Int64Add(), lhs, rhs);
+  }
+  Node* ExtendAdd(Node* lhs, Node* rhs) {
+    Node* add = Int32Add(lhs, rhs);
+    return graph()->NewNode(machine()->ChangeUint32ToUint64(), add);
+  }
+  Node* ProtectedLoad(Node* base, Node* offset, Node* effect, Node* control) {
+    return graph()->NewNode(protected_load_op_, base, offset, effect, control);
+  }
+  Node* ProtectedStore(Node* base, Node* offset, Node* val, Node* effect,
+                       Node* control) {
+    return graph()->NewNode(protected_store_op_, base, offset, val, effect,
+                            control);
+  }
+  void CheckEffectChain(Node* effect_op, Node* end,
+                        std::vector<int64_t>& expected_offsets) {
+    std::vector<NodeId> base_addrs;
+    std::vector<int64_t> offsets;
+    std::set<NodeId> all_visited;
+    std::vector<Node*> effect_nodes = {effect_op};
+    while (!effect_nodes.empty()) {
+      effect_op = effect_nodes.back();
+      effect_nodes.pop_back();
+      if (all_visited.count(effect_op->id())) continue;
+      if (effect_op == end) continue;
+
+      all_visited.insert(effect_op->id());
+      for (int i = 0; i < effect_op->op()->EffectInputCount(); ++i) {
+        effect_nodes.push_back(NodeProperties::GetEffectInput(effect_op, i));
+      }
+
+      if (effect_op->opcode() == IrOpcode::kProtectedLoad ||
+          effect_op->opcode() == IrOpcode::kProtectedStore) {
+        Node* add = effect_op->InputAt(0);
+        EXPECT_EQ(add->opcode(), IrOpcode::kInt64Add);
+        EXPECT_TRUE(add->InputAt(0) == base_);
+        EXPECT_TRUE(add->InputAt(1) == offset_);
+        Node* offset = effect_op->InputAt(1);
+        EXPECT_TRUE(NodeProperties::IsConstant(offset));
+        base_addrs.push_back(add->id());
+        offsets.push_back(OpParameter<int64_t>(offset->op()));
+      }
+    }
+    EXPECT_EQ(base_addrs.size(), expected_offsets.size());
+    EXPECT_TRUE(std::adjacent_find(base_addrs.begin(), base_addrs.end(),
+                                   std::not_equal_to<>()) == base_addrs.end());
+    EXPECT_EQ(offsets, expected_offsets);
+  }
+  Node* base() const { return base_; }
+  Node* offset() const { return offset_; }
+
+ private:
+  MachineOperatorBuilder machine_;
+  JSOperatorBuilder javascript_;
+  JSGraph jsgraph_;
+  WasmAddressReassociation ar_;
+  const Operator* protected_load_op_;
+  const Operator* protected_store_op_;
+  Node* base_;
+  Node* offset_;
+};
+
+TEST_F(WasmAddressReassociationTest, ProtectedBase) {
+  if (machine()->Is32()) return;
+
+  Node* control = graph()->start();
+  Node* effect = graph()->start();
+  NodeId effect_id = effect->id();
+  for (unsigned i = 0; i < 3; ++i) {
+    Node* index = Int64Constant((i + 1) * 8);
+    Node* object = Int64Add(base(), index);
+    Node* load = ProtectedLoad(object, offset(), effect, control);
+    Node* store = ProtectedStore(object, offset(), load, load, control);
+    ar()->VisitProtectedMemOp(load, effect_id);
+    ar()->VisitProtectedMemOp(store, effect_id);
+    effect = store;
+  }
+  graph()->end()->InsertInput(zone(), 0, effect);
+  ar()->Optimize();
+  std::vector<int64_t> offsets = {24, 24, 16, 16, 8, 8};
+  CheckEffectChain(effect, graph()->start(), offsets);
+}
+
+TEST_F(WasmAddressReassociationTest, ProtectedIndex) {
+  if (machine()->Is32()) return;
+
+  Node* control = graph()->start();
+  Node* effect = graph()->start();
+  NodeId effect_id = effect->id();
+  for (int64_t i = 0; i < 3; ++i) {
+    Node* index = Int64Constant((i + 1) * -8);
+    Node* add = Int64Add(offset(), index);
+    Node* load = ProtectedLoad(base(), add, effect, control);
+    Node* store = ProtectedStore(base(), add, load, load, control);
+    ar()->VisitProtectedMemOp(load, effect_id);
+    ar()->VisitProtectedMemOp(store, effect_id);
+    effect = store;
+  }
+  graph()->end()->InsertInput(zone(), 0, effect);
+  ar()->Optimize();
+  std::vector<int64_t> offsets = {-24, -24, -16, -16, -8, -8};
+  CheckEffectChain(effect, graph()->start(), offsets);
+}
+
+TEST_F(WasmAddressReassociationTest, ProtectedBaseIndex) {
+  if (machine()->Is32()) return;
+
+  Node* control = graph()->start();
+  Node* effect = graph()->start();
+  NodeId effect_id = effect->id();
+  for (unsigned i = 0; i < 3; ++i) {
+    Node* base_add = Int64Add(base(), Int64Constant(i * 4));
+    Node* index_add = Int64Add(offset(), Int64Constant((i + 1) * 8));
+    Node* load = ProtectedLoad(base_add, index_add, effect, control);
+    Node* store = ProtectedStore(base_add, index_add, load, load, control);
+    ar()->VisitProtectedMemOp(load, effect_id);
+    ar()->VisitProtectedMemOp(store, effect_id);
+    effect = store;
+  }
+  graph()->end()->InsertInput(zone(), 0, effect);
+  ar()->Optimize();
+  std::vector<int64_t> offsets = {32, 32, 20, 20, 8, 8};
+  CheckEffectChain(effect, graph()->start(), offsets);
+}
+
+TEST_F(WasmAddressReassociationTest, ProtectedExtendIndex) {
+  if (machine()->Is32()) return;
+
+  Node* control = graph()->start();
+  Node* effect = graph()->start();
+  NodeId effect_id = effect->id();
+  for (unsigned i = 0; i < 3; ++i) {
+    Node* index = Int32Constant(8);
+    Node* add = ExtendAdd(offset(), index);
+    Node* load = ProtectedLoad(base(), add, effect, control);
+    Node* store = ProtectedStore(base(), add, load, load, control);
+    ar()->VisitProtectedMemOp(load, effect_id);
+    ar()->VisitProtectedMemOp(store, effect_id);
+    effect = store;
+  }
+  graph()->end()->InsertInput(zone(), 0, effect);
+  ar()->Optimize();
+
+  while (effect && effect != graph()->start()) {
+    EXPECT_FALSE(NodeProperties::IsConstant(effect->InputAt(1)));
+    effect = NodeProperties::GetEffectInput(effect, 0);
+  }
+}
+
+TEST_F(WasmAddressReassociationTest, Diamond) {
+  if (machine()->Is32()) return;
+
+  // start
+  //   3 loads
+  //   branch
+  // if_true
+  //   3 loads
+  // if_false
+  //   3 stores
+  // merge
+  //   3 loads
+  auto SequentialLoads = [this](size_t N, Node* effect_chain, Node* control_in,
+                                Node* effect_region) {
+    NodeId effect_region_id = effect_region->id();
+    for (unsigned i = 0; i < N; ++i) {
+      size_t current_offset = 8 * (i + 1);
+      Node* add = Int64Add(base(), Int64Constant(current_offset));
+      Node* load = ProtectedLoad(add, offset(), effect_chain, control_in);
+      ar()->VisitProtectedMemOp(load, effect_region_id);
+      effect_chain = load;
+    }
+    return effect_chain;
+  };
+  auto SequentialStores = [this](size_t N, Node* effect_chain, Node* control_in,
+                                 Node* effect_region) {
+    NodeId effect_region_id = effect_region->id();
+    for (unsigned i = 0; i < N; ++i) {
+      size_t current_offset = 8 * (i + 1);
+      Node* add = Int64Add(offset(), Int64Constant(current_offset));
+      Node* store = ProtectedStore(base(), add, add, effect_chain, control_in);
+      ar()->VisitProtectedMemOp(store, effect_region_id);
+      effect_chain = store;
+    }
+    return effect_chain;
+  };
+  Node* start = graph()->start();
+  Node* effect = SequentialLoads(3, start, start, start);
+  Node* check = Parameter(Type::Boolean(), 1);
+  Node* branch = graph()->NewNode(common()->Branch(), check, start);
+  Node* etrue = effect;
+  Node* efalse = effect;
+
+  Node* if_true = graph()->NewNode(common()->IfTrue(), branch);
+  etrue = SequentialLoads(3, etrue, if_true, start);
+
+  Node* if_false = graph()->NewNode(common()->IfFalse(), branch);
+  efalse = SequentialStores(3, efalse, if_false, start);
+
+  Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
+  Node* effect_phi =
+      graph()->NewNode(common()->EffectPhi(2), etrue, efalse, merge);
+  Node* end = SequentialLoads(3, effect_phi, merge, effect_phi);
+
+  ar()->Optimize();
+
+  // end to effect phi: 3 loads sharing base address.
+  std::vector<int64_t> offsets = {24, 16, 8};
+  CheckEffectChain(end, effect_phi, offsets);
+
+  // effect phi to start: 9 operations sharing base address.
+  offsets = {24, 16, 8, 24, 16, 8, 24, 16, 8};
+  CheckEffectChain(effect_phi, start, offsets);
+}
+
+}  // namespace compiler
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/test/unittests/compiler/x64/instruction-selector-x64-unittest.cc b/deps/v8/test/unittests/compiler/x64/instruction-selector-x64-unittest.cc
index 18c0eeb31a0366..51bc2e43a33c1a 100644
--- a/deps/v8/test/unittests/compiler/x64/instruction-selector-x64-unittest.cc
+++ b/deps/v8/test/unittests/compiler/x64/instruction-selector-x64-unittest.cc
@@ -4,7 +4,9 @@
 
 #include <limits>
 
+#include "src/codegen/assembler.h"
 #include "src/common/globals.h"
+#include "src/compiler/backend/instruction-codes.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node-matchers.h"
 #include "src/objects/objects-inl.h"
@@ -2099,7 +2101,7 @@ TEST_F(InstructionSelectorTest, SIMDSplatZero) {
     m.Return(splat);
     Stream s = m.Build();
     ASSERT_EQ(1U, s.size());
-    EXPECT_EQ(kX64S128Zero, s[0]->arch_opcode());
+    EXPECT_EQ(kX64SZero, s[0]->arch_opcode());
     ASSERT_EQ(0U, s[0]->InputCount());
     EXPECT_EQ(1U, s[0]->OutputCount());
   }
@@ -2109,7 +2111,7 @@ TEST_F(InstructionSelectorTest, SIMDSplatZero) {
     m.Return(splat);
     Stream s = m.Build();
     ASSERT_EQ(1U, s.size());
-    EXPECT_EQ(kX64S128Zero, s[0]->arch_opcode());
+    EXPECT_EQ(kX64SZero, s[0]->arch_opcode());
     ASSERT_EQ(0U, s[0]->InputCount());
     EXPECT_EQ(1U, s[0]->OutputCount());
   }
@@ -2119,7 +2121,7 @@ TEST_F(InstructionSelectorTest, SIMDSplatZero) {
     m.Return(splat);
     Stream s = m.Build();
     ASSERT_EQ(1U, s.size());
-    EXPECT_EQ(kX64S128Zero, s[0]->arch_opcode());
+    EXPECT_EQ(kX64SZero, s[0]->arch_opcode());
     ASSERT_EQ(0U, s[0]->InputCount());
     EXPECT_EQ(1U, s[0]->OutputCount());
   }
@@ -2129,7 +2131,7 @@ TEST_F(InstructionSelectorTest, SIMDSplatZero) {
     m.Return(splat);
     Stream s = m.Build();
     ASSERT_EQ(1U, s.size());
-    EXPECT_EQ(kX64S128Zero, s[0]->arch_opcode());
+    EXPECT_EQ(kX64SZero, s[0]->arch_opcode());
     ASSERT_EQ(0U, s[0]->InputCount());
     EXPECT_EQ(1U, s[0]->OutputCount());
   }
@@ -2370,6 +2372,43 @@ INSTANTIATE_TEST_SUITE_P(InstructionSelectorTest,
                          InstructionSelectorSIMDArchShuffleTest,
                          ::testing::ValuesIn(kArchShuffles));
 
+struct ArchShuffle256 {
+  uint8_t shuffle[kSimd256Size];
+  ArchOpcode arch_opcode;
+  size_t input_count;
+};
+
+static constexpr ArchShuffle256 kArchShuffles256[] = {
+    {{4,  5,  6,  7,  8,  9,  10, 11, 12, 13, 14, 15, 0,  1,  2,  3,
+      20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 16, 17, 18, 19},
+     kX64Vpshufd,
+     2}};
+
+using InstructionSelectorSIMDArchShuffle256Test =
+    InstructionSelectorTestWithParam<ArchShuffle256>;
+
+TEST_P(InstructionSelectorSIMDArchShuffle256Test, SIMDArchShuffle256) {
+  MachineType type = MachineType::Simd128();
+  {
+    // Tests various shuffle optimizations
+    StreamBuilder m(this, type, type, type);
+    auto param = GetParam();
+    auto shuffle = param.shuffle;
+    const Operator* op = m.machine()->I8x32Shuffle(shuffle);
+    Node* n = m.AddNode(op, m.Parameter(0), m.Parameter(1));
+    m.Return(n);
+    Stream s = m.Build();
+    ASSERT_EQ(1U, s.size());
+    EXPECT_EQ(param.arch_opcode, s[0]->arch_opcode());
+    ASSERT_EQ(param.input_count, s[0]->InputCount());
+    EXPECT_EQ(1U, s[0]->OutputCount());
+  }
+}
+
+INSTANTIATE_TEST_SUITE_P(InstructionSelectorTest,
+                         InstructionSelectorSIMDArchShuffle256Test,
+                         ::testing::ValuesIn(kArchShuffles256));
+
 struct ShuffleWithZeroInput {
   uint8_t shuffle_mask[kSimd128Size];
   ArchOpcode arch_opcode;
diff --git a/deps/v8/test/unittests/deoptimizer/deoptimization-unittest.cc b/deps/v8/test/unittests/deoptimizer/deoptimization-unittest.cc
index 42700518b1ccbb..5fb38e5d11ea90 100644
--- a/deps/v8/test/unittests/deoptimizer/deoptimization-unittest.cc
+++ b/deps/v8/test/unittests/deoptimizer/deoptimization-unittest.cc
@@ -37,6 +37,7 @@
 #include "src/execution/isolate.h"
 #include "src/init/v8.h"
 #include "src/objects/objects-inl.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -63,25 +64,31 @@ class DeoptimizationTest : public TestWithContext {
 
 // Utility class to set the following runtime flags when constructed and return
 // to their default state when destroyed:
-//   --allow-natives-syntax --always-turbofan --noturbo-inlining
+//   --minimum-invocations-before-optimization --allow-natives-syntax
+//   --always-turbofan --noturbo-inlining
 class AlwaysOptimizeAllowNativesSyntaxNoInlining {
  public:
   AlwaysOptimizeAllowNativesSyntaxNoInlining()
-      : always_turbofan_(i::v8_flags.always_turbofan),
+      : minimum_invocations_(
+            i::v8_flags.minimum_invocations_before_optimization),
+        always_turbofan_(i::v8_flags.always_turbofan),
         allow_natives_syntax_(i::v8_flags.allow_natives_syntax),
         turbo_inlining_(i::v8_flags.turbo_inlining) {
+    i::v8_flags.minimum_invocations_before_optimization = 0;
     i::v8_flags.always_turbofan = true;
     i::v8_flags.allow_natives_syntax = true;
     i::v8_flags.turbo_inlining = false;
   }
 
   ~AlwaysOptimizeAllowNativesSyntaxNoInlining() {
+    i::v8_flags.minimum_invocations_before_optimization = minimum_invocations_;
     i::v8_flags.always_turbofan = always_turbofan_;
     i::v8_flags.allow_natives_syntax = allow_natives_syntax_;
     i::v8_flags.turbo_inlining = turbo_inlining_;
   }
 
  private:
+  int minimum_invocations_;
   bool always_turbofan_;
   bool allow_natives_syntax_;
   bool turbo_inlining_;
@@ -89,22 +96,28 @@ class AlwaysOptimizeAllowNativesSyntaxNoInlining {
 
 // Utility class to set the following runtime flags when constructed and return
 // to their default state when destroyed:
-//   --allow-natives-syntax --noturbo-inlining
+//   --minimum-invocations-before-optimization --allow-natives-syntax
+//   --noturbo-inlining
 class AllowNativesSyntaxNoInlining {
  public:
   AllowNativesSyntaxNoInlining()
-      : allow_natives_syntax_(i::v8_flags.allow_natives_syntax),
+      : minimum_invocations_(
+            i::v8_flags.minimum_invocations_before_optimization),
+        allow_natives_syntax_(i::v8_flags.allow_natives_syntax),
         turbo_inlining_(i::v8_flags.turbo_inlining) {
+    i::v8_flags.minimum_invocations_before_optimization = 0;
     i::v8_flags.allow_natives_syntax = true;
     i::v8_flags.turbo_inlining = false;
   }
 
   ~AllowNativesSyntaxNoInlining() {
+    i::v8_flags.minimum_invocations_before_optimization = minimum_invocations_;
     i::v8_flags.allow_natives_syntax = allow_natives_syntax_;
     i::v8_flags.turbo_inlining = turbo_inlining_;
   }
 
  private:
+  int minimum_invocations_;
   bool allow_natives_syntax_;
   bool turbo_inlining_;
 };
@@ -137,7 +150,7 @@ TEST_F(DeoptimizationTest, DeoptimizeSimple) {
         "function f() { g(); };"
         "f();");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
   CheckJsInt32(1, "count", context());
 
   CHECK(!GetJSFunction("f")->HasAttachedOptimizedCode());
@@ -152,7 +165,7 @@ TEST_F(DeoptimizationTest, DeoptimizeSimple) {
         "function f(x) { if (x) { g(); } else { return } };"
         "f(true);");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CheckJsInt32(1, "count", context());
   CHECK(!GetJSFunction("f")->HasAttachedOptimizedCode());
@@ -172,7 +185,7 @@ TEST_F(DeoptimizationTest, DeoptimizeSimpleWithArguments) {
         "function f(x, y, z) { g(1,x); y+z; };"
         "f(1, \"2\", false);");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CheckJsInt32(1, "count", context());
   CHECK(!GetJSFunction("f")->HasAttachedOptimizedCode());
@@ -188,7 +201,7 @@ TEST_F(DeoptimizationTest, DeoptimizeSimpleWithArguments) {
         "function f(x, y, z) { if (x) { g(x, y); } else { return y + z; } };"
         "f(true, 1, \"2\");");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CheckJsInt32(1, "count", context());
   CHECK(!GetJSFunction("f")->HasAttachedOptimizedCode());
@@ -209,7 +222,7 @@ TEST_F(DeoptimizationTest, DeoptimizeSimpleNested) {
         "function g(z) { count++; %DeoptimizeFunction(f); return z;}"
         "function f(x,y,z) { return h(x, y, g(z)); };"
         "result = f(1, 2, 3);");
-    CollectAllGarbage();
+    InvokeMajorGC();
 
     CheckJsInt32(1, "count", context());
     CheckJsInt32(6, "result", context());
@@ -232,7 +245,7 @@ TEST_F(DeoptimizationTest, DeoptimizeRecursive) {
         "function f(x) { calls++; if (x > 0) { f(x - 1); } else { g(); } };"
         "f(10);");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CheckJsInt32(1, "count", context());
   CheckJsInt32(11, "calls", context());
@@ -262,7 +275,7 @@ TEST_F(DeoptimizationTest, DeoptimizeMultiple) {
         "function f1(x) { return f2(x + 1, x + 1) + x; };"
         "result = f1(1);");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CheckJsInt32(1, "count", context());
   CheckJsInt32(14, "result", context());
@@ -281,7 +294,7 @@ TEST_F(DeoptimizationTest, DeoptimizeConstructor) {
         "function f() {  g(); };"
         "result = new f() instanceof f;");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CheckJsInt32(1, "count", context());
   CHECK(context()
@@ -301,7 +314,7 @@ TEST_F(DeoptimizationTest, DeoptimizeConstructor) {
         "result = new f(1, 2);"
         "result = result.x + result.y;");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CheckJsInt32(1, "count", context());
   CheckJsInt32(3, "result", context());
@@ -328,7 +341,7 @@ TEST_F(DeoptimizationTest, DeoptimizeConstructorMultiple) {
         "function f1(x) { this.result = new f2(x + 1, x + 1).result + x; };"
         "result = new f1(1).result;");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CheckJsInt32(1, "count", context());
   CheckJsInt32(14, "result", context());
@@ -358,6 +371,7 @@ class DeoptimizationDisableConcurrentRecompilationTest
     // Compile function f and collect to type feedback to insert binary op stub
     // call in the optimized code.
     i::v8_flags.prepare_always_turbofan = true;
+    i::v8_flags.minimum_invocations_before_optimization = 0;
     CompileConstructorWithDeoptimizingValueOf();
     RunJS(f_source);
     RunJS(
@@ -376,7 +390,7 @@ class DeoptimizationDisableConcurrentRecompilationTest
     RunJS(
         "deopt = true;"
         "var result = f(7, new X());");
-    CollectAllGarbage();
+    InvokeMajorGC();
     CHECK(!GetJSFunction("f")->HasAttachedOptimizedCode());
   }
 };
@@ -420,7 +434,7 @@ TEST_F(DeoptimizationDisableConcurrentRecompilationTest,
         "deopt = true;"
         "var result = f('a+', new X());");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CHECK(!GetJSFunction("f")->HasAttachedOptimizedCode());
   CheckJsInt32(1, "count", context());
@@ -524,7 +538,7 @@ TEST_F(DeoptimizationDisableConcurrentRecompilationTest, DeoptimizeCompare) {
         "deopt = true;"
         "var result = f('a', new X());");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CHECK(!GetJSFunction("f")->HasAttachedOptimizedCode());
   CheckJsInt32(1, "count", context());
@@ -608,7 +622,7 @@ TEST_F(DeoptimizationDisableConcurrentRecompilationTest,
         "f2(new X(), 'z');"
         "g2(new X(), 'z');");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CHECK(!GetJSFunction("f1")->HasAttachedOptimizedCode());
   CHECK(!GetJSFunction("g1")->HasAttachedOptimizedCode());
@@ -691,7 +705,7 @@ TEST_F(DeoptimizationDisableConcurrentRecompilationTest,
         "deopt = true;"
         "var result = f1(new X());");
   }
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CHECK(!GetJSFunction("f1")->HasAttachedOptimizedCode());
   CHECK(!GetJSFunction("g1")->HasAttachedOptimizedCode());
diff --git a/deps/v8/test/unittests/diagnostics/eh-frame-iterator-unittest.cc b/deps/v8/test/unittests/diagnostics/eh-frame-iterator-unittest.cc
index 3a97c635539995..0565769499c6ee 100644
--- a/deps/v8/test/unittests/diagnostics/eh-frame-iterator-unittest.cc
+++ b/deps/v8/test/unittests/diagnostics/eh-frame-iterator-unittest.cc
@@ -20,7 +20,7 @@ class EhFrameIteratorTest : public testing::Test {};
 
 TEST_F(EhFrameIteratorTest, Values) {
   // Assuming little endian.
-  static const byte kEncoded[] = {0xDE, 0xC0, 0xAD, 0xDE, 0xEF, 0xBE, 0xFF};
+  static const uint8_t kEncoded[] = {0xDE, 0xC0, 0xAD, 0xDE, 0xEF, 0xBE, 0xFF};
   EhFrameIterator iterator(&kEncoded[0], &kEncoded[0] + sizeof(kEncoded));
   EXPECT_EQ(0xDEADC0DE, iterator.GetNextUInt32());
   EXPECT_EQ(0xBEEF, iterator.GetNextUInt16());
@@ -29,7 +29,7 @@ TEST_F(EhFrameIteratorTest, Values) {
 }
 
 TEST_F(EhFrameIteratorTest, Skip) {
-  static const byte kEncoded[] = {0xDE, 0xAD, 0xC0, 0xDE};
+  static const uint8_t kEncoded[] = {0xDE, 0xAD, 0xC0, 0xDE};
   EhFrameIterator iterator(&kEncoded[0], &kEncoded[0] + sizeof(kEncoded));
   iterator.Skip(2);
   EXPECT_EQ(2, iterator.GetCurrentOffset());
@@ -39,21 +39,21 @@ TEST_F(EhFrameIteratorTest, Skip) {
 }
 
 TEST_F(EhFrameIteratorTest, ULEB128Decoding) {
-  static const byte kEncoded[] = {0xE5, 0x8E, 0x26};
+  static const uint8_t kEncoded[] = {0xE5, 0x8E, 0x26};
   EhFrameIterator iterator(&kEncoded[0], &kEncoded[0] + sizeof(kEncoded));
   EXPECT_EQ(624485u, iterator.GetNextULeb128());
   EXPECT_TRUE(iterator.Done());
 }
 
 TEST_F(EhFrameIteratorTest, SLEB128DecodingPositive) {
-  static const byte kEncoded[] = {0xE5, 0x8E, 0x26};
+  static const uint8_t kEncoded[] = {0xE5, 0x8E, 0x26};
   EhFrameIterator iterator(&kEncoded[0], &kEncoded[0] + sizeof(kEncoded));
   EXPECT_EQ(624485, iterator.GetNextSLeb128());
   EXPECT_TRUE(iterator.Done());
 }
 
 TEST_F(EhFrameIteratorTest, SLEB128DecodingNegative) {
-  static const byte kEncoded[] = {0x9B, 0xF1, 0x59};
+  static const uint8_t kEncoded[] = {0x9B, 0xF1, 0x59};
   EhFrameIterator iterator(&kEncoded[0], &kEncoded[0] + sizeof(kEncoded));
   EXPECT_EQ(-624485, iterator.GetNextSLeb128());
   EXPECT_TRUE(iterator.Done());
diff --git a/deps/v8/test/unittests/execution/microtask-queue-unittest.cc b/deps/v8/test/unittests/execution/microtask-queue-unittest.cc
index e63793b1002a8f..e0cbd44206d286 100644
--- a/deps/v8/test/unittests/execution/microtask-queue-unittest.cc
+++ b/deps/v8/test/unittests/execution/microtask-queue-unittest.cc
@@ -258,9 +258,9 @@ TEST_P(MicrotaskQueueTest, PromiseHandlerContext) {
   Handle<Context> context2 = Utils::OpenHandle(*v8_context2, isolate());
   Handle<Context> context3 = Utils::OpenHandle(*v8_context3, isolate());
   Handle<Context> context4 = Utils::OpenHandle(*v8_context3, isolate());
-  context2->native_context().set_microtask_queue(isolate(), microtask_queue());
-  context3->native_context().set_microtask_queue(isolate(), microtask_queue());
-  context4->native_context().set_microtask_queue(isolate(), microtask_queue());
+  context2->native_context()->set_microtask_queue(isolate(), microtask_queue());
+  context3->native_context()->set_microtask_queue(isolate(), microtask_queue());
+  context4->native_context()->set_microtask_queue(isolate(), microtask_queue());
 
   Handle<JSFunction> handler;
   Handle<JSProxy> proxy;
@@ -318,17 +318,17 @@ TEST_P(MicrotaskQueueTest, PromiseHandlerContext) {
 
   ASSERT_EQ(4, microtask_queue()->size());
   Handle<Microtask> microtask1(microtask_queue()->get(0), isolate());
-  ASSERT_TRUE(microtask1->IsPromiseFulfillReactionJobTask());
+  ASSERT_TRUE(IsPromiseFulfillReactionJobTask(*microtask1));
   EXPECT_EQ(*context2,
             Handle<PromiseFulfillReactionJobTask>::cast(microtask1)->context());
 
   Handle<Microtask> microtask2(microtask_queue()->get(1), isolate());
-  ASSERT_TRUE(microtask2->IsPromiseRejectReactionJobTask());
+  ASSERT_TRUE(IsPromiseRejectReactionJobTask(*microtask2));
   EXPECT_EQ(*context2,
             Handle<PromiseRejectReactionJobTask>::cast(microtask2)->context());
 
   Handle<Microtask> microtask3(microtask_queue()->get(2), isolate());
-  ASSERT_TRUE(microtask3->IsPromiseFulfillReactionJobTask());
+  ASSERT_TRUE(IsPromiseFulfillReactionJobTask(*microtask3));
   // |microtask3| corresponds to a PromiseReaction for |revoked_proxy|.
   // As |revoked_proxy| doesn't have a context, the current context should be
   // used as the fallback context.
@@ -336,7 +336,7 @@ TEST_P(MicrotaskQueueTest, PromiseHandlerContext) {
             Handle<PromiseFulfillReactionJobTask>::cast(microtask3)->context());
 
   Handle<Microtask> microtask4(microtask_queue()->get(3), isolate());
-  ASSERT_TRUE(microtask4->IsPromiseFulfillReactionJobTask());
+  ASSERT_TRUE(IsPromiseFulfillReactionJobTask(*microtask4));
   EXPECT_EQ(*context2,
             Handle<PromiseFulfillReactionJobTask>::cast(microtask4)->context());
 
@@ -378,7 +378,7 @@ TEST_P(MicrotaskQueueTest, DetachGlobal_Run) {
   const int kNumExpectedTasks = 3;
   for (int i = 0; i < kNumExpectedTasks; ++i) {
     EXPECT_TRUE(
-        Object::GetElement(isolate(), ran, i).ToHandleChecked()->IsFalse());
+        IsFalse(*Object::GetElement(isolate(), ran, i).ToHandleChecked()));
   }
   EXPECT_EQ(kNumExpectedTasks, microtask_queue()->size());
 
@@ -392,7 +392,7 @@ TEST_P(MicrotaskQueueTest, DetachGlobal_Run) {
   EXPECT_EQ(0, microtask_queue()->size());
   for (int i = 0; i < kNumExpectedTasks; ++i) {
     EXPECT_TRUE(
-        Object::GetElement(isolate(), ran, i).ToHandleChecked()->IsFalse());
+        IsFalse(*Object::GetElement(isolate(), ran, i).ToHandleChecked()));
   }
 }
 
@@ -450,26 +450,23 @@ TEST_P(MicrotaskQueueTest, DetachGlobal_ResolveThenableForeignThen) {
 
       ASSERT_EQ(0, microtask_queue()->size());
       ASSERT_EQ(0, sub_microtask_queue->size());
-      ASSERT_TRUE(Object::GetElement(isolate(), result, 0)
-                      .ToHandleChecked()
-                      ->IsFalse());
+      ASSERT_TRUE(
+          IsFalse(*Object::GetElement(isolate(), result, 0).ToHandleChecked()));
 
       // With a regular thenable, a microtask is queued on the sub-context.
       RunJS<JSPromise>("Promise.resolve({ then: cb => cb(1) })");
       EXPECT_EQ(0, microtask_queue()->size());
       EXPECT_EQ(1, sub_microtask_queue->size());
-      EXPECT_TRUE(Object::GetElement(isolate(), result, 0)
-                      .ToHandleChecked()
-                      ->IsFalse());
+      EXPECT_TRUE(
+          IsFalse(*Object::GetElement(isolate(), result, 0).ToHandleChecked()));
 
       // But when the `then` method comes from another context, a microtask is
       // instead queued on the main context.
       stale_promise = RunJS<JSPromise>("Promise.resolve({ then })");
       EXPECT_EQ(1, microtask_queue()->size());
       EXPECT_EQ(1, sub_microtask_queue->size());
-      EXPECT_TRUE(Object::GetElement(isolate(), result, 0)
-                      .ToHandleChecked()
-                      ->IsFalse());
+      EXPECT_TRUE(
+          IsFalse(*Object::GetElement(isolate(), result, 0).ToHandleChecked()));
     }
 
     sub_context->DetachGlobal();
@@ -477,12 +474,12 @@ TEST_P(MicrotaskQueueTest, DetachGlobal_ResolveThenableForeignThen) {
 
   EXPECT_EQ(1, microtask_queue()->size());
   EXPECT_TRUE(
-      Object::GetElement(isolate(), result, 0).ToHandleChecked()->IsFalse());
+      IsFalse(*Object::GetElement(isolate(), result, 0).ToHandleChecked()));
 
   EXPECT_EQ(1, microtask_queue()->RunMicrotasks(isolate()));
   EXPECT_EQ(0, microtask_queue()->size());
   EXPECT_TRUE(
-      Object::GetElement(isolate(), result, 0).ToHandleChecked()->IsTrue());
+      IsTrue(*Object::GetElement(isolate(), result, 0).ToHandleChecked()));
 }
 
 TEST_P(MicrotaskQueueTest, DetachGlobal_HandlerContext) {
@@ -588,14 +585,14 @@ TEST_P(MicrotaskQueueTest, DetachGlobal_Chain) {
       "result");
   microtask_queue()->RunMicrotasks(isolate());
   EXPECT_TRUE(
-      Object::GetElement(isolate(), result, 0).ToHandleChecked()->IsTrue());
+      IsTrue(*Object::GetElement(isolate(), result, 0).ToHandleChecked()));
 }
 
 TEST_P(MicrotaskQueueTest, DetachGlobal_InactiveHandler) {
   Local<v8::Context> sub_context = v8::Context::New(v8_isolate());
   Utils::OpenHandle(*sub_context)
       ->native_context()
-      .set_microtask_queue(isolate(), microtask_queue());
+      ->set_microtask_queue(isolate(), microtask_queue());
 
   Handle<JSArray> result;
   Handle<JSFunction> stale_handler;
@@ -628,9 +625,9 @@ TEST_P(MicrotaskQueueTest, DetachGlobal_InactiveHandler) {
 
   microtask_queue()->RunMicrotasks(isolate());
   EXPECT_TRUE(
-      Object::GetElement(isolate(), result, 0).ToHandleChecked()->IsFalse());
+      IsFalse(*Object::GetElement(isolate(), result, 0).ToHandleChecked()));
   EXPECT_TRUE(
-      Object::GetElement(isolate(), result, 1).ToHandleChecked()->IsFalse());
+      IsFalse(*Object::GetElement(isolate(), result, 1).ToHandleChecked()));
 }
 
 TEST_P(MicrotaskQueueTest, MicrotasksScope) {
diff --git a/deps/v8/test/unittests/execution/pointer-auth-arm64-unittest.cc b/deps/v8/test/unittests/execution/pointer-auth-arm64-unittest.cc
new file mode 100644
index 00000000000000..188db280ffeec1
--- /dev/null
+++ b/deps/v8/test/unittests/execution/pointer-auth-arm64-unittest.cc
@@ -0,0 +1,232 @@
+// Copyright 2019 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/codegen/arm64/decoder-arm64-inl.h"
+#include "src/execution/arm64/simulator-arm64.h"
+#include "src/execution/pointer-authentication.h"
+#include "test/unittests/test-utils.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+#ifdef V8_OS_LINUX
+
+#include <sys/prctl.h>  // for prctl
+
+#ifndef PR_PAC_APIBKEY
+#define PR_PAC_APIBKEY (1UL << 1)
+#endif
+
+#ifndef PR_PAC_GET_ENABLED_KEYS
+#define PR_PAC_GET_ENABLED_KEYS 61
+#endif
+
+#endif
+
+namespace v8 {
+namespace internal {
+
+namespace {
+Address SignPCForTesting(Isolate* isolate, Address pc, Address sp) {
+  if constexpr (!ENABLE_CONTROL_FLOW_INTEGRITY_BOOL) return pc;
+
+#ifdef USE_SIMULATOR
+  pc = Simulator::AddPAC(pc, sp, Simulator::kPACKeyIB,
+                         Simulator::kInstructionPointer);
+#else
+  asm volatile(
+      "  mov x17, %[pc]\n"
+      "  mov x16, %[sp]\n"
+      "  pacib1716\n"
+      "  mov %[pc], x17\n"
+      : [pc] "+r"(pc)
+      : [sp] "r"(sp)
+      : "x16", "x17");
+#endif
+  return pc;
+}
+
+void FunctionToUseForPointerAuthentication() { PrintF("hello, "); }
+void AlternativeFunctionToUseForPointerAuthentication() { PrintF("world\n"); }
+
+Address GetRawCodeAddress() {
+  return PointerAuthentication::StripPAC(
+      reinterpret_cast<Address>(&FunctionToUseForPointerAuthentication));
+}
+
+Address GetAlternativeRawCodeAddress() {
+  return PointerAuthentication::StripPAC(reinterpret_cast<Address>(
+      &AlternativeFunctionToUseForPointerAuthentication));
+}
+
+// If the platform supports it, corrupt the PAC of |address| so that
+// authenticating it will cause a crash.
+base::Optional<Address> CorruptPACIfSupported(Isolate* isolate,
+                                              Address address) {
+  if constexpr (!ENABLE_CONTROL_FLOW_INTEGRITY_BOOL) return base::nullopt;
+
+  // First, find where in an address the PAC is located.
+
+  // Produce a valid user address with all bits sets. This way, stripping the
+  // PAC from the address will reveal which bits are used for it. We need to
+  // clear the TTBR bit, as it differentiates between user and kernel addresses.
+  Address user_address_all_ones = 0xffff'ffff'ffff'ffff & ~kTTBRMask;
+  Address pac_mask = PointerAuthentication::StripPAC(user_address_all_ones) ^
+                     user_address_all_ones;
+
+  // If the PAC bits are zero then StripPAC() was a no-op. This means pointer
+  // authentication isn't supported.
+  if (pac_mask == 0) {
+    return base::nullopt;
+  }
+
+  // At this point, pointer authentication is supported, but individual keys
+  // may still be disabled by the OS. We check that it's enabled, to ensure
+  // that corrupting the PAC will result in a crash.
+
+#if defined(V8_OS_LINUX) && defined(V8_HOST_ARCH_ARM64)
+  // On Linux 5.13 and later, we can ask the OS what keys are enabled directly.
+  int enabled_keys = prctl(PR_PAC_GET_ENABLED_KEYS, 0, 0, 0, 0);
+  if ((enabled_keys != -1) &&
+      ((enabled_keys & PR_PAC_APIBKEY) == PR_PAC_APIBKEY)) {
+    return address ^ pac_mask;
+  }
+#endif
+
+  // Do a "best-effort" check to see if PAC is enabled, by signing values on the
+  // stack and check if bits are set in the PAC range. We do this check a few
+  // times because 0 is a valid PAC.
+
+  Address stack[] = {0xa, 0xb, 0xc, 0xd};
+  for (int slot = 0; slot < 4; slot++) {
+    stack[slot] = SignPCForTesting(isolate, stack[slot],
+                                   reinterpret_cast<Address>(&stack[slot]));
+    if ((stack[slot] & pac_mask) != 0) return address ^ pac_mask;
+  }
+
+  // None of the slots were signed with a non-zero PAC, assume this means PAC
+  // isn't enabled.
+  return base::nullopt;
+}
+
+}  // namespace
+
+using PointerAuthArm64Test = TestWithIsolate;
+
+TEST_F(PointerAuthArm64Test, AuthenticatePC) {
+  Address pc = GetRawCodeAddress();
+  Address stack = 0;
+
+  stack = SignPCForTesting(i_isolate(), pc, reinterpret_cast<Address>(&stack));
+
+  pc = PointerAuthentication::AuthenticatePC(&stack, 0);
+  EXPECT_EQ(pc, GetRawCodeAddress());
+
+  if (auto corrupted_stack = CorruptPACIfSupported(i_isolate(), stack)) {
+    stack = *corrupted_stack;
+    EXPECT_DEATH_IF_SUPPORTED(PointerAuthentication::AuthenticatePC(&stack, 0),
+                              "");
+  }
+}
+
+TEST_F(PointerAuthArm64Test, ReplacePC) {
+  Address pc = GetRawCodeAddress();
+  Address stack = 0;
+
+  stack = SignPCForTesting(i_isolate(), pc, reinterpret_cast<Address>(&stack));
+
+  PointerAuthentication::ReplacePC(&stack, GetAlternativeRawCodeAddress(), 0);
+
+  if (auto corrupted_stack = CorruptPACIfSupported(i_isolate(), stack)) {
+    stack = *corrupted_stack;
+    EXPECT_DEATH_IF_SUPPORTED(PointerAuthentication::ReplacePC(
+                                  &stack, GetAlternativeRawCodeAddress(), 0),
+                              "");
+  }
+}
+
+TEST_F(PointerAuthArm64Test, ReplacePCAfterGC) {
+  v8::PageAllocator* page_allocator = v8::internal::GetPlatformPageAllocator();
+  size_t page_size = v8::internal::AllocatePageSize();
+
+  // Allocate a page and mark it inaccessible, to simulate a code address to a
+  // page that was reclaimed after a GC.
+  Address pc = reinterpret_cast<Address>(v8::internal::AllocatePages(
+      page_allocator, page_allocator->GetRandomMmapAddr(), page_size, page_size,
+      PageAllocator::Permission::kReadWrite));
+  CHECK(SetPermissions(page_allocator, pc, page_size,
+                       PageAllocator::Permission::kNoAccess));
+
+  // Replacing the signed PC on the stack should work even when the previous PC
+  // points to an inaccessible page.
+
+  Address stack = 0;
+  stack = SignPCForTesting(i_isolate(), pc, reinterpret_cast<Address>(&stack));
+
+  PointerAuthentication::ReplacePC(&stack, GetRawCodeAddress(), 0);
+}
+
+#ifdef USE_SIMULATOR
+TEST_F(PointerAuthArm64Test, SimulatorComputePAC) {
+  Decoder<DispatchingDecoderVisitor>* decoder =
+      new Decoder<DispatchingDecoderVisitor>();
+  Simulator simulator(decoder);
+
+  uint64_t data1 = 0xfb623599da6e8127;
+  uint64_t data2 = 0x27979fadf7d53cb7;
+  uint64_t context = 0x477d469dec0b8762;
+  Simulator::PACKey key = {0x84be85ce9804e94b, 0xec2802d4e0a488e9, -1};
+
+  uint64_t pac1 = simulator.ComputePAC(data1, context, key);
+  uint64_t pac2 = simulator.ComputePAC(data2, context, key);
+
+  // NOTE: If the PAC implementation is changed, this may fail due to a hash
+  // collision.
+  CHECK_NE(pac1, pac2);
+}
+
+TEST_F(PointerAuthArm64Test, SimulatorAddAndAuthPAC) {
+  i::v8_flags.sim_abort_on_bad_auth = false;
+  Decoder<DispatchingDecoderVisitor>* decoder =
+      new Decoder<DispatchingDecoderVisitor>();
+  Simulator simulator(decoder);
+
+  uint64_t ptr = 0x0000000012345678;
+  uint64_t context = 0x477d469dec0b8762;
+  Simulator::PACKey key_a = {0x84be85ce9804e94b, 0xec2802d4e0a488e9, 0};
+  Simulator::PACKey key_b = {0xec1119e288704d13, 0xd7f6b76e1cea585e, 1};
+
+  uint64_t ptr_a =
+      simulator.AddPAC(ptr, context, key_a, Simulator::kInstructionPointer);
+
+  // Attempt to authenticate the pointer with PAC using different keys.
+  uint64_t success =
+      simulator.AuthPAC(ptr_a, context, key_a, Simulator::kInstructionPointer);
+  uint64_t fail =
+      simulator.AuthPAC(ptr_a, context, key_b, Simulator::kInstructionPointer);
+
+  uint64_t pac_mask =
+      simulator.CalculatePACMask(ptr, Simulator::kInstructionPointer, 0);
+
+  // NOTE: If the PAC implementation is changed, this may fail due to a hash
+  // collision.
+  CHECK_NE((ptr_a & pac_mask), 0);
+  CHECK_EQ(success, ptr);
+  CHECK_NE(fail, ptr);
+}
+
+TEST_F(PointerAuthArm64Test, SimulatorAddAndStripPAC) {
+  Decoder<DispatchingDecoderVisitor>* decoder =
+      new Decoder<DispatchingDecoderVisitor>();
+  Simulator simulator(decoder);
+
+  uint64_t ptr = 0xff00000012345678;
+  uint64_t pac_mask =
+      simulator.CalculatePACMask(ptr, Simulator::kInstructionPointer, 0);
+  uint64_t ptr_a = ptr | pac_mask;
+
+  CHECK_EQ(simulator.StripPAC(ptr_a, Simulator::kInstructionPointer), ptr);
+}
+#endif  // USE_SIMULATOR
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/test/unittests/execution/thread-termination-unittest.cc b/deps/v8/test/unittests/execution/thread-termination-unittest.cc
index c05cb4c96f1a00..4c7c23c304f4d5 100644
--- a/deps/v8/test/unittests/execution/thread-termination-unittest.cc
+++ b/deps/v8/test/unittests/execution/thread-termination-unittest.cc
@@ -55,7 +55,10 @@ class TerminatorThread : public base::Thread {
   Isolate* isolate_;
 };
 
-void Signal(const FunctionCallbackInfo<Value>& args) { semaphore->Signal(); }
+void Signal(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  semaphore->Signal();
+}
 
 MaybeLocal<Value> CompileRun(Local<Context> context, Local<String> source) {
   Local<Script> script = Script::Compile(context, source).ToLocalChecked();
@@ -68,10 +71,11 @@ MaybeLocal<Value> CompileRun(Local<Context> context, const char* source) {
       String::NewFromUtf8(context->GetIsolate(), source).ToLocalChecked());
 }
 
-void DoLoop(const FunctionCallbackInfo<Value>& args) {
-  TryCatch try_catch(args.GetIsolate());
-  CHECK(!args.GetIsolate()->IsExecutionTerminating());
-  MaybeLocal<Value> result = CompileRun(args.GetIsolate()->GetCurrentContext(),
+void DoLoop(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  TryCatch try_catch(info.GetIsolate());
+  CHECK(!info.GetIsolate()->IsExecutionTerminating());
+  MaybeLocal<Value> result = CompileRun(info.GetIsolate()->GetCurrentContext(),
                                         "function f() {"
                                         "  var term = true;"
                                         "  try {"
@@ -90,23 +94,25 @@ void DoLoop(const FunctionCallbackInfo<Value>& args) {
   CHECK(try_catch.Exception()->IsNull());
   CHECK(try_catch.Message().IsEmpty());
   CHECK(!try_catch.CanContinue());
-  CHECK(args.GetIsolate()->IsExecutionTerminating());
+  CHECK(info.GetIsolate()->IsExecutionTerminating());
 }
 
-void Fail(const FunctionCallbackInfo<Value>& args) { UNREACHABLE(); }
+void Fail(const FunctionCallbackInfo<Value>& info) { UNREACHABLE(); }
 
-void Loop(const FunctionCallbackInfo<Value>& args) {
-  CHECK(!args.GetIsolate()->IsExecutionTerminating());
+void Loop(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(!info.GetIsolate()->IsExecutionTerminating());
   MaybeLocal<Value> result =
-      CompileRun(args.GetIsolate()->GetCurrentContext(),
+      CompileRun(info.GetIsolate()->GetCurrentContext(),
                  "try { doloop(); fail(); } catch(e) { fail(); }");
   CHECK(result.IsEmpty());
-  CHECK(args.GetIsolate()->IsExecutionTerminating());
+  CHECK(info.GetIsolate()->IsExecutionTerminating());
 }
 
-void TerminateCurrentThread(const FunctionCallbackInfo<Value>& args) {
-  CHECK(!args.GetIsolate()->IsExecutionTerminating());
-  args.GetIsolate()->TerminateExecution();
+void TerminateCurrentThread(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(!info.GetIsolate()->IsExecutionTerminating());
+  info.GetIsolate()->TerminateExecution();
 }
 
 class ThreadTerminationTest : public TestWithIsolate {
@@ -153,10 +159,11 @@ class ThreadTerminationTest : public TestWithIsolate {
   }
 };
 
-void DoLoopNoCall(const FunctionCallbackInfo<Value>& args) {
-  TryCatch try_catch(args.GetIsolate());
-  CHECK(!args.GetIsolate()->IsExecutionTerminating());
-  MaybeLocal<Value> result = CompileRun(args.GetIsolate()->GetCurrentContext(),
+void DoLoopNoCall(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  TryCatch try_catch(info.GetIsolate());
+  CHECK(!info.GetIsolate()->IsExecutionTerminating());
+  MaybeLocal<Value> result = CompileRun(info.GetIsolate()->GetCurrentContext(),
                                         "var term = true;"
                                         "while(true) {"
                                         "  if (term) terminate();"
@@ -167,7 +174,7 @@ void DoLoopNoCall(const FunctionCallbackInfo<Value>& args) {
   CHECK(try_catch.Exception()->IsNull());
   CHECK(try_catch.Message().IsEmpty());
   CHECK(!try_catch.CanContinue());
-  CHECK(args.GetIsolate()->IsExecutionTerminating());
+  CHECK(info.GetIsolate()->IsExecutionTerminating());
 }
 
 // Test that a single thread of JavaScript execution can terminate
@@ -292,11 +299,12 @@ TEST_F(ThreadTerminationTest, TerminateBigIntFromString) {
       "fail();\n");
 }
 
-void LoopGetProperty(const FunctionCallbackInfo<Value>& args) {
-  TryCatch try_catch(args.GetIsolate());
-  CHECK(!args.GetIsolate()->IsExecutionTerminating());
+void LoopGetProperty(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  TryCatch try_catch(info.GetIsolate());
+  CHECK(!info.GetIsolate()->IsExecutionTerminating());
   MaybeLocal<Value> result =
-      CompileRun(args.GetIsolate()->GetCurrentContext(),
+      CompileRun(info.GetIsolate()->GetCurrentContext(),
                  "function f() {"
                  "  try {"
                  "    while(true) {"
@@ -314,24 +322,25 @@ void LoopGetProperty(const FunctionCallbackInfo<Value>& args) {
   CHECK(try_catch.Exception()->IsNull());
   CHECK(try_catch.Message().IsEmpty());
   CHECK(!try_catch.CanContinue());
-  CHECK(args.GetIsolate()->IsExecutionTerminating());
+  CHECK(info.GetIsolate()->IsExecutionTerminating());
 }
 
 int call_count = 0;
 
-void TerminateOrReturnObject(const FunctionCallbackInfo<Value>& args) {
+void TerminateOrReturnObject(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   if (++call_count == 10) {
-    CHECK(!args.GetIsolate()->IsExecutionTerminating());
-    args.GetIsolate()->TerminateExecution();
+    CHECK(!info.GetIsolate()->IsExecutionTerminating());
+    info.GetIsolate()->TerminateExecution();
     return;
   }
-  Local<Object> result = Object::New(args.GetIsolate());
-  Local<Context> context = args.GetIsolate()->GetCurrentContext();
+  Local<Object> result = Object::New(info.GetIsolate());
+  Local<Context> context = info.GetIsolate()->GetCurrentContext();
   Maybe<bool> val = result->Set(
       context, String::NewFromUtf8(context->GetIsolate(), "x").ToLocalChecked(),
-      Integer::New(args.GetIsolate(), 42));
+      Integer::New(info.GetIsolate(), 42));
   CHECK(val.FromJust());
-  args.GetReturnValue().Set(result);
+  info.GetReturnValue().Set(result);
 }
 
 // Test that we correctly handle termination exceptions if they are
@@ -363,9 +372,10 @@ TEST_F(ThreadTerminationTest, TerminateLoadICException) {
 Persistent<String> reenter_script_1;
 Persistent<String> reenter_script_2;
 
-void ReenterAfterTermination(const FunctionCallbackInfo<Value>& args) {
-  TryCatch try_catch(args.GetIsolate());
-  Isolate* isolate = args.GetIsolate();
+void ReenterAfterTermination(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  TryCatch try_catch(info.GetIsolate());
+  Isolate* isolate = info.GetIsolate();
   CHECK(!isolate->IsExecutionTerminating());
   Local<String> script = Local<String>::New(isolate, reenter_script_1);
   MaybeLocal<Value> result =
@@ -455,8 +465,9 @@ TEST_F(ThreadTerminationTest,
   reenter_script_2.Reset();
 }
 
-void DoLoopCancelTerminate(const FunctionCallbackInfo<Value>& args) {
-  Isolate* isolate = args.GetIsolate();
+void DoLoopCancelTerminate(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  Isolate* isolate = info.GetIsolate();
   TryCatch try_catch(isolate);
   CHECK(!isolate->IsExecutionTerminating());
   MaybeLocal<Value> result = CompileRun(isolate->GetCurrentContext(),
@@ -500,6 +511,7 @@ void MicrotaskShouldNotRun(const FunctionCallbackInfo<Value>& info) {
 }
 
 void MicrotaskLoopForever(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
   Isolate* isolate = info.GetIsolate();
   HandleScope scope(isolate);
   // Enqueue another should-not-run task to ensure we clean out the queue
@@ -703,9 +715,10 @@ TEST_F(ThreadTerminationTest, SafeForTerminateException) {
   }    // postpone -> no scope
 }
 
-void RequestTermianteAndCallAPI(const FunctionCallbackInfo<Value>& args) {
-  args.GetIsolate()->TerminateExecution();
-  AssertFinishedCodeRun(args.GetIsolate());
+void RequestTermianteAndCallAPI(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  info.GetIsolate()->TerminateExecution();
+  AssertFinishedCodeRun(info.GetIsolate());
 }
 
 TEST_F(TestWithPlatform, IsolateSafeForTerminationMode) {
@@ -780,9 +793,10 @@ TEST_F(ThreadTerminationTest, ErrorObjectAfterTermination) {
   CHECK(error->IsNativeError());
 }
 
-void InnerTryCallTerminate(const FunctionCallbackInfo<Value>& args) {
-  CHECK(!args.GetIsolate()->IsExecutionTerminating());
-  Isolate* isolate = args.GetIsolate();
+void InnerTryCallTerminate(const FunctionCallbackInfo<Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+  CHECK(!info.GetIsolate()->IsExecutionTerminating());
+  Isolate* isolate = info.GetIsolate();
   Local<Object> global = isolate->GetCurrentContext()->Global();
   Local<Function> loop = Local<Function>::Cast(
       global
@@ -797,7 +811,7 @@ void InnerTryCallTerminate(const FunctionCallbackInfo<Value>& args) {
   CHECK(result.is_null());
   CHECK(exception.is_null());
   // TryCall reschedules the termination exception.
-  CHECK(args.GetIsolate()->IsExecutionTerminating());
+  CHECK(info.GetIsolate()->IsExecutionTerminating());
 }
 
 TEST_F(ThreadTerminationTest, TerminationInInnerTryCall) {
@@ -857,7 +871,7 @@ TEST_F(ThreadTerminationTest, TerminateAndTryCall) {
 
 class ConsoleImpl : public debug::ConsoleDelegate {
  private:
-  void Log(const debug::ConsoleCallArguments& args,
+  void Log(const debug::ConsoleCallArguments& info,
            const debug::ConsoleContext&) override {
     CompileRun(Isolate::GetCurrent()->GetCurrentContext(), "1 + 1");
   }
diff --git a/deps/v8/test/unittests/heap/base/bytes-unittest.cc b/deps/v8/test/unittests/heap/base/bytes-unittest.cc
new file mode 100644
index 00000000000000..6fc32ed7fe159d
--- /dev/null
+++ b/deps/v8/test/unittests/heap/base/bytes-unittest.cc
@@ -0,0 +1,98 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/base/bytes.h"
+
+#include "src/base/optional.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace heap::base {
+
+TEST(BytesAndDurationTest, MakeBytesAndDuration) {
+  const auto bad =
+      BytesAndDuration(17, v8::base::TimeDelta::FromMilliseconds(35));
+  EXPECT_EQ(bad.bytes, 17u);
+  EXPECT_EQ(bad.duration.InMilliseconds(), 35);
+}
+
+TEST(BytesAndDurationTest, InitialAsAverage) {
+  BytesAndDurationBuffer buffer;
+  EXPECT_DOUBLE_EQ(
+      100.0 / 2,
+      AverageSpeed(
+          buffer,
+          BytesAndDuration(100, v8::base::TimeDelta::FromMilliseconds(2)),
+          v8::base::nullopt));
+}
+
+TEST(BytesAndDurationTest, SelectedDuration) {
+  BytesAndDurationBuffer buffer;
+  // The entry will be ignored because of the selected duration below filtering
+  // for the last 2ms.
+  buffer.Push(BytesAndDuration(100, v8::base::TimeDelta::FromMilliseconds(8)));
+  EXPECT_DOUBLE_EQ(
+      100.0 / 2,
+      AverageSpeed(
+          buffer,
+          BytesAndDuration(100, v8::base::TimeDelta::FromMilliseconds(2)),
+          v8::base::TimeDelta::FromMilliseconds(2)));
+}
+
+TEST(BytesAndDurationTest, Empty) {
+  BytesAndDurationBuffer buffer;
+  EXPECT_DOUBLE_EQ(0.0,
+                   AverageSpeed(buffer, BytesAndDuration(), v8::base::nullopt));
+}
+
+TEST(BytesAndDurationTest, Clear) {
+  BytesAndDurationBuffer buffer;
+  buffer.Push(BytesAndDuration(100, v8::base::TimeDelta::FromMilliseconds(2)));
+  EXPECT_DOUBLE_EQ(100.0 / 2,
+                   AverageSpeed(buffer, BytesAndDuration(), v8::base::nullopt));
+  buffer.Clear();
+  EXPECT_DOUBLE_EQ(0.0,
+                   AverageSpeed(buffer, BytesAndDuration(), v8::base::nullopt));
+}
+
+TEST(BytesAndDurationTest, MaxSpeed) {
+  BytesAndDurationBuffer buffer;
+  static constexpr size_t kMaxBytesPerMs = 1024;
+  buffer.Push(BytesAndDuration(kMaxBytesPerMs,
+                               v8::base::TimeDelta::FromMillisecondsD(0.5)));
+  const double bounded_speed = AverageSpeed(
+      buffer, BytesAndDuration(), v8::base::nullopt, 0, kMaxBytesPerMs);
+  EXPECT_DOUBLE_EQ(double{kMaxBytesPerMs}, bounded_speed);
+}
+
+TEST(BytesAndDurationTest, MinSpeed) {
+  BytesAndDurationBuffer buffer;
+  static constexpr size_t kMinBytesPerMs = 1;
+  buffer.Push(BytesAndDuration(kMinBytesPerMs,
+                               v8::base::TimeDelta::FromMillisecondsD(2)));
+  const double bounded_speed = AverageSpeed(buffer, BytesAndDuration(),
+                                            v8::base::nullopt, kMinBytesPerMs);
+  EXPECT_DOUBLE_EQ(double{kMinBytesPerMs}, bounded_speed);
+}
+
+TEST(BytesAndDurationTest, RingBufferAverage) {
+  BytesAndDurationBuffer buffer;
+  size_t sum = 0;
+  for (size_t i = 0; i < BytesAndDurationBuffer::kSize; ++i) {
+    sum += i + 1;
+    buffer.Push(
+        BytesAndDuration(i + 1, v8::base::TimeDelta::FromMillisecondsD(1)));
+    EXPECT_DOUBLE_EQ(
+        static_cast<double>(sum) / (i + 1),
+        AverageSpeed(buffer, BytesAndDuration(), v8::base::nullopt));
+  }
+  EXPECT_DOUBLE_EQ(static_cast<double>(sum) / BytesAndDurationBuffer::kSize,
+                   AverageSpeed(buffer, BytesAndDuration(), v8::base::nullopt));
+  // Overflow the ring buffer.
+  buffer.Push(BytesAndDuration(100, v8::base::TimeDelta::FromMilliseconds(1)));
+  EXPECT_DOUBLE_EQ(
+      static_cast<double>(sum + 100 - 1) / BytesAndDurationBuffer::kSize,
+      AverageSpeed(buffer, BytesAndDuration(), v8::base::nullopt));
+}
+
+}  // namespace heap::base
diff --git a/deps/v8/test/unittests/heap/base/incremental-marking-schedule-unittest.cc b/deps/v8/test/unittests/heap/base/incremental-marking-schedule-unittest.cc
new file mode 100644
index 00000000000000..f923c16ba98fee
--- /dev/null
+++ b/deps/v8/test/unittests/heap/base/incremental-marking-schedule-unittest.cc
@@ -0,0 +1,148 @@
+// Copyright 2020 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/base/incremental-marking-schedule.h"
+
+#include "src/base/platform/time.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace heap::base {
+
+namespace {
+
+constexpr size_t kZeroBytesStep = 0;
+
+class IncrementalMarkingScheduleTest : public ::testing::Test {
+ public:
+  static constexpr size_t kEstimatedLiveSize =
+      100 *
+      IncrementalMarkingSchedule::kDefaultMinimumMarkedBytesPerIncrementalStep;
+};
+
+const v8::base::TimeDelta kHalfEstimatedMarkingTime =
+    v8::base::TimeDelta::FromMillisecondsD(
+        IncrementalMarkingSchedule::kEstimatedMarkingTime.InMillisecondsF() *
+        0.5);
+
+}  // namespace
+
+TEST_F(IncrementalMarkingScheduleTest, FirstStepReturnsDefaultDuration) {
+  auto schedule =
+      IncrementalMarkingSchedule::CreateWithDefaultMinimumMarkedBytesPerStep();
+  schedule->NotifyIncrementalMarkingStart();
+  schedule->SetElapsedTimeForTesting(v8::base::TimeDelta::FromMilliseconds(0));
+  EXPECT_EQ(
+      IncrementalMarkingSchedule::kDefaultMinimumMarkedBytesPerIncrementalStep,
+      schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+}
+
+TEST_F(IncrementalMarkingScheduleTest, EmptyStepDuration) {
+  auto schedule =
+      IncrementalMarkingSchedule::CreateWithZeroMinimumMarkedBytesPerStep();
+  schedule->NotifyIncrementalMarkingStart();
+  schedule->SetElapsedTimeForTesting(v8::base::TimeDelta::FromMilliseconds(0));
+  // Make some progress on the marker to avoid returning step size for no
+  // progress.
+  schedule->UpdateMutatorThreadMarkedBytes(
+      IncrementalMarkingSchedule::kStepSizeWhenNotMakingProgress);
+  EXPECT_EQ(kZeroBytesStep,
+            schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+}
+
+// If marking is not behind schedule and very small time passed between steps
+// the oracle should return the minimum step duration.
+TEST_F(IncrementalMarkingScheduleTest, NoTimePassedReturnsMinimumDuration) {
+  auto schedule =
+      IncrementalMarkingSchedule::CreateWithDefaultMinimumMarkedBytesPerStep();
+  schedule->NotifyIncrementalMarkingStart();
+  // Add incrementally marked bytes to tell oracle this is not the first step.
+  schedule->UpdateMutatorThreadMarkedBytes(
+      IncrementalMarkingSchedule::kDefaultMinimumMarkedBytesPerIncrementalStep);
+  schedule->SetElapsedTimeForTesting(v8::base::TimeDelta::FromMilliseconds(0));
+  EXPECT_EQ(
+      IncrementalMarkingSchedule::kDefaultMinimumMarkedBytesPerIncrementalStep,
+      schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+}
+
+TEST_F(IncrementalMarkingScheduleTest, OracleDoesntExccedMaximumStepDuration) {
+  auto schedule =
+      IncrementalMarkingSchedule::CreateWithDefaultMinimumMarkedBytesPerStep();
+  schedule->NotifyIncrementalMarkingStart();
+  // Add incrementally marked bytes to tell oracle this is not the first step.
+  // Add at least `kStepSizeWhenNotMakingProgress` bytes or otherwise we'd get
+  // the step size for not making progress.
+  static constexpr size_t kMarkedBytes =
+      IncrementalMarkingSchedule::kStepSizeWhenNotMakingProgress;
+  schedule->UpdateMutatorThreadMarkedBytes(kMarkedBytes);
+  schedule->SetElapsedTimeForTesting(
+      IncrementalMarkingSchedule::kEstimatedMarkingTime);
+  EXPECT_EQ(kEstimatedLiveSize - kMarkedBytes,
+            schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+}
+
+TEST_F(IncrementalMarkingScheduleTest, AheadOfScheduleReturnsMinimumDuration) {
+  auto schedule =
+      IncrementalMarkingSchedule::CreateWithDefaultMinimumMarkedBytesPerStep();
+  schedule->NotifyIncrementalMarkingStart();
+  // Add incrementally marked bytes to tell oracle this is not the first step.
+  schedule->UpdateMutatorThreadMarkedBytes(
+      IncrementalMarkingSchedule::kDefaultMinimumMarkedBytesPerIncrementalStep);
+  schedule->AddConcurrentlyMarkedBytes(0.6 * kEstimatedLiveSize);
+  schedule->SetElapsedTimeForTesting(kHalfEstimatedMarkingTime);
+  EXPECT_EQ(
+      IncrementalMarkingSchedule::kDefaultMinimumMarkedBytesPerIncrementalStep,
+      schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+}
+
+TEST_F(IncrementalMarkingScheduleTest,
+       AheadOfScheduleReturnsMinimumDurationZeroStep) {
+  auto schedule =
+      IncrementalMarkingSchedule::CreateWithZeroMinimumMarkedBytesPerStep();
+  schedule->NotifyIncrementalMarkingStart();
+  // Add incrementally marked bytes to tell oracle this is not the first step.
+  schedule->UpdateMutatorThreadMarkedBytes(
+      IncrementalMarkingSchedule::kDefaultMinimumMarkedBytesPerIncrementalStep);
+  schedule->AddConcurrentlyMarkedBytes(0.6 * kEstimatedLiveSize);
+  schedule->SetElapsedTimeForTesting(kHalfEstimatedMarkingTime);
+  EXPECT_EQ(kZeroBytesStep,
+            schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+}
+
+TEST_F(IncrementalMarkingScheduleTest, BehindScheduleReturnsDelta) {
+  auto schedule =
+      IncrementalMarkingSchedule::CreateWithDefaultMinimumMarkedBytesPerStep();
+  schedule->NotifyIncrementalMarkingStart();
+  schedule->UpdateMutatorThreadMarkedBytes(0.1 * kEstimatedLiveSize);
+  schedule->AddConcurrentlyMarkedBytes(0.25 * kEstimatedLiveSize);
+  schedule->SetElapsedTimeForTesting(kHalfEstimatedMarkingTime);
+  EXPECT_EQ(0.15 * kEstimatedLiveSize,
+            schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+  schedule->AddConcurrentlyMarkedBytes(0.05 * kEstimatedLiveSize);
+  schedule->SetElapsedTimeForTesting(kHalfEstimatedMarkingTime);
+  EXPECT_EQ(0.1 * kEstimatedLiveSize,
+            schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+  schedule->AddConcurrentlyMarkedBytes(0.05 * kEstimatedLiveSize);
+  schedule->SetElapsedTimeForTesting(kHalfEstimatedMarkingTime);
+  EXPECT_EQ(0.05 * kEstimatedLiveSize,
+            schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize));
+}
+
+TEST_F(IncrementalMarkingScheduleTest, GetCurrentStepInfo) {
+  auto schedule =
+      IncrementalMarkingSchedule::CreateWithDefaultMinimumMarkedBytesPerStep();
+  schedule->NotifyIncrementalMarkingStart();
+  schedule->UpdateMutatorThreadMarkedBytes(0.3 * kEstimatedLiveSize);
+  schedule->AddConcurrentlyMarkedBytes(0.4 * kEstimatedLiveSize);
+  schedule->SetElapsedTimeForTesting(kHalfEstimatedMarkingTime);
+  schedule->GetNextIncrementalStepDuration(kEstimatedLiveSize);
+  const auto step_info = schedule->GetCurrentStepInfo();
+  EXPECT_EQ(step_info.elapsed_time, kHalfEstimatedMarkingTime);
+  EXPECT_EQ(step_info.mutator_marked_bytes, 0.3 * kEstimatedLiveSize);
+  EXPECT_EQ(step_info.concurrent_marked_bytes, 0.4 * kEstimatedLiveSize);
+  EXPECT_EQ(step_info.marked_bytes(), 0.7 * kEstimatedLiveSize);
+  EXPECT_EQ(step_info.estimated_live_bytes, kEstimatedLiveSize);
+  EXPECT_NE(step_info.scheduled_delta_bytes(), 0);
+}
+
+}  // namespace heap::base
diff --git a/deps/v8/test/unittests/heap/base/worklist-unittest.cc b/deps/v8/test/unittests/heap/base/worklist-unittest.cc
index 6613219a0d6be3..92fa48ccc0b873 100644
--- a/deps/v8/test/unittests/heap/base/worklist-unittest.cc
+++ b/deps/v8/test/unittests/heap/base/worklist-unittest.cc
@@ -162,7 +162,7 @@ TEST(WorkListTest, GlobalUpdateNull) {
   TestWorklist::Local worklist_local(worklist);
   SomeObject* object;
   object = reinterpret_cast<SomeObject*>(&object);
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     worklist_local.Push(object);
   }
   worklist_local.Push(object);
@@ -181,10 +181,10 @@ TEST(WorkListTest, GlobalUpdate) {
   objectB = reinterpret_cast<SomeObject*>(&objectB);
   SomeObject* objectC = nullptr;
   objectC = reinterpret_cast<SomeObject*>(&objectC);
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     worklist_local.Push(objectA);
   }
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     worklist_local.Push(objectB);
   }
   worklist_local.Push(objectA);
@@ -196,7 +196,7 @@ TEST(WorkListTest, GlobalUpdate) {
     }
     return false;
   });
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     SomeObject* object;
     EXPECT_TRUE(worklist_local.Pop(&object));
     EXPECT_EQ(object, objectC);
@@ -249,14 +249,14 @@ TEST(WorkListTest, SingleSegmentSteal) {
   TestWorklist::Local worklist_local1(worklist);
   TestWorklist::Local worklist_local2(worklist);
   SomeObject dummy;
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     worklist_local1.Push(&dummy);
   }
   worklist_local1.Publish();
   EXPECT_EQ(1U, worklist.Size());
   // Stealing.
   SomeObject* retrieved = nullptr;
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     EXPECT_TRUE(worklist_local2.Pop(&retrieved));
     EXPECT_EQ(&dummy, retrieved);
     EXPECT_FALSE(worklist_local1.Pop(&retrieved));
@@ -272,11 +272,11 @@ TEST(WorkListTest, MultipleSegmentsStolen) {
   TestWorklist::Local worklist_local3(worklist);
   SomeObject dummy1;
   SomeObject dummy2;
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     worklist_local1.Push(&dummy1);
   }
   worklist_local1.Publish();
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     worklist_local1.Push(&dummy2);
   }
   worklist_local1.Publish();
@@ -291,12 +291,12 @@ TEST(WorkListTest, MultipleSegmentsStolen) {
   EXPECT_NE(expect_bag2, expect_bag3);
   EXPECT_TRUE(expect_bag2 == &dummy1 || expect_bag2 == &dummy2);
   EXPECT_TRUE(expect_bag3 == &dummy1 || expect_bag3 == &dummy2);
-  for (size_t i = 1; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 1; i < TestWorklist::kMinSegmentSize; i++) {
     EXPECT_TRUE(worklist_local2.Pop(&retrieved));
     EXPECT_EQ(expect_bag2, retrieved);
     EXPECT_FALSE(worklist_local1.Pop(&retrieved));
   }
-  for (size_t i = 1; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 1; i < TestWorklist::kMinSegmentSize; i++) {
     EXPECT_TRUE(worklist_local3.Pop(&retrieved));
     EXPECT_EQ(expect_bag3, retrieved);
     EXPECT_FALSE(worklist_local1.Pop(&retrieved));
@@ -308,7 +308,7 @@ TEST(WorkListTest, MergeGlobalPool) {
   TestWorklist worklist1;
   TestWorklist::Local worklist_local1(worklist1);
   SomeObject dummy;
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     worklist_local1.Push(&dummy);
   }
   // One more push/pop to publish the full segment.
@@ -321,7 +321,7 @@ TEST(WorkListTest, MergeGlobalPool) {
   EXPECT_EQ(1U, worklist2.Size());
   EXPECT_FALSE(worklist2.IsEmpty());
   SomeObject* retrieved = nullptr;
-  for (size_t i = 0; i < TestWorklist::kMinSegmentSizeForTesting; i++) {
+  for (size_t i = 0; i < TestWorklist::kMinSegmentSize; i++) {
     EXPECT_TRUE(worklist_local2.Pop(&retrieved));
     EXPECT_EQ(&dummy, retrieved);
     EXPECT_FALSE(worklist_local1.Pop(&retrieved));
diff --git a/deps/v8/test/unittests/heap/bitmap-test-utils.h b/deps/v8/test/unittests/heap/bitmap-test-utils.h
index b709263968a259..74290bec60113f 100644
--- a/deps/v8/test/unittests/heap/bitmap-test-utils.h
+++ b/deps/v8/test/unittests/heap/bitmap-test-utils.h
@@ -5,31 +5,39 @@
 #ifndef V8_UNITTESTS_HEAP_BITMAP_TEST_UTILS_H_
 #define V8_UNITTESTS_HEAP_BITMAP_TEST_UTILS_H_
 
+#include "src/base/build_config.h"
+#include "src/base/platform/memory.h"
+#include "src/common/globals.h"
+#include "src/heap/marking.h"
+#include "src/heap/memory-chunk-layout.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
-namespace v8 {
-namespace internal {
+namespace v8::internal {
 
-template <typename T>
 class TestWithBitmap : public ::testing::Test {
  public:
-  TestWithBitmap() : memory_(new uint8_t[Bitmap::kSize]) {
-    memset(memory_, 0, Bitmap::kSize);
+  static constexpr size_t kPageSize = 1u << kPageSizeBits;
+
+  TestWithBitmap()
+      : memory_(reinterpret_cast<uint8_t*>(
+            base::AlignedAlloc(kPageSize, kPageSize))) {
+    memset(memory_, 0, kPageSize);
   }
 
-  ~TestWithBitmap() override { delete[] memory_; }
+  ~TestWithBitmap() override { base::AlignedFree(memory_); }
 
-  T* bitmap() { return reinterpret_cast<T*>(memory_); }
-  uint8_t* raw_bitmap() { return memory_; }
+  uint8_t* raw_bitmap() {
+    return reinterpret_cast<uint8_t*>(memory_ +
+                                      MemoryChunkLayout::kMarkingBitmapOffset);
+  }
+  MarkingBitmap* bitmap() {
+    return reinterpret_cast<MarkingBitmap*>(raw_bitmap());
+  }
 
  private:
   uint8_t* memory_;
 };
 
-using BitmapTypes = ::testing::Types<ConcurrentBitmap<AccessMode::NON_ATOMIC>,
-                                     ConcurrentBitmap<AccessMode::ATOMIC>>;
-
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal
 
 #endif  // V8_UNITTESTS_HEAP_BITMAP_TEST_UTILS_H_
diff --git a/deps/v8/test/unittests/heap/bitmap-unittest.cc b/deps/v8/test/unittests/heap/bitmap-unittest.cc
index 8729d8acb09ead..b647d8e61cb63a 100644
--- a/deps/v8/test/unittests/heap/bitmap-unittest.cc
+++ b/deps/v8/test/unittests/heap/bitmap-unittest.cc
@@ -2,55 +2,55 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include "src/common/globals.h"
+#include "src/heap/marking-inl.h"
 #include "src/heap/spaces.h"
 #include "test/unittests/heap/bitmap-test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
-namespace v8 {
-namespace internal {
+namespace v8::internal {
 
-const uint32_t kBlackCell = 0xAAAAAAAA;
-const uint32_t kWhiteCell = 0x00000000;
-const uint32_t kBlackByte = 0xAA;
-const uint32_t kWhiteByte = 0x00;
+constexpr MarkBit::CellType kMarkedCell =
+    std::numeric_limits<MarkBit::CellType>::max();
+constexpr MarkBit::CellType kLowerHalfMarkedCell =
+    kMarkedCell >> ((sizeof(kMarkedCell) * CHAR_BIT) / 2);
+constexpr MarkBit::CellType kHigherHalfMarkedCell = ~kLowerHalfMarkedCell;
+constexpr MarkBit::CellType kWhiteCell = static_cast<MarkBit::CellType>(0x0);
+constexpr uint8_t kMarkedByte = 0xFF;
+constexpr uint8_t kUnmarkedByte = 0x00;
 
-template <typename T>
-using BitmapTest = TestWithBitmap<T>;
-
-TYPED_TEST_SUITE(BitmapTest, BitmapTypes);
-
-using NonAtomicBitmapTest =
-    TestWithBitmap<ConcurrentBitmap<AccessMode::NON_ATOMIC>>;
+using NonAtomicBitmapTest = TestWithBitmap;
+using AtomicBitmapTest = TestWithBitmap;
 
 TEST_F(NonAtomicBitmapTest, IsZeroInitialized) {
   // We require all tests to start from a zero-initialized bitmap. Manually
   // verify this invariant here.
-  for (size_t i = 0; i < Bitmap::kSize; i++) {
-    EXPECT_EQ(raw_bitmap()[i], kWhiteByte);
+  for (size_t i = 0; i < MarkingBitmap::kSize; i++) {
+    EXPECT_EQ(raw_bitmap()[i], kUnmarkedByte);
   }
 }
 
 TEST_F(NonAtomicBitmapTest, Cells) {
   auto bm = bitmap();
-  bm->cells()[1] = kBlackCell;
+  bm->cells()[1] = kMarkedCell;
   uint8_t* raw = raw_bitmap();
-  int second_cell_base = Bitmap::kBytesPerCell;
-  for (size_t i = 0; i < Bitmap::kBytesPerCell; i++) {
-    EXPECT_EQ(raw[second_cell_base + i], kBlackByte);
+  int second_cell_base = MarkingBitmap::kBytesPerCell;
+  for (size_t i = 0; i < MarkingBitmap::kBytesPerCell; i++) {
+    EXPECT_EQ(raw[second_cell_base + i], kMarkedByte);
   }
 }
 
 TEST_F(NonAtomicBitmapTest, CellsCount) {
-  size_t last_cell_index = bitmap()->CellsCount() - 1;
-  bitmap()->cells()[last_cell_index] = kBlackCell;
+  size_t last_cell_index = MarkingBitmap::kCellsCount - 1;
+  bitmap()->cells()[last_cell_index] = kMarkedCell;
   // Manually verify on raw memory.
   uint8_t* raw = raw_bitmap();
-  for (size_t i = 0; i < Bitmap::kSize; i++) {
+  for (size_t i = 0; i < MarkingBitmap::kSize; i++) {
     // Last cell should be set.
-    if (i >= (Bitmap::kSize - Bitmap::kBytesPerCell)) {
-      EXPECT_EQ(raw[i], kBlackByte);
+    if (i >= (MarkingBitmap::kSize - MarkingBitmap::kBytesPerCell)) {
+      EXPECT_EQ(raw[i], kMarkedByte);
     } else {
-      EXPECT_EQ(raw[i], kWhiteByte);
+      EXPECT_EQ(raw[i], kUnmarkedByte);
     }
   }
 }
@@ -58,105 +58,135 @@ TEST_F(NonAtomicBitmapTest, CellsCount) {
 TEST_F(NonAtomicBitmapTest, IsClean) {
   auto bm = bitmap();
   EXPECT_TRUE(bm->IsClean());
-  bm->cells()[0] = kBlackCell;
+  bm->cells()[0] = kMarkedCell;
   EXPECT_FALSE(bm->IsClean());
 }
 
-TYPED_TEST(BitmapTest, Clear) {
-  auto bm = this->bitmap();
-  for (size_t i = 0; i < Bitmap::kSize; i++) {
-    this->raw_bitmap()[i] = 0xFFu;
-  }
-  bm->Clear();
-  for (size_t i = 0; i < Bitmap::kSize; i++) {
-    EXPECT_EQ(this->raw_bitmap()[i], 0);
-  }
-}
+namespace {
 
-TYPED_TEST(BitmapTest, MarkAllBits) {
-  auto bm = this->bitmap();
-  bm->MarkAllBits();
-  for (size_t i = 0; i < Bitmap::kSize; i++) {
-    EXPECT_EQ(this->raw_bitmap()[i], 0xFF);
+template <AccessMode access_mode>
+void ClearTest(uint8_t* raw_bitmap, MarkingBitmap* bm) {
+  for (size_t i = 0; i < MarkingBitmap::kSize; i++) {
+    raw_bitmap[i] = 0xFFu;
+  }
+  bm->Clear<AccessMode::ATOMIC>();
+  for (size_t i = 0; i < MarkingBitmap::kSize; i++) {
+    EXPECT_EQ(raw_bitmap[i], 0);
   }
 }
 
-TYPED_TEST(BitmapTest, ClearRange1) {
-  auto bm = this->bitmap();
-  bm->cells()[0] = kBlackCell;
-  bm->cells()[1] = kBlackCell;
-  bm->cells()[2] = kBlackCell;
-  bm->ClearRange(0, Bitmap::kBitsPerCell + Bitmap::kBitsPerCell / 2);
+template <AccessMode access_mode>
+void ClearRange1Test(uint8_t* raw_bitmap, MarkingBitmap* bm) {
+  bm->cells()[0] = kMarkedCell;
+  bm->cells()[1] = kMarkedCell;
+  bm->cells()[2] = kMarkedCell;
+  bm->ClearRange<access_mode>(
+      0, MarkingBitmap::kBitsPerCell + MarkingBitmap::kBitsPerCell / 2);
   EXPECT_EQ(bm->cells()[0], kWhiteCell);
-  EXPECT_EQ(bm->cells()[1], 0xAAAA0000);
-  EXPECT_EQ(bm->cells()[2], kBlackCell);
+  EXPECT_EQ(bm->cells()[1], kHigherHalfMarkedCell);
+  EXPECT_EQ(bm->cells()[2], kMarkedCell);
 }
 
-TYPED_TEST(BitmapTest, ClearRange2) {
-  auto bm = this->bitmap();
-  bm->cells()[0] = kBlackCell;
-  bm->cells()[1] = kBlackCell;
-  bm->cells()[2] = kBlackCell;
-  bm->ClearRange(Bitmap::kBitsPerCell,
-                 Bitmap::kBitsPerCell + Bitmap::kBitsPerCell / 2);
-  EXPECT_EQ(bm->cells()[0], kBlackCell);
-  EXPECT_EQ(bm->cells()[1], 0xAAAA0000);
-  EXPECT_EQ(bm->cells()[2], kBlackCell);
+template <AccessMode access_mode>
+void ClearRange2Test(uint8_t* raw_bitmap, MarkingBitmap* bm) {
+  bm->cells()[0] = kMarkedCell;
+  bm->cells()[1] = kMarkedCell;
+  bm->cells()[2] = kMarkedCell;
+  bm->ClearRange<access_mode>(
+      MarkingBitmap::kBitsPerCell,
+      MarkingBitmap::kBitsPerCell + MarkingBitmap::kBitsPerCell / 2);
+  EXPECT_EQ(bm->cells()[0], kMarkedCell);
+  EXPECT_EQ(bm->cells()[1], kHigherHalfMarkedCell);
+  EXPECT_EQ(bm->cells()[2], kMarkedCell);
 }
 
-TYPED_TEST(BitmapTest, SetAndClearRange) {
-  auto bm = this->bitmap();
+template <AccessMode access_mode>
+void SetAndClearRangeTest(uint8_t* raw_bitmap, MarkingBitmap* bm) {
   for (int i = 0; i < 3; i++) {
-    bm->SetRange(i, Bitmap::kBitsPerCell + i);
-    CHECK_EQ(bm->cells()[0], 0xFFFFFFFFu << i);
+    bm->SetRange<access_mode>(i, MarkingBitmap::kBitsPerCell + i);
+    CHECK_EQ(bm->cells()[0], std::numeric_limits<uintptr_t>::max() << i);
     CHECK_EQ(bm->cells()[1], (1u << i) - 1);
-    bm->ClearRange(i, Bitmap::kBitsPerCell + i);
+    bm->ClearRange<access_mode>(i, MarkingBitmap::kBitsPerCell + i);
     CHECK_EQ(bm->cells()[0], 0x0u);
     CHECK_EQ(bm->cells()[1], 0x0u);
   }
 }
 
-// AllBitsSetInRange() and AllBitsClearInRange() are only used when verifying
-// the heap on the main thread so they don't have atomic implementations.
-TEST_F(NonAtomicBitmapTest, ClearMultipleRanges) {
-  auto bm = this->bitmap();
+}  // namespace
+
+TEST_F(AtomicBitmapTest, Clear) {
+  ClearTest<AccessMode::ATOMIC>(this->raw_bitmap(), this->bitmap());
+}
 
-  bm->SetRange(0, Bitmap::kBitsPerCell * 3);
-  CHECK(bm->AllBitsSetInRange(0, Bitmap::kBitsPerCell));
+TEST_F(NonAtomicBitmapTest, Clear) {
+  ClearTest<AccessMode::NON_ATOMIC>(this->raw_bitmap(), this->bitmap());
+}
 
-  bm->ClearRange(Bitmap::kBitsPerCell / 2, Bitmap::kBitsPerCell);
-  bm->ClearRange(Bitmap::kBitsPerCell,
-                 Bitmap::kBitsPerCell + Bitmap::kBitsPerCell / 2);
-  bm->ClearRange(Bitmap::kBitsPerCell * 2 + 8, Bitmap::kBitsPerCell * 2 + 16);
-  bm->ClearRange(Bitmap::kBitsPerCell * 2 + 24, Bitmap::kBitsPerCell * 3);
+TEST_F(AtomicBitmapTest, ClearRange1) {
+  ClearRange1Test<AccessMode::ATOMIC>(this->raw_bitmap(), this->bitmap());
+}
 
-  CHECK_EQ(bm->cells()[0], 0xFFFFu);
-  CHECK(bm->AllBitsSetInRange(0, Bitmap::kBitsPerCell / 2));
-  CHECK(
-      bm->AllBitsClearInRange(Bitmap::kBitsPerCell / 2, Bitmap::kBitsPerCell));
+TEST_F(NonAtomicBitmapTest, ClearRange1) {
+  ClearRange1Test<AccessMode::NON_ATOMIC>(this->raw_bitmap(), this->bitmap());
+}
 
-  CHECK_EQ(bm->cells()[1], 0xFFFF0000u);
-  CHECK(bm->AllBitsClearInRange(
-      Bitmap::kBitsPerCell, Bitmap::kBitsPerCell + Bitmap::kBitsPerCell / 2));
-  CHECK(bm->AllBitsSetInRange(Bitmap::kBitsPerCell + Bitmap::kBitsPerCell / 2,
-                              Bitmap::kBitsPerCell * 2));
+TEST_F(AtomicBitmapTest, ClearRange2) {
+  ClearRange2Test<AccessMode::ATOMIC>(this->raw_bitmap(), this->bitmap());
+}
 
-  CHECK_EQ(bm->cells()[2], 0xFF00FFu);
-  CHECK(bm->AllBitsSetInRange(
-      Bitmap::kBitsPerCell * 2,
-      Bitmap::kBitsPerCell * 2 + Bitmap::kBitsPerCell / 4));
+TEST_F(NonAtomicBitmapTest, ClearRange2) {
+  ClearRange2Test<AccessMode::NON_ATOMIC>(this->raw_bitmap(), this->bitmap());
+}
+
+TEST_F(AtomicBitmapTest, SetAndClearRange) {
+  SetAndClearRangeTest<AccessMode::ATOMIC>(this->raw_bitmap(), this->bitmap());
+}
+
+TEST_F(NonAtomicBitmapTest, SetAndClearRange) {
+  SetAndClearRangeTest<AccessMode::NON_ATOMIC>(this->raw_bitmap(),
+                                               this->bitmap());
+}
+
+// AllBitsSetInRange() and AllBitsClearInRange() are only used when verifying
+// the heap on the main thread so they don't have atomic implementations.
+TEST_F(NonAtomicBitmapTest, ClearMultipleRanges) {
+  auto bm = this->bitmap();
+
+  bm->SetRange<AccessMode::NON_ATOMIC>(0, MarkingBitmap::kBitsPerCell * 3);
+  CHECK(bm->AllBitsSetInRange(0, MarkingBitmap::kBitsPerCell));
+
+  bm->ClearRange<AccessMode::NON_ATOMIC>(MarkingBitmap::kBitsPerCell / 2,
+                                         MarkingBitmap::kBitsPerCell);
+  bm->ClearRange<AccessMode::NON_ATOMIC>(
+      MarkingBitmap::kBitsPerCell,
+      MarkingBitmap::kBitsPerCell + MarkingBitmap::kBitsPerCell / 2);
+  bm->ClearRange<AccessMode::NON_ATOMIC>(MarkingBitmap::kBitsPerCell * 2 + 8,
+                                         MarkingBitmap::kBitsPerCell * 2 + 16);
+  bm->ClearRange<AccessMode::NON_ATOMIC>(MarkingBitmap::kBitsPerCell * 2 + 24,
+                                         MarkingBitmap::kBitsPerCell * 3);
+
+  CHECK_EQ(bm->cells()[0], kLowerHalfMarkedCell);
+  CHECK(bm->AllBitsSetInRange(0, MarkingBitmap::kBitsPerCell / 2));
+  CHECK(bm->AllBitsClearInRange(MarkingBitmap::kBitsPerCell / 2,
+                                MarkingBitmap::kBitsPerCell));
+
+  CHECK_EQ(bm->cells()[1], kHigherHalfMarkedCell);
   CHECK(bm->AllBitsClearInRange(
-      Bitmap::kBitsPerCell * 2 + Bitmap::kBitsPerCell / 4,
-      Bitmap::kBitsPerCell * 2 + Bitmap::kBitsPerCell / 2));
+      MarkingBitmap::kBitsPerCell,
+      MarkingBitmap::kBitsPerCell + MarkingBitmap::kBitsPerCell / 2));
   CHECK(bm->AllBitsSetInRange(
-      Bitmap::kBitsPerCell * 2 + Bitmap::kBitsPerCell / 2,
-      Bitmap::kBitsPerCell * 2 + Bitmap::kBitsPerCell / 2 +
-          Bitmap::kBitsPerCell / 4));
-  CHECK(bm->AllBitsClearInRange(Bitmap::kBitsPerCell * 2 +
-                                    Bitmap::kBitsPerCell / 2 +
-                                    Bitmap::kBitsPerCell / 4,
-                                Bitmap::kBitsPerCell * 3));
+      MarkingBitmap::kBitsPerCell + MarkingBitmap::kBitsPerCell / 2,
+      MarkingBitmap::kBitsPerCell * 2));
+
+  CHECK_EQ(bm->cells()[2], static_cast<MarkBit::CellType>(0x00FF00FFu));
+  CHECK(bm->AllBitsSetInRange(MarkingBitmap::kBitsPerCell * 2,
+                              MarkingBitmap::kBitsPerCell * 2 + 8));
+  CHECK(bm->AllBitsClearInRange(MarkingBitmap::kBitsPerCell * 2 + 8,
+                                MarkingBitmap::kBitsPerCell * 2 + 16));
+  CHECK(bm->AllBitsSetInRange(MarkingBitmap::kBitsPerCell * 2 + 16,
+                              MarkingBitmap::kBitsPerCell * 2 + 24));
+  CHECK(bm->AllBitsClearInRange(MarkingBitmap::kBitsPerCell * 2 + 24,
+                                MarkingBitmap::kBitsPerCell * 3));
 }
 
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal
diff --git a/deps/v8/test/unittests/heap/code-object-registry-unittest.cc b/deps/v8/test/unittests/heap/code-object-registry-unittest.cc
deleted file mode 100644
index aa1f3d229ed907..00000000000000
--- a/deps/v8/test/unittests/heap/code-object-registry-unittest.cc
+++ /dev/null
@@ -1,73 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/heap/code-object-registry.h"
-
-#include "testing/gtest/include/gtest/gtest.h"
-
-namespace v8 {
-namespace internal {
-
-TEST(CodeObjectRegistry, RegisterAlreadyExistingObjectsAndContains) {
-  CodeObjectRegistry registry;
-  const int elements = 10;
-  const int offset = 100;
-  for (int i = 0; i < elements; i++) {
-    registry.RegisterNewlyAllocatedCodeObject(i * offset);
-  }
-
-  for (int i = 0; i < elements; i++) {
-    CHECK(registry.Contains(i * offset));
-  }
-}
-
-TEST(CodeObjectRegistry, RegisterNewlyAllocatedObjectsAndContains) {
-  CodeObjectRegistry registry;
-  const int elements = 10;
-  const int offset = 100;
-  for (int i = 0; i < elements; i++) {
-    registry.RegisterNewlyAllocatedCodeObject(i * offset);
-  }
-
-  for (int i = 0; i < elements; i++) {
-    CHECK(registry.Contains(i * offset));
-  }
-}
-
-TEST(CodeObjectRegistry, FindAlreadyExistingObjects) {
-  CodeObjectRegistry registry;
-  const int elements = 10;
-  const int offset = 100;
-  const int inner = 2;
-  for (int i = 1; i <= elements; i++) {
-    registry.RegisterNewlyAllocatedCodeObject(i * offset);
-  }
-
-  for (int i = 1; i <= elements; i++) {
-    for (int j = 0; j < inner; j++) {
-      CHECK_EQ(registry.GetCodeObjectStartFromInnerAddress(i * offset + j),
-               i * offset);
-    }
-  }
-}
-
-TEST(CodeObjectRegistry, FindNewlyAllocatedObjects) {
-  CodeObjectRegistry registry;
-  const int elements = 10;
-  const int offset = 100;
-  const int inner = 2;
-  for (int i = 1; i <= elements; i++) {
-    registry.RegisterNewlyAllocatedCodeObject(i * offset);
-  }
-
-  for (int i = 1; i <= elements; i++) {
-    for (int j = 0; j < inner; j++) {
-      CHECK_EQ(registry.GetCodeObjectStartFromInnerAddress(i * offset + j),
-               i * offset);
-    }
-  }
-}
-
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/unittests/heap/conservative-stack-visitor-unittest.cc b/deps/v8/test/unittests/heap/conservative-stack-visitor-unittest.cc
index 128f2a22be76af..d1ed400e79e107 100644
--- a/deps/v8/test/unittests/heap/conservative-stack-visitor-unittest.cc
+++ b/deps/v8/test/unittests/heap/conservative-stack-visitor-unittest.cc
@@ -17,7 +17,7 @@ class RecordingVisitor final : public RootVisitor {
   V8_NOINLINE explicit RecordingVisitor(Isolate* isolate) {
     // Allocate the object.
     auto h = isolate->factory()->NewFixedArray(256, AllocationType::kOld);
-    the_object_ = h->GetHeapObject();
+    the_object_ = *h;
     base_address_ = the_object_.address();
     tagged_address_ = the_object_.ptr();
     inner_address_ = base_address_ + 42 * kTaggedSize;
@@ -86,7 +86,7 @@ TEST_F(ConservativeStackVisitorTest, DirectBasePointer) {
     volatile Address ptr = recorder->base_address();
 
     ConservativeStackVisitor stack_visitor(isolate(), recorder.get());
-    heap()->stack().IteratePointers(&stack_visitor);
+    heap()->stack().IteratePointersForTesting(&stack_visitor);
 
     // Make sure to keep the pointer alive.
     EXPECT_NE(kNullAddress, ptr);
@@ -107,7 +107,7 @@ TEST_F(ConservativeStackVisitorTest, TaggedBasePointer) {
     volatile Address ptr = recorder->tagged_address();
 
     ConservativeStackVisitor stack_visitor(isolate(), recorder.get());
-    heap()->stack().IteratePointers(&stack_visitor);
+    heap()->stack().IteratePointersForTesting(&stack_visitor);
 
     // Make sure to keep the pointer alive.
     EXPECT_NE(kNullAddress, ptr);
@@ -128,7 +128,7 @@ TEST_F(ConservativeStackVisitorTest, InnerPointer) {
     volatile Address ptr = recorder->inner_address();
 
     ConservativeStackVisitor stack_visitor(isolate(), recorder.get());
-    heap()->stack().IteratePointers(&stack_visitor);
+    heap()->stack().IteratePointersForTesting(&stack_visitor);
 
     // Make sure to keep the pointer alive.
     EXPECT_NE(kNullAddress, ptr);
@@ -151,7 +151,7 @@ TEST_F(ConservativeStackVisitorTest, HalfWord1) {
     volatile uint32_t ptr[] = {recorder->compr_address(), 0};
 
     ConservativeStackVisitor stack_visitor(isolate(), recorder.get());
-    heap()->stack().IteratePointers(&stack_visitor);
+    heap()->stack().IteratePointersForTesting(&stack_visitor);
 
     // Make sure to keep the pointer alive.
     EXPECT_NE(static_cast<uint32_t>(0), ptr[0]);
@@ -172,7 +172,7 @@ TEST_F(ConservativeStackVisitorTest, HalfWord2) {
     volatile uint32_t ptr[] = {0, recorder->compr_address()};
 
     ConservativeStackVisitor stack_visitor(isolate(), recorder.get());
-    heap()->stack().IteratePointers(&stack_visitor);
+    heap()->stack().IteratePointersForTesting(&stack_visitor);
 
     // Make sure to keep the pointer alive.
     EXPECT_NE(static_cast<uint32_t>(0), ptr[1]);
@@ -193,7 +193,7 @@ TEST_F(ConservativeStackVisitorTest, InnerHalfWord1) {
     volatile uint32_t ptr[] = {recorder->compr_inner(), 0};
 
     ConservativeStackVisitor stack_visitor(isolate(), recorder.get());
-    heap()->stack().IteratePointers(&stack_visitor);
+    heap()->stack().IteratePointersForTesting(&stack_visitor);
 
     // Make sure to keep the pointer alive.
     EXPECT_NE(static_cast<uint32_t>(0), ptr[0]);
@@ -214,7 +214,7 @@ TEST_F(ConservativeStackVisitorTest, InnerHalfWord2) {
     volatile uint32_t ptr[] = {0, recorder->compr_inner()};
 
     ConservativeStackVisitor stack_visitor(isolate(), recorder.get());
-    heap()->stack().IteratePointers(&stack_visitor);
+    heap()->stack().IteratePointersForTesting(&stack_visitor);
 
     // Make sure to keep the pointer alive.
     EXPECT_NE(static_cast<uint32_t>(0), ptr[1]);
diff --git a/deps/v8/test/unittests/heap/cppgc-js/embedder-roots-handler-unittest.cc b/deps/v8/test/unittests/heap/cppgc-js/embedder-roots-handler-unittest.cc
index 1759daf5d72a00..8c206ecff65743 100644
--- a/deps/v8/test/unittests/heap/cppgc-js/embedder-roots-handler-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc-js/embedder-roots-handler-unittest.cc
@@ -100,7 +100,7 @@ TEST_F(EmbedderRootsHandlerTest,
   SetupOptimizedAndNonOptimizedHandle(v8_isolate(), kClassIdToOptimize,
                                       optimized_handle, non_optimized_handle);
   EXPECT_EQ(initial_count + 2, traced_handles->used_node_count());
-  YoungGC();
+  InvokeMinorGC();
   EXPECT_EQ(initial_count + 1, traced_handles->used_node_count());
   EXPECT_TRUE(optimized_handle->IsEmpty());
   delete optimized_handle;
@@ -186,7 +186,7 @@ TEST_F(EmbedderRootsHandlerTest,
   TemporaryEmbedderRootsHandleScope roots_handler_scope(v8_isolate(), &handler);
   TracedReferenceTest(
       v8_isolate(), ConstructJSObject,
-      [](const TracedReference<v8::Object>&) {}, [this]() { FullGC(); },
+      [](const TracedReference<v8::Object>&) {}, [this]() { InvokeMajorGC(); },
       SurvivalMode::kDies);
 }
 
@@ -208,7 +208,7 @@ TEST_F(
             v8::Global<v8::Object>(v8_isolate(), handle.Get(v8_isolate()));
       },
       [this, &strong_global]() {
-        FullGC();
+        InvokeMajorGC();
         strong_global.Reset();
       },
       SurvivalMode::kDies);
@@ -224,7 +224,7 @@ TEST_F(EmbedderRootsHandlerTest,
   TemporaryEmbedderRootsHandleScope roots_handler_scope(v8_isolate(), &handler);
   TracedReferenceTest(
       v8_isolate(), ConstructJSObject,
-      [](const TracedReference<v8::Object>&) {}, [this]() { YoungGC(); },
+      [](const TracedReference<v8::Object>&) {}, [this]() { InvokeMinorGC(); },
       SurvivalMode::kSurvives);
 }
 
@@ -243,7 +243,7 @@ TEST_F(
       [](TracedReference<v8::Object>& handle) {
         handle.SetWrapperClassId(kClassIdToOptimize);
       },
-      [this]() { YoungGC(); }, SurvivalMode::kSurvives);
+      [this]() { InvokeMinorGC(); }, SurvivalMode::kSurvives);
 }
 
 // EmbedderRootsHandler does not affect API objects for handles that have
@@ -257,7 +257,7 @@ TEST_F(EmbedderRootsHandlerTest,
   TemporaryEmbedderRootsHandleScope roots_handler_scope(v8_isolate(), &handler);
   TracedReferenceTest(
       v8_isolate(), ConstructJSApiObject<TracedReference<v8::Object>>,
-      [](const TracedReference<v8::Object>&) {}, [this]() { YoungGC(); },
+      [](const TracedReference<v8::Object>&) {}, [this]() { InvokeMinorGC(); },
       SurvivalMode::kSurvives);
 }
 
@@ -281,7 +281,7 @@ TEST_F(
           local->SetAlignedPointerInInternalField(0, &handle);
         }
       },
-      [this]() { YoungGC(); }, SurvivalMode::kDies);
+      [this]() { InvokeMinorGC(); }, SurvivalMode::kDies);
 }
 
 }  // namespace v8::internal
diff --git a/deps/v8/test/unittests/heap/cppgc-js/unified-heap-snapshot-unittest.cc b/deps/v8/test/unittests/heap/cppgc-js/unified-heap-snapshot-unittest.cc
index f6a13472af817f..be6335480c26fc 100644
--- a/deps/v8/test/unittests/heap/cppgc-js/unified-heap-snapshot-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc-js/unified-heap-snapshot-unittest.cc
@@ -5,7 +5,9 @@
 #include <cstring>
 
 #include "include/cppgc/allocation.h"
+#include "include/cppgc/common.h"
 #include "include/cppgc/cross-thread-persistent.h"
+#include "include/cppgc/custom-space.h"
 #include "include/cppgc/garbage-collected.h"
 #include "include/cppgc/name-provider.h"
 #include "include/cppgc/persistent.h"
@@ -23,6 +25,51 @@
 #include "test/unittests/heap/cppgc-js/unified-heap-utils.h"
 #include "test/unittests/heap/heap-utils.h"
 
+namespace cppgc {
+
+class CompactableCustomSpace : public CustomSpace<CompactableCustomSpace> {
+ public:
+  static constexpr size_t kSpaceIndex = 0;
+  static constexpr bool kSupportsCompaction = true;
+};
+
+}  // namespace cppgc
+
+namespace v8::internal {
+
+struct CompactableGCed : public cppgc::GarbageCollected<CompactableGCed>,
+                         public cppgc::NameProvider {
+ public:
+  static constexpr const char kExpectedName[] = "CompactableGCed";
+  void Trace(cppgc::Visitor* v) const {}
+  const char* GetHumanReadableName() const final { return "CompactableGCed"; }
+  size_t data = 0;
+};
+
+struct CompactableHolder : public cppgc::GarbageCollected<CompactableHolder> {
+ public:
+  explicit CompactableHolder(cppgc::AllocationHandle& allocation_handle) {
+    object = cppgc::MakeGarbageCollected<CompactableGCed>(allocation_handle);
+  }
+
+  void Trace(cppgc::Visitor* visitor) const {
+    cppgc::internal::VisitorBase::TraceRawForTesting(
+        visitor, const_cast<const CompactableGCed*>(object));
+    visitor->RegisterMovableReference(
+        const_cast<const CompactableGCed**>(&object));
+  }
+  CompactableGCed* object = nullptr;
+};
+
+}  // namespace v8::internal
+
+namespace cppgc {
+template <>
+struct SpaceTrait<v8::internal::CompactableGCed> {
+  using Space = CompactableCustomSpace;
+};
+}  // namespace cppgc
+
 namespace v8 {
 namespace internal {
 
@@ -30,10 +77,23 @@ namespace {
 
 class UnifiedHeapSnapshotTest : public UnifiedHeapTest {
  public:
-  const v8::HeapSnapshot* TakeHeapSnapshot() {
+  UnifiedHeapSnapshotTest() = default;
+  explicit UnifiedHeapSnapshotTest(
+      std::vector<std::unique_ptr<cppgc::CustomSpaceBase>> custom_spaces)
+      : UnifiedHeapTest(std::move(custom_spaces)) {}
+  const v8::HeapSnapshot* TakeHeapSnapshot(
+      cppgc::EmbedderStackState stack_state =
+          cppgc::EmbedderStackState::kMayContainHeapPointers) {
     v8::HeapProfiler* heap_profiler = v8_isolate()->GetHeapProfiler();
-    return heap_profiler->TakeHeapSnapshot(nullptr, nullptr,
-                                           false /* hide internals */);
+
+    v8::HeapProfiler::HeapSnapshotOptions options;
+    options.control = nullptr;
+    options.global_object_name_resolver = nullptr;
+    options.snapshot_mode =
+        v8::HeapProfiler::HeapSnapshotMode::kExposeInternals;
+    options.numerics_mode = v8::HeapProfiler::NumericsMode::kHideNumericValues;
+    options.stack_state = stack_state;
+    return heap_profiler->TakeHeapSnapshot(options);
   }
 };
 
@@ -54,6 +114,20 @@ bool IsValidSnapshot(const v8::HeapSnapshot* snapshot, int depth = 3) {
   return unretained_entries_count == 0;
 }
 
+// Returns the IDs of all entries in the snapshot with the given name.
+std::vector<SnapshotObjectId> GetIds(const v8::HeapSnapshot& snapshot,
+                                     std::string name) {
+  const HeapSnapshot& heap_snapshot =
+      reinterpret_cast<const HeapSnapshot&>(snapshot);
+  std::vector<SnapshotObjectId> result;
+  for (const HeapEntry& entry : heap_snapshot.entries()) {
+    if (entry.name() == name) {
+      result.push_back(entry.id());
+    }
+  }
+  return result;
+}
+
 bool ContainsRetainingPath(const v8::HeapSnapshot& snapshot,
                            const std::vector<std::string> retaining_path,
                            bool debug_retaining_path = false) {
@@ -114,9 +188,11 @@ class GCed final : public BaseWithoutName, public cppgc::NameProvider {
 // static
 constexpr const char GCed::kExpectedName[];
 
-constexpr const char kExpectedCppRootsName[] = "C++ roots";
-constexpr const char kExpectedCppCrossThreadRootsName[] =
-    "C++ cross-thread roots";
+static constexpr const char kExpectedCppRootsName[] = "C++ Persistent roots";
+static constexpr const char kExpectedCppCrossThreadRootsName[] =
+    "C++ CrossThreadPersistent roots";
+static constexpr const char kExpectedCppStackRootsName[] =
+    "C++ native stack roots";
 
 template <typename T>
 constexpr const char* GetExpectedName() {
@@ -144,6 +220,86 @@ TEST_F(UnifiedHeapSnapshotTest, RetainedByCppRoot) {
       *snapshot, {kExpectedCppRootsName, GetExpectedName<GCed>()}));
 }
 
+TEST_F(UnifiedHeapSnapshotTest, ConsistentId) {
+  cppgc::Persistent<GCed> gced =
+      cppgc::MakeGarbageCollected<GCed>(allocation_handle());
+  const v8::HeapSnapshot* snapshot1 = TakeHeapSnapshot();
+  EXPECT_TRUE(IsValidSnapshot(snapshot1));
+  const v8::HeapSnapshot* snapshot2 = TakeHeapSnapshot();
+  EXPECT_TRUE(IsValidSnapshot(snapshot2));
+  std::vector<SnapshotObjectId> ids1 =
+      GetIds(*snapshot1, GetExpectedName<GCed>());
+  std::vector<SnapshotObjectId> ids2 =
+      GetIds(*snapshot2, GetExpectedName<GCed>());
+  EXPECT_EQ(ids1.size(), size_t{1});
+  EXPECT_EQ(ids2.size(), size_t{1});
+  EXPECT_EQ(ids1[0], ids2[0]);
+}
+
+class UnifiedHeapWithCustomSpaceSnapshotTest : public UnifiedHeapSnapshotTest {
+ public:
+  static std::vector<std::unique_ptr<cppgc::CustomSpaceBase>>
+  GetCustomSpaces() {
+    std::vector<std::unique_ptr<cppgc::CustomSpaceBase>> custom_spaces;
+    custom_spaces.emplace_back(
+        std::make_unique<cppgc::CompactableCustomSpace>());
+    return custom_spaces;
+  }
+  UnifiedHeapWithCustomSpaceSnapshotTest()
+      : UnifiedHeapSnapshotTest(GetCustomSpaces()) {}
+};
+
+TEST_F(UnifiedHeapWithCustomSpaceSnapshotTest, ConsistentIdAfterCompaction) {
+  // Ensure that only things held by Persistent handles will remain after GC.
+  DisableConservativeStackScanningScopeForTesting no_css(isolate()->heap());
+
+  // Allocate an object that will be thrown away by the GC, so that there's
+  // somewhere for the compactor to move stuff to.
+  cppgc::Persistent<CompactableGCed> trash =
+      cppgc::MakeGarbageCollected<CompactableGCed>(allocation_handle());
+
+  // Create the object which we'll actually test.
+  cppgc::Persistent<CompactableHolder> gced =
+      cppgc::MakeGarbageCollected<CompactableHolder>(allocation_handle(),
+                                                     allocation_handle());
+
+  // Release the persistent reference to the other object.
+  trash.Release();
+
+  void* original_pointer = gced->object;
+
+  // This first snapshot should not trigger compaction of the cppgc heap because
+  // the heap is still very small.
+  const v8::HeapSnapshot* snapshot1 =
+      TakeHeapSnapshot(cppgc::EmbedderStackState::kNoHeapPointers);
+  EXPECT_TRUE(IsValidSnapshot(snapshot1));
+  EXPECT_EQ(original_pointer, gced->object);
+
+  // Manually run a GC with compaction. The GCed object should move.
+  CppHeap::From(isolate()->heap()->cpp_heap())
+      ->compactor()
+      .EnableForNextGCForTesting();
+  i::InvokeMajorGC(isolate(), i::GCFlag::kReduceMemoryFootprint);
+  EXPECT_NE(original_pointer, gced->object);
+
+  // In the second heap snapshot, the moved object should still have the same
+  // ID.
+  const v8::HeapSnapshot* snapshot2 =
+      TakeHeapSnapshot(cppgc::EmbedderStackState::kNoHeapPointers);
+  EXPECT_TRUE(IsValidSnapshot(snapshot2));
+  std::vector<SnapshotObjectId> ids1 =
+      GetIds(*snapshot1, GetExpectedName<CompactableGCed>());
+  std::vector<SnapshotObjectId> ids2 =
+      GetIds(*snapshot2, GetExpectedName<CompactableGCed>());
+  // Depending on build config, GetIds might have returned only the ID for the
+  // CompactableGCed instance or it might have also returned the ID for the
+  // CompactableHolder.
+  EXPECT_TRUE(ids1.size() == 1 || ids1.size() == 2);
+  std::sort(ids1.begin(), ids1.end());
+  std::sort(ids2.begin(), ids2.end());
+  EXPECT_EQ(ids1, ids2);
+}
+
 TEST_F(UnifiedHeapSnapshotTest, RetainedByCppCrossThreadRoot) {
   cppgc::subtle::CrossThreadPersistent<GCed> gced =
       cppgc::MakeGarbageCollected<GCed>(allocation_handle());
@@ -153,6 +309,16 @@ TEST_F(UnifiedHeapSnapshotTest, RetainedByCppCrossThreadRoot) {
       *snapshot, {kExpectedCppCrossThreadRootsName, GetExpectedName<GCed>()}));
 }
 
+TEST_F(UnifiedHeapSnapshotTest, RetainedByStackRoots) {
+  auto* volatile gced = cppgc::MakeGarbageCollected<GCed>(allocation_handle());
+  const v8::HeapSnapshot* snapshot =
+      TakeHeapSnapshot(cppgc::EmbedderStackState::kMayContainHeapPointers);
+  EXPECT_TRUE(IsValidSnapshot(snapshot));
+  EXPECT_TRUE(ContainsRetainingPath(
+      *snapshot, {kExpectedCppStackRootsName, GetExpectedName<GCed>()}));
+  EXPECT_STREQ(gced->GetHumanReadableName(), GetExpectedName<GCed>());
+}
+
 TEST_F(UnifiedHeapSnapshotTest, RetainingUnnamedType) {
   cppgc::Persistent<BaseWithoutName> base_without_name =
       cppgc::MakeGarbageCollected<BaseWithoutName>(allocation_handle());
diff --git a/deps/v8/test/unittests/heap/cppgc-js/unified-heap-unittest.cc b/deps/v8/test/unittests/heap/cppgc-js/unified-heap-unittest.cc
index 31b0ee07aac74d..cdcadb37014a5d 100644
--- a/deps/v8/test/unittests/heap/cppgc-js/unified-heap-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc-js/unified-heap-unittest.cc
@@ -56,7 +56,7 @@ using UnifiedHeapDetachedTest = TestWithHeapInternals;
 
 TEST_F(UnifiedHeapTest, OnlyGC) { CollectGarbageWithEmbedderStack(); }
 
-TEST_F(UnifiedHeapTest, FindingV8ToBlinkReference) {
+TEST_F(UnifiedHeapTest, FindingV8ToCppReference) {
   v8::HandleScope scope(v8_isolate());
   uint16_t wrappable_type = WrapperHelper::kTracedEmbedderId;
   auto* wrappable_object =
@@ -150,7 +150,7 @@ TEST_F(UnifiedHeapDetachedTest, AllocationBeforeConfigureHeap) {
   js_heap.AttachCppHeap(heap.get());
   auto& cpp_heap = *CppHeap::From(isolate()->heap()->cpp_heap());
   {
-    CollectGarbage(OLD_SPACE);
+    InvokeMajorGC();
     cpp_heap.AsBase().sweeper().FinishIfRunning();
     EXPECT_TRUE(weak_holder);
   }
@@ -159,7 +159,7 @@ TEST_F(UnifiedHeapDetachedTest, AllocationBeforeConfigureHeap) {
     EmbedderStackStateScope stack_scope(
         &js_heap, EmbedderStackStateScope::kExplicitInvocation,
         StackState::kNoHeapPointers);
-    CollectGarbage(OLD_SPACE);
+    InvokeMajorGC();
     cpp_heap.AsBase().sweeper().FinishIfRunning();
     EXPECT_FALSE(weak_holder);
   }
@@ -369,7 +369,8 @@ TEST_F(UnifiedHeapTest, InConstructionObjectReferringToGlobalHandle) {
         allocation_handle(),
         reinterpret_cast<i::Isolate*>(v8_isolate())->heap(), local);
     CHECK_NE(kGlobalHandleZapValue,
-             *reinterpret_cast<Address*>(*cpp_obj->GetWrapper()));
+             ValueHelper::ValueAsAddress(
+                 ValueHelper::HandleAsValue(cpp_obj->GetWrapper())));
   }
 }
 
@@ -438,7 +439,7 @@ TEST_F(UnifiedHeapTest, TracedReferenceOnStack) {
     observer.SetWeak();
   }
   EXPECT_FALSE(observer.IsEmpty());
-  FullGC();
+  InvokeMajorGC();
   EXPECT_FALSE(observer.IsEmpty());
 }
 
@@ -477,6 +478,7 @@ class GCedWithHeapRef final : public cppgc::GarbageCollected<GCedWithHeapRef> {
 
 V8_NOINLINE void StackToHeapTest(v8::Isolate* v8_isolate, Operation op,
                                  TargetHandling target_handling) {
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   v8::Global<v8::Object> observer;
   v8::TracedReference<v8::Value> stack_handle;
   v8::CppHeap* cpp_heap = v8_isolate->GetCppHeap();
@@ -491,7 +493,7 @@ V8_NOINLINE void StackToHeapTest(v8::Isolate* v8_isolate, Operation op,
         IsNewObjectInCorrectGeneration(*v8::Utils::OpenHandle(*to_object)));
     if (!v8_flags.single_generation &&
         target_handling == TargetHandling::kInitializedOldGen) {
-      FullGC(v8_isolate);
+      InvokeMajorGC(i_isolate);
       EXPECT_FALSE(
           i::Heap::InYoungGeneration(*v8::Utils::OpenHandle(*to_object)));
     }
@@ -506,24 +508,25 @@ V8_NOINLINE void StackToHeapTest(v8::Isolate* v8_isolate, Operation op,
     observer.SetWeak();
   }
   EXPECT_FALSE(observer.IsEmpty());
-  FullGC(v8_isolate);
+  InvokeMajorGC(i_isolate);
   EXPECT_FALSE(observer.IsEmpty());
   PerformOperation(op, &cpp_heap_obj->heap_handle, &stack_handle);
-  FullGC(v8_isolate);
+  InvokeMajorGC(i_isolate);
   EXPECT_FALSE(observer.IsEmpty());
   cpp_heap_obj.Clear();
   {
     // Conservative scanning may find stale pointers to on-stack handles.
     // Disable scanning, assuming the slots are overwritten.
     DisableConservativeStackScanningScopeForTesting no_stack_scanning(
-        reinterpret_cast<i::Isolate*>(v8_isolate)->heap());
-    FullGC(v8_isolate);
+        i_isolate->heap());
+    InvokeMajorGC(i_isolate);
   }
   ASSERT_TRUE(observer.IsEmpty());
 }
 
 V8_NOINLINE void HeapToStackTest(v8::Isolate* v8_isolate, Operation op,
                                  TargetHandling target_handling) {
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   v8::Global<v8::Object> observer;
   v8::TracedReference<v8::Value> stack_handle;
   v8::CppHeap* cpp_heap = v8_isolate->GetCppHeap();
@@ -538,7 +541,7 @@ V8_NOINLINE void HeapToStackTest(v8::Isolate* v8_isolate, Operation op,
         IsNewObjectInCorrectGeneration(*v8::Utils::OpenHandle(*to_object)));
     if (!v8_flags.single_generation &&
         target_handling == TargetHandling::kInitializedOldGen) {
-      FullGC(v8_isolate);
+      InvokeMajorGC(i_isolate);
       EXPECT_FALSE(
           i::Heap::InYoungGeneration(*v8::Utils::OpenHandle(*to_object)));
     }
@@ -553,24 +556,25 @@ V8_NOINLINE void HeapToStackTest(v8::Isolate* v8_isolate, Operation op,
     observer.SetWeak();
   }
   EXPECT_FALSE(observer.IsEmpty());
-  FullGC(v8_isolate);
+  InvokeMajorGC(i_isolate);
   EXPECT_FALSE(observer.IsEmpty());
   PerformOperation(op, &stack_handle, &cpp_heap_obj->heap_handle);
-  FullGC(v8_isolate);
+  InvokeMajorGC(i_isolate);
   EXPECT_FALSE(observer.IsEmpty());
   stack_handle.Reset();
   {
     // Conservative scanning may find stale pointers to on-stack handles.
     // Disable scanning, assuming the slots are overwritten.
     DisableConservativeStackScanningScopeForTesting no_stack_scanning(
-        reinterpret_cast<i::Isolate*>(v8_isolate)->heap());
-    FullGC(v8_isolate);
+        i_isolate->heap());
+    InvokeMajorGC(i_isolate);
   }
   EXPECT_TRUE(observer.IsEmpty());
 }
 
 V8_NOINLINE void StackToStackTest(v8::Isolate* v8_isolate, Operation op,
                                   TargetHandling target_handling) {
+  i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(v8_isolate);
   v8::Global<v8::Object> observer;
   v8::TracedReference<v8::Value> stack_handle1;
   v8::TracedReference<v8::Value> stack_handle2;
@@ -582,7 +586,7 @@ V8_NOINLINE void StackToStackTest(v8::Isolate* v8_isolate, Operation op,
         IsNewObjectInCorrectGeneration(*v8::Utils::OpenHandle(*to_object)));
     if (!v8_flags.single_generation &&
         target_handling == TargetHandling::kInitializedOldGen) {
-      FullGC(v8_isolate);
+      InvokeMajorGC(i_isolate);
       EXPECT_FALSE(
           i::Heap::InYoungGeneration(*v8::Utils::OpenHandle(*to_object)));
     }
@@ -597,18 +601,18 @@ V8_NOINLINE void StackToStackTest(v8::Isolate* v8_isolate, Operation op,
     observer.SetWeak();
   }
   EXPECT_FALSE(observer.IsEmpty());
-  FullGC(v8_isolate);
+  InvokeMajorGC(i_isolate);
   EXPECT_FALSE(observer.IsEmpty());
   PerformOperation(op, &stack_handle2, &stack_handle1);
-  FullGC(v8_isolate);
+  InvokeMajorGC(i_isolate);
   EXPECT_FALSE(observer.IsEmpty());
   stack_handle2.Reset();
   {
     // Conservative scanning may find stale pointers to on-stack handles.
     // Disable scanning, assuming the slots are overwritten.
     DisableConservativeStackScanningScopeForTesting no_stack_scanning(
-        reinterpret_cast<i::Isolate*>(v8_isolate)->heap());
-    FullGC(v8_isolate);
+        i_isolate->heap());
+    InvokeMajorGC(i_isolate);
   }
   EXPECT_TRUE(observer.IsEmpty());
 }
@@ -683,7 +687,7 @@ TEST_F(UnifiedHeapTest, TracingInEphemerons) {
     Handle<JSObject> js_key =
         handle(JSObject::cast(*v8::Utils::OpenHandle(*key)), i_isolate());
     Handle<JSReceiver> js_value = v8::Utils::OpenHandle(*value);
-    int32_t hash = js_key->GetOrCreateHash(i_isolate()).value();
+    int32_t hash = Object::GetOrCreateHash(*js_key, i_isolate()).value();
     JSWeakCollection::Set(weak_map, js_key, js_value, hash);
   }
   CollectGarbageWithoutEmbedderStack(cppgc::Heap::SweepingType::kAtomic);
diff --git a/deps/v8/test/unittests/heap/cppgc-js/unified-heap-utils.cc b/deps/v8/test/unittests/heap/cppgc-js/unified-heap-utils.cc
index 22f91068d3d017..9545cb9393eaf6 100644
--- a/deps/v8/test/unittests/heap/cppgc-js/unified-heap-utils.cc
+++ b/deps/v8/test/unittests/heap/cppgc-js/unified-heap-utils.cc
@@ -27,7 +27,7 @@ UnifiedHeapTest::UnifiedHeapTest(
                               WrapperHelper::DefaultWrapperDescriptor()})) {
   // --stress-incremental-marking may have started an incremental GC at this
   // point already.
-  FinalizeGCIfRunning(isolate());
+  InvokeAtomicMajorGC();
   isolate()->heap()->AttachCppHeap(cpp_heap_.get());
 }
 
@@ -36,7 +36,7 @@ void UnifiedHeapTest::CollectGarbageWithEmbedderStack(
   EmbedderStackStateScope stack_scope(
       heap(), EmbedderStackStateScope::kExplicitInvocation,
       StackState::kMayContainHeapPointers);
-  CollectGarbage(OLD_SPACE);
+  InvokeMajorGC();
   if (sweeping_type == cppgc::Heap::SweepingType::kAtomic) {
     cpp_heap().AsBase().sweeper().FinishIfRunning();
   }
@@ -47,7 +47,7 @@ void UnifiedHeapTest::CollectGarbageWithoutEmbedderStack(
   EmbedderStackStateScope stack_scope(
       heap(), EmbedderStackStateScope::kExplicitInvocation,
       StackState::kNoHeapPointers);
-  CollectGarbage(OLD_SPACE);
+  InvokeMajorGC();
   if (sweeping_type == cppgc::Heap::SweepingType::kAtomic) {
     cpp_heap().AsBase().sweeper().FinishIfRunning();
   }
@@ -58,7 +58,7 @@ void UnifiedHeapTest::CollectYoungGarbageWithEmbedderStack(
   EmbedderStackStateScope stack_scope(
       heap(), EmbedderStackStateScope::kExplicitInvocation,
       StackState::kMayContainHeapPointers);
-  CollectGarbage(NEW_SPACE);
+  InvokeMinorGC();
   if (sweeping_type == cppgc::Heap::SweepingType::kAtomic) {
     cpp_heap().AsBase().sweeper().FinishIfRunning();
   }
@@ -68,7 +68,7 @@ void UnifiedHeapTest::CollectYoungGarbageWithoutEmbedderStack(
   EmbedderStackStateScope stack_scope(
       heap(), EmbedderStackStateScope::kExplicitInvocation,
       StackState::kNoHeapPointers);
-  CollectGarbage(NEW_SPACE);
+  InvokeMinorGC();
   if (sweeping_type == cppgc::Heap::SweepingType::kAtomic) {
     cpp_heap().AsBase().sweeper().FinishIfRunning();
   }
@@ -103,7 +103,7 @@ v8::Local<v8::Object> WrapperHelper::CreateWrapper(
   SetWrappableConnection(instance, wrappable_type, wrappable_object);
   CHECK(!instance.IsEmpty());
   i::Handle<i::JSReceiver> js_obj = v8::Utils::OpenHandle(*instance);
-  CHECK_EQ(i::JS_API_OBJECT_TYPE, js_obj->map().instance_type());
+  CHECK_EQ(i::JS_API_OBJECT_TYPE, js_obj->map()->instance_type());
   return scope.Escape(instance);
 }
 
diff --git a/deps/v8/test/unittests/heap/cppgc-js/young-unified-heap-unittest.cc b/deps/v8/test/unittests/heap/cppgc-js/young-unified-heap-unittest.cc
index d5388cbf3dce4d..cc925a87381bdd 100644
--- a/deps/v8/test/unittests/heap/cppgc-js/young-unified-heap-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc-js/young-unified-heap-unittest.cc
@@ -67,14 +67,14 @@ class Wrappable final : public cppgc::GarbageCollected<Wrappable> {
 
 size_t Wrappable::destructor_callcount = 0;
 
-class MinorMCEnabler {
+class MinorMSEnabler {
  public:
-  MinorMCEnabler()
-      : minor_mc_(&v8_flags.minor_mc, true),
+  MinorMSEnabler()
+      : minor_ms_(&v8_flags.minor_ms, true),
         cppgc_young_generation_(&v8_flags.cppgc_young_generation, true) {}
 
  private:
-  FlagScope<bool> minor_mc_;
+  FlagScope<bool> minor_ms_;
   FlagScope<bool> cppgc_young_generation_;
 };
 
@@ -159,7 +159,7 @@ class ExpectCppGCToV8NoGenerationalBarrier {
 
 }  // namespace
 
-class YoungUnifiedHeapTest : public MinorMCEnabler, public UnifiedHeapTest {
+class YoungUnifiedHeapTest : public MinorMSEnabler, public UnifiedHeapTest {
  public:
   YoungUnifiedHeapTest() {
     // Enable young generation flag and run GC. After the first run the heap
@@ -240,7 +240,7 @@ TEST_F(YoungUnifiedHeapTest, GenerationalBarrierV8ToCppGCReference) {
       v8::Utils::OpenHandle(*v8::Local<v8::Object>::Cast(api_object));
 
   EXPECT_TRUE(Heap::InYoungGeneration(*handle_api_object));
-  CollectAllAvailableGarbage();
+  InvokeMemoryReducingMajorGCs();
   EXPECT_EQ(0u, Wrappable::destructor_callcount);
   EXPECT_FALSE(Heap::InYoungGeneration(*handle_api_object));
 
@@ -289,7 +289,7 @@ TEST_F(YoungUnifiedHeapTest, GenerationalBarrierCppGCToV8ReferenceReset) {
       cppgc::MakeGarbageCollected<Wrappable>(allocation_handle());
 
   EXPECT_TRUE(IsHeapObjectYoung(wrappable_object.Get()));
-  CollectAllAvailableGarbage();
+  InvokeMemoryReducingMajorGCs();
   EXPECT_EQ(0u, Wrappable::destructor_callcount);
   EXPECT_TRUE(IsHeapObjectOld(wrappable_object.Get()));
 
@@ -321,7 +321,7 @@ TEST_F(YoungUnifiedHeapTest, GenerationalBarrierCppGCToV8ReferenceCopy) {
       cppgc::MakeGarbageCollected<Wrappable>(allocation_handle());
 
   EXPECT_TRUE(IsHeapObjectYoung(wrappable_object.Get()));
-  CollectAllAvailableGarbage();
+  InvokeMemoryReducingMajorGCs();
   EXPECT_EQ(0u, Wrappable::destructor_callcount);
   EXPECT_TRUE(IsHeapObjectOld(wrappable_object.Get()));
 
@@ -364,7 +364,7 @@ TEST_F(YoungUnifiedHeapTest, GenerationalBarrierCppGCToV8ReferenceMove) {
       cppgc::MakeGarbageCollected<Wrappable>(allocation_handle());
 
   EXPECT_TRUE(IsHeapObjectYoung(wrappable_object.Get()));
-  CollectAllAvailableGarbage();
+  InvokeMemoryReducingMajorGCs();
   EXPECT_EQ(0u, Wrappable::destructor_callcount);
   EXPECT_TRUE(IsHeapObjectOld(wrappable_object.Get()));
 
diff --git a/deps/v8/test/unittests/heap/cppgc/age-table-unittest.cc b/deps/v8/test/unittests/heap/cppgc/age-table-unittest.cc
index d616cc5adb943e..c428bbfe9e304d 100644
--- a/deps/v8/test/unittests/heap/cppgc/age-table-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/age-table-unittest.cc
@@ -16,15 +16,13 @@ namespace cppgc::internal {
 
 namespace {
 
-class AgeTableTest : public testing::TestWithHeap {
+class AgeTableTest : public testing::TestSupportingAllocationOnly {
  public:
   using Age = AgeTable::Age;
   using AdjacentCardsPolicy = AgeTable::AdjacentCardsPolicy;
   static constexpr auto kCardSizeInBytes = AgeTable::kCardSizeInBytes;
 
-  AgeTableTest()
-      : disallow_gc_(GetHeapHandle()),
-        age_table_(CagedHeapLocalData::Get().age_table) {}
+  AgeTableTest() : age_table_(CagedHeapLocalData::Get().age_table) {}
 
   ~AgeTableTest() override { age_table_.ResetForTesting(); }
 
@@ -76,7 +74,6 @@ class AgeTableTest : public testing::TestWithHeap {
   }
 
  private:
-  subtle::DisallowGarbageCollectionScope disallow_gc_;
   std::vector<std::unique_ptr<BasePage, void (*)(BasePage*)>> allocated_pages_;
   AgeTable& age_table_;
 };
@@ -201,11 +198,22 @@ TEST_F(AgeTableTest, SetAgeForMultipleCardsConsiderAdjacentCards) {
 
 TEST_F(AgeTableTest, MarkAllCardsAsYoung) {
   uint8_t* heap_start = reinterpret_cast<uint8_t*>(CagedHeapBase::GetBase());
-  void* heap_end = heap_start + kCagedHeapReservationSize - 1;
+  void* heap_end = heap_start + api_constants::kCagedHeapDefaultReservationSize - 1;
   AssertAgeForAddressRange(heap_start, heap_end, Age::kOld);
   SetAgeForAddressRange(heap_start, heap_end, Age::kYoung,
                         AdjacentCardsPolicy::kIgnore);
   AssertAgeForAddressRange(heap_start, heap_end, Age::kYoung);
 }
 
+TEST_F(AgeTableTest, AgeTableSize) {
+  // The default cage size should yield a 1MB table.
+  EXPECT_EQ(1 * kMB, CagedHeapBase::GetAgeTableSize());
+
+  // Pretend there's a larger cage and verify that the age table reserves the
+  // correct amount of space for itself.
+  size_t age_table_size = AgeTable::CalculateAgeTableSizeForHeapSize(
+      api_constants::kCagedHeapDefaultReservationSize * 4);
+  EXPECT_EQ(4 * kMB, age_table_size);
+}
+
 }  // namespace cppgc::internal
diff --git a/deps/v8/test/unittests/heap/cppgc/allocation-unittest.cc b/deps/v8/test/unittests/heap/cppgc/allocation-unittest.cc
index 3c878411caf6d7..384e947ac9d8f8 100644
--- a/deps/v8/test/unittests/heap/cppgc/allocation-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/allocation-unittest.cc
@@ -91,46 +91,52 @@ TEST_F(CppgcAllocationTest,
   EXPECT_FALSE(HeapObjectHeader::FromObject(obj).IsFree());
 }
 
+// The test below requires that a large object is reused in the GC. This only
+// reliably works on 64-bit builds using caged heap. On 32-bit builds large
+// objects are mapped in individually and returned to the OS as a whole on
+// reclamation.
+#if defined(CPPGC_CAGED_HEAP)
+
 namespace {
-class LargeObject : public GarbageCollected<LargeObject> {
+class LargeObjectCheckingPayloadForZeroMemory final
+    : public GarbageCollected<LargeObjectCheckingPayloadForZeroMemory> {
  public:
   static constexpr size_t kDataSize = kLargeObjectSizeThreshold + 1;
   static size_t destructor_calls;
 
-  explicit LargeObject(bool check) {
-    if (!check) return;
-    for (size_t i = 0; i < LargeObject::kDataSize; ++i) {
+  LargeObjectCheckingPayloadForZeroMemory() {
+    for (size_t i = 0; i < kDataSize; ++i) {
       EXPECT_EQ(0, data[i]);
     }
   }
-  ~LargeObject() { ++destructor_calls; }
+  ~LargeObjectCheckingPayloadForZeroMemory() { ++destructor_calls; }
   void Trace(Visitor*) const {}
 
   char data[kDataSize];
 };
-size_t LargeObject::destructor_calls = 0u;
+size_t LargeObjectCheckingPayloadForZeroMemory::destructor_calls = 0u;
 }  // namespace
 
 TEST_F(CppgcAllocationTest, LargePagesAreZeroedOut) {
-  static constexpr size_t kNumObjects = 1u;
-  LargeObject::destructor_calls = 0u;
-  std::vector<void*> pages;
-  for (size_t i = 0; i < kNumObjects; ++i) {
-    auto* obj = MakeGarbageCollected<LargeObject>(GetAllocationHandle(), false);
-    pages.push_back(obj);
-    memset(obj->data, 0xff, LargeObject::kDataSize);
-  }
+  LargeObjectCheckingPayloadForZeroMemory::destructor_calls = 0u;
+  auto* initial_object =
+      MakeGarbageCollected<LargeObjectCheckingPayloadForZeroMemory>(
+          GetAllocationHandle());
+  memset(initial_object->data, 0xff,
+         LargeObjectCheckingPayloadForZeroMemory::kDataSize);
+  // GC ignores stack and thus frees the object.
   PreciseGC();
-  EXPECT_EQ(kNumObjects, LargeObject::destructor_calls);
-  bool reused_page = false;
-  for (size_t i = 0; i < kNumObjects; ++i) {
-    auto* obj = MakeGarbageCollected<LargeObject>(GetAllocationHandle(), true);
-    if (std::find(pages.begin(), pages.end(), obj) != pages.end())
-      reused_page = true;
-  }
-  EXPECT_TRUE(reused_page);
+  EXPECT_EQ(1u, LargeObjectCheckingPayloadForZeroMemory::destructor_calls);
+  auto* new_object =
+      MakeGarbageCollected<LargeObjectCheckingPayloadForZeroMemory>(
+          GetAllocationHandle());
+  // If the following check fails, then the GC didn't reuse the underlying page
+  // and the test doesn't check anything.
+  EXPECT_EQ(initial_object, new_object);
 }
 
+#endif  // defined(CPPGC_CAGED_HEAP)
+
 namespace {
 
 constexpr size_t kDoubleWord = 2 * sizeof(void*);
diff --git a/deps/v8/test/unittests/heap/cppgc/gc-info-unittest.cc b/deps/v8/test/unittests/heap/cppgc/gc-info-unittest.cc
index c7337249d71ae2..33579436b81bb9 100644
--- a/deps/v8/test/unittests/heap/cppgc/gc-info-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/gc-info-unittest.cc
@@ -19,7 +19,7 @@ namespace internal {
 
 namespace {
 
-constexpr GCInfo GetEmptyGCInfo() { return {nullptr, nullptr, nullptr, false}; }
+constexpr GCInfo GetEmptyGCInfo() { return {nullptr, nullptr, nullptr}; }
 
 class GCInfoTableTest : public ::testing::Test {
  public:
diff --git a/deps/v8/test/unittests/heap/cppgc/incremental-marking-schedule-unittest.cc b/deps/v8/test/unittests/heap/cppgc/incremental-marking-schedule-unittest.cc
deleted file mode 100644
index a98ca6ac307129..00000000000000
--- a/deps/v8/test/unittests/heap/cppgc/incremental-marking-schedule-unittest.cc
+++ /dev/null
@@ -1,95 +0,0 @@
-// Copyright 2020 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/heap/cppgc/incremental-marking-schedule.h"
-
-#include "src/base/platform/time.h"
-#include "src/heap/cppgc/globals.h"
-#include "src/heap/cppgc/stats-collector.h"
-#include "testing/gtest/include/gtest/gtest.h"
-
-namespace cppgc {
-namespace internal {
-
-namespace {
-
-class IncrementalMarkingScheduleTest : public ::testing::Test {
- public:
-  static const size_t kObjectSize;
-};
-
-const size_t IncrementalMarkingScheduleTest::kObjectSize =
-    100 * IncrementalMarkingSchedule::kMinimumMarkedBytesPerIncrementalStep;
-
-}  // namespace
-
-TEST_F(IncrementalMarkingScheduleTest, FirstStepReturnsDefaultDuration) {
-  IncrementalMarkingSchedule schedule;
-  schedule.NotifyIncrementalMarkingStart();
-  schedule.SetElapsedTimeForTesting(0);
-  EXPECT_EQ(IncrementalMarkingSchedule::kMinimumMarkedBytesPerIncrementalStep,
-            schedule.GetNextIncrementalStepDuration(kObjectSize));
-}
-
-// If marking is not behind schedule and very small time passed between steps
-// the oracle should return the minimum step duration.
-TEST_F(IncrementalMarkingScheduleTest, NoTimePassedReturnsMinimumDuration) {
-  IncrementalMarkingSchedule schedule;
-  schedule.NotifyIncrementalMarkingStart();
-  // Add incrementally marked bytes to tell oracle this is not the first step.
-  schedule.UpdateMutatorThreadMarkedBytes(
-      IncrementalMarkingSchedule::kMinimumMarkedBytesPerIncrementalStep);
-  schedule.SetElapsedTimeForTesting(0);
-  EXPECT_EQ(IncrementalMarkingSchedule::kMinimumMarkedBytesPerIncrementalStep,
-            schedule.GetNextIncrementalStepDuration(kObjectSize));
-}
-
-TEST_F(IncrementalMarkingScheduleTest, OracleDoesntExccedMaximumStepDuration) {
-  IncrementalMarkingSchedule schedule;
-  schedule.NotifyIncrementalMarkingStart();
-  // Add incrementally marked bytes to tell oracle this is not the first step.
-  static constexpr size_t kMarkedBytes = 1;
-  schedule.UpdateMutatorThreadMarkedBytes(kMarkedBytes);
-  schedule.SetElapsedTimeForTesting(
-      IncrementalMarkingSchedule::kEstimatedMarkingTimeMs);
-  EXPECT_EQ(kObjectSize - kMarkedBytes,
-            schedule.GetNextIncrementalStepDuration(kObjectSize));
-}
-
-TEST_F(IncrementalMarkingScheduleTest, AheadOfScheduleReturnsMinimumDuration) {
-  IncrementalMarkingSchedule schedule;
-  schedule.NotifyIncrementalMarkingStart();
-  // Add incrementally marked bytes to tell oracle this is not the first step.
-  schedule.UpdateMutatorThreadMarkedBytes(
-      IncrementalMarkingSchedule::kMinimumMarkedBytesPerIncrementalStep);
-  schedule.AddConcurrentlyMarkedBytes(0.6 * kObjectSize);
-  schedule.SetElapsedTimeForTesting(
-      0.5 * IncrementalMarkingSchedule::kEstimatedMarkingTimeMs);
-  EXPECT_EQ(IncrementalMarkingSchedule::kMinimumMarkedBytesPerIncrementalStep,
-            schedule.GetNextIncrementalStepDuration(kObjectSize));
-}
-
-TEST_F(IncrementalMarkingScheduleTest, BehindScheduleReturnsCorrectDuration) {
-  IncrementalMarkingSchedule schedule;
-  schedule.NotifyIncrementalMarkingStart();
-  schedule.UpdateMutatorThreadMarkedBytes(0.1 * kObjectSize);
-  schedule.AddConcurrentlyMarkedBytes(0.25 * kObjectSize);
-  schedule.SetElapsedTimeForTesting(
-      0.5 * IncrementalMarkingSchedule::kEstimatedMarkingTimeMs);
-  EXPECT_EQ(0.15 * kObjectSize,
-            schedule.GetNextIncrementalStepDuration(kObjectSize));
-  schedule.AddConcurrentlyMarkedBytes(0.05 * kObjectSize);
-  schedule.SetElapsedTimeForTesting(
-      0.5 * IncrementalMarkingSchedule::kEstimatedMarkingTimeMs);
-  EXPECT_EQ(0.1 * kObjectSize,
-            schedule.GetNextIncrementalStepDuration(kObjectSize));
-  schedule.AddConcurrentlyMarkedBytes(0.05 * kObjectSize);
-  schedule.SetElapsedTimeForTesting(
-      0.5 * IncrementalMarkingSchedule::kEstimatedMarkingTimeMs);
-  EXPECT_EQ(0.05 * kObjectSize,
-            schedule.GetNextIncrementalStepDuration(kObjectSize));
-}
-
-}  // namespace internal
-}  // namespace cppgc
diff --git a/deps/v8/test/unittests/heap/cppgc/logging-unittest.cc b/deps/v8/test/unittests/heap/cppgc/logging-unittest.cc
index 69fb2ce7a0fb60..700afabab330ee 100644
--- a/deps/v8/test/unittests/heap/cppgc/logging-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/logging-unittest.cc
@@ -59,7 +59,7 @@ TEST(LoggingTest, Message) {
                             ContainsRegex("failed.*5 == 7"));
 }
 
-#if CPPGC_SUPPORTS_SOURCE_LOCATION
+#if V8_SUPPORTS_SOURCE_LOCATION
 TEST(LoggingTest, SourceLocation) {
   using ::testing::AllOf;
   using ::testing::HasSubstr;
@@ -69,7 +69,7 @@ TEST(LoggingTest, SourceLocation) {
   EXPECT_DEATH_IF_SUPPORTED(CPPGC_CHECK(false), AllOf(HasSubstr(loc.FileName()), HasSubstr(std::to_string(loc.Line() + 2)))); // NOLINT(whitespace/line_length)
   // clang-format on
 }
-#endif  // CPPGC_SUPPORTS_SOURCE_LOCATION
+#endif  // V8_SUPPORTS_SOURCE_LOCATION
 
 #endif  // DEBUG
 
diff --git a/deps/v8/test/unittests/heap/cppgc/marking-verifier-unittest.cc b/deps/v8/test/unittests/heap/cppgc/marking-verifier-unittest.cc
index 739105eee8d0e1..400812bedc1a24 100644
--- a/deps/v8/test/unittests/heap/cppgc/marking-verifier-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/marking-verifier-unittest.cc
@@ -23,9 +23,11 @@ class MarkingVerifierTest : public testing::TestWithHeap {
   V8_NOINLINE void VerifyMarking(HeapBase& heap, StackState stack_state,
                                  size_t expected_marked_bytes) {
     Heap::From(GetHeap())->object_allocator().ResetLinearAllocationBuffers();
-    Heap::From(GetHeap())->stack()->SetMarkerToCurrentStackPosition();
-    MarkingVerifier verifier(heap, CollectionType::kMajor);
-    verifier.Run(stack_state, expected_marked_bytes);
+    Heap::From(GetHeap())->stack()->SetMarkerAndCallback(
+        [&heap, stack_state, expected_marked_bytes]() {
+          MarkingVerifier verifier(heap, CollectionType::kMajor);
+          verifier.Run(stack_state, expected_marked_bytes);
+        });
   }
 };
 
diff --git a/deps/v8/test/unittests/heap/cppgc/page-memory-unittest.cc b/deps/v8/test/unittests/heap/cppgc/page-memory-unittest.cc
index 52faa4b1caf60a..1e9c3b61e26838 100644
--- a/deps/v8/test/unittests/heap/cppgc/page-memory-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/page-memory-unittest.cc
@@ -78,8 +78,7 @@ TEST(PageMemoryDeathTest, ConstructNonContainedRegions) {
 
 TEST(PageMemoryRegionTest, NormalPageMemoryRegion) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  auto pmr = std::make_unique<NormalPageMemoryRegion>(allocator, oom_handler);
+  auto pmr = NormalPageMemoryRegion::Create(allocator);
   pmr->UnprotectForTesting();
   MemoryRegion prev_overall;
   for (size_t i = 0; i < NormalPageMemoryRegion::kNumPageRegions; ++i) {
@@ -105,9 +104,7 @@ TEST(PageMemoryRegionTest, NormalPageMemoryRegion) {
 
 TEST(PageMemoryRegionTest, LargePageMemoryRegion) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  auto pmr =
-      std::make_unique<LargePageMemoryRegion>(allocator, oom_handler, 1024);
+  auto pmr = LargePageMemoryRegion::Create(allocator, 1024);
   pmr->UnprotectForTesting();
   const PageMemory pm = pmr->GetPageMemory();
   EXPECT_LE(1024u, pm.writeable_region().size());
@@ -147,10 +144,8 @@ TEST(PageMemoryRegionDeathTest, ReservationIsFreed) {
   // may expand to statements that re-purpose the previously freed memory
   // and thus not crash.
   EXPECT_DEATH_IF_SUPPORTED(
-      v8::base::PageAllocator allocator; FatalOutOfMemoryHandler oom_handler;
-      Address base; {
-        auto pmr = std::make_unique<LargePageMemoryRegion>(allocator,
-                                                           oom_handler, 1024);
+      v8::base::PageAllocator allocator; Address base; {
+        auto pmr = LargePageMemoryRegion::Create(allocator, 1024);
         base = pmr->reserved_region().base();
       } access(base[0]);
       , "");
@@ -158,8 +153,7 @@ TEST(PageMemoryRegionDeathTest, ReservationIsFreed) {
 
 TEST(PageMemoryRegionDeathTest, FrontGuardPageAccessCrashes) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  auto pmr = std::make_unique<NormalPageMemoryRegion>(allocator, oom_handler);
+  auto pmr = NormalPageMemoryRegion::Create(allocator);
   if (SupportsCommittingGuardPages(allocator)) {
     EXPECT_DEATH_IF_SUPPORTED(
         access(pmr->GetPageMemory(0).overall_region().base()[0]), "");
@@ -168,8 +162,7 @@ TEST(PageMemoryRegionDeathTest, FrontGuardPageAccessCrashes) {
 
 TEST(PageMemoryRegionDeathTest, BackGuardPageAccessCrashes) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  auto pmr = std::make_unique<NormalPageMemoryRegion>(allocator, oom_handler);
+  auto pmr = NormalPageMemoryRegion::Create(allocator);
   if (SupportsCommittingGuardPages(allocator)) {
     EXPECT_DEATH_IF_SUPPORTED(
         access(pmr->GetPageMemory(0).writeable_region().end()[0]), "");
@@ -178,8 +171,7 @@ TEST(PageMemoryRegionDeathTest, BackGuardPageAccessCrashes) {
 
 TEST(PageMemoryRegionTreeTest, AddNormalLookupRemove) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  auto pmr = std::make_unique<NormalPageMemoryRegion>(allocator, oom_handler);
+  auto pmr = NormalPageMemoryRegion::Create(allocator);
   PageMemoryRegionTree tree;
   tree.Add(pmr.get());
   ASSERT_EQ(pmr.get(), tree.Lookup(pmr->reserved_region().base()));
@@ -193,10 +185,8 @@ TEST(PageMemoryRegionTreeTest, AddNormalLookupRemove) {
 
 TEST(PageMemoryRegionTreeTest, AddLargeLookupRemove) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
   constexpr size_t kLargeSize = 5012;
-  auto pmr = std::make_unique<LargePageMemoryRegion>(allocator, oom_handler,
-                                                     kLargeSize);
+  auto pmr = LargePageMemoryRegion::Create(allocator, kLargeSize);
   PageMemoryRegionTree tree;
   tree.Add(pmr.get());
   ASSERT_EQ(pmr.get(), tree.Lookup(pmr->reserved_region().base()));
@@ -210,11 +200,9 @@ TEST(PageMemoryRegionTreeTest, AddLargeLookupRemove) {
 
 TEST(PageMemoryRegionTreeTest, AddLookupRemoveMultiple) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  auto pmr1 = std::make_unique<NormalPageMemoryRegion>(allocator, oom_handler);
+  auto pmr1 = NormalPageMemoryRegion::Create(allocator);
   constexpr size_t kLargeSize = 3127;
-  auto pmr2 = std::make_unique<LargePageMemoryRegion>(allocator, oom_handler,
-                                                      kLargeSize);
+  auto pmr2 = LargePageMemoryRegion::Create(allocator, kLargeSize);
   PageMemoryRegionTree tree;
   tree.Add(pmr1.get());
   tree.Add(pmr2.get());
@@ -238,8 +226,7 @@ TEST(NormalPageMemoryPool, ConstructorEmpty) {
 
 TEST(NormalPageMemoryPool, AddTake) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  auto pmr = std::make_unique<NormalPageMemoryRegion>(allocator, oom_handler);
+  auto pmr = NormalPageMemoryRegion::Create(allocator);
   const PageMemory pm = pmr->GetPageMemory(0);
   NormalPageMemoryPool pool;
   pool.Add(pmr.get(), pm.writeable_region().base());
@@ -250,8 +237,7 @@ TEST(NormalPageMemoryPool, AddTake) {
 
 TEST(PageBackendTest, AllocateNormalUsesPool) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  PageBackend backend(allocator, allocator, oom_handler);
+  PageBackend backend(allocator, allocator);
   constexpr size_t kBucket = 0;
   Address writeable_base1 = backend.TryAllocateNormalPageMemory();
   EXPECT_NE(nullptr, writeable_base1);
@@ -263,8 +249,7 @@ TEST(PageBackendTest, AllocateNormalUsesPool) {
 
 TEST(PageBackendTest, AllocateLarge) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  PageBackend backend(allocator, allocator, oom_handler);
+  PageBackend backend(allocator, allocator);
   Address writeable_base1 = backend.TryAllocateLargePageMemory(13731);
   EXPECT_NE(nullptr, writeable_base1);
   Address writeable_base2 = backend.TryAllocateLargePageMemory(9478);
@@ -276,8 +261,7 @@ TEST(PageBackendTest, AllocateLarge) {
 
 TEST(PageBackendTest, LookupNormal) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  PageBackend backend(allocator, allocator, oom_handler);
+  PageBackend backend(allocator, allocator);
   Address writeable_base = backend.TryAllocateNormalPageMemory();
   if (kGuardPageSize) {
     EXPECT_EQ(nullptr, backend.Lookup(writeable_base - kGuardPageSize));
@@ -296,8 +280,7 @@ TEST(PageBackendTest, LookupNormal) {
 
 TEST(PageBackendTest, LookupLarge) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
-  PageBackend backend(allocator, allocator, oom_handler);
+  PageBackend backend(allocator, allocator);
   constexpr size_t kSize = 7934;
   Address writeable_base = backend.TryAllocateLargePageMemory(kSize);
   if (kGuardPageSize) {
@@ -310,10 +293,9 @@ TEST(PageBackendTest, LookupLarge) {
 
 TEST(PageBackendDeathTest, DestructingBackendDestroysPageMemory) {
   v8::base::PageAllocator allocator;
-  FatalOutOfMemoryHandler oom_handler;
   Address base;
   {
-    PageBackend backend(allocator, allocator, oom_handler);
+    PageBackend backend(allocator, allocator);
     base = backend.TryAllocateNormalPageMemory();
   }
   EXPECT_DEATH_IF_SUPPORTED(access(base[0]), "");
diff --git a/deps/v8/test/unittests/heap/cppgc/persistent-family-unittest.cc b/deps/v8/test/unittests/heap/cppgc/persistent-family-unittest.cc
index 79950b36560e9c..8e8aec72eb928d 100644
--- a/deps/v8/test/unittests/heap/cppgc/persistent-family-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/persistent-family-unittest.cc
@@ -816,7 +816,7 @@ TEST_F(PersistentTest, ClearOnHeapDestruction) {
   EXPECT_EQ(kSentinelPointer, weak_persistent_sentinel);
 }
 
-#if CPPGC_SUPPORTS_SOURCE_LOCATION
+#if V8_SUPPORTS_SOURCE_LOCATION
 TEST_F(PersistentTest, LocalizedPersistent) {
   GCed* gced = MakeGarbageCollected<GCed>(GetAllocationHandle());
   {
@@ -949,15 +949,15 @@ class ExpectingLocationVisitor final : public RootVisitorBase {
 TEST_F(PersistentTest, PersistentTraceLocation) {
   GCed* gced = MakeGarbageCollected<GCed>(GetAllocationHandle());
   {
-#if CPPGC_SUPPORTS_SOURCE_LOCATION
+#if V8_SUPPORTS_SOURCE_LOCATION
     // Baseline for creating expected location which has a different line
     // number.
     const auto loc = SourceLocation::Current();
     const auto expected_loc =
         SourceLocation::Current(loc.Function(), loc.FileName(), loc.Line() + 6);
-#else   // !CCPPGC_SUPPORTS_SOURCE_LOCATION
+#else   // !V8_SUPPORTS_SOURCE_LOCATION
     const SourceLocation expected_loc;
-#endif  // !CCPPGC_SUPPORTS_SOURCE_LOCATION
+#endif  // !V8_SUPPORTS_SOURCE_LOCATION
     LocalizedPersistent<GCed> p = gced;
     ExpectingLocationVisitor visitor(expected_loc);
     visitor.Trace(p);
diff --git a/deps/v8/test/unittests/heap/cppgc/platform-unittest.cc b/deps/v8/test/unittests/heap/cppgc/platform-unittest.cc
index 7cf783ab0a20a8..ab0d197bb8addc 100644
--- a/deps/v8/test/unittests/heap/cppgc/platform-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/platform-unittest.cc
@@ -23,9 +23,9 @@ constexpr uintptr_t kHeapNeedle = 0x14;
 [[noreturn]] void CustomHandler(const std::string&, const SourceLocation&,
                                 HeapBase* heap) {
   if (heap == reinterpret_cast<HeapBase*>(kHeapNeedle)) {
-    FATAL("cust0m h4ndl3r with matching heap");
+    GRACEFUL_FATAL("cust0m h4ndl3r with matching heap");
   }
-  FATAL("cust0m h4ndl3r");
+  GRACEFUL_FATAL("cust0m h4ndl3r");
 }
 
 }  // namespace
diff --git a/deps/v8/test/unittests/heap/cppgc/source-location-unittest.cc b/deps/v8/test/unittests/heap/cppgc/source-location-unittest.cc
index b477dc167d8e5d..fefdc3c6ed4fd5 100644
--- a/deps/v8/test/unittests/heap/cppgc/source-location-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/source-location-unittest.cc
@@ -30,7 +30,7 @@ void TestSourceLocationCurrent() {
   static constexpr char kFunctionName[] = "TestSourceLocationCurrent";
   static constexpr size_t kNextLine = __LINE__ + 1;
   constexpr auto loc = SourceLocation::Current();
-#if !CPPGC_SUPPORTS_SOURCE_LOCATION
+#if !V8_SUPPORTS_SOURCE_LOCATION
   EXPECT_EQ(nullptr, loc.Function());
   EXPECT_EQ(nullptr, loc.FileName());
   EXPECT_EQ(0u, loc.Line());
@@ -53,7 +53,7 @@ void TestToString() {
   EXPECT_EQ(kDescriptor, string);
 }
 
-#if CPPGC_SUPPORTS_SOURCE_LOCATION
+#if V8_SUPPORTS_SOURCE_LOCATION
 TEST(SourceLocationTest, ToString) { TestToString(); }
 #endif
 
diff --git a/deps/v8/test/unittests/heap/cppgc/stack-unittest.cc b/deps/v8/test/unittests/heap/cppgc/stack-unittest.cc
index 040baa7a82dfe5..499329f6178005 100644
--- a/deps/v8/test/unittests/heap/cppgc/stack-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/stack-unittest.cc
@@ -83,7 +83,7 @@ TEST_F(GCStackTest, IteratePointersFindsOnStackValue) {
   {
     int* volatile tmp = scanner->needle();
     USE(tmp);
-    GetStack()->IteratePointers(scanner.get());
+    GetStack()->IteratePointersForTesting(scanner.get());
     EXPECT_TRUE(scanner->found());
   }
 }
@@ -98,7 +98,7 @@ TEST_F(GCStackTest, IteratePointersFindsOnStackValuePotentiallyUnaligned) {
     USE(a);
     int* volatile tmp = scanner->needle();
     USE(tmp);
-    GetStack()->IteratePointers(scanner.get());
+    GetStack()->IteratePointersForTesting(scanner.get());
     EXPECT_TRUE(scanner->found());
   }
 }
@@ -143,7 +143,7 @@ V8_NOINLINE void* RecursivelyPassOnParameterImpl(void* p1, void* p2, void* p3,
                                           nullptr, nullptr, nullptr, p7, stack,
                                           visitor);
   } else if (p8) {
-    stack->IteratePointers(visitor);
+    stack->IteratePointersForTesting(visitor);
     return p8;
   }
   return nullptr;
@@ -154,7 +154,7 @@ V8_NOINLINE void* RecursivelyPassOnParameter(size_t num, void* parameter,
                                              StackVisitor* visitor) {
   switch (num) {
     case 0:
-      stack->IteratePointers(visitor);
+      stack->IteratePointersForTesting(visitor);
       return parameter;
     case 1:
       return RecursivelyPassOnParameterImpl(nullptr, nullptr, nullptr, nullptr,
@@ -290,7 +290,7 @@ extern "C" V8_NOINLINE
 #endif  // defined(__clang__)
     void
     IteratePointersNoMangling(Stack* stack, StackVisitor* visitor) {
-  stack->IteratePointers(visitor);
+  stack->IteratePointersForTesting(visitor);
 }
 }  // namespace
 
@@ -468,7 +468,7 @@ class CheckStackAlignmentVisitor final : public StackVisitor {
 
 TEST_F(GCStackTest, StackAlignment) {
   auto checker = std::make_unique<CheckStackAlignmentVisitor>();
-  GetStack()->IteratePointers(checker.get());
+  GetStack()->IteratePointersForTesting(checker.get());
 }
 #endif  // V8_OS_LINUX && (V8_HOST_ARCH_IA32 || V8_HOST_ARCH_X64)
 
diff --git a/deps/v8/test/unittests/heap/cppgc/visitor-unittest.cc b/deps/v8/test/unittests/heap/cppgc/visitor-unittest.cc
index 9f716df314d6e2..5830757d579cad 100644
--- a/deps/v8/test/unittests/heap/cppgc/visitor-unittest.cc
+++ b/deps/v8/test/unittests/heap/cppgc/visitor-unittest.cc
@@ -6,10 +6,12 @@
 
 #include "include/cppgc/allocation.h"
 #include "include/cppgc/garbage-collected.h"
+#include "include/cppgc/member.h"
 #include "include/cppgc/trace-trait.h"
 #include "src/base/macros.h"
 #include "src/heap/cppgc/heap.h"
 #include "src/heap/cppgc/liveness-broker.h"
+#include "src/heap/cppgc/object-allocator.h"
 #include "test/unittests/heap/cppgc/tests.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -136,9 +138,26 @@ TEST_F(TraceTraitTest, MixinInstanceWithoutTrace) {
 
 namespace {
 
-class DispatchingVisitor final : public VisitorBase {
+class DispatchingVisitor : public VisitorBase {
  public:
-  DispatchingVisitor(const void* object, const void* payload)
+  ~DispatchingVisitor() override = default;
+
+  template <typename T>
+  void TraceForTesting(T* t) {
+    TraceRawForTesting(this, t);
+  }
+
+ protected:
+  void Visit(const void* t, TraceDescriptor desc) override {
+    desc.callback(this, desc.base_object_payload);
+  }
+};
+
+class CheckingVisitor final : public DispatchingVisitor {
+ public:
+  explicit CheckingVisitor(const void* object)
+      : object_(object), payload_(object) {}
+  CheckingVisitor(const void* object, const void* payload)
       : object_(object), payload_(payload) {}
 
  protected:
@@ -164,10 +183,10 @@ class DispatchingVisitor final : public VisitorBase {
 }  // namespace
 
 TEST_F(VisitorTest, DispatchTraceGCed) {
-  Member<GCed> ref = MakeGarbageCollected<GCed>(GetAllocationHandle());
-  DispatchingVisitor visitor(ref, ref);
+  auto* gced = MakeGarbageCollected<GCed>(GetAllocationHandle());
+  CheckingVisitor visitor(gced);
   EXPECT_EQ(0u, GCed::trace_callcount);
-  visitor.Trace(ref);
+  visitor.TraceForTesting(gced);
   EXPECT_EQ(1u, GCed::trace_callcount);
 }
 
@@ -177,16 +196,15 @@ TEST_F(VisitorTest, DispatchTraceGCedMixin) {
   auto* gced_mixin = static_cast<GCedMixin*>(gced_mixin_app);
   // Ensure that we indeed test dispatching an inner object.
   EXPECT_NE(static_cast<void*>(gced_mixin_app), static_cast<void*>(gced_mixin));
-  Member<GCedMixin> ref = gced_mixin;
-  DispatchingVisitor visitor(gced_mixin, gced_mixin_app);
+  CheckingVisitor visitor(gced_mixin, gced_mixin_app);
   EXPECT_EQ(0u, GCed::trace_callcount);
-  visitor.Trace(ref);
+  visitor.TraceForTesting(gced_mixin);
   EXPECT_EQ(1u, GCed::trace_callcount);
 }
 
 TEST_F(VisitorTest, DispatchTraceWeakGCed) {
   WeakMember<GCed> ref = MakeGarbageCollected<GCed>(GetAllocationHandle());
-  DispatchingVisitor visitor(ref, ref);
+  CheckingVisitor visitor(ref, ref);
   visitor.Trace(ref);
   // No marking, so reference should be cleared.
   EXPECT_EQ(nullptr, ref.Get());
@@ -199,7 +217,7 @@ TEST_F(VisitorTest, DispatchTraceWeakGCedMixin) {
   // Ensure that we indeed test dispatching an inner object.
   EXPECT_NE(static_cast<void*>(gced_mixin_app), static_cast<void*>(gced_mixin));
   WeakMember<GCedMixin> ref = gced_mixin;
-  DispatchingVisitor visitor(gced_mixin, gced_mixin_app);
+  CheckingVisitor visitor(gced_mixin, gced_mixin_app);
   visitor.Trace(ref);
   // No marking, so reference should be cleared.
   EXPECT_EQ(nullptr, ref.Get());
@@ -272,6 +290,9 @@ namespace {
 class Composite final {
  public:
   static size_t callback_callcount;
+  static constexpr size_t kExpectedTraceCount = 1;
+  static size_t TraceCount() { return callback_callcount; }
+
   Composite() { callback_callcount = 0; }
   void Trace(Visitor* visitor) const { callback_callcount++; }
 };
@@ -280,20 +301,198 @@ size_t Composite::callback_callcount;
 
 class GCedWithComposite final : public GarbageCollected<GCedWithComposite> {
  public:
+  static constexpr size_t kExpectedTraceCount = Composite::kExpectedTraceCount;
+  static size_t TraceCount() { return Composite::TraceCount(); }
+
   void Trace(Visitor* visitor) const { visitor->Trace(composite); }
 
   Composite composite;
 };
 
+class VirtualBase {
+ public:
+  virtual ~VirtualBase() = default;
+  virtual size_t GetCallbackCount() const = 0;
+};
+
+class CompositeWithVtable : public VirtualBase {
+ public:
+  static size_t callback_callcount;
+  static constexpr size_t kExpectedTraceCount = 1;
+  static size_t TraceCount() { return callback_callcount; }
+
+  CompositeWithVtable() { callback_callcount = 0; }
+  ~CompositeWithVtable() override = default;
+  void Trace(Visitor* visitor) const { callback_callcount++; }
+  size_t GetCallbackCount() const override { return callback_callcount; }
+};
+
+size_t CompositeWithVtable::callback_callcount;
+
+class GCedWithCompositeWithVtable final
+    : public GarbageCollected<GCedWithCompositeWithVtable> {
+ public:
+  static constexpr size_t kExpectedTraceCount = 1;
+  static size_t TraceCount() { return CompositeWithVtable::callback_callcount; }
+
+  void Trace(Visitor* visitor) const { visitor->Trace(composite); }
+
+  CompositeWithVtable composite;
+};
+
 }  // namespace
 
 TEST_F(VisitorTest, DispatchToCompositeObject) {
-  Member<GCedWithComposite> ref =
-      MakeGarbageCollected<GCedWithComposite>(GetAllocationHandle());
-  DispatchingVisitor visitor(ref, ref);
-  EXPECT_EQ(0u, Composite::callback_callcount);
-  visitor.Trace(ref);
-  EXPECT_EQ(1u, Composite::callback_callcount);
+  auto* gced = MakeGarbageCollected<GCedWithComposite>(GetAllocationHandle());
+  CheckingVisitor visitor(gced);
+  EXPECT_EQ(0u, GCedWithComposite::TraceCount());
+  visitor.TraceForTesting(gced);
+  EXPECT_EQ(GCedWithComposite::kExpectedTraceCount,
+            GCedWithComposite::TraceCount());
+}
+
+TEST_F(VisitorTest, DispatchToCompositeObjectWithVtable) {
+  auto* gced =
+      MakeGarbageCollected<GCedWithCompositeWithVtable>(GetAllocationHandle());
+  CheckingVisitor visitor(gced);
+  EXPECT_EQ(0u, GCedWithCompositeWithVtable::TraceCount());
+  visitor.TraceForTesting(gced);
+  EXPECT_EQ(GCedWithCompositeWithVtable::kExpectedTraceCount,
+            GCedWithCompositeWithVtable::TraceCount());
+}
+
+namespace {
+
+// Fibonacci hashing. See boost::hash_combine.
+inline void hash_combine(std::size_t& seed) {}
+
+template <typename T, typename... Rest>
+void hash_combine(size_t& seed, const T& v, Rest... rest) {
+  std::hash<T> hasher;
+  seed ^= hasher(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
+  hash_combine(seed, rest...);
+}
+
+class HashingVisitor final : public DispatchingVisitor {
+ public:
+  size_t hash() const { return hash_; }
+
+ protected:
+  void Visit(const void* t, TraceDescriptor desc) final {
+    hash_combine(hash_, desc.base_object_payload);
+    desc.callback(this, desc.base_object_payload);
+  }
+
+ private:
+  size_t hash_ = 0;
+};
+
+template <template <class> class MemberType, typename GCType>
+class GCedWithMultipleMember final
+    : public GarbageCollected<GCedWithMultipleMember<MemberType, GCType>> {
+ public:
+  static constexpr size_t kNumElements = 17;
+  static constexpr size_t kExpectedTraceCount = kNumElements;
+  static size_t TraceCount() { return GCType::TraceCount(); }
+
+  void Trace(Visitor* visitor) const {
+    visitor->TraceMultiple(fields, kNumElements);
+  }
+
+  MemberType<GCType> fields[kNumElements];
+};
+
+template <class GCType>
+void DispatchMultipleMemberTest(AllocationHandle& handle) {
+  size_t hash = 0;
+  auto* holder = MakeGarbageCollected<GCType>(handle);
+  hash_combine(hash, holder);
+  for (auto i = 0u; i < GCType::kNumElements; ++i) {
+    holder->fields[i] = MakeGarbageCollected<GCedWithComposite>(handle);
+    hash_combine(hash, holder->fields[i].Get());
+  }
+  HashingVisitor visitor;
+  EXPECT_EQ(0u, GCType::TraceCount());
+  visitor.TraceForTesting(holder);
+  EXPECT_EQ(GCType::kExpectedTraceCount, GCType::TraceCount());
+  EXPECT_NE(0u, hash);
+  EXPECT_EQ(hash, visitor.hash());
+}
+
+}  // namespace
+
+TEST_F(VisitorTest, DispatchToMultipleMember) {
+  using GCType = GCedWithMultipleMember<Member, GCedWithComposite>;
+  DispatchMultipleMemberTest<GCType>(GetAllocationHandle());
+}
+
+TEST_F(VisitorTest, DispatchToMultipleUncompressedMember) {
+  using GCType =
+      GCedWithMultipleMember<subtle::UncompressedMember, GCedWithComposite>;
+  DispatchMultipleMemberTest<GCType>(GetAllocationHandle());
+}
+
+namespace {
+
+class GCedWithMultipleComposite final
+    : public GarbageCollected<GCedWithMultipleComposite> {
+ public:
+  static constexpr size_t kNumElements = 17;
+  static constexpr size_t kExpectedTraceCount =
+      kNumElements * Composite::kExpectedTraceCount;
+  static size_t TraceCount() { return Composite::TraceCount(); }
+
+  void Trace(Visitor* visitor) const {
+    visitor->TraceMultiple(fields, kNumElements);
+  }
+
+  Composite fields[kNumElements];
+};
+
+class GCedWithMultipleCompositeUninitializedVtable final
+    : public GarbageCollected<GCedWithMultipleCompositeUninitializedVtable> {
+ public:
+  static constexpr size_t kNumElements = 17;
+  static constexpr size_t kExpectedTraceCount =
+      kNumElements * CompositeWithVtable::kExpectedTraceCount;
+  static size_t TraceCount() { return CompositeWithVtable::TraceCount(); }
+
+  explicit GCedWithMultipleCompositeUninitializedVtable(
+      size_t initialized_fields) {
+    // Clear some vtable pointers. Such objects should not be traced.
+    memset(static_cast<void*>(&fields[initialized_fields]), 0,
+           sizeof(CompositeWithVtable) * (kNumElements - initialized_fields));
+  }
+
+  void Trace(Visitor* visitor) const {
+    visitor->TraceMultiple(fields, kNumElements);
+  }
+
+  CompositeWithVtable fields[kNumElements];
+};
+
+}  // namespace
+
+TEST_F(VisitorTest, DispatchToMultipleCompositeObjects) {
+  auto* holder =
+      MakeGarbageCollected<GCedWithMultipleComposite>(GetAllocationHandle());
+  DispatchingVisitor visitor;
+  EXPECT_EQ(0u, GCedWithMultipleComposite::TraceCount());
+  visitor.TraceForTesting(holder);
+  EXPECT_EQ(GCedWithMultipleComposite::kExpectedTraceCount,
+            GCedWithMultipleComposite::TraceCount());
+}
+
+TEST_F(VisitorTest, DispatchMultipleInlinedObjectsWithClearedVtable) {
+  auto* holder =
+      MakeGarbageCollected<GCedWithMultipleCompositeUninitializedVtable>(
+          GetAllocationHandle(), GCedWithMultipleComposite::kNumElements / 2);
+  DispatchingVisitor visitor;
+  EXPECT_EQ(0u, GCedWithMultipleCompositeUninitializedVtable::TraceCount());
+  visitor.TraceForTesting(holder);
+  EXPECT_EQ(
+      GCedWithMultipleCompositeUninitializedVtable::kExpectedTraceCount / 2,
+      GCedWithMultipleCompositeUninitializedVtable::TraceCount());
 }
 
 }  // namespace internal
diff --git a/deps/v8/test/unittests/heap/direct-handles-unittest.cc b/deps/v8/test/unittests/heap/direct-handles-unittest.cc
new file mode 100644
index 00000000000000..b27fe117688c9e
--- /dev/null
+++ b/deps/v8/test/unittests/heap/direct-handles-unittest.cc
@@ -0,0 +1,205 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/heap/heap.h"
+#include "src/heap/local-heap.h"
+#include "src/heap/parked-scope-inl.h"
+#include "test/unittests/heap/heap-utils.h"
+#include "test/unittests/test-utils.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace v8 {
+
+using DirectHandlesTest = TestWithIsolate;
+
+TEST_F(DirectHandlesTest, CreateDirectHandleFromLocal) {
+  HandleScope scope(isolate());
+  Local<String> foo = String::NewFromUtf8Literal(isolate(), "foo");
+
+  i::DirectHandle<i::String> direct = Utils::OpenDirectHandle(*foo);
+  i::Handle<i::String> handle = Utils::OpenHandle(*foo);
+
+  EXPECT_EQ(*direct, *handle);
+}
+
+TEST_F(DirectHandlesTest, CreateLocalFromDirectHandle) {
+  HandleScope scope(isolate());
+  i::Handle<i::String> handle =
+      i_isolate()->factory()->NewStringFromAsciiChecked("foo");
+  i::DirectHandle<i::String> direct = handle;
+
+  Local<String> l1 = Utils::ToLocal(direct, i_isolate());
+  Local<String> l2 = Utils::ToLocal(handle);
+
+  EXPECT_EQ(l1, l2);
+}
+
+TEST_F(DirectHandlesTest, CreateMaybeDirectHandle) {
+  HandleScope scope(isolate());
+  i::Handle<i::String> handle =
+      i_isolate()->factory()->NewStringFromAsciiChecked("foo");
+  i::DirectHandle<i::String> direct = handle;
+
+  i::MaybeDirectHandle<i::String> maybe_direct(direct);
+  i::MaybeHandle<i::String> maybe_handle(handle);
+
+  EXPECT_EQ(*maybe_direct.ToHandleChecked(), *maybe_handle.ToHandleChecked());
+}
+
+TEST_F(DirectHandlesTest, CreateMaybeDirectObjectHandle) {
+  HandleScope scope(isolate());
+  i::Handle<i::String> handle =
+      i_isolate()->factory()->NewStringFromAsciiChecked("foo");
+  i::DirectHandle<i::String> direct = handle;
+
+  i::MaybeObjectDirectHandle maybe_direct(direct);
+  i::MaybeObjectHandle maybe_handle(handle);
+
+  EXPECT_EQ(*maybe_direct, *maybe_handle);
+}
+
+TEST_F(DirectHandlesTest, IsIdenticalTo) {
+  i::DirectHandle<i::String> d1 =
+      i_isolate()->factory()->NewStringFromAsciiChecked("foo");
+  i::DirectHandle<i::String> d2(d1);
+
+  i::DirectHandle<i::String> d3 =
+      i_isolate()->factory()->NewStringFromAsciiChecked("bar");
+  i::DirectHandle<i::String> d4;
+  i::DirectHandle<i::String> d5;
+
+  EXPECT_TRUE(d1.is_identical_to(d2));
+  EXPECT_TRUE(d2.is_identical_to(d1));
+  EXPECT_FALSE(d1.is_identical_to(d3));
+  EXPECT_FALSE(d1.is_identical_to(d4));
+  EXPECT_FALSE(d4.is_identical_to(d1));
+  EXPECT_TRUE(d4.is_identical_to(d5));
+}
+
+TEST_F(DirectHandlesTest, MaybeObjectDirectHandleIsIdenticalTo) {
+  i::DirectHandle<i::String> foo =
+      i_isolate()->factory()->NewStringFromAsciiChecked("foo");
+  i::DirectHandle<i::String> bar =
+      i_isolate()->factory()->NewStringFromAsciiChecked("bar");
+
+  i::MaybeObjectDirectHandle d1(foo);
+  i::MaybeObjectDirectHandle d2(foo);
+  i::MaybeObjectDirectHandle d3(bar);
+  i::MaybeObjectDirectHandle d4;
+  i::MaybeObjectDirectHandle d5;
+
+  EXPECT_TRUE(d1.is_identical_to(d2));
+  EXPECT_TRUE(d2.is_identical_to(d1));
+  EXPECT_FALSE(d1.is_identical_to(d3));
+  EXPECT_FALSE(d1.is_identical_to(d4));
+  EXPECT_FALSE(d4.is_identical_to(d1));
+  EXPECT_TRUE(d4.is_identical_to(d5));
+}
+
+// Tests to check DirectHandle usage.
+// Such usage violations are only detected in debug builds, with the
+// compile-time flag for enabling direct handles.
+
+#if defined(DEBUG) && defined(V8_ENABLE_DIRECT_HANDLE)
+
+namespace {
+template <typename Callback>
+void CheckDirectHandleUsage(Callback callback) {
+  EXPECT_DEATH_IF_SUPPORTED(callback(), "");
+}
+}  // anonymous namespace
+
+TEST_F(DirectHandlesTest, DirectHandleOutOfStackFails) {
+  // Out-of-stack allocation of direct handles should fail.
+  CheckDirectHandleUsage([]() {
+    auto ptr = std::make_unique<i::DirectHandle<i::String>>();
+    USE(ptr);
+  });
+}
+
+namespace {
+class BackgroundThread final : public v8::base::Thread {
+ public:
+  explicit BackgroundThread(i::Heap* heap)
+      : v8::base::Thread(base::Thread::Options("BackgroundThread")),
+        heap_(heap) {}
+
+  void Run() override {
+    i::LocalHeap lh(heap_, i::ThreadKind::kBackground);
+    // Usage of direct handles in background threads should fail.
+    CheckDirectHandleUsage([]() {
+      i::DirectHandle<i::String> direct;
+      USE(direct);
+    });
+  }
+
+  i::Heap* heap_;
+};
+}  // anonymous namespace
+
+TEST_F(DirectHandlesTest, DirectHandleInBackgroundThreadFails) {
+  i::Heap* heap = i_isolate()->heap();
+  i::LocalHeap lh(heap, i::ThreadKind::kMain);
+  lh.SetUpMainThreadForTesting();
+  auto thread = std::make_unique<BackgroundThread>(heap);
+  CHECK(thread->Start());
+  thread->Join();
+}
+
+#if V8_CAN_CREATE_SHARED_HEAP_BOOL
+
+using DirectHandlesSharedTest = i::TestJSSharedMemoryWithIsolate;
+
+namespace {
+class ClientThread final : public i::ParkingThread {
+ public:
+  ClientThread() : ParkingThread(base::Thread::Options("ClientThread")) {}
+
+  void Run() override {
+    IsolateWrapper isolate_wrapper(kNoCounters);
+    // Direct handles can be used in the main thread of client isolates.
+    i::DirectHandle<i::String> direct;
+    USE(direct);
+  }
+};
+}  // anonymous namespace
+
+TEST_F(DirectHandlesSharedTest, DirectHandleInClient) {
+  auto thread = std::make_unique<ClientThread>();
+  CHECK(thread->Start());
+  thread->ParkedJoin(i_isolate()->main_thread_local_isolate());
+}
+
+namespace {
+class ClientMainThread final : public i::ParkingThread {
+ public:
+  ClientMainThread()
+      : ParkingThread(base::Thread::Options("ClientMainThread")) {}
+
+  void Run() override {
+    IsolateWrapper isolate_wrapper(kNoCounters);
+    Isolate* client_isolate = isolate_wrapper.isolate();
+    i::Isolate* i_client_isolate =
+        reinterpret_cast<i::Isolate*>(client_isolate);
+
+    i::Heap* heap = i_client_isolate->heap();
+    i::LocalHeap lh(heap, i::ThreadKind::kMain);
+    lh.SetUpMainThreadForTesting();
+    auto thread = std::make_unique<BackgroundThread>(heap);
+    CHECK(thread->Start());
+    thread->Join();
+  }
+};
+}  // anonymous namespace
+
+TEST_F(DirectHandlesSharedTest, DirectHandleInClientBackgroundThreadFails) {
+  auto thread = std::make_unique<ClientMainThread>();
+  CHECK(thread->Start());
+  thread->ParkedJoin(i_isolate()->main_thread_local_isolate());
+}
+
+#endif  // V8_CAN_CREATE_SHARED_HEAP_BOOL
+#endif  // DEBUG && V8_ENABLE_DIRECT_HANDLE
+
+}  // namespace v8
diff --git a/deps/v8/test/unittests/heap/gc-idle-time-handler-unittest.cc b/deps/v8/test/unittests/heap/gc-idle-time-handler-unittest.cc
index 8aba018393ceec..c40463a4172f02 100644
--- a/deps/v8/test/unittests/heap/gc-idle-time-handler-unittest.cc
+++ b/deps/v8/test/unittests/heap/gc-idle-time-handler-unittest.cc
@@ -35,41 +35,6 @@ class GCIdleTimeHandlerTest : public ::testing::Test {
 
 }  // namespace
 
-
-TEST(GCIdleTimeHandler, EstimateMarkingStepSizeInitial) {
-  size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize(1, 0);
-  EXPECT_EQ(
-      static_cast<size_t>(GCIdleTimeHandler::kInitialConservativeMarkingSpeed *
-                          GCIdleTimeHandler::kConservativeTimeRatio),
-      step_size);
-}
-
-
-TEST(GCIdleTimeHandler, EstimateMarkingStepSizeNonZero) {
-  size_t marking_speed_in_bytes_per_millisecond = 100;
-  size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize(
-      1, marking_speed_in_bytes_per_millisecond);
-  EXPECT_EQ(static_cast<size_t>(marking_speed_in_bytes_per_millisecond *
-                                GCIdleTimeHandler::kConservativeTimeRatio),
-            step_size);
-}
-
-
-TEST(GCIdleTimeHandler, EstimateMarkingStepSizeOverflow1) {
-  size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize(
-      10, static_cast<double>(std::numeric_limits<size_t>::max()));
-  EXPECT_EQ(static_cast<size_t>(GCIdleTimeHandler::kMaximumMarkingStepSize),
-            step_size);
-}
-
-
-TEST(GCIdleTimeHandler, EstimateMarkingStepSizeOverflow2) {
-  size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize(
-      static_cast<double>(std::numeric_limits<size_t>::max()), 10);
-  EXPECT_EQ(static_cast<size_t>(GCIdleTimeHandler::kMaximumMarkingStepSize),
-            step_size);
-}
-
 TEST_F(GCIdleTimeHandlerTest, IncrementalMarking1) {
   if (!handler()->Enabled()) return;
   GCIdleTimeHeapState heap_state = DefaultHeapState();
diff --git a/deps/v8/test/unittests/heap/gc-tracer-unittest.cc b/deps/v8/test/unittests/heap/gc-tracer-unittest.cc
index 6865486d538043..6ec004013b50ad 100644
--- a/deps/v8/test/unittests/heap/gc-tracer-unittest.cc
+++ b/deps/v8/test/unittests/heap/gc-tracer-unittest.cc
@@ -14,53 +14,18 @@
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
-namespace v8 {
-namespace internal {
+namespace v8::internal {
 
 using GCTracerTest = TestWithContext;
 
-TEST(GCTracer, AverageSpeed) {
-  base::RingBuffer<BytesAndDuration> buffer;
-  EXPECT_EQ(100 / 2,
-            GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(100, 2), 0));
-  buffer.Push(MakeBytesAndDuration(100, 8));
-  EXPECT_EQ(100 / 2,
-            GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(100, 2), 2));
-  EXPECT_EQ(200 / 10,
-            GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(100, 2), 3));
-  const int max_speed = 1024 * MB;
-  buffer.Reset();
-  buffer.Push(MakeBytesAndDuration(max_speed, 0.5));
-  EXPECT_EQ(max_speed,
-            GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(0, 0), 1));
-  const int min_speed = 1;
-  buffer.Reset();
-  buffer.Push(MakeBytesAndDuration(1, 10000));
-  EXPECT_EQ(min_speed,
-            GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(0, 0), 1));
-  buffer.Reset();
-  int sum = 0;
-  for (int i = 0; i < buffer.kSize; i++) {
-    sum += i + 1;
-    buffer.Push(MakeBytesAndDuration(i + 1, 1));
-  }
-  EXPECT_EQ(
-      sum * 1.0 / buffer.kSize,
-      GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(0, 0), buffer.kSize));
-  buffer.Push(MakeBytesAndDuration(100, 1));
-  EXPECT_EQ(
-      (sum * 1.0 - 1 + 100) / buffer.kSize,
-      GCTracer::AverageSpeed(buffer, MakeBytesAndDuration(0, 0), buffer.kSize));
-}
-
 namespace {
 
-void SampleAndAddAllocation(GCTracer* tracer, double time_ms,
+void SampleAndAddAllocation(GCTracer* tracer, base::TimeTicks time,
                             size_t per_space_counter_bytes) {
   // Increment counters of all spaces.
-  tracer->SampleAllocation(time_ms, per_space_counter_bytes,
+  tracer->SampleAllocation(time, per_space_counter_bytes,
                            per_space_counter_bytes, per_space_counter_bytes);
-  tracer->AddAllocation(time_ms);
+  tracer->AddAllocation(time);
 }
 
 enum class StartTracingMode {
@@ -71,7 +36,8 @@ enum class StartTracingMode {
 };
 
 void StartTracing(GCTracer* tracer, GarbageCollector collector,
-                  StartTracingMode mode) {
+                  StartTracingMode mode,
+                  base::Optional<base::TimeTicks> time = {}) {
   DCHECK_IMPLIES(mode != StartTracingMode::kAtomic,
                  !Heap::IsYoungGenerationCollector(collector));
   // Start the cycle for incremental marking.
@@ -84,7 +50,7 @@ void StartTracing(GCTracer* tracer, GarbageCollector collector,
   // If just that was requested, no more to be done.
   if (mode == StartTracingMode::kIncrementalStart) return;
   // Else, we enter the observable pause.
-  tracer->StartObservablePause();
+  tracer->StartObservablePause(time.value_or(base::TimeTicks::Now()));
   // Start an atomic GC cycle.
   if (mode == StartTracingMode::kAtomic) {
     tracer->StartCycle(collector, GarbageCollectionReason::kTesting,
@@ -99,15 +65,15 @@ void StartTracing(GCTracer* tracer, GarbageCollector collector,
   }
 }
 
-void StopTracing(GCTracer* tracer, GarbageCollector collector) {
+void StopTracing(GCTracer* tracer, GarbageCollector collector,
+                 base::Optional<base::TimeTicks> time = {}) {
   tracer->StopAtomicPause();
-  tracer->StopObservablePause();
-  tracer->UpdateStatistics(collector);
+  tracer->StopObservablePause(collector, time.value_or(base::TimeTicks::Now()));
   switch (collector) {
     case GarbageCollector::SCAVENGER:
       tracer->StopYoungCycleIfNeeded();
       break;
-    case GarbageCollector::MINOR_MARK_COMPACTOR:
+    case GarbageCollector::MINOR_MARK_SWEEPER:
       tracer->NotifyYoungSweepingCompleted();
       break;
     case GarbageCollector::MARK_COMPACTOR:
@@ -126,25 +92,31 @@ TEST_F(GCTracerTest, AllocationThroughput) {
 
   const int time1 = 100;
   const size_t counter1 = 1000;
-  SampleAndAddAllocation(tracer, time1, counter1);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time1),
+                         counter1);
   const int time2 = 200;
   const size_t counter2 = 2000;
-  SampleAndAddAllocation(tracer, time2, counter2);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time2),
+                         counter2);
   // Will only consider the current sample.
-  EXPECT_EQ(2 * (counter2 - counter1) / (time2 - time1),
-            static_cast<size_t>(
-                tracer->AllocationThroughputInBytesPerMillisecond(100)));
+  EXPECT_EQ(
+      2 * (counter2 - counter1) / (time2 - time1),
+      static_cast<size_t>(tracer->AllocationThroughputInBytesPerMillisecond(
+          base::TimeDelta::FromMilliseconds(100))));
   const int time3 = 1000;
   const size_t counter3 = 30000;
-  SampleAndAddAllocation(tracer, time3, counter3);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time3),
+                         counter3);
   // Only consider last sample.
-  EXPECT_EQ(2 * (counter3 - counter2) / (time3 - time2),
-            static_cast<size_t>(
-                tracer->AllocationThroughputInBytesPerMillisecond(800)));
+  EXPECT_EQ(
+      2 * (counter3 - counter2) / (time3 - time2),
+      static_cast<size_t>(tracer->AllocationThroughputInBytesPerMillisecond(
+          base::TimeDelta::FromMilliseconds(800))));
   // Considers last 2 samples.
-  EXPECT_EQ(2 * (counter3 - counter1) / (time3 - time1),
-            static_cast<size_t>(
-                tracer->AllocationThroughputInBytesPerMillisecond(801)));
+  EXPECT_EQ(
+      2 * (counter3 - counter1) / (time3 - time1),
+      static_cast<size_t>(tracer->AllocationThroughputInBytesPerMillisecond(
+          base::TimeDelta::FromMilliseconds(801))));
 }
 
 TEST_F(GCTracerTest, PerGenerationAllocationThroughput) {
@@ -154,11 +126,13 @@ TEST_F(GCTracerTest, PerGenerationAllocationThroughput) {
 
   const int time1 = 100;
   const size_t counter1 = 1000;
-  SampleAndAddAllocation(tracer, time1, counter1);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time1),
+                         counter1);
   const int time2 = 200;
   const size_t counter2 = 2000;
-  SampleAndAddAllocation(tracer, time2, counter2);
-  const size_t expected_throughput1 = (counter2 - counter1) / (time2 - time1);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time2),
+                         counter2);
+  const size_t expected_throughput1 = (counter2 - counter1) / (200 - 100);
   EXPECT_EQ(expected_throughput1,
             static_cast<size_t>(
                 tracer->NewSpaceAllocationThroughputInBytesPerMillisecond()));
@@ -171,7 +145,8 @@ TEST_F(GCTracerTest, PerGenerationAllocationThroughput) {
                 tracer->EmbedderAllocationThroughputInBytesPerMillisecond()));
   const int time3 = 1000;
   const size_t counter3 = 30000;
-  SampleAndAddAllocation(tracer, time3, counter3);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time3),
+                         counter3);
   const size_t expected_throughput2 = (counter3 - counter1) / (time3 - time1);
   EXPECT_EQ(expected_throughput2,
             static_cast<size_t>(
@@ -192,42 +167,45 @@ TEST_F(GCTracerTest, PerGenerationAllocationThroughputWithProvidedTime) {
 
   const int time1 = 100;
   const size_t counter1 = 1000;
-  SampleAndAddAllocation(tracer, time1, counter1);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time1),
+                         counter1);
   const int time2 = 200;
   const size_t counter2 = 2000;
-  SampleAndAddAllocation(tracer, time2, counter2);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time2),
+                         counter2);
   const size_t expected_throughput1 = (counter2 - counter1) / (time2 - time1);
-  EXPECT_EQ(
-      expected_throughput1,
-      static_cast<size_t>(
-          tracer->NewSpaceAllocationThroughputInBytesPerMillisecond(100)));
-  EXPECT_EQ(
-      expected_throughput1,
-      static_cast<size_t>(
-          tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(100)));
+  EXPECT_EQ(expected_throughput1,
+            static_cast<size_t>(
+                tracer->NewSpaceAllocationThroughputInBytesPerMillisecond(
+                    base::TimeDelta::FromMilliseconds(100))));
+  EXPECT_EQ(expected_throughput1,
+            static_cast<size_t>(
+                tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(
+                    base::TimeDelta::FromMilliseconds(100))));
   const int time3 = 1000;
   const size_t counter3 = 30000;
-  SampleAndAddAllocation(tracer, time3, counter3);
+  SampleAndAddAllocation(tracer, base::TimeTicks::FromMsTicksForTesting(time3),
+                         counter3);
   const size_t expected_throughput2 = (counter3 - counter2) / (time3 - time2);
   // Only consider last sample.
-  EXPECT_EQ(
-      expected_throughput2,
-      static_cast<size_t>(
-          tracer->NewSpaceAllocationThroughputInBytesPerMillisecond(800)));
-  EXPECT_EQ(
-      expected_throughput2,
-      static_cast<size_t>(
-          tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(800)));
+  EXPECT_EQ(expected_throughput2,
+            static_cast<size_t>(
+                tracer->NewSpaceAllocationThroughputInBytesPerMillisecond(
+                    base::TimeDelta::FromMilliseconds(800))));
+  EXPECT_EQ(expected_throughput2,
+            static_cast<size_t>(
+                tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(
+                    base::TimeDelta::FromMilliseconds(800))));
   const size_t expected_throughput3 = (counter3 - counter1) / (time3 - time1);
   // Consider last two samples.
-  EXPECT_EQ(
-      expected_throughput3,
-      static_cast<size_t>(
-          tracer->NewSpaceAllocationThroughputInBytesPerMillisecond(801)));
-  EXPECT_EQ(
-      expected_throughput3,
-      static_cast<size_t>(
-          tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(801)));
+  EXPECT_EQ(expected_throughput3,
+            static_cast<size_t>(
+                tracer->NewSpaceAllocationThroughputInBytesPerMillisecond(
+                    base::TimeDelta::FromMilliseconds(801))));
+  EXPECT_EQ(expected_throughput3,
+            static_cast<size_t>(
+                tracer->OldGenerationAllocationThroughputInBytesPerMillisecond(
+                    base::TimeDelta::FromMilliseconds(801))));
 }
 
 TEST_F(GCTracerTest, RegularScope) {
@@ -235,14 +213,18 @@ TEST_F(GCTracerTest, RegularScope) {
   GCTracer* tracer = i_isolate()->heap()->tracer();
   tracer->ResetForTesting();
 
-  EXPECT_DOUBLE_EQ(0.0, tracer->current_.scopes[GCTracer::Scope::MC_MARK]);
+  EXPECT_EQ(base::TimeDelta(),
+            tracer->current_.scopes[GCTracer::Scope::MC_MARK]);
   // Sample not added because the cycle has not started.
-  tracer->AddScopeSample(GCTracer::Scope::MC_MARK, 10);
+  tracer->AddScopeSample(GCTracer::Scope::MC_MARK,
+                         base::TimeDelta::FromMilliseconds(10));
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
                StartTracingMode::kAtomic);
-  tracer->AddScopeSample(GCTracer::Scope::MC_MARK, 100);
+  tracer->AddScopeSample(GCTracer::Scope::MC_MARK,
+                         base::TimeDelta::FromMilliseconds(100));
   StopTracing(tracer, GarbageCollector::MARK_COMPACTOR);
-  EXPECT_DOUBLE_EQ(100.0, tracer->current_.scopes[GCTracer::Scope::MC_MARK]);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(100),
+            tracer->current_.scopes[GCTracer::Scope::MC_MARK]);
 }
 
 TEST_F(GCTracerTest, IncrementalScope) {
@@ -250,16 +232,18 @@ TEST_F(GCTracerTest, IncrementalScope) {
   GCTracer* tracer = i_isolate()->heap()->tracer();
   tracer->ResetForTesting();
 
-  EXPECT_DOUBLE_EQ(
-      0.0, tracer->current_.scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]);
+  EXPECT_EQ(base::TimeDelta(),
+            tracer->current_.scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]);
   // Sample is added because its ScopeId is listed as incremental sample.
-  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE, 100);
+  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE,
+                         base::TimeDelta::FromMilliseconds(100));
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
                StartTracingMode::kIncremental);
-  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE, 100);
+  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE,
+                         base::TimeDelta::FromMilliseconds(100));
   StopTracing(tracer, GarbageCollector::MARK_COMPACTOR);
-  EXPECT_DOUBLE_EQ(
-      200.0, tracer->current_.scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(200),
+            tracer->current_.scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]);
 }
 
 TEST_F(GCTracerTest, IncrementalMarkingDetails) {
@@ -268,58 +252,65 @@ TEST_F(GCTracerTest, IncrementalMarkingDetails) {
   tracer->ResetForTesting();
 
   // Round 1.
-  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE, 50);
+  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE,
+                         base::TimeDelta::FromMilliseconds(50));
   // Scavenger has no impact on incremental marking details.
   StartTracing(tracer, GarbageCollector::SCAVENGER, StartTracingMode::kAtomic);
   StopTracing(tracer, GarbageCollector::SCAVENGER);
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
                StartTracingMode::kIncremental);
-  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE, 100);
+  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE,
+                         base::TimeDelta::FromMilliseconds(100));
   StopTracing(tracer, GarbageCollector::MARK_COMPACTOR);
-  EXPECT_DOUBLE_EQ(
-      100, tracer->current_
-               .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
-               .longest_step);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(100),
+            tracer->current_
+                .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
+                .longest_step);
   EXPECT_EQ(2, tracer->current_
                    .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
                    .steps);
-  EXPECT_DOUBLE_EQ(
-      150, tracer->current_
-               .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
-               .duration);
-  EXPECT_DOUBLE_EQ(
-      150, tracer->current_.scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(150),
+            tracer->current_
+                .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
+                .duration);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(150),
+            tracer->current_.scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]);
 
   // Round 2. Numbers should be reset.
-  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE, 13);
-  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE, 15);
+  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE,
+                         base::TimeDelta::FromMilliseconds(13));
+  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE,
+                         base::TimeDelta::FromMilliseconds(15));
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
                StartTracingMode::kIncremental);
-  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE, 122);
+  tracer->AddScopeSample(GCTracer::Scope::MC_INCREMENTAL_FINALIZE,
+                         base::TimeDelta::FromMilliseconds(122));
   StopTracing(tracer, GarbageCollector::MARK_COMPACTOR);
-  EXPECT_DOUBLE_EQ(
-      122, tracer->current_
-               .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
-               .longest_step);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(122),
+            tracer->current_
+                .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
+                .longest_step);
   EXPECT_EQ(3, tracer->current_
                    .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
                    .steps);
-  EXPECT_DOUBLE_EQ(
-      150, tracer->current_
-               .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
-               .duration);
-  EXPECT_DOUBLE_EQ(
-      150, tracer->current_.scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(150),
+            tracer->current_
+                .incremental_scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]
+                .duration);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(150),
+            tracer->current_.scopes[GCTracer::Scope::MC_INCREMENTAL_FINALIZE]);
 }
 
 TEST_F(GCTracerTest, IncrementalMarkingSpeed) {
   if (v8_flags.stress_incremental_marking) return;
   GCTracer* tracer = i_isolate()->heap()->tracer();
   tracer->ResetForTesting();
+  tracer->previous_mark_compact_end_time_ = base::TimeTicks();
 
   // Round 1.
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
-               StartTracingMode::kIncrementalStart);
+               StartTracingMode::kIncrementalStart,
+               base::TimeTicks::FromMsTicksForTesting(0));
   // 1000000 bytes in 100ms.
   tracer->AddIncrementalMarkingStep(100, 1000000);
   EXPECT_EQ(1000000 / 100,
@@ -333,31 +324,39 @@ TEST_F(GCTracerTest, IncrementalMarkingSpeed) {
   StopTracing(tracer, GarbageCollector::SCAVENGER);
   // 1000000 bytes in 100ms.
   tracer->AddIncrementalMarkingStep(100, 1000000);
-  EXPECT_EQ(300, tracer->incremental_marking_duration_);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(300),
+            tracer->incremental_marking_duration_);
   EXPECT_EQ(3000000u, tracer->incremental_marking_bytes_);
   EXPECT_EQ(1000000 / 100,
             tracer->IncrementalMarkingSpeedInBytesPerMillisecond());
   // 1000000 bytes in 100ms.
   tracer->AddIncrementalMarkingStep(100, 1000000);
-  EXPECT_EQ(400, tracer->incremental_marking_duration_);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(400),
+            tracer->incremental_marking_duration_);
   EXPECT_EQ(4000000u, tracer->incremental_marking_bytes_);
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
-               StartTracingMode::kIncrementalEnterPause);
-  StopTracing(tracer, GarbageCollector::MARK_COMPACTOR);
-  EXPECT_EQ(400, tracer->current_.incremental_marking_duration);
+               StartTracingMode::kIncrementalEnterPause,
+               base::TimeTicks::FromMsTicksForTesting(500));
+  StopTracing(tracer, GarbageCollector::MARK_COMPACTOR,
+              base::TimeTicks::FromMsTicksForTesting(600));
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(400),
+            tracer->current_.incremental_marking_duration);
   EXPECT_EQ(4000000u, tracer->current_.incremental_marking_bytes);
-  EXPECT_EQ(0, tracer->incremental_marking_duration_);
+  EXPECT_TRUE(tracer->incremental_marking_duration_.IsZero());
   EXPECT_EQ(0u, tracer->incremental_marking_bytes_);
   EXPECT_EQ(1000000 / 100,
             tracer->IncrementalMarkingSpeedInBytesPerMillisecond());
 
   // Round 2.
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
-               StartTracingMode::kIncrementalStart);
+               StartTracingMode::kIncrementalStart,
+               base::TimeTicks::FromMsTicksForTesting(700));
   tracer->AddIncrementalMarkingStep(2000, 1000);
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
-               StartTracingMode::kIncrementalEnterPause);
-  StopTracing(tracer, GarbageCollector::MARK_COMPACTOR);
+               StartTracingMode::kIncrementalEnterPause,
+               base::TimeTicks::FromMsTicksForTesting(3000));
+  StopTracing(tracer, GarbageCollector::MARK_COMPACTOR,
+              base::TimeTicks::FromMsTicksForTesting(3100));
   EXPECT_DOUBLE_EQ((4000000.0 / 400 + 1000.0 / 2000) / 2,
                    static_cast<double>(
                        tracer->IncrementalMarkingSpeedInBytesPerMillisecond()));
@@ -367,34 +366,38 @@ TEST_F(GCTracerTest, MutatorUtilization) {
   if (v8_flags.stress_incremental_marking) return;
   GCTracer* tracer = i_isolate()->heap()->tracer();
   tracer->ResetForTesting();
+  tracer->previous_mark_compact_end_time_ = base::TimeTicks();
 
   // Mark-compact #1 ended at 200ms and took 100ms.
-  tracer->RecordMutatorUtilization(200, 100);
-  // Avarage mark-compact time = 0ms.
-  // Avarage mutator time = 0ms.
-  EXPECT_DOUBLE_EQ(1.0, tracer->CurrentMarkCompactMutatorUtilization());
-  EXPECT_DOUBLE_EQ(1.0, tracer->AverageMarkCompactMutatorUtilization());
+  tracer->RecordMutatorUtilization(base::TimeTicks::FromMsTicksForTesting(200),
+                                   base::TimeDelta::FromMilliseconds(100));
+  // Average mark-compact time = 100ms.
+  // Average mutator time = 100ms.
+  EXPECT_DOUBLE_EQ(0.5, tracer->CurrentMarkCompactMutatorUtilization());
+  EXPECT_DOUBLE_EQ(0.5, tracer->AverageMarkCompactMutatorUtilization());
 
   // Mark-compact #2 ended at 400ms and took 100ms.
-  tracer->RecordMutatorUtilization(400, 100);
-  // The first mark-compactor is ignored.
-  // Avarage mark-compact time = 100ms.
-  // Avarage mutator time = 100ms.
+  tracer->RecordMutatorUtilization(base::TimeTicks::FromMsTicksForTesting(400),
+                                   base::TimeDelta::FromMilliseconds(100));
+  // Average mark-compact time = 100ms * 0.5 + 100ms * 0.5.
+  // Average mutator time = 100ms * 0.5 + 100ms * 0.5.
   EXPECT_DOUBLE_EQ(0.5, tracer->CurrentMarkCompactMutatorUtilization());
   EXPECT_DOUBLE_EQ(0.5, tracer->AverageMarkCompactMutatorUtilization());
 
   // Mark-compact #3 ended at 600ms and took 200ms.
-  tracer->RecordMutatorUtilization(600, 200);
-  // Avarage mark-compact time = 100ms * 0.5 + 200ms * 0.5.
-  // Avarage mutator time = 100ms * 0.5 + 0ms * 0.5.
+  tracer->RecordMutatorUtilization(base::TimeTicks::FromMsTicksForTesting(600),
+                                   base::TimeDelta::FromMilliseconds(200));
+  // Average mark-compact time = 100ms * 0.5 + 200ms * 0.5.
+  // Average mutator time = 100ms * 0.5 + 0ms * 0.5.
   EXPECT_DOUBLE_EQ(0.0, tracer->CurrentMarkCompactMutatorUtilization());
   EXPECT_DOUBLE_EQ(50.0 / 200.0,
                    tracer->AverageMarkCompactMutatorUtilization());
 
   // Mark-compact #4 ended at 800ms and took 0ms.
-  tracer->RecordMutatorUtilization(800, 0);
-  // Avarage mark-compact time = 150ms * 0.5 + 0ms * 0.5.
-  // Avarage mutator time = 50ms * 0.5 + 200ms * 0.5.
+  tracer->RecordMutatorUtilization(base::TimeTicks::FromMsTicksForTesting(800),
+                                   base::TimeDelta());
+  // Average mark-compact time = 150ms * 0.5 + 0ms * 0.5.
+  // Average mutator time = 50ms * 0.5 + 200ms * 0.5.
   EXPECT_DOUBLE_EQ(1.0, tracer->CurrentMarkCompactMutatorUtilization());
   EXPECT_DOUBLE_EQ(125.0 / 200.0,
                    tracer->AverageMarkCompactMutatorUtilization());
@@ -406,67 +409,79 @@ TEST_F(GCTracerTest, BackgroundScavengerScope) {
   tracer->ResetForTesting();
   StartTracing(tracer, GarbageCollector::SCAVENGER, StartTracingMode::kAtomic);
   tracer->AddScopeSample(
-      GCTracer::Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL, 10);
+      GCTracer::Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL,
+      base::TimeDelta::FromMilliseconds(10));
   tracer->AddScopeSample(
-      GCTracer::Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL, 1);
+      GCTracer::Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL,
+      base::TimeDelta::FromMilliseconds(1));
   StopTracing(tracer, GarbageCollector::SCAVENGER);
-  EXPECT_DOUBLE_EQ(
-      11, tracer->current_
-              .scopes[GCTracer::Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL]);
+  EXPECT_EQ(
+      base::TimeDelta::FromMilliseconds(11),
+      tracer->current_
+          .scopes[GCTracer::Scope::SCAVENGER_BACKGROUND_SCAVENGE_PARALLEL]);
 }
 
-TEST_F(GCTracerTest, BackgroundMinorMCScope) {
+TEST_F(GCTracerTest, BackgroundMinorMSScope) {
   if (v8_flags.stress_incremental_marking) return;
   GCTracer* tracer = i_isolate()->heap()->tracer();
   tracer->ResetForTesting();
-  StartTracing(tracer, GarbageCollector::MINOR_MARK_COMPACTOR,
+  StartTracing(tracer, GarbageCollector::MINOR_MARK_SWEEPER,
                StartTracingMode::kAtomic);
-  tracer->AddScopeSample(GCTracer::Scope::MINOR_MC_BACKGROUND_MARKING, 10);
-  tracer->AddScopeSample(GCTracer::Scope::MINOR_MC_BACKGROUND_MARKING, 1);
-  tracer->AddScopeSample(GCTracer::Scope::MINOR_MC_BACKGROUND_EVACUATE_COPY,
-                         20);
-  tracer->AddScopeSample(GCTracer::Scope::MINOR_MC_BACKGROUND_EVACUATE_COPY, 2);
-  StopTracing(tracer, GarbageCollector::MINOR_MARK_COMPACTOR);
-  EXPECT_DOUBLE_EQ(
-      11,
-      tracer->current_.scopes[GCTracer::Scope::MINOR_MC_BACKGROUND_MARKING]);
-  EXPECT_DOUBLE_EQ(
-      22, tracer->current_
-              .scopes[GCTracer::Scope::MINOR_MC_BACKGROUND_EVACUATE_COPY]);
+  tracer->AddScopeSample(GCTracer::Scope::MINOR_MS_BACKGROUND_MARKING,
+                         base::TimeDelta::FromMilliseconds(10));
+  tracer->AddScopeSample(GCTracer::Scope::MINOR_MS_BACKGROUND_MARKING,
+                         base::TimeDelta::FromMilliseconds(1));
+  StopTracing(tracer, GarbageCollector::MINOR_MARK_SWEEPER);
+  EXPECT_EQ(
+      base::TimeDelta::FromMilliseconds(11),
+      tracer->current_.scopes[GCTracer::Scope::MINOR_MS_BACKGROUND_MARKING]);
 }
 
 TEST_F(GCTracerTest, BackgroundMajorMCScope) {
   if (v8_flags.stress_incremental_marking) return;
   GCTracer* tracer = i_isolate()->heap()->tracer();
   tracer->ResetForTesting();
-  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_MARKING, 100);
-  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_SWEEPING, 200);
-  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_MARKING, 10);
+  StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
+               StartTracingMode::kIncrementalStart);
+  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_MARKING,
+                         base::TimeDelta::FromMilliseconds(100));
+  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_SWEEPING,
+                         base::TimeDelta::FromMilliseconds(200));
+  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_MARKING,
+                         base::TimeDelta::FromMilliseconds(10));
   // Scavenger should not affect the major mark-compact scopes.
   StartTracing(tracer, GarbageCollector::SCAVENGER, StartTracingMode::kAtomic);
   StopTracing(tracer, GarbageCollector::SCAVENGER);
-  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_SWEEPING, 20);
-  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_MARKING, 1);
-  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_SWEEPING, 2);
+  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_SWEEPING,
+                         base::TimeDelta::FromMilliseconds(20));
+  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_MARKING,
+                         base::TimeDelta::FromMilliseconds(1));
+  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_SWEEPING,
+                         base::TimeDelta::FromMilliseconds(2));
   StartTracing(tracer, GarbageCollector::MARK_COMPACTOR,
-               StartTracingMode::kAtomic);
-  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_EVACUATE_COPY, 30);
-  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_EVACUATE_COPY, 3);
+               StartTracingMode::kIncrementalEnterPause);
+  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_EVACUATE_COPY,
+                         base::TimeDelta::FromMilliseconds(30));
+  tracer->AddScopeSample(GCTracer::Scope::MC_BACKGROUND_EVACUATE_COPY,
+                         base::TimeDelta::FromMilliseconds(3));
   tracer->AddScopeSample(
-      GCTracer::Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS, 40);
+      GCTracer::Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS,
+      base::TimeDelta::FromMilliseconds(40));
   tracer->AddScopeSample(
-      GCTracer::Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS, 4);
+      GCTracer::Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS,
+      base::TimeDelta::FromMilliseconds(4));
   StopTracing(tracer, GarbageCollector::MARK_COMPACTOR);
-  EXPECT_DOUBLE_EQ(
-      111, tracer->current_.scopes[GCTracer::Scope::MC_BACKGROUND_MARKING]);
-  EXPECT_DOUBLE_EQ(
-      222, tracer->current_.scopes[GCTracer::Scope::MC_BACKGROUND_SWEEPING]);
-  EXPECT_DOUBLE_EQ(
-      33,
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(111),
+            tracer->current_.scopes[GCTracer::Scope::MC_BACKGROUND_MARKING]);
+  EXPECT_EQ(base::TimeDelta::FromMilliseconds(222),
+            tracer->current_.scopes[GCTracer::Scope::MC_BACKGROUND_SWEEPING]);
+  EXPECT_EQ(
+      base::TimeDelta::FromMilliseconds(33),
       tracer->current_.scopes[GCTracer::Scope::MC_BACKGROUND_EVACUATE_COPY]);
-  EXPECT_DOUBLE_EQ(
-      44, tracer->current_
-              .scopes[GCTracer::Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS]);
+  EXPECT_EQ(
+      base::TimeDelta::FromMilliseconds(44),
+      tracer->current_
+          .scopes[GCTracer::Scope::MC_BACKGROUND_EVACUATE_UPDATE_POINTERS]);
 }
 
 class ThreadWithBackgroundScope final : public base::Thread {
@@ -490,11 +505,14 @@ TEST_F(GCTracerTest, MultithreadedBackgroundScope) {
   tracer->ResetForTesting();
   CHECK(thread1.Start());
   CHECK(thread2.Start());
-  tracer->FetchBackgroundMarkCompactCounters();
+  tracer->FetchBackgroundCounters();
+
   thread1.Join();
   thread2.Join();
-  tracer->FetchBackgroundMarkCompactCounters();
-  EXPECT_LE(0, tracer->current_.scopes[GCTracer::Scope::MC_BACKGROUND_MARKING]);
+  tracer->FetchBackgroundCounters();
+
+  EXPECT_LE(base::TimeDelta(),
+            tracer->current_.scopes[GCTracer::Scope::MC_BACKGROUND_MARKING]);
 }
 
 class GcHistogram {
@@ -538,13 +556,20 @@ TEST_F(GCTracerTest, RecordMarkCompactHistograms) {
   isolate()->SetAddHistogramSampleFunction(&GcHistogram::AddHistogramSample);
   GCTracer* tracer = i_isolate()->heap()->tracer();
   tracer->ResetForTesting();
-  tracer->current_.scopes[GCTracer::Scope::MC_CLEAR] = 1;
-  tracer->current_.scopes[GCTracer::Scope::MC_EPILOGUE] = 2;
-  tracer->current_.scopes[GCTracer::Scope::MC_EVACUATE] = 3;
-  tracer->current_.scopes[GCTracer::Scope::MC_FINISH] = 4;
-  tracer->current_.scopes[GCTracer::Scope::MC_MARK] = 5;
-  tracer->current_.scopes[GCTracer::Scope::MC_PROLOGUE] = 6;
-  tracer->current_.scopes[GCTracer::Scope::MC_SWEEP] = 7;
+  tracer->current_.scopes[GCTracer::Scope::MC_CLEAR] =
+      base::TimeDelta::FromMilliseconds(1);
+  tracer->current_.scopes[GCTracer::Scope::MC_EPILOGUE] =
+      base::TimeDelta::FromMilliseconds(2);
+  tracer->current_.scopes[GCTracer::Scope::MC_EVACUATE] =
+      base::TimeDelta::FromMilliseconds(3);
+  tracer->current_.scopes[GCTracer::Scope::MC_FINISH] =
+      base::TimeDelta::FromMilliseconds(4);
+  tracer->current_.scopes[GCTracer::Scope::MC_MARK] =
+      base::TimeDelta::FromMilliseconds(5);
+  tracer->current_.scopes[GCTracer::Scope::MC_PROLOGUE] =
+      base::TimeDelta::FromMilliseconds(6);
+  tracer->current_.scopes[GCTracer::Scope::MC_SWEEP] =
+      base::TimeDelta::FromMilliseconds(7);
   tracer->RecordGCPhasesHistograms(
       GCTracer::RecordGCPhasesInfo::Mode::Finalize);
   EXPECT_EQ(1, GcHistogram::Get("V8.GCFinalizeMC.Clear")->Total());
@@ -563,8 +588,10 @@ TEST_F(GCTracerTest, RecordScavengerHistograms) {
   isolate()->SetAddHistogramSampleFunction(&GcHistogram::AddHistogramSample);
   GCTracer* tracer = i_isolate()->heap()->tracer();
   tracer->ResetForTesting();
-  tracer->current_.scopes[GCTracer::Scope::SCAVENGER_SCAVENGE_ROOTS] = 1;
-  tracer->current_.scopes[GCTracer::Scope::SCAVENGER_SCAVENGE_PARALLEL] = 2;
+  tracer->current_.scopes[GCTracer::Scope::SCAVENGER_SCAVENGE_ROOTS] =
+      base::TimeDelta::FromMilliseconds(1);
+  tracer->current_.scopes[GCTracer::Scope::SCAVENGER_SCAVENGE_PARALLEL] =
+      base::TimeDelta::FromMilliseconds(2);
   tracer->RecordGCPhasesHistograms(
       GCTracer::RecordGCPhasesInfo::Mode::Scavenger);
   EXPECT_EQ(1, GcHistogram::Get("V8.GCScavenger.ScavengeRoots")->Total());
@@ -572,5 +599,4 @@ TEST_F(GCTracerTest, RecordScavengerHistograms) {
   GcHistogram::CleanUp();
 }
 
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal
diff --git a/deps/v8/test/unittests/heap/global-handles-unittest.cc b/deps/v8/test/unittests/heap/global-handles-unittest.cc
index 0789f678ff0557..7c7d78b3b72d93 100644
--- a/deps/v8/test/unittests/heap/global-handles-unittest.cc
+++ b/deps/v8/test/unittests/heap/global-handles-unittest.cc
@@ -174,7 +174,7 @@ class GlobalHandlesTest : public TestWithContext {
     construct_function(isolate, context, fp.get());
     CHECK(IsNewObjectInCorrectGeneration(isolate, fp->handle));
     modifier_function(fp.get());
-    CollectGarbage(i::NEW_SPACE);
+    InvokeMinorGC();
     // Scavenge clear properly resets the original handle, so we can check the
     // handle directly here.
     CHECK_IMPLIES(survives == SurvivalMode::kSurvives, !fp->handle.IsEmpty());
@@ -216,7 +216,7 @@ TEST_F(GlobalHandlesTest, EternalHandles) {
     CHECK(!eternals[i].IsEmpty());
   }
 
-  CollectAllAvailableGarbage();
+  InvokeMemoryReducingMajorGCs(isolate);
 
   for (int i = 0; i < kArrayLength; i++) {
     for (int j = 0; j < 2; j++) {
@@ -294,7 +294,7 @@ TEST_F(GlobalHandlesTest, PhantomHandlesWithoutCallbacks) {
   }
   CHECK(!g1.IsEmpty());
   CHECK(!g2.IsEmpty());
-  CollectAllAvailableGarbage();
+  InvokeMemoryReducingMajorGCs(i_isolate());
   CHECK(g1.IsEmpty());
   CHECK(g2.IsEmpty());
 }
@@ -308,7 +308,7 @@ TEST_F(GlobalHandlesTest, WeakHandleToUnmodifiedJSObjectDiesOnScavenge) {
 
   WeakHandleTest(
       v8_isolate(), &ConstructJSObject<FlagAndHandles>,
-      [](FlagAndHandles* fp) {}, [this]() { CollectGarbage(i::NEW_SPACE); },
+      [](FlagAndHandles* fp) {}, [this]() { InvokeMinorGC(); },
       SurvivalMode::kDies);
 }
 
@@ -328,7 +328,7 @@ TEST_F(GlobalHandlesTest, WeakHandleToUnmodifiedJSObjectDiesOnMarkCompact) {
 
   WeakHandleTest(
       v8_isolate(), &ConstructJSObject<FlagAndHandles>,
-      [](FlagAndHandles* fp) {}, [this]() { CollectAllGarbage(); },
+      [](FlagAndHandles* fp) {}, [this]() { InvokeMajorGC(); },
       SurvivalMode::kDies);
 }
 
@@ -339,7 +339,7 @@ TEST_F(GlobalHandlesTest,
       [this](FlagAndHandles* fp) {
         fp->local = v8::Local<v8::Object>::New(v8_isolate(), fp->handle);
       },
-      [this]() { CollectAllGarbage(); }, SurvivalMode::kSurvives);
+      [this]() { InvokeMajorGC(); }, SurvivalMode::kSurvives);
 }
 
 TEST_F(GlobalHandlesTest, WeakHandleToUnmodifiedJSApiObjectDiesOnScavenge) {
@@ -351,7 +351,7 @@ TEST_F(GlobalHandlesTest, WeakHandleToUnmodifiedJSApiObjectDiesOnScavenge) {
 
   WeakHandleTest(
       v8_isolate(), &ConstructJSApiObject<FlagAndHandles>,
-      [](FlagAndHandles* fp) {}, [this]() { CollectGarbage(i::NEW_SPACE); },
+      [](FlagAndHandles* fp) {}, [this]() { InvokeMinorGC(); },
       SurvivalMode::kDies);
 }
 
@@ -381,7 +381,7 @@ TEST_F(GlobalHandlesTest,
         Handle<JSReceiver> key =
             Utils::OpenHandle(*fp->handle.Get(v8_isolate()));
         Handle<Smi> smi(Smi::FromInt(23), isolate);
-        int32_t hash = key->GetOrCreateHash(isolate).value();
+        int32_t hash = Object::GetOrCreateHash(*key, isolate).value();
         JSWeakCollection::Set(weakmap, key, smi, hash);
       },
       SurvivalMode::kSurvives);
@@ -396,7 +396,7 @@ TEST_F(GlobalHandlesTest,
       [this](FlagAndHandles* fp) {
         fp->local = v8::Local<v8::Object>::New(v8_isolate(), fp->handle);
       },
-      [this]() { CollectGarbage(i::NEW_SPACE); }, SurvivalMode::kSurvives);
+      [this]() { InvokeMinorGC(); }, SurvivalMode::kSurvives);
 }
 
 TEST_F(GlobalHandlesTest, WeakHandleToUnmodifiedJSApiObjectDiesOnMarkCompact) {
@@ -406,7 +406,7 @@ TEST_F(GlobalHandlesTest, WeakHandleToUnmodifiedJSApiObjectDiesOnMarkCompact) {
 
   WeakHandleTest(
       v8_isolate(), &ConstructJSApiObject<FlagAndHandles>,
-      [](FlagAndHandles* fp) {}, [this]() { CollectAllGarbage(); },
+      [](FlagAndHandles* fp) {}, [this]() { InvokeMajorGC(); },
       SurvivalMode::kDies);
 }
 
@@ -417,7 +417,7 @@ TEST_F(GlobalHandlesTest,
       [this](FlagAndHandles* fp) {
         fp->local = v8::Local<v8::Object>::New(v8_isolate(), fp->handle);
       },
-      [this]() { CollectAllGarbage(); }, SurvivalMode::kSurvives);
+      [this]() { InvokeMajorGC(); }, SurvivalMode::kSurvives);
 }
 
 TEST_F(GlobalHandlesTest,
@@ -438,7 +438,7 @@ TEST_F(GlobalHandlesTest,
     auto i = function->NewInstance(v8_context()).ToLocalChecked();
     handle.Reset(isolate, i);
   }
-  CollectGarbage(i::NEW_SPACE);
+  InvokeMinorGC();
   CHECK(!handle.IsEmpty());
 }
 
@@ -462,30 +462,30 @@ TEST_F(GlobalHandlesTest,
     auto i = function->NewInstance(v8_context()).ToLocalChecked();
     handle.Reset(isolate, i);
   }
-  CollectGarbage(i::NEW_SPACE);
+  InvokeMinorGC();
   CHECK(!handle.IsEmpty());
 }
 
 namespace {
 
-void ForceScavenge2(const v8::WeakCallbackInfo<FlagAndHandles>& data) {
+void ForceMinorGC2(const v8::WeakCallbackInfo<FlagAndHandles>& data) {
   data.GetParameter()->flag = true;
-  YoungGC(data.GetIsolate());
+  InvokeMinorGC(reinterpret_cast<Isolate*>(data.GetIsolate()));
 }
 
-void ForceScavenge1(const v8::WeakCallbackInfo<FlagAndHandles>& data) {
+void ForceMinorGC1(const v8::WeakCallbackInfo<FlagAndHandles>& data) {
   data.GetParameter()->handle.Reset();
-  data.SetSecondPassCallback(ForceScavenge2);
+  data.SetSecondPassCallback(ForceMinorGC2);
 }
 
-void ForceMarkSweep2(const v8::WeakCallbackInfo<FlagAndHandles>& data) {
+void ForceMajorGC2(const v8::WeakCallbackInfo<FlagAndHandles>& data) {
   data.GetParameter()->flag = true;
-  FullGC(data.GetIsolate());
+  InvokeMajorGC(reinterpret_cast<Isolate*>(data.GetIsolate()));
 }
 
-void ForceMarkSweep1(const v8::WeakCallbackInfo<FlagAndHandles>& data) {
+void ForceMajorGC1(const v8::WeakCallbackInfo<FlagAndHandles>& data) {
   data.GetParameter()->handle.Reset();
-  data.SetSecondPassCallback(ForceMarkSweep2);
+  data.SetSecondPassCallback(ForceMajorGC2);
 }
 
 }  // namespace
@@ -504,8 +504,8 @@ TEST_F(GlobalHandlesTest, GCFromWeakCallbacks) {
     CHECK_IMPLIES(!v8_flags.single_generation,
                   !InYoungGeneration(isolate, fp.handle));
     fp.flag = false;
-    fp.handle.SetWeak(&fp, &ForceMarkSweep1, v8::WeakCallbackType::kParameter);
-    CollectAllGarbage();
+    fp.handle.SetWeak(&fp, &ForceMajorGC1, v8::WeakCallbackType::kParameter);
+    InvokeMajorGC();
     EmptyMessageQueues();
     CHECK(fp.flag);
     return;
@@ -513,13 +513,12 @@ TEST_F(GlobalHandlesTest, GCFromWeakCallbacks) {
 
   static const int kNumberOfGCTypes = 2;
   using Callback = v8::WeakCallbackInfo<FlagAndHandles>::Callback;
-  Callback gc_forcing_callback[kNumberOfGCTypes] = {&ForceScavenge1,
-                                                    &ForceMarkSweep1};
+  Callback gc_forcing_callback[kNumberOfGCTypes] = {&ForceMinorGC1,
+                                                    &ForceMajorGC1};
 
   using GCInvoker = std::function<void(void)>;
-  GCInvoker invoke_gc[kNumberOfGCTypes] = {
-      [this]() { CollectGarbage(i::NEW_SPACE); },
-      [this]() { CollectAllGarbage(); }};
+  GCInvoker invoke_gc[kNumberOfGCTypes] = {[this]() { InvokeMinorGC(); },
+                                           [this]() { InvokeMajorGC(); }};
 
   for (int outer_gc = 0; outer_gc < kNumberOfGCTypes; outer_gc++) {
     for (int inner_gc = 0; inner_gc < kNumberOfGCTypes; inner_gc++) {
@@ -561,8 +560,8 @@ TEST_F(GlobalHandlesTest, SecondPassPhantomCallbacks) {
   fp.flag = false;
   fp.handle.SetWeak(&fp, FirstPassCallback, v8::WeakCallbackType::kParameter);
   CHECK(!fp.flag);
-  CollectAllGarbage();
-  CollectAllGarbage();
+  InvokeMajorGC();
+  InvokeMajorGC();
   CHECK(fp.flag);
 }
 
@@ -572,10 +571,10 @@ TEST_F(GlobalHandlesTest, MoveStrongGlobal) {
 
   v8::Global<v8::Object>* global = new Global<v8::Object>();
   ConstructJSObject(isolate, global);
-  CollectAllGarbage();
+  InvokeMajorGC();
   v8::Global<v8::Object> global2(std::move(*global));
   delete global;
-  CollectAllGarbage();
+  InvokeMajorGC();
 }
 
 TEST_F(GlobalHandlesTest, MoveWeakGlobal) {
@@ -584,11 +583,11 @@ TEST_F(GlobalHandlesTest, MoveWeakGlobal) {
 
   v8::Global<v8::Object>* global = new Global<v8::Object>();
   ConstructJSObject(isolate, global);
-  CollectAllGarbage();
+  InvokeMajorGC();
   global->SetWeak();
   v8::Global<v8::Object> global2(std::move(*global));
   delete global;
-  CollectAllGarbage();
+  InvokeMajorGC();
 }
 
 TEST_F(GlobalHandlesTest, TotalSizeRegularNode) {
@@ -618,7 +617,7 @@ TEST_F(GlobalHandlesTest, TotalSizeTracedNode) {
   CHECK_GT(i_isolate()->traced_handles()->total_size_bytes(), 0);
   CHECK_GT(i_isolate()->traced_handles()->used_size_bytes(), 0);
   delete handle;
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK_GT(i_isolate()->traced_handles()->total_size_bytes(), 0);
   CHECK_EQ(i_isolate()->traced_handles()->used_size_bytes(), 0);
 }
diff --git a/deps/v8/test/unittests/heap/global-safepoint-unittest.cc b/deps/v8/test/unittests/heap/global-safepoint-unittest.cc
index 024d9ac4e80298..722dd67c3197a1 100644
--- a/deps/v8/test/unittests/heap/global-safepoint-unittest.cc
+++ b/deps/v8/test/unittests/heap/global-safepoint-unittest.cc
@@ -6,7 +6,7 @@
 #include "src/base/platform/platform.h"
 #include "src/heap/heap.h"
 #include "src/heap/local-heap.h"
-#include "src/heap/parked-scope.h"
+#include "src/heap/parked-scope-inl.h"
 #include "src/heap/safepoint.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
@@ -20,39 +20,6 @@ using GlobalSafepointTest = TestJSSharedMemoryWithNativeContext;
 
 namespace {
 
-class IsolateWithContextWrapper {
- public:
-  IsolateWithContextWrapper()
-      : isolate_wrapper_(kNoCounters),
-        isolate_scope_(isolate_wrapper_.isolate()),
-        handle_scope_(isolate_wrapper_.isolate()),
-        context_(v8::Context::New(isolate_wrapper_.isolate())),
-        context_scope_(context_) {}
-
-  v8::Isolate* v8_isolate() const { return isolate_wrapper_.isolate(); }
-  Isolate* isolate() const { return reinterpret_cast<Isolate*>(v8_isolate()); }
-
- private:
-  IsolateWrapper isolate_wrapper_;
-  v8::Isolate::Scope isolate_scope_;
-  v8::HandleScope handle_scope_;
-  v8::Local<v8::Context> context_;
-  v8::Context::Scope context_scope_;
-};
-
-class ParkingThread : public v8::base::Thread {
- public:
-  explicit ParkingThread(const Options& options) : v8::base::Thread(options) {}
-
-  void ParkedJoin(const ParkedScope& scope) {
-    USE(scope);
-    Join();
-  }
-
- private:
-  using base::Thread::Join;
-};
-
 class InfiniteLooperThread final : public ParkingThread {
  public:
   InfiniteLooperThread(ParkingSemaphore* sema_ready,
@@ -135,10 +102,7 @@ TEST_F(GlobalSafepointTest, Interrupt) {
     sema_execute_complete.ParkedWait(local_isolate);
   }
 
-  ParkedScope parked(local_isolate);
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  ParkingThread::ParkedJoinAll(local_isolate, threads);
 }
 
 }  // namespace internal
diff --git a/deps/v8/test/unittests/heap/heap-unittest.cc b/deps/v8/test/unittests/heap/heap-unittest.cc
index 8f649d0412c015..eac5640e29aa28 100644
--- a/deps/v8/test/unittests/heap/heap-unittest.cc
+++ b/deps/v8/test/unittests/heap/heap-unittest.cc
@@ -31,71 +31,106 @@ using HeapTest = TestWithHeapInternalsAndContext;
 TEST(Heap, YoungGenerationSizeFromOldGenerationSize) {
   const size_t pm = i::Heap::kPointerMultiplier;
   const size_t hlm = i::Heap::kHeapLimitMultiplier;
-  ASSERT_EQ(3 * 512u * pm * KB,
+  // Low memory
+  ASSERT_EQ((v8_flags.minor_ms ? 4 : 3) * 512u * pm * KB,
             i::Heap::YoungGenerationSizeFromOldGenerationSize(128u * hlm * MB));
-  ASSERT_EQ(3 * 2048u * pm * KB,
+  // High memory
+  ASSERT_EQ(v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                              : 3 * 2u * pm * MB,
             i::Heap::YoungGenerationSizeFromOldGenerationSize(256u * hlm * MB));
-  ASSERT_EQ(3 * 4096u * pm * KB,
+  ASSERT_EQ(v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                              : 3 * 4u * pm * MB,
             i::Heap::YoungGenerationSizeFromOldGenerationSize(512u * hlm * MB));
-  ASSERT_EQ(
-      3 * 8192u * pm * KB,
-      i::Heap::YoungGenerationSizeFromOldGenerationSize(1024u * hlm * MB));
+  ASSERT_EQ(v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                              : 3 * 8u * pm * MB,
+            i::Heap::YoungGenerationSizeFromOldGenerationSize(1u * hlm * GB));
 }
 
 TEST(Heap, GenerationSizesFromHeapSize) {
   const size_t pm = i::Heap::kPointerMultiplier;
   const size_t hlm = i::Heap::kHeapLimitMultiplier;
+
   size_t old, young;
 
+  // Low memory
   i::Heap::GenerationSizesFromHeapSize(1 * KB, &young, &old);
   ASSERT_EQ(0u, old);
   ASSERT_EQ(0u, young);
 
-  i::Heap::GenerationSizesFromHeapSize(1 * KB + 3 * 512u * pm * KB, &young,
-                                       &old);
+  // On tiny heap max semi space capacity is set to the default capacity which
+  // MinorMS does not double.
+  i::Heap::GenerationSizesFromHeapSize(
+      1 * KB + (v8_flags.minor_ms ? 2 : 3) * 512u * pm * KB, &young, &old);
   ASSERT_EQ(1u * KB, old);
-  ASSERT_EQ(3 * 512u * pm * KB, young);
+  ASSERT_EQ((v8_flags.minor_ms ? 2 : 3) * 512u * pm * KB, young);
 
-  i::Heap::GenerationSizesFromHeapSize(128 * hlm * MB + 3 * 512 * pm * KB,
-                                       &young, &old);
+  i::Heap::GenerationSizesFromHeapSize(
+      128 * hlm * MB + (v8_flags.minor_ms ? 4 : 3) * 512 * pm * KB, &young,
+      &old);
   ASSERT_EQ(128u * hlm * MB, old);
-  ASSERT_EQ(3 * 512u * pm * KB, young);
-
-  i::Heap::GenerationSizesFromHeapSize(256u * hlm * MB + 3 * 2048 * pm * KB,
-                                       &young, &old);
+  ASSERT_EQ((v8_flags.minor_ms ? 4 : 3) * 512u * pm * KB, young);
+
+  // High memory
+  i::Heap::GenerationSizesFromHeapSize(
+      256u * hlm * MB + (v8_flags.minor_ms
+                             ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                             : 3 * 2 * pm * MB),
+      &young, &old);
   ASSERT_EQ(256u * hlm * MB, old);
-  ASSERT_EQ(3 * 2048u * pm * KB, young);
-
-  i::Heap::GenerationSizesFromHeapSize(512u * hlm * MB + 3 * 4096 * pm * KB,
-                                       &young, &old);
+  ASSERT_EQ(v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                              : 3 * 2 * pm * MB,
+            young);
+
+  i::Heap::GenerationSizesFromHeapSize(
+      512u * hlm * MB + (v8_flags.minor_ms
+                             ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                             : 3 * 4 * pm * MB),
+      &young, &old);
   ASSERT_EQ(512u * hlm * MB, old);
-  ASSERT_EQ(3 * 4096u * pm * KB, young);
-
-  i::Heap::GenerationSizesFromHeapSize(1024u * hlm * MB + 3 * 8192 * pm * KB,
-                                       &young, &old);
-  ASSERT_EQ(1024u * hlm * MB, old);
-  ASSERT_EQ(3 * 8192u * pm * KB, young);
+  ASSERT_EQ(v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                              : 3 * 4U * pm * MB,
+            young);
+
+  i::Heap::GenerationSizesFromHeapSize(
+      1u * hlm * GB + (v8_flags.minor_ms
+                           ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                           : 3 * 8 * pm * MB),
+      &young, &old);
+  ASSERT_EQ(1u * hlm * GB, old);
+  ASSERT_EQ(v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                              : 3 * 8U * pm * MB,
+            young);
 }
 
 TEST(Heap, HeapSizeFromPhysicalMemory) {
   const size_t pm = i::Heap::kPointerMultiplier;
   const size_t hlm = i::Heap::kHeapLimitMultiplier;
 
-  // The expected value is old_generation_size + 3 * semi_space_size.
-  ASSERT_EQ(128 * hlm * MB + 3 * 512 * pm * KB,
+  // The expected value is old_generation_size + semi_space_multiplier *
+  // semi_space_size.
+
+  // Low memory
+  ASSERT_EQ(128 * hlm * MB + (v8_flags.minor_ms ? 4 : 3) * 512 * pm * KB,
             i::Heap::HeapSizeFromPhysicalMemory(0u));
-  ASSERT_EQ(128 * hlm * MB + 3 * 512 * pm * KB,
+  ASSERT_EQ(128 * hlm * MB + (v8_flags.minor_ms ? 4 : 3) * 512 * pm * KB,
             i::Heap::HeapSizeFromPhysicalMemory(512u * MB));
-  ASSERT_EQ(256 * hlm * MB + 3 * 2048 * pm * KB,
-            i::Heap::HeapSizeFromPhysicalMemory(1024u * MB));
-  ASSERT_EQ(512 * hlm * MB + 3 * 4096 * pm * KB,
-            i::Heap::HeapSizeFromPhysicalMemory(2048u * MB));
+  // High memory
+  ASSERT_EQ(256 * hlm * MB + (v8_flags.minor_ms
+                                  ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                                  : 3 * 2 * pm * MB),
+            i::Heap::HeapSizeFromPhysicalMemory(1u * GB));
+  ASSERT_EQ(512 * hlm * MB + (v8_flags.minor_ms
+                                  ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                                  : 3 * 4 * pm * MB),
+            i::Heap::HeapSizeFromPhysicalMemory(2u * GB));
   ASSERT_EQ(
-      1024 * hlm * MB + 3 * 8192 * pm * KB,
-      i::Heap::HeapSizeFromPhysicalMemory(static_cast<uint64_t>(4096u) * MB));
+      1 * hlm * GB + (v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                                        : 3 * 8 * pm * MB),
+      i::Heap::HeapSizeFromPhysicalMemory(static_cast<uint64_t>(4u) * GB));
   ASSERT_EQ(
-      1024 * hlm * MB + 3 * 8192 * pm * KB,
-      i::Heap::HeapSizeFromPhysicalMemory(static_cast<uint64_t>(8192u) * MB));
+      1 * hlm * GB + (v8_flags.minor_ms ? 2 * i::Heap::DefaultMaxSemiSpaceSize()
+                                        : 3 * 8 * pm * MB),
+      i::Heap::HeapSizeFromPhysicalMemory(static_cast<uint64_t>(8u) * GB));
 }
 
 TEST_F(HeapTest, ASLR) {
@@ -170,8 +205,7 @@ TEST_F(HeapTest, HeapLayout) {
     Address address = chunk->address();
     size_t size = chunk->area_end() - address;
     AllocationSpace owner_id = chunk->owner_identity();
-    if (V8_EXTERNAL_CODE_SPACE_BOOL &&
-        (owner_id == CODE_SPACE || owner_id == CODE_LO_SPACE)) {
+    if (V8_EXTERNAL_CODE_SPACE_BOOL && IsAnyCodeSpace(owner_id)) {
       EXPECT_TRUE(code_reservation.contains(address, size));
     } else {
       EXPECT_TRUE(heap_reservation.contains(address, size));
@@ -182,33 +216,46 @@ TEST_F(HeapTest, HeapLayout) {
 
 namespace {
 void ShrinkNewSpace(NewSpace* new_space) {
-  if (!v8_flags.minor_mc) {
+  if (!v8_flags.minor_ms) {
     SemiSpaceNewSpace::From(new_space)->Shrink();
     return;
   }
-  // MinorMC shrinks the space as part of sweeping.
+  // MinorMS shrinks the space as part of sweeping. Here we fake a GC cycle, in
+  // which we just shrink without marking or sweeping.
   PagedNewSpace* paged_new_space = PagedNewSpace::From(new_space);
   Heap* heap = paged_new_space->heap();
   heap->EnsureSweepingCompleted(Heap::SweepingForcedFinalizationMode::kV8Only);
   GCTracer* tracer = heap->tracer();
-  tracer->StartObservablePause();
+  tracer->StartObservablePause(base::TimeTicks::Now());
   tracer->StartCycle(GarbageCollector::MARK_COMPACTOR,
                      GarbageCollectionReason::kTesting, "heap unittest",
                      GCTracer::MarkingType::kAtomic);
   tracer->StartAtomicPause();
   paged_new_space->StartShrinking();
-  for (Page* page = paged_new_space->first_page();
-       page != paged_new_space->last_page() &&
+  for (auto it = paged_new_space->begin();
+       it != paged_new_space->end() &&
        (paged_new_space->ShouldReleaseEmptyPage());) {
-    Page* current_page = page;
-    page = page->next_page();
-    if (current_page->allocated_bytes() == 0) {
-      paged_new_space->ReleasePage(current_page);
+    Page* page = *it++;
+    if (page->allocated_bytes() == 0) {
+      paged_new_space->ReleasePage(page);
+    } else {
+      // The number of live bytes should be zero, because at this point we're
+      // after a GC.
+      DCHECK_EQ(0, page->live_bytes());
+      // We set it to the number of allocated bytes, because FinishShrinking
+      // below expects that all pages have been swept and those that remain
+      // contain live bytes.
+      page->SetLiveBytes(page->allocated_bytes());
     }
   }
   paged_new_space->FinishShrinking();
+  for (Page* page : *paged_new_space) {
+    // We reset the number of live bytes to zero, as is expected after a GC.
+    page->SetLiveBytes(0);
+  }
   tracer->StopAtomicPause();
-  tracer->StopObservablePause();
+  tracer->StopObservablePause(GarbageCollector::MARK_COMPACTOR,
+                              base::TimeTicks::Now());
   tracer->NotifyFullSweepingCompleted();
 }
 }  // namespace
@@ -229,8 +276,8 @@ TEST_F(HeapTest, GrowAndShrinkNewSpace) {
   }
 
   // Make sure we're in a consistent state to start out.
-  CollectAllGarbage();
-  CollectAllGarbage();
+  InvokeMajorGC();
+  InvokeMajorGC();
   ShrinkNewSpace(new_space);
 
   // Explicitly growing should double the space capacity.
@@ -255,14 +302,14 @@ TEST_F(HeapTest, GrowAndShrinkNewSpace) {
   CHECK_EQ(old_capacity, new_capacity);
 
   // Let the scavenger empty the new space.
-  CollectGarbage(NEW_SPACE);
+  EmptyNewSpaceUsingGC();
   CHECK_LE(new_space->Size(), old_capacity);
 
   // Explicitly shrinking should halve the space capacity.
   old_capacity = new_space->TotalCapacity();
   ShrinkNewSpace(new_space);
   new_capacity = new_space->TotalCapacity();
-  if (v8_flags.minor_mc) {
+  if (v8_flags.minor_ms) {
     // Shrinking may not be able to remove any pages if all contain live
     // objects.
     CHECK_GE(old_capacity, new_capacity);
@@ -298,7 +345,7 @@ TEST_F(HeapTest, CollectingAllAvailableGarbageShrinksNewSpace) {
     v8::HandleScope temporary_scope(iso);
     SimulateFullSpace(new_space);
   }
-  CollectAllAvailableGarbage();
+  InvokeMemoryReducingMajorGCs();
   new_capacity = new_space->TotalCapacity();
   CHECK_EQ(old_capacity, new_capacity);
 }
@@ -369,18 +416,17 @@ TEST_F(HeapTest, RememberedSet_InsertOnPromotingObjectToOld) {
   // Create a young object and age it one generation inside the new space.
   Handle<FixedArray> arr = factory->NewFixedArray(1);
   std::vector<Handle<FixedArray>> handles;
-  if (v8_flags.minor_mc) {
+  if (v8_flags.minor_ms) {
     NewSpace* new_space = heap->new_space();
-    CHECK(!new_space->IsAtMaximumCapacity());
-    // Fill current pages to force MinorMC to promote them.
+    CHECK_NE(new_space->TotalCapacity(), new_space->MaximumCapacity());
+    // Fill current pages to force MinorMS to promote them.
     SimulateFullSpace(new_space, &handles);
     IsolateSafepointScope scope(heap);
     // New empty pages should remain in new space.
     new_space->Grow();
     CHECK(new_space->EnsureCurrentCapacity());
-  } else {
-    CollectGarbage(i::NEW_SPACE);
   }
+  InvokeMinorGC();
   CHECK(Heap::InYoungGeneration(*arr));
 
   // Add into 'arr' a reference to an object one generation younger.
@@ -392,12 +438,16 @@ TEST_F(HeapTest, RememberedSet_InsertOnPromotingObjectToOld) {
 
   // Promote 'arr' into old, its element is still in new, the old to new
   // refs are inserted into the remembered sets during GC.
-  CollectGarbage(i::NEW_SPACE);
+  InvokeMinorGC();
   heap->EnsureSweepingCompleted(Heap::SweepingForcedFinalizationMode::kV8Only);
 
   CHECK(heap->InOldSpace(*arr));
   CHECK(heap->InYoungGeneration(arr->get(0)));
-  CHECK_EQ(1, GetRememberedSetSize<OLD_TO_NEW>(*arr));
+  if (v8_flags.minor_ms) {
+    CHECK_EQ(1, GetRememberedSetSize<OLD_TO_NEW_BACKGROUND>(*arr));
+  } else {
+    CHECK_EQ(1, GetRememberedSetSize<OLD_TO_NEW>(*arr));
+  }
 }
 
 TEST_F(HeapTest, Regress978156) {
@@ -409,7 +459,7 @@ TEST_F(HeapTest, Regress978156) {
   Heap* heap = isolate()->heap();
 
   // 1. Ensure that the new space is empty.
-  GcAndSweep(OLD_SPACE);
+  EmptyNewSpaceUsingGC();
   // 2. Fill the new space with FixedArrays.
   std::vector<Handle<FixedArray>> arrays;
   SimulateFullSpace(heap->new_space(), &arrays);
@@ -421,7 +471,7 @@ TEST_F(HeapTest, Regress978156) {
   HeapObject filler = HeapObject::FromAddress(
       MemoryChunk::FromHeapObject(*last)->area_end() - kTaggedSize);
   HeapObject::FromAddress(last->address() + last->Size());
-  CHECK(filler.IsFiller());
+  CHECK(IsFiller(filler));
   // 5. Start incremental marking.
   i::IncrementalMarking* marking = heap->incremental_marking();
   if (marking->IsStopped()) {
diff --git a/deps/v8/test/unittests/heap/heap-utils.cc b/deps/v8/test/unittests/heap/heap-utils.cc
index a2aa2ff6534500..c2176a551df5d7 100644
--- a/deps/v8/test/unittests/heap/heap-utils.cc
+++ b/deps/v8/test/unittests/heap/heap-utils.cc
@@ -12,6 +12,7 @@
 #include "src/heap/incremental-marking.h"
 #include "src/heap/mark-compact.h"
 #include "src/heap/new-spaces.h"
+#include "src/heap/page-inl.h"
 #include "src/heap/safepoint.h"
 #include "src/objects/free-space-inl.h"
 
@@ -20,7 +21,7 @@ namespace internal {
 
 void HeapInternalsBase::SimulateIncrementalMarking(Heap* heap,
                                                    bool force_completion) {
-  constexpr double kStepSizeInMs = 100;
+  static constexpr auto kStepSize = v8::base::TimeDelta::FromMilliseconds(100);
   CHECK(v8_flags.incremental_marking);
   i::IncrementalMarking* marking = heap->incremental_marking();
 
@@ -31,14 +32,14 @@ void HeapInternalsBase::SimulateIncrementalMarking(Heap* heap,
   }
 
   if (marking->IsStopped()) {
-    heap->StartIncrementalMarking(i::Heap::kNoGCFlags,
+    heap->StartIncrementalMarking(i::GCFlag::kNoFlags,
                                   i::GarbageCollectionReason::kTesting);
   }
   CHECK(marking->IsMajorMarking());
   if (!force_completion) return;
 
   while (!marking->IsMajorMarkingComplete()) {
-    marking->AdvanceForTesting(kStepSizeInMs);
+    marking->AdvanceForTesting(kStepSize);
   }
 }
 
@@ -52,6 +53,7 @@ int FixedArrayLenFromSize(int size) {
 void FillPageInPagedSpace(Page* page,
                           std::vector<Handle<FixedArray>>* out_handles) {
   Heap* heap = page->heap();
+  ManualGCScope manual_gc_scope(heap->isolate());
   DCHECK(page->SweepingDone());
   PagedSpaceBase* paged_space = static_cast<PagedSpaceBase*>(page->owner());
   // Make sure the LAB is empty to guarantee that all free space is accounted
@@ -63,7 +65,7 @@ void FillPageInPagedSpace(Page* page,
   CollectionEpoch full_epoch =
       heap->tracer()->CurrentEpoch(GCTracer::Scope::ScopeId::MARK_COMPACTOR);
   CollectionEpoch young_epoch = heap->tracer()->CurrentEpoch(
-      GCTracer::Scope::ScopeId::MINOR_MARK_COMPACTOR);
+      GCTracer::Scope::ScopeId::MINOR_MARK_SWEEPER);
 
   for (Page* p : *paged_space) {
     if (p != page) paged_space->UnlinkFreeListCategories(p);
@@ -79,12 +81,13 @@ void FillPageInPagedSpace(Page* page,
   // Collect all free list block sizes
   page->ForAllFreeListCategories(
       [&available_sizes](FreeListCategory* category) {
-        category->IterateNodesForTesting([&available_sizes](FreeSpace node) {
-          int node_size = node.Size();
-          if (node_size >= kMaxRegularHeapObjectSize) {
-            available_sizes.push_back(node_size);
-          }
-        });
+        category->IterateNodesForTesting(
+            [&available_sizes](Tagged<FreeSpace> node) {
+              int node_size = node->Size();
+              if (node_size >= kMaxRegularHeapObjectSize) {
+                available_sizes.push_back(node_size);
+              }
+            });
       });
 
   Isolate* isolate = heap->isolate();
@@ -112,11 +115,12 @@ void FillPageInPagedSpace(Page* page,
         remaining_sizes.push_back({});
         std::vector<int>& sizes_in_category =
             remaining_sizes[remaining_sizes.size() - 1];
-        category->IterateNodesForTesting([&sizes_in_category](FreeSpace node) {
-          int node_size = node.Size();
-          DCHECK_LT(0, FixedArrayLenFromSize(node_size));
-          sizes_in_category.push_back(node_size);
-        });
+        category->IterateNodesForTesting(
+            [&sizes_in_category](Tagged<FreeSpace> node) {
+              int node_size = node->Size();
+              DCHECK_LT(0, FixedArrayLenFromSize(node_size));
+              sizes_in_category.push_back(node_size);
+            });
       });
   for (auto it = remaining_sizes.rbegin(); it != remaining_sizes.rend(); ++it) {
     std::vector<int> sizes_in_category = *it;
@@ -141,7 +145,7 @@ void FillPageInPagedSpace(Page* page,
   CHECK_EQ(full_epoch, heap->tracer()->CurrentEpoch(
                            GCTracer::Scope::ScopeId::MARK_COMPACTOR));
   CHECK_EQ(young_epoch, heap->tracer()->CurrentEpoch(
-                            GCTracer::Scope::ScopeId::MINOR_MARK_COMPACTOR));
+                            GCTracer::Scope::ScopeId::MINOR_MARK_SWEEPER));
 }
 
 }  // namespace
@@ -156,11 +160,12 @@ void HeapInternalsBase::SimulateFullSpace(
   space->heap()->EnsureSweepingCompleted(
       Heap::SweepingForcedFinalizationMode::kV8Only);
   space->FreeLinearAllocationArea();
-  if (v8_flags.minor_mc) {
+  if (v8_flags.minor_ms) {
+    while (space->AddFreshPage()) {}
     for (Page* page : *space) {
       FillPageInPagedSpace(page, out_handles);
     }
-    DCHECK_EQ(0, space->free_list()->Available());
+    DCHECK_IMPLIES(space->free_list(), space->free_list()->Available() == 0);
   } else {
     do {
       FillCurrentPage(space, out_handles);
@@ -174,7 +179,6 @@ void HeapInternalsBase::SimulateFullSpace(v8::internal::PagedSpace* space) {
   // Background thread allocating concurrently interferes with this function.
   CHECK(!v8_flags.stress_concurrent_allocation);
   Heap* heap = space->heap();
-  CodePageCollectionMemoryModificationScopeForTesting code_scope(heap);
   if (heap->sweeping_in_progress()) {
     heap->EnsureSweepingCompleted(
         Heap::SweepingForcedFinalizationMode::kV8Only);
@@ -271,25 +275,69 @@ void HeapInternalsBase::FillCurrentPage(
     v8::internal::NewSpace* space,
     std::vector<Handle<FixedArray>>* out_handles) {
   PauseAllocationObserversScope pause_observers(space->heap());
-  if (v8_flags.minor_mc)
+  if (v8_flags.minor_ms)
     FillCurrenPagedSpacePage(space, out_handles);
   else
     FillCurrentSemiSpacePage(space, out_handles);
 }
 
-bool IsNewObjectInCorrectGeneration(HeapObject object) {
+bool IsNewObjectInCorrectGeneration(Tagged<HeapObject> object) {
   return v8_flags.single_generation ? !i::Heap::InYoungGeneration(object)
                                     : i::Heap::InYoungGeneration(object);
 }
 
-void FinalizeGCIfRunning(Isolate* isolate) {
-  if (!isolate) {
-    return;
+ManualGCScope::ManualGCScope(Isolate* isolate)
+    : isolate_(isolate),
+      flag_concurrent_marking_(v8_flags.concurrent_marking),
+      flag_concurrent_sweeping_(v8_flags.concurrent_sweeping),
+      flag_concurrent_minor_ms_marking_(v8_flags.concurrent_minor_ms_marking),
+      flag_stress_concurrent_allocation_(v8_flags.stress_concurrent_allocation),
+      flag_stress_incremental_marking_(v8_flags.stress_incremental_marking),
+      flag_parallel_marking_(v8_flags.parallel_marking),
+      flag_detect_ineffective_gcs_near_heap_limit_(
+          v8_flags.detect_ineffective_gcs_near_heap_limit),
+      flag_cppheap_concurrent_marking_(v8_flags.cppheap_concurrent_marking) {
+  // Some tests run threaded (back-to-back) and thus the GC may already be
+  // running by the time a ManualGCScope is created. Finalizing existing marking
+  // prevents any undefined/unexpected behavior.
+  if (isolate) {
+    auto* heap = isolate->heap();
+    if (heap->incremental_marking()->IsMarking()) {
+      InvokeAtomicMajorGC(isolate);
+    }
+  }
+
+  v8_flags.concurrent_marking = false;
+  v8_flags.concurrent_sweeping = false;
+  v8_flags.concurrent_minor_ms_marking = false;
+  v8_flags.stress_incremental_marking = false;
+  v8_flags.stress_concurrent_allocation = false;
+  // Parallel marking has a dependency on concurrent marking.
+  v8_flags.parallel_marking = false;
+  v8_flags.detect_ineffective_gcs_near_heap_limit = false;
+  // CppHeap concurrent marking has a dependency on concurrent marking.
+  v8_flags.cppheap_concurrent_marking = false;
+
+  if (isolate_ && isolate_->heap()->cpp_heap()) {
+    CppHeap::From(isolate_->heap()->cpp_heap())
+        ->UpdateGCCapabilitiesFromFlagsForTesting();
   }
-  auto* heap = isolate->heap();
-  if (heap->incremental_marking()->IsMarking()) {
-    heap->CollectGarbage(OLD_SPACE, GarbageCollectionReason::kTesting);
-    heap->CompleteSweepingFull();
+}
+
+ManualGCScope::~ManualGCScope() {
+  v8_flags.concurrent_marking = flag_concurrent_marking_;
+  v8_flags.concurrent_sweeping = flag_concurrent_sweeping_;
+  v8_flags.concurrent_minor_ms_marking = flag_concurrent_minor_ms_marking_;
+  v8_flags.stress_concurrent_allocation = flag_stress_concurrent_allocation_;
+  v8_flags.stress_incremental_marking = flag_stress_incremental_marking_;
+  v8_flags.parallel_marking = flag_parallel_marking_;
+  v8_flags.detect_ineffective_gcs_near_heap_limit =
+      flag_detect_ineffective_gcs_near_heap_limit_;
+  v8_flags.cppheap_concurrent_marking = flag_cppheap_concurrent_marking_;
+
+  if (isolate_ && isolate_->heap()->cpp_heap()) {
+    CppHeap::From(isolate_->heap()->cpp_heap())
+        ->UpdateGCCapabilitiesFromFlagsForTesting();
   }
 }
 
diff --git a/deps/v8/test/unittests/heap/heap-utils.h b/deps/v8/test/unittests/heap/heap-utils.h
index 633652617d1b87..6d0862dcf23bad 100644
--- a/deps/v8/test/unittests/heap/heap-utils.h
+++ b/deps/v8/test/unittests/heap/heap-utils.h
@@ -25,6 +25,43 @@ class HeapInternalsBase {
                        std::vector<Handle<FixedArray>>* out_handles = nullptr);
 };
 
+inline void InvokeMajorGC(i::Isolate* isolate) {
+  isolate->heap()->CollectGarbage(OLD_SPACE, GarbageCollectionReason::kTesting);
+}
+
+inline void InvokeMajorGC(i::Isolate* isolate, GCFlag gc_flag) {
+  isolate->heap()->CollectAllGarbage(gc_flag,
+                                     GarbageCollectionReason::kTesting);
+}
+
+inline void InvokeMinorGC(i::Isolate* isolate) {
+  isolate->heap()->CollectGarbage(NEW_SPACE, GarbageCollectionReason::kTesting);
+}
+
+inline void InvokeAtomicMajorGC(i::Isolate* isolate) {
+  Heap* heap = isolate->heap();
+  heap->PreciseCollectAllGarbage(GCFlag::kNoFlags,
+                                 GarbageCollectionReason::kTesting);
+  if (heap->sweeping_in_progress()) {
+    heap->EnsureSweepingCompleted(
+        Heap::SweepingForcedFinalizationMode::kUnifiedHeap);
+  }
+}
+
+inline void InvokeAtomicMinorGC(i::Isolate* isolate) {
+  InvokeMinorGC(isolate);
+  Heap* heap = isolate->heap();
+  if (heap->sweeping_in_progress()) {
+    heap->EnsureSweepingCompleted(
+        Heap::SweepingForcedFinalizationMode::kUnifiedHeap);
+  }
+}
+
+inline void InvokeMemoryReducingMajorGCs(i::Isolate* isolate) {
+  isolate->heap()->CollectAllAvailableGarbage(
+      GarbageCollectionReason::kTesting);
+}
+
 template <typename TMixin>
 class WithHeapInternals : public TMixin, HeapInternalsBase {
  public:
@@ -32,20 +69,25 @@ class WithHeapInternals : public TMixin, HeapInternalsBase {
   WithHeapInternals(const WithHeapInternals&) = delete;
   WithHeapInternals& operator=(const WithHeapInternals&) = delete;
 
-  void CollectGarbage(AllocationSpace space) {
-    heap()->CollectGarbage(space, GarbageCollectionReason::kTesting);
-  }
+  void InvokeMajorGC() { i::InvokeMajorGC(this->i_isolate()); }
 
-  void FullGC() {
-    heap()->CollectGarbage(OLD_SPACE, GarbageCollectionReason::kTesting);
+  void InvokeMajorGC(GCFlag gc_flag) {
+    i::InvokeMajorGC(this->i_isolate(), gc_flag);
   }
 
-  void YoungGC() {
-    heap()->CollectGarbage(NEW_SPACE, GarbageCollectionReason::kTesting);
+  void InvokeMinorGC() { i::InvokeMinorGC(this->i_isolate()); }
+
+  void InvokeAtomicMajorGC() { i::InvokeAtomicMajorGC(this->i_isolate()); }
+
+  void InvokeAtomicMinorGC() { i::InvokeAtomicMinorGC(this->i_isolate()); }
+
+  void InvokeMemoryReducingMajorGCs() {
+    i::InvokeMemoryReducingMajorGCs(this->i_isolate());
   }
 
-  void CollectAllAvailableGarbage() {
-    heap()->CollectAllAvailableGarbage(GarbageCollectionReason::kTesting);
+  void PreciseCollectAllGarbage() {
+    heap()->PreciseCollectAllGarbage(GCFlag::kNoFlags,
+                                     GarbageCollectionReason::kTesting);
   }
 
   Heap* heap() const { return this->i_isolate()->heap(); }
@@ -66,10 +108,11 @@ class WithHeapInternals : public TMixin, HeapInternalsBase {
 
   void GrowNewSpace() {
     IsolateSafepointScope scope(heap());
-    if (!heap()->new_space()->IsAtMaximumCapacity()) {
-      heap()->new_space()->Grow();
+    NewSpace* new_space = heap()->new_space();
+    if (new_space->TotalCapacity() < new_space->MaximumCapacity()) {
+      new_space->Grow();
     }
-    CHECK(heap()->new_space()->EnsureCurrentCapacity());
+    CHECK(new_space->EnsureCurrentCapacity());
   }
 
   void SealCurrentObjects() {
@@ -77,8 +120,8 @@ class WithHeapInternals : public TMixin, HeapInternalsBase {
     // test: v8_flags.stress_concurrent_allocation = false; Background thread
     // allocating concurrently interferes with this function.
     CHECK(!v8_flags.stress_concurrent_allocation);
-    FullGC();
-    FullGC();
+    InvokeMajorGC();
+    InvokeMajorGC();
     heap()->EnsureSweepingCompleted(
         Heap::SweepingForcedFinalizationMode::kV8Only);
     heap()->old_space()->FreeLinearAllocationArea();
@@ -87,14 +130,7 @@ class WithHeapInternals : public TMixin, HeapInternalsBase {
     }
   }
 
-  void GcAndSweep(AllocationSpace space) {
-    heap()->CollectGarbage(space, GarbageCollectionReason::kTesting);
-    if (heap()->sweeping_in_progress()) {
-      IsolateSafepointScope scope(heap());
-      heap()->EnsureSweepingCompleted(
-          Heap::SweepingForcedFinalizationMode::kV8Only);
-    }
-  }
+  void EmptyNewSpaceUsingGC() { InvokeMajorGC(); }
 };
 
 using TestWithHeapInternals =                  //
@@ -109,21 +145,6 @@ using TestWithHeapInternalsAndContext =  //
     WithContextMixin<                    //
         TestWithHeapInternals>;
 
-inline void CollectGarbage(AllocationSpace space, v8::Isolate* isolate) {
-  Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap();
-  heap->CollectGarbage(space, GarbageCollectionReason::kTesting);
-}
-
-inline void FullGC(v8::Isolate* isolate) {
-  Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap();
-  heap->CollectAllGarbage(Heap::kNoGCFlags, GarbageCollectionReason::kTesting);
-}
-
-inline void YoungGC(v8::Isolate* isolate) {
-  Heap* heap = reinterpret_cast<i::Isolate*>(isolate)->heap();
-  heap->CollectGarbage(NEW_SPACE, GarbageCollectionReason::kTesting);
-}
-
 template <typename GlobalOrPersistent>
 bool InYoungGeneration(v8::Isolate* isolate, const GlobalOrPersistent& global) {
   CHECK(!v8_flags.single_generation);
@@ -132,7 +153,7 @@ bool InYoungGeneration(v8::Isolate* isolate, const GlobalOrPersistent& global) {
   return Heap::InYoungGeneration(*v8::Utils::OpenHandle(*tmp));
 }
 
-bool IsNewObjectInCorrectGeneration(HeapObject object);
+bool IsNewObjectInCorrectGeneration(Tagged<HeapObject> object);
 
 template <typename GlobalOrPersistent>
 bool IsNewObjectInCorrectGeneration(v8::Isolate* isolate,
@@ -142,7 +163,26 @@ bool IsNewObjectInCorrectGeneration(v8::Isolate* isolate,
   return IsNewObjectInCorrectGeneration(*v8::Utils::OpenHandle(*tmp));
 }
 
-void FinalizeGCIfRunning(Isolate* isolate);
+// ManualGCScope allows for disabling GC heuristics. This is useful for tests
+// that want to check specific corner cases around GC.
+//
+// The scope will finalize any ongoing GC on the provided Isolate.
+class V8_NODISCARD ManualGCScope final {
+ public:
+  explicit ManualGCScope(Isolate* isolate);
+  ~ManualGCScope();
+
+ private:
+  Isolate* const isolate_;
+  const bool flag_concurrent_marking_;
+  const bool flag_concurrent_sweeping_;
+  const bool flag_concurrent_minor_ms_marking_;
+  const bool flag_stress_concurrent_allocation_;
+  const bool flag_stress_incremental_marking_;
+  const bool flag_parallel_marking_;
+  const bool flag_detect_ineffective_gcs_near_heap_limit_;
+  const bool flag_cppheap_concurrent_marking_;
+};
 
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/heap/index-generator-unittest.cc b/deps/v8/test/unittests/heap/index-generator-unittest.cc
index 11627741b83e4f..9fa6b502f7cf73 100644
--- a/deps/v8/test/unittests/heap/index-generator-unittest.cc
+++ b/deps/v8/test/unittests/heap/index-generator-unittest.cc
@@ -32,19 +32,5 @@ TEST(IndexGeneratorTest, GetNext) {
   EXPECT_EQ(base::nullopt, gen.GetNext());
 }
 
-TEST(IndexGeneratorTest, GiveBack) {
-  IndexGenerator gen(4);
-
-  EXPECT_EQ(0U, gen.GetNext());
-  EXPECT_EQ(2U, gen.GetNext());
-  EXPECT_EQ(1U, gen.GetNext());
-  gen.GiveBack(2);
-  gen.GiveBack(0);
-  EXPECT_EQ(0U, gen.GetNext());
-  EXPECT_EQ(2U, gen.GetNext());
-  EXPECT_EQ(3U, gen.GetNext());
-  EXPECT_EQ(base::nullopt, gen.GetNext());
-}
-
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/heap/marking-inner-pointer-resolution-unittest.cc b/deps/v8/test/unittests/heap/inner-pointer-resolution-unittest.cc
similarity index 59%
rename from deps/v8/test/unittests/heap/marking-inner-pointer-resolution-unittest.cc
rename to deps/v8/test/unittests/heap/inner-pointer-resolution-unittest.cc
index c8823e9644f09f..166ba5495eac5c 100644
--- a/deps/v8/test/unittests/heap/marking-inner-pointer-resolution-unittest.cc
+++ b/deps/v8/test/unittests/heap/inner-pointer-resolution-unittest.cc
@@ -12,16 +12,15 @@ namespace internal {
 
 namespace {
 
-constexpr int Tagged = kTaggedSize;
-constexpr int FullCell = Bitmap::kBitsPerCell * Tagged;
+constexpr int FullCell = MarkingBitmap::kBitsPerCell * kTaggedSize;
 
 template <typename TMixin>
 class WithInnerPointerResolutionMixin : public TMixin {
  public:
   Address ResolveInnerPointer(Address maybe_inner_ptr) {
-    return ConservativeStackVisitor::FindBasePtrForMarking(
-        maybe_inner_ptr, this->isolate()->heap()->memory_allocator(),
-        GarbageCollector::MARK_COMPACTOR);
+    return ConservativeStackVisitor::ForTesting(
+               this->isolate(), GarbageCollector::MARK_COMPACTOR)
+        .FindBasePtr(maybe_inner_ptr);
   }
 };
 
@@ -31,15 +30,15 @@ class InnerPointerResolutionTest
   struct ObjectRequest {
     int size;  // The only required field.
     enum { REGULAR, FREE, LARGE } type = REGULAR;
-    enum { WHITE, GREY, BLACK, BLACK_AREA } marked = WHITE;
+    enum { UNMARKED, MARKED, MARKED_AREA } marked = UNMARKED;
     // If index_in_cell >= 0, the object is placed at the lowest address s.t.
-    // Bitmap::IndexInCell(AddressToMarkbitIndex(address)) == index_in_cell.
-    // To achieve this, padding (i.e., introducing a free-space object of the
-    // appropriate size) may be necessary. If padding == CONSECUTIVE, no such
-    // padding is allowed and it is just checked that object layout is as
-    // intended.
+    // MarkingBitmap::IndexInCell(MarkingBitmap::AddressToIndex(address)) ==
+    // index_in_cell. To achieve this, padding (i.e., introducing a free-space
+    // object of the appropriate size) may be necessary. If padding ==
+    // CONSECUTIVE, no such padding is allowed and it is just checked that
+    // object layout is as intended.
     int index_in_cell = -1;
-    enum { CONSECUTIVE, PAD_WHITE, PAD_BLACK } padding = CONSECUTIVE;
+    enum { CONSECUTIVE, PAD_UNMARKED, PAD_MARKED } padding = CONSECUTIVE;
     // The id of the page on which the object was allocated and its address are
     // stored here.
     int page_id = -1;
@@ -113,25 +112,27 @@ class InnerPointerResolutionTest
     Address ptr = page->area_start();
     for (auto object : objects) {
       DCHECK_NE(ObjectRequest::LARGE, object.type);
-      DCHECK_EQ(0, object.size % Tagged);
+      DCHECK_EQ(0, object.size % kTaggedSize);
 
       // Check if padding is needed.
-      int index_in_cell = Bitmap::IndexInCell(page->AddressToMarkbitIndex(ptr));
+      int index_in_cell =
+          MarkingBitmap::IndexInCell(MarkingBitmap::AddressToIndex(ptr));
       if (object.index_in_cell < 0) {
         object.index_in_cell = index_in_cell;
       } else if (object.padding != ObjectRequest::CONSECUTIVE) {
         DCHECK_LE(0, object.index_in_cell);
-        DCHECK_GT(Bitmap::kBitsPerCell, object.index_in_cell);
+        DCHECK_GT(MarkingBitmap::kBitsPerCell, object.index_in_cell);
         const int needed_padding_size =
-            ((Bitmap::kBitsPerCell + object.index_in_cell - index_in_cell) %
-             Bitmap::kBitsPerCell) *
-            Tagged;
+            ((MarkingBitmap::kBitsPerCell + object.index_in_cell -
+              index_in_cell) %
+             MarkingBitmap::kBitsPerCell) *
+            kTaggedSize;
         if (needed_padding_size > 0) {
           ObjectRequest pad{needed_padding_size,
                             ObjectRequest::FREE,
-                            object.padding == ObjectRequest::PAD_BLACK
-                                ? ObjectRequest::BLACK_AREA
-                                : ObjectRequest::WHITE,
+                            object.padding == ObjectRequest::PAD_MARKED
+                                ? ObjectRequest::MARKED_AREA
+                                : ObjectRequest::UNMARKED,
                             index_in_cell,
                             ObjectRequest::CONSECUTIVE,
                             page_id,
@@ -139,13 +140,14 @@ class InnerPointerResolutionTest
           ptr += needed_padding_size;
           DCHECK_LE(ptr, page->area_end());
           CreateObject(pad);
-          index_in_cell = Bitmap::IndexInCell(page->AddressToMarkbitIndex(ptr));
+          index_in_cell =
+              MarkingBitmap::IndexInCell(MarkingBitmap::AddressToIndex(ptr));
         }
       }
 
       // This will fail if the marking bitmap's implementation parameters change
-      // (e.g., Bitmap::kBitsPerCell) or the size of the page header changes.
-      // In this case, the tests will need to be revised accordingly.
+      // (e.g., MarkingBitmap::kBitsPerCell) or the size of the page header
+      // changes. In this case, the tests will need to be revised accordingly.
       EXPECT_EQ(index_in_cell, object.index_in_cell);
 
       object.page_id = page_id;
@@ -158,12 +160,12 @@ class InnerPointerResolutionTest
     // Create one last object that uses the remaining space on the page; this
     // simulates freeing the page's LAB.
     const int remaining_size = static_cast<int>(page->area_end() - ptr);
-    const uint32_t index = page->AddressToMarkbitIndex(ptr);
-    const int index_in_cell = Bitmap::IndexInCell(index);
+    const auto index = MarkingBitmap::AddressToIndex(ptr);
+    const auto index_in_cell = MarkingBitmap::IndexInCell(index);
     ObjectRequest last{remaining_size,
                        ObjectRequest::FREE,
-                       ObjectRequest::WHITE,
-                       index_in_cell,
+                       ObjectRequest::UNMARKED,
+                       static_cast<int>(index_in_cell),
                        ObjectRequest::CONSECUTIVE,
                        page_id,
                        ptr};
@@ -195,13 +197,13 @@ class InnerPointerResolutionTest
     switch (object.type) {
       case ObjectRequest::REGULAR:
       case ObjectRequest::LARGE: {
-        DCHECK_LE(2 * Tagged, object.size);
+        DCHECK_LE(2 * kTaggedSize, object.size);
         ReadOnlyRoots roots(heap());
         HeapObject heap_object(HeapObject::FromAddress(object.address));
         heap_object.set_map_after_allocation(roots.unchecked_fixed_array_map(),
                                              SKIP_WRITE_BARRIER);
         FixedArray arr(FixedArray::cast(heap_object));
-        arr.set_length((object.size - FixedArray::SizeFor(0)) / Tagged);
+        arr.set_length((object.size - FixedArray::SizeFor(0)) / kTaggedSize);
         DCHECK_EQ(object.size, arr.AllocatedSize());
         break;
       }
@@ -212,22 +214,17 @@ class InnerPointerResolutionTest
 
     // Mark the object in the bitmap, if necessary.
     switch (object.marked) {
-      case ObjectRequest::WHITE:
+      case ObjectRequest::UNMARKED:
         break;
-      case ObjectRequest::GREY:
+      case ObjectRequest::MARKED:
         heap()->marking_state()->TryMark(
             HeapObject::FromAddress(object.address));
         break;
-      case ObjectRequest::BLACK:
-        DCHECK_LE(2 * Tagged, object.size);
-        heap()->marking_state()->TryMarkAndAccountLiveBytes(
-            HeapObject::FromAddress(object.address));
-        break;
-      case ObjectRequest::BLACK_AREA: {
+      case ObjectRequest::MARKED_AREA: {
         MemoryChunk* page = LookupPage(object.page_id);
-        heap()->marking_state()->bitmap(page)->SetRange(
-            page->AddressToMarkbitIndex(object.address),
-            page->AddressToMarkbitIndex(object.address + object.size));
+        page->marking_bitmap()->SetRange<AccessMode::NON_ATOMIC>(
+            MarkingBitmap::AddressToIndex(object.address),
+            MarkingBitmap::LimitAddressToIndex(object.address + object.size));
         break;
       }
     }
@@ -239,11 +236,7 @@ class InnerPointerResolutionTest
     DCHECK_GT(object.size, offset);
     Address base_ptr = ResolveInnerPointer(object.address + offset);
     bool should_return_null =
-        !IsPageAlive(object.page_id) || (object.type == ObjectRequest::FREE) ||
-        (object.type == ObjectRequest::REGULAR &&
-         (object.marked == ObjectRequest::BLACK_AREA ||
-          (object.marked == ObjectRequest::BLACK && offset < 2 * Tagged) ||
-          (object.marked == ObjectRequest::GREY && offset < Tagged)));
+        !IsPageAlive(object.page_id) || object.type == ObjectRequest::FREE;
     if (should_return_null)
       EXPECT_EQ(kNullAddress, base_ptr);
     else
@@ -292,15 +285,15 @@ TEST_F(InnerPointerResolutionTest, EmptyPage) {
 TEST_F(InnerPointerResolutionTest, NothingMarked) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {16 * Tagged},
-      {12 * Tagged},
-      {13 * Tagged},
-      {128 * Tagged},
-      {1 * Tagged, ObjectRequest::FREE},
-      {15 * Tagged},
-      {2 * Tagged, ObjectRequest::FREE},
-      {2 * Tagged},
-      {10544 * Tagged},
+      {16 * kTaggedSize},
+      {12 * kTaggedSize},
+      {13 * kTaggedSize},
+      {128 * kTaggedSize},
+      {1 * kTaggedSize, ObjectRequest::FREE},
+      {15 * kTaggedSize},
+      {2 * kTaggedSize, ObjectRequest::FREE},
+      {2 * kTaggedSize},
+      {10544 * kTaggedSize},
   });
   TestAll();
 }
@@ -308,15 +301,15 @@ TEST_F(InnerPointerResolutionTest, NothingMarked) {
 TEST_F(InnerPointerResolutionTest, AllMarked) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {12 * Tagged, ObjectRequest::REGULAR, ObjectRequest::GREY},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {1 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {2 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {10544 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {12 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {1 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {10544 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   TestAll();
 }
@@ -324,31 +317,31 @@ TEST_F(InnerPointerResolutionTest, AllMarked) {
 TEST_F(InnerPointerResolutionTest, SomeMarked) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {12 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {1 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {2 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {10544 * Tagged, ObjectRequest::REGULAR, ObjectRequest::GREY},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {12 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {1 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {10544 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, BlackAreas) {
+TEST_F(InnerPointerResolutionTest, MarkedAreas) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {12 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {1 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {2 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {10544 * Tagged, ObjectRequest::REGULAR, ObjectRequest::GREY},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {12 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {1 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {10544 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   TestAll();
 }
@@ -360,154 +353,157 @@ TEST_F(InnerPointerResolutionTest, ThreeMarkedObjectsInSameCell) {
   CreateObjectsInPage({
       // Some initial large unmarked object, followed by a small marked object
       // towards the end of the cell.
-      {128 * Tagged},
-      {5 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK, 20,
-       ObjectRequest::PAD_WHITE},
+      {128 * kTaggedSize},
+      {5 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED, 20,
+       ObjectRequest::PAD_UNMARKED},
       // Then three marked objects in the same cell.
-      {8 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK, 3,
-       ObjectRequest::PAD_WHITE},
-      {12 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK, 11},
-      {5 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK, 23},
+      {8 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED, 3,
+       ObjectRequest::PAD_UNMARKED},
+      {12 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED, 11},
+      {5 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED, 23},
       // This marked object is in the next cell.
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK, 17,
-       ObjectRequest::PAD_WHITE},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED, 17,
+       ObjectRequest::PAD_UNMARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, ThreeBlackAreasInSameCell) {
+TEST_F(InnerPointerResolutionTest, ThreeMarkedAreasInSameCell) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      // Some initial large unmarked object, followed by a small black area
+      // Some initial large unmarked object, followed by a small marked area
       // towards the end of the cell.
-      {128 * Tagged},
-      {5 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 20,
-       ObjectRequest::PAD_WHITE},
-      // Then three black areas in the same cell.
-      {8 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 3,
-       ObjectRequest::PAD_WHITE},
-      {12 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 11},
-      {5 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 23},
-      // This black area is in the next cell.
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 17,
-       ObjectRequest::PAD_WHITE},
+      {128 * kTaggedSize},
+      {5 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 20,
+       ObjectRequest::PAD_UNMARKED},
+      // Then three marked areas in the same cell.
+      {8 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 3,
+       ObjectRequest::PAD_UNMARKED},
+      {12 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA,
+       11},
+      {5 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 23},
+      // This marked area is in the next cell.
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 17,
+       ObjectRequest::PAD_UNMARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, SmallBlackAreaAtPageStart) {
+TEST_F(InnerPointerResolutionTest, SmallMarkedAreaAtPageStart) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE, 30,
-       ObjectRequest::PAD_BLACK},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED, 30,
+       ObjectRequest::PAD_MARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, SmallBlackAreaAtPageStartUntilCellBoundary) {
+TEST_F(InnerPointerResolutionTest,
+       SmallMarkedAreaAtPageStartUntilCellBoundary) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE, 0,
-       ObjectRequest::PAD_BLACK},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED, 0,
+       ObjectRequest::PAD_MARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, LargeBlackAreaAtPageStart) {
+TEST_F(InnerPointerResolutionTest, LargeMarkedAreaAtPageStart) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {42 * FullCell, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE, 30,
-       ObjectRequest::PAD_BLACK},
+      {42 * FullCell, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED, 30,
+       ObjectRequest::PAD_MARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, LargeBlackAreaAtPageStartUntilCellBoundary) {
+TEST_F(InnerPointerResolutionTest,
+       LargeMarkedAreaAtPageStartUntilCellBoundary) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {42 * FullCell, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE, 0,
-       ObjectRequest::PAD_BLACK},
+      {42 * FullCell, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED, 0,
+       ObjectRequest::PAD_MARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, SmallBlackAreaStartingAtCellBoundary) {
+TEST_F(InnerPointerResolutionTest, SmallMarkedAreaStartingAtCellBoundary) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {128 * Tagged},
-      {5 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 0,
-       ObjectRequest::PAD_WHITE},
+      {128 * kTaggedSize},
+      {5 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 0,
+       ObjectRequest::PAD_UNMARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, LargeBlackAreaStartingAtCellBoundary) {
+TEST_F(InnerPointerResolutionTest, LargeMarkedAreaStartingAtCellBoundary) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {128 * Tagged},
-      {42 * FullCell + 16 * Tagged, ObjectRequest::REGULAR,
-       ObjectRequest::BLACK_AREA, 0, ObjectRequest::PAD_WHITE},
+      {128 * kTaggedSize},
+      {42 * FullCell + 16 * kTaggedSize, ObjectRequest::REGULAR,
+       ObjectRequest::MARKED_AREA, 0, ObjectRequest::PAD_UNMARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, SmallBlackAreaEndingAtCellBoundary) {
+TEST_F(InnerPointerResolutionTest, SmallMarkedAreaEndingAtCellBoundary) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {128 * Tagged},
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 13,
-       ObjectRequest::PAD_WHITE},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE, 0,
-       ObjectRequest::PAD_BLACK},
+      {128 * kTaggedSize},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 13,
+       ObjectRequest::PAD_UNMARKED},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED, 0,
+       ObjectRequest::PAD_MARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, LargeBlackAreaEndingAtCellBoundary) {
+TEST_F(InnerPointerResolutionTest, LargeMarkedAreaEndingAtCellBoundary) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {128 * Tagged},
-      {42 * FullCell + 16 * Tagged, ObjectRequest::REGULAR,
-       ObjectRequest::BLACK_AREA, 0, ObjectRequest::PAD_WHITE},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE, 0,
-       ObjectRequest::PAD_BLACK},
+      {128 * kTaggedSize},
+      {42 * FullCell + 16 * kTaggedSize, ObjectRequest::REGULAR,
+       ObjectRequest::MARKED_AREA, 0, ObjectRequest::PAD_UNMARKED},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED, 0,
+       ObjectRequest::PAD_MARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, TwoSmallBlackAreasAtCellBoundaries) {
+TEST_F(InnerPointerResolutionTest, TwoSmallMarkedAreasAtCellBoundaries) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {128 * Tagged},
-      {6 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 0,
-       ObjectRequest::PAD_WHITE},
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 25,
-       ObjectRequest::PAD_WHITE},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE, 0,
-       ObjectRequest::PAD_BLACK},
+      {128 * kTaggedSize},
+      {6 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 0,
+       ObjectRequest::PAD_UNMARKED},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 25,
+       ObjectRequest::PAD_UNMARKED},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED, 0,
+       ObjectRequest::PAD_MARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, BlackAreaOfOneCell) {
+TEST_F(InnerPointerResolutionTest, MarkedAreaOfOneCell) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {128 * Tagged},
-      {1 * FullCell, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 0,
-       ObjectRequest::PAD_WHITE},
+      {128 * kTaggedSize},
+      {1 * FullCell, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 0,
+       ObjectRequest::PAD_UNMARKED},
   });
   TestAll();
 }
 
-TEST_F(InnerPointerResolutionTest, BlackAreaOfManyCells) {
+TEST_F(InnerPointerResolutionTest, MarkedAreaOfManyCells) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {128 * Tagged},
-      {17 * FullCell, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA, 0,
-       ObjectRequest::PAD_WHITE},
+      {128 * kTaggedSize},
+      {17 * FullCell, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA, 0,
+       ObjectRequest::PAD_UNMARKED},
   });
   TestAll();
 }
@@ -517,21 +513,21 @@ TEST_F(InnerPointerResolutionTest, BlackAreaOfManyCells) {
 TEST_F(InnerPointerResolutionTest, TwoPages) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {10544 * Tagged, ObjectRequest::REGULAR, ObjectRequest::GREY},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {10544 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   CreateObjectsInPage({
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {12 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {1 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {12 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {1 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   TestAll();
 }
@@ -539,7 +535,7 @@ TEST_F(InnerPointerResolutionTest, TwoPages) {
 TEST_F(InnerPointerResolutionTest, OneLargePage) {
   if (v8_flags.enable_third_party_heap) return;
   CreateLargeObjects({
-      {1 * MB, ObjectRequest::LARGE, ObjectRequest::WHITE},
+      {1 * MB, ObjectRequest::LARGE, ObjectRequest::UNMARKED},
   });
   TestAll();
 }
@@ -547,8 +543,8 @@ TEST_F(InnerPointerResolutionTest, OneLargePage) {
 TEST_F(InnerPointerResolutionTest, SeveralLargePages) {
   if (v8_flags.enable_third_party_heap) return;
   CreateLargeObjects({
-      {1 * MB, ObjectRequest::LARGE, ObjectRequest::WHITE},
-      {32 * MB, ObjectRequest::LARGE, ObjectRequest::BLACK},
+      {1 * MB, ObjectRequest::LARGE, ObjectRequest::UNMARKED},
+      {32 * MB, ObjectRequest::LARGE, ObjectRequest::MARKED},
   });
   TestAll();
 }
@@ -556,25 +552,25 @@ TEST_F(InnerPointerResolutionTest, SeveralLargePages) {
 TEST_F(InnerPointerResolutionTest, PagesOfBothKind) {
   if (v8_flags.enable_third_party_heap) return;
   CreateObjectsInPage({
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {10544 * Tagged, ObjectRequest::REGULAR, ObjectRequest::GREY},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {10544 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   CreateObjectsInPage({
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {12 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {1 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {12 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {1 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   CreateLargeObjects({
-      {1 * MB, ObjectRequest::LARGE, ObjectRequest::WHITE},
-      {32 * MB, ObjectRequest::LARGE, ObjectRequest::BLACK},
+      {1 * MB, ObjectRequest::LARGE, ObjectRequest::UNMARKED},
+      {32 * MB, ObjectRequest::LARGE, ObjectRequest::MARKED},
   });
   TestAll();
 }
@@ -582,25 +578,25 @@ TEST_F(InnerPointerResolutionTest, PagesOfBothKind) {
 TEST_F(InnerPointerResolutionTest, FreePages) {
   if (v8_flags.enable_third_party_heap) return;
   int some_normal_page = CreateObjectsInPage({
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {10544 * Tagged, ObjectRequest::REGULAR, ObjectRequest::GREY},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {10544 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   CreateObjectsInPage({
-      {128 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {16 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {12 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK_AREA},
-      {13 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
-      {1 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::FREE, ObjectRequest::GREY},
-      {2 * Tagged, ObjectRequest::REGULAR, ObjectRequest::WHITE},
-      {15 * Tagged, ObjectRequest::REGULAR, ObjectRequest::BLACK},
+      {128 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {16 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {12 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED_AREA},
+      {13 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
+      {1 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::FREE, ObjectRequest::MARKED},
+      {2 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::UNMARKED},
+      {15 * kTaggedSize, ObjectRequest::REGULAR, ObjectRequest::MARKED},
   });
   auto large_pages = CreateLargeObjects({
-      {1 * MB, ObjectRequest::LARGE, ObjectRequest::WHITE},
-      {32 * MB, ObjectRequest::LARGE, ObjectRequest::BLACK},
+      {1 * MB, ObjectRequest::LARGE, ObjectRequest::UNMARKED},
+      {32 * MB, ObjectRequest::LARGE, ObjectRequest::MARKED},
   });
   TestAll();
   FreePage(some_normal_page);
@@ -615,7 +611,6 @@ using InnerPointerResolutionHeapTest =
 TEST_F(InnerPointerResolutionHeapTest, UnusedRegularYoungPages) {
   ManualGCScope manual_gc_scope(isolate());
   DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap());
-  v8_flags.page_promotion = false;
 
   Persistent<v8::FixedArray> weak1, weak2, strong;
   Address inner_ptr1, inner_ptr2, inner_ptr3, outside_ptr1, outside_ptr2;
@@ -632,50 +627,50 @@ TEST_F(InnerPointerResolutionHeapTest, UnusedRegularYoungPages) {
     const int length =
         (heap()->MaxRegularHeapObjectSize(AllocationType::kYoung) -
          FixedArray::SizeFor(0)) /
-        Tagged;
+        kTaggedSize;
     auto h1 = factory()->NewFixedArray(length, AllocationType::kYoung);
     auto h2 = factory()->NewFixedArray(length, AllocationType::kYoung);
     weak1.Reset(v8_isolate(), Utils::FixedArrayToLocal(h1));
     weak2.Reset(v8_isolate(), Utils::FixedArrayToLocal(h2));
     weak1.SetWeak();
     weak2.SetWeak();
-    auto obj1 = h1->GetHeapObject();
-    auto obj2 = h2->GetHeapObject();
+    auto obj1 = *h1;
+    auto obj2 = *h2;
     page1 = Page::FromHeapObject(obj1);
     EXPECT_TRUE(!page1->IsLargePage());
-    EXPECT_TRUE(v8_flags.minor_mc || page1->IsToPage());
+    EXPECT_TRUE(v8_flags.minor_ms || page1->IsToPage());
     page2 = Page::FromHeapObject(obj2);
     EXPECT_TRUE(!page2->IsLargePage());
-    EXPECT_TRUE(v8_flags.minor_mc || page2->IsToPage());
+    EXPECT_TRUE(v8_flags.minor_ms || page2->IsToPage());
     EXPECT_NE(page1, page2);
 
     // Allocate one more object, small enough that it fits in either page1 or
     // page2. Keep a strong reference to this object.
     auto h3 = factory()->NewFixedArray(16, AllocationType::kYoung);
     strong.Reset(v8_isolate(), Utils::FixedArrayToLocal(h3));
-    auto obj3 = h3->GetHeapObject();
+    auto obj3 = *h3;
     auto page3 = Page::FromHeapObject(obj3);
     EXPECT_TRUE(page3 == page1 || page3 == page2);
     if (page3 == page1) {
-      EXPECT_EQ(obj3.address(), obj1.address() + obj1.Size(cage_base));
+      EXPECT_EQ(obj3.address(), obj1.address() + obj1->Size(cage_base));
     } else {
-      EXPECT_EQ(obj3.address(), obj2.address() + obj2.Size(cage_base));
+      EXPECT_EQ(obj3.address(), obj2.address() + obj2->Size(cage_base));
     }
 
     // Keep inner pointers to all objects.
-    inner_ptr1 = obj1.address() + 17 * Tagged;
-    inner_ptr2 = obj2.address() + 37 * Tagged;
-    inner_ptr3 = obj3.address() + 7 * Tagged;
+    inner_ptr1 = obj1.address() + 17 * kTaggedSize;
+    inner_ptr2 = obj2.address() + 37 * kTaggedSize;
+    inner_ptr3 = obj3.address() + 7 * kTaggedSize;
 
     // Keep pointers to the end of the pages, after the objects.
-    outside_ptr1 = page1->area_end() - 3 * Tagged;
-    outside_ptr2 = page2->area_end() - 2 * Tagged;
-    EXPECT_LE(obj1.address() + obj1.Size(cage_base), outside_ptr1);
-    EXPECT_LE(obj2.address() + obj2.Size(cage_base), outside_ptr2);
+    outside_ptr1 = page1->area_end() - 3 * kTaggedSize;
+    outside_ptr2 = page2->area_end() - 2 * kTaggedSize;
+    EXPECT_LE(obj1.address() + obj1->Size(cage_base), outside_ptr1);
+    EXPECT_LE(obj2.address() + obj2->Size(cage_base), outside_ptr2);
     if (page3 == page1) {
-      EXPECT_LE(obj3.address() + obj3.Size(cage_base), outside_ptr1);
+      EXPECT_LE(obj3.address() + obj3->Size(cage_base), outside_ptr1);
     } else {
-      EXPECT_LE(obj3.address() + obj3.Size(cage_base), outside_ptr2);
+      EXPECT_LE(obj3.address() + obj3->Size(cage_base), outside_ptr2);
     }
 
     // Ensure the young generation space is iterable.
@@ -705,7 +700,7 @@ TEST_F(InnerPointerResolutionHeapTest, UnusedRegularYoungPages) {
 
   // Garbage collection should reclaim the two large objects with the weak
   // references, but not the small one with the strong reference.
-  GcAndSweep(NEW_SPACE);
+  InvokeAtomicMinorGC();
   EXPECT_TRUE(weak1.IsEmpty());
   EXPECT_TRUE(weak2.IsEmpty());
   EXPECT_TRUE(!strong.IsEmpty());
@@ -714,8 +709,8 @@ TEST_F(InnerPointerResolutionHeapTest, UnusedRegularYoungPages) {
   EXPECT_EQ(page2, allocator->LookupChunkContainingAddress(inner_ptr2));
   EXPECT_EQ(AllocationSpace::NEW_SPACE, page1->owner_identity());
   EXPECT_EQ(AllocationSpace::NEW_SPACE, page2->owner_identity());
-  EXPECT_TRUE(v8_flags.minor_mc || page1->IsFromPage());
-  EXPECT_TRUE(v8_flags.minor_mc || page2->IsFromPage());
+  EXPECT_TRUE(v8_flags.minor_ms || page1->IsFromPage());
+  EXPECT_TRUE(v8_flags.minor_ms || page2->IsFromPage());
 
   // Inner pointer resolution should work with pointers to unused young
   // generation pages (in case of the scavenger, the two pages are now in the
@@ -727,14 +722,14 @@ TEST_F(InnerPointerResolutionHeapTest, UnusedRegularYoungPages) {
   EXPECT_EQ(kNullAddress, ResolveInnerPointer(outside_ptr2));
 
   // Garbage collection once more.
-  GcAndSweep(NEW_SPACE);
+  InvokeAtomicMinorGC();
   EXPECT_EQ(AllocationSpace::NEW_SPACE, page1->owner_identity());
   EXPECT_EQ(AllocationSpace::NEW_SPACE, page2->owner_identity());
   // The two pages should still be around, in the new space.
   EXPECT_EQ(page1, allocator->LookupChunkContainingAddress(inner_ptr1));
   EXPECT_EQ(page2, allocator->LookupChunkContainingAddress(inner_ptr2));
-  EXPECT_TRUE(v8_flags.minor_mc || page1->IsToPage());
-  EXPECT_TRUE(v8_flags.minor_mc || page2->IsToPage());
+  EXPECT_TRUE(v8_flags.minor_ms || page1->IsToPage());
+  EXPECT_TRUE(v8_flags.minor_ms || page2->IsToPage());
 
   // Inner pointer resolution should work with pointers to unused young
   // generation pages (in case of the scavenger, the two pages are now in the
@@ -749,7 +744,6 @@ TEST_F(InnerPointerResolutionHeapTest, UnusedRegularYoungPages) {
 TEST_F(InnerPointerResolutionHeapTest, UnusedLargeYoungPage) {
   ManualGCScope manual_gc_scope(isolate());
   DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap());
-  v8_flags.page_promotion = false;
 
   Global<v8::FixedArray> weak;
   Address inner_ptr;
@@ -762,25 +756,25 @@ TEST_F(InnerPointerResolutionHeapTest, UnusedLargeYoungPage) {
     const int length =
         std::max(1 << kPageSizeBits,
                  2 * heap()->MaxRegularHeapObjectSize(AllocationType::kYoung)) /
-        Tagged;
+        kTaggedSize;
     auto h = factory()->NewFixedArray(length, AllocationType::kYoung);
     weak.Reset(v8_isolate(), Utils::FixedArrayToLocal(h));
     weak.SetWeak();
-    auto obj = h->GetHeapObject();
+    auto obj = *h;
     auto page = Page::FromHeapObject(obj);
     EXPECT_TRUE(page->IsLargePage());
     EXPECT_EQ(AllocationSpace::NEW_LO_SPACE, page->owner_identity());
-    EXPECT_TRUE(v8_flags.minor_mc || page->IsToPage());
+    EXPECT_TRUE(v8_flags.minor_ms || page->IsToPage());
 
     // Keep inner pointer.
-    inner_ptr = obj.address() + 17 * Tagged;
+    inner_ptr = obj.address() + 17 * kTaggedSize;
 
     // Inner pointer resolution should work now, finding the object.
     EXPECT_EQ(obj.address(), ResolveInnerPointer(inner_ptr));
   }
 
   // Garbage collection should reclaim the object.
-  GcAndSweep(NEW_SPACE);
+  InvokeAtomicMinorGC();
   EXPECT_TRUE(weak.IsEmpty());
 
   // Inner pointer resolution should work with a pointer to an unused young
@@ -809,7 +803,7 @@ TEST_F(InnerPointerResolutionHeapTest, RegularPageAfterEnd) {
   EXPECT_FALSE(Page::IsAlignedToPageSize(page->area_end()));
 
   // Inner pointer resolution after the end of the page area should work.
-  Address inner_ptr = page->area_end() + Tagged;
+  Address inner_ptr = page->area_end() + kTaggedSize;
   EXPECT_FALSE(Page::IsAlignedToPageSize(inner_ptr));
   EXPECT_EQ(kNullAddress, ResolveInnerPointer(inner_ptr));
 
@@ -833,7 +827,7 @@ TEST_F(InnerPointerResolutionHeapTest, LargePageAfterEnd) {
   EXPECT_FALSE(Page::IsAlignedToPageSize(page->area_end()));
 
   // Inner pointer resolution after the end of the pare area should work.
-  Address inner_ptr = page->area_end() + Tagged;
+  Address inner_ptr = page->area_end() + kTaggedSize;
   EXPECT_FALSE(Page::IsAlignedToPageSize(inner_ptr));
   EXPECT_EQ(kNullAddress, ResolveInnerPointer(inner_ptr));
 
diff --git a/deps/v8/test/unittests/heap/iterators-unittest.cc b/deps/v8/test/unittests/heap/iterators-unittest.cc
new file mode 100644
index 00000000000000..870af6d221b286
--- /dev/null
+++ b/deps/v8/test/unittests/heap/iterators-unittest.cc
@@ -0,0 +1,116 @@
+// Copyright 2019 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "include/v8-object.h"
+#include "src/api/api-inl.h"
+#include "src/execution/isolate.h"
+#include "src/heap/combined-heap.h"
+#include "src/heap/heap.h"
+#include "src/heap/read-only-heap.h"
+#include "src/heap/read-only-spaces.h"
+#include "src/objects/heap-object.h"
+#include "src/objects/objects.h"
+#include "src/roots/roots-inl.h"
+#include "test/unittests/test-utils.h"
+
+namespace v8::internal::heap {
+
+using IteratorsTest = TestWithNativeContext;
+
+namespace {
+template <typename T>
+void TestIterator(T it) {
+  while (!it.Next().is_null()) {
+  }
+  for (int i = 0; i < 20; i++) {
+    CHECK(it.Next().is_null());
+  }
+}
+}  // namespace
+
+TEST_F(IteratorsTest, HeapObjectIteratorNullPastEnd) {
+  TestIterator<HeapObjectIterator>(
+      static_cast<v8::internal::HeapObjectIterator>(i_isolate()->heap()));
+}
+
+TEST_F(IteratorsTest, ReadOnlyHeapObjectIteratorNullPastEnd) {
+  TestIterator<ReadOnlyHeapObjectIterator>(
+      static_cast<v8::internal::ReadOnlyHeapObjectIterator>(
+          i_isolate()->read_only_heap()));
+}
+
+TEST_F(IteratorsTest, CombinedHeapObjectIteratorNullPastEnd) {
+  TestIterator<CombinedHeapObjectIterator>(i_isolate()->heap());
+}
+
+namespace {
+// An arbitrary object guaranteed to live on the non-read-only heap.
+Tagged<Object> CreateWritableObject(v8::Isolate* isolate) {
+  return *v8::Utils::OpenHandle(*v8::Object::New(isolate));
+}
+}  // namespace
+
+TEST_F(IteratorsTest, ReadOnlyHeapObjectIterator) {
+  HandleScope handle_scope(i_isolate());
+  const Tagged<Object> sample_object = CreateWritableObject(v8_isolate());
+  ReadOnlyHeapObjectIterator iterator(i_isolate()->read_only_heap());
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
+       obj = iterator.Next()) {
+    CHECK(ReadOnlyHeap::Contains(obj));
+    CHECK(!i_isolate()->heap()->Contains(obj));
+    CHECK_NE(sample_object, obj);
+  }
+}
+
+TEST_F(IteratorsTest, HeapObjectIterator) {
+  Heap* const heap = i_isolate()->heap();
+  HandleScope handle_scope(i_isolate());
+  const Tagged<Object> sample_object = CreateWritableObject(v8_isolate());
+  bool seen_sample_object = false;
+  HeapObjectIterator iterator(heap);
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
+       obj = iterator.Next()) {
+    CHECK_IMPLIES(!v8_flags.enable_third_party_heap,
+                  !ReadOnlyHeap::Contains(obj));
+    CHECK(heap->Contains(obj));
+    if (sample_object.SafeEquals(obj)) seen_sample_object = true;
+  }
+  CHECK(seen_sample_object);
+}
+
+TEST_F(IteratorsTest, CombinedHeapObjectIterator) {
+  Heap* const heap = i_isolate()->heap();
+  HandleScope handle_scope(i_isolate());
+  const Tagged<Object> sample_object = CreateWritableObject(v8_isolate());
+  bool seen_sample_object = false;
+  CombinedHeapObjectIterator iterator(heap);
+  for (Tagged<HeapObject> obj = iterator.Next(); !obj.is_null();
+       obj = iterator.Next()) {
+    CHECK(IsValidHeapObject(heap, obj));
+    if (sample_object.SafeEquals(obj)) seen_sample_object = true;
+  }
+  CHECK(seen_sample_object);
+}
+
+TEST_F(IteratorsTest, PagedSpaceIterator) {
+  Heap* const heap = i_isolate()->heap();
+  PagedSpaceIterator iterator(heap);
+  CHECK_EQ(heap->old_space(), iterator.Next());
+  CHECK_EQ(heap->code_space(), iterator.Next());
+  for (int i = 0; i < 20; i++) {
+    CHECK_NULL(iterator.Next());
+  }
+}
+
+TEST_F(IteratorsTest, SpaceIterator) {
+  auto* const read_only_space =
+      i_isolate()->read_only_heap()->read_only_space();
+  for (SpaceIterator it(i_isolate()->heap()); it.HasNext();) {
+    // ReadOnlySpace is not actually a Space but is instead a BaseSpace, but
+    // ensure it's not been inserted incorrectly.
+    CHECK_NE(it.Next(), reinterpret_cast<BaseSpace*>(read_only_space));
+  }
+}
+
+}  // namespace v8::internal::heap
diff --git a/deps/v8/test/unittests/heap/lab-unittest.cc b/deps/v8/test/unittests/heap/lab-unittest.cc
index 901d5755241597..3cc21c0386fac1 100644
--- a/deps/v8/test/unittests/heap/lab-unittest.cc
+++ b/deps/v8/test/unittests/heap/lab-unittest.cc
@@ -25,7 +25,7 @@ Address AllocateLabBackingStore(Heap* heap, size_t size_in_bytes) {
 bool AllocateFromLab(Heap* heap, LocalAllocationBuffer* lab,
                      size_t size_in_bytes,
                      AllocationAlignment alignment = kTaggedAligned) {
-  HeapObject obj;
+  Tagged<HeapObject> obj;
   AllocationResult result =
       lab->AllocateRawAligned(static_cast<int>(size_in_bytes), alignment);
   if (result.To(&obj)) {
@@ -38,14 +38,14 @@ bool AllocateFromLab(Heap* heap, LocalAllocationBuffer* lab,
 void VerifyIterable(Address base, Address limit,
                     std::vector<size_t> expected_size) {
   EXPECT_LE(base, limit);
-  HeapObject object;
+  Tagged<HeapObject> object;
   size_t counter = 0;
   while (base < limit) {
     object = HeapObject::FromAddress(base);
-    EXPECT_TRUE(object.IsFreeSpaceOrFiller());
+    EXPECT_TRUE(IsFreeSpaceOrFiller(object));
     EXPECT_LT(counter, expected_size.size());
-    EXPECT_EQ(expected_size[counter], static_cast<size_t>(object.Size()));
-    base += object.Size();
+    EXPECT_EQ(expected_size[counter], static_cast<size_t>(object->Size()));
+    base += object->Size();
     counter++;
   }
 }
diff --git a/deps/v8/test/unittests/heap/local-factory-unittest.cc b/deps/v8/test/unittests/heap/local-factory-unittest.cc
index b2e797fa9f86ce..58cf531f631662 100644
--- a/deps/v8/test/unittests/heap/local-factory-unittest.cc
+++ b/deps/v8/test/unittests/heap/local-factory-unittest.cc
@@ -126,14 +126,14 @@ TEST_F(LocalFactoryTest, OneByteInternalizedString_IsAddedToStringTable) {
   }
 
   EXPECT_TRUE(string->IsOneByteEqualTo(base::CStrVector("foo")));
-  EXPECT_TRUE(string->IsInternalizedString());
+  EXPECT_TRUE(IsInternalizedString(*string));
 
   Handle<String> same_string = isolate()
                                    ->factory()
                                    ->NewStringFromOneByte(string_vector)
                                    .ToHandleChecked();
   EXPECT_NE(*string, *same_string);
-  EXPECT_FALSE(same_string->IsInternalizedString());
+  EXPECT_FALSE(IsInternalizedString(*same_string));
 
   Handle<String> internalized_string =
       isolate()->factory()->InternalizeString(same_string);
@@ -158,7 +158,7 @@ TEST_F(LocalFactoryTest, OneByteInternalizedString_DuplicateIsDeduplicated) {
   }
 
   EXPECT_TRUE(string_1->IsOneByteEqualTo(base::CStrVector("foo")));
-  EXPECT_TRUE(string_1->IsInternalizedString());
+  EXPECT_TRUE(IsInternalizedString(*string_1));
   EXPECT_EQ(*string_1, *string_2);
 }
 
@@ -178,7 +178,7 @@ TEST_F(LocalFactoryTest, AstRawString_IsInternalized) {
   }
 
   EXPECT_TRUE(string->IsOneByteEqualTo(base::CStrVector("foo")));
-  EXPECT_TRUE(string->IsInternalizedString());
+  EXPECT_TRUE(IsInternalizedString(*string));
 }
 
 TEST_F(LocalFactoryTest, AstConsString_CreatesConsString) {
@@ -201,7 +201,7 @@ TEST_F(LocalFactoryTest, AstConsString_CreatesConsString) {
         foobar_string->GetString(local_isolate()));
   }
 
-  EXPECT_TRUE(string->IsConsString());
+  EXPECT_TRUE(IsConsString(*string));
   EXPECT_TRUE(string->Equals(*isolate()->factory()->NewStringFromStaticChars(
       "foobar-plus-padding-for-length")));
 }
@@ -240,7 +240,7 @@ TEST_F(LocalFactoryTest, LazyFunction) {
   Handle<SharedFunctionInfo> lazy_sfi = shared;
 
   EXPECT_EQ(lazy_sfi->function_literal_id(), 1);
-  EXPECT_TRUE(lazy_sfi->Name().IsOneByteEqualTo(base::CStrVector("lazy")));
+  EXPECT_TRUE(lazy_sfi->Name()->IsOneByteEqualTo(base::CStrVector("lazy")));
   EXPECT_FALSE(lazy_sfi->is_compiled());
   EXPECT_TRUE(lazy_sfi->HasUncompiledDataWithoutPreparseData());
 }
@@ -267,7 +267,7 @@ TEST_F(LocalFactoryTest, EagerFunction) {
   Handle<SharedFunctionInfo> eager_sfi = shared;
 
   EXPECT_EQ(eager_sfi->function_literal_id(), 1);
-  EXPECT_TRUE(eager_sfi->Name().IsOneByteEqualTo(base::CStrVector("eager")));
+  EXPECT_TRUE(eager_sfi->Name()->IsOneByteEqualTo(base::CStrVector("eager")));
   EXPECT_FALSE(eager_sfi->HasUncompiledData());
   // TODO(leszeks): Add compilation support and enable these checks.
   // EXPECT_TRUE(eager_sfi->is_compiled());
@@ -298,7 +298,7 @@ TEST_F(LocalFactoryTest, ImplicitNameFunction) {
   Handle<SharedFunctionInfo> implicit_name_sfi = shared;
 
   EXPECT_EQ(implicit_name_sfi->function_literal_id(), 1);
-  EXPECT_TRUE(implicit_name_sfi->Name().IsOneByteEqualTo(
+  EXPECT_TRUE(implicit_name_sfi->Name()->IsOneByteEqualTo(
       base::CStrVector("implicit_name")));
 }
 
@@ -326,7 +326,7 @@ TEST_F(LocalFactoryTest, GCDuringPublish) {
   Handle<SharedFunctionInfo> implicit_name_sfi = shared;
 
   EXPECT_EQ(implicit_name_sfi->function_literal_id(), 1);
-  EXPECT_TRUE(implicit_name_sfi->Name().IsOneByteEqualTo(
+  EXPECT_TRUE(implicit_name_sfi->Name()->IsOneByteEqualTo(
       base::CStrVector("implicit_name")));
 }
 
diff --git a/deps/v8/test/unittests/heap/local-handles-unittest.cc b/deps/v8/test/unittests/heap/local-handles-unittest.cc
index 0f23703089b616..e88bc1eab07d34 100644
--- a/deps/v8/test/unittests/heap/local-handles-unittest.cc
+++ b/deps/v8/test/unittests/heap/local-handles-unittest.cc
@@ -78,7 +78,7 @@ TEST_F(LocalHandlesTest, CreateLocalHandles) {
   {
     HandleScope handle_scope(isolate);
     Handle<HeapNumber> number = isolate->factory()->NewHeapNumber(42.0);
-    object = (*number).address();
+    object = number->address();
   }
 
   base::Semaphore sema_started(0);
@@ -90,7 +90,7 @@ TEST_F(LocalHandlesTest, CreateLocalHandles) {
 
   sema_started.Wait();
 
-  CollectAllGarbage();
+  InvokeMajorGC();
   sema_gc_finished.Signal();
 
   thread->Join();
diff --git a/deps/v8/test/unittests/heap/local-heap-unittest.cc b/deps/v8/test/unittests/heap/local-heap-unittest.cc
index cbbdeb1a6c3aac..31f19eab7b9ebe 100644
--- a/deps/v8/test/unittests/heap/local-heap-unittest.cc
+++ b/deps/v8/test/unittests/heap/local-heap-unittest.cc
@@ -9,6 +9,7 @@
 #include "src/heap/heap.h"
 #include "src/heap/parked-scope.h"
 #include "src/heap/safepoint.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -83,7 +84,7 @@ namespace {
 
 class GCEpilogue {
  public:
-  static void Callback(LocalIsolate*, GCType, GCCallbackFlags, void* data) {
+  static void Callback(void* data) {
     reinterpret_cast<GCEpilogue*>(data)->was_invoked_ = true;
   }
 
@@ -170,7 +171,7 @@ TEST_F(LocalHeapTest, GCEpilogue) {
   CHECK(thread2->Start());
   epilogue[1].WaitUntilStarted();
   epilogue[2].WaitUntilStarted();
-  PreciseCollectAllGarbage(i_isolate());
+  InvokeAtomicMajorGC(i_isolate());
   epilogue[1].RequestStop();
   epilogue[2].RequestStop();
   thread1->Join();
diff --git a/deps/v8/test/unittests/heap/marking-unittest.cc b/deps/v8/test/unittests/heap/marking-unittest.cc
index 63923c0fa871ae..2134007f9aa3a1 100644
--- a/deps/v8/test/unittests/heap/marking-unittest.cc
+++ b/deps/v8/test/unittests/heap/marking-unittest.cc
@@ -12,50 +12,21 @@
 namespace v8 {
 namespace internal {
 
-template <typename T>
-using MarkingTest = TestWithBitmap<T>;
+using MarkingTest = TestWithBitmap;
 
-TYPED_TEST_SUITE(MarkingTest, BitmapTypes);
-
-TYPED_TEST(MarkingTest, TransitionWhiteBlackWhite) {
-  auto bitmap = this->bitmap();
-  const int kLocationsSize = 3;
-  int position[kLocationsSize] = {
-      Bitmap::kBitsPerCell - 2, Bitmap::kBitsPerCell - 1, Bitmap::kBitsPerCell};
-  for (int i = 0; i < kLocationsSize; i++) {
-    MarkBit mark_bit = bitmap->MarkBitFromIndex(position[i]);
-    CHECK(Marking::IsWhite(mark_bit));
-    CHECK(!Marking::IsImpossible(mark_bit));
-    Marking::WhiteToBlack<AccessMode::NON_ATOMIC>(mark_bit);
-    CHECK(Marking::IsBlack(mark_bit));
-    CHECK(!Marking::IsImpossible(mark_bit));
-    Marking::MarkWhite(mark_bit);
-    CHECK(Marking::IsWhite(mark_bit));
-    CHECK(!Marking::IsImpossible(mark_bit));
-  }
-}
-
-TYPED_TEST(MarkingTest, TransitionWhiteGreyBlack) {
+TEST_F(MarkingTest, TransitionMarkBit) {
   auto bitmap = this->bitmap();
   const int kLocationsSize = 3;
-  int position[kLocationsSize] = {
-      Bitmap::kBitsPerCell - 2, Bitmap::kBitsPerCell - 1, Bitmap::kBitsPerCell};
+  int position[kLocationsSize] = {MarkingBitmap::kBitsPerCell - 2,
+                                  MarkingBitmap::kBitsPerCell - 1,
+                                  MarkingBitmap::kBitsPerCell};
   for (int i = 0; i < kLocationsSize; i++) {
-    MarkBit mark_bit = bitmap->MarkBitFromIndex(position[i]);
-    CHECK(Marking::IsWhite(mark_bit));
-    CHECK(!Marking::IsBlackOrGrey(mark_bit));
-    CHECK(!Marking::IsImpossible(mark_bit));
-    Marking::WhiteToGrey<AccessMode::NON_ATOMIC>(mark_bit);
-    CHECK(Marking::IsGrey(mark_bit));
-    CHECK(Marking::IsBlackOrGrey(mark_bit));
-    CHECK(!Marking::IsImpossible(mark_bit));
-    Marking::GreyToBlack<AccessMode::NON_ATOMIC>(mark_bit);
-    CHECK(Marking::IsBlack(mark_bit));
-    CHECK(Marking::IsBlackOrGrey(mark_bit));
-    CHECK(!Marking::IsImpossible(mark_bit));
-    Marking::MarkWhite(mark_bit);
-    CHECK(Marking::IsWhite(mark_bit));
-    CHECK(!Marking::IsImpossible(mark_bit));
+    MarkBit mark_bit = bitmap->MarkBitFromIndexForTesting(position[i]);
+    CHECK(!mark_bit.template Get<AccessMode::NON_ATOMIC>());
+    CHECK(mark_bit.template Set<AccessMode::NON_ATOMIC>());
+    CHECK(mark_bit.template Get<AccessMode::NON_ATOMIC>());
+    CHECK(mark_bit.Clear());
+    CHECK(!mark_bit.template Get<AccessMode::NON_ATOMIC>());
   }
 }
 
diff --git a/deps/v8/test/unittests/heap/marking-worklist-unittest.cc b/deps/v8/test/unittests/heap/marking-worklist-unittest.cc
index 45bbdad4be13da..fc45d75511fd47 100644
--- a/deps/v8/test/unittests/heap/marking-worklist-unittest.cc
+++ b/deps/v8/test/unittests/heap/marking-worklist-unittest.cc
@@ -21,13 +21,13 @@ using MarkingWorklistTest = TestWithContext;
 TEST_F(MarkingWorklistTest, PushPop) {
   MarkingWorklists holder;
   MarkingWorklists::Local worklists(&holder);
-  HeapObject pushed_object =
+  Tagged<HeapObject> pushed_object =
       HeapObject::cast(i_isolate()
                            ->roots_table()
                            .slot(RootIndex::kFirstStrongRoot)
                            .load(i_isolate()));
   worklists.Push(pushed_object);
-  HeapObject popped_object;
+  Tagged<HeapObject> popped_object;
   EXPECT_TRUE(worklists.Pop(&popped_object));
   EXPECT_EQ(popped_object, pushed_object);
 }
@@ -35,13 +35,13 @@ TEST_F(MarkingWorklistTest, PushPop) {
 TEST_F(MarkingWorklistTest, PushPopOnHold) {
   MarkingWorklists holder;
   MarkingWorklists::Local worklists(&holder);
-  HeapObject pushed_object =
+  Tagged<HeapObject> pushed_object =
       HeapObject::cast(i_isolate()
                            ->roots_table()
                            .slot(RootIndex::kFirstStrongRoot)
                            .load(i_isolate()));
   worklists.PushOnHold(pushed_object);
-  HeapObject popped_object;
+  Tagged<HeapObject> popped_object;
   EXPECT_TRUE(worklists.PopOnHold(&popped_object));
   EXPECT_EQ(popped_object, pushed_object);
 }
@@ -50,7 +50,7 @@ TEST_F(MarkingWorklistTest, MergeOnHold) {
   MarkingWorklists holder;
   MarkingWorklists::Local main_worklists(&holder);
   MarkingWorklists::Local worker_worklists(&holder);
-  HeapObject pushed_object =
+  Tagged<HeapObject> pushed_object =
       HeapObject::cast(i_isolate()
                            ->roots_table()
                            .slot(RootIndex::kFirstStrongRoot)
@@ -58,7 +58,7 @@ TEST_F(MarkingWorklistTest, MergeOnHold) {
   worker_worklists.PushOnHold(pushed_object);
   worker_worklists.Publish();
   main_worklists.MergeOnHold();
-  HeapObject popped_object;
+  Tagged<HeapObject> popped_object;
   EXPECT_TRUE(main_worklists.Pop(&popped_object));
   EXPECT_EQ(popped_object, pushed_object);
 }
@@ -67,14 +67,14 @@ TEST_F(MarkingWorklistTest, ShareWorkIfGlobalPoolIsEmpty) {
   MarkingWorklists holder;
   MarkingWorklists::Local main_worklists(&holder);
   MarkingWorklists::Local worker_worklists(&holder);
-  HeapObject pushed_object =
+  Tagged<HeapObject> pushed_object =
       HeapObject::cast(i_isolate()
                            ->roots_table()
                            .slot(RootIndex::kFirstStrongRoot)
                            .load(i_isolate()));
   main_worklists.Push(pushed_object);
   main_worklists.ShareWork();
-  HeapObject popped_object;
+  Tagged<HeapObject> popped_object;
   EXPECT_TRUE(worker_worklists.Pop(&popped_object));
   EXPECT_EQ(popped_object, pushed_object);
 }
@@ -84,7 +84,7 @@ TEST_F(MarkingWorklistTest, ContextWorklistsPushPop) {
   MarkingWorklists holder;
   holder.CreateContextWorklists({context});
   MarkingWorklists::Local worklists(&holder);
-  HeapObject pushed_object =
+  Tagged<HeapObject> pushed_object =
       HeapObject::cast(i_isolate()
                            ->roots_table()
                            .slot(RootIndex::kFirstStrongRoot)
@@ -92,7 +92,7 @@ TEST_F(MarkingWorklistTest, ContextWorklistsPushPop) {
   worklists.SwitchToContext(context);
   worklists.Push(pushed_object);
   worklists.SwitchToSharedForTesting();
-  HeapObject popped_object;
+  Tagged<HeapObject> popped_object;
   EXPECT_TRUE(worklists.Pop(&popped_object));
   EXPECT_EQ(popped_object, pushed_object);
   holder.ReleaseContextWorklists();
@@ -103,7 +103,7 @@ TEST_F(MarkingWorklistTest, ContextWorklistsEmpty) {
   MarkingWorklists holder;
   holder.CreateContextWorklists({context});
   MarkingWorklists::Local worklists(&holder);
-  HeapObject pushed_object =
+  Tagged<HeapObject> pushed_object =
       HeapObject::cast(i_isolate()
                            ->roots_table()
                            .slot(RootIndex::kFirstStrongRoot)
@@ -113,7 +113,7 @@ TEST_F(MarkingWorklistTest, ContextWorklistsEmpty) {
   EXPECT_FALSE(worklists.IsEmpty());
   worklists.SwitchToSharedForTesting();
   EXPECT_FALSE(worklists.IsEmpty());
-  HeapObject popped_object;
+  Tagged<HeapObject> popped_object;
   EXPECT_TRUE(worklists.Pop(&popped_object));
   EXPECT_EQ(popped_object, pushed_object);
   EXPECT_TRUE(worklists.IsEmpty());
@@ -127,7 +127,7 @@ TEST_F(MarkingWorklistTest, ContextWorklistCrossTask) {
   holder.CreateContextWorklists({context1, context2});
   MarkingWorklists::Local main_worklists(&holder);
   MarkingWorklists::Local worker_worklists(&holder);
-  HeapObject pushed_object =
+  Tagged<HeapObject> pushed_object =
       HeapObject::cast(i_isolate()
                            ->roots_table()
                            .slot(RootIndex::kFirstStrongRoot)
@@ -136,7 +136,7 @@ TEST_F(MarkingWorklistTest, ContextWorklistCrossTask) {
   main_worklists.Push(pushed_object);
   main_worklists.ShareWork();
   worker_worklists.SwitchToContext(context2);
-  HeapObject popped_object;
+  Tagged<HeapObject> popped_object;
   EXPECT_TRUE(worker_worklists.Pop(&popped_object));
   EXPECT_EQ(popped_object, pushed_object);
   EXPECT_EQ(context1, worker_worklists.Context());
diff --git a/deps/v8/test/unittests/heap/memory-reducer-unittest.cc b/deps/v8/test/unittests/heap/memory-reducer-unittest.cc
index 16023efaddf015..65ce065c160a6d 100644
--- a/deps/v8/test/unittests/heap/memory-reducer-unittest.cc
+++ b/deps/v8/test/unittests/heap/memory-reducer-unittest.cc
@@ -44,7 +44,6 @@ MemoryReducer::Event TimerEvent(double time_ms,
   return event;
 }
 
-
 MemoryReducer::Event TimerEventLowAllocationRate(double time_ms) {
   return TimerEvent(time_ms, true, true);
 }
@@ -142,7 +141,8 @@ TEST(MemoryReducer, FromDoneToWait) {
 TEST(MemoryReducer, FromWaitToWait) {
   if (!v8_flags.incremental_marking) return;
 
-  MemoryReducer::State state0(MemoryReducer::State::CreateWait(2, 1000.0, 1)),
+  MemoryReducer::State state0(MemoryReducer::State::CreateWait(
+      MemoryReducer::MaxNumberOfGCs() - 1, 1000.0, 1)),
       state1(MemoryReducer::State::CreateDone(1.0, 0));
 
   state1 = MemoryReducer::Step(state0, PossibleGarbageEvent(2000));
@@ -178,7 +178,8 @@ TEST(MemoryReducer, FromWaitToWait) {
   EXPECT_EQ(state0.started_gcs(), state1.started_gcs());
   EXPECT_EQ(2000, state1.last_gc_time_ms());
 
-  state0 = MemoryReducer::State::CreateWait(2, 1000.0, 0);
+  state0 = MemoryReducer::State::CreateWait(MemoryReducer::MaxNumberOfGCs() - 1,
+                                            1000.0, 0);
 
   state1 = MemoryReducer::Step(
       state0,
@@ -189,7 +190,8 @@ TEST(MemoryReducer, FromWaitToWait) {
   EXPECT_EQ(state0.started_gcs(), state1.started_gcs());
   EXPECT_EQ(state0.last_gc_time_ms(), state1.last_gc_time_ms());
 
-  state0 = MemoryReducer::State::CreateWait(2, 1000.0, 1);
+  state0 = MemoryReducer::State::CreateWait(MemoryReducer::MaxNumberOfGCs() - 1,
+                                            1000.0, 1);
   state1 = MemoryReducer::Step(state0, TimerEventHighAllocationRate(2000));
   EXPECT_EQ(MemoryReducer::kWait, state1.id());
   EXPECT_EQ(2000 + MemoryReducer::kLongDelayMs, state1.next_gc_start_ms());
@@ -219,24 +221,22 @@ TEST(MemoryReducer, FromWaitToRun) {
 
 TEST(MemoryReducer, FromWaitToDone) {
   if (!v8_flags.incremental_marking) return;
+  if (MemoryReducer::MaxNumberOfGCs() <= 1) return;
 
-  MemoryReducer::State state0(
-      MemoryReducer::State::CreateWait(MemoryReducer::kMaxNumberOfGCs, 0.0, 1)),
+  MemoryReducer::State state0(MemoryReducer::State::CreateWait(
+      MemoryReducer::MaxNumberOfGCs(), 0.0, 1)),
       state1(MemoryReducer::State::CreateDone(1.0, 0));
 
   state1 = MemoryReducer::Step(state0, TimerEventLowAllocationRate(2000));
   EXPECT_EQ(MemoryReducer::kDone, state1.id());
-  EXPECT_EQ(MemoryReducer::kMaxNumberOfGCs, state1.started_gcs());
   EXPECT_EQ(state0.last_gc_time_ms(), state1.last_gc_time_ms());
 
   state1 = MemoryReducer::Step(state0, TimerEventHighAllocationRate(2000));
   EXPECT_EQ(MemoryReducer::kDone, state1.id());
-  EXPECT_EQ(MemoryReducer::kMaxNumberOfGCs, state1.started_gcs());
   EXPECT_EQ(state0.last_gc_time_ms(), state1.last_gc_time_ms());
 
   state1 = MemoryReducer::Step(state0, TimerEventPendingGC(2000));
   EXPECT_EQ(MemoryReducer::kDone, state1.id());
-  EXPECT_EQ(MemoryReducer::kMaxNumberOfGCs, state1.started_gcs());
   EXPECT_EQ(state0.last_gc_time_ms(), state1.last_gc_time_ms());
 }
 
@@ -268,33 +268,34 @@ TEST(MemoryReducer, FromRunToRun) {
 TEST(MemoryReducer, FromRunToDone) {
   if (!v8_flags.incremental_marking) return;
 
-  MemoryReducer::State state0(MemoryReducer::State::CreateRun(2)),
-      state1(MemoryReducer::State::CreateDone(1.0, 0));
-
-  state1 = MemoryReducer::Step(state0, MarkCompactEventNoGarbageLeft(2000, 0));
+  const int started_gcs = MemoryReducer::MaxNumberOfGCs() > 1 ? 2 : 1;
+  MemoryReducer::State state0(MemoryReducer::State::CreateRun(started_gcs));
+  MemoryReducer::State state1 =
+      MemoryReducer::Step(state0, MarkCompactEventNoGarbageLeft(2000, 0));
   EXPECT_EQ(MemoryReducer::kDone, state1.id());
-  EXPECT_EQ(MemoryReducer::kMaxNumberOfGCs, state1.started_gcs());
   EXPECT_EQ(2000, state1.last_gc_time_ms());
 
-  state0 = MemoryReducer::State::CreateRun(MemoryReducer::kMaxNumberOfGCs);
+  state0 = MemoryReducer::State::CreateRun(MemoryReducer::MaxNumberOfGCs());
 
   state1 = MemoryReducer::Step(state0, MarkCompactEventGarbageLeft(2000, 0));
   EXPECT_EQ(MemoryReducer::kDone, state1.id());
-  EXPECT_EQ(state1.started_gcs(), state1.started_gcs());
 }
 
 
 TEST(MemoryReducer, FromRunToWait) {
   if (!v8_flags.incremental_marking) return;
+  if (MemoryReducer::MaxNumberOfGCs() <= 1) return;
 
   MemoryReducer::State state0(MemoryReducer::State::CreateRun(2)),
       state1(MemoryReducer::State::CreateDone(1.0, 0));
 
-  state1 = MemoryReducer::Step(state0, MarkCompactEventGarbageLeft(2000, 0));
-  EXPECT_EQ(MemoryReducer::kWait, state1.id());
-  EXPECT_EQ(2000 + MemoryReducer::kShortDelayMs, state1.next_gc_start_ms());
-  EXPECT_EQ(state0.started_gcs(), state1.started_gcs());
-  EXPECT_EQ(2000, state1.last_gc_time_ms());
+  if (MemoryReducer::MaxNumberOfGCs() > 2) {
+    state1 = MemoryReducer::Step(state0, MarkCompactEventGarbageLeft(2000, 0));
+    EXPECT_EQ(MemoryReducer::kWait, state1.id());
+    EXPECT_EQ(2000 + MemoryReducer::kShortDelayMs, state1.next_gc_start_ms());
+    EXPECT_EQ(state0.started_gcs(), state1.started_gcs());
+    EXPECT_EQ(2000, state1.last_gc_time_ms());
+  }
 
   state0 = MemoryReducer::State::CreateRun(1);
 
diff --git a/deps/v8/test/unittests/heap/page-promotion-unittest.cc b/deps/v8/test/unittests/heap/page-promotion-unittest.cc
index 515a6b98197815..eadccac2154e3d 100644
--- a/deps/v8/test/unittests/heap/page-promotion-unittest.cc
+++ b/deps/v8/test/unittests/heap/page-promotion-unittest.cc
@@ -17,11 +17,13 @@ namespace {
 
 class PagePromotionTest : public TestWithHeapInternalsAndContext {};
 
-Page* FindLastPageInNewSpace(const std::vector<Handle<FixedArray>>& handles) {
+Page* FindPageInNewSpace(const std::vector<Handle<FixedArray>>& handles) {
   for (auto rit = handles.rbegin(); rit != handles.rend(); ++rit) {
     // One deref gets the Handle, the second deref gets the FixedArray.
     Page* candidate = Page::FromHeapObject(**rit);
-    if (candidate->InNewSpace()) return candidate;
+    if (candidate->InNewSpace() &&
+        candidate->heap()->new_space()->IsPromotionCandidate(candidate))
+      return candidate;
   }
   return nullptr;
 }
@@ -51,12 +53,13 @@ TEST_F(PagePromotionTest, PagePromotion_NewToOld) {
 
     // Ensure that the new space is empty so that the page to be promoted
     // does not contain the age mark.
-    CollectGarbage(OLD_SPACE);
+    EmptyNewSpaceUsingGC();
 
     std::vector<Handle<FixedArray>> handles;
     SimulateFullSpace(heap->new_space(), &handles);
+    if (v8_flags.minor_ms) InvokeMinorGC();
     CHECK_GT(handles.size(), 0u);
-    Page* const to_be_promoted_page = FindLastPageInNewSpace(handles);
+    Page* const to_be_promoted_page = FindPageInNewSpace(handles);
     CHECK_NOT_NULL(to_be_promoted_page);
     CHECK(heap->new_space()->IsPromotionCandidate(to_be_promoted_page));
     // To perform a sanity check on live bytes we need to mark the heap.
@@ -65,14 +68,13 @@ TEST_F(PagePromotionTest, PagePromotion_NewToOld) {
     const int threshold_bytes = static_cast<int>(
         v8_flags.page_promotion_threshold *
         MemoryChunkLayout::AllocatableMemoryInDataPage() / 100);
-    CHECK_GE(heap->marking_state()->live_bytes(to_be_promoted_page),
-             threshold_bytes);
+    CHECK_GE(to_be_promoted_page->live_bytes(), threshold_bytes);
 
     // Actual checks: The page is in new space first, but is moved to old space
     // during a full GC.
     CHECK(heap->new_space()->ContainsSlow(to_be_promoted_page->address()));
     CHECK(!heap->old_space()->ContainsSlow(to_be_promoted_page->address()));
-    CollectGarbage(OLD_SPACE);
+    EmptyNewSpaceUsingGC();
     CHECK(!heap->new_space()->ContainsSlow(to_be_promoted_page->address()));
     CHECK(heap->old_space()->ContainsSlow(to_be_promoted_page->address()));
   }
diff --git a/deps/v8/test/unittests/heap/persistent-handles-unittest.cc b/deps/v8/test/unittests/heap/persistent-handles-unittest.cc
index 3e36461e81a175..bab9f436b0b883 100644
--- a/deps/v8/test/unittests/heap/persistent-handles-unittest.cc
+++ b/deps/v8/test/unittests/heap/persistent-handles-unittest.cc
@@ -117,7 +117,8 @@ class PersistentHandlesThread final : public v8::base::Thread {
  public:
   PersistentHandlesThread(Heap* heap, std::vector<Handle<HeapNumber>> handles,
                           std::unique_ptr<PersistentHandles> ph,
-                          HeapNumber number, base::Semaphore* sema_started,
+                          Tagged<HeapNumber> number,
+                          base::Semaphore* sema_started,
                           base::Semaphore* sema_gc_finished)
       : v8::base::Thread(base::Thread::Options("ThreadWithLocalHeap")),
         heap_(heap),
@@ -189,7 +190,7 @@ TEST_F(PersistentHandlesTest, CreatePersistentHandles) {
 
   sema_started.Wait();
 
-  CollectAllGarbage();
+  InvokeMajorGC();
   sema_gc_finished.Signal();
 
   thread->Join();
diff --git a/deps/v8/test/unittests/heap/progressbar-unittest.cc b/deps/v8/test/unittests/heap/progressbar-unittest.cc
index 57bc721602adf7..53a878c81ceeaa 100644
--- a/deps/v8/test/unittests/heap/progressbar-unittest.cc
+++ b/deps/v8/test/unittests/heap/progressbar-unittest.cc
@@ -10,20 +10,17 @@ namespace internal {
 
 TEST(ProgressBar, DefaultDisabled) {
   ProgressBar progress_bar;
-  progress_bar.Initialize();
   EXPECT_FALSE(progress_bar.IsEnabled());
 }
 
 TEST(ProgressBar, EnabledAfterExplicitEnable) {
   ProgressBar progress_bar;
-  progress_bar.Initialize();
   progress_bar.Enable();
   EXPECT_TRUE(progress_bar.IsEnabled());
 }
 
 TEST(ProgressBar, ZeroValueAfterEnable) {
   ProgressBar progress_bar;
-  progress_bar.Initialize();
   progress_bar.Enable();
   ASSERT_TRUE(progress_bar.IsEnabled());
   EXPECT_EQ(0u, progress_bar.Value());
@@ -31,7 +28,6 @@ TEST(ProgressBar, ZeroValueAfterEnable) {
 
 TEST(ProgressBar, TrySetValue) {
   ProgressBar progress_bar;
-  progress_bar.Initialize();
   progress_bar.Enable();
   ASSERT_TRUE(progress_bar.IsEnabled());
   EXPECT_TRUE(progress_bar.TrySetNewValue(0, 17));
@@ -40,7 +36,6 @@ TEST(ProgressBar, TrySetValue) {
 
 TEST(ProgressBar, MultipleTrySetValue) {
   ProgressBar progress_bar;
-  progress_bar.Initialize();
   progress_bar.Enable();
   ASSERT_TRUE(progress_bar.IsEnabled());
   EXPECT_TRUE(progress_bar.TrySetNewValue(0, 23));
@@ -51,14 +46,12 @@ TEST(ProgressBar, MultipleTrySetValue) {
 
 TEST(ProgressBar, ResetIfEnabledOnDisabled) {
   ProgressBar progress_bar;
-  progress_bar.Initialize();
   progress_bar.ResetIfEnabled();
   EXPECT_FALSE(progress_bar.IsEnabled());
 }
 
 TEST(ProgressBar, ResetIfEnabledOnEnabled) {
   ProgressBar progress_bar;
-  progress_bar.Initialize();
   progress_bar.Enable();
   ASSERT_TRUE(progress_bar.TrySetNewValue(0, 1));
   progress_bar.ResetIfEnabled();
@@ -70,7 +63,6 @@ TEST(ProgressBar, ResetIfEnabledOnEnabled) {
 
 TEST(ProgressBarDeathTest, DiesOnTrySetValueOnDisabled) {
   ProgressBar progress_bar;
-  progress_bar.Initialize();
   EXPECT_DEATH_IF_SUPPORTED(progress_bar.TrySetNewValue(0, 1), "");
 }
 
diff --git a/deps/v8/test/unittests/heap/shared-heap-unittest.cc b/deps/v8/test/unittests/heap/shared-heap-unittest.cc
index 8cd597a7fe94b4..014368e7b55748 100644
--- a/deps/v8/test/unittests/heap/shared-heap-unittest.cc
+++ b/deps/v8/test/unittests/heap/shared-heap-unittest.cc
@@ -2,9 +2,11 @@
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
+#include "src/base/optional.h"
 #include "src/base/platform/platform.h"
+#include "src/base/platform/semaphore.h"
 #include "src/heap/heap.h"
-#include "src/heap/parked-scope.h"
+#include "src/heap/parked-scope-inl.h"
 #include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
@@ -64,7 +66,7 @@ class SharedOldSpaceAllocationThread final : public ParkingThread {
                 10, AllocationType::kSharedOld);
           }
 
-          CollectGarbage(OLD_SPACE, client_isolate);
+          InvokeMajorGC(i_client_isolate);
 
           v8::platform::PumpMessageLoop(i::V8::GetCurrentPlatform(),
                                         client_isolate);
@@ -74,19 +76,19 @@ class SharedOldSpaceAllocationThread final : public ParkingThread {
 }  // namespace
 
 TEST_F(SharedHeapTest, ConcurrentAllocationInSharedOldSpace) {
-  std::vector<std::unique_ptr<SharedOldSpaceAllocationThread>> threads;
-  const int kThreads = 4;
-
-  ParkedScope parked(i_isolate()->main_thread_local_isolate());
-  for (int i = 0; i < kThreads; i++) {
-    auto thread = std::make_unique<SharedOldSpaceAllocationThread>();
-    CHECK(thread->Start());
-    threads.push_back(std::move(thread));
-  }
-
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  i_isolate()->main_thread_local_isolate()->BlockMainThreadWhileParked(
+      [](const ParkedScope& parked) {
+        std::vector<std::unique_ptr<SharedOldSpaceAllocationThread>> threads;
+        const int kThreads = 4;
+
+        for (int i = 0; i < kThreads; i++) {
+          auto thread = std::make_unique<SharedOldSpaceAllocationThread>();
+          CHECK(thread->Start());
+          threads.push_back(std::move(thread));
+        }
+
+        ParkingThread::ParkedJoinAll(parked, threads);
+      });
 }
 
 namespace {
@@ -111,7 +113,7 @@ class SharedLargeOldSpaceAllocationThread final : public ParkingThread {
             CHECK(MemoryChunk::FromHeapObject(*fixed_array)->IsLargePage());
           }
 
-          CollectGarbage(OLD_SPACE, client_isolate);
+          InvokeMajorGC(i_client_isolate);
 
           v8::platform::PumpMessageLoop(i::V8::GetCurrentPlatform(),
                                         client_isolate);
@@ -121,19 +123,20 @@ class SharedLargeOldSpaceAllocationThread final : public ParkingThread {
 }  // namespace
 
 TEST_F(SharedHeapTest, ConcurrentAllocationInSharedLargeOldSpace) {
-  std::vector<std::unique_ptr<SharedLargeOldSpaceAllocationThread>> threads;
-  const int kThreads = 4;
-
-  ParkedScope parked(i_isolate()->main_thread_local_isolate());
-  for (int i = 0; i < kThreads; i++) {
-    auto thread = std::make_unique<SharedLargeOldSpaceAllocationThread>();
-    CHECK(thread->Start());
-    threads.push_back(std::move(thread));
-  }
-
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  i_isolate()->main_thread_local_isolate()->BlockMainThreadWhileParked(
+      [](const ParkedScope& parked) {
+        std::vector<std::unique_ptr<SharedLargeOldSpaceAllocationThread>>
+            threads;
+        const int kThreads = 4;
+
+        for (int i = 0; i < kThreads; i++) {
+          auto thread = std::make_unique<SharedLargeOldSpaceAllocationThread>();
+          CHECK(thread->Start());
+          threads.push_back(std::move(thread));
+        }
+
+        ParkingThread::ParkedJoinAll(parked, threads);
+      });
 }
 
 namespace {
@@ -154,7 +157,7 @@ class SharedMapSpaceAllocationThread final : public ParkingThread {
                 TERMINAL_FAST_ELEMENTS_KIND, 0, AllocationType::kSharedMap);
           }
 
-          CollectGarbage(OLD_SPACE, client_isolate);
+          InvokeMajorGC(i_client_isolate);
 
           v8::platform::PumpMessageLoop(i::V8::GetCurrentPlatform(),
                                         client_isolate);
@@ -164,23 +167,23 @@ class SharedMapSpaceAllocationThread final : public ParkingThread {
 }  // namespace
 
 TEST_F(SharedHeapTest, ConcurrentAllocationInSharedMapSpace) {
-  std::vector<std::unique_ptr<SharedMapSpaceAllocationThread>> threads;
-  const int kThreads = 4;
-
-  ParkedScope parked(i_isolate()->main_thread_local_isolate());
-  for (int i = 0; i < kThreads; i++) {
-    auto thread = std::make_unique<SharedMapSpaceAllocationThread>();
-    CHECK(thread->Start());
-    threads.push_back(std::move(thread));
-  }
-
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  i_isolate()->main_thread_local_isolate()->BlockMainThreadWhileParked(
+      [](const ParkedScope& parked) {
+        std::vector<std::unique_ptr<SharedMapSpaceAllocationThread>> threads;
+        const int kThreads = 4;
+
+        for (int i = 0; i < kThreads; i++) {
+          auto thread = std::make_unique<SharedMapSpaceAllocationThread>();
+          CHECK(thread->Start());
+          threads.push_back(std::move(thread));
+        }
+
+        ParkingThread::ParkedJoinAll(parked, threads);
+      });
 }
 
 TEST_F(SharedHeapNoClientsTest, SharedCollectionWithoutClients) {
-  ::v8::internal::CollectGarbage(OLD_SPACE, shared_space_isolate());
+  ::v8::internal::InvokeMajorGC(i_shared_space_isolate());
 }
 
 void AllocateInSharedHeap(int iterations = 100) {
@@ -217,16 +220,16 @@ void AllocateInSharedHeap(int iterations = 100) {
     }
 
     for (int i = 0; i < kKeptAliveInHeap; i++) {
-      FixedArray array = FixedArray::cast(arrays_in_heap->get(i));
-      CHECK_EQ(array.length(), 100);
+      Tagged<FixedArray> array = FixedArray::cast(arrays_in_heap->get(i));
+      CHECK_EQ(array->length(), 100);
     }
   });
 }
 
 TEST_F(SharedHeapTest, SharedCollectionWithOneClient) {
   v8_flags.max_old_space_size = 8;
-  ParkedScope parked(i_isolate()->main_thread_local_isolate());
-  AllocateInSharedHeap();
+  i_isolate()->main_thread_local_isolate()->BlockMainThreadWhileParked(
+      []() { AllocateInSharedHeap(); });
 }
 
 namespace {
@@ -243,22 +246,379 @@ class SharedFixedArrayAllocationThread final : public ParkingThread {
 TEST_F(SharedHeapTest, SharedCollectionWithMultipleClients) {
   v8_flags.max_old_space_size = 8;
 
-  std::vector<std::unique_ptr<SharedFixedArrayAllocationThread>> threads;
-  const int kThreads = 4;
+  i_isolate()->main_thread_local_isolate()->BlockMainThreadWhileParked(
+      [](const ParkedScope& parked) {
+        std::vector<std::unique_ptr<SharedFixedArrayAllocationThread>> threads;
+        const int kThreads = 4;
+
+        for (int i = 0; i < kThreads; i++) {
+          auto thread = std::make_unique<SharedFixedArrayAllocationThread>();
+          CHECK(thread->Start());
+          threads.push_back(std::move(thread));
+        }
+
+        ParkingThread::ParkedJoinAll(parked, threads);
+      });
+}
+
+namespace {
+
+/**
+ * The following two classes implement a recurring pattern for testing the
+ * shared heap: two isolates (main and client), used respectively by the main
+ * thread and a concurrent thread, that execute arbitrary fragments of code
+ * (shown below in angular brackets) and synchronize in the following way
+ * using parked semaphores:
+ *
+ *      main thread                    concurrent thread
+ * ---------------------------------------------------------------
+ *        <SETUP>
+ *           |
+ *      start thread ----------\
+ *           |                  \---------> <SETUP>
+ *           |                                 |
+ *           |                  /-------- signal ready
+ *     wait for ready <--------/               |
+ *       <EXECUTE>                             |
+ *     signal execute ---------\               |
+ *           |                  \-----> wait for execute
+ *           |                             <EXECUTE>
+ *           |                  /------ signal complete
+ *    wait for complete <------/               |
+ *           |                                 |
+ *      <COMPLETE>                        <COMPLETE>
+ *           |                  /----------- exit
+ *      join thread <----------/
+ *      <TEARDOWN>
+ *
+ * Both threads allocate an arbitrary state object on their stack, which
+ * may contain information that is shared between the executed fragments
+ * of code.
+ */
+
+template <typename State>
+class ConcurrentThread final : public ParkingThread {
+ public:
+  using ThreadType = ConcurrentThread<State>;
+  using Callback = void(ThreadType*);
+
+  explicit ConcurrentThread(
+      bool wait_while_parked, v8::base::Semaphore* sema_ready = nullptr,
+      v8::base::Semaphore* sema_execute_start = nullptr,
+      v8::base::Semaphore* sema_execute_complete = nullptr)
+      : ParkingThread(Options("ConcurrentThread")),
+        sema_ready_(sema_ready),
+        sema_execute_start_(sema_execute_start),
+        sema_execute_complete_(sema_execute_complete),
+        wait_while_parked_(wait_while_parked) {}
+
+  void Run() override {
+    IsolateWrapper isolate_wrapper(kNoCounters);
+    i_client_isolate_ = isolate_wrapper.i_isolate();
+
+    // Allocate the state on the stack, so that handles, direct handles or raw
+    // pointers are stack-allocated.
+    State state;
+    state_ = &state;
+
+    if (setup_callback_) setup_callback_(this);
+
+    if (sema_ready_) sema_ready_->Signal();
+    if (sema_execute_start_) {
+      if (wait_while_parked_) {
+        // Park and wait.
+        i_client_isolate_->main_thread_local_isolate()
+            ->BlockMainThreadWhileParked(
+                [this]() { sema_execute_start_->Wait(); });
+      } else {
+        // Do not park, but enter a safepoint every now and then.
+        const auto timeout = base::TimeDelta::FromMilliseconds(100);
+        do {
+          i_client_isolate_->main_thread_local_isolate()->heap()->Safepoint();
+        } while (!sema_execute_start_->WaitFor(timeout));
+      }
+    }
+
+    if (execute_callback_) execute_callback_(this);
+
+    if (sema_execute_complete_) sema_execute_complete_->Signal();
+
+    if (complete_callback_) complete_callback_(this);
+
+    i_client_isolate_ = nullptr;
+    state_ = nullptr;
+  }
+
+  Isolate* i_client_isolate() const {
+    DCHECK_NOT_NULL(i_client_isolate_);
+    return i_client_isolate_;
+  }
+
+  v8::Isolate* client_isolate() const {
+    return reinterpret_cast<v8::Isolate*>(i_client_isolate_);
+  }
+
+  State* state() {
+    DCHECK_NOT_NULL(state_);
+    return state_;
+  }
+
+  void with_setup(Callback* callback) { setup_callback_ = callback; }
+  void with_execute(Callback* callback) { execute_callback_ = callback; }
+  void with_complete(Callback* callback) { complete_callback_ = callback; }
+
+ private:
+  Isolate* i_client_isolate_ = nullptr;
+  State* state_ = nullptr;
+  v8::base::Semaphore* sema_ready_ = nullptr;
+  v8::base::Semaphore* sema_execute_start_ = nullptr;
+  v8::base::Semaphore* sema_execute_complete_ = nullptr;
+  Callback* setup_callback_ = nullptr;
+  Callback* execute_callback_ = nullptr;
+  Callback* complete_callback_ = nullptr;
+  bool wait_while_parked_;
+};
+
+template <typename State, typename ThreadState, bool wait_while_parked>
+class SharedHeapTestBase : public TestJSSharedMemoryWithNativeContext {
+ public:
+  using TestType = SharedHeapTestBase<State, ThreadState, wait_while_parked>;
+  using Callback = void(TestType*);
+  using ThreadType = ConcurrentThread<ThreadState>;
+  using ThreadCallback = typename ThreadType::Callback;
+
+  SharedHeapTestBase()
+      : thread_(std::make_unique<ThreadType>(wait_while_parked, &sema_ready_,
+                                             &sema_execute_start_,
+                                             &sema_execute_complete_)) {}
+
+  void Interact() {
+    // Allocate the state on the stack, so that handles, direct handles or raw
+    // pointers are stack-allocated.
+    State state;
+    state_ = &state;
+
+    if (setup_callback_) setup_callback_(this);
+    CHECK(thread()->Start());
+    sema_ready_.Wait();
+    if (execute_callback_) execute_callback_(this);
+    sema_execute_start_.Signal();
+    sema_execute_complete_.Wait();
+    if (complete_callback_) complete_callback_(this);
+    thread()->ParkedJoin(i_isolate()->main_thread_local_isolate());
+    if (teardown_callback_) teardown_callback_(this);
+  }
+
+  ConcurrentThread<State>* thread() const {
+    DCHECK(thread_);
+    return thread_.get();
+  }
 
-  ParkedScope parked(i_isolate()->main_thread_local_isolate());
-  for (int i = 0; i < kThreads; i++) {
-    auto thread = std::make_unique<SharedFixedArrayAllocationThread>();
-    CHECK(thread->Start());
-    threads.push_back(std::move(thread));
+  State* state() {
+    DCHECK_NOT_NULL(state_);
+    return state_;
   }
 
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
+  void with_setup(Callback* callback) { setup_callback_ = callback; }
+  void with_execute(Callback* callback) { execute_callback_ = callback; }
+  void with_complete(Callback* callback) { complete_callback_ = callback; }
+  void with_teardown(Callback* callback) { teardown_callback_ = callback; }
+
+ private:
+  State* state_ = nullptr;
+  std::unique_ptr<ConcurrentThread<State>> thread_;
+  v8::base::Semaphore sema_ready_{0};
+  v8::base::Semaphore sema_execute_start_{0};
+  v8::base::Semaphore sema_execute_complete_{0};
+  Callback* setup_callback_ = nullptr;
+  Callback* execute_callback_ = nullptr;
+  Callback* complete_callback_ = nullptr;
+  Callback* teardown_callback_ = nullptr;
+};
+
+}  // namespace
+
+#define TEST_SCENARIO(test_class, test_method, test_name, allocation, space) \
+  TEST_F(test_class, test_name) {                                            \
+    test_method<test_class, allocation, space>(this);                        \
   }
+
+#define TEST_ALL_SCENARIA(test_class, test_prefix, test_method)    \
+  TEST_SCENARIO(test_class, test_method, test_prefix##YoungYoung,  \
+                AllocationType::kYoung, NEW_SPACE)                 \
+  TEST_SCENARIO(test_class, test_method, test_prefix##YoungOld,    \
+                AllocationType::kYoung, OLD_SPACE)                 \
+  TEST_SCENARIO(test_class, test_method, test_prefix##OldYoung,    \
+                AllocationType::kOld, NEW_SPACE)                   \
+  TEST_SCENARIO(test_class, test_method, test_prefix##OldOld,      \
+                AllocationType::kOld, OLD_SPACE)                   \
+  TEST_SCENARIO(test_class, test_method, test_prefix##SharedYoung, \
+                AllocationType::kSharedOld, NEW_SPACE)             \
+  TEST_SCENARIO(test_class, test_method, test_prefix##SharedOld,   \
+                AllocationType::kSharedOld, OLD_SPACE)
+
+namespace {
+
+// Testing the shared heap using ordinary (indirect) handles.
+
+struct StateWithHandle {
+  base::Optional<HandleScope> scope;
+  Handle<FixedArray> handle;
+  Global<v8::FixedArray> weak;
+};
+
+template <AllocationType allocation, AllocationSpace space, int size>
+void AllocateWithHandle(Isolate* isolate, StateWithHandle* state) {
+  // Install a handle scope.
+  state->scope.emplace(isolate);
+  // Allocate a fixed array, keep a handle and a weak reference.
+  state->handle = isolate->factory()->NewFixedArray(size, allocation);
+  Local<v8::FixedArray> l = Utils::FixedArrayToLocal(state->handle);
+  state->weak.Reset(reinterpret_cast<v8::Isolate*>(isolate), l);
+  state->weak.SetWeak();
+}
+
+using SharedHeapTestStateWithHandleParked =
+    SharedHeapTestBase<StateWithHandle, StateWithHandle, true>;
+using SharedHeapTestStateWithHandleUnparked =
+    SharedHeapTestBase<StateWithHandle, StateWithHandle, false>;
+
+void InvokeGC(AllocationSpace space, Isolate* isolate) {
+  space == NEW_SPACE ? InvokeMinorGC(isolate) : InvokeMajorGC(isolate);
+}
+
+template <typename TestType, AllocationType allocation, AllocationSpace space>
+void ToEachTheirOwnWithHandle(TestType* test) {
+  using ThreadType = typename TestType::ThreadType;
+  ThreadType* thread = test->thread();
+
+  // Install all the callbacks.
+  test->with_setup([](TestType* test) {
+    AllocateWithHandle<allocation, space, 10>(test->i_isolate(), test->state());
+  });
+
+  thread->with_setup([](ThreadType* thread) {
+    AllocateWithHandle<allocation, space, 20>(thread->i_client_isolate(),
+                                              thread->state());
+  });
+
+  test->with_execute(
+      [](TestType* test) { InvokeGC(space, test->i_isolate()); });
+
+  thread->with_execute(
+      [](ThreadType* thread) { InvokeGC(space, thread->i_client_isolate()); });
+
+  test->with_complete([](TestType* test) {
+    // The handle should keep the fixed array from being reclaimed.
+    EXPECT_FALSE(test->state()->weak.IsEmpty());
+  });
+
+  thread->with_complete([](ThreadType* thread) {
+    // The handle should keep the fixed array from being reclaimed.
+    EXPECT_FALSE(thread->state()->weak.IsEmpty());
+    thread->state()->scope.reset();  // Deallocate the handle scope.
+    InvokeGC(space, thread->i_client_isolate());
+  });
+
+  test->with_teardown([](TestType* test) {
+    test->state()->scope.reset();  // Deallocate the handle scope.
+    InvokeGC(space, test->i_isolate());
+  });
+
+  // Perform the test.
+  test->Interact();
 }
 
+}  // namespace
+
+TEST_ALL_SCENARIA(SharedHeapTestStateWithHandleParked, ToEachTheirOwn,
+                  ToEachTheirOwnWithHandle)
+TEST_ALL_SCENARIA(SharedHeapTestStateWithHandleUnparked, ToEachTheirOwn,
+                  ToEachTheirOwnWithHandle)
+
+#ifdef V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+
+namespace {
+
+// Testing the shared heap using raw pointers.
+// This works only with conservative stack scanning.
+
+struct StateWithRawPointer {
+  Address ptr;
+  Global<v8::FixedArray> weak;
+};
+
+template <AllocationType allocation, AllocationSpace space, int size>
+void AllocateWithRawPointer(Isolate* isolate, StateWithRawPointer* state) {
+  // Allocate a fixed array, keep a raw pointer and a weak reference.
+  HandleScope scope(isolate);
+  Handle<FixedArray> h = isolate->factory()->NewFixedArray(size, allocation);
+  state->ptr = (*h).ptr();
+  Local<v8::FixedArray> l = Utils::FixedArrayToLocal(h, isolate);
+  state->weak.Reset(reinterpret_cast<v8::Isolate*>(isolate), l);
+  state->weak.SetWeak();
+}
+
+using SharedHeapTestStateWithRawPointerParked =
+    SharedHeapTestBase<StateWithRawPointer, StateWithRawPointer, true>;
+using SharedHeapTestStateWithRawPointerUnparked =
+    SharedHeapTestBase<StateWithRawPointer, StateWithRawPointer, false>;
+
+template <typename TestType, AllocationType allocation, AllocationSpace space>
+void ToEachTheirOwnWithRawPointer(TestType* test) {
+  using ThreadType = typename TestType::ThreadType;
+  ThreadType* thread = test->thread();
+
+  // Install all the callbacks.
+  test->with_setup([](TestType* test) {
+    AllocateWithRawPointer<allocation, space, 10>(test->i_isolate(),
+                                                  test->state());
+  });
+
+  thread->with_setup([](ThreadType* thread) {
+    AllocateWithRawPointer<allocation, space, 20>(thread->i_client_isolate(),
+                                                  thread->state());
+  });
+
+  test->with_execute(
+      [](TestType* test) { InvokeGC(space, test->i_isolate()); });
+
+  thread->with_execute(
+      [](ThreadType* thread) { InvokeGC(space, thread->i_client_isolate()); });
+
+  test->with_complete([](TestType* test) {
+    // With conservative stack scanning, the raw pointer should keep the fixed
+    // array from being reclaimed.
+    EXPECT_FALSE(test->state()->weak.IsEmpty());
+  });
+
+  thread->with_complete([](ThreadType* thread) {
+    // With conservative stack scanning, the raw pointer should keep the fixed
+    // array from being reclaimed.
+    EXPECT_FALSE(thread->state()->weak.IsEmpty());
+    InvokeGC(space, thread->i_client_isolate());
+  });
+
+  test->with_teardown(
+      [](TestType* test) { InvokeGC(space, test->i_isolate()); });
+
+  // Perform the test.
+  test->Interact();
+}
+
+}  // namespace
+
+TEST_ALL_SCENARIA(SharedHeapTestStateWithRawPointerParked, ToEachTheirOwn,
+                  ToEachTheirOwnWithRawPointer)
+TEST_ALL_SCENARIA(SharedHeapTestStateWithRawPointerUnparked, ToEachTheirOwn,
+                  ToEachTheirOwnWithRawPointer)
+
+#endif  // V8_ENABLE_CONSERVATIVE_STACK_SCANNING
+
+#undef TEST_SCENARIO
+#undef TEST_ALL_SCENARIA
+
 }  // namespace internal
 }  // namespace v8
 
-#endif  // V8_CAN_CREATE_SHARED_HEAP
+#endif  // V8_CAN_CREATE_SHARED_HEAP_BOOL
diff --git a/deps/v8/test/unittests/heap/spaces-unittest.cc b/deps/v8/test/unittests/heap/spaces-unittest.cc
index 87b9dccf8064c0..47cfa34b444ce0 100644
--- a/deps/v8/test/unittests/heap/spaces-unittest.cc
+++ b/deps/v8/test/unittests/heap/spaces-unittest.cc
@@ -45,7 +45,7 @@ TEST_F(SpacesTest, CompactionSpaceMerge) {
   const int kExpectedPages =
       (kNumObjects + kNumObjectsPerPage - 1) / kNumObjectsPerPage;
   for (int i = 0; i < kNumObjects; i++) {
-    HeapObject object =
+    Tagged<HeapObject> object =
         compaction_space->AllocateRawUnaligned(kMaxRegularHeapObjectSize)
             .ToObjectChecked();
     heap->CreateFillerObjectAt(object.address(), kMaxRegularHeapObjectSize);
@@ -62,13 +62,13 @@ TEST_F(SpacesTest, CompactionSpaceMerge) {
 
 TEST_F(SpacesTest, WriteBarrierFromHeapObject) {
   constexpr Address address1 = Page::kPageSize;
-  HeapObject object1 = HeapObject::unchecked_cast(Object(address1));
+  Tagged<HeapObject> object1 = HeapObject::unchecked_cast(Object(address1));
   BasicMemoryChunk* chunk1 = BasicMemoryChunk::FromHeapObject(object1);
   heap_internals::MemoryChunk* slim_chunk1 =
       heap_internals::MemoryChunk::FromHeapObject(object1);
   EXPECT_EQ(static_cast<void*>(chunk1), static_cast<void*>(slim_chunk1));
   constexpr Address address2 = 2 * Page::kPageSize - 1;
-  HeapObject object2 = HeapObject::unchecked_cast(Object(address2));
+  Tagged<HeapObject> object2 = HeapObject::unchecked_cast(Object(address2));
   BasicMemoryChunk* chunk2 = BasicMemoryChunk::FromHeapObject(object2);
   heap_internals::MemoryChunk* slim_chunk2 =
       heap_internals::MemoryChunk::FromHeapObject(object2);
diff --git a/deps/v8/test/unittests/inspector/inspector-unittest.cc b/deps/v8/test/unittests/inspector/inspector-unittest.cc
index ec70f061c902fb..38e8f561babb53 100644
--- a/deps/v8/test/unittests/inspector/inspector-unittest.cc
+++ b/deps/v8/test/unittests/inspector/inspector-unittest.cc
@@ -300,14 +300,14 @@ TEST_F(InspectorTest, ApiCreatedTasksAreCleanedUp) {
     CHECK(!result.IsEmpty());
 
     // Run GC and check that the task is still here.
-    CollectAllGarbage();
+    InvokeMajorGC();
     CHECK_EQ(console->AllConsoleTasksForTest().size(), 1);
   }
 
   // Get rid of the task on the context, run GC and check we no longer have
   // the TaskInfo in the inspector.
   v8_context()->Global()->Delete(v8_context(), NewString("task")).Check();
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK_EQ(console->AllConsoleTasksForTest().size(), 0);
 }
 
diff --git a/deps/v8/test/unittests/interpreter/bytecode-array-builder-unittest.cc b/deps/v8/test/unittests/interpreter/bytecode-array-builder-unittest.cc
index ecd874ee5a2c8c..f0f19f5fb95fb2 100644
--- a/deps/v8/test/unittests/interpreter/bytecode-array-builder-unittest.cc
+++ b/deps/v8/test/unittests/interpreter/bytecode-array-builder-unittest.cc
@@ -274,7 +274,8 @@ TEST_F(BytecodeArrayBuilderTest, AllBytecodesGenerated) {
       .CompareNull();
 
   // Emit conversion operator invocations.
-  builder.ToNumber(1).ToNumeric(1).ToObject(reg).ToName(reg).ToString();
+  builder.ToNumber(1).ToNumeric(1).ToObject(reg).ToName().ToString().ToBoolean(
+      ToBooleanMode::kConvertToBoolean);
 
   // Emit GetSuperConstructor.
   builder.GetSuperConstructor(reg);
@@ -517,7 +518,7 @@ TEST_F(BytecodeArrayBuilderTest, FrameSizesLookGood) {
         builder.StoreAccumulatorInRegister(temp);
         // Ensure temporaries are used so not optimized away by the
         // register optimizer.
-        builder.ToName(temp);
+        builder.ToName().StoreAccumulatorInRegister(temp);
       }
       builder.Return();
 
@@ -572,7 +573,7 @@ TEST_F(BytecodeArrayBuilderTest, Constants) {
   ast_factory.Internalize(isolate());
   Handle<BytecodeArray> array = builder.ToBytecodeArray(isolate());
   // Should only have one entry for each identical constant.
-  EXPECT_EQ(4, array->constant_pool().length());
+  EXPECT_EQ(4, array->constant_pool()->length());
 }
 
 TEST_F(BytecodeArrayBuilderTest, ForwardJumps) {
diff --git a/deps/v8/test/unittests/interpreter/bytecode-array-iterator-unittest.cc b/deps/v8/test/unittests/interpreter/bytecode-array-iterator-unittest.cc
index a15594c8f11a96..1d876db11d141c 100644
--- a/deps/v8/test/unittests/interpreter/bytecode-array-iterator-unittest.cc
+++ b/deps/v8/test/unittests/interpreter/bytecode-array-iterator-unittest.cc
@@ -31,9 +31,9 @@ TEST_F(BytecodeArrayIteratorTest, IteratesBytecodeArray) {
                               HashSeed(isolate()));
   double heap_num_0 = 2.718;
   double heap_num_1 = 2.0 * Smi::kMaxValue;
-  Smi zero = Smi::zero();
-  Smi smi_0 = Smi::FromInt(64);
-  Smi smi_1 = Smi::FromInt(-65536);
+  Tagged<Smi> zero = Smi::zero();
+  Tagged<Smi> smi_0 = Smi::FromInt(64);
+  Tagged<Smi> smi_1 = Smi::FromInt(-65536);
   Register reg_0(0);
   Register reg_16(16);  // Something not eligible for short Star.
   RegisterList pair = BytecodeUtils::NewRegisterList(0, 2);
@@ -78,7 +78,7 @@ TEST_F(BytecodeArrayIteratorTest, IteratesBytecodeArray) {
   EXPECT_EQ(iterator.current_bytecode(), Bytecode::kLdaConstant);
   EXPECT_EQ(iterator.current_offset(), offset);
   EXPECT_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
-  EXPECT_EQ(iterator.GetConstantForIndexOperand(0, isolate())->Number(),
+  EXPECT_EQ(Object::Number(*iterator.GetConstantForIndexOperand(0, isolate())),
             heap_num_0);
   CHECK(!iterator.done());
   offset += Bytecodes::Size(Bytecode::kLdaConstant, OperandScale::kSingle);
@@ -94,7 +94,7 @@ TEST_F(BytecodeArrayIteratorTest, IteratesBytecodeArray) {
   EXPECT_EQ(iterator.current_bytecode(), Bytecode::kLdaConstant);
   EXPECT_EQ(iterator.current_offset(), offset);
   EXPECT_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
-  EXPECT_EQ(iterator.GetConstantForIndexOperand(0, isolate())->Number(),
+  EXPECT_EQ(Object::Number(*iterator.GetConstantForIndexOperand(0, isolate())),
             heap_num_1);
   CHECK(!iterator.done());
   offset += Bytecodes::Size(Bytecode::kLdaConstant, OperandScale::kSingle);
diff --git a/deps/v8/test/unittests/interpreter/bytecode-array-random-iterator-unittest.cc b/deps/v8/test/unittests/interpreter/bytecode-array-random-iterator-unittest.cc
index 77ecbb99ee79df..785cdc437089ab 100644
--- a/deps/v8/test/unittests/interpreter/bytecode-array-random-iterator-unittest.cc
+++ b/deps/v8/test/unittests/interpreter/bytecode-array-random-iterator-unittest.cc
@@ -31,9 +31,9 @@ TEST_F(BytecodeArrayRandomIteratorTest, InvalidBeforeStart) {
                               HashSeed(isolate()));
   double heap_num_0 = 2.718;
   double heap_num_1 = 2.0 * Smi::kMaxValue;
-  Smi zero = Smi::zero();
-  Smi smi_0 = Smi::FromInt(64);
-  Smi smi_1 = Smi::FromInt(-65536);
+  Tagged<Smi> zero = Smi::zero();
+  Tagged<Smi> smi_0 = Smi::FromInt(64);
+  Tagged<Smi> smi_1 = Smi::FromInt(-65536);
   Register reg_0(0);
   Register reg_1(1);
   RegisterList pair = BytecodeUtils::NewRegisterList(0, 2);
@@ -83,9 +83,9 @@ TEST_F(BytecodeArrayRandomIteratorTest, InvalidAfterEnd) {
                               HashSeed(isolate()));
   double heap_num_0 = 2.718;
   double heap_num_1 = 2.0 * Smi::kMaxValue;
-  Smi zero = Smi::zero();
-  Smi smi_0 = Smi::FromInt(64);
-  Smi smi_1 = Smi::FromInt(-65536);
+  Tagged<Smi> zero = Smi::zero();
+  Tagged<Smi> smi_0 = Smi::FromInt(64);
+  Tagged<Smi> smi_1 = Smi::FromInt(-65536);
   Register reg_0(0);
   Register reg_1(1);
   RegisterList pair = BytecodeUtils::NewRegisterList(0, 2);
@@ -135,9 +135,9 @@ TEST_F(BytecodeArrayRandomIteratorTest, AccessesFirst) {
                               HashSeed(isolate()));
   double heap_num_0 = 2.718;
   double heap_num_1 = 2.0 * Smi::kMaxValue;
-  Smi zero = Smi::zero();
-  Smi smi_0 = Smi::FromInt(64);
-  Smi smi_1 = Smi::FromInt(-65536);
+  Tagged<Smi> zero = Smi::zero();
+  Tagged<Smi> smi_0 = Smi::FromInt(64);
+  Tagged<Smi> smi_1 = Smi::FromInt(-65536);
   Register reg_0(0);
   Register reg_1(1);
   RegisterList pair = BytecodeUtils::NewRegisterList(0, 2);
@@ -178,7 +178,7 @@ TEST_F(BytecodeArrayRandomIteratorTest, AccessesFirst) {
   EXPECT_EQ(iterator.current_index(), 0);
   EXPECT_EQ(iterator.current_offset(), 0);
   EXPECT_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
-  EXPECT_EQ(iterator.GetConstantForIndexOperand(0, isolate())->Number(),
+  EXPECT_EQ(Object::Number(*iterator.GetConstantForIndexOperand(0, isolate())),
             heap_num_0);
   ASSERT_TRUE(iterator.IsValid());
 }
@@ -192,9 +192,9 @@ TEST_F(BytecodeArrayRandomIteratorTest, AccessesLast) {
                               HashSeed(isolate()));
   double heap_num_0 = 2.718;
   double heap_num_1 = 2.0 * Smi::kMaxValue;
-  Smi zero = Smi::zero();
-  Smi smi_0 = Smi::FromInt(64);
-  Smi smi_1 = Smi::FromInt(-65536);
+  Tagged<Smi> zero = Smi::zero();
+  Tagged<Smi> smi_0 = Smi::FromInt(64);
+  Tagged<Smi> smi_1 = Smi::FromInt(-65536);
   Register reg_0(0);
   Register reg_1(1);
   RegisterList pair = BytecodeUtils::NewRegisterList(0, 2);
@@ -249,9 +249,9 @@ TEST_F(BytecodeArrayRandomIteratorTest, RandomAccessValid) {
                               HashSeed(isolate()));
   double heap_num_0 = 2.718;
   double heap_num_1 = 2.0 * Smi::kMaxValue;
-  Smi zero = Smi::zero();
-  Smi smi_0 = Smi::FromInt(64);
-  Smi smi_1 = Smi::FromInt(-65536);
+  Tagged<Smi> zero = Smi::zero();
+  Tagged<Smi> smi_0 = Smi::FromInt(64);
+  Tagged<Smi> smi_1 = Smi::FromInt(-65536);
   Register reg_0(0);
   Register reg_16(16);  // Something not eligible for short Star.
   RegisterList pair = BytecodeUtils::NewRegisterList(0, 2);
@@ -320,7 +320,7 @@ TEST_F(BytecodeArrayRandomIteratorTest, RandomAccessValid) {
   EXPECT_EQ(iterator.current_index(), 2);
   EXPECT_EQ(iterator.current_offset(), offset);
   EXPECT_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
-  EXPECT_EQ(iterator.GetConstantForIndexOperand(0, isolate())->Number(),
+  EXPECT_EQ(Object::Number(*iterator.GetConstantForIndexOperand(0, isolate())),
             heap_num_1);
   ASSERT_TRUE(iterator.IsValid());
 
@@ -427,9 +427,9 @@ TEST_F(BytecodeArrayRandomIteratorTest, IteratesBytecodeArray) {
                               HashSeed(isolate()));
   double heap_num_0 = 2.718;
   double heap_num_1 = 2.0 * Smi::kMaxValue;
-  Smi zero = Smi::zero();
-  Smi smi_0 = Smi::FromInt(64);
-  Smi smi_1 = Smi::FromInt(-65536);
+  Tagged<Smi> zero = Smi::zero();
+  Tagged<Smi> smi_0 = Smi::FromInt(64);
+  Tagged<Smi> smi_1 = Smi::FromInt(-65536);
   Register reg_0(0);
   Register reg_16(16);  // Something not eligible for short Star.
   RegisterList pair = BytecodeUtils::NewRegisterList(0, 2);
@@ -472,7 +472,7 @@ TEST_F(BytecodeArrayRandomIteratorTest, IteratesBytecodeArray) {
   EXPECT_EQ(iterator.current_index(), 0);
   EXPECT_EQ(iterator.current_offset(), offset);
   EXPECT_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
-  EXPECT_EQ(iterator.GetConstantForIndexOperand(0, isolate())->Number(),
+  EXPECT_EQ(Object::Number(*iterator.GetConstantForIndexOperand(0, isolate())),
             heap_num_0);
   ASSERT_TRUE(iterator.IsValid());
   offset += Bytecodes::Size(Bytecode::kLdaConstant, OperandScale::kSingle);
@@ -490,7 +490,7 @@ TEST_F(BytecodeArrayRandomIteratorTest, IteratesBytecodeArray) {
   EXPECT_EQ(iterator.current_index(), 2);
   EXPECT_EQ(iterator.current_offset(), offset);
   EXPECT_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
-  EXPECT_EQ(iterator.GetConstantForIndexOperand(0, isolate())->Number(),
+  EXPECT_EQ(Object::Number(*iterator.GetConstantForIndexOperand(0, isolate())),
             heap_num_1);
   ASSERT_TRUE(iterator.IsValid());
   offset += Bytecodes::Size(Bytecode::kLdaConstant, OperandScale::kSingle);
@@ -680,9 +680,9 @@ TEST_F(BytecodeArrayRandomIteratorTest, IteratesBytecodeArrayBackwards) {
                               HashSeed(isolate()));
   double heap_num_0 = 2.718;
   double heap_num_1 = 2.0 * Smi::kMaxValue;
-  Smi zero = Smi::zero();
-  Smi smi_0 = Smi::FromInt(64);
-  Smi smi_1 = Smi::FromInt(-65536);
+  Tagged<Smi> zero = Smi::zero();
+  Tagged<Smi> smi_0 = Smi::FromInt(64);
+  Tagged<Smi> smi_1 = Smi::FromInt(-65536);
   Register reg_0(0);
   Register reg_16(16);  // Something not eligible for short Star.
   RegisterList pair = BytecodeUtils::NewRegisterList(0, 2);
@@ -902,7 +902,7 @@ TEST_F(BytecodeArrayRandomIteratorTest, IteratesBytecodeArrayBackwards) {
   EXPECT_EQ(iterator.current_index(), 2);
   EXPECT_EQ(iterator.current_offset(), offset);
   EXPECT_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
-  EXPECT_EQ(iterator.GetConstantForIndexOperand(0, isolate())->Number(),
+  EXPECT_EQ(Object::Number(*iterator.GetConstantForIndexOperand(0, isolate())),
             heap_num_1);
   ASSERT_TRUE(iterator.IsValid());
   --iterator;
@@ -920,7 +920,7 @@ TEST_F(BytecodeArrayRandomIteratorTest, IteratesBytecodeArrayBackwards) {
   EXPECT_EQ(iterator.current_index(), 0);
   EXPECT_EQ(iterator.current_offset(), offset);
   EXPECT_EQ(iterator.current_operand_scale(), OperandScale::kSingle);
-  EXPECT_EQ(iterator.GetConstantForIndexOperand(0, isolate())->Number(),
+  EXPECT_EQ(Object::Number(*iterator.GetConstantForIndexOperand(0, isolate())),
             heap_num_0);
   ASSERT_TRUE(iterator.IsValid());
   --iterator;
diff --git a/deps/v8/test/unittests/interpreter/bytecode-expectations-printer.cc b/deps/v8/test/unittests/interpreter/bytecode-expectations-printer.cc
index bec63500b30c1b..d67ed01459cda7 100644
--- a/deps/v8/test/unittests/interpreter/bytecode-expectations-printer.cc
+++ b/deps/v8/test/unittests/interpreter/bytecode-expectations-printer.cc
@@ -94,7 +94,7 @@ BytecodeExpectationsPrinter::GetBytecodeArrayForGlobal(
       i::Handle<i::JSFunction>::cast(v8::Utils::OpenHandle(*function));
 
   i::Handle<i::BytecodeArray> bytecodes = i::handle(
-      js_function->shared().GetBytecodeArray(i_isolate()), i_isolate());
+      js_function->shared()->GetBytecodeArray(i_isolate()), i_isolate());
 
   return bytecodes;
 }
@@ -105,7 +105,7 @@ BytecodeExpectationsPrinter::GetBytecodeArrayForModule(
   i::Handle<i::Module> i_module = v8::Utils::OpenHandle(*module);
   return i::handle(SharedFunctionInfo::cast(
                        Handle<i::SourceTextModule>::cast(i_module)->code())
-                       .GetBytecodeArray(i_isolate()),
+                       ->GetBytecodeArray(i_isolate()),
                    i_isolate());
 }
 
@@ -113,7 +113,7 @@ i::Handle<i::BytecodeArray>
 BytecodeExpectationsPrinter::GetBytecodeArrayForScript(
     v8::Local<v8::Script> script) const {
   i::Handle<i::JSFunction> js_function = v8::Utils::OpenHandle(*script);
-  return i::handle(js_function->shared().GetBytecodeArray(i_isolate()),
+  return i::handle(js_function->shared()->GetBytecodeArray(i_isolate()),
                    i_isolate());
 }
 
@@ -130,8 +130,8 @@ BytecodeExpectationsPrinter::GetBytecodeArrayOfCallee(
       v8::Utils::OpenHandle(*script->Run(context).ToLocalChecked());
   i::Handle<i::JSFunction> js_function =
       i::Handle<i::JSFunction>::cast(i_object);
-  CHECK(js_function->shared().HasBytecodeArray());
-  return i::handle(js_function->shared().GetBytecodeArray(i_isolate()),
+  CHECK(js_function->shared()->HasBytecodeArray());
+  return i::handle(js_function->shared()->GetBytecodeArray(i_isolate()),
                    i_isolate());
 }
 
@@ -284,28 +284,28 @@ void BytecodeExpectationsPrinter::PrintSourcePosition(
   }
 }
 
-void BytecodeExpectationsPrinter::PrintV8String(std::ostream* stream,
-                                                i::String string) const {
+void BytecodeExpectationsPrinter::PrintV8String(
+    std::ostream* stream, i::Tagged<i::String> string) const {
   *stream << '"';
-  for (int i = 0, length = string.length(); i < length; ++i) {
-    *stream << i::AsEscapedUC16ForJSON(string.Get(i));
+  for (int i = 0, length = string->length(); i < length; ++i) {
+    *stream << i::AsEscapedUC16ForJSON(string->Get(i));
   }
   *stream << '"';
 }
 
 void BytecodeExpectationsPrinter::PrintConstant(
     std::ostream* stream, i::Handle<i::Object> constant) const {
-  if (constant->IsSmi()) {
+  if (IsSmi(*constant)) {
     *stream << "Smi [";
-    i::Smi::cast(*constant).SmiPrint(*stream);
+    i::Smi::SmiPrint(i::Smi::cast(*constant), *stream);
     *stream << "]";
   } else {
-    *stream << i::HeapObject::cast(*constant).map().instance_type();
-    if (constant->IsHeapNumber()) {
+    *stream << i::HeapObject::cast(*constant)->map()->instance_type();
+    if (IsHeapNumber(*constant)) {
       *stream << " [";
-      i::HeapNumber::cast(*constant).HeapNumberShortPrint(*stream);
+      i::HeapNumber::cast(*constant)->HeapNumberShortPrint(*stream);
       *stream << "]";
-    } else if (constant->IsString()) {
+    } else if (IsString(*constant)) {
       *stream << " [";
       PrintV8String(stream, i::String::cast(*constant));
       *stream << "]";
@@ -341,9 +341,9 @@ void BytecodeExpectationsPrinter::PrintBytecodeSequence(
 }
 
 void BytecodeExpectationsPrinter::PrintConstantPool(
-    std::ostream* stream, i::FixedArray constant_pool) const {
+    std::ostream* stream, i::Tagged<i::FixedArray> constant_pool) const {
   *stream << "constant pool: [\n";
-  int num_constants = constant_pool.length();
+  int num_constants = constant_pool->length();
   if (num_constants > 0) {
     for (int i = 0; i < num_constants; ++i) {
       *stream << kIndent;
diff --git a/deps/v8/test/unittests/interpreter/bytecode-expectations-printer.h b/deps/v8/test/unittests/interpreter/bytecode-expectations-printer.h
index 7a77c772dbc606..8c8c44b0ba0bad 100644
--- a/deps/v8/test/unittests/interpreter/bytecode-expectations-printer.h
+++ b/deps/v8/test/unittests/interpreter/bytecode-expectations-printer.h
@@ -70,14 +70,14 @@ class BytecodeExpectationsPrinter final {
   void PrintSourcePosition(std::ostream* stream,
                            SourcePositionTableIterator* source_iterator,
                            int bytecode_offset) const;
-  void PrintV8String(std::ostream* stream, i::String string) const;
+  void PrintV8String(std::ostream* stream, i::Tagged<i::String> string) const;
   void PrintConstant(std::ostream* stream, i::Handle<i::Object> constant) const;
   void PrintFrameSize(std::ostream* stream,
                       i::Handle<i::BytecodeArray> bytecode_array) const;
   void PrintBytecodeSequence(std::ostream* stream,
                              i::Handle<i::BytecodeArray> bytecode_array) const;
   void PrintConstantPool(std::ostream* stream,
-                         i::FixedArray constant_pool) const;
+                         i::Tagged<i::FixedArray> constant_pool) const;
   void PrintCodeSnippet(std::ostream* stream, const std::string& body) const;
   void PrintBytecodeArray(std::ostream* stream,
                           i::Handle<i::BytecodeArray> bytecode_array) const;
diff --git a/deps/v8/test/unittests/interpreter/bytecode-generator-unittest.cc b/deps/v8/test/unittests/interpreter/bytecode-generator-unittest.cc
index eb855dd4d67a55..d807ebad1fd00b 100644
--- a/deps/v8/test/unittests/interpreter/bytecode-generator-unittest.cc
+++ b/deps/v8/test/unittests/interpreter/bytecode-generator-unittest.cc
@@ -29,6 +29,8 @@ class BytecodeGeneratorTest : public TestWithContext {
     TestWithContext::SetUpTestSuite();
   }
 
+  void SetUp() override { TestWithContext::SetUp(); }
+
   BytecodeExpectationsPrinter& printer() { return printer_; }
 
  private:
@@ -1120,6 +1122,40 @@ TEST_F(BytecodeGeneratorTest, CompareTypeOf) {
                      LoadGolden("CompareTypeOf.golden")));
 }
 
+TEST_F(BytecodeGeneratorTest, VariableWithHint) {
+  printer().set_wrap(false);
+  printer().set_test_function_name("test");
+
+  std::string snippets[] = {
+      "var test;\n"
+      "(function () {\n"
+      "    function foo() {\n"
+      "        let a = typeof('str'); if (a === 'string') {}\n"
+      "        let b = typeof('str'); if (b === 1) {}\n"
+      "        let c = typeof('str'); c = 1; if (c === 'string') {}\n"
+      "        let d = typeof('str');\n"
+      "        if (d === 'string' || d === 'number') {}\n"
+      "        let e = 'hello world';\n"
+      "        if (e == 'string' || e == 'number') {}\n"
+      "        let f = 'hi';\n"
+      "        for (let i = 0; i < 2; ++i) {\n"
+      "            if (f === 'hi') {}\n"
+      "        }\n"
+      "        let g = true;\n"
+      "        if (g === 's') {}\n"
+      "        let j = true;\n"
+      "        let k = j || 's';\n"
+      "        if (k === 's') {}\n"
+      "    }\n"
+      "    foo();\n"
+      "    test = foo;\n"
+      "})();\n",
+  };
+
+  CHECK(CompareTexts(BuildActual(printer(), snippets),
+                     LoadGolden("VariableWithHint.golden")));
+}
+
 TEST_F(BytecodeGeneratorTest, CompareBoolean) {
   std::string snippets[] = {
       "var a = 1;\n"
@@ -3204,6 +3240,136 @@ TEST_F(BytecodeGeneratorTest, ElideRedundantLoadOperationOfImmutableContext) {
       LoadGolden("ElideRedundantLoadOperationOfImmutableContext.golden")));
 }
 
+TEST_F(BytecodeGeneratorTest, ElideRedundantHoleChecks) {
+  printer().set_wrap(false);
+  printer().set_test_function_name("f");
+
+  // clang-format off
+  std::string snippets[] = {
+    // No control flow
+    "x; x;\n",
+
+    // 1-armed if
+    "if (x) { y; }\n"
+    "x + y;\n",
+
+    // 2-armed if
+    "if (a) { x; y; } else { x; z; }\n"
+    "x; y; z;\n",
+
+    // while
+    "while (x) { y; }\n"
+    "x; y;\n",
+
+    // do-while
+    "do { x; } while (y);\n"
+    "x; y;\n",
+
+    // do-while with break
+    "do { x; break; } while (y);\n"
+    "x; y;\n",
+
+    // C-style for
+    "for (x; y; z) { w; }\n"
+    "x; y; z; w;\n",
+
+    // for-in
+    "for (x in [y]) { z; }\n"
+    "x; y; z;\n",
+
+    // for-of
+    "for (x of [y]) { z; }\n"
+    "x; y; z;\n",
+
+    // try-catch
+    "try { x; } catch (y) { y; z; } finally { w; }\n"
+    "x; y; z; w;\n",
+
+    // destructuring init
+    "let { p = x } = { p: 42 }\n"
+    "x;\n",
+
+    // binary and
+    "let res = x && y && z\n"
+    "x; y; z;\n",
+
+    // binary or
+    "let res = x || y || z\n"
+    "x; y; z;\n",
+
+    // binary nullish
+    "let res = x ?? y ?? z\n"
+    "x; y; z;\n",
+
+    // optional chaining
+    "({p:42})?.[x]?.[x]?.[y];\n"
+    "x; y;\n",
+
+    // conditional and assignment
+    "x &&= y;\n"
+    "x; y;\n",
+
+    // conditional or assignment
+    "x ||= y;\n"
+    "x; y;\n",
+
+    // conditional nullish assignment
+    "x ??= y;\n"
+    "x; y;\n",
+
+    // switch
+    "switch (a) {\n"
+    "  case x: y; break;\n"
+    "  case 42: y; z;\n"
+    "  default: y; w;\n"
+    "}\n"
+    "x; y; z; w;\n",
+
+    // loathsome labeled breakable blocks
+    "lbl: {\n"
+    "  x;\n"
+    "  if (a) break lbl;\n"
+    "  y;\n"
+    "}\n"
+    "x; y;\n",
+
+    // unoffensive unlabeled blocks
+    "{\n"
+    "  x;\n"
+    "  y;\n"
+    "}\n"
+    "x; y;\n",
+
+    // try-catch
+    "try {\n"
+    "  x;\n"
+    "} catch (e) {}\n"
+    "x;\n",
+
+    // try-catch merge
+    "try {\n"
+    "  x;\n"
+    "} catch (e) { x; }\n"
+    "x;\n",
+
+    // try-finally
+    "try {\n"
+    "  x;\n"
+    "} finally { y; }\n"
+    "x; y;\n"
+  };
+  // clang-format on
+
+  CHECK(CompareTexts(BuildActual(printer(), snippets,
+                                 "{\n"
+                                 "  f = function f(a) {\n",
+                                 "  }\n"
+                                 "  let w, x, y, z;\n"
+                                 "  f();\n"
+                                 "}\n"),
+                     LoadGolden("ElideRedundantHoleChecks.golden")));
+}
+
 }  // namespace interpreter
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ArrayLiterals.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ArrayLiterals.golden
index c93d81af3084e4..ab2c1a3b69573c 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ArrayLiterals.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ArrayLiterals.golden
@@ -168,9 +168,9 @@ bytecodes: [
 constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
 ]
 handlers: [
 ]
@@ -196,7 +196,7 @@ bytecodes: [
 ]
 constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["length"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["length"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/AsyncGenerators.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/AsyncGenerators.golden
index de4576618d9c51..bcec596e23d1ee 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/AsyncGenerators.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/AsyncGenerators.golden
@@ -5,7 +5,6 @@
 ---
 wrap: no
 test function name: f
-async iteration: yes
 
 ---
 snippet: "
@@ -362,12 +361,12 @@ constant pool: [
   Smi [15],
   Smi [7],
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
   Smi [15],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   Smi [6],
   Smi [9],
   SCOPE_INFO_TYPE,
@@ -581,16 +580,16 @@ constant pool: [
   Smi [312],
   Smi [15],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["g"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["g"],
   SYMBOL_TYPE,
   SYMBOL_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
   Smi [11],
   Smi [66],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["throw"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["throw"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
   SCOPE_INFO_TYPE,
   Smi [334],
   Smi [6],
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/AsyncModules.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/AsyncModules.golden
index 3bc4300e0bb78e..00646ff40d1004 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/AsyncModules.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/AsyncModules.golden
@@ -140,7 +140,7 @@ constant pool: [
   Smi [71],
   Smi [10],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["foo"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["foo"],
   SCOPE_INFO_TYPE,
 ]
 handlers: [
@@ -295,7 +295,7 @@ constant pool: [
   Smi [81],
   Smi [10],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["goo"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["goo"],
   SCOPE_INFO_TYPE,
 ]
 handlers: [
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/CallAndSpread.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/CallAndSpread.golden
index cfcf6aa5f30e3d..1326f01971555c 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/CallAndSpread.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/CallAndSpread.golden
@@ -24,8 +24,8 @@ bytecodes: [
   /*   58 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["Math"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["max"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["Math"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["max"],
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
 ]
 handlers: [
@@ -52,8 +52,8 @@ bytecodes: [
   /*   61 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["Math"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["max"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["Math"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["max"],
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
 ]
 handlers: [
@@ -100,13 +100,13 @@ bytecodes: [
   /*   64 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["Math"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["max"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["Math"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["max"],
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/CallGlobal.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/CallGlobal.golden
index 853c191cafd06a..7b59b7790537ad 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/CallGlobal.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/CallGlobal.golden
@@ -22,7 +22,7 @@ bytecodes: [
   /*   43 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["t"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["t"],
 ]
 handlers: [
 ]
@@ -49,7 +49,7 @@ bytecodes: [
   /*   57 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["t"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["t"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/CallLookupSlot.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/CallLookupSlot.golden
index 4fd62de6bc81d4..4c1dcc766b6b80 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/CallLookupSlot.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/CallLookupSlot.golden
@@ -47,9 +47,9 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["g"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE [""],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["g"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE [""],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/CallNew.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/CallNew.golden
index d381f0790f2388..e4e637ba5b46ab 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/CallNew.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/CallNew.golden
@@ -22,7 +22,7 @@ bytecodes: [
   /*   67 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["bar"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["bar"],
 ]
 handlers: [
 ]
@@ -46,7 +46,7 @@ bytecodes: [
   /*   81 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["bar"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["bar"],
 ]
 handlers: [
 ]
@@ -79,7 +79,7 @@ bytecodes: [
   /*  129 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["bar"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["bar"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ClassAndSuperClass.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ClassAndSuperClass.golden
index 2e295ea67c6f94..70fb3603150571 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ClassAndSuperClass.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ClassAndSuperClass.golden
@@ -32,7 +32,7 @@ bytecodes: [
   /*  130 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["method"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["method"],
 ]
 handlers: [
 ]
@@ -69,7 +69,7 @@ bytecodes: [
   /*  158 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -89,7 +89,7 @@ snippet: "
 "
 frame size: 8
 parameter count: 1
-bytecode array length: 52
+bytecode array length: 48
 bytecodes: [
                 B(Mov), R(closure), R(1),
   /*  118 S> */ B(LdaSmi), I8(1),
@@ -107,16 +107,13 @@ bytecodes: [
                 B(Ldar), R(this),
                 B(ThrowSuperAlreadyCalledIfNotHole),
                 B(Mov), R(3), R(this),
-  /*  128 S> */ B(Ldar), R(this),
-                B(ThrowSuperNotCalledIfHole),
-                B(LdaSmi), I8(2),
+  /*  128 S> */ B(LdaSmi), I8(2),
   /*  136 E> */ B(SetNamedProperty), R(this), U8(0), U8(2),
                 B(Ldar), R(this),
-                B(ThrowSuperNotCalledIfHole),
   /*  141 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["y_"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y_"],
 ]
 handlers: [
 ]
@@ -136,7 +133,7 @@ snippet: "
 "
 frame size: 7
 parameter count: 1
-bytecode array length: 49
+bytecode array length: 45
 bytecodes: [
                 B(Mov), R(closure), R(1),
   /*  117 S> */ B(FindNonDefaultConstructorOrConstruct), R(1), R(0), R(5),
@@ -152,16 +149,13 @@ bytecodes: [
                 B(Ldar), R(this),
                 B(ThrowSuperAlreadyCalledIfNotHole),
                 B(Mov), R(3), R(this),
-  /*  126 S> */ B(Ldar), R(this),
-                B(ThrowSuperNotCalledIfHole),
-                B(LdaSmi), I8(2),
+  /*  126 S> */ B(LdaSmi), I8(2),
   /*  134 E> */ B(SetNamedProperty), R(this), U8(0), U8(2),
                 B(Ldar), R(this),
-                B(ThrowSuperNotCalledIfHole),
   /*  139 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["y_"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y_"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ClassDeclarations.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ClassDeclarations.golden
index f390a417a276fc..60b14fcb168bcc 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ClassDeclarations.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ClassDeclarations.golden
@@ -107,11 +107,13 @@ bytecodes: [
                 B(LdaConstant), U8(4),
                 B(Star4),
   /*   75 S> */ B(LdaImmutableContextSlot), R(2), U8(2), U8(0),
-                B(ToName), R(7),
+                B(ToName),
+                B(Star7),
                 B(CreateClosure), U8(6), U8(1), U8(2),
                 B(Star8),
   /*  106 S> */ B(LdaImmutableContextSlot), R(2), U8(3), U8(0),
-                B(ToName), R(9),
+                B(ToName),
+                B(Star9),
                 B(LdaConstant), U8(7),
                 B(TestEqualStrict), R(9), U8(0),
                 B(Mov), R(3), R(5),
@@ -127,13 +129,13 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["prototype"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["prototype"],
   SHARED_FUNCTION_INFO_TYPE,
 ]
 handlers: [
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/CompareBoolean.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/CompareBoolean.golden
index 7b3ce762645b47..6647ed9f5565cd 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/CompareBoolean.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/CompareBoolean.golden
@@ -369,7 +369,7 @@ bytecodes: [
   /*   70 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["false"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["false"],
 ]
 handlers: [
 ]
@@ -393,7 +393,7 @@ bytecodes: [
   /*   70 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["false"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["false"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/CompareTypeOf.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/CompareTypeOf.golden
index 9349f993dc9a30..0ebdc1a09b535f 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/CompareTypeOf.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/CompareTypeOf.golden
@@ -35,7 +35,7 @@ bytecodes: [
   /*   68 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["foo"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["foo"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/CompoundExpressions.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/CompoundExpressions.golden
index dda4470c8000f2..5231ae7a0cb408 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/CompoundExpressions.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/CompoundExpressions.golden
@@ -63,7 +63,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ConstVariable.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ConstVariable.golden
index 832cf1b5a13b02..2f430ac14319fd 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ConstVariable.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ConstVariable.golden
@@ -60,7 +60,7 @@ bytecodes: [
   /*   55 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ConstVariableContextSlot.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ConstVariableContextSlot.golden
index 44500fba9043be..8e5c9cc1003c1d 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ConstVariableContextSlot.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ConstVariableContextSlot.golden
@@ -74,7 +74,7 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ContextVariables.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ContextVariables.golden
index 043f005946aafa..adfbf08d8a914a 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ContextVariables.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ContextVariables.golden
@@ -912,7 +912,7 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/CountOperators.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/CountOperators.golden
index 0394579cb27461..3517b41504e5ba 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/CountOperators.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/CountOperators.golden
@@ -108,7 +108,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
 ]
 handlers: [
 ]
@@ -132,7 +132,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
 ]
 handlers: [
 ]
@@ -160,7 +160,7 @@ bytecodes: [
   /*   89 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["var"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["var"],
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
 ]
 handlers: [
@@ -187,7 +187,7 @@ bytecodes: [
   /*   89 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["var"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["var"],
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
 ]
 handlers: [
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/DeclareGlobals.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/DeclareGlobals.golden
index 8fcb7b4cc49e65..c26d9853d25cbd 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/DeclareGlobals.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/DeclareGlobals.golden
@@ -25,7 +25,7 @@ bytecodes: [
 ]
 constant pool: [
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -75,7 +75,7 @@ bytecodes: [
 ]
 constant pool: [
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -101,7 +101,7 @@ bytecodes: [
 ]
 constant pool: [
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/Delete.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/Delete.golden
index 183adb06d49c2f..3e6c5d6f697d0f 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/Delete.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/Delete.golden
@@ -21,7 +21,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -42,7 +42,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/DeleteLookupSlotInEval.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/DeleteLookupSlotInEval.golden
index af1c1806bd3ac2..9970011eba46cc 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/DeleteLookupSlotInEval.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/DeleteLookupSlotInEval.golden
@@ -28,7 +28,7 @@ bytecodes: [
   /*   25 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -77,7 +77,7 @@ bytecodes: [
   /*   31 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["z"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/DestructuringAssignment.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/DestructuringAssignment.golden
index bf6c4115021626..77935ca51c0c9c 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/DestructuringAssignment.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/DestructuringAssignment.golden
@@ -81,10 +81,10 @@ bytecodes: [
 ]
 constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [23, 60, 66],
@@ -200,10 +200,10 @@ bytecodes: [
 ]
 constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [23, 135, 141],
@@ -307,11 +307,11 @@ bytecodes: [
 ]
 constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["foo"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["foo"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [25, 106, 112],
@@ -336,7 +336,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -361,8 +361,8 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["y"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["foo"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["foo"],
 ]
 handlers: [
 ]
@@ -392,8 +392,8 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ElideRedundantHoleChecks.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ElideRedundantHoleChecks.golden
new file mode 100644
index 00000000000000..57dded900809bd
--- /dev/null
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ElideRedundantHoleChecks.golden
@@ -0,0 +1,1062 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+wrap: no
+test function name: f
+elide redundant tdz checks: yes
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  x; x;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 6
+bytecodes: [
+  /*   24 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   27 S> */ B(LdaUndefined),
+  /*   32 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  if (x) { y; }
+  x + y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 22
+bytecodes: [
+  /*   24 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(JumpIfToBooleanFalse), U8(6),
+  /*   33 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   38 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(Star0),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   42 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+  /*   40 E> */ B(Add), R(0), U8(0),
+                B(LdaUndefined),
+  /*   47 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  if (a) { x; y; } else { x; z; }
+  x; y; z;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 34
+bytecodes: [
+  /*   24 S> */ B(Ldar), R(arg0),
+                B(JumpIfToBooleanFalse), U8(12),
+  /*   33 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   36 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(Jump), U8(10),
+  /*   48 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   51 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(2),
+  /*   56 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   59 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   62 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(2),
+                B(LdaUndefined),
+  /*   67 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  while (x) { y; }
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 22
+bytecodes: [
+  /*   31 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(JumpIfToBooleanFalse), U8(10),
+  /*   36 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   24 E> */ B(JumpLoop), U8(10), I8(0), U8(0),
+  /*   41 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   44 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(LdaUndefined),
+  /*   49 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  do { x; } while (y);
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 20
+bytecodes: [
+  /*   29 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   41 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(JumpIfToBooleanFalse), U8(6),
+  /*   24 E> */ B(JumpLoop), U8(10), I8(0), U8(0),
+  /*   45 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   48 S> */ B(LdaUndefined),
+  /*   53 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  do { x; break; } while (y);
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 16
+bytecodes: [
+  /*   29 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   32 S> */ B(Jump), U8(2),
+  /*   52 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   55 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(LdaUndefined),
+  /*   60 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  for (x; y; z) { w; }
+  x; y; z; w;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 36
+bytecodes: [
+  /*   29 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   32 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(JumpIfToBooleanFalse), U8(14),
+  /*   40 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(2),
+  /*   35 S> */ B(LdaImmutableCurrentContextSlot), U8(5),
+                B(ThrowReferenceErrorIfHole), U8(3),
+  /*   24 E> */ B(JumpLoop), U8(14), I8(0), U8(0),
+  /*   45 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   48 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+  /*   51 S> */ B(LdaImmutableCurrentContextSlot), U8(5),
+                B(ThrowReferenceErrorIfHole), U8(3),
+  /*   54 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(2),
+                B(LdaUndefined),
+  /*   59 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["w"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  for (x in [y]) { z; }
+  x; y; z;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 6
+parameter count: 2
+bytecode array length: 72
+bytecodes: [
+  /*   34 S> */ B(CreateArrayLiteral), U8(0), U8(1), U8(37),
+                B(Star0),
+                B(LdaZero),
+                B(Star1),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   35 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+                B(StaInArrayLiteral), R(0), R(1), U8(2),
+                B(Ldar), R(0),
+                B(JumpIfUndefinedOrNull), U8(43),
+                B(ToObject), R(0),
+                B(ForInEnumerate), R(0),
+                B(ForInPrepare), R(1), U8(0),
+                B(LdaZero),
+                B(Star4),
+  /*   29 S> */ B(ForInContinue), R(4), R(3),
+                B(JumpIfFalse), U8(29),
+                B(ForInNext), R(0), R(4), R(1), U8(0),
+                B(JumpIfUndefined), U8(15),
+                B(Star5),
+                B(LdaCurrentContextSlot), U8(2),
+  /*   29 E> */ B(ThrowReferenceErrorIfHole), U8(2),
+                B(Ldar), R(5),
+                B(StaCurrentContextSlot), U8(2),
+  /*   41 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(3),
+                B(ForInStep), R(4),
+                B(Star4),
+  /*   24 E> */ B(JumpLoop), U8(28), I8(0), U8(4),
+  /*   46 S> */ B(LdaCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(2),
+  /*   49 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   52 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(3),
+                B(LdaUndefined),
+  /*   57 S> */ B(Return),
+]
+constant pool: [
+  ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  for (x of [y]) { z; }
+  x; y; z;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 9
+parameter count: 2
+bytecode array length: 145
+bytecodes: [
+  /*   34 S> */ B(CreateArrayLiteral), U8(0), U8(0), U8(37),
+                B(Star0),
+                B(LdaZero),
+                B(Star1),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   35 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+                B(StaInArrayLiteral), R(0), R(1), U8(1),
+                B(GetIterator), R(0), U8(3), U8(5),
+                B(Star1),
+                B(GetNamedProperty), R(1), U8(2), U8(7),
+                B(Star0),
+                B(LdaFalse),
+                B(Star2),
+                B(Mov), R(context), R(5),
+                B(LdaTrue),
+                B(Star2),
+  /*   29 S> */ B(CallProperty0), R(0), R(1), U8(9),
+                B(Star6),
+                B(JumpIfJSReceiver), U8(7),
+                B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(6), U8(1),
+                B(GetNamedProperty), R(6), U8(3), U8(11),
+                B(JumpIfToBooleanTrue), U8(25),
+                B(GetNamedProperty), R(6), U8(4), U8(13),
+                B(Star6),
+                B(LdaFalse),
+                B(Star2),
+                B(LdaCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(5),
+                B(Ldar), R(6),
+                B(StaCurrentContextSlot), U8(2),
+  /*   41 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(6),
+  /*   24 E> */ B(JumpLoop), U8(39), I8(0), U8(15),
+                B(LdaSmi), I8(-1),
+                B(Star4),
+                B(Star3),
+                B(Jump), U8(5),
+                B(Star4),
+                B(LdaZero),
+                B(Star3),
+                B(LdaTheHole),
+                B(SetPendingMessage),
+                B(Star5),
+                B(Ldar), R(2),
+                B(JumpIfToBooleanTrue), U8(35),
+                B(Mov), R(context), R(6),
+                B(GetNamedProperty), R(1), U8(7), U8(16),
+                B(JumpIfUndefinedOrNull), U8(26),
+                B(Star7),
+                B(CallProperty0), R(7), R(1), U8(18),
+                B(JumpIfJSReceiver), U8(19),
+                B(Star8),
+                B(CallRuntime), U16(Runtime::kThrowIteratorResultNotAnObject), R(8), U8(1),
+                B(Jump), U8(11),
+                B(Star6),
+                B(LdaZero),
+                B(TestReferenceEqual), R(3),
+                B(JumpIfTrue), U8(5),
+                B(Ldar), R(6),
+                B(ReThrow),
+                B(Ldar), R(5),
+                B(SetPendingMessage),
+                B(LdaZero),
+                B(TestReferenceEqual), R(3),
+                B(JumpIfFalse), U8(5),
+                B(Ldar), R(4),
+                B(ReThrow),
+  /*   46 S> */ B(LdaCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(5),
+  /*   49 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   52 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(6),
+                B(LdaUndefined),
+  /*   57 S> */ B(Return),
+]
+constant pool: [
+  ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
+]
+handlers: [
+  [30, 73, 79],
+  [92, 111, 113],
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  try { x; } catch (y) { y; z; } finally { w; }
+  x; y; z; w;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 5
+parameter count: 2
+bytecode array length: 74
+bytecodes: [
+                B(Mov), R(context), R(2),
+                B(Mov), R(context), R(3),
+  /*   30 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(Jump), U8(23),
+                B(Star4),
+                B(CreateCatchContext), R(4), U8(1),
+                B(Star3),
+                B(LdaTheHole),
+                B(SetPendingMessage),
+                B(Ldar), R(3),
+                B(PushContext), R(4),
+  /*   47 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   50 S> */ B(LdaImmutableContextSlot), R(4), U8(5), U8(0),
+                B(ThrowReferenceErrorIfHole), U8(2),
+                B(PopContext), R(4),
+                B(LdaSmi), I8(-1),
+                B(Star1),
+                B(Star0),
+                B(Jump), U8(5),
+                B(Star1),
+                B(LdaZero),
+                B(Star0),
+                B(LdaTheHole),
+                B(SetPendingMessage),
+                B(Star2),
+  /*   65 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(3),
+                B(Ldar), R(2),
+                B(SetPendingMessage),
+                B(LdaZero),
+                B(TestReferenceEqual), R(0),
+                B(JumpIfFalse), U8(5),
+                B(Ldar), R(1),
+                B(ReThrow),
+  /*   70 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   73 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(4),
+  /*   76 S> */ B(LdaImmutableCurrentContextSlot), U8(5),
+                B(ThrowReferenceErrorIfHole), U8(2),
+  /*   79 S> */ B(LdaUndefined),
+  /*   84 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  SCOPE_INFO_TYPE,
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["w"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+  [3, 33, 39],
+  [6, 10, 12],
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  let { p = x } = { p: 42 }
+  x;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 22
+bytecodes: [
+  /*   40 S> */ B(CreateObjectLiteral), U8(0), U8(0), U8(41),
+                B(Star1),
+  /*   30 E> */ B(GetNamedProperty), R(1), U8(1), U8(1),
+                B(JumpIfNotUndefined), U8(6),
+                B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   34 E> */ B(ThrowReferenceErrorIfHole), U8(2),
+                B(Star0),
+  /*   50 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(2),
+                B(LdaUndefined),
+  /*   55 S> */ B(Return),
+]
+constant pool: [
+  OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["p"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  let res = x && y && z
+  x; y; z;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 29
+bytecodes: [
+  /*   34 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(JumpIfToBooleanFalse), U8(12),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   39 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+                B(JumpIfToBooleanFalse), U8(6),
+                B(LdaImmutableCurrentContextSlot), U8(4),
+  /*   44 E> */ B(ThrowReferenceErrorIfHole), U8(2),
+                B(Star0),
+  /*   46 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   49 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   52 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(2),
+                B(LdaUndefined),
+  /*   57 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  let res = x || y || z
+  x; y; z;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 29
+bytecodes: [
+  /*   34 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(JumpIfToBooleanTrue), U8(12),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   39 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+                B(JumpIfToBooleanTrue), U8(6),
+                B(LdaImmutableCurrentContextSlot), U8(4),
+  /*   44 E> */ B(ThrowReferenceErrorIfHole), U8(2),
+                B(Star0),
+  /*   46 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   49 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   52 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(2),
+                B(LdaUndefined),
+  /*   57 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  let res = x ?? y ?? z
+  x; y; z;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 33
+bytecodes: [
+  /*   34 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(JumpIfUndefinedOrNull), U8(4),
+                B(Jump), U8(14),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   39 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+                B(JumpIfUndefinedOrNull), U8(4),
+                B(Jump), U8(6),
+                B(LdaImmutableCurrentContextSlot), U8(4),
+  /*   44 E> */ B(ThrowReferenceErrorIfHole), U8(2),
+                B(Star0),
+  /*   46 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   49 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   52 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(2),
+                B(LdaUndefined),
+  /*   57 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  ({p:42})?.[x]?.[x]?.[y];
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 45
+bytecodes: [
+  /*   24 S> */ B(CreateObjectLiteral), U8(0), U8(0), U8(41),
+                B(Star0),
+                B(JumpIfUndefinedOrNull), U8(29),
+                B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   35 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+  /*   34 E> */ B(GetKeyedProperty), R(0), U8(1),
+                B(Star0),
+                B(JumpIfUndefinedOrNull), U8(19),
+                B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   39 E> */ B(GetKeyedProperty), R(0), U8(3),
+                B(Star0),
+                B(JumpIfUndefinedOrNull), U8(11),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   45 E> */ B(ThrowReferenceErrorIfHole), U8(2),
+  /*   44 E> */ B(GetKeyedProperty), R(0), U8(5),
+                B(Jump), U8(3),
+                B(LdaUndefined),
+  /*   49 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   52 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(2),
+                B(LdaUndefined),
+  /*   57 S> */ B(Return),
+]
+constant pool: [
+  OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  x &&= y;
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 20
+bytecodes: [
+  /*   24 S> */ B(LdaCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(JumpIfToBooleanFalse), U8(8),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   30 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+  /*   26 E> */ B(StaCurrentContextSlot), U8(2),
+  /*   33 S> */ B(LdaCurrentContextSlot), U8(2),
+  /*   36 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(LdaUndefined),
+  /*   41 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  x ||= y;
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 20
+bytecodes: [
+  /*   24 S> */ B(LdaCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(JumpIfToBooleanTrue), U8(8),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   30 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+  /*   26 E> */ B(StaCurrentContextSlot), U8(2),
+  /*   33 S> */ B(LdaCurrentContextSlot), U8(2),
+  /*   36 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(LdaUndefined),
+  /*   41 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  x ??= y;
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 22
+bytecodes: [
+  /*   24 S> */ B(LdaCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(JumpIfUndefinedOrNull), U8(4),
+                B(Jump), U8(8),
+                B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   30 E> */ B(ThrowReferenceErrorIfHole), U8(1),
+  /*   26 E> */ B(StaCurrentContextSlot), U8(2),
+  /*   33 S> */ B(LdaCurrentContextSlot), U8(2),
+  /*   36 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(LdaUndefined),
+  /*   41 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  switch (a) {
+    case x: y; break;
+    case 42: y; z;
+    default: y; w;
+  }
+  x; y; z; w;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 1
+parameter count: 2
+bytecode array length: 57
+bytecodes: [
+  /*   24 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   44 E> */ B(ThrowReferenceErrorIfHole), U8(0),
+                B(TestEqualStrict), R(arg0), U8(0),
+                B(Mov), R(arg0), R(0),
+                B(JumpIfTrue), U8(11),
+                B(LdaSmi), I8(42),
+                B(TestEqualStrict), R(0), U8(0),
+                B(JumpIfTrue), U8(10),
+                B(Jump), U8(16),
+  /*   47 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   50 S> */ B(Jump), U8(18),
+  /*   68 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   71 S> */ B(LdaImmutableCurrentContextSlot), U8(5),
+                B(ThrowReferenceErrorIfHole), U8(2),
+  /*   85 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   88 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(3),
+  /*   93 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+  /*   96 S> */ B(LdaImmutableCurrentContextSlot), U8(4),
+  /*   99 S> */ B(LdaImmutableCurrentContextSlot), U8(5),
+                B(ThrowReferenceErrorIfHole), U8(2),
+  /*  102 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(3),
+                B(LdaUndefined),
+  /*  107 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["z"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["w"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  lbl: {
+    x;
+    if (a) break lbl;
+    y;
+  }
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 24
+bytecodes: [
+  /*   33 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   38 S> */ B(Ldar), R(arg0),
+                B(JumpIfToBooleanFalse), U8(4),
+  /*   45 S> */ B(Jump), U8(6),
+  /*   58 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   63 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   66 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(LdaUndefined),
+  /*   71 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  {
+    x;
+    y;
+  }
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 0
+parameter count: 2
+bytecode array length: 12
+bytecodes: [
+  /*   28 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   33 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+  /*   38 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+  /*   41 S> */ B(LdaUndefined),
+  /*   46 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  try {
+    x;
+  } catch (e) {}
+  x;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 28
+bytecodes: [
+                B(Mov), R(context), R(0),
+  /*   32 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(Jump), U8(15),
+                B(Star1),
+                B(CreateCatchContext), R(1), U8(1),
+                B(Star0),
+                B(LdaTheHole),
+                B(SetPendingMessage),
+                B(Ldar), R(0),
+                B(PushContext), R(1),
+                B(PopContext), R(1),
+  /*   50 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(LdaUndefined),
+  /*   55 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  SCOPE_INFO_TYPE,
+]
+handlers: [
+  [3, 7, 9],
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  try {
+    x;
+  } catch (e) { x; }
+  x;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 2
+parameter count: 2
+bytecode array length: 30
+bytecodes: [
+                B(Mov), R(context), R(0),
+  /*   32 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(Jump), U8(21),
+                B(Star1),
+                B(CreateCatchContext), R(1), U8(1),
+                B(Star0),
+                B(LdaTheHole),
+                B(SetPendingMessage),
+                B(Ldar), R(0),
+                B(PushContext), R(1),
+  /*   49 S> */ B(LdaImmutableContextSlot), R(1), U8(2), U8(0),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(PopContext), R(1),
+  /*   54 S> */ B(LdaUndefined),
+  /*   59 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  SCOPE_INFO_TYPE,
+]
+handlers: [
+  [3, 7, 9],
+]
+
+---
+snippet: "
+  {
+    f = function f(a) {
+  try {
+    x;
+  } finally { y; }
+  x; y;
+    }
+    let w, x, y, z;
+    f();
+  }
+"
+frame size: 3
+parameter count: 2
+bytecode array length: 40
+bytecodes: [
+                B(Mov), R(context), R(2),
+  /*   32 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+                B(LdaSmi), I8(-1),
+                B(Star1),
+                B(Star0),
+                B(Jump), U8(5),
+                B(Star1),
+                B(LdaZero),
+                B(Star0),
+                B(LdaTheHole),
+                B(SetPendingMessage),
+                B(Star2),
+  /*   47 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
+                B(ThrowReferenceErrorIfHole), U8(1),
+                B(Ldar), R(2),
+                B(SetPendingMessage),
+                B(LdaZero),
+                B(TestReferenceEqual), R(0),
+                B(JumpIfFalse), U8(5),
+                B(Ldar), R(1),
+                B(ReThrow),
+  /*   52 S> */ B(LdaImmutableCurrentContextSlot), U8(2),
+                B(ThrowReferenceErrorIfHole), U8(0),
+  /*   55 S> */ B(LdaUndefined),
+  /*   60 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+]
+handlers: [
+  [3, 7, 13],
+]
+
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ElideRedundantLoadOperationOfImmutableContext.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ElideRedundantLoadOperationOfImmutableContext.golden
index bfb6c09785eae1..0d9ee19ebaf950 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ElideRedundantLoadOperationOfImmutableContext.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ElideRedundantLoadOperationOfImmutableContext.golden
@@ -28,8 +28,8 @@ bytecodes: [
   /*   77 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["c"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["c"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/Eval.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/Eval.golden
index 20711395930d24..7f20bbf1fae258 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/Eval.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/Eval.golden
@@ -41,8 +41,8 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["1;"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["1;"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ForAwaitOf.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ForAwaitOf.golden
index c704c30e587c64..c576550f99172c 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ForAwaitOf.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ForAwaitOf.golden
@@ -5,7 +5,6 @@
 ---
 wrap: no
 test function name: f
-async iteration: yes
 
 ---
 snippet: "
@@ -145,10 +144,10 @@ constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
   SYMBOL_TYPE,
   SYMBOL_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   SCOPE_INFO_TYPE,
 ]
 handlers: [
@@ -301,10 +300,10 @@ constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
   SYMBOL_TYPE,
   SYMBOL_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   Smi [6],
   Smi [9],
   SCOPE_INFO_TYPE,
@@ -463,10 +462,10 @@ constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
   SYMBOL_TYPE,
   SYMBOL_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   SCOPE_INFO_TYPE,
 ]
 handlers: [
@@ -581,11 +580,11 @@ bytecodes: [
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   Smi [6],
   Smi [9],
   SCOPE_INFO_TYPE,
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ForIn.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ForIn.golden
index 4d49771b1d2cd3..f98d269d6d0ed5 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ForIn.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ForIn.golden
@@ -84,7 +84,7 @@ bytecodes: [
   /*   85 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["potatoes"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["potatoes"],
 ]
 handlers: [
 ]
@@ -178,7 +178,7 @@ bytecodes: [
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ForOf.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ForOf.golden
index cd5fc69be9bf5f..e1173746669bc3 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ForOf.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ForOf.golden
@@ -77,10 +77,10 @@ bytecodes: [
 ]
 constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [20, 59, 65],
@@ -163,11 +163,11 @@ bytecodes: [
   /*   85 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["potatoes"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["potatoes"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   Smi [6],
   Smi [9],
 ]
@@ -258,10 +258,10 @@ bytecodes: [
 ]
 constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [20, 75, 81],
@@ -349,11 +349,11 @@ bytecodes: [
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   Smi [6],
   Smi [9],
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ForOfLoop.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ForOfLoop.golden
index 0f801aa51681fe..bf4c54a8b8cf99 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ForOfLoop.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ForOfLoop.golden
@@ -79,10 +79,10 @@ bytecodes: [
   /*   54 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [15, 57, 63],
@@ -201,13 +201,13 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["1"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["1"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [47, 132, 138],
@@ -294,12 +294,12 @@ bytecodes: [
   /*   73 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
   SCOPE_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [15, 70, 76],
@@ -383,12 +383,12 @@ bytecodes: [
   /*   65 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["y"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [15, 65, 71],
@@ -485,10 +485,10 @@ constant pool: [
   Smi [20],
   Smi [10],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
 ]
 handlers: [
   [54, 96, 102],
@@ -601,12 +601,12 @@ constant pool: [
   Smi [98],
   Smi [10],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
   Smi [15],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   Smi [6],
   Smi [9],
 ]
@@ -708,10 +708,10 @@ bytecodes: [
                 B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   SCOPE_INFO_TYPE,
 ]
 handlers: [
@@ -827,10 +827,10 @@ bytecodes: [
 ]
 constant pool: [
   Smi [81],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   SCOPE_INFO_TYPE,
 ]
 handlers: [
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/Generators.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/Generators.golden
index a02df0f5729525..a59739552e942b 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/Generators.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/Generators.golden
@@ -198,12 +198,12 @@ constant pool: [
   Smi [10],
   Smi [7],
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
   Smi [15],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
   Smi [6],
   Smi [9],
 ]
@@ -300,14 +300,14 @@ constant pool: [
   Smi [152],
   Smi [10],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["g"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["g"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
   Smi [11],
   Smi [28],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["return"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["throw"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["return"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["throw"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalCompoundExpressions.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalCompoundExpressions.golden
index 58b558db64ff8b..9aede36f604c37 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalCompoundExpressions.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalCompoundExpressions.golden
@@ -24,7 +24,7 @@ bytecodes: [
   /*   50 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["global"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["global"],
 ]
 handlers: [
 ]
@@ -47,7 +47,7 @@ bytecodes: [
   /*   56 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["unallocated"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["unallocated"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalCountOperators.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalCountOperators.golden
index fcb80b2e669c34..adb0ff4cc802bb 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalCountOperators.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalCountOperators.golden
@@ -24,7 +24,7 @@ bytecodes: [
   /*   47 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["global"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["global"],
 ]
 handlers: [
 ]
@@ -49,7 +49,7 @@ bytecodes: [
   /*   47 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["global"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["global"],
 ]
 handlers: [
 ]
@@ -72,7 +72,7 @@ bytecodes: [
   /*   67 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["unallocated"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["unallocated"],
 ]
 handlers: [
 ]
@@ -97,7 +97,7 @@ bytecodes: [
   /*   53 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["unallocated"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["unallocated"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalDelete.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalDelete.golden
index 21dbc7e740bc2d..f468a0e388cbff 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalDelete.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/GlobalDelete.golden
@@ -25,8 +25,8 @@ bytecodes: [
   /*   57 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -51,7 +51,7 @@ bytecodes: [
   /*   70 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -74,7 +74,7 @@ bytecodes: [
   /*   55 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -97,7 +97,7 @@ bytecodes: [
   /*   41 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/IIFE.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/IIFE.golden
index 915158b47a8f74..73a0f93c0fdba3 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/IIFE.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/IIFE.golden
@@ -40,10 +40,10 @@ bytecodes: [
   /*  105 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["l"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["callee"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["l"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["callee"],
 ]
 handlers: [
 ]
@@ -96,10 +96,10 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["l"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["callee"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["l"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["callee"],
 ]
 handlers: [
 ]
@@ -185,13 +185,13 @@ bytecodes: [
   /*  423 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f0"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f1"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f2"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f3"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f4"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f5"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["callee"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f0"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f1"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f2"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f3"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f4"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f5"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["callee"],
 ]
 handlers: [
 ]
@@ -274,13 +274,13 @@ bytecodes: [
   /*  345 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f0"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f1"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f2"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f3"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f4"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f5"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["callee"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f0"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f1"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f2"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f3"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f4"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f5"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["callee"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/LetVariable.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/LetVariable.golden
index 808158d3477123..e2e35bf2f5a2ad 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/LetVariable.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/LetVariable.golden
@@ -59,7 +59,7 @@ bytecodes: [
   /*   52 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/LetVariableContextSlot.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/LetVariableContextSlot.golden
index 81440404f79dd1..f154cb7631ae9d 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/LetVariableContextSlot.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/LetVariableContextSlot.golden
@@ -75,7 +75,7 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/LoadGlobal.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/LoadGlobal.golden
index cd9d77d4215019..8a5e1eeb8c969d 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/LoadGlobal.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/LoadGlobal.golden
@@ -20,7 +20,7 @@ bytecodes: [
   /*   35 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -39,7 +39,7 @@ bytecodes: [
   /*   41 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["t"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["t"],
 ]
 handlers: [
 ]
@@ -58,7 +58,7 @@ bytecodes: [
   /*   31 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -338,135 +338,135 @@ bytecodes: [
   /* 1712 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name512"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name513"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name514"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name515"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name516"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name517"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name518"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name519"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name520"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name521"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name522"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name523"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name524"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name525"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name526"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name527"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name528"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name529"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name530"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name531"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name532"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name533"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name534"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name535"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name536"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name537"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name538"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name539"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name540"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name541"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name542"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name543"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name544"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name545"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name546"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name547"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name548"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name549"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name550"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name551"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name552"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name553"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name554"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name555"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name556"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name557"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name558"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name559"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name560"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name561"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name562"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name563"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name564"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name565"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name566"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name567"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name568"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name569"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name570"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name571"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name572"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name573"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name574"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name575"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name576"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name577"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name578"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name579"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name580"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name581"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name582"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name583"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name584"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name585"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name586"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name587"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name588"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name589"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name590"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name591"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name592"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name593"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name594"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name595"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name596"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name597"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name598"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name599"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name600"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name601"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name602"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name603"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name604"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name605"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name606"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name607"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name608"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name609"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name610"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name611"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name612"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name613"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name614"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name615"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name616"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name617"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name618"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name619"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name620"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name621"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name622"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name623"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name624"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name625"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name626"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name627"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name628"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name629"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name630"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name631"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name632"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name633"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name634"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name635"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name636"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name637"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name638"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name639"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name512"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name513"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name514"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name515"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name516"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name517"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name518"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name519"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name520"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name521"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name522"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name523"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name524"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name525"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name526"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name527"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name528"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name529"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name530"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name531"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name532"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name533"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name534"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name535"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name536"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name537"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name538"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name539"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name540"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name541"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name542"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name543"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name544"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name545"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name546"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name547"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name548"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name549"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name550"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name551"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name552"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name553"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name554"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name555"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name556"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name557"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name558"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name559"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name560"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name561"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name562"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name563"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name564"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name565"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name566"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name567"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name568"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name569"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name570"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name571"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name572"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name573"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name574"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name575"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name576"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name577"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name578"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name579"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name580"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name581"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name582"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name583"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name584"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name585"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name586"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name587"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name588"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name589"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name590"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name591"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name592"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name593"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name594"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name595"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name596"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name597"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name598"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name599"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name600"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name601"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name602"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name603"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name604"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name605"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name606"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name607"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name608"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name609"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name610"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name611"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name612"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name613"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name614"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name615"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name616"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name617"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name618"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name619"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name620"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name621"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name622"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name623"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name624"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name625"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name626"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name627"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name628"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name629"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name630"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name631"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name632"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name633"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name634"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name635"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name636"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name637"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name638"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name639"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/LookupSlot.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/LookupSlot.golden
index ada867aafa8c36..2c45c2c1511e4a 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/LookupSlot.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/LookupSlot.golden
@@ -43,9 +43,9 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["var x = 10;"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["var x = 10;"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -88,9 +88,9 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["var x = 10;"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["var x = 10;"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -133,9 +133,9 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE [""],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE [""],
 ]
 handlers: [
 ]
@@ -182,9 +182,9 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["var x = 10"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["var x = 10"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -231,9 +231,9 @@ bytecodes: [
 ]
 constant pool: [
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["var x = 10"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["var x = 10"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/LookupSlotInEval.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/LookupSlotInEval.golden
index f8b66ce3d268f0..0dabf3c4cc6f0f 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/LookupSlotInEval.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/LookupSlotInEval.golden
@@ -23,7 +23,7 @@ bytecodes: [
   /*   24 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -47,7 +47,7 @@ bytecodes: [
   /*   23 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -71,7 +71,7 @@ bytecodes: [
   /*   37 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
@@ -94,7 +94,7 @@ bytecodes: [
   /*   31 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/Modules.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/Modules.golden
index 4ba67813575b4d..7dbb11893bfa6f 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/Modules.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/Modules.golden
@@ -83,7 +83,7 @@ snippet: "
 "
 frame size: 5
 parameter count: 1
-bytecode array length: 69
+bytecode array length: 67
 bytecodes: [
                 B(SwitchOnGeneratorState), R(0), U8(0), U8(1),
                 B(Mov), R(closure), R(3),
@@ -108,7 +108,6 @@ bytecodes: [
   /*   47 S> */ B(LdaUndefined),
                 B(Star2),
   /*   52 S> */ B(LdaModuleVariable), I8(-1), U8(0),
-                B(ThrowReferenceErrorIfHole), U8(3),
                 B(Star3),
                 B(LdaSmi), I8(42),
                 B(Star4),
@@ -120,7 +119,7 @@ constant pool: [
   Smi [20],
   Smi [10],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["goo"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["goo"],
 ]
 handlers: [
 ]
@@ -484,8 +483,8 @@ constant pool: [
   Smi [30],
   Smi [10],
   Smi [7],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["f"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["f"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/NewAndSpread.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/NewAndSpread.golden
index 46a4f12b03cc4b..ef1fe6412b92c7 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/NewAndSpread.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/NewAndSpread.golden
@@ -137,9 +137,9 @@ constant pool: [
   SHARED_FUNCTION_INFO_TYPE,
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/ObjectLiterals.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/ObjectLiterals.golden
index fe3dd9a4d6e4ce..fd455cd99c32a8 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/ObjectLiterals.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/ObjectLiterals.golden
@@ -57,7 +57,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
 ]
 handlers: [
 ]
@@ -82,7 +82,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
 ]
 handlers: [
 ]
@@ -105,7 +105,7 @@ bytecodes: [
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["func"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["func"],
 ]
 handlers: [
 ]
@@ -128,7 +128,7 @@ bytecodes: [
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["func"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["func"],
 ]
 handlers: [
 ]
@@ -158,7 +158,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
   SHARED_FUNCTION_INFO_TYPE,
 ]
 handlers: [
@@ -189,7 +189,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
@@ -221,7 +221,7 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
   SHARED_FUNCTION_INFO_TYPE,
 ]
 handlers: [
@@ -282,14 +282,15 @@ bytecodes: [
   /*   50 S> */ B(CreateObjectLiteral), U8(1), U8(0), U8(41),
                 B(Star1),
                 B(Ldar), R(0),
-  /*   60 E> */ B(ToName), R(2),
+  /*   60 E> */ B(ToName),
+                B(Star2),
                 B(LdaSmi), I8(1),
   /*   64 E> */ B(DefineKeyedOwnPropertyInLiteral), R(1), R(2), U8(0), U8(1),
                 B(Ldar), R(1),
   /*   68 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["test"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["test"],
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
 ]
 handlers: [
@@ -310,16 +311,17 @@ bytecodes: [
                 B(Ldar), R(0),
   /*   64 E> */ B(DefineNamedOwnProperty), R(1), U8(2), U8(1),
                 B(Ldar), R(0),
-  /*   68 E> */ B(ToName), R(2),
+  /*   68 E> */ B(ToName),
+                B(Star2),
                 B(LdaSmi), I8(1),
   /*   72 E> */ B(DefineKeyedOwnPropertyInLiteral), R(1), R(2), U8(0), U8(3),
                 B(Ldar), R(1),
   /*   76 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["test"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["test"],
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
 ]
 handlers: [
 ]
@@ -337,7 +339,8 @@ bytecodes: [
   /*   50 S> */ B(CreateObjectLiteral), U8(1), U8(0), U8(41),
                 B(Star1),
                 B(Ldar), R(0),
-  /*   60 E> */ B(ToName), R(2),
+  /*   60 E> */ B(ToName),
+                B(Star2),
                 B(LdaSmi), I8(1),
   /*   64 E> */ B(DefineKeyedOwnPropertyInLiteral), R(1), R(2), U8(0), U8(1),
   /*   78 E> */ B(CreateEmptyObjectLiteral),
@@ -348,7 +351,7 @@ bytecodes: [
   /*   83 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["test"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["test"],
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
 ]
 handlers: [
@@ -367,7 +370,8 @@ bytecodes: [
   /*   50 S> */ B(CreateObjectLiteral), U8(1), U8(0), U8(41),
                 B(Star1),
                 B(Ldar), R(0),
-  /*   60 E> */ B(ToName), R(2),
+  /*   60 E> */ B(ToName),
+                B(Star2),
                 B(LdaConstant), U8(2),
   /*   64 E> */ B(DefineKeyedOwnPropertyInLiteral), R(1), R(2), U8(0), U8(1),
                 B(LdaConstant), U8(3),
@@ -389,10 +393,10 @@ bytecodes: [
   /*   98 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateAccessorAccess.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateAccessorAccess.golden
index 3594623033d02b..3e1348046a8ba9 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateAccessorAccess.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateAccessorAccess.golden
@@ -83,7 +83,7 @@ bytecodes: [
   /*   48 E> */ B(DefineKeyedOwnProperty), R(this), R(0), U8(0), U8(0),
   /*   53 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
   /*   58 E> */ B(GetKeyedProperty), R(this), U8(2),
-                B(Wide), B(LdaSmi), I16(311),
+                B(Wide), B(LdaSmi), I16(315),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
@@ -91,7 +91,7 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#b"],
 ]
 handlers: [
 ]
@@ -115,7 +115,7 @@ bytecodes: [
   /*   41 E> */ B(DefineKeyedOwnProperty), R(this), R(0), U8(0), U8(0),
   /*   46 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
   /*   51 E> */ B(GetKeyedProperty), R(this), U8(2),
-                B(Wide), B(LdaSmi), I16(310),
+                B(Wide), B(LdaSmi), I16(314),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
@@ -123,7 +123,7 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#c"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#c"],
 ]
 handlers: [
 ]
@@ -149,7 +149,7 @@ bytecodes: [
                 B(Star2),
                 B(LdaImmutableCurrentContextSlot), U8(3),
   /*   58 E> */ B(GetKeyedProperty), R(this), U8(2),
-                B(Wide), B(LdaSmi), I16(311),
+                B(Wide), B(LdaSmi), I16(315),
                 B(Star3),
                 B(LdaConstant), U8(0),
                 B(Star4),
@@ -157,7 +157,7 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#d"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#d"],
 ]
 handlers: [
 ]
@@ -181,7 +181,7 @@ bytecodes: [
   /*   41 E> */ B(DefineKeyedOwnProperty), R(this), R(0), U8(0), U8(0),
   /*   46 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
   /*   51 E> */ B(GetKeyedProperty), R(this), U8(2),
-                B(Wide), B(LdaSmi), I16(310),
+                B(Wide), B(LdaSmi), I16(314),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
@@ -189,7 +189,7 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#e"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#e"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateAccessorDeclaration.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateAccessorDeclaration.golden
index c419ef028ef298..1b31df47bea532 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateAccessorDeclaration.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateAccessorDeclaration.golden
@@ -46,7 +46,7 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["A"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["A"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
@@ -94,7 +94,7 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["B"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["B"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
@@ -141,7 +141,7 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["C"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["C"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
@@ -215,13 +215,13 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["D"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["D"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["E"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["E"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
@@ -293,7 +293,7 @@ constant pool: [
   SHARED_FUNCTION_INFO_TYPE,
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["C"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["C"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
@@ -364,7 +364,7 @@ constant pool: [
   SHARED_FUNCTION_INFO_TYPE,
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["C"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["C"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateClassFields.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateClassFields.golden
index 5f1727548b8dda..422b3795bbd421 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateClassFields.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateClassFields.golden
@@ -76,7 +76,7 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#a"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SYMBOL_TYPE,
@@ -222,7 +222,7 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#a"],
   FIXED_ARRAY_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
@@ -230,7 +230,7 @@ constant pool: [
   SYMBOL_TYPE,
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#b"],
   FIXED_ARRAY_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateMethodAccess.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateMethodAccess.golden
index b7bb831e618647..be3de20be8044b 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateMethodAccess.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateMethodAccess.golden
@@ -58,7 +58,7 @@ bytecodes: [
                 B(Star2),
                 B(LdaImmutableCurrentContextSlot), U8(3),
   /*   54 E> */ B(GetKeyedProperty), R(this), U8(2),
-                B(Wide), B(LdaSmi), I16(309),
+                B(Wide), B(LdaSmi), I16(313),
                 B(Star3),
                 B(LdaConstant), U8(0),
                 B(Star4),
@@ -66,7 +66,7 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#b"],
 ]
 handlers: [
 ]
@@ -91,7 +91,7 @@ bytecodes: [
   /*   44 E> */ B(DefineKeyedOwnProperty), R(this), R(0), U8(0), U8(0),
   /*   49 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
   /*   54 E> */ B(GetKeyedProperty), R(this), U8(2),
-                B(Wide), B(LdaSmi), I16(309),
+                B(Wide), B(LdaSmi), I16(313),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
@@ -99,7 +99,7 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#c"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#c"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateMethodDeclaration.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateMethodDeclaration.golden
index b68cb201a296a6..2a30cd80db0a15 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateMethodDeclaration.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PrivateMethodDeclaration.golden
@@ -41,7 +41,7 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["A"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["A"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
@@ -104,12 +104,12 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["D"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["D"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["E"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["E"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
@@ -173,7 +173,7 @@ constant pool: [
   SHARED_FUNCTION_INFO_TYPE,
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["C"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["C"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyCall.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyCall.golden
index e0d58d38e7e2d8..cad4904ebd6249 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyCall.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyCall.golden
@@ -21,7 +21,7 @@ bytecodes: [
   /*   32 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["func"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["func"],
 ]
 handlers: [
 ]
@@ -41,7 +41,7 @@ bytecodes: [
   /*   42 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["func"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["func"],
 ]
 handlers: [
 ]
@@ -64,7 +64,7 @@ bytecodes: [
   /*   43 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["func"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["func"],
 ]
 handlers: [
 ]
@@ -346,135 +346,135 @@ bytecodes: [
   /* 1722 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name384"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name385"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name386"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name387"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name388"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name389"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name390"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name391"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name392"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name393"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name394"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name395"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name396"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name397"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name398"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name399"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name400"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name401"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name402"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name403"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name404"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name405"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name406"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name407"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name408"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name409"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name410"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name411"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name412"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name413"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name414"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name415"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name416"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name417"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name418"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name419"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name420"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name421"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name422"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name423"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name424"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name425"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name426"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name427"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name428"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name429"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name430"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name431"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name432"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name433"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name434"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name435"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name436"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name437"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name438"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name439"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name440"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name441"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name442"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name443"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name444"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name445"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name446"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name447"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name448"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name449"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name450"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name451"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name452"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name453"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name454"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name455"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name456"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name457"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name458"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name459"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name460"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name461"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name462"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name463"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name464"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name465"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name466"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name467"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name468"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name469"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name470"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name471"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name472"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name473"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name474"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name475"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name476"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name477"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name478"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name479"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name480"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name481"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name482"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name483"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name484"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name485"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name486"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name487"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name488"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name489"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name490"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name491"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name492"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name493"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name494"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name495"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name496"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name497"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name498"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name499"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name500"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name501"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name502"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name503"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name504"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name505"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name506"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name507"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name508"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name509"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name510"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name511"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["func"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name384"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name385"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name386"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name387"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name388"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name389"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name390"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name391"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name392"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name393"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name394"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name395"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name396"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name397"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name398"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name399"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name400"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name401"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name402"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name403"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name404"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name405"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name406"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name407"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name408"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name409"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name410"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name411"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name412"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name413"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name414"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name415"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name416"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name417"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name418"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name419"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name420"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name421"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name422"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name423"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name424"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name425"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name426"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name427"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name428"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name429"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name430"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name431"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name432"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name433"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name434"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name435"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name436"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name437"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name438"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name439"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name440"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name441"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name442"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name443"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name444"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name445"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name446"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name447"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name448"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name449"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name450"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name451"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name452"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name453"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name454"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name455"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name456"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name457"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name458"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name459"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name460"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name461"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name462"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name463"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name464"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name465"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name466"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name467"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name468"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name469"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name470"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name471"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name472"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name473"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name474"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name475"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name476"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name477"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name478"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name479"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name480"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name481"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name482"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name483"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name484"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name485"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name486"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name487"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name488"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name489"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name490"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name491"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name492"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name493"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name494"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name495"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name496"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name497"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name498"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name499"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name500"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name501"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name502"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name503"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name504"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name505"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name506"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name507"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name508"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name509"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name510"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name511"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["func"],
 ]
 handlers: [
 ]
@@ -508,7 +508,7 @@ bytecodes: [
   /*   49 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["func"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["func"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyLoadStore.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyLoadStore.golden
index c53128363e2a64..61c474bcfff786 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyLoadStore.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyLoadStore.golden
@@ -51,10 +51,10 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["l"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["aa"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["bb"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["v"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["l"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["aa"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["bb"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["v"],
 ]
 handlers: [
 ]
@@ -106,9 +106,9 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["l"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["cc"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["dd"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["l"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["cc"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["dd"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyLoads.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyLoads.golden
index 10faccc0e21c81..9939e99745d16e 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyLoads.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyLoads.golden
@@ -19,7 +19,7 @@ bytecodes: [
   /*   30 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
 ]
 handlers: [
 ]
@@ -37,7 +37,7 @@ bytecodes: [
   /*   32 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["key"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["key"],
 ]
 handlers: [
 ]
@@ -94,7 +94,7 @@ bytecodes: [
   /*   47 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
 ]
 handlers: [
 ]
@@ -373,135 +373,135 @@ bytecodes: [
   /* 1600 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name0"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name1"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name2"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name3"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name4"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name5"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name6"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name7"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name8"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name9"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name10"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name11"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name12"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name13"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name14"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name15"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name16"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name17"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name18"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name19"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name20"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name21"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name22"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name23"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name24"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name25"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name26"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name27"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name28"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name29"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name30"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name31"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name32"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name33"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name34"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name35"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name36"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name37"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name38"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name39"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name40"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name41"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name42"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name43"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name44"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name45"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name46"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name47"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name48"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name49"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name50"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name51"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name52"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name53"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name54"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name55"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name56"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name57"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name58"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name59"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name60"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name61"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name62"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name63"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name64"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name65"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name66"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name67"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name68"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name69"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name70"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name71"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name72"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name73"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name74"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name75"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name76"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name77"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name78"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name79"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name80"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name81"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name82"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name83"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name84"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name85"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name86"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name87"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name88"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name89"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name90"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name91"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name92"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name93"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name94"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name95"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name96"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name97"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name98"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name99"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name100"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name101"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name102"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name103"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name104"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name105"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name106"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name107"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name108"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name109"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name110"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name111"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name112"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name113"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name114"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name115"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name116"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name117"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name118"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name119"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name120"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name121"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name122"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name123"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name124"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name125"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name126"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name127"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name0"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name1"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name2"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name3"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name4"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name5"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name6"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name7"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name8"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name9"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name10"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name11"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name12"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name13"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name14"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name15"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name16"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name17"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name18"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name19"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name20"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name21"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name22"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name23"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name24"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name25"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name26"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name27"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name28"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name29"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name30"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name31"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name32"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name33"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name34"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name35"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name36"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name37"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name38"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name39"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name40"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name41"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name42"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name43"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name44"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name45"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name46"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name47"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name48"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name49"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name50"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name51"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name52"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name53"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name54"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name55"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name56"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name57"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name58"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name59"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name60"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name61"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name62"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name63"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name64"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name65"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name66"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name67"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name68"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name69"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name70"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name71"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name72"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name73"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name74"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name75"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name76"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name77"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name78"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name79"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name80"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name81"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name82"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name83"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name84"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name85"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name86"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name87"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name88"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name89"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name90"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name91"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name92"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name93"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name94"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name95"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name96"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name97"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name98"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name99"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name100"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name101"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name102"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name103"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name104"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name105"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name106"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name107"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name108"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name109"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name110"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name111"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name112"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name113"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name114"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name115"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name116"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name117"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name118"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name119"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name120"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name121"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name122"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name123"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name124"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name125"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name126"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name127"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyStores.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyStores.golden
index fbc284219b8816..4f37e6a0b1e41c 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyStores.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PropertyStores.golden
@@ -21,8 +21,8 @@ bytecodes: [
   /*   32 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
 ]
 handlers: [
 ]
@@ -42,8 +42,8 @@ bytecodes: [
   /*   34 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["key"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["key"],
 ]
 handlers: [
 ]
@@ -65,7 +65,7 @@ bytecodes: [
   /*   32 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
 ]
 handlers: [
 ]
@@ -85,7 +85,7 @@ bytecodes: [
   /*   33 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
 ]
 handlers: [
 ]
@@ -106,7 +106,7 @@ bytecodes: [
   /*   34 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
 ]
 handlers: [
 ]
@@ -126,8 +126,8 @@ bytecodes: [
   /*   46 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
 ]
 handlers: [
 ]
@@ -147,7 +147,7 @@ bytecodes: [
   /*   47 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["val"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["val"],
 ]
 handlers: [
 ]
@@ -431,135 +431,135 @@ bytecodes: [
   /* 1722 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name128"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name129"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name130"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name131"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name132"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name133"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name134"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name135"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name136"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name137"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name138"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name139"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name140"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name141"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name142"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name143"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name144"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name145"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name146"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name147"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name148"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name149"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name150"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name151"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name152"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name153"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name154"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name155"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name156"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name157"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name158"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name159"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name160"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name161"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name162"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name163"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name164"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name165"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name166"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name167"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name168"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name169"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name170"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name171"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name172"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name173"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name174"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name175"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name176"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name177"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name178"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name179"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name180"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name181"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name182"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name183"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name184"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name185"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name186"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name187"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name188"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name189"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name190"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name191"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name192"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name193"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name194"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name195"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name196"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name197"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name198"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name199"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name200"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name201"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name202"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name203"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name204"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name205"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name206"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name207"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name208"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name209"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name210"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name211"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name212"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name213"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name214"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name215"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name216"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name217"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name218"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name219"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name220"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name221"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name222"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name223"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name224"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name225"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name226"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name227"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name228"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name229"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name230"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name231"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name232"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name233"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name234"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name235"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name236"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name237"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name238"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name239"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name240"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name241"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name242"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name243"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name244"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name245"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name246"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name247"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name248"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name249"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name250"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name251"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name252"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name253"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name254"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name255"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name128"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name129"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name130"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name131"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name132"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name133"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name134"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name135"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name136"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name137"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name138"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name139"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name140"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name141"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name142"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name143"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name144"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name145"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name146"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name147"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name148"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name149"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name150"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name151"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name152"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name153"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name154"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name155"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name156"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name157"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name158"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name159"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name160"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name161"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name162"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name163"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name164"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name165"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name166"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name167"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name168"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name169"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name170"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name171"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name172"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name173"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name174"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name175"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name176"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name177"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name178"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name179"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name180"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name181"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name182"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name183"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name184"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name185"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name186"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name187"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name188"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name189"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name190"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name191"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name192"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name193"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name194"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name195"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name196"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name197"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name198"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name199"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name200"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name201"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name202"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name203"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name204"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name205"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name206"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name207"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name208"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name209"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name210"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name211"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name212"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name213"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name214"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name215"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name216"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name217"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name218"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name219"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name220"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name221"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name222"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name223"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name224"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name225"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name226"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name227"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name228"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name229"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name230"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name231"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name232"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name233"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name234"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name235"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name236"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name237"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name238"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name239"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name240"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name241"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name242"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name243"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name244"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name245"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name246"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name247"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name248"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name249"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name250"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name251"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name252"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name253"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name254"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name255"],
 ]
 handlers: [
 ]
@@ -844,135 +844,135 @@ bytecodes: [
   /* 1737 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name256"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name257"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name258"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name259"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name260"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name261"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name262"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name263"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name264"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name265"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name266"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name267"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name268"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name269"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name270"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name271"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name272"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name273"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name274"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name275"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name276"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name277"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name278"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name279"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name280"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name281"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name282"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name283"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name284"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name285"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name286"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name287"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name288"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name289"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name290"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name291"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name292"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name293"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name294"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name295"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name296"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name297"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name298"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name299"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name300"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name301"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name302"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name303"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name304"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name305"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name306"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name307"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name308"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name309"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name310"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name311"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name312"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name313"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name314"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name315"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name316"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name317"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name318"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name319"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name320"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name321"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name322"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name323"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name324"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name325"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name326"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name327"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name328"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name329"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name330"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name331"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name332"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name333"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name334"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name335"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name336"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name337"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name338"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name339"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name340"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name341"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name342"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name343"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name344"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name345"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name346"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name347"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name348"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name349"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name350"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name351"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name352"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name353"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name354"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name355"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name356"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name357"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name358"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name359"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name360"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name361"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name362"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name363"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name364"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name365"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name366"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name367"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name368"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name369"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name370"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name371"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name372"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name373"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name374"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name375"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name376"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name377"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name378"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name379"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name380"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name381"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name382"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name383"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name256"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name257"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name258"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name259"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name260"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name261"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name262"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name263"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name264"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name265"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name266"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name267"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name268"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name269"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name270"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name271"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name272"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name273"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name274"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name275"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name276"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name277"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name278"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name279"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name280"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name281"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name282"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name283"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name284"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name285"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name286"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name287"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name288"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name289"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name290"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name291"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name292"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name293"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name294"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name295"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name296"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name297"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name298"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name299"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name300"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name301"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name302"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name303"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name304"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name305"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name306"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name307"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name308"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name309"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name310"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name311"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name312"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name313"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name314"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name315"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name316"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name317"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name318"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name319"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name320"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name321"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name322"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name323"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name324"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name325"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name326"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name327"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name328"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name329"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name330"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name331"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name332"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name333"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name334"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name335"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name336"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name337"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name338"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name339"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name340"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name341"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name342"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name343"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name344"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name345"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name346"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name347"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name348"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name349"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name350"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name351"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name352"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name353"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name354"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name355"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name356"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name357"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name358"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name359"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name360"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name361"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name362"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name363"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name364"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name365"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name366"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name367"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name368"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name369"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name370"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name371"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name372"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name373"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name374"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name375"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name376"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name377"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name378"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name379"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name380"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name381"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name382"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name383"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/PublicClassFields.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/PublicClassFields.golden
index c814f8489d882e..82d7c61d2af2e9 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/PublicClassFields.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/PublicClassFields.golden
@@ -74,7 +74,7 @@ constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
   SHARED_FUNCTION_INFO_TYPE,
   SYMBOL_TYPE,
   SCOPE_INFO_TYPE,
@@ -206,7 +206,7 @@ constant pool: [
   FIXED_ARRAY_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
   SHARED_FUNCTION_INFO_TYPE,
   SYMBOL_TYPE,
   SCOPE_INFO_TYPE,
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/RegExpLiterals.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/RegExpLiterals.golden
index 2da784ddeaa76b..50e3528d66b86a 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/RegExpLiterals.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/RegExpLiterals.golden
@@ -17,7 +17,7 @@ bytecodes: [
   /*   48 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["ab+d"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["ab+d"],
 ]
 handlers: [
 ]
@@ -34,7 +34,7 @@ bytecodes: [
   /*   57 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["(\u005cw+)\u005cs(\u005cw+)"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["(\u005cw+)\u005cs(\u005cw+)"],
 ]
 handlers: [
 ]
@@ -57,9 +57,9 @@ bytecodes: [
   /*   61 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["ab+d"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["exec"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["abdd"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["ab+d"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["exec"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["abdd"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/StandardForLoop.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/StandardForLoop.golden
index dbfdbf9f31ba6a..41e8e59c6c7b4c 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/StandardForLoop.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/StandardForLoop.golden
@@ -128,8 +128,8 @@ constant pool: [
   SCOPE_INFO_TYPE,
   SCOPE_INFO_TYPE,
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["eval"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["1"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["eval"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["1"],
 ]
 handlers: [
 ]
@@ -235,8 +235,8 @@ bytecodes: [
 ]
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["y"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["y"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticClassFields.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticClassFields.golden
index 439c0eb00b1666..77037c0a320d8b 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticClassFields.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticClassFields.golden
@@ -104,9 +104,9 @@ constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["d"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["prototype"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["d"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["prototype"],
   SHARED_FUNCTION_INFO_TYPE,
   SYMBOL_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
@@ -288,9 +288,9 @@ constant pool: [
   FIXED_ARRAY_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["b"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["d"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["prototype"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["d"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["prototype"],
   SHARED_FUNCTION_INFO_TYPE,
   SYMBOL_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticPrivateMethodAccess.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticPrivateMethodAccess.golden
index e8350d6b7b42ca..8591271c49656f 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticPrivateMethodAccess.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticPrivateMethodAccess.golden
@@ -24,7 +24,7 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(1),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
@@ -36,7 +36,7 @@ bytecodes: [
   /*   73 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["A"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["A"],
 ]
 handlers: [
 ]
@@ -61,13 +61,13 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(0),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
   /*   61 E> */ B(CallRuntime), U16(Runtime::kNewTypeError), R(2), U8(2),
                 B(Throw),
-                B(Wide), B(LdaSmi), I16(309),
+                B(Wide), B(LdaSmi), I16(313),
                 B(Star2),
                 B(LdaConstant), U8(1),
                 B(Star3),
@@ -75,8 +75,8 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["B"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#b"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["B"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#b"],
 ]
 handlers: [
 ]
@@ -99,13 +99,13 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(0),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star1),
                 B(LdaConstant), U8(0),
                 B(Star2),
   /*   61 E> */ B(CallRuntime), U16(Runtime::kNewTypeError), R(1), U8(2),
                 B(Throw),
-                B(Wide), B(LdaSmi), I16(309),
+                B(Wide), B(LdaSmi), I16(313),
                 B(Star1),
                 B(LdaConstant), U8(1),
                 B(Star2),
@@ -113,8 +113,8 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["C"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#c"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["C"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#c"],
 ]
 handlers: [
 ]
@@ -145,7 +145,7 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(0),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
@@ -167,7 +167,7 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(0),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star3),
                 B(LdaConstant), U8(0),
                 B(Star4),
@@ -182,7 +182,7 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(0),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
@@ -194,7 +194,7 @@ bytecodes: [
   /*  137 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["D"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["D"],
 ]
 handlers: [
 ]
@@ -216,13 +216,13 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(0),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star1),
                 B(LdaConstant), U8(0),
                 B(Star2),
   /*   65 E> */ B(CallRuntime), U16(Runtime::kNewTypeError), R(1), U8(2),
                 B(Throw),
-                B(Wide), B(LdaSmi), I16(311),
+                B(Wide), B(LdaSmi), I16(315),
                 B(Star1),
                 B(LdaConstant), U8(1),
                 B(Star2),
@@ -230,8 +230,8 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["E"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#e"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["E"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#e"],
 ]
 handlers: [
 ]
@@ -253,13 +253,13 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(0),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star1),
                 B(LdaConstant), U8(0),
                 B(Star2),
   /*   58 E> */ B(CallRuntime), U16(Runtime::kNewTypeError), R(1), U8(2),
                 B(Throw),
-                B(Wide), B(LdaSmi), I16(310),
+                B(Wide), B(LdaSmi), I16(314),
                 B(Star1),
                 B(LdaConstant), U8(1),
                 B(Star2),
@@ -267,8 +267,8 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["F"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#f"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["F"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#f"],
 ]
 handlers: [
 ]
@@ -292,13 +292,13 @@ bytecodes: [
                 B(TestReferenceEqual), R(this),
                 B(Mov), R(this), R(0),
                 B(JumpIfTrue), U8(16),
-                B(Wide), B(LdaSmi), I16(303),
+                B(Wide), B(LdaSmi), I16(307),
                 B(Star2),
                 B(LdaConstant), U8(0),
                 B(Star3),
   /*   65 E> */ B(CallRuntime), U16(Runtime::kNewTypeError), R(2), U8(2),
                 B(Throw),
-                B(Wide), B(LdaSmi), I16(311),
+                B(Wide), B(LdaSmi), I16(315),
                 B(Star2),
                 B(LdaConstant), U8(1),
                 B(Star3),
@@ -306,8 +306,8 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["G"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#d"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["G"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#d"],
 ]
 handlers: [
 ]
@@ -327,7 +327,7 @@ bytecode array length: 19
 bytecodes: [
   /*   46 S> */ B(LdaImmutableCurrentContextSlot), U8(3),
   /*   51 E> */ B(GetKeyedProperty), R(this), U8(0),
-                B(Wide), B(LdaSmi), I16(310),
+                B(Wide), B(LdaSmi), I16(314),
                 B(Star1),
                 B(LdaConstant), U8(0),
                 B(Star2),
@@ -335,7 +335,7 @@ bytecodes: [
                 B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["#h"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["#h"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticPrivateMethodDeclaration.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticPrivateMethodDeclaration.golden
index 0093ce4f8e2ab0..5e1af9240e04d0 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticPrivateMethodDeclaration.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/StaticPrivateMethodDeclaration.golden
@@ -210,7 +210,7 @@ bytecodes: [
 constant pool: [
   SCOPE_INFO_TYPE,
   FIXED_ARRAY_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["A"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["A"],
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/StoreGlobal.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/StoreGlobal.golden
index 3f2442811f73a7..8652d5218dfad6 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/StoreGlobal.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/StoreGlobal.golden
@@ -22,7 +22,7 @@ bytecodes: [
   /*   33 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -42,7 +42,7 @@ bytecodes: [
   /*   39 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -63,7 +63,7 @@ bytecodes: [
   /*   47 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -84,7 +84,7 @@ bytecodes: [
   /*   29 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -366,135 +366,135 @@ bytecodes: [
   /* 1710 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name640"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name641"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name642"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name643"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name644"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name645"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name646"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name647"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name648"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name649"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name650"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name651"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name652"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name653"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name654"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name655"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name656"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name657"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name658"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name659"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name660"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name661"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name662"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name663"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name664"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name665"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name666"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name667"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name668"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name669"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name670"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name671"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name672"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name673"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name674"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name675"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name676"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name677"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name678"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name679"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name680"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name681"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name682"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name683"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name684"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name685"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name686"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name687"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name688"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name689"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name690"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name691"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name692"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name693"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name694"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name695"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name696"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name697"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name698"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name699"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name700"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name701"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name702"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name703"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name704"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name705"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name706"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name707"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name708"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name709"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name710"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name711"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name712"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name713"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name714"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name715"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name716"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name717"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name718"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name719"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name720"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name721"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name722"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name723"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name724"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name725"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name726"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name727"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name728"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name729"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name730"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name731"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name732"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name733"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name734"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name735"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name736"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name737"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name738"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name739"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name740"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name741"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name742"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name743"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name744"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name745"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name746"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name747"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name748"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name749"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name750"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name751"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name752"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name753"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name754"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name755"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name756"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name757"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name758"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name759"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name760"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name761"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name762"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name763"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name764"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name765"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name766"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name767"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name640"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name641"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name642"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name643"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name644"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name645"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name646"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name647"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name648"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name649"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name650"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name651"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name652"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name653"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name654"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name655"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name656"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name657"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name658"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name659"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name660"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name661"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name662"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name663"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name664"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name665"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name666"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name667"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name668"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name669"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name670"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name671"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name672"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name673"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name674"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name675"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name676"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name677"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name678"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name679"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name680"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name681"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name682"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name683"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name684"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name685"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name686"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name687"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name688"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name689"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name690"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name691"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name692"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name693"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name694"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name695"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name696"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name697"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name698"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name699"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name700"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name701"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name702"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name703"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name704"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name705"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name706"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name707"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name708"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name709"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name710"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name711"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name712"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name713"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name714"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name715"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name716"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name717"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name718"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name719"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name720"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name721"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name722"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name723"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name724"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name725"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name726"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name727"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name728"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name729"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name730"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name731"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name732"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name733"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name734"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name735"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name736"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name737"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name738"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name739"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name740"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name741"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name742"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name743"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name744"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name745"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name746"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name747"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name748"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name749"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name750"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name751"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name752"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name753"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name754"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name755"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name756"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name757"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name758"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name759"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name760"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name761"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name762"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name763"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name764"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name765"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name766"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name767"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
@@ -777,135 +777,135 @@ bytecodes: [
   /* 1726 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name768"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name769"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name770"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name771"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name772"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name773"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name774"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name775"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name776"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name777"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name778"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name779"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name780"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name781"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name782"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name783"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name784"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name785"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name786"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name787"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name788"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name789"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name790"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name791"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name792"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name793"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name794"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name795"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name796"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name797"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name798"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name799"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name800"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name801"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name802"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name803"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name804"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name805"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name806"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name807"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name808"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name809"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name810"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name811"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name812"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name813"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name814"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name815"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name816"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name817"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name818"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name819"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name820"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name821"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name822"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name823"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name824"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name825"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name826"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name827"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name828"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name829"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name830"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name831"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name832"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name833"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name834"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name835"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name836"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name837"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name838"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name839"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name840"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name841"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name842"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name843"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name844"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name845"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name846"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name847"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name848"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name849"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name850"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name851"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name852"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name853"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name854"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name855"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name856"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name857"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name858"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name859"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name860"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name861"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name862"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name863"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name864"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name865"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name866"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name867"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name868"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name869"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name870"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name871"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name872"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name873"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name874"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name875"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name876"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name877"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name878"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name879"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name880"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name881"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name882"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name883"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name884"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name885"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name886"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name887"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name888"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name889"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name890"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name891"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name892"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name893"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name894"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["name895"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name768"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name769"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name770"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name771"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name772"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name773"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name774"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name775"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name776"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name777"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name778"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name779"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name780"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name781"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name782"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name783"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name784"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name785"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name786"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name787"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name788"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name789"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name790"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name791"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name792"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name793"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name794"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name795"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name796"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name797"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name798"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name799"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name800"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name801"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name802"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name803"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name804"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name805"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name806"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name807"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name808"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name809"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name810"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name811"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name812"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name813"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name814"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name815"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name816"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name817"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name818"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name819"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name820"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name821"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name822"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name823"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name824"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name825"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name826"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name827"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name828"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name829"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name830"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name831"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name832"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name833"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name834"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name835"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name836"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name837"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name838"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name839"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name840"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name841"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name842"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name843"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name844"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name845"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name846"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name847"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name848"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name849"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name850"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name851"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name852"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name853"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name854"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name855"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name856"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name857"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name858"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name859"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name860"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name861"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name862"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name863"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name864"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name865"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name866"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name867"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name868"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name869"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name870"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name871"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name872"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name873"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name874"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name875"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name876"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name877"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name878"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name879"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name880"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name881"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name882"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name883"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name884"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name885"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name886"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name887"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name888"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name889"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name890"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name891"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name892"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name893"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name894"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["name895"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/StringConcat.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/StringConcat.golden
index e232c8a9996636..a517a282252d3f 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/StringConcat.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/StringConcat.golden
@@ -27,7 +27,7 @@ bytecodes: [
   /*   80 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
@@ -56,7 +56,7 @@ bytecodes: [
   /*   80 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
@@ -83,7 +83,7 @@ bytecodes: [
   /*   80 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
@@ -119,9 +119,9 @@ bytecodes: [
   /*   97 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["foo"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["bar"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["baz"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["foo"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["bar"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["baz"],
 ]
 handlers: [
 ]
@@ -151,7 +151,7 @@ bytecodes: [
   /*   95 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
@@ -187,7 +187,7 @@ bytecodes: [
 ]
 constant pool: [
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/StringConstants.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/StringConstants.golden
index 6c1858d59aee44..891d56854a553f 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/StringConstants.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/StringConstants.golden
@@ -17,7 +17,7 @@ bytecodes: [
   /*   60 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["This is a string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["This is a string"],
 ]
 handlers: [
 ]
@@ -36,8 +36,8 @@ bytecodes: [
   /*   81 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["First string"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["Second string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["First string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["Second string"],
 ]
 handlers: [
 ]
@@ -56,7 +56,7 @@ bytecodes: [
   /*   78 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["Same string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["Same string"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/SuperCallAndSpread.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/SuperCallAndSpread.golden
index e88a82c5f537de..3beef0b34c4347 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/SuperCallAndSpread.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/SuperCallAndSpread.golden
@@ -58,7 +58,7 @@ snippet: "
 "
 frame size: 11
 parameter count: 1
-bytecode array length: 51
+bytecode array length: 50
 bytecodes: [
   /*  128 E> */ B(CreateRestParameter),
                 B(Star3),
@@ -81,7 +81,6 @@ bytecodes: [
                 B(ThrowSuperAlreadyCalledIfNotHole),
                 B(Mov), R(5), R(this),
                 B(Ldar), R(this),
-                B(ThrowSuperNotCalledIfHole),
   /*  159 S> */ B(Return),
 ]
 constant pool: [
@@ -104,7 +103,7 @@ snippet: "
 "
 frame size: 11
 parameter count: 1
-bytecode array length: 101
+bytecode array length: 100
 bytecodes: [
   /*  128 E> */ B(CreateRestParameter),
                 B(Star3),
@@ -145,14 +144,13 @@ bytecodes: [
                 B(ThrowSuperAlreadyCalledIfNotHole),
                 B(Mov), R(5), R(this),
                 B(Ldar), R(this),
-                B(ThrowSuperNotCalledIfHole),
   /*  162 S> */ B(Return),
 ]
 constant pool: [
   ARRAY_BOILERPLATE_DESCRIPTION_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["next"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["done"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["value"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["next"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["done"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["value"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/TemplateLiterals.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/TemplateLiterals.golden
index e360a1b2ceeb6c..8eb76ac4c330f4 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/TemplateLiterals.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/TemplateLiterals.golden
@@ -31,7 +31,7 @@ bytecodes: [
   /*   80 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
@@ -62,7 +62,7 @@ bytecodes: [
   /*   80 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
@@ -93,7 +93,7 @@ bytecodes: [
   /*   80 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
@@ -134,9 +134,9 @@ bytecodes: [
   /*   87 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["foo"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["bar"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["baz"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["foo"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["bar"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["baz"],
 ]
 handlers: [
 ]
@@ -170,7 +170,7 @@ bytecodes: [
   /*   91 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
@@ -209,7 +209,7 @@ bytecodes: [
 ]
 constant pool: [
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/Throw.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/Throw.golden
index 4d5102e8f7c4da..f6edce81bf6c87 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/Throw.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/Throw.golden
@@ -33,7 +33,7 @@ bytecodes: [
   /*   34 E> */ B(Throw),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["Error"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["Error"],
 ]
 handlers: [
 ]
@@ -55,7 +55,7 @@ bytecodes: [
   /*   72 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["Error"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["Error"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/TopLevelObjectLiterals.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/TopLevelObjectLiterals.golden
index 9b8d6006bc5a3b..ec1b8d2b03210a 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/TopLevelObjectLiterals.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/TopLevelObjectLiterals.golden
@@ -31,8 +31,8 @@ constant pool: [
   FIXED_ARRAY_TYPE,
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
   SHARED_FUNCTION_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["func"],
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["a"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["func"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["a"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/Typeof.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/Typeof.golden
index 148073c74b3569..ad0b35f3798c7f 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/Typeof.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/Typeof.golden
@@ -45,7 +45,7 @@ bytecodes: [
   /*   45 S> */ B(Return),
 ]
 constant pool: [
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/VariableWithHint.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/VariableWithHint.golden
new file mode 100644
index 00000000000000..257f0cc4eab525
--- /dev/null
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/VariableWithHint.golden
@@ -0,0 +1,116 @@
+#
+# Autogenerated by generate-bytecode-expectations.
+#
+
+---
+wrap: no
+test function name: test
+
+---
+snippet: "
+  var test;
+  (function () {
+      function foo() {
+          let a = typeof('str'); if (a === 'string') {}
+          let b = typeof('str'); if (b === 1) {}
+          let c = typeof('str'); c = 1; if (c === 'string') {}
+          let d = typeof('str');
+          if (d === 'string' || d === 'number') {}
+          let e = 'hello world';
+          if (e == 'string' || e == 'number') {}
+          let f = 'hi';
+          for (let i = 0; i < 2; ++i) {
+              if (f === 'hi') {}
+          }
+          let g = true;
+          if (g === 's') {}
+          let j = true;
+          let k = j || 's';
+          if (k === 's') {}
+      }
+      foo();
+      test = foo;
+  })();
+"
+frame size: 10
+parameter count: 1
+bytecode array length: 121
+bytecodes: [
+  /*   62 S> */ B(LdaConstant), U8(0),
+                B(TypeOf),
+                B(Star0),
+  /*   77 S> */ B(LdaConstant), U8(1),
+                B(TestReferenceEqual), R(0),
+                B(JumpIfFalse), U8(2),
+  /*  116 S> */ B(LdaConstant), U8(0),
+                B(TypeOf),
+                B(Star1),
+  /*  131 S> */ B(LdaSmi), I8(1),
+  /*  137 E> */ B(TestEqualStrict), R(1), U8(0),
+                B(JumpIfFalse), U8(2),
+  /*  163 S> */ B(LdaConstant), U8(0),
+                B(TypeOf),
+                B(Star2),
+  /*  178 S> */ B(LdaSmi), I8(1),
+                B(Star2),
+  /*  185 S> */ B(LdaConstant), U8(1),
+  /*  191 E> */ B(TestEqualStrict), R(2), U8(1),
+                B(JumpIfFalse), U8(2),
+  /*  224 S> */ B(LdaConstant), U8(0),
+                B(TypeOf),
+                B(Star3),
+  /*  247 S> */ B(LdaConstant), U8(1),
+                B(TestReferenceEqual), R(3),
+                B(JumpIfTrue), U8(9),
+                B(LdaConstant), U8(2),
+  /*  271 E> */ B(TestEqualStrict), R(3), U8(2),
+                B(JumpIfFalse), U8(2),
+  /*  304 S> */ B(LdaConstant), U8(3),
+                B(Star4),
+  /*  327 S> */ B(LdaConstant), U8(1),
+                B(TestReferenceEqual), R(4),
+                B(JumpIfTrue), U8(9),
+                B(LdaConstant), U8(2),
+  /*  350 E> */ B(TestEqual), R(4), U8(3),
+                B(JumpIfFalse), U8(2),
+  /*  382 S> */ B(LdaConstant), U8(4),
+                B(Star5),
+  /*  409 S> */ B(LdaZero),
+                B(Star9),
+  /*  414 S> */ B(LdaSmi), I8(2),
+  /*  414 E> */ B(TestLessThan), R(9), U8(4),
+                B(JumpIfFalse), U8(18),
+  /*  438 S> */ B(LdaConstant), U8(4),
+  /*  444 E> */ B(TestEqualStrict), R(5), U8(5),
+                B(JumpIfFalse), U8(2),
+  /*  421 S> */ B(Ldar), R(9),
+                B(Inc), U8(6),
+                B(Star9),
+  /*  396 E> */ B(JumpLoop), U8(19), I8(0), U8(7),
+  /*  483 S> */ B(LdaTrue),
+                B(Star6),
+  /*  497 S> */ B(LdaConstant), U8(5),
+  /*  503 E> */ B(TestEqualStrict), R(6), U8(8),
+                B(JumpIfFalse), U8(2),
+  /*  531 S> */ B(LdaTrue),
+                B(Star7),
+  /*  553 S> */ B(JumpIfToBooleanTrue), U8(4),
+                B(LdaConstant), U8(5),
+                B(Star8),
+  /*  571 S> */ B(LdaConstant), U8(5),
+  /*  577 E> */ B(TestEqualStrict), R(8), U8(9),
+                B(JumpIfFalse), U8(2),
+                B(LdaUndefined),
+  /*  593 S> */ B(Return),
+]
+constant pool: [
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["str"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["string"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["number"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["hello world"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["hi"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["s"],
+]
+handlers: [
+]
+
diff --git a/deps/v8/test/unittests/interpreter/bytecode_expectations/WithStatement.golden b/deps/v8/test/unittests/interpreter/bytecode_expectations/WithStatement.golden
index 0ffcdab0da6537..31c426eeb49916 100644
--- a/deps/v8/test/unittests/interpreter/bytecode_expectations/WithStatement.golden
+++ b/deps/v8/test/unittests/interpreter/bytecode_expectations/WithStatement.golden
@@ -23,7 +23,7 @@ bytecodes: [
 constant pool: [
   OBJECT_BOILERPLATE_DESCRIPTION_TYPE,
   SCOPE_INFO_TYPE,
-  ONE_BYTE_INTERNALIZED_STRING_TYPE ["x"],
+  INTERNALIZED_ONE_BYTE_STRING_TYPE ["x"],
 ]
 handlers: [
 ]
diff --git a/deps/v8/test/unittests/interpreter/constant-array-builder-unittest.cc b/deps/v8/test/unittests/interpreter/constant-array-builder-unittest.cc
index bfe83b03ca3f00..16b86169a82a8f 100644
--- a/deps/v8/test/unittests/interpreter/constant-array-builder-unittest.cc
+++ b/deps/v8/test/unittests/interpreter/constant-array-builder-unittest.cc
@@ -32,7 +32,6 @@ STATIC_CONST_MEMBER_DEFINITION const size_t
     ConstantArrayBuilderTest::k8BitCapacity;
 
 TEST_F(ConstantArrayBuilderTest, AllocateAllEntries) {
-  CanonicalHandleScope canonical(isolate());
   ConstantArrayBuilder builder(zone());
   AstValueFactory ast_factory(zone(), isolate()->ast_string_constants(),
                               HashSeed(isolate()));
@@ -50,7 +49,6 @@ TEST_F(ConstantArrayBuilderTest, AllocateAllEntries) {
 }
 
 TEST_F(ConstantArrayBuilderTest, ToFixedArray) {
-  CanonicalHandleScope canonical(isolate());
   ConstantArrayBuilder builder(zone());
   static const int kNumberOfElements = 37;
   for (int i = 0; i < kNumberOfElements; i++) {
@@ -61,12 +59,12 @@ TEST_F(ConstantArrayBuilderTest, ToFixedArray) {
   for (int i = 0; i < kNumberOfElements; i++) {
     Handle<Object> actual(constant_array->get(i), isolate());
     Handle<Object> expected = builder.At(i, isolate()).ToHandleChecked();
-    ASSERT_EQ(expected->Number(), actual->Number()) << "Failure at index " << i;
+    ASSERT_EQ(Object::Number(*expected), Object::Number(*actual))
+        << "Failure at index " << i;
   }
 }
 
 TEST_F(ConstantArrayBuilderTest, ToLargeFixedArray) {
-  CanonicalHandleScope canonical(isolate());
   ConstantArrayBuilder builder(zone());
   static const int kNumberOfElements = 37373;
   for (int i = 0; i < kNumberOfElements; i++) {
@@ -77,12 +75,12 @@ TEST_F(ConstantArrayBuilderTest, ToLargeFixedArray) {
   for (int i = 0; i < kNumberOfElements; i++) {
     Handle<Object> actual(constant_array->get(i), isolate());
     Handle<Object> expected = builder.At(i, isolate()).ToHandleChecked();
-    ASSERT_EQ(expected->Number(), actual->Number()) << "Failure at index " << i;
+    ASSERT_EQ(Object::Number(*expected), Object::Number(*actual))
+        << "Failure at index " << i;
   }
 }
 
 TEST_F(ConstantArrayBuilderTest, ToLargeFixedArrayWithReservations) {
-  CanonicalHandleScope canonical(isolate());
   ConstantArrayBuilder builder(zone());
   AstValueFactory ast_factory(zone(), isolate()->ast_string_constants(),
                               HashSeed(isolate()));
@@ -96,12 +94,12 @@ TEST_F(ConstantArrayBuilderTest, ToLargeFixedArrayWithReservations) {
   for (int i = 0; i < kNumberOfElements; i++) {
     Handle<Object> actual(constant_array->get(i), isolate());
     Handle<Object> expected = builder.At(i, isolate()).ToHandleChecked();
-    ASSERT_EQ(expected->Number(), actual->Number()) << "Failure at index " << i;
+    ASSERT_EQ(Object::Number(*expected), Object::Number(*actual))
+        << "Failure at index " << i;
   }
 }
 
 TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithIdx8Reservations) {
-  CanonicalHandleScope canonical(isolate());
   for (size_t reserved = 1; reserved < k8BitCapacity; reserved *= 3) {
     ConstantArrayBuilder builder(zone());
     AstValueFactory ast_factory(zone(), isolate()->ast_string_constants(),
@@ -139,7 +137,7 @@ TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithIdx8Reservations) {
       CHECK_EQ(operand_size, OperandSize::kByte);
     }
     for (size_t i = 0; i < duplicates_in_idx8_space; i++) {
-      Smi value = Smi::FromInt(static_cast<int>(2 * k8BitCapacity + i));
+      Tagged<Smi> value = Smi::FromInt(static_cast<int>(2 * k8BitCapacity + i));
       size_t index = builder.CommitReservedEntry(OperandSize::kByte, value);
       CHECK_EQ(index, k8BitCapacity - reserved + i);
     }
@@ -156,20 +154,19 @@ TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithIdx8Reservations) {
 
     // Check all committed values match expected
     for (size_t i = 0; i < k8BitCapacity - reserved; i++) {
-      Object value = constant_array->get(static_cast<int>(i));
-      Smi smi = Smi::FromInt(static_cast<int>(i));
-      CHECK(value.SameValue(smi));
+      Tagged<Object> value = constant_array->get(static_cast<int>(i));
+      Tagged<Smi> smi = Smi::FromInt(static_cast<int>(i));
+      CHECK(Object::SameValue(value, smi));
     }
     for (size_t i = k8BitCapacity; i < 2 * k8BitCapacity + reserved; i++) {
-      Object value = constant_array->get(static_cast<int>(i));
-      Smi smi = Smi::FromInt(static_cast<int>(i - reserved));
-      CHECK(value.SameValue(smi));
+      Tagged<Object> value = constant_array->get(static_cast<int>(i));
+      Tagged<Smi> smi = Smi::FromInt(static_cast<int>(i - reserved));
+      CHECK(Object::SameValue(value, smi));
     }
   }
 }
 
 TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithWideReservations) {
-  CanonicalHandleScope canonical(isolate());
   for (size_t reserved = 1; reserved < k8BitCapacity; reserved *= 3) {
     ConstantArrayBuilder builder(zone());
     AstValueFactory ast_factory(zone(), isolate()->ast_string_constants(),
@@ -208,14 +205,14 @@ TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithWideReservations) {
     CHECK_EQ(constant_array->length(),
              static_cast<int>(k8BitCapacity + reserved));
     for (size_t i = 0; i < k8BitCapacity + reserved; i++) {
-      Object value = constant_array->get(static_cast<int>(i));
-      CHECK(value.SameValue(*isolate()->factory()->NewNumberFromSize(i)));
+      Tagged<Object> value = constant_array->get(static_cast<int>(i));
+      CHECK(Object::SameValue(value,
+                              *isolate()->factory()->NewNumberFromSize(i)));
     }
   }
 }
 
 TEST_F(ConstantArrayBuilderTest, GapFilledWhenLowReservationCommitted) {
-  CanonicalHandleScope canonical(isolate());
   ConstantArrayBuilder builder(zone());
   AstValueFactory ast_factory(zone(), isolate()->ast_string_constants(),
                               HashSeed(isolate()));
@@ -238,16 +235,16 @@ TEST_F(ConstantArrayBuilderTest, GapFilledWhenLowReservationCommitted) {
   Handle<FixedArray> constant_array = builder.ToFixedArray(isolate());
   CHECK_EQ(constant_array->length(), static_cast<int>(2 * k8BitCapacity));
   for (size_t i = 0; i < k8BitCapacity; i++) {
-    Object original = constant_array->get(static_cast<int>(k8BitCapacity + i));
-    Object duplicate = constant_array->get(static_cast<int>(i));
-    CHECK(original.SameValue(duplicate));
+    Tagged<Object> original =
+        constant_array->get(static_cast<int>(k8BitCapacity + i));
+    Tagged<Object> duplicate = constant_array->get(static_cast<int>(i));
+    CHECK(Object::SameValue(original, duplicate));
     Handle<Object> reference = isolate()->factory()->NewNumberFromSize(i);
-    CHECK(original.SameValue(*reference));
+    CHECK(Object::SameValue(original, *reference));
   }
 }
 
 TEST_F(ConstantArrayBuilderTest, GapNotFilledWhenLowReservationDiscarded) {
-  CanonicalHandleScope canonical(isolate());
   ConstantArrayBuilder builder(zone());
   for (size_t i = 0; i < k8BitCapacity; i++) {
     OperandSize operand_size = builder.CreateReservedEntry();
@@ -272,14 +269,13 @@ TEST_F(ConstantArrayBuilderTest, GapNotFilledWhenLowReservationDiscarded) {
     Handle<Object> reference = isolate()->factory()->NewNumber(i + 0.5);
     Handle<Object> original =
         builder.At(k8BitCapacity + i, isolate()).ToHandleChecked();
-    CHECK(original->SameValue(*reference));
+    CHECK(Object::SameValue(*original, *reference));
     MaybeHandle<Object> duplicate = builder.At(i, isolate());
     CHECK(duplicate.is_null());
   }
 }
 
 TEST_F(ConstantArrayBuilderTest, HolesWithUnusedReservations) {
-  CanonicalHandleScope canonical(isolate());
   static int kNumberOfHoles = 128;
   static int k8BitCapacity = ConstantArrayBuilder::k8BitCapacity;
   ConstantArrayBuilder builder(zone());
@@ -304,17 +300,16 @@ TEST_F(ConstantArrayBuilderTest, HolesWithUnusedReservations) {
   Handle<FixedArray> constant_array = builder.ToFixedArray(isolate());
   CHECK_EQ(constant_array->length(), k8BitCapacity + 1);
   for (int i = kNumberOfHoles; i < k8BitCapacity; i++) {
-    CHECK(constant_array->get(i).SameValue(
-        *isolate()->factory()->the_hole_value()));
+    CHECK(Object::SameValue(constant_array->get(i),
+                            *isolate()->factory()->the_hole_value()));
   }
-  CHECK(!constant_array->get(kNumberOfHoles - 1)
-             .SameValue(*isolate()->factory()->the_hole_value()));
-  CHECK(!constant_array->get(k8BitCapacity)
-             .SameValue(*isolate()->factory()->the_hole_value()));
+  CHECK(!Object::SameValue(constant_array->get(kNumberOfHoles - 1),
+                           *isolate()->factory()->the_hole_value()));
+  CHECK(!Object::SameValue(constant_array->get(k8BitCapacity),
+                           *isolate()->factory()->the_hole_value()));
 }
 
 TEST_F(ConstantArrayBuilderTest, ReservationsAtAllScales) {
-  CanonicalHandleScope canonical(isolate());
   ConstantArrayBuilder builder(zone());
   AstValueFactory ast_factory(zone(), isolate()->ast_string_constants(),
                               HashSeed(isolate()));
@@ -354,12 +349,11 @@ TEST_F(ConstantArrayBuilderTest, ReservationsAtAllScales) {
     } else {
       expected = isolate()->factory()->the_hole_value();
     }
-    CHECK(constant_array->get(i).SameValue(*expected));
+    CHECK(Object::SameValue(constant_array->get(i), *expected));
   }
 }
 
 TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithFixedReservations) {
-  CanonicalHandleScope canonical(isolate());
   ConstantArrayBuilder builder(zone());
   for (size_t i = 0; i < k16BitCapacity; i++) {
     if ((i % 2) == 0) {
@@ -377,8 +371,7 @@ TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithFixedReservations) {
       MaybeHandle<Object> empty = builder.At(i, isolate());
       CHECK(empty.is_null());
     } else {
-      CHECK_EQ(Handle<Smi>::cast(builder.At(i, isolate()).ToHandleChecked())
-                   ->value(),
+      CHECK_EQ(Smi::cast(*builder.At(i, isolate()).ToHandleChecked()).value(),
                static_cast<int>(i));
     }
   }
@@ -391,9 +384,8 @@ TEST_F(ConstantArrayBuilderTest, AllocateEntriesWithFixedReservations) {
 
   // Check values after reserved entries are inserted.
   for (size_t i = 0; i < k16BitCapacity; i++) {
-    CHECK_EQ(
-        Handle<Smi>::cast(builder.At(i, isolate()).ToHandleChecked())->value(),
-        static_cast<int>(i));
+    CHECK_EQ(Smi::cast(*builder.At(i, isolate()).ToHandleChecked()).value(),
+             static_cast<int>(i));
   }
 }
 
diff --git a/deps/v8/test/unittests/interpreter/generate-bytecode-expectations.cc b/deps/v8/test/unittests/interpreter/generate-bytecode-expectations.cc
index ed0f0e1c6dce30..35820f0111dd74 100644
--- a/deps/v8/test/unittests/interpreter/generate-bytecode-expectations.cc
+++ b/deps/v8/test/unittests/interpreter/generate-bytecode-expectations.cc
@@ -49,7 +49,7 @@ class ProgramOptions final {
         module_(false),
         top_level_(false),
         print_callee_(false),
-        async_iteration_(false),
+        elide_redundant_tdz_checks_(false),
         verbose_(false) {}
 
   bool Validate() const;
@@ -70,7 +70,9 @@ class ProgramOptions final {
   bool module() const { return module_; }
   bool top_level() const { return top_level_; }
   bool print_callee() const { return print_callee_; }
-  bool async_iteration() const { return async_iteration_; }
+  bool elide_redundant_tdz_checks() const {
+    return elide_redundant_tdz_checks_;
+  }
   bool verbose() const { return verbose_; }
   bool suppress_runtime_errors() const { return baseline() && !verbose_; }
   std::vector<std::string> input_filenames() const { return input_filenames_; }
@@ -88,7 +90,7 @@ class ProgramOptions final {
   bool module_;
   bool top_level_;
   bool print_callee_;
-  bool async_iteration_;
+  bool elide_redundant_tdz_checks_;
   bool verbose_;
   std::vector<std::string> input_filenames_;
   std::string output_filename_;
@@ -189,8 +191,8 @@ ProgramOptions ProgramOptions::FromCommandLine(int argc, char** argv) {
       options.top_level_ = true;
     } else if (strcmp(argv[i], "--print-callee") == 0) {
       options.print_callee_ = true;
-    } else if (strcmp(argv[i], "--async-iteration") == 0) {
-      options.async_iteration_ = true;
+    } else if (strcmp(argv[i], "--elide-redundant-tdz-checks") == 0) {
+      options.elide_redundant_tdz_checks_ = true;
     } else if (strcmp(argv[i], "--verbose") == 0) {
       options.verbose_ = true;
     } else if (strncmp(argv[i], "--output=", 9) == 0) {
@@ -306,8 +308,8 @@ void ProgramOptions::UpdateFromHeader(std::istream* stream) {
       top_level_ = ParseBoolean(line.c_str() + 11);
     } else if (line.compare(0, strlen(kPrintCallee), kPrintCallee) == 0) {
       print_callee_ = ParseBoolean(line.c_str() + strlen(kPrintCallee));
-    } else if (line.compare(0, 17, "async iteration: ") == 0) {
-      async_iteration_ = ParseBoolean(line.c_str() + 17);
+    } else if (line.compare(0, 28, "elide redundant tdz checks: ") == 0) {
+      elide_redundant_tdz_checks_ = ParseBoolean(line.c_str() + 28);
     } else if (line == "---") {
       break;
     } else if (line.empty()) {
@@ -329,7 +331,9 @@ void ProgramOptions::PrintHeader(std::ostream* stream) const {
   if (module_) *stream << "\nmodule: yes";
   if (top_level_) *stream << "\ntop level: yes";
   if (print_callee_) *stream << "\nprint callee: yes";
-  if (async_iteration_) *stream << "\nasync iteration: yes";
+  if (elide_redundant_tdz_checks_) {
+    *stream << "\nelide redundant tdz checks: yes";
+  }
 
   *stream << "\n\n";
 }
@@ -440,12 +444,20 @@ void GenerateExpectationsFile(std::ostream* stream,
   if (!options.test_function_name().empty()) {
     printer.set_test_function_name(options.test_function_name());
   }
+  bool old_elide_redundant_tdz_checks =
+      i::v8_flags.ignition_elide_redundant_tdz_checks;
+  if (options.elide_redundant_tdz_checks()) {
+    i::v8_flags.ignition_elide_redundant_tdz_checks = true;
+  }
 
   *stream << "#\n# Autogenerated by generate-bytecode-expectations.\n#\n\n";
   options.PrintHeader(stream);
   for (const std::string& snippet : snippet_list) {
     printer.PrintExpectation(stream, snippet);
   }
+
+  i::v8_flags.ignition_elide_redundant_tdz_checks =
+      old_elide_redundant_tdz_checks;
 }
 
 bool WriteExpectationsFile(const std::vector<std::string>& snippet_list,
diff --git a/deps/v8/test/unittests/interpreter/interpreter-assembler-unittest.cc b/deps/v8/test/unittests/interpreter/interpreter-assembler-unittest.cc
index 51e61dae23833b..eaae88b8d6e3c0 100644
--- a/deps/v8/test/unittests/interpreter/interpreter-assembler-unittest.cc
+++ b/deps/v8/test/unittests/interpreter/interpreter-assembler-unittest.cc
@@ -519,10 +519,11 @@ TARGET_TEST_F(InterpreterAssemblerTest, LoadFeedbackVector) {
     Matcher<c::Node*> load_vector_cell_matcher = m.IsLoadFromObject(
         MachineType::TaggedPointer(), load_function_matcher,
         c::IsIntPtrConstant(JSFunction::kFeedbackCellOffset - kHeapObjectTag));
-    EXPECT_THAT(load_feedback_vector,
-                m.IsLoadFromObject(
-                    MachineType::TaggedPointer(), load_vector_cell_matcher,
-                    c::IsIntPtrConstant(Cell::kValueOffset - kHeapObjectTag)));
+    EXPECT_THAT(
+        load_feedback_vector,
+        m.IsLoadFromObject(
+            MachineType::TaggedPointer(), load_vector_cell_matcher,
+            c::IsIntPtrConstant(FeedbackCell::kValueOffset - kHeapObjectTag)));
   }
 }
 
diff --git a/deps/v8/test/unittests/interpreter/interpreter-tester.h b/deps/v8/test/unittests/interpreter/interpreter-tester.h
index 5fa4c9a48c68e6..34839d978d124a 100644
--- a/deps/v8/test/unittests/interpreter/interpreter-tester.h
+++ b/deps/v8/test/unittests/interpreter/interpreter-tester.h
@@ -35,7 +35,7 @@ class InterpreterCallable {
  public:
   virtual ~InterpreterCallable() = default;
 
-  FeedbackVector vector() const { return function_->feedback_vector(); }
+  Tagged<FeedbackVector> vector() const { return function_->feedback_vector(); }
 
  protected:
   InterpreterCallable(Isolate* isolate, Handle<JSFunction> function)
@@ -151,7 +151,7 @@ class InterpreterTester {
 
               .ToLocalChecked());
       function = Handle<JSFunction>::cast(v8::Utils::OpenHandle(*api_function));
-      is_compiled_scope = function->shared().is_compiled_scope(isolate_);
+      is_compiled_scope = function->shared()->is_compiled_scope(isolate_);
     } else {
       int arg_count = sizeof...(A);
       std::string source("(function " + function_name() + "(");
@@ -162,19 +162,19 @@ class InterpreterTester {
       function = Handle<JSFunction>::cast(v8::Utils::OpenHandle(
           *v8::Local<v8::Function>::Cast(CompileRun(source.c_str()))));
       function->set_code(*BUILTIN_CODE(isolate_, InterpreterEntryTrampoline));
-      is_compiled_scope = function->shared().is_compiled_scope(isolate_);
+      is_compiled_scope = function->shared()->is_compiled_scope(isolate_);
     }
 
     if (!bytecode_.is_null()) {
-      function->shared().set_function_data(*bytecode_.ToHandleChecked(),
-                                           kReleaseStore);
-      is_compiled_scope = function->shared().is_compiled_scope(isolate_);
+      function->shared()->set_function_data(*bytecode_.ToHandleChecked(),
+                                            kReleaseStore);
+      is_compiled_scope = function->shared()->is_compiled_scope(isolate_);
     }
     if (HasFeedbackMetadata()) {
       function->set_raw_feedback_cell(isolate_->heap()->many_closures_cell());
       // Set the raw feedback metadata to circumvent checks that we are not
       // overwriting existing metadata.
-      function->shared().set_raw_outer_scope_info_or_feedback_metadata(
+      function->shared()->set_raw_outer_scope_info_or_feedback_metadata(
           *feedback_metadata_.ToHandleChecked());
       JSFunction::EnsureFeedbackVector(isolate_, function, &is_compiled_scope);
     }
diff --git a/deps/v8/test/unittests/interpreter/interpreter-unittest.cc b/deps/v8/test/unittests/interpreter/interpreter-unittest.cc
index dae9431252a3fd..8598ce9f2358c3 100644
--- a/deps/v8/test/unittests/interpreter/interpreter-unittest.cc
+++ b/deps/v8/test/unittests/interpreter/interpreter-unittest.cc
@@ -145,7 +145,7 @@ TEST_F(InterpreterTest, InterpreterLoadLiteral) {
     Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray(i_isolate());
 
     Handle<Object> return_val = RunBytecode(bytecode_array);
-    CHECK_EQ(i::HeapNumber::cast(*return_val).value(), -2.1e19);
+    CHECK_EQ(i::HeapNumber::cast(*return_val)->value(), -2.1e19);
   }
 
   // Strings.
@@ -162,7 +162,7 @@ TEST_F(InterpreterTest, InterpreterLoadLiteral) {
     Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray(i_isolate());
 
     Handle<Object> return_val = RunBytecode(bytecode_array);
-    CHECK(i::String::cast(*return_val).Equals(*raw_string->string()));
+    CHECK(i::String::cast(*return_val)->Equals(*raw_string->string()));
   }
 }
 
@@ -264,7 +264,7 @@ TEST_F(InterpreterTest, InterpreterShiftOpsSmi) {
         Handle<Object> return_value = callable().ToHandleChecked();
         Handle<Object> expected_value =
             factory->NewNumber(BinaryOpC(kShiftOperators[o], lhs, rhs));
-        CHECK(return_value->SameValue(*expected_value));
+        CHECK(Object::SameValue(*return_value, *expected_value));
       }
     }
   }
@@ -300,7 +300,7 @@ TEST_F(InterpreterTest, InterpreterBinaryOpsSmi) {
         Handle<Object> return_value = callable().ToHandleChecked();
         Handle<Object> expected_value =
             factory->NewNumber(BinaryOpC(kArithmeticOperators[o], lhs, rhs));
-        CHECK(return_value->SameValue(*expected_value));
+        CHECK(Object::SameValue(*return_value, *expected_value));
       }
     }
   }
@@ -337,7 +337,7 @@ TEST_F(InterpreterTest, InterpreterBinaryOpsHeapNumber) {
         Handle<Object> return_value = callable().ToHandleChecked();
         Handle<Object> expected_value =
             factory->NewNumber(BinaryOpC(kArithmeticOperators[o], lhs, rhs));
-        CHECK(return_value->SameValue(*expected_value));
+        CHECK(Object::SameValue(*return_value, *expected_value));
       }
     }
   }
@@ -373,14 +373,14 @@ TEST_F(InterpreterTest, InterpreterBinaryOpsBigInt) {
         InterpreterTester tester(i_isolate(), bytecode_array, metadata);
         auto callable = tester.GetCallable<>();
         Handle<Object> return_value = callable().ToHandleChecked();
-        CHECK(return_value->IsBigInt());
+        CHECK(IsBigInt(*return_value));
         if (tester.HasFeedbackMetadata()) {
-          MaybeObject feedback = callable.vector().Get(slot);
-          CHECK(feedback->IsSmi());
+          MaybeObject feedback = callable.vector()->Get(slot);
+          CHECK(IsSmi(feedback));
           // TODO(panq): Create a standalone unit test for kBigInt64.
           CHECK(BinaryOperationFeedback::kBigInt64 ==
-                    feedback->ToSmi().value() ||
-                BinaryOperationFeedback::kBigInt == feedback->ToSmi().value());
+                    feedback.ToSmi().value() ||
+                BinaryOperationFeedback::kBigInt == feedback.ToSmi().value());
         }
       }
     }
@@ -494,12 +494,12 @@ TEST_F(InterpreterTest, InterpreterStringAdd) {
     InterpreterTester tester(i_isolate(), bytecode_array, metadata);
     auto callable = tester.GetCallable<>();
     Handle<Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*test_cases[i].expected_value));
+    CHECK(Object::SameValue(*return_value, *test_cases[i].expected_value));
 
     if (tester.HasFeedbackMetadata()) {
-      MaybeObject feedback = callable.vector().Get(slot);
-      CHECK(feedback->IsSmi());
-      CHECK_EQ(test_cases[i].expected_feedback, feedback->ToSmi().value());
+      MaybeObject feedback = callable.vector()->Get(slot);
+      CHECK(IsSmi(feedback));
+      CHECK_EQ(test_cases[i].expected_feedback, feedback.ToSmi().value());
     }
   }
 }
@@ -713,9 +713,9 @@ TEST_F(InterpreterTest, InterpreterBinaryOpTypeFeedback) {
     auto callable = tester.GetCallable<>();
 
     Handle<Object> return_val = callable().ToHandleChecked();
-    MaybeObject feedback0 = callable.vector().Get(slot0);
-    CHECK(feedback0->IsSmi());
-    CHECK_EQ(test_case.feedback, feedback0->ToSmi().value());
+    MaybeObject feedback0 = callable.vector()->Get(slot0);
+    CHECK(IsSmi(feedback0));
+    CHECK_EQ(test_case.feedback, feedback0.ToSmi().value());
     CHECK(
         Object::Equals(i_isolate(), test_case.result, return_val).ToChecked());
   }
@@ -821,9 +821,9 @@ TEST_F(InterpreterTest, InterpreterBinaryOpSmiTypeFeedback) {
     auto callable = tester.GetCallable<>();
 
     Handle<Object> return_val = callable().ToHandleChecked();
-    MaybeObject feedback0 = callable.vector().Get(slot0);
-    CHECK(feedback0->IsSmi());
-    CHECK_EQ(test_case.feedback, feedback0->ToSmi().value());
+    MaybeObject feedback0 = callable.vector()->Get(slot0);
+    CHECK(IsSmi(feedback0));
+    CHECK_EQ(test_case.feedback, feedback0.ToSmi().value());
     CHECK(
         Object::Equals(i_isolate(), test_case.result, return_val).ToChecked());
   }
@@ -889,25 +889,25 @@ TEST_F(InterpreterTest, InterpreterUnaryOpFeedback) {
                  test_case.bigint_feedback_value, test_case.any_feedback_value)
             .ToHandleChecked();
     USE(return_val);
-    MaybeObject feedback0 = callable.vector().Get(slot0);
-    CHECK(feedback0->IsSmi());
-    CHECK_EQ(BinaryOperationFeedback::kSignedSmall, feedback0->ToSmi().value());
+    MaybeObject feedback0 = callable.vector()->Get(slot0);
+    CHECK(IsSmi(feedback0));
+    CHECK_EQ(BinaryOperationFeedback::kSignedSmall, feedback0.ToSmi().value());
 
-    MaybeObject feedback1 = callable.vector().Get(slot1);
-    CHECK(feedback1->IsSmi());
-    CHECK_EQ(BinaryOperationFeedback::kNumber, feedback1->ToSmi().value());
+    MaybeObject feedback1 = callable.vector()->Get(slot1);
+    CHECK(IsSmi(feedback1));
+    CHECK_EQ(BinaryOperationFeedback::kNumber, feedback1.ToSmi().value());
 
-    MaybeObject feedback2 = callable.vector().Get(slot2);
-    CHECK(feedback2->IsSmi());
-    CHECK_EQ(BinaryOperationFeedback::kNumber, feedback2->ToSmi().value());
+    MaybeObject feedback2 = callable.vector()->Get(slot2);
+    CHECK(IsSmi(feedback2));
+    CHECK_EQ(BinaryOperationFeedback::kNumber, feedback2.ToSmi().value());
 
-    MaybeObject feedback3 = callable.vector().Get(slot3);
-    CHECK(feedback3->IsSmi());
-    CHECK_EQ(BinaryOperationFeedback::kBigInt, feedback3->ToSmi().value());
+    MaybeObject feedback3 = callable.vector()->Get(slot3);
+    CHECK(IsSmi(feedback3));
+    CHECK_EQ(BinaryOperationFeedback::kBigInt, feedback3.ToSmi().value());
 
-    MaybeObject feedback4 = callable.vector().Get(slot4);
-    CHECK(feedback4->IsSmi());
-    CHECK_EQ(BinaryOperationFeedback::kAny, feedback4->ToSmi().value());
+    MaybeObject feedback4 = callable.vector()->Get(slot4);
+    CHECK(IsSmi(feedback4));
+    CHECK_EQ(BinaryOperationFeedback::kAny, feedback4.ToSmi().value());
   }
 }
 
@@ -948,17 +948,17 @@ TEST_F(InterpreterTest, InterpreterBitwiseTypeFeedback) {
     Handle<Object> return_val =
         callable(arg1, arg2, arg3, arg4).ToHandleChecked();
     USE(return_val);
-    MaybeObject feedback0 = callable.vector().Get(slot0);
-    CHECK(feedback0->IsSmi());
-    CHECK_EQ(BinaryOperationFeedback::kSignedSmall, feedback0->ToSmi().value());
+    MaybeObject feedback0 = callable.vector()->Get(slot0);
+    CHECK(IsSmi(feedback0));
+    CHECK_EQ(BinaryOperationFeedback::kSignedSmall, feedback0.ToSmi().value());
 
-    MaybeObject feedback1 = callable.vector().Get(slot1);
-    CHECK(feedback1->IsSmi());
-    CHECK_EQ(BinaryOperationFeedback::kNumber, feedback1->ToSmi().value());
+    MaybeObject feedback1 = callable.vector()->Get(slot1);
+    CHECK(IsSmi(feedback1));
+    CHECK_EQ(BinaryOperationFeedback::kNumber, feedback1.ToSmi().value());
 
-    MaybeObject feedback2 = callable.vector().Get(slot2);
-    CHECK(feedback2->IsSmi());
-    CHECK_EQ(BinaryOperationFeedback::kAny, feedback2->ToSmi().value());
+    MaybeObject feedback2 = callable.vector()->Get(slot2);
+    CHECK(IsSmi(feedback2));
+    CHECK_EQ(BinaryOperationFeedback::kAny, feedback2.ToSmi().value());
   }
 }
 
@@ -1371,7 +1371,7 @@ TEST_F(InterpreterTest, InterpreterCall) {
         "  this.func = function(a, b) { return a - b; }"
         "})()");
     Handle<Object> return_val = callable(object).ToHandleChecked();
-    CHECK(return_val->SameValue(Smi::FromInt(40)));
+    CHECK(Object::SameValue(*return_val, Smi::FromInt(40)));
   }
 
   // Check with 10 parameters (+ receiver).
@@ -1429,7 +1429,7 @@ TEST_F(InterpreterTest, InterpreterCall) {
     Handle<Object> return_val = callable(object).ToHandleChecked();
     Handle<i::String> expected =
         factory->NewStringFromAsciiChecked("prefix_abcdefghij");
-    CHECK(i::String::cast(*return_val).Equals(*expected));
+    CHECK(i::String::cast(*return_val)->Equals(*expected));
   }
 }
 
@@ -1743,14 +1743,14 @@ TEST_F(InterpreterTest, InterpreterSmiComparisons) {
         InterpreterTester tester(i_isolate(), bytecode_array, metadata);
         auto callable = tester.GetCallable<>();
         Handle<Object> return_value = callable().ToHandleChecked();
-        CHECK(return_value->IsBoolean());
-        CHECK_EQ(return_value->BooleanValue(i_isolate()),
+        CHECK(IsBoolean(*return_value));
+        CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
                  CompareC(comparison, inputs[i], inputs[j]));
         if (tester.HasFeedbackMetadata()) {
-          MaybeObject feedback = callable.vector().Get(slot);
-          CHECK(feedback->IsSmi());
+          MaybeObject feedback = callable.vector()->Get(slot);
+          CHECK(IsSmi(feedback));
           CHECK_EQ(CompareOperationFeedback::kSignedSmall,
-                   feedback->ToSmi().value());
+                   feedback.ToSmi().value());
         }
       }
     }
@@ -1792,14 +1792,13 @@ TEST_F(InterpreterTest, InterpreterHeapNumberComparisons) {
         InterpreterTester tester(i_isolate(), bytecode_array, metadata);
         auto callable = tester.GetCallable<>();
         Handle<Object> return_value = callable().ToHandleChecked();
-        CHECK(return_value->IsBoolean());
-        CHECK_EQ(return_value->BooleanValue(i_isolate()),
+        CHECK(IsBoolean(*return_value));
+        CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
                  CompareC(comparison, inputs[i], inputs[j]));
         if (tester.HasFeedbackMetadata()) {
-          MaybeObject feedback = callable.vector().Get(slot);
-          CHECK(feedback->IsSmi());
-          CHECK_EQ(CompareOperationFeedback::kNumber,
-                   feedback->ToSmi().value());
+          MaybeObject feedback = callable.vector()->Get(slot);
+          CHECK(IsSmi(feedback));
+          CHECK_EQ(CompareOperationFeedback::kNumber, feedback.ToSmi().value());
         }
       }
     }
@@ -1837,14 +1836,14 @@ TEST_F(InterpreterTest, InterpreterBigIntComparisons) {
         InterpreterTester tester(i_isolate(), bytecode_array, metadata);
         auto callable = tester.GetCallable<>();
         Handle<Object> return_value = callable().ToHandleChecked();
-        CHECK(return_value->IsBoolean());
+        CHECK(IsBoolean(*return_value));
         if (tester.HasFeedbackMetadata()) {
-          MaybeObject feedback = callable.vector().Get(slot);
-          CHECK(feedback->IsSmi());
+          MaybeObject feedback = callable.vector()->Get(slot);
+          CHECK(IsSmi(feedback));
           // TODO(panq): Create a standalone unit test for kBigInt64.
           CHECK(CompareOperationFeedback::kBigInt64 ==
-                    feedback->ToSmi().value() ||
-                CompareOperationFeedback::kBigInt == feedback->ToSmi().value());
+                    feedback.ToSmi().value() ||
+                CompareOperationFeedback::kBigInt == feedback.ToSmi().value());
         }
       }
     }
@@ -1861,7 +1860,6 @@ TEST_F(InterpreterTest, InterpreterStringComparisons) {
         AstValueFactory ast_factory(zone(), i_isolate()->ast_string_constants(),
                                     HashSeed(i_isolate()));
 
-        CanonicalHandleScope canonical(i_isolate());
         const char* lhs = inputs[i].c_str();
         const char* rhs = inputs[j].c_str();
 
@@ -1884,17 +1882,17 @@ TEST_F(InterpreterTest, InterpreterStringComparisons) {
         InterpreterTester tester(i_isolate(), bytecode_array, metadata);
         auto callable = tester.GetCallable<>();
         Handle<Object> return_value = callable().ToHandleChecked();
-        CHECK(return_value->IsBoolean());
-        CHECK_EQ(return_value->BooleanValue(i_isolate()),
+        CHECK(IsBoolean(*return_value));
+        CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
                  CompareC(comparison, inputs[i], inputs[j]));
         if (tester.HasFeedbackMetadata()) {
-          MaybeObject feedback = callable.vector().Get(slot);
-          CHECK(feedback->IsSmi());
+          MaybeObject feedback = callable.vector()->Get(slot);
+          CHECK(IsSmi(feedback));
           int const expected_feedback =
               Token::IsOrderedRelationalCompareOp(comparison)
                   ? CompareOperationFeedback::kString
                   : CompareOperationFeedback::kInternalizedString;
-          CHECK_EQ(expected_feedback, feedback->ToSmi().value());
+          CHECK_EQ(expected_feedback, feedback.ToSmi().value());
         }
       }
     }
@@ -1995,12 +1993,12 @@ TEST_F(InterpreterTest, InterpreterMixedComparisons) {
             InterpreterTester tester(i_isolate(), bytecode_array, metadata);
             auto callable = tester.GetCallable<>();
             Handle<Object> return_value = callable().ToHandleChecked();
-            CHECK(return_value->IsBoolean());
-            CHECK_EQ(return_value->BooleanValue(i_isolate()),
+            CHECK(IsBoolean(*return_value));
+            CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
                      CompareC(comparison, lhs, rhs, true));
             if (tester.HasFeedbackMetadata()) {
-              MaybeObject feedback = callable.vector().Get(slot);
-              CHECK(feedback->IsSmi());
+              MaybeObject feedback = callable.vector()->Get(slot);
+              CHECK(IsSmi(feedback));
               if (kComparisonTypes[c] == Token::Value::EQ) {
                 // For sloppy equality, we have more precise feedback.
                 CHECK_EQ(
@@ -2008,11 +2006,11 @@ TEST_F(InterpreterTest, InterpreterMixedComparisons) {
                         (string_type == kInternalizedStringConstant
                              ? CompareOperationFeedback::kInternalizedString
                              : CompareOperationFeedback::kString),
-                    feedback->ToSmi().value());
+                    feedback.ToSmi().value());
               } else {
                 // Comparison with a number and string collects kAny feedback.
                 CHECK_EQ(CompareOperationFeedback::kAny,
-                         feedback->ToSmi().value());
+                         feedback.ToSmi().value());
               }
             }
           }
@@ -2043,8 +2041,8 @@ TEST_F(InterpreterTest, InterpreterStrictNotEqual) {
 
       Handle<Object> return_value =
           callable(lhs_obj, rhs_obj).ToHandleChecked();
-      CHECK(return_value->IsBoolean());
-      CHECK_EQ(return_value->BooleanValue(i_isolate()),
+      CHECK(IsBoolean(*return_value));
+      CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
                CompareC(Token::Value::NE_STRICT, lhs, rhs, true));
     }
   }
@@ -2060,8 +2058,8 @@ TEST_F(InterpreterTest, InterpreterStrictNotEqual) {
 
       Handle<Object> return_value =
           callable(lhs_obj, rhs_obj).ToHandleChecked();
-      CHECK(return_value->IsBoolean());
-      CHECK_EQ(return_value->BooleanValue(i_isolate()),
+      CHECK(IsBoolean(*return_value));
+      CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
                CompareC(Token::Value::NE_STRICT, inputs_str[i], inputs_str[j]));
     }
   }
@@ -2081,8 +2079,8 @@ TEST_F(InterpreterTest, InterpreterStrictNotEqual) {
 
       Handle<Object> return_value =
           callable(lhs_obj, rhs_obj).ToHandleChecked();
-      CHECK(return_value->IsBoolean());
-      CHECK_EQ(return_value->BooleanValue(i_isolate()),
+      CHECK(IsBoolean(*return_value));
+      CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
                CompareC(Token::Value::NE_STRICT, inputs_number[i],
                         inputs_number[j]));
     }
@@ -2134,8 +2132,8 @@ TEST_F(InterpreterTest, InterpreterCompareTypeOf) {
 
     for (size_t i = 0; i < arraysize(inputs); i++) {
       Handle<Object> return_value = callable(inputs[i].first).ToHandleChecked();
-      CHECK(return_value->IsBoolean());
-      CHECK_EQ(return_value->BooleanValue(i_isolate()),
+      CHECK(IsBoolean(*return_value));
+      CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
                inputs[i].second == literal_flag);
     }
   }
@@ -2170,8 +2168,8 @@ TEST_F(InterpreterTest, InterpreterInstanceOf) {
 
     Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray(i_isolate());
     Handle<Object> return_value = RunBytecode(bytecode_array, metadata);
-    CHECK(return_value->IsBoolean());
-    CHECK_EQ(return_value->BooleanValue(i_isolate()), expected_value);
+    CHECK(IsBoolean(*return_value));
+    CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()), expected_value);
   }
 }
 
@@ -2207,8 +2205,8 @@ TEST_F(InterpreterTest, InterpreterTestIn) {
     ast_factory.Internalize(i_isolate());
     Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray(i_isolate());
     Handle<Object> return_value = RunBytecode(bytecode_array, metadata);
-    CHECK(return_value->IsBoolean());
-    CHECK_EQ(return_value->BooleanValue(i_isolate()), expected_value);
+    CHECK(IsBoolean(*return_value));
+    CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()), expected_value);
   }
 }
 
@@ -2224,8 +2222,8 @@ TEST_F(InterpreterTest, InterpreterUnaryNot) {
     builder.Return();
     Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray(i_isolate());
     Handle<Object> return_value = RunBytecode(bytecode_array);
-    CHECK(return_value->IsBoolean());
-    CHECK_EQ(return_value->BooleanValue(i_isolate()), expected_value);
+    CHECK(IsBoolean(*return_value));
+    CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()), expected_value);
   }
 }
 
@@ -2253,8 +2251,8 @@ TEST_F(InterpreterTest, InterpreterUnaryNotNonBoolean) {
     builder.LogicalNot(ToBooleanMode::kConvertToBoolean).Return();
     Handle<BytecodeArray> bytecode_array = builder.ToBytecodeArray(i_isolate());
     Handle<Object> return_value = RunBytecode(bytecode_array);
-    CHECK(return_value->IsBoolean());
-    CHECK_EQ(return_value->BooleanValue(i_isolate()),
+    CHECK(IsBoolean(*return_value));
+    CHECK_EQ(Object::BooleanValue(*return_value, i_isolate()),
              object_type_tuples[i].second);
   }
 }
@@ -2334,7 +2332,7 @@ TEST_F(InterpreterTest, InterpreterRegExpLiterals) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*literals[i].second));
+    CHECK(Object::SameValue(*return_value, *literals[i].second));
   }
 }
 
@@ -2360,7 +2358,7 @@ TEST_F(InterpreterTest, InterpreterArrayLiterals) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*literals[i].second));
+    CHECK(Object::SameValue(*return_value, *literals[i].second));
   }
 }
 
@@ -2409,7 +2407,7 @@ TEST_F(InterpreterTest, InterpreterObjectLiterals) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*literals[i].second));
+    CHECK(Object::SameValue(*return_value, *literals[i].second));
   }
 }
 
@@ -2495,7 +2493,7 @@ TEST_F(InterpreterTest, InterpreterContextVariables) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*context_vars[i].second));
+    CHECK(Object::SameValue(*return_value, *context_vars[i].second));
   }
 }
 
@@ -2520,7 +2518,7 @@ TEST_F(InterpreterTest, InterpreterContextParameters) {
     Handle<Object> a2 = handle(Smi::FromInt(2), i_isolate());
     Handle<Object> a3 = handle(Smi::FromInt(3), i_isolate());
     Handle<i::Object> return_value = callable(a1, a2, a3).ToHandleChecked();
-    CHECK(return_value->SameValue(*context_params[i].second));
+    CHECK(Object::SameValue(*return_value, *context_params[i].second));
   }
 }
 
@@ -2549,7 +2547,7 @@ TEST_F(InterpreterTest, InterpreterOuterContextVariables) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*context_vars[i].second));
+    CHECK(Object::SameValue(*return_value, *context_vars[i].second));
   }
 }
 
@@ -2574,7 +2572,7 @@ TEST_F(InterpreterTest, InterpreterComma) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*literals[i].second));
+    CHECK(Object::SameValue(*return_value, *literals[i].second));
   }
 }
 
@@ -2599,7 +2597,7 @@ TEST_F(InterpreterTest, InterpreterLogicalOr) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*literals[i].second));
+    CHECK(Object::SameValue(*return_value, *literals[i].second));
   }
 }
 
@@ -2629,7 +2627,7 @@ TEST_F(InterpreterTest, InterpreterLogicalAnd) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*literals[i].second));
+    CHECK(Object::SameValue(*return_value, *literals[i].second));
   }
 }
 
@@ -2652,7 +2650,7 @@ TEST_F(InterpreterTest, InterpreterTryCatch) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*catches[i].second));
+    CHECK(Object::SameValue(*return_value, *catches[i].second));
   }
 }
 
@@ -2706,7 +2704,7 @@ TEST_F(InterpreterTest, InterpreterTryFinally) {
     InterpreterTester tester(i_isolate(), source.c_str());
     tester.GetCallable<>();
     Handle<Object> wrapped = v8::Utils::OpenHandle(*CompileRun(try_wrapper));
-    CHECK(wrapped->SameValue(*finallies[i].second));
+    CHECK(Object::SameValue(*wrapped, *finallies[i].second));
   }
 }
 
@@ -2734,7 +2732,7 @@ TEST_F(InterpreterTest, InterpreterThrow) {
     InterpreterTester tester(i_isolate(), source.c_str());
     tester.GetCallable<>();
     Handle<Object> thrown_obj = v8::Utils::OpenHandle(*CompileRun(try_wrapper));
-    CHECK(thrown_obj->SameValue(*throws[i].second));
+    CHECK(Object::SameValue(*thrown_obj, *throws[i].second));
   }
 }
 
@@ -2792,7 +2790,7 @@ TEST_F(InterpreterTest, InterpreterCountOperators) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*count_ops[i].second));
+    CHECK(Object::SameValue(*return_value, *count_ops[i].second));
   }
 }
 
@@ -2817,7 +2815,7 @@ TEST_F(InterpreterTest, InterpreterGlobalCountOperators) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*count_ops[i].second));
+    CHECK(Object::SameValue(*return_value, *count_ops[i].second));
   }
 }
 
@@ -2845,7 +2843,7 @@ TEST_F(InterpreterTest, InterpreterCompoundExpressions) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*compound_expr[i].second));
+    CHECK(Object::SameValue(*return_value, *compound_expr[i].second));
   }
 }
 
@@ -2864,7 +2862,7 @@ TEST_F(InterpreterTest, InterpreterGlobalCompoundExpressions) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*compound_expr[i].second));
+    CHECK(Object::SameValue(*return_value, *compound_expr[i].second));
   }
 }
 
@@ -2937,7 +2935,7 @@ TEST_F(InterpreterTest, InterpreterCreateArguments) {
         tester.GetCallable<Handle<Object>, Handle<Object>, Handle<Object>>();
     Handle<Object> return_val =
         callable(args[0], args[1], args[2]).ToHandleChecked();
-    CHECK(return_val->SameValue(*args[create_args[i].second]));
+    CHECK(Object::SameValue(*return_val, *args[create_args[i].second]));
   }
 }
 
@@ -2967,7 +2965,7 @@ TEST_F(InterpreterTest, InterpreterConditional) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*conditional[i].second));
+    CHECK(Object::SameValue(*return_value, *conditional[i].second));
   }
 }
 
@@ -3008,7 +3006,7 @@ TEST_F(InterpreterTest, InterpreterDelete) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*test_delete[i].second));
+    CHECK(Object::SameValue(*return_value, *test_delete[i].second));
   }
 
   // Test delete in strict mode
@@ -3020,7 +3018,7 @@ TEST_F(InterpreterTest, InterpreterDelete) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*test_delete[i].second));
+    CHECK(Object::SameValue(*return_value, *test_delete[i].second));
   }
 }
 
@@ -3056,7 +3054,7 @@ TEST_F(InterpreterTest, InterpreterDeleteSloppyUnqualifiedIdentifier) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*test_delete[i].second));
+    CHECK(Object::SameValue(*return_value, *test_delete[i].second));
   }
 }
 
@@ -3119,7 +3117,7 @@ TEST_F(InterpreterTest, InterpreterGlobalDelete) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*test_global_delete[i].second));
+    CHECK(Object::SameValue(*return_value, *test_global_delete[i].second));
   }
 }
 
@@ -3212,7 +3210,7 @@ TEST_F(InterpreterTest, InterpreterBasicLoops) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*loops[i].second));
+    CHECK(Object::SameValue(*return_value, *loops[i].second));
   }
 }
 
@@ -3398,8 +3396,7 @@ TEST_F(InterpreterTest, InterpreterForIn) {
       InterpreterTester tester(i_isolate(), function.c_str());
       auto callable = tester.GetCallable<>();
       Handle<Object> return_val = callable().ToHandleChecked();
-      CHECK_EQ(Handle<Smi>::cast(return_val)->value(),
-               for_in_samples[i].second);
+      CHECK_EQ(Smi::cast(*return_val).value(), for_in_samples[i].second);
     }
   }
 }
@@ -3507,7 +3504,7 @@ TEST_F(InterpreterTest, InterpreterForOf) {
     InterpreterTester tester(i_isolate(), for_of[i].first);
     auto callable = tester.GetCallable<>();
     Handle<Object> return_val = callable().ToHandleChecked();
-    CHECK(return_val->SameValue(*for_of[i].second));
+    CHECK(Object::SameValue(*return_val, *for_of[i].second));
   }
 }
 
@@ -3584,7 +3581,7 @@ TEST_F(InterpreterTest, InterpreterSwitch) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*switch_ops[i].second));
+    CHECK(Object::SameValue(*return_value, *switch_ops[i].second));
   }
 }
 
@@ -3615,7 +3612,7 @@ TEST_F(InterpreterTest, InterpreterSloppyThis) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*sloppy_this[i].second));
+    CHECK(Object::SameValue(*return_value, *sloppy_this[i].second));
   }
 }
 
@@ -3627,7 +3624,8 @@ TEST_F(InterpreterTest, InterpreterThisFunction) {
   auto callable = tester.GetCallable<>();
 
   Handle<i::Object> return_value = callable().ToHandleChecked();
-  CHECK(return_value->SameValue(*factory->NewStringFromStaticChars("f")));
+  CHECK(Object::SameValue(*return_value,
+                          *factory->NewStringFromStaticChars("f")));
 }
 
 TEST_F(InterpreterTest, InterpreterNewTarget) {
@@ -3642,7 +3640,8 @@ TEST_F(InterpreterTest, InterpreterNewTarget) {
 
   Handle<Object> new_target_name = v8::Utils::OpenHandle(
       *CompileRun("(function() { return (new f()).a.name; })();"));
-  CHECK(new_target_name->SameValue(*factory->NewStringFromStaticChars("f")));
+  CHECK(Object::SameValue(*new_target_name,
+                          *factory->NewStringFromStaticChars("f")));
 }
 
 TEST_F(InterpreterTest, InterpreterAssignmentInExpressions) {
@@ -3779,7 +3778,7 @@ TEST_F(InterpreterTest, InterpreterAssignmentInExpressions) {
     Handle<Object> return_val =
         callable(handle(Smi::FromInt(arg_value), i_isolate()))
             .ToHandleChecked();
-    CHECK_EQ(Handle<Smi>::cast(return_val)->value(), samples[i].second);
+    CHECK_EQ(Smi::cast(*return_val).value(), samples[i].second);
   }
 }
 
@@ -3819,7 +3818,7 @@ TEST_F(InterpreterTest, InterpreterToName) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*to_name_tests[i].second));
+    CHECK(Object::SameValue(*return_value, *to_name_tests[i].second));
   }
 }
 
@@ -3850,7 +3849,7 @@ TEST_F(InterpreterTest, TemporaryRegisterAllocation) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*reg_tests[i].second));
+    CHECK(Object::SameValue(*return_value, *reg_tests[i].second));
   }
 }
 
@@ -3886,7 +3885,7 @@ TEST_F(InterpreterTest, InterpreterLookupSlot) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*lookup_slot[i].second));
+    CHECK(Object::SameValue(*return_value, *lookup_slot[i].second));
   }
 }
 
@@ -3925,7 +3924,7 @@ TEST_F(InterpreterTest, InterpreterLookupContextSlot) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*std::get<2>(lookup_slot[i])));
+    CHECK(Object::SameValue(*return_value, *std::get<2>(lookup_slot[i])));
   }
 }
 
@@ -3963,7 +3962,7 @@ TEST_F(InterpreterTest, InterpreterLookupGlobalSlot) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*std::get<2>(lookup_slot[i])));
+    CHECK(Object::SameValue(*return_value, *std::get<2>(lookup_slot[i])));
   }
 }
 
@@ -3986,7 +3985,7 @@ TEST_F(InterpreterTest, InterpreterCallLookupSlot) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*call_lookup[i].second));
+    CHECK(Object::SameValue(*return_value, *call_lookup[i].second));
   }
 }
 
@@ -4027,7 +4026,7 @@ TEST_F(InterpreterTest, InterpreterLookupSlotWide) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*lookup_slot[i].second));
+    CHECK(Object::SameValue(*return_value, *lookup_slot[i].second));
   }
 }
 
@@ -4066,7 +4065,7 @@ TEST_F(InterpreterTest, InterpreterDeleteLookupSlot) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*delete_lookup_slot[i].second));
+    CHECK(Object::SameValue(*return_value, *delete_lookup_slot[i].second));
   }
 }
 
@@ -4099,7 +4098,7 @@ TEST_F(InterpreterTest, JumpWithConstantsAndWideConstants) {
       Handle<Object> argument = factory->NewNumberFromInt(a);
       Handle<Object> return_val = callable(argument).ToHandleChecked();
       static const int results[] = {11, 12, 2};
-      CHECK_EQ(Handle<Smi>::cast(return_val)->value(), results[a]);
+      CHECK_EQ(Smi::cast(*return_val).value(), results[a]);
     }
   }
 }
@@ -4146,7 +4145,7 @@ TEST_F(InterpreterTest, InterpreterEval) {
     InterpreterTester tester(i_isolate(), source.c_str());
     auto callable = tester.GetCallable<>();
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*eval[i].second));
+    CHECK(Object::SameValue(*return_value, *eval[i].second));
   }
 }
 
@@ -4170,7 +4169,7 @@ TEST_F(InterpreterTest, InterpreterEvalParams) {
 
     Handle<i::Object> return_value =
         callable(handle(Smi::FromInt(20), i_isolate())).ToHandleChecked();
-    CHECK(return_value->SameValue(*eval_params[i].second));
+    CHECK(Object::SameValue(*return_value, *eval_params[i].second));
   }
 }
 
@@ -4194,7 +4193,7 @@ TEST_F(InterpreterTest, InterpreterEvalGlobal) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*eval_global[i].second));
+    CHECK(Object::SameValue(*return_value, *eval_global[i].second));
   }
 }
 
@@ -4241,7 +4240,7 @@ TEST_F(InterpreterTest, InterpreterEvalVariableDecl) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*eval_global[i].second));
+    CHECK(Object::SameValue(*return_value, *eval_global[i].second));
   }
 }
 
@@ -4261,7 +4260,7 @@ TEST_F(InterpreterTest, InterpreterEvalFunctionDecl) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*eval_func_decl[i].second));
+    CHECK(Object::SameValue(*return_value, *eval_func_decl[i].second));
   }
 }
 
@@ -4299,7 +4298,7 @@ TEST_F(InterpreterTest, InterpreterWideRegisterArithmetic) {
   for (size_t i = 0; i < kMaxRegisterForTest; i++) {
     Handle<Object> arg = handle(Smi::FromInt(static_cast<int>(i)), i_isolate());
     Handle<Object> return_value = callable(arg).ToHandleChecked();
-    CHECK(return_value->SameValue(*arg));
+    CHECK(Object::SameValue(*return_value, *arg));
   }
 }
 
@@ -4356,8 +4355,8 @@ TEST_F(InterpreterTest, InterpreterWideParametersPickOne) {
     auto callable = tester.GetCallable<Handle<Object>>();
     Handle<Object> arg = handle(Smi::FromInt(0xAA55), i_isolate());
     Handle<Object> return_value = callable(arg).ToHandleChecked();
-    Handle<Smi> actual = Handle<Smi>::cast(return_value);
-    CHECK_EQ(actual->value(), parameter);
+    Tagged<Smi> actual = Smi::cast(*return_value);
+    CHECK_EQ(actual.value(), parameter);
   }
 }
 
@@ -4396,8 +4395,8 @@ TEST_F(InterpreterTest, InterpreterWideParametersSummation) {
     Handle<Object> arg = handle(Smi::FromInt(i), i_isolate());
     Handle<Object> return_value = callable(arg).ToHandleChecked();
     int expected = kBaseValue + i * (i + 1) / 2;
-    Handle<Smi> actual = Handle<Smi>::cast(return_value);
-    CHECK_EQ(actual->value(), expected);
+    Tagged<Smi> actual = Smi::cast(*return_value);
+    CHECK_EQ(actual.value(), expected);
   }
 }
 
@@ -4428,7 +4427,7 @@ TEST_F(InterpreterTest, InterpreterWithStatement) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*with_stmt[i].second));
+    CHECK(Object::SameValue(*return_value, *with_stmt[i].second));
   }
 }
 
@@ -4487,7 +4486,7 @@ TEST_F(InterpreterTest, InterpreterClassLiterals) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*examples[i].second));
+    CHECK(Object::SameValue(*return_value, *examples[i].second));
   }
 }
 
@@ -4544,7 +4543,7 @@ TEST_F(InterpreterTest, InterpreterClassAndSuperClass) {
     InterpreterTester tester(i_isolate(), source.c_str(), "*");
     auto callable = tester.GetCallable<>();
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*examples[i].second));
+    CHECK(Object::SameValue(*return_value, *examples[i].second));
   }
 }
 
@@ -4586,7 +4585,7 @@ TEST_F(InterpreterTest, InterpreterConstDeclaration) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*const_decl[i].second));
+    CHECK(Object::SameValue(*return_value, *const_decl[i].second));
   }
 
   // Tests for strict mode.
@@ -4598,7 +4597,7 @@ TEST_F(InterpreterTest, InterpreterConstDeclaration) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*const_decl[i].second));
+    CHECK(Object::SameValue(*return_value, *const_decl[i].second));
   }
 }
 
@@ -4623,7 +4622,7 @@ TEST_F(InterpreterTest, InterpreterConstDeclarationLookupSlots) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*const_decl[i].second));
+    CHECK(Object::SameValue(*return_value, *const_decl[i].second));
   }
 
   // Tests for strict mode.
@@ -4635,7 +4634,7 @@ TEST_F(InterpreterTest, InterpreterConstDeclarationLookupSlots) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*const_decl[i].second));
+    CHECK(Object::SameValue(*return_value, *const_decl[i].second));
   }
 }
 
@@ -4678,7 +4677,7 @@ TEST_F(InterpreterTest, InterpreterConstInLookupContextChain) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*const_decl[i].second));
+    CHECK(Object::SameValue(*return_value, *const_decl[i].second));
   }
 }
 
@@ -4737,7 +4736,7 @@ TEST_F(InterpreterTest, InterpreterGenerators) {
     auto callable = tester.GetCallable<>();
 
     Handle<i::Object> return_value = callable().ToHandleChecked();
-    CHECK(return_value->SameValue(*tests[i].second));
+    CHECK(Object::SameValue(*return_value, *tests[i].second));
   }
 }
 
@@ -4746,7 +4745,9 @@ TEST_F(InterpreterTest, InterpreterWithNativeStack) {
   // "Always sparkplug" messes with this test.
   if (v8_flags.always_sparkplug) return;
 
+  i::FakeCodeEventLogger code_event_logger(i_isolate());
   i::v8_flags.interpreted_frames_native_stack = true;
+  i_isolate()->v8_file_logger()->AddLogEventListener(&code_event_logger);
 
   const char* source_text =
       "function testInterpreterWithNativeStack(a,b) { return a + b };";
@@ -4759,14 +4760,16 @@ TEST_F(InterpreterTest, InterpreterWithNativeStack) {
 
   i::Handle<i::JSFunction> f = i::Handle<i::JSFunction>::cast(o);
 
-  CHECK(f->shared().HasBytecodeArray());
-  i::Code code = f->shared().GetCode(i_isolate());
+  CHECK(f->shared()->HasBytecodeArray());
+  i::Tagged<i::Code> code = f->shared()->GetCode(i_isolate());
   i::Handle<i::Code> interpreter_entry_trampoline =
       BUILTIN_CODE(i_isolate(), InterpreterEntryTrampoline);
 
-  CHECK(code.IsCode());
-  CHECK(code.is_interpreter_trampoline_builtin());
+  CHECK(IsCode(code));
+  CHECK(code->is_interpreter_trampoline_builtin());
   CHECK_NE(code.address(), interpreter_entry_trampoline->address());
+
+  i_isolate()->v8_file_logger()->RemoveLogEventListener(&code_event_logger);
 }
 #endif  // V8_TARGET_ARCH_ARM
 
@@ -4774,27 +4777,27 @@ TEST_F(InterpreterTest, InterpreterGetBytecodeHandler) {
   Interpreter* interpreter = i_isolate()->interpreter();
 
   // Test that single-width bytecode handlers deserializer correctly.
-  Code wide_handler =
+  Tagged<Code> wide_handler =
       interpreter->GetBytecodeHandler(Bytecode::kWide, OperandScale::kSingle);
 
-  CHECK_EQ(wide_handler.builtin_id(), Builtin::kWideHandler);
+  CHECK_EQ(wide_handler->builtin_id(), Builtin::kWideHandler);
 
-  Code add_handler =
+  Tagged<Code> add_handler =
       interpreter->GetBytecodeHandler(Bytecode::kAdd, OperandScale::kSingle);
 
-  CHECK_EQ(add_handler.builtin_id(), Builtin::kAddHandler);
+  CHECK_EQ(add_handler->builtin_id(), Builtin::kAddHandler);
 
   // Test that double-width bytecode handlers deserializer correctly, including
   // an illegal bytecode handler since there is no Wide.Wide handler.
-  Code wide_wide_handler =
+  Tagged<Code> wide_wide_handler =
       interpreter->GetBytecodeHandler(Bytecode::kWide, OperandScale::kDouble);
 
-  CHECK_EQ(wide_wide_handler.builtin_id(), Builtin::kIllegalHandler);
+  CHECK_EQ(wide_wide_handler->builtin_id(), Builtin::kIllegalHandler);
 
-  Code add_wide_handler =
+  Tagged<Code> add_wide_handler =
       interpreter->GetBytecodeHandler(Bytecode::kAdd, OperandScale::kDouble);
 
-  CHECK_EQ(add_wide_handler.builtin_id(), Builtin::kAddWideHandler);
+  CHECK_EQ(add_wide_handler->builtin_id(), Builtin::kAddWideHandler);
 }
 
 TEST_F(InterpreterTest, InterpreterCollectSourcePositions) {
@@ -4816,9 +4819,10 @@ TEST_F(InterpreterTest, InterpreterCollectSourcePositions) {
 
   Compiler::CollectSourcePositions(i_isolate(), sfi);
 
-  ByteArray source_position_table = bytecode_array->SourcePositionTable();
+  Tagged<ByteArray> source_position_table =
+      bytecode_array->SourcePositionTable();
   CHECK(bytecode_array->HasSourcePositionTable());
-  CHECK_GT(source_position_table.length(), 0);
+  CHECK_GT(source_position_table->length(), 0);
 }
 
 TEST_F(InterpreterTest, InterpreterCollectSourcePositions_StackOverflow) {
@@ -4844,16 +4848,17 @@ TEST_F(InterpreterTest, InterpreterCollectSourcePositions_StackOverflow) {
   i_isolate()->stack_guard()->SetStackLimit(GetCurrentStackPosition());
   Compiler::CollectSourcePositions(i_isolate(), sfi);
   // Stack overflowed so source position table can be returned but is empty.
-  ByteArray source_position_table = bytecode_array->SourcePositionTable();
+  Tagged<ByteArray> source_position_table =
+      bytecode_array->SourcePositionTable();
   CHECK(!bytecode_array->HasSourcePositionTable());
-  CHECK_EQ(source_position_table.length(), 0);
+  CHECK_EQ(source_position_table->length(), 0);
 
   // Reset the stack limit and try again.
   i_isolate()->stack_guard()->SetStackLimit(previous_limit);
   Compiler::CollectSourcePositions(i_isolate(), sfi);
   source_position_table = bytecode_array->SourcePositionTable();
   CHECK(bytecode_array->HasSourcePositionTable());
-  CHECK_GT(source_position_table.length(), 0);
+  CHECK_GT(source_position_table->length(), 0);
 }
 
 TEST_F(InterpreterTest, InterpreterCollectSourcePositions_ThrowFrom1stFrame) {
@@ -4978,24 +4983,25 @@ TEST_F(InterpreterTest, InterpreterCollectSourcePositions_GenerateStackTrace) {
   }
 
   CHECK(bytecode_array->HasSourcePositionTable());
-  ByteArray source_position_table = bytecode_array->SourcePositionTable();
-  CHECK_GT(source_position_table.length(), 0);
+  Tagged<ByteArray> source_position_table =
+      bytecode_array->SourcePositionTable();
+  CHECK_GT(source_position_table->length(), 0);
 }
 
 TEST_F(InterpreterTest, InterpreterLookupNameOfBytecodeHandler) {
   Interpreter* interpreter = i_isolate()->interpreter();
-  Code ldaLookupSlot = interpreter->GetBytecodeHandler(Bytecode::kLdaLookupSlot,
-                                                       OperandScale::kSingle);
+  Tagged<Code> ldaLookupSlot = interpreter->GetBytecodeHandler(
+      Bytecode::kLdaLookupSlot, OperandScale::kSingle);
   CheckStringEqual("LdaLookupSlotHandler",
-                   Builtins::name(ldaLookupSlot.builtin_id()));
-  Code wideLdaLookupSlot = interpreter->GetBytecodeHandler(
+                   Builtins::name(ldaLookupSlot->builtin_id()));
+  Tagged<Code> wideLdaLookupSlot = interpreter->GetBytecodeHandler(
       Bytecode::kLdaLookupSlot, OperandScale::kDouble);
   CheckStringEqual("LdaLookupSlotWideHandler",
-                   Builtins::name(wideLdaLookupSlot.builtin_id()));
-  Code extraWideLdaLookupSlot = interpreter->GetBytecodeHandler(
+                   Builtins::name(wideLdaLookupSlot->builtin_id()));
+  Tagged<Code> extraWideLdaLookupSlot = interpreter->GetBytecodeHandler(
       Bytecode::kLdaLookupSlot, OperandScale::kQuadruple);
   CheckStringEqual("LdaLookupSlotExtraWideHandler",
-                   Builtins::name(extraWideLdaLookupSlot.builtin_id()));
+                   Builtins::name(extraWideLdaLookupSlot->builtin_id()));
 }
 
 }  // namespace interpreter
diff --git a/deps/v8/test/unittests/interpreter/source-positions-unittest.cc b/deps/v8/test/unittests/interpreter/source-positions-unittest.cc
index cdba5378441b1e..3b3f0916080775 100644
--- a/deps/v8/test/unittests/interpreter/source-positions-unittest.cc
+++ b/deps/v8/test/unittests/interpreter/source-positions-unittest.cc
@@ -161,7 +161,7 @@ Handle<BytecodeArray> SourcePositionTest::MakeBytecode(
           .As<Function>();
   Handle<JSFunction> function =
       Handle<JSFunction>::cast(v8::Utils::OpenHandle(*api_function));
-  return handle(function->shared().GetBytecodeArray(i_isolate()), i_isolate());
+  return handle(function->shared()->GetBytecodeArray(i_isolate()), i_isolate());
 }
 
 void SourcePositionTest::SetOptimizationFlags(int optimization_bitmap) {
diff --git a/deps/v8/test/unittests/js-atomics/js-atomics-synchronization-primitive-unittest.cc b/deps/v8/test/unittests/js-atomics/js-atomics-synchronization-primitive-unittest.cc
index 0b952c6e95f9d6..bcc14c707c9a77 100644
--- a/deps/v8/test/unittests/js-atomics/js-atomics-synchronization-primitive-unittest.cc
+++ b/deps/v8/test/unittests/js-atomics/js-atomics-synchronization-primitive-unittest.cc
@@ -4,7 +4,7 @@
 
 #include "src/base/platform/platform.h"
 #include "src/base/platform/time.h"
-#include "src/heap/parked-scope.h"
+#include "src/heap/parked-scope-inl.h"
 #include "src/objects/js-atomics-synchronization-inl.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
@@ -19,26 +19,6 @@ using JSAtomicsConditionTest = TestJSSharedMemoryWithNativeContext;
 
 namespace {
 
-class IsolateWithContextWrapper final {
- public:
-  IsolateWithContextWrapper()
-      : isolate_wrapper_(kNoCounters),
-        isolate_scope_(isolate_wrapper_.isolate()),
-        handle_scope_(isolate_wrapper_.isolate()),
-        context_(v8::Context::New(isolate_wrapper_.isolate())),
-        context_scope_(context_) {}
-
-  v8::Isolate* v8_isolate() const { return isolate_wrapper_.isolate(); }
-  Isolate* isolate() const { return reinterpret_cast<Isolate*>(v8_isolate()); }
-
- private:
-  IsolateWrapper isolate_wrapper_;
-  v8::Isolate::Scope isolate_scope_;
-  v8::HandleScope handle_scope_;
-  v8::Local<v8::Context> context_;
-  v8::Context::Scope context_scope_;
-};
-
 class LockingThread final : public ParkingThread {
  public:
   LockingThread(Handle<JSAtomicsMutex> mutex, ParkingSemaphore* sema_ready,
@@ -103,10 +83,7 @@ TEST_F(JSAtomicsMutexTest, Contention) {
     sema_execute_complete.ParkedWait(local_isolate);
   }
 
-  ParkedScope parked(local_isolate);
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  ParkingThread::ParkedJoinAll(local_isolate, threads);
 
   EXPECT_FALSE(contended_mutex->IsHeld());
 }
@@ -199,10 +176,7 @@ TEST_F(JSAtomicsConditionTest, NotifyAll) {
     sema_execute_complete.ParkedWait(local_isolate);
   }
 
-  ParkedScope parked(local_isolate);
-  for (auto& thread : threads) {
-    thread->ParkedJoin(parked);
-  }
+  ParkingThread::ParkedJoinAll(local_isolate, threads);
 
   EXPECT_EQ(0U, waiting_threads_count);
   EXPECT_FALSE(mutex->IsHeld());
diff --git a/deps/v8/test/unittests/libplatform/single-threaded-default-platform-unittest.cc b/deps/v8/test/unittests/libplatform/single-threaded-default-platform-unittest.cc
index f6ef9834d2f0d6..1033fd7c7c5683 100644
--- a/deps/v8/test/unittests/libplatform/single-threaded-default-platform-unittest.cc
+++ b/deps/v8/test/unittests/libplatform/single-threaded-default-platform-unittest.cc
@@ -4,6 +4,7 @@
 
 #include "include/v8-platform.h"
 #include "src/init/v8.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -63,8 +64,8 @@ TEST_F(SingleThreadedDefaultPlatformTest, SingleThreadedDefaultPlatform) {
         "f();");
   }
 
-  CollectGarbage(i::NEW_SPACE);
-  CollectAllAvailableGarbage();
+  InvokeMinorGC(i_isolate());
+  InvokeMemoryReducingMajorGCs(i_isolate());
 }
 
 }  // namespace v8
diff --git a/deps/v8/test/unittests/libplatform/tracing-unittest.cc b/deps/v8/test/unittests/libplatform/tracing-unittest.cc
index b92fc34bb74d87..f7d8a195e11394 100644
--- a/deps/v8/test/unittests/libplatform/tracing-unittest.cc
+++ b/deps/v8/test/unittests/libplatform/tracing-unittest.cc
@@ -538,6 +538,22 @@ using TrackEvent = ::perfetto::protos::TrackEvent;
 
 class TestListener : public TraceEventListener {
  public:
+  void ParseFromArray(const std::vector<char>& array) {
+    perfetto::protos::Trace trace;
+    CHECK(trace.ParseFromArray(array.data(), static_cast<int>(array.size())));
+
+    for (int i = 0; i < trace.packet_size(); i++) {
+      // TODO(petermarshall): ChromeTracePacket instead.
+      const perfetto::protos::TracePacket& packet = trace.packet(i);
+      ProcessPacket(packet);
+    }
+  }
+
+  const std::string& get_event(size_t index) { return events_.at(index); }
+
+  size_t events_size() const { return events_.size(); }
+
+ private:
   void ProcessPacket(const ::perfetto::protos::TracePacket& packet) {
     if (packet.incremental_state_cleared()) {
       categories_.clear();
@@ -630,11 +646,6 @@ class TestListener : public TraceEventListener {
     events_.push_back(slice);
   }
 
-  const std::string& get_event(size_t index) { return events_.at(index); }
-
-  size_t events_size() const { return events_.size(); }
-
- private:
   std::vector<std::string> events_;
   std::map<uint64_t, std::string> categories_;
   std::map<uint64_t, std::string> event_names_;
diff --git a/deps/v8/test/unittests/logging/log-unittest.cc b/deps/v8/test/unittests/logging/log-unittest.cc
index fdeb11dda76d7a..1ecff11b91482f 100644
--- a/deps/v8/test/unittests/logging/log-unittest.cc
+++ b/deps/v8/test/unittests/logging/log-unittest.cc
@@ -327,7 +327,9 @@ TEST_F(TestWithIsolate, Issue23768) {
   i_isolate()->v8_file_logger()->LogCompiledFunctions();
 }
 
-static void ObjMethod1(const v8::FunctionCallbackInfo<v8::Value>& args) {}
+static void ObjMethod1(const v8::FunctionCallbackInfo<v8::Value>& info) {
+  CHECK(i::ValidateCallbackInfo(info));
+}
 
 TEST_F(LogTest, LogCallbacks) {
   {
@@ -439,30 +441,7 @@ TEST_F(LogTest, LogVersion) {
 // https://crbug.com/539892
 // CodeCreateEvents with really large names should not crash.
 TEST_F(LogTest, Issue539892) {
-  class FakeCodeEventLogger : public i::CodeEventLogger {
-   public:
-    explicit FakeCodeEventLogger(i::Isolate* isolate)
-        : CodeEventLogger(isolate) {}
-
-    void CodeMoveEvent(i::InstructionStream from,
-                       i::InstructionStream to) override {}
-    void BytecodeMoveEvent(i::BytecodeArray from,
-                           i::BytecodeArray to) override {}
-    void CodeDisableOptEvent(i::Handle<i::AbstractCode> code,
-                             i::Handle<i::SharedFunctionInfo> shared) override {
-    }
-
-   private:
-    void LogRecordedBuffer(i::AbstractCode code,
-                           i::MaybeHandle<i::SharedFunctionInfo> maybe_shared,
-                           const char* name, int length) override {}
-#if V8_ENABLE_WEBASSEMBLY
-    void LogRecordedBuffer(const i::wasm::WasmCode* code, const char* name,
-                           int length) override {}
-#endif  // V8_ENABLE_WEBASSEMBLY
-  };
-
-  FakeCodeEventLogger code_event_logger(i_isolate());
+  i::FakeCodeEventLogger code_event_logger(i_isolate());
 
   {
     ScopedLoggerInitializer logger(isolate());
@@ -504,7 +483,7 @@ class LogAllTest : public LogTest {
     i::v8_flags.log_all = true;
     i::v8_flags.log_deopt = true;
     i::v8_flags.turbo_inlining = false;
-    i::v8_flags.log_internal_timer_events = true;
+    i::v8_flags.log_timer_events = true;
     i::v8_flags.allow_natives_syntax = true;
     LogTest::SetUpTestSuite();
   }
@@ -828,6 +807,9 @@ TEST_F(LogExternalInterpretedFramesNativeStackTest,
     v8::Local<v8::Context> context = v8::Context::New(isolate());
     context->Enter();
 
+    i::FakeCodeEventLogger code_event_logger(i_isolate());
+    i_isolate()->v8_file_logger()->AddLogEventListener(&code_event_logger);
+
     TestCodeEventHandler code_event_handler(isolate());
 
     const char* source_text_before_start =
@@ -859,6 +841,7 @@ TEST_F(LogExternalInterpretedFramesNativeStackTest,
         1);
 
     context->Exit();
+    i_isolate()->v8_file_logger()->RemoveLogEventListener(&code_event_logger);
   }
 }
 #endif  // V8_TARGET_ARCH_ARM
@@ -920,14 +903,14 @@ void ValidateMapDetailsLogging(v8::Isolate* isolate,
   i::HeapObjectIterator iterator(heap);
   i::DisallowGarbageCollection no_gc;
   size_t i = 0;
-  for (i::HeapObject obj = iterator.Next(); !obj.is_null();
+  for (i::Tagged<i::HeapObject> obj = iterator.Next(); !obj.is_null();
        obj = iterator.Next()) {
-    if (!obj.IsMap()) continue;
+    if (!IsMap(obj)) continue;
     i++;
     uintptr_t address = obj.ptr();
     if (map_create_addresses.find(address) == map_create_addresses.end()) {
       // logger->PrintLog();
-      i::Map::cast(obj).Print();
+      i::Print(i::Map::cast(obj));
       FATAL(
           "Map (%p, #%zu) creation not logged during startup with "
           "--log-maps!"
@@ -937,7 +920,7 @@ void ValidateMapDetailsLogging(v8::Isolate* isolate,
     } else if (map_details_addresses.find(address) ==
                map_details_addresses.end()) {
       // logger->PrintLog();
-      i::Map::cast(obj).Print();
+      i::Print(i::Map::cast(obj));
       FATAL(
           "Map (%p, #%zu) details not logged during startup with "
           "--log-maps!"
@@ -1092,7 +1075,15 @@ TEST_F(LogMapsTest, LogMapsDetailsContexts) {
   }
 }
 
-TEST_F(LogTest, ConsoleTimeEvents) {
+class LogTimerTest : public LogTest {
+ public:
+  static void SetUpTestSuite() {
+    i::v8_flags.log_timer_events = true;
+    LogTest::SetUpTestSuite();
+  }
+};
+
+TEST_F(LogTimerTest, ConsoleTimeEvents) {
   {
     ScopedLoggerInitializer logger(isolate());
     {
@@ -1222,12 +1213,14 @@ TEST_F(LogTest, BuiltinsNotLoggedAsLazyCompile) {
 
     // Should only be logged as "Builtin" with a name, never as "Function".
     v8::base::SNPrintF(buffer, ",0x%" V8PRIxPTR ",%d,BooleanConstructor",
-                       builtin->InstructionStart(), builtin->InstructionSize());
+                       builtin->instruction_start(),
+                       builtin->instruction_size());
     CHECK(logger.ContainsLine(
         {"code-creation,Builtin,2,", std::string(buffer.begin())}));
 
     v8::base::SNPrintF(buffer, ",0x%" V8PRIxPTR ",%d,",
-                       builtin->InstructionStart(), builtin->InstructionSize());
+                       builtin->instruction_start(),
+                       builtin->instruction_size());
     CHECK(!logger.ContainsLine(
         {"code-creation,JS,2,", std::string(buffer.begin())}));
   }
diff --git a/deps/v8/test/unittests/logging/runtime-call-stats-unittest.cc b/deps/v8/test/unittests/logging/runtime-call-stats-unittest.cc
index fdde4441a28e18..82c506fdf83e10 100644
--- a/deps/v8/test/unittests/logging/runtime-call-stats-unittest.cc
+++ b/deps/v8/test/unittests/logging/runtime-call-stats-unittest.cc
@@ -10,6 +10,7 @@
 #include "src/api/api-inl.h"
 #include "src/base/atomic-utils.h"
 #include "src/base/platform/time.h"
+#include "src/common/globals.h"
 #include "src/flags/flags.h"
 #include "src/handles/handles-inl.h"
 #include "src/logging/counters.h"
@@ -47,6 +48,7 @@ class RuntimeCallStatsTest : public TestWithNativeContext {
     // Disable RuntimeCallStats before tearing down the isolate to prevent
     // printing the tests table. Comment the following line for debugging
     // purposes.
+    isolate()->AbortConcurrentOptimization(BlockingBehavior::kBlock);
     TracingFlags::runtime_stats.store(0, std::memory_order_relaxed);
   }
 
@@ -112,14 +114,25 @@ class V8_NODISCARD ElapsedTimeScope {
 // Temporarily use the default time source.
 class V8_NODISCARD NativeTimeScope {
  public:
-  NativeTimeScope() {
+  explicit NativeTimeScope(Isolate* isolate) : isolate_(isolate) {
+    // Make sure there are no concurrent optimizations which might be measuring
+    // RCS.
+    isolate_->AbortConcurrentOptimization(BlockingBehavior::kBlock);
+
     CHECK_EQ(RuntimeCallTimer::Now, &RuntimeCallStatsTestNow);
     RuntimeCallTimer::Now = &base::TimeTicks::Now;
   }
   ~NativeTimeScope() {
+    // Make sure there are no concurrent optimizations which might be measuring
+    // RCS.
+    isolate_->AbortConcurrentOptimization(BlockingBehavior::kBlock);
+
     CHECK_EQ(RuntimeCallTimer::Now, &base::TimeTicks::Now);
     RuntimeCallTimer::Now = &RuntimeCallStatsTestNow;
   }
+
+ private:
+  Isolate* isolate_;
 };
 
 }  // namespace
@@ -393,7 +406,7 @@ TEST_F(RuntimeCallStatsTest, BasicJavaScript) {
   EXPECT_EQ(0, counter->time().InMicroseconds());
 
   {
-    NativeTimeScope native_timer_scope;
+    NativeTimeScope native_timer_scope(i_isolate());
     RunJS("function f() { return 1; };");
   }
   EXPECT_EQ(1, counter->count());
@@ -401,7 +414,7 @@ TEST_F(RuntimeCallStatsTest, BasicJavaScript) {
   EXPECT_LT(0, time);
 
   {
-    NativeTimeScope native_timer_scope;
+    NativeTimeScope native_timer_scope(i_isolate());
     RunJS("f();");
   }
   EXPECT_EQ(2, counter->count());
@@ -417,7 +430,7 @@ TEST_F(RuntimeCallStatsTest, FunctionLengthGetter) {
   EXPECT_EQ(0, js_counter()->time().InMicroseconds());
 
   {
-    NativeTimeScope native_timer_scope;
+    NativeTimeScope native_timer_scope(i_isolate());
     RunJS("function f(array) { return array.length; };");
   }
   EXPECT_EQ(0, getter_counter->count());
@@ -427,7 +440,7 @@ TEST_F(RuntimeCallStatsTest, FunctionLengthGetter) {
   EXPECT_LT(0, js_time);
 
   {
-    NativeTimeScope native_timer_scope;
+    NativeTimeScope native_timer_scope(i_isolate());
     RunJS("f.length;");
   }
   EXPECT_EQ(1, getter_counter->count());
@@ -436,14 +449,14 @@ TEST_F(RuntimeCallStatsTest, FunctionLengthGetter) {
   EXPECT_LE(js_time, js_counter()->time().InMicroseconds());
 
   {
-    NativeTimeScope native_timer_scope;
+    NativeTimeScope native_timer_scope(i_isolate());
     RunJS("for (let i = 0; i < 50; i++) { f.length };");
   }
   EXPECT_EQ(51, getter_counter->count());
   EXPECT_EQ(3, js_counter()->count());
 
   {
-    NativeTimeScope native_timer_scope;
+    NativeTimeScope native_timer_scope(i_isolate());
     RunJS("for (let i = 0; i < 1000; i++) { f.length; };");
   }
   EXPECT_EQ(1051, getter_counter->count());
diff --git a/deps/v8/test/unittests/maglev/node-type-unittest.cc b/deps/v8/test/unittests/maglev/node-type-unittest.cc
new file mode 100644
index 00000000000000..ce34c2b1b5f836
--- /dev/null
+++ b/deps/v8/test/unittests/maglev/node-type-unittest.cc
@@ -0,0 +1,131 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#ifdef V8_ENABLE_MAGLEV
+
+#include "src/compiler/js-heap-broker.h"
+#include "src/execution/isolate.h"
+#include "src/handles/handles.h"
+#include "src/maglev/maglev-ir.h"
+#include "test/unittests/test-utils.h"
+#include "testing/gmock/include/gmock/gmock.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace v8 {
+namespace internal {
+namespace maglev {
+
+class MaglevTest : public TestWithNativeContextAndZone {
+ public:
+  MaglevTest();
+  ~MaglevTest() override;
+
+  compiler::JSHeapBroker* broker() { return &broker_; }
+
+ private:
+  compiler::JSHeapBroker broker_;
+  compiler::JSHeapBrokerScopeForTesting broker_scope_;
+  std::unique_ptr<PersistentHandlesScope> persistent_scope_;
+  compiler::CurrentHeapBrokerScope current_broker_;
+};
+
+MaglevTest::MaglevTest()
+    : TestWithNativeContextAndZone(kCompressGraphZone),
+      broker_(isolate(), zone(), v8_flags.trace_heap_broker, CodeKind::MAGLEV),
+      broker_scope_(&broker_, isolate(), zone()),
+      current_broker_(&broker_) {
+  // PersistentHandlesScope currently requires an active handle before it can
+  // be opened and they can't be nested.
+  // TODO(v8:13897): Remove once PersistentHandlesScopes can be opened
+  // uncontionally.
+  if (!PersistentHandlesScope::IsActive(isolate())) {
+    Handle<Object> dummy(ReadOnlyRoots(isolate()->heap()).empty_string(),
+                         isolate());
+    persistent_scope_ = std::make_unique<PersistentHandlesScope>(isolate());
+  }
+  broker()->SetTargetNativeContextRef(isolate()->native_context());
+}
+
+MaglevTest::~MaglevTest() {
+  if (persistent_scope_ != nullptr) {
+    persistent_scope_->Detach();
+  }
+}
+
+static std::initializer_list<NodeType> kAllNodeTypes{
+#define TYPE(Name, _) NodeType::k##Name,
+    NODE_TYPE_LIST(TYPE)
+#undef TYPE
+};
+
+inline constexpr bool IsKnownNodeTypeConstant(NodeType type) {
+  switch (type) {
+#define CASE(Name, _) case NodeType::k##Name:
+    NODE_TYPE_LIST(CASE)
+#undef CASE
+    return true;
+  }
+  return false;
+}
+
+// Ensures NodeTypes are closed under intersection modulo heap object bit.
+TEST_F(MaglevTest, NodeTypeIsClosedUnderIntersect) {
+  for (NodeType a : kAllNodeTypes) {
+    CHECK(IsKnownNodeTypeConstant(a));
+    for (NodeType b : kAllNodeTypes) {
+      NodeType combined = IntersectType(a, b);
+      // Somtimes the intersection keeps more information, e.g.
+      // Intersect(HeapNumber,Boolean) is a NumberOrOddball|HeapObject
+      NodeType combined_not_obj =
+          NodeType(static_cast<int>(combined) &
+                   ~static_cast<int>(NodeType::kAnyHeapObject));
+      CHECK(IsKnownNodeTypeConstant(combined) ||
+            IsKnownNodeTypeConstant(combined_not_obj));
+    }
+  }
+}
+
+// Ensure StaticTypeForMap is consistent with actual maps.
+TEST_F(MaglevTest, NodeTypeApproximationIsConsistent) {
+  for (auto idx = RootIndex::kFirstRoot; idx <= RootIndex::kLastRoot; ++idx) {
+    Tagged<Object> obj = isolate()->roots_table().slot(idx).load(isolate());
+    if (obj.ptr() == kNullAddress || !IsMap(obj)) continue;
+    Tagged<Map> map = Map::cast(obj);
+    compiler::MapRef map_ref = MakeRef(broker(), map);
+
+    for (NodeType a : kAllNodeTypes) {
+      bool isInstance = IsInstanceOfNodeType(map_ref, a, broker());
+      bool isSubtype = NodeTypeIs(StaticTypeForMap(map_ref), a);
+      CHECK_IMPLIES(isSubtype, isInstance);
+      CHECK_IMPLIES(!isInstance, !isSubtype);
+    }
+  }
+}
+
+// Ensure CombineType is consistent with actual maps.
+TEST_F(MaglevTest, NodeTypeCombineIsConsistent) {
+  for (auto idx = RootIndex::kFirstRoot; idx <= RootIndex::kLastRoot; ++idx) {
+    Tagged<Object> obj = isolate()->roots_table().slot(idx).load(isolate());
+    if (obj.ptr() == kNullAddress || !IsMap(obj)) continue;
+    Tagged<Map> map = Map::cast(obj);
+    compiler::MapRef map_ref = MakeRef(broker(), map);
+
+    for (NodeType a : kAllNodeTypes) {
+      for (NodeType b : kAllNodeTypes) {
+        NodeType combined_type = CombineType(a, b);
+
+        bool mapIsA = IsInstanceOfNodeType(map_ref, a, broker());
+        bool mapIsB = IsInstanceOfNodeType(map_ref, b, broker());
+        CHECK_EQ(IsInstanceOfNodeType(map_ref, combined_type, broker()),
+                 mapIsA && mapIsB);
+      }
+    }
+  }
+}
+
+}  // namespace maglev
+}  // namespace internal
+}  // namespace v8
+
+#endif  // V8_ENABLE_MAGLEV
diff --git a/deps/v8/test/unittests/numbers/conversions-unittest.cc b/deps/v8/test/unittests/numbers/conversions-unittest.cc
index 2ac238eaef1826..7251d3de180954 100644
--- a/deps/v8/test/unittests/numbers/conversions-unittest.cc
+++ b/deps/v8/test/unittests/numbers/conversions-unittest.cc
@@ -395,7 +395,7 @@ TEST_F(ConversionsTest, NoHandlesForTryNumberToSize) {
   size_t result = 0;
   {
     SealHandleScope no_handles(i_isolate());
-    Smi smi = Smi::FromInt(1);
+    Tagged<Smi> smi = Smi::FromInt(1);
     CHECK(TryNumberToSize(smi, &result));
     CHECK_EQ(result, 1u);
   }
diff --git a/deps/v8/test/unittests/objects/concurrent-descriptor-array-unittest.cc b/deps/v8/test/unittests/objects/concurrent-descriptor-array-unittest.cc
index ec8a3501808674..c6421911d4892f 100644
--- a/deps/v8/test/unittests/objects/concurrent-descriptor-array-unittest.cc
+++ b/deps/v8/test/unittests/objects/concurrent-descriptor-array-unittest.cc
@@ -49,7 +49,7 @@ class ConcurrentSearchThread final : public v8::base::Thread {
 
     for (Handle<JSObject> handle : handles_) {
       // Lookup the named property on the {map}.
-      EXPECT_TRUE(name_->IsUniqueName());
+      EXPECT_TRUE(IsUniqueName(*name_));
       Handle<Map> map(handle->map(), &local_heap);
 
       Handle<DescriptorArray> descriptors(
@@ -114,7 +114,7 @@ TEST_F(ConcurrentDescriptorArrayTest, LinearSearchFlatObject) {
                                                       filler_value, NONE)
         .Check();
   }
-  EXPECT_EQ(js_object->map().NumberOfOwnDescriptors(), 8);
+  EXPECT_EQ(js_object->map()->NumberOfOwnDescriptors(), 8);
 
   thread->Join();
 }
@@ -148,7 +148,7 @@ TEST_F(ConcurrentDescriptorArrayTest, LinearSearchFlatObject_ManyElements) {
                                                       filler_value, NONE)
         .Check();
   }
-  EXPECT_GT(js_object->map().NumberOfOwnDescriptors(), 8);
+  EXPECT_GT(js_object->map()->NumberOfOwnDescriptors(), 8);
 
   for (int i = 0; i < kNumHandles; i++) {
     handles.push_back(ph->NewHandle(js_object));
diff --git a/deps/v8/test/unittests/objects/concurrent-feedback-vector-unittest.cc b/deps/v8/test/unittests/objects/concurrent-feedback-vector-unittest.cc
index 9ed7e76ad36ba5..8251759a120906 100644
--- a/deps/v8/test/unittests/objects/concurrent-feedback-vector-unittest.cc
+++ b/deps/v8/test/unittests/objects/concurrent-feedback-vector-unittest.cc
@@ -74,7 +74,7 @@ class FeedbackVectorExplorationThread final : public v8::base::Thread {
         MapHandles maps;
         nexus.ExtractMaps(&maps);
         for (unsigned int j = 0; j < maps.size(); j++) {
-          EXPECT_TRUE(maps[j]->IsMap());
+          EXPECT_TRUE(IsMap(*maps[j]));
         }
       }
 
@@ -109,7 +109,7 @@ class FeedbackVectorExplorationThread final : public v8::base::Thread {
         EXPECT_EQ(state, InlineCacheState::MONOMORPHIC);
         MapHandles maps;
         nexus.ExtractMaps(&maps);
-        EXPECT_TRUE(maps[0]->IsMap());
+        EXPECT_TRUE(IsMap(*maps[0]));
       }
       vector_consumed_->Signal();
       vector_ready_->Wait();
@@ -121,7 +121,7 @@ class FeedbackVectorExplorationThread final : public v8::base::Thread {
         MapHandles maps;
         nexus.ExtractMaps(&maps);
         for (unsigned int i = 0; i < maps.size(); i++) {
-          EXPECT_TRUE(maps[i]->IsMap());
+          EXPECT_TRUE(IsMap(*maps[i]));
         }
       }
       vector_consumed_->Signal();
diff --git a/deps/v8/test/unittests/objects/concurrent-js-array-unittest.cc b/deps/v8/test/unittests/objects/concurrent-js-array-unittest.cc
index 4e989aaebb0e69..7d5058faf09026 100644
--- a/deps/v8/test/unittests/objects/concurrent-js-array-unittest.cc
+++ b/deps/v8/test/unittests/objects/concurrent-js-array-unittest.cc
@@ -55,7 +55,7 @@ class BackgroundThread final : public v8::base::Thread {
       Handle<JSArray> x = handles_[i];
       Handle<FixedArrayBase> elements =
           local_heap.NewPersistentHandle(x->elements(isolate, kRelaxedLoad));
-      ElementsKind elements_kind = x->map(isolate).elements_kind();
+      ElementsKind elements_kind = x->map(isolate)->elements_kind();
 
       // Mirroring the conditions in JSArrayRef::GetOwnCowElement.
       if (!IsSmiOrObjectElementsKind(elements_kind)) continue;
@@ -63,7 +63,7 @@ class BackgroundThread final : public v8::base::Thread {
         continue;
       }
 
-      base::Optional<Object> result =
+      base::Optional<Tagged<Object>> result =
           ConcurrentLookupIterator::TryGetOwnCowElement(
               isolate, FixedArray::cast(*elements), elements_kind,
               Smi::ToInt(x->length(isolate, kRelaxedLoad)), kIndex);
@@ -71,7 +71,7 @@ class BackgroundThread final : public v8::base::Thread {
       if (result.has_value()) {
         // On any success, the elements at index 1 must be the original value
         // Smi(1).
-        EXPECT_TRUE(result.value().IsSmi());
+        EXPECT_TRUE(IsSmi(result.value()));
         CHECK_EQ(Smi::ToInt(result.value()), 1);
       }
     }
@@ -100,7 +100,7 @@ TEST_F(ConcurrentJsArrayTest, ArrayWithCowElements) {
   for (int i = 0; i < kNumArrays; i++) {
     Handle<JSArray> x =
         Handle<JSArray>::cast(Utils::OpenHandle(*RunJS("xs[i++] = f();")));
-    EXPECT_EQ(x->elements().map(),
+    EXPECT_EQ(x->elements()->map(),
               ReadOnlyRoots(i_isolate()).fixed_cow_array_map());
     handles.push_back(x);
     persistent_handles.push_back(ph->NewHandle(x));
@@ -126,7 +126,7 @@ TEST_F(ConcurrentJsArrayTest, ArrayWithCowElements) {
 
   for (int i = kNumArrays - 1; i >= 0; i--) {
     RunJS(kMutators[i % kNumMutators]);
-    EXPECT_NE(handles[i]->elements().map(),
+    EXPECT_NE(handles[i]->elements()->map(),
               ReadOnlyRoots(i_isolate()).fixed_cow_array_map());
   }
 
diff --git a/deps/v8/test/unittests/objects/concurrent-prototype-unittest.cc b/deps/v8/test/unittests/objects/concurrent-prototype-unittest.cc
index 8a440ce387ce5b..aa0a831c24daba 100644
--- a/deps/v8/test/unittests/objects/concurrent-prototype-unittest.cc
+++ b/deps/v8/test/unittests/objects/concurrent-prototype-unittest.cc
@@ -49,10 +49,10 @@ class ConcurrentSearchThread final : public v8::base::Thread {
     for (Handle<JSObject> js_obj : handles_) {
       // Walk up the prototype chain all the way to the top.
       Handle<Map> map(js_obj->map(kAcquireLoad), &local_heap);
-      while (!map->prototype().IsNull()) {
-        Handle<Map> map_prototype_map(map->prototype().map(kAcquireLoad),
+      while (!IsNull(map->prototype())) {
+        Handle<Map> map_prototype_map(map->prototype()->map(kAcquireLoad),
                                       &local_heap);
-        if (!map_prototype_map->IsJSObjectMap()) {
+        if (!IsJSObjectMap(*map_prototype_map)) {
           break;
         }
         map = map_prototype_map;
@@ -175,8 +175,8 @@ TEST_F(ConcurrentPrototypeTest, ProtoWalkBackground_PrototypeChainWrite) {
   // times.
   Handle<Map> map(js_object->map(), i_isolate());
   Handle<HeapObject> old_proto(map->prototype(), i_isolate());
-  DCHECK(!old_proto->IsNull());
-  Handle<HeapObject> new_proto(old_proto->map().prototype(), i_isolate());
+  DCHECK(!IsNull(*old_proto));
+  Handle<HeapObject> new_proto(old_proto->map()->prototype(), i_isolate());
 
   sema_started.Wait();
 
diff --git a/deps/v8/test/unittests/objects/concurrent-script-context-table-unittest.cc b/deps/v8/test/unittests/objects/concurrent-script-context-table-unittest.cc
index b5a2e1cb1d32b8..0e457f8937d010 100644
--- a/deps/v8/test/unittests/objects/concurrent-script-context-table-unittest.cc
+++ b/deps/v8/test/unittests/objects/concurrent-script-context-table-unittest.cc
@@ -45,8 +45,8 @@ class ScriptContextTableAccessUsedThread final : public v8::base::Thread {
     sema_started_->Signal();
 
     for (int i = 0; i < script_context_table_->used(kAcquireLoad); ++i) {
-      Context context = script_context_table_->get_context(i);
-      EXPECT_TRUE(context.IsScriptContext());
+      Tagged<Context> context = script_context_table_->get_context(i);
+      EXPECT_TRUE(context->IsScriptContext());
     }
   }
 
diff --git a/deps/v8/test/unittests/objects/concurrent-string-unittest.cc b/deps/v8/test/unittests/objects/concurrent-string-unittest.cc
index 919b9097d26056..aba15f3cadbd21 100644
--- a/deps/v8/test/unittests/objects/concurrent-string-unittest.cc
+++ b/deps/v8/test/unittests/objects/concurrent-string-unittest.cc
@@ -113,8 +113,8 @@ TEST_F(ConcurrentStringTest, InspectOneByteExternalizing) {
   Handle<String> one_byte_string = factory->InternalizeString(
       factory->NewStringFromAsciiChecked(raw_string));
   EXPECT_TRUE(one_byte_string->IsOneByteRepresentation());
-  EXPECT_TRUE(!one_byte_string->IsExternalString());
-  EXPECT_TRUE(one_byte_string->IsInternalizedString());
+  EXPECT_TRUE(!IsExternalString(*one_byte_string));
+  EXPECT_TRUE(IsInternalizedString(*one_byte_string));
 
   Handle<String> persistent_string = ph->NewHandle(one_byte_string);
 
@@ -136,48 +136,8 @@ TEST_F(ConcurrentStringTest, InspectOneByteExternalizing) {
   // ownership of raw_string otherwise.
   EXPECT_TRUE(one_byte_string->MakeExternal(
       new TestOneByteResource(i::StrDup(raw_string))));
-  EXPECT_TRUE(one_byte_string->IsExternalOneByteString());
-  EXPECT_TRUE(one_byte_string->IsInternalizedString());
-
-  thread->Join();
-}
-
-// Inspect a one byte string, while the main thread externalizes it into a two
-// bytes string.
-TEST_F(ConcurrentStringTest, InspectOneIntoTwoByteExternalizing) {
-  std::unique_ptr<PersistentHandles> ph = i_isolate()->NewPersistentHandles();
-
-  auto factory = i_isolate()->factory();
-  HandleScope handle_scope(i_isolate());
-
-  // Crate an internalized one-byte string.
-  const char* raw_string = STRING_VALUE;
-  Handle<String> one_byte_string = factory->InternalizeString(
-      factory->NewStringFromAsciiChecked(raw_string));
-  EXPECT_TRUE(one_byte_string->IsOneByteRepresentation());
-  EXPECT_TRUE(!one_byte_string->IsExternalString());
-  EXPECT_TRUE(one_byte_string->IsInternalizedString());
-
-  Handle<String> persistent_string = ph->NewHandle(one_byte_string);
-  std::vector<uint16_t> chars;
-  for (int i = 0; i < one_byte_string->length(); ++i) {
-    chars.push_back(one_byte_string->Get(i));
-  }
-
-  base::Semaphore sema_started(0);
-
-  std::unique_ptr<ConcurrentStringThread> thread(new ConcurrentStringThread(
-      i_isolate(), persistent_string, std::move(ph), &sema_started, chars));
-  EXPECT_TRUE(thread->Start());
-
-  sema_started.Wait();
-
-  // Externalize it to a two-bytes external string. AsciiToTwoByteString does
-  // the string duplication for us.
-  EXPECT_TRUE(one_byte_string->MakeExternal(
-      new TestTwoByteResource(AsciiToTwoByteString(raw_string))));
-  EXPECT_TRUE(one_byte_string->IsExternalTwoByteString());
-  EXPECT_TRUE(one_byte_string->IsInternalizedString());
+  EXPECT_TRUE(IsExternalOneByteString(*one_byte_string));
+  EXPECT_TRUE(IsInternalizedString(*one_byte_string));
 
   thread->Join();
 }
@@ -205,8 +165,8 @@ TEST_F(ConcurrentStringTest, InspectTwoByteExternalizing) {
   }
   two_bytes_string = factory->InternalizeString(two_bytes_string);
   EXPECT_TRUE(two_bytes_string->IsTwoByteRepresentation());
-  EXPECT_TRUE(!two_bytes_string->IsExternalString());
-  EXPECT_TRUE(two_bytes_string->IsInternalizedString());
+  EXPECT_TRUE(!IsExternalString(*two_bytes_string));
+  EXPECT_TRUE(IsInternalizedString(*two_bytes_string));
 
   Handle<String> persistent_string = ph->NewHandle(two_bytes_string);
   std::vector<uint16_t> chars;
@@ -224,8 +184,8 @@ TEST_F(ConcurrentStringTest, InspectTwoByteExternalizing) {
   // Externalize it to a two-bytes external string.
   EXPECT_TRUE(two_bytes_string->MakeExternal(
       new TestTwoByteResource(AsciiToTwoByteString(raw_string))));
-  EXPECT_TRUE(two_bytes_string->IsExternalTwoByteString());
-  EXPECT_TRUE(two_bytes_string->IsInternalizedString());
+  EXPECT_TRUE(IsExternalTwoByteString(*two_bytes_string));
+  EXPECT_TRUE(IsInternalizedString(*two_bytes_string));
 
   thread->Join();
 }
@@ -245,18 +205,18 @@ TEST_F(ConcurrentStringTest, InspectOneByteExternalizing_ThinString) {
   // Create a string.
   const char* raw_string = STRING_VALUE;
   Handle<String> thin_string = factory->NewStringFromAsciiChecked(raw_string);
-  EXPECT_TRUE(!thin_string->IsExternalString());
-  EXPECT_TRUE(!thin_string->IsInternalizedString());
+  EXPECT_TRUE(!IsExternalString(*thin_string));
+  EXPECT_TRUE(!IsInternalizedString(*thin_string));
 
   // Crate an internalized one-byte version of that string string.
   Handle<String> internalized_string = factory->InternalizeString(thin_string);
   EXPECT_TRUE(internalized_string->IsOneByteRepresentation());
-  EXPECT_TRUE(!internalized_string->IsExternalString());
-  EXPECT_TRUE(internalized_string->IsInternalizedString());
+  EXPECT_TRUE(!IsExternalString(*internalized_string));
+  EXPECT_TRUE(IsInternalizedString(*internalized_string));
 
   // We now should have an internalized string, and a thin string pointing to
   // it.
-  EXPECT_TRUE(thin_string->IsThinString());
+  EXPECT_TRUE(IsThinString(*thin_string));
   EXPECT_NE(*thin_string, *internalized_string);
 
   Handle<String> persistent_string = ph->NewHandle(thin_string);
@@ -279,73 +239,13 @@ TEST_F(ConcurrentStringTest, InspectOneByteExternalizing_ThinString) {
   // ownership of raw_string otherwise.
   EXPECT_TRUE(internalized_string->MakeExternal(
       new TestOneByteResource(i::StrDup(raw_string))));
-  EXPECT_TRUE(internalized_string->IsExternalOneByteString());
-  EXPECT_TRUE(internalized_string->IsInternalizedString());
-
-  // Check that the thin string is unmodified.
-  EXPECT_TRUE(!thin_string->IsExternalString());
-  EXPECT_TRUE(!thin_string->IsInternalizedString());
-  EXPECT_TRUE(thin_string->IsThinString());
-
-  thread->Join();
-}
-
-// Inspect a one byte string, while the main thread externalizes it into a two
-// bytes string. Same as InspectOneIntoTwoByteExternalizing, but using thin
-// strings.
-TEST_F(ConcurrentStringTest, InspectOneIntoTwoByteExternalizing_ThinString) {
-  // We will not create a thin string if single_generation is turned on.
-  if (v8_flags.single_generation) return;
-  // We don't create ThinStrings immediately when using the forwarding table.
-  if (v8_flags.always_use_string_forwarding_table) return;
-  std::unique_ptr<PersistentHandles> ph = i_isolate()->NewPersistentHandles();
-
-  auto factory = i_isolate()->factory();
-  HandleScope handle_scope(i_isolate());
-
-  // Create a string.
-  const char* raw_string = STRING_VALUE;
-  Handle<String> thin_string = factory->NewStringFromAsciiChecked(raw_string);
-  EXPECT_TRUE(thin_string->IsOneByteRepresentation());
-  EXPECT_TRUE(!thin_string->IsExternalString());
-  EXPECT_TRUE(!thin_string->IsInternalizedString());
-
-  // Crate an internalized one-byte version of that string string.
-  Handle<String> internalized_string = factory->InternalizeString(thin_string);
-  EXPECT_TRUE(internalized_string->IsOneByteRepresentation());
-  EXPECT_TRUE(!internalized_string->IsExternalString());
-  EXPECT_TRUE(internalized_string->IsInternalizedString());
-
-  // We now should have an internalized string, and a thin string pointing to
-  // it.
-  EXPECT_TRUE(thin_string->IsThinString());
-  EXPECT_NE(*thin_string, *internalized_string);
-
-  Handle<String> persistent_string = ph->NewHandle(thin_string);
-  std::vector<uint16_t> chars;
-  for (int i = 0; i < thin_string->length(); ++i) {
-    chars.push_back(thin_string->Get(i));
-  }
-
-  base::Semaphore sema_started(0);
-
-  std::unique_ptr<ConcurrentStringThread> thread(new ConcurrentStringThread(
-      i_isolate(), persistent_string, std::move(ph), &sema_started, chars));
-  EXPECT_TRUE(thread->Start());
-
-  sema_started.Wait();
-
-  // Externalize it to a two-bytes external string. AsciiToTwoByteString does
-  // the string duplication for us.
-  EXPECT_TRUE(internalized_string->MakeExternal(
-      new TestTwoByteResource(AsciiToTwoByteString(raw_string))));
-  EXPECT_TRUE(internalized_string->IsExternalTwoByteString());
-  EXPECT_TRUE(internalized_string->IsInternalizedString());
+  EXPECT_TRUE(IsExternalOneByteString(*internalized_string));
+  EXPECT_TRUE(IsInternalizedString(*internalized_string));
 
   // Check that the thin string is unmodified.
-  EXPECT_TRUE(!thin_string->IsExternalString());
-  EXPECT_TRUE(!thin_string->IsInternalizedString());
-  EXPECT_TRUE(thin_string->IsThinString());
+  EXPECT_TRUE(!IsExternalString(*thin_string));
+  EXPECT_TRUE(!IsInternalizedString(*thin_string));
+  EXPECT_TRUE(IsThinString(*thin_string));
 
   thread->Join();
 }
@@ -379,8 +279,8 @@ TEST_F(ConcurrentStringTest, InspectTwoByteExternalizing_ThinString) {
 
   Handle<String> internalized_string = factory->InternalizeString(thin_string);
   EXPECT_TRUE(internalized_string->IsTwoByteRepresentation());
-  EXPECT_TRUE(!internalized_string->IsExternalString());
-  EXPECT_TRUE(internalized_string->IsInternalizedString());
+  EXPECT_TRUE(!IsExternalString(*internalized_string));
+  EXPECT_TRUE(IsInternalizedString(*internalized_string));
 
   Handle<String> persistent_string = ph->NewHandle(thin_string);
   std::vector<uint16_t> chars;
@@ -398,13 +298,13 @@ TEST_F(ConcurrentStringTest, InspectTwoByteExternalizing_ThinString) {
   // Externalize it to a two-bytes external string.
   EXPECT_TRUE(internalized_string->MakeExternal(
       new TestTwoByteResource(AsciiToTwoByteString(raw_string))));
-  EXPECT_TRUE(internalized_string->IsExternalTwoByteString());
-  EXPECT_TRUE(internalized_string->IsInternalizedString());
+  EXPECT_TRUE(IsExternalTwoByteString(*internalized_string));
+  EXPECT_TRUE(IsInternalizedString(*internalized_string));
 
   // Check that the thin string is unmodified.
-  EXPECT_TRUE(!thin_string->IsExternalString());
-  EXPECT_TRUE(!thin_string->IsInternalizedString());
-  EXPECT_TRUE(thin_string->IsThinString());
+  EXPECT_TRUE(!IsExternalString(*thin_string));
+  EXPECT_TRUE(!IsInternalizedString(*thin_string));
+  EXPECT_TRUE(IsThinString(*thin_string));
 
   thread->Join();
 }
diff --git a/deps/v8/test/unittests/objects/concurrent-transition-array-unittest.cc b/deps/v8/test/unittests/objects/concurrent-transition-array-unittest.cc
index e6c8e445de4b50..91b168b8e1e6d5 100644
--- a/deps/v8/test/unittests/objects/concurrent-transition-array-unittest.cc
+++ b/deps/v8/test/unittests/objects/concurrent-transition-array-unittest.cc
@@ -44,7 +44,7 @@ class ConcurrentSearchThread : public v8::base::Thread {
 
     CHECK_EQ(TransitionsAccessor(heap_->isolate(), *map_, true)
                  .SearchTransition(*name_, PropertyKind::kData, NONE),
-             result_map_ ? **result_map_ : Map());
+             result_map_ ? **result_map_ : Tagged<Map>());
   }
 
   Heap* heap() { return heap_; }
@@ -83,7 +83,7 @@ class ConcurrentSearchOnOutdatedAccessorThread final
 
     CHECK_EQ(TransitionsAccessor(heap()->isolate(), *map_, true)
                  .SearchTransition(*name_, PropertyKind::kData, NONE),
-             result_map_ ? **result_map_ : Map());
+             result_map_ ? **result_map_ : Tagged<Map>());
   }
 
   base::Semaphore* main_thread_finished_;
diff --git a/deps/v8/test/unittests/objects/dictionary-unittest.cc b/deps/v8/test/unittests/objects/dictionary-unittest.cc
index 28bda6116f767e..d8398460d89233 100644
--- a/deps/v8/test/unittests/objects/dictionary-unittest.cc
+++ b/deps/v8/test/unittests/objects/dictionary-unittest.cc
@@ -56,7 +56,7 @@ class DictionaryTest : public TestWithHeapInternalsAndContext {
     CHECK_EQ(table->Lookup(b), roots.the_hole_value());
 
     // Keys still have to be valid after objects were moved.
-    CollectGarbage(NEW_SPACE);
+    InvokeMinorGC();
     CHECK_EQ(1, table->NumberOfElements());
     CHECK_EQ(table->Lookup(a), *b);
     CHECK_EQ(table->Lookup(b), roots.the_hole_value());
@@ -82,17 +82,17 @@ class DictionaryTest : public TestWithHeapInternalsAndContext {
       CHECK_EQ(table->NumberOfElements(), i + 1);
       CHECK(table->FindEntry(isolate(), key).is_found());
       CHECK_EQ(table->Lookup(key), *value);
-      CHECK(key->GetIdentityHash().IsSmi());
+      CHECK(IsSmi(key->GetIdentityHash()));
     }
 
     // Keys never added to the map which already have an identity hash
     // code should not be found.
     for (int i = 0; i < 100; i++) {
       Handle<JSReceiver> key = factory->NewJSArray(7);
-      CHECK(key->GetOrCreateIdentityHash(isolate()).IsSmi());
+      CHECK(IsSmi(key->GetOrCreateIdentityHash(isolate())));
       CHECK(table->FindEntry(isolate(), key).is_not_found());
       CHECK_EQ(table->Lookup(key), roots.the_hole_value());
-      CHECK(key->GetIdentityHash().IsSmi());
+      CHECK(IsSmi(key->GetIdentityHash()));
     }
 
     // Keys that don't have an identity hash should not be found and also
@@ -100,7 +100,7 @@ class DictionaryTest : public TestWithHeapInternalsAndContext {
     for (int i = 0; i < 100; i++) {
       Handle<JSReceiver> key = factory->NewJSArray(7);
       CHECK_EQ(table->Lookup(key), roots.the_hole_value());
-      Object identity_hash = key->GetIdentityHash();
+      Tagged<Object> identity_hash = key->GetIdentityHash();
       CHECK_EQ(roots.undefined_value(), identity_hash);
     }
   }
@@ -117,7 +117,7 @@ class DictionaryTest : public TestWithHeapInternalsAndContext {
     CHECK(!table->Has(isolate(), b));
 
     // Keys still have to be valid after objects were moved.
-    CollectGarbage(NEW_SPACE);
+    InvokeMinorGC();
     CHECK_EQ(1, table->NumberOfElements());
     CHECK(table->Has(isolate(), a));
     CHECK(!table->Has(isolate(), b));
@@ -144,16 +144,16 @@ class DictionaryTest : public TestWithHeapInternalsAndContext {
       table = HashSet::Add(isolate(), table, key);
       CHECK_EQ(table->NumberOfElements(), i + 2);
       CHECK(table->Has(isolate(), key));
-      CHECK(key->GetIdentityHash().IsSmi());
+      CHECK(IsSmi(key->GetIdentityHash()));
     }
 
     // Keys never added to the map which already have an identity hash
     // code should not be found.
     for (int i = 0; i < 100; i++) {
       Handle<JSReceiver> key = factory->NewJSArray(7);
-      CHECK(key->GetOrCreateIdentityHash(isolate()).IsSmi());
+      CHECK(IsSmi(key->GetOrCreateIdentityHash(isolate())));
       CHECK(!table->Has(isolate(), key));
-      CHECK(key->GetIdentityHash().IsSmi());
+      CHECK(IsSmi(key->GetIdentityHash()));
     }
 
     // Keys that don't have an identity hash should not be found and also
@@ -161,7 +161,7 @@ class DictionaryTest : public TestWithHeapInternalsAndContext {
     for (int i = 0; i < 100; i++) {
       Handle<JSReceiver> key = factory->NewJSArray(7);
       CHECK(!table->Has(isolate(), key));
-      Object identity_hash = key->GetIdentityHash();
+      Tagged<Object> identity_hash = key->GetIdentityHash();
       CHECK_EQ(ReadOnlyRoots(heap()).undefined_value(), identity_hash);
     }
   }
@@ -210,7 +210,7 @@ class DictionaryTest : public TestWithHeapInternalsAndContext {
     SimulateFullSpace(heap()->old_space());
 
     // Calling Lookup() should not cause GC ever.
-    CHECK(table->Lookup(key).IsTheHole(isolate()));
+    CHECK(IsTheHole(table->Lookup(key), isolate()));
 
     // Calling Put() should request GC by returning a failure.
     int gc_count = heap()->gc_count();
@@ -228,21 +228,31 @@ TEST_F(DictionaryTest, HashSet) {
   TestHashSet(ObjectHashSet::New(isolate(), 23));
 }
 
-class ObjectHashTableTest : public ObjectHashTable {
+class ObjectHashTableTest {
  public:
-  explicit ObjectHashTableTest(ObjectHashTable o) : ObjectHashTable(o) {}
+  explicit ObjectHashTableTest(Tagged<ObjectHashTable> o) : table_(o) {}
+
+  // For every object, add a `->` operator which returns a pointer to this
+  // object. This will allow smoother transition between T and Tagged<T>.
+  ObjectHashTableTest* operator->() { return this; }
+  const ObjectHashTableTest* operator->() const { return this; }
 
   void insert(InternalIndex entry, int key, int value) {
-    set(EntryToIndex(entry), Smi::FromInt(key));
-    set(EntryToIndex(entry) + 1, Smi::FromInt(value));
+    table_->set(table_->EntryToIndex(entry), Smi::FromInt(key));
+    table_->set(table_->EntryToIndex(entry) + 1, Smi::FromInt(value));
   }
 
   int lookup(int key, Isolate* isolate) {
     Handle<Object> key_obj(Smi::FromInt(key), isolate);
-    return Smi::ToInt(Lookup(key_obj));
+    return Smi::ToInt(table_->Lookup(key_obj));
   }
 
-  int capacity() { return Capacity(); }
+  int capacity() { return table_->Capacity(); }
+
+  void Rehash(Isolate* isolate) { table_->Rehash(isolate); }
+
+ private:
+  Tagged<ObjectHashTable> table_;
 };
 
 TEST_F(DictionaryTest, HashTableRehash) {
@@ -250,26 +260,26 @@ TEST_F(DictionaryTest, HashTableRehash) {
   {
     Handle<ObjectHashTable> table = ObjectHashTable::New(isolate(), 100);
     ObjectHashTableTest t(*table);
-    int capacity = t.capacity();
+    int capacity = t->capacity();
     for (int i = 0; i < capacity - 1; i++) {
-      t.insert(InternalIndex(i), i * i, i);
+      t->insert(InternalIndex(i), i * i, i);
     }
-    t.Rehash(isolate());
+    t->Rehash(isolate());
     for (int i = 0; i < capacity - 1; i++) {
-      CHECK_EQ(i, t.lookup(i * i, isolate()));
+      CHECK_EQ(i, t->lookup(i * i, isolate()));
     }
   }
   // Test half-filled table.
   {
     Handle<ObjectHashTable> table = ObjectHashTable::New(isolate(), 100);
     ObjectHashTableTest t(*table);
-    int capacity = t.capacity();
+    int capacity = t->capacity();
     for (int i = 0; i < capacity / 2; i++) {
-      t.insert(InternalIndex(i), i * i, i);
+      t->insert(InternalIndex(i), i * i, i);
     }
-    t.Rehash(isolate());
+    t->Rehash(isolate());
     for (int i = 0; i < capacity / 2; i++) {
-      CHECK_EQ(i, t.lookup(i * i, isolate()));
+      CHECK_EQ(i, t->lookup(i * i, isolate()));
     }
   }
 }
diff --git a/deps/v8/test/unittests/objects/elements-kind-unittest.cc b/deps/v8/test/unittests/objects/elements-kind-unittest.cc
index 398964eaf5a347..844d4331b5e0fd 100644
--- a/deps/v8/test/unittests/objects/elements-kind-unittest.cc
+++ b/deps/v8/test/unittests/objects/elements-kind-unittest.cc
@@ -116,8 +116,8 @@ TEST_F(ElementsKindTest, JSObjectAddingProperties) {
   JSObject::DefinePropertyOrElementIgnoreAttributes(object, name, value, NONE)
       .Check();
   CHECK_NE(object->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, object->map().elements_kind());
-  CHECK_LE(1, object->property_array().length());
+  CHECK_EQ(HOLEY_ELEMENTS, object->map()->elements_kind());
+  CHECK_LE(1, object->property_array()->length());
   CHECK(EQUALS(i_isolate(), object->elements(), empty_fixed_array));
 }
 
@@ -132,7 +132,7 @@ TEST_F(ElementsKindTest, JSObjectInObjectAddingProperties) {
   int nof_inobject_properties = 10;
   // force in object properties by changing the expected_nof_properties
   // (we always reserve 8 inobject properties slack on top).
-  function->shared().set_expected_nof_properties(nof_inobject_properties - 8);
+  function->shared()->set_expected_nof_properties(nof_inobject_properties - 8);
   Handle<Object> value(Smi::FromInt(42), i_isolate());
 
   Handle<JSObject> object = factory->NewJSObject(function);
@@ -149,7 +149,7 @@ TEST_F(ElementsKindTest, JSObjectInObjectAddingProperties) {
         .Check();
   }
   CHECK_NE(object->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, object->map().elements_kind());
+  CHECK_EQ(HOLEY_ELEMENTS, object->map()->elements_kind());
   CHECK(EQUALS(i_isolate(), object->property_array(), empty_property_array));
   CHECK(EQUALS(i_isolate(), object->elements(), empty_fixed_array));
 
@@ -160,9 +160,9 @@ TEST_F(ElementsKindTest, JSObjectInObjectAddingProperties) {
   JSObject::DefinePropertyOrElementIgnoreAttributes(object, name, value, NONE)
       .Check();
   CHECK_NE(object->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, object->map().elements_kind());
+  CHECK_EQ(HOLEY_ELEMENTS, object->map()->elements_kind());
   // there must be at least 1 element in the properies store
-  CHECK_LE(1, object->property_array().length());
+  CHECK_LE(1, object->property_array()->length());
   CHECK(EQUALS(i_isolate(), object->elements(), empty_fixed_array));
 }
 
@@ -189,9 +189,9 @@ TEST_F(ElementsKindTest, JSObjectAddingElements) {
       .Check();
   // no change in elements_kind => no map transition
   CHECK_EQ(object->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, object->map().elements_kind());
+  CHECK_EQ(HOLEY_ELEMENTS, object->map()->elements_kind());
   CHECK(EQUALS(i_isolate(), object->property_array(), empty_property_array));
-  CHECK_LE(1, object->elements().length());
+  CHECK_LE(1, object->elements()->length());
 
   // Adding more consecutive elements without a change in the backing store
   int non_dict_backing_store_limit = 100;
@@ -202,9 +202,9 @@ TEST_F(ElementsKindTest, JSObjectAddingElements) {
   }
   // no change in elements_kind => no map transition
   CHECK_EQ(object->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, object->map().elements_kind());
+  CHECK_EQ(HOLEY_ELEMENTS, object->map()->elements_kind());
   CHECK(EQUALS(i_isolate(), object->property_array(), empty_property_array));
-  CHECK_LE(non_dict_backing_store_limit, object->elements().length());
+  CHECK_LE(non_dict_backing_store_limit, object->elements()->length());
 
   // Adding an element at an very large index causes a change to
   // DICTIONARY_ELEMENTS
@@ -213,9 +213,9 @@ TEST_F(ElementsKindTest, JSObjectAddingElements) {
       .Check();
   // change in elements_kind => map transition
   CHECK_NE(object->map(), *previous_map);
-  CHECK_EQ(DICTIONARY_ELEMENTS, object->map().elements_kind());
+  CHECK_EQ(DICTIONARY_ELEMENTS, object->map()->elements_kind());
   CHECK(EQUALS(i_isolate(), object->property_array(), empty_property_array));
-  CHECK_LE(non_dict_backing_store_limit, object->elements().length());
+  CHECK_LE(non_dict_backing_store_limit, object->elements()->length());
 }
 
 TEST_F(ElementsKindTest, JSArrayAddingProperties) {
@@ -241,8 +241,8 @@ TEST_F(ElementsKindTest, JSArrayAddingProperties) {
       .Check();
   // No change in elements_kind but added property => new map
   CHECK_NE(array->map(), *previous_map);
-  CHECK_EQ(PACKED_SMI_ELEMENTS, array->map().elements_kind());
-  CHECK_LE(1, array->property_array().length());
+  CHECK_EQ(PACKED_SMI_ELEMENTS, array->map()->elements_kind());
+  CHECK_LE(1, array->property_array()->length());
   CHECK(EQUALS(i_isolate(), array->elements(), empty_fixed_array));
   CHECK_EQ(0, Smi::ToInt(array->length()));
 }
@@ -270,9 +270,9 @@ TEST_F(ElementsKindTest, JSArrayAddingElements) {
       .Check();
   // no change in elements_kind => no map transition
   CHECK_EQ(array->map(), *previous_map);
-  CHECK_EQ(PACKED_SMI_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(PACKED_SMI_ELEMENTS, array->map()->elements_kind());
   CHECK(EQUALS(i_isolate(), array->property_array(), empty_property_array));
-  CHECK_LE(1, array->elements().length());
+  CHECK_LE(1, array->elements()->length());
   CHECK_EQ(1, Smi::ToInt(array->length()));
 
   // Adding more consecutive elements without a change in the backing store
@@ -284,9 +284,9 @@ TEST_F(ElementsKindTest, JSArrayAddingElements) {
   }
   // no change in elements_kind => no map transition
   CHECK_EQ(array->map(), *previous_map);
-  CHECK_EQ(PACKED_SMI_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(PACKED_SMI_ELEMENTS, array->map()->elements_kind());
   CHECK(EQUALS(i_isolate(), array->property_array(), empty_property_array));
-  CHECK_LE(non_dict_backing_store_limit, array->elements().length());
+  CHECK_LE(non_dict_backing_store_limit, array->elements()->length());
   CHECK_EQ(non_dict_backing_store_limit, Smi::ToInt(array->length()));
 
   // Adding an element at an very large index causes a change to
@@ -297,10 +297,10 @@ TEST_F(ElementsKindTest, JSArrayAddingElements) {
       .Check();
   // change in elements_kind => map transition
   CHECK_NE(array->map(), *previous_map);
-  CHECK_EQ(DICTIONARY_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(DICTIONARY_ELEMENTS, array->map()->elements_kind());
   CHECK(EQUALS(i_isolate(), array->property_array(), empty_property_array));
-  CHECK_LE(non_dict_backing_store_limit, array->elements().length());
-  CHECK_LE(array->elements().length(), index);
+  CHECK_LE(non_dict_backing_store_limit, array->elements()->length());
+  CHECK_LE(array->elements()->length(), index);
   CHECK_EQ(index + 1, Smi::ToInt(array->length()));
 }
 
@@ -326,14 +326,14 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingiFastSmiElements) {
       .Check();
   // no change in elements_kind => no map transition
   CHECK_EQ(array->map(), *previous_map);
-  CHECK_EQ(PACKED_SMI_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(PACKED_SMI_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(1, Smi::ToInt(array->length()));
 
   // `delete array[0]` does not alter length, but changes the elments_kind
   name = MakeString("0");
   CHECK(JSReceiver::DeletePropertyOrElement(array, name).FromMaybe(false));
   CHECK_NE(array->map(), *previous_map);
-  CHECK_EQ(HOLEY_SMI_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(HOLEY_SMI_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(1, Smi::ToInt(array->length()));
   previous_map = handle(array->map(), i_isolate());
 
@@ -347,7 +347,7 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingiFastSmiElements) {
                                                     NONE)
       .Check();
   CHECK_EQ(array->map(), *previous_map);
-  CHECK_EQ(HOLEY_SMI_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(HOLEY_SMI_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(2, Smi::ToInt(array->length()));
 
   // Adding a string to the array changes from FAST_HOLEY_SMI to FAST_HOLEY
@@ -356,7 +356,7 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingiFastSmiElements) {
                                                     NONE)
       .Check();
   CHECK_NE(array->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(HOLEY_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(2, Smi::ToInt(array->length()));
   previous_map = handle(array->map(), i_isolate());
 
@@ -396,14 +396,14 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingFastElements) {
       .Check();
   // no change in elements_kind => no map transition
   CHECK_EQ(array->map(), *previous_map);
-  CHECK_EQ(PACKED_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(PACKED_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(1, Smi::ToInt(array->length()));
 
   // `delete array[0]` does not alter length, but changes the elments_kind
   name = MakeString("0");
   CHECK(JSReceiver::DeletePropertyOrElement(array, name).FromMaybe(false));
   CHECK_NE(array->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(HOLEY_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(1, Smi::ToInt(array->length()));
   previous_map = handle(array->map(), i_isolate());
 
@@ -417,7 +417,7 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingFastElements) {
                                                     NONE)
       .Check();
   CHECK_EQ(array->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(HOLEY_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(2, Smi::ToInt(array->length()));
 }
 
@@ -440,7 +440,7 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingiFastDoubleElements) {
                                                     NONE)
       .Check();
   CHECK_NE(array->map(), *previous_map);
-  CHECK_EQ(PACKED_DOUBLE_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(PACKED_DOUBLE_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(1, Smi::ToInt(array->length()));
   previous_map = handle(array->map(), i_isolate());
 
@@ -450,14 +450,14 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingiFastDoubleElements) {
                                                     NONE)
       .Check();
   CHECK_EQ(array->map(), *previous_map);
-  CHECK_EQ(PACKED_DOUBLE_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(PACKED_DOUBLE_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(2, Smi::ToInt(array->length()));
 
   // `delete array[0]` does not alter length, but changes the elments_kind
   name = MakeString("0");
   CHECK(JSReceiver::DeletePropertyOrElement(array, name).FromMaybe(false));
   CHECK_NE(array->map(), *previous_map);
-  CHECK_EQ(HOLEY_DOUBLE_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(HOLEY_DOUBLE_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(2, Smi::ToInt(array->length()));
   previous_map = handle(array->map(), i_isolate());
 
@@ -467,7 +467,7 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingiFastDoubleElements) {
                                                     NONE)
       .Check();
   CHECK_EQ(array->map(), *previous_map);
-  CHECK_EQ(HOLEY_DOUBLE_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(HOLEY_DOUBLE_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(2, Smi::ToInt(array->length()));
 
   // Adding a string to the array changes to elements_kind PACKED_ELEMENTS
@@ -476,7 +476,7 @@ TEST_F(ElementsKindTest, JSArrayAddingElementsGeneralizingiFastDoubleElements) {
                                                     NONE)
       .Check();
   CHECK_NE(array->map(), *previous_map);
-  CHECK_EQ(HOLEY_ELEMENTS, array->map().elements_kind());
+  CHECK_EQ(HOLEY_ELEMENTS, array->map()->elements_kind());
   CHECK_EQ(2, Smi::ToInt(array->length()));
   previous_map = handle(array->map(), i_isolate());
 
diff --git a/deps/v8/test/unittests/objects/feedback-vector-unittest.cc b/deps/v8/test/unittests/objects/feedback-vector-unittest.cc
index c9eedf28b54cfb..5d39e7a2c7615a 100644
--- a/deps/v8/test/unittests/objects/feedback-vector-unittest.cc
+++ b/deps/v8/test/unittests/objects/feedback-vector-unittest.cc
@@ -85,8 +85,8 @@ TEST_F(FeedbackVectorTest, VectorStructure) {
     spec.AddForInSlot();
     vector = NewFeedbackVector(isolate, &spec);
     FeedbackVectorHelper helper(vector);
-    FeedbackCell cell = *vector->GetClosureFeedbackCell(0);
-    CHECK_EQ(cell.value(), *factory->undefined_value());
+    Tagged<FeedbackCell> cell = *vector->GetClosureFeedbackCell(0);
+    CHECK_EQ(cell->value(), *factory->undefined_value());
   }
 }
 
@@ -167,7 +167,7 @@ TEST_F(FeedbackVectorTest, VectorCallICStates) {
   CHECK_EQ(InlineCacheState::GENERIC, nexus.ic_state());
 
   // After a collection, state should remain GENERIC.
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK_EQ(InlineCacheState::GENERIC, nexus.ic_state());
 }
 
@@ -194,8 +194,8 @@ TEST_F(FeedbackVectorTest, VectorCallICStateApply) {
   FeedbackNexus nexus(feedback_vector, slot);
   CHECK_EQ(InlineCacheState::MONOMORPHIC, nexus.ic_state());
   CHECK_EQ(CallFeedbackContent::kReceiver, nexus.GetCallFeedbackContent());
-  HeapObject heap_object;
-  CHECK(nexus.GetFeedback()->GetHeapObjectIfWeak(&heap_object));
+  Tagged<HeapObject> heap_object;
+  CHECK(nexus.GetFeedback().GetHeapObjectIfWeak(&heap_object));
   CHECK_EQ(*F, heap_object);
 
   TryRunJS(
@@ -203,7 +203,7 @@ TEST_F(FeedbackVectorTest, VectorCallICStateApply) {
       "foo();");
   CHECK_EQ(InlineCacheState::MONOMORPHIC, nexus.ic_state());
   CHECK_EQ(CallFeedbackContent::kTarget, nexus.GetCallFeedbackContent());
-  CHECK(nexus.GetFeedback()->GetHeapObjectIfWeak(&heap_object));
+  CHECK(nexus.GetFeedback().GetHeapObjectIfWeak(&heap_object));
   CHECK_EQ(*isolate->function_prototype_apply(), heap_object);
 
   TryRunJS(
@@ -233,11 +233,11 @@ TEST_F(FeedbackVectorTest, VectorCallFeedback) {
   FeedbackNexus nexus(feedback_vector, slot);
 
   CHECK_EQ(InlineCacheState::MONOMORPHIC, nexus.ic_state());
-  HeapObject heap_object;
-  CHECK(nexus.GetFeedback()->GetHeapObjectIfWeak(&heap_object));
+  Tagged<HeapObject> heap_object;
+  CHECK(nexus.GetFeedback().GetHeapObjectIfWeak(&heap_object));
   CHECK_EQ(*foo, heap_object);
 
-  CollectAllGarbage();
+  InvokeMajorGC();
   // It should stay monomorphic even after a GC.
   CHECK_EQ(InlineCacheState::MONOMORPHIC, nexus.ic_state());
 }
@@ -265,9 +265,9 @@ TEST_F(FeedbackVectorTest, VectorPolymorphicCallFeedback) {
   FeedbackNexus nexus(feedback_vector, slot);
 
   CHECK_EQ(InlineCacheState::POLYMORPHIC, nexus.ic_state());
-  HeapObject heap_object;
-  CHECK(nexus.GetFeedback()->GetHeapObjectIfWeak(&heap_object));
-  CHECK(heap_object.IsFeedbackCell(isolate));
+  Tagged<HeapObject> heap_object;
+  CHECK(nexus.GetFeedback().GetHeapObjectIfWeak(&heap_object));
+  CHECK(IsFeedbackCell(heap_object, isolate));
   // Ensure this is the feedback cell for the closure returned by
   // foo_maker.
   CHECK_EQ(heap_object, a_foo->raw_feedback_cell());
@@ -293,11 +293,11 @@ TEST_F(FeedbackVectorTest, VectorCallFeedbackForArray) {
   FeedbackNexus nexus(feedback_vector, slot);
 
   CHECK_EQ(InlineCacheState::MONOMORPHIC, nexus.ic_state());
-  HeapObject heap_object;
-  CHECK(nexus.GetFeedback()->GetHeapObjectIfWeak(&heap_object));
+  Tagged<HeapObject> heap_object;
+  CHECK(nexus.GetFeedback().GetHeapObjectIfWeak(&heap_object));
   CHECK_EQ(*isolate->array_function(), heap_object);
 
-  CollectAllGarbage();
+  InvokeMajorGC();
   // It should stay monomorphic even after a GC.
   CHECK_EQ(InlineCacheState::MONOMORPHIC, nexus.ic_state());
 }
@@ -484,7 +484,7 @@ TEST_F(FeedbackVectorTest, VectorLoadICStates) {
   CHECK(nexus.GetFirstMap().is_null());
 
   // After a collection, state should not be reset to PREMONOMORPHIC.
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK_EQ(InlineCacheState::MEGAMORPHIC, nexus.ic_state());
 }
 
@@ -546,7 +546,7 @@ TEST_F(FeedbackVectorTest, VectorLoadICOnSmi) {
   FeedbackNexus nexus(feedback_vector, slot);
   CHECK_EQ(InlineCacheState::MONOMORPHIC, nexus.ic_state());
   // Verify that the monomorphic map is the one we expect.
-  Map number_map = ReadOnlyRoots(heap).heap_number_map();
+  Tagged<Map> number_map = ReadOnlyRoots(heap).heap_number_map();
   CHECK_EQ(number_map, nexus.GetFirstMap());
 
   // Now go polymorphic on o.
diff --git a/deps/v8/test/unittests/objects/hashcode-unittest.cc b/deps/v8/test/unittests/objects/hashcode-unittest.cc
index 1091d2f075c287..3df90c28e2a433 100644
--- a/deps/v8/test/unittests/objects/hashcode-unittest.cc
+++ b/deps/v8/test/unittests/objects/hashcode-unittest.cc
@@ -34,48 +34,49 @@ class HashcodeTest : public TestWithContext {
 
   int AddToSetAndGetHash(Handle<JSObject> obj, bool has_fast_properties) {
     CHECK_EQ(has_fast_properties, obj->HasFastProperties());
-    CHECK_EQ(ReadOnlyRoots(i_isolate()).undefined_value(), obj->GetHash());
+    CHECK_EQ(ReadOnlyRoots(i_isolate()).undefined_value(),
+             Object::GetHash(*obj));
     Handle<OrderedHashSet> set = i_isolate()->factory()->NewOrderedHashSet();
     OrderedHashSet::Add(i_isolate(), set, obj);
     CHECK_EQ(has_fast_properties, obj->HasFastProperties());
-    return Smi::ToInt(obj->GetHash());
+    return Smi::ToInt(Object::GetHash(*obj));
   }
 
   int GetPropertyDictionaryHash(Handle<JSObject> obj) {
     if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-      return obj->property_dictionary_swiss().Hash();
+      return obj->property_dictionary_swiss()->Hash();
     } else {
-      return obj->property_dictionary().Hash();
+      return obj->property_dictionary()->Hash();
     }
   }
 
   int GetPropertyDictionaryLength(Handle<JSObject> obj) {
     if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-      return obj->property_dictionary_swiss().Capacity();
+      return obj->property_dictionary_swiss()->Capacity();
     } else {
-      return obj->property_dictionary().length();
+      return obj->property_dictionary()->length();
     }
   }
 
   void CheckIsDictionaryModeObject(Handle<JSObject> obj) {
     if (V8_ENABLE_SWISS_NAME_DICTIONARY_BOOL) {
-      CHECK(obj->raw_properties_or_hash().IsSwissNameDictionary());
+      CHECK(IsSwissNameDictionary(obj->raw_properties_or_hash()));
     } else {
-      CHECK(obj->raw_properties_or_hash().IsNameDictionary());
+      CHECK(IsNameDictionary(obj->raw_properties_or_hash()));
     }
   }
 
   void CheckFastObject(Handle<JSObject> obj, int hash) {
     CHECK(obj->HasFastProperties());
-    CHECK(obj->raw_properties_or_hash().IsPropertyArray());
-    CHECK_EQ(Smi::FromInt(hash), obj->GetHash());
-    CHECK_EQ(hash, obj->property_array().Hash());
+    CHECK(IsPropertyArray(obj->raw_properties_or_hash()));
+    CHECK_EQ(Smi::FromInt(hash), Object::GetHash(*obj));
+    CHECK_EQ(hash, obj->property_array()->Hash());
   }
 
   void CheckDictionaryObject(Handle<JSObject> obj, int hash) {
     CHECK(!obj->HasFastProperties());
     CheckIsDictionaryModeObject(obj);
-    CHECK_EQ(Smi::FromInt(hash), obj->GetHash());
+    CHECK_EQ(Smi::FromInt(hash), Object::GetHash(*obj));
     CHECK_EQ(hash, GetPropertyDictionaryHash(obj));
   }
 };
@@ -139,9 +140,9 @@ TEST_F(HashcodeTest, TransitionFastWithInObjectToFastWithPropertyArray) {
   int hash = AddToSetAndGetHash(obj, true);
   CHECK_EQ(Smi::FromInt(hash), obj->raw_properties_or_hash());
 
-  int length = obj->property_array().length();
+  int length = obj->property_array()->length();
   RunJS("x.e = 5;");
-  CHECK(obj->property_array().length() > length);
+  CHECK(obj->property_array()->length() > length);
   CheckFastObject(obj, hash);
 }
 
@@ -152,14 +153,14 @@ TEST_F(HashcodeTest, TransitionFastWithPropertyArray) {
   RunJS(source);
 
   Handle<JSObject> obj = GetGlobal<JSObject>("x");
-  CHECK(obj->raw_properties_or_hash().IsPropertyArray());
+  CHECK(IsPropertyArray(obj->raw_properties_or_hash()));
 
   int hash = AddToSetAndGetHash(obj, true);
-  CHECK_EQ(hash, obj->property_array().Hash());
+  CHECK_EQ(hash, obj->property_array()->Hash());
 
-  int length = obj->property_array().length();
+  int length = obj->property_array()->length();
   RunJS("x.f = 2; x.g = 5; x.h = 2");
-  CHECK(obj->property_array().length() > length);
+  CHECK(obj->property_array()->length() > length);
   CheckFastObject(obj, hash);
 }
 
@@ -170,11 +171,11 @@ TEST_F(HashcodeTest, TransitionFastWithPropertyArrayToSlow) {
   RunJS(source);
 
   Handle<JSObject> obj = GetGlobal<JSObject>("x");
-  CHECK(obj->raw_properties_or_hash().IsPropertyArray());
+  CHECK(IsPropertyArray(obj->raw_properties_or_hash()));
 
   int hash = AddToSetAndGetHash(obj, true);
-  CHECK(obj->raw_properties_or_hash().IsPropertyArray());
-  CHECK_EQ(hash, obj->property_array().Hash());
+  CHECK(IsPropertyArray(obj->raw_properties_or_hash()));
+  CHECK_EQ(hash, obj->property_array()->Hash());
 
   JSObject::NormalizeProperties(i_isolate(), obj, KEEP_INOBJECT_PROPERTIES, 0,
                                 "cctest/test-hashcode");
@@ -210,7 +211,7 @@ TEST_F(HashcodeTest, TransitionSlowToFastWithoutProperties) {
   CHECK_EQ(hash, GetPropertyDictionaryHash(obj));
 
   JSObject::MigrateSlowToFast(obj, 0, "cctest/test-hashcode");
-  CHECK_EQ(Smi::FromInt(hash), obj->GetHash());
+  CHECK_EQ(Smi::FromInt(hash), Object::GetHash(*obj));
 }
 
 TEST_F(HashcodeTest, TransitionSlowToFastWithPropertyArray) {
diff --git a/deps/v8/test/unittests/objects/inobject-slack-tracking-unittest.cc b/deps/v8/test/unittests/objects/inobject-slack-tracking-unittest.cc
deleted file mode 100644
index 2be8c2ec8bb271..00000000000000
--- a/deps/v8/test/unittests/objects/inobject-slack-tracking-unittest.cc
+++ /dev/null
@@ -1,1423 +0,0 @@
-// Copyright 2015 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include <stdlib.h>
-
-#include <sstream>
-#include <utility>
-
-#include "src/api/api-inl.h"
-#include "src/init/v8.h"
-#include "src/objects/heap-number-inl.h"
-#include "src/objects/objects-inl.h"
-#include "test/unittests/test-utils.h"
-#include "testing/gtest/include/gtest/gtest.h"
-
-namespace v8 {
-namespace internal {
-namespace test_inobject_slack_tracking {
-
-static const int kMaxInobjectProperties = JSObject::kMaxInObjectProperties;
-
-class InObjectSlackTrackingTest : public TestWithContext {
- public:
-  template <typename T = Object>
-  Handle<T> GetLexical(const char* name) {
-    Factory* factory = i_isolate()->factory();
-
-    Handle<String> str_name = factory->InternalizeUtf8String(name);
-    Handle<ScriptContextTable> script_contexts(
-        i_isolate()->native_context()->script_context_table(), i_isolate());
-
-    VariableLookupResult lookup_result;
-    if (script_contexts->Lookup(str_name, &lookup_result)) {
-      Handle<Context> script_context = ScriptContextTable::GetContext(
-          i_isolate(), script_contexts, lookup_result.context_index);
-
-      Handle<Object> result(script_context->get(lookup_result.slot_index),
-                            i_isolate());
-      return Handle<T>::cast(result);
-    }
-    return Handle<T>();
-  }
-
-  template <typename T = Object>
-  Handle<T> GetLexical(const std::string& name) {
-    return GetLexical<T>(name.c_str());
-  }
-
-  bool IsObjectShrinkable(JSObject obj) {
-    Handle<Map> filler_map = i_isolate()->factory()->one_pointer_filler_map();
-
-    int inobject_properties = obj.map().GetInObjectProperties();
-    int unused = obj.map().UnusedPropertyFields();
-    if (unused == 0) return false;
-
-    Address packed_filler = MapWord::FromMap(*filler_map).ptr();
-    for (int i = inobject_properties - unused; i < inobject_properties; i++) {
-      if (packed_filler != GetFieldValue(obj, i).ptr()) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  template <typename T>
-  Handle<T> GetGlobal(const char* name) {
-    Handle<String> str_name =
-        i_isolate()->factory()->InternalizeUtf8String(name);
-
-    Handle<Object> value =
-        Object::GetProperty(i_isolate(), i_isolate()->global_object(), str_name)
-            .ToHandleChecked();
-    return Handle<T>::cast(value);
-  }
-
-  static Object GetFieldValue(JSObject obj, int property_index) {
-    FieldIndex index = FieldIndex::ForPropertyIndex(obj.map(), property_index);
-    return obj.RawFastPropertyAt(index);
-  }
-
-  static double GetDoubleFieldValue(JSObject obj, FieldIndex field_index) {
-    Object value = obj.RawFastPropertyAt(field_index);
-    if (value.IsHeapNumber()) {
-      return HeapNumber::cast(value).value();
-    } else {
-      return value.Number();
-    }
-  }
-
-  static double GetDoubleFieldValue(JSObject obj, int property_index) {
-    FieldIndex index = FieldIndex::ForPropertyIndex(obj.map(), property_index);
-    return GetDoubleFieldValue(obj, index);
-  }
-
-  Local<Value> CompileRun(const char* source) {
-    Local<v8::String> source_string =
-        v8::String::NewFromUtf8(isolate(), source).ToLocalChecked();
-    Local<v8::Script> script =
-        v8::Script::Compile(context(), source_string).ToLocalChecked();
-    return script->Run(context()).ToLocalChecked();
-  }
-
-  v8::Local<v8::Script> Compile(const char* source) {
-    v8::Local<v8::Script> result;
-    CHECK(v8::Script::Compile(
-              context(),
-              v8::String::NewFromUtf8(isolate(), source).ToLocalChecked())
-              .ToLocal(&result));
-    return result;
-  }
-
-  template <typename T>
-  static Handle<T> OpenHandle(v8::Local<v8::Value> value) {
-    Handle<Object> obj = v8::Utils::OpenHandle(*value);
-    return Handle<T>::cast(obj);
-  }
-
-  inline v8::Local<v8::Value> Run(v8::Local<v8::Script> script) {
-    v8::Local<v8::Value> result;
-    if (script->Run(context()).ToLocal(&result)) {
-      return result;
-    }
-    return v8::Local<v8::Value>();
-  }
-
-  template <typename T>
-  inline Handle<T> RunI(v8::Local<v8::Script> script) {
-    return OpenHandle<T>(Run(script));
-  }
-
-  template <typename T>
-  inline Handle<T> CompileRunI(const char* script) {
-    return OpenHandle<T>(CompileRun(script));
-  }
-
-  static std::string GetClassName(int class_index) {
-    std::ostringstream os;
-    os << "A" << class_index;
-    return os.str();
-  }
-
-  v8::Local<v8::Script> GetNewObjectScript(const std::string& class_name) {
-    std::ostringstream os;
-    os << "new " << class_name << "();";
-    return Compile(os.str().c_str());
-  }
-
-  // Test that in-object slack tracking works as expected for first |n| classes
-  // in the hierarchy.
-  // This test works only for if the total property count is less than maximum
-  // in-object properties count.
-  void TestClassHierarchy(const std::vector<int>& hierarchy_desc, int n) {
-    int fields_count = 0;
-    for (int cur_class = 0; cur_class < n; cur_class++) {
-      std::string class_name = GetClassName(cur_class);
-      int fields_count_at_current_level = hierarchy_desc[cur_class];
-      fields_count += fields_count_at_current_level;
-
-      // This test is not suitable for in-object properties count overflow case.
-      CHECK_LT(fields_count, kMaxInobjectProperties);
-
-      // Create |class_name| objects and check slack tracking.
-      v8::Local<v8::Script> new_script = GetNewObjectScript(class_name);
-
-      Handle<JSFunction> func = GetLexical<JSFunction>(class_name);
-
-      Handle<JSObject> obj = RunI<JSObject>(new_script);
-
-      CHECK(func->has_initial_map());
-      Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
-
-      // If the object is slow-mode already, bail out.
-      if (obj->map().is_dictionary_map()) continue;
-
-      // There must be at least some slack.
-      CHECK_LT(fields_count, obj->map().GetInObjectProperties());
-
-      // One instance was created.
-      CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-               initial_map->construction_counter());
-      CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-      // Create several instances to complete the tracking.
-      for (int i = 1; i < Map::kGenerousAllocationCount; i++) {
-        CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-        Handle<JSObject> tmp = RunI<JSObject>(new_script);
-        CHECK_EQ(initial_map->IsInobjectSlackTrackingInProgress(),
-                 IsObjectShrinkable(*tmp));
-        if (!initial_map->IsInobjectSlackTrackingInProgress()) {
-          // Turbofan can force completion of in-object slack tracking.
-          break;
-        }
-        CHECK_EQ(Map::kSlackTrackingCounterStart - i - 1,
-                 initial_map->construction_counter());
-      }
-      CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
-      CHECK(!IsObjectShrinkable(*obj));
-
-      // No slack left.
-      CHECK_EQ(fields_count, obj->map().GetInObjectProperties());
-    }
-  }
-
-  // Creates class hierarchy of length matching the |hierarchy_desc| length and
-  // with the number of fields at i'th level equal to |hierarchy_desc[i]|.
-  void CreateClassHierarchy(const std::vector<int>& hierarchy_desc) {
-    std::ostringstream os;
-    os << "'use strict';\n\n";
-
-    int n = static_cast<int>(hierarchy_desc.size());
-    for (int cur_class = 0; cur_class < n; cur_class++) {
-      os << "class A" << cur_class;
-      if (cur_class > 0) {
-        os << " extends A" << (cur_class - 1);
-      }
-      os << " {\n"
-            "  constructor(...args) {\n";
-      if (cur_class > 0) {
-        os << "    super(...args);\n";
-      }
-      int fields_count = hierarchy_desc[cur_class];
-      for (int k = 0; k < fields_count; k++) {
-        os << "    this.f" << cur_class << "_" << k << " = " << k << ";\n";
-      }
-      os << "  }\n"
-            "};\n\n";
-    }
-    CompileRun(os.str().c_str());
-  }
-
-  void CheckExpectedProperties(int expected, std::ostringstream& os) {
-    Handle<HeapObject> obj = Handle<HeapObject>::cast(
-        v8::Utils::OpenHandle(*CompileRun(os.str().c_str())));
-    CHECK_EQ(expected, obj->map().GetInObjectProperties());
-  }
-
-  void TestSubclassBuiltin(const char* subclass_name,
-                           InstanceType instance_type, const char* builtin_name,
-                           const char* ctor_arguments = "",
-                           int builtin_properties_count = 0) {
-    {
-      std::ostringstream os;
-      os << "'use strict';\n"
-            "class "
-         << subclass_name << " extends " << builtin_name
-         << " {\n"
-            "  constructor(...args) {\n"
-            "    super(...args);\n"
-            "    this.a = 42;\n"
-            "    this.d = 4.2;\n"
-            "    this.o = this;\n"
-            "  }\n"
-            "};\n";
-      CompileRun(os.str().c_str());
-    }
-
-    Handle<JSFunction> func = GetLexical<JSFunction>(subclass_name);
-
-    // Zero instances were created so far.
-    CHECK(!func->has_initial_map());
-
-    v8::Local<v8::Script> new_script;
-    {
-      std::ostringstream os;
-      os << "new " << subclass_name << "(" << ctor_arguments << ");";
-      new_script = Compile(os.str().c_str());
-    }
-
-    RunI<JSObject>(new_script);
-
-    CHECK(func->has_initial_map());
-    Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
-
-    CHECK_EQ(instance_type, initial_map->instance_type());
-
-    // One instance of a subclass created.
-    CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-             initial_map->construction_counter());
-    CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-    // Create two instances in order to ensure that |obj|.o is a data field
-    // in case of Function subclassing.
-    Handle<JSObject> obj = RunI<JSObject>(new_script);
-
-    // Two instances of a subclass created.
-    CHECK_EQ(Map::kSlackTrackingCounterStart - 2,
-             initial_map->construction_counter());
-    CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-    // There must be at least some slack.
-    CHECK_LT(builtin_properties_count + 5, obj->map().GetInObjectProperties());
-    CHECK_EQ(Smi::FromInt(42),
-             GetFieldValue(*obj, builtin_properties_count + 0));
-    CHECK_EQ(4.2, GetDoubleFieldValue(*obj, builtin_properties_count + 1));
-    CHECK_EQ(*obj, GetFieldValue(*obj, builtin_properties_count + 2));
-    CHECK(IsObjectShrinkable(*obj));
-
-    // Create several subclass instances to complete the tracking.
-    for (int i = 2; i < Map::kGenerousAllocationCount; i++) {
-      CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-      Handle<JSObject> tmp = RunI<JSObject>(new_script);
-      CHECK_EQ(initial_map->IsInobjectSlackTrackingInProgress(),
-               IsObjectShrinkable(*tmp));
-    }
-    CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
-    CHECK(!IsObjectShrinkable(*obj));
-
-    // No slack left.
-    CHECK_EQ(builtin_properties_count + 3, obj->map().GetInObjectProperties());
-
-    CHECK_EQ(instance_type, obj->map().instance_type());
-  }
-
-  void TestSubclassChain(const std::vector<int>& hierarchy_desc) {
-    // Avoid eventual completion of in-object slack tracking.
-    v8_flags.always_turbofan = false;
-
-    CreateClassHierarchy(hierarchy_desc);
-    TestClassHierarchy(hierarchy_desc, static_cast<int>(hierarchy_desc.size()));
-  }
-
-  void TestSubclassBasicNoBaseClassInstances() {}
-};
-
-TEST_F(InObjectSlackTrackingTest, JSObjectBasic) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-  const char* source =
-      "function A() {"
-      "  this.a = 42;"
-      "  this.d = 4.2;"
-      "  this.o = this;"
-      "}";
-  CompileRun(source);
-
-  Handle<JSFunction> func = GetGlobal<JSFunction>("A");
-
-  // Zero instances were created so far.
-  CHECK(!func->has_initial_map());
-
-  v8::Local<v8::Script> new_A_script = Compile("new A();");
-
-  Handle<JSObject> obj = RunI<JSObject>(new_A_script);
-
-  CHECK(func->has_initial_map());
-  Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
-
-  // One instance created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-           initial_map->construction_counter());
-  CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-  // There must be at least some slack.
-  CHECK_LT(5, obj->map().GetInObjectProperties());
-  CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj, 0));
-  CHECK_EQ(4.2, GetDoubleFieldValue(*obj, 1));
-  CHECK_EQ(*obj, GetFieldValue(*obj, 2));
-  CHECK(IsObjectShrinkable(*obj));
-
-  // Create several objects to complete the tracking.
-  for (int i = 1; i < Map::kGenerousAllocationCount; i++) {
-    CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-    Handle<JSObject> tmp = RunI<JSObject>(new_A_script);
-    CHECK_EQ(initial_map->IsInobjectSlackTrackingInProgress(),
-             IsObjectShrinkable(*tmp));
-  }
-  CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
-  CHECK(!IsObjectShrinkable(*obj));
-
-  // No slack left.
-  CHECK_EQ(3, obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest, JSObjectBasicNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestJSObjectBasic();
-}
-
-TEST_F(InObjectSlackTrackingTest, JSObjectComplex) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-  const char* source =
-      "function A(n) {"
-      "  if (n > 0) this.a = 42;"
-      "  if (n > 1) this.d = 4.2;"
-      "  if (n > 2) this.o1 = this;"
-      "  if (n > 3) this.o2 = this;"
-      "  if (n > 4) this.o3 = this;"
-      "  if (n > 5) this.o4 = this;"
-      "}";
-  CompileRun(source);
-
-  Handle<JSFunction> func = GetGlobal<JSFunction>("A");
-
-  // Zero instances were created so far.
-  CHECK(!func->has_initial_map());
-
-  Handle<JSObject> obj1 = CompileRunI<JSObject>("new A(1);");
-  Handle<JSObject> obj3 = CompileRunI<JSObject>("new A(3);");
-  Handle<JSObject> obj5 = CompileRunI<JSObject>("new A(5);");
-
-  CHECK(func->has_initial_map());
-  Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
-
-  // Three instances created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart - 3,
-           initial_map->construction_counter());
-  CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-  // There must be at least some slack.
-  CHECK_LT(5, obj3->map().GetInObjectProperties());
-  CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj3, 0));
-  CHECK_EQ(4.2, GetDoubleFieldValue(*obj3, 1));
-  CHECK_EQ(*obj3, GetFieldValue(*obj3, 2));
-  CHECK(IsObjectShrinkable(*obj1));
-  CHECK(IsObjectShrinkable(*obj3));
-  CHECK(IsObjectShrinkable(*obj5));
-
-  // Create several objects to complete the tracking.
-  for (int i = 3; i < Map::kGenerousAllocationCount; i++) {
-    CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-    CompileRun("new A(3);");
-  }
-  CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
-
-  // obj1 and obj2 stays shrinkable because we don't clear unused fields.
-  CHECK(IsObjectShrinkable(*obj1));
-  CHECK(IsObjectShrinkable(*obj3));
-  CHECK(!IsObjectShrinkable(*obj5));
-
-  CHECK_EQ(5, obj1->map().GetInObjectProperties());
-  CHECK_EQ(4, obj1->map().UnusedPropertyFields());
-
-  CHECK_EQ(5, obj3->map().GetInObjectProperties());
-  CHECK_EQ(2, obj3->map().UnusedPropertyFields());
-
-  CHECK_EQ(5, obj5->map().GetInObjectProperties());
-  CHECK_EQ(0, obj5->map().UnusedPropertyFields());
-
-  // Since slack tracking is complete, the new objects should not be shrinkable.
-  obj1 = CompileRunI<JSObject>("new A(1);");
-  obj3 = CompileRunI<JSObject>("new A(3);");
-  obj5 = CompileRunI<JSObject>("new A(5);");
-
-  CHECK(!IsObjectShrinkable(*obj1));
-  CHECK(!IsObjectShrinkable(*obj3));
-  CHECK(!IsObjectShrinkable(*obj5));
-}
-
-TEST_F(InObjectSlackTrackingTest, JSObjectComplexNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestJSObjectComplex();
-}
-
-TEST_F(InObjectSlackTrackingTest, JSGeneratorObjectBasic) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-  const char* source =
-      "function* A() {"
-      "  var i = 0;"
-      "  while(true) {"
-      "    yield i++;"
-      "  }"
-      "};"
-      "function CreateGenerator() {"
-      "  var o = A();"
-      "  o.a = 42;"
-      "  o.d = 4.2;"
-      "  o.o = o;"
-      "  return o;"
-      "}";
-  CompileRun(source);
-
-  Handle<JSFunction> func = GetGlobal<JSFunction>("A");
-
-  // Zero instances were created so far.
-  CHECK(!func->has_initial_map());
-
-  v8::Local<v8::Script> new_A_script = Compile("CreateGenerator();");
-
-  Handle<JSObject> obj = RunI<JSObject>(new_A_script);
-
-  CHECK(func->has_initial_map());
-  Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
-
-  // One instance created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-           initial_map->construction_counter());
-  CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-  // There must be at least some slack.
-  CHECK_LT(5, obj->map().GetInObjectProperties());
-  CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj, 0));
-  CHECK_EQ(4.2, GetDoubleFieldValue(*obj, 1));
-  CHECK_EQ(*obj, GetFieldValue(*obj, 2));
-  CHECK(IsObjectShrinkable(*obj));
-
-  // Create several objects to complete the tracking.
-  for (int i = 1; i < Map::kGenerousAllocationCount; i++) {
-    CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-    Handle<JSObject> tmp = RunI<JSObject>(new_A_script);
-    CHECK_EQ(initial_map->IsInobjectSlackTrackingInProgress(),
-             IsObjectShrinkable(*tmp));
-  }
-  CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
-  CHECK(!IsObjectShrinkable(*obj));
-
-  // No slack left.
-  CHECK_EQ(3, obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest, JSGeneratorObjectBasicNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestJSGeneratorObjectBasic();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassBasicNoBaseClassInstances) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  // Check that base class' and subclass' slack tracking do not interfere with
-  // each other.
-  // In this test we never create base class instances.
-
-  const char* source =
-      "'use strict';"
-      "class A {"
-      "  constructor(...args) {"
-      "    this.aa = 42;"
-      "    this.ad = 4.2;"
-      "    this.ao = this;"
-      "  }"
-      "};"
-      "class B extends A {"
-      "  constructor(...args) {"
-      "    super(...args);"
-      "    this.ba = 142;"
-      "    this.bd = 14.2;"
-      "    this.bo = this;"
-      "  }"
-      "};";
-  CompileRun(source);
-
-  Handle<JSFunction> a_func = GetLexical<JSFunction>("A");
-  Handle<JSFunction> b_func = GetLexical<JSFunction>("B");
-
-  // Zero instances were created so far.
-  CHECK(!a_func->has_initial_map());
-  CHECK(!b_func->has_initial_map());
-
-  v8::Local<v8::Script> new_B_script = Compile("new B();");
-
-  Handle<JSObject> obj = RunI<JSObject>(new_B_script);
-
-  CHECK(a_func->has_initial_map());
-  Handle<Map> a_initial_map(a_func->initial_map(), a_func->GetIsolate());
-
-  CHECK(b_func->has_initial_map());
-  Handle<Map> b_initial_map(b_func->initial_map(), a_func->GetIsolate());
-
-  // Zero instances of A created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart,
-           a_initial_map->construction_counter());
-  CHECK(a_initial_map->IsInobjectSlackTrackingInProgress());
-
-  // One instance of B created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-           b_initial_map->construction_counter());
-  CHECK(b_initial_map->IsInobjectSlackTrackingInProgress());
-
-  // There must be at least some slack.
-  CHECK_LT(10, obj->map().GetInObjectProperties());
-  CHECK_EQ(Smi::FromInt(42), GetFieldValue(*obj, 0));
-  CHECK_EQ(4.2, GetDoubleFieldValue(*obj, 1));
-  CHECK_EQ(*obj, GetFieldValue(*obj, 2));
-  CHECK_EQ(Smi::FromInt(142), GetFieldValue(*obj, 3));
-  CHECK_EQ(14.2, GetDoubleFieldValue(*obj, 4));
-  CHECK_EQ(*obj, GetFieldValue(*obj, 5));
-  CHECK(IsObjectShrinkable(*obj));
-
-  // Create several subclass instances to complete the tracking.
-  for (int i = 1; i < Map::kGenerousAllocationCount; i++) {
-    CHECK(b_initial_map->IsInobjectSlackTrackingInProgress());
-    Handle<JSObject> tmp = RunI<JSObject>(new_B_script);
-    CHECK_EQ(b_initial_map->IsInobjectSlackTrackingInProgress(),
-             IsObjectShrinkable(*tmp));
-  }
-  CHECK(!b_initial_map->IsInobjectSlackTrackingInProgress());
-  CHECK(!IsObjectShrinkable(*obj));
-
-  // Zero instances of A created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart,
-           a_initial_map->construction_counter());
-  CHECK(a_initial_map->IsInobjectSlackTrackingInProgress());
-
-  // No slack left.
-  CHECK_EQ(6, obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest,
-       SubclassBasicNoBaseClassInstancesNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassBasicNoBaseClassInstances();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassBasic) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  // Check that base class' and subclass' slack tracking do not interfere with
-  // each other.
-  // In this test we first create enough base class instances to complete
-  // the slack tracking and then proceed creating subclass instances.
-
-  const char* source =
-      "'use strict';"
-      "class A {"
-      "  constructor(...args) {"
-      "    this.aa = 42;"
-      "    this.ad = 4.2;"
-      "    this.ao = this;"
-      "  }"
-      "};"
-      "class B extends A {"
-      "  constructor(...args) {"
-      "    super(...args);"
-      "    this.ba = 142;"
-      "    this.bd = 14.2;"
-      "    this.bo = this;"
-      "  }"
-      "};";
-  CompileRun(source);
-
-  Handle<JSFunction> a_func = GetLexical<JSFunction>("A");
-  Handle<JSFunction> b_func = GetLexical<JSFunction>("B");
-
-  // Zero instances were created so far.
-  CHECK(!a_func->has_initial_map());
-  CHECK(!b_func->has_initial_map());
-
-  v8::Local<v8::Script> new_A_script = Compile("new A();");
-  v8::Local<v8::Script> new_B_script = Compile("new B();");
-
-  Handle<JSObject> a_obj = RunI<JSObject>(new_A_script);
-  Handle<JSObject> b_obj = RunI<JSObject>(new_B_script);
-
-  CHECK(a_func->has_initial_map());
-  Handle<Map> a_initial_map(a_func->initial_map(), a_func->GetIsolate());
-
-  CHECK(b_func->has_initial_map());
-  Handle<Map> b_initial_map(b_func->initial_map(), a_func->GetIsolate());
-
-  // One instance of a base class created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-           a_initial_map->construction_counter());
-  CHECK(a_initial_map->IsInobjectSlackTrackingInProgress());
-
-  // One instance of a subclass created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-           b_initial_map->construction_counter());
-  CHECK(b_initial_map->IsInobjectSlackTrackingInProgress());
-
-  // Create several base class instances to complete the tracking.
-  for (int i = 1; i < Map::kGenerousAllocationCount; i++) {
-    CHECK(a_initial_map->IsInobjectSlackTrackingInProgress());
-    Handle<JSObject> tmp = RunI<JSObject>(new_A_script);
-    CHECK_EQ(a_initial_map->IsInobjectSlackTrackingInProgress(),
-             IsObjectShrinkable(*tmp));
-  }
-  CHECK(!a_initial_map->IsInobjectSlackTrackingInProgress());
-  CHECK(!IsObjectShrinkable(*a_obj));
-
-  // No slack left.
-  CHECK_EQ(3, a_obj->map().GetInObjectProperties());
-
-  // There must be at least some slack.
-  CHECK_LT(10, b_obj->map().GetInObjectProperties());
-  CHECK_EQ(Smi::FromInt(42), GetFieldValue(*b_obj, 0));
-  CHECK_EQ(4.2, GetDoubleFieldValue(*b_obj, 1));
-  CHECK_EQ(*b_obj, GetFieldValue(*b_obj, 2));
-  CHECK_EQ(Smi::FromInt(142), GetFieldValue(*b_obj, 3));
-  CHECK_EQ(14.2, GetDoubleFieldValue(*b_obj, 4));
-  CHECK_EQ(*b_obj, GetFieldValue(*b_obj, 5));
-  CHECK(IsObjectShrinkable(*b_obj));
-
-  // Create several subclass instances to complete the tracking.
-  for (int i = 1; i < Map::kGenerousAllocationCount; i++) {
-    CHECK(b_initial_map->IsInobjectSlackTrackingInProgress());
-    Handle<JSObject> tmp = RunI<JSObject>(new_B_script);
-    CHECK_EQ(b_initial_map->IsInobjectSlackTrackingInProgress(),
-             IsObjectShrinkable(*tmp));
-  }
-  CHECK(!b_initial_map->IsInobjectSlackTrackingInProgress());
-  CHECK(!IsObjectShrinkable(*b_obj));
-
-  // No slack left.
-  CHECK_EQ(6, b_obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassBasicNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassBasic();
-}
-
-TEST_F(InObjectSlackTrackingTest, Subclasses) {
-  std::vector<int> hierarchy_desc;
-  hierarchy_desc.push_back(50);
-  hierarchy_desc.push_back(128);
-  TestSubclassChain(hierarchy_desc);
-}
-
-TEST_F(InObjectSlackTrackingTest, LongSubclassChain1) {
-  std::vector<int> hierarchy_desc;
-  for (int i = 0; i < 7; i++) {
-    hierarchy_desc.push_back(i * 10);
-  }
-  TestSubclassChain(hierarchy_desc);
-}
-
-TEST_F(InObjectSlackTrackingTest, LongSubclassChain2) {
-  std::vector<int> hierarchy_desc;
-  hierarchy_desc.push_back(10);
-  for (int i = 0; i < 42; i++) {
-    hierarchy_desc.push_back(0);
-  }
-  hierarchy_desc.push_back(230);
-  TestSubclassChain(hierarchy_desc);
-}
-
-TEST_F(InObjectSlackTrackingTest, LongSubclassChain3) {
-  std::vector<int> hierarchy_desc;
-  for (int i = 0; i < 42; i++) {
-    hierarchy_desc.push_back(5);
-  }
-  TestSubclassChain(hierarchy_desc);
-}
-
-TEST_F(InObjectSlackTrackingTest, InobjectPropetiesCountOverflowInSubclass) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  std::vector<int> hierarchy_desc;
-  const int kNoOverflowCount = 5;
-  for (int i = 0; i < kNoOverflowCount; i++) {
-    hierarchy_desc.push_back(50);
-  }
-  // In this class we are going to have properties in the backing store.
-  hierarchy_desc.push_back(100);
-
-  CreateClassHierarchy(hierarchy_desc);
-
-  // For the last class in the hierarchy we need different checks.
-  {
-    int cur_class = kNoOverflowCount;
-    std::string class_name = GetClassName(cur_class);
-
-    // Create |class_name| objects and check slack tracking.
-    v8::Local<v8::Script> new_script = GetNewObjectScript(class_name);
-
-    Handle<JSFunction> func = GetLexical<JSFunction>(class_name);
-
-    Handle<JSObject> obj = RunI<JSObject>(new_script);
-
-    CHECK(func->has_initial_map());
-    Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
-
-    // There must be no slack left.
-    CHECK_EQ(JSObject::kMaxInstanceSize, obj->map().instance_size());
-    CHECK_EQ(kMaxInobjectProperties, obj->map().GetInObjectProperties());
-
-    // One instance was created.
-    CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-             initial_map->construction_counter());
-    CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-    // Create several instances to complete the tracking.
-    for (int i = 1; i < Map::kGenerousAllocationCount; i++) {
-      CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-      Handle<JSObject> tmp = RunI<JSObject>(new_script);
-      CHECK(!IsObjectShrinkable(*tmp));
-    }
-    CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
-    CHECK(!IsObjectShrinkable(*obj));
-
-    // No slack left.
-    CHECK_EQ(kMaxInobjectProperties, obj->map().GetInObjectProperties());
-  }
-
-  // The other classes in the hierarchy are not affected.
-  TestClassHierarchy(hierarchy_desc, kNoOverflowCount);
-}
-
-TEST_F(InObjectSlackTrackingTest, ObjectLiteralPropertyBackingStoreSize) {
-  std::ostringstream os;
-
-  // An index key does not require space in the property backing store.
-  os << "(function() {\n"
-        "  function f() {\n"
-        "    var o = {\n"
-        "      '-1': 42,\n"  // Allocate for non-index key.
-        "      1: 42,\n"     // Do not allocate for index key.
-        "      '2': 42\n"    // Do not allocate for index key.
-        "    };\n"
-        "    return o;\n"
-        "  }\n"
-        "\n"
-        "  return f();\n"
-        "} )();";
-  CheckExpectedProperties(1, os);
-
-  // Avoid over-/under-allocation for computed property names.
-  os << "(function() {\n"
-        "  'use strict';\n"
-        "  function f(x) {\n"
-        "    var o = {\n"
-        "      1: 42,\n"    // Do not allocate for index key.
-        "      '2': 42,\n"  // Do not allocate for index key.
-        "      [x]: 42,\n"  // Allocate for property with computed name.
-        "      3: 42,\n"    // Do not allocate for index key.
-        "      '4': 42\n"   // Do not allocate for index key.
-        "    };\n"
-        "    return o;\n"
-        "  }\n"
-        "\n"
-        "  var x = 'hello'\n"
-        "\n"
-        "  return f(x);\n"
-        "} )();";
-  CheckExpectedProperties(1, os);
-
-  // Conversion to index key.
-  os << "(function() {\n"
-        "  function f(x) {\n"
-        "    var o = {\n"
-        "      1: 42,\n"       // Do not allocate for index key.
-        "      '2': 42,\n"     // Do not allocate for index key.
-        "      [x]: 42,\n"     // Allocate for property with computed name.
-        "      3: 42,\n"       // Do not allocate for index key.
-        "      get 12() {}\n"  // Do not allocate for index key.
-        "    };\n"
-        "    return o;\n"
-        "  }\n"
-        "\n"
-        "  var x = 'hello'\n"
-        "\n"
-        "  return f(x);\n"
-        "} )();";
-  CheckExpectedProperties(1, os);
-
-  os << "(function() {\n"
-        "  function f() {\n"
-        "    var o = {};\n"
-        "    return o;\n"
-        "  }\n"
-        "\n"
-        "  return f();\n"
-        "} )();";
-  // Empty objects have slack for 4 properties.
-  CheckExpectedProperties(4, os);
-
-  os << "(function() {\n"
-        "  function f(x) {\n"
-        "    var o = {\n"
-        "      a: 42,\n"    // Allocate for constant property.
-        "      [x]: 42,\n"  // Allocate for property with computed name.
-        "      b: 42\n"     // Allocate for constant property.
-        "    };\n"
-        "    return o;\n"
-        "  }\n"
-        "\n"
-        "  var x = 'hello'\n"
-        "\n"
-        "  return f(x);\n"
-        "} )();";
-  CheckExpectedProperties(3, os);
-
-  os << "(function() {\n"
-        "  function f(x) {\n"
-        "    var o = {\n"
-        "      a: 42,\n"          // Allocate for constant property.
-        "      __proto__: 42,\n"  // Do not allocate for __proto__.
-        "      [x]: 42\n"         // Allocate for property with computed name.
-        "    };\n"
-        "    return o;\n"
-        "  }\n"
-        "\n"
-        "  var x = 'hello'\n"
-        "\n"
-        "  return f(x);\n"
-        "} )();";
-  // __proto__ is not allocated in the backing store.
-  CheckExpectedProperties(2, os);
-
-  os << "(function() {\n"
-        "  function f(x) {\n"
-        "    var o = {\n"
-        "      a: 42,\n"         // Allocate for constant property.
-        "      [x]: 42,\n"       // Allocate for property with computed name.
-        "      __proto__: 42\n"  // Do not allocate for __proto__.
-        "    };\n"
-        "    return o;\n"
-        "  }\n"
-        "\n"
-        "  var x = 'hello'\n"
-        "\n"
-        "  return f(x);\n"
-        "} )();";
-  CheckExpectedProperties(2, os);
-}
-
-TEST_F(InObjectSlackTrackingTest, SlowModeSubclass) {
-  if (v8_flags.stress_concurrent_allocation) return;
-
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  std::vector<int> hierarchy_desc;
-  const int kNoOverflowCount = 5;
-  for (int i = 0; i < kNoOverflowCount; i++) {
-    hierarchy_desc.push_back(50);
-  }
-  // This class should go dictionary mode.
-  hierarchy_desc.push_back(1000);
-
-  CreateClassHierarchy(hierarchy_desc);
-
-  // For the last class in the hierarchy we need different checks.
-  {
-    int cur_class = kNoOverflowCount;
-    std::string class_name = GetClassName(cur_class);
-
-    // Create |class_name| objects and check slack tracking.
-    v8::Local<v8::Script> new_script = GetNewObjectScript(class_name);
-
-    Handle<JSFunction> func = GetLexical<JSFunction>(class_name);
-
-    Handle<JSObject> obj = RunI<JSObject>(new_script);
-
-    CHECK(func->has_initial_map());
-    Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
-
-    // Object should go dictionary mode.
-    CHECK_EQ(JSObject::kHeaderSize, obj->map().instance_size());
-    CHECK(obj->map().is_dictionary_map());
-
-    // One instance was created.
-    CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-             initial_map->construction_counter());
-    CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-    // Create several instances to complete the tracking.
-    for (int i = 1; i < Map::kGenerousAllocationCount; i++) {
-      CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-      Handle<JSObject> tmp = RunI<JSObject>(new_script);
-      CHECK(!IsObjectShrinkable(*tmp));
-    }
-    CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
-    CHECK(!IsObjectShrinkable(*obj));
-
-    // Object should stay in dictionary mode.
-    CHECK_EQ(JSObject::kHeaderSize, obj->map().instance_size());
-    CHECK(obj->map().is_dictionary_map());
-  }
-
-  // The other classes in the hierarchy are not affected.
-  TestClassHierarchy(hierarchy_desc, kNoOverflowCount);
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassObjectBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-  TestSubclassBuiltin("A1", JS_OBJECT_TYPE, "Object", "true");
-  TestSubclassBuiltin("A2", JS_OBJECT_TYPE, "Object", "42");
-  TestSubclassBuiltin("A3", JS_OBJECT_TYPE, "Object", "'some string'");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassObjectBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassObjectBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassFunctionBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  TestSubclassBuiltin("A1", JS_FUNCTION_TYPE, "Function", "'return 153;'");
-  TestSubclassBuiltin("A2", JS_FUNCTION_TYPE, "Function", "'this.a = 44;'");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassFunctionBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassFunctionBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassBooleanBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  TestSubclassBuiltin("A1", JS_PRIMITIVE_WRAPPER_TYPE, "Boolean", "true");
-  TestSubclassBuiltin("A2", JS_PRIMITIVE_WRAPPER_TYPE, "Boolean", "false");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassBooleanBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassBooleanBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassErrorBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  const int first_field = 2;
-  TestSubclassBuiltin("A1", JS_ERROR_TYPE, "Error", "'err'", first_field);
-  TestSubclassBuiltin("A2", JS_ERROR_TYPE, "EvalError", "'err'", first_field);
-  TestSubclassBuiltin("A3", JS_ERROR_TYPE, "RangeError", "'err'", first_field);
-  TestSubclassBuiltin("A4", JS_ERROR_TYPE, "ReferenceError", "'err'",
-                      first_field);
-  TestSubclassBuiltin("A5", JS_ERROR_TYPE, "SyntaxError", "'err'", first_field);
-  TestSubclassBuiltin("A6", JS_ERROR_TYPE, "TypeError", "'err'", first_field);
-  TestSubclassBuiltin("A7", JS_ERROR_TYPE, "URIError", "'err'", first_field);
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassErrorBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassErrorBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassNumberBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  TestSubclassBuiltin("A1", JS_PRIMITIVE_WRAPPER_TYPE, "Number", "42");
-  TestSubclassBuiltin("A2", JS_PRIMITIVE_WRAPPER_TYPE, "Number", "4.2");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassNumberBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassNumberBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassDateBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  TestSubclassBuiltin("A1", JS_DATE_TYPE, "Date", "123456789");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassDateBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassDateBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassStringBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  TestSubclassBuiltin("A1", JS_PRIMITIVE_WRAPPER_TYPE, "String",
-                      "'some string'");
-  TestSubclassBuiltin("A2", JS_PRIMITIVE_WRAPPER_TYPE, "String", "");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassStringBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassRegExpBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  const int first_field = 1;
-  TestSubclassBuiltin("A1", JS_REG_EXP_TYPE, "RegExp", "'o(..)h', 'g'",
-                      first_field);
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassRegExpBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassRegExpBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassArrayBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-  TestSubclassBuiltin("A1", JS_ARRAY_TYPE, "Array", "42");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassArrayBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassArrayBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassTypedArrayBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-
-#define TYPED_ARRAY_TEST_F(InObjectSlackTrackingTest, Type, type, TYPE, \
-                           elementType)                                 \
-  TestSubclassBuiltin("A" #Type, JS_TYPED_ARRAY_TYPE, #Type "Array", "42");
-
-  TYPED_ARRAYS(TYPED_ARRAY_TEST)
-
-#undef TYPED_ARRAY_TEST
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassTypedArrayBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassTypedArrayBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassCollectionBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  TestSubclassBuiltin("A1", JS_SET_TYPE, "Set", "");
-  TestSubclassBuiltin("A2", JS_MAP_TYPE, "Map", "");
-  TestSubclassBuiltin("A3", JS_WEAK_SET_TYPE, "WeakSet", "");
-  TestSubclassBuiltin("A4", JS_WEAK_MAP_TYPE, "WeakMap", "");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassCollectionBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassCollectionBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassArrayBufferBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  TestSubclassBuiltin("A1", JS_ARRAY_BUFFER_TYPE, "ArrayBuffer", "42");
-  TestSubclassBuiltin("A2", JS_DATA_VIEW_TYPE, "DataView",
-                      "new ArrayBuffer(42)");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassArrayBufferBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassArrayBufferBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassPromiseBuiltin) {
-  // Avoid eventual completion of in-object slack tracking.
-  v8_flags.always_turbofan = false;
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  TestSubclassBuiltin("A1", JS_PROMISE_TYPE, "Promise",
-                      "function(resolve, reject) { resolve('ok'); }");
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassPromiseBuiltinNoInlineNew) {
-  v8_flags.inline_new = false;
-  TestSubclassPromiseBuiltin();
-}
-
-TEST_F(InObjectSlackTrackingTest, SubclassTranspiledClassHierarchy) {
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  CompileRun(
-      "Object.setPrototypeOf(B, A);\n"
-      "function A() {\n"
-      "  this.a0 = 0;\n"
-      "  this.a1 = 1;\n"
-      "  this.a2 = 1;\n"
-      "  this.a3 = 1;\n"
-      "  this.a4 = 1;\n"
-      "  this.a5 = 1;\n"
-      "  this.a6 = 1;\n"
-      "  this.a7 = 1;\n"
-      "  this.a8 = 1;\n"
-      "  this.a9 = 1;\n"
-      "  this.a10 = 1;\n"
-      "  this.a11 = 1;\n"
-      "  this.a12 = 1;\n"
-      "  this.a13 = 1;\n"
-      "  this.a14 = 1;\n"
-      "  this.a15 = 1;\n"
-      "  this.a16 = 1;\n"
-      "  this.a17 = 1;\n"
-      "  this.a18 = 1;\n"
-      "  this.a19 = 1;\n"
-      "};\n"
-      "function B() {\n"
-      "  A.call(this);\n"
-      "  this.b = 1;\n"
-      "};\n");
-
-  Handle<JSFunction> func = GetGlobal<JSFunction>("B");
-
-  // Zero instances have been created so far.
-  CHECK(!func->has_initial_map());
-
-  v8::Local<v8::Script> new_script = v8_compile("new B()");
-
-  RunI<JSObject>(new_script);
-
-  CHECK(func->has_initial_map());
-  Handle<Map> initial_map(func->initial_map(), func->GetIsolate());
-
-  CHECK_EQ(JS_OBJECT_TYPE, initial_map->instance_type());
-
-  // One instance of a subclass created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart - 1,
-           initial_map->construction_counter());
-  CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-
-  // Create two instances in order to ensure that |obj|.o is a data field
-  // in case of Function subclassing.
-  Handle<JSObject> obj = RunI<JSObject>(new_script);
-
-  // Two instances of a subclass created.
-  CHECK_EQ(Map::kSlackTrackingCounterStart - 2,
-           initial_map->construction_counter());
-  CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-  CHECK(IsObjectShrinkable(*obj));
-
-  // Create several subclass instances to complete the tracking.
-  for (int i = 2; i < Map::kGenerousAllocationCount; i++) {
-    CHECK(initial_map->IsInobjectSlackTrackingInProgress());
-    Handle<JSObject> tmp = RunI<JSObject>(new_script);
-    CHECK_EQ(initial_map->IsInobjectSlackTrackingInProgress(),
-             IsObjectShrinkable(*tmp));
-  }
-  CHECK(!initial_map->IsInobjectSlackTrackingInProgress());
-  CHECK(!IsObjectShrinkable(*obj));
-
-  // No slack left.
-  CHECK_EQ(21, obj->map().GetInObjectProperties());
-  CHECK_EQ(JS_OBJECT_TYPE, obj->map().instance_type());
-}
-
-TEST_F(InObjectSlackTrackingTest, Regress8853_ClassConstructor) {
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  // For classes without any this.prop assignments in their
-  // constructors we start out with 10 inobject properties.
-  Handle<JSObject> obj = CompileRunI<JSObject>("new (class {});\n");
-  CHECK(obj->map().IsInobjectSlackTrackingInProgress());
-  CHECK(IsObjectShrinkable(*obj));
-  CHECK_EQ(10, obj->map().GetInObjectProperties());
-
-  // For classes with N explicit this.prop assignments in their
-  // constructors we start out with N+8 inobject properties.
-  obj = CompileRunI<JSObject>(
-      "new (class {\n"
-      "  constructor() {\n"
-      "    this.x = 1;\n"
-      "    this.y = 2;\n"
-      "    this.z = 3;\n"
-      "  }\n"
-      "});\n");
-  CHECK(obj->map().IsInobjectSlackTrackingInProgress());
-  CHECK(IsObjectShrinkable(*obj));
-  CHECK_EQ(3 + 8, obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest, Regress8853_ClassHierarchy) {
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  // For class hierarchies without any this.prop assignments in their
-  // constructors we reserve 2 inobject properties per constructor plus
-  // 8 inobject properties slack on top.
-  std::string base = "(class {})";
-  for (int i = 1; i < 10; ++i) {
-    std::string script = "new " + base + ";\n";
-    Handle<JSObject> obj = CompileRunI<JSObject>(script.c_str());
-    CHECK(obj->map().IsInobjectSlackTrackingInProgress());
-    CHECK(IsObjectShrinkable(*obj));
-    CHECK_EQ(8 + 2 * i, obj->map().GetInObjectProperties());
-    base = "(class extends " + base + " {})";
-  }
-}
-
-TEST_F(InObjectSlackTrackingTest, Regress8853_FunctionConstructor) {
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  // For constructor functions without any this.prop assignments in
-  // them we start out with 10 inobject properties.
-  Handle<JSObject> obj = CompileRunI<JSObject>("new (function() {});\n");
-  CHECK(obj->map().IsInobjectSlackTrackingInProgress());
-  CHECK(IsObjectShrinkable(*obj));
-  CHECK_EQ(10, obj->map().GetInObjectProperties());
-
-  // For constructor functions with N explicit this.prop assignments
-  // in them we start out with N+8 inobject properties.
-  obj = CompileRunI<JSObject>(
-      "new (function() {\n"
-      "  this.a = 1;\n"
-      "  this.b = 2;\n"
-      "  this.c = 3;\n"
-      "  this.d = 3;\n"
-      "  this.c = 3;\n"
-      "  this.f = 3;\n"
-      "});\n");
-  CHECK(obj->map().IsInobjectSlackTrackingInProgress());
-  CHECK(IsObjectShrinkable(*obj));
-  CHECK_EQ(6 + 8, obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest,
-       InstanceFieldsArePropertiesDefaultConstructorLazy) {
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  Handle<JSObject> obj = CompileRunI<JSObject>(
-      "new (class {\n"
-      "  x00 = null;\n"
-      "  x01 = null;\n"
-      "  x02 = null;\n"
-      "  x03 = null;\n"
-      "  x04 = null;\n"
-      "  x05 = null;\n"
-      "  x06 = null;\n"
-      "  x07 = null;\n"
-      "  x08 = null;\n"
-      "  x09 = null;\n"
-      "  x10 = null;\n"
-      "});\n");
-  CHECK_EQ(11 + 8, obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest,
-       InstanceFieldsArePropertiesFieldsAndConstructorLazy) {
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  Handle<JSObject> obj = CompileRunI<JSObject>(
-      "new (class {\n"
-      "  x00 = null;\n"
-      "  x01 = null;\n"
-      "  x02 = null;\n"
-      "  x03 = null;\n"
-      "  x04 = null;\n"
-      "  x05 = null;\n"
-      "  x06 = null;\n"
-      "  x07 = null;\n"
-      "  x08 = null;\n"
-      "  x09 = null;\n"
-      "  x10 = null;\n"
-      "  constructor() {\n"
-      "    this.x11 = null;\n"
-      "    this.x12 = null;\n"
-      "    this.x12 = null;\n"
-      "    this.x14 = null;\n"
-      "    this.x15 = null;\n"
-      "    this.x16 = null;\n"
-      "    this.x17 = null;\n"
-      "    this.x18 = null;\n"
-      "    this.x19 = null;\n"
-      "    this.x20 = null;\n"
-      "  }\n"
-      "});\n");
-  CHECK_EQ(21 + 8, obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest,
-       InstanceFieldsArePropertiesDefaultConstructorEager) {
-  i::v8_flags.lazy = false;
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  Handle<JSObject> obj = CompileRunI<JSObject>(
-      "new (class {\n"
-      "  x00 = null;\n"
-      "  x01 = null;\n"
-      "  x02 = null;\n"
-      "  x03 = null;\n"
-      "  x04 = null;\n"
-      "  x05 = null;\n"
-      "  x06 = null;\n"
-      "  x07 = null;\n"
-      "  x08 = null;\n"
-      "  x09 = null;\n"
-      "  x10 = null;\n"
-      "});\n");
-  CHECK_EQ(11 + 8, obj->map().GetInObjectProperties());
-}
-
-TEST_F(InObjectSlackTrackingTest,
-       InstanceFieldsArePropertiesFieldsAndConstructorEager) {
-  i::v8_flags.lazy = false;
-  CcTest::InitializeVM();
-  v8::HandleScope scope(CcTest::isolate());
-
-  Handle<JSObject> obj = CompileRunI<JSObject>(
-      "new (class {\n"
-      "  x00 = null;\n"
-      "  x01 = null;\n"
-      "  x02 = null;\n"
-      "  x03 = null;\n"
-      "  x04 = null;\n"
-      "  x05 = null;\n"
-      "  x06 = null;\n"
-      "  x07 = null;\n"
-      "  x08 = null;\n"
-      "  x09 = null;\n"
-      "  x10 = null;\n"
-      "  constructor() {\n"
-      "    this.x11 = null;\n"
-      "    this.x12 = null;\n"
-      "    this.x12 = null;\n"
-      "    this.x14 = null;\n"
-      "    this.x15 = null;\n"
-      "    this.x16 = null;\n"
-      "    this.x17 = null;\n"
-      "    this.x18 = null;\n"
-      "    this.x19 = null;\n"
-      "    this.x20 = null;\n"
-      "  }\n"
-      "});\n");
-  CHECK_EQ(21 + 8, obj->map().GetInObjectProperties());
-}
-
-}  // namespace test_inobject_slack_tracking
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/unittests/objects/intl-unittest.cc b/deps/v8/test/unittests/objects/intl-unittest.cc
index 395312e44ae8cc..079b659e853476 100644
--- a/deps/v8/test/unittests/objects/intl-unittest.cc
+++ b/deps/v8/test/unittests/objects/intl-unittest.cc
@@ -281,7 +281,7 @@ TEST_F(IntlTest, StringLocaleCompareFastPath) {
 
   Handle<JSFunction> collator_constructor = Handle<JSFunction>(
       JSFunction::cast(
-          i_isolate()->context().native_context().intl_collator_function()),
+          i_isolate()->context()->native_context()->intl_collator_function()),
       i_isolate());
   Handle<Map> constructor_map =
       JSFunction::GetDerivedMap(i_isolate(), collator_constructor,
@@ -314,9 +314,9 @@ TEST_F(IntlTest, StringLocaleCompareFastPath) {
       for (size_t j = i + 1; j < ascii_strings.size(); j++) {
         Handle<String> rhs = ascii_strings[j];
         CHECK_EQ(
-            Intl::CompareStrings(i_isolate(), *collator->icu_collator().raw(),
+            Intl::CompareStrings(i_isolate(), *collator->icu_collator()->raw(),
                                  lhs, rhs, Intl::CompareStringsOptions::kNone),
-            Intl::CompareStrings(i_isolate(), *collator->icu_collator().raw(),
+            Intl::CompareStrings(i_isolate(), *collator->icu_collator()->raw(),
                                  lhs, rhs,
                                  Intl::CompareStringsOptions::kTryFastPath));
       }
diff --git a/deps/v8/test/unittests/objects/managed-unittest.cc b/deps/v8/test/unittests/objects/managed-unittest.cc
index 5654cc6e53f973..65dffd5c6fcd0b 100644
--- a/deps/v8/test/unittests/objects/managed-unittest.cc
+++ b/deps/v8/test/unittests/objects/managed-unittest.cc
@@ -8,6 +8,7 @@
 
 #include "src/objects/managed-inl.h"
 #include "src/objects/objects-inl.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -39,7 +40,9 @@ TEST_F(ManagedTest, GCCausesDestruction) {
     USE(handle);
   }
 
-  CollectAllAvailableGarbage();
+  // We need to invoke GC without stack, otherwise the objects may survive.
+  DisableConservativeStackScanningScopeForTesting scope(isolate()->heap());
+  InvokeMemoryReducingMajorGCs(isolate());
 
   CHECK_EQ(1, deleted1);
   CHECK_EQ(0, deleted2);
@@ -175,14 +178,18 @@ TEST_F(ManagedTest, CollectAcrossIsolates) {
           Managed<DeleteCounter>::FromSharedPtr(i_isolate2, 0, handle1->get());
       USE(handle2);
     }
-    CollectAllAvailableGarbage(i_isolate2);
+    InvokeMemoryReducingMajorGCs(i_isolate2);
     CHECK_EQ(0, deleted);
     isolate2->Exit();
     isolate2->Dispose();
     CHECK_EQ(0, deleted);
   }
   // Should be deleted after the first isolate is destroyed.
-  CollectAllAvailableGarbage(i_isolate1);
+  // We need to invoke GC without stack, otherwise the object may survive.
+  {
+    DisableConservativeStackScanningScopeForTesting scope(i_isolate1->heap());
+    InvokeMemoryReducingMajorGCs(i_isolate1);
+  }
   CHECK_EQ(1, deleted);
   isolate1->Exit();
   isolate1->Dispose();
diff --git a/deps/v8/test/unittests/objects/object-unittest.cc b/deps/v8/test/unittests/objects/object-unittest.cc
index 88313bafdf1c5e..b9bf3a115145cc 100644
--- a/deps/v8/test/unittests/objects/object-unittest.cc
+++ b/deps/v8/test/unittests/objects/object-unittest.cc
@@ -60,7 +60,7 @@ TEST(Object, InstanceTypeListOrder) {
   int prev = -1;
   InstanceType current_type = static_cast<InstanceType>(current);
   EXPECT_EQ(current_type, InstanceType::FIRST_TYPE);
-  EXPECT_EQ(current_type, InstanceType::INTERNALIZED_STRING_TYPE);
+  EXPECT_EQ(current_type, InstanceType::INTERNALIZED_TWO_BYTE_STRING_TYPE);
 #define TEST_INSTANCE_TYPE(type)                                           \
   current_type = InstanceType::type;                                       \
   current = static_cast<int>(current_type);                                \
@@ -161,10 +161,10 @@ TEST_F(TestWithNativeContext, EmptyFunctionScopeInfo) {
   // Check that the empty_function has a properly set up ScopeInfo.
   Handle<JSFunction> function = RunJS<JSFunction>("(function(){})");
 
-  Handle<ScopeInfo> scope_info(function->shared().scope_info(),
+  Handle<ScopeInfo> scope_info(function->shared()->scope_info(),
                                function->GetIsolate());
   Handle<ScopeInfo> empty_function_scope_info(
-      isolate()->empty_function()->shared().scope_info(),
+      isolate()->empty_function()->shared()->scope_info(),
       function->GetIsolate());
 
   EXPECT_EQ(scope_info->Flags(), empty_function_scope_info->Flags());
@@ -177,7 +177,7 @@ TEST_F(TestWithNativeContext, EmptyFunctionScopeInfo) {
 TEST_F(TestWithNativeContext, RecreateScopeInfoWithLocalsBlocklistWorks) {
   // Create a JSFunction to get a {ScopeInfo} we can use for the test.
   Handle<JSFunction> function = RunJS<JSFunction>("(function foo() {})");
-  Handle<ScopeInfo> original_scope_info(function->shared().scope_info(),
+  Handle<ScopeInfo> original_scope_info(function->shared()->scope_info(),
                                         isolate());
   ASSERT_FALSE(original_scope_info->HasLocalsBlockList());
 
@@ -194,8 +194,8 @@ TEST_F(TestWithNativeContext, RecreateScopeInfoWithLocalsBlocklistWorks) {
 
   DisallowGarbageCollection no_gc;
   EXPECT_TRUE(scope_info->HasLocalsBlockList());
-  EXPECT_TRUE(scope_info->LocalsBlockList().Has(isolate(), foo_string));
-  EXPECT_FALSE(scope_info->LocalsBlockList().Has(isolate(), bar_string));
+  EXPECT_TRUE(scope_info->LocalsBlockList()->Has(isolate(), foo_string));
+  EXPECT_FALSE(scope_info->LocalsBlockList()->Has(isolate(), bar_string));
 
   EXPECT_EQ(original_scope_info->length() + 1, scope_info->length());
 
@@ -235,15 +235,12 @@ static void CheckString(Isolate* isolate, const char* value,
 
 static void CheckNumber(Isolate* isolate, double value, const char* string) {
   Handle<Object> number = isolate->factory()->NewNumber(value);
-  CHECK(number->IsNumber());
+  CHECK(IsNumber(*number));
   CheckObject(isolate, number, string);
 }
 
 static void CheckBoolean(Isolate* isolate, bool value, const char* string) {
-  CheckObject(isolate,
-              value ? isolate->factory()->true_value()
-                    : isolate->factory()->false_value(),
-              string);
+  CheckObject(isolate, isolate->factory()->ToBoolean(value), string);
 }
 
 TEST_F(ObjectTest, NoSideEffectsToString) {
@@ -318,143 +315,147 @@ TEST_F(ObjectTest, EnumCache) {
       *context()->Global()->Get(context(), NewString("cc")).ToLocalChecked()));
 
   // Check the transition tree.
-  CHECK_EQ(a->map().instance_descriptors(), b->map().instance_descriptors());
-  CHECK_EQ(b->map().instance_descriptors(), c->map().instance_descriptors());
-  CHECK_NE(c->map().instance_descriptors(), cc->map().instance_descriptors());
-  CHECK_NE(b->map().instance_descriptors(), cc->map().instance_descriptors());
+  CHECK_EQ(a->map()->instance_descriptors(), b->map()->instance_descriptors());
+  CHECK_EQ(b->map()->instance_descriptors(), c->map()->instance_descriptors());
+  CHECK_NE(c->map()->instance_descriptors(), cc->map()->instance_descriptors());
+  CHECK_NE(b->map()->instance_descriptors(), cc->map()->instance_descriptors());
 
   // Check that the EnumLength is unset.
-  CHECK_EQ(a->map().EnumLength(), kInvalidEnumCacheSentinel);
-  CHECK_EQ(b->map().EnumLength(), kInvalidEnumCacheSentinel);
-  CHECK_EQ(c->map().EnumLength(), kInvalidEnumCacheSentinel);
-  CHECK_EQ(cc->map().EnumLength(), kInvalidEnumCacheSentinel);
+  CHECK_EQ(a->map()->EnumLength(), kInvalidEnumCacheSentinel);
+  CHECK_EQ(b->map()->EnumLength(), kInvalidEnumCacheSentinel);
+  CHECK_EQ(c->map()->EnumLength(), kInvalidEnumCacheSentinel);
+  CHECK_EQ(cc->map()->EnumLength(), kInvalidEnumCacheSentinel);
 
   // Check that the EnumCache is empty.
-  CHECK_EQ(a->map().instance_descriptors().enum_cache(),
+  CHECK_EQ(a->map()->instance_descriptors()->enum_cache(),
            *factory->empty_enum_cache());
-  CHECK_EQ(b->map().instance_descriptors().enum_cache(),
+  CHECK_EQ(b->map()->instance_descriptors()->enum_cache(),
            *factory->empty_enum_cache());
-  CHECK_EQ(c->map().instance_descriptors().enum_cache(),
+  CHECK_EQ(c->map()->instance_descriptors()->enum_cache(),
            *factory->empty_enum_cache());
-  CHECK_EQ(cc->map().instance_descriptors().enum_cache(),
+  CHECK_EQ(cc->map()->instance_descriptors()->enum_cache(),
            *factory->empty_enum_cache());
 
   // The EnumCache is shared on the DescriptorArray, creating it on {cc} has no
   // effect on the other maps.
   RunJS("var s = 0; for (let key in cc) { s += cc[key] };");
   {
-    CHECK_EQ(a->map().EnumLength(), kInvalidEnumCacheSentinel);
-    CHECK_EQ(b->map().EnumLength(), kInvalidEnumCacheSentinel);
-    CHECK_EQ(c->map().EnumLength(), kInvalidEnumCacheSentinel);
-    CHECK_EQ(cc->map().EnumLength(), 3);
+    CHECK_EQ(a->map()->EnumLength(), kInvalidEnumCacheSentinel);
+    CHECK_EQ(b->map()->EnumLength(), kInvalidEnumCacheSentinel);
+    CHECK_EQ(c->map()->EnumLength(), kInvalidEnumCacheSentinel);
+    CHECK_EQ(cc->map()->EnumLength(), 3);
 
-    CHECK_EQ(a->map().instance_descriptors().enum_cache(),
+    CHECK_EQ(a->map()->instance_descriptors()->enum_cache(),
              *factory->empty_enum_cache());
-    CHECK_EQ(b->map().instance_descriptors().enum_cache(),
+    CHECK_EQ(b->map()->instance_descriptors()->enum_cache(),
              *factory->empty_enum_cache());
-    CHECK_EQ(c->map().instance_descriptors().enum_cache(),
+    CHECK_EQ(c->map()->instance_descriptors()->enum_cache(),
              *factory->empty_enum_cache());
 
-    EnumCache enum_cache = cc->map().instance_descriptors().enum_cache();
+    Tagged<EnumCache> enum_cache =
+        cc->map()->instance_descriptors()->enum_cache();
     CHECK_NE(enum_cache, *factory->empty_enum_cache());
-    CHECK_EQ(enum_cache.keys().length(), 3);
-    CHECK_EQ(enum_cache.indices().length(), 3);
+    CHECK_EQ(enum_cache->keys()->length(), 3);
+    CHECK_EQ(enum_cache->indices()->length(), 3);
   }
 
   // Initializing the EnumCache for the the topmost map {a} will not create the
   // cache for the other maps.
   RunJS("var s = 0; for (let key in a) { s += a[key] };");
   {
-    CHECK_EQ(a->map().EnumLength(), 1);
-    CHECK_EQ(b->map().EnumLength(), kInvalidEnumCacheSentinel);
-    CHECK_EQ(c->map().EnumLength(), kInvalidEnumCacheSentinel);
-    CHECK_EQ(cc->map().EnumLength(), 3);
+    CHECK_EQ(a->map()->EnumLength(), 1);
+    CHECK_EQ(b->map()->EnumLength(), kInvalidEnumCacheSentinel);
+    CHECK_EQ(c->map()->EnumLength(), kInvalidEnumCacheSentinel);
+    CHECK_EQ(cc->map()->EnumLength(), 3);
 
     // The enum cache is shared on the descriptor array of maps {a}, {b} and
     // {c} only.
-    EnumCache enum_cache = a->map().instance_descriptors().enum_cache();
+    Tagged<EnumCache> enum_cache =
+        a->map()->instance_descriptors()->enum_cache();
     CHECK_NE(enum_cache, *factory->empty_enum_cache());
-    CHECK_NE(cc->map().instance_descriptors().enum_cache(),
+    CHECK_NE(cc->map()->instance_descriptors()->enum_cache(),
              *factory->empty_enum_cache());
-    CHECK_NE(cc->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_EQ(a->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_EQ(b->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_EQ(c->map().instance_descriptors().enum_cache(), enum_cache);
+    CHECK_NE(cc->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_EQ(a->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_EQ(b->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_EQ(c->map()->instance_descriptors()->enum_cache(), enum_cache);
 
-    CHECK_EQ(enum_cache.keys().length(), 1);
-    CHECK_EQ(enum_cache.indices().length(), 1);
+    CHECK_EQ(enum_cache->keys()->length(), 1);
+    CHECK_EQ(enum_cache->indices()->length(), 1);
   }
 
   // Creating the EnumCache for {c} will create a new EnumCache on the shared
   // DescriptorArray.
   Handle<EnumCache> previous_enum_cache(
-      a->map().instance_descriptors().enum_cache(), a->GetIsolate());
+      a->map()->instance_descriptors()->enum_cache(), a->GetIsolate());
   Handle<FixedArray> previous_keys(previous_enum_cache->keys(),
                                    a->GetIsolate());
   Handle<FixedArray> previous_indices(previous_enum_cache->indices(),
                                       a->GetIsolate());
   RunJS("var s = 0; for (let key in c) { s += c[key] };");
   {
-    CHECK_EQ(a->map().EnumLength(), 1);
-    CHECK_EQ(b->map().EnumLength(), kInvalidEnumCacheSentinel);
-    CHECK_EQ(c->map().EnumLength(), 3);
-    CHECK_EQ(cc->map().EnumLength(), 3);
+    CHECK_EQ(a->map()->EnumLength(), 1);
+    CHECK_EQ(b->map()->EnumLength(), kInvalidEnumCacheSentinel);
+    CHECK_EQ(c->map()->EnumLength(), 3);
+    CHECK_EQ(cc->map()->EnumLength(), 3);
 
-    EnumCache enum_cache = c->map().instance_descriptors().enum_cache();
+    Tagged<EnumCache> enum_cache =
+        c->map()->instance_descriptors()->enum_cache();
     CHECK_NE(enum_cache, *factory->empty_enum_cache());
     // The keys and indices caches are updated.
     CHECK_EQ(enum_cache, *previous_enum_cache);
-    CHECK_NE(enum_cache.keys(), *previous_keys);
-    CHECK_NE(enum_cache.indices(), *previous_indices);
+    CHECK_NE(enum_cache->keys(), *previous_keys);
+    CHECK_NE(enum_cache->indices(), *previous_indices);
     CHECK_EQ(previous_keys->length(), 1);
     CHECK_EQ(previous_indices->length(), 1);
-    CHECK_EQ(enum_cache.keys().length(), 3);
-    CHECK_EQ(enum_cache.indices().length(), 3);
+    CHECK_EQ(enum_cache->keys()->length(), 3);
+    CHECK_EQ(enum_cache->indices()->length(), 3);
 
     // The enum cache is shared on the descriptor array of maps {a}, {b} and
     // {c} only.
-    CHECK_NE(cc->map().instance_descriptors().enum_cache(),
+    CHECK_NE(cc->map()->instance_descriptors()->enum_cache(),
              *factory->empty_enum_cache());
-    CHECK_NE(cc->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_NE(cc->map().instance_descriptors().enum_cache(),
+    CHECK_NE(cc->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_NE(cc->map()->instance_descriptors()->enum_cache(),
              *previous_enum_cache);
-    CHECK_EQ(a->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_EQ(b->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_EQ(c->map().instance_descriptors().enum_cache(), enum_cache);
+    CHECK_EQ(a->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_EQ(b->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_EQ(c->map()->instance_descriptors()->enum_cache(), enum_cache);
   }
 
   // {b} can reuse the existing EnumCache, hence we only need to set the correct
   // EnumLength on the map without modifying the cache itself.
   previous_enum_cache =
-      handle(a->map().instance_descriptors().enum_cache(), a->GetIsolate());
+      handle(a->map()->instance_descriptors()->enum_cache(), a->GetIsolate());
   previous_keys = handle(previous_enum_cache->keys(), a->GetIsolate());
   previous_indices = handle(previous_enum_cache->indices(), a->GetIsolate());
   RunJS("var s = 0; for (let key in b) { s += b[key] };");
   {
-    CHECK_EQ(a->map().EnumLength(), 1);
-    CHECK_EQ(b->map().EnumLength(), 2);
-    CHECK_EQ(c->map().EnumLength(), 3);
-    CHECK_EQ(cc->map().EnumLength(), 3);
+    CHECK_EQ(a->map()->EnumLength(), 1);
+    CHECK_EQ(b->map()->EnumLength(), 2);
+    CHECK_EQ(c->map()->EnumLength(), 3);
+    CHECK_EQ(cc->map()->EnumLength(), 3);
 
-    EnumCache enum_cache = c->map().instance_descriptors().enum_cache();
+    Tagged<EnumCache> enum_cache =
+        c->map()->instance_descriptors()->enum_cache();
     CHECK_NE(enum_cache, *factory->empty_enum_cache());
     // The keys and indices caches are not updated.
     CHECK_EQ(enum_cache, *previous_enum_cache);
-    CHECK_EQ(enum_cache.keys(), *previous_keys);
-    CHECK_EQ(enum_cache.indices(), *previous_indices);
-    CHECK_EQ(enum_cache.keys().length(), 3);
-    CHECK_EQ(enum_cache.indices().length(), 3);
+    CHECK_EQ(enum_cache->keys(), *previous_keys);
+    CHECK_EQ(enum_cache->indices(), *previous_indices);
+    CHECK_EQ(enum_cache->keys()->length(), 3);
+    CHECK_EQ(enum_cache->indices()->length(), 3);
 
     // The enum cache is shared on the descriptor array of maps {a}, {b} and
     // {c} only.
-    CHECK_NE(cc->map().instance_descriptors().enum_cache(),
+    CHECK_NE(cc->map()->instance_descriptors()->enum_cache(),
              *factory->empty_enum_cache());
-    CHECK_NE(cc->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_NE(cc->map().instance_descriptors().enum_cache(),
+    CHECK_NE(cc->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_NE(cc->map()->instance_descriptors()->enum_cache(),
              *previous_enum_cache);
-    CHECK_EQ(a->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_EQ(b->map().instance_descriptors().enum_cache(), enum_cache);
-    CHECK_EQ(c->map().instance_descriptors().enum_cache(), enum_cache);
+    CHECK_EQ(a->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_EQ(b->map()->instance_descriptors()->enum_cache(), enum_cache);
+    CHECK_EQ(c->map()->instance_descriptors()->enum_cache(), enum_cache);
   }
 }
 
@@ -462,20 +463,20 @@ TEST_F(ObjectTest, ObjectMethodsThatTruncateMinusZero) {
   Factory* factory = i_isolate()->factory();
 
   Handle<Object> minus_zero = factory->NewNumber(-1.0 * 0.0);
-  CHECK(minus_zero->IsMinusZero());
+  CHECK(IsMinusZero(*minus_zero));
 
   Handle<Object> result =
       Object::ToInteger(i_isolate(), minus_zero).ToHandleChecked();
-  CHECK(result->IsZero());
+  CHECK(IsZero(*result));
 
   result = Object::ToLength(i_isolate(), minus_zero).ToHandleChecked();
-  CHECK(result->IsZero());
+  CHECK(IsZero(*result));
 
   // Choose an error message template, doesn't matter which.
   result = Object::ToIndex(i_isolate(), minus_zero,
                            MessageTemplate::kInvalidAtomicAccessIndex)
                .ToHandleChecked();
-  CHECK(result->IsZero());
+  CHECK(IsZero(*result));
 }
 
 #define TEST_FUNCTION_KIND(Name)                                            \
@@ -660,9 +661,10 @@ TEST_F(ObjectTest, ConstructorInstanceTypes) {
 
   DisallowGarbageCollection no_gc;
   for (int i = 0; i < Context::NATIVE_CONTEXT_SLOTS; i++) {
-    Object value = context->get(i);
-    if (!value.IsJSFunction()) continue;
-    InstanceType instance_type = JSFunction::cast(value).map().instance_type();
+    Tagged<Object> value = context->get(i);
+    if (!IsJSFunction(value)) continue;
+    InstanceType instance_type =
+        JSFunction::cast(value)->map()->instance_type();
 
     switch (i) {
       case Context::ARRAY_FUNCTION_INDEX:
@@ -746,7 +748,7 @@ TEST_F(ObjectTest, AddDataPropertyNameCollisionDeprecatedMap) {
       "a.corrupted_prop = 1;"
       "b.regular_prop = 5.5;");
 
-  CHECK(a->map().is_deprecated());
+  CHECK(a->map()->is_deprecated());
 
   EXPECT_DEATH_IF_SUPPORTED(
       Object::AddDataProperty(&it, value, NONE,
diff --git a/deps/v8/test/unittests/objects/roots-unittest.cc b/deps/v8/test/unittests/objects/roots-unittest.cc
index 17e20e3fbc6569..f4acd2ad70adb2 100644
--- a/deps/v8/test/unittests/objects/roots-unittest.cc
+++ b/deps/v8/test/unittests/objects/roots-unittest.cc
@@ -18,8 +18,8 @@ namespace internal {
 using RootsTest = TestWithIsolate;
 
 namespace {
-AllocationSpace GetSpaceFromObject(Object object) {
-  DCHECK(object.IsHeapObject());
+AllocationSpace GetSpaceFromObject(Tagged<Object> object) {
+  DCHECK(IsHeapObject(object));
   BasicMemoryChunk* chunk =
       BasicMemoryChunk::FromHeapObject(HeapObject::cast(object));
   if (chunk->InReadOnlySpace()) return RO_SPACE;
@@ -42,7 +42,11 @@ TEST_F(RootsTest, TestReadOnlyRoots) {
 #undef CHECK_IN_RO_SPACE
 
 namespace {
-bool IsInitiallyMutable(Factory* factory, Address object_address) {
+// Applies to objects in mutable root slots; specific slots may point into RO
+// space (e.g. because the slot value may change and only the initial value is
+// in RO space; or, because RO promotion dynamically decides whether to promote
+// the slot value to RO space).
+bool CanBeInReadOnlySpace(Factory* factory, Handle<Object> object) {
 // Entries in this list are in STRONG_MUTABLE_MOVABLE_ROOT_LIST, but may
 // initially point to objects that are in RO_SPACE.
 #define INITIALLY_READ_ONLY_ROOT_LIST(V)  \
@@ -64,28 +68,36 @@ bool IsInitiallyMutable(Factory* factory, Address object_address) {
   V(weak_refs_keep_during_job)
 
 #define TEST_CAN_BE_READ_ONLY(name) \
-  if (factory->name().address() == object_address) return false;
+  if (factory->name().address() == object.address()) return true;
   INITIALLY_READ_ONLY_ROOT_LIST(TEST_CAN_BE_READ_ONLY)
 #undef TEST_CAN_BE_READ_ONLY
 #undef INITIALLY_READ_ONLY_ROOT_LIST
-  return true;
+
+  // May be promoted to RO space, see read-only-promotion.h.
+  if (IsAccessorInfo(*object)) return true;
+  if (IsCallHandlerInfo(*object)) return true;
+  if (IsFunctionTemplateInfo(*object)) return true;
+  if (IsFunctionTemplateRareData(*object)) return true;
+  if (IsSharedFunctionInfo(*object)) return true;
+
+  return false;
 }
 }  // namespace
 
 // The CHECK_EQ line is there just to ensure that the root is publicly
 // accessible from Heap, but ultimately the factory is used as it provides
 // handles that have the address in the root table.
-#define CHECK_NOT_IN_RO_SPACE(type, name, CamelName)                         \
-  Handle<Object> name = factory->name();                                     \
-  CHECK_EQ(*name, heap->name());                                             \
-  if (name->IsHeapObject() && IsInitiallyMutable(factory, name.address()) && \
-      !name->IsUndefined(i_isolate())) {                                     \
-    CHECK_NE(RO_SPACE, GetSpaceFromObject(HeapObject::cast(*name)));         \
+#define CHECK_NOT_IN_RO_SPACE(type, name, CamelName)                 \
+  Handle<Object> name = factory->name();                             \
+  CHECK_EQ(*name, heap->name());                                     \
+  if (IsHeapObject(*name) && !CanBeInReadOnlySpace(factory, name) && \
+      !IsUndefined(*name, i_isolate())) {                            \
+    CHECK_NE(RO_SPACE, GetSpaceFromObject(HeapObject::cast(*name))); \
   }
 
 // The following tests check that all the roots accessible via public Heap
-// accessors are not in RO_SPACE with the exception of the objects listed in
-// INITIALLY_READ_ONLY_ROOT_LIST.
+// accessors are not in RO_SPACE (with some exceptions, see
+// CanBeInReadOnlySpace).
 TEST_F(RootsTest, TestHeapRootsNotReadOnly) {
   Factory* factory = i_isolate()->factory();
   Heap* heap = i_isolate()->heap();
@@ -100,7 +112,7 @@ TEST_F(RootsTest, TestHeapNumberList) {
     auto obj = roots.object_at(pos);
     bool in_nr_range = pos >= RootIndex::kFirstHeapNumberRoot &&
                        pos <= RootIndex::kLastHeapNumberRoot;
-    CHECK_EQ(obj.IsHeapNumber(), in_nr_range);
+    CHECK_EQ(IsHeapNumber(obj), in_nr_range);
   }
 }
 
diff --git a/deps/v8/test/unittests/objects/symbols-unittest.cc b/deps/v8/test/unittests/objects/symbols-unittest.cc
index ca94c262f47425..d1f6247dae2ef3 100644
--- a/deps/v8/test/unittests/objects/symbols-unittest.cc
+++ b/deps/v8/test/unittests/objects/symbols-unittest.cc
@@ -50,28 +50,28 @@ TEST_F(SymbolsTest, Create) {
   StdoutStream os;
   for (int i = 0; i < kNumSymbols; ++i) {
     symbols[i] = isolate()->factory()->NewSymbol();
-    CHECK(symbols[i]->IsName());
-    CHECK(symbols[i]->IsSymbol());
+    CHECK(IsName(*symbols[i]));
+    CHECK(IsSymbol(*symbols[i]));
     CHECK(symbols[i]->HasHashCode());
-    CHECK(symbols[i]->IsUniqueName());
+    CHECK(IsUniqueName(*symbols[i]));
     CHECK_GT(symbols[i]->hash(), 0u);
     os << Brief(*symbols[i]) << "\n";
 #if OBJECT_PRINT
-    symbols[i]->Print(os);
+    Print(*symbols[i], os);
 #endif
 #if VERIFY_HEAP
-    symbols[i]->ObjectVerify(isolate());
+    Object::ObjectVerify(*symbols[i], isolate());
 #endif
   }
 
-  CollectGarbage(i::NEW_SPACE);
-  CollectAllGarbage();
+  InvokeMinorGC();
+  InvokeMajorGC();
 
   // All symbols should be distinct.
   for (int i = 0; i < kNumSymbols; ++i) {
-    CHECK(symbols[i]->SameValue(*symbols[i]));
+    CHECK(Object::SameValue(*symbols[i], *symbols[i]));
     for (int j = i + 1; j < kNumSymbols; ++j) {
-      CHECK(!symbols[i]->SameValue(*symbols[j]));
+      CHECK(!Object::SameValue(*symbols[i], *symbols[j]));
     }
   }
 }
diff --git a/deps/v8/test/unittests/objects/value-serializer-unittest.cc b/deps/v8/test/unittests/objects/value-serializer-unittest.cc
index 8298dc9decd888..deed350e31430b 100644
--- a/deps/v8/test/unittests/objects/value-serializer-unittest.cc
+++ b/deps/v8/test/unittests/objects/value-serializer-unittest.cc
@@ -53,22 +53,25 @@ class ValueSerializerTest : public TestWithIsolate {
     // Create a host object type that can be tested through
     // serialization/deserialization delegates below.
     Local<FunctionTemplate> function_template = v8::FunctionTemplate::New(
-        isolate(), [](const FunctionCallbackInfo<Value>& args) {
-          args.Holder()->SetInternalField(0, args[0]);
-          args.Holder()->SetInternalField(1, args[1]);
+        isolate(), [](const FunctionCallbackInfo<Value>& info) {
+          CHECK(i::ValidateCallbackInfo(info));
+          info.Holder()->SetInternalField(0, info[0]);
+          info.Holder()->SetInternalField(1, info[1]);
         });
     function_template->InstanceTemplate()->SetInternalFieldCount(2);
     function_template->InstanceTemplate()->SetAccessor(
         StringFromUtf8("value"),
-        [](Local<String> property, const PropertyCallbackInfo<Value>& args) {
-          args.GetReturnValue().Set(
-              args.Holder()->GetInternalField(0).As<v8::Value>());
+        [](Local<String> property, const PropertyCallbackInfo<Value>& info) {
+          CHECK(i::ValidateCallbackInfo(info));
+          info.GetReturnValue().Set(
+              info.Holder()->GetInternalField(0).As<v8::Value>());
         });
     function_template->InstanceTemplate()->SetAccessor(
         StringFromUtf8("value2"),
-        [](Local<String> property, const PropertyCallbackInfo<Value>& args) {
-          args.GetReturnValue().Set(
-              args.Holder()->GetInternalField(1).As<v8::Value>());
+        [](Local<String> property, const PropertyCallbackInfo<Value>& info) {
+          CHECK(i::ValidateCallbackInfo(info));
+          info.GetReturnValue().Set(
+              info.Holder()->GetInternalField(1).As<v8::Value>());
         });
     for (Local<Context> context :
          {serialization_context_, deserialization_context_}) {
@@ -2629,18 +2632,6 @@ class ValueSerializerTestWithSharedArrayBufferClone
     return sab;
   }
 
-  static void SetUpTestSuite() {
-    flag_was_enabled_ = i::v8_flags.harmony_sharedarraybuffer;
-    i::v8_flags.harmony_sharedarraybuffer = true;
-    ValueSerializerTest::SetUpTestSuite();
-  }
-
-  static void TearDownTestSuite() {
-    ValueSerializerTest::TearDownTestSuite();
-    i::v8_flags.harmony_sharedarraybuffer = flag_was_enabled_;
-    flag_was_enabled_ = false;
-  }
-
  protected:
 // GMock doesn't use the "override" keyword.
 #if __clang__
@@ -2690,14 +2681,11 @@ class ValueSerializerTestWithSharedArrayBufferClone
   DeserializerDelegate deserializer_delegate_;
 
  private:
-  static bool flag_was_enabled_;
   std::vector<uint8_t> data_;
   Local<SharedArrayBuffer> input_buffer_;
   Local<SharedArrayBuffer> output_buffer_;
 };
 
-bool ValueSerializerTestWithSharedArrayBufferClone::flag_was_enabled_ = false;
-
 TEST_F(ValueSerializerTestWithSharedArrayBufferClone,
        RoundTripSharedArrayBufferClone) {
   InitializeData({0x00, 0x01, 0x80, 0xFF}, false);
@@ -2751,8 +2739,8 @@ TEST_F(ValueSerializerTestWithSharedArrayBufferClone,
     const int32_t kMaxPages = 1;
     i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate());
     i::Handle<i::JSArrayBuffer> obj = Utils::OpenHandle(*input_buffer());
-    input = Utils::Convert<i::WasmMemoryObject, Value>(
-        i::WasmMemoryObject::New(i_isolate, obj, kMaxPages).ToHandleChecked());
+    input = Utils::Convert<i::WasmMemoryObject, Value>(i::WasmMemoryObject::New(
+        i_isolate, obj, kMaxPages, i::WasmMemoryFlag::kWasmMemory32));
   }
   RoundTripTest(input);
   ExpectScriptTrue("result instanceof WebAssembly.Memory");
@@ -2783,9 +2771,8 @@ TEST_F(ValueSerializerTestWithSharedArrayBufferClone,
     const int32_t kMaxPages = 1;
     i::Isolate* i_isolate = reinterpret_cast<i::Isolate*>(isolate());
     i::Handle<i::JSArrayBuffer> buffer = Utils::OpenHandle(*input_buffer());
-    i::Handle<i::WasmMemoryObject> wasm_memory =
-        i::WasmMemoryObject::New(i_isolate, buffer, kMaxPages)
-            .ToHandleChecked();
+    i::Handle<i::WasmMemoryObject> wasm_memory = i::WasmMemoryObject::New(
+        i_isolate, buffer, kMaxPages, i::WasmMemoryFlag::kWasmMemory32);
     i::Handle<i::FixedArray> fixed_array =
         i_isolate->factory()->NewFixedArray(2);
     fixed_array->set(0, *buffer);
diff --git a/deps/v8/test/unittests/objects/weakmaps-unittest.cc b/deps/v8/test/unittests/objects/weakmaps-unittest.cc
index 79f07aa93886d3..799a5667c2d7e9 100644
--- a/deps/v8/test/unittests/objects/weakmaps-unittest.cc
+++ b/deps/v8/test/unittests/objects/weakmaps-unittest.cc
@@ -80,9 +80,9 @@ TEST_F(WeakMapsTest, Weakness) {
     Handle<Map> map = factory->NewMap(JS_OBJECT_TYPE, JSObject::kHeaderSize);
     Handle<JSObject> object = factory->NewJSObjectFromMap(map);
     Handle<Smi> smi(Smi::FromInt(23), isolate);
-    int32_t hash = key->GetOrCreateHash(isolate).value();
+    int32_t hash = Object::GetOrCreateHash(*key, isolate).value();
     JSWeakCollection::Set(weakmap, key, object, hash);
-    int32_t object_hash = object->GetOrCreateHash(isolate).value();
+    int32_t object_hash = Object::GetOrCreateHash(*object, isolate).value();
     JSWeakCollection::Set(weakmap, object, smi, object_hash);
   }
   // Put a symbol key into weak map.
@@ -92,15 +92,15 @@ TEST_F(WeakMapsTest, Weakness) {
     Handle<Smi> smi(Smi::FromInt(23), isolate);
     JSWeakCollection::Set(weakmap, symbol, smi, symbol->hash());
   }
-  CHECK_EQ(3, EphemeronHashTable::cast(weakmap->table()).NumberOfElements());
+  CHECK_EQ(3, EphemeronHashTable::cast(weakmap->table())->NumberOfElements());
 
   // Force a full GC.
-  PreciseCollectAllGarbage();
+  InvokeAtomicMajorGC();
   CHECK_EQ(0, NumberOfWeakCalls);
   // Symbol key should be deleted.
-  CHECK_EQ(2, EphemeronHashTable::cast(weakmap->table()).NumberOfElements());
+  CHECK_EQ(2, EphemeronHashTable::cast(weakmap->table())->NumberOfElements());
   CHECK_EQ(
-      1, EphemeronHashTable::cast(weakmap->table()).NumberOfDeletedElements());
+      1, EphemeronHashTable::cast(weakmap->table())->NumberOfDeletedElements());
 
   // Make the global reference to the key weak.
   std::pair<Handle<Object>*, int> handle_and_id(&key, 1234);
@@ -109,11 +109,11 @@ TEST_F(WeakMapsTest, Weakness) {
       &WeakPointerCallback, v8::WeakCallbackType::kParameter);
   CHECK(global_handles->IsWeak(key.location()));
 
-  PreciseCollectAllGarbage();
+  InvokeAtomicMajorGC();
   CHECK_EQ(1, NumberOfWeakCalls);
-  CHECK_EQ(0, EphemeronHashTable::cast(weakmap->table()).NumberOfElements());
+  CHECK_EQ(0, EphemeronHashTable::cast(weakmap->table())->NumberOfElements());
   CHECK_EQ(
-      3, EphemeronHashTable::cast(weakmap->table()).NumberOfDeletedElements());
+      3, EphemeronHashTable::cast(weakmap->table())->NumberOfDeletedElements());
 }
 
 TEST_F(WeakMapsTest, Shrinking) {
@@ -125,7 +125,7 @@ TEST_F(WeakMapsTest, Shrinking) {
   Handle<JSWeakMap> weakmap = isolate->factory()->NewJSWeakMap();
 
   // Check initial capacity.
-  CHECK_EQ(32, EphemeronHashTable::cast(weakmap->table()).Capacity());
+  CHECK_EQ(32, EphemeronHashTable::cast(weakmap->table())->Capacity());
 
   // Fill up weak map to trigger capacity change.
   {
@@ -134,31 +134,33 @@ TEST_F(WeakMapsTest, Shrinking) {
     for (int i = 0; i < 32; i++) {
       Handle<JSObject> object = factory->NewJSObjectFromMap(map);
       Handle<Smi> smi(Smi::FromInt(i), isolate);
-      int32_t object_hash = object->GetOrCreateHash(isolate).value();
+      int32_t object_hash = Object::GetOrCreateHash(*object, isolate).value();
       JSWeakCollection::Set(weakmap, object, smi, object_hash);
     }
   }
 
   // Check increased capacity.
-  CHECK_EQ(128, EphemeronHashTable::cast(weakmap->table()).Capacity());
+  CHECK_EQ(128, EphemeronHashTable::cast(weakmap->table())->Capacity());
 
   // Force a full GC.
-  CHECK_EQ(32, EphemeronHashTable::cast(weakmap->table()).NumberOfElements());
+  CHECK_EQ(32, EphemeronHashTable::cast(weakmap->table())->NumberOfElements());
   CHECK_EQ(
-      0, EphemeronHashTable::cast(weakmap->table()).NumberOfDeletedElements());
-  PreciseCollectAllGarbage();
-  CHECK_EQ(0, EphemeronHashTable::cast(weakmap->table()).NumberOfElements());
+      0, EphemeronHashTable::cast(weakmap->table())->NumberOfDeletedElements());
+  InvokeAtomicMajorGC();
+  CHECK_EQ(0, EphemeronHashTable::cast(weakmap->table())->NumberOfElements());
   CHECK_EQ(
-      32, EphemeronHashTable::cast(weakmap->table()).NumberOfDeletedElements());
+      32,
+      EphemeronHashTable::cast(weakmap->table())->NumberOfDeletedElements());
 
   // Check shrunk capacity.
-  CHECK_EQ(32, EphemeronHashTable::cast(weakmap->table()).Capacity());
+  CHECK_EQ(32, EphemeronHashTable::cast(weakmap->table())->Capacity());
 }
 
 namespace {
-bool EphemeronHashTableContainsKey(EphemeronHashTable table, HeapObject key) {
-  for (InternalIndex i : table.IterateEntries()) {
-    if (table.KeyAt(i) == key) return true;
+bool EphemeronHashTableContainsKey(Tagged<EphemeronHashTable> table,
+                                   Tagged<HeapObject> key) {
+  for (InternalIndex i : table->IterateEntries()) {
+    if (table->KeyAt(i) == key) return true;
   }
   return false;
 }
@@ -170,26 +172,26 @@ TEST_F(WeakMapsTest, WeakMapPromotionMarkCompact) {
   HandleScope scope(isolate);
   Handle<JSWeakMap> weakmap = isolate->factory()->NewJSWeakMap();
 
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CHECK(!ObjectInYoungGeneration(weakmap->table()));
 
   Handle<Map> map = factory->NewMap(JS_OBJECT_TYPE, JSObject::kHeaderSize);
   Handle<JSObject> object = factory->NewJSObjectFromMap(map);
   Handle<Smi> smi(Smi::FromInt(1), isolate);
-  int32_t object_hash = object->GetOrCreateHash(isolate).value();
+  int32_t object_hash = Object::GetOrCreateHash(*object, isolate).value();
   JSWeakCollection::Set(weakmap, object, smi, object_hash);
 
   CHECK(EphemeronHashTableContainsKey(
       EphemeronHashTable::cast(weakmap->table()), *object));
-  CollectAllGarbage();
+  InvokeMajorGC();
 
   CHECK(!ObjectInYoungGeneration(*object));
   CHECK(!ObjectInYoungGeneration(weakmap->table()));
   CHECK(EphemeronHashTableContainsKey(
       EphemeronHashTable::cast(weakmap->table()), *object));
 
-  CollectAllGarbage();
+  InvokeMajorGC();
   CHECK(!ObjectInYoungGeneration(*object));
   CHECK(!ObjectInYoungGeneration(weakmap->table()));
   CHECK(EphemeronHashTableContainsKey(
@@ -204,27 +206,27 @@ TEST_F(WeakMapsTest, WeakMapScavenge) {
   HandleScope scope(isolate);
   Handle<JSWeakMap> weakmap = isolate->factory()->NewJSWeakMap();
 
-  GcAndSweep(NEW_SPACE);
+  InvokeAtomicMinorGC();
   CHECK(ObjectInYoungGeneration(weakmap->table()));
 
   Handle<Map> map = factory->NewMap(JS_OBJECT_TYPE, JSObject::kHeaderSize);
   Handle<JSObject> object = factory->NewJSObjectFromMap(map);
   Handle<Smi> smi(Smi::FromInt(1), isolate);
-  int32_t object_hash = object->GetOrCreateHash(isolate).value();
+  int32_t object_hash = Object::GetOrCreateHash(*object, isolate).value();
   JSWeakCollection::Set(weakmap, object, smi, object_hash);
 
   CHECK(EphemeronHashTableContainsKey(
       EphemeronHashTable::cast(weakmap->table()), *object));
 
-  if (!v8_flags.minor_mc) {
-    GcAndSweep(NEW_SPACE);
+  if (!v8_flags.minor_ms) {
+    InvokeAtomicMinorGC();
     CHECK(ObjectInYoungGeneration(*object));
     CHECK(!ObjectInYoungGeneration(weakmap->table()));
     CHECK(EphemeronHashTableContainsKey(
         EphemeronHashTable::cast(weakmap->table()), *object));
   }
 
-  GcAndSweep(OLD_SPACE);
+  InvokeAtomicMajorGC();
   CHECK(!ObjectInYoungGeneration(*object));
   CHECK(!ObjectInYoungGeneration(weakmap->table()));
   CHECK(EphemeronHashTableContainsKey(
@@ -260,14 +262,14 @@ TEST_F(WeakMapsTest, Regress2060a) {
       CHECK(!Heap::InYoungGeneration(*object));
       CHECK_IMPLIES(!v8_flags.enable_third_party_heap,
                     !first_page->Contains(object->address()));
-      int32_t hash = key->GetOrCreateHash(isolate).value();
+      int32_t hash = Object::GetOrCreateHash(*key, isolate).value();
       JSWeakCollection::Set(weakmap, key, object, hash);
     }
   }
 
   // Force compacting garbage collection.
   CHECK(v8_flags.compact_on_every_full_gc);
-  CollectAllGarbage();
+  InvokeMajorGC();
 }
 
 // Test that weak map keys on an evacuation candidate which are reachable by
@@ -302,16 +304,16 @@ TEST_F(WeakMapsTest, Regress2060b) {
   Handle<JSWeakMap> weakmap = isolate->factory()->NewJSWeakMap();
   for (int i = 0; i < 32; i++) {
     Handle<Smi> smi(Smi::FromInt(i), isolate);
-    int32_t hash = keys[i]->GetOrCreateHash(isolate).value();
+    int32_t hash = Object::GetOrCreateHash(*keys[i], isolate).value();
     JSWeakCollection::Set(weakmap, keys[i], smi, hash);
   }
 
   // Force compacting garbage collection. The subsequent collections are used
   // to verify that key references were actually updated.
   CHECK(v8_flags.compact_on_every_full_gc);
-  CollectAllGarbage();
-  CollectAllGarbage();
-  CollectAllGarbage();
+  InvokeMajorGC();
+  InvokeMajorGC();
+  InvokeMajorGC();
 }
 
 TEST_F(WeakMapsTest, Regress399527) {
@@ -327,7 +329,7 @@ TEST_F(WeakMapsTest, Regress399527) {
   // The weak map is marked black here but leaving the handle scope will make
   // the object unreachable. Aborting incremental marking will clear all the
   // marking bits which makes the weak map garbage.
-  CollectAllGarbage();
+  InvokeMajorGC();
 }
 
 TEST_F(WeakMapsTest, WeakMapsWithChainedEntries) {
@@ -352,12 +354,12 @@ TEST_F(WeakMapsTest, WeakMapsWithChainedEntries) {
     g2.SetWeak();
     Handle<Object> i_o1 = v8::Utils::OpenHandle(*o1);
     Handle<Object> i_o2 = v8::Utils::OpenHandle(*o2);
-    int32_t hash1 = i_o1->GetOrCreateHash(i_isolate()).value();
-    int32_t hash2 = i_o2->GetOrCreateHash(i_isolate()).value();
+    int32_t hash1 = Object::GetOrCreateHash(*i_o1, i_isolate()).value();
+    int32_t hash2 = Object::GetOrCreateHash(*i_o2, i_isolate()).value();
     JSWeakCollection::Set(weakmap1, i_o1, i_o2, hash1);
     JSWeakCollection::Set(weakmap2, i_o2, i_o1, hash2);
   }
-  CollectGarbage(OLD_SPACE);
+  InvokeMajorGC();
   CHECK(g1.IsEmpty());
   CHECK(g2.IsEmpty());
   CHECK_EQ(1, i_isolate()->heap()->gc_count() - initial_gc_count);
diff --git a/deps/v8/test/unittests/objects/weaksets-unittest.cc b/deps/v8/test/unittests/objects/weaksets-unittest.cc
index b2a9df3a0cc380..f97d3abf6783b0 100644
--- a/deps/v8/test/unittests/objects/weaksets-unittest.cc
+++ b/deps/v8/test/unittests/objects/weaksets-unittest.cc
@@ -60,6 +60,7 @@ class WeakSetsTest : public TestWithHeapInternalsAndContext {
   }
 };
 
+namespace {
 static int NumberOfWeakCalls = 0;
 static void WeakPointerCallback(const v8::WeakCallbackInfo<void>& data) {
   std::pair<v8::Persistent<v8::Value>*, int>* p =
@@ -69,6 +70,7 @@ static void WeakPointerCallback(const v8::WeakCallbackInfo<void>& data) {
   NumberOfWeakCalls++;
   p->first->Reset();
 }
+}  // namespace
 
 TEST_F(WeakSetsTest, WeakSet_Weakness) {
   v8_flags.incremental_marking = false;
@@ -91,17 +93,17 @@ TEST_F(WeakSetsTest, WeakSet_Weakness) {
   {
     HandleScope inner_scope(i_isolate());
     Handle<Smi> smi(Smi::FromInt(23), i_isolate());
-    int32_t hash = key->GetOrCreateHash(i_isolate()).value();
+    int32_t hash = Object::GetOrCreateHash(*key, i_isolate()).value();
     JSWeakCollection::Set(weakset, key, smi, hash);
   }
-  CHECK_EQ(1, EphemeronHashTable::cast(weakset->table()).NumberOfElements());
+  CHECK_EQ(1, EphemeronHashTable::cast(weakset->table())->NumberOfElements());
 
   // Force a full GC.
-  PreciseCollectAllGarbage();
+  InvokeAtomicMajorGC();
   CHECK_EQ(0, NumberOfWeakCalls);
-  CHECK_EQ(1, EphemeronHashTable::cast(weakset->table()).NumberOfElements());
+  CHECK_EQ(1, EphemeronHashTable::cast(weakset->table())->NumberOfElements());
   CHECK_EQ(
-      0, EphemeronHashTable::cast(weakset->table()).NumberOfDeletedElements());
+      0, EphemeronHashTable::cast(weakset->table())->NumberOfDeletedElements());
 
   // Make the global reference to the key weak.
   std::pair<Handle<Object>*, int> handle_and_id(&key, 1234);
@@ -110,11 +112,14 @@ TEST_F(WeakSetsTest, WeakSet_Weakness) {
       &WeakPointerCallback, v8::WeakCallbackType::kParameter);
   CHECK(global_handles->IsWeak(key.location()));
 
-  PreciseCollectAllGarbage();
+  // We need to invoke GC without stack here, otherwise the object may survive.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+      isolate()->heap());
+  InvokeAtomicMajorGC();
   CHECK_EQ(1, NumberOfWeakCalls);
-  CHECK_EQ(0, EphemeronHashTable::cast(weakset->table()).NumberOfElements());
+  CHECK_EQ(0, EphemeronHashTable::cast(weakset->table())->NumberOfElements());
   CHECK_EQ(
-      1, EphemeronHashTable::cast(weakset->table()).NumberOfDeletedElements());
+      1, EphemeronHashTable::cast(weakset->table())->NumberOfDeletedElements());
 }
 
 TEST_F(WeakSetsTest, WeakSet_Shrinking) {
@@ -123,7 +128,7 @@ TEST_F(WeakSetsTest, WeakSet_Shrinking) {
   Handle<JSWeakSet> weakset = AllocateJSWeakSet();
 
   // Check initial capacity.
-  CHECK_EQ(32, EphemeronHashTable::cast(weakset->table()).Capacity());
+  CHECK_EQ(32, EphemeronHashTable::cast(weakset->table())->Capacity());
 
   // Fill up weak set to trigger capacity change.
   {
@@ -132,25 +137,26 @@ TEST_F(WeakSetsTest, WeakSet_Shrinking) {
     for (int i = 0; i < 32; i++) {
       Handle<JSObject> object = factory->NewJSObjectFromMap(map);
       Handle<Smi> smi(Smi::FromInt(i), i_isolate());
-      int32_t hash = object->GetOrCreateHash(i_isolate()).value();
+      int32_t hash = Object::GetOrCreateHash(*object, i_isolate()).value();
       JSWeakCollection::Set(weakset, object, smi, hash);
     }
   }
 
   // Check increased capacity.
-  CHECK_EQ(128, EphemeronHashTable::cast(weakset->table()).Capacity());
+  CHECK_EQ(128, EphemeronHashTable::cast(weakset->table())->Capacity());
 
   // Force a full GC.
-  CHECK_EQ(32, EphemeronHashTable::cast(weakset->table()).NumberOfElements());
+  CHECK_EQ(32, EphemeronHashTable::cast(weakset->table())->NumberOfElements());
   CHECK_EQ(
-      0, EphemeronHashTable::cast(weakset->table()).NumberOfDeletedElements());
-  PreciseCollectAllGarbage();
-  CHECK_EQ(0, EphemeronHashTable::cast(weakset->table()).NumberOfElements());
+      0, EphemeronHashTable::cast(weakset->table())->NumberOfDeletedElements());
+  InvokeAtomicMajorGC();
+  CHECK_EQ(0, EphemeronHashTable::cast(weakset->table())->NumberOfElements());
   CHECK_EQ(
-      32, EphemeronHashTable::cast(weakset->table()).NumberOfDeletedElements());
+      32,
+      EphemeronHashTable::cast(weakset->table())->NumberOfDeletedElements());
 
   // Check shrunk capacity.
-  CHECK_EQ(32, EphemeronHashTable::cast(weakset->table()).Capacity());
+  CHECK_EQ(32, EphemeronHashTable::cast(weakset->table())->Capacity());
 }
 
 // Test that weak set values on an evacuation candidate which are not reachable
@@ -181,14 +187,16 @@ TEST_F(WeakSetsTest, WeakSet_Regress2060a) {
       CHECK(!Heap::InYoungGeneration(*object));
       CHECK_IMPLIES(!v8_flags.enable_third_party_heap,
                     !first_page->Contains(object->address()));
-      int32_t hash = key->GetOrCreateHash(i_isolate()).value();
+      int32_t hash = Object::GetOrCreateHash(*key, i_isolate()).value();
       JSWeakCollection::Set(weakset, key, object, hash);
     }
   }
 
   // Force compacting garbage collection.
   CHECK(v8_flags.compact_on_every_full_gc);
-  CollectAllGarbage();
+  // We need to invoke GC without stack, otherwise no compaction is performed.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+  InvokeMajorGC();
 }
 
 // Test that weak set keys on an evacuation candidate which are reachable by
@@ -223,16 +231,18 @@ TEST_F(WeakSetsTest, WeakSet_Regress2060b) {
   Handle<JSWeakSet> weakset = AllocateJSWeakSet();
   for (int i = 0; i < 32; i++) {
     Handle<Smi> smi(Smi::FromInt(i), i_isolate());
-    int32_t hash = keys[i]->GetOrCreateHash(i_isolate()).value();
+    int32_t hash = Object::GetOrCreateHash(*keys[i], i_isolate()).value();
     JSWeakCollection::Set(weakset, keys[i], smi, hash);
   }
 
   // Force compacting garbage collection. The subsequent collections are used
   // to verify that key references were actually updated.
   CHECK(v8_flags.compact_on_every_full_gc);
-  CollectAllGarbage();
-  CollectAllGarbage();
-  CollectAllGarbage();
+  // We need to invoke GC without stack, otherwise no compaction is performed.
+  DisableConservativeStackScanningScopeForTesting no_stack_scanning(heap);
+  InvokeMajorGC();
+  InvokeMajorGC();
+  InvokeMajorGC();
 }
 
 }  // namespace test_weaksets
diff --git a/deps/v8/test/unittests/parser/decls-unittest.cc b/deps/v8/test/unittests/parser/decls-unittest.cc
index 8b12db12e3e554..d08a8cfefd920e 100644
--- a/deps/v8/test/unittests/parser/decls-unittest.cc
+++ b/deps/v8/test/unittests/parser/decls-unittest.cc
@@ -31,7 +31,7 @@
 #include "include/v8-initialization.h"
 #include "include/v8-template.h"
 #include "src/init/v8.h"
-#include "test/unittests/test-utils.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace v8 {
@@ -145,8 +145,7 @@ void DeclarationContext::Check(const char* source, int get, int set, int query,
   InitializeIfNeeded();
   // A retry after a GC may pollute the counts, so perform gc now
   // to avoid that.
-  i_isolate()->heap()->CollectGarbage(i::NEW_SPACE,
-                                      i::GarbageCollectionReason::kTesting);
+  InvokeMinorGC(i_isolate());
   HandleScope scope(isolate_);
   TryCatch catcher(isolate_);
   catcher.SetVerbose(true);
@@ -175,8 +174,7 @@ void DeclarationContext::Check(const char* source, int get, int set, int query,
     }
   }
   // Clean slate for the next test.
-  i_isolate()->heap()->CollectAllAvailableGarbage(
-      i::GarbageCollectionReason::kTesting);
+  InvokeMemoryReducingMajorGCs(i_isolate());
 }
 
 void DeclarationContext::HandleGet(
diff --git a/deps/v8/test/unittests/parser/parse-decision-unittest.cc b/deps/v8/test/unittests/parser/parse-decision-unittest.cc
index 8ac2bf23c03042..3ac74b7ffe29e2 100644
--- a/deps/v8/test/unittests/parser/parse-decision-unittest.cc
+++ b/deps/v8/test/unittests/parser/parse-decision-unittest.cc
@@ -43,12 +43,12 @@ void GetTopLevelFunctionInfo(
   // The API object 'wraps' the compiled top-level function, not the i::Script.
   Handle<JSFunction> toplevel_fn = v8::Utils::OpenHandle(*script);
   SharedFunctionInfo::ScriptIterator iterator(
-      toplevel_fn->GetIsolate(), Script::cast(toplevel_fn->shared().script()));
+      toplevel_fn->GetIsolate(), Script::cast(toplevel_fn->shared()->script()));
 
-  for (SharedFunctionInfo shared = iterator.Next(); !shared.is_null();
+  for (Tagged<SharedFunctionInfo> shared = iterator.Next(); !shared.is_null();
        shared = iterator.Next()) {
-    std::unique_ptr<char[]> name = String::cast(shared.Name()).ToCString();
-    is_compiled->insert(std::make_pair(name.get(), shared.is_compiled()));
+    std::unique_ptr<char[]> name = String::cast(shared->Name())->ToCString();
+    is_compiled->insert(std::make_pair(name.get(), shared->is_compiled()));
   }
 }
 
diff --git a/deps/v8/test/unittests/parser/parsing-unittest.cc b/deps/v8/test/unittests/parser/parsing-unittest.cc
index 9048d7f1faf674..ab6b6805ed9051 100644
--- a/deps/v8/test/unittests/parser/parsing-unittest.cc
+++ b/deps/v8/test/unittests/parser/parsing-unittest.cc
@@ -69,28 +69,28 @@ struct Input {
 
 // Helpers for parsing and checking that the result has no error, implemented as
 // macros to report the correct test error location.
-#define FAIL_WITH_PENDING_PARSER_ERROR(info, script, isolate)                \
-  do {                                                                       \
-    (info)->pending_error_handler()->PrepareErrors(                          \
-        (isolate), (info)->ast_value_factory());                             \
-    (info)->pending_error_handler()->ReportErrors((isolate), (script));      \
-                                                                             \
-    i::Handle<i::JSObject> exception_handle(                                 \
-        i::JSObject::cast((isolate)->pending_exception()), (isolate));       \
-    i::Handle<i::String> message_string = i::Handle<i::String>::cast(        \
-        i::JSReceiver::GetProperty((isolate), exception_handle, "message")   \
-            .ToHandleChecked());                                             \
-    (isolate)->clear_pending_exception();                                    \
-                                                                             \
-    String script_source = String::cast((script)->source());                 \
-                                                                             \
-    FATAL(                                                                   \
-        "Parser failed on:\n"                                                \
-        "\t%s\n"                                                             \
-        "with error:\n"                                                      \
-        "\t%s\n"                                                             \
-        "However, we expected no error.",                                    \
-        script_source.ToCString().get(), message_string->ToCString().get()); \
+#define FAIL_WITH_PENDING_PARSER_ERROR(info, script, isolate)                 \
+  do {                                                                        \
+    (info)->pending_error_handler()->PrepareErrors(                           \
+        (isolate), (info)->ast_value_factory());                              \
+    (info)->pending_error_handler()->ReportErrors((isolate), (script));       \
+                                                                              \
+    i::Handle<i::JSObject> exception_handle(                                  \
+        i::JSObject::cast((isolate)->pending_exception()), (isolate));        \
+    i::Handle<i::String> message_string = i::Handle<i::String>::cast(         \
+        i::JSReceiver::GetProperty((isolate), exception_handle, "message")    \
+            .ToHandleChecked());                                              \
+    (isolate)->clear_pending_exception();                                     \
+                                                                              \
+    String script_source = String::cast((script)->source());                  \
+                                                                              \
+    FATAL(                                                                    \
+        "Parser failed on:\n"                                                 \
+        "\t%s\n"                                                              \
+        "with error:\n"                                                       \
+        "\t%s\n"                                                              \
+        "However, we expected no error.",                                     \
+        script_source->ToCString().get(), message_string->ToCString().get()); \
   } while (false)
 
 #define CHECK_PARSE_PROGRAM(info, script, isolate)                        \
@@ -2981,12 +2981,12 @@ TEST_F(ParsingTest, TooManyArguments) {
   const char* context_data[][2] = {{"foo(", "0)"}, {nullptr, nullptr}};
 
   using v8::internal::InstructionStream;
-  char statement[InstructionStream::kMaxArguments * 2 + 1];
-  for (int i = 0; i < InstructionStream::kMaxArguments; ++i) {
+  char statement[Code::kMaxArguments * 2 + 1];
+  for (int i = 0; i < Code::kMaxArguments; ++i) {
     statement[2 * i] = '0';
     statement[2 * i + 1] = ',';
   }
-  statement[InstructionStream::kMaxArguments * 2] = 0;
+  statement[Code::kMaxArguments * 2] = 0;
 
   const char* statement_data[] = {statement, nullptr};
 
@@ -3237,7 +3237,7 @@ TEST_F(ParsingTest, SerializationOfMaybeAssignmentFlag) {
   const i::AstRawString* name = avf.GetOneByteString("result");
   avf.Internalize(isolate);
   i::Handle<i::String> str = name->string();
-  CHECK(str->IsInternalizedString());
+  CHECK(IsInternalizedString(*str));
   i::DeclarationScope* script_scope =
       zone()->New<i::DeclarationScope>(zone(), &avf);
   i::Scope* s = i::Scope::DeserializeScopeChain(
@@ -4156,7 +4156,7 @@ i::Scope* DeserializeFunctionScope(i::Isolate* isolate, i::Zone* zone,
   i::DeclarationScope* script_scope =
       zone->New<i::DeclarationScope>(zone, &avf);
   i::Scope* s = i::Scope::DeserializeScopeChain(
-      isolate, zone, f->context().scope_info(), script_scope, &avf,
+      isolate, zone, f->context()->scope_info(), script_scope, &avf,
       i::Scope::DeserializationMode::kIncludingVariables);
   return s;
 }
@@ -4876,6 +4876,11 @@ TEST_F(ParsingTest, BasicImportAssertionParsing) {
     "import { a as b } from 'm.js' assert { \nc: 'd'};",
     "import { a as b } from 'm.js' assert { c:\n 'd'};",
     "import { a as b } from 'm.js' assert { c:'d'\n};",
+
+    "import { a as b } from 'm.js' assert { 0: 'b', };",
+    "import { a as b } from 'm.js' assert { 0n: 'b', };",
+    "import { a as b } from 'm.js' assert { '0': 'b', };",
+    "import { a as b } from 'm.js' assert { 0.0: 'b', };",
   };
   // clang-format on
 
@@ -4943,10 +4948,234 @@ TEST_F(ParsingTest, ImportAssertionParsingErrors) {
     "import { a } from 'm.js' assert { , b: c };",
     "import { a } from 'm.js' assert { a: 'b', a: 'c' };",
     "import { a } from 'm.js' assert { a: 'b', 'a': 'c' };",
+
+    "import { a } from 'm.js' assert { 0: 'b', '0': 'c' };",
+    "import { a } from 'm.js' assert { 0n: 'b', '0': 'c' };",
+    "import { a } from 'm.js' assert { 0: 'b', 0n: 'c' };",
+    "import { a } from 'm.js' assert { 0: 'b', 0.0: 'c' };",
+    "import { a } from 'm.js' assert { '0': 'b', 0n: 'c' };",
+
+    "import 'm.js' with { a: 'b' };"
+  };
+  // clang-format on
+
+  i::v8_flags.harmony_import_assertions = true;
+  i::Isolate* isolate = i_isolate();
+  i::Factory* factory = isolate->factory();
+
+  isolate->stack_guard()->SetStackLimit(i::GetCurrentStackPosition() -
+                                        128 * 1024);
+
+  for (unsigned i = 0; i < arraysize(kErrorSources); ++i) {
+    i::Handle<i::String> source =
+        factory->NewStringFromAsciiChecked(kErrorSources[i]);
+
+    i::Handle<i::Script> script = factory->NewScript(source);
+    i::UnoptimizedCompileState compile_state;
+    i::ReusableUnoptimizedCompileState reusable_state(isolate);
+    i::UnoptimizedCompileFlags flags =
+        i::UnoptimizedCompileFlags::ForScriptCompile(isolate, *script);
+    flags.set_is_module(true);
+    i::ParseInfo info(isolate, flags, &compile_state, &reusable_state);
+    CHECK(!i::parsing::ParseProgram(&info, script, isolate,
+                                    parsing::ReportStatisticsMode::kYes));
+    CHECK(info.pending_error_handler()->has_pending_error());
+  }
+}
+
+TEST_F(ParsingTest, BasicImportAttributesParsing) {
+  // clang-format off
+  const char* kSources[] = {
+    "import { a as b } from 'm.js' with { };",
+    "import n from 'n.js' with { };",
+    "export { a as b } from 'm.js' with { };",
+    "export * from 'm.js' with { };",
+    "import 'm.js' with { };",
+    "import * as foo from 'bar.js' with { };",
+
+    "import { a as b } from 'm.js' with { a: 'b' };",
+    "import { a as b } from 'm.js' with { c: 'd' };",
+    "import { a as b } from 'm.js' with { 'c': 'd' };",
+    "import { a as b } from 'm.js' with { a: 'b', 'c': 'd', e: 'f' };",
+    "import { a as b } from 'm.js' with { 'c': 'd', };",
+    "import n from 'n.js' with { 'c': 'd' };",
+    "export { a as b } from 'm.js' with { 'c': 'd' };",
+    "export * from 'm.js' with { 'c': 'd' };",
+    "import 'm.js' with { 'c': 'd' };",
+    "import * as foo from 'bar.js' with { 'c': 'd' };",
+
+    "import { a as b } from 'm.js' with { \nc: 'd'};",
+    "import { a as b } from 'm.js' with { c:\n 'd'};",
+    "import { a as b } from 'm.js' with { c:'d'\n};",
+
+    "import { a as b } from 'm.js' with { 0: 'b', };",
+    "import { a as b } from 'm.js' with { 0n: 'b', };",
+    "import { a as b } from 'm.js' with { '0': 'b', };",
+    "import { a as b } from 'm.js' with { 0.0: 'b', };",
+
+    "import 'm.js'\n with { };",
+    "import 'm.js' \nwith { };",
+    "import { a } from 'm.js'\n with { };",
+    "export * from 'm.js'\n with { };"
+  };
+  // clang-format on
+
+  i::v8_flags.harmony_import_attributes = true;
+  i::Isolate* isolate = i_isolate();
+  i::Factory* factory = isolate->factory();
+
+  isolate->stack_guard()->SetStackLimit(i::GetCurrentStackPosition() -
+                                        128 * 1024);
+
+  for (unsigned i = 0; i < arraysize(kSources); ++i) {
+    i::Handle<i::String> source =
+        factory->NewStringFromAsciiChecked(kSources[i]);
+
+    // Show that parsing as a module works
+    {
+      i::Handle<i::Script> script = factory->NewScript(source);
+      i::UnoptimizedCompileState compile_state;
+      i::ReusableUnoptimizedCompileState reusable_state(isolate);
+      i::UnoptimizedCompileFlags flags =
+          i::UnoptimizedCompileFlags::ForScriptCompile(isolate, *script);
+      flags.set_is_module(true);
+      i::ParseInfo info(isolate, flags, &compile_state, &reusable_state);
+      CHECK_PARSE_PROGRAM(&info, script, isolate);
+    }
+
+    // And that parsing a script does not.
+    {
+      i::UnoptimizedCompileState compile_state;
+      i::ReusableUnoptimizedCompileState reusable_state(isolate);
+      i::Handle<i::Script> script = factory->NewScript(source);
+      i::UnoptimizedCompileFlags flags =
+          i::UnoptimizedCompileFlags::ForScriptCompile(isolate, *script);
+      i::ParseInfo info(isolate, flags, &compile_state, &reusable_state);
+      CHECK(!i::parsing::ParseProgram(&info, script, isolate,
+                                      parsing::ReportStatisticsMode::kYes));
+      CHECK(info.pending_error_handler()->has_pending_error());
+    }
+  }
+}
+
+TEST_F(ParsingTest, ImportAttributesParsingErrors) {
+  // clang-format off
+  const char* kErrorSources[] = {
+    "import { a } from 'm.js' with {;",
+    "import { a } from 'm.js' with };",
+    "import { a } from 'm.js' , with { };",
+    "import { a } from 'm.js' with , { };",
+    "import { a } from 'm.js' with { , };",
+    "import { a } from 'm.js' with { b };",
+    "import { a } from 'm.js' with { 'b' };",
+    "import { a } from 'm.js' with { for };",
+    "import { a } from 'm.js' with { with };",
+    "export { a } with { };",
+    "export * with { };",
+
+    "import { a } from 'm.js' with { 1: 2 };",
+    "import { a } from 'm.js' with { b: c };",
+    "import { a } from 'm.js' with { 'b': c };",
+    "import { a } from 'm.js' with { , b: c };",
+    "import { a } from 'm.js' with { a: 'b', a: 'c' };",
+    "import { a } from 'm.js' with { a: 'b', 'a': 'c' };",
+
+    "import { a } from 'm.js' with { 0: 'b', '0': 'c' };",
+    "import { a } from 'm.js' with { 0n: 'b', '0': 'c' };",
+    "import { a } from 'm.js' with { 0: 'b', 0n: 'c' };",
+    "import { a } from 'm.js' with { 0: 'b', 0.0: 'c' };",
+    "import { a } from 'm.js' with { '0': 'b', 0n: 'c' };",
+
+    "import 'm.js' assert { a: 'b' };"
+  };
+  // clang-format on
+
+  i::v8_flags.harmony_import_assertions = false;
+  i::v8_flags.harmony_import_attributes = true;
+  i::Isolate* isolate = i_isolate();
+  i::Factory* factory = isolate->factory();
+
+  isolate->stack_guard()->SetStackLimit(i::GetCurrentStackPosition() -
+                                        128 * 1024);
+
+  for (unsigned i = 0; i < arraysize(kErrorSources); ++i) {
+    i::Handle<i::String> source =
+        factory->NewStringFromAsciiChecked(kErrorSources[i]);
+
+    i::Handle<i::Script> script = factory->NewScript(source);
+    i::UnoptimizedCompileState compile_state;
+    i::ReusableUnoptimizedCompileState reusable_state(isolate);
+    i::UnoptimizedCompileFlags flags =
+        i::UnoptimizedCompileFlags::ForScriptCompile(isolate, *script);
+    flags.set_is_module(true);
+    i::ParseInfo info(isolate, flags, &compile_state, &reusable_state);
+    CHECK(!i::parsing::ParseProgram(&info, script, isolate,
+                                    parsing::ReportStatisticsMode::kYes));
+    CHECK(info.pending_error_handler()->has_pending_error());
+  }
+}
+
+TEST_F(ParsingTest, BasicImportAttributesAndAssertionsParsing) {
+  // clang-format off
+  const char* kSources[] = {
+    "import { a } from 'm.js' assert { };",
+    "import { a } from 'm.js' with { };",
+    "import { a } from 'm.js'\n with { };",
+  };
+  // clang-format on
+
+  i::v8_flags.harmony_import_assertions = true;
+  i::v8_flags.harmony_import_attributes = true;
+  i::Isolate* isolate = i_isolate();
+  i::Factory* factory = isolate->factory();
+
+  isolate->stack_guard()->SetStackLimit(i::GetCurrentStackPosition() -
+                                        128 * 1024);
+
+  for (unsigned i = 0; i < arraysize(kSources); ++i) {
+    i::Handle<i::String> source =
+        factory->NewStringFromAsciiChecked(kSources[i]);
+
+    // Show that parsing as a module works
+    {
+      i::Handle<i::Script> script = factory->NewScript(source);
+      i::UnoptimizedCompileState compile_state;
+      i::ReusableUnoptimizedCompileState reusable_state(isolate);
+      i::UnoptimizedCompileFlags flags =
+          i::UnoptimizedCompileFlags::ForScriptCompile(isolate, *script);
+      flags.set_is_module(true);
+      i::ParseInfo info(isolate, flags, &compile_state, &reusable_state);
+      CHECK_PARSE_PROGRAM(&info, script, isolate);
+    }
+
+    // And that parsing a script does not.
+    {
+      i::UnoptimizedCompileState compile_state;
+      i::ReusableUnoptimizedCompileState reusable_state(isolate);
+      i::Handle<i::Script> script = factory->NewScript(source);
+      i::UnoptimizedCompileFlags flags =
+          i::UnoptimizedCompileFlags::ForScriptCompile(isolate, *script);
+      i::ParseInfo info(isolate, flags, &compile_state, &reusable_state);
+      CHECK(!i::parsing::ParseProgram(&info, script, isolate,
+                                      parsing::ReportStatisticsMode::kYes));
+      CHECK(info.pending_error_handler()->has_pending_error());
+    }
+  }
+}
+
+TEST_F(ParsingTest, ImportAttributesAndAssertionsParsingErrors) {
+  // clang-format off
+  const char* kErrorSources[] = {
+    "import { a } from 'm.js'\n assert { };",
+    "import { a } from 'm.js' with { } assert { };",
+    "import { a } from 'm.js' with assert { };",
+    "import { a } from 'm.js' assert { } with { };",
+    "import { a } from 'm.js' assert with { };",
   };
   // clang-format on
 
   i::v8_flags.harmony_import_assertions = true;
+  i::v8_flags.harmony_import_attributes = true;
   i::Isolate* isolate = i_isolate();
   i::Factory* factory = isolate->factory();
 
@@ -9061,7 +9290,7 @@ TEST_F(ParsingTest, ObjectRestNegativeTestSlow) {
 
   using v8::internal::InstructionStream;
   std::string statement;
-  for (int i = 0; i < InstructionStream::kMaxArguments; ++i) {
+  for (int i = 0; i < Code::kMaxArguments; ++i) {
     statement += std::to_string(i) + " : " + "x, ";
   }
   statement += "...y";
diff --git a/deps/v8/test/unittests/parser/preparser-unittest.cc b/deps/v8/test/unittests/parser/preparser-unittest.cc
index 976d978cde9868..3f266213d623fa 100644
--- a/deps/v8/test/unittests/parser/preparser-unittest.cc
+++ b/deps/v8/test/unittests/parser/preparser-unittest.cc
@@ -57,7 +57,7 @@ TEST_F(PreParserTest, LazyFunctionLength) {
 
   Handle<Smi> length = RunJS<Smi>("lazy.length");
   int32_t value;
-  CHECK(length->ToInt32(&value));
+  CHECK(Object::ToInt32(*length, &value));
   CHECK_EQ(3, value);
 }
 
@@ -732,7 +732,7 @@ TEST_F(PreParserTest, PreParserScopeAnalysis) {
 
       CHECK(shared->HasUncompiledDataWithPreparseData());
       i::Handle<i::PreparseData> produced_data_on_heap(
-          shared->uncompiled_data_with_preparse_data().preparse_data(),
+          shared->uncompiled_data_with_preparse_data()->preparse_data(),
           isolate);
 
       i::UnoptimizedCompileFlags flags =
@@ -884,10 +884,10 @@ TEST_F(PreParserTest, ProducingAndConsumingByteData) {
     i::ZoneConsumedPreparseData::ByteData::ReadingScope reading_scope(
         &bytes_for_reading, wrapper);
 
-    CHECK_EQ(wrapper.data_length(), kDataSize);
+    CHECK_EQ(wrapper->data_length(), kDataSize);
 
     for (int i = 0; i < kDataSize; i++) {
-      CHECK_EQ(copied_buffer.at(i), wrapper.get(i));
+      CHECK_EQ(copied_buffer.at(i), wrapper->get(i));
     }
 
 #ifdef DEBUG
diff --git a/deps/v8/test/unittests/parser/scanner-streams-unittest.cc b/deps/v8/test/unittests/parser/scanner-streams-unittest.cc
index 41355df10ff9d5..9dde5636f1d0d1 100644
--- a/deps/v8/test/unittests/parser/scanner-streams-unittest.cc
+++ b/deps/v8/test/unittests/parser/scanner-streams-unittest.cc
@@ -7,6 +7,7 @@
 #include "src/objects/objects-inl.h"
 #include "src/parsing/scanner-character-streams.h"
 #include "src/parsing/scanner.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -515,7 +516,7 @@ void TestCharacterStreams(const char* one_byte_source, unsigned length,
     TestCharacterStream(one_byte_source, uc16_stream.get(), length, start, end);
 
     // This avoids the GC from trying to free a stack allocated resource.
-    if (uc16_string->IsExternalString())
+    if (IsExternalString(*uc16_string))
       i::Handle<i::ExternalTwoByteString>::cast(uc16_string)
           ->SetResource(isolate, nullptr);
   }
@@ -535,7 +536,7 @@ void TestCharacterStreams(const char* one_byte_source, unsigned length,
     TestCharacterStream(one_byte_source, one_byte_stream.get(), length, start,
                         end);
     // This avoids the GC from trying to free a stack allocated resource.
-    if (ext_one_byte_string->IsExternalString())
+    if (IsExternalString(*ext_one_byte_string))
       i::Handle<i::ExternalOneByteString>::cast(ext_one_byte_string)
           ->SetResource(isolate, nullptr);
   }
@@ -759,7 +760,7 @@ TEST_F(ScannerStreamsTest, TestOverlongAndInvalidSequences) {
 }
 
 TEST_F(ScannerStreamsTest, RelocatingCharacterStream) {
-  // This test relies on the invariant that the scavenger will move objects
+  // This test relies on the invariant that GC will move objects.
   if (i::v8_flags.single_generation) return;
   i::v8_flags.manual_evacuation_candidates_selection = true;
   v8::internal::ManualGCScope manual_gc_scope(i_isolate());
@@ -783,13 +784,16 @@ TEST_F(ScannerStreamsTest, RelocatingCharacterStream) {
   CHECK_EQ('a', two_byte_string_stream->Advance());
   CHECK_EQ('b', two_byte_string_stream->Advance());
   CHECK_EQ(size_t{2}, two_byte_string_stream->pos());
-  i::String raw = *two_byte_string;
+  i::Tagged<i::String> raw = *two_byte_string;
+  // We need to invoke GC without stack, otherwise no compaction is performed.
+  i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+      i_isolate()->heap());
   // 1st GC moves `two_byte_string` to old space and 2nd GC evacuates it within
   // old space.
-  CollectGarbage(i::OLD_SPACE);
+  InvokeMajorGC();
   i::Page::FromHeapObject(*two_byte_string)
       ->SetFlag(i::MemoryChunk::FORCE_EVACUATION_CANDIDATE_FOR_TESTING);
-  CollectGarbage(i::OLD_SPACE);
+  InvokeMajorGC();
   // GC moved the string.
   CHECK_NE(raw, *two_byte_string);
   CHECK_EQ('c', two_byte_string_stream->Advance());
@@ -797,7 +801,7 @@ TEST_F(ScannerStreamsTest, RelocatingCharacterStream) {
 }
 
 TEST_F(ScannerStreamsTest, RelocatingUnbufferedCharacterStream) {
-  // This test relies on the invariant that the scavenger will move objects
+  // This test relies on the invariant that GC will move objects.
   if (i::v8_flags.single_generation) return;
   i::v8_flags.manual_evacuation_candidates_selection = true;
   v8::internal::ManualGCScope manual_gc_scope(i_isolate());
@@ -824,13 +828,16 @@ TEST_F(ScannerStreamsTest, RelocatingUnbufferedCharacterStream) {
   CHECK_EQ('c', two_byte_string_stream->Advance());
   CHECK_EQ(size_t{3}, two_byte_string_stream->pos());
 
-  i::String raw = *two_byte_string;
+  i::Tagged<i::String> raw = *two_byte_string;
+  // We need to invoke GC without stack, otherwise no compaction is performed.
+  i::DisableConservativeStackScanningScopeForTesting no_stack_scanning(
+      i_isolate()->heap());
   // 1st GC moves `two_byte_string` to old space and 2nd GC evacuates it within
   // old space.
-  CollectGarbage(i::OLD_SPACE);
+  InvokeMajorGC();
   i::Page::FromHeapObject(*two_byte_string)
       ->SetFlag(i::MemoryChunk::FORCE_EVACUATION_CANDIDATE_FOR_TESTING);
-  CollectGarbage(i::OLD_SPACE);
+  InvokeMajorGC();
   // GC moved the string and buffer was updated to the correct location.
   CHECK_NE(raw, *two_byte_string);
 
@@ -876,7 +883,7 @@ TEST_F(ScannerStreamsTest, CloneCharacterStreams) {
     TestCloneCharacterStream(one_byte_source, uc16_stream.get(), length);
 
     // This avoids the GC from trying to free a stack allocated resource.
-    if (uc16_string->IsExternalString())
+    if (IsExternalString(*uc16_string))
       i::Handle<i::ExternalTwoByteString>::cast(uc16_string)
           ->SetResource(i_isolate(), nullptr);
   }
@@ -895,7 +902,7 @@ TEST_F(ScannerStreamsTest, CloneCharacterStreams) {
         i::ScannerStream::For(i_isolate(), ext_one_byte_string, 0, length));
     TestCloneCharacterStream(one_byte_source, one_byte_stream.get(), length);
     // This avoids the GC from trying to free a stack allocated resource.
-    if (ext_one_byte_string->IsExternalString())
+    if (IsExternalString(*ext_one_byte_string))
       i::Handle<i::ExternalOneByteString>::cast(ext_one_byte_string)
           ->SetResource(i_isolate(), nullptr);
   }
diff --git a/deps/v8/test/unittests/regexp/regexp-unittest.cc b/deps/v8/test/unittests/regexp/regexp-unittest.cc
index 2b84c701eea897..3bc03741a396fd 100644
--- a/deps/v8/test/unittests/regexp/regexp-unittest.cc
+++ b/deps/v8/test/unittests/regexp/regexp-unittest.cc
@@ -657,15 +657,13 @@ static Handle<JSRegExp> CreateJSRegExp(Handle<String> source, Handle<Code> code,
   return regexp;
 }
 
-static ArchRegExpMacroAssembler::Result Execute(JSRegExp regexp, String input,
-                                                int start_offset,
-                                                Address input_start,
-                                                Address input_end,
-                                                int* captures) {
+static ArchRegExpMacroAssembler::Result Execute(
+    Tagged<JSRegExp> regexp, Tagged<String> input, int start_offset,
+    Address input_start, Address input_end, int* captures) {
   return static_cast<NativeRegExpMacroAssembler::Result>(
       NativeRegExpMacroAssembler::ExecuteForTesting(
-          input, start_offset, reinterpret_cast<byte*>(input_start),
-          reinterpret_cast<byte*>(input_end), captures, 0,
+          input, start_offset, reinterpret_cast<uint8_t*>(input_start),
+          reinterpret_cast<uint8_t*>(input_end), captures, 0,
           reinterpret_cast<i::Isolate*>(v8::Isolate::GetCurrent()), regexp));
 }
 
@@ -1787,12 +1785,12 @@ TEST_F(RegExpTest, PeepholeNoChange) {
   v8_flags.regexp_peephole_optimization = false;
   Handle<ByteArray> array = Handle<ByteArray>::cast(orig.GetCode(source));
   int length = array->length();
-  byte* byte_array = array->GetDataStartAddress();
+  uint8_t* byte_array = array->GetDataStartAddress();
 
   v8_flags.regexp_peephole_optimization = true;
   Handle<ByteArray> array_optimized =
       Handle<ByteArray>::cast(opt.GetCode(source));
-  byte* byte_array_optimized = array_optimized->GetDataStartAddress();
+  uint8_t* byte_array_optimized = array_optimized->GetDataStartAddress();
 
   CHECK_EQ(0, memcmp(byte_array, byte_array_optimized, length));
 }
@@ -2310,15 +2308,15 @@ TEST_F(RegExpTestWithContext, UnicodePropertyEscapeCodeSize) {
 
   static constexpr int kMaxSize = 200 * KB;
   static constexpr bool kIsNotLatin1 = false;
-  Object maybe_code = re->code(kIsNotLatin1);
-  Object maybe_bytecode = re->bytecode(kIsNotLatin1);
-  if (maybe_bytecode.IsByteArray()) {
+  Tagged<Object> maybe_code = re->code(kIsNotLatin1);
+  Tagged<Object> maybe_bytecode = re->bytecode(kIsNotLatin1);
+  if (IsByteArray(maybe_bytecode)) {
     // On x64, excessive inlining produced >250KB.
-    CHECK_LT(ByteArray::cast(maybe_bytecode).Size(), kMaxSize);
-  } else if (maybe_code.IsCode()) {
+    CHECK_LT(ByteArray::cast(maybe_bytecode)->Size(), kMaxSize);
+  } else if (IsCode(maybe_code)) {
     // On x64, excessive inlining produced >360KB.
-    CHECK_LT(Code::cast(maybe_code).Size(), kMaxSize);
-    CHECK_EQ(Code::cast(maybe_code).kind(), CodeKind::REGEXP);
+    CHECK_LT(Code::cast(maybe_code)->Size(), kMaxSize);
+    CHECK_EQ(Code::cast(maybe_code)->kind(), CodeKind::REGEXP);
   } else {
     UNREACHABLE();
   }
@@ -2341,7 +2339,7 @@ i::Handle<i::Object> RegExpExec(const RegExpExecData* d) {
 void ReenterRegExp(v8::Isolate* isolate, void* data) {
   RegExpExecData* d = static_cast<RegExpExecData*>(data);
   i::Handle<i::Object> result = RegExpExec(d);
-  CHECK(result->IsNull());
+  CHECK(IsNull(*result));
 }
 
 }  // namespace
@@ -2363,7 +2361,7 @@ TEST_F(RegExpTestWithContext, RegExpInterruptReentrantExecution) {
   isolate()->RequestInterrupt(&ReenterRegExp, &d);
 
   i::Handle<i::Object> result = RegExpExec(&d);
-  CHECK(result->IsNull());
+  CHECK(IsNull(*result));
 }
 
 #undef CHECK_PARSE_ERROR
diff --git a/deps/v8/test/unittests/runtime/runtime-debug-unittest.cc b/deps/v8/test/unittests/runtime/runtime-debug-unittest.cc
index 6e99365335d7e4..c39c52a435d42b 100644
--- a/deps/v8/test/unittests/runtime/runtime-debug-unittest.cc
+++ b/deps/v8/test/unittests/runtime/runtime-debug-unittest.cc
@@ -70,11 +70,11 @@ TEST_F(RuntimeTest, WasmTableWithoutInstance) {
       Runtime::GetInternalProperties(i_isolate(), table);
   ASSERT_FALSE(result.is_null());
   // ["[[Prototype]]", <map>, "[[Entries]]", <entries>]
-  ASSERT_EQ(4, result.ToHandleChecked()->elements().length());
+  ASSERT_EQ(4, result.ToHandleChecked()->elements()->length());
   Handle<Object> entries =
       FixedArrayBase::GetElement(i_isolate(), result.ToHandleChecked(), 3)
           .ToHandleChecked();
-  EXPECT_EQ(1, JSArray::cast(*entries).elements().length());
+  EXPECT_EQ(1, JSArray::cast(*entries)->elements()->length());
 }
 #endif
 
diff --git a/deps/v8/test/unittests/strings/unicode-unittest.cc b/deps/v8/test/unittests/strings/unicode-unittest.cc
index 5d647279732aaa..0c096984885061 100644
--- a/deps/v8/test/unittests/strings/unicode-unittest.cc
+++ b/deps/v8/test/unittests/strings/unicode-unittest.cc
@@ -18,7 +18,7 @@ namespace internal {
 
 namespace {
 
-void DecodeNormally(const std::vector<byte>& bytes,
+void DecodeNormally(const std::vector<uint8_t>& bytes,
                     std::vector<unibrow::uchar>* output) {
   size_t cursor = 0;
   while (cursor < bytes.size()) {
@@ -46,12 +46,12 @@ void DecodeUtf16(const std::vector<uint8_t>& bytes,
   }
 }
 
-void DecodeIncrementally(const std::vector<byte>& bytes,
+void DecodeIncrementally(const std::vector<uint8_t>& bytes,
                          std::vector<unibrow::uchar>* output) {
   unibrow::Utf8::Utf8IncrementalBuffer buffer = 0;
   unibrow::Utf8::State state = unibrow::Utf8::State::kAccept;
-  const byte* cursor = bytes.data();
-  const byte* end = bytes.data() + bytes.size();
+  const uint8_t* cursor = bytes.data();
+  const uint8_t* end = bytes.data() + bytes.size();
   while (cursor < end) {
     unibrow::uchar result =
         unibrow::Utf8::ValueOfIncremental(&cursor, &state, &buffer);
@@ -70,7 +70,7 @@ void DecodeIncrementally(const std::vector<byte>& bytes,
 TEST(UnicodeTest, Utf16BufferReuse) {
   // Not enough continuation bytes before string ends.
   struct TestCase {
-    std::vector<byte> bytes;
+    std::vector<uint8_t> bytes;
     std::vector<unibrow::uchar> unicode_expected;
   };
 
@@ -115,7 +115,7 @@ TEST(UnicodeTest, IncrementalUTF8DecodingVsNonIncrementalUtf8Decoding) {
   // produce the same result. This test was inspired by
   // https://www.cl.cam.ac.uk/~mgk25/ucs/examples/UTF-8-test.txt .
   struct TestCase {
-    std::vector<byte> bytes;
+    std::vector<uint8_t> bytes;
     std::vector<unibrow::uchar> unicode_expected;
   };
 
diff --git a/deps/v8/test/unittests/tasks/background-compile-task-unittest.cc b/deps/v8/test/unittests/tasks/background-compile-task-unittest.cc
index 1dba91de98fc69..dc9b5696c9ce4f 100644
--- a/deps/v8/test/unittests/tasks/background-compile-task-unittest.cc
+++ b/deps/v8/test/unittests/tasks/background-compile-task-unittest.cc
@@ -111,7 +111,7 @@ TEST_F(BackgroundCompileTaskTest, CompileAndRun) {
       task.get(), isolate(), Compiler::KEEP_EXCEPTION));
   ASSERT_TRUE(shared->is_compiled());
 
-  Smi value = Smi::cast(*RunJS("f(100);"));
+  Tagged<Smi> value = Smi::cast(*RunJS("f(100);"));
   ASSERT_TRUE(value == Smi::FromInt(160));
 }
 
@@ -209,7 +209,7 @@ TEST_F(BackgroundCompileTaskTest, EagerInnerFunctions) {
 
   Handle<JSFunction> e = RunJS<JSFunction>("f();");
 
-  ASSERT_TRUE(e->shared().is_compiled());
+  ASSERT_TRUE(e->shared()->is_compiled());
 }
 
 TEST_F(BackgroundCompileTaskTest, LazyInnerFunctions) {
@@ -239,7 +239,7 @@ TEST_F(BackgroundCompileTaskTest, LazyInnerFunctions) {
 
   Handle<JSFunction> e = RunJS<JSFunction>("f();");
 
-  ASSERT_FALSE(e->shared().is_compiled());
+  ASSERT_FALSE(e->shared()->is_compiled());
 }
 
 }  // namespace internal
diff --git a/deps/v8/test/unittests/test-helpers.cc b/deps/v8/test/unittests/test-helpers.cc
index 4c9ee9fdc98d5a..cc6f3943aba590 100644
--- a/deps/v8/test/unittests/test-helpers.cc
+++ b/deps/v8/test/unittests/test-helpers.cc
@@ -57,7 +57,7 @@ std::unique_ptr<Utf16CharacterStream> SourceCharacterStreamForShared(
   // Create a character stream to simulate the parser having done so for the
   // top-level ParseProgram.
   Script script = Script::cast(shared->script());
-  Handle<String> source(String::cast(script.source()), isolate);
+  Handle<String> source(String::cast(script->source()), isolate);
   std::unique_ptr<Utf16CharacterStream> stream(
       ScannerStream::For(isolate, source));
   return stream;
diff --git a/deps/v8/test/unittests/test-helpers.h b/deps/v8/test/unittests/test-helpers.h
index 6f450b24dbc684..f8ef288b30cc88 100644
--- a/deps/v8/test/unittests/test-helpers.h
+++ b/deps/v8/test/unittests/test-helpers.h
@@ -8,19 +8,12 @@
 #include <memory>
 
 #include "include/v8-primitive.h"
+#include "src/common/globals.h"
 
 namespace v8 {
-
-class Isolate;
-
 namespace internal {
 
-class Object;
-template <typename T>
-class Handle;
-class Isolate;
 class SharedFunctionInfo;
-class String;
 class Utf16CharacterStream;
 
 namespace test {
diff --git a/deps/v8/test/unittests/test-utils.cc b/deps/v8/test/unittests/test-utils.cc
index 053c81bcde2f54..ab5f31945f5a00 100644
--- a/deps/v8/test/unittests/test-utils.cc
+++ b/deps/v8/test/unittests/test-utils.cc
@@ -88,28 +88,5 @@ SaveFlags::~SaveFlags() {
 #undef FLAG_MODE_APPLY
 }
 
-ManualGCScope::ManualGCScope(i::Isolate* isolate) {
-  // Some tests run threaded (back-to-back) and thus the GC may already be
-  // running by the time a ManualGCScope is created. Finalizing existing marking
-  // prevents any undefined/unexpected behavior.
-  FinalizeGCIfRunning(isolate);
-
-  i::v8_flags.concurrent_marking = false;
-  i::v8_flags.concurrent_sweeping = false;
-  i::v8_flags.concurrent_minor_mc_marking = false;
-  i::v8_flags.stress_incremental_marking = false;
-  i::v8_flags.stress_concurrent_allocation = false;
-  // Parallel marking has a dependency on concurrent marking.
-  i::v8_flags.parallel_marking = false;
-  i::v8_flags.detect_ineffective_gcs_near_heap_limit = false;
-  // CppHeap concurrent marking has a dependency on concurrent marking.
-  i::v8_flags.cppheap_concurrent_marking = false;
-
-  if (isolate && isolate->heap()->cpp_heap()) {
-    CppHeap::From(isolate->heap()->cpp_heap())
-        ->ReduceGCCapabilitiesFromFlagsForTesting();
-  }
-}
-
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/test-utils.h b/deps/v8/test/unittests/test-utils.h
index 523cddfe02c0d5..431536cd0a99f0 100644
--- a/deps/v8/test/unittests/test-utils.h
+++ b/deps/v8/test/unittests/test-utils.h
@@ -21,6 +21,7 @@
 #include "src/base/utils/random-number-generator.h"
 #include "src/handles/handles.h"
 #include "src/heap/parked-scope.h"
+#include "src/logging/log.h"
 #include "src/objects/objects-inl.h"
 #include "src/objects/objects.h"
 #include "src/zone/accounting-allocator.h"
@@ -91,6 +92,28 @@ class IsolateWrapper final {
   v8::Isolate* isolate_;
 };
 
+class IsolateWithContextWrapper final {
+ public:
+  IsolateWithContextWrapper()
+      : isolate_wrapper_(kNoCounters),
+        isolate_scope_(isolate_wrapper_.isolate()),
+        handle_scope_(isolate_wrapper_.isolate()),
+        context_(v8::Context::New(isolate_wrapper_.isolate())),
+        context_scope_(context_) {}
+
+  v8::Isolate* v8_isolate() const { return isolate_wrapper_.isolate(); }
+  i::Isolate* isolate() const {
+    return reinterpret_cast<i::Isolate*>(v8_isolate());
+  }
+
+ private:
+  IsolateWrapper isolate_wrapper_;
+  v8::Isolate::Scope isolate_scope_;
+  v8::HandleScope handle_scope_;
+  v8::Local<v8::Context> context_;
+  v8::Context::Scope context_scope_;
+};
+
 //
 // A set of mixins from which the test fixtures will be constructed.
 //
@@ -185,28 +208,16 @@ class WithIsolateScopeMixin : public TMixin {
         .ToLocalChecked();
   }
 
-  // By default, the GC methods do not scan the stack conservatively.
-  void CollectGarbage(i::AllocationSpace space, i::Isolate* isolate = nullptr) {
+  void InvokeMajorGC(i::Isolate* isolate = nullptr) {
     i::Isolate* iso = isolate ? isolate : i_isolate();
-    iso->heap()->CollectGarbage(space, i::GarbageCollectionReason::kTesting);
+    iso->heap()->CollectGarbage(i::OLD_SPACE,
+                                i::GarbageCollectionReason::kTesting);
   }
 
-  void CollectAllGarbage(i::Isolate* isolate = nullptr) {
+  void InvokeMinorGC(i::Isolate* isolate = nullptr) {
     i::Isolate* iso = isolate ? isolate : i_isolate();
-    iso->heap()->CollectAllGarbage(i::Heap::kNoGCFlags,
-                                   i::GarbageCollectionReason::kTesting);
-  }
-
-  void CollectAllAvailableGarbage(i::Isolate* isolate = nullptr) {
-    i::Isolate* iso = isolate ? isolate : i_isolate();
-    iso->heap()->CollectAllAvailableGarbage(
-        i::GarbageCollectionReason::kTesting);
-  }
-
-  void PreciseCollectAllGarbage(i::Isolate* isolate = nullptr) {
-    i::Isolate* iso = isolate ? isolate : i_isolate();
-    iso->heap()->PreciseCollectAllGarbage(i::Heap::kNoGCFlags,
-                                          i::GarbageCollectionReason::kTesting);
+    iso->heap()->CollectGarbage(i::NEW_SPACE,
+                                i::GarbageCollectionReason::kTesting);
   }
 
   v8::Local<v8::String> NewString(const char* string) {
@@ -306,11 +317,12 @@ class PrintExtension : public v8::Extension {
       v8::Isolate* isolate, v8::Local<v8::String> name) override {
     return v8::FunctionTemplate::New(isolate, PrintExtension::Print);
   }
-  static void Print(const v8::FunctionCallbackInfo<v8::Value>& args) {
-    for (int i = 0; i < args.Length(); i++) {
+  static void Print(const v8::FunctionCallbackInfo<v8::Value>& info) {
+    CHECK(i::ValidateCallbackInfo(info));
+    for (int i = 0; i < info.Length(); i++) {
       if (i != 0) printf(" ");
-      v8::HandleScope scope(args.GetIsolate());
-      v8::String::Utf8Value str(args.GetIsolate(), args[i]);
+      v8::HandleScope scope(info.GetIsolate());
+      v8::String::Utf8Value str(info.GetIsolate(), info[i]);
       if (*str == nullptr) return;
       printf("%s", *str);
     }
@@ -499,23 +511,13 @@ class V8_NODISCARD SaveFlags {
 };
 
 // For GTest.
-inline void PrintTo(Object o, ::std::ostream* os) {
+inline void PrintTo(Tagged<Object> o, ::std::ostream* os) {
   *os << reinterpret_cast<void*>(o.ptr());
 }
-inline void PrintTo(Smi o, ::std::ostream* os) {
+inline void PrintTo(Tagged<Smi> o, ::std::ostream* os) {
   *os << reinterpret_cast<void*>(o.ptr());
 }
 
-// ManualGCScope allows for disabling GC heuristics. This is useful for tests
-// that want to check specific corner cases around GC.
-//
-// The scope will finalize any ongoing GC on the provided Isolate.
-class V8_NODISCARD ManualGCScope final : private SaveFlags {
- public:
-  explicit ManualGCScope(i::Isolate* isolate);
-  ~ManualGCScope() = default;
-};
-
 static inline uint16_t* AsciiToTwoByteString(const char* source) {
   size_t array_length = strlen(source) + 1;
   uint16_t* converted = NewArray<uint16_t>(array_length);
@@ -525,7 +527,7 @@ static inline uint16_t* AsciiToTwoByteString(const char* source) {
 
 class TestTransitionsAccessor : public TransitionsAccessor {
  public:
-  TestTransitionsAccessor(Isolate* isolate, Map map)
+  TestTransitionsAccessor(Isolate* isolate, Tagged<Map> map)
       : TransitionsAccessor(isolate, map) {}
   TestTransitionsAccessor(Isolate* isolate, Handle<Map> map)
       : TransitionsAccessor(isolate, *map) {}
@@ -540,7 +542,9 @@ class TestTransitionsAccessor : public TransitionsAccessor {
 
   int Capacity() { return TransitionsAccessor::Capacity(); }
 
-  TransitionArray transitions() { return TransitionsAccessor::transitions(); }
+  Tagged<TransitionArray> transitions() {
+    return TransitionsAccessor::transitions();
+  }
 };
 
 // Helper class that allows to write tests in a slot size independent manner.
@@ -576,17 +580,26 @@ Handle<FeedbackVector> NewFeedbackVector(Isolate* isolate, Spec* spec) {
   return FeedbackVector::NewForTesting(isolate, spec);
 }
 
-class ParkingThread : public v8::base::Thread {
+class FakeCodeEventLogger : public i::CodeEventLogger {
  public:
-  explicit ParkingThread(const Options& options) : v8::base::Thread(options) {}
+  explicit FakeCodeEventLogger(i::Isolate* isolate)
+      : CodeEventLogger(isolate) {}
 
-  void ParkedJoin(const ParkedScope& scope) {
-    USE(scope);
-    Join();
-  }
+  void CodeMoveEvent(i::Tagged<i::InstructionStream> from,
+                     i::Tagged<i::InstructionStream> to) override {}
+  void BytecodeMoveEvent(i::Tagged<i::BytecodeArray> from,
+                         i::Tagged<i::BytecodeArray> to) override {}
+  void CodeDisableOptEvent(i::Handle<i::AbstractCode> code,
+                           i::Handle<i::SharedFunctionInfo> shared) override {}
 
  private:
-  using v8::base::Thread::Join;
+  void LogRecordedBuffer(i::Tagged<i::AbstractCode> code,
+                         i::MaybeHandle<i::SharedFunctionInfo> maybe_shared,
+                         const char* name, int length) override {}
+#if V8_ENABLE_WEBASSEMBLY
+  void LogRecordedBuffer(const i::wasm::WasmCode* code, const char* name,
+                         int length) override {}
+#endif  // V8_ENABLE_WEBASSEMBLY
 };
 
 #ifdef V8_CC_GNU
diff --git a/deps/v8/test/unittests/testcfg.py b/deps/v8/test/unittests/testcfg.py
index 6863c3e21632d0..7620ea48631a4c 100644
--- a/deps/v8/test/unittests/testcfg.py
+++ b/deps/v8/test/unittests/testcfg.py
@@ -10,7 +10,12 @@
 from testrunner.objects import testcase
 
 
-ADDITIONAL_VARIANTS = set(["minor_mc"])
+ADDITIONAL_VARIANTS = set([
+    "maglev",
+    "minor_ms",
+    "stress_maglev",
+])
+SHELL = "v8_unittests"
 
 
 class VariantsGenerator(testsuite.VariantsGenerator):
@@ -29,17 +34,12 @@ def _get_variants(self, test):
 
 class TestLoader(testsuite.TestLoader):
   def _list_test_filenames(self):
-    shell = os.path.abspath(
-      os.path.join(self.test_config.shell_dir, "v8_unittests"))
-    if utils.IsWindows():
-      shell += ".exe"
-
+    args = ['--gtest_list_tests'] + self.test_config.extra_flags
+    shell = self.ctx.platform_shell(SHELL, args, self.test_config.shell_dir)
     output = None
     for i in range(3): # Try 3 times in case of errors.
       cmd = self.ctx.command(
-          cmd_prefix=self.test_config.command_prefix,
-          shell=shell,
-          args=['--gtest_list_tests'] + self.test_config.extra_flags)
+          cmd_prefix=self.test_config.command_prefix, shell=shell, args=args)
       output = cmd.execute()
       if output.exit_code == 0:
         break
@@ -59,6 +59,12 @@ def _list_test_filenames(self):
     test_names = []
     test_case = ''
     for line in output.stdout.splitlines():
+      # When the command runs through another executable (e.g. iOS Simulator),
+      # it is possible that the stdout will show something else besides the
+      # actual test output, so it is necessary to harness this case by checking
+      # whether the line exists here.
+      if not line.strip().split():
+        continue
       test_desc = line.strip().split()[0]
       if test_desc.endswith('.'):
         test_case = test_desc
@@ -82,22 +88,22 @@ def _variants_gen_class(self):
 class TestCase(testcase.TestCase):
   def _get_suite_flags(self):
     return (
-        ["--gtest_filter=" + self.path] +
-        ["--gtest_random_seed=%s" % self.random_seed] +
+        [f"--gtest_filter={self.name}"] +
+        [f"--gtest_random_seed={self.random_seed}"] +
         ["--gtest_print_time=0"]
     )
 
   def get_shell(self):
-    return 'v8_' + self.suite.name
+    return SHELL
 
   def get_android_resources(self):
     # Bytecode-generator tests are the only ones requiring extra files on
     # Android.
     parts = self.name.split('.')
     if parts[0] == 'BytecodeGeneratorTest':
-      expectation_file = os.path.join(self.suite.root, 'interpreter',
-                                      'bytecode_expectations',
-                                      '%s.golden' % parts[1])
-      if os.path.exists(expectation_file):
+      expectation_file = (
+          self.suite.root / 'interpreter' / 'bytecode_expectations' /
+          f'{parts[1]}.golden')
+      if expectation_file.exists():
         return [expectation_file]
     return []
diff --git a/deps/v8/test/unittests/torque/torque-unittest.cc b/deps/v8/test/unittests/torque/torque-unittest.cc
index 446d2345a8eb32..1cab0265b1ed66 100644
--- a/deps/v8/test/unittests/torque/torque-unittest.cc
+++ b/deps/v8/test/unittests/torque/torque-unittest.cc
@@ -84,6 +84,8 @@ type string constexpr 'const char*';
 type RawPtr generates 'TNode<RawPtrT>' constexpr 'void*';
 type ExternalPointer
     generates 'TNode<ExternalPointerT>' constexpr 'ExternalPointer_t';
+type IndirectPointer
+    generates 'TNode<IndirectPointerHandle>' constexpr 'IndirectPointerHandle';
 type InstructionStream extends HeapObject generates 'TNode<InstructionStream>';
 type BuiltinPtr extends Smi generates 'TNode<BuiltinPtr>';
 type Context extends HeapObject generates 'TNode<Context>';
@@ -975,6 +977,41 @@ TEST(Torque, ImplicitTemplateParameterInference) {
       HasSubstr("ambiguous callable"));
 }
 
+TEST(Torque, BuiltinReturnsNever) {
+  ExpectFailingCompilation(
+      "builtin Never(): never {}",
+      HasSubstr("control reaches end of builtin, expected return of a value"));
+  ExpectFailingCompilation(
+      "builtin Never(): never { return 1; }",
+      HasSubstr("cannot return from a function with return type never"));
+  ExpectFailingCompilation(
+      R"(
+    extern macro Throw(): never;
+    builtin Never(): never {
+      Throw();
+    }
+    builtin CallsNever(): Smi {
+      Never();
+      return 1;
+    }
+  )",
+      HasSubstr("statement after non-returning statement"));
+
+  ExpectSuccessfulCompilation(
+      "extern macro Throw(): never;"
+      "builtin Never(): never { Throw(); }");
+  ExpectSuccessfulCompilation(R"(
+    extern macro Throw(): never;
+    builtin Never(implicit c: Context, a: int32)(): never {
+      if(a == 1) {
+        Throw();
+      } else {
+        Throw();
+      }
+    }
+  )");
+}
+
 }  // namespace torque
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/unittests.status b/deps/v8/test/unittests/unittests.status
index ffe19b464c2b10..99f3457f53fcbe 100644
--- a/deps/v8/test/unittests/unittests.status
+++ b/deps/v8/test/unittests/unittests.status
@@ -18,12 +18,11 @@
   'PersistentHandlesTest.DereferencePersistentHandleFailsWhenDisallowed': [SKIP, ['mode == debug', FAIL]],
 
   # https://crbug.com/v8/8919
-  'PlatformTest.StackAlignment': [PASS, ['not is_clang', SKIP]],
+  'PlatformTest.StackAlignment': [PASS, ['not clang', SKIP]],
 
   # We do not yet shrink weak maps after they have been emptied by the GC
-  'WeakMapsTest.Shrinking': [FAIL],
-
-  'WeakSetsTest.WeakSet_Shrinking': [FAIL],
+  'WeakMapsTest.Shrinking': [SKIP],
+  'WeakSetsTest.WeakSet_Shrinking': [SKIP],
 
   # This tests only that the preparser and parser agree, so there is no point in
   # running several variants. Note that this still takes ages, because there
@@ -122,6 +121,7 @@
 ##############################################################################
 ['system == windows and asan', {
   # BUG(893437).
+  'LanguageServer*': [SKIP],
   'Torque*': [SKIP],
 
   # Hangs on asan.
@@ -181,7 +181,7 @@
 }],
 
 ################################################################################
-['is_clang == False and (arch == riscv64 or arch == riscv32)',{
+['not clang and (arch == riscv64 or arch == riscv32)',{
   'LoggingTest.SourceLocation':[SKIP]  # issue-174
 }],
 
@@ -205,7 +205,7 @@
 }], # jitless
 
 ##############################################################################
-['jitless_build_mode', {
+['has_jitless', {
   # Feedback collection maintenance is (mostly) disabled.
   'FeedbackVectorTest.Vector*': [SKIP],
   'InterpreterTest.InterpreterBigIntComparisons': [SKIP],
@@ -221,7 +221,7 @@
   'InterpreterTest.InterpreterBitwiseTypeFeedback': [SKIP],
   # These require executable code space.
   'AssemblerX64Test.*': [SKIP],
-}],  # jitless_build_mode
+}],  # has_jitless
 
 ################################################################################
 ['third_party_heap', {
@@ -343,9 +343,9 @@
 }],  # variant == no_wasm_traps
 
 ##############################################################################
-['no_i18n == True', {
+['not i18n', {
   'RegExpTestWithContext.UnicodePropertyEscapeCodeSize': [SKIP],
-}],  # no_i18n == True
+}],  # not i18n
 
 ##############################################################################
 ['no_simd_hardware == True', {
@@ -354,6 +354,27 @@
 
 ['tsan and mode == debug', {
   'LazyCompileDispatcherTest.CompileLazy2FinishesDispatcherJob': [SKIP],
-}]
+}],
 
+# With the official_build flag exceptions are disabled. Therefore torque
+# tests fail that rely on catching them (v8:13945).
+['official_build', {
+  'LanguageServerJson.ParserError': [FAIL],
+  'FlagDefinitionsTest.FreezeFlags': [FAIL],
+  'LanguageServerJson.LexerError': [FAIL],
+  'Torque.DoubleUnderScorePrefixIllegalForIdentifiers': [FAIL],
+  'Torque.ImportNonExistentFile': [FAIL],
+  'Torque.Enums': [FAIL],
+}],  # 'official_build'
+
+##############################################################################
+# Behavioural differences between Maglev and Turbofan when the former is used
+# for OptimizeFunctionOnNextCall.
+['variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)', {
+  # Maglev doesn't support compiler::NodeObserver machinery.
+  'SloppyEqualityTest.SloppyEqualityTest': [FAIL],
+  # Maglev doesn't produce optimized enough code to trigger expected
+  # deoptimization.
+  'FeedbackVectorTest.VectorCallSpeculationModeAndFeedbackContent': [FAIL],
+}],  # variant in (stress_maglev, stress_maglev_future, stress_maglev_no_turbofan, maglev_no_turbofan)
 ]
diff --git a/deps/v8/test/unittests/utils/allocation-unittest.cc b/deps/v8/test/unittests/utils/allocation-unittest.cc
index af0eb5a612e60f..56c639850db2dc 100644
--- a/deps/v8/test/unittests/utils/allocation-unittest.cc
+++ b/deps/v8/test/unittests/utils/allocation-unittest.cc
@@ -33,6 +33,9 @@ namespace {
 
 class MemoryAllocationPermissionsTest : public TestWithPlatform {
   static void SignalHandler(int signal, siginfo_t* info, void*) {
+#if V8_HAS_PKU_JIT_WRITE_PROTECT
+    RwxMemoryWriteScope::SetDefaultPermissionsForSignalHandler();
+#endif
     siglongjmp(continuation_, 1);
   }
   struct sigaction old_action_;
diff --git a/deps/v8/test/unittests/utils/identity-map-unittest.cc b/deps/v8/test/unittests/utils/identity-map-unittest.cc
index 281f2d9ecc2d8a..2c03d0149c2cf1 100644
--- a/deps/v8/test/unittests/utils/identity-map-unittest.cc
+++ b/deps/v8/test/unittests/utils/identity-map-unittest.cc
@@ -11,6 +11,7 @@
 #include "src/objects/heap-number-inl.h"
 #include "src/objects/objects.h"
 #include "src/zone/zone.h"
+#include "test/unittests/heap/heap-utils.h"
 #include "test/unittests/test-utils.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ -695,7 +696,7 @@ TEST_F(IdentityMapTest, ExplicitGC) {
   }
 
   // Do an explicit, real GC.
-  CollectGarbage(i::NEW_SPACE);
+  InvokeMinorGC();
 
   // Check that searching for the numbers finds the same values.
   for (size_t i = 0; i < arraysize(num_keys); i++) {
@@ -704,86 +705,6 @@ TEST_F(IdentityMapTest, ExplicitGC) {
   }
 }
 
-TEST_F(IdentityMapTest, CanonicalHandleScope) {
-  HandleScope outer(isolate());
-  CanonicalHandleScope outer_canonical(isolate());
-
-  // Deduplicate smi handles.
-  std::vector<Handle<Object>> smi_handles;
-  for (int i = 0; i < 100; i++) {
-    smi_handles.push_back(Handle<Object>(Smi::FromInt(i), isolate()));
-  }
-  Address* next_handle = isolate()->handle_scope_data()->next;
-  for (int i = 0; i < 100; i++) {
-    Handle<Object> new_smi = Handle<Object>(Smi::FromInt(i), isolate());
-    Handle<Object> old_smi = smi_handles[i];
-    CHECK_EQ(new_smi.location(), old_smi.location());
-  }
-  // Check that no new handles have been allocated.
-  CHECK_EQ(next_handle, isolate()->handle_scope_data()->next);
-
-  // Deduplicate root list items.
-  Handle<String> empty_string(ReadOnlyRoots(isolate()->heap()).empty_string(),
-                              isolate());
-  Handle<Map> free_space_map(ReadOnlyRoots(isolate()->heap()).free_space_map(),
-                             isolate());
-  Handle<Symbol> uninitialized_symbol(
-      ReadOnlyRoots(isolate()->heap()).uninitialized_symbol(), isolate());
-  CHECK_EQ(isolate()->factory()->empty_string().location(),
-           empty_string.location());
-  CHECK_EQ(isolate()->factory()->free_space_map().location(),
-           free_space_map.location());
-  CHECK_EQ(isolate()->factory()->uninitialized_symbol().location(),
-           uninitialized_symbol.location());
-  // Check that no new handles have been allocated.
-  CHECK_EQ(next_handle, isolate()->handle_scope_data()->next);
-
-  // Test ordinary heap objects.
-  Handle<HeapNumber> number1 = isolate()->factory()->NewHeapNumber(3.3);
-  Handle<String> string1 =
-      isolate()->factory()->NewStringFromAsciiChecked("test");
-  next_handle = isolate()->handle_scope_data()->next;
-  Handle<HeapNumber> number2(*number1, isolate());
-  Handle<String> string2(*string1, isolate());
-  CHECK_EQ(number1.location(), number2.location());
-  CHECK_EQ(string1.location(), string2.location());
-  CollectAllGarbage();
-  Handle<HeapNumber> number3(*number2, isolate());
-  Handle<String> string3(*string2, isolate());
-  CHECK_EQ(number1.location(), number3.location());
-  CHECK_EQ(string1.location(), string3.location());
-  // Check that no new handles have been allocated.
-  CHECK_EQ(next_handle, isolate()->handle_scope_data()->next);
-
-  // Inner handle scope do not create canonical handles.
-  {
-    HandleScope inner(isolate());
-    Handle<HeapNumber> number4(*number1, isolate());
-    Handle<String> string4(*string1, isolate());
-    CHECK_NE(number1.location(), number4.location());
-    CHECK_NE(string1.location(), string4.location());
-
-    // Nested canonical scope does not conflict with outer canonical scope,
-    // but does not canonicalize across scopes.
-    CanonicalHandleScope inner_canonical(isolate());
-    Handle<HeapNumber> number5(*number4, isolate());
-    Handle<String> string5(*string4, isolate());
-    CHECK_NE(number4.location(), number5.location());
-    CHECK_NE(string4.location(), string5.location());
-    CHECK_NE(number1.location(), number5.location());
-    CHECK_NE(string1.location(), string5.location());
-
-    Handle<HeapNumber> number6(*number1, isolate());
-    Handle<String> string6(*string1, isolate());
-    CHECK_NE(number4.location(), number6.location());
-    CHECK_NE(string4.location(), string6.location());
-    CHECK_NE(number1.location(), number6.location());
-    CHECK_NE(string1.location(), string6.location());
-    CHECK_EQ(number5.location(), number6.location());
-    CHECK_EQ(string5.location(), string6.location());
-  }
-}
-
 TEST_F(IdentityMapTest, GCShortCutting) {
   if (v8_flags.single_generation) return;
   // We don't create ThinStrings immediately when using the forwarding table.
@@ -807,7 +728,7 @@ TEST_F(IdentityMapTest, GCShortCutting) {
         factory->NewStringFromAsciiChecked("thin_string");
     Handle<String> internalized_string =
         factory->InternalizeString(thin_string);
-    DCHECK(thin_string->IsThinString());
+    DCHECK(IsThinString(*thin_string));
     DCHECK_NE(*thin_string, *internalized_string);
 
     // Insert both keys into the map.
@@ -815,9 +736,9 @@ TEST_F(IdentityMapTest, GCShortCutting) {
     t.map.Insert(internalized_string, &internalized_string);
 
     // Do an explicit, real GC, this should short-cut the thin string to point
-    // to the internalized string (this is not implemented for MinorMC).
-    CollectGarbage(i::NEW_SPACE);
-    DCHECK_IMPLIES(!v8_flags.minor_mc && !v8_flags.optimize_for_size,
+    // to the internalized string (this is not implemented for MinorMS).
+    InvokeMinorGC();
+    DCHECK_IMPLIES(!v8_flags.minor_ms && !v8_flags.optimize_for_size,
                    *thin_string == *internalized_string);
 
     // Check that getting the object points to one of the handles.
diff --git a/deps/v8/test/unittests/wasm/control-transfer-unittest.cc b/deps/v8/test/unittests/wasm/control-transfer-unittest.cc
deleted file mode 100644
index 405dee1ef3730d..00000000000000
--- a/deps/v8/test/unittests/wasm/control-transfer-unittest.cc
+++ /dev/null
@@ -1,526 +0,0 @@
-// Copyright 2016 the V8 project authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-
-#include "src/init/v8.h"
-#include "test/common/wasm/wasm-interpreter.h"
-#include "test/common/wasm/wasm-macro-gen.h"
-#include "test/unittests/test-utils.h"
-#include "testing/gmock/include/gmock/gmock.h"
-
-using testing::MakeMatcher;
-using testing::Matcher;
-using testing::MatcherInterface;
-using testing::MatchResultListener;
-using testing::StringMatchResultListener;
-
-namespace v8 {
-namespace internal {
-namespace wasm {
-
-struct ExpectedControlTransfer {
-  pc_t pc;
-  pcdiff_t pc_diff;
-  uint32_t sp_diff;
-  uint32_t target_arity;
-};
-
-// For nicer error messages.
-class ControlTransferMatcher
-    : public MatcherInterface<const ControlTransferEntry&> {
- public:
-  explicit ControlTransferMatcher(pc_t pc,
-                                  const ExpectedControlTransfer& expected)
-      : pc_(pc), expected_(expected) {}
-
-  void DescribeTo(std::ostream* os) const override {
-    *os << "@" << pc_ << ": pcdiff = " << expected_.pc_diff
-        << ", spdiff = " << expected_.sp_diff
-        << ", target arity = " << expected_.target_arity;
-  }
-
-  bool MatchAndExplain(const ControlTransferEntry& input,
-                       MatchResultListener* listener) const override {
-    if (input.pc_diff == expected_.pc_diff &&
-        input.sp_diff == expected_.sp_diff &&
-        input.target_arity == expected_.target_arity) {
-      return true;
-    }
-    *listener << "@" << pc_ << ": pcdiff = " << input.pc_diff
-              << ", spdiff = " << input.sp_diff
-              << ", target arity = " << input.target_arity;
-    return false;
-  }
-
- private:
-  pc_t pc_;
-  const ExpectedControlTransfer& expected_;
-};
-
-class ControlTransferTest : public TestWithZone {
- public:
-  static constexpr pc_t kPcShiftForLocalsCount = 1;
-
-  template <int kCodeLen>
-  void CheckTransfers(
-      const byte (&code)[kCodeLen],
-      std::initializer_list<ExpectedControlTransfer> expected_transfers) {
-    // Add a leading '0' for number of locals and append the 'end' opcode.
-    byte function_body[kCodeLen + 2];
-    function_body[0] = 0;
-    memcpy(function_body + 1, code, kCodeLen);
-    function_body[kCodeLen + 1] = kExprEnd;
-
-    ControlTransferMap map = WasmInterpreter::ComputeControlTransfersForTesting(
-        zone(), std::begin(function_body), std::end(function_body));
-    // Check all control targets in the map.
-    for (auto& expected_transfer : expected_transfers) {
-      pc_t pc = expected_transfer.pc + kPcShiftForLocalsCount;
-      EXPECT_TRUE(map.map.count(pc) > 0) << "expected control target @" << pc;
-      if (!map.map.count(pc)) continue;
-      auto& entry = map.map[pc];
-      EXPECT_THAT(entry, MakeMatcher(new ControlTransferMatcher(
-                             pc, expected_transfer)));
-    }
-
-    // Check there are no other control targets.
-    CheckNoOtherTargets(std::begin(function_body), std::end(function_body), map,
-                        expected_transfers);
-  }
-
-  void CheckNoOtherTargets(
-      const byte* start, const byte* end, const ControlTransferMap& map,
-      std::initializer_list<ExpectedControlTransfer> targets) {
-    // Check there are no other control targets.
-    for (pc_t pc = 0; start + pc < end; pc++) {
-      bool found = false;
-      for (auto& target : targets) {
-        if (target.pc + kPcShiftForLocalsCount == pc) {
-          found = true;
-          break;
-        }
-      }
-      if (found) continue;
-      EXPECT_TRUE(map.map.count(pc) == 0) << "expected no control @ +" << pc;
-    }
-  }
-};
-
-TEST_F(ControlTransferTest, SimpleIf) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprEnd        // @4
-  };
-  CheckTransfers(code, {{2, 2, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleIf1) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprNop,       // @4
-      kExprEnd        // @5
-  };
-  CheckTransfers(code, {{2, 3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleIf2) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprNop,       // @4
-      kExprNop,       // @5
-      kExprEnd        // @6
-  };
-  CheckTransfers(code, {{2, 4, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleIfElse) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprElse,      // @4
-      kExprEnd        // @5
-  };
-  CheckTransfers(code, {{2, 3, 0, 0}, {4, 2, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleIfElse_v1) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprI32Const,  // @4
-      0,              // @5
-      kExprElse,      // @6
-      kExprI32Const,  // @7
-      0,              // @8
-      kExprEnd        // @9
-  };
-  CheckTransfers(code, {{2, 5, 0, 0}, {6, 4, 1, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleIfElse1) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprElse,      // @4
-      kExprNop,       // @5
-      kExprEnd        // @6
-  };
-  CheckTransfers(code, {{2, 3, 0, 0}, {4, 3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, IfBr) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprBr,        // @4
-      0,              // @5
-      kExprEnd        // @6
-  };
-  CheckTransfers(code, {{2, 4, 0, 0}, {4, 3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, IfBrElse) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprBr,        // @4
-      0,              // @5
-      kExprElse,      // @6
-      kExprEnd        // @7
-  };
-  CheckTransfers(code, {{2, 5, 0, 0}, {4, 4, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, IfElseBr) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprIf,        // @2
-      kVoidCode,      // @3
-      kExprElse,      // @4
-      kExprBr,        // @5
-      0,              // @6
-      kExprEnd        // @7
-  };
-  CheckTransfers(code, {{2, 3, 0, 0}, {4, 4, 0, 0}, {5, 3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, BlockEmpty) {
-  byte code[] = {
-      kExprBlock,  // @0
-      kVoidCode,   // @1
-      kExprEnd     // @2
-  };
-  CheckTransfers(code, {});
-}
-
-TEST_F(ControlTransferTest, Br0) {
-  byte code[] = {
-      kExprBlock,  // @0
-      kVoidCode,   // @1
-      kExprBr,     // @2
-      0,           // @3
-      kExprEnd     // @4
-  };
-  CheckTransfers(code, {{2, 3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, Br1) {
-  byte code[] = {
-      kExprBlock,  // @0
-      kVoidCode,   // @1
-      kExprNop,    // @2
-      kExprBr,     // @3
-      0,           // @4
-      kExprEnd     // @5
-  };
-  CheckTransfers(code, {{3, 3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, Br_v1a) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kVoidCode,      // @1
-      kExprI32Const,  // @2
-      0,              // @3
-      kExprBr,        // @4
-      0,              // @5
-      kExprEnd        // @6
-  };
-  CheckTransfers(code, {{4, 3, 1, 0}});
-}
-
-TEST_F(ControlTransferTest, Br_v1b) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kVoidCode,      // @1
-      kExprI32Const,  // @2
-      0,              // @3
-      kExprBr,        // @4
-      0,              // @5
-      kExprEnd        // @6
-  };
-  CheckTransfers(code, {{4, 3, 1, 0}});
-}
-
-TEST_F(ControlTransferTest, Br_v1c) {
-  byte code[] = {
-      kExprI32Const,  // @0
-      0,              // @1
-      kExprBlock,     // @2
-      kVoidCode,      // @3
-      kExprBr,        // @4
-      0,              // @5
-      kExprEnd        // @6
-  };
-  CheckTransfers(code, {{4, 3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, Br_v1d) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kI32Code,       // @1
-      kExprI32Const,  // @2
-      0,              // @3
-      kExprBr,        // @4
-      0,              // @5
-      kExprEnd        // @6
-  };
-  CheckTransfers(code, {{4, 3, 1, 1}});
-}
-
-TEST_F(ControlTransferTest, Br2) {
-  byte code[] = {
-      kExprBlock,  // @0
-      kVoidCode,   // @1
-      kExprNop,    // @2
-      kExprNop,    // @3
-      kExprBr,     // @4
-      0,           // @5
-      kExprEnd     // @6
-  };
-  CheckTransfers(code, {{4, 3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, Br0b) {
-  byte code[] = {
-      kExprBlock,  // @0
-      kVoidCode,   // @1
-      kExprBr,     // @2
-      0,           // @3
-      kExprNop,    // @4
-      kExprEnd     // @5
-  };
-  CheckTransfers(code, {{2, 4, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, Br0c) {
-  byte code[] = {
-      kExprBlock,  // @0
-      kVoidCode,   // @1
-      kExprBr,     // @2
-      0,           // @3
-      kExprNop,    // @4
-      kExprNop,    // @5
-      kExprEnd     // @6
-  };
-  CheckTransfers(code, {{2, 5, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleLoop1) {
-  byte code[] = {
-      kExprLoop,  // @0
-      kVoidCode,  // @1
-      kExprBr,    // @2
-      0,          // @3
-      kExprEnd    // @4
-  };
-  CheckTransfers(code, {{2, -2, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleLoop2) {
-  byte code[] = {
-      kExprLoop,  // @0
-      kVoidCode,  // @1
-      kExprNop,   // @2
-      kExprBr,    // @3
-      0,          // @4
-      kExprEnd    // @5
-  };
-  CheckTransfers(code, {{3, -3, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleLoopExit1) {
-  byte code[] = {
-      kExprLoop,  // @0
-      kVoidCode,  // @1
-      kExprBr,    // @2
-      1,          // @3
-      kExprEnd    // @4
-  };
-  CheckTransfers(code, {{2, 4, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, SimpleLoopExit2) {
-  byte code[] = {
-      kExprLoop,  // @0
-      kVoidCode,  // @1
-      kExprNop,   // @2
-      kExprBr,    // @3
-      1,          // @4
-      kExprEnd    // @5
-  };
-  CheckTransfers(code, {{3, 4, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, BrTable0) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kVoidCode,      // @1
-      kExprI32Const,  // @2
-      0,              // @3
-      kExprBrTable,   // @4
-      0,              // @5
-      U32V_1(0),      // @6
-      kExprEnd        // @7
-  };
-  CheckTransfers(code, {{4, 4, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, BrTable0_v1a) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kVoidCode,      // @1
-      kExprI32Const,  // @2
-      0,              // @3
-      kExprI32Const,  // @4
-      0,              // @5
-      kExprBrTable,   // @6
-      0,              // @7
-      U32V_1(0),      // @8
-      kExprEnd        // @9
-  };
-  CheckTransfers(code, {{6, 4, 1, 0}});
-}
-
-TEST_F(ControlTransferTest, BrTable0_v1b) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kVoidCode,      // @1
-      kExprI32Const,  // @2
-      0,              // @3
-      kExprI32Const,  // @4
-      0,              // @5
-      kExprBrTable,   // @6
-      0,              // @7
-      U32V_1(0),      // @8
-      kExprEnd        // @9
-  };
-  CheckTransfers(code, {{6, 4, 1, 0}});
-}
-
-TEST_F(ControlTransferTest, BrTable1) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kVoidCode,      // @1
-      kExprI32Const,  // @2
-      0,              // @3
-      kExprBrTable,   // @4
-      1,              // @5
-      U32V_1(0),      // @6
-      U32V_1(0),      // @7
-      kExprEnd        // @8
-  };
-  CheckTransfers(code, {{4, 5, 0, 0}, {5, 4, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, BrTable2) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kVoidCode,      // @1
-      kExprBlock,     // @2
-      kVoidCode,      // @3
-      kExprI32Const,  // @4
-      0,              // @5
-      kExprBrTable,   // @6
-      2,              // @7
-      U32V_1(0),      // @8
-      U32V_1(0),      // @9
-      U32V_1(1),      // @10
-      kExprEnd,       // @11
-      kExprEnd        // @12
-  };
-  CheckTransfers(code, {{6, 6, 0, 0}, {7, 5, 0, 0}, {8, 5, 0, 0}});
-}
-
-TEST_F(ControlTransferTest, BiggerSpDiffs) {
-  byte code[] = {
-      kExprBlock,     // @0
-      kI32Code,       // @1
-      kExprI32Const,  // @2
-      0,              // @3
-      kExprBlock,     // @4
-      kVoidCode,      // @5
-      kExprI32Const,  // @6
-      0,              // @7
-      kExprI32Const,  // @8
-      0,              // @9
-      kExprI32Const,  // @10
-      0,              // @11
-      kExprBrIf,      // @12
-      0,              // @13
-      kExprBr,        // @14
-      1,              // @15
-      kExprEnd,       // @16
-      kExprEnd        // @17
-  };
-  CheckTransfers(code, {{12, 5, 2, 0}, {14, 4, 3, 1}});
-}
-
-TEST_F(ControlTransferTest, NoInfoForUnreachableCode) {
-  byte code[] = {
-      kExprBlock,        // @0
-      kVoidCode,         // @1
-      kExprBr,           // @2
-      0,                 // @3
-      kExprBr,           // @4 -- no control transfer entry!
-      1,                 // @5
-      kExprEnd,          // @6
-      kExprBlock,        // @7
-      kVoidCode,         // @8
-      kExprUnreachable,  // @9
-      kExprI32Const,     // @10
-      0,                 // @11
-      kExprIf,           // @12 -- no control transfer entry!
-      kVoidCode,         // @13
-      kExprBr,           // @14 -- no control transfer entry!
-      0,                 // @15
-      kExprElse,         // @16 -- no control transfer entry!
-      kExprEnd,          // @17
-      kExprEnd           // @18
-  };
-  CheckTransfers(code, {{2, 5, 0, 0}});
-}
-
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
diff --git a/deps/v8/test/unittests/wasm/decoder-unittest.cc b/deps/v8/test/unittests/wasm/decoder-unittest.cc
index 3e43729e0e3c80..ce268f221ceb2a 100644
--- a/deps/v8/test/unittests/wasm/decoder-unittest.cc
+++ b/deps/v8/test/unittests/wasm/decoder-unittest.cc
@@ -22,7 +22,7 @@ class DecoderTest : public TestWithZone {
 
 #define CHECK_UINT32V_INLINE(expected, expected_length, ...)            \
   do {                                                                  \
-    const byte data[] = {__VA_ARGS__};                                  \
+    const uint8_t data[] = {__VA_ARGS__};                               \
     decoder.Reset(data, data + sizeof(data));                           \
     auto [value, length] =                                              \
         decoder.read_u32v<Decoder::FullValidationTag>(decoder.start()); \
@@ -36,7 +36,7 @@ class DecoderTest : public TestWithZone {
 
 #define CHECK_INT32V_INLINE(expected, expected_length, ...)             \
   do {                                                                  \
-    const byte data[] = {__VA_ARGS__};                                  \
+    const uint8_t data[] = {__VA_ARGS__};                               \
     decoder.Reset(data, data + sizeof(data));                           \
     auto [value, length] =                                              \
         decoder.read_i32v<Decoder::FullValidationTag>(decoder.start()); \
@@ -50,7 +50,7 @@ class DecoderTest : public TestWithZone {
 
 #define CHECK_UINT64V_INLINE(expected, expected_length, ...)            \
   do {                                                                  \
-    const byte data[] = {__VA_ARGS__};                                  \
+    const uint8_t data[] = {__VA_ARGS__};                               \
     decoder.Reset(data, data + sizeof(data));                           \
     auto [value, length] =                                              \
         decoder.read_u64v<Decoder::FullValidationTag>(decoder.start()); \
@@ -60,7 +60,7 @@ class DecoderTest : public TestWithZone {
 
 #define CHECK_INT64V_INLINE(expected, expected_length, ...)             \
   do {                                                                  \
-    const byte data[] = {__VA_ARGS__};                                  \
+    const uint8_t data[] = {__VA_ARGS__};                               \
     decoder.Reset(data, data + sizeof(data));                           \
     auto [value, length] =                                              \
         decoder.read_i64v<Decoder::FullValidationTag>(decoder.start()); \
@@ -374,14 +374,14 @@ TEST_F(DecoderTest, ReadI32v_FiveByte) {
 }
 
 TEST_F(DecoderTest, ReadU32v_off_end1) {
-  static const byte data[] = {U32V_1(11)};
+  static const uint8_t data[] = {U32V_1(11)};
   decoder.Reset(data, data);
   decoder.read_u32v<Decoder::FullValidationTag>(decoder.start());
   EXPECT_FALSE(decoder.ok());
 }
 
 TEST_F(DecoderTest, ReadU32v_off_end2) {
-  static const byte data[] = {U32V_2(1111)};
+  static const uint8_t data[] = {U32V_2(1111)};
   for (size_t i = 0; i < sizeof(data); i++) {
     decoder.Reset(data, data + i);
     decoder.read_u32v<Decoder::FullValidationTag>(decoder.start());
@@ -390,7 +390,7 @@ TEST_F(DecoderTest, ReadU32v_off_end2) {
 }
 
 TEST_F(DecoderTest, ReadU32v_off_end3) {
-  static const byte data[] = {U32V_3(111111)};
+  static const uint8_t data[] = {U32V_3(111111)};
   for (size_t i = 0; i < sizeof(data); i++) {
     decoder.Reset(data, data + i);
     decoder.read_u32v<Decoder::FullValidationTag>(decoder.start());
@@ -399,7 +399,7 @@ TEST_F(DecoderTest, ReadU32v_off_end3) {
 }
 
 TEST_F(DecoderTest, ReadU32v_off_end4) {
-  static const byte data[] = {U32V_4(11111111)};
+  static const uint8_t data[] = {U32V_4(11111111)};
   for (size_t i = 0; i < sizeof(data); i++) {
     decoder.Reset(data, data + i);
     decoder.read_u32v<Decoder::FullValidationTag>(decoder.start());
@@ -408,7 +408,7 @@ TEST_F(DecoderTest, ReadU32v_off_end4) {
 }
 
 TEST_F(DecoderTest, ReadU32v_off_end5) {
-  static const byte data[] = {U32V_5(111111111)};
+  static const uint8_t data[] = {U32V_5(111111111)};
   for (size_t i = 0; i < sizeof(data); i++) {
     decoder.Reset(data, data + i);
     decoder.read_u32v<Decoder::FullValidationTag>(decoder.start());
@@ -417,9 +417,9 @@ TEST_F(DecoderTest, ReadU32v_off_end5) {
 }
 
 TEST_F(DecoderTest, ReadU32v_extra_bits) {
-  byte data[] = {0x80, 0x80, 0x80, 0x80, 0x00};
+  uint8_t data[] = {0x80, 0x80, 0x80, 0x80, 0x00};
   for (int i = 1; i < 16; i++) {
-    data[4] = static_cast<byte>(i << 4);
+    data[4] = static_cast<uint8_t>(i << 4);
     decoder.Reset(data, data + sizeof(data));
     decoder.read_u32v<Decoder::FullValidationTag>(decoder.start());
     EXPECT_FALSE(decoder.ok());
@@ -428,7 +428,7 @@ TEST_F(DecoderTest, ReadU32v_extra_bits) {
 
 TEST_F(DecoderTest, ReadI32v_extra_bits_negative) {
   // OK for negative signed values to have extra ones.
-  byte data[] = {0xFF, 0xFF, 0xFF, 0xFF, 0x7F};
+  uint8_t data[] = {0xFF, 0xFF, 0xFF, 0xFF, 0x7F};
   decoder.Reset(data, data + sizeof(data));
   auto [result, length] =
       decoder.read_i32v<Decoder::FullValidationTag>(decoder.start());
@@ -438,7 +438,7 @@ TEST_F(DecoderTest, ReadI32v_extra_bits_negative) {
 
 TEST_F(DecoderTest, ReadI32v_extra_bits_positive) {
   // Not OK for positive signed values to have extra ones.
-  byte data[] = {0x80, 0x80, 0x80, 0x80, 0x77};
+  uint8_t data[] = {0x80, 0x80, 0x80, 0x80, 0x77};
   decoder.Reset(data, data + sizeof(data));
   decoder.read_i32v<Decoder::FullValidationTag>(decoder.start());
   EXPECT_FALSE(decoder.ok());
@@ -453,7 +453,7 @@ TEST_F(DecoderTest, ReadU32v_Bits) {
       0xC4A0CF81, 0x16C6EB85, 0x4206DB8E, 0xF3B089D5, 0xAA2E223E, 0xF99E29C8,
       0x4A4357D8, 0x1890B1C1, 0x8D80A085, 0xACB6AE4C, 0x1B827E10, 0xEB5C7BD9,
       0xBB1BC146, 0xDF57A33l};
-  byte data[kMaxSize];
+  uint8_t data[kMaxSize];
 
   // foreach value in above array
   for (size_t v = 0; v < arraysize(kVals); v++) {
@@ -465,7 +465,7 @@ TEST_F(DecoderTest, ReadU32v_Bits) {
 
       unsigned length = 1 + i / 7;
       for (unsigned j = 0; j < kMaxSize; j++) {
-        data[j] = static_cast<byte>((val >> (7 * j)) & MASK_7);
+        data[j] = static_cast<uint8_t>((val >> (7 * j)) & MASK_7);
       }
       for (unsigned j = 0; j < length - 1; j++) {
         data[j] |= 0x80;
@@ -520,7 +520,7 @@ TEST_F(DecoderTest, ReadI64v_OneByte) {
 
 TEST_F(DecoderTest, ReadU64v_PowerOf2) {
   const int kMaxSize = 10;
-  byte data[kMaxSize];
+  uint8_t data[kMaxSize];
 
   for (unsigned i = 0; i < 64; i++) {
     const uint64_t val = 1ull << i;
@@ -551,7 +551,7 @@ TEST_F(DecoderTest, ReadU64v_Bits) {
       0x123456789ABCDEF0ull, 0x80309488729ED997ull, 0xC4A0CF8116C6EB85ull,
       0x4206DB8EF3B089D5ull, 0xAA2E223EF99E29C8ull, 0x4A4357D81890B1C1ull,
       0x8D80A085ACB6AE4Cull, 0x1B827E10EB5C7BD9ull, 0xBB1BC146DF57A338ull};
-  byte data[kMaxSize];
+  uint8_t data[kMaxSize];
 
   // foreach value in above array
   for (size_t v = 0; v < arraysize(kVals); v++) {
@@ -562,7 +562,7 @@ TEST_F(DecoderTest, ReadU64v_Bits) {
 
       unsigned length = 1 + i / 7;
       for (unsigned j = 0; j < kMaxSize; j++) {
-        data[j] = static_cast<byte>((val >> (7 * j)) & MASK_7);
+        data[j] = static_cast<uint8_t>((val >> (7 * j)) & MASK_7);
       }
       for (unsigned j = 0; j < length - 1; j++) {
         data[j] |= 0x80;
@@ -594,7 +594,7 @@ TEST_F(DecoderTest, ReadI64v_Bits) {
       0x123456789ABCDEF0ull, 0x80309488729ED997ull, 0xC4A0CF8116C6EB85ull,
       0x4206DB8EF3B089D5ull, 0xAA2E223EF99E29C8ull, 0x4A4357D81890B1C1ull,
       0x8D80A085ACB6AE4Cull, 0x1B827E10EB5C7BD9ull, 0xBB1BC146DF57A338ull};
-  byte data[kMaxSize];
+  uint8_t data[kMaxSize];
 
   // foreach value in above array
   for (size_t v = 0; v < arraysize(kVals); v++) {
@@ -605,7 +605,7 @@ TEST_F(DecoderTest, ReadI64v_Bits) {
 
       unsigned length = 1 + i / 7;
       for (unsigned j = 0; j < kMaxSize; j++) {
-        data[j] = static_cast<byte>((val >> (7 * j)) & MASK_7);
+        data[j] = static_cast<uint8_t>((val >> (7 * j)) & MASK_7);
       }
       for (unsigned j = 0; j < length - 1; j++) {
         data[j] |= 0x80;
@@ -629,9 +629,9 @@ TEST_F(DecoderTest, ReadI64v_Bits) {
 }
 
 TEST_F(DecoderTest, ReadU64v_extra_bits) {
-  byte data[] = {0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x00};
+  uint8_t data[] = {0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x00};
   for (int i = 1; i < 128; i++) {
-    data[9] = static_cast<byte>(i << 1);
+    data[9] = static_cast<uint8_t>(i << 1);
     decoder.Reset(data, data + sizeof(data));
     decoder.read_u64v<Decoder::FullValidationTag>(decoder.start());
     EXPECT_FALSE(decoder.ok());
@@ -640,7 +640,7 @@ TEST_F(DecoderTest, ReadU64v_extra_bits) {
 
 TEST_F(DecoderTest, ReadI64v_extra_bits_negative) {
   // OK for negative signed values to have extra ones.
-  byte data[] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x7F};
+  uint8_t data[] = {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0x7F};
   decoder.Reset(data, data + sizeof(data));
   auto [result, length] =
       decoder.read_i64v<Decoder::FullValidationTag>(decoder.start());
@@ -650,7 +650,7 @@ TEST_F(DecoderTest, ReadI64v_extra_bits_negative) {
 
 TEST_F(DecoderTest, ReadI64v_extra_bits_positive) {
   // Not OK for positive signed values to have extra ones.
-  byte data[] = {0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x77};
+  uint8_t data[] = {0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x80, 0x77};
   decoder.Reset(data, data + sizeof(data));
   decoder.read_i64v<Decoder::FullValidationTag>(decoder.start());
   EXPECT_FALSE(decoder.ok());
diff --git a/deps/v8/test/unittests/wasm/function-body-decoder-unittest.cc b/deps/v8/test/unittests/wasm/function-body-decoder-unittest.cc
index b91df08e9af0e4..c26b265a2fbcce 100644
--- a/deps/v8/test/unittests/wasm/function-body-decoder-unittest.cc
+++ b/deps/v8/test/unittests/wasm/function-body-decoder-unittest.cc
@@ -20,10 +20,7 @@
 #include "test/unittests/test-utils.h"
 #include "testing/gmock-support.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
-namespace function_body_decoder_unittest {
+namespace v8::internal::wasm {
 
 #define B1(a) WASM_BLOCK(a)
 #define B2(a, b) WASM_BLOCK(a, b)
@@ -40,10 +37,10 @@ namespace function_body_decoder_unittest {
     }                                                            \
   } while (false)
 
-static const byte kCodeGetLocal0[] = {kExprLocalGet, 0};
-static const byte kCodeGetLocal1[] = {kExprLocalGet, 1};
-static const byte kCodeSetLocal0[] = {WASM_LOCAL_SET(0, WASM_ZERO)};
-static const byte kCodeTeeLocal0[] = {WASM_LOCAL_TEE(0, WASM_ZERO)};
+static const uint8_t kCodeGetLocal0[] = {kExprLocalGet, 0};
+static const uint8_t kCodeGetLocal1[] = {kExprLocalGet, 1};
+static const uint8_t kCodeSetLocal0[] = {WASM_LOCAL_SET(0, WASM_ZERO)};
+static const uint8_t kCodeTeeLocal0[] = {WASM_LOCAL_TEE(0, WASM_ZERO)};
 
 static const ValueType kValueTypes[] = {kWasmI32, kWasmI64, kWasmF32, kWasmF64,
                                         kWasmExternRef};
@@ -60,7 +57,7 @@ static const WasmOpcode kInt32BinopOpcodes[] = {
     kExprI32LeS,  kExprI32LtU,  kExprI32LeU};
 
 #define WASM_BRV_IF_ZERO(depth, val) \
-  val, WASM_ZERO, kExprBrIf, static_cast<byte>(depth)
+  val, WASM_ZERO, kExprBrIf, static_cast<uint8_t>(depth)
 
 constexpr size_t kMaxByteSizedLeb128 = 127;
 
@@ -81,39 +78,40 @@ class TestModuleBuilder {
     // Asm.js functions are valid by design.
     if (is_asmjs_module(&mod)) mod.validated_functions[0] = 0xff;
   }
-  byte AddGlobal(ValueType type, bool mutability = true) {
+  uint8_t AddGlobal(ValueType type, bool mutability = true) {
     mod.globals.push_back({type, mutability, {}, {0}, false, false});
     CHECK_LE(mod.globals.size(), kMaxByteSizedLeb128);
-    return static_cast<byte>(mod.globals.size() - 1);
+    return static_cast<uint8_t>(mod.globals.size() - 1);
   }
-  byte AddSignature(const FunctionSig* sig, uint32_t supertype = kNoSuperType) {
+  uint8_t AddSignature(const FunctionSig* sig,
+                       uint32_t supertype = kNoSuperType) {
     mod.add_signature(sig, supertype, v8_flags.wasm_final_types);
     CHECK_LE(mod.types.size(), kMaxByteSizedLeb128);
     GetTypeCanonicalizer()->AddRecursiveGroup(module(), 1);
-    return static_cast<byte>(mod.types.size() - 1);
+    return static_cast<uint8_t>(mod.types.size() - 1);
   }
-  byte AddFunction(const FunctionSig* sig, bool declared = true) {
-    byte sig_index = AddSignature(sig);
+  uint8_t AddFunction(const FunctionSig* sig, bool declared = true) {
+    uint8_t sig_index = AddSignature(sig);
     return AddFunctionImpl(sig, sig_index, declared);
   }
-  byte AddFunction(uint32_t sig_index, bool declared = true) {
+  uint8_t AddFunction(uint32_t sig_index, bool declared = true) {
     DCHECK(mod.has_signature(sig_index));
     return AddFunctionImpl(mod.types[sig_index].function_sig, sig_index,
                            declared);
   }
-  byte AddImport(const FunctionSig* sig) {
-    byte result = AddFunction(sig);
+  uint8_t AddImport(const FunctionSig* sig) {
+    uint8_t result = AddFunction(sig);
     mod.functions[result].imported = true;
     return result;
   }
-  byte AddException(WasmTagSig* sig) {
+  uint8_t AddException(WasmTagSig* sig) {
     mod.tags.emplace_back(sig, AddSignature(sig));
     CHECK_LE(mod.types.size(), kMaxByteSizedLeb128);
-    return static_cast<byte>(mod.tags.size() - 1);
+    return static_cast<uint8_t>(mod.tags.size() - 1);
   }
 
-  byte AddTable(ValueType type, uint32_t initial_size, bool has_maximum_size,
-                uint32_t maximum_size) {
+  uint8_t AddTable(ValueType type, uint32_t initial_size, bool has_maximum_size,
+                   uint32_t maximum_size) {
     CHECK(type.is_object_reference());
     mod.tables.emplace_back();
     WasmTable& table = mod.tables.back();
@@ -121,11 +119,11 @@ class TestModuleBuilder {
     table.initial_size = initial_size;
     table.has_maximum_size = has_maximum_size;
     table.maximum_size = maximum_size;
-    return static_cast<byte>(mod.tables.size() - 1);
+    return static_cast<uint8_t>(mod.tables.size() - 1);
   }
 
-  byte AddStruct(std::initializer_list<F> fields,
-                 uint32_t supertype = kNoSuperType) {
+  uint8_t AddStruct(std::initializer_list<F> fields,
+                    uint32_t supertype = kNoSuperType) {
     StructType::Builder type_builder(&mod.signature_zone,
                                      static_cast<uint32_t>(fields.size()));
     for (F field : fields) {
@@ -134,40 +132,42 @@ class TestModuleBuilder {
     mod.add_struct_type(type_builder.Build(), supertype,
                         v8_flags.wasm_final_types);
     GetTypeCanonicalizer()->AddRecursiveGroup(module(), 1);
-    return static_cast<byte>(mod.types.size() - 1);
+    return static_cast<uint8_t>(mod.types.size() - 1);
   }
 
-  byte AddArray(ValueType type, bool mutability) {
+  uint8_t AddArray(ValueType type, bool mutability) {
     ArrayType* array = mod.signature_zone.New<ArrayType>(type, mutability);
     mod.add_array_type(array, kNoSuperType, v8_flags.wasm_final_types);
     GetTypeCanonicalizer()->AddRecursiveGroup(module(), 1);
-    return static_cast<byte>(mod.types.size() - 1);
+    return static_cast<uint8_t>(mod.types.size() - 1);
   }
 
   void InitializeMemory(MemoryType mem_type = kMemory32) {
-    mod.has_memory = true;
-    mod.is_memory64 = mem_type == kMemory64;
-    mod.initial_pages = 1;
-    mod.maximum_pages = 100;
+    CHECK_EQ(0, mod.memories.size());
+    mod.memories.resize(1);
+    WasmMemory& memory = mod.memories[0];
+    memory.is_memory64 = mem_type == kMemory64;
+    memory.initial_pages = 1;
+    memory.maximum_pages = 100;
   }
 
-  byte InitializeTable(wasm::ValueType type) {
+  uint8_t InitializeTable(wasm::ValueType type) {
     mod.tables.emplace_back();
     mod.tables.back().type = type;
-    return static_cast<byte>(mod.tables.size() - 1);
+    return static_cast<uint8_t>(mod.tables.size() - 1);
   }
 
-  byte AddPassiveElementSegment(wasm::ValueType type) {
+  uint8_t AddPassiveElementSegment(wasm::ValueType type) {
     mod.elem_segments.emplace_back(type, WasmElemSegment::kStatusPassive,
                                    WasmElemSegment::kExpressionElements, 0, 0);
-    return static_cast<byte>(mod.elem_segments.size() - 1);
+    return static_cast<uint8_t>(mod.elem_segments.size() - 1);
   }
 
-  byte AddDeclarativeElementSegment() {
+  uint8_t AddDeclarativeElementSegment() {
     mod.elem_segments.emplace_back(kWasmFuncRef,
                                    WasmElemSegment::kStatusDeclarative,
                                    WasmElemSegment::kExpressionElements, 0, 0);
-    return static_cast<byte>(mod.elem_segments.size() - 1);
+    return static_cast<uint8_t>(mod.elem_segments.size() - 1);
   }
 
   // Set the number of data segments as declared by the DataCount section.
@@ -180,8 +180,8 @@ class TestModuleBuilder {
   WasmModule* module() { return &mod; }
 
  private:
-  byte AddFunctionImpl(const FunctionSig* sig, uint32_t sig_index,
-                       bool declared) {
+  uint8_t AddFunctionImpl(const FunctionSig* sig, uint32_t sig_index,
+                          bool declared) {
     mod.functions.push_back(
         {sig,                                          // sig
          static_cast<uint32_t>(mod.functions.size()),  // func_index
@@ -191,7 +191,7 @@ class TestModuleBuilder {
          false,                                        // export
          declared});                                   // declared
     CHECK_LE(mod.functions.size(), kMaxByteSizedLeb128);
-    return static_cast<byte>(mod.functions.size() - 1);
+    return static_cast<uint8_t>(mod.functions.size() - 1);
   }
 
   WasmModule mod;
@@ -216,12 +216,12 @@ class FunctionBodyDecoderTestBase : public WithZoneMixin<BaseTest> {
 
   enum AppendEnd : bool { kAppendEnd, kOmitEnd };
 
-  base::Vector<const byte> PrepareBytecode(base::Vector<const byte> code,
-                                           AppendEnd append_end) {
+  base::Vector<const uint8_t> PrepareBytecode(base::Vector<const uint8_t> code,
+                                              AppendEnd append_end) {
     size_t locals_size = local_decls.Size();
     size_t total_size =
         code.size() + locals_size + (append_end == kAppendEnd ? 1 : 0);
-    byte* buffer = this->zone()->template NewArray<byte>(total_size);
+    uint8_t* buffer = this->zone()->template AllocateArray<uint8_t>(total_size);
     // Prepend the local decls to the code.
     local_decls.Emit(buffer);
     // Emit the code.
@@ -237,26 +237,26 @@ class FunctionBodyDecoderTestBase : public WithZoneMixin<BaseTest> {
   }
 
   template <size_t N>
-  base::Vector<const byte> CodeToVector(const byte (&code)[N]) {
+  base::Vector<const uint8_t> CodeToVector(const uint8_t (&code)[N]) {
     return base::ArrayVector(code);
   }
 
-  base::Vector<const byte> CodeToVector(
-      const std::initializer_list<const byte>& code) {
+  base::Vector<const uint8_t> CodeToVector(
+      const std::initializer_list<const uint8_t>& code) {
     return base::VectorOf(&*code.begin(), code.size());
   }
 
-  base::Vector<const byte> CodeToVector(base::Vector<const byte> vec) {
+  base::Vector<const uint8_t> CodeToVector(base::Vector<const uint8_t> vec) {
     return vec;
   }
 
   // Prepends local variable declarations and renders nice error messages for
   // verification failures.
-  template <typename Code = std::initializer_list<const byte>>
+  template <typename Code = std::initializer_list<const uint8_t>>
   void Validate(bool expected_success, const FunctionSig* sig, Code&& raw_code,
                 AppendEnd append_end = kAppendEnd,
                 const char* message = nullptr) {
-    base::Vector<const byte> code =
+    base::Vector<const uint8_t> code =
         PrepareBytecode(CodeToVector(std::forward<Code>(raw_code)), append_end);
 
     // Validate the code.
@@ -278,14 +278,14 @@ class FunctionBodyDecoderTestBase : public WithZoneMixin<BaseTest> {
     }
   }
 
-  template <typename Code = std::initializer_list<const byte>>
+  template <typename Code = std::initializer_list<const uint8_t>>
   void ExpectValidates(const FunctionSig* sig, Code&& raw_code,
                        AppendEnd append_end = kAppendEnd,
                        const char* message = nullptr) {
     Validate(true, sig, std::forward<Code>(raw_code), append_end, message);
   }
 
-  template <typename Code = std::initializer_list<const byte>>
+  template <typename Code = std::initializer_list<const uint8_t>>
   void ExpectFailure(const FunctionSig* sig, Code&& raw_code,
                      AppendEnd append_end = kAppendEnd,
                      const char* message = nullptr) {
@@ -294,7 +294,7 @@ class FunctionBodyDecoderTestBase : public WithZoneMixin<BaseTest> {
 
   void TestBinop(WasmOpcode opcode, const FunctionSig* success) {
     // op(local[0], local[1])
-    byte code[] = {WASM_BINOP(opcode, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))};
+    uint8_t code[] = {WASM_BINOP(opcode, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))};
     ExpectValidates(success, code);
 
     // Try all combinations of return and parameter types.
@@ -320,7 +320,7 @@ class FunctionBodyDecoderTestBase : public WithZoneMixin<BaseTest> {
 
   void TestUnop(WasmOpcode opcode, ValueType ret_type, ValueType param_type) {
     // Return(op(local[0]))
-    byte code[] = {WASM_UNOP(opcode, WASM_LOCAL_GET(0))};
+    uint8_t code[] = {WASM_UNOP(opcode, WASM_LOCAL_GET(0))};
     {
       ValueType types[] = {ret_type, param_type};
       FunctionSig sig(1, 1, types);
@@ -344,9 +344,9 @@ class FunctionBodyDecoderTestBase : public WithZoneMixin<BaseTest> {
 using FunctionBodyDecoderTest = FunctionBodyDecoderTestBase<TestWithPlatform>;
 
 TEST_F(FunctionBodyDecoderTest, Int32Const1) {
-  byte code[] = {kExprI32Const, 0};
+  uint8_t code[] = {kExprI32Const, 0};
   for (int i = -64; i <= 63; i++) {
-    code[1] = static_cast<byte>(i & 0x7F);
+    code[1] = static_cast<uint8_t>(i & 0x7F);
     ExpectValidates(sigs.i_i(), code);
   }
 }
@@ -363,7 +363,7 @@ TEST_F(FunctionBodyDecoderTest, EmptyFunction) {
 }
 
 TEST_F(FunctionBodyDecoderTest, IncompleteIf1) {
-  byte code[] = {kExprIf};
+  uint8_t code[] = {kExprIf};
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
 }
@@ -393,7 +393,7 @@ TEST_F(FunctionBodyDecoderTest, Int64Const) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Float32Const) {
-  byte code[] = {kExprF32Const, 0, 0, 0, 0};
+  uint8_t code[] = {kExprF32Const, 0, 0, 0, 0};
   Address ptr = reinterpret_cast<Address>(code + 1);
   for (int i = 0; i < 30; i++) {
     base::WriteLittleEndianValue<float>(ptr, i * -7.75f);
@@ -402,7 +402,7 @@ TEST_F(FunctionBodyDecoderTest, Float32Const) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Float64Const) {
-  byte code[] = {kExprF64Const, 0, 0, 0, 0, 0, 0, 0, 0};
+  uint8_t code[] = {kExprF64Const, 0, 0, 0, 0, 0, 0, 0, 0};
   Address ptr = reinterpret_cast<Address>(code + 1);
   for (int i = 0; i < 30; i++) {
     base::WriteLittleEndianValue<double>(ptr, i * 33.45);
@@ -411,7 +411,7 @@ TEST_F(FunctionBodyDecoderTest, Float64Const) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Int32Const_off_end) {
-  byte code[] = {kExprI32Const, 0xAA, 0xBB, 0xCC, 0x44};
+  uint8_t code[] = {kExprI32Const, 0xAA, 0xBB, 0xCC, 0x44};
 
   for (size_t size = 1; size <= 4; ++size) {
     ExpectFailure(sigs.i_i(), base::VectorOf(code, size), kAppendEnd);
@@ -441,9 +441,9 @@ TEST_F(FunctionBodyDecoderTest, GetLocal0_param_n) {
 }
 
 TEST_F(FunctionBodyDecoderTest, GetLocalN_local) {
-  for (byte i = 1; i < 8; i++) {
+  for (uint8_t i = 1; i < 8; i++) {
     AddLocals(kWasmI32, 1);
-    for (byte j = 0; j < i; j++) {
+    for (uint8_t j = 0; j < i; j++) {
       ExpectValidates(sigs.i_v(), {kExprLocalGet, j});
     }
   }
@@ -506,19 +506,19 @@ TEST_F(FunctionBodyDecoderTest, GetLocal_toomany) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Binops_off_end) {
-  byte code1[] = {0};  // [opcode]
+  uint8_t code1[] = {0};  // [opcode]
   for (size_t i = 0; i < arraysize(kInt32BinopOpcodes); i++) {
     code1[0] = kInt32BinopOpcodes[i];
     ExpectFailure(sigs.i_i(), code1);
   }
 
-  byte code3[] = {kExprLocalGet, 0, 0};  // [expr] [opcode]
+  uint8_t code3[] = {kExprLocalGet, 0, 0};  // [expr] [opcode]
   for (size_t i = 0; i < arraysize(kInt32BinopOpcodes); i++) {
     code3[2] = kInt32BinopOpcodes[i];
     ExpectFailure(sigs.i_i(), code3);
   }
 
-  byte code4[] = {kExprLocalGet, 0, 0, 0};  // [expr] [opcode] [opcode]
+  uint8_t code4[] = {kExprLocalGet, 0, 0, 0};  // [expr] [opcode] [opcode]
   for (size_t i = 0; i < arraysize(kInt32BinopOpcodes); i++) {
     code4[2] = kInt32BinopOpcodes[i];
     code4[3] = kInt32BinopOpcodes[i];
@@ -576,9 +576,9 @@ TEST_F(FunctionBodyDecoderTest, TeeLocal0_local) {
 }
 
 TEST_F(FunctionBodyDecoderTest, TeeLocalN_local) {
-  for (byte i = 1; i < 8; i++) {
+  for (uint8_t i = 1; i < 8; i++) {
     AddLocals(kWasmI32, 1);
-    for (byte j = 0; j < i; j++) {
+    for (uint8_t j = 0; j < i; j++) {
       ExpectFailure(sigs.v_v(), {WASM_LOCAL_TEE(j, WASM_I32V_1(i))});
       ExpectValidates(sigs.i_i(), {WASM_LOCAL_TEE(j, WASM_I32V_1(i))});
     }
@@ -587,7 +587,7 @@ TEST_F(FunctionBodyDecoderTest, TeeLocalN_local) {
 
 TEST_F(FunctionBodyDecoderTest, BlockN) {
   constexpr size_t kMaxSize = 200;
-  byte buffer[kMaxSize + 3];
+  uint8_t buffer[kMaxSize + 3];
 
   for (size_t i = 0; i <= kMaxSize; i++) {
     memset(buffer, kExprNop, sizeof(buffer));
@@ -622,7 +622,7 @@ TEST_F(FunctionBodyDecoderTest, Block0_end) {
 #undef WASM_EMPTY_BLOCK
 
 TEST_F(FunctionBodyDecoderTest, Block1) {
-  byte code[] = {WASM_BLOCK_I(WASM_LOCAL_GET(0))};
+  uint8_t code[] = {WASM_BLOCK_I(WASM_LOCAL_GET(0))};
   ExpectValidates(sigs.i_i(), code);
   ExpectFailure(sigs.v_i(), code);
   ExpectFailure(sigs.d_dd(), code);
@@ -631,7 +631,7 @@ TEST_F(FunctionBodyDecoderTest, Block1) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Block1_i) {
-  byte code[] = {WASM_BLOCK_I(WASM_ZERO)};
+  uint8_t code[] = {WASM_BLOCK_I(WASM_ZERO)};
   ExpectValidates(sigs.i_i(), code);
   ExpectFailure(sigs.f_ff(), code);
   ExpectFailure(sigs.d_dd(), code);
@@ -639,7 +639,7 @@ TEST_F(FunctionBodyDecoderTest, Block1_i) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Block1_f) {
-  byte code[] = {WASM_BLOCK_F(WASM_F32(0))};
+  uint8_t code[] = {WASM_BLOCK_F(WASM_F32(0))};
   ExpectFailure(sigs.i_i(), code);
   ExpectValidates(sigs.f_ff(), code);
   ExpectFailure(sigs.d_dd(), code);
@@ -671,7 +671,7 @@ TEST_F(FunctionBodyDecoderTest, Block2) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Block2b) {
-  byte code[] = {WASM_BLOCK_I(WASM_LOCAL_SET(0, WASM_ZERO), WASM_ZERO)};
+  uint8_t code[] = {WASM_BLOCK_I(WASM_LOCAL_SET(0, WASM_ZERO), WASM_ZERO)};
   ExpectValidates(sigs.i_i(), code);
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.f_ff(), code);
@@ -741,14 +741,14 @@ TEST_F(FunctionBodyDecoderTest, BlockType_fail) {
 }
 
 TEST_F(FunctionBodyDecoderTest, BlockF32) {
-  static const byte code[] = {WASM_BLOCK_F(kExprF32Const, 0, 0, 0, 0)};
+  static const uint8_t code[] = {WASM_BLOCK_F(kExprF32Const, 0, 0, 0, 0)};
   ExpectValidates(sigs.f_ff(), code);
   ExpectFailure(sigs.i_i(), code);
   ExpectFailure(sigs.d_dd(), code);
 }
 
 TEST_F(FunctionBodyDecoderTest, BlockN_off_end) {
-  byte code[] = {WASM_BLOCK(kExprNop, kExprNop, kExprNop, kExprNop)};
+  uint8_t code[] = {WASM_BLOCK(kExprNop, kExprNop, kExprNop, kExprNop)};
   ExpectValidates(sigs.v_v(), code);
   for (size_t i = 1; i < arraysize(code); i++) {
     ExpectFailure(sigs.v_v(), base::VectorOf(code, i), kAppendEnd);
@@ -810,25 +810,26 @@ TEST_F(FunctionBodyDecoderTest, If_empty4) {
 }
 
 TEST_F(FunctionBodyDecoderTest, If_empty_stack) {
-  byte code[] = {kExprIf};
+  uint8_t code[] = {kExprIf};
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
 }
 
 TEST_F(FunctionBodyDecoderTest, If_incomplete1) {
-  byte code[] = {kExprI32Const, 0, kExprIf};
+  uint8_t code[] = {kExprI32Const, 0, kExprIf};
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
 }
 
 TEST_F(FunctionBodyDecoderTest, If_incomplete2) {
-  byte code[] = {kExprI32Const, 0, kExprIf, kExprNop};
+  uint8_t code[] = {kExprI32Const, 0, kExprIf, kExprNop};
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
 }
 
 TEST_F(FunctionBodyDecoderTest, If_else_else) {
-  byte code[] = {kExprI32Const, 0, WASM_IF_OP, kExprElse, kExprElse, kExprEnd};
+  uint8_t code[] = {kExprI32Const, 0,         WASM_IF_OP,
+                    kExprElse,     kExprElse, kExprEnd};
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
 }
@@ -862,7 +863,7 @@ TEST_F(FunctionBodyDecoderTest, IfElseUnreachable1) {
 }
 
 TEST_F(FunctionBodyDecoderTest, IfElseUnreachable2) {
-  static const byte code[] = {
+  static const uint8_t code[] = {
       WASM_IF_ELSE_I(WASM_LOCAL_GET(0), WASM_UNREACHABLE, WASM_LOCAL_GET(0))};
 
   for (size_t i = 0; i < arraysize(kValueTypes); i++) {
@@ -874,7 +875,8 @@ TEST_F(FunctionBodyDecoderTest, IfElseUnreachable2) {
 }
 
 TEST_F(FunctionBodyDecoderTest, OneArmedIfWithArity) {
-  static const byte code[] = {WASM_ZERO, kExprIf, kI32Code, WASM_ONE, kExprEnd};
+  static const uint8_t code[] = {WASM_ZERO, kExprIf, kI32Code, WASM_ONE,
+                                 kExprEnd};
   ExpectFailure(sigs.i_v(), code, kAppendEnd,
                 "start-arity and end-arity of one-armed if must match");
 }
@@ -895,7 +897,7 @@ TEST_F(FunctionBodyDecoderTest, IfElseBreak) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Block_else) {
-  byte code[] = {kExprI32Const, 0, kExprBlock, kExprElse, kExprEnd};
+  uint8_t code[] = {kExprI32Const, 0, kExprBlock, kExprElse, kExprEnd};
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
 }
@@ -959,7 +961,7 @@ TEST_F(FunctionBodyDecoderTest, Loop0) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Loop1) {
-  static const byte code[] = {WASM_LOOP(WASM_LOCAL_SET(0, WASM_ZERO))};
+  static const uint8_t code[] = {WASM_LOOP(WASM_LOCAL_SET(0, WASM_ZERO))};
   ExpectValidates(sigs.v_i(), code);
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.f_ff(), code);
@@ -1035,14 +1037,14 @@ TEST_F(FunctionBodyDecoderTest, LoopType_fail) {
 }
 
 TEST_F(FunctionBodyDecoderTest, ReturnVoid1) {
-  static const byte code[] = {kExprNop};
+  static const uint8_t code[] = {kExprNop};
   ExpectValidates(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
   ExpectFailure(sigs.i_f(), code);
 }
 
 TEST_F(FunctionBodyDecoderTest, ReturnVoid2) {
-  static const byte code[] = {WASM_BLOCK(WASM_BR(0))};
+  static const uint8_t code[] = {WASM_BLOCK(WASM_BR(0))};
   ExpectValidates(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
   ExpectFailure(sigs.i_f(), code);
@@ -1110,16 +1112,17 @@ TEST_F(FunctionBodyDecoderTest, UnreachableRefTypes) {
   WASM_FEATURE_SCOPE(gc);
   WASM_FEATURE_SCOPE(return_call);
 
-  byte sig_index = builder.AddSignature(sigs.i_ii());
-  byte function_index = builder.AddFunction(sig_index);
-  byte struct_index = builder.AddStruct({F(kWasmI32, true), F(kWasmI64, true)});
-  byte array_index = builder.AddArray(kWasmI32, true);
+  uint8_t sig_index = builder.AddSignature(sigs.i_ii());
+  uint8_t function_index = builder.AddFunction(sig_index);
+  uint8_t struct_index =
+      builder.AddStruct({F(kWasmI32, true), F(kWasmI64, true)});
+  uint8_t array_index = builder.AddArray(kWasmI32, true);
 
   ValueType struct_type = ValueType::Ref(struct_index);
   ValueType struct_type_null = ValueType::RefNull(struct_index);
   FunctionSig sig_v_s(0, 1, &struct_type);
-  byte struct_consumer = builder.AddFunction(&sig_v_s);
-  byte struct_consumer2 = builder.AddFunction(
+  uint8_t struct_consumer = builder.AddFunction(&sig_v_s);
+  uint8_t struct_consumer2 = builder.AddFunction(
       FunctionSig::Build(zone(), {kWasmI32}, {struct_type, struct_type}));
 
   ExpectValidates(sigs.i_v(), {WASM_UNREACHABLE, kExprRefIsNull});
@@ -1128,7 +1131,7 @@ TEST_F(FunctionBodyDecoderTest, UnreachableRefTypes) {
   ExpectValidates(sigs.i_v(), {WASM_UNREACHABLE, kExprCallRef, sig_index});
   ExpectValidates(sigs.i_v(), {WASM_UNREACHABLE, WASM_REF_FUNC(function_index),
                                kExprCallRef, sig_index});
-  ExpectValidates(sigs.v_v(),
+  ExpectValidates(sigs.i_v(),
                   {WASM_UNREACHABLE, kExprReturnCallRef, sig_index});
 
   ExpectValidates(sigs.v_v(),
@@ -1212,7 +1215,7 @@ TEST_F(FunctionBodyDecoderTest, If1) {
 }
 
 TEST_F(FunctionBodyDecoderTest, If_off_end) {
-  static const byte kCode[] = {
+  static const uint8_t kCode[] = {
       WASM_IF_ELSE(WASM_LOCAL_GET(0), WASM_LOCAL_GET(0), WASM_LOCAL_GET(0))};
   for (size_t len = 3; len < arraysize(kCode); len++) {
     ExpectFailure(sigs.i_i(), base::VectorOf(kCode, len), kAppendEnd);
@@ -1222,7 +1225,7 @@ TEST_F(FunctionBodyDecoderTest, If_off_end) {
 
 TEST_F(FunctionBodyDecoderTest, If_type1) {
   // float|double ? 1 : 2
-  static const byte kCode[] = {
+  static const uint8_t kCode[] = {
       WASM_IF_ELSE_I(WASM_LOCAL_GET(0), WASM_I32V_1(0), WASM_I32V_1(2))};
   ExpectValidates(sigs.i_i(), kCode);
   ExpectFailure(sigs.i_f(), kCode);
@@ -1231,7 +1234,7 @@ TEST_F(FunctionBodyDecoderTest, If_type1) {
 
 TEST_F(FunctionBodyDecoderTest, If_type2) {
   // 1 ? float|double : 2
-  static const byte kCode[] = {
+  static const uint8_t kCode[] = {
       WASM_IF_ELSE_I(WASM_I32V_1(1), WASM_LOCAL_GET(0), WASM_I32V_1(1))};
   ExpectValidates(sigs.i_i(), kCode);
   ExpectFailure(sigs.i_f(), kCode);
@@ -1240,7 +1243,7 @@ TEST_F(FunctionBodyDecoderTest, If_type2) {
 
 TEST_F(FunctionBodyDecoderTest, If_type3) {
   // stmt ? 0 : 1
-  static const byte kCode[] = {
+  static const uint8_t kCode[] = {
       WASM_IF_ELSE_I(WASM_NOP, WASM_I32V_1(0), WASM_I32V_1(1))};
   ExpectFailure(sigs.i_i(), kCode);
   ExpectFailure(sigs.i_f(), kCode);
@@ -1249,7 +1252,7 @@ TEST_F(FunctionBodyDecoderTest, If_type3) {
 
 TEST_F(FunctionBodyDecoderTest, If_type4) {
   // 0 ? stmt : 1
-  static const byte kCode[] = {
+  static const uint8_t kCode[] = {
       WASM_IF_ELSE_I(WASM_LOCAL_GET(0), WASM_NOP, WASM_I32V_1(1))};
   ExpectFailure(sigs.i_i(), kCode);
   ExpectFailure(sigs.i_f(), kCode);
@@ -1258,7 +1261,7 @@ TEST_F(FunctionBodyDecoderTest, If_type4) {
 
 TEST_F(FunctionBodyDecoderTest, If_type5) {
   // 0 ? 1 : stmt
-  static const byte kCode[] = {
+  static const uint8_t kCode[] = {
       WASM_IF_ELSE_I(WASM_ZERO, WASM_I32V_1(1), WASM_NOP)};
   ExpectFailure(sigs.i_i(), kCode);
   ExpectFailure(sigs.i_f(), kCode);
@@ -1270,9 +1273,9 @@ TEST_F(FunctionBodyDecoderTest, Int64Local_param) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Int64Locals) {
-  for (byte i = 1; i < 8; i++) {
+  for (uint8_t i = 1; i < 8; i++) {
     AddLocals(kWasmI64, 1);
-    for (byte j = 0; j < i; j++) {
+    for (uint8_t j = 0; j < i; j++) {
       ExpectValidates(sigs.l_v(), {WASM_LOCAL_GET(j)});
     }
   }
@@ -1525,7 +1528,7 @@ TEST_F(FunctionBodyDecoderTest, AllSimpleExpressions) {
 
 TEST_F(FunctionBodyDecoderTest, MemorySize) {
   builder.InitializeMemory();
-  byte code[] = {kExprMemorySize, 0};
+  uint8_t code[] = {kExprMemorySize, 0};
   ExpectValidates(sigs.i_i(), code);
   ExpectFailure(sigs.f_ff(), code);
 }
@@ -1533,8 +1536,8 @@ TEST_F(FunctionBodyDecoderTest, MemorySize) {
 TEST_F(FunctionBodyDecoderTest, LoadMemOffset) {
   builder.InitializeMemory();
   for (int offset = 0; offset < 128; offset += 7) {
-    byte code[] = {kExprI32Const, 0, kExprI32LoadMem, ZERO_ALIGNMENT,
-                   static_cast<byte>(offset)};
+    uint8_t code[] = {kExprI32Const, 0, kExprI32LoadMem, ZERO_ALIGNMENT,
+                      static_cast<uint8_t>(offset)};
     ExpectValidates(sigs.i_i(), code);
   }
 }
@@ -1562,9 +1565,9 @@ TEST_F(FunctionBodyDecoderTest, LoadMemAlignment) {
   };
 
   for (size_t i = 0; i < arraysize(values); i++) {
-    for (byte alignment = 0; alignment <= 4; alignment++) {
-      byte code[] = {WASM_ZERO, static_cast<byte>(values[i].instruction),
-                     alignment, ZERO_OFFSET, WASM_DROP};
+    for (uint8_t alignment = 0; alignment <= 4; alignment++) {
+      uint8_t code[] = {WASM_ZERO, static_cast<uint8_t>(values[i].instruction),
+                        alignment, ZERO_OFFSET, WASM_DROP};
       Validate(alignment <= values[i].maximum_aligment, sigs.v_i(), code);
     }
   }
@@ -1572,9 +1575,9 @@ TEST_F(FunctionBodyDecoderTest, LoadMemAlignment) {
 
 TEST_F(FunctionBodyDecoderTest, StoreMemOffset) {
   builder.InitializeMemory();
-  for (byte offset = 0; offset < 128; offset += 7) {
-    byte code[] = {WASM_STORE_MEM_OFFSET(MachineType::Int32(), offset,
-                                         WASM_ZERO, WASM_ZERO)};
+  for (uint8_t offset = 0; offset < 128; offset += 7) {
+    uint8_t code[] = {WASM_STORE_MEM_OFFSET(MachineType::Int32(), offset,
+                                            WASM_ZERO, WASM_ZERO)};
     ExpectValidates(sigs.v_i(), code);
   }
 }
@@ -1615,7 +1618,7 @@ TEST_F(FunctionBodyDecoderTest, AllLoadMemCombinations) {
     ValueType local_type = kValueTypes[i];
     for (size_t j = 0; j < arraysize(machineTypes); j++) {
       MachineType mem_type = machineTypes[j];
-      byte code[] = {WASM_LOAD_MEM(mem_type, WASM_ZERO)};
+      uint8_t code[] = {WASM_LOAD_MEM(mem_type, WASM_ZERO)};
       FunctionSig sig(1, 0, &local_type);
       Validate(local_type == ValueType::For(mem_type), &sig, code);
     }
@@ -1628,7 +1631,7 @@ TEST_F(FunctionBodyDecoderTest, AllStoreMemCombinations) {
     ValueType local_type = kValueTypes[i];
     for (size_t j = 0; j < arraysize(machineTypes); j++) {
       MachineType mem_type = machineTypes[j];
-      byte code[] = {WASM_STORE_MEM(mem_type, WASM_ZERO, WASM_LOCAL_GET(0))};
+      uint8_t code[] = {WASM_STORE_MEM(mem_type, WASM_ZERO, WASM_LOCAL_GET(0))};
       FunctionSig sig(0, 1, &local_type);
       Validate(local_type == ValueType::For(mem_type), &sig, code);
     }
@@ -1748,9 +1751,9 @@ TEST_F(FunctionBodyDecoderTest, SimpleIndirectReturnCalls) {
   const FunctionSig* sig = sigs.i_i();
   builder.AddTable(kWasmFuncRef, 20, true, 30);
 
-  byte sig0 = builder.AddSignature(sigs.i_v());
-  byte sig1 = builder.AddSignature(sigs.i_i());
-  byte sig2 = builder.AddSignature(sigs.i_ii());
+  uint8_t sig0 = builder.AddSignature(sigs.i_v());
+  uint8_t sig1 = builder.AddSignature(sigs.i_i());
+  uint8_t sig2 = builder.AddSignature(sigs.i_ii());
 
   ExpectValidates(sig, {WASM_RETURN_CALL_INDIRECT(sig0, WASM_ZERO)});
   ExpectValidates(
@@ -1785,7 +1788,7 @@ TEST_F(FunctionBodyDecoderTest, IndirectReturnCallsWithMismatchedSigs3) {
   const FunctionSig* sig = sigs.i_i();
   builder.InitializeTable(wasm::kWasmVoid);
 
-  byte sig0 = builder.AddSignature(sigs.i_f());
+  uint8_t sig0 = builder.AddSignature(sigs.i_f());
 
   ExpectFailure(sig,
                 {WASM_RETURN_CALL_INDIRECT(sig0, WASM_I32V_1(17), WASM_ZERO)});
@@ -1798,7 +1801,7 @@ TEST_F(FunctionBodyDecoderTest, IndirectReturnCallsWithMismatchedSigs3) {
   ExpectFailure(sig, {WASM_RETURN_CALL_INDIRECT(sig0, WASM_I64V_1(27))});
   ExpectFailure(sig, {WASM_RETURN_CALL_INDIRECT(sig0, WASM_F64(37.2))});
 
-  byte sig1 = builder.AddFunction(sigs.i_d());
+  uint8_t sig1 = builder.AddFunction(sigs.i_d());
 
   ExpectFailure(sig,
                 {WASM_RETURN_CALL_INDIRECT(sig1, WASM_I32V_1(16), WASM_ZERO)});
@@ -1813,9 +1816,9 @@ TEST_F(FunctionBodyDecoderTest, IndirectReturnCallsWithoutTableCrash) {
 
   const FunctionSig* sig = sigs.i_i();
 
-  byte sig0 = builder.AddSignature(sigs.i_v());
-  byte sig1 = builder.AddSignature(sigs.i_i());
-  byte sig2 = builder.AddSignature(sigs.i_ii());
+  uint8_t sig0 = builder.AddSignature(sigs.i_v());
+  uint8_t sig1 = builder.AddSignature(sigs.i_i());
+  uint8_t sig2 = builder.AddSignature(sigs.i_ii());
 
   ExpectFailure(sig, {WASM_RETURN_CALL_INDIRECT(sig0, WASM_ZERO)});
   ExpectFailure(sig,
@@ -1828,7 +1831,7 @@ TEST_F(FunctionBodyDecoderTest, IncompleteIndirectReturnCall) {
   const FunctionSig* sig = sigs.i_i();
   builder.InitializeTable(wasm::kWasmVoid);
 
-  static byte code[] = {kExprReturnCallIndirect};
+  static uint8_t code[] = {kExprReturnCallIndirect};
   ExpectFailure(sig, base::ArrayVector(code), kOmitEnd);
 }
 
@@ -1877,9 +1880,9 @@ TEST_F(FunctionBodyDecoderTest, SimpleIndirectCalls) {
   const FunctionSig* sig = sigs.i_i();
   builder.AddTable(kWasmFuncRef, 20, false, 20);
 
-  byte sig0 = builder.AddSignature(sigs.i_v());
-  byte sig1 = builder.AddSignature(sigs.i_i());
-  byte sig2 = builder.AddSignature(sigs.i_ii());
+  uint8_t sig0 = builder.AddSignature(sigs.i_v());
+  uint8_t sig1 = builder.AddSignature(sigs.i_i());
+  uint8_t sig2 = builder.AddSignature(sigs.i_ii());
 
   ExpectValidates(sig, {WASM_CALL_INDIRECT(sig0, WASM_ZERO)});
   ExpectValidates(sig, {WASM_CALL_INDIRECT(sig1, WASM_I32V_1(22), WASM_ZERO)});
@@ -1906,7 +1909,7 @@ TEST_F(FunctionBodyDecoderTest, IndirectCallsWithMismatchedSigs1) {
   const FunctionSig* sig = sigs.i_i();
   builder.InitializeTable(wasm::kWasmVoid);
 
-  byte sig0 = builder.AddSignature(sigs.i_f());
+  uint8_t sig0 = builder.AddSignature(sigs.i_f());
 
   ExpectFailure(sig, {WASM_CALL_INDIRECT(sig0, WASM_I32V_1(17), WASM_ZERO)});
   ExpectFailure(sig, {WASM_CALL_INDIRECT(sig0, WASM_I64V_1(27), WASM_ZERO)});
@@ -1916,7 +1919,7 @@ TEST_F(FunctionBodyDecoderTest, IndirectCallsWithMismatchedSigs1) {
   ExpectFailure(sig, {WASM_CALL_INDIRECT(sig0, WASM_I64V_1(27))});
   ExpectFailure(sig, {WASM_CALL_INDIRECT(sig0, WASM_F64(37.2))});
 
-  byte sig1 = builder.AddFunction(sigs.i_d());
+  uint8_t sig1 = builder.AddFunction(sigs.i_d());
 
   ExpectFailure(sig, {WASM_CALL_INDIRECT(sig1, WASM_I32V_1(16), WASM_ZERO)});
   ExpectFailure(sig, {WASM_CALL_INDIRECT(sig1, WASM_I64V_1(16), WASM_ZERO)});
@@ -1925,15 +1928,15 @@ TEST_F(FunctionBodyDecoderTest, IndirectCallsWithMismatchedSigs1) {
 
 TEST_F(FunctionBodyDecoderTest, IndirectCallsWithMismatchedSigs2) {
   WASM_FEATURE_SCOPE(typed_funcref);
-  byte table_type_index = builder.AddSignature(sigs.i_i());
-  byte table_index =
+  uint8_t table_type_index = builder.AddSignature(sigs.i_i());
+  uint8_t table_index =
       builder.InitializeTable(ValueType::RefNull(table_type_index));
 
   ExpectValidates(sigs.i_v(),
                   {WASM_CALL_INDIRECT_TABLE(table_index, table_type_index,
                                             WASM_I32V_1(42), WASM_ZERO)});
 
-  byte wrong_type_index = builder.AddSignature(sigs.i_ii());
+  uint8_t wrong_type_index = builder.AddSignature(sigs.i_ii());
   ExpectFailure(sigs.i_v(),
                 {WASM_CALL_INDIRECT_TABLE(table_index, wrong_type_index,
                                           WASM_I32V_1(42), WASM_ZERO)},
@@ -1941,7 +1944,7 @@ TEST_F(FunctionBodyDecoderTest, IndirectCallsWithMismatchedSigs2) {
                 "call_indirect: Immediate signature #1 is not a subtype of "
                 "immediate table #0");
 
-  byte non_function_table_index = builder.InitializeTable(kWasmExternRef);
+  uint8_t non_function_table_index = builder.InitializeTable(kWasmExternRef);
   ExpectFailure(
       sigs.i_v(),
       {WASM_CALL_INDIRECT_TABLE(non_function_table_index, table_type_index,
@@ -1955,26 +1958,26 @@ TEST_F(FunctionBodyDecoderTest, TablesWithFunctionSubtyping) {
   WASM_FEATURE_SCOPE(gc);
   EXPERIMENTAL_FLAG_SCOPE(gc);
 
-  byte empty_struct = builder.AddStruct({});
-  byte super_struct = builder.AddStruct({F(kWasmI32, true)}, empty_struct);
-  byte sub_struct =
+  uint8_t empty_struct = builder.AddStruct({});
+  uint8_t super_struct = builder.AddStruct({F(kWasmI32, true)}, empty_struct);
+  uint8_t sub_struct =
       builder.AddStruct({F(kWasmI32, true), F(kWasmF64, true)}, super_struct);
 
-  byte table_supertype = builder.AddSignature(
+  uint8_t table_supertype = builder.AddSignature(
       FunctionSig::Build(zone(), {ValueType::RefNull(empty_struct)},
                          {ValueType::RefNull(sub_struct)}));
-  byte table_type = builder.AddSignature(
+  uint8_t table_type = builder.AddSignature(
       FunctionSig::Build(zone(), {ValueType::RefNull(super_struct)},
                          {ValueType::RefNull(sub_struct)}),
       table_supertype);
   auto function_sig =
       FunctionSig::Build(zone(), {ValueType::RefNull(sub_struct)},
                          {ValueType::RefNull(super_struct)});
-  byte function_type = builder.AddSignature(function_sig, table_type);
+  uint8_t function_type = builder.AddSignature(function_sig, table_type);
 
-  byte function = builder.AddFunction(function_type);
+  uint8_t function = builder.AddFunction(function_type);
 
-  byte table = builder.InitializeTable(ValueType::RefNull(table_type));
+  uint8_t table = builder.InitializeTable(ValueType::RefNull(table_type));
 
   // We can call-indirect from a typed function table with an immediate type
   // that is a subtype of the table type.
@@ -1997,9 +2000,9 @@ TEST_F(FunctionBodyDecoderTest, TablesWithFunctionSubtyping) {
 TEST_F(FunctionBodyDecoderTest, IndirectCallsWithoutTableCrash) {
   const FunctionSig* sig = sigs.i_i();
 
-  byte sig0 = builder.AddSignature(sigs.i_v());
-  byte sig1 = builder.AddSignature(sigs.i_i());
-  byte sig2 = builder.AddSignature(sigs.i_ii());
+  uint8_t sig0 = builder.AddSignature(sigs.i_v());
+  uint8_t sig1 = builder.AddSignature(sigs.i_i());
+  uint8_t sig2 = builder.AddSignature(sigs.i_ii());
 
   ExpectFailure(sig, {WASM_CALL_INDIRECT(sig0, WASM_ZERO)});
   ExpectFailure(sig, {WASM_CALL_INDIRECT(sig1, WASM_I32V_1(22), WASM_ZERO)});
@@ -2011,7 +2014,7 @@ TEST_F(FunctionBodyDecoderTest, IncompleteIndirectCall) {
   const FunctionSig* sig = sigs.i_i();
   builder.InitializeTable(wasm::kWasmVoid);
 
-  static byte code[] = {kExprCallIndirect};
+  static uint8_t code[] = {kExprCallIndirect};
   ExpectFailure(sig, base::ArrayVector(code), kOmitEnd);
 }
 
@@ -2020,7 +2023,7 @@ TEST_F(FunctionBodyDecoderTest, IncompleteStore) {
   builder.InitializeMemory();
   builder.InitializeTable(wasm::kWasmVoid);
 
-  static byte code[] = {kExprI32StoreMem};
+  static uint8_t code[] = {kExprI32StoreMem};
   ExpectFailure(sig, base::ArrayVector(code), kOmitEnd);
 }
 
@@ -2030,17 +2033,17 @@ TEST_F(FunctionBodyDecoderTest, IncompleteI8x16Shuffle) {
   builder.InitializeMemory();
   builder.InitializeTable(wasm::kWasmVoid);
 
-  static byte code[] = {kSimdPrefix,
-                        static_cast<byte>(kExprI8x16Shuffle & 0xff)};
+  static uint8_t code[] = {kSimdPrefix,
+                           static_cast<uint8_t>(kExprI8x16Shuffle & 0xff)};
   ExpectFailure(sig, base::ArrayVector(code), kOmitEnd);
 }
 
 TEST_F(FunctionBodyDecoderTest, SimpleImportCalls) {
   const FunctionSig* sig = sigs.i_i();
 
-  byte f0 = builder.AddImport(sigs.i_v());
-  byte f1 = builder.AddImport(sigs.i_i());
-  byte f2 = builder.AddImport(sigs.i_ii());
+  uint8_t f0 = builder.AddImport(sigs.i_v());
+  uint8_t f1 = builder.AddImport(sigs.i_i());
+  uint8_t f2 = builder.AddImport(sigs.i_ii());
 
   ExpectValidates(sig, {WASM_CALL_FUNCTION0(f0)});
   ExpectValidates(sig, {WASM_CALL_FUNCTION(f1, WASM_I32V_1(22))});
@@ -2051,14 +2054,14 @@ TEST_F(FunctionBodyDecoderTest, SimpleImportCalls) {
 TEST_F(FunctionBodyDecoderTest, ImportCallsWithMismatchedSigs3) {
   const FunctionSig* sig = sigs.i_i();
 
-  byte f0 = builder.AddImport(sigs.i_f());
+  uint8_t f0 = builder.AddImport(sigs.i_f());
 
   ExpectFailure(sig, {WASM_CALL_FUNCTION0(f0)});
   ExpectFailure(sig, {WASM_CALL_FUNCTION(f0, WASM_I32V_1(17))});
   ExpectFailure(sig, {WASM_CALL_FUNCTION(f0, WASM_I64V_1(27))});
   ExpectFailure(sig, {WASM_CALL_FUNCTION(f0, WASM_F64(37.2))});
 
-  byte f1 = builder.AddImport(sigs.i_d());
+  uint8_t f1 = builder.AddImport(sigs.i_d());
 
   ExpectFailure(sig, {WASM_CALL_FUNCTION0(f1)});
   ExpectFailure(sig, {WASM_CALL_FUNCTION(f1, WASM_I32V_1(16))});
@@ -2211,21 +2214,21 @@ TEST_F(FunctionBodyDecoderTest, AllSetGlobalCombinations) {
 TEST_F(FunctionBodyDecoderTest, TableSet) {
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  byte tab_type = builder.AddSignature(sigs.i_i());
-  byte tab_ref1 = builder.AddTable(kWasmExternRef, 10, true, 20);
-  byte tab_func1 = builder.AddTable(kWasmFuncRef, 20, true, 30);
-  byte tab_func2 = builder.AddTable(kWasmFuncRef, 10, false, 20);
-  byte tab_ref2 = builder.AddTable(kWasmExternRef, 10, false, 20);
-  byte tab_typed_func =
+  uint8_t tab_type = builder.AddSignature(sigs.i_i());
+  uint8_t tab_ref1 = builder.AddTable(kWasmExternRef, 10, true, 20);
+  uint8_t tab_func1 = builder.AddTable(kWasmFuncRef, 20, true, 30);
+  uint8_t tab_func2 = builder.AddTable(kWasmFuncRef, 10, false, 20);
+  uint8_t tab_ref2 = builder.AddTable(kWasmExternRef, 10, false, 20);
+  uint8_t tab_typed_func =
       builder.AddTable(ValueType::RefNull(tab_type), 10, false, 20);
 
   ValueType sig_types[]{kWasmExternRef, kWasmFuncRef, kWasmI32,
                         ValueType::Ref(tab_type)};
   FunctionSig sig(0, 4, sig_types);
-  byte local_ref = 0;
-  byte local_func = 1;
-  byte local_int = 2;
-  byte local_typed_func = 3;
+  uint8_t local_ref = 0;
+  uint8_t local_func = 1;
+  uint8_t local_int = 2;
+  uint8_t local_typed_func = 3;
 
   ExpectValidates(&sig, {WASM_TABLE_SET(tab_ref1, WASM_I32V(6),
                                         WASM_LOCAL_GET(local_ref))});
@@ -2257,7 +2260,7 @@ TEST_F(FunctionBodyDecoderTest, TableSet) {
                                       WASM_LOCAL_GET(local_func))});
 
   // Out-of-bounds table index should fail.
-  byte oob_tab = 37;
+  uint8_t oob_tab = 37;
   ExpectFailure(
       &sig, {WASM_TABLE_SET(oob_tab, WASM_I32V(9), WASM_LOCAL_GET(local_ref))});
   ExpectFailure(&sig, {WASM_TABLE_SET(oob_tab, WASM_I32V(3),
@@ -2267,21 +2270,21 @@ TEST_F(FunctionBodyDecoderTest, TableSet) {
 TEST_F(FunctionBodyDecoderTest, TableGet) {
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  byte tab_type = builder.AddSignature(sigs.i_i());
-  byte tab_ref1 = builder.AddTable(kWasmExternRef, 10, true, 20);
-  byte tab_func1 = builder.AddTable(kWasmFuncRef, 20, true, 30);
-  byte tab_func2 = builder.AddTable(kWasmFuncRef, 10, false, 20);
-  byte tab_ref2 = builder.AddTable(kWasmExternRef, 10, false, 20);
-  byte tab_typed_func =
+  uint8_t tab_type = builder.AddSignature(sigs.i_i());
+  uint8_t tab_ref1 = builder.AddTable(kWasmExternRef, 10, true, 20);
+  uint8_t tab_func1 = builder.AddTable(kWasmFuncRef, 20, true, 30);
+  uint8_t tab_func2 = builder.AddTable(kWasmFuncRef, 10, false, 20);
+  uint8_t tab_ref2 = builder.AddTable(kWasmExternRef, 10, false, 20);
+  uint8_t tab_typed_func =
       builder.AddTable(ValueType::RefNull(tab_type), 10, false, 20);
 
   ValueType sig_types[]{kWasmExternRef, kWasmFuncRef, kWasmI32,
                         ValueType::RefNull(tab_type)};
   FunctionSig sig(0, 4, sig_types);
-  byte local_ref = 0;
-  byte local_func = 1;
-  byte local_int = 2;
-  byte local_typed_func = 3;
+  uint8_t local_ref = 0;
+  uint8_t local_func = 1;
+  uint8_t local_int = 2;
+  uint8_t local_typed_func = 3;
 
   ExpectValidates(
       &sig,
@@ -2324,7 +2327,7 @@ TEST_F(FunctionBodyDecoderTest, TableGet) {
                                 WASM_TABLE_GET(tab_func1, WASM_I32V(3)))});
 
   // Out-of-bounds table index should fail.
-  byte oob_tab = 37;
+  uint8_t oob_tab = 37;
   ExpectFailure(
       &sig, {WASM_LOCAL_SET(local_ref, WASM_TABLE_GET(oob_tab, WASM_I32V(9)))});
   ExpectFailure(&sig, {WASM_LOCAL_SET(local_func,
@@ -2332,12 +2335,12 @@ TEST_F(FunctionBodyDecoderTest, TableGet) {
 }
 
 TEST_F(FunctionBodyDecoderTest, MultiTableCallIndirect) {
-  byte tab_ref = builder.AddTable(kWasmExternRef, 10, true, 20);
-  byte tab_func = builder.AddTable(kWasmFuncRef, 20, true, 30);
+  uint8_t tab_ref = builder.AddTable(kWasmExternRef, 10, true, 20);
+  uint8_t tab_func = builder.AddTable(kWasmFuncRef, 20, true, 30);
 
   ValueType sig_types[]{kWasmExternRef, kWasmFuncRef, kWasmI32};
   FunctionSig sig(0, 3, sig_types);
-  byte sig_index = builder.AddSignature(sigs.i_v());
+  uint8_t sig_index = builder.AddSignature(sigs.i_v());
 
   // We can store funcref values as externref, but not the other way around.
   ExpectValidates(sigs.i_v(),
@@ -2350,7 +2353,7 @@ TEST_F(FunctionBodyDecoderTest, MultiTableCallIndirect) {
 TEST_F(FunctionBodyDecoderTest, WasmMemoryGrow) {
   builder.InitializeMemory();
 
-  byte code[] = {WASM_LOCAL_GET(0), kExprMemoryGrow, 0};
+  uint8_t code[] = {WASM_LOCAL_GET(0), kExprMemoryGrow, 0};
   ExpectValidates(sigs.i_i(), code);
   ExpectFailure(sigs.i_d(), code);
 }
@@ -2396,7 +2399,7 @@ TEST_F(FunctionBodyDecoderTest, BreakIfUnrNarrow) {
 TEST_F(FunctionBodyDecoderTest, BreakNesting1) {
   for (int i = 0; i < 5; i++) {
     // (block[2] (loop[2] (if (get p) break[N]) (set p 1)) p)
-    byte code[] = {WASM_BLOCK_I(
+    uint8_t code[] = {WASM_BLOCK_I(
         WASM_LOOP(WASM_IF(WASM_LOCAL_GET(0), WASM_BRV(i + 1, WASM_ZERO)),
                   WASM_LOCAL_SET(0, WASM_I32V_1(1))),
         WASM_ZERO)};
@@ -2406,7 +2409,7 @@ TEST_F(FunctionBodyDecoderTest, BreakNesting1) {
 
 TEST_F(FunctionBodyDecoderTest, BreakNesting2) {
   for (int i = 0; i < 7; i++) {
-    byte code[] = {B1(WASM_LOOP(WASM_IF(WASM_ZERO, WASM_BR(i)), WASM_NOP))};
+    uint8_t code[] = {B1(WASM_LOOP(WASM_IF(WASM_ZERO, WASM_BR(i)), WASM_NOP))};
     Validate(i <= 3, sigs.v_v(), code);
   }
 }
@@ -2414,7 +2417,7 @@ TEST_F(FunctionBodyDecoderTest, BreakNesting2) {
 TEST_F(FunctionBodyDecoderTest, BreakNesting3) {
   for (int i = 0; i < 7; i++) {
     // (block[1] (loop[1] (block[1] (if 0 break[N])
-    byte code[] = {
+    uint8_t code[] = {
         WASM_BLOCK(WASM_LOOP(B1(WASM_IF(WASM_ZERO, WASM_BR(i + 1)))))};
     Validate(i < 4, sigs.v_v(), code);
   }
@@ -2437,7 +2440,7 @@ TEST_F(FunctionBodyDecoderTest, BreaksWithMultipleTypes) {
 TEST_F(FunctionBodyDecoderTest, BreakNesting_6_levels) {
   for (int mask = 0; mask < 64; mask++) {
     for (int i = 0; i < 14; i++) {
-      byte code[] = {WASM_BLOCK(WASM_BLOCK(
+      uint8_t code[] = {WASM_BLOCK(WASM_BLOCK(
           WASM_BLOCK(WASM_BLOCK(WASM_BLOCK(WASM_BLOCK(WASM_BR(i)))))))};
 
       int depth = 6;
@@ -2460,7 +2463,7 @@ TEST_F(FunctionBodyDecoderTest, Break_TypeCheck) {
   for (const FunctionSig* sig :
        {sigs.i_i(), sigs.l_l(), sigs.f_ff(), sigs.d_dd()}) {
     // unify X and X => OK
-    byte code[] = {WASM_BLOCK_T(
+    uint8_t code[] = {WASM_BLOCK_T(
         sig->GetReturn(), WASM_IF(WASM_ZERO, WASM_BRV(0, WASM_LOCAL_GET(0))),
         WASM_LOCAL_GET(0))};
     ExpectValidates(sig, code);
@@ -2483,7 +2486,7 @@ TEST_F(FunctionBodyDecoderTest, Break_TypeCheckAll1) {
     for (size_t j = 0; j < arraysize(kValueTypes); j++) {
       ValueType storage[] = {kValueTypes[i], kValueTypes[i], kValueTypes[j]};
       FunctionSig sig(1, 2, storage);
-      byte code[] = {WASM_BLOCK_T(
+      uint8_t code[] = {WASM_BLOCK_T(
           sig.GetReturn(), WASM_IF(WASM_ZERO, WASM_BRV(0, WASM_LOCAL_GET(0))),
           WASM_LOCAL_GET(1))};
 
@@ -2497,9 +2500,9 @@ TEST_F(FunctionBodyDecoderTest, Break_TypeCheckAll2) {
     for (size_t j = 0; j < arraysize(kValueTypes); j++) {
       ValueType storage[] = {kValueTypes[i], kValueTypes[i], kValueTypes[j]};
       FunctionSig sig(1, 2, storage);
-      byte code[] = {WASM_IF_ELSE_T(sig.GetReturn(0), WASM_ZERO,
-                                    WASM_BRV_IF_ZERO(0, WASM_LOCAL_GET(0)),
-                                    WASM_LOCAL_GET(1))};
+      uint8_t code[] = {WASM_IF_ELSE_T(sig.GetReturn(0), WASM_ZERO,
+                                       WASM_BRV_IF_ZERO(0, WASM_LOCAL_GET(0)),
+                                       WASM_LOCAL_GET(1))};
 
       Validate(IsSubtypeOf(kValueTypes[j], kValueTypes[i], module), &sig, code);
     }
@@ -2511,9 +2514,9 @@ TEST_F(FunctionBodyDecoderTest, Break_TypeCheckAll3) {
     for (size_t j = 0; j < arraysize(kValueTypes); j++) {
       ValueType storage[] = {kValueTypes[i], kValueTypes[i], kValueTypes[j]};
       FunctionSig sig(1, 2, storage);
-      byte code[] = {WASM_IF_ELSE_T(sig.GetReturn(), WASM_ZERO,
-                                    WASM_LOCAL_GET(1),
-                                    WASM_BRV_IF_ZERO(0, WASM_LOCAL_GET(0)))};
+      uint8_t code[] = {WASM_IF_ELSE_T(sig.GetReturn(), WASM_ZERO,
+                                       WASM_LOCAL_GET(1),
+                                       WASM_BRV_IF_ZERO(0, WASM_LOCAL_GET(0)))};
 
       Validate(IsSubtypeOf(kValueTypes[j], kValueTypes[i], module), &sig, code);
     }
@@ -2527,7 +2530,7 @@ TEST_F(FunctionBodyDecoderTest, Break_Unify) {
       ValueType storage[] = {kWasmI32, kWasmI32, type};
       FunctionSig sig(1, 2, storage);
 
-      byte code1[] = {WASM_BLOCK_T(
+      uint8_t code1[] = {WASM_BLOCK_T(
           type, WASM_IF(WASM_ZERO, WASM_BRV(1, WASM_LOCAL_GET(which))),
           WASM_LOCAL_GET(which ^ 1))};
 
@@ -2541,7 +2544,7 @@ TEST_F(FunctionBodyDecoderTest, BreakIf_cond_type) {
     for (size_t j = 0; j < arraysize(kValueTypes); j++) {
       ValueType types[] = {kValueTypes[i], kValueTypes[i], kValueTypes[j]};
       FunctionSig sig(1, 2, types);
-      byte code[] = {WASM_BLOCK_T(
+      uint8_t code[] = {WASM_BLOCK_T(
           types[0], WASM_BRV_IF(0, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)))};
 
       Validate(types[2] == kWasmI32, &sig, code);
@@ -2555,7 +2558,7 @@ TEST_F(FunctionBodyDecoderTest, BreakIf_val_type) {
       ValueType types[] = {kValueTypes[i], kValueTypes[i], kValueTypes[j],
                            kWasmI32};
       FunctionSig sig(1, 3, types);
-      byte code[] = {WASM_BLOCK_T(
+      uint8_t code[] = {WASM_BLOCK_T(
           types[1], WASM_BRV_IF(0, WASM_LOCAL_GET(1), WASM_LOCAL_GET(2)),
           WASM_DROP, WASM_LOCAL_GET(0))};
 
@@ -2570,8 +2573,8 @@ TEST_F(FunctionBodyDecoderTest, BreakIf_Unify) {
       ValueType type = kValueTypes[i];
       ValueType storage[] = {kWasmI32, kWasmI32, type};
       FunctionSig sig(1, 2, storage);
-      byte code[] = {WASM_BLOCK_I(WASM_BRV_IF_ZERO(0, WASM_LOCAL_GET(which)),
-                                  WASM_DROP, WASM_LOCAL_GET(which ^ 1))};
+      uint8_t code[] = {WASM_BLOCK_I(WASM_BRV_IF_ZERO(0, WASM_LOCAL_GET(which)),
+                                     WASM_DROP, WASM_LOCAL_GET(which ^ 1))};
 
       Validate(type == kWasmI32, &sig, code);
     }
@@ -2583,13 +2586,13 @@ TEST_F(FunctionBodyDecoderTest, BrTable0) {
 }
 
 TEST_F(FunctionBodyDecoderTest, BrTable0b) {
-  static byte code[] = {kExprI32Const, 11, kExprBrTable, 0, BR_TARGET(0)};
+  static uint8_t code[] = {kExprI32Const, 11, kExprBrTable, 0, BR_TARGET(0)};
   ExpectValidates(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
 }
 
 TEST_F(FunctionBodyDecoderTest, BrTable0c) {
-  static byte code[] = {kExprI32Const, 11, kExprBrTable, 0, BR_TARGET(1)};
+  static uint8_t code[] = {kExprI32Const, 11, kExprBrTable, 0, BR_TARGET(1)};
   ExpectFailure(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
 }
@@ -2600,7 +2603,7 @@ TEST_F(FunctionBodyDecoderTest, BrTable1a) {
 }
 
 TEST_F(FunctionBodyDecoderTest, BrTable1b) {
-  static byte code[] = {B1(WASM_BR_TABLE(WASM_ZERO, 0, BR_TARGET(0)))};
+  static uint8_t code[] = {B1(WASM_BR_TABLE(WASM_ZERO, 0, BR_TARGET(0)))};
   ExpectValidates(sigs.v_v(), code);
   ExpectFailure(sigs.i_i(), code);
   ExpectFailure(sigs.f_ff(), code);
@@ -2623,10 +2626,10 @@ TEST_F(FunctionBodyDecoderTest, BrTableSubtyping) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte supertype1 = builder.AddStruct({F(kWasmI8, true)});
-  byte supertype2 =
+  uint8_t supertype1 = builder.AddStruct({F(kWasmI8, true)});
+  uint8_t supertype2 =
       builder.AddStruct({F(kWasmI8, true), F(kWasmI16, false)}, supertype1);
-  byte subtype = builder.AddStruct(
+  uint8_t subtype = builder.AddStruct(
       {F(kWasmI8, true), F(kWasmI16, false), F(kWasmI32, true)}, supertype2);
   ExpectValidates(
       sigs.v_v(),
@@ -2641,7 +2644,8 @@ TEST_F(FunctionBodyDecoderTest, BrTableSubtyping) {
 }
 
 TEST_F(FunctionBodyDecoderTest, BrTable_off_end) {
-  static byte code[] = {B1(WASM_BR_TABLE(WASM_LOCAL_GET(0), 0, BR_TARGET(0)))};
+  static uint8_t code[] = {
+      B1(WASM_BR_TABLE(WASM_LOCAL_GET(0), 0, BR_TARGET(0)))};
   for (size_t len = 1; len < sizeof(code); len++) {
     ExpectFailure(sigs.i_i(), base::VectorOf(code, len), kAppendEnd);
     ExpectFailure(sigs.i_i(), base::VectorOf(code, len), kOmitEnd);
@@ -2650,14 +2654,15 @@ TEST_F(FunctionBodyDecoderTest, BrTable_off_end) {
 
 TEST_F(FunctionBodyDecoderTest, BrTable_invalid_br1) {
   for (int depth = 0; depth < 4; depth++) {
-    byte code[] = {B1(WASM_BR_TABLE(WASM_LOCAL_GET(0), 0, BR_TARGET(depth)))};
+    uint8_t code[] = {
+        B1(WASM_BR_TABLE(WASM_LOCAL_GET(0), 0, BR_TARGET(depth)))};
     Validate(depth <= 1, sigs.v_i(), code);
   }
 }
 
 TEST_F(FunctionBodyDecoderTest, BrTable_invalid_br2) {
   for (int depth = 0; depth < 7; depth++) {
-    byte code[] = {
+    uint8_t code[] = {
         WASM_LOOP(WASM_BR_TABLE(WASM_LOCAL_GET(0), 0, BR_TARGET(depth)))};
     Validate(depth < 2, sigs.v_i(), code);
   }
@@ -2869,9 +2874,9 @@ TEST_F(FunctionBodyDecoderTest, SelectWithType_fail) {
 }
 
 TEST_F(FunctionBodyDecoderTest, Throw) {
-  byte ex1 = builder.AddException(sigs.v_v());
-  byte ex2 = builder.AddException(sigs.v_i());
-  byte ex3 = builder.AddException(sigs.v_ii());
+  uint8_t ex1 = builder.AddException(sigs.v_v());
+  uint8_t ex2 = builder.AddException(sigs.v_i());
+  uint8_t ex3 = builder.AddException(sigs.v_ii());
   ExpectValidates(sigs.v_v(), {kExprThrow, ex1});
   ExpectValidates(sigs.v_v(), {WASM_I32V(0), kExprThrow, ex2});
   ExpectFailure(sigs.v_v(), {WASM_F32(0.0), kExprThrow, ex2});
@@ -2881,8 +2886,8 @@ TEST_F(FunctionBodyDecoderTest, Throw) {
 }
 
 TEST_F(FunctionBodyDecoderTest, ThrowUnreachable) {
-  byte ex1 = builder.AddException(sigs.v_v());
-  byte ex2 = builder.AddException(sigs.v_i());
+  uint8_t ex1 = builder.AddException(sigs.v_v());
+  uint8_t ex2 = builder.AddException(sigs.v_i());
   ExpectValidates(sigs.i_i(), {WASM_LOCAL_GET(0), kExprThrow, ex1, WASM_NOP});
   ExpectValidates(sigs.v_i(), {WASM_LOCAL_GET(0), kExprThrow, ex2, WASM_NOP});
   ExpectValidates(sigs.i_i(), {WASM_LOCAL_GET(0), kExprThrow, ex1, WASM_ZERO});
@@ -2896,7 +2901,7 @@ TEST_F(FunctionBodyDecoderTest, ThrowUnreachable) {
 #define WASM_TRY_OP kExprTry, kVoidCode
 
 TEST_F(FunctionBodyDecoderTest, TryCatch) {
-  byte ex = builder.AddException(sigs.v_v());
+  uint8_t ex = builder.AddException(sigs.v_v());
   ExpectValidates(sigs.v_v(), {WASM_TRY_OP, kExprCatch, ex, kExprEnd});
   ExpectValidates(sigs.v_v(),
                   {WASM_TRY_OP, kExprCatch, ex, kExprCatchAll, kExprEnd});
@@ -2924,7 +2929,7 @@ TEST_F(FunctionBodyDecoderTest, Rethrow) {
 }
 
 TEST_F(FunctionBodyDecoderTest, TryDelegate) {
-  byte ex = builder.AddException(sigs.v_v());
+  uint8_t ex = builder.AddException(sigs.v_v());
 
   ExpectValidates(sigs.v_v(), {WASM_TRY_OP,
                                WASM_TRY_DELEGATE(WASM_STMTS(kExprThrow, ex), 0),
@@ -2961,7 +2966,7 @@ TEST_F(FunctionBodyDecoderTest, TryDelegate) {
 #undef WASM_TRY_OP
 
 TEST_F(FunctionBodyDecoderTest, MultiValBlock1) {
-  byte sig0 = builder.AddSignature(sigs.ii_v());
+  uint8_t sig0 = builder.AddSignature(sigs.ii_v());
   ExpectValidates(
       sigs.i_ii(),
       {WASM_BLOCK_X(sig0, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)), kExprI32Add});
@@ -2980,9 +2985,9 @@ TEST_F(FunctionBodyDecoderTest, MultiValBlock1) {
   ExpectFailure(
       sigs.i_ii(),
       {WASM_BLOCK_X(sig0, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)), kExprF32Add},
-      kAppendEnd, "f32.add[1] expected type f32, found block of type i32");
+      kAppendEnd, "f32.add[0] expected type f32, found block of type i32");
 
-  byte sig1 = builder.AddSignature(sigs.v_i());
+  uint8_t sig1 = builder.AddSignature(sigs.v_i());
   ExpectFailure(
       sigs.v_i(),
       {WASM_LOCAL_GET(0), WASM_BLOCK(WASM_BLOCK_X(sig1, WASM_UNREACHABLE))},
@@ -2991,7 +2996,7 @@ TEST_F(FunctionBodyDecoderTest, MultiValBlock1) {
 }
 
 TEST_F(FunctionBodyDecoderTest, MultiValBlock2) {
-  byte sig0 = builder.AddSignature(sigs.ii_v());
+  uint8_t sig0 = builder.AddSignature(sigs.ii_v());
   ExpectValidates(sigs.i_ii(),
                   {WASM_BLOCK_X(sig0, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)),
                    WASM_I32_ADD(WASM_NOP, WASM_NOP)});
@@ -3009,7 +3014,7 @@ TEST_F(FunctionBodyDecoderTest, MultiValBlock2) {
 }
 
 TEST_F(FunctionBodyDecoderTest, MultiValBlockBr) {
-  byte sig0 = builder.AddSignature(sigs.ii_v());
+  uint8_t sig0 = builder.AddSignature(sigs.ii_v());
   ExpectFailure(sigs.i_ii(), {WASM_BLOCK_X(sig0, WASM_LOCAL_GET(0), WASM_BR(0)),
                               kExprI32Add});
   ExpectValidates(sigs.i_ii(), {WASM_BLOCK_X(sig0, WASM_LOCAL_GET(0),
@@ -3018,7 +3023,7 @@ TEST_F(FunctionBodyDecoderTest, MultiValBlockBr) {
 }
 
 TEST_F(FunctionBodyDecoderTest, MultiValLoop1) {
-  byte sig0 = builder.AddSignature(sigs.ii_v());
+  uint8_t sig0 = builder.AddSignature(sigs.ii_v());
   ExpectValidates(
       sigs.i_ii(),
       {WASM_LOOP_X(sig0, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1)), kExprI32Add});
@@ -3034,7 +3039,7 @@ TEST_F(FunctionBodyDecoderTest, MultiValLoop1) {
 }
 
 TEST_F(FunctionBodyDecoderTest, MultiValIf) {
-  byte sig0 = builder.AddSignature(sigs.ii_v());
+  uint8_t sig0 = builder.AddSignature(sigs.ii_v());
   ExpectValidates(
       sigs.i_ii(),
       {WASM_IF_ELSE_X(sig0, WASM_LOCAL_GET(0),
@@ -3093,8 +3098,8 @@ TEST_F(FunctionBodyDecoderTest, MultiValIf) {
 }
 
 TEST_F(FunctionBodyDecoderTest, BlockParam) {
-  byte sig1 = builder.AddSignature(sigs.i_i());
-  byte sig2 = builder.AddSignature(sigs.i_ii());
+  uint8_t sig1 = builder.AddSignature(sigs.i_i());
+  uint8_t sig2 = builder.AddSignature(sigs.i_ii());
   ExpectValidates(
       sigs.i_ii(),
       {WASM_LOCAL_GET(0), WASM_BLOCK_X(sig1, WASM_LOCAL_GET(1),
@@ -3119,8 +3124,8 @@ TEST_F(FunctionBodyDecoderTest, BlockParam) {
 }
 
 TEST_F(FunctionBodyDecoderTest, LoopParam) {
-  byte sig1 = builder.AddSignature(sigs.i_i());
-  byte sig2 = builder.AddSignature(sigs.i_ii());
+  uint8_t sig1 = builder.AddSignature(sigs.i_i());
+  uint8_t sig2 = builder.AddSignature(sigs.i_ii());
   ExpectValidates(sigs.i_ii(), {WASM_LOCAL_GET(0),
                                 WASM_LOOP_X(sig1, WASM_LOCAL_GET(1),
                                             WASM_I32_ADD(WASM_NOP, WASM_NOP))});
@@ -3144,8 +3149,8 @@ TEST_F(FunctionBodyDecoderTest, LoopParam) {
 }
 
 TEST_F(FunctionBodyDecoderTest, LoopParamBr) {
-  byte sig1 = builder.AddSignature(sigs.i_i());
-  byte sig2 = builder.AddSignature(sigs.i_ii());
+  uint8_t sig1 = builder.AddSignature(sigs.i_i());
+  uint8_t sig2 = builder.AddSignature(sigs.i_ii());
   ExpectValidates(sigs.i_ii(),
                   {WASM_LOCAL_GET(0), WASM_LOOP_X(sig1, WASM_BR(0))});
   ExpectValidates(
@@ -3165,8 +3170,8 @@ TEST_F(FunctionBodyDecoderTest, LoopParamBr) {
 }
 
 TEST_F(FunctionBodyDecoderTest, IfParam) {
-  byte sig1 = builder.AddSignature(sigs.i_i());
-  byte sig2 = builder.AddSignature(sigs.i_ii());
+  uint8_t sig1 = builder.AddSignature(sigs.i_i());
+  uint8_t sig2 = builder.AddSignature(sigs.i_ii());
   ExpectValidates(sigs.i_ii(),
                   {WASM_LOCAL_GET(0),
                    WASM_IF_X(sig1, WASM_LOCAL_GET(0),
@@ -3194,7 +3199,7 @@ TEST_F(FunctionBodyDecoderTest, IfParam) {
 TEST_F(FunctionBodyDecoderTest, Regression709741) {
   AddLocals(kWasmI32, kV8MaxWasmFunctionLocals - 1);
   ExpectValidates(sigs.v_v(), {WASM_NOP});
-  byte code[] = {WASM_NOP, WASM_END};
+  uint8_t code[] = {WASM_NOP, WASM_END};
 
   for (size_t i = 0; i < arraysize(code); ++i) {
     FunctionBody body(sigs.v_v(), 0, code, code + i);
@@ -3222,8 +3227,8 @@ TEST_F(FunctionBodyDecoderTest, MemoryInitInvalid) {
   builder.InitializeMemory();
   builder.SetDataSegmentCount(1);
 
-  byte code[] = {WASM_MEMORY_INIT(0, WASM_ZERO, WASM_ZERO, WASM_ZERO),
-                 WASM_END};
+  uint8_t code[] = {WASM_MEMORY_INIT(0, WASM_ZERO, WASM_ZERO, WASM_ZERO),
+                    WASM_END};
   for (size_t i = 0; i <= arraysize(code); ++i) {
     Validate(i == arraysize(code), sigs.v_v(), base::VectorOf(code, i),
              kOmitEnd);
@@ -3294,8 +3299,8 @@ TEST_F(FunctionBodyDecoderTest, TableInitInvalid) {
   builder.InitializeTable(wasm::kWasmFuncRef);
   builder.AddPassiveElementSegment(wasm::kWasmFuncRef);
 
-  byte code[] = {WASM_TABLE_INIT(0, 0, WASM_ZERO, WASM_ZERO, WASM_ZERO),
-                 WASM_END};
+  uint8_t code[] = {WASM_TABLE_INIT(0, 0, WASM_ZERO, WASM_ZERO, WASM_ZERO),
+                    WASM_END};
   for (size_t i = 0; i <= arraysize(code); ++i) {
     Validate(i == arraysize(code), sigs.v_v(), base::VectorOf(code, i),
              kOmitEnd);
@@ -3313,8 +3318,8 @@ TEST_F(FunctionBodyDecoderTest, ElemDrop) {
 TEST_F(FunctionBodyDecoderTest, TableInitDeclarativeElem) {
   builder.InitializeTable(wasm::kWasmFuncRef);
   builder.AddDeclarativeElementSegment();
-  byte code[] = {WASM_TABLE_INIT(0, 0, WASM_ZERO, WASM_ZERO, WASM_ZERO),
-                 WASM_END};
+  uint8_t code[] = {WASM_TABLE_INIT(0, 0, WASM_ZERO, WASM_ZERO, WASM_ZERO),
+                    WASM_END};
   for (size_t i = 0; i <= arraysize(code); ++i) {
     Validate(i == arraysize(code), sigs.v_v(), base::VectorOf(code, i),
              kOmitEnd);
@@ -3329,12 +3334,12 @@ TEST_F(FunctionBodyDecoderTest, DeclarativeElemDrop) {
 }
 
 TEST_F(FunctionBodyDecoderTest, RefFuncDeclared) {
-  byte function_index = builder.AddFunction(sigs.v_i());
+  uint8_t function_index = builder.AddFunction(sigs.v_i());
   ExpectValidates(sigs.c_v(), {WASM_REF_FUNC(function_index)});
 }
 
 TEST_F(FunctionBodyDecoderTest, RefFuncUndeclared) {
-  byte function_index = builder.AddFunction(sigs.v_i(), false);
+  uint8_t function_index = builder.AddFunction(sigs.v_i(), false);
   ExpectFailure(sigs.c_v(), {WASM_REF_FUNC(function_index)});
 }
 
@@ -3366,8 +3371,8 @@ TEST_F(FunctionBodyDecoderTest, TableCopyWrongType) {
 }
 
 TEST_F(FunctionBodyDecoderTest, TableGrow) {
-  byte tab_func = builder.AddTable(kWasmFuncRef, 10, true, 20);
-  byte tab_ref = builder.AddTable(kWasmExternRef, 10, true, 20);
+  uint8_t tab_func = builder.AddTable(kWasmFuncRef, 10, true, 20);
+  uint8_t tab_ref = builder.AddTable(kWasmExternRef, 10, true, 20);
 
   ExpectValidates(
       sigs.i_c(),
@@ -3394,8 +3399,8 @@ TEST_F(FunctionBodyDecoderTest, TableSize) {
 }
 
 TEST_F(FunctionBodyDecoderTest, TableFill) {
-  byte tab_func = builder.AddTable(kWasmFuncRef, 10, true, 20);
-  byte tab_ref = builder.AddTable(kWasmExternRef, 10, true, 20);
+  uint8_t tab_func = builder.AddTable(kWasmFuncRef, 10, true, 20);
+  uint8_t tab_ref = builder.AddTable(kWasmExternRef, 10, true, 20);
   ExpectValidates(sigs.v_c(),
                   {WASM_TABLE_FILL(tab_func, WASM_ONE,
                                    WASM_REF_NULL(kFuncRefCode), WASM_ONE)});
@@ -3513,7 +3518,8 @@ TEST_F(FunctionBodyDecoderTest, UnpackPackedTypes) {
   WASM_FEATURE_SCOPE(gc);
   {
     TestModuleBuilder builder;
-    byte type_index = builder.AddStruct({F(kWasmI8, true), F(kWasmI16, false)});
+    uint8_t type_index =
+        builder.AddStruct({F(kWasmI8, true), F(kWasmI16, false)});
     module = builder.module();
     ExpectValidates(sigs.v_v(),
                     {WASM_STRUCT_SET(type_index, 0,
@@ -3523,7 +3529,7 @@ TEST_F(FunctionBodyDecoderTest, UnpackPackedTypes) {
   }
   {
     TestModuleBuilder builder;
-    byte type_index = builder.AddArray(kWasmI8, true);
+    uint8_t type_index = builder.AddArray(kWasmI8, true);
     module = builder.module();
     ExpectValidates(
         sigs.v_v(),
@@ -3533,20 +3539,21 @@ TEST_F(FunctionBodyDecoderTest, UnpackPackedTypes) {
   }
 }
 
-ValueType ref(byte type_index) { return ValueType::Ref(type_index); }
-ValueType refNull(byte type_index) { return ValueType::RefNull(type_index); }
+ValueType ref(uint8_t type_index) { return ValueType::Ref(type_index); }
+ValueType refNull(uint8_t type_index) { return ValueType::RefNull(type_index); }
 
 TEST_F(FunctionBodyDecoderTest, StructOrArrayNewDefault) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
   TestModuleBuilder builder;
-  byte struct_index = builder.AddStruct({F(kWasmI32, true)});
-  byte struct_non_def_index = builder.AddStruct({F(ref(struct_index), true)});
-  byte struct_immutable_index = builder.AddStruct({F(kWasmI32, false)});
-  byte array_index = builder.AddArray(kWasmI32, true);
-  byte array_non_def_index = builder.AddArray(ref(array_index), true);
-  byte array_immutable_index = builder.AddArray(kWasmI32, false);
+  uint8_t struct_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t struct_non_def_index =
+      builder.AddStruct({F(ref(struct_index), true)});
+  uint8_t struct_immutable_index = builder.AddStruct({F(kWasmI32, false)});
+  uint8_t array_index = builder.AddArray(kWasmI32, true);
+  uint8_t array_non_def_index = builder.AddArray(ref(array_index), true);
+  uint8_t array_immutable_index = builder.AddArray(kWasmI32, false);
 
   module = builder.module();
 
@@ -3582,11 +3589,11 @@ TEST_F(FunctionBodyDecoderTest, DefaultableLocal) {
 TEST_F(FunctionBodyDecoderTest, NonDefaultableLocals) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
   ValueType rep = ref(struct_type_index);
   FunctionSig sig(0, 1, &rep);
   AddLocals(rep, 2);
-  byte ex = builder.AddException(sigs.v_v());
+  uint8_t ex = builder.AddException(sigs.v_v());
   // Declaring non-defaultable locals is fine.
   ExpectValidates(&sig, {});
   // Loading from an uninitialized non-defaultable local fails.
@@ -3662,7 +3669,7 @@ TEST_F(FunctionBodyDecoderTest, RefEq) {
   WASM_FEATURE_SCOPE(simd);
   WASM_FEATURE_SCOPE(gc);
 
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
   ValueType eqref_subtypes[] = {
       kWasmEqRef,  kWasmI31Ref.AsNonNull(), kWasmEqRef.AsNonNull(),
       kWasmI31Ref, ref(struct_type_index),  refNull(struct_type_index)};
@@ -3704,8 +3711,8 @@ TEST_F(FunctionBodyDecoderTest, RefAsNonNull) {
   WASM_FEATURE_SCOPE(simd);
   WASM_FEATURE_SCOPE(gc);
 
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
-  byte array_type_index = builder.AddArray(kWasmI32, true);
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t array_type_index = builder.AddArray(kWasmI32, true);
   uint32_t heap_types[] = {
       struct_type_index, array_type_index, HeapType::kFunc, HeapType::kEq,
       HeapType::kExtern, HeapType::kAny,   HeapType::kI31};
@@ -3741,8 +3748,8 @@ TEST_F(FunctionBodyDecoderTest, RefNull) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
-  byte array_type_index = builder.AddArray(kWasmI32, true);
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t array_type_index = builder.AddArray(kWasmI32, true);
   uint32_t type_reprs[] = {
       struct_type_index, array_type_index, HeapType::kFunc, HeapType::kEq,
       HeapType::kExtern, HeapType::kAny,   HeapType::kI31,  HeapType::kNone};
@@ -3767,8 +3774,8 @@ TEST_F(FunctionBodyDecoderTest, RefIsNull) {
       sigs.i_i(), {WASM_REF_IS_NULL(WASM_LOCAL_GET(0))}, kAppendEnd,
       "ref.is_null[0] expected reference type, found local.get of type i32");
 
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
-  byte array_type_index = builder.AddArray(kWasmI32, true);
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t array_type_index = builder.AddArray(kWasmI32, true);
   uint32_t heap_types[] = {
       struct_type_index, array_type_index, HeapType::kFunc, HeapType::kEq,
       HeapType::kExtern, HeapType::kAny,   HeapType::kI31};
@@ -3793,8 +3800,8 @@ TEST_F(FunctionBodyDecoderTest, BrOnNull) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
-  byte array_type_index = builder.AddArray(kWasmI32, true);
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t array_type_index = builder.AddArray(kWasmI32, true);
   uint32_t type_reprs[] = {
       struct_type_index, array_type_index, HeapType::kFunc, HeapType::kEq,
       HeapType::kExtern, HeapType::kAny,   HeapType::kI31,  HeapType::kNone};
@@ -3821,8 +3828,8 @@ TEST_F(FunctionBodyDecoderTest, BrOnNonNull) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
-  byte array_type_index = builder.AddArray(kWasmI32, true);
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t array_type_index = builder.AddArray(kWasmI32, true);
   uint32_t type_reprs[] = {
       struct_type_index, array_type_index, HeapType::kFunc, HeapType::kEq,
       HeapType::kExtern, HeapType::kAny,   HeapType::kI31};
@@ -3855,10 +3862,10 @@ TEST_F(FunctionBodyDecoderTest, GCStruct) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
-  byte array_type_index = builder.AddArray(kWasmI32, true);
-  byte immutable_struct_type_index = builder.AddStruct({F(kWasmI32, false)});
-  byte field_index = 0;
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t array_type_index = builder.AddArray(kWasmI32, true);
+  uint8_t immutable_struct_type_index = builder.AddStruct({F(kWasmI32, false)});
+  uint8_t field_index = 0;
 
   ValueType struct_type = ValueType::Ref(struct_type_index);
   ValueType reps_i_r[] = {kWasmI32, struct_type};
@@ -3874,7 +3881,7 @@ TEST_F(FunctionBodyDecoderTest, GCStruct) {
   ExpectFailure(&sig_r_v, {WASM_GC_OP(kExprStructNew), struct_type_index},
                 kAppendEnd,
                 "not enough arguments on the stack for struct.new "
-                "(need 2, got 1)");
+                "(need 1, got 0)");
   // Too many arguments.
   ExpectFailure(
       &sig_r_v,
@@ -3966,9 +3973,9 @@ TEST_F(FunctionBodyDecoderTest, GCArray) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte array_type_index = builder.AddArray(kWasmFuncRef, true);
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, false)});
-  byte immutable_array_type_index = builder.AddArray(kWasmI32, false);
+  uint8_t array_type_index = builder.AddArray(kWasmFuncRef, true);
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, false)});
+  uint8_t immutable_array_type_index = builder.AddArray(kWasmI32, false);
 
   ValueType array_type = ValueType::Ref(array_type_index);
   ValueType immutable_array_type = ValueType::Ref(immutable_array_type_index);
@@ -3996,7 +4003,7 @@ TEST_F(FunctionBodyDecoderTest, GCArray) {
                 {WASM_I32V(10), WASM_GC_OP(kExprArrayNew), array_type_index},
                 kAppendEnd,
                 "not enough arguments on the stack for array.new "
-                "(need 3, got 2)");
+                "(need 2, got 1)");
   // Mistyped initializer.
   ExpectFailure(&sig_r_v,
                 {WASM_ARRAY_NEW(array_type_index, WASM_REF_NULL(kExternRefCode),
@@ -4111,9 +4118,9 @@ TEST_F(FunctionBodyDecoderTest, PackedFields) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte array_type_index = builder.AddArray(kWasmI8, true);
-  byte struct_type_index = builder.AddStruct({F(kWasmI16, true)});
-  byte field_index = 0;
+  uint8_t array_type_index = builder.AddArray(kWasmI8, true);
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI16, true)});
+  uint8_t field_index = 0;
 
   // *.new with packed fields works.
   ExpectValidates(sigs.v_v(),
@@ -4327,93 +4334,123 @@ TEST_F(FunctionBodyDecoderTest, BrOnCastOrCastFail) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte super_struct = builder.AddStruct({F(kWasmI16, true)});
-  byte sub_struct =
+  uint8_t super_struct = builder.AddStruct({F(kWasmI16, true)});
+  uint8_t sub_struct =
       builder.AddStruct({F(kWasmI16, true), F(kWasmI32, false)}, super_struct);
-  byte fct_type = builder.AddSignature(sigs.i_i(), kNoSuperType);
 
   ValueType supertype = ValueType::RefNull(super_struct);
   ValueType subtype = ValueType::RefNull(sub_struct);
 
   ExpectValidates(
       FunctionSig::Build(this->zone(), {kWasmI32, subtype}, {supertype}),
-      {WASM_I32V(42), WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, sub_struct),
-       WASM_GC_OP(kExprRefCast), sub_struct});
+      {WASM_I32V(42), WASM_LOCAL_GET(0),
+       WASM_BR_ON_CAST(0, super_struct, sub_struct), WASM_GC_OP(kExprRefCast),
+       sub_struct});
   ExpectValidates(
       FunctionSig::Build(this->zone(), {kWasmI32, subtype}, {supertype}),
-      {WASM_I32V(42), WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, sub_struct),
-       WASM_GC_OP(kExprRefCast), sub_struct});
+      {WASM_I32V(42), WASM_LOCAL_GET(0),
+       WASM_BR_ON_CAST(0, super_struct, sub_struct), WASM_GC_OP(kExprRefCast),
+       sub_struct});
   ExpectValidates(
       FunctionSig::Build(this->zone(), {kWasmI32, supertype}, {supertype}),
-      {WASM_I32V(42), WASM_LOCAL_GET(0), WASM_BR_ON_CAST_FAIL(0, sub_struct)});
+      {WASM_I32V(42), WASM_LOCAL_GET(0),
+       WASM_BR_ON_CAST_FAIL(0, super_struct, sub_struct)});
   ExpectValidates(
       FunctionSig::Build(this->zone(), {kWasmI32, supertype}, {supertype}),
       {WASM_I32V(42), WASM_LOCAL_GET(0),
-       WASM_BR_ON_CAST_FAIL_NULL(0, sub_struct)});
+       WASM_BR_ON_CAST_FAIL_NULL(0, super_struct, sub_struct)});
 
   // Wrong branch type.
   ExpectFailure(
       FunctionSig::Build(this->zone(), {}, {supertype}),
-      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, sub_struct), WASM_UNREACHABLE},
+      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, super_struct, sub_struct),
+       WASM_UNREACHABLE},
       kAppendEnd, "br_on_cast must target a branch of arity at least 1");
   ExpectFailure(
       FunctionSig::Build(this->zone(), {subtype}, {supertype}),
-      {WASM_I32V(42), WASM_LOCAL_GET(0), WASM_BR_ON_CAST_FAIL(0, sub_struct)},
+      {WASM_I32V(42), WASM_LOCAL_GET(0),
+       WASM_BR_ON_CAST_FAIL(0, super_struct, sub_struct)},
       kAppendEnd,
       "type error in branch[0] (expected (ref null 1), got (ref null 0))");
   ExpectFailure(FunctionSig::Build(this->zone(), {subtype}, {supertype}),
                 {WASM_I32V(42), WASM_LOCAL_GET(0),
-                 WASM_BR_ON_CAST_FAIL_NULL(0, sub_struct)},
+                 WASM_BR_ON_CAST_FAIL_NULL(0, super_struct, sub_struct)},
                 kAppendEnd,
                 "type error in branch[0] (expected (ref null 1), got (ref 0))");
 
   // Wrong fallthrough type.
   ExpectFailure(
       FunctionSig::Build(this->zone(), {subtype}, {supertype}),
-      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, sub_struct)}, kAppendEnd,
+      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, super_struct, sub_struct)},
+      kAppendEnd,
       "type error in fallthru[0] (expected (ref null 1), got (ref null 0))");
   ExpectFailure(
       FunctionSig::Build(this->zone(), {supertype}, {supertype}),
-      {WASM_BLOCK_I(WASM_LOCAL_GET(0), WASM_BR_ON_CAST_FAIL(0, sub_struct))},
+      {WASM_BLOCK_I(WASM_LOCAL_GET(0),
+                    WASM_BR_ON_CAST_FAIL(0, super_struct, sub_struct))},
       kAppendEnd, "type error in branch[0] (expected i32, got (ref null 0))");
-  ExpectFailure(FunctionSig::Build(this->zone(), {supertype}, {supertype}),
-                {WASM_BLOCK_I(WASM_LOCAL_GET(0),
-                              WASM_BR_ON_CAST_FAIL_NULL(0, sub_struct))},
-                kAppendEnd,
-                "type error in branch[0] (expected i32, got (ref 0))");
+  ExpectFailure(
+      FunctionSig::Build(this->zone(), {supertype}, {supertype}),
+      {WASM_BLOCK_I(WASM_LOCAL_GET(0),
+                    WASM_BR_ON_CAST_FAIL_NULL(0, super_struct, sub_struct))},
+      kAppendEnd, "type error in branch[0] (expected i32, got (ref 0))");
 
-  // Argument type error.
-  ExpectFailure(FunctionSig::Build(this->zone(), {subtype}, {kWasmExternRef}),
-                {WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, sub_struct),
-                 WASM_GC_OP(kExprRefCast), sub_struct},
-                kAppendEnd,
-                "Invalid types for br_on_cast: local.get of type externref has "
-                "to be in the same reference type hierarchy as (ref 1)");
+  // Wrong argument type.
   ExpectFailure(
       FunctionSig::Build(this->zone(), {subtype}, {kWasmExternRef}),
-      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST_NULL(0, sub_struct),
+      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, super_struct, sub_struct),
        WASM_GC_OP(kExprRefCast), sub_struct},
       kAppendEnd,
-      "Invalid types for br_on_cast null: local.get of type externref has "
-      "to be in the same reference type hierarchy as (ref 1)");
+      "br_on_cast[0] expected type (ref null 0), found local.get of type "
+      "externref");
+  ExpectFailure(
+      FunctionSig::Build(this->zone(), {subtype}, {kWasmExternRef}),
+      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST_NULL(0, super_struct, sub_struct),
+       WASM_GC_OP(kExprRefCast), sub_struct},
+      kAppendEnd,
+      "br_on_cast[0] expected type (ref null 0), found local.get of type "
+      "externref");
   ExpectFailure(
       FunctionSig::Build(this->zone(), {supertype}, {kWasmExternRef}),
-      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST_FAIL(0, sub_struct)}, kAppendEnd,
-      "Invalid types for br_on_cast_fail: local.get of type externref has to "
-      "be in the same reference type hierarchy as (ref 1)");
+      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST_FAIL(0, super_struct, sub_struct)},
+      kAppendEnd,
+      "br_on_cast_fail[0] expected type (ref null 0), found local.get of type "
+      "externref");
   ExpectFailure(
       FunctionSig::Build(this->zone(), {supertype}, {kWasmExternRef}),
-      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST_FAIL_NULL(0, sub_struct)}, kAppendEnd,
-      "Invalid types for br_on_cast_fail null: local.get of type "
-      "externref has to be in the same reference type hierarchy as (ref 1)");
+      {WASM_LOCAL_GET(0),
+       WASM_BR_ON_CAST_FAIL_NULL(0, super_struct, sub_struct)},
+      kAppendEnd,
+      "br_on_cast_fail[0] expected type (ref null 0), found local.get of "
+      "type externref");
 
-  // Cast between types of different type hierarchies is invalid.
+  // Wrong immediate type.
   ExpectFailure(
-      FunctionSig::Build(this->zone(), {subtype}, {supertype}),
-      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, fct_type), WASM_UNREACHABLE},
+      FunctionSig::Build(this->zone(), {subtype}, {kWasmExternRef}),
+      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST(0, kExternRefCode, sub_struct),
+       WASM_GC_OP(kExprRefCast), sub_struct},
       kAppendEnd,
-      "Invalid types for br_on_cast: local.get of type (ref null 0) has "
-      "to be in the same reference type hierarchy as (ref 2)");
+      "invalid types for br_on_cast: (ref 1) is not a subtype of externref");
+  ExpectFailure(
+      FunctionSig::Build(this->zone(), {subtype}, {kWasmExternRef}),
+      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST_NULL(0, kExternRefCode, sub_struct),
+       WASM_GC_OP(kExprRefCast), sub_struct},
+      kAppendEnd,
+      "invalid types for br_on_cast: (ref null 1) is not a subtype of "
+      "externref");
+  ExpectFailure(
+      FunctionSig::Build(this->zone(), {supertype}, {kWasmExternRef}),
+      {WASM_LOCAL_GET(0), WASM_BR_ON_CAST_FAIL(0, kExternRefCode, sub_struct)},
+      kAppendEnd,
+      "invalid types for br_on_cast_fail: (ref 1) is not a subtype of "
+      "externref");
+  ExpectFailure(
+      FunctionSig::Build(this->zone(), {supertype}, {kWasmExternRef}),
+      {WASM_LOCAL_GET(0),
+       WASM_BR_ON_CAST_FAIL_NULL(0, kExternRefCode, sub_struct)},
+      kAppendEnd,
+      "invalid types for br_on_cast_fail: (ref null 1) is not a subtype "
+      "of externref");
 }
 
 TEST_F(FunctionBodyDecoderTest, BrOnAbstractType) {
@@ -4499,7 +4536,7 @@ TEST_F(FunctionBodyDecoderTest, LocalTeeTyping) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte array_type = builder.AddArray(kWasmI8, true);
+  uint8_t array_type = builder.AddArray(kWasmI8, true);
 
   ValueType types[] = {ValueType::Ref(array_type)};
   FunctionSig sig(1, 0, types);
@@ -4516,10 +4553,10 @@ TEST_F(FunctionBodyDecoderTest, MergeNullableTypes) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  byte struct_type_index = builder.AddStruct({F(kWasmI32, true)});
+  uint8_t struct_type_index = builder.AddStruct({F(kWasmI32, true)});
   ValueType struct_type = refNull(struct_type_index);
   FunctionSig loop_sig(0, 1, &struct_type);
-  byte loop_sig_index = builder.AddSignature(&loop_sig);
+  uint8_t loop_sig_index = builder.AddSignature(&loop_sig);
   // Verifies that when a loop consuming a nullable type is entered with a
   // statically known non-null value on the stack, its {start_merge_} can
   // consume null values later.
@@ -4598,14 +4635,14 @@ TEST_F(FunctionBodyDecoderTest, ExternExternalize) {
 class BranchTableIteratorTest : public TestWithZone {
  public:
   BranchTableIteratorTest() : TestWithZone() {}
-  void CheckBrTableSize(const byte* start, const byte* end) {
+  void CheckBrTableSize(const uint8_t* start, const uint8_t* end) {
     Decoder decoder(start, end);
     BranchTableImmediate operand(&decoder, start + 1, Decoder::kFullValidation);
     BranchTableIterator<Decoder::FullValidationTag> iterator(&decoder, operand);
     EXPECT_EQ(end - start - 1u, iterator.length());
     EXPECT_OK(decoder);
   }
-  void CheckBrTableError(const byte* start, const byte* end) {
+  void CheckBrTableError(const uint8_t* start, const uint8_t* end) {
     Decoder decoder(start, end);
     BranchTableImmediate operand(&decoder, start + 1, Decoder::kFullValidation);
     BranchTableIterator<Decoder::FullValidationTag> iterator(&decoder, operand);
@@ -4614,16 +4651,16 @@ class BranchTableIteratorTest : public TestWithZone {
   }
 };
 
-#define CHECK_BR_TABLE_LENGTH(...)                    \
-  {                                                   \
-    static byte code[] = {kExprBrTable, __VA_ARGS__}; \
-    CheckBrTableSize(code, code + sizeof(code));      \
+#define CHECK_BR_TABLE_LENGTH(...)                       \
+  {                                                      \
+    static uint8_t code[] = {kExprBrTable, __VA_ARGS__}; \
+    CheckBrTableSize(code, code + sizeof(code));         \
   }
 
-#define CHECK_BR_TABLE_ERROR(...)                     \
-  {                                                   \
-    static byte code[] = {kExprBrTable, __VA_ARGS__}; \
-    CheckBrTableError(code, code + sizeof(code));     \
+#define CHECK_BR_TABLE_ERROR(...)                        \
+  {                                                      \
+    static uint8_t code[] = {kExprBrTable, __VA_ARGS__}; \
+    CheckBrTableError(code, code + sizeof(code));        \
   }
 
 TEST_F(BranchTableIteratorTest, count0) {
@@ -4659,14 +4696,14 @@ TEST_F(BranchTableIteratorTest, error0) {
 #undef CHECK_BR_TABLE_ERROR
 
 struct PrintOpcodes {
-  const byte* start;
-  const byte* end;
+  const uint8_t* start;
+  const uint8_t* end;
 };
 std::ostream& operator<<(std::ostream& out, const PrintOpcodes& range) {
   out << "First opcode: \""
       << WasmOpcodes::OpcodeName(static_cast<WasmOpcode>(*range.start))
       << "\"\nall bytes: [";
-  for (const byte* b = range.start; b < range.end; ++b) {
+  for (const uint8_t* b = range.start; b < range.end; ++b) {
     out << (b == range.start ? "" : ", ") << uint32_t{*b} << "/"
         << AsHex(*b, 2, true);
   }
@@ -4679,7 +4716,8 @@ class WasmOpcodeLengthTest : public TestWithZone {
 
   template <typename... Bytes>
   void ExpectLength(unsigned expected, Bytes... bytes) {
-    const byte code[] = {static_cast<byte>(bytes)..., 0, 0, 0, 0, 0, 0, 0, 0};
+    const uint8_t code[] = {
+        static_cast<uint8_t>(bytes)..., 0, 0, 0, 0, 0, 0, 0, 0};
     EXPECT_EQ(expected, OpcodeLength(code, code + sizeof(code)))
         << PrintOpcodes{code, code + sizeof...(bytes)};
   }
@@ -4700,7 +4738,8 @@ class WasmOpcodeLengthTest : public TestWithZone {
 
   template <typename... Bytes>
   void ExpectFailure(Bytes... bytes) {
-    const byte code[] = {static_cast<byte>(bytes)..., 0, 0, 0, 0, 0, 0, 0, 0};
+    const uint8_t code[] = {
+        static_cast<uint8_t>(bytes)..., 0, 0, 0, 0, 0, 0, 0, 0};
     WasmFeatures no_features = WasmFeatures::None();
     WasmDecoder<Decoder::FullValidationTag> decoder(
         this->zone(), nullptr, no_features, &no_features, nullptr, code,
@@ -4711,15 +4750,15 @@ class WasmOpcodeLengthTest : public TestWithZone {
 
   void ExpectNonFailure(WasmOpcode opcode) {
     uint8_t maybe_prefix = WasmOpcodes::ExtractPrefix(opcode);
-    byte bytes[32]{0};
+    uint8_t bytes[32]{0};
     if (WasmOpcodes::IsPrefixOpcode(static_cast<WasmOpcode>(maybe_prefix))) {
       bytes[0] = maybe_prefix;
       uint16_t index = ExtractPrefixedOpcodeBytes(opcode);
-      byte* p = &bytes[1];
+      uint8_t* p = &bytes[1];
       LEBHelper::write_u32v(&p, index);
     } else {
       DCHECK_LE(static_cast<uint32_t>(opcode), 0xFF);
-      bytes[0] = static_cast<byte>(opcode);
+      bytes[0] = static_cast<uint8_t>(opcode);
       // Special case: select_with_type insists on a {1} immediate.
       if (opcode == kExprSelectWithType) {
         bytes[1] = 1;
@@ -4892,6 +4931,8 @@ TEST_F(WasmOpcodeLengthTest, GCOpcodes) {
   // br_on_cast{,_fail}: prefix + opcode + br_depth + type_index
   ExpectLength(4, 0xfb, kExprBrOnCastDeprecated & 0xFF);
   ExpectLength(4, 0xfb, kExprBrOnCastFail & 0xFF);
+  // br_on_cast: prefix + opcode + flags + br_depth + source_type + target_type
+  ExpectLength(6, 0xfb, kExprBrOnCastGeneric & 0xFF);
 
   // struct.new, with leb immediate operand.
   ExpectLength(3, 0xfb, 0x07, 0x42);
@@ -4918,7 +4959,7 @@ TEST_F(WasmOpcodeLengthTest, PrefixedOpcodesLEB) {
 
 class TypeReaderTest : public TestWithZone {
  public:
-  HeapType DecodeHeapType(const byte* start, const byte* end) {
+  HeapType DecodeHeapType(const uint8_t* start, const uint8_t* end) {
     Decoder decoder(start, end);
     auto [heap_type, length] =
         value_type_reader::read_heap_type<Decoder::FullValidationTag>(
@@ -4939,34 +4980,34 @@ TEST_F(TypeReaderTest, HeapTypeDecodingTest) {
 
   // 1- to 5-byte representation of kFuncRefCode.
   {
-    const byte data[] = {kFuncRefCode};
+    const uint8_t data[] = {kFuncRefCode};
     HeapType result = DecodeHeapType(data, data + sizeof(data));
     EXPECT_TRUE(result == heap_func);
   }
   {
-    const byte data[] = {kFuncRefCode | 0x80, 0x7F};
+    const uint8_t data[] = {kFuncRefCode | 0x80, 0x7F};
     HeapType result = DecodeHeapType(data, data + sizeof(data));
     EXPECT_EQ(result, heap_func);
   }
   {
-    const byte data[] = {kFuncRefCode | 0x80, 0xFF, 0x7F};
+    const uint8_t data[] = {kFuncRefCode | 0x80, 0xFF, 0x7F};
     HeapType result = DecodeHeapType(data, data + sizeof(data));
     EXPECT_EQ(result, heap_func);
   }
   {
-    const byte data[] = {kFuncRefCode | 0x80, 0xFF, 0xFF, 0x7F};
+    const uint8_t data[] = {kFuncRefCode | 0x80, 0xFF, 0xFF, 0x7F};
     HeapType result = DecodeHeapType(data, data + sizeof(data));
     EXPECT_EQ(result, heap_func);
   }
   {
-    const byte data[] = {kFuncRefCode | 0x80, 0xFF, 0xFF, 0xFF, 0x7F};
+    const uint8_t data[] = {kFuncRefCode | 0x80, 0xFF, 0xFF, 0xFF, 0x7F};
     HeapType result = DecodeHeapType(data, data + sizeof(data));
     EXPECT_EQ(result, heap_func);
   }
 
   {
     // Some negative number.
-    const byte data[] = {0xB4, 0x7F};
+    const uint8_t data[] = {0xB4, 0x7F};
     HeapType result = DecodeHeapType(data, data + sizeof(data));
     EXPECT_EQ(result, heap_bottom);
   }
@@ -4975,7 +5016,7 @@ TEST_F(TypeReaderTest, HeapTypeDecodingTest) {
     // This differs from kFuncRefCode by one bit outside the 1-byte LEB128
     // range. This should therefore NOT be decoded as HeapType::kFunc and
     // instead fail.
-    const byte data[] = {kFuncRefCode | 0x80, 0x6F};
+    const uint8_t data[] = {kFuncRefCode | 0x80, 0x6F};
     HeapType result = DecodeHeapType(data, data + sizeof(data));
     EXPECT_EQ(result, heap_bottom);
   }
@@ -4993,8 +5034,8 @@ class LocalDeclDecoderTest : public TestWithZone {
     return pos;
   }
 
-  bool DecodeLocalDecls(BodyLocalDecls* decls, const byte* start,
-                        const byte* end) {
+  bool DecodeLocalDecls(BodyLocalDecls* decls, const uint8_t* start,
+                        const uint8_t* end) {
     WasmModule module;
     return ValidateAndDecodeLocalDeclsForTesting(enabled_features_, decls,
                                                  &module, start, end, zone());
@@ -5008,7 +5049,7 @@ TEST_F(LocalDeclDecoderTest, EmptyLocals) {
 }
 
 TEST_F(LocalDeclDecoderTest, NoLocals) {
-  static const byte data[] = {0};
+  static const uint8_t data[] = {0};
   BodyLocalDecls decls;
   bool result = DecodeLocalDecls(&decls, data, data + sizeof(data));
   EXPECT_TRUE(result);
@@ -5016,15 +5057,15 @@ TEST_F(LocalDeclDecoderTest, NoLocals) {
 }
 
 TEST_F(LocalDeclDecoderTest, WrongLocalDeclsCount1) {
-  static const byte data[] = {1};
+  static const uint8_t data[] = {1};
   BodyLocalDecls decls;
   bool result = DecodeLocalDecls(&decls, data, data + sizeof(data));
   EXPECT_FALSE(result);
 }
 
 TEST_F(LocalDeclDecoderTest, WrongLocalDeclsCount2) {
-  static const byte data[] = {2, 1,
-                              static_cast<byte>(kWasmI32.value_type_code())};
+  static const uint8_t data[] = {
+      2, 1, static_cast<uint8_t>(kWasmI32.value_type_code())};
   BodyLocalDecls decls;
   bool result = DecodeLocalDecls(&decls, data, data + sizeof(data));
   EXPECT_FALSE(result);
@@ -5033,7 +5074,7 @@ TEST_F(LocalDeclDecoderTest, WrongLocalDeclsCount2) {
 TEST_F(LocalDeclDecoderTest, OneLocal) {
   for (size_t i = 0; i < arraysize(kValueTypes); i++) {
     ValueType type = kValueTypes[i];
-    const byte data[] = {1, 1, static_cast<byte>(type.value_type_code())};
+    const uint8_t data[] = {1, 1, static_cast<uint8_t>(type.value_type_code())};
     BodyLocalDecls decls;
     bool result = DecodeLocalDecls(&decls, data, data + sizeof(data));
     EXPECT_TRUE(result);
@@ -5046,7 +5087,7 @@ TEST_F(LocalDeclDecoderTest, OneLocal) {
 TEST_F(LocalDeclDecoderTest, FiveLocals) {
   for (size_t i = 0; i < arraysize(kValueTypes); i++) {
     ValueType type = kValueTypes[i];
-    const byte data[] = {1, 5, static_cast<byte>(type.value_type_code())};
+    const uint8_t data[] = {1, 5, static_cast<uint8_t>(type.value_type_code())};
     BodyLocalDecls decls;
     bool result = DecodeLocalDecls(&decls, data, data + sizeof(data));
     EXPECT_TRUE(result);
@@ -5057,12 +5098,12 @@ TEST_F(LocalDeclDecoderTest, FiveLocals) {
 }
 
 TEST_F(LocalDeclDecoderTest, MixedLocals) {
-  for (byte a = 0; a < 3; a++) {
-    for (byte b = 0; b < 3; b++) {
-      for (byte c = 0; c < 3; c++) {
-        for (byte d = 0; d < 3; d++) {
-          const byte data[] = {4, a,        kI32Code, b,       kI64Code,
-                               c, kF32Code, d,        kF64Code};
+  for (uint8_t a = 0; a < 3; a++) {
+    for (uint8_t b = 0; b < 3; b++) {
+      for (uint8_t c = 0; c < 3; c++) {
+        for (uint8_t d = 0; d < 3; d++) {
+          const uint8_t data[] = {4, a,        kI32Code, b,       kI64Code,
+                                  c, kF32Code, d,        kF64Code};
           BodyLocalDecls decls;
           bool result = DecodeLocalDecls(&decls, data, data + sizeof(data));
           EXPECT_TRUE(result);
@@ -5081,8 +5122,8 @@ TEST_F(LocalDeclDecoderTest, MixedLocals) {
 }
 
 TEST_F(LocalDeclDecoderTest, UseEncoder) {
-  const byte* data = nullptr;
-  const byte* end = nullptr;
+  const uint8_t* data = nullptr;
+  const uint8_t* end = nullptr;
   LocalDeclEncoder local_decls(zone());
 
   local_decls.AddLocals(5, kWasmF32);
@@ -5104,8 +5145,8 @@ TEST_F(LocalDeclDecoderTest, UseEncoder) {
 TEST_F(LocalDeclDecoderTest, InvalidTypeIndex) {
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  const byte* data = nullptr;
-  const byte* end = nullptr;
+  const uint8_t* data = nullptr;
+  const uint8_t* end = nullptr;
   LocalDeclEncoder local_decls(zone());
 
   local_decls.AddLocals(1, ValueType::RefNull(0));
@@ -5117,7 +5158,7 @@ TEST_F(LocalDeclDecoderTest, InvalidTypeIndex) {
 class BytecodeIteratorTest : public TestWithZone {};
 
 TEST_F(BytecodeIteratorTest, SimpleForeach) {
-  byte code[] = {WASM_IF_ELSE(WASM_ZERO, WASM_ZERO, WASM_ZERO)};
+  uint8_t code[] = {WASM_IF_ELSE(WASM_ZERO, WASM_ZERO, WASM_ZERO)};
   BytecodeIterator iter(code, code + sizeof(code));
   WasmOpcode expected[] = {kExprI32Const, kExprIf,       kExprI32Const,
                            kExprElse,     kExprI32Const, kExprEnd};
@@ -5133,7 +5174,7 @@ TEST_F(BytecodeIteratorTest, SimpleForeach) {
 }
 
 TEST_F(BytecodeIteratorTest, ForeachTwice) {
-  byte code[] = {WASM_IF_ELSE(WASM_ZERO, WASM_ZERO, WASM_ZERO)};
+  uint8_t code[] = {WASM_IF_ELSE(WASM_ZERO, WASM_ZERO, WASM_ZERO)};
   BytecodeIterator iter(code, code + sizeof(code));
   int count = 0;
 
@@ -5153,7 +5194,7 @@ TEST_F(BytecodeIteratorTest, ForeachTwice) {
 }
 
 TEST_F(BytecodeIteratorTest, ForeachOffset) {
-  byte code[] = {WASM_IF_ELSE(WASM_ZERO, WASM_ZERO, WASM_ZERO)};
+  uint8_t code[] = {WASM_IF_ELSE(WASM_ZERO, WASM_ZERO, WASM_ZERO)};
   BytecodeIterator iter(code, code + sizeof(code));
   int count = 0;
 
@@ -5173,7 +5214,7 @@ TEST_F(BytecodeIteratorTest, ForeachOffset) {
 }
 
 TEST_F(BytecodeIteratorTest, WithLocalDecls) {
-  byte code[] = {1, 1, kI32Code, WASM_I32V_1(9), WASM_I32V_1(11)};
+  uint8_t code[] = {1, 1, kI32Code, WASM_I32V_1(9), WASM_I32V_1(11)};
   BodyLocalDecls decls;
   BytecodeIterator iter(code, code + sizeof(code), &decls, zone());
 
@@ -5189,13 +5230,17 @@ TEST_F(BytecodeIteratorTest, WithLocalDecls) {
 }
 
 /*******************************************************************************
- * Memory64 tests
+ * Memory64 tests.
  ******************************************************************************/
 
 class FunctionBodyDecoderTestOnBothMemoryTypes
     : public FunctionBodyDecoderTestBase<
           WithDefaultPlatformMixin<::testing::TestWithParam<MemoryType>>> {
  public:
+  FunctionBodyDecoderTestOnBothMemoryTypes() {
+    if (is_memory64()) enabled_features_.Add(kFeature_memory64);
+  }
+
   bool is_memory64() const { return GetParam() == kMemory64; }
 };
 
@@ -5225,28 +5270,60 @@ TEST_P(FunctionBodyDecoderTestOnBothMemoryTypes, IndexTypes) {
            {WASM_STORE_MEM(MachineType::Int32(), WASM_ZERO64, WASM_ZERO)});
 }
 
-TEST_P(FunctionBodyDecoderTestOnBothMemoryTypes, 64BitOffset) {
-  builder.InitializeMemory(GetParam());
-  // Macro for defining a zero constant of the right type. Explicitly use
-  // {uint8_t} to make MSVC happy.
-#define ZERO_FOR_TYPE \
-  WASM_SEQ(is_memory64() ? uint8_t{kExprI64Const} : uint8_t{kExprI32Const}, 0)
-  // Offset is zero encoded in 5 bytes (works always).
+TEST_P(FunctionBodyDecoderTestOnBothMemoryTypes, 64BitOffsetOnMemory32) {
+  // Check that with memory64 enabled, the offset is always decoded as u64, even
+  // if the memory is declared as 32-bit memory.
+  builder.InitializeMemory(kMemory32);
+  // Offset is zero encoded in 5 bytes (always works).
+  Validate(true, sigs.i_v(),
+           {WASM_LOAD_MEM_OFFSET(MachineType::Int32(), U64V_5(0), WASM_ZERO)});
+  // Offset is zero encoded in 6 bytes (works if memory64 is enabled).
+  Validate(is_memory64(), sigs.i_v(),
+           {WASM_LOAD_MEM_OFFSET(MachineType::Int32(), U64V_6(0), WASM_ZERO)});
+  // Same with store.
+  Validate(true, sigs.v_v(),
+           {WASM_STORE_MEM_OFFSET(MachineType::Int32(), U64V_5(0), WASM_ZERO,
+                                  WASM_ZERO)});
+  Validate(is_memory64(), sigs.v_v(),
+           {WASM_STORE_MEM_OFFSET(MachineType::Int32(), U64V_6(0), WASM_ZERO,
+                                  WASM_ZERO)});
+  // Offset is 2^32+2 (fails validation on memory32).
+  Validate(false, sigs.i_v(),
+           {WASM_LOAD_MEM_OFFSET(MachineType::Int32(),
+                                 U64V_6((uint64_t{1} << 32) + 2), WASM_ZERO)});
+  Validate(false, sigs.v_v(),
+           {WASM_STORE_MEM_OFFSET(MachineType::Int32(),
+                                  U64V_6((uint64_t{1} << 32) + 2), WASM_ZERO,
+                                  WASM_ZERO)});
+}
+
+TEST_P(FunctionBodyDecoderTestOnBothMemoryTypes, 64BitOffsetOnMemory64) {
+  // Same as above, but on a 64-bit memory.
+  builder.InitializeMemory(kMemory64);
+  // Offset is zero encoded in 5 bytes.
   Validate(
       true, sigs.i_v(),
-      {WASM_LOAD_MEM_OFFSET(MachineType::Int32(), U64V_5(0), ZERO_FOR_TYPE)});
-  // Offset is zero encoded in 6 bytes (works only in memory64).
+      {WASM_LOAD_MEM_OFFSET(MachineType::Int32(), U64V_5(0), WASM_ZERO64)});
+  // Offset is zero encoded in 6 bytes (works if memory64 is enabled).
   Validate(
       is_memory64(), sigs.i_v(),
-      {WASM_LOAD_MEM_OFFSET(MachineType::Int32(), U64V_6(0), ZERO_FOR_TYPE)});
+      {WASM_LOAD_MEM_OFFSET(MachineType::Int32(), U64V_6(0), WASM_ZERO64)});
   // Same with store.
   Validate(true, sigs.v_v(),
-           {WASM_STORE_MEM_OFFSET(MachineType::Int32(), U64V_5(0),
-                                  ZERO_FOR_TYPE, WASM_ZERO)});
+           {WASM_STORE_MEM_OFFSET(MachineType::Int32(), U64V_5(0), WASM_ZERO64,
+                                  WASM_ZERO)});
   Validate(is_memory64(), sigs.v_v(),
-           {WASM_STORE_MEM_OFFSET(MachineType::Int32(), U64V_6(0),
-                                  ZERO_FOR_TYPE, WASM_ZERO)});
-#undef ZERO_FOR_TYPE
+           {WASM_STORE_MEM_OFFSET(MachineType::Int32(), U64V_6(0), WASM_ZERO64,
+                                  WASM_ZERO)});
+  // Offset is 2^32+2 (validates on memory64).
+  Validate(
+      is_memory64(), sigs.i_v(),
+      {WASM_LOAD_MEM_OFFSET(MachineType::Int32(),
+                            U64V_6((uint64_t{1} << 32) + 2), WASM_ZERO64)});
+  Validate(is_memory64(), sigs.v_v(),
+           {WASM_STORE_MEM_OFFSET(MachineType::Int32(),
+                                  U64V_6((uint64_t{1} << 32) + 2), WASM_ZERO64,
+                                  WASM_ZERO)});
 }
 
 TEST_P(FunctionBodyDecoderTestOnBothMemoryTypes, MemorySize) {
@@ -5272,6 +5349,51 @@ TEST_P(FunctionBodyDecoderTestOnBothMemoryTypes, MemoryGrow) {
   ExpectFailure(&sig_i_l, {WASM_MEMORY_GROW(WASM_LOCAL_GET(0))});
 }
 
+/*******************************************************************************
+ * Multi-memory tests.
+ ******************************************************************************/
+
+enum MultiMemoryEnabled : bool { kMultiMemory = true, kNoMultiMemory = false };
+
+class FunctionBodyDecoderTestWithMultiMemory
+    : public FunctionBodyDecoderTestBase<WithDefaultPlatformMixin<
+          ::testing::TestWithParam<MultiMemoryEnabled>>> {
+ public:
+  FunctionBodyDecoderTestWithMultiMemory() {
+    if (is_multi_memory_enabled()) enabled_features_.Add(kFeature_multi_memory);
+  }
+
+  bool is_multi_memory_enabled() const { return GetParam(); }
+};
+
+std::string PrintMultiMemoryEnabled(
+    ::testing::TestParamInfo<MultiMemoryEnabled> info) {
+  return info.param ? "kMultiMemory" : "kNoMultiMemory";
+}
+
+INSTANTIATE_TEST_SUITE_P(MultiMemory, FunctionBodyDecoderTestWithMultiMemory,
+                         ::testing::Values(kMultiMemory, kNoMultiMemory),
+                         PrintMultiMemoryEnabled);
+
+TEST_P(FunctionBodyDecoderTestWithMultiMemory, ExtendedMemoryAccessImmediate) {
+  builder.InitializeMemory();
+  // The memory index can be encoded in a separate field, after a 0x40
+  // alignment. For now, only memory index 0 is allowed.
+  // TODO(clemensb): Extend this test once the {TestModuleBuilder} supports more
+  // than one memory.
+  Validate(is_multi_memory_enabled(), sigs.i_v(),
+           {WASM_ZERO, kExprI32LoadMem, 0x40 /* alignment */,
+            0 /* memory index */, 0 /* offset */});
+  // The memory index is LEB-encoded, so index 0 can also be store in 5 bytes.
+  Validate(is_multi_memory_enabled(), sigs.i_v(),
+           {WASM_ZERO, kExprI32LoadMem, 0x40 /* alignment */,
+            U32V_5(0) /* memory index */, 0 /* offset */});
+  // Memory index 1 is invalid.
+  Validate(false, sigs.i_v(),
+           {WASM_ZERO, kExprI32LoadMem, 0x40 /* alignment */,
+            1 /* memory index */, 0 /* offset */});
+}
+
 #undef B1
 #undef B2
 #undef B3
@@ -5280,7 +5402,4 @@ TEST_P(FunctionBodyDecoderTestOnBothMemoryTypes, MemoryGrow) {
 #undef WASM_BRV_IF_ZERO
 #undef EXPECT_OK
 
-}  // namespace function_body_decoder_unittest
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
diff --git a/deps/v8/test/unittests/wasm/leb-helper-unittest.cc b/deps/v8/test/unittests/wasm/leb-helper-unittest.cc
index 71faa6f3d5ba05..ae1235723d8f17 100644
--- a/deps/v8/test/unittests/wasm/leb-helper-unittest.cc
+++ b/deps/v8/test/unittests/wasm/leb-helper-unittest.cc
@@ -91,8 +91,8 @@ TEST_F(LEBHelperTest, sizeof_i32v) {
 #define DECLARE_ENCODE_DECODE_CHECKER(ctype, name)                         \
   static void CheckEncodeDecode_##name(ctype val) {                        \
     static const int kSize = 16;                                           \
-    static byte buffer[kSize];                                             \
-    byte* ptr = buffer;                                                    \
+    static uint8_t buffer[kSize];                                          \
+    uint8_t* ptr = buffer;                                                 \
     LEBHelper::write_##name(&ptr, val);                                    \
     EXPECT_EQ(LEBHelper::sizeof_##name(val),                               \
               static_cast<size_t>(ptr - buffer));                          \
diff --git a/deps/v8/test/unittests/wasm/loop-assignment-analysis-unittest.cc b/deps/v8/test/unittests/wasm/loop-assignment-analysis-unittest.cc
index 2e7c75c1c94d80..dc78524e7803a9 100644
--- a/deps/v8/test/unittests/wasm/loop-assignment-analysis-unittest.cc
+++ b/deps/v8/test/unittests/wasm/loop-assignment-analysis-unittest.cc
@@ -26,7 +26,7 @@ class WasmLoopAssignmentAnalyzerTest : public TestWithZone {
   TestSignatures sigs;
   uint32_t num_locals;
 
-  BitVector* Analyze(const byte* start, const byte* end,
+  BitVector* Analyze(const uint8_t* start, const uint8_t* end,
                      bool* loop_is_innermost = nullptr) {
     return AnalyzeLoopAssignmentForTesting(zone(), num_locals, start, end,
                                            loop_is_innermost);
@@ -34,13 +34,13 @@ class WasmLoopAssignmentAnalyzerTest : public TestWithZone {
 };
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, Empty0) {
-  byte code[] = { 0 };
+  uint8_t code[] = {0};
   BitVector* assigned = Analyze(code, code);
   EXPECT_EQ(assigned, nullptr);
 }
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, Empty1) {
-  byte code[] = {kExprLoop, kVoidCode, 0};
+  uint8_t code[] = {kExprLoop, kVoidCode, 0};
   for (int i = 0; i < 5; i++) {
     BitVector* assigned = Analyze(code, code + arraysize(code));
     for (int j = 0; j < assigned->length(); j++) {
@@ -53,7 +53,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, Empty1) {
 TEST_F(WasmLoopAssignmentAnalyzerTest, One) {
   num_locals = 5;
   for (int i = 0; i < 5; i++) {
-    byte code[] = {WASM_LOOP(WASM_SET_ZERO(i))};
+    uint8_t code[] = {WASM_LOOP(WASM_SET_ZERO(i))};
     BitVector* assigned = Analyze(code, code + arraysize(code));
     for (int j = 0; j < assigned->length(); j++) {
       EXPECT_EQ(j == i, assigned->Contains(j));
@@ -64,7 +64,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, One) {
 TEST_F(WasmLoopAssignmentAnalyzerTest, TeeOne) {
   num_locals = 5;
   for (int i = 0; i < 5; i++) {
-    byte code[] = {WASM_LOOP(WASM_LOCAL_TEE(i, WASM_ZERO))};
+    uint8_t code[] = {WASM_LOOP(WASM_LOCAL_TEE(i, WASM_ZERO))};
     BitVector* assigned = Analyze(code, code + arraysize(code));
     for (int j = 0; j < assigned->length(); j++) {
       EXPECT_EQ(j == i, assigned->Contains(j));
@@ -75,7 +75,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, TeeOne) {
 TEST_F(WasmLoopAssignmentAnalyzerTest, OneBeyond) {
   num_locals = 5;
   for (int i = 0; i < 5; i++) {
-    byte code[] = {WASM_LOOP(WASM_SET_ZERO(i)), WASM_SET_ZERO(1)};
+    uint8_t code[] = {WASM_LOOP(WASM_SET_ZERO(i)), WASM_SET_ZERO(1)};
     BitVector* assigned = Analyze(code, code + arraysize(code));
     for (int j = 0; j < assigned->length(); j++) {
       EXPECT_EQ(j == i, assigned->Contains(j));
@@ -87,7 +87,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, Two) {
   num_locals = 5;
   for (int i = 0; i < 5; i++) {
     for (int j = 0; j < 5; j++) {
-      byte code[] = {WASM_LOOP(WASM_SET_ZERO(i), WASM_SET_ZERO(j))};
+      uint8_t code[] = {WASM_LOOP(WASM_SET_ZERO(i), WASM_SET_ZERO(j))};
       BitVector* assigned = Analyze(code, code + arraysize(code));
       for (int k = 0; k < assigned->length(); k++) {
         bool expected = k == i || k == j;
@@ -100,7 +100,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, Two) {
 TEST_F(WasmLoopAssignmentAnalyzerTest, NestedIf) {
   num_locals = 5;
   for (int i = 0; i < 5; i++) {
-    byte code[] = {WASM_LOOP(
+    uint8_t code[] = {WASM_LOOP(
         WASM_IF_ELSE(WASM_SET_ZERO(0), WASM_SET_ZERO(i), WASM_SET_ZERO(1)))};
     BitVector* assigned = Analyze(code, code + arraysize(code));
     for (int j = 0; j < assigned->length(); j++) {
@@ -113,7 +113,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, NestedIf) {
 TEST_F(WasmLoopAssignmentAnalyzerTest, BigLocal) {
   num_locals = 65000;
   for (int i = 13; i < 65000; i = static_cast<int>(i * 1.5)) {
-    byte code[] = {WASM_LOOP(WASM_I32V_1(11), kExprLocalSet, U32V_3(i))};
+    uint8_t code[] = {WASM_LOOP(WASM_I32V_1(11), kExprLocalSet, U32V_3(i))};
 
     BitVector* assigned = Analyze(code, code + arraysize(code));
     for (int j = 0; j < assigned->length(); j++) {
@@ -125,7 +125,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, BigLocal) {
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, Break) {
   num_locals = 3;
-  byte code[] = {
+  uint8_t code[] = {
       WASM_LOOP(WASM_IF(WASM_LOCAL_GET(0), WASM_BRV(1, WASM_SET_ZERO(1)))),
       WASM_SET_ZERO(0)};
 
@@ -138,7 +138,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, Break) {
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, Loop1) {
   num_locals = 5;
-  byte code[] = {
+  uint8_t code[] = {
       WASM_LOOP(WASM_IF(
           WASM_LOCAL_GET(0),
           WASM_BRV(0, WASM_LOCAL_SET(3, WASM_I32_SUB(WASM_LOCAL_GET(0),
@@ -154,10 +154,10 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, Loop1) {
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, Loop2) {
   num_locals = 6;
-  const byte kIter = 0;
-  const byte kSum = 3;
+  const uint8_t kIter = 0;
+  const uint8_t kSum = 3;
 
-  byte code[] = {WASM_BLOCK(
+  uint8_t code[] = {WASM_BLOCK(
       WASM_WHILE(
           WASM_LOCAL_GET(kIter),
           WASM_BLOCK(
@@ -179,7 +179,7 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, Loop2) {
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, NestedLoop) {
   num_locals = 5;
-  byte code[] = {WASM_LOOP(WASM_LOOP(WASM_LOCAL_SET(0, 1)))};
+  uint8_t code[] = {WASM_LOOP(WASM_LOOP(WASM_LOCAL_SET(0, 1)))};
 
   bool outer_is_innermost = false;
   BitVector* outer_assigned =
@@ -201,21 +201,21 @@ TEST_F(WasmLoopAssignmentAnalyzerTest, NestedLoop) {
 }
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, Malformed) {
-  byte code[] = {kExprLoop, kVoidCode, kExprF32Neg, kExprBrTable, 0x0E, 'h',
-                 'e',       'l',       'l',         'o',          ',',  ' ',
-                 'w',       'o',       'r',         'l',          'd',  '!'};
+  uint8_t code[] = {kExprLoop, kVoidCode, kExprF32Neg, kExprBrTable, 0x0E, 'h',
+                    'e',       'l',       'l',         'o',          ',',  ' ',
+                    'w',       'o',       'r',         'l',          'd',  '!'};
   BitVector* assigned = Analyze(code, code + arraysize(code));
   EXPECT_EQ(assigned, nullptr);
 }
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, InvalidOpcode) {
-  byte code[] = {WASM_LOOP(0xFF)};
+  uint8_t code[] = {WASM_LOOP(0xFF)};
   BitVector* assigned = Analyze(code, code + arraysize(code));
   EXPECT_EQ(assigned, nullptr);
 }
 
 TEST_F(WasmLoopAssignmentAnalyzerTest, regress_642867) {
-  static const byte code[] = {
+  static const uint8_t code[] = {
       WASM_LOOP(WASM_ZERO, kExprLocalSet, 0xFA, 0xFF, 0xFF, 0xFF,
                 0x0F)};  // local index LEB128 0xFFFFFFFA
   // Just make sure that the analysis does not crash.
diff --git a/deps/v8/test/unittests/wasm/memory-protection-unittest.cc b/deps/v8/test/unittests/wasm/memory-protection-unittest.cc
index 120197bba0da29..160f81a361b117 100644
--- a/deps/v8/test/unittests/wasm/memory-protection-unittest.cc
+++ b/deps/v8/test/unittests/wasm/memory-protection-unittest.cc
@@ -42,7 +42,7 @@ class MemoryProtectionTest : public TestWithNativeContext {
   void Initialize(MemoryProtectionMode mode) {
     v8_flags.wasm_lazy_compilation = false;
     mode_ = mode;
-    v8_flags.wasm_memory_protection_keys = (mode == kPku);
+    v8_flags.memory_protection_keys = (mode == kPku);
     // The key is initially write-protected.
     CHECK_IMPLIES(WasmCodeManager::HasMemoryProtectionKeySupport(),
                   !WasmCodeManager::MemoryProtectionKeyWritable());
@@ -88,7 +88,7 @@ class MemoryProtectionTest : public TestWithNativeContext {
  private:
   std::shared_ptr<NativeModule> CompileNativeModule() {
     // Define the bytes for a module with a single empty function.
-    static const byte module_bytes[] = {
+    static const uint8_t module_bytes[] = {
         WASM_MODULE_HEADER, SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_v_v),
         SECTION(Function, ENTRY_COUNT(1), SIG_INDEX(0)),
         SECTION(Code, ENTRY_COUNT(1), ADD_COUNT(0 /* locals */, kExprEnd))};
@@ -140,14 +140,14 @@ TEST_P(ParameterizedMemoryProtectionTest, CodeNotWritableAfterCompilation) {
 
 TEST_P(ParameterizedMemoryProtectionTest, CodeWritableWithinScope) {
   CompileModule();
-  CodeSpaceWriteScope write_scope(native_module());
+  CodeSpaceWriteScope write_scope;
   WriteToCode();
 }
 
 TEST_P(ParameterizedMemoryProtectionTest, CodeNotWritableAfterScope) {
   CompileModule();
   {
-    CodeSpaceWriteScope write_scope(native_module());
+    CodeSpaceWriteScope write_scope;
     WriteToCode();
   }
   AssertCodeEventuallyProtected();
@@ -274,7 +274,7 @@ TEST_P(ParameterizedMemoryProtectionTestWithSignalHandling, TestSignalHandler) {
     ASSERT_DEATH(
         {
           base::Optional<CodeSpaceWriteScope> write_scope;
-          if (open_write_scope) write_scope.emplace(native_module());
+          if (open_write_scope) write_scope.emplace();
           pthread_kill(pthread_self(), SIGPROF);
           base::OS::Sleep(base::TimeDelta::FromMilliseconds(10));
         },
@@ -294,7 +294,7 @@ TEST_P(ParameterizedMemoryProtectionTestWithSignalHandling, TestSignalHandler) {
 #endif  // GTEST_HAS_DEATH_TEST
   } else {
     base::Optional<CodeSpaceWriteScope> write_scope;
-    if (open_write_scope) write_scope.emplace(native_module());
+    if (open_write_scope) write_scope.emplace();
     // The signal handler does not write or code is not protected, hence this
     // should succeed.
     pthread_kill(pthread_self(), SIGPROF);
diff --git a/deps/v8/test/unittests/wasm/module-decoder-memory64-unittest.cc b/deps/v8/test/unittests/wasm/module-decoder-memory64-unittest.cc
index 53bb240d646fec..e43caf3381cf57 100644
--- a/deps/v8/test/unittests/wasm/module-decoder-memory64-unittest.cc
+++ b/deps/v8/test/unittests/wasm/module-decoder-memory64-unittest.cc
@@ -10,68 +10,67 @@
 #include "test/common/wasm/wasm-macro-gen.h"
 #include "test/unittests/test-utils.h"
 
-namespace v8 {
-namespace internal {
-namespace wasm {
-namespace module_decoder_unittest {
-
-#define EXPECT_OK(result)                                        \
-  do {                                                           \
-    if (!result.ok()) {                                          \
-      GTEST_NONFATAL_FAILURE_(result.error().message().c_str()); \
-      return;                                                    \
-    }                                                            \
-  } while (false)
+namespace v8::internal::wasm {
 
 class Memory64DecodingTest : public TestWithIsolateAndZone {
  public:
-  ModuleResult DecodeModule(std::initializer_list<uint8_t> module_body_bytes) {
+  std::shared_ptr<const WasmModule> DecodeModule(
+      std::initializer_list<uint8_t> module_body_bytes) {
     // Add the wasm magic and version number automatically.
     std::vector<uint8_t> module_bytes{WASM_MODULE_HEADER};
     module_bytes.insert(module_bytes.end(), module_body_bytes);
     static constexpr WasmFeatures kEnabledFeatures{
         WasmFeature::kFeature_memory64};
-    return DecodeWasmModule(kEnabledFeatures, base::VectorOf(module_bytes),
-                            false, kWasmOrigin);
+    bool kValidateFunctions = true;
+    ModuleResult result =
+        DecodeWasmModule(kEnabledFeatures, base::VectorOf(module_bytes),
+                         kValidateFunctions, kWasmOrigin);
+    EXPECT_TRUE(result.ok()) << result.error().message();
+    return result.ok() ? std::move(result).value() : nullptr;
   }
 };
 
 TEST_F(Memory64DecodingTest, MemoryLimitLEB64) {
   // 2 bytes LEB (32-bit range), no maximum.
-  ModuleResult result = DecodeModule(
+  auto module = DecodeModule(
       {SECTION(Memory, ENTRY_COUNT(1), kMemory64NoMaximum, U32V_2(5))});
-  EXPECT_OK(result);
-  EXPECT_EQ(5u, result.value()->initial_pages);
-  EXPECT_EQ(false, result.value()->has_maximum_pages);
+  ASSERT_NE(nullptr, module);
+  ASSERT_EQ(1u, module->memories.size());
+  const WasmMemory* memory = &module->memories[0];
+  EXPECT_EQ(5u, memory->initial_pages);
+  EXPECT_EQ(false, memory->has_maximum_pages);
 
   // 2 bytes LEB (32-bit range), with maximum.
-  result = DecodeModule({SECTION(Memory, ENTRY_COUNT(1), kMemory64WithMaximum,
+  module = DecodeModule({SECTION(Memory, ENTRY_COUNT(1), kMemory64WithMaximum,
                                  U32V_2(7), U32V_2(47))});
-  EXPECT_OK(result);
-  EXPECT_EQ(7u, result.value()->initial_pages);
-  EXPECT_EQ(true, result.value()->has_maximum_pages);
-  EXPECT_EQ(47u, result.value()->maximum_pages);
+  ASSERT_NE(nullptr, module);
+  ASSERT_EQ(1u, module->memories.size());
+  memory = &module->memories[0];
+  EXPECT_EQ(7u, memory->initial_pages);
+  EXPECT_EQ(true, memory->has_maximum_pages);
+  EXPECT_EQ(47u, memory->maximum_pages);
 
   // 10 bytes LEB, 32-bit range, no maximum.
-  result = DecodeModule(
+  module = DecodeModule(
       {SECTION(Memory, ENTRY_COUNT(1), kMemory64NoMaximum, U64V_10(2))});
-  EXPECT_OK(result);
-  EXPECT_EQ(2u, result.value()->initial_pages);
-  EXPECT_EQ(false, result.value()->has_maximum_pages);
+  ASSERT_NE(nullptr, module);
+  ASSERT_EQ(1u, module->memories.size());
+  memory = &module->memories[0];
+  EXPECT_EQ(2u, memory->initial_pages);
+  EXPECT_EQ(false, memory->has_maximum_pages);
 
   // 10 bytes LEB, 32-bit range, with maximum.
-  result = DecodeModule({SECTION(Memory, ENTRY_COUNT(1), kMemory64WithMaximum,
+  module = DecodeModule({SECTION(Memory, ENTRY_COUNT(1), kMemory64WithMaximum,
                                  U64V_10(2), U64V_10(6))});
-  EXPECT_OK(result);
-  EXPECT_EQ(2u, result.value()->initial_pages);
-  EXPECT_EQ(true, result.value()->has_maximum_pages);
-  EXPECT_EQ(6u, result.value()->maximum_pages);
+  ASSERT_NE(nullptr, module);
+  ASSERT_EQ(1u, module->memories.size());
+  memory = &module->memories[0];
+  EXPECT_EQ(2u, memory->initial_pages);
+  EXPECT_EQ(true, memory->has_maximum_pages);
+  EXPECT_EQ(6u, memory->maximum_pages);
 
   // TODO(clemensb): Test numbers outside the 32-bit range once that's
   // supported.
 }
 
-}  // namespace module_decoder_unittest
-}  // namespace wasm
-}  // namespace internal
-}  // namespace v8
+}  // namespace v8::internal::wasm
diff --git a/deps/v8/test/unittests/wasm/module-decoder-unittest.cc b/deps/v8/test/unittests/wasm/module-decoder-unittest.cc
index 9b1d6761218fe1..cfb0c910a32350 100644
--- a/deps/v8/test/unittests/wasm/module-decoder-unittest.cc
+++ b/deps/v8/test/unittests/wasm/module-decoder-unittest.cc
@@ -203,9 +203,9 @@ class WasmModuleVerifyTest : public TestWithIsolateAndZone {
   ModuleResult DecodeModule(base::Vector<const uint8_t> module_bytes) {
     // Add the wasm magic and version number automatically.
     size_t size = module_bytes.size();
-    byte header[] = {WASM_MODULE_HEADER};
+    uint8_t header[] = {WASM_MODULE_HEADER};
     size_t total = sizeof(header) + size;
-    auto temp = new byte[total];
+    auto temp = new uint8_t[total];
     memcpy(temp, header, sizeof(header));
     if (size > 0) {
       memcpy(temp + sizeof(header), module_bytes.begin(), size);
@@ -222,7 +222,7 @@ class WasmModuleVerifyTest : public TestWithIsolateAndZone {
 
 TEST_F(WasmModuleVerifyTest, WrongMagic) {
   for (uint32_t x = 1; x; x <<= 1) {
-    const byte data[] = {U32_LE(kWasmMagic ^ x), U32_LE(kWasmVersion)};
+    const uint8_t data[] = {U32_LE(kWasmMagic ^ x), U32_LE(kWasmVersion)};
     ModuleResult result = DecodeModuleNoHeader(base::ArrayVector(data));
     EXPECT_FALSE(result.ok());
   }
@@ -230,15 +230,15 @@ TEST_F(WasmModuleVerifyTest, WrongMagic) {
 
 TEST_F(WasmModuleVerifyTest, WrongVersion) {
   for (uint32_t x = 1; x; x <<= 1) {
-    const byte data[] = {U32_LE(kWasmMagic), U32_LE(kWasmVersion ^ x)};
+    const uint8_t data[] = {U32_LE(kWasmMagic), U32_LE(kWasmVersion ^ x)};
     ModuleResult result = DecodeModuleNoHeader(base::ArrayVector(data));
     EXPECT_FALSE(result.ok());
   }
 }
 
 TEST_F(WasmModuleVerifyTest, WrongSection) {
-  constexpr byte kInvalidSection = 0x1c;
-  const byte data[] = {kInvalidSection, 0};
+  constexpr uint8_t kInvalidSection = 0x1c;
+  const uint8_t data[] = {kInvalidSection, 0};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_FALSE(result.ok());
 }
@@ -249,7 +249,7 @@ TEST_F(WasmModuleVerifyTest, DecodeEmpty) {
 }
 
 TEST_F(WasmModuleVerifyTest, OneGlobal) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Global,                     // --
               ENTRY_COUNT(1),             // --
               kI32Code,                   // local type
@@ -279,11 +279,12 @@ TEST_F(WasmModuleVerifyTest, S128Global) {
   WASM_FEATURE_SCOPE(simd);
   std::array<uint8_t, kSimd128Size> v = {1, 2,  3,  4,  5,  6,  7, 8,
                                          9, 10, 11, 12, 13, 14, 15};
-  static const byte data[] = {SECTION(Global,          // --
-                                      ENTRY_COUNT(1),  // --
-                                      kS128Code,       // memory type
-                                      0,               // immutable
-                                      WASM_SIMD_CONSTANT(v.data()), kExprEnd)};
+  static const uint8_t data[] = {SECTION(Global,          // --
+                                         ENTRY_COUNT(1),  // --
+                                         kS128Code,       // memory type
+                                         0,               // immutable
+                                         WASM_SIMD_CONSTANT(v.data()),
+                                         kExprEnd)};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   if (!CheckHardwareSupportsSimd()) {
     EXPECT_NOT_OK(result, "Wasm SIMD unsupported");
@@ -297,7 +298,7 @@ TEST_F(WasmModuleVerifyTest, S128Global) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExternRefGlobal) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -341,7 +342,7 @@ TEST_F(WasmModuleVerifyTest, ExternRefGlobal) {
 }
 
 TEST_F(WasmModuleVerifyTest, FuncRefGlobal) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -384,7 +385,7 @@ TEST_F(WasmModuleVerifyTest, FuncRefGlobal) {
 }
 
 TEST_F(WasmModuleVerifyTest, InvalidFuncRefGlobal) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -399,7 +400,7 @@ TEST_F(WasmModuleVerifyTest, InvalidFuncRefGlobal) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExternRefGlobalWithGlobalInit) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Import,           // --
               ENTRY_COUNT(1),   // number of imports
               ADD_COUNT('m'),   // module name
@@ -430,7 +431,7 @@ TEST_F(WasmModuleVerifyTest, ExternRefGlobalWithGlobalInit) {
 }
 
 TEST_F(WasmModuleVerifyTest, NullGlobalWithGlobalInit) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Import,           // --
               ENTRY_COUNT(1),   // number of imports
               ADD_COUNT('m'),   // module name
@@ -462,7 +463,7 @@ TEST_F(WasmModuleVerifyTest, NullGlobalWithGlobalInit) {
 }
 
 TEST_F(WasmModuleVerifyTest, GlobalInvalidType) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Global,                      // --
               ENTRY_COUNT(1),              // --
               64,                          // invalid value type
@@ -474,7 +475,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInvalidType) {
 }
 
 TEST_F(WasmModuleVerifyTest, GlobalInvalidType2) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Global,                      // --
               ENTRY_COUNT(1),              // --
               kVoidCode,                   // invalid value type
@@ -486,7 +487,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInvalidType2) {
 }
 
 TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
-  static const byte no_initializer_no_end[] = {
+  static const uint8_t no_initializer_no_end[] = {
       SECTION(Global,          //--
               ENTRY_COUNT(1),  //--
               kI32Code,        // type
@@ -494,7 +495,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
   };
   EXPECT_FAILURE_WITH_MSG(no_initializer_no_end, "Beyond end of code");
 
-  static const byte no_initializer[] = {
+  static const uint8_t no_initializer[] = {
       SECTION(Global,          //--
               ENTRY_COUNT(1),  //--
               kI32Code,        // type
@@ -505,7 +506,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
       no_initializer,
       "expected 1 elements on the stack for constant expression, found 0");
 
-  static const byte too_many_initializers_no_end[] = {
+  static const uint8_t too_many_initializers_no_end[] = {
       SECTION(Global,           // --
               ENTRY_COUNT(1),   // --
               kI32Code,         // type
@@ -516,7 +517,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
   EXPECT_FAILURE_WITH_MSG(too_many_initializers_no_end,
                           "constant expression is missing 'end'");
 
-  static const byte too_many_initializers[] = {
+  static const uint8_t too_many_initializers[] = {
       SECTION(Global,           // --
               ENTRY_COUNT(1),   // --
               kI32Code,         // type
@@ -528,7 +529,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
       too_many_initializers,
       "expected 1 elements on the stack for constant expression, found 2");
 
-  static const byte missing_end_opcode[] = {
+  static const uint8_t missing_end_opcode[] = {
       SECTION(Global,           // --
               ENTRY_COUNT(1),   // --
               kI32Code,         // type
@@ -538,7 +539,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
   EXPECT_FAILURE_WITH_MSG(missing_end_opcode,
                           "constant expression is missing 'end'");
 
-  static const byte referencing_out_of_bounds_global[] = {
+  static const uint8_t referencing_out_of_bounds_global[] = {
       SECTION(Global, ENTRY_COUNT(1),         // --
               kI32Code,                       // type
               1,                              // mutable
@@ -547,7 +548,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
   EXPECT_FAILURE_WITH_MSG(referencing_out_of_bounds_global,
                           "Invalid global index: 42");
 
-  static const byte referencing_undefined_global[] = {
+  static const uint8_t referencing_undefined_global[] = {
       SECTION(Global, ENTRY_COUNT(2),        // --
               kI32Code,                      // type
               0,                             // mutable
@@ -562,7 +563,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
   {
     WASM_FEATURE_SCOPE(typed_funcref);
     WASM_FEATURE_SCOPE(gc);
-    static const byte referencing_undefined_global_nested[] = {
+    static const uint8_t referencing_undefined_global_nested[] = {
         SECTION(Type, ENTRY_COUNT(1), WASM_ARRAY_DEF(kI32Code, true)),
         SECTION(Global, ENTRY_COUNT(2),                      // --
                 kRefCode, 0,                                 // type
@@ -578,7 +579,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
                             "Invalid global index: 1");
   }
 
-  static const byte referencing_mutable_global[] = {
+  static const uint8_t referencing_mutable_global[] = {
       SECTION(Global, ENTRY_COUNT(2),        // --
               kI32Code,                      // type
               1,                             // mutable
@@ -591,7 +592,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
       referencing_mutable_global,
       "mutable globals cannot be used in constant expressions");
 
-  static const byte referencing_mutable_imported_global[] = {
+  static const uint8_t referencing_mutable_imported_global[] = {
       SECTION(Import, ENTRY_COUNT(1),          // --
               ADD_COUNT('m'), ADD_COUNT('n'),  // module, name
               kExternalGlobal,                 // --
@@ -606,7 +607,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
       referencing_mutable_imported_global,
       "mutable globals cannot be used in constant expressions");
 
-  static const byte referencing_immutable_imported_global[] = {
+  static const uint8_t referencing_immutable_imported_global[] = {
       SECTION(Import, ENTRY_COUNT(1),          // --
               ADD_COUNT('m'), ADD_COUNT('n'),  // module, name
               kExternalGlobal,                 // --
@@ -619,7 +620,7 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
   };
   EXPECT_VERIFIES(referencing_immutable_imported_global);
 
-  static const byte referencing_local_global[] = {
+  static const uint8_t referencing_local_global[] = {
       SECTION(Global, ENTRY_COUNT(2),        // --
               kI32Code,                      // type
               0,                             // mutable
@@ -645,14 +646,14 @@ TEST_F(WasmModuleVerifyTest, GlobalInitializer) {
 }
 
 TEST_F(WasmModuleVerifyTest, ZeroGlobals) {
-  static const byte data[] = {SECTION(Global, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Global, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_OK(result);
 }
 
 TEST_F(WasmModuleVerifyTest, ExportMutableGlobal) {
   {
-    static const byte data[] = {
+    static const uint8_t data[] = {
         SECTION(Global,                         // --
                 ENTRY_COUNT(1),                 // --
                 kI32Code,                       // local type
@@ -667,7 +668,7 @@ TEST_F(WasmModuleVerifyTest, ExportMutableGlobal) {
     EXPECT_VERIFIES(data);
   }
   {
-    static const byte data[] = {
+    static const uint8_t data[] = {
         SECTION(Global,                         // --
                 ENTRY_COUNT(1),                 // --
                 kI32Code,                       // local type
@@ -683,31 +684,31 @@ TEST_F(WasmModuleVerifyTest, ExportMutableGlobal) {
   }
 }
 
-static void AppendUint32v(std::vector<byte>* buffer, uint32_t val) {
+static void AppendUint32v(std::vector<uint8_t>* buffer, uint32_t val) {
   while (true) {
     uint32_t next = val >> 7;
     uint32_t out = val & 0x7F;
     if (next) {
-      buffer->push_back(static_cast<byte>(0x80 | out));
+      buffer->push_back(static_cast<uint8_t>(0x80 | out));
       val = next;
     } else {
-      buffer->push_back(static_cast<byte>(out));
+      buffer->push_back(static_cast<uint8_t>(out));
       break;
     }
   }
 }
 
 TEST_F(WasmModuleVerifyTest, NGlobals) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       kF32Code,                 // memory type
       0,                        // immutable
       WASM_INIT_EXPR_F32(7.7),  // init
   };
 
   for (uint32_t i = 0; i < kV8MaxWasmGlobals; i = i * 13 + 1) {
-    std::vector<byte> buffer;
+    std::vector<uint8_t> buffer;
     size_t size = SizeOfVarInt(i) + i * sizeof(data);
-    const byte globals[] = {kGlobalSectionCode, U32V_5(size)};
+    const uint8_t globals[] = {kGlobalSectionCode, U32V_5(size)};
     for (size_t g = 0; g != sizeof(globals); ++g) {
       buffer.push_back(globals[g]);
     }
@@ -722,14 +723,14 @@ TEST_F(WasmModuleVerifyTest, NGlobals) {
 }
 
 TEST_F(WasmModuleVerifyTest, TwoGlobals) {
-  static const byte data[] = {SECTION(Global,                      // --
-                                      ENTRY_COUNT(2),              // --
-                                      kF32Code,                    // type
-                                      0,                           // immutable
-                                      WASM_INIT_EXPR_F32(22.0),    // --
-                                      kF64Code,                    // type
-                                      1,                           // mutable
-                                      WASM_INIT_EXPR_F64(23.0))};  // --
+  static const uint8_t data[] = {SECTION(Global,                    // --
+                                         ENTRY_COUNT(2),            // --
+                                         kF32Code,                  // type
+                                         0,                         // immutable
+                                         WASM_INIT_EXPR_F32(22.0),  // --
+                                         kF64Code,                  // type
+                                         1,                         // mutable
+                                         WASM_INIT_EXPR_F64(23.0))};  // --
 
   {
     // Should decode to exactly two globals.
@@ -756,24 +757,26 @@ TEST_F(WasmModuleVerifyTest, TwoGlobals) {
 }
 
 TEST_F(WasmModuleVerifyTest, RefNullGlobal) {
-  static const byte data[] = {SECTION(Global, ENTRY_COUNT(1), kFuncRefCode, 1,
-                                      WASM_REF_NULL(kFuncRefCode), kExprEnd)};
+  static const uint8_t data[] = {SECTION(Global, ENTRY_COUNT(1), kFuncRefCode,
+                                         1, WASM_REF_NULL(kFuncRefCode),
+                                         kExprEnd)};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_OK(result);
 }
 
 TEST_F(WasmModuleVerifyTest, RefNullGlobalInvalid1) {
   WASM_FEATURE_SCOPE(typed_funcref);
-  static const byte data[] = {SECTION(Global, ENTRY_COUNT(1), kRefNullCode, 0,
-                                      1, WASM_REF_NULL(0), kExprEnd)};
+  static const uint8_t data[] = {SECTION(Global, ENTRY_COUNT(1), kRefNullCode,
+                                         0, 1, WASM_REF_NULL(0), kExprEnd)};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result, "Type index 0 is out of bounds");
 }
 
 TEST_F(WasmModuleVerifyTest, RefNullGlobalInvalid2) {
   WASM_FEATURE_SCOPE(typed_funcref);
-  static const byte data[] = {SECTION(Global, ENTRY_COUNT(1), kFuncRefCode, 1,
-                                      kExprRefNull, U32V_5(1000001), kExprEnd)};
+  static const uint8_t data[] = {SECTION(Global, ENTRY_COUNT(1), kFuncRefCode,
+                                         1, kExprRefNull, U32V_5(1000001),
+                                         kExprEnd)};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result,
                 "Type index 1000001 is greater than the maximum number 1000000 "
@@ -784,7 +787,7 @@ TEST_F(WasmModuleVerifyTest, StructNewInitExpr) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  static const byte basic[] = {
+  static const uint8_t basic[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               WASM_STRUCT_DEF(FIELD_COUNT(1), STRUCT_FIELD(kI32Code, true))),
       SECTION(Global, ENTRY_COUNT(1),  // --
@@ -792,7 +795,7 @@ TEST_F(WasmModuleVerifyTest, StructNewInitExpr) {
               WASM_INIT_EXPR_STRUCT_NEW(0, WASM_I32V(42)))};
   EXPECT_VERIFIES(basic);
 
-  static const byte global_args[] = {
+  static const uint8_t global_args[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               WASM_STRUCT_DEF(FIELD_COUNT(1), STRUCT_FIELD(kI32Code, true))),
       SECTION(Global, ENTRY_COUNT(2),     // --
@@ -802,7 +805,7 @@ TEST_F(WasmModuleVerifyTest, StructNewInitExpr) {
               WASM_INIT_EXPR_STRUCT_NEW(0, WASM_GLOBAL_GET(0)))};
   EXPECT_VERIFIES(global_args);
 
-  static const byte type_error[] = {
+  static const uint8_t type_error[] = {
       SECTION(Type, ENTRY_COUNT(2),  // --
               WASM_STRUCT_DEF(FIELD_COUNT(1), STRUCT_FIELD(kI32Code, true)),
               WASM_STRUCT_DEF(FIELD_COUNT(1), STRUCT_FIELD(kI64Code, true))),
@@ -818,7 +821,7 @@ TEST_F(WasmModuleVerifyTest, ArrayNewFixedInitExpr) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  static const byte basic[] = {
+  static const uint8_t basic[] = {
       SECTION(Type, ENTRY_COUNT(1), WASM_ARRAY_DEF(kI16Code, true)),
       SECTION(Global, ENTRY_COUNT(1),  // --
               kRefCode, 0, 0,          // type, mutability
@@ -826,7 +829,7 @@ TEST_F(WasmModuleVerifyTest, ArrayNewFixedInitExpr) {
                                              WASM_I32V(30)))};
   EXPECT_VERIFIES(basic);
 
-  static const byte basic_static[] = {
+  static const uint8_t basic_static[] = {
       SECTION(Type, ENTRY_COUNT(1), WASM_ARRAY_DEF(kI16Code, true)),
       SECTION(Global, ENTRY_COUNT(1),  // --
               kRefCode, 0, 0,          // type, mutability
@@ -834,7 +837,7 @@ TEST_F(WasmModuleVerifyTest, ArrayNewFixedInitExpr) {
                                              WASM_I32V(30)))};
   EXPECT_VERIFIES(basic_static);
 
-  static const byte basic_immutable[] = {
+  static const uint8_t basic_immutable[] = {
       SECTION(Type, ENTRY_COUNT(1), WASM_ARRAY_DEF(kI32Code, false)),
       SECTION(Global, ENTRY_COUNT(1),  // --
               kRefCode, 0, 0,          // type, mutability
@@ -842,7 +845,7 @@ TEST_F(WasmModuleVerifyTest, ArrayNewFixedInitExpr) {
                                              WASM_I32V(30)))};
   EXPECT_VERIFIES(basic_immutable);
 
-  static const byte type_error[] = {
+  static const uint8_t type_error[] = {
       SECTION(Type, ENTRY_COUNT(2),  // --
               WASM_ARRAY_DEF(kI32Code, true),
               WASM_ARRAY_DEF(WASM_SEQ(kRefCode, 0), true)),
@@ -853,7 +856,7 @@ TEST_F(WasmModuleVerifyTest, ArrayNewFixedInitExpr) {
       type_error,
       "type error in constant expression[0] (expected (ref 1), got (ref 0))");
 
-  static const byte subexpr_type_error[] = {
+  static const uint8_t subexpr_type_error[] = {
       SECTION(Type, ENTRY_COUNT(1), WASM_ARRAY_DEF(kI64Code, true)),
       SECTION(
           Global, ENTRY_COUNT(1),  // --
@@ -863,7 +866,7 @@ TEST_F(WasmModuleVerifyTest, ArrayNewFixedInitExpr) {
                           "array.new_fixed[1] expected type i64, found "
                           "i32.const of type i32");
 
-  static const byte length_error[] = {
+  static const uint8_t length_error[] = {
       SECTION(Type, ENTRY_COUNT(1), WASM_ARRAY_DEF(kI16Code, true)),
       SECTION(Global, ENTRY_COUNT(1),  // --
               kRefCode, 0, 0,          // type, mutability
@@ -871,15 +874,15 @@ TEST_F(WasmModuleVerifyTest, ArrayNewFixedInitExpr) {
                                              WASM_I32V(20), WASM_I32V(30)))};
   EXPECT_FAILURE_WITH_MSG(length_error,
                           "not enough arguments on the stack for "
-                          "array.new_fixed (need 11, got 4)");
+                          "array.new_fixed (need 10, got 3)");
 }
 
 TEST_F(WasmModuleVerifyTest, EmptyStruct) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte empty_struct[] = {SECTION(Type, ENTRY_COUNT(1),  // --
-                                              kWasmStructTypeCode,   // --
-                                              U32V_1(0))};  // field count
+  static const uint8_t empty_struct[] = {SECTION(Type, ENTRY_COUNT(1),  // --
+                                                 kWasmStructTypeCode,   // --
+                                                 U32V_1(0))};  // field count
 
   EXPECT_VERIFIES(empty_struct);
 }
@@ -887,7 +890,7 @@ TEST_F(WasmModuleVerifyTest, EmptyStruct) {
 TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte all_good[] = {
+  static const uint8_t all_good[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmStructTypeCode,   // --
               U32V_1(1),             // field count
@@ -895,7 +898,7 @@ TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
               1)};                   // mutability
   EXPECT_VERIFIES(all_good);
 
-  static const byte invalid_field_type[] = {
+  static const uint8_t invalid_field_type[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmStructTypeCode,   // --
               U32V_1(1),             // field count
@@ -903,7 +906,7 @@ TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
               1)};                   // mutability
   EXPECT_FAILURE_WITH_MSG(invalid_field_type, "invalid value type");
 
-  static const byte field_type_oob_ref[] = {
+  static const uint8_t field_type_oob_ref[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmStructTypeCode,   // --
               U32V_1(1),             // field count
@@ -912,7 +915,7 @@ TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
               1)};                   // mutability
   EXPECT_FAILURE_WITH_MSG(field_type_oob_ref, "Type index 3 is out of bounds");
 
-  static const byte field_type_invalid_ref[] = {
+  static const uint8_t field_type_invalid_ref[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmStructTypeCode,   // --
               U32V_1(1),             // field count
@@ -921,7 +924,7 @@ TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
               1)};                   // mutability
   EXPECT_FAILURE_WITH_MSG(field_type_invalid_ref, "greater than the maximum");
 
-  static const byte field_type_invalid_ref2[] = {
+  static const uint8_t field_type_invalid_ref2[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmStructTypeCode,   // --
               U32V_1(1),             // field count
@@ -930,7 +933,7 @@ TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
               1)};                   // mutability
   EXPECT_FAILURE_WITH_MSG(field_type_invalid_ref2, "Unknown heap type");
 
-  static const byte not_enough_field_types[] = {
+  static const uint8_t not_enough_field_types[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmStructTypeCode,   // --
               U32V_1(2),             // field count
@@ -938,7 +941,7 @@ TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
               1)};                   // mutability 1
   EXPECT_FAILURE_WITH_MSG(not_enough_field_types, "expected 1 byte");
 
-  static const byte not_enough_field_types2[] = {
+  static const uint8_t not_enough_field_types2[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmStructTypeCode,   // --
               U32V_1(2),             // field count
@@ -947,7 +950,7 @@ TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
               kI32Code)};            // field type 2
   EXPECT_FAILURE_WITH_MSG(not_enough_field_types2, "expected 1 byte");
 
-  static const byte invalid_mutability[] = {
+  static const uint8_t invalid_mutability[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmStructTypeCode,   // --
               U32V_1(1),             // field count
@@ -959,21 +962,21 @@ TEST_F(WasmModuleVerifyTest, InvalidStructTypeDef) {
 TEST_F(WasmModuleVerifyTest, InvalidArrayTypeDef) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte all_good[] = {
+  static const uint8_t all_good[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmArrayTypeCode,    // --
               kI32Code,              // perfectly valid field type
               1)};                   // mutability
   EXPECT_VERIFIES(all_good);
 
-  static const byte invalid_field_type[] = {
+  static const uint8_t invalid_field_type[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmArrayTypeCode,    // --
               kWasmArrayTypeCode,    // bogus field type
               1)};                   // mutability
   EXPECT_FAILURE_WITH_MSG(invalid_field_type, "invalid value type");
 
-  static const byte field_type_oob_ref[] = {
+  static const uint8_t field_type_oob_ref[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmArrayTypeCode,    // --
               kRefNullCode,          // field type: reference...
@@ -981,7 +984,7 @@ TEST_F(WasmModuleVerifyTest, InvalidArrayTypeDef) {
               1)};                   // mutability
   EXPECT_FAILURE_WITH_MSG(field_type_oob_ref, "Type index 3 is out of bounds");
 
-  static const byte field_type_invalid_ref[] = {
+  static const uint8_t field_type_invalid_ref[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmArrayTypeCode,    // --
               kRefNullCode,          // field type: reference...
@@ -989,7 +992,7 @@ TEST_F(WasmModuleVerifyTest, InvalidArrayTypeDef) {
               1)};                   // mutability
   EXPECT_FAILURE_WITH_MSG(field_type_invalid_ref, "Unknown heap type");
 
-  static const byte field_type_invalid_ref2[] = {
+  static const uint8_t field_type_invalid_ref2[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmArrayTypeCode,    // --
               kRefNullCode,          // field type: reference...
@@ -997,25 +1000,25 @@ TEST_F(WasmModuleVerifyTest, InvalidArrayTypeDef) {
               1)};                   // mutability
   EXPECT_FAILURE_WITH_MSG(field_type_invalid_ref2, "Unknown heap type");
 
-  static const byte invalid_mutability[] = {
+  static const uint8_t invalid_mutability[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmArrayTypeCode,    // --
               kI32Code,              // field type
               2)};                   // invalid mutability value
   EXPECT_FAILURE_WITH_MSG(invalid_mutability, "invalid mutability");
 
-  static const byte immutable[] = {SECTION(Type,
-                                           ENTRY_COUNT(1),      // --
-                                           kWasmArrayTypeCode,  // --
-                                           kI32Code,            // field type
-                                           0)};                 // immmutability
+  static const uint8_t immutable[] = {SECTION(Type,
+                                              ENTRY_COUNT(1),      // --
+                                              kWasmArrayTypeCode,  // --
+                                              kI32Code,            // field type
+                                              0)};  // immmutability
   EXPECT_VERIFIES(immutable);
 }
 
 TEST_F(WasmModuleVerifyTest, TypeCanonicalization) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte identical_group[] = {
+  static const uint8_t identical_group[] = {
       SECTION(Type,            // --
               ENTRY_COUNT(2),  // two identical rec. groups
               kWasmRecursiveTypeGroupCode, ENTRY_COUNT(1),  // --
@@ -1031,7 +1034,7 @@ TEST_F(WasmModuleVerifyTest, TypeCanonicalization) {
   // Global initializer should verify as identical type in other group
   EXPECT_VERIFIES(identical_group);
 
-  static const byte non_identical_group[] = {
+  static const uint8_t non_identical_group[] = {
       SECTION(Type,            // --
               ENTRY_COUNT(2),  // two distrinct rec. groups
               kWasmRecursiveTypeGroupCode, ENTRY_COUNT(1),  // --
@@ -1055,7 +1058,7 @@ TEST_F(WasmModuleVerifyTest, TypeCanonicalization) {
 TEST_F(WasmModuleVerifyTest, InvalidSupertypeInRecGroup) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte invalid_supertype[] = {
+  static const uint8_t invalid_supertype[] = {
       SECTION(Type, ENTRY_COUNT(1),                         // --
               kWasmRecursiveTypeGroupCode, ENTRY_COUNT(2),  // --
               kWasmSubtypeCode, 0,              // 0 supertypes, non-final
@@ -1071,7 +1074,7 @@ TEST_F(WasmModuleVerifyTest, InvalidSupertypeInRecGroup) {
 TEST_F(WasmModuleVerifyTest, SuperTypeDeclarationWith0Supertypes) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte zero_supertypes[] = {
+  static const uint8_t zero_supertypes[] = {
       SECTION(Type, ENTRY_COUNT(1),  // --
               kWasmSubtypeCode, 0,   // supertype count
               kWasmArrayTypeCode, kI32Code, 0)};
@@ -1082,7 +1085,7 @@ TEST_F(WasmModuleVerifyTest, SuperTypeDeclarationWith0Supertypes) {
 TEST_F(WasmModuleVerifyTest, NoSupertypeSupertype) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte no_supertype[] = {
+  static const uint8_t no_supertype[] = {
       SECTION(Type, ENTRY_COUNT(1),          // --
               kWasmSubtypeCode, 1,           // supertype count
               0xff, 0xff, 0xff, 0xff, 0x0f,  // supertype = "kNoSuperType"
@@ -1096,7 +1099,7 @@ TEST_F(WasmModuleVerifyTest, NonSpecifiedFinalType) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
   FLAG_SCOPE(wasm_final_types);
-  static const byte final_supertype[] = {
+  static const uint8_t final_supertype[] = {
       SECTION(Type, ENTRY_COUNT(2),                 // --
               kWasmStructTypeCode, 1, kI32Code, 1,  // --
               kWasmSubtypeCode, 1, 0,               // --
@@ -1108,7 +1111,7 @@ TEST_F(WasmModuleVerifyTest, SpecifiedFinalType) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
   FLAG_SCOPE(wasm_final_types);
-  static const byte final_supertype[] = {
+  static const uint8_t final_supertype[] = {
       SECTION(Type, ENTRY_COUNT(2),                 // --
               kWasmSubtypeFinalCode, 0,             // --
               kWasmStructTypeCode, 1, kI32Code, 1,  // --
@@ -1118,14 +1121,14 @@ TEST_F(WasmModuleVerifyTest, SpecifiedFinalType) {
 }
 
 TEST_F(WasmModuleVerifyTest, ZeroExceptions) {
-  static const byte data[] = {SECTION(Tag, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Tag, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_OK(result);
   EXPECT_EQ(0u, result.value()->tags.size());
 }
 
 TEST_F(WasmModuleVerifyTest, OneI32Exception) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_v_x(kI32Code)),  // sig#0 (i32)
       SECTION(Tag, ENTRY_COUNT(1),
               EXCEPTION_ENTRY(SIG_INDEX(0)))};  // except[0] (sig#0)
@@ -1139,7 +1142,7 @@ TEST_F(WasmModuleVerifyTest, OneI32Exception) {
 }
 
 TEST_F(WasmModuleVerifyTest, TwoExceptions) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(2),
               SIG_ENTRY_v_x(kI32Code),              // sig#0 (i32)
               SIG_ENTRY_v_xx(kF32Code, kI64Code)),  // sig#1 (f32, i64)
@@ -1158,7 +1161,7 @@ TEST_F(WasmModuleVerifyTest, TwoExceptions) {
 }
 
 TEST_F(WasmModuleVerifyTest, Exception_invalid_sig_index) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       SECTION(Tag, ENTRY_COUNT(1),
               EXCEPTION_ENTRY(
@@ -1169,7 +1172,7 @@ TEST_F(WasmModuleVerifyTest, Exception_invalid_sig_index) {
 }
 
 TEST_F(WasmModuleVerifyTest, Exception_invalid_sig_return) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_i_i),
       SECTION(Tag, ENTRY_COUNT(1),
               EXCEPTION_ENTRY(
@@ -1180,7 +1183,7 @@ TEST_F(WasmModuleVerifyTest, Exception_invalid_sig_return) {
 }
 
 TEST_F(WasmModuleVerifyTest, Exception_invalid_attribute) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_i_i),
       SECTION(Tag, ENTRY_COUNT(1), 23,
               SIG_INDEX(0))};  // except[0] (sig#0) [invalid-attribute]
@@ -1190,39 +1193,39 @@ TEST_F(WasmModuleVerifyTest, Exception_invalid_attribute) {
 }
 
 TEST_F(WasmModuleVerifyTest, TagSectionCorrectPlacement) {
-  static const byte data[] = {SECTION(Memory, ENTRY_COUNT(0)),
-                              SECTION(Tag, ENTRY_COUNT(0)),
-                              SECTION(Global, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Memory, ENTRY_COUNT(0)),
+                                 SECTION(Tag, ENTRY_COUNT(0)),
+                                 SECTION(Global, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_OK(result);
 }
 
 TEST_F(WasmModuleVerifyTest, TagSectionAfterGlobal) {
-  static const byte data[] = {SECTION(Global, ENTRY_COUNT(0)),
-                              SECTION(Tag, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Global, ENTRY_COUNT(0)),
+                                 SECTION(Tag, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result,
                 "The Tag section must appear before the Global section");
 }
 
 TEST_F(WasmModuleVerifyTest, TagSectionBeforeMemory) {
-  static const byte data[] = {SECTION(Tag, ENTRY_COUNT(0)),
-                              SECTION(Memory, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Tag, ENTRY_COUNT(0)),
+                                 SECTION(Memory, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result, "unexpected section <Memory>");
 }
 
 TEST_F(WasmModuleVerifyTest, TagSectionAfterTableBeforeMemory) {
   static_assert(kMemorySectionCode + 1 == kGlobalSectionCode);
-  static const byte data[] = {SECTION(Table, ENTRY_COUNT(0)),
-                              SECTION(Tag, ENTRY_COUNT(0)),
-                              SECTION(Memory, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Table, ENTRY_COUNT(0)),
+                                 SECTION(Tag, ENTRY_COUNT(0)),
+                                 SECTION(Memory, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result, "unexpected section <Memory>");
 }
 
 TEST_F(WasmModuleVerifyTest, TagImport) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       SECTION(Import,                           // section header
               ENTRY_COUNT(1),                   // number of imports
@@ -1237,7 +1240,7 @@ TEST_F(WasmModuleVerifyTest, TagImport) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExceptionExport) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       SECTION(Tag, ENTRY_COUNT(1),
               EXCEPTION_ENTRY(SIG_INDEX(0))),  // except[0] (sig#0)
@@ -1253,18 +1256,19 @@ TEST_F(WasmModuleVerifyTest, ExceptionExport) {
 
 TEST_F(WasmModuleVerifyTest, OneSignature) {
   {
-    static const byte data[] = {TYPE_SECTION_ONE_SIG_VOID_VOID};
+    static const uint8_t data[] = {TYPE_SECTION_ONE_SIG_VOID_VOID};
     EXPECT_VERIFIES(data);
   }
 
   {
-    static const byte data[] = {SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_i_i)};
+    static const uint8_t data[] = {
+        SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_i_i)};
     EXPECT_VERIFIES(data);
   }
 }
 
 TEST_F(WasmModuleVerifyTest, MultipleSignatures) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type,                                           // --
               ENTRY_COUNT(3),                                 // --
               SIG_ENTRY_v_v,                                  // void -> void
@@ -1292,7 +1296,7 @@ TEST_F(WasmModuleVerifyTest, CanonicalTypeIds) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type,                               // --
               ENTRY_COUNT(5),                     // --
               WASM_STRUCT_DEF(                    // Struct definition
@@ -1320,7 +1324,7 @@ TEST_F(WasmModuleVerifyTest, CanonicalTypeIds) {
 
 TEST_F(WasmModuleVerifyTest, DataSegmentWithImmutableImportedGlobal) {
   // Import 2 globals so that we can initialize data with a global index != 0.
-  const byte data[] = {
+  const uint8_t data[] = {
       SECTION(Import,           // section header
               ENTRY_COUNT(2),   // number of imports
               ADD_COUNT('m'),   // module name
@@ -1345,7 +1349,7 @@ TEST_F(WasmModuleVerifyTest, DataSegmentWithImmutableImportedGlobal) {
 
 TEST_F(WasmModuleVerifyTest, DataSegmentWithMutableImportedGlobal) {
   // Only an immutable imported global can be used as an init_expr.
-  const byte data[] = {
+  const uint8_t data[] = {
       SECTION(Import,           // section header
               ENTRY_COUNT(1),   // number of imports
               ADD_COUNT('m'),   // module name
@@ -1363,7 +1367,7 @@ TEST_F(WasmModuleVerifyTest, DataSegmentWithMutableImportedGlobal) {
 }
 TEST_F(WasmModuleVerifyTest, DataSegmentWithImmutableGlobal) {
   // Only an immutable imported global can be used as an init_expr.
-  const byte data[] = {
+  const uint8_t data[] = {
       SECTION(Memory, ENTRY_COUNT(1), kWithMaximum, 28, 28),
       SECTION(Global, ENTRY_COUNT(1),
               kI32Code,                         // local type
@@ -1378,8 +1382,8 @@ TEST_F(WasmModuleVerifyTest, DataSegmentWithImmutableGlobal) {
 }
 
 TEST_F(WasmModuleVerifyTest, OneDataSegment) {
-  const byte kDataSegmentSourceOffset = 24;
-  const byte data[] = {
+  const uint8_t kDataSegmentSourceOffset = 24;
+  const uint8_t data[] = {
       SECTION(Memory, ENTRY_COUNT(1), kWithMaximum, 28, 28),
       SECTION(Data, ENTRY_COUNT(1), LINEAR_MEMORY_INDEX_0,
               WASM_INIT_EXPR_I32V_3(0x9BBAA),  // dest addr
@@ -1405,10 +1409,10 @@ TEST_F(WasmModuleVerifyTest, OneDataSegment) {
 }
 
 TEST_F(WasmModuleVerifyTest, TwoDataSegments) {
-  const byte kDataSegment0SourceOffset = 24;
-  const byte kDataSegment1SourceOffset = kDataSegment0SourceOffset + 11;
+  const uint8_t kDataSegment0SourceOffset = 24;
+  const uint8_t kDataSegment1SourceOffset = kDataSegment0SourceOffset + 11;
 
-  const byte data[] = {
+  const uint8_t data[] = {
       SECTION(Memory, ENTRY_COUNT(1), kWithMaximum, 28, 28),
       SECTION(Data,
               ENTRY_COUNT(2),  // segment count
@@ -1443,7 +1447,7 @@ TEST_F(WasmModuleVerifyTest, TwoDataSegments) {
 }
 
 TEST_F(WasmModuleVerifyTest, DataWithoutMemory) {
-  const byte data[] = {
+  const uint8_t data[] = {
       SECTION(Data, ENTRY_COUNT(1), LINEAR_MEMORY_INDEX_0,
               WASM_INIT_EXPR_I32V_3(0x9BBAA),  // dest addr
               U32V_1(3),                       // source size
@@ -1454,12 +1458,12 @@ TEST_F(WasmModuleVerifyTest, DataWithoutMemory) {
 
 TEST_F(WasmModuleVerifyTest, MaxMaximumMemorySize) {
   {
-    const byte data[] = {
+    const uint8_t data[] = {
         SECTION(Memory, ENTRY_COUNT(1), kWithMaximum, 0, U32V_3(65536))};
     EXPECT_VERIFIES(data);
   }
   {
-    const byte data[] = {
+    const uint8_t data[] = {
         SECTION(Memory, ENTRY_COUNT(1), kWithMaximum, 0, U32V_3(65537))};
     EXPECT_FAILURE(data);
   }
@@ -1467,15 +1471,15 @@ TEST_F(WasmModuleVerifyTest, MaxMaximumMemorySize) {
 
 TEST_F(WasmModuleVerifyTest, InvalidMemoryLimits) {
   {
-    const byte kInvalidLimits = 0x15;
-    const byte data[] = {
+    const uint8_t kInvalidLimits = 0x15;
+    const uint8_t data[] = {
         SECTION(Memory, ENTRY_COUNT(1), kInvalidLimits, 0, 10)};
     EXPECT_FAILURE_WITH_MSG(data, "invalid memory limits flags 0x15");
   }
 }
 
 TEST_F(WasmModuleVerifyTest, DataSegment_wrong_init_type) {
-  const byte data[] = {
+  const uint8_t data[] = {
       SECTION(Memory, ENTRY_COUNT(1), kWithMaximum, 28, 28),
       SECTION(Data, ENTRY_COUNT(1), LINEAR_MEMORY_INDEX_0,
               WASM_INIT_EXPR_F64(9.9),  // dest addr
@@ -1487,7 +1491,7 @@ TEST_F(WasmModuleVerifyTest, DataSegment_wrong_init_type) {
 }
 
 TEST_F(WasmModuleVerifyTest, DataSegmentEndOverflow) {
-  const byte data[] = {
+  const uint8_t data[] = {
       SECTION(Memory,  // memory section
               ENTRY_COUNT(1), kWithMaximum, 28, 28),
       SECTION(Data,                      // data section
@@ -1501,7 +1505,7 @@ TEST_F(WasmModuleVerifyTest, DataSegmentEndOverflow) {
 }
 
 TEST_F(WasmModuleVerifyTest, OneIndirectFunction) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -1522,7 +1526,7 @@ TEST_F(WasmModuleVerifyTest, OneIndirectFunction) {
 }
 
 TEST_F(WasmModuleVerifyTest, ElementSectionWithInternalTable) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // table ---------------------------------------------------------------
       SECTION(Table, ENTRY_COUNT(1), kFuncRefCode, 0, 1),
       // elements ------------------------------------------------------------
@@ -1532,7 +1536,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionWithInternalTable) {
 }
 
 TEST_F(WasmModuleVerifyTest, ElementSectionWithImportedTable) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // imports -------------------------------------------------------------
       SECTION(Import, ENTRY_COUNT(1),
               ADD_COUNT('m'),  // module name
@@ -1549,7 +1553,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionWithImportedTable) {
 
 TEST_F(WasmModuleVerifyTest, ElementSectionWithoutTable) {
   // Test that an element section without a table causes a validation error.
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // elements ------------------------------------------------------------
       SECTION(Element,
               ENTRY_COUNT(1),  // entry count
@@ -1563,7 +1567,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionWithoutTable) {
 
 TEST_F(WasmModuleVerifyTest, Regression_735887) {
   // Test with an invalid function index in the element section.
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -1582,7 +1586,7 @@ TEST_F(WasmModuleVerifyTest, Regression_735887) {
 }
 
 TEST_F(WasmModuleVerifyTest, OneIndirectFunction_one_entry) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -1607,7 +1611,7 @@ TEST_F(WasmModuleVerifyTest, OneIndirectFunction_one_entry) {
 }
 
 TEST_F(WasmModuleVerifyTest, MultipleIndirectFunctions) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -------------------------------------------------------
       SECTION(Type,
               ENTRY_COUNT(2),            // --
@@ -1637,7 +1641,7 @@ TEST_F(WasmModuleVerifyTest, MultipleIndirectFunctions) {
 TEST_F(WasmModuleVerifyTest, ElementSectionMultipleTables) {
   // Test that if we have multiple tables, in the element section we can target
   // and initialize all tables.
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -1668,7 +1672,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionMultipleTables) {
 TEST_F(WasmModuleVerifyTest, ElementSectionMixedTables) {
   // Test that if we have multiple tables, both imported and module-defined, in
   // the element section we can target and initialize all tables.
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // imports -------------------------------------------------------------
@@ -1724,7 +1728,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionMixedTables) {
 TEST_F(WasmModuleVerifyTest, ElementSectionMultipleTablesArbitraryOrder) {
   // Test that the order in which tables are targeted in the element secion
   // can be arbitrary.
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -1759,7 +1763,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionMultipleTablesArbitraryOrder) {
 TEST_F(WasmModuleVerifyTest, ElementSectionMixedTablesArbitraryOrder) {
   // Test that the order in which tables are targeted in the element secion can
   // be arbitrary. In this test, tables can be both imported and module-defined.
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // imports -------------------------------------------------------------
@@ -1813,7 +1817,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionMixedTablesArbitraryOrder) {
 }
 
 TEST_F(WasmModuleVerifyTest, ElementSectionInitExternRefTableWithFuncRef) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs ---------------------------------------------------------------
@@ -1846,7 +1850,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionInitExternRefTableWithFuncRef) {
 }
 
 TEST_F(WasmModuleVerifyTest, ElementSectionInitFuncRefTableWithFuncRefNull) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // table declaration ---------------------------------------------------
       SECTION(Table, ENTRY_COUNT(1),  // section header
               kFuncRefCode, 0, 9),    // table 0
@@ -1864,7 +1868,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionInitFuncRefTableWithFuncRefNull) {
 }
 
 TEST_F(WasmModuleVerifyTest, ElementSectionInitFuncRefTableWithExternRefNull) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // table declaration ---------------------------------------------------
       SECTION(Table, ENTRY_COUNT(1),  // section header
               kFuncRefCode, 0, 9),    // table 0
@@ -1886,7 +1890,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionInitFuncRefTableWithExternRefNull) {
 TEST_F(WasmModuleVerifyTest, ElementSectionDontInitExternRefImportedTable) {
   // Test that imported tables of type ExternRef cannot be initialized in the
   // elements section.
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 ---------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // imports -------------------------------------------------------------
@@ -1928,7 +1932,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionDontInitExternRefImportedTable) {
 }
 
 TEST_F(WasmModuleVerifyTest, ElementSectionGlobalGetOutOfBounds) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Element, ENTRY_COUNT(1),
               0x05,            // Mode: Passive with expressions-as-elements
               kFuncRefCode,    // type
@@ -1939,7 +1943,7 @@ TEST_F(WasmModuleVerifyTest, ElementSectionGlobalGetOutOfBounds) {
 
 // Make sure extended constants do not work without the experimental feature.
 TEST_F(WasmModuleVerifyTest, ExtendedConstantsFail) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Import, ENTRY_COUNT(1),         // one import
               0x01, 'm', 0x01, 'g',           // module, name
               kExternalGlobal, kI32Code, 0),  // type, mutability
@@ -1954,7 +1958,7 @@ TEST_F(WasmModuleVerifyTest, ExtendedConstantsFail) {
 
 TEST_F(WasmModuleVerifyTest, ExtendedConstantsI32) {
   WASM_FEATURE_SCOPE(extended_const);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Import, ENTRY_COUNT(1),         // one import
               0x01, 'm', 0x01, 'g',           // module, name
               kExternalGlobal, kI32Code, 0),  // type, mutability
@@ -1969,7 +1973,7 @@ TEST_F(WasmModuleVerifyTest, ExtendedConstantsI32) {
 
 TEST_F(WasmModuleVerifyTest, ExtendedConstantsI64) {
   WASM_FEATURE_SCOPE(extended_const);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Import, ENTRY_COUNT(1),         // one import
               0x01, 'm', 0x01, 'g',           // module, name
               kExternalGlobal, kI64Code, 0),  // type, mutability
@@ -1984,7 +1988,7 @@ TEST_F(WasmModuleVerifyTest, ExtendedConstantsI64) {
 
 TEST_F(WasmModuleVerifyTest, ExtendedConstantsTypeError) {
   WASM_FEATURE_SCOPE(extended_const);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Import, ENTRY_COUNT(1),         // one import
               0x01, 'm', 0x01, 'g',           // module, name
               kExternalGlobal, kI32Code, 0),  // type, mutability
@@ -1997,7 +2001,7 @@ TEST_F(WasmModuleVerifyTest, ExtendedConstantsTypeError) {
 }
 
 TEST_F(WasmModuleVerifyTest, IndirectFunctionNoFunctions) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // indirect table ----------------------------------------------
@@ -2007,7 +2011,7 @@ TEST_F(WasmModuleVerifyTest, IndirectFunctionNoFunctions) {
 }
 
 TEST_F(WasmModuleVerifyTest, IndirectFunctionInvalidIndex) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // functions ---------------------------------------------------
@@ -2019,7 +2023,7 @@ TEST_F(WasmModuleVerifyTest, IndirectFunctionInvalidIndex) {
 }
 
 TEST_F(WasmModuleVerifyTest, MultipleTables) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Table,           // table section
               ENTRY_COUNT(2),  // 2 tables
               kFuncRefCode,    // table 1: type
@@ -2045,7 +2049,7 @@ TEST_F(WasmModuleVerifyTest, MultipleTables) {
 TEST_F(WasmModuleVerifyTest, TypedFunctionTable) {
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_v_x(kI32Code)),
       SECTION(Table,            // table section
               ENTRY_COUNT(1),   // 1 table
@@ -2060,7 +2064,7 @@ TEST_F(WasmModuleVerifyTest, TypedFunctionTable) {
 TEST_F(WasmModuleVerifyTest, NullableTableIllegalInitializer) {
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_v_v),  // type section
       ONE_EMPTY_FUNCTION(0),                         // function section
       SECTION(Table,                                 // table section
@@ -2078,7 +2082,7 @@ TEST_F(WasmModuleVerifyTest, IllegalTableTypes) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
 
-  using Vec = std::vector<byte>;
+  using Vec = std::vector<uint8_t>;
 
   static Vec table_types[] = {{kI32Code}, {kF64Code}};
 
@@ -2087,13 +2091,13 @@ TEST_F(WasmModuleVerifyTest, IllegalTableTypes) {
         SECTION(Type, ENTRY_COUNT(2),
                 WASM_STRUCT_DEF(FIELD_COUNT(1), STRUCT_FIELD(kI32Code, true)),
                 WASM_ARRAY_DEF(kI32Code, true)),
-        kTableSectionCode, static_cast<byte>(type.size() + 3), byte{1}};
+        kTableSectionCode, static_cast<uint8_t>(type.size() + 3), uint8_t{1}};
     // Last elements are section size and entry count
 
     // Add table type
     data.insert(data.end(), type.begin(), type.end());
     // Add table limits
-    data.insert(data.end(), {byte{0}, byte{10}});
+    data.insert(data.end(), {uint8_t{0}, uint8_t{10}});
 
     auto result = DecodeModule(base::VectorOf(data));
     EXPECT_NOT_OK(result, "Only reference types can be used as table types");
@@ -2103,12 +2107,13 @@ TEST_F(WasmModuleVerifyTest, IllegalTableTypes) {
 TEST_F(WasmModuleVerifyTest, TableWithInitializer) {
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_v_v),  // type section
       ONE_EMPTY_FUNCTION(0),                         // function section
       SECTION(Table,                                 // table section
               ENTRY_COUNT(1),                        // 1 table
               0x40,                                  // table 0: has initializer
+              0x00,                                  // table 0: reserved byte
               kRefNullCode, 0,                       // table 0: type
               0, 10,                                 // table 0: limits
               kExprRefFunc, 0, kExprEnd),            // table 0: initial value
@@ -2121,12 +2126,13 @@ TEST_F(WasmModuleVerifyTest, TableWithInitializer) {
 TEST_F(WasmModuleVerifyTest, NonNullableTable) {
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_v_v),  // type section
       ONE_EMPTY_FUNCTION(0),                         // function section
       SECTION(Table,                                 // table section
               ENTRY_COUNT(1),                        // 1 table
               0x40,                                  // table 0: has initializer
+              0x00,                                  // table 0: reserved byte
               kRefCode, 0,                           // table 0: type
               0, 10,                                 // table 0: limits
               kExprRefFunc, 0, kExprEnd),            // table 0: initial value
@@ -2139,7 +2145,7 @@ TEST_F(WasmModuleVerifyTest, NonNullableTable) {
 TEST_F(WasmModuleVerifyTest, NonNullableTableNoInitializer) {
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), SIG_ENTRY_v_x(kI32Code)),
       SECTION(Table,           // table section
               ENTRY_COUNT(2),  // 2 tables
@@ -2154,7 +2160,7 @@ TEST_F(WasmModuleVerifyTest, NonNullableTableNoInitializer) {
 
 TEST_F(WasmModuleVerifyTest, TieringCompilationHints) {
   WASM_FEATURE_SCOPE(compilation_hints);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),
       FUNCTION_SECTION(3, 0, 0, 0),
       SECTION_COMPILATION_HINTS(BASELINE_TIER_BASELINE | TOP_TIER_BASELINE,
@@ -2189,7 +2195,7 @@ TEST_F(WasmModuleVerifyTest, TieringCompilationHints) {
 
 TEST_F(WasmModuleVerifyTest, BranchHinting) {
   WASM_FEATURE_SCOPE(branch_hinting);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v), FUNCTION_SECTION(2, 0, 0),
       SECTION_BRANCH_HINTS(ENTRY_COUNT(2), 0 /*func_index*/, ENTRY_COUNT(1),
                            3 /* if offset*/, 1 /*reserved*/, 1 /*likely*/,
@@ -2235,7 +2241,7 @@ class WasmSignatureDecodeTest : public TestWithZone {
 };
 
 TEST_F(WasmSignatureDecodeTest, Ok_v_v) {
-  static const byte data[] = {SIG_ENTRY_v_v};
+  static const uint8_t data[] = {SIG_ENTRY_v_v};
   v8::internal::AccountingAllocator allocator;
   Zone zone(&allocator, ZONE_NAME);
   const FunctionSig* sig = DecodeSig(base::ArrayVector(data));
@@ -2251,7 +2257,7 @@ TEST_F(WasmSignatureDecodeTest, Ok_t_v) {
   WASM_FEATURE_SCOPE(stringref);
   for (size_t i = 0; i < arraysize(kValueTypes); i++) {
     ValueTypePair ret_type = kValueTypes[i];
-    const byte data[] = {SIG_ENTRY_x(ret_type.code)};
+    const uint8_t data[] = {SIG_ENTRY_x(ret_type.code)};
     const FunctionSig* sig = DecodeSig(base::ArrayVector(data));
 
     SCOPED_TRACE("Return type " + ret_type.type.name());
@@ -2268,7 +2274,7 @@ TEST_F(WasmSignatureDecodeTest, Ok_v_t) {
   WASM_FEATURE_SCOPE(stringref);
   for (size_t i = 0; i < arraysize(kValueTypes); i++) {
     ValueTypePair param_type = kValueTypes[i];
-    const byte data[] = {SIG_ENTRY_v_x(param_type.code)};
+    const uint8_t data[] = {SIG_ENTRY_v_x(param_type.code)};
     const FunctionSig* sig = DecodeSig(base::ArrayVector(data));
 
     SCOPED_TRACE("Param type " + param_type.type.name());
@@ -2287,7 +2293,7 @@ TEST_F(WasmSignatureDecodeTest, Ok_t_t) {
     ValueTypePair ret_type = kValueTypes[i];
     for (size_t j = 0; j < arraysize(kValueTypes); j++) {
       ValueTypePair param_type = kValueTypes[j];
-      const byte data[] = {SIG_ENTRY_x_x(ret_type.code, param_type.code)};
+      const uint8_t data[] = {SIG_ENTRY_x_x(ret_type.code, param_type.code)};
       const FunctionSig* sig = DecodeSig(base::ArrayVector(data));
 
       SCOPED_TRACE("Param type " + param_type.type.name());
@@ -2308,7 +2314,7 @@ TEST_F(WasmSignatureDecodeTest, Ok_i_tt) {
     ValueTypePair p0_type = kValueTypes[i];
     for (size_t j = 0; j < arraysize(kValueTypes); j++) {
       ValueTypePair p1_type = kValueTypes[j];
-      const byte data[] = {
+      const uint8_t data[] = {
           SIG_ENTRY_x_xx(kI32Code, p0_type.code, p1_type.code)};
       const FunctionSig* sig = DecodeSig(base::ArrayVector(data));
 
@@ -2331,8 +2337,8 @@ TEST_F(WasmSignatureDecodeTest, Ok_tt_tt) {
     ValueTypePair p0_type = kValueTypes[i];
     for (size_t j = 0; j < arraysize(kValueTypes); j++) {
       ValueTypePair p1_type = kValueTypes[j];
-      const byte data[] = {SIG_ENTRY_xx_xx(p0_type.code, p1_type.code,
-                                           p0_type.code, p1_type.code)};
+      const uint8_t data[] = {SIG_ENTRY_xx_xx(p0_type.code, p1_type.code,
+                                              p0_type.code, p1_type.code)};
       const FunctionSig* sig = DecodeSig(base::ArrayVector(data));
 
       SCOPED_TRACE("p0 = " + p0_type.type.name() +
@@ -2350,7 +2356,7 @@ TEST_F(WasmSignatureDecodeTest, Ok_tt_tt) {
 
 TEST_F(WasmSignatureDecodeTest, Simd) {
   WASM_FEATURE_SCOPE(simd);
-  const byte data[] = {SIG_ENTRY_x(kS128Code)};
+  const uint8_t data[] = {SIG_ENTRY_x(kS128Code)};
   if (!CheckHardwareSupportsSimd()) {
     EXPECT_TRUE(DecodeSigError(base::ArrayVector(data)))
         << "Type S128 should not be allowed on this hardware";
@@ -2364,25 +2370,25 @@ TEST_F(WasmSignatureDecodeTest, Simd) {
 }
 
 TEST_F(WasmSignatureDecodeTest, TooManyParams) {
-  static const byte data[] = {kWasmFunctionTypeCode,
-                              WASM_I32V_3(kV8MaxWasmFunctionParams + 1),
-                              kI32Code, 0};
+  static const uint8_t data[] = {kWasmFunctionTypeCode,
+                                 WASM_I32V_3(kV8MaxWasmFunctionParams + 1),
+                                 kI32Code, 0};
   EXPECT_TRUE(DecodeSigError(base::ArrayVector(data)));
 }
 
 TEST_F(WasmSignatureDecodeTest, TooManyReturns) {
   for (int i = 0; i < 2; i++) {
-    byte data[] = {kWasmFunctionTypeCode, 0,
-                   WASM_I32V_3(kV8MaxWasmFunctionReturns + 1), kI32Code};
+    uint8_t data[] = {kWasmFunctionTypeCode, 0,
+                      WASM_I32V_3(kV8MaxWasmFunctionReturns + 1), kI32Code};
     EXPECT_TRUE(DecodeSigError(base::ArrayVector(data)));
   }
 }
 
 TEST_F(WasmSignatureDecodeTest, Fail_off_end) {
-  byte data[256];
+  uint8_t data[256];
   for (int p = 0; p <= 255; p = p + 1 + p * 3) {
     for (int i = 0; i <= p; i++) data[i] = kI32Code;
-    data[0] = static_cast<byte>(p);
+    data[0] = static_cast<uint8_t>(p);
 
     for (int i = 0; i < p + 1; i++) {
       // Should fall off the end for all signatures.
@@ -2392,9 +2398,9 @@ TEST_F(WasmSignatureDecodeTest, Fail_off_end) {
 }
 
 TEST_F(WasmSignatureDecodeTest, Fail_invalid_type) {
-  byte kInvalidType = 76;
+  uint8_t kInvalidType = 76;
   for (size_t i = 0;; i++) {
-    byte data[] = {SIG_ENTRY_x_xx(kI32Code, kI32Code, kI32Code)};
+    uint8_t data[] = {SIG_ENTRY_x_xx(kI32Code, kI32Code, kI32Code)};
     if (i >= arraysize(data)) break;
     data[i] = kInvalidType;
     EXPECT_TRUE(DecodeSigError(base::ArrayVector(data)));
@@ -2402,17 +2408,17 @@ TEST_F(WasmSignatureDecodeTest, Fail_invalid_type) {
 }
 
 TEST_F(WasmSignatureDecodeTest, Fail_invalid_ret_type1) {
-  static const byte data[] = {SIG_ENTRY_x_x(kVoidCode, kI32Code)};
+  static const uint8_t data[] = {SIG_ENTRY_x_x(kVoidCode, kI32Code)};
   EXPECT_TRUE(DecodeSigError(base::ArrayVector(data)));
 }
 
 TEST_F(WasmSignatureDecodeTest, Fail_invalid_param_type1) {
-  static const byte data[] = {SIG_ENTRY_x_x(kI32Code, kVoidCode)};
+  static const uint8_t data[] = {SIG_ENTRY_x_x(kI32Code, kVoidCode)};
   EXPECT_TRUE(DecodeSigError(base::ArrayVector(data)));
 }
 
 TEST_F(WasmSignatureDecodeTest, Fail_invalid_param_type2) {
-  static const byte data[] = {SIG_ENTRY_x_xx(kI32Code, kI32Code, kVoidCode)};
+  static const uint8_t data[] = {SIG_ENTRY_x_xx(kI32Code, kI32Code, kVoidCode)};
   EXPECT_TRUE(DecodeSigError(base::ArrayVector(data)));
 }
 
@@ -2427,7 +2433,7 @@ class WasmFunctionVerifyTest : public TestWithIsolateAndZone {
 };
 
 TEST_F(WasmFunctionVerifyTest, Ok_v_v_empty) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SIG_ENTRY_v_v,  // signature entry
       4,              // locals
       3,
@@ -2457,14 +2463,14 @@ TEST_F(WasmFunctionVerifyTest, Ok_v_v_empty) {
 }
 
 TEST_F(WasmModuleVerifyTest, SectionWithoutNameLength) {
-  const byte data[] = {1};
+  const uint8_t data[] = {1};
   EXPECT_FAILURE(data);
 }
 
 TEST_F(WasmModuleVerifyTest, EmptyCustomSectionIsInvalid) {
   // An empty custom section is invalid, because at least one byte for the
   // length of the custom section name is required.
-  const byte data[] = {
+  const uint8_t data[] = {
       0,  // unknown section code.
       0   // section length.
   };
@@ -2472,7 +2478,7 @@ TEST_F(WasmModuleVerifyTest, EmptyCustomSectionIsInvalid) {
 }
 
 TEST_F(WasmModuleVerifyTest, TheLoneliestOfValidModulesTheTrulyEmptyOne) {
-  const byte data[] = {
+  const uint8_t data[] = {
       0,  // unknown section code.
       1,  // section length, only one byte for the name length.
       0,  // string length of 0.
@@ -2482,14 +2488,14 @@ TEST_F(WasmModuleVerifyTest, TheLoneliestOfValidModulesTheTrulyEmptyOne) {
 }
 
 TEST_F(WasmModuleVerifyTest, OnlyUnknownSectionEmpty) {
-  const byte data[] = {
+  const uint8_t data[] = {
       UNKNOWN_SECTION(0),
   };
   EXPECT_VERIFIES(data);
 }
 
 TEST_F(WasmModuleVerifyTest, OnlyUnknownSectionNonEmpty) {
-  const byte data[] = {
+  const uint8_t data[] = {
       UNKNOWN_SECTION(5),
       0xFF,
       0xFF,
@@ -2501,7 +2507,7 @@ TEST_F(WasmModuleVerifyTest, OnlyUnknownSectionNonEmpty) {
 }
 
 TEST_F(WasmModuleVerifyTest, SignatureFollowedByEmptyUnknownSection) {
-  const byte data[] = {
+  const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // -----------------------------------------------------------
@@ -2510,7 +2516,7 @@ TEST_F(WasmModuleVerifyTest, SignatureFollowedByEmptyUnknownSection) {
 }
 
 TEST_F(WasmModuleVerifyTest, SignatureFollowedByUnknownSection) {
-  const byte data[] = {
+  const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // -----------------------------------------------------------
@@ -2525,7 +2531,7 @@ TEST_F(WasmModuleVerifyTest, SignatureFollowedByUnknownSection) {
 }
 
 TEST_F(WasmModuleVerifyTest, UnknownSectionOverflow) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       UNKNOWN_SECTION(9),
       1,
       2,
@@ -2542,7 +2548,7 @@ TEST_F(WasmModuleVerifyTest, UnknownSectionOverflow) {
 }
 
 TEST_F(WasmModuleVerifyTest, UnknownSectionUnderflow) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       UNKNOWN_SECTION(333),
       1,
       2,
@@ -2553,7 +2559,7 @@ TEST_F(WasmModuleVerifyTest, UnknownSectionUnderflow) {
 }
 
 TEST_F(WasmModuleVerifyTest, UnknownSectionSkipped) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       UNKNOWN_SECTION(1),
       0,  // one byte section
       SECTION(Global, ENTRY_COUNT(1),
@@ -2575,19 +2581,19 @@ TEST_F(WasmModuleVerifyTest, UnknownSectionSkipped) {
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_empty) {
-  static const byte data[] = {SECTION(Type, ENTRY_COUNT(0)),
-                              SECTION(Import, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Type, ENTRY_COUNT(0)),
+                                 SECTION(Import, ENTRY_COUNT(0))};
   EXPECT_VERIFIES(data);
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_nosigs1) {
-  static const byte data[] = {SECTION(Import, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Import, ENTRY_COUNT(0))};
   EXPECT_VERIFIES(data);
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_mutable_global) {
   {
-    static const byte data[] = {
+    static const uint8_t data[] = {
         SECTION(Import,           // section header
                 ENTRY_COUNT(1),   // number of imports
                 ADD_COUNT('m'),   // module name
@@ -2599,7 +2605,7 @@ TEST_F(WasmModuleVerifyTest, ImportTable_mutable_global) {
     EXPECT_VERIFIES(data);
   }
   {
-    static const byte data[] = {
+    static const uint8_t data[] = {
         SECTION(Import,           // section header
                 ENTRY_COUNT(1),   // sig table
                 ADD_COUNT('m'),   // module name
@@ -2613,7 +2619,7 @@ TEST_F(WasmModuleVerifyTest, ImportTable_mutable_global) {
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_mutability_malformed) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Import,
               ENTRY_COUNT(1),   // --
               ADD_COUNT('m'),   // module name
@@ -2626,7 +2632,7 @@ TEST_F(WasmModuleVerifyTest, ImportTable_mutability_malformed) {
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_nosigs2) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Import, ENTRY_COUNT(1),  // sig table
               ADD_COUNT('m'),          // module name
               ADD_COUNT('f'),          // function name
@@ -2637,7 +2643,7 @@ TEST_F(WasmModuleVerifyTest, ImportTable_nosigs2) {
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_invalid_sig) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(0)),   // --
       SECTION(Import, ENTRY_COUNT(1),  // --
               ADD_COUNT('m'),          // module name
@@ -2649,7 +2655,7 @@ TEST_F(WasmModuleVerifyTest, ImportTable_invalid_sig) {
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_one_sig) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       SECTION(Import,
@@ -2663,7 +2669,7 @@ TEST_F(WasmModuleVerifyTest, ImportTable_one_sig) {
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_invalid_module) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID,  // --
       SECTION(Import,                  // --
@@ -2678,7 +2684,7 @@ TEST_F(WasmModuleVerifyTest, ImportTable_invalid_module) {
 }
 
 TEST_F(WasmModuleVerifyTest, ImportTable_off_end) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       SECTION(Import, ENTRY_COUNT(1),
@@ -2692,11 +2698,11 @@ TEST_F(WasmModuleVerifyTest, ImportTable_off_end) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExportTable_empty1) {
-  static const byte data[] = {                                 // signatures
-                              TYPE_SECTION_ONE_SIG_VOID_VOID,  // --
-                              ONE_EMPTY_FUNCTION(SIG_INDEX(0)),
-                              SECTION(Export, ENTRY_COUNT(0)),  // --
-                              ONE_EMPTY_BODY};
+  static const uint8_t data[] = {                                 // signatures
+                                 TYPE_SECTION_ONE_SIG_VOID_VOID,  // --
+                                 ONE_EMPTY_FUNCTION(SIG_INDEX(0)),
+                                 SECTION(Export, ENTRY_COUNT(0)),  // --
+                                 ONE_EMPTY_BODY};
 
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_OK(result);
@@ -2706,18 +2712,18 @@ TEST_F(WasmModuleVerifyTest, ExportTable_empty1) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExportTable_empty2) {
-  static const byte data[] = {SECTION(Type, ENTRY_COUNT(0)),
-                              SECTION(Export, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Type, ENTRY_COUNT(0)),
+                                 SECTION(Export, ENTRY_COUNT(0))};
   EXPECT_VERIFIES(data);
 }
 
 TEST_F(WasmModuleVerifyTest, ExportTable_NoFunctions2) {
-  static const byte data[] = {SECTION(Export, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Export, ENTRY_COUNT(0))};
   EXPECT_VERIFIES(data);
 }
 
 TEST_F(WasmModuleVerifyTest, ExportTableOne) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID, ONE_EMPTY_FUNCTION(SIG_INDEX(0)),
       SECTION(Export,
@@ -2734,7 +2740,7 @@ TEST_F(WasmModuleVerifyTest, ExportTableOne) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExportNameWithInvalidStringLength) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID, ONE_EMPTY_FUNCTION(SIG_INDEX(0)),
       SECTION(Export,
@@ -2750,7 +2756,7 @@ TEST_F(WasmModuleVerifyTest, ExportNameWithInvalidStringLength) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExportTableTwo) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID, ONE_EMPTY_FUNCTION(SIG_INDEX(0)),
       SECTION(Export,
@@ -2771,7 +2777,7 @@ TEST_F(WasmModuleVerifyTest, ExportTableTwo) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExportTableThree) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID, THREE_EMPTY_FUNCTIONS(SIG_INDEX(0)),
       SECTION(Export,
@@ -2795,7 +2801,7 @@ TEST_F(WasmModuleVerifyTest, ExportTableThree) {
 
 TEST_F(WasmModuleVerifyTest, ExportTableThreeOne) {
   for (int i = 0; i < 6; i++) {
-    const byte data[] = {
+    const uint8_t data[] = {
         // signatures
         TYPE_SECTION_ONE_SIG_VOID_VOID, THREE_EMPTY_FUNCTIONS(SIG_INDEX(0)),
         SECTION(Export,
@@ -2814,7 +2820,7 @@ TEST_F(WasmModuleVerifyTest, ExportTableThreeOne) {
 }
 
 TEST_F(WasmModuleVerifyTest, ExportTableOne_off_end) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // signatures
       TYPE_SECTION_ONE_SIG_VOID_VOID, ONE_EMPTY_FUNCTION(SIG_INDEX(0)),
       SECTION(Export,
@@ -2829,7 +2835,7 @@ TEST_F(WasmModuleVerifyTest, ExportTableOne_off_end) {
 }
 
 TEST_F(WasmModuleVerifyTest, Regression_648070) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(0)),         // --
       SECTION(Function, U32V_5(3500228624))  // function count = 3500228624
   };                                         // --
@@ -2838,7 +2844,7 @@ TEST_F(WasmModuleVerifyTest, Regression_648070) {
 
 TEST_F(WasmModuleVerifyTest, Regression_738097) {
   // The function body size caused an integer overflow in the module decoder.
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),  // --
       FUNCTION_SECTION(1, 0),          // --
       SECTION(Code,                    // --
@@ -2853,7 +2859,7 @@ TEST_F(WasmModuleVerifyTest, FunctionBodySizeLimit) {
   const uint32_t delta = 3;
   for (uint32_t body_size = kV8MaxWasmFunctionSize - delta;
        body_size < kV8MaxWasmFunctionSize + delta; body_size++) {
-    byte data[] = {
+    uint8_t data[] = {
         TYPE_SECTION(1, SIG_ENTRY_v_v),  // --
         FUNCTION_SECTION(1, 0),          // --
         kCodeSectionCode,                // code section
@@ -2862,7 +2868,7 @@ TEST_F(WasmModuleVerifyTest, FunctionBodySizeLimit) {
         U32V_5(body_size)                // body size
     };
     size_t total = sizeof(data) + body_size;
-    byte* buffer = reinterpret_cast<byte*>(calloc(1, total));
+    uint8_t* buffer = reinterpret_cast<uint8_t*>(calloc(1, total));
     memcpy(buffer, data, sizeof(data));
     ModuleResult result = DecodeModule(base::VectorOf(buffer, total));
     if (body_size <= kV8MaxWasmFunctionSize) {
@@ -2875,12 +2881,12 @@ TEST_F(WasmModuleVerifyTest, FunctionBodySizeLimit) {
 }
 
 TEST_F(WasmModuleVerifyTest, IllegalTypeCode) {
-  static const byte data[] = {TYPE_SECTION(1, SIG_ENTRY_v_x(0x41))};
+  static const uint8_t data[] = {TYPE_SECTION(1, SIG_ENTRY_v_x(0x41))};
   EXPECT_FAILURE_WITH_MSG(data, "invalid value type");
 }
 
 TEST_F(WasmModuleVerifyTest, FunctionBodies_empty) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       EMPTY_TYPE_SECTION,            // --
       EMPTY_FUNCTION_SECTION,        // --
       EMPTY_FUNCTION_BODIES_SECTION  // --
@@ -2889,7 +2895,7 @@ TEST_F(WasmModuleVerifyTest, FunctionBodies_empty) {
 }
 
 TEST_F(WasmModuleVerifyTest, FunctionBodies_one_empty) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),  // --
       FUNCTION_SECTION(1, 0),          // --
       ONE_EMPTY_BODY                   // --
@@ -2898,7 +2904,7 @@ TEST_F(WasmModuleVerifyTest, FunctionBodies_one_empty) {
 }
 
 TEST_F(WasmModuleVerifyTest, FunctionBodies_one_nop) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),          // --
       FUNCTION_SECTION(1, 0),                  // --
       SECTION(Code, ENTRY_COUNT(1), NOP_BODY)  // --
@@ -2907,7 +2913,7 @@ TEST_F(WasmModuleVerifyTest, FunctionBodies_one_nop) {
 }
 
 TEST_F(WasmModuleVerifyTest, FunctionBodies_count_mismatch1) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),  // --
       FUNCTION_SECTION(2, 0, 0),       // --
       ONE_EMPTY_BODY                   // --
@@ -2916,7 +2922,7 @@ TEST_F(WasmModuleVerifyTest, FunctionBodies_count_mismatch1) {
 }
 
 TEST_F(WasmModuleVerifyTest, FunctionBodies_count_mismatch2) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),                    // --
       FUNCTION_SECTION(1, 0),                            // --
       SECTION(Code, ENTRY_COUNT(2), NOP_BODY, NOP_BODY)  // --
@@ -2925,16 +2931,16 @@ TEST_F(WasmModuleVerifyTest, FunctionBodies_count_mismatch2) {
 }
 
 TEST_F(WasmModuleVerifyTest, Names_empty) {
-  static const byte data[] = {EMPTY_TYPE_SECTION, EMPTY_FUNCTION_SECTION,
-                              EMPTY_FUNCTION_BODIES_SECTION,
-                              EMPTY_NAMES_SECTION};
+  static const uint8_t data[] = {EMPTY_TYPE_SECTION, EMPTY_FUNCTION_SECTION,
+                                 EMPTY_FUNCTION_BODIES_SECTION,
+                                 EMPTY_NAMES_SECTION};
   EXPECT_VERIFIES(data);
 }
 
 TEST_F(WasmModuleVerifyTest, Names_one_empty) {
   // TODO(wasm): This test does not test anything (corrupt name section does not
   // fail validation).
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),                            // --
       FUNCTION_SECTION(1, 0),                                    // --
       ONE_EMPTY_BODY,                                            // --
@@ -2946,7 +2952,7 @@ TEST_F(WasmModuleVerifyTest, Names_one_empty) {
 TEST_F(WasmModuleVerifyTest, Names_two_empty) {
   // TODO(wasm): This test does not test anything (corrupt name section does not
   // fail validation).
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),             // --
       FUNCTION_SECTION(2, 0, 0),                  // --
       TWO_EMPTY_BODIES,                           // --
@@ -2958,7 +2964,7 @@ TEST_F(WasmModuleVerifyTest, Names_two_empty) {
 }
 
 TEST_F(WasmModuleVerifyTest, Regression684855) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION_NAMES(0xFB,  // functions count
                     0x27,  // |
                     0x00,  // function name length
@@ -2976,7 +2982,7 @@ TEST_F(WasmModuleVerifyTest, Regression684855) {
 }
 
 TEST_F(WasmModuleVerifyTest, FunctionSectionWithoutCodeSection) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       TYPE_SECTION(1, SIG_ENTRY_v_v),  // Type section.
       FUNCTION_SECTION(1, 0),          // Function section.
   };
@@ -2985,26 +2991,26 @@ TEST_F(WasmModuleVerifyTest, FunctionSectionWithoutCodeSection) {
 }
 
 TEST_F(WasmModuleVerifyTest, CodeSectionWithoutFunctionSection) {
-  static const byte data[] = {ONE_EMPTY_BODY};
+  static const uint8_t data[] = {ONE_EMPTY_BODY};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result, "function body count 1 mismatch (0 expected)");
 }
 
 TEST_F(WasmModuleVerifyTest, EmptyFunctionSectionWithoutCodeSection) {
-  static const byte data[] = {SECTION(Function, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Function, ENTRY_COUNT(0))};
   EXPECT_VERIFIES(data);
 }
 
 TEST_F(WasmModuleVerifyTest, DoubleNonEmptyFunctionSection) {
   // Regression test for https://crbug.com/1342274.
-  static const byte data[] = {TYPE_SECTION(1, SIG_ENTRY_v_v),  // --
-                              FUNCTION_SECTION(1, 0),          // --
-                              FUNCTION_SECTION(1, 0)};
+  static const uint8_t data[] = {TYPE_SECTION(1, SIG_ENTRY_v_v),  // --
+                                 FUNCTION_SECTION(1, 0),          // --
+                                 FUNCTION_SECTION(1, 0)};
   EXPECT_FAILURE(data);
 }
 
 TEST_F(WasmModuleVerifyTest, EmptyCodeSectionWithoutFunctionSection) {
-  static const byte data[] = {SECTION(Code, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Code, ENTRY_COUNT(0))};
   EXPECT_VERIFIES(data);
 }
 
@@ -3013,7 +3019,7 @@ TEST_F(WasmModuleVerifyTest, EmptyCodeSectionWithoutFunctionSection) {
 // form.
 
 TEST_F(WasmModuleVerifyTest, Multiple_Named_Sections) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Unknown, ADD_COUNT('X'), 17, 18),                    // --
       SECTION(Unknown, ADD_COUNT('f', 'o', 'o'), 5, 6, 7, 8, 9),   // --
       SECTION(Unknown, ADD_COUNT('o', 't', 'h', 'e', 'r'), 7, 8),  // --
@@ -3022,7 +3028,7 @@ TEST_F(WasmModuleVerifyTest, Multiple_Named_Sections) {
 }
 
 TEST_F(WasmModuleVerifyTest, Section_Name_No_UTF8) {
-  static const byte data[] = {SECTION(Unknown, 1, 0xFF, 17, 18)};
+  static const uint8_t data[] = {SECTION(Unknown, 1, 0xFF, 17, 18)};
   EXPECT_FAILURE(data);
 }
 
@@ -3051,7 +3057,7 @@ class WasmModuleCustomSectionTest : public TestWithIsolateAndZone {
 };
 
 TEST_F(WasmModuleCustomSectionTest, ThreeUnknownSections) {
-  static constexpr byte data[] = {
+  static constexpr uint8_t data[] = {
       U32_LE(kWasmMagic),                                  // --
       U32_LE(kWasmVersion),                                // --
       SECTION(Unknown, 1, 'X', 17, 18),                    // --
@@ -3070,7 +3076,7 @@ TEST_F(WasmModuleCustomSectionTest, ThreeUnknownSections) {
 }
 
 TEST_F(WasmModuleCustomSectionTest, TwoKnownTwoUnknownSections) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       U32_LE(kWasmMagic),                                          // --
       U32_LE(kWasmVersion),                                        // --
       TYPE_SECTION(2, SIG_ENTRY_v_v, SIG_ENTRY_v_v),               // --
@@ -3089,7 +3095,7 @@ TEST_F(WasmModuleCustomSectionTest, TwoKnownTwoUnknownSections) {
 }
 
 TEST_F(WasmModuleVerifyTest, SourceMappingURLSection) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       WASM_MODULE_HEADER,
       SECTION_SRC_MAP('s', 'r', 'c', '/', 'x', 'y', 'z', '.', 'c')};
   ModuleResult result = DecodeModuleNoHeader(base::ArrayVector(data));
@@ -3103,7 +3109,7 @@ TEST_F(WasmModuleVerifyTest, SourceMappingURLSection) {
 }
 
 TEST_F(WasmModuleVerifyTest, BadSourceMappingURLSection) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       WASM_MODULE_HEADER,
       SECTION_SRC_MAP('s', 'r', 'c', '/', 'x', 0xff, 'z', '.', 'c')};
   ModuleResult result = DecodeModuleNoHeader(base::ArrayVector(data));
@@ -3113,9 +3119,9 @@ TEST_F(WasmModuleVerifyTest, BadSourceMappingURLSection) {
 }
 
 TEST_F(WasmModuleVerifyTest, MultipleSourceMappingURLSections) {
-  static const byte data[] = {WASM_MODULE_HEADER,
-                              SECTION_SRC_MAP('a', 'b', 'c'),
-                              SECTION_SRC_MAP('p', 'q', 'r')};
+  static const uint8_t data[] = {WASM_MODULE_HEADER,
+                                 SECTION_SRC_MAP('a', 'b', 'c'),
+                                 SECTION_SRC_MAP('p', 'q', 'r')};
   ModuleResult result = DecodeModuleNoHeader(base::ArrayVector(data));
   EXPECT_TRUE(result.ok());
   EXPECT_EQ(WasmDebugSymbols::Type::SourceMap,
@@ -3127,7 +3133,7 @@ TEST_F(WasmModuleVerifyTest, MultipleSourceMappingURLSections) {
 }
 
 TEST_F(WasmModuleVerifyTest, MultipleNameSections) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION_NAMES(0, ADD_COUNT(ADD_COUNT('a', 'b', 'c'))),
       SECTION_NAMES(0, ADD_COUNT(ADD_COUNT('p', 'q', 'r', 's')))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
@@ -3136,7 +3142,7 @@ TEST_F(WasmModuleVerifyTest, MultipleNameSections) {
 }
 
 TEST_F(WasmModuleVerifyTest, BadNameSection) {
-  static const byte data[] = {SECTION_NAMES(
+  static const uint8_t data[] = {SECTION_NAMES(
       0, ADD_COUNT(ADD_COUNT('s', 'r', 'c', '/', 'x', 0xff, 'z', '.', 'c')))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_TRUE(result.ok());
@@ -3144,7 +3150,7 @@ TEST_F(WasmModuleVerifyTest, BadNameSection) {
 }
 
 TEST_F(WasmModuleVerifyTest, PassiveDataSegment) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // memory declaration ----------------------------------------------------
       SECTION(Memory, ENTRY_COUNT(1), 0, 1),
       // data segments  --------------------------------------------------------
@@ -3155,7 +3161,7 @@ TEST_F(WasmModuleVerifyTest, PassiveDataSegment) {
 }
 
 TEST_F(WasmModuleVerifyTest, ActiveElementSegmentWithElements) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -----------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs -----------------------------------------------------------------
@@ -3173,7 +3179,7 @@ TEST_F(WasmModuleVerifyTest, ActiveElementSegmentWithElements) {
 }
 
 TEST_F(WasmModuleVerifyTest, PassiveElementSegment) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -----------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs -----------------------------------------------------------------
@@ -3191,7 +3197,7 @@ TEST_F(WasmModuleVerifyTest, PassiveElementSegment) {
 }
 
 TEST_F(WasmModuleVerifyTest, PassiveElementSegmentExternRef) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -----------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs -----------------------------------------------------------------
@@ -3207,7 +3213,7 @@ TEST_F(WasmModuleVerifyTest, PassiveElementSegmentExternRef) {
 }
 
 TEST_F(WasmModuleVerifyTest, PassiveElementSegmentWithIndices) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -----------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs -----------------------------------------------------------------
@@ -3224,7 +3230,7 @@ TEST_F(WasmModuleVerifyTest, PassiveElementSegmentWithIndices) {
 }
 
 TEST_F(WasmModuleVerifyTest, DeclarativeElementSegmentFuncRef) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -----------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs -----------------------------------------------------------------
@@ -3241,7 +3247,7 @@ TEST_F(WasmModuleVerifyTest, DeclarativeElementSegmentFuncRef) {
 }
 
 TEST_F(WasmModuleVerifyTest, DeclarativeElementSegmentWithInvalidIndex) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // sig#0 -----------------------------------------------------------------
       TYPE_SECTION_ONE_SIG_VOID_VOID,
       // funcs -----------------------------------------------------------------
@@ -3260,30 +3266,30 @@ TEST_F(WasmModuleVerifyTest, DeclarativeElementSegmentWithInvalidIndex) {
 }
 
 TEST_F(WasmModuleVerifyTest, DataCountSectionCorrectPlacement) {
-  static const byte data[] = {SECTION(Element, ENTRY_COUNT(0)),
-                              SECTION(DataCount, ENTRY_COUNT(0)),
-                              SECTION(Code, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Element, ENTRY_COUNT(0)),
+                                 SECTION(DataCount, ENTRY_COUNT(0)),
+                                 SECTION(Code, ENTRY_COUNT(0))};
   EXPECT_VERIFIES(data);
 }
 
 TEST_F(WasmModuleVerifyTest, DataCountSectionAfterCode) {
-  static const byte data[] = {SECTION(Code, ENTRY_COUNT(0)),
-                              SECTION(DataCount, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(Code, ENTRY_COUNT(0)),
+                                 SECTION(DataCount, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result,
                 "The DataCount section must appear before the Code section");
 }
 
 TEST_F(WasmModuleVerifyTest, DataCountSectionBeforeElement) {
-  static const byte data[] = {SECTION(DataCount, ENTRY_COUNT(0)),
-                              SECTION(Element, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(DataCount, ENTRY_COUNT(0)),
+                                 SECTION(Element, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result, "unexpected section <Element>");
 }
 
 TEST_F(WasmModuleVerifyTest, DataCountSectionAfterStartBeforeElement) {
   static_assert(kStartSectionCode + 1 == kElementSectionCode);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       // We need the start section for this test, but the start section must
       // reference a valid function, which requires the type and function
       // sections too.
@@ -3298,14 +3304,14 @@ TEST_F(WasmModuleVerifyTest, DataCountSectionAfterStartBeforeElement) {
 }
 
 TEST_F(WasmModuleVerifyTest, MultipleDataCountSections) {
-  static const byte data[] = {SECTION(DataCount, ENTRY_COUNT(0)),
-                              SECTION(DataCount, ENTRY_COUNT(0))};
+  static const uint8_t data[] = {SECTION(DataCount, ENTRY_COUNT(0)),
+                                 SECTION(DataCount, ENTRY_COUNT(0))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result, "Multiple DataCount sections not allowed");
 }
 
 TEST_F(WasmModuleVerifyTest, DataCountSegmentCountMatch) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Memory, ENTRY_COUNT(1), 0, 1),  // Memory section.
       SECTION(DataCount, ENTRY_COUNT(1)),     // DataCount section.
       SECTION(Data, ENTRY_COUNT(1), LINEAR_MEMORY_INDEX_0,  // Data section.
@@ -3315,7 +3321,7 @@ TEST_F(WasmModuleVerifyTest, DataCountSegmentCountMatch) {
 }
 
 TEST_F(WasmModuleVerifyTest, DataCountSegmentCount_greater) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Memory, ENTRY_COUNT(1), 0, 1),  // Memory section.
       SECTION(DataCount, ENTRY_COUNT(3)),     // DataCount section.
       SECTION(Data, ENTRY_COUNT(0))};         // Data section.
@@ -3324,7 +3330,7 @@ TEST_F(WasmModuleVerifyTest, DataCountSegmentCount_greater) {
 }
 
 TEST_F(WasmModuleVerifyTest, DataCountSegmentCount_less) {
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Memory, ENTRY_COUNT(1), 0, 1),  // Memory section.
       SECTION(DataCount, ENTRY_COUNT(0)),     // DataCount section.
       SECTION(Data, ENTRY_COUNT(1), LINEAR_MEMORY_INDEX_0,  // Data section.
@@ -3334,8 +3340,8 @@ TEST_F(WasmModuleVerifyTest, DataCountSegmentCount_less) {
 }
 
 TEST_F(WasmModuleVerifyTest, DataCountSegmentCount_omitted) {
-  static const byte data[] = {SECTION(Memory, ENTRY_COUNT(1), 0, 1),
-                              SECTION(DataCount, ENTRY_COUNT(1))};
+  static const uint8_t data[] = {SECTION(Memory, ENTRY_COUNT(1), 0, 1),
+                                 SECTION(DataCount, ENTRY_COUNT(1))};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result, "data segments count 0 mismatch (1 expected)");
 }
@@ -3344,7 +3350,7 @@ TEST_F(WasmModuleVerifyTest, GcStructIdsPass) {
   WASM_FEATURE_SCOPE(gc);
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  static const byte data[] = {SECTION(
+  static const uint8_t data[] = {SECTION(
       Type, ENTRY_COUNT(1),                         // One recursive group...
       kWasmRecursiveTypeGroupCode, ENTRY_COUNT(3),  // with three entries.
       WASM_STRUCT_DEF(FIELD_COUNT(3), STRUCT_FIELD(kI32Code, true),
@@ -3359,7 +3365,7 @@ TEST_F(WasmModuleVerifyTest, GcStructIdsPass) {
 
 TEST_F(WasmModuleVerifyTest, OutOfBoundsTypeInGlobal) {
   WASM_FEATURE_SCOPE(typed_funcref);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Global, ENTRY_COUNT(1), kRefCode, 0, WASM_REF_NULL(0), kExprEnd)};
   ModuleResult result = DecodeModule(base::ArrayVector(data));
   EXPECT_NOT_OK(result, "Type index 0 is out of bounds");
@@ -3368,7 +3374,7 @@ TEST_F(WasmModuleVerifyTest, OutOfBoundsTypeInGlobal) {
 TEST_F(WasmModuleVerifyTest, OutOfBoundsTypeInType) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte data[] = {SECTION(
+  static const uint8_t data[] = {SECTION(
       Type, ENTRY_COUNT(1),
       WASM_STRUCT_DEF(FIELD_COUNT(1),
                       STRUCT_FIELD(WASM_REF_TYPE(ValueType::Ref(1)), true)))};
@@ -3379,7 +3385,7 @@ TEST_F(WasmModuleVerifyTest, OutOfBoundsTypeInType) {
 TEST_F(WasmModuleVerifyTest, RecursiveTypeOutsideRecursiveGroup) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1),
               WASM_STRUCT_DEF(
                   FIELD_COUNT(1),
@@ -3391,7 +3397,7 @@ TEST_F(WasmModuleVerifyTest, RecursiveTypeOutsideRecursiveGroup) {
 TEST_F(WasmModuleVerifyTest, OutOfBoundsSupertype) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), kWasmRecursiveTypeGroupCode, ENTRY_COUNT(1),
               kWasmSubtypeCode, ENTRY_COUNT(1), 1,
               WASM_STRUCT_DEF(FIELD_COUNT(1), STRUCT_FIELD(kI32Code, true)))};
@@ -3402,7 +3408,7 @@ TEST_F(WasmModuleVerifyTest, OutOfBoundsSupertype) {
 TEST_F(WasmModuleVerifyTest, ForwardSupertypeSameType) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), kWasmRecursiveTypeGroupCode, ENTRY_COUNT(1),
               kWasmSubtypeCode, ENTRY_COUNT(1), 0,
               WASM_STRUCT_DEF(FIELD_COUNT(1), STRUCT_FIELD(kI32Code, true)))};
@@ -3413,7 +3419,7 @@ TEST_F(WasmModuleVerifyTest, ForwardSupertypeSameType) {
 TEST_F(WasmModuleVerifyTest, ForwardSupertypeSameRecGroup) {
   WASM_FEATURE_SCOPE(typed_funcref);
   WASM_FEATURE_SCOPE(gc);
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Type, ENTRY_COUNT(1), kWasmRecursiveTypeGroupCode, ENTRY_COUNT(2),
               kWasmSubtypeCode, ENTRY_COUNT(1), 0,
               WASM_STRUCT_DEF(FIELD_COUNT(1), STRUCT_FIELD(kI32Code, true)),
@@ -3426,7 +3432,7 @@ TEST_F(WasmModuleVerifyTest, IllegalPackedFields) {
   WASM_FEATURE_SCOPE(gc);
   WASM_FEATURE_SCOPE(typed_funcref);
 
-  static const byte data[] = {
+  static const uint8_t data[] = {
       SECTION(Global, ENTRY_COUNT(1), kI16Code, 0, WASM_INIT_EXPR_I32V_1(13))};
 
   ModuleResult result = DecodeModule(base::ArrayVector(data));
@@ -3438,15 +3444,15 @@ TEST_F(WasmModuleVerifyTest, Memory64DataSegment) {
   WASM_FEATURE_SCOPE(memory64);
   for (bool enable_memory64 : {false, true}) {
     for (bool use_memory64 : {false, true}) {
-      byte const_opcode = use_memory64 ? kExprI64Const : kExprI32Const;
-      const byte data[] = {
+      uint8_t const_opcode = use_memory64 ? kExprI64Const : kExprI32Const;
+      const uint8_t data[] = {
           SECTION(Memory, ENTRY_COUNT(1),
                   enable_memory64 ? kMemory64WithMaximum : kWithMaximum, 28,
                   28),
-          SECTION(Data, ENTRY_COUNT(1), LINEAR_MEMORY_INDEX_0,  // -
-                  const_opcode, 0, kExprEnd,                    // dest addr
-                  U32V_1(3),                                    // source size
-                  'a', 'b', 'c')                                // data bytes
+          SECTION(Data, ENTRY_COUNT(1), ACTIVE_NO_INDEX,  // -
+                  const_opcode, 0, kExprEnd,              // dest addr
+                  U32V_1(3),                              // source size
+                  'a', 'b', 'c')                          // data bytes
       };
 
       if (enable_memory64 == use_memory64) {
diff --git a/deps/v8/test/unittests/wasm/streaming-decoder-unittest.cc b/deps/v8/test/unittests/wasm/streaming-decoder-unittest.cc
index 857520f364b1f2..7fc355bed71ced 100644
--- a/deps/v8/test/unittests/wasm/streaming-decoder-unittest.cc
+++ b/deps/v8/test/unittests/wasm/streaming-decoder-unittest.cc
@@ -30,7 +30,7 @@ struct MockStreamingResult {
 
 class NoTracer {
  public:
-  void Bytes(const byte* start, uint32_t count) {}
+  void Bytes(const uint8_t* start, uint32_t count) {}
   void Description(const char* desc) {}
 };
 
@@ -39,8 +39,7 @@ class MockStreamingProcessor : public StreamingProcessor {
   explicit MockStreamingProcessor(MockStreamingResult* result)
       : result_(result) {}
 
-  bool ProcessModuleHeader(base::Vector<const uint8_t> bytes,
-                           uint32_t offset) override {
+  bool ProcessModuleHeader(base::Vector<const uint8_t> bytes) override {
     Decoder decoder(bytes.begin(), bytes.end());
     uint32_t magic_word = decoder.consume_u32("wasm magic", ITracer::NoTrace);
     if (decoder.failed() || magic_word != kWasmMagic) {
diff --git a/deps/v8/test/unittests/wasm/subtyping-unittest.cc b/deps/v8/test/unittests/wasm/subtyping-unittest.cc
index fd085d0e75f445..60ed42f3d4aefe 100644
--- a/deps/v8/test/unittests/wasm/subtyping-unittest.cc
+++ b/deps/v8/test/unittests/wasm/subtyping-unittest.cc
@@ -89,8 +89,8 @@ TEST_F(WasmSubtypingTest, Subtyping) {
     /* 12 */ DefineSignature(module, {kWasmI32, kWasmI32}, {kWasmI32});
     /* 13 */ DefineSignature(module, {ref(1)}, {kWasmI32});
     /* 14 */ DefineSignature(module, {ref(0)}, {kWasmI32}, 13);
-    /* 15 */ DefineSignature(module, {ref(0)}, {ref(4)}, 16);
-    /* 16 */ DefineSignature(module, {ref(0)}, {ref(0)});
+    /* 15 */ DefineSignature(module, {ref(0)}, {ref(0)});
+    /* 16 */ DefineSignature(module, {ref(0)}, {ref(4)}, 15);
     /* 17 */ DefineStruct(module, {mut(kWasmI32), immut(refNull(17))});
 
     // Rec. group.
@@ -310,7 +310,7 @@ TEST_F(WasmSubtypingTest, Subtyping) {
     // Parameter contravariance holds.
     VALID_SUBTYPE(ref(14), ref(13));
     // Return type covariance holds.
-    VALID_SUBTYPE(ref(15), ref(16));
+    VALID_SUBTYPE(ref(16), ref(15));
     // Identical types are subtype-related.
     VALID_SUBTYPE(ref(10), ref(10));
     VALID_SUBTYPE(ref(11), ref(11));
diff --git a/deps/v8/test/unittests/wasm/trap-handler-simulator-unittest.cc b/deps/v8/test/unittests/wasm/trap-handler-simulator-unittest.cc
index 01d446879b3132..74cef45a025509 100644
--- a/deps/v8/test/unittests/wasm/trap-handler-simulator-unittest.cc
+++ b/deps/v8/test/unittests/wasm/trap-handler-simulator-unittest.cc
@@ -13,9 +13,7 @@
 #include "test/common/assembler-tester.h"
 #include "test/unittests/test-utils.h"
 
-#if !V8_HOST_ARCH_X64 || !V8_TARGET_ARCH_ARM64
-#error "Only include this file on arm64 simulator builds on x64."
-#endif
+#ifdef V8_TRAP_HANDLER_VIA_SIMULATOR
 
 namespace v8 {
 namespace internal {
@@ -123,7 +121,7 @@ TEST_F(SimulatorTrapHandlerTest, ProbeMemoryWithLandingPad) {
   masm.Ret();
 
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
 
   constexpr bool kUseDefaultHandler = true;
   CHECK(v8::V8::EnableWebAssemblyTrapHandler(kUseDefaultHandler));
@@ -151,3 +149,5 @@ TEST_F(SimulatorTrapHandlerTest, ProbeMemoryWithLandingPad) {
 }  // namespace trap_handler
 }  // namespace internal
 }  // namespace v8
+
+#endif  // V8_TRAP_HANDLER_VIA_SIMULATOR
diff --git a/deps/v8/test/unittests/wasm/trap-handler-x64-arm64-unittest.cc b/deps/v8/test/unittests/wasm/trap-handler-x64-arm64-unittest.cc
index d06c780c352564..b5da3687a853d7 100644
--- a/deps/v8/test/unittests/wasm/trap-handler-x64-arm64-unittest.cc
+++ b/deps/v8/test/unittests/wasm/trap-handler-x64-arm64-unittest.cc
@@ -35,7 +35,7 @@
 
 #if V8_TRAP_HANDLER_SUPPORTED
 
-#if V8_HOST_ARCH_ARM64 && !V8_OS_DARWIN
+#if V8_HOST_ARCH_ARM64 && (!V8_OS_LINUX && !V8_OS_DARWIN)
 #error Unsupported platform
 #endif
 
@@ -173,7 +173,7 @@ class TrapHandlerTest : public TestWithIsolate,
 #endif
     __ Ret();
     CodeDesc desc;
-    masm.GetCode(nullptr, &desc);
+    masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
     recovery_buffer_->MakeExecutable();
     g_recovery_address =
         reinterpret_cast<Address>(desc.buffer + recovery_offset);
@@ -206,6 +206,8 @@ class TrapHandlerTest : public TestWithIsolate,
     uc->uc_mcontext->__ss.__pc = g_recovery_address;
 #elif V8_OS_DARWIN && V8_HOST_ARCH_X64
     uc->uc_mcontext->__ss.__rip = g_recovery_address;
+#elif V8_OS_LINUX && V8_HOST_ARCH_ARM64
+    uc->uc_mcontext.pc = g_recovery_address;
 #elif V8_OS_LINUX && V8_HOST_ARCH_X64
     uc->uc_mcontext.gregs[REG_RIP] = g_recovery_address;
 #elif V8_OS_FREEBSD
@@ -351,7 +353,7 @@ TEST_P(TrapHandlerTest, TestTrapHandlerRecovery) {
 #endif
   __ Ret();
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
 
   trap_handler::ProtectedInstructionData protected_instruction{crash_offset,
                                                                recovery_offset};
@@ -389,7 +391,7 @@ TEST_P(TrapHandlerTest, TestReleaseHandlerData) {
 #endif
   __ Ret();
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
 
   trap_handler::ProtectedInstructionData protected_instruction{crash_offset,
                                                                recovery_offset};
@@ -430,7 +432,7 @@ TEST_P(TrapHandlerTest, TestNoThreadInWasmFlag) {
 #endif
   __ Ret();
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
 
   trap_handler::ProtectedInstructionData protected_instruction{crash_offset,
                                                                recovery_offset};
@@ -470,7 +472,7 @@ TEST_P(TrapHandlerTest, TestCrashInWasmNoProtectedInstruction) {
 #endif
   __ Ret();
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
 
   trap_handler::ProtectedInstructionData protected_instruction{no_crash_offset,
                                                                recovery_offset};
@@ -508,7 +510,7 @@ TEST_P(TrapHandlerTest, TestCrashInWasmWrongCrashType) {
 #endif
   __ Ret();
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
 
   trap_handler::ProtectedInstructionData protected_instruction{crash_offset,
                                                                recovery_offset};
@@ -578,7 +580,7 @@ TEST_P(TrapHandlerTest, TestCrashInOtherThread) {
 #endif
   __ Ret();
   CodeDesc desc;
-  masm.GetCode(nullptr, &desc);
+  masm.GetCode(static_cast<LocalIsolate*>(nullptr), &desc);
 
   trap_handler::ProtectedInstructionData protected_instruction{crash_offset,
                                                                recovery_offset};
diff --git a/deps/v8/test/unittests/wasm/wasm-compiler-unittest.cc b/deps/v8/test/unittests/wasm/wasm-compiler-unittest.cc
index b9970cc097d064..e80bc94164be56 100644
--- a/deps/v8/test/unittests/wasm/wasm-compiler-unittest.cc
+++ b/deps/v8/test/unittests/wasm/wasm-compiler-unittest.cc
@@ -41,7 +41,7 @@ TEST_F(WasmCallDescriptorTest, TestExternRefIsGrouped) {
     int min_untagged_stack_location = std::numeric_limits<int>::max();
     for (size_t i = 1; i < desc->ParameterCount(); ++i) {
       // InputLocation i + 1, because target is the first input.
-      compiler::LinkageLocation location = desc->GetInputLocation(i + 1);
+      LinkageLocation location = desc->GetInputLocation(i + 1);
       if (desc->GetParameterType(i).IsTagged()) {
         if (location.IsRegister()) {
           has_tagged_register_param = true;
@@ -90,7 +90,7 @@ TEST_F(WasmCallDescriptorTest, Regress_1174500) {
 
   // Get the location of our stack parameter slot. Skip the implicit Wasm
   // instance parameter.
-  compiler::LinkageLocation last_param = desc->GetInputLocation(kParams + 1);
+  LinkageLocation last_param = desc->GetInputLocation(kParams + 1);
   EXPECT_TRUE(last_param.IsCallerFrameSlot());
   EXPECT_EQ(MachineType::Float32(), last_param.GetType());
   EXPECT_EQ(-1, last_param.GetLocation());
@@ -99,8 +99,7 @@ TEST_F(WasmCallDescriptorTest, Regress_1174500) {
   // argument padding slots. The return slot itself should not be padded.
   const int padding = ShouldPadArguments(1);
   const int first_return_slot = -1 - (padding + 1);
-  compiler::LinkageLocation return_location =
-      desc->GetReturnLocation(kReturns - 1);
+  LinkageLocation return_location = desc->GetReturnLocation(kReturns - 1);
   EXPECT_TRUE(return_location.IsCallerFrameSlot());
   EXPECT_EQ(MachineType::Simd128(), return_location.GetType());
   EXPECT_EQ(first_return_slot, return_location.GetLocation());
diff --git a/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-gc.wasm.inc b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-gc.wasm.inc
index 01fdedfd1bd833..6424673d58a1a5 100644
--- a/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-gc.wasm.inc
+++ b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-gc.wasm.inc
@@ -60,10 +60,10 @@
   0xd0, 0x65, 0x0b,        // ref.null none
 
   0x0a,                    // section kind: Code
-  0x99, 0x01,              // section length 153
+  0x9d, 0x01,              // section length 157
   0x01,                    // functions count 1
                            // function #0 $func0
-  0x96, 0x01,              // body size 150
+  0x9a, 0x01,              // body size 154
   0x00,                    // 0 entries in locals list
   0xfb, 0x08, 0x01,        // struct.new_default $type1
   0xfb, 0x03, 0x01, 0x00,  // struct.get $type1 $field0
@@ -124,10 +124,13 @@
   0x20, 0x00,              // local.get $var0
   0xd6, 0x00,              // br_on_non_null $label0
   0x20, 0x00,              // local.get $var0
-  0xfb, 0x46, 0x00, 0x01,  // br_on_cast $label0 $type1
+  0xfb, 0x4e, 0x01, 0x00, 0x00, 0x01,
+                           // br_on_cast $label0 (ref null $type0) (ref $type1)
   0x1a,                    // drop
   0x20, 0x00,              // local.get $var0
-  0xfb, 0x47, 0x00, 0x01,  // br_on_cast_fail $label0 $type1
+  0xfb, 0x4f, 0x02, 0x00, 0x00, 0x01,
+                           // br_on_cast_fail $label0 (ref $type0)
+                           //   (ref null $type1)
   0x1a,                    // drop
   0x20, 0x00,              // local.get $var0
   0x0b,                    // end $label0
diff --git a/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-gc.wat.inc b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-gc.wat.inc
index 1189fffa144e8c..07b176e4d9f18f 100644
--- a/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-gc.wat.inc
+++ b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-gc.wat.inc
@@ -91,14 +91,11 @@
       local.get $var0
       br_on_non_null $label0
       local.get $var0
-      br_on_cast $label0 $type1
+      br_on_cast $label0 (ref null $type0) (ref $type1)
       drop
       local.get $var0
-      br_on_cast_fail $label0 $type1
+      br_on_cast_fail $label0 (ref $type0) (ref null $type1)
       drop
-      ;; TODO: Once `br_on_cast null` is implemented, uncomment:
-      ;; local.get $var0
-      ;; br_on_cast $label0 null $type1
       local.get $var0
     end $label0
     drop
diff --git a/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-stringref.wasm.inc b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-stringref.wasm.inc
new file mode 100644
index 00000000000000..da4b720ff993b2
--- /dev/null
+++ b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-stringref.wasm.inc
@@ -0,0 +1,29 @@
+  0x00, 0x61, 0x73, 0x6d,  // wasm magic
+  0x01, 0x00, 0x00, 0x00,  // wasm version
+
+  0x01,                    // section kind: Type
+  0x06,                    // section length 6
+  0x01, 0x4f,              // types count 1: rec. group definition
+  0x01, 0x60,              // recursive group size 1:  kind: func
+  0x00,                    // param count 0
+  0x00,                    // return count 0
+
+  0x03,                    // section kind: Function
+  0x02,                    // section length 2
+  0x01, 0x00,              // functions count 1: 0 $func0
+
+  0x0e,                    // section kind: StringRef
+  0x06,                    // section length 6
+  0x00,                    // deferred string literal count 0
+  0x01, 0x03,              // string literal count 1: string literal length: 3
+  0x66, 0x6f, 0x6f,        // string literal: foo
+
+  0x0a,                    // section kind: Code
+  0x09,                    // section length 9
+  0x01,                    // functions count 1
+                           // function #0 $func0
+  0x07,                    // body size 7
+  0x00,                    // 0 entries in locals list
+  0xfb, 0x82, 0x01, 0x00,  // string.const "foo" (;0;)
+  0x1a,                    // drop
+  0x0b,                    // end
diff --git a/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-stringref.wat.inc b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-stringref.wat.inc
new file mode 100644
index 00000000000000..74eb884b3b2a43
--- /dev/null
+++ b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest-stringref.wat.inc
@@ -0,0 +1,10 @@
+;; expected = R"---(;; This is a polyglot C++/WAT file.
+;; Comment lines are ignored and not expected in the disassembler output.
+(module
+  (string "foo" (;0;))
+  (func $func0
+    string.const "foo" (;0;)
+    drop
+  )
+)
+;;)---";
diff --git a/deps/v8/test/unittests/wasm/wasm-disassembler-unittest.cc b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest.cc
index 39b14b46ceb891..eb388d14f92aee 100644
--- a/deps/v8/test/unittests/wasm/wasm-disassembler-unittest.cc
+++ b/deps/v8/test/unittests/wasm/wasm-disassembler-unittest.cc
@@ -20,12 +20,14 @@ class WasmDisassemblerTest : public ::v8::TestWithPlatform {};
 
 // Code that is shared for all tests, the only difference is the input module
 // and expected disassembler output.
-void CheckDisassemblerOutput(base::Vector<const byte> module_bytes,
+void CheckDisassemblerOutput(base::Vector<const uint8_t> module_bytes,
                              std::string expected_output) {
   AccountingAllocator allocator;
 
   ModuleResult module_result = DecodeWasmModuleForDisassembler(module_bytes);
-  DCHECK(module_result.ok());
+  ASSERT_TRUE(module_result.ok())
+      << "Decoding error: " << module_result.error().message() << " at offset "
+      << module_result.error().offset();
   WasmModule* module = module_result.value().get();
 
   ModuleWireBytes wire_bytes(module_bytes);
@@ -33,12 +35,14 @@ void CheckDisassemblerOutput(base::Vector<const byte> module_bytes,
 
   MultiLineStringBuilder output_sb;
 
-  ModuleDisassembler md(output_sb, module, &names, wire_bytes, &allocator);
+  constexpr bool kNoOffsets = false;
+  ModuleDisassembler md(output_sb, module, &names, wire_bytes, &allocator,
+                        kNoOffsets);
   constexpr size_t max_mb = 100;  // Even 1 would be enough.
   md.PrintModule({0, 2}, max_mb);
 
   std::ostringstream output;
-  output_sb.WriteTo(output);
+  output_sb.WriteTo(output, kNoOffsets);
 
   // Remove comment lines from expected output since they cannot be recovered
   // by a disassembler.
@@ -60,7 +64,7 @@ TEST_F(WasmDisassemblerTest, Mvp) {
   // wat2wasm wasm-disassembler-unittest-mvp.wat.inc --output=-
   // | wami --full-hexdump
   // | head -n-1 | tail -n+2 > wasm-disassembler-unittest-mvp.wasm.inc
-  constexpr byte module_bytes[] = {
+  constexpr uint8_t module_bytes[] = {
 #include "wasm-disassembler-unittest-mvp.wasm.inc"
   };
 
@@ -82,7 +86,7 @@ TEST_F(WasmDisassemblerTest, Mvp) {
 TEST_F(WasmDisassemblerTest, Names) {
   // You can create a binary with a custom name section from the text format via
   // `wat2wasm --debug-names`.
-  constexpr byte module_bytes[] = {
+  constexpr uint8_t module_bytes[] = {
 #include "wasm-disassembler-unittest-names.wasm.inc"
   };
   std::string expected;
@@ -91,7 +95,7 @@ TEST_F(WasmDisassemblerTest, Names) {
 }
 
 TEST_F(WasmDisassemblerTest, InvalidNameSection) {
-  constexpr byte module_bytes[] = {
+  constexpr uint8_t module_bytes[] = {
 #include "wasm-disassembler-unittest-bad-name-section.wasm.inc"
   };
   std::string expected(
@@ -102,7 +106,7 @@ TEST_F(WasmDisassemblerTest, InvalidNameSection) {
 }
 
 TEST_F(WasmDisassemblerTest, Simd) {
-  constexpr byte module_bytes[] = {
+  constexpr uint8_t module_bytes[] = {
 #include "wasm-disassembler-unittest-simd.wasm.inc"
   };
   std::string expected;
@@ -113,7 +117,7 @@ TEST_F(WasmDisassemblerTest, Simd) {
 TEST_F(WasmDisassemblerTest, Gc) {
   // Since WABT's `wat2wasm` didn't support some GC features yet, I used
   // Binaryen's `wasm-as --enable-gc --hybrid` here to produce the binary.
-  constexpr byte module_bytes[] = {
+  constexpr uint8_t module_bytes[] = {
 #include "wasm-disassembler-unittest-gc.wasm.inc"
   };
   std::string expected;
@@ -122,7 +126,7 @@ TEST_F(WasmDisassemblerTest, Gc) {
 }
 
 TEST_F(WasmDisassemblerTest, TooManyends) {
-  constexpr byte module_bytes[] = {
+  constexpr uint8_t module_bytes[] = {
 #include "wasm-disassembler-unittest-too-many-ends.wasm.inc"
   };
   std::string expected;
@@ -130,6 +134,15 @@ TEST_F(WasmDisassemblerTest, TooManyends) {
   CheckDisassemblerOutput(base::ArrayVector(module_bytes), expected);
 }
 
+TEST_F(WasmDisassemblerTest, Stringref) {
+  constexpr uint8_t module_bytes[] = {
+#include "wasm-disassembler-unittest-stringref.wasm.inc"
+  };
+  std::string expected;
+#include "wasm-disassembler-unittest-stringref.wat.inc"
+  CheckDisassemblerOutput(base::ArrayVector(module_bytes), expected);
+}
+
 // TODO(dlehmann): Add tests for the following Wasm features and extensions:
 // - custom name section for Wasm GC constructs (struct and array type names,
 // struct fields).
diff --git a/deps/v8/test/unittests/wasm/wasm-macro-gen-unittest.cc b/deps/v8/test/unittests/wasm/wasm-macro-gen-unittest.cc
index 3a308d46d86b17..338b01bf23a445 100644
--- a/deps/v8/test/unittests/wasm/wasm-macro-gen-unittest.cc
+++ b/deps/v8/test/unittests/wasm/wasm-macro-gen-unittest.cc
@@ -14,7 +14,7 @@ class WasmMacroGenTest : public TestWithZone {};
 
 #define EXPECT_SIZE(size, ...)                          \
   do {                                                  \
-    byte code[] = {__VA_ARGS__};                        \
+    uint8_t code[] = {__VA_ARGS__};                     \
     USE(code);                                          \
     EXPECT_EQ(static_cast<size_t>(size), sizeof(code)); \
   } while (false)
diff --git a/deps/v8/test/unittests/wasm/wasm-module-builder-unittest.cc b/deps/v8/test/unittests/wasm/wasm-module-builder-unittest.cc
index 2bfe2b6df5e757..cb26e713f3e118 100644
--- a/deps/v8/test/unittests/wasm/wasm-module-builder-unittest.cc
+++ b/deps/v8/test/unittests/wasm/wasm-module-builder-unittest.cc
@@ -28,7 +28,7 @@ TEST_F(WasmModuleBuilderTest, Regression_647329) {
   // Test crashed with asan.
   ZoneBuffer buffer(zone());
   const size_t kSize = ZoneBuffer::kInitialSize * 3 + 4096 + 100;
-  byte data[kSize] = {0};
+  uint8_t data[kSize] = {0};
   buffer.write(data, kSize);
 }
 
diff --git a/deps/v8/test/unittests/zone/zone-chunk-list-unittest.cc b/deps/v8/test/unittests/zone/zone-chunk-list-unittest.cc
index 697d29c28f1b42..fb37e62083b617 100644
--- a/deps/v8/test/unittests/zone/zone-chunk-list-unittest.cc
+++ b/deps/v8/test/unittests/zone/zone-chunk-list-unittest.cc
@@ -21,10 +21,12 @@ TEST_F(ZoneChunkListTest, ForwardIterationTest) {
   Zone zone(&allocator, ZONE_NAME);
 
   ZoneChunkList<uintptr_t> zone_chunk_list(&zone);
+  EXPECT_EQ(zone_chunk_list.begin(), zone_chunk_list.end());
 
   for (size_t i = 0; i < kItemCount; ++i) {
     zone_chunk_list.push_back(static_cast<uintptr_t>(i));
   }
+  EXPECT_NE(zone_chunk_list.begin(), zone_chunk_list.end());
 
   size_t count = 0;
 
@@ -41,10 +43,12 @@ TEST_F(ZoneChunkListTest, ReverseIterationTest) {
   Zone zone(&allocator, ZONE_NAME);
 
   ZoneChunkList<uintptr_t> zone_chunk_list(&zone);
+  EXPECT_EQ(zone_chunk_list.rbegin(), zone_chunk_list.rend());
 
   for (size_t i = 0; i < kItemCount; ++i) {
     zone_chunk_list.push_back(static_cast<uintptr_t>(i));
   }
+  EXPECT_NE(zone_chunk_list.rbegin(), zone_chunk_list.rend());
 
   size_t count = 0;
 
@@ -152,7 +156,7 @@ TEST_F(ZoneChunkListTest, CopyToTest) {
     zone_chunk_list.push_back(static_cast<uintptr_t>(i));
   }
 
-  uintptr_t* array = zone.NewArray<uintptr_t>(kItemCount);
+  uintptr_t* array = zone.AllocateArray<uintptr_t>(kItemCount);
 
   zone_chunk_list.CopyTo(array);
 
@@ -171,7 +175,7 @@ TEST_F(ZoneChunkListTest, SmallCopyToTest) {
     zone_chunk_list.push_back(static_cast<uint8_t>(i & 0xFF));
   }
 
-  uint8_t* array = zone.NewArray<uint8_t>(kItemCount);
+  uint8_t* array = zone.AllocateArray<uint8_t>(kItemCount);
 
   zone_chunk_list.CopyTo(array);
 
@@ -195,7 +199,7 @@ TEST_F(ZoneChunkListTest, BigCopyToTest) {
     zone_chunk_list.push_back({i, i + 5});
   }
 
-  Fubar* array = zone.NewArray<Fubar>(kItemCount);
+  Fubar* array = zone.AllocateArray<Fubar>(kItemCount);
 
   zone_chunk_list.CopyTo(array);
 
@@ -238,7 +242,7 @@ TEST_F(ZoneChunkListTest, RewindAndIterate) {
   ZoneChunkList<int> zone_chunk_list(&zone);
 
   // Fill the list enough so that it will contain 2 chunks.
-  int chunk_size = static_cast<int>(ZoneChunkList<int>::StartMode::kSmall);
+  int chunk_size = static_cast<int>(ZoneChunkList<int>::kInitialChunkCapacity);
   for (int i = 0; i < chunk_size + 1; ++i) {
     zone_chunk_list.push_back(i);
   }
@@ -270,19 +274,6 @@ TEST_F(ZoneChunkListTest, RewindAndIterate) {
   }
 }
 
-TEST_F(ZoneChunkListTest, PushBackPopBackSize) {
-  // Regression test for https://bugs.chromium.org/p/v8/issues/detail?id=7489
-  AccountingAllocator allocator;
-  Zone zone(&allocator, ZONE_NAME);
-
-  ZoneChunkList<int> zone_chunk_list(&zone);
-  CHECK_EQ(size_t(0), zone_chunk_list.size());
-  zone_chunk_list.push_back(1);
-  CHECK_EQ(size_t(1), zone_chunk_list.size());
-  zone_chunk_list.pop_back();
-  CHECK_EQ(size_t(0), zone_chunk_list.size());
-}
-
 TEST_F(ZoneChunkListTest, AdvanceZeroTest) {
   AccountingAllocator allocator;
   Zone zone(&allocator, ZONE_NAME);
@@ -345,7 +336,7 @@ TEST_F(ZoneChunkListTest, FindOverChunkBoundary) {
   ZoneChunkList<int> zone_chunk_list(&zone);
 
   // Make sure we get two chunks.
-  int chunk_size = static_cast<int>(ZoneChunkList<int>::StartMode::kSmall);
+  int chunk_size = static_cast<int>(ZoneChunkList<int>::kInitialChunkCapacity);
   for (int i = 0; i < chunk_size + 1; ++i) {
     zone_chunk_list.push_back(i);
   }
@@ -355,5 +346,90 @@ TEST_F(ZoneChunkListTest, FindOverChunkBoundary) {
   }
 }
 
+TEST_F(ZoneChunkListTest, SplitAt) {
+  AccountingAllocator allocator;
+  Zone zone(&allocator, ZONE_NAME);
+
+  ZoneChunkList<size_t> zone_chunk_list(&zone);
+
+  // Make sure we get two chunks.
+  for (size_t i = 0; i < kItemCount + 1; ++i) {
+    zone_chunk_list.push_back(i);
+  }
+
+  ZoneChunkList<size_t> split_end =
+      zone_chunk_list.SplitAt(zone_chunk_list.end());
+
+  CHECK(split_end.empty());
+  size_t count = 0;
+  for (size_t item : zone_chunk_list) {
+    CHECK_EQ(item, count);
+    count++;
+  }
+  CHECK_EQ(count, kItemCount + 1);
+
+  ZoneChunkList<size_t> split_begin =
+      zone_chunk_list.SplitAt(zone_chunk_list.begin());
+
+  CHECK(zone_chunk_list.empty());
+  count = 0;
+  for (size_t item : split_begin) {
+    CHECK_EQ(item, count);
+    count++;
+  }
+  CHECK_EQ(count, kItemCount + 1);
+
+  size_t mid = kItemCount / 2 + 42;
+  ZoneChunkList<size_t> split_mid = split_begin.SplitAt(split_begin.Find(mid));
+
+  count = 0;
+  for (size_t item : split_begin) {
+    CHECK_EQ(item, count);
+    count++;
+  }
+  CHECK_EQ(count, kItemCount / 2 + 42);
+  for (size_t item : split_mid) {
+    CHECK_EQ(item, count);
+    count++;
+  }
+  CHECK_EQ(count, kItemCount + 1);
+}
+
+TEST_F(ZoneChunkListTest, SplitAtLastChunk) {
+  AccountingAllocator allocator;
+  Zone zone(&allocator, ZONE_NAME);
+
+  ZoneChunkList<size_t> zone_chunk_list(&zone);
+  zone_chunk_list.push_back(0);
+  zone_chunk_list.push_back(1);
+
+  ZoneChunkList<size_t> split_last =
+      zone_chunk_list.SplitAt(++zone_chunk_list.begin());
+  CHECK_EQ(zone_chunk_list.size(), 1);
+  CHECK_EQ(zone_chunk_list.front(), 0);
+  CHECK_EQ(split_last.size(), 1);
+  CHECK_EQ(split_last.front(), 1);
+}
+
+TEST_F(ZoneChunkListTest, Append) {
+  AccountingAllocator allocator;
+  Zone zone(&allocator, ZONE_NAME);
+
+  ZoneChunkList<size_t> zone_chunk_list(&zone);
+  zone_chunk_list.push_back(0);
+
+  ZoneChunkList<size_t> other(&zone);
+  other.push_back(1);
+
+  zone_chunk_list.Append(other);
+
+  size_t count = 0;
+  for (size_t item : zone_chunk_list) {
+    CHECK_EQ(item, count++);
+  }
+  CHECK_EQ(count, zone_chunk_list.size());
+  CHECK(other.empty());
+}
+
 }  // namespace internal
 }  // namespace v8
diff --git a/deps/v8/test/unittests/zone/zone-compact-set-unittest.cc b/deps/v8/test/unittests/zone/zone-compact-set-unittest.cc
new file mode 100644
index 00000000000000..9dec6c07d59de5
--- /dev/null
+++ b/deps/v8/test/unittests/zone/zone-compact-set-unittest.cc
@@ -0,0 +1,250 @@
+// Copyright 2023 the V8 project authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+
+#include "src/zone/zone-compact-set.h"
+
+#include "src/zone/zone.h"
+#include "test/unittests/test-utils.h"
+#include "testing/gtest/include/gtest/gtest.h"
+
+namespace v8 {
+namespace internal {
+
+struct HandleLike {
+  int* ptr;
+};
+
+bool operator==(HandleLike lhs, HandleLike rhs) { return lhs.ptr == rhs.ptr; }
+
+template <>
+struct ZoneCompactSetTraits<HandleLike> {
+  using handle_type = HandleLike;
+  using data_type = int;
+
+  static data_type* HandleToPointer(handle_type handle) { return handle.ptr; }
+  static handle_type PointerToHandle(data_type* ptr) { return HandleLike{ptr}; }
+};
+
+class ZoneCompactSetTest : public TestWithZone {
+ public:
+  HandleLike NewHandleLike(int value) {
+    return HandleLike{zone()->New<int>(value)};
+  }
+};
+
+TEST_F(ZoneCompactSetTest, Empty) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+
+  EXPECT_EQ(zone_compact_set.size(), 0u);
+  EXPECT_TRUE(zone_compact_set.is_empty());
+}
+
+TEST_F(ZoneCompactSetTest, SingleValue) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+
+  HandleLike handle = NewHandleLike(5);
+  zone_compact_set.insert(handle, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 1u);
+  EXPECT_FALSE(zone_compact_set.is_empty());
+  EXPECT_EQ(zone_compact_set.at(0), handle);
+  EXPECT_TRUE(zone_compact_set.contains(handle));
+}
+
+TEST_F(ZoneCompactSetTest, MultipleValue) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+  HandleLike handle3 = NewHandleLike(2);
+  HandleLike handle4 = NewHandleLike(1);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+  zone_compact_set.insert(handle3, zone());
+  zone_compact_set.insert(handle4, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 4u);
+  EXPECT_FALSE(zone_compact_set.is_empty());
+
+  EXPECT_TRUE(zone_compact_set.contains(handle1));
+  EXPECT_TRUE(zone_compact_set.contains(handle2));
+  EXPECT_TRUE(zone_compact_set.contains(handle3));
+  EXPECT_TRUE(zone_compact_set.contains(handle4));
+}
+
+TEST_F(ZoneCompactSetTest, DuplicateValue) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+  zone_compact_set.insert(handle2, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 2u);
+  EXPECT_FALSE(zone_compact_set.is_empty());
+
+  EXPECT_TRUE(zone_compact_set.contains(handle1));
+  EXPECT_TRUE(zone_compact_set.contains(handle2));
+}
+
+TEST_F(ZoneCompactSetTest, RemoveSingleValue) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+
+  HandleLike handle1 = NewHandleLike(5);
+
+  zone_compact_set.insert(handle1, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 1u);
+
+  zone_compact_set.remove(handle1, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 0u);
+  EXPECT_TRUE(zone_compact_set.is_empty());
+
+  EXPECT_FALSE(zone_compact_set.contains(handle1));
+}
+
+TEST_F(ZoneCompactSetTest, RemoveFromMultipleValue) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 2u);
+
+  zone_compact_set.remove(handle1, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 1u);
+  EXPECT_FALSE(zone_compact_set.is_empty());
+
+  EXPECT_FALSE(zone_compact_set.contains(handle1));
+  EXPECT_TRUE(zone_compact_set.contains(handle2));
+}
+
+TEST_F(ZoneCompactSetTest, RemoveFromEvenMoreMultipleValue) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+  HandleLike handle3 = NewHandleLike(1);
+  HandleLike handle4 = NewHandleLike(2);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+  zone_compact_set.insert(handle3, zone());
+  zone_compact_set.insert(handle4, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 4u);
+
+  zone_compact_set.remove(handle2, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 3u);
+  EXPECT_FALSE(zone_compact_set.is_empty());
+
+  EXPECT_TRUE(zone_compact_set.contains(handle1));
+  EXPECT_FALSE(zone_compact_set.contains(handle2));
+  EXPECT_TRUE(zone_compact_set.contains(handle3));
+  EXPECT_TRUE(zone_compact_set.contains(handle4));
+}
+
+TEST_F(ZoneCompactSetTest, RemoveNonExistent) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+  HandleLike handle3 = NewHandleLike(1);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+
+  zone_compact_set.remove(handle3, zone());
+
+  EXPECT_EQ(zone_compact_set.size(), 2u);
+  EXPECT_FALSE(zone_compact_set.is_empty());
+
+  EXPECT_TRUE(zone_compact_set.contains(handle1));
+  EXPECT_TRUE(zone_compact_set.contains(handle2));
+  EXPECT_FALSE(zone_compact_set.contains(handle3));
+}
+
+TEST_F(ZoneCompactSetTest, ContainsEmptySubset) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+  ZoneCompactSet<HandleLike> zone_compact_subset;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+
+  EXPECT_TRUE(zone_compact_set.contains(zone_compact_subset));
+  EXPECT_FALSE(zone_compact_subset.contains(zone_compact_set));
+}
+
+TEST_F(ZoneCompactSetTest, ContainsSingleElementSubset) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+  ZoneCompactSet<HandleLike> zone_compact_subset;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+
+  zone_compact_subset.insert(handle1, zone());
+
+  EXPECT_TRUE(zone_compact_set.contains(zone_compact_subset));
+  EXPECT_FALSE(zone_compact_subset.contains(zone_compact_set));
+}
+
+TEST_F(ZoneCompactSetTest, ContainsMultiElementSubset) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+  ZoneCompactSet<HandleLike> zone_compact_subset;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+  HandleLike handle3 = NewHandleLike(2);
+  HandleLike handle4 = NewHandleLike(1);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+  zone_compact_set.insert(handle3, zone());
+  zone_compact_set.insert(handle4, zone());
+
+  zone_compact_subset.insert(handle2, zone());
+  zone_compact_subset.insert(handle3, zone());
+
+  EXPECT_TRUE(zone_compact_set.contains(zone_compact_subset));
+  EXPECT_FALSE(zone_compact_subset.contains(zone_compact_set));
+}
+
+TEST_F(ZoneCompactSetTest, DoesNotContainsNonSubset) {
+  ZoneCompactSet<HandleLike> zone_compact_set;
+  ZoneCompactSet<HandleLike> zone_compact_other_set;
+
+  HandleLike handle1 = NewHandleLike(5);
+  HandleLike handle2 = NewHandleLike(8);
+  HandleLike handle3 = NewHandleLike(2);
+  HandleLike handle4 = NewHandleLike(1);
+
+  zone_compact_set.insert(handle1, zone());
+  zone_compact_set.insert(handle2, zone());
+  zone_compact_set.insert(handle3, zone());
+
+  zone_compact_other_set.insert(handle2, zone());
+  zone_compact_other_set.insert(handle4, zone());
+
+  EXPECT_FALSE(zone_compact_set.contains(zone_compact_other_set));
+  EXPECT_FALSE(zone_compact_other_set.contains(zone_compact_set));
+}
+
+}  // namespace internal
+}  // namespace v8
diff --git a/deps/v8/test/wasm-api-tests/callbacks.cc b/deps/v8/test/wasm-api-tests/callbacks.cc
index 55de2db0104d53..1b2fb665557e63 100644
--- a/deps/v8/test/wasm-api-tests/callbacks.cc
+++ b/deps/v8/test/wasm-api-tests/callbacks.cc
@@ -30,7 +30,7 @@ own<Trap> Stage2(void* env, const Val args[], Val results[]) {
 own<Trap> Stage4_GC(void* env, const Val args[], Val results[]) {
   printf("Stage4...\n");
   i::Isolate* isolate = reinterpret_cast<i::Isolate*>(env);
-  isolate->heap()->PreciseCollectAllGarbage(Heap::kForcedGC,
+  isolate->heap()->PreciseCollectAllGarbage(GCFlag::kForced,
                                             GarbageCollectionReason::kTesting);
   results[0] = Val::i32(args[0].i32() + 1);
   return nullptr;
@@ -43,14 +43,14 @@ class WasmCapiCallbacksTest : public WasmCapiTest {
     // int32 stage1(int32 arg0) { return stage2(arg0); }
     uint32_t stage2_index =
         builder()->AddImport(base::CStrVector("stage2"), wasm_i_i_sig());
-    byte code[] = {WASM_CALL_FUNCTION(stage2_index, WASM_LOCAL_GET(0))};
+    uint8_t code[] = {WASM_CALL_FUNCTION(stage2_index, WASM_LOCAL_GET(0))};
     AddExportedFunction(base::CStrVector("stage1"), code, sizeof(code));
 
     stage2_ = Func::make(store(), cpp_i_i_sig(), Stage2, this);
   }
 
   Func* stage2() { return stage2_.get(); }
-  void AddExportedFunction(base::Vector<const char> name, byte code[],
+  void AddExportedFunction(base::Vector<const char> name, uint8_t code[],
                            size_t code_size) {
     WasmCapiTest::AddExportedFunction(name, code, code_size, wasm_i_i_sig());
   }
@@ -64,7 +64,7 @@ class WasmCapiCallbacksTest : public WasmCapiTest {
 TEST_F(WasmCapiCallbacksTest, Trap) {
   // Build the following function:
   // int32 stage3_trap(int32 arg0) { unreachable(); }
-  byte code[] = {WASM_UNREACHABLE};
+  uint8_t code[] = {WASM_UNREACHABLE};
   AddExportedFunction(base::CStrVector("stage3_trap"), code, sizeof(code));
 
   Extern* imports[] = {stage2()};
@@ -81,7 +81,7 @@ TEST_F(WasmCapiCallbacksTest, GC) {
   // int32 stage3_to4(int32 arg0) { return stage4(arg0); }
   uint32_t stage4_index =
       builder()->AddImport(base::CStrVector("stage4"), wasm_i_i_sig());
-  byte code[] = {WASM_CALL_FUNCTION(stage4_index, WASM_LOCAL_GET(0))};
+  uint8_t code[] = {WASM_CALL_FUNCTION(stage4_index, WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("stage3_to4"), code, sizeof(code));
 
   i::Isolate* isolate =
@@ -134,7 +134,7 @@ TEST_F(WasmCapiTest, Recursion) {
   // }
   uint32_t fibo_c_index =
       builder()->AddImport(base::CStrVector("fibonacci_c"), wasm_i_i_sig());
-  byte code_fibo[] = {
+  uint8_t code_fibo[] = {
       WASM_IF(WASM_I32_EQ(WASM_LOCAL_GET(0), WASM_ZERO),
               WASM_RETURN(WASM_ZERO)),
       WASM_IF(WASM_I32_EQ(WASM_LOCAL_GET(0), WASM_ONE), WASM_RETURN(WASM_ONE)),
diff --git a/deps/v8/test/wasm-api-tests/finalize.cc b/deps/v8/test/wasm-api-tests/finalize.cc
index 77cd5884491b75..06a01aa86b229d 100644
--- a/deps/v8/test/wasm-api-tests/finalize.cc
+++ b/deps/v8/test/wasm-api-tests/finalize.cc
@@ -40,7 +40,7 @@ void RunInStore(Store* store, base::Vector<const uint8_t> wire_bytes,
                 int iterations) {
   vec<byte_t> binary = vec<byte_t>::make(
       wire_bytes.size(),
-      reinterpret_cast<byte_t*>(const_cast<byte*>(wire_bytes.begin())));
+      reinterpret_cast<byte_t*>(const_cast<uint8_t*>(wire_bytes.begin())));
   own<Module> module = Module::make(store, binary);
   module->set_host_info(reinterpret_cast<void*>(kModuleMagic), &FinalizeModule);
   for (int iteration = 0; iteration < iterations; iteration++) {
@@ -66,7 +66,7 @@ void RunInStore(Store* store, base::Vector<const uint8_t> wire_bytes,
 
 TEST_F(WasmCapiTest, InstanceFinalization) {
   // Add a dummy function: f(x) { return x; }
-  byte code[] = {WASM_RETURN(WASM_LOCAL_GET(0))};
+  uint8_t code[] = {WASM_RETURN(WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("f"), code, sizeof(code),
                       wasm_i_i_sig());
   Compile();
diff --git a/deps/v8/test/wasm-api-tests/globals.cc b/deps/v8/test/wasm-api-tests/globals.cc
index 7f693d9cebeedf..f5e844a52780d2 100644
--- a/deps/v8/test/wasm-api-tests/globals.cc
+++ b/deps/v8/test/wasm-api-tests/globals.cc
@@ -47,45 +47,45 @@ TEST_F(WasmCapiTest, Globals) {
   ValueType i64_type[] = {kWasmI64};
   FunctionSig return_f32(1, 0, f32_type);
   FunctionSig return_i64(1, 0, i64_type);
-  byte gcfi[] = {WASM_GLOBAL_GET(cfi_index)};
+  uint8_t gcfi[] = {WASM_GLOBAL_GET(cfi_index)};
   AddExportedFunction(base::CStrVector("get const f32 import"), gcfi,
                       sizeof(gcfi), &return_f32);
-  byte gcii[] = {WASM_GLOBAL_GET(cii_index)};
+  uint8_t gcii[] = {WASM_GLOBAL_GET(cii_index)};
   AddExportedFunction(base::CStrVector("get const i64 import"), gcii,
                       sizeof(gcii), &return_i64);
-  byte gvfi[] = {WASM_GLOBAL_GET(vfi_index)};
+  uint8_t gvfi[] = {WASM_GLOBAL_GET(vfi_index)};
   AddExportedFunction(base::CStrVector("get var f32 import"), gvfi,
                       sizeof(gvfi), &return_f32);
-  byte gvii[] = {WASM_GLOBAL_GET(vii_index)};
+  uint8_t gvii[] = {WASM_GLOBAL_GET(vii_index)};
   AddExportedFunction(base::CStrVector("get var i64 import"), gvii,
                       sizeof(gvii), &return_i64);
 
-  byte gcfe[] = {WASM_GLOBAL_GET(cfe_index)};
+  uint8_t gcfe[] = {WASM_GLOBAL_GET(cfe_index)};
   AddExportedFunction(base::CStrVector("get const f32 export"), gcfe,
                       sizeof(gcfe), &return_f32);
-  byte gcie[] = {WASM_GLOBAL_GET(cie_index)};
+  uint8_t gcie[] = {WASM_GLOBAL_GET(cie_index)};
   AddExportedFunction(base::CStrVector("get const i64 export"), gcie,
                       sizeof(gcie), &return_i64);
-  byte gvfe[] = {WASM_GLOBAL_GET(vfe_index)};
+  uint8_t gvfe[] = {WASM_GLOBAL_GET(vfe_index)};
   AddExportedFunction(base::CStrVector("get var f32 export"), gvfe,
                       sizeof(gvfe), &return_f32);
-  byte gvie[] = {WASM_GLOBAL_GET(vie_index)};
+  uint8_t gvie[] = {WASM_GLOBAL_GET(vie_index)};
   AddExportedFunction(base::CStrVector("get var i64 export"), gvie,
                       sizeof(gvie), &return_i64);
 
   // Define functions for manipulating globals.
   FunctionSig param_f32(0, 1, f32_type);
   FunctionSig param_i64(0, 1, i64_type);
-  byte svfi[] = {WASM_GLOBAL_SET(vfi_index, WASM_LOCAL_GET(0))};
+  uint8_t svfi[] = {WASM_GLOBAL_SET(vfi_index, WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("set var f32 import"), svfi,
                       sizeof(svfi), &param_f32);
-  byte svii[] = {WASM_GLOBAL_SET(vii_index, WASM_LOCAL_GET(0))};
+  uint8_t svii[] = {WASM_GLOBAL_SET(vii_index, WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("set var i64 import"), svii,
                       sizeof(svii), &param_i64);
-  byte svfe[] = {WASM_GLOBAL_SET(vfe_index, WASM_LOCAL_GET(0))};
+  uint8_t svfe[] = {WASM_GLOBAL_SET(vfe_index, WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("set var f32 export"), svfe,
                       sizeof(svfe), &param_f32);
-  byte svie[] = {WASM_GLOBAL_SET(vie_index, WASM_LOCAL_GET(0))};
+  uint8_t svie[] = {WASM_GLOBAL_SET(vie_index, WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("set var i64 export"), svie,
                       sizeof(svie), &param_i64);
 
diff --git a/deps/v8/test/wasm-api-tests/hostref.cc b/deps/v8/test/wasm-api-tests/hostref.cc
index fb6181b26aaeed..09b722a795eec1 100644
--- a/deps/v8/test/wasm-api-tests/hostref.cc
+++ b/deps/v8/test/wasm-api-tests/hostref.cc
@@ -39,20 +39,22 @@ TEST_F(WasmCapiTest, HostRef) {
       base::CStrVector("global"));
   uint32_t table_index = builder()->AddTable(kWasmExternRef, 10);
   builder()->AddExport(base::CStrVector("table"), kExternalTable, table_index);
-  byte global_set_code[] = {WASM_GLOBAL_SET(global_index, WASM_LOCAL_GET(0))};
+  uint8_t global_set_code[] = {
+      WASM_GLOBAL_SET(global_index, WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("global.set"), global_set_code,
                       sizeof(global_set_code), &v_r_sig);
-  byte global_get_code[] = {WASM_GLOBAL_GET(global_index)};
+  uint8_t global_get_code[] = {WASM_GLOBAL_GET(global_index)};
   AddExportedFunction(base::CStrVector("global.get"), global_get_code,
                       sizeof(global_get_code), &r_v_sig);
-  byte table_set_code[] = {
+  uint8_t table_set_code[] = {
       WASM_TABLE_SET(table_index, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))};
   AddExportedFunction(base::CStrVector("table.set"), table_set_code,
                       sizeof(table_set_code), &v_ir_sig);
-  byte table_get_code[] = {WASM_TABLE_GET(table_index, WASM_LOCAL_GET(0))};
+  uint8_t table_get_code[] = {WASM_TABLE_GET(table_index, WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("table.get"), table_get_code,
                       sizeof(table_get_code), &r_i_sig);
-  byte func_call_code[] = {WASM_CALL_FUNCTION(func_index, WASM_LOCAL_GET(0))};
+  uint8_t func_call_code[] = {
+      WASM_CALL_FUNCTION(func_index, WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("func.call"), func_call_code,
                       sizeof(func_call_code), &r_r_sig);
 
diff --git a/deps/v8/test/wasm-api-tests/memory.cc b/deps/v8/test/wasm-api-tests/memory.cc
index 43da93b357e450..cd4217c103cb65 100644
--- a/deps/v8/test/wasm-api-tests/memory.cc
+++ b/deps/v8/test/wasm-api-tests/memory.cc
@@ -20,18 +20,18 @@ TEST_F(WasmCapiTest, Memory) {
   FunctionSig return_i32(1, 0, i32_type);
   FunctionSig param_i32_return_i32(1, 1, i32_type);
   FunctionSig param_i32_i32(0, 2, i32_type);
-  byte size_code[] = {WASM_MEMORY_SIZE};
+  uint8_t size_code[] = {WASM_MEMORY_SIZE};
   AddExportedFunction(base::CStrVector("size"), size_code, sizeof(size_code),
                       &return_i32);
-  byte load_code[] = {WASM_LOAD_MEM(MachineType::Int8(), WASM_LOCAL_GET(0))};
+  uint8_t load_code[] = {WASM_LOAD_MEM(MachineType::Int8(), WASM_LOCAL_GET(0))};
   AddExportedFunction(base::CStrVector("load"), load_code, sizeof(load_code),
                       &param_i32_return_i32);
-  byte store_code[] = {WASM_STORE_MEM(MachineType::Int8(), WASM_LOCAL_GET(0),
-                                      WASM_LOCAL_GET(1))};
+  uint8_t store_code[] = {WASM_STORE_MEM(MachineType::Int8(), WASM_LOCAL_GET(0),
+                                         WASM_LOCAL_GET(1))};
   AddExportedFunction(base::CStrVector("store"), store_code, sizeof(store_code),
                       &param_i32_i32);
 
-  byte data[] = {0x1, 0x2, 0x3, 0x4};
+  uint8_t data[] = {0x1, 0x2, 0x3, 0x4};
   builder()->AddDataSegment(data, sizeof(data), 0x1000);
 
   Instantiate(nullptr);
diff --git a/deps/v8/test/wasm-api-tests/multi-return.cc b/deps/v8/test/wasm-api-tests/multi-return.cc
index 51fdfbfe0f1c15..c3e30fa8f88d6e 100644
--- a/deps/v8/test/wasm-api-tests/multi-return.cc
+++ b/deps/v8/test/wasm-api-tests/multi-return.cc
@@ -28,9 +28,9 @@ TEST_F(WasmCapiTest, MultiReturn) {
                       kWasmI32, kWasmI64, kWasmI64, kWasmI32};
   FunctionSig sig(4, 4, reps);
   uint32_t func_index = builder()->AddImport(base::CStrVector("f"), &sig);
-  byte code[] = {WASM_CALL_FUNCTION(func_index, WASM_LOCAL_GET(0),
-                                    WASM_LOCAL_GET(2), WASM_LOCAL_GET(1),
-                                    WASM_LOCAL_GET(3))};
+  uint8_t code[] = {WASM_CALL_FUNCTION(func_index, WASM_LOCAL_GET(0),
+                                       WASM_LOCAL_GET(2), WASM_LOCAL_GET(1),
+                                       WASM_LOCAL_GET(3))};
   AddExportedFunction(base::CStrVector("g"), code, sizeof(code), &sig);
 
   ownvec<ValType> types =
diff --git a/deps/v8/test/wasm-api-tests/reflect.cc b/deps/v8/test/wasm-api-tests/reflect.cc
index 9831e693bb6338..994ff84449240b 100644
--- a/deps/v8/test/wasm-api-tests/reflect.cc
+++ b/deps/v8/test/wasm-api-tests/reflect.cc
@@ -34,7 +34,7 @@ void ExpectName(const char* expected, const ::wasm::Name& name) {
 
 TEST_F(WasmCapiTest, Reflect) {
   // Create a module exporting a function, a global, a table, and a memory.
-  byte code[] = {WASM_UNREACHABLE};
+  uint8_t code[] = {WASM_UNREACHABLE};
   ValueType types[] = {kWasmI32, kWasmExternRef, kWasmI32,
                        kWasmI64, kWasmF32,       kWasmF64};
   FunctionSig sig(2, 4, types);
diff --git a/deps/v8/test/wasm-api-tests/regressions.cc b/deps/v8/test/wasm-api-tests/regressions.cc
index ba5e98ba9f5ef9..12babfc0169494 100644
--- a/deps/v8/test/wasm-api-tests/regressions.cc
+++ b/deps/v8/test/wasm-api-tests/regressions.cc
@@ -10,7 +10,7 @@ namespace wasm {
 
 TEST_F(WasmCapiTest, Regressions) {
   FunctionSig sig(0, 0, nullptr);
-  byte code[] = {WASM_UNREACHABLE};
+  uint8_t code[] = {WASM_UNREACHABLE};
   WasmFunctionBuilder* start_func = builder()->AddFunction(&sig);
   start_func->EmitCode(code, static_cast<uint32_t>(sizeof(code)));
   start_func->Emit(kExprEnd);
diff --git a/deps/v8/test/wasm-api-tests/serialize.cc b/deps/v8/test/wasm-api-tests/serialize.cc
index 80af51855d35dd..5916ce9abe9995 100644
--- a/deps/v8/test/wasm-api-tests/serialize.cc
+++ b/deps/v8/test/wasm-api-tests/serialize.cc
@@ -25,7 +25,7 @@ TEST_F(WasmCapiTest, Serialize) {
   FunctionSig sig(0, 0, nullptr);
   uint32_t callback_index =
       builder()->AddImport(base::CStrVector("callback"), &sig);
-  byte code[] = {WASM_CALL_FUNCTION0(callback_index)};
+  uint8_t code[] = {WASM_CALL_FUNCTION0(callback_index)};
   AddExportedFunction(base::CStrVector("run"), code, sizeof(code), &sig);
   Compile();
 
@@ -37,9 +37,9 @@ TEST_F(WasmCapiTest, Serialize) {
   ResetModule();
   Heap* heap =
       reinterpret_cast<::wasm::StoreImpl*>(store())->i_isolate()->heap();
-  heap->PreciseCollectAllGarbage(Heap::kForcedGC,
+  heap->PreciseCollectAllGarbage(GCFlag::kForced,
                                  GarbageCollectionReason::kTesting);
-  heap->PreciseCollectAllGarbage(Heap::kForcedGC,
+  heap->PreciseCollectAllGarbage(GCFlag::kForced,
                                  GarbageCollectionReason::kTesting);
   own<Module> deserialized = Module::deserialize(store(), serialized);
 
diff --git a/deps/v8/test/wasm-api-tests/startup-errors.cc b/deps/v8/test/wasm-api-tests/startup-errors.cc
index 26fdbfc6c7f534..0703f4dc5ef4d7 100644
--- a/deps/v8/test/wasm-api-tests/startup-errors.cc
+++ b/deps/v8/test/wasm-api-tests/startup-errors.cc
@@ -16,7 +16,7 @@ own<Trap> DummyCallback(const Val args[], Val results[]) { return nullptr; }
 
 TEST_F(WasmCapiTest, StartupErrors) {
   FunctionSig sig(0, 0, nullptr);
-  byte code[] = {WASM_UNREACHABLE};
+  uint8_t code[] = {WASM_UNREACHABLE};
   WasmFunctionBuilder* start_func = builder()->AddFunction(&sig);
   start_func->EmitCode(code, static_cast<uint32_t>(sizeof(code)));
   start_func->Emit(kExprEnd);
@@ -34,8 +34,7 @@ TEST_F(WasmCapiTest, StartupErrors) {
   EXPECT_NE(nullptr, trap);
   EXPECT_STREQ(
       "Uncaught LinkError: instantiation: Import #0 module=\"\" "
-      "function=\"dummy\" "
-      "error: imported function does not match the expected type",
+      "function=\"dummy\": imported function does not match the expected type",
       trap->message().get());
   EXPECT_EQ(nullptr, trap->origin());
   // Don't crash if there is no {trap}.
diff --git a/deps/v8/test/wasm-api-tests/table.cc b/deps/v8/test/wasm-api-tests/table.cc
index 4425a678f08e4e..9ffad8ee1452ea 100644
--- a/deps/v8/test/wasm-api-tests/table.cc
+++ b/deps/v8/test/wasm-api-tests/table.cc
@@ -42,14 +42,14 @@ TEST_F(WasmCapiTest, Table) {
   const uint32_t sig_i_i_index = builder()->AddSignature(wasm_i_i_sig(), true);
   ValueType reps[] = {kWasmI32, kWasmI32, kWasmI32};
   FunctionSig call_sig(1, 2, reps);
-  byte call_code[] = {
+  uint8_t call_code[] = {
       WASM_CALL_INDIRECT(sig_i_i_index, WASM_LOCAL_GET(0), WASM_LOCAL_GET(1))};
   AddExportedFunction(base::CStrVector("call_indirect"), call_code,
                       sizeof(call_code), &call_sig);
-  byte f_code[] = {WASM_LOCAL_GET(0)};
+  uint8_t f_code[] = {WASM_LOCAL_GET(0)};
   AddExportedFunction(base::CStrVector("f"), f_code, sizeof(f_code),
                       wasm_i_i_sig());
-  byte g_code[] = {WASM_I32V_1(42)};
+  uint8_t g_code[] = {WASM_I32V_1(42)};
   AddExportedFunction(base::CStrVector("g"), g_code, sizeof(g_code),
                       wasm_i_i_sig());
   // Set table[1] to {f}, which has function index 1.
diff --git a/deps/v8/test/wasm-api-tests/testcfg.py b/deps/v8/test/wasm-api-tests/testcfg.py
index c843ddf57f3023..cbf349d88f9d26 100644
--- a/deps/v8/test/wasm-api-tests/testcfg.py
+++ b/deps/v8/test/wasm-api-tests/testcfg.py
@@ -9,6 +9,8 @@
 from testrunner.local import testsuite
 from testrunner.objects import testcase
 
+SHELL = "wasm_api_tests"
+
 
 class VariantsGenerator(testsuite.VariantsGenerator):
   def _get_variants(self, test):
@@ -17,17 +19,14 @@ def _get_variants(self, test):
 
 class TestLoader(testsuite.TestLoader):
   def _list_test_filenames(self):
-    shell = os.path.abspath(
-      os.path.join(self.test_config.shell_dir, "wasm_api_tests"))
-    if utils.IsWindows():
-      shell += ".exe"
-
     output = None
     for i in range(3): # Try 3 times in case of errors.
+      args = ['--gtest_list_tests'] + self.test_config.extra_flags
       cmd = self.ctx.command(
           cmd_prefix=self.test_config.command_prefix,
-          shell=shell,
-          args=['--gtest_list_tests'] + self.test_config.extra_flags)
+          shell=self.ctx.platform_shell(SHELL, args,
+                                        self.test_config.shell_dir),
+          args=args)
       output = cmd.execute()
       if output.exit_code == 0:
         break
@@ -70,10 +69,10 @@ def _variants_gen_class(self):
 class TestCase(testcase.TestCase):
   def _get_suite_flags(self):
     return (
-        ["--gtest_filter=" + self.path] +
-        ["--gtest_random_seed=%s" % self.random_seed] +
+        [f"--gtest_filter={self.name}"] +
+        [f"--gtest_random_seed={self.random_seed}"] +
         ["--gtest_print_time=0"]
     )
 
   def get_shell(self):
-    return "wasm_api_tests"
+    return SHELL
diff --git a/deps/v8/test/wasm-api-tests/threads.cc b/deps/v8/test/wasm-api-tests/threads.cc
index c85a773f0d118b..14b9b03fd3f9ca 100644
--- a/deps/v8/test/wasm-api-tests/threads.cc
+++ b/deps/v8/test/wasm-api-tests/threads.cc
@@ -65,7 +65,7 @@ TEST_F(WasmCapiTest, Threads) {
   uint32_t global_index =
       builder()->AddGlobalImport(base::CStrVector("id"), kWasmI32, false);
 
-  byte code[] = {
+  uint8_t code[] = {
       WASM_CALL_FUNCTION(callback_index, WASM_GLOBAL_GET(global_index))};
   FunctionSig empty_sig(0, 0, nullptr);
   AddExportedFunction(base::CStrVector("run"), code, sizeof(code), &empty_sig);
diff --git a/deps/v8/test/wasm-api-tests/traps.cc b/deps/v8/test/wasm-api-tests/traps.cc
index e5f71a13aabbe4..27f17c6207bc9b 100644
--- a/deps/v8/test/wasm-api-tests/traps.cc
+++ b/deps/v8/test/wasm-api-tests/traps.cc
@@ -39,19 +39,19 @@ TEST_F(WasmCapiTest, Traps) {
   FunctionSig sig(1, 0, i32_type);
   uint32_t callback_index =
       builder()->AddImport(base::CStrVector("callback"), &sig);
-  byte code[] = {WASM_CALL_FUNCTION0(callback_index)};
+  uint8_t code[] = {WASM_CALL_FUNCTION0(callback_index)};
   AddExportedFunction(base::CStrVector("callback"), code, sizeof(code), &sig);
 
-  byte code2[] = {WASM_CALL_FUNCTION0(3)};
+  uint8_t code2[] = {WASM_CALL_FUNCTION0(3)};
   AddExportedFunction(base::CStrVector("unreachable"), code2, sizeof(code2),
                       &sig);
   // The first constant is a 4-byte dummy so that the {unreachable} trap
   // has a more interesting offset. This is called by code2.
-  byte code3[] = {WASM_I32V_3(0), WASM_UNREACHABLE, WASM_I32V_1(1)};
+  uint8_t code3[] = {WASM_I32V_3(0), WASM_UNREACHABLE, WASM_I32V_1(1)};
   AddFunction(code3, sizeof(code3), &sig);
 
   // Check that traps returned from a C callback are uncatchable in Wasm.
-  byte code4[] = {WASM_TRY_CATCH_ALL_T(
+  uint8_t code4[] = {WASM_TRY_CATCH_ALL_T(
       kWasmI32, WASM_CALL_FUNCTION0(callback_index), WASM_I32V(42))};
   AddExportedFunction(base::CStrVector("uncatchable"), code4, sizeof(code4),
                       &sig);
diff --git a/deps/v8/test/wasm-api-tests/wasm-api-test.h b/deps/v8/test/wasm-api-tests/wasm-api-test.h
index 31c7fc1b021c6d..4b45f40450fbee 100644
--- a/deps/v8/test/wasm-api-tests/wasm-api-test.h
+++ b/deps/v8/test/wasm-api-tests/wasm-api-test.h
@@ -60,7 +60,7 @@ class WasmCapiTest : public ::testing::Test {
       size_t size = wire_bytes_.end() - wire_bytes_.begin();
       binary_ = vec<byte_t>::make(
           size,
-          reinterpret_cast<byte_t*>(const_cast<byte*>(wire_bytes_.begin())));
+          reinterpret_cast<byte_t*>(const_cast<uint8_t*>(wire_bytes_.begin())));
     }
 
     return Module::validate(store_.get(), binary_);
@@ -72,7 +72,7 @@ class WasmCapiTest : public ::testing::Test {
       size_t size = wire_bytes_.end() - wire_bytes_.begin();
       binary_ = vec<byte_t>::make(
           size,
-          reinterpret_cast<byte_t*>(const_cast<byte*>(wire_bytes_.begin())));
+          reinterpret_cast<byte_t*>(const_cast<uint8_t*>(wire_bytes_.begin())));
     }
 
     module_ = Module::make(store_.get(), binary_);
@@ -86,7 +86,7 @@ class WasmCapiTest : public ::testing::Test {
     exports_ = instance_->exports();
   }
 
-  void AddExportedFunction(base::Vector<const char> name, byte code[],
+  void AddExportedFunction(base::Vector<const char> name, uint8_t code[],
                            size_t code_size, FunctionSig* sig) {
     WasmFunctionBuilder* fun = builder()->AddFunction(sig);
     fun->EmitCode(code, static_cast<uint32_t>(code_size));
@@ -94,7 +94,7 @@ class WasmCapiTest : public ::testing::Test {
     builder()->AddExport(name, fun);
   }
 
-  void AddFunction(byte code[], size_t code_size, FunctionSig* sig) {
+  void AddFunction(uint8_t code[], size_t code_size, FunctionSig* sig) {
     WasmFunctionBuilder* fun = builder()->AddFunction(sig);
     fun->EmitCode(code, static_cast<uint32_t>(code_size));
     fun->Emit(kExprEnd);
diff --git a/deps/v8/test/wasm-js/testcfg.py b/deps/v8/test/wasm-js/testcfg.py
index 76d0295afbc8ac..563c5926f410f6 100644
--- a/deps/v8/test/wasm-js/testcfg.py
+++ b/deps/v8/test/wasm-js/testcfg.py
@@ -5,6 +5,8 @@
 import os
 import re
 
+from pathlib import Path
+
 from testrunner.local import testsuite
 from testrunner.objects import testcase
 
@@ -16,19 +18,27 @@
 proposal_flags = [
     {
         'name': 'js-types',
-        'flags': ['--experimental-wasm-type-reflection', '--wasm-staging']
+        'flags': ['--experimental-wasm-type-reflection']
     },
     {
         'name': 'tail-call',
-        'flags': ['--experimental-wasm-tail-call', '--wasm-staging']
+        'flags': ['--experimental-wasm-tail-call']
     },
     {
         'name': 'memory64',
-        'flags': ['--experimental-wasm-memory64', '--wasm-staging']
+        'flags': ['--experimental-wasm-memory64']
     },
     {
         'name': 'extended-const',
-        'flags': ['--experimental-wasm-extended-const', '--wasm-staging']
+        'flags': ['--experimental-wasm-extended-const']
+    },
+    {
+        'name': 'function-references',
+        'flags': ['--experimental-wasm-typed-funcref']
+    },
+    {
+        'name': 'gc',
+        'flags': ['--experimental-wasm-gc']
     },
 ]
 
@@ -43,9 +53,8 @@ class TestSuite(testsuite.TestSuite):
 
   def __init__(self, ctx, *args, **kwargs):
     super(TestSuite, self).__init__(ctx, *args, **kwargs)
-    self.mjsunit_js = os.path.join(os.path.dirname(self.root), "mjsunit",
-                                   "mjsunit.js")
-    self.test_root = os.path.join(self.root, "tests")
+    self.mjsunit_js = self.root.parent / "mjsunit" /"mjsunit.js"
+    self.test_root = self.root / "tests"
     self._test_loader.test_root = self.test_root
 
   def _test_loader_class(self):
@@ -54,8 +63,8 @@ def _test_loader_class(self):
   def _test_class(self):
     return TestCase
 
-def get_proposal_path_identifier(proposal):
-  return os.sep.join(['proposals', proposal['name']])
+def get_proposal_identifier(proposal):
+  return f"proposals/{proposal['name']}"
 
 class TestCase(testcase.D8TestCase):
   def _get_timeout_param(self):
@@ -73,47 +82,44 @@ def _get_timeout_param(self):
 
   def _get_files_params(self):
     files = [self.suite.mjsunit_js,
-             os.path.join(self.suite.root, "third_party", "testharness.js"),
-             os.path.join(self.suite.root, "testharness-additions.js"),
-             os.path.join(self.suite.root, "report.js")]
+             self.suite.root / "third_party" / "testharness.js",
+             self.suite.root / "testharness-additions.js",
+             self.suite.root / "report.js"]
 
     source = self.get_source()
-    current_dir = os.path.dirname(self._get_source_path())
+    current_dir = self._get_source_path().parent
     for script in META_SCRIPT_REGEXP.findall(source):
       if script.startswith(WPT_ROOT):
         # Matched an absolute path, strip the root and replace it with our
         # local root.
         found = False
         for proposal in proposal_flags:
-          if get_proposal_path_identifier(proposal) in current_dir:
+          prop_path = get_proposal_identifier(proposal)
+          if prop_path in current_dir.as_posix():
             found = True
-            script = os.path.join(self.suite.test_root,
-                                  os.sep.join(['proposals', proposal['name']]),
-                                  script[len(WPT_ROOT):])
-        if 'wpt' in current_dir:
+            script = self.suite.test_root / prop_path / script[len(WPT_ROOT):]
+        if 'wpt' in current_dir.as_posix():
           found = True
-          script = os.path.join(self.suite.test_root, 'wpt',
-                                script[len(WPT_ROOT):])
+          script = self.suite.test_root / 'wpt' / script[len(WPT_ROOT):]
         if not found:
-          script = os.path.join(self.suite.test_root, script[len(WPT_ROOT):])
-      elif not script.startswith("/"):
+          script = self.suite.test_root / script[len(WPT_ROOT):]
+      elif not Path(script).is_absolute():
         # Matched a relative path, prepend this test's directory.
-        script = os.path.join(current_dir, script)
+        script = current_dir / script
       else:
-        raise Exception("Unexpected absolute path for script: \"%s\"" % script);
+        raise Exception(f"Unexpected absolute path for script: \"{script}\"");
 
       files.append(script)
 
-    files.extend([self._get_source_path(),
-                  os.path.join(self.suite.root, "after.js")])
+    files.extend([self._get_source_path(), self.suite.root / "after.js"])
     return files
 
   def _get_source_flags(self):
     for proposal in proposal_flags:
-      if get_proposal_path_identifier(proposal) in self.path:
+      if get_proposal_identifier(proposal) in self.name:
         return proposal['flags']
     return ['--wasm-staging']
 
   def _get_source_path(self):
     # All tests are named `path/name.any.js`
-    return os.path.join(self.suite.test_root, self.path + ANY_JS)
+    return self.suite.test_root / self.path_and_suffix(ANY_JS)
diff --git a/deps/v8/test/wasm-js/tests.tar.gz.sha1 b/deps/v8/test/wasm-js/tests.tar.gz.sha1
index 100afef7850792..bdbfda6e0e1ed2 100644
--- a/deps/v8/test/wasm-js/tests.tar.gz.sha1
+++ b/deps/v8/test/wasm-js/tests.tar.gz.sha1
@@ -1 +1 @@
-250a613cbdd086814a8412f8a2836f82f2840d23
\ No newline at end of file
+f918341e5365175f69627eff31ae0865772daf5b
\ No newline at end of file
diff --git a/deps/v8/test/wasm-js/wasm-js.status b/deps/v8/test/wasm-js/wasm-js.status
index 3dd0e2f662b3a4..a25b87f41d2fa2 100644
--- a/deps/v8/test/wasm-js/wasm-js.status
+++ b/deps/v8/test/wasm-js/wasm-js.status
@@ -22,7 +22,6 @@
   'proposals/memory64/table/get-set': [FAIL],
   'proposals/tail-call/table/get-set': [FAIL],
   'proposals/js-types/memory/constructor': [FAIL],
-  'proposals/memory64/memory/constructor': [FAIL],
   'proposals/tail-call/memory/constructor': [FAIL],
   'proposals/js-types/interface': [FAIL],
   'proposals/memory64/interface': [FAIL],
@@ -34,12 +33,18 @@
   'proposals/js-types/global/value-get-set': [FAIL],
   'proposals/js-types/instance/constructor': [FAIL],
 
-  # These are slow, and not useful to run for the proposals:
+  # Limits tests are slow, and not useful to run for the proposals:
+  'proposals/extended-const/limits': [SKIP],
   'proposals/js-types/limits': [SKIP],
   'proposals/memory64/limits': [SKIP],
+  'proposals/multi-memory/limits': [SKIP],
+  'proposals/tail-call/limits': [SKIP],
 
   # Slow tests:
-  'limits': [PASS, SLOW],
+  # TODO(14258): Switch back to [PASS, SLOW] once wasm-js tests allow more
+  # than one memory. Github issue:
+  # https://github.com/WebAssembly/multi-memory/issues/49
+  'limits': [FAIL],
 }], # ALWAYS
 
 ['system == android', {
diff --git a/deps/v8/test/wasm-spec-tests/testcfg.py b/deps/v8/test/wasm-spec-tests/testcfg.py
index a87b75282c8d6e..cb9f83094bb64b 100644
--- a/deps/v8/test/wasm-spec-tests/testcfg.py
+++ b/deps/v8/test/wasm-spec-tests/testcfg.py
@@ -10,19 +10,36 @@
 proposal_flags = [
     {
         'name': 'js-types',
-        'flags': ['--experimental-wasm-type-reflection', '--wasm-staging']
+        'flags': ['--experimental-wasm-type-reflection']
     },
     {
         'name': 'tail-call',
-        'flags': ['--experimental-wasm-return-call', '--wasm-staging']
+        'flags': ['--experimental-wasm-return-call']
     },
     {
         'name': 'memory64',
-        'flags': ['--experimental-wasm-memory64', '--wasm-staging']
+        'flags': ['--experimental-wasm-memory64']
     },
     {
         'name': 'extended-const',
-        'flags': ['--experimental-wasm-extended-const', '--wasm-staging']
+        'flags': ['--experimental-wasm-extended-const']
+    },
+    {
+        'name': 'function-references',
+        # Some of these tests need `global.get` to be a constant instruction,
+        # which is part of the GC proposal. We'll ship both proposals at once
+        # anyway, so we might as well enable both for these tests.
+        'flags': [
+            '--experimental-wasm-typed-funcref', '--experimental-wasm-gc'
+        ]
+    },
+    {
+        'name': 'gc',
+        'flags': ['--experimental-wasm-gc', '--wasm-final-types']
+    },
+    {
+        'name': 'multi-memory',
+        'flags': ['--experimental-wasm-multi-memory']
     },
 ]
 
@@ -34,7 +51,7 @@ class TestSuite(testsuite.TestSuite):
 
   def __init__(self, ctx, *args, **kwargs):
     super(TestSuite, self).__init__(ctx, *args, **kwargs)
-    self.test_root = os.path.join(self.root, "tests")
+    self.test_root = self.root / "tests"
     self._test_loader.test_root = self.test_root
 
   def _test_loader_class(self):
@@ -45,10 +62,10 @@ def _test_class(self):
 
 class TestCase(testcase.D8TestCase):
   def _get_files_params(self):
-    return [os.path.join(self.suite.test_root, self.path + self._get_suffix())]
+    return [self.suite.test_root / self.path_js]
 
   def _get_source_flags(self):
     for proposal in proposal_flags:
-      if os.sep.join(['proposals', proposal['name']]) in self.path:
+      if f"proposals/{proposal['name']}" in self.name:
         return proposal['flags']
     return []
diff --git a/deps/v8/test/wasm-spec-tests/tests.tar.gz.sha1 b/deps/v8/test/wasm-spec-tests/tests.tar.gz.sha1
index 546d9a340a1675..984faf355380e9 100644
--- a/deps/v8/test/wasm-spec-tests/tests.tar.gz.sha1
+++ b/deps/v8/test/wasm-spec-tests/tests.tar.gz.sha1
@@ -1 +1 @@
-a02872d1c77253e2cc25df72465cc62ac90dc736
\ No newline at end of file
+d6ff7459f1a803d8f258100d1f9ffc6cc7402fa7
\ No newline at end of file
diff --git a/deps/v8/test/wasm-spec-tests/wasm-spec-tests.status b/deps/v8/test/wasm-spec-tests/wasm-spec-tests.status
index 9a7e12bd33347c..1f1a12f6732ee9 100644
--- a/deps/v8/test/wasm-spec-tests/wasm-spec-tests.status
+++ b/deps/v8/test/wasm-spec-tests/wasm-spec-tests.status
@@ -7,23 +7,23 @@
   'skip-stack-guard-page': [PASS, ['((arch == ppc or arch == ppc64 or arch == s390 or arch == s390x) and simulator_run)', SKIP]],
   # Missing rebase in the proposal repository.
   'proposals/js-types/table': [FAIL],
-  # "data" is supposed to fail for "data segment does not fit"; missing rebase on
-  # https://github.com/WebAssembly/spec/commit/7fa2f20a.
+  # "data" is supposed to fail for "data segment does not fit"; missing rebase
+  # on https://github.com/WebAssembly/spec/commit/7fa2f20a.
   'proposals/memory64/data': [FAIL],
-  # "elem" is supposed to fail for "elements segment does not fit"; missing rebase on
-  # https://github.com/WebAssembly/spec/commit/7fa2f20a.
+  # "elem" is supposed to fail for "elements segment does not fit"; missing
+  # rebase on https://github.com/WebAssembly/spec/commit/7fa2f20a.
   'proposals/memory64/elem': [FAIL],
   # "imports" is supposed to fail for "multiple tables"; missing rebase on
   # https://github.com/WebAssembly/spec/commit/7fa2f20a.
   'proposals/memory64/imports': [FAIL],
-  # "linking" is supposed to fail for "elements segment does not fit"; missing rebase on
-  # https://github.com/WebAssembly/spec/commit/7fa2f20a.
+  # "linking" is supposed to fail for "elements segment does not fit"; missing
+  # rebase on https://github.com/WebAssembly/spec/commit/7fa2f20a.
   'proposals/memory64/linking': [FAIL],
   # "table" is supposed to fail for "multiple tables"; missing rebase on
   # https://github.com/WebAssembly/spec/commit/7fa2f20a.
   'proposals/memory64/table': [FAIL],
-  # "unreached-invalid" is supposed to fail for "type mismatch"; missing rebase on
-  # https://github.com/WebAssembly/spec/commit/7fa2f20a.
+  # "unreached-invalid" is supposed to fail for "type mismatch"; missing rebase
+  # on https://github.com/WebAssembly/spec/commit/7fa2f20a.
   'proposals/memory64/unreached-invalid': [FAIL],
 
   # TODO(wasm): Roll newest tests into "js-types" repository.
@@ -34,6 +34,48 @@
   'simd_f64x2*': [PASS, HEAVY],
   'f32*': [PASS, HEAVY],
   'f64*': [PASS, HEAVY],
+
+  # TODO(7748): Make these pass.
+  'proposals/gc/unreached-valid': [FAIL],
+  'proposals/gc/type-subtyping': [FAIL],
+  'proposals/gc/type-rec': [FAIL],
+  'proposals/gc/type-canon': [FAIL],
+  'proposals/gc/ref': [FAIL],
+  'proposals/gc/table-sub': [FAIL],
+  'proposals/gc/return_call_ref': [FAIL],
+  'proposals/gc/ref_as_non_null': [FAIL],
+  'proposals/gc/br_on_non_null': [FAIL],
+  'proposals/gc/call_ref': [FAIL],
+  'proposals/gc/br_on_null': [FAIL],
+  'proposals/gc/type-equivalence': [FAIL],
+  # Binary encoding mismatch (official repo vs. M6 prototype spec):
+  'proposals/gc/array': [FAIL],  # Also bogus test assertion.
+  'proposals/gc/array_copy': [FAIL],
+  'proposals/gc/array_fill': [FAIL],
+  'proposals/gc/array_init_data': [FAIL],
+  'proposals/gc/array_init_elem': [FAIL],
+  'proposals/gc/br_on_cast': [FAIL],  # Also has the "hostref" issue.
+  'proposals/gc/br_on_cast_fail': [FAIL],  # Also has the "hostref" issue.
+  'proposals/gc/extern': [FAIL],  # Also has the "hostref" issue.
+  'proposals/gc/ref_cast': [FAIL],  # Also has the "hostref" issue.
+  'proposals/gc/ref_eq': [FAIL],
+  'proposals/gc/ref_test': [FAIL],  # Also has the "hostref" issue.
+  'proposals/gc/struct': [FAIL],  # Also bogus test assertion.
+  # Missing '[i]' after `actual` in `assert_return`:
+  'proposals/gc/ref_null': [FAIL],
+  'proposals/gc/table': [FAIL],
+  # "hostref is not defined":
+  'proposals/gc/br_table': [FAIL],
+  'proposals/gc/elem': [FAIL],
+  'proposals/gc/local_init': [FAIL],
+  'proposals/gc/ref_is_null': [FAIL],
+  # Missing support for i31ref in `assert_return`:
+  'proposals/gc/i31': [FAIL],
+  # Broken generated Wasm binary in the test:
+  'proposals/gc/linking': [FAIL],
+  # Broken test: single standalone type definitions are in an implicit
+  # one-entry recgroup and can hence refer to themselves.
+  'proposals/function-references/type-equivalence': [FAIL],
 }],  # ALWAYS
 
 ['arch == arm and not simulator_run', {
@@ -104,9 +146,6 @@
    'skip-stack-guard-page': '--sim-stack-size=8192',
    'proposals/tail-call/skip-stack-guard-page': '--sim-stack-size=8192',
 
-   # SIMD is not fully implemented yet.
-   'simd*': [SKIP],
-
    'func': ['variant == stress', SKIP],
 }],  # 'arch == riscv32'
 
@@ -150,7 +189,7 @@
   '*': [SKIP],
 }],  # not has_webassembly or variant == jitless
 
-################################################################################
+##############################################################################
 ['variant == stress_snapshot', {
   '*': [SKIP],  # only relevant for mjsunit tests.
 }],  # variant == stress_snapshot
@@ -159,8 +198,9 @@
 ['no_simd_hardware == True', {
   'linking': [SKIP],
   'simd*': [SKIP],
-  'proposals/tail-call/simd_lane': [SKIP],
   'proposals/js-types/linking': [SKIP],
+  'proposals/multi-memory/simd_memory-multi': [SKIP],
+  'proposals/tail-call/simd_lane': [SKIP],
 }],  # no_simd_hardware == True
 
 ##############################################################################
diff --git a/deps/v8/test/webkit/array-every-expected.txt b/deps/v8/test/webkit/array-every-expected.txt
index e82e0fb7c1c5e2..7cc28b7612771f 100644
--- a/deps/v8/test/webkit/array-every-expected.txt
+++ b/deps/v8/test/webkit/array-every-expected.txt
@@ -53,10 +53,10 @@ PASS [12, 5, 8, 130, 44].every(isBigEnoughAndException) threw exception exceptio
 PASS [12, 54, 18, 130, 44].every(isBigEnoughAndException) threw exception exception from function.
 
 5.0 Wrong Type for Callback Test
-PASS [12, 5, 8, 130, 44].every(5) threw exception TypeError: 5 is not a function.
-PASS [12, 5, 8, 130, 44].every('wrong') threw exception TypeError: wrong is not a function.
-PASS [12, 5, 8, 130, 44].every(new Object()) threw exception TypeError: #<Object> is not a function.
-PASS [12, 5, 8, 130, 44].every(null) threw exception TypeError: null is not a function.
+PASS [12, 5, 8, 130, 44].every(5) threw exception TypeError: number 5 is not a function.
+PASS [12, 5, 8, 130, 44].every('wrong') threw exception TypeError: string "wrong" is not a function.
+PASS [12, 5, 8, 130, 44].every(new Object()) threw exception TypeError: object is not a function.
+PASS [12, 5, 8, 130, 44].every(null) threw exception TypeError: object null is not a function.
 PASS [12, 5, 8, 130, 44].every(undefined) threw exception TypeError: undefined is not a function.
 PASS [12, 5, 8, 130, 44].every() threw exception TypeError: undefined is not a function.
 
diff --git a/deps/v8/test/webkit/fast/js/toString-overrides-expected.txt b/deps/v8/test/webkit/fast/js/toString-overrides-expected.txt
index 4dfe4f18e08f4d..16706e43ddc514 100644
--- a/deps/v8/test/webkit/fast/js/toString-overrides-expected.txt
+++ b/deps/v8/test/webkit/fast/js/toString-overrides-expected.txt
@@ -28,10 +28,10 @@ On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE
 
 PASS [1].toString() is '1'
 PASS [1].toLocaleString() is 'toLocaleString'
-FAIL [1].toLocaleString() should be 1. Threw exception TypeError: invalid is not a function
+FAIL [1].toLocaleString() should be 1. Threw exception TypeError: string "invalid" is not a function
 PASS [/r/].toString() is 'toString2'
 PASS [/r/].toLocaleString() is 'toLocaleString2'
-FAIL [/r/].toLocaleString() should be toString2. Threw exception TypeError: invalid is not a function
+FAIL [/r/].toLocaleString() should be toString2. Threw exception TypeError: string "invalid" is not a function
 PASS caught is true
 PASS successfullyParsed is true
 
diff --git a/deps/v8/test/webkit/testcfg.py b/deps/v8/test/webkit/testcfg.py
index ef666531d52784..d690719939f29c 100644
--- a/deps/v8/test/webkit/testcfg.py
+++ b/deps/v8/test/webkit/testcfg.py
@@ -68,15 +68,15 @@ def _parse_source_files(self, source):
         files_match = FILES_PATTERN.search(source, files_match.end())
       else:
         break
-    files = [ os.path.normpath(os.path.join(self.suite.root, '..', '..', f))
-              for f in files_list ]
-    testfilename = os.path.join(self.suite.root, self.path + self._get_suffix())
+    files = [self.suite.root.parents[1] / f for f in files_list]
+    testfilename = self.suite.root / self.path_js
     if SELF_SCRIPT_PATTERN.search(source):
-      env = ["-e", "TEST_FILE_NAME=\"%s\"" % testfilename.replace("\\", "\\\\")]
+      clean_name = testfilename.as_posix().replace("\\", "\\\\")
+      env = ['-e', f'TEST_FILE_NAME="{clean_name}"']
       files = env + files
-    files.append(os.path.join(self.suite.root, "resources/standalone-pre.js"))
+    files.append(self.suite.root / "resources/standalone-pre.js")
     files.append(testfilename)
-    files.append(os.path.join(self.suite.root, "resources/standalone-post.js"))
+    files.append(self.suite.root / "resources/standalone-post.js")
     return files
 
   def _get_files_params(self):
@@ -89,10 +89,10 @@ def _get_source_flags(self):
     return self._source_flags
 
   def _get_source_path(self):
-    return os.path.join(self.suite.root, self.path + self._get_suffix())
+    return self.suite.root / self.path_js
 
   @property
   def output_proc(self):
     return webkit.OutProc(
         self.expected_outcomes,
-        os.path.join(self.suite.root, self.path) + '-expected.txt')
+        self.suite.root / self.path_and_suffix('-expected.txt'))
diff --git a/deps/v8/test/webkit/webkit.status b/deps/v8/test/webkit/webkit.status
index 7fa7bfdf849861..5749eea05d5099 100644
--- a/deps/v8/test/webkit/webkit.status
+++ b/deps/v8/test/webkit/webkit.status
@@ -45,7 +45,7 @@
   'dfg-double-vote-fuzz': [PASS, SLOW],
   'dfg-int-overflow-in-loop': [PASS, SLOW],
 }],  # ALWAYS
-['system == windows and not is_clang', {
+['system == windows and not clang', {
   # Exceeds call stack on windows after MSVS2017 switch.
   'fast/js/excessive-comma-usage': [SKIP],
   'run-json-stringify': [SKIP],
@@ -123,9 +123,9 @@
 }],  # variant == no_wasm_traps
 
 ##############################################################################
-['no_i18n == True', {
+['not i18n', {
   'fast/js/string-capitalization': [FAIL],
-}],  # variant == no_wasm_traps
+}],  # not i18n
 
 ################################################################################
 ['variant == stress_snapshot', {
diff --git a/deps/v8/third_party/colorama/README.v8 b/deps/v8/third_party/colorama/README.v8
index 6ee5c1704516a9..f006f2a3f1c9f5 100644
--- a/deps/v8/third_party/colorama/README.v8
+++ b/deps/v8/third_party/colorama/README.v8
@@ -3,8 +3,9 @@ Short Name: colorama
 URL: https://github.com/tartley/colorama.git
 Version: 799604a104
 License: BSD
-License File: NOT_SHIPPED
+License File: LICENSE
 Security Critical: no
+Shipped: no
 
 Description:
 Provides a simple cross-platform API to print colored terminal text from Python
diff --git a/deps/v8/third_party/cpu_features/BUILD.gn b/deps/v8/third_party/cpu_features/BUILD.gn
new file mode 100644
index 00000000000000..527cf2c9aa2e9c
--- /dev/null
+++ b/deps/v8/third_party/cpu_features/BUILD.gn
@@ -0,0 +1,61 @@
+# Copyright 2023 The Chromium Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+config("cpu_features_config") {
+  cflags = [ "-Wno-unused-function" ]
+  defines = [
+    "STACK_LINE_READER_BUFFER_SIZE=1024",
+    "HAVE_STRONG_GETAUXVAL",
+  ]
+  include_dirs = [ "src/include" ]
+}
+
+config("ndk_compat_headers") {
+  include_dirs = [ "src/ndk_compat" ]
+}
+
+source_set("cpuinfo") {
+  sources = [
+    "src/src/copy.inl",
+    "src/src/define_introspection.inl",
+    "src/src/define_introspection_and_hwcaps.inl",
+    "src/src/equals.inl",
+    "src/src/filesystem.c",
+    "src/src/hwcaps.c",
+    "src/src/stack_line_reader.c",
+    "src/src/string_view.c",
+  ]
+  if (current_cpu == "x86" || current_cpu == "x64") {
+    sources += [
+      "src/src/impl_x86__base_implementation.inl",
+      "src/src/impl_x86_freebsd.c",
+      "src/src/impl_x86_linux_or_android.c",
+      "src/src/impl_x86_macos.c",
+      "src/src/impl_x86_windows.c",
+    ]
+  } else if (current_cpu == "arm") {
+    sources += [ "src/src/impl_arm_linux_or_android.c" ]
+  } else if (current_cpu == "arm64") {
+    sources += [ "src/src/impl_aarch64_linux_or_android.c" ]
+  } else if (current_cpu == "mips") {
+    sources += [ "src/src/impl_mips_linux_or_android.c" ]
+  } else if (current_cpu == "ppc") {
+    sources += [ "src/src/impl_ppc_linux.c" ]
+  } else if (current_cpu == "riscv64") {
+    sources += [ "src/src/impl_riscv_linux.c" ]
+  } else {
+    error("Missing definition for architecture: $current_cpu")
+  }
+  configs += [ ":cpu_features_config" ]
+}
+
+source_set("ndk_compat") {
+  sources = [
+    "src/ndk_compat/cpu-features.c",
+    "src/ndk_compat/cpu-features.h",
+  ]
+  configs += [ ":cpu_features_config" ]
+  public_configs = [ ":ndk_compat_headers" ]
+  deps = [ ":cpuinfo" ]
+}
diff --git a/deps/v8/third_party/cpu_features/OWNERS b/deps/v8/third_party/cpu_features/OWNERS
new file mode 100644
index 00000000000000..09e0096a2ee4cd
--- /dev/null
+++ b/deps/v8/third_party/cpu_features/OWNERS
@@ -0,0 +1 @@
+file:../../INFRA_OWNERS
diff --git a/deps/v8/third_party/cpu_features/README.v8 b/deps/v8/third_party/cpu_features/README.v8
new file mode 100644
index 00000000000000..2dc31daa7f84c9
--- /dev/null
+++ b/deps/v8/third_party/cpu_features/README.v8
@@ -0,0 +1,15 @@
+Name: cpu_features
+Short Name: cpu_features
+URL: https://github.com/google/cpu_features
+Version: v0.8.0
+Date: 2023/05/17
+License: Apache 2.0
+License File: src/LICENSE
+Security Critical: yes
+Shipped: yes
+
+Description:
+cpu_features is a library to retrieve CPU features at runtime. It is used to
+make decisions about performance optimization and features a drop-in replacement
+for Android's cpu-features.h. It is Android's recommended replacement for libraries
+that utilize cpu-features.h.
diff --git a/deps/v8/third_party/glibc/README.v8 b/deps/v8/third_party/glibc/README.v8
index 5187f7b2f06eaf..f91751a07d4386 100644
--- a/deps/v8/third_party/glibc/README.v8
+++ b/deps/v8/third_party/glibc/README.v8
@@ -2,6 +2,8 @@ Name: glibc
 URL: https://www.gnu.org/software/libc/
 License: LGPL 2.1
 License File: LICENSE
+Security Critical: yes
+Shipped: yes
 Upstream Git: https://sourceware.org/git/?p=glibc.git;a=summary
 Last Upstream Merge: 985ff73ad29bc4cc4e15ce6d182ecd808b7b02d7, Nov 1 2022
 
diff --git a/deps/v8/third_party/google_benchmark/BUILD.gn b/deps/v8/third_party/google_benchmark/BUILD.gn
index 706065640b32d8..c18b7eae513189 100644
--- a/deps/v8/third_party/google_benchmark/BUILD.gn
+++ b/deps/v8/third_party/google_benchmark/BUILD.gn
@@ -59,8 +59,6 @@ if (v8_enable_google_benchmark) {
       "src/src/perf_counters.h",
       "src/src/re.h",
       "src/src/reporter.cc",
-      "src/src/sleep.cc",
-      "src/src/sleep.h",
       "src/src/statistics.cc",
       "src/src/statistics.h",
       "src/src/string_util.cc",
diff --git a/deps/v8/third_party/google_benchmark/README.v8 b/deps/v8/third_party/google_benchmark/README.v8
index fe2ac187ac723d..330bd23914d606 100644
--- a/deps/v8/third_party/google_benchmark/README.v8
+++ b/deps/v8/third_party/google_benchmark/README.v8
@@ -3,8 +3,9 @@ Short Name: benchmark
 URL: https://github.com/google/benchmark
 Version: unknown
 License: Apache 2.0
-License File: NOT_SHIPPED
+License File: src/LICENSE
 Security Critical: no
+Shipped: no
 
 Description:
 A microbenchmark support library.
diff --git a/deps/v8/third_party/googletest/README.chromium b/deps/v8/third_party/googletest/README.chromium
index 95dc49af85ce62..18e70e29365806 100644
--- a/deps/v8/third_party/googletest/README.chromium
+++ b/deps/v8/third_party/googletest/README.chromium
@@ -3,6 +3,8 @@ Short Name: googletest
 URL: https://github.com/google/googletest.git
 Version: 1.8.0.git-9518a57428ae0a7ed450c1361768e84a2a38af5a
 License: BSD
+License File: src/LICENSE
+Shipped: no
 Security critical: no
 
 Google Test is imported as-is, to facilitate version bumping. However, the
diff --git a/deps/v8/third_party/inspector_protocol/README.v8 b/deps/v8/third_party/inspector_protocol/README.v8
index 0b161b6717bc6d..9f33949a16b348 100644
--- a/deps/v8/third_party/inspector_protocol/README.v8
+++ b/deps/v8/third_party/inspector_protocol/README.v8
@@ -2,10 +2,11 @@ Name: inspector protocol
 Short Name: inspector_protocol
 URL: https://chromium.googlesource.com/deps/inspector_protocol/
 Version: 0
-Revision: 03764695ffd5887cebc446f61ec43059e03f55b5
+Revision: fc500ba6b4303e25e186b368decf02aca8709a91
 License: BSD
 License File: LICENSE
-Security Critical: no
+Security Critical: yes
+Shipped: yes
 
 Description:
 src/inspector uses these scripts to generate handlers from protocol
diff --git a/deps/v8/third_party/inspector_protocol/code_generator.py b/deps/v8/third_party/inspector_protocol/code_generator.py
index b9a0b644efee88..02bae28a45bb2e 100755
--- a/deps/v8/third_party/inspector_protocol/code_generator.py
+++ b/deps/v8/third_party/inspector_protocol/code_generator.py
@@ -295,15 +295,16 @@ def create_string_type_definition():
 def create_binary_type_definition():
   # pylint: disable=W0622
   return {
-    "return_type": "Binary",
-    "pass_type": "const Binary&",
-    "to_pass_type": "%s",
-    "to_raw_type": "%s",
-    "to_rvalue": "%s",
-    "type": "Binary",
-    "raw_type": "Binary",
-    "raw_pass_type": "const Binary&",
-    "raw_return_type": "Binary",
+      "return_type": "Binary",
+      "pass_type": "const Binary&",
+      "to_pass_type": "%s",
+      "to_raw_type": "%s",
+      "to_rvalue": "%s",
+      "type": "Binary",
+      "raw_type": "Binary",
+      "raw_pass_type": "const Binary&",
+      "raw_return_type": "Binary",
+      "is_primitive": True
   }
 
 
diff --git a/deps/v8/third_party/inspector_protocol/crdtp/maybe.h b/deps/v8/third_party/inspector_protocol/crdtp/maybe.h
index f110c7e26aa66a..0075e26e48f076 100644
--- a/deps/v8/third_party/inspector_protocol/crdtp/maybe.h
+++ b/deps/v8/third_party/inspector_protocol/crdtp/maybe.h
@@ -22,6 +22,33 @@ class PtrMaybe {
   PtrMaybe(std::unique_ptr<T> value) : value_(std::move(value)) {}
   PtrMaybe(PtrMaybe&& other) noexcept : value_(std::move(other.value_)) {}
   void operator=(std::unique_ptr<T> value) { value_ = std::move(value); }
+
+  // std::optional<>-compatible accessors (preferred).
+  bool has_value() const { return !!value_; }
+  operator bool() const { return has_value(); }
+  const T& value() const& {
+    assert(has_value());
+    return *value_;
+  }
+  T& value() & {
+    assert(has_value());
+    return *value_;
+  }
+  T&& value() && {
+    assert(has_value());
+    return std::move(*value_);
+  }
+  const T& value_or(const T& default_value) const {
+    return has_value() ? *value_ : default_value;
+  }
+  T* operator->() { return &value(); }
+  const T* operator->() const { return &value(); }
+
+  T& operator*() & { return value(); }
+  const T& operator*() const& { return value(); }
+  T&& operator*() && { return std::move(value()); }
+
+  // Legacy Maybe<> accessors (deprecated).
   T* fromJust() const {
     assert(value_);
     return value_.get();
@@ -30,10 +57,6 @@ class PtrMaybe {
     return value_ ? value_.get() : default_value;
   }
   bool isJust() const { return value_ != nullptr; }
-  std::unique_ptr<T> takeJust() {
-    assert(value_);
-    return std::move(value_);
-  }
 
  private:
   std::unique_ptr<T> value_;
@@ -50,6 +73,38 @@ class ValueMaybe {
     value_ = std::move(value);
     is_just_ = true;
   }
+
+  // std::optional<>-compatible accessors (preferred).
+  bool has_value() const { return is_just_; }
+  operator bool() const { return has_value(); }
+  const T& value() const& {
+    assert(is_just_);
+    return value_;
+  }
+  T& value() & {
+    assert(is_just_);
+    return value_;
+  }
+  T&& value() && {
+    assert(is_just_);
+    return *std::move(value_);
+  }
+  template <typename U>
+  T value_or(U&& default_value) const& {
+    return is_just_ ? value_ : std::forward<U>(default_value);
+  }
+  template <typename U>
+  T value_or(U&& default_value) && {
+    return is_just_ ? std::move(value_) : std::forward<U>(default_value);
+  }
+  T* operator->() { return &value(); }
+  const T* operator->() const { return &value(); }
+
+  T& operator*() & { return value(); }
+  const T& operator*() const& { return value(); }
+  T&& operator*() && { return std::move(value()); }
+
+  // Legacy Maybe<> accessors (deprecated).
   const T& fromJust() const {
     assert(is_just_);
     return value_;
@@ -58,11 +113,6 @@ class ValueMaybe {
     return is_just_ ? value_ : default_value;
   }
   bool isJust() const { return is_just_; }
-  T takeJust() {
-    assert(is_just_);
-    is_just_ = false;
-    return std::move(value_);
-  }
 
  private:
   bool is_just_;
diff --git a/deps/v8/third_party/inspector_protocol/crdtp/maybe_test.cc b/deps/v8/third_party/inspector_protocol/crdtp/maybe_test.cc
index e8b549a5d83fe8..0b191fa39c02de 100644
--- a/deps/v8/third_party/inspector_protocol/crdtp/maybe_test.cc
+++ b/deps/v8/third_party/inspector_protocol/crdtp/maybe_test.cc
@@ -17,27 +17,27 @@ namespace v8_crdtp {
 // =============================================================================
 TEST(PtrMaybeTest, SmokeTest) {
   detail::PtrMaybe<std::vector<uint32_t>> example;
-  EXPECT_FALSE(example.isJust());
-  EXPECT_TRUE(nullptr == example.fromMaybe(nullptr));
+  EXPECT_FALSE(example.has_value());
   std::unique_ptr<std::vector<uint32_t>> v(new std::vector<uint32_t>);
   v->push_back(42);
   v->push_back(21);
   example = std::move(v);
-  EXPECT_TRUE(example.isJust());
-  EXPECT_THAT(*example.fromJust(), testing::ElementsAre(42, 21));
-  std::unique_ptr<std::vector<uint32_t>> out = example.takeJust();
-  EXPECT_FALSE(example.isJust());
-  EXPECT_THAT(*out, testing::ElementsAre(42, 21));
+  EXPECT_TRUE(example.has_value());
+  EXPECT_THAT(example.value(), testing::ElementsAre(42, 21));
+  std::vector<uint32_t> out = *std::move(example);
+  EXPECT_TRUE(example.has_value());
+  EXPECT_THAT(*example, testing::IsEmpty());
+  EXPECT_THAT(out, testing::ElementsAre(42, 21));
 }
 
-TEST(PtrValueTest, SmokeTest) {
+TEST(ValueMaybeTest, SmokeTest) {
   detail::ValueMaybe<int32_t> example;
-  EXPECT_FALSE(example.isJust());
-  EXPECT_EQ(-1, example.fromMaybe(-1));
+  EXPECT_FALSE(example.has_value());
+  EXPECT_EQ(-1, example.value_or(-1));
   example = 42;
-  EXPECT_TRUE(example.isJust());
-  EXPECT_EQ(42, example.fromJust());
-  int32_t out = example.takeJust();
+  EXPECT_TRUE(example.has_value());
+  EXPECT_EQ(42, example.value());
+  int32_t out = *std::move(example);
   EXPECT_EQ(out, 42);
 }
 
diff --git a/deps/v8/third_party/inspector_protocol/crdtp/protocol_core.h b/deps/v8/third_party/inspector_protocol/crdtp/protocol_core.h
index 01896cc5478831..5756364e9e5cc3 100644
--- a/deps/v8/third_party/inspector_protocol/crdtp/protocol_core.h
+++ b/deps/v8/third_party/inspector_protocol/crdtp/protocol_core.h
@@ -85,15 +85,18 @@ class ContainerSerializer {
   }
   template <typename T>
   void AddField(span<char> field_name, const detail::ValueMaybe<T>& value) {
-    if (!value.isJust())
+    if (!value.has_value()) {
       return;
-    AddField(field_name, value.fromJust());
+    }
+    AddField(field_name, value.value());
   }
+
   template <typename T>
   void AddField(span<char> field_name, const detail::PtrMaybe<T>& value) {
-    if (!value.isJust())
+    if (!value.has_value()) {
       return;
-    AddField(field_name, *value.fromJust());
+    }
+    AddField(field_name, value.value());
   }
 
   void EncodeStop();
@@ -223,7 +226,7 @@ struct ProtocolTypeTraits<detail::ValueMaybe<T>> {
 
   static void Serialize(const detail::ValueMaybe<T>& value,
                         std::vector<uint8_t>* bytes) {
-    ProtocolTypeTraits<T>::Serialize(value.fromJust(), bytes);
+    ProtocolTypeTraits<T>::Serialize(value.value(), bytes);
   }
 };
 
@@ -240,7 +243,7 @@ struct ProtocolTypeTraits<detail::PtrMaybe<T>> {
 
   static void Serialize(const detail::PtrMaybe<T>& value,
                         std::vector<uint8_t>* bytes) {
-    ProtocolTypeTraits<T>::Serialize(*value.fromJust(), bytes);
+    ProtocolTypeTraits<T>::Serialize(value.value(), bytes);
   }
 };
 
diff --git a/deps/v8/third_party/inspector_protocol/crdtp/protocol_core_test.cc b/deps/v8/third_party/inspector_protocol/crdtp/protocol_core_test.cc
index 9f92b3ae0b30e8..533673f9a2b5d4 100644
--- a/deps/v8/third_party/inspector_protocol/crdtp/protocol_core_test.cc
+++ b/deps/v8/third_party/inspector_protocol/crdtp/protocol_core_test.cc
@@ -351,18 +351,18 @@ class TestTypeOptional : public ProtocolObject<TestTypeOptional> {
  public:
   TestTypeOptional() = default;
 
-  bool HasIntField() const { return int_field_.isJust(); }
-  int GetIntField() const { return int_field_.fromJust(); }
+  bool HasIntField() const { return int_field_.has_value(); }
+  int GetIntField() const { return int_field_.value(); }
   void SetIntField(int value) { int_field_ = value; }
 
-  bool HasStrField() { return str_field_.isJust(); }
-  const std::string& GetStrField() const { return str_field_.fromJust(); }
+  bool HasStrField() { return str_field_.has_value(); }
+  const std::string& GetStrField() const { return str_field_.value(); }
   void SetStrField(std::string value) { str_field_ = std::move(value); }
 
-  bool HasTestTypeBasicField() { return test_type_basic_field_.isJust(); }
+  bool HasTestTypeBasicField() { return test_type_basic_field_.has_value(); }
   const TestTypeBasic* GetTestTypeBasicField() const {
-    return test_type_basic_field_.isJust() ? test_type_basic_field_.fromJust()
-                                           : nullptr;
+    return test_type_basic_field_.has_value() ? &test_type_basic_field_.value()
+                                              : nullptr;
   }
   void SetTestTypeBasicField(std::unique_ptr<TestTypeBasic> value) {
     test_type_basic_field_ = std::move(value);
diff --git a/deps/v8/third_party/inspector_protocol/crdtp/span.h b/deps/v8/third_party/inspector_protocol/crdtp/span.h
index 8f132636f3b317..c64026a478debe 100644
--- a/deps/v8/third_party/inspector_protocol/crdtp/span.h
+++ b/deps/v8/third_party/inspector_protocol/crdtp/span.h
@@ -8,6 +8,7 @@
 #include <cstdint>
 #include <cstring>
 #include <string>
+#include <type_traits>
 
 #include "export.h"
 
diff --git a/deps/v8/third_party/inspector_protocol/crdtp/test_platform_v8.cc b/deps/v8/third_party/inspector_protocol/crdtp/test_platform_v8.cc
index c9d89eaa42f1d8..1a46d781b89d47 100644
--- a/deps/v8/third_party/inspector_protocol/crdtp/test_platform_v8.cc
+++ b/deps/v8/third_party/inspector_protocol/crdtp/test_platform_v8.cc
@@ -11,13 +11,16 @@
 namespace v8_crdtp {
 
 std::string UTF16ToUTF8(span<uint16_t> in) {
-  return v8_inspector::UTF16ToUTF8(in.data(), in.size());
+  return v8_inspector::UTF16ToUTF8(reinterpret_cast<const char16_t*>(in.data()),
+                                   in.size());
 }
 
 std::vector<uint16_t> UTF8ToUTF16(span<uint8_t> in) {
-  std::basic_string<uint16_t> utf16 = v8_inspector::UTF8ToUTF16(
+  std::basic_string<char16_t> utf16 = v8_inspector::UTF8ToUTF16(
       reinterpret_cast<const char*>(in.data()), in.size());
-  return std::vector<uint16_t>(utf16.begin(), utf16.end());
+  return std::vector<uint16_t>(
+      reinterpret_cast<const uint16_t*>(utf16.data()),
+      reinterpret_cast<const uint16_t*>(utf16.data()) + utf16.size());
 }
 
 }  // namespace v8_crdtp
diff --git a/deps/v8/third_party/inspector_protocol/templates/TypeBuilder_h.template b/deps/v8/third_party/inspector_protocol/templates/TypeBuilder_h.template
index 9b42833014e57d..e23567a5732d76 100644
--- a/deps/v8/third_party/inspector_protocol/templates/TypeBuilder_h.template
+++ b/deps/v8/third_party/inspector_protocol/templates/TypeBuilder_h.template
@@ -89,8 +89,16 @@ public:
       {% endif %}
 
       {% if property.optional %}
-    bool {{"has" | to_method_case}}{{property_name}}() { return {{property_field}}.isJust(); }
-    {{property_type.raw_return_type}} {{"get" | to_method_case}}{{property_name}}({{property_type.raw_pass_type}} defaultValue) { return {{property_field}}.isJust() ? {{property_field}}.fromJust() : defaultValue; }
+    bool {{"has" | to_method_case}}{{property_name}}() { return {{property_field}}.has_value(); }
+    {% if property_type.is_primitive %}
+    {{property_type.raw_return_type}} {{"get" | to_method_case}}{{property_name}}({{property_type.raw_pass_type}} defaultValue) const {
+       return {{property_field}}.value_or(defaultValue);
+    }
+    {% else %}
+    {{property_type.raw_return_type}} {{"get" | to_method_case}}{{property_name}}({{property_type.raw_pass_type}} defaultValue) {
+       return {{property_field}}.has_value() ? &{{property_field}}.value() : defaultValue;
+    }
+    {% endif %}
       {% else %}
     {{property_type.raw_return_type}} {{"get" | to_method_case}}{{property_name}}() { return {{property_type.to_raw_type % property_field}}; }
       {% endif %}
diff --git a/deps/v8/third_party/jinja2/README.chromium b/deps/v8/third_party/jinja2/README.chromium
index 079ce0cc36b081..7945137f696e77 100644
--- a/deps/v8/third_party/jinja2/README.chromium
+++ b/deps/v8/third_party/jinja2/README.chromium
@@ -5,6 +5,7 @@ Version: 3.1.2
 License: BSD 3-Clause
 License File: LICENSE.rst
 Security Critical: no
+Shipped: no
 
 Description:
 Template engine for code generation in Blink.
diff --git a/deps/v8/third_party/jsoncpp/README.chromium b/deps/v8/third_party/jsoncpp/README.chromium
index 48bc543f418dee..bb931a502e10f6 100644
--- a/deps/v8/third_party/jsoncpp/README.chromium
+++ b/deps/v8/third_party/jsoncpp/README.chromium
@@ -4,6 +4,7 @@ Version: f572e8e42e22cfcf5ab0aea26574f408943edfa4
 License: MIT
 License File: LICENSE
 Security Critical: yes
+Shipped: yes
 
 Description:
 JsonCpp is used by multiple projects for parsing and generating JSON data. This
diff --git a/deps/v8/third_party/markupsafe/README.chromium b/deps/v8/third_party/markupsafe/README.chromium
index ba79d61ef7a7ab..1517f332e54597 100644
--- a/deps/v8/third_party/markupsafe/README.chromium
+++ b/deps/v8/third_party/markupsafe/README.chromium
@@ -3,8 +3,9 @@ Short Name: markupsafe
 URL: https://github.com/mitsuhiko/markupsafe
 Version: 0.18
 License: BSD 3-clause License
-License File: NOT_SHIPPED
+License File: LICENSE
 Security Critical: no
+Shipped: no
 
 Description:
 Safe string class, used by Jinja2 template engine.
diff --git a/deps/v8/third_party/test262-harness/README.v8 b/deps/v8/third_party/test262-harness/README.v8
index 2f09a4a1bb4a8e..85cb8743a694ce 100644
--- a/deps/v8/third_party/test262-harness/README.v8
+++ b/deps/v8/third_party/test262-harness/README.v8
@@ -7,6 +7,7 @@ Date: 2022-02-18
 License: BSD
 License File: LICENSE
 Security Critical: no
+Shipped: no
 
 Description:
 Provides the parseTestRecord function in Python for the test262 runner.
diff --git a/deps/v8/third_party/test262-harness/src/_monkeyYaml.py b/deps/v8/third_party/test262-harness/src/_monkeyYaml.py
index ab9b39af3ec4d2..c8741fc445c656 100644
--- a/deps/v8/third_party/test262-harness/src/_monkeyYaml.py
+++ b/deps/v8/third_party/test262-harness/src/_monkeyYaml.py
@@ -127,7 +127,7 @@ def myMultiline(lines, preserveNewlines=False):
             break;
         else:
             if preserveNewlines:
-                if wasEmpty != None:
+                if wasEmpty is not None:
                     value += "\n"
             else:
                 if wasEmpty == False:
diff --git a/deps/v8/third_party/v8/builtins/array-sort.tq b/deps/v8/third_party/v8/builtins/array-sort.tq
index eb101be34972b9..0b4e51226822f7 100644
--- a/deps/v8/third_party/v8/builtins/array-sort.tq
+++ b/deps/v8/third_party/v8/builtins/array-sort.tq
@@ -142,9 +142,10 @@ macro CalculateWorkArrayLength(
   return workArrayLength;
 }
 
-transitioning macro NewSortState(implicit context: Context)(
-    receiver: JSReceiver, comparefn: Undefined|Callable,
-    initialReceiverLength: Number, isToSorted: constexpr bool): SortState {
+transitioning macro NewSortState(
+    implicit context: Context)(receiver: JSReceiver,
+    comparefn: Undefined|Callable, initialReceiverLength: Number,
+    isToSorted: constexpr bool): SortState {
   const sortComparePtr =
       comparefn != Undefined ? SortCompareUserFn : SortCompareDefault;
   const map = receiver.map;
@@ -258,22 +259,22 @@ LoadNoHasPropertyCheck<ElementsAccessor : type extends ElementsKind>(
   return GetProperty(receiver, index);
 }
 
-Load<FastSmiElements>(
-    context: Context, sortState: SortState, index: Smi): JSAny|TheHole {
+Load<FastSmiElements>(context: Context, sortState: SortState, index: Smi): JSAny
+    |TheHole {
   const object = UnsafeCast<JSObject>(sortState.receiver);
   const elements = UnsafeCast<FixedArray>(object.elements);
   return UnsafeCast<(JSAny | TheHole)>(elements.objects[index]);
 }
 
-Load<FastObjectElements>(
-    context: Context, sortState: SortState, index: Smi): JSAny|TheHole {
+Load<FastObjectElements>(context: Context, sortState: SortState, index: Smi):
+    JSAny|TheHole {
   const object = UnsafeCast<JSObject>(sortState.receiver);
   const elements = UnsafeCast<FixedArray>(object.elements);
   return UnsafeCast<(JSAny | TheHole)>(elements.objects[index]);
 }
 
-Load<FastDoubleElements>(
-    context: Context, sortState: SortState, index: Smi): JSAny|TheHole {
+Load<FastDoubleElements>(context: Context, sortState: SortState, index: Smi):
+    JSAny|TheHole {
   try {
     const object = UnsafeCast<JSObject>(sortState.receiver);
     const elements = UnsafeCast<FixedDoubleArray>(object.elements);
@@ -324,8 +325,8 @@ transitioning builtin Delete<ElementsAccessor : type extends ElementsKind>(
   return kSuccess;
 }
 
-Delete<FastSmiElements>(
-    context: Context, sortState: SortState, index: Smi): Smi {
+Delete<FastSmiElements>(context: Context, sortState: SortState, index: Smi):
+    Smi {
   dcheck(IsHoleyFastElementsKind(sortState.receiver.map.elements_kind));
 
   const object = UnsafeCast<JSObject>(sortState.receiver);
@@ -334,8 +335,8 @@ Delete<FastSmiElements>(
   return kSuccess;
 }
 
-Delete<FastObjectElements>(
-    context: Context, sortState: SortState, index: Smi): Smi {
+Delete<FastObjectElements>(context: Context, sortState: SortState, index: Smi):
+    Smi {
   dcheck(IsHoleyFastElementsKind(sortState.receiver.map.elements_kind));
 
   const object = UnsafeCast<JSObject>(sortState.receiver);
@@ -344,8 +345,8 @@ Delete<FastObjectElements>(
   return kSuccess;
 }
 
-Delete<FastDoubleElements>(
-    context: Context, sortState: SortState, index: Smi): Smi {
+Delete<FastDoubleElements>(context: Context, sortState: SortState, index: Smi):
+    Smi {
   dcheck(IsHoleyFastElementsKind(sortState.receiver.map.elements_kind));
 
   const object = UnsafeCast<JSObject>(sortState.receiver);
@@ -414,32 +415,36 @@ CanUseSameAccessor<GenericElementsAccessor>(
 
 // Re-loading the stack-size is done in a few places. The small macro allows
 // for easier invariant checks at all use sites.
-macro GetPendingRunsSize(implicit context: Context)(sortState: SortState): Smi {
+macro GetPendingRunsSize(implicit context: Context)(sortState: SortState):
+    Smi {
   const stackSize: Smi = sortState.pendingRunsSize;
   dcheck(stackSize >= 0);
   return stackSize;
 }
 
-macro GetPendingRunBase(implicit context: Context)(
-    pendingRuns: FixedArray, run: Smi): Smi {
+macro GetPendingRunBase(
+    implicit context: Context)(pendingRuns: FixedArray, run: Smi): Smi {
   return UnsafeCast<Smi>(pendingRuns.objects[run << 1]);
 }
 
-macro SetPendingRunBase(pendingRuns: FixedArray, run: Smi, value: Smi): void {
+macro SetPendingRunBase(pendingRuns: FixedArray, run: Smi, value: Smi):
+    void {
   pendingRuns.objects[run << 1] = value;
 }
 
-macro GetPendingRunLength(implicit context: Context)(
-    pendingRuns: FixedArray, run: Smi): Smi {
+macro GetPendingRunLength(
+    implicit context: Context)(pendingRuns: FixedArray, run: Smi): Smi {
   return UnsafeCast<Smi>(pendingRuns.objects[(run << 1) + 1]);
 }
 
-macro SetPendingRunLength(pendingRuns: FixedArray, run: Smi, value: Smi): void {
+macro SetPendingRunLength(pendingRuns: FixedArray, run: Smi, value: Smi):
+    void {
   pendingRuns.objects[(run << 1) + 1] = value;
 }
 
-macro PushRun(implicit context: Context)(
-    sortState: SortState, base: Smi, length: Smi): void {
+macro PushRun(
+    implicit context: Context)(sortState: SortState, base: Smi,
+    length: Smi): void {
   dcheck(GetPendingRunsSize(sortState) < kMaxMergePending);
 
   const stackSize: Smi = GetPendingRunsSize(sortState);
@@ -453,8 +458,9 @@ macro PushRun(implicit context: Context)(
 
 // Returns the temporary array and makes sure that it is big enough.
 // TODO(szuend): Implement a better re-size strategy.
-macro GetTempArray(implicit context: Context)(
-    sortState: SortState, requestedSize: Smi): FixedArray {
+macro GetTempArray(
+    implicit context: Context)(sortState: SortState,
+    requestedSize: Smi): FixedArray {
   const minSize: Smi = SmiMax(kSortStateTempSize, requestedSize);
 
   const currentSize: Smi = sortState.tempArray.length;
@@ -469,10 +475,9 @@ macro GetTempArray(implicit context: Context)(
   return tempArray;
 }
 
-transitioning builtin
-Copy(implicit context: Context)(
-    source: FixedArray, srcPos: Smi, target: FixedArray, dstPos: Smi,
-    length: Smi): JSAny {
+transitioning builtin Copy(
+    implicit context: Context)(source: FixedArray, srcPos: Smi,
+    target: FixedArray, dstPos: Smi, length: Smi): JSAny {
   dcheck(srcPos >= 0);
   dcheck(dstPos >= 0);
   dcheck(srcPos <= source.length - length);
@@ -512,8 +517,9 @@ Copy(implicit context: Context)(
 //
 // On entry, must have low <= start <= high, and that [low, start) is
 // already sorted. Pass start == low if you do not know!.
-macro BinaryInsertionSort(implicit context: Context, sortState: SortState)(
-    low: Smi, startArg: Smi, high: Smi): void {
+macro BinaryInsertionSort(
+    implicit context: Context, sortState: SortState)(low: Smi, startArg: Smi,
+    high: Smi): void {
   dcheck(low <= startArg && startArg <= high);
 
   const workArray = sortState.workArray;
@@ -577,8 +583,9 @@ macro BinaryInsertionSort(implicit context: Context, sortState: SortState)(
 //
 // In addition, if the run is "descending", it is reversed, so the
 // returned length is always an ascending sequence.
-macro CountAndMakeRun(implicit context: Context, sortState: SortState)(
-    lowArg: Smi, high: Smi): Smi {
+macro CountAndMakeRun(
+    implicit context: Context, sortState: SortState)(lowArg: Smi,
+    high: Smi): Smi {
   dcheck(lowArg < high);
 
   const workArray = sortState.workArray;
@@ -633,8 +640,8 @@ macro ReverseRange(array: FixedArray, from: Smi, to: Smi): void {
 
 // Merges the two runs at stack indices i and i + 1.
 // Returns kFailure if we need to bailout, kSuccess otherwise.
-transitioning builtin
-MergeAt(implicit context: Context, sortState: SortState)(i: Smi): Smi {
+transitioning builtin MergeAt(
+    implicit context: Context, sortState: SortState)(i: Smi): Smi {
   const stackSize: Smi = GetPendingRunsSize(sortState);
 
   // We are only allowed to either merge the two top-most runs, or leave
@@ -711,8 +718,9 @@ MergeAt(implicit context: Context, sortState: SortState)(i: Smi): Smi {
 //
 // pretending that array[base - 1] is minus infinity and array[base + len]
 // is plus infinity. In other words, key belongs at index base + k.
-builtin GallopLeft(implicit context: Context, sortState: SortState)(
-    array: FixedArray, key: JSAny, base: Smi, length: Smi, hint: Smi): Smi {
+builtin GallopLeft(
+    implicit context: Context, sortState: SortState)(array: FixedArray,
+    key: JSAny, base: Smi, length: Smi, hint: Smi): Smi {
   dcheck(length > 0 && base >= 0);
   dcheck(0 <= hint && hint < length);
 
@@ -810,8 +818,9 @@ builtin GallopLeft(implicit context: Context, sortState: SortState)(
 // array[base + offset - 1] <= key < array[base + offset]
 //
 // or kFailure on error.
-builtin GallopRight(implicit context: Context, sortState: SortState)(
-    array: FixedArray, key: JSAny, base: Smi, length: Smi, hint: Smi): Smi {
+builtin GallopRight(
+    implicit context: Context, sortState: SortState)(array: FixedArray,
+    key: JSAny, base: Smi, length: Smi, hint: Smi): Smi {
   dcheck(length > 0 && base >= 0);
   dcheck(0 <= hint && hint < length);
 
@@ -904,8 +913,9 @@ builtin GallopRight(implicit context: Context, sortState: SortState)(
 // array[baseB] < array[baseA],
 // that array[baseA + lengthA - 1] belongs at the end of the merge,
 // and should have lengthA <= lengthB.
-transitioning macro MergeLow(implicit context: Context, sortState: SortState)(
-    baseA: Smi, lengthAArg: Smi, baseB: Smi, lengthBArg: Smi): void {
+transitioning macro MergeLow(
+    implicit context: Context, sortState: SortState)(baseA: Smi,
+    lengthAArg: Smi, baseB: Smi, lengthBArg: Smi): void {
   dcheck(0 < lengthAArg && 0 < lengthBArg);
   dcheck(0 <= baseA && 0 < baseB);
   dcheck(baseA + lengthAArg == baseB);
@@ -1034,8 +1044,9 @@ transitioning macro MergeLow(implicit context: Context, sortState: SortState)(
 // starting at baseB in a stable way, in-place. lengthA and lengthB must
 // be > 0. Must also have that array[baseA + lengthA - 1] belongs at the
 // end of the merge and should have lengthA >= lengthB.
-transitioning macro MergeHigh(implicit context: Context, sortState: SortState)(
-    baseA: Smi, lengthAArg: Smi, baseB: Smi, lengthBArg: Smi): void {
+transitioning macro MergeHigh(
+    implicit context: Context, sortState: SortState)(baseA: Smi,
+    lengthAArg: Smi, baseB: Smi, lengthBArg: Smi): void {
   dcheck(0 < lengthAArg && 0 < lengthBArg);
   dcheck(0 <= baseA && 0 < baseB);
   dcheck(baseA + lengthAArg == baseB);
@@ -1193,8 +1204,8 @@ macro ComputeMinRunLength(nArg: Smi): Smi {
 }
 
 // Returns true iff run_length(n - 2) > run_length(n - 1) + run_length(n).
-macro RunInvariantEstablished(implicit context: Context)(
-    pendingRuns: FixedArray, n: Smi): bool {
+macro RunInvariantEstablished(
+    implicit context: Context)(pendingRuns: FixedArray, n: Smi): bool {
   if (n < 2) return true;
 
   const runLengthN: Smi = GetPendingRunLength(pendingRuns, n);
@@ -1213,8 +1224,8 @@ macro RunInvariantEstablished(implicit context: Context)(
 // TODO(szuend): Remove unnecessary loads. This macro was refactored to
 //               improve readability, introducing unnecessary loads in the
 //               process. Determine if all these extra loads are ok.
-transitioning macro MergeCollapse(
-    context: Context, sortState: SortState): void {
+transitioning macro MergeCollapse(context: Context, sortState: SortState):
+    void {
   const pendingRuns: FixedArray = sortState.pendingRuns;
 
   // Reload the stack size because MergeAt might change it.
@@ -1241,8 +1252,8 @@ transitioning macro MergeCollapse(
 
 // Regardless of invariants, merge all runs on the stack until only one
 // remains. This is used at the end of the mergesort.
-transitioning macro
-MergeForceCollapse(context: Context, sortState: SortState): void {
+transitioning macro MergeForceCollapse(context: Context, sortState: SortState):
+    void {
   const pendingRuns: FixedArray = sortState.pendingRuns;
 
   // Reload the stack size becuase MergeAt might change it.
@@ -1258,8 +1269,8 @@ MergeForceCollapse(context: Context, sortState: SortState): void {
   }
 }
 
-transitioning macro
-ArrayTimSortImpl(context: Context, sortState: SortState, length: Smi): void {
+transitioning macro ArrayTimSortImpl(
+    context: Context, sortState: SortState, length: Smi): void {
   if (length < 2) return;
   let remaining: Smi = length;
 
@@ -1292,10 +1303,9 @@ ArrayTimSortImpl(context: Context, sortState: SortState, length: Smi): void {
   dcheck(GetPendingRunLength(sortState.pendingRuns, 0) == length);
 }
 
-transitioning macro
-CompactReceiverElementsIntoWorkArray(
-    implicit context: Context,
-    sortState: SortState)(isToSorted: constexpr bool): Smi {
+transitioning macro CompactReceiverElementsIntoWorkArray(
+    implicit context: Context, sortState: SortState)(
+    isToSorted: constexpr bool): Smi {
   let growableWorkArray = growable_fixed_array::GrowableFixedArray{
     array: sortState.workArray,
     capacity: Convert<intptr>(sortState.workArray.length),
@@ -1351,8 +1361,8 @@ CompactReceiverElementsIntoWorkArray(
   return Convert<Smi>(growableWorkArray.length);
 }
 
-transitioning macro
-CopyWorkArrayToReceiver(implicit context: Context, sortState: SortState)(
+transitioning macro CopyWorkArrayToReceiver(
+    implicit context: Context, sortState: SortState)(
     numberOfNonUndefined: Smi): void {
   const storeFn = sortState.storeFn;
   const workArray = sortState.workArray;
@@ -1386,8 +1396,8 @@ CopyWorkArrayToReceiver(implicit context: Context, sortState: SortState)(
   }
 }
 
-transitioning builtin
-ArrayTimSort(context: Context, sortState: SortState): JSAny {
+transitioning builtin ArrayTimSort(context: Context, sortState: SortState):
+    JSAny {
   const isToSorted: constexpr bool = false;
   const numberOfNonUndefined: Smi =
       CompactReceiverElementsIntoWorkArray(isToSorted);
@@ -1406,8 +1416,7 @@ ArrayTimSort(context: Context, sortState: SortState): JSAny {
 }
 
 // https://tc39.github.io/ecma262/#sec-array.prototype.sort
-transitioning javascript builtin
-ArrayPrototypeSort(
+transitioning javascript builtin ArrayPrototypeSort(
     js-implicit context: NativeContext, receiver: JSAny)(...arguments): JSAny {
   // 1. If comparefn is not undefined and IsCallable(comparefn) is false,
   //    throw a TypeError exception.
diff --git a/deps/v8/third_party/wasm-api/README.v8 b/deps/v8/third_party/wasm-api/README.v8
index bebe47b665f7f4..50fe71b50723ef 100644
--- a/deps/v8/third_party/wasm-api/README.v8
+++ b/deps/v8/third_party/wasm-api/README.v8
@@ -7,6 +7,7 @@ Date: 2019-08-08
 License: Apache 2.0
 License File: LICENSE
 Security Critical: yes
+Shipped: yes
 
 Description:
 Provides a "black box" API for embedding a Wasm engine in C/C++ applications.
diff --git a/deps/v8/third_party/zlib/BUILD.gn b/deps/v8/third_party/zlib/BUILD.gn
index 5c215860aec16c..8ed0807a994b1e 100644
--- a/deps/v8/third_party/zlib/BUILD.gn
+++ b/deps/v8/third_party/zlib/BUILD.gn
@@ -124,45 +124,40 @@ source_set("zlib_adler32_simd") {
 
 if (use_arm_neon_optimizations) {
   config("zlib_arm_crc32_config") {
-    # Disabled for iPhone, as described in DDI0487C_a_armv8_arm:
-    #  "All implementations of the ARMv8.1 architecture are required to
-    #   implement the CRC32* instructions. These are optional in ARMv8.0."
-    if (!is_ios) {
-      defines = [ "CRC32_ARMV8_CRC32" ]
-      if (is_android) {
-        defines += [ "ARMV8_OS_ANDROID" ]
-      } else if (is_linux || is_chromeos) {
-        defines += [ "ARMV8_OS_LINUX" ]
-      } else if (is_mac) {
-        defines += [ "ARMV8_OS_MACOS" ]
-      } else if (is_fuchsia) {
-        defines += [ "ARMV8_OS_FUCHSIA" ]
-      } else if (is_win) {
-        defines += [ "ARMV8_OS_WINDOWS" ]
-      } else {
-        assert(false, "Unsupported ARM OS")
-      }
+    defines = [ "CRC32_ARMV8_CRC32" ]
+    if (is_android) {
+      defines += [ "ARMV8_OS_ANDROID" ]
+    } else if (is_linux || is_chromeos) {
+      defines += [ "ARMV8_OS_LINUX" ]
+    } else if (is_mac) {
+      defines += [ "ARMV8_OS_MACOS" ]
+    } else if (is_ios) {
+      defines += [ "ARMV8_OS_IOS" ]
+    } else if (is_fuchsia) {
+      defines += [ "ARMV8_OS_FUCHSIA" ]
+    } else if (is_win) {
+      defines += [ "ARMV8_OS_WINDOWS" ]
+    } else {
+      assert(false, "Unsupported ARM OS")
     }
   }
 
   source_set("zlib_arm_crc32") {
     visibility = [ ":*" ]
 
-    if (!is_ios) {
-      include_dirs = [ "." ]
-
-      if (!is_win && !is_clang) {
-        assert(!use_thin_lto,
-               "ThinLTO fails mixing different module-level targets")
-        cflags_c = [ "-march=armv8-a+aes+crc" ]
-      }
+    include_dirs = [ "." ]
 
-      sources = [
-        "crc32_simd.c",
-        "crc32_simd.h",
-      ]
+    if (!is_win && !is_clang) {
+      assert(!use_thin_lto,
+             "ThinLTO fails mixing different module-level targets")
+      cflags_c = [ "-march=armv8-a+aes+crc" ]
     }
 
+    sources = [
+      "crc32_simd.c",
+      "crc32_simd.h",
+    ]
+
     configs += [ ":zlib_internal_config" ]
 
     public_configs = [ ":zlib_arm_crc32_config" ]
@@ -332,14 +327,6 @@ component("zlib") {
     defines += [ "CPU_NO_SIMD" ]
   }
 
-  if (is_ios) {
-    # iOS@ARM is a special case where we always have NEON but don't check
-    # for crypto extensions.
-    # TODO(cavalcantii): verify what is the current state of CPU features
-    # shipped on latest iOS devices.
-    defines += [ "ARM_OS_IOS" ]
-  }
-
   if (use_x86_x64_optimizations || use_arm_neon_optimizations) {
     deps += [
       ":zlib_adler32_simd",
@@ -359,7 +346,7 @@ component("zlib") {
   if (is_android) {
     import("//build/config/android/config.gni")
     if (defined(android_ndk_root) && android_ndk_root != "") {
-      deps += [ "//third_party/android_ndk:cpu_features" ]
+      deps += [ "//third_party/cpu_features:ndk_compat" ]
     } else {
       assert(false, "CPU detection requires the Android NDK")
     }
@@ -398,6 +385,11 @@ config("minizip_warnings") {
 }
 
 static_library("minizip") {
+  include_dirs = [
+    ".",
+    "//third_party/zlib",
+  ]
+
   sources = [
     "contrib/minizip/ioapi.c",
     "contrib/minizip/ioapi.h",
@@ -515,7 +507,12 @@ if (build_with_chromium) {
 
     data = [ "google/test/data/" ]
 
+    if (is_ios) {
+      bundle_deps = [ "google:zlib_pak_bundle_data" ]
+    }
+
     deps = [
+      ":minizip",
       ":zlib",
       "google:compression_utils",
       "google:zip",
diff --git a/deps/v8/third_party/zlib/CMakeLists.txt b/deps/v8/third_party/zlib/CMakeLists.txt
index f06e193f726be7..471a3a46a09dd6 100644
--- a/deps/v8/third_party/zlib/CMakeLists.txt
+++ b/deps/v8/third_party/zlib/CMakeLists.txt
@@ -3,7 +3,7 @@ set(CMAKE_ALLOW_LOOSE_LOOP_CONSTRUCTS ON)
 
 project(zlib C)
 
-set(VERSION "1.2.13")
+set(VERSION "1.2.13.1")
 
 set(INSTALL_BIN_DIR "${CMAKE_INSTALL_PREFIX}/bin" CACHE PATH "Installation directory for executables")
 set(INSTALL_LIB_DIR "${CMAKE_INSTALL_PREFIX}/lib" CACHE PATH "Installation directory for libraries")
@@ -22,6 +22,12 @@ check_include_file(stdint.h    HAVE_STDINT_H)
 check_include_file(stddef.h    HAVE_STDDEF_H)
 
 option(ENABLE_SIMD_OPTIMIZATIONS "Enable all SIMD optimizations" OFF)
+option(ENABLE_SIMD_AVX512 "Enable SIMD AXV512 optimizations" OFF)
+option(USE_ZLIB_RABIN_KARP_HASH "Enable bitstream compatibility with canonical zlib" OFF)
+
+if (USE_ZLIB_RABIN_KARP_HASH)
+   add_definitions(-DUSE_ZLIB_RABIN_KARP_ROLLING_HASH)
+endif()
 
 # TODO(cavalcantii): add support for other OSes (e.g. Android, fuchsia, osx)
 # and architectures (e.g. Arm).
@@ -30,8 +36,13 @@ if (ENABLE_SIMD_OPTIMIZATIONS)
    add_definitions(-DADLER32_SIMD_SSSE3)
    add_definitions(-DINFLATE_CHUNK_READ_64LE)
    add_definitions(-DCRC32_SIMD_SSE42_PCLMUL)
+   if (ENABLE_SIMD_AVX512)
+    add_definitions(-DCRC32_SIMD_AVX512_PCLMUL)
+    add_compile_options(-mvpclmulqdq -msse2 -mavx512f -mpclmul)
+   else()
+    add_compile_options(-msse4.2 -mpclmul)
+   endif()
    add_definitions(-DDEFLATE_SLIDE_HASH_SSE2)
-   add_compile_options(-msse4.2 -mpclmul)
    # Required by CPU features detection code.
    add_definitions(-DX86_NOT_WINDOWS)
    # Apparently some environments (e.g. CentOS) require to explicitly link
@@ -232,3 +243,12 @@ enable_language(CXX)
 set(CMAKE_CXX_STANDARD 14) # workaround for older compilers (e.g. g++ 5.4).
 add_executable(zlib_bench contrib/bench/zlib_bench.cc)
 target_link_libraries(zlib_bench zlib)
+
+#============================================================================
+# Minigzip tool
+#============================================================================
+add_executable(minizip_bin contrib/minizip/minizip.c contrib/minizip/ioapi.c
+contrib/minizip/ioapi.h contrib/minizip/unzip.c
+contrib/minizip/unzip.h contrib/minizip/zip.c contrib/minizip/zip.h
+)
+target_link_libraries(minizip_bin zlib)
diff --git a/deps/v8/third_party/zlib/OWNERS b/deps/v8/third_party/zlib/OWNERS
index ecffb59f051501..3a821578a748b3 100644
--- a/deps/v8/third_party/zlib/OWNERS
+++ b/deps/v8/third_party/zlib/OWNERS
@@ -1,5 +1,4 @@
 agl@chromium.org
 cavalcantii@chromium.org
 cblume@chromium.org
-noel@chromium.org
 scroggo@google.com
diff --git a/deps/v8/third_party/zlib/README.chromium b/deps/v8/third_party/zlib/README.chromium
index 190430f5325ce6..663ee0521ed30c 100644
--- a/deps/v8/third_party/zlib/README.chromium
+++ b/deps/v8/third_party/zlib/README.chromium
@@ -4,6 +4,7 @@ URL: http://zlib.net/
 Version: 1.2.13
 CPEPrefix: cpe:/a:zlib:zlib:1.2.13
 Security Critical: yes
+Shipped: yes
 License: Custom license
 License File: LICENSE
 License Android Compatible: yes
diff --git a/deps/v8/third_party/zlib/adler32.c b/deps/v8/third_party/zlib/adler32.c
index 8f8fbb904891ae..99a294496f7eb5 100644
--- a/deps/v8/third_party/zlib/adler32.c
+++ b/deps/v8/third_party/zlib/adler32.c
@@ -7,8 +7,6 @@
 
 #include "zutil.h"
 
-local uLong adler32_combine_ OF((uLong adler1, uLong adler2, z_off64_t len2));
-
 #define BASE 65521U     /* largest prime smaller than 65536 */
 #define NMAX 5552
 /* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
@@ -65,11 +63,7 @@ local uLong adler32_combine_ OF((uLong adler1, uLong adler2, z_off64_t len2));
 #endif
 
 /* ========================================================================= */
-uLong ZEXPORT adler32_z(adler, buf, len)
-    uLong adler;
-    const Bytef *buf;
-    z_size_t len;
-{
+uLong ZEXPORT adler32_z(uLong adler, const Bytef *buf, z_size_t len) {
     unsigned long sum2;
     unsigned n;
 
@@ -96,9 +90,9 @@ uLong ZEXPORT adler32_z(adler, buf, len)
         return adler | (sum2 << 16);
     }
 
-#if defined(ADLER32_SIMD_SSSE3)
+#if defined(ADLER32_SIMD_SSSE3) || defined(ADLER32_SIMD_NEON)
     /*
-     * Use SSSE3 to compute the adler32. Since this routine can be
+     * Use SIMD to compute the adler32. Since this function can be
      * freely used, check CPU features here. zlib convention is to
      * call adler32(0, NULL, 0), before making calls to adler32().
      * So this is a good early (and infrequent) place to cache CPU
@@ -159,20 +153,12 @@ uLong ZEXPORT adler32_z(adler, buf, len)
 }
 
 /* ========================================================================= */
-uLong ZEXPORT adler32(adler, buf, len)
-    uLong adler;
-    const Bytef *buf;
-    uInt len;
-{
+uLong ZEXPORT adler32(uLong adler, const Bytef *buf, uInt len) {
     return adler32_z(adler, buf, len);
 }
 
 /* ========================================================================= */
-local uLong adler32_combine_(adler1, adler2, len2)
-    uLong adler1;
-    uLong adler2;
-    z_off64_t len2;
-{
+local uLong adler32_combine_(uLong adler1, uLong adler2, z_off64_t len2) {
     unsigned long sum1;
     unsigned long sum2;
     unsigned rem;
@@ -197,18 +183,10 @@ local uLong adler32_combine_(adler1, adler2, len2)
 }
 
 /* ========================================================================= */
-uLong ZEXPORT adler32_combine(adler1, adler2, len2)
-    uLong adler1;
-    uLong adler2;
-    z_off_t len2;
-{
+uLong ZEXPORT adler32_combine(uLong adler1, uLong adler2, z_off_t len2) {
     return adler32_combine_(adler1, adler2, len2);
 }
 
-uLong ZEXPORT adler32_combine64(adler1, adler2, len2)
-    uLong adler1;
-    uLong adler2;
-    z_off64_t len2;
-{
+uLong ZEXPORT adler32_combine64(uLong adler1, uLong adler2, z_off64_t len2) {
     return adler32_combine_(adler1, adler2, len2);
 }
diff --git a/deps/v8/third_party/zlib/chromeconf.h b/deps/v8/third_party/zlib/chromeconf.h
index 5b91c86442105a..c324e3259ac3f3 100644
--- a/deps/v8/third_party/zlib/chromeconf.h
+++ b/deps/v8/third_party/zlib/chromeconf.h
@@ -199,5 +199,6 @@
 /* Symbols added by cpu_features.c */
 #define cpu_check_features Cr_z_cpu_check_features
 #define x86_cpu_enable_sse2 Cr_z_x86_cpu_enable_sse2
+#define x86_cpu_enable_avx512 Cr_z_x86_cpu_enable_avx512
 
 #endif /* THIRD_PARTY_ZLIB_CHROMECONF_H_ */
diff --git a/deps/v8/third_party/zlib/compress.c b/deps/v8/third_party/zlib/compress.c
index 53f8d8d87f9b25..0f11a27c28a691 100644
--- a/deps/v8/third_party/zlib/compress.c
+++ b/deps/v8/third_party/zlib/compress.c
@@ -19,13 +19,8 @@
    memory, Z_BUF_ERROR if there was not enough room in the output buffer,
    Z_STREAM_ERROR if the level parameter is invalid.
 */
-int ZEXPORT compress2(dest, destLen, source, sourceLen, level)
-    Bytef *dest;
-    uLongf *destLen;
-    const Bytef *source;
-    uLong sourceLen;
-    int level;
-{
+int ZEXPORT compress2(Bytef *dest, uLongf *destLen, const Bytef *source,
+                      uLong sourceLen, int level) {
     z_stream stream;
     int err;
     const uInt max = (uInt)-1;
@@ -65,12 +60,8 @@ int ZEXPORT compress2(dest, destLen, source, sourceLen, level)
 
 /* ===========================================================================
  */
-int ZEXPORT compress(dest, destLen, source, sourceLen)
-    Bytef *dest;
-    uLongf *destLen;
-    const Bytef *source;
-    uLong sourceLen;
-{
+int ZEXPORT compress(Bytef *dest, uLongf *destLen, const Bytef *source,
+                     uLong sourceLen) {
     return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION);
 }
 
@@ -78,9 +69,7 @@ int ZEXPORT compress(dest, destLen, source, sourceLen)
      If the default memLevel or windowBits for deflateInit() is changed, then
    this function needs to be updated.
  */
-uLong ZEXPORT compressBound(sourceLen)
-    uLong sourceLen;
-{
+uLong ZEXPORT compressBound(uLong sourceLen) {
     sourceLen = sourceLen + (sourceLen >> 12) + (sourceLen >> 14) +
                 (sourceLen >> 25) + 13;
     /* FIXME(cavalcantii): usage of CRC32 Castagnoli as a hash function
diff --git a/deps/v8/third_party/zlib/contrib/minizip/README.chromium b/deps/v8/third_party/zlib/contrib/minizip/README.chromium
index 1ad489a6780db2..9c780f94682075 100644
--- a/deps/v8/third_party/zlib/contrib/minizip/README.chromium
+++ b/deps/v8/third_party/zlib/contrib/minizip/README.chromium
@@ -3,7 +3,9 @@ Short Name: minizip
 URL: https://github.com/madler/zlib/tree/master/contrib/minizip
 Version: 1.2.12
 License: Zlib
+License File: //third_party/zlib/LICENSE
 Security Critical: yes
+Shipped: yes
 
 Description:
 Minizip provides API on top of zlib that can enumerate and extract ZIP archive
@@ -13,3 +15,6 @@ Local Modifications:
 - Add parsing of the 'Info-ZIP Unicode Path Extra Field' as described in
   https://pkware.cachefly.net/webdocs/casestudies/APPNOTE.TXT section 4.6.9.
   (see crrev.com/1002476)
+
+- Check for overly long filename, comment, or extra field in
+  zipOpenNewFileInZip4_64 (crbug.com/1470539).
diff --git a/deps/v8/third_party/zlib/contrib/minizip/ioapi.h b/deps/v8/third_party/zlib/contrib/minizip/ioapi.h
index c1b7a54847f552..8dcbdb06e35ad5 100644
--- a/deps/v8/third_party/zlib/contrib/minizip/ioapi.h
+++ b/deps/v8/third_party/zlib/contrib/minizip/ioapi.h
@@ -43,7 +43,7 @@
 
 #include <stdio.h>
 #include <stdlib.h>
-#include "third_party/zlib/zlib.h"
+#include "zlib.h"
 
 #if defined(USE_FILE32API)
 #define fopen64 fopen
diff --git a/deps/v8/third_party/zlib/contrib/minizip/mztools.c b/deps/v8/third_party/zlib/contrib/minizip/mztools.c
index 8bf9cca326338a..96891c2e0b71ef 100644
--- a/deps/v8/third_party/zlib/contrib/minizip/mztools.c
+++ b/deps/v8/third_party/zlib/contrib/minizip/mztools.c
@@ -8,7 +8,7 @@
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
-#include "third_party/zlib/zlib.h"
+#include "zlib.h"
 #include "unzip.h"
 
 #define READ_8(adr)  ((unsigned char)*(adr))
diff --git a/deps/v8/third_party/zlib/contrib/minizip/mztools.h b/deps/v8/third_party/zlib/contrib/minizip/mztools.h
index f295ffeda6afcf..a49a426ec2fcb2 100644
--- a/deps/v8/third_party/zlib/contrib/minizip/mztools.h
+++ b/deps/v8/third_party/zlib/contrib/minizip/mztools.h
@@ -12,7 +12,7 @@ extern "C" {
 #endif
 
 #ifndef _ZLIB_H
-#include "third_party/zlib/zlib.h"
+#include "zlib.h"
 #endif
 
 #include "unzip.h"
diff --git a/deps/v8/third_party/zlib/contrib/minizip/unzip.c b/deps/v8/third_party/zlib/contrib/minizip/unzip.c
index 0a1d8b4fe2cf78..4973a4eea97b99 100644
--- a/deps/v8/third_party/zlib/contrib/minizip/unzip.c
+++ b/deps/v8/third_party/zlib/contrib/minizip/unzip.c
@@ -68,7 +68,7 @@
 #include <stdlib.h>
 #include <string.h>
 
-#include "third_party/zlib/zlib.h"
+#include "zlib.h"
 #include "unzip.h"
 
 #ifdef STDC
diff --git a/deps/v8/third_party/zlib/contrib/minizip/unzip.h b/deps/v8/third_party/zlib/contrib/minizip/unzip.h
index 3c0143529b9144..2104e39150749b 100644
--- a/deps/v8/third_party/zlib/contrib/minizip/unzip.h
+++ b/deps/v8/third_party/zlib/contrib/minizip/unzip.h
@@ -48,7 +48,7 @@ extern "C" {
 #endif
 
 #ifndef _ZLIB_H
-#include "third_party/zlib/zlib.h"
+#include "zlib.h"
 #endif
 
 #ifndef  _ZLIBIOAPI_H
diff --git a/deps/v8/third_party/zlib/contrib/minizip/zip.c b/deps/v8/third_party/zlib/contrib/minizip/zip.c
index 65c0c7251843c0..f21d4954286af4 100644
--- a/deps/v8/third_party/zlib/contrib/minizip/zip.c
+++ b/deps/v8/third_party/zlib/contrib/minizip/zip.c
@@ -26,7 +26,7 @@
 #include <stdlib.h>
 #include <string.h>
 #include <time.h>
-#include "third_party/zlib/zlib.h"
+#include "zlib.h"
 #include "zip.h"
 
 #ifdef STDC
@@ -1083,6 +1083,17 @@ extern int ZEXPORT zipOpenNewFileInZip4_64 (zipFile file, const char* filename,
       return ZIP_PARAMERROR;
 #endif
 
+    // The filename and comment length must fit in 16 bits.
+    if ((filename!=NULL) && (strlen(filename)>0xffff))
+        return ZIP_PARAMERROR;
+    if ((comment!=NULL) && (strlen(comment)>0xffff))
+        return ZIP_PARAMERROR;
+    // The extra field length must fit in 16 bits. If the member also requires
+    // a Zip64 extra block, that will also need to fit within that 16-bit
+    // length, but that will be checked for later.
+    if ((size_extrafield_local>0xffff) || (size_extrafield_global>0xffff))
+        return ZIP_PARAMERROR;
+
     zi = (zip64_internal*)file;
 
     if (zi->in_opened_file_inzip == 1)
diff --git a/deps/v8/third_party/zlib/contrib/minizip/zip.h b/deps/v8/third_party/zlib/contrib/minizip/zip.h
index 8c06c0aa7bb08b..8aaebb623430fc 100644
--- a/deps/v8/third_party/zlib/contrib/minizip/zip.h
+++ b/deps/v8/third_party/zlib/contrib/minizip/zip.h
@@ -47,7 +47,7 @@ extern "C" {
 //#define HAVE_BZIP2
 
 #ifndef _ZLIB_H
-#include "third_party/zlib/zlib.h"
+#include "zlib.h"
 #endif
 
 #ifndef _ZLIBIOAPI_H
diff --git a/deps/v8/third_party/zlib/contrib/optimizations/inffast_chunk.c b/deps/v8/third_party/zlib/contrib/optimizations/inffast_chunk.c
index a38e14db037496..b1db452c2e7232 100644
--- a/deps/v8/third_party/zlib/contrib/optimizations/inffast_chunk.c
+++ b/deps/v8/third_party/zlib/contrib/optimizations/inffast_chunk.c
@@ -72,10 +72,7 @@
       requires strm->avail_out >= 260 for each loop to avoid checking for
       available output space while decoding.
  */
-void ZLIB_INTERNAL inflate_fast_chunk_(strm, start)
-z_streamp strm;
-unsigned start;         /* inflate()'s starting value for strm->avail_out */
-{
+void ZLIB_INTERNAL inflate_fast_chunk_(z_streamp strm, unsigned start) {
     struct inflate_state FAR *state;
     z_const unsigned char FAR *in;      /* local strm->next_in */
     z_const unsigned char FAR *last;    /* have enough input while in < last */
diff --git a/deps/v8/third_party/zlib/contrib/optimizations/inffast_chunk.h b/deps/v8/third_party/zlib/contrib/optimizations/inffast_chunk.h
index cc861bd09d1240..e75ee5e915e136 100644
--- a/deps/v8/third_party/zlib/contrib/optimizations/inffast_chunk.h
+++ b/deps/v8/third_party/zlib/contrib/optimizations/inffast_chunk.h
@@ -39,4 +39,4 @@
 #define INFLATE_FAST_MIN_OUTPUT 260
 #endif
 
-void ZLIB_INTERNAL inflate_fast_chunk_ OF((z_streamp strm, unsigned start));
+void ZLIB_INTERNAL inflate_fast_chunk_(z_streamp strm, unsigned start);
diff --git a/deps/v8/third_party/zlib/contrib/optimizations/inflate.c b/deps/v8/third_party/zlib/contrib/optimizations/inflate.c
index f3dfba8b262852..6ed87160f5350d 100644
--- a/deps/v8/third_party/zlib/contrib/optimizations/inflate.c
+++ b/deps/v8/third_party/zlib/contrib/optimizations/inflate.c
@@ -92,20 +92,7 @@
 #  endif
 #endif
 
-/* function prototypes */
-local int inflateStateCheck OF((z_streamp strm));
-local void fixedtables OF((struct inflate_state FAR *state));
-local int updatewindow OF((z_streamp strm, const unsigned char FAR *end,
-                           unsigned copy));
-#ifdef BUILDFIXED
-   void makefixed OF((void));
-#endif
-local unsigned syncsearch OF((unsigned FAR *have, const unsigned char FAR *buf,
-                              unsigned len));
-
-local int inflateStateCheck(strm)
-z_streamp strm;
-{
+local int inflateStateCheck(z_streamp strm) {
     struct inflate_state FAR *state;
     if (strm == Z_NULL ||
         strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0)
@@ -117,9 +104,7 @@ z_streamp strm;
     return 0;
 }
 
-int ZEXPORT inflateResetKeep(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateResetKeep(z_streamp strm) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -143,9 +128,7 @@ z_streamp strm;
     return Z_OK;
 }
 
-int ZEXPORT inflateReset(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateReset(z_streamp strm) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -156,10 +139,7 @@ z_streamp strm;
     return inflateResetKeep(strm);
 }
 
-int ZEXPORT inflateReset2(strm, windowBits)
-z_streamp strm;
-int windowBits;
-{
+int ZEXPORT inflateReset2(z_streamp strm, int windowBits) {
     int wrap;
     struct inflate_state FAR *state;
 
@@ -196,12 +176,8 @@ int windowBits;
     return inflateReset(strm);
 }
 
-int ZEXPORT inflateInit2_(strm, windowBits, version, stream_size)
-z_streamp strm;
-int windowBits;
-const char *version;
-int stream_size;
-{
+int ZEXPORT inflateInit2_(z_streamp strm, int windowBits,
+                          const char *version, int stream_size) {
     int ret;
     struct inflate_state FAR *state;
 
@@ -241,22 +217,17 @@ int stream_size;
     return ret;
 }
 
-int ZEXPORT inflateInit_(strm, version, stream_size)
-z_streamp strm;
-const char *version;
-int stream_size;
-{
+int ZEXPORT inflateInit_(z_streamp strm, const char *version,
+                         int stream_size) {
     return inflateInit2_(strm, DEF_WBITS, version, stream_size);
 }
 
-int ZEXPORT inflatePrime(strm, bits, value)
-z_streamp strm;
-int bits;
-int value;
-{
+int ZEXPORT inflatePrime(z_streamp strm, int bits, int value) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
+    if (bits == 0)
+        return Z_OK;
     state = (struct inflate_state FAR *)strm->state;
     if (bits < 0) {
         state->hold = 0;
@@ -280,9 +251,7 @@ int value;
    used for threaded applications, since the rewriting of the tables and virgin
    may not be thread-safe.
  */
-local void fixedtables(state)
-struct inflate_state FAR *state;
-{
+local void fixedtables(struct inflate_state FAR *state) {
 #ifdef BUILDFIXED
     static int virgin = 1;
     static code *lenfix, *distfix;
@@ -344,7 +313,7 @@ struct inflate_state FAR *state;
 
     a.out > inffixed.h
  */
-void makefixed()
+void makefixed(void)
 {
     unsigned low, size;
     struct inflate_state state;
@@ -398,11 +367,7 @@ void makefixed()
    output will fall in the output data, making match copies simpler and faster.
    The advantage may be dependent on the size of the processor's data caches.
  */
-local int updatewindow(strm, end, copy)
-z_streamp strm;
-const Bytef *end;
-unsigned copy;
-{
+local int updatewindow(z_streamp strm, const Bytef *end, unsigned copy) {
     struct inflate_state FAR *state;
     unsigned dist;
 
@@ -634,10 +599,7 @@ unsigned copy;
    will return Z_BUF_ERROR if it has not reached the end of the stream.
  */
 
-int ZEXPORT inflate(strm, flush)
-z_streamp strm;
-int flush;
-{
+int ZEXPORT inflate(z_streamp strm, int flush) {
     struct inflate_state FAR *state;
     z_const unsigned char FAR *next;    /* next input */
     unsigned char FAR *put;     /* next output */
@@ -1336,9 +1298,7 @@ int flush;
     return ret;
 }
 
-int ZEXPORT inflateEnd(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateEnd(z_streamp strm) {
     struct inflate_state FAR *state;
     if (inflateStateCheck(strm))
         return Z_STREAM_ERROR;
@@ -1350,11 +1310,8 @@ z_streamp strm;
     return Z_OK;
 }
 
-int ZEXPORT inflateGetDictionary(strm, dictionary, dictLength)
-z_streamp strm;
-Bytef *dictionary;
-uInt *dictLength;
-{
+int ZEXPORT inflateGetDictionary(z_streamp strm, Bytef *dictionary,
+                                 uInt *dictLength) {
     struct inflate_state FAR *state;
 
     /* check state */
@@ -1373,11 +1330,8 @@ uInt *dictLength;
     return Z_OK;
 }
 
-int ZEXPORT inflateSetDictionary(strm, dictionary, dictLength)
-z_streamp strm;
-const Bytef *dictionary;
-uInt dictLength;
-{
+int ZEXPORT inflateSetDictionary(z_streamp strm, const Bytef *dictionary,
+                                 uInt dictLength) {
     struct inflate_state FAR *state;
     unsigned long dictid;
     int ret;
@@ -1408,10 +1362,7 @@ uInt dictLength;
     return Z_OK;
 }
 
-int ZEXPORT inflateGetHeader(strm, head)
-z_streamp strm;
-gz_headerp head;
-{
+int ZEXPORT inflateGetHeader(z_streamp strm, gz_headerp head) {
     struct inflate_state FAR *state;
 
     /* check state */
@@ -1436,11 +1387,8 @@ gz_headerp head;
    called again with more data and the *have state.  *have is initialized to
    zero for the first call.
  */
-local unsigned syncsearch(have, buf, len)
-unsigned FAR *have;
-const unsigned char FAR *buf;
-unsigned len;
-{
+local unsigned syncsearch(unsigned FAR *have, const unsigned char FAR *buf,
+                          unsigned len) {
     unsigned got;
     unsigned next;
 
@@ -1459,9 +1407,7 @@ unsigned len;
     return next;
 }
 
-int ZEXPORT inflateSync(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateSync(z_streamp strm) {
     unsigned len;               /* number of bytes to look at or looked at */
     int flags;                  /* temporary to save header status */
     unsigned long in, out;      /* temporary to save total_in and total_out */
@@ -1517,9 +1463,7 @@ z_streamp strm;
    block. When decompressing, PPP checks that at the end of input packet,
    inflate is waiting for these length bytes.
  */
-int ZEXPORT inflateSyncPoint(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateSyncPoint(z_streamp strm) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -1527,10 +1471,7 @@ z_streamp strm;
     return state->mode == STORED && state->bits == 0;
 }
 
-int ZEXPORT inflateCopy(dest, source)
-z_streamp dest;
-z_streamp source;
-{
+int ZEXPORT inflateCopy(z_streamp dest, z_streamp source) {
     struct inflate_state FAR *state;
     struct inflate_state FAR *copy;
     unsigned char FAR *window;
@@ -1574,10 +1515,7 @@ z_streamp source;
     return Z_OK;
 }
 
-int ZEXPORT inflateUndermine(strm, subvert)
-z_streamp strm;
-int subvert;
-{
+int ZEXPORT inflateUndermine(z_streamp strm, int subvert) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -1592,10 +1530,7 @@ int subvert;
 #endif
 }
 
-int ZEXPORT inflateValidate(strm, check)
-z_streamp strm;
-int check;
-{
+int ZEXPORT inflateValidate(z_streamp strm, int check) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -1607,9 +1542,7 @@ int check;
     return Z_OK;
 }
 
-long ZEXPORT inflateMark(strm)
-z_streamp strm;
-{
+long ZEXPORT inflateMark(z_streamp strm) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm))
@@ -1620,9 +1553,7 @@ z_streamp strm;
             (state->mode == MATCH ? state->was - state->length : 0));
 }
 
-unsigned long ZEXPORT inflateCodesUsed(strm)
-z_streamp strm;
-{
+unsigned long ZEXPORT inflateCodesUsed(z_streamp strm) {
     struct inflate_state FAR *state;
     if (inflateStateCheck(strm)) return (unsigned long)-1;
     state = (struct inflate_state FAR *)strm->state;
diff --git a/deps/v8/third_party/zlib/cpu_features.c b/deps/v8/third_party/zlib/cpu_features.c
index 877d5f23d0ceae..64e0428cd2fc2d 100644
--- a/deps/v8/third_party/zlib/cpu_features.c
+++ b/deps/v8/third_party/zlib/cpu_features.c
@@ -31,10 +31,11 @@ int ZLIB_INTERNAL arm_cpu_enable_pmull = 0;
 int ZLIB_INTERNAL x86_cpu_enable_sse2 = 0;
 int ZLIB_INTERNAL x86_cpu_enable_ssse3 = 0;
 int ZLIB_INTERNAL x86_cpu_enable_simd = 0;
+int ZLIB_INTERNAL x86_cpu_enable_avx512 = 0;
 
 #ifndef CPU_NO_SIMD
 
-#if defined(ARMV8_OS_ANDROID) || defined(ARMV8_OS_LINUX) || defined(ARMV8_OS_FUCHSIA)
+#if defined(ARMV8_OS_ANDROID) || defined(ARMV8_OS_LINUX) || defined(ARMV8_OS_FUCHSIA) || defined(ARMV8_OS_IOS)
 #include <pthread.h>
 #endif
 
@@ -49,17 +50,19 @@ int ZLIB_INTERNAL x86_cpu_enable_simd = 0;
 #include <zircon/types.h>
 #elif defined(ARMV8_OS_WINDOWS) || defined(X86_WINDOWS)
 #include <windows.h>
+#elif defined(ARMV8_OS_IOS)
+#include <sys/sysctl.h>
 #elif !defined(_MSC_VER)
 #include <pthread.h>
 #else
 #error cpu_features.c CPU feature detection in not defined for your platform
 #endif
 
-#if !defined(CPU_NO_SIMD) && !defined(ARMV8_OS_MACOS) && !defined(ARM_OS_IOS)
+#if !defined(CPU_NO_SIMD) && !defined(ARMV8_OS_MACOS)
 static void _cpu_check_features(void);
 #endif
 
-#if defined(ARMV8_OS_ANDROID) || defined(ARMV8_OS_LINUX) || defined(ARMV8_OS_MACOS) || defined(ARMV8_OS_FUCHSIA) || defined(X86_NOT_WINDOWS)
+#if defined(ARMV8_OS_ANDROID) || defined(ARMV8_OS_LINUX) || defined(ARMV8_OS_MACOS) || defined(ARMV8_OS_FUCHSIA) || defined(X86_NOT_WINDOWS) || defined(ARMV8_OS_IOS)
 #if !defined(ARMV8_OS_MACOS)
 // _cpu_check_features() doesn't need to do anything on mac/arm since all
 // features are known at build time, so don't call it.
@@ -88,11 +91,7 @@ void ZLIB_INTERNAL cpu_check_features(void)
 #endif
 
 #if (defined(__ARM_NEON__) || defined(__ARM_NEON))
-/*
- * iOS@ARM is a special case where we always have NEON but don't check
- * for crypto extensions.
- */
-#if !defined(ARMV8_OS_MACOS) && !defined(ARM_OS_IOS)
+#if !defined(ARMV8_OS_MACOS)
 /*
  * See http://bit.ly/2CcoEsr for run-time detection of ARM features and also
  * crbug.com/931275 for android_getCpuFeatures() use in the Android sandbox.
@@ -126,6 +125,18 @@ static void _cpu_check_features(void)
 #elif defined(ARMV8_OS_WINDOWS)
     arm_cpu_enable_crc32 = IsProcessorFeaturePresent(PF_ARM_V8_CRC32_INSTRUCTIONS_AVAILABLE);
     arm_cpu_enable_pmull = IsProcessorFeaturePresent(PF_ARM_V8_CRYPTO_INSTRUCTIONS_AVAILABLE);
+#elif defined(ARMV8_OS_IOS)
+    // Determine what features are supported dynamically. This code is applicable to macOS
+    // as well if we wish to do that dynamically on that platform in the future.
+    // See https://developer.apple.com/documentation/kernel/1387446-sysctlbyname/determining_instruction_set_characteristics
+    int val = 0;
+    size_t len = sizeof(val);
+    arm_cpu_enable_crc32 = sysctlbyname("hw.optional.armv8_crc32", &val, &len, 0, 0) == 0
+               && val != 0;
+    val = 0;
+    len = sizeof(val);
+    arm_cpu_enable_pmull = sysctlbyname("hw.optional.arm.FEAT_PMULL", &val, &len, 0, 0) == 0
+               && val != 0;
 #endif
 }
 #endif
@@ -138,6 +149,10 @@ static void _cpu_check_features(void)
 /* On x86 we simply use a instruction to check the CPU features.
  * (i.e. CPUID).
  */
+#ifdef CRC32_SIMD_AVX512_PCLMUL
+#include <immintrin.h>
+#include <xsaveintrin.h>
+#endif
 static void _cpu_check_features(void)
 {
     int x86_cpu_has_sse2;
@@ -164,6 +179,10 @@ static void _cpu_check_features(void)
     x86_cpu_enable_simd = x86_cpu_has_sse2 &&
                           x86_cpu_has_sse42 &&
                           x86_cpu_has_pclmulqdq;
+
+#ifdef CRC32_SIMD_AVX512_PCLMUL
+    x86_cpu_enable_avx512 = _xgetbv(0) & 0x00000040;
+#endif
 }
 #endif
 #endif
diff --git a/deps/v8/third_party/zlib/cpu_features.h b/deps/v8/third_party/zlib/cpu_features.h
index 279246c859e87e..aed3e834c5ac89 100644
--- a/deps/v8/third_party/zlib/cpu_features.h
+++ b/deps/v8/third_party/zlib/cpu_features.h
@@ -14,5 +14,6 @@ extern int arm_cpu_enable_pmull;
 extern int x86_cpu_enable_sse2;
 extern int x86_cpu_enable_ssse3;
 extern int x86_cpu_enable_simd;
+extern int x86_cpu_enable_avx512;
 
 void cpu_check_features(void);
diff --git a/deps/v8/third_party/zlib/crc32.c b/deps/v8/third_party/zlib/crc32.c
index 4486098c7b3a1d..1e1a57519cbda6 100644
--- a/deps/v8/third_party/zlib/crc32.c
+++ b/deps/v8/third_party/zlib/crc32.c
@@ -110,19 +110,6 @@
 #  define ARMCRC32_CANONICAL_ZLIB
 #endif
 
-/* Local functions. */
-local z_crc_t multmodp OF((z_crc_t a, z_crc_t b));
-local z_crc_t x2nmodp OF((z_off64_t n, unsigned k));
-
-#if defined(W) && (!defined(ARMCRC32_CANONICAL_ZLIB) || defined(DYNAMIC_CRC_TABLE))
-    local z_word_t byte_swap OF((z_word_t word));
-#endif
-
-#if defined(W) && !defined(ARMCRC32_CANONICAL_ZLIB)
-    local z_crc_t crc_word OF((z_word_t data));
-    local z_word_t crc_word_big OF((z_word_t data));
-#endif
-
 #if defined(W) && (!defined(ARMCRC32_CANONICAL_ZLIB) || defined(DYNAMIC_CRC_TABLE))
 /*
   Swap the bytes in a z_word_t to convert between little and big endian. Any
@@ -130,9 +117,7 @@ local z_crc_t x2nmodp OF((z_off64_t n, unsigned k));
   instruction, if one is available. This assumes that word_t is either 32 bits
   or 64 bits.
  */
-local z_word_t byte_swap(word)
-    z_word_t word;
-{
+local z_word_t byte_swap(z_word_t word) {
 #  if W == 8
     return
         (word & 0xff00000000000000) >> 56 |
@@ -153,24 +138,77 @@ local z_word_t byte_swap(word)
 }
 #endif
 
+#ifdef DYNAMIC_CRC_TABLE
+/* =========================================================================
+ * Table of powers of x for combining CRC-32s, filled in by make_crc_table()
+ * below.
+ */
+   local z_crc_t FAR x2n_table[32];
+#else
+/* =========================================================================
+ * Tables for byte-wise and braided CRC-32 calculations, and a table of powers
+ * of x for combining CRC-32s, all made by make_crc_table().
+ */
+#  include "crc32.h"
+#endif
+
 /* CRC polynomial. */
 #define POLY 0xedb88320         /* p(x) reflected, with x^32 implied */
 
-#ifdef DYNAMIC_CRC_TABLE
+/*
+  Return a(x) multiplied by b(x) modulo p(x), where p(x) is the CRC polynomial,
+  reflected. For speed, this requires that a not be zero.
+ */
+local z_crc_t multmodp(z_crc_t a, z_crc_t b) {
+    z_crc_t m, p;
+
+    m = (z_crc_t)1 << 31;
+    p = 0;
+    for (;;) {
+        if (a & m) {
+            p ^= b;
+            if ((a & (m - 1)) == 0)
+                break;
+        }
+        m >>= 1;
+        b = b & 1 ? (b >> 1) ^ POLY : b >> 1;
+    }
+    return p;
+}
+
+/*
+  Return x^(n * 2^k) modulo p(x). Requires that x2n_table[] has been
+  initialized.
+ */
+local z_crc_t x2nmodp(z_off64_t n, unsigned k) {
+    z_crc_t p;
+
+    p = (z_crc_t)1 << 31;           /* x^0 == 1 */
+    while (n) {
+        if (n & 1)
+            p = multmodp(x2n_table[k & 31], p);
+        n >>= 1;
+        k++;
+    }
+    return p;
+}
 
+#ifdef DYNAMIC_CRC_TABLE
+/* =========================================================================
+ * Build the tables for byte-wise and braided CRC-32 calculations, and a table
+ * of powers of x for combining CRC-32s.
+ */
 local z_crc_t FAR crc_table[256];
-local z_crc_t FAR x2n_table[32];
-local void make_crc_table OF((void));
 #ifdef W
    local z_word_t FAR crc_big_table[256];
    local z_crc_t FAR crc_braid_table[W][256];
    local z_word_t FAR crc_braid_big_table[W][256];
-   local void braid OF((z_crc_t [][256], z_word_t [][256], int, int));
+   local void braid(z_crc_t [][256], z_word_t [][256], int, int);
 #endif
 #ifdef MAKECRCH
-   local void write_table OF((FILE *, const z_crc_t FAR *, int));
-   local void write_table32hi OF((FILE *, const z_word_t FAR *, int));
-   local void write_table64 OF((FILE *, const z_word_t FAR *, int));
+   local void write_table(FILE *, const z_crc_t FAR *, int);
+   local void write_table32hi(FILE *, const z_word_t FAR *, int);
+   local void write_table64(FILE *, const z_word_t FAR *, int);
 #endif /* MAKECRCH */
 
 /*
@@ -183,7 +221,6 @@ local void make_crc_table OF((void));
 
 /* Definition of once functionality. */
 typedef struct once_s once_t;
-local void once OF((once_t *, void (*)(void)));
 
 /* Check for the availability of atomics. */
 #if defined(__STDC__) && __STDC_VERSION__ >= 201112L && \
@@ -203,10 +240,7 @@ struct once_s {
   invoke once() at the same time. The state must be a once_t initialized with
   ONCE_INIT.
  */
-local void once(state, init)
-    once_t *state;
-    void (*init)(void);
-{
+local void once(once_t *state, void (*init)(void)) {
     if (!atomic_load(&state->done)) {
         if (atomic_flag_test_and_set(&state->begun))
             while (!atomic_load(&state->done))
@@ -229,10 +263,7 @@ struct once_s {
 
 /* Test and set. Alas, not atomic, but tries to minimize the period of
    vulnerability. */
-local int test_and_set OF((int volatile *));
-local int test_and_set(flag)
-    int volatile *flag;
-{
+local int test_and_set(int volatile *flag) {
     int was;
 
     was = *flag;
@@ -241,10 +272,7 @@ local int test_and_set(flag)
 }
 
 /* Run the provided init() function once. This is not thread-safe. */
-local void once(state, init)
-    once_t *state;
-    void (*init)(void);
-{
+local void once(once_t *state, void (*init)(void)) {
     if (!state->done) {
         if (test_and_set(&state->begun))
             while (!state->done)
@@ -285,7 +313,7 @@ local once_t made = ONCE_INIT;
   information needed to generate CRCs on data a byte at a time for all
   combinations of CRC register values and incoming bytes.
  */
-local void make_crc_table()
+local void make_crc_table(void)
 {
     unsigned i, j, n;
     z_crc_t p;
@@ -453,11 +481,7 @@ local void make_crc_table()
    Write the 32-bit values in table[0..k-1] to out, five per line in
    hexadecimal separated by commas.
  */
-local void write_table(out, table, k)
-    FILE *out;
-    const z_crc_t FAR *table;
-    int k;
-{
+local void write_table(FILE *out, const z_crc_t FAR *table, int k) {
     int n;
 
     for (n = 0; n < k; n++)
@@ -470,11 +494,7 @@ local void write_table(out, table, k)
    Write the high 32-bits of each value in table[0..k-1] to out, five per line
    in hexadecimal separated by commas.
  */
-local void write_table32hi(out, table, k)
-FILE *out;
-const z_word_t FAR *table;
-int k;
-{
+local void write_table32hi(FILE *out, const z_word_t FAR *table, int k) {
     int n;
 
     for (n = 0; n < k; n++)
@@ -490,11 +510,7 @@ int k;
   bits. If not, then the type cast and format string can be adjusted
   accordingly.
  */
-local void write_table64(out, table, k)
-    FILE *out;
-    const z_word_t FAR *table;
-    int k;
-{
+local void write_table64(FILE *out, const z_word_t FAR *table, int k) {
     int n;
 
     for (n = 0; n < k; n++)
@@ -504,8 +520,7 @@ local void write_table64(out, table, k)
 }
 
 /* Actually do the deed. */
-int main()
-{
+int main(void) {
     make_crc_table();
     return 0;
 }
@@ -517,12 +532,7 @@ int main()
   Generate the little and big-endian braid tables for the given n and z_word_t
   size w. Each array must have room for w blocks of 256 elements.
  */
-local void braid(ltl, big, n, w)
-    z_crc_t ltl[][256];
-    z_word_t big[][256];
-    int n;
-    int w;
-{
+local void braid(z_crc_t ltl[][256], z_word_t big[][256], int n, int w) {
     int k;
     z_crc_t i, p, q;
     for (k = 0; k < w; k++) {
@@ -537,69 +547,13 @@ local void braid(ltl, big, n, w)
 }
 #endif
 
-#else /* !DYNAMIC_CRC_TABLE */
-/* ========================================================================
- * Tables for byte-wise and braided CRC-32 calculations, and a table of powers
- * of x for combining CRC-32s, all made by make_crc_table().
- */
-#include "crc32.h"
 #endif /* DYNAMIC_CRC_TABLE */
 
-/* ========================================================================
- * Routines used for CRC calculation. Some are also required for the table
- * generation above.
- */
-
-/*
-  Return a(x) multiplied by b(x) modulo p(x), where p(x) is the CRC polynomial,
-  reflected. For speed, this requires that a not be zero.
- */
-local z_crc_t multmodp(a, b)
-    z_crc_t a;
-    z_crc_t b;
-{
-    z_crc_t m, p;
-
-    m = (z_crc_t)1 << 31;
-    p = 0;
-    for (;;) {
-        if (a & m) {
-            p ^= b;
-            if ((a & (m - 1)) == 0)
-                break;
-        }
-        m >>= 1;
-        b = b & 1 ? (b >> 1) ^ POLY : b >> 1;
-    }
-    return p;
-}
-
-/*
-  Return x^(n * 2^k) modulo p(x). Requires that x2n_table[] has been
-  initialized.
- */
-local z_crc_t x2nmodp(n, k)
-    z_off64_t n;
-    unsigned k;
-{
-    z_crc_t p;
-
-    p = (z_crc_t)1 << 31;           /* x^0 == 1 */
-    while (n) {
-        if (n & 1)
-            p = multmodp(x2n_table[k & 31], p);
-        n >>= 1;
-        k++;
-    }
-    return p;
-}
-
 /* =========================================================================
  * This function can be used by asm versions of crc32(), and to force the
  * generation of the CRC tables in a threaded application.
  */
-const z_crc_t FAR * ZEXPORT get_crc_table()
-{
+const z_crc_t FAR * ZEXPORT get_crc_table(void) {
 #ifdef DYNAMIC_CRC_TABLE
     once(&made, make_crc_table);
 #endif /* DYNAMIC_CRC_TABLE */
@@ -625,11 +579,8 @@ const z_crc_t FAR * ZEXPORT get_crc_table()
 #define Z_BATCH_ZEROS 0xa10d3d0c    /* computed from Z_BATCH = 3990 */
 #define Z_BATCH_MIN 800             /* fewest words in a final batch */
 
-unsigned long ZEXPORT crc32_z(crc, buf, len)
-    unsigned long crc;
-    const unsigned char FAR *buf;
-    z_size_t len;
-{
+unsigned long ZEXPORT crc32_z(unsigned long crc, const unsigned char FAR *buf,
+                              z_size_t len) {
     z_crc_t val;
     z_word_t crc1, crc2;
     const z_word_t *word;
@@ -729,18 +680,14 @@ unsigned long ZEXPORT crc32_z(crc, buf, len)
   least-significant byte of the word as the first byte of data, without any pre
   or post conditioning. This is used to combine the CRCs of each braid.
  */
-local z_crc_t crc_word(data)
-    z_word_t data;
-{
+local z_crc_t crc_word(z_word_t data) {
     int k;
     for (k = 0; k < W; k++)
         data = (data >> 8) ^ crc_table[data & 0xff];
     return (z_crc_t)data;
 }
 
-local z_word_t crc_word_big(data)
-    z_word_t data;
-{
+local z_word_t crc_word_big(z_word_t data) {
     int k;
     for (k = 0; k < W; k++)
         data = (data << 8) ^
@@ -751,11 +698,8 @@ local z_word_t crc_word_big(data)
 #endif
 
 /* ========================================================================= */
-unsigned long ZEXPORT crc32_z(crc, buf, len)
-    unsigned long crc;
-    const unsigned char FAR *buf;
-    z_size_t len;
-{
+unsigned long ZEXPORT crc32_z(unsigned long crc, const unsigned char FAR *buf,
+                              z_size_t len) {
     /*
      * zlib convention is to call crc32(0, NULL, 0); before making
      * calls to crc32(). So this is a good, early (and infrequent)
@@ -773,7 +717,19 @@ unsigned long ZEXPORT crc32_z(crc, buf, len)
     }
 
 #endif
-#if defined(CRC32_SIMD_SSE42_PCLMUL)
+#if defined(CRC32_SIMD_AVX512_PCLMUL)
+    if (x86_cpu_enable_avx512 && len >= Z_CRC32_AVX512_MINIMUM_LENGTH) {
+        /* crc32 64-byte chunks */
+        z_size_t chunk_size = len & ~Z_CRC32_AVX512_CHUNKSIZE_MASK;
+        crc = ~crc32_avx512_simd_(buf, chunk_size, ~(uint32_t)crc);
+        /* check remaining data */
+        len -= chunk_size;
+        if (!len)
+            return crc;
+        /* Fall into the default crc32 for the remaining data. */
+        buf += chunk_size;
+    }
+#elif defined(CRC32_SIMD_SSE42_PCLMUL)
     if (x86_cpu_enable_simd && len >= Z_CRC32_SSE42_MINIMUM_LENGTH) {
         /* crc32 16-byte chunks */
         z_size_t chunk_size = len & ~Z_CRC32_SSE42_CHUNKSIZE_MASK;
@@ -1124,11 +1080,8 @@ unsigned long ZEXPORT crc32_z(crc, buf, len)
 #endif
 
 /* ========================================================================= */
-unsigned long ZEXPORT crc32(crc, buf, len)
-    unsigned long crc;
-    const unsigned char FAR *buf;
-    uInt len;
-{
+unsigned long ZEXPORT crc32(unsigned long crc, const unsigned char FAR *buf,
+                            uInt len) {
     /* Some bots compile with optimizations disabled, others will emulate
      * ARM on x86 and other weird combinations.
      */
@@ -1168,11 +1121,7 @@ unsigned long ZEXPORT crc32(crc, buf, len)
 }
 
 /* ========================================================================= */
-uLong ZEXPORT crc32_combine64(crc1, crc2, len2)
-    uLong crc1;
-    uLong crc2;
-    z_off64_t len2;
-{
+uLong ZEXPORT crc32_combine64(uLong crc1, uLong crc2, z_off64_t len2) {
 #ifdef DYNAMIC_CRC_TABLE
     once(&made, make_crc_table);
 #endif /* DYNAMIC_CRC_TABLE */
@@ -1180,17 +1129,11 @@ uLong ZEXPORT crc32_combine64(crc1, crc2, len2)
 }
 
 /* ========================================================================= */
-uLong ZEXPORT crc32_combine(crc1, crc2, len2)
-    uLong crc1;
-    uLong crc2;
-    z_off_t len2;
-{
+uLong ZEXPORT crc32_combine(uLong crc1, uLong crc2, z_off_t len2) {
     return crc32_combine64(crc1, crc2, (z_off64_t)len2);
 }
 /* ========================================================================= */
-uLong ZEXPORT crc32_combine_gen64(len2)
-    z_off64_t len2;
-{
+uLong ZEXPORT crc32_combine_gen64(z_off64_t len2) {
 #ifdef DYNAMIC_CRC_TABLE
     once(&made, make_crc_table);
 #endif /* DYNAMIC_CRC_TABLE */
@@ -1198,18 +1141,12 @@ uLong ZEXPORT crc32_combine_gen64(len2)
 }
 
 /* ========================================================================= */
-uLong ZEXPORT crc32_combine_gen(len2)
-    z_off_t len2;
-{
+uLong ZEXPORT crc32_combine_gen(z_off_t len2) {
     return crc32_combine_gen64((z_off64_t)len2);
 }
 
 /* ========================================================================= */
-uLong ZEXPORT crc32_combine_op(crc1, crc2, op)
-    uLong crc1;
-    uLong crc2;
-    uLong op;
-{
+uLong ZEXPORT crc32_combine_op(uLong crc1, uLong crc2, uLong op) {
     return multmodp(op, crc1) ^ (crc2 & 0xffffffff);
 }
 
diff --git a/deps/v8/third_party/zlib/crc32_simd.c b/deps/v8/third_party/zlib/crc32_simd.c
index d80beba39c0397..7428270920a03e 100644
--- a/deps/v8/third_party/zlib/crc32_simd.c
+++ b/deps/v8/third_party/zlib/crc32_simd.c
@@ -6,17 +6,207 @@
  */
 
 #include "crc32_simd.h"
-
-#if defined(CRC32_SIMD_SSE42_PCLMUL)
+#if defined(CRC32_SIMD_AVX512_PCLMUL)
 
 /*
- * crc32_sse42_simd_(): compute the crc32 of the buffer, where the buffer
- * length must be at least 64, and a multiple of 16. Based on:
+ * crc32_avx512_simd_(): compute the crc32 of the buffer, where the buffer
+ * length must be at least 256, and a multiple of 64. Based on:
  *
  * "Fast CRC Computation for Generic Polynomials Using PCLMULQDQ Instruction"
  *  V. Gopal, E. Ozturk, et al., 2009, http://intel.ly/2ySEwL0
  */
 
+#include <emmintrin.h>
+#include <smmintrin.h>
+#include <wmmintrin.h>
+#include <immintrin.h>
+
+uint32_t ZLIB_INTERNAL crc32_avx512_simd_(  /* AVX512+PCLMUL */
+    const unsigned char *buf,
+    z_size_t len,
+    uint32_t crc)
+{
+    /*
+     * Definitions of the bit-reflected domain constants k1,k2,k3,k4
+     * are similar to those given at the end of the paper, and remaining
+     * constants and CRC32+Barrett polynomials remain unchanged.
+     *
+     * Replace the index of x from 128 to 512. As follows:
+     * k1 = ( x ^ ( 512 * 4 + 32 ) mod P(x) << 32 )' << 1 = 0x011542778a
+     * k2 = ( x ^ ( 512 * 4 - 32 ) mod P(x) << 32 )' << 1 = 0x01322d1430
+     * k3 = ( x ^ ( 512 + 32 ) mod P(x) << 32 )' << 1 = 0x0154442bd4
+     * k4 = ( x ^ ( 512 - 32 ) mod P(x) << 32 )' << 1 = 0x01c6e41596
+     */
+    static const uint64_t zalign(64) k1k2[] = { 0x011542778a, 0x01322d1430,
+                                                0x011542778a, 0x01322d1430,
+                                                0x011542778a, 0x01322d1430,
+                                                0x011542778a, 0x01322d1430 };
+    static const uint64_t zalign(64) k3k4[] = { 0x0154442bd4, 0x01c6e41596,
+                                                0x0154442bd4, 0x01c6e41596,
+                                                0x0154442bd4, 0x01c6e41596,
+                                                0x0154442bd4, 0x01c6e41596 };
+    static const uint64_t zalign(16) k5k6[] = { 0x01751997d0, 0x00ccaa009e };
+    static const uint64_t zalign(16) k7k8[] = { 0x0163cd6124, 0x0000000000 };
+    static const uint64_t zalign(16) poly[] = { 0x01db710641, 0x01f7011641 };
+    __m512i x0, x1, x2, x3, x4, x5, x6, x7, x8, y5, y6, y7, y8;
+    __m128i a0, a1, a2, a3;
+
+    /*
+     * There's at least one block of 256.
+     */
+    x1 = _mm512_loadu_si512((__m512i *)(buf + 0x00));
+    x2 = _mm512_loadu_si512((__m512i *)(buf + 0x40));
+    x3 = _mm512_loadu_si512((__m512i *)(buf + 0x80));
+    x4 = _mm512_loadu_si512((__m512i *)(buf + 0xC0));
+
+    x1 = _mm512_xor_si512(x1, _mm512_castsi128_si512(_mm_cvtsi32_si128(crc)));
+
+    x0 = _mm512_load_si512((__m512i *)k1k2);
+
+    buf += 256;
+    len -= 256;
+
+    /*
+     * Parallel fold blocks of 256, if any.
+     */
+    while (len >= 256)
+    {
+        x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
+        x6 = _mm512_clmulepi64_epi128(x2, x0, 0x00);
+        x7 = _mm512_clmulepi64_epi128(x3, x0, 0x00);
+        x8 = _mm512_clmulepi64_epi128(x4, x0, 0x00);
+
+
+        x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
+        x2 = _mm512_clmulepi64_epi128(x2, x0, 0x11);
+        x3 = _mm512_clmulepi64_epi128(x3, x0, 0x11);
+        x4 = _mm512_clmulepi64_epi128(x4, x0, 0x11);
+
+        y5 = _mm512_loadu_si512((__m512i *)(buf + 0x00));
+        y6 = _mm512_loadu_si512((__m512i *)(buf + 0x40));
+        y7 = _mm512_loadu_si512((__m512i *)(buf + 0x80));
+        y8 = _mm512_loadu_si512((__m512i *)(buf + 0xC0));
+
+        x1 = _mm512_xor_si512(x1, x5);
+        x2 = _mm512_xor_si512(x2, x6);
+        x3 = _mm512_xor_si512(x3, x7);
+        x4 = _mm512_xor_si512(x4, x8);
+
+        x1 = _mm512_xor_si512(x1, y5);
+        x2 = _mm512_xor_si512(x2, y6);
+        x3 = _mm512_xor_si512(x3, y7);
+        x4 = _mm512_xor_si512(x4, y8);
+
+        buf += 256;
+        len -= 256;
+    }
+
+    /*
+     * Fold into 512-bits.
+     */
+    x0 = _mm512_load_si512((__m512i *)k3k4);
+
+    x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
+    x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
+    x1 = _mm512_xor_si512(x1, x2);
+    x1 = _mm512_xor_si512(x1, x5);
+
+    x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
+    x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
+    x1 = _mm512_xor_si512(x1, x3);
+    x1 = _mm512_xor_si512(x1, x5);
+
+    x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
+    x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
+    x1 = _mm512_xor_si512(x1, x4);
+    x1 = _mm512_xor_si512(x1, x5);
+
+    /*
+     * Single fold blocks of 64, if any.
+     */
+    while (len >= 64)
+    {
+        x2 = _mm512_loadu_si512((__m512i *)buf);
+
+        x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
+        x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
+        x1 = _mm512_xor_si512(x1, x2);
+        x1 = _mm512_xor_si512(x1, x5);
+
+        buf += 64;
+        len -= 64;
+    }
+
+    /*
+     * Fold 512-bits to 384-bits.
+     */
+    a0 = _mm_load_si128((__m128i *)k5k6);
+
+    a1 = _mm512_extracti32x4_epi32(x1, 0);
+    a2 = _mm512_extracti32x4_epi32(x1, 1);
+
+    a3 = _mm_clmulepi64_si128(a1, a0, 0x00);
+    a1 = _mm_clmulepi64_si128(a1, a0, 0x11);
+
+    a1 = _mm_xor_si128(a1, a3);
+    a1 = _mm_xor_si128(a1, a2);
+
+    /*
+     * Fold 384-bits to 256-bits.
+     */
+    a2 = _mm512_extracti32x4_epi32(x1, 2);
+    a3 = _mm_clmulepi64_si128(a1, a0, 0x00);
+    a1 = _mm_clmulepi64_si128(a1, a0, 0x11);
+    a1 = _mm_xor_si128(a1, a3);
+    a1 = _mm_xor_si128(a1, a2);
+
+    /*
+     * Fold 256-bits to 128-bits.
+     */
+    a2 = _mm512_extracti32x4_epi32(x1, 3);
+    a3 = _mm_clmulepi64_si128(a1, a0, 0x00);
+    a1 = _mm_clmulepi64_si128(a1, a0, 0x11);
+    a1 = _mm_xor_si128(a1, a3);
+    a1 = _mm_xor_si128(a1, a2);
+
+    /*
+     * Fold 128-bits to 64-bits.
+     */
+    a2 = _mm_clmulepi64_si128(a1, a0, 0x10);
+    a3 = _mm_setr_epi32(~0, 0, ~0, 0);
+    a1 = _mm_srli_si128(a1, 8);
+    a1 = _mm_xor_si128(a1, a2);
+
+    a0 = _mm_loadl_epi64((__m128i*)k7k8);
+    a2 = _mm_srli_si128(a1, 4);
+    a1 = _mm_and_si128(a1, a3);
+    a1 = _mm_clmulepi64_si128(a1, a0, 0x00);
+    a1 = _mm_xor_si128(a1, a2);
+
+    /*
+     * Barret reduce to 32-bits.
+     */
+    a0 = _mm_load_si128((__m128i*)poly);
+
+    a2 = _mm_and_si128(a1, a3);
+    a2 = _mm_clmulepi64_si128(a2, a0, 0x10);
+    a2 = _mm_and_si128(a2, a3);
+    a2 = _mm_clmulepi64_si128(a2, a0, 0x00);
+    a1 = _mm_xor_si128(a1, a2);
+
+    /*
+     * Return the crc32.
+     */
+    return _mm_extract_epi32(a1, 1);
+}
+
+#elif defined(CRC32_SIMD_SSE42_PCLMUL)
+
+/*
+ * crc32_sse42_simd_(): compute the crc32 of the buffer, where the buffer
+ * length must be at least 64, and a multiple of 16.
+ */
+
 #include <emmintrin.h>
 #include <smmintrin.h>
 #include <wmmintrin.h>
diff --git a/deps/v8/third_party/zlib/crc32_simd.h b/deps/v8/third_party/zlib/crc32_simd.h
index c0346dc3d903e3..84624647bcd216 100644
--- a/deps/v8/third_party/zlib/crc32_simd.h
+++ b/deps/v8/third_party/zlib/crc32_simd.h
@@ -19,12 +19,18 @@ uint32_t ZLIB_INTERNAL crc32_sse42_simd_(const unsigned char* buf,
                                          z_size_t len,
                                          uint32_t crc);
 
+uint32_t ZLIB_INTERNAL crc32_avx512_simd_(const unsigned char* buf,
+                                          z_size_t len,
+                                          uint32_t crc);
+
 /*
  * crc32_sse42_simd_ buffer size constraints: see the use in zlib/crc32.c
  * for computing the crc32 of an arbitrary length buffer.
  */
 #define Z_CRC32_SSE42_MINIMUM_LENGTH 64
 #define Z_CRC32_SSE42_CHUNKSIZE_MASK 15
+#define Z_CRC32_AVX512_MINIMUM_LENGTH 256
+#define Z_CRC32_AVX512_CHUNKSIZE_MASK 63
 
 /*
  * CRC32 checksums using ARMv8-a crypto instructions.
diff --git a/deps/v8/third_party/zlib/crc_folding.c b/deps/v8/third_party/zlib/crc_folding.c
index ee31d4918d6413..1b4f4e1d193871 100644
--- a/deps/v8/third_party/zlib/crc_folding.c
+++ b/deps/v8/third_party/zlib/crc_folding.c
@@ -435,7 +435,10 @@ unsigned ZLIB_INTERNAL crc_fold_512to32(deflate_state *const s)
     unsigned crc;
     __m128i x_tmp0, x_tmp1, x_tmp2, crc_fold;
 
-    CRC_LOAD(s)
+    __m128i xmm_crc0 = _mm_loadu_si128((__m128i *)s->crc0 + 0);
+    __m128i xmm_crc1 = _mm_loadu_si128((__m128i *)s->crc0 + 1);
+    __m128i xmm_crc2 = _mm_loadu_si128((__m128i *)s->crc0 + 2);
+    __m128i xmm_crc3 = _mm_loadu_si128((__m128i *)s->crc0 + 3);
 
     /*
      * k1
@@ -491,7 +494,6 @@ unsigned ZLIB_INTERNAL crc_fold_512to32(deflate_state *const s)
 
     crc = _mm_extract_epi32(xmm_crc3, 2);
     return ~crc;
-    CRC_SAVE(s)
 }
 
 #endif  /* CRC32_SIMD_SSE42_PCLMUL */
diff --git a/deps/v8/third_party/zlib/deflate.c b/deps/v8/third_party/zlib/deflate.c
index 413590f2735d3c..1fa55e5d010618 100644
--- a/deps/v8/third_party/zlib/deflate.c
+++ b/deps/v8/third_party/zlib/deflate.c
@@ -65,7 +65,7 @@
 #endif
 
 const char deflate_copyright[] =
-   " deflate 1.2.13 Copyright 1995-2022 Jean-loup Gailly and Mark Adler ";
+   " deflate 1.2.13.1 Copyright 1995-2022 Jean-loup Gailly and Mark Adler ";
 /*
   If you use the zlib library in a product, an acknowledgment is welcome
   in the documentation of your product. If for some reason you cannot
@@ -73,9 +73,6 @@ const char deflate_copyright[] =
   copyright string in the executable of your product.
  */
 
-/* ===========================================================================
- *  Function prototypes.
- */
 typedef enum {
     need_more,      /* block not completed, need more input or more output */
     block_done,     /* block flush performed */
@@ -83,29 +80,16 @@ typedef enum {
     finish_done     /* finish done, accept no more input or output */
 } block_state;
 
-typedef block_state (*compress_func) OF((deflate_state *s, int flush));
+typedef block_state (*compress_func)(deflate_state *s, int flush);
 /* Compression function. Returns the block state after the call. */
 
-local int deflateStateCheck      OF((z_streamp strm));
-local void slide_hash     OF((deflate_state *s));
-local void fill_window    OF((deflate_state *s));
-local block_state deflate_stored OF((deflate_state *s, int flush));
-local block_state deflate_fast   OF((deflate_state *s, int flush));
+local block_state deflate_stored(deflate_state *s, int flush);
+local block_state deflate_fast(deflate_state *s, int flush);
 #ifndef FASTEST
-local block_state deflate_slow   OF((deflate_state *s, int flush));
-#endif
-local block_state deflate_rle    OF((deflate_state *s, int flush));
-local block_state deflate_huff   OF((deflate_state *s, int flush));
-local void lm_init        OF((deflate_state *s));
-local void putShortMSB    OF((deflate_state *s, uInt b));
-local void flush_pending  OF((z_streamp strm));
-local unsigned read_buf   OF((z_streamp strm, Bytef *buf, unsigned size));
-local uInt longest_match  OF((deflate_state *s, IPos cur_match));
-
-#ifdef ZLIB_DEBUG
-local  void check_match OF((deflate_state *s, IPos start, IPos match,
-                            int length));
+local block_state deflate_slow(deflate_state *s, int flush);
 #endif
+local block_state deflate_rle(deflate_state *s, int flush);
+local block_state deflate_huff(deflate_state *s, int flush);
 
 /* From crc32.c */
 extern void ZLIB_INTERNAL crc_reset(deflate_state *const s);
@@ -184,9 +168,7 @@ local const config configuration_table[10] = {
  * bit values at the expense of memory usage). We slide even when level == 0 to
  * keep the hash table consistent if we switch back to level > 0 later.
  */
-local void slide_hash(s)
-    deflate_state *s;
-{
+local void slide_hash(deflate_state *s) {
 #if defined(DEFLATE_SLIDE_HASH_SSE2) || defined(DEFLATE_SLIDE_HASH_NEON)
     slide_hash_simd(s->head, s->prev, s->w_size, s->hash_size);
     return;
@@ -215,30 +197,195 @@ local void slide_hash(s)
 #endif
 }
 
+/* ===========================================================================
+ * Read a new buffer from the current input stream, update the adler32
+ * and total number of bytes read.  All deflate() input goes through
+ * this function so some applications may wish to modify it to avoid
+ * allocating a large strm->next_in buffer and copying from it.
+ * (See also flush_pending()).
+ */
+local unsigned read_buf(z_streamp strm, Bytef *buf, unsigned size) {
+    unsigned len = strm->avail_in;
+
+    if (len > size) len = size;
+    if (len == 0) return 0;
+
+    strm->avail_in  -= len;
+
+    /* TODO(cavalcantii): verify if we can remove 'copy_with_crc', it is legacy
+     * of the Intel optimizations dating back to 2015.
+     */
+#ifdef GZIP
+    if (strm->state->wrap == 2)
+        copy_with_crc(strm, buf, len);
+    else
+#endif
+    {
+        zmemcpy(buf, strm->next_in, len);
+        if (strm->state->wrap == 1)
+            strm->adler = adler32(strm->adler, buf, len);
+    }
+    strm->next_in  += len;
+    strm->total_in += len;
+
+    return len;
+}
+
+/* ===========================================================================
+ * Fill the window when the lookahead becomes insufficient.
+ * Updates strstart and lookahead.
+ *
+ * IN assertion: lookahead < MIN_LOOKAHEAD
+ * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
+ *    At least one byte has been read, or avail_in == 0; reads are
+ *    performed for at least two bytes (required for the zip translate_eol
+ *    option -- not supported here).
+ */
+local void fill_window(deflate_state *s) {
+    unsigned n;
+    unsigned more;    /* Amount of free space at the end of the window. */
+    uInt wsize = s->w_size;
+
+    Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");
+
+    do {
+        more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
+
+        /* Deal with !@#$% 64K limit: */
+        if (sizeof(int) <= 2) {
+            if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
+                more = wsize;
+
+            } else if (more == (unsigned)(-1)) {
+                /* Very unlikely, but possible on 16 bit machine if
+                 * strstart == 0 && lookahead == 1 (input done a byte at time)
+                 */
+                more--;
+            }
+        }
+
+        /* If the window is almost full and there is insufficient lookahead,
+         * move the upper half to the lower one to make room in the upper half.
+         */
+        if (s->strstart >= wsize + MAX_DIST(s)) {
+
+            zmemcpy(s->window, s->window + wsize, (unsigned)wsize - more);
+            s->match_start -= wsize;
+            s->strstart    -= wsize; /* we now have strstart >= MAX_DIST */
+            s->block_start -= (long) wsize;
+            if (s->insert > s->strstart)
+                s->insert = s->strstart;
+            slide_hash(s);
+            more += wsize;
+        }
+        if (s->strm->avail_in == 0) break;
+
+        /* If there was no sliding:
+         *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
+         *    more == window_size - lookahead - strstart
+         * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
+         * => more >= window_size - 2*WSIZE + 2
+         * In the BIG_MEM or MMAP case (not yet supported),
+         *   window_size == input_size + MIN_LOOKAHEAD  &&
+         *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
+         * Otherwise, window_size == 2*WSIZE so more >= 2.
+         * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
+         */
+        Assert(more >= 2, "more < 2");
+
+        n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
+        s->lookahead += n;
+
+        /* Initialize the hash value now that we have some input: */
+        if (s->chromium_zlib_hash) {
+            /* chromium hash reads 4 bytes */
+            if (s->lookahead + s->insert > MIN_MATCH) {
+                uInt str = s->strstart - s->insert;
+                while (s->insert) {
+                    insert_string(s, str);
+                    str++;
+                    s->insert--;
+                    if (s->lookahead + s->insert <= MIN_MATCH)
+                        break;
+                }
+            }
+        } else
+        /* Initialize the hash value now that we have some input: */
+        if (s->lookahead + s->insert >= MIN_MATCH) {
+            uInt str = s->strstart - s->insert;
+            s->ins_h = s->window[str];
+            UPDATE_HASH(s, s->ins_h, s->window[str + 1]);
+#if MIN_MATCH != 3
+            Call UPDATE_HASH() MIN_MATCH-3 more times
+#endif
+            while (s->insert) {
+                UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
+#ifndef FASTEST
+                s->prev[str & s->w_mask] = s->head[s->ins_h];
+#endif
+                s->head[s->ins_h] = (Pos)str;
+                str++;
+                s->insert--;
+                if (s->lookahead + s->insert < MIN_MATCH)
+                    break;
+            }
+        }
+        /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
+         * but this is not important since only literal bytes will be emitted.
+         */
+
+    } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
+
+    /* If the WIN_INIT bytes after the end of the current data have never been
+     * written, then zero those bytes in order to avoid memory check reports of
+     * the use of uninitialized (or uninitialised as Julian writes) bytes by
+     * the longest match routines.  Update the high water mark for the next
+     * time through here.  WIN_INIT is set to MAX_MATCH since the longest match
+     * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
+     */
+    if (s->high_water < s->window_size) {
+        ulg curr = s->strstart + (ulg)(s->lookahead);
+        ulg init;
+
+        if (s->high_water < curr) {
+            /* Previous high water mark below current data -- zero WIN_INIT
+             * bytes or up to end of window, whichever is less.
+             */
+            init = s->window_size - curr;
+            if (init > WIN_INIT)
+                init = WIN_INIT;
+            zmemzero(s->window + curr, (unsigned)init);
+            s->high_water = curr + init;
+        }
+        else if (s->high_water < (ulg)curr + WIN_INIT) {
+            /* High water mark at or above current data, but below current data
+             * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
+             * to end of window, whichever is less.
+             */
+            init = (ulg)curr + WIN_INIT - s->high_water;
+            if (init > s->window_size - s->high_water)
+                init = s->window_size - s->high_water;
+            zmemzero(s->window + s->high_water, (unsigned)init);
+            s->high_water += init;
+        }
+    }
+
+    Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
+           "not enough room for search");
+}
+
 /* ========================================================================= */
-int ZEXPORT deflateInit_(strm, level, version, stream_size)
-    z_streamp strm;
-    int level;
-    const char *version;
-    int stream_size;
-{
+int ZEXPORT deflateInit_(z_streamp strm, int level, const char *version,
+                         int stream_size) {
     return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL,
                          Z_DEFAULT_STRATEGY, version, stream_size);
     /* To do: ignore strm->next_in if we use it as window */
 }
 
 /* ========================================================================= */
-int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,
-                  version, stream_size)
-    z_streamp strm;
-    int  level;
-    int  method;
-    int  windowBits;
-    int  memLevel;
-    int  strategy;
-    const char *version;
-    int stream_size;
-{
+int ZEXPORT deflateInit2_(z_streamp strm, int level, int method,
+                          int windowBits, int memLevel, int strategy,
+                          const char *version, int stream_size) {
     unsigned window_padding = 8;
     deflate_state *s;
     int wrap = 1;
@@ -412,9 +559,7 @@ int ZEXPORT deflateInit2_(strm, level, method, windowBits, memLevel, strategy,
 /* =========================================================================
  * Check for a valid deflate stream state. Return 0 if ok, 1 if not.
  */
-local int deflateStateCheck(strm)
-    z_streamp strm;
-{
+local int deflateStateCheck(z_streamp strm) {
     deflate_state *s;
     if (strm == Z_NULL ||
         strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0)
@@ -435,11 +580,8 @@ local int deflateStateCheck(strm)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflateSetDictionary(strm, dictionary, dictLength)
-    z_streamp strm;
-    const Bytef *dictionary;
-    uInt  dictLength;
-{
+int ZEXPORT deflateSetDictionary(z_streamp strm, const Bytef *dictionary,
+                                 uInt  dictLength) {
     deflate_state *s;
     uInt str, n;
     int wrap;
@@ -500,11 +642,8 @@ int ZEXPORT deflateSetDictionary(strm, dictionary, dictLength)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflateGetDictionary(strm, dictionary, dictLength)
-    z_streamp strm;
-    Bytef *dictionary;
-    uInt  *dictLength;
-{
+int ZEXPORT deflateGetDictionary(z_streamp strm, Bytef *dictionary,
+                                 uInt *dictLength) {
     deflate_state *s;
     uInt len;
 
@@ -522,9 +661,7 @@ int ZEXPORT deflateGetDictionary(strm, dictionary, dictLength)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflateResetKeep(strm)
-    z_streamp strm;
-{
+int ZEXPORT deflateResetKeep(z_streamp strm) {
     deflate_state *s;
 
     if (deflateStateCheck(strm)) {
@@ -559,10 +696,32 @@ int ZEXPORT deflateResetKeep(strm)
     return Z_OK;
 }
 
+/* ===========================================================================
+ * Initialize the "longest match" routines for a new zlib stream
+ */
+local void lm_init(deflate_state *s) {
+    s->window_size = (ulg)2L*s->w_size;
+
+    CLEAR_HASH(s);
+
+    /* Set the default configuration parameters:
+     */
+    s->max_lazy_match   = configuration_table[s->level].max_lazy;
+    s->good_match       = configuration_table[s->level].good_length;
+    s->nice_match       = configuration_table[s->level].nice_length;
+    s->max_chain_length = configuration_table[s->level].max_chain;
+
+    s->strstart = 0;
+    s->block_start = 0L;
+    s->lookahead = 0;
+    s->insert = 0;
+    s->match_length = s->prev_length = MIN_MATCH-1;
+    s->match_available = 0;
+    s->ins_h = 0;
+}
+
 /* ========================================================================= */
-int ZEXPORT deflateReset(strm)
-    z_streamp strm;
-{
+int ZEXPORT deflateReset(z_streamp strm) {
     int ret;
 
     ret = deflateResetKeep(strm);
@@ -572,10 +731,7 @@ int ZEXPORT deflateReset(strm)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflateSetHeader(strm, head)
-    z_streamp strm;
-    gz_headerp head;
-{
+int ZEXPORT deflateSetHeader(z_streamp strm, gz_headerp head) {
     if (deflateStateCheck(strm) || strm->state->wrap != 2)
         return Z_STREAM_ERROR;
     strm->state->gzhead = head;
@@ -583,11 +739,7 @@ int ZEXPORT deflateSetHeader(strm, head)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflatePending(strm, pending, bits)
-    unsigned *pending;
-    int *bits;
-    z_streamp strm;
-{
+int ZEXPORT deflatePending(z_streamp strm, unsigned *pending, int *bits) {
     if (deflateStateCheck(strm)) return Z_STREAM_ERROR;
     if (pending != Z_NULL)
         *pending = strm->state->pending;
@@ -597,11 +749,7 @@ int ZEXPORT deflatePending(strm, pending, bits)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflatePrime(strm, bits, value)
-    z_streamp strm;
-    int bits;
-    int value;
-{
+int ZEXPORT deflatePrime(z_streamp strm, int bits, int value) {
     deflate_state *s;
     int put;
 
@@ -624,11 +772,7 @@ int ZEXPORT deflatePrime(strm, bits, value)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflateParams(strm, level, strategy)
-    z_streamp strm;
-    int level;
-    int strategy;
-{
+int ZEXPORT deflateParams(z_streamp strm, int level, int strategy) {
     deflate_state *s;
     compress_func func;
 
@@ -673,13 +817,8 @@ int ZEXPORT deflateParams(strm, level, strategy)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)
-    z_streamp strm;
-    int good_length;
-    int max_lazy;
-    int nice_length;
-    int max_chain;
-{
+int ZEXPORT deflateTune(z_streamp strm, int good_length, int max_lazy,
+                        int nice_length, int max_chain) {
     deflate_state *s;
 
     if (deflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -715,10 +854,7 @@ int ZEXPORT deflateTune(strm, good_length, max_lazy, nice_length, max_chain)
  *
  * Shifts are used to approximate divisions, for speed.
  */
-uLong ZEXPORT deflateBound(strm, sourceLen)
-    z_streamp strm;
-    uLong sourceLen;
-{
+uLong ZEXPORT deflateBound(z_streamp strm, uLong sourceLen) {
     deflate_state *s;
     uLong fixedlen, storelen, wraplen;
 
@@ -774,7 +910,8 @@ uLong ZEXPORT deflateBound(strm, sourceLen)
 
     /* if not default parameters, return one of the conservative bounds */
     if (s->w_bits != 15 || s->hash_bits != 8 + 7)
-        return (s->w_bits <= s->hash_bits ? fixedlen : storelen) + wraplen;
+        return (s->w_bits <= s->hash_bits && s->level ? fixedlen : storelen) +
+               wraplen;
 
     /* default settings: return tight bound for that case -- ~0.03% overhead
        plus a small constant */
@@ -787,10 +924,7 @@ uLong ZEXPORT deflateBound(strm, sourceLen)
  * IN assertion: the stream state is correct and there is enough room in
  * pending_buf.
  */
-local void putShortMSB(s, b)
-    deflate_state *s;
-    uInt b;
-{
+local void putShortMSB(deflate_state *s, uInt b) {
     put_byte(s, (Byte)(b >> 8));
     put_byte(s, (Byte)(b & 0xff));
 }
@@ -801,9 +935,7 @@ local void putShortMSB(s, b)
  * applications may wish to modify it to avoid allocating a large
  * strm->next_out buffer and copying into it. (See also read_buf()).
  */
-local void flush_pending(strm)
-    z_streamp strm;
-{
+local void flush_pending(z_streamp strm) {
     unsigned len;
     deflate_state *s = strm->state;
 
@@ -834,10 +966,7 @@ local void flush_pending(strm)
     } while (0)
 
 /* ========================================================================= */
-int ZEXPORT deflate(strm, flush)
-    z_streamp strm;
-    int flush;
-{
+int ZEXPORT deflate(z_streamp strm, int flush) {
     int old_flush; /* value of flush param for previous deflate call */
     deflate_state *s;
 
@@ -1150,9 +1279,7 @@ int ZEXPORT deflate(strm, flush)
 }
 
 /* ========================================================================= */
-int ZEXPORT deflateEnd(strm)
-    z_streamp strm;
-{
+int ZEXPORT deflateEnd(z_streamp strm) {
     int status;
 
     if (deflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -1176,11 +1303,10 @@ int ZEXPORT deflateEnd(strm)
  * To simplify the source, this is not supported for 16-bit MSDOS (which
  * doesn't have enough memory anyway to duplicate compression states).
  */
-int ZEXPORT deflateCopy(dest, source)
-    z_streamp dest;
-    z_streamp source;
-{
+int ZEXPORT deflateCopy(z_streamp dest, z_streamp source) {
 #ifdef MAXSEG_64K
+    (void)dest;
+    (void)source;
     return Z_STREAM_ERROR;
 #else
     deflate_state *ds;
@@ -1228,67 +1354,6 @@ int ZEXPORT deflateCopy(dest, source)
 #endif /* MAXSEG_64K */
 }
 
-/* ===========================================================================
- * Read a new buffer from the current input stream, update the adler32
- * and total number of bytes read.  All deflate() input goes through
- * this function so some applications may wish to modify it to avoid
- * allocating a large strm->next_in buffer and copying from it.
- * (See also flush_pending()).
- */
-local unsigned read_buf(strm, buf, size)
-    z_streamp strm;
-    Bytef *buf;
-    unsigned size;
-{
-    unsigned len = strm->avail_in;
-
-    if (len > size) len = size;
-    if (len == 0) return 0;
-
-    strm->avail_in  -= len;
-
-#ifdef GZIP
-    if (strm->state->wrap == 2)
-        copy_with_crc(strm, buf, len);
-    else
-#endif
-    {
-        zmemcpy(buf, strm->next_in, len);
-        if (strm->state->wrap == 1)
-            strm->adler = adler32(strm->adler, buf, len);
-    }
-    strm->next_in  += len;
-    strm->total_in += len;
-
-    return len;
-}
-
-/* ===========================================================================
- * Initialize the "longest match" routines for a new zlib stream
- */
-local void lm_init(s)
-    deflate_state *s;
-{
-    s->window_size = (ulg)2L*s->w_size;
-
-    CLEAR_HASH(s);
-
-    /* Set the default configuration parameters:
-     */
-    s->max_lazy_match   = configuration_table[s->level].max_lazy;
-    s->good_match       = configuration_table[s->level].good_length;
-    s->nice_match       = configuration_table[s->level].nice_length;
-    s->max_chain_length = configuration_table[s->level].max_chain;
-
-    s->strstart = 0;
-    s->block_start = 0L;
-    s->lookahead = 0;
-    s->insert = 0;
-    s->match_length = s->prev_length = MIN_MATCH-1;
-    s->match_available = 0;
-    s->ins_h = 0;
-}
-
 #ifndef FASTEST
 /* ===========================================================================
  * Set match_start to the longest match starting at the given string and
@@ -1299,10 +1364,7 @@ local void lm_init(s)
  *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
  * OUT assertion: the match length is not greater than s->lookahead.
  */
-local uInt longest_match(s, cur_match)
-    deflate_state *s;
-    IPos cur_match;                             /* current match */
-{
+local uInt longest_match(deflate_state *s, IPos cur_match) {
     unsigned chain_length = s->max_chain_length;/* max hash chain length */
     register Bytef *scan = s->window + s->strstart; /* current string */
     register Bytef *match;                      /* matched string */
@@ -1468,10 +1530,7 @@ local uInt longest_match(s, cur_match)
 /* ---------------------------------------------------------------------------
  * Optimized version for FASTEST only
  */
-local uInt longest_match(s, cur_match)
-    deflate_state *s;
-    IPos cur_match;                             /* current match */
-{
+local uInt longest_match(deflate_state *s, IPos cur_match) {
     register Bytef *scan = s->window + s->strstart; /* current string */
     register Bytef *match;                       /* matched string */
     register int len;                           /* length of current match */
@@ -1532,11 +1591,7 @@ local uInt longest_match(s, cur_match)
 /* ===========================================================================
  * Check that the match at match_start is indeed a match.
  */
-local void check_match(s, start, match, length)
-    deflate_state *s;
-    IPos start, match;
-    int length;
-{
+local void check_match(deflate_state *s, IPos start, IPos match, int length) {
     /* check that the match is indeed a match */
     if (zmemcmp(s->window + match,
                 s->window + start, length) != EQUAL) {
@@ -1556,151 +1611,6 @@ local void check_match(s, start, match, length)
 #  define check_match(s, start, match, length)
 #endif /* ZLIB_DEBUG */
 
-/* ===========================================================================
- * Fill the window when the lookahead becomes insufficient.
- * Updates strstart and lookahead.
- *
- * IN assertion: lookahead < MIN_LOOKAHEAD
- * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
- *    At least one byte has been read, or avail_in == 0; reads are
- *    performed for at least two bytes (required for the zip translate_eol
- *    option -- not supported here).
- */
-local void fill_window(s)
-    deflate_state *s;
-{
-    unsigned n;
-    unsigned more;    /* Amount of free space at the end of the window. */
-    uInt wsize = s->w_size;
-
-    Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead");
-
-    do {
-        more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
-
-        /* Deal with !@#$% 64K limit: */
-        if (sizeof(int) <= 2) {
-            if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
-                more = wsize;
-
-            } else if (more == (unsigned)(-1)) {
-                /* Very unlikely, but possible on 16 bit machine if
-                 * strstart == 0 && lookahead == 1 (input done a byte at time)
-                 */
-                more--;
-            }
-        }
-
-        /* If the window is almost full and there is insufficient lookahead,
-         * move the upper half to the lower one to make room in the upper half.
-         */
-        if (s->strstart >= wsize + MAX_DIST(s)) {
-
-            zmemcpy(s->window, s->window + wsize, (unsigned)wsize - more);
-            s->match_start -= wsize;
-            s->strstart    -= wsize; /* we now have strstart >= MAX_DIST */
-            s->block_start -= (long) wsize;
-            if (s->insert > s->strstart)
-                s->insert = s->strstart;
-            slide_hash(s);
-            more += wsize;
-        }
-        if (s->strm->avail_in == 0) break;
-
-        /* If there was no sliding:
-         *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
-         *    more == window_size - lookahead - strstart
-         * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
-         * => more >= window_size - 2*WSIZE + 2
-         * In the BIG_MEM or MMAP case (not yet supported),
-         *   window_size == input_size + MIN_LOOKAHEAD  &&
-         *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
-         * Otherwise, window_size == 2*WSIZE so more >= 2.
-         * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
-         */
-        Assert(more >= 2, "more < 2");
-
-        n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
-        s->lookahead += n;
-
-        /* Initialize the hash value now that we have some input: */
-        if (s->chromium_zlib_hash) {
-            /* chromium hash reads 4 bytes */
-            if (s->lookahead + s->insert > MIN_MATCH) {
-                uInt str = s->strstart - s->insert;
-                while (s->insert) {
-                    insert_string(s, str);
-                    str++;
-                    s->insert--;
-                    if (s->lookahead + s->insert <= MIN_MATCH)
-                        break;
-                }
-            }
-        } else
-        /* Initialize the hash value now that we have some input: */
-        if (s->lookahead + s->insert >= MIN_MATCH) {
-            uInt str = s->strstart - s->insert;
-            s->ins_h = s->window[str];
-            UPDATE_HASH(s, s->ins_h, s->window[str + 1]);
-#if MIN_MATCH != 3
-            Call UPDATE_HASH() MIN_MATCH-3 more times
-#endif
-            while (s->insert) {
-                UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]);
-#ifndef FASTEST
-                s->prev[str & s->w_mask] = s->head[s->ins_h];
-#endif
-                s->head[s->ins_h] = (Pos)str;
-                str++;
-                s->insert--;
-                if (s->lookahead + s->insert < MIN_MATCH)
-                    break;
-            }
-        }
-        /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
-         * but this is not important since only literal bytes will be emitted.
-         */
-
-    } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
-
-    /* If the WIN_INIT bytes after the end of the current data have never been
-     * written, then zero those bytes in order to avoid memory check reports of
-     * the use of uninitialized (or uninitialised as Julian writes) bytes by
-     * the longest match routines.  Update the high water mark for the next
-     * time through here.  WIN_INIT is set to MAX_MATCH since the longest match
-     * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.
-     */
-    if (s->high_water < s->window_size) {
-        ulg curr = s->strstart + (ulg)(s->lookahead);
-        ulg init;
-
-        if (s->high_water < curr) {
-            /* Previous high water mark below current data -- zero WIN_INIT
-             * bytes or up to end of window, whichever is less.
-             */
-            init = s->window_size - curr;
-            if (init > WIN_INIT)
-                init = WIN_INIT;
-            zmemzero(s->window + curr, (unsigned)init);
-            s->high_water = curr + init;
-        }
-        else if (s->high_water < (ulg)curr + WIN_INIT) {
-            /* High water mark at or above current data, but below current data
-             * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up
-             * to end of window, whichever is less.
-             */
-            init = (ulg)curr + WIN_INIT - s->high_water;
-            if (init > s->window_size - s->high_water)
-                init = s->window_size - s->high_water;
-            zmemzero(s->window + s->high_water, (unsigned)init);
-            s->high_water += init;
-        }
-    }
-
-    Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,
-           "not enough room for search");
-}
-
 /* ===========================================================================
  * Flush the current block, with given end-of-file flag.
  * IN assertion: strstart is set to the end of the current match.
@@ -1743,10 +1653,7 @@ local void fill_window(s)
  * copied. It is most efficient with large input and output buffers, which
  * maximizes the opportunities to have a single copy from next_in to next_out.
  */
-local block_state deflate_stored(s, flush)
-    deflate_state *s;
-    int flush;
-{
+local block_state deflate_stored(deflate_state *s, int flush) {
     /* Smallest worthy block size when not flushing or finishing. By default
      * this is 32K. This can be as small as 507 bytes for memLevel == 1. For
      * large input and output buffers, the stored block size will be larger.
@@ -1930,10 +1837,7 @@ local block_state deflate_stored(s, flush)
  * new strings in the dictionary only for unmatched strings or for short
  * matches. It is used only for the fast compression options.
  */
-local block_state deflate_fast(s, flush)
-    deflate_state *s;
-    int flush;
-{
+local block_state deflate_fast(deflate_state *s, int flush) {
     IPos hash_head;       /* head of the hash chain */
     int bflush;           /* set if current block must be flushed */
 
@@ -2035,10 +1939,7 @@ local block_state deflate_fast(s, flush)
  * evaluation for matches: a match is finally adopted only if there is
  * no better match at the next window position.
  */
-local block_state deflate_slow(s, flush)
-    deflate_state *s;
-    int flush;
-{
+local block_state deflate_slow(deflate_state *s, int flush) {
     IPos hash_head;          /* head of hash chain */
     int bflush;              /* set if current block must be flushed */
 
@@ -2172,10 +2073,7 @@ local block_state deflate_slow(s, flush)
  * one.  Do not maintain a hash table.  (It will be regenerated if this run of
  * deflate switches away from Z_RLE.)
  */
-local block_state deflate_rle(s, flush)
-    deflate_state *s;
-    int flush;
-{
+local block_state deflate_rle(deflate_state *s, int flush) {
     int bflush;             /* set if current block must be flushed */
     uInt prev;              /* byte at distance one to match */
     Bytef *scan, *strend;   /* scan goes up to strend for length of run */
@@ -2246,10 +2144,7 @@ local block_state deflate_rle(s, flush)
  * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.
  * (It will be regenerated if this run of deflate switches away from Huffman.)
  */
-local block_state deflate_huff(s, flush)
-    deflate_state *s;
-    int flush;
-{
+local block_state deflate_huff(deflate_state *s, int flush) {
     int bflush;             /* set if current block must be flushed */
 
     for (;;) {
diff --git a/deps/v8/third_party/zlib/deflate.h b/deps/v8/third_party/zlib/deflate.h
index ad3cef7e45da4f..f164191106922d 100644
--- a/deps/v8/third_party/zlib/deflate.h
+++ b/deps/v8/third_party/zlib/deflate.h
@@ -296,14 +296,14 @@ typedef struct internal_state {
    memory checker errors from longest match routines */
 
         /* in trees.c */
-void ZLIB_INTERNAL _tr_init OF((deflate_state *s));
-int ZLIB_INTERNAL _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
-void ZLIB_INTERNAL _tr_flush_block OF((deflate_state *s, charf *buf,
-                        ulg stored_len, int last));
-void ZLIB_INTERNAL _tr_flush_bits OF((deflate_state *s));
-void ZLIB_INTERNAL _tr_align OF((deflate_state *s));
-void ZLIB_INTERNAL _tr_stored_block OF((deflate_state *s, charf *buf,
-                        ulg stored_len, int last));
+void ZLIB_INTERNAL _tr_init(deflate_state *s);
+int ZLIB_INTERNAL _tr_tally(deflate_state *s, unsigned dist, unsigned lc);
+void ZLIB_INTERNAL _tr_flush_block(deflate_state *s, charf *buf,
+                                   ulg stored_len, int last);
+void ZLIB_INTERNAL _tr_flush_bits(deflate_state *s);
+void ZLIB_INTERNAL _tr_align(deflate_state *s);
+void ZLIB_INTERNAL _tr_stored_block(deflate_state *s, charf *buf,
+                                    ulg stored_len, int last);
 
 #define d_code(dist) \
    ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
diff --git a/deps/v8/third_party/zlib/google/BUILD.gn b/deps/v8/third_party/zlib/google/BUILD.gn
index 990b0232306bdb..122cef573d5bd5 100644
--- a/deps/v8/third_party/zlib/google/BUILD.gn
+++ b/deps/v8/third_party/zlib/google/BUILD.gn
@@ -4,6 +4,10 @@
 
 import("//build_overrides/build.gni")
 
+if (build_with_chromium && is_ios) {
+  import("//build/config/ios/bundle_data_from_filelist.gni")
+}
+
 if (build_with_chromium) {
   static_library("zip") {
     sources = [
@@ -35,6 +39,13 @@ if (build_with_chromium) {
     ]
     public_deps = [ ":compression_utils_portable" ]
   }
+
+  if (is_ios) {
+    bundle_data_from_filelist("zlib_pak_bundle_data") {
+      testonly = true
+      filelist_name = "test_data.filelist"
+    }
+  }
 }
 
 # This allows other users of Chromium's zlib library, but don't use Chromium's
diff --git a/deps/v8/third_party/zlib/google/test_data.filelist b/deps/v8/third_party/zlib/google/test_data.filelist
new file mode 100644
index 00000000000000..0a9d20bcea605a
--- /dev/null
+++ b/deps/v8/third_party/zlib/google/test_data.filelist
@@ -0,0 +1,32 @@
+# Copyright 2023 The Chromium Authors
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+# NOTE: this file is generated by build/ios/update_bundle_filelist.py
+#       If it requires updating, you should get a presubmit error with
+#       instructions on how to regenerate. Otherwise, do not edit.
+test/data/Different Encryptions.zip
+test/data/Empty Dir Same Name As File.zip
+test/data/Mixed Paths.zip
+test/data/Parent Dir Same Name As File.zip
+test/data/README.md
+test/data/Repeated Dir Name.zip
+test/data/Repeated File Name With Different Cases.zip
+test/data/Repeated File Name.zip
+test/data/SJIS Bug 846195.zip
+test/data/Windows Special Names.zip
+test/data/Wrong CRC.zip
+test/data/create_test_zip.sh
+test/data/empty.zip
+test/data/evil.zip
+test/data/evil_via_absolute_file_name.zip
+test/data/evil_via_invalid_utf8.zip
+test/data/test.zip
+test/data/test/foo.txt
+test/data/test/foo/bar.txt
+test/data/test/foo/bar/.hidden
+test/data/test/foo/bar/baz.txt
+test/data/test/foo/bar/quux.txt
+test/data/test_encrypted.zip
+test/data/test_mismatch_size.zip
+test/data/test_nocompress.zip
+test/data/test_posix_permissions.zip
diff --git a/deps/v8/third_party/zlib/google/test_data.globlist b/deps/v8/third_party/zlib/google/test_data.globlist
new file mode 100644
index 00000000000000..117a1e507df406
--- /dev/null
+++ b/deps/v8/third_party/zlib/google/test_data.globlist
@@ -0,0 +1,8 @@
+# Copyright 2023 The Chromium Authors
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+#
+# See build/ios/update_bundle_filelist.py for details on how .globlist
+# files are used to update their .filelist counterparts.
+test/data/**
+test/data/test/foo/bar/.hidden
\ No newline at end of file
diff --git a/deps/v8/third_party/zlib/google/zip_internal.cc b/deps/v8/third_party/zlib/google/zip_internal.cc
index e65d7ce6b5f464..9b20b421e24765 100644
--- a/deps/v8/third_party/zlib/google/zip_internal.cc
+++ b/deps/v8/third_party/zlib/google/zip_internal.cc
@@ -8,12 +8,12 @@
 #include <string.h>
 
 #include <algorithm>
-#include <unordered_set>
 
+#include "base/containers/fixed_flat_set.h"
 #include "base/files/file_path.h"
 #include "base/logging.h"
-#include "base/no_destructor.h"
 #include "base/notreached.h"
+#include "base/strings/string_piece.h"
 #include "base/strings/string_util.h"
 #include "base/strings/utf_string_conversions.h"
 
@@ -407,60 +407,59 @@ Compression GetCompressionMethod(const base::FilePath& path) {
 
   // Well known filename extensions of files that a likely to be already
   // compressed. The extensions are in lower case without the leading dot.
-  static const base::NoDestructor<
-      std::unordered_set<StringPiece, base::StringPieceHashImpl<StringPiece>>>
-      exts(std::initializer_list<StringPiece>{
-          FILE_PATH_LITERAL("3g2"),   //
-          FILE_PATH_LITERAL("3gp"),   //
-          FILE_PATH_LITERAL("7z"),    //
-          FILE_PATH_LITERAL("7zip"),  //
-          FILE_PATH_LITERAL("aac"),   //
-          FILE_PATH_LITERAL("avi"),   //
-          FILE_PATH_LITERAL("bz"),    //
-          FILE_PATH_LITERAL("bz2"),   //
-          FILE_PATH_LITERAL("crx"),   //
-          FILE_PATH_LITERAL("gif"),   //
-          FILE_PATH_LITERAL("gz"),    //
-          FILE_PATH_LITERAL("jar"),   //
-          FILE_PATH_LITERAL("jpeg"),  //
-          FILE_PATH_LITERAL("jpg"),   //
-          FILE_PATH_LITERAL("lz"),    //
-          FILE_PATH_LITERAL("m2v"),   //
-          FILE_PATH_LITERAL("m4p"),   //
-          FILE_PATH_LITERAL("m4v"),   //
-          FILE_PATH_LITERAL("mng"),   //
-          FILE_PATH_LITERAL("mov"),   //
-          FILE_PATH_LITERAL("mp2"),   //
-          FILE_PATH_LITERAL("mp3"),   //
-          FILE_PATH_LITERAL("mp4"),   //
-          FILE_PATH_LITERAL("mpe"),   //
-          FILE_PATH_LITERAL("mpeg"),  //
-          FILE_PATH_LITERAL("mpg"),   //
-          FILE_PATH_LITERAL("mpv"),   //
-          FILE_PATH_LITERAL("ogg"),   //
-          FILE_PATH_LITERAL("ogv"),   //
-          FILE_PATH_LITERAL("png"),   //
-          FILE_PATH_LITERAL("qt"),    //
-          FILE_PATH_LITERAL("rar"),   //
-          FILE_PATH_LITERAL("taz"),   //
-          FILE_PATH_LITERAL("tb2"),   //
-          FILE_PATH_LITERAL("tbz"),   //
-          FILE_PATH_LITERAL("tbz2"),  //
-          FILE_PATH_LITERAL("tgz"),   //
-          FILE_PATH_LITERAL("tlz"),   //
-          FILE_PATH_LITERAL("tz"),    //
-          FILE_PATH_LITERAL("tz2"),   //
-          FILE_PATH_LITERAL("vob"),   //
-          FILE_PATH_LITERAL("webm"),  //
-          FILE_PATH_LITERAL("wma"),   //
-          FILE_PATH_LITERAL("wmv"),   //
-          FILE_PATH_LITERAL("xz"),    //
-          FILE_PATH_LITERAL("z"),     //
-          FILE_PATH_LITERAL("zip"),   //
-      });
-
-  if (exts->count(ext_without_dot))
+  static constexpr auto kExts = base::MakeFixedFlatSet<StringPiece>({
+      FILE_PATH_LITERAL("3g2"),   //
+      FILE_PATH_LITERAL("3gp"),   //
+      FILE_PATH_LITERAL("7z"),    //
+      FILE_PATH_LITERAL("7zip"),  //
+      FILE_PATH_LITERAL("aac"),   //
+      FILE_PATH_LITERAL("avi"),   //
+      FILE_PATH_LITERAL("bz"),    //
+      FILE_PATH_LITERAL("bz2"),   //
+      FILE_PATH_LITERAL("crx"),   //
+      FILE_PATH_LITERAL("gif"),   //
+      FILE_PATH_LITERAL("gz"),    //
+      FILE_PATH_LITERAL("jar"),   //
+      FILE_PATH_LITERAL("jpeg"),  //
+      FILE_PATH_LITERAL("jpg"),   //
+      FILE_PATH_LITERAL("lz"),    //
+      FILE_PATH_LITERAL("m2v"),   //
+      FILE_PATH_LITERAL("m4p"),   //
+      FILE_PATH_LITERAL("m4v"),   //
+      FILE_PATH_LITERAL("mng"),   //
+      FILE_PATH_LITERAL("mov"),   //
+      FILE_PATH_LITERAL("mp2"),   //
+      FILE_PATH_LITERAL("mp3"),   //
+      FILE_PATH_LITERAL("mp4"),   //
+      FILE_PATH_LITERAL("mpe"),   //
+      FILE_PATH_LITERAL("mpeg"),  //
+      FILE_PATH_LITERAL("mpg"),   //
+      FILE_PATH_LITERAL("mpv"),   //
+      FILE_PATH_LITERAL("ogg"),   //
+      FILE_PATH_LITERAL("ogv"),   //
+      FILE_PATH_LITERAL("png"),   //
+      FILE_PATH_LITERAL("qt"),    //
+      FILE_PATH_LITERAL("rar"),   //
+      FILE_PATH_LITERAL("taz"),   //
+      FILE_PATH_LITERAL("tb2"),   //
+      FILE_PATH_LITERAL("tbz"),   //
+      FILE_PATH_LITERAL("tbz2"),  //
+      FILE_PATH_LITERAL("tgz"),   //
+      FILE_PATH_LITERAL("tlz"),   //
+      FILE_PATH_LITERAL("tz"),    //
+      FILE_PATH_LITERAL("tz2"),   //
+      FILE_PATH_LITERAL("vob"),   //
+      FILE_PATH_LITERAL("webm"),  //
+      FILE_PATH_LITERAL("wma"),   //
+      FILE_PATH_LITERAL("wmv"),   //
+      FILE_PATH_LITERAL("xz"),    //
+      FILE_PATH_LITERAL("z"),     //
+      FILE_PATH_LITERAL("zip"),   //
+  });
+
+  if (kExts.count(ext_without_dot)) {
     return kStored;
+  }
 
   return kDeflated;
 }
diff --git a/deps/v8/third_party/zlib/google/zip_unittest.cc b/deps/v8/third_party/zlib/google/zip_unittest.cc
index 24ed147729f720..d0fc02fd939a15 100644
--- a/deps/v8/third_party/zlib/google/zip_unittest.cc
+++ b/deps/v8/third_party/zlib/google/zip_unittest.cc
@@ -611,7 +611,7 @@ TEST_F(ZipTest, UnzipWindowsSpecialNames) {
       "NUL .txt",
       "NUL  .txt",
       "NUL  ..txt",
-#ifndef OS_MAC
+#ifndef OS_APPLE
       "Nul.txt",
 #endif
       "nul.very long extension",
@@ -669,7 +669,7 @@ TEST_F(ZipTest, UnzipWindowsSpecialNames) {
 }
 
 TEST_F(ZipTest, UnzipDifferentCases) {
-#if defined(OS_WIN) || defined(OS_MAC)
+#if defined(OS_WIN) || defined(OS_APPLE)
   // Only the first file (with mixed case) is extracted.
   EXPECT_FALSE(zip::Unzip(GetDataDirectory().AppendASCII(
                               "Repeated File Name With Different Cases.zip"),
@@ -711,7 +711,7 @@ TEST_F(ZipTest, UnzipDifferentCasesContinueOnError) {
 
   std::string contents;
 
-#if defined(OS_WIN) || defined(OS_MAC)
+#if defined(OS_WIN) || defined(OS_APPLE)
   // Only the first file (with mixed case) has been extracted.
   EXPECT_THAT(
       GetRelativePaths(test_dir_, base::FileEnumerator::FileType::FILES),
@@ -782,7 +782,7 @@ TEST_F(ZipTest, UnzipMixedPaths) {
       "Space→ ",                  //
       "c/NUL",                    // Disappears on Windows
       "nul.very long extension",  // Disappears on Windows
-#ifndef OS_MAC
+#ifndef OS_APPLE
       "CASE",                     // Conflicts with "Case"
       "case",                     // Conflicts with "Case"
 #endif
diff --git a/deps/v8/third_party/zlib/gzclose.c b/deps/v8/third_party/zlib/gzclose.c
index caeb99a3177f47..48d6a86f04b6ea 100644
--- a/deps/v8/third_party/zlib/gzclose.c
+++ b/deps/v8/third_party/zlib/gzclose.c
@@ -8,9 +8,7 @@
 /* gzclose() is in a separate file so that it is linked in only if it is used.
    That way the other gzclose functions can be used instead to avoid linking in
    unneeded compression or decompression routines. */
-int ZEXPORT gzclose(file)
-    gzFile file;
-{
+int ZEXPORT gzclose(gzFile file) {
 #ifndef NO_GZCOMPRESS
     gz_statep state;
 
diff --git a/deps/v8/third_party/zlib/gzguts.h b/deps/v8/third_party/zlib/gzguts.h
index 57faf37165a354..e23f831f531bb1 100644
--- a/deps/v8/third_party/zlib/gzguts.h
+++ b/deps/v8/third_party/zlib/gzguts.h
@@ -119,8 +119,8 @@
 
 /* gz* functions always use library allocation functions */
 #ifndef STDC
-  extern voidp  malloc OF((uInt size));
-  extern void   free   OF((voidpf ptr));
+  extern voidp  malloc(uInt size);
+  extern void   free(voidpf ptr);
 #endif
 
 /* get errno and strerror definition */
@@ -138,10 +138,10 @@
 
 /* provide prototypes for these when building zlib without LFS */
 #if !defined(_LARGEFILE64_SOURCE) || _LFS64_LARGEFILE-0 == 0
-    ZEXTERN gzFile ZEXPORT gzopen64 OF((const char *, const char *));
-    ZEXTERN z_off64_t ZEXPORT gzseek64 OF((gzFile, z_off64_t, int));
-    ZEXTERN z_off64_t ZEXPORT gztell64 OF((gzFile));
-    ZEXTERN z_off64_t ZEXPORT gzoffset64 OF((gzFile));
+    ZEXTERN gzFile ZEXPORT gzopen64(const char *, const char *);
+    ZEXTERN z_off64_t ZEXPORT gzseek64(gzFile, z_off64_t, int);
+    ZEXTERN z_off64_t ZEXPORT gztell64(gzFile);
+    ZEXTERN z_off64_t ZEXPORT gzoffset64(gzFile);
 #endif
 
 /* default memLevel */
@@ -203,9 +203,9 @@ typedef struct {
 typedef gz_state FAR *gz_statep;
 
 /* shared functions */
-void ZLIB_INTERNAL gz_error OF((gz_statep, int, const char *));
+void ZLIB_INTERNAL gz_error(gz_statep, int, const char *);
 #if defined UNDER_CE
-char ZLIB_INTERNAL *gz_strwinerror OF((DWORD error));
+char ZLIB_INTERNAL *gz_strwinerror(DWORD error);
 #endif
 
 /* GT_OFF(x), where x is an unsigned value, is true if x > maximum z_off64_t
@@ -214,6 +214,6 @@ char ZLIB_INTERNAL *gz_strwinerror OF((DWORD error));
 #ifdef INT_MAX
 #  define GT_OFF(x) (sizeof(int) == sizeof(z_off64_t) && (x) > INT_MAX)
 #else
-unsigned ZLIB_INTERNAL gz_intmax OF((void));
+unsigned ZLIB_INTERNAL gz_intmax(void);
 #  define GT_OFF(x) (sizeof(int) == sizeof(z_off64_t) && (x) > gz_intmax())
 #endif
diff --git a/deps/v8/third_party/zlib/gzlib.c b/deps/v8/third_party/zlib/gzlib.c
index 55da46a453fd18..9810e3553e0263 100644
--- a/deps/v8/third_party/zlib/gzlib.c
+++ b/deps/v8/third_party/zlib/gzlib.c
@@ -7,18 +7,17 @@
 
 #if defined(_WIN32) && !defined(__BORLANDC__)
 #  define LSEEK _lseeki64
+#  define OPEN  open
 #else
 #if defined(_LARGEFILE64_SOURCE) && _LFS64_LARGEFILE-0
 #  define LSEEK lseek64
+#  define OPEN  open64
 #else
 #  define LSEEK lseek
+#  define OPEN  open
 #endif
 #endif
 
-/* Local functions */
-local void gz_reset OF((gz_statep));
-local gzFile gz_open OF((const void *, int, const char *));
-
 #if defined UNDER_CE
 
 /* Map the Windows error number in ERROR to a locale-dependent error message
@@ -30,9 +29,7 @@ local gzFile gz_open OF((const void *, int, const char *));
 
    The gz_strwinerror function does not change the current setting of
    GetLastError. */
-char ZLIB_INTERNAL *gz_strwinerror(error)
-     DWORD error;
-{
+char ZLIB_INTERNAL *gz_strwinerror(DWORD error) {
     static char buf[1024];
 
     wchar_t *msgbuf;
@@ -72,9 +69,7 @@ char ZLIB_INTERNAL *gz_strwinerror(error)
 #endif /* UNDER_CE */
 
 /* Reset gzip file state */
-local void gz_reset(state)
-    gz_statep state;
-{
+local void gz_reset(gz_statep state) {
     state->x.have = 0;              /* no output data available */
     if (state->mode == GZ_READ) {   /* for reading ... */
         state->eof = 0;             /* not at end of file */
@@ -90,11 +85,7 @@ local void gz_reset(state)
 }
 
 /* Open a gzip file either by name or file descriptor. */
-local gzFile gz_open(path, fd, mode)
-    const void *path;
-    int fd;
-    const char *mode;
-{
+local gzFile gz_open(const void *path, int fd, const char *mode) {
     gz_statep state;
     z_size_t len;
     int oflag;
@@ -244,7 +235,7 @@ local gzFile gz_open(path, fd, mode)
 #ifdef WIDECHAR
         fd == -2 ? _wopen(path, oflag, 0666) :
 #endif
-        open((const char *)path, oflag, 0666));
+        OPEN((const char *)path, oflag, 0666));
     if (state->fd == -1) {
         free(state->path);
         free(state);
@@ -269,26 +260,17 @@ local gzFile gz_open(path, fd, mode)
 }
 
 /* -- see zlib.h -- */
-gzFile ZEXPORT gzopen(path, mode)
-    const char *path;
-    const char *mode;
-{
+gzFile ZEXPORT gzopen(const char *path, const char *mode) {
     return gz_open(path, -1, mode);
 }
 
 /* -- see zlib.h -- */
-gzFile ZEXPORT gzopen64(path, mode)
-    const char *path;
-    const char *mode;
-{
+gzFile ZEXPORT gzopen64(const char *path, const char *mode) {
     return gz_open(path, -1, mode);
 }
 
 /* -- see zlib.h -- */
-gzFile ZEXPORT gzdopen(fd, mode)
-    int fd;
-    const char *mode;
-{
+gzFile ZEXPORT gzdopen(int fd, const char *mode) {
     char *path;         /* identifier for error messages */
     gzFile gz;
 
@@ -306,19 +288,13 @@ gzFile ZEXPORT gzdopen(fd, mode)
 
 /* -- see zlib.h -- */
 #ifdef WIDECHAR
-gzFile ZEXPORT gzopen_w(path, mode)
-    const wchar_t *path;
-    const char *mode;
-{
+gzFile ZEXPORT gzopen_w(const wchar_t *path, const char *mode) {
     return gz_open(path, -2, mode);
 }
 #endif
 
 /* -- see zlib.h -- */
-int ZEXPORT gzbuffer(file, size)
-    gzFile file;
-    unsigned size;
-{
+int ZEXPORT gzbuffer(gzFile file, unsigned size) {
     gz_statep state;
 
     /* get internal structure and check integrity */
@@ -342,9 +318,7 @@ int ZEXPORT gzbuffer(file, size)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzrewind(file)
-    gzFile file;
-{
+int ZEXPORT gzrewind(gzFile file) {
     gz_statep state;
 
     /* get internal structure */
@@ -365,11 +339,7 @@ int ZEXPORT gzrewind(file)
 }
 
 /* -- see zlib.h -- */
-z_off64_t ZEXPORT gzseek64(file, offset, whence)
-    gzFile file;
-    z_off64_t offset;
-    int whence;
-{
+z_off64_t ZEXPORT gzseek64(gzFile file, z_off64_t offset, int whence) {
     unsigned n;
     z_off64_t ret;
     gz_statep state;
@@ -442,11 +412,7 @@ z_off64_t ZEXPORT gzseek64(file, offset, whence)
 }
 
 /* -- see zlib.h -- */
-z_off_t ZEXPORT gzseek(file, offset, whence)
-    gzFile file;
-    z_off_t offset;
-    int whence;
-{
+z_off_t ZEXPORT gzseek(gzFile file, z_off_t offset, int whence) {
     z_off64_t ret;
 
     ret = gzseek64(file, (z_off64_t)offset, whence);
@@ -454,9 +420,7 @@ z_off_t ZEXPORT gzseek(file, offset, whence)
 }
 
 /* -- see zlib.h -- */
-z_off64_t ZEXPORT gztell64(file)
-    gzFile file;
-{
+z_off64_t ZEXPORT gztell64(gzFile file) {
     gz_statep state;
 
     /* get internal structure and check integrity */
@@ -471,9 +435,7 @@ z_off64_t ZEXPORT gztell64(file)
 }
 
 /* -- see zlib.h -- */
-z_off_t ZEXPORT gztell(file)
-    gzFile file;
-{
+z_off_t ZEXPORT gztell(gzFile file) {
     z_off64_t ret;
 
     ret = gztell64(file);
@@ -481,9 +443,7 @@ z_off_t ZEXPORT gztell(file)
 }
 
 /* -- see zlib.h -- */
-z_off64_t ZEXPORT gzoffset64(file)
-    gzFile file;
-{
+z_off64_t ZEXPORT gzoffset64(gzFile file) {
     z_off64_t offset;
     gz_statep state;
 
@@ -504,9 +464,7 @@ z_off64_t ZEXPORT gzoffset64(file)
 }
 
 /* -- see zlib.h -- */
-z_off_t ZEXPORT gzoffset(file)
-    gzFile file;
-{
+z_off_t ZEXPORT gzoffset(gzFile file) {
     z_off64_t ret;
 
     ret = gzoffset64(file);
@@ -514,9 +472,7 @@ z_off_t ZEXPORT gzoffset(file)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzeof(file)
-    gzFile file;
-{
+int ZEXPORT gzeof(gzFile file) {
     gz_statep state;
 
     /* get internal structure and check integrity */
@@ -531,10 +487,7 @@ int ZEXPORT gzeof(file)
 }
 
 /* -- see zlib.h -- */
-const char * ZEXPORT gzerror(file, errnum)
-    gzFile file;
-    int *errnum;
-{
+const char * ZEXPORT gzerror(gzFile file, int *errnum) {
     gz_statep state;
 
     /* get internal structure and check integrity */
@@ -552,9 +505,7 @@ const char * ZEXPORT gzerror(file, errnum)
 }
 
 /* -- see zlib.h -- */
-void ZEXPORT gzclearerr(file)
-    gzFile file;
-{
+void ZEXPORT gzclearerr(gzFile file) {
     gz_statep state;
 
     /* get internal structure and check integrity */
@@ -578,11 +529,7 @@ void ZEXPORT gzclearerr(file)
    memory).  Simply save the error message as a static string.  If there is an
    allocation failure constructing the error message, then convert the error to
    out of memory. */
-void ZLIB_INTERNAL gz_error(state, err, msg)
-    gz_statep state;
-    int err;
-    const char *msg;
-{
+void ZLIB_INTERNAL gz_error(gz_statep state, int err, const char *msg) {
     /* free previously allocated message and clear */
     if (state->msg != NULL) {
         if (state->err != Z_MEM_ERROR)
@@ -624,8 +571,7 @@ void ZLIB_INTERNAL gz_error(state, err, msg)
    available) -- we need to do this to cover cases where 2's complement not
    used, since C standard permits 1's complement and sign-bit representations,
    otherwise we could just use ((unsigned)-1) >> 1 */
-unsigned ZLIB_INTERNAL gz_intmax()
-{
+unsigned ZLIB_INTERNAL gz_intmax(void) {
     unsigned p, q;
 
     p = 1;
diff --git a/deps/v8/third_party/zlib/gzread.c b/deps/v8/third_party/zlib/gzread.c
index 9449a79289b437..9a9f7847ce4cc6 100644
--- a/deps/v8/third_party/zlib/gzread.c
+++ b/deps/v8/third_party/zlib/gzread.c
@@ -5,25 +5,12 @@
 
 #include "gzguts.h"
 
-/* Local functions */
-local int gz_load OF((gz_statep, unsigned char *, unsigned, unsigned *));
-local int gz_avail OF((gz_statep));
-local int gz_look OF((gz_statep));
-local int gz_decomp OF((gz_statep));
-local int gz_fetch OF((gz_statep));
-local int gz_skip OF((gz_statep, z_off64_t));
-local z_size_t gz_read OF((gz_statep, voidp, z_size_t));
-
 /* Use read() to load a buffer -- return -1 on error, otherwise 0.  Read from
    state->fd, and update state->eof, state->err, and state->msg as appropriate.
    This function needs to loop on read(), since read() is not guaranteed to
    read the number of bytes requested, depending on the type of descriptor. */
-local int gz_load(state, buf, len, have)
-    gz_statep state;
-    unsigned char *buf;
-    unsigned len;
-    unsigned *have;
-{
+local int gz_load(gz_statep state, unsigned char *buf, unsigned len,
+                  unsigned *have) {
     int ret;
     unsigned get, max = ((unsigned)-1 >> 2) + 1;
 
@@ -53,9 +40,7 @@ local int gz_load(state, buf, len, have)
    If strm->avail_in != 0, then the current data is moved to the beginning of
    the input buffer, and then the remainder of the buffer is loaded with the
    available data from the input file. */
-local int gz_avail(state)
-    gz_statep state;
-{
+local int gz_avail(gz_statep state) {
     unsigned got;
     z_streamp strm = &(state->strm);
 
@@ -88,9 +73,7 @@ local int gz_avail(state)
    case, all further file reads will be directly to either the output buffer or
    a user buffer.  If decompressing, the inflate state will be initialized.
    gz_look() will return 0 on success or -1 on failure. */
-local int gz_look(state)
-    gz_statep state;
-{
+local int gz_look(gz_statep state) {
     z_streamp strm = &(state->strm);
 
     /* allocate read buffers and inflate memory */
@@ -170,9 +153,7 @@ local int gz_look(state)
    data.  If the gzip stream completes, state->how is reset to LOOK to look for
    the next gzip stream or raw data, once state->x.have is depleted.  Returns 0
    on success, -1 on failure. */
-local int gz_decomp(state)
-    gz_statep state;
-{
+local int gz_decomp(gz_statep state) {
     int ret = Z_OK;
     unsigned had;
     z_streamp strm = &(state->strm);
@@ -224,9 +205,7 @@ local int gz_decomp(state)
    looked for to determine whether to copy or decompress.  Returns -1 on error,
    otherwise 0.  gz_fetch() will leave state->how as COPY or GZIP unless the
    end of the input file has been reached and all data has been processed.  */
-local int gz_fetch(state)
-    gz_statep state;
-{
+local int gz_fetch(gz_statep state) {
     z_streamp strm = &(state->strm);
 
     do {
@@ -254,10 +233,7 @@ local int gz_fetch(state)
 }
 
 /* Skip len uncompressed bytes of output.  Return -1 on error, 0 on success. */
-local int gz_skip(state, len)
-    gz_statep state;
-    z_off64_t len;
-{
+local int gz_skip(gz_statep state, z_off64_t len) {
     unsigned n;
 
     /* skip over len bytes or reach end-of-file, whichever comes first */
@@ -289,11 +265,7 @@ local int gz_skip(state, len)
    input.  Return the number of bytes read.  If zero is returned, either the
    end of file was reached, or there was an error.  state->err must be
    consulted in that case to determine which. */
-local z_size_t gz_read(state, buf, len)
-    gz_statep state;
-    voidp buf;
-    z_size_t len;
-{
+local z_size_t gz_read(gz_statep state, voidp buf, z_size_t len) {
     z_size_t got;
     unsigned n;
 
@@ -370,11 +342,7 @@ local z_size_t gz_read(state, buf, len)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzread(file, buf, len)
-    gzFile file;
-    voidp buf;
-    unsigned len;
-{
+int ZEXPORT gzread(gzFile file, voidp buf, unsigned len) {
     gz_statep state;
 
     /* get internal structure */
@@ -406,12 +374,7 @@ int ZEXPORT gzread(file, buf, len)
 }
 
 /* -- see zlib.h -- */
-z_size_t ZEXPORT gzfread(buf, size, nitems, file)
-    voidp buf;
-    z_size_t size;
-    z_size_t nitems;
-    gzFile file;
-{
+z_size_t ZEXPORT gzfread(voidp buf, z_size_t size, z_size_t nitems, gzFile file) {
     z_size_t len;
     gz_statep state;
 
@@ -446,9 +409,7 @@ z_size_t ZEXPORT gzfread(buf, size, nitems, file)
 #  endif
 #endif
 
-int ZEXPORT gzgetc(file)
-    gzFile file;
-{
+int ZEXPORT gzgetc(gzFile file) {
     unsigned char buf[1];
     gz_statep state;
 
@@ -473,17 +434,12 @@ int ZEXPORT gzgetc(file)
     return gz_read(state, buf, 1) < 1 ? -1 : buf[0];
 }
 
-int ZEXPORT gzgetc_(file)
-gzFile file;
-{
+int ZEXPORT gzgetc_(gzFile file) {
     return gzgetc(file);
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzungetc(c, file)
-    int c;
-    gzFile file;
-{
+int ZEXPORT gzungetc(int c, gzFile file) {
     gz_statep state;
 
     /* get internal structure */
@@ -540,11 +496,7 @@ int ZEXPORT gzungetc(c, file)
 }
 
 /* -- see zlib.h -- */
-char * ZEXPORT gzgets(file, buf, len)
-    gzFile file;
-    char *buf;
-    int len;
-{
+char * ZEXPORT gzgets(gzFile file, char *buf, int len) {
     unsigned left, n;
     char *str;
     unsigned char *eol;
@@ -604,9 +556,7 @@ char * ZEXPORT gzgets(file, buf, len)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzdirect(file)
-    gzFile file;
-{
+int ZEXPORT gzdirect(gzFile file) {
     gz_statep state;
 
     /* get internal structure */
@@ -624,9 +574,7 @@ int ZEXPORT gzdirect(file)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzclose_r(file)
-    gzFile file;
-{
+int ZEXPORT gzclose_r(gzFile file) {
     int ret, err;
     gz_statep state;
 
diff --git a/deps/v8/third_party/zlib/gzwrite.c b/deps/v8/third_party/zlib/gzwrite.c
index eb8a0e5893ff6a..435b4621b5349f 100644
--- a/deps/v8/third_party/zlib/gzwrite.c
+++ b/deps/v8/third_party/zlib/gzwrite.c
@@ -5,18 +5,10 @@
 
 #include "gzguts.h"
 
-/* Local functions */
-local int gz_init OF((gz_statep));
-local int gz_comp OF((gz_statep, int));
-local int gz_zero OF((gz_statep, z_off64_t));
-local z_size_t gz_write OF((gz_statep, voidpc, z_size_t));
-
 /* Initialize state for writing a gzip file.  Mark initialization by setting
    state->size to non-zero.  Return -1 on a memory allocation failure, or 0 on
    success. */
-local int gz_init(state)
-    gz_statep state;
-{
+local int gz_init(gz_statep state) {
     int ret;
     z_streamp strm = &(state->strm);
 
@@ -70,10 +62,7 @@ local int gz_init(state)
    deflate() flush value.  If flush is Z_FINISH, then the deflate() state is
    reset to start a new gzip stream.  If gz->direct is true, then simply write
    to the output file without compressing, and ignore flush. */
-local int gz_comp(state, flush)
-    gz_statep state;
-    int flush;
-{
+local int gz_comp(gz_statep state, int flush) {
     int ret, writ;
     unsigned have, put, max = ((unsigned)-1 >> 2) + 1;
     z_streamp strm = &(state->strm);
@@ -151,10 +140,7 @@ local int gz_comp(state, flush)
 
 /* Compress len zeros to output.  Return -1 on a write error or memory
    allocation failure by gz_comp(), or 0 on success. */
-local int gz_zero(state, len)
-    gz_statep state;
-    z_off64_t len;
-{
+local int gz_zero(gz_statep state, z_off64_t len) {
     int first;
     unsigned n;
     z_streamp strm = &(state->strm);
@@ -184,11 +170,7 @@ local int gz_zero(state, len)
 
 /* Write len bytes from buf to file.  Return the number of bytes written.  If
    the returned value is less than len, then there was an error. */
-local z_size_t gz_write(state, buf, len)
-    gz_statep state;
-    voidpc buf;
-    z_size_t len;
-{
+local z_size_t gz_write(gz_statep state, voidpc buf, z_size_t len) {
     z_size_t put = len;
 
     /* if len is zero, avoid unnecessary operations */
@@ -252,11 +234,7 @@ local z_size_t gz_write(state, buf, len)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzwrite(file, buf, len)
-    gzFile file;
-    voidpc buf;
-    unsigned len;
-{
+int ZEXPORT gzwrite(gzFile file, voidpc buf, unsigned len) {
     gz_statep state;
 
     /* get internal structure */
@@ -280,12 +258,8 @@ int ZEXPORT gzwrite(file, buf, len)
 }
 
 /* -- see zlib.h -- */
-z_size_t ZEXPORT gzfwrite(buf, size, nitems, file)
-    voidpc buf;
-    z_size_t size;
-    z_size_t nitems;
-    gzFile file;
-{
+z_size_t ZEXPORT gzfwrite(voidpc buf, z_size_t size, z_size_t nitems,
+                          gzFile file) {
     z_size_t len;
     gz_statep state;
 
@@ -310,10 +284,7 @@ z_size_t ZEXPORT gzfwrite(buf, size, nitems, file)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzputc(file, c)
-    gzFile file;
-    int c;
-{
+int ZEXPORT gzputc(gzFile file, int c) {
     unsigned have;
     unsigned char buf[1];
     gz_statep state;
@@ -358,10 +329,7 @@ int ZEXPORT gzputc(file, c)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzputs(file, s)
-    gzFile file;
-    const char *s;
-{
+int ZEXPORT gzputs(gzFile file, const char *s) {
     z_size_t len, put;
     gz_statep state;
 
@@ -388,8 +356,7 @@ int ZEXPORT gzputs(file, s)
 #include <stdarg.h>
 
 /* -- see zlib.h -- */
-int ZEXPORTVA gzvprintf(gzFile file, const char *format, va_list va)
-{
+int ZEXPORTVA gzvprintf(gzFile file, const char *format, va_list va) {
     int len;
     unsigned left;
     char *next;
@@ -460,8 +427,7 @@ int ZEXPORTVA gzvprintf(gzFile file, const char *format, va_list va)
     return len;
 }
 
-int ZEXPORTVA gzprintf(gzFile file, const char *format, ...)
-{
+int ZEXPORTVA gzprintf(gzFile file, const char *format, ...) {
     va_list va;
     int ret;
 
@@ -474,13 +440,10 @@ int ZEXPORTVA gzprintf(gzFile file, const char *format, ...)
 #else /* !STDC && !Z_HAVE_STDARG_H */
 
 /* -- see zlib.h -- */
-int ZEXPORTVA gzprintf(file, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10,
-                       a11, a12, a13, a14, a15, a16, a17, a18, a19, a20)
-    gzFile file;
-    const char *format;
-    int a1, a2, a3, a4, a5, a6, a7, a8, a9, a10,
-        a11, a12, a13, a14, a15, a16, a17, a18, a19, a20;
-{
+int ZEXPORTVA gzprintf(gzFile file, const char *format, int a1, int a2, int a3,
+                       int a4, int a5, int a6, int a7, int a8, int a9, int a10,
+                       int a11, int a12, int a13, int a14, int a15, int a16,
+                       int a17, int a18, int a19, int a20) {
     unsigned len, left;
     char *next;
     gz_statep state;
@@ -562,10 +525,7 @@ int ZEXPORTVA gzprintf(file, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10,
 #endif
 
 /* -- see zlib.h -- */
-int ZEXPORT gzflush(file, flush)
-    gzFile file;
-    int flush;
-{
+int ZEXPORT gzflush(gzFile file, int flush) {
     gz_statep state;
 
     /* get internal structure */
@@ -594,11 +554,7 @@ int ZEXPORT gzflush(file, flush)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzsetparams(file, level, strategy)
-    gzFile file;
-    int level;
-    int strategy;
-{
+int ZEXPORT gzsetparams(gzFile file, int level, int strategy) {
     gz_statep state;
     z_streamp strm;
 
@@ -609,7 +565,7 @@ int ZEXPORT gzsetparams(file, level, strategy)
     strm = &(state->strm);
 
     /* check that we're writing and that there's no error */
-    if (state->mode != GZ_WRITE || state->err != Z_OK)
+    if (state->mode != GZ_WRITE || state->err != Z_OK || state->direct)
         return Z_STREAM_ERROR;
 
     /* if no change is requested, then do nothing */
@@ -636,9 +592,7 @@ int ZEXPORT gzsetparams(file, level, strategy)
 }
 
 /* -- see zlib.h -- */
-int ZEXPORT gzclose_w(file)
-    gzFile file;
-{
+int ZEXPORT gzclose_w(gzFile file) {
     int ret = Z_OK;
     gz_statep state;
 
diff --git a/deps/v8/third_party/zlib/infback.c b/deps/v8/third_party/zlib/infback.c
index cba8fda6fd40ce..9bfc30fe555f57 100644
--- a/deps/v8/third_party/zlib/infback.c
+++ b/deps/v8/third_party/zlib/infback.c
@@ -15,9 +15,6 @@
 #include "inflate.h"
 #include "inffast.h"
 
-/* function prototypes */
-local void fixedtables OF((struct inflate_state FAR *state));
-
 /*
    strm provides memory allocation functions in zalloc and zfree, or
    Z_NULL to use the library memory allocation functions.
@@ -25,13 +22,9 @@ local void fixedtables OF((struct inflate_state FAR *state));
    windowBits is in the range 8..15, and window is a user-supplied
    window and output buffer that is 2**windowBits bytes.
  */
-int ZEXPORT inflateBackInit_(strm, windowBits, window, version, stream_size)
-z_streamp strm;
-int windowBits;
-unsigned char FAR *window;
-const char *version;
-int stream_size;
-{
+int ZEXPORT inflateBackInit_(z_streamp strm, int windowBits,
+                             unsigned char FAR *window, const char *version,
+                             int stream_size) {
     struct inflate_state FAR *state;
 
     if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
@@ -80,9 +73,7 @@ int stream_size;
    used for threaded applications, since the rewriting of the tables and virgin
    may not be thread-safe.
  */
-local void fixedtables(state)
-struct inflate_state FAR *state;
-{
+local void fixedtables(struct inflate_state FAR *state) {
 #ifdef BUILDFIXED
     static int virgin = 1;
     static code *lenfix, *distfix;
@@ -248,13 +239,8 @@ struct inflate_state FAR *state;
    inflateBack() can also return Z_STREAM_ERROR if the input parameters
    are not correct, i.e. strm is Z_NULL or the state was not initialized.
  */
-int ZEXPORT inflateBack(strm, in, in_desc, out, out_desc)
-z_streamp strm;
-in_func in;
-void FAR *in_desc;
-out_func out;
-void FAR *out_desc;
-{
+int ZEXPORT inflateBack(z_streamp strm, in_func in, void FAR *in_desc,
+                        out_func out, void FAR *out_desc) {
     struct inflate_state FAR *state;
     z_const unsigned char FAR *next;    /* next input */
     unsigned char FAR *put;     /* next output */
@@ -633,9 +619,7 @@ void FAR *out_desc;
     return ret;
 }
 
-int ZEXPORT inflateBackEnd(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateBackEnd(z_streamp strm) {
     if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
         return Z_STREAM_ERROR;
     ZFREE(strm, strm->state);
diff --git a/deps/v8/third_party/zlib/inffast.c b/deps/v8/third_party/zlib/inffast.c
index d89ad5ccdee0e2..52ed8ca2df612e 100644
--- a/deps/v8/third_party/zlib/inffast.c
+++ b/deps/v8/third_party/zlib/inffast.c
@@ -51,10 +51,7 @@
       requires strm->avail_out >= 258 for each loop to avoid checking for
       available output space while decoding.
  */
-void ZLIB_INTERNAL inflate_fast(strm, start)
-z_streamp strm;
-unsigned start;         /* inflate()'s starting value for strm->avail_out */
-{
+void ZLIB_INTERNAL inflate_fast(z_streamp strm, unsigned start) {
     struct inflate_state FAR *state;
     z_const unsigned char FAR *in;      /* local strm->next_in */
     z_const unsigned char FAR *last;    /* have enough input while in < last */
diff --git a/deps/v8/third_party/zlib/inffast.h b/deps/v8/third_party/zlib/inffast.h
index c7c1c09808e5e9..9ff6ce3b6a96e5 100644
--- a/deps/v8/third_party/zlib/inffast.h
+++ b/deps/v8/third_party/zlib/inffast.h
@@ -23,4 +23,4 @@
  */
 #define INFLATE_FAST_MIN_OUTPUT 258
 
-void ZLIB_INTERNAL inflate_fast OF((z_streamp strm, unsigned start));
+void ZLIB_INTERNAL inflate_fast(z_streamp strm, unsigned start);
diff --git a/deps/v8/third_party/zlib/inflate.c b/deps/v8/third_party/zlib/inflate.c
index 281f9ab2e8c5fc..5abbd07464ab64 100644
--- a/deps/v8/third_party/zlib/inflate.c
+++ b/deps/v8/third_party/zlib/inflate.c
@@ -91,20 +91,7 @@
 #  endif
 #endif
 
-/* function prototypes */
-local int inflateStateCheck OF((z_streamp strm));
-local void fixedtables OF((struct inflate_state FAR *state));
-local int updatewindow OF((z_streamp strm, const unsigned char FAR *end,
-                           unsigned copy));
-#ifdef BUILDFIXED
-   void makefixed OF((void));
-#endif
-local unsigned syncsearch OF((unsigned FAR *have, const unsigned char FAR *buf,
-                              unsigned len));
-
-local int inflateStateCheck(strm)
-z_streamp strm;
-{
+local int inflateStateCheck(z_streamp strm) {
     struct inflate_state FAR *state;
     if (strm == Z_NULL ||
         strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0)
@@ -116,9 +103,7 @@ z_streamp strm;
     return 0;
 }
 
-int ZEXPORT inflateResetKeep(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateResetKeep(z_streamp strm) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -142,9 +127,7 @@ z_streamp strm;
     return Z_OK;
 }
 
-int ZEXPORT inflateReset(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateReset(z_streamp strm) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -155,10 +138,7 @@ z_streamp strm;
     return inflateResetKeep(strm);
 }
 
-int ZEXPORT inflateReset2(strm, windowBits)
-z_streamp strm;
-int windowBits;
-{
+int ZEXPORT inflateReset2(z_streamp strm, int windowBits) {
     int wrap;
     struct inflate_state FAR *state;
 
@@ -195,12 +175,8 @@ int windowBits;
     return inflateReset(strm);
 }
 
-int ZEXPORT inflateInit2_(strm, windowBits, version, stream_size)
-z_streamp strm;
-int windowBits;
-const char *version;
-int stream_size;
-{
+int ZEXPORT inflateInit2_(z_streamp strm, int windowBits,
+                          const char *version, int stream_size) {
     int ret;
     struct inflate_state FAR *state;
 
@@ -240,22 +216,17 @@ int stream_size;
     return ret;
 }
 
-int ZEXPORT inflateInit_(strm, version, stream_size)
-z_streamp strm;
-const char *version;
-int stream_size;
-{
+int ZEXPORT inflateInit_(z_streamp strm, const char *version,
+                         int stream_size) {
     return inflateInit2_(strm, DEF_WBITS, version, stream_size);
 }
 
-int ZEXPORT inflatePrime(strm, bits, value)
-z_streamp strm;
-int bits;
-int value;
-{
+int ZEXPORT inflatePrime(z_streamp strm, int bits, int value) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
+    if (bits == 0)
+        return Z_OK;
     state = (struct inflate_state FAR *)strm->state;
     if (bits < 0) {
         state->hold = 0;
@@ -279,9 +250,7 @@ int value;
    used for threaded applications, since the rewriting of the tables and virgin
    may not be thread-safe.
  */
-local void fixedtables(state)
-struct inflate_state FAR *state;
-{
+local void fixedtables(struct inflate_state FAR *state) {
 #ifdef BUILDFIXED
     static int virgin = 1;
     static code *lenfix, *distfix;
@@ -343,7 +312,7 @@ struct inflate_state FAR *state;
 
     a.out > inffixed.h
  */
-void makefixed()
+void makefixed(void)
 {
     unsigned low, size;
     struct inflate_state state;
@@ -397,11 +366,7 @@ void makefixed()
    output will fall in the output data, making match copies simpler and faster.
    The advantage may be dependent on the size of the processor's data caches.
  */
-local int updatewindow(strm, end, copy)
-z_streamp strm;
-const Bytef *end;
-unsigned copy;
-{
+local int updatewindow(z_streamp strm, const Bytef *end, unsigned copy) {
     struct inflate_state FAR *state;
     unsigned dist;
 
@@ -623,10 +588,7 @@ unsigned copy;
    will return Z_BUF_ERROR if it has not reached the end of the stream.
  */
 
-int ZEXPORT inflate(strm, flush)
-z_streamp strm;
-int flush;
-{
+int ZEXPORT inflate(z_streamp strm, int flush) {
     struct inflate_state FAR *state;
     z_const unsigned char FAR *next;    /* next input */
     unsigned char FAR *put;     /* next output */
@@ -1303,9 +1265,7 @@ int flush;
     return ret;
 }
 
-int ZEXPORT inflateEnd(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateEnd(z_streamp strm) {
     struct inflate_state FAR *state;
     if (inflateStateCheck(strm))
         return Z_STREAM_ERROR;
@@ -1317,11 +1277,8 @@ z_streamp strm;
     return Z_OK;
 }
 
-int ZEXPORT inflateGetDictionary(strm, dictionary, dictLength)
-z_streamp strm;
-Bytef *dictionary;
-uInt *dictLength;
-{
+int ZEXPORT inflateGetDictionary(z_streamp strm, Bytef *dictionary,
+                                 uInt *dictLength) {
     struct inflate_state FAR *state;
 
     /* check state */
@@ -1340,11 +1297,8 @@ uInt *dictLength;
     return Z_OK;
 }
 
-int ZEXPORT inflateSetDictionary(strm, dictionary, dictLength)
-z_streamp strm;
-const Bytef *dictionary;
-uInt dictLength;
-{
+int ZEXPORT inflateSetDictionary(z_streamp strm, const Bytef *dictionary,
+                                 uInt dictLength) {
     struct inflate_state FAR *state;
     unsigned long dictid;
     int ret;
@@ -1375,10 +1329,7 @@ uInt dictLength;
     return Z_OK;
 }
 
-int ZEXPORT inflateGetHeader(strm, head)
-z_streamp strm;
-gz_headerp head;
-{
+int ZEXPORT inflateGetHeader(z_streamp strm, gz_headerp head) {
     struct inflate_state FAR *state;
 
     /* check state */
@@ -1403,11 +1354,8 @@ gz_headerp head;
    called again with more data and the *have state.  *have is initialized to
    zero for the first call.
  */
-local unsigned syncsearch(have, buf, len)
-unsigned FAR *have;
-const unsigned char FAR *buf;
-unsigned len;
-{
+local unsigned syncsearch(unsigned FAR *have, const unsigned char FAR *buf,
+                          unsigned len) {
     unsigned got;
     unsigned next;
 
@@ -1426,9 +1374,7 @@ unsigned len;
     return next;
 }
 
-int ZEXPORT inflateSync(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateSync(z_streamp strm) {
     unsigned len;               /* number of bytes to look at or looked at */
     int flags;                  /* temporary to save header status */
     unsigned long in, out;      /* temporary to save total_in and total_out */
@@ -1484,9 +1430,7 @@ z_streamp strm;
    block. When decompressing, PPP checks that at the end of input packet,
    inflate is waiting for these length bytes.
  */
-int ZEXPORT inflateSyncPoint(strm)
-z_streamp strm;
-{
+int ZEXPORT inflateSyncPoint(z_streamp strm) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -1494,10 +1438,7 @@ z_streamp strm;
     return state->mode == STORED && state->bits == 0;
 }
 
-int ZEXPORT inflateCopy(dest, source)
-z_streamp dest;
-z_streamp source;
-{
+int ZEXPORT inflateCopy(z_streamp dest, z_streamp source) {
     struct inflate_state FAR *state;
     struct inflate_state FAR *copy;
     unsigned char FAR *window;
@@ -1541,10 +1482,7 @@ z_streamp source;
     return Z_OK;
 }
 
-int ZEXPORT inflateUndermine(strm, subvert)
-z_streamp strm;
-int subvert;
-{
+int ZEXPORT inflateUndermine(z_streamp strm, int subvert) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -1559,10 +1497,7 @@ int subvert;
 #endif
 }
 
-int ZEXPORT inflateValidate(strm, check)
-z_streamp strm;
-int check;
-{
+int ZEXPORT inflateValidate(z_streamp strm, int check) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm)) return Z_STREAM_ERROR;
@@ -1574,9 +1509,7 @@ int check;
     return Z_OK;
 }
 
-long ZEXPORT inflateMark(strm)
-z_streamp strm;
-{
+long ZEXPORT inflateMark(z_streamp strm) {
     struct inflate_state FAR *state;
 
     if (inflateStateCheck(strm))
@@ -1587,9 +1520,7 @@ z_streamp strm;
             (state->mode == MATCH ? state->was - state->length : 0));
 }
 
-unsigned long ZEXPORT inflateCodesUsed(strm)
-z_streamp strm;
-{
+unsigned long ZEXPORT inflateCodesUsed(z_streamp strm) {
     struct inflate_state FAR *state;
     if (inflateStateCheck(strm)) return (unsigned long)-1;
     state = (struct inflate_state FAR *)strm->state;
diff --git a/deps/v8/third_party/zlib/inftrees.c b/deps/v8/third_party/zlib/inftrees.c
index 57d2793bec931f..afc4c4212d8022 100644
--- a/deps/v8/third_party/zlib/inftrees.c
+++ b/deps/v8/third_party/zlib/inftrees.c
@@ -9,7 +9,7 @@
 #define MAXBITS 15
 
 const char inflate_copyright[] =
-   " inflate 1.2.13 Copyright 1995-2022 Mark Adler ";
+   " inflate 1.2.13.1 Copyright 1995-2022 Mark Adler ";
 /*
   If you use the zlib library in a product, an acknowledgment is welcome
   in the documentation of your product. If for some reason you cannot
@@ -29,14 +29,9 @@ const char inflate_copyright[] =
    table index bits.  It will differ if the request is greater than the
    longest code or if it is less than the shortest code.
  */
-int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work)
-codetype type;
-unsigned short FAR *lens;
-unsigned codes;
-code FAR * FAR *table;
-unsigned FAR *bits;
-unsigned short FAR *work;
-{
+int ZLIB_INTERNAL inflate_table(codetype type, unsigned short FAR *lens,
+                                unsigned codes, code FAR * FAR *table,
+                                unsigned FAR *bits, unsigned short FAR *work) {
     unsigned len;               /* a code's length in bits */
     unsigned sym;               /* index of code symbols */
     unsigned min, max;          /* minimum and maximum code lengths */
@@ -62,7 +57,7 @@ unsigned short FAR *work;
         35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
     static const unsigned short lext[31] = { /* Length codes 257..285 extra */
         16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
-        19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 194, 65};
+        19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 77, 76};
     static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
         1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
         257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
diff --git a/deps/v8/third_party/zlib/inftrees.h b/deps/v8/third_party/zlib/inftrees.h
index 44b96b30c5aac5..f11f29c0761c15 100644
--- a/deps/v8/third_party/zlib/inftrees.h
+++ b/deps/v8/third_party/zlib/inftrees.h
@@ -57,6 +57,6 @@ typedef enum {
     DISTS
 } codetype;
 
-int ZLIB_INTERNAL inflate_table OF((codetype type, unsigned short FAR *lens,
-                             unsigned codes, code FAR * FAR *table,
-                             unsigned FAR *bits, unsigned short FAR *work));
+int ZLIB_INTERNAL inflate_table(codetype type, unsigned short FAR *lens,
+                                unsigned codes, code FAR * FAR *table,
+                                unsigned FAR *bits, unsigned short FAR *work);
diff --git a/deps/v8/third_party/zlib/patches/0000-build.patch b/deps/v8/third_party/zlib/patches/0000-build.patch
index b7c59964822096..6119f09c05b73c 100644
--- a/deps/v8/third_party/zlib/patches/0000-build.patch
+++ b/deps/v8/third_party/zlib/patches/0000-build.patch
@@ -1,16 +1,3 @@
-diff --git a/contrib/minizip/ioapi.h b/contrib/minizip/ioapi.h
-index 8dcbdb06e35a..c1b7a54847f5 100644
---- a/contrib/minizip/ioapi.h
-+++ b/contrib/minizip/ioapi.h
-@@ -43,7 +43,7 @@
- 
- #include <stdio.h>
- #include <stdlib.h>
--#include "zlib.h"
-+#include "third_party/zlib/zlib.h"
- 
- #if defined(USE_FILE32API)
- #define fopen64 fopen
 diff --git a/contrib/minizip/iowin32.c b/contrib/minizip/iowin32.c
 index 274f39eb1dd2..246ceb91a139 100644
 --- a/contrib/minizip/iowin32.c
@@ -35,45 +22,10 @@ index 274f39eb1dd2..246ceb91a139 100644
  
  voidpf  ZCALLBACK win32_open_file_func  OF((voidpf opaque, const char* filename, int mode));
  uLong   ZCALLBACK win32_read_file_func  OF((voidpf opaque, voidpf stream, void* buf, uLong size));
-diff --git a/contrib/minizip/mztools.c b/contrib/minizip/mztools.c
-index 96891c2e0b71..8bf9cca32633 100644
---- a/contrib/minizip/mztools.c
-+++ b/contrib/minizip/mztools.c
-@@ -8,7 +8,7 @@
- #include <stdio.h>
- #include <stdlib.h>
- #include <string.h>
--#include "zlib.h"
-+#include "third_party/zlib/zlib.h"
- #include "unzip.h"
- 
- #define READ_8(adr)  ((unsigned char)*(adr))
-diff --git a/contrib/minizip/mztools.h b/contrib/minizip/mztools.h
-index a49a426ec2fc..f295ffeda6af 100644
---- a/contrib/minizip/mztools.h
-+++ b/contrib/minizip/mztools.h
-@@ -12,7 +12,7 @@ extern "C" {
- #endif
- 
- #ifndef _ZLIB_H
--#include "zlib.h"
-+#include "third_party/zlib/zlib.h"
- #endif
- 
- #include "unzip.h"
 diff --git a/contrib/minizip/unzip.c b/contrib/minizip/unzip.c
 index bcfb9416ec35..199b4723fcfc 100644
 --- a/contrib/minizip/unzip.c
 +++ b/contrib/minizip/unzip.c
-@@ -72,7 +72,7 @@
-         #define NOUNCRYPT
- #endif
- 
--#include "zlib.h"
-+#include "third_party/zlib/zlib.h"
- #include "unzip.h"
- 
- #ifdef STDC
 @@ -1705,11 +1705,6 @@ extern int ZEXPORT unzReadCurrentFile  (unzFile file, voidp buf, unsigned len)
  
      pfile_in_zip_read_info->stream.avail_out = (uInt)len;
@@ -86,45 +38,6 @@ index bcfb9416ec35..199b4723fcfc 100644
      if ((len>pfile_in_zip_read_info->rest_read_compressed+
             pfile_in_zip_read_info->stream.avail_in) &&
           (pfile_in_zip_read_info->raw))
-diff --git a/contrib/minizip/unzip.h b/contrib/minizip/unzip.h
-index 2104e3915074..3c0143529b91 100644
---- a/contrib/minizip/unzip.h
-+++ b/contrib/minizip/unzip.h
-@@ -48,7 +48,7 @@ extern "C" {
- #endif
- 
- #ifndef _ZLIB_H
--#include "zlib.h"
-+#include "third_party/zlib/zlib.h"
- #endif
- 
- #ifndef  _ZLIBIOAPI_H
-diff --git a/contrib/minizip/zip.c b/contrib/minizip/zip.c
-index 44e88a9cb989..65c0c7251843 100644
---- a/contrib/minizip/zip.c
-+++ b/contrib/minizip/zip.c
-@@ -26,7 +26,7 @@
- #include <stdlib.h>
- #include <string.h>
- #include <time.h>
--#include "zlib.h"
-+#include "third_party/zlib/zlib.h"
- #include "zip.h"
- 
- #ifdef STDC
-diff --git a/contrib/minizip/zip.h b/contrib/minizip/zip.h
-index 8aaebb623430..8c06c0aa7bb0 100644
---- a/contrib/minizip/zip.h
-+++ b/contrib/minizip/zip.h
-@@ -47,7 +47,7 @@ extern "C" {
- //#define HAVE_BZIP2
- 
- #ifndef _ZLIB_H
--#include "zlib.h"
-+#include "third_party/zlib/zlib.h"
- #endif
- 
- #ifndef _ZLIBIOAPI_H
 diff --git a/gzread.c b/gzread.c
 index 956b91ea7d9e..832d3ef98c59 100644
 --- a/gzread.c
diff --git a/deps/v8/third_party/zlib/patches/0011-avx512.patch b/deps/v8/third_party/zlib/patches/0011-avx512.patch
new file mode 100644
index 00000000000000..6d409b77383d53
--- /dev/null
+++ b/deps/v8/third_party/zlib/patches/0011-avx512.patch
@@ -0,0 +1,357 @@
+From 87fc8e3e38323cfdabf8da3927488e3e57073b02 Mon Sep 17 00:00:00 2001
+From: Jia Liu <jia3.liu@intel.com>
+Date: Thu, 30 Mar 2023 11:13:16 +0800
+Subject: [PATCH] Enabled AVX512 for CRC32
+
+Enabled AVX512 for CRC32 that provide best of known performance
+beyond current SSE SIMD optimization. It enables multiple folding
+operations and AVX512 new instructions, providing ~3.5X CRC32
+performance and ~3.7% gain on Zlib_bench gzip performance.
+---
+ CMakeLists.txt |   8 +-
+ cpu_features.c |   9 +++
+ cpu_features.h |   1 +
+ crc32.c        |  14 +++-
+ crc32_simd.c   | 198 ++++++++++++++++++++++++++++++++++++++++++++++++-
+ crc32_simd.h   |   6 ++
+ 6 files changed, 230 insertions(+), 6 deletions(-)
+
+diff --git a/CMakeLists.txt b/CMakeLists.txt
+index f06e193..d45b902 100644
+--- a/CMakeLists.txt
++++ b/CMakeLists.txt
+@@ -22,6 +22,7 @@ check_include_file(stdint.h    HAVE_STDINT_H)
+ check_include_file(stddef.h    HAVE_STDDEF_H)
+ 
+ option(ENABLE_SIMD_OPTIMIZATIONS "Enable all SIMD optimizations" OFF)
++option(ENABLE_SIMD_AVX512 "Enable SIMD AXV512 optimizations" OFF)
+ 
+ # TODO(cavalcantii): add support for other OSes (e.g. Android, fuchsia, osx)
+ # and architectures (e.g. Arm).
+@@ -30,8 +31,13 @@ if (ENABLE_SIMD_OPTIMIZATIONS)
+    add_definitions(-DADLER32_SIMD_SSSE3)
+    add_definitions(-DINFLATE_CHUNK_READ_64LE)
+    add_definitions(-DCRC32_SIMD_SSE42_PCLMUL)
++   if (ENABLE_SIMD_AVX512)
++    add_definitions(-DCRC32_SIMD_AVX512_PCLMUL)
++    add_compile_options(-mvpclmulqdq -msse2 -mavx512f -mpclmul)
++   else()
++    add_compile_options(-msse4.2 -mpclmul)
++   endif()
+    add_definitions(-DDEFLATE_SLIDE_HASH_SSE2)
+-   add_compile_options(-msse4.2 -mpclmul)
+    # Required by CPU features detection code.
+    add_definitions(-DX86_NOT_WINDOWS)
+    # Apparently some environments (e.g. CentOS) require to explicitly link
+diff --git a/cpu_features.c b/cpu_features.c
+index 877d5f2..ac6ee88 100644
+--- a/cpu_features.c
++++ b/cpu_features.c
+@@ -31,6 +31,7 @@ int ZLIB_INTERNAL arm_cpu_enable_pmull = 0;
+ int ZLIB_INTERNAL x86_cpu_enable_sse2 = 0;
+ int ZLIB_INTERNAL x86_cpu_enable_ssse3 = 0;
+ int ZLIB_INTERNAL x86_cpu_enable_simd = 0;
++int ZLIB_INTERNAL x86_cpu_enable_avx512 = 0;
+ 
+ #ifndef CPU_NO_SIMD
+ 
+@@ -138,6 +139,10 @@ static void _cpu_check_features(void)
+ /* On x86 we simply use a instruction to check the CPU features.
+  * (i.e. CPUID).
+  */
++#ifdef CRC32_SIMD_AVX512_PCLMUL
++#include <immintrin.h>
++#include <xsaveintrin.h>
++#endif
+ static void _cpu_check_features(void)
+ {
+     int x86_cpu_has_sse2;
+@@ -164,6 +169,10 @@ static void _cpu_check_features(void)
+     x86_cpu_enable_simd = x86_cpu_has_sse2 &&
+                           x86_cpu_has_sse42 &&
+                           x86_cpu_has_pclmulqdq;
++
++#ifdef CRC32_SIMD_AVX512_PCLMUL
++    x86_cpu_enable_avx512 = _xgetbv(0) & 0x00000040;
++#endif
+ }
+ #endif
+ #endif
+diff --git a/cpu_features.h b/cpu_features.h
+index 279246c..aed3e83 100644
+--- a/cpu_features.h
++++ b/cpu_features.h
+@@ -14,5 +14,6 @@ extern int arm_cpu_enable_pmull;
+ extern int x86_cpu_enable_sse2;
+ extern int x86_cpu_enable_ssse3;
+ extern int x86_cpu_enable_simd;
++extern int x86_cpu_enable_avx512;
+ 
+ void cpu_check_features(void);
+diff --git a/crc32.c b/crc32.c
+index 4486098..acb6972 100644
+--- a/crc32.c
++++ b/crc32.c
+@@ -773,7 +773,19 @@ unsigned long ZEXPORT crc32_z(crc, buf, len)
+     }
+ 
+ #endif
+-#if defined(CRC32_SIMD_SSE42_PCLMUL)
++#if defined(CRC32_SIMD_AVX512_PCLMUL)
++    if (x86_cpu_enable_avx512 && len >= Z_CRC32_AVX512_MINIMUM_LENGTH) {
++        /* crc32 64-byte chunks */
++        z_size_t chunk_size = len & ~Z_CRC32_AVX512_CHUNKSIZE_MASK;
++        crc = ~crc32_avx512_simd_(buf, chunk_size, ~(uint32_t)crc);
++        /* check remaining data */
++        len -= chunk_size;
++        if (!len)
++            return crc;
++        /* Fall into the default crc32 for the remaining data. */
++        buf += chunk_size;
++    }
++#elif defined(CRC32_SIMD_SSE42_PCLMUL)
+     if (x86_cpu_enable_simd && len >= Z_CRC32_SSE42_MINIMUM_LENGTH) {
+         /* crc32 16-byte chunks */
+         z_size_t chunk_size = len & ~Z_CRC32_SSE42_CHUNKSIZE_MASK;
+diff --git a/crc32_simd.c b/crc32_simd.c
+index d80beba..7428270 100644
+--- a/crc32_simd.c
++++ b/crc32_simd.c
+@@ -6,17 +6,207 @@
+  */
+ 
+ #include "crc32_simd.h"
+-
+-#if defined(CRC32_SIMD_SSE42_PCLMUL)
++#if defined(CRC32_SIMD_AVX512_PCLMUL)
+ 
+ /*
+- * crc32_sse42_simd_(): compute the crc32 of the buffer, where the buffer
+- * length must be at least 64, and a multiple of 16. Based on:
++ * crc32_avx512_simd_(): compute the crc32 of the buffer, where the buffer
++ * length must be at least 256, and a multiple of 64. Based on:
+  *
+  * "Fast CRC Computation for Generic Polynomials Using PCLMULQDQ Instruction"
+  *  V. Gopal, E. Ozturk, et al., 2009, http://intel.ly/2ySEwL0
+  */
+ 
++#include <emmintrin.h>
++#include <smmintrin.h>
++#include <wmmintrin.h>
++#include <immintrin.h>
++
++uint32_t ZLIB_INTERNAL crc32_avx512_simd_(  /* AVX512+PCLMUL */
++    const unsigned char *buf,
++    z_size_t len,
++    uint32_t crc)
++{
++    /*
++     * Definitions of the bit-reflected domain constants k1,k2,k3,k4
++     * are similar to those given at the end of the paper, and remaining
++     * constants and CRC32+Barrett polynomials remain unchanged.
++     *
++     * Replace the index of x from 128 to 512. As follows:
++     * k1 = ( x ^ ( 512 * 4 + 32 ) mod P(x) << 32 )' << 1 = 0x011542778a
++     * k2 = ( x ^ ( 512 * 4 - 32 ) mod P(x) << 32 )' << 1 = 0x01322d1430
++     * k3 = ( x ^ ( 512 + 32 ) mod P(x) << 32 )' << 1 = 0x0154442bd4
++     * k4 = ( x ^ ( 512 - 32 ) mod P(x) << 32 )' << 1 = 0x01c6e41596
++     */
++    static const uint64_t zalign(64) k1k2[] = { 0x011542778a, 0x01322d1430,
++                                                0x011542778a, 0x01322d1430,
++                                                0x011542778a, 0x01322d1430,
++                                                0x011542778a, 0x01322d1430 };
++    static const uint64_t zalign(64) k3k4[] = { 0x0154442bd4, 0x01c6e41596,
++                                                0x0154442bd4, 0x01c6e41596,
++                                                0x0154442bd4, 0x01c6e41596,
++                                                0x0154442bd4, 0x01c6e41596 };
++    static const uint64_t zalign(16) k5k6[] = { 0x01751997d0, 0x00ccaa009e };
++    static const uint64_t zalign(16) k7k8[] = { 0x0163cd6124, 0x0000000000 };
++    static const uint64_t zalign(16) poly[] = { 0x01db710641, 0x01f7011641 };
++    __m512i x0, x1, x2, x3, x4, x5, x6, x7, x8, y5, y6, y7, y8;
++    __m128i a0, a1, a2, a3;
++
++    /*
++     * There's at least one block of 256.
++     */
++    x1 = _mm512_loadu_si512((__m512i *)(buf + 0x00));
++    x2 = _mm512_loadu_si512((__m512i *)(buf + 0x40));
++    x3 = _mm512_loadu_si512((__m512i *)(buf + 0x80));
++    x4 = _mm512_loadu_si512((__m512i *)(buf + 0xC0));
++
++    x1 = _mm512_xor_si512(x1, _mm512_castsi128_si512(_mm_cvtsi32_si128(crc)));
++
++    x0 = _mm512_load_si512((__m512i *)k1k2);
++
++    buf += 256;
++    len -= 256;
++
++    /*
++     * Parallel fold blocks of 256, if any.
++     */
++    while (len >= 256)
++    {
++        x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
++        x6 = _mm512_clmulepi64_epi128(x2, x0, 0x00);
++        x7 = _mm512_clmulepi64_epi128(x3, x0, 0x00);
++        x8 = _mm512_clmulepi64_epi128(x4, x0, 0x00);
++
++
++        x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
++        x2 = _mm512_clmulepi64_epi128(x2, x0, 0x11);
++        x3 = _mm512_clmulepi64_epi128(x3, x0, 0x11);
++        x4 = _mm512_clmulepi64_epi128(x4, x0, 0x11);
++
++        y5 = _mm512_loadu_si512((__m512i *)(buf + 0x00));
++        y6 = _mm512_loadu_si512((__m512i *)(buf + 0x40));
++        y7 = _mm512_loadu_si512((__m512i *)(buf + 0x80));
++        y8 = _mm512_loadu_si512((__m512i *)(buf + 0xC0));
++
++        x1 = _mm512_xor_si512(x1, x5);
++        x2 = _mm512_xor_si512(x2, x6);
++        x3 = _mm512_xor_si512(x3, x7);
++        x4 = _mm512_xor_si512(x4, x8);
++
++        x1 = _mm512_xor_si512(x1, y5);
++        x2 = _mm512_xor_si512(x2, y6);
++        x3 = _mm512_xor_si512(x3, y7);
++        x4 = _mm512_xor_si512(x4, y8);
++
++        buf += 256;
++        len -= 256;
++    }
++
++    /*
++     * Fold into 512-bits.
++     */
++    x0 = _mm512_load_si512((__m512i *)k3k4);
++
++    x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
++    x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
++    x1 = _mm512_xor_si512(x1, x2);
++    x1 = _mm512_xor_si512(x1, x5);
++
++    x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
++    x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
++    x1 = _mm512_xor_si512(x1, x3);
++    x1 = _mm512_xor_si512(x1, x5);
++
++    x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
++    x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
++    x1 = _mm512_xor_si512(x1, x4);
++    x1 = _mm512_xor_si512(x1, x5);
++
++    /*
++     * Single fold blocks of 64, if any.
++     */
++    while (len >= 64)
++    {
++        x2 = _mm512_loadu_si512((__m512i *)buf);
++
++        x5 = _mm512_clmulepi64_epi128(x1, x0, 0x00);
++        x1 = _mm512_clmulepi64_epi128(x1, x0, 0x11);
++        x1 = _mm512_xor_si512(x1, x2);
++        x1 = _mm512_xor_si512(x1, x5);
++
++        buf += 64;
++        len -= 64;
++    }
++
++    /*
++     * Fold 512-bits to 384-bits.
++     */
++    a0 = _mm_load_si128((__m128i *)k5k6);
++
++    a1 = _mm512_extracti32x4_epi32(x1, 0);
++    a2 = _mm512_extracti32x4_epi32(x1, 1);
++
++    a3 = _mm_clmulepi64_si128(a1, a0, 0x00);
++    a1 = _mm_clmulepi64_si128(a1, a0, 0x11);
++
++    a1 = _mm_xor_si128(a1, a3);
++    a1 = _mm_xor_si128(a1, a2);
++
++    /*
++     * Fold 384-bits to 256-bits.
++     */
++    a2 = _mm512_extracti32x4_epi32(x1, 2);
++    a3 = _mm_clmulepi64_si128(a1, a0, 0x00);
++    a1 = _mm_clmulepi64_si128(a1, a0, 0x11);
++    a1 = _mm_xor_si128(a1, a3);
++    a1 = _mm_xor_si128(a1, a2);
++
++    /*
++     * Fold 256-bits to 128-bits.
++     */
++    a2 = _mm512_extracti32x4_epi32(x1, 3);
++    a3 = _mm_clmulepi64_si128(a1, a0, 0x00);
++    a1 = _mm_clmulepi64_si128(a1, a0, 0x11);
++    a1 = _mm_xor_si128(a1, a3);
++    a1 = _mm_xor_si128(a1, a2);
++
++    /*
++     * Fold 128-bits to 64-bits.
++     */
++    a2 = _mm_clmulepi64_si128(a1, a0, 0x10);
++    a3 = _mm_setr_epi32(~0, 0, ~0, 0);
++    a1 = _mm_srli_si128(a1, 8);
++    a1 = _mm_xor_si128(a1, a2);
++
++    a0 = _mm_loadl_epi64((__m128i*)k7k8);
++    a2 = _mm_srli_si128(a1, 4);
++    a1 = _mm_and_si128(a1, a3);
++    a1 = _mm_clmulepi64_si128(a1, a0, 0x00);
++    a1 = _mm_xor_si128(a1, a2);
++
++    /*
++     * Barret reduce to 32-bits.
++     */
++    a0 = _mm_load_si128((__m128i*)poly);
++
++    a2 = _mm_and_si128(a1, a3);
++    a2 = _mm_clmulepi64_si128(a2, a0, 0x10);
++    a2 = _mm_and_si128(a2, a3);
++    a2 = _mm_clmulepi64_si128(a2, a0, 0x00);
++    a1 = _mm_xor_si128(a1, a2);
++
++    /*
++     * Return the crc32.
++     */
++    return _mm_extract_epi32(a1, 1);
++}
++
++#elif defined(CRC32_SIMD_SSE42_PCLMUL)
++
++/*
++ * crc32_sse42_simd_(): compute the crc32 of the buffer, where the buffer
++ * length must be at least 64, and a multiple of 16.
++ */
++
+ #include <emmintrin.h>
+ #include <smmintrin.h>
+ #include <wmmintrin.h>
+diff --git a/crc32_simd.h b/crc32_simd.h
+index c0346dc..8462464 100644
+--- a/crc32_simd.h
++++ b/crc32_simd.h
+@@ -19,12 +19,18 @@ uint32_t ZLIB_INTERNAL crc32_sse42_simd_(const unsigned char* buf,
+                                          z_size_t len,
+                                          uint32_t crc);
+ 
++uint32_t ZLIB_INTERNAL crc32_avx512_simd_(const unsigned char* buf,
++                                          z_size_t len,
++                                          uint32_t crc);
++
+ /*
+  * crc32_sse42_simd_ buffer size constraints: see the use in zlib/crc32.c
+  * for computing the crc32 of an arbitrary length buffer.
+  */
+ #define Z_CRC32_SSE42_MINIMUM_LENGTH 64
+ #define Z_CRC32_SSE42_CHUNKSIZE_MASK 15
++#define Z_CRC32_AVX512_MINIMUM_LENGTH 256
++#define Z_CRC32_AVX512_CHUNKSIZE_MASK 63
+ 
+ /*
+  * CRC32 checksums using ARMv8-a crypto instructions.
+-- 
+2.34.1
+
diff --git a/deps/v8/third_party/zlib/patches/0012-lfs-open64.patch b/deps/v8/third_party/zlib/patches/0012-lfs-open64.patch
new file mode 100644
index 00000000000000..70e7b687a72941
--- /dev/null
+++ b/deps/v8/third_party/zlib/patches/0012-lfs-open64.patch
@@ -0,0 +1,40 @@
+From 6f21cb4b209d750486ede5472fdf7e35cf5ac3aa Mon Sep 17 00:00:00 2001
+From: Ramin Halavati <rhalavati@chromium.org>
+Date: Wed, 17 May 2023 15:21:43 +0200
+Subject: [PATCH] Add open64 for Large File System support to gzlib.
+
+---
+ third_party/zlib/gzlib.c | 5 ++++-
+ 1 file changed, 4 insertions(+), 1 deletion(-)
+
+diff --git a/third_party/zlib/gzlib.c b/third_party/zlib/gzlib.c
+index 55da46a453fd1..bbdb797e8079d 100644
+--- a/third_party/zlib/gzlib.c
++++ b/third_party/zlib/gzlib.c
+@@ -7,11 +7,14 @@
+ 
+ #if defined(_WIN32) && !defined(__BORLANDC__)
+ #  define LSEEK _lseeki64
++#  define OPEN  open
+ #else
+ #if defined(_LARGEFILE64_SOURCE) && _LFS64_LARGEFILE-0
+ #  define LSEEK lseek64
++#  define OPEN  open64
+ #else
+ #  define LSEEK lseek
++#  define OPEN  open
+ #endif
+ #endif
+ 
+@@ -244,7 +247,7 @@ local gzFile gz_open(path, fd, mode)
+ #ifdef WIDECHAR
+         fd == -2 ? _wopen(path, oflag, 0666) :
+ #endif
+-        open((const char *)path, oflag, 0666));
++        OPEN((const char *)path, oflag, 0666));
+     if (state->fd == -1) {
+         free(state->path);
+         free(state);
+-- 
+2.40.1.606.ga4b1b128d6-goog
+
diff --git a/deps/v8/third_party/zlib/patches/0013-cpu-feature-detection-for-arm.patch b/deps/v8/third_party/zlib/patches/0013-cpu-feature-detection-for-arm.patch
new file mode 100644
index 00000000000000..0547851fe5d99d
--- /dev/null
+++ b/deps/v8/third_party/zlib/patches/0013-cpu-feature-detection-for-arm.patch
@@ -0,0 +1,30 @@
+From c43ba7a55f091c0dcbfd8d89f7a5121269ce1b81 Mon Sep 17 00:00:00 2001
+From: Ho Cheung <uioptt24@gmail.com>
+Date: Thu, 27 Jul 2023 09:47:52 +0800
+Subject: [PATCH] [zlib] Perform CPU feature detection for ARM inside adler32()
+
+Perform CPU feature detection for ARM within adler32() to have the same
+behavior as x86.
+
+---
+ third_party/zlib/adler32.c | 4 ++--
+ 1 file changed, 2 insertions(+), 2 deletions(-)
+
+diff --git a/third_party/zlib/adler32.c b/third_party/zlib/adler32.c
+index 81c584f68e233..99a294496f7eb 100644
+--- a/third_party/zlib/adler32.c
++++ b/third_party/zlib/adler32.c
+@@ -90,9 +90,9 @@ uLong ZEXPORT adler32_z(uLong adler, const Bytef *buf, z_size_t len) {
+         return adler | (sum2 << 16);
+     }
+
+-#if defined(ADLER32_SIMD_SSSE3)
++#if defined(ADLER32_SIMD_SSSE3) || defined(ADLER32_SIMD_NEON)
+     /*
+-     * Use SSSE3 to compute the adler32. Since this routine can be
++     * Use SIMD to compute the adler32. Since this function can be
+      * freely used, check CPU features here. zlib convention is to
+      * call adler32(0, NULL, 0), before making calls to adler32().
+      * So this is a good early (and infrequent) place to cache CPU
+--
+2.41.0.windows.3
diff --git a/deps/v8/third_party/zlib/trees.c b/deps/v8/third_party/zlib/trees.c
index 5f305c47221e90..8dbdc40bacce1d 100644
--- a/deps/v8/third_party/zlib/trees.c
+++ b/deps/v8/third_party/zlib/trees.c
@@ -122,39 +122,116 @@ struct static_tree_desc_s {
     int     max_length;          /* max bit length for the codes */
 };
 
-local const static_tree_desc  static_l_desc =
+#ifdef NO_INIT_GLOBAL_POINTERS
+#  define TCONST
+#else
+#  define TCONST const
+#endif
+
+local TCONST static_tree_desc static_l_desc =
 {static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
 
-local const static_tree_desc  static_d_desc =
+local TCONST static_tree_desc static_d_desc =
 {static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS};
 
-local const static_tree_desc  static_bl_desc =
+local TCONST static_tree_desc static_bl_desc =
 {(const ct_data *)0, extra_blbits, 0,   BL_CODES, MAX_BL_BITS};
 
 /* ===========================================================================
- * Local (static) routines in this file.
+ * Output a short LSB first on the stream.
+ * IN assertion: there is enough room in pendingBuf.
+ */
+#define put_short(s, w) { \
+    put_byte(s, (uch)((w) & 0xff)); \
+    put_byte(s, (uch)((ush)(w) >> 8)); \
+}
+
+/* ===========================================================================
+ * Reverse the first len bits of a code, using straightforward code (a faster
+ * method would use a table)
+ * IN assertion: 1 <= len <= 15
  */
+local unsigned bi_reverse(unsigned code, int len) {
+    register unsigned res = 0;
+    do {
+        res |= code & 1;
+        code >>= 1, res <<= 1;
+    } while (--len > 0);
+    return res >> 1;
+}
 
-local void tr_static_init OF((void));
-local void init_block     OF((deflate_state *s));
-local void pqdownheap     OF((deflate_state *s, ct_data *tree, int k));
-local void gen_bitlen     OF((deflate_state *s, tree_desc *desc));
-local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
-local void build_tree     OF((deflate_state *s, tree_desc *desc));
-local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
-local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
-local int  build_bl_tree  OF((deflate_state *s));
-local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
-                              int blcodes));
-local void compress_block OF((deflate_state *s, const ct_data *ltree,
-                              const ct_data *dtree));
-local int  detect_data_type OF((deflate_state *s));
-local unsigned bi_reverse OF((unsigned code, int len));
-local void bi_windup      OF((deflate_state *s));
-local void bi_flush       OF((deflate_state *s));
+/* ===========================================================================
+ * Flush the bit buffer, keeping at most 7 bits in it.
+ */
+local void bi_flush(deflate_state *s) {
+    if (s->bi_valid == 16) {
+        put_short(s, s->bi_buf);
+        s->bi_buf = 0;
+        s->bi_valid = 0;
+    } else if (s->bi_valid >= 8) {
+        put_byte(s, (Byte)s->bi_buf);
+        s->bi_buf >>= 8;
+        s->bi_valid -= 8;
+    }
+}
+
+/* ===========================================================================
+ * Flush the bit buffer and align the output on a byte boundary
+ */
+local void bi_windup(deflate_state *s) {
+    if (s->bi_valid > 8) {
+        put_short(s, s->bi_buf);
+    } else if (s->bi_valid > 0) {
+        put_byte(s, (Byte)s->bi_buf);
+    }
+    s->bi_buf = 0;
+    s->bi_valid = 0;
+#ifdef ZLIB_DEBUG
+    s->bits_sent = (s->bits_sent + 7) & ~7;
+#endif
+}
+
+/* ===========================================================================
+ * Generate the codes for a given tree and bit counts (which need not be
+ * optimal).
+ * IN assertion: the array bl_count contains the bit length statistics for
+ * the given tree and the field len is set for all tree elements.
+ * OUT assertion: the field code is set for all tree elements of non
+ *     zero code length.
+ */
+local void gen_codes(ct_data *tree, int max_code, ushf *bl_count) {
+    ush next_code[MAX_BITS+1]; /* next code value for each bit length */
+    unsigned code = 0;         /* running code value */
+    int bits;                  /* bit index */
+    int n;                     /* code index */
+
+    /* The distribution counts are first used to generate the code values
+     * without bit reversal.
+     */
+    for (bits = 1; bits <= MAX_BITS; bits++) {
+        code = (code + bl_count[bits - 1]) << 1;
+        next_code[bits] = (ush)code;
+    }
+    /* Check that the bit counts in bl_count are consistent. The last code
+     * must be all ones.
+     */
+    Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
+            "inconsistent bit counts");
+    Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
+
+    for (n = 0;  n <= max_code; n++) {
+        int len = tree[n].Len;
+        if (len == 0) continue;
+        /* Now reverse the bits */
+        tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
+
+        Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
+            n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
+    }
+}
 
 #ifdef GEN_TREES_H
-local void gen_trees_header OF((void));
+local void gen_trees_header(void);
 #endif
 
 #ifndef ZLIB_DEBUG
@@ -167,27 +244,12 @@ local void gen_trees_header OF((void));
        send_bits(s, tree[c].Code, tree[c].Len); }
 #endif
 
-/* ===========================================================================
- * Output a short LSB first on the stream.
- * IN assertion: there is enough room in pendingBuf.
- */
-#define put_short(s, w) { \
-    put_byte(s, (uch)((w) & 0xff)); \
-    put_byte(s, (uch)((ush)(w) >> 8)); \
-}
-
 /* ===========================================================================
  * Send a value on a given number of bits.
  * IN assertion: length <= 16 and value fits in length bits.
  */
 #ifdef ZLIB_DEBUG
-local void send_bits      OF((deflate_state *s, int value, int length));
-
-local void send_bits(s, value, length)
-    deflate_state *s;
-    int value;  /* value to send */
-    int length; /* number of bits */
-{
+local void send_bits(deflate_state *s, int value, int length) {
     Tracevv((stderr," l %2d v %4x ", length, value));
     Assert(length > 0 && length <= 15, "invalid length");
     s->bits_sent += (ulg)length;
@@ -229,8 +291,7 @@ local void send_bits(s, value, length)
 /* ===========================================================================
  * Initialize the various 'constant' tables.
  */
-local void tr_static_init()
-{
+local void tr_static_init(void) {
 #if defined(GEN_TREES_H) || !defined(STDC)
     static int static_init_done = 0;
     int n;        /* iterates over tree elements */
@@ -323,8 +384,7 @@ local void tr_static_init()
       ((i) == (last)? "\n};\n\n" :    \
        ((i) % (width) == (width) - 1 ? ",\n" : ", "))
 
-void gen_trees_header()
-{
+void gen_trees_header(void) {
     FILE *header = fopen("trees.h", "w");
     int i;
 
@@ -373,12 +433,26 @@ void gen_trees_header()
 }
 #endif /* GEN_TREES_H */
 
+/* ===========================================================================
+ * Initialize a new block.
+ */
+local void init_block(deflate_state *s) {
+    int n; /* iterates over tree elements */
+
+    /* Initialize the trees. */
+    for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
+    for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
+    for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
+
+    s->dyn_ltree[END_BLOCK].Freq = 1;
+    s->opt_len = s->static_len = 0L;
+    s->sym_next = s->matches = 0;
+}
+
 /* ===========================================================================
  * Initialize the tree data structures for a new zlib stream.
  */
-void ZLIB_INTERNAL _tr_init(s)
-    deflate_state *s;
-{
+void ZLIB_INTERNAL _tr_init(deflate_state *s) {
     tr_static_init();
 
     s->l_desc.dyn_tree = s->dyn_ltree;
@@ -401,24 +475,6 @@ void ZLIB_INTERNAL _tr_init(s)
     init_block(s);
 }
 
-/* ===========================================================================
- * Initialize a new block.
- */
-local void init_block(s)
-    deflate_state *s;
-{
-    int n; /* iterates over tree elements */
-
-    /* Initialize the trees. */
-    for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
-    for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
-    for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
-
-    s->dyn_ltree[END_BLOCK].Freq = 1;
-    s->opt_len = s->static_len = 0L;
-    s->sym_next = s->matches = 0;
-}
-
 #define SMALLEST 1
 /* Index within the heap array of least frequent node in the Huffman tree */
 
@@ -448,11 +504,7 @@ local void init_block(s)
  * when the heap property is re-established (each father smaller than its
  * two sons).
  */
-local void pqdownheap(s, tree, k)
-    deflate_state *s;
-    ct_data *tree;  /* the tree to restore */
-    int k;               /* node to move down */
-{
+local void pqdownheap(deflate_state *s, ct_data *tree, int k) {
     int v = s->heap[k];
     int j = k << 1;  /* left son of k */
     while (j <= s->heap_len) {
@@ -483,10 +535,7 @@ local void pqdownheap(s, tree, k)
  *     The length opt_len is updated; static_len is also updated if stree is
  *     not null.
  */
-local void gen_bitlen(s, desc)
-    deflate_state *s;
-    tree_desc *desc;    /* the tree descriptor */
-{
+local void gen_bitlen(deflate_state *s, tree_desc *desc) {
     ct_data *tree        = desc->dyn_tree;
     int max_code         = desc->max_code;
     const ct_data *stree = desc->stat_desc->static_tree;
@@ -561,48 +610,9 @@ local void gen_bitlen(s, desc)
     }
 }
 
-/* ===========================================================================
- * Generate the codes for a given tree and bit counts (which need not be
- * optimal).
- * IN assertion: the array bl_count contains the bit length statistics for
- * the given tree and the field len is set for all tree elements.
- * OUT assertion: the field code is set for all tree elements of non
- *     zero code length.
- */
-local void gen_codes(tree, max_code, bl_count)
-    ct_data *tree;             /* the tree to decorate */
-    int max_code;              /* largest code with non zero frequency */
-    ushf *bl_count;            /* number of codes at each bit length */
-{
-    ush next_code[MAX_BITS+1]; /* next code value for each bit length */
-    unsigned code = 0;         /* running code value */
-    int bits;                  /* bit index */
-    int n;                     /* code index */
-
-    /* The distribution counts are first used to generate the code values
-     * without bit reversal.
-     */
-    for (bits = 1; bits <= MAX_BITS; bits++) {
-        code = (code + bl_count[bits - 1]) << 1;
-        next_code[bits] = (ush)code;
-    }
-    /* Check that the bit counts in bl_count are consistent. The last code
-     * must be all ones.
-     */
-    Assert (code + bl_count[MAX_BITS] - 1 == (1 << MAX_BITS) - 1,
-            "inconsistent bit counts");
-    Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
-
-    for (n = 0;  n <= max_code; n++) {
-        int len = tree[n].Len;
-        if (len == 0) continue;
-        /* Now reverse the bits */
-        tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
-
-        Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
-            n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
-    }
-}
+#ifdef DUMP_BL_TREE
+#  include <stdio.h>
+#endif
 
 /* ===========================================================================
  * Construct one Huffman tree and assigns the code bit strings and lengths.
@@ -612,10 +622,7 @@ local void gen_codes(tree, max_code, bl_count)
  *     and corresponding code. The length opt_len is updated; static_len is
  *     also updated if stree is not null. The field max_code is set.
  */
-local void build_tree(s, desc)
-    deflate_state *s;
-    tree_desc *desc; /* the tree descriptor */
-{
+local void build_tree(deflate_state *s, tree_desc *desc) {
     ct_data *tree         = desc->dyn_tree;
     const ct_data *stree  = desc->stat_desc->static_tree;
     int elems             = desc->stat_desc->elems;
@@ -700,11 +707,7 @@ local void build_tree(s, desc)
  * Scan a literal or distance tree to determine the frequencies of the codes
  * in the bit length tree.
  */
-local void scan_tree(s, tree, max_code)
-    deflate_state *s;
-    ct_data *tree;   /* the tree to be scanned */
-    int max_code;    /* and its largest code of non zero frequency */
-{
+local void scan_tree(deflate_state *s, ct_data *tree, int max_code) {
     int n;                     /* iterates over all tree elements */
     int prevlen = -1;          /* last emitted length */
     int curlen;                /* length of current code */
@@ -745,11 +748,7 @@ local void scan_tree(s, tree, max_code)
  * Send a literal or distance tree in compressed form, using the codes in
  * bl_tree.
  */
-local void send_tree(s, tree, max_code)
-    deflate_state *s;
-    ct_data *tree; /* the tree to be scanned */
-    int max_code;       /* and its largest code of non zero frequency */
-{
+local void send_tree(deflate_state *s, ct_data *tree, int max_code) {
     int n;                     /* iterates over all tree elements */
     int prevlen = -1;          /* last emitted length */
     int curlen;                /* length of current code */
@@ -796,9 +795,7 @@ local void send_tree(s, tree, max_code)
  * Construct the Huffman tree for the bit lengths and return the index in
  * bl_order of the last bit length code to send.
  */
-local int build_bl_tree(s)
-    deflate_state *s;
-{
+local int build_bl_tree(deflate_state *s) {
     int max_blindex;  /* index of last bit length code of non zero freq */
 
     /* Determine the bit length frequencies for literal and distance trees */
@@ -831,10 +828,8 @@ local int build_bl_tree(s)
  * lengths of the bit length codes, the literal tree and the distance tree.
  * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
  */
-local void send_all_trees(s, lcodes, dcodes, blcodes)
-    deflate_state *s;
-    int lcodes, dcodes, blcodes; /* number of codes for each tree */
-{
+local void send_all_trees(deflate_state *s, int lcodes, int dcodes,
+                          int blcodes) {
     int rank;                    /* index in bl_order */
 
     Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
@@ -860,12 +855,8 @@ local void send_all_trees(s, lcodes, dcodes, blcodes)
 /* ===========================================================================
  * Send a stored block
  */
-void ZLIB_INTERNAL _tr_stored_block(s, buf, stored_len, last)
-    deflate_state *s;
-    charf *buf;       /* input block */
-    ulg stored_len;   /* length of input block */
-    int last;         /* one if this is the last block for a file */
-{
+void ZLIB_INTERNAL _tr_stored_block(deflate_state *s, charf *buf,
+                                    ulg stored_len, int last) {
     send_bits(s, (STORED_BLOCK<<1) + last, 3);  /* send block type */
     bi_windup(s);        /* align on byte boundary */
     put_short(s, (ush)stored_len);
@@ -884,9 +875,7 @@ void ZLIB_INTERNAL _tr_stored_block(s, buf, stored_len, last)
 /* ===========================================================================
  * Flush the bits in the bit buffer to pending output (leaves at most 7 bits)
  */
-void ZLIB_INTERNAL _tr_flush_bits(s)
-    deflate_state *s;
-{
+void ZLIB_INTERNAL _tr_flush_bits(deflate_state *s) {
     bi_flush(s);
 }
 
@@ -894,9 +883,7 @@ void ZLIB_INTERNAL _tr_flush_bits(s)
  * Send one empty static block to give enough lookahead for inflate.
  * This takes 10 bits, of which 7 may remain in the bit buffer.
  */
-void ZLIB_INTERNAL _tr_align(s)
-    deflate_state *s;
-{
+void ZLIB_INTERNAL _tr_align(deflate_state *s) {
     send_bits(s, STATIC_TREES<<1, 3);
     send_code(s, END_BLOCK, static_ltree);
 #ifdef ZLIB_DEBUG
@@ -905,16 +892,99 @@ void ZLIB_INTERNAL _tr_align(s)
     bi_flush(s);
 }
 
+/* ===========================================================================
+ * Send the block data compressed using the given Huffman trees
+ */
+local void compress_block(deflate_state *s, const ct_data *ltree,
+                          const ct_data *dtree) {
+    unsigned dist;      /* distance of matched string */
+    int lc;             /* match length or unmatched char (if dist == 0) */
+    unsigned sx = 0;    /* running index in sym_buf */
+    unsigned code;      /* the code to send */
+    int extra;          /* number of extra bits to send */
+
+    if (s->sym_next != 0) do {
+        dist = s->sym_buf[sx++] & 0xff;
+        dist += (unsigned)(s->sym_buf[sx++] & 0xff) << 8;
+        lc = s->sym_buf[sx++];
+        if (dist == 0) {
+            send_code(s, lc, ltree); /* send a literal byte */
+            Tracecv(isgraph(lc), (stderr," '%c' ", lc));
+        } else {
+            /* Here, lc is the match length - MIN_MATCH */
+            code = _length_code[lc];
+            send_code(s, code + LITERALS + 1, ltree);   /* send length code */
+            extra = extra_lbits[code];
+            if (extra != 0) {
+                lc -= base_length[code];
+                send_bits(s, lc, extra);       /* send the extra length bits */
+            }
+            dist--; /* dist is now the match distance - 1 */
+            code = d_code(dist);
+            Assert (code < D_CODES, "bad d_code");
+
+            send_code(s, code, dtree);       /* send the distance code */
+            extra = extra_dbits[code];
+            if (extra != 0) {
+                dist -= (unsigned)base_dist[code];
+                send_bits(s, dist, extra);   /* send the extra distance bits */
+            }
+        } /* literal or match pair ? */
+
+        /* Check that the overlay between pending_buf and sym_buf is ok: */
+        Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow");
+
+    } while (sx < s->sym_next);
+
+    send_code(s, END_BLOCK, ltree);
+}
+
+/* ===========================================================================
+ * Check if the data type is TEXT or BINARY, using the following algorithm:
+ * - TEXT if the two conditions below are satisfied:
+ *    a) There are no non-portable control characters belonging to the
+ *       "block list" (0..6, 14..25, 28..31).
+ *    b) There is at least one printable character belonging to the
+ *       "allow list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).
+ * - BINARY otherwise.
+ * - The following partially-portable control characters form a
+ *   "gray list" that is ignored in this detection algorithm:
+ *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).
+ * IN assertion: the fields Freq of dyn_ltree are set.
+ */
+local int detect_data_type(deflate_state *s) {
+    /* block_mask is the bit mask of block-listed bytes
+     * set bits 0..6, 14..25, and 28..31
+     * 0xf3ffc07f = binary 11110011111111111100000001111111
+     */
+    unsigned long block_mask = 0xf3ffc07fUL;
+    int n;
+
+    /* Check for non-textual ("block-listed") bytes. */
+    for (n = 0; n <= 31; n++, block_mask >>= 1)
+        if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))
+            return Z_BINARY;
+
+    /* Check for textual ("allow-listed") bytes. */
+    if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
+            || s->dyn_ltree[13].Freq != 0)
+        return Z_TEXT;
+    for (n = 32; n < LITERALS; n++)
+        if (s->dyn_ltree[n].Freq != 0)
+            return Z_TEXT;
+
+    /* There are no "block-listed" or "allow-listed" bytes:
+     * this stream either is empty or has tolerated ("gray-listed") bytes only.
+     */
+    return Z_BINARY;
+}
+
 /* ===========================================================================
  * Determine the best encoding for the current block: dynamic trees, static
  * trees or store, and write out the encoded block.
  */
-void ZLIB_INTERNAL _tr_flush_block(s, buf, stored_len, last)
-    deflate_state *s;
-    charf *buf;       /* input block, or NULL if too old */
-    ulg stored_len;   /* length of input block */
-    int last;         /* one if this is the last block for a file */
-{
+void ZLIB_INTERNAL _tr_flush_block(deflate_state *s, charf *buf,
+                                   ulg stored_len, int last) {
     ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
     int max_blindex = 0;  /* index of last bit length code of non zero freq */
 
@@ -1011,11 +1081,7 @@ void ZLIB_INTERNAL _tr_flush_block(s, buf, stored_len, last)
  * Save the match info and tally the frequency counts. Return true if
  * the current block must be flushed.
  */
-int ZLIB_INTERNAL _tr_tally(s, dist, lc)
-    deflate_state *s;
-    unsigned dist;  /* distance of matched string */
-    unsigned lc;    /* match length - MIN_MATCH or unmatched char (dist==0) */
-{
+int ZLIB_INTERNAL _tr_tally(deflate_state *s, unsigned dist, unsigned lc) {
     s->sym_buf[s->sym_next++] = (uch)dist;
     s->sym_buf[s->sym_next++] = (uch)(dist >> 8);
     s->sym_buf[s->sym_next++] = (uch)lc;
@@ -1035,147 +1101,3 @@ int ZLIB_INTERNAL _tr_tally(s, dist, lc)
     }
     return (s->sym_next == s->sym_end);
 }
-
-/* ===========================================================================
- * Send the block data compressed using the given Huffman trees
- */
-local void compress_block(s, ltree, dtree)
-    deflate_state *s;
-    const ct_data *ltree; /* literal tree */
-    const ct_data *dtree; /* distance tree */
-{
-    unsigned dist;      /* distance of matched string */
-    int lc;             /* match length or unmatched char (if dist == 0) */
-    unsigned sx = 0;    /* running index in sym_buf */
-    unsigned code;      /* the code to send */
-    int extra;          /* number of extra bits to send */
-
-    if (s->sym_next != 0) do {
-        dist = s->sym_buf[sx++] & 0xff;
-        dist += (unsigned)(s->sym_buf[sx++] & 0xff) << 8;
-        lc = s->sym_buf[sx++];
-        if (dist == 0) {
-            send_code(s, lc, ltree); /* send a literal byte */
-            Tracecv(isgraph(lc), (stderr," '%c' ", lc));
-        } else {
-            /* Here, lc is the match length - MIN_MATCH */
-            code = _length_code[lc];
-            send_code(s, code + LITERALS + 1, ltree);   /* send length code */
-            extra = extra_lbits[code];
-            if (extra != 0) {
-                lc -= base_length[code];
-                send_bits(s, lc, extra);       /* send the extra length bits */
-            }
-            dist--; /* dist is now the match distance - 1 */
-            code = d_code(dist);
-            Assert (code < D_CODES, "bad d_code");
-
-            send_code(s, code, dtree);       /* send the distance code */
-            extra = extra_dbits[code];
-            if (extra != 0) {
-                dist -= (unsigned)base_dist[code];
-                send_bits(s, dist, extra);   /* send the extra distance bits */
-            }
-        } /* literal or match pair ? */
-
-        /* Check that the overlay between pending_buf and sym_buf is ok: */
-        Assert(s->pending < s->lit_bufsize + sx, "pendingBuf overflow");
-
-    } while (sx < s->sym_next);
-
-    send_code(s, END_BLOCK, ltree);
-}
-
-/* ===========================================================================
- * Check if the data type is TEXT or BINARY, using the following algorithm:
- * - TEXT if the two conditions below are satisfied:
- *    a) There are no non-portable control characters belonging to the
- *       "block list" (0..6, 14..25, 28..31).
- *    b) There is at least one printable character belonging to the
- *       "allow list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).
- * - BINARY otherwise.
- * - The following partially-portable control characters form a
- *   "gray list" that is ignored in this detection algorithm:
- *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).
- * IN assertion: the fields Freq of dyn_ltree are set.
- */
-local int detect_data_type(s)
-    deflate_state *s;
-{
-    /* block_mask is the bit mask of block-listed bytes
-     * set bits 0..6, 14..25, and 28..31
-     * 0xf3ffc07f = binary 11110011111111111100000001111111
-     */
-    unsigned long block_mask = 0xf3ffc07fUL;
-    int n;
-
-    /* Check for non-textual ("block-listed") bytes. */
-    for (n = 0; n <= 31; n++, block_mask >>= 1)
-        if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))
-            return Z_BINARY;
-
-    /* Check for textual ("allow-listed") bytes. */
-    if (s->dyn_ltree[9].Freq != 0 || s->dyn_ltree[10].Freq != 0
-            || s->dyn_ltree[13].Freq != 0)
-        return Z_TEXT;
-    for (n = 32; n < LITERALS; n++)
-        if (s->dyn_ltree[n].Freq != 0)
-            return Z_TEXT;
-
-    /* There are no "block-listed" or "allow-listed" bytes:
-     * this stream either is empty or has tolerated ("gray-listed") bytes only.
-     */
-    return Z_BINARY;
-}
-
-/* ===========================================================================
- * Reverse the first len bits of a code, using straightforward code (a faster
- * method would use a table)
- * IN assertion: 1 <= len <= 15
- */
-local unsigned bi_reverse(code, len)
-    unsigned code; /* the value to invert */
-    int len;       /* its bit length */
-{
-    register unsigned res = 0;
-    do {
-        res |= code & 1;
-        code >>= 1, res <<= 1;
-    } while (--len > 0);
-    return res >> 1;
-}
-
-/* ===========================================================================
- * Flush the bit buffer, keeping at most 7 bits in it.
- */
-local void bi_flush(s)
-    deflate_state *s;
-{
-    if (s->bi_valid == 16) {
-        put_short(s, s->bi_buf);
-        s->bi_buf = 0;
-        s->bi_valid = 0;
-    } else if (s->bi_valid >= 8) {
-        put_byte(s, (Byte)s->bi_buf);
-        s->bi_buf >>= 8;
-        s->bi_valid -= 8;
-    }
-}
-
-/* ===========================================================================
- * Flush the bit buffer and align the output on a byte boundary
- */
-local void bi_windup(s)
-    deflate_state *s;
-{
-    if (s->bi_valid > 8) {
-        put_short(s, s->bi_buf);
-    } else if (s->bi_valid > 0) {
-        put_byte(s, (Byte)s->bi_buf);
-    }
-    s->bi_buf = 0;
-    s->bi_valid = 0;
-#ifdef ZLIB_DEBUG
-    s->bits_sent = (s->bits_sent + 7) & ~7;
-#endif
-}
diff --git a/deps/v8/third_party/zlib/uncompr.c b/deps/v8/third_party/zlib/uncompr.c
index f9532f46c1a69f..5e256663b4511c 100644
--- a/deps/v8/third_party/zlib/uncompr.c
+++ b/deps/v8/third_party/zlib/uncompr.c
@@ -24,12 +24,8 @@
    Z_DATA_ERROR if the input data was corrupted, including if the input data is
    an incomplete zlib stream.
 */
-int ZEXPORT uncompress2(dest, destLen, source, sourceLen)
-    Bytef *dest;
-    uLongf *destLen;
-    const Bytef *source;
-    uLong *sourceLen;
-{
+int ZEXPORT uncompress2(Bytef *dest, uLongf *destLen, const Bytef *source,
+                        uLong *sourceLen) {
     z_stream stream;
     int err;
     const uInt max = (uInt)-1;
@@ -83,11 +79,7 @@ int ZEXPORT uncompress2(dest, destLen, source, sourceLen)
            err;
 }
 
-int ZEXPORT uncompress(dest, destLen, source, sourceLen)
-    Bytef *dest;
-    uLongf *destLen;
-    const Bytef *source;
-    uLong sourceLen;
-{
+int ZEXPORT uncompress(Bytef *dest, uLongf *destLen, const Bytef *source,
+                       uLong sourceLen) {
     return uncompress2(dest, destLen, source, &sourceLen);
 }
diff --git a/deps/v8/third_party/zlib/zconf.h b/deps/v8/third_party/zlib/zconf.h
index f0848c022d386b..55fe101da64834 100644
--- a/deps/v8/third_party/zlib/zconf.h
+++ b/deps/v8/third_party/zlib/zconf.h
@@ -253,7 +253,11 @@
 #endif
 
 #ifdef Z_SOLO
-   typedef unsigned long z_size_t;
+#  ifdef _WIN64
+     typedef unsigned long long z_size_t;
+#  else
+     typedef unsigned long z_size_t;
+#  endif
 #else
 #  define z_longlong long long
 #  if defined(NO_SIZE_T)
@@ -535,7 +539,7 @@ typedef uLong FAR uLongf;
 #if !defined(_WIN32) && defined(Z_LARGE64)
 #  define z_off64_t off64_t
 #else
-#  if defined(_WIN32) && !defined(__GNUC__) && !defined(Z_SOLO)
+#  if defined(_WIN32) && !defined(__GNUC__)
 #    define z_off64_t __int64
 #  else
 #    define z_off64_t z_off_t
diff --git a/deps/v8/third_party/zlib/zconf.h.cmakein b/deps/v8/third_party/zlib/zconf.h.cmakein
index 247ba2461dd09e..310c43928a299f 100644
--- a/deps/v8/third_party/zlib/zconf.h.cmakein
+++ b/deps/v8/third_party/zlib/zconf.h.cmakein
@@ -243,7 +243,11 @@
 #endif
 
 #ifdef Z_SOLO
-   typedef unsigned long z_size_t;
+#  ifdef _WIN64
+     typedef unsigned long long z_size_t;
+#  else
+     typedef unsigned long z_size_t;
+#  endif
 #else
 #  define z_longlong long long
 #  if defined(NO_SIZE_T)
@@ -522,7 +526,7 @@ typedef uLong FAR uLongf;
 #if !defined(_WIN32) && defined(Z_LARGE64)
 #  define z_off64_t off64_t
 #else
-#  if defined(_WIN32) && !defined(__GNUC__) && !defined(Z_SOLO)
+#  if defined(_WIN32) && !defined(__GNUC__)
 #    define z_off64_t __int64
 #  else
 #    define z_off64_t z_off_t
diff --git a/deps/v8/third_party/zlib/zconf.h.in b/deps/v8/third_party/zlib/zconf.h.in
new file mode 100644
index 00000000000000..fb76ffe312ae45
--- /dev/null
+++ b/deps/v8/third_party/zlib/zconf.h.in
@@ -0,0 +1,551 @@
+/* zconf.h -- configuration of the zlib compression library
+ * Copyright (C) 1995-2016 Jean-loup Gailly, Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#ifndef ZCONF_H
+#define ZCONF_H
+
+/*
+ * If you *really* need a unique prefix for all types and library functions,
+ * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it.
+ * Even better than compiling with -DZ_PREFIX would be to use configure to set
+ * this permanently in zconf.h using "./configure --zprefix".
+ */
+#ifdef Z_PREFIX     /* may be set to #if 1 by ./configure */
+#  define Z_PREFIX_SET
+
+/* all linked symbols and init macros */
+#  define _dist_code            z__dist_code
+#  define _length_code          z__length_code
+#  define _tr_align             z__tr_align
+#  define _tr_flush_bits        z__tr_flush_bits
+#  define _tr_flush_block       z__tr_flush_block
+#  define _tr_init              z__tr_init
+#  define _tr_stored_block      z__tr_stored_block
+#  define _tr_tally             z__tr_tally
+#  define adler32               z_adler32
+#  define adler32_combine       z_adler32_combine
+#  define adler32_combine64     z_adler32_combine64
+#  define adler32_z             z_adler32_z
+#  ifndef Z_SOLO
+#    define compress              z_compress
+#    define compress2             z_compress2
+#    define compressBound         z_compressBound
+#  endif
+#  define crc32                 z_crc32
+#  define crc32_combine         z_crc32_combine
+#  define crc32_combine64       z_crc32_combine64
+#  define crc32_combine_gen     z_crc32_combine_gen
+#  define crc32_combine_gen64   z_crc32_combine_gen64
+#  define crc32_combine_op      z_crc32_combine_op
+#  define crc32_z               z_crc32_z
+#  define deflate               z_deflate
+#  define deflateBound          z_deflateBound
+#  define deflateCopy           z_deflateCopy
+#  define deflateEnd            z_deflateEnd
+#  define deflateGetDictionary  z_deflateGetDictionary
+#  define deflateInit           z_deflateInit
+#  define deflateInit2          z_deflateInit2
+#  define deflateInit2_         z_deflateInit2_
+#  define deflateInit_          z_deflateInit_
+#  define deflateParams         z_deflateParams
+#  define deflatePending        z_deflatePending
+#  define deflatePrime          z_deflatePrime
+#  define deflateReset          z_deflateReset
+#  define deflateResetKeep      z_deflateResetKeep
+#  define deflateSetDictionary  z_deflateSetDictionary
+#  define deflateSetHeader      z_deflateSetHeader
+#  define deflateTune           z_deflateTune
+#  define deflate_copyright     z_deflate_copyright
+#  define get_crc_table         z_get_crc_table
+#  ifndef Z_SOLO
+#    define gz_error              z_gz_error
+#    define gz_intmax             z_gz_intmax
+#    define gz_strwinerror        z_gz_strwinerror
+#    define gzbuffer              z_gzbuffer
+#    define gzclearerr            z_gzclearerr
+#    define gzclose               z_gzclose
+#    define gzclose_r             z_gzclose_r
+#    define gzclose_w             z_gzclose_w
+#    define gzdirect              z_gzdirect
+#    define gzdopen               z_gzdopen
+#    define gzeof                 z_gzeof
+#    define gzerror               z_gzerror
+#    define gzflush               z_gzflush
+#    define gzfread               z_gzfread
+#    define gzfwrite              z_gzfwrite
+#    define gzgetc                z_gzgetc
+#    define gzgetc_               z_gzgetc_
+#    define gzgets                z_gzgets
+#    define gzoffset              z_gzoffset
+#    define gzoffset64            z_gzoffset64
+#    define gzopen                z_gzopen
+#    define gzopen64              z_gzopen64
+#    ifdef _WIN32
+#      define gzopen_w              z_gzopen_w
+#    endif
+#    define gzprintf              z_gzprintf
+#    define gzputc                z_gzputc
+#    define gzputs                z_gzputs
+#    define gzread                z_gzread
+#    define gzrewind              z_gzrewind
+#    define gzseek                z_gzseek
+#    define gzseek64              z_gzseek64
+#    define gzsetparams           z_gzsetparams
+#    define gztell                z_gztell
+#    define gztell64              z_gztell64
+#    define gzungetc              z_gzungetc
+#    define gzvprintf             z_gzvprintf
+#    define gzwrite               z_gzwrite
+#  endif
+#  define inflate               z_inflate
+#  define inflateBack           z_inflateBack
+#  define inflateBackEnd        z_inflateBackEnd
+#  define inflateBackInit       z_inflateBackInit
+#  define inflateBackInit_      z_inflateBackInit_
+#  define inflateCodesUsed      z_inflateCodesUsed
+#  define inflateCopy           z_inflateCopy
+#  define inflateEnd            z_inflateEnd
+#  define inflateGetDictionary  z_inflateGetDictionary
+#  define inflateGetHeader      z_inflateGetHeader
+#  define inflateInit           z_inflateInit
+#  define inflateInit2          z_inflateInit2
+#  define inflateInit2_         z_inflateInit2_
+#  define inflateInit_          z_inflateInit_
+#  define inflateMark           z_inflateMark
+#  define inflatePrime          z_inflatePrime
+#  define inflateReset          z_inflateReset
+#  define inflateReset2         z_inflateReset2
+#  define inflateResetKeep      z_inflateResetKeep
+#  define inflateSetDictionary  z_inflateSetDictionary
+#  define inflateSync           z_inflateSync
+#  define inflateSyncPoint      z_inflateSyncPoint
+#  define inflateUndermine      z_inflateUndermine
+#  define inflateValidate       z_inflateValidate
+#  define inflate_copyright     z_inflate_copyright
+#  define inflate_fast          z_inflate_fast
+#  define inflate_table         z_inflate_table
+#  ifndef Z_SOLO
+#    define uncompress            z_uncompress
+#    define uncompress2           z_uncompress2
+#  endif
+#  define zError                z_zError
+#  ifndef Z_SOLO
+#    define zcalloc               z_zcalloc
+#    define zcfree                z_zcfree
+#  endif
+#  define zlibCompileFlags      z_zlibCompileFlags
+#  define zlibVersion           z_zlibVersion
+
+/* all zlib typedefs in zlib.h and zconf.h */
+#  define Byte                  z_Byte
+#  define Bytef                 z_Bytef
+#  define alloc_func            z_alloc_func
+#  define charf                 z_charf
+#  define free_func             z_free_func
+#  ifndef Z_SOLO
+#    define gzFile                z_gzFile
+#  endif
+#  define gz_header             z_gz_header
+#  define gz_headerp            z_gz_headerp
+#  define in_func               z_in_func
+#  define intf                  z_intf
+#  define out_func              z_out_func
+#  define uInt                  z_uInt
+#  define uIntf                 z_uIntf
+#  define uLong                 z_uLong
+#  define uLongf                z_uLongf
+#  define voidp                 z_voidp
+#  define voidpc                z_voidpc
+#  define voidpf                z_voidpf
+
+/* all zlib structs in zlib.h and zconf.h */
+#  define gz_header_s           z_gz_header_s
+#  define internal_state        z_internal_state
+
+#endif
+
+#if defined(__MSDOS__) && !defined(MSDOS)
+#  define MSDOS
+#endif
+#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2)
+#  define OS2
+#endif
+#if defined(_WINDOWS) && !defined(WINDOWS)
+#  define WINDOWS
+#endif
+#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__)
+#  ifndef WIN32
+#    define WIN32
+#  endif
+#endif
+#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32)
+#  if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__)
+#    ifndef SYS16BIT
+#      define SYS16BIT
+#    endif
+#  endif
+#endif
+
+/*
+ * Compile with -DMAXSEG_64K if the alloc function cannot allocate more
+ * than 64k bytes at a time (needed on systems with 16-bit int).
+ */
+#ifdef SYS16BIT
+#  define MAXSEG_64K
+#endif
+#ifdef MSDOS
+#  define UNALIGNED_OK
+#endif
+
+#ifdef __STDC_VERSION__
+#  ifndef STDC
+#    define STDC
+#  endif
+#  if __STDC_VERSION__ >= 199901L
+#    ifndef STDC99
+#      define STDC99
+#    endif
+#  endif
+#endif
+#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__))
+#  define STDC
+#endif
+
+#if defined(__OS400__) && !defined(STDC)    /* iSeries (formerly AS/400). */
+#  define STDC
+#endif
+
+#ifndef STDC
+#  ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */
+#    define const       /* note: need a more gentle solution here */
+#  endif
+#endif
+
+#if defined(ZLIB_CONST) && !defined(z_const)
+#  define z_const const
+#else
+#  define z_const
+#endif
+
+#ifdef Z_SOLO
+#  ifdef _WIN64
+     typedef unsigned long long z_size_t;
+#  else
+     typedef unsigned long z_size_t;
+#  endif
+#else
+#  define z_longlong long long
+#  if defined(NO_SIZE_T)
+     typedef unsigned NO_SIZE_T z_size_t;
+#  elif defined(STDC)
+#    include <stddef.h>
+     typedef size_t z_size_t;
+#  else
+     typedef unsigned long z_size_t;
+#  endif
+#  undef z_longlong
+#endif
+
+/* Maximum value for memLevel in deflateInit2 */
+#ifndef MAX_MEM_LEVEL
+#  ifdef MAXSEG_64K
+#    define MAX_MEM_LEVEL 8
+#  else
+#    define MAX_MEM_LEVEL 9
+#  endif
+#endif
+
+/* Maximum value for windowBits in deflateInit2 and inflateInit2.
+ * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files
+ * created by gzip. (Files created by minigzip can still be extracted by
+ * gzip.)
+ */
+#ifndef MAX_WBITS
+#  define MAX_WBITS   15 /* 32K LZ77 window */
+#endif
+
+/* The memory requirements for deflate are (in bytes):
+            (1 << (windowBits+2)) +  (1 << (memLevel+9))
+ that is: 128K for windowBits=15  +  128K for memLevel = 8  (default values)
+ plus a few kilobytes for small objects. For example, if you want to reduce
+ the default memory requirements from 256K to 128K, compile with
+     make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
+ Of course this will generally degrade compression (there's no free lunch).
+
+   The memory requirements for inflate are (in bytes) 1 << windowBits
+ that is, 32K for windowBits=15 (default value) plus about 7 kilobytes
+ for small objects.
+*/
+
+                        /* Type declarations */
+
+#ifndef OF /* function prototypes */
+#  ifdef STDC
+#    define OF(args)  args
+#  else
+#    define OF(args)  ()
+#  endif
+#endif
+
+#ifndef Z_ARG /* function prototypes for stdarg */
+#  if defined(STDC) || defined(Z_HAVE_STDARG_H)
+#    define Z_ARG(args)  args
+#  else
+#    define Z_ARG(args)  ()
+#  endif
+#endif
+
+/* The following definitions for FAR are needed only for MSDOS mixed
+ * model programming (small or medium model with some far allocations).
+ * This was tested only with MSC; for other MSDOS compilers you may have
+ * to define NO_MEMCPY in zutil.h.  If you don't need the mixed model,
+ * just define FAR to be empty.
+ */
+#ifdef SYS16BIT
+#  if defined(M_I86SM) || defined(M_I86MM)
+     /* MSC small or medium model */
+#    define SMALL_MEDIUM
+#    ifdef _MSC_VER
+#      define FAR _far
+#    else
+#      define FAR far
+#    endif
+#  endif
+#  if (defined(__SMALL__) || defined(__MEDIUM__))
+     /* Turbo C small or medium model */
+#    define SMALL_MEDIUM
+#    ifdef __BORLANDC__
+#      define FAR _far
+#    else
+#      define FAR far
+#    endif
+#  endif
+#endif
+
+#if defined(WINDOWS) || defined(WIN32)
+   /* If building or using zlib as a DLL, define ZLIB_DLL.
+    * This is not mandatory, but it offers a little performance increase.
+    */
+#  ifdef ZLIB_DLL
+#    if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500))
+#      ifdef ZLIB_INTERNAL
+#        define ZEXTERN extern __declspec(dllexport)
+#      else
+#        define ZEXTERN extern __declspec(dllimport)
+#      endif
+#    endif
+#  endif  /* ZLIB_DLL */
+   /* If building or using zlib with the WINAPI/WINAPIV calling convention,
+    * define ZLIB_WINAPI.
+    * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI.
+    */
+#  ifdef ZLIB_WINAPI
+#    ifdef FAR
+#      undef FAR
+#    endif
+#    ifndef WIN32_LEAN_AND_MEAN
+#      define WIN32_LEAN_AND_MEAN
+#    endif
+#    include <windows.h>
+     /* No need for _export, use ZLIB.DEF instead. */
+     /* For complete Windows compatibility, use WINAPI, not __stdcall. */
+#    define ZEXPORT WINAPI
+#    ifdef WIN32
+#      define ZEXPORTVA WINAPIV
+#    else
+#      define ZEXPORTVA FAR CDECL
+#    endif
+#  endif
+#endif
+
+#if defined (__BEOS__)
+#  ifdef ZLIB_DLL
+#    ifdef ZLIB_INTERNAL
+#      define ZEXPORT   __declspec(dllexport)
+#      define ZEXPORTVA __declspec(dllexport)
+#    else
+#      define ZEXPORT   __declspec(dllimport)
+#      define ZEXPORTVA __declspec(dllimport)
+#    endif
+#  endif
+#endif
+
+#ifndef ZEXTERN
+#  define ZEXTERN extern
+#endif
+#ifndef ZEXPORT
+#  define ZEXPORT
+#endif
+#ifndef ZEXPORTVA
+#  define ZEXPORTVA
+#endif
+
+#ifndef FAR
+#  define FAR
+#endif
+
+#if !defined(__MACTYPES__)
+typedef unsigned char  Byte;  /* 8 bits */
+#endif
+typedef unsigned int   uInt;  /* 16 bits or more */
+typedef unsigned long  uLong; /* 32 bits or more */
+
+#ifdef SMALL_MEDIUM
+   /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */
+#  define Bytef Byte FAR
+#else
+   typedef Byte  FAR Bytef;
+#endif
+typedef char  FAR charf;
+typedef int   FAR intf;
+typedef uInt  FAR uIntf;
+typedef uLong FAR uLongf;
+
+#ifdef STDC
+   typedef void const *voidpc;
+   typedef void FAR   *voidpf;
+   typedef void       *voidp;
+#else
+   typedef Byte const *voidpc;
+   typedef Byte FAR   *voidpf;
+   typedef Byte       *voidp;
+#endif
+
+#if !defined(Z_U4) && !defined(Z_SOLO) && defined(STDC)
+#  include <limits.h>
+#  if (UINT_MAX == 0xffffffffUL)
+#    define Z_U4 unsigned
+#  elif (ULONG_MAX == 0xffffffffUL)
+#    define Z_U4 unsigned long
+#  elif (USHRT_MAX == 0xffffffffUL)
+#    define Z_U4 unsigned short
+#  endif
+#endif
+
+#ifdef Z_U4
+   typedef Z_U4 z_crc_t;
+#else
+   typedef unsigned long z_crc_t;
+#endif
+
+#ifdef HAVE_UNISTD_H    /* may be set to #if 1 by ./configure */
+#  define Z_HAVE_UNISTD_H
+#endif
+
+#ifdef HAVE_STDARG_H    /* may be set to #if 1 by ./configure */
+#  define Z_HAVE_STDARG_H
+#endif
+
+#ifdef STDC
+#  ifndef Z_SOLO
+#    include <sys/types.h>      /* for off_t */
+#  endif
+#endif
+
+#if defined(STDC) || defined(Z_HAVE_STDARG_H)
+#  ifndef Z_SOLO
+#    include <stdarg.h>         /* for va_list */
+#  endif
+#endif
+
+#ifdef _WIN32
+#  ifndef Z_SOLO
+#    include <stddef.h>         /* for wchar_t */
+#  endif
+#endif
+
+/* a little trick to accommodate both "#define _LARGEFILE64_SOURCE" and
+ * "#define _LARGEFILE64_SOURCE 1" as requesting 64-bit operations, (even
+ * though the former does not conform to the LFS document), but considering
+ * both "#undef _LARGEFILE64_SOURCE" and "#define _LARGEFILE64_SOURCE 0" as
+ * equivalently requesting no 64-bit operations
+ */
+#if defined(_LARGEFILE64_SOURCE) && -_LARGEFILE64_SOURCE - -1 == 1
+#  undef _LARGEFILE64_SOURCE
+#endif
+
+#ifndef Z_HAVE_UNISTD_H
+#  ifdef __WATCOMC__
+#    define Z_HAVE_UNISTD_H
+#  endif
+#endif
+#ifndef Z_HAVE_UNISTD_H
+#  if defined(_LARGEFILE64_SOURCE) && !defined(_WIN32)
+#    define Z_HAVE_UNISTD_H
+#  endif
+#endif
+#ifndef Z_SOLO
+#  if defined(Z_HAVE_UNISTD_H)
+#    include <unistd.h>         /* for SEEK_*, off_t, and _LFS64_LARGEFILE */
+#    ifdef VMS
+#      include <unixio.h>       /* for off_t */
+#    endif
+#    ifndef z_off_t
+#      define z_off_t off_t
+#    endif
+#  endif
+#endif
+
+#if defined(_LFS64_LARGEFILE) && _LFS64_LARGEFILE-0
+#  define Z_LFS64
+#endif
+
+#if defined(_LARGEFILE64_SOURCE) && defined(Z_LFS64)
+#  define Z_LARGE64
+#endif
+
+#if defined(_FILE_OFFSET_BITS) && _FILE_OFFSET_BITS-0 == 64 && defined(Z_LFS64)
+#  define Z_WANT64
+#endif
+
+#if !defined(SEEK_SET) && !defined(Z_SOLO)
+#  define SEEK_SET        0       /* Seek from beginning of file.  */
+#  define SEEK_CUR        1       /* Seek from current position.  */
+#  define SEEK_END        2       /* Set file pointer to EOF plus "offset" */
+#endif
+
+#ifndef z_off_t
+#  define z_off_t long
+#endif
+
+#if !defined(_WIN32) && defined(Z_LARGE64)
+#  define z_off64_t off64_t
+#else
+#  if defined(_WIN32) && !defined(__GNUC__)
+#    define z_off64_t __int64
+#  else
+#    define z_off64_t z_off_t
+#  endif
+#endif
+
+/* MVS linker does not support external names larger than 8 bytes */
+#if defined(__MVS__)
+  #pragma map(deflateInit_,"DEIN")
+  #pragma map(deflateInit2_,"DEIN2")
+  #pragma map(deflateEnd,"DEEND")
+  #pragma map(deflateBound,"DEBND")
+  #pragma map(inflateInit_,"ININ")
+  #pragma map(inflateInit2_,"ININ2")
+  #pragma map(inflateEnd,"INEND")
+  #pragma map(inflateSync,"INSY")
+  #pragma map(inflateSetDictionary,"INSEDI")
+  #pragma map(compressBound,"CMBND")
+  #pragma map(inflate_table,"INTABL")
+  #pragma map(inflate_fast,"INFA")
+  #pragma map(inflate_copyright,"INCOPY")
+#endif
+
+#endif /* ZCONF_H */
diff --git a/deps/v8/third_party/zlib/zlib.3 b/deps/v8/third_party/zlib/zlib.3
index 6f6e91404dff19..e733b5ab65c642 100644
--- a/deps/v8/third_party/zlib/zlib.3
+++ b/deps/v8/third_party/zlib/zlib.3
@@ -1,4 +1,4 @@
-.TH ZLIB 3 "13 Oct 2022"
+.TH ZLIB 3 "xx Oct 2022"
 .SH NAME
 zlib \- compression/decompression library
 .SH SYNOPSIS
@@ -105,7 +105,7 @@ before asking for help.
 Send questions and/or comments to zlib@gzip.org,
 or (for the Windows DLL version) to Gilles Vollant (info@winimage.com).
 .SH AUTHORS AND LICENSE
-Version 1.2.13
+Version 1.2.13.1
 .LP
 Copyright (C) 1995-2022 Jean-loup Gailly and Mark Adler
 .LP
diff --git a/deps/v8/third_party/zlib/zlib.h b/deps/v8/third_party/zlib/zlib.h
index cff21a1564dfdf..014331fc8dc33f 100644
--- a/deps/v8/third_party/zlib/zlib.h
+++ b/deps/v8/third_party/zlib/zlib.h
@@ -1,5 +1,5 @@
 /* zlib.h -- interface of the 'zlib' general purpose compression library
-  version 1.2.13, October 13th, 2022
+  version 1.2.13.1, October xxth, 2022
 
   Copyright (C) 1995-2022 Jean-loup Gailly and Mark Adler
 
@@ -37,12 +37,12 @@
 extern "C" {
 #endif
 
-#define ZLIB_VERSION "1.2.13"
-#define ZLIB_VERNUM 0x12d0
+#define ZLIB_VERSION "1.2.13.1-motley"
+#define ZLIB_VERNUM 0x12d1
 #define ZLIB_VER_MAJOR 1
 #define ZLIB_VER_MINOR 2
 #define ZLIB_VER_REVISION 13
-#define ZLIB_VER_SUBREVISION 0
+#define ZLIB_VER_SUBREVISION 1
 
 /*
     The 'zlib' compression library provides in-memory compression and
@@ -78,8 +78,8 @@ extern "C" {
   even in the case of corrupted input.
 */
 
-typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size));
-typedef void   (*free_func)  OF((voidpf opaque, voidpf address));
+typedef voidpf (*alloc_func)(voidpf opaque, uInt items, uInt size);
+typedef void   (*free_func)(voidpf opaque, voidpf address);
 
 struct internal_state;
 
@@ -217,7 +217,7 @@ typedef gz_header FAR *gz_headerp;
 
                         /* basic functions */
 
-ZEXTERN const char * ZEXPORT zlibVersion OF((void));
+ZEXTERN const char * ZEXPORT zlibVersion(void);
 /* The application can compare zlibVersion and ZLIB_VERSION for consistency.
    If the first character differs, the library code actually used is not
    compatible with the zlib.h header file used by the application.  This check
@@ -225,7 +225,7 @@ ZEXTERN const char * ZEXPORT zlibVersion OF((void));
  */
 
 /*
-ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level));
+ZEXTERN int ZEXPORT deflateInit(z_streamp strm, int level);
 
      Initializes the internal stream state for compression.  The fields
    zalloc, zfree and opaque must be initialized before by the caller.  If
@@ -247,7 +247,7 @@ ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level));
 */
 
 
-ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush));
+ZEXTERN int ZEXPORT deflate(z_streamp strm, int flush);
 /*
     deflate compresses as much data as possible, and stops when the input
   buffer becomes empty or the output buffer becomes full.  It may introduce
@@ -359,7 +359,7 @@ ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush));
   continue compressing.
 */
 
-ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm));
+ZEXTERN int ZEXPORT deflateEnd(z_streamp strm);
 /*
      All dynamically allocated data structures for this stream are freed.
    This function discards any unprocessed input and does not flush any pending
@@ -374,7 +374,7 @@ ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm));
 
 
 /*
-ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm));
+ZEXTERN int ZEXPORT inflateInit(z_streamp strm);
 
      Initializes the internal stream state for decompression.  The fields
    next_in, avail_in, zalloc, zfree and opaque must be initialized before by
@@ -396,7 +396,7 @@ ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm));
 */
 
 
-ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush));
+ZEXTERN int ZEXPORT inflate(z_streamp strm, int flush);
 /*
     inflate decompresses as much data as possible, and stops when the input
   buffer becomes empty or the output buffer becomes full.  It may introduce
@@ -516,7 +516,7 @@ ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush));
 */
 
 
-ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm));
+ZEXTERN int ZEXPORT inflateEnd(z_streamp strm);
 /*
      All dynamically allocated data structures for this stream are freed.
    This function discards any unprocessed input and does not flush any pending
@@ -534,12 +534,12 @@ ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm));
 */
 
 /*
-ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm,
-                                     int  level,
-                                     int  method,
-                                     int  windowBits,
-                                     int  memLevel,
-                                     int  strategy));
+ZEXTERN int ZEXPORT deflateInit2(z_streamp strm,
+                                 int level,
+                                 int method,
+                                 int windowBits,
+                                 int memLevel,
+                                 int strategy);
 
      This is another version of deflateInit with more compression options.  The
    fields zalloc, zfree and opaque must be initialized before by the caller.
@@ -606,9 +606,9 @@ ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm,
    compression: this will be done by deflate().
 */
 
-ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm,
-                                             const Bytef *dictionary,
-                                             uInt  dictLength));
+ZEXTERN int ZEXPORT deflateSetDictionary(z_streamp strm,
+                                         const Bytef *dictionary,
+                                         uInt  dictLength);
 /*
      Initializes the compression dictionary from the given byte sequence
    without producing any compressed output.  When using the zlib format, this
@@ -650,9 +650,9 @@ ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm,
    not perform any compression: this will be done by deflate().
 */
 
-ZEXTERN int ZEXPORT deflateGetDictionary OF((z_streamp strm,
-                                             Bytef *dictionary,
-                                             uInt  *dictLength));
+ZEXTERN int ZEXPORT deflateGetDictionary(z_streamp strm,
+                                         Bytef *dictionary,
+                                         uInt  *dictLength);
 /*
      Returns the sliding dictionary being maintained by deflate.  dictLength is
    set to the number of bytes in the dictionary, and that many bytes are copied
@@ -672,8 +672,8 @@ ZEXTERN int ZEXPORT deflateGetDictionary OF((z_streamp strm,
    stream state is inconsistent.
 */
 
-ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest,
-                                    z_streamp source));
+ZEXTERN int ZEXPORT deflateCopy(z_streamp dest,
+                                z_streamp source);
 /*
      Sets the destination stream as a complete copy of the source stream.
 
@@ -690,7 +690,7 @@ ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest,
    destination.
 */
 
-ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm));
+ZEXTERN int ZEXPORT deflateReset(z_streamp strm);
 /*
      This function is equivalent to deflateEnd followed by deflateInit, but
    does not free and reallocate the internal compression state.  The stream
@@ -701,9 +701,9 @@ ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm));
    stream state was inconsistent (such as zalloc or state being Z_NULL).
 */
 
-ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm,
-                                      int level,
-                                      int strategy));
+ZEXTERN int ZEXPORT deflateParams(z_streamp strm,
+                                  int level,
+                                  int strategy);
 /*
      Dynamically update the compression level and compression strategy.  The
    interpretation of level and strategy is as in deflateInit2().  This can be
@@ -728,7 +728,7 @@ ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm,
    Then no more input data should be provided before the deflateParams() call.
    If this is done, the old level and strategy will be applied to the data
    compressed before deflateParams(), and the new level and strategy will be
-   applied to the the data compressed after deflateParams().
+   applied to the data compressed after deflateParams().
 
      deflateParams returns Z_OK on success, Z_STREAM_ERROR if the source stream
    state was inconsistent or if a parameter was invalid, or Z_BUF_ERROR if
@@ -739,11 +739,11 @@ ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm,
    retried with more output space.
 */
 
-ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm,
-                                    int good_length,
-                                    int max_lazy,
-                                    int nice_length,
-                                    int max_chain));
+ZEXTERN int ZEXPORT deflateTune(z_streamp strm,
+                                int good_length,
+                                int max_lazy,
+                                int nice_length,
+                                int max_chain);
 /*
      Fine tune deflate's internal compression parameters.  This should only be
    used by someone who understands the algorithm used by zlib's deflate for
@@ -756,8 +756,8 @@ ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm,
    returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream.
  */
 
-ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm,
-                                       uLong sourceLen));
+ZEXTERN uLong ZEXPORT deflateBound(z_streamp strm,
+                                   uLong sourceLen);
 /*
      deflateBound() returns an upper bound on the compressed size after
    deflation of sourceLen bytes.  It must be called after deflateInit() or
@@ -771,9 +771,9 @@ ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm,
    than Z_FINISH or Z_NO_FLUSH are used.
 */
 
-ZEXTERN int ZEXPORT deflatePending OF((z_streamp strm,
-                                       unsigned *pending,
-                                       int *bits));
+ZEXTERN int ZEXPORT deflatePending(z_streamp strm,
+                                   unsigned *pending,
+                                   int *bits);
 /*
      deflatePending() returns the number of bytes and bits of output that have
    been generated, but not yet provided in the available output.  The bytes not
@@ -786,9 +786,9 @@ ZEXTERN int ZEXPORT deflatePending OF((z_streamp strm,
    stream state was inconsistent.
  */
 
-ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm,
-                                     int bits,
-                                     int value));
+ZEXTERN int ZEXPORT deflatePrime(z_streamp strm,
+                                 int bits,
+                                 int value);
 /*
      deflatePrime() inserts bits in the deflate output stream.  The intent
    is that this function is used to start off the deflate output with the bits
@@ -803,8 +803,8 @@ ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm,
    source stream state was inconsistent.
 */
 
-ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm,
-                                         gz_headerp head));
+ZEXTERN int ZEXPORT deflateSetHeader(z_streamp strm,
+                                     gz_headerp head);
 /*
      deflateSetHeader() provides gzip header information for when a gzip
    stream is requested by deflateInit2().  deflateSetHeader() may be called
@@ -828,8 +828,8 @@ ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm,
 */
 
 /*
-ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm,
-                                     int  windowBits));
+ZEXTERN int ZEXPORT inflateInit2(z_streamp strm,
+                                 int windowBits);
 
      This is another version of inflateInit with an extra parameter.  The
    fields next_in, avail_in, zalloc, zfree and opaque must be initialized
@@ -882,9 +882,9 @@ ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm,
    deferred until inflate() is called.
 */
 
-ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm,
-                                             const Bytef *dictionary,
-                                             uInt  dictLength));
+ZEXTERN int ZEXPORT inflateSetDictionary(z_streamp strm,
+                                         const Bytef *dictionary,
+                                         uInt  dictLength);
 /*
      Initializes the decompression dictionary from the given uncompressed byte
    sequence.  This function must be called immediately after a call of inflate,
@@ -905,9 +905,9 @@ ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm,
    inflate().
 */
 
-ZEXTERN int ZEXPORT inflateGetDictionary OF((z_streamp strm,
-                                             Bytef *dictionary,
-                                             uInt  *dictLength));
+ZEXTERN int ZEXPORT inflateGetDictionary(z_streamp strm,
+                                         Bytef *dictionary,
+                                         uInt  *dictLength);
 /*
      Returns the sliding dictionary being maintained by inflate.  dictLength is
    set to the number of bytes in the dictionary, and that many bytes are copied
@@ -920,7 +920,7 @@ ZEXTERN int ZEXPORT inflateGetDictionary OF((z_streamp strm,
    stream state is inconsistent.
 */
 
-ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm));
+ZEXTERN int ZEXPORT inflateSync(z_streamp strm);
 /*
      Skips invalid compressed data until a possible full flush point (see above
    for the description of deflate with Z_FULL_FLUSH) can be found, or until all
@@ -939,8 +939,8 @@ ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm));
    input each time, until success or end of the input data.
 */
 
-ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest,
-                                    z_streamp source));
+ZEXTERN int ZEXPORT inflateCopy(z_streamp dest,
+                                z_streamp source);
 /*
      Sets the destination stream as a complete copy of the source stream.
 
@@ -955,7 +955,7 @@ ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest,
    destination.
 */
 
-ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm));
+ZEXTERN int ZEXPORT inflateReset(z_streamp strm);
 /*
      This function is equivalent to inflateEnd followed by inflateInit,
    but does not free and reallocate the internal decompression state.  The
@@ -965,8 +965,8 @@ ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm));
    stream state was inconsistent (such as zalloc or state being Z_NULL).
 */
 
-ZEXTERN int ZEXPORT inflateReset2 OF((z_streamp strm,
-                                      int windowBits));
+ZEXTERN int ZEXPORT inflateReset2(z_streamp strm,
+                                  int windowBits);
 /*
      This function is the same as inflateReset, but it also permits changing
    the wrap and window size requests.  The windowBits parameter is interpreted
@@ -979,9 +979,9 @@ ZEXTERN int ZEXPORT inflateReset2 OF((z_streamp strm,
    the windowBits parameter is invalid.
 */
 
-ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm,
-                                     int bits,
-                                     int value));
+ZEXTERN int ZEXPORT inflatePrime(z_streamp strm,
+                                 int bits,
+                                 int value);
 /*
      This function inserts bits in the inflate input stream.  The intent is
    that this function is used to start inflating at a bit position in the
@@ -1000,7 +1000,7 @@ ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm,
    stream state was inconsistent.
 */
 
-ZEXTERN long ZEXPORT inflateMark OF((z_streamp strm));
+ZEXTERN long ZEXPORT inflateMark(z_streamp strm);
 /*
      This function returns two values, one in the lower 16 bits of the return
    value, and the other in the remaining upper bits, obtained by shifting the
@@ -1028,8 +1028,8 @@ ZEXTERN long ZEXPORT inflateMark OF((z_streamp strm));
    source stream state was inconsistent.
 */
 
-ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm,
-                                         gz_headerp head));
+ZEXTERN int ZEXPORT inflateGetHeader(z_streamp strm,
+                                     gz_headerp head);
 /*
      inflateGetHeader() requests that gzip header information be stored in the
    provided gz_header structure.  inflateGetHeader() may be called after
@@ -1069,8 +1069,8 @@ ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm,
 */
 
 /*
-ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits,
-                                        unsigned char FAR *window));
+ZEXTERN int ZEXPORT inflateBackInit(z_streamp strm, int windowBits,
+                                    unsigned char FAR *window);
 
      Initialize the internal stream state for decompression using inflateBack()
    calls.  The fields zalloc, zfree and opaque in strm must be initialized
@@ -1090,13 +1090,13 @@ ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits,
    the version of the header file.
 */
 
-typedef unsigned (*in_func) OF((void FAR *,
-                                z_const unsigned char FAR * FAR *));
-typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned));
+typedef unsigned (*in_func)(void FAR *,
+                            z_const unsigned char FAR * FAR *);
+typedef int (*out_func)(void FAR *, unsigned char FAR *, unsigned);
 
-ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm,
-                                    in_func in, void FAR *in_desc,
-                                    out_func out, void FAR *out_desc));
+ZEXTERN int ZEXPORT inflateBack(z_streamp strm,
+                                in_func in, void FAR *in_desc,
+                                out_func out, void FAR *out_desc);
 /*
      inflateBack() does a raw inflate with a single call using a call-back
    interface for input and output.  This is potentially more efficient than
@@ -1164,7 +1164,7 @@ ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm,
    cannot return Z_OK.
 */
 
-ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm));
+ZEXTERN int ZEXPORT inflateBackEnd(z_streamp strm);
 /*
      All memory allocated by inflateBackInit() is freed.
 
@@ -1172,7 +1172,7 @@ ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm));
    state was inconsistent.
 */
 
-ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void));
+ZEXTERN uLong ZEXPORT zlibCompileFlags(void);
 /* Return flags indicating compile-time options.
 
     Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other:
@@ -1225,8 +1225,8 @@ ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void));
    you need special options.
 */
 
-ZEXTERN int ZEXPORT compress OF((Bytef *dest,   uLongf *destLen,
-                                 const Bytef *source, uLong sourceLen));
+ZEXTERN int ZEXPORT compress(Bytef *dest,   uLongf *destLen,
+                             const Bytef *source, uLong sourceLen);
 /*
      Compresses the source buffer into the destination buffer.  sourceLen is
    the byte length of the source buffer.  Upon entry, destLen is the total size
@@ -1240,9 +1240,9 @@ ZEXTERN int ZEXPORT compress OF((Bytef *dest,   uLongf *destLen,
    buffer.
 */
 
-ZEXTERN int ZEXPORT compress2 OF((Bytef *dest,   uLongf *destLen,
-                                  const Bytef *source, uLong sourceLen,
-                                  int level));
+ZEXTERN int ZEXPORT compress2(Bytef *dest,   uLongf *destLen,
+                              const Bytef *source, uLong sourceLen,
+                              int level);
 /*
      Compresses the source buffer into the destination buffer.  The level
    parameter has the same meaning as in deflateInit.  sourceLen is the byte
@@ -1256,15 +1256,15 @@ ZEXTERN int ZEXPORT compress2 OF((Bytef *dest,   uLongf *destLen,
    Z_STREAM_ERROR if the level parameter is invalid.
 */
 
-ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen));
+ZEXTERN uLong ZEXPORT compressBound(uLong sourceLen);
 /*
      compressBound() returns an upper bound on the compressed size after
    compress() or compress2() on sourceLen bytes.  It would be used before a
    compress() or compress2() call to allocate the destination buffer.
 */
 
-ZEXTERN int ZEXPORT uncompress OF((Bytef *dest,   uLongf *destLen,
-                                   const Bytef *source, uLong sourceLen));
+ZEXTERN int ZEXPORT uncompress(Bytef *dest,   uLongf *destLen,
+                               const Bytef *source, uLong sourceLen);
 /*
      Decompresses the source buffer into the destination buffer.  sourceLen is
    the byte length of the source buffer.  Upon entry, destLen is the total size
@@ -1281,8 +1281,8 @@ ZEXTERN int ZEXPORT uncompress OF((Bytef *dest,   uLongf *destLen,
    buffer with the uncompressed data up to that point.
 */
 
-ZEXTERN int ZEXPORT uncompress2 OF((Bytef *dest,   uLongf *destLen,
-                                    const Bytef *source, uLong *sourceLen));
+ZEXTERN int ZEXPORT uncompress2(Bytef *dest,   uLongf *destLen,
+                                const Bytef *source, uLong *sourceLen);
 /*
      Same as uncompress, except that sourceLen is a pointer, where the
    length of the source is *sourceLen.  On return, *sourceLen is the number of
@@ -1301,7 +1301,7 @@ ZEXTERN int ZEXPORT uncompress2 OF((Bytef *dest,   uLongf *destLen,
 typedef struct gzFile_s *gzFile;    /* semi-opaque gzip file descriptor */
 
 /*
-ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode));
+ZEXTERN gzFile ZEXPORT gzopen(const char *path, const char *mode);
 
      Open the gzip (.gz) file at path for reading and decompressing, or
    compressing and writing.  The mode parameter is as in fopen ("rb" or "wb")
@@ -1338,7 +1338,7 @@ ZEXTERN gzFile ZEXPORT gzopen OF((const char *path, const char *mode));
    file could not be opened.
 */
 
-ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode));
+ZEXTERN gzFile ZEXPORT gzdopen(int fd, const char *mode);
 /*
      Associate a gzFile with the file descriptor fd.  File descriptors are
    obtained from calls like open, dup, creat, pipe or fileno (if the file has
@@ -1361,7 +1361,7 @@ ZEXTERN gzFile ZEXPORT gzdopen OF((int fd, const char *mode));
    will not detect if fd is invalid (unless fd is -1).
 */
 
-ZEXTERN int ZEXPORT gzbuffer OF((gzFile file, unsigned size));
+ZEXTERN int ZEXPORT gzbuffer(gzFile file, unsigned size);
 /*
      Set the internal buffer size used by this library's functions for file to
    size.  The default buffer size is 8192 bytes.  This function must be called
@@ -1377,7 +1377,7 @@ ZEXTERN int ZEXPORT gzbuffer OF((gzFile file, unsigned size));
    too late.
 */
 
-ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy));
+ZEXTERN int ZEXPORT gzsetparams(gzFile file, int level, int strategy);
 /*
      Dynamically update the compression level and strategy for file.  See the
    description of deflateInit2 for the meaning of these parameters. Previously
@@ -1388,7 +1388,7 @@ ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy));
    or Z_MEM_ERROR if there is a memory allocation error.
 */
 
-ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len));
+ZEXTERN int ZEXPORT gzread(gzFile file, voidp buf, unsigned len);
 /*
      Read and decompress up to len uncompressed bytes from file into buf.  If
    the input file is not in gzip format, gzread copies the given number of
@@ -1418,8 +1418,8 @@ ZEXTERN int ZEXPORT gzread OF((gzFile file, voidp buf, unsigned len));
    Z_STREAM_ERROR.
 */
 
-ZEXTERN z_size_t ZEXPORT gzfread OF((voidp buf, z_size_t size, z_size_t nitems,
-                                     gzFile file));
+ZEXTERN z_size_t ZEXPORT gzfread(voidp buf, z_size_t size, z_size_t nitems,
+                                 gzFile file);
 /*
      Read and decompress up to nitems items of size size from file into buf,
    otherwise operating as gzread() does.  This duplicates the interface of
@@ -1444,14 +1444,14 @@ ZEXTERN z_size_t ZEXPORT gzfread OF((voidp buf, z_size_t size, z_size_t nitems,
    file, resetting and retrying on end-of-file, when size is not 1.
 */
 
-ZEXTERN int ZEXPORT gzwrite OF((gzFile file, voidpc buf, unsigned len));
+ZEXTERN int ZEXPORT gzwrite(gzFile file, voidpc buf, unsigned len);
 /*
      Compress and write the len uncompressed bytes at buf to file. gzwrite
    returns the number of uncompressed bytes written or 0 in case of error.
 */
 
-ZEXTERN z_size_t ZEXPORT gzfwrite OF((voidpc buf, z_size_t size,
-                                      z_size_t nitems, gzFile file));
+ZEXTERN z_size_t ZEXPORT gzfwrite(voidpc buf, z_size_t size,
+                                  z_size_t nitems, gzFile file);
 /*
      Compress and write nitems items of size size from buf to file, duplicating
    the interface of stdio's fwrite(), with size_t request and return types.  If
@@ -1464,7 +1464,7 @@ ZEXTERN z_size_t ZEXPORT gzfwrite OF((voidpc buf, z_size_t size,
    is returned, and the error state is set to Z_STREAM_ERROR.
 */
 
-ZEXTERN int ZEXPORTVA gzprintf Z_ARG((gzFile file, const char *format, ...));
+ZEXTERN int ZEXPORTVA gzprintf(gzFile file, const char *format, ...);
 /*
      Convert, format, compress, and write the arguments (...) to file under
    control of the string format, as in fprintf.  gzprintf returns the number of
@@ -1479,7 +1479,7 @@ ZEXTERN int ZEXPORTVA gzprintf Z_ARG((gzFile file, const char *format, ...));
    This can be determined using zlibCompileFlags().
 */
 
-ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s));
+ZEXTERN int ZEXPORT gzputs(gzFile file, const char *s);
 /*
      Compress and write the given null-terminated string s to file, excluding
    the terminating null character.
@@ -1487,7 +1487,7 @@ ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s));
      gzputs returns the number of characters written, or -1 in case of error.
 */
 
-ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len));
+ZEXTERN char * ZEXPORT gzgets(gzFile file, char *buf, int len);
 /*
      Read and decompress bytes from file into buf, until len-1 characters are
    read, or until a newline character is read and transferred to buf, or an
@@ -1501,13 +1501,13 @@ ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len));
    buf are indeterminate.
 */
 
-ZEXTERN int ZEXPORT gzputc OF((gzFile file, int c));
+ZEXTERN int ZEXPORT gzputc(gzFile file, int c);
 /*
      Compress and write c, converted to an unsigned char, into file.  gzputc
    returns the value that was written, or -1 in case of error.
 */
 
-ZEXTERN int ZEXPORT gzgetc OF((gzFile file));
+ZEXTERN int ZEXPORT gzgetc(gzFile file);
 /*
      Read and decompress one byte from file.  gzgetc returns this byte or -1
    in case of end of file or error.  This is implemented as a macro for speed.
@@ -1516,7 +1516,7 @@ ZEXTERN int ZEXPORT gzgetc OF((gzFile file));
    points to has been clobbered or not.
 */
 
-ZEXTERN int ZEXPORT gzungetc OF((int c, gzFile file));
+ZEXTERN int ZEXPORT gzungetc(int c, gzFile file);
 /*
      Push c back onto the stream for file to be read as the first character on
    the next read.  At least one character of push-back is always allowed.
@@ -1528,7 +1528,7 @@ ZEXTERN int ZEXPORT gzungetc OF((int c, gzFile file));
    gzseek() or gzrewind().
 */
 
-ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush));
+ZEXTERN int ZEXPORT gzflush(gzFile file, int flush);
 /*
      Flush all pending output to file.  The parameter flush is as in the
    deflate() function.  The return value is the zlib error number (see function
@@ -1544,8 +1544,8 @@ ZEXTERN int ZEXPORT gzflush OF((gzFile file, int flush));
 */
 
 /*
-ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file,
-                                   z_off_t offset, int whence));
+ZEXTERN z_off_t ZEXPORT gzseek(gzFile file,
+                               z_off_t offset, int whence);
 
      Set the starting position to offset relative to whence for the next gzread
    or gzwrite on file.  The offset represents a number of bytes in the
@@ -1563,7 +1563,7 @@ ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile file,
    would be before the current position.
 */
 
-ZEXTERN int ZEXPORT    gzrewind OF((gzFile file));
+ZEXTERN int ZEXPORT    gzrewind(gzFile file);
 /*
      Rewind file. This function is supported only for reading.
 
@@ -1571,7 +1571,7 @@ ZEXTERN int ZEXPORT    gzrewind OF((gzFile file));
 */
 
 /*
-ZEXTERN z_off_t ZEXPORT    gztell OF((gzFile file));
+ZEXTERN z_off_t ZEXPORT    gztell(gzFile file);
 
      Return the starting position for the next gzread or gzwrite on file.
    This position represents a number of bytes in the uncompressed data stream,
@@ -1582,7 +1582,7 @@ ZEXTERN z_off_t ZEXPORT    gztell OF((gzFile file));
 */
 
 /*
-ZEXTERN z_off_t ZEXPORT gzoffset OF((gzFile file));
+ZEXTERN z_off_t ZEXPORT gzoffset(gzFile file);
 
      Return the current compressed (actual) read or write offset of file.  This
    offset includes the count of bytes that precede the gzip stream, for example
@@ -1591,7 +1591,7 @@ ZEXTERN z_off_t ZEXPORT gzoffset OF((gzFile file));
    be used for a progress indicator.  On error, gzoffset() returns -1.
 */
 
-ZEXTERN int ZEXPORT gzeof OF((gzFile file));
+ZEXTERN int ZEXPORT gzeof(gzFile file);
 /*
      Return true (1) if the end-of-file indicator for file has been set while
    reading, false (0) otherwise.  Note that the end-of-file indicator is set
@@ -1606,7 +1606,7 @@ ZEXTERN int ZEXPORT gzeof OF((gzFile file));
    has grown since the previous end of file was detected.
 */
 
-ZEXTERN int ZEXPORT gzdirect OF((gzFile file));
+ZEXTERN int ZEXPORT gzdirect(gzFile file);
 /*
      Return true (1) if file is being copied directly while reading, or false
    (0) if file is a gzip stream being decompressed.
@@ -1627,7 +1627,7 @@ ZEXTERN int ZEXPORT gzdirect OF((gzFile file));
    gzip file reading and decompression, which may not be desired.)
 */
 
-ZEXTERN int ZEXPORT    gzclose OF((gzFile file));
+ZEXTERN int ZEXPORT    gzclose(gzFile file);
 /*
      Flush all pending output for file, if necessary, close file and
    deallocate the (de)compression state.  Note that once file is closed, you
@@ -1640,8 +1640,8 @@ ZEXTERN int ZEXPORT    gzclose OF((gzFile file));
    last read ended in the middle of a gzip stream, or Z_OK on success.
 */
 
-ZEXTERN int ZEXPORT gzclose_r OF((gzFile file));
-ZEXTERN int ZEXPORT gzclose_w OF((gzFile file));
+ZEXTERN int ZEXPORT gzclose_r(gzFile file);
+ZEXTERN int ZEXPORT gzclose_w(gzFile file);
 /*
      Same as gzclose(), but gzclose_r() is only for use when reading, and
    gzclose_w() is only for use when writing or appending.  The advantage to
@@ -1652,7 +1652,7 @@ ZEXTERN int ZEXPORT gzclose_w OF((gzFile file));
    zlib library.
 */
 
-ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum));
+ZEXTERN const char * ZEXPORT gzerror(gzFile file, int *errnum);
 /*
      Return the error message for the last error which occurred on file.
    errnum is set to zlib error number.  If an error occurred in the file system
@@ -1668,7 +1668,7 @@ ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum));
    functions above that do not distinguish those cases in their return values.
 */
 
-ZEXTERN void ZEXPORT gzclearerr OF((gzFile file));
+ZEXTERN void ZEXPORT gzclearerr(gzFile file);
 /*
      Clear the error and end-of-file flags for file.  This is analogous to the
    clearerr() function in stdio.  This is useful for continuing to read a gzip
@@ -1685,7 +1685,7 @@ ZEXTERN void ZEXPORT gzclearerr OF((gzFile file));
    library.
 */
 
-ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len));
+ZEXTERN uLong ZEXPORT adler32(uLong adler, const Bytef *buf, uInt len);
 /*
      Update a running Adler-32 checksum with the bytes buf[0..len-1] and
    return the updated checksum. An Adler-32 value is in the range of a 32-bit
@@ -1705,15 +1705,15 @@ ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len));
      if (adler != original_adler) error();
 */
 
-ZEXTERN uLong ZEXPORT adler32_z OF((uLong adler, const Bytef *buf,
-                                    z_size_t len));
+ZEXTERN uLong ZEXPORT adler32_z(uLong adler, const Bytef *buf,
+                                z_size_t len);
 /*
      Same as adler32(), but with a size_t length.
 */
 
 /*
-ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2,
-                                          z_off_t len2));
+ZEXTERN uLong ZEXPORT adler32_combine(uLong adler1, uLong adler2,
+                                      z_off_t len2);
 
      Combine two Adler-32 checksums into one.  For two sequences of bytes, seq1
    and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for
@@ -1723,7 +1723,7 @@ ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2,
    negative, the result has no meaning or utility.
 */
 
-ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len));
+ZEXTERN uLong ZEXPORT crc32(uLong crc, const Bytef *buf, uInt len);
 /*
      Update a running CRC-32 with the bytes buf[0..len-1] and return the
    updated CRC-32. A CRC-32 value is in the range of a 32-bit unsigned integer.
@@ -1741,14 +1741,14 @@ ZEXTERN uLong ZEXPORT crc32 OF((uLong crc, const Bytef *buf, uInt len));
      if (crc != original_crc) error();
 */
 
-ZEXTERN uLong ZEXPORT crc32_z OF((uLong crc, const Bytef *buf,
-                                  z_size_t len));
+ZEXTERN uLong ZEXPORT crc32_z(uLong crc, const Bytef *buf,
+                              z_size_t len);
 /*
      Same as crc32(), but with a size_t length.
 */
 
 /*
-ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2));
+ZEXTERN uLong ZEXPORT crc32_combine(uLong crc1, uLong crc2, z_off_t len2);
 
      Combine two CRC-32 check values into one.  For two sequences of bytes,
    seq1 and seq2 with lengths len1 and len2, CRC-32 check values were
@@ -1758,13 +1758,13 @@ ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2));
 */
 
 /*
-ZEXTERN uLong ZEXPORT crc32_combine_gen OF((z_off_t len2));
+ZEXTERN uLong ZEXPORT crc32_combine_gen(z_off_t len2);
 
      Return the operator corresponding to length len2, to be used with
    crc32_combine_op().
 */
 
-ZEXTERN uLong ZEXPORT crc32_combine_op OF((uLong crc1, uLong crc2, uLong op));
+ZEXTERN uLong ZEXPORT crc32_combine_op(uLong crc1, uLong crc2, uLong op);
 /*
      Give the same result as crc32_combine(), using op in place of len2. op is
    is generated from len2 by crc32_combine_gen(). This will be faster than
@@ -1777,20 +1777,20 @@ ZEXTERN uLong ZEXPORT crc32_combine_op OF((uLong crc1, uLong crc2, uLong op));
 /* deflateInit and inflateInit are macros to allow checking the zlib version
  * and the compiler's view of z_stream:
  */
-ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level,
-                                     const char *version, int stream_size));
-ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm,
-                                     const char *version, int stream_size));
-ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int  level, int  method,
-                                      int windowBits, int memLevel,
-                                      int strategy, const char *version,
-                                      int stream_size));
-ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int  windowBits,
-                                      const char *version, int stream_size));
-ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits,
-                                         unsigned char FAR *window,
-                                         const char *version,
-                                         int stream_size));
+ZEXTERN int ZEXPORT deflateInit_(z_streamp strm, int level,
+                                 const char *version, int stream_size);
+ZEXTERN int ZEXPORT inflateInit_(z_streamp strm,
+                                 const char *version, int stream_size);
+ZEXTERN int ZEXPORT deflateInit2_(z_streamp strm, int  level, int  method,
+                                  int windowBits, int memLevel,
+                                  int strategy, const char *version,
+                                  int stream_size);
+ZEXTERN int ZEXPORT inflateInit2_(z_streamp strm, int  windowBits,
+                                  const char *version, int stream_size);
+ZEXTERN int ZEXPORT inflateBackInit_(z_streamp strm, int windowBits,
+                                     unsigned char FAR *window,
+                                     const char *version,
+                                     int stream_size);
 #ifdef Z_PREFIX_SET
 #  define z_deflateInit(strm, level) \
           deflateInit_((strm), (level), ZLIB_VERSION, (int)sizeof(z_stream))
@@ -1835,7 +1835,7 @@ struct gzFile_s {
     unsigned char *next;
     z_off64_t pos;
 };
-ZEXTERN int ZEXPORT gzgetc_ OF((gzFile file));  /* backward compatibility */
+ZEXTERN int ZEXPORT gzgetc_(gzFile file);       /* backward compatibility */
 #ifdef Z_PREFIX_SET
 #  undef z_gzgetc
 #  define z_gzgetc(g) \
@@ -1857,13 +1857,13 @@ ZEXTERN int ZEXPORT gzgetc_ OF((gzFile file));  /* backward compatibility */
  * without large file support, _LFS64_LARGEFILE must also be true
  */
 #ifdef Z_LARGE64
-   ZEXTERN gzFile ZEXPORT gzopen64 OF((const char *, const char *));
-   ZEXTERN z_off64_t ZEXPORT gzseek64 OF((gzFile, z_off64_t, int));
-   ZEXTERN z_off64_t ZEXPORT gztell64 OF((gzFile));
-   ZEXTERN z_off64_t ZEXPORT gzoffset64 OF((gzFile));
-   ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off64_t));
-   ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off64_t));
-   ZEXTERN uLong ZEXPORT crc32_combine_gen64 OF((z_off64_t));
+   ZEXTERN gzFile ZEXPORT gzopen64(const char *, const char *);
+   ZEXTERN z_off64_t ZEXPORT gzseek64(gzFile, z_off64_t, int);
+   ZEXTERN z_off64_t ZEXPORT gztell64(gzFile);
+   ZEXTERN z_off64_t ZEXPORT gzoffset64(gzFile);
+   ZEXTERN uLong ZEXPORT adler32_combine64(uLong, uLong, z_off64_t);
+   ZEXTERN uLong ZEXPORT crc32_combine64(uLong, uLong, z_off64_t);
+   ZEXTERN uLong ZEXPORT crc32_combine_gen64(z_off64_t);
 #endif
 
 #if !defined(ZLIB_INTERNAL) && defined(Z_WANT64)
@@ -1910,50 +1910,50 @@ ZEXTERN int ZEXPORT gzgetc_ OF((gzFile file));  /* backward compatibility */
 #    endif
 #  endif
 #  ifndef Z_LARGE64
-     ZEXTERN gzFile ZEXPORT gzopen64 OF((const char *, const char *));
-     ZEXTERN z_off_t ZEXPORT gzseek64 OF((gzFile, z_off_t, int));
-     ZEXTERN z_off_t ZEXPORT gztell64 OF((gzFile));
-     ZEXTERN z_off_t ZEXPORT gzoffset64 OF((gzFile));
-     ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off_t));
-     ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off_t));
-     ZEXTERN uLong ZEXPORT crc32_combine_gen64 OF((z_off_t));
+     ZEXTERN gzFile ZEXPORT gzopen64(const char *, const char *);
+     ZEXTERN z_off_t ZEXPORT gzseek64(gzFile, z_off_t, int);
+     ZEXTERN z_off_t ZEXPORT gztell64(gzFile);
+     ZEXTERN z_off_t ZEXPORT gzoffset64(gzFile);
+     ZEXTERN uLong ZEXPORT adler32_combine64(uLong, uLong, z_off_t);
+     ZEXTERN uLong ZEXPORT crc32_combine64(uLong, uLong, z_off_t);
+     ZEXTERN uLong ZEXPORT crc32_combine_gen64(z_off_t);
 #  endif
 #else
-   ZEXTERN gzFile ZEXPORT gzopen OF((const char *, const char *));
-   ZEXTERN z_off_t ZEXPORT gzseek OF((gzFile, z_off_t, int));
-   ZEXTERN z_off_t ZEXPORT gztell OF((gzFile));
-   ZEXTERN z_off_t ZEXPORT gzoffset OF((gzFile));
-   ZEXTERN uLong ZEXPORT adler32_combine OF((uLong, uLong, z_off_t));
-   ZEXTERN uLong ZEXPORT crc32_combine OF((uLong, uLong, z_off_t));
-   ZEXTERN uLong ZEXPORT crc32_combine_gen OF((z_off_t));
+   ZEXTERN gzFile ZEXPORT gzopen(const char *, const char *);
+   ZEXTERN z_off_t ZEXPORT gzseek(gzFile, z_off_t, int);
+   ZEXTERN z_off_t ZEXPORT gztell(gzFile);
+   ZEXTERN z_off_t ZEXPORT gzoffset(gzFile);
+   ZEXTERN uLong ZEXPORT adler32_combine(uLong, uLong, z_off_t);
+   ZEXTERN uLong ZEXPORT crc32_combine(uLong, uLong, z_off_t);
+   ZEXTERN uLong ZEXPORT crc32_combine_gen(z_off_t);
 #endif
 
 #else /* Z_SOLO */
 
-   ZEXTERN uLong ZEXPORT adler32_combine OF((uLong, uLong, z_off_t));
-   ZEXTERN uLong ZEXPORT crc32_combine OF((uLong, uLong, z_off_t));
-   ZEXTERN uLong ZEXPORT crc32_combine_gen OF((z_off_t));
+   ZEXTERN uLong ZEXPORT adler32_combine(uLong, uLong, z_off_t);
+   ZEXTERN uLong ZEXPORT crc32_combine(uLong, uLong, z_off_t);
+   ZEXTERN uLong ZEXPORT crc32_combine_gen(z_off_t);
 
 #endif /* !Z_SOLO */
 
 /* undocumented functions */
-ZEXTERN const char   * ZEXPORT zError           OF((int));
-ZEXTERN int            ZEXPORT inflateSyncPoint OF((z_streamp));
-ZEXTERN const z_crc_t FAR * ZEXPORT get_crc_table    OF((void));
-ZEXTERN int            ZEXPORT inflateUndermine OF((z_streamp, int));
-ZEXTERN int            ZEXPORT inflateValidate OF((z_streamp, int));
-ZEXTERN unsigned long  ZEXPORT inflateCodesUsed OF((z_streamp));
-ZEXTERN int            ZEXPORT inflateResetKeep OF((z_streamp));
-ZEXTERN int            ZEXPORT deflateResetKeep OF((z_streamp));
+ZEXTERN const char   * ZEXPORT zError(int);
+ZEXTERN int            ZEXPORT inflateSyncPoint(z_streamp);
+ZEXTERN const z_crc_t FAR * ZEXPORT get_crc_table(void);
+ZEXTERN int            ZEXPORT inflateUndermine(z_streamp, int);
+ZEXTERN int            ZEXPORT inflateValidate(z_streamp, int);
+ZEXTERN unsigned long  ZEXPORT inflateCodesUsed(z_streamp);
+ZEXTERN int            ZEXPORT inflateResetKeep(z_streamp);
+ZEXTERN int            ZEXPORT deflateResetKeep(z_streamp);
 #if defined(_WIN32) && !defined(Z_SOLO)
-ZEXTERN gzFile         ZEXPORT gzopen_w OF((const wchar_t *path,
-                                            const char *mode));
+ZEXTERN gzFile         ZEXPORT gzopen_w(const wchar_t *path,
+                                        const char *mode);
 #endif
 #if defined(STDC) || defined(Z_HAVE_STDARG_H)
 #  ifndef Z_SOLO
-ZEXTERN int            ZEXPORTVA gzvprintf Z_ARG((gzFile file,
-                                                  const char *format,
-                                                  va_list va));
+ZEXTERN int            ZEXPORTVA gzvprintf(gzFile file,
+                                           const char *format,
+                                           va_list va);
 #  endif
 #endif
 
diff --git a/deps/v8/third_party/zlib/zutil.c b/deps/v8/third_party/zlib/zutil.c
index 9543ae825e3250..b1c5d2d3c6daf5 100644
--- a/deps/v8/third_party/zlib/zutil.c
+++ b/deps/v8/third_party/zlib/zutil.c
@@ -24,13 +24,11 @@ z_const char * const z_errmsg[10] = {
 };
 
 
-const char * ZEXPORT zlibVersion()
-{
+const char * ZEXPORT zlibVersion(void) {
     return ZLIB_VERSION;
 }
 
-uLong ZEXPORT zlibCompileFlags()
-{
+uLong ZEXPORT zlibCompileFlags(void) {
     uLong flags;
 
     flags = 0;
@@ -121,9 +119,7 @@ uLong ZEXPORT zlibCompileFlags()
 #  endif
 int ZLIB_INTERNAL z_verbose = verbose;
 
-void ZLIB_INTERNAL z_error(m)
-    char *m;
-{
+void ZLIB_INTERNAL z_error(char *m) {
     fprintf(stderr, "%s\n", m);
     exit(1);
 }
@@ -132,9 +128,7 @@ void ZLIB_INTERNAL z_error(m)
 /* exported to allow conversion of error code to string for compress() and
  * uncompress()
  */
-const char * ZEXPORT zError(err)
-    int err;
-{
+const char * ZEXPORT zError(int err) {
     return ERR_MSG(err);
 }
 
@@ -148,22 +142,14 @@ const char * ZEXPORT zError(err)
 
 #ifndef HAVE_MEMCPY
 
-void ZLIB_INTERNAL zmemcpy(dest, source, len)
-    Bytef* dest;
-    const Bytef* source;
-    uInt  len;
-{
+void ZLIB_INTERNAL zmemcpy(Bytef* dest, const Bytef* source, uInt len) {
     if (len == 0) return;
     do {
         *dest++ = *source++; /* ??? to be unrolled */
     } while (--len != 0);
 }
 
-int ZLIB_INTERNAL zmemcmp(s1, s2, len)
-    const Bytef* s1;
-    const Bytef* s2;
-    uInt  len;
-{
+int ZLIB_INTERNAL zmemcmp(const Bytef* s1, const Bytef* s2, uInt len) {
     uInt j;
 
     for (j = 0; j < len; j++) {
@@ -172,10 +158,7 @@ int ZLIB_INTERNAL zmemcmp(s1, s2, len)
     return 0;
 }
 
-void ZLIB_INTERNAL zmemzero(dest, len)
-    Bytef* dest;
-    uInt  len;
-{
+void ZLIB_INTERNAL zmemzero(Bytef* dest, uInt len) {
     if (len == 0) return;
     do {
         *dest++ = 0;  /* ??? to be unrolled */
@@ -216,8 +199,7 @@ local ptr_table table[MAX_PTR];
  * a protected system like OS/2. Use Microsoft C instead.
  */
 
-voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, unsigned items, unsigned size)
-{
+voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, unsigned items, unsigned size) {
     voidpf buf;
     ulg bsize = (ulg)items*size;
 
@@ -242,8 +224,7 @@ voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, unsigned items, unsigned size)
     return buf;
 }
 
-void ZLIB_INTERNAL zcfree(voidpf opaque, voidpf ptr)
-{
+void ZLIB_INTERNAL zcfree(voidpf opaque, voidpf ptr) {
     int n;
 
     (void)opaque;
@@ -279,14 +260,12 @@ void ZLIB_INTERNAL zcfree(voidpf opaque, voidpf ptr)
 #  define _hfree   hfree
 #endif
 
-voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, uInt items, uInt size)
-{
+voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, uInt items, uInt size) {
     (void)opaque;
     return _halloc((long)items, size);
 }
 
-void ZLIB_INTERNAL zcfree(voidpf opaque, voidpf ptr)
-{
+void ZLIB_INTERNAL zcfree(voidpf opaque, voidpf ptr) {
     (void)opaque;
     _hfree(ptr);
 }
@@ -299,25 +278,18 @@ void ZLIB_INTERNAL zcfree(voidpf opaque, voidpf ptr)
 #ifndef MY_ZCALLOC /* Any system without a special alloc function */
 
 #ifndef STDC
-extern voidp  malloc OF((uInt size));
-extern voidp  calloc OF((uInt items, uInt size));
-extern void   free   OF((voidpf ptr));
+extern voidp malloc(uInt size);
+extern voidp calloc(uInt items, uInt size);
+extern void free(voidpf ptr);
 #endif
 
-voidpf ZLIB_INTERNAL zcalloc(opaque, items, size)
-    voidpf opaque;
-    unsigned items;
-    unsigned size;
-{
+voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, unsigned items, unsigned size) {
     (void)opaque;
     return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
                               (voidpf)calloc(items, size);
 }
 
-void ZLIB_INTERNAL zcfree(opaque, ptr)
-    voidpf opaque;
-    voidpf ptr;
-{
+void ZLIB_INTERNAL zcfree(voidpf opaque, voidpf ptr) {
     (void)opaque;
     free(ptr);
 }
diff --git a/deps/v8/third_party/zlib/zutil.h b/deps/v8/third_party/zlib/zutil.h
index e0466922244edc..6980a5f4ea3446 100644
--- a/deps/v8/third_party/zlib/zutil.h
+++ b/deps/v8/third_party/zlib/zutil.h
@@ -206,9 +206,9 @@ extern z_const char * const z_errmsg[10]; /* indexed by 2-zlib_error */
 /* provide prototypes for these when building zlib without LFS */
 #if !defined(_WIN32) && \
     (!defined(_LARGEFILE64_SOURCE) || _LFS64_LARGEFILE-0 == 0)
-    ZEXTERN uLong ZEXPORT adler32_combine64 OF((uLong, uLong, z_off_t));
-    ZEXTERN uLong ZEXPORT crc32_combine64 OF((uLong, uLong, z_off_t));
-    ZEXTERN uLong ZEXPORT crc32_combine_gen64 OF((z_off_t));
+    ZEXTERN uLong ZEXPORT adler32_combine64(uLong, uLong, z_off_t);
+    ZEXTERN uLong ZEXPORT crc32_combine64(uLong, uLong, z_off_t);
+    ZEXTERN uLong ZEXPORT crc32_combine_gen64(z_off_t);
 #endif
 
         /* common defaults */
@@ -247,16 +247,16 @@ extern z_const char * const z_errmsg[10]; /* indexed by 2-zlib_error */
 #    define zmemzero(dest, len) memset(dest, 0, len)
 #  endif
 #else
-   void ZLIB_INTERNAL zmemcpy OF((Bytef* dest, const Bytef* source, uInt len));
-   int ZLIB_INTERNAL zmemcmp OF((const Bytef* s1, const Bytef* s2, uInt len));
-   void ZLIB_INTERNAL zmemzero OF((Bytef* dest, uInt len));
+   void ZLIB_INTERNAL zmemcpy(Bytef* dest, const Bytef* source, uInt len);
+   int ZLIB_INTERNAL zmemcmp(const Bytef* s1, const Bytef* s2, uInt len);
+   void ZLIB_INTERNAL zmemzero(Bytef* dest, uInt len);
 #endif
 
 /* Diagnostic functions */
 #ifdef ZLIB_DEBUG
 #  include <stdio.h>
    extern int ZLIB_INTERNAL z_verbose;
-   extern void ZLIB_INTERNAL z_error OF((char *m));
+   extern void ZLIB_INTERNAL z_error(char *m);
 #  define Assert(cond,msg) {if(!(cond)) z_error(msg);}
 #  define Trace(x) {if (z_verbose>=0) fprintf x ;}
 #  define Tracev(x) {if (z_verbose>0) fprintf x ;}
@@ -273,9 +273,9 @@ extern z_const char * const z_errmsg[10]; /* indexed by 2-zlib_error */
 #endif
 
 #ifndef Z_SOLO
-   voidpf ZLIB_INTERNAL zcalloc OF((voidpf opaque, unsigned items,
-                                    unsigned size));
-   void ZLIB_INTERNAL zcfree  OF((voidpf opaque, voidpf ptr));
+   voidpf ZLIB_INTERNAL zcalloc(voidpf opaque, unsigned items,
+                                unsigned size);
+   void ZLIB_INTERNAL zcfree(voidpf opaque, voidpf ptr);
 #endif
 
 #define ZALLOC(strm, items, size) \
diff --git a/deps/v8/tools/.vpython3 b/deps/v8/tools/.vpython3
index 38ceb4d20290c9..b3719cd7f30443 100644
--- a/deps/v8/tools/.vpython3
+++ b/deps/v8/tools/.vpython3
@@ -75,9 +75,26 @@ wheel: <
   version: "version:3.19.3"
 >
 
+# requests and its dependencies.
 wheel: <
-  name: "infra/python/wheels/requests-py2_py3"
-  version: "version:2.13.0"
+  name: "infra/python/wheels/requests-py3"
+  version: "version:2.31.0"
+>
+wheel: <
+  name: "infra/python/wheels/urllib3-py2_py3"
+  version: "version:1.26.6"
+>
+wheel: <
+  name: "infra/python/wheels/idna-py2_py3"
+  version: "version:2.8"
+>
+wheel: <
+  name: "infra/python/wheels/certifi-py2_py3"
+  version: "version:2020.11.8"
+>
+wheel: <
+  name: "infra/python/wheels/charset_normalizer-py3"
+  version: "version:2.0.4"
 >
 
 wheel: <
@@ -89,3 +106,8 @@ wheel: <
   name: "infra/python/wheels/clusterfuzz-py2_py3"
   version: "version:2.5.6-5c85ed3d46137b17da04c59bcd805ee5"
 >
+
+wheel: <
+  name: "infra/python/wheels/psutil/${vpython_platform}"
+  version: "version:5.8.0.chromium.3"
+>
diff --git a/deps/v8/tools/bazel/bazel.sha1 b/deps/v8/tools/bazel/bazel.sha1
index 49bbbbadaf3325..c8ad1d7338031a 100644
--- a/deps/v8/tools/bazel/bazel.sha1
+++ b/deps/v8/tools/bazel/bazel.sha1
@@ -1 +1 @@
-f9e04ace61362af959c0ce5a999fc71bd4f00d68
\ No newline at end of file
+0a60b27adfc9cc62713fa631eb84f98de8e9a872
\ No newline at end of file
diff --git a/deps/v8/tools/builtins-pgo/assert_builtins_hashes.py b/deps/v8/tools/builtins-pgo/assert_builtins_hashes.py
new file mode 100644
index 00000000000000..0e2f33ab92b3e5
--- /dev/null
+++ b/deps/v8/tools/builtins-pgo/assert_builtins_hashes.py
@@ -0,0 +1,37 @@
+#!/usr/bin/env python3
+
+# Copyright 2023 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+"""
+Compare builtins hashes from two architectures and enforce their equality.
+Bail out with an error and details on the difference otherwise.
+"""
+
+import difflib
+import sys
+
+assert len(sys.argv) > 3
+
+file1 = sys.argv[1]
+file2 = sys.argv[2]
+report = sys.argv[3]
+
+with open(file1) as f1, open(file2) as f2:
+  diff = list(difflib.unified_diff(
+      f1.read().splitlines(),
+      f2.read().splitlines(),
+      fromfile=file1,
+      tofile=file2,
+      lineterm='',
+  ))
+
+if diff:
+  print('Detected incompatible builtins hashes:')
+  for line in diff:
+    print(line)
+  sys.exit(1)
+
+with open(report, 'w') as f:
+  f.write('No builtins incompatibilities detected.')
diff --git a/deps/v8/tools/builtins-pgo/download_profiles.py b/deps/v8/tools/builtins-pgo/download_profiles.py
index b4fb5867038302..a1cd62442ee2fd 100755
--- a/deps/v8/tools/builtins-pgo/download_profiles.py
+++ b/deps/v8/tools/builtins-pgo/download_profiles.py
@@ -41,7 +41,9 @@ def parse_args(cmd_args):
   parser = argparse.ArgumentParser(
       description=(
           f'Download PGO profiles for V8 builtins generated for the version '
-          f'defined in {VERSION_FILE}.'),
+          f'defined in {VERSION_FILE}. If the current checkout has no version '
+          f'(i.e. build and patch level are 0 in {VERSION_FILE}), no profiles '
+          f'exist and the script returns without errors.'),
       formatter_class=argparse.RawDescriptionHelpFormatter,
       epilog='\n'.join([
           f'examples:', f'  {FILENAME} download',
@@ -97,7 +99,13 @@ def retrieve_version(args):
 
   with open(VERSION_FILE) as f:
     version_tuple = re.search(VERSION_RE, f.read()).groups(0)
-    return '.'.join(version_tuple)
+
+  version = '.'.join(version_tuple)
+  if version_tuple[2] == version_tuple[3] == '0':
+    print(f'The version file specifies {version}, which has no profiles.')
+    sys.exit(0)
+
+  return version
 
 
 def perform_action(version, args):
diff --git a/deps/v8/tools/builtins-pgo/download_profiles_test.py b/deps/v8/tools/builtins-pgo/download_profiles_test.py
index 8ae844f7ea9a2a..a326f5e17f463e 100644
--- a/deps/v8/tools/builtins-pgo/download_profiles_test.py
+++ b/deps/v8/tools/builtins-pgo/download_profiles_test.py
@@ -10,9 +10,9 @@
 import unittest
 
 from tempfile import TemporaryDirectory
-from unittest.mock import patch
+from unittest.mock import patch, mock_open
 
-from download_profiles import main
+from download_profiles import main, parse_args, retrieve_version
 
 
 class TestDownloadProfiles(unittest.TestCase):
@@ -58,5 +58,39 @@ def test_missing_profiles(self):
     self.assertGreater(len(err), 0)
 
 
+class TestRetrieveVersion(unittest.TestCase):
+
+  def mock_version_file(self, major, minor, build, patch):
+    return (
+        f'#define V8_MAJOR_VERSION {major}\n'
+        f'#define V8_MINOR_VERSION {minor}\n'
+        f'#define V8_BUILD_NUMBER {build}\n'
+        f'#define V8_PATCH_LEVEL {patch}\n'
+    )
+
+  def test_retrieve_valid_version(self):
+    with patch(
+        'builtins.open',
+        new=mock_open(read_data=self.mock_version_file(11, 4, 1, 0))):
+      args = parse_args(['download'])
+      version = retrieve_version(args)
+
+    self.assertEqual(version, '11.4.1.0')
+
+  def test_retrieve_parameter_version(self):
+    args = parse_args(['download', '--version', '11.1.1.42'])
+    version = retrieve_version(args)
+    self.assertEqual(version, '11.1.1.42')
+
+  def test_retrieve_untagged_version(self):
+    with patch(
+        'builtins.open',
+        new=mock_open(read_data=self.mock_version_file(11, 4, 0, 0))), \
+        self.assertRaises(SystemExit) as se:
+      args = parse_args(['download'])
+      version = retrieve_version(args)
+
+    self.assertEqual(se.exception.code, 0)
+
 if __name__ == '__main__':
   unittest.main()
diff --git a/deps/v8/tools/builtins-pgo/generate.py b/deps/v8/tools/builtins-pgo/generate.py
index 2760b04d8848ea..dcfdd9a8cde904 100755
--- a/deps/v8/tools/builtins-pgo/generate.py
+++ b/deps/v8/tools/builtins-pgo/generate.py
@@ -19,6 +19,11 @@
     default=None,
     help='target cpu for V8 binary (for simulator builds), by default it\'s equal to `v8_target_cpu`'
 )
+parser.add_argument(
+    '--clang',
+    default=True,
+    help='Use clang for building V8 binaries. Using other compiler helps to get profiles for Windows/gcc. See crbug.com/v8/13647.',
+    action=argparse.BooleanOptionalAction)
 parser.add_argument(
     '--use-qemu',
     default=False,
@@ -36,7 +41,7 @@
 
 args = parser.parse_args()
 
-if args.target_cpu == None:
+if args.target_cpu is None:
   args.target_cpu = args.v8_target_cpu
 
 
@@ -82,7 +87,7 @@ def build_d8(path, gn_args):
     print(f"{args.v8_target_cpu} binaries can't be run with qemu")
     exit(1)
 
-GN_ARGS_TEMPLATE = f"""\
+GN_ARGS_TEMPLATE_CLANG = f"""\
 is_debug = false
 is_clang = true
 target_cpu = "{args.target_cpu}"
@@ -91,8 +96,22 @@ def build_d8(path, gn_args):
 v8_enable_builtins_profiling = true
 """
 
+GN_ARGS_TEMPLATE_NO_CLANG = f"""\
+is_debug = false
+is_clang = false
+use_custom_libcxx = false
+target_cpu = "{args.target_cpu}"
+v8_target_cpu = "{args.v8_target_cpu}"
+use_goma = false
+v8_enable_builtins_profiling = true
+"""
+
+GN_ARGS_TEMPLATE = GN_ARGS_TEMPLATE_CLANG if args.clang else GN_ARGS_TEMPLATE_NO_CLANG
+
 for arch, gn_args in [(args.v8_target_cpu, GN_ARGS_TEMPLATE)]:
-  build_dir = args.out_path / f"{arch}.release.generate_builtin_pgo_profile"
+  # TODO(crbug.com/v8/13647): remove profile suffixes once CSA is fixed.
+  suffix = "" if args.clang else "-rl"
+  build_dir = args.out_path / f"{arch}{suffix}.release.generate_builtin_pgo_profile"
   d8_path = build_d8(build_dir, gn_args)
   benchmark_dir = args.benchmark_path.parent
   benchmark_file = args.benchmark_path.name
@@ -102,5 +121,5 @@ def build_d8(path, gn_args):
   ]
   run(cmd, cwd=benchmark_dir)
   get_hints_path = tools_pgo_dir / "get_hints.py"
-  profile_path = tools_pgo_dir / "profiles" / f"{arch}.profile"
+  profile_path = tools_pgo_dir / "profiles" / f"{arch}{suffix}.profile"
   run([get_hints_path, log_path, profile_path])
diff --git a/deps/v8/tools/builtins-pgo/get_hints.py b/deps/v8/tools/builtins-pgo/get_hints.py
index a91a75db44785f..fcd0cfae13f2da 100755
--- a/deps/v8/tools/builtins-pgo/get_hints.py
+++ b/deps/v8/tools/builtins-pgo/get_hints.py
@@ -37,7 +37,7 @@
 
 PARSER = argparse.ArgumentParser(
     description="A script that generates the branch hints for profile-guided \
-                optimization"                             ,
+                optimization",
     epilog="Example:\n\tget_hints.py --min n1 --ratio n2 branches_file log_file output_file\""
 )
 PARSER.add_argument(
@@ -45,19 +45,18 @@
     type=int,
     default=1000,
     help="The minimum count at which a basic block will be taken as a valid \
-          destination of a hinted branch decision"                                                  )
+          destination of a hinted branch decision")
 PARSER.add_argument(
     '--ratio',
     type=int,
     default=40,
     help="The ratio at which, when compared to the alternative destination's \
           count,a branch destination's count is considered sufficient to \
-          require a branch hint to be produced"                                               )
+          require a branch hint to be produced")
 PARSER.add_argument(
     'log_file',
-    help="The v8.log file produced after running v8 with the \
-          --turbo-profiling-output=log_file flag after building with \
-          v8_enable_builtins_profiling = true")
+    help="The v8.log file produced after running v8 with the --turbo-profiling-output=log_file flag after building with v8_enable_builtins_profiling = true"
+)
 PARSER.add_argument(
     'output_file',
     help="The file which the hints and builtin hashes are written to")
@@ -67,12 +66,17 @@
 BLOCK_COUNT_MARKER = "block"
 BRANCH_HINT_MARKER = "block_hint"
 BUILTIN_HASH_MARKER = "builtin_hash"
+NORMALIZED_BLOCK_COUNT_MARKER = "block_count"
+NORMALIZED_BUILTIN_COUNT_MARKER = "builtin_count"
+
+MAX_NORMALIZED_COUNT = 10000
 
 
 def parse_log_file(log_file):
   block_counts = {}
   branches = []
   builtin_hashes = {}
+  max_execution_count = 0
   try:
     with open(log_file, "r") as f:
       for line in f.readlines():
@@ -81,6 +85,8 @@ def parse_log_file(log_file):
           builtin_name = fields[1]
           block_id = int(fields[2])
           count = float(fields[3])
+          if block_id == 0 and count > max_execution_count:
+            max_execution_count = count
           if builtin_name not in block_counts:
             block_counts[builtin_name] = []
           while len(block_counts[builtin_name]) <= block_id:
@@ -104,7 +110,7 @@ def parse_log_file(log_file):
   except IOError as e:
     print(f"Cannot read from {log_file}. {e.strerror}.")
     sys.exit(1)
-  return [block_counts, branches, builtin_hashes]
+  return [block_counts, branches, builtin_hashes, max_execution_count]
 
 
 def get_branch_hints(block_counts, branches, min_count, threshold_ratio):
@@ -129,12 +135,42 @@ def get_branch_hints(block_counts, branches, min_count, threshold_ratio):
   return branch_hints
 
 
-def write_hints_to_output(output_file, branch_hints, builtin_hashes):
+def normalize_count(block_counts, max_count):
+  normalized_block_counts = {}
+
+  for builtin in block_counts:
+    for block, count in enumerate(block_counts[builtin]):
+      block_count_normalized = int(count * MAX_NORMALIZED_COUNT / max_count)
+      if builtin not in normalized_block_counts:
+        normalized_block_counts[builtin] = {}
+      normalized_block_counts[builtin][block] = block_count_normalized
+
+  return normalized_block_counts
+
+
+def write_hints_to_output(output_file, branch_hints, builtin_hashes,
+                          block_counts):
   try:
     with open(output_file, "w") as f:
       for key in branch_hints:
         f.write("{},{},{},{},{}\n".format(BRANCH_HINT_MARKER, key[0], key[1],
                                           key[2], branch_hints[key]))
+      # Put the NORMALIZED_BUILTIN_COUNT_MARKER before NORMALIZED_BLOCK_COUNT_MARKER,
+      # because we will use them to calculate call probability.
+      # The normalized count of a builtin/block means how much frequently the
+      # builtin/block was executed.
+      # We will take it as "density" of the builtin/block in post process, hence
+      # the execution time could be "density * size".
+      for builtin_name in block_counts.keys():
+        f.write("{},{},{}\n".format(NORMALIZED_BUILTIN_COUNT_MARKER,
+                                    builtin_name,
+                                    block_counts[builtin_name][0]))
+
+      for builtin_name in block_counts:
+        for block_id in block_counts[builtin_name]:
+          f.write("{},{},{},{}\n".format(NORMALIZED_BLOCK_COUNT_MARKER,
+                                         builtin_name, block_id,
+                                         block_counts[builtin_name][block_id]))
 
       for builtin_name in builtin_hashes:
         f.write("{},{},{}\n".format(BUILTIN_HASH_MARKER, builtin_name,
@@ -144,8 +180,12 @@ def write_hints_to_output(output_file, branch_hints, builtin_hashes):
     sys.exit(1)
 
 
-[block_counts, branches, builtin_hashes] = parse_log_file(ARGS['log_file'])
+[block_counts, branches, builtin_hashes,
+ max_count] = parse_log_file(ARGS['log_file'])
 branch_hints = get_branch_hints(block_counts, branches, ARGS['min'],
                                 ARGS['ratio'])
 
-write_hints_to_output(ARGS['output_file'], branch_hints, builtin_hashes)
+block_counts = normalize_count(block_counts, max_count)
+
+write_hints_to_output(ARGS['output_file'], branch_hints, builtin_hashes,
+                      block_counts)
diff --git a/deps/v8/tools/builtins-pgo/profile_only.py b/deps/v8/tools/builtins-pgo/profile_only.py
index cf3d43c4c6e3f6..ca05a86c647429 100755
--- a/deps/v8/tools/builtins-pgo/profile_only.py
+++ b/deps/v8/tools/builtins-pgo/profile_only.py
@@ -13,7 +13,7 @@
 def main():
   args = parse_arguments()
   run_benchmark(args.benchmark_path, args.d8_path, args.output_dir)
-  run_get_hints(args.output_dir, args.v8_target_cpu)
+  run_get_hints(args.output_dir, args.profile_name)
 
 
 def parse_arguments():
@@ -22,7 +22,7 @@ def parse_arguments():
                    'The script is designed to run in swarming context where '
                    'the isolate aready contains the instrumented binary.'))
   parser.add_argument(
-      '--v8-target-cpu',
+      '--profile-name',
       default='pgo',
       help='target cpu to build the profile for: x64 or arm64')
   parser.add_argument(
@@ -63,11 +63,11 @@ def benchmark_log_path(output_dir):
   return (output_dir / "v8.builtins.pgo").absolute()
 
 
-def run_get_hints(output_dir, v8_target_cpu):
+def run_get_hints(output_dir, profile_name):
   get_hints_path = (tools_pgo_dir() / "get_hints.py").absolute()
   assert get_hints_path.exists(), "Could not find get_hints.py script path!"
 
-  profile_path = (output_dir / f"{v8_target_cpu}.profile").absolute()
+  profile_path = (output_dir / f"{profile_name}.profile").absolute()
   run([
       sys.executable, '-u', get_hints_path,
       benchmark_log_path(output_dir), profile_path
diff --git a/deps/v8/tools/callstats-from-telemetry.sh b/deps/v8/tools/callstats-from-telemetry.sh
index 3572b7e6ba8bc8..32b16b36474f5d 100755
--- a/deps/v8/tools/callstats-from-telemetry.sh
+++ b/deps/v8/tools/callstats-from-telemetry.sh
@@ -33,9 +33,11 @@ done
 if [[ "$1" == *.json ]]; then
   echo "Converting json files"
   JSON=$1
+  OUT="${JSON%.json}.rcs.json"
 elif [[ -e "$1" ]]; then
-  echo "Converting reults dir"
+  echo "Converting results dir"
   RESULTS_DIR=$1
+  OUT="${RESULTS_DIR}/combined.rcs.json"
 else
   echo "RESULTS_DIR '$RESULTS_DIR' not found";
   usage;
@@ -43,7 +45,6 @@ else
 fi
 
 
-OUT=out.json
 if [[ -e $OUT ]]; then
   echo "# Creating backup for $OUT"
   cp $OUT $OUT.bak
@@ -78,3 +79,7 @@ else
   done
 fi
 echo '}}' >> $OUT
+
+
+echo ""
+echo "RESULT: ${OUT}"
diff --git a/deps/v8/tools/callstats.html b/deps/v8/tools/callstats.html
index 0664d5a6ff734a..d5e440cf74bfcf 100644
--- a/deps/v8/tools/callstats.html
+++ b/deps/v8/tools/callstats.html
@@ -757,6 +757,10 @@
 
     let selectedGroup;
 
+    function cleanUpFileName(name) {
+      return name.replace(/(\.rcs)?\.txt|\.json$/, "")
+    }
+
     class ChartRow {
       static kSortFirstValueRelative(chartRow) {
         if (selectedGroup?.isTotal) return chartRow.total;
@@ -1422,7 +1426,7 @@
     }
 
     function handleLoadTXT(txt, append, fileName) {
-      fileName = window.prompt('Version name:', fileName);
+      fileName = window.prompt('Version name:', cleanUpFileName(fileName));
       let isFirstLoad = pages === undefined;
       // Load raw RCS output which contains a single page
       if (!append || isFirstLoad) {
@@ -1549,7 +1553,8 @@
       };
       const maybeMetrics = firstProperty(json);
       const maybeMetric = firstProperty(maybeMetrics);
-      const tempName = name ? name : new Date().toISOString();
+      let tempName = new Date().toISOString();
+      if (name) tempName = cleanUpFileName(name);
       const getFileName =
           () => window.prompt('Enter a name for the loaded file:', tempName);
       if ('count' in maybeMetric && 'duration' in maybeMetric) {
@@ -1939,6 +1944,7 @@
           Group.groups.get('parse-background').entry(),
           Group.groups.get('parse').entry(),
           Group.groups.get('blink').entry(),
+          Group.groups.get('network-data').entry(),
           Group.groups.get('callback').entry(),
           Group.groups.get('api').entry(),
           Group.groups.get('gc-custom').entry(),
@@ -2089,7 +2095,7 @@
           if (line.startsWith(kCommentStart)) {
             // Check for page names
             if (line.startsWith(kPageNameIdentifier)) {
-              const name = line.split(kPageNameIdentifier)[1];
+              const name = line.split(kPageNameIdentifier)[1].trim();
               pageVersion = new PageVersion(version, pages.get(name));
               result.push(pageVersion);
             }
@@ -2270,6 +2276,8 @@
     Group.add('parse-background',
       new Group('Parse-Background', /.*Parse-?Background.*/, "#c05000"));
     Group.add('parse', new Group('Parse', /.*Parse.*/, "#FF6600"));
+    Group.add('network-data',
+      new Group('Network Data', /.*GetMoreDataCallback.*/, "#103366"));
     Group.add('callback',
       new Group('Blink C++', /.*(Callback)|(Blink C\+\+).*/, "#109618"));
     Group.add('api', new Group('API', /.*API.*/, "#990099"));
diff --git a/deps/v8/tools/callstats.py b/deps/v8/tools/callstats.py
index dbeb1c9721da71..f7bc7a05f4b202 100755
--- a/deps/v8/tools/callstats.py
+++ b/deps/v8/tools/callstats.py
@@ -28,9 +28,6 @@
 import subprocess
 import sys
 import tempfile
-import operator
-from callstats_groups import RUNTIME_CALL_STATS_GROUPS
-
 import numpy
 from math import sqrt
 
diff --git a/deps/v8/tools/callstats_groups.py b/deps/v8/tools/callstats_groups.py
index 62898c61c80738..88acefbac88e66 100644
--- a/deps/v8/tools/callstats_groups.py
+++ b/deps/v8/tools/callstats_groups.py
@@ -13,10 +13,12 @@
     ('Group-Compile', re.compile("(^Compile.*)|(.*_Compile.*)")),
     ('Group-ParseBackground', re.compile(".*ParseBackground.*")),
     ('Group-Parse', re.compile(".*Parse.*")),
-    ('Group-Callback', re.compile(".*Callback.*")),
+    ('Group-Network-Data', re.compile(".*GetMoreDataCallback.*")),
+    ('Group-Callback', re.compile(".*(Callback)|(Blink \+\+).*")),
     ('Group-API', re.compile(".*API.*")),
     ('Group-GC-Custom', re.compile("GC_Custom_.*")),
     ('Group-GC-Background', re.compile(".*GC.*BACKGROUND.*")),
     ('Group-GC', re.compile("GC_.*|AllocateInTargetSpace")),
     ('Group-JavaScript', re.compile("JS_Execution")),
-    ('Group-Runtime', re.compile(".*"))]
+    ('Group-Runtime', re.compile(".*"))
+]
diff --git a/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output.txt b/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output.txt
index 8be71d9db27174..6076dc45cca9a8 100644
--- a/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output.txt
+++ b/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output.txt
@@ -9,9 +9,9 @@
 # Compared x64,ignition with x64,ignition_turbo
 #
 # Flags of x64,ignition:
---correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --turbo-filter=~ --no-turbofan --no-sparkplug --liftoff --no-wasm-tier-up --no-maglev --flag1 --flag2=0
+--correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --js-staging --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --turbo-filter=~ --no-turbofan --no-sparkplug --liftoff --no-wasm-tier-up --no-maglev --flag1 --flag2=0
 # Flags of x64,ignition_turbo:
---correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --flag3
+--correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --js-staging --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --flag3
 #
 # Difference:
 - unknown
diff --git a/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output_arch.txt b/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output_arch.txt
index 1d75ba592b0ef1..8ea9311467de32 100644
--- a/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output_arch.txt
+++ b/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output_arch.txt
@@ -9,9 +9,9 @@
 # Compared x64,ignition with x64,ignition_turbo
 #
 # Flags of x64,ignition:
---correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --turbo-filter=~ --no-turbofan --no-sparkplug --liftoff --no-wasm-tier-up --no-maglev
+--correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --js-staging --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --turbo-filter=~ --no-turbofan --no-sparkplug --liftoff --no-wasm-tier-up --no-maglev
 # Flags of x64,ignition_turbo:
---correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --bad-flag
+--correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --js-staging --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --bad-flag
 #
 # Difference:
 + bad behavior
diff --git a/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output_second.txt b/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output_second.txt
index 2a8097fb3981d8..fc11a6bbfa2d3c 100644
--- a/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output_second.txt
+++ b/deps/v8/tools/clusterfuzz/foozzie/testdata/failure_output_second.txt
@@ -9,9 +9,9 @@
 # Compared x64,ignition with ia32,ignition_turbo
 #
 # Flags of x64,ignition:
---correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --turbo-filter=~ --no-turbofan --no-sparkplug --liftoff --no-wasm-tier-up --no-maglev
+--correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --js-staging --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --turbo-filter=~ --no-turbofan --no-sparkplug --liftoff --no-wasm-tier-up --no-maglev
 # Flags of ia32,ignition_turbo:
---correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --very-bad-flag
+--correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --js-staging --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --very-bad-flag
 #
 # Difference:
 + very bad behavior
diff --git a/deps/v8/tools/clusterfuzz/foozzie/testdata/smoke_test_output.txt b/deps/v8/tools/clusterfuzz/foozzie/testdata/smoke_test_output.txt
index 11aa471e52b632..c1cfd672b9eef1 100644
--- a/deps/v8/tools/clusterfuzz/foozzie/testdata/smoke_test_output.txt
+++ b/deps/v8/tools/clusterfuzz/foozzie/testdata/smoke_test_output.txt
@@ -9,9 +9,9 @@
 # Compared x64,ignition with x64,ignition_turbo
 #
 # Flags of x64,ignition:
---correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --turbo-filter=~ --no-turbofan --no-sparkplug --liftoff --no-wasm-tier-up --no-maglev
+--correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --js-staging --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345 --turbo-filter=~ --no-turbofan --no-sparkplug --liftoff --no-wasm-tier-up --no-maglev
 # Flags of x64,ignition_turbo:
---correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345
+--correctness-fuzzer-suppressions --expose-gc --fuzzing --allow-natives-for-differential-fuzzing --invoke-weak-callbacks --omit-quit --harmony --js-staging --wasm-staging --no-wasm-async-compilation --wasm-max-mem-pages=32767 --suppress-asm-messages --random-seed 12345
 #
 # Difference:
 - unknown
diff --git a/deps/v8/tools/clusterfuzz/foozzie/v8_commands.py b/deps/v8/tools/clusterfuzz/foozzie/v8_commands.py
index f5a1de044c7109..e9844a43366d9e 100644
--- a/deps/v8/tools/clusterfuzz/foozzie/v8_commands.py
+++ b/deps/v8/tools/clusterfuzz/foozzie/v8_commands.py
@@ -10,8 +10,6 @@
 import sys
 from threading import Event, Timer
 
-import v8_fuzz_config
-
 PYTHON3 = sys.version_info >= (3, 0)
 
 # List of default flags passed to each d8 run.
@@ -23,6 +21,7 @@
     '--invoke-weak-callbacks',
     '--omit-quit',
     '--harmony',
+    '--js-staging',
     '--wasm-staging',
     '--no-wasm-async-compilation',
     # Limit wasm memory to just below 2GiB, to avoid differences between 32-bit
@@ -107,27 +106,32 @@ def flags(self):
 
 
 class Output(object):
-  def __init__(self, exit_code, stdout, pid):
+  def __init__(self, exit_code, stdout_bytes, pid):
     self.exit_code = exit_code
-    self.stdout = stdout
+    self.stdout_bytes = stdout_bytes
     self.pid = pid
 
+  @property
+  def stdout(self):
+    if PYTHON3:
+      try:
+        return self.stdout_bytes.decode('utf-8')
+      except UnicodeDecodeError:
+        return self.stdout_bytes.decode('latin-1')
+    return self.stdout_bytes
+
   def HasCrashed(self):
     return self.exit_code < 0
 
 
 def Execute(args, cwd, timeout=None):
   popen_args = [c for c in args if c != ""]
-  kwargs = {}
-  if PYTHON3:
-    kwargs['encoding'] = 'utf-8'
   try:
     process = subprocess.Popen(
       args=popen_args,
       stdout=subprocess.PIPE,
       stderr=subprocess.PIPE,
       cwd=cwd,
-      **kwargs
     )
   except Exception as e:
     sys.stderr.write("Error executing: %s\n" % popen_args)
@@ -144,7 +148,7 @@ def kill_process():
 
   timer = Timer(timeout, kill_process)
   timer.start()
-  stdout, _ = process.communicate()
+  stdout_bytes, _ = process.communicate()
   timer.cancel()
 
   if timeout_event.is_set():
@@ -152,6 +156,6 @@ def kill_process():
 
   return Output(
       process.returncode,
-      stdout,
+      stdout_bytes,
       process.pid,
   )
diff --git a/deps/v8/tools/clusterfuzz/foozzie/v8_foozzie.py b/deps/v8/tools/clusterfuzz/foozzie/v8_foozzie.py
index a24a2dce235b9f..19e92386e790e9 100755
--- a/deps/v8/tools/clusterfuzz/foozzie/v8_foozzie.py
+++ b/deps/v8/tools/clusterfuzz/foozzie/v8_foozzie.py
@@ -12,10 +12,8 @@
 
 import argparse
 import hashlib
-import itertools
 import json
 import os
-import random
 import re
 import sys
 import traceback
@@ -110,7 +108,6 @@
 
 SUPPORTED_ARCHS = ['ia32', 'x64', 'arm', 'arm64']
 
-# Output for suppressed failure case.
 FAILURE_HEADER_TEMPLATE = """#
 # V8 correctness failure
 # V8 correctness configs: %(configs)s
@@ -118,8 +115,14 @@
 # V8 correctness suppression: %(suppression)s
 """
 
+COMPACT_FAILURE_HEADER_TEMPLATE = """#
+# V8 correctness failure
+# V8 correctness sources: %(source_key)s
+# V8 correctness suppression: %(suppression)s
+"""
+
 # Extended output for failure case. The 'CHECK' is for the minimizer.
-FAILURE_TEMPLATE = FAILURE_HEADER_TEMPLATE + """#
+DETAILS_TEMPLATE = """#
 # CHECK
 #
 # Compared %(first_config_label)s with %(second_config_label)s
@@ -141,6 +144,9 @@
 ### End of configuration %(second_config_label)s
 """
 
+FAILURE_TEMPLATE = FAILURE_HEADER_TEMPLATE + DETAILS_TEMPLATE
+COMPACT_FAILURE_TEMPLATE = COMPACT_FAILURE_HEADER_TEMPLATE + DETAILS_TEMPLATE
+
 SOURCE_FILE_TEMPLATE = """
 #
 # Source file:
@@ -152,7 +158,8 @@
 
 # The number of hex digits used from the hash of the original source file path.
 # Keep the number small to avoid duplicate explosion.
-ORIGINAL_SOURCE_HASH_LENGTH = 3
+SOURCE_HASH_LENGTH = 3
+COMPACT_SOURCE_HASH_LENGTH = 2
 
 # Placeholder string if no original source file could be determined.
 ORIGINAL_SOURCE_DEFAULT = 'none'
@@ -316,6 +323,9 @@ def parse_args():
   parser.add_argument(
       '--skip-suppressions', default=False, action='store_true',
       help='skip suppressions to reproduce known issues')
+  parser.add_argument(
+      '--compact', default=False, action='store_true',
+      help='use more compact error reporting with fewer duplicates')
 
   # Add arguments for each run configuration.
   first_config_arguments.add_arguments(parser, BASELINE_CONFIG)
@@ -379,10 +389,10 @@ def fail_bailout(output, ignore_by_output_fun):
 def format_difference(
     first_config, second_config,
     first_config_output, second_config_output,
-    difference, source_key=None, source=None):
+    difference, source_key=None, source=None, compact=False):
   # The first three entries will be parsed by clusterfuzz. Format changes
   # will require changes on the clusterfuzz side.
-  source_key = source_key or cluster_failures(source)
+  source_key = source_key or cluster_failures(source, compact)
   first_config_label = '%s,%s' % (first_config.arch, first_config.config)
   second_config_label = '%s,%s' % (second_config.arch, second_config.config)
   source_file_text = SOURCE_FILE_TEMPLATE % source if source else ''
@@ -395,7 +405,8 @@ def format_difference(
     second_stdout = second_config_output.stdout.decode('utf-8', 'replace')
     difference = difference.decode('utf-8', 'replace')
 
-  text = (FAILURE_TEMPLATE % dict(
+  template = COMPACT_FAILURE_TEMPLATE if compact else FAILURE_TEMPLATE
+  text = (template % dict(
       configs='%s:%s' % (first_config_label, second_config_label),
       source_file_text=source_file_text,
       source_key=source_key,
@@ -415,11 +426,12 @@ def format_difference(
     return text.encode('utf-8', 'replace')
 
 
-def cluster_failures(source, known_failures=None):
+def cluster_failures(source, compact, known_failures=None):
   """Returns a string key for clustering duplicate failures.
 
   Args:
     source: The original source path where the failure happened.
+    compact: Whether to use compact source hashes.
     known_failures: Mapping from original source path to failure key.
   """
   known_failures = known_failures or KNOWN_FAILURES
@@ -437,7 +449,8 @@ def cluster_failures(source, known_failures=None):
 
   # We map all remaining failures to a short hash of the original source.
   long_key = hashlib.sha1(source.encode('utf-8')).hexdigest()
-  return long_key[:ORIGINAL_SOURCE_HASH_LENGTH]
+  hash_length = COMPACT_SOURCE_HASH_LENGTH if compact else SOURCE_HASH_LENGTH
+  return long_key[:hash_length]
 
 
 class RepeatedRuns(object):
@@ -464,7 +477,8 @@ def crash_state(self):
 
 
 def run_comparisons(suppress, execution_configs, test_case, timeout,
-                    verbose=True, ignore_crashes=True, source_key=None):
+                    verbose=True, ignore_crashes=True, source_key=None,
+                    compact=False):
   """Runs different configurations and bails out on output difference.
 
   Args:
@@ -479,6 +493,7 @@ def run_comparisons(suppress, execution_configs, test_case, timeout,
         and immediately flag crashes as a failure.
     source_key: A fixed source key. If not given, it will be inferred from the
         output.
+    compact: Whether to use compact failure output.
   """
   runner = RepeatedRuns(test_case, timeout, verbose)
 
@@ -512,9 +527,8 @@ def run_comparisons(suppress, execution_configs, test_case, timeout,
           difference = fallback_difference
 
       raise FailException(format_difference(
-          baseline_config, comparison_config,
-          baseline_output, comparison_output,
-          difference, source_key, source))
+          baseline_config, comparison_config, baseline_output,
+          comparison_output, difference, source_key, source, compact))
 
   if runner.has_crashed:
     if ignore_crashes:
@@ -564,6 +578,7 @@ def main():
         # Special source key for smoke tests so that clusterfuzz dedupes all
         # cases on this in case it's hit.
         source_key = 'smoke test failed',
+        compact = options.compact,
     )
 
   # Second, run all configs against the fuzz test case.
@@ -571,6 +586,7 @@ def main():
       suppress, execution_configs,
       test_case=options.testcase,
       timeout=TEST_TIMEOUT_SEC,
+      compact = options.compact,
   )
 
   # TODO(machenbach): Figure out if we could also return a bug in case
diff --git a/deps/v8/tools/clusterfuzz/foozzie/v8_foozzie_test.py b/deps/v8/tools/clusterfuzz/foozzie/v8_foozzie_test.py
index 796ee5d0c73da2..74b11e61115d44 100755
--- a/deps/v8/tools/clusterfuzz/foozzie/v8_foozzie_test.py
+++ b/deps/v8/tools/clusterfuzz/foozzie/v8_foozzie_test.py
@@ -5,6 +5,7 @@
 
 import os
 import random
+import re
 import subprocess
 import sys
 import unittest
@@ -102,18 +103,22 @@ def testCluster(self):
     crash_test_example_path = 'CrashTests/path/to/file.js'
     self.assertEqual(
         v8_foozzie.ORIGINAL_SOURCE_DEFAULT,
-        v8_foozzie.cluster_failures(''))
+        v8_foozzie.cluster_failures('', compact=False))
     self.assertEqual(
         v8_foozzie.ORIGINAL_SOURCE_CRASHTESTS,
-        v8_foozzie.cluster_failures(crash_test_example_path))
+        v8_foozzie.cluster_failures(crash_test_example_path, compact=False))
     self.assertEqual(
         '_o_O_',
         v8_foozzie.cluster_failures(
             crash_test_example_path,
+            compact=False,
             known_failures={crash_test_example_path: '_o_O_'}))
     self.assertEqual(
         '980',
-        v8_foozzie.cluster_failures('v8/test/mjsunit/apply.js'))
+        v8_foozzie.cluster_failures('v8/test/mjsunit/apply.js', compact=False))
+    self.assertEqual(
+        '98',
+        v8_foozzie.cluster_failures('v8/test/mjsunit/apply.js', compact=True))
 
   def testDiff(self):
     def diff_fun(one, two, skip=False):
@@ -198,14 +203,15 @@ def diff_fun(one, two, skip=False):
   def testOutputCapping(self):
     def output(stdout, is_crash):
       exit_code = -1 if is_crash else 0
-      return v8_commands.Output(exit_code=exit_code, stdout=stdout, pid=0)
+      return v8_commands.Output(
+          exit_code=exit_code, stdout_bytes=stdout.encode('utf-8'), pid=0)
 
     def check(stdout1, stdout2, is_crash1, is_crash2, capped_lines1,
               capped_lines2):
       output1 = output(stdout1, is_crash1)
       output2 = output(stdout2, is_crash2)
       self.assertEqual(
-          (capped_lines1, capped_lines2),
+          (capped_lines1.encode('utf-8'), capped_lines2.encode('utf-8')),
           v8_suppressions.get_output_capped(output1, output2))
 
     # No capping, already equal.
@@ -276,6 +282,12 @@ def run_foozzie(second_d8_dir, *extra_flags, **kwargs):
     os.path.join(TEST_DATA, 'fuzz-123.js'),
   ] + list(extra_flags), **kwargs)
 
+
+def expected_output(file_name):
+  with open(os.path.join(TEST_DATA, file_name)) as f:
+    return f.read()
+
+
 class SystemTest(unittest.TestCase):
   """This tests the whole correctness-fuzzing harness with fake build
   artifacts.
@@ -298,26 +310,34 @@ def testSyntaxErrorDiffPass(self):
     self.assertNotIn('v8_mock_archs.js', stdout)
     self.assertNotIn('v8_mock_webassembly.js', stdout)
 
-  def testDifferentOutputFail(self):
-    with open(os.path.join(TEST_DATA, 'failure_output.txt')) as f:
-      expected_output = f.read()
+  def _testDifferentOutputFail(self, expected, *args):
     with self.assertRaises(subprocess.CalledProcessError) as ctx:
       run_foozzie('build2', '--skip-smoke-tests',
                   '--first-config-extra-flags=--flag1',
                   '--first-config-extra-flags=--flag2=0',
-                  '--second-config-extra-flags=--flag3')
+                  '--second-config-extra-flags=--flag3', *args)
     e = ctx.exception
     self.assertEqual(v8_foozzie.RETURN_FAIL, e.returncode)
-    self.assertEqual(expected_output, cut_verbose_output(e.output, 2))
+    self.assertEqual(expected, cut_verbose_output(e.output, 2))
+
+  def testDifferentOutputFail(self):
+    self._testDifferentOutputFail(expected_output('failure_output.txt'))
+
+  def testFailCompact(self):
+    # Compact output drops the config line and uses a shorter hash.
+    compact_output = expected_output('failure_output.txt')
+    compact_output = re.sub(
+        r'# V8 correctness configs: .*\n', '', compact_output)
+    compact_output = re.sub(
+        r'sources: f60', 'sources: f6', compact_output)
+    self._testDifferentOutputFail(compact_output, '--compact')
 
   def testSmokeTest(self):
-    with open(os.path.join(TEST_DATA, 'smoke_test_output.txt')) as f:
-      expected_output = f.read()
     with self.assertRaises(subprocess.CalledProcessError) as ctx:
       run_foozzie('build2')
     e = ctx.exception
     self.assertEqual(v8_foozzie.RETURN_FAIL, e.returncode)
-    self.assertEqual(expected_output, e.output)
+    self.assertEqual(expected_output('smoke_test_output.txt'), e.output)
 
   def testDifferentArch(self):
     """Test that the architecture-specific mocks are passed to both runs when
diff --git a/deps/v8/tools/clusterfuzz/foozzie/v8_fuzz_flags.json b/deps/v8/tools/clusterfuzz/foozzie/v8_fuzz_flags.json
index e164b218c6fa0d..08c836072bcd96 100644
--- a/deps/v8/tools/clusterfuzz/foozzie/v8_fuzz_flags.json
+++ b/deps/v8/tools/clusterfuzz/foozzie/v8_fuzz_flags.json
@@ -9,7 +9,7 @@
   [0.01, "--thread-pool-size=2"],
   [0.01, "--thread-pool-size=4"],
   [0.01, "--thread-pool-size=8"],
-  [0.1, "--interrupt-budget=1000"],
+  [0.25, "--jit-fuzzing"],
   [0.25, "--future"],
   [0.2, "--no-regexp-tier-up"],
   [0.1, "--regexp-interpret-all"],
@@ -26,12 +26,11 @@
   [0.1, "--no-enable-lzcnt"],
   [0.1, "--no-enable-popcnt"],
   [0.25, "--no-lazy-feedback-allocation"],
-  [0.1, "--no-lazy-feedback-allocation --interrupt-budget=100"],
-  [0.05, "--interrupt-budget-for-feedback-allocation=0"],
   [0.1, "--no-wasm-generic-wrapper"],
   [0.2, "--turboshaft"],
   [0.1, "--turbo-force-mid-tier-regalloc"],
   [0.0001, "--simulate-errors"],
-  [0.1, "--minor-mc"],
+  [0.25, "--minor-ms"],
+  [0.1, "--concurrent-minor-ms-marking"],
   [0.1, "--shared-string-table"]
 ]
diff --git a/deps/v8/tools/clusterfuzz/foozzie/v8_mock.js b/deps/v8/tools/clusterfuzz/foozzie/v8_mock.js
index d2dc9e27b1d55b..e1d104bd659342 100644
--- a/deps/v8/tools/clusterfuzz/foozzie/v8_mock.js
+++ b/deps/v8/tools/clusterfuzz/foozzie/v8_mock.js
@@ -193,8 +193,9 @@ Object.defineProperty(
           args[1] = min(args[1], buffer.byteLength || 0);
           if (args.length > 2) {
             // If also length is given, limit it to the maximum that's possible
-            // given buffer and offset.
-            const maxBytesLeft = buffer.byteLength - args[1];
+            // given buffer and offset. Avoid NaN offset turning the length
+            // NaN, too.
+            const maxBytesLeft = buffer.byteLength - (args[1] || 0);
             const maxLengthLeft = maxBytesLeft / type.BYTES_PER_ELEMENT;
             args[2] = min(Number(args[2]), maxLengthLeft);
           }
@@ -290,3 +291,6 @@ Atomics.waitAsync = function() {
   // immediately.
   return {'value': {'then': function (f) { f(); }}};
 }
+
+// Mock serializer API with no-ops.
+d8.serializer = {'serialize': (x) => x, 'deserialize': (x) => x}
diff --git a/deps/v8/tools/clusterfuzz/foozzie/v8_suppressions.py b/deps/v8/tools/clusterfuzz/foozzie/v8_suppressions.py
index 18f9de7ac1d8ff..ba0d9b92445faa 100644
--- a/deps/v8/tools/clusterfuzz/foozzie/v8_suppressions.py
+++ b/deps/v8/tools/clusterfuzz/foozzie/v8_suppressions.py
@@ -30,9 +30,11 @@
 try:
   # Python 3
   from itertools import zip_longest
+  PYTHON3 = True
 except ImportError:
   # Python 2
   from itertools import izip_longest as zip_longest
+  PYTHON3 = False
 
 # Max line length for regular experessions checking for lines to ignore.
 MAX_LINE_LENGTH = 512
@@ -91,27 +93,27 @@
 
 
 def get_output_capped(output1, output2):
-  """Returns a pair of stdout strings.
+  """Returns a pair of stdout byte arrays.
 
-  The strings are safely capped if at least one run has crashed.
+  The arrays are safely capped if at least one run has crashed.
   """
 
   # No length difference or no crash -> no capping.
-  if (len(output1.stdout) == len(output2.stdout) or
+  if (len(output1.stdout_bytes) == len(output2.stdout_bytes) or
       (not output1.HasCrashed() and not output2.HasCrashed())):
-    return output1.stdout, output2.stdout
+    return output1.stdout_bytes, output2.stdout_bytes
 
   # Both runs have crashed, cap by the shorter output.
   if output1.HasCrashed() and output2.HasCrashed():
-    cap = min(len(output1.stdout), len(output2.stdout))
+    cap = min(len(output1.stdout_bytes), len(output2.stdout_bytes))
   # Only the first run has crashed, cap by its output length.
   elif output1.HasCrashed():
-    cap = len(output1.stdout)
+    cap = len(output1.stdout_bytes)
   # Similar if only the second run has crashed.
   else:
-    cap = len(output2.stdout)
+    cap = len(output2.stdout_bytes)
 
-  return output1.stdout[0:cap], output2.stdout[0:cap]
+  return output1.stdout_bytes[0:cap], output2.stdout_bytes[0:cap]
 
 
 def line_pairs(lines):
@@ -212,6 +214,13 @@ def fun(line):
 def get_suppression(skip=False):
   return V8Suppression(skip)
 
+def decode(output):
+  if PYTHON3:
+    try:
+      return output.decode('utf-8')
+    except UnicodeDecodeError:
+      return output.decode('latin-1')
+  return output
 
 class V8Suppression(object):
   def __init__(self, skip):
@@ -227,7 +236,7 @@ def __init__(self, skip):
   def diff(self, output1, output2):
     # Diff capped lines in the presence of crashes.
     return self.diff_lines(
-        *map(str.splitlines, get_output_capped(output1, output2)))
+        *map(str.splitlines, map(decode, get_output_capped(output1, output2))))
 
   def diff_lines(self, output1_lines, output2_lines):
     return diff_output(
diff --git a/deps/v8/tools/clusterfuzz/js_fuzzer/exceptions.js b/deps/v8/tools/clusterfuzz/js_fuzzer/exceptions.js
index 4269a383d137c0..b11c9fd92e3783 100644
--- a/deps/v8/tools/clusterfuzz/js_fuzzer/exceptions.js
+++ b/deps/v8/tools/clusterfuzz/js_fuzzer/exceptions.js
@@ -105,6 +105,7 @@ const DISALLOWED_FLAGS = [
     '--allow-natives-syntax',
     '--debug-code',
     '--harmony',
+    '--js-staging',
     '--wasm-staging',
     '--expose-gc',
     '--expose_gc',
diff --git a/deps/v8/tools/clusterfuzz/js_fuzzer/foozzie_launcher.py b/deps/v8/tools/clusterfuzz/js_fuzzer/foozzie_launcher.py
index 2d1a0fe9963af4..dd19d7ad1f9bfe 100644
--- a/deps/v8/tools/clusterfuzz/js_fuzzer/foozzie_launcher.py
+++ b/deps/v8/tools/clusterfuzz/js_fuzzer/foozzie_launcher.py
@@ -12,7 +12,6 @@
 for a transition period.
 """
 
-import os
 import re
 import shutil
 import subprocess
@@ -45,6 +44,5 @@ def find_harness_code(args):
     python_exe = 'python2'
 
   process = subprocess.Popen([python_exe] + args)
-  process = subprocess.Popen(args)
   process.communicate()
   sys.exit(process.returncode)
diff --git a/deps/v8/tools/clusterfuzz/js_fuzzer/package-lock.json b/deps/v8/tools/clusterfuzz/js_fuzzer/package-lock.json
index 85eb89d09d93c1..0481340ec88e4f 100644
--- a/deps/v8/tools/clusterfuzz/js_fuzzer/package-lock.json
+++ b/deps/v8/tools/clusterfuzz/js_fuzzer/package-lock.json
@@ -137,6 +137,50 @@
       "integrity": "sha512-yprFYuno9FtNsSHVlSWd+nRlmGoAbqbeCwOryP6sC/zoCjhpArcRMYp19EvpSUSizJAlsXEwJv+wcWS9XaXdMw==",
       "dev": true
     },
+    "@sinonjs/commons": {
+      "version": "1.8.6",
+      "resolved": "https://registry.npmjs.org/@sinonjs/commons/-/commons-1.8.6.tgz",
+      "integrity": "sha512-Ky+XkAkqPZSm3NLBeUng77EBQl3cmeJhITaGHdYH8kjVB+aun3S4XBRti2zt17mtt0mIUDiNxYeoJm6drVvBJQ==",
+      "dev": true,
+      "requires": {
+        "type-detect": "4.0.8"
+      },
+      "dependencies": {
+        "type-detect": {
+          "version": "4.0.8",
+          "resolved": "https://registry.npmjs.org/type-detect/-/type-detect-4.0.8.tgz",
+          "integrity": "sha512-0fr/mIH1dlO+x7TlcMy+bIDqKPsw/70tVyeHW787goQjhmqaZe10uwLujubK9q9Lg6Fiho1KUKDYz0Z7k7g5/g==",
+          "dev": true
+        }
+      }
+    },
+    "@sinonjs/formatio": {
+      "version": "3.2.2",
+      "resolved": "https://registry.npmjs.org/@sinonjs/formatio/-/formatio-3.2.2.tgz",
+      "integrity": "sha512-B8SEsgd8gArBLMD6zpRw3juQ2FVSsmdd7qlevyDqzS9WTCtvF55/gAL+h6gue8ZvPYcdiPdvueM/qm//9XzyTQ==",
+      "dev": true,
+      "requires": {
+        "@sinonjs/commons": "^1",
+        "@sinonjs/samsam": "^3.1.0"
+      }
+    },
+    "@sinonjs/samsam": {
+      "version": "3.3.3",
+      "resolved": "https://registry.npmjs.org/@sinonjs/samsam/-/samsam-3.3.3.tgz",
+      "integrity": "sha512-bKCMKZvWIjYD0BLGnNrxVuw4dkWCYsLqFOUWw8VgKF/+5Y+mE7LfHWPIYoDXowH+3a9LsWDMo0uAP8YDosPvHQ==",
+      "dev": true,
+      "requires": {
+        "@sinonjs/commons": "^1.3.0",
+        "array-from": "^2.1.1",
+        "lodash": "^4.17.15"
+      }
+    },
+    "@sinonjs/text-encoding": {
+      "version": "0.7.2",
+      "resolved": "https://registry.npmjs.org/@sinonjs/text-encoding/-/text-encoding-0.7.2.tgz",
+      "integrity": "sha512-sXXKG+uL9IrKqViTtao2Ws6dy0znu9sOaP1di/jKGW1M6VssO8vlpXCQcpZ+jisQ1tTFAC5Jo/EOzFbggBagFQ==",
+      "dev": true
+    },
     "@types/color-name": {
       "version": "1.1.1",
       "resolved": "https://registry.npmjs.org/@types/color-name/-/color-name-1.1.1.tgz",
@@ -185,9 +229,9 @@
       }
     },
     "ansi-regex": {
-      "version": "5.0.0",
-      "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-5.0.0.tgz",
-      "integrity": "sha512-bY6fj56OUQ0hU1KjFNDQuJFezqKdrAyFdIevADiqrWHwSlbmBNMHp5ak2f40Pm8JTFyM2mqxkG6ngkHO11f/lg==",
+      "version": "5.0.1",
+      "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-5.0.1.tgz",
+      "integrity": "sha512-quJQXlTSUGL2LH9SUXo8VwsY4soanhgo6LNSm84E1LBcE8s3O0wpdiRzyR9z/ZZJMlMWv37qOOb9pdJlMUEKFQ==",
       "dev": true
     },
     "ansi-styles": {
@@ -225,6 +269,12 @@
       "integrity": "sha1-45sJrqne+Gao8gbiiK9jkZuuOcQ=",
       "dev": true
     },
+    "array-from": {
+      "version": "2.1.1",
+      "resolved": "https://registry.npmjs.org/array-from/-/array-from-2.1.1.tgz",
+      "integrity": "sha512-GQTc6Uupx1FCavi5mPzBvVT7nEOeWMmUA9P95wpfpW1XwMSKs+KaymD5C2Up7KAUKg/mYwbsUYzdZWcoajlNZg==",
+      "dev": true
+    },
     "array-union": {
       "version": "1.0.2",
       "resolved": "https://registry.npmjs.org/array-union/-/array-union-1.0.2.tgz",
@@ -314,9 +364,9 @@
       }
     },
     "balanced-match": {
-      "version": "1.0.0",
-      "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.0.tgz",
-      "integrity": "sha1-ibTRmasr7kneFk6gK4nORi1xt2c=",
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.2.tgz",
+      "integrity": "sha512-3oSeUO0TMV67hN1AmbXsK4yaqU7tjiHlbxRDZOpH0KW9+CeX4bRAaX0Anxt0tx2MrpRpWwQaPwIlISEJhYU5Pw==",
       "dev": true
     },
     "base": {
@@ -393,9 +443,9 @@
       }
     },
     "brace-expansion": {
-      "version": "1.1.8",
-      "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.8.tgz",
-      "integrity": "sha1-wHshHHyVLsH479Uad+8NHTmQopI=",
+      "version": "1.1.11",
+      "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.11.tgz",
+      "integrity": "sha512-iCuPHDFgrHX7H2vEI/5xpz07zSHB00TpugqhmYtVmMO6518mCuRMoOYFldEBl0g187ufozdaHgWKcYFb61qGiA==",
       "dev": true,
       "requires": {
         "balanced-match": "^1.0.0",
@@ -599,7 +649,7 @@
     "concat-map": {
       "version": "0.0.1",
       "resolved": "https://registry.npmjs.org/concat-map/-/concat-map-0.0.1.tgz",
-      "integrity": "sha1-2Klr13/Wjfd5OnMDajug1UBdR3s=",
+      "integrity": "sha512-/Srv4dswyQNBfohGpz9o6Yb3Gz3SrUDqBH5rTuhGR7ahtlbYKnVxw2bCFMRljaA7EXHaXZ8wsHdodFvbkhKmqg==",
       "dev": true
     },
     "copy-descriptor": {
@@ -668,9 +718,9 @@
       }
     },
     "debug": {
-      "version": "2.6.8",
-      "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.8.tgz",
-      "integrity": "sha1-5zFTHKLt4n0YgiJCfaF4IdaP9Pw=",
+      "version": "2.6.9",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
+      "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
       "dev": true,
       "requires": {
         "ms": "2.0.0"
@@ -849,9 +899,9 @@
       },
       "dependencies": {
         "ajv": {
-          "version": "6.12.0",
-          "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.12.0.tgz",
-          "integrity": "sha512-D6gFiFA0RRLyUbvijN74DWAjXSFxWKaWP7mldxkVhyhAV3+SWA9HEJPHQ2c9soIeTFJqcSdFDGFgdqs1iUU2Hw==",
+          "version": "6.12.6",
+          "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.12.6.tgz",
+          "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
           "dev": true,
           "requires": {
             "fast-deep-equal": "^3.1.1",
@@ -870,24 +920,24 @@
           }
         },
         "fast-deep-equal": {
-          "version": "3.1.1",
-          "resolved": "https://registry.npmjs.org/fast-deep-equal/-/fast-deep-equal-3.1.1.tgz",
-          "integrity": "sha512-8UEa58QDLauDNfpbrX55Q9jrGHThw2ZMdOky5Gl1CDtVeJDPVrG4Jxx1N8jw2gkWaff5UUuX1KJd+9zGe2B+ZA==",
+          "version": "3.1.3",
+          "resolved": "https://registry.npmjs.org/fast-deep-equal/-/fast-deep-equal-3.1.3.tgz",
+          "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==",
           "dev": true
         },
         "glob-parent": {
-          "version": "5.1.1",
-          "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-5.1.1.tgz",
-          "integrity": "sha512-FnI+VGOpnlGHWZxthPGR+QhR78fuiK0sNLkHQv+bL9fQi57lNNdquIbna/WrfROrolq8GK5Ek6BiMwqL/voRYQ==",
+          "version": "5.1.2",
+          "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-5.1.2.tgz",
+          "integrity": "sha512-AOIgSQCepiJYwP3ARnGx+5VnTu2HBYdzbGP45eLw1vr3zB3vZLeyed1sC9hnbcOc9/SrMyM5RPQrkGz4aS9Zow==",
           "dev": true,
           "requires": {
             "is-glob": "^4.0.1"
           },
           "dependencies": {
             "is-glob": {
-              "version": "4.0.1",
-              "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.1.tgz",
-              "integrity": "sha512-5G0tKtBTFImOqDnLB2hG6Bp2qcKEFduo4tZu9MT/H6NQv/ghhy30o55ufafxJ/LdH79LLs2Kfrn85TLKyA7BUg==",
+              "version": "4.0.3",
+              "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.3.tgz",
+              "integrity": "sha512-xelSayHH36ZgE7ZWhli7pW34hNbNl8Ojv5KVmkJD4hBdD3th8Tfk9vYasLM+mXWOZhFkgZfxhLSnrwRr4elSSg==",
               "dev": true,
               "requires": {
                 "is-extglob": "^2.1.1"
@@ -917,9 +967,9 @@
           "dev": true
         },
         "lodash": {
-          "version": "4.17.15",
-          "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.15.tgz",
-          "integrity": "sha512-8xOcRHvCjnocdS5cpwXQXVzmmh5e5+saE2QGoeQmbKmRS6J3VQppPOIt0MnmE+4xlZoumy0GPG0D0MVIQbNA1A==",
+          "version": "4.17.21",
+          "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
+          "integrity": "sha512-v2kDEe57lecTulaDIuNTPy3Ry4gLGJ6Z1O3vE1krgXZNrsQ+LFTGHVxVjcXPs17LhbZVGedAJv8XZ1tvj5FvSg==",
           "dev": true
         },
         "ms": {
@@ -940,12 +990,20 @@
             "prelude-ls": "~1.1.2",
             "type-check": "~0.3.2",
             "word-wrap": "~1.2.3"
+          },
+          "dependencies": {
+            "word-wrap": {
+              "version": "1.2.5",
+              "resolved": "https://registry.npmjs.org/word-wrap/-/word-wrap-1.2.5.tgz",
+              "integrity": "sha512-BN22B5eaMMI9UMtjrGd5g5eCYPpCPDUy0FJXbYsaT5zYxjFOckS53SQDE3pWkVoWpHXVb3BrYcEN4Twa55B5cA==",
+              "dev": true
+            }
           }
         },
         "semver": {
-          "version": "6.3.0",
-          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.0.tgz",
-          "integrity": "sha512-b39TBaTSfV6yBrapU89p5fKekE2m/NwnDocOVruQFS1/veMgdzuPcnOM34M6CwxW8jH/lxEa5rBoDeUwu5HHTw==",
+          "version": "6.3.1",
+          "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.1.tgz",
+          "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
           "dev": true
         }
       }
@@ -1176,7 +1234,7 @@
     "extsprintf": {
       "version": "1.3.0",
       "resolved": "https://registry.npmjs.org/extsprintf/-/extsprintf-1.3.0.tgz",
-      "integrity": "sha1-lpGEQOMEGnpBT4xS48V06zw+HgU=",
+      "integrity": "sha512-11Ndz7Nv+mvAC1j0ktTa7fAb0vLyGGX+rMHNBYQviQDGU0Hw7lhctJANqbPhu9nV9/izT/IntTgZ7Im/9LJs9g==",
       "dev": true
     },
     "fast-deep-equal": {
@@ -1272,7 +1330,7 @@
     "for-in": {
       "version": "1.0.2",
       "resolved": "https://registry.npmjs.org/for-in/-/for-in-1.0.2.tgz",
-      "integrity": "sha1-gQaNKVqBQuwKxybG4iAMMPttXoA=",
+      "integrity": "sha512-7EwmXrOjyL+ChxMhmG5lnW9MPt1aIeZEwKhQzoBUdTV0N3zuwWDZYVJatDvZ2OyzPUvdIAZDsCetk3coyMfcnQ==",
       "dev": true
     },
     "forever-agent": {
@@ -1658,9 +1716,9 @@
           "dev": true
         },
         "lodash": {
-          "version": "4.17.15",
-          "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.15.tgz",
-          "integrity": "sha512-8xOcRHvCjnocdS5cpwXQXVzmmh5e5+saE2QGoeQmbKmRS6J3VQppPOIt0MnmE+4xlZoumy0GPG0D0MVIQbNA1A==",
+          "version": "4.17.21",
+          "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
+          "integrity": "sha512-v2kDEe57lecTulaDIuNTPy3Ry4gLGJ6Z1O3vE1krgXZNrsQ+LFTGHVxVjcXPs17LhbZVGedAJv8XZ1tvj5FvSg==",
           "dev": true
         },
         "strip-ansi": {
@@ -1670,6 +1728,14 @@
           "dev": true,
           "requires": {
             "ansi-regex": "^5.0.0"
+          },
+          "dependencies": {
+            "ansi-regex": {
+              "version": "5.0.1",
+              "resolved": "https://registry.npmjs.org/ansi-regex/-/ansi-regex-5.0.1.tgz",
+              "integrity": "sha512-quJQXlTSUGL2LH9SUXo8VwsY4soanhgo6LNSm84E1LBcE8s3O0wpdiRzyR9z/ZZJMlMWv37qOOb9pdJlMUEKFQ==",
+              "dev": true
+            }
           }
         },
         "supports-color": {
@@ -1896,9 +1962,9 @@
       "integrity": "sha1-5CGiqOINawgZ3yiQj3glJrlt0f4="
     },
     "json-schema": {
-      "version": "0.2.3",
-      "resolved": "https://registry.npmjs.org/json-schema/-/json-schema-0.2.3.tgz",
-      "integrity": "sha1-tIDIkuWaLwWVTOcnvT8qTogvnhM=",
+      "version": "0.4.0",
+      "resolved": "https://registry.npmjs.org/json-schema/-/json-schema-0.4.0.tgz",
+      "integrity": "sha512-es94M3nTIfsEPisRafak+HDLfHXnKBhV3vU5eqPcS3flIWqcxJWgXHXiey3YrpaNsanY5ei1VoYEbOzijuq9BA==",
       "dev": true
     },
     "json-schema-traverse": {
@@ -1935,27 +2001,27 @@
       }
     },
     "jsprim": {
-      "version": "1.4.1",
-      "resolved": "https://registry.npmjs.org/jsprim/-/jsprim-1.4.1.tgz",
-      "integrity": "sha1-MT5mvB5cwG5Di8G3SZwuXFastqI=",
+      "version": "1.4.2",
+      "resolved": "https://registry.npmjs.org/jsprim/-/jsprim-1.4.2.tgz",
+      "integrity": "sha512-P2bSOMAc/ciLz6DzgjVlGJP9+BrJWu5UDGK70C2iweC5QBIeFf0ZXRvGjEj2uYgrY2MkAAhsSWHDWlFtEroZWw==",
       "dev": true,
       "requires": {
         "assert-plus": "1.0.0",
         "extsprintf": "1.3.0",
-        "json-schema": "0.2.3",
+        "json-schema": "0.4.0",
         "verror": "1.10.0"
       }
     },
     "just-extend": {
-      "version": "1.1.22",
-      "resolved": "https://registry.npmjs.org/just-extend/-/just-extend-1.1.22.tgz",
-      "integrity": "sha1-MzCvdWyralQnAMZLLk5KoGLVL/8=",
+      "version": "4.2.1",
+      "resolved": "https://registry.npmjs.org/just-extend/-/just-extend-4.2.1.tgz",
+      "integrity": "sha512-g3UB796vUFIY90VIv/WX3L2c8CS2MdWUww3CNrYmqza1Fg0DURc2K/O4YrnklBdQarSJ/y8JnJYDGc+1iumQjg==",
       "dev": true
     },
     "kind-of": {
-      "version": "6.0.2",
-      "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-6.0.2.tgz",
-      "integrity": "sha512-s5kLOcnH0XqDO+FvuaLX8DDjZ18CGFk7VygH40QoKPUQhW4e2rvM0rwUq0t8IQDOwYSeLK01U90OjzBTme2QqA==",
+      "version": "6.0.3",
+      "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-6.0.3.tgz",
+      "integrity": "sha512-dcS1ul+9tmeD95T+x28/ehLgd9mENa3LsvDTtzm3vyBEO7RPptvAD+t44WVXaUjTBRcrpFeFlC8WCruUR456hw==",
       "dev": true
     },
     "levn": {
@@ -1969,9 +2035,9 @@
       }
     },
     "lodash": {
-      "version": "4.17.11",
-      "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.11.tgz",
-      "integrity": "sha512-cQKh8igo5QUhZ7lg38DYWAxMvjSAKG0A8wGSVimP07SIUEK2UO+arSRKbRZWtelMtN5V0Hkwh5ryOto/SshYIg=="
+      "version": "4.17.21",
+      "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
+      "integrity": "sha512-v2kDEe57lecTulaDIuNTPy3Ry4gLGJ6Z1O3vE1krgXZNrsQ+LFTGHVxVjcXPs17LhbZVGedAJv8XZ1tvj5FvSg=="
     },
     "lodash._baseassign": {
       "version": "3.2.0",
@@ -2117,24 +2183,24 @@
       "dev": true
     },
     "minimatch": {
-      "version": "3.0.4",
-      "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.0.4.tgz",
-      "integrity": "sha512-yJHVQEhyqPLUTgt9B83PXu6W3rx4MvvHvSUvToogpwoGDOUQ+yDrR0HRot+yOCdCO7u4hX3pWft6kWBBcqh0UA==",
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.1.2.tgz",
+      "integrity": "sha512-J7p63hRiAjw1NDEww1W7i37+ByIrOWO5XQQAzZ3VOcL0PNybwpfmV/N05zFAzwQ9USyEcX6t3UO+K5aqBQOIHw==",
       "dev": true,
       "requires": {
         "brace-expansion": "^1.1.7"
       }
     },
     "minimist": {
-      "version": "0.0.8",
-      "resolved": "https://registry.npmjs.org/minimist/-/minimist-0.0.8.tgz",
-      "integrity": "sha1-hX/Kv8M5fSYluCKCYuhqp6ARsF0=",
+      "version": "1.2.8",
+      "resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.8.tgz",
+      "integrity": "sha512-2yyAR8qBkN3YuheJanUpWC5U3bb5osDywNB8RzDVlDwDHbocAJveqqj1u8+SVD7jkWT4yvsHCpWqqWqAxb0zCA==",
       "dev": true
     },
     "mixin-deep": {
-      "version": "1.3.1",
-      "resolved": "https://registry.npmjs.org/mixin-deep/-/mixin-deep-1.3.1.tgz",
-      "integrity": "sha512-8ZItLHeEgaqEvd5lYBXfm4EZSFCX29Jb9K+lAHhDKzReKBQKj3R+7NOF6tjqYi9t4oI8VUfaWITJQm86wnXGNQ==",
+      "version": "1.3.2",
+      "resolved": "https://registry.npmjs.org/mixin-deep/-/mixin-deep-1.3.2.tgz",
+      "integrity": "sha512-WRoDn//mXBiJ1H40rqa3vH0toePwSsGb45iInWlTySa+Uu4k3tYUSxa2v1KqAiLtvlrSzaExqS1gtk96A9zvEA==",
       "dev": true,
       "requires": {
         "for-in": "^1.0.2",
@@ -2153,12 +2219,12 @@
       }
     },
     "mkdirp": {
-      "version": "0.5.1",
-      "resolved": "https://registry.npmjs.org/mkdirp/-/mkdirp-0.5.1.tgz",
-      "integrity": "sha1-MAV0OOrGz3+MR2fzhkjWaX11yQM=",
+      "version": "0.5.6",
+      "resolved": "https://registry.npmjs.org/mkdirp/-/mkdirp-0.5.6.tgz",
+      "integrity": "sha512-FP+p8RB8OWpF3YZBCrP5gtADmtXApB5AMLn+vdyA+PyxCjrCs00mjyUozssO33cwDeT3wNGdLxJ5M//YqtHAJw==",
       "dev": true,
       "requires": {
-        "minimist": "0.0.8"
+        "minimist": "^1.2.6"
       }
     },
     "mocha": {
@@ -2189,6 +2255,30 @@
           "requires": {
             "graceful-readlink": ">= 1.0.0"
           }
+        },
+        "debug": {
+          "version": "2.6.8",
+          "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.8.tgz",
+          "integrity": "sha512-E22fsyWPt/lr4/UgQLt/pXqerGMDsanhbnmqIS3VAXuDi1v3IpiwXe2oncEIondHSBuPDWRoK/pMjlvi8FuOXQ==",
+          "dev": true,
+          "requires": {
+            "ms": "2.0.0"
+          }
+        },
+        "minimist": {
+          "version": "0.0.8",
+          "resolved": "https://registry.npmjs.org/minimist/-/minimist-0.0.8.tgz",
+          "integrity": "sha512-miQKw5Hv4NS1Psg2517mV4e4dYNaO3++hjAvLOAzKqZ61rH8NS1SK+vbfBWZ5PY/Me/bEWhUwqMghEW5Fb9T7Q==",
+          "dev": true
+        },
+        "mkdirp": {
+          "version": "0.5.1",
+          "resolved": "https://registry.npmjs.org/mkdirp/-/mkdirp-0.5.1.tgz",
+          "integrity": "sha512-SknJC52obPfGQPnjIkXbmA6+5H15E+fR+E4iR2oQ3zzCLbd7/ONua69R/Gw7AgkTLsRG+r5fzksYwWe1AgTyWA==",
+          "dev": true,
+          "requires": {
+            "minimist": "0.0.8"
+          }
         }
       }
     },
@@ -2252,23 +2342,26 @@
       "dev": true
     },
     "nise": {
-      "version": "1.1.0",
-      "resolved": "https://registry.npmjs.org/nise/-/nise-1.1.0.tgz",
-      "integrity": "sha512-lIFidCxB0mJGyq1i33tLRNojtMoYX95EAI7WQEU+/ees0w6hvXZQHZ7WD130Tjeh5+YJAUVLfQ3k/s9EA8jj+w==",
+      "version": "1.5.3",
+      "resolved": "https://registry.npmjs.org/nise/-/nise-1.5.3.tgz",
+      "integrity": "sha512-Ymbac/94xeIrMf59REBPOv0thr+CJVFMhrlAkW/gjCIE58BGQdCj0x7KRCb3yz+Ga2Rz3E9XXSvUyyxqqhjQAQ==",
       "dev": true,
       "requires": {
-        "formatio": "^1.2.0",
-        "just-extend": "^1.1.22",
-        "lolex": "^1.6.0",
-        "path-to-regexp": "^1.7.0",
-        "text-encoding": "^0.6.4"
+        "@sinonjs/formatio": "^3.2.1",
+        "@sinonjs/text-encoding": "^0.7.1",
+        "just-extend": "^4.0.2",
+        "lolex": "^5.0.1",
+        "path-to-regexp": "^1.7.0"
       },
       "dependencies": {
         "lolex": {
-          "version": "1.6.0",
-          "resolved": "https://registry.npmjs.org/lolex/-/lolex-1.6.0.tgz",
-          "integrity": "sha1-OpoCg0UqR9dDnnJzG54H1zhuSfY=",
-          "dev": true
+          "version": "5.1.2",
+          "resolved": "https://registry.npmjs.org/lolex/-/lolex-5.1.2.tgz",
+          "integrity": "sha512-h4hmjAvHTmd+25JSwrtTIuwbKdwg5NzZVRMLn9saij4SZaepCrTCxPr35H/3bjwfMJtN+t3CX8672UIkglz28A==",
+          "dev": true,
+          "requires": {
+            "@sinonjs/commons": "^1.7.0"
+          }
         }
       }
     },
@@ -2405,9 +2498,9 @@
       "dev": true
     },
     "path-parse": {
-      "version": "1.0.6",
-      "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.6.tgz",
-      "integrity": "sha512-GSmOT2EbHrINBf9SR7CDELwlJ8AENk3Qn7OikK4nFYAu3Ote2+JYNVvkpAEQm3/TLNEJFD/xZJjzyxg3KBWOzw==",
+      "version": "1.0.7",
+      "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.7.tgz",
+      "integrity": "sha512-LDJzPVEEEPR+y48z93A0Ed0yXb8pAByGWo/k5YYdYgpY2/2EsOsksJrq7lOHxryrVOn1ejG6oAp8ahvOIQD8sw==",
       "dev": true
     },
     "path-to-regexp": {
@@ -2755,9 +2848,9 @@
       "dev": true
     },
     "set-value": {
-      "version": "2.0.0",
-      "resolved": "https://registry.npmjs.org/set-value/-/set-value-2.0.0.tgz",
-      "integrity": "sha512-hw0yxk9GT/Hr5yJEYnHNKYXkIA8mVJgd9ditYZCe16ZczcaELYYcfvaXesNACk2O8O0nTiPQcQhGUQj8JLzeeg==",
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/set-value/-/set-value-2.0.1.tgz",
+      "integrity": "sha512-JxHc1weCN68wRY0fhCoXpyK55m/XPHafOmK4UWD7m2CI14GMcFypt4w/0+NV5f/ZMby2F6S2wwA7fgynh9gWSw==",
       "dev": true,
       "requires": {
         "extend-shallow": "^2.0.1",
@@ -2769,7 +2862,7 @@
         "extend-shallow": {
           "version": "2.0.1",
           "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-          "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
+          "integrity": "sha512-zCnTtlxNoAiDc3gqY2aYAWFx7XWWiasuF2K8Me5WbN8otHKTUKBwjPtNpRs/rbUZm7KxWAaNj7P1a/p52GbVug==",
           "dev": true,
           "requires": {
             "is-extendable": "^0.1.0"
@@ -3125,9 +3218,9 @@
       },
       "dependencies": {
         "ajv": {
-          "version": "6.12.0",
-          "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.12.0.tgz",
-          "integrity": "sha512-D6gFiFA0RRLyUbvijN74DWAjXSFxWKaWP7mldxkVhyhAV3+SWA9HEJPHQ2c9soIeTFJqcSdFDGFgdqs1iUU2Hw==",
+          "version": "6.12.6",
+          "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.12.6.tgz",
+          "integrity": "sha512-j3fVLgvTo527anyYyJOGTYJbG+vnnQYvE0m5mmkc1TK+nxAppkCLMIL0aZ4dblVCNoGShhm+kzE4ZUykBoMg4g==",
           "dev": true,
           "requires": {
             "fast-deep-equal": "^3.1.1",
@@ -3143,9 +3236,9 @@
           "dev": true
         },
         "fast-deep-equal": {
-          "version": "3.1.1",
-          "resolved": "https://registry.npmjs.org/fast-deep-equal/-/fast-deep-equal-3.1.1.tgz",
-          "integrity": "sha512-8UEa58QDLauDNfpbrX55Q9jrGHThw2ZMdOky5Gl1CDtVeJDPVrG4Jxx1N8jw2gkWaff5UUuX1KJd+9zGe2B+ZA==",
+          "version": "3.1.3",
+          "resolved": "https://registry.npmjs.org/fast-deep-equal/-/fast-deep-equal-3.1.3.tgz",
+          "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==",
           "dev": true
         },
         "is-fullwidth-code-point": {
@@ -3161,9 +3254,9 @@
           "dev": true
         },
         "lodash": {
-          "version": "4.17.15",
-          "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.15.tgz",
-          "integrity": "sha512-8xOcRHvCjnocdS5cpwXQXVzmmh5e5+saE2QGoeQmbKmRS6J3VQppPOIt0MnmE+4xlZoumy0GPG0D0MVIQbNA1A==",
+          "version": "4.17.21",
+          "resolved": "https://registry.npmjs.org/lodash/-/lodash-4.17.21.tgz",
+          "integrity": "sha512-v2kDEe57lecTulaDIuNTPy3Ry4gLGJ6Z1O3vE1krgXZNrsQ+LFTGHVxVjcXPs17LhbZVGedAJv8XZ1tvj5FvSg==",
           "dev": true
         },
         "string-width": {
@@ -3354,38 +3447,15 @@
       "dev": true
     },
     "union-value": {
-      "version": "1.0.0",
-      "resolved": "https://registry.npmjs.org/union-value/-/union-value-1.0.0.tgz",
-      "integrity": "sha1-XHHDTLW61dzr4+oM0IIHulqhrqQ=",
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/union-value/-/union-value-1.0.1.tgz",
+      "integrity": "sha512-tJfXmxMeWYnczCVs7XAEvIV7ieppALdyepWMkHkwciRpZraG/xwT+s2JN8+pr1+8jCRf80FFzvr+MpQeeoF4Xg==",
       "dev": true,
       "requires": {
         "arr-union": "^3.1.0",
         "get-value": "^2.0.6",
         "is-extendable": "^0.1.1",
-        "set-value": "^0.4.3"
-      },
-      "dependencies": {
-        "extend-shallow": {
-          "version": "2.0.1",
-          "resolved": "https://registry.npmjs.org/extend-shallow/-/extend-shallow-2.0.1.tgz",
-          "integrity": "sha1-Ua99YUrZqfYQ6huvu5idaxxWiQ8=",
-          "dev": true,
-          "requires": {
-            "is-extendable": "^0.1.0"
-          }
-        },
-        "set-value": {
-          "version": "0.4.3",
-          "resolved": "https://registry.npmjs.org/set-value/-/set-value-0.4.3.tgz",
-          "integrity": "sha1-fbCPnT0i3H945Trzw79GZuzfzPE=",
-          "dev": true,
-          "requires": {
-            "extend-shallow": "^2.0.1",
-            "is-extendable": "^0.1.1",
-            "is-plain-object": "^2.0.1",
-            "to-object-path": "^0.3.0"
-          }
-        }
+        "set-value": "^2.0.1"
       }
     },
     "unique-string": {
@@ -3508,7 +3578,7 @@
     "verror": {
       "version": "1.10.0",
       "resolved": "https://registry.npmjs.org/verror/-/verror-1.10.0.tgz",
-      "integrity": "sha1-OhBcoXBTr1XW4nDB+CiGguGNpAA=",
+      "integrity": "sha512-ZZKSmDAEFOijERBLkmYfJ+vmk3w+7hOLYDNkRCuRuMJGEmqYNCNLyBBFwWKVMhfwaEF3WOd0Zlw86U/WC/+nYw==",
       "dev": true,
       "requires": {
         "assert-plus": "^1.0.0",
@@ -3525,12 +3595,6 @@
         "isexe": "^2.0.0"
       }
     },
-    "word-wrap": {
-      "version": "1.2.3",
-      "resolved": "https://registry.npmjs.org/word-wrap/-/word-wrap-1.2.3.tgz",
-      "integrity": "sha512-Hz/mrNwitNRh/HUAtM/VT/5VH+ygD6DV7mYKZAtHOrbs8U7lvPS6xf7EJKMF0uW1KJCl0H701g3ZGus+muE5vQ==",
-      "dev": true
-    },
     "wordwrap": {
       "version": "1.0.0",
       "resolved": "https://registry.npmjs.org/wordwrap/-/wordwrap-1.0.0.tgz",
diff --git a/deps/v8/tools/clusterfuzz/js_fuzzer/tools/workbench.py b/deps/v8/tools/clusterfuzz/js_fuzzer/tools/workbench.py
index 5a4fc0a19c462c..f45908db8c55c1 100644
--- a/deps/v8/tools/clusterfuzz/js_fuzzer/tools/workbench.py
+++ b/deps/v8/tools/clusterfuzz/js_fuzzer/tools/workbench.py
@@ -22,10 +22,8 @@
 from __future__ import print_function
 
 import json
-import math
 from multiprocessing import Pool, cpu_count
 import os
-import random
 import subprocess
 import sys
 
diff --git a/deps/v8/tools/clusterfuzz/trials/clusterfuzz_trials_config.json b/deps/v8/tools/clusterfuzz/trials/clusterfuzz_trials_config.json
index 51b46c688010fb..09e0e8ce2aec42 100644
--- a/deps/v8/tools/clusterfuzz/trials/clusterfuzz_trials_config.json
+++ b/deps/v8/tools/clusterfuzz/trials/clusterfuzz_trials_config.json
@@ -3,12 +3,14 @@
     {"app_args": "--force-slow-path", "app_name": "d8", "probability": 0.05},
     {"app_args": "--future", "app_name": "d8", "probability": 0.25},
     {"app_args": "--harmony-struct", "app_name": "d8", "probability": 0.1},
-    {"app_args": "--interrupt-budget=1000", "app_name": "d8", "probability": 0.25},
-    {"app_args": "--interrupt-budget-for-feedback-allocation=0", "app_name": "d8", "probability": 0.05},
+    {"app_args": "--jit-fuzzing", "app_name": "d8", "probability": 0.25},
     {"app_args": "--jitless", "app_name": "d8", "probability": 0.1, "contradicts": ["--stress-concurrent-inlining", "--stress-concurrent-inlining-attach-code"]},
     {"app_args": "--maglev", "app_name": "d8", "probability": 0.1, "contradicts": ["--jitless"]},
-    {"app_args": "--minor-mc", "app_name": "d8", "probability": 0.1},
+    {"app_args": "--maglev-future", "app_name": "d8", "probability": 0.05, "contradicts": ["--jitless"]},
+    {"app_args": "--minor-ms", "app_name": "d8", "probability": 0.25},
+    {"app_args": "--concurrent-minor-ms-marking", "app_name": "d8", "probability": 0.1},
     {"app_args": "--random-gc-interval=2000", "app_name": "d8", "probability": 0.05},
+    {"app_args": "--optimize-on-next-call-optimizes-to-maglev", "app_name": "d8", "probability": 0.1},
     {"app_args": "--noanalyze-environment-liveness", "app_name": "d8", "probability": 0.1},
     {"app_args": "--no-enable-avx", "app_name": "d8", "probability": 0.1},
     {"app_args": "--no-enable-bmi1", "app_name": "d8", "probability": 0.1},
@@ -25,6 +27,9 @@
     {"app_args": "--no-regexp-tier-up", "app_name": "d8", "probability": 0.2},
     {"app_args": "--no-use-ic", "app_name": "d8", "probability": 0.25},
     {"app_args": "--no-wasm-generic-wrapper", "app_name": "d8", "probability": 0.1},
+    {"app_args": "--no-liftoff", "app_name": "d8", "probability": 0.1},
+    {"app_args": "--no-turbofan", "app_name": "d8", "probability": 0.1},
+    {"app_args": "--no-wasm-tier-up --no-wasm-dynamic-tiering", "app_name": "d8", "probability": 0.1},
     {"app_args": "--regexp-interpret-all", "app_name": "d8", "probability": 0.1},
     {"app_args": "--shared-string-table", "app_name": "d8", "probability": 0.1},
     {"app_args": "--simulate-errors", "app_name": "d8", "probability": 0.001},
@@ -32,6 +37,7 @@
     {"app_args": "--stress-concurrent-inlining", "app_name": "d8", "probability": 0.25, "contradicts": ["--assert-types", "--jitless"]},
     {"app_args": "--stress-concurrent-inlining-attach-code", "app_name": "d8", "probability": 0.05, "contradicts": ["--assert-types", "--jitless"]},
     {"app_args": "--stress-flush-code", "app_name": "d8", "probability": 0.25},
+    {"app_args": "--stress-maglev", "app_name": "d8", "probability": 0.05},
     {"app_args": "--stress-marking=100", "app_name": "d8", "probability": 0.05},
     {"app_args": "--stress-scavenge=100", "app_name": "d8", "probability": 0.05},
     {"app_args": "--turboshaft", "app_name": "d8", "probability": 0.2},
diff --git a/deps/v8/tools/debug_helper/BUILD.gn b/deps/v8/tools/debug_helper/BUILD.gn
index d557aca2d3f7d7..a5a3ff319e22d8 100644
--- a/deps/v8/tools/debug_helper/BUILD.gn
+++ b/deps/v8/tools/debug_helper/BUILD.gn
@@ -96,6 +96,7 @@ v8_component("v8_debug_helper_internal") {
     ":gen_heap_constants",
     "../..:generate_bytecode_builtins_list",
     "../..:run_torque",
+    "../..:v8_abseil",
     "../..:v8_headers",
     "../..:v8_internal_headers",
     "../..:v8_libbase",
diff --git a/deps/v8/tools/debug_helper/debug-macro-shims.h b/deps/v8/tools/debug_helper/debug-macro-shims.h
index 02deb3d766fa74..4bd1dc7bb6d764 100644
--- a/deps/v8/tools/debug_helper/debug-macro-shims.h
+++ b/deps/v8/tools/debug_helper/debug-macro-shims.h
@@ -79,7 +79,7 @@ inline Value<intptr_t> Signed(d::MemoryAccessor accessor, uintptr_t u) {
   return {d::MemoryAccessResult::kOk, static_cast<intptr_t>(u)};
 }
 inline Value<int32_t> SmiUntag(d::MemoryAccessor accessor, uintptr_t s_t) {
-  Smi s(s_t);
+  Tagged<Smi> s(s_t);
   return {d::MemoryAccessResult::kOk, s.value()};
 }
 inline Value<uintptr_t> SmiFromInt32(d::MemoryAccessor accessor, int32_t i) {
diff --git a/deps/v8/tools/debug_helper/get-object-properties.cc b/deps/v8/tools/debug_helper/get-object-properties.cc
index 186438d7ac40e6..ac1d7a8af04c18 100644
--- a/deps/v8/tools/debug_helper/get-object-properties.cc
+++ b/deps/v8/tools/debug_helper/get-object-properties.cc
@@ -219,12 +219,16 @@ TypedObject GetTypedHeapObject(uintptr_t address, d::MemoryAccessor accessor,
 // An object visitor that accumulates the first few characters of a string.
 class ReadStringVisitor : public TqObjectVisitor {
  public:
-  static v8::base::Optional<std::string> Visit(
-      d::MemoryAccessor accessor, const d::HeapAddresses& heap_addresses,
-      const TqString* object) {
+  struct Result {
+    v8::base::Optional<std::string> maybe_truncated_string;
+    std::unique_ptr<ObjectProperty> maybe_raw_characters_property;
+  };
+  static Result Visit(d::MemoryAccessor accessor,
+                      const d::HeapAddresses& heap_addresses,
+                      const TqString* object) {
     ReadStringVisitor visitor(accessor, heap_addresses);
     object->Visit(&visitor);
-    return visitor.GetString();
+    return {visitor.GetString(), visitor.GetRawCharactersProperty()};
   }
 
   // Returns the result as UTF-8 once visiting is complete.
@@ -244,6 +248,18 @@ class ReadStringVisitor : public TqObjectVisitor {
     return std::string(result.data(), write_index);
   }
 
+  // Returns a property referring to the address of the flattened character
+  // array, if possible, once visiting is complete.
+  std::unique_ptr<ObjectProperty> GetRawCharactersProperty() {
+    if (failed_ || raw_characters_address_ == 0) return {};
+    DCHECK(size_per_character_ == 1 || size_per_character_ == 2);
+    const char* type = size_per_character_ == 1 ? "char" : "char16_t";
+    return std::make_unique<ObjectProperty>(
+        "raw_characters", type, type, raw_characters_address_, num_characters_,
+        size_per_character_, std::vector<std::unique_ptr<StructProperty>>(),
+        d::PropertyKind::kArrayOfKnownSize);
+  }
+
   template <typename T>
   Value<T> ReadValue(uintptr_t data_address, int32_t index = 0) {
     T value{};
@@ -256,6 +272,11 @@ class ReadStringVisitor : public TqObjectVisitor {
   template <typename TChar>
   void ReadStringCharacters(const TqString* object, uintptr_t data_address) {
     int32_t length = GetOrFinish(object->GetLengthValue(accessor_));
+    if (string_.size() == 0) {
+      raw_characters_address_ = data_address + index_ * sizeof(TChar);
+      size_per_character_ = sizeof(TChar);
+      num_characters_ = std::min(length, limit_) - index_;
+    }
     for (; index_ < length && index_ < limit_ && !done_; ++index_) {
       static_assert(sizeof(TChar) <= sizeof(char16_t));
       char16_t c = static_cast<char16_t>(
@@ -284,6 +305,10 @@ class ReadStringVisitor : public TqObjectVisitor {
         GetTypedHeapObject(first_address, accessor_, nullptr, heap_addresses_)
             .object;
     first->Visit(this);
+    // Cons strings don't have all of their characters in a contiguous memory
+    // region, so it would be confusing to show the user a raw pointer to the
+    // character storage for only part of the cons string.
+    raw_characters_address_ = 0;
     if (done_) return;
     int32_t first_length = GetOrFinish(
         static_cast<TqString*>(first.get())->GetLengthValue(accessor_));
@@ -468,6 +493,16 @@ class ReadStringVisitor : public TqObjectVisitor {
   int32_t limit_;  // Don't read past this index (set by SlicedString).
   bool done_;      // Whether to stop further work.
   bool failed_;    // Whether an error was encountered before any valid data.
+
+  // If the string's characters are in a contiguous block of memory (including
+  // sequential strings, external strings where we could determine the raw data
+  // location, and thin or sliced strings pointing to either of those), then
+  // after this visitor has run, the character data's address, size per
+  // character, and number of characters will be present in the following
+  // fields.
+  Address raw_characters_address_ = 0;
+  int32_t size_per_character_ = 0;
+  int32_t num_characters_ = 0;
 };
 
 // An object visitor that supplies extra information for some types.
@@ -484,27 +519,28 @@ class AddInfoVisitor : public TqObjectVisitor {
     return {std::move(visitor.brief_), std::move(visitor.properties_)};
   }
 
-  void VisitString(const TqString* object) override {
-    auto str = ReadStringVisitor::Visit(accessor_, heap_addresses_, object);
+  void VisitStringImpl(const TqString* object, bool is_sequential) {
+    auto visit_result =
+        ReadStringVisitor::Visit(accessor_, heap_addresses_, object);
+    auto str = visit_result.maybe_truncated_string;
     if (str.has_value()) {
       brief_ = "\"" + *str + "\"";
     }
+    // Sequential strings already have a "chars" property based on the Torque
+    // type definition, so there's no need to duplicate it. Otherwise, it is
+    // useful to display a pointer to the flattened character data if possible.
+    if (!is_sequential && visit_result.maybe_raw_characters_property) {
+      properties_.push_back(
+          std::move(visit_result.maybe_raw_characters_property));
+    }
+  }
+
+  void VisitString(const TqString* object) override {
+    VisitStringImpl(object, /*is_sequential=*/false);
   }
 
-  void VisitExternalString(const TqExternalString* object) override {
-    VisitString(object);
-    // Cast resource field to v8::String::ExternalStringResourceBase* would add
-    // more info.
-    properties_.push_back(std::make_unique<ObjectProperty>(
-        "resource",
-        CheckTypeName<v8::String::ExternalStringResourceBase*>(
-            "v8::String::ExternalStringResourceBase*"),
-        CheckTypeName<v8::String::ExternalStringResourceBase*>(
-            "v8::String::ExternalStringResourceBase*"),
-        object->GetResourceAddress(), 1,
-        sizeof(v8::String::ExternalStringResourceBase*),
-        std::vector<std::unique_ptr<StructProperty>>(),
-        d::PropertyKind::kSingle));
+  void VisitSeqString(const TqSeqString* object) override {
+    VisitStringImpl(object, /*is_sequential=*/true);
   }
 
   void VisitJSObject(const TqJSObject* object) override {
@@ -710,14 +746,14 @@ std::unique_ptr<StackFrameResult> GetStackFrame(
         if (shared_function_info_ptr.validity == d::MemoryAccessResult::kOk) {
           TqSharedFunctionInfo shared_function_info(
               shared_function_info_ptr.value);
-          auto script_or_debug_info_ptr =
-              shared_function_info.GetScriptOrDebugInfoValue(memory_accessor);
-          if (script_or_debug_info_ptr.validity == d::MemoryAccessResult::kOk) {
-            // Make sure script_or_debug_info_ptr is script.
-            auto address = script_or_debug_info_ptr.value;
+          auto script_ptr =
+              shared_function_info.GetScriptValue(memory_accessor);
+          if (script_ptr.validity == d::MemoryAccessResult::kOk) {
+            // Make sure script_ptr is script.
+            auto address = script_ptr.value;
             if (IsTypedHeapObjectInstanceTypeOf(address, memory_accessor,
                                                 i::InstanceType::SCRIPT_TYPE)) {
-              TqScript script(script_or_debug_info_ptr.value);
+              TqScript script(script_ptr.value);
               props.push_back(std::make_unique<ObjectProperty>(
                   "script_name", kObjectAsStoredInHeap, kObject,
                   script.GetNameAddress(), 1, i::kTaggedSize,
diff --git a/deps/v8/tools/dev/gen-static-roots.py b/deps/v8/tools/dev/gen-static-roots.py
index 48d9af513ec687..4f0762a815bab9 100755
--- a/deps/v8/tools/dev/gen-static-roots.py
+++ b/deps/v8/tools/dev/gen-static-roots.py
@@ -58,13 +58,13 @@ def DetectGoma():
 is_debug = false
 use_goma = {USE_GOMA}
 v8_enable_static_roots = false
-v8_enable_static_root_generation = true
+v8_enable_static_roots_generation = true
 v8_enable_pointer_compression = true
 v8_enable_shared_ro_heap = true
 v8_enable_pointer_compression_shared_cage = true
 v8_enable_webassembly = true
 v8_enable_i18n_support = true
-dcheck_always_on = true
+dcheck_always_on = false
 """
     },
 }
diff --git a/deps/v8/tools/dev/gm.py b/deps/v8/tools/dev/gm.py
index c2860a47636ca2..1237f6a6c06a81 100755
--- a/deps/v8/tools/dev/gm.py
+++ b/deps/v8/tools/dev/gm.py
@@ -145,6 +145,8 @@
 OUTDIR = Path("out")
 
 
+# Note: this function is reused by update-compile-commands.py. When renaming
+# this, please update that file too!
 def detect_goma():
   if os.environ.get("GOMA_DIR"):
     return Path(os.environ.get("GOMA_DIR"))
@@ -157,10 +159,14 @@ def detect_goma():
   cipd_bin = Path(goma).parent / ".cipd_bin"
   if not cipd_bin.exists():
     return None
+  # Some machines have one of these files, some have the other, some have both.
   goma_auth = Path("~/.goma_client_oauth2_config").expanduser()
-  if not goma_auth.exists():
-    return None
-  return cipd_bin
+  if goma_auth.exists():
+    return cipd_bin
+  goma_auth = Path("~/.goma_oauth2_config").expanduser()
+  if goma_auth.exists():
+    return cipd_bin
+  return None
 
 
 GOMADIR = detect_goma()
@@ -383,6 +389,8 @@ def run_tests(self):
 
 # Contrary to RawConfig, takes arch and mode, and sets everything up
 # automatically.
+# Note: This class is imported by update-compile-commands.py. When renaming
+# anything here, please update that script too!
 class ManagedConfig(RawConfig):
 
   def __init__(self,
diff --git a/deps/v8/tools/dev/update-compile-commands.py b/deps/v8/tools/dev/update-compile-commands.py
index 9abbdb7a9fccc5..9686d6502683c6 100755
--- a/deps/v8/tools/dev/update-compile-commands.py
+++ b/deps/v8/tools/dev/update-compile-commands.py
@@ -52,7 +52,7 @@ def PrepareBuildDir(arch, mode):
     os.makedirs(build_dir)
   args_gn = os.path.join(build_dir, "args.gn")
   if not os.path.exists(args_gn):
-    conf = gm.Config(arch, mode, [])
+    conf = gm.ManagedConfig(arch, mode, [])
     _Write(args_gn, conf.get_gn_args())
   build_ninja = os.path.join(build_dir, "build.ninja")
   if not os.path.exists(build_ninja):
@@ -104,7 +104,7 @@ def GenerateCCFiles():
 def StartGoma():
   gomadir = gm.detect_goma()
   if (gomadir is not None and
-      _Call("ps -e | grep compiler_proxy > /dev/null", silent=True) != 0):
+      _Call("pgrep -x compiler_proxy > /dev/null", silent=True) != 0):
     _Call("%s/goma_ctl.py ensure_start" % gomadir)
 
 if __name__ == "__main__":
diff --git a/deps/v8/tools/gc-nvp-to-csv.py b/deps/v8/tools/gc-nvp-to-csv.py
index f8590717bb37fe..b248649b2bb327 100755
--- a/deps/v8/tools/gc-nvp-to-csv.py
+++ b/deps/v8/tools/gc-nvp-to-csv.py
@@ -5,31 +5,42 @@
 # found in the LICENSE file.
 
 #
-# This is an utility for generating csv files based on GC traces produced by
+# This is a utility for generating csv files based on GC traces produced by
 # V8 when run with flags --trace-gc --trace-gc-nvp.
 #
-# Usage: gc-nvp-to-csv.py <GC-trace-filename>
+# Usage: gc-nvp-to-csv.py [-h] [filename]
 #
 
 
 # for py2/py3 compatibility
 from __future__ import print_function
 
+import argparse
 import sys
 import gc_nvp_common
 
 
-def process_trace(filename):
-  trace = gc_nvp_common.parse_gc_trace(filename)
-  if len(trace):
-    keys = trace[0].keys()
-    print(', '.join(keys))
+def process_trace(f):
+  trace, keys = gc_nvp_common.parse_gc_trace_with_keys(f)
+  if trace:
+    print(*keys, sep=', ')
     for entry in trace:
-      print(', '.join(map(lambda key: str(entry[key]), keys)))
+      print(*(entry.get(key, '') for key in keys), sep=', ')
 
 
-if len(sys.argv) != 2:
-  print("Usage: %s <GC-trace-filename>" % sys.argv[0])
-  sys.exit(1)
+def main(args):
+  if args.filename:
+    with open(args.filename, 'rt') as f:
+      process_trace(f)
+  else:
+    process_trace(sys.stdin)
 
-process_trace(sys.argv[1])
+
+if __name__ == '__main__':
+  # Command line options.
+  parser = argparse.ArgumentParser(
+      description='Helper script for converting --trace-gc-nvp logs to CSV')
+  parser.add_argument('filename', type=str, nargs='?', help='GC trace log file')
+  args = parser.parse_args()
+  # Call the main function.
+  main(args)
diff --git a/deps/v8/tools/gc_nvp_common.py b/deps/v8/tools/gc_nvp_common.py
index 3b51731399df28..399973f321590d 100644
--- a/deps/v8/tools/gc_nvp_common.py
+++ b/deps/v8/tools/gc_nvp_common.py
@@ -10,23 +10,59 @@
 from __future__ import with_statement
 import re
 
+
 def split_nvp(s):
   t = {}
-  for (name, value) in re.findall(r"([._\w]+)=([-\w]+(?:\.[0-9]+)?)", s):
+  for name, value in re.findall(r"([._\w]+)=([-\w]+(?:\.[0-9]+)?)", s):
     try:
       t[name] = float(value)
     except ValueError:
       t[name] = value
-
   return t
 
 
+def split_nvp_with_keys(s):
+  t, k = {}, []
+  for name, value in re.findall(r"([._\w]+)=([-\w]+(?:\.[0-9]+)?)", s):
+    try:
+      t[name] = float(value)
+    except ValueError:
+      t[name] = value
+    k.append(name)
+  return t, k
+
+
 def parse_gc_trace(input):
+  # If input is string, treat it as a filename and open the file for reading.
+  if isinstance(input, str):
+    with open(input, 'rt') as f:
+      return parse_gc_trace(f)
+  # Otherwise, treat it as a file-like object.
   trace = []
-  with open(input) as f:
-    for line in f:
-      info = split_nvp(line)
-      if info and 'pause' in info and info['pause'] > 0:
-        info['i'] = len(trace)
-        trace.append(info)
+  for line in input:
+    info = split_nvp(line)
+    if info and 'pause' in info and info['pause'] > 0:
+      info['i'] = len(trace)
+      trace.append(info)
   return trace
+
+
+def parse_gc_trace_with_keys(input):
+  # If input is string, treat it as a filename and open the file for reading.
+  if isinstance(input, str):
+    with open(input, 'rt') as f:
+      return parse_gc_trace_with_keys(f)
+  # Otherwise, treat it as a file-like object.
+  trace = []
+  keys = {'i'}
+  key_list = ['i']
+  for line in input:
+    info, info_keys = split_nvp_with_keys(line)
+    if info and 'pause' in info and info['pause'] > 0:
+      info['i'] = len(trace)
+      trace.append(info)
+      for key in info_keys:
+        if key not in keys:
+          keys.add(key)
+          key_list.append(key)
+  return trace, key_list
diff --git a/deps/v8/tools/gcmole/Makefile b/deps/v8/tools/gcmole/Makefile
index fe295341dab6c1..957052c8b3a322 100644
--- a/deps/v8/tools/gcmole/Makefile
+++ b/deps/v8/tools/gcmole/Makefile
@@ -46,7 +46,7 @@ libgcmole.so: gcmole.cc
 	-D__STDC_LIMIT_MACROS -fomit-frame-pointer -fno-exceptions        \
 	-fno-rtti -fPIC -Woverloaded-virtual -Wcast-qual -fno-strict-aliasing \
 	-pedantic -Wno-long-long -Wall -W -Wno-unused-parameter               \
-	-Wwrite-strings -static-libstdc++ -std=c++0x -shared -o libgcmole.so  \
+	-Wwrite-strings -static-libstdc++ -std=c++17 -shared -o libgcmole.so  \
 	gcmole.cc
 
 clean:
diff --git a/deps/v8/tools/gcmole/README b/deps/v8/tools/gcmole/README
index 15828fa435381b..0b5fed89434ad6 100644
--- a/deps/v8/tools/gcmole/README
+++ b/deps/v8/tools/gcmole/README
@@ -1,6 +1,6 @@
 DESCRIPTION -------------------------------------------------------------------
 
-gcmole is a simple static analysis tool used to find possible evaluation order 
+gcmole is a simple static analysis tool used to find possible evaluation order
 dependent GC-unsafe places in the V8 codebase and "stale" pointers to the heap
 (ones whose addresses got invalidated by the GC).
 
@@ -13,9 +13,9 @@ For example the following code is GC-unsafe:
     baz->Qux(*Foo());  // (a)
     Bar(*Foo(), *baz); // (b)
 
-Both in cases (a) and (b) compiler is free to evaluate call arguments (that 
-includes receiver) in any order. That means it can dereference baz before 
-calling to Foo and save a raw pointer to a heap object in the register or 
+Both in cases (a) and (b) compiler is free to evaluate call arguments (that
+includes receiver) in any order. That means it can dereference baz before
+calling to Foo and save a raw pointer to a heap object in the register or
 on the stack.
 
 In terms of the AST analysis that gcmole does, it warns about places in the
@@ -28,7 +28,7 @@ function was detected as potentially allocating, as in the previous example):
 
     JSObject raw_obj = ...;
     Foo();
-    raw_obj.Print();
+    Print(raw_obj);
 
 Since Foo can trigger a GC, it might have moved the raw_obj. The solution is
 simply to store it as a Handle.
@@ -43,7 +43,7 @@ PREREQUISITES -----------------------------------------------------------------
 
     Follow the instructions on http://clang.llvm.org/get_started.html.
 
-    Make sure to pass -DCMAKE_BUILD_TYPE=Release to cmake to get Release build 
+    Make sure to pass -DCMAKE_BUILD_TYPE=Release to cmake to get Release build
     instead of a Debug one.
 
 (3) Build gcmole Clang plugin (libgcmole.so)
@@ -73,16 +73,16 @@ CLANG_BIN=<path-to-clang-bin-folder> python tools/gcmole/gcmole.py [<arch>]
 
 where arch should be one of architectures supported by V8 (arm, ia32, x64).
 
-Analysis will be performed in 2 stages: 
+Analysis will be performed in 2 stages:
 
-- on the first stage driver will parse all files and build a global callgraph 
+- on the first stage driver will parse all files and build a global callgraph
 approximation to find all functions that might potentially cause GC, list
 of this functions will be written into gcsuspects file.
 
-- on the second stage driver will parse all files again and will locate all 
-callsites that might be GC-unsafe based on the list of functions causing GC. 
-Such places are marked with a "Possible problem with evaluation order." 
-warning. Messages "Failed to resolve v8::internal::Object" are benign and 
+- on the second stage driver will parse all files again and will locate all
+callsites that might be GC-unsafe based on the list of functions causing GC.
+Such places are marked with a "Possible problem with evaluation order."
+warning. Messages "Failed to resolve v8::internal::Object" are benign and
 can be ignored.
 
 If any errors were found driver exits with non-zero status.
diff --git a/deps/v8/tools/gcmole/bootstrap.sh b/deps/v8/tools/gcmole/bootstrap.sh
index f47ba6d2139deb..dc9205c740beca 100755
--- a/deps/v8/tools/gcmole/bootstrap.sh
+++ b/deps/v8/tools/gcmole/bootstrap.sh
@@ -33,7 +33,7 @@
 # that the resulting binary is easier transferable between different
 # environments.
 
-LLVM_RELEASE=9.0.1
+LLVM_RELEASE=16.0.2
 
 BUILD_TYPE="Release"
 # BUILD_TYPE="Debug"
@@ -126,7 +126,7 @@ set +x
 
 echo '#########################################################################'
 echo 'Congratulations you compiled clang and libgcmole.so'
-echo 
+echo
 echo '# You can now run gcmole:'
 echo 'tools/gcmole/gcmole.py \'
 echo '   --clang-bin-dir="tools/gcmole/bootstrap/build/bin" \'
diff --git a/deps/v8/tools/gcmole/gcmole-test.cc b/deps/v8/tools/gcmole/gcmole-test.cc
index 39d7ce1e154bd1..b08f1bec8a1776 100644
--- a/deps/v8/tools/gcmole/gcmole-test.cc
+++ b/deps/v8/tools/gcmole/gcmole-test.cc
@@ -37,8 +37,8 @@ Managed<Smi> CauseGCManaged(int i, Isolate* isolate) {
 }
 
 void TwoArgumentsFunction(Object a, Object b) {
-  a.Print();
-  b.Print();
+  Print(a);
+  Print(b);
 }
 
 void TestTwoArguments(Isolate* isolate) {
@@ -65,10 +65,10 @@ void TestTwoSizeTArguments(Isolate* isolate) {
 
 class SomeObject : public Object {
  public:
-  void Method(Object a) { a.Print(); }
+  void Method(Object a) { Print(a); }
 
   SomeObject& operator=(const Object& b) {
-    this->Print();
+    Print(*this);
     return *this;
   }
 
@@ -161,7 +161,7 @@ void TestDeadVarAnalysis(Isolate* isolate) {
   CauseGCRaw(raw_obj, isolate);
 
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestDeadVarBecauseOfSafepointAnalysis(Isolate* isolate) {
@@ -169,7 +169,7 @@ void TestDeadVarBecauseOfSafepointAnalysis(Isolate* isolate) {
   Safepoint();
 
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedDeadVarAnalysis(Isolate* isolate) {
@@ -182,7 +182,7 @@ void TestGuardedDeadVarAnalysis(Isolate* isolate) {
   CauseGCRaw(raw_obj, isolate);
 
   // Shouldn't cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedDeadVarAnalysis2(Isolate* isolate) {
@@ -195,7 +195,7 @@ void TestGuardedDeadVarAnalysis2(Isolate* isolate) {
   CauseGCRaw(raw_obj, isolate);
 
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedAgainstSafepointDeadVarAnalysis(Isolate* isolate) {
@@ -208,7 +208,7 @@ void TestGuardedAgainstSafepointDeadVarAnalysis(Isolate* isolate) {
   Safepoint();
 
   // Shouldn't cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedAgainstSafepointDeadVarAnalysis2(Isolate* isolate) {
@@ -221,7 +221,7 @@ void TestGuardedAgainstSafepointDeadVarAnalysis2(Isolate* isolate) {
   Safepoint();
 
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedAgainstSafepointDeadVarAnalysis3(Isolate* isolate) {
@@ -232,14 +232,14 @@ void TestGuardedAgainstSafepointDeadVarAnalysis3(Isolate* isolate) {
   DisallowGarbageCollection no_gc;
   Safepoint();
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
   {
     DisableGCMole no_gc_mole;
     // Shouldn't cause warning.
-    raw_obj.Print();
+    Print(raw_obj);
   }
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestOnlyHeapGuardedDeadVarAnalysisInCompound(Isolate* isolate) {
@@ -249,7 +249,7 @@ void TestOnlyHeapGuardedDeadVarAnalysisInCompound(Isolate* isolate) {
   DisallowHeapAccess no_gc;
   CauseGCRaw(raw_obj, isolate);
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestOnlyHeapGuardedDeadVarAnalysisInCompound2(Isolate* isolate) {
@@ -259,16 +259,16 @@ void TestOnlyHeapGuardedDeadVarAnalysisInCompound2(Isolate* isolate) {
   DisallowHeapAccess no_gc;
   CauseGCRaw(raw_obj, isolate);
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
   DisableGCMole no_gc_mole;
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedDeadVarAnalysisNested(JSObject raw_obj, Isolate* isolate) {
   CauseGCRaw(raw_obj, isolate);
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedDeadVarAnalysisCaller(Isolate* isolate) {
@@ -276,7 +276,7 @@ void TestGuardedDeadVarAnalysisCaller(Isolate* isolate) {
   JSObject raw_obj = *isolate->factory()->NewJSObjectWithNullProto();
   TestGuardedDeadVarAnalysisNested(raw_obj, isolate);
   // Shouldn't cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedDeadVarAnalysisCaller2(Isolate* isolate) {
@@ -284,7 +284,7 @@ void TestGuardedDeadVarAnalysisCaller2(Isolate* isolate) {
   JSObject raw_obj = *isolate->factory()->NewJSObjectWithNullProto();
   TestGuardedDeadVarAnalysisNested(raw_obj, isolate);
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedDeadVarAnalysisCaller3(Isolate* isolate) {
@@ -292,14 +292,14 @@ void TestGuardedDeadVarAnalysisCaller3(Isolate* isolate) {
   JSObject raw_obj = *isolate->factory()->NewJSObjectWithNullProto();
   TestGuardedDeadVarAnalysisNested(raw_obj, isolate);
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedDeadVarAnalysisCaller4(Isolate* isolate) {
   JSObject raw_obj = *isolate->factory()->NewJSObjectWithNullProto();
   TestGuardedDeadVarAnalysisNested(raw_obj, isolate);
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 JSObject GuardedAllocation(Isolate* isolate) {
@@ -316,7 +316,7 @@ void TestNestedDeadVarAnalysis(Isolate* isolate) {
   JSObject raw_obj = GuardedAllocation(isolate);
   CauseGCRaw(raw_obj, isolate);
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestNestedDeadVarAnalysis2(Isolate* isolate) {
@@ -324,7 +324,7 @@ void TestNestedDeadVarAnalysis2(Isolate* isolate) {
   JSObject raw_obj = GuardedAllocation(isolate);
   CauseGCRaw(raw_obj, isolate);
   // Shouldn't cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 // Test that putting a guard in the middle of the function doesn't
@@ -335,7 +335,7 @@ void TestGuardedDeadVarAnalysisMidFunction(Isolate* isolate) {
   // Guarding the rest of the function from triggering a GC.
   DisallowGarbageCollection no_gc;
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 // Test that putting a guard in the middle of the function doesn't
@@ -346,7 +346,7 @@ void TestGuardedDeadVarAnalysisMidFunction2(Isolate* isolate) {
   // Guarding the rest of the function from triggering a GC.
   DisableGCMole no_gc_mole;
   // Should cause warning.
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 void TestGuardedDeadVarAnalysisMultipleSafepoints(Isolate* isolate) {
@@ -356,7 +356,7 @@ void TestGuardedDeadVarAnalysisMultipleSafepoints(Isolate* isolate) {
   JSObject raw_obj = *isolate->factory()->NewJSObjectWithNullProto();
   DisallowGarbageCollection no_gc;
   Safepoint();
-  raw_obj.Print();
+  Print(raw_obj);
 }
 
 }  // namespace internal
diff --git a/deps/v8/tools/gcmole/gcmole-tools.tar.gz.sha1 b/deps/v8/tools/gcmole/gcmole-tools.tar.gz.sha1
index 70900be895cc2b..5f6b96c61212c5 100644
--- a/deps/v8/tools/gcmole/gcmole-tools.tar.gz.sha1
+++ b/deps/v8/tools/gcmole/gcmole-tools.tar.gz.sha1
@@ -1 +1 @@
-270aaed40a5d903a4795a2b59c33991b2885374c
\ No newline at end of file
+97566bb4a526de53760a1df5a01678a15ef2b88b
diff --git a/deps/v8/tools/gcmole/gcmole.cc b/deps/v8/tools/gcmole/gcmole.cc
index 74208b27eec46c..0a364feaba3a90 100644
--- a/deps/v8/tools/gcmole/gcmole.cc
+++ b/deps/v8/tools/gcmole/gcmole.cc
@@ -34,14 +34,19 @@
 #include <set>
 #include <stack>
 
+#include "clang/AST/APValue.h"
 #include "clang/AST/AST.h"
 #include "clang/AST/ASTConsumer.h"
+#include "clang/AST/DeclCXX.h"
+#include "clang/AST/DeclTemplate.h"
 #include "clang/AST/Mangle.h"
 #include "clang/AST/RecursiveASTVisitor.h"
 #include "clang/AST/StmtVisitor.h"
+#include "clang/AST/TemplateBase.h"
 #include "clang/Basic/FileManager.h"
 #include "clang/Frontend/CompilerInstance.h"
 #include "clang/Frontend/FrontendPluginRegistry.h"
+#include "llvm/Support/Casting.h"
 #include "llvm/Support/raw_ostream.h"
 
 namespace {
@@ -80,10 +85,10 @@ typedef std::set<MangledName> CalleesSet;
 typedef std::map<MangledName, MangledName> CalleesMap;
 
 static bool GetMangledName(clang::MangleContext* ctx,
-                           const clang::NamedDecl* decl,
-                           MangledName* result) {
+                           const clang::NamedDecl* decl, MangledName* result) {
   if (llvm::isa<clang::CXXConstructorDecl>(decl)) return false;
   if (llvm::isa<clang::CXXDestructorDecl>(decl)) return false;
+  if (llvm::isa<clang::CXXDeductionGuideDecl>(decl)) return false;
   llvm::SmallVector<char, 512> output;
   llvm::raw_svector_ostream out(output);
   ctx->mangleName(decl, out);
@@ -91,19 +96,18 @@ static bool GetMangledName(clang::MangleContext* ctx,
   return true;
 }
 
-
 static bool InV8Namespace(const clang::NamedDecl* decl) {
   return decl->getQualifiedNameAsString().compare(0, 4, "v8::") == 0;
 }
 
-
 static std::string EXTERNAL("EXTERNAL");
 static std::string STATE_TAG("enum v8::internal::StateTag");
 
 static bool IsExternalVMState(const clang::ValueDecl* var) {
   const clang::EnumConstantDecl* enum_constant =
       llvm::dyn_cast<clang::EnumConstantDecl>(var);
-  if (enum_constant != NULL && enum_constant->getNameAsString() == EXTERNAL) {
+  if (enum_constant != nullptr &&
+      enum_constant->getNameAsString() == EXTERNAL) {
     clang::QualType type = enum_constant->getType();
     return (type.getAsString() == STATE_TAG);
   }
@@ -111,15 +115,12 @@ static bool IsExternalVMState(const clang::ValueDecl* var) {
   return false;
 }
 
-
 struct Resolver {
   explicit Resolver(clang::ASTContext& ctx)
-      : ctx_(ctx), decl_ctx_(ctx.getTranslationUnitDecl()) {
-  }
+      : ctx_(ctx), decl_ctx_(ctx.getTranslationUnitDecl()) {}
 
   Resolver(clang::ASTContext& ctx, clang::DeclContext* decl_ctx)
-      : ctx_(ctx), decl_ctx_(decl_ctx) {
-  }
+      : ctx_(ctx), decl_ctx_(decl_ctx) {}
 
   clang::DeclarationName ResolveName(const char* n) {
     clang::IdentifierInfo* ident = &ctx_.Idents.get(n);
@@ -130,9 +131,9 @@ struct Resolver {
     return Resolver(ctx_, Resolve<clang::NamespaceDecl>(n));
   }
 
-  template<typename T>
+  template <typename T>
   T* Resolve(const char* n) {
-    if (decl_ctx_ == NULL) return NULL;
+    if (decl_ctx_ == nullptr) return nullptr;
 
     clang::DeclContext::lookup_result result =
         decl_ctx_->lookup(ResolveName(n));
@@ -140,72 +141,34 @@ struct Resolver {
     clang::DeclContext::lookup_iterator end = result.end();
     for (clang::DeclContext::lookup_iterator i = result.begin(); i != end;
          i++) {
-      if (llvm::isa<T>(*i)) {
-        return llvm::cast<T>(*i);
-      } else {
-        llvm::errs() << "Didn't match declaration template against "
-                     << (*i)->getNameAsString() << "\n";
+      clang::NamedDecl* decl = *i;
+
+      // Try to strip off any type aliases.
+      const clang::TypeAliasDecl* type_alias_decl =
+          llvm::dyn_cast_or_null<clang::TypeAliasDecl>(decl);
+      if (type_alias_decl) {
+        clang::QualType underlying_type = type_alias_decl->getUnderlyingType();
+        clang::QualType desugared_type = underlying_type.getDesugaredType(ctx_);
+        clang::TagDecl* tag_decl = desugared_type->getAsTagDecl();
+        if (!tag_decl) {
+          llvm::errs() << "Couldn't resolve target decl of type alias "
+                       << decl->getNameAsString() << "\n";
+          decl->dump();
+          return nullptr;
+        }
+        decl = tag_decl;
       }
-    }
-
-    return NULL;
-  }
 
-  clang::CXXRecordDecl* ResolveTemplate(const char* n) {
-    clang::NamedDecl* initial_template = Resolve<clang::NamedDecl>(n);
-    if (!initial_template) return NULL;
-
-    clang::NamedDecl* underlying_template =
-        initial_template->getUnderlyingDecl();
-    if (!underlying_template) {
-      llvm::errs() << "Couldn't resolve underlying template\n";
-      return NULL;
-    }
-    const clang::TypeAliasDecl* type_alias_decl =
-        llvm::dyn_cast_or_null<clang::TypeAliasDecl>(underlying_template);
-    if (!type_alias_decl) {
-      llvm::errs() << "Couldn't resolve TypeAliasDecl\n";
-      return NULL;
-    }
-    const clang::Type* type = type_alias_decl->getTypeForDecl();
-    if (!type) {
-      llvm::errs() << "Couldn't resolve TypeAliasDecl to Type\n";
-      return NULL;
-    }
-    const clang::TypedefType* typedef_type =
-        llvm::dyn_cast_or_null<clang::TypedefType>(type);
-    if (!typedef_type) {
-      llvm::errs() << "Couldn't resolve TypedefType\n";
-      return NULL;
-    }
-    const clang::TypedefNameDecl* typedef_name_decl = typedef_type->getDecl();
-    if (!typedef_name_decl) {
-      llvm::errs() << "Couldn't resolve TypedefType to TypedefNameDecl\n";
-      return NULL;
-    }
-
-    clang::QualType underlying_type = typedef_name_decl->getUnderlyingType();
-    if (!llvm::isa<clang::TemplateSpecializationType>(underlying_type)) {
-      llvm::errs() << "Couldn't resolve TemplateSpecializationType\n";
-      return NULL;
-    }
+      if (llvm::isa<T>(decl)) {
+        return llvm::cast<T>(decl);
+      }
 
-    const clang::TemplateSpecializationType* templ_specialization_type =
-        llvm::cast<clang::TemplateSpecializationType>(underlying_type);
-    if (!llvm::isa<clang::RecordType>(templ_specialization_type->desugar())) {
-      llvm::errs() << "Couldn't resolve RecordType\n";
-      return NULL;
+      llvm::errs() << "Didn't match declaration template for " << n
+                   << " against " << decl->getNameAsString() << "\n";
+      decl->dump();
     }
 
-    const clang::RecordType* record_type =
-        llvm::cast<clang::RecordType>(templ_specialization_type->desugar());
-    clang::CXXRecordDecl* record_decl =
-        llvm::dyn_cast_or_null<clang::CXXRecordDecl>(record_type->getDecl());
-    if (!record_decl) {
-      llvm::errs() << "Couldn't resolve CXXRecordDecl\n";
-      return NULL;
-    }
-    return record_decl;
+    return nullptr;
   }
 
  private:
@@ -213,14 +176,13 @@ struct Resolver {
   clang::DeclContext* decl_ctx_;
 };
 
-
 class CalleesPrinter : public clang::RecursiveASTVisitor<CalleesPrinter> {
  public:
   explicit CalleesPrinter(clang::MangleContext* ctx) : ctx_(ctx) {}
 
   virtual bool VisitCallExpr(clang::CallExpr* expr) {
     const clang::FunctionDecl* callee = expr->getDirectCallee();
-    if (callee != NULL) AnalyzeFunction(callee);
+    if (callee != nullptr) AnalyzeFunction(callee);
     return true;
   }
 
@@ -240,7 +202,7 @@ class CalleesPrinter : public clang::RecursiveASTVisitor<CalleesPrinter> {
     const std::string& function = f->getNameAsString();
     AddCallee(name, function);
 
-    const clang::FunctionDecl* body = NULL;
+    const clang::FunctionDecl* body = nullptr;
     if (f->hasBody(body) && !Analyzed(name)) {
       EnterScope(name);
       TraverseStmt(body->getBody());
@@ -248,25 +210,21 @@ class CalleesPrinter : public clang::RecursiveASTVisitor<CalleesPrinter> {
     }
   }
 
-  typedef std::map<MangledName, CalleesSet* > Callgraph;
+  typedef std::map<MangledName, CalleesSet*> Callgraph;
 
-  bool Analyzed(const MangledName& name) {
-    return callgraph_[name] != NULL;
-  }
+  bool Analyzed(const MangledName& name) { return callgraph_[name] != nullptr; }
 
   void EnterScope(const MangledName& name) {
     CalleesSet* callees = callgraph_[name];
 
-    if (callees == NULL) {
+    if (callees == nullptr) {
       callgraph_[name] = callees = new CalleesSet();
     }
 
     scopes_.push(callees);
   }
 
-  void LeaveScope() {
-    scopes_.pop();
-  }
+  void LeaveScope() { scopes_.pop(); }
 
   void AddCallee(const MangledName& name, const MangledName& function) {
     if (!scopes_.empty()) scopes_.top()->insert(name);
@@ -275,14 +233,12 @@ class CalleesPrinter : public clang::RecursiveASTVisitor<CalleesPrinter> {
 
   void PrintCallGraph() {
     for (Callgraph::const_iterator i = callgraph_.begin(), e = callgraph_.end();
-         i != e;
-         ++i) {
+         i != e; ++i) {
       std::cout << i->first << "," << mangled_to_function_[i->first] << "\n";
 
       CalleesSet* callees = i->second;
       for (CalleesSet::const_iterator j = callees->begin(), e = callees->end();
-           j != e;
-           ++j) {
+           j != e; ++j) {
         std::cout << "\t" << *j << "," << mangled_to_function_[*j] << "\n";
       }
     }
@@ -291,12 +247,11 @@ class CalleesPrinter : public clang::RecursiveASTVisitor<CalleesPrinter> {
  private:
   clang::MangleContext* ctx_;
 
-  std::stack<CalleesSet* > scopes_;
+  std::stack<CalleesSet*> scopes_;
   Callgraph callgraph_;
   CalleesMap mangled_to_function_;
 };
 
-
 class FunctionDeclarationFinder
     : public clang::ASTConsumer,
       public clang::RecursiveASTVisitor<FunctionDeclarationFinder> {
@@ -308,7 +263,7 @@ class FunctionDeclarationFinder
       : diagnostics_engine_(diagnostics_engine),
         source_manager_(source_manager) {}
 
-  virtual void HandleTranslationUnit(clang::ASTContext &ctx) {
+  void HandleTranslationUnit(clang::ASTContext& ctx) override {
     mangle_context_ =
         clang::ItaniumMangleContext::create(ctx, diagnostics_engine_);
     callees_printer_ = new CalleesPrinter(mangle_context_);
@@ -446,11 +401,11 @@ class ExprEffect {
   bool hasRawUse() { return (effect_ & kRawUse) != 0; }
   void setRawUse() { effect_ |= kRawUse; }
 
-  static ExprEffect None() { return ExprEffect(kNoEffect, NULL); }
+  static ExprEffect None() { return ExprEffect(kNoEffect, nullptr); }
   static ExprEffect NoneWithEnv(Environment* env) {
     return ExprEffect(kNoEffect, env);
   }
-  static ExprEffect RawUse() { return ExprEffect(kRawUse, NULL); }
+  static ExprEffect RawUse() { return ExprEffect(kRawUse, nullptr); }
 
   static ExprEffect Merge(ExprEffect a, ExprEffect b);
   static ExprEffect MergeSeq(ExprEffect a, ExprEffect b);
@@ -460,14 +415,11 @@ class ExprEffect {
     return reinterpret_cast<Environment*>(effect_ & ~kAllEffects);
   }
 
-  static ExprEffect GC() {
-    return ExprEffect(kCausesGC, NULL);
-  }
+  static ExprEffect GC() { return ExprEffect(kCausesGC, nullptr); }
 
  private:
   ExprEffect(int effect, Environment* env)
-      : effect_((effect & kAllEffects) |
-                reinterpret_cast<intptr_t>(env)) { }
+      : effect_((effect & kAllEffects) | reinterpret_cast<intptr_t>(env)) {}
 
   intptr_t effect_;
 };
@@ -486,8 +438,7 @@ class Environment {
     return env;
   }
 
-  static Environment Merge(const Environment& l,
-                           const Environment& r) {
+  static Environment Merge(const Environment& l, const Environment& r) {
     Environment out(l);
     out &= r;
     return out;
@@ -559,8 +510,7 @@ class Environment {
   }
 
  private:
-  Environment(const Environment& l, int code)
-      : live_(l.live_) {
+  Environment(const Environment& l, int code) : live_(l.live_) {
     set_live(code);
   }
 
@@ -612,10 +562,9 @@ class Environment {
   friend class CallProps;
 };
 
-
 class CallProps {
  public:
-  CallProps() : env_(NULL) { }
+  CallProps() : env_(nullptr) {}
 
   void SetEffect(int arg, ExprEffect in) {
     if (in.hasGC()) {
@@ -623,8 +572,8 @@ class CallProps {
     }
     if (in.hasRawDef()) raw_def_.set(arg);
     if (in.hasRawUse()) raw_use_.set(arg);
-    if (in.env() != NULL) {
-      if (env_ == NULL) {
+    if (in.env() != nullptr) {
+      if (env_ == nullptr) {
         env_ = in.env();
       } else {
         *env_ |= *in.env();
@@ -656,62 +605,59 @@ class CallProps {
   Environment* env_;
 };
 
-
 Environment::SymbolTable Environment::symbol_table_;
 std::vector<Environment*> Environment::envs_;
 
 ExprEffect ExprEffect::Merge(ExprEffect a, ExprEffect b) {
   Environment* a_env = a.env();
   Environment* b_env = b.env();
-  Environment* out = NULL;
-  if (a_env != NULL && b_env != NULL) {
+  Environment* out = nullptr;
+  if (a_env != nullptr && b_env != nullptr) {
     out = Environment::Allocate(*a_env);
     *out &= *b_env;
   }
   return ExprEffect(a.effect_ | b.effect_, out);
 }
 
-
 ExprEffect ExprEffect::MergeSeq(ExprEffect a, ExprEffect b) {
-  Environment* a_env = b.hasGC() ? NULL : a.env();
+  Environment* a_env = b.hasGC() ? nullptr : a.env();
   Environment* b_env = b.env();
-  Environment* out = (b_env == NULL) ? a_env : b_env;
-  if (a_env != NULL && b_env != NULL) {
+  Environment* out = (b_env == nullptr) ? a_env : b_env;
+  if (a_env != nullptr && b_env != nullptr) {
     out = Environment::Allocate(*b_env);
     *out |= *a_env;
   }
   return ExprEffect(a.effect_ | b.effect_, out);
 }
 
-
 ExprEffect ExprEffect::Define(const std::string& name) {
   Environment* e = env();
-  if (e == NULL) {
+  if (e == nullptr) {
     e = Environment::Allocate(Environment());
   }
   e->MDefine(name);
   return ExprEffect(effect_, e);
 }
 
-
-static std::string THIS ("this");
-
+static std::string THIS("this");
 
 class FunctionAnalyzer {
  public:
   FunctionAnalyzer(clang::MangleContext* ctx, clang::CXXRecordDecl* object_decl,
                    clang::CXXRecordDecl* maybe_object_decl,
                    clang::CXXRecordDecl* smi_decl,
+                   clang::ClassTemplateDecl* tagged_decl,
                    clang::CXXRecordDecl* no_gc_mole_decl,
                    clang::DiagnosticsEngine& d, clang::SourceManager& sm)
       : ctx_(ctx),
         object_decl_(object_decl),
         maybe_object_decl_(maybe_object_decl),
         smi_decl_(smi_decl),
+        tagged_decl_(tagged_decl),
         no_gc_mole_decl_(no_gc_mole_decl),
         d_(d),
         sm_(sm),
-        block_(NULL) {}
+        block_(nullptr) {}
 
   // --------------------------------------------------------------------------
   // Expressions
@@ -721,7 +667,7 @@ class FunctionAnalyzer {
 #define VISIT(type)                                                         \
   do {                                                                      \
     clang::type* concrete_expr = llvm::dyn_cast_or_null<clang::type>(expr); \
-    if (concrete_expr != NULL) {                                            \
+    if (concrete_expr != nullptr) {                                         \
       return Visit##type(concrete_expr, env);                               \
     }                                                                       \
   } while (0);
@@ -788,12 +734,12 @@ class FunctionAnalyzer {
     return ExprEffect::None();
   }
 
-#define DECL_VISIT_EXPR(type)                                           \
-  ExprEffect Visit##type (clang::type* expr, const Environment& env)
+#define DECL_VISIT_EXPR(type) \
+  ExprEffect Visit##type(clang::type* expr, const Environment& env)
 
-#define IGNORE_EXPR(type)                                               \
-  ExprEffect Visit##type (clang::type* expr, const Environment& env) {  \
-    return ExprEffect::None();                                          \
+#define IGNORE_EXPR(type)                                             \
+  ExprEffect Visit##type(clang::type* expr, const Environment& env) { \
+    return ExprEffect::None();                                        \
   }
 
   IGNORE_EXPR(AddrLabelExpr);
@@ -830,9 +776,7 @@ class FunctionAnalyzer {
   IGNORE_EXPR(GNUNullExpr);
   IGNORE_EXPR(OverloadExpr);
 
-  DECL_VISIT_EXPR(CXXThisExpr) {
-    return Use(expr, expr->getType(), THIS, env);
-  }
+  DECL_VISIT_EXPR(CXXThisExpr) { return Use(expr, expr->getType(), THIS, env); }
 
   DECL_VISIT_EXPR(AbstractConditionalOperator) {
     Environment after_cond = env.ApplyEffect(VisitExpr(expr->getCond(), env));
@@ -878,20 +822,14 @@ class FunctionAnalyzer {
   }
 
   DECL_VISIT_EXPR(MaterializeTemporaryExpr) {
-    return VisitExpr(expr->GetTemporaryExpr(), env);
+    return VisitExpr(expr->getSubExpr(), env);
   }
 
-  DECL_VISIT_EXPR(CXXConstructExpr) {
-    return VisitArguments<>(expr, env);
-  }
+  DECL_VISIT_EXPR(CXXConstructExpr) { return VisitArguments<>(expr, env); }
 
-  DECL_VISIT_EXPR(CXXDefaultArgExpr) {
-    return VisitExpr(expr->getExpr(), env);
-  }
+  DECL_VISIT_EXPR(CXXDefaultArgExpr) { return VisitExpr(expr->getExpr(), env); }
 
-  DECL_VISIT_EXPR(CXXDeleteExpr) {
-    return VisitExpr(expr->getArgument(), env);
-  }
+  DECL_VISIT_EXPR(CXXDeleteExpr) { return VisitExpr(expr->getArgument(), env); }
 
   DECL_VISIT_EXPR(CXXNewExpr) { return VisitExpr(expr->getInitializer(), env); }
 
@@ -899,9 +837,7 @@ class FunctionAnalyzer {
     return VisitExpr(expr->getSubExpr(), env);
   }
 
-  DECL_VISIT_EXPR(CXXThrowExpr) {
-    return VisitExpr(expr->getSubExpr(), env);
-  }
+  DECL_VISIT_EXPR(CXXThrowExpr) { return VisitExpr(expr->getSubExpr(), env); }
 
   DECL_VISIT_EXPR(ImplicitCastExpr) {
     return VisitExpr(expr->getSubExpr(), env);
@@ -913,17 +849,13 @@ class FunctionAnalyzer {
     return Sequential(expr, expr->getNumInits(), expr->getInits(), env);
   }
 
-  DECL_VISIT_EXPR(MemberExpr) {
-    return VisitExpr(expr->getBase(), env);
-  }
+  DECL_VISIT_EXPR(MemberExpr) { return VisitExpr(expr->getBase(), env); }
 
   DECL_VISIT_EXPR(OpaqueValueExpr) {
     return VisitExpr(expr->getSourceExpr(), env);
   }
 
-  DECL_VISIT_EXPR(ParenExpr) {
-    return VisitExpr(expr->getSubExpr(), env);
-  }
+  DECL_VISIT_EXPR(ParenExpr) { return VisitExpr(expr->getSubExpr(), env); }
 
   DECL_VISIT_EXPR(ParenListExpr) {
     return Parallel(expr, expr->getNumExprs(), expr->getExprs(), env);
@@ -953,13 +885,9 @@ class FunctionAnalyzer {
     return VisitExpr(expr->getArgumentExpr(), env);
   }
 
-  DECL_VISIT_EXPR(CastExpr) {
-    return VisitExpr(expr->getSubExpr(), env);
-  }
+  DECL_VISIT_EXPR(CastExpr) { return VisitExpr(expr->getSubExpr(), env); }
 
-  DECL_VISIT_EXPR(DeclRefExpr) {
-    return Use(expr, expr->getDecl(), env);
-  }
+  DECL_VISIT_EXPR(DeclRefExpr) { return Use(expr, expr->getDecl(), env); }
 
   // Represents a node in the AST {parent} whose children {exprs} have
   // undefined order of evaluation, e.g. array subscript or a binary operator.
@@ -993,10 +921,8 @@ class FunctionAnalyzer {
   // and if it's a raw heap object type, we do the following:
   // 1. If it got stale due to GC since its declaration, we report it as such.
   // 2. Mark its raw usage in the ExprEffect returned by this function.
-  ExprEffect Use(const clang::Expr* parent,
-                 const clang::QualType& var_type,
-                 const std::string& var_name,
-                 const Environment& env) {
+  ExprEffect Use(const clang::Expr* parent, const clang::QualType& var_type,
+                 const std::string& var_name, const Environment& env) {
     if (!g_dead_vars_analysis) return ExprEffect::None();
     if (!RepresentsRawPointerType(var_type)) return ExprEffect::None();
     // We currently care only about our internal pointer types and not about
@@ -1011,15 +937,13 @@ class FunctionAnalyzer {
     return ExprEffect::RawUse();
   }
 
-  ExprEffect Use(const clang::Expr* parent,
-                 const clang::ValueDecl* var,
+  ExprEffect Use(const clang::Expr* parent, const clang::ValueDecl* var,
                  const Environment& env) {
     if (IsExternalVMState(var)) return ExprEffect::GC();
     return Use(parent, var->getType(), var->getNameAsString(), env);
   }
 
-
-  template<typename ExprType>
+  template <typename ExprType>
   ExprEffect VisitArguments(ExprType* call, const Environment& env) {
     CallProps props;
     VisitArguments<>(call, &props, env);
@@ -1028,9 +952,8 @@ class FunctionAnalyzer {
         RepresentsRawPointerType(call->getType()));
   }
 
-  template<typename ExprType>
-  void VisitArguments(ExprType* call,
-                      CallProps* props,
+  template <typename ExprType>
+  void VisitArguments(ExprType* call, CallProps* props,
                       const Environment& env) {
     for (unsigned arg = 0; arg < call->getNumArgs(); arg++) {
       props->SetEffect(arg + 1, VisitExpr(call->getArg(arg), env));
@@ -1040,13 +963,12 @@ class FunctionAnalyzer {
   // After visiting the receiver and the arguments of the {call} node, this
   // function might report a GC-unsafe usage (due to the undefined evaluation
   // order of the receiver and the rest of the arguments).
-  ExprEffect VisitCallExpr(clang::CallExpr* call,
-                           const Environment& env) {
+  ExprEffect VisitCallExpr(clang::CallExpr* call, const Environment& env) {
     CallProps props;
 
     clang::CXXMemberCallExpr* memcall =
         llvm::dyn_cast_or_null<clang::CXXMemberCallExpr>(call);
-    if (memcall != NULL) {
+    if (memcall != nullptr) {
       clang::Expr* receiver = memcall->getImplicitObjectArgument();
       props.SetEffect(0, VisitExpr(receiver, env));
     }
@@ -1054,7 +976,7 @@ class FunctionAnalyzer {
     std::string var_name;
     clang::CXXOperatorCallExpr* opcall =
         llvm::dyn_cast_or_null<clang::CXXOperatorCallExpr>(call);
-    if (opcall != NULL && opcall->isAssignmentOp() &&
+    if (opcall != nullptr && opcall->isAssignmentOp() &&
         IsRawPointerVar(opcall->getArg(0), &var_name)) {
       // TODO(gcmole): We are treating all assignment operator calls with
       // the left hand side looking like {raw_pointer_var} as safe independent
@@ -1072,7 +994,7 @@ class FunctionAnalyzer {
         RepresentsRawPointerType(call->getType()));
 
     clang::FunctionDecl* callee = call->getDirectCallee();
-    if (callee == NULL) return out;
+    if (callee == nullptr) return out;
 
     if (IsKnownToCauseGC(ctx_, callee)) {
       out.setGC();
@@ -1081,15 +1003,15 @@ class FunctionAnalyzer {
     }
 
     // Support for virtual methods that might be GC suspects.
-    if (memcall == NULL) return out;
+    if (memcall == nullptr) return out;
     clang::CXXMethodDecl* method =
         llvm::dyn_cast_or_null<clang::CXXMethodDecl>(callee);
-    if (method == NULL) return out;
+    if (method == nullptr) return out;
     if (!method->isVirtual()) return out;
 
     clang::CXXMethodDecl* target = method->getDevirtualizedMethod(
         memcall->getImplicitObjectArgument(), false);
-    if (target != NULL) {
+    if (target != nullptr) {
       if (IsKnownToCauseGC(ctx_, target)) {
         out.setGC();
         scopes_.back().SetGCCauseLocation(
@@ -1097,7 +1019,7 @@ class FunctionAnalyzer {
       }
     } else {
       // According to the documentation, {getDevirtualizedMethod} might
-      // return NULL, in which case we still want to use the partial
+      // return nullptr, in which case we still want to use the partial
       // match of the {method}'s name against the GC suspects in order
       // to increase coverage.
       if (IsSuspectedToCauseGC(ctx_, method)) {
@@ -1117,7 +1039,7 @@ class FunctionAnalyzer {
 #define VISIT(type)                                                         \
   do {                                                                      \
     clang::type* concrete_stmt = llvm::dyn_cast_or_null<clang::type>(stmt); \
-    if (concrete_stmt != NULL) {                                            \
+    if (concrete_stmt != nullptr) {                                         \
       return Visit##type(concrete_stmt, env);                               \
     }                                                                       \
   } while (0);
@@ -1150,12 +1072,12 @@ class FunctionAnalyzer {
     return env;
   }
 
-#define DECL_VISIT_STMT(type)                                           \
-  Environment Visit##type (clang::type* stmt, const Environment& env)
+#define DECL_VISIT_STMT(type) \
+  Environment Visit##type(clang::type* stmt, const Environment& env)
 
-#define IGNORE_STMT(type)                                               \
-  Environment Visit##type (clang::type* stmt, const Environment& env) { \
-    return env;                                                         \
+#define IGNORE_STMT(type)                                              \
+  Environment Visit##type(clang::type* stmt, const Environment& env) { \
+    return env;                                                        \
   }
 
   IGNORE_STMT(IndirectGotoStmt);
@@ -1172,8 +1094,7 @@ class FunctionAnalyzer {
 
   class Block {
    public:
-    Block(const Environment& in,
-          FunctionAnalyzer* owner)
+    Block(const Environment& in, FunctionAnalyzer* owner)
         : in_(in),
           out_(Environment::Unreachable()),
           changed_(false),
@@ -1181,9 +1102,7 @@ class FunctionAnalyzer {
       parent_ = owner_->EnterBlock(this);
     }
 
-    ~Block() {
-      owner_->LeaveBlock(parent_);
-    }
+    ~Block() { owner_->LeaveBlock(parent_); }
 
     void MergeIn(const Environment& env) {
       Environment old_in = in_;
@@ -1197,13 +1116,9 @@ class FunctionAnalyzer {
       return true;
     }
 
-    const Environment& in() {
-      return in_;
-    }
+    const Environment& in() { return in_; }
 
-    const Environment& out() {
-      return out_;
-    }
+    const Environment& out() { return out_; }
 
     void MergeOut(const Environment& env) {
       out_ = Environment::Merge(out_, env);
@@ -1232,7 +1147,6 @@ class FunctionAnalyzer {
       MergeIn(out());
     }
 
-
    private:
     Environment in_;
     Environment out_;
@@ -1241,7 +1155,6 @@ class FunctionAnalyzer {
     Block* parent_;
   };
 
-
   DECL_VISIT_STMT(BreakStmt) {
     block_->MergeOut(env);
     return Environment::Unreachable();
@@ -1256,8 +1169,7 @@ class FunctionAnalyzer {
     scopes_.push_back(GCScope());
     Environment out = env;
     clang::CompoundStmt::body_iterator end = stmt->body_end();
-    for (clang::CompoundStmt::body_iterator s = stmt->body_begin();
-         s != end;
+    for (clang::CompoundStmt::body_iterator s = stmt->body_begin(); s != end;
          ++s) {
       out = VisitStmt(*s, out);
     }
@@ -1266,7 +1178,7 @@ class FunctionAnalyzer {
   }
 
   DECL_VISIT_STMT(WhileStmt) {
-    Block block (env, this);
+    Block block(env, this);
     do {
       block.Loop(stmt->getCond(), stmt->getBody());
     } while (block.changed());
@@ -1274,7 +1186,7 @@ class FunctionAnalyzer {
   }
 
   DECL_VISIT_STMT(DoStmt) {
-    Block block (env, this);
+    Block block(env, this);
     do {
       block.Loop(stmt->getBody(), stmt->getCond());
     } while (block.changed());
@@ -1282,7 +1194,7 @@ class FunctionAnalyzer {
   }
 
   DECL_VISIT_STMT(ForStmt) {
-    Block block (VisitStmt(stmt->getInit(), env), this);
+    Block block(VisitStmt(stmt->getInit(), env), this);
     do {
       block.Loop(stmt->getCond(), stmt->getBody(), stmt->getInc());
     } while (block.changed());
@@ -1297,7 +1209,7 @@ class FunctionAnalyzer {
   }
 
   DECL_VISIT_STMT(SwitchStmt) {
-    Block block (env, this);
+    Block block(env, this);
     block.Sequential(stmt->getCond(), stmt->getBody());
     return block.out();
   }
@@ -1319,8 +1231,8 @@ class FunctionAnalyzer {
   }
 
   const clang::TagType* ToTagType(const clang::Type* t) {
-    if (t == NULL) {
-      return NULL;
+    if (t == nullptr) {
+      return nullptr;
     } else if (llvm::isa<clang::TagType>(t)) {
       return llvm::cast<clang::TagType>(t);
     } else if (llvm::isa<clang::SubstTemplateTypeParmType>(t)) {
@@ -1328,7 +1240,7 @@ class FunctionAnalyzer {
                            ->getReplacementType()
                            .getTypePtr());
     } else {
-      return NULL;
+      return nullptr;
     }
   }
 
@@ -1337,21 +1249,51 @@ class FunctionAnalyzer {
     return (record == base) || record->isDerivedFrom(base);
   }
 
+  // Tagged<T> -> T
+  const clang::CXXRecordDecl* ExtractPointedToTypeIfTagged(
+      const clang::CXXRecordDecl* record) {
+    if (record == nullptr) return nullptr;
+    if (!InV8Namespace(record)) return nullptr;
+    auto* specialization =
+        llvm::dyn_cast<clang::ClassTemplateSpecializationDecl>(record);
+    if (!specialization) return record;
+    auto* template_decl =
+        specialization->getSpecializedTemplate()->getCanonicalDecl();
+    if (template_decl != tagged_decl_) return record;
+    auto& template_args = specialization->getTemplateArgs();
+    if (template_args.size() != 1) {
+      llvm::errs() << "v8::internal::Tagged<T> should have exactly one "
+                      "template argument\n";
+      specialization->dump(llvm::errs());
+      return nullptr;
+    }
+    if (template_args[0].getKind() != clang::TemplateArgument::Type) {
+      llvm::errs() << "v8::internal::Tagged<T>, T should be a type argument\n";
+      specialization->dump(llvm::errs());
+      return nullptr;
+    }
+    return template_args[0].getAsType()->getAsCXXRecordDecl();
+  }
+
   const clang::CXXRecordDecl* GetDefinitionOrNull(
       const clang::CXXRecordDecl* record) {
-    if (record == NULL) return NULL;
-    if (!InV8Namespace(record)) return NULL;
-    if (!record->hasDefinition()) return NULL;
+    if (record == nullptr) return nullptr;
+    if (!InV8Namespace(record)) return nullptr;
+    if (!record->hasDefinition()) return nullptr;
     return record->getDefinition();
   }
 
   bool IsDerivedFromInternalPointer(const clang::CXXRecordDecl* record) {
+    record = ExtractPointedToTypeIfTagged(record);
     const clang::CXXRecordDecl* definition = GetDefinitionOrNull(record);
     if (!definition) return false;
-    bool result = (IsDerivedFrom(record, object_decl_) &&
-                   !IsDerivedFrom(record, smi_decl_)) ||
-                  IsDerivedFrom(record, maybe_object_decl_);
-    return result;
+    if (IsDerivedFrom(record, object_decl_)) {
+      return !IsDerivedFrom(record, smi_decl_);
+    }
+    if (IsDerivedFrom(record, maybe_object_decl_)) {
+      return true;
+    }
+    return false;
   }
 
   bool IsRawPointerType(const clang::PointerType* type) {
@@ -1378,7 +1320,7 @@ class FunctionAnalyzer {
 
     const clang::PointerType* pointer_type =
         llvm::dyn_cast_or_null<clang::PointerType>(qtype.getTypePtrOrNull());
-    if (pointer_type != NULL) {
+    if (pointer_type != nullptr) {
       return IsRawPointerType(pointer_type);
     } else {
       return IsInternalPointerType(qtype);
@@ -1418,29 +1360,24 @@ class FunctionAnalyzer {
   DECL_VISIT_STMT(DeclStmt) {
     Environment out = env;
     clang::DeclStmt::decl_iterator end = stmt->decl_end();
-    for (clang::DeclStmt::decl_iterator decl = stmt->decl_begin();
-         decl != end;
+    for (clang::DeclStmt::decl_iterator decl = stmt->decl_begin(); decl != end;
          ++decl) {
       out = VisitDecl(*decl, out);
     }
     return out;
   }
 
-
-  void DefineParameters(const clang::FunctionDecl* f,
-                        Environment* env) {
+  void DefineParameters(const clang::FunctionDecl* f, Environment* env) {
     env->MDefine(THIS);
     clang::FunctionDecl::param_const_iterator end = f->param_end();
     for (clang::FunctionDecl::param_const_iterator p = f->param_begin();
-         p != end;
-         ++p) {
+         p != end; ++p) {
       env->MDefine((*p)->getNameAsString());
     }
   }
 
-
   void AnalyzeFunction(const clang::FunctionDecl* f) {
-    const clang::FunctionDecl* body = NULL;
+    const clang::FunctionDecl* body = nullptr;
     if (f->hasBody(body)) {
       Environment env;
       DefineParameters(body, &env);
@@ -1455,9 +1392,7 @@ class FunctionAnalyzer {
     return parent;
   }
 
-  void LeaveBlock(Block* block) {
-    block_ = block;
-  }
+  void LeaveBlock(Block* block) { block_ = block; }
 
   bool HasActiveGuard() {
     for (const auto s : scopes_) {
@@ -1503,11 +1438,11 @@ class FunctionAnalyzer {
     }
   }
 
-
   clang::MangleContext* ctx_;
   clang::CXXRecordDecl* object_decl_;
   clang::CXXRecordDecl* maybe_object_decl_;
   clang::CXXRecordDecl* smi_decl_;
+  clang::ClassTemplateDecl* tagged_decl_;
   clang::CXXRecordDecl* no_gc_mole_decl_;
   clang::CXXRecordDecl* no_heap_access_decl_;
 
@@ -1574,17 +1509,17 @@ class ProblemsFinder : public clang::ASTConsumer,
     return result;
   }
 
-  virtual void HandleTranslationUnit(clang::ASTContext &ctx) {
+  void HandleTranslationUnit(clang::ASTContext& ctx) override {
     if (TranslationUnitIgnored()) return;
 
     Resolver r(ctx);
 
-    // It is a valid situation that no_gc_mole_decl == NULL when DisableGCMole
-    // is not included and can't be resolved. This is gracefully handled in the
-    // FunctionAnalyzer later.
+    // It is a valid situation that no_gc_mole_decl == nullptr when
+    // DisableGCMole is not included and can't be resolved. This is gracefully
+    // handled in the FunctionAnalyzer later.
     auto v8_internal = r.ResolveNamespace("v8").ResolveNamespace("internal");
     clang::CXXRecordDecl* no_gc_mole_decl =
-        v8_internal.ResolveTemplate("DisableGCMole");
+        v8_internal.Resolve<clang::CXXRecordDecl>("DisableGCMole");
 
     clang::CXXRecordDecl* object_decl =
         v8_internal.Resolve<clang::CXXRecordDecl>("Object");
@@ -1595,29 +1530,38 @@ class ProblemsFinder : public clang::ASTConsumer,
     clang::CXXRecordDecl* smi_decl =
         v8_internal.Resolve<clang::CXXRecordDecl>("Smi");
 
-    if (object_decl != NULL) object_decl = object_decl->getDefinition();
+    clang::ClassTemplateDecl* tagged_decl =
+        v8_internal.Resolve<clang::ClassTemplateDecl>("Tagged");
+
+    if (object_decl != nullptr) object_decl = object_decl->getDefinition();
 
-    if (maybe_object_decl != NULL) {
+    if (maybe_object_decl != nullptr) {
       maybe_object_decl = maybe_object_decl->getDefinition();
     }
 
-    if (smi_decl != NULL) smi_decl = smi_decl->getDefinition();
+    if (smi_decl != nullptr) smi_decl = smi_decl->getDefinition();
 
-    if (object_decl != NULL && smi_decl != NULL && maybe_object_decl != NULL) {
+    if (tagged_decl != nullptr) tagged_decl = tagged_decl->getCanonicalDecl();
+
+    if (object_decl != nullptr && smi_decl != nullptr &&
+        maybe_object_decl != nullptr && tagged_decl != nullptr) {
       function_analyzer_ = new FunctionAnalyzer(
           clang::ItaniumMangleContext::create(ctx, d_), object_decl,
-          maybe_object_decl, smi_decl, no_gc_mole_decl, d_, sm_);
+          maybe_object_decl, smi_decl, tagged_decl, no_gc_mole_decl, d_, sm_);
       TraverseDecl(ctx.getTranslationUnitDecl());
     } else if (g_verbose) {
-      if (object_decl == NULL) {
+      if (object_decl == nullptr) {
         llvm::errs() << "Failed to resolve v8::internal::Object\n";
       }
-      if (maybe_object_decl == NULL) {
+      if (maybe_object_decl == nullptr) {
         llvm::errs() << "Failed to resolve v8::internal::MaybeObject\n";
       }
-      if (smi_decl == NULL) {
+      if (smi_decl == nullptr) {
         llvm::errs() << "Failed to resolve v8::internal::Smi\n";
       }
+      if (tagged_decl == nullptr) {
+        llvm::errs() << "Failed to resolve v8::internal::Tagged<T>\n";
+      }
     }
   }
 
@@ -1646,36 +1590,34 @@ class ProblemsFinder : public clang::ASTConsumer,
   FunctionAnalyzer* function_analyzer_;
 };
 
-template<typename ConsumerType>
+template <typename ConsumerType>
 class Action : public clang::PluginASTAction {
  protected:
-  virtual std::unique_ptr<clang::ASTConsumer> CreateASTConsumer(
-      clang::CompilerInstance& CI, llvm::StringRef InFile) {
+  std::unique_ptr<clang::ASTConsumer> CreateASTConsumer(
+      clang::CompilerInstance& CI, llvm::StringRef InFile) override {
     return std::unique_ptr<clang::ASTConsumer>(
         new ConsumerType(CI.getDiagnostics(), CI.getSourceManager(), args_));
   }
 
-  bool ParseArgs(const clang::CompilerInstance &CI,
-                 const std::vector<std::string>& args) {
+  bool ParseArgs(const clang::CompilerInstance& CI,
+                 const std::vector<std::string>& args) override {
     args_ = args;
     return true;
   }
 
-  void PrintHelp(llvm::raw_ostream& ros) {
-  }
+  void PrintHelp(llvm::raw_ostream& ros) {}
+
  private:
   std::vector<std::string> args_;
 };
 
+}  // namespace
 
-}
-
-static clang::FrontendPluginRegistry::Add<Action<ProblemsFinder> >
-FindProblems("find-problems", "Find GC-unsafe places.");
+static clang::FrontendPluginRegistry::Add<Action<ProblemsFinder>> FindProblems(
+    "find-problems", "Find GC-unsafe places.");
 
-static clang::FrontendPluginRegistry::Add<
-  Action<FunctionDeclarationFinder> >
-DumpCallees("dump-callees", "Dump callees for each function.");
+static clang::FrontendPluginRegistry::Add<Action<FunctionDeclarationFinder>>
+    DumpCallees("dump-callees", "Dump callees for each function.");
 
 #undef TRACE
 #undef TRACE_LLVM_TYPE
diff --git a/deps/v8/tools/gcmole/gcmole.py b/deps/v8/tools/gcmole/gcmole.py
index be605d8c559574..21c835a0ecc9aa 100755
--- a/deps/v8/tools/gcmole/gcmole.py
+++ b/deps/v8/tools/gcmole/gcmole.py
@@ -91,7 +91,7 @@ def make_clang_command_line(plugin, plugin_args, options):
   log("Using generated files in {}", options.v8_build_dir / 'gen')
   return ([
       options.clang_bin_dir / "clang++",
-      "-std=c++17",
+      "-std=c++20",
       "-c",
       "-Xclang",
       "-load",
diff --git a/deps/v8/tools/gcmole/test-expectations.txt b/deps/v8/tools/gcmole/test-expectations.txt
index 549fb949f019a3..c09089ac51c580 100644
--- a/deps/v8/tools/gcmole/test-expectations.txt
+++ b/deps/v8/tools/gcmole/test-expectations.txt
@@ -70,153 +70,153 @@ tools/gcmole/gcmole-test.cc:154:22: note: Call might cause unexpected GC.
 tools/gcmole/gcmole-test.cc:140:3: note: GC call here.
   static Handle<Object> StaticCauseGC(Handle<Object> obj, Isolate* isolate) {
   ^
-tools/gcmole/gcmole-test.cc:164:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:164:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:161:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:172:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:172:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:169:3: note: Call might cause unexpected GC.
   Safepoint();
   ^
 tools/gcmole/gcmole-test.cc:19:1: note: GC call here.
 void Safepoint() { LocalHeap::Current()->Safepoint(); }
 ^
-tools/gcmole/gcmole-test.cc:198:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:198:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:195:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:224:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:224:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:221:3: note: Call might cause unexpected GC.
   Safepoint();
   ^
 tools/gcmole/gcmole-test.cc:19:1: note: GC call here.
 void Safepoint() { LocalHeap::Current()->Safepoint(); }
 ^
-tools/gcmole/gcmole-test.cc:235:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:235:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:233:3: note: Call might cause unexpected GC.
   Safepoint();
   ^
 tools/gcmole/gcmole-test.cc:19:1: note: GC call here.
 void Safepoint() { LocalHeap::Current()->Safepoint(); }
 ^
-tools/gcmole/gcmole-test.cc:242:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:242:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:233:3: note: Call might cause unexpected GC.
   Safepoint();
   ^
 tools/gcmole/gcmole-test.cc:19:1: note: GC call here.
 void Safepoint() { LocalHeap::Current()->Safepoint(); }
 ^
-tools/gcmole/gcmole-test.cc:252:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:252:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:250:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:262:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:262:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:260:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:265:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:265:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:260:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:271:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:271:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:269:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:287:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:287:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:285:3: note: Call might cause unexpected GC.
   TestGuardedDeadVarAnalysisNested(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:268:1: note: GC call here.
 void TestGuardedDeadVarAnalysisNested(JSObject raw_obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:295:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:295:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:293:3: note: Call might cause unexpected GC.
   TestGuardedDeadVarAnalysisNested(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:268:1: note: GC call here.
 void TestGuardedDeadVarAnalysisNested(JSObject raw_obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:302:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:302:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:300:3: note: Call might cause unexpected GC.
   TestGuardedDeadVarAnalysisNested(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:268:1: note: GC call here.
 void TestGuardedDeadVarAnalysisNested(JSObject raw_obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:319:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:319:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:317:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:338:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:338:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:334:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:349:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:349:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:345:3: note: Call might cause unexpected GC.
   CauseGCRaw(raw_obj, isolate);
   ^
 tools/gcmole/gcmole-test.cc:27:1: note: GC call here.
 Object CauseGCRaw(Object obj, Isolate* isolate) {
 ^
-tools/gcmole/gcmole-test.cc:359:3: warning: Possibly stale variable due to GCs.
-  raw_obj.Print();
-  ^
+tools/gcmole/gcmole-test.cc:359:9: warning: Possibly stale variable due to GCs.
+  Print(raw_obj);
+        ^
 tools/gcmole/gcmole-test.cc:355:3: note: Call might cause unexpected GC.
   Safepoint();
   ^
diff --git a/deps/v8/tools/gdb-v8-support.py b/deps/v8/tools/gdb-v8-support.py
index 709b6ef361694d..46a1770ef62d14 100644
--- a/deps/v8/tools/gdb-v8-support.py
+++ b/deps/v8/tools/gdb-v8-support.py
@@ -128,7 +128,7 @@ def display_hint(self):
 
 def v8_pretty_printers(val):
   lookup_tag = val.type.tag
-  if lookup_tag == None:
+  if lookup_tag is None:
     return None
   elif lookup_tag == 'v8value':
     return V8ValuePrinter(val)
diff --git a/deps/v8/tools/gdbinit b/deps/v8/tools/gdbinit
index 745e24dcbdf36f..a18577f7da9d9c 100644
--- a/deps/v8/tools/gdbinit
+++ b/deps/v8/tools/gdbinit
@@ -21,14 +21,51 @@ Usage: jh internal_handle
 end
 
 # Print content of v8::Local handle.
-define jlh
-call (void) _v8_internal_Print_Object(*((v8::internal::Object**)($arg0).val_))
-end
-document jlh
-Print content of a v8::Local handle
-Usage: jlh local_handle
+python
+import gdb
+
+class PrintV8LocalCommand(gdb.Command):
+  """Print content of v8::Local handle."""
+
+  PRINT_CMD = "call (void) _v8_internal_Print_Object(*(v8::internal::Address**)({0}))"
+
+  def __init__ (self):
+    super(PrintV8LocalCommand, self).__init__ ("print-v8-local", gdb.COMMAND_DATA)
+
+  @staticmethod
+  def get_address_from_local(value):
+    if gdb.types.get_basic_type(value.type).code != gdb.TYPE_CODE_STRUCT:
+      return None
+    # After https://crrev.com/c/4335544, v8::MaybeLocal contains a local_.
+    if gdb.types.has_field(value.type, "local_"):
+      value = value["local_"]
+    # After https://crrev.com/c/4335544, v8::Local contains a location_.
+    if gdb.types.has_field(value.type, "location_"):
+      return value["location_"].format_string()
+    # Before https://crrev.com/c/4335544, v8::Local contained a val_.
+    if gdb.types.has_field(value.type, "val_"):
+      return value["val_"].format_string()
+    # We don't know how to print this...
+    return None
+
+  def invoke (self, arg, from_tty):
+    argv = gdb.string_to_argv(arg)
+    if len(argv) != 1:
+      raise gdb.GdbError("print-local takes exactly one argument.")
+    value = gdb.parse_and_eval(argv[0])
+    indirect_pointer = self.get_address_from_local(value)
+    if indirect_pointer is not None:
+      gdb.execute(self.PRINT_CMD.format(indirect_pointer), from_tty)
+    else:
+      raise gdb.GdbError("print-local cannot print a value of type {}".format(
+        value.type))
+
+PrintV8LocalCommand()
 end
 
+alias jlh = print-v8-local
+alias jl = print-v8-local
+
 # Print Code objects containing given PC.
 define jco
   if $argc == 0
@@ -42,6 +79,23 @@ Print a v8 Code object from an internal code address
 Usage: jco pc
 end
 
+# Print Code objects assembly code surrounding given PC.
+define jca
+  if $argc == 0
+    call (void) _v8_internal_Print_OnlyCode((void*)($pc), 30)
+  else
+    if $argc == 0
+      call (void) _v8_internal_Print_OnlyCode((void*)($arg0), 30)
+    else
+      call (void) _v8_internal_Print_OnlyCode((void*)($arg0), (size_t)($arg1))
+    end
+  end
+end
+document jco
+Print a v8 Code object from an internal code address
+Usage: jco pc
+end
+
 # Print TransitionTree.
 define jtt
 call (void) _v8_internal_Print_TransitionTree((void*)($arg0))
diff --git a/deps/v8/tools/gen-inlining-tests.py b/deps/v8/tools/gen-inlining-tests.py
index 97323a98700736..6d6c4ed0b71387 100644
--- a/deps/v8/tools/gen-inlining-tests.py
+++ b/deps/v8/tools/gen-inlining-tests.py
@@ -272,7 +272,6 @@ def printtest(flags):
   anyAlternative = any([alternativeFn1, alternativeFn2, alternativeFn3,
       alternativeFn4, alternativeFn5])
   specificAlternative = any([alternativeFn2, alternativeFn3])
-  rareAlternative = not specificAlternative
 
   # If try returns and throws, then don't catchWithLocal, endReturnLocal, or
   # deopt, or do any alternative.
@@ -356,7 +355,7 @@ def printtest(flags):
   resultTo = "local +=" if tryResultToLocal else "return"
   if tryReturns and not (tryThrows and not tryFirstReturns):
     write(  "      {} 4 + {increaseAndReturn15};".format(resultTo, **fragments))
-    if result == None:
+    if result is None:
       counter += 1
       if tryResultToLocal:
         local += 19
@@ -364,19 +363,19 @@ def printtest(flags):
         result = ("return", 19)
   if tryThrows:
     write(  "      {} 4 + {increaseAndThrow42};".format(resultTo, **fragments))
-    if result == None:
+    if result is None:
       counter += 1
       result = ("throw", 42)
   if tryReturns and tryThrows and not tryFirstReturns:
     write(  "      {} 4 + {increaseAndReturn15};".format(resultTo, **fragments))
-    if result == None:
+    if result is None:
       counter += 1
       if tryResultToLocal:
         local += 19
       else:
         result = ("return", 19)
   write(    "      counter++;")
-  if result == None:
+  if result is None:
     counter += 1
 
   if doCatch:
@@ -427,15 +426,15 @@ def printtest(flags):
 
   write(    "    }")
   write(    "    counter++;")
-  if result == None:
+  if result is None:
     counter += 1
   if endReturnLocal:
     write(  "    return 5 + local;")
-    if result == None:
+    if result is None:
       result = ('return', 5 + local)
   write(    "  }")
 
-  if result == None:
+  if result is None:
     write(  "  resetOptAndAssertResultEquals(undefined, f);")
   else:
     tag, value = result
@@ -464,11 +463,11 @@ def rotateshard():
   global FILE, NUM_TESTS_IN_SHARD, SHARD_SIZE
   if MODE != 'shard':
     return
-  if FILE != None and NUM_TESTS_IN_SHARD < SHARD_SIZE:
+  if FILE is not None and NUM_TESTS_IN_SHARD < SHARD_SIZE:
     return
-  if FILE != None:
+  if FILE is not None:
     finishshard()
-    assert FILE == None
+    assert FILE is None
   FILE = open(SHARD_FILENAME_TEMPLATE.format(shard=SHARD_NUM), 'w')
   write_shard_header()
   NUM_TESTS_IN_SHARD = 0
@@ -534,7 +533,6 @@ def write_shard_footer():
 ]
 
 if __name__ == '__main__':
-  global MODE
   if sys.argv[1:] == []:
     MODE = 'stdout'
     print("// Printing all shards together to stdout.")
diff --git a/deps/v8/tools/gen-keywords-gen-h.py b/deps/v8/tools/gen-keywords-gen-h.py
index a61f51aab5c2de..dfd74d331dfede 100755
--- a/deps/v8/tools/gen-keywords-gen-h.py
+++ b/deps/v8/tools/gen-keywords-gen-h.py
@@ -3,33 +3,40 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-import os
+from __future__ import annotations
+
 import sys
 import subprocess
 import re
 import math
+from pathlib import Path
+from typing import List, Union
 
-INPUT_PATH = "src/parsing/keywords.txt"
-OUTPUT_PATH = "src/parsing/keywords-gen.h"
+INPUT_PATH = Path("src/parsing/keywords.txt")
+OUTPUT_PATH = Path("src/parsing/keywords-gen.h")
 
 # TODO(leszeks): Trimming seems to regress performance, investigate.
-TRIM_CHAR_TABLE = False
+TRIM_CHAR_TABLE: bool = False
 
 
 def next_power_of_2(x):
   return 1 if x == 0 else 2**int(math.ceil(math.log(x, 2)))
 
 
-def call_with_input(cmd, input_string=""):
+def call_with_input(cmd: List[Union[str, Path]], input_string: str = "") -> str:
   p = subprocess.Popen(cmd, stdin=subprocess.PIPE, stdout=subprocess.PIPE)
-  stdout, _ = p.communicate(input_string)
+  stdout, _ = p.communicate(input_string.encode())
   retcode = p.wait()
   if retcode != 0:
     raise subprocess.CalledProcessError(retcode, cmd)
-  return stdout
+  return stdout.decode()
 
 
-def checked_sub(pattern, sub, out, count=1, flags=0):
+def checked_sub(pattern: Union[str, re.Pattern[str]],
+                sub: str,
+                out: str,
+                count: int = 1,
+                flags: int = 0) -> str:
   out, n = re.subn(pattern, sub, out, flags=flags)
   if n != count:
     raise Exception("Didn't get exactly %d replacement(s) for pattern: %s" %
@@ -37,17 +44,17 @@ def checked_sub(pattern, sub, out, count=1, flags=0):
   return out
 
 
-def change_sizet_to_int(out):
+def change_sizet_to_int(out: str) -> str:
   # Literal buffer lengths are given as ints, not size_t
   return checked_sub(r'\bsize_t\b', 'int', out, count=4)
 
 
-def drop_line_directives(out):
+def drop_line_directives(out: str) -> str:
   # #line causes gcov issue, so drop it
   return re.sub(r'^#\s*line .*$\n', '', out, flags=re.MULTILINE)
 
 
-def trim_and_dcheck_char_table(out):
+def trim_and_dcheck_char_table(out: str) -> str:
   # Potential keyword strings are known to be lowercase ascii, so chop off the
   # rest of the table and mask out the char
 
@@ -80,7 +87,7 @@ def trim_and_dcheck_char_table(out):
   return out
 
 
-def use_isinrange(out):
+def use_isinrange(out: str) -> str:
   # Our IsInRange method is more efficient than checking for min/max length
   return checked_sub(r'if \(len <= MAX_WORD_LENGTH && len >= MIN_WORD_LENGTH\)',
                      r'if (base::IsInRange(len, MIN_WORD_LENGTH, '
@@ -88,7 +95,7 @@ def use_isinrange(out):
                      out)
 
 
-def pad_tables(out):
+def pad_tables(out: str) -> str:
   # We don't want to compare against the max hash value, so pad the tables up
   # to a power of two and mask the hash.
 
@@ -145,7 +152,7 @@ def pad_tables(out):
   return out
 
 
-def return_token(out):
+def return_token(out: str) -> str:
   # We want to return the actual token rather than the table entry.
 
   # Change the return type of the function. Make it inline too.
@@ -165,7 +172,7 @@ def return_token(out):
   return out
 
 
-def memcmp_to_while(out):
+def memcmp_to_while(out: str) -> str:
   # It's faster to loop over the keyword with a while loop than calling memcmp.
   # Careful, this replacement is quite flaky, because otherwise the regex is
   # unreadable.
@@ -207,7 +214,7 @@ def wrap_namespace(out):
 """ % (out)
 
 
-def trim_character_set_warning(out):
+def trim_character_set_warning(out: str) -> str:
   # gperf generates an error message that is too large, trim it
 
   return out.replace(
@@ -218,10 +225,12 @@ def trim_character_set_warning(out):
 
 def main():
   try:
-    script_dir = os.path.dirname(sys.argv[0])
-    root_dir = os.path.join(script_dir, '..')
+    script_dir = Path(sys.argv[0]).parent
+    root_dir = script_dir.parent
 
-    out = subprocess.check_output(["gperf", "-m100", INPUT_PATH], cwd=root_dir)
+    out: str = subprocess.check_output(["gperf", "-m100", INPUT_PATH],
+                                       cwd=root_dir,
+                                       encoding="UTF-8")
 
     # And now some munging of the generated file.
     out = change_sizet_to_int(out)
@@ -235,11 +244,10 @@ def main():
     out = trim_character_set_warning(out)
 
     # Final formatting.
-    clang_format_path = os.path.join(root_dir,
-                                     'third_party/depot_tools/clang-format')
+    clang_format_path = root_dir / 'third_party/depot_tools/clang-format'
     out = call_with_input([clang_format_path], out)
 
-    with open(os.path.join(root_dir, OUTPUT_PATH), 'w') as f:
+    with (root_dir / OUTPUT_PATH).open('w') as f:
       f.write(out)
 
     return 0
diff --git a/deps/v8/tools/gen-postmortem-metadata.py b/deps/v8/tools/gen-postmortem-metadata.py
index 4d171267a9658c..1cae1cbaf1b7a7 100644
--- a/deps/v8/tools/gen-postmortem-metadata.py
+++ b/deps/v8/tools/gen-postmortem-metadata.py
@@ -78,6 +78,14 @@
         'name': 'LastContextType',
         'value': 'LAST_CONTEXT_TYPE'
     },
+    {
+        'name': 'FirstJSFunctionType',
+        'value': 'FIRST_JS_FUNCTION_TYPE'
+    },
+    {
+        'name': 'LastJSFunctionType',
+        'value': 'LAST_JS_FUNCTION_TYPE'
+    },
     {
         'name': 'IsNotStringMask',
         'value': 'kIsNotStringMask'
@@ -210,10 +218,6 @@
         'name': 'OddballTrue',
         'value': 'Oddball::kTrue'
     },
-    {
-        'name': 'OddballTheHole',
-        'value': 'Oddball::kTheHole'
-    },
     {
         'name': 'OddballNull',
         'value': 'Oddball::kNull'
@@ -800,37 +804,17 @@ def load_objects_from_file(objfilename, checktypes):
     #
     #       EXTERNAL_ONE_BYTE_STRING_TYPE => ExternalOneByteString
     #
-    # However, either the representation or encoding can be omitted
-    # from the type name, in which case "Seq" and "TwoByte" are
-    # assumed, as in:
-    #
-    #       STRING_TYPE => SeqTwoByteString
-    #
-    # Additionally, sometimes the type name has more information
+    # However, sometimes the type name has more information
     # than the class, as in:
     #
     #       CONS_ONE_BYTE_STRING_TYPE => ConsString
     #
     # To figure this out dynamically, we first check for a
-    # representation and encoding and add them if they're not
-    # present.  If that doesn't yield a valid class name, then we
-    # strip out the representation.
+    # representation and encoding.
+    # If that doesn't yield a valid class name, we strip out the
+    # representation.
     #
     if (cctype.endswith('String')):
-      if (cctype.find('Cons') == -1 and
-          cctype.find('External') == -1 and
-          cctype.find('Sliced') == -1):
-        if (cctype.find('OneByte') != -1):
-          cctype = re.sub('OneByteString$',
-              'SeqOneByteString', cctype);
-        else:
-          cctype = re.sub('String$',
-              'SeqString', cctype);
-
-      if (cctype.find('OneByte') == -1):
-        cctype = re.sub('String$', 'TwoByteString',
-            cctype);
-
       if (not (cctype in klasses)):
         cctype = re.sub('OneByte', '', cctype);
         cctype = re.sub('TwoByte', '', cctype);
@@ -858,8 +842,6 @@ def parse_field(call):
   rest = call[idx + 1: len(call) - 1];
   args = re.split('\s*,\s*', rest);
 
-  consts = [];
-
   klass = args[0];
   field = args[1];
   dtype = None
@@ -993,10 +975,12 @@ def emit_config():
   consts = [];
   for klassname in sorted(klasses):
     pklass = klasses[klassname]['parent'];
+    if (klassname == pklass):
+      continue
     bklass = get_base_class(klassname);
     if (bklass != 'Object'):
       continue;
-    if (pklass == None):
+    if (pklass is None):
       continue;
 
     consts.append({
diff --git a/deps/v8/tools/grokdump.py b/deps/v8/tools/grokdump.py
index ff7a15c22c3851..cdf1038f328443 100755
--- a/deps/v8/tools/grokdump.py
+++ b/deps/v8/tools/grokdump.py
@@ -47,9 +47,15 @@
 import sys
 import types
 import urllib.parse
-import v8heapconst
 import webbrowser
 
+try:
+  import v8heapconst
+except ImportError:
+  print("Importing v8heapconst.py failed. "
+        "Run `tools/dev/gm.py mkgrokdump` to regenerate it.")
+  sys.exit(1)
+
 PORT_NUMBER = 8081
 
 
@@ -777,7 +783,7 @@ def IsValidExceptionStackAddress(self, address):
     return self.IsExceptionStackAddress(address)
 
   def IsModuleAddress(self, address):
-    return self.GetModuleForAddress(address) != None
+    return self.GetModuleForAddress(address) is not None
 
   def GetModuleForAddress(self, address):
     for module in self.module_list.modules:
@@ -1071,7 +1077,6 @@ def ReadMinidumpString(self, rva):
   #
   def _LoadSymbolsFrom(self, symfile, baseaddr):
     print("Loading symbols from %s" % (symfile))
-    funcs = []
     with open(symfile) as f:
       for line in f:
         result = re.match(
@@ -1611,7 +1616,7 @@ def Print(self, p):
     if self.shared.script.Is(Script) and self.shared.script.name.Is(String):
       p.Print("script name: %s" % self.shared.script.name)
     p.Print("source:")
-    p.PrintLines(self._GetSource().split("\n"))
+    p.Print(source)
     p.Print("code:")
     self.code.Print(p)
     if self.code != self.shared.code:
@@ -2007,7 +2012,7 @@ def get_style_class(self, address):
 
   def get_style_class_string(self, address):
     style = self.get_style_class(address)
-    if style != None:
+    if style is not None:
       return " class=%s " % style
     else:
       return ""
@@ -3042,7 +3047,7 @@ def output_words(self, f, start_address, end_address, highlight_address, desc,
       self.td_from_address(f, maybe_uncompressed_address)
       f.write(":&nbsp;%s&nbsp;</td>" % straddress)
       f.write("<td>")
-      if maybe_uncompressed_address != None:
+      if maybe_uncompressed_address is not None:
         self.output_comment_box(f, "sv-" + self.reader.FormatIntPtr(slot),
                                 maybe_uncompressed_address)
       f.write("</td>")
diff --git a/deps/v8/tools/heap-snapshot-processor.py b/deps/v8/tools/heap-snapshot-processor.py
new file mode 100644
index 00000000000000..ec5c8bd4002f04
--- /dev/null
+++ b/deps/v8/tools/heap-snapshot-processor.py
@@ -0,0 +1,131 @@
+#!/usr/bin/python3
+# Copyright 2023 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+import json
+import sys
+
+
+# Implement this to process the data.
+def process_nodes(nodes):
+  pass
+
+
+class Node:
+
+  def __init__(self, id, type, name):
+    self.id = id
+
+    assert isinstance(type, str)
+    self.type = type
+
+    assert isinstance(name, str)
+    self.name = name
+
+    self.edges_from = []
+    self.edges_to = []
+
+
+class Edge:
+
+  def __init__(self, type, from_node, name, to_node):
+    assert isinstance(type, str)
+    self.type = type
+
+    assert isinstance(from_node, Node)
+    self.from_node = from_node
+
+    assert isinstance(name, str)
+    self.name = name
+
+    assert isinstance(to_node, Node)
+    self.to_node = to_node
+
+
+def main():
+  if len(sys.argv) != 2:
+    print("Usage: python3 heap-snapshot-processor.py snapshot.heapsnapshot")
+    exit(1)
+
+  f = open(sys.argv[1])
+  data = json.load(f)
+
+  # Documentation of the format (caveat: documentation for name_or_index is
+  # wrong):
+  # https://learn.microsoft.com/en-us/microsoft-edge/devtools-guide-chromium/memory-problems/heap-snapshot-schema
+  snapshot = data['snapshot']
+  meta = snapshot['meta']
+
+  node_fields = meta['node_fields']
+  node_field_count = len(node_fields)
+  node_type_ix = node_fields.index('type')
+  node_name_ix = node_fields.index('name')
+  node_id_ix = node_fields.index('id')
+  node_edge_count_ix = node_fields.index('edge_count')
+
+  node_types = meta['node_types']
+  node_type_strings = node_types[node_type_ix]
+
+  edge_fields = meta['edge_fields']
+  edge_field_count = len(edge_fields)
+  edge_type_ix = edge_fields.index('type')
+  edge_name_or_index_ix = edge_fields.index('name_or_index')
+  edge_to_node_ix = edge_fields.index('to_node')
+
+  edge_types = meta['edge_types']
+  edge_type_strings = edge_types[edge_type_ix]
+
+  nodes = data['nodes']
+  edges = data['edges']
+  strings = data['strings']
+
+  node_objects = dict()
+
+  for node_ix in range(0, len(nodes), node_field_count):
+    node_data = nodes[node_ix:(node_ix + node_field_count)]
+    node_type = node_type_strings[node_data[node_type_ix]]
+    node_name = strings[node_data[node_name_ix]]
+    node_id = node_data[node_id_ix]
+    node = Node(node_id, node_type, node_name)
+    node_objects[node_id] = node
+
+  edge_ix = 0
+  for node_ix in range(0, len(nodes), node_field_count):
+    node_data = nodes[node_ix:(node_ix + node_field_count)]
+    edge_count = node_data[node_edge_count_ix]
+    from_node_id = node_data[node_id_ix]
+    from_node = node_objects[from_node_id]
+
+    for e in range(edge_count):
+      edge_data = edges[edge_ix:(edge_ix + edge_field_count)]
+      edge_type = edge_type_strings[edge_data[edge_type_ix]]
+
+      # The interpretation of edge_name_or_index depends on the edge type.
+      edge_name_or_index = edge_data[edge_name_or_index_ix]
+      if edge_type == 'element' or edge_type == 'hidden':
+        edge_name = str(edge_name_or_index)
+      elif isinstance(edge_name_or_index, str):
+        edge_name = edge_name_or_index
+      else:
+        edge_name = strings[edge_name_or_index]
+
+      # "The index within the nodes array that this edge is connected to."
+      to_node_ix = edge_data[edge_to_node_ix]
+      to_node_data = nodes[to_node_ix:(to_node_ix + node_field_count)]
+      to_node_id = to_node_data[node_id_ix]
+
+      to_node = node_objects[to_node_id]
+
+      edge = Edge(edge_type, from_node, edge_name, to_node)
+
+      from_node.edges_from.append(edge)
+      to_node.edges_to.append(edge)
+
+      edge_ix += edge_field_count
+
+  process_nodes(node_objects)
+
+
+if __name__ == '__main__':
+  main()
diff --git a/deps/v8/tools/heap-stats/categories.js b/deps/v8/tools/heap-stats/categories.js
index 8a04078b196e91..8110085191f660 100644
--- a/deps/v8/tools/heap-stats/categories.js
+++ b/deps/v8/tools/heap-stats/categories.js
@@ -7,13 +7,13 @@ export const CATEGORIES = new Map([
   [
     'user', new Set([
       'CONS_ONE_BYTE_STRING_TYPE',
-      'CONS_STRING_TYPE',
+      'CONS_TWO_BYTE_STRING_TYPE',
       'DESCRIPTOR_ARRAY_TYPE',
       'ELEMENTS_TYPE',
-      'EXTERNAL_INTERNALIZED_STRING_TYPE',
-      'EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE',
+      'EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE',
+      'EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE',
       'EXTERNAL_ONE_BYTE_STRING_TYPE',
-      'EXTERNAL_STRING_TYPE',
+      'EXTERNAL_TWO_BYTE_STRING_TYPE',
       'EXTERNAL_STRING_WITH_ONE_BYTE_DATA_TYPE',
       'FIXED_BIGINT64_ARRAY_TYPE',
       'FIXED_BIGUINT64_ARRAY_TYPE',
@@ -31,7 +31,7 @@ export const CATEGORIES = new Map([
       'GLOBAL_ELEMENTS_TYPE',
       'GLOBAL_PROPERTIES_TYPE',
       'HEAP_NUMBER_TYPE',
-      'INTERNALIZED_STRING_TYPE',
+      'INTERNALIZED_TWO_BYTE_STRING_TYPE',
       'JS_ARGUMENTS_OBJECT_TYPE',
       'JS_ARRAY_BUFFER_TYPE',
       'JS_ARRAY_ITERATOR_TYPE',
@@ -83,22 +83,22 @@ export const CATEGORIES = new Map([
       'HEAP_NUMBER_TYPE',
       'NATIVE_CONTEXT_TYPE',
       'OBJECT_PROPERTY_DICTIONARY_TYPE',
-      'ONE_BYTE_INTERNALIZED_STRING_TYPE',
-      'ONE_BYTE_STRING_TYPE',
+      'INTERNALIZED_ONE_BYTE_STRING_TYPE',
+      'SEQ_ONE_BYTE_STRING_TYPE',
       'OTHER_CONTEXT_TYPE',
       'PROPERTY_ARRAY_TYPE',
       'SLICED_ONE_BYTE_STRING_TYPE',
-      'SLICED_STRING_TYPE',
+      'SLICED_TWO_BYTE_STRING_TYPE',
       'STRING_EXTERNAL_RESOURCE_ONE_BYTE_TYPE',
       'STRING_EXTERNAL_RESOURCE_TWO_BYTE_TYPE',
-      'STRING_TYPE',
+      'SEQ_TWO_BYTE_STRING_TYPE',
       'SYMBOL_TYPE',
       'THIN_ONE_BYTE_STRING_TYPE',
-      'THIN_STRING_TYPE',
-      'UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE',
-      'UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE',
+      'THIN_TWO_BYTE_STRING_TYPE',
+      'UNCACHED_EXTERNAL_INTERNALIZED_TWO_BYTE_STRING_TYPE',
+      'UNCACHED_EXTERNAL_INTERNALIZED_ONE_BYTE_STRING_TYPE',
       'UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE',
-      'UNCACHED_EXTERNAL_STRING_TYPE',
+      'UNCACHED_EXTERNAL_TWO_BYTE_STRING_TYPE',
       'WASM_INSTANCE_OBJECT_TYPE',
       'WASM_MEMORY_OBJECT_TYPE',
       'WASM_MODULE_OBJECT_TYPE',
diff --git a/deps/v8/tools/ic-processor b/deps/v8/tools/ic-processor
index 7b886b822084e3..a0115355bda676 100755
--- a/deps/v8/tools/ic-processor
+++ b/deps/v8/tools/ic-processor
@@ -12,18 +12,29 @@ done
 tools_path=`cd $(dirname "$0");pwd`
 if [ ! "$D8_PATH" ]; then
   d8_public=`which d8`
-  if [ -x "$d8_public" ]; then D8_PATH=$(dirname "$d8_public"); fi
+  if [ -x "$d8_public" ]; then
+    D8_PATH=$(dirname "$d8_public");
+  fi
+fi
+if [ -z ${D8_PATH##*/d8} ]; then
+  d8_exec=$D8_PATH
+else
+  d8_exec=$D8_PATH/d8
 fi
-[ -n "$D8_PATH" ] || D8_PATH=$tools_path/..
-d8_exec=$D8_PATH/d8
 
 if [ ! -x "$d8_exec" ]; then
-  D8_PATH=`pwd`/out/native
-  d8_exec=$D8_PATH/d8
+  for platform in x64 arm64 ia32; do
+    for release in release optdebug debug; do
+      if [ -x "$d8_exec" ]; then
+        continue
+      fi
+      d8_exec="${tools_path}/../out/${platform}.${release}/d8";
+    done
+  done
 fi
 
 if [ ! -x "$d8_exec" ]; then
-  d8_exec=`grep -m 1 -o '".*/d8"' $log_file | sed 's/"//g'`
+  d8_exec=`grep -m 1 -o '".*/d8"' $log_file | sed 's/"//g'`;
 fi
 
 if [ ! -x "$d8_exec" ]; then
diff --git a/deps/v8/tools/ic-processor-driver.mjs b/deps/v8/tools/ic-processor-driver.mjs
index dffa11cae5287c..328748384ad23e 100644
--- a/deps/v8/tools/ic-processor-driver.mjs
+++ b/deps/v8/tools/ic-processor-driver.mjs
@@ -8,8 +8,10 @@ import { BaseArgumentsProcessor} from "./arguments.mjs";
 class ArgumentsProcessor extends BaseArgumentsProcessor {
   getArgsDispatch() {
     return {
-      '--range': ['range', 'auto,auto',
-          'Specify the range limit as [start],[end]'],
+      '--range': [
+          'range', 'auto,auto',
+          'Specify the range limit as [start],[end]'
+        ],
     };
   }
   getDefaultResults() {
diff --git a/deps/v8/tools/linux-tick-processor b/deps/v8/tools/linux-tick-processor
index a2ae2b5441317c..e250d7a4c65b43 100755
--- a/deps/v8/tools/linux-tick-processor
+++ b/deps/v8/tools/linux-tick-processor
@@ -12,24 +12,35 @@ done
 tools_path=`cd $(dirname "$0");pwd`
 if [ ! "$D8_PATH" ]; then
   d8_public=`which d8`
-  if [ -x "$d8_public" ]; then D8_PATH=$(dirname "$d8_public"); fi
+  if [ -x "$d8_public" ]; then
+    D8_PATH=$(dirname "$d8_public");
+  fi
+fi
+if [ -z ${D8_PATH##*/d8} ]; then
+  d8_exec=$D8_PATH
+else
+  d8_exec=$D8_PATH/d8
 fi
-[ -n "$D8_PATH" ] || D8_PATH=$tools_path/..
-d8_exec=$D8_PATH/d8
 
 if [ ! -x "$d8_exec" ]; then
-  D8_PATH=`pwd`/out/native
-  d8_exec=$D8_PATH/d8
+  for platform in x64 arm64 ia32; do
+    for release in release optdebug debug; do
+      if [ -x "$d8_exec" ]; then
+        continue
+      fi
+      d8_exec="${tools_path}/../out/${platform}.${release}/d8";
+    done
+  done
 fi
 
 if [ ! -x "$d8_exec" ]; then
-  d8_exec=`grep -m 1 -o '".*/d8"' $log_file | sed 's/"//g'`
+  d8_exec=`grep -m 1 -o '".*/d8"' $log_file | sed 's/"//g'`;
 fi
 
 if [ ! -x "$d8_exec" ]; then
-  echo "d8 shell not found in $D8_PATH" >&2
-  echo "Please provide path to d8 as env var in D8_PATH" >&2
-  exit 1
+  echo "d8 shell not found in $D8_PATH" >&2;
+  echo "Please provide path to d8 as env var in D8_PATH" >&2;
+  exit 1;
 fi
 
 # nm spits out 'no symbols found' messages to stderr.
diff --git a/deps/v8/tools/lldb_commands.py b/deps/v8/tools/lldb_commands.py
index 3bbbf3021778a9..a65040b81c5f2b 100644
--- a/deps/v8/tools/lldb_commands.py
+++ b/deps/v8/tools/lldb_commands.py
@@ -22,53 +22,114 @@ def current_thread(debugger):
 def current_frame(debugger):
   return current_thread(debugger).GetSelectedFrame()
 
-def no_arg_cmd(debugger, cmd):
+
+def no_arg_cmd(debugger, cmd, print_error=True):
   cast_to_void_expr = '(void) {}'.format(cmd)
   evaluate_result = current_frame(debugger).EvaluateExpression(cast_to_void_expr)
   # When a void function is called the return value type is 0x1001 which
   # is specified in http://tiny.cc/bigskz. This does not indicate
   # an error so we check for that value below.
   kNoResult = 0x1001
-  error = evaluate_result.GetError()
-  if error.fail and error.value != kNoResult:
+  result = evaluate_result.GetError()
+  is_success = not result.fail or result.value == kNoResult
+  if not is_success:
+    if print_error:
       print("Failed to evaluate command {} :".format(cmd))
-      print(error.description)
+      print(result.description)
   else:
     print("")
+  return (is_success, result, cmd)
+
 
-def ptr_arg_cmd(debugger, name, param, cmd):
+def ptr_arg_cmd(debugger, name, param, cmd, print_error=True):
   if not param:
     print("'{}' requires an argument".format(name))
-    return
+    return (False, None, "")
   param = '(void*)({})'.format(param)
-  no_arg_cmd(debugger, cmd.format(param))
+  return no_arg_cmd(debugger, cmd.format(param), print_error)
+
+
+V8_LLDB_COMMANDS = []
+
+
+def lldbCommand(fn):
+  V8_LLDB_COMMANDS.append(fn.__name__)
+  return fn
 
 #####################
 # lldb commands.    #
 #####################
+
+
+@lldbCommand
 def job(debugger, param, *args):
   """Print a v8 heap object"""
   ptr_arg_cmd(debugger, 'job', param, "_v8_internal_Print_Object({})")
 
+
+@lldbCommand
+def jh(debugger, param, *args):
+  """Print v8::internal::Handle value"""
+  V8_PRINT_CMD = "_v8_internal_Print_Object(*(v8::internal::Object**)({}.%s))"
+  ptr_arg_cmd(debugger, 'jh', param, V8_PRINT_CMD % "location_")
+
+
+def get_address_from_local(value):
+  # After https://crrev.com/c/4335544, v8::MaybeLocal contains a local_.
+  field = value.GetValueForExpressionPath(".local_")
+  if field.IsValid():
+    value = field
+  # After https://crrev.com/c/4335544, v8::Local contains a location_.
+  field = value.GetValueForExpressionPath(".location_")
+  if field.IsValid():
+    return field.value
+  # Before https://crrev.com/c/4335544, v8::Local contained a val_.
+  field = value.GetValueForExpressionPath(".val_")
+  if field.IsValid():
+    return field.value
+  # We don't know how to print this...
+  return None
+
+
+@lldbCommand
 def jlh(debugger, param, *args):
   """Print v8::Local handle value"""
-  ptr_arg_cmd(debugger, 'jlh', param,
-              "_v8_internal_Print_Object(*(v8::internal::Object**)({}.val_))")
+  V8_PRINT_CMD = "_v8_internal_Print_Object(*(v8::internal::Address**)({0}))"
+  value = current_frame(debugger).EvaluateExpression(param)
+  indirect_pointer = get_address_from_local(value)
+  if indirect_pointer is not None:
+    ptr_arg_cmd(debugger, 'jlh', param, V8_PRINT_CMD.format(indirect_pointer))
+  else:
+    print("Failed to print value of type {}".format(value.type.name))
+
+
+@lldbCommand
+def jl(debugger, param, *args):
+  """Print v8::Local handle value"""
+  return jlh(debugger, param, *args)
 
+
+@lldbCommand
 def jco(debugger, param, *args):
   """Print the code object at the given pc (default: current pc)"""
   if not param:
     param = str(current_frame(debugger).FindRegister("pc").value)
   ptr_arg_cmd(debugger, 'jco', param, "_v8_internal_Print_Code({})")
 
+
+@lldbCommand
 def jtt(debugger, param, *args):
   """Print the transition tree of a v8 Map"""
   ptr_arg_cmd(debugger, 'jtt', param, "_v8_internal_Print_TransitionTree({})")
 
+
+@lldbCommand
 def jst(debugger, *args):
   """Print the current JavaScript stack trace"""
   no_arg_cmd(debugger, "_v8_internal_Print_StackTrace()")
 
+
+@lldbCommand
 def jss(debugger, *args):
   """Skip the jitted stack on x64 to where we entered JS last"""
   frame = current_frame(debugger)
@@ -83,6 +144,8 @@ def jss(debugger, *args):
   rsp = js_entry_sp + 2 *sizeof_void
   pc.value = js_entry_sp + sizeof_void
 
+
+@lldbCommand
 def bta(debugger, *args):
   """Print stack trace with assertion scopes"""
   func_name_re = re.compile("([^(<]+)(?:\(.+\))?")
@@ -129,6 +192,6 @@ def setup_source_map_for_relative_paths(debugger):
 def __lldb_init_module(debugger, dict):
   setup_source_map_for_relative_paths(debugger)
   debugger.HandleCommand('settings set target.x86-disassembly-flavor intel')
-  for cmd in ('job', 'jlh', 'jco', 'jld', 'jtt', 'jst', 'jss', 'bta'):
+  for cmd in V8_LLDB_COMMANDS:
     debugger.HandleCommand(
       'command script add -f lldb_commands.{} {}'.format(cmd, cmd))
diff --git a/deps/v8/tools/mb/mb.py b/deps/v8/tools/mb/mb.py
index f42b52bedb76ff..0761e878bc66c0 100755
--- a/deps/v8/tools/mb/mb.py
+++ b/deps/v8/tools/mb/mb.py
@@ -38,8 +38,6 @@
 except ImportError:
   from urllib2 import urlopen
 
-from collections import OrderedDict
-
 CHROMIUM_SRC_DIR = os.path.dirname(os.path.dirname(os.path.dirname(
     os.path.abspath(__file__))))
 sys.path = [os.path.join(CHROMIUM_SRC_DIR, 'build')] + sys.path
diff --git a/deps/v8/tools/parse-processor b/deps/v8/tools/parse-processor
index b601dda9e2f505..01094aa7936734 100755
--- a/deps/v8/tools/parse-processor
+++ b/deps/v8/tools/parse-processor
@@ -12,18 +12,29 @@ done
 tools_path=`cd $(dirname "$0");pwd`
 if [ ! "$D8_PATH" ]; then
   d8_public=`which d8`
-  if [ -x "$d8_public" ]; then D8_PATH=$(dirname "$d8_public"); fi
+  if [ -x "$d8_public" ]; then
+    D8_PATH=$(dirname "$d8_public");
+  fi
+fi
+if [ -z ${D8_PATH##*/d8} ]; then
+  d8_exec=$D8_PATH
+else
+  d8_exec=$D8_PATH/d8
 fi
-[ -n "$D8_PATH" ] || D8_PATH=$tools_path/..
-d8_exec=$D8_PATH/d8
 
 if [ ! -x "$d8_exec" ]; then
-  D8_PATH=`pwd`/out.gn/optdebug
-  d8_exec=$D8_PATH/d8
+  for platform in x64 arm64 ia32; do
+    for release in release optdebug debug; do
+      if [ -x "$d8_exec" ]; then
+        continue
+      fi
+      d8_exec="${tools_path}/../out/${platform}.${release}/d8";
+    done
+  done
 fi
 
 if [ ! -x "$d8_exec" ]; then
-  d8_exec=`grep -m 1 -o '".*/d8"' $log_file | sed 's/"//g'`
+  d8_exec=`grep -m 1 -o '".*/d8"' $log_file | sed 's/"//g'`;
 fi
 
 if [ ! -x "$d8_exec" ]; then
diff --git a/deps/v8/tools/perf-compare.py b/deps/v8/tools/perf-compare.py
index 31f91df805c374..fba5955882df4c 100755
--- a/deps/v8/tools/perf-compare.py
+++ b/deps/v8/tools/perf-compare.py
@@ -19,9 +19,7 @@
 import math
 from argparse import ArgumentParser
 import os
-import shutil
 import sys
-import tempfile
 
 PERCENT_CONSIDERED_SIGNIFICANT = 0.5
 PROBABILITY_CONSIDERED_SIGNIFICANT = 0.02
@@ -174,7 +172,7 @@ def name(self):
 
   def getBenchmark(self, benchmark_name):
     benchmark_object = self.benchmarks_.get(benchmark_name)
-    if benchmark_object == None:
+    if benchmark_object is None:
       benchmark_object = Benchmark(benchmark_name)
       self.benchmarks_[benchmark_name] = benchmark_object
     return benchmark_object
@@ -191,7 +189,6 @@ def Print(self, str_data):
 
   def FlushOutput(self):
     string_data = "\n".join(self.print_output_)
-    print_output = []
     if self.output_file_:
       # create a file
       with open(self.output_file_, "w") as text_file:
@@ -336,7 +333,7 @@ def StartSuite(self, suite_name, run_names):
     main_run = None
     for run_name in run_names:
       self.Print("  <th>%s</th>" % run_name)
-      if main_run == None:
+      if main_run is None:
         main_run = run_name
       else:
         self.Print("  <th>%</th>")
@@ -358,14 +355,14 @@ def FinishBenchmark(self):
 
 
   def PrintResult(self, run):
-    if run == None:
+    if run is None:
       self.PrintEmptyCell()
       return
     self.Print("    <td>%3.1f</td>" % run.result())
 
 
   def PrintComparison(self, run, main_run):
-    if run == None or main_run == None:
+    if run is None or main_run is None:
       self.PrintEmptyCell()
       return
     diff = run.Compare(main_run)
@@ -428,7 +425,7 @@ def Render(args):
         benchmark_name = "/".join(trace["graphs"][1:])
 
         benchmark_suite_object = benchmark_suites.get(suite_name)
-        if benchmark_suite_object == None:
+        if benchmark_suite_object is None:
           benchmark_suite_object = BenchmarkSuite(suite_name)
           benchmark_suites[suite_name] = benchmark_suite_object
 
@@ -457,7 +454,7 @@ def Render(args):
       for run_name in run_names:
         result = benchmark_object.getResult(run_name)
         renderer.PrintResult(result)
-        if main_run == None:
+        if main_run is None:
           main_run = run_name
           main_result = result
         else:
diff --git a/deps/v8/tools/profile.mjs b/deps/v8/tools/profile.mjs
index 5ca36b80d1a4ac..f7ba38beb82283 100644
--- a/deps/v8/tools/profile.mjs
+++ b/deps/v8/tools/profile.mjs
@@ -275,16 +275,20 @@ class SourceInfo {
 
   setSourcePositionInfo(
         script, startPos, endPos, sourcePositionTableData, inliningPositions,
-        inlinedFunctions) {
+        inlinedSFIs) {
     this.script = script;
     this.start = startPos;
     this.end = endPos;
     this.positions = sourcePositionTableData;
     this.inlined = inliningPositions;
-    this.fns = inlinedFunctions;
+    this.fns = inlinedSFIs;
     this.sourcePositionTable = new SourcePositionTable(sourcePositionTableData);
   }
 
+  get sfis() {
+    return this.fns;
+  }
+
   setDisassemble(code) {
     this.disassemble = code;
   }
@@ -509,23 +513,25 @@ export class Profile {
    * @param {string} name Code entry name.
    * @param {number} start Starting address.
    * @param {number} size Code entry size.
-   * @param {number} funcAddr Shared function object address.
+   * @param {number} sfiAddr Shared function object address.
    * @param {Profile.CodeState} state Optimization state.
    */
-  addFuncCode(type, name, timestamp, start, size, funcAddr, state) {
+  addFuncCode(type, name, timestamp, start, size, sfiAddr, state) {
     // As code and functions are in the same address space,
     // it is safe to put them in a single code map.
-    let func = this.codeMap_.findDynamicEntryByStartAddress(funcAddr);
-    if (func === null) {
-      func = new FunctionEntry(name, this.useBigInt);
-      this.codeMap_.addCode(funcAddr, func);
-    } else if (func.name !== name) {
-      // Function object has been overwritten with a new one.
-      func.name = name;
+    let sfi = this.codeMap_.findDynamicEntryByStartAddress(sfiAddr);
+    // Overwrite any old (unused) code objects that overlap with the new SFI.
+    const new_sfi_old_code = !(sfi instanceof SharedFunctionInfoEntry)
+    if (sfi === null || new_sfi_old_code) {
+      sfi = new SharedFunctionInfoEntry(name, this.useBigInt);
+      this.codeMap_.addCode(sfiAddr, sfi);
+    } else if (sfi.name !== name) {
+      // SFI object has been overwritten with a new one.
+      sfi.name = name;
     }
     let entry = this.codeMap_.findDynamicEntryByStartAddress(start);
     if (entry !== null) {
-      if (entry.size === size && entry.func === func) {
+      if (entry.size === size && entry.sfi === sfi) {
         // Entry state has changed.
         entry.state = state;
       } else {
@@ -534,7 +540,7 @@ export class Profile {
       }
     }
     if (entry === null) {
-      entry = new DynamicFuncCodeEntry(size, type, func, state);
+      entry = new DynamicFuncCodeEntry(size, type, sfi, state);
       this.codeMap_.addCode(start, entry);
     }
     return entry;
@@ -575,31 +581,31 @@ export class Profile {
    * Adds source positions for given code.
    */
   addSourcePositions(start, scriptId, startPos, endPos, sourcePositionTable,
-        inliningPositions, inlinedFunctions) {
+        inliningPositions, inlinedSFIs) {
     const script = this.getOrCreateScript(scriptId);
     const entry = this.codeMap_.findDynamicEntryByStartAddress(start);
     if (entry === null) return;
-    // Resolve the inlined functions list.
-    if (inlinedFunctions.length > 0) {
-      inlinedFunctions = inlinedFunctions.substring(1).split("S");
-      for (let i = 0; i < inlinedFunctions.length; i++) {
-        const funcAddr = parseInt(inlinedFunctions[i]);
-        const func = this.codeMap_.findDynamicEntryByStartAddress(funcAddr);
-        if (func === null || func.funcId === undefined) {
+    // Resolve the inlined SharedFunctionInfo list.
+    if (inlinedSFIs.length > 0) {
+      inlinedSFIs = inlinedSFIs.substring(1).split("S");
+      for (let i = 0; i < inlinedSFIs.length; i++) {
+        const sfiAddr = parseInt(inlinedSFIs[i]);
+        const sfi = this.codeMap_.findDynamicEntryByStartAddress(sfiAddr);
+        if (sfi === null || sfi.funcId === undefined) {
           // TODO: fix
-          this.warnings.add(`Could not find function ${inlinedFunctions[i]}`);
-          inlinedFunctions[i] = null;
+          this.warnings.add(`Could not find function ${inlinedSFIs[i]}`);
+          inlinedSFIs[i] = null;
         } else {
-          inlinedFunctions[i] = func.funcId;
+          inlinedSFIs[i] = sfi.funcId;
         }
       }
     } else {
-      inlinedFunctions = [];
+      inlinedSFIs = [];
     }
 
     this.getOrCreateSourceInfo(entry).setSourcePositionInfo(
       script, startPos, endPos, sourcePositionTable, inliningPositions,
-      inlinedFunctions);
+      inlinedSFIs);
   }
 
   addDisassemble(start, kind, disassemble) {
@@ -639,7 +645,7 @@ export class Profile {
    * @param {number} from Current code entry address.
    * @param {number} to New code entry address.
    */
-  moveFunc(from, to) {
+  moveSharedFunctionInfo(from, to) {
     if (this.codeMap_.findDynamicEntryByStartAddress(from)) {
       this.codeMap_.moveCode(from, to);
     }
@@ -842,17 +848,17 @@ export class Profile {
     const referencedFuncEntries = [];
     const entries = this.codeMap_.getAllDynamicEntriesWithAddresses();
     for (let i = 0, l = entries.length; i < l; ++i) {
-      if (entries[i][1].constructor === FunctionEntry) {
+      if (entries[i][1].constructor === SharedFunctionInfoEntry) {
         entries[i][1].used = false;
       }
     }
     for (let i = 0, l = entries.length; i < l; ++i) {
-      if ("func" in entries[i][1]) {
-        entries[i][1].func.used = true;
+      if ("sfi" in entries[i][1]) {
+        entries[i][1].sfi.used = true;
       }
     }
     for (let i = 0, l = entries.length; i < l; ++i) {
-      if (entries[i][1].constructor === FunctionEntry &&
+      if (entries[i][1].constructor === SharedFunctionInfoEntry &&
         !entries[i][1].used) {
         this.codeMap_.deleteCode(entries[i][0]);
       }
@@ -907,20 +913,20 @@ class DynamicCodeEntry extends CodeEntry {
  *
  * @param {number} size Code size.
  * @param {string} type Code type.
- * @param {FunctionEntry} func Shared function entry.
+ * @param {SharedFunctionInfoEntry} sfi Shared function entry.
  * @param {Profile.CodeState} state Code optimization state.
  * @constructor
  */
 class DynamicFuncCodeEntry extends CodeEntry {
-  constructor(size, type, func, state) {
+  constructor(size, type, sfi, state) {
     super(size, '', type);
-    this.func = func;
-    func.addDynamicCode(this);
+    this.sfi = sfi;
+    sfi.addDynamicCode(this);
     this.state = state;
   }
 
   get functionName() {
-    return this.func.functionName;
+    return this.sfi.functionName;
   }
 
   getSourceCode() {
@@ -933,7 +939,7 @@ class DynamicFuncCodeEntry extends CodeEntry {
   }
 
   getName() {
-    const name = this.func.getName();
+    const name = this.sfi.getName();
     return this.type + ': ' + this.getState() + name;
   }
 
@@ -941,7 +947,7 @@ class DynamicFuncCodeEntry extends CodeEntry {
    * Returns raw node name (without type decoration).
    */
   getRawName() {
-    return this.func.getName();
+    return this.sfi.getName();
   }
 
   isJSFunction() {
@@ -959,7 +965,7 @@ class DynamicFuncCodeEntry extends CodeEntry {
  * @param {string} name Function name.
  * @constructor
  */
-class FunctionEntry extends CodeEntry {
+class SharedFunctionInfoEntry extends CodeEntry {
 
   // Contains the list of generated code for this function.
   /** @type {Set<DynamicCodeEntry>} */
@@ -972,7 +978,7 @@ class FunctionEntry extends CodeEntry {
   }
 
   addDynamicCode(code) {
-    if (code.func != this) {
+    if (code.sfi != this) {
       throw new Error("Adding dynamic code to wrong function");
     }
     this._codeEntries.add(code);
@@ -1305,27 +1311,27 @@ JsonProfile.prototype.addCode = function (
 };
 
 JsonProfile.prototype.addFuncCode = function (
-  kind, name, timestamp, start, size, funcAddr, state) {
+  kind, name, timestamp, start, size, sfiAddr, state) {
   // As code and functions are in the same address space,
   // it is safe to put them in a single code map.
-  let func = this.codeMap_.findDynamicEntryByStartAddress(funcAddr);
-  if (!func) {
-    func = new CodeEntry(0, name, 'SFI');
-    this.codeMap_.addCode(funcAddr, func);
+  let sfi = this.codeMap_.findDynamicEntryByStartAddress(sfiAddr);
+  if (!sfi) {
+    sfi = new CodeEntry(0, name, 'SFI');
+    this.codeMap_.addCode(sfiAddr, sfi);
 
-    func.funcId = this.functionEntries_.length;
+    sfi.funcId = this.functionEntries_.length;
     this.functionEntries_.push({ name, codes: [] });
-  } else if (func.name !== name) {
+  } else if (sfi.name !== name) {
     // Function object has been overwritten with a new one.
-    func.name = name;
+    sfi.name = name;
 
-    func.funcId = this.functionEntries_.length;
+    sfi.funcId = this.functionEntries_.length;
     this.functionEntries_.push({ name, codes: [] });
   }
   // TODO(jarin): Insert the code object into the SFI's code list.
   let entry = this.codeMap_.findDynamicEntryByStartAddress(start);
   if (entry) {
-    if (entry.size === size && entry.func === func) {
+    if (entry.size === size && entry.sfi === sfi) {
       // Entry state has changed.
       entry.state = state;
     } else {
@@ -1339,7 +1345,7 @@ JsonProfile.prototype.addFuncCode = function (
 
     entry.codeId = this.codeEntries_.length;
 
-    this.functionEntries_[func.funcId].codes.push(entry.codeId);
+    this.functionEntries_[sfi.funcId].codes.push(entry.codeId);
 
     kind = Profile.getKindFromState(state);
 
@@ -1347,7 +1353,7 @@ JsonProfile.prototype.addFuncCode = function (
       name: entry.name,
       type: entry.type,
       kind: kind,
-      func: func.funcId,
+      func: sfi.funcId,
       tm: timestamp,
     });
   }
@@ -1364,26 +1370,26 @@ JsonProfile.prototype.moveCode = function (from, to) {
 
 JsonProfile.prototype.addSourcePositions = function (
   start, script, startPos, endPos, sourcePositions, inliningPositions,
-  inlinedFunctions) {
+  inlinedSFIs) {
   const entry = this.codeMap_.findDynamicEntryByStartAddress(start);
   if (!entry) return;
   const codeId = entry.codeId;
 
   // Resolve the inlined functions list.
-  if (inlinedFunctions.length > 0) {
-    inlinedFunctions = inlinedFunctions.substring(1).split("S");
-    for (let i = 0; i < inlinedFunctions.length; i++) {
-      const funcAddr = parseInt(inlinedFunctions[i]);
-      const func = this.codeMap_.findDynamicEntryByStartAddress(funcAddr);
-      if (!func || func.funcId === undefined) {
-        printErr(`Could not find function ${inlinedFunctions[i]}`);
-        inlinedFunctions[i] = null;
+  if (inlinedSFIs.length > 0) {
+    inlinedSFIs = inlinedSFIs.substring(1).split("S");
+    for (let i = 0; i < inlinedSFIs.length; i++) {
+      const sfiAddr = parseInt(inlinedSFIs[i]);
+      const sfi = this.codeMap_.findDynamicEntryByStartAddress(sfiAddr);
+      if (!sfi || sfi.funcId === undefined) {
+        printErr(`Could not find SFI ${inlinedSFIs[i]}`);
+        inlinedSFIs[i] = null;
       } else {
-        inlinedFunctions[i] = func.funcId;
+        inlinedSFIs[i] = sfi.funcId;
       }
     }
   } else {
-    inlinedFunctions = [];
+    inlinedSFIs = [];
   }
 
   this.codeEntries_[entry.codeId].source = {
@@ -1392,7 +1398,7 @@ JsonProfile.prototype.addSourcePositions = function (
     end: endPos,
     positions: sourcePositions,
     inlined: inliningPositions,
-    fns: inlinedFunctions
+    fns: inlinedSFIs
   };
 };
 
@@ -1432,7 +1438,7 @@ JsonProfile.prototype.deleteCode = function (start) {
   }
 };
 
-JsonProfile.prototype.moveFunc = function (from, to) {
+JsonProfile.prototype.moveSharedFunctionInfo = function (from, to) {
   if (this.codeMap_.findDynamicEntryByStartAddress(from)) {
     this.codeMap_.moveCode(from, to);
   }
diff --git a/deps/v8/tools/profiling/linux-perf-chrome.py b/deps/v8/tools/profiling/linux-perf-chrome.py
index fee4541fad53b6..cfd9e7595e83af 100755
--- a/deps/v8/tools/profiling/linux-perf-chrome.py
+++ b/deps/v8/tools/profiling/linux-perf-chrome.py
@@ -261,7 +261,10 @@ def inject_v8_symbols(perf_dat_file):
   subprocess.check_call("gcertstatus >&/dev/null || gcert", shell=True)
   has_gcert = True
 
-  cmd = ["pprof", "-flame", f"-add_comment={shlex.join(sys.argv)}"]
+  cmd = [
+      "pprof", "-symbolize=local", "-flame",
+      f"-add_comment={shlex.join(sys.argv)}"
+  ]
   print("# Processing and uploading largest pprof result")
   url = subprocess.check_output(cmd + [largest_result]).decode('utf-8').strip()
   print("# PPROF RESULT")
@@ -275,6 +278,6 @@ def inject_v8_symbols(perf_dat_file):
   if has_gcert:
     raise Exception("Could not generate pprof results") from e
   print("# Please run `gcert` for generating pprof results")
-  print(f"pprof -flame {' '.join(rel_path_strings)}")
+  print(f"pprof -symbolize=local -flame {' '.join(rel_path_strings)}")
 except KeyboardInterrupt:
   exit(1)
diff --git a/deps/v8/tools/profiling/linux-perf-d8.py b/deps/v8/tools/profiling/linux-perf-d8.py
index 9879702f9a4a59..72698716150084 100755
--- a/deps/v8/tools/profiling/linux-perf-d8.py
+++ b/deps/v8/tools/profiling/linux-perf-d8.py
@@ -258,7 +258,8 @@ def inject_v8_symbols(perf_dat_file):
   has_gcert = True
 
   cmd = [
-      "pprof", "-flame", f"-add_comment={shlex.join(sys.argv)}",
+      "pprof", "-symbolize=local", "-flame",
+      f"-add_comment={shlex.join(sys.argv)}",
       str(result.absolute())
   ]
   print("# Processing and uploading to pprofresult")
@@ -268,6 +269,6 @@ def inject_v8_symbols(perf_dat_file):
   if has_gcert:
     raise Exception("Could not generate pprof results") from e
   print("# Please run `gcert` for generating pprof results")
-  print(f"pprof -flame {result}")
+  print(f"pprof -symbolize=local -flame {result}")
 except KeyboardInterrupt:
   exit(1)
diff --git a/deps/v8/tools/release/auto_push.py b/deps/v8/tools/release/auto_push.py
index eb52e2a316708a..cbc23d43fc8232 100755
--- a/deps/v8/tools/release/auto_push.py
+++ b/deps/v8/tools/release/auto_push.py
@@ -26,13 +26,7 @@
 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-import argparse
-import json
-import os
-import re
 import sys
-import urllib
-
 from common_includes import *
 import create_release
 
diff --git a/deps/v8/tools/release/auto_roll.py b/deps/v8/tools/release/auto_roll.py
index 3f3e4111e35bd9..7100d96ad15ac8 100755
--- a/deps/v8/tools/release/auto_roll.py
+++ b/deps/v8/tools/release/auto_roll.py
@@ -3,9 +3,7 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-import argparse
 import os
-import re
 import sys
 
 from common_includes import *
@@ -24,7 +22,8 @@
 CQ_INCLUDE_TRYBOTS=luci.chromium.try:linux_optional_gpu_tests_rel
 CQ_INCLUDE_TRYBOTS=luci.chromium.try:mac_optional_gpu_tests_rel
 CQ_INCLUDE_TRYBOTS=luci.chromium.try:win_optional_gpu_tests_rel
-CQ_INCLUDE_TRYBOTS=luci.chromium.try:android_optional_gpu_tests_rel""")
+CQ_INCLUDE_TRYBOTS=luci.chromium.try:android_optional_gpu_tests_rel
+CQ_INCLUDE_TRYBOTS=luci.chromium.try:dawn-linux-x64-deps-rel""")
 
 REF_LINE_PATTERN = r"refs\/tags\/(\d+(?:\.\d+){2,3})-pgo\ ([0-9a-f]{40})"
 
@@ -37,71 +36,17 @@ def RunStep(self):
     self.Git("fetch origin +refs/tags/*:refs/tags/*")
 
 
-class DetectLastRoll(Step):
-  MESSAGE = "Detect commit ID of the last Chromium roll."
-
-  def RunStep(self):
-    self["last_roll"] = self._options.last_roll
-    if not self["last_roll"]:
-      # Get last-rolled v8 revision from Chromium's DEPS file.
-      self["last_roll"] = self.Command(
-          "gclient", "getdep -r src/v8", cwd=self._options.chromium).strip()
-
-    self["last_version"] = self.GetVersionTag(self["last_roll"])
-    assert self["last_version"], "The last rolled v8 revision is not tagged."
-
-
-class DetectRevisionToRoll(Step):
-  MESSAGE = "Detect commit ID of the V8 revision to roll."
-
-  def RunStep(self):
-    self["roll"] = self._options.revision
-    if self["roll"]:
-      # If the revision was passed on the cmd line, continue script execution
-      # in the next step.
-      return False
-
-    # The revision that should be rolled. Check for the latest of the most
-    # recent releases based on commit timestamp.
-    response = self.Git(
-        r"for-each-ref --count=80 --sort=-committerdate --format "
-        r"'%(refname) %(objectname)' 'refs/tags/*-pgo'"
-    )
-    version_revisions = []
-    for line in response.split('\n'):
-      match = re.fullmatch(REF_LINE_PATTERN, line)
-      if not match:
-        continue
-      version_revisions.append(match.groups())
-
-    assert version_revisions, "Didn't find any recent release."
-
-    # There must be some progress between the last roll and the new candidate
-    # revision (i.e. we don't go backwards). The revisions are ordered newest
-    # to oldest. It is possible that the newest timestamp has no progress
-    # compared to the last roll, i.e. if the newest release is a cherry-pick
-    # on a release branch. Then we look further.
-    for version, revision in version_revisions:
-      if LooseVersion(self["last_version"]) < LooseVersion(version):
-        self["roll"] = revision
-        break
-    else:
-      print("There is no newer v8 revision than the one in Chromium (%s)."
-            % self["last_roll"])
-      return True
-
-
 class PrepareRollCandidate(Step):
   MESSAGE = "Robustness checks of the roll candidate."
 
   def RunStep(self):
-    self["roll_title"] = self.GitLog(n=1, format="%s",
-                                     git_hash=self["roll"])
+    self["roll_title"] = self.GitLog(
+        n=1, format="%s", git_hash=self._options.revision)
 
     # Make sure the last roll and the roll candidate are releases.
-    version = self.GetVersionTag(self["roll"])
+    version = self.GetVersionTag(self._options.revision)
     assert version, "The revision to roll is not tagged."
-    version = self.GetVersionTag(self["last_roll"])
+    version = self.GetVersionTag(self._options.last_roll)
     assert version, "The revision used as last roll is not tagged."
 
 
@@ -111,26 +56,18 @@ class SwitchChromium(Step):
   def RunStep(self):
     cwd = self._options.chromium
     self.InitialEnvironmentChecks(cwd)
-    # Check for a clean workdir.
-    if not self.GitIsWorkdirClean(cwd=cwd):  # pragma: no cover
-      self.Die("Workspace is not clean. Please commit or undo your changes.")
     # Assert that the DEPS file is there.
     if not os.path.exists(os.path.join(cwd, "DEPS")):  # pragma: no cover
       self.Die("DEPS file not present.")
 
 
-class UpdateChromiumCheckout(Step):
-  MESSAGE = "Update the checkout and create a new branch."
+class ChromiumCreateBranch(Step):
+  MESSAGE = "Create a new branch."
 
   def RunStep(self):
     cwd = self._options.chromium
     self.GitCheckout("main", cwd=cwd)
     self.DeleteBranch("work-branch", cwd=cwd)
-    self.GitPull(cwd=cwd)
-
-    # Update v8 remotes.
-    self.GitFetchOrigin()
-
     self.GitCreateBranch("work-branch", cwd=cwd)
 
 
@@ -141,19 +78,25 @@ def RunStep(self):
     cwd = self._options.chromium
     # Patch DEPS file.
     if self.Command("gclient", "setdep -r src/v8@%s" %
-                    self["roll"], cwd=cwd) is None:
-      self.Die("Failed to create deps for %s" % self["roll"])
+                    self._options.revision, cwd=cwd) is None:
+      self.Die("Failed to create deps for %s" % self._options.revision)
+    self.GitAdd('DEPS', cwd=cwd)
 
     message = []
     message.append("Update V8 to %s." % self["roll_title"].lower())
 
     message.append(
-        ROLL_SUMMARY % (self["last_roll"][:8], self["roll"][:8]))
+        ROLL_SUMMARY % (self._options.last_roll[:8],
+                        self._options.revision[:8]))
 
     message.append(ISSUE_MSG)
 
     message.append("R=%s" % self._options.reviewer)
-    self.GitCommit("\n\n".join(message),  author=self._options.author, cwd=cwd)
+    self.GitCommit(
+        "\n\n".join(message),
+        author=self._options.author,
+        prefix=["-c", "diff.ignoreSubmodules=all"],
+        cwd=cwd)
     if not self._options.dry_run:
       self.GitUpload(force=True,
                      bypass_hooks=True,
@@ -173,8 +116,7 @@ class CleanUp(Step):
 
   def RunStep(self):
     print("Congratulations, you have successfully rolled %s into "
-          "Chromium."
-          % self["roll"])
+          "Chromium." % self._options.revision)
 
     # Clean up all temporary files.
     Command("rm", "-f %s*" % self._config["PERSISTFILE_BASENAME"])
@@ -186,11 +128,8 @@ def _PrepareOptions(self, parser):
                         help=("The path to your Chromium src/ "
                               "directory to automate the V8 roll."))
     parser.add_argument("--last-roll",
-                        help="The git commit ID of the last rolled version. "
-                             "Auto-detected if not specified.")
-    parser.add_argument("--revision",
-                        help="Revision to roll. Auto-detected if not "
-                             "specified."),
+                        help="The git commit ID of the last rolled version.")
+    parser.add_argument("--revision", help="Revision to roll."),
     parser.add_argument("--roll", help="Deprecated.",
                         default=True, action="store_true")
     group = parser.add_mutually_exclusive_group()
@@ -206,6 +145,10 @@ def _ProcessOptions(self, options):  # pragma: no cover
       print("A reviewer (-r) and an author (-a) are required.")
       return False
 
+    if not options.last_roll or not options.revision:
+      print("Options --last-roll and --revision are required.")
+      return False
+
     options.requires_editor = False
     options.force = True
     options.manual = False
@@ -219,11 +162,9 @@ def _Config(self):
   def _Steps(self):
     return [
       Preparation,
-      DetectLastRoll,
-      DetectRevisionToRoll,
       PrepareRollCandidate,
       SwitchChromium,
-      UpdateChromiumCheckout,
+      ChromiumCreateBranch,
       UploadCL,
       CleanUp,
     ]
diff --git a/deps/v8/tools/release/common_includes.py b/deps/v8/tools/release/common_includes.py
index 97c0098b484d32..7529f19354404b 100644
--- a/deps/v8/tools/release/common_includes.py
+++ b/deps/v8/tools/release/common_includes.py
@@ -30,14 +30,12 @@
 import datetime
 from distutils.version import LooseVersion
 import glob
-import imp
 import json
 import os
 import re
 import shutil
 import subprocess
 import sys
-import textwrap
 import time
 import urllib
 
@@ -131,7 +129,7 @@ def NormalizeVersionTags(version_tags):
   # Remove tags/ prefix because of packed refs.
   for current_tag in version_tags:
     version_tag = SanitizeVersionTag(current_tag)
-    if version_tag != None:
+    if version_tag is not None:
       normalized_version_tags.append(version_tag)
 
   return normalized_version_tags
diff --git a/deps/v8/tools/release/create_release.py b/deps/v8/tools/release/create_release.py
index 37e9e8673c6d7d..ae1437c1b07c6d 100755
--- a/deps/v8/tools/release/create_release.py
+++ b/deps/v8/tools/release/create_release.py
@@ -3,16 +3,10 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-import argparse
 import os
 import sys
-import tempfile
-
 from common_includes import *
 
-import urllib.request as urllib2
-
-
 class Preparation(Step):
   MESSAGE = "Preparation."
 
diff --git a/deps/v8/tools/release/filter_build_files.py b/deps/v8/tools/release/filter_build_files.py
index 68c60efc87dec6..d01441dae6b7ee 100755
--- a/deps/v8/tools/release/filter_build_files.py
+++ b/deps/v8/tools/release/filter_build_files.py
@@ -18,7 +18,6 @@
 import itertools
 import json
 import os
-import re
 import sys
 
 EXECUTABLE_FILES = [
diff --git a/deps/v8/tools/release/git_recipes.py b/deps/v8/tools/release/git_recipes.py
index 865e13bf31a120..c574bb2475c865 100644
--- a/deps/v8/tools/release/git_recipes.py
+++ b/deps/v8/tools/release/git_recipes.py
@@ -234,13 +234,13 @@ def GitUpload(self, reviewer="", force=False, cq=False,
     # base files were uploaded, if not retry.
     self.Git(MakeArgs(args), pipe=False, **kwargs)
 
-  def GitCommit(self, message="", file_name="", author=None, **kwargs):
+  def GitCommit(self, message="", file_name="", author=None, prefix=None, **kwargs):
     assert message or file_name
-    args = ["commit"]
+    args = (prefix or []) + ["commit"]
     if file_name:
       args += ["-aF", Quoted(file_name)]
     if message:
-      args += ["-am", Quoted(message)]
+      args += ["-m", Quoted(message)]
     if author:
       args += ["--author", "\"%s <%s>\"" % (author, author)]
     self.Git(MakeArgs(args), **kwargs)
diff --git a/deps/v8/tools/release/merge_to_branch.py b/deps/v8/tools/release/merge_to_branch.py
index ca5b2ce67461f2..9b7f7a16db8598 100755
--- a/deps/v8/tools/release/merge_to_branch.py
+++ b/deps/v8/tools/release/merge_to_branch.py
@@ -26,7 +26,6 @@
 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-import argparse
 from collections import OrderedDict
 import sys
 
diff --git a/deps/v8/tools/release/mergeinfo.py b/deps/v8/tools/release/mergeinfo.py
index 7136463afb2659..18bb486051f1d9 100755
--- a/deps/v8/tools/release/mergeinfo.py
+++ b/deps/v8/tools/release/mergeinfo.py
@@ -7,7 +7,6 @@
 from __future__ import print_function
 
 import argparse
-import os
 import sys
 import re
 
diff --git a/deps/v8/tools/release/roll_merge.py b/deps/v8/tools/release/roll_merge.py
index d1abe56eddf457..52a917aa15247b 100755
--- a/deps/v8/tools/release/roll_merge.py
+++ b/deps/v8/tools/release/roll_merge.py
@@ -26,7 +26,6 @@
 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-import argparse
 from collections import OrderedDict
 import sys
 
diff --git a/deps/v8/tools/release/roll_merge_gerrit.py b/deps/v8/tools/release/roll_merge_gerrit.py
index 4fc0ec77e2d502..1b708d10d52ac8 100755
--- a/deps/v8/tools/release/roll_merge_gerrit.py
+++ b/deps/v8/tools/release/roll_merge_gerrit.py
@@ -9,6 +9,7 @@
 import re
 import sys
 import time
+import datetime
 import urllib.parse
 
 # Add depot tools to the sys path, for gerrit_util
@@ -24,6 +25,8 @@
 
 GERRIT_HOST = 'chromium-review.googlesource.com'
 
+ROLLER_BOT_EMAIL = "v8-ci-autoroll-builder@chops-service-accounts.iam.gserviceaccount.com"
+
 
 def ExtractVersion(include_file_text):
   version = {}
@@ -51,9 +54,10 @@ def main():
       "--author",
       default="",
       help="The author email used for code review.")
-
-  group = parser.add_mutually_exclusive_group(required=True)
-  group.add_argument("--branch", help="The branch to merge to (e.g. 10.3.171)")
+  parser.add_argument(
+      "--branch",
+      help="The branch to merge to (e.g. 10.3.171). Detected automatically from the latest roll CL if not provided",
+      required=False)
   # TODO(leszeks): Add support for more than one revision. This will need to
   # cherry pick one of them using the gerrit API, then somehow applying the rest
   # onto it as additional patches.
@@ -61,15 +65,45 @@ def main():
 
   options = parser.parse_args()
 
+  branch = options.branch
+  if branch is None:
+    print("Looking for latest roll CL...")
+    changes = gerrit_util.QueryChanges(
+        GERRIT_HOST, [
+            ("owner", ROLLER_BOT_EMAIL),
+            ("project", "chromium/src"),
+            ("status", "NEW"),
+        ],
+        "Update V8 to version",
+        limit=1)
+    if len(changes) < 1:
+      print("Didn't find a CL that looks like an active roll")
+      return 1
+    if len(changes) > 1:
+      print("Found multiple CLs that look like an active roll:")
+      for change in changes:
+        print("  * %s: https://%s/c/%s" %
+              (change['subject'], GERRIT_HOST, change['_number']))
+      return 1
+
+    roll_change = changes[0]
+    subject = roll_change['subject']
+    print("Found: %s" % subject)
+    m = re.match(r"Update V8 to version ([0-9]+\.[0-9]+\.[0-9]+)", subject)
+    if not m:
+      print("CL subject is not of the form \"Update V8 to version 1.2.3\"")
+      return 1
+    branch = m.group(1)
+
   # Get the original commit.
   revision = options.revision[0]
-  if not re.match(r"[0-9]+\.[0-9]+\.[0-9]+", options.branch):
+  if not re.match(r"[0-9]+\.[0-9]+\.[0-9]+", branch):
     print("Branch is not of the form 1.2.3")
-    exit(1)
-  print("Cherry-picking %s onto %s" % (revision, options.branch))
+    return 1
+  print("Cherry-picking %s onto %s" % (revision, branch))
 
   # Create a cherry pick commit from the original commit.
-  cherry_pick = gerrit_util.CherryPick(GERRIT_HOST, revision, options.branch)
+  cherry_pick = gerrit_util.CherryPick(GERRIT_HOST, revision, branch)
   # Use the cherry pick number to refer to it, rather than the 'id', because
   # cherry picks end up having the same Change-Id as the original CL.
   cherry_pick_id = cherry_pick['_number']
@@ -131,7 +165,7 @@ def main():
     gerrit_util.SetReview(
         GERRIT_HOST, cherry_pick_id, labels={"Owners-Override": 1})
   except:
-    logging.WARNING("Could not set Owners-Override +1")
+    logging.warning("Could not set Owners-Override +1")
 
   print("Adding Rubber Stamper as a reviewer...")
   gerrit_util.AddReviewers(
@@ -171,6 +205,37 @@ def main():
                               urllib.parse.quote_plus(cherry_pick["project"]),
                               version_string, cherry_pick_commit['commit'])
 
+  print("Waiting for PGO profile tag (%s-pgo), this can take 15-20 minutes..." %
+        version_string)
+  pgo_tag = None
+  waiting_start_time = time.time()
+  while True:
+    # Print the waiting time so far
+    elapsed_time = time.time() - waiting_start_time
+    print(
+        "\r - waiting time: %s" %
+        datetime.timedelta(seconds=round(elapsed_time)),
+        end="",
+        flush=True)
+
+    pgo_tag = gerrit_util.CallGerritApi(
+        GERRIT_HOST,
+        'projects/%s/tags/%s-pgo' %
+        (urllib.parse.quote_plus(cherry_pick["project"]), version_string),
+        reqtype='GET',
+        accept_statuses=[200, 404])
+    if pgo_tag is not None:
+      # New line after progress printing.
+      print("")
+      break
+
+    time.sleep(5)
+
+  if pgo_tag['revision'] != cherry_pick_commit['commit']:
+    logging.fatal("PGO tagged revision %s does not match tagged cherry-pick %s",
+                  pgo_tag['revision'], cherry_pick_commit['commit'])
+    return 1
+
   print("Done.")
 
 
diff --git a/deps/v8/tools/release/test_scripts.py b/deps/v8/tools/release/test_scripts.py
index 82f475558a533d..8c7a2e1bc32417 100755
--- a/deps/v8/tools/release/test_scripts.py
+++ b/deps/v8/tools/release/test_scripts.py
@@ -540,6 +540,7 @@ def CheckVersionCommit():
 CQ_INCLUDE_TRYBOTS=luci.chromium.try:mac_optional_gpu_tests_rel
 CQ_INCLUDE_TRYBOTS=luci.chromium.try:win_optional_gpu_tests_rel
 CQ_INCLUDE_TRYBOTS=luci.chromium.try:android_optional_gpu_tests_rel
+CQ_INCLUDE_TRYBOTS=luci.chromium.try:dawn-linux-x64-deps-rel
 
 R=reviewer@chromium.org"""
 
@@ -555,32 +556,6 @@ def CheckVersionCommit():
 }
 """
 
-  def testChromiumRollUpToDate(self):
-    TEST_CONFIG["CHROMIUM"] = self.MakeEmptyTempDirectory()
-    json_output_file = os.path.join(TEST_CONFIG["CHROMIUM"], "out.json")
-    TextToFile(self.FAKE_DEPS, os.path.join(TEST_CONFIG["CHROMIUM"], "DEPS"))
-    chrome_dir = TEST_CONFIG["CHROMIUM"]
-    self.Expect([
-      Cmd("git fetch origin", ""),
-      Cmd("git fetch origin +refs/tags/*:refs/tags/*", ""),
-      Cmd("gclient getdep -r src/v8", "last_roll_hsh", cwd=chrome_dir),
-      Cmd("git tag --points-at last_roll_hsh", "3.22.4\n3.22.4-pgo"),
-      Cmd((
-          "git for-each-ref --count=80 --sort=-committerdate --format "
-          "'%(refname) %(objectname)' 'refs/tags/*-pgo'"
-      ), "\n".join([
-          f"refs/tags/3.22.4-pgo {self.ROLL_HASH}",
-          f"refs/tags/3.22.3-pgo {self.HASH_ALT_1}",
-      ])),
-    ])
-
-    result = auto_roll.AutoRoll(TEST_CONFIG, self).Run(
-        AUTO_PUSH_ARGS + [
-          "-c", TEST_CONFIG["CHROMIUM"],
-          "--json-output", json_output_file])
-    self.assertEquals(0, result)
-
-
   def testChromiumRoll(self):
     # Setup fake directory structures.
     TEST_CONFIG["CHROMIUM"] = self.MakeEmptyTempDirectory()
@@ -597,27 +572,16 @@ def WriteDeps():
     expectations = [
       Cmd("git fetch origin", ""),
       Cmd("git fetch origin +refs/tags/*:refs/tags/*", ""),
-      Cmd("gclient getdep -r src/v8", "last_roll_hsh", cwd=chrome_dir),
-      Cmd("git tag --points-at last_roll_hsh", "3.22.3.1\n22.3.1-pgo"),
-      Cmd((
-          "git for-each-ref --count=80 --sort=-committerdate --format "
-          "'%(refname) %(objectname)' 'refs/tags/*-pgo'"
-      ), "\n".join([
-          f"refs/tags/3.22.4-pgo {self.ROLL_HASH}",
-          f"refs/tags/3.22.3-pgo {self.HASH_ALT_1}",
-      ])),
       Cmd(f"git log -1 --format=%s {self.ROLL_HASH}", "Version 3.22.4\n"),
       Cmd(f"git tag --points-at {self.ROLL_HASH}", "3.22.4\n3.22.4-pgo"),
       Cmd("git tag --points-at last_roll_hsh", "3.22.2.1\n22.2.1-pgo"),
-      Cmd("git status -s -uno", "", cwd=chrome_dir),
       Cmd("git checkout -f main", "", cwd=chrome_dir),
       Cmd("git branch", "", cwd=chrome_dir),
-      Cmd("git pull", "", cwd=chrome_dir),
-      Cmd("git fetch origin", ""),
       Cmd("git new-branch work-branch", "", cwd=chrome_dir),
       Cmd(f"gclient setdep -r src/v8@{self.ROLL_HASH}", "", cb=WriteDeps,
           cwd=chrome_dir),
-      Cmd(("git commit -am \"%s\" "
+      Cmd("git add \"DEPS\"", "", cwd=chrome_dir),
+      Cmd(("git -c diff.ignoreSubmodules=all commit -m \"%s\" "
            "--author \"author@chromium.org <author@chromium.org>\"" %
            self.ROLL_COMMIT_MSG),
           "", cwd=chrome_dir),
@@ -630,6 +594,7 @@ def WriteDeps():
     self.Expect(expectations)
 
     args = ["-a", "author@chromium.org", "-c", chrome_dir,
+            "--last-roll", "last_roll_hsh", "--revision", self.ROLL_HASH,
             "-r", "reviewer@chromium.org", "--json-output", json_output_file]
     auto_roll.AutoRoll(TEST_CONFIG, self).Run(args)
 
@@ -770,8 +735,8 @@ def VerifyLand():
       RL("Y"),  # Automatically increment patch level?
       Cmd("git commit -aF \"%s\"" % TEST_CONFIG["COMMITMSG_FILE"], ""),
       RL("reviewer@chromium.org"),  # V8 reviewer.
-      Cmd("git cl upload --send-mail -r \"reviewer@chromium.org\" "
-          "--bypass-hooks", ""),
+      Cmd("git cl upload --send-mail "
+          "-r \"reviewer@chromium.org\" --bypass-hooks", ""),
       Cmd("git checkout -f %s" % TEST_CONFIG["BRANCHNAME"], ""),
       RL("LGTM"),  # Enter LGTM for V8 CL.
       Cmd("git cl presubmit", "Presubmit successfull\n"),
@@ -906,8 +871,8 @@ def VerifyLand():
       Cmd("git apply --index --reject \"%s\"" % extra_patch, ""),
       Cmd("git commit -aF \"%s\"" % TEST_CONFIG["COMMITMSG_FILE"], ""),
       RL("reviewer@chromium.org"),  # V8 reviewer.
-      Cmd("git cl upload --send-mail -r \"reviewer@chromium.org\" "
-          "--bypass-hooks", ""),
+      Cmd("git cl upload --send-mail "
+          "-r \"reviewer@chromium.org\" --bypass-hooks", ""),
       Cmd("git checkout -f %s" % TEST_CONFIG["BRANCHNAME"], ""),
       RL("LGTM"),  # Enter LGTM for V8 CL.
       Cmd("git cl presubmit", "Presubmit successfull\n"),
diff --git a/deps/v8/tools/run_perf.py b/deps/v8/tools/run_perf.py
index 7b4ab418ae63b0..a7fb190737899b 100755
--- a/deps/v8/tools/run_perf.py
+++ b/deps/v8/tools/run_perf.py
@@ -23,7 +23,7 @@
   "timeout_XXX": <how long test is allowed run run for arch XXX>,
   "retry_count": <how many times to retry failures (in addition to first try)",
   "retry_count_XXX": <how many times to retry failures for arch XXX>
-  "resources": [<js file to be moved to android device>, ...]
+  "resources": [<js file to be moved to android device or "*">, ...]
   "variants": [
     {
       "name": <name of the variant>,
@@ -96,11 +96,11 @@
   "flags": ["--expose-gc"]},
   "run_count": 5,
   "units": "score",
-  "variants:" {
+  "variants:" [
     {"name": "default", "flags": []},
     {"name": "future",  "flags": ["--future"]},
     {"name": "noopt",   "flags": ["--noopt"]},
-  }
+  ],
   "tests": [
     {"name": "Richards",
      "path": ["richards"],
@@ -119,16 +119,18 @@
 The test flags are passed to the js test file after '--'.
 """
 
-from collections import OrderedDict
+from abc import ABC, abstractmethod
 from math import sqrt
+from pathlib import Path
 from statistics import mean, stdev
+
+import argparse
 import copy
 import json
 import logging
 import math
-import argparse
-import pathlib
 import os
+import psutil
 import re
 import subprocess
 import sys
@@ -154,6 +156,8 @@
 INFRA_FAILURE_RETCODE = 87
 MIN_RUNS_FOR_CONFIDENCE = 10
 
+WARMUP_CACHE_FILE = Path.cwd() / 'cache' / 'v8_perf' / 'warmup_cache.json'
+
 
 def GeometricMean(values):
   """Returns the geometric mean of a list of values.
@@ -612,7 +616,6 @@ def __init__(self, suite, parent, arch):
       logging.error("No owners provided for %s" % self.name)
 
   def ProcessOutput(self, output, result_tracker, count):
-    result_tracker.AddRunnableDuration(self, output.duration)
     self.ConsumeOutput(output, result_tracker)
 
 
@@ -702,6 +705,9 @@ def BuildGraphConfigs(suite, parent, arch):
       graph.AppendChild(variant_graph)
       for subsuite in suite.get('tests', []):
         BuildGraphConfigs(subsuite, variant_graph, arch)
+      # Add variant specific tests.
+      for subsuite in variant_suite.get('tests', []):
+        BuildGraphConfigs(subsuite, variant_graph, arch)
   parent.AppendChild(graph)
   return graph
 
@@ -749,6 +755,73 @@ def is_build(path):
   return actual_paths[0]
 
 
+class CacheHandler:
+  def __init__(self, cache_file):
+    self.cache_file = cache_file
+
+  def read_cache(self):
+    try:
+      with open(self.cache_file) as f:
+        return json.load(f)
+    except FileNotFoundError:
+      logging.info(f"{self.cache_file} doesn't exist yet. Creating new.")
+    return {}
+
+  def write_cache(self, cache):
+    with open(self.cache_file, 'w') as f:
+      return json.dump(cache, f)
+
+
+class WarmupManager(ABC):
+  @abstractmethod
+  def maybe_warm_up(self, name, warmup_fun):
+    """Run the warmup_fun if needed, e.g. after a system reboot."""
+
+
+class NullWarmupManager(WarmupManager):
+  """Null-object place-holder used when warm-up isn't activated or for
+  platforms where it isn't implemented.
+  """
+  def maybe_warm_up(self, name, warmup_fun):
+    pass
+
+
+class CachedWarmupManager(WarmupManager):
+  """On-demand warm-up based on system reboot.
+
+  The warm-up function is run once after reboot for every benchmark key.
+  The keys are cached in a file in cache/v8_perf. This relies on the caller
+  creating this directory.
+  """
+  def __init__(self):
+    self.cache_handler = CacheHandler(WARMUP_CACHE_FILE)
+    self.cache = self.cache_handler.read_cache()
+    self.last_reboot = psutil.boot_time()
+    self.trim_cache()
+    # Ensure the trimmed version is on disk.
+    self.cache_handler.write_cache(self.cache)
+
+  def is_warmed_up(self, timestamp):
+    return timestamp > self.last_reboot
+
+  def trim_cache(self):
+    """Prevent obsolete entries occupying the cache file."""
+    self.cache = dict(
+        (k, v) for k, v in self.cache.items() if self.is_warmed_up(v))
+
+  def maybe_warm_up(self, name, warmup_fun):
+    if self.is_warmed_up(self.cache.get(name, 0)):
+      return
+
+    logging.info(f'Warm-up run of {name} - disregarding output.')
+    try:
+      warmup_fun()
+    finally:
+      self.cache[name] = time.time()
+      self.cache_handler.write_cache(self.cache)
+      logging.info(f'Warm-up done.')
+
+
 class Platform(object):
   def __init__(self, args):
     self.shell_dir = args.shell_dir
@@ -756,6 +829,7 @@ def __init__(self, args):
     self.is_dry_run = args.dry_run
     self.extra_flags = args.extra_flags.split()
     self.args = args
+    self.warmup_manager = NullWarmupManager()
 
   @staticmethod
   def ReadBuildConfig(args):
@@ -772,14 +846,14 @@ def GetPlatform(args):
     else:
       return DesktopPlatform(args)
 
-  def _Run(self, runnable, count, secondary=False):
+  def _Run(self, runnable, count, secondary=False, post_process=True):
     raise NotImplementedError()  # pragma: no cover
 
-  def _LoggedRun(self, runnable, count, secondary=False):
+  def _LoggedRun(self, runnable, count, secondary=False, post_process=True):
     suffix = ' - secondary' if secondary else ''
     title = '>>> %%s (#%d)%s:' % ((count + 1), suffix)
     try:
-      output = self._Run(runnable, count, secondary)
+      output = self._Run(runnable, count, secondary, post_process)
     except OSError:
       logging.exception(title % 'OSError')
       raise
@@ -806,6 +880,10 @@ def Run(self, runnable, count, secondary):
       A tuple with the two benchmark outputs. The latter will be NULL_OUTPUT if
       secondary is False.
     """
+    self.warmup_manager.maybe_warm_up(
+        runnable.name,
+        lambda: self._LoggedRun(
+            runnable, 0, secondary=False, post_process=False))
     output = self._LoggedRun(runnable, count, secondary=False)
     if secondary:
       return output, self._LoggedRun(runnable, count, secondary=True)
@@ -821,11 +899,11 @@ def __init__(self, args):
     # Setup command class to OS specific version.
     command.setup(utils.GuessOS(), args.device)
 
-    if args.prioritize or args.affinitize != None:
+    if args.prioritize or args.affinitize is not None:
       self.command_prefix = ['schedtool']
       if args.prioritize:
         self.command_prefix += ['-n', '-20']
-      if args.affinitize != None:
+      if args.affinitize is not None:
         # schedtool expects a bit pattern when setting affinity, where each
         # bit set to '1' corresponds to a core where the process may run on.
         # First bit corresponds to CPU 0. Since the 'affinitize' parameter is
@@ -835,6 +913,9 @@ def __init__(self, args):
         self.command_prefix += ['-a', ('0x%x' % core)]
       self.command_prefix += ['-e']
 
+    if args.checked_warmup:
+      self.warmup_manager = CachedWarmupManager()
+
   def PreExecution(self):
     pass
 
@@ -845,18 +926,20 @@ def PreTests(self, node, path):
     if isinstance(node, RunnableConfig):
       node.ChangeCWD(path)
 
-  def _Run(self, runnable, count, secondary=False):
+  def _Run(self, runnable, count, secondary=False, post_process=True):
     shell_dir = self.shell_dir_secondary if secondary else self.shell_dir
     cmd = runnable.GetCommand(self.command_prefix, shell_dir, self.extra_flags)
     logging.debug('Running command: %s' % cmd)
     output = Output() if self.is_dry_run else cmd.execute()
 
-    if output.IsSuccess() and '--prof' in self.extra_flags:
+    if (not self.is_dry_run and
+        post_process and
+        output.IsSuccess() and
+        '--prof' in self.extra_flags):
       os_prefix = {'linux': 'linux', 'macos': 'mac'}.get(utils.GuessOS())
       if os_prefix:
-        if not self.is_dry_run:
-          tick_tools = os.path.join(TOOLS_BASE, '%s-tick-processor' % os_prefix)
-          subprocess.check_call(tick_tools + ' --only-summary', shell=True)
+        tick_tools = os.path.join(TOOLS_BASE, '%s-tick-processor' % os_prefix)
+        subprocess.check_call(tick_tools + ' --only-summary', shell=True)
       else:  # pragma: no cover
         logging.warning(
             'Profiler option currently supported on Linux and Mac OS.')
@@ -899,9 +982,12 @@ def PreTests(self, node, path):
     if isinstance(node, RunnableConfig):
       self.driver.push_file(bench_abs, node.main, bench_rel)
     for resource in node.resources:
-      self.driver.push_file(bench_abs, resource, bench_rel)
+      if resource == '*':
+        self.driver.push_files_rec(bench_abs, bench_rel)
+      else:
+        self.driver.push_file(bench_abs, resource, bench_rel)
 
-  def _Run(self, runnable, count, secondary=False):
+  def _Run(self, runnable, count, secondary=False, post_process=True):
     target_dir = 'bin_secondary' if secondary else 'bin'
     self.driver.drop_ram_caches()
 
@@ -954,15 +1040,15 @@ def __enter__(self):
     if self.disable_aslr:
       self.aslr_backup = CustomMachineConfiguration.GetASLR()
       CustomMachineConfiguration.SetASLR(0)
-    if self.governor != None:
+    if self.governor is not None:
       self.governor_backup = CustomMachineConfiguration.GetCPUGovernor()
       CustomMachineConfiguration.SetCPUGovernor(self.governor)
     return self
 
   def __exit__(self, type, value, traceback):
-    if self.aslr_backup != None:
+    if self.aslr_backup is not None:
       CustomMachineConfiguration.SetASLR(self.aslr_backup)
-    if self.governor_backup != None:
+    if self.governor_backup is not None:
       CustomMachineConfiguration.SetCPUGovernor(self.governor_backup)
 
   @staticmethod
@@ -1018,7 +1104,7 @@ def GetCPUGovernor():
         with open(cpu_device, 'r') as f:
           # We assume the governors of all CPUs are set to the same value
           val = f.readline().strip()
-          if ret == None:
+          if ret is None:
             ret = val
           elif ret != val:
             raise Exception('CPU cores have differing governor settings')
@@ -1141,6 +1227,8 @@ def Main(argv):
       help='Do not run any actual tests.')
   parser.add_argument('-v', '--verbose', default=False, action='store_true',
                       help='Be verbose and print debug output.')
+  parser.add_argument('--checked-warmup', default=False, action='store_true',
+                      help='Warm up benchmarks not run since last reboot.')
   parser.add_argument('suite', nargs='+', help='Path to the suite config file.')
 
   try:
@@ -1167,12 +1255,12 @@ def Main(argv):
 
   workspace = os.path.abspath(os.path.join(os.path.dirname(__file__), '..'))
 
-  if args.binary_override_path == None:
+  if args.binary_override_path is None:
     args.shell_dir = find_build_directory(
         os.path.join(workspace, args.outdir), args.arch)
     default_binary_name = 'd8'
   else:
-    path = pathlib.Path(args.binary_override_path).expanduser().resolve()
+    path = Path(args.binary_override_path).expanduser().resolve()
     if not path.is_file():
       logging.error(f'binary-override-path "{path}" must be a file name')
       return INFRA_FAILURE_RETCODE
@@ -1206,8 +1294,6 @@ def Main(argv):
   # directory.
   args.suite = list(map(os.path.abspath, args.suite))
 
-  prev_aslr = None
-  prev_cpu_gov = None
   platform = Platform.GetPlatform(args)
 
   result_tracker = ResultTracker()
diff --git a/deps/v8/tools/shell-utils.h b/deps/v8/tools/shell-utils.h
index b41d3277aa015f..d38727b902cced 100644
--- a/deps/v8/tools/shell-utils.h
+++ b/deps/v8/tools/shell-utils.h
@@ -40,7 +40,7 @@ enum Encoding {
   UTF16
 };
 
-const byte* ReadFileAndRepeat(const char* name, int* size, int repeat) {
+const uint8_t* ReadFileAndRepeat(const char* name, int* size, int repeat) {
   FILE* file = fopen(name, "rb");
   *size = 0;
   if (file == NULL) return NULL;
@@ -51,7 +51,7 @@ const byte* ReadFileAndRepeat(const char* name, int* size, int repeat) {
 
   *size = file_size * repeat;
 
-  byte* chars = new byte[*size + 1];
+  uint8_t* chars = new uint8_t[*size + 1];
   for (int i = 0; i < file_size;) {
     int read = static_cast<int>(fread(&chars[i], 1, file_size - i, file));
     i += read;
diff --git a/deps/v8/tools/system-analyzer/app-model.mjs b/deps/v8/tools/system-analyzer/app-model.mjs
index 5bc15fe6a62de5..10380028a875cc 100644
--- a/deps/v8/tools/system-analyzer/app-model.mjs
+++ b/deps/v8/tools/system-analyzer/app-model.mjs
@@ -151,7 +151,8 @@ class State {
   get entries() {
     if (!this.map) return {};
     return {
-      map: this.map.id, time: this.map.time
+    map:
+      this.map.id, time: this.map.time
     }
   }
 }
diff --git a/deps/v8/tools/system-analyzer/log/code.mjs b/deps/v8/tools/system-analyzer/log/code.mjs
index ff2305e2121217..5770ac4fdfab1c 100644
--- a/deps/v8/tools/system-analyzer/log/code.mjs
+++ b/deps/v8/tools/system-analyzer/log/code.mjs
@@ -156,7 +156,7 @@ export class CodeLogEntry extends CodeLikeLogEntry {
   }
 
   get variants() {
-    const entries = Array.from(this.entry?.func?.codeEntries ?? []);
+    const entries = Array.from(this.entry?.sfi?.codeEntries ?? []);
     return entries.map(each => each.logEntry);
   }
 
diff --git a/deps/v8/tools/system-analyzer/processor.mjs b/deps/v8/tools/system-analyzer/processor.mjs
index c4cd1f9915c565..65f0c7737c5069 100644
--- a/deps/v8/tools/system-analyzer/processor.mjs
+++ b/deps/v8/tools/system-analyzer/processor.mjs
@@ -115,8 +115,6 @@ export class Processor extends LogReader {
         parsers: [this.parseAddress, this.parseAddress],
         processor: this.processCodeMove
       },
-      'code-delete':
-          {parsers: [this.parseAddress], processor: this.processCodeDelete},
       'code-source-info': {
         parsers: [
           this.parseAddress, parseInt, parseInt, parseInt, parseString,
@@ -141,7 +139,7 @@ export class Processor extends LogReader {
       },
       'sfi-move': {
         parsers: [this.parseAddress, this.parseAddress],
-        processor: this.processFunctionMove
+        processor: this.processSFIMove
       },
       'tick': {
         parsers: [
@@ -359,15 +357,15 @@ export class Processor extends LogReader {
     this._lastTimestamp = timestamp;
     let profilerEntry;
     let stateName = '';
-    if (maybe_func.length) {
-      const funcAddr = this.parseAddress(maybe_func[0]);
+    if (type != 'RegExp' && maybe_func.length) {
+      const sfiAddr = this.parseAddress(maybe_func[0]);
       stateName = maybe_func[1] ?? '';
       const state = Profile.parseState(maybe_func[1]);
       profilerEntry = this._profile.addFuncCode(
-          type, nameAndPosition, timestamp, start, size, funcAddr, state);
+          type, nameAndPosition, timestamp, start, size, sfiAddr, state);
     } else {
-      profilerEntry = this._profile.addAnyCode(
-          type, nameAndPosition, timestamp, start, size);
+      profilerEntry =
+          this._profile.addCode(type, nameAndPosition, timestamp, start, size);
     }
     const name = nameAndPosition.slice(0, nameAndPosition.indexOf(' '));
     this._lastCodeLogEntry = new CodeLogEntry(
@@ -434,8 +432,8 @@ export class Processor extends LogReader {
     this._profile.deleteCode(start);
   }
 
-  processFunctionMove(from, to) {
-    this._profile.moveFunc(from, to);
+  processSFIMove(from, to) {
+    this._profile.moveSharedFunctionInfo(from, to);
   }
 
   processTick(
@@ -514,7 +512,7 @@ export class Processor extends LogReader {
   formatProfileEntry(profileEntry, line, column) {
     if (!profileEntry) return '<unknown>';
     if (profileEntry.type === 'Builtin') return profileEntry.name;
-    const name = profileEntry.func.getName();
+    const name = profileEntry.sfi.getName();
     const array = this._formatPCRegexp.exec(name);
     const formatted =
         (array === null) ? name : profileEntry.getState() + array[1];
diff --git a/deps/v8/tools/system-analyzer/view/profiler-panel.mjs b/deps/v8/tools/system-analyzer/view/profiler-panel.mjs
index 868a488c850d54..73d8d51ae64507 100644
--- a/deps/v8/tools/system-analyzer/view/profiler-panel.mjs
+++ b/deps/v8/tools/system-analyzer/view/profiler-panel.mjs
@@ -204,8 +204,8 @@ DOM.defineCustomElement('view/profiler-panel',
     const secondaryCodeEntries = [];
     const deopts = [];
     const codeCreation = typeof mainCode == 'number' ? [] : [mainCode.logEntry];
-    if (mainCode.func?.codeEntries.size > 1) {
-      for (let dynamicCode of mainCode.func.codeEntries) {
+    if (mainCode.sfi?.codeEntries.size > 1) {
+      for (let dynamicCode of mainCode.sfi.codeEntries) {
         for (let related of dynamicCode.logEntry.relatedEntries()) {
           if (related instanceof DeoptLogEntry) deopts.push(related);
         }
diff --git a/deps/v8/tools/system-analyzer/view/script-panel.mjs b/deps/v8/tools/system-analyzer/view/script-panel.mjs
index 60a87aa142d653..9872a94f07f873 100644
--- a/deps/v8/tools/system-analyzer/view/script-panel.mjs
+++ b/deps/v8/tools/system-analyzer/view/script-panel.mjs
@@ -229,17 +229,16 @@ class ToolTipTableBuilder {
   }
 
   addRow(name, subtypeName, entries) {
-      const tr = DOM.tr();
-      tr.appendChild(DOM.td(name));
-      tr.appendChild(DOM.td(subtypeName));
-      tr.appendChild(DOM.td(entries.length));
-      const button =
-          DOM.button('🔎', this._scriptPanel.showToolTipEntriesHandler);
-      button.title =
-          `Show all ${entries.length} ${name || subtypeName} entries.`
-      button.data = entries;
-      tr.appendChild(DOM.td(button));
-      this.tableNode.appendChild(tr);
+    const tr = DOM.tr();
+    tr.appendChild(DOM.td(name));
+    tr.appendChild(DOM.td(subtypeName));
+    tr.appendChild(DOM.td(entries.length));
+    const button =
+        DOM.button('🔎', this._scriptPanel.showToolTipEntriesHandler);
+    button.title = `Show all ${entries.length} ${name || subtypeName} entries.`
+    button.data = entries;
+    tr.appendChild(DOM.td(button));
+    this.tableNode.appendChild(tr);
   }
 }
 
@@ -247,33 +246,33 @@ class SourcePositionIterator {
   _entries;
   _index = 0;
   constructor(sourcePositions) {
-      this._entries = sourcePositions;
+    this._entries = sourcePositions;
   }
 
   * forLine(lineIndex) {
-      this._findStart(lineIndex);
-      while (!this._done() && this._current().line === lineIndex) {
-        yield this._current();
-        this._next();
-      }
+    this._findStart(lineIndex);
+    while (!this._done() && this._current().line === lineIndex) {
+      yield this._current();
+      this._next();
+    }
   }
 
   _findStart(lineIndex) {
-      while (!this._done() && this._current().line < lineIndex) {
-        this._next();
-      }
+    while (!this._done() && this._current().line < lineIndex) {
+      this._next();
+    }
   }
 
   _current() {
-      return this._entries[this._index];
+    return this._entries[this._index];
   }
 
   _done() {
-      return this._index >= this._entries.length;
+    return this._index >= this._entries.length;
   }
 
   _next() {
-      this._index++;
+    this._index++;
   }
 }
 
@@ -281,11 +280,11 @@ function* lineIterator(source, startLine) {
   let current = 0;
   let line = startLine;
   while (current < source.length) {
-      const next = source.indexOf('\n', current);
-      if (next === -1) break;
-      yield [line, source.substring(current, next)];
-      line++;
-      current = next + 1;
+    const next = source.indexOf('\n', current);
+    if (next === -1) break;
+    yield [line, source.substring(current, next)];
+    line++;
+    current = next + 1;
   }
   if (current < source.length) yield [line, source.substring(current)];
 }
@@ -300,7 +299,7 @@ class LineBuilder {
     return map;
   })();
   static get colorMap() {
-      return this._colorMap;
+    return this._colorMap;
   }
 
   _script;
@@ -309,77 +308,75 @@ class LineBuilder {
   _sourcePositionToMarkers = new Map();
 
   constructor(panel, script) {
-      this._script = script;
-      this._clickHandler = panel.handleSourcePositionClick.bind(panel);
-      this._mouseoverHandler = panel.handleSourcePositionMouseOver.bind(panel);
+    this._script = script;
+    this._clickHandler = panel.handleSourcePositionClick.bind(panel);
+    this._mouseoverHandler = panel.handleSourcePositionMouseOver.bind(panel);
   }
 
   get sourcePositionToMarkers() {
-      return this._sourcePositionToMarkers;
+    return this._sourcePositionToMarkers;
   }
 
   async createScriptNode(startLine) {
-      const scriptNode = DOM.div('scriptNode');
-
-      // TODO: sort on script finalization.
-      this._script.sourcePositions.sort((a, b) => {
-        if (a.line === b.line) return a.column - b.column;
-        return a.line - b.line;
-      });
-
-      const sourcePositionsIterator =
-          new SourcePositionIterator(this._script.sourcePositions);
-      scriptNode.style.counterReset = `sourceLineCounter ${startLine - 1}`;
-      for (let [lineIndex, line] of lineIterator(
-               this._script.source, startLine)) {
-        scriptNode.appendChild(
-            this._createLineNode(sourcePositionsIterator, lineIndex, line));
-      }
-      if (this._script.sourcePositions.length !=
-          this._sourcePositionToMarkers.size) {
-        console.error('Not all SourcePositions were processed.');
-      }
-      return scriptNode;
+    const scriptNode = DOM.div('scriptNode');
+
+    // TODO: sort on script finalization.
+    this._script.sourcePositions.sort((a, b) => {
+      if (a.line === b.line) return a.column - b.column;
+      return a.line - b.line;
+    });
+
+    const sourcePositionsIterator =
+        new SourcePositionIterator(this._script.sourcePositions);
+    scriptNode.style.counterReset = `sourceLineCounter ${startLine - 1}`;
+    for (let [lineIndex, line] of lineIterator(
+             this._script.source, startLine)) {
+      scriptNode.appendChild(
+          this._createLineNode(sourcePositionsIterator, lineIndex, line));
+    }
+    if (this._script.sourcePositions.length !=
+        this._sourcePositionToMarkers.size) {
+      console.error('Not all SourcePositions were processed.');
+    }
+    return scriptNode;
   }
 
   _createLineNode(sourcePositionsIterator, lineIndex, line) {
-      const lineNode = DOM.span();
-      let columnIndex = 0;
-      for (const sourcePosition of sourcePositionsIterator.forLine(lineIndex)) {
-        const nextColumnIndex = sourcePosition.column - 1;
-        lineNode.appendChild(document.createTextNode(
-            line.substring(columnIndex, nextColumnIndex)));
-        columnIndex = nextColumnIndex;
-
-        lineNode.appendChild(
-            this._createMarkerNode(line[columnIndex], sourcePosition));
-        columnIndex++;
-      }
+    const lineNode = DOM.span();
+    let columnIndex = 0;
+    for (const sourcePosition of sourcePositionsIterator.forLine(lineIndex)) {
+      const nextColumnIndex = sourcePosition.column - 1;
+      lineNode.appendChild(document.createTextNode(
+          line.substring(columnIndex, nextColumnIndex)));
+      columnIndex = nextColumnIndex;
+
       lineNode.appendChild(
-          document.createTextNode(line.substring(columnIndex) + '\n'));
-      return lineNode;
+          this._createMarkerNode(line[columnIndex], sourcePosition));
+      columnIndex++;
+    }
+    lineNode.appendChild(
+        document.createTextNode(line.substring(columnIndex) + '\n'));
+    return lineNode;
   }
 
   _createMarkerNode(text, sourcePosition) {
-      const marker = document.createElement('mark');
-      this._sourcePositionToMarkers.set(sourcePosition, marker);
-      marker.textContent = text;
-      marker.sourcePosition = sourcePosition;
-      marker.onclick = this._clickHandler;
-      marker.onmouseover = this._mouseoverHandler;
-
-      const entries = sourcePosition.entries;
-      const groups = groupBy(entries, entry => entry.constructor);
-      if (groups.length > 1) {
-        const stops = gradientStopsFromGroups(
-            entries.length, '%', groups,
-            type => LineBuilder.colorMap.get(type));
-        marker.style.backgroundImage =
-            `linear-gradient(0deg,${stops.join(',')})`
-      } else {
-        marker.style.backgroundColor = LineBuilder.colorMap.get(groups[0].key)
-      }
+    const marker = document.createElement('mark');
+    this._sourcePositionToMarkers.set(sourcePosition, marker);
+    marker.textContent = text;
+    marker.sourcePosition = sourcePosition;
+    marker.onclick = this._clickHandler;
+    marker.onmouseover = this._mouseoverHandler;
+
+    const entries = sourcePosition.entries;
+    const groups = groupBy(entries, entry => entry.constructor);
+    if (groups.length > 1) {
+      const stops = gradientStopsFromGroups(
+          entries.length, '%', groups, type => LineBuilder.colorMap.get(type));
+      marker.style.backgroundImage = `linear-gradient(0deg,${stops.join(',')})`
+    } else {
+      marker.style.backgroundColor = LineBuilder.colorMap.get(groups[0].key)
+    }
 
-      return marker;
+    return marker;
   }
 }
diff --git a/deps/v8/tools/system-analyzer/view/timeline/timeline-track-tick.mjs b/deps/v8/tools/system-analyzer/view/timeline/timeline-track-tick.mjs
index a4b99e282ca61a..3491142799267f 100644
--- a/deps/v8/tools/system-analyzer/view/timeline/timeline-track-tick.mjs
+++ b/deps/v8/tools/system-analyzer/view/timeline/timeline-track-tick.mjs
@@ -89,14 +89,14 @@ class Annotations {
     if (start < 0) start = 0;
     if (end > rawFlames.length) end = rawFlames.length;
     const logEntry = this._logEntry;
-    // Also compare against the function, if any.
-    const func = logEntry.entry?.func ?? -1;
+    // Also compare against the SFI , if any.
+    const sfi = logEntry.entry?.sfi ?? -1;
     for (let i = start; i < end; i++) {
       const flame = rawFlames[i];
       const flameLogEntry = flame.logEntry;
       if (!flameLogEntry) continue;
       if (flameLogEntry !== logEntry) {
-        if (flameLogEntry.entry?.func !== func) continue;
+        if (flameLogEntry.entry?.sfi !== sfi) continue;
       }
       this._buffer += this._track._drawItem(flame, i, true);
     }
diff --git a/deps/v8/tools/testrunner/base_runner.py b/deps/v8/tools/testrunner/base_runner.py
index 28fc6684043438..f8c7729c574490 100644
--- a/deps/v8/tools/testrunner/base_runner.py
+++ b/deps/v8/tools/testrunner/base_runner.py
@@ -4,7 +4,7 @@
 
 from collections import OrderedDict, namedtuple
 from functools import reduce
-from os.path import dirname as up
+from pathlib import Path
 
 import json
 import logging
@@ -18,6 +18,7 @@
 from testrunner.build_config import BuildConfig
 from testrunner.local import testsuite
 from testrunner.local import utils
+from testrunner.local.variants import REQUIRED_BUILD_VARIABLES
 from testrunner.local.context import os_context
 from testrunner.test_config import TestConfig
 from testrunner.testproc import util
@@ -26,7 +27,7 @@
 from testrunner.utils.augmented_options import AugmentedOptions
 
 
-DEFAULT_OUT_GN = 'out.gn'
+DEFAULT_OUT_GN = Path('out.gn')
 
 # Map of test name synonyms to lists of test suites. Should be ordered by
 # expected runtimes (suites with slow test cases first). These groups are
@@ -122,8 +123,8 @@ class TestRunnerError(Exception):
 
 class BaseTestRunner(object):
   def __init__(self, basedir=None):
-    self.v8_root = up(up(up(__file__)))
-    self.basedir = basedir or self.v8_root
+    self.v8_root = Path(__file__).absolute().parent.parent.parent
+    self.basedir = Path(basedir or self.v8_root)
     self.outdir = None
     self.build_config = None
     self.mode_options = None
@@ -169,9 +170,9 @@ def execute(self, sys_args=None):
       args = self._parse_test_args(args)
 
       with os_context(self.target_os, self.options) as ctx:
+        self._setup_env()
         names = self._args_to_suite_names(args)
         tests = self._load_testsuite_generators(ctx, names)
-        self._setup_env()
         print(">>> Running tests for %s.%s" % (self.build_config.arch,
                                                self.mode_options.label))
         exit_code = self._do_execute(tests, args, ctx)
@@ -209,7 +210,7 @@ def _add_parser_default_options(self, parser):
     parser.add_option("--shell-dir", help="DEPRECATED! Executables from build "
                       "directory will be used")
     parser.add_option("--test-root", help="Root directory of the test suites",
-                      default=os.path.join(self.basedir, 'test'))
+                      default=self.basedir / 'test')
     parser.add_option("--total-timeout-sec", default=0, type="int",
                       help="How long should fuzzer run")
     parser.add_option("--swarming", default=False, action="store_true",
@@ -298,6 +299,9 @@ def _add_parser_options(self, parser):
   def _parse_args(self, parser, sys_args):
     options, args = parser.parse_args(sys_args)
 
+    options.test_root = Path(options.test_root)
+    options.outdir = Path(options.outdir)
+
     if options.arch and ',' in options.arch:  # pragma: no cover
       print('Multiple architectures are deprecated')
       raise TestRunnerError()
@@ -326,15 +330,20 @@ def _load_build_config(self):
       print(self.build_config)
 
     # Represents the OS where tests are run on. Same as host OS except for
-    # Android, which is determined by build output.
+    # Android and iOS, which are determined by build output.
     if self.build_config.is_android:
       self.target_os = 'android'
+    elif self.build_config.is_ios:
+      self.target_os = 'ios'
     else:
       self.target_os = utils.GuessOS()
 
+    # Verify integrity between build variables and variant configs.
+    self.build_config.ensure_vars(REQUIRED_BUILD_VARIABLES)
+
   def _do_load_build_config(self, outdir):
-    build_config_path = os.path.join(outdir, "v8_build_config.json")
-    if not os.path.exists(build_config_path):
+    build_config_path = outdir / "v8_build_config.json"
+    if not build_config_path.exists():
       if self.options.verbose:
         print("Didn't find build config: %s" % build_config_path)
       raise TestRunnerError()
@@ -347,7 +356,7 @@ def _do_load_build_config(self, outdir):
               % build_config_path)
         raise TestRunnerError()
 
-    return BuildConfig(build_config_json, self.options)
+    return BuildConfig(build_config_json)
 
   # Returns possible build paths in order:
   # gn
@@ -361,26 +370,25 @@ def outdirs():
 
       yield self.options.outdir
 
-      if os.path.basename(self.options.outdir) != 'build':
-        yield os.path.join(self.options.outdir, 'build')
+      if self.options.outdir.name != 'build':
+        yield self.options.outdir / 'build'
 
     for outdir in outdirs():
-      yield os.path.join(self.basedir, outdir)
+      yield self.basedir / outdir
 
   def _get_gn_outdir(self):
-    gn_out_dir = os.path.join(self.basedir, DEFAULT_OUT_GN)
+    gn_out_dir = self.basedir / DEFAULT_OUT_GN
     latest_timestamp = -1
     latest_config = None
-    for gn_config in os.listdir(gn_out_dir):
-      gn_config_dir = os.path.join(gn_out_dir, gn_config)
-      if not os.path.isdir(gn_config_dir):
+    for gn_config_dir in gn_out_dir.iterdir():
+      if not gn_config_dir.is_dir():
         continue
-      if os.path.getmtime(gn_config_dir) > latest_timestamp:
-        latest_timestamp = os.path.getmtime(gn_config_dir)
-        latest_config = gn_config
+      if gn_config_dir.stat().st_mtime > latest_timestamp:
+        latest_timestamp = gn_config_dir.stat().st_mtime
+        latest_config = gn_config_dir.name
     if latest_config:
       print(">>> Latest GN build found: %s" % latest_config)
-      return os.path.join(DEFAULT_OUT_GN, latest_config)
+      return DEFAULT_OUT_GN / latest_config
 
   def _custom_debug_mode(self):
     custom_debug_flags = ["--nohard-abort"]
@@ -396,7 +404,7 @@ def _custom_debug_mode(self):
     )
 
   def _process_default_options(self):
-    if self.build_config.is_debug:
+    if self.build_config.debugging_features:
       self.mode_options = self._custom_debug_mode()
     elif self.build_config.dcheck_always_on:
       self.mode_options = TRY_RELEASE_MODE
@@ -450,7 +458,7 @@ def _setup_env(self):
         asan_options.append('detect_stack_use_after_return=0')
       os.environ['ASAN_OPTIONS'] = ":".join(asan_options)
 
-    if self.build_config.cfi_vptr:
+    if self.build_config.cfi:
       os.environ['UBSAN_OPTIONS'] = ":".join([
         'print_stacktrace=1',
         'print_summary=1',
@@ -458,7 +466,7 @@ def _setup_env(self):
         symbolizer_option,
       ])
 
-    if self.build_config.ubsan_vptr:
+    if self.build_config.ubsan:
       os.environ['UBSAN_OPTIONS'] = ":".join([
         'print_stacktrace=1',
         symbolizer_option,
@@ -468,11 +476,8 @@ def _setup_env(self):
       os.environ['MSAN_OPTIONS'] = symbolizer_option
 
     if self.build_config.tsan:
-      suppressions_file = os.path.join(
-          self.basedir,
-          'tools',
-          'sanitizers',
-          'tsan_suppressions.txt')
+      suppressions_file = (
+          self.basedir / 'tools' / 'sanitizers' / 'tsan_suppressions.txt')
       os.environ['TSAN_OPTIONS'] = " ".join([
         symbolizer_option,
         'suppressions=%s' % suppressions_file,
@@ -483,20 +488,17 @@ def _setup_env(self):
       ])
 
   def _get_external_symbolizer_option(self):
-    external_symbolizer_path = os.path.join(
-        self.basedir,
-        'third_party',
-        'llvm-build',
-        'Release+Asserts',
-        'bin',
-        'llvm-symbolizer',
-    )
+    external_symbolizer_path = (
+        self.basedir / 'third_party' / 'llvm-build' / 'Release+Asserts' /
+        'bin' / 'llvm-symbolizer')
 
     if utils.IsWindows():
+      external_symbolizer_path = external_symbolizer_path.with_suffix('.exe')
+
       # Quote, because sanitizers might confuse colon as option separator.
-      external_symbolizer_path = '"%s.exe"' % external_symbolizer_path
+      external_symbolizer_path = f'"{external_symbolizer_path}"'
 
-    return 'external_symbolizer_path=%s' % external_symbolizer_path
+    return f'external_symbolizer_path={external_symbolizer_path}'
 
   def _parse_test_args(self, args):
     if not args:
@@ -528,7 +530,7 @@ def _load_testsuite_generators(self, ctx, names):
       if self.options.verbose:
         print('>>> Loading test suite: %s' % name)
       suite = testsuite.TestSuite.Load(
-          ctx, os.path.join(self.options.test_root, name), test_config)
+          ctx, self.options.test_root / name, test_config)
 
       if self._is_testsuite_supported(suite):
         tests = suite.load_tests_from_disk(variables)
@@ -541,119 +543,63 @@ def _is_testsuite_supported(self, suite):
     instances (see NumFuzzer for usage)."""
     return True
 
+  @property
+  def _no_simd_hardware(self):
+    # TODO(liviurau): Add some tests.
+    # We try to find all the reasons why we have no_simd.
+    if any(i in self.options.extra_flags for i in [
+        '--noenable-sse3', '--no-enable-sse3', '--noenable-ssse3',
+        '--no-enable-ssse3', '--noenable-sse4-1', '--no-enable-sse4_1'
+    ]):
+      return True
+
+    # Set no_simd_hardware on architectures without Simd enabled.
+    if (self.build_config.arch == 'mips64el' and
+        not self.build_config.simd_mips):
+      return True
+
+    if self.build_config.arch == 'loong64':
+      return True
+
+    # S390 hosts without VEF1 do not support Simd.
+    if (self.build_config.arch == 's390x' and
+        not self.build_config.simulator_run and
+        not utils.IsS390SimdSupported()):
+      return True
+
+    # Ppc64 processors earlier than POWER9 do not support Simd instructions
+    if (self.build_config.arch == 'ppc64' and
+        not self.build_config.simulator_run and
+        utils.GuessPowerProcessorVersion() < 9):
+      return True
+
+    return False
+
   def _get_statusfile_variables(self):
-    return {
-        "arch":
-            self.build_config.arch,
-        "asan":
-            self.build_config.asan,
-        "byteorder":
-            sys.byteorder,
-        "cfi_vptr":
-            self.build_config.cfi_vptr,
-        "code_comments":
-            self.build_config.code_comments,
-        "component_build":
-            self.build_config.component_build,
-        "conservative_stack_scanning":
-            self.build_config.conservative_stack_scanning,
-        "control_flow_integrity":
-            self.build_config.control_flow_integrity,
-        "concurrent_marking":
-            self.build_config.concurrent_marking,
-        "single_generation":
-            self.build_config.single_generation,
-        "dcheck_always_on":
-            self.build_config.dcheck_always_on,
-        "debug_code":
-            self.build_config.debug_code,
-        "deopt_fuzzer":
-            False,
-        "disassembler":
-            self.build_config.disassembler,
-        "endurance_fuzzer":
-            False,
-        "gc_fuzzer":
-            False,
-        "gc_stress":
-            False,
-        "gdbjit":
-            self.build_config.gdbjit,
-        # TODO(jgruber): Note this rename from maglev to has_maglev is required
-        # to avoid a name clash with the "maglev" variant. See also the TODO in
-        # statusfile.py (this really shouldn't be needed).
-        "has_maglev":
-            self.build_config.maglev,
-        "has_turbofan":
-            self.build_config.turbofan,
-        "has_webassembly":
-            self.build_config.webassembly,
-        "isolates":
-            self.options.isolates,
-        "is_clang":
-            self.build_config.is_clang,
-        "is_clang_coverage":
-            self.build_config.is_clang_coverage,
-        "is_debug":
-            self.build_config.is_debug,
-        "is_DEBUG_defined":
-            self.build_config.is_DEBUG_defined,
-        "is_full_debug":
-            self.build_config.is_full_debug,
-        "interrupt_fuzzer":
-            False,
-        "jitless_build_mode":
-            self.build_config.jitless_build_mode,
-        "mips_arch_variant":
-            self.build_config.mips_arch_variant,
-        "mode":
-            self.mode_options.status_mode,
-        "msan":
-            self.build_config.msan,
-        "no_harness":
-            self.options.no_harness,
-        "no_i18n":
-            self.build_config.no_i18n,
-        "no_simd_hardware":
-            self.build_config.no_simd_hardware,
-        "novfp3":
-            False,
-        "optimize_for_size":
-            "--optimize-for-size" in self.options.extra_flags,
-        "predictable":
-            self.build_config.predictable,
-        "simd_mips":
-            self.build_config.simd_mips,
-        "simulator_run":
-            self.build_config.simulator_run
-            and not self.options.dont_skip_simulator_slow_tests,
-        "slow_dchecks":
-            self.build_config.slow_dchecks,
-        "system":
-            self.target_os,
-        "third_party_heap":
-            self.build_config.third_party_heap,
-        "tsan":
-            self.build_config.tsan,
-        "ubsan_vptr":
-            self.build_config.ubsan_vptr,
-        "verify_csa":
-            self.build_config.verify_csa,
-        "verify_heap":
-            self.build_config.verify_heap,
-        "lite_mode":
-            self.build_config.lite_mode,
-        "pointer_compression":
-            self.build_config.pointer_compression,
-        "pointer_compression_shared_cage":
-            self.build_config.pointer_compression_shared_cage,
-        "no_js_shared_memory":
-            self.build_config.no_js_shared_memory,
-        "sandbox":
-            self.build_config.sandbox,
-        "dict_property_const_tracking":
-            self.build_config.dict_property_const_tracking,
-    }
+    """Returns all attributes accessible in status files.
+
+    All build-time flags from V8's BUILD.gn file as defined by the action
+    v8_dump_build_config can be accessed in status files.
+    """
+    variables = dict(self.build_config.items())
+    variables.update({
+        "byteorder": sys.byteorder,
+        "deopt_fuzzer": False,
+        "endurance_fuzzer": False,
+        "gc_fuzzer": False,
+        "gc_stress": False,
+        "isolates": self.options.isolates,
+        "interrupt_fuzzer": False,
+        "mode": self.mode_options.status_mode,
+        "no_harness": self.options.no_harness,
+        "no_simd_hardware": self._no_simd_hardware,
+        "novfp3": False,
+        "optimize_for_size": "--optimize-for-size" in self.options.extra_flags,
+        "simulator_run": variables["simulator_run"]
+                         and not self.options.dont_skip_simulator_slow_tests,
+        "system": self.target_os,
+    })
+    return variables
 
   def _runner_flags(self):
     """Extra default flags specific to the test runner implementation."""
@@ -670,12 +616,13 @@ def _create_test_config(self):
         isolates=self.options.isolates,
         mode_flags=self.mode_options.flags + self._runner_flags(),
         no_harness=self.options.no_harness,
-        noi18n=self.build_config.no_i18n,
+        noi18n=not self.build_config.i18n,
         random_seed=self.options.random_seed,
         run_skipped=self.options.run_skipped,
         shard_count=shard_count,
         shard_id=shard_id,
         shell_dir=self.outdir,
+        target_os=self.target_os,
         timeout=timeout,
         verbose=self.options.verbose,
         regenerate_expected_files=self.options.regenerate_expected_files,
diff --git a/deps/v8/tools/testrunner/build_config.py b/deps/v8/tools/testrunner/build_config.py
index 5868298a1c6b26..9da2df8759f076 100644
--- a/deps/v8/tools/testrunner/build_config.py
+++ b/deps/v8/tools/testrunner/build_config.py
@@ -2,178 +2,69 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-from testrunner.local import utils
-
 # Increase the timeout for these:
 SLOW_ARCHS = [
     "arm", "arm64", "mips64", "mips64el", "s390", "s390x", "riscv32", "riscv64",
     "loong64"
 ]
 
+# Timeout scale factor per build flag.
+SCALE_FACTOR = dict(
+    full_debug=4,
+    lite_mode=2,
+    tsan=2,
+    use_sanitizer=1.5,
+    verify_predictable=4,
+)
 
-class BuildConfig(object):
-
-  def __init__(self, build_config, options):
-    self.options = options
-    # In V8 land, GN's x86 is called ia32.
-    if build_config['v8_target_cpu'] == 'x86':
-      self.arch = 'ia32'
-    else:
-      self.arch = build_config['v8_target_cpu']
-
-    self.asan = build_config['is_asan']
-    self.cfi_vptr = build_config['is_cfi']
-    self.code_comments = build_config['v8_code_comments']
-    self.component_build = build_config['is_component_build']
-    self.concurrent_marking = build_config['v8_enable_concurrent_marking']
-    self.conservative_stack_scanning = build_config[
-        'v8_enable_conservative_stack_scanning']
-    self.control_flow_integrity = build_config['v8_control_flow_integrity']
-    self.dcheck_always_on = build_config['dcheck_always_on']
-    self.debug_code = build_config['v8_enable_debug_code']
-    self.dict_property_const_tracking = build_config[
-        'v8_dict_property_const_tracking']
-    self.disassembler = build_config['v8_enable_disassembler']
-    self.gdbjit = build_config['v8_enable_gdbjit']
-    self.is_android = build_config['is_android']
-    self.is_clang = build_config['is_clang']
-    self.is_clang_coverage = build_config['is_clang_coverage']
-    self.is_debug = build_config['is_debug']
-    self.is_DEBUG_defined = build_config['is_DEBUG_defined']
-    self.is_full_debug = build_config['is_full_debug']
-    self.lite_mode = build_config['v8_enable_lite_mode']
-    self.maglev = build_config['v8_enable_maglev']
-    self.msan = build_config['is_msan']
-    self.no_i18n = not build_config['v8_enable_i18n_support']
-    self.pointer_compression = build_config['v8_enable_pointer_compression']
-    self.pointer_compression_shared_cage = build_config[
-        'v8_enable_pointer_compression_shared_cage']
-    self.predictable = build_config['v8_enable_verify_predictable']
-    self.sandbox = build_config['v8_enable_sandbox']
-    self.shared_ro_heap = build_config['v8_enable_shared_ro_heap']
-    self.simulator_run = (
-        build_config['target_cpu'] != build_config['v8_target_cpu'])
-    self.single_generation = build_config['v8_enable_single_generation']
-    self.slow_dchecks = build_config['v8_enable_slow_dchecks']
-    self.third_party_heap = build_config['v8_enable_third_party_heap']
-    self.tsan = build_config['is_tsan']
-    self.turbofan = build_config['v8_enable_turbofan']
-    # TODO(machenbach): We only have ubsan not ubsan_vptr.
-    self.ubsan_vptr = build_config['is_ubsan_vptr']
-    self.verify_csa = build_config['v8_enable_verify_csa']
-    self.verify_heap = build_config['v8_enable_verify_heap']
-    self.webassembly = build_config['v8_enable_webassembly']
-    self.write_barriers = not build_config['v8_disable_write_barriers']
-    # TODO(jgruber): Don't rename once it's no longer necessary to avoid
-    # conflicts with test variant names.
-    self.jitless_build_mode = build_config['v8_jitless']
-    # Export only for MIPS target
-    if self.arch in ['mips64', 'mips64el']:
-      self._mips_arch_variant = build_config['mips_arch_variant']
-      self.mips_use_msa = build_config['mips_use_msa']
+INITIALIZATION_ERROR = f"""
+Missing property '%s'. If you see this error in testing, you might need
+to add the property to tools/testrunner/testdata/v8_build_config.json. If
+you see this error in production, ensure to add the property to the
+v8_dump_build_config action in V8's top-level BUILD.gn file.
+"""
 
-  @property
-  def use_sanitizer(self):
-    return (self.asan or self.cfi_vptr or self.msan or self.tsan or
-            self.ubsan_vptr)
 
-  @property
-  def no_js_shared_memory(self):
-    return (not self.shared_ro_heap) or (
-        self.pointer_compression and
-        not self.pointer_compression_shared_cage) or (not self.write_barriers)
-
-  @property
-  def is_mips_arch(self):
-    return self.arch in ['mips64', 'mips64el']
-
-  @property
-  def simd_mips(self):
-    return (self.is_mips_arch and self._mips_arch_variant == "r6" and
-            self.mips_use_msa)
-
-  @property
-  def mips_arch_variant(self):
-    return (self.is_mips_arch and self._mips_arch_variant)
+class BuildConfig(object):
+  """Enables accessing all build-time flags as set in V8's BUILD.gn file.
 
-  @property
-  def no_simd_hardware(self):
-    # TODO(liviurau): Add some tests and refactor the logic here.
-    # We try to find all the reasons why we have no_simd.
-    no_simd_hardware = any(i in self.options.extra_flags for i in [
-        '--noenable-sse3', '--no-enable-sse3', '--noenable-ssse3',
-        '--no-enable-ssse3', '--noenable-sse4-1', '--no-enable-sse4_1'
-    ])
+  All flags are auto-generated based on the output of V8's
+  v8_dump_build_config action.
+  """
 
-    # Set no_simd_hardware on architectures without Simd enabled.
-    if self.arch == 'mips64el':
-      no_simd_hardware = not self.simd_mips
+  def __init__(self, build_config):
+    for key, value in build_config.items():
+      setattr(self, key, value)
 
-    if self.arch == 'loong64'  or \
-       self.arch == 'riscv32':
-      no_simd_hardware = True
+    self.keys = list(build_config.keys())
 
-    # S390 hosts without VEF1 do not support Simd.
-    if self.arch == 's390x' and \
-       not self.simulator_run and \
-       not utils.IsS390SimdSupported():
-      no_simd_hardware = True
+    bool_options = [key for key, value in self.items() if value is True]
+    string_options = [
+      f'{key}="{value}"'
+      for key, value in self.items() if value and isinstance(value, str)]
+    self._str_rep = ', '.join(sorted(bool_options + string_options))
 
-    # Ppc64 processors earlier than POWER9 do not support Simd instructions
-    if self.arch == 'ppc64' and \
-       not self.simulator_run and \
-       utils.GuessPowerProcessorVersion() < 9:
-      no_simd_hardware = True
+  def items(self):
+    for key in self.keys:
+      yield key, getattr(self, key)
 
-    return no_simd_hardware
+  def ensure_vars(self, build_vars):
+    for var in build_vars:
+      if var not in self.keys:
+        raise Exception(INITIALIZATION_ERROR % var)
 
   def timeout_scalefactor(self, initial_factor):
     """Increases timeout for slow build configurations."""
-    factors = dict(
-        lite_mode=2,
-        predictable=4,
-        tsan=2,
-        use_sanitizer=1.5,
-        is_full_debug=4,
-    )
     result = initial_factor
-    for k, v in factors.items():
-      if getattr(self, k, False):
-        result *= v
+    for key, value in SCALE_FACTOR.items():
+      try:
+        if getattr(self, key):
+          result *= value
+      except AttributeError:
+        raise Exception(INITIALIZATION_ERROR % key)
     if self.arch in SLOW_ARCHS:
       result *= 4.5
     return result
 
   def __str__(self):
-    attrs = [
-        'asan',
-        'cfi_vptr',
-        'code_comments',
-        'control_flow_integrity',
-        'dcheck_always_on',
-        'debug_code',
-        'dict_property_const_tracking',
-        'disassembler',
-        'gdbjit',
-        'is_debug',
-        'is_DEBUG_defined',
-        'jitless_build_mode',
-        'lite_mode',
-        'maglev',
-        'msan',
-        'no_i18n',
-        'pointer_compression',
-        'pointer_compression_shared_cage',
-        'predictable',
-        'sandbox',
-        'slow_dchecks',
-        'third_party_heap',
-        'tsan',
-        'turbofan',
-        'ubsan_vptr',
-        'verify_csa',
-        'verify_heap',
-        'webassembly',
-    ]
-    detected_options = [attr for attr in attrs if getattr(self, attr, False)]
-    return ', '.join(detected_options)
+    return self._str_rep
diff --git a/deps/v8/tools/testrunner/local/android.py b/deps/v8/tools/testrunner/local/android.py
index 213f4baa9ab95e..f35ec913aa197e 100644
--- a/deps/v8/tools/testrunner/local/android.py
+++ b/deps/v8/tools/testrunner/local/android.py
@@ -11,11 +11,18 @@
 import sys
 import re
 
+from pathlib import Path
+
 BASE_DIR = os.path.normpath(
     os.path.join(os.path.dirname(__file__), '..', '..', '..'))
 ANDROID_DIR = os.path.join(BASE_DIR, 'build', 'android')
 DEVICE_DIR = '/data/local/tmp/v8/'
 
+FILTER_LINES_EXPRESSIONS = [
+  r'WARNING: linker: .+ unsupported flags DT_FLAGS_1=0x8000001',
+  r'WARNING: linker: .+ unused DT entry:.*type 0x70000001 arg 0x0.*',
+]
+FILTER_LINES_EXPRESSIONS = [re.compile(exp) for exp in FILTER_LINES_EXPRESSIONS]
 
 class TimeoutException(Exception):
   def __init__(self, timeout, output=None):
@@ -109,6 +116,13 @@ def push_file(self, host_dir, file_name, target_rel='.',
     self.device.adb.Shell('cp %s %s' % (file_on_device_tmp, file_on_device))
     self.pushed.add(file_on_host)
 
+  def push_files_rec(self, host_dir, target_rel='.'):
+    """As above, but push the whole directory tree under host_dir."""
+    root = Path(host_dir)
+    for entry in root.rglob('*'):
+      if entry.is_file():
+        self.push_file(host_dir, entry.relative_to(root), target_rel)
+
   def push_executable(self, shell_dir, target_dir, binary):
     """Push files required to run a V8 executable.
 
@@ -141,6 +155,12 @@ def push_executable(self, shell_dir, target_dir, binary):
         skip_if_missing=True,
     )
 
+  def filter_line(self, line):
+    for exp in FILTER_LINES_EXPRESSIONS:
+      if exp.match(line):
+        return False
+    return True
+
   def run(self, target_dir, binary, args, rel_path, timeout, env=None,
           logcat_file=False):
     """Execute a command on the device's shell.
@@ -167,7 +187,8 @@ def run_inner():
             timeout=timeout,
             retries=0,
         )
-        return '\n'.join(output)
+        # Return output without linker warnings (https://crbug.com/1454414).
+        return '\n'.join(filter(self.filter_line, output))
       except device_errors.AdbCommandFailedError as e:
         raise CommandFailedException(e.status, e.output)
       except device_errors.CommandTimeoutError as e:
diff --git a/deps/v8/tools/testrunner/local/command.py b/deps/v8/tools/testrunner/local/command.py
index af0981e83d4bd0..c8f390b395789a 100644
--- a/deps/v8/tools/testrunner/local/command.py
+++ b/deps/v8/tools/testrunner/local/command.py
@@ -3,6 +3,8 @@
 # found in the LICENSE file.
 
 from contextlib import contextmanager
+from pathlib import Path
+
 import logging
 import os
 import re
@@ -16,8 +18,7 @@
 from ..objects import output
 from ..local.pool import AbortException
 
-BASE_DIR = os.path.normpath(
-    os.path.join(os.path.dirname(os.path.abspath(__file__)), '..' , '..', '..'))
+BASE_DIR = Path(__file__).resolve().parent.parent.parent.parent
 
 SEM_INVALID_VALUE = -1
 SEM_NOGPFAULTERRORBOX = 0x0002  # Microsoft Platform SDK WinBase.h
@@ -88,14 +89,17 @@ def __init__(self, shell, args=None, cmd_prefix=None, timeout=60, env=None,
     """
     assert(timeout > 0)
 
-    self.shell = shell
-    self.args = args or []
+    self.shell = Path(shell)
+    self.args = list(map(str, args or []))
     self.cmd_prefix = cmd_prefix or []
     self.timeout = timeout
     self.env = env or {}
     self.verbose = verbose
     self.handle_sigterm = handle_sigterm
 
+  def _result_overrides(self, returncode):
+    pass
+
   def execute(self):
     if self.verbose:
       print('# %s' % self)
@@ -115,6 +119,7 @@ def execute(self):
 
       timer.cancel()
 
+    self._result_overrides(process)
     return output.Output(
       process.returncode,
       timeout_occured[0],
@@ -180,7 +185,7 @@ def escape(part):
     return cmd
 
   def _to_args_list(self):
-    return self.cmd_prefix + [self.shell] + self.args
+    return list(map(str, self.cmd_prefix + [self.shell])) + self.args
 
 
 class PosixCommand(BaseCommand):
@@ -231,6 +236,64 @@ def taskkill_windows(process, verbose=False, force=True):
     logging.info('Return code: %d', tk.returncode)
 
 
+class IOSCommand(BaseCommand):
+
+  def __init__(self,
+               shell,
+               args=None,
+               cmd_prefix=None,
+               timeout=120,
+               env=None,
+               verbose=False,
+               test_case=None,
+               handle_sigterm=False):
+    """Initialize the command and set a large enough timeout required for runs
+    through the iOS Simulator.
+    """
+    super(IOSCommand, self).__init__(
+        shell,
+        args=args,
+        cmd_prefix=cmd_prefix,
+        timeout=timeout,
+        env=env,
+        verbose=verbose,
+        handle_sigterm=handle_sigterm)
+
+  def _result_overrides(self, process):
+    # TODO(crbug.com/1445694): if iossim returns with code 65, force a
+    # successful exit instead.
+    if (process.returncode == 65):
+      process.returncode = 0
+
+  def _start_process(self):
+    try:
+      return subprocess.Popen(
+          args=self._get_popen_args(),
+          stdout=subprocess.PIPE,
+          stderr=subprocess.PIPE,
+          env=self._get_env(),
+          shell=True,
+          # Make the new shell create its own process group. This allows to kill
+          # all spawned processes reliably (https://crbug.com/v8/8292).
+          preexec_fn=os.setsid,
+      )
+    except Exception as e:
+      sys.stderr.write('Error executing: %s\n' % self)
+      raise e
+
+  def _kill_process(self, process):
+    # Kill the whole process group (PID == GPID after setsid).
+    # First try a soft term to allow some feedback
+    os.killpg(process.pid, signal.SIGTERM)
+    # Give the process some time to cleanly terminate.
+    time.sleep(0.1)
+    # Forcefully kill processes.
+    os.killpg(process.pid, signal.SIGKILL)
+
+  def _to_args_list(self):
+    return list(map(str, self.cmd_prefix + [self.shell]))
+
+
 class WindowsCommand(BaseCommand):
   def _start_process(self, **kwargs):
     # Try to change the error mode to avoid dialogs on fatal errors. Don't
@@ -291,8 +354,8 @@ def execute(self, **additional_popen_kwargs):
     if self.verbose:
       print('# %s' % self)
 
-    shell_name = os.path.basename(self.shell)
-    shell_dir = os.path.dirname(self.shell)
+    shell_name = self.shell.name
+    shell_dir = self.shell.parent
 
     self.driver.push_executable(shell_dir, 'bin', shell_name)
     self.push_test_resources()
@@ -324,22 +387,22 @@ def execute(self, **additional_popen_kwargs):
 
   def push_test_resources(self):
     for abs_file in self.files_to_push:
-      abs_dir = os.path.dirname(abs_file)
-      file_name = os.path.basename(abs_file)
-      rel_dir = os.path.relpath(abs_dir, BASE_DIR)
+      abs_dir = abs_file.parent
+      file_name = abs_file.name
+      rel_dir = abs_dir.relative_to(BASE_DIR)
       self.driver.push_file(abs_dir, file_name, rel_dir)
 
 
 def args_with_relative_paths(args):
+  base_dir_str = re.escape(BASE_DIR.as_posix())
   rel_args = []
   files_to_push = []
-  find_path_re = re.compile(r'.*(%s/[^\'"]+).*' % re.escape(BASE_DIR))
+  find_path_re = re.compile(r'.*(%s/[^\'"]+).*' % base_dir_str)
   for arg in (args or []):
-    match = find_path_re.match(arg)
+    match = find_path_re.match(str(arg))
     if match:
-      files_to_push.append(match.group(1))
-    rel_args.append(
-        re.sub(r'(.*)%s/(.*)' % re.escape(BASE_DIR), r'\1\2', arg))
+      files_to_push.append(Path(match.group(1)).resolve())
+    rel_args.append(re.sub(r'(.*)%s/(.*)' % base_dir_str, r'\1\2', str(arg)))
   return rel_args, files_to_push
 
 
@@ -353,6 +416,8 @@ def setup(target_os, device):
   if target_os == 'android':
     AndroidCommand.driver = Driver.instance(device)
     Command = AndroidCommand
+  elif target_os == 'ios':
+    Command = IOSCommand
   elif target_os == 'windows':
     Command = WindowsCommand
   else:
diff --git a/deps/v8/tools/testrunner/local/context.py b/deps/v8/tools/testrunner/local/context.py
index 81a4d1bbe7185a..ae3975ed7d1d81 100644
--- a/deps/v8/tools/testrunner/local/context.py
+++ b/deps/v8/tools/testrunner/local/context.py
@@ -2,15 +2,15 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-from contextlib import contextmanager
 import os
 import signal
-
 import subprocess
 import sys
 
+from contextlib import contextmanager
+
 from ..local.android import Driver
-from .command import AndroidCommand, PosixCommand, WindowsCommand, taskkill_windows
+from .command import AndroidCommand, IOSCommand, PosixCommand, WindowsCommand, taskkill_windows
 from .pool import DefaultExecutionPool
 from ..testproc.util import list_processes_linux
 
@@ -31,6 +31,9 @@ def list_processes(self):
   def terminate_process(self, process):
     pass
 
+  def platform_shell(self, shell, args, outdir):
+    return outdir.resolve() / shell
+
 
 class LinuxContext(DefaultOSContext):
 
@@ -52,6 +55,9 @@ def __init__(self):
   def terminate_process(self, process):
     taskkill_windows(process, verbose=True, force=False)
 
+  def platform_shell(self, shell, args, outdir):
+    return outdir.resolve() / f'{shell}.exe'
+
 
 class AndroidOSContext(DefaultOSContext):
 
@@ -67,11 +73,36 @@ def handle_context(self, options):
       AndroidCommand.driver.tear_down()
 
 
+class IOSContext(DefaultOSContext):
+
+  def __init__(self):
+    super().__init__(IOSCommand)
+
+  def terminate_process(self, process):
+    os.kill(process.pid, signal.SIGTERM)
+
+  def platform_shell(self, shell, appargs, outdir):
+    # Rather than having to use a physical device (iPhone, iPad, etc), we use
+    # the iOS Simulator for the test runners in order to ease the job of
+    # builders and testers.
+    # At the moment Chromium's iossim tool is being used, which is a wrapper
+    # around 'simctl' macOS command utility.
+    iossim = outdir.resolve() / "iossim -d 'iPhone X' "
+
+    if isinstance(appargs, list):
+      appargs = ' '.join(map(str, appargs))
+    if appargs != "":
+      iossim = f'{iossim}-c '
+      appargs = '\"' + appargs + '\"'
+    app = outdir.resolve() / f'{shell}.app'
+    return f'{iossim}{appargs} {app}'
+
 # TODO(liviurau): Add documentation with diagrams to describe how context and
 # its components gets initialized and eventually teared down and how does it
 # interact with both tests and underlying platform specific concerns.
 def find_os_context_factory(target_os):
-  registry = dict(android=AndroidOSContext, windows=WindowsContext)
+  registry = dict(
+      android=AndroidOSContext, ios=IOSContext, windows=WindowsContext)
   default = LinuxContext
   return registry.get(target_os, default)
 
diff --git a/deps/v8/tools/testrunner/local/fake_testsuite/testcfg.py b/deps/v8/tools/testrunner/local/fake_testsuite/testcfg.py
index eced9ce8fc5472..597d27654999dc 100644
--- a/deps/v8/tools/testrunner/local/fake_testsuite/testcfg.py
+++ b/deps/v8/tools/testrunner/local/fake_testsuite/testcfg.py
@@ -3,6 +3,8 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
+from pathlib import Path
+
 from testrunner.local import testsuite, statusfile
 from testrunner.objects.testcase import TestCase
 
@@ -12,8 +14,8 @@ def _list_test_filenames(self):
 
   def list_tests(self):
     self.test_count_estimation = 2
-    fast = self._create_test("fast", self.suite)
-    slow = self._create_test("slow", self.suite)
+    fast = self._create_test(Path("fast"), self.suite)
+    slow = self._create_test(Path("slow"), self.suite)
 
     slow._statusfile_outcomes.append(statusfile.SLOW)
     yield fast
diff --git a/deps/v8/tools/testrunner/local/statusfile.py b/deps/v8/tools/testrunner/local/statusfile.py
index 04485936b61735..e2aeaf5dc7f469 100644
--- a/deps/v8/tools/testrunner/local/statusfile.py
+++ b/deps/v8/tools/testrunner/local/statusfile.py
@@ -28,6 +28,7 @@
 import os
 import re
 
+from testrunner.build_config import INITIALIZATION_ERROR
 from testrunner.local.variants import ALL_VARIANTS
 from testrunner.local.utils import Freeze
 
@@ -162,7 +163,8 @@ def _EvalExpression(exp, variables):
     return eval(exp, variables)
   except NameError as e:
     identifier = re.match("name '(.*)' is not defined", str(e)).group(1)
-    assert identifier == "variant", "Unknown identifier: %s" % identifier
+    # If it's not a variant expression, it points to a missing build flag.
+    assert identifier == "variant", INITIALIZATION_ERROR % identifier
     return VARIANT_EXPRESSION
 
 
diff --git a/deps/v8/tools/testrunner/local/testsuite.py b/deps/v8/tools/testrunner/local/testsuite.py
index 60d52e8d30134d..66ad7b575a2605 100644
--- a/deps/v8/tools/testrunner/local/testsuite.py
+++ b/deps/v8/tools/testrunner/local/testsuite.py
@@ -29,7 +29,9 @@
 import imp
 import itertools
 import os
+
 from contextlib import contextmanager
+from pathlib import Path
 
 from . import statusfile
 from . import utils
@@ -106,21 +108,14 @@ def _filename_to_testname(self, filename):
     logic before the test creation."""
     return filename
 
-  # TODO: not needed for every TestLoader, extract it into a subclass.
-  def _path_to_name(self, path):
-    if utils.IsWindows():
-      return path.replace(os.path.sep, "/")
-
-    return path
-
   def _create_test(self, path, suite, **kwargs):
     """Converts paths into test objects using the given options"""
-    return self.test_class(suite, path, self._path_to_name(path), **kwargs)
+    return self.test_class(suite, path, path.as_posix(), **kwargs)
 
   def list_tests(self):
     """Loads and returns the test objects for a TestSuite"""
     # TODO: detect duplicate tests.
-    for filename in self._list_test_filenames():
+    for filename in map(Path, self._list_test_filenames()):
       if self._should_filter_by_name(filename):
         continue
 
@@ -156,7 +151,7 @@ def extensions(self):
 
   def __find_extension(self, filename):
     for extension in self.extensions:
-      if filename.endswith(extension):
+      if filename.name.endswith(extension):
         return extension
 
     return False
@@ -166,10 +161,10 @@ def _should_filter_by_name(self, filename):
       return True
 
     for suffix in self.excluded_suffixes:
-      if filename.endswith(suffix):
+      if filename.name.endswith(suffix):
         return True
 
-    if os.path.basename(filename) in self.excluded_files:
+    if filename.name in self.excluded_files:
       return True
 
     return False
@@ -179,14 +174,14 @@ def _filename_to_testname(self, filename):
     if not extension:
       return filename
 
-    return filename[:-len(extension)]
+    return filename.parent / filename.name[:-len(extension)]
 
   def _to_relpath(self, abspath, test_root):
-    return os.path.relpath(abspath, test_root)
+    return abspath.relative_to(test_root)
 
   def _list_test_filenames(self):
     for test_dir in sorted(self.test_dirs):
-      test_root = os.path.join(self.test_root, test_dir)
+      test_root = self.test_root / test_dir
       for dirname, dirs, files in os.walk(test_root, followlinks=True):
         dirs.sort()
         for dir in dirs:
@@ -195,8 +190,7 @@ def _list_test_filenames(self):
 
         files.sort()
         for filename in files:
-          abspath = os.path.join(dirname, filename)
-
+          abspath = Path(dirname) / filename
           yield self._to_relpath(abspath, test_root)
 
 
@@ -247,13 +241,13 @@ def _load_testsuite_module(name, root):
 class TestSuite(object):
   @staticmethod
   def Load(ctx, root, test_config):
-    name = root.split(os.path.sep)[-1]
+    name = root.name
     with _load_testsuite_module(name, root) as module:
       return module.TestSuite(ctx, name, root, test_config)
 
   def __init__(self, ctx, name, root, test_config):
     self.name = name  # string
-    self.root = root  # string containing path
+    self.root = root  # pathlib path
     self.test_config = test_config
     self.tests = None  # list of TestCase objects
     self.statusfile = None
diff --git a/deps/v8/tools/testrunner/local/testsuite_test.py b/deps/v8/tools/testrunner/local/testsuite_test.py
index e2c34a55eee87f..aa0939fdc5d9a9 100755
--- a/deps/v8/tools/testrunner/local/testsuite_test.py
+++ b/deps/v8/tools/testrunner/local/testsuite_test.py
@@ -7,10 +7,11 @@
 import sys
 import unittest
 
+from pathlib import Path
+
 # Needed because the test runner contains relative imports.
-TOOLS_PATH = os.path.dirname(
-    os.path.dirname(os.path.dirname(os.path.abspath(__file__))))
-sys.path.append(TOOLS_PATH)
+TOOLS_PATH = Path(__file__).resolve().parents[2]
+sys.path.append(str(TOOLS_PATH))
 
 from testrunner.local.command import PosixCommand
 from testrunner.local.context import DefaultOSContext
@@ -21,8 +22,8 @@
 class TestSuiteTest(unittest.TestCase):
 
   def setUp(self):
-    test_dir = os.path.dirname(__file__)
-    self.test_root = os.path.join(test_dir, "fake_testsuite")
+    test_dir = Path(__file__).resolve().parent
+    self.test_root = test_dir / "fake_testsuite"
     self.test_config = TestConfig(
         command_prefix=[],
         extra_flags=[],
@@ -35,7 +36,8 @@ def setUp(self):
         run_skipped=False,
         shard_count=1,
         shard_id=0,
-        shell_dir='fake_testsuite/fake_d8',
+        shell_dir=Path('fake_testsuite/fake_d8'),
+        target_os='macos',
         timeout=10,
         verbose=False,
     )
diff --git a/deps/v8/tools/testrunner/local/variants.py b/deps/v8/tools/testrunner/local/variants.py
index e5344a488010da..9d2f87aa61f111 100644
--- a/deps/v8/tools/testrunner/local/variants.py
+++ b/deps/v8/tools/testrunner/local/variants.py
@@ -17,14 +17,37 @@
     "sparkplug": [["--sparkplug"]],
     "maglev": [["--maglev"]],
     "maglev_future": [["--maglev", "--maglev-future"]],
+    "maglev_no_turbofan": [[
+        "--maglev", "--no-turbofan",
+        "--optimize-on-next-call-optimizes-to-maglev"
+    ]],
     "stress_maglev": [[
         "--maglev", "--stress-maglev",
         "--optimize-on-next-call-optimizes-to-maglev"
     ]],
-    "turboshaft": [["--turboshaft"]],
+    "stress_maglev_future": [[
+        "--maglev", "--maglev-future", "--stress-maglev",
+        "--optimize-on-next-call-optimizes-to-maglev"
+    ]],
+    "stress_maglev_no_turbofan": [[
+        "--maglev", "--no-turbofan", "--stress-maglev",
+        "--optimize-on-next-call-optimizes-to-maglev"
+    ]],
+    # We test both the JS and Wasm Turboshaft pipelines under the same variant.
+    # For extended Wasm Turboshaft coverage, we add --no-liftoff to the options.
+    "turboshaft": [[
+        "--turboshaft",
+        "--turboshaft-future",
+        "--turboshaft-wasm",
+        "--no-liftoff",
+        # We need this to correctly bailout for call_indirect with subtyping
+        # until we turn it on by default, or remove the bailout.
+        "--wasm-final-types"
+    ]],
     "concurrent_sparkplug": [["--concurrent-sparkplug", "--sparkplug"]],
     "always_sparkplug": [["--always-sparkplug", "--sparkplug"]],
-    "minor_mc": [["--minor-mc"]],
+    "minor_ms": [["--minor-ms"]],
+    "concurrent_minor_ms": [["--concurrent-minor-ms-marking"]],
     "no_lfa": [["--no-lazy-feedback-allocation"]],
     # No optimization means disable all optimizations. OptimizeFunctionOnNextCall
     # would not force optimization too. It turns into a Nop. Please see
@@ -36,7 +59,7 @@
     # compilation. "Liftoff-only" and eager compilation is not a problem,
     # because test functions do typically not get optimized to TurboFan anyways.
     "nooptimization": [[
-        "--no-turbofan", "--liftoff", "--no-wasm-tier-up",
+        "--no-turbofan", "--no-maglev", "--liftoff", "--no-wasm-tier-up",
         "--no-wasm-lazy-compilation"
     ]],
     "slow_path": [["--force-slow-path"]],
@@ -98,14 +121,37 @@
     # stress_snapshot.
     "stress_snapshot": ["--expose-fast-api"],
     "stress": [
-        "--liftoff-only", "--wasm-speculative-inlining",
+        # 'stress' disables Liftoff, which conflicts with flags that require
+        # Liftoff support.
+        "--liftoff-only",
         "--wasm-dynamic-tiering"
     ],
     "sparkplug": ["--jitless", "--no-sparkplug"],
+    "turboshaft": [
+        # 'turboshaft' disables Liftoff, which conflicts with flags that require
+        # Liftoff support.
+        "--liftoff-only",
+        "--wasm-dynamic-tiering"
+    ],
     "concurrent_sparkplug": ["--jitless"],
     "maglev": ["--jitless", "--no-maglev"],
     "maglev_future": ["--jitless", "--no-maglev", "--no-maglev-future"],
+    "maglev_no_turbofan": [
+        "--jitless",
+        "--no-maglev",
+        "--turbofan",
+        "--always-turbofan",
+        "--stress-concurrent-inlining",
+    ],
     "stress_maglev": ["--jitless"],
+    "stress_maglev_future": ["--jitless", "--no-maglev", "--no-maglev-future"],
+    "stress_maglev_no_turbofan": [
+        "--jitless",
+        "--no-maglev",
+        "--turbofan",
+        "--always-turbofan",
+        "--stress-concurrent-inlining",
+    ],
     "always_sparkplug": ["--jitless", "--no-sparkplug"],
     "code_serializer": [
         "--cache=after-execute", "--cache=full-code-cache", "--cache=none"
@@ -115,6 +161,11 @@
         "--concurrent-recompilation", "--stress_concurrent_inlining",
         "--no-assert-types"
     ],
+    "concurrent_minor_ms": [
+        "--predictable", "--single_threaded_gc", "--single_threaded",
+        "--stress_snapshot", "--trace_gc_object_stats",
+        "--no-incremental-marking", "--no-concurrent-marking"
+    ],
 }
 
 # Flags that lead to a contradiction under certain build variables.
@@ -129,7 +180,7 @@
 # applies when the code_comments build variable is NOT set.
 INCOMPATIBLE_FLAGS_PER_BUILD_VARIABLE = {
     "!code_comments": ["--code-comments"],
-    "!is_DEBUG_defined": [
+    "!DEBUG_defined": [
         "--check_handle_count",
         "--code_stats",
         "--dump_wasm_module",
@@ -152,7 +203,6 @@
         "--trace_wasm_compiler",
         "--trace_wasm_decoder",
         "--trace_wasm_instances",
-        "--trace_wasm_interpreter",
         "--trace_wasm_lazy_compilation",
         "--trace_wasm_native_heap",
         "--trace_wasm_serialization",
@@ -171,11 +221,11 @@
     "!has_maglev": ["--maglev"],
     "!has_turbofan":
         kIncompatibleFlagsForNoTurbofan,
-    "jitless_build_mode":
+    "has_jitless":
         INCOMPATIBLE_FLAGS_PER_VARIANT["jitless"],
     "lite_mode": ["--max-semi-space-size=*"] +
                  INCOMPATIBLE_FLAGS_PER_VARIANT["jitless"],
-    "predictable": [
+    "verify_predictable": [
         "--parallel-compile-tasks-for-eager-toplevel",
         "--parallel-compile-tasks-for-lazy", "--concurrent-recompilation",
         "--stress-concurrent-allocation", "--stress-concurrent-inlining"
@@ -227,6 +277,11 @@ def _variant_order_key(v):
 ALL_VARIANTS = sorted(ALL_VARIANT_FLAGS.keys(),
                       key=_variant_order_key)
 
+# For internal integrity checking.
+REQUIRED_BUILD_VARIABLES = [
+    var.lstrip('!') for var in INCOMPATIBLE_FLAGS_PER_BUILD_VARIABLE.keys()
+]
+
 # Check {SLOW,FAST}_VARIANTS entries
 for variants in [SLOW_VARIANTS, FAST_VARIANTS]:
   for v in variants:
diff --git a/deps/v8/tools/testrunner/objects/testcase.py b/deps/v8/tools/testrunner/objects/testcase.py
index dddb1019c2b153..b199c3ff002076 100644
--- a/deps/v8/tools/testrunner/objects/testcase.py
+++ b/deps/v8/tools/testrunner/objects/testcase.py
@@ -30,6 +30,8 @@
 import re
 import shlex
 
+from pathlib import Path
+
 from testrunner.outproc import base as outproc
 from testrunner.local import command
 from testrunner.local import statusfile
@@ -60,9 +62,11 @@
 # Pattern to detect files to push on Android for statements like:
 # import "path/to/file.js"
 # import("module.mjs").catch()...
+# Require the matched path in one line. Note this might include some
+# false matches, which is safe, since files are tested for existence.
 MODULE_IMPORT_RESOURCES_PATTERN = re.compile(
-    r"import\s*\(?['\"]([^'\"]+)['\"]",
-    re.MULTILINE | re.DOTALL)
+    r"import\s*\(?['\"]([^'\"\n]+)['\"]",
+    re.MULTILINE)
 # Pattern to detect files to push on Android for expressions like:
 # shadowRealm.importValue("path/to/file.js", "obj")
 SHADOWREALM_IMPORTVALUE_RESOURCES_PATTERN = re.compile(
@@ -80,14 +84,23 @@ def read_file(file):
 class TestCase(object):
 
   def __init__(self, suite, path, name):
-    self.suite = suite        # TestSuite object
+    self.suite = suite
+
+    # Path (pathlib) with the relative test path, e.g. 'test-api/foo'.
+    self.path = Path(path)
 
-    self.path = path          # string, e.g. 'div-mod', 'test-api/foo'
-    self.name = name          # string that identifies test in the status file
-    self.subtest_id = None    # string that identifies subtests
+    # Sting with a posix path to identify test in the status file and
+    # at the command line.
+    self.name = name
 
-    self.variant = None       # name of the used testing variant
-    self.variant_flags = []   # list of strings, flags specific to this test
+    # String that identifies subtests.
+    self.subtest_id = None
+
+    # Name of the used testing variant.
+    self.variant = None
+
+    # List of strings, flags specific to this test.
+    self.variant_flags = []
 
     # Fields used by the test processors.
     self.origin = None # Test that this test is subtest of.
@@ -314,15 +327,19 @@ def is_fail(self):
   def only_standard_variant(self):
     return statusfile.NO_VARIANTS in self._statusfile_outcomes
 
+  @property
+  def shell(self):
+    return self.get_shell()
+
+  def skip_rdb(self, result):
+    return False
+
   def get_command(self, ctx):
     params = self._get_cmd_params()
     env = self._get_cmd_env()
-    shell = self.get_shell()
-    if utils.IsWindows():
-      shell += '.exe'
     shell_flags = self._get_shell_flags()
     timeout = self._get_timeout(params)
-    return self._create_cmd(ctx, shell, shell_flags + params, env, timeout)
+    return self._create_cmd(ctx, shell_flags + params, env, timeout)
 
   def _get_cmd_params(self):
     """Gets all command parameters and combines them in the following order:
@@ -412,13 +429,22 @@ def _get_timeout(self, params):
   def get_shell(self):
     raise NotImplementedError()
 
-  def _get_suffix(self):
-    return '.js'
+  def path_and_suffix(self, suffix):
+    return self.path.with_name(self.path.name + suffix)
+
+  @property
+  def path_js(self):
+    return self.path_and_suffix('.js')
+
+  @property
+  def path_mjs(self):
+    return self.path_and_suffix('.mjs')
 
-  def _create_cmd(self, ctx, shell, params, env, timeout):
+  def _create_cmd(self, ctx, params, env, timeout):
     return ctx.command(
         cmd_prefix=self.test_config.command_prefix,
-        shell=os.path.abspath(os.path.join(self.test_config.shell_dir, shell)),
+        shell=ctx.platform_shell(self.get_shell(), params,
+                                 self.test_config.shell_dir),
         args=params,
         env=env,
         timeout=timeout,
@@ -494,10 +520,9 @@ def _get_resources_for_file(self, file):
     source = read_file(file)
     result = []
     def add_path(path):
-      result.append(os.path.abspath(path.replace('/', os.path.sep)))
+      result.append(Path(path).resolve())
     def add_import_path(import_path):
-      add_path(os.path.normpath(
-        os.path.join(os.path.dirname(file), import_path)))
+      add_path(file.parent / import_path)
     def strip_test262_frontmatter(input):
       return TEST262_FRONTMATTER_PATTERN.sub('', input)
     for match in RESOURCES_PATTERN.finditer(source):
@@ -536,7 +561,7 @@ def get_android_resources(self):
       for resource in self._get_resources_for_file(next_resource):
         # Only add files that exist on disc. The pattens we check for give some
         # false positives otherwise.
-        if resource not in result and os.path.exists(resource):
+        if resource not in result and resource.exists():
           to_check.append(resource)
     return sorted(list(result))
 
diff --git a/deps/v8/tools/testrunner/objects/testcase_test.py b/deps/v8/tools/testrunner/objects/testcase_test.py
index b1031c6ea4264d..d127d3d5cefa70 100644
--- a/deps/v8/tools/testrunner/objects/testcase_test.py
+++ b/deps/v8/tools/testrunner/objects/testcase_test.py
@@ -7,10 +7,11 @@
 import sys
 import unittest
 
+from pathlib import Path
+
 # Needed because the test runner contains relative imports.
-TOOLS_PATH = os.path.dirname(
-    os.path.dirname(os.path.dirname(os.path.abspath(__file__))))
-sys.path.append(TOOLS_PATH)
+TOOLS_PATH = Path(__file__).resolve().parent.parent.parent
+sys.path.append(str(TOOLS_PATH))
 
 from testrunner.objects.testcase import TestCase
 
diff --git a/deps/v8/tools/testrunner/outproc/base.py b/deps/v8/tools/testrunner/outproc/base.py
index 11c76367ed7069..eede39948c1d7a 100644
--- a/deps/v8/tools/testrunner/outproc/base.py
+++ b/deps/v8/tools/testrunner/outproc/base.py
@@ -176,7 +176,8 @@ def _get_error_details(self, output):
     if expected == actual:
       return None
     lines = difflib.unified_diff(
-        expected, actual, fromfile=self._expected_filename, tofile='<actual>')
+        expected, actual, fromfile=str(self._expected_filename),
+        tofile='<actual>')
     return 'Output does not match expectation:\n' + ''.join(lines)
 
   def _act_block_iterator(self, output):
diff --git a/deps/v8/tools/testrunner/outproc/message.py b/deps/v8/tools/testrunner/outproc/message.py
index c2ef141f9b4fd1..7d9566abcb25ce 100644
--- a/deps/v8/tools/testrunner/outproc/message.py
+++ b/deps/v8/tools/testrunner/outproc/message.py
@@ -2,7 +2,6 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
-import os
 import re
 
 from itertools import zip_longest
@@ -25,7 +24,7 @@ def _is_failure_output(self, output):
 
     expected_lines = []
     # Can't use utils.ReadLinesFrom() here because it strips whitespace.
-    with open(self._basepath + '.out') as f:
+    with open(self._basepath.with_suffix('.out')) as f:
       for line in f:
         if line.startswith("#") or not line.strip():
           continue
@@ -38,18 +37,21 @@ def _is_failure_output(self, output):
     # Try .js first, and fall back to .mjs.
     # TODO(v8:9406): clean this up by never separating the path from
     # the extension in the first place.
-    base_path = self._basepath + '.js'
-    if not os.path.exists(base_path):
-      base_path = self._basepath + '.mjs'
+    base_path = self._basepath.with_suffix('.js')
+    if not base_path.exists():
+      base_path = self._basepath.with_suffix('.mjs')
 
     env = {
-      'basename': os.path.basename(base_path),
+      'basename': base_path.name,
     }
     for (expected, actual) in zip_longest(
         expected_lines, actual_lines, fillvalue=''):
       pattern = re.escape(expected.rstrip() % env)
       pattern = pattern.replace('\\*', '.*')
       pattern = pattern.replace('\\{NUMBER\\}', '\d+(?:\.\d*)?')
+      # Note: The character sequence for printing an address in C++ is
+      # implementation defined.
+      pattern = pattern.replace('\\{ADDRESS\\}', r'(0x)?[0-9A-Fa-f]+')
       pattern = '^%s$' % pattern
       if not re.match(pattern, actual):
         return True
@@ -58,11 +60,14 @@ def _is_failure_output(self, output):
   def _ignore_line(self, string):
     """Ignore empty lines, valgrind output, Android output."""
     return (
-      not string or
-      not string.strip() or
-      string.startswith("==") or
-      string.startswith("**") or
-      string.startswith("ANDROID") or
-      # Android linker warning.
-      string.startswith('WARNING: linker:')
+        not string or  #
+        not string.strip() or  #
+        string.startswith("==") or  #
+        string.startswith("**") or  #
+        string.startswith("ANDROID") or  #
+        # Android linker warning.
+        string.startswith('WARNING: linker:') or  #
+        # Testing on Android devices mixes stderr into stdout.
+        string ==
+        "V8 is running with experimental features enabled. Stability and security will suffer."
     )
diff --git a/deps/v8/tools/testrunner/outproc/mkgrokdump.py b/deps/v8/tools/testrunner/outproc/mkgrokdump.py
index 40130237760df2..9710fa847cdccb 100644
--- a/deps/v8/tools/testrunner/outproc/mkgrokdump.py
+++ b/deps/v8/tools/testrunner/outproc/mkgrokdump.py
@@ -6,26 +6,34 @@
 
 from . import base
 
-
 class OutProc(base.OutProc):
-  def __init__(self, expected_outcomes, expected_path):
+
+  def __init__(self, expected_outcomes):
     super(OutProc, self).__init__(expected_outcomes)
-    self._expected_path = expected_path
 
   def _is_failure_output(self, output):
-    with open(self._expected_path) as f:
-      expected = f.read()
-    expected_lines = expected.splitlines()
-    actual_lines = output.stdout.splitlines()
-    diff = difflib.unified_diff(expected_lines, actual_lines, lineterm="",
-                                fromfile="expected_path")
-    diffstring = '\n'.join(diff)
-    if diffstring != "":
-      if "generated from a non-shipping build" in output.stdout:
-        return False
-      if not "generated from a shipping build" in output.stdout:
-        output.stdout = "Unexpected output:\n\n" + output.stdout
-        return True
-      output.stdout = diffstring
+    MIN_EXPECTED_LINE_COUNT = 300  # Currently the actual count is 652.
+    if len(output.stdout.splitlines()) < MIN_EXPECTED_LINE_COUNT:
+      output.stdout = ("Plausibility check failed. Output too short.\n\n" +
+                       output.stdout)
       return True
+
+    PLAUSIBILITY_CHECK_EXPECTED_STRINGS = [
+        "INSTANCE_TYPES = {",
+        "HEAP_NUMBER_TYPE",
+        "KNOWN_MAPS = {",
+        "HeapNumberMap",
+        "KNOWN_OBJECTS = {",
+        "TrueValue",
+        "HEAP_FIRST_PAGES = {",
+        "FRAME_MARKERS = (",
+        "INTERPRETED",
+    ]
+    for expected_string in PLAUSIBILITY_CHECK_EXPECTED_STRINGS:
+      if not expected_string in output.stdout:
+        output.stdout = (
+            "Plausibility check failed. Expected string "
+            f"'{expected_string}' not found in output.\n") + output.stdout
+        return True
+
     return False
diff --git a/deps/v8/tools/testrunner/outproc/test262.py b/deps/v8/tools/testrunner/outproc/test262.py
index bf3bc05809f625..2bc3c224849339 100644
--- a/deps/v8/tools/testrunner/outproc/test262.py
+++ b/deps/v8/tools/testrunner/outproc/test262.py
@@ -7,20 +7,23 @@
 from . import base
 
 
-def _is_failure_output(output):
-  return (
-    output.exit_code != 0 or
-    'FAILED!' in output.stdout
-  )
+def _is_failure_output(output, is_async):
+  return (output.exit_code != 0 or 'FAILED!' in output.stdout or
+          (is_async and 'Test262:AsyncTestComplete' not in output.stdout))
 
 
 class ExceptionOutProc(base.OutProc):
   """Output processor for tests with expected exception."""
-  def __init__(
-      self, expected_outcomes, expected_exception=None, negative=False):
+
+  def __init__(self,
+               expected_outcomes,
+               expected_exception=None,
+               negative=False,
+               is_async=False):
     super(ExceptionOutProc, self).__init__(expected_outcomes)
     self._expected_exception = expected_exception
     self._negative = negative
+    self._async = is_async
 
   @property
   def negative(self):
@@ -29,7 +32,7 @@ def negative(self):
   def _is_failure_output(self, output):
     if self._expected_exception != self._parse_exception(output.stdout):
       return True
-    return _is_failure_output(output)
+    return _is_failure_output(output, self._async)
 
   def _parse_exception(self, string):
     # somefile:somelinenumber: someerror[: sometext]
@@ -44,11 +47,13 @@ def _parse_exception(self, string):
 
 class NoExceptionOutProc(base.OutProc):
   """Output processor optimized for tests without expected exception."""
-  def __init__(self, expected_outcomes):
+
+  def __init__(self, expected_outcomes, is_async=False):
     super(NoExceptionOutProc, self).__init__(expected_outcomes)
+    self._async = is_async
 
   def _is_failure_output(self, output):
-    return _is_failure_output(output)
+    return _is_failure_output(output, self._async)
 
 
 class PassNoExceptionOutProc(base.PassOutProc):
@@ -56,8 +61,10 @@ class PassNoExceptionOutProc(base.PassOutProc):
   Output processor optimized for tests expected to PASS without expected
   exception.
   """
-  def _is_failure_output(self, output):
-    return _is_failure_output(output)
 
+  def __init__(self, is_async=False):
+    super(PassNoExceptionOutProc, self).__init__()
+    self._async = is_async
 
-PASS_NO_EXCEPTION = PassNoExceptionOutProc()
+  def _is_failure_output(self, output):
+    return _is_failure_output(output, self._async)
diff --git a/deps/v8/tools/testrunner/standard_runner.py b/deps/v8/tools/testrunner/standard_runner.py
index 3723d734c8095b..134f2fde88bca4 100755
--- a/deps/v8/tools/testrunner/standard_runner.py
+++ b/deps/v8/tools/testrunner/standard_runner.py
@@ -5,6 +5,7 @@
 # found in the LICENSE file.
 
 from functools import reduce
+from pathlib import Path
 
 import datetime
 import json
@@ -16,10 +17,6 @@
 from testrunner.testproc.progress import ResultsTracker, ProgressProc
 from testrunner.testproc.shard import ShardProc
 
-# Adds testrunner to the path hence it has to be imported at the beggining.
-TOOLS_PATH = os.path.dirname(os.path.dirname(os.path.abspath(__file__)))
-sys.path.append(TOOLS_PATH)
-
 import testrunner.base_runner as base_runner
 
 from testrunner.local.variants import ALL_VARIANTS
@@ -35,10 +32,10 @@
 VARIANTS = ['default']
 
 MORE_VARIANTS = [
-  'jitless',
   'stress',
   'stress_js_bg_compile_wasm_code_gc',
   'stress_incremental_marking',
+  'future',
 ]
 
 VARIANT_ALIASES = {
@@ -53,7 +50,7 @@
         MORE_VARIANTS + VARIANTS,
     # Additional variants, run on a subset of bots.
     'extra': [
-        'nooptimization', 'future', 'no_wasm_traps', 'instruction_scheduling',
+        'jitless', 'nooptimization', 'no_wasm_traps', 'instruction_scheduling',
         'always_sparkplug', 'turboshaft'
     ],
 }
@@ -151,12 +148,12 @@ def _add_parser_options(self, parser):
                       help='Path to a file for storing flakiness json.')
 
   def _predictable_wrapper(self):
-    return os.path.join(self.v8_root, 'tools', 'predictable_wrapper.py')
+    return self.v8_root / 'tools' / 'predictable_wrapper.py'
 
   def _process_options(self):
     if self.options.sancov_dir:
-      self.sancov_dir = self.options.sancov_dir
-      if not os.path.exists(self.sancov_dir):
+      self.sancov_dir = Path(self.options.sancov_dir)
+      if not self.sancov_dir.exists():
         print('sancov-dir %s doesn\'t exist' % self.sancov_dir)
         raise base_runner.TestRunnerError()
 
@@ -194,7 +191,7 @@ def _process_options(self):
       self.options.slow_tests = 'skip'
       self.options.pass_fail_tests = 'skip'
 
-    if self.build_config.predictable:
+    if self.build_config.verify_predictable:
       self.options.variants = 'default'
       self.options.extra_flags.append('--predictable')
       self.options.extra_flags.append('--verify-predictable')
@@ -219,7 +216,7 @@ def CheckTestMode(name, option):  # pragma: no cover
         raise base_runner.TestRunnerError()
     CheckTestMode('slow test', self.options.slow_tests)
     CheckTestMode('pass|fail test', self.options.pass_fail_tests)
-    if self.build_config.no_i18n:
+    if not self.build_config.i18n:
       base_runner.TEST_MAP['bot_default'].remove('intl')
       base_runner.TEST_MAP['default'].remove('intl')
       # TODO(machenbach): uncomment after infra side lands.
@@ -269,9 +266,7 @@ def _setup_env(self):
       ])
 
   def _get_statusfile_variables(self):
-    variables = (
-        super(StandardTestRunner, self)._get_statusfile_variables())
-
+    variables = super(StandardTestRunner, self)._get_statusfile_variables()
     variables.update({
       'gc_stress': self.options.gc_stress or self.options.random_gc_stress,
       'gc_fuzzer': self.options.random_gc_stress,
@@ -290,7 +285,7 @@ def _do_execute(self, tests, args, ctx):
     loader = LoadProc(tests, initial_batch_size=self.options.j * 2)
     results = ResultsTracker.create(self.options)
     outproc_factory = None
-    if self.build_config.predictable:
+    if self.build_config.verify_predictable:
       outproc_factory = predictable.get_outproc
     execproc = ExecutionProc(ctx, jobs, outproc_factory)
     sigproc = self._create_signal_proc()
@@ -347,7 +342,7 @@ def _duration_results_text(test):
         'Duration: %s' % format_duration(test['duration']),
       ]
 
-    assert os.path.exists(self.options.json_test_results)
+    assert Path(self.options.json_test_results).exists()
     with open(self.options.json_test_results, "r") as f:
       output = json.load(f)
     lines = []
@@ -366,7 +361,7 @@ def _duration_results_text(test):
     print("\n".join(lines))
 
   def _create_predictable_filter(self):
-    if not self.build_config.predictable:
+    if not self.build_config.verify_predictable:
       return None
     return predictable.PredictableFilterProc()
 
diff --git a/deps/v8/tools/testrunner/standard_runner_test.py b/deps/v8/tools/testrunner/standard_runner_test.py
index 770a29bf889232..8d4fe4f1a6846b 100644
--- a/deps/v8/tools/testrunner/standard_runner_test.py
+++ b/deps/v8/tools/testrunner/standard_runner_test.py
@@ -18,14 +18,15 @@
 # TODO(majeski): Add some tests for the fuzzers.
 
 from collections import deque
-import os
+from pathlib import Path
+
 import sys
 import unittest
-from os.path import dirname as up
 from mock import patch
 
-TOOLS_ROOT = up(up(os.path.abspath(__file__)))
-sys.path.append(TOOLS_ROOT)
+TOOLS_ROOT = Path(__file__).resolve().parent.parent
+sys.path.append(str(TOOLS_ROOT))
+
 from testrunner import standard_runner
 from testrunner import num_fuzzer
 from testrunner.testproc import base
@@ -125,11 +126,11 @@ def testFail(self):
     result.has_returncode(1)
 
   def testGN(self):
-    """Test running only failing tests in two variants."""
-    result = self.run_tests('--gn',baseroot="testroot5")
+    """Test setup with legacy GN out dir."""
+    result = self.run_tests('--gn', baseroot="testroot5", outdir='out.gn')
     result.stdout_includes('>>> Latest GN build found: build')
     result.stdout_includes('Build found: ')
-    result.stdout_includes('v8_test_/out.gn/build')
+    result.stdout_includes('_v8_test/out.gn/build')
     result.has_returncode(2)
 
   def testMalformedJsonConfig(self):
@@ -221,25 +222,23 @@ def testAutoDetect(self):
         '--variants=default',
         'sweet/bananas',
         config_overrides=dict(
-          dcheck_always_on=True, is_asan=True, is_cfi=True,
-          is_msan=True, is_tsan=True, is_ubsan_vptr=True, target_cpu='x86',
-          v8_enable_i18n_support=False, v8_target_cpu='x86',
-          v8_enable_verify_csa=False, v8_enable_lite_mode=False,
-          v8_enable_pointer_compression=False,
-          v8_enable_pointer_compression_shared_cage=False,
-          v8_enable_shared_ro_heap=False,
-          v8_enable_sandbox=False
-        )
-    )
+            arch="ia32",
+            asan=True,
+            cfi=True,
+            dcheck_always_on=True,
+            has_webassembly=True,
+            msan=True,
+            target_cpu='x86',
+            tsan=True,
+            ubsan=True,
+            use_sanitizer=True,
+            v8_target_cpu='x86',
+        ))
     result.stdout_includes('>>> Autodetected:')
-    result.stdout_includes('asan')
-    result.stdout_includes('cfi_vptr')
-    result.stdout_includes('dcheck_always_on')
-    result.stdout_includes('msan')
-    result.stdout_includes('no_i18n')
-    result.stdout_includes('tsan')
-    result.stdout_includes('ubsan_vptr')
-    result.stdout_includes('webassembly')
+    result.stdout_includes(
+        'arch="ia32", asan, cfi, dcheck_always_on, has_webassembly, i18n, '
+        'msan, target_cpu="x86", tsan, ubsan, use_sanitizer, '
+        'v8_target_cpu="x86"')
     result.stdout_includes('>>> Running tests for ia32.release')
     result.has_returncode(0)
     # TODO(machenbach): Test some more implications of the auto-detected
@@ -316,7 +315,7 @@ def testDefault(self):
 
   def testNoBuildConfig(self):
     """Test failing run when build config is not found."""
-    result = self.run_tests(baseroot='wrong_path')
+    result = self.run_tests(baseroot='wrong_path', with_build_config=False)
     result.stdout_includes('Failed to load build config')
     result.has_returncode(5)
 
@@ -349,7 +348,7 @@ def testPredictable(self):
         '--variants=default',
         'sweet/bananas',
         infra_staging=False,
-        config_overrides=dict(v8_enable_verify_predictable=True),
+        config_overrides=dict(verify_predictable=True),
     )
     result.stdout_includes('1 tests ran')
     result.stdout_includes('sweet/bananas default: FAIL')
@@ -408,7 +407,7 @@ def testSpecificVariants(self):
         '--variants=default,stress',
         'sweet/bananas',
         'sweet/raspberries',
-        config_overrides=dict(is_asan=True),
+        config_overrides=dict(asan=True),
     )
     # Both tests are either marked as running in only default or only
     # slow variant.
@@ -600,7 +599,7 @@ def testStatusFilePresubmit(self):
     with temp_base() as basedir:
       from testrunner.local import statusfile
       self.assertTrue(statusfile.PresubmitCheck(
-          os.path.join(basedir, 'test', 'sweet', 'sweet.status')))
+          basedir / 'test' / 'sweet' / 'sweet.status'))
 
 
 if __name__ == '__main__':
diff --git a/deps/v8/tools/testrunner/test_config.py b/deps/v8/tools/testrunner/test_config.py
index 00a68e2acd8a44..99e57699cdcdd2 100644
--- a/deps/v8/tools/testrunner/test_config.py
+++ b/deps/v8/tools/testrunner/test_config.py
@@ -19,6 +19,7 @@ def __init__(self,
                shard_count,
                shard_id,
                shell_dir,
+               target_os,
                timeout,
                verbose,
                regenerate_expected_files=False):
@@ -35,6 +36,7 @@ def __init__(self,
     self.shard_count = shard_count
     self.shard_id = shard_id
     self.shell_dir = shell_dir
+    self.target_os = target_os
     self.timeout = timeout
     self.verbose = verbose
     self.regenerate_expected_files = regenerate_expected_files
diff --git a/deps/v8/tools/testrunner/testdata/testroot1/out/build/v8_build_config.json b/deps/v8/tools/testrunner/testdata/testroot1/out/build/v8_build_config.json
deleted file mode 100644
index 02af7319d7643f..00000000000000
--- a/deps/v8/tools/testrunner/testdata/testroot1/out/build/v8_build_config.json
+++ /dev/null
@@ -1,46 +0,0 @@
-{
-  "current_cpu": "x64",
-  "dcheck_always_on": false,
-  "is_android": false,
-  "is_asan": false,
-  "is_cfi": false,
-  "is_clang": true,
-  "is_clang_coverage": false,
-  "is_component_build": false,
-  "is_debug": false,
-  "is_full_debug": false,
-  "is_ubsan_vptr": false,
-  "is_msan": false,
-  "is_tsan": false,
-  "target_cpu": "x64",
-  "v8_current_cpu": "x64",
-  "v8_enable_i18n_support": true,
-  "v8_enable_verify_predictable": false,
-  "v8_target_cpu": "x64",
-  "v8_enable_conservative_stack_scanning": false,
-  "v8_enable_concurrent_marking": true,
-  "v8_enable_verify_csa": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_lite_mode": false,
-  "v8_enable_pointer_compression": true,
-  "v8_enable_pointer_compression_shared_cage": true,
-  "v8_enable_sandbox": false,
-  "v8_enable_shared_ro_heap": true,
-  "v8_disable_write_barriers": false,
-  "v8_control_flow_integrity": false,
-  "v8_enable_single_generation": false,
-  "v8_enable_third_party_heap": false,
-  "v8_enable_webassembly": true,
-  "v8_dict_property_const_tracking": false,
-  "v8_code_comments": false,
-  "v8_enable_debug_code": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_maglev": false,
-  "v8_enable_disassembler": false,
-  "is_DEBUG_defined": false,
-  "v8_enable_turbofan": false,
-  "v8_jitless": false,
-  "v8_enable_gdbjit": false
-}
diff --git a/deps/v8/tools/testrunner/testdata/testroot2/out/build/v8_build_config.json b/deps/v8/tools/testrunner/testdata/testroot2/out/build/v8_build_config.json
deleted file mode 100644
index e91ed7813dd913..00000000000000
--- a/deps/v8/tools/testrunner/testdata/testroot2/out/build/v8_build_config.json
+++ /dev/null
@@ -1,46 +0,0 @@
-{
-  "current_cpu": "x64",
-  "dcheck_always_on": false,
-  "is_android": false,
-  "is_asan": false,
-  "is_cfi": false,
-  "is_clang": true,
-  "is_clang_coverage": false,
-  "is_component_build": false,
-  "is_debug": false,
-  "is_full_debug": false,
-  "is_ubsan_vptr": false,
-  "is_msan": false,
-  "is_tsan": false,
-  "target_cpu": "x64",
-  "v8_current_cpu": "x64",
-  "v8_enable_i18n_support": true,
-  "v8_enable_verify_predictable": false,
-  "v8_target_cpu": "x64",
-  "v8_enable_conservative_stack_scanning": false,
-  "v8_enable_concurrent_marking": true,
-  "v8_enable_verify_csa": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_lite_mode": false,
-  "v8_enable_pointer_compression": false,
-  "v8_enable_pointer_compression_shared_cage": false,
-  "v8_enable_sandbox": false,
-  "v8_enable_shared_ro_heap": false,
-  "v8_disable_write_barriers": false,
-  "v8_control_flow_integrity": false,
-  "v8_enable_single_generation": false,
-  "v8_enable_third_party_heap": false,
-  "v8_enable_webassembly": true,
-  "v8_dict_property_const_tracking": false,
-  "v8_code_comments": false,
-  "v8_enable_debug_code": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_maglev": false,
-  "v8_enable_disassembler": false,
-  "is_DEBUG_defined": false,
-  "v8_enable_turbofan": false,
-  "v8_jitless": false,
-  "v8_enable_gdbjit": false
-}
diff --git a/deps/v8/tools/testrunner/testdata/testroot3/out/build/v8_build_config.json b/deps/v8/tools/testrunner/testdata/testroot3/out/build/v8_build_config.json
deleted file mode 100644
index 02af7319d7643f..00000000000000
--- a/deps/v8/tools/testrunner/testdata/testroot3/out/build/v8_build_config.json
+++ /dev/null
@@ -1,46 +0,0 @@
-{
-  "current_cpu": "x64",
-  "dcheck_always_on": false,
-  "is_android": false,
-  "is_asan": false,
-  "is_cfi": false,
-  "is_clang": true,
-  "is_clang_coverage": false,
-  "is_component_build": false,
-  "is_debug": false,
-  "is_full_debug": false,
-  "is_ubsan_vptr": false,
-  "is_msan": false,
-  "is_tsan": false,
-  "target_cpu": "x64",
-  "v8_current_cpu": "x64",
-  "v8_enable_i18n_support": true,
-  "v8_enable_verify_predictable": false,
-  "v8_target_cpu": "x64",
-  "v8_enable_conservative_stack_scanning": false,
-  "v8_enable_concurrent_marking": true,
-  "v8_enable_verify_csa": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_lite_mode": false,
-  "v8_enable_pointer_compression": true,
-  "v8_enable_pointer_compression_shared_cage": true,
-  "v8_enable_sandbox": false,
-  "v8_enable_shared_ro_heap": true,
-  "v8_disable_write_barriers": false,
-  "v8_control_flow_integrity": false,
-  "v8_enable_single_generation": false,
-  "v8_enable_third_party_heap": false,
-  "v8_enable_webassembly": true,
-  "v8_dict_property_const_tracking": false,
-  "v8_code_comments": false,
-  "v8_enable_debug_code": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_maglev": false,
-  "v8_enable_disassembler": false,
-  "is_DEBUG_defined": false,
-  "v8_enable_turbofan": false,
-  "v8_jitless": false,
-  "v8_enable_gdbjit": false
-}
diff --git a/deps/v8/tools/testrunner/testdata/testroot5/out.gn/build/v8_build_config.json b/deps/v8/tools/testrunner/testdata/testroot5/out.gn/build/v8_build_config.json
deleted file mode 100644
index 02af7319d7643f..00000000000000
--- a/deps/v8/tools/testrunner/testdata/testroot5/out.gn/build/v8_build_config.json
+++ /dev/null
@@ -1,46 +0,0 @@
-{
-  "current_cpu": "x64",
-  "dcheck_always_on": false,
-  "is_android": false,
-  "is_asan": false,
-  "is_cfi": false,
-  "is_clang": true,
-  "is_clang_coverage": false,
-  "is_component_build": false,
-  "is_debug": false,
-  "is_full_debug": false,
-  "is_ubsan_vptr": false,
-  "is_msan": false,
-  "is_tsan": false,
-  "target_cpu": "x64",
-  "v8_current_cpu": "x64",
-  "v8_enable_i18n_support": true,
-  "v8_enable_verify_predictable": false,
-  "v8_target_cpu": "x64",
-  "v8_enable_conservative_stack_scanning": false,
-  "v8_enable_concurrent_marking": true,
-  "v8_enable_verify_csa": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_lite_mode": false,
-  "v8_enable_pointer_compression": true,
-  "v8_enable_pointer_compression_shared_cage": true,
-  "v8_enable_sandbox": false,
-  "v8_enable_shared_ro_heap": true,
-  "v8_disable_write_barriers": false,
-  "v8_control_flow_integrity": false,
-  "v8_enable_single_generation": false,
-  "v8_enable_third_party_heap": false,
-  "v8_enable_webassembly": true,
-  "v8_dict_property_const_tracking": false,
-  "v8_code_comments": false,
-  "v8_enable_debug_code": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_maglev": false,
-  "v8_enable_disassembler": false,
-  "is_DEBUG_defined": false,
-  "v8_enable_turbofan": false,
-  "v8_jitless": false,
-  "v8_enable_gdbjit": false
-}
diff --git a/deps/v8/tools/testrunner/testdata/testroot6/out/build/v8_build_config.json b/deps/v8/tools/testrunner/testdata/testroot6/out/build/v8_build_config.json
deleted file mode 100644
index 02af7319d7643f..00000000000000
--- a/deps/v8/tools/testrunner/testdata/testroot6/out/build/v8_build_config.json
+++ /dev/null
@@ -1,46 +0,0 @@
-{
-  "current_cpu": "x64",
-  "dcheck_always_on": false,
-  "is_android": false,
-  "is_asan": false,
-  "is_cfi": false,
-  "is_clang": true,
-  "is_clang_coverage": false,
-  "is_component_build": false,
-  "is_debug": false,
-  "is_full_debug": false,
-  "is_ubsan_vptr": false,
-  "is_msan": false,
-  "is_tsan": false,
-  "target_cpu": "x64",
-  "v8_current_cpu": "x64",
-  "v8_enable_i18n_support": true,
-  "v8_enable_verify_predictable": false,
-  "v8_target_cpu": "x64",
-  "v8_enable_conservative_stack_scanning": false,
-  "v8_enable_concurrent_marking": true,
-  "v8_enable_verify_csa": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_lite_mode": false,
-  "v8_enable_pointer_compression": true,
-  "v8_enable_pointer_compression_shared_cage": true,
-  "v8_enable_sandbox": false,
-  "v8_enable_shared_ro_heap": true,
-  "v8_disable_write_barriers": false,
-  "v8_control_flow_integrity": false,
-  "v8_enable_single_generation": false,
-  "v8_enable_third_party_heap": false,
-  "v8_enable_webassembly": true,
-  "v8_dict_property_const_tracking": false,
-  "v8_code_comments": false,
-  "v8_enable_debug_code": false,
-  "v8_enable_verify_heap": false,
-  "v8_enable_slow_dchecks": false,
-  "v8_enable_maglev": false,
-  "v8_enable_disassembler": false,
-  "is_DEBUG_defined": false,
-  "v8_enable_turbofan": false,
-  "v8_jitless": false,
-  "v8_enable_gdbjit": false
-}
diff --git a/deps/v8/tools/testrunner/testdata/v8_build_config.json b/deps/v8/tools/testrunner/testdata/v8_build_config.json
new file mode 100644
index 00000000000000..0ab720e82c93cb
--- /dev/null
+++ b/deps/v8/tools/testrunner/testdata/v8_build_config.json
@@ -0,0 +1,18 @@
+{
+  "arch": "x64",
+  "asan": false,
+  "cfi": false,
+  "dcheck_always_on": false,
+  "debugging_features": false,
+  "full_debug": false,
+  "i18n": true,
+  "is_android": false,
+  "is_ios": false,
+  "lite_mode": false,
+  "msan": false,
+  "simulator_run": false,
+  "tsan": false,
+  "ubsan": false,
+  "use_sanitizer": false,
+  "verify_predictable": false
+}
diff --git a/deps/v8/tools/testrunner/testproc/filter.py b/deps/v8/tools/testrunner/testproc/filter.py
index 728af483cbcb3f..22d2120e6a74a0 100644
--- a/deps/v8/tools/testrunner/testproc/filter.py
+++ b/deps/v8/tools/testrunner/testproc/filter.py
@@ -78,12 +78,8 @@ def _filter(self, test):
     globs = self._globs.get(test.suite.name, [])
     for g in globs:
       if g == '*': return False
-      if fnmatch.fnmatch(test.path, g):
+      if fnmatch.fnmatch(test.name, g):
         return False
+
     exact_matches = self._exact_matches.get(test.suite.name, {})
-    if test.path in exact_matches: return False
-    if os.sep != '/':
-      unix_path = test.path.replace(os.sep, '/')
-      if unix_path in exact_matches: return False
-    # Filter out everything else.
-    return True
+    return test.name not in exact_matches
diff --git a/deps/v8/tools/testrunner/testproc/fuzzer.py b/deps/v8/tools/testrunner/testproc/fuzzer.py
index 5e2e6ddc044433..ef27ea5f073078 100644
--- a/deps/v8/tools/testrunner/testproc/fuzzer.py
+++ b/deps/v8/tools/testrunner/testproc/fuzzer.py
@@ -11,18 +11,18 @@
 EXTRA_FLAGS = [
     (0.1, '--always-turbofan'),
     (0.1, '--assert-types'),
-    (0.1, '--interrupt-budget-for-feedback-allocation=0'),
     (0.1, '--cache=code'),
     (0.1, '--force-slow-path'),
     (0.2, '--future'),
     # TODO(v8:13524): Enable when issue is fixed
     # TODO(v8:13528): Enable when issue is fixed
     # (0.1, '--harmony-struct'),
-    (0.1, '--interrupt-budget=100'),
-    (0.1, '--interrupt-budget-for-maglev=100'),
+    (0.1, '--jit-fuzzing'),
     (0.1, '--liftoff'),
     (0.1, '--maglev'),
-    (0.1, '--minor-mc'),
+    (0.1, '--maglev-future'),
+    (0.25, '--minor-ms'),
+    (0.1, '--concurrent-minor-ms-marking'),
     (0.2, '--no-analyze-environment-liveness'),
     # TODO(machenbach): Enable when it doesn't collide with crashing on missing
     # simd features.
@@ -42,6 +42,7 @@
     (0.1, '--no-turbofan'),
     (0.2, '--no-regexp-tier-up'),
     (0.1, '--no-wasm-tier-up'),
+    (0.1, '--optimize-on-next-call-optimizes-to-maglev'),
     (0.1, '--regexp-interpret-all'),
     (0.1, '--regexp-tier-up-ticks=10'),
     (0.1, '--regexp-tier-up-ticks=100'),
@@ -49,6 +50,7 @@
     (0.1, '--stress-background-compile'),
     (0.1, '--stress-flush-code'),
     (0.1, '--stress-lazy-source-positions'),
+    (0.1, '--stress-maglev'),
     (0.1, '--stress-wasm-code-gc'),
     (0.2, '--turboshaft'),
     (0.1, '--turbo-instruction-scheduling'),
@@ -337,14 +339,12 @@ def create_flags_generator(self, rng, test, analysis_value):
       # overwrites potential flag negations from the extra flags list.
       flag1 = rng.choice(
           ['--lazy-feedback-allocation', '--no-lazy-feedback-allocation'])
-      flag2 = '--interrupt-budget=%d' % rng.randint(0, 135168)
-      flag3 = '--interrupt-budget-for-maglev=%d' % rng.randint(0, 40960)
-      flag4 = '--interrupt-budget-for-feedback-allocation=%d' % rng.randint(
-          0, 940)
-      flag5 = '--interrupt-budget-factor-for-feedback-allocation=%d' % rng.randint(
-          1, 8)
-
-      yield [flag1, flag2, flag3, flag4, flag5]
+      flag2 = '--invocation-count-for-turbofan=%d' % rng.randint(0, 240)
+      flag3 = '--invocation-count-for-maglev=%d' % rng.randint(0, 120)
+      flag4 = '--invocation-count-for-feedback-allocation=%d' % rng.randint(
+          0, 8)
+
+      yield [flag1, flag2, flag3, flag4]
 
 
 class StackSizeFuzzer(Fuzzer):
diff --git a/deps/v8/tools/testrunner/testproc/indicators.py b/deps/v8/tools/testrunner/testproc/indicators.py
index 2f84119441bb63..06857b9787236e 100644
--- a/deps/v8/tools/testrunner/testproc/indicators.py
+++ b/deps/v8/tools/testrunner/testproc/indicators.py
@@ -261,7 +261,7 @@ def on_test_result(self, test, result):
       else:
         if test.is_fail:
           self.printFormatted('failure', "--- UNEXPECTED PASS ---")
-          if test.expected_failure_reason != None:
+          if test.expected_failure_reason is not None:
             self.printFormatted('failure', test.expected_failure_reason)
         else:
           self.printFormatted('failure', "--- FAILED ---")
diff --git a/deps/v8/tools/testrunner/testproc/resultdb.py b/deps/v8/tools/testrunner/testproc/resultdb.py
index 0a0b4e3aca5ca3..bd9bde88862dbb 100644
--- a/deps/v8/tools/testrunner/testproc/resultdb.py
+++ b/deps/v8/tools/testrunner/testproc/resultdb.py
@@ -30,6 +30,8 @@ def send_result(self, test, result, run):
     # We need to recalculate the observed (but lost) test behaviour.
     # `result.has_unexpected_output` indicates that the run behaviour of the
     # test matches the expected behaviour irrespective of passing or failing.
+    if test.skip_rdb(result):
+      return
     result_expected = not result.has_unexpected_output
     test_should_pass = not test.is_fail
     run_passed = (result_expected == test_should_pass)
@@ -38,9 +40,8 @@ def send_result(self, test, result, run):
         'status': 'PASS' if run_passed else 'FAIL',
         'expected': result_expected,
     }
-
     if result.output and result.output.duration:
-      rdb_result.update(duration=f'{result.output.duration}ms')
+      rdb_result.update(duration=f'{result.output.duration:f}s')
 
     if result.has_unexpected_output:
       formated_output = formatted_result_output(result,relative=True)
diff --git a/deps/v8/tools/testrunner/testproc/resultdb_test.py b/deps/v8/tools/testrunner/testproc/resultdb_test.py
new file mode 100644
index 00000000000000..212c8927b2c636
--- /dev/null
+++ b/deps/v8/tools/testrunner/testproc/resultdb_test.py
@@ -0,0 +1,133 @@
+# Copyright 2023 the V8 project authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file.
+
+from collections import namedtuple
+from http.server import BaseHTTPRequestHandler, HTTPServer
+from threading import Thread
+from typing import Any
+
+import json
+import os
+import requests
+import socket
+import sys
+import unittest
+
+# Needed because the test runner contains relative imports.
+TOOLS_PATH = os.path.dirname(
+    os.path.dirname(os.path.dirname(os.path.abspath(__file__))))
+sys.path.append(TOOLS_PATH)
+
+# Standard library imports...
+from testrunner.testproc.resultdb import ResultDBIndicator
+from testrunner.local.command import BaseCommand
+from testrunner.objects.output import Output
+
+
+class RDBRequestHandler(BaseHTTPRequestHandler):
+
+  def do_POST(self):
+    content_length = int(self.headers['Content-Length'])
+    post_data = self.rfile.read(content_length)
+    self.server.register_post_data(post_data)
+    self.send_response(requests.codes.ok)
+    self.end_headers()
+    return
+
+
+def get_free_port():
+  s = socket.socket(socket.AF_INET, type=socket.SOCK_STREAM)
+  s.bind(('localhost', 0))
+  _, port = s.getsockname()
+  s.close()
+  return port
+
+
+class RDBMockServer(HTTPServer):
+
+  def __init__(self) -> None:
+    self.port = get_free_port()
+    super().__init__(('localhost', self.port), RDBRequestHandler)
+    self.thread = Thread(target=self.serve_forever)
+    self.thread.daemon = True
+    self.thread.start()
+    self.post_data = []
+
+  def register_post_data(self, data):
+    self.post_data.append(data)
+
+  @property
+  def address(self):
+    return f'localhost:{self.port}'
+
+
+def mock_test262(is_fail, rdb_test_id):
+  Test = namedtuple('Test', [
+      'is_fail', 'rdb_test_id', 'expected_outcomes', 'framework_name',
+      'full_name', 'random_seed', 'shard_id', 'shard_count', 'shell', 'variant',
+      'variant_flags', 'processor_name', 'subtest_id', 'path', 'skip_rdb'
+  ])
+
+  def skip_if_expected(result):
+    return not result.has_unexpected_output
+
+  return Test(is_fail, rdb_test_id, [], 'unittest', 'test-123', 0, 1, 2, '',
+              'default', [], 'none', None, '/tmp/test/some_test.js',
+              skip_if_expected)
+
+
+def mock_result(is_fail, duration=None):
+  Result = namedtuple('Result', ['has_unexpected_output', 'output', 'cmd'])
+  return Result(is_fail, Output(duration=duration), BaseCommand('echo'))
+
+
+class TestResultDBIndicator(unittest.TestCase):
+
+  def test_send(self):
+
+    def assert_sent_count(count):
+      self.assertEqual(len(server.post_data), count)
+
+    server = RDBMockServer()
+    self.rdb = ResultDBIndicator(
+        context=None,
+        options=None,
+        test_count=0,
+        sink=dict(auth_token='none', address=server.address))
+
+    self.rdb.send_result(
+        mock_test262(True, 'expected2fail-fail'), mock_result(False), 0)
+    assert_sent_count(0)
+
+    self.rdb.send_result(
+        mock_test262(True, 'expected2fail-pass'), mock_result(True), 0)
+    assert_sent_count(1)
+
+    self.rdb.send_result(
+        mock_test262(False, 'expected2pass-fail'), mock_result(True), 0)
+    assert_sent_count(2)
+
+    self.rdb.send_result(
+        mock_test262(False, 'expected2pass-pass'), mock_result(False), 0)
+    assert_sent_count(2)
+
+    self.rdb.send_result(
+        mock_test262(True, 'fast'), mock_result(True, duration=0.00001), 0)
+    assert_sent_count(3)
+
+    def assert_testid_at_index(testid, idx):
+      data = json.loads(server.post_data[idx])
+      self.assertEqual(data['testResults'][0]['testId'], testid)
+
+    def assert_duration_at_index(duration_str, idx):
+      data = json.loads(server.post_data[idx])
+      self.assertEqual(data['testResults'][0]['duration'], duration_str)
+
+    assert_testid_at_index('expected2fail-pass', 0)
+    assert_testid_at_index('expected2pass-fail', 1)
+    assert_duration_at_index('0.000010s', 2)
+
+
+if __name__ == '__main__':
+  unittest.main()
diff --git a/deps/v8/tools/testrunner/testproc/stack_utils/testdata/analyze_crash/data_race_clusterfuzz.txt b/deps/v8/tools/testrunner/testproc/stack_utils/testdata/analyze_crash/data_race_clusterfuzz.txt
index b72ef85bbd55eb..4f5ced8c2ccc1f 100644
--- a/deps/v8/tools/testrunner/testproc/stack_utils/testdata/analyze_crash/data_race_clusterfuzz.txt
+++ b/deps/v8/tools/testrunner/testproc/stack_utils/testdata/analyze_crash/data_race_clusterfuzz.txt
@@ -1,7 +1,7 @@
 WARNING: ThreadSanitizer: data race (pid=3187405)
   Read of size 8 at 0x7ea200056b80 by thread T1:
     #0 0x55ad577064dc in v8::internal::compiler::JSObjectRef::GetOwnConstantElementFromHeap(v8::internal::FixedArrayBase, v8::internal::ElementsKind, unsigned int) const src/base/memory.h:34:3
-    #1 0x55ad577062aa in v8::internal::compiler::JSObjectRef::GetOwnConstantElement(v8::internal::compiler::FixedArrayBaseRef const&, unsigned int, v8::internal::compiler::CompilationDependencies*) const src/compiler/heap-refs.cc:1815:42
+    #1 0x55ad577062aa in v8::internal::compiler::JSObjectRef::GetOwnConstantElement(v8::internal::compiler::FixedArrayBaseRef, unsigned int, v8::internal::compiler::CompilationDependencies*) const src/compiler/heap-refs.cc:1815:42
     #2 0x55ad577c4ff7 in v8::internal::compiler::JSNativeContextSpecialization::ReduceElementLoadFromHeapConstant(v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::internal::compiler::AccessMode, v8::internal::KeyedAccessLoadMode) src/compiler/js-native-context-specialization.cc:2325:32
     #3 0x55ad577c2c8f in v8::internal::compiler::JSNativeContextSpecialization::ReduceElementAccess(v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::internal::compiler::ElementAccessFeedback const&) src/compiler/js-native-context-specialization.cc:2094:27
     #4 0x55ad577c19f7 in v8::internal::compiler::JSNativeContextSpecialization::ReducePropertyAccess(v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::base::Optional<v8::internal::compiler::NameRef>, v8::internal::compiler::Node*, v8::internal::compiler::FeedbackSource const&, v8::internal::compiler::AccessMode) src/compiler/js-native-context-specialization.cc:2413:14
diff --git a/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_3.expected b/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_3.expected
index 1f41878d22592b..285c866e64ed6e 100644
--- a/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_3.expected
+++ b/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_3.expected
@@ -1,3 +1,3 @@
 v8::internal::compiler::JSObjectRef::GetOwnConstantElementFromHeap(v8::internal::FixedArrayBase, v8::internal::ElementsKind, unsigned int) const
-v8::internal::compiler::JSObjectRef::GetOwnConstantElement(v8::internal::compiler::FixedArrayBaseRef const&, unsigned int, v8::internal::compiler::CompilationDependencies*) const
+v8::internal::compiler::JSObjectRef::GetOwnConstantElement(v8::internal::compiler::FixedArrayBaseRef, unsigned int, v8::internal::compiler::CompilationDependencies*) const
 v8::internal::compiler::JSNativeContextSpecialization::ReduceElementLoadFromHeapConstant(v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::internal::compiler::AccessMode, v8::internal::KeyedAccessLoadMode)
\ No newline at end of file
diff --git a/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_3.txt b/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_3.txt
index b72ef85bbd55eb..4f5ced8c2ccc1f 100644
--- a/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_3.txt
+++ b/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_3.txt
@@ -1,7 +1,7 @@
 WARNING: ThreadSanitizer: data race (pid=3187405)
   Read of size 8 at 0x7ea200056b80 by thread T1:
     #0 0x55ad577064dc in v8::internal::compiler::JSObjectRef::GetOwnConstantElementFromHeap(v8::internal::FixedArrayBase, v8::internal::ElementsKind, unsigned int) const src/base/memory.h:34:3
-    #1 0x55ad577062aa in v8::internal::compiler::JSObjectRef::GetOwnConstantElement(v8::internal::compiler::FixedArrayBaseRef const&, unsigned int, v8::internal::compiler::CompilationDependencies*) const src/compiler/heap-refs.cc:1815:42
+    #1 0x55ad577062aa in v8::internal::compiler::JSObjectRef::GetOwnConstantElement(v8::internal::compiler::FixedArrayBaseRef, unsigned int, v8::internal::compiler::CompilationDependencies*) const src/compiler/heap-refs.cc:1815:42
     #2 0x55ad577c4ff7 in v8::internal::compiler::JSNativeContextSpecialization::ReduceElementLoadFromHeapConstant(v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::internal::compiler::AccessMode, v8::internal::KeyedAccessLoadMode) src/compiler/js-native-context-specialization.cc:2325:32
     #3 0x55ad577c2c8f in v8::internal::compiler::JSNativeContextSpecialization::ReduceElementAccess(v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::internal::compiler::ElementAccessFeedback const&) src/compiler/js-native-context-specialization.cc:2094:27
     #4 0x55ad577c19f7 in v8::internal::compiler::JSNativeContextSpecialization::ReducePropertyAccess(v8::internal::compiler::Node*, v8::internal::compiler::Node*, v8::base::Optional<v8::internal::compiler::NameRef>, v8::internal::compiler::Node*, v8::internal::compiler::FeedbackSource const&, v8::internal::compiler::AccessMode) src/compiler/js-native-context-specialization.cc:2413:14
diff --git a/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_6.txt b/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_6.txt
index b0121ef5abe371..5b3dd5c6510484 100644
--- a/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_6.txt
+++ b/deps/v8/tools/testrunner/testproc/stack_utils/testdata/custom_analyzer/data_race_6.txt
@@ -59,9 +59,9 @@ WARNING: ThreadSanitizer: data race (pid=18876)
     #7 PreallocatePages src/heap/new-spaces.cc:984:10 (d8+0xa3d952) (BuildId: 6011f09c007429d6)
     #8 EnsureCurrentCapacity src/heap/new-spaces.cc:995:10 (d8+0xa3d952)
     #9 v8::internal::PagedNewSpace::EnsureCurrentCapacity() src/heap/new-spaces.h:790:25 (d8+0xa3d952)
-    #10 v8::internal::MinorMarkCompactCollector::Finish() src/heap/mark-compact.cc:6041:31 (d8+0x9d3018) (BuildId: 6011f09c007429d6)
-    #11 v8::internal::MinorMarkCompactCollector::CollectGarbage() src/heap/mark-compact.cc:6076:3 (d8+0x9d41f9) (BuildId: 6011f09c007429d6)
-    #12 v8::internal::Heap::MinorMarkCompact() src/heap/heap.cc:2600:34 (d8+0x9491ad) (BuildId: 6011f09c007429d6)
+    #10 v8::internal::MinorMarkSweepCollector::Finish() src/heap/mark-compact.cc:6041:31 (d8+0x9d3018) (BuildId: 6011f09c007429d6)
+    #11 v8::internal::MinorMarkSweepCollector::CollectGarbage() src/heap/mark-compact.cc:6076:3 (d8+0x9d41f9) (BuildId: 6011f09c007429d6)
+    #12 v8::internal::Heap::MinorMarkSweep() src/heap/heap.cc:2600:34 (d8+0x9491ad) (BuildId: 6011f09c007429d6)
     #13 v8::internal::Heap::PerformGarbageCollection(v8::internal::GarbageCollector, v8::internal::GarbageCollectionReason, char const*) src/heap/heap.cc:2258:5 (d8+0x942350) (BuildId: 6011f09c007429d6)
     #14 v8::internal::Heap::CollectGarbage(v8::internal::AllocationSpace, v8::internal::GarbageCollectionReason, v8::GCCallbackFlags) src/heap/heap.cc:1714:13 (d8+0x93d77e) (BuildId: 6011f09c007429d6)
     #15 v8::internal::HeapAllocator::AllocateRawWithLightRetrySlowPath(int, v8::internal::AllocationType, v8::internal::AllocationOrigin, v8::internal::AllocationAlignment) src/heap/heap-allocator.cc:95:14 (d8+0x92c626) (BuildId: 6011f09c007429d6)
diff --git a/deps/v8/tools/testrunner/testproc/util.py b/deps/v8/tools/testrunner/testproc/util.py
index e969a0347d7c91..ec874be2dac962 100644
--- a/deps/v8/tools/testrunner/testproc/util.py
+++ b/deps/v8/tools/testrunner/testproc/util.py
@@ -64,7 +64,7 @@ def base_test_record(test, result, run):
       'run': run + 1,
       'shard_id': test.shard_id,
       'shard_count': test.shard_count,
-      'target_name': test.get_shell(),
+      'target_name': test.shell,
       'variant': test.variant,
       'variant_flags': test.variant_flags,
   }
diff --git a/deps/v8/tools/testrunner/utils/test_utils.py b/deps/v8/tools/testrunner/utils/test_utils.py
index 7ab38b0e258e36..5403fb4b8969c0 100644
--- a/deps/v8/tools/testrunner/utils/test_utils.py
+++ b/deps/v8/tools/testrunner/utils/test_utils.py
@@ -15,17 +15,18 @@
 from dataclasses import dataclass
 from io import StringIO
 from mock import patch
-from os.path import dirname as up
+from pathlib import Path
 
 from testrunner.local.command import BaseCommand
 from testrunner.objects import output
 from testrunner.local.context import DefaultOSContext
 from testrunner.local.pool import SingleThreadedExecutionPool
+from testrunner.local.variants import REQUIRED_BUILD_VARIABLES
 
-TOOLS_ROOT = up(up(up(os.path.abspath(__file__))))
-sys.path.append(TOOLS_ROOT)
+TOOLS_ROOT = Path(__file__).resolve().parent.parent.parent
 
-TEST_DATA_ROOT = os.path.join(TOOLS_ROOT, 'testrunner', 'testdata')
+TEST_DATA_ROOT = TOOLS_ROOT / 'testrunner' / 'testdata'
+BUILD_CONFIG_BASE = TEST_DATA_ROOT / 'v8_build_config.json'
 
 from testrunner.local import command
 from testrunner.local import pool
@@ -35,7 +36,7 @@ def temp_dir():
   """Wrapper making a temporary directory available."""
   path = None
   try:
-    path = tempfile.mkdtemp('v8_test_')
+    path = Path(tempfile.mkdtemp('_v8_test'))
     yield path
   finally:
     if path:
@@ -51,9 +52,9 @@ def temp_base(baseroot='testroot1'):
         copied to the temporary test root, to guarantee a fresh setup with no
         dirty state.
   """
-  basedir = os.path.join(TEST_DATA_ROOT, baseroot)
+  basedir = TEST_DATA_ROOT / baseroot
   with temp_dir() as tempbase:
-    if os.path.exists(basedir):
+    if basedir.exists():
       shutil.copytree(basedir, tempbase, dirs_exist_ok=True)
     yield tempbase
 
@@ -77,13 +78,13 @@ def capture():
 def with_json_output(basedir):
   """ Function used as a placeholder where we need to resolve the value in the
   context of a temporary test configuration"""
-  return os.path.join(basedir, 'out.json')
+  return basedir / 'out.json'
 
 def clean_json_output(json_path, basedir):
   # Extract relevant properties of the json output.
   if not json_path:
     return None
-  if not os.path.exists(json_path):
+  if not json_path.exists():
     return '--file-does-not-exists--'
   with open(json_path) as f:
     json_output = json.load(f)
@@ -95,7 +96,7 @@ def replace_variable_data(data):
     data['duration'] = 1
     data['command'] = ' '.join(
         ['/usr/bin/python'] + data['command'].split()[1:])
-    data['command'] = data['command'].replace(basedir + '/', '')
+    data['command'] = data['command'].replace(f'{basedir}/', '')
   for data in json_output['slowest_tests']:
     replace_variable_data(data)
   for data in json_output['results']:
@@ -109,11 +110,29 @@ def sort_key(x):
   json_output['slowest_tests'].sort(key=sort_key)
   return json_output
 
+def setup_build_config(basedir, outdir):
+  """Ensure a build config file exists - default or from test root."""
+  path = basedir / outdir / 'build' / 'v8_build_config.json'
+  if path.exists():
+    return
+
+  # Use default build-config blueprint.
+  with open(BUILD_CONFIG_BASE) as f:
+    config = json.load(f)
+
+  # Add defaults for all variables used in variant configs.
+  for key in REQUIRED_BUILD_VARIABLES:
+    config[key] = False
+
+  os.makedirs(path.parent, exist_ok=True)
+  with open(path, 'w') as f:
+    json.dump(config, f)
+
 def override_build_config(basedir, **kwargs):
   """Override the build config with new values provided as kwargs."""
   if not kwargs:
     return
-  path = os.path.join(basedir, 'out', 'build', 'v8_build_config.json')
+  path = basedir / 'out' / 'build' / 'v8_build_config.json'
   with open(path) as f:
     config = json.load(f)
     config.update(kwargs)
@@ -147,7 +166,7 @@ def stderr_excludes(self, content):
     self.current_test_case.assertNotIn(content, self.stderr, self)
 
   def json_content_equals(self, expected_results_file):
-    with open(os.path.join(TEST_DATA_ROOT, expected_results_file)) as f:
+    with open(TEST_DATA_ROOT / expected_results_file) as f:
       expected_test_results = json.load(f)
 
     pretty_json = json.dumps(self.json, indent=2, sort_keys=True)
@@ -161,10 +180,14 @@ def setUpClass(cls):
     command.setup_testing()
     pool.setup_testing()
 
-  def run_tests(self, *args, baseroot='testroot1', config_overrides={}, **kwargs):
+  def run_tests(
+      self, *args, baseroot='testroot1', config_overrides=None,
+      with_build_config=True, outdir='out', **kwargs):
     """Executes the test runner with captured output."""
     with temp_base(baseroot=baseroot) as basedir:
-      override_build_config(basedir, **config_overrides)
+      if with_build_config:
+        setup_build_config(basedir, outdir)
+      override_build_config(basedir, **(config_overrides or {}))
       json_out_path = None
       def resolve_arg(arg):
         """Some arguments come as function objects to be called (resolved)
diff --git a/deps/v8/tools/tickprocessor-driver.mjs b/deps/v8/tools/tickprocessor-driver.mjs
index 13b5a2f06c392e..2e1c806bac6462 100644
--- a/deps/v8/tools/tickprocessor-driver.mjs
+++ b/deps/v8/tools/tickprocessor-driver.mjs
@@ -28,6 +28,7 @@
 import { ArgumentsProcessor, TickProcessor } from "./tickprocessor.mjs";
 
 const params = ArgumentsProcessor.process(arguments);
+// TODO(cbruni): Use common Processor from processor.mjs
 const tickProcessor = TickProcessor.fromParams(params);
 await tickProcessor.processLogFile(params.logFileName);
 if (params.serializeVMSymbols) {
diff --git a/deps/v8/tools/tickprocessor.mjs b/deps/v8/tools/tickprocessor.mjs
index 091cef6d318861..af9eb8c36e3840 100644
--- a/deps/v8/tools/tickprocessor.mjs
+++ b/deps/v8/tools/tickprocessor.mjs
@@ -531,10 +531,6 @@ export class TickProcessor extends LogReader {
         parsers: [parseInt, parseInt,],
         processor: this.processCodeMove
       },
-      'code-delete': {
-        parsers: [parseInt],
-        processor: this.processCodeDelete
-      },
       'code-source-info': {
         parsers: [parseInt, parseInt, parseInt, parseInt, parseString,
           parseString, parseString],
@@ -546,7 +542,7 @@ export class TickProcessor extends LogReader {
       },
       'sfi-move': {
         parsers: [parseInt, parseInt],
-        processor: this.processFunctionMove
+        processor: this.processSFIMove
       },
       'active-runtime-timer': {
         parsers: [parseString],
@@ -727,9 +723,9 @@ export class TickProcessor extends LogReader {
 
   processCodeCreation(type, kind, timestamp, start, size, name, maybe_func) {
     if (type != 'RegExp' && maybe_func.length) {
-      const funcAddr = parseInt(maybe_func[0]);
+      const sfiAddr = parseInt(maybe_func[0]);
       const state = Profile.parseState(maybe_func[1]);
-      this.profile_.addFuncCode(type, name, timestamp, start, size, funcAddr, state);
+      this.profile_.addFuncCode(type, name, timestamp, start, size, sfiAddr, state);
     } else {
       this.profile_.addCode(type, name, timestamp, start, size);
     }
@@ -761,8 +757,8 @@ export class TickProcessor extends LogReader {
     this.profile_.addScriptSource(script, url, source);
   }
 
-  processFunctionMove(from, to) {
-    this.profile_.moveFunc(from, to);
+  processSFIMove(from, to) {
+    this.profile_.moveSharedFunctionInfo(from, to);
   }
 
   includeTick(vmState) {
diff --git a/deps/v8/tools/torque/format-torque.py b/deps/v8/tools/torque/format-torque.py
index 30404a8151ced0..8ae2a4d3fa59f6 100755
--- a/deps/v8/tools/torque/format-torque.py
+++ b/deps/v8/tools/torque/format-torque.py
@@ -7,9 +7,9 @@
 """This program either generates the parser files for Torque, generating
 the source and header files directly in V8's src directory."""
 
-import subprocess
 import sys
 import re
+import json
 from subprocess import Popen, PIPE
 
 def decode(arg, encoding="utf-8"):
@@ -32,25 +32,66 @@ def preprocess(input):
   input = re.sub(r'([^/])\*([a-zA-Z(])', r'\1' + kDerefEscape + r'\2', input)
   input = re.sub(r'&([a-zA-Z(])', kAddressofEscape + r'\1', input)
 
-
   input = re.sub(r'(if\s+)constexpr(\s*\()', r'\1/*COxp*/\2', input)
-  input = re.sub(r'(\s+)operator\s*(\'[^\']+\')', r'\1/*_OPE \2*/', input)
   input = re.sub(r'\btypeswitch\s*(\([^{]*\))\s{', r' if /*tPsW*/ \1 {', input)
   input = re.sub(r'\bcase\s*(\([^{]*\))\s*:\s*deferred\s*{', r' if /*cAsEdEfF*/ \1 {', input)
   input = re.sub(r'\bcase\s*(\([^{]*\))\s*:\s*{', r' if /*cA*/ \1 {', input)
 
   input = re.sub(r'\bgenerates\s+\'([^\']+)\'\s*',
       r'_GeNeRaTeS00_/*\1@*/', input)
-  input = re.sub(r'\bconstexpr\s+\'([^\']+)\'\s*',
-      r' _CoNsExP_/*\1@*/', input)
+  input = re.sub(r'\bconstexpr\s+\'([^\']+)\'\s*', r'_CoNsExP_/*\1@*/', input)
+
+  def createFunctionReplacement(m):
+    torque_def = m.group(1)
+    torque_def = re.sub('\s+', ' ', torque_def)
+    function_len = len("function")
+    function_and_comment_len = len("function /**/")
+    if len(torque_def) < function_len:
+      return f'// !!torquefunc {torque_def}\nfunction '
+    else:
+      return f'// !!torquefunc {torque_def}\nfunction /*{"-" * (len(torque_def) - function_and_comment_len)}*/ '
+
+  input = re.sub(
+      r'^[ \t]*((?:extern\s+)?(?:transitioning\s+)?(?:javascript\s+)?(?:operator\s*\'[^\']+\'\s*)?(?:macro|builtin|runtime))\s+',
+      createFunctionReplacement,
+      input,
+      flags=re.MULTILINE)
+
+  def createClassReplacement(m):
+    torque_def = m.group(1)
+    class_len = len("class")
+    class_and_comment_len = len("class /**/")
+    if len(torque_def) < class_len:
+      return f'// !!torqueclass {torque_def}\nclass '
+    else:
+      return f'// !!torqueclass {torque_def}\nclass /*{"-" * (len(torque_def) - class_and_comment_len)}*/ '
+
+  input = re.sub(
+      r'^[ \t]*((?:extern\s+)?(?:bitfield\s+)?(?:struct|class|shape))\s+',
+      createClassReplacement,
+      input,
+      flags=re.MULTILINE)
+
   input = re.sub(r'\notherwise',
       r'\n otherwise', input)
   input = re.sub(r'(\n\s*\S[^\n]*\s)otherwise',
       r'\1_OtheSaLi', input)
-  input = re.sub(r'@if\(', r'@iF(', input)
-  input = re.sub(r'@export', r'@eXpOrT', input)
-  input = re.sub(r'js-implicit[ \n]+', r'jS_iMpLiCiT_', input)
-  input = re.sub(r'^(\s*namespace\s+[a-zA-Z_0-9]+\s*{)(\s*)$', r'\1}\2', input, flags = re.MULTILINE)
+  input = re.sub(r'@if(not)?\(', r'if /*!if\1*/ (', input)
+  input = re.sub(
+      r'(js-)?implicit\s+([^)]*?)\s*\)\(\s*\)',
+      r'/*\1ImPl*/\2Ǝ)',
+      input,
+      flags=re.DOTALL)
+  input = re.sub(
+      r'(js-)?implicit\s+([^)]*?)\s*\)\(\s*',
+      r'/*\1ImPl*/\2Ǝ,',
+      input,
+      flags=re.DOTALL)
+
+  # clang-format doesn't like decorators, so change them into line comments.
+  input = re.sub(
+      r'^(\s*)@([a-zA-Z]+)\n', r'\1//@\2\n', input, flags=re.MULTILINE)
+  input = re.sub(r'^(\s*)@export\b', r'\1//@eXpOrT', input, flags=re.MULTILINE)
 
   # includes are not recognized, change them into comments so that the
   # formatter ignores them first, until we can figure out a way to format cpp
@@ -60,10 +101,14 @@ def preprocess(input):
   return input
 
 def postprocess(output):
+  output = re.sub(
+      r'^(\s*)//@eXpOrT\b', r'\1@export', output, flags=re.MULTILINE)
+  output = re.sub(
+      r'^(\s*)//@([a-zA-Z]+)\n', r"\1@\2\n", output, flags=re.MULTILINE)
+
   output = re.sub(r'\/\*COxp\*\/', r'constexpr', output)
   output = re.sub(r'(\S+)\s*: type([,>])', r'\1: type\2', output)
   output = re.sub(r'(\n\s*)labels( [A-Z])', r'\1    labels\2', output)
-  output = re.sub(r'\/\*_OPE \'([^\']+)\'\*\/', r"operator '\1'", output)
   output = re.sub(r'\bif\s*\/\*tPsW\*\/', r'typeswitch', output)
   output = re.sub(r'\bif\s*\/\*cA\*\/\s*(\([^{]*\))\s*{', r'case \1: {', output)
   output = re.sub(r'\bif\s*\/\*cAsEdEfF\*\/\s*(\([^{]*\))\s*{', r'case \1: deferred {', output)
@@ -71,27 +116,34 @@ def postprocess(output):
       r"\n    generates '\1'", output)
   output = re.sub(r'_GeNeRaTeS00_\s*\/\*([^@]+)@\*\/',
       r"generates '\1'", output)
+  output = re.sub(r'\n_CoNsExP_\s*\/\*([^@]+)@\*\/', r"\n    constexpr '\1'",
+                  output)
   output = re.sub(r'_CoNsExP_\s*\/\*([^@]+)@\*\/',
       r"constexpr '\1'", output)
-  output = re.sub(r'\n(\s+)otherwise',
-      r"\n\1    otherwise", output)
-  output = re.sub(r'\n(\s+)_OtheSaLi',
-      r"\n\1otherwise", output)
-  output = re.sub(r'_OtheSaLi',
-      r"otherwise", output)
-  output = re.sub(r'@iF\(', r'@if(', output)
-  output = re.sub(r'@eXpOrT',
-      r"@export", output)
-  output = re.sub(r'jS_iMpLiCiT_',
-      r"js-implicit ", output)
+  output = re.sub(r'// !!torqueclass (.*)\n\s*class(?:\s*/\*-*\*/)?', r"\1",
+                  output)
+  output = re.sub(r'// !!torquefunc (.*)\n\s*function(?:\s*/\*-*\*/)?', r"\1",
+                  output)
+  output = re.sub(r'\n(\s+)otherwise', r"\n\1    otherwise", output)
+  output = re.sub(r'\n(\s+)_OtheSaLi', r"\n\1otherwise", output)
+  output = re.sub(r'_OtheSaLi', r"otherwise", output)
+  output = re.sub(r'if\s*/\*!if(not)?\*/\s*\(', r'@if\1(', output)
+  output = re.sub(
+      r'/\*\s*(js-)?ImPl\s*\*/\s*([^Ǝ]*?)Ǝ\s*\)',
+      r'\1implicit \2)()',
+      output,
+      flags=re.DOTALL)
+  output = re.sub(
+      r'/\*\s*(js-)?ImPl\s*\*/\s*([^Ǝ]*?)Ǝ\s*, *',
+      r'\1implicit \2)(',
+      output,
+      flags=re.DOTALL)
   output = re.sub(r'}\n *label ', r'} label ', output);
-  output = re.sub(r'^(\s*namespace\s+[a-zA-Z_0-9]+\s*{)}(\s*)$', r'\1\2', output, flags = re.MULTILINE);
 
   output = re.sub(kPercentEscape, r'%', output)
   output = re.sub(kDerefEscape, r'*', output)
   output = re.sub(kAddressofEscape, r'&', output)
 
-
   output = re.sub( r'^// InClUdE',r'#include', output, flags=re.MULTILINE)
 
   return output
@@ -102,10 +154,21 @@ def process(filename, lint, should_format):
 
   original_input = content
 
+  style = {"BasedOnStyle": "Google", "NamespaceIndentation": "None"}
+
   if sys.platform.startswith('win'):
-    p = Popen(['clang-format', '-assume-filename=.ts'], stdin=PIPE, stdout=PIPE, stderr=PIPE, shell=True)
+    p = Popen(
+        ['clang-format', '-assume-filename=.ts', '-style=' + json.dumps(style)],
+        stdin=PIPE,
+        stdout=PIPE,
+        stderr=PIPE,
+        shell=True)
   else:
-    p = Popen(['clang-format', '-assume-filename=.ts'], stdin=PIPE, stdout=PIPE, stderr=PIPE)
+    p = Popen(
+        ['clang-format', '-assume-filename=.ts', '-style=' + json.dumps(style)],
+        stdin=PIPE,
+        stdout=PIPE,
+        stderr=PIPE)
   output, err = p.communicate(encode(preprocess(content)))
   output = postprocess(decode(output))
   rc = p.returncode
@@ -138,7 +201,6 @@ def is_option(arg):
     return arg in ['-i', '-l', '-il']
 
   should_format = lint = False
-  use_stdout = True
 
   flag, files = sys.argv[1], sys.argv[2:]
   if is_option(flag):
diff --git a/deps/v8/tools/try_perf.py b/deps/v8/tools/try_perf.py
index 37de0ef694fae6..d54c537a71a951 100755
--- a/deps/v8/tools/try_perf.py
+++ b/deps/v8/tools/try_perf.py
@@ -12,14 +12,15 @@
 import sys
 
 BOTS = {
-  '--linux32': 'v8_linux32_perf_try',
+  '--linux32': 'v8_linux_perf_try',
   '--linux64': 'v8_linux64_perf_try',
-  '--nexus5': 'v8_nexus5_perf_try',
-  '--pixel2': 'v8_pixel2_perf_try',
+  '--m1': 'v8_mac_arm64_perf_try',
+  '--nexus5': 'v8_android_arm_perf_try',
+  '--pixel4': 'v8_android_arm64_perf_try',
 }
 
 DEFAULT_BOTS = [
-  'v8_linux32_perf_try',
+  'v8_linux_perf_try',
   'v8_linux64_perf_try',
 ]
 
@@ -87,7 +88,7 @@ def main():
       print ('%s not found in our benchmark list. The respective trybot might '
             'fail, unless you run something this script isn\'t aware of. '
             'Available public benchmarks: %s' % (benchmark, PUBLIC_BENCHMARKS))
-      print('Proceed anyways? [Y/n] ', end=' ')
+      print('Proceed anyways? [Y/n] ', end=' ', flush=True)
       answer = sys.stdin.readline().strip()
       if answer != "" and answer != "Y" and answer != "y":
         return 1
@@ -99,7 +100,8 @@ def main():
   subprocess.check_output(
       'update_depot_tools', shell=True, stderr=subprocess.STDOUT, cwd=V8_BASE)
 
-  cmd = ['git cl try', '-B', 'luci.v8-internal.try']
+  # Trigger the perf try bots.
+  cmd = ['git cl try', '-B', 'v8-internal/try']
   cmd += ['-b %s' % bot for bot in options.bots]
   if options.revision:
     cmd.append('-r %s' % options.revision)
@@ -114,5 +116,11 @@ def main():
     print('Running %s' % ' '.join(cmd))
   subprocess.check_call(' '.join(cmd), shell=True, cwd=V8_BASE)
 
+  # Show a hint to report bugs.
+  print('To file a bug or new feature:    %s' % (
+      'https://bugs.chromium.org/p/v8/issues/entry?summary=[perf-trybots]%20%'
+      '3CIssue%3E&components=Infrastructure'
+  ))
+
 if __name__ == '__main__':  # pragma: no cover
   sys.exit(main())
diff --git a/deps/v8/tools/turbolizer/README.md b/deps/v8/tools/turbolizer/README.md
index fa804f65e94772..e627cd22f200f8 100644
--- a/deps/v8/tools/turbolizer/README.md
+++ b/deps/v8/tools/turbolizer/README.md
@@ -17,7 +17,11 @@ Turbolizer is build using npm:
 Afterwards, turbolizer can be hosted locally by starting a web server that serve
 the contents of the turbolizer directory, e.g.:
 
-    python -m SimpleHTTPServer 8000
+    python2 -m SimpleHTTPServer 8000
+
+If the version of python is above 3.x, please use this command:
+
+    python3 -m  http.server 8000
 
 To deploy to a directory that can be hosted the script `deploy` can be used. The
 following command will deploy to the directory /www/turbolizer:
diff --git a/deps/v8/tools/turbolizer/css/turbo-visualizer-ranges.css b/deps/v8/tools/turbolizer/css/turbo-visualizer-ranges.css
index c1ec95fcc96f13..489e380e879387 100644
--- a/deps/v8/tools/turbolizer/css/turbo-visualizer-ranges.css
+++ b/deps/v8/tools/turbolizer/css/turbo-visualizer-ranges.css
@@ -283,6 +283,13 @@ input.range-toggle-setting {
   background-color: rgb(86, 235, 72);
 }
 
+.focused.range-block-id,
+.focused.range-instruction-id,
+.focused.range-reg,
+.focused.range-position {
+  background-color: rgb(45, 126, 202);
+}
+
 .range-type-header,
 .range-block-id,
 .range-instruction-id,
@@ -412,6 +419,14 @@ input.range-toggle-setting {
   border-bottom: none;
 }
 
+.range-block-id.selected.focused:hover,
+.range-instruction-id.selected.focused:hover,
+.range-reg.selected.focused:hover,
+.range-position.selected.focused:hover,
+.focused:hover {
+  background-color: rgb(50, 158, 221);
+}
+
 .range,
 .range-interval,
 .range-interval-wrapper,
@@ -481,4 +496,14 @@ input.range-toggle-setting {
   width: 100%;
   border: var(--range-position-border) solid transparent;
   color: transparent;
-}
\ No newline at end of file
+}
+
+.range-background-canvas-div {
+  float: left;
+  position: absolute;
+  z-index: -1;
+}
+
+.range-background-div {
+  --range-position-border: 0px;
+}
diff --git a/deps/v8/tools/turbolizer/info-view.html b/deps/v8/tools/turbolizer/info-view.html
index ea2ceaeb10505d..2763c218b4e0b0 100644
--- a/deps/v8/tools/turbolizer/info-view.html
+++ b/deps/v8/tools/turbolizer/info-view.html
@@ -158,7 +158,7 @@
         <td>Select nodes according to regular expression, always including invisible nodes regardless of checkbox.</td>
       </tr>
     </table>
-    <div style="font-weight: bold;">Useful patterns</div>
+    <div style="font-weight: bold; margin-top: 0.5em;">Useful patterns</div>
     <table>
       <tr>
         <td>IfTrue</td>
@@ -175,4 +175,54 @@
       </tr>
     </table>
   </div>
+  <div id="info-ts-graph" class="info-topic">
+    <div class="info-topic-header">Turboshaft operation effects</div>
+    <div class="info-topic-content">
+      <table>
+        <tr>
+          <td>🁣</td>
+          <td>neither produce nor consume: can be reordered freely</td>
+        </tr>
+        <tr>
+          <td>🁤</td>
+          <td>produce: do not move after consume in same dimension</td>
+        </tr>
+        <tr>
+          <td>🁪</td>
+          <td>consume: do not move before produce in same dimension</td>
+        </tr>
+        <tr>
+          <td>🁫</td>
+          <td>produce and consume</td>
+        </tr>
+      </table>
+      <div style="font-weight: bold; margin-top: 0.5em;">Dimensions</div>
+      <table>
+        <tr>
+          <td>🁣🁣</td>
+          <td> load_heap_memory </td>
+          <td> load_off_heap_memory </td>
+        </tr>
+        <tr>
+          <td>🁣🁣</td>
+          <td> store_heap_memory</td>
+          <td> store_off_heap_memory </td>
+        </tr>
+        <tr>
+          <td>🁣🁣</td>
+          <td> before_raw_heap_access </td>
+          <td> after_raw_heap_access </td>
+        </tr>
+        <tr>
+          <td>🁣</td>
+          <td> control_flow</td>
+        </tr>
+        <tr>
+          <td>(i|_)(a|_)</td>
+          <td> can_create_identity </td>
+          <td> can_allocate </td>
+        </tr>
+      </table>
+    </div>
+  </div>
 </div>
diff --git a/deps/v8/tools/turbolizer/src/common/constants.ts b/deps/v8/tools/turbolizer/src/common/constants.ts
index 2aa7396b852e01..7cd0ff5aec2f3c 100644
--- a/deps/v8/tools/turbolizer/src/common/constants.ts
+++ b/deps/v8/tools/turbolizer/src/common/constants.ts
@@ -37,6 +37,11 @@ export const FLIPPED_REGISTER_WIDTH_BUFFER = 5;
 // to 1000 places. Regardless of this, a limit is required at some point due
 // to performance issues.
 export const MAX_NUM_POSITIONS = 999;
+export const RANGES_REG_GRID_COLUMN = -1;
+export const RANGES_NUM_POS_HEADER_ROWS = 3;
+export const RANGES_BLOCK_GRID_ROW = -RANGES_NUM_POS_HEADER_ROWS;
+export const RANGES_INSTR_GRID_ROW = RANGES_BLOCK_GRID_ROW + 1;
+export const RANGES_POS_GRID_ROW = RANGES_INSTR_GRID_ROW + 1;
 export const SESSION_STORAGE_PREFIX = "ranges-setting-";
 export const INTERVAL_TEXT_FOR_NONE = "none";
 export const INTERVAL_TEXT_FOR_CONST = "const";
@@ -72,3 +77,9 @@ export const PROF_COLS = [
   { perc: 15, col: { r: 255, g: 0, b: 0 } },
   { perc: 100, col: { r: 0, g: 0, b: 0 } }
 ];
+export const RANGE_BACKGROUND_BORDER_COLOR = "#6D6B6B";
+export const RANGE_BACKGROUND_SELECT_COLOR = "#FFFF33";
+export const RANGE_BACKGROUND_FOCUS_COLOR = "#2D7ECA";
+export const RANGE_POSITION_BORDER_WIDTH = 1;
+export const RANGE_REGISTER_BORDER_WIDTH = 1;
+export const RANGE_REGISTER_BORDER_WIDTH_X2 = 2 * RANGE_REGISTER_BORDER_WIDTH;
diff --git a/deps/v8/tools/turbolizer/src/phases/schedule-phase.ts b/deps/v8/tools/turbolizer/src/phases/schedule-phase.ts
index 467ea297efe6c7..44a650d20c29e3 100644
--- a/deps/v8/tools/turbolizer/src/phases/schedule-phase.ts
+++ b/deps/v8/tools/turbolizer/src/phases/schedule-phase.ts
@@ -63,7 +63,11 @@ export class SchedulePhase extends Phase {
     }
     const blockRpo = Number.parseInt(match.groups.rpo, 10);
     const blockId = Number.parseInt(match.groups.id, 10);
-    const block = new ScheduleBlock(blockRpo, blockId, match.groups.deferred !== undefined,
+    let blockCount = -1;
+    if (match.groups.count !== undefined){
+      blockCount = Number.parseInt(match.groups.count, 10);
+    }
+    const block = new ScheduleBlock(blockRpo, blockId, blockCount, match.groups.deferred !== undefined,
       predecessors.sort());
     this.data.blocksRpo[block.rpo] = block;
   }
@@ -84,6 +88,7 @@ export class SchedulePhase extends Phase {
     },
     {
       lineRegexps: [
+        /^\s*---\s*BLOCK\ B(?<rpo>\d+)\ id(?<id>\d+)\ PGO Execution Count:(?<count>\d+)\s*(?<deferred>\(deferred\))?(\ <-\ )?(?<in>[^-]*)?\ ---$/,
         /^\s*---\s*BLOCK\ B(?<rpo>\d+)\ id(?<id>\d+)\s*(?<deferred>\(deferred\))?(\ <-\ )?(?<in>[^-]*)?\ ---$/,
         /^\s*---\s*BLOCK\ B(?<rpo>\d+)\s*(?<deferred>\(deferred\))?(\ <-\ )?(?<in>[^-]*)?\ ---$/
       ],
@@ -115,14 +120,16 @@ export class ScheduleNode {
 export class ScheduleBlock {
   rpo: number;
   id: number;
+  count: number;
   deferred: boolean;
   predecessors: Array<number>;
   successors: Array<number>;
   nodes: Array<ScheduleNode>;
 
-  constructor(rpo: number, id: number, deferred: boolean, predecessors: Array<number>) {
+  constructor(rpo: number, id: number, count: number, deferred: boolean, predecessors: Array<number>) {
     this.rpo = rpo;
     this.id = id;
+    this.count = count;
     this.deferred = deferred;
     this.predecessors = predecessors;
     this.successors = new Array<number>();
diff --git a/deps/v8/tools/turbolizer/src/phases/sequence-phase.ts b/deps/v8/tools/turbolizer/src/phases/sequence-phase.ts
index 97813aabb071ec..81fa36c156ade5 100644
--- a/deps/v8/tools/turbolizer/src/phases/sequence-phase.ts
+++ b/deps/v8/tools/turbolizer/src/phases/sequence-phase.ts
@@ -225,12 +225,12 @@ export class ChildRange {
         return new RangeToolTip(`${C.INTERVAL_TEXT_FOR_STACK}${registerIndex}`, true);
       default:
         if (this.op instanceof SequenceBlockOperand && this.op.type == "constant") {
-          new RangeToolTip(C.INTERVAL_TEXT_FOR_CONST, false);
+          return new RangeToolTip(C.INTERVAL_TEXT_FOR_CONST, false);
         } else {
           if (this.op instanceof SequenceBlockOperand && this.op.text) {
-            new RangeToolTip(this.op.text, true);
+            return new RangeToolTip(this.op.text, true);
           } else if (typeof this.op === "string") {
-            new RangeToolTip(this.op, true);
+            return new RangeToolTip(this.op, true);
           }
         }
     }
diff --git a/deps/v8/tools/turbolizer/src/phases/turboshaft-graph-phase/turboshaft-graph-node.ts b/deps/v8/tools/turbolizer/src/phases/turboshaft-graph-phase/turboshaft-graph-node.ts
index 759aed54f2bfdf..86d871c4288e2f 100644
--- a/deps/v8/tools/turbolizer/src/phases/turboshaft-graph-phase/turboshaft-graph-node.ts
+++ b/deps/v8/tools/turbolizer/src/phases/turboshaft-graph-phase/turboshaft-graph-node.ts
@@ -16,18 +16,18 @@ export class TurboshaftGraphNode extends Node<TurboshaftGraphEdge<TurboshaftGrap
   sourcePosition: SourcePosition;
   bytecodePosition: BytecodePosition;
   origin: NodeOrigin;
-  opPropertiesType: OpPropertiesType;
+  opEffects: String;
 
   constructor(id: number, title: string, block: TurboshaftGraphBlock,
               sourcePosition: SourcePosition, bytecodePosition: BytecodePosition,
-              origin: NodeOrigin, opPropertiesType: OpPropertiesType) {
+              origin: NodeOrigin, opEffects: String) {
     super(id);
     this.title = title;
     this.block = block;
     this.sourcePosition = sourcePosition;
     this.bytecodePosition = bytecodePosition;
     this.origin = origin;
-    this.opPropertiesType = opPropertiesType;
+    this.opEffects = opEffects;
     this.visible = true;
   }
 
@@ -45,17 +45,22 @@ export class TurboshaftGraphNode extends Node<TurboshaftGraphEdge<TurboshaftGrap
   }
 
   public getTitle(): string {
-    let title = `${this.id} ${this.title} ${this.opPropertiesType}`;
+    let title = `${this.id} ${this.title}`;
+    title += `\nEffects: ${this.opEffects}`;
     if (this.origin) {
       title += `\nOrigin: ${this.origin.toString()}`;
     }
     if (this.inputs.length > 0) {
-      title += `\nInputs: ${this.inputs.map(i => i.source.id).join(", ")}`;
+      title += `\nInputs: ${this.inputs.map(i => formatInput(i.source)).join(", ")}`;
     }
     if (this.outputs.length > 0) {
       title += `\nOutputs: ${this.outputs.map(i => i.target.id).join(", ")}`;
     }
     return title;
+
+    function formatInput(input: TurboshaftGraphNode) {
+      return `[${input.block}] ${input.displayLabel}`;
+    }
   }
 
   public getHistoryLabel(): string {
@@ -77,12 +82,3 @@ export class TurboshaftGraphNode extends Node<TurboshaftGraphEdge<TurboshaftGrap
     return this.title === that.title;
   }
 }
-
-export enum OpPropertiesType {
-  Pure = "Pure",
-  Reading = "Reading",
-  Writing = "Writing",
-  CanDeopt = "CanDeopt",
-  AnySideEffects = "AnySideEffects",
-  BlockTerminator = "BlockTerminator"
-}
diff --git a/deps/v8/tools/turbolizer/src/phases/turboshaft-graph-phase/turboshaft-graph-phase.ts b/deps/v8/tools/turbolizer/src/phases/turboshaft-graph-phase/turboshaft-graph-phase.ts
index a5da370ad7f8a8..23cddfc42eca23 100644
--- a/deps/v8/tools/turbolizer/src/phases/turboshaft-graph-phase/turboshaft-graph-phase.ts
+++ b/deps/v8/tools/turbolizer/src/phases/turboshaft-graph-phase/turboshaft-graph-phase.ts
@@ -102,7 +102,7 @@ export class TurboshaftGraphPhase extends Phase {
       }
 
       const node = new TurboshaftGraphNode(nodeJson.id, nodeJson.title, block, sourcePosition,
-        bytecodePosition, origin, nodeJson.op_properties_type);
+        bytecodePosition, origin, nodeJson.op_effects);
 
       block.nodes.push(node);
       this.data.nodes.push(node);
diff --git a/deps/v8/tools/turbolizer/src/views/range-view.ts b/deps/v8/tools/turbolizer/src/views/range-view.ts
index 94fc4b86d1e2dc..b27343c3435a57 100644
--- a/deps/v8/tools/turbolizer/src/views/range-view.ts
+++ b/deps/v8/tools/turbolizer/src/views/range-view.ts
@@ -8,20 +8,165 @@ import { createElement, getNumericCssValue,
 import { SequenceView } from "./sequence-view";
 import { Interval } from "../interval";
 import { ChildRange, Range, RangeToolTip, SequenceBlock } from "../phases/sequence-phase";
+import { SelectionBroker } from "../selection/selection-broker";
+import { BlockSelectionHandler,
+         RegisterAllocationSelectionHandler } from "../selection/selection-handler";
 
 // This class holds references to the HTMLElements that represent each cell.
 class Grid {
   elements: Array<Array<HTMLElement>>;
-
-  constructor() {
+  background: HTMLCanvasElement;
+  backgroundContext: CanvasRenderingContext2D;
+  backgroundScrollLeft: number;
+  backgroundScrollTop: number;
+  backgroundFocusRow: number;
+  backgroundFocusColumn: number;
+  rows: number;
+  columns: number;
+
+  constructor(canvas: HTMLCanvasElement) {
     this.elements = new Array<Array<HTMLElement>>();
+    this.background = canvas;
+    this.backgroundContext = this.background.getContext("2d");
+    this.background.style.setProperty("margin-left", "0px");
+    this.backgroundScrollLeft = 0;
+    this.backgroundScrollTop = 0;
+    this.backgroundFocusRow = -1;
+    this.backgroundFocusColumn = -1;
   }
 
   public setRow(row: number, elementsRow: Array<HTMLElement>): void {
     this.elements[row] = elementsRow;
   }
 
+  public updateBackgroundFocusPoint(row: number, column: number): void {
+    this.backgroundFocusRow = row;
+    this.backgroundFocusColumn = column;
+  }
+
+  public clearBackgroundFocusPoint(): void {
+    this.backgroundFocusRow = -1;
+    this.backgroundFocusColumn = -1;
+  }
+
+  public updateBackground(view: RangeView, scrollTop: number, scrollLeft: number): void {
+    // Update canvas size.
+    if (view.divs.grid === undefined) return;
+    if (view.divs.registers === undefined) return;
+    if (view.divs.positionHeaders === null) return;
+    const positions = view.divs.positionHeaders.lastChild as HTMLElement;
+    const gridBoundRect = view.divs.grid.getBoundingClientRect();
+    const yAxisBoundRect = view.divs.yAxis.getBoundingClientRect();
+    this.background.style.setProperty(
+      "margin-left", yAxisBoundRect.width.toString() + "px");
+    this.background.style.setProperty(
+      "margin-top", (yAxisBoundRect.top - gridBoundRect.top).toString() + "px");
+    const rangePosCellSize = view.divs.getRangePositionCellSize();
+    const rangeRegCellSize = view.divs.getRangeRegCellSize();
+    const flipped = view.userSettings.get("flipped");
+    const canvasWidth = Math.min(gridBoundRect.width,
+      flipped ? view.divs.registers.getBoundingClientRect().width :
+                positions.getBoundingClientRect().width);
+    const canvasHeight = Math.min(gridBoundRect.height,
+      flipped ? positions.getBoundingClientRect().height :
+                view.divs.registers.getBoundingClientRect().height);
+    this.background.setAttribute("width", canvasWidth.toString());
+    this.background.setAttribute("height", canvasHeight.toString());
+    const firstPosition = view.instructionRangeHandler.getFirstPosition();
+    // Draw background lines and highlight select sections.
+    if (!flipped) {
+      const startRow = Math.floor(scrollTop / rangeRegCellSize[1]);
+      const endRow = Math.floor((scrollTop + canvasHeight) / rangeRegCellSize[1]);
+      const startColumn = Math.floor(scrollLeft / rangePosCellSize[0]);
+      const endColumn = Math.floor((scrollLeft + canvasWidth) / rangePosCellSize[0]);
+      // Draw the highlight region.
+      this.backgroundContext.fillStyle = C.RANGE_BACKGROUND_SELECT_COLOR;
+      let yAxisPos = startRow * rangeRegCellSize[1] - scrollTop + C.RANGE_REGISTER_BORDER_WIDTH;
+      for (let row = startRow; row <= endRow; row++) {
+        if (view.divs.isRangeRegSelected(row)) {
+          this.backgroundContext.fillRect(0, yAxisPos, canvasWidth, rangeRegCellSize[1]);
+        }
+        yAxisPos += rangeRegCellSize[1];
+      }
+      let xAxisPos = startColumn * rangePosCellSize[0] - scrollLeft;
+      for (let column = startColumn; column <= endColumn; column++) {
+        if (view.divs.isRangePositionSelected(column)) {
+          this.backgroundContext.fillRect(xAxisPos, 0, rangePosCellSize[0], canvasHeight);
+        }
+        xAxisPos += rangePosCellSize[0];
+      }
+      // Draw the focus point.
+      if (this.canShowFocus([startRow, endRow,
+                             startColumn + firstPosition, endColumn + firstPosition])) {
+        this.backgroundContext.fillStyle = C.RANGE_BACKGROUND_FOCUS_COLOR;
+        const xPos = (this.backgroundFocusColumn - firstPosition) * rangePosCellSize[0] - scrollLeft;
+        const yPos = this.backgroundFocusRow * rangeRegCellSize[1] - scrollTop;
+        this.backgroundContext.fillRect(xPos, yPos, rangePosCellSize[0], rangeRegCellSize[1]);
+      }
+      // Draw the background lines.
+      this.backgroundContext.fillStyle = C.RANGE_BACKGROUND_BORDER_COLOR;
+      yAxisPos = (startRow + 1) * rangeRegCellSize[1] - scrollTop;
+      for (let row = startRow; row <= endRow; row++) {
+        this.backgroundContext.fillRect(0, yAxisPos - C.RANGE_REGISTER_BORDER_WIDTH,
+                                        canvasWidth, C.RANGE_REGISTER_BORDER_WIDTH_X2);
+        yAxisPos += rangeRegCellSize[1];
+      }
+      xAxisPos = (startColumn + 1) * rangePosCellSize[0] - scrollLeft;
+      for (let column = startColumn; column <= endColumn; column++) {
+        const borderWidth = this.getBorderWidth(view, column + firstPosition);
+        this.backgroundContext.fillRect(xAxisPos - borderWidth, 0, borderWidth, canvasHeight);
+        xAxisPos += rangePosCellSize[0];
+      }
+    } else {
+      const startRow = Math.floor(scrollTop / rangePosCellSize[1]);
+      const endRow = Math.floor((scrollTop + canvasHeight) / rangePosCellSize[1]);
+      const startColumn = Math.floor(scrollLeft / rangeRegCellSize[0]);
+      const endColumn = Math.floor((scrollLeft + canvasWidth) / rangeRegCellSize[0]);
+      // Draw the highlight region.
+      this.backgroundContext.fillStyle = C.RANGE_BACKGROUND_SELECT_COLOR;
+      let yAxisPos = startRow * rangePosCellSize[1] - scrollTop;
+      for (let row = startRow; row <= endRow; row++) {
+        if (view.divs.isRangePositionSelected(row)) {
+          this.backgroundContext.fillRect(0, yAxisPos, canvasWidth, rangePosCellSize[1]);
+        }
+        yAxisPos += rangePosCellSize[1];
+      }
+      let xAxisPos = startColumn * rangeRegCellSize[0] - scrollLeft + C.RANGE_REGISTER_BORDER_WIDTH;
+      for (let column = startColumn; column <= endColumn; column++) {
+        if (view.divs.isRangeRegSelected(column)) {
+          this.backgroundContext.fillRect(xAxisPos, 0, rangeRegCellSize[0], canvasHeight);
+        }
+        xAxisPos += rangeRegCellSize[0];
+      }
+      // Draw the focus point.
+      if (this.canShowFocus([startColumn, endColumn,
+                             startRow + firstPosition, endRow + firstPosition])) {
+        this.backgroundContext.fillStyle = C.RANGE_BACKGROUND_FOCUS_COLOR;
+        const xPos = this.backgroundFocusRow * rangeRegCellSize[0] - scrollLeft;
+        const yPos = (this.backgroundFocusColumn - firstPosition) * rangePosCellSize[1] - scrollTop;
+        this.backgroundContext.fillRect(xPos, yPos, rangeRegCellSize[0], rangePosCellSize[1]);
+      }
+      // Draw the background lines.
+      this.backgroundContext.fillStyle = C.RANGE_BACKGROUND_BORDER_COLOR;
+      yAxisPos = (startRow + 1) * rangePosCellSize[1] - scrollTop;
+      for (let row = startRow; row <= endRow; row++) {
+        const borderWidth = this.getBorderWidth(view, row + firstPosition);
+        this.backgroundContext.fillRect(0, yAxisPos - borderWidth, canvasWidth, borderWidth);
+        yAxisPos += rangePosCellSize[1];
+      }
+      xAxisPos = (startColumn + 1) * rangeRegCellSize[0] - scrollLeft;
+      for (let column = startColumn; column <= endColumn; column++) {
+        this.backgroundContext.fillRect(xAxisPos - C.RANGE_REGISTER_BORDER_WIDTH, 0,
+                                        C.RANGE_REGISTER_BORDER_WIDTH_X2, canvasHeight);
+        xAxisPos += rangeRegCellSize[0];
+      }
+    }
+    this.backgroundScrollLeft = scrollLeft;
+    this.backgroundScrollTop = scrollTop;
+  }
+
   public getCell(row: number, column: number): HTMLElement {
+    if (this.elements[row] === undefined) return undefined;
     return this.elements[row][column];
   }
 
@@ -29,6 +174,17 @@ class Grid {
     // The cell is within an inner wrapper div which is within the interval div.
     return this.getCell(row, column).parentElement.parentElement;
   }
+
+  private getBorderWidth(view: RangeView, position: number): number {
+    return view.blocksData.isBlockBorder(position) ? view.cssVariables.blockBorderWidth :
+            view.blocksData.isInstructionBorder(position) ? view.cssVariables.instrBorder :
+                                                              C.RANGE_POSITION_BORDER_WIDTH;
+  }
+
+  private canShowFocus(bound: Array<number>): boolean {
+    return this.backgroundFocusRow >= bound[0] && this.backgroundFocusRow <= bound[1] &&
+            this.backgroundFocusColumn >= bound[2] && this.backgroundFocusColumn <= bound[3];
+  }
 }
 
 // This class is used as a wrapper to hide the switch between the
@@ -64,7 +220,7 @@ class GridAccessor {
     return this.currentGrid().getInterval(row, column);
   }
 
-  private currentGrid(): Grid {
+  public currentGrid(): Grid {
     return this.grids.get(this.sequenceView.currentPhaseIndex);
   }
 }
@@ -107,12 +263,14 @@ class CSSVariables {
   positionBorder: number;
   blockBorderWidth: number;
   flippedPositionHeight: number;
+  instrBorder: number;
 
   constructor() {
     this.positionWidth = getNumericCssValue("--range-position-width");
     this.positionBorder = getNumericCssValue("--range-position-border");
     this.blockBorderWidth = getNumericCssValue("--range-block-border");
     this.flippedPositionHeight = getNumericCssValue("--range-flipped-position-height");
+    this.instrBorder = getNumericCssValue("--range-instr-border");
   }
 
   setVariables(numPositions: number, numRegisters: number) {
@@ -301,6 +459,34 @@ class Divs {
     titleEl.appendChild(userSettings.getToggleElement("flipped", "Switched Axes"));
     return titleEl;
   }
+
+  public getRangePositionCellSize(): Array<number> {
+    const positions = this.positionHeaders.lastChild as HTMLElement;
+    if (positions.children.length == 0) return [0, 0];
+    const rangePositionRect = positions.children[0].getBoundingClientRect();
+    return [rangePositionRect.width, rangePositionRect.height];
+  }
+
+  public getRangeRegCellSize(): Array<number> {
+    if (this.registers.children.length == 0) return [0, 0];
+    const yAxisRect = this.registers.children[0].getBoundingClientRect();
+    return [yAxisRect.width, yAxisRect.height];
+  }
+
+  public isRangePositionSelected(column: number): boolean {
+    const positions = this.positionHeaders.lastChild as HTMLElement;
+    if (positions.children.length < column) return false;
+    const rangePositionEl = positions.children[column] as HTMLElement;
+    if (rangePositionEl === undefined) return false;
+    return rangePositionEl.classList.contains('selected');
+  }
+
+  public isRangeRegSelected(row: number): boolean {
+    if (this.registers.children.length < row) return false;
+    const rangeRegisterEl = this.registers.children[row] as HTMLElement;
+    if (rangeRegisterEl === undefined) return false;
+    return rangeRegisterEl.classList.contains('selected');
+  }
 }
 
 class RowConstructor {
@@ -335,12 +521,18 @@ class RowConstructor {
     const positionsArray = new Array<HTMLElement>(this.view.instructionRangeHandler.numPositions);
     const posOffset = this.view.instructionRangeHandler.getPositionFromIndex(0);
     let blockId = this.view.instructionRangeHandler.getBlockIdFromIndex(0);
+    let lastIntervalEndPos = -1;
     for (let column = 0; column < this.view.instructionRangeHandler.numPositions; ++column) {
       const interval = intervalMap.get(column);
       if (interval === undefined) {
-        positionsArray[column] = getElementForEmptyPosition(column);
-        this.view.selectionHandler.addCell(positionsArray[column], row, column + posOffset,
-                                           blockId, registerId);
+        if (column == lastIntervalEndPos || column == this.view.instructionRangeHandler.numPositions - 1) {
+          // Add one empty div element at the end of interval to display the use mark.
+          positionsArray[column] = getElementForEmptyPosition(column);
+          this.view.selectionHandler.addCell(positionsArray[column], row,
+                                      column + posOffset, blockId, registerId, undefined, true);
+        } else {
+          positionsArray[column] = undefined;
+        }
         if (this.view.blocksData.isBlockBorder(column + posOffset)) ++blockId;
       } else {
         callbackForInterval(column, interval);
@@ -358,6 +550,7 @@ class RowConstructor {
           if (this.view.blocksData.isBlockBorder(intervalColumn + posOffset)) ++blockId;
         }
         column += intervalPositionElements.length - 1;
+        lastIntervalEndPos = column + 1;
       }
     }
 
@@ -400,7 +593,7 @@ class RowConstructor {
   {
     const intervalEl = createElement("div", "range-interval");
     intervalEl.dataset.tooltip = tooltip.text;
-    const title = `${childRange.id}:${index} ${tooltip}`;
+    const title = `${childRange.id}:${index} ${tooltip.text}`;
     intervalEl.setAttribute("title", isDeferred ? `deferred: ${title}` : title);
     this.setIntervalColor(intervalEl, tooltip.text);
 
@@ -461,7 +654,10 @@ class RowConstructor {
           if (!this.view.instructionRangeHandler.isPositionInRange(use)) continue;
           use = this.view.instructionRangeHandler.getIndexFromPosition(use);
         }
-        grid.getCell(row, use).classList.toggle("range-use", true);
+        const gridCell = grid.getCell(row, use);
+        if (gridCell !== undefined) {
+          gridCell.classList.toggle("range-use", true);
+        }
       }
     }
   }
@@ -597,7 +793,11 @@ class RangeViewConstructor {
   }
 
   public construct(): void {
-    this.grid = new Grid();
+    const backgroundCanvas = document.createElement("canvas");
+    const backgroundCanvasDiv = createElement("div", "range-background-canvas-div");
+    backgroundCanvasDiv.appendChild(backgroundCanvas);
+
+    this.grid = new Grid(backgroundCanvas);
     this.view.gridAccessor.addGrid(this.grid);
 
     this.view.divs.wholeHeader = this.elementForHeader();
@@ -611,8 +811,11 @@ class RangeViewConstructor {
       this.view.scrollHandler.syncScroll(ToSync.TOP, this.view.divs.yAxis, this.view.divs.grid);
       this.view.scrollHandler.saveScroll();
     };
+
+    gridContainer.appendChild(backgroundCanvasDiv);
     gridContainer.appendChild(this.view.divs.yAxis);
     gridContainer.appendChild(this.view.divs.grid);
+    this.view.selectionHandler.addBackground(this.view.divs.grid);
     this.view.divs.showOnLoad.appendChild(gridContainer);
 
     this.resetGroups();
@@ -667,6 +870,7 @@ class RangeViewConstructor {
           const registerEl = this.elementForRegister(row, registerName, registerId, true);
           this.addRowToGroup(row, rowEl);
           this.view.divs.registers.appendChild(registerEl);
+          this.view.focusHandler.virtualRegisterToRowMap.set(registerIndex, row);
           ++(this.registerTypeHeaderData.virtualCount);
           return true;
         }
@@ -703,7 +907,7 @@ class RangeViewConstructor {
     const getElementForEmptyPosition = (column: number) => {
       const position = this.view.instructionRangeHandler.getPositionFromIndex(column);
       const blockBorder = this.view.blocksData.isBlockBorder(position);
-      const classes = "range-position range-empty " + (blockBorder
+      const classes = "range-position range-empty range-background-div " + (blockBorder
         ? "range-block-border" : this.view.blocksData.isInstructionBorder(position)
           ? "range-instr-border" : "range-position-border");
 
@@ -720,7 +924,6 @@ class RangeViewConstructor {
     // Only construct the row if it has any intervals.
     if (this.view.rowConstructor.construct(this.grid, row, registerId, registerIndex, ranges,
                                            getElementForEmptyPosition, callbackForInterval)) {
-      this.view.selectionHandler.addRow(rowEl, registerId);
       return rowEl;
     }
     return undefined;
@@ -832,7 +1035,7 @@ class RangeViewConstructor {
     element.style.gridTemplateRows = `repeat(${8 * instrCount},
       calc((${this.view.cssVariables.flippedPositionHeight}em +
             ${this.view.cssVariables.blockBorderWidth}px)/2))`;
-    this.view.selectionHandler.addBlock(element, blockId);
+    this.view.selectionHandler.addBlock(element, blockId, firstColumn);
     return element;
   }
 
@@ -859,7 +1062,7 @@ class RangeViewConstructor {
     const instrIndex = this.view.instructionRangeHandler.getInstructionIndex(instrId);
     const firstGridCol = (instrIndex * C.POSITIONS_PER_INSTRUCTION) + 1;
     element.style.gridColumn = `${firstGridCol} / ${(firstGridCol + C.POSITIONS_PER_INSTRUCTION)}`;
-    this.view.selectionHandler.addInstruction(element, instrId, blockId);
+    this.view.selectionHandler.addInstruction(element, instrId, instrIndex, blockId);
     return element;
   }
 
@@ -922,13 +1125,14 @@ class PhaseChangeHandler {
     this.view.intervalsAccessor.forEachInterval((phase, interval) => {
       interval.classList.toggle("range-hidden", phase != this.view.sequenceView.currentPhaseIndex);
     });
+    this.view.focusHandler.resetFocus();
   }
 
   private addNewIntervals(): void {
     // All Grids should point to the same HTMLElement for empty cells in the grid,
     // so as to avoid duplication. The current Grid is used to retrieve these elements.
     const currentGrid = this.view.gridAccessor.getAnyGrid();
-    const newGrid = new Grid();
+    const newGrid = new Grid(currentGrid.background);
     this.view.gridAccessor.addGrid(newGrid);
 
     let row = 0;
@@ -1060,6 +1264,10 @@ class InstructionRangeHandler {
     return this.positionRange[1] - 1;
   }
 
+  public getFirstPosition(): number {
+    return this.positionRange[0];
+  }
+
   public getPositionFromIndex(index: number): number {
     return index + this.positionRange[0];
   }
@@ -1183,35 +1391,151 @@ class InstructionRangeHandler {
   }
 }
 
+// This class tracks what element is selected and scrolls it into view.
+class FocusHandler implements RegisterAllocationSelectionHandler, BlockSelectionHandler {
+  rangeView: RangeView;
+  virtualRegisterToRowMap: Map<number, number>;
+  elementInFocus: HTMLElement;
+  isBackgroundInFocus: boolean;
+  // coordsInFocus in used to resetFocus after it may have been cleared as well as
+  // allowing for quick access to the coordinates.
+  coordsInFocus: [number, number];
+
+  constructor(rangeView: RangeView) {
+    this.rangeView = rangeView;
+    this.virtualRegisterToRowMap = new Map<number, number>();
+    this.elementInFocus = undefined;
+    this.isBackgroundInFocus = false;
+    this.coordsInFocus = [-1, -1];
+  }
+
+  private getHeaderElement(row: number, index: number) {
+    return this.rangeView.divs.positionHeaders.children[C.RANGES_NUM_POS_HEADER_ROWS + row]
+                                              .children[index] as HTMLElement;
+  }
+
+  private moveFocusTo(element: HTMLElement, eventInitDict?: MouseEventInit) {
+    if (element !== undefined) {
+      element.scrollIntoView({ block: 'nearest' });
+    } else if (this.isBackgroundInFocus) {
+      // TODO: find a way to locate the background scroll offset.
+    }
+  }
+
+  public isInFocus(element: HTMLElement) {
+    return this.elementInFocus == element;
+  }
+
+  public setFocus(element: HTMLElement, row: number, column: number, isBackground?: boolean) {
+    this.clear();
+    this.coordsInFocus[0] = row;
+    this.coordsInFocus[1] = column;
+    if (element !== undefined) {
+      element.classList.toggle("focused", true);
+    }
+    this.elementInFocus = element;
+    this.isBackgroundInFocus = isBackground;
+    if (isBackground) {
+      this.rangeView.gridAccessor.currentGrid().updateBackgroundFocusPoint(row, column);
+    }
+  }
+
+  public setFocusVirtualRegister(register: number) {
+    const row = this.virtualRegisterToRowMap.get(register);
+    if (row) this.moveFocusTo(this.rangeView.divs.registers.children[row] as HTMLElement);
+  }
+
+  public clear() {
+    if (this.elementInFocus) {
+      this.elementInFocus.classList.toggle("focused", false);
+      this.elementInFocus = undefined;
+    }
+    const curGrid = this.rangeView.gridAccessor.currentGrid();
+    if (curGrid !== undefined) {
+      curGrid.clearBackgroundFocusPoint();
+      curGrid.updateBackground(this.rangeView, this.rangeView.divs.grid.scrollTop,
+                               this.rangeView.divs.grid.scrollLeft);
+      this.isBackgroundInFocus = false;
+    }
+  }
+
+  public clearCoordsInFocus() {
+    this.coordsInFocus[0] = -1;
+    this.coordsInFocus[1] = -1;
+  }
+
+  public resetFocus() {
+    this.clear();
+    // Restore focus if saved.
+    if (this.coordsInFocus[0] >= 0 || this.coordsInFocus[1] >= 0) {
+      this.moveFocusTo(this.rangeView.gridAccessor.getCell(this.coordsInFocus[0],
+                                                          this.coordsInFocus[1]));
+    }
+  }
+
+  public select(instructionIds: Array<number>, selected: boolean, scrollIntoView: boolean): void {}
+
+  public brokeredClear(): void {
+    this.clear();
+  }
+
+  public brokeredRegisterAllocationSelect(instructionsOffsets: Array<[number, number]>,
+                                          selected: boolean): void {
+    if (!selected) return;
+    for (const offsetPair of instructionsOffsets) {
+      for (const offset of offsetPair) {
+        const instr = this.getHeaderElement(C.RANGES_INSTR_GRID_ROW,
+                                this.rangeView.instructionRangeHandler.getInstructionIndex(offset));
+        if (instr) this.moveFocusTo(instr, { shiftKey: true });
+      }
+    }
+  }
+
+  public brokeredBlockSelect(blockIds: Array<number>, selected: boolean): void {
+    if (!selected) return;
+    for (const id of blockIds) {
+      const block = this.getHeaderElement(C.RANGES_BLOCK_GRID_ROW,
+                                          this.rangeView.instructionRangeHandler.getBlockIndex(id));
+      if (block) this.moveFocusTo(block, { shiftKey: true });
+    }
+  }
+}
+
 // This class works in tandem with the selectionHandlers defined in text-view.ts
 // rather than updating HTMLElements explicitly itself.
-class RangeViewSelectionHandler {
+export class RangeViewSelectionHandler {
   sequenceView: SequenceView;
   rangeView: RangeView;
+  rowToRegisterId: Map<number, string>;
+  positionToBlockId: Map<number, number>;
 
   constructor(rangeView: RangeView) {
     this.rangeView = rangeView;
     this.sequenceView = this.rangeView.sequenceView;
+    this.rowToRegisterId = new Map<number, string>();
+    this.positionToBlockId = new Map<number, number>();
 
     // Clear all selections when container is clicked.
     this.rangeView.divs.container.onclick = (e: MouseEvent) => {
       if (!e.shiftKey) this.sequenceView.broker.broadcastClear(null);
+      this.rangeView.focusHandler.clearCoordsInFocus();
     };
   }
 
-  public addBlock(element: HTMLElement, id: number): void {
+  public addBlock(element: HTMLElement, id: number, firstColumn: number): void {
     element.onclick = (e: MouseEvent) => {
       e.stopPropagation();
       if (!e.shiftKey) {
         this.clear();
       }
       this.select(null, null, [id], true);
+      this.rangeView.focusHandler.setFocus(element, C.RANGES_BLOCK_GRID_ROW, firstColumn);
     };
     this.sequenceView.addHtmlElementForBlockId(id, element);
     this.sequenceView.addHtmlElementForBlockId(this.sequenceView.getSubId(id), element);
   }
 
-  public addInstruction(element: HTMLElement, id: number, blockId: number): void {
+  public addInstruction(element: HTMLElement, id: number, index: number, blockId: number): void {
     // Select the block which contains the instruction and all positions and cells
     // that are within this instruction.=
     element.onclick = (e: MouseEvent) => {
@@ -1220,6 +1544,8 @@ class RangeViewSelectionHandler {
         this.clear();
       }
       this.select(null, [id], [this.sequenceView.getSubId(blockId)], true);
+      this.rangeView.focusHandler.setFocus(element, C.RANGES_INSTR_GRID_ROW,
+                                           C.POSITIONS_PER_INSTRUCTION * index);
     };
     this.sequenceView.addHtmlElementForBlockId(blockId, element);
     this.sequenceView.addHtmlElementForInstructionId(id, element);
@@ -1228,6 +1554,7 @@ class RangeViewSelectionHandler {
 
   public addPosition(element: HTMLElement, position: number, blockId: number): void {
     const instrId = Math.floor(position / C.POSITIONS_PER_INSTRUCTION);
+    const column = this.rangeView.instructionRangeHandler.getIndexFromPosition(position);
     // Select the block and instruction which contains this position.
     element.onclick = (e: MouseEvent) => {
       e.stopPropagation();
@@ -1236,24 +1563,28 @@ class RangeViewSelectionHandler {
       }
       this.select(["position-" + position], [this.sequenceView.getSubId(instrId)],
                                             [this.sequenceView.getSubId(blockId)], true);
+      this.rangeView.focusHandler.setFocus(element, C.RANGES_POS_GRID_ROW, column);
     };
     this.sequenceView.addHtmlElementForBlockId(blockId, element);
     this.sequenceView.addHtmlElementForInstructionId(instrId, element);
     this.sequenceView.addHtmlElementForNodeId("position-" + position, element);
+    this.positionToBlockId.set(position, blockId);
   }
 
   public addRegister(element: HTMLElement, registerId: string, row: number): void {
     const rowGroupIndex = (Math.floor(row / C.ROW_GROUP_SIZE) * 2) + 1;
     element.onclick = (e: MouseEvent) => {
       e.stopPropagation();
-      if (!this.canSelectRow(row, rowGroupIndex)) return;
+      if (!this.canSelectRow(element, row, rowGroupIndex)) return;
       if (!e.shiftKey) {
         this.clear();
       }
       // The register also effectively selects the row.
       this.select([registerId], null, null, true);
+      this.rangeView.focusHandler.setFocus(element, row, C.RANGES_POS_GRID_ROW);
     };
     this.sequenceView.addHtmlElementForNodeId(registerId, element);
+    this.rowToRegisterId.set(row, registerId);
   }
 
   public addRow(element: HTMLElement, registerId: string): void {
@@ -1270,8 +1601,9 @@ class RangeViewSelectionHandler {
   }
 
   public addCell(element: HTMLElement, row: number, position: number,
-                 blockId: number, registerId: string, intervalNodeId?: string): void {
+                 blockId: number, registerId: string, intervalNodeId?: string, isEmptyCell?: boolean): void {
     const instrId = Math.floor(position / C.POSITIONS_PER_INSTRUCTION);
+    const column = this.rangeView.instructionRangeHandler.getIndexFromPosition(position);
     // Select the relevant row by the registerId, and the column by position.
     // Also select the instruction and the block in which the position is in.
     const select = [registerId, "position-" + position];
@@ -1279,19 +1611,64 @@ class RangeViewSelectionHandler {
     const rowGroupIndex = (Math.floor(row / C.ROW_GROUP_SIZE) * 2) + 1;
     element.onclick = (e: MouseEvent) => {
       e.stopPropagation();
-      if (!this.canSelectRow(row, rowGroupIndex)) return;
+      if (!this.canSelectRow(element, row, rowGroupIndex)) return;
       if (!e.shiftKey) {
         this.clear();
       }
       this.select(select, [this.sequenceView.getSubId(instrId)],
                           [this.sequenceView.getSubId(blockId)], true);
+      this.rangeView.focusHandler.setFocus(element, row, column);
     };
-    this.sequenceView.addHtmlElementForBlockId(blockId, element);
-    this.sequenceView.addHtmlElementForInstructionId(instrId, element);
-    this.sequenceView.addHtmlElementForNodeId("position-" + position, element);
+    if (!isEmptyCell) {
+      this.sequenceView.addHtmlElementForBlockId(blockId, element);
+      this.sequenceView.addHtmlElementForInstructionId(instrId, element);
+      this.sequenceView.addHtmlElementForNodeId("position-" + position, element);
+    }
+  }
+
+  public addBackground(background: HTMLElement): void {
+    background.onclick = (e: MouseEvent) => {
+      if (this.rangeView.divs.grid === undefined) return;
+      if (this.rangeView.divs.registers === undefined) return;
+      if (this.rangeView.divs.positionHeaders === null) return;
+      const gridBoundRect = this.rangeView.divs.grid.getBoundingClientRect();
+      const clickLeft = e.clientX - gridBoundRect.left + this.rangeView.divs.grid.scrollLeft;
+      const clickTop = e.clientY - gridBoundRect.top + this.rangeView.divs.grid.scrollTop;
+      const rangePosCellSize = this.rangeView.divs.getRangePositionCellSize();
+      const rangeRegCellSize = this.rangeView.divs.getRangeRegCellSize();
+      const firstPosition = this.rangeView.instructionRangeHandler.getFirstPosition();
+      let row = -1;
+      let column = -1;
+      if (this.rangeView.userSettings.get("flipped")) {
+        row = Math.floor(clickLeft / rangeRegCellSize[0]);
+        column = Math.floor(clickTop / rangePosCellSize[1]) + firstPosition;
+      } else {
+        row = Math.floor(clickTop / rangeRegCellSize[1]);
+        column = Math.floor(clickLeft / rangePosCellSize[0]) + firstPosition;
+      }
+      if (!this.rowToRegisterId.has(row)) return;
+      const registerId = this.rowToRegisterId.get(row);
+      const positionId = "position-" + column;
+      e.stopPropagation();
+      if (!e.shiftKey) {
+        this.clear();
+      }
+      this.rangeView.focusHandler.setFocus(undefined, row, column, true);
+      const instrId = Math.floor(column / C.POSITIONS_PER_INSTRUCTION);
+      const blockId = this.positionToBlockId.get(column);
+      this.select([registerId, positionId], [this.sequenceView.getSubId(instrId)],
+                                            [this.sequenceView.getSubId(blockId)], true);
+    };
+  }
+
+  public updateBackground(): void {
+    this.rangeView.gridAccessor.currentGrid().updateBackground(this.rangeView,
+      this.rangeView.divs.grid.scrollTop, this.rangeView.divs.grid.scrollLeft);
   }
 
-  private canSelectRow(row: number, rowGroupIndex: number): boolean {
+  private canSelectRow(element: HTMLElement, row: number, rowGroupIndex: number): boolean {
+    // No need to repeat work if already in focus.
+    if (this.rangeView.focusHandler.isInFocus(element)) return false;
     // Don't select anything if the row group which this row is included in is hidden.
     if (row >= 0
         && this.rangeView.divs.grid.children[rowGroupIndex].classList.contains("range-hidden")) {
@@ -1304,6 +1681,7 @@ class RangeViewSelectionHandler {
   // Don't call multiple times in a row or the SelectionMapsHandlers will clear their previous
   // causing the HTMLElements to not be deselected by select.
   private clear(): void {
+    this.rangeView.focusHandler.clear();
     this.sequenceView.blockSelections.clearCurrent();
     this.sequenceView.instructionSelections.clearCurrent();
     this.sequenceView.nodeSelections.clearCurrent();
@@ -1379,6 +1757,7 @@ class DisplayResetter {
     this.view.divs.yAxisLabel.innerText = this.isFlipped
                                           ? this.view.divs.yAxisLabel.dataset.flipped
                                           : this.view.divs.yAxisLabel.dataset.notFlipped;
+    this.view.focusHandler.resetFocus();
   }
 
   private resetLayout(): void {
@@ -1446,6 +1825,8 @@ class ScrollHandler {
 
   constructor(view: RangeView) {
     this.view = view;
+    this.scrollTop = 0;
+    this.scrollLeft = 0;
   }
 
   // This function is used to hide the rows which are not currently in view and
@@ -1528,12 +1909,21 @@ class ScrollHandler {
       this.scrollTopTimeout = setTimeout(() => {
         target.onscroll = this.scrollTopFunc;
         this.syncHidden();
-      }, 500);
+      }, 100);
     } else {
       this.scrollLeftTimeout = setTimeout(() => {
         target.onscroll = this.scrollLeftFunc;
         this.syncHidden();
-      }, 500);
+      }, 100);
+    }
+
+    // Update background cell.
+    const currentGrid = this.view.gridAccessor.currentGrid();
+    const gridScrollTop = this.view.divs.grid.scrollTop;
+    const gridScrollLeft = this.view.divs.grid.scrollLeft;
+    if (currentGrid !== undefined && (currentGrid.backgroundScrollLeft != gridScrollLeft ||
+                                     currentGrid.backgroundScrollTop != gridScrollTop)) {
+      currentGrid.updateBackground(this.view, gridScrollTop, gridScrollLeft);
     }
   }
 
@@ -1576,6 +1966,7 @@ export class RangeView {
   phaseChangeHandler: PhaseChangeHandler;
   instructionRangeHandler: InstructionRangeHandler;
   selectionHandler: RangeViewSelectionHandler;
+  focusHandler: FocusHandler;
   displayResetter: DisplayResetter;
   rowConstructor: RowConstructor;
   stringConstructor: StringConstructor;
@@ -1590,7 +1981,7 @@ export class RangeView {
     this.instructionRangeHandler = new InstructionRangeHandler(this, firstInstr, lastInstr);
   }
 
-  public initializeContent(blocks: Array<SequenceBlock>): void {
+  public initializeContent(blocks: Array<SequenceBlock>, broker: SelectionBroker): void {
     if (!this.initialized) {
       this.gridAccessor = new GridAccessor(this.sequenceView);
       this.intervalsAccessor = new IntervalElementsAccessor(this.sequenceView);
@@ -1611,16 +2002,18 @@ export class RangeView {
       this.rowConstructor = new RowConstructor(this);
       this.stringConstructor = new StringConstructor(this);
       this.selectionHandler = new RangeViewSelectionHandler(this);
+      this.sequenceView.setRangeViewSelectionHandler(this.selectionHandler);
+      this.focusHandler = new FocusHandler(this);
+      broker.addBlockHandler(this.focusHandler);
+      broker.addRegisterAllocatorHandler(this.focusHandler);
       const constructor = new RangeViewConstructor(this);
       constructor.construct();
       this.cssVariables.setVariables(this.instructionRangeHandler.numPositions,
                                      this.divs.registers.children.length);
       this.phaseChangeHandler = new PhaseChangeHandler(this);
       let maxVirtualRegisterNumber = 0;
-      for (const register of this.divs.registers.children) {
-        const registerEl = register as HTMLElement;
-        maxVirtualRegisterNumber = Math.max(maxVirtualRegisterNumber,
-                                            parseInt(registerEl.title.substring(1), 10));
+      for (const register of this.focusHandler.virtualRegisterToRowMap.keys()) {
+        maxVirtualRegisterNumber = Math.max(maxVirtualRegisterNumber, register);
       }
       this.maxLengthVirtualRegisterNumber = Math.floor(Math.log10(maxVirtualRegisterNumber)) + 1;
       this.initialized = true;
@@ -1645,8 +2038,10 @@ export class RangeView {
       if (this.divs.registers.children.length) {
         setTimeout(() => {
           this.userSettings.resetFromSessionStorage();
+          this.focusHandler.resetFocus();
           this.scrollHandler.restoreScroll();
           this.scrollHandler.syncHidden();
+          this.selectionHandler.updateBackground();
           this.divs.showOnLoad.style.visibility = "visible";
         }, 100);
       }
@@ -1670,7 +2065,10 @@ export class RangeView {
   }
 
   public onresize(): void {
-    if (this.divs.registers.children.length && this.isShown) this.scrollHandler.syncHidden();
+    if (this.divs.registers.children.length && this.isShown) {
+     this.scrollHandler.syncHidden();
+     this.selectionHandler.updateBackground();
+    }
   }
 
   public getInnerWrapperFromInterval(interval: HTMLElement) {
diff --git a/deps/v8/tools/turbolizer/src/views/schedule-view.ts b/deps/v8/tools/turbolizer/src/views/schedule-view.ts
index 6a830c9e3f325b..191a30a0875ea2 100644
--- a/deps/v8/tools/turbolizer/src/views/schedule-view.ts
+++ b/deps/v8/tools/turbolizer/src/views/schedule-view.ts
@@ -93,7 +93,9 @@ export class ScheduleView extends TextView {
     instrMarker.onclick = this.mkBlockLinkHandler(block.rpo);
     scheduleBlock.appendChild(instrMarker);
 
-    const blocksRpoId = this.createElement("div", "block-id com clickable", String(block.rpo) + " Id:" + String(block.id));
+    let displayStr = String(block.rpo) + " Id:" + String(block.id);
+    if(block.count != -1) displayStr += " Count:" + String(block.count);
+    const blocksRpoId = this.createElement("div", "block-id com clickable", displayStr);
     blocksRpoId.onclick = this.mkBlockLinkHandler(block.rpo);
     scheduleBlock.appendChild(blocksRpoId);
     const blockPred = this.createElement("div", "predecessor-list block-list comma-sep-list");
diff --git a/deps/v8/tools/turbolizer/src/views/sequence-view.ts b/deps/v8/tools/turbolizer/src/views/sequence-view.ts
index 72e63817fd7e16..2c6058b62a79f4 100644
--- a/deps/v8/tools/turbolizer/src/views/sequence-view.ts
+++ b/deps/v8/tools/turbolizer/src/views/sequence-view.ts
@@ -89,6 +89,10 @@ export class SequenceView extends TextView {
 
   public initializeContent(sequence: SequencePhase, rememberedSelection: SelectionStorage): void {
     this.divNode.innerHTML = "";
+    const view = this;
+    this.divNode.onclick = (e: MouseEvent) => {
+      if (view.showRangeView) view.rangeView.focusHandler.clearCoordsInFocus();
+    };
     this.sequence = sequence;
     this.searchInfo = new Array<string>();
     this.phaseSelectEl = document.getElementById("phase-select") as HTMLSelectElement;
@@ -222,7 +226,17 @@ export class SequenceView extends TextView {
   private elementForOperandWithSpan(span: HTMLSpanElement, text: string, isVirtual: boolean):
     HTMLElement {
     const selectionText = isVirtual ? `virt_${text}` : text;
-    span.onclick = this.mkOperandLinkHandler(selectionText);
+    const onclick = this.mkOperandLinkHandler(selectionText);
+    const view = this;
+    if (isVirtual) {
+      const row = parseInt(text.substring(1), 10);
+      span.onclick = function (e) {
+        onclick(e);
+        if (view.showRangeView) view.rangeView.focusHandler.setFocusVirtualRegister(row);
+      };
+    } else {
+      span.onclick = onclick;
+    }
     this.searchInfo.push(text);
     this.addHtmlElementForNodeId(selectionText, span);
     const container = createElement("div", "");
@@ -329,7 +343,7 @@ export class SequenceView extends TextView {
         this.preventRangeView("No live ranges to show");
       }
       if (this.showRangeView) {
-        this.rangeView.initializeContent(this.sequence.blocks);
+        this.rangeView.initializeContent(this.sequence.blocks, this.broker);
       }
     } else {
       this.preventRangeView("No live range data provided");
@@ -420,7 +434,7 @@ export class SequenceView extends TextView {
         this.rangeView = new RangeView(this, firstInstr, lastInstr);
         this.addRangeView();
       }
-      this.rangeView.initializeContent(this.sequence.blocks);
+      this.rangeView.initializeContent(this.sequence.blocks, this.broker);
       this.rangeView.show();
     } else {
       this.rangeView.hide();
diff --git a/deps/v8/tools/turbolizer/src/views/text-view.ts b/deps/v8/tools/turbolizer/src/views/text-view.ts
index c2309100ff90d5..084fd6a399040a 100644
--- a/deps/v8/tools/turbolizer/src/views/text-view.ts
+++ b/deps/v8/tools/turbolizer/src/views/text-view.ts
@@ -11,6 +11,7 @@ import { ViewElements } from "../common/view-elements";
 import { DisassemblyPhase } from "../phases/disassembly-phase";
 import { SchedulePhase } from "../phases/schedule-phase";
 import { SequencePhase } from "../phases/sequence-phase";
+import { RangeViewSelectionHandler } from "./range-view";
 import {
   NodeSelectionHandler,
   BlockSelectionHandler,
@@ -81,6 +82,7 @@ export abstract class TextView extends PhaseView {
   blockIdToNodeIds: Map<string, Array<string>>;
   nodeIdToBlockId: Array<string>;
   patterns: Array<Array<any>>;
+  rangeViewSelectionHandler: RangeViewSelectionHandler;
 
   constructor(parent: HTMLElement, broker: SelectionBroker) {
     super(parent);
@@ -147,6 +149,14 @@ export abstract class TextView extends PhaseView {
     this.blockSelections.selectElements(scrollIntoView, scrollDiv);
     this.instructionSelections.selectElements(scrollIntoView, scrollDiv);
     this.nodeSelections.selectElements(scrollIntoView, scrollDiv);
+    
+    if (this.rangeViewSelectionHandler !== undefined) {
+      this.rangeViewSelectionHandler.updateBackground();
+    }
+  }
+
+  public setRangeViewSelectionHandler(handler: RangeViewSelectionHandler): void {
+    this.rangeViewSelectionHandler = handler;
   }
 
   public processLine(line: string): Array<HTMLSpanElement> {
diff --git a/deps/v8/tools/ubsan/ignorelist.txt b/deps/v8/tools/ubsan/ignorelist.txt
index f61504b355b9c3..b9bd44f8d4b39d 100644
--- a/deps/v8/tools/ubsan/ignorelist.txt
+++ b/deps/v8/tools/ubsan/ignorelist.txt
@@ -1,9 +1,10 @@
 #############################################################################
 # UBSan ignorelist.
 
-# Bug 8735: PropertyCallbackInfo<void> vs PropertyCallbackInfo<T>.
+# Bug 8735: PropertyCallbackInfo<void> vs PropertyCallbackInfo<T>
+# and Local<String> vs Local<Name>.
+fun:*v8*internal*PropertyCallbackArguments*CallAccessorGetter*
 fun:*v8*internal*PropertyCallbackArguments*CallAccessorSetter*
-fun:*v8*internal*PropertyCallbackArguments*BasicCallNamedGetterCallback*
 fun:*v8*internal*InvokeAccessorGetterCallback*
 
 # Bug 8735: WeakCallbackInfo<void> vs. WeakCallbackInfo<T>.
diff --git a/deps/v8/tools/unittests/run_perf_test.py b/deps/v8/tools/unittests/run_perf_test.py
index 75ed6cef70c934..8a9f590492ce8e 100755
--- a/deps/v8/tools/unittests/run_perf_test.py
+++ b/deps/v8/tools/unittests/run_perf_test.py
@@ -3,6 +3,8 @@
 # Use of this source code is governed by a BSD-style license that can be
 # found in the LICENSE file.
 
+from pathlib import Path
+
 import json
 import os
 import platform
@@ -28,7 +30,7 @@
 RUN_PERF = os.path.join(TOOLS_ROOT, 'run_perf.py')
 TEST_DATA = os.path.join(TOOLS_ROOT, 'unittests', 'testdata')
 
-TEST_WORKSPACE = os.path.join(tempfile.gettempdir(), 'test-v8-run-perf')
+TEST_WORKSPACE = Path(tempfile.gettempdir()) / 'test-v8-run-perf'
 
 SORT_KEY = lambda x: x['graphs']
 
@@ -283,6 +285,56 @@ def testOneRun(self):
     self._VerifyMock(
         os.path.join('out', 'x64.release', 'd7'), '--flag', 'run.js')
 
+  def testWarmup_OnEmpty(self):
+    warmup_cache = TEST_WORKSPACE / 'test_cache.json'
+    mock.patch('run_perf.WARMUP_CACHE_FILE', warmup_cache).start()
+    mock.patch('psutil.boot_time', return_value=42).start()
+    mock.patch('time.time', return_value=123).start()
+    cache_handler = run_perf.CacheHandler(warmup_cache)
+    self.assertFalse(cache_handler.cache_file.exists())
+    self._WriteTestInput(V8_JSON)
+
+    # Require 2 runs. One for the warm-up.
+    self._MockCommand(2 * ['.'], 2 * ['Richards: 1\nDeltaBlue: 2\n'])
+    self.assertEqual(0, self._CallMain('--checked-warmup'))
+
+    # The warm-up ran at the current time and cache is up to date.
+    self.assertDictEqual({'test': 123}, cache_handler.read_cache())
+
+  def testWarmup_NotNeeded(self):
+    warmup_cache = TEST_WORKSPACE / 'test_cache.json'
+    mock.patch('run_perf.WARMUP_CACHE_FILE', warmup_cache).start()
+    mock.patch('psutil.boot_time', return_value=42).start()
+    mock.patch('time.time', return_value=123).start()
+    cache_handler = run_perf.CacheHandler(warmup_cache)
+
+    # Test that the old entry is trimmed.
+    cache_handler.write_cache({'test': 87, 'some_old_entry': 23})
+    self._WriteTestInput(V8_JSON)
+
+    # One run only since no warm-up is required.
+    self._MockCommand(1 * ['.'], 1 * ['Richards: 1\nDeltaBlue: 2\n'])
+    self.assertEqual(0, self._CallMain('--checked-warmup'))
+
+    # No warm-up ran, cache is only trimmed.
+    self.assertDictEqual({'test': 87}, cache_handler.read_cache())
+
+  def testWarmup_Needed(self):
+    warmup_cache = TEST_WORKSPACE / 'test_cache.json'
+    mock.patch('run_perf.WARMUP_CACHE_FILE', warmup_cache).start()
+    mock.patch('psutil.boot_time', return_value=42).start()
+    mock.patch('time.time', return_value=123).start()
+    cache_handler = run_perf.CacheHandler(warmup_cache)
+    cache_handler.write_cache({'test': 23})
+    self._WriteTestInput(V8_JSON)
+
+    # Require 2 runs. One for the warm-up.
+    self._MockCommand(2 * ['.'], 2 * ['Richards: 1\nDeltaBlue: 2\n'])
+    self.assertEqual(0, self._CallMain('--checked-warmup'))
+
+    # The warm-up ran at the current time and cache is up to date.
+    self.assertDictEqual({'test': 123}, cache_handler.read_cache())
+
   def testOneRunVariants(self):
     self._WriteTestInput(V8_VARIANTS_JSON)
     self._MockCommand(['.', '.', '.'], [
diff --git a/deps/v8/tools/v8.xcodeproj/README.txt b/deps/v8/tools/v8.xcodeproj/README.txt
deleted file mode 100644
index e064ff6bf140f6..00000000000000
--- a/deps/v8/tools/v8.xcodeproj/README.txt
+++ /dev/null
@@ -1,11 +0,0 @@
-The Xcode project for V8 has been retired. If an Xcode project
-is needed for building on a Mac there is the option of using GYP to
-generate it. Please look in the build directory in the root of the
-V8 project. It contains the required infrastructure and a README.txt
-file explaining how to get started.
-
-Generating Xcode projects using GYP is how the Chromium
-project integrated V8 into the Mac build.
-
-The main build system for V8 is still SCons, see
-http://code.google.com/apis/v8/build.html for details.
diff --git a/deps/v8/tools/v8_presubmit.py b/deps/v8/tools/v8_presubmit.py
index 876101dad68711..39b1605714828a 100755
--- a/deps/v8/tools/v8_presubmit.py
+++ b/deps/v8/tools/v8_presubmit.py
@@ -35,7 +35,7 @@
 import multiprocessing
 import optparse
 import os
-from os.path import abspath, join, dirname, basename, exists
+from os.path import abspath, join, dirname, basename, exists, isfile, isdir
 import pickle
 import re
 import subprocess
@@ -43,8 +43,6 @@
 import sys
 
 from testrunner.local import statusfile
-from testrunner.local import testsuite
-from testrunner.local import utils
 
 def decode(arg, encoding="utf-8"):
   return arg.decode(encoding)
@@ -59,6 +57,8 @@ def decode(arg, encoding="utf-8"):
 #   https://google.github.io/styleguide/cppguide.html#Inputs_and_Outputs.
 # whitespace/braces: Doesn't handle {}-initialization for custom types
 #   well; also should be subsumed by clang-format.
+# whitespace/parens: Conflicts with clang-format rule to treat Turboshaft's
+#   IF, IF_NOT, ... as IfMacros and insert a whitespace before the parenthesis.
 
 LINT_RULES = """
 -build/header_guard
@@ -68,6 +68,7 @@ def decode(arg, encoding="utf-8"):
 -runtime/references
 -whitespace/braces
 -whitespace/comments
+-whitespace/parens
 """.split()
 
 LINT_OUTPUT_PATTERN = re.compile(r'^.+[:(]\d+[:)]')
@@ -91,7 +92,7 @@ def CppLintWorker(command):
     error_count = -1
     while True:
       out_line = decode(process.stderr.readline())
-      if out_line == '' and process.poll() != None:
+      if out_line == '' and process.poll() is not None:
         if error_count == -1:
           print("Failed to process %s" % command.pop())
           return 1
@@ -121,7 +122,7 @@ def TorqueLintWorker(command):
     error_count = 0
     while True:
       out_line = decode(process.stderr.readline())
-      if out_line == '' and process.poll() != None:
+      if out_line == '' and process.poll() is not None:
         break
       out_lines += out_line
       error_count += 1
@@ -338,7 +339,7 @@ def DetectFilesToChange(self, files):
     count = multiprocessing.cpu_count()
     pool = multiprocessing.Pool(count)
     try:
-      results = pool.map_async(worker, commands).get(timeout=240)
+      results = pool.map_async(worker, commands).get(timeout=360)
     except KeyboardInterrupt:
       print("\nCaught KeyboardInterrupt, terminating workers.")
       pool.terminate()
@@ -393,7 +394,7 @@ def GetProcessorScript(self):
     filters = ','.join([n for n in LINT_RULES])
     arguments = ['--filter', filters]
 
-    cpplint = os.path.join(DEPS_DEPOT_TOOLS_PATH, 'cpplint.py')
+    cpplint = join(DEPS_DEPOT_TOOLS_PATH, 'cpplint.py')
     return cpplint, arguments
 
 
@@ -419,10 +420,10 @@ def GetProcessorWorker(self):
     return TorqueLintWorker
 
   def GetProcessorScript(self):
-    torque_tools = os.path.join(TOOLS_PATH, "torque")
-    torque_path = os.path.join(torque_tools, "format-torque.py")
+    torque_tools = join(TOOLS_PATH, "torque")
+    torque_path = join(torque_tools, "format-torque.py")
     arguments = ["-il"]
-    if os.path.isfile(torque_path):
+    if isfile(torque_path):
       return torque_path, arguments
 
     return None, arguments
@@ -446,7 +447,7 @@ def GetProcessorWorker(self):
     return JSLintWorker
 
   def GetProcessorScript(self):
-    jslint = os.path.join(DEPS_DEPOT_TOOLS_PATH, 'clang_format.py')
+    jslint = join(DEPS_DEPOT_TOOLS_PATH, 'clang_format.py')
     return jslint, []
 
 
@@ -481,16 +482,16 @@ def CreateRuntimeFunctionCallMatcher(self):
 
   # Overwriting the one in the parent class.
   def FindFilesIn(self, path):
-    if os.path.exists(path+'/.git'):
+    if exists(path+'/.git'):
       output = subprocess.Popen('git ls-files --full-name',
                                 stdout=PIPE, cwd=path, shell=True)
       result = []
       for file in decode(output.stdout.read()).split():
-        for dir_part in os.path.dirname(file).replace(os.sep, '/').split('/'):
+        for dir_part in dirname(file).replace(os.sep, '/').split('/'):
           if self.IgnoreDir(dir_part):
             break
         else:
-          if (self.IsRelevant(file) and os.path.exists(file)
+          if (self.IsRelevant(file) and exists(file)
               and not self.IgnoreFile(file)):
             result.append(join(path, file))
       if output.wait() == 0:
@@ -698,10 +699,10 @@ def _GetStatusFiles(self, files):
     for file_path in files:
       if file_path.startswith(testrunner_path):
         for suitepath in os.listdir(test_path):
-          suitename = os.path.basename(suitepath)
-          status_file = os.path.join(
+          suitename = basename(suitepath)
+          status_file = join(
               test_path, suitename, suitename + ".status")
-          if os.path.exists(status_file):
+          if exists(status_file):
             status_files.add(status_file)
         return status_files
 
@@ -712,10 +713,10 @@ def _GetStatusFiles(self, files):
         if pieces:
           # Infer affected status file name. Only care for existing status
           # files. Some directories under "test" don't have any.
-          if not os.path.isdir(join(test_path, pieces[0])):
+          if not isdir(join(test_path, pieces[0])):
             continue
           status_file = join(test_path, pieces[0], pieces[0] + ".status")
-          if not os.path.exists(status_file):
+          if not exists(status_file):
             continue
           status_files.add(status_file)
     return status_files
@@ -780,7 +781,7 @@ def FindTests(workspace):
   for root, dirs, files in os.walk(join(workspace, 'tools')):
     for f in files:
       if f.endswith('_test.py'):
-        fullpath = os.path.join(root, f)
+        fullpath = join(root, f)
         scripts.append(fullpath)
   for script in scripts:
     if not any(exc_dir in script for exc_dir in exclude):
@@ -807,37 +808,52 @@ def GetOptions():
   return result
 
 
+def run_checks(checks, workspace):
+  failures = []
+
+  def run(check_function, named_object=None):
+    name = (named_object or check_function).__name__
+    print('__________________')
+    print(f'Running {name}...')
+    if check_function(workspace):
+      print(f'{name} SUCCEDED')
+      return
+    failures.append(name)
+    print(f'!!! {name} FAILED')
+
+  for check in checks:
+    if callable(check):
+      run(check)
+    else:
+      run(check.RunOnPath, check.__class__)
+  return '\n'.join(failures)
+
+
 def Main():
   workspace = abspath(join(dirname(sys.argv[0]), '..'))
   parser = GetOptions()
   (options, args) = parser.parse_args()
-  success = True
-  print("Running checkdeps...")
-  success &= CheckDeps(workspace)
   use_linter_cache = not options.no_linter_cache
+  checks = [
+    CheckDeps,
+    TorqueLintProcessor(use_cache=use_linter_cache),
+    JSLintProcessor(use_cache=use_linter_cache),
+    SourceProcessor(),
+    StatusFilesProcessor(),
+    PyTests,
+    GCMoleProcessor(),
+  ]
   if not options.no_lint:
-    print("Running C++ lint check...")
-    success &= CppLintProcessor(use_cache=use_linter_cache).RunOnPath(workspace)
-
-  print("Running Torque formatting check...")
-  success &= TorqueLintProcessor(use_cache=use_linter_cache).RunOnPath(
-    workspace)
-  print("Running JavaScript formatting check...")
-  success &= JSLintProcessor(use_cache=use_linter_cache).RunOnPath(
-    workspace)
-  print("Running copyright header, trailing whitespaces and " \
-        "two empty lines between declarations check...")
-  success &= SourceProcessor().RunOnPath(workspace)
-  print("Running status-files check...")
-  success &= StatusFilesProcessor().RunOnPath(workspace)
-  print("Running python tests...")
-  success &= PyTests(workspace)
-  print("Running gcmole pattern check...")
-  success &= GCMoleProcessor().RunOnPath(workspace)
-  if success:
-    return 0
-  else:
+    checks.append(CppLintProcessor(use_cache=use_linter_cache))
+
+
+  failure_lines = run_checks(checks, workspace)
+  if failure_lines:
+    print('__________________')
+    print('==================')
+    print(f'Checks failed:\n{failure_lines}')
     return 1
+  return 0
 
 
 if __name__ == '__main__':
diff --git a/deps/v8/tools/v8heapconst.py b/deps/v8/tools/v8heapconst.py
deleted file mode 100644
index 9cd5dcae864a0a..00000000000000
--- a/deps/v8/tools/v8heapconst.py
+++ /dev/null
@@ -1,646 +0,0 @@
-#!/usr/bin/env python3
-# Copyright 2019 the V8 project authors. All rights reserved.
-# Use of this source code is governed by a BSD-style license that can
-# be found in the LICENSE file.
-
-# This file is automatically generated by mkgrokdump and should not
-# be modified manually.
-
-# List of known V8 instance types.
-# yapf: disable
-
-INSTANCE_TYPES = {
-  0: "INTERNALIZED_STRING_TYPE",
-  2: "EXTERNAL_INTERNALIZED_STRING_TYPE",
-  8: "ONE_BYTE_INTERNALIZED_STRING_TYPE",
-  10: "EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE",
-  18: "UNCACHED_EXTERNAL_INTERNALIZED_STRING_TYPE",
-  26: "UNCACHED_EXTERNAL_ONE_BYTE_INTERNALIZED_STRING_TYPE",
-  32: "STRING_TYPE",
-  33: "CONS_STRING_TYPE",
-  34: "EXTERNAL_STRING_TYPE",
-  35: "SLICED_STRING_TYPE",
-  37: "THIN_STRING_TYPE",
-  40: "ONE_BYTE_STRING_TYPE",
-  41: "CONS_ONE_BYTE_STRING_TYPE",
-  42: "EXTERNAL_ONE_BYTE_STRING_TYPE",
-  43: "SLICED_ONE_BYTE_STRING_TYPE",
-  50: "UNCACHED_EXTERNAL_STRING_TYPE",
-  58: "UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE",
-  96: "SHARED_STRING_TYPE",
-  98: "SHARED_EXTERNAL_STRING_TYPE",
-  104: "SHARED_ONE_BYTE_STRING_TYPE",
-  106: "SHARED_EXTERNAL_ONE_BYTE_STRING_TYPE",
-  114: "SHARED_UNCACHED_EXTERNAL_STRING_TYPE",
-  122: "SHARED_UNCACHED_EXTERNAL_ONE_BYTE_STRING_TYPE",
-  128: "SYMBOL_TYPE",
-  129: "BIG_INT_BASE_TYPE",
-  130: "HEAP_NUMBER_TYPE",
-  131: "ODDBALL_TYPE",
-  132: "PROMISE_FULFILL_REACTION_JOB_TASK_TYPE",
-  133: "PROMISE_REJECT_REACTION_JOB_TASK_TYPE",
-  134: "CALLABLE_TASK_TYPE",
-  135: "CALLBACK_TASK_TYPE",
-  136: "PROMISE_RESOLVE_THENABLE_JOB_TASK_TYPE",
-  137: "LOAD_HANDLER_TYPE",
-  138: "STORE_HANDLER_TYPE",
-  139: "FUNCTION_TEMPLATE_INFO_TYPE",
-  140: "OBJECT_TEMPLATE_INFO_TYPE",
-  141: "ACCESS_CHECK_INFO_TYPE",
-  142: "ACCESSOR_PAIR_TYPE",
-  143: "ALIASED_ARGUMENTS_ENTRY_TYPE",
-  144: "ALLOCATION_MEMENTO_TYPE",
-  145: "ALLOCATION_SITE_TYPE",
-  146: "ARRAY_BOILERPLATE_DESCRIPTION_TYPE",
-  147: "ASM_WASM_DATA_TYPE",
-  148: "ASYNC_GENERATOR_REQUEST_TYPE",
-  149: "BREAK_POINT_TYPE",
-  150: "BREAK_POINT_INFO_TYPE",
-  151: "CALL_SITE_INFO_TYPE",
-  152: "CLASS_POSITIONS_TYPE",
-  153: "DEBUG_INFO_TYPE",
-  154: "ENUM_CACHE_TYPE",
-  155: "ERROR_STACK_DATA_TYPE",
-  156: "FEEDBACK_CELL_TYPE",
-  157: "FUNCTION_TEMPLATE_RARE_DATA_TYPE",
-  158: "INTERCEPTOR_INFO_TYPE",
-  159: "INTERPRETER_DATA_TYPE",
-  160: "MODULE_REQUEST_TYPE",
-  161: "PROMISE_CAPABILITY_TYPE",
-  162: "PROMISE_ON_STACK_TYPE",
-  163: "PROMISE_REACTION_TYPE",
-  164: "PROPERTY_DESCRIPTOR_OBJECT_TYPE",
-  165: "PROTOTYPE_INFO_TYPE",
-  166: "REG_EXP_BOILERPLATE_DESCRIPTION_TYPE",
-  167: "SCRIPT_TYPE",
-  168: "SCRIPT_OR_MODULE_TYPE",
-  169: "SOURCE_TEXT_MODULE_INFO_ENTRY_TYPE",
-  170: "STACK_FRAME_INFO_TYPE",
-  171: "TEMPLATE_OBJECT_DESCRIPTION_TYPE",
-  172: "TUPLE2_TYPE",
-  173: "WASM_EXCEPTION_TAG_TYPE",
-  174: "WASM_INDIRECT_FUNCTION_TABLE_TYPE",
-  175: "FIXED_ARRAY_TYPE",
-  176: "HASH_TABLE_TYPE",
-  177: "EPHEMERON_HASH_TABLE_TYPE",
-  178: "GLOBAL_DICTIONARY_TYPE",
-  179: "NAME_DICTIONARY_TYPE",
-  180: "NAME_TO_INDEX_HASH_TABLE_TYPE",
-  181: "NUMBER_DICTIONARY_TYPE",
-  182: "ORDERED_HASH_MAP_TYPE",
-  183: "ORDERED_HASH_SET_TYPE",
-  184: "ORDERED_NAME_DICTIONARY_TYPE",
-  185: "REGISTERED_SYMBOL_TABLE_TYPE",
-  186: "SIMPLE_NUMBER_DICTIONARY_TYPE",
-  187: "CLOSURE_FEEDBACK_CELL_ARRAY_TYPE",
-  188: "OBJECT_BOILERPLATE_DESCRIPTION_TYPE",
-  189: "SCRIPT_CONTEXT_TABLE_TYPE",
-  190: "BYTE_ARRAY_TYPE",
-  191: "BYTECODE_ARRAY_TYPE",
-  192: "FIXED_DOUBLE_ARRAY_TYPE",
-  193: "INTERNAL_CLASS_WITH_SMI_ELEMENTS_TYPE",
-  194: "SLOPPY_ARGUMENTS_ELEMENTS_TYPE",
-  195: "TURBOSHAFT_FLOAT64_TYPE_TYPE",
-  196: "TURBOSHAFT_FLOAT64_RANGE_TYPE_TYPE",
-  197: "TURBOSHAFT_FLOAT64_SET_TYPE_TYPE",
-  198: "TURBOSHAFT_WORD32_TYPE_TYPE",
-  199: "TURBOSHAFT_WORD32_RANGE_TYPE_TYPE",
-  200: "TURBOSHAFT_WORD32_SET_TYPE_TYPE",
-  201: "TURBOSHAFT_WORD64_TYPE_TYPE",
-  202: "TURBOSHAFT_WORD64_RANGE_TYPE_TYPE",
-  203: "TURBOSHAFT_WORD64_SET_TYPE_TYPE",
-  204: "FOREIGN_TYPE",
-  205: "AWAIT_CONTEXT_TYPE",
-  206: "BLOCK_CONTEXT_TYPE",
-  207: "CATCH_CONTEXT_TYPE",
-  208: "DEBUG_EVALUATE_CONTEXT_TYPE",
-  209: "EVAL_CONTEXT_TYPE",
-  210: "FUNCTION_CONTEXT_TYPE",
-  211: "MODULE_CONTEXT_TYPE",
-  212: "NATIVE_CONTEXT_TYPE",
-  213: "SCRIPT_CONTEXT_TYPE",
-  214: "WITH_CONTEXT_TYPE",
-  215: "TURBOFAN_BITSET_TYPE_TYPE",
-  216: "TURBOFAN_HEAP_CONSTANT_TYPE_TYPE",
-  217: "TURBOFAN_OTHER_NUMBER_CONSTANT_TYPE_TYPE",
-  218: "TURBOFAN_RANGE_TYPE_TYPE",
-  219: "TURBOFAN_UNION_TYPE_TYPE",
-  220: "UNCOMPILED_DATA_WITH_PREPARSE_DATA_TYPE",
-  221: "UNCOMPILED_DATA_WITH_PREPARSE_DATA_AND_JOB_TYPE",
-  222: "UNCOMPILED_DATA_WITHOUT_PREPARSE_DATA_TYPE",
-  223: "UNCOMPILED_DATA_WITHOUT_PREPARSE_DATA_WITH_JOB_TYPE",
-  224: "WASM_FUNCTION_DATA_TYPE",
-  225: "WASM_CAPI_FUNCTION_DATA_TYPE",
-  226: "WASM_EXPORTED_FUNCTION_DATA_TYPE",
-  227: "WASM_JS_FUNCTION_DATA_TYPE",
-  228: "EXPORTED_SUB_CLASS_BASE_TYPE",
-  229: "EXPORTED_SUB_CLASS_TYPE",
-  230: "EXPORTED_SUB_CLASS2_TYPE",
-  231: "SMALL_ORDERED_HASH_MAP_TYPE",
-  232: "SMALL_ORDERED_HASH_SET_TYPE",
-  233: "SMALL_ORDERED_NAME_DICTIONARY_TYPE",
-  234: "ABSTRACT_INTERNAL_CLASS_SUBCLASS1_TYPE",
-  235: "ABSTRACT_INTERNAL_CLASS_SUBCLASS2_TYPE",
-  236: "DESCRIPTOR_ARRAY_TYPE",
-  237: "STRONG_DESCRIPTOR_ARRAY_TYPE",
-  238: "SOURCE_TEXT_MODULE_TYPE",
-  239: "SYNTHETIC_MODULE_TYPE",
-  240: "WEAK_FIXED_ARRAY_TYPE",
-  241: "TRANSITION_ARRAY_TYPE",
-  242: "ACCESSOR_INFO_TYPE",
-  243: "CALL_HANDLER_INFO_TYPE",
-  244: "CELL_TYPE",
-  245: "CODE_TYPE",
-  246: "COVERAGE_INFO_TYPE",
-  247: "EMBEDDER_DATA_ARRAY_TYPE",
-  248: "FEEDBACK_METADATA_TYPE",
-  249: "FEEDBACK_VECTOR_TYPE",
-  250: "FILLER_TYPE",
-  251: "FREE_SPACE_TYPE",
-  252: "INSTRUCTION_STREAM_TYPE",
-  253: "INTERNAL_CLASS_TYPE",
-  254: "INTERNAL_CLASS_WITH_STRUCT_ELEMENTS_TYPE",
-  255: "MAP_TYPE",
-  256: "MEGA_DOM_HANDLER_TYPE",
-  257: "ON_HEAP_BASIC_BLOCK_PROFILER_DATA_TYPE",
-  258: "PREPARSE_DATA_TYPE",
-  259: "PROPERTY_ARRAY_TYPE",
-  260: "PROPERTY_CELL_TYPE",
-  261: "SCOPE_INFO_TYPE",
-  262: "SHARED_FUNCTION_INFO_TYPE",
-  263: "SMI_BOX_TYPE",
-  264: "SMI_PAIR_TYPE",
-  265: "SORT_STATE_TYPE",
-  266: "SWISS_NAME_DICTIONARY_TYPE",
-  267: "WASM_API_FUNCTION_REF_TYPE",
-  268: "WASM_CONTINUATION_OBJECT_TYPE",
-  269: "WASM_INTERNAL_FUNCTION_TYPE",
-  270: "WASM_NULL_TYPE",
-  271: "WASM_RESUME_DATA_TYPE",
-  272: "WASM_STRING_VIEW_ITER_TYPE",
-  273: "WASM_TYPE_INFO_TYPE",
-  274: "WEAK_ARRAY_LIST_TYPE",
-  275: "WEAK_CELL_TYPE",
-  276: "WASM_ARRAY_TYPE",
-  277: "WASM_STRUCT_TYPE",
-  278: "JS_PROXY_TYPE",
-  1057: "JS_OBJECT_TYPE",
-  279: "JS_GLOBAL_OBJECT_TYPE",
-  280: "JS_GLOBAL_PROXY_TYPE",
-  281: "JS_MODULE_NAMESPACE_TYPE",
-  1040: "JS_SPECIAL_API_OBJECT_TYPE",
-  1041: "JS_PRIMITIVE_WRAPPER_TYPE",
-  1058: "JS_API_OBJECT_TYPE",
-  2058: "JS_LAST_DUMMY_API_OBJECT_TYPE",
-  2059: "JS_DATA_VIEW_TYPE",
-  2060: "JS_RAB_GSAB_DATA_VIEW_TYPE",
-  2061: "JS_TYPED_ARRAY_TYPE",
-  2062: "JS_ARRAY_BUFFER_TYPE",
-  2063: "JS_PROMISE_TYPE",
-  2064: "JS_BOUND_FUNCTION_TYPE",
-  2065: "JS_WRAPPED_FUNCTION_TYPE",
-  2066: "JS_FUNCTION_TYPE",
-  2067: "BIGINT64_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2068: "BIGUINT64_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2069: "FLOAT32_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2070: "FLOAT64_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2071: "INT16_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2072: "INT32_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2073: "INT8_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2074: "UINT16_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2075: "UINT32_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2076: "UINT8_CLAMPED_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2077: "UINT8_TYPED_ARRAY_CONSTRUCTOR_TYPE",
-  2078: "JS_ARRAY_CONSTRUCTOR_TYPE",
-  2079: "JS_PROMISE_CONSTRUCTOR_TYPE",
-  2080: "JS_REG_EXP_CONSTRUCTOR_TYPE",
-  2081: "JS_CLASS_CONSTRUCTOR_TYPE",
-  2082: "JS_ARRAY_ITERATOR_PROTOTYPE_TYPE",
-  2083: "JS_ITERATOR_PROTOTYPE_TYPE",
-  2084: "JS_MAP_ITERATOR_PROTOTYPE_TYPE",
-  2085: "JS_OBJECT_PROTOTYPE_TYPE",
-  2086: "JS_PROMISE_PROTOTYPE_TYPE",
-  2087: "JS_REG_EXP_PROTOTYPE_TYPE",
-  2088: "JS_SET_ITERATOR_PROTOTYPE_TYPE",
-  2089: "JS_SET_PROTOTYPE_TYPE",
-  2090: "JS_STRING_ITERATOR_PROTOTYPE_TYPE",
-  2091: "JS_TYPED_ARRAY_PROTOTYPE_TYPE",
-  2092: "JS_MAP_KEY_ITERATOR_TYPE",
-  2093: "JS_MAP_KEY_VALUE_ITERATOR_TYPE",
-  2094: "JS_MAP_VALUE_ITERATOR_TYPE",
-  2095: "JS_SET_KEY_VALUE_ITERATOR_TYPE",
-  2096: "JS_SET_VALUE_ITERATOR_TYPE",
-  2097: "JS_ATOMICS_CONDITION_TYPE",
-  2098: "JS_ATOMICS_MUTEX_TYPE",
-  2099: "JS_SHARED_ARRAY_TYPE",
-  2100: "JS_SHARED_STRUCT_TYPE",
-  2101: "JS_ITERATOR_DROP_HELPER_TYPE",
-  2102: "JS_ITERATOR_FILTER_HELPER_TYPE",
-  2103: "JS_ITERATOR_MAP_HELPER_TYPE",
-  2104: "JS_ITERATOR_TAKE_HELPER_TYPE",
-  2105: "JS_GENERATOR_OBJECT_TYPE",
-  2106: "JS_ASYNC_FUNCTION_OBJECT_TYPE",
-  2107: "JS_ASYNC_GENERATOR_OBJECT_TYPE",
-  2108: "JS_MAP_TYPE",
-  2109: "JS_SET_TYPE",
-  2110: "JS_WEAK_MAP_TYPE",
-  2111: "JS_WEAK_SET_TYPE",
-  2112: "JS_ARGUMENTS_OBJECT_TYPE",
-  2113: "JS_ARRAY_TYPE",
-  2114: "JS_ARRAY_ITERATOR_TYPE",
-  2115: "JS_ASYNC_FROM_SYNC_ITERATOR_TYPE",
-  2116: "JS_COLLATOR_TYPE",
-  2117: "JS_CONTEXT_EXTENSION_OBJECT_TYPE",
-  2118: "JS_DATE_TYPE",
-  2119: "JS_DATE_TIME_FORMAT_TYPE",
-  2120: "JS_DISPLAY_NAMES_TYPE",
-  2121: "JS_DURATION_FORMAT_TYPE",
-  2122: "JS_ERROR_TYPE",
-  2123: "JS_EXTERNAL_OBJECT_TYPE",
-  2124: "JS_FINALIZATION_REGISTRY_TYPE",
-  2125: "JS_LIST_FORMAT_TYPE",
-  2126: "JS_LOCALE_TYPE",
-  2127: "JS_MESSAGE_OBJECT_TYPE",
-  2128: "JS_NUMBER_FORMAT_TYPE",
-  2129: "JS_PLURAL_RULES_TYPE",
-  2130: "JS_RAW_JSON_TYPE",
-  2131: "JS_REG_EXP_TYPE",
-  2132: "JS_REG_EXP_STRING_ITERATOR_TYPE",
-  2133: "JS_RELATIVE_TIME_FORMAT_TYPE",
-  2134: "JS_SEGMENT_ITERATOR_TYPE",
-  2135: "JS_SEGMENTER_TYPE",
-  2136: "JS_SEGMENTS_TYPE",
-  2137: "JS_SHADOW_REALM_TYPE",
-  2138: "JS_STRING_ITERATOR_TYPE",
-  2139: "JS_TEMPORAL_CALENDAR_TYPE",
-  2140: "JS_TEMPORAL_DURATION_TYPE",
-  2141: "JS_TEMPORAL_INSTANT_TYPE",
-  2142: "JS_TEMPORAL_PLAIN_DATE_TYPE",
-  2143: "JS_TEMPORAL_PLAIN_DATE_TIME_TYPE",
-  2144: "JS_TEMPORAL_PLAIN_MONTH_DAY_TYPE",
-  2145: "JS_TEMPORAL_PLAIN_TIME_TYPE",
-  2146: "JS_TEMPORAL_PLAIN_YEAR_MONTH_TYPE",
-  2147: "JS_TEMPORAL_TIME_ZONE_TYPE",
-  2148: "JS_TEMPORAL_ZONED_DATE_TIME_TYPE",
-  2149: "JS_V8_BREAK_ITERATOR_TYPE",
-  2150: "JS_VALID_ITERATOR_WRAPPER_TYPE",
-  2151: "JS_WEAK_REF_TYPE",
-  2152: "WASM_EXCEPTION_PACKAGE_TYPE",
-  2153: "WASM_GLOBAL_OBJECT_TYPE",
-  2154: "WASM_INSTANCE_OBJECT_TYPE",
-  2155: "WASM_MEMORY_OBJECT_TYPE",
-  2156: "WASM_MODULE_OBJECT_TYPE",
-  2157: "WASM_SUSPENDER_OBJECT_TYPE",
-  2158: "WASM_TABLE_OBJECT_TYPE",
-  2159: "WASM_TAG_OBJECT_TYPE",
-  2160: "WASM_VALUE_OBJECT_TYPE",
-}
-
-# List of known V8 maps.
-KNOWN_MAPS = {
-    ("read_only_space", 0x00061): (255, "MetaMap"),
-    ("read_only_space", 0x00089): (175, "FixedArrayMap"),
-    ("read_only_space", 0x000b1): (240, "WeakFixedArrayMap"),
-    ("read_only_space", 0x000d9): (274, "WeakArrayListMap"),
-    ("read_only_space", 0x00101): (175, "FixedCOWArrayMap"),
-    ("read_only_space", 0x00129): (236, "DescriptorArrayMap"),
-    ("read_only_space", 0x00151): (131, "UndefinedMap"),
-    ("read_only_space", 0x00179): (131, "NullMap"),
-    ("read_only_space", 0x001a1): (131, "TheHoleMap"),
-    ("read_only_space", 0x001c9): (151, "CallSiteInfoMap"),
-    ("read_only_space", 0x001f1): (154, "EnumCacheMap"),
-    ("read_only_space", 0x002a5): (261, "ScopeInfoMap"),
-    ("read_only_space", 0x002cd): (175, "ModuleInfoMap"),
-    ("read_only_space", 0x002f5): (187, "ClosureFeedbackCellArrayMap"),
-    ("read_only_space", 0x0031d): (249, "FeedbackVectorMap"),
-    ("read_only_space", 0x00345): (130, "HeapNumberMap"),
-    ("read_only_space", 0x0036d): (204, "ForeignMap"),
-    ("read_only_space", 0x00395): (256, "MegaDomHandlerMap"),
-    ("read_only_space", 0x003bd): (131, "BooleanMap"),
-    ("read_only_space", 0x003e5): (131, "UninitializedMap"),
-    ("read_only_space", 0x0040d): (131, "ArgumentsMarkerMap"),
-    ("read_only_space", 0x00435): (131, "ExceptionMap"),
-    ("read_only_space", 0x0045d): (131, "TerminationExceptionMap"),
-    ("read_only_space", 0x00485): (131, "OptimizedOutMap"),
-    ("read_only_space", 0x004ad): (131, "StaleRegisterMap"),
-    ("read_only_space", 0x004d5): (131, "SelfReferenceMarkerMap"),
-    ("read_only_space", 0x004fd): (131, "BasicBlockCountersMarkerMap"),
-    ("read_only_space", 0x00525): (129, "BigIntMap"),
-    ("read_only_space", 0x0054d): (128, "SymbolMap"),
-    ("read_only_space", 0x00575): (32, "StringMap"),
-    ("read_only_space", 0x0059d): (40, "OneByteStringMap"),
-    ("read_only_space", 0x005c5): (33, "ConsStringMap"),
-    ("read_only_space", 0x005ed): (41, "ConsOneByteStringMap"),
-    ("read_only_space", 0x00615): (35, "SlicedStringMap"),
-    ("read_only_space", 0x0063d): (43, "SlicedOneByteStringMap"),
-    ("read_only_space", 0x00665): (34, "ExternalStringMap"),
-    ("read_only_space", 0x0068d): (42, "ExternalOneByteStringMap"),
-    ("read_only_space", 0x006b5): (50, "UncachedExternalStringMap"),
-    ("read_only_space", 0x006dd): (58, "UncachedExternalOneByteStringMap"),
-    ("read_only_space", 0x00705): (98, "SharedExternalStringMap"),
-    ("read_only_space", 0x0072d): (106, "SharedExternalOneByteStringMap"),
-    ("read_only_space", 0x00755): (114, "SharedUncachedExternalStringMap"),
-    ("read_only_space", 0x0077d): (122, "SharedUncachedExternalOneByteStringMap"),
-    ("read_only_space", 0x007a5): (2, "ExternalInternalizedStringMap"),
-    ("read_only_space", 0x007cd): (10, "ExternalOneByteInternalizedStringMap"),
-    ("read_only_space", 0x007f5): (18, "UncachedExternalInternalizedStringMap"),
-    ("read_only_space", 0x0081d): (26, "UncachedExternalOneByteInternalizedStringMap"),
-    ("read_only_space", 0x00845): (0, "InternalizedStringMap"),
-    ("read_only_space", 0x0086d): (8, "OneByteInternalizedStringMap"),
-    ("read_only_space", 0x00895): (37, "ThinStringMap"),
-    ("read_only_space", 0x008bd): (96, "SharedStringMap"),
-    ("read_only_space", 0x008e5): (104, "SharedOneByteStringMap"),
-    ("read_only_space", 0x0090d): (192, "FixedDoubleArrayMap"),
-    ("read_only_space", 0x00935): (248, "FeedbackMetadataArrayMap"),
-    ("read_only_space", 0x0095d): (190, "ByteArrayMap"),
-    ("read_only_space", 0x00985): (191, "BytecodeArrayMap"),
-    ("read_only_space", 0x009ad): (251, "FreeSpaceMap"),
-    ("read_only_space", 0x009d5): (259, "PropertyArrayMap"),
-    ("read_only_space", 0x009fd): (231, "SmallOrderedHashMapMap"),
-    ("read_only_space", 0x00a25): (232, "SmallOrderedHashSetMap"),
-    ("read_only_space", 0x00a4d): (233, "SmallOrderedNameDictionaryMap"),
-    ("read_only_space", 0x00a75): (252, "InstructionStreamMap"),
-    ("read_only_space", 0x00a9d): (244, "CellMap"),
-    ("read_only_space", 0x00acd): (260, "GlobalPropertyCellMap"),
-    ("read_only_space", 0x00af5): (250, "OnePointerFillerMap"),
-    ("read_only_space", 0x00b1d): (250, "TwoPointerFillerMap"),
-    ("read_only_space", 0x00b45): (156, "NoClosuresCellMap"),
-    ("read_only_space", 0x00b6d): (156, "OneClosureCellMap"),
-    ("read_only_space", 0x00b95): (156, "ManyClosuresCellMap"),
-    ("read_only_space", 0x00bbd): (241, "TransitionArrayMap"),
-    ("read_only_space", 0x00be5): (176, "HashTableMap"),
-    ("read_only_space", 0x00c0d): (184, "OrderedNameDictionaryMap"),
-    ("read_only_space", 0x00c35): (179, "NameDictionaryMap"),
-    ("read_only_space", 0x00c5d): (266, "SwissNameDictionaryMap"),
-    ("read_only_space", 0x00c85): (178, "GlobalDictionaryMap"),
-    ("read_only_space", 0x00cad): (181, "NumberDictionaryMap"),
-    ("read_only_space", 0x00cd5): (185, "RegisteredSymbolTableMap"),
-    ("read_only_space", 0x00cfd): (175, "ArrayListMap"),
-    ("read_only_space", 0x00d25): (242, "AccessorInfoMap"),
-    ("read_only_space", 0x00d4d): (258, "PreparseDataMap"),
-    ("read_only_space", 0x00d75): (262, "SharedFunctionInfoMap"),
-    ("read_only_space", 0x00d9d): (245, "CodeMap"),
-    ("read_only_space", 0x00ff9): (132, "PromiseFulfillReactionJobTaskMap"),
-    ("read_only_space", 0x01021): (133, "PromiseRejectReactionJobTaskMap"),
-    ("read_only_space", 0x01049): (134, "CallableTaskMap"),
-    ("read_only_space", 0x01071): (135, "CallbackTaskMap"),
-    ("read_only_space", 0x01099): (136, "PromiseResolveThenableJobTaskMap"),
-    ("read_only_space", 0x010c1): (139, "FunctionTemplateInfoMap"),
-    ("read_only_space", 0x010e9): (140, "ObjectTemplateInfoMap"),
-    ("read_only_space", 0x01111): (141, "AccessCheckInfoMap"),
-    ("read_only_space", 0x01139): (142, "AccessorPairMap"),
-    ("read_only_space", 0x01161): (143, "AliasedArgumentsEntryMap"),
-    ("read_only_space", 0x01189): (144, "AllocationMementoMap"),
-    ("read_only_space", 0x011b1): (146, "ArrayBoilerplateDescriptionMap"),
-    ("read_only_space", 0x011d9): (147, "AsmWasmDataMap"),
-    ("read_only_space", 0x01201): (148, "AsyncGeneratorRequestMap"),
-    ("read_only_space", 0x01229): (149, "BreakPointMap"),
-    ("read_only_space", 0x01251): (150, "BreakPointInfoMap"),
-    ("read_only_space", 0x01279): (152, "ClassPositionsMap"),
-    ("read_only_space", 0x012a1): (153, "DebugInfoMap"),
-    ("read_only_space", 0x012c9): (155, "ErrorStackDataMap"),
-    ("read_only_space", 0x012f1): (157, "FunctionTemplateRareDataMap"),
-    ("read_only_space", 0x01319): (158, "InterceptorInfoMap"),
-    ("read_only_space", 0x01341): (159, "InterpreterDataMap"),
-    ("read_only_space", 0x01369): (160, "ModuleRequestMap"),
-    ("read_only_space", 0x01391): (161, "PromiseCapabilityMap"),
-    ("read_only_space", 0x013b9): (162, "PromiseOnStackMap"),
-    ("read_only_space", 0x013e1): (163, "PromiseReactionMap"),
-    ("read_only_space", 0x01409): (164, "PropertyDescriptorObjectMap"),
-    ("read_only_space", 0x01431): (165, "PrototypeInfoMap"),
-    ("read_only_space", 0x01459): (166, "RegExpBoilerplateDescriptionMap"),
-    ("read_only_space", 0x01481): (167, "ScriptMap"),
-    ("read_only_space", 0x014a9): (168, "ScriptOrModuleMap"),
-    ("read_only_space", 0x014d1): (169, "SourceTextModuleInfoEntryMap"),
-    ("read_only_space", 0x014f9): (170, "StackFrameInfoMap"),
-    ("read_only_space", 0x01521): (171, "TemplateObjectDescriptionMap"),
-    ("read_only_space", 0x01549): (172, "Tuple2Map"),
-    ("read_only_space", 0x01571): (173, "WasmExceptionTagMap"),
-    ("read_only_space", 0x01599): (174, "WasmIndirectFunctionTableMap"),
-    ("read_only_space", 0x015c1): (145, "AllocationSiteWithWeakNextMap"),
-    ("read_only_space", 0x015e9): (145, "AllocationSiteWithoutWeakNextMap"),
-    ("read_only_space", 0x01611): (137, "LoadHandler1Map"),
-    ("read_only_space", 0x01639): (137, "LoadHandler2Map"),
-    ("read_only_space", 0x01661): (137, "LoadHandler3Map"),
-    ("read_only_space", 0x01689): (138, "StoreHandler0Map"),
-    ("read_only_space", 0x016b1): (138, "StoreHandler1Map"),
-    ("read_only_space", 0x016d9): (138, "StoreHandler2Map"),
-    ("read_only_space", 0x01701): (138, "StoreHandler3Map"),
-    ("read_only_space", 0x01729): (222, "UncompiledDataWithoutPreparseDataMap"),
-    ("read_only_space", 0x01751): (220, "UncompiledDataWithPreparseDataMap"),
-    ("read_only_space", 0x01779): (223, "UncompiledDataWithoutPreparseDataWithJobMap"),
-    ("read_only_space", 0x017a1): (221, "UncompiledDataWithPreparseDataAndJobMap"),
-    ("read_only_space", 0x017c9): (257, "OnHeapBasicBlockProfilerDataMap"),
-    ("read_only_space", 0x017f1): (215, "TurbofanBitsetTypeMap"),
-    ("read_only_space", 0x01819): (219, "TurbofanUnionTypeMap"),
-    ("read_only_space", 0x01841): (218, "TurbofanRangeTypeMap"),
-    ("read_only_space", 0x01869): (216, "TurbofanHeapConstantTypeMap"),
-    ("read_only_space", 0x01891): (217, "TurbofanOtherNumberConstantTypeMap"),
-    ("read_only_space", 0x018b9): (198, "TurboshaftWord32TypeMap"),
-    ("read_only_space", 0x018e1): (199, "TurboshaftWord32RangeTypeMap"),
-    ("read_only_space", 0x01909): (201, "TurboshaftWord64TypeMap"),
-    ("read_only_space", 0x01931): (202, "TurboshaftWord64RangeTypeMap"),
-    ("read_only_space", 0x01959): (195, "TurboshaftFloat64TypeMap"),
-    ("read_only_space", 0x01981): (196, "TurboshaftFloat64RangeTypeMap"),
-    ("read_only_space", 0x019a9): (253, "InternalClassMap"),
-    ("read_only_space", 0x019d1): (264, "SmiPairMap"),
-    ("read_only_space", 0x019f9): (263, "SmiBoxMap"),
-    ("read_only_space", 0x01a21): (228, "ExportedSubClassBaseMap"),
-    ("read_only_space", 0x01a49): (229, "ExportedSubClassMap"),
-    ("read_only_space", 0x01a71): (234, "AbstractInternalClassSubclass1Map"),
-    ("read_only_space", 0x01a99): (235, "AbstractInternalClassSubclass2Map"),
-    ("read_only_space", 0x01ac1): (230, "ExportedSubClass2Map"),
-    ("read_only_space", 0x01ae9): (265, "SortStateMap"),
-    ("read_only_space", 0x01b11): (272, "WasmStringViewIterMap"),
-    ("read_only_space", 0x01b39): (194, "SloppyArgumentsElementsMap"),
-    ("read_only_space", 0x01b61): (237, "StrongDescriptorArrayMap"),
-    ("read_only_space", 0x01b89): (200, "TurboshaftWord32SetTypeMap"),
-    ("read_only_space", 0x01bb1): (203, "TurboshaftWord64SetTypeMap"),
-    ("read_only_space", 0x01bd9): (197, "TurboshaftFloat64SetTypeMap"),
-    ("read_only_space", 0x01c01): (193, "InternalClassWithSmiElementsMap"),
-    ("read_only_space", 0x01c29): (254, "InternalClassWithStructElementsMap"),
-    ("read_only_space", 0x01c51): (182, "OrderedHashMapMap"),
-    ("read_only_space", 0x01c79): (183, "OrderedHashSetMap"),
-    ("read_only_space", 0x01ca1): (186, "SimpleNumberDictionaryMap"),
-    ("read_only_space", 0x01cc9): (180, "NameToIndexHashTableMap"),
-    ("read_only_space", 0x01cf1): (247, "EmbedderDataArrayMap"),
-    ("read_only_space", 0x01d19): (177, "EphemeronHashTableMap"),
-    ("read_only_space", 0x01d41): (189, "ScriptContextTableMap"),
-    ("read_only_space", 0x01d69): (188, "ObjectBoilerplateDescriptionMap"),
-    ("read_only_space", 0x01d91): (246, "CoverageInfoMap"),
-    ("read_only_space", 0x01db9): (243, "SideEffectCallHandlerInfoMap"),
-    ("read_only_space", 0x01de1): (243, "SideEffectFreeCallHandlerInfoMap"),
-    ("read_only_space", 0x01e09): (243, "NextCallSideEffectFreeCallHandlerInfoMap"),
-    ("read_only_space", 0x01e31): (238, "SourceTextModuleMap"),
-    ("read_only_space", 0x01e59): (239, "SyntheticModuleMap"),
-    ("read_only_space", 0x01e81): (267, "WasmApiFunctionRefMap"),
-    ("read_only_space", 0x01ea9): (225, "WasmCapiFunctionDataMap"),
-    ("read_only_space", 0x01ed1): (226, "WasmExportedFunctionDataMap"),
-    ("read_only_space", 0x01ef9): (269, "WasmInternalFunctionMap"),
-    ("read_only_space", 0x01f21): (227, "WasmJSFunctionDataMap"),
-    ("read_only_space", 0x01f49): (271, "WasmResumeDataMap"),
-    ("read_only_space", 0x01f71): (273, "WasmTypeInfoMap"),
-    ("read_only_space", 0x01f99): (268, "WasmContinuationObjectMap"),
-    ("read_only_space", 0x01fc1): (270, "WasmNullMap"),
-    ("read_only_space", 0x01fe9): (275, "WeakCellMap"),
-    ("old_space", 0x043c5): (2123, "ExternalMap"),
-    ("old_space", 0x043ed): (2127, "JSMessageObjectMap"),
-}
-
-# List of known V8 objects.
-KNOWN_OBJECTS = {
-  ("read_only_space", 0x00219): "EmptyFixedArray",
-  ("read_only_space", 0x00221): "EmptyWeakFixedArray",
-  ("read_only_space", 0x00229): "EmptyWeakArrayList",
-  ("read_only_space", 0x00235): "NullValue",
-  ("read_only_space", 0x00251): "UndefinedValue",
-  ("read_only_space", 0x0026d): "TheHoleValue",
-  ("read_only_space", 0x00289): "EmptyEnumCache",
-  ("read_only_space", 0x00295): "EmptyDescriptorArray",
-  ("read_only_space", 0x00ac5): "InvalidPrototypeValidityCell",
-  ("read_only_space", 0x00dc5): "TrueValue",
-  ("read_only_space", 0x00de1): "FalseValue",
-  ("read_only_space", 0x00dfd): "HashSeed",
-  ("read_only_space", 0x00e0d): "empty_string",
-  ("read_only_space", 0x00efd): "EmptyPropertyDictionary",
-  ("read_only_space", 0x00f29): "EmptyOrderedPropertyDictionary",
-  ("read_only_space", 0x00f4d): "EmptySwissPropertyDictionary",
-  ("read_only_space", 0x00f6d): "EmptyByteArray",
-  ("read_only_space", 0x00f75): "EmptyScopeInfo",
-  ("read_only_space", 0x00f85): "EmptyPropertyArray",
-  ("read_only_space", 0x00f8d): "MinusZeroValue",
-  ("read_only_space", 0x00f99): "NanValue",
-  ("read_only_space", 0x00fa5): "HoleNanValue",
-  ("read_only_space", 0x00fb1): "InfinityValue",
-  ("read_only_space", 0x00fbd): "MinusInfinityValue",
-  ("read_only_space", 0x00fc9): "MaxSafeInteger",
-  ("read_only_space", 0x00fd5): "MaxUInt32",
-  ("read_only_space", 0x00fe1): "SmiMinValue",
-  ("read_only_space", 0x00fed): "SmiMaxValuePlusOne",
-  ("read_only_space", 0x02011): "NoOpInterceptorInfo",
-  ("read_only_space", 0x02039): "EmptyArrayList",
-  ("read_only_space", 0x02045): "EmptyObjectBoilerplateDescription",
-  ("read_only_space", 0x02051): "EmptyArrayBoilerplateDescription",
-  ("read_only_space", 0x0205d): "EmptyClosureFeedbackCellArray",
-  ("read_only_space", 0x02065): "SingleCharacterStringTable",
-  ("read_only_space", 0x05af5): "UninitializedValue",
-  ("read_only_space", 0x05b2d): "ArgumentsMarker",
-  ("read_only_space", 0x05b65): "TerminationException",
-  ("read_only_space", 0x05ba5): "Exception",
-  ("read_only_space", 0x05bc1): "OptimizedOut",
-  ("read_only_space", 0x05bf9): "StaleRegister",
-  ("read_only_space", 0x05c31): "SelfReferenceMarker",
-  ("read_only_space", 0x05c71): "BasicBlockCountersMarker",
-  ("read_only_space", 0x06139): "EmptySlowElementDictionary",
-  ("read_only_space", 0x0615d): "EmptySymbolTable",
-  ("read_only_space", 0x06179): "EmptyOrderedHashMap",
-  ("read_only_space", 0x0618d): "EmptyOrderedHashSet",
-  ("read_only_space", 0x061a1): "EmptyFeedbackMetadata",
-  ("read_only_space", 0x061ad): "GlobalThisBindingScopeInfo",
-  ("read_only_space", 0x061cd): "EmptyFunctionScopeInfo",
-  ("read_only_space", 0x061f1): "NativeScopeInfo",
-  ("read_only_space", 0x06209): "ShadowRealmScopeInfo",
-  ("read_only_space", 0x0fffd): "WasmNull",
-  ("old_space", 0x04275): "ArgumentsIteratorAccessor",
-  ("old_space", 0x0428d): "ArrayLengthAccessor",
-  ("old_space", 0x042a5): "BoundFunctionLengthAccessor",
-  ("old_space", 0x042bd): "BoundFunctionNameAccessor",
-  ("old_space", 0x042d5): "ErrorStackAccessor",
-  ("old_space", 0x042ed): "FunctionArgumentsAccessor",
-  ("old_space", 0x04305): "FunctionCallerAccessor",
-  ("old_space", 0x0431d): "FunctionNameAccessor",
-  ("old_space", 0x04335): "FunctionLengthAccessor",
-  ("old_space", 0x0434d): "FunctionPrototypeAccessor",
-  ("old_space", 0x04365): "StringLengthAccessor",
-  ("old_space", 0x0437d): "ValueUnavailableAccessor",
-  ("old_space", 0x04395): "WrappedFunctionLengthAccessor",
-  ("old_space", 0x043ad): "WrappedFunctionNameAccessor",
-  ("old_space", 0x043c5): "ExternalMap",
-  ("old_space", 0x043ed): "JSMessageObjectMap",
-  ("old_space", 0x04415): "EmptyScript",
-  ("old_space", 0x0445d): "ManyClosuresCell",
-  ("old_space", 0x04469): "ArrayConstructorProtector",
-  ("old_space", 0x0447d): "NoElementsProtector",
-  ("old_space", 0x04491): "MegaDOMProtector",
-  ("old_space", 0x044a5): "IsConcatSpreadableProtector",
-  ("old_space", 0x044b9): "ArraySpeciesProtector",
-  ("old_space", 0x044cd): "TypedArraySpeciesProtector",
-  ("old_space", 0x044e1): "PromiseSpeciesProtector",
-  ("old_space", 0x044f5): "RegExpSpeciesProtector",
-  ("old_space", 0x04509): "StringLengthProtector",
-  ("old_space", 0x0451d): "ArrayIteratorProtector",
-  ("old_space", 0x04531): "ArrayBufferDetachingProtector",
-  ("old_space", 0x04545): "PromiseHookProtector",
-  ("old_space", 0x04559): "PromiseResolveProtector",
-  ("old_space", 0x0456d): "MapIteratorProtector",
-  ("old_space", 0x04581): "PromiseThenProtector",
-  ("old_space", 0x04595): "SetIteratorProtector",
-  ("old_space", 0x045a9): "StringIteratorProtector",
-  ("old_space", 0x045bd): "NumberStringPrototypeNoReplaceProtector",
-  ("old_space", 0x045d1): "StringSplitCache",
-  ("old_space", 0x049d9): "RegExpMultipleCache",
-  ("old_space", 0x04de1): "BuiltinsConstantsTable",
-  ("old_space", 0x053d9): "AsyncFunctionAwaitRejectSharedFun",
-  ("old_space", 0x053fd): "AsyncFunctionAwaitResolveSharedFun",
-  ("old_space", 0x05421): "AsyncGeneratorAwaitRejectSharedFun",
-  ("old_space", 0x05445): "AsyncGeneratorAwaitResolveSharedFun",
-  ("old_space", 0x05469): "AsyncGeneratorYieldWithAwaitResolveSharedFun",
-  ("old_space", 0x0548d): "AsyncGeneratorReturnResolveSharedFun",
-  ("old_space", 0x054b1): "AsyncGeneratorReturnClosedRejectSharedFun",
-  ("old_space", 0x054d5): "AsyncGeneratorReturnClosedResolveSharedFun",
-  ("old_space", 0x054f9): "AsyncIteratorValueUnwrapSharedFun",
-  ("old_space", 0x0551d): "PromiseAllResolveElementSharedFun",
-  ("old_space", 0x05541): "PromiseAllSettledResolveElementSharedFun",
-  ("old_space", 0x05565): "PromiseAllSettledRejectElementSharedFun",
-  ("old_space", 0x05589): "PromiseAnyRejectElementSharedFun",
-  ("old_space", 0x055ad): "PromiseCapabilityDefaultRejectSharedFun",
-  ("old_space", 0x055d1): "PromiseCapabilityDefaultResolveSharedFun",
-  ("old_space", 0x055f5): "PromiseCatchFinallySharedFun",
-  ("old_space", 0x05619): "PromiseGetCapabilitiesExecutorSharedFun",
-  ("old_space", 0x0563d): "PromiseThenFinallySharedFun",
-  ("old_space", 0x05661): "PromiseThrowerFinallySharedFun",
-  ("old_space", 0x05685): "PromiseValueThunkFinallySharedFun",
-  ("old_space", 0x056a9): "ProxyRevokeSharedFun",
-  ("old_space", 0x056cd): "ShadowRealmImportValueFulfilledSFI",
-  ("old_space", 0x056f1): "SourceTextModuleExecuteAsyncModuleFulfilledSFI",
-  ("old_space", 0x05715): "SourceTextModuleExecuteAsyncModuleRejectedSFI",
-}
-
-# Lower 32 bits of first page addresses for various heap spaces.
-HEAP_FIRST_PAGES = {
-  0x00100000: "old_space",
-  0x00000000: "read_only_space",
-}
-
-# List of known V8 Frame Markers.
-FRAME_MARKERS = (
-  "ENTRY",
-  "CONSTRUCT_ENTRY",
-  "EXIT",
-  "WASM",
-  "WASM_TO_JS",
-  "WASM_TO_JS_FUNCTION",
-  "JS_TO_WASM",
-  "STACK_SWITCH",
-  "WASM_DEBUG_BREAK",
-  "C_WASM_ENTRY",
-  "WASM_EXIT",
-  "WASM_LIFTOFF_SETUP",
-  "INTERPRETED",
-  "BASELINE",
-  "MAGLEV",
-  "TURBOFAN",
-  "STUB",
-  "TURBOFAN_STUB_WITH_CONTEXT",
-  "BUILTIN_CONTINUATION",
-  "JAVA_SCRIPT_BUILTIN_CONTINUATION",
-  "JAVA_SCRIPT_BUILTIN_CONTINUATION_WITH_CATCH",
-  "INTERNAL",
-  "CONSTRUCT",
-  "BUILTIN",
-  "BUILTIN_EXIT",
-  "NATIVE",
-  "IRREGEXP",
-)
-
-# This set of constants is generated from a shipping build.
diff --git a/deps/v8/tools/v8windbg/test/v8windbg-test.cc b/deps/v8/tools/v8windbg/test/v8windbg-test.cc
index ecbe04a329fa96..e3cf956d1d221f 100644
--- a/deps/v8/tools/v8windbg/test/v8windbg-test.cc
+++ b/deps/v8/tools/v8windbg/test/v8windbg-test.cc
@@ -194,7 +194,7 @@ void RunTests() {
   CHECK(SUCCEEDED(hr));
 
   ULONG type, proc_id, thread_id, desc_used;
-  byte desc[1024];
+  uint8_t desc[1024];
   hr = p_debug_control->GetLastEventInformation(
       &type, &proc_id, &thread_id, nullptr, 0, nullptr,
       reinterpret_cast<PSTR>(desc), 1024, &desc_used);
diff --git a/deps/v8/tools/vim/ninja_output.py b/deps/v8/tools/vim/ninja_output.py
index 09f1d7871d7a2d..edda9fb3ea0941 100644
--- a/deps/v8/tools/vim/ninja_output.py
+++ b/deps/v8/tools/vim/ninja_output.py
@@ -6,7 +6,6 @@
 
 import sys
 import os
-import itertools
 import re
 
 try:
diff --git a/deps/v8/tools/wasm-compilation-hints/inject-compilation-hints.py b/deps/v8/tools/wasm-compilation-hints/inject-compilation-hints.py
index b04bf2cd80895b..3242c99b035399 100755
--- a/deps/v8/tools/wasm-compilation-hints/inject-compilation-hints.py
+++ b/deps/v8/tools/wasm-compilation-hints/inject-compilation-hints.py
@@ -42,7 +42,7 @@ def parse_args():
       while True:
         id, bs = read_varuintN(fin)
         fout.write(bs)
-        if id == None:
+        if id is None:
           break
         payload_length, bs = read_varuintN(fin)
         fout.write(bs)
diff --git a/deps/v8/tools/wasm-compilation-hints/wasm-objdump-compilation-hints.py b/deps/v8/tools/wasm-compilation-hints/wasm-objdump-compilation-hints.py
index a1dd8e4d3933b8..b787b481b3ece4 100755
--- a/deps/v8/tools/wasm-compilation-hints/wasm-objdump-compilation-hints.py
+++ b/deps/v8/tools/wasm-compilation-hints/wasm-objdump-compilation-hints.py
@@ -27,7 +27,7 @@ def parse_args():
     read_version(fin);
     while True:
       id, bs = read_varuintN(fin)
-      if id == None:
+      if id is None:
         break
       payload_length, bs = read_varuintN(fin)
       if id == CUSTOM_SECTION_ID:
diff --git a/deps/v8/tools/wasm-compilation-hints/wasm.py b/deps/v8/tools/wasm-compilation-hints/wasm.py
index bbd3e5bbbec5dc..bb1f496a27a1e3 100644
--- a/deps/v8/tools/wasm-compilation-hints/wasm.py
+++ b/deps/v8/tools/wasm-compilation-hints/wasm.py
@@ -4,11 +4,6 @@
 # Use of this source code is governed by a BSD-style license that can be found
 # in the LICENSE file.
 
-import io
-import math
-import struct
-import sys
-
 CUSTOM_SECTION_ID = 0
 FUNCTION_SECTION_ID = 3
 
diff --git a/deps/v8/tools/wasm/module-inspector.cc b/deps/v8/tools/wasm/module-inspector.cc
index dab9d8fff1502c..812a48283b1653 100644
--- a/deps/v8/tools/wasm/module-inspector.cc
+++ b/deps/v8/tools/wasm/module-inspector.cc
@@ -56,6 +56,10 @@ int PrintHelp(char** argv) {
       << " section (requires using -o as well)\n"
 
       << "\n"
+      << "Options:\n"
+      << " --offsets\n"
+      << "     Include module-relative offsets in output\n"
+
       << " -o OUTFILE or --output OUTFILE\n"
       << "     Send output to OUTFILE instead of <stdout>\n";
   return 1;
@@ -68,9 +72,9 @@ namespace wasm {
 enum class OutputMode { kWat, kHexDump };
 static constexpr char kHexChars[] = "0123456789abcdef";
 
-char* PrintHexBytesCore(char* ptr, uint32_t num_bytes, const byte* start) {
+char* PrintHexBytesCore(char* ptr, uint32_t num_bytes, const uint8_t* start) {
   for (uint32_t i = 0; i < num_bytes; i++) {
-    byte b = *(start + i);
+    uint8_t b = *(start + i);
     *(ptr++) = '0';
     *(ptr++) = 'x';
     *(ptr++) = kHexChars[b >> 4];
@@ -81,13 +85,6 @@ char* PrintHexBytesCore(char* ptr, uint32_t num_bytes, const byte* start) {
   return ptr;
 }
 
-// Computes the number of decimal digits required to print {value}.
-int GetNumDigits(uint32_t value) {
-  int digits = 1;
-  for (uint32_t compare = 10; value >= compare; compare *= 10) digits++;
-  return digits;
-}
-
 class InstructionStatistics {
  public:
   void Record(WasmOpcode opcode, uint32_t size) {
@@ -217,12 +214,10 @@ class ExtendedFunctionDis : public FunctionBodyDisassembler {
  public:
   ExtendedFunctionDis(Zone* zone, const WasmModule* module, uint32_t func_index,
                       WasmFeatures* detected, const FunctionSig* sig,
-                      const byte* start, const byte* end, uint32_t offset,
-                      NamesProvider* names)
+                      const uint8_t* start, const uint8_t* end, uint32_t offset,
+                      const ModuleWireBytes wire_bytes, NamesProvider* names)
       : FunctionBodyDisassembler(zone, module, func_index, detected, sig, start,
-                                 end, offset, names) {}
-
-  static constexpr uint32_t kWeDontCareAboutByteCodeOffsetsHere = 0;
+                                 end, offset, wire_bytes, names) {}
 
   void HexDump(MultiLineStringBuilder& out, FunctionHeader include_header) {
     out_ = &out;
@@ -233,37 +228,34 @@ class ExtendedFunctionDis : public FunctionBodyDisassembler {
       names_->PrintFunctionName(out, func_index_, NamesProvider::kDevTools);
       PrintSignatureOneLine(out, sig_, func_index_, names_, true,
                             NamesProvider::kIndexAsComment);
-      out.NextLine(kWeDontCareAboutByteCodeOffsetsHere);
+      out.NextLine(pc_offset());
     }
 
     // Decode and print locals.
-    uint32_t locals_length = DecodeLocals(pc_);
+    DecodeLocals(pc_);
     if (failed()) {
       // TODO(jkummerow): Better error handling.
       out << "Failed to decode locals";
       return;
     }
-    uint32_t total_length = 0;
     auto [entries, length] = read_u32v<ValidationTag>(pc_);
     PrintHexBytes(out, length, pc_, 4);
     out << " // " << entries << " entries in locals list";
-    out.NextLine(kWeDontCareAboutByteCodeOffsetsHere);
-    total_length += length;
+    pc_ += length;
+    out.NextLine(pc_offset());
     while (entries-- > 0) {
-      auto [count, count_length] = read_u32v<ValidationTag>(pc_ + total_length);
+      auto [count, count_length] = read_u32v<ValidationTag>(pc_);
       auto [type, type_length] =
           value_type_reader::read_value_type<ValidationTag>(
-              this, pc_ + total_length + count_length, WasmFeatures::All());
-      PrintHexBytes(out, count_length + type_length, pc_ + total_length, 4);
+              this, pc_ + count_length, WasmFeatures::All());
+      PrintHexBytes(out, count_length + type_length, pc_, 4);
       out << " // " << count << (count != 1 ? " locals" : " local")
           << " of type ";
       names_->PrintValueType(out, type);
-      out.NextLine(kWeDontCareAboutByteCodeOffsetsHere);
-      total_length += count_length + type_length;
+      pc_ += count_length + type_length;
+      out.NextLine(pc_offset());
     }
 
-    consume_bytes(locals_length);
-
     // Main loop.
     while (pc_ < end_) {
       WasmOpcode opcode = GetOpcode();
@@ -290,8 +282,8 @@ class ExtendedFunctionDis : public FunctionBodyDisassembler {
         label_stack_.emplace_back(out.line_number(), out.length(),
                                   label_occurrence_index_++);
       }
-      out.NextLine(kWeDontCareAboutByteCodeOffsetsHere);
       pc_ += length;
+      out.NextLine(pc_offset());
     }
 
     if (pc_ != end_) {
@@ -313,13 +305,13 @@ class ExtendedFunctionDis : public FunctionBodyDisassembler {
       PrintHexBytes(out, length, pc_, 4);
       out << " // " << WasmOpcodes::OpcodeName(opcode);
       out.write(immediates.start(), immediates.length());
-      out.NextLine(kWeDontCareAboutByteCodeOffsetsHere);
       pc_ += length;
+      out.NextLine(pc_offset());
     }
   }
 
-  void PrintHexBytes(StringBuilder& out, uint32_t num_bytes, const byte* start,
-                     uint32_t fill_to_minimum = 0) {
+  void PrintHexBytes(StringBuilder& out, uint32_t num_bytes,
+                     const uint8_t* start, uint32_t fill_to_minimum = 0) {
     constexpr int kCharsPerByte = 6;  // Length of "0xFF, ".
     uint32_t max = std::max(num_bytes, fill_to_minimum) * kCharsPerByte + 2;
     char* ptr = out.allocate(max);
@@ -414,7 +406,7 @@ class HexDumpModuleDis : public ITracer {
   }
 
   // Tracer hooks.
-  void Bytes(const byte* start, uint32_t count) override {
+  void Bytes(const uint8_t* start, uint32_t count) override {
     if (count > kMaxBytesPerLine) {
       DCHECK_EQ(queue_, nullptr);
       queue_ = start;
@@ -470,14 +462,14 @@ class HexDumpModuleDis : public ITracer {
         }
         out_ << " // ";
         out_.write(description_.start(), description_.length());
-        out_.NextLine(kDontCareAboutOffsets);
+        out_.NextLine(pc_offset(queue_));
       }
       while (queue_length_ > kMaxBytesPerLine) {
         out_ << "  ";
         PrintHexBytes(out_, kMaxBytesPerLine, queue_);
-        out_.NextLine(kDontCareAboutOffsets);
         queue_length_ -= kMaxBytesPerLine;
         queue_ += kMaxBytesPerLine;
+        out_.NextLine(pc_offset(queue_));
       }
       if (queue_length_ > 0) {
         out_ << "  ";
@@ -485,7 +477,7 @@ class HexDumpModuleDis : public ITracer {
       }
       if (line_bytes_ == 0) {
         if (queue_length_ > kPadBytes) {
-          out_.NextLine(kDontCareAboutOffsets);
+          out_.NextLine(pc_offset(queue_ + queue_length_));
           out_ << "                           // ";
         } else {
           for (uint32_t i = queue_length_; i < kPadBytes; i++) {
@@ -507,7 +499,7 @@ class HexDumpModuleDis : public ITracer {
         out_.write(description_.start(), description_.length());
       }
     }
-    out_.NextLine(kDontCareAboutOffsets);
+    out_.NextLine(pc_offset());
     line_bytes_ = 0;
     description_.rewind_to_start();
   }
@@ -558,10 +550,16 @@ class HexDumpModuleDis : public ITracer {
       NextLine();
     }
   }
+  void StringOffset(uint32_t offset) override {
+    if (!module_ || module_->stringref_literals.size() > 3) {
+      description_ << "string literal #" << next_string_index_++;
+      NextLine();
+    }
+  }
 
   // The following two hooks give us an opportunity to call the hex-dumping
   // function body disassembler for initializers and functions.
-  void InitializerExpression(const byte* start, const byte* end,
+  void InitializerExpression(const uint8_t* start, const uint8_t* end,
                              ValueType expected_type) override {
     WasmFeatures detected;
     auto sig = FixedSizeSignature<ValueType>::Returns(expected_type);
@@ -569,26 +567,27 @@ class HexDumpModuleDis : public ITracer {
     const WasmModule* module = module_;
     if (!module) module = decoder_->shared_module().get();
     ExtendedFunctionDis d(&zone_, module, 0, &detected, &sig, start, end,
-                          offset, names_);
+                          offset, wire_bytes_, names_);
     d.HexdumpConstantExpression(out_);
     total_bytes_ += static_cast<size_t>(end - start);
   }
 
-  void FunctionBody(const WasmFunction* func, const byte* start) override {
-    const byte* end = start + func->code.length();
+  void FunctionBody(const WasmFunction* func, const uint8_t* start) override {
+    const uint8_t* end = start + func->code.length();
     WasmFeatures detected;
-    uint32_t offset = static_cast<uint32_t>(start - decoder_->start());
+    DCHECK_EQ(start - wire_bytes_.start(), pc_offset());
+    uint32_t offset = pc_offset();
     const WasmModule* module = module_;
     if (!module) module = decoder_->shared_module().get();
     ExtendedFunctionDis d(&zone_, module, func->func_index, &detected,
-                          func->sig, start, end, offset, names_);
+                          func->sig, start, end, offset, wire_bytes_, names_);
     d.HexDump(out_, FunctionBodyDisassembler::kSkipHeader);
     total_bytes_ += func->code.length();
   }
 
   // We have to do extra work for the name section here, because the regular
   // decoder mostly just skips over it.
-  void NameSection(const byte* start, const byte* end,
+  void NameSection(const uint8_t* start, const uint8_t* end,
                    uint32_t offset) override {
     Decoder decoder(start, end, offset);
     while (decoder.ok() && decoder.more()) {
@@ -629,12 +628,11 @@ class HexDumpModuleDis : public ITracer {
   }
 
  private:
-  static constexpr uint32_t kDontCareAboutOffsets = 0;
   static constexpr uint32_t kMaxBytesPerLine = 8;
   static constexpr uint32_t kPadBytes = 4;
 
   void PrintHexBytes(StringBuilder& out, uint32_t num_bytes,
-                     const byte* start) {
+                     const uint8_t* start) {
     char* ptr = out.allocate(num_bytes * 6);
     PrintHexBytesCore(ptr, num_bytes, start);
   }
@@ -693,6 +691,12 @@ class HexDumpModuleDis : public ITracer {
         // clang-format on
     }
   }
+
+  uint32_t pc_offset() { return static_cast<uint32_t>(total_bytes_); }
+  uint32_t pc_offset(const uint8_t* pc) {
+    return static_cast<uint32_t>(pc - wire_bytes_.start());
+  }
+
   MultiLineStringBuilder& out_;
   const WasmModule* module_;
   NamesProvider* names_;
@@ -700,7 +704,7 @@ class HexDumpModuleDis : public ITracer {
   Zone zone_;
 
   StringBuilder description_;
-  const byte* queue_{nullptr};
+  const uint8_t* queue_{nullptr};
   uint32_t queue_length_{0};
   uint32_t line_bytes_{0};
   size_t total_bytes_{0};
@@ -713,6 +717,7 @@ class HexDumpModuleDis : public ITracer {
   uint32_t next_tag_index_{0};
   uint32_t next_segment_index_{0};
   uint32_t next_data_segment_index_{0};
+  uint32_t next_string_index_{0};
 };
 
 ////////////////////////////////////////////////////////////////////////////////
@@ -721,12 +726,12 @@ class FormatConverter {
  public:
   enum Status { kNotReady, kIoInitialized, kModuleReady };
 
-  explicit FormatConverter(const char* input, const char* output)
-      : output_(output), out_(output_.get()) {
+  explicit FormatConverter(const char* input, const char* output,
+                           bool print_offsets)
+      : output_(output), out_(output_.get()), print_offsets_(print_offsets) {
     if (!output_.ok()) return;
     if (!LoadFile(input)) return;
-    base::Vector<const byte> wire_bytes(raw_bytes_.data(), raw_bytes_.size());
-    wire_bytes_ = ModuleWireBytes({raw_bytes_.data(), raw_bytes_.size()});
+    wire_bytes_ = ModuleWireBytes(raw_bytes());
     status_ = kIoInitialized;
     ModuleResult result = DecodeWasmModuleForDisassembler(raw_bytes());
     if (result.failed()) {
@@ -738,7 +743,7 @@ class FormatConverter {
     status_ = kModuleReady;
     module_ = result.value();
     names_provider_ =
-        std::make_unique<NamesProvider>(module_.get(), wire_bytes);
+        std::make_unique<NamesProvider>(module_.get(), raw_bytes());
   }
 
   Status status() const { return status_; }
@@ -857,10 +862,10 @@ class FormatConverter {
          i < module()->functions.size(); i++) {
       const WasmFunction* func = &module()->functions[i];
       WasmFeatures detected;
-      base::Vector<const byte> code = wire_bytes_.GetFunctionBytes(func);
+      base::Vector<const uint8_t> code = wire_bytes_.GetFunctionBytes(func);
       ExtendedFunctionDis d(&zone, module(), i, &detected, func->sig,
                             code.begin(), code.end(), func->code.offset(),
-                            names());
+                            wire_bytes_, names());
       d.CollectInstructionStats(stats);
       stats.RecordCodeSize(code.size());
     }
@@ -881,11 +886,12 @@ class FormatConverter {
     const WasmFunction* func = &module()->functions[func_index];
     Zone zone(&allocator_, "disassembler");
     WasmFeatures detected;
-    base::Vector<const byte> code = wire_bytes_.GetFunctionBytes(func);
+    base::Vector<const uint8_t> code = wire_bytes_.GetFunctionBytes(func);
 
     ExtendedFunctionDis d(&zone, module(), func_index, &detected, func->sig,
                           code.begin(), code.end(), func->code.offset(),
-                          names());
+                          wire_bytes_, names());
+    sb.set_current_line_bytecode_offset(func->code.offset());
     if (mode == OutputMode::kWat) {
       d.DecodeAsWat(sb, {0, 1});
     } else if (mode == OutputMode::kHexDump) {
@@ -894,22 +900,24 @@ class FormatConverter {
 
     // Print any types that were used by the function.
     sb.NextLine(0);
-    ModuleDisassembler md(sb, module(), names(), wire_bytes_, &allocator_);
+    ModuleDisassembler md(sb, module(), names(), wire_bytes_, &allocator_,
+                          print_offsets_);
     for (uint32_t type_index : d.used_types()) {
       md.PrintTypeDefinition(type_index, {0, 1},
                              NamesProvider::kIndexAsComment);
     }
-    sb.WriteTo(out_);
+    sb.WriteTo(out_, print_offsets_);
   }
 
   void WatForModule() {
     DCHECK_EQ(status_, kModuleReady);
     MultiLineStringBuilder sb;
-    ModuleDisassembler md(sb, module(), names(), wire_bytes_, &allocator_);
+    ModuleDisassembler md(sb, module(), names(), wire_bytes_, &allocator_,
+                          print_offsets_);
     // 100 GB is an approximation of "unlimited".
     size_t max_mb = 100'000;
     md.PrintModule({0, 2}, max_mb);
-    sb.WriteTo(out_);
+    sb.WriteTo(out_, print_offsets_);
   }
 
   void HexdumpForModule() {
@@ -919,7 +927,7 @@ class FormatConverter {
     MultiLineStringBuilder sb;
     HexDumpModuleDis md(sb, module(), names(), wire_bytes_, &allocator_);
     md.PrintModule();
-    sb.WriteTo(out_);
+    sb.WriteTo(out_, print_offsets_);
   }
 
  private:
@@ -977,7 +985,8 @@ class FormatConverter {
     input.putback(c0);
     if (c0 == 0 && c1 == 'a' && c2 == 's' && c3 == 'm') {
       // Wasm binary module.
-      raw_bytes_ = std::vector<byte>(std::istreambuf_iterator<char>(input), {});
+      raw_bytes_ =
+          std::vector<uint8_t>(std::istreambuf_iterator<char>(input), {});
       return true;
     }
     if (TryParseLiteral(input, raw_bytes_)) return true;
@@ -995,7 +1004,8 @@ class FormatConverter {
   //   braces is ignored.
   // - Whitespace, line comments, and block comments are ignored.
   // So in particular, this can consume what --full-hexdump produces.
-  bool TryParseLiteral(std::istream& input, std::vector<byte>& output_bytes) {
+  bool TryParseLiteral(std::istream& input,
+                       std::vector<uint8_t>& output_bytes) {
     int c = input.get();
     // Skip anything before the first opening '['.
     while (c != '[' && c != EOF) c = input.get();
@@ -1048,14 +1058,14 @@ class FormatConverter {
       DCHECK(state == kDecimal || state == kHex || state == kAfterValue);
       if (c == ',') {
         DCHECK_LT(value, 256);
-        output_bytes.push_back(static_cast<byte>(value));
+        output_bytes.push_back(static_cast<uint8_t>(value));
         state = kBeforeValue;
         value = 0;
         continue;
       }
       if (c == ']') {
         DCHECK_LT(value, 256);
-        output_bytes.push_back(static_cast<byte>(value));
+        output_bytes.push_back(static_cast<uint8_t>(value));
         return true;
       }
       if (state == kAfterValue) {
@@ -1092,6 +1102,7 @@ class FormatConverter {
   Output output_;
   std::ostream& out_;
   Status status_{kNotReady};
+  bool print_offsets_;
   std::vector<uint8_t> raw_bytes_;
   ModuleWireBytes wire_bytes_{{}};
   std::shared_ptr<WasmModule> module_;
@@ -1101,7 +1112,8 @@ class FormatConverter {
 DumpingModuleDecoder::DumpingModuleDecoder(ModuleWireBytes wire_bytes,
                                            HexDumpModuleDis* module_dis)
     : ModuleDecoderImpl(WasmFeatures::All(), wire_bytes.module_bytes(),
-                        kWasmOrigin, module_dis) {}
+                        kWasmOrigin, kDoNotPopulateExplicitRecGroups,
+                        module_dis) {}
 
 }  // namespace wasm
 }  // namespace internal
@@ -1130,6 +1142,7 @@ struct Options {
   const char* output = nullptr;
   Action action = Action::kUnset;
   int func_index = -1;
+  bool offsets = false;
 };
 
 bool ParseInt(char* s, int* out) {
@@ -1189,6 +1202,8 @@ int ParseOptions(int argc, char** argv, Options* options) {
       options->output = argv[++i];
     } else if (strncmp(argv[i], "--output=", 9) == 0) {
       options->output = argv[i] + 9;
+    } else if (strcmp(argv[i], "--offsets") == 0) {
+      options->offsets = true;
     } else if (options->input != nullptr) {
       return PrintHelp(argv);
     } else {
@@ -1237,7 +1252,7 @@ int main(int argc, char** argv) {
   v8::V8::InitializePlatform(platform.get());
   v8::V8::Initialize();
 
-  FormatConverter fc(options.input, options.output);
+  FormatConverter fc(options.input, options.output, options.offsets);
   if (fc.status() == FormatConverter::kNotReady) return 1;
   // Allow hex dumping invalid modules.
   if (fc.status() != FormatConverter::kModuleReady &&
diff --git a/deps/v8/tools/wasm/update-wasm-spec-tests.sh b/deps/v8/tools/wasm/update-wasm-spec-tests.sh
index 9a5258713ea652..5eb3e6defd6240 100755
--- a/deps/v8/tools/wasm/update-wasm-spec-tests.sh
+++ b/deps/v8/tools/wasm/update-wasm-spec-tests.sh
@@ -58,7 +58,7 @@ log_and_run cd spec/interpreter
 
 # The next step requires that ocaml is installed. See the README.md in
 # https://github.com/WebAssembly/spec/tree/master/interpreter/.
-log_and_run make clean opt
+log_and_run make distclean wasm
 
 log_and_run cd ${TMP_DIR}/spec/test/core
 log_and_run cp *.wast ${SPEC_TEST_DIR}/tests/
@@ -94,7 +94,7 @@ done
 # Generate the proposal tests.
 ###############################################################################
 
-repos='js-types tail-call memory64 extended-const'
+repos='js-types tail-call memory64 extended-const multi-memory function-references gc'
 
 for repo in ${repos}; do
   echo "Process ${repo}"
diff --git a/deps/v8/tools/whitespace.txt b/deps/v8/tools/whitespace.txt
index a7c5d57c465fe0..9e537972f986ae 100644
--- a/deps/v8/tools/whitespace.txt
+++ b/deps/v8/tools/whitespace.txt
@@ -6,7 +6,7 @@ A Smi balks into a war and says:
 "I'm so deoptimized today!"
 The doubles heard this and started to unbox.
 The Smi looked at them when a crazy v8-autoroll account showed up...
-The autoroller bought a round of Himbeerbrause. Suddenly.........
+The autoroller bought a round of Himbeerbrause. Suddenly.............
 The bartender starts to shake the bottles.............................
 I can't add trailing whitespaces, so I'm adding this line............
 I'm starting to think that just adding trailing whitespaces might not be bad.
@@ -17,5 +17,3 @@ Today's answer to life the universe and everything is 6728!
 Today's answer to life the universe and everything is 6728!!
 Off-course, this is wrong ...
 ..
-What's a fish without eyes? A fsh!
-
diff --git a/deps/zlib/CMakeLists.txt b/deps/zlib/CMakeLists.txt
index 471a3a46a09dd6..234eab8db41def 100644
--- a/deps/zlib/CMakeLists.txt
+++ b/deps/zlib/CMakeLists.txt
@@ -24,6 +24,7 @@ check_include_file(stddef.h    HAVE_STDDEF_H)
 option(ENABLE_SIMD_OPTIMIZATIONS "Enable all SIMD optimizations" OFF)
 option(ENABLE_SIMD_AVX512 "Enable SIMD AXV512 optimizations" OFF)
 option(USE_ZLIB_RABIN_KARP_HASH "Enable bitstream compatibility with canonical zlib" OFF)
+option(BUILD_UNITTESTS "Enable standalone unit tests build" OFF)
 
 if (USE_ZLIB_RABIN_KARP_HASH)
    add_definitions(-DUSE_ZLIB_RABIN_KARP_ROLLING_HASH)
@@ -244,6 +245,58 @@ set(CMAKE_CXX_STANDARD 14) # workaround for older compilers (e.g. g++ 5.4).
 add_executable(zlib_bench contrib/bench/zlib_bench.cc)
 target_link_libraries(zlib_bench zlib)
 
+#============================================================================
+# Unit Tests
+#============================================================================
+if (BUILD_UNITTESTS)
+    include (ExternalProject)
+    set_directory_properties(PROPERTIES EP_PREFIX ${CMAKE_BINARY_DIR}/third_party)
+    ExternalProject_add(
+        googletest
+        GIT_REPOSITORY https://github.com/google/googletest.git
+        GIT_TAG d1467f5813f4d363cfd11aba99c4e9fe47a85e99
+        UPDATE_COMMAND ""
+        INSTALL_COMMAND ""
+        LOG_DOWNLOAD ON
+        LOG_CONFIGURE ON
+        LOG_BUILD ON
+    )
+
+    # gtest includedir
+    ExternalProject_Get_Property(googletest source_dir)
+    set(GTEST_INCLUDE_DIRS
+        ${source_dir}/googletest/include
+        ${source_dir}/googletest/include/gtest
+    )
+
+    # gtest library
+    ExternalProject_Get_Property(googletest binary_dir)
+    set(GTEST_LIBRARY_PATH ${binary_dir}/lib/${CMAKE_FIND_LIBRARY_PREFIXES}gtest.a)
+    set(GTEST_LIBRARY gtest)
+    add_library(${GTEST_LIBRARY} UNKNOWN IMPORTED)
+    set_property(TARGET ${GTEST_LIBRARY} PROPERTY IMPORTED_LOCATION ${GTEST_LIBRARY_PATH})
+    add_dependencies(${GTEST_LIBRARY} googletest)
+
+    set(UTEST_SRC
+        ${CMAKE_CURRENT_SOURCE_DIR}/contrib/tests/infcover.cc
+        ${CMAKE_CURRENT_SOURCE_DIR}/contrib/tests/infcover.h
+        ${CMAKE_CURRENT_SOURCE_DIR}/contrib/tests/utils_unittest.cc
+        ${CMAKE_CURRENT_SOURCE_DIR}/contrib/tests/standalone_test_runner.cc
+        ${CMAKE_CURRENT_SOURCE_DIR}/google/compression_utils_portable.cc
+    )
+
+    add_compile_definitions(CMAKE_STANDALONE_UNITTESTS)
+
+    add_executable(zlib_unittests ${UTEST_SRC})
+    target_include_directories(zlib_unittests PUBLIC ${GTEST_INCLUDE_DIRS})
+    target_include_directories(zlib_unittests PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/google)
+
+    target_link_libraries(zlib_unittests ${GTEST_LIBRARY})
+    target_link_libraries(zlib_unittests zlib)
+    # Needed by gtest
+    target_link_libraries(zlib_unittests pthread)
+endif()
+
 #============================================================================
 # Minigzip tool
 #============================================================================
diff --git a/deps/zlib/README.chromium b/deps/zlib/README.chromium
index 663ee0521ed30c..1dfb99666423ea 100644
--- a/deps/zlib/README.chromium
+++ b/deps/zlib/README.chromium
@@ -5,7 +5,7 @@ Version: 1.2.13
 CPEPrefix: cpe:/a:zlib:zlib:1.2.13
 Security Critical: yes
 Shipped: yes
-License: Custom license
+License: Zlib
 License File: LICENSE
 License Android Compatible: yes
 
diff --git a/deps/zlib/contrib/optimizations/inflate.c b/deps/zlib/contrib/optimizations/inflate.c
index 6ed87160f5350d..2a8e0ef76db6ba 100644
--- a/deps/zlib/contrib/optimizations/inflate.c
+++ b/deps/zlib/contrib/optimizations/inflate.c
@@ -1488,8 +1488,9 @@ int ZEXPORT inflateCopy(z_streamp dest, z_streamp source) {
     if (copy == Z_NULL) return Z_MEM_ERROR;
     window = Z_NULL;
     if (state->window != Z_NULL) {
-        window = (unsigned char FAR *)
-                 ZALLOC(source, 1U << state->wbits, sizeof(unsigned char));
+        window = (unsigned char FAR *)ZALLOC(
+            source, (1U << state->wbits) + CHUNKCOPY_CHUNK_SIZE,
+            sizeof(unsigned char));
         if (window == Z_NULL) {
             ZFREE(source, copy);
             return Z_MEM_ERROR;
diff --git a/deps/zlib/contrib/optimizations/insert_string.h b/deps/zlib/contrib/optimizations/insert_string.h
index c6a296aef7390e..260b8268029a8c 100644
--- a/deps/zlib/contrib/optimizations/insert_string.h
+++ b/deps/zlib/contrib/optimizations/insert_string.h
@@ -16,64 +16,7 @@
 #endif
 #endif
 
-#include "cpu_features.h"
-
-// clang-format off
-#if defined(CRC32_SIMD_SSE42_PCLMUL)
-  #include <smmintrin.h>  /* Required to make MSVC bot build pass. */
-
-  #if defined(__clang__) || defined(__GNUC__)
-    #define TARGET_CPU_WITH_CRC __attribute__((target("sse4.2")))
-  #else
-    #define TARGET_CPU_WITH_CRC
-  #endif
-
-  /* CRC32C uint32_t */
-  #define _cpu_crc32c_hash_u32 _mm_crc32_u32
-
-#elif defined(CRC32_ARMV8_CRC32)
-  #if defined(__clang__)
-    #define __crc32cw __builtin_arm_crc32cw
-  #elif defined(__GNUC__)
-    #define __crc32cw __builtin_aarch64_crc32cw
-  #endif
-
-  #if defined(__aarch64__) && defined(__clang__)
-    #define TARGET_CPU_WITH_CRC __attribute__((target("crc")))
-  #elif defined(__aarch64__) && defined(__GNUC__)
-    #define TARGET_CPU_WITH_CRC __attribute__((target("+crc")))
-  #elif defined(__clang__) // !defined(__aarch64__)
-    #define TARGET_CPU_WITH_CRC __attribute__((target("armv8-a,crc")))
-  #endif  // defined(__aarch64__)
-
-  /* CRC32C uint32_t */
-  #define _cpu_crc32c_hash_u32 __crc32cw
-
-#endif
-// clang-format on
-
-#if defined(TARGET_CPU_WITH_CRC)
-
-TARGET_CPU_WITH_CRC
-local INLINE Pos insert_string_simd(deflate_state* const s, const Pos str) {
-  Pos ret;
-  unsigned val, h = 0;
-
-  zmemcpy(&val, &s->window[str], sizeof(val));
-
-  if (s->level >= 6)
-    val &= 0xFFFFFF;
-
-  /* Compute hash from the CRC32C of |val|. */
-  h = _cpu_crc32c_hash_u32(h, val);
-
-  ret = s->head[h & s->hash_mask];
-  s->head[h & s->hash_mask] = str;
-  s->prev[str & s->w_mask] = ret;
-  return ret;
-}
-
-#endif // TARGET_CPU_WITH_CRC
+#include <stdint.h>
 
 /**
  * Some applications need to match zlib DEFLATE output exactly [3]. Use the
@@ -107,10 +50,23 @@ local INLINE Pos insert_string_simd(deflate_state* const s, const Pos str) {
  *    characters and the first MIN_MATCH bytes of str are valid (except for
  *    the last MIN_MATCH-1 bytes of the input file).
  */
-local INLINE Pos insert_string_c(deflate_state* const s, const Pos str) {
+local INLINE Pos insert_string(deflate_state* const s, const Pos str) {
   Pos ret;
-
+/* insert_string dictionary insertion: ANZAC++ hasher
+ * significantly improves data compression speed.
+ *
+ * Note: the generated compressed output is a valid DEFLATE stream, but will
+ * differ from canonical zlib output.
+ */
+#if defined(USE_ZLIB_RABIN_KARP_ROLLING_HASH)
   UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH - 1)]);
+#else
+  uint32_t value;
+  // Validated for little endian archs (i.e. x86, Arm). YMMV for big endian.
+  zmemcpy(&value, &s->window[str], sizeof(value));
+  s->ins_h = ((value * 66521 + 66521) >> 16) & s->hash_mask;
+#endif
+
 #ifdef FASTEST
   ret = s->head[s->ins_h];
 #else
@@ -121,25 +77,4 @@ local INLINE Pos insert_string_c(deflate_state* const s, const Pos str) {
   return ret;
 }
 
-local INLINE Pos insert_string(deflate_state* const s, const Pos str) {
-/* insert_string_simd string dictionary insertion: SIMD crc32c symbol hasher
- * significantly improves data compression speed.
- *
- * Note: the generated compressed output is a valid DEFLATE stream, but will
- * differ from canonical zlib output.
- */
-#if defined(USE_ZLIB_RABIN_KARP_ROLLING_HASH)
-/* So this build-time option can be used to disable the crc32c hash, and use
- * the Rabin-Karp hash instead.
- */ /* FALLTHROUGH Rabin-Karp */
-#elif defined(TARGET_CPU_WITH_CRC) && defined(CRC32_SIMD_SSE42_PCLMUL)
-  if (x86_cpu_enable_simd)
-    return insert_string_simd(s, str);
-#elif defined(TARGET_CPU_WITH_CRC) && defined(CRC32_ARMV8_CRC32)
-  if (arm_cpu_enable_crc32)
-    return insert_string_simd(s, str);
-#endif
-  return insert_string_c(s, str); /* Rabin-Karp */
-}
-
 #endif /* INSERT_STRING_H */
diff --git a/deps/zlib/contrib/tests/standalone_test_runner.cc b/deps/zlib/contrib/tests/standalone_test_runner.cc
new file mode 100644
index 00000000000000..1ec9c30bacba02
--- /dev/null
+++ b/deps/zlib/contrib/tests/standalone_test_runner.cc
@@ -0,0 +1,9 @@
+// Copyright 2023 The Chromium Authors
+// Use of this source code is governed by a BSD-style license that can be
+// found in the Chromium source repository LICENSE file.
+#include <gtest/gtest.h>
+
+int main(int argc, char** argv) {
+  ::testing::InitGoogleTest(&argc, argv);
+  return RUN_ALL_TESTS();
+}
diff --git a/deps/zlib/contrib/tests/utils_unittest.cc b/deps/zlib/contrib/tests/utils_unittest.cc
index 7270d0af90855f..d06dbc9812ad92 100644
--- a/deps/zlib/contrib/tests/utils_unittest.cc
+++ b/deps/zlib/contrib/tests/utils_unittest.cc
@@ -7,12 +7,17 @@
 #include <cstddef>
 #include <vector>
 
-#include "base/files/file_path.h"
-#include "base/files/scoped_temp_dir.h"
 #include "compression_utils_portable.h"
 #include "gtest.h"
+
+#if !defined(CMAKE_STANDALONE_UNITTESTS)
+#include "base/files/file_path.h"
+#include "base/files/scoped_temp_dir.h"
+
 #include "third_party/zlib/contrib/minizip/unzip.h"
 #include "third_party/zlib/contrib/minizip/zip.h"
+#endif
+
 #include "zlib.h"
 
 void TestPayloads(size_t input_size, zlib_internal::WrapperType type) {
@@ -1020,6 +1025,9 @@ TEST(ZlibTest, DeflateZFixedCorruption) {
       0);
 }
 
+// TODO(gustavoa): make these tests run standalone.
+#ifndef CMAKE_STANDALONE_UNITTESTS
+
 TEST(ZlibTest, ZipFilenameCommentSize) {
   // Check that minizip rejects zip member filenames or comments longer than
   // the zip format can represent.
@@ -1138,3 +1146,5 @@ TEST(ZlibTest, ZipExtraFieldSize) {
   EXPECT_EQ(unzGoToNextFile(uzf), UNZ_END_OF_LIST_OF_FILE);
   EXPECT_EQ(unzClose(uzf), UNZ_OK);
 }
+
+#endif
diff --git a/deps/zlib/deflate.c b/deps/zlib/deflate.c
index 1fa55e5d010618..173ce596be582e 100644
--- a/deps/zlib/deflate.c
+++ b/deps/zlib/deflate.c
@@ -457,15 +457,9 @@ int ZEXPORT deflateInit2_(z_streamp strm, int level, int method,
     s->w_size = 1 << s->w_bits;
     s->w_mask = s->w_size - 1;
 
+    s->chromium_zlib_hash = 1;
+#if defined(USE_ZLIB_RABIN_KARP_ROLLING_HASH)
     s->chromium_zlib_hash = 0;
-#if !defined(USE_ZLIB_RABIN_KARP_ROLLING_HASH)
-  #if defined(TARGET_CPU_WITH_CRC) && defined(CRC32_SIMD_SSE42_PCLMUL)
-    if (x86_cpu_enable_simd)
-      s->chromium_zlib_hash = 1;
-  #elif defined(TARGET_CPU_WITH_CRC) && defined(CRC32_ARMV8_CRC32)
-    if (arm_cpu_enable_crc32)
-      s->chromium_zlib_hash = 1;
-  #endif
 #endif
 
     s->hash_bits = memLevel + 7;
diff --git a/deps/zlib/google/DEPS b/deps/zlib/google/DEPS
index 03f2cb950b9517..7ec5343ee23953 100644
--- a/deps/zlib/google/DEPS
+++ b/deps/zlib/google/DEPS
@@ -2,5 +2,6 @@ include_rules = [
   '+base',
   '+build',
   '+testing',
-  "+third_party/zlib/zlib.h",
+  '+third_party/icu/source/i18n/unicode',
+  '+third_party/zlib/zlib.h',
 ]
diff --git a/deps/zlib/google/zip_internal.cc b/deps/zlib/google/zip_internal.cc
index 9b20b421e24765..b9976d63ee301b 100644
--- a/deps/zlib/google/zip_internal.cc
+++ b/deps/zlib/google/zip_internal.cc
@@ -260,12 +260,13 @@ zip_fileinfo TimeToZipFileInfo(const base::Time& file_time) {
     // It assumes that dates below 1980 are in the double digit format.
     // Hence the fail safe option is to leave the date unset. Some programs
     // might show the unset date as 1980-0-0 which is invalid.
-    zip_info.tmz_date.tm_year = file_time_parts.year;
-    zip_info.tmz_date.tm_mon = file_time_parts.month - 1;
-    zip_info.tmz_date.tm_mday = file_time_parts.day_of_month;
-    zip_info.tmz_date.tm_hour = file_time_parts.hour;
-    zip_info.tmz_date.tm_min = file_time_parts.minute;
-    zip_info.tmz_date.tm_sec = file_time_parts.second;
+    zip_info.tmz_date = {
+        .tm_sec = static_cast<uInt>(file_time_parts.second),
+        .tm_min = static_cast<uInt>(file_time_parts.minute),
+        .tm_hour = static_cast<uInt>(file_time_parts.hour),
+        .tm_mday = static_cast<uInt>(file_time_parts.day_of_month),
+        .tm_mon = static_cast<uInt>(file_time_parts.month - 1),
+        .tm_year = static_cast<uInt>(file_time_parts.year)};
   }
 
   return zip_info;
diff --git a/deps/zlib/google/zip_reader.cc b/deps/zlib/google/zip_reader.cc
index 9b1030a029c8a4..34a815e5f52e9f 100644
--- a/deps/zlib/google/zip_reader.cc
+++ b/deps/zlib/google/zip_reader.cc
@@ -246,14 +246,14 @@ bool ZipReader::OpenEntry() {
 
   // Construct the last modified time. The timezone info is not present in ZIP
   // archives, so we construct the time as UTC.
-  base::Time::Exploded exploded_time = {};
-  exploded_time.year = info.tmu_date.tm_year;
-  exploded_time.month = info.tmu_date.tm_mon + 1;  // 0-based vs 1-based
-  exploded_time.day_of_month = info.tmu_date.tm_mday;
-  exploded_time.hour = info.tmu_date.tm_hour;
-  exploded_time.minute = info.tmu_date.tm_min;
-  exploded_time.second = info.tmu_date.tm_sec;
-  exploded_time.millisecond = 0;
+  const base::Time::Exploded exploded_time = {
+      .year = static_cast<int>(info.tmu_date.tm_year),
+      .month =
+          static_cast<int>(info.tmu_date.tm_mon + 1),  // 0-based vs 1-based
+      .day_of_month = static_cast<int>(info.tmu_date.tm_mday),
+      .hour = static_cast<int>(info.tmu_date.tm_hour),
+      .minute = static_cast<int>(info.tmu_date.tm_min),
+      .second = static_cast<int>(info.tmu_date.tm_sec)};
 
   if (!base::Time::FromUTCExploded(exploded_time, &entry_.last_modified))
     entry_.last_modified = base::Time::UnixEpoch();
diff --git a/deps/zlib/google/zip_reader_unittest.cc b/deps/zlib/google/zip_reader_unittest.cc
index b9175045d07268..6086c97c49b622 100644
--- a/deps/zlib/google/zip_reader_unittest.cc
+++ b/deps/zlib/google/zip_reader_unittest.cc
@@ -19,6 +19,7 @@
 #include "base/files/scoped_temp_dir.h"
 #include "base/functional/bind.h"
 #include "base/hash/md5.h"
+#include "base/i18n/time_formatting.h"
 #include "base/path_service.h"
 #include "base/run_loop.h"
 #include "base/strings/string_piece.h"
@@ -31,6 +32,7 @@
 #include "testing/gmock/include/gmock/gmock.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "testing/platform_test.h"
+#include "third_party/icu/source/i18n/unicode/timezone.h"
 #include "third_party/zlib/google/zip_internal.h"
 
 using ::testing::_;
@@ -288,18 +290,10 @@ TEST_F(ZipReaderTest, RegularFile) {
 
   EXPECT_EQ(target_path, entry->path);
   EXPECT_EQ(13527, entry->original_size);
-
-  // The expected time stamp: 2009-05-29 06:22:20
-  base::Time::Exploded exploded = {};  // Zero-clear.
-  entry->last_modified.UTCExplode(&exploded);
-  EXPECT_EQ(2009, exploded.year);
-  EXPECT_EQ(5, exploded.month);
-  EXPECT_EQ(29, exploded.day_of_month);
-  EXPECT_EQ(6, exploded.hour);
-  EXPECT_EQ(22, exploded.minute);
-  EXPECT_EQ(20, exploded.second);
-  EXPECT_EQ(0, exploded.millisecond);
-
+  EXPECT_EQ("2009-05-29 06:22:20.000",
+            base::UnlocalizedTimeFormatWithPattern(entry->last_modified,
+                                                   "y-MM-dd HH:mm:ss.SSS",
+                                                   icu::TimeZone::getGMT()));
   EXPECT_FALSE(entry->is_unsafe);
   EXPECT_FALSE(entry->is_directory);
 }
@@ -396,18 +390,10 @@ TEST_F(ZipReaderTest, Directory) {
   EXPECT_EQ(target_path, entry->path);
   // The directory size should be zero.
   EXPECT_EQ(0, entry->original_size);
-
-  // The expected time stamp: 2009-05-31 15:49:52
-  base::Time::Exploded exploded = {};  // Zero-clear.
-  entry->last_modified.UTCExplode(&exploded);
-  EXPECT_EQ(2009, exploded.year);
-  EXPECT_EQ(5, exploded.month);
-  EXPECT_EQ(31, exploded.day_of_month);
-  EXPECT_EQ(15, exploded.hour);
-  EXPECT_EQ(49, exploded.minute);
-  EXPECT_EQ(52, exploded.second);
-  EXPECT_EQ(0, exploded.millisecond);
-
+  EXPECT_EQ("2009-05-31 15:49:52.000",
+            base::UnlocalizedTimeFormatWithPattern(entry->last_modified,
+                                                   "y-MM-dd HH:mm:ss.SSS",
+                                                   icu::TimeZone::getGMT()));
   EXPECT_FALSE(entry->is_unsafe);
   EXPECT_TRUE(entry->is_directory);
 }
diff --git a/doc/abi_version_registry.json b/doc/abi_version_registry.json
index 2208ef07d148a2..c5fd7d2fd2a3ee 100644
--- a/doc/abi_version_registry.json
+++ b/doc/abi_version_registry.json
@@ -1,5 +1,7 @@
 {
   "NODE_MODULE_VERSION": [
+    { "modules": 120,"runtime": "node",     "variant": "v8_11.8",              "versions": "21.0.0" },
+    { "modules": 119,"runtime": "electron", "variant": "electron",             "versions": "28" },
     { "modules": 118,"runtime": "electron", "variant": "electron",             "versions": "27" },
     { "modules": 117,"runtime": "electron", "variant": "electron",             "versions": "26" },
     { "modules": 116,"runtime": "electron", "variant": "electron",             "versions": "25" },
diff --git a/doc/api/child_process.md b/doc/api/child_process.md
index f33fc8b18ded3e..58fbed1c0daf8e 100644
--- a/doc/api/child_process.md
+++ b/doc/api/child_process.md
@@ -1405,7 +1405,9 @@ setTimeout(() => {
 ### `subprocess[Symbol.dispose]()`
 
 <!-- YAML
-added: v20.5.0
+added:
+ - v20.5.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
diff --git a/doc/api/cli.md b/doc/api/cli.md
index a75df28252ce01..bde6e2f46ffdcb 100644
--- a/doc/api/cli.md
+++ b/doc/api/cli.md
@@ -25,14 +25,16 @@ For more info about `node inspect`, see the [debugger][] documentation.
 
 The program entry point is a specifier-like string. If the string is not an
 absolute path, it's resolved as a relative path from the current working
-directory. That path is then resolved by [CommonJS][] module loader. If no
-corresponding file is found, an error is thrown.
+directory. That path is then resolved by [CommonJS][] module loader, or by the
+[ES module loader][Modules loaders] if [`--experimental-default-type=module`][]
+is passed. If no corresponding file is found, an error is thrown.
 
 If a file is found, its path will be passed to the
 [ES module loader][Modules loaders] under any of the following conditions:
 
 * The program was started with a command-line flag that forces the entry
-  point to be loaded with ECMAScript module loader.
+  point to be loaded with ECMAScript module loader, such as `--import` or
+  [`--experimental-default-type=module`][].
 * The file has an `.mjs` extension.
 * The file does not have a `.cjs` extension, and the nearest parent
   `package.json` file contains a top-level [`"type"`][] field with a value of
@@ -45,8 +47,9 @@ Otherwise, the file is loaded using the CommonJS module loader. See
 
 When loading, the [ES module loader][Modules loaders] loads the program
 entry point, the `node` command will accept as input only files with `.js`,
-`.mjs`, or `.cjs` extensions; and with `.wasm` extensions when
-[`--experimental-wasm-modules`][] is enabled.
+`.mjs`, or `.cjs` extensions; with `.wasm` extensions when
+[`--experimental-wasm-modules`][] is enabled; and with no extension when
+[`--experimental-default-type=module`][] is passed.
 
 ## Options
 
@@ -106,7 +109,7 @@ If this flag is passed, the behavior can still be set to not abort through
 added: v20.0.0
 -->
 
-> Stability: 1 - Experimental
+> Stability: 1.1 - Active development
 
 When using the [Permission Model][], the process will not be able to spawn any
 child process by default.
@@ -146,12 +149,12 @@ Error: Access to this API has been restricted
 <!-- YAML
 added: v20.0.0
 changes:
-  - version: REPLACEME
+  - version: v20.7.0
     pr-url: https://github.com/nodejs/node/pull/49047
     description: Paths delimited by comma (`,`) are no longer allowed.
 -->
 
-> Stability: 1 - Experimental
+> Stability: 1.1 - Active development
 
 This flag configures file system read permissions using
 the [Permission Model][].
@@ -200,12 +203,12 @@ node --experimental-permission --allow-fs-read=/path/to/index.js index.js
 <!-- YAML
 added: v20.0.0
 changes:
-  - version: REPLACEME
+  - version: v20.7.0
     pr-url: https://github.com/nodejs/node/pull/49047
     description: Paths delimited by comma (`,`) are no longer allowed.
 -->
 
-> Stability: 1 - Experimental
+> Stability: 1.1 - Active development
 
 This flag configures file system write permissions using
 the [Permission Model][].
@@ -229,7 +232,7 @@ Relative paths are NOT supported through the CLI flag.
 added: v20.0.0
 -->
 
-> Stability: 1 - Experimental
+> Stability: 1.1 - Active development
 
 When using the [Permission Model][], the process will not be able to create any
 worker threads by default.
@@ -320,6 +323,20 @@ Currently the support for run-time snapshot is experimental in that:
    a report in the [Node.js issue tracker][] and link to it in the
    [tracking issue for user-land snapshots][].
 
+### `-c`, `--check`
+
+<!-- YAML
+added:
+  - v5.0.0
+  - v4.2.0
+changes:
+  - version: v10.0.0
+    pr-url: https://github.com/nodejs/node/pull/19600
+    description: The `--require` option is now supported when checking a file.
+-->
+
+Syntax check the script without executing.
+
 ### `--completion-bash`
 
 <!-- YAML
@@ -478,20 +495,14 @@ added: v6.0.0
 Enable FIPS-compliant crypto at startup. (Requires Node.js to be built
 against FIPS-compatible OpenSSL.)
 
-### `--no-network-family-autoselection`
+### `--enable-network-family-autoselection`
 
 <!-- YAML
-added: v19.4.0
-changes:
-  - version: v20.0.0
-    pr-url: https://github.com/nodejs/node/pull/46790
-    description: The flag was renamed from `--no-enable-network-family-autoselection`
-                 to `--no-network-family-autoselection`. The old name can still work as
-                 an alias.
+added: v18.18.0
 -->
 
-Disables the family autoselection algorithm unless connection options explicitly
-enables it.
+Enables the family autoselection algorithm unless connection options explicitly
+disables it.
 
 ### `--enable-source-maps`
 
@@ -520,6 +531,95 @@ when `Error.stack` is accessed. If you access `Error.stack` frequently
 in your application, take into account the performance implications
 of `--enable-source-maps`.
 
+### `--env-file=config`
+
+> Stability: 1.1 - Active development
+
+<!-- YAML
+added: v20.6.0
+-->
+
+Loads environment variables from a file relative to the current directory,
+making them available to applications on `process.env`. The [environment
+variables which configure Node.js][environment_variables], such as `NODE_OPTIONS`,
+are parsed and applied. If the same variable is defined in the environment and
+in the file, the value from the environment takes precedence.
+
+You can pass multiple `--env-file` arguments. Subsequent files override
+pre-existing variables defined in previous files.
+
+```bash
+node --env-file=.env --env-file=.development.env index.js
+```
+
+The format of the file should be one line per key-value pair of environment
+variable name and value separated by `=`:
+
+```text
+PORT=3000
+```
+
+Any text after a `#` is treated as a comment:
+
+```text
+# This is a comment
+PORT=3000 # This is also a comment
+```
+
+Values can start and end with the following quotes: `\`, `"` or `'`.
+They are omitted from the values.
+
+```text
+USERNAME="nodejs" # will result in `nodejs` as the value.
+```
+
+### `-e`, `--eval "script"`
+
+<!-- YAML
+added: v0.5.2
+changes:
+  - version: v5.11.0
+    pr-url: https://github.com/nodejs/node/pull/5348
+    description: Built-in libraries are now available as predefined variables.
+-->
+
+Evaluate the following argument as JavaScript. The modules which are
+predefined in the REPL can also be used in `script`.
+
+On Windows, using `cmd.exe` a single quote will not work correctly because it
+only recognizes double `"` for quoting. In Powershell or Git bash, both `'`
+and `"` are usable.
+
+### `--experimental-default-type=type`
+
+<!-- YAML
+added:
+  - v21.0.0
+-->
+
+> Stability: 1.0 - Early development
+
+Define which module system, `module` or `commonjs`, to use for the following:
+
+* String input provided via `--eval` or STDIN, if `--input-type` is unspecified.
+
+* Files ending in `.js` or with no extension, if there is no `package.json` file
+  present in the same folder or any parent folder.
+
+* Files ending in `.js` or with no extension, if the nearest parent
+  `package.json` field lacks a `"type"` field; unless the `package.json` folder
+  or any parent folder is inside a `node_modules` folder.
+
+In other words, `--experimental-default-type=module` flips all the places where
+Node.js currently defaults to CommonJS to instead default to ECMAScript modules,
+with the exception of folders and subfolders below `node_modules`, for backward
+compatibility.
+
+Under `--experimental-default-type=module` and `--experimental-wasm-modules`,
+files with no extension will be treated as WebAssembly if they begin with the
+WebAssembly magic number (`\0asm`); otherwise they will be treated as ES module
+JavaScript.
+
 ### `--experimental-import-meta-resolve`
 
 <!-- YAML
@@ -575,7 +675,7 @@ Enable experimental support for the `https:` protocol in `import` specifiers.
 added: v20.0.0
 -->
 
-> Stability: 1 - Experimental
+> Stability: 1.1 - Active development
 
 Enable the Permission Model for current process. When enabled, the
 following permissions are restricted:
@@ -593,38 +693,6 @@ added: v11.8.0
 
 Use the specified file as a security policy.
 
-### `--no-experimental-fetch`
-
-<!-- YAML
-added: v18.0.0
--->
-
-Disable experimental support for the [Fetch API][].
-
-### `--no-experimental-global-webcrypto`
-
-<!-- YAML
-added: v19.0.0
--->
-
-Disable exposition of [Web Crypto API][] on the global scope.
-
-### `--no-experimental-global-customevent`
-
-<!-- YAML
-added: v19.0.0
--->
-
-Disable exposition of [CustomEvent Web API][] on the global scope.
-
-### `--no-experimental-repl-await`
-
-<!-- YAML
-added: v16.6.0
--->
-
-Use this flag to disable top-level await in REPL.
-
 ### `--experimental-sea-config`
 
 <!-- YAML
@@ -703,6 +771,14 @@ added: v12.3.0
 
 Enable experimental WebAssembly module support.
 
+### `--experimental-websocket`
+
+<!-- YAML
+added: v21.0.0
+-->
+
+Enable experimental [`WebSocket`][] support.
+
 ### `--force-context-aware`
 
 <!-- YAML
@@ -720,6 +796,20 @@ added: v6.0.0
 Force FIPS-compliant crypto on startup. (Cannot be disabled from script code.)
 (Same requirements as `--enable-fips`.)
 
+### `--force-node-api-uncaught-exceptions-policy`
+
+<!-- YAML
+added:
+  - v18.3.0
+  - v16.17.0
+-->
+
+Enforces `uncaughtException` event on Node-API asynchronous callbacks.
+
+To prevent from an existing add-on from crashing the process, this flag is not
+enabled by default. In the future, this flag will be enabled by default to
+enforce the correct behavior.
+
 ### `--frozen-intrinsics`
 
 <!-- YAML
@@ -737,19 +827,63 @@ under this flag.
 To allow polyfills to be added,
 [`--require`][] and [`--import`][] both run before freezing intrinsics.
 
-### `--force-node-api-uncaught-exceptions-policy`
+### `--heap-prof`
 
 <!-- YAML
-added:
-  - v18.3.0
-  - v16.17.0
+added: v12.4.0
 -->
 
-Enforces `uncaughtException` event on Node-API asynchronous callbacks.
+> Stability: 1 - Experimental
 
-To prevent from an existing add-on from crashing the process, this flag is not
-enabled by default. In the future, this flag will be enabled by default to
-enforce the correct behavior.
+Starts the V8 heap profiler on start up, and writes the heap profile to disk
+before exit.
+
+If `--heap-prof-dir` is not specified, the generated profile is placed
+in the current working directory.
+
+If `--heap-prof-name` is not specified, the generated profile is
+named `Heap.${yyyymmdd}.${hhmmss}.${pid}.${tid}.${seq}.heapprofile`.
+
+```console
+$ node --heap-prof index.js
+$ ls *.heapprofile
+Heap.20190409.202950.15293.0.001.heapprofile
+```
+
+### `--heap-prof-dir`
+
+<!-- YAML
+added: v12.4.0
+-->
+
+> Stability: 1 - Experimental
+
+Specify the directory where the heap profiles generated by `--heap-prof` will
+be placed.
+
+The default value is controlled by the
+[`--diagnostic-dir`][] command-line option.
+
+### `--heap-prof-interval`
+
+<!-- YAML
+added: v12.4.0
+-->
+
+> Stability: 1 - Experimental
+
+Specify the average sampling interval in bytes for the heap profiles generated
+by `--heap-prof`. The default is 512 \* 1024 bytes.
+
+### `--heap-prof-name`
+
+<!-- YAML
+added: v12.4.0
+-->
+
+> Stability: 1 - Experimental
+
+Specify the file name of the heap profile generated by `--heap-prof`.
 
 ### `--heapsnapshot-near-heap-limit=max_count`
 
@@ -820,63 +954,14 @@ $ ls
 Heap.20190718.133405.15554.0.001.heapsnapshot
 ```
 
-### `--heap-prof`
-
-<!-- YAML
-added: v12.4.0
--->
-
-> Stability: 1 - Experimental
-
-Starts the V8 heap profiler on start up, and writes the heap profile to disk
-before exit.
-
-If `--heap-prof-dir` is not specified, the generated profile is placed
-in the current working directory.
-
-If `--heap-prof-name` is not specified, the generated profile is
-named `Heap.${yyyymmdd}.${hhmmss}.${pid}.${tid}.${seq}.heapprofile`.
-
-```console
-$ node --heap-prof index.js
-$ ls *.heapprofile
-Heap.20190409.202950.15293.0.001.heapprofile
-```
-
-### `--heap-prof-dir`
-
-<!-- YAML
-added: v12.4.0
--->
-
-> Stability: 1 - Experimental
-
-Specify the directory where the heap profiles generated by `--heap-prof` will
-be placed.
-
-The default value is controlled by the
-[`--diagnostic-dir`][] command-line option.
-
-### `--heap-prof-interval`
-
-<!-- YAML
-added: v12.4.0
--->
-
-> Stability: 1 - Experimental
-
-Specify the average sampling interval in bytes for the heap profiles generated
-by `--heap-prof`. The default is 512 \* 1024 bytes.
-
-### `--heap-prof-name`
+### `-h`, `--help`
 
 <!-- YAML
-added: v12.4.0
+added: v0.1.3
 -->
 
-> Stability: 1 - Experimental
-
-Specify the file name of the heap profile generated by `--heap-prof`.
+Print node command-line options.
+The output of this option is less detailed than this document.
 
 ### `--icu-data-dir=file`
 
@@ -889,7 +974,9 @@ Specify ICU data load path. (Overrides `NODE_ICU_DATA`.)
 ### `--import=module`
 
 <!-- YAML
-added: v19.0.0
+added:
+ - v19.0.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
@@ -913,28 +1000,32 @@ Valid values are `"commonjs"` and `"module"`. The default is `"commonjs"`.
 
 The REPL does not support this option.
 
-### `--inspect-brk[=[host:]port]`
+### `--insecure-http-parser`
 
 <!-- YAML
-added: v7.6.0
+added:
+ - v13.4.0
+ - v12.15.0
+ - v10.19.0
 -->
 
-Activate inspector on `host:port` and break at start of user script.
-Default `host:port` is `127.0.0.1:9229`.
+Enable leniency flags on the HTTP parser. This may allow
+interoperability with non-conformant HTTP implementations.
 
-### `--inspect-port=[host:]port`
+When enabled, the parser will accept the following:
 
-<!-- YAML
-added: v7.6.0
--->
+* Invalid HTTP headers values.
+* Invalid HTTP versions.
+* Allow message containing both `Transfer-Encoding`
+  and `Content-Length` headers.
+* Allow extra data after message when `Connection: close` is present.
+* Allow extra trasfer encodings after `chunked` has been provided.
+* Allow `\n` to be used as token separator instead of `\r\n`.
+* Allow `\r\n` not to be provided after a chunk.
+* Allow spaces to be present after a chunk size and before `\r\n`.
 
-Set the `host:port` to be used when the inspector is activated.
-Useful when activating the inspector by sending the `SIGUSR1` signal.
-
-Default host is `127.0.0.1`.
-
-See the [security warning][] below regarding the `host`
-parameter usage.
+All the above will expose your application to request smuggling
+or poisoning attack. Avoid using this option.
 
 ### `--inspect[=[host:]port]`
 
@@ -968,81 +1059,56 @@ default) is not firewall-protected.**
 
 See the [debugging security implications][] section for more information.
 
-### `--inspect-publish-uid=stderr,http`
-
-Specify ways of the inspector web socket url exposure.
-
-By default inspector websocket url is available in stderr and under `/json/list`
-endpoint on `http://host:port/json/list`.
-
-### `--insecure-http-parser`
+### `--inspect-brk[=[host:]port]`
 
 <!-- YAML
-added:
- - v13.4.0
- - v12.15.0
- - v10.19.0
+added: v7.6.0
 -->
 
-Use an insecure HTTP parser that accepts invalid HTTP headers. This may allow
-interoperability with non-conformant HTTP implementations. It may also allow
-request smuggling and other HTTP attacks that rely on invalid headers being
-accepted. Avoid using this option.
+Activate inspector on `host:port` and break at start of user script.
+Default `host:port` is `127.0.0.1:9229`.
 
-### `--jitless`
+### `--inspect-port=[host:]port`
 
 <!-- YAML
-added: v12.0.0
+added: v7.6.0
 -->
 
-Disable [runtime allocation of executable memory][jitless]. This may be
-required on some platforms for security reasons. It can also reduce attack
-surface on other platforms, but the performance impact may be severe.
-
-This flag is inherited from V8 and is subject to change upstream. It may
-disappear in a non-semver-major release.
+Set the `host:port` to be used when the inspector is activated.
+Useful when activating the inspector by sending the `SIGUSR1` signal.
 
-### `--env-file=config`
+Default host is `127.0.0.1`.
 
-> Stability: 1.1 - Active development
+See the [security warning][] below regarding the `host`
+parameter usage.
 
-<!-- YAML
-added: v20.6.0
--->
+### `--inspect-publish-uid=stderr,http`
 
-Loads environment variables from a file relative to the current directory,
-making them available to applications on `process.env`. The [environment
-variables which configure Node.js][environment_variables], such as `NODE_OPTIONS`,
-are parsed and applied. If the same variable is defined in the environment and
-in the file, the value from the environment takes precedence.
+Specify ways of the inspector web socket url exposure.
 
-You can pass multiple `--env-file` arguments. Subsequent files override
-pre-existing variables defined in previous files.
+By default inspector websocket url is available in stderr and under `/json/list`
+endpoint on `http://host:port/json/list`.
 
-```bash
-node --env-file=.env --env-file=.development.env index.js
-```
+### `-i`, `--interactive`
 
-The format of the file should be one line per key-value pair of environment
-variable name and value separated by `=`:
+<!-- YAML
+added: v0.7.7
+-->
 
-```text
-PORT=3000
-```
+Opens the REPL even if stdin does not appear to be a terminal.
 
-Any text after a `#` is treated as a comment:
+### `--jitless`
 
-```text
-# This is a comment
-PORT=3000 # This is also a comment
-```
+<!-- YAML
+added: v12.0.0
+-->
 
-Values can start and end with the following quotes: `\`, `"` or `'`.
-They are omitted from the values.
+Disable [runtime allocation of executable memory][jitless]. This may be
+required on some platforms for security reasons. It can also reduce attack
+surface on other platforms, but the performance impact may be severe.
 
-```text
-USERNAME="nodejs" # will result in `nodejs` as the value.
-```
+This flag is inherited from V8 and is subject to change upstream. It may
+disappear in a non-semver-major release.
 
 ### `--max-http-header-size=size`
 
@@ -1086,6 +1152,38 @@ added: v0.8.0
 
 Silence deprecation warnings.
 
+### `--no-experimental-fetch`
+
+<!-- YAML
+added: v18.0.0
+-->
+
+Disable exposition of [Fetch API][] on the global scope.
+
+### `--no-experimental-global-customevent`
+
+<!-- YAML
+added: v19.0.0
+-->
+
+Disable exposition of [CustomEvent Web API][] on the global scope.
+
+### `--no-experimental-global-webcrypto`
+
+<!-- YAML
+added: v19.0.0
+-->
+
+Disable exposition of [Web Crypto API][] on the global scope.
+
+### `--no-experimental-repl-await`
+
+<!-- YAML
+added: v16.6.0
+-->
+
+Use this flag to disable top-level await in REPL.
+
 ### `--no-extra-info-on-fatal-exception`
 
 <!-- YAML
@@ -1112,6 +1210,21 @@ added: v16.10.0
 Do not search modules from global paths like `$HOME/.node_modules` and
 `$NODE_PATH`.
 
+### `--no-network-family-autoselection`
+
+<!-- YAML
+added: v19.4.0
+changes:
+  - version: v20.0.0
+    pr-url: https://github.com/nodejs/node/pull/46790
+    description: The flag was renamed from `--no-enable-network-family-autoselection`
+                 to `--no-network-family-autoselection`. The old name can still work as
+                 an alias.
+-->
+
+Disables the family autoselection algorithm unless connection options explicitly
+enables it.
+
 ### `--no-warnings`
 
 <!-- YAML
@@ -1141,6 +1254,17 @@ Load an OpenSSL configuration file on startup. Among other uses, this can be
 used to enable FIPS-compliant crypto if Node.js is built
 against FIPS-enabled OpenSSL.
 
+### `--openssl-legacy-provider`
+
+<!-- YAML
+added:
+  - v17.0.0
+  - v16.17.0
+-->
+
+Enable OpenSSL 3.0 legacy provider. For more information please see
+[OSSL\_PROVIDER-legacy][OSSL_PROVIDER-legacy].
+
 ### `--openssl-shared-config`
 
 <!-- YAML
@@ -1159,17 +1283,6 @@ is being linked to Node.js. Sharing the OpenSSL configuration may have unwanted
 implications and it is recommended to use a configuration section specific to
 Node.js which is `nodejs_conf` and is default when this option is not used.
 
-### `--openssl-legacy-provider`
-
-<!-- YAML
-added:
-  - v17.0.0
-  - v16.17.0
--->
-
-Enable OpenSSL 3.0 legacy provider. For more information please see
-[OSSL\_PROVIDER-legacy][OSSL_PROVIDER-legacy].
-
 ### `--pending-deprecation`
 
 <!-- YAML
@@ -1262,6 +1375,18 @@ resolving relative paths.
 
 See [`--preserve-symlinks`][] for more information.
 
+### `-p`, `--print "script"`
+
+<!-- YAML
+added: v0.6.4
+changes:
+  - version: v5.11.0
+    pr-url: https://github.com/nodejs/node/pull/5348
+    description: Built-in libraries are now available as predefined variables.
+-->
+
+Identical to `-e` but prints the result.
+
 ### `--prof`
 
 <!-- YAML
@@ -1431,6 +1556,21 @@ Enables report to be generated when the process exits due to an uncaught
 exception. Useful when inspecting the JavaScript stack in conjunction with
 native stack and other runtime environment data.
 
+### `-r`, `--require module`
+
+<!-- YAML
+added: v1.6.0
+-->
+
+Preload the specified module at startup.
+
+Follows `require()`'s module resolution
+rules. `module` may be either a path to a file, or a node module name.
+
+Only CommonJS modules are supported.
+Use [`--import`][] to preload an [ECMAScript module][].
+Modules preloaded with `--require` will run before modules preloaded with `--import`.
+
 ### `--secure-heap=n`
 
 <!-- YAML
@@ -1514,6 +1654,15 @@ Starts the Node.js command line test runner. This flag cannot be combined with
 See the documentation on [running tests from the command line][]
 for more details.
 
+### `--test-concurrency`
+
+<!-- YAML
+added: v21.0.0
+-->
+
+The maximum number of test files that the test runner CLI will execute
+concurrently. The default value is `os.availableParallelism() - 1`.
+
 ### `--test-name-pattern`
 
 <!-- YAML
@@ -1528,22 +1677,22 @@ A regular expression that configures the test runner to only execute tests
 whose name matches the provided pattern. See the documentation on
 [filtering tests by name][] for more details.
 
-### `--test-reporter`
+### `--test-only`
 
 <!-- YAML
 added:
-  - v19.6.0
-  - v18.15.0
+  - v18.0.0
+  - v16.17.0
 changes:
   - version: v20.0.0
     pr-url: https://github.com/nodejs/node/pull/46983
     description: The test runner is now stable.
 -->
 
-A test reporter to use when running tests. See the documentation on
-[test reporters][] for more details.
+Configures the test runner to only execute top level tests that have the `only`
+option set.
 
-### `--test-reporter-destination`
+### `--test-reporter`
 
 <!-- YAML
 added:
@@ -1555,23 +1704,23 @@ changes:
     description: The test runner is now stable.
 -->
 
-The destination for the corresponding test reporter. See the documentation on
+A test reporter to use when running tests. See the documentation on
 [test reporters][] for more details.
 
-### `--test-only`
+### `--test-reporter-destination`
 
 <!-- YAML
 added:
-  - v18.0.0
-  - v16.17.0
+  - v19.6.0
+  - v18.15.0
 changes:
   - version: v20.0.0
     pr-url: https://github.com/nodejs/node/pull/46983
     description: The test runner is now stable.
 -->
 
-Configures the test runner to only execute top level tests that have the `only`
-option set.
+The destination for the corresponding test reporter. See the documentation on
+[test reporters][] for more details.
 
 ### `--test-shard`
 
@@ -1922,6 +2071,14 @@ The amount of parallelism refers to the number of computations that can be
 carried out simultaneously in a given machine. In general, it's the same as the
 amount of CPUs, but it may diverge in environments such as VMs or containers.
 
+### `-v`, `--version`
+
+<!-- YAML
+added: v0.1.3
+-->
+
+Print node's version.
+
 ### `--watch`
 
 <!-- YAML
@@ -1996,89 +2153,6 @@ added: v6.0.0
 Automatically zero-fills all newly allocated [`Buffer`][] and [`SlowBuffer`][]
 instances.
 
-### `-c`, `--check`
-
-<!-- YAML
-added:
-  - v5.0.0
-  - v4.2.0
-changes:
-  - version: v10.0.0
-    pr-url: https://github.com/nodejs/node/pull/19600
-    description: The `--require` option is now supported when checking a file.
--->
-
-Syntax check the script without executing.
-
-### `-e`, `--eval "script"`
-
-<!-- YAML
-added: v0.5.2
-changes:
-  - version: v5.11.0
-    pr-url: https://github.com/nodejs/node/pull/5348
-    description: Built-in libraries are now available as predefined variables.
--->
-
-Evaluate the following argument as JavaScript. The modules which are
-predefined in the REPL can also be used in `script`.
-
-On Windows, using `cmd.exe` a single quote will not work correctly because it
-only recognizes double `"` for quoting. In Powershell or Git bash, both `'`
-and `"` are usable.
-
-### `-h`, `--help`
-
-<!-- YAML
-added: v0.1.3
--->
-
-Print node command-line options.
-The output of this option is less detailed than this document.
-
-### `-i`, `--interactive`
-
-<!-- YAML
-added: v0.7.7
--->
-
-Opens the REPL even if stdin does not appear to be a terminal.
-
-### `-p`, `--print "script"`
-
-<!-- YAML
-added: v0.6.4
-changes:
-  - version: v5.11.0
-    pr-url: https://github.com/nodejs/node/pull/5348
-    description: Built-in libraries are now available as predefined variables.
--->
-
-Identical to `-e` but prints the result.
-
-### `-r`, `--require module`
-
-<!-- YAML
-added: v1.6.0
--->
-
-Preload the specified module at startup.
-
-Follows `require()`'s module resolution
-rules. `module` may be either a path to a file, or a node module name.
-
-Only CommonJS modules are supported.
-Use [`--import`][] to preload an [ECMAScript module][].
-Modules preloaded with `--require` will run before modules preloaded with `--import`.
-
-### `-v`, `--version`
-
-<!-- YAML
-added: v0.1.3
--->
-
-Print node's version.
-
 ## Environment variables
 
 ### `FORCE_COLOR=[1, 2, 3]`
@@ -2095,6 +2169,11 @@ and `NODE_DISABLE_COLORS` environment variables are ignored.
 
 Any other value will result in colorized output being disabled.
 
+### `NO_COLOR=<any>`
+
+[`NO_COLOR`][]  is an alias for `NODE_DISABLE_COLORS`. The value of the
+environment variable is arbitrary.
+
 ### `NODE_DEBUG=module[,…]`
 
 <!-- YAML
@@ -2206,6 +2285,7 @@ Node.js options that are allowed are:
 * `--enable-network-family-autoselection`
 * `--enable-source-maps`
 * `--experimental-abortcontroller`
+* `--experimental-default-type`
 * `--experimental-import-meta-resolve`
 * `--experimental-json-modules`
 * `--experimental-loader`
@@ -2219,6 +2299,7 @@ Node.js options that are allowed are:
 * `--experimental-vm-modules`
 * `--experimental-wasi-unstable-preview1`
 * `--experimental-wasm-modules`
+* `--experimental-websocket`
 * `--force-context-aware`
 * `--force-fips`
 * `--force-node-api-uncaught-exceptions-policy`
@@ -2382,16 +2463,6 @@ appended to if it does. If an error occurs while attempting to write the
 warning to the file, the warning will be written to stderr instead. This is
 equivalent to using the `--redirect-warnings=file` command-line flag.
 
-### `NODE_REPL_HISTORY=file`
-
-<!-- YAML
-added: v3.0.0
--->
-
-Path to the file used to store the persistent REPL history. The default path is
-`~/.node_repl_history`, which is overridden by this variable. Setting the value
-to an empty string (`''` or `' '`) disables persistent REPL history.
-
 ### `NODE_REPL_EXTERNAL_MODULE=file`
 
 <!-- YAML
@@ -2403,6 +2474,16 @@ added:
 Path to a Node.js module which will be loaded in place of the built-in REPL.
 Overriding this value to an empty string (`''`) will use the built-in REPL.
 
+### `NODE_REPL_HISTORY=file`
+
+<!-- YAML
+added: v3.0.0
+-->
+
+Path to the file used to store the persistent REPL history. The default path is
+`~/.node_repl_history`, which is overridden by this variable. Setting the value
+to an empty string (`''` or `' '`) disables persistent REPL history.
+
 ### `NODE_SKIP_PLATFORM_CHECK=value`
 
 <!-- YAML
@@ -2501,11 +2582,6 @@ and the line lengths of the source file (in the key `lineLengths`).
 }
 ```
 
-### `NO_COLOR=<any>`
-
-[`NO_COLOR`][]  is an alias for `NODE_DISABLE_COLORS`. The value of the
-environment variable is arbitrary.
-
 ### `OPENSSL_CONF=file`
 
 <!-- YAML
@@ -2677,6 +2753,7 @@ done
 [`--allow-worker`]: #--allow-worker
 [`--cpu-prof-dir`]: #--cpu-prof-dir
 [`--diagnostic-dir`]: #--diagnostic-dirdirectory
+[`--experimental-default-type=module`]: #--experimental-default-typetype
 [`--experimental-sea-config`]: single-executable-applications.md#generating-single-executable-preparation-blobs
 [`--experimental-wasm-modules`]: #--experimental-wasm-modules
 [`--heap-prof-dir`]: #--heap-prof-dir
@@ -2691,6 +2768,7 @@ done
 [`NODE_OPTIONS`]: #node_optionsoptions
 [`NO_COLOR`]: https://no-color.org
 [`SlowBuffer`]: buffer.md#class-slowbuffer
+[`WebSocket`]: https://developer.mozilla.org/en-US/docs/Web/API/WebSocket
 [`YoungGenerationSizeFromSemiSpaceSize`]: https://chromium.googlesource.com/v8/v8.git/+/refs/tags/10.3.129/src/heap/heap.cc#328
 [`dns.lookup()`]: dns.md#dnslookuphostname-options-callback
 [`dns.setDefaultResultOrder()`]: dns.md#dnssetdefaultresultorderorder
diff --git a/doc/api/corepack.md b/doc/api/corepack.md
index c023a24183348e..b9c3ddca09c78c 100644
--- a/doc/api/corepack.md
+++ b/doc/api/corepack.md
@@ -12,7 +12,7 @@ added:
 
 > Stability: 1 - Experimental
 
-_[Corepack][]_ is an experimental tool to help with
+_[Corepack][Corepack repository]_ is an experimental tool to help with
 managing versions of your package managers. It exposes binary proxies for
 each [supported package manager][] that, when called, will identify whatever
 package manager is configured for the current project, transparently install
@@ -52,23 +52,31 @@ sure that all calls to the relevant binaries are run against the requested
 version, downloading it on demand if needed, and aborting if it cannot be
 successfully retrieved.
 
+You can use [`corepack use`][] to ask Corepack to update your local
+`package.json` to use the package manager of your choice:
+
+```bash
+corepack use pnpm@7.x # sets the latest 7.x version in the package.json
+corepack use yarn@* # sets the latest version in the package.json
+```
+
 ### Upgrading the global versions
 
 When running outside of an existing project (for example when running
 `yarn init`), Corepack will by default use predefined versions roughly
 corresponding to the latest stable releases from each tool. Those versions can
-be overridden by running the [`corepack prepare`][] command along with the
+be overridden by running the [`corepack install`][] command along with the
 package manager version you wish to set:
 
 ```bash
-corepack prepare yarn@x.y.z --activate
+corepack install --global yarn@x.y.z
 ```
 
 Alternately, a tag or range may be used:
 
 ```bash
-corepack prepare pnpm@latest --activate
-corepack prepare yarn@stable --activate
+corepack install --global pnpm@*
+corepack install --global yarn@stable
 ```
 
 ### Offline workflow
@@ -76,11 +84,11 @@ corepack prepare yarn@stable --activate
 Many production environments don't have network access. Since Corepack
 usually downloads the package manager releases straight from their registries,
 it can conflict with such environments. To avoid that happening, call the
-[`corepack prepare`][] command while you still have network access (typically at
+[`corepack pack`][] command while you still have network access (typically at
 the same time you're preparing your deploy image). This will ensure that the
 required package managers are available even without network access.
 
-The `prepare` command has [various flags][]. Consult the detailed
+The `pack` command has [various flags][]. Consult the detailed
 [Corepack documentation][] for more information.
 
 ## Supported package managers
@@ -118,14 +126,15 @@ install. To avoid this problem, consider one of the following options:
   override binaries, but you'll erase the Corepack ones in the process. (Run
   [`corepack enable`][] to add them back.)
 
-[Corepack]: https://github.com/nodejs/corepack
 [Corepack documentation]: https://github.com/nodejs/corepack#readme
 [Corepack repository]: https://github.com/nodejs/corepack
 [Yarn]: https://yarnpkg.com
 [`"packageManager"`]: packages.md#packagemanager
 [`corepack disable`]: https://github.com/nodejs/corepack#corepack-disable--name
 [`corepack enable`]: https://github.com/nodejs/corepack#corepack-enable--name
-[`corepack prepare`]: https://github.com/nodejs/corepack#corepack-prepare--nameversion
+[`corepack install`]: https://github.com/nodejs/corepack#corepack-install--g--global---all--nameversion
+[`corepack pack`]: https://github.com/nodejs/corepack#corepack-pack---all--nameversion
+[`corepack use`]: https://github.com/nodejs/corepack#corepack-use-nameversion
 [`package.json`]: packages.md#nodejs-packagejson-field-definitions
 [pnpm]: https://pnpm.js.org
 [supported binaries]: #supported-package-managers
diff --git a/doc/api/deprecations.md b/doc/api/deprecations.md
index 9837d402036e28..607678ebbfba95 100644
--- a/doc/api/deprecations.md
+++ b/doc/api/deprecations.md
@@ -872,7 +872,7 @@ The [`require.extensions`][] property is deprecated.
 
 <!-- YAML
 changes:
-  - version: REPLACEME
+  - version: v21.0.0
     pr-url: https://github.com/nodejs/node/pull/47202
     description: Runtime deprecation.
   - version: v16.6.0
@@ -3383,6 +3383,51 @@ In a future version of Node.js, [`assert.CallTracker`][],
 will be removed.
 Consider using alternatives such as the [`mock`][] helper function.
 
+### DEP0174: calling `promisify` on a function that returns a `Promise`
+
+<!-- YAML
+changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/49609
+    description: Runtime deprecation.
+  - version: v20.8.0
+    pr-url: https://github.com/nodejs/node/pull/49647
+    description: Documentation-only deprecation.
+-->
+
+Type: Runtime
+
+Calling [`util.promisify`][] on a function that returns a <Promise> will ignore
+the result of said promise, which can lead to unhandled promise rejections.
+
+### DEP0175: `util.toUSVString`
+
+<!-- YAML
+changes:
+  - version: v20.8.0
+    pr-url: https://github.com/nodejs/node/pull/49725
+    description: Documentation-only deprecation.
+-->
+
+Type: Documentation-only
+
+The [`util.toUSVString()`][] API is deprecated. Please use
+[`String.prototype.toWellFormed`][] instead.
+
+### DEP0176: `fs.F_OK`, `fs.R_OK`, `fs.W_OK`, `fs.X_OK`
+
+<!-- YAML
+changes:
+  - version: v20.8.0
+    pr-url: https://github.com/nodejs/node/pull/49683
+    description: Documentation-only deprecation.
+-->
+
+Type: Documentation-only
+
+`F_OK`, `R_OK`, `W_OK` and `X_OK` getters exposed directly on `node:fs` are
+deprecated. Get them from `fs.constants` or `fs.promises.constants` instead.
+
 [NIST SP 800-38D]: https://nvlpubs.nist.gov/nistpubs/Legacy/SP/nistspecialpublication800-38d.pdf
 [RFC 6066]: https://tools.ietf.org/html/rfc6066#section-3
 [RFC 8247 Section 2.4]: https://www.rfc-editor.org/rfc/rfc8247#section-2.4
@@ -3405,6 +3450,7 @@ Consider using alternatives such as the [`mock`][] helper function.
 [`Server.getConnections()`]: net.md#servergetconnectionscallback
 [`Server.listen({fd: <number>})`]: net.md#serverlistenhandle-backlog-callback
 [`SlowBuffer`]: buffer.md#class-slowbuffer
+[`String.prototype.toWellFormed`]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/toWellFormed
 [`WriteStream.open()`]: fs.md#class-fswritestream
 [`assert.CallTracker`]: assert.md#class-assertcalltracker
 [`assert`]: assert.md
@@ -3523,6 +3569,8 @@ Consider using alternatives such as the [`mock`][] helper function.
 [`util.isSymbol()`]: util.md#utilissymbolobject
 [`util.isUndefined()`]: util.md#utilisundefinedobject
 [`util.log()`]: util.md#utillogstring
+[`util.promisify`]: util.md#utilpromisifyoriginal
+[`util.toUSVString()`]: util.md#utiltousvstringstring
 [`util.types`]: util.md#utiltypes
 [`util`]: util.md
 [`worker.exitedAfterDisconnect`]: cluster.md#workerexitedafterdisconnect
diff --git a/doc/api/dgram.md b/doc/api/dgram.md
index c46511994a72b9..f19e62bc7736bd 100644
--- a/doc/api/dgram.md
+++ b/doc/api/dgram.md
@@ -375,7 +375,9 @@ provided, it is added as a listener for the [`'close'`][] event.
 ### `socket[Symbol.asyncDispose]()`
 
 <!-- YAML
-added: v20.5.0
+added:
+ - v20.5.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
diff --git a/doc/api/errors.md b/doc/api/errors.md
index 5a8637a0ecc8b0..8070fffc388b9f 100644
--- a/doc/api/errors.md
+++ b/doc/api/errors.md
@@ -773,19 +773,17 @@ STDERR/STDOUT, and the data's length is longer than the `maxBuffer` option.
 
 ### `ERR_CLOSED_MESSAGE_PORT`
 
-<!--
-added:
-  - v16.2.0
-  - v14.17.1
+<!-- YAML
+added: v10.5.0
 changes:
-  - version: 11.12.0
-    pr-url: https://github.com/nodejs/node/pull/26487
-    description: The error message was removed.
   - version:
       - v16.2.0
       - v14.17.1
     pr-url: https://github.com/nodejs/node/pull/38510
     description: The error message was reintroduced.
+  - version: v11.12.0
+    pr-url: https://github.com/nodejs/node/pull/26487
+    description: The error message was removed.
 -->
 
 There was an attempt to use a `MessagePort` instance in a closed
@@ -802,7 +800,7 @@ non-writable `stdout` or `stderr` stream.
 
 ### `ERR_CONSTRUCT_CALL_INVALID`
 
-<!--
+<!-- YAML
 added: v12.5.0
 -->
 
@@ -1275,7 +1273,7 @@ to the current platform which is running Node.js is used.
 
 ### `ERR_FS_CP_DIR_TO_NON_DIR`
 
-<!--
+<!-- YAML
 added: v16.7.0
 -->
 
@@ -1286,7 +1284,7 @@ etc.) using [`fs.cp()`][].
 
 ### `ERR_FS_CP_EEXIST`
 
-<!--
+<!-- YAML
 added: v16.7.0
 -->
 
@@ -1297,7 +1295,7 @@ An attempt was made to copy over a file that already existed with
 
 ### `ERR_FS_CP_EINVAL`
 
-<!--
+<!-- YAML
 added: v16.7.0
 -->
 
@@ -1318,7 +1316,7 @@ Response body size doesn't match with the specified content-length header value.
 
 ### `ERR_FS_CP_FIFO_PIPE`
 
-<!--
+<!-- YAML
 added: v16.7.0
 -->
 
@@ -1328,7 +1326,7 @@ An attempt was made to copy a named pipe with [`fs.cp()`][].
 
 ### `ERR_FS_CP_NON_DIR_TO_DIR`
 
-<!--
+<!-- YAML
 added: v16.7.0
 -->
 
@@ -1339,7 +1337,7 @@ using [`fs.cp()`][].
 
 ### `ERR_FS_CP_SOCKET`
 
-<!--
+<!-- YAML
 added: v16.7.0
 -->
 
@@ -1349,7 +1347,7 @@ An attempt was made to copy to a socket with [`fs.cp()`][].
 
 ### `ERR_FS_CP_SYMLINK_TO_SUBDIRECTORY`
 
-<!--
+<!-- YAML
 added: v16.7.0
 -->
 
@@ -1360,7 +1358,7 @@ of `src`.
 
 ### `ERR_FS_CP_UNKNOWN`
 
-<!--
+<!-- YAML
 added: v16.7.0
 -->
 
@@ -1716,7 +1714,7 @@ made to mark a stream and dependent of itself.
 
 ### `ERR_HTTP2_TOO_MANY_INVALID_FRAMES`
 
-<!--
+<!-- YAML
 added: v15.14.0
 -->
 
@@ -1761,7 +1759,8 @@ added:
   - v16.14.0
 -->
 
-An import assertion has failed, preventing the specified module to be imported.
+An import `type` attribute was provided, but the specified module is of a
+different type.
 
 <a id="ERR_IMPORT_ASSERTION_TYPE_MISSING"></a>
 
@@ -1773,7 +1772,7 @@ added:
   - v16.14.0
 -->
 
-An import assertion is missing, preventing the specified module to be imported.
+An import attribute is missing, preventing the specified module to be imported.
 
 <a id="ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED"></a>
 
@@ -1785,7 +1784,17 @@ added:
   - v16.14.0
 -->
 
-An import assertion is not supported by this version of Node.js.
+An import attribute is not supported by this version of Node.js.
+
+<a id="ERR_IMPORT_ATTRIBUTE_UNSUPPORTED"></a>
+
+### `ERR_IMPORT_ATTRIBUTE_UNSUPPORTED`
+
+<!-- YAML
+added: v21.0.0
+-->
+
+An import attribute is not supported by this version of Node.js.
 
 <a id="ERR_INCOMPATIBLE_OPTION_PAIR"></a>
 
@@ -2086,12 +2095,6 @@ urlSearchParams.has.call(buf, 'foo');
 // Throws a TypeError with code 'ERR_INVALID_THIS'
 ```
 
-<a id="ERR_INVALID_TRANSFER_OBJECT"></a>
-
-### `ERR_INVALID_TRANSFER_OBJECT`
-
-An invalid transfer object was passed to `postMessage()`.
-
 <a id="ERR_INVALID_TUPLE"></a>
 
 ### `ERR_INVALID_TUPLE`
@@ -2289,23 +2292,6 @@ The V8 platform used by this instance of Node.js does not support creating
 Workers. This is caused by lack of embedder support for Workers. In particular,
 this error will not occur with standard builds of Node.js.
 
-<a id="ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST"></a>
-
-### `ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST`
-
-<!-- YAML
-added: v15.0.0
--->
-
-An object that needs to be explicitly listed in the `transferList` argument
-is in the object passed to a [`postMessage()`][] call, but is not provided
-in the `transferList` for that call. Usually, this is a `MessagePort`.
-
-In Node.js versions prior to v15.0.0, the error code being used here was
-[`ERR_MISSING_MESSAGE_PORT_IN_TRANSFER_LIST`][]. However, the set of
-transferable object types has been expanded to cover more types than
-`MessagePort`.
-
 <a id="ERR_MODULE_NOT_FOUND"></a>
 
 ### `ERR_MODULE_NOT_FOUND`
@@ -2995,6 +2981,12 @@ An attempt was made to use something that was already closed.
 While using the Performance Timing API (`perf_hooks`), no valid performance
 entry types are found.
 
+<a id="ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG"></a>
+
+### `ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG`
+
+A dynamic import callback was invoked without `--experimental-vm-modules`.
+
 <a id="ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING"></a>
 
 ### `ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING`
@@ -3177,7 +3169,7 @@ attempting a [`require()`][] operation or when loading the program entry point.
 
 ### `ERR_CANNOT_TRANSFER_OBJECT`
 
-<!--
+<!-- YAML
 added: v10.5.0
 removed: v12.5.0
 -->
@@ -3302,6 +3294,20 @@ removed: v15.0.0
 
 An invalid or unknown file encoding was passed.
 
+<a id="ERR_INVALID_TRANSFER_OBJECT"></a>
+
+### `ERR_INVALID_TRANSFER_OBJECT`
+
+<!-- YAML
+removed: v21.0.0
+changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/47839
+    description: A `DOMException` is thrown instead.
+-->
+
+An invalid transfer object was passed to `postMessage()`.
+
 <a id="ERR_MISSING_MESSAGE_PORT_IN_TRANSFER_LIST"></a>
 
 ### `ERR_MISSING_MESSAGE_PORT_IN_TRANSFER_LIST`
@@ -3314,6 +3320,28 @@ This error code was replaced by [`ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST`][]
 in Node.js v15.0.0, because it is no longer accurate as other types of
 transferable objects also exist now.
 
+<a id="ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST"></a>
+
+### `ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST`
+
+<!-- YAML
+added: v15.0.0
+removed: v21.0.0
+changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/47839
+    description: A `DOMException` is thrown instead.
+-->
+
+An object that needs to be explicitly listed in the `transferList` argument
+is in the object passed to a [`postMessage()`][] call, but is not provided
+in the `transferList` for that call. Usually, this is a `MessagePort`.
+
+In Node.js versions prior to v15.0.0, the error code being used here was
+[`ERR_MISSING_MESSAGE_PORT_IN_TRANSFER_LIST`][]. However, the set of
+transferable object types has been expanded to cover more types than
+`MessagePort`.
+
 <a id="ERR_NAPI_CONS_PROTOTYPE_OBJECT"></a>
 
 ### `ERR_NAPI_CONS_PROTOTYPE_OBJECT`
diff --git a/doc/api/esm.md b/doc/api/esm.md
index 79793aef9cfe24..b4224fe83981fc 100644
--- a/doc/api/esm.md
+++ b/doc/api/esm.md
@@ -7,6 +7,9 @@
 <!-- YAML
 added: v8.5.0
 changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/50140
+    description: Add experimental support for import attributes.
   - version: v20.0.0
     pr-url: https://github.com/nodejs/node/pull/44710
     description: Module customization hooks are executed off the main thread.
@@ -19,7 +22,7 @@ changes:
     - v17.1.0
     - v16.14.0
     pr-url: https://github.com/nodejs/node/pull/40250
-    description: Add support for import assertions.
+    description: Add experimental support for import assertions.
   - version:
     - v17.0.0
     - v16.12.0
@@ -106,10 +109,11 @@ provides interoperability between them and its original module format,
 
 Node.js has two module systems: [CommonJS][] modules and ECMAScript modules.
 
-Authors can tell Node.js to use the ECMAScript modules loader
-via the `.mjs` file extension, the `package.json` [`"type"`][] field, or the
-[`--input-type`][] flag. Outside of those cases, Node.js will use the CommonJS
-module loader. See [Determining module system][] for more details.
+Authors can tell Node.js to use the ECMAScript modules loader via the `.mjs`
+file extension, the `package.json` [`"type"`][] field, the [`--input-type`][]
+flag, or the [`--experimental-default-type`][] flag. Outside of those cases,
+Node.js will use the CommonJS module loader. See [Determining module system][]
+for more details.
 
 <!-- Anchors to make sure old links find a target -->
 
@@ -202,7 +206,7 @@ added: v12.10.0
 
 ```js
 import 'data:text/javascript,console.log("hello!");';
-import _ from 'data:application/json,"world!"' assert { type: 'json' };
+import _ from 'data:application/json,"world!"' with { type: 'json' };
 ```
 
 `data:` URLs only resolve [bare specifiers][Terminology] for builtin modules
@@ -234,30 +238,40 @@ absolute URL strings.
 import fs from 'node:fs/promises';
 ```
 
-## Import assertions
+<a id="import-assertions"></a>
+
+## Import attributes
 
 <!-- YAML
 added:
   - v17.1.0
   - v16.14.0
+changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/50140
+    description: Switch from Import Assertions to Import Attributes.
 -->
 
-> Stability: 1 - Experimental
+> Stability: 1.1 - Active development
 
-The [Import Assertions proposal][] adds an inline syntax for module import
+> This feature was previously named "Import assertions", and using the `assert`
+> keyword instead of `with`. Any uses in code of the prior `assert` keyword
+> should be updated to use `with` instead.
+
+The [Import Attributes proposal][] adds an inline syntax for module import
 statements to pass on more information alongside the module specifier.
 
 ```js
-import fooData from './foo.json' assert { type: 'json' };
+import fooData from './foo.json' with { type: 'json' };
 
 const { default: barData } =
-  await import('./bar.json', { assert: { type: 'json' } });
+  await import('./bar.json', { with: { type: 'json' } });
 ```
 
-Node.js supports the following `type` values, for which the assertion is
+Node.js supports the following `type` values, for which the attribute is
 mandatory:
 
-| Assertion `type` | Needed for       |
+| Attribute `type` | Needed for       |
 | ---------------- | ---------------- |
 | `'json'`         | [JSON modules][] |
 
@@ -324,14 +338,19 @@ const buffer = readFileSync(new URL('./data.proto', import.meta.url));
 
 ### `import.meta.resolve(specifier)`
 
-<!--
+<!-- YAML
 added:
   - v13.9.0
   - v12.16.2
 changes:
-  - version: 20.6.0
+  - version: v20.6.0
     pr-url: https://github.com/nodejs/node/pull/49028
-    description: No longer behind the `--experimental-import-meta-resolve` flag.
+    description: Unflag `import.meta.resolve``, with `parentURL` parameter still
+                 flagged.
+  - version: v20.6.0
+    pr-url: https://github.com/nodejs/node/pull/49038
+    description: This API no longer throws when targeting `file:` URLs that do
+                 not map to an existing file on the local FS.
   - version: v20.0.0
     pr-url: https://github.com/nodejs/node/pull/44710
     description: This API now returns a string synchronously instead of a Promise.
@@ -340,11 +359,6 @@ changes:
       - v14.18.0
     pr-url: https://github.com/nodejs/node/pull/38587
     description: Add support for WHATWG `URL` object to `parentURL` parameter.
-  - version:
-      - v20.6.0
-    pr-url: https://github.com/nodejs/node/pull/49028
-    description: Unflag import.meta.resolve, with `parentURL` parameter still
-                 flagged.
 -->
 
 > Stability: 1.2 - Release candidate
@@ -544,10 +558,10 @@ separate cache.
 JSON files can be referenced by `import`:
 
 ```js
-import packageConfig from './package.json' assert { type: 'json' };
+import packageConfig from './package.json' with { type: 'json' };
 ```
 
-The `assert { type: 'json' }` syntax is mandatory; see [Import Assertions][].
+The `with { type: 'json' }` syntax is mandatory; see [Import Attributes][].
 
 The imported JSON only exposes a `default` export. There is no support for named
 exports. A cache entry is created in the CommonJS cache to avoid duplication.
@@ -1008,8 +1022,12 @@ _isImports_, _conditions_)
 > 5. Let _packageURL_ be the result of **LOOKUP\_PACKAGE\_SCOPE**(_url_).
 > 6. Let _pjson_ be the result of **READ\_PACKAGE\_JSON**(_packageURL_).
 > 7. If _pjson?.type_ exists and is _"module"_, then
->    1. If _url_ ends in _".js"_, then
->       1. Return _"module"_.
+>    1. If _url_ ends in _".js"_ or has no file extension, then
+>       1. If `--experimental-wasm-modules` is enabled and the file at _url_
+>          contains the header for a WebAssembly module, then
+>          1. Return _"wasm"_.
+>       2. Otherwise,
+>          1. Return _"module"_.
 >    2. Return **undefined**.
 > 8. Otherwise,
 >    1. Return **undefined**.
@@ -1050,8 +1068,8 @@ resolution for ESM specifiers is [commonjs-extension-resolution-loader][].
 [Determining module system]: packages.md#determining-module-system
 [Dynamic `import()`]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/import
 [ES Module Integration Proposal for WebAssembly]: https://github.com/webassembly/esm-integration
-[Import Assertions]: #import-assertions
-[Import Assertions proposal]: https://github.com/tc39/proposal-import-assertions
+[Import Attributes]: #import-attributes
+[Import Attributes proposal]: https://github.com/tc39/proposal-import-attributes
 [JSON modules]: #json-modules
 [Module customization hooks]: module.md#customization-hooks
 [Node.js Module Resolution And Loading Algorithm]: #resolution-algorithm-specification
@@ -1059,6 +1077,7 @@ resolution for ESM specifiers is [commonjs-extension-resolution-loader][].
 [URL]: https://url.spec.whatwg.org/
 [`"exports"`]: packages.md#exports
 [`"type"`]: packages.md#type
+[`--experimental-default-type`]: cli.md#--experimental-default-typetype
 [`--input-type`]: cli.md#--input-typetype
 [`data:` URLs]: https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/Data_URIs
 [`export`]: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Statements/export
diff --git a/doc/api/events.md b/doc/api/events.md
index 8dcb8ebfed55cf..19fccbce0c5a4b 100644
--- a/doc/api/events.md
+++ b/doc/api/events.md
@@ -105,7 +105,7 @@ class MyEmitter extends EventEmitter {}
 const myEmitter = new MyEmitter();
 myEmitter.on('event', (a, b) => {
   console.log(a, b, this);
-  // Prints: a b {}
+  // Prints: a b undefined
 });
 myEmitter.emit('event', 'a', 'b');
 ```
@@ -1806,7 +1806,9 @@ setMaxListeners(5, target, emitter);
 ## `events.addAbortListener(signal, listener)`
 
 <!-- YAML
-added: v20.5.0
+added:
+ - v20.5.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
diff --git a/doc/api/fs.md b/doc/api/fs.md
index 5cf89e0eb0f1d8..fef0e13ab4a76e 100644
--- a/doc/api/fs.md
+++ b/doc/api/fs.md
@@ -318,6 +318,10 @@ fd.createReadStream({ start: 90, end: 99 });
 
 <!-- YAML
 added: v16.11.0
+changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/50093
+    description: The `flush` option is now supported.
 -->
 
 * `options` {Object}
@@ -326,6 +330,8 @@ added: v16.11.0
   * `emitClose` {boolean} **Default:** `true`
   * `start` {integer}
   * `highWaterMark` {number} **Default:** `16384`
+  * `flush` {boolean} If `true`, the underlying file descriptor is flushed
+    prior to closing it. **Default:** `false`.
 * Returns: {fs.WriteStream}
 
 `options` may also include a `start` option to allow writing data at some
@@ -369,16 +375,20 @@ added: v10.0.0
 
 <!-- YAML
 added: v10.0.0
+changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/42835
+    description: Accepts bigint values as `position`.
 -->
 
 * `buffer` {Buffer|TypedArray|DataView} A buffer that will be filled with the
   file data read.
 * `offset` {integer} The location in the buffer at which to start filling.
 * `length` {integer} The number of bytes to read.
-* `position` {integer|null} The location where to begin reading data from the
-  file. If `null`, data will be read from the current file position, and
-  the position will be updated. If `position` is an integer, the current
-  file position will remain unchanged.
+* `position` {integer|bigint|null} The location where to begin reading data
+  from the file. If `null` or `-1`, data will be read from the current file
+  position, and the position will be updated. If `position` is a non-negative
+  integer, the current file position will remain unchanged.
 * Returns: {Promise} Fulfills upon success with an object with two properties:
   * `bytesRead` {integer} The number of bytes read
   * `buffer` {Buffer|TypedArray|DataView} A reference to the passed in `buffer`
@@ -395,6 +405,10 @@ number of bytes read is zero.
 added:
  - v13.11.0
  - v12.17.0
+changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/42835
+    description: Accepts bigint values as `position`.
 -->
 
 * `options` {Object}
@@ -404,10 +418,11 @@ added:
     **Default:** `0`
   * `length` {integer} The number of bytes to read. **Default:**
     `buffer.byteLength - offset`
-  * `position` {integer|null} The location where to begin reading data from the
-    file. If `null`, data will be read from the current file position, and
-    the position will be updated. If `position` is an integer, the current
-    file position will remain unchanged. **Default:**: `null`
+  * `position` {integer|bigint|null} The location where to begin reading data
+    from the file. If `null` or `-1`, data will be read from the current file
+    position, and the position will be updated. If `position` is a non-negative
+    integer, the current file position will remain unchanged.
+    **Default:**: `null`
 * Returns: {Promise} Fulfills upon success with an object with two properties:
   * `bytesRead` {integer} The number of bytes read
   * `buffer` {Buffer|TypedArray|DataView} A reference to the passed in `buffer`
@@ -424,6 +439,10 @@ number of bytes read is zero.
 added:
   - v18.2.0
   - v16.17.0
+changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/42835
+    description: Accepts bigint values as `position`.
 -->
 
 * `buffer` {Buffer|TypedArray|DataView} A buffer that will be filled with the
@@ -433,10 +452,11 @@ added:
     **Default:** `0`
   * `length` {integer} The number of bytes to read. **Default:**
     `buffer.byteLength - offset`
-  * `position` {integer} The location where to begin reading data from the
-    file. If `null`, data will be read from the current file position, and
-    the position will be updated. If `position` is an integer, the current
-    file position will remain unchanged. **Default:**: `null`
+  * `position` {integer|bigint|null} The location where to begin reading data
+    from the file. If `null` or `-1`, data will be read from the current file
+    position, and the position will be updated. If `position` is a non-negative
+    integer, the current file position will remain unchanged.
+    **Default:**: `null`
 * Returns: {Promise} Fulfills upon success with an object with two properties:
   * `bytesRead` {integer} The number of bytes read
   * `buffer` {Buffer|TypedArray|DataView} A reference to the passed in `buffer`
@@ -659,7 +679,7 @@ added: v10.0.0
 * Returns: {Promise}
 
 Change the file system timestamps of the object referenced by the {FileHandle}
-then resolves the promise with no arguments upon success.
+then fulfills the promise with no arguments upon success.
 
 #### `filehandle.write(buffer, offset[, length[, position]])`
 
@@ -685,14 +705,14 @@ changes:
 
 Write `buffer` to the file.
 
-The promise is resolved with an object containing two properties:
+The promise is fulfilled with an object containing two properties:
 
 * `bytesWritten` {integer} the number of bytes written
 * `buffer` {Buffer|TypedArray|DataView} a reference to the
   `buffer` written.
 
 It is unsafe to use `filehandle.write()` multiple times on the same file
-without waiting for the promise to be resolved (or rejected). For this
+without waiting for the promise to be fulfilled (or rejected). For this
 scenario, use [`filehandle.createWriteStream()`][].
 
 On Linux, positional writes do not work when the file is opened in append mode.
@@ -742,13 +762,13 @@ changes:
 Write `string` to the file. If `string` is not a string, the promise is
 rejected with an error.
 
-The promise is resolved with an object containing two properties:
+The promise is fulfilled with an object containing two properties:
 
 * `bytesWritten` {integer} the number of bytes written
 * `buffer` {string} a reference to the `string` written.
 
 It is unsafe to use `filehandle.write()` multiple times on the same file
-without waiting for the promise to be resolved (or rejected). For this
+without waiting for the promise to be fulfilled (or rejected). For this
 scenario, use [`filehandle.createWriteStream()`][].
 
 On Linux, positional writes do not work when the file is opened in append mode.
@@ -779,14 +799,14 @@ changes:
 
 Asynchronously writes data to a file, replacing the file if it already exists.
 `data` can be a string, a buffer, an {AsyncIterable}, or an {Iterable} object.
-The promise is resolved with no arguments upon success.
+The promise is fulfilled with no arguments upon success.
 
 If `options` is a string, then it specifies the `encoding`.
 
 The {FileHandle} has to support writing.
 
 It is unsafe to use `filehandle.writeFile()` multiple times on the same file
-without waiting for the promise to be resolved (or rejected).
+without waiting for the promise to be fulfilled (or rejected).
 
 If one or more `filehandle.write()` calls are made on a file handle and then a
 `filehandle.writeFile()` call is made, the data will be written from the
@@ -807,14 +827,14 @@ added: v12.9.0
 
 Write an array of {ArrayBufferView}s to the file.
 
-The promise is resolved with an object containing a two properties:
+The promise is fulfilled with an object containing a two properties:
 
 * `bytesWritten` {integer} the number of bytes written
 * `buffers` {Buffer\[]|TypedArray\[]|DataView\[]} a reference to the `buffers`
   input.
 
 It is unsafe to call `writev()` multiple times on the same file without waiting
-for the promise to be resolved (or rejected).
+for the promise to be fulfilled (or rejected).
 
 On Linux, positional writes don't work when the file is opened in append mode.
 The kernel ignores the position argument and always appends the data to
@@ -823,7 +843,9 @@ the end of the file.
 #### `filehandle[Symbol.asyncDispose]()`
 
 <!-- YAML
-added: v20.4.0
+added:
+ - v20.4.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
@@ -848,7 +870,7 @@ or a mask consisting of the bitwise OR of any of `fs.constants.R_OK`,
 `fs.constants.W_OK | fs.constants.R_OK`). Check [File access constants][] for
 possible values of `mode`.
 
-If the accessibility check is successful, the promise is resolved with no
+If the accessibility check is successful, the promise is fulfilled with no
 value. If any of the accessibility checks fail, the promise is rejected
 with an {Error} object. The following example checks if the file
 `/etc/passwd` can be read and written by the current process.
@@ -1306,7 +1328,9 @@ changes:
 * `options` {string|Object}
   * `encoding` {string} **Default:** `'utf8'`
   * `withFileTypes` {boolean} **Default:** `false`
-  * `recursive` {boolean} **Default:** `false`
+  * `recursive` {boolean} If `true`, reads the contents of a directory
+    recursively. In recursive mode, it will list all files, sub files, and
+    directories. **Default:** `false`.
 * Returns: {Promise}  Fulfills with an array of the names of the files in
   the directory excluding `'.'` and `'..'`.
 
@@ -1317,7 +1341,7 @@ object with an `encoding` property specifying the character encoding to use for
 the filenames. If the `encoding` is set to `'buffer'`, the filenames returned
 will be passed as {Buffer} objects.
 
-If `options.withFileTypes` is set to `true`, the resolved array will contain
+If `options.withFileTypes` is set to `true`, the returned array will contain
 {fs.Dirent} objects.
 
 ```mjs
@@ -1431,7 +1455,7 @@ added: v10.0.0
 * Returns: {Promise} Fulfills with the `linkString` upon success.
 
 Reads the contents of the symbolic link referred to by `path`. See the POSIX
-readlink(2) documentation for more detail. The promise is resolved with the
+readlink(2) documentation for more detail. The promise is fulfilled with the
 `linkString` upon success.
 
 The optional `options` argument can be a string specifying an encoding, or an
@@ -1726,6 +1750,9 @@ All the [caveats][] for `fs.watch()` also apply to `fsPromises.watch()`.
 <!-- YAML
 added: v10.0.0
 changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/50009
+    description: The `flush` option is now supported.
   - version:
       - v15.14.0
       - v14.18.0
@@ -1749,6 +1776,9 @@ changes:
   * `encoding` {string|null} **Default:** `'utf8'`
   * `mode` {integer} **Default:** `0o666`
   * `flag` {string} See [support of file system `flags`][]. **Default:** `'w'`.
+  * `flush` {boolean} If all data is successfully written to the file, and
+    `flush` is `true`, `filehandle.sync()` is used to flush the data.
+    **Default:** `false`.
   * `signal` {AbortSignal} allows aborting an in-progress writeFile
 * Returns: {Promise} Fulfills with `undefined` upon success.
 
@@ -1828,6 +1858,10 @@ concurrent modifications on the same file or data corruption may occur.
 <!-- YAML
 added: v0.11.15
 changes:
+  - version: v20.8.0
+    pr-url: https://github.com/nodejs/node/pull/49683
+    description: The constants `fs.F_OK`, `fs.R_OK`, `fs.W_OK` and `fs.X_OK`
+                 which were present directly on `fs` are deprecated.
   - version: v18.0.0
     pr-url: https://github.com/nodejs/node/pull/41678
     description: Passing an invalid callback to the `callback` argument
@@ -2512,6 +2546,9 @@ If `options` is a string, then it specifies the encoding.
 <!-- YAML
 added: v0.1.31
 changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/50093
+    description: The `flush` option is now supported.
   - version: v16.10.0
     pr-url: https://github.com/nodejs/node/pull/40013
     description: The `fs` option does not need `open` method if an `fd` was provided.
@@ -2565,6 +2602,8 @@ changes:
   * `fs` {Object|null} **Default:** `null`
   * `signal` {AbortSignal|null} **Default:** `null`
   * `highWaterMark` {number} **Default:** `16384`
+  * `flush` {boolean} If `true`, the underlying file descriptor is flushed
+    prior to closing it. **Default:** `false`.
 * Returns: {fs.WriteStream}
 
 `options` may also include a `start` option to allow writing data at some
@@ -3508,8 +3547,8 @@ changes:
 * `length` {integer} The number of bytes to read.
 * `position` {integer|bigint|null} Specifies where to begin reading from in the
   file. If `position` is `null` or `-1 `, data will be read from the current
-  file position, and the file position will be updated. If `position` is an
-  integer, the file position will be unchanged.
+  file position, and the file position will be updated. If `position` is
+  a non-negative integer, the file position will be unchanged.
 * `callback` {Function}
   * `err` {Error}
   * `bytesRead` {integer}
@@ -3618,7 +3657,9 @@ changes:
 * `options` {string|Object}
   * `encoding` {string} **Default:** `'utf8'`
   * `withFileTypes` {boolean} **Default:** `false`
-  * `recursive` {boolean} **Default:** `false`
+  * `recursive` {boolean} If `true`, reads the contents of a directory
+    recursively. In recursive mode, it will list all files, sub files and
+    directories. **Default:** `false`.
 * `callback` {Function}
   * `err` {Error}
   * `files` {string\[]|Buffer\[]|fs.Dirent\[]}
@@ -4859,6 +4900,9 @@ details.
 <!-- YAML
 added: v0.1.29
 changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/50009
+    description: The `flush` option is now supported.
   - version: v19.0.0
     pr-url: https://github.com/nodejs/node/pull/42796
     description: Passing to the `string` parameter an object with an own
@@ -4916,6 +4960,9 @@ changes:
   * `encoding` {string|null} **Default:** `'utf8'`
   * `mode` {integer} **Default:** `0o666`
   * `flag` {string} See [support of file system `flags`][]. **Default:** `'w'`.
+  * `flush` {boolean} If all data is successfully written to the file, and
+    `flush` is `true`, `fs.fsync()` is used to flush the data.
+    **Default:** `false`.
   * `signal` {AbortSignal} allows aborting an in-progress writeFile
 * `callback` {Function}
   * `err` {Error|AggregateError}
@@ -5685,7 +5732,9 @@ changes:
 * `options` {string|Object}
   * `encoding` {string} **Default:** `'utf8'`
   * `withFileTypes` {boolean} **Default:** `false`
-  * `recursive` {boolean} **Default:** `false`
+  * `recursive` {boolean} If `true`, reads the contents of a directory
+    recursively. In recursive mode, it will list all files, sub files, and
+    directories. **Default:** `false`.
 * Returns: {string\[]|Buffer\[]|fs.Dirent\[]}
 
 Reads the contents of the directory.
@@ -6147,6 +6196,9 @@ this API: [`fs.utimes()`][].
 <!-- YAML
 added: v0.1.29
 changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/50009
+    description: The `flush` option is now supported.
   - version: v19.0.0
     pr-url: https://github.com/nodejs/node/pull/42796
     description: Passing to the `data` parameter an object with an own
@@ -6181,8 +6233,9 @@ changes:
   * `encoding` {string|null} **Default:** `'utf8'`
   * `mode` {integer} **Default:** `0o666`
   * `flag` {string} See [support of file system `flags`][]. **Default:** `'w'`.
-
-Returns `undefined`.
+  * `flush` {boolean} If all data is successfully written to the file, and
+    `flush` is `true`, `fs.fsyncSync()` is used to flush the data.
+    Returns `undefined`.
 
 The `mode` option only affects the newly created file. See [`fs.open()`][]
 for more details.
@@ -6319,7 +6372,7 @@ added: v12.12.0
 Asynchronously close the directory's underlying resource handle.
 Subsequent reads will result in errors.
 
-A promise is returned that will be resolved after the resource has been
+A promise is returned that will be fulfilled after the resource has been
 closed.
 
 #### `dir.close(callback)`
@@ -6373,7 +6426,7 @@ added: v12.12.0
 Asynchronously read the next directory entry via readdir(3) as an
 {fs.Dirent}.
 
-A promise is returned that will be resolved with an {fs.Dirent}, or `null`
+A promise is returned that will be fulfilled with an {fs.Dirent}, or `null`
 if there are no more directory entries to read.
 
 Directory entries returned by this function are in no particular order as
diff --git a/doc/api/globals.md b/doc/api/globals.md
index 9e2e1d0761a8d1..0ca27111db49e1 100644
--- a/doc/api/globals.md
+++ b/doc/api/globals.md
@@ -478,13 +478,16 @@ added:
   - v17.5.0
   - v16.15.0
 changes:
+  - version:
+    - v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/45684
+    description: No longer experimental.
   - version: v18.0.0
     pr-url: https://github.com/nodejs/node/pull/41811
     description: No longer behind `--experimental-global-fetch` CLI flag.
 -->
 
-> Stability: 1 - Experimental. Disable this API with the [`--no-experimental-fetch`][]
-> CLI flag.
+> Stability: 2 - Stable
 
 A browser-compatible implementation of the [`fetch()`][] function.
 
@@ -505,13 +508,16 @@ added:
   - v17.6.0
   - v16.15.0
 changes:
+  - version:
+    - v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/45684
+    description: No longer experimental.
   - version: v18.0.0
     pr-url: https://github.com/nodejs/node/pull/41811
     description: No longer behind `--experimental-global-fetch` CLI flag.
 -->
 
-> Stability: 1 - Experimental. Disable this API with the [`--no-experimental-fetch`][]
-> CLI flag.
+> Stability: 2 - Stable
 
 A browser-compatible implementation of {FormData}.
 
@@ -541,13 +547,16 @@ added:
   - v17.5.0
   - v16.15.0
 changes:
+  - version:
+    - v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/45684
+    description: No longer experimental.
   - version: v18.0.0
     pr-url: https://github.com/nodejs/node/pull/41811
     description: No longer behind `--experimental-global-fetch` CLI flag.
 -->
 
-> Stability: 1 - Experimental. Disable this API with the [`--no-experimental-fetch`][]
-> CLI flag.
+> Stability: 2 - Stable
 
 A browser-compatible implementation of {Headers}.
 
@@ -588,7 +597,7 @@ This variable may appear to be global but is not. See [`module`][].
 ## `Navigator`
 
 <!-- YAML
-added: REPLACEME
+added: v21.0.0
 -->
 
 > Stability: 1 - Experimental
@@ -598,7 +607,7 @@ A partial implementation of the [Navigator API][].
 ## `navigator`
 
 <!-- YAML
-added: REPLACEME
+added: v21.0.0
 -->
 
 > Stability: 1 - Experimental
@@ -608,7 +617,7 @@ A partial implementation of [`window.navigator`][].
 ### `navigator.hardwareConcurrency`
 
 <!-- YAML
-added: REPLACEME
+added: v21.0.0
 -->
 
 * {number}
@@ -813,13 +822,16 @@ added:
   - v17.5.0
   - v16.15.0
 changes:
+  - version:
+    - v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/45684
+    description: No longer experimental.
   - version: v18.0.0
     pr-url: https://github.com/nodejs/node/pull/41811
     description: No longer behind `--experimental-global-fetch` CLI flag.
 -->
 
-> Stability: 1 - Experimental. Disable this API with the [`--no-experimental-fetch`][]
-> CLI flag.
+> Stability: 2 - Stable
 
 A browser-compatible implementation of {Response}.
 
@@ -830,13 +842,16 @@ added:
   - v17.5.0
   - v16.15.0
 changes:
+  - version:
+    - v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/45684
+    description: No longer experimental.
   - version: v18.0.0
     pr-url: https://github.com/nodejs/node/pull/41811
     description: No longer behind `--experimental-global-fetch` CLI flag.
 -->
 
-> Stability: 1 - Experimental. Disable this API with the [`--no-experimental-fetch`][]
-> CLI flag.
+> Stability: 2 - Stable
 
 A browser-compatible implementation of {Request}.
 
@@ -1003,6 +1018,17 @@ The object that acts as the namespace for all W3C
 [WebAssembly][webassembly-org] related functionality. See the
 [Mozilla Developer Network][webassembly-mdn] for usage and compatibility.
 
+## `WebSocket`
+
+<!-- YAML
+added: v21.0.0
+-->
+
+> Stability: 1 - Experimental.
+
+A browser-compatible implementation of [`WebSocket`][]. Enable this API
+with the [`--experimental-websocket`][] CLI flag.
+
 ## Class: `WritableStream`
 
 <!-- YAML
@@ -1037,7 +1063,7 @@ A browser-compatible implementation of [`WritableStreamDefaultWriter`][].
 [ECMAScript module]: esm.md
 [Navigator API]: https://html.spec.whatwg.org/multipage/system-state.html#the-navigator-object
 [Web Crypto API]: webcrypto.md
-[`--no-experimental-fetch`]: cli.md#--no-experimental-fetch
+[`--experimental-websocket`]: cli.md#--experimental-websocket
 [`--no-experimental-global-customevent`]: cli.md#--no-experimental-global-customevent
 [`--no-experimental-global-webcrypto`]: cli.md#--no-experimental-global-webcrypto
 [`AbortController`]: https://developer.mozilla.org/en-US/docs/Web/API/AbortController
@@ -1071,6 +1097,7 @@ A browser-compatible implementation of [`WritableStreamDefaultWriter`][].
 [`TransformStream`]: webstreams.md#class-transformstream
 [`URLSearchParams`]: url.md#class-urlsearchparams
 [`URL`]: url.md#class-url
+[`WebSocket`]: https://developer.mozilla.org/en-US/docs/Web/API/WebSocket
 [`WritableStreamDefaultController`]: webstreams.md#class-writablestreamdefaultcontroller
 [`WritableStreamDefaultWriter`]: webstreams.md#class-writablestreamdefaultwriter
 [`WritableStream`]: webstreams.md#class-writablestream
diff --git a/doc/api/http.md b/doc/api/http.md
index c5d7345330ecd7..ce761af7561198 100644
--- a/doc/api/http.md
+++ b/doc/api/http.md
@@ -3449,9 +3449,9 @@ changes:
     `readableHighWaterMark` and `writableHighWaterMark`. This affects
     `highWaterMark` property of both `IncomingMessage` and `ServerResponse`.
     **Default:** See [`stream.getDefaultHighWaterMark()`][].
-  * `insecureHTTPParser` {boolean} Use an insecure HTTP parser that accepts
-    invalid HTTP headers when `true`. Using the insecure parser should be
-    avoided. See [`--insecure-http-parser`][] for more information.
+  * `insecureHTTPParser` {boolean} If set to `true`, it will use a HTTP parser
+    with leniency flags enabled. Using the insecure parser should be avoided.
+    See [`--insecure-http-parser`][] for more information.
     **Default:** `false`.
   * `IncomingMessage` {http.IncomingMessage} Specifies the `IncomingMessage`
     class to be used. Useful for extending the original `IncomingMessage`.
@@ -3742,9 +3742,9 @@ changes:
     request to. **Default:** `'localhost'`.
   * `hostname` {string} Alias for `host`. To support [`url.parse()`][],
     `hostname` will be used if both `host` and `hostname` are specified.
-  * `insecureHTTPParser` {boolean} Use an insecure HTTP parser that accepts
-    invalid HTTP headers when `true`. Using the insecure parser should be
-    avoided. See [`--insecure-http-parser`][] for more information.
+  * `insecureHTTPParser` {boolean} If set to `true`, it will use a HTTP parser
+    with leniency flags enabled. Using the insecure parser should be avoided.
+    See [`--insecure-http-parser`][] for more information.
     **Default:** `false`
   * `joinDuplicateHeaders` {boolean} It joins the field line values of
     multiple headers in a request with `, ` instead of discarding
diff --git a/doc/api/intl.md b/doc/api/intl.md
index 3af63ae8a19bd7..ec3e26db3b4c1e 100644
--- a/doc/api/intl.md
+++ b/doc/api/intl.md
@@ -113,27 +113,47 @@ This mode provides a balance between features and binary size.
 
 If the `small-icu` option is used, one can still provide additional locale data
 at runtime so that the JS methods would work for all ICU locales. Assuming the
-data file is stored at `/some/directory`, it can be made available to ICU
-through either:
+data file is stored at `/runtime/directory/with/dat/file`, it can be made
+available to ICU through either:
+
+* The `--with-icu-default-data-dir` configure option:
+
+  ```bash
+  ./configure --with-icu-default-data-dir=/runtime/directory/with/dat/file --with-intl=small-icu
+  ```
+
+  This only embeds the default data directory path into the binary.
+  The actual data file is going to be loaded at runtime from this directory
+  path.
 
 * The [`NODE_ICU_DATA`][] environment variable:
 
   ```bash
-  env NODE_ICU_DATA=/some/directory node
+  env NODE_ICU_DATA=/runtime/directory/with/dat/file node
   ```
 
 * The [`--icu-data-dir`][] CLI parameter:
 
   ```bash
-  node --icu-data-dir=/some/directory
+  node --icu-data-dir=/runtime/directory/with/dat/file
   ```
 
-(If both are specified, the `--icu-data-dir` CLI parameter takes precedence.)
+When more than one of them is specified, the `--icu-data-dir` CLI parameter has
+the highest precedence, then the `NODE_ICU_DATA`  environment variable, then
+the `--with-icu-default-data-dir` configure option.
 
 ICU is able to automatically find and load a variety of data formats, but the
 data must be appropriate for the ICU version, and the file correctly named.
-The most common name for the data file is `icudt6X[bl].dat`, where `6X` denotes
+The most common name for the data file is `icudtX[bl].dat`, where `X` denotes
 the intended ICU version, and `b` or `l` indicates the system's endianness.
+Node.js would fail to load if the expected data file cannot be read from the
+specified directory. The name of the data file corresponding to the current
+Node.js version can be computed with:
+
+```js
+`icudt${process.versions.icu.split('.')[0]}${os.endianness()[0].toLowerCase()}.dat`;
+```
+
 Check ["ICU Data"][] article in the ICU User Guide for other supported formats
 and more details on ICU data in general.
 
diff --git a/doc/api/module.md b/doc/api/module.md
index 0f44eac1c41f43..f4338028abe31d 100644
--- a/doc/api/module.md
+++ b/doc/api/module.md
@@ -84,14 +84,18 @@ isBuiltin('wss'); // false
 
 <!-- YAML
 added: v20.6.0
+changes:
+  - version: v20.8.0
+    pr-url: https://github.com/nodejs/node/pull/49655
+    description: Add support for WHATWG URL instances.
 -->
 
 > Stability: 1.2 - Release candidate
 
-* `specifier` {string} Customization hooks to be registered; this should be the
-  same string that would be passed to `import()`, except that if it is relative,
-  it is resolved relative to `parentURL`.
-* `parentURL` {string} If you want to resolve `specifier` relative to a base
+* `specifier` {string|URL} Customization hooks to be registered; this should be
+  the same string that would be passed to `import()`, except that if it is
+  relative, it is resolved relative to `parentURL`.
+* `parentURL` {string|URL} If you want to resolve `specifier` relative to a base
   URL, such as `import.meta.url`, you can pass that URL here. **Default:**
   `'data:'`
 * `options` {Object}
@@ -149,9 +153,6 @@ import('node:fs').then((esmFS) => {
 <!-- YAML
 added: v8.8.0
 changes:
-  - version: REPLACEME
-    pr-url: https://github.com/nodejs/node/pull/49144
-    description: Removed `globalPreload`.
   - version: v20.6.0
     pr-url: https://github.com/nodejs/node/pull/48842
     description: Added `initialize` hook to replace `globalPreload`.
@@ -457,6 +458,11 @@ register('./path-to-my-hooks.js', {
 
 <!-- YAML
 changes:
+  - version: v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/50140
+    description: The property `context.importAssertions` is replaced with
+                 `context.importAttributes`. Using the old name is still
+                 supported and will emit an experimental warning.
   - version:
     - v18.6.0
     - v16.17.0
@@ -476,8 +482,8 @@ changes:
 * `specifier` {string}
 * `context` {Object}
   * `conditions` {string\[]} Export conditions of the relevant `package.json`
-  * `importAssertions` {Object} An object whose key-value pairs represent the
-    assertions for the module to import
+  * `importAttributes` {Object} An object whose key-value pairs represent the
+    attributes for the module to import
   * `parentURL` {string|undefined} The module importing this one, or undefined
     if this is the Node.js entry point
 * `nextResolve` {Function} The subsequent `resolve` hook in the chain, or the
@@ -488,7 +494,7 @@ changes:
   * `format` {string|null|undefined} A hint to the load hook (it might be
     ignored)
     `'builtin' | 'commonjs' | 'json' | 'module' | 'wasm'`
-  * `importAssertions` {Object|undefined} The import assertions to use when
+  * `importAttributes` {Object|undefined} The import attributes to use when
     caching the module (optional; if excluded the input will be used)
   * `shortCircuit` {undefined|boolean} A signal that this hook intends to
     terminate the chain of `resolve` hooks. **Default:** `false`
@@ -505,10 +511,10 @@ the final `format` value (and it is free to ignore the hint provided by
 `resolve`); if `resolve` provides a `format`, a custom `load` hook is required
 even if only to pass the value to the Node.js default `load` hook.
 
-Import type assertions are part of the cache key for saving loaded modules into
+Import type attributes are part of the cache key for saving loaded modules into
 the internal module cache. The `resolve` hook is responsible for returning an
-`importAssertions` object if the module should be cached with different
-assertions than were present in the source code.
+`importAttributes` object if the module should be cached with different
+attributes than were present in the source code.
 
 The `conditions` property in `context` is an array of conditions for
 [package exports conditions][Conditional exports] that apply to this resolution
@@ -574,7 +580,7 @@ changes:
   * `conditions` {string\[]} Export conditions of the relevant `package.json`
   * `format` {string|null|undefined} The format optionally supplied by the
     `resolve` hook chain
-  * `importAssertions` {Object}
+  * `importAttributes` {Object}
 * `nextLoad` {Function} The subsequent `load` hook in the chain, or the
   Node.js default `load` hook after the last user-supplied `load` hook
   * `specifier` {string}
diff --git a/doc/api/n-api.md b/doc/api/n-api.md
index 10b6dac61c4490..dd1bc884e506a8 100644
--- a/doc/api/n-api.md
+++ b/doc/api/n-api.md
@@ -2843,7 +2843,9 @@ The JavaScript `string` type is described in
 #### `node_api_create_external_string_latin1`
 
 <!-- YAML
-added: v20.4.0
+added:
+ - v20.4.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
@@ -2921,7 +2923,9 @@ The JavaScript `string` type is described in
 #### `node_api_create_external_string_utf16`
 
 <!-- YAML
-added: v20.4.0
+added:
+ - v20.4.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
@@ -5424,6 +5428,42 @@ invocation. If it is deleted before then, then the finalize callback may never
 be invoked. Therefore, when obtaining a reference a finalize callback is also
 required in order to enable correct disposal of the reference.
 
+#### `node_api_post_finalizer`
+
+<!-- YAML
+added: v21.0.0
+-->
+
+> Stability: 1 - Experimental
+
+```c
+napi_status node_api_post_finalizer(napi_env env,
+                                    napi_finalize finalize_cb,
+                                    void* finalize_data,
+                                    void* finalize_hint);
+```
+
+* `[in] env`: The environment that the API is invoked under.
+* `[in] finalize_cb`: Native callback that will be used to free the
+  native data when the JavaScript object has been garbage-collected.
+  [`napi_finalize`][] provides more details.
+* `[in] finalize_data`: Optional data to be passed to `finalize_cb`.
+* `[in] finalize_hint`: Optional contextual hint that is passed to the
+  finalize callback.
+
+Returns `napi_ok` if the API succeeded.
+
+Schedules a `napi_finalize` callback to be called asynchronously in the
+event loop.
+
+Normally, finalizers are called while the GC (garbage collector) collects
+objects. At that point calling any Node-API that may cause changes in the GC
+state will be disabled and will crash Node.js.
+
+`node_api_post_finalizer` helps to work around this limitation by allowing the
+add-on to defer calls to such Node-APIs to a point in time outside of the GC
+finalization.
+
 ## Simple asynchronous operations
 
 Addon modules often need to leverage async helpers from libuv as part of their
@@ -6245,6 +6285,13 @@ napi_create_threadsafe_function(napi_env env,
   [`napi_threadsafe_function_call_js`][] provides more details.
 * `[out] result`: The asynchronous thread-safe JavaScript function.
 
+**Change History:**
+
+* Experimental (`NAPI_EXPERIMENTAL` is defined):
+
+  Uncaught exceptions thrown in `call_js_cb` are handled with the
+  [`'uncaughtException'`][] event, instead of being ignored.
+
 ### `napi_get_threadsafe_function_context`
 
 <!-- YAML
@@ -6475,6 +6522,7 @@ the add-on's file name during loading.
 [Visual Studio]: https://visualstudio.microsoft.com
 [Working with JavaScript properties]: #working-with-javascript-properties
 [Xcode]: https://developer.apple.com/xcode/
+[`'uncaughtException'`]: process.md#event-uncaughtexception
 [`Number.MAX_SAFE_INTEGER`]: https://tc39.github.io/ecma262/#sec-number.max_safe_integer
 [`Number.MIN_SAFE_INTEGER`]: https://tc39.github.io/ecma262/#sec-number.min_safe_integer
 [`Worker`]: worker_threads.md#class-worker
diff --git a/doc/api/net.md b/doc/api/net.md
index cfd11926057215..23f2096049b0e0 100644
--- a/doc/api/net.md
+++ b/doc/api/net.md
@@ -360,7 +360,9 @@ was not open when it was closed.
 ### `server[Symbol.asyncDispose]()`
 
 <!-- YAML
-added: v20.5.0
+added:
+ - v20.5.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
@@ -577,7 +579,7 @@ added: v5.7.0
 <!-- YAML
 added: v0.2.0
 changes:
-  - version: REPLACEME
+  - version: v21.0.0
     pr-url: https://github.com/nodejs/node/pull/48276
     description: Setting `maxConnections` to `0` drops all the incoming
                  connections. Previously, it was interpreted as `Infinity`.
@@ -799,7 +801,9 @@ socket as reported by the operating system:
 ### `socket.autoSelectFamilyAttemptedAddresses`
 
 <!-- YAML
-added: v19.4.0
+added:
+ - v19.4.0
+ - v18.18.0
 -->
 
 * {string\[]}
@@ -886,7 +890,9 @@ behavior.
 <!-- YAML
 added: v0.1.90
 changes:
-  - version: v20.0.0
+  - version:
+      - v20.0.0
+      - v18.18.0
     pr-url: https://github.com/nodejs/node/pull/46790
     description: The default value for the autoSelectFamily option is now true.
                  The `--enable-network-family-autoselection` CLI flag has been renamed
@@ -1679,7 +1685,9 @@ Sets the default value of the `autoSelectFamily` option of [`socket.connect(opt
 ## `net.getDefaultAutoSelectFamilyAttemptTimeout()`
 
 <!-- YAML
-added: v19.8.0
+added:
+ - v19.8.0
+ - v18.18.0
 -->
 
 Gets the current default value of the `autoSelectFamilyAttemptTimeout` option of [`socket.connect(options)`][].
@@ -1690,7 +1698,9 @@ The initial default value is `250`.
 ## `net.setDefaultAutoSelectFamilyAttemptTimeout(value)`
 
 <!-- YAML
-added: v19.8.0
+added:
+ - v19.8.0
+ - v18.18.0
 -->
 
 Sets the default value of the `autoSelectFamilyAttemptTimeout` option of [`socket.connect(options)`][].
diff --git a/doc/api/os.md b/doc/api/os.md
index a02726fb7c2eb1..550ae7659de5f5 100644
--- a/doc/api/os.md
+++ b/doc/api/os.md
@@ -50,8 +50,9 @@ added: v0.5.0
 * Returns: {string}
 
 Returns the operating system CPU architecture for which the Node.js binary was
-compiled. Possible values are `'arm'`, `'arm64'`, `'ia32'`, `'mips'`,
-`'mipsel'`, `'ppc'`, `'ppc64'`, `'riscv64'`, `'s390'`, `'s390x'`, and `'x64'`.
+compiled. Possible values are `'arm'`, `'arm64'`, `'ia32'`, `'loong64'`,
+`'mips'`, `'mipsel'`, `'ppc'`, `'ppc64'`, `'riscv64'`, `'s390'`, `'s390x'`,
+and `'x64'`.
 
 The return value is equivalent to [`process.arch`][].
 
diff --git a/doc/api/packages.md b/doc/api/packages.md
index a42e1e041a00b6..9f55cbbb15939f 100644
--- a/doc/api/packages.md
+++ b/doc/api/packages.md
@@ -55,6 +55,8 @@ along with a reference for the [`package.json`][] fields defined by Node.js.
 
 ## Determining module system
 
+### Introduction
+
 Node.js will treat the following as [ES modules][] when passed to `node` as the
 initial input, or when referenced by `import` statements or `import()`
 expressions:
@@ -67,14 +69,9 @@ expressions:
 * Strings passed in as an argument to `--eval`, or piped to `node` via `STDIN`,
   with the flag `--input-type=module`.
 
-Node.js will treat as [CommonJS][] all other forms of input, such as `.js` files
-where the nearest parent `package.json` file contains no top-level `"type"`
-field, or string input without the flag `--input-type`. This behavior is to
-preserve backward compatibility. However, now that Node.js supports both
-CommonJS and ES modules, it is best to be explicit whenever possible. Node.js
-will treat the following as CommonJS when passed to `node` as the initial input,
-or when referenced by `import` statements, `import()` expressions, or
-`require()` expressions:
+Node.js will treat the following as [CommonJS][] when passed to `node` as the
+initial input, or when referenced by `import` statements or `import()`
+expressions:
 
 * Files with a `.cjs` extension.
 
@@ -84,11 +81,30 @@ or when referenced by `import` statements, `import()` expressions, or
 * Strings passed in as an argument to `--eval` or `--print`, or piped to `node`
   via `STDIN`, with the flag `--input-type=commonjs`.
 
-Package authors should include the [`"type"`][] field, even in packages where
-all sources are CommonJS. Being explicit about the `type` of the package will
-future-proof the package in case the default type of Node.js ever changes, and
-it will also make things easier for build tools and loaders to determine how the
-files in the package should be interpreted.
+Aside from these explicit cases, there are other cases where Node.js defaults to
+one module system or the other based on the value of the
+[`--experimental-default-type`][] flag:
+
+* Files ending in `.js` or with no extension, if there is no `package.json` file
+  present in the same folder or any parent folder.
+
+* Files ending in `.js` or with no extension, if the nearest parent
+  `package.json` field lacks a `"type"` field; unless the folder is inside a
+  `node_modules` folder. (Package scopes under `node_modules` are always treated
+  as CommonJS when the `package.json` file lacks a `"type"` field, regardless
+  of `--experimental-default-type`, for backward compatibility.)
+
+* Strings passed in as an argument to `--eval` or piped to `node` via `STDIN`,
+  when `--input-type` is unspecified.
+
+This flag currently defaults to `"commonjs"`, but it may change in the future to
+default to `"module"`. For this reason it is best to be explicit wherever
+possible; in particular, package authors should always include the [`"type"`][]
+field in their `package.json` files, even in packages where all sources are
+CommonJS. Being explicit about the `type` of the package will future-proof the
+package in case the default type of Node.js ever changes, and it will also make
+things easier for build tools and loaders to determine how the files in the
+package should be interpreted.
 
 ### Modules loaders
 
@@ -1337,6 +1353,7 @@ This field defines [subpath imports][] for the current package.
 [`"packageManager"`]: #packagemanager
 [`"type"`]: #type
 [`--conditions` / `-C` flag]: #resolving-user-conditions
+[`--experimental-default-type`]: cli.md#--experimental-default-typetype
 [`--no-addons` flag]: cli.md#--no-addons
 [`ERR_PACKAGE_PATH_NOT_EXPORTED`]: errors.md#err_package_path_not_exported
 [`esm`]: https://github.com/standard-things/esm#readme
diff --git a/doc/api/permissions.md b/doc/api/permissions.md
index 33e24f49dd5a7e..92d4a6f4d0a2d8 100644
--- a/doc/api/permissions.md
+++ b/doc/api/permissions.md
@@ -468,7 +468,7 @@ Additionally, import maps only work on `import` so it may be desirable to add a
 
 <!-- type=misc -->
 
-> Stability: 1 - Experimental
+> Stability: 1.1 - Active development
 
 <!-- name=permission-model -->
 
@@ -568,9 +568,18 @@ There are constraints you need to know before using this system:
 * Relative paths are not supported through the CLI (`--allow-fs-*`).
 * The model does not inherit to a child node process.
 * The model does not inherit to a worker thread.
+* Symbolic links will be followed even to locations outside of the set of paths
+  that access has been granted to. Relative symbolic links may allow access to
+  arbitrary files and directories. When starting applications with the
+  permission model enabled, you must ensure that no paths to which access has
+  been granted contain relative symbolic links.
 * When creating symlinks the target (first argument) should have read and
   write access.
 * Permission changes are not retroactively applied to existing resources.
+* The Permission Model is initialized after the Node.js environment is set up.
+  However, certain flags such as `--env-file` or `--openssl-config` are designed
+  to read files before environment initialization. As a result, such flags are
+  not subject to the rules of the Permission Model.
 
 [Import maps]: https://url.spec.whatwg.org/#relative-url-with-fragment-string
 [Security Policy]: https://github.com/nodejs/node/blob/main/SECURITY.md
diff --git a/doc/api/process.md b/doc/api/process.md
index 5c1ab8f68e7fa5..f0ce10fa9f071a 100644
--- a/doc/api/process.md
+++ b/doc/api/process.md
@@ -873,8 +873,8 @@ added: v0.5.0
 * {string}
 
 The operating system CPU architecture for which the Node.js binary was compiled.
-Possible values are: `'arm'`, `'arm64'`, `'ia32'`, `'mips'`,`'mipsel'`, `'ppc'`,
-`'ppc64'`, `'riscv64'`, `'s390'`, `'s390x'`, and `'x64'`.
+Possible values are: `'arm'`, `'arm64'`, `'ia32'`, `'loong64'`, `'mips'`,
+`'mipsel'`, `'ppc'`, `'ppc64'`, `'riscv64'`, `'s390'`, `'s390x'`, and `'x64'`.
 
 ```mjs
 import { arch } from 'node:process';
@@ -3523,7 +3523,7 @@ Using this function is mutually exclusive with using the deprecated
 ## `process.sourceMapsEnabled`
 
 <!-- YAML
-added: REPLACEME
+added: v20.7.0
 -->
 
 > Stability: 1 - Experimental
diff --git a/doc/api/stream.md b/doc/api/stream.md
index 8d046f11b60153..b9c4b4c2ac86f0 100644
--- a/doc/api/stream.md
+++ b/doc/api/stream.md
@@ -1907,7 +1907,9 @@ has less then 64 KiB of data because no `highWaterMark` option is provided to
 ##### `readable[Symbol.asyncDispose]()`
 
 <!-- YAML
-added: v20.4.0
+added:
+ - v20.4.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
@@ -2013,7 +2015,7 @@ added:
   - v17.4.0
   - v16.14.0
 changes:
-  - version: REPLACEME
+  - version: v20.7.0
     pr-url: https://github.com/nodejs/node/pull/49249
     description: added `highWaterMark` in options.
 -->
@@ -2066,7 +2068,7 @@ added:
   - v17.4.0
   - v16.14.0
 changes:
-  - version: REPLACEME
+  - version: v20.7.0
     pr-url: https://github.com/nodejs/node/pull/49249
     description: added `highWaterMark` in options.
 -->
diff --git a/doc/api/synopsis.md b/doc/api/synopsis.md
index 26aba04f535e21..dda2c5285dc605 100644
--- a/doc/api/synopsis.md
+++ b/doc/api/synopsis.md
@@ -71,7 +71,8 @@ server.listen(port, hostname, () => {
 });
 ```
 
-Save the file, go back to the terminal window, and enter the following command:
+Save the file. Then, in the terminal window, to run the `hello-world.js` file,
+enter:
 
 ```bash
 node hello-world.js
diff --git a/doc/api/test.md b/doc/api/test.md
index d84d4c9f81a501..b310cf993f7e8f 100644
--- a/doc/api/test.md
+++ b/doc/api/test.md
@@ -44,7 +44,7 @@ processed in one of three ways:
 1. A synchronous function that is considered failing if it throws an exception,
    and is considered passing otherwise.
 2. A function that returns a `Promise` that is considered failing if the
-   `Promise` rejects, and is considered passing if the `Promise` resolves.
+   `Promise` rejects, and is considered passing if the `Promise` fulfills.
 3. A function that receives a callback function. If the callback receives any
    truthy value as its first argument, the test is considered failing. If a
    falsy value is passed as the first argument to the callback, the test is
@@ -67,7 +67,7 @@ test('synchronous failing test', (t) => {
 
 test('asynchronous passing test', async (t) => {
   // This test passes because the Promise returned by the async
-  // function is not rejected.
+  // function is settled and not rejected.
   assert.strictEqual(1, 1);
 });
 
@@ -350,11 +350,12 @@ in the [test runner execution model][] section.
 
 ### Test runner execution model
 
-Each matching test file is executed in a separate child process. If the child
-process finishes with an exit code of 0, the test is considered passing.
-Otherwise, the test is considered to be a failure. Test files must be
-executable by Node.js, but are not required to use the `node:test` module
-internally.
+Each matching test file is executed in a separate child process. The maximum
+number of child processes running at any time is controlled by the
+[`--test-concurrency`][] flag. If the child process finishes with an exit code
+of 0, the test is considered passing. Otherwise, the test is considered to be a
+failure. Test files must be executable by Node.js, but are not required to use
+the `node:test` module internally.
 
 Each test file is executed as if it was a regular script. That is, if the test
 file itself uses `node:test` to define tests, all of those tests will be
@@ -887,6 +888,8 @@ changes:
     number. If a nullish value is provided, each process gets its own port,
     incremented from the primary's `process.debugPort`.
     **Default:** `undefined`.
+  * `only`: {boolean} If truthy, the test context will only run tests that
+    have the `only` option set
   * `setup` {Function} A function that accepts the `TestsStream` instance
     and can be used to setup listeners before any tests are run.
     **Default:** `undefined`.
@@ -982,7 +985,7 @@ changes:
   to this function is a [`TestContext`][] object. If the test uses callbacks,
   the callback function is passed as the second argument. **Default:** A no-op
   function.
-* Returns: {Promise} Resolved with `undefined` once
+* Returns: {Promise} Fulfilled with `undefined` once
   the test completes, or immediately if the test runs within [`describe()`][].
 
 The `test()` function is the value imported from the `test` module. Each
@@ -992,8 +995,8 @@ The `TestContext` object passed to the `fn` argument can be used to perform
 actions related to the current test. Examples include skipping the test, adding
 additional diagnostic information, or creating subtests.
 
-`test()` returns a `Promise` that resolves once the test completes.
-if `test()` is called within a `describe()` block, it resolve immediately.
+`test()` returns a `Promise` that fulfills once the test completes.
+if `test()` is called within a `describe()` block, it fulfills immediately.
 The return value can usually be discarded for top level tests.
 However, the return value from subtests should be used to prevent the parent
 test from finishing first and cancelling the subtest
@@ -2495,7 +2498,7 @@ changes:
   to this function is a [`TestContext`][] object. If the test uses callbacks,
   the callback function is passed as the second argument. **Default:** A no-op
   function.
-* Returns: {Promise} Resolved with `undefined` once the test completes.
+* Returns: {Promise} Fulfilled with `undefined` once the test completes.
 
 This function is used to create subtests under the current test. This function
 behaves in the same fashion as the top level [`test()`][] function.
@@ -2549,6 +2552,7 @@ added:
 [TTY]: tty.md
 [`--experimental-test-coverage`]: cli.md#--experimental-test-coverage
 [`--import`]: cli.md#--importmodule
+[`--test-concurrency`]: cli.md#--test-concurrency
 [`--test-name-pattern`]: cli.md#--test-name-pattern
 [`--test-only`]: cli.md#--test-only
 [`--test-reporter-destination`]: cli.md#--test-reporter-destination
diff --git a/doc/api/timers.md b/doc/api/timers.md
index 5116ce6989b293..3789e9efd00906 100644
--- a/doc/api/timers.md
+++ b/doc/api/timers.md
@@ -66,7 +66,9 @@ invoked. Calling `immediate.unref()` multiple times will have no effect.
 ### `immediate[Symbol.dispose]()`
 
 <!-- YAML
-added: v20.5.0
+added:
+ - v20.5.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
@@ -170,7 +172,9 @@ thread. This allows enhanced compatibility with browser
 ### `timeout[Symbol.dispose]()`
 
 <!-- YAML
-added: v20.5.0
+added:
+ - v20.5.0
+ - v18.18.0
 -->
 
 > Stability: 1 - Experimental
diff --git a/doc/api/url.md b/doc/api/url.md
index 9c976aacc113fd..6412988d6103b6 100644
--- a/doc/api/url.md
+++ b/doc/api/url.md
@@ -129,7 +129,7 @@ return `true`.
 
 #### `new URL(input[, base])`
 
-<!--
+<!-- YAML
 changes:
   - version:
     - v20.0.0
@@ -867,7 +867,9 @@ Append a new name-value pair to the query string.
 
 <!-- YAML
 changes:
-  - version: v20.2.0
+  - version:
+      - v20.2.0
+      - v18.18.0
     pr-url: https://github.com/nodejs/node/pull/47885
     description: Add support for optional `value` argument.
 -->
@@ -937,7 +939,9 @@ no such pairs, an empty array is returned.
 
 <!-- YAML
 changes:
-  - version: v20.2.0
+  - version:
+      - v20.2.0
+      - v18.18.0
     pr-url: https://github.com/nodejs/node/pull/47885
     description: Add support for optional `value` argument.
 -->
diff --git a/doc/api/util.md b/doc/api/util.md
index 07d574694cc88a..bf154500f64e3e 100644
--- a/doc/api/util.md
+++ b/doc/api/util.md
@@ -777,8 +777,14 @@ const million = 1_000_000;
 const bigNumber = 123_456_789n;
 const bigDecimal = 1_234.123_45;
 
-console.log(thousand, million, bigNumber, bigDecimal);
-// 1_000 1_000_000 123_456_789n 1_234.123_45
+console.log(inspect(thousand, { numericSeparator: true }));
+// 1_000
+console.log(inspect(million, { numericSeparator: true }));
+// 1_000_000
+console.log(inspect(bigNumber, { numericSeparator: true }));
+// 123_456_789n
+console.log(inspect(bigDecimal, { numericSeparator: true }));
+// 1_234.123_45
 ```
 
 `util.inspect()` is a synchronous method intended for debugging. Its maximum
@@ -1328,7 +1334,7 @@ const { params } = new MIMEType('text/plain;foo=0;bar=1');
 params.set('foo', 'def');
 params.set('baz', 'xyz');
 console.log(params.toString());
-// Prints: foo=def&bar=1&baz=xyz
+// Prints: foo=def;bar=1;baz=xyz
 ```
 
 ```cjs
@@ -1338,7 +1344,7 @@ const { params } = new MIMEType('text/plain;foo=0;bar=1');
 params.set('foo', 'def');
 params.set('baz', 'xyz');
 console.log(params.toString());
-// Prints: foo=def&bar=1&baz=xyz
+// Prints: foo=def;bar=1;baz=xyz
 ```
 
 ### `mimeParams.values()`
@@ -1591,6 +1597,11 @@ $ node negate.js --no-logfile --logfile=test.log --color --no-color
 
 <!-- YAML
 added: v8.0.0
+changes:
+  - version: v20.8.0
+    pr-url: https://github.com/nodejs/node/pull/49647
+    description: Calling `promisify` on a function that returns a `Promise` is
+                 deprecated.
 -->
 
 * `original` {Function}
@@ -1624,6 +1635,8 @@ async function callStat() {
   const stats = await stat('.');
   console.log(`This directory is owned by ${stats.uid}`);
 }
+
+callStat();
 ```
 
 If there is an `original[util.promisify.custom]` property present, `promisify`
diff --git a/doc/api/vm.md b/doc/api/vm.md
index 19d39c77a01720..2043a39f527249 100644
--- a/doc/api/vm.md
+++ b/doc/api/vm.md
@@ -98,7 +98,9 @@ changes:
     when `import()` is called. If this option is not specified, calls to
     `import()` will reject with [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING`][].
     This option is part of the experimental modules API. We do not recommend
-    using it in a production environment.
+    using it in a production environment. If `--experimental-vm-modules` isn't
+    set, this callback will be ignored and calls to `import()` will reject with
+    [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG`][].
     * `specifier` {string} specifier passed to `import()`
     * `script` {vm.Script}
     * `importAssertions` {Object} The `"assert"` value passed to the
@@ -760,6 +762,9 @@ changes:
   * `importModuleDynamically` {Function} Called during evaluation of this module
     when `import()` is called. If this option is not specified, calls to
     `import()` will reject with [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING`][].
+    If `--experimental-vm-modules` isn't set, this callback will be ignored
+    and calls to `import()` will reject with
+    [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG`][].
     * `specifier` {string} specifier passed to `import()`
     * `module` {vm.Module}
     * `importAssertions` {Object} The `"assert"` value passed to the
@@ -1018,7 +1023,9 @@ changes:
     when `import()` is called. If this option is not specified, calls to
     `import()` will reject with [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING`][].
     This option is part of the experimental modules API, and should not be
-    considered stable.
+    considered stable.  If `--experimental-vm-modules` isn't
+    set, this callback will be ignored and calls to `import()` will reject with
+    [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG`][].
     * `specifier` {string} specifier passed to `import()`
     * `function` {Function}
     * `importAssertions` {Object} The `"assert"` value passed to the
@@ -1242,7 +1249,9 @@ changes:
     when `import()` is called. If this option is not specified, calls to
     `import()` will reject with [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING`][].
     This option is part of the experimental modules API. We do not recommend
-    using it in a production environment.
+    using it in a production environment.  If `--experimental-vm-modules` isn't
+    set, this callback will be ignored and calls to `import()` will reject with
+    [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG`][].
     * `specifier` {string} specifier passed to `import()`
     * `script` {vm.Script}
     * `importAssertions` {Object} The `"assert"` value passed to the
@@ -1341,7 +1350,9 @@ changes:
     when `import()` is called. If this option is not specified, calls to
     `import()` will reject with [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING`][].
     This option is part of the experimental modules API. We do not recommend
-    using it in a production environment.
+    using it in a production environment. If `--experimental-vm-modules` isn't
+    set, this callback will be ignored and calls to `import()` will reject with
+    [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG`][].
     * `specifier` {string} specifier passed to `import()`
     * `script` {vm.Script}
     * `importAssertions` {Object} The `"assert"` value passed to the
@@ -1421,7 +1432,9 @@ changes:
     when `import()` is called. If this option is not specified, calls to
     `import()` will reject with [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING`][].
     This option is part of the experimental modules API. We do not recommend
-    using it in a production environment.
+    using it in a production environment. If `--experimental-vm-modules` isn't
+    set, this callback will be ignored and calls to `import()` will reject with
+    [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG`][].
     * `specifier` {string} specifier passed to `import()`
     * `script` {vm.Script}
     * `importAssertions` {Object} The `"assert"` value passed to the
@@ -1581,10 +1594,11 @@ are not controllable through the timeout either.
 [GetModuleNamespace]: https://tc39.es/ecma262/#sec-getmodulenamespace
 [HostResolveImportedModule]: https://tc39.es/ecma262/#sec-hostresolveimportedmodule
 [Link() concrete method]: https://tc39.es/ecma262/#sec-moduledeclarationlinking
-[Module Record]: https://www.ecma-international.org/ecma-262/#sec-abstract-module-records
+[Module Record]: https://262.ecma-international.org/14.0/#sec-abstract-module-records
 [Source Text Module Record]: https://tc39.es/ecma262/#sec-source-text-module-records
 [Synthetic Module Record]: https://heycam.github.io/webidl/#synthetic-module-records
 [V8 Embedder's Guide]: https://v8.dev/docs/embed#contexts
+[`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG`]: errors.md#err_vm_dynamic_import_callback_missing_flag
 [`ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING`]: errors.md#err_vm_dynamic_import_callback_missing
 [`ERR_VM_MODULE_STATUS`]: errors.md#err_vm_module_status
 [`Error`]: errors.md#class-error
diff --git a/doc/api/webstreams.md b/doc/api/webstreams.md
index a8a111caef6414..dd6e46c3274464 100644
--- a/doc/api/webstreams.md
+++ b/doc/api/webstreams.md
@@ -5,12 +5,16 @@
 <!-- YAML
 added: v16.5.0
 changes:
+  - version:
+    - v21.0.0
+    pr-url: https://github.com/nodejs/node/pull/45684
+    description: No longer experimental.
   - version: v18.0.0
     pr-url: https://github.com/nodejs/node/pull/42225
     description: Use of this API no longer emit a runtime warning.
 -->
 
-> Stability: 1 - Experimental.
+> Stability: 2 - Stable
 
 An implementation of the [WHATWG Streams Standard][].
 
diff --git a/doc/api/worker_threads.md b/doc/api/worker_threads.md
index 28afb77d8036a1..ccbce9f96cc7eb 100644
--- a/doc/api/worker_threads.md
+++ b/doc/api/worker_threads.md
@@ -174,7 +174,7 @@ There is no equivalent to this API in browsers.
 ## `worker.isMarkedAsUntransferable(object)`
 
 <!-- YAML
-added: REPLACEME
+added: v21.0.0
 -->
 
 * `object` {any} Any JavaScript value.
@@ -600,7 +600,7 @@ are part of the channel.
 <!-- YAML
 added: v10.5.0
 changes:
-  - version: REPLACEME
+  - version: v21.0.0
     pr-url: https://github.com/nodejs/node/pull/47604
     description: An error is thrown when an untransferable object is in the
                  transfer list.
diff --git a/doc/changelogs/CHANGELOG_ARCHIVE.md b/doc/changelogs/CHANGELOG_ARCHIVE.md
index 14fe32c7f5a48e..984f342e13cb2d 100644
--- a/doc/changelogs/CHANGELOG_ARCHIVE.md
+++ b/doc/changelogs/CHANGELOG_ARCHIVE.md
@@ -154,6 +154,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_IOJS.md b/doc/changelogs/CHANGELOG_IOJS.md
index 3620e81235c5d9..2a3afd4952ad26 100644
--- a/doc/changelogs/CHANGELOG_IOJS.md
+++ b/doc/changelogs/CHANGELOG_IOJS.md
@@ -62,6 +62,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V010.md b/doc/changelogs/CHANGELOG_V010.md
index af40d61d460c23..c4e3305f3ab6ed 100644
--- a/doc/changelogs/CHANGELOG_V010.md
+++ b/doc/changelogs/CHANGELOG_V010.md
@@ -64,6 +64,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [18.x](CHANGELOG_V18.md)
   * [17.x](CHANGELOG_V17.md)
diff --git a/doc/changelogs/CHANGELOG_V012.md b/doc/changelogs/CHANGELOG_V012.md
index 00be56d2d14f3e..80b905f2bcae76 100644
--- a/doc/changelogs/CHANGELOG_V012.md
+++ b/doc/changelogs/CHANGELOG_V012.md
@@ -32,6 +32,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [18.x](CHANGELOG_V18.md)
   * [17.x](CHANGELOG_V17.md)
diff --git a/doc/changelogs/CHANGELOG_V10.md b/doc/changelogs/CHANGELOG_V10.md
index 718b0048f3bd8f..aa7ad43df5fa5b 100644
--- a/doc/changelogs/CHANGELOG_V10.md
+++ b/doc/changelogs/CHANGELOG_V10.md
@@ -58,6 +58,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V11.md b/doc/changelogs/CHANGELOG_V11.md
index 16cf3ec7cb5e0c..6ee1b216946bac 100644
--- a/doc/changelogs/CHANGELOG_V11.md
+++ b/doc/changelogs/CHANGELOG_V11.md
@@ -30,6 +30,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
   * [17.x](CHANGELOG_V17.md)
diff --git a/doc/changelogs/CHANGELOG_V12.md b/doc/changelogs/CHANGELOG_V12.md
index fe3f7c75c3e27a..3e791c36f55afd 100644
--- a/doc/changelogs/CHANGELOG_V12.md
+++ b/doc/changelogs/CHANGELOG_V12.md
@@ -67,6 +67,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V13.md b/doc/changelogs/CHANGELOG_V13.md
index 46cfc1d50590e9..ceca04933d3060 100644
--- a/doc/changelogs/CHANGELOG_V13.md
+++ b/doc/changelogs/CHANGELOG_V13.md
@@ -30,6 +30,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V14.md b/doc/changelogs/CHANGELOG_V14.md
index 903887d669d6a3..5478345472816c 100644
--- a/doc/changelogs/CHANGELOG_V14.md
+++ b/doc/changelogs/CHANGELOG_V14.md
@@ -62,6 +62,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V15.md b/doc/changelogs/CHANGELOG_V15.md
index 5bc4c75dab9766..c4d0c689002728 100644
--- a/doc/changelogs/CHANGELOG_V15.md
+++ b/doc/changelogs/CHANGELOG_V15.md
@@ -31,6 +31,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V16.md b/doc/changelogs/CHANGELOG_V16.md
index 4c081b0a77c9d0..c1f44c1c84ab3e 100644
--- a/doc/changelogs/CHANGELOG_V16.md
+++ b/doc/changelogs/CHANGELOG_V16.md
@@ -53,6 +53,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V17.md b/doc/changelogs/CHANGELOG_V17.md
index 5c21ba09c382a3..cf31f6d5474602 100644
--- a/doc/changelogs/CHANGELOG_V17.md
+++ b/doc/changelogs/CHANGELOG_V17.md
@@ -28,6 +28,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V18.md b/doc/changelogs/CHANGELOG_V18.md
index 0a9619444a3a81..62f249b2c18adc 100644
--- a/doc/changelogs/CHANGELOG_V18.md
+++ b/doc/changelogs/CHANGELOG_V18.md
@@ -9,6 +9,9 @@
 </tr>
 <tr>
 <td>
+<a href="#18.18.2">18.18.2</a><br/>
+<a href="#18.18.1">18.18.1</a><br/>
+<a href="#18.18.0">18.18.0</a><br/>
 <a href="#18.17.1">18.17.1</a><br/>
 <a href="#18.17.0">18.17.0</a><br/>
 <a href="#18.16.1">18.16.1</a><br/>
@@ -40,6 +43,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [17.x](CHANGELOG_V17.md)
@@ -61,6 +65,246 @@
   * [io.js](CHANGELOG_IOJS.md)
   * [Archive](CHANGELOG_ARCHIVE.md)
 
+<a id="18.18.2"></a>
+
+## 2023-10-13, Version 18.18.2 'Hydrogen' (LTS), @RafaelGSS
+
+This is a security release.
+
+### Notable Changes
+
+The following CVEs are fixed in this release:
+
+* [CVE-2023-44487](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-44487): `nghttp2` Security Release (High)
+* [CVE-2023-45143](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-45143): `undici` Security Release (High)
+* [CVE-2023-38552](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-38552):  Integrity checks according to policies can be circumvented (Medium)
+* [CVE-2023-39333](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-39333): Code injection via WebAssembly export names (Low)
+
+More detailed information on each of the vulnerabilities can be found in [October 2023 Security Releases](https://nodejs.org/en/blog/vulnerability/october-2023-security-releases/) blog post.
+
+### Commits
+
+* \[[`55028468db`](https://github.com/nodejs/node/commit/55028468db)] - **deps**: update undici to v5.26.3 (Matteo Collina) [#50153](https://github.com/nodejs/node/pull/50153)
+* \[[`a792bbc515`](https://github.com/nodejs/node/commit/a792bbc515)] - **deps**: update nghttp2 to 1.57.0 (James M Snell) [#50121](https://github.com/nodejs/node/pull/50121)
+* \[[`f6444defa4`](https://github.com/nodejs/node/commit/f6444defa4)] - **deps**: update nghttp2 to 1.56.0 (Node.js GitHub Bot) [#49582](https://github.com/nodejs/node/pull/49582)
+* \[[`7e9b08dfd4`](https://github.com/nodejs/node/commit/7e9b08dfd4)] - **deps**: update nghttp2 to 1.55.1 (Node.js GitHub Bot) [#48790](https://github.com/nodejs/node/pull/48790)
+* \[[`85672c153f`](https://github.com/nodejs/node/commit/85672c153f)] - **deps**: update nghttp2 to 1.55.0 (Node.js GitHub Bot) [#48746](https://github.com/nodejs/node/pull/48746)
+* \[[`300a902422`](https://github.com/nodejs/node/commit/300a902422)] - **deps**: update nghttp2 to 1.53.0 (Node.js GitHub Bot) [#47997](https://github.com/nodejs/node/pull/47997)
+* \[[`7d83ed0bf6`](https://github.com/nodejs/node/commit/7d83ed0bf6)] - _**Revert**_ "**deps**: update nghttp2 to 1.55.0" (Richard Lau) [#50151](https://github.com/nodejs/node/pull/50151)
+* \[[`1193ca5fdb`](https://github.com/nodejs/node/commit/1193ca5fdb)] - **lib**: let deps require `node` prefixed modules (Matthew Aitken) [#50047](https://github.com/nodejs/node/pull/50047)
+* \[[`eaf9083cf1`](https://github.com/nodejs/node/commit/eaf9083cf1)] - **module**: fix code injection through export names (Tobias Nießen) [nodejs-private/node-private#461](https://github.com/nodejs-private/node-private/pull/461)
+* \[[`1c538938cc`](https://github.com/nodejs/node/commit/1c538938cc)] - **policy**: use tamper-proof integrity check function (Tobias Nießen) [nodejs-private/node-private#462](https://github.com/nodejs-private/node-private/pull/462)
+
+<a id="18.18.1"></a>
+
+## 2023-10-10, Version 18.18.1 'Hydrogen' (LTS), @richardlau
+
+### Notable Changes
+
+This release addresses some regressions that appeared in Node.js 18.18.0:
+
+* (Windows) FS can not handle certain characters in file name [#48673](https://github.com/nodejs/node/issues/48673)
+* 18 and 20 node images give error - Text file busy (after re-build images) [nodejs/docker-node#1968](https://github.com/nodejs/docker-node/issues/1968)
+* libuv update in 18.18.0 breaks webpack's thread-loader [#49911](https://github.com/nodejs/node/issues/49911)
+
+The libuv 1.45.0 and 1.46.0 updates that were released in Node.js 18.18.0 have been temporarily reverted.
+
+### Commits
+
+* \[[`3e3a75cc46`](https://github.com/nodejs/node/commit/3e3a75cc46)] - _**Revert**_ "**build**: sync libuv header change" (Richard Lau) [#50036](https://github.com/nodejs/node/pull/50036)
+* \[[`14ece2c479`](https://github.com/nodejs/node/commit/14ece2c479)] - _**Revert**_ "**deps**: upgrade to libuv 1.45.0" (Richard Lau) [#50036](https://github.com/nodejs/node/pull/50036)
+* \[[`022352acbe`](https://github.com/nodejs/node/commit/022352acbe)] - _**Revert**_ "**deps**: upgrade to libuv 1.46.0" (Richard Lau) [#50036](https://github.com/nodejs/node/pull/50036)
+* \[[`d9f138189c`](https://github.com/nodejs/node/commit/d9f138189c)] - _**Revert**_ "**deps**: add missing thread-common.c in uv.gyp" (Richard Lau) [#50036](https://github.com/nodejs/node/pull/50036)
+* \[[`7a3e1ffbb8`](https://github.com/nodejs/node/commit/7a3e1ffbb8)] - **fs**: make sure to write entire buffer (Robert Nagy) [#49211](https://github.com/nodejs/node/pull/49211)
+* \[[`04cba95a67`](https://github.com/nodejs/node/commit/04cba95a67)] - **test**: add `tmpdir.resolve()` (Livia Medeiros) [#49079](https://github.com/nodejs/node/pull/49079)
+
+<a id="18.18.0"></a>
+
+## 2023-09-18, Version 18.18.0 'Hydrogen' (LTS), @ruyadorno
+
+### Notable Changes
+
+* \[[`7dc731d4bf`](https://github.com/nodejs/node/commit/7dc731d4bf)] - **build**: sync libuv header change (Jiawen Geng) [#48078](https://github.com/nodejs/node/pull/48078)
+* \[[`490fc004b0`](https://github.com/nodejs/node/commit/490fc004b0)] - **crypto**: update root certificates to NSS 3.93 (Node.js GitHub Bot) [#49341](https://github.com/nodejs/node/pull/49341)
+* \[[`dd8cd97d4d`](https://github.com/nodejs/node/commit/dd8cd97d4d)] - **crypto**: update root certificates to NSS 3.90 (Node.js GitHub Bot) [#48416](https://github.com/nodejs/node/pull/48416)
+* \[[`ea23870bec`](https://github.com/nodejs/node/commit/ea23870bec)] - **deps**: add missing thread-common.c in uv.gyp (Santiago Gimeno) [#48078](https://github.com/nodejs/node/pull/48078)
+* \[[`88855e0b1b`](https://github.com/nodejs/node/commit/88855e0b1b)] - **deps**: upgrade to libuv 1.46.0 (Santiago Gimeno) [#48078](https://github.com/nodejs/node/pull/48078)
+* \[[`fb2b80fca0`](https://github.com/nodejs/node/commit/fb2b80fca0)] - **deps**: upgrade to libuv 1.45.0 (Santiago Gimeno) [#48078](https://github.com/nodejs/node/pull/48078)
+* \[[`249879e46c`](https://github.com/nodejs/node/commit/249879e46c)] - **doc**: add atlowChemi to collaborators (atlowChemi) [#48757](https://github.com/nodejs/node/pull/48757)
+* \[[`e8dc7bde6a`](https://github.com/nodejs/node/commit/e8dc7bde6a)] - **doc**: add vmoroz to collaborators (Vladimir Morozov) [#48527](https://github.com/nodejs/node/pull/48527)
+* \[[`a30f2fbcc1`](https://github.com/nodejs/node/commit/a30f2fbcc1)] - **doc**: add kvakil to collaborators (Keyhan Vakil) [#48449](https://github.com/nodejs/node/pull/48449)
+* \[[`c39b7c240e`](https://github.com/nodejs/node/commit/c39b7c240e)] - **(SEMVER-MINOR)** **esm**: add `--import` flag (Moshe Atlow) [#43942](https://github.com/nodejs/node/pull/43942)
+* \[[`a68a67f54d`](https://github.com/nodejs/node/commit/a68a67f54d)] - **(SEMVER-MINOR)** **events**: allow safely adding listener to abortSignal (Chemi Atlow) [#48596](https://github.com/nodejs/node/pull/48596)
+* \[[`3a8586bee2`](https://github.com/nodejs/node/commit/3a8586bee2)] - **fs, stream**: initial `Symbol.dispose` and `Symbol.asyncDispose` support (Moshe Atlow) [#48518](https://github.com/nodejs/node/pull/48518)
+* \[[`863bdb785d`](https://github.com/nodejs/node/commit/863bdb785d)] - **net**: add autoSelectFamily global getter and setter (Paolo Insogna) [#45777](https://github.com/nodejs/node/pull/45777)
+* \[[`c59ae86ba0`](https://github.com/nodejs/node/commit/c59ae86ba0)] - **(SEMVER-MINOR)** **url**: add value argument to has and delete methods (Sankalp Shubham) [#47885](https://github.com/nodejs/node/pull/47885)
+
+### Commits
+
+* \[[`d1f43317ea`](https://github.com/nodejs/node/commit/d1f43317ea)] - **benchmark**: add bar.R (Rafael Gonzaga) [#47729](https://github.com/nodejs/node/pull/47729)
+* \[[`4f74be3c92`](https://github.com/nodejs/node/commit/4f74be3c92)] - **benchmark**: refactor crypto oneshot (Filip Skokan) [#48267](https://github.com/nodejs/node/pull/48267)
+* \[[`fe9da9df0f`](https://github.com/nodejs/node/commit/fe9da9df0f)] - **benchmark**: add crypto.create\*Key (Filip Skokan) [#48284](https://github.com/nodejs/node/pull/48284)
+* \[[`9cb18b3e9d`](https://github.com/nodejs/node/commit/9cb18b3e9d)] - **build**: do not pass target toolchain flags to host toolchain (Ivan Trubach) [#48597](https://github.com/nodejs/node/pull/48597)
+* \[[`7dc731d4bf`](https://github.com/nodejs/node/commit/7dc731d4bf)] - **build**: sync libuv header change (Jiawen Geng) [#48078](https://github.com/nodejs/node/pull/48078)
+* \[[`211a4f88a9`](https://github.com/nodejs/node/commit/211a4f88a9)] - **build**: update action to close stale PRs (Michael Dawson) [#48196](https://github.com/nodejs/node/pull/48196)
+* \[[`cc33a1864b`](https://github.com/nodejs/node/commit/cc33a1864b)] - **child\_process**: harden against prototype pollution (Livia Medeiros) [#48726](https://github.com/nodejs/node/pull/48726)
+* \[[`b5df084e1e`](https://github.com/nodejs/node/commit/b5df084e1e)] - **child\_process**: use addAbortListener (atlowChemi) [#48550](https://github.com/nodejs/node/pull/48550)
+* \[[`611db8df1a`](https://github.com/nodejs/node/commit/611db8df1a)] - **child\_process**: support `Symbol.dispose` (Moshe Atlow) [#48551](https://github.com/nodejs/node/pull/48551)
+* \[[`490fc004b0`](https://github.com/nodejs/node/commit/490fc004b0)] - **crypto**: update root certificates to NSS 3.93 (Node.js GitHub Bot) [#49341](https://github.com/nodejs/node/pull/49341)
+* \[[`dd8cd97d4d`](https://github.com/nodejs/node/commit/dd8cd97d4d)] - **crypto**: update root certificates to NSS 3.90 (Node.js GitHub Bot) [#48416](https://github.com/nodejs/node/pull/48416)
+* \[[`b2bc839d4c`](https://github.com/nodejs/node/commit/b2bc839d4c)] - **crypto**: remove OPENSSL\_FIPS guard for OpenSSL 3 (Richard Lau) [#48392](https://github.com/nodejs/node/pull/48392)
+* \[[`c8da8c80b9`](https://github.com/nodejs/node/commit/c8da8c80b9)] - **deps**: update nghttp2 to 1.55.0 (Node.js GitHub Bot) [#48746](https://github.com/nodejs/node/pull/48746)
+* \[[`7e04242dcb`](https://github.com/nodejs/node/commit/7e04242dcb)] - **deps**: update minimatch to 9.0.3 (Node.js GitHub Bot) [#48704](https://github.com/nodejs/node/pull/48704)
+* \[[`ea23870bec`](https://github.com/nodejs/node/commit/ea23870bec)] - **deps**: add missing thread-common.c in uv.gyp (Santiago Gimeno) [#48078](https://github.com/nodejs/node/pull/48078)
+* \[[`88855e0b1b`](https://github.com/nodejs/node/commit/88855e0b1b)] - **deps**: upgrade to libuv 1.46.0 (Santiago Gimeno) [#48078](https://github.com/nodejs/node/pull/48078)
+* \[[`fb2b80fca0`](https://github.com/nodejs/node/commit/fb2b80fca0)] - **deps**: upgrade to libuv 1.45.0 (Santiago Gimeno) [#48078](https://github.com/nodejs/node/pull/48078)
+* \[[`59fca4e09a`](https://github.com/nodejs/node/commit/59fca4e09a)] - **deps**: update acorn to 8.10.0 (Node.js GitHub Bot) [#48713](https://github.com/nodejs/node/pull/48713)
+* \[[`bcb255d5a8`](https://github.com/nodejs/node/commit/bcb255d5a8)] - **deps**: V8: cherry-pick cb00db4dba6c (Keyhan Vakil) [#48671](https://github.com/nodejs/node/pull/48671)
+* \[[`65a6c90fc6`](https://github.com/nodejs/node/commit/65a6c90fc6)] - **deps**: update acorn to 8.9.0 (Node.js GitHub Bot) [#48484](https://github.com/nodejs/node/pull/48484)
+* \[[`6b6d5d91e9`](https://github.com/nodejs/node/commit/6b6d5d91e9)] - **deps**: update zlib to 1.2.13.1-motley-f81f385 (Node.js GitHub Bot) [#48541](https://github.com/nodejs/node/pull/48541)
+* \[[`56249b0770`](https://github.com/nodejs/node/commit/56249b0770)] - **deps**: update googletest to ec4fed9 (Node.js GitHub Bot) [#48538](https://github.com/nodejs/node/pull/48538)
+* \[[`8914a5204a`](https://github.com/nodejs/node/commit/8914a5204a)] - **deps**: update minimatch to 9.0.2 (Node.js GitHub Bot) [#48542](https://github.com/nodejs/node/pull/48542)
+* \[[`1b960d9988`](https://github.com/nodejs/node/commit/1b960d9988)] - **deps**: update icu to 73.2 (Node.js GitHub Bot) [#48502](https://github.com/nodejs/node/pull/48502)
+* \[[`f0e2e3c549`](https://github.com/nodejs/node/commit/f0e2e3c549)] - **deps**: update zlib to 1.2.13.1-motley-3ca9f16 (Node.js GitHub Bot) [#48413](https://github.com/nodejs/node/pull/48413)
+* \[[`9cf8fe6b93`](https://github.com/nodejs/node/commit/9cf8fe6b93)] - **deps**: upgrade npm to 9.8.1 (npm team) [#48838](https://github.com/nodejs/node/pull/48838)
+* \[[`d9ff473ff3`](https://github.com/nodejs/node/commit/d9ff473ff3)] - **deps**: upgrade npm to 9.8.0 (npm team) [#48665](https://github.com/nodejs/node/pull/48665)
+* \[[`4a6177daad`](https://github.com/nodejs/node/commit/4a6177daad)] - **deps**: upgrade npm to 9.7.2 (npm team) [#48514](https://github.com/nodejs/node/pull/48514)
+* \[[`104b58feb1`](https://github.com/nodejs/node/commit/104b58feb1)] - **deps**: update ada to 2.6.0 (Node.js GitHub Bot) [#48896](https://github.com/nodejs/node/pull/48896)
+* \[[`7f7a125d78`](https://github.com/nodejs/node/commit/7f7a125d78)] - **deps**: update corepack to 0.19.0 (Node.js GitHub Bot) [#48540](https://github.com/nodejs/node/pull/48540)
+* \[[`5e1eb451d1`](https://github.com/nodejs/node/commit/5e1eb451d1)] - **deps**: update corepack to 0.18.1 (Node.js GitHub Bot) [#48483](https://github.com/nodejs/node/pull/48483)
+* \[[`3be53358bc`](https://github.com/nodejs/node/commit/3be53358bc)] - **deps**: add loong64 config into openssl gypi (Shi Pujin) [#48043](https://github.com/nodejs/node/pull/48043)
+* \[[`555982c59e`](https://github.com/nodejs/node/commit/555982c59e)] - **deps**: upgrade npm to 9.7.1 (npm team) [#48378](https://github.com/nodejs/node/pull/48378)
+* \[[`3c03ec0832`](https://github.com/nodejs/node/commit/3c03ec0832)] - **deps**: update simdutf to 3.2.14 (Node.js GitHub Bot) [#48344](https://github.com/nodejs/node/pull/48344)
+* \[[`a2964a4583`](https://github.com/nodejs/node/commit/a2964a4583)] - **deps**: update ada to 2.5.1 (Node.js GitHub Bot) [#48319](https://github.com/nodejs/node/pull/48319)
+* \[[`38f6e0d8cd`](https://github.com/nodejs/node/commit/38f6e0d8cd)] - **deps**: update zlib to 982b036 (Node.js GitHub Bot) [#48327](https://github.com/nodejs/node/pull/48327)
+* \[[`f4617a4f81`](https://github.com/nodejs/node/commit/f4617a4f81)] - **deps**: add loongarch64 into openssl Makefile and gen openssl-loongarch64 (Shi Pujin) [#46401](https://github.com/nodejs/node/pull/46401)
+* \[[`573eb4be12`](https://github.com/nodejs/node/commit/573eb4be12)] - **dgram**: socket add `asyncDispose` (atlowChemi) [#48717](https://github.com/nodejs/node/pull/48717)
+* \[[`f3c4300e00`](https://github.com/nodejs/node/commit/f3c4300e00)] - **dgram**: use addAbortListener (atlowChemi) [#48550](https://github.com/nodejs/node/pull/48550)
+* \[[`d3041df738`](https://github.com/nodejs/node/commit/d3041df738)] - **doc**: expand on squashing and rebasing to land a PR (Chengzhong Wu) [#48751](https://github.com/nodejs/node/pull/48751)
+* \[[`249879e46c`](https://github.com/nodejs/node/commit/249879e46c)] - **doc**: add atlowChemi to collaborators (atlowChemi) [#48757](https://github.com/nodejs/node/pull/48757)
+* \[[`42ecd46d1f`](https://github.com/nodejs/node/commit/42ecd46d1f)] - **doc**: fix ambiguity in http.md and https.md (an5er) [#48692](https://github.com/nodejs/node/pull/48692)
+* \[[`e78824e053`](https://github.com/nodejs/node/commit/e78824e053)] - **doc**: add release key for Ulises Gascon (Ulises Gascón) [#49196](https://github.com/nodejs/node/pull/49196)
+* \[[`1aa798d69f`](https://github.com/nodejs/node/commit/1aa798d69f)] - **doc**: clarify transform.\_transform() callback argument logic (Rafael Sofi-zada) [#48680](https://github.com/nodejs/node/pull/48680)
+* \[[`d723e870a2`](https://github.com/nodejs/node/commit/d723e870a2)] - **doc**: mention git node release prepare (Rafael Gonzaga) [#48644](https://github.com/nodejs/node/pull/48644)
+* \[[`a9a1394388`](https://github.com/nodejs/node/commit/a9a1394388)] - **doc**: fix options order (Luigi Pinca) [#48617](https://github.com/nodejs/node/pull/48617)
+* \[[`989ea6858f`](https://github.com/nodejs/node/commit/989ea6858f)] - **doc**: update security release stewards (Rafael Gonzaga) [#48569](https://github.com/nodejs/node/pull/48569)
+* \[[`f436ac1803`](https://github.com/nodejs/node/commit/f436ac1803)] - **doc**: update return type for describe (Shrujal Shah) [#48572](https://github.com/nodejs/node/pull/48572)
+* \[[`fbe89e6320`](https://github.com/nodejs/node/commit/fbe89e6320)] - **doc**: run license-builder (github-actions\[bot]) [#48552](https://github.com/nodejs/node/pull/48552)
+* \[[`f18b287bc3`](https://github.com/nodejs/node/commit/f18b287bc3)] - **doc**: add description of autoAllocateChunkSize in ReadableStream (Debadree Chatterjee) [#48004](https://github.com/nodejs/node/pull/48004)
+* \[[`e2f3ed1444`](https://github.com/nodejs/node/commit/e2f3ed1444)] - **doc**: fix `filename` type in `watch` result (Dmitry Semigradsky) [#48032](https://github.com/nodejs/node/pull/48032)
+* \[[`1fe75dc2b0`](https://github.com/nodejs/node/commit/1fe75dc2b0)] - **doc**: unnest `mime` and `MIMEParams` from MIMEType constructor (Dmitry Semigradsky) [#47950](https://github.com/nodejs/node/pull/47950)
+* \[[`e1339d58e8`](https://github.com/nodejs/node/commit/e1339d58e8)] - **doc**: update security-release-process.md (Rafael Gonzaga) [#48504](https://github.com/nodejs/node/pull/48504)
+* \[[`e8dc7bde6a`](https://github.com/nodejs/node/commit/e8dc7bde6a)] - **doc**: add vmoroz to collaborators (Vladimir Morozov) [#48527](https://github.com/nodejs/node/pull/48527)
+* \[[`f8ba672c7b`](https://github.com/nodejs/node/commit/f8ba672c7b)] - **doc**: link to Runtime Keys in export conditions (Jacob Hummer) [#48408](https://github.com/nodejs/node/pull/48408)
+* \[[`0056cb93e9`](https://github.com/nodejs/node/commit/0056cb93e9)] - **doc**: update fs flags documentation (sinkhaha) [#48463](https://github.com/nodejs/node/pull/48463)
+* \[[`3cf3fb9479`](https://github.com/nodejs/node/commit/3cf3fb9479)] - **doc**: revise `error.md` introduction (Antoine du Hamel) [#48423](https://github.com/nodejs/node/pull/48423)
+* \[[`7575d8b90e`](https://github.com/nodejs/node/commit/7575d8b90e)] - **doc**: add preveen-stack to triagers (Preveen P) [#48387](https://github.com/nodejs/node/pull/48387)
+* \[[`820aa550a4`](https://github.com/nodejs/node/commit/820aa550a4)] - **doc**: refine when file is undefined in test events (Moshe Atlow) [#48451](https://github.com/nodejs/node/pull/48451)
+* \[[`a30f2fbcc1`](https://github.com/nodejs/node/commit/a30f2fbcc1)] - **doc**: add kvakil to collaborators (Keyhan Vakil) [#48449](https://github.com/nodejs/node/pull/48449)
+* \[[`239b4ea66f`](https://github.com/nodejs/node/commit/239b4ea66f)] - **doc**: mark `--import` as experimental (Moshe Atlow) [#44067](https://github.com/nodejs/node/pull/44067)
+* \[[`2a561aefe2`](https://github.com/nodejs/node/commit/2a561aefe2)] - **doc**: add additional info on TSFN dispatch (Michael Dawson) [#48367](https://github.com/nodejs/node/pull/48367)
+* \[[`5cc6eee30d`](https://github.com/nodejs/node/commit/5cc6eee30d)] - **doc**: add link for news from security wg (Michael Dawson) [#48396](https://github.com/nodejs/node/pull/48396)
+* \[[`ffece88452`](https://github.com/nodejs/node/commit/ffece88452)] - **doc**: fix typo in events.md (Darshan Sen) [#48436](https://github.com/nodejs/node/pull/48436)
+* \[[`06513585dc`](https://github.com/nodejs/node/commit/06513585dc)] - **doc**: run license-builder (github-actions\[bot]) [#48336](https://github.com/nodejs/node/pull/48336)
+* \[[`d9a800ee5c`](https://github.com/nodejs/node/commit/d9a800ee5c)] - **esm**: fix emit deprecation on legacy main resolve (Antoine du Hamel) [#48664](https://github.com/nodejs/node/pull/48664)
+* \[[`c39b7c240e`](https://github.com/nodejs/node/commit/c39b7c240e)] - **(SEMVER-MINOR)** **esm**: add `--import` flag (Moshe Atlow) [#43942](https://github.com/nodejs/node/pull/43942)
+* \[[`a00464ee06`](https://github.com/nodejs/node/commit/a00464ee06)] - **esm**: fix specifier resolution and symlinks (Zack Newsham) [#47674](https://github.com/nodejs/node/pull/47674)
+* \[[`3b8ec348b0`](https://github.com/nodejs/node/commit/3b8ec348b0)] - **events**: fix bug listenerCount don't compare wrapped listener (yuzheng14) [#48592](https://github.com/nodejs/node/pull/48592)
+* \[[`a68a67f54d`](https://github.com/nodejs/node/commit/a68a67f54d)] - **(SEMVER-MINOR)** **events**: allow safely adding listener to abortSignal (Chemi Atlow) [#48596](https://github.com/nodejs/node/pull/48596)
+* \[[`5354af3dab`](https://github.com/nodejs/node/commit/5354af3dab)] - **fs**: call the callback with an error if writeSync fails (killa) [#47949](https://github.com/nodejs/node/pull/47949)
+* \[[`c3a27d1d3d`](https://github.com/nodejs/node/commit/c3a27d1d3d)] - **fs**: remove unneeded return statement (Luigi Pinca) [#48526](https://github.com/nodejs/node/pull/48526)
+* \[[`3a8586bee2`](https://github.com/nodejs/node/commit/3a8586bee2)] - **fs, stream**: initial `Symbol.dispose` and `Symbol.asyncDispose` support (Moshe Atlow) [#48518](https://github.com/nodejs/node/pull/48518)
+* \[[`01746c71df`](https://github.com/nodejs/node/commit/01746c71df)] - **http**: null the joinDuplicateHeaders property on cleanup (Luigi Pinca) [#48608](https://github.com/nodejs/node/pull/48608)
+* \[[`d47eb73a85`](https://github.com/nodejs/node/commit/d47eb73a85)] - **http**: remove useless ternary in test (geekreal) [#48481](https://github.com/nodejs/node/pull/48481)
+* \[[`977e9a38b4`](https://github.com/nodejs/node/commit/977e9a38b4)] - **http**: fix for handling on boot timers headers and request (Franciszek Koltuniuk) [#48291](https://github.com/nodejs/node/pull/48291)
+* \[[`be88f7cd22`](https://github.com/nodejs/node/commit/be88f7cd22)] - **http2**: use addAbortListener (atlowChemi) [#48550](https://github.com/nodejs/node/pull/48550)
+* \[[`7c7230a85c`](https://github.com/nodejs/node/commit/7c7230a85c)] - **http2**: send RST code 8 on AbortController signal (Devraj Mehta) [#48573](https://github.com/nodejs/node/pull/48573)
+* \[[`f74c2fc72a`](https://github.com/nodejs/node/commit/f74c2fc72a)] - **lib**: use addAbortListener (atlowChemi) [#48550](https://github.com/nodejs/node/pull/48550)
+* \[[`db355d1f37`](https://github.com/nodejs/node/commit/db355d1f37)] - **lib**: add option to force handling stopped events (Chemi Atlow) [#48301](https://github.com/nodejs/node/pull/48301)
+* \[[`5d682c55a5`](https://github.com/nodejs/node/commit/5d682c55a5)] - **lib**: reduce url getters on `makeRequireFunction` (Yagiz Nizipli) [#48492](https://github.com/nodejs/node/pull/48492)
+* \[[`5260f53e55`](https://github.com/nodejs/node/commit/5260f53e55)] - **lib**: add support for inherited custom inspection methods (Antoine du Hamel) [#48306](https://github.com/nodejs/node/pull/48306)
+* \[[`69aaf8b1d1`](https://github.com/nodejs/node/commit/69aaf8b1d1)] - **lib**: remove invalid parameter to toASCII (Yagiz Nizipli) [#48878](https://github.com/nodejs/node/pull/48878)
+* \[[`51863b80e4`](https://github.com/nodejs/node/commit/51863b80e4)] - **meta**: bump actions/checkout from 3.5.2 to 3.5.3 (dependabot\[bot]) [#48625](https://github.com/nodejs/node/pull/48625)
+* \[[`7ec370991d`](https://github.com/nodejs/node/commit/7ec370991d)] - **meta**: bump step-security/harden-runner from 2.4.0 to 2.4.1 (dependabot\[bot]) [#48626](https://github.com/nodejs/node/pull/48626)
+* \[[`34b8e980d4`](https://github.com/nodejs/node/commit/34b8e980d4)] - **meta**: bump ossf/scorecard-action from 2.1.3 to 2.2.0 (dependabot\[bot]) [#48628](https://github.com/nodejs/node/pull/48628)
+* \[[`dfed9a7da9`](https://github.com/nodejs/node/commit/dfed9a7da9)] - **meta**: bump github/codeql-action from 2.3.6 to 2.20.1 (dependabot\[bot]) [#48627](https://github.com/nodejs/node/pull/48627)
+* \[[`071eaadc5a`](https://github.com/nodejs/node/commit/071eaadc5a)] - **module**: add SourceMap.findOrigin (Isaac Z. Schlueter) [#47790](https://github.com/nodejs/node/pull/47790)
+* \[[`bf1525c549`](https://github.com/nodejs/node/commit/bf1525c549)] - **module**: reduce url invocations in esm/load.js (Yagiz Nizipli) [#48337](https://github.com/nodejs/node/pull/48337)
+* \[[`f8921630a2`](https://github.com/nodejs/node/commit/f8921630a2)] - **net**: server add `asyncDispose` (atlowChemi) [#48717](https://github.com/nodejs/node/pull/48717)
+* \[[`b5f53d9a0b`](https://github.com/nodejs/node/commit/b5f53d9a0b)] - **net**: fix family autoselection SSL connection handling (Paolo Insogna) [#48189](https://github.com/nodejs/node/pull/48189)
+* \[[`267439fc34`](https://github.com/nodejs/node/commit/267439fc34)] - **net**: rework autoSelectFamily implementation (Paolo Insogna) [#46587](https://github.com/nodejs/node/pull/46587)
+* \[[`d3637cdbbf`](https://github.com/nodejs/node/commit/d3637cdbbf)] - **net**: fix address iteration with autoSelectFamily (Fedor Indutny) [#48258](https://github.com/nodejs/node/pull/48258)
+* \[[`e8289a83f1`](https://github.com/nodejs/node/commit/e8289a83f1)] - **net**: fix family autoselection timeout handling (Paolo Insogna) [#47860](https://github.com/nodejs/node/pull/47860)
+* \[[`863bdb785d`](https://github.com/nodejs/node/commit/863bdb785d)] - **net**: add autoSelectFamily global getter and setter (Paolo Insogna) [#45777](https://github.com/nodejs/node/pull/45777)
+* \[[`04dc090bfa`](https://github.com/nodejs/node/commit/04dc090bfa)] - **node-api**: provide napi\_define\_properties fast path (Gabriel Schulhof) [#48440](https://github.com/nodejs/node/pull/48440)
+* \[[`feb6a54dc3`](https://github.com/nodejs/node/commit/feb6a54dc3)] - **node-api**: implement external strings (Gabriel Schulhof) [#48339](https://github.com/nodejs/node/pull/48339)
+* \[[`121f74c463`](https://github.com/nodejs/node/commit/121f74c463)] - **perf\_hooks**: convert maxSize to IDL value in setResourceTimingBufferSize (Chengzhong Wu) [#44902](https://github.com/nodejs/node/pull/44902)
+* \[[`804d880589`](https://github.com/nodejs/node/commit/804d880589)] - **permission**: fix data types in PrintTree (Tobias Nießen) [#48770](https://github.com/nodejs/node/pull/48770)
+* \[[`7aaecce9bf`](https://github.com/nodejs/node/commit/7aaecce9bf)] - **permission**: add debug log when inserting fs nodes (Rafael Gonzaga) [#48677](https://github.com/nodejs/node/pull/48677)
+* \[[`cb51ef2905`](https://github.com/nodejs/node/commit/cb51ef2905)] - **readline**: use addAbortListener (atlowChemi) [#48550](https://github.com/nodejs/node/pull/48550)
+* \[[`07065d0814`](https://github.com/nodejs/node/commit/07065d0814)] - **report**: disable js stack when no context is entered (Chengzhong Wu) [#48495](https://github.com/nodejs/node/pull/48495)
+* \[[`572b82ffef`](https://github.com/nodejs/node/commit/572b82ffef)] - **src**: make BaseObject iteration order deterministic (Joyee Cheung) [#48702](https://github.com/nodejs/node/pull/48702)
+* \[[`3f65598a41`](https://github.com/nodejs/node/commit/3f65598a41)] - **src**: remove kEagerCompile for CompileFunction (Keyhan Vakil) [#48671](https://github.com/nodejs/node/pull/48671)
+* \[[`f43eacac9b`](https://github.com/nodejs/node/commit/f43eacac9b)] - **src**: deduplicate X509 getter implementations (Tobias Nießen) [#48563](https://github.com/nodejs/node/pull/48563)
+* \[[`0c19621bdc`](https://github.com/nodejs/node/commit/0c19621bdc)] - **src**: fix uninitialized field access in AsyncHooks (Jan Olaf Krems) [#48566](https://github.com/nodejs/node/pull/48566)
+* \[[`0c38184d62`](https://github.com/nodejs/node/commit/0c38184d62)] - **src**: fix Coverity issue regarding unnecessary copy (Yagiz Nizipli) [#48565](https://github.com/nodejs/node/pull/48565)
+* \[[`0d73009ba3`](https://github.com/nodejs/node/commit/0d73009ba3)] - **src**: refactor `SplitString` in util (Yagiz Nizipli) [#48491](https://github.com/nodejs/node/pull/48491)
+* \[[`6c72622df9`](https://github.com/nodejs/node/commit/6c72622df9)] - **src**: handle wasm out of bound in osx will raise SIGBUS correctly (Congcong Cai) [#46561](https://github.com/nodejs/node/pull/46561)
+* \[[`e4261809b0`](https://github.com/nodejs/node/commit/e4261809b0)] - **src**: replace idna functions with ada::idna (Yagiz Nizipli) [#47735](https://github.com/nodejs/node/pull/47735)
+* \[[`3dd82b1820`](https://github.com/nodejs/node/commit/3dd82b1820)] - **stream**: use addAbortListener (atlowChemi) [#48550](https://github.com/nodejs/node/pull/48550)
+* \[[`786fbdb824`](https://github.com/nodejs/node/commit/786fbdb824)] - **stream**: fix premature pipeline end (Robert Nagy) [#48435](https://github.com/nodejs/node/pull/48435)
+* \[[`c224e1b255`](https://github.com/nodejs/node/commit/c224e1b255)] - **stream**: fix deadlock when pipeing to full sink (Robert Nagy) [#48691](https://github.com/nodejs/node/pull/48691)
+* \[[`2c75b9ece2`](https://github.com/nodejs/node/commit/2c75b9ece2)] - **test**: fix flaky test-string-decode.js on x86 (Stefan Stojanovic) [#48750](https://github.com/nodejs/node/pull/48750)
+* \[[`279c4f64c1`](https://github.com/nodejs/node/commit/279c4f64c1)] - **test**: mark test-http-regr-gh-2928 as flaky (Joyee Cheung) [#49565](https://github.com/nodejs/node/pull/49565)
+* \[[`01eacccd9a`](https://github.com/nodejs/node/commit/01eacccd9a)] - **test**: deflake test-net-throttle (Luigi Pinca) [#48599](https://github.com/nodejs/node/pull/48599)
+* \[[`33886b271c`](https://github.com/nodejs/node/commit/33886b271c)] - **test**: move test-net-throttle to parallel (Luigi Pinca) [#48599](https://github.com/nodejs/node/pull/48599)
+* \[[`a79112b5f4`](https://github.com/nodejs/node/commit/a79112b5f4)] - _**Revert**_ "**test**: remove test-crypto-keygen flaky designation" (Luigi Pinca) [#48652](https://github.com/nodejs/node/pull/48652)
+* \[[`6ec57984db`](https://github.com/nodejs/node/commit/6ec57984db)] - **test**: add missing assertions to test-runner-cli (Moshe Atlow) [#48593](https://github.com/nodejs/node/pull/48593)
+* \[[`dd1805e802`](https://github.com/nodejs/node/commit/dd1805e802)] - **test**: remove test-crypto-keygen flaky designation (Luigi Pinca) [#48575](https://github.com/nodejs/node/pull/48575)
+* \[[`df9a9afc99`](https://github.com/nodejs/node/commit/df9a9afc99)] - **test**: remove test-timers-immediate-queue flaky designation (Luigi Pinca) [#48575](https://github.com/nodejs/node/pull/48575)
+* \[[`3ae96ae380`](https://github.com/nodejs/node/commit/3ae96ae380)] - **test**: make IsolateData per-isolate in cctest (Joyee Cheung) [#48450](https://github.com/nodejs/node/pull/48450)
+* \[[`f2ce8e0c06`](https://github.com/nodejs/node/commit/f2ce8e0c06)] - **test**: define NAPI\_VERSION before including node\_api.h (Chengzhong Wu) [#48376](https://github.com/nodejs/node/pull/48376)
+* \[[`13ac0a5e26`](https://github.com/nodejs/node/commit/13ac0a5e26)] - **test**: remove unnecessary noop function args to `mustNotCall()` (Antoine du Hamel) [#48513](https://github.com/nodejs/node/pull/48513)
+* \[[`8fdd4c55b3`](https://github.com/nodejs/node/commit/8fdd4c55b3)] - **test**: skip test-runner-watch-mode on IBMi (Moshe Atlow) [#48473](https://github.com/nodejs/node/pull/48473)
+* \[[`9d90409241`](https://github.com/nodejs/node/commit/9d90409241)] - **test**: fix flaky test-watch-mode (Moshe Atlow) [#48147](https://github.com/nodejs/node/pull/48147)
+* \[[`27a4bc7c32`](https://github.com/nodejs/node/commit/27a4bc7c32)] - **test**: add missing \<algorithm> include for std::find (Sam James) [#48380](https://github.com/nodejs/node/pull/48380)
+* \[[`cb92c4b9fe`](https://github.com/nodejs/node/commit/cb92c4b9fe)] - **test**: update url web-platform tests (Yagiz Nizipli) [#48319](https://github.com/nodejs/node/pull/48319)
+* \[[`f35c4d3190`](https://github.com/nodejs/node/commit/f35c4d3190)] - **test**: ignore the copied entry\_point.c (Luigi Pinca) [#48297](https://github.com/nodejs/node/pull/48297)
+* \[[`41d1e6888f`](https://github.com/nodejs/node/commit/41d1e6888f)] - **test**: refactor test-gc-http-client-timeout (Luigi Pinca) [#48292](https://github.com/nodejs/node/pull/48292)
+* \[[`125bca621a`](https://github.com/nodejs/node/commit/125bca621a)] - **test**: update encoding web-platform tests (Yagiz Nizipli) [#48320](https://github.com/nodejs/node/pull/48320)
+* \[[`e9ac111d02`](https://github.com/nodejs/node/commit/e9ac111d02)] - **test**: update FileAPI web-platform tests (Yagiz Nizipli) [#48322](https://github.com/nodejs/node/pull/48322)
+* \[[`3da57d17f5`](https://github.com/nodejs/node/commit/3da57d17f5)] - **test**: update user-timing web-platform tests (Yagiz Nizipli) [#48321](https://github.com/nodejs/node/pull/48321)
+* \[[`c728b8a29b`](https://github.com/nodejs/node/commit/c728b8a29b)] - **test**: fix `test-net-autoselectfamily` for kernel without IPv6 support (Livia Medeiros) [#45856](https://github.com/nodejs/node/pull/45856)
+* \[[`6de7aa1d19`](https://github.com/nodejs/node/commit/6de7aa1d19)] - **test**: move `test-tls-autoselectfamily-servername` to `test/internet` (Antoine du Hamel) [#47029](https://github.com/nodejs/node/pull/47029)
+* \[[`2de9868292`](https://github.com/nodejs/node/commit/2de9868292)] - **test**: validate host with commas on url.parse (Yagiz Nizipli) [#48878](https://github.com/nodejs/node/pull/48878)
+* \[[`e7d2e8ef2a`](https://github.com/nodejs/node/commit/e7d2e8ef2a)] - **test**: delete test-net-bytes-per-incoming-chunk-overhead (Michaël Zasso) [#48811](https://github.com/nodejs/node/pull/48811)
+* \[[`f5494fa1b0`](https://github.com/nodejs/node/commit/f5494fa1b0)] - **test\_runner**: fixed `test` shorthands return type (Shocker) [#48555](https://github.com/nodejs/node/pull/48555)
+* \[[`7051cafdfa`](https://github.com/nodejs/node/commit/7051cafdfa)] - **test\_runner**: make `--test-name-pattern` recursive (Moshe Atlow) [#48382](https://github.com/nodejs/node/pull/48382)
+* \[[`f302286442`](https://github.com/nodejs/node/commit/f302286442)] - **test\_runner**: refactor coverage report output for readability (Damien Seguin) [#47791](https://github.com/nodejs/node/pull/47791)
+* \[[`7822a541e5`](https://github.com/nodejs/node/commit/7822a541e5)] - **timers**: support Symbol.dispose (Moshe Atlow) [#48633](https://github.com/nodejs/node/pull/48633)
+* \[[`3eeca52db1`](https://github.com/nodejs/node/commit/3eeca52db1)] - **tls**: fix bugs of double TLS (rogertyang) [#48969](https://github.com/nodejs/node/pull/48969)
+* \[[`4826379516`](https://github.com/nodejs/node/commit/4826379516)] - **tools**: run fetch\_deps.py with Python 3 (Richard Lau) [#48729](https://github.com/nodejs/node/pull/48729)
+* \[[`e2688c8d79`](https://github.com/nodejs/node/commit/e2688c8d79)] - **tools**: update doc to unist-util-select\@5.0.0 unist-util-visit\@5.0.0 (Node.js GitHub Bot) [#48714](https://github.com/nodejs/node/pull/48714)
+* \[[`7399481096`](https://github.com/nodejs/node/commit/7399481096)] - **tools**: update lint-md-dependencies to rollup\@3.26.2 (Node.js GitHub Bot) [#48705](https://github.com/nodejs/node/pull/48705)
+* \[[`31c07153ce`](https://github.com/nodejs/node/commit/31c07153ce)] - **tools**: update eslint to 8.44.0 (Node.js GitHub Bot) [#48632](https://github.com/nodejs/node/pull/48632)
+* \[[`4e53f51e24`](https://github.com/nodejs/node/commit/4e53f51e24)] - **tools**: update lint-md-dependencies to rollup\@3.26.0 (Node.js GitHub Bot) [#48631](https://github.com/nodejs/node/pull/48631)
+* \[[`7d52950a96`](https://github.com/nodejs/node/commit/7d52950a96)] - **tools**: update lint-md-dependencies (Node.js GitHub Bot) [#48544](https://github.com/nodejs/node/pull/48544)
+* \[[`e168eab3ee`](https://github.com/nodejs/node/commit/e168eab3ee)] - **tools**: update lint-md-dependencies (Node.js GitHub Bot) [#48486](https://github.com/nodejs/node/pull/48486)
+* \[[`9711bc24f6`](https://github.com/nodejs/node/commit/9711bc24f6)] - **tools**: replace sed with perl (Luigi Pinca) [#48499](https://github.com/nodejs/node/pull/48499)
+* \[[`9c1937c0a7`](https://github.com/nodejs/node/commit/9c1937c0a7)] - **tools**: update eslint to 8.43.0 (Node.js GitHub Bot) [#48487](https://github.com/nodejs/node/pull/48487)
+* \[[`9449f05ab1`](https://github.com/nodejs/node/commit/9449f05ab1)] - **tools**: update doc to to-vfile\@8.0.0 (Node.js GitHub Bot) [#48485](https://github.com/nodejs/node/pull/48485)
+* \[[`79dcd968b1`](https://github.com/nodejs/node/commit/79dcd968b1)] - **tools**: prepare tools/doc for to-vfile 8.0.0 (Rich Trott) [#48485](https://github.com/nodejs/node/pull/48485)
+* \[[`538f388ac0`](https://github.com/nodejs/node/commit/538f388ac0)] - **tools**: update lint-md-dependencies (Node.js GitHub Bot) [#48417](https://github.com/nodejs/node/pull/48417)
+* \[[`01bc10dcd5`](https://github.com/nodejs/node/commit/01bc10dcd5)] - **tools**: update create-or-update-pull-request-action (Richard Lau) [#48398](https://github.com/nodejs/node/pull/48398)
+* \[[`590a072657`](https://github.com/nodejs/node/commit/590a072657)] - **tools**: update eslint-plugin-jsdoc (Richard Lau) [#48393](https://github.com/nodejs/node/pull/48393)
+* \[[`6a5805491e`](https://github.com/nodejs/node/commit/6a5805491e)] - **tools**: update eslint to 8.42.0 (Node.js GitHub Bot) [#48328](https://github.com/nodejs/node/pull/48328)
+* \[[`2eb13e3986`](https://github.com/nodejs/node/commit/2eb13e3986)] - **tools**: disable jsdoc/no-defaults rule (Luigi Pinca) [#48328](https://github.com/nodejs/node/pull/48328)
+* \[[`3363cfa6c7`](https://github.com/nodejs/node/commit/3363cfa6c7)] - **typings**: remove unused primordials (Yagiz Nizipli) [#48509](https://github.com/nodejs/node/pull/48509)
+* \[[`c59ae86ba0`](https://github.com/nodejs/node/commit/c59ae86ba0)] - **(SEMVER-MINOR)** **url**: add value argument to has and delete methods (Sankalp Shubham) [#47885](https://github.com/nodejs/node/pull/47885)
+* \[[`f59c9636f4`](https://github.com/nodejs/node/commit/f59c9636f4)] - **url**: conform to origin getter spec changes (Yagiz Nizipli) [#48319](https://github.com/nodejs/node/pull/48319)
+* \[[`0beb5ab93d`](https://github.com/nodejs/node/commit/0beb5ab93d)] - **url**: ensure getter access do not mutate observable symbols (Antoine du Hamel) [#48897](https://github.com/nodejs/node/pull/48897)
+* \[[`0a022c496d`](https://github.com/nodejs/node/commit/0a022c496d)] - **util**: use `primordials.ArrayPrototypeIndexOf` instead of mutable method (DaisyDogs07) [#48586](https://github.com/nodejs/node/pull/48586)
+
 <a id="18.17.1"></a>
 
 ## 2023-08-09, Version 18.17.1 'Hydrogen' (LTS), @RafaelGSS
diff --git a/doc/changelogs/CHANGELOG_V19.md b/doc/changelogs/CHANGELOG_V19.md
index a9020012c99c84..0b417bd1489f44 100644
--- a/doc/changelogs/CHANGELOG_V19.md
+++ b/doc/changelogs/CHANGELOG_V19.md
@@ -26,6 +26,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [18.x](CHANGELOG_V18.md)
   * [17.x](CHANGELOG_V17.md)
diff --git a/doc/changelogs/CHANGELOG_V20.md b/doc/changelogs/CHANGELOG_V20.md
index dbd3fd45090926..10c032fa21e322 100644
--- a/doc/changelogs/CHANGELOG_V20.md
+++ b/doc/changelogs/CHANGELOG_V20.md
@@ -8,6 +8,9 @@
 </tr>
 <tr>
 <td>
+<a href="#20.8.1">20.8.1</a><br/>
+<a href="#20.8.0">20.8.0</a><br/>
+<a href="#20.7.0">20.7.0</a><br/>
 <a href="#20.6.1">20.6.1</a><br/>
 <a href="#20.6.0">20.6.0</a><br/>
 <a href="#20.5.1">20.5.1</a><br/>
@@ -23,6 +26,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
   * [17.x](CHANGELOG_V17.md)
@@ -44,6 +48,377 @@
   * [io.js](CHANGELOG_IOJS.md)
   * [Archive](CHANGELOG_ARCHIVE.md)
 
+<a id="20.8.1"></a>
+
+## 2023-10-13, Version 20.8.1 (Current), @RafaelGSS
+
+This is a security release.
+
+### Notable Changes
+
+The following CVEs are fixed in this release:
+
+* [CVE-2023-44487](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-44487): `nghttp2` Security Release (High)
+* [CVE-2023-45143](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-45143): `undici` Security Release (High)
+* [CVE-2023-39332](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-39332): Path traversal through path stored in Uint8Array (High)
+* [CVE-2023-39331](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-39331): Permission model improperly protects against path traversal (High)
+* [CVE-2023-38552](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-38552):  Integrity checks according to policies can be circumvented (Medium)
+* [CVE-2023-39333](https://cve.mitre.org/cgi-bin/cvename.cgi?name=CVE-2023-39333): Code injection via WebAssembly export names (Low)
+
+More detailed information on each of the vulnerabilities can be found in [October 2023 Security Releases](https://nodejs.org/en/blog/vulnerability/october-2023-security-releases/) blog post.
+
+### Commits
+
+* \[[`c86883e844`](https://github.com/nodejs/node/commit/c86883e844)] - **deps**: update nghttp2 to 1.57.0 (James M Snell) [#50121](https://github.com/nodejs/node/pull/50121)
+* \[[`2860631359`](https://github.com/nodejs/node/commit/2860631359)] - **deps**: update undici to v5.26.3 (Matteo Collina) [#50153](https://github.com/nodejs/node/pull/50153)
+* \[[`cd37838bf8`](https://github.com/nodejs/node/commit/cd37838bf8)] - **lib**: let deps require `node` prefixed modules (Matthew Aitken) [#50047](https://github.com/nodejs/node/pull/50047)
+* \[[`f5c90b2951`](https://github.com/nodejs/node/commit/f5c90b2951)] - **module**: fix code injection through export names (Tobias Nießen) [nodejs-private/node-private#461](https://github.com/nodejs-private/node-private/pull/461)
+* \[[`fa5dae1944`](https://github.com/nodejs/node/commit/fa5dae1944)] - **permission**: fix Uint8Array path traversal (Tobias Nießen) [nodejs-private/node-private#456](https://github.com/nodejs-private/node-private/pull/456)
+* \[[`cd35275111`](https://github.com/nodejs/node/commit/cd35275111)] - **permission**: improve path traversal protection (Tobias Nießen) [nodejs-private/node-private#456](https://github.com/nodejs-private/node-private/pull/456)
+* \[[`a4cb7fc7c0`](https://github.com/nodejs/node/commit/a4cb7fc7c0)] - **policy**: use tamper-proof integrity check function (Tobias Nießen) [nodejs-private/node-private#462](https://github.com/nodejs-private/node-private/pull/462)
+
+<a id="20.8.0"></a>
+
+## 2023-09-28, Version 20.8.0 (Current), @ruyadorno
+
+### Notable Changes
+
+#### Stream performance improvements
+
+Performance improvements to writable and readable streams, improving the creation and destruction by ±15% and reducing the memory overhead each stream takes in Node.js
+
+Contributed by Benjamin Gruenbaum in [#49745](https://github.com/nodejs/node/pull/49745) and Raz Luvaton in [#49834](https://github.com/nodejs/node/pull/49834).
+
+Performance improvements for readable webstream, improving readable stream async iterator consumption by ±140% and improving readable stream `pipeTo` consumption by ±60%
+
+Contributed by Raz Luvaton in [#49662](https://github.com/nodejs/node/pull/49662) and [#49690](https://github.com/nodejs/node/pull/49690).
+
+#### Rework of memory management in `vm` APIs with the `importModuleDynamically` option
+
+This rework addressed a series of long-standing memory leaks and use-after-free issues in the following APIs that support `importModuleDynamically`:
+
+* `vm.Script`
+* `vm.compileFunction`
+* `vm.SyntheticModule`
+* `vm.SourceTextModule`
+
+This should enable affected users to upgrade from older versions of Node.js.
+
+Contributed by Joyee Cheung in [#48510](https://github.com/nodejs/node/pull/48510).
+
+#### Other notable changes
+
+* \[[`32d4d29d02`](https://github.com/nodejs/node/commit/32d4d29d02)] - **deps**: add v8::Object::SetInternalFieldForNodeCore() (Joyee Cheung) [#49874](https://github.com/nodejs/node/pull/49874)
+* \[[`0e686d096b`](https://github.com/nodejs/node/commit/0e686d096b)] - **doc**: deprecate `fs.F_OK`, `fs.R_OK`, `fs.W_OK`, `fs.X_OK` (Livia Medeiros) [#49683](https://github.com/nodejs/node/pull/49683)
+* \[[`a5dd057540`](https://github.com/nodejs/node/commit/a5dd057540)] - **doc**: deprecate `util.toUSVString` (Yagiz Nizipli) [#49725](https://github.com/nodejs/node/pull/49725)
+* \[[`7b6a73172f`](https://github.com/nodejs/node/commit/7b6a73172f)] - **doc**: deprecate calling `promisify` on a function that returns a promise (Antoine du Hamel) [#49647](https://github.com/nodejs/node/pull/49647)
+* \[[`1beefd5f16`](https://github.com/nodejs/node/commit/1beefd5f16)] - **esm**: set all hooks as release candidate (Geoffrey Booth) [#49597](https://github.com/nodejs/node/pull/49597)
+* \[[`b0ce78a75b`](https://github.com/nodejs/node/commit/b0ce78a75b)] - **module**: fix the leak in SourceTextModule and ContextifySript (Joyee Cheung) [#48510](https://github.com/nodejs/node/pull/48510)
+* \[[`4e578f8ab1`](https://github.com/nodejs/node/commit/4e578f8ab1)] - **module**: fix leak of vm.SyntheticModule (Joyee Cheung) [#48510](https://github.com/nodejs/node/pull/48510)
+* \[[`69e4218772`](https://github.com/nodejs/node/commit/69e4218772)] - **module**: use symbol in WeakMap to manage host defined options (Joyee Cheung) [#48510](https://github.com/nodejs/node/pull/48510)
+* \[[`14ece0aa76`](https://github.com/nodejs/node/commit/14ece0aa76)] - **(SEMVER-MINOR)** **src**: allow embedders to override NODE\_MODULE\_VERSION (Cheng Zhao) [#49279](https://github.com/nodejs/node/pull/49279)
+* \[[`9fd67fbff0`](https://github.com/nodejs/node/commit/9fd67fbff0)] - **stream**: use bitmap in writable state (Raz Luvaton) [#49834](https://github.com/nodejs/node/pull/49834)
+* \[[`0ccd4638ac`](https://github.com/nodejs/node/commit/0ccd4638ac)] - **stream**: use bitmap in readable state (Benjamin Gruenbaum) [#49745](https://github.com/nodejs/node/pull/49745)
+* \[[`7c5e322346`](https://github.com/nodejs/node/commit/7c5e322346)] - **stream**: improve webstream readable async iterator performance (Raz Luvaton) [#49662](https://github.com/nodejs/node/pull/49662)
+* \[[`80b342cc38`](https://github.com/nodejs/node/commit/80b342cc38)] - **(SEMVER-MINOR)** **test\_runner**: accept `testOnly` in `run` (Moshe Atlow) [#49753](https://github.com/nodejs/node/pull/49753)
+* \[[`17a05b141d`](https://github.com/nodejs/node/commit/17a05b141d)] - **(SEMVER-MINOR)** **test\_runner**: add junit reporter (Moshe Atlow) [#49614](https://github.com/nodejs/node/pull/49614)
+
+### Commits
+
+* \[[`4879e3fbbe`](https://github.com/nodejs/node/commit/4879e3fbbe)] - **benchmark**: add a benchmark for read() of ReadableStreams (Debadree Chatterjee) [#49622](https://github.com/nodejs/node/pull/49622)
+* \[[`78a6c73157`](https://github.com/nodejs/node/commit/78a6c73157)] - **benchmark**: shorten pipe-to by reducing number of chunks (Raz Luvaton) [#49577](https://github.com/nodejs/node/pull/49577)
+* \[[`4126a6e4c9`](https://github.com/nodejs/node/commit/4126a6e4c9)] - **benchmark**: fix webstream pipe-to (Raz Luvaton) [#49552](https://github.com/nodejs/node/pull/49552)
+* \[[`6010a91825`](https://github.com/nodejs/node/commit/6010a91825)] - **bootstrap**: do not expand argv1 for snapshots (Joyee Cheung) [#49506](https://github.com/nodejs/node/pull/49506)
+* \[[`8480280c4b`](https://github.com/nodejs/node/commit/8480280c4b)] - **bootstrap**: only use the isolate snapshot when compiling code cache (Joyee Cheung) [#49288](https://github.com/nodejs/node/pull/49288)
+* \[[`b30754aa87`](https://github.com/nodejs/node/commit/b30754aa87)] - **build**: run embedtest using node executable (Joyee Cheung) [#49506](https://github.com/nodejs/node/pull/49506)
+* \[[`31db0b8e2b`](https://github.com/nodejs/node/commit/31db0b8e2b)] - **build**: add --write-snapshot-as-array-literals to configure.py (Joyee Cheung) [#49312](https://github.com/nodejs/node/pull/49312)
+* \[[`6fcb51d3ba`](https://github.com/nodejs/node/commit/6fcb51d3ba)] - **debugger**: use `internal/url.URL` instead of `url.parse` (LiviaMedeiros) [#49590](https://github.com/nodejs/node/pull/49590)
+* \[[`32d4d29d02`](https://github.com/nodejs/node/commit/32d4d29d02)] - **deps**: add v8::Object::SetInternalFieldForNodeCore() (Joyee Cheung) [#49874](https://github.com/nodejs/node/pull/49874)
+* \[[`ad37cadc3f`](https://github.com/nodejs/node/commit/ad37cadc3f)] - **deps**: V8: backport de9a5de2274f (Joyee Cheung) [#49703](https://github.com/nodejs/node/pull/49703)
+* \[[`cdd1c66222`](https://github.com/nodejs/node/commit/cdd1c66222)] - **deps**: V8: cherry-pick b33bf2dfd261 (Joyee Cheung) [#49703](https://github.com/nodejs/node/pull/49703)
+* \[[`61d18d6473`](https://github.com/nodejs/node/commit/61d18d6473)] - **deps**: update undici to 5.24.0 (Node.js GitHub Bot) [#49559](https://github.com/nodejs/node/pull/49559)
+* \[[`b8a4fef393`](https://github.com/nodejs/node/commit/b8a4fef393)] - **deps**: remove pthread-fixes.c from uv.gyp (Ben Noordhuis) [#49744](https://github.com/nodejs/node/pull/49744)
+* \[[`6c86c0683c`](https://github.com/nodejs/node/commit/6c86c0683c)] - **deps**: update googletest to d1467f5 (Node.js GitHub Bot) [#49676](https://github.com/nodejs/node/pull/49676)
+* \[[`1424404742`](https://github.com/nodejs/node/commit/1424404742)] - **deps**: update nghttp2 to 1.56.0 (Node.js GitHub Bot) [#49582](https://github.com/nodejs/node/pull/49582)
+* \[[`15b54ff95d`](https://github.com/nodejs/node/commit/15b54ff95d)] - **deps**: update googletest to 8a6feab (Node.js GitHub Bot) [#49463](https://github.com/nodejs/node/pull/49463)
+* \[[`2ceab877c2`](https://github.com/nodejs/node/commit/2ceab877c2)] - **deps**: update corepack to 0.20.0 (Node.js GitHub Bot) [#49464](https://github.com/nodejs/node/pull/49464)
+* \[[`4814872ddc`](https://github.com/nodejs/node/commit/4814872ddc)] - **doc**: fix `DEP0176` number (LiviaMedeiros) [#49858](https://github.com/nodejs/node/pull/49858)
+* \[[`0e686d096b`](https://github.com/nodejs/node/commit/0e686d096b)] - **doc**: deprecate `fs.F_OK`, `fs.R_OK`, `fs.W_OK`, `fs.X_OK` (Livia Medeiros) [#49683](https://github.com/nodejs/node/pull/49683)
+* \[[`5877c403a2`](https://github.com/nodejs/node/commit/5877c403a2)] - **doc**: add mertcanaltin as a triager (mert.altin) [#49826](https://github.com/nodejs/node/pull/49826)
+* \[[`864fe56432`](https://github.com/nodejs/node/commit/864fe56432)] - **doc**: add `git node backport` way to the backporting guide (Raz Luvaton) [#49760](https://github.com/nodejs/node/pull/49760)
+* \[[`e0f93492d5`](https://github.com/nodejs/node/commit/e0f93492d5)] - **doc**: improve documentation about ICU data fallback (Joyee Cheung) [#49666](https://github.com/nodejs/node/pull/49666)
+* \[[`a5dd057540`](https://github.com/nodejs/node/commit/a5dd057540)] - **doc**: deprecate `util.toUSVString` (Yagiz Nizipli) [#49725](https://github.com/nodejs/node/pull/49725)
+* \[[`774c1cfd52`](https://github.com/nodejs/node/commit/774c1cfd52)] - **doc**: add missing function call to example for `util.promisify` (Jungku Lee) [#49719](https://github.com/nodejs/node/pull/49719)
+* \[[`fe78a34845`](https://github.com/nodejs/node/commit/fe78a34845)] - **doc**: update output of example in `mimeParams.set()` (Deokjin Kim) [#49718](https://github.com/nodejs/node/pull/49718)
+* \[[`4175ea33bd`](https://github.com/nodejs/node/commit/4175ea33bd)] - **doc**: add missed `inspect` with numericSeparator to example (Deokjin Kim) [#49717](https://github.com/nodejs/node/pull/49717)
+* \[[`3a88571972`](https://github.com/nodejs/node/commit/3a88571972)] - **doc**: fix history comments (Antoine du Hamel) [#49701](https://github.com/nodejs/node/pull/49701)
+* \[[`db4ab1ccbb`](https://github.com/nodejs/node/commit/db4ab1ccbb)] - **doc**: add missing history info for `import.meta.resolve` (Antoine du Hamel) [#49700](https://github.com/nodejs/node/pull/49700)
+* \[[`a304d1ee19`](https://github.com/nodejs/node/commit/a304d1ee19)] - **doc**: link maintaining deps to pull-request.md (Marco Ippolito) [#49716](https://github.com/nodejs/node/pull/49716)
+* \[[`35294486ad`](https://github.com/nodejs/node/commit/35294486ad)] - **doc**: fix print results in `events` (Jungku Lee) [#49548](https://github.com/nodejs/node/pull/49548)
+* \[[`9f0b0e15c9`](https://github.com/nodejs/node/commit/9f0b0e15c9)] - **doc**: alphabetize cli.md sections (Geoffrey Booth) [#49668](https://github.com/nodejs/node/pull/49668)
+* \[[`7b6a73172f`](https://github.com/nodejs/node/commit/7b6a73172f)] - **doc**: deprecate calling `promisify` on a function that returns a promise (Antoine du Hamel) [#49647](https://github.com/nodejs/node/pull/49647)
+* \[[`d316b32fff`](https://github.com/nodejs/node/commit/d316b32fff)] - **doc**: update `corepack.md` to account for 0.20.0 changes (Antoine du Hamel) [#49486](https://github.com/nodejs/node/pull/49486)
+* \[[`c2eac7dc7c`](https://github.com/nodejs/node/commit/c2eac7dc7c)] - **doc**: remove `@anonrig` from performance initiative (Yagiz Nizipli) [#49641](https://github.com/nodejs/node/pull/49641)
+* \[[`3d839fbf87`](https://github.com/nodejs/node/commit/3d839fbf87)] - **doc**: mark Node.js 16 as End-of-Life (Richard Lau) [#49651](https://github.com/nodejs/node/pull/49651)
+* \[[`53fb5aead8`](https://github.com/nodejs/node/commit/53fb5aead8)] - **doc**: save user preference for JS flavor (Vidar Eldøy) [#49526](https://github.com/nodejs/node/pull/49526)
+* \[[`e3594d5658`](https://github.com/nodejs/node/commit/e3594d5658)] - **doc**: update documentation for node:process warning (Shubham Pandey) [#49517](https://github.com/nodejs/node/pull/49517)
+* \[[`8e033c3963`](https://github.com/nodejs/node/commit/8e033c3963)] - **doc**: rename possibly confusing variable and CSS class (Antoine du Hamel) [#49536](https://github.com/nodejs/node/pull/49536)
+* \[[`d0e0eb4bb3`](https://github.com/nodejs/node/commit/d0e0eb4bb3)] - **doc**: update outdated history info (Antoine du Hamel) [#49530](https://github.com/nodejs/node/pull/49530)
+* \[[`b4724e2e3a`](https://github.com/nodejs/node/commit/b4724e2e3a)] - **doc**: close a parenthesis (Sébastien Règne) [#49525](https://github.com/nodejs/node/pull/49525)
+* \[[`0471c5798e`](https://github.com/nodejs/node/commit/0471c5798e)] - **doc**: cast GetInternalField() return type to v8::Value in addons.md (Joyee Cheung) [#49439](https://github.com/nodejs/node/pull/49439)
+* \[[`9f8bea3dda`](https://github.com/nodejs/node/commit/9f8bea3dda)] - **doc**: fix documentation for input option in child\_process (Ariel Weiss) [#49481](https://github.com/nodejs/node/pull/49481)
+* \[[`f3fea92f8a`](https://github.com/nodejs/node/commit/f3fea92f8a)] - **doc**: fix missing imports in `test.run` code examples (Oshri Asulin) [#49489](https://github.com/nodejs/node/pull/49489)
+* \[[`e426b77b67`](https://github.com/nodejs/node/commit/e426b77b67)] - **doc**: fix documentation for fs.createWriteStream highWaterMark option (Mert Can Altın) [#49456](https://github.com/nodejs/node/pull/49456)
+* \[[`2b119108ff`](https://github.com/nodejs/node/commit/2b119108ff)] - **doc**: updated releasers instructions for node.js website (Claudio W) [#49427](https://github.com/nodejs/node/pull/49427)
+* \[[`b9d4a80183`](https://github.com/nodejs/node/commit/b9d4a80183)] - **doc**: edit `import.meta.resolve` documentation (Antoine du Hamel) [#49247](https://github.com/nodejs/node/pull/49247)
+* \[[`f67433f666`](https://github.com/nodejs/node/commit/f67433f666)] - **doc,tools**: switch to `@node-core/utils` (Michaël Zasso) [#49851](https://github.com/nodejs/node/pull/49851)
+* \[[`142e256fc5`](https://github.com/nodejs/node/commit/142e256fc5)] - **errors**: improve classRegExp in errors.js (Uzlopak) [#49643](https://github.com/nodejs/node/pull/49643)
+* \[[`6377f1bce2`](https://github.com/nodejs/node/commit/6377f1bce2)] - **errors**: use `determineSpecificType` in more error messages (Antoine du Hamel) [#49580](https://github.com/nodejs/node/pull/49580)
+* \[[`05f0fcb4c4`](https://github.com/nodejs/node/commit/05f0fcb4c4)] - **esm**: identify parent importing a url with invalid host (Jacob Smith) [#49736](https://github.com/nodejs/node/pull/49736)
+* \[[`8a6f5fb8f3`](https://github.com/nodejs/node/commit/8a6f5fb8f3)] - **esm**: fix return type of `import.meta.resolve` (Antoine du Hamel) [#49698](https://github.com/nodejs/node/pull/49698)
+* \[[`a6140f1b8c`](https://github.com/nodejs/node/commit/a6140f1b8c)] - **esm**: update loaders warning (Geoffrey Booth) [#49633](https://github.com/nodejs/node/pull/49633)
+* \[[`521a9327e0`](https://github.com/nodejs/node/commit/521a9327e0)] - **esm**: fix support for `URL` instances in `register` (Antoine du Hamel) [#49655](https://github.com/nodejs/node/pull/49655)
+* \[[`3a9ea0925a`](https://github.com/nodejs/node/commit/3a9ea0925a)] - **esm**: clarify ERR\_REQUIRE\_ESM errors (Daniel Compton) [#49521](https://github.com/nodejs/node/pull/49521)
+* \[[`1beefd5f16`](https://github.com/nodejs/node/commit/1beefd5f16)] - **esm**: set all hooks as release candidate (Geoffrey Booth) [#49597](https://github.com/nodejs/node/pull/49597)
+* \[[`be48267888`](https://github.com/nodejs/node/commit/be48267888)] - **esm**: remove return value for `Module.register` (Antoine du Hamel) [#49529](https://github.com/nodejs/node/pull/49529)
+* \[[`e74a075124`](https://github.com/nodejs/node/commit/e74a075124)] - **esm**: refactor test-esm-loader-resolve-type (Geoffrey Booth) [#49493](https://github.com/nodejs/node/pull/49493)
+* \[[`17823b3533`](https://github.com/nodejs/node/commit/17823b3533)] - **esm**: refactor test-esm-named-exports (Geoffrey Booth) [#49493](https://github.com/nodejs/node/pull/49493)
+* \[[`f34bd15ac1`](https://github.com/nodejs/node/commit/f34bd15ac1)] - **esm**: refactor mocking test (Geoffrey Booth) [#49465](https://github.com/nodejs/node/pull/49465)
+* \[[`ec323bbd99`](https://github.com/nodejs/node/commit/ec323bbd99)] - **fs**: replace `SetMethodNoSideEffect` in node\_file (CanadaHonk) [#49857](https://github.com/nodejs/node/pull/49857)
+* \[[`6acf800123`](https://github.com/nodejs/node/commit/6acf800123)] - **fs**: improve error performance for `unlinkSync` (CanadaHonk) [#49856](https://github.com/nodejs/node/pull/49856)
+* \[[`31702c9403`](https://github.com/nodejs/node/commit/31702c9403)] - **fs**: improve `readFileSync` with file descriptors (Yagiz Nizipli) [#49691](https://github.com/nodejs/node/pull/49691)
+* \[[`835f9fe7b9`](https://github.com/nodejs/node/commit/835f9fe7b9)] - **fs**: fix file descriptor validator (Yagiz Nizipli) [#49752](https://github.com/nodejs/node/pull/49752)
+* \[[`b618fe262f`](https://github.com/nodejs/node/commit/b618fe262f)] - **fs**: improve error performance of `opendirSync` (Yagiz Nizipli) [#49705](https://github.com/nodejs/node/pull/49705)
+* \[[`938471ef55`](https://github.com/nodejs/node/commit/938471ef55)] - **fs**: improve error performance of sync methods (Yagiz Nizipli) [#49593](https://github.com/nodejs/node/pull/49593)
+* \[[`db3fc6d087`](https://github.com/nodejs/node/commit/db3fc6d087)] - **fs**: fix readdir and opendir recursive with unknown file types (William Marlow) [#49603](https://github.com/nodejs/node/pull/49603)
+* \[[`0f020ed22d`](https://github.com/nodejs/node/commit/0f020ed22d)] - **gyp**: put cctest filenames in variables (Cheng Zhao) [#49178](https://github.com/nodejs/node/pull/49178)
+* \[[`0ce1e94d12`](https://github.com/nodejs/node/commit/0ce1e94d12)] - **lib**: update encoding sets in `WHATWG API` (Jungku Lee) [#49610](https://github.com/nodejs/node/pull/49610)
+* \[[`efd6815a7a`](https://github.com/nodejs/node/commit/efd6815a7a)] - **lib**: fix `internalBinding` typings (Yagiz Nizipli) [#49742](https://github.com/nodejs/node/pull/49742)
+* \[[`1287d5b74e`](https://github.com/nodejs/node/commit/1287d5b74e)] - **lib**: allow byob reader for 'blob.stream()' (Debadree Chatterjee) [#49713](https://github.com/nodejs/node/pull/49713)
+* \[[`bbc710522d`](https://github.com/nodejs/node/commit/bbc710522d)] - **lib**: reset the cwd cache before execution (Maël Nison) [#49684](https://github.com/nodejs/node/pull/49684)
+* \[[`f62d649e4d`](https://github.com/nodejs/node/commit/f62d649e4d)] - **lib**: use internal `fileURLToPath` (Deokjin Kim) [#49558](https://github.com/nodejs/node/pull/49558)
+* \[[`e515046941`](https://github.com/nodejs/node/commit/e515046941)] - **lib**: use internal `pathToFileURL` (Livia Medeiros) [#49553](https://github.com/nodejs/node/pull/49553)
+* \[[`00608e8070`](https://github.com/nodejs/node/commit/00608e8070)] - **lib**: check SharedArrayBuffer availability in freeze\_intrinsics.js (Milan Burda) [#49482](https://github.com/nodejs/node/pull/49482)
+* \[[`8bfbe7079c`](https://github.com/nodejs/node/commit/8bfbe7079c)] - **meta**: fix linter error (Antoine du Hamel) [#49755](https://github.com/nodejs/node/pull/49755)
+* \[[`58f7a9e096`](https://github.com/nodejs/node/commit/58f7a9e096)] - **meta**: add primordials strategic initiative (Benjamin Gruenbaum) [#49706](https://github.com/nodejs/node/pull/49706)
+* \[[`5366027756`](https://github.com/nodejs/node/commit/5366027756)] - **meta**: bump github/codeql-action from 2.21.2 to 2.21.5 (dependabot\[bot]) [#49438](https://github.com/nodejs/node/pull/49438)
+* \[[`fe26b74082`](https://github.com/nodejs/node/commit/fe26b74082)] - **meta**: bump rtCamp/action-slack-notify from 2.2.0 to 2.2.1 (dependabot\[bot]) [#49437](https://github.com/nodejs/node/pull/49437)
+* \[[`b0ce78a75b`](https://github.com/nodejs/node/commit/b0ce78a75b)] - **module**: fix the leak in SourceTextModule and ContextifySript (Joyee Cheung) [#48510](https://github.com/nodejs/node/pull/48510)
+* \[[`4e578f8ab1`](https://github.com/nodejs/node/commit/4e578f8ab1)] - **module**: fix leak of vm.SyntheticModule (Joyee Cheung) [#48510](https://github.com/nodejs/node/pull/48510)
+* \[[`69e4218772`](https://github.com/nodejs/node/commit/69e4218772)] - **module**: use symbol in WeakMap to manage host defined options (Joyee Cheung) [#48510](https://github.com/nodejs/node/pull/48510)
+* \[[`96874e8fbc`](https://github.com/nodejs/node/commit/96874e8fbc)] - **node-api**: enable uncaught exceptions policy by default (Chengzhong Wu) [#49313](https://github.com/nodejs/node/pull/49313)
+* \[[`b931aeadfd`](https://github.com/nodejs/node/commit/b931aeadfd)] - **perf\_hooks**: reduce overhead of new performance\_entries (Vinicius Lourenço) [#49803](https://github.com/nodejs/node/pull/49803)
+* \[[`ad043bac31`](https://github.com/nodejs/node/commit/ad043bac31)] - **process**: add custom dir support for heapsnapshot-signal (Jithil P Ponnan) [#47854](https://github.com/nodejs/node/pull/47854)
+* \[[`8a7c10194c`](https://github.com/nodejs/node/commit/8a7c10194c)] - **repl**: don't accumulate excess indentation in .load (Daniel X Moore) [#49461](https://github.com/nodejs/node/pull/49461)
+* \[[`10a2adeed5`](https://github.com/nodejs/node/commit/10a2adeed5)] - **src**: improve error message when ICU data cannot be initialized (Joyee Cheung) [#49666](https://github.com/nodejs/node/pull/49666)
+* \[[`ce37688bac`](https://github.com/nodejs/node/commit/ce37688bac)] - **src**: remove unnecessary todo (Rafael Gonzaga) [#49227](https://github.com/nodejs/node/pull/49227)
+* \[[`f611583b71`](https://github.com/nodejs/node/commit/f611583b71)] - **src**: use SNAPSHOT\_SERDES to log snapshot ser/deserialization (Joyee Cheung) [#49637](https://github.com/nodejs/node/pull/49637)
+* \[[`a597cb8457`](https://github.com/nodejs/node/commit/a597cb8457)] - **src**: port Pipe to uv\_pipe\_bind2, uv\_pipe\_connect2 (Geoff Goodman) [#49667](https://github.com/nodejs/node/pull/49667)
+* \[[`fb21062338`](https://github.com/nodejs/node/commit/fb21062338)] - **src**: set --rehash-snapshot explicitly (Joyee Cheung) [#49556](https://github.com/nodejs/node/pull/49556)
+* \[[`14ece0aa76`](https://github.com/nodejs/node/commit/14ece0aa76)] - **(SEMVER-MINOR)** **src**: allow embedders to override NODE\_MODULE\_VERSION (Cheng Zhao) [#49279](https://github.com/nodejs/node/pull/49279)
+* \[[`4b5e23c71b`](https://github.com/nodejs/node/commit/4b5e23c71b)] - **src**: set ModuleWrap internal fields only once (Joyee Cheung) [#49391](https://github.com/nodejs/node/pull/49391)
+* \[[`2d3f5c7cab`](https://github.com/nodejs/node/commit/2d3f5c7cab)] - **src**: fix fs\_type\_to\_name default value (Mustafa Ateş Uzun) [#49239](https://github.com/nodejs/node/pull/49239)
+* \[[`cfbcb1059c`](https://github.com/nodejs/node/commit/cfbcb1059c)] - **src**: fix comment on StreamResource (rogertyang) [#49193](https://github.com/nodejs/node/pull/49193)
+* \[[`39fb83ad16`](https://github.com/nodejs/node/commit/39fb83ad16)] - **src**: do not rely on the internal field being default to undefined (Joyee Cheung) [#49413](https://github.com/nodejs/node/pull/49413)
+* \[[`9fd67fbff0`](https://github.com/nodejs/node/commit/9fd67fbff0)] - **stream**: use bitmap in writable state (Raz Luvaton) [#49834](https://github.com/nodejs/node/pull/49834)
+* \[[`0ccd4638ac`](https://github.com/nodejs/node/commit/0ccd4638ac)] - **stream**: use bitmap in readable state (Benjamin Gruenbaum) [#49745](https://github.com/nodejs/node/pull/49745)
+* \[[`b29d927010`](https://github.com/nodejs/node/commit/b29d927010)] - **stream**: improve readable webstream `pipeTo` (Raz Luvaton) [#49690](https://github.com/nodejs/node/pull/49690)
+* \[[`7c5e322346`](https://github.com/nodejs/node/commit/7c5e322346)] - **stream**: improve webstream readable async iterator performance (Raz Luvaton) [#49662](https://github.com/nodejs/node/pull/49662)
+* \[[`be211ef818`](https://github.com/nodejs/node/commit/be211ef818)] - **test**: deflake test-vm-contextified-script-leak (Joyee Cheung) [#49710](https://github.com/nodejs/node/pull/49710)
+* \[[`355f10dab2`](https://github.com/nodejs/node/commit/355f10dab2)] - **test**: use checkIfCollectable in vm leak tests (Joyee Cheung) [#49671](https://github.com/nodejs/node/pull/49671)
+* \[[`17cfc531aa`](https://github.com/nodejs/node/commit/17cfc531aa)] - **test**: add checkIfCollectable to test/common/gc.js (Joyee Cheung) [#49671](https://github.com/nodejs/node/pull/49671)
+* \[[`e49a573752`](https://github.com/nodejs/node/commit/e49a573752)] - **test**: add os setPriority, getPriority test coverage (Wael) [#38771](https://github.com/nodejs/node/pull/38771)
+* \[[`5f02711522`](https://github.com/nodejs/node/commit/5f02711522)] - **test**: deflake test-runner-output (Moshe Atlow) [#49878](https://github.com/nodejs/node/pull/49878)
+* \[[`cd9754d6a7`](https://github.com/nodejs/node/commit/cd9754d6a7)] - **test**: mark test-runner-output as flaky (Joyee Cheung) [#49854](https://github.com/nodejs/node/pull/49854)
+* \[[`5ad00424dd`](https://github.com/nodejs/node/commit/5ad00424dd)] - **test**: use mustSucceed instead of mustCall (SiddharthDevulapalli) [#49788](https://github.com/nodejs/node/pull/49788)
+* \[[`3db9b40081`](https://github.com/nodejs/node/commit/3db9b40081)] - **test**: refactor test-readline-async-iterators into a benchmark (Shubham Pandey) [#49237](https://github.com/nodejs/node/pull/49237)
+* \[[`2cc5ad7859`](https://github.com/nodejs/node/commit/2cc5ad7859)] - _**Revert**_ "**test**: mark test-http-regr-gh-2928 as flaky" (Luigi Pinca) [#49708](https://github.com/nodejs/node/pull/49708)
+* \[[`e5185b053c`](https://github.com/nodejs/node/commit/e5185b053c)] - **test**: use `fs.constants` for `fs.access` constants (Livia Medeiros) [#49685](https://github.com/nodejs/node/pull/49685)
+* \[[`b9e5b43462`](https://github.com/nodejs/node/commit/b9e5b43462)] - **test**: deflake test-http-regr-gh-2928 (Luigi Pinca) [#49574](https://github.com/nodejs/node/pull/49574)
+* \[[`1fffda504e`](https://github.com/nodejs/node/commit/1fffda504e)] - **test**: fix argument computation in embedtest (Joyee Cheung) [#49506](https://github.com/nodejs/node/pull/49506)
+* \[[`6e56f2db52`](https://github.com/nodejs/node/commit/6e56f2db52)] - **test**: skip test-child-process-stdio-reuse-readable-stdio on Windows (Joyee Cheung) [#49621](https://github.com/nodejs/node/pull/49621)
+* \[[`ab3afb330d`](https://github.com/nodejs/node/commit/ab3afb330d)] - **test**: mark test-runner-watch-mode as flaky (Joyee Cheung) [#49627](https://github.com/nodejs/node/pull/49627)
+* \[[`185d9b50db`](https://github.com/nodejs/node/commit/185d9b50db)] - **test**: deflake test-tls-socket-close (Luigi Pinca) [#49575](https://github.com/nodejs/node/pull/49575)
+* \[[`c70c74a9e6`](https://github.com/nodejs/node/commit/c70c74a9e6)] - **test**: show more info on failure in test-cli-syntax-require.js (Joyee Cheung) [#49561](https://github.com/nodejs/node/pull/49561)
+* \[[`ed7c6d1114`](https://github.com/nodejs/node/commit/ed7c6d1114)] - **test**: mark test-http-regr-gh-2928 as flaky (Joyee Cheung) [#49565](https://github.com/nodejs/node/pull/49565)
+* \[[`3599eebab9`](https://github.com/nodejs/node/commit/3599eebab9)] - **test**: use spawnSyncAndExitWithoutError in sea tests (Joyee Cheung) [#49543](https://github.com/nodejs/node/pull/49543)
+* \[[`f79b153e89`](https://github.com/nodejs/node/commit/f79b153e89)] - **test**: use spawnSyncAndExitWithoutError in test/common/sea.js (Joyee Cheung) [#49543](https://github.com/nodejs/node/pull/49543)
+* \[[`c079c73769`](https://github.com/nodejs/node/commit/c079c73769)] - **test**: use setImmediate() in test-heapdump-shadowrealm.js (Joyee Cheung) [#49573](https://github.com/nodejs/node/pull/49573)
+* \[[`667a92493c`](https://github.com/nodejs/node/commit/667a92493c)] - **test**: skip test-child-process-pipe-dataflow\.js on Windows (Joyee Cheung) [#49563](https://github.com/nodejs/node/pull/49563)
+* \[[`91af0a9a3c`](https://github.com/nodejs/node/commit/91af0a9a3c)] - _**Revert**_ "**test**: ignore the copied entry\_point.c" (Chengzhong Wu) [#49515](https://github.com/nodejs/node/pull/49515)
+* \[[`567afc71b8`](https://github.com/nodejs/node/commit/567afc71b8)] - **test**: avoid copying test source files (Chengzhong Wu) [#49515](https://github.com/nodejs/node/pull/49515)
+* \[[`ced25a976d`](https://github.com/nodejs/node/commit/ced25a976d)] - **test**: increase coverage of `Module.register` and `initialize` hook (Antoine du Hamel) [#49532](https://github.com/nodejs/node/pull/49532)
+* \[[`be02fbdb8a`](https://github.com/nodejs/node/commit/be02fbdb8a)] - **test**: isolate `globalPreload` tests (Geoffrey Booth) [#49545](https://github.com/nodejs/node/pull/49545)
+* \[[`f214428845`](https://github.com/nodejs/node/commit/f214428845)] - **test**: split test-crypto-dh to avoid timeout on slow machines in the CI (Joyee Cheung) [#49492](https://github.com/nodejs/node/pull/49492)
+* \[[`3987094569`](https://github.com/nodejs/node/commit/3987094569)] - **test**: make `test-dotenv-node-options` locale-independent (Livia Medeiros) [#49470](https://github.com/nodejs/node/pull/49470)
+* \[[`34c1741792`](https://github.com/nodejs/node/commit/34c1741792)] - **test**: add test for urlstrings usage in `node:fs` (Livia Medeiros) [#49471](https://github.com/nodejs/node/pull/49471)
+* \[[`c3c6c4f007`](https://github.com/nodejs/node/commit/c3c6c4f007)] - **test**: make test-worker-prof more robust (Joyee Cheung) [#49274](https://github.com/nodejs/node/pull/49274)
+* \[[`843df1a4da`](https://github.com/nodejs/node/commit/843df1a4da)] - **test,crypto**: update WebCryptoAPI WPT (Filip Skokan) [#49714](https://github.com/nodejs/node/pull/49714)
+* \[[`80b342cc38`](https://github.com/nodejs/node/commit/80b342cc38)] - **(SEMVER-MINOR)** **test\_runner**: accept `testOnly` in `run` (Moshe Atlow) [#49753](https://github.com/nodejs/node/pull/49753)
+* \[[`76865515b9`](https://github.com/nodejs/node/commit/76865515b9)] - **test\_runner**: fix test runner watch mode when no positional arguments (Moshe Atlow) [#49578](https://github.com/nodejs/node/pull/49578)
+* \[[`17a05b141d`](https://github.com/nodejs/node/commit/17a05b141d)] - **(SEMVER-MINOR)** **test\_runner**: add junit reporter (Moshe Atlow) [#49614](https://github.com/nodejs/node/pull/49614)
+* \[[`5672e38457`](https://github.com/nodejs/node/commit/5672e38457)] - **test\_runner**: add jsdocs to mock.js (Caio Borghi) [#49555](https://github.com/nodejs/node/pull/49555)
+* \[[`b4d42a8f2b`](https://github.com/nodejs/node/commit/b4d42a8f2b)] - **test\_runner**: fix invalid timer call (Erick Wendel) [#49477](https://github.com/nodejs/node/pull/49477)
+* \[[`f755e6786b`](https://github.com/nodejs/node/commit/f755e6786b)] - **test\_runner**: add jsdocs to MockTimers (Erick Wendel) [#49476](https://github.com/nodejs/node/pull/49476)
+* \[[`e7285d4bf0`](https://github.com/nodejs/node/commit/e7285d4bf0)] - **test\_runner**: fix typescript coverage (Moshe Atlow) [#49406](https://github.com/nodejs/node/pull/49406)
+* \[[`07a2e29bf3`](https://github.com/nodejs/node/commit/07a2e29bf3)] - **tools**: support updating @reporters/github manually (Moshe Atlow) [#49871](https://github.com/nodejs/node/pull/49871)
+* \[[`5ac6722031`](https://github.com/nodejs/node/commit/5ac6722031)] - **tools**: skip ruff on tools/node\_modules (Moshe Atlow) [#49838](https://github.com/nodejs/node/pull/49838)
+* \[[`462228bd24`](https://github.com/nodejs/node/commit/462228bd24)] - **tools**: fix uvwasi updater (Michael Dawson) [#49682](https://github.com/nodejs/node/pull/49682)
+* \[[`ff81bfb958`](https://github.com/nodejs/node/commit/ff81bfb958)] - **tools**: update lint-md-dependencies to rollup\@3.29.2 (Node.js GitHub Bot) [#49679](https://github.com/nodejs/node/pull/49679)
+* \[[`08ffc6344c`](https://github.com/nodejs/node/commit/08ffc6344c)] - **tools**: restrict internal code from using public `url` module (LiviaMedeiros) [#49590](https://github.com/nodejs/node/pull/49590)
+* \[[`728ebf6c97`](https://github.com/nodejs/node/commit/728ebf6c97)] - **tools**: update eslint to 8.49.0 (Node.js GitHub Bot) [#49586](https://github.com/nodejs/node/pull/49586)
+* \[[`20d038ffb1`](https://github.com/nodejs/node/commit/20d038ffb1)] - **tools**: update lint-md-dependencies to rollup\@3.29.0 unified\@11.0.3 (Node.js GitHub Bot) [#49584](https://github.com/nodejs/node/pull/49584)
+* \[[`210c15bd12`](https://github.com/nodejs/node/commit/210c15bd12)] - **tools**: allow passing absolute path of config.gypi in js2c (Cheng Zhao) [#49162](https://github.com/nodejs/node/pull/49162)
+* \[[`e341efe173`](https://github.com/nodejs/node/commit/e341efe173)] - **tools**: configure never-stale label correctly (Michaël Zasso) [#49498](https://github.com/nodejs/node/pull/49498)
+* \[[`a8a8a498ce`](https://github.com/nodejs/node/commit/a8a8a498ce)] - **tools**: update doc dependencies (Node.js GitHub Bot) [#49467](https://github.com/nodejs/node/pull/49467)
+* \[[`ac06607f9e`](https://github.com/nodejs/node/commit/ac06607f9e)] - **typings**: fix missing property in `ExportedHooks` (Antoine du Hamel) [#49567](https://github.com/nodejs/node/pull/49567)
+* \[[`097b59807a`](https://github.com/nodejs/node/commit/097b59807a)] - **url**: improve invalid url performance (Yagiz Nizipli) [#49692](https://github.com/nodejs/node/pull/49692)
+* \[[`7c2060cfac`](https://github.com/nodejs/node/commit/7c2060cfac)] - **util**: add `getCwdSafe` internal util fn (João Lenon) [#48434](https://github.com/nodejs/node/pull/48434)
+* \[[`c23c60f545`](https://github.com/nodejs/node/commit/c23c60f545)] - **zlib**: disable CRC32 SIMD optimization (Luigi Pinca) [#49511](https://github.com/nodejs/node/pull/49511)
+
+<a id="20.7.0"></a>
+
+## 2023-09-18, Version 20.7.0 (Current), @UlisesGascon
+
+### Notable Changes
+
+* \[[`022f1b70c1`](https://github.com/nodejs/node/commit/022f1b70c1)] - **src**: support multiple `--env-file` declarations (Yagiz Nizipli) [#49542](https://github.com/nodejs/node/pull/49542)
+* \[[`4a1d1cad61`](https://github.com/nodejs/node/commit/4a1d1cad61)] - **crypto**: update root certificates to NSS 3.93 (Node.js GitHub Bot) [#49341](https://github.com/nodejs/node/pull/49341)
+* \[[`a1a65f593c`](https://github.com/nodejs/node/commit/a1a65f593c)] - **deps**: upgrade npm to 10.1.0 (npm team) [#49570](https://github.com/nodejs/node/pull/49570)
+* \[[`6c2480cad9`](https://github.com/nodejs/node/commit/6c2480cad9)] - **(SEMVER-MINOR)** **deps**: upgrade npm to 10.0.0 (npm team) [#49423](https://github.com/nodejs/node/pull/49423)
+* \[[`bef900e56b`](https://github.com/nodejs/node/commit/bef900e56b)] - **doc**: move and rename loaders section (Geoffrey Booth) [#49261](https://github.com/nodejs/node/pull/49261)
+* \[[`db4ce8a593`](https://github.com/nodejs/node/commit/db4ce8a593)] - **doc**: add release key for Ulises Gascon (Ulises Gascón) [#49196](https://github.com/nodejs/node/pull/49196)
+* \[[`11c85ffa98`](https://github.com/nodejs/node/commit/11c85ffa98)] - **(SEMVER-MINOR)** **lib**: add api to detect whether source-maps are enabled (翠 / green) [#46391](https://github.com/nodejs/node/pull/46391)
+* \[[`ec51e25ed7`](https://github.com/nodejs/node/commit/ec51e25ed7)] - **src,permission**: add multiple allow-fs-\* flags (Carlos Espa) [#49047](https://github.com/nodejs/node/pull/49047)
+* \[[`efdc95fbc0`](https://github.com/nodejs/node/commit/efdc95fbc0)] - **(SEMVER-MINOR)** **test\_runner**: expose location of tests (Colin Ihrig) [#48975](https://github.com/nodejs/node/pull/48975)
+
+### Commits
+
+* \[[`e84515594e`](https://github.com/nodejs/node/commit/e84515594e)] - **benchmark**: use `tmpdir.resolve()` (Livia Medeiros) [#49137](https://github.com/nodejs/node/pull/49137)
+* \[[`f37444e896`](https://github.com/nodejs/node/commit/f37444e896)] - **bootstrap**: build code cache from deserialized isolate (Joyee Cheung) [#49099](https://github.com/nodejs/node/pull/49099)
+* \[[`af6dc1754d`](https://github.com/nodejs/node/commit/af6dc1754d)] - **bootstrap**: do not generate code cache in an unfinalized isolate (Joyee Cheung) [#49108](https://github.com/nodejs/node/pull/49108)
+* \[[`cade5716df`](https://github.com/nodejs/node/commit/cade5716df)] - **build**: add symlink to `compile_commands.json` file if needed (Juan José) [#49260](https://github.com/nodejs/node/pull/49260)
+* \[[`34a2590b05`](https://github.com/nodejs/node/commit/34a2590b05)] - **build**: expand when we run internet tests (Michael Dawson) [#49218](https://github.com/nodejs/node/pull/49218)
+* \[[`f637fd46ab`](https://github.com/nodejs/node/commit/f637fd46ab)] - **build**: fix typo `libray` -> `library` (configure.py) (michalbiesek) [#49106](https://github.com/nodejs/node/pull/49106)
+* \[[`ef3d8dd493`](https://github.com/nodejs/node/commit/ef3d8dd493)] - **crypto**: remove webcrypto EdDSA key checks and properties (Filip Skokan) [#49408](https://github.com/nodejs/node/pull/49408)
+* \[[`4a1d1cad61`](https://github.com/nodejs/node/commit/4a1d1cad61)] - **crypto**: update root certificates to NSS 3.93 (Node.js GitHub Bot) [#49341](https://github.com/nodejs/node/pull/49341)
+* \[[`7eb10a38ea`](https://github.com/nodejs/node/commit/7eb10a38ea)] - **crypto**: remove getDefaultEncoding() (Tobias Nießen) [#49170](https://github.com/nodejs/node/pull/49170)
+* \[[`772496c030`](https://github.com/nodejs/node/commit/772496c030)] - **crypto**: remove default encoding from DiffieHellman (Tobias Nießen) [#49169](https://github.com/nodejs/node/pull/49169)
+* \[[`c795083232`](https://github.com/nodejs/node/commit/c795083232)] - **crypto**: remove default encoding from Hash/Hmac (Tobias Nießen) [#49167](https://github.com/nodejs/node/pull/49167)
+* \[[`08197aa010`](https://github.com/nodejs/node/commit/08197aa010)] - **crypto**: remove default encoding from sign/verify (Tobias Nießen) [#49145](https://github.com/nodejs/node/pull/49145)
+* \[[`a1a65f593c`](https://github.com/nodejs/node/commit/a1a65f593c)] - **deps**: upgrade npm to 10.1.0 (npm team) [#49570](https://github.com/nodejs/node/pull/49570)
+* \[[`6c2480cad9`](https://github.com/nodejs/node/commit/6c2480cad9)] - **(SEMVER-MINOR)** **deps**: upgrade npm to 10.0.0 (npm team) [#49423](https://github.com/nodejs/node/pull/49423)
+* \[[`84195d9584`](https://github.com/nodejs/node/commit/84195d9584)] - **deps**: add missing thread-common.c in uv.gyp (Santiago Gimeno) [#49410](https://github.com/nodejs/node/pull/49410)
+* \[[`5b70b68b3d`](https://github.com/nodejs/node/commit/5b70b68b3d)] - **deps**: V8: cherry-pick eadaef581c29 (Adam Majer) [#49401](https://github.com/nodejs/node/pull/49401)
+* \[[`fe34d632e8`](https://github.com/nodejs/node/commit/fe34d632e8)] - **deps**: update zlib to 1.2.13.1-motley-f5fd0ad (Node.js GitHub Bot) [#49252](https://github.com/nodejs/node/pull/49252)
+* \[[`db4ce8a593`](https://github.com/nodejs/node/commit/db4ce8a593)] - **doc**: add release key for Ulises Gascon (Ulises Gascón) [#49196](https://github.com/nodejs/node/pull/49196)
+* \[[`e5f3a694cf`](https://github.com/nodejs/node/commit/e5f3a694cf)] - **doc**: fix node-api call example (Chengzhong Wu) [#49395](https://github.com/nodejs/node/pull/49395)
+* \[[`021345a724`](https://github.com/nodejs/node/commit/021345a724)] - **doc**: add news issue for Diagnostics WG (Michael Dawson) [#49306](https://github.com/nodejs/node/pull/49306)
+* \[[`f82347266b`](https://github.com/nodejs/node/commit/f82347266b)] - **doc**: clarify policy expectations (Rafael Gonzaga) [#48947](https://github.com/nodejs/node/pull/48947)
+* \[[`73cfd9c895`](https://github.com/nodejs/node/commit/73cfd9c895)] - **doc**: add print results for examples in `StringDecoder` (Jungku Lee) [#49326](https://github.com/nodejs/node/pull/49326)
+* \[[`63ab591416`](https://github.com/nodejs/node/commit/63ab591416)] - **doc**: update outdated reference to NIST SP 800-131A (Tobias Nießen) [#49316](https://github.com/nodejs/node/pull/49316)
+* \[[`935dfe2afd`](https://github.com/nodejs/node/commit/935dfe2afd)] - **doc**: use `cjs` as block code's type in `MockTimers` (Deokjin Kim) [#49309](https://github.com/nodejs/node/pull/49309)
+* \[[`7c0cd2fb87`](https://github.com/nodejs/node/commit/7c0cd2fb87)] - **doc**: update `options.filter` description for `fs.cp` (Shubham Pandey) [#49289](https://github.com/nodejs/node/pull/49289)
+* \[[`f72e79ea67`](https://github.com/nodejs/node/commit/f72e79ea67)] - **doc**: add riscv64 to list of architectures (Stewart X Addison) [#49284](https://github.com/nodejs/node/pull/49284)
+* \[[`d19c710064`](https://github.com/nodejs/node/commit/d19c710064)] - **doc**: avoid "not currently recommended" (Tobias Nießen) [#49300](https://github.com/nodejs/node/pull/49300)
+* \[[`ae656101c0`](https://github.com/nodejs/node/commit/ae656101c0)] - **doc**: update module hooks docs (Geoffrey Booth) [#49265](https://github.com/nodejs/node/pull/49265)
+* \[[`fefbdb92f2`](https://github.com/nodejs/node/commit/fefbdb92f2)] - **doc**: modify param description for end(),write() in `StringDecoder` (Jungku Lee) [#49285](https://github.com/nodejs/node/pull/49285)
+* \[[`59e66a1ebe`](https://github.com/nodejs/node/commit/59e66a1ebe)] - **doc**: use NODE\_API\_SUPPORTED\_VERSION\_MAX in release doc (Cheng Zhao) [#49268](https://github.com/nodejs/node/pull/49268)
+* \[[`ac3b88449b`](https://github.com/nodejs/node/commit/ac3b88449b)] - **doc**: fix typo in `stream.finished` documentation (Antoine du Hamel) [#49271](https://github.com/nodejs/node/pull/49271)
+* \[[`7428ebf6c3`](https://github.com/nodejs/node/commit/7428ebf6c3)] - **doc**: update description for `percent_encode` sets in `WHATWG API` (Jungku Lee) [#49258](https://github.com/nodejs/node/pull/49258)
+* \[[`bef900e56b`](https://github.com/nodejs/node/commit/bef900e56b)] - **doc**: move and rename loaders section (Geoffrey Booth) [#49261](https://github.com/nodejs/node/pull/49261)
+* \[[`a22e0d9696`](https://github.com/nodejs/node/commit/a22e0d9696)] - **doc**: clarify use of Uint8Array for n-api (Fedor Indutny) [#48742](https://github.com/nodejs/node/pull/48742)
+* \[[`1704f24cb9`](https://github.com/nodejs/node/commit/1704f24cb9)] - **doc**: add signature for `module.register` (Geoffrey Booth) [#49251](https://github.com/nodejs/node/pull/49251)
+* \[[`5a363bb01b`](https://github.com/nodejs/node/commit/5a363bb01b)] - **doc**: caveat unavailability of `import.meta.resolve` in custom loaders (Jacob Smith) [#49242](https://github.com/nodejs/node/pull/49242)
+* \[[`8101f2b259`](https://github.com/nodejs/node/commit/8101f2b259)] - **doc**: use same name in the doc as in the code (Hyunjin Kim) [#49216](https://github.com/nodejs/node/pull/49216)
+* \[[`edf278d60d`](https://github.com/nodejs/node/commit/edf278d60d)] - **doc**: add notable-change label mention to PR template (Rafael Gonzaga) [#49188](https://github.com/nodejs/node/pull/49188)
+* \[[`3df2251a6a`](https://github.com/nodejs/node/commit/3df2251a6a)] - **doc**: add h1 summary to security release process (Rafael Gonzaga) [#49112](https://github.com/nodejs/node/pull/49112)
+* \[[`9fcd99a744`](https://github.com/nodejs/node/commit/9fcd99a744)] - **doc**: update to semver-minor releases by default (Rafael Gonzaga) [#49175](https://github.com/nodejs/node/pull/49175)
+* \[[`777931f499`](https://github.com/nodejs/node/commit/777931f499)] - **doc**: fix wording in napi\_async\_init (Tobias Nießen) [#49180](https://github.com/nodejs/node/pull/49180)
+* \[[`f45c8e10c0`](https://github.com/nodejs/node/commit/f45c8e10c0)] - **doc,test**: add known path resolution issue in permission model (Tobias Nießen) [#49155](https://github.com/nodejs/node/pull/49155)
+* \[[`a6cfea3f74`](https://github.com/nodejs/node/commit/a6cfea3f74)] - **esm**: align sync and async load implementations (Antoine du Hamel) [#49152](https://github.com/nodejs/node/pull/49152)
+* \[[`9fac310b33`](https://github.com/nodejs/node/commit/9fac310b33)] - **fs**: add the options param description in openAsBlob() (Yeseul Lee) [#49308](https://github.com/nodejs/node/pull/49308)
+* \[[`92772a8175`](https://github.com/nodejs/node/commit/92772a8175)] - **fs**: remove redundant code in readableWebStream() (Deokjin Kim) [#49298](https://github.com/nodejs/node/pull/49298)
+* \[[`88ba79b083`](https://github.com/nodejs/node/commit/88ba79b083)] - **fs**: make sure to write entire buffer (Robert Nagy) [#49211](https://github.com/nodejs/node/pull/49211)
+* \[[`11c85ffa98`](https://github.com/nodejs/node/commit/11c85ffa98)] - **(SEMVER-MINOR)** **lib**: add api to detect whether source-maps are enabled (翠 / green) [#46391](https://github.com/nodejs/node/pull/46391)
+* \[[`c12711ebfe`](https://github.com/nodejs/node/commit/c12711ebfe)] - **lib**: implement WeakReference on top of JS WeakRef (Joyee Cheung) [#49053](https://github.com/nodejs/node/pull/49053)
+* \[[`9a0891f88d`](https://github.com/nodejs/node/commit/9a0891f88d)] - **meta**: bump step-security/harden-runner from 2.5.0 to 2.5.1 (dependabot\[bot]) [#49435](https://github.com/nodejs/node/pull/49435)
+* \[[`ae67f41ef1`](https://github.com/nodejs/node/commit/ae67f41ef1)] - **meta**: bump actions/checkout from 3.5.3 to 3.6.0 (dependabot\[bot]) [#49436](https://github.com/nodejs/node/pull/49436)
+* \[[`71b4411fb2`](https://github.com/nodejs/node/commit/71b4411fb2)] - **meta**: bump actions/setup-node from 3.7.0 to 3.8.1 (dependabot\[bot]) [#49434](https://github.com/nodejs/node/pull/49434)
+* \[[`83b7d3a395`](https://github.com/nodejs/node/commit/83b7d3a395)] - **meta**: remove modules team from CODEOWNERS (Benjamin Gruenbaum) [#49412](https://github.com/nodejs/node/pull/49412)
+* \[[`81ff68c45c`](https://github.com/nodejs/node/commit/81ff68c45c)] - **meta**: move one or more collaborators to emeritus (Node.js GitHub Bot) [#49264](https://github.com/nodejs/node/pull/49264)
+* \[[`ab975233cc`](https://github.com/nodejs/node/commit/ab975233cc)] - **meta**: mention nodejs/tsc when changing GH templates (Rafael Gonzaga) [#49189](https://github.com/nodejs/node/pull/49189)
+* \[[`ceaa5494de`](https://github.com/nodejs/node/commit/ceaa5494de)] - **meta**: add test/reporters to codeowners (Chemi Atlow) [#49186](https://github.com/nodejs/node/pull/49186)
+* \[[`de0a51b7cf`](https://github.com/nodejs/node/commit/de0a51b7cf)] - **net**: improve performance of isIPv4 and isIPv6 (Uzlopak) [#49568](https://github.com/nodejs/node/pull/49568)
+* \[[`8d0913bf95`](https://github.com/nodejs/node/commit/8d0913bf95)] - **net**: use asserts in JS Socket Stream to catch races in future (Tim Perry) [#49400](https://github.com/nodejs/node/pull/49400)
+* \[[`2486836a7d`](https://github.com/nodejs/node/commit/2486836a7d)] - **net**: fix crash due to simultaneous close/shutdown on JS Stream Sockets (Tim Perry) [#49400](https://github.com/nodejs/node/pull/49400)
+* \[[`7a808340cd`](https://github.com/nodejs/node/commit/7a808340cd)] - **node-api**: fix compiler warning in node\_api.h (Michael Graeb) [#49103](https://github.com/nodejs/node/pull/49103)
+* \[[`30f26a99f4`](https://github.com/nodejs/node/commit/30f26a99f4)] - **permission**: ensure to resolve path when calling mkdtemp (RafaelGSS) [nodejs-private/node-private#440](https://github.com/nodejs-private/node-private/pull/440)
+* \[[`5051c75a5b`](https://github.com/nodejs/node/commit/5051c75a5b)] - **policy**: fix path to URL conversion (Antoine du Hamel) [#49133](https://github.com/nodejs/node/pull/49133)
+* \[[`173aed4757`](https://github.com/nodejs/node/commit/173aed4757)] - **report**: fix recent coverity warning (Michael Dawson) [#48954](https://github.com/nodejs/node/pull/48954)
+* \[[`d7ff78b442`](https://github.com/nodejs/node/commit/d7ff78b442)] - **sea**: generate code cache with deserialized isolate (Joyee Cheung) [#49226](https://github.com/nodejs/node/pull/49226)
+* \[[`022f1b70c1`](https://github.com/nodejs/node/commit/022f1b70c1)] - **src**: support multiple `--env-file` declarations (Yagiz Nizipli) [#49542](https://github.com/nodejs/node/pull/49542)
+* \[[`154b1c2115`](https://github.com/nodejs/node/commit/154b1c2115)] - **src**: don't overwrite environment from .env file (Phil Nash) [#49424](https://github.com/nodejs/node/pull/49424)
+* \[[`dc4de1c69b`](https://github.com/nodejs/node/commit/dc4de1c69b)] - **src**: modify code for empty string (pluris) [#49336](https://github.com/nodejs/node/pull/49336)
+* \[[`701c46f967`](https://github.com/nodejs/node/commit/701c46f967)] - **src**: remove unused PromiseWrap-related code (Joyee Cheung) [#49335](https://github.com/nodejs/node/pull/49335)
+* \[[`4a094dc7af`](https://github.com/nodejs/node/commit/4a094dc7af)] - **src**: rename IsAnyByteSource to IsAnyBufferSource (Tobias Nießen) [#49346](https://github.com/nodejs/node/pull/49346)
+* \[[`55d6649175`](https://github.com/nodejs/node/commit/55d6649175)] - **src**: support snapshot deserialization in RAIIIsolate (Joyee Cheung) [#49226](https://github.com/nodejs/node/pull/49226)
+* \[[`dc092864ef`](https://github.com/nodejs/node/commit/dc092864ef)] - **src**: remove unused function `GetName()` in node\_perf (Jungku Lee) [#49244](https://github.com/nodejs/node/pull/49244)
+* \[[`f2552a410e`](https://github.com/nodejs/node/commit/f2552a410e)] - **src**: use ARES\_SUCCESS instead of 0 (Jungku Lee) [#49048](https://github.com/nodejs/node/pull/49048)
+* \[[`4a9ae31519`](https://github.com/nodejs/node/commit/4a9ae31519)] - **src**: add a condition if the argument of `DomainToUnicode` is empty (Jungku Lee) [#49097](https://github.com/nodejs/node/pull/49097)
+* \[[`f460362cdf`](https://github.com/nodejs/node/commit/f460362cdf)] - **src**: remove C++ WeakReference implementation (Joyee Cheung) [#49053](https://github.com/nodejs/node/pull/49053)
+* \[[`2a35383b3e`](https://github.com/nodejs/node/commit/2a35383b3e)] - **src**: use per-realm GetBindingData() wherever applicable (Joyee Cheung) [#49007](https://github.com/nodejs/node/pull/49007)
+* \[[`184bbddcf5`](https://github.com/nodejs/node/commit/184bbddcf5)] - **src**: add per-realm GetBindingData() method (Joyee Cheung) [#49007](https://github.com/nodejs/node/pull/49007)
+* \[[`e9946885f9`](https://github.com/nodejs/node/commit/e9946885f9)] - **src**: serialize both BaseObject slots (Joyee Cheung) [#48996](https://github.com/nodejs/node/pull/48996)
+* \[[`ec51e25ed7`](https://github.com/nodejs/node/commit/ec51e25ed7)] - **src,permission**: add multiple allow-fs-\* flags (Carlos Espa) [#49047](https://github.com/nodejs/node/pull/49047)
+* \[[`8aac95de4b`](https://github.com/nodejs/node/commit/8aac95de4b)] - **stream**: improve tee perf by reduce `ReflectConstruct` usages (Raz Luvaton) [#49546](https://github.com/nodejs/node/pull/49546)
+* \[[`0eea7fd8fb`](https://github.com/nodejs/node/commit/0eea7fd8fb)] - **stream**: use Buffer.from when constructor is a Buffer (Matthew Aitken) [#49250](https://github.com/nodejs/node/pull/49250)
+* \[[`b961d9bd52`](https://github.com/nodejs/node/commit/b961d9bd52)] - **stream**: add `highWaterMark` for the map operator (Raz Luvaton) [#49249](https://github.com/nodejs/node/pull/49249)
+* \[[`ca1384166d`](https://github.com/nodejs/node/commit/ca1384166d)] - **test**: fix warning for comment in embedtest (Jungku Lee) [#49416](https://github.com/nodejs/node/pull/49416)
+* \[[`2a35782809`](https://github.com/nodejs/node/commit/2a35782809)] - **test**: simplify test-crypto-dh-group-setters (Tobias Nießen) [#49404](https://github.com/nodejs/node/pull/49404)
+* \[[`6740f3c209`](https://github.com/nodejs/node/commit/6740f3c209)] - **test**: verify dynamic import call with absolute path strings (Chengzhong Wu) [#49275](https://github.com/nodejs/node/pull/49275)
+* \[[`6ed47bd8fb`](https://github.com/nodejs/node/commit/6ed47bd8fb)] - **test**: reduce length in crypto keygen tests (Joyee Cheung) [#49221](https://github.com/nodejs/node/pull/49221)
+* \[[`4faa30c553`](https://github.com/nodejs/node/commit/4faa30c553)] - **test**: split JWK async elliptic curve keygen tests (Joyee Cheung) [#49221](https://github.com/nodejs/node/pull/49221)
+* \[[`e04a2603d8`](https://github.com/nodejs/node/commit/e04a2603d8)] - **test**: split test-crypto-keygen.js (Joyee Cheung) [#49221](https://github.com/nodejs/node/pull/49221)
+* \[[`0d23c1d4ce`](https://github.com/nodejs/node/commit/0d23c1d4ce)] - **test**: rename test-crypto-modp1-error (Tobias Nießen) [#49348](https://github.com/nodejs/node/pull/49348)
+* \[[`48e41569e2`](https://github.com/nodejs/node/commit/48e41569e2)] - **test**: migrate message source map tests from Python to JS (Yiyun Lei) [#49238](https://github.com/nodejs/node/pull/49238)
+* \[[`a11e64e09c`](https://github.com/nodejs/node/commit/a11e64e09c)] - **test**: fix compiler warning in NodeCryptoEnv (Tobias Nießen) [#49206](https://github.com/nodejs/node/pull/49206)
+* \[[`345543938f`](https://github.com/nodejs/node/commit/345543938f)] - **test**: handle EUNATCH (Abdirahim Musse) [#48050](https://github.com/nodejs/node/pull/48050)
+* \[[`e391f4b197`](https://github.com/nodejs/node/commit/e391f4b197)] - **test**: use `tmpdir.resolve()` (Livia Medeiros) [#49136](https://github.com/nodejs/node/pull/49136)
+* \[[`910378f93f`](https://github.com/nodejs/node/commit/910378f93f)] - **test**: reduce flakiness of `test-esm-loader-hooks` (Antoine du Hamel) [#49248](https://github.com/nodejs/node/pull/49248)
+* \[[`4a85f70462`](https://github.com/nodejs/node/commit/4a85f70462)] - **test**: add spawnSyncAndExit() and spawnSyncAndExitWithoutError() (Joyee Cheung) [#49200](https://github.com/nodejs/node/pull/49200)
+* \[[`9610008b79`](https://github.com/nodejs/node/commit/9610008b79)] - **test**: make test-perf-hooks more robust and work with workers (Joyee Cheung) [#49197](https://github.com/nodejs/node/pull/49197)
+* \[[`dc8fff9a75`](https://github.com/nodejs/node/commit/dc8fff9a75)] - **test**: use gcUntil() in test-v8-serialize-leak (Joyee Cheung) [#49168](https://github.com/nodejs/node/pull/49168)
+* \[[`ca9f801332`](https://github.com/nodejs/node/commit/ca9f801332)] - **test**: make WeakReference tests robust (Joyee Cheung) [#49053](https://github.com/nodejs/node/pull/49053)
+* \[[`de103a4686`](https://github.com/nodejs/node/commit/de103a4686)] - **test**: add test for effect of UV\_THREADPOOL\_SIZE (Tobias Nießen) [#49165](https://github.com/nodejs/node/pull/49165)
+* \[[`47d24f144b`](https://github.com/nodejs/node/commit/47d24f144b)] - **test**: use expectSyncExit{WithErrors} in snapshot tests (Joyee Cheung) [#49020](https://github.com/nodejs/node/pull/49020)
+* \[[`c441f5a097`](https://github.com/nodejs/node/commit/c441f5a097)] - **test**: add expectSyncExitWithoutError() and expectSyncExit() utils (Joyee Cheung) [#49020](https://github.com/nodejs/node/pull/49020)
+* \[[`4d184b5251`](https://github.com/nodejs/node/commit/4d184b5251)] - **test**: remove --no-warnings flag in test\_runner fixtures (Raz Luvaton) [#48989](https://github.com/nodejs/node/pull/48989)
+* \[[`25e967a90b`](https://github.com/nodejs/node/commit/25e967a90b)] - **test**: reorder test files fixtures for better understanding (Raz Luvaton) [#48787](https://github.com/nodejs/node/pull/48787)
+* \[[`fac56dbcc0`](https://github.com/nodejs/node/commit/fac56dbcc0)] - **test,benchmark**: use `tmpdir.fileURL()` (Livia Medeiros) [#49138](https://github.com/nodejs/node/pull/49138)
+* \[[`36763fa532`](https://github.com/nodejs/node/commit/36763fa532)] - **test\_runner**: preserve original property descriptor (Erick Wendel) [#49433](https://github.com/nodejs/node/pull/49433)
+* \[[`40e9fcdbea`](https://github.com/nodejs/node/commit/40e9fcdbea)] - **test\_runner**: add support for setImmediate (Erick Wendel) [#49397](https://github.com/nodejs/node/pull/49397)
+* \[[`23216f1935`](https://github.com/nodejs/node/commit/23216f1935)] - **test\_runner**: report covered lines, functions and branches to reporters (Phil Nash) [#49320](https://github.com/nodejs/node/pull/49320)
+* \[[`283f2806b1`](https://github.com/nodejs/node/commit/283f2806b1)] - **test\_runner**: expose spec reporter as newable function (Chemi Atlow) [#49184](https://github.com/nodejs/node/pull/49184)
+* \[[`546ad5f770`](https://github.com/nodejs/node/commit/546ad5f770)] - **test\_runner**: reland run global after() hook earlier (Colin Ihrig) [#49116](https://github.com/nodejs/node/pull/49116)
+* \[[`efdc95fbc0`](https://github.com/nodejs/node/commit/efdc95fbc0)] - **(SEMVER-MINOR)** **test\_runner**: expose location of tests (Colin Ihrig) [#48975](https://github.com/nodejs/node/pull/48975)
+* \[[`4bc0a8fe99`](https://github.com/nodejs/node/commit/4bc0a8fe99)] - **test\_runner**: fix global after not failing the tests (Raz Luvaton) [#48913](https://github.com/nodejs/node/pull/48913)
+* \[[`08738b2664`](https://github.com/nodejs/node/commit/08738b2664)] - **test\_runner**: fix timeout in \*Each hook failing further tests (Raz Luvaton) [#48925](https://github.com/nodejs/node/pull/48925)
+* \[[`c2f1830f66`](https://github.com/nodejs/node/commit/c2f1830f66)] - **test\_runner**: cleanup test timeout abort listener (Raz Luvaton) [#48915](https://github.com/nodejs/node/pull/48915)
+* \[[`75333f38b2`](https://github.com/nodejs/node/commit/75333f38b2)] - **test\_runner**: fix global before not called when no global test exists (Raz Luvaton) [#48877](https://github.com/nodejs/node/pull/48877)
+* \[[`b28b85adf8`](https://github.com/nodejs/node/commit/b28b85adf8)] - **tls**: remove redundant code in onConnectSecure() (Deokjin Kim) [#49457](https://github.com/nodejs/node/pull/49457)
+* \[[`83fc4dccbc`](https://github.com/nodejs/node/commit/83fc4dccbc)] - **tls**: refactor to use validateFunction (Deokjin Kim) [#49422](https://github.com/nodejs/node/pull/49422)
+* \[[`8949cc79dd`](https://github.com/nodejs/node/commit/8949cc79dd)] - **tls**: ensure TLS Sockets are closed if the underlying wrap closes (Tim Perry) [#49327](https://github.com/nodejs/node/pull/49327)
+* \[[`1df56e6f01`](https://github.com/nodejs/node/commit/1df56e6f01)] - **tools**: update eslint to 8.48.0 (Node.js GitHub Bot) [#49343](https://github.com/nodejs/node/pull/49343)
+* \[[`ef50ec5b57`](https://github.com/nodejs/node/commit/ef50ec5b57)] - **tools**: update lint-md-dependencies (Node.js GitHub Bot) [#49342](https://github.com/nodejs/node/pull/49342)
+* \[[`9a8fb4fc34`](https://github.com/nodejs/node/commit/9a8fb4fc34)] - **tools**: remove v8\_dump\_build\_config action (Cheng Zhao) [#49301](https://github.com/nodejs/node/pull/49301)
+* \[[`91b2d4314b`](https://github.com/nodejs/node/commit/91b2d4314b)] - **tools**: update lint-md-dependencies (Node.js GitHub Bot) [#49253](https://github.com/nodejs/node/pull/49253)
+* \[[`b51946ebdd`](https://github.com/nodejs/node/commit/b51946ebdd)] - **tools**: fix github reporter appended multiple times (Moshe Atlow) [#49199](https://github.com/nodejs/node/pull/49199)
+* \[[`ae40cb1612`](https://github.com/nodejs/node/commit/ae40cb1612)] - **url**: validate `pathToFileURL(path)` argument as string (LiviaMedeiros) [#49161](https://github.com/nodejs/node/pull/49161)
+* \[[`e787673dcf`](https://github.com/nodejs/node/commit/e787673dcf)] - **url**: handle unicode hostname if empty (Yagiz Nizipli) [#49396](https://github.com/nodejs/node/pull/49396)
+* \[[`6ee74be87f`](https://github.com/nodejs/node/commit/6ee74be87f)] - **vm**: store MicrotaskQueue in ContextifyContext directly (Joyee Cheung) [#48982](https://github.com/nodejs/node/pull/48982)
+* \[[`0179c6dc8f`](https://github.com/nodejs/node/commit/0179c6dc8f)] - **worker**: protect against user mutating well-known prototypes (Antoine du Hamel) [#49270](https://github.com/nodejs/node/pull/49270)
+
 <a id="20.6.1"></a>
 
 ## 2023-09-08, Version 20.6.1 (Current), @RafaelGSS
diff --git a/doc/changelogs/CHANGELOG_V21.md b/doc/changelogs/CHANGELOG_V21.md
new file mode 100644
index 00000000000000..b6cd40a76f4c10
--- /dev/null
+++ b/doc/changelogs/CHANGELOG_V21.md
@@ -0,0 +1,286 @@
+# Node.js 21 ChangeLog
+
+<!--lint disable maximum-line-length no-literal-urls prohibited-strings-->
+
+<table>
+<tr>
+<th>Current</th>
+</tr>
+<tr>
+<td>
+<a href="#21.0.0">21.0.0</a><br/>
+</td>
+</tr>
+</table>
+
+* Other Versions
+  * [20.x](CHANGELOG_V20.md)
+  * [19.x](CHANGELOG_V19.md)
+  * [18.x](CHANGELOG_V18.md)
+  * [17.x](CHANGELOG_V17.md)
+  * [16.x](CHANGELOG_V16.md)
+  * [15.x](CHANGELOG_V15.md)
+  * [14.x](CHANGELOG_V14.md)
+  * [13.x](CHANGELOG_V13.md)
+  * [12.x](CHANGELOG_V12.md)
+  * [11.x](CHANGELOG_V11.md)
+  * [10.x](CHANGELOG_V10.md)
+  * [9.x](CHANGELOG_V9.md)
+  * [8.x](CHANGELOG_V8.md)
+  * [7.x](CHANGELOG_V7.md)
+  * [6.x](CHANGELOG_V6.md)
+  * [5.x](CHANGELOG_V5.md)
+  * [4.x](CHANGELOG_V4.md)
+  * [0.12.x](CHANGELOG_V012.md)
+  * [0.10.x](CHANGELOG_V010.md)
+  * [io.js](CHANGELOG_IOJS.md)
+  * [Archive](CHANGELOG_ARCHIVE.md)
+
+<a id="21.0.0"></a>
+
+## 2023-10-17, Version 21.0.0 (Current), @RafaelGSS and @targos
+
+We're excited to announce the release of Node.js 21! Highlights include updates of the V8 JavaScript engine to 11.8,
+stable `fetch` and `WebStreams`, a new experimental flag to change the interpretation of ambiguous code
+from CommonJS to ES modules (`--experimental-default-type`), many updates to our test runner, and more!
+
+Node.js 21 will replace Node.js 20 as our ‘Current’ release line when Node.js 20 enters long-term support (LTS) later this month.
+As per the release schedule, Node.js 21 will be ‘Current' release for the next 6 months, until April 2024.
+
+### Other Notable Changes
+
+* \[[`740ca5423a`](https://github.com/nodejs/node/commit/740ca5423a)] - **doc**: promote fetch/webstreams from experimental to stable (Steven) [#45684](https://github.com/nodejs/node/pull/45684)
+* \[[`85301803e1`](https://github.com/nodejs/node/commit/85301803e1)] - **esm**: --experimental-default-type flag to flip module defaults (Geoffrey Booth) [#49869](https://github.com/nodejs/node/pull/49869)
+* \[[`705e623ac4`](https://github.com/nodejs/node/commit/705e623ac4)] - **esm**: remove `globalPreload` hook (superseded by `initialize`) (Jacob Smith) [#49144](https://github.com/nodejs/node/pull/49144)
+* \[[`e01c1d700d`](https://github.com/nodejs/node/commit/e01c1d700d)] - **fs**: add flush option to writeFile() functions (Colin Ihrig) [#50009](https://github.com/nodejs/node/pull/50009)
+* \[[`1948dce707`](https://github.com/nodejs/node/commit/1948dce707)] - **(SEMVER-MAJOR)** **fs**: add globSync implementation (Moshe Atlow) [#47653](https://github.com/nodejs/node/pull/47653)
+* \[[`e28dbe1c2b`](https://github.com/nodejs/node/commit/e28dbe1c2b)] - **(SEMVER-MINOR)** **lib**: add WebSocket client (Matthew Aitken) [#49830](https://github.com/nodejs/node/pull/49830)
+* \[[`95b8f5dcab`](https://github.com/nodejs/node/commit/95b8f5dcab)] - **stream**: optimize Writable (Robert Nagy) [#50012](https://github.com/nodejs/node/pull/50012)
+* \[[`7cd4e70948`](https://github.com/nodejs/node/commit/7cd4e70948)] - **(SEMVER-MAJOR)** **test\_runner**: support passing globs (Moshe Atlow) [#47653](https://github.com/nodejs/node/pull/47653)
+* \[[`1d220b55ac`](https://github.com/nodejs/node/commit/1d220b55ac)] - **vm**: use default HDO when importModuleDynamically is not set (Joyee Cheung) [#49950](https://github.com/nodejs/node/pull/49950)
+
+### Semver-Major Commits
+
+* \[[`ac2a68c76b`](https://github.com/nodejs/node/commit/ac2a68c76b)] - **(SEMVER-MAJOR)** **build**: drop support for Visual Studio 2019 (Michaël Zasso) [#49051](https://github.com/nodejs/node/pull/49051)
+* \[[`4e3983031a`](https://github.com/nodejs/node/commit/4e3983031a)] - **(SEMVER-MAJOR)** **build**: bump supported macOS and Xcode versions (Michaël Zasso) [#49164](https://github.com/nodejs/node/pull/49164)
+* \[[`5a0777776d`](https://github.com/nodejs/node/commit/5a0777776d)] - **(SEMVER-MAJOR)** **crypto**: do not overwrite \_writableState.defaultEncoding (Tobias Nießen) [#49140](https://github.com/nodejs/node/pull/49140)
+* \[[`162a0652ab`](https://github.com/nodejs/node/commit/162a0652ab)] - **(SEMVER-MAJOR)** **deps**: bump minimum ICU version to 73 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`17a74ddd3d`](https://github.com/nodejs/node/commit/17a74ddd3d)] - **(SEMVER-MAJOR)** **deps**: update V8 to 11.8.172.13 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`e9ff81016d`](https://github.com/nodejs/node/commit/e9ff81016d)] - **(SEMVER-MAJOR)** **deps**: update llhttp to 9.1.2 (Paolo Insogna) [#48981](https://github.com/nodejs/node/pull/48981)
+* \[[`7ace5aba75`](https://github.com/nodejs/node/commit/7ace5aba75)] - **(SEMVER-MAJOR)** **events**: validate options of `on` and `once` (Deokjin Kim) [#46018](https://github.com/nodejs/node/pull/46018)
+* \[[`b3ec13d449`](https://github.com/nodejs/node/commit/b3ec13d449)] - **(SEMVER-MAJOR)** **fs**: adjust `position` validation in reading methods (Livia Medeiros) [#42835](https://github.com/nodejs/node/pull/42835)
+* \[[`1948dce707`](https://github.com/nodejs/node/commit/1948dce707)] - **(SEMVER-MAJOR)** **fs**: add globSync implementation (Moshe Atlow) [#47653](https://github.com/nodejs/node/pull/47653)
+* \[[`d68d0eacaa`](https://github.com/nodejs/node/commit/d68d0eacaa)] - **(SEMVER-MAJOR)** **http**: reduce parts in chunked response when corking (Robert Nagy) [#50167](https://github.com/nodejs/node/pull/50167)
+* \[[`c5b0b894ed`](https://github.com/nodejs/node/commit/c5b0b894ed)] - **(SEMVER-MAJOR)** **lib**: mark URL/URLSearchParams as uncloneable and untransferable (Chengzhong Wu) [#47497](https://github.com/nodejs/node/pull/47497)
+* \[[`3205b1936a`](https://github.com/nodejs/node/commit/3205b1936a)] - **(SEMVER-MAJOR)** **lib**: remove aix directory case for package reader (Yagiz Nizipli) [#48605](https://github.com/nodejs/node/pull/48605)
+* \[[`b40f0c3074`](https://github.com/nodejs/node/commit/b40f0c3074)] - **(SEMVER-MAJOR)** **lib**: add `navigator.hardwareConcurrency` (Yagiz Nizipli) [#47769](https://github.com/nodejs/node/pull/47769)
+* \[[`4b08c4c047`](https://github.com/nodejs/node/commit/4b08c4c047)] - **(SEMVER-MAJOR)** **lib**: runtime deprecate punycode (Yagiz Nizipli) [#47202](https://github.com/nodejs/node/pull/47202)
+* \[[`3ce51ae9c0`](https://github.com/nodejs/node/commit/3ce51ae9c0)] - **(SEMVER-MAJOR)** **module**: harmonize error code between ESM and CJS (Antoine du Hamel) [#48606](https://github.com/nodejs/node/pull/48606)
+* \[[`7202859402`](https://github.com/nodejs/node/commit/7202859402)] - **(SEMVER-MAJOR)** **net**: do not treat `server.maxConnections=0` as `Infinity` (ignoramous) [#48276](https://github.com/nodejs/node/pull/48276)
+* \[[`c15bafdaf4`](https://github.com/nodejs/node/commit/c15bafdaf4)] - **(SEMVER-MAJOR)** **net**: only defer \_final call when connecting (Jason Zhang) [#47385](https://github.com/nodejs/node/pull/47385)
+* \[[`6ffacbf0f9`](https://github.com/nodejs/node/commit/6ffacbf0f9)] - **(SEMVER-MAJOR)** **node-api**: rename internal NAPI\_VERSION definition (Chengzhong Wu) [#48501](https://github.com/nodejs/node/pull/48501)
+* \[[`11af089b14`](https://github.com/nodejs/node/commit/11af089b14)] - **(SEMVER-MAJOR)** **src**: update NODE\_MODULE\_VERSION to 120 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`d920b7c94b`](https://github.com/nodejs/node/commit/d920b7c94b)] - **(SEMVER-MAJOR)** **src**: throw DOMException on cloning non-serializable objects (Chengzhong Wu) [#47839](https://github.com/nodejs/node/pull/47839)
+* \[[`64549731b6`](https://github.com/nodejs/node/commit/64549731b6)] - **(SEMVER-MAJOR)** **src**: throw DataCloneError on transfering untransferable objects (Chengzhong Wu) [#47604](https://github.com/nodejs/node/pull/47604)
+* \[[`dac8de689b`](https://github.com/nodejs/node/commit/dac8de689b)] - **(SEMVER-MAJOR)** **stream**: use private properties for strategies (Yagiz Nizipli) [#47218](https://github.com/nodejs/node/pull/47218)
+* \[[`1fa084ecdf`](https://github.com/nodejs/node/commit/1fa084ecdf)] - **(SEMVER-MAJOR)** **stream**: use private properties for encoding (Yagiz Nizipli) [#47218](https://github.com/nodejs/node/pull/47218)
+* \[[`4e93247079`](https://github.com/nodejs/node/commit/4e93247079)] - **(SEMVER-MAJOR)** **stream**: use private properties for compression (Yagiz Nizipli) [#47218](https://github.com/nodejs/node/pull/47218)
+* \[[`527589b755`](https://github.com/nodejs/node/commit/527589b755)] - **(SEMVER-MAJOR)** **test\_runner**: disallow array in `run` options (Raz Luvaton) [#49935](https://github.com/nodejs/node/pull/49935)
+* \[[`7cd4e70948`](https://github.com/nodejs/node/commit/7cd4e70948)] - **(SEMVER-MAJOR)** **test\_runner**: support passing globs (Moshe Atlow) [#47653](https://github.com/nodejs/node/pull/47653)
+* \[[`2ef170254b`](https://github.com/nodejs/node/commit/2ef170254b)] - **(SEMVER-MAJOR)** **tls**: use `validateNumber` for `options.minDHSize` (Deokjin Kim) [#49973](https://github.com/nodejs/node/pull/49973)
+* \[[`092fb9f541`](https://github.com/nodejs/node/commit/092fb9f541)] - **(SEMVER-MAJOR)** **tls**: use validateFunction for `options.checkServerIdentity` (Deokjin Kim) [#49896](https://github.com/nodejs/node/pull/49896)
+* \[[`ccca547e28`](https://github.com/nodejs/node/commit/ccca547e28)] - **(SEMVER-MAJOR)** **util**: runtime deprecate `promisify`-ing a function returning a `Promise` (Antoine du Hamel) [#49609](https://github.com/nodejs/node/pull/49609)
+* \[[`4038cf0513`](https://github.com/nodejs/node/commit/4038cf0513)] - **(SEMVER-MAJOR)** **vm**: freeze `dependencySpecifiers` array (Antoine du Hamel) [#49720](https://github.com/nodejs/node/pull/49720)
+
+### Semver-Minor Commits
+
+* \[[`3227d7327c`](https://github.com/nodejs/node/commit/3227d7327c)] - **(SEMVER-MINOR)** **deps**: update uvwasi to 0.0.19 (Node.js GitHub Bot) [#49908](https://github.com/nodejs/node/pull/49908)
+* \[[`e28dbe1c2b`](https://github.com/nodejs/node/commit/e28dbe1c2b)] - **(SEMVER-MINOR)** **lib**: add WebSocket client (Matthew Aitken) [#49830](https://github.com/nodejs/node/pull/49830)
+* \[[`9f9c58212e`](https://github.com/nodejs/node/commit/9f9c58212e)] - **(SEMVER-MINOR)** **test\_runner, cli**: add --test-concurrency flag (Colin Ihrig) [#49996](https://github.com/nodejs/node/pull/49996)
+* \[[`d37b0d267f`](https://github.com/nodejs/node/commit/d37b0d267f)] - **(SEMVER-MINOR)** **wasi**: updates required for latest uvwasi version (Michael Dawson) [#49908](https://github.com/nodejs/node/pull/49908)
+
+### Semver-Patch Commits
+
+* \[[`33c87ec096`](https://github.com/nodejs/node/commit/33c87ec096)] - **benchmark**: fix race condition on fs benchs (Vinicius Lourenço) [#50035](https://github.com/nodejs/node/pull/50035)
+* \[[`3c0ec61c4b`](https://github.com/nodejs/node/commit/3c0ec61c4b)] - **benchmark**: add warmup to accessSync bench (Rafael Gonzaga) [#50073](https://github.com/nodejs/node/pull/50073)
+* \[[`1a839f388e`](https://github.com/nodejs/node/commit/1a839f388e)] - **benchmark**: improved config for blob,file benchmark (Vinícius Lourenço) [#49730](https://github.com/nodejs/node/pull/49730)
+* \[[`86fe5a80f3`](https://github.com/nodejs/node/commit/86fe5a80f3)] - **benchmark**: added new benchmarks for blob (Vinícius Lourenço) [#49730](https://github.com/nodejs/node/pull/49730)
+* \[[`6322d4f587`](https://github.com/nodejs/node/commit/6322d4f587)] - **build**: fix IBM i build with Python 3.9 (Richard Lau) [#48056](https://github.com/nodejs/node/pull/48056)
+* \[[`17c55d176b`](https://github.com/nodejs/node/commit/17c55d176b)] - **build**: reset embedder string to "-node.0" (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`f10928f926`](https://github.com/nodejs/node/commit/f10928f926)] - **crypto**: use X509\_ALGOR accessors instead of reaching into X509\_ALGOR (David Benjamin) [#50057](https://github.com/nodejs/node/pull/50057)
+* \[[`136a96722a`](https://github.com/nodejs/node/commit/136a96722a)] - **crypto**: account for disabled SharedArrayBuffer (Shelley Vohr) [#50034](https://github.com/nodejs/node/pull/50034)
+* \[[`17b9925393`](https://github.com/nodejs/node/commit/17b9925393)] - **crypto**: return clear errors when loading invalid PFX data (Tim Perry) [#49566](https://github.com/nodejs/node/pull/49566)
+* \[[`ca25d564c6`](https://github.com/nodejs/node/commit/ca25d564c6)] - **deps**: upgrade npm to 10.2.0 (npm team) [#50027](https://github.com/nodejs/node/pull/50027)
+* \[[`f23a9353ae`](https://github.com/nodejs/node/commit/f23a9353ae)] - **deps**: update corepack to 0.21.0 (Node.js GitHub Bot) [#50088](https://github.com/nodejs/node/pull/50088)
+* \[[`ceedb3a509`](https://github.com/nodejs/node/commit/ceedb3a509)] - **deps**: update simdutf to 3.2.18 (Node.js GitHub Bot) [#50091](https://github.com/nodejs/node/pull/50091)
+* \[[`0522ac086c`](https://github.com/nodejs/node/commit/0522ac086c)] - **deps**: update zlib to 1.2.13.1-motley-fef5869 (Node.js GitHub Bot) [#50085](https://github.com/nodejs/node/pull/50085)
+* \[[`4f8c5829da`](https://github.com/nodejs/node/commit/4f8c5829da)] - **deps**: update googletest to 2dd1c13 (Node.js GitHub Bot) [#50081](https://github.com/nodejs/node/pull/50081)
+* \[[`588784ea30`](https://github.com/nodejs/node/commit/588784ea30)] - **deps**: update undici to 5.25.4 (Node.js GitHub Bot) [#50025](https://github.com/nodejs/node/pull/50025)
+* \[[`c9eef0c3c4`](https://github.com/nodejs/node/commit/c9eef0c3c4)] - **deps**: update googletest to e47544a (Node.js GitHub Bot) [#49982](https://github.com/nodejs/node/pull/49982)
+* \[[`23cb478398`](https://github.com/nodejs/node/commit/23cb478398)] - **deps**: update ada to 2.6.10 (Node.js GitHub Bot) [#49984](https://github.com/nodejs/node/pull/49984)
+* \[[`61411bb323`](https://github.com/nodejs/node/commit/61411bb323)] - **deps**: fix call to undeclared functions 'ntohl' and 'htons' (MatteoBax) [#49979](https://github.com/nodejs/node/pull/49979)
+* \[[`49cf182e30`](https://github.com/nodejs/node/commit/49cf182e30)] - **deps**: update ada to 2.6.9 (Node.js GitHub Bot) [#49340](https://github.com/nodejs/node/pull/49340)
+* \[[`ceb6df0f22`](https://github.com/nodejs/node/commit/ceb6df0f22)] - **deps**: update ada to 2.6.8 (Node.js GitHub Bot) [#49340](https://github.com/nodejs/node/pull/49340)
+* \[[`b73e18b5dc`](https://github.com/nodejs/node/commit/b73e18b5dc)] - **deps**: update ada to 2.6.7 (Node.js GitHub Bot) [#49340](https://github.com/nodejs/node/pull/49340)
+* \[[`baf2256617`](https://github.com/nodejs/node/commit/baf2256617)] - **deps**: update ada to 2.6.5 (Node.js GitHub Bot) [#49340](https://github.com/nodejs/node/pull/49340)
+* \[[`a20a328a9b`](https://github.com/nodejs/node/commit/a20a328a9b)] - **deps**: update ada to 2.6.3 (Node.js GitHub Bot) [#49340](https://github.com/nodejs/node/pull/49340)
+* \[[`3838b579e4`](https://github.com/nodejs/node/commit/3838b579e4)] - **deps**: V8: cherry-pick 8ec2651fbdd8 (Abdirahim Musse) [#49862](https://github.com/nodejs/node/pull/49862)
+* \[[`668437ccad`](https://github.com/nodejs/node/commit/668437ccad)] - **deps**: V8: cherry-pick b60a03df4ceb (Joyee Cheung) [#49491](https://github.com/nodejs/node/pull/49491)
+* \[[`f970087147`](https://github.com/nodejs/node/commit/f970087147)] - **deps**: V8: backport 93b1a74cbc9b (Joyee Cheung) [#49419](https://github.com/nodejs/node/pull/49419)
+* \[[`4531c154e5`](https://github.com/nodejs/node/commit/4531c154e5)] - **deps**: V8: cherry-pick 8ec2651fbdd8 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`9ad0e2cacc`](https://github.com/nodejs/node/commit/9ad0e2cacc)] - **deps**: V8: cherry-pick 89b3702c92b0 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`dfc9c86868`](https://github.com/nodejs/node/commit/dfc9c86868)] - **deps**: V8: cherry-pick de9a5de2274f (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`186b36efba`](https://github.com/nodejs/node/commit/186b36efba)] - **deps**: V8: cherry-pick b5b5d6c31bb0 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`867586ce95`](https://github.com/nodejs/node/commit/867586ce95)] - **deps**: V8: cherry-pick 93b1a74cbc9b (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`4ad3479ba7`](https://github.com/nodejs/node/commit/4ad3479ba7)] - **deps**: V8: cherry-pick 1a3ecc2483b2 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`660f902f16`](https://github.com/nodejs/node/commit/660f902f16)] - **deps**: patch V8 to avoid duplicated zlib symbol (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`f7c1d410ad`](https://github.com/nodejs/node/commit/f7c1d410ad)] - **deps**: remove usage of a C++20 feature from V8 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`9c4030bfb9`](https://github.com/nodejs/node/commit/9c4030bfb9)] - **deps**: avoid compilation error with ASan (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`5f05cc15e6`](https://github.com/nodejs/node/commit/5f05cc15e6)] - **deps**: disable V8 concurrent sparkplug compilation (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`42cd952dbd`](https://github.com/nodejs/node/commit/42cd952dbd)] - **deps**: silence irrelevant V8 warning (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`88cf90f9c4`](https://github.com/nodejs/node/commit/88cf90f9c4)] - **deps**: always define V8\_EXPORT\_PRIVATE as no-op (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`8609915951`](https://github.com/nodejs/node/commit/8609915951)] - **doc**: improve ccache explanation (Chengzhong Wu) [#50133](https://github.com/nodejs/node/pull/50133)
+* \[[`91d21324a9`](https://github.com/nodejs/node/commit/91d21324a9)] - **doc**: move danielleadams to TSC non-voting member (Danielle Adams) [#50142](https://github.com/nodejs/node/pull/50142)
+* \[[`34fa7043a2`](https://github.com/nodejs/node/commit/34fa7043a2)] - **doc**: fix description of `fs.readdir` `recursive` option (RamdohokarAngha) [#48902](https://github.com/nodejs/node/pull/48902)
+* \[[`81e4d2ec2f`](https://github.com/nodejs/node/commit/81e4d2ec2f)] - **doc**: mention files read before env setup (Rafael Gonzaga) [#50072](https://github.com/nodejs/node/pull/50072)
+* \[[`0ce37ed8e9`](https://github.com/nodejs/node/commit/0ce37ed8e9)] - **doc**: move permission model to Active Development (Rafael Gonzaga) [#50068](https://github.com/nodejs/node/pull/50068)
+* \[[`3c430212c3`](https://github.com/nodejs/node/commit/3c430212c3)] - **doc**: add command to get patch minors and majors (Rafael Gonzaga) [#50067](https://github.com/nodejs/node/pull/50067)
+* \[[`e43bf4c31d`](https://github.com/nodejs/node/commit/e43bf4c31d)] - **doc**: use precise promise terminology in fs (Benjamin Gruenbaum) [#50029](https://github.com/nodejs/node/pull/50029)
+* \[[`d3a5f1fb5f`](https://github.com/nodejs/node/commit/d3a5f1fb5f)] - **doc**: use precise terminology in test runner (Benjamin Gruenbaum) [#50028](https://github.com/nodejs/node/pull/50028)
+* \[[`24dea2348d`](https://github.com/nodejs/node/commit/24dea2348d)] - **doc**: clarify explaination text on how to run the example (Anshul Sinha) [#39020](https://github.com/nodejs/node/pull/39020)
+* \[[`f3ed57bd8b`](https://github.com/nodejs/node/commit/f3ed57bd8b)] - **doc**: reserve 119 for Electron 28 (David Sanders) [#50020](https://github.com/nodejs/node/pull/50020)
+* \[[`85c09f178c`](https://github.com/nodejs/node/commit/85c09f178c)] - **doc**: update Collaborator pronouns (Tierney Cyren) [#50005](https://github.com/nodejs/node/pull/50005)
+* \[[`099e2f7bce`](https://github.com/nodejs/node/commit/099e2f7bce)] - **doc**: update link to Abstract Modules Records spec (Rich Trott) [#49961](https://github.com/nodejs/node/pull/49961)
+* \[[`47b2883673`](https://github.com/nodejs/node/commit/47b2883673)] - **doc**: updated building docs for windows (Claudio W) [#49767](https://github.com/nodejs/node/pull/49767)
+* \[[`7b624c30b2`](https://github.com/nodejs/node/commit/7b624c30b2)] - **doc**: update CHANGELOG\_V20 about vm fixes (Joyee Cheung) [#49951](https://github.com/nodejs/node/pull/49951)
+* \[[`1dc0667aa6`](https://github.com/nodejs/node/commit/1dc0667aa6)] - **doc**: document dangerous symlink behavior (Tobias Nießen) [#49154](https://github.com/nodejs/node/pull/49154)
+* \[[`bc056c2426`](https://github.com/nodejs/node/commit/bc056c2426)] - **doc**: add main ARIA landmark to API docs (Rich Trott) [#49882](https://github.com/nodejs/node/pull/49882)
+* \[[`f416a0f555`](https://github.com/nodejs/node/commit/f416a0f555)] - **doc**: add navigation ARIA landmark to doc ToC (Rich Trott) [#49882](https://github.com/nodejs/node/pull/49882)
+* \[[`740ca5423a`](https://github.com/nodejs/node/commit/740ca5423a)] - **doc**: promote fetch/webstreams from experimental to stable (Steven) [#45684](https://github.com/nodejs/node/pull/45684)
+* \[[`f802aa0645`](https://github.com/nodejs/node/commit/f802aa0645)] - **doc**: fix 'partial' typo (Colin Ihrig) [#48657](https://github.com/nodejs/node/pull/48657)
+* \[[`6fda81d4f5`](https://github.com/nodejs/node/commit/6fda81d4f5)] - **doc**: mention `Navigator` is a partial implementation (Moshe Atlow) [#48656](https://github.com/nodejs/node/pull/48656)
+* \[[`6aa2aeedcb`](https://github.com/nodejs/node/commit/6aa2aeedcb)] - **doc**: mark Node.js 19 as End-of-Life (Richard Lau) [#48283](https://github.com/nodejs/node/pull/48283)
+* \[[`0ee9c83ffc`](https://github.com/nodejs/node/commit/0ee9c83ffc)] - **errors**: improve performance of determine-specific-type (Aras Abbasi) [#49696](https://github.com/nodejs/node/pull/49696)
+* \[[`4f84a3d200`](https://github.com/nodejs/node/commit/4f84a3d200)] - **errors**: improve formatList in errors.js (Aras Abbasi) [#49642](https://github.com/nodejs/node/pull/49642)
+* \[[`cc725a653a`](https://github.com/nodejs/node/commit/cc725a653a)] - **errors**: improve performance of instantiation (Aras Abbasi) [#49654](https://github.com/nodejs/node/pull/49654)
+* \[[`d1ef6aa2db`](https://github.com/nodejs/node/commit/d1ef6aa2db)] - **esm**: use import attributes instead of import assertions (Antoine du Hamel) [#50140](https://github.com/nodejs/node/pull/50140)
+* \[[`19b470f866`](https://github.com/nodejs/node/commit/19b470f866)] - **esm**: bypass CommonJS loader under --default-type (Geoffrey Booth) [#49986](https://github.com/nodejs/node/pull/49986)
+* \[[`9c683204db`](https://github.com/nodejs/node/commit/9c683204db)] - **esm**: unflag extensionless javascript and wasm in module scope (Geoffrey Booth) [#49974](https://github.com/nodejs/node/pull/49974)
+* \[[`05be31d5de`](https://github.com/nodejs/node/commit/05be31d5de)] - **esm**: improve `getFormatOfExtensionlessFile` speed (Yagiz Nizipli) [#49965](https://github.com/nodejs/node/pull/49965)
+* \[[`aadfea4979`](https://github.com/nodejs/node/commit/aadfea4979)] - **esm**: improve JSDoc annotation of internal functions (Antoine du Hamel) [#49959](https://github.com/nodejs/node/pull/49959)
+* \[[`7f0e36af52`](https://github.com/nodejs/node/commit/7f0e36af52)] - **esm**: fix cache collision on JSON files using file: URL (Antoine du Hamel) [#49887](https://github.com/nodejs/node/pull/49887)
+* \[[`85301803e1`](https://github.com/nodejs/node/commit/85301803e1)] - **esm**: --experimental-default-type flag to flip module defaults (Geoffrey Booth) [#49869](https://github.com/nodejs/node/pull/49869)
+* \[[`f42a103991`](https://github.com/nodejs/node/commit/f42a103991)] - **esm**: require braces for modules code (Geoffrey Booth) [#49657](https://github.com/nodejs/node/pull/49657)
+* \[[`705e623ac4`](https://github.com/nodejs/node/commit/705e623ac4)] - **esm**: remove `globalPreload` hook (superseded by `initialize`) (Jacob Smith) [#49144](https://github.com/nodejs/node/pull/49144)
+* \[[`18a818744f`](https://github.com/nodejs/node/commit/18a818744f)] - **fs**: improve error performance of `readdirSync` (Yagiz Nizipli) [#50131](https://github.com/nodejs/node/pull/50131)
+* \[[`d3985296a9`](https://github.com/nodejs/node/commit/d3985296a9)] - **fs**: fix `unlinkSync` typings (Yagiz Nizipli) [#49859](https://github.com/nodejs/node/pull/49859)
+* \[[`6bc7fa7906`](https://github.com/nodejs/node/commit/6bc7fa7906)] - **fs**: improve error perf of sync `chmod`+`fchmod` (CanadaHonk) [#49859](https://github.com/nodejs/node/pull/49859)
+* \[[`6bd77db41f`](https://github.com/nodejs/node/commit/6bd77db41f)] - **fs**: improve error perf of sync `*times` (CanadaHonk) [#49864](https://github.com/nodejs/node/pull/49864)
+* \[[`bf0f0789da`](https://github.com/nodejs/node/commit/bf0f0789da)] - **fs**: improve error performance of writevSync (IlyasShabi) [#50038](https://github.com/nodejs/node/pull/50038)
+* \[[`8a49735bae`](https://github.com/nodejs/node/commit/8a49735bae)] - **fs**: add flush option to createWriteStream() (Colin Ihrig) [#50093](https://github.com/nodejs/node/pull/50093)
+* \[[`ed49722a8a`](https://github.com/nodejs/node/commit/ed49722a8a)] - **fs**: improve error performance for `ftruncateSync` (André Alves) [#50032](https://github.com/nodejs/node/pull/50032)
+* \[[`e01c1d700d`](https://github.com/nodejs/node/commit/e01c1d700d)] - **fs**: add flush option to writeFile() functions (Colin Ihrig) [#50009](https://github.com/nodejs/node/pull/50009)
+* \[[`f7a160d5b4`](https://github.com/nodejs/node/commit/f7a160d5b4)] - **fs**: improve error performance for `fdatasyncSync` (Jungku Lee) [#49898](https://github.com/nodejs/node/pull/49898)
+* \[[`813713f211`](https://github.com/nodejs/node/commit/813713f211)] - **fs**: throw errors from sync branches instead of separate implementations (Joyee Cheung) [#49913](https://github.com/nodejs/node/pull/49913)
+* \[[`b866e38192`](https://github.com/nodejs/node/commit/b866e38192)] - **http**: refactor to make servername option normalization testable (Rongjian Zhang) [#38733](https://github.com/nodejs/node/pull/38733)
+* \[[`2990390359`](https://github.com/nodejs/node/commit/2990390359)] - **inspector**: simplify dispatchProtocolMessage (Daniel Lemire) [#49780](https://github.com/nodejs/node/pull/49780)
+* \[[`d4c5fe488e`](https://github.com/nodejs/node/commit/d4c5fe488e)] - **lib**: fix compileFunction throws range error for negative numbers (Jithil P Ponnan) [#49855](https://github.com/nodejs/node/pull/49855)
+* \[[`589ac5004c`](https://github.com/nodejs/node/commit/589ac5004c)] - **lib**: faster internal createBlob (Vinícius Lourenço) [#49730](https://github.com/nodejs/node/pull/49730)
+* \[[`952cf0d17a`](https://github.com/nodejs/node/commit/952cf0d17a)] - **lib**: reduce overhead of validateObject (Vinicius Lourenço) [#49928](https://github.com/nodejs/node/pull/49928)
+* \[[`fa250fdec1`](https://github.com/nodejs/node/commit/fa250fdec1)] - **lib**: make fetch sync and return a Promise (Matthew Aitken) [#49936](https://github.com/nodejs/node/pull/49936)
+* \[[`1b96975f27`](https://github.com/nodejs/node/commit/1b96975f27)] - **lib**: fix `primordials` typings (Sam Verschueren) [#49895](https://github.com/nodejs/node/pull/49895)
+* \[[`6aa7101960`](https://github.com/nodejs/node/commit/6aa7101960)] - **lib**: update params in jsdoc for `HTTPRequestOptions` (Jungku Lee) [#49872](https://github.com/nodejs/node/pull/49872)
+* \[[`a4fdb1abe0`](https://github.com/nodejs/node/commit/a4fdb1abe0)] - **lib,test**: do not hardcode Buffer.kMaxLength (Michaël Zasso) [#49876](https://github.com/nodejs/node/pull/49876)
+* \[[`fd21429ef5`](https://github.com/nodejs/node/commit/fd21429ef5)] - **lib**: update usage of always on Atomics API (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`bac85be22d`](https://github.com/nodejs/node/commit/bac85be22d)] - **meta**: ping TSC for offboarding (Tobias Nießen) [#50147](https://github.com/nodejs/node/pull/50147)
+* \[[`609b13e6c2`](https://github.com/nodejs/node/commit/609b13e6c2)] - **meta**: bump actions/upload-artifact from 3.1.2 to 3.1.3 (dependabot\[bot]) [#50000](https://github.com/nodejs/node/pull/50000)
+* \[[`3825464ef4`](https://github.com/nodejs/node/commit/3825464ef4)] - **meta**: bump actions/cache from 3.3.1 to 3.3.2 (dependabot\[bot]) [#50003](https://github.com/nodejs/node/pull/50003)
+* \[[`49f0f9ca11`](https://github.com/nodejs/node/commit/49f0f9ca11)] - **meta**: bump github/codeql-action from 2.21.5 to 2.21.9 (dependabot\[bot]) [#50002](https://github.com/nodejs/node/pull/50002)
+* \[[`f156427244`](https://github.com/nodejs/node/commit/f156427244)] - **meta**: bump actions/checkout from 3.6.0 to 4.1.0 (dependabot\[bot]) [#50001](https://github.com/nodejs/node/pull/50001)
+* \[[`0fe673c7e6`](https://github.com/nodejs/node/commit/0fe673c7e6)] - **meta**: update website team with new name (Rich Trott) [#49883](https://github.com/nodejs/node/pull/49883)
+* \[[`51f4ff2450`](https://github.com/nodejs/node/commit/51f4ff2450)] - **module**: move helpers out of cjs loader (Geoffrey Booth) [#49912](https://github.com/nodejs/node/pull/49912)
+* \[[`7517c9f95b`](https://github.com/nodejs/node/commit/7517c9f95b)] - **module, esm**: jsdoc for modules files (Geoffrey Booth) [#49523](https://github.com/nodejs/node/pull/49523)
+* \[[`b55adfb4f1`](https://github.com/nodejs/node/commit/b55adfb4f1)] - **node-api**: update headers for better wasm support (Toyo Li) [#49037](https://github.com/nodejs/node/pull/49037)
+* \[[`b38e312486`](https://github.com/nodejs/node/commit/b38e312486)] - **node-api**: run finalizers directly from GC (Vladimir Morozov) [#42651](https://github.com/nodejs/node/pull/42651)
+* \[[`0f0dd1a493`](https://github.com/nodejs/node/commit/0f0dd1a493)] - **os**: cache homedir, remove getCheckedFunction (Aras Abbasi) [#50037](https://github.com/nodejs/node/pull/50037)
+* \[[`0e507d30ac`](https://github.com/nodejs/node/commit/0e507d30ac)] - **perf\_hooks**: reduce overhead of new user timings (Vinicius Lourenço) [#49914](https://github.com/nodejs/node/pull/49914)
+* \[[`328bdac7f0`](https://github.com/nodejs/node/commit/328bdac7f0)] - **perf\_hooks**: reducing overhead of performance observer entry list (Vinicius Lourenço) [#50008](https://github.com/nodejs/node/pull/50008)
+* \[[`e6e320ecc7`](https://github.com/nodejs/node/commit/e6e320ecc7)] - **perf\_hooks**: reduce overhead of new resource timings (Vinicius Lourenço) [#49837](https://github.com/nodejs/node/pull/49837)
+* \[[`971af4b211`](https://github.com/nodejs/node/commit/971af4b211)] - **quic**: fix up coverity warning in quic/session.cc (Michael Dawson) [#49865](https://github.com/nodejs/node/pull/49865)
+* \[[`546797f2b1`](https://github.com/nodejs/node/commit/546797f2b1)] - **quic**: prevent copying ngtcp2\_cid (Tobias Nießen) [#48561](https://github.com/nodejs/node/pull/48561)
+* \[[`ac6f594c97`](https://github.com/nodejs/node/commit/ac6f594c97)] - **quic**: address new coverity warning (Michael Dawson) [#48384](https://github.com/nodejs/node/pull/48384)
+* \[[`4ee8ef269b`](https://github.com/nodejs/node/commit/4ee8ef269b)] - **quic**: prevent copying ngtcp2\_cid\_token (Tobias Nießen) [#48370](https://github.com/nodejs/node/pull/48370)
+* \[[`6d2811fbf2`](https://github.com/nodejs/node/commit/6d2811fbf2)] - **quic**: add additional implementation (James M Snell) [#47927](https://github.com/nodejs/node/pull/47927)
+* \[[`0b3fcfcf35`](https://github.com/nodejs/node/commit/0b3fcfcf35)] - **quic**: fix typo in endpoint.h (Tobias Nießen) [#47911](https://github.com/nodejs/node/pull/47911)
+* \[[`76044c4e2b`](https://github.com/nodejs/node/commit/76044c4e2b)] - **quic**: add additional QUIC implementation (James M Snell) [#47603](https://github.com/nodejs/node/pull/47603)
+* \[[`78a15702dd`](https://github.com/nodejs/node/commit/78a15702dd)] - **src**: avoid making JSTransferable wrapper object weak (Chengzhong Wu) [#50026](https://github.com/nodejs/node/pull/50026)
+* \[[`387e2929fe`](https://github.com/nodejs/node/commit/387e2929fe)] - **src**: generate default snapshot with --predictable (Joyee Cheung) [#48749](https://github.com/nodejs/node/pull/48749)
+* \[[`1643adf771`](https://github.com/nodejs/node/commit/1643adf771)] - **src**: fix TLSWrap lifetime bug in ALPN callback (Ben Noordhuis) [#49635](https://github.com/nodejs/node/pull/49635)
+* \[[`66776d8665`](https://github.com/nodejs/node/commit/66776d8665)] - **src**: set port in node\_options to uint16\_t (Yagiz Nizipli) [#49151](https://github.com/nodejs/node/pull/49151)
+* \[[`55ff64001a`](https://github.com/nodejs/node/commit/55ff64001a)] - **src**: name scoped lock (Mohammed Keyvanzadeh) [#50010](https://github.com/nodejs/node/pull/50010)
+* \[[`b903a710f4`](https://github.com/nodejs/node/commit/b903a710f4)] - **src**: use exact return value for `uv_os_getenv` (Yagiz Nizipli) [#49149](https://github.com/nodejs/node/pull/49149)
+* \[[`43500fa646`](https://github.com/nodejs/node/commit/43500fa646)] - **src**: move const variable in `node_file.h` to `node_file.cc` (Jungku Lee) [#49688](https://github.com/nodejs/node/pull/49688)
+* \[[`36ab510da7`](https://github.com/nodejs/node/commit/36ab510da7)] - **src**: remove unused variable (Michaël Zasso) [#49665](https://github.com/nodejs/node/pull/49665)
+* \[[`23d65e7281`](https://github.com/nodejs/node/commit/23d65e7281)] - **src**: revert `IS_RELEASE` to 0 (Rafael Gonzaga) [#49084](https://github.com/nodejs/node/pull/49084)
+* \[[`38dee8a1c0`](https://github.com/nodejs/node/commit/38dee8a1c0)] - **src**: distinguish HTML transferable and cloneable (Chengzhong Wu) [#47956](https://github.com/nodejs/node/pull/47956)
+* \[[`586fcff061`](https://github.com/nodejs/node/commit/586fcff061)] - **src**: fix logically dead code reported by Coverity (Mohammed Keyvanzadeh) [#48589](https://github.com/nodejs/node/pull/48589)
+* \[[`7f2c810814`](https://github.com/nodejs/node/commit/7f2c810814)] - **src,tools**: initialize cppgc (Daryl Haresign) [#45704](https://github.com/nodejs/node/pull/45704)
+* \[[`aad8002b88`](https://github.com/nodejs/node/commit/aad8002b88)] - **stream**: use private symbol for bitmap state (Robert Nagy) [#49993](https://github.com/nodejs/node/pull/49993)
+* \[[`a85e4186e5`](https://github.com/nodejs/node/commit/a85e4186e5)] - **stream**: reduce overhead of transfer (Vinicius Lourenço) [#50107](https://github.com/nodejs/node/pull/50107)
+* \[[`e9bda11761`](https://github.com/nodejs/node/commit/e9bda11761)] - **stream**: lazy allocate back pressure buffer (Robert Nagy) [#50013](https://github.com/nodejs/node/pull/50013)
+* \[[`557044af40`](https://github.com/nodejs/node/commit/557044af40)] - **stream**: avoid unnecessary drain for sync stream (Robert Nagy) [#50014](https://github.com/nodejs/node/pull/50014)
+* \[[`95b8f5dcab`](https://github.com/nodejs/node/commit/95b8f5dcab)] - **stream**: optimize Writable (Robert Nagy) [#50012](https://github.com/nodejs/node/pull/50012)
+* \[[`5de25deeb9`](https://github.com/nodejs/node/commit/5de25deeb9)] - **stream**: avoid tick in writable hot path (Robert Nagy) [#49966](https://github.com/nodejs/node/pull/49966)
+* \[[`53b5545672`](https://github.com/nodejs/node/commit/53b5545672)] - **stream**: writable state bitmap (Robert Nagy) [#49899](https://github.com/nodejs/node/pull/49899)
+* \[[`d4e99b1a66`](https://github.com/nodejs/node/commit/d4e99b1a66)] - **stream**: remove asIndexedPairs (Chemi Atlow) [#48150](https://github.com/nodejs/node/pull/48150)
+* \[[`41e4174945`](https://github.com/nodejs/node/commit/41e4174945)] - **test**: replace forEach with for..of in test-net-isipv6.js (Niya Shiyas) [#49823](https://github.com/nodejs/node/pull/49823)
+* \[[`f0e720a7fa`](https://github.com/nodejs/node/commit/f0e720a7fa)] - **test**: add EOVERFLOW as an allowed error (Abdirahim Musse) [#50128](https://github.com/nodejs/node/pull/50128)
+* \[[`224f3ae974`](https://github.com/nodejs/node/commit/224f3ae974)] - **test**: reduce number of repetition in test-heapdump-shadowrealm.js (Chengzhong Wu) [#50104](https://github.com/nodejs/node/pull/50104)
+* \[[`76004f3e56`](https://github.com/nodejs/node/commit/76004f3e56)] - **test**: replace forEach with for..of in test-parse-args.mjs (Niya Shiyas) [#49824](https://github.com/nodejs/node/pull/49824)
+* \[[`fce8fbadcd`](https://github.com/nodejs/node/commit/fce8fbadcd)] - **test**: replace forEach with for..of in test-process-env (Niya Shiyas) [#49825](https://github.com/nodejs/node/pull/49825)
+* \[[`24492476a7`](https://github.com/nodejs/node/commit/24492476a7)] - **test**: replace forEach with for..of in test-http-url (Niya Shiyas) [#49840](https://github.com/nodejs/node/pull/49840)
+* \[[`2fe511ba23`](https://github.com/nodejs/node/commit/2fe511ba23)] - **test**: replace forEach() in test-net-perf\_hooks with for of (Narcisa Codreanu) [#49831](https://github.com/nodejs/node/pull/49831)
+* \[[`42c37f28e6`](https://github.com/nodejs/node/commit/42c37f28e6)] - **test**: change forEach to for...of (Tiffany Lastimosa) [#49799](https://github.com/nodejs/node/pull/49799)
+* \[[`6c9625dca4`](https://github.com/nodejs/node/commit/6c9625dca4)] - **test**: update skip for moved `test-wasm-web-api` (Richard Lau) [#49958](https://github.com/nodejs/node/pull/49958)
+* \[[`f05d6d090c`](https://github.com/nodejs/node/commit/f05d6d090c)] - _**Revert**_ "**test**: mark test-runner-output as flaky" (Luigi Pinca) [#49905](https://github.com/nodejs/node/pull/49905)
+* \[[`035e06317a`](https://github.com/nodejs/node/commit/035e06317a)] - **test**: disambiguate AIX and IBM i (Richard Lau) [#48056](https://github.com/nodejs/node/pull/48056)
+* \[[`4d0aeed4a6`](https://github.com/nodejs/node/commit/4d0aeed4a6)] - **test**: deflake test-perf-hooks.js (Joyee Cheung) [#49892](https://github.com/nodejs/node/pull/49892)
+* \[[`853f57239c`](https://github.com/nodejs/node/commit/853f57239c)] - **test**: migrate message error tests from Python to JS (Yiyun Lei) [#49721](https://github.com/nodejs/node/pull/49721)
+* \[[`a71e3a65bb`](https://github.com/nodejs/node/commit/a71e3a65bb)] - **test**: fix edge snapshot stack traces (Geoffrey Booth) [#49659](https://github.com/nodejs/node/pull/49659)
+* \[[`6b76b7782c`](https://github.com/nodejs/node/commit/6b76b7782c)] - **test**: skip v8-updates/test-linux-perf (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`c13c98dd38`](https://github.com/nodejs/node/commit/c13c98dd38)] - **test**: skip test-tick-processor-arguments on SmartOS (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`738aa304b3`](https://github.com/nodejs/node/commit/738aa304b3)] - **test**: adapt REPL test to V8 changes (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`de5c009252`](https://github.com/nodejs/node/commit/de5c009252)] - **test**: adapt test-fs-write to V8 internal changes (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`8c36168b42`](https://github.com/nodejs/node/commit/8c36168b42)] - **test**: update flag to disable SharedArrayBuffer (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`6ccb15f7ef`](https://github.com/nodejs/node/commit/6ccb15f7ef)] - **test**: adapt debugger tests to V8 11.4 (Philip Pfaffe) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`c5de3b49e8`](https://github.com/nodejs/node/commit/c5de3b49e8)] - **test,crypto**: update WebCryptoAPI WPT (Filip Skokan) [#50039](https://github.com/nodejs/node/pull/50039)
+* \[[`4b35a9cfda`](https://github.com/nodejs/node/commit/4b35a9cfda)] - **test\_runner**: add test location for FileTests (Colin Ihrig) [#49999](https://github.com/nodejs/node/pull/49999)
+* \[[`c935d4c8fa`](https://github.com/nodejs/node/commit/c935d4c8fa)] - **test\_runner**: replace spurious if with else (Colin Ihrig) [#49943](https://github.com/nodejs/node/pull/49943)
+* \[[`a4c7f81241`](https://github.com/nodejs/node/commit/a4c7f81241)] - **test\_runner**: catch reporter errors (Moshe Atlow) [#49646](https://github.com/nodejs/node/pull/49646)
+* \[[`bb52656fc6`](https://github.com/nodejs/node/commit/bb52656fc6)] - _**Revert**_ "**test\_runner**: run global after() hook earlier" (Joyee Cheung) [#49110](https://github.com/nodejs/node/pull/49110)
+* \[[`6346bdc526`](https://github.com/nodejs/node/commit/6346bdc526)] - **test\_runner**: run global after() hook earlier (Colin Ihrig) [#49059](https://github.com/nodejs/node/pull/49059)
+* \[[`0d8faf2952`](https://github.com/nodejs/node/commit/0d8faf2952)] - **test\_runner,test**: fix flaky test-runner-cli-concurrency.js (Colin Ihrig) [#50108](https://github.com/nodejs/node/pull/50108)
+* \[[`b1ada0ad55`](https://github.com/nodejs/node/commit/b1ada0ad55)] - **tls**: handle cases where the raw socket is destroyed (Luigi Pinca) [#49980](https://github.com/nodejs/node/pull/49980)
+* \[[`fae1af0a75`](https://github.com/nodejs/node/commit/fae1af0a75)] - **tls**: ciphers allow bang syntax (Chemi Atlow) [#49712](https://github.com/nodejs/node/pull/49712)
+* \[[`766198b9e1`](https://github.com/nodejs/node/commit/766198b9e1)] - **tools**: fix comments referencing dep\_updaters scripts (Keksonoid) [#50165](https://github.com/nodejs/node/pull/50165)
+* \[[`760b5dd259`](https://github.com/nodejs/node/commit/760b5dd259)] - **tools**: remove no-return-await lint rule (翠 / green) [#50118](https://github.com/nodejs/node/pull/50118)
+* \[[`a0a5b751fb`](https://github.com/nodejs/node/commit/a0a5b751fb)] - **tools**: update lint-md-dependencies (Node.js GitHub Bot) [#50083](https://github.com/nodejs/node/pull/50083)
+* \[[`69fb55e6b9`](https://github.com/nodejs/node/commit/69fb55e6b9)] - **tools**: update eslint to 8.51.0 (Node.js GitHub Bot) [#50084](https://github.com/nodejs/node/pull/50084)
+* \[[`f73650ea52`](https://github.com/nodejs/node/commit/f73650ea52)] - **tools**: remove genv8constants.py (Ben Noordhuis) [#50023](https://github.com/nodejs/node/pull/50023)
+* \[[`581434e54f`](https://github.com/nodejs/node/commit/581434e54f)] - **tools**: update eslint to 8.50.0 (Node.js GitHub Bot) [#49989](https://github.com/nodejs/node/pull/49989)
+* \[[`344d3c4b7c`](https://github.com/nodejs/node/commit/344d3c4b7c)] - **tools**: update lint-md-dependencies (Node.js GitHub Bot) [#49983](https://github.com/nodejs/node/pull/49983)
+* \[[`7f06c270c6`](https://github.com/nodejs/node/commit/7f06c270c6)] - **tools**: add navigation ARIA landmark to generated API ToC (Rich Trott) [#49882](https://github.com/nodejs/node/pull/49882)
+* \[[`e97d25687b`](https://github.com/nodejs/node/commit/e97d25687b)] - **tools**: use osx notarytool for future releases (Ulises Gascon) [#48701](https://github.com/nodejs/node/pull/48701)
+* \[[`3f1936f698`](https://github.com/nodejs/node/commit/3f1936f698)] - **tools**: update github\_reporter to 1.5.3 (Node.js GitHub Bot) [#49877](https://github.com/nodejs/node/pull/49877)
+* \[[`8568de3da6`](https://github.com/nodejs/node/commit/8568de3da6)] - **tools**: add new V8 headers to distribution (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`86cb23d09f`](https://github.com/nodejs/node/commit/86cb23d09f)] - **tools**: update V8 gypfiles for 11.8 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`9c6219c7e2`](https://github.com/nodejs/node/commit/9c6219c7e2)] - **tools**: update V8 gypfiles for 11.7 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`73ddf50163`](https://github.com/nodejs/node/commit/73ddf50163)] - **tools**: update V8 gypfiles for 11.6 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`817ef255ea`](https://github.com/nodejs/node/commit/817ef255ea)] - **tools**: update V8 gypfiles for 11.5 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`f34a3a9861`](https://github.com/nodejs/node/commit/f34a3a9861)] - **tools**: update V8 gypfiles for 11.4 (Michaël Zasso) [#49639](https://github.com/nodejs/node/pull/49639)
+* \[[`9df864ddeb`](https://github.com/nodejs/node/commit/9df864ddeb)] - **typings**: use `Symbol.dispose` and `Symbol.asyncDispose` in types (Niklas Mollenhauer) [#50123](https://github.com/nodejs/node/pull/50123)
+* \[[`54bb691c0b`](https://github.com/nodejs/node/commit/54bb691c0b)] - **util**: lazy parse mime parameters (Aras Abbasi) [#49889](https://github.com/nodejs/node/pull/49889)
+* \[[`1d220b55ac`](https://github.com/nodejs/node/commit/1d220b55ac)] - **vm**: use default HDO when importModuleDynamically is not set (Joyee Cheung) [#49950](https://github.com/nodejs/node/pull/49950)
+* \[[`c1a3a98560`](https://github.com/nodejs/node/commit/c1a3a98560)] - **wasi**: address coverity warning (Michael Dawson) [#49866](https://github.com/nodejs/node/pull/49866)
+* \[[`9cb8eb7177`](https://github.com/nodejs/node/commit/9cb8eb7177)] - **wasi**: fix up wasi tests for ibmi (Michael Dawson) [#49953](https://github.com/nodejs/node/pull/49953)
+* \[[`16ac5e1ca8`](https://github.com/nodejs/node/commit/16ac5e1ca8)] - **zlib**: fix discovery of cpu-features.h for android (MatteoBax) [#49828](https://github.com/nodejs/node/pull/49828)
diff --git a/doc/changelogs/CHANGELOG_V4.md b/doc/changelogs/CHANGELOG_V4.md
index d9c8d9193aa957..e8baa5a615a346 100644
--- a/doc/changelogs/CHANGELOG_V4.md
+++ b/doc/changelogs/CHANGELOG_V4.md
@@ -56,6 +56,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V5.md b/doc/changelogs/CHANGELOG_V5.md
index 0949a73b63d327..6cd42b15b33120 100644
--- a/doc/changelogs/CHANGELOG_V5.md
+++ b/doc/changelogs/CHANGELOG_V5.md
@@ -32,6 +32,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V6.md b/doc/changelogs/CHANGELOG_V6.md
index e891c4e298c6ea..836c64edb73413 100644
--- a/doc/changelogs/CHANGELOG_V6.md
+++ b/doc/changelogs/CHANGELOG_V6.md
@@ -61,6 +61,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V7.md b/doc/changelogs/CHANGELOG_V7.md
index 702c212ace22f6..22a976ed15e068 100644
--- a/doc/changelogs/CHANGELOG_V7.md
+++ b/doc/changelogs/CHANGELOG_V7.md
@@ -30,6 +30,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V8.md b/doc/changelogs/CHANGELOG_V8.md
index cac64544bfa11b..00ecd10cef07aa 100644
--- a/doc/changelogs/CHANGELOG_V8.md
+++ b/doc/changelogs/CHANGELOG_V8.md
@@ -52,6 +52,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/changelogs/CHANGELOG_V9.md b/doc/changelogs/CHANGELOG_V9.md
index b5531909ea243f..46937b022a501f 100644
--- a/doc/changelogs/CHANGELOG_V9.md
+++ b/doc/changelogs/CHANGELOG_V9.md
@@ -31,6 +31,7 @@
 </table>
 
 * Other Versions
+  * [21.x](CHANGELOG_V21.md)
   * [20.x](CHANGELOG_V20.md)
   * [19.x](CHANGELOG_V19.md)
   * [18.x](CHANGELOG_V18.md)
diff --git a/doc/contributing/backporting-to-release-lines.md b/doc/contributing/backporting-to-release-lines.md
index d9dea5dbe2b06f..851e4e255442d1 100644
--- a/doc/contributing/backporting-to-release-lines.md
+++ b/doc/contributing/backporting-to-release-lines.md
@@ -40,10 +40,26 @@ For the following labels, the `N` in `vN.x` refers to the major release number.
 
 ## How to submit a backport pull request
 
-For the following steps, let's assume that a backport is needed for the v10.x
-release line. All commands will use the `v10.x-staging` branch as the target
-branch. In order to submit a backport pull request to another branch, simply
-replace that with the staging branch for the targeted release line.
+For the following steps, let's assume that you need to backport PR `123`
+to the v20.x release line. All commands will use the `v20.x-staging` branch
+as the target branch. In order to submit a backport pull request to another
+branch, simply replace that with the staging branch for the targeted release
+line.
+
+### Automated
+
+1. Make sure you have [`@node-core/utils`][] installed
+
+2. Run the [`git node backport`][] command
+
+```bash
+# Backport PR 123 to v20.x-staging
+git node backport 123 --to=20
+```
+
+3. Jump to step 5 in the Manual section below
+
+### Manually
 
 1. Checkout the staging branch for the targeted release line.
 
@@ -56,10 +72,10 @@ replace that with the staging branch for the targeted release line.
    # the origin remote points to your fork, and the upstream remote points
    # to git@github.com:nodejs/node.git
    cd $NODE_DIR
-   # If v10.x-staging is checked out `pull` should be used instead of `fetch`
-   git fetch upstream v10.x-staging:v10.x-staging -f
+   # If v20.x-staging is checked out `pull` should be used instead of `fetch`
+   git fetch upstream v20.x-staging:v20.x-staging -f
    # Assume we want to backport PR #10157
-   git checkout -b backport-10157-to-v10.x v10.x-staging
+   git checkout -b backport-10157-to-v20.x v20.x-staging
    # Ensure there are no test artifacts from previous builds
    # Note that this command deletes all files and directories
    # not under revision control below the ./test directory.
@@ -93,10 +109,10 @@ replace that with the staging branch for the targeted release line.
 8. Push the changes to your fork.
 
 9. Open a pull request:
-   1. Be sure to target the `v10.x-staging` branch in the pull request.
+   1. Be sure to target the `v20.x-staging` branch in the pull request.
    2. Include the backport target in the pull request title in the following
-      format: `[v10.x backport] <commit title>`.
-      Example: `[v10.x backport] process: improve performance of nextTick`
+      format: `[v20.x backport] <commit title>`.
+      Example: `[v20.x backport] process: improve performance of nextTick`
    3. Check the checkbox labeled "Allow edits and access to secrets by
       maintainers".
    4. In the description add a reference to the original pull request.
@@ -105,15 +121,17 @@ replace that with the staging branch for the targeted release line.
    6. Run a [`node-test-pull-request`][] CI job (with `REBASE_ONTO` set to the
       default `<pr base branch>`)
 
-10. Replace the `backport-requested-v10.x` label on the original pull request
-    with `backport-open-v10.x`.
+10. Replace the `backport-requested-v20.x` label on the original pull request
+    with `backport-open-v20.x`.
 
 11. If during the review process conflicts arise, use the following to rebase:
-    `git pull --rebase upstream v10.x-staging`
+    `git pull --rebase upstream v20.x-staging`
 
-After the pull request lands, replace the `backport-open-v10.x` label on the
-original pull request with `backported-to-v10.x`.
+After the pull request lands, replace the `backport-open-v20.x` label on the
+original pull request with `backported-to-v20.x`.
 
 [Release Plan]: https://github.com/nodejs/Release#release-plan
 [Release Schedule]: https://github.com/nodejs/Release#release-schedule
+[`@node-core/utils`]: https://github.com/nodejs/node-core-utils
+[`git node backport`]: https://github.com/nodejs/node-core-utils/blob/main/docs/git-node.md#git-node-backport
 [`node-test-pull-request`]: https://ci.nodejs.org/job/node-test-pull-request/build
diff --git a/doc/contributing/collaborator-guide.md b/doc/contributing/collaborator-guide.md
index a4218acc7d4fd0..2ecf14a082dc3b 100644
--- a/doc/contributing/collaborator-guide.md
+++ b/doc/contributing/collaborator-guide.md
@@ -555,22 +555,23 @@ See the [commit queue guide][commit-queue.md].
 
 ### Using `git-node`
 
-In most cases, using [the `git-node` command][git-node] of [`node-core-utils`][]
-is enough to land a pull request. If you discover a problem when using
-this tool, please file an issue [to the issue tracker][node-core-utils-issues].
+In most cases, using [the `git-node` command][git-node] of
+[`@node-core/utils`][] is enough to land a pull request. If you discover a
+problem when using this tool, please file an issue
+[to the issue tracker][node-core-utils-issues].
 
 Quick example:
 
 ```bash
-npm install -g node-core-utils
+npm install -g @node-core/utils
 git node land $PRID
 ```
 
-To use `node-core-utils`, you will need a GitHub access token. If you do not
-have one, `node-core-utils` will create one for you the first time you use it.
+To use `@node-core/utils`, you will need a GitHub access token. If you do not
+have one, `@node-core/utils` will create one for you the first time you use it.
 To do this, it will ask for your GitHub password and two-factor authentication
 code. If you wish to create the token yourself in advance, see
-[the `node-core-utils` guide][node-core-utils-credentials].
+[the `@node-core/utils` guide][node-core-utils-credentials].
 
 ### Technical HOWTO
 
@@ -959,7 +960,7 @@ need to be attached anymore, as only important bugfixes will be included.
 [TSC]: https://github.com/nodejs/TSC
 [`--pending-deprecation`]: ../api/cli.md#--pending-deprecation
 [`--throw-deprecation`]: ../api/cli.md#--throw-deprecation
-[`node-core-utils`]: https://github.com/nodejs/node-core-utils
+[`@node-core/utils`]: https://github.com/nodejs/node-core-utils
 [backporting guide]: backporting-to-release-lines.md
 [commit message guidelines]: pull-requests.md#commit-message-guidelines
 [commit-example]: https://github.com/nodejs/node/commit/b636ba8186
diff --git a/doc/contributing/commit-queue.md b/doc/contributing/commit-queue.md
index 4730d0889e99aa..cece9ea84e94f8 100644
--- a/doc/contributing/commit-queue.md
+++ b/doc/contributing/commit-queue.md
@@ -7,8 +7,8 @@ _tl;dr: You can land pull requests by adding the `commit-queue` label to it._
 Commit Queue is an experimental feature for the project which simplifies the
 landing process by automating it via GitHub Actions. With it, collaborators can
 land pull requests by adding the `commit-queue` label to a PR. All
-checks will run via node-core-utils, and if the pull request is ready to land,
-the Action will rebase it and push to `main`.
+checks will run via `@node-core/utils`, and if the pull request is ready to
+land, the Action will rebase it and push to `main`.
 
 This document gives an overview of how the Commit Queue works, as well as
 implementation details, reasoning for design choices, and current limitations.
@@ -76,7 +76,7 @@ reasons:
    commit, meaning we wouldn't be able to use it for already opened PRs
    without rebasing them first.
 
-`node-core-utils` is configured with a personal token and
+`@node-core/utils` is configured with a personal token and
 a Jenkins token from
 [@nodejs-github-bot](https://github.com/nodejs/github-bot).
 `octokit/graphql-action` is used to fetch all pull requests with the
diff --git a/doc/contributing/maintaining/maintaining-V8.md b/doc/contributing/maintaining/maintaining-V8.md
index 0fe9b393fc0f15..740af7f228f694 100644
--- a/doc/contributing/maintaining/maintaining-V8.md
+++ b/doc/contributing/maintaining/maintaining-V8.md
@@ -122,7 +122,7 @@ some manual steps and is recommended.
 
 Here are the steps for the bug mentioned above:
 
-1. Install `git-node` by installing [`node-core-utils`][].
+1. Install `git-node` by installing [`@node-core/utils`][].
 2. Install the prerequisites for [`git-node-v8`][].
 3. Find the commit hash linked-to in the issue (in this case a51f429).
 4. Checkout a branch off the appropriate _vY.x-staging_ branch (e.g.
@@ -277,7 +277,7 @@ that Node.js may be floating (or else cause a merge conflict).
 
 #### Applying minor updates with `git-node` (recommended)
 
-1. Install [`git-node`][] by installing [`node-core-utils`][].
+1. Install [`git-node`][] by installing [`@node-core/utils`][].
 2. Install the prerequisites for [`git-node-v8`][].
 3. Run `git node v8 minor` to apply a minor update.
 
@@ -384,8 +384,8 @@ This would require some tooling to:
 [V8MergingPatching]: https://v8.dev/docs/merge-patch
 [V8TemplateMergeRequest]: https://bugs.chromium.org/p/v8/issues/entry?template=Node.js%20merge%20request
 [V8TemplateUpstreamBug]: https://bugs.chromium.org/p/v8/issues/entry?template=Node.js%20upstream%20bug
+[`@node-core/utils`]: https://github.com/nodejs/node-core-utils#Install
 [`git-node-v8-backport`]: https://github.com/nodejs/node-core-utils/blob/main/docs/git-node.md#git-node-v8-backport-sha
 [`git-node-v8-minor`]: https://github.com/nodejs/node-core-utils/blob/main/docs/git-node.md#git-node-v8-minor
 [`git-node-v8`]: https://github.com/nodejs/node-core-utils/blob/HEAD/docs/git-node.md#git-node-v8
 [`git-node`]: https://github.com/nodejs/node-core-utils/blob/HEAD/docs/git-node.md#git-node-v8
-[`node-core-utils`]: https://github.com/nodejs/node-core-utils#Install
diff --git a/doc/contributing/maintaining/maintaining-dependencies.md b/doc/contributing/maintaining/maintaining-dependencies.md
index 321020a29670a1..05f15ff758554e 100644
--- a/doc/contributing/maintaining/maintaining-dependencies.md
+++ b/doc/contributing/maintaining/maintaining-dependencies.md
@@ -9,29 +9,29 @@ All dependencies are located within the `deps` directory.
 This a list of all the dependencies:
 
 * [acorn 8.10.0][]
-* [ada 2.6.0][]
+* [ada 2.6.10][]
 * [base64 0.5.0][]
 * [brotli 1.0.9][]
 * [c-ares 1.19.0][]
 * [cjs-module-lexer 1.2.2][]
 * [corepack][]
-* [googletest 8a6feab][]
+* [googletest 2dd1c13][]
 * [histogram 0.11.8][]
 * [icu-small 73.2][]
 * [libuv 1.46.0][]
-* [llhttp 8.1.0][]
+* [llhttp 9.1.2][]
 * [minimatch 9.0.3][]
-* [nghttp2 1.55.1][]
+* [nghttp2 1.57.0][]
 * [nghttp3 0.7.0][]
 * [ngtcp2 0.8.1][]
 * [npm 9.6.7][]
 * [openssl 3.0.8][]
 * [postject 1.0.0-alpha.6][]
-* [simdutf 3.2.17][]
-* [undici 5.23.0][]
-* [uvwasi 0.0.16][]
-* [V8 11.3.244.8][]
-* [zlib 1.2.13.1-motley-f5fd0ad][]
+* [simdutf 3.2.18][]
+* [undici 5.26.3][]
+* [uvwasi 0.0.19][]
+* [V8 11.8.172.12][]
+* [zlib 1.2.13.1-motley-fef5869][]
 
 Any code which meets one or more of these conditions should
 be managed as a dependency:
@@ -150,7 +150,7 @@ The [acorn](https://github.com/acornjs/acorn) dependency is a JavaScript parser.
 [acorn-walk](https://github.com/acornjs/acorn/tree/master/acorn-walk) is
 an abstract syntax tree walker for the ESTree format.
 
-### ada 2.6.0
+### ada 2.6.10
 
 The [ada](https://github.com/ada-url/ada) dependency is a
 fast and spec-compliant URL parser written in C++.
@@ -189,7 +189,7 @@ In practical terms, Corepack will let you use Yarn and pnpm without having to
 install them - just like what currently happens with npm, which is shipped
 by Node.js by default.
 
-### googletest 8a6feab
+### googletest 2dd1c13
 
 The [googletest](https://github.com/google/googletest) dependency is Google’s
 C++ testing and mocking framework.
@@ -212,7 +212,7 @@ The [libuv](https://github.com/libuv/libuv) dependency is a
 multi-platform support library with a focus on asynchronous I/O.
 It was primarily developed for use by Node.js.
 
-### llhttp 8.1.0
+### llhttp 9.1.2
 
 The [llhttp](https://github.com/nodejs/llhttp) dependency is
 the http parser used by Node.js.
@@ -223,7 +223,7 @@ See [maintaining-http][] for more informations.
 The [minimatch](https://github.com/isaacs/minimatch) dependency is a
 minimal matching utility.
 
-### nghttp2 1.55.1
+### nghttp2 1.57.0
 
 The [nghttp2](https://github.com/nghttp2/nghttp2) dependency is a C library
 implementing HTTP/2 protocol.
@@ -286,18 +286,18 @@ See [maintaining-openssl][] for more informations.
 The [postject](https://github.com/nodejs/postject) dependency is used for the
 [Single Executable strategic initiative](https://github.com/nodejs/single-executable).
 
-### simdutf 3.2.17
+### simdutf 3.2.18
 
 The [simdutf](https://github.com/simdutf/simdutf) dependency is
 a C++ library for fast UTF-8 decoding and encoding.
 
-### undici 5.23.0
+### undici 5.26.3
 
 The [undici](https://github.com/nodejs/undici) dependency is an HTTP/1.1 client,
 written from scratch for Node.js..
 See [maintaining-http][] for more informations.
 
-### uvwasi 0.0.16
+### uvwasi 0.0.19
 
 The [uvwasi](https://github.com/nodejs/uvwasi) dependency implements
 the WASI system call API, so that WebAssembly runtimes can easily
@@ -305,13 +305,13 @@ implement WASI calls.
 Under the hood, uvwasi leverages libuv where possible for maximum portability.
 See [maintaining-web-assembly][] for more informations.
 
-### V8 11.3.244.8
+### V8 11.8.172.12
 
 [V8](https://chromium.googlesource.com/v8/v8.git/) is Google's open source
 high-performance JavaScript and WebAssembly engine, written in C++.
 See [maintaining-V8][] for more informations.
 
-### zlib 1.2.13.1-motley-f5fd0ad
+### zlib 1.2.13.1-motley-fef5869
 
 The [zlib](https://chromium.googlesource.com/chromium/src/+/refs/heads/main/third_party/zlib)
 dependency lossless data-compression library,
@@ -319,18 +319,18 @@ it comes from the Chromium team's zlib fork which incorporated
 performance improvements not currently available in standard zlib.
 
 [acorn 8.10.0]: #acorn-8100
-[ada 2.6.0]: #ada-260
+[ada 2.6.10]: #ada-2610
 [base64 0.5.0]: #base64-050
 [brotli 1.0.9]: #brotli-109
 [c-ares 1.19.0]: #c-ares-1190
 [cjs-module-lexer 1.2.2]: #cjs-module-lexer-122
 [corepack]: #corepack
 [dependency-update-action]: ../../../.github/workflows/tools.yml
-[googletest 8a6feab]: #googletest-8a6feab
+[googletest 2dd1c13]: #googletest-2dd1c13
 [histogram 0.11.8]: #histogram-0118
 [icu-small 73.2]: #icu-small-732
 [libuv 1.46.0]: #libuv-1460
-[llhttp 8.1.0]: #llhttp-810
+[llhttp 9.1.2]: #llhttp-912
 [maintaining-V8]: ./maintaining-V8.md
 [maintaining-cjs-module-lexer]: ./maintaining-cjs-module-lexer.md
 [maintaining-http]: ./maintaining-http.md
@@ -338,15 +338,15 @@ performance improvements not currently available in standard zlib.
 [maintaining-openssl]: ./maintaining-openssl.md
 [maintaining-web-assembly]: ./maintaining-web-assembly.md
 [minimatch 9.0.3]: #minimatch-903
-[nghttp2 1.55.1]: #nghttp2-1551
+[nghttp2 1.57.0]: #nghttp2-1570
 [nghttp3 0.7.0]: #nghttp3-070
 [ngtcp2 0.8.1]: #ngtcp2-081
 [npm 9.6.7]: #npm-967
 [openssl 3.0.8]: #openssl-308
 [postject 1.0.0-alpha.6]: #postject-100-alpha6
-[simdutf 3.2.17]: #simdutf-3217
-[undici 5.23.0]: #undici-5230
+[simdutf 3.2.18]: #simdutf-3218
+[undici 5.26.3]: #undici-5263
 [update-openssl-action]: ../../../.github/workflows/update-openssl.yml
-[uvwasi 0.0.16]: #uvwasi-0016
-[v8 11.3.244.8]: #v8-1132448
-[zlib 1.2.13.1-motley-f5fd0ad]: #zlib-12131-motley-f5fd0ad
+[uvwasi 0.0.19]: #uvwasi-0019
+[v8 11.8.172.12]: #v8-11817212
+[zlib 1.2.13.1-motley-fef5869]: #zlib-12131-motley-fef5869
diff --git a/doc/contributing/pull-requests.md b/doc/contributing/pull-requests.md
index c35fda734f3173..a2bd63d3572393 100644
--- a/doc/contributing/pull-requests.md
+++ b/doc/contributing/pull-requests.md
@@ -34,9 +34,11 @@
 ## Dependencies
 
 Node.js has several bundled dependencies in the _deps/_ and the _tools/_
-directories that are not part of the project proper. Changes to files in those
-directories should be sent to their respective projects. Do not send a patch to
-Node.js. We cannot accept such patches.
+directories that are not part of the project proper.
+These are detailed in the [maintaining dependencies][] document.
+Changes to files in those directories should be sent
+to their respective projects.
+Do not send a patch to Node.js. We cannot accept such patches.
 
 In case of doubt, open an issue in the
 [issue tracker](https://github.com/nodejs/node/issues/) or contact one of the
@@ -590,6 +592,7 @@ More than one subsystem may be valid for any particular issue or pull request.
 [guide for writing tests in Node.js]: writing-tests.md
 [hiding-a-comment]: https://help.github.com/articles/managing-disruptive-comments/#hiding-a-comment
 [https://ci.nodejs.org/]: https://ci.nodejs.org/
+[maintaining dependencies]: ./maintaining/maintaining-dependencies.md
 [nodejs/core-validate-commit]: https://github.com/nodejs/core-validate-commit/blob/main/lib/rules/subsystem.js
 [pull request template]: https://raw.githubusercontent.com/nodejs/node/HEAD/.github/PULL_REQUEST_TEMPLATE.md
 [running tests]: ../../BUILDING.md#running-tests
diff --git a/doc/contributing/releases.md b/doc/contributing/releases.md
index 8b4bdb3c487104..1d3bd71194caf4 100644
--- a/doc/contributing/releases.md
+++ b/doc/contributing/releases.md
@@ -563,7 +563,7 @@ ecosystem.
 Use `ncu-ci` to compare `vx.x` run (10) and proposal branch (11)
 
 ```bash
-npm i -g node-core-utils
+npm i -g @node-core/utils
 ncu-ci citgm 10 11
 ```
 
@@ -1052,7 +1052,7 @@ _In whatever form you do this..._
 ### Marking a release line as LTS
 
 The process of marking a release line as LTS has been automated using
-[node-core-utils](https://github.com/nodejs/node-core-utils).
+[`@node-core/utils`](https://github.com/nodejs/node-core-utils).
 
 Start by checking out the staging branch for the release line that is going to
 be marked as LTS, e.g:
@@ -1061,10 +1061,10 @@ be marked as LTS, e.g:
 git checkout v1.x-staging
 ```
 
-Next, make sure you have **node-core-utils** installed:
+Next, make sure you have **`@node-core/utils`** installed:
 
 ```bash
-npm i -g node-core-utils
+npm i -g @node-core/utils
 ```
 
 Run the prepare LTS release command:
@@ -1110,7 +1110,7 @@ current LTS codename in its release line changelog file.
 
 The `test/parallel/test-process-release.js` file might also need to be updated.
 
-In case you can not run the automated `node-core-utils` command and you are
+In case you can not run the automated `@node-core/utils` command and you are
 currently running these steps manually it's a good idea to refer to previous
 LTS proposal PRs and make sure all required changes are covered.
 
@@ -1207,6 +1207,20 @@ Notify the `@nodejs/npm` team in the release proposal PR to inform them of the
 upcoming release. `npm` maintains a list of [supported versions](https://github.com/npm/cli/blob/latest/lib/utils/unsupported.js#L3)
 that will need updating to include the new major release.
 
+To keep the branch in sync until the release date, it can be as simple as
+doing the following:
+
+> Make sure to check that there are no PRs with the label `dont-land-on-vX.x`.
+
+```bash
+git checkout vN.x
+git reset --hard upstream/main
+git checkout vN.x-staging
+git reset --hard upstream/main
+git push upstream vN.x
+git push upstream vN.x-staging
+```
+
 ### Update `NODE_MODULE_VERSION`
 
 This macro in `src/node_version.h` is used to signal an ABI version for native
@@ -1279,6 +1293,12 @@ The commits in the generated changelog must then be organized:
 * Remove all reverted commits and their reverts
 * Separate all SEMVER-MAJOR, SEMVER-MINOR, and SEMVER-PATCH commits into lists
 
+```console
+$ branch-diff upstream/vN-1.x upstream/vN.x --require-label=semver-major --group --filter-release  # get all majors
+$ branch-diff upstream/vN-1.x upstream/vN.x --require-label=semver-minor --group --filter-release  # get all minors
+$ branch-diff upstream/vN-1.x upstream/vN.x --exclude-label=semver-major,semver-minor --group --filter-release  # get all patches
+```
+
 #### Generate the notable changes
 
 For a major release, all SEMVER-MAJOR commits that are not strictly internal,
diff --git a/doc/contributing/security-release-process.md b/doc/contributing/security-release-process.md
index fd33f3ccbb5afd..4cd9835a953e94 100644
--- a/doc/contributing/security-release-process.md
+++ b/doc/contributing/security-release-process.md
@@ -30,6 +30,7 @@ The current security stewards are documented in the main Node.js
 | RH and IBM   | Michael         | 2023-Feb-16  |
 | NearForm     | Rafael          | 2023-Jun-20  |
 | NearForm     | Rafael          | 2023-Aug-09  |
+| NearForm     | Rafael          | 2023-Oct-13  |
 | Datadog      | Bryan           |              |
 | IBM          | Joe             |              |
 | Platformatic | Matteo          |              |
@@ -120,7 +121,8 @@ The google groups UI does not support adding a CC, until we figure
 out a better way, forward the email you receive to
 `oss-security@lists.openwall.com` as a CC.
 
-* [ ] Send a message to `#nodejs-social` in OpenJS Foundation slack
+* [ ] Post in the [nodejs-social channel][]
+  in the OpenJS slack asking for amplication of the blog post.
 
   ```text
   Security release pre-alert:
@@ -179,7 +181,8 @@ out a better way, forward the email you receive to
   For more information see: https://nodejs.org/en/blog/vulnerability/month-year-security-releases/
   ```
 
-* [ ] Create a new issue in [nodejs/tweet][]
+* [ ] Post in the [nodejs-social channel][]
+  in the OpenJS slack asking for amplication of the blog post.
   ```text
   Security release:
 
@@ -238,5 +241,5 @@ The steps to correct CVE information are:
 [H1 CVE requests]: https://hackerone.com/nodejs/cve_requests
 [docker-node]: https://github.com/nodejs/docker-node/issues
 [email]: https://groups.google.com/forum/#!forum/nodejs-sec
+[nodejs-social channel]: https://openjs-foundation.slack.com/archives/C0142A39BNE
 [nodejs/build]: https://github.com/nodejs/build/issues
-[nodejs/tweet]: https://github.com/nodejs/tweet/issues
diff --git a/doc/contributing/strategic-initiatives.md b/doc/contributing/strategic-initiatives.md
index 12cff6df143330..ca4308daa3ebb8 100644
--- a/doc/contributing/strategic-initiatives.md
+++ b/doc/contributing/strategic-initiatives.md
@@ -6,16 +6,17 @@ agenda to ensure they are active and have the support they need.
 
 ## Current initiatives
 
-| Initiative             | Champion                    | Links                                         |
-| ---------------------- | --------------------------- | --------------------------------------------- |
-| Core Promise APIs      | [Antoine du Hamel][aduh95]  | <https://github.com/nodejs/TSC/issues/1094>   |
-| QUIC / HTTP3           | [James M Snell][jasnell]    | <https://github.com/nodejs/quic>              |
-| Shadow Realm           | [Chengzhong Wu][legendecas] | <https://github.com/nodejs/node/issues/42528> |
-| Startup Snapshot       | [Joyee Cheung][joyeecheung] | <https://github.com/nodejs/node/issues/35711> |
-| V8 Currency            | [Michaël Zasso][targos]     |                                               |
-| Next-10                | [Michael Dawson][mhdawson]  | <https://github.com/nodejs/next-10>           |
-| Single executable apps | [Darshan Sen][RaisinTen]    | <https://github.com/nodejs/node/issues/43432> |
-| Performance            |                             | <https://github.com/nodejs/performance>       |
+| Initiative             | Champion                         | Links                                             |
+| ---------------------- | -------------------------------- | ------------------------------------------------- |
+| Core Promise APIs      | [Antoine du Hamel][aduh95]       | <https://github.com/nodejs/TSC/issues/1094>       |
+| QUIC / HTTP3           | [James M Snell][jasnell]         | <https://github.com/nodejs/quic>                  |
+| Shadow Realm           | [Chengzhong Wu][legendecas]      | <https://github.com/nodejs/node/issues/42528>     |
+| Startup Snapshot       | [Joyee Cheung][joyeecheung]      | <https://github.com/nodejs/node/issues/35711>     |
+| V8 Currency            | [Michaël Zasso][targos]          |                                                   |
+| Next-10                | [Michael Dawson][mhdawson]       | <https://github.com/nodejs/next-10>               |
+| Single executable apps | [Darshan Sen][RaisinTen]         | <https://github.com/nodejs/node/issues/43432>     |
+| Performance            |                                  | <https://github.com/nodejs/performance>           |
+| Primordials            | [Benjamin Gruenbaum][benjamingr] | <https://github.com/nodejs/primordials-use-cases> |
 
 <details>
 <summary>List of completed initiatives</summary>
@@ -40,6 +41,7 @@ agenda to ensure they are active and have the support they need.
 
 [RaisinTen]: https://github.com/RaisinTen
 [aduh95]: https://github.com/aduh95
+[benjamingr]: https://github.com/benjamingr
 [jasnell]: https://github.com/jasnell
 [joyeecheung]: https://github.com/joyeecheung
 [legendecas]: https://github.com/legendecas
diff --git a/doc/node.1 b/doc/node.1
index d7095e90fdf4d6..48ac6dc82130c2 100644
--- a/doc/node.1
+++ b/doc/node.1
@@ -152,6 +152,11 @@ Requires Node.js to be built with
 .It Fl -enable-source-maps
 Enable Source Map V3 support for stack traces.
 .
+.It Fl -experimental-default-type Ns = Ns Ar type
+Interpret as either ES modules or CommonJS modules input via --eval or STDIN, when --input-type is unspecified;
+.js or extensionless files with no sibling or parent package.json;
+.js or extensionless files whose nearest parent package.json lacks a "type" field, unless under node_modules.
+.
 .It Fl -experimental-global-webcrypto
 Expose the Web Crypto API on the global scope.
 .
@@ -178,6 +183,9 @@ Use this flag to enable ShadowRealm support.
 .It Fl -experimental-test-coverage
 Enable code coverage in the test runner.
 .
+.It Fl -experimental-websocket
+Enable experimental support for the WebSocket API.
+.
 .It Fl -no-experimental-fetch
 Disable experimental support for the Fetch API.
 .
@@ -410,6 +418,10 @@ Specify the minimum allocation from the OpenSSL secure heap. The default is 2. T
 .It Fl -test
 Starts the Node.js command line test runner.
 .
+.It Fl -test-concurrency
+The maximum number of test files that the test runner CLI will execute
+concurrently.
+.
 .It Fl -test-name-pattern
 A regular expression that configures the test runner to only execute tests
 whose name matches the provided pattern.
diff --git a/doc/template.html b/doc/template.html
index a186e4fbded383..fb334852aba434 100644
--- a/doc/template.html
+++ b/doc/template.html
@@ -14,7 +14,7 @@
 </head>
 <body class="alt apidoc" id="api-section-__FILENAME__">
   <div id="content" class="clearfix">
-    <div id="column2" class="interior">
+    <div role="navigation" id="column2" class="interior">
       <div id="intro" class="interior">
         <a href="/" title="Go back to the home page">
           Node.js
@@ -70,7 +70,7 @@ <h1>Node.js __VERSION__ documentation</h1>
 
       __TOC__
 
-      <div id="apicontent">
+      <div role="main" id="apicontent">
         __CONTENT__
         <!-- API END -->
       </div>
diff --git a/lib/.eslintrc.yaml b/lib/.eslintrc.yaml
index 0d9443ed413912..5b7fa7d3882d7d 100644
--- a/lib/.eslintrc.yaml
+++ b/lib/.eslintrc.yaml
@@ -33,10 +33,6 @@ rules:
       message: Use `const { AbortController } = require('internal/abort_controller');` instead of the global.
     - name: AbortSignal
       message: Use `const { AbortSignal } = require('internal/abort_controller');` instead of the global.
-      # Atomics is not available in primordials because it can be
-      # disabled with --no-harmony-atomics CLI flag.
-    - name: Atomics
-      message: Use `const { Atomics } = globalThis;` instead of the global.
     - name: Blob
       message: Use `const { Blob } = require('buffer');` instead of the global.
     - name: BroadcastChannel
@@ -193,6 +189,7 @@ rules:
     - name: AggregateError
     - name: Array
     - name: ArrayBuffer
+    - name: Atomics
     - name: BigInt
     - name: BigInt64Array
     - name: BigUint64Array
diff --git a/lib/_http_agent.js b/lib/_http_agent.js
index b1508f23c6e6b7..e23409f2ee797f 100644
--- a/lib/_http_agent.js
+++ b/lib/_http_agent.js
@@ -253,8 +253,7 @@ Agent.prototype.addRequest = function addRequest(req, options, port/* legacy */,
   if (options.socketPath)
     options.path = options.socketPath;
 
-  if (!options.servername && options.servername !== '')
-    options.servername = calculateServerName(options, req);
+  normalizeServerName(options, req);
 
   const name = this.getName(options);
   if (!this.sockets[name]) {
@@ -313,8 +312,7 @@ Agent.prototype.createSocket = function createSocket(req, options, cb) {
   if (options.socketPath)
     options.path = options.socketPath;
 
-  if (!options.servername && options.servername !== '')
-    options.servername = calculateServerName(options, req);
+  normalizeServerName(options, req);
 
   const name = this.getName(options);
   options._agentKey = name;
@@ -344,6 +342,11 @@ Agent.prototype.createSocket = function createSocket(req, options, cb) {
     oncreate(null, newSocket);
 };
 
+function normalizeServerName(options, req) {
+  if (!options.servername && options.servername !== '')
+    options.servername = calculateServerName(options, req);
+}
+
 function calculateServerName(options, req) {
   let servername = options.host;
   const hostHeader = req.getHeader('host');
diff --git a/lib/_http_outgoing.js b/lib/_http_outgoing.js
index 178a3418dace0a..64e0d4ab714d79 100644
--- a/lib/_http_outgoing.js
+++ b/lib/_http_outgoing.js
@@ -82,6 +82,9 @@ let debug = require('internal/util/debuglog').debuglog('http', (fn) => {
 });
 
 const kCorked = Symbol('corked');
+const kSocket = Symbol('kSocket');
+const kChunkedBuffer = Symbol('kChunkedBuffer');
+const kChunkedLength = Symbol('kChunkedLength');
 const kUniqueHeaders = Symbol('kUniqueHeaders');
 const kBytesWritten = Symbol('kBytesWritten');
 const kErrored = Symbol('errored');
@@ -140,9 +143,11 @@ function OutgoingMessage(options) {
   this.finished = false;
   this._headerSent = false;
   this[kCorked] = 0;
+  this[kChunkedBuffer] = [];
+  this[kChunkedLength] = 0;
   this._closed = false;
 
-  this.socket = null;
+  this[kSocket] = null;
   this._header = null;
   this[kOutHeaders] = null;
 
@@ -177,7 +182,7 @@ ObjectDefineProperty(OutgoingMessage.prototype, 'writableFinished', {
     return (
       this.finished &&
       this.outputSize === 0 &&
-      (!this.socket || this.socket.writableLength === 0)
+      (!this[kSocket] || this[kSocket].writableLength === 0)
     );
   },
 });
@@ -192,22 +197,21 @@ ObjectDefineProperty(OutgoingMessage.prototype, 'writableObjectMode', {
 ObjectDefineProperty(OutgoingMessage.prototype, 'writableLength', {
   __proto__: null,
   get() {
-    return this.outputSize + (this.socket ? this.socket.writableLength : 0);
+    return this.outputSize + this[kChunkedLength] + (this[kSocket] ? this[kSocket].writableLength : 0);
   },
 });
 
 ObjectDefineProperty(OutgoingMessage.prototype, 'writableHighWaterMark', {
   __proto__: null,
   get() {
-    return this.socket ? this.socket.writableHighWaterMark : this[kHighWaterMark];
+    return this[kSocket] ? this[kSocket].writableHighWaterMark : this[kHighWaterMark];
   },
 });
 
 ObjectDefineProperty(OutgoingMessage.prototype, 'writableCorked', {
   __proto__: null,
   get() {
-    const corked = this.socket ? this.socket.writableCorked : 0;
-    return corked + this[kCorked];
+    return this[kCorked];
   },
 });
 
@@ -235,13 +239,27 @@ ObjectDefineProperty(OutgoingMessage.prototype, '_headers', {
 ObjectDefineProperty(OutgoingMessage.prototype, 'connection', {
   __proto__: null,
   get: function() {
-    return this.socket;
+    return this[kSocket];
   },
   set: function(val) {
     this.socket = val;
   },
 });
 
+ObjectDefineProperty(OutgoingMessage.prototype, 'socket', {
+  __proto__: null,
+  get: function() {
+    return this[kSocket];
+  },
+  set: function(val) {
+    for (let n = 0; n < this[kCorked]; n++) {
+      val?.cork();
+      this[kSocket]?.uncork();
+    }
+    this[kSocket] = val;
+  },
+});
+
 ObjectDefineProperty(OutgoingMessage.prototype, '_headerNames', {
   __proto__: null,
   get: internalUtil.deprecate(function() {
@@ -299,19 +317,45 @@ OutgoingMessage.prototype._renderHeaders = function _renderHeaders() {
 };
 
 OutgoingMessage.prototype.cork = function() {
-  if (this.socket) {
-    this.socket.cork();
-  } else {
-    this[kCorked]++;
+  this[kCorked]++;
+  if (this[kSocket]) {
+    this[kSocket].cork();
   }
 };
 
 OutgoingMessage.prototype.uncork = function() {
-  if (this.socket) {
-    this.socket.uncork();
-  } else if (this[kCorked]) {
-    this[kCorked]--;
+  this[kCorked]--;
+  if (this[kSocket]) {
+    this[kSocket].uncork();
+  }
+
+  if (this[kCorked] || this[kChunkedBuffer].length === 0) {
+    return;
   }
+
+  const len = this[kChunkedLength];
+  const buf = this[kChunkedBuffer];
+
+  assert(this.chunkedEncoding);
+
+  let callbacks;
+  this._send(NumberPrototypeToString(len, 16), 'latin1', null);
+  this._send(crlf_buf, null, null);
+  for (let n = 0; n < buf.length; n += 3) {
+    this._send(buf[n + 0], buf[n + 1], null);
+    if (buf[n + 2]) {
+      callbacks ??= [];
+      callbacks.push(buf[n + 2]);
+    }
+  }
+  this._send(crlf_buf, null, callbacks.length ? (err) => {
+    for (const callback of callbacks) {
+      callback(err);
+    }
+  } : null);
+
+  this[kChunkedBuffer].length = 0;
+  this[kChunkedLength] = 0;
 };
 
 OutgoingMessage.prototype.setTimeout = function setTimeout(msecs, callback) {
@@ -320,12 +364,12 @@ OutgoingMessage.prototype.setTimeout = function setTimeout(msecs, callback) {
     this.on('timeout', callback);
   }
 
-  if (!this.socket) {
+  if (!this[kSocket]) {
     this.once('socket', function socketSetTimeoutOnConnect(socket) {
       socket.setTimeout(msecs);
     });
   } else {
-    this.socket.setTimeout(msecs);
+    this[kSocket].setTimeout(msecs);
   }
   return this;
 };
@@ -342,8 +386,8 @@ OutgoingMessage.prototype.destroy = function destroy(error) {
 
   this[kErrored] = error;
 
-  if (this.socket) {
-    this.socket.destroy(error);
+  if (this[kSocket]) {
+    this[kSocket].destroy(error);
   } else {
     this.once('socket', function socketDestroyOnConnect(socket) {
       socket.destroy(error);
@@ -382,7 +426,7 @@ OutgoingMessage.prototype._send = function _send(data, encoding, callback, byteL
 
 OutgoingMessage.prototype._writeRaw = _writeRaw;
 function _writeRaw(data, encoding, callback, size) {
-  const conn = this.socket;
+  const conn = this[kSocket];
   if (conn && conn.destroyed) {
     // The socket was destroyed. If we're still trying to write to it,
     // then we haven't gotten the 'close' event yet.
@@ -938,10 +982,16 @@ function write_(msg, chunk, encoding, callback, fromEnd) {
   let ret;
   if (msg.chunkedEncoding && chunk.length !== 0) {
     len ??= typeof chunk === 'string' ? Buffer.byteLength(chunk, encoding) : chunk.byteLength;
-    msg._send(NumberPrototypeToString(len, 16), 'latin1', null);
-    msg._send(crlf_buf, null, null);
-    msg._send(chunk, encoding, null, len);
-    ret = msg._send(crlf_buf, null, callback);
+    if (msg[kCorked] && msg._headerSent) {
+      msg[kChunkedBuffer].push(chunk, encoding, callback);
+      msg[kChunkedLength] += len;
+      ret = msg[kChunkedLength] < msg[kHighWaterMark];
+    } else {
+      msg._send(NumberPrototypeToString(len, 16), 'latin1', null);
+      msg._send(crlf_buf, null, null);
+      msg._send(chunk, encoding, null, len);
+      ret = msg._send(crlf_buf, null, callback);
+    }
   } else {
     ret = msg._send(chunk, encoding, callback, len);
   }
@@ -1023,8 +1073,8 @@ OutgoingMessage.prototype.end = function end(chunk, encoding, callback) {
       return this;
     }
 
-    if (this.socket) {
-      this.socket.cork();
+    if (this[kSocket]) {
+      this[kSocket].cork();
     }
 
     write_(this, chunk, encoding, null, true);
@@ -1038,8 +1088,8 @@ OutgoingMessage.prototype.end = function end(chunk, encoding, callback) {
     }
     return this;
   } else if (!this._header) {
-    if (this.socket) {
-      this.socket.cork();
+    if (this[kSocket]) {
+      this[kSocket].cork();
     }
 
     this._contentLength = 0;
@@ -1063,12 +1113,13 @@ OutgoingMessage.prototype.end = function end(chunk, encoding, callback) {
     process.nextTick(finish);
   }
 
-  if (this.socket) {
+  if (this[kSocket]) {
     // Fully uncork connection on end().
-    this.socket._writableState.corked = 1;
-    this.socket.uncork();
+    this[kSocket]._writableState.corked = 1;
+    this[kSocket].uncork();
   }
-  this[kCorked] = 0;
+  this[kCorked] = 1;
+  this.uncork();
 
   this.finished = true;
 
@@ -1076,8 +1127,8 @@ OutgoingMessage.prototype.end = function end(chunk, encoding, callback) {
   // everything to the socket.
   debug('outgoing message end.');
   if (this.outputData.length === 0 &&
-      this.socket &&
-      this.socket._httpMessage === this) {
+      this[kSocket] &&
+      this[kSocket]._httpMessage === this) {
     this._finish();
   }
 
@@ -1088,7 +1139,7 @@ OutgoingMessage.prototype.end = function end(chunk, encoding, callback) {
 // This function is called once all user data are flushed to the socket.
 // Note that it has a chance that the socket is not drained.
 OutgoingMessage.prototype._finish = function _finish() {
-  assert(this.socket);
+  assert(this[kSocket]);
   this.emit('prefinish');
 };
 
@@ -1113,7 +1164,7 @@ OutgoingMessage.prototype._finish = function _finish() {
 // This function, _flush(), is called by both the Server and Client
 // to attempt to flush any pending messages out to the socket.
 OutgoingMessage.prototype._flush = function _flush() {
-  const socket = this.socket;
+  const socket = this[kSocket];
 
   if (socket && socket.writable) {
     // There might be remaining data in this.output; write it out
@@ -1130,11 +1181,6 @@ OutgoingMessage.prototype._flush = function _flush() {
 };
 
 OutgoingMessage.prototype._flushOutput = function _flushOutput(socket) {
-  while (this[kCorked]) {
-    this[kCorked]--;
-    socket.cork();
-  }
-
   const outputLength = this.outputData.length;
   if (outputLength <= 0)
     return undefined;
diff --git a/lib/_tls_wrap.js b/lib/_tls_wrap.js
index c2dd958f95106e..48108710933382 100644
--- a/lib/_tls_wrap.js
+++ b/lib/_tls_wrap.js
@@ -657,10 +657,20 @@ tls_wrap.TLSWrap.prototype.close = function close(cb) {
       cb();
   };
 
-  if (this._parentWrap && this._parentWrap._handle === this._parent) {
-    this._parentWrap.once('close', done);
-    return this._parentWrap.destroy();
+  if (this._parentWrap) {
+    if (this._parentWrap._handle === null) {
+      // The socket handle was already closed.
+      done();
+      return;
+    }
+
+    if (this._parentWrap._handle === this._parent) {
+      this._parentWrap.once('close', done);
+      this._parentWrap.destroy();
+      return;
+    }
   }
+
   return this._parent.close(done);
 };
 
@@ -1738,12 +1748,8 @@ exports.connect = function connect(...args) {
   if (!options.keepAlive)
     options.singleUse = true;
 
-  assert(typeof options.checkServerIdentity === 'function');
-  assert(typeof options.minDHSize === 'number',
-         'options.minDHSize is not a number: ' + options.minDHSize);
-  assert(options.minDHSize > 0,
-         'options.minDHSize is not a positive number: ' +
-         options.minDHSize);
+  validateFunction(options.checkServerIdentity, 'options.checkServerIdentity');
+  validateNumber(options.minDHSize, 'options.minDHSize', 1);
 
   const context = options.secureContext || tls.createSecureContext(options);
 
diff --git a/lib/events.js b/lib/events.js
index f42a11ab3e701d..a1837cc1a9107e 100644
--- a/lib/events.js
+++ b/lib/events.js
@@ -81,6 +81,7 @@ const {
   validateBoolean,
   validateFunction,
   validateNumber,
+  validateObject,
   validateString,
 } = require('internal/validators');
 
@@ -960,6 +961,7 @@ function getMaxListeners(emitterOrTarget) {
  * @returns {Promise}
  */
 async function once(emitter, name, options = kEmptyObject) {
+  validateObject(options, 'options');
   const signal = options?.signal;
   validateAbortSignal(signal, 'options.signal');
   if (signal?.aborted)
@@ -1047,6 +1049,7 @@ function eventTargetAgnosticAddListener(emitter, name, listener, flags) {
  */
 function on(emitter, event, options = kEmptyObject) {
   // Parameters validation
+  validateObject(options, 'options');
   const signal = options.signal;
   validateAbortSignal(signal, 'options.signal');
   if (signal?.aborted)
diff --git a/lib/fs.js b/lib/fs.js
index b17cf4f10cd3c1..2d5170cd2f44b0 100644
--- a/lib/fs.js
+++ b/lib/fs.js
@@ -131,7 +131,7 @@ const {
   CHAR_BACKWARD_SLASH,
 } = require('internal/constants');
 const {
-  isUint32,
+  isInt32,
   parseFileMode,
   validateBoolean,
   validateBuffer,
@@ -140,8 +140,8 @@ const {
   validateInteger,
   validateObject,
   validateString,
+  kValidateObjectAllowNullable,
 } = require('internal/validators');
-const { readFileSyncUtf8 } = require('internal/fs/read/utf8');
 
 let truncateWarn = true;
 let fs;
@@ -201,7 +201,7 @@ function makeStatsCallback(cb) {
   };
 }
 
-const isFd = isUint32;
+const isFd = isInt32;
 
 function isFileType(stats, fileType) {
   // Use stats array directly to avoid creating an fs.Stats instance just for
@@ -246,9 +246,7 @@ function accessSync(path, mode) {
   path = getValidatedPath(path);
   mode = getValidMode(mode, 'access');
 
-  const ctx = { path };
-  binding.access(pathModule.toNamespacedPath(path), mode, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  binding.access(pathModule.toNamespacedPath(path), mode);
 }
 
 /**
@@ -295,18 +293,8 @@ function existsSync(path) {
   } catch {
     return false;
   }
-  const ctx = { path };
-  const nPath = pathModule.toNamespacedPath(path);
-  binding.access(nPath, F_OK, undefined, ctx);
-
-  // In case of an invalid symlink, `binding.access()` on win32
-  // will **not** return an error and is therefore not enough.
-  // Double check with `binding.stat()`.
-  if (isWindows && ctx.errno === undefined) {
-    binding.stat(nPath, false, undefined, ctx);
-  }
 
-  return ctx.errno === undefined;
+  return binding.existsSync(pathModule.toNamespacedPath(path));
 }
 
 function readFileAfterOpen(err, fd) {
@@ -458,14 +446,14 @@ function tryReadSync(fd, isUserFd, buffer, pos, len) {
 function readFileSync(path, options) {
   options = getOptions(options, { flag: 'r' });
 
-  const isUserFd = isFd(path); // File descriptor ownership
-
-  // TODO(@anonrig): Do not handle file descriptor ownership for now.
-  if (!isUserFd && (options.encoding === 'utf8' || options.encoding === 'utf-8')) {
-    path = getValidatedPath(path);
-    return readFileSyncUtf8(pathModule.toNamespacedPath(path), stringToFlags(options.flag));
+  if (options.encoding === 'utf8' || options.encoding === 'utf-8') {
+    if (!isInt32(path)) {
+      path = pathModule.toNamespacedPath(getValidatedPath(path));
+    }
+    return binding.readFileUtf8(path, stringToFlags(options.flag));
   }
 
+  const isUserFd = isFd(path); // File descriptor ownership
   const fd = isUserFd ? path : fs.openSync(path, options.flag, 0o666);
 
   const stats = tryStatSync(fd, isUserFd);
@@ -542,9 +530,7 @@ function close(fd, callback = defaultCloseCallback) {
 function closeSync(fd) {
   fd = getValidatedFd(fd);
 
-  const ctx = {};
-  binding.close(fd, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  return binding.close(fd);
 }
 
 /**
@@ -591,15 +577,12 @@ function open(path, flags, mode, callback) {
  */
 function openSync(path, flags, mode) {
   path = getValidatedPath(path);
-  const flagsNumber = stringToFlags(flags);
-  mode = parseFileMode(mode, 'mode', 0o666);
 
-  const ctx = { path };
-  const result = binding.open(pathModule.toNamespacedPath(path),
-                              flagsNumber, mode,
-                              undefined, ctx);
-  handleErrorFromBinding(ctx);
-  return result;
+  return binding.open(
+    pathModule.toNamespacedPath(path),
+    stringToFlags(flags),
+    parseFileMode(mode, 'mode', 0o666),
+  );
 }
 
 /**
@@ -642,7 +625,7 @@ function read(fd, buffer, offsetOrOptions, length, position, callback) {
   if (arguments.length <= 4) {
     if (arguments.length === 4) {
       // This is fs.read(fd, buffer, options, callback)
-      validateObject(offsetOrOptions, 'options', { nullable: true });
+      validateObject(offsetOrOptions, 'options', kValidateObjectAllowNullable);
       callback = length;
       params = offsetOrOptions;
     } else if (arguments.length === 3) {
@@ -660,7 +643,7 @@ function read(fd, buffer, offsetOrOptions, length, position, callback) {
     }
 
     if (params !== undefined) {
-      validateObject(params, 'options', { nullable: true });
+      validateObject(params, 'options', kValidateObjectAllowNullable);
     }
     ({
       offset = 0,
@@ -693,10 +676,11 @@ function read(fd, buffer, offsetOrOptions, length, position, callback) {
 
   validateOffsetLengthRead(offset, length, buffer.byteLength);
 
-  if (position == null)
+  if (position == null) {
     position = -1;
-
-  validatePosition(position, 'position');
+  } else {
+    validatePosition(position, 'position', length);
+  }
 
   function wrapper(err, bytesRead) {
     // Retain a reference to buffer so that it can't be GC'ed too soon.
@@ -732,7 +716,7 @@ function readSync(fd, buffer, offsetOrOptions, length, position) {
   let offset = offsetOrOptions;
   if (arguments.length <= 3 || typeof offsetOrOptions === 'object') {
     if (offsetOrOptions !== undefined) {
-      validateObject(offsetOrOptions, 'options', { nullable: true });
+      validateObject(offsetOrOptions, 'options', kValidateObjectAllowNullable);
     }
 
     ({
@@ -761,10 +745,11 @@ function readSync(fd, buffer, offsetOrOptions, length, position) {
 
   validateOffsetLengthRead(offset, length, buffer.byteLength);
 
-  if (position == null)
+  if (position == null) {
     position = -1;
-
-  validatePosition(position, 'position');
+  } else {
+    validatePosition(position, 'position', length);
+  }
 
   const ctx = {};
   const result = binding.read(fd, buffer, offset, length, position,
@@ -1013,15 +998,10 @@ function writevSync(fd, buffers, position) {
     return 0;
   }
 
-  const ctx = {};
-
   if (typeof position !== 'number')
     position = null;
 
-  const result = binding.writeBuffers(fd, buffers, position, undefined, ctx);
-
-  handleErrorFromBinding(ctx);
-  return result;
+  return binding.writeBuffers(fd, buffers, position);
 }
 
 /**
@@ -1153,9 +1133,7 @@ function ftruncateSync(fd, len = 0) {
   fd = getValidatedFd(fd);
   validateInteger(len, 'len');
   len = MathMax(0, len);
-  const ctx = {};
-  binding.ftruncate(fd, len, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  binding.ftruncate(fd, len);
 }
 
 function lazyLoadCp() {
@@ -1320,9 +1298,7 @@ function fdatasync(fd, callback) {
  */
 function fdatasyncSync(fd) {
   fd = getValidatedFd(fd);
-  const ctx = {};
-  binding.fdatasync(fd, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  return binding.fdatasync(fd);
 }
 
 /**
@@ -1434,17 +1410,16 @@ function readdirSyncRecursive(basePath, options) {
   const readdirResults = [];
   const pathsQueue = [basePath];
 
-  const ctx = { path: basePath };
   function read(path) {
-    ctx.path = path;
     const readdirResult = binding.readdir(
       pathModule.toNamespacedPath(path),
       encoding,
       withFileTypes,
-      undefined,
-      ctx,
     );
-    handleErrorFromBinding(ctx);
+
+    if (readdirResult === undefined) {
+      return;
+    }
 
     if (withFileTypes) {
       // Calling `readdir` with `withFileTypes=true`, the result is an array of arrays.
@@ -1543,12 +1518,13 @@ function readdirSync(path, options) {
     return readdirSyncRecursive(path, options);
   }
 
-  const ctx = { path };
-  const result = binding.readdir(pathModule.toNamespacedPath(path),
-                                 options.encoding, !!options.withFileTypes,
-                                 undefined, ctx);
-  handleErrorFromBinding(ctx);
-  return options.withFileTypes ? getDirents(path, result) : result;
+  const result = binding.readdir(
+    pathModule.toNamespacedPath(path),
+    options.encoding,
+    !!options.withFileTypes,
+  );
+
+  return result !== undefined && options.withFileTypes ? getDirents(path, result) : result;
 }
 
 /**
@@ -1704,22 +1680,21 @@ function lstatSync(path, options = { bigint: false, throwIfNoEntry: true }) {
  */
 function statSync(path, options = { bigint: false, throwIfNoEntry: true }) {
   path = getValidatedPath(path);
-  const ctx = { path };
-  const stats = binding.stat(pathModule.toNamespacedPath(path),
-                             options.bigint, undefined, ctx);
-  if (options.throwIfNoEntry === false && hasNoEntryError(ctx)) {
+  const stats = binding.stat(
+    pathModule.toNamespacedPath(path),
+    options.bigint,
+    undefined,
+    options.throwIfNoEntry,
+  );
+  if (stats === undefined) {
     return undefined;
   }
-  handleErrorFromBinding(ctx);
   return getStatsFromBinding(stats);
 }
 
 function statfsSync(path, options = { bigint: false }) {
   path = getValidatedPath(path);
-  const ctx = { path };
-  const stats = binding.statfs(pathModule.toNamespacedPath(path),
-                               options.bigint, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  const stats = binding.statfs(pathModule.toNamespacedPath(path), options.bigint);
   return getStatFsFromBinding(stats);
 }
 
@@ -1900,10 +1875,8 @@ function unlink(path, callback) {
  * @returns {void}
  */
 function unlinkSync(path) {
-  path = getValidatedPath(path);
-  const ctx = { path };
-  binding.unlink(pathModule.toNamespacedPath(path), undefined, ctx);
-  handleErrorFromBinding(ctx);
+  path = pathModule.toNamespacedPath(getValidatedPath(path));
+  return binding.unlink(path);
 }
 
 /**
@@ -1930,11 +1903,10 @@ function fchmod(fd, mode, callback) {
  * @returns {void}
  */
 function fchmodSync(fd, mode) {
-  fd = getValidatedFd(fd);
-  mode = parseFileMode(mode, 'mode');
-  const ctx = {};
-  binding.fchmod(fd, mode, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  binding.fchmod(
+    getValidatedFd(fd),
+    parseFileMode(mode, 'mode'),
+  );
 }
 
 /**
@@ -2009,9 +1981,10 @@ function chmodSync(path, mode) {
   path = getValidatedPath(path);
   mode = parseFileMode(mode, 'mode');
 
-  const ctx = { path };
-  binding.chmod(pathModule.toNamespacedPath(path), mode, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  binding.chmod(
+    pathModule.toNamespacedPath(path),
+    mode,
+  );
 }
 
 /**
@@ -2152,11 +2125,11 @@ function utimes(path, atime, mtime, callback) {
  */
 function utimesSync(path, atime, mtime) {
   path = getValidatedPath(path);
-  const ctx = { path };
-  binding.utimes(pathModule.toNamespacedPath(path),
-                 toUnixTimestamp(atime), toUnixTimestamp(mtime),
-                 undefined, ctx);
-  handleErrorFromBinding(ctx);
+  binding.utimes(
+    pathModule.toNamespacedPath(path),
+    toUnixTimestamp(atime),
+    toUnixTimestamp(mtime),
+  );
 }
 
 /**
@@ -2189,12 +2162,11 @@ function futimes(fd, atime, mtime, callback) {
  * @returns {void}
  */
 function futimesSync(fd, atime, mtime) {
-  fd = getValidatedFd(fd);
-  atime = toUnixTimestamp(atime, 'atime');
-  mtime = toUnixTimestamp(mtime, 'mtime');
-  const ctx = {};
-  binding.futimes(fd, atime, mtime, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  binding.futimes(
+    getValidatedFd(fd),
+    toUnixTimestamp(atime, 'atime'),
+    toUnixTimestamp(mtime, 'mtime'),
+  );
 }
 
 /**
@@ -2228,15 +2200,14 @@ function lutimes(path, atime, mtime, callback) {
  */
 function lutimesSync(path, atime, mtime) {
   path = getValidatedPath(path);
-  const ctx = { path };
-  binding.lutimes(pathModule.toNamespacedPath(path),
-                  toUnixTimestamp(atime),
-                  toUnixTimestamp(mtime),
-                  undefined, ctx);
-  handleErrorFromBinding(ctx);
+  binding.lutimes(
+    pathModule.toNamespacedPath(path),
+    toUnixTimestamp(atime),
+    toUnixTimestamp(mtime),
+  );
 }
 
-function writeAll(fd, isUserFd, buffer, offset, length, signal, callback) {
+function writeAll(fd, isUserFd, buffer, offset, length, signal, flush, callback) {
   if (signal?.aborted) {
     const abortError = new AbortError(undefined, { cause: signal?.reason });
     if (isUserFd) {
@@ -2259,15 +2230,33 @@ function writeAll(fd, isUserFd, buffer, offset, length, signal, callback) {
         });
       }
     } else if (written === length) {
-      if (isUserFd) {
-        callback(null);
+      if (!flush) {
+        if (isUserFd) {
+          callback(null);
+        } else {
+          fs.close(fd, callback);
+        }
       } else {
-        fs.close(fd, callback);
+        fs.fsync(fd, (syncErr) => {
+          if (syncErr) {
+            if (isUserFd) {
+              callback(syncErr);
+            } else {
+              fs.close(fd, (err) => {
+                callback(aggregateTwoErrors(err, syncErr));
+              });
+            }
+          } else if (isUserFd) {
+            callback(null);
+          } else {
+            fs.close(fd, callback);
+          }
+        });
       }
     } else {
       offset += written;
       length -= written;
-      writeAll(fd, isUserFd, buffer, offset, length, signal, callback);
+      writeAll(fd, isUserFd, buffer, offset, length, signal, flush, callback);
     }
   });
 }
@@ -2281,14 +2270,23 @@ function writeAll(fd, isUserFd, buffer, offset, length, signal, callback) {
  *   mode?: number;
  *   flag?: string;
  *   signal?: AbortSignal;
+ *   flush?: boolean;
  *   } | string} [options]
  * @param {(err?: Error) => any} callback
  * @returns {void}
  */
 function writeFile(path, data, options, callback) {
   callback = maybeCallback(callback || options);
-  options = getOptions(options, { encoding: 'utf8', mode: 0o666, flag: 'w' });
+  options = getOptions(options, {
+    encoding: 'utf8',
+    mode: 0o666,
+    flag: 'w',
+    flush: false,
+  });
   const flag = options.flag || 'w';
+  const flush = options.flush ?? false;
+
+  validateBoolean(flush, 'options.flush');
 
   if (!isArrayBufferView(data)) {
     validateStringAfterArrayBufferView(data, 'data');
@@ -2298,7 +2296,7 @@ function writeFile(path, data, options, callback) {
   if (isFd(path)) {
     const isUserFd = true;
     const signal = options.signal;
-    writeAll(path, isUserFd, data, 0, data.byteLength, signal, callback);
+    writeAll(path, isUserFd, data, 0, data.byteLength, signal, flush, callback);
     return;
   }
 
@@ -2311,7 +2309,7 @@ function writeFile(path, data, options, callback) {
     } else {
       const isUserFd = false;
       const signal = options.signal;
-      writeAll(fd, isUserFd, data, 0, data.byteLength, signal, callback);
+      writeAll(fd, isUserFd, data, 0, data.byteLength, signal, flush, callback);
     }
   });
 }
@@ -2324,11 +2322,21 @@ function writeFile(path, data, options, callback) {
  *   encoding?: string | null;
  *   mode?: number;
  *   flag?: string;
+ *   flush?: boolean;
  *   } | string} [options]
  * @returns {void}
  */
 function writeFileSync(path, data, options) {
-  options = getOptions(options, { encoding: 'utf8', mode: 0o666, flag: 'w' });
+  options = getOptions(options, {
+    encoding: 'utf8',
+    mode: 0o666,
+    flag: 'w',
+    flush: false,
+  });
+
+  const flush = options.flush ?? false;
+
+  validateBoolean(flush, 'options.flush');
 
   if (!isArrayBufferView(data)) {
     validateStringAfterArrayBufferView(data, 'data');
@@ -2348,6 +2356,10 @@ function writeFileSync(path, data, options) {
       offset += written;
       length -= written;
     }
+
+    if (flush) {
+      fs.fsyncSync(fd);
+    }
   } finally {
     if (!isUserFd) fs.closeSync(fd);
   }
@@ -2703,8 +2715,7 @@ function realpathSync(p, options) {
       }
       if (linkTarget === null) {
         const ctx = { path: base };
-        binding.stat(baseLong, false, undefined, ctx);
-        handleErrorFromBinding(ctx);
+        binding.stat(baseLong, false, undefined, true);
         linkTarget = binding.readlink(baseLong, undefined, undefined, ctx);
         handleErrorFromBinding(ctx);
       }
@@ -3002,13 +3013,11 @@ function copyFileSync(src, dest, mode) {
   src = getValidatedPath(src, 'src');
   dest = getValidatedPath(dest, 'dest');
 
-  const ctx = { path: src, dest };  // non-prefixed
-
-  src = pathModule._makeLong(src);
-  dest = pathModule._makeLong(dest);
-  mode = getValidMode(mode, 'copyFile');
-  binding.copyFile(src, dest, mode, undefined, ctx);
-  handleErrorFromBinding(ctx);
+  binding.copyFile(
+    pathModule.toNamespacedPath(src),
+    pathModule.toNamespacedPath(dest),
+    getValidMode(mode, 'copyFile'),
+  );
 }
 
 /**
@@ -3092,6 +3101,7 @@ function createReadStream(path, options) {
  *   emitClose?: boolean;
  *   start: number;
  *   fs?: object | null;
+ *   flush?: boolean;
  *   }} [options]
  * @returns {WriteStream}
  */
diff --git a/lib/http.js b/lib/http.js
index d86d36d12c2b14..9fce02d6e3b3ac 100644
--- a/lib/http.js
+++ b/lib/http.js
@@ -76,6 +76,7 @@ function createServer(opts, requestListener) {
  * @property {string} [host] A domain name or IP address of the server to issue the request to.
  * @property {string} [hostname] Alias for host.
  * @property {boolean} [insecureHTTPParser] Use an insecure HTTP parser that accepts invalid HTTP headers when true.
+ * @property {boolean} [joinDuplicateHeaders] Multiple header that joined with `,` field line values.
  * @property {string} [localAddress] Local interface to bind for network connections.
  * @property {number} [localPort] Local port to connect from.
  * @property {Function} [lookup] Custom lookup function. Default: dns.lookup().
@@ -88,6 +89,7 @@ function createServer(opts, requestListener) {
  * @property {AbortSignal} [signal] An AbortSignal that may be used to abort an ongoing request.
  * @property {string} [socketPath] Unix domain socket.
  * @property {number} [timeout] A number specifying the socket timeout in milliseconds.
+ * @property {Array} [uniqueHeaders] A list of request headers that should be sent only once.
  */
 
 /**
diff --git a/lib/https.js b/lib/https.js
index 70ffa73ff1996b..ca8c49d5bef319 100644
--- a/lib/https.js
+++ b/lib/https.js
@@ -392,6 +392,7 @@ function request(...args) {
  *   host?: string;
  *   hostname?: string;
  *   insecureHTTPParser?: boolean;
+ *   joinDuplicateHeaders?: boolean;
  *   localAddress?: string;
  *   localPort?: number;
  *   lookup?: Function;
@@ -404,6 +405,7 @@ function request(...args) {
  *   socketPath?: string;
  *   timeout?: number;
  *   signal?: AbortSignal;
+ *   uniqueHeaders?: Array;
  *   } | string | URL} [options]
  * @param {Function} [cb]
  * @returns {ClientRequest}
diff --git a/lib/internal/abort_controller.js b/lib/internal/abort_controller.js
index 69e9c31efd14fc..b10fb35a1a6e4f 100644
--- a/lib/internal/abort_controller.js
+++ b/lib/internal/abort_controller.js
@@ -46,6 +46,8 @@ const {
   validateAbortSignalArray,
   validateObject,
   validateUint32,
+  kValidateObjectAllowArray,
+  kValidateObjectAllowFunction,
 } = require('internal/validators');
 
 const {
@@ -436,7 +438,7 @@ async function aborted(signal, resource) {
     throw new ERR_INVALID_ARG_TYPE('signal', 'AbortSignal', signal);
   }
   validateAbortSignal(signal, 'signal');
-  validateObject(resource, 'resource', { nullable: false, allowFunction: true, allowArray: true });
+  validateObject(resource, 'resource', kValidateObjectAllowArray | kValidateObjectAllowFunction);
   if (signal.aborted)
     return PromiseResolve();
   const abortPromise = createDeferredPromise();
diff --git a/lib/internal/blob.js b/lib/internal/blob.js
index c5b417ddc291b6..3ebb1b8a84b50a 100644
--- a/lib/internal/blob.js
+++ b/lib/internal/blob.js
@@ -6,8 +6,8 @@ const {
   MathMin,
   ObjectDefineProperties,
   ObjectDefineProperty,
+  ObjectSetPrototypeOf,
   PromiseReject,
-  ReflectConstruct,
   RegExpPrototypeExec,
   RegExpPrototypeSymbolReplace,
   StringPrototypeToLowerCase,
@@ -24,6 +24,9 @@ const {
   concat,
   getDataObject,
 } = internalBinding('blob');
+const {
+  kMaxLength,
+} = internalBinding('buffer');
 
 const {
   TextDecoder,
@@ -62,7 +65,6 @@ const {
 } = require('internal/errors');
 
 const {
-  isUint32,
   validateDictionary,
 } = require('internal/validators');
 
@@ -160,8 +162,8 @@ class Blob {
       return src;
     });
 
-    if (!isUint32(length))
-      throw new ERR_BUFFER_TOO_LARGE(0xFFFFFFFF);
+    if (length > kMaxLength)
+      throw new ERR_BUFFER_TOO_LARGE(kMaxLength);
 
     this[kHandle] = _createBlob(sources_, length);
     this[kLength] = length;
@@ -197,7 +199,7 @@ class Blob {
     const length = this[kLength];
     return {
       data: { handle, type, length },
-      deserializeInfo: 'internal/blob:ClonedBlob',
+      deserializeInfo: 'internal/blob:Blob',
     };
   }
 
@@ -320,6 +322,7 @@ class Blob {
 
     const reader = this[kHandle].getReader();
     return new lazyReadableStream({
+      type: 'bytes',
       start(c) {
         // There really should only be one read at a time so using an
         // array here is purely defensive.
@@ -339,6 +342,9 @@ class Blob {
             if (status === 0) {
               // EOS
               c.close();
+              // This is to signal the end for byob readers
+              // see https://streams.spec.whatwg.org/#example-rbs-pull
+              c.byobRequest?.respond(0);
               const pending = this.pendingPulls.shift();
               pending.resolve();
               return;
@@ -352,13 +358,15 @@ class Blob {
               pending.reject(error);
               return;
             }
-            if (buffer !== undefined) {
+            // ReadableByteStreamController.enqueue errors if we submit a 0-length
+            // buffer. We need to check for that here.
+            if (buffer !== undefined && buffer.byteLength !== 0) {
               c.enqueue(new Uint8Array(buffer));
             }
             // We keep reading until we either reach EOS, some error, or we
             // hit the flow rate of the stream (c.desiredSize).
             queueMicrotask(() => {
-              if (c.desiredSize <= 0) {
+              if (c.desiredSize < 0) {
                 // A manual backpressure check.
                 if (this.pendingPulls.length !== 0) {
                   // A case of waiting pull finished (= not yet canceled)
@@ -388,20 +396,23 @@ class Blob {
   }
 }
 
-function ClonedBlob() {
-  return ReflectConstruct(function() {
-    markTransferMode(this, true, false);
-  }, [], Blob);
+function TransferableBlob(handle, length, type = '') {
+  markTransferMode(this, true, false);
+  this[kHandle] = handle;
+  this[kType] = type;
+  this[kLength] = length;
 }
-ClonedBlob.prototype[kDeserialize] = () => {};
+
+ObjectSetPrototypeOf(TransferableBlob.prototype, Blob.prototype);
+ObjectSetPrototypeOf(TransferableBlob, Blob);
 
 function createBlob(handle, length, type = '') {
-  return ReflectConstruct(function() {
-    markTransferMode(this, true, false);
-    this[kHandle] = handle;
-    this[kType] = type;
-    this[kLength] = length;
-  }, [], Blob);
+  const transferredBlob = new TransferableBlob(handle, length, type);
+
+  // Fix issues like: https://github.com/nodejs/node/pull/49730#discussion_r1331720053
+  transferredBlob.constructor = Blob;
+
+  return transferredBlob;
 }
 
 ObjectDefineProperty(Blob.prototype, SymbolToStringTag, {
@@ -470,7 +481,6 @@ function createBlobFromFilePath(path, options) {
 
 module.exports = {
   Blob,
-  ClonedBlob,
   createBlob,
   createBlobFromFilePath,
   isBlob,
diff --git a/lib/internal/bootstrap/realm.js b/lib/internal/bootstrap/realm.js
index 608e3072850d45..c6935c6f7775fc 100644
--- a/lib/internal/bootstrap/realm.js
+++ b/lib/internal/bootstrap/realm.js
@@ -174,9 +174,9 @@ const experimentalModuleList = new SafeSet();
   };
 }
 
-// Set up internalBinding() in the closure.
 /**
- * @type {InternalBinding}
+ * Set up internalBinding() in the closure.
+ * @type {import('typings/globals').internalBinding}
  */
 let internalBinding;
 {
@@ -426,7 +426,9 @@ function requireBuiltin(id) {
 // Allow internal modules from dependencies to require
 // other modules from dependencies by providing fallbacks.
 function requireWithFallbackInDeps(request) {
-  if (!BuiltinModule.map.has(request)) {
+  if (StringPrototypeStartsWith(request, 'node:')) {
+    request = StringPrototypeSlice(request, 5);
+  } else if (!BuiltinModule.map.has(request)) {
     request = `internal/deps/${request}`;
   }
   return requireBuiltin(request);
diff --git a/lib/internal/bootstrap/switches/does_own_process_state.js b/lib/internal/bootstrap/switches/does_own_process_state.js
index 85b5c3dfcb09ed..8f457de3e1183e 100644
--- a/lib/internal/bootstrap/switches/does_own_process_state.js
+++ b/lib/internal/bootstrap/switches/does_own_process_state.js
@@ -2,6 +2,12 @@
 
 const credentials = internalBinding('credentials');
 const rawMethods = internalBinding('process_methods');
+const {
+  namespace: {
+    addSerializeCallback,
+    isBuildingSnapshot,
+  },
+} = require('internal/v8/startup_snapshot');
 
 process.abort = rawMethods.abort;
 process.umask = wrappedUmask;
@@ -107,6 +113,12 @@ function wrapPosixCredentialSetters(credentials) {
 // directory is changed by `chdir`, it'll be updated.
 let cachedCwd = '';
 
+if (isBuildingSnapshot()) {
+  addSerializeCallback(() => {
+    cachedCwd = '';
+  });
+}
+
 function wrappedChdir(directory) {
   validateString(directory, 'directory');
   rawMethods.chdir(directory);
diff --git a/lib/internal/crypto/hkdf.js b/lib/internal/crypto/hkdf.js
index 7f0fe5534ee843..cf3c39e8d9da5a 100644
--- a/lib/internal/crypto/hkdf.js
+++ b/lib/internal/crypto/hkdf.js
@@ -57,7 +57,7 @@ const validateParameters = hideStackFrames((hash, key, salt, info, length) => {
   validateInteger(length, 'length', 0, kMaxLength);
 
   if (info.byteLength > 1024) {
-    throw ERR_OUT_OF_RANGE(
+    throw new ERR_OUT_OF_RANGE(
       'info',
       'must not contain more than 1024 bytes',
       info.byteLength);
diff --git a/lib/internal/crypto/webidl.js b/lib/internal/crypto/webidl.js
index 9f5340c223902c..61a4cfe4330703 100644
--- a/lib/internal/crypto/webidl.js
+++ b/lib/internal/crypto/webidl.js
@@ -184,7 +184,10 @@ function isNonSharedArrayBuffer(V) {
 }
 
 function isSharedArrayBuffer(V) {
-  return ObjectPrototypeIsPrototypeOf(SharedArrayBuffer.prototype, V);
+  // SharedArrayBuffers can be disabled with --no-harmony-sharedarraybuffer.
+  if (SharedArrayBuffer !== undefined)
+    return ObjectPrototypeIsPrototypeOf(SharedArrayBuffer.prototype, V);
+  return false;
 }
 
 converters.Uint8Array = (V, opts = kEmptyObject) => {
diff --git a/lib/internal/dns/promises.js b/lib/internal/dns/promises.js
index 79be8591bbcad2..1169b2735d4efe 100644
--- a/lib/internal/dns/promises.js
+++ b/lib/internal/dns/promises.js
@@ -113,6 +113,19 @@ function onlookupall(err, addresses) {
   }
 }
 
+/**
+ * Creates a promise that resolves with the IP address of the given hostname.
+ * @param {0 | 4 | 6} family - The IP address family (4 or 6, or 0 for both).
+ * @param {string} hostname - The hostname to resolve.
+ * @param {boolean} all - Whether to resolve with all IP addresses for the hostname.
+ * @param {number} hints - One or more supported getaddrinfo flags (supply multiple via
+ * bitwise OR).
+ * @param {boolean} verbatim - Whether to use the hostname verbatim.
+ * @returns {Promise<DNSLookupResult | DNSLookupResult[]>} The IP address(es) of the hostname.
+ * @typedef {object} DNSLookupResult
+ * @property {string} address - The IP address.
+ * @property {0 | 4 | 6} family - The IP address type. 4 for IPv4 or 6 for IPv6, or 0 (for both).
+ */
 function createLookupPromise(family, hostname, all, hints, verbatim) {
   return new Promise((resolve, reject) => {
     if (!hostname) {
@@ -154,6 +167,17 @@ function createLookupPromise(family, hostname, all, hints, verbatim) {
 }
 
 const validFamilies = [0, 4, 6];
+/**
+ * Get the IP address for a given hostname.
+ * @param {string} hostname - The hostname to resolve (ex. 'nodejs.org').
+ * @param {object} [options] - Optional settings.
+ * @param {boolean} [options.all=false] - Whether to return all or just the first resolved address.
+ * @param {0 | 4 | 6} [options.family=0] - The record family. Must be 4, 6, or 0 (for both).
+ * @param {number} [options.hints] - One or more supported getaddrinfo flags (supply multiple via
+ * bitwise OR).
+ * @param {boolean} [options.verbatim=false] - Return results in same order DNS resolved them;
+ * otherwise IPv4 then IPv6. New code should supply `true`.
+ */
 function lookup(hostname, options) {
   let hints = 0;
   let family = 0;
diff --git a/lib/internal/encoding.js b/lib/internal/encoding.js
index 996b2506a49d3b..6ed89b3f9b15a4 100644
--- a/lib/internal/encoding.js
+++ b/lib/internal/encoding.js
@@ -47,6 +47,9 @@ const {
 const {
   validateString,
   validateObject,
+  kValidateObjectAllowNullable,
+  kValidateObjectAllowArray,
+  kValidateObjectAllowFunction,
 } = require('internal/validators');
 const binding = internalBinding('encoding_binding');
 const {
@@ -76,8 +79,11 @@ const empty = new Uint8Array(0);
 
 const encodings = new SafeMap([
   ['unicode-1-1-utf-8', 'utf-8'],
+  ['unicode11utf8', 'utf-8'],
+  ['unicode20utf8', 'utf-8'],
   ['utf8', 'utf-8'],
   ['utf-8', 'utf-8'],
+  ['x-unicode20utf8', 'utf-8'],
   ['866', 'ibm866'],
   ['cp866', 'ibm866'],
   ['csibm866', 'ibm866'],
@@ -176,6 +182,7 @@ const encodings = new SafeMap([
   ['iso885915', 'iso-8859-15'],
   ['iso_8859-15', 'iso-8859-15'],
   ['l9', 'iso-8859-15'],
+  ['iso-8859-16', 'iso-8859-16'],
   ['cskoi8r', 'koi8-r'],
   ['koi', 'koi8-r'],
   ['koi8', 'koi8-r'],
@@ -283,9 +290,22 @@ const encodings = new SafeMap([
   ['ksc5601', 'euc-kr'],
   ['ksc_5601', 'euc-kr'],
   ['windows-949', 'euc-kr'],
+  ['csiso2022kr', 'replacement'],
+  ['hz-gb-2312', 'replacement'],
+  ['iso-2022-cn', 'replacement'],
+  ['iso-2022-cn-ext', 'replacement'],
+  ['iso-2022-kr', 'replacement'],
+  ['replacement', 'replacement'],
+  ['unicodefffe', 'utf-16be'],
   ['utf-16be', 'utf-16be'],
+  ['csunicode', 'utf-16le'],
+  ['iso-10646-ucs-2', 'utf-16le'],
+  ['ucs-2', 'utf-16le'],
+  ['unicode', 'utf-16le'],
+  ['unicodefeff', 'utf-16le'],
   ['utf-16le', 'utf-16le'],
   ['utf-16', 'utf-16le'],
+  ['x-user-defined', 'x-user-defined'],
 ]);
 
 // Unfortunately, String.prototype.trim also removes non-ascii whitespace,
@@ -373,6 +393,10 @@ const TextDecoder =
     makeTextDecoderICU() :
     makeTextDecoderJS();
 
+const kValidateObjectAllowObjectsAndNull = kValidateObjectAllowNullable |
+  kValidateObjectAllowArray |
+  kValidateObjectAllowFunction;
+
 function makeTextDecoderICU() {
   const {
     decode: _decode,
@@ -382,11 +406,7 @@ function makeTextDecoderICU() {
   class TextDecoder {
     constructor(encoding = 'utf-8', options = kEmptyObject) {
       encoding = `${encoding}`;
-      validateObject(options, 'options', {
-        nullable: true,
-        allowArray: true,
-        allowFunction: true,
-      });
+      validateObject(options, 'options', kValidateObjectAllowObjectsAndNull);
 
       const enc = getEncodingFromLabel(encoding);
       if (enc === undefined)
@@ -431,11 +451,7 @@ function makeTextDecoderICU() {
 
       this.#prepareConverter();
 
-      validateObject(options, 'options', {
-        nullable: true,
-        allowArray: true,
-        allowFunction: true,
-      });
+      validateObject(options, 'options', kValidateObjectAllowObjectsAndNull);
 
       let flags = 0;
       if (options !== null)
@@ -465,11 +481,7 @@ function makeTextDecoderJS() {
   class TextDecoder {
     constructor(encoding = 'utf-8', options = kEmptyObject) {
       encoding = `${encoding}`;
-      validateObject(options, 'options', {
-        nullable: true,
-        allowArray: true,
-        allowFunction: true,
-      });
+      validateObject(options, 'options', kValidateObjectAllowObjectsAndNull);
 
       const enc = getEncodingFromLabel(encoding);
       if (enc === undefined || !hasConverter(enc))
@@ -511,11 +523,7 @@ function makeTextDecoderJS() {
                                        ['ArrayBuffer', 'ArrayBufferView'],
                                        input);
       }
-      validateObject(options, 'options', {
-        nullable: true,
-        allowArray: true,
-        allowFunction: true,
-      });
+      validateObject(options, 'options', kValidateObjectAllowObjectsAndNull);
 
       if (this[kFlags] & CONVERTER_FLAGS_FLUSH) {
         this[kBOMSeen] = false;
diff --git a/lib/internal/errors.js b/lib/internal/errors.js
index e84b9f6c851205..a72236063b47fd 100644
--- a/lib/internal/errors.js
+++ b/lib/internal/errors.js
@@ -48,6 +48,7 @@ const {
   String,
   StringPrototypeEndsWith,
   StringPrototypeIncludes,
+  StringPrototypeIndexOf,
   StringPrototypeSlice,
   StringPrototypeSplit,
   StringPrototypeStartsWith,
@@ -175,9 +176,10 @@ const aggregateErrors = hideStackFrames((errors, message, code) => {
   return err;
 });
 
+const assert = require('internal/assert');
+
 // Lazily loaded
 let util;
-let assert;
 
 let internalUtil = null;
 function lazyInternalUtil() {
@@ -371,42 +373,103 @@ function makeSystemErrorWithCode(key) {
 }
 
 function makeNodeErrorWithCode(Base, key) {
-  return function NodeError(...args) {
-    const limit = Error.stackTraceLimit;
-    if (isErrorStackTraceLimitWritable()) Error.stackTraceLimit = 0;
-    const error = new Base();
-    // Reset the limit and setting the name property.
-    if (isErrorStackTraceLimitWritable()) Error.stackTraceLimit = limit;
-    const message = getMessage(key, args, error);
-    ObjectDefineProperties(error, {
-      [kIsNodeError]: {
-        __proto__: null,
-        value: true,
-        enumerable: false,
-        writable: false,
-        configurable: true,
-      },
-      message: {
-        __proto__: null,
-        value: message,
-        enumerable: false,
-        writable: true,
-        configurable: true,
-      },
-      toString: {
-        __proto__: null,
-        value() {
+  const msg = messages.get(key);
+  const expectedLength = typeof msg !== 'string' ? -1 : getExpectedArgumentLength(msg);
+
+  switch (expectedLength) {
+    case 0: {
+      class NodeError extends Base {
+        code = key;
+
+        constructor(...args) {
+          assert(
+            args.length === 0,
+            `Code: ${key}; The provided arguments length (${args.length}) does not ` +
+              `match the required ones (${expectedLength}).`,
+          );
+          super(msg);
+        }
+
+        // This is a workaround for wpt tests that expect that the error
+        // constructor has a `name` property of the base class.
+        get ['constructor']() {
+          return Base;
+        }
+
+        get [kIsNodeError]() {
+          return true;
+        }
+
+        toString() {
           return `${this.name} [${key}]: ${this.message}`;
-        },
-        enumerable: false,
-        writable: true,
-        configurable: true,
-      },
-    });
-    captureLargerStackTrace(error);
-    error.code = key;
-    return error;
-  };
+        }
+      }
+      return NodeError;
+    }
+    case -1: {
+      class NodeError extends Base {
+        code = key;
+
+        constructor(...args) {
+          super();
+          ObjectDefineProperty(this, 'message', {
+            __proto__: null,
+            value: getMessage(key, args, this),
+            enumerable: false,
+            writable: true,
+            configurable: true,
+          });
+        }
+
+        // This is a workaround for wpt tests that expect that the error
+        // constructor has a `name` property of the base class.
+        get ['constructor']() {
+          return Base;
+        }
+
+        get [kIsNodeError]() {
+          return true;
+        }
+
+        toString() {
+          return `${this.name} [${key}]: ${this.message}`;
+        }
+      }
+      return NodeError;
+    }
+    default: {
+
+      class NodeError extends Base {
+        code = key;
+
+        constructor(...args) {
+          assert(
+            args.length === expectedLength,
+            `Code: ${key}; The provided arguments length (${args.length}) does not ` +
+              `match the required ones (${expectedLength}).`,
+          );
+
+          ArrayPrototypeUnshift(args, msg);
+          super(ReflectApply(lazyInternalUtilInspect().format, null, args));
+        }
+
+        // This is a workaround for wpt tests that expect that the error
+        // constructor has a `name` property of the base class.
+        get ['constructor']() {
+          return Base;
+        }
+
+        get [kIsNodeError]() {
+          return true;
+        }
+
+        toString() {
+          return `${this.name} [${key}]: ${this.message}`;
+        }
+      }
+      return NodeError;
+    }
+  }
 }
 
 /**
@@ -443,11 +506,16 @@ function E(sym, val, def, ...otherClasses) {
   codes[sym] = def;
 }
 
+function getExpectedArgumentLength(msg) {
+  let expectedLength = 0;
+  const regex = /%[dfijoOs]/g;
+  while (RegExpPrototypeExec(regex, msg) !== null) expectedLength++;
+  return expectedLength;
+}
+
 function getMessage(key, args, self) {
   const msg = messages.get(key);
 
-  assert ??= require('internal/assert');
-
   if (typeof msg === 'function') {
     assert(
       msg.length <= args.length, // Default options do not count.
@@ -457,9 +525,7 @@ function getMessage(key, args, self) {
     return ReflectApply(msg, self, args);
   }
 
-  const regex = /%[dfijoOs]/g;
-  let expectedLength = 0;
-  while (RegExpPrototypeExec(regex, msg) !== null) expectedLength++;
+  const expectedLength = getExpectedArgumentLength(msg);
   assert(
     expectedLength === args.length,
     `Code: ${key}; The provided arguments length (${args.length}) does not ` +
@@ -874,23 +940,53 @@ const genericNodeError = hideStackFrames(function genericNodeError(message, erro
  * @returns {string}
  */
 function determineSpecificType(value) {
-  if (value == null) {
-    return '' + value;
+  if (value === null) {
+    return 'null';
+  } else if (value === undefined) {
+    return 'undefined';
   }
-  if (typeof value === 'function' && value.name) {
-    return `function ${value.name}`;
-  }
-  if (typeof value === 'object') {
-    if (value.constructor?.name) {
-      return `an instance of ${value.constructor.name}`;
-    }
-    return `${lazyInternalUtilInspect().inspect(value, { depth: -1 })}`;
-  }
-  let inspected = lazyInternalUtilInspect()
-    .inspect(value, { colors: false });
-  if (inspected.length > 28) { inspected = `${StringPrototypeSlice(inspected, 0, 25)}...`; }
 
-  return `type ${typeof value} (${inspected})`;
+  const type = typeof value;
+
+  switch (type) {
+    case 'bigint':
+      return `type bigint (${value}n)`;
+    case 'number':
+      if (value === 0) {
+        return 1 / value === -Infinity ? 'type number (-0)' : 'type number (0)';
+      } else if (value !== value) { // eslint-disable-line no-self-compare
+        return 'type number (NaN)';
+      } else if (value === Infinity) {
+        return 'type number (Infinity)';
+      } else if (value === -Infinity) {
+        return 'type number (-Infinity)';
+      }
+      return `type number (${value})`;
+    case 'boolean':
+      return value ? 'type boolean (true)' : 'type boolean (false)';
+    case 'symbol':
+      return `type symbol (${String(value)})`;
+    case 'function':
+      return `function ${value.name}`;
+    case 'object':
+      if (value.constructor && 'name' in value.constructor) {
+        return `an instance of ${value.constructor.name}`;
+      }
+      return `${lazyInternalUtilInspect().inspect(value, { depth: -1 })}`;
+    case 'string':
+      value.length > 28 && (value = `${StringPrototypeSlice(value, 0, 25)}...`);
+      if (StringPrototypeIndexOf(value, "'") === -1) {
+        return `type string ('${value}')`;
+      }
+      return `type string (${JSONStringify(value)})`;
+    default:
+      value = lazyInternalUtilInspect().inspect(value, { colors: false });
+      if (value.length > 28) {
+        value = `${StringPrototypeSlice(value, 0, 25)}...`;
+      }
+
+      return `type ${type} (${value})`;
+  }
 }
 
 /**
@@ -902,8 +998,14 @@ function determineSpecificType(value) {
  * @returns {string}
  */
 function formatList(array, type = 'and') {
-  return array.length < 3 ? ArrayPrototypeJoin(array, ` ${type} `) :
-    `${ArrayPrototypeJoin(ArrayPrototypeSlice(array, 0, -1), ', ')}, ${type} ${array[array.length - 1]}`;
+  switch (array.length) {
+    case 0: return '';
+    case 1: return `${array[0]}`;
+    case 2: return `${array[0]} ${type} ${array[1]}`;
+    case 3: return `${array[0]}, ${array[1]}, ${type} ${array[2]}`;
+    default:
+      return `${ArrayPrototypeJoin(ArrayPrototypeSlice(array, 0, -1), ', ')}, ${type} ${array[array.length - 1]}`;
+  }
 }
 
 module.exports = {
@@ -1178,12 +1280,17 @@ E('ERR_HTTP_SOCKET_ENCODING',
 E('ERR_HTTP_TRAILER_INVALID',
   'Trailers are invalid with this transfer encoding', Error);
 E('ERR_ILLEGAL_CONSTRUCTOR', 'Illegal constructor', TypeError);
+// TODO(aduh95): change the error to mention import attributes instead of import assertions.
 E('ERR_IMPORT_ASSERTION_TYPE_FAILED',
   'Module "%s" is not of type "%s"', TypeError);
+// TODO(aduh95): change the error to mention import attributes instead of import assertions.
 E('ERR_IMPORT_ASSERTION_TYPE_MISSING',
-  'Module "%s" needs an import assertion of type "%s"', TypeError);
+  'Module "%s" needs an import attribute of type "%s"', TypeError);
+// TODO(aduh95): change the error to mention import attributes instead of import assertions.
 E('ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED',
-  'Import assertion type "%s" is unsupported', TypeError);
+  'Import attribute type "%s" is unsupported', TypeError);
+E('ERR_IMPORT_ATTRIBUTE_UNSUPPORTED',
+  'Import attribute "%s" with value "%s" is not supported', TypeError);
 E('ERR_INCOMPATIBLE_OPTION_PAIR',
   'Option "%s" cannot be used in combination with option "%s"', TypeError);
 E('ERR_INPUT_TYPE_NOT_ALLOWED', '--input-type can only be used with string ' +
@@ -1370,8 +1477,13 @@ E('ERR_INVALID_SYNC_FORK_INPUT',
 E('ERR_INVALID_THIS', 'Value of "this" must be of type %s', TypeError);
 E('ERR_INVALID_TUPLE', '%s must be an iterable %s tuple', TypeError);
 E('ERR_INVALID_URI', 'URI malformed', URIError);
-E('ERR_INVALID_URL', function(input) {
+E('ERR_INVALID_URL', function(input, base = null) {
   this.input = input;
+
+  if (base != null) {
+    this.base = base;
+  }
+
   // Don't include URL in message.
   // (See https://github.com/nodejs/node/pull/38614)
   return 'Invalid URL';
@@ -1450,7 +1562,7 @@ E('ERR_MISSING_ARGS',
 E('ERR_MISSING_OPTION', '%s is required', TypeError);
 E('ERR_MODULE_NOT_FOUND', function(path, base, exactUrl) {
   if (exactUrl) {
-    lazyInternalUtil().setOwnProperty(this, 'url', exactUrl);
+    lazyInternalUtil().setOwnProperty(this, 'url', `${exactUrl}`);
   }
   return `Cannot find ${
     exactUrl ? 'module' : 'package'} '${path}' imported from ${base}`;
@@ -1471,8 +1583,7 @@ E('ERR_NETWORK_IMPORT_DISALLOWED',
   "import of '%s' by %s is not supported: %s", Error);
 E('ERR_NOT_BUILDING_SNAPSHOT',
   'Operation cannot be invoked when not building startup snapshot', Error);
-E('ERR_NOT_SUPPORTED_IN_SNAPSHOT',
-  '%s is not supported in startup snapshot', Error);
+E('ERR_NOT_SUPPORTED_IN_SNAPSHOT', '%s is not supported in startup snapshot', Error);
 E('ERR_NO_CRYPTO',
   'Node.js is not compiled with OpenSSL crypto support', Error);
 E('ERR_NO_ICU',
@@ -1685,13 +1796,7 @@ E('ERR_UNHANDLED_ERROR',
 E('ERR_UNKNOWN_BUILTIN_MODULE', 'No such built-in module: %s', Error);
 E('ERR_UNKNOWN_CREDENTIAL', '%s identifier does not exist: %s', Error);
 E('ERR_UNKNOWN_ENCODING', 'Unknown encoding: %s', TypeError);
-E('ERR_UNKNOWN_FILE_EXTENSION', (ext, path, suggestion) => {
-  let msg = `Unknown file extension "${ext}" for ${path}`;
-  if (suggestion) {
-    msg += `. ${suggestion}`;
-  }
-  return msg;
-}, TypeError);
+E('ERR_UNKNOWN_FILE_EXTENSION', 'Unknown file extension "%s" for %s', TypeError);
 E('ERR_UNKNOWN_MODULE_FORMAT', 'Unknown module format: %s for URL %s',
   RangeError);
 E('ERR_UNKNOWN_SIGNAL', 'Unknown signal: %s', TypeError);
@@ -1716,6 +1821,9 @@ E('ERR_VALID_PERFORMANCE_ENTRY_TYPE',
   'At least one valid performance entry type is required', Error);
 E('ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING',
   'A dynamic import callback was not specified.', TypeError);
+E('ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG',
+  'A dynamic import callback was invoked without --experimental-vm-modules',
+  TypeError);
 E('ERR_VM_MODULE_ALREADY_LINKED', 'Module has already been linked', Error);
 E('ERR_VM_MODULE_CANNOT_CREATE_CACHED_DATA',
   'Cached data cannot be created for a module which has been evaluated', Error);
diff --git a/lib/internal/event_target.js b/lib/internal/event_target.js
index 5ab2a23f980549..0236f3a53c5276 100644
--- a/lib/internal/event_target.js
+++ b/lib/internal/event_target.js
@@ -30,7 +30,14 @@ const {
     ERR_INVALID_THIS,
   },
 } = require('internal/errors');
-const { validateAbortSignal, validateObject, validateString, validateInternalField } = require('internal/validators');
+const {
+  validateAbortSignal,
+  validateObject,
+  validateString,
+  validateInternalField,
+  kValidateObjectAllowArray,
+  kValidateObjectAllowFunction,
+} = require('internal/validators');
 
 const {
   customInspectSymbol,
@@ -1037,9 +1044,7 @@ function validateEventListenerOptions(options) {
 
   if (options === null)
     return kEmptyObject;
-  validateObject(options, 'options', {
-    allowArray: true, allowFunction: true,
-  });
+  validateObject(options, 'options', kValidateObjectAllowArray | kValidateObjectAllowFunction);
   return {
     once: Boolean(options.once),
     capture: Boolean(options.capture),
diff --git a/lib/internal/freeze_intrinsics.js b/lib/internal/freeze_intrinsics.js
index 793c19df1e9138..2017b8f66e84c0 100644
--- a/lib/internal/freeze_intrinsics.js
+++ b/lib/internal/freeze_intrinsics.js
@@ -31,6 +31,7 @@ const {
   ArrayPrototype,
   ArrayPrototypeForEach,
   ArrayPrototypePush,
+  Atomics,
   BigInt,
   BigInt64Array,
   BigInt64ArrayPrototype,
@@ -128,7 +129,6 @@ const {
 } = primordials;
 
 const {
-  Atomics,
   Intl,
   SharedArrayBuffer,
   WebAssembly,
diff --git a/lib/internal/fs/dir.js b/lib/internal/fs/dir.js
index a443532d35d3ed..1118ff5f674915 100644
--- a/lib/internal/fs/dir.js
+++ b/lib/internal/fs/dir.js
@@ -322,18 +322,11 @@ function opendir(path, options, callback) {
 
 function opendirSync(path, options) {
   path = getValidatedPath(path);
-  options = getOptions(options, {
-    encoding: 'utf8',
-  });
+  options = getOptions(options, { encoding: 'utf8' });
 
-  const ctx = { path };
-  const handle = dirBinding.opendir(
+  const handle = dirBinding.opendirSync(
     pathModule.toNamespacedPath(path),
-    options.encoding,
-    undefined,
-    ctx,
   );
-  handleErrorFromBinding(ctx);
 
   return new Dir(handle, path, options);
 }
diff --git a/lib/internal/fs/promises.js b/lib/internal/fs/promises.js
index bc506b9be82fbc..f58dfae182811b 100644
--- a/lib/internal/fs/promises.js
+++ b/lib/internal/fs/promises.js
@@ -6,7 +6,6 @@ const {
   Error,
   MathMax,
   MathMin,
-  NumberIsSafeInteger,
   Promise,
   PromisePrototypeThen,
   PromiseResolve,
@@ -67,6 +66,7 @@ const {
   validateCpOptions,
   validateOffsetLengthRead,
   validateOffsetLengthWrite,
+  validatePosition,
   validateRmOptions,
   validateRmdirOptions,
   validateStringAfterArrayBufferView,
@@ -82,6 +82,7 @@ const {
   validateInteger,
   validateObject,
   validateString,
+  kValidateObjectAllowNullable,
 } = require('internal/validators');
 const pathModule = require('path');
 const {
@@ -349,6 +350,7 @@ class FileHandle extends EventEmitter {
    *   autoClose?: boolean;
    *   emitClose?: boolean;
    *   start: number;
+   *   flush?: boolean;
    *   }} [options]
    * @returns {WriteStream}
    */
@@ -413,6 +415,18 @@ async function handleFdClose(fileOpPromise, closeFunc) {
   );
 }
 
+async function handleFdSync(fileOpPromise, handle) {
+  return PromisePrototypeThen(
+    fileOpPromise,
+    (result) => PromisePrototypeThen(
+      handle.sync(),
+      () => result,
+      (syncError) => PromiseReject(syncError),
+    ),
+    (opError) => PromiseReject(opError),
+  );
+}
+
 async function fsCall(fn, handle, ...args) {
   assert(handle[kRefs] !== undefined,
          'handle must be an instance of FileHandle');
@@ -597,7 +611,7 @@ async function read(handle, bufferOrParams, offset, length, position) {
   if (!isArrayBufferView(buffer)) {
     // This is fh.read(params)
     if (bufferOrParams !== undefined) {
-      validateObject(bufferOrParams, 'options', { nullable: true });
+      validateObject(bufferOrParams, 'options', kValidateObjectAllowNullable);
     }
     ({
       buffer = Buffer.alloc(16384),
@@ -636,8 +650,11 @@ async function read(handle, bufferOrParams, offset, length, position) {
 
   validateOffsetLengthRead(offset, length, buffer.byteLength);
 
-  if (!NumberIsSafeInteger(position))
+  if (position == null) {
     position = -1;
+  } else {
+    validatePosition(position, 'position', length);
+  }
 
   const bytesRead = (await binding.read(handle.fd, buffer, offset, length,
                                         position, kUsePromises)) || 0;
@@ -1003,8 +1020,16 @@ async function mkdtemp(prefix, options) {
 }
 
 async function writeFile(path, data, options) {
-  options = getOptions(options, { encoding: 'utf8', mode: 0o666, flag: 'w' });
+  options = getOptions(options, {
+    encoding: 'utf8',
+    mode: 0o666,
+    flag: 'w',
+    flush: false,
+  });
   const flag = options.flag || 'w';
+  const flush = options.flush ?? false;
+
+  validateBoolean(flush, 'options.flush');
 
   if (!isArrayBufferView(data) && !isCustomIterable(data)) {
     validateStringAfterArrayBufferView(data, 'data');
@@ -1018,8 +1043,13 @@ async function writeFile(path, data, options) {
   checkAborted(options.signal);
 
   const fd = await open(path, flag, options.mode);
-  return handleFdClose(
-    writeFileHandle(fd, data, options.signal, options.encoding), fd.close);
+  let writeOp = writeFileHandle(fd, data, options.signal, options.encoding);
+
+  if (flush) {
+    writeOp = handleFdSync(writeOp, fd);
+  }
+
+  return handleFdClose(writeOp, fd.close);
 }
 
 function isCustomIterable(obj) {
diff --git a/lib/internal/fs/read/utf8.js b/lib/internal/fs/read/utf8.js
deleted file mode 100644
index 5159db5988ee0b..00000000000000
--- a/lib/internal/fs/read/utf8.js
+++ /dev/null
@@ -1,25 +0,0 @@
-'use strict';
-
-const { handleErrorFromBinding } = require('internal/fs/utils');
-
-const binding = internalBinding('fs');
-
-/**
- * @param {string} path
- * @param {number} flag
- * @return {string}
- */
-function readFileSyncUtf8(path, flag) {
-  const response = binding.readFileSync(path, flag);
-
-  if (typeof response === 'string') {
-    return response;
-  }
-
-  const { 0: errno, 1: syscall } = response;
-  handleErrorFromBinding({ errno, syscall, path });
-}
-
-module.exports = {
-  readFileSyncUtf8,
-};
diff --git a/lib/internal/fs/streams.js b/lib/internal/fs/streams.js
index c317f3b9202af9..43f06d0104de61 100644
--- a/lib/internal/fs/streams.js
+++ b/lib/internal/fs/streams.js
@@ -23,6 +23,7 @@ const {
   kEmptyObject,
 } = require('internal/util');
 const {
+  validateBoolean,
   validateFunction,
   validateInteger,
 } = require('internal/validators');
@@ -92,6 +93,9 @@ const FileHandleOperations = (handle) => {
       PromisePrototypeThen(handle.close(),
                            () => cb(), cb);
     },
+    fsync: (fd, cb) => {
+      PromisePrototypeThen(handle.sync(), () => cb(), cb);
+    },
     read: (fd, buf, offset, length, pos, cb) => {
       PromisePrototypeThen(handle.read(buf, offset, length, pos),
                            (r) => cb(null, r.bytesRead, r.buffer),
@@ -113,14 +117,22 @@ const FileHandleOperations = (handle) => {
 function close(stream, err, cb) {
   if (!stream.fd) {
     cb(err);
-  } else {
-    stream[kFs].close(stream.fd, (er) => {
-      cb(er || err);
+  } else if (stream.flush) {
+    stream[kFs].fsync(stream.fd, (flushErr) => {
+      _close(stream, err || flushErr, cb);
     });
-    stream.fd = null;
+  } else {
+    _close(stream, err, cb);
   }
 }
 
+function _close(stream, err, cb) {
+  stream[kFs].close(stream.fd, (er) => {
+    cb(er || err);
+  });
+  stream.fd = null;
+}
+
 function importFd(stream, options) {
   if (typeof options.fd === 'number') {
     // When fd is a raw descriptor, we must keep our fingers crossed
@@ -143,8 +155,8 @@ function importFd(stream, options) {
     return options.fd.fd;
   }
 
-  throw ERR_INVALID_ARG_TYPE('options.fd',
-                             ['number', 'FileHandle'], options.fd);
+  throw new ERR_INVALID_ARG_TYPE('options.fd',
+                                 ['number', 'FileHandle'], options.fd);
 }
 
 function ReadStream(path, options) {
@@ -350,6 +362,14 @@ function WriteStream(path, options) {
     validateFunction(this[kFs].close, 'options.fs.close');
   }
 
+  this.flush = options.flush;
+  if (this.flush == null) {
+    this.flush = false;
+  } else {
+    validateBoolean(this.flush, 'options.flush');
+    validateFunction(this[kFs].fsync, 'options.fs.fsync');
+  }
+
   // It's enough to override either, in which case only one will be used.
   if (!this[kFs].write) {
     this._write = null;
diff --git a/lib/internal/fs/utils.js b/lib/internal/fs/utils.js
index 2fc7bf61e9c488..611b6c242047b9 100644
--- a/lib/internal/fs/utils.js
+++ b/lib/internal/fs/utils.js
@@ -22,6 +22,7 @@ const {
   Symbol,
   TypedArrayPrototypeAt,
   TypedArrayPrototypeIncludes,
+  uncurryThis,
 } = primordials;
 
 const permission = require('internal/process/permission');
@@ -708,13 +709,17 @@ const validatePath = hideStackFrames((path, propName = 'path') => {
 // TODO(rafaelgss): implement the path.resolve on C++ side
 // See: https://github.com/nodejs/node/pull/44004#discussion_r930958420
 // The permission model needs the absolute path for the fs_permission
+const resolvePath = pathModule.resolve;
+const { isBuffer: BufferIsBuffer, from: BufferFrom } = Buffer;
+const BufferToString = uncurryThis(Buffer.prototype.toString);
 function possiblyTransformPath(path) {
   if (permission.isEnabled()) {
     if (typeof path === 'string') {
-      return pathModule.resolve(path);
-    } else if (Buffer.isBuffer(path)) {
-      return Buffer.from(pathModule.resolve(path.toString()));
+      return resolvePath(path);
     }
+    assert(isUint8Array(path));
+    if (!BufferIsBuffer(path)) path = BufferFrom(path);
+    return BufferFrom(resolvePath(BufferToString(path)));
   }
   return path;
 }
@@ -916,13 +921,14 @@ const validateStringAfterArrayBufferView = hideStackFrames((buffer, name) => {
   }
 });
 
-const validatePosition = hideStackFrames((position, name) => {
+const validatePosition = hideStackFrames((position, name, length) => {
   if (typeof position === 'number') {
-    validateInteger(position, name);
+    validateInteger(position, name, -1);
   } else if (typeof position === 'bigint') {
-    if (!(position >= -(2n ** 63n) && position <= 2n ** 63n - 1n)) {
+    const maxPosition = 2n ** 63n - 1n - BigInt(length);
+    if (!(position >= -1n && position <= maxPosition)) {
       throw new ERR_OUT_OF_RANGE(name,
-                                 `>= ${-(2n ** 63n)} && <= ${2n ** 63n - 1n}`,
+                                 `>= -1 && <= ${maxPosition}`,
                                  position);
     }
   } else {
diff --git a/lib/internal/main/check_syntax.js b/lib/internal/main/check_syntax.js
index 50e0b7d6de67c4..9a19c1809fe102 100644
--- a/lib/internal/main/check_syntax.js
+++ b/lib/internal/main/check_syntax.js
@@ -60,7 +60,8 @@ function loadESMIfNeeded(cb) {
 async function checkSyntax(source, filename) {
   let isModule = true;
   if (filename === '[stdin]' || filename === '[eval]') {
-    isModule = getOptionValue('--input-type') === 'module';
+    isModule = getOptionValue('--input-type') === 'module' ||
+      (getOptionValue('--experimental-default-type') === 'module' && getOptionValue('--input-type') !== 'commonjs');
   } else {
     const { defaultResolve } = require('internal/modules/esm/resolve');
     const { defaultGetFormat } = require('internal/modules/esm/get_format');
diff --git a/lib/internal/main/eval_stdin.js b/lib/internal/main/eval_stdin.js
index d947af49a6a942..d71751e781b9b5 100644
--- a/lib/internal/main/eval_stdin.js
+++ b/lib/internal/main/eval_stdin.js
@@ -25,12 +25,14 @@ readStdin((code) => {
 
   const print = getOptionValue('--print');
   const loadESM = getOptionValue('--import').length > 0;
-  if (getOptionValue('--input-type') === 'module')
+  if (getOptionValue('--input-type') === 'module' ||
+    (getOptionValue('--experimental-default-type') === 'module' && getOptionValue('--input-type') !== 'commonjs')) {
     evalModule(code, print);
-  else
+  } else {
     evalScript('[stdin]',
                code,
                getOptionValue('--inspect-brk'),
                print,
                loadESM);
+  }
 });
diff --git a/lib/internal/main/eval_string.js b/lib/internal/main/eval_string.js
index dc59a2ce4f7709..908532b0b1865a 100644
--- a/lib/internal/main/eval_string.js
+++ b/lib/internal/main/eval_string.js
@@ -25,9 +25,10 @@ markBootstrapComplete();
 const source = getOptionValue('--eval');
 const print = getOptionValue('--print');
 const loadESM = getOptionValue('--import').length > 0 || getOptionValue('--experimental-loader').length > 0;
-if (getOptionValue('--input-type') === 'module')
+if (getOptionValue('--input-type') === 'module' ||
+  (getOptionValue('--experimental-default-type') === 'module' && getOptionValue('--input-type') !== 'commonjs')) {
   evalModule(source, print);
-else {
+} else {
   // For backward compatibility, we want the identifier crypto to be the
   // `node:crypto` module rather than WebCrypto.
   const isUsingCryptoIdentifier =
diff --git a/lib/internal/main/mksnapshot.js b/lib/internal/main/mksnapshot.js
index 52d859d491a93f..34701716839326 100644
--- a/lib/internal/main/mksnapshot.js
+++ b/lib/internal/main/mksnapshot.js
@@ -132,7 +132,7 @@ function requireForUserSnapshot(id) {
 
 
 function main() {
-  prepareMainThreadExecution(true, false);
+  prepareMainThreadExecution(false, false);
   initializeCallbacks();
 
   let stackTraceLimitDesc;
diff --git a/lib/internal/main/run_main_module.js b/lib/internal/main/run_main_module.js
index 51331270a2161f..5d09203b8c27ee 100644
--- a/lib/internal/main/run_main_module.js
+++ b/lib/internal/main/run_main_module.js
@@ -6,18 +6,24 @@ const {
   prepareMainThreadExecution,
   markBootstrapComplete,
 } = require('internal/process/pre_execution');
+const { getOptionValue } = require('internal/options');
 
-prepareMainThreadExecution(true);
+const mainEntry = prepareMainThreadExecution(true);
 
 markBootstrapComplete();
 
 // Necessary to reset RegExp statics before user code runs.
 RegExpPrototypeExec(/^/, '');
 
-// Note: this loads the module through the ESM loader if the module is
-// determined to be an ES module. This hangs from the CJS module loader
-// because we currently allow monkey-patching of the module loaders
-// in the preloaded scripts through require('module').
-// runMain here might be monkey-patched by users in --require.
-// XXX: the monkey-patchability here should probably be deprecated.
-require('internal/modules/cjs/loader').Module.runMain(process.argv[1]);
+if (getOptionValue('--experimental-default-type') === 'module') {
+  require('internal/modules/run_main').executeUserEntryPoint(mainEntry);
+} else {
+  /**
+   * To support legacy monkey-patching of `Module.runMain`, we call `runMain` here to have the CommonJS loader begin
+   * the execution of the main entry point, even if the ESM loader immediately takes over because the main entry is an
+   * ES module or one of the other opt-in conditions (such as the use of `--import`) are met. Users can monkey-patch
+   * before the main entry point is loaded by doing so via scripts loaded through `--require`. This monkey-patchability
+   * is undesirable and is removed in `--experimental-default-type=module` mode.
+   */
+  require('internal/modules/cjs/loader').Module.runMain(mainEntry);
+}
diff --git a/lib/internal/main/test_runner.js b/lib/internal/main/test_runner.js
index 4974f4ce0d338b..7e6f3079a509a9 100644
--- a/lib/internal/main/test_runner.js
+++ b/lib/internal/main/test_runner.js
@@ -18,11 +18,14 @@ const {
   RegExpPrototypeExec,
   StringPrototypeSplit,
 } = primordials;
+let debug = require('internal/util/debuglog').debuglog('test_runner', (fn) => {
+  debug = fn;
+});
 
 prepareMainThreadExecution(false);
 markBootstrapComplete();
 
-let concurrency = true;
+let concurrency = getOptionValue('--test-concurrency') || true;
 let inspectPort;
 
 if (isUsingInspector()) {
@@ -57,8 +60,15 @@ if (shardOption) {
   };
 }
 
-run({ concurrency, inspectPort, watch: getOptionValue('--watch'), setup: setupTestReporters, shard })
-.on('test:fail', (data) => {
+const options = {
+  concurrency,
+  inspectPort,
+  watch: getOptionValue('--watch'),
+  setup: setupTestReporters,
+  shard,
+};
+debug('test runner configuration:', options);
+run(options).on('test:fail', (data) => {
   if (data.todo === undefined || data.todo === false) {
     process.exitCode = kGenericUserError;
   }
diff --git a/lib/internal/main/worker_thread.js b/lib/internal/main/worker_thread.js
index 12ae4a9b23212d..0dda4c760e4acb 100644
--- a/lib/internal/main/worker_thread.js
+++ b/lib/internal/main/worker_thread.js
@@ -7,12 +7,12 @@ const {
   ArrayPrototypeForEach,
   ArrayPrototypePushApply,
   ArrayPrototypeSplice,
+  AtomicsLoad,
   ObjectDefineProperty,
   PromisePrototypeThen,
   RegExpPrototypeExec,
   SafeWeakMap,
   globalThis: {
-    Atomics,
     SharedArrayBuffer,
   },
 } = primordials;
@@ -112,7 +112,7 @@ port.on('message', (message) => {
 
     require('internal/worker').assignEnvironmentData(environmentData);
 
-    if (SharedArrayBuffer !== undefined && Atomics !== undefined) {
+    if (SharedArrayBuffer !== undefined) {
       // The counter is only passed to the workers created by the main thread,
       // not to workers created by other workers.
       let cachedCwd = '';
@@ -120,7 +120,7 @@ port.on('message', (message) => {
       const originalCwd = process.cwd;
 
       process.cwd = function() {
-        const currentCounter = Atomics.load(cwdCounter, 0);
+        const currentCounter = AtomicsLoad(cwdCounter, 0);
         if (currentCounter === lastCounter)
           return cachedCwd;
         lastCounter = currentCounter;
diff --git a/lib/internal/mime.js b/lib/internal/mime.js
index 4dbfcb3d9b0715..332ed8b5368c84 100644
--- a/lib/internal/mime.js
+++ b/lib/internal/mime.js
@@ -36,6 +36,7 @@ function toASCIILower(str) {
 
 const SOLIDUS = '/';
 const SEMICOLON = ';';
+
 function parseTypeAndSubtype(str) {
   // Skip only HTTP whitespace from start
   let position = SafeStringPrototypeSearch(str, END_BEGINNING_WHITESPACE);
@@ -72,12 +73,11 @@ function parseTypeAndSubtype(str) {
     throw new ERR_INVALID_MIME_SYNTAX('subtype', str, trimmedSubtype);
   }
   const subtype = toASCIILower(trimmedSubtype);
-  return {
-    __proto__: null,
+  return [
     type,
     subtype,
-    parametersStringIndex: position,
-  };
+    position,
+  ];
 }
 
 const EQUALS_SEMICOLON_OR_END = /[;=]|$/;
@@ -123,12 +123,29 @@ const encode = (value) => {
 
 class MIMEParams {
   #data = new SafeMap();
+  // We set the flag the MIMEParams instance as processed on initialization
+  // to defer the parsing of a potentially large string.
+  #processed = true;
+  #string = null;
+
+  /**
+   * Used to instantiate a MIMEParams object within the MIMEType class and
+   * to allow it to be parsed lazily.
+   */
+  static instantiateMimeParams(str) {
+    const instance = new MIMEParams();
+    instance.#string = str;
+    instance.#processed = false;
+    return instance;
+  }
 
   delete(name) {
+    this.#parse();
     this.#data.delete(name);
   }
 
   get(name) {
+    this.#parse();
     const data = this.#data;
     if (data.has(name)) {
       return data.get(name);
@@ -137,10 +154,12 @@ class MIMEParams {
   }
 
   has(name) {
+    this.#parse();
     return this.#data.has(name);
   }
 
   set(name, value) {
+    this.#parse();
     const data = this.#data;
     name = `${name}`;
     value = `${value}`;
@@ -166,18 +185,22 @@ class MIMEParams {
   }
 
   *entries() {
+    this.#parse();
     yield* this.#data.entries();
   }
 
   *keys() {
+    this.#parse();
     yield* this.#data.keys();
   }
 
   *values() {
+    this.#parse();
     yield* this.#data.values();
   }
 
   toString() {
+    this.#parse();
     let ret = '';
     for (const { 0: key, 1: value } of this.#data) {
       const encoded = encode(value);
@@ -190,8 +213,11 @@ class MIMEParams {
 
   // Used to act as a friendly class to stringifying stuff
   // not meant to be exposed to users, could inject invalid values
-  static parseParametersString(str, position, params) {
-    const paramsMap = params.#data;
+  #parse() {
+    if (this.#processed) return;  // already parsed
+    const paramsMap = this.#data;
+    let position = 0;
+    const str = this.#string;
     const endOfSource = SafeStringPrototypeSearch(
       StringPrototypeSlice(str, position),
       START_ENDING_WHITESPACE,
@@ -270,13 +296,14 @@ class MIMEParams {
                                   NOT_HTTP_TOKEN_CODE_POINT) === -1 &&
         SafeStringPrototypeSearch(parameterValue,
                                   NOT_HTTP_QUOTED_STRING_CODE_POINT) === -1 &&
-        params.has(parameterString) === false
+        paramsMap.has(parameterString) === false
       ) {
         paramsMap.set(parameterString, parameterValue);
       }
       position++;
     }
-    return paramsMap;
+    this.#data = paramsMap;
+    this.#processed = true;
   }
 }
 const MIMEParamsStringify = MIMEParams.prototype.toString;
@@ -293,8 +320,8 @@ ObjectDefineProperty(MIMEParams.prototype, 'toJSON', {
   writable: true,
 });
 
-const { parseParametersString } = MIMEParams;
-delete MIMEParams.parseParametersString;
+const { instantiateMimeParams } = MIMEParams;
+delete MIMEParams.instantiateMimeParams;
 
 class MIMEType {
   #type;
@@ -303,14 +330,9 @@ class MIMEType {
   constructor(string) {
     string = `${string}`;
     const data = parseTypeAndSubtype(string);
-    this.#type = data.type;
-    this.#subtype = data.subtype;
-    this.#parameters = new MIMEParams();
-    parseParametersString(
-      string,
-      data.parametersStringIndex,
-      this.#parameters,
-    );
+    this.#type = data[0];
+    this.#subtype = data[1];
+    this.#parameters = instantiateMimeParams(StringPrototypeSlice(string, data[2]));
   }
 
   get type() {
@@ -362,6 +384,8 @@ ObjectDefineProperty(MIMEType.prototype, 'toJSON', {
 });
 
 module.exports = {
+  toASCIILower,
+  parseTypeAndSubtype,
   MIMEParams,
   MIMEType,
 };
diff --git a/lib/internal/modules/cjs/loader.js b/lib/internal/modules/cjs/loader.js
index 108d2b7ffbd5de..b3b438372fe9ed 100644
--- a/lib/internal/modules/cjs/loader.js
+++ b/lib/internal/modules/cjs/loader.js
@@ -52,10 +52,10 @@ const {
   SafeMap,
   SafeWeakMap,
   String,
+  Symbol,
   StringPrototypeCharAt,
   StringPrototypeCharCodeAt,
   StringPrototypeEndsWith,
-  StringPrototypeLastIndexOf,
   StringPrototypeIndexOf,
   StringPrototypeRepeat,
   StringPrototypeSlice,
@@ -68,7 +68,7 @@ const cjsParseCache = new SafeWeakMap();
 
 // Set first due to cycle with ESM loader functions.
 module.exports = {
-  wrapSafe, Module, toRealPath, readPackageScope, cjsParseCache,
+  wrapSafe, Module, cjsParseCache,
   get hasLoadedAnyUserCJSModule() { return hasLoadedAnyUserCJSModule; },
   initializeCJS,
 };
@@ -85,12 +85,15 @@ const {
   setOwnProperty,
   getLazy,
 } = require('internal/util');
-const { internalCompileFunction } = require('internal/vm');
+const {
+  internalCompileFunction,
+  makeContextifyScript,
+  runScriptInThisContext,
+} = require('internal/vm');
+
 const assert = require('internal/assert');
 const fs = require('fs');
-const internalFS = require('internal/fs/utils');
 const path = require('path');
-const { sep } = path;
 const { internalModuleStat } = internalBinding('fs');
 const { safeGetenv } = internalBinding('credentials');
 const {
@@ -106,6 +109,7 @@ const {
   makeRequireFunction,
   normalizeReferrerURL,
   stripBOM,
+  toRealPath,
 } = require('internal/modules/helpers');
 const packageJsonReader = require('internal/modules/package_json_reader');
 const { getOptionValue, getEmbedderOptions } = require('internal/options');
@@ -155,6 +159,11 @@ let requireDepth = 0;
 let isPreloading = false;
 let statCache = null;
 
+/**
+ * Our internal implementation of `require`.
+ * @param {Module} module Parent module of what is being required
+ * @param {string} id Specifier of the child module being imported
+ */
 function internalRequire(module, id) {
   validateString(id, 'id');
   if (id === '') {
@@ -169,6 +178,10 @@ function internalRequire(module, id) {
   }
 }
 
+/**
+ * Get a path's properties, using an in-memory cache to minimize lookups.
+ * @param {string} filename Absolute path to the file
+ */
 function stat(filename) {
   filename = path.toNamespacedPath(filename);
   if (statCache !== null) {
@@ -195,6 +208,12 @@ ObjectDefineProperty(Module, '_stat', {
   configurable: true,
 });
 
+/**
+ * Update the parent's children array with the child module.
+ * @param {Module} parent Module requiring the children
+ * @param {Module} child Module being required
+ * @param {boolean} scan Add the child to the parent's children if not already present
+ */
 function updateChildren(parent, child, scan) {
   const children = parent?.children;
   if (children && !(scan && ArrayPrototypeIncludes(children, child))) {
@@ -202,19 +221,34 @@ function updateChildren(parent, child, scan) {
   }
 }
 
+/**
+ * Tell the watch mode that a module was required.
+ * @param {string} filename Absolute path of the module
+ */
 function reportModuleToWatchMode(filename) {
   if (shouldReportRequiredModules() && process.send) {
     process.send({ 'watch:require': [filename] });
   }
 }
 
+/**
+ * Tell the watch mode that a module was not found.
+ * @param {string} basePath The absolute path that errored
+ * @param {string[]} extensions The extensions that were tried
+ */
 function reportModuleNotFoundToWatchMode(basePath, extensions) {
   if (shouldReportRequiredModules() && process.send) {
     process.send({ 'watch:require': ArrayPrototypeMap(extensions, (ext) => path.resolve(`${basePath}${ext}`)) });
   }
 }
 
+/** @type {Map<Module, Module>} */
 const moduleParentCache = new SafeWeakMap();
+/**
+ * Create a new module instance.
+ * @param {string} id
+ * @param {Module} parent
+ */
 function Module(id = '', parent) {
   this.id = id;
   this.path = path.dirname(id);
@@ -237,16 +271,24 @@ function Module(id = '', parent) {
   this[require_private_symbol] = internalRequire;
 }
 
+/** @type {Record<string, Module>} */
 Module._cache = { __proto__: null };
+/** @type {Record<string, string>} */
 Module._pathCache = { __proto__: null };
+/** @type {Record<string, (module: Module, filename: string) => void>} */
 Module._extensions = { __proto__: null };
+/** @type {string[]} */
 let modulePaths = [];
+/** @type {string[]} */
 Module.globalPaths = [];
 
 let patched = false;
 
-// eslint-disable-next-line func-style
-let wrap = function(script) {
+/**
+ * Add the CommonJS wrapper around a module's source code.
+ * @param {string} script Module source code
+ */
+let wrap = function(script) { // eslint-disable-line func-style
   return Module.wrapper[0] + script + Module.wrapper[1];
 };
 
@@ -297,10 +339,17 @@ const isPreloadingDesc = { get() { return isPreloading; } };
 ObjectDefineProperty(Module.prototype, 'isPreloading', isPreloadingDesc);
 ObjectDefineProperty(BuiltinModule.prototype, 'isPreloading', isPreloadingDesc);
 
+/**
+ * Get the parent of the current module from our cache.
+ */
 function getModuleParent() {
   return moduleParentCache.get(this);
 }
 
+/**
+ * Set the parent of the current module in our cache.
+ * @param {Module} value
+ */
 function setModuleParent(value) {
   moduleParentCache.set(this, value);
 }
@@ -327,7 +376,10 @@ ObjectDefineProperty(Module.prototype, 'parent', {
 Module._debug = pendingDeprecate(debug, 'Module._debug is deprecated.', 'DEP0077');
 Module.isBuiltin = BuiltinModule.isBuiltin;
 
-// This function is called during pre-execution, before any user code is run.
+/**
+ * Prepare to run CommonJS code.
+ * This function is called during pre-execution, before any user code is run.
+ */
 function initializeCJS() {
   // This need to be done at runtime in case --expose-internals is set.
   const builtinModules = BuiltinModule.getCanBeRequiredByUsersWithoutSchemeList();
@@ -355,15 +407,7 @@ function initializeCJS() {
 //   -> a.<ext>
 //   -> a/index.<ext>
 
-/**
- * @param {string} requestPath
- * @return {PackageConfig}
- */
-function readPackage(requestPath) {
-  return packageJsonReader.read(path.resolve(requestPath, 'package.json'));
-}
-
-let _readPackage = readPackage;
+let _readPackage = packageJsonReader.readPackage;
 ObjectDefineProperty(Module, '_readPackage', {
   __proto__: null,
   get() { return _readPackage; },
@@ -375,32 +419,13 @@ ObjectDefineProperty(Module, '_readPackage', {
   configurable: true,
 });
 
-function readPackageScope(checkPath) {
-  const rootSeparatorIndex = StringPrototypeIndexOf(checkPath, sep);
-  let separatorIndex;
-  const enabledPermission = permission.isEnabled();
-  do {
-    separatorIndex = StringPrototypeLastIndexOf(checkPath, sep);
-    checkPath = StringPrototypeSlice(checkPath, 0, separatorIndex);
-    // Stop the search when the process doesn't have permissions
-    // to walk upwards
-    if (enabledPermission && !permission.has('fs.read', checkPath + sep)) {
-      return false;
-    }
-    if (StringPrototypeEndsWith(checkPath, sep + 'node_modules')) {
-      return false;
-    }
-    const pjson = _readPackage(checkPath + sep);
-    if (pjson.exists) {
-      return {
-        data: pjson,
-        path: checkPath,
-      };
-    }
-  } while (separatorIndex > rootSeparatorIndex);
-  return false;
-}
-
+/**
+ * Try to load a specifier as a package.
+ * @param {string} requestPath The path to what we are trying to load
+ * @param {string[]} exts File extensions to try appending in order to resolve the file
+ * @param {boolean} isMain Whether the file is the main entry point of the app
+ * @param {string} originalPath The specifier passed to `require`
+ */
 function tryPackage(requestPath, exts, isMain, originalPath) {
   const pkg = _readPackage(requestPath).main;
 
@@ -438,15 +463,12 @@ function tryPackage(requestPath, exts, isMain, originalPath) {
   return actual;
 }
 
-// In order to minimize unnecessary lstat() calls,
-// this cache is a list of known-real paths.
-// Set to an empty Map to reset.
-const realpathCache = new SafeMap();
-
-// Check if the file exists and is not a directory
-// if using --preserve-symlinks and isMain is false,
-// keep symlinks intact, otherwise resolve to the
-// absolute realpath.
+/**
+ * Check if the file exists and is not a directory if using `--preserve-symlinks` and `isMain` is false, keep symlinks
+ * intact, otherwise resolve to the absolute realpath.
+ * @param {string} requestPath The path to the file to load.
+ * @param {boolean} isMain Whether the file is the main module.
+ */
 function tryFile(requestPath, isMain) {
   const rc = _stat(requestPath);
   if (rc !== 0) { return; }
@@ -456,16 +478,15 @@ function tryFile(requestPath, isMain) {
   return toRealPath(requestPath);
 }
 
-function toRealPath(requestPath) {
-  return fs.realpathSync(requestPath, {
-    [internalFS.realpathCacheKey]: realpathCache,
-  });
-}
-
-// Given a path, check if the file exists with any of the set extensions
-function tryExtensions(p, exts, isMain) {
+/**
+ * Given a path, check if the file exists with any of the set extensions.
+ * @param {string} basePath The path and filename without extension
+ * @param {string[]} exts The extensions to try
+ * @param {boolean} isMain Whether the module is the main module
+ */
+function tryExtensions(basePath, exts, isMain) {
   for (let i = 0; i < exts.length; i++) {
-    const filename = tryFile(p + exts[i], isMain);
+    const filename = tryFile(basePath + exts[i], isMain);
 
     if (filename) {
       return filename;
@@ -474,8 +495,10 @@ function tryExtensions(p, exts, isMain) {
   return false;
 }
 
-// Find the longest (possibly multi-dot) extension registered in
-// Module._extensions
+/**
+ * Find the longest (possibly multi-dot) extension registered in `Module._extensions`.
+ * @param {string} filename The filename to find the longest registered extension for.
+ */
 function findLongestRegisteredExtension(filename) {
   const name = path.basename(filename);
   let currentExtension;
@@ -490,6 +513,10 @@ function findLongestRegisteredExtension(filename) {
   return '.js';
 }
 
+/**
+ * Tries to get the absolute file path of the parent module.
+ * @param {Module} parent The parent module object.
+ */
 function trySelfParentPath(parent) {
   if (!parent) { return false; }
 
@@ -504,10 +531,15 @@ function trySelfParentPath(parent) {
   }
 }
 
+/**
+ * Attempt to resolve a module request using the parent module package metadata.
+ * @param {string} parentPath The path of the parent module
+ * @param {string} request The module request to resolve
+ */
 function trySelf(parentPath, request) {
   if (!parentPath) { return false; }
 
-  const { data: pkg, path: pkgPath } = readPackageScope(parentPath);
+  const { data: pkg, path: pkgPath } = packageJsonReader.readPackageScope(parentPath);
   if (!pkg || pkg.exports == null || pkg.name === undefined) {
     return false;
   }
@@ -534,10 +566,18 @@ function trySelf(parentPath, request) {
   }
 }
 
-// This only applies to requests of a specific form:
-// 1. name/.*
-// 2. @scope/name/.*
+/**
+ * This only applies to requests of a specific form:
+ * 1. `name/.*`
+ * 2. `@scope/name/.*`
+ */
 const EXPORTS_PATTERN = /^((?:@[^/\\%]+\/)?[^./\\%][^/\\%]*)(\/.*)?$/;
+
+/**
+ * Resolves the exports for a given module path and request.
+ * @param {string} nmPath The path to the module.
+ * @param {string} request The request for the module.
+ */
 function resolveExports(nmPath, request) {
   // The implementation's behavior is meant to mirror resolution in ESM.
   const { 1: name, 2: expansion = '' } =
@@ -561,9 +601,10 @@ function resolveExports(nmPath, request) {
 }
 
 /**
- * @param {string} request a relative or absolute file path
- * @param {Array<string>} paths file system directories to search as file paths
- * @param {boolean} isMain if the request is the main app entry point
+ * Get the absolute path to a module.
+ * @param {string} request Relative or absolute file path
+ * @param {Array<string>} paths Folders to search as file paths
+ * @param {boolean} isMain Whether the request is the main app entry point
  * @returns {string | false}
  */
 Module._findPath = function(request, paths, isMain) {
@@ -689,11 +730,14 @@ Module._findPath = function(request, paths, isMain) {
   return false;
 };
 
-// 'node_modules' character codes reversed
+/** `node_modules` character codes reversed */
 const nmChars = [ 115, 101, 108, 117, 100, 111, 109, 95, 101, 100, 111, 110 ];
 const nmLen = nmChars.length;
 if (isWindows) {
-  // 'from' is the __dirname of the module.
+  /**
+   * Get the paths to the `node_modules` folder for a given path.
+   * @param {string} from `__dirname` of the module
+   */
   Module._nodeModulePaths = function(from) {
     // Guarantee that 'from' is absolute.
     from = path.resolve(from);
@@ -710,6 +754,7 @@ if (isWindows) {
       return [from + 'node_modules'];
     }
 
+    /** @type {string[]} */
     const paths = [];
     for (let i = from.length - 1, p = 0, last = from.length; i >= 0; --i) {
       const code = StringPrototypeCharCodeAt(from, i);
@@ -741,7 +786,10 @@ if (isWindows) {
     return paths;
   };
 } else { // posix
-  // 'from' is the __dirname of the module.
+  /**
+   * Get the paths to the `node_modules` folder for a given path.
+   * @param {string} from `__dirname` of the module
+   */
   Module._nodeModulePaths = function(from) {
     // Guarantee that 'from' is absolute.
     from = path.resolve(from);
@@ -754,6 +802,7 @@ if (isWindows) {
     // note: this approach *only* works when the path is guaranteed
     // to be absolute.  Doing a fully-edge-case-correct path.split
     // that works on both Windows and Posix is non-trivial.
+    /** @type {string[]} */
     const paths = [];
     for (let i = from.length - 1, p = 0, last = from.length; i >= 0; --i) {
       const code = StringPrototypeCharCodeAt(from, i);
@@ -782,6 +831,11 @@ if (isWindows) {
   };
 }
 
+/**
+ * Get the paths for module resolution.
+ * @param {string} request
+ * @param {Module} parent
+ */
 Module._resolveLookupPaths = function(request, parent) {
   if (BuiltinModule.normalizeRequirableId(request)) {
     debug('looking for %j in []', request);
@@ -795,6 +849,7 @@ Module._resolveLookupPaths = function(request, parent) {
       StringPrototypeCharAt(request, 1) !== '/' &&
       (!isWindows || StringPrototypeCharAt(request, 1) !== '\\'))) {
 
+    /** @type {string[]} */
     let paths;
     if (parent?.paths?.length) {
       paths = ArrayPrototypeSlice(modulePaths);
@@ -824,6 +879,10 @@ Module._resolveLookupPaths = function(request, parent) {
   return parentDir;
 };
 
+/**
+ * Emits a warning when a non-existent property of module exports is accessed inside a circular dependency.
+ * @param {string} prop The name of the non-existent property.
+ */
 function emitCircularRequireWarning(prop) {
   process.emitWarning(
     `Accessing non-existent property '${String(prop)}' of module exports ` +
@@ -854,6 +913,12 @@ const CircularRequirePrototypeWarningProxy = new Proxy({}, {
   },
 });
 
+/**
+ * Returns the exports object for a module that has a circular `require`.
+ * If the exports object is a plain object, it is wrapped in a proxy that warns
+ * about circular dependencies.
+ * @param {Module} module The module instance
+ */
 function getExportsForCircularRequire(module) {
   if (module.exports &&
       !isProxy(module.exports) &&
@@ -871,13 +936,17 @@ function getExportsForCircularRequire(module) {
   return module.exports;
 }
 
-// Check the cache for the requested file.
-// 1. If a module already exists in the cache: return its exports object.
-// 2. If the module is native: call
-//    `BuiltinModule.prototype.compileForPublicLoader()` and return the exports.
-// 3. Otherwise, create a new module for the file and save it to the cache.
-//    Then have it load  the file contents before returning its exports
-//    object.
+/**
+ * Load a module from cache if it exists, otherwise create a new module instance.
+ * 1. If a module already exists in the cache: return its exports object.
+ * 2. If the module is native: call
+ *    `BuiltinModule.prototype.compileForPublicLoader()` and return the exports.
+ * 3. Otherwise, create a new module for the file and save it to the cache.
+ *    Then have it load the file contents before returning its exports object.
+ * @param {string} request Specifier of module to load via `require`
+ * @param {string} parent Absolute path of the module importing the child
+ * @param {boolean} isMain Whether the module is the main entry point
+ */
 Module._load = function(request, parent, isMain) {
   let relResolveCacheIdentifier;
   if (parent) {
@@ -977,6 +1046,15 @@ Module._load = function(request, parent, isMain) {
   return module.exports;
 };
 
+/**
+ * Given a `require` string and its context, get its absolute file path.
+ * @param {string} request The specifier to resolve
+ * @param {Module} parent The module containing the `require` call
+ * @param {boolean} isMain Whether the module is the main entry point
+ * @param {ResolveFilenameOptions} options Options object
+ * @typedef {object} ResolveFilenameOptions
+ * @property {string[]} paths Paths to search for modules in
+ */
 Module._resolveFilename = function(request, parent, isMain, options) {
   if (BuiltinModule.normalizeRequirableId(request)) {
     return request;
@@ -1021,7 +1099,7 @@ Module._resolveFilename = function(request, parent, isMain, options) {
 
   if (request[0] === '#' && (parent?.filename || parent?.id === '<repl>')) {
     const parentPath = parent?.filename ?? process.cwd() + path.sep;
-    const pkg = readPackageScope(parentPath) || { __proto__: null };
+    const pkg = packageJsonReader.readPackageScope(parentPath) || { __proto__: null };
     if (pkg.data?.imports != null) {
       try {
         const { packageImportsResolve } = require('internal/modules/esm/resolve');
@@ -1069,6 +1147,14 @@ Module._resolveFilename = function(request, parent, isMain, options) {
   throw err;
 };
 
+/**
+ * Finishes resolving an ES module specifier into an absolute file path.
+ * @param {string} resolved The resolved module specifier
+ * @param {string} parentPath The path of the parent module
+ * @param {string} pkgPath The path of the package.json file
+ * @throws {ERR_INVALID_MODULE_SPECIFIER} If the resolved module specifier contains encoded `/` or `\\` characters
+ * @throws {Error} If the module cannot be found
+ */
 function finalizeEsmResolution(resolved, parentPath, pkgPath) {
   const { encodedSepRegEx } = require('internal/modules/esm/resolve');
   if (RegExpPrototypeExec(encodedSepRegEx, resolved) !== null) {
@@ -1085,6 +1171,11 @@ function finalizeEsmResolution(resolved, parentPath, pkgPath) {
   throw err;
 }
 
+/**
+ * Creates an error object for when a requested ES module cannot be found.
+ * @param {string} request The name of the requested module
+ * @param {string} [path] The path to the requested module
+ */
 function createEsmNotFoundErr(request, path) {
   // eslint-disable-next-line no-restricted-syntax
   const err = new Error(`Cannot find module '${request}'`);
@@ -1096,7 +1187,10 @@ function createEsmNotFoundErr(request, path) {
   return err;
 }
 
-// Given a file name, pass it to the proper extension handler.
+/**
+ * Given a file name, pass it to the proper extension handler.
+ * @param {string} filename The `require` specifier
+ */
 Module.prototype.load = function(filename) {
   debug('load %j for module %j', filename, this.id);
 
@@ -1124,9 +1218,12 @@ Module.prototype.load = function(filename) {
   }
 };
 
-// Loads a module at the given file path. Returns that module's
-// `exports` property.
-// Note: when using the experimental policy mechanism this function is overridden
+/**
+ * Loads a module at the given file path. Returns that module's `exports` property.
+ * Note: when using the experimental policy mechanism this function is overridden.
+ * @param {string} id
+ * @throws {ERR_INVALID_ARG_TYPE} When `id` is not a string
+ */
 Module.prototype.require = function(id) {
   validateString(id, 'id');
   if (id === '') {
@@ -1141,53 +1238,66 @@ Module.prototype.require = function(id) {
   }
 };
 
-// Resolved path to process.argv[1] will be lazily placed here
-// (needed for setting breakpoint when called with --inspect-brk)
+/**
+ * Resolved path to `process.argv[1]` will be lazily placed here
+ * (needed for setting breakpoint when called with `--inspect-brk`).
+ * @type {string | undefined}
+ */
 let resolvedArgv;
 let hasPausedEntry = false;
-let Script;
+/** @type {import('vm').Script} */
+
+/**
+ * Wraps the given content in a script and runs it in a new context.
+ * @param {string} filename The name of the file being loaded
+ * @param {string} content The content of the file being loaded
+ * @param {Module} cjsModuleInstance The CommonJS loader instance
+ * @param {object} codeCache The SEA code cache
+ */
 function wrapSafe(filename, content, cjsModuleInstance, codeCache) {
+  const hostDefinedOptionId = Symbol(`cjs:${filename}`);
+  async function importModuleDynamically(specifier, _, importAttributes) {
+    const cascadedLoader = getCascadedLoader();
+    return cascadedLoader.import(specifier, normalizeReferrerURL(filename),
+                                 importAttributes);
+  }
   if (patched) {
-    const wrapper = Module.wrap(content);
-    if (Script === undefined) {
-      ({ Script } = require('vm'));
-    }
-    const script = new Script(wrapper, {
-      filename,
-      lineOffset: 0,
-      importModuleDynamically: async (specifier, _, importAssertions) => {
-        const cascadedLoader = getCascadedLoader();
-        return cascadedLoader.import(specifier, normalizeReferrerURL(filename),
-                                     importAssertions);
-      },
-    });
+    const wrapped = Module.wrap(content);
+    const script = makeContextifyScript(
+      wrapped,                 // code
+      filename,                // filename
+      0,                       // lineOffset
+      0,                       // columnOffset
+      undefined,               // cachedData
+      false,                   // produceCachedData
+      undefined,               // parsingContext
+      hostDefinedOptionId,     // hostDefinedOptionId
+      importModuleDynamically, // importModuleDynamically
+    );
 
     // Cache the source map for the module if present.
     if (script.sourceMapURL) {
       maybeCacheSourceMap(filename, content, this, false, undefined, script.sourceMapURL);
     }
 
-    return script.runInThisContext({
-      displayErrors: true,
-    });
+    return runScriptInThisContext(script, true, false);
   }
 
+  const params = [ 'exports', 'require', 'module', '__filename', '__dirname' ];
   try {
-    const result = internalCompileFunction(content, [
-      'exports',
-      'require',
-      'module',
-      '__filename',
-      '__dirname',
-    ], {
-      filename,
-      cachedData: codeCache,
-      importModuleDynamically(specifier, _, importAssertions) {
-        const cascadedLoader = getCascadedLoader();
-        return cascadedLoader.import(specifier, normalizeReferrerURL(filename),
-                                     importAssertions);
-      },
-    });
+    const result = internalCompileFunction(
+      content,                           // code,
+      filename,                          // filename
+      0,                                 // lineOffset
+      0,                                 // columnOffset,
+      codeCache,                         // cachedData
+      false,                             // produceCachedData
+      undefined,                         // parsingContext
+      undefined,                         // contextExtensions
+      params,                            // params
+      hostDefinedOptionId,               // hostDefinedOptionId
+      importModuleDynamically,           // importModuleDynamically
+    );
 
     // The code cache is used for SEAs only.
     if (codeCache &&
@@ -1211,10 +1321,12 @@ function wrapSafe(filename, content, cjsModuleInstance, codeCache) {
   }
 }
 
-// Run the file contents in the correct scope or sandbox. Expose
-// the correct helper variables (require, module, exports) to
-// the file.
-// Returns exception, if any.
+/**
+ * Run the file contents in the correct scope or sandbox. Expose the correct helper variables (`require`, `module`,
+ * `exports`) to the file. Returns exception, if any.
+ * @param {string} content The source code of the module
+ * @param {string} filename The file path of the module
+ */
 Module.prototype._compile = function(content, filename) {
   let moduleURL;
   let redirects;
@@ -1269,7 +1381,11 @@ Module.prototype._compile = function(content, filename) {
   return result;
 };
 
-// Native extension for .js
+/**
+ * Native handler for `.js` files.
+ * @param {Module} module The module to compile
+ * @param {string} filename The file path of the module
+ */
 Module._extensions['.js'] = function(module, filename) {
   // If already analyzed the source, then it will be cached.
   const cached = cjsParseCache.get(module);
@@ -1281,7 +1397,7 @@ Module._extensions['.js'] = function(module, filename) {
     content = fs.readFileSync(filename, 'utf8');
   }
   if (StringPrototypeEndsWith(filename, '.js')) {
-    const pkg = readPackageScope(filename) || { __proto__: null };
+    const pkg = packageJsonReader.readPackageScope(filename) || { __proto__: null };
     // Function require shouldn't be used in ES modules.
     if (pkg.data?.type === 'module') {
       const parent = moduleParentCache.get(module);
@@ -1318,8 +1434,11 @@ Module._extensions['.js'] = function(module, filename) {
   module._compile(content, filename);
 };
 
-
-// Native extension for .json
+/**
+ * Native handler for `.json` files.
+ * @param {Module} module The module to compile
+ * @param {string} filename The file path of the module
+ */
 Module._extensions['.json'] = function(module, filename) {
   const content = fs.readFileSync(filename, 'utf8');
 
@@ -1337,8 +1456,11 @@ Module._extensions['.json'] = function(module, filename) {
   }
 };
 
-
-// Native extension for .node
+/**
+ * Native handler for `.node` files.
+ * @param {Module} module The module to compile
+ * @param {string} filename The file path of the module
+ */
 Module._extensions['.node'] = function(module, filename) {
   const manifest = policy()?.manifest;
   if (manifest) {
@@ -1350,6 +1472,10 @@ Module._extensions['.node'] = function(module, filename) {
   return process.dlopen(module, path.toNamespacedPath(filename));
 };
 
+/**
+ * Creates a `require` function that can be used to load modules from the specified path.
+ * @param {string} filename The path to the module
+ */
 function createRequireFromPath(filename) {
   // Allow a directory to be passed as the filename
   const trailingSlash =
@@ -1370,6 +1496,12 @@ function createRequireFromPath(filename) {
 const createRequireError = 'must be a file URL object, file URL string, or ' +
   'absolute path string';
 
+/**
+ * Creates a new `require` function that can be used to load modules.
+ * @param {string | URL} filename The path or URL to the module context for this `require`
+ * @throws {ERR_INVALID_ARG_VALUE} If `filename` is not a string or URL, or if it is a relative path that cannot be
+ * resolved to an absolute path.
+ */
 function createRequire(filename) {
   let filepath;
 
@@ -1391,6 +1523,9 @@ function createRequire(filename) {
 
 Module.createRequire = createRequire;
 
+/**
+ * Define the paths to use for resolving a module.
+ */
 Module._initPaths = function() {
   const homeDir = isWindows ? process.env.USERPROFILE : safeGetenv('HOME');
   const nodePath = isWindows ? process.env.NODE_PATH : safeGetenv('NODE_PATH');
@@ -1421,6 +1556,10 @@ Module._initPaths = function() {
   Module.globalPaths = ArrayPrototypeSlice(modulePaths);
 };
 
+/**
+ * Handle modules loaded via `--require`.
+ * @param {string[]} requests The values of `--require`
+ */
 Module._preloadModules = function(requests) {
   if (!ArrayIsArray(requests)) { return; }
 
@@ -1444,6 +1583,10 @@ Module._preloadModules = function(requests) {
   isPreloading = false;
 };
 
+/**
+ * If the user has overridden an export from a builtin module, this function can ensure that the override is used in
+ * both CommonJS and ES module contexts.
+ */
 Module.syncBuiltinESMExports = function syncBuiltinESMExports() {
   for (const mod of BuiltinModule.map.values()) {
     if (BuiltinModule.canBeRequiredWithoutScheme(mod.id)) {
diff --git a/lib/internal/modules/esm/assert.js b/lib/internal/modules/esm/assert.js
index 45df6781d49497..ce3280de84bf4d 100644
--- a/lib/internal/modules/esm/assert.js
+++ b/lib/internal/modules/esm/assert.js
@@ -13,16 +13,15 @@ const {
   ERR_IMPORT_ASSERTION_TYPE_FAILED,
   ERR_IMPORT_ASSERTION_TYPE_MISSING,
   ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED,
+  ERR_IMPORT_ATTRIBUTE_UNSUPPORTED,
 } = require('internal/errors').codes;
 
 // The HTML spec has an implied default type of `'javascript'`.
 const kImplicitAssertType = 'javascript';
 
-let alreadyWarned = false;
-
 /**
- * Define a map of module formats to import assertion types (the value of
- * `type` in `assert { type: 'json' }`).
+ * Define a map of module formats to import attributes types (the value of
+ * `type` in `with { type: 'json' }`).
  * @type {Map<string, string>}
  */
 const formatTypeMap = {
@@ -31,13 +30,13 @@ const formatTypeMap = {
   'commonjs': kImplicitAssertType,
   'json': 'json',
   'module': kImplicitAssertType,
-  'wasm': kImplicitAssertType, // It's unclear whether the HTML spec will require an assertion type or not for Wasm; see https://github.com/WebAssembly/esm-integration/issues/42
+  'wasm': kImplicitAssertType, // It's unclear whether the HTML spec will require an attribute type or not for Wasm; see https://github.com/WebAssembly/esm-integration/issues/42
 };
 
 /**
  * The HTML spec disallows the default type to be explicitly specified
  * (for now); so `import './file.js'` is okay but
- * `import './file.js' assert { type: 'javascript' }` throws.
+ * `import './file.js' with { type: 'javascript' }` throws.
  * @type {Array<string, string>}
  */
 const supportedAssertionTypes = ArrayPrototypeFilter(
@@ -46,54 +45,50 @@ const supportedAssertionTypes = ArrayPrototypeFilter(
 
 
 /**
- * Test a module's import assertions.
+ * Test a module's import attributes.
  * @param {string} url The URL of the imported module, for error reporting.
  * @param {string} format One of Node's supported translators
- * @param {Record<string, string>} importAssertions Validations for the
+ * @param {Record<string, string>} importAttributes Validations for the
  *                                                  module import.
  * @returns {true}
  * @throws {TypeError} If the format and assertion type are incompatible.
  */
-function validateAssertions(url, format,
-                            importAssertions = { __proto__: null }) {
-  const validType = formatTypeMap[format];
-
-  if (!alreadyWarned && ObjectKeys(importAssertions).length !== 0) {
-    alreadyWarned = true;
-    process.emitWarning(
-      'Import assertions are not a stable feature of the JavaScript language. ' +
-      'Avoid relying on their current behavior and syntax as those might change ' +
-      'in a future version of Node.js.',
-      'ExperimentalWarning',
-    );
+function validateAttributes(url, format,
+                            importAttributes = { __proto__: null }) {
+  const keys = ObjectKeys(importAttributes);
+  for (let i = 0; i < keys.length; i++) {
+    if (keys[i] !== 'type') {
+      throw new ERR_IMPORT_ATTRIBUTE_UNSUPPORTED(keys[i], importAttributes[keys[i]]);
+    }
   }
+  const validType = formatTypeMap[format];
 
   switch (validType) {
     case undefined:
-      // Ignore assertions for module formats we don't recognize, to allow new
+      // Ignore attributes for module formats we don't recognize, to allow new
       // formats in the future.
       return true;
 
     case kImplicitAssertType:
       // This format doesn't allow an import assertion type, so the property
-      // must not be set on the import assertions object.
-      if (!ObjectPrototypeHasOwnProperty(importAssertions, 'type')) {
+      // must not be set on the import attributes object.
+      if (!ObjectPrototypeHasOwnProperty(importAttributes, 'type')) {
         return true;
       }
-      return handleInvalidType(url, importAssertions.type);
+      return handleInvalidType(url, importAttributes.type);
 
-    case importAssertions.type:
+    case importAttributes.type:
       // The asserted type is the valid type for this format.
       return true;
 
     default:
       // There is an expected type for this format, but the value of
-      // `importAssertions.type` might not have been it.
-      if (!ObjectPrototypeHasOwnProperty(importAssertions, 'type')) {
+      // `importAttributes.type` might not have been it.
+      if (!ObjectPrototypeHasOwnProperty(importAttributes, 'type')) {
         // `type` wasn't specified at all.
         throw new ERR_IMPORT_ASSERTION_TYPE_MISSING(url, validType);
       }
-      return handleInvalidType(url, importAssertions.type);
+      return handleInvalidType(url, importAttributes.type);
   }
 }
 
@@ -118,5 +113,5 @@ function handleInvalidType(url, type) {
 
 module.exports = {
   kImplicitAssertType,
-  validateAssertions,
+  validateAttributes,
 };
diff --git a/lib/internal/modules/esm/create_dynamic_module.js b/lib/internal/modules/esm/create_dynamic_module.js
index 7df2290d4a8e6d..d4f5a85db95f77 100644
--- a/lib/internal/modules/esm/create_dynamic_module.js
+++ b/lib/internal/modules/esm/create_dynamic_module.js
@@ -11,22 +11,43 @@ let debug = require('internal/util/debuglog').debuglog('esm', (fn) => {
   debug = fn;
 });
 
+/**
+ * Creates an import statement for a given module path and index.
+ * @param {string} impt - The module path to import.
+ * @param {number} index - The index of the import statement.
+ */
 function createImport(impt, index) {
   const imptPath = JSONStringify(impt);
   return `import * as $import_${index} from ${imptPath};
 import.meta.imports[${imptPath}] = $import_${index};`;
 }
 
-function createExport(expt) {
-  const name = `${expt}`;
-  return `let $${name};
-export { $${name} as ${name} };
-import.meta.exports.${name} = {
-  get: () => $${name},
-  set: (v) => $${name} = v,
+/**
+ * Creates an export for a given module.
+ * @param {string} expt - The name of the export.
+ * @param {number} index - The index of the export statement.
+ */
+function createExport(expt, index) {
+  const nameStringLit = JSONStringify(expt);
+  return `let $export_${index};
+export { $export_${index} as ${nameStringLit} };
+import.meta.exports[${nameStringLit}] = {
+  get: () => $export_${index},
+  set: (v) => $export_${index} = v,
 };`;
 }
 
+/**
+ * Creates a dynamic module with the given imports, exports, URL, and evaluate function.
+ * @param {string[]} imports - An array of imports.
+ * @param {string[]} exports - An array of exports.
+ * @param {string} [url=''] - The URL of the module.
+ * @param {(reflect: DynamicModuleReflect) => void} evaluate - The function to evaluate the module.
+ * @typedef {object} DynamicModuleReflect
+ * @property {string[]} imports - The imports of the module.
+ * @property {string[]} exports - The exports of the module.
+ * @property {(cb: (reflect: DynamicModuleReflect) => void) => void} onReady - Callback to evaluate the module.
+ */
 const createDynamicModule = (imports, exports, url = '', evaluate) => {
   debug('creating ESM facade for %s with exports: %j', url, exports);
   const source = `
@@ -38,6 +59,7 @@ import.meta.done();
   const m = new ModuleWrap(`${url}`, undefined, source, 0, 0);
 
   const readyfns = new SafeSet();
+  /** @type {DynamicModuleReflect} */
   const reflect = {
     exports: { __proto__: null },
     onReady: (cb) => { readyfns.add(cb); },
diff --git a/lib/internal/modules/esm/fetch_module.js b/lib/internal/modules/esm/fetch_module.js
index ca5c9c83c316de..21b7456899604f 100644
--- a/lib/internal/modules/esm/fetch_module.js
+++ b/lib/internal/modules/esm/fetch_module.js
@@ -44,37 +44,56 @@ const cacheForGET = new SafeMap();
 // [2] Creating a new agent instead of using the gloabl agent improves
 // performance and precludes the agent becoming tainted.
 
+/** @type {import('https').Agent} The Cached HTTP Agent for **secure** HTTP requests. */
 let HTTPSAgent;
-function HTTPSGet(url, opts) {
+/**
+ * Make a HTTPs GET request (handling agent setup if needed, caching the agent to avoid
+ * redudant instantiations).
+ * @param {Parameters<import('https').get>[0]} input - The URI to fetch.
+ * @param {Parameters<import('https').get>[1]} options - See https.get() options.
+ */
+function HTTPSGet(input, options) {
   const https = require('https'); // [1]
   HTTPSAgent ??= new https.Agent({ // [2]
     keepAlive: true,
   });
-  return https.get(url, {
+  return https.get(input, {
     agent: HTTPSAgent,
-    ...opts,
+    ...options,
   });
 }
 
+/** @type {import('https').Agent} The Cached HTTP Agent for **insecure** HTTP requests. */
 let HTTPAgent;
-function HTTPGet(url, opts) {
+/**
+ * Make a HTTP GET request (handling agent setup if needed, caching the agent to avoid
+ * redudant instantiations).
+ * @param {Parameters<import('http').get>[0]} input - The URI to fetch.
+ * @param {Parameters<import('http').get>[1]} options - See http.get() options.
+ */
+function HTTPGet(input, options) {
   const http = require('http'); // [1]
   HTTPAgent ??= new http.Agent({ // [2]
     keepAlive: true,
   });
-  return http.get(url, {
+  return http.get(input, {
     agent: HTTPAgent,
-    ...opts,
+    ...options,
   });
 }
 
-function dnsLookup(name, opts) {
+/** @type {import('../../dns/promises.js').lookup} */
+function dnsLookup(hostname, options) {
   // eslint-disable-next-line no-func-assign
   dnsLookup = require('dns/promises').lookup;
-  return dnsLookup(name, opts);
+  return dnsLookup(hostname, options);
 }
 
 let zlib;
+/**
+ * Create a decompressor for the Brotli format.
+ * @returns {import('zlib').BrotliDecompress}
+ */
 function createBrotliDecompress() {
   zlib ??= require('zlib'); // [1]
   // eslint-disable-next-line no-func-assign
@@ -82,6 +101,10 @@ function createBrotliDecompress() {
   return createBrotliDecompress();
 }
 
+/**
+ * Create an unzip handler.
+ * @returns {import('zlib').Unzip}
+ */
 function createUnzip() {
   zlib ??= require('zlib'); // [1]
   // eslint-disable-next-line no-func-assign
diff --git a/lib/internal/modules/esm/formats.js b/lib/internal/modules/esm/formats.js
index 4ab9aa6f032b7e..2d69a3e93c3a75 100644
--- a/lib/internal/modules/esm/formats.js
+++ b/lib/internal/modules/esm/formats.js
@@ -1,9 +1,11 @@
 'use strict';
 
-const {
-  RegExpPrototypeExec,
-} = primordials;
+const { RegExpPrototypeExec } = primordials;
 const { getOptionValue } = require('internal/options');
+const { getValidatedPath } = require('internal/fs/utils');
+const pathModule = require('path');
+const fsBindings = internalBinding('fs');
+const { fs: fsConstants } = internalBinding('constants');
 
 const experimentalWasmModules = getOptionValue('--experimental-wasm-modules');
 
@@ -35,7 +37,27 @@ function mimeToFormat(mime) {
   return null;
 }
 
+/**
+ * For extensionless files in a `module` package scope, or a default `module` scope enabled by the
+ * `--experimental-default-type` flag, we check the file contents to disambiguate between ES module JavaScript and Wasm.
+ * We do this by taking advantage of the fact that all Wasm files start with the header `0x00 0x61 0x73 0x6d` (`_asm`).
+ * @param {URL} url
+ */
+function getFormatOfExtensionlessFile(url) {
+  if (!experimentalWasmModules) { return 'module'; }
+
+  const path = pathModule.toNamespacedPath(getValidatedPath(url));
+
+  switch (fsBindings.getFormatOfExtensionlessFile(path)) {
+    case fsConstants.EXTENSIONLESS_FORMAT_WASM:
+      return 'wasm';
+    default:
+      return 'module';
+  }
+}
+
 module.exports = {
   extensionFormatMap,
+  getFormatOfExtensionlessFile,
   mimeToFormat,
 };
diff --git a/lib/internal/modules/esm/get_format.js b/lib/internal/modules/esm/get_format.js
index b3c8a56c06c1cc..56d002ca0883ad 100644
--- a/lib/internal/modules/esm/get_format.js
+++ b/lib/internal/modules/esm/get_format.js
@@ -1,22 +1,27 @@
 'use strict';
+
 const {
   RegExpPrototypeExec,
   ObjectPrototypeHasOwnProperty,
   PromisePrototypeThen,
   PromiseResolve,
+  StringPrototypeIncludes,
   StringPrototypeCharCodeAt,
   StringPrototypeSlice,
 } = primordials;
-const { basename, relative } = require('path');
 const { getOptionValue } = require('internal/options');
 const {
   extensionFormatMap,
+  getFormatOfExtensionlessFile,
   mimeToFormat,
 } = require('internal/modules/esm/formats');
 
 const experimentalNetworkImports =
   getOptionValue('--experimental-network-imports');
-const { getPackageType, getPackageScopeConfig } = require('internal/modules/esm/resolve');
+const defaultTypeFlag = getOptionValue('--experimental-default-type');
+// The next line is where we flip the default to ES modules someday.
+const defaultType = defaultTypeFlag === 'module' ? 'module' : 'commonjs';
+const { getPackageType } = require('internal/modules/esm/resolve');
 const { fileURLToPath } = require('internal/url');
 const { ERR_UNKNOWN_FILE_EXTENSION } = require('internal/errors').codes;
 
@@ -66,6 +71,18 @@ function extname(url) {
   return '';
 }
 
+/**
+ * Determine whether the given file URL is under a `node_modules` folder.
+ * This function assumes that the input has already been verified to be a `file:` URL,
+ * and is a file rather than a folder.
+ * @param {URL} url
+ */
+function underNodeModules(url) {
+  if (url.protocol !== 'file:') { return false; } // We determine module types for other protocols based on MIME header
+
+  return StringPrototypeIncludes(url.pathname, '/node_modules/');
+}
+
 /**
  * @param {URL} url
  * @param {{parentURL: string}} context
@@ -74,8 +91,36 @@ function extname(url) {
  */
 function getFileProtocolModuleFormat(url, context, ignoreErrors) {
   const ext = extname(url);
+
   if (ext === '.js') {
-    return getPackageType(url) === 'module' ? 'module' : 'commonjs';
+    const packageType = getPackageType(url);
+    if (packageType !== 'none') {
+      return packageType;
+    }
+    // The controlling `package.json` file has no `type` field.
+    if (defaultType === 'module') {
+      // An exception to the type flag making ESM the default everywhere is that package scopes under `node_modules`
+      // should retain the assumption that a lack of a `type` field means CommonJS.
+      return underNodeModules(url) ? 'commonjs' : 'module';
+    }
+    return 'commonjs';
+  }
+
+  if (ext === '') {
+    const packageType = getPackageType(url);
+    if (defaultType === 'commonjs') { // Legacy behavior
+      if (packageType === 'none' || packageType === 'commonjs') {
+        return 'commonjs';
+      } // Else packageType === 'module'
+      return getFormatOfExtensionlessFile(url);
+    } // Else defaultType === 'module'
+    if (underNodeModules(url)) { // Exception for package scopes under `node_modules`
+      return packageType === 'module' ? getFormatOfExtensionlessFile(url) : 'commonjs';
+    }
+    if (packageType === 'none' || packageType === 'module') {
+      return getFormatOfExtensionlessFile(url);
+    } // Else packageType === 'commonjs'
+    return 'commonjs';
   }
 
   const format = extensionFormatMap[ext];
@@ -84,19 +129,7 @@ function getFileProtocolModuleFormat(url, context, ignoreErrors) {
   // Explicit undefined return indicates load hook should rerun format check
   if (ignoreErrors) { return undefined; }
   const filepath = fileURLToPath(url);
-  let suggestion = '';
-  if (getPackageType(url) === 'module' && ext === '') {
-    const config = getPackageScopeConfig(url);
-    const fileBasename = basename(filepath);
-    const relativePath = StringPrototypeSlice(relative(config.pjsonPath, filepath), 1);
-    suggestion = 'Loading extensionless files is not supported inside of ' +
-      '"type":"module" package.json contexts. The package.json file ' +
-      `${config.pjsonPath} caused this "type":"module" context. Try ` +
-      `changing ${filepath} to have a file extension. Note the "bin" ` +
-      'field of package.json can point to a file with an extension, for example ' +
-      `{"type":"module","bin":{"${fileBasename}":"${relativePath}.js"}}`;
-  }
-  throw new ERR_UNKNOWN_FILE_EXTENSION(ext, filepath, suggestion);
+  throw new ERR_UNKNOWN_FILE_EXTENSION(ext, filepath);
 }
 
 /**
diff --git a/lib/internal/modules/esm/handle_process_exit.js b/lib/internal/modules/esm/handle_process_exit.js
index 9d6b609ef1cfc3..4689ef6bb204c0 100644
--- a/lib/internal/modules/esm/handle_process_exit.js
+++ b/lib/internal/modules/esm/handle_process_exit.js
@@ -2,9 +2,11 @@
 
 const { exitCodes: { kUnfinishedTopLevelAwait } } = internalBinding('errors');
 
-// Handle a Promise from running code that potentially does Top-Level Await.
-// In that case, it makes sense to set the exit code to a specific non-zero
-// value if the main code never finishes running.
+/**
+ * Handle a Promise from running code that potentially does Top-Level Await.
+ * In that case, it makes sense to set the exit code to a specific non-zero value
+ * if the main code never finishes running.
+ */
 function handleProcessExit() {
   process.exitCode ??= kUnfinishedTopLevelAwait;
 }
diff --git a/lib/internal/modules/esm/hooks.js b/lib/internal/modules/esm/hooks.js
index 8ad4d00bbfe06f..cb2bc456dbb8f1 100644
--- a/lib/internal/modules/esm/hooks.js
+++ b/lib/internal/modules/esm/hooks.js
@@ -3,11 +3,15 @@
 const {
   ArrayPrototypePush,
   ArrayPrototypePushApply,
+  AtomicsLoad,
+  AtomicsWait,
+  AtomicsWaitAsync,
   Int32Array,
   ObjectAssign,
   ObjectDefineProperty,
   ObjectSetPrototypeOf,
   Promise,
+  ReflectSet,
   SafeSet,
   StringPrototypeSlice,
   StringPrototypeToUpperCase,
@@ -15,11 +19,6 @@ const {
 } = primordials;
 
 const {
-  Atomics: {
-    load: AtomicsLoad,
-    wait: AtomicsWait,
-    waitAsync: AtomicsWaitAsync,
-  },
   SharedArrayBuffer,
 } = globalThis;
 
@@ -67,6 +66,30 @@ let debug = require('internal/util/debuglog').debuglog('esm', (fn) => {
 });
 let importMetaInitializer;
 
+let importAssertionAlreadyWarned = false;
+
+function emitImportAssertionWarning() {
+  if (!importAssertionAlreadyWarned) {
+    importAssertionAlreadyWarned = true;
+    process.emitWarning('Use `importAttributes` instead of `importAssertions`', 'ExperimentalWarning');
+  }
+}
+
+function defineImportAssertionAlias(context) {
+  return ObjectDefineProperty(context, 'importAssertions', {
+    __proto__: null,
+    configurable: true,
+    get() {
+      emitImportAssertionWarning();
+      return this.importAttributes;
+    },
+    set(value) {
+      emitImportAssertionWarning();
+      return ReflectSet(this, 'importAttributes', value);
+    },
+  });
+}
+
 /**
  * @typedef {object} ExportedHooks
  * @property {Function} resolve Resolve hook.
@@ -166,21 +189,21 @@ class Hooks {
    * @param {string} originalSpecifier The specified URL path of the module to
    *                                   be resolved.
    * @param {string} [parentURL] The URL path of the module's parent.
-   * @param {ImportAssertions} [importAssertions] Assertions from the import
+   * @param {ImportAttributes} [importAttributes] Attributes from the import
    *                                              statement or expression.
    * @returns {Promise<{ format: string, url: URL['href'] }>}
    */
   async resolve(
     originalSpecifier,
     parentURL,
-    importAssertions = { __proto__: null },
+    importAttributes = { __proto__: null },
   ) {
     throwIfInvalidParentURL(parentURL);
 
     const chain = this.#chains.resolve;
     const context = {
       conditions: getDefaultConditions(),
-      importAssertions,
+      importAttributes,
       parentURL,
     };
     const meta = {
@@ -222,9 +245,9 @@ class Hooks {
       throw new ERR_LOADER_CHAIN_INCOMPLETE(hookErrIdentifier);
     }
 
+    let resolvedImportAttributes;
     const {
       format,
-      importAssertions: resolvedImportAssertions,
       url,
     } = resolution;
 
@@ -254,15 +277,22 @@ class Hooks {
       this.#validatedUrls.add(url);
     }
 
+    if (!('importAttributes' in resolution) && ('importAssertions' in resolution)) {
+      emitImportAssertionWarning();
+      resolvedImportAttributes = resolution.importAssertions;
+    } else {
+      resolvedImportAttributes = resolution.importAttributes;
+    }
+
     if (
-      resolvedImportAssertions != null &&
-      typeof resolvedImportAssertions !== 'object'
+      resolvedImportAttributes != null &&
+      typeof resolvedImportAttributes !== 'object'
     ) {
       throw new ERR_INVALID_RETURN_PROPERTY_VALUE(
         'an object',
         hookErrIdentifier,
-        'importAssertions',
-        resolvedImportAssertions,
+        'importAttributes',
+        resolvedImportAttributes,
       );
     }
 
@@ -281,12 +311,12 @@ class Hooks {
     return {
       __proto__: null,
       format,
-      importAssertions: resolvedImportAssertions,
+      importAttributes: resolvedImportAttributes,
       url,
     };
   }
 
-  resolveSync(_originalSpecifier, _parentURL, _importAssertions) {
+  resolveSync(_originalSpecifier, _parentURL, _importAttributes) {
     throw new ERR_METHOD_NOT_IMPLEMENTED('resolveSync()');
   }
 
@@ -349,7 +379,7 @@ class Hooks {
 
     const nextLoad = nextHookFactory(chain[chain.length - 1], meta, { validateArgs, validateOutput });
 
-    const loaded = await nextLoad(url, context);
+    const loaded = await nextLoad(url, defineImportAssertionAlias(context));
     const { hookErrIdentifier } = meta; // Retrieve the value after all settled
 
     validateOutput(hookErrIdentifier, loaded);
@@ -407,7 +437,7 @@ class Hooks {
       !isAnyArrayBuffer(source) &&
       !isArrayBufferView(source)
     ) {
-      throw ERR_INVALID_RETURN_PROPERTY_VALUE(
+      throw new ERR_INVALID_RETURN_PROPERTY_VALUE(
         'a string, an ArrayBuffer, or a TypedArray',
         hookErrIdentifier,
         'source',
@@ -599,7 +629,7 @@ class HooksProxy {
     if (status === 'error') {
       if (body == null || typeof body !== 'object') { throw body; }
       if (body.serializationFailed || body.serialized == null) {
-        throw ERR_WORKER_UNSERIALIZABLE_ERROR();
+        throw new ERR_WORKER_UNSERIALIZABLE_ERROR();
       }
 
       // eslint-disable-next-line no-restricted-syntax
diff --git a/lib/internal/modules/esm/load.js b/lib/internal/modules/esm/load.js
index d064296d11c463..1881745a6d3134 100644
--- a/lib/internal/modules/esm/load.js
+++ b/lib/internal/modules/esm/load.js
@@ -8,7 +8,7 @@ const {
 const { kEmptyObject } = require('internal/util');
 
 const { defaultGetFormat } = require('internal/modules/esm/get_format');
-const { validateAssertions } = require('internal/modules/esm/assert');
+const { validateAttributes, emitImportAssertionWarning } = require('internal/modules/esm/assert');
 const { getOptionValue } = require('internal/options');
 const { readFileSync } = require('fs');
 
@@ -107,19 +107,29 @@ function getSourceSync(url, context) {
  */
 async function defaultLoad(url, context = kEmptyObject) {
   let responseURL = url;
-  const { importAssertions } = context;
   let {
+    importAttributes,
     format,
     source,
   } = context;
 
+  if (importAttributes == null && !('importAttributes' in context) && 'importAssertions' in context) {
+    emitImportAssertionWarning();
+    importAttributes = context.importAssertions;
+    // Alias `importAssertions` to `importAttributes`
+    context = {
+      ...context,
+      importAttributes,
+    };
+  }
+
   const urlInstance = new URL(url);
 
   throwIfUnsupportedURLScheme(urlInstance, experimentalNetworkImports);
 
   format ??= await defaultGetFormat(urlInstance, context);
 
-  validateAssertions(url, format, importAssertions);
+  validateAttributes(url, format, importAttributes);
 
   if (
     format === 'builtin' ||
@@ -141,7 +151,7 @@ async function defaultLoad(url, context = kEmptyObject) {
  * @typedef LoadContext
  * @property {string} [format] A hint (possibly returned from `resolve`)
  * @property {string | Buffer | ArrayBuffer} [source] source
- * @property {Record<string, string>} [importAssertions] import attributes
+ * @property {Record<string, string>} [importAttributes] import attributes
  */
 
 /**
@@ -158,7 +168,7 @@ async function defaultLoad(url, context = kEmptyObject) {
  */
 function defaultLoadSync(url, context = kEmptyObject) {
   let responseURL = url;
-  const { importAssertions } = context;
+  const { importAttributes } = context;
   let {
     format,
     source,
@@ -170,7 +180,7 @@ function defaultLoadSync(url, context = kEmptyObject) {
 
   format ??= defaultGetFormat(urlInstance, context);
 
-  validateAssertions(url, format, importAssertions);
+  validateAttributes(url, format, importAttributes);
 
   if (format === 'builtin') {
     source = null;
diff --git a/lib/internal/modules/esm/loader.js b/lib/internal/modules/esm/loader.js
index 5d1307565885de..6044765c3709f5 100644
--- a/lib/internal/modules/esm/loader.js
+++ b/lib/internal/modules/esm/loader.js
@@ -4,9 +4,16 @@
 require('internal/modules/cjs/loader');
 
 const {
+  ArrayPrototypeJoin,
+  ArrayPrototypeMap,
+  ArrayPrototypeReduce,
   FunctionPrototypeCall,
+  JSONStringify,
   ObjectSetPrototypeOf,
+  RegExpPrototypeSymbolReplace,
   SafeWeakMap,
+  encodeURIComponent,
+  hardenRegExp,
 } = primordials;
 
 const {
@@ -14,23 +21,35 @@ const {
   ERR_UNKNOWN_MODULE_FORMAT,
 } = require('internal/errors').codes;
 const { getOptionValue } = require('internal/options');
-const { pathToFileURL } = require('internal/url');
+const { pathToFileURL, isURL } = require('internal/url');
 const { emitExperimentalWarning } = require('internal/util');
 const {
   getDefaultConditions,
 } = require('internal/modules/esm/utils');
 let defaultResolve, defaultLoad, defaultLoadSync, importMetaInitializer;
 
+/**
+ * Lazy loads the module_map module and returns a new instance of ResolveCache.
+ * @returns {import('./module_map.js').ResolveCache')}
+ */
 function newResolveCache() {
   const { ResolveCache } = require('internal/modules/esm/module_map');
   return new ResolveCache();
 }
 
+/**
+ * Generate a load cache (to store the final result of a load-chain for a particular module).
+ * @returns {import('./module_map.js').LoadCache')}
+ */
 function newLoadCache() {
   const { LoadCache } = require('internal/modules/esm/module_map');
   return new LoadCache();
 }
 
+/**
+ * Lazy-load translators to avoid potentially unnecessary work at startup (ex if ESM is not used).
+ * @returns {import('./translators.js').Translators}
+ */
 function getTranslators() {
   const { translators } = require('internal/modules/esm/translators');
   return translators;
@@ -146,12 +165,12 @@ class ModuleLoader {
    *   resolve(
    *     originalSpecifier:
    *     string, parentURL: string,
-   *     importAssertions: Record<string, string>
+   *     importAttributes: Record<string, string>
    *   ): Promise<ResolveResult>
    *   resolveSync(
    *     originalSpecifier:
    *     string, parentURL: string,
-   *     importAssertions: Record<string, string>
+   *     importAttributes: Record<string, string>
    *   ) ResolveResult;
    *   register(specifier: string, parentURL: string): any;
    *   forceLoadHooks(): void;
@@ -185,8 +204,8 @@ class ModuleLoader {
       registerModule(module, {
         __proto__: null,
         initializeImportMeta: (meta, wrap) => this.importMetaInitialize(meta, { url }),
-        importModuleDynamically: (specifier, { url }, importAssertions) => {
-          return this.import(specifier, url, importAssertions);
+        importModuleDynamically: (specifier, { url }, importAttributes) => {
+          return this.import(specifier, url, importAttributes);
         },
       });
 
@@ -213,24 +232,24 @@ class ModuleLoader {
    * @param {string | undefined} parentURL The URL of the module importing this
    *                                     one, unless this is the Node.js entry
    *                                     point.
-   * @param {Record<string, string>} importAssertions Validations for the
+   * @param {Record<string, string>} importAttributes Validations for the
    *                                                  module import.
    * @returns {Promise<ModuleJob>} The (possibly pending) module job
    */
-  async getModuleJob(specifier, parentURL, importAssertions) {
-    const resolveResult = await this.resolve(specifier, parentURL, importAssertions);
-    return this.getJobFromResolveResult(resolveResult, parentURL, importAssertions);
+  async getModuleJob(specifier, parentURL, importAttributes) {
+    const resolveResult = await this.resolve(specifier, parentURL, importAttributes);
+    return this.getJobFromResolveResult(resolveResult, parentURL, importAttributes);
   }
 
-  getModuleJobSync(specifier, parentURL, importAssertions) {
-    const resolveResult = this.resolveSync(specifier, parentURL, importAssertions);
-    return this.getJobFromResolveResult(resolveResult, parentURL, importAssertions, true);
+  getModuleJobSync(specifier, parentURL, importAttributes) {
+    const resolveResult = this.resolveSync(specifier, parentURL, importAttributes);
+    return this.getJobFromResolveResult(resolveResult, parentURL, importAttributes, true);
   }
 
-  getJobFromResolveResult(resolveResult, parentURL, importAssertions, sync) {
+  getJobFromResolveResult(resolveResult, parentURL, importAttributes, sync) {
     const { url, format } = resolveResult;
-    const resolvedImportAssertions = resolveResult.importAssertions ?? importAssertions;
-    let job = this.loadCache.get(url, resolvedImportAssertions.type);
+    const resolvedImportAttributes = resolveResult.importAttributes ?? importAttributes;
+    let job = this.loadCache.get(url, resolvedImportAttributes.type);
 
     // CommonJS will set functions for lazy job evaluation.
     if (typeof job === 'function') {
@@ -238,7 +257,7 @@ class ModuleLoader {
     }
 
     if (job === undefined) {
-      job = this.#createModuleJob(url, resolvedImportAssertions, parentURL, format, sync);
+      job = this.#createModuleJob(url, resolvedImportAttributes, parentURL, format, sync);
     }
 
     return job;
@@ -247,7 +266,7 @@ class ModuleLoader {
   /**
    * Create and cache an object representing a loaded module.
    * @param {string} url The absolute URL that was resolved for this module
-   * @param {Record<string, string>} importAssertions Validations for the
+   * @param {Record<string, string>} importAttributes Validations for the
    *                                                  module import.
    * @param {string} [parentURL] The absolute URL of the module importing this
    *                             one, unless this is the Node.js entry point
@@ -255,7 +274,7 @@ class ModuleLoader {
    *                          `resolve` hook
    * @returns {Promise<ModuleJob>} The (possibly pending) module job
    */
-  #createModuleJob(url, importAssertions, parentURL, format, sync) {
+  #createModuleJob(url, importAttributes, parentURL, format, sync) {
     const callTranslator = ({ format: finalFormat, responseURL, source }, isMain) => {
       const translator = getTranslators().get(finalFormat);
 
@@ -265,7 +284,8 @@ class ModuleLoader {
 
       return FunctionPrototypeCall(translator, this, responseURL, source, isMain);
     };
-    const context = { format, importAssertions };
+    const context = { format, importAttributes };
+
     const moduleProvider = sync ?
       (url, isMain) => callTranslator(this.loadSync(url, context), isMain) :
       async (url, isMain) => callTranslator(await this.load(url, context), isMain);
@@ -283,14 +303,14 @@ class ModuleLoader {
     const job = new ModuleJob(
       this,
       url,
-      importAssertions,
+      importAttributes,
       moduleProvider,
       parentURL === undefined,
       inspectBrk,
       sync,
     );
 
-    this.loadCache.set(url, importAssertions.type, job);
+    this.loadCache.set(url, importAttributes.type, job);
 
     return job;
   }
@@ -300,12 +320,12 @@ class ModuleLoader {
    * Use directly with caution.
    * @param {string} specifier The first parameter of an `import()` expression.
    * @param {string} parentURL Path of the parent importing the module.
-   * @param {Record<string, string>} importAssertions Validations for the
+   * @param {Record<string, string>} importAttributes Validations for the
    *                                                  module import.
    * @returns {Promise<ModuleExports>}
    */
-  async import(specifier, parentURL, importAssertions) {
-    const moduleJob = await this.getModuleJob(specifier, parentURL, importAssertions);
+  async import(specifier, parentURL, importAttributes) {
+    const moduleJob = await this.getModuleJob(specifier, parentURL, importAttributes);
     const { module } = await moduleJob.run();
     return module.getNamespace();
   }
@@ -321,7 +341,7 @@ class ModuleLoader {
       // eslint-disable-next-line no-use-before-define
       this.setCustomizations(new CustomizedModuleLoader());
     }
-    return this.#customizations.register(specifier, parentURL, data, transferList);
+    return this.#customizations.register(`${specifier}`, `${parentURL}`, data, transferList);
   }
 
   /**
@@ -329,20 +349,20 @@ class ModuleLoader {
    * @param {string} originalSpecifier The specified URL path of the module to
    *                                   be resolved.
    * @param {string} [parentURL] The URL path of the module's parent.
-   * @param {ImportAssertions} importAssertions Assertions from the import
+   * @param {ImportAttributes} importAttributes Attributes from the import
    *                                            statement or expression.
    * @returns {{ format: string, url: URL['href'] }}
    */
-  resolve(originalSpecifier, parentURL, importAssertions) {
+  resolve(originalSpecifier, parentURL, importAttributes) {
     if (this.#customizations) {
-      return this.#customizations.resolve(originalSpecifier, parentURL, importAssertions);
+      return this.#customizations.resolve(originalSpecifier, parentURL, importAttributes);
     }
-    const requestKey = this.#resolveCache.serializeKey(originalSpecifier, importAssertions);
+    const requestKey = this.#resolveCache.serializeKey(originalSpecifier, importAttributes);
     const cachedResult = this.#resolveCache.get(requestKey, parentURL);
     if (cachedResult != null) {
       return cachedResult;
     }
-    const result = this.defaultResolve(originalSpecifier, parentURL, importAssertions);
+    const result = this.defaultResolve(originalSpecifier, parentURL, importAttributes);
     this.#resolveCache.set(requestKey, parentURL, result);
     return result;
   }
@@ -351,11 +371,11 @@ class ModuleLoader {
    * Just like `resolve` except synchronous. This is here specifically to support
    * `import.meta.resolve` which must happen synchronously.
    */
-  resolveSync(originalSpecifier, parentURL, importAssertions) {
+  resolveSync(originalSpecifier, parentURL, importAttributes) {
     if (this.#customizations) {
-      return this.#customizations.resolveSync(originalSpecifier, parentURL, importAssertions);
+      return this.#customizations.resolveSync(originalSpecifier, parentURL, importAttributes);
     }
-    return this.defaultResolve(originalSpecifier, parentURL, importAssertions);
+    return this.defaultResolve(originalSpecifier, parentURL, importAttributes);
   }
 
   /**
@@ -363,13 +383,13 @@ class ModuleLoader {
    * `resolve` and `resolveSync`. This function is here just to avoid
    * repeating the same code block twice in those functions.
    */
-  defaultResolve(originalSpecifier, parentURL, importAssertions) {
+  defaultResolve(originalSpecifier, parentURL, importAttributes) {
     defaultResolve ??= require('internal/modules/esm/resolve').defaultResolve;
 
     const context = {
       __proto__: null,
       conditions: this.#defaultConditions,
-      importAssertions,
+      importAttributes,
       parentURL,
     };
 
@@ -464,17 +484,17 @@ class CustomizedModuleLoader {
    * @param {string} originalSpecifier The specified URL path of the module to
    *                                   be resolved.
    * @param {string} [parentURL] The URL path of the module's parent.
-   * @param {ImportAssertions} importAssertions Assertions from the import
+   * @param {ImportAttributes} importAttributes Attributes from the import
    *                                            statement or expression.
    * @returns {{ format: string, url: URL['href'] }}
    */
-  resolve(originalSpecifier, parentURL, importAssertions) {
-    return hooksProxy.makeAsyncRequest('resolve', undefined, originalSpecifier, parentURL, importAssertions);
+  resolve(originalSpecifier, parentURL, importAttributes) {
+    return hooksProxy.makeAsyncRequest('resolve', undefined, originalSpecifier, parentURL, importAttributes);
   }
 
-  resolveSync(originalSpecifier, parentURL, importAssertions) {
+  resolveSync(originalSpecifier, parentURL, importAttributes) {
     // This happens only as a result of `import.meta.resolve` calls, which must be sync per spec.
-    return hooksProxy.makeSyncRequest('resolve', undefined, originalSpecifier, parentURL, importAssertions);
+    return hooksProxy.makeSyncRequest('resolve', undefined, originalSpecifier, parentURL, importAttributes);
   }
 
   /**
@@ -499,7 +519,7 @@ class CustomizedModuleLoader {
   }
 }
 
-let emittedExperimentalWarning = false;
+let emittedLoaderFlagWarning = false;
 /**
  * A loader instance is used as the main entry point for loading ES modules. Currently, this is a singleton; there is
  * only one used for loading the main module and everything in its dependency graph, though separate instances of this
@@ -515,9 +535,24 @@ function createModuleLoader(useCustomLoadersIfPresent = true) {
       !require('internal/modules/esm/utils').isLoaderWorker()) {
     const userLoaderPaths = getOptionValue('--experimental-loader');
     if (userLoaderPaths.length > 0) {
-      if (!emittedExperimentalWarning) {
-        emitExperimentalWarning('Custom ESM Loaders');
-        emittedExperimentalWarning = true;
+      if (!emittedLoaderFlagWarning) {
+        const readableURIEncode = (string) => ArrayPrototypeReduce(
+          [
+            [/'/g, '%27'], // We need to URL-encode the single quote as it's the delimiter for the --import flag.
+            [/%22/g, '"'], // We can decode the double quotes to improve readability.
+            [/%2F/ig, '/'], // We can decode the slashes to improve readability.
+          ],
+          (str, { 0: regex, 1: replacement }) => RegExpPrototypeSymbolReplace(hardenRegExp(regex), str, replacement),
+          encodeURIComponent(string));
+        process.emitWarning(
+          '`--experimental-loader` may be removed in the future; instead use `register()`:\n' +
+          `--import 'data:text/javascript,import { register } from "node:module"; import { pathToFileURL } from "node:url"; ${ArrayPrototypeJoin(
+            ArrayPrototypeMap(userLoaderPaths, (loader) => `register(${readableURIEncode(JSONStringify(loader))}, pathToFileURL("./"))`),
+            '; ',
+          )};'`,
+          'ExperimentalWarning',
+        );
+        emittedLoaderFlagWarning = true;
       }
       customizations = new CustomizedModuleLoader();
     }
@@ -542,11 +577,11 @@ function getHooksProxy() {
 
 /**
  * Register a single loader programmatically.
- * @param {string} specifier
- * @param {string} [parentURL] Base to use when resolving `specifier`; optional if
+ * @param {string|import('url').URL} specifier
+ * @param {string|import('url').URL} [parentURL] Base to use when resolving `specifier`; optional if
  * `specifier` is absolute. Same as `options.parentUrl`, just inline
  * @param {object} [options] Additional options to apply, described below.
- * @param {string} [options.parentURL] Base to use when resolving `specifier`
+ * @param {string|import('url').URL} [options.parentURL] Base to use when resolving `specifier`
  * @param {any} [options.data] Arbitrary data passed to the loader's `initialize` hook
  * @param {any[]} [options.transferList] Objects in `data` that are changing ownership
  * @returns {void} We want to reserve the return value for potential future extension of the API.
@@ -571,12 +606,12 @@ function getHooksProxy() {
  */
 function register(specifier, parentURL = undefined, options) {
   const moduleLoader = require('internal/process/esm_loader').esmLoader;
-  if (parentURL != null && typeof parentURL === 'object') {
+  if (parentURL != null && typeof parentURL === 'object' && !isURL(parentURL)) {
     options = parentURL;
     parentURL = options.parentURL;
   }
   moduleLoader.register(
-    `${specifier}`,
+    specifier,
     parentURL ?? 'data:',
     options?.data,
     options?.transferList,
diff --git a/lib/internal/modules/esm/module_job.js b/lib/internal/modules/esm/module_job.js
index ff284367d0d49e..83c23456e05f10 100644
--- a/lib/internal/modules/esm/module_job.js
+++ b/lib/internal/modules/esm/module_job.js
@@ -50,10 +50,10 @@ const isCommonJSGlobalLikeNotDefinedError = (errorMessage) =>
 class ModuleJob {
   // `loader` is the Loader instance used for loading dependencies.
   // `moduleProvider` is a function
-  constructor(loader, url, importAssertions = { __proto__: null },
+  constructor(loader, url, importAttributes = { __proto__: null },
               moduleProvider, isMain, inspectBrk, sync = false) {
     this.loader = loader;
-    this.importAssertions = importAssertions;
+    this.importAttributes = importAttributes;
     this.isMain = isMain;
     this.inspectBrk = inspectBrk;
 
@@ -81,8 +81,8 @@ class ModuleJob {
       // so that circular dependencies can't cause a deadlock by two of
       // these `link` callbacks depending on each other.
       const dependencyJobs = [];
-      const promises = this.module.link(async (specifier, assertions) => {
-        const job = await this.loader.getModuleJob(specifier, url, assertions);
+      const promises = this.module.link(async (specifier, attributes) => {
+        const job = await this.loader.getModuleJob(specifier, url, attributes);
         ArrayPrototypePush(dependencyJobs, job);
         return job.modulePromise;
       });
@@ -157,7 +157,7 @@ class ModuleJob {
         let format;
         try {
           // This might throw for non-CommonJS modules because we aren't passing
-          // in the import assertions and some formats require them; but we only
+          // in the import attributes and some formats require them; but we only
           // care about CommonJS for the purposes of this error message.
           ({ format } =
             await this.loader.load(childFileURL));
diff --git a/lib/internal/modules/esm/module_map.js b/lib/internal/modules/esm/module_map.js
index 12a1a526178a7e..eab00386c413a5 100644
--- a/lib/internal/modules/esm/module_map.js
+++ b/lib/internal/modules/esm/module_map.js
@@ -17,7 +17,7 @@ const { validateString } = require('internal/validators');
 
 /**
  * Cache the results of the `resolve` step of the module resolution and loading process.
- * Future resolutions of the same input (specifier, parent URL and import assertions)
+ * Future resolutions of the same input (specifier, parent URL and import attributes)
  * must return the same result if the first attempt was successful, per
  * https://tc39.es/ecma262/#sec-HostLoadImportedModule.
  * This cache is *not* used when custom loaders are registered.
@@ -30,15 +30,15 @@ class ResolveCache extends SafeMap {
    *
    * It is exposed to allow more efficient read and overwrite a cache entry.
    * @param {string} specifier
-   * @param {Record<string,string>} importAssertions
+   * @param {Record<string,string>} importAttributes
    * @returns {string}
    */
-  serializeKey(specifier, importAssertions) {
-    // To serialize the ModuleRequest (specifier + list of import assertions),
-    // we need to sort the assertions by key, then stringifying,
-    // so that different import statements with the same assertions are always treated
+  serializeKey(specifier, importAttributes) {
+    // To serialize the ModuleRequest (specifier + list of import attributes),
+    // we need to sort the attributes by key, then stringifying,
+    // so that different import statements with the same attributes are always treated
     // as identical.
-    const keys = ObjectKeys(importAssertions);
+    const keys = ObjectKeys(importAttributes);
 
     if (keys.length === 0) {
       return specifier + '::';
@@ -47,7 +47,7 @@ class ResolveCache extends SafeMap {
     return specifier + '::' + ArrayPrototypeJoin(
       ArrayPrototypeMap(
         ArrayPrototypeSort(keys),
-        (key) => JSONStringify(key) + JSONStringify(importAssertions[key])),
+        (key) => JSONStringify(key) + JSONStringify(importAttributes[key])),
       ',');
   }
 
diff --git a/lib/internal/modules/esm/package_config.js b/lib/internal/modules/esm/package_config.js
index 4ca701d4810f74..5da47764c9de2c 100644
--- a/lib/internal/modules/esm/package_config.js
+++ b/lib/internal/modules/esm/package_config.js
@@ -7,8 +7,23 @@ const { URL, fileURLToPath } = require('internal/url');
 const packageJsonReader = require('internal/modules/package_json_reader');
 
 /**
- * @param {URL | string} resolved
- * @returns {PackageConfig}
+ * @typedef {object} PackageConfig
+ * @property {string} pjsonPath - The path to the package.json file.
+ * @property {boolean} exists - Whether the package.json file exists.
+ * @property {'none' | 'commonjs' | 'module'} type - The type of the package.
+ * @property {string} [name] - The name of the package.
+ * @property {string} [main] - The main entry point of the package.
+ * @property {PackageTarget} [exports] - The exports configuration of the package.
+ * @property {Record<string, string | Record<string, string>>} [imports] - The imports configuration of the package.
+ */
+/**
+ * @typedef {string | string[] | Record<string, string | Record<string, string>>} PackageTarget
+ */
+
+/**
+ * Returns the package configuration for the given resolved URL.
+ * @param {URL | string} resolved - The resolved URL.
+ * @returns {PackageConfig} - The package configuration.
  */
 function getPackageScopeConfig(resolved) {
   let packageJSONUrl = new URL('./package.json', resolved);
diff --git a/lib/internal/modules/esm/resolve.js b/lib/internal/modules/esm/resolve.js
index 8f3b289126bb82..58e7df07ca5275 100644
--- a/lib/internal/modules/esm/resolve.js
+++ b/lib/internal/modules/esm/resolve.js
@@ -35,8 +35,9 @@ const preserveSymlinks = getOptionValue('--preserve-symlinks');
 const preserveSymlinksMain = getOptionValue('--preserve-symlinks-main');
 const experimentalNetworkImports =
   getOptionValue('--experimental-network-imports');
-const typeFlag = getOptionValue('--input-type');
+const inputTypeFlag = getOptionValue('--input-type');
 const { URL, pathToFileURL, fileURLToPath, isURL } = require('internal/url');
+const { getCWDURL } = require('internal/util');
 const { canParse: URLCanParse } = internalBinding('url');
 const { legacyMainResolve: FSLegacyMainResolve } = internalBinding('fs');
 const {
@@ -66,6 +67,13 @@ const { internalModuleStat } = internalBinding('fs');
 
 const emittedPackageWarnings = new SafeSet();
 
+/**
+ * Emits a deprecation warning for the use of a deprecated trailing slash pattern mapping in the "exports" field
+ * module resolution of a package.
+ * @param {string} match - The deprecated trailing slash pattern mapping.
+ * @param {string} pjsonUrl - The URL of the package.json file.
+ * @param {string} base - The URL of the module that imported the package.
+ */
 function emitTrailingSlashPatternDeprecation(match, pjsonUrl, base) {
   const pjsonPath = fileURLToPath(pjsonUrl);
   if (emittedPackageWarnings.has(pjsonPath + '|' + match)) { return; }
@@ -82,6 +90,16 @@ function emitTrailingSlashPatternDeprecation(match, pjsonUrl, base) {
 
 const doubleSlashRegEx = /[/\\][/\\]/;
 
+/**
+ * Emits a deprecation warning for invalid segment in module resolution.
+ * @param {string} target - The target module.
+ * @param {string} request - The requested module.
+ * @param {string} match - The matched module.
+ * @param {string} pjsonUrl - The package.json URL.
+ * @param {boolean} internal - Whether the module is in the "imports" or "exports" field.
+ * @param {string} base - The base URL.
+ * @param {boolean} isTarget - Whether the target is a module.
+ */
 function emitInvalidSegmentDeprecation(target, request, match, pjsonUrl, internal, base, isTarget) {
   const pjsonPath = fileURLToPath(pjsonUrl);
   const double = RegExpPrototypeExec(doubleSlashRegEx, isTarget ? target : request) !== null;
@@ -97,11 +115,12 @@ function emitInvalidSegmentDeprecation(target, request, match, pjsonUrl, interna
 }
 
 /**
- * @param {URL} url
- * @param {URL} packageJSONUrl
- * @param {string | URL | undefined} base
- * @param {string} [main]
- * @returns {void}
+ * Emits a deprecation warning if the given URL is a module and
+ * the package.json file does not define a "main" or "exports" field.
+ * @param {URL} url - The URL of the module being resolved.
+ * @param {URL} packageJSONUrl - The URL of the package.json file for the module.
+ * @param {string | URL} [base] - The base URL for the module being resolved.
+ * @param {string} [main] - The "main" field from the package.json file.
  */
 function emitLegacyIndexDeprecation(url, packageJSONUrl, base, main) {
   const format = defaultGetFormatWithoutErrors(url);
@@ -195,10 +214,15 @@ function legacyMainResolve(packageJSONUrl, packageConfig, base) {
 
 const encodedSepRegEx = /%2F|%5C/i;
 /**
- * @param {URL} resolved
- * @param {string | URL | undefined} base
- * @param {boolean} preserveSymlinks
- * @returns {URL | undefined}
+ * Finalizes the resolution of a module specifier by checking if the resolved pathname contains encoded "/" or "\\"
+ * characters, checking if the resolved pathname is a directory or file, and resolving any symlinks if necessary.
+ * @param {URL} resolved - The resolved URL object.
+ * @param {string | URL | undefined} base - The base URL object.
+ * @param {boolean} preserveSymlinks - Whether to preserve symlinks or not.
+ * @returns {URL} - The finalized URL object.
+ * @throws {ERR_INVALID_MODULE_SPECIFIER} - If the resolved pathname contains encoded "/" or "\\" characters.
+ * @throws {ERR_UNSUPPORTED_DIR_IMPORT} - If the resolved pathname is a directory.
+ * @throws {ERR_MODULE_NOT_FOUND} - If the resolved pathname is not a file.
  */
 function finalizeResolution(resolved, base, preserveSymlinks) {
   if (RegExpPrototypeExec(encodedSepRegEx, resolved.pathname) !== null) {
@@ -207,7 +231,15 @@ function finalizeResolution(resolved, base, preserveSymlinks) {
       fileURLToPath(base));
   }
 
-  const path = fileURLToPath(resolved);
+  let path;
+  try {
+    path = fileURLToPath(resolved);
+  } catch (err) {
+    const { setOwnProperty } = require('internal/util');
+    setOwnProperty(err, 'input', `${resolved}`);
+    setOwnProperty(err, 'module', `${base}`);
+    throw err;
+  }
 
   const stats = internalModuleStat(toNamespacedPath(StringPrototypeEndsWith(path, '/') ?
     StringPrototypeSlice(path, -1) : path));
@@ -239,9 +271,11 @@ function finalizeResolution(resolved, base, preserveSymlinks) {
 }
 
 /**
- * @param {string} specifier
- * @param {URL} packageJSONUrl
- * @param {string | URL | undefined} base
+ * Returns an error object indicating that the specified import is not defined.
+ * @param {string} specifier - The import specifier that is not defined.
+ * @param {URL} packageJSONUrl - The URL of the package.json file, or null if not available.
+ * @param {string | URL | undefined} base - The base URL to use for resolving relative URLs.
+ * @returns {ERR_PACKAGE_IMPORT_NOT_DEFINED} - The error object.
  */
 function importNotDefined(specifier, packageJSONUrl, base) {
   return new ERR_PACKAGE_IMPORT_NOT_DEFINED(
@@ -250,9 +284,11 @@ function importNotDefined(specifier, packageJSONUrl, base) {
 }
 
 /**
- * @param {string} subpath
- * @param {URL} packageJSONUrl
- * @param {string | URL | undefined} base
+ * Returns an error object indicating that the specified subpath was not exported by the package.
+ * @param {string} subpath - The subpath that was not exported.
+ * @param {URL} packageJSONUrl - The URL of the package.json file.
+ * @param {string | URL | undefined} [base] - The base URL to use for resolving the subpath.
+ * @returns {ERR_PACKAGE_PATH_NOT_EXPORTED} - The error object.
  */
 function exportsNotFound(subpath, packageJSONUrl, base) {
   return new ERR_PACKAGE_PATH_NOT_EXPORTED(
@@ -261,12 +297,13 @@ function exportsNotFound(subpath, packageJSONUrl, base) {
 }
 
 /**
- *
- * @param {string} request
- * @param {string} match
- * @param {URL} packageJSONUrl
- * @param {boolean} internal
- * @param {string | URL | undefined} base
+ * Throws an error indicating that the given request is not a valid subpath match for the specified pattern.
+ * @param {string} request - The request that failed to match the pattern.
+ * @param {string} match - The pattern that the request was compared against.
+ * @param {URL} packageJSONUrl - The URL of the package.json file being resolved.
+ * @param {boolean} internal - Whether the resolution is for an "imports" or "exports" field in package.json.
+ * @param {string | URL | undefined} base - The base URL for the resolution.
+ * @throws {ERR_INVALID_MODULE_SPECIFIER} When the request is not a valid match for the pattern.
  */
 function throwInvalidSubpath(request, match, packageJSONUrl, internal, base) {
   const reason = `request is not a valid match in pattern "${match}" for the "${
@@ -276,6 +313,15 @@ function throwInvalidSubpath(request, match, packageJSONUrl, internal, base) {
                                          base && fileURLToPath(base));
 }
 
+/**
+ * Creates an error object for an invalid package target.
+ * @param {string} subpath - The subpath.
+ * @param {import('internal/modules/esm/package_config.js').PackageTarget} target - The target.
+ * @param {URL} packageJSONUrl - The URL of the package.json file.
+ * @param {boolean} internal - Whether the package is internal.
+ * @param {string | URL | undefined} base - The base URL.
+ * @returns {ERR_INVALID_PACKAGE_TARGET} - The error object.
+ */
 function invalidPackageTarget(
   subpath, target, packageJSONUrl, internal, base) {
   if (typeof target === 'object' && target !== null) {
@@ -294,17 +340,19 @@ const invalidPackageNameRegEx = /^\.|%|\\/;
 const patternRegEx = /\*/g;
 
 /**
- *
- * @param {string} target
- * @param {*} subpath
- * @param {*} match
- * @param {*} packageJSONUrl
- * @param {*} base
- * @param {*} pattern
- * @param {*} internal
- * @param {*} isPathMap
- * @param {*} conditions
- * @returns {URL}
+ * Resolves the package target string to a URL object.
+ * @param {string} target - The target string to resolve.
+ * @param {string} subpath - The subpath to append to the resolved URL.
+ * @param {RegExpMatchArray} match - The matched string array from the import statement.
+ * @param {string} packageJSONUrl - The URL of the package.json file.
+ * @param {string} base - The base URL to resolve the target against.
+ * @param {RegExp} pattern - The pattern to replace in the target string.
+ * @param {boolean} internal - Whether the target is internal to the package.
+ * @param {boolean} isPathMap - Whether the target is a path map.
+ * @param {string[]} conditions - The import conditions.
+ * @returns {URL} - The resolved URL object.
+ * @throws {ERR_INVALID_PACKAGE_TARGET} - If the target is invalid.
+ * @throws {ERR_INVALID_SUBPATH} - If the subpath is invalid.
  */
 function resolvePackageTargetString(
   target,
@@ -387,8 +435,9 @@ function resolvePackageTargetString(
 }
 
 /**
- * @param {string} key
- * @returns {boolean}
+ * Checks if the given key is a valid array index.
+ * @param {string} key - The key to check.
+ * @returns {boolean} - Returns `true` if the key is a valid array index, else `false`.
  */
 function isArrayIndex(key) {
   const keyNum = +key;
@@ -397,17 +446,17 @@ function isArrayIndex(key) {
 }
 
 /**
- *
- * @param {*} packageJSONUrl
- * @param {string|[string]} target
- * @param {*} subpath
- * @param {*} packageSubpath
- * @param {*} base
- * @param {*} pattern
- * @param {*} internal
- * @param {*} isPathMap
- * @param {*} conditions
- * @returns {URL|null}
+ * Resolves the target of a package based on the provided parameters.
+ * @param {string} packageJSONUrl - The URL of the package.json file.
+ * @param {import('internal/modules/esm/package_config.js').PackageTarget} target - The target to resolve.
+ * @param {string} subpath - The subpath to resolve.
+ * @param {string} packageSubpath - The subpath of the package to resolve.
+ * @param {string} base - The base path to resolve.
+ * @param {RegExp} pattern - The pattern to match.
+ * @param {boolean} internal - Whether the package is internal.
+ * @param {boolean} isPathMap - Whether the package is a path map.
+ * @param {Set<string>} conditions - The conditions to match.
+ * @returns {URL | null | undefined} - The resolved target, or null if not found, or undefined if not resolvable.
  */
 function resolvePackageTarget(packageJSONUrl, target, subpath, packageSubpath,
                               base, pattern, internal, isPathMap, conditions) {
@@ -478,11 +527,10 @@ function resolvePackageTarget(packageJSONUrl, target, subpath, packageSubpath,
 }
 
 /**
- *
- * @param {import('internal/modules/esm/package_config.js').Exports} exports
- * @param {URL} packageJSONUrl
- * @param {string | URL | undefined} base
- * @returns {boolean}
+ * Is the given exports object using the shorthand syntax?
+ * @param {import('internal/modules/esm/package_config.js').PackageConfig['exports']} exports
+ * @param {URL} packageJSONUrl The URL of the package.json file.
+ * @param {string | URL | undefined} base The base URL.
  */
 function isConditionalExportsMainSugar(exports, packageJSONUrl, base) {
   if (typeof exports === 'string' || ArrayIsArray(exports)) { return true; }
@@ -508,12 +556,13 @@ function isConditionalExportsMainSugar(exports, packageJSONUrl, base) {
 }
 
 /**
- * @param {URL} packageJSONUrl
- * @param {string} packageSubpath
- * @param {PackageConfig} packageConfig
- * @param {string | URL | undefined} base
- * @param {Set<string>} conditions
- * @returns {URL}
+ * Resolves the exports of a package.
+ * @param {URL} packageJSONUrl - The URL of the package.json file.
+ * @param {string} packageSubpath - The subpath of the package to resolve.
+ * @param {import('internal/modules/esm/package_config.js').PackageConfig} packageConfig - The package metadata.
+ * @param {string | URL | undefined} base - The base path to resolve from.
+ * @param {Set<string>} conditions - An array of conditions to match.
+ * @returns {URL} - The resolved package target.
  */
 function packageExportsResolve(
   packageJSONUrl, packageSubpath, packageConfig, base, conditions) {
@@ -592,6 +641,13 @@ function packageExportsResolve(
   throw exportsNotFound(packageSubpath, packageJSONUrl, base);
 }
 
+/**
+ * Compares two strings that may contain a wildcard character ('*') and returns a value indicating their order.
+ * @param {string} a - The first string to compare.
+ * @param {string} b - The second string to compare.
+ * @returns {number} - A negative number if `a` should come before `b`, a positive number if `a` should come after `b`,
+ * or 0 if they are equal.
+ */
 function patternKeyCompare(a, b) {
   const aPatternIndex = StringPrototypeIndexOf(a, '*');
   const bPatternIndex = StringPrototypeIndexOf(b, '*');
@@ -607,10 +663,13 @@ function patternKeyCompare(a, b) {
 }
 
 /**
- * @param {string} name
- * @param {string | URL | undefined} base
- * @param {Set<string>} conditions
- * @returns {URL}
+ * Resolves the given import name for a package.
+ * @param {string} name - The name of the import to resolve.
+ * @param {string | URL | undefined} base - The base URL to resolve the import from.
+ * @param {Set<string>} conditions - An object containing the import conditions.
+ * @throws {ERR_INVALID_MODULE_SPECIFIER} If the import name is not valid.
+ * @throws {ERR_PACKAGE_IMPORT_NOT_DEFINED} If the import name cannot be resolved.
+ * @returns {URL} The resolved import URL.
  */
 function packageImportsResolve(name, base, conditions) {
   if (name === '#' || StringPrototypeStartsWith(name, '#/') ||
@@ -673,8 +732,8 @@ function packageImportsResolve(name, base, conditions) {
 }
 
 /**
- * @param {URL} url
- * @returns {import('internal/modules/esm/package_config.js').PackageType}
+ * Returns the package type for a given URL.
+ * @param {URL} url - The URL to get the package type for.
  */
 function getPackageType(url) {
   const packageConfig = getPackageScopeConfig(url);
@@ -682,9 +741,9 @@ function getPackageType(url) {
 }
 
 /**
- * @param {string} specifier
- * @param {string | URL | undefined} base
- * @returns {{ packageName: string, packageSubpath: string, isScoped: boolean }}
+ * Parse a package name from a specifier.
+ * @param {string} specifier - The import specifier.
+ * @param {string | URL | undefined} base - The parent URL.
  */
 function parsePackageName(specifier, base) {
   let separatorIndex = StringPrototypeIndexOf(specifier, '/');
@@ -721,10 +780,11 @@ function parsePackageName(specifier, base) {
 }
 
 /**
- * @param {string} specifier
- * @param {string | URL | undefined} base
- * @param {Set<string>} conditions
- * @returns {resolved: URL, format? : string}
+ * Resolves a package specifier to a URL.
+ * @param {string} specifier - The package specifier to resolve.
+ * @param {string | URL | undefined} base - The base URL to use for resolution.
+ * @param {Set<string>} conditions - An object containing the conditions for resolution.
+ * @returns {URL} - The resolved URL.
  */
 function packageResolve(specifier, base, conditions) {
   if (BuiltinModule.canBeRequiredWithoutScheme(specifier)) {
@@ -785,13 +845,17 @@ function packageResolve(specifier, base, conditions) {
 }
 
 /**
- * @param {string} specifier
- * @returns {boolean}
+ * Checks if a specifier is a bare specifier.
+ * @param {string} specifier - The specifier to check.
  */
 function isBareSpecifier(specifier) {
   return specifier[0] && specifier[0] !== '/' && specifier[0] !== '.';
 }
 
+/**
+ * Determines whether a specifier is a relative path.
+ * @param {string} specifier - The specifier to check.
+ */
 function isRelativeSpecifier(specifier) {
   if (specifier[0] === '.') {
     if (specifier.length === 1 || specifier[1] === '/') { return true; }
@@ -802,6 +866,10 @@ function isRelativeSpecifier(specifier) {
   return false;
 }
 
+/**
+ * Determines whether a specifier should be treated as a relative or absolute path.
+ * @param {string} specifier - The specifier to check.
+ */
 function shouldBeTreatedAsRelativeOrAbsolutePath(specifier) {
   if (specifier === '') { return false; }
   if (specifier[0] === '/') { return true; }
@@ -809,11 +877,11 @@ function shouldBeTreatedAsRelativeOrAbsolutePath(specifier) {
 }
 
 /**
- * @param {string} specifier
- * @param {string | URL | undefined} base
- * @param {Set<string>} conditions
- * @param {boolean} preserveSymlinks
- * @returns {url: URL, format?: string}
+ * Resolves a module specifier to a URL.
+ * @param {string} specifier - The module specifier to resolve.
+ * @param {string | URL | undefined} base - The base URL to resolve against.
+ * @param {Set<string>} conditions - An object containing environment conditions.
+ * @param {boolean} preserveSymlinks - Whether to preserve symlinks in the resolved URL.
  */
 function moduleResolve(specifier, base, conditions, preserveSymlinks) {
   const isRemote = base.protocol === 'http:' ||
@@ -841,10 +909,9 @@ function moduleResolve(specifier, base, conditions, preserveSymlinks) {
 }
 
 /**
- * Try to resolve an import as a CommonJS module
- * @param {string} specifier
- * @param {string} parentURL
- * @returns {boolean|string}
+ * Try to resolve an import as a CommonJS module.
+ * @param {string} specifier - The specifier to resolve.
+ * @param {string} parentURL - The base URL.
  */
 function resolveAsCommonJS(specifier, parentURL) {
   try {
@@ -886,7 +953,14 @@ function resolveAsCommonJS(specifier, parentURL) {
   }
 }
 
-// TODO(@JakobJingleheimer): de-dupe `specifier` & `parsed`
+/**
+ * Throw an error if an import is not allowed.
+ * TODO(@JakobJingleheimer): de-dupe `specifier` & `parsed`
+ * @param {string} specifier - The import specifier.
+ * @param {URL} parsed - The parsed URL of the import specifier.
+ * @param {URL} parsedParentURL - The parsed URL of the parent module.
+ * @throws {ERR_NETWORK_IMPORT_DISALLOWED} - If the import is disallowed.
+ */
 function checkIfDisallowedImport(specifier, parsed, parsedParentURL) {
   if (parsedParentURL) {
     // Avoid accessing the `protocol` property due to the lazy getters.
@@ -932,6 +1006,7 @@ function checkIfDisallowedImport(specifier, parsed, parsedParentURL) {
 
 /**
  * Validate user-input in `context` supplied by a custom loader.
+ * @param {string | URL | undefined} parentURL - The parent URL.
  */
 function throwIfInvalidParentURL(parentURL) {
   if (parentURL === undefined) {
@@ -942,7 +1017,15 @@ function throwIfInvalidParentURL(parentURL) {
   }
 }
 
-
+/**
+ * Resolves the given specifier using the provided context, which includes the parent URL and conditions.
+ * Throws an error if the parent URL is invalid or if the resolution is disallowed by the policy manifest.
+ * Otherwise, attempts to resolve the specifier and returns the resulting URL and format.
+ * @param {string} specifier - The specifier to resolve.
+ * @param {object} [context={}] - The context object containing the parent URL and conditions.
+ * @param {string} [context.parentURL] - The URL of the parent module.
+ * @param {string[]} [context.conditions] - The conditions for resolving the specifier.
+ */
 function defaultResolve(specifier, context = {}) {
   let { parentURL, conditions } = context;
   throwIfInvalidParentURL(parentURL);
@@ -1021,7 +1104,7 @@ function defaultResolve(specifier, context = {}) {
 
   const isMain = parentURL === undefined;
   if (isMain) {
-    parentURL = pathToFileURL(`${process.cwd()}/`).href;
+    parentURL = getCWDURL().href;
 
     // This is the initial entry point to the program, and --input-type has
     // been passed as an option; but --input-type can only be used with
@@ -1029,7 +1112,7 @@ function defaultResolve(specifier, context = {}) {
     // input, to avoid user confusion over how expansive the effect of the
     // flag should be (i.e. entry point only, package scope surrounding the
     // entry point, etc.).
-    if (typeFlag) { throw new ERR_INPUT_TYPE_NOT_ALLOWED(); }
+    if (inputTypeFlag) { throw new ERR_INPUT_TYPE_NOT_ALLOWED(); }
   }
 
   conditions = getConditionsSet(conditions);
@@ -1049,17 +1132,7 @@ function defaultResolve(specifier, context = {}) {
       if (StringPrototypeStartsWith(specifier, 'file://')) {
         specifier = fileURLToPath(specifier);
       }
-      const found = resolveAsCommonJS(specifier, parentURL);
-      if (found) {
-        // Modify the stack and message string to include the hint
-        const lines = StringPrototypeSplit(error.stack, '\n');
-        const hint = `Did you mean to import ${found}?`;
-        error.stack =
-          ArrayPrototypeShift(lines) + '\n' +
-          hint + '\n' +
-          ArrayPrototypeJoin(lines, '\n');
-        error.message += `\n${hint}`;
-      }
+      decorateErrorWithCommonJSHints(error, specifier, parentURL);
     }
     throw error;
   }
@@ -1073,7 +1146,28 @@ function defaultResolve(specifier, context = {}) {
   };
 }
 
+/**
+ * Decorates the given error with a hint for CommonJS modules.
+ * @param {Error} error - The error to decorate.
+ * @param {string} specifier - The specifier that was attempted to be imported.
+ * @param {string} parentURL - The URL of the parent module.
+ */
+function decorateErrorWithCommonJSHints(error, specifier, parentURL) {
+  const found = resolveAsCommonJS(specifier, parentURL);
+  if (found) {
+    // Modify the stack and message string to include the hint
+    const lines = StringPrototypeSplit(error.stack, '\n');
+    const hint = `Did you mean to import ${found}?`;
+    error.stack =
+      ArrayPrototypeShift(lines) + '\n' +
+      hint + '\n' +
+      ArrayPrototypeJoin(lines, '\n');
+    error.message += `\n${hint}`;
+  }
+}
+
 module.exports = {
+  decorateErrorWithCommonJSHints,
   defaultResolve,
   encodedSepRegEx,
   getPackageScopeConfig,
diff --git a/lib/internal/modules/esm/translators.js b/lib/internal/modules/esm/translators.js
index 62d721552ef6af..c36fe07a9503ae 100644
--- a/lib/internal/modules/esm/translators.js
+++ b/lib/internal/modules/esm/translators.js
@@ -11,14 +11,20 @@ const {
   SafeArrayIterator,
   SafeMap,
   SafeSet,
+  StringPrototypeIncludes,
   StringPrototypeReplaceAll,
   StringPrototypeSlice,
   StringPrototypeStartsWith,
+  Symbol,
   SyntaxErrorPrototype,
   globalThis: { WebAssembly },
 } = primordials;
 
+/** @type {import('internal/util/types')} */
 let _TYPES = null;
+/**
+ * Lazily loads and returns the internal/util/types module.
+ */
 function lazyTypes() {
   if (_TYPES !== null) { return _TYPES; }
   return _TYPES = require('internal/util/types');
@@ -52,7 +58,13 @@ const asyncESM = require('internal/process/esm_loader');
 const { emitWarningSync } = require('internal/process/warning');
 const { internalCompileFunction } = require('internal/vm');
 
+/** @type {import('deps/cjs-module-lexer/lexer.js').parse} */
 let cjsParse;
+/**
+ * Initializes the CommonJS module lexer parser.
+ * If WebAssembly is available, it uses the optimized version from the dist folder.
+ * Otherwise, it falls back to the JavaScript version from the lexer folder.
+ */
 async function initCJSParse() {
   if (typeof WebAssembly === 'undefined') {
     cjsParse = require('internal/deps/cjs-module-lexer/lexer').parse;
@@ -73,6 +85,14 @@ exports.translators = translators;
 exports.enrichCJSError = enrichCJSError;
 
 let DECODER = null;
+/**
+ * Asserts that the given body is a buffer source (either a string, array buffer, or typed array).
+ * Throws an error if the body is not a buffer source.
+ * @param {string | ArrayBufferView | ArrayBuffer} body - The body to check.
+ * @param {boolean} allowString - Whether or not to allow a string as a valid buffer source.
+ * @param {string} hookName - The name of the hook being called.
+ * @throws {ERR_INVALID_RETURN_PROPERTY_VALUE} If the body is not a buffer source.
+ */
 function assertBufferSource(body, allowString, hookName) {
   if (allowString && typeof body === 'string') {
     return;
@@ -89,6 +109,11 @@ function assertBufferSource(body, allowString, hookName) {
   );
 }
 
+/**
+ * Converts a buffer or buffer-like object to a string.
+ * @param {string | ArrayBuffer | ArrayBufferView} body - The buffer or buffer-like object to convert to a string.
+ * @returns {string} The resulting string.
+ */
 function stringify(body) {
   if (typeof body === 'string') { return body; }
   assertBufferSource(body, false, 'transformSource');
@@ -97,6 +122,10 @@ function stringify(body) {
   return DECODER.decode(body);
 }
 
+/**
+ * Converts a URL to a file path if the URL protocol is 'file:'.
+ * @param {string} url - The URL to convert.
+ */
 function errPath(url) {
   const parsed = new URL(url);
   if (parsed.protocol === 'file:') {
@@ -105,8 +134,16 @@ function errPath(url) {
   return url;
 }
 
-async function importModuleDynamically(specifier, { url }, assertions) {
-  return asyncESM.esmLoader.import(specifier, url, assertions);
+/**
+ * Dynamically imports a module using the ESM loader.
+ * @param {string} specifier - The module specifier to import.
+ * @param {object} options - An object containing options for the import.
+ * @param {string} options.url - The URL of the module requesting the import.
+ * @param {Record<string, string>} [attributes] - An object containing attributes for the import.
+ * @returns {Promise<import('internal/modules/esm/loader.js').ModuleExports>} The imported module.
+ */
+async function importModuleDynamically(specifier, { url }, attributes) {
+  return asyncESM.esmLoader.import(specifier, url, attributes);
 }
 
 // Strategy for loading a standard JavaScript module.
@@ -126,6 +163,7 @@ translators.set('module', async function moduleStrategy(url, source, isMain) {
 });
 
 /**
+ * Provide a more informative error for CommonJS imports.
  * @param {Error | any} err
  * @param {string} [content] Content of the file, if known.
  * @param {string} [filename] Useful only if `content` is unknown.
@@ -148,22 +186,36 @@ function enrichCJSError(err, content, filename) {
  * This translator creates its own version of the `require` function passed into CommonJS modules.
  * Any monkey patches applied to the CommonJS Loader will not affect this module.
  * Any `require` calls in this module will load all children in the same way.
+ * @param {import('internal/modules/cjs/loader').Module} module - The module to load.
+ * @param {string} source - The source code of the module.
+ * @param {string} url - The URL of the module.
+ * @param {string} filename - The filename of the module.
  */
 function loadCJSModule(module, source, url, filename) {
   let compiledWrapper;
+  async function importModuleDynamically(specifier, _, importAttributes) {
+    return asyncESM.esmLoader.import(specifier, url, importAttributes);
+  }
   try {
-    compiledWrapper = internalCompileFunction(source, [
-      'exports',
-      'require',
-      'module',
-      '__filename',
-      '__dirname',
-    ], {
-      filename,
-      importModuleDynamically(specifier, _, importAssertions) {
-        return asyncESM.esmLoader.import(specifier, url, importAssertions);
-      },
-    }).function;
+    compiledWrapper = internalCompileFunction(
+      source,                         // code,
+      filename,                       // filename
+      0,                              // lineOffset
+      0,                              // columnOffset,
+      undefined,                      // cachedData
+      false,                          // produceCachedData
+      undefined,                      // parsingContext
+      undefined,                      // contextExtensions
+      [                               // params
+        'exports',
+        'require',
+        'module',
+        '__filename',
+        '__dirname',
+      ],
+      Symbol(`cjs:${filename}`),      // hostDefinedOptionsId
+      importModuleDynamically,        // importModuleDynamically
+    ).function;
   } catch (err) {
     enrichCJSError(err, source, url);
     throw err;
@@ -172,14 +224,14 @@ function loadCJSModule(module, source, url, filename) {
   const __dirname = dirname(filename);
   // eslint-disable-next-line func-name-matching,func-style
   const requireFn = function require(specifier) {
-    let importAssertions = kEmptyObject;
+    let importAttributes = kEmptyObject;
     if (!StringPrototypeStartsWith(specifier, 'node:')) {
       // TODO: do not depend on the monkey-patchable CJS loader here.
       const path = CJSModule._resolveFilename(specifier, module);
       if (specifier !== path) {
         switch (extname(path)) {
           case '.json':
-            importAssertions = { __proto__: null, type: 'json' };
+            importAttributes = { __proto__: null, type: 'json' };
             break;
           case '.node':
             return CJSModule._load(specifier, module);
@@ -189,7 +241,7 @@ function loadCJSModule(module, source, url, filename) {
         specifier = `${pathToFileURL(path)}`;
       }
     }
-    const job = asyncESM.esmLoader.getModuleJobSync(specifier, url, importAssertions);
+    const job = asyncESM.esmLoader.getModuleJobSync(specifier, url, importAttributes);
     job.runSync();
     return cjsCache.get(job.url).exports;
   };
@@ -212,6 +264,14 @@ function loadCJSModule(module, source, url, filename) {
 
 // TODO: can we use a weak map instead?
 const cjsCache = new SafeMap();
+/**
+ * Creates a ModuleWrap object for a CommonJS module.
+ * @param {string} url - The URL of the module.
+ * @param {string} source - The source code of the module.
+ * @param {boolean} isMain - Whether the module is the main module.
+ * @param {typeof loadCJSModule} [loadCJS=loadCJSModule] - The function to load the CommonJS module.
+ * @returns {ModuleWrap} The ModuleWrap object for the CommonJS module.
+ */
 function createCJSModuleWrap(url, source, isMain, loadCJS = loadCJSModule) {
   debug(`Translating CJSModule ${url}`);
 
@@ -299,6 +359,11 @@ translators.set('commonjs', async function commonjsStrategy(url, source,
 
 });
 
+/**
+ * Pre-parses a CommonJS module's exports and re-exports.
+ * @param {string} filename - The filename of the module.
+ * @param {string} [source] - The source code of the module.
+ */
 function cjsPreparseModuleExports(filename, source) {
   // TODO: Do we want to keep hitting the user mutable CJS loader here?
   let module = CJSModule._cache[filename];
@@ -390,9 +455,12 @@ translators.set('json', function jsonStrategy(url, source) {
   debug(`Loading JSONModule ${url}`);
   const pathname = StringPrototypeStartsWith(url, 'file:') ?
     fileURLToPath(url) : null;
+  const shouldCheckAndPopulateCJSModuleCache =
+    // We want to involve the CJS loader cache only for `file:` URL with no search query and no hash.
+    pathname && !StringPrototypeIncludes(url, '?') && !StringPrototypeIncludes(url, '#');
   let modulePath;
   let module;
-  if (pathname) {
+  if (shouldCheckAndPopulateCJSModuleCache) {
     modulePath = isWindows ?
       StringPrototypeReplaceAll(pathname, '/', '\\') : pathname;
     module = CJSModule._cache[modulePath];
@@ -404,7 +472,7 @@ translators.set('json', function jsonStrategy(url, source) {
     }
   }
   source = stringify(source);
-  if (pathname) {
+  if (shouldCheckAndPopulateCJSModuleCache) {
     // A require call could have been called on the same file during loading and
     // that resolves synchronously. To make sure we always return the identical
     // export, we have to check again if the module already exists or not.
@@ -431,7 +499,7 @@ translators.set('json', function jsonStrategy(url, source) {
     err.message = errPath(url) + ': ' + err.message;
     throw err;
   }
-  if (pathname) {
+  if (shouldCheckAndPopulateCJSModuleCache) {
     CJSModule._cache[modulePath] = module;
   }
   cjsCache.set(url, module);
diff --git a/lib/internal/modules/esm/utils.js b/lib/internal/modules/esm/utils.js
index 82d892a96f1936..9d3e1aefbe3a31 100644
--- a/lib/internal/modules/esm/utils.js
+++ b/lib/internal/modules/esm/utils.js
@@ -13,6 +13,12 @@ const {
   },
 } = internalBinding('util');
 const {
+  default_host_defined_options,
+  vm_dynamic_import_missing_flag,
+} = internalBinding('symbols');
+
+const {
+  ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG,
   ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING,
   ERR_INVALID_ARG_VALUE,
 } = require('internal/errors').codes;
@@ -21,7 +27,7 @@ const {
   loadPreloadModules,
   initializeFrozenIntrinsics,
 } = require('internal/process/pre_execution');
-const { pathToFileURL } = require('internal/url');
+const { getCWDURL } = require('internal/util');
 const {
   setImportModuleDynamicallyCallback,
   setInitializeImportMetaObjectCallback,
@@ -29,18 +35,28 @@ const {
 const assert = require('internal/assert');
 
 let defaultConditions;
+/**
+ * Returns the default conditions for ES module loading.
+ */
 function getDefaultConditions() {
   assert(defaultConditions !== undefined);
   return defaultConditions;
 }
 
+/** @type {Set<string>} */
 let defaultConditionsSet;
+/**
+ * Returns the default conditions for ES module loading, as a Set.
+ */
 function getDefaultConditionsSet() {
   assert(defaultConditionsSet !== undefined);
   return defaultConditionsSet;
 }
 
-// This function is called during pre-execution, before any user code is run.
+/**
+ * Initializes the default conditions for ESM module loading.
+ * This function is called during pre-execution, before any user code is run.
+ */
 function initializeDefaultConditions() {
   const userConditions = getOptionValue('--conditions');
   const noAddons = getOptionValue('--no-addons');
@@ -74,7 +90,7 @@ function getConditionsSet(conditions) {
  * @callback ImportModuleDynamicallyCallback
  * @param {string} specifier
  * @param {ModuleWrap|ContextifyScript|Function|vm.Module} callbackReferrer
- * @param {object} assertions
+ * @param {Record<string, string>} attributes
  * @returns { Promise<void> }
  */
 
@@ -118,12 +134,24 @@ const moduleRegistries = new SafeWeakMap();
  */
 function registerModule(referrer, registry) {
   const idSymbol = referrer[host_defined_option_symbol];
+  if (idSymbol === default_host_defined_options ||
+      idSymbol === vm_dynamic_import_missing_flag) {
+    // The referrer is compiled without custom callbacks, so there is
+    // no registry to hold on to. We'll throw
+    // ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING when a callback is
+    // needed.
+    return;
+  }
   // To prevent it from being GC'ed.
   registry.callbackReferrer ??= referrer;
   moduleRegistries.set(idSymbol, registry);
 }
 
-// The native callback
+/**
+ * Defines the `import.meta` object for a given module.
+ * @param {symbol} symbol - Reference to the module.
+ * @param {Record<string, string | Function>} meta - The import.meta object to initialize.
+ */
 function initializeImportMetaObject(symbol, meta) {
   if (moduleRegistries.has(symbol)) {
     const { initializeImportMeta, callbackReferrer } = moduleRegistries.get(symbol);
@@ -133,20 +161,34 @@ function initializeImportMetaObject(symbol, meta) {
   }
 }
 
-// The native callback
-async function importModuleDynamicallyCallback(symbol, specifier, assertions) {
+/**
+ * Asynchronously imports a module dynamically using a callback function. The native callback.
+ * @param {symbol} symbol - Reference to the module.
+ * @param {string} specifier - The module specifier string.
+ * @param {Record<string, string>} attributes - The import attributes object.
+ * @returns {Promise<import('internal/modules/esm/loader.js').ModuleExports>} - The imported module object.
+ * @throws {ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING} - If the callback function is missing.
+ */
+async function importModuleDynamicallyCallback(symbol, specifier, attributes) {
   if (moduleRegistries.has(symbol)) {
     const { importModuleDynamically, callbackReferrer } = moduleRegistries.get(symbol);
     if (importModuleDynamically !== undefined) {
-      return importModuleDynamically(specifier, callbackReferrer, assertions);
+      return importModuleDynamically(specifier, callbackReferrer, attributes);
     }
   }
+  if (symbol === vm_dynamic_import_missing_flag) {
+    throw new ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG();
+  }
   throw new ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING();
 }
 
-// This is configured during pre-execution. Specifically it's set to true for
-// the loader worker in internal/main/worker_thread.js.
 let _isLoaderWorker = false;
+/**
+ * Initializes handling of ES modules.
+ * This is configured during pre-execution. Specifically it's set to true for
+ * the loader worker in internal/main/worker_thread.js.
+ * @param {boolean} [isLoaderWorker=false] - A boolean indicating whether the loader is a worker or not.
+ */
 function initializeESM(isLoaderWorker = false) {
   _isLoaderWorker = isLoaderWorker;
   initializeDefaultConditions();
@@ -156,22 +198,20 @@ function initializeESM(isLoaderWorker = false) {
   setImportModuleDynamicallyCallback(importModuleDynamicallyCallback);
 }
 
+/**
+ * Determine whether the current process is a loader worker.
+ * @returns {boolean} Whether the current process is a loader worker.
+ */
 function isLoaderWorker() {
   return _isLoaderWorker;
 }
 
+/**
+ * Register module customization hooks.
+ */
 async function initializeHooks() {
   const customLoaderURLs = getOptionValue('--experimental-loader');
 
-  let cwd;
-  try {
-    // `process.cwd()` can fail if the parent directory is deleted while the process runs.
-    cwd = process.cwd() + '/';
-  } catch {
-    cwd = '/';
-  }
-
-
   const { Hooks } = require('internal/modules/esm/hooks');
   const esmLoader = require('internal/process/esm_loader').esmLoader;
 
@@ -188,7 +228,7 @@ async function initializeHooks() {
   loadPreloadModules();
   initializeFrozenIntrinsics();
 
-  const parentURL = pathToFileURL(cwd).href;
+  const parentURL = getCWDURL().href;
   for (let i = 0; i < customLoaderURLs.length; i++) {
     await hooks.register(
       customLoaderURLs[i],
diff --git a/lib/internal/modules/esm/worker.js b/lib/internal/modules/esm/worker.js
index 5ff9ca4e87a415..311d77fb099384 100644
--- a/lib/internal/modules/esm/worker.js
+++ b/lib/internal/modules/esm/worker.js
@@ -1,18 +1,14 @@
 'use strict';
 
 const {
+  AtomicsAdd,
+  AtomicsNotify,
   DataViewPrototypeGetBuffer,
   Int32Array,
   PromisePrototypeThen,
   ReflectApply,
   SafeSet,
   TypedArrayPrototypeGetBuffer,
-  globalThis: {
-    Atomics: {
-      add: AtomicsAdd,
-      notify: AtomicsNotify,
-    },
-  },
 } = primordials;
 const assert = require('internal/assert');
 const { clearImmediate, setImmediate } = require('timers');
@@ -32,6 +28,11 @@ const {
 const { initializeHooks } = require('internal/modules/esm/utils');
 const { isMarkedAsUntransferable } = require('internal/buffer');
 
+/**
+ * Transfers an ArrayBuffer, TypedArray, or DataView to a worker thread.
+ * @param {boolean} hasError - Whether an error occurred during transfer.
+ * @param {ArrayBuffer | TypedArray | DataView} source - The data to transfer.
+ */
 function transferArrayBuffer(hasError, source) {
   if (hasError || source == null) { return; }
   let arrayBuffer;
@@ -47,6 +48,11 @@ function transferArrayBuffer(hasError, source) {
   }
 }
 
+/**
+ * Wraps a message with a status and body, and serializes the body if necessary.
+ * @param {string} status - The status of the message.
+ * @param {unknown} body - The body of the message.
+ */
 function wrapMessage(status, body) {
   if (status === 'success' || body === null ||
      (typeof body !== 'object' &&
@@ -73,6 +79,14 @@ function wrapMessage(status, body) {
   };
 }
 
+/**
+ * Initializes a worker thread for a customized module loader.
+ * @param {SharedArrayBuffer} lock - The lock used to synchronize communication between the worker and the main thread.
+ * @param {MessagePort} syncCommPort - The message port used for synchronous communication between the worker and the
+ * main thread.
+ * @param {(err: Error, origin?: string) => void} errorHandler - The function to use for uncaught exceptions.
+ * @returns {Promise<void>} A promise that resolves when the worker thread has been initialized.
+ */
 async function customizedModuleWorker(lock, syncCommPort, errorHandler) {
   let hooks;
   let initializationError;
@@ -114,6 +128,9 @@ async function customizedModuleWorker(lock, syncCommPort, errorHandler) {
   AtomicsNotify(lock, WORKER_TO_MAIN_THREAD_NOTIFICATION);
 
   let immediate;
+  /**
+   * Checks for messages on the syncCommPort and handles them asynchronously.
+   */
   function checkForMessages() {
     immediate = setImmediate(checkForMessages).unref();
     // We need to let the event loop tick a few times to give the main thread a chance to send
@@ -147,6 +164,13 @@ async function customizedModuleWorker(lock, syncCommPort, errorHandler) {
     setImmediate(() => {});
   });
 
+  /**
+   * Handles incoming messages from the main thread or other workers.
+   * @param {object} options - The options object.
+   * @param {string} options.method - The name of the hook.
+   * @param {Array} options.args - The arguments to pass to the method.
+   * @param {MessagePort} options.port - The message port to use for communication.
+   */
   async function handleMessage({ method, args, port }) {
     // Each potential exception needs to be caught individually so that the correct error is sent to
     // the main thread.
@@ -205,11 +229,19 @@ async function customizedModuleWorker(lock, syncCommPort, errorHandler) {
 }
 
 /**
+ * Initializes a worker thread for a module with customized hooks.
  * ! Run everything possible within this function so errors get reported.
+ * @param {{lock: SharedArrayBuffer}} workerData - The lock used to synchronize with the main thread.
+ * @param {MessagePort} syncCommPort - The communication port used to communicate with the main thread.
  */
 module.exports = function setupModuleWorker(workerData, syncCommPort) {
   const lock = new Int32Array(workerData.lock);
 
+  /**
+   * Handles errors that occur in the worker thread.
+   * @param {Error} err - The error that occurred.
+   * @param {string} [origin='unhandledRejection'] - The origin of the error.
+   */
   function errorHandler(err, origin = 'unhandledRejection') {
     AtomicsAdd(lock, WORKER_TO_MAIN_THREAD_NOTIFICATION, 1);
     AtomicsNotify(lock, WORKER_TO_MAIN_THREAD_NOTIFICATION);
diff --git a/lib/internal/modules/helpers.js b/lib/internal/modules/helpers.js
index 307a34cb09b512..7f2959cc469dc1 100644
--- a/lib/internal/modules/helpers.js
+++ b/lib/internal/modules/helpers.js
@@ -21,6 +21,8 @@ const {
 const { BuiltinModule } = require('internal/bootstrap/realm');
 
 const { validateString } = require('internal/validators');
+const fs = require('fs'); // Import all of `fs` so that it can be monkey-patched.
+const internalFS = require('internal/fs/utils');
 const path = require('path');
 const { pathToFileURL, fileURLToPath, URL } = require('internal/url');
 
@@ -37,7 +39,30 @@ let debug = require('internal/util/debuglog').debuglog('module', (fn) => {
   debug = fn;
 });
 
+/** @typedef {import('internal/modules/cjs/loader.js').Module} Module */
+
+/**
+ * Cache for storing resolved real paths of modules.
+ * In order to minimize unnecessary lstat() calls, this cache is a list of known-real paths.
+ * Set to an empty Map to reset.
+ * @type {Map<string, string>}
+ */
+const realpathCache = new SafeMap();
+/**
+ * Resolves the path of a given `require` specifier, following symlinks.
+ * @param {string} requestPath The `require` specifier
+ */
+function toRealPath(requestPath) {
+  return fs.realpathSync(requestPath, {
+    [internalFS.realpathCacheKey]: realpathCache,
+  });
+}
+
+/** @type {Set<string>} */
 let cjsConditions;
+/**
+ * Define the conditions that apply to the CommonJS loader.
+ */
 function initializeCjsConditions() {
   const userConditions = getOptionValue('--conditions');
   const noAddons = getOptionValue('--no-addons');
@@ -51,6 +76,9 @@ function initializeCjsConditions() {
   ]);
 }
 
+/**
+ * Get the conditions that apply to the CommonJS loader.
+ */
 function getCjsConditions() {
   if (cjsConditions === undefined) {
     initializeCjsConditions();
@@ -58,27 +86,45 @@ function getCjsConditions() {
   return cjsConditions;
 }
 
-function loadBuiltinModule(filename, request) {
-  if (!BuiltinModule.canBeRequiredByUsers(filename)) {
+/**
+ * Provide one of Node.js' public modules to user code.
+ * @param {string} id - The identifier/specifier of the builtin module to load
+ * @param {string} request - The module requiring or importing the builtin module
+ */
+function loadBuiltinModule(id, request) {
+  if (!BuiltinModule.canBeRequiredByUsers(id)) {
     return;
   }
-  const mod = BuiltinModule.map.get(filename);
+  /** @type {import('internal/bootstrap/realm.js').BuiltinModule} */
+  const mod = BuiltinModule.map.get(id);
   debug('load built-in module %s', request);
   // compileForPublicLoader() throws if canBeRequiredByUsers is false:
   mod.compileForPublicLoader();
   return mod;
 }
 
+/** @type {Module} */
 let $Module = null;
+/**
+ * Import the Module class on first use.
+ */
 function lazyModule() {
   $Module = $Module || require('internal/modules/cjs/loader').Module;
   return $Module;
 }
 
-// Invoke with makeRequireFunction(module) where |module| is the Module object
-// to use as the context for the require() function.
-// Use redirects to set up a mapping from a policy and restrict dependencies
+/**
+ * Invoke with `makeRequireFunction(module)` where `module` is the `Module` object to use as the context for the
+ * `require()` function.
+ * Use redirects to set up a mapping from a policy and restrict dependencies.
+ */
 const urlToFileCache = new SafeMap();
+/**
+ * Create the module-scoped `require` function to pass into CommonJS modules.
+ * @param {Module} mod - The module to create the `require` function for.
+ * @param {ReturnType<import('internal/policy/manifest.js').Manifest['getDependencyMapper']>} redirects
+ * @typedef {(specifier: string) => unknown} RequireFunction
+ */
 function makeRequireFunction(mod, redirects) {
   // lazy due to cycle
   const Module = lazyModule();
@@ -86,6 +132,7 @@ function makeRequireFunction(mod, redirects) {
     throw new ERR_INVALID_ARG_TYPE('mod', 'Module', mod);
   }
 
+  /** @type {RequireFunction} */
   let require;
   if (redirects) {
     const id = mod.filename || mod.id;
@@ -131,6 +178,11 @@ function makeRequireFunction(mod, redirects) {
     };
   }
 
+  /**
+   * The `resolve` method that gets attached to module-scope `require`.
+   * @param {string} request
+   * @param {Parameters<Module['_resolveFilename']>[3]} options
+   */
   function resolve(request, options) {
     validateString(request, 'request');
     return Module._resolveFilename(request, mod, false, options);
@@ -138,6 +190,10 @@ function makeRequireFunction(mod, redirects) {
 
   require.resolve = resolve;
 
+  /**
+   * The `paths` method that gets attached to module-scope `require`.
+   * @param {string} request
+   */
   function paths(request) {
     validateString(request, 'request');
     return Module._resolveLookupPaths(request, mod);
@@ -159,6 +215,7 @@ function makeRequireFunction(mod, redirects) {
  * Remove byte order marker. This catches EF BB BF (the UTF-8 BOM)
  * because the buffer-to-string conversion in `fs.readFileSync()`
  * translates it to FEFF, the UTF-16 BOM.
+ * @param {string} content
  */
 function stripBOM(content) {
   if (StringPrototypeCharCodeAt(content) === 0xFEFF) {
@@ -167,6 +224,11 @@ function stripBOM(content) {
   return content;
 }
 
+/**
+ * Add built-in modules to a global or REPL scope object.
+ * @param {Record<string, unknown>} object - The object such as `globalThis` to add the built-in modules to.
+ * @param {string} dummyModuleName - The label representing the set of built-in modules to add.
+ */
 function addBuiltinLibsToObject(object, dummyModuleName) {
   // Make built-in modules available directly (loaded lazily).
   const Module = require('internal/modules/cjs/loader').Module;
@@ -227,9 +289,8 @@ function addBuiltinLibsToObject(object, dummyModuleName) {
 }
 
 /**
- *
+ * If a referrer is an URL instance or absolute path, convert it into an URL string.
  * @param {string | URL} referrer
- * @returns {string}
  */
 function normalizeReferrerURL(referrer) {
   if (typeof referrer === 'string' && path.isAbsolute(referrer)) {
@@ -238,7 +299,10 @@ function normalizeReferrerURL(referrer) {
   return new URL(referrer).href;
 }
 
-// For error messages only - used to check if ESM syntax is in use.
+/**
+ * For error messages only, check if ESM syntax is in use.
+ * @param {string} code
+ */
 function hasEsmSyntax(code) {
   debug('Checking for ESM syntax');
   const parser = require('internal/deps/acorn/acorn/dist/acorn').Parser;
@@ -265,4 +329,5 @@ module.exports = {
   makeRequireFunction,
   normalizeReferrerURL,
   stripBOM,
+  toRealPath,
 };
diff --git a/lib/internal/modules/package_json_reader.js b/lib/internal/modules/package_json_reader.js
index c4afd159ebdb63..65f5ce3551bbd0 100644
--- a/lib/internal/modules/package_json_reader.js
+++ b/lib/internal/modules/package_json_reader.js
@@ -4,12 +4,17 @@ const {
   JSONParse,
   ObjectPrototypeHasOwnProperty,
   SafeMap,
+  StringPrototypeEndsWith,
+  StringPrototypeIndexOf,
+  StringPrototypeLastIndexOf,
+  StringPrototypeSlice,
 } = primordials;
 const {
   ERR_INVALID_PACKAGE_CONFIG,
 } = require('internal/errors').codes;
 const { internalModuleReadJSON } = internalBinding('fs');
-const { toNamespacedPath } = require('path');
+const { resolve, sep, toNamespacedPath } = require('path');
+const permission = require('internal/process/permission');
 const { kEmptyObject, setOwnProperty } = require('internal/util');
 
 const { fileURLToPath, pathToFileURL } = require('internal/url');
@@ -111,4 +116,47 @@ function read(jsonPath, { base, specifier, isESM } = kEmptyObject) {
   return result;
 }
 
-module.exports = { read };
+/**
+ * @param {string} requestPath
+ * @return {PackageConfig}
+ */
+function readPackage(requestPath) {
+  return read(resolve(requestPath, 'package.json'));
+}
+
+/**
+ * Get the nearest parent package.json file from a given path.
+ * Return the package.json data and the path to the package.json file, or false.
+ * @param {string} checkPath The path to start searching from.
+ */
+function readPackageScope(checkPath) {
+  const rootSeparatorIndex = StringPrototypeIndexOf(checkPath, sep);
+  let separatorIndex;
+  const enabledPermission = permission.isEnabled();
+  do {
+    separatorIndex = StringPrototypeLastIndexOf(checkPath, sep);
+    checkPath = StringPrototypeSlice(checkPath, 0, separatorIndex);
+    // Stop the search when the process doesn't have permissions
+    // to walk upwards
+    if (enabledPermission && !permission.has('fs.read', checkPath + sep)) {
+      return false;
+    }
+    if (StringPrototypeEndsWith(checkPath, sep + 'node_modules')) {
+      return false;
+    }
+    const pjson = readPackage(checkPath + sep);
+    if (pjson.exists) {
+      return {
+        data: pjson,
+        path: checkPath,
+      };
+    }
+  } while (separatorIndex > rootSeparatorIndex);
+  return false;
+}
+
+module.exports = {
+  read,
+  readPackage,
+  readPackageScope,
+};
diff --git a/lib/internal/modules/run_main.js b/lib/internal/modules/run_main.js
index 7636d27f3aee71..a9828286a9c0e0 100644
--- a/lib/internal/modules/run_main.js
+++ b/lib/internal/modules/run_main.js
@@ -7,23 +7,50 @@ const {
 const { getOptionValue } = require('internal/options');
 const path = require('path');
 
+/**
+ * Get the absolute path to the main entry point.
+ * @param {string} main - Entry point path
+ */
 function resolveMainPath(main) {
-  // Note extension resolution for the main entry point can be deprecated in a
-  // future major.
-  // Module._findPath is monkey-patchable here.
-  const { Module, toRealPath } = require('internal/modules/cjs/loader');
-  let mainPath = Module._findPath(path.resolve(main), null, true);
+  const defaultType = getOptionValue('--experimental-default-type');
+  /** @type {string} */
+  let mainPath;
+  if (defaultType === 'module') {
+    if (getOptionValue('--preserve-symlinks-main')) { return; }
+    mainPath = path.resolve(main);
+  } else {
+    // Extension searching for the main entry point is supported only in legacy mode.
+    // Module._findPath is monkey-patchable here.
+    const { Module } = require('internal/modules/cjs/loader');
+    mainPath = Module._findPath(path.resolve(main), null, true);
+  }
   if (!mainPath) { return; }
 
   const preserveSymlinksMain = getOptionValue('--preserve-symlinks-main');
   if (!preserveSymlinksMain) {
-    mainPath = toRealPath(mainPath);
+    const { toRealPath } = require('internal/modules/helpers');
+    try {
+      mainPath = toRealPath(mainPath);
+    } catch (err) {
+      if (defaultType === 'module' && err?.code === 'ENOENT') {
+        const { decorateErrorWithCommonJSHints } = require('internal/modules/esm/resolve');
+        const { getCWDURL } = require('internal/util');
+        decorateErrorWithCommonJSHints(err, mainPath, getCWDURL());
+      }
+      throw err;
+    }
   }
 
   return mainPath;
 }
 
+/**
+ * Determine whether the main entry point should be loaded through the ESM Loader.
+ * @param {string} mainPath - Absolute path to the main entry point
+ */
 function shouldUseESMLoader(mainPath) {
+  if (getOptionValue('--experimental-default-type') === 'module') { return true; }
+
   /**
    * @type {string[]} userLoaders A list of custom loaders registered by the user
    * (or an empty list when none have been registered).
@@ -35,25 +62,35 @@ function shouldUseESMLoader(mainPath) {
    */
   const userImports = getOptionValue('--import');
   if (userLoaders.length > 0 || userImports.length > 0) { return true; }
-  const { readPackageScope } = require('internal/modules/cjs/loader');
-  // Determine the module format of the main
+
+  // Determine the module format of the entry point.
   if (mainPath && StringPrototypeEndsWith(mainPath, '.mjs')) { return true; }
   if (!mainPath || StringPrototypeEndsWith(mainPath, '.cjs')) { return false; }
+
+  const { readPackageScope } = require('internal/modules/package_json_reader');
   const pkg = readPackageScope(mainPath);
-  return pkg && pkg.data.type === 'module';
+  // No need to guard `pkg` as it can only be an object or `false`.
+  return pkg.data?.type === 'module' || getOptionValue('--experimental-default-type') === 'module';
 }
 
+/**
+ * Run the main entry point through the ESM Loader.
+ * @param {string} mainPath - Absolute path for the main entry point
+ */
 function runMainESM(mainPath) {
   const { loadESM } = require('internal/process/esm_loader');
   const { pathToFileURL } = require('internal/url');
+  const main = pathToFileURL(mainPath).href;
 
   handleMainPromise(loadESM((esmLoader) => {
-    const main = path.isAbsolute(mainPath) ?
-      pathToFileURL(mainPath).href : mainPath;
     return esmLoader.import(main, undefined, { __proto__: null });
   }));
 }
 
+/**
+ * Handle process exit events around the main entry point promise.
+ * @param {Promise} promise - Main entry point promise
+ */
 async function handleMainPromise(promise) {
   const {
     handleProcessExit,
@@ -66,9 +103,14 @@ async function handleMainPromise(promise) {
   }
 }
 
-// For backwards compatibility, we have to run a bunch of
-// monkey-patchable code that belongs to the CJS loader (exposed by
-// `require('module')`) even when the entry point is ESM.
+/**
+ * Parse the CLI main entry point string and run it.
+ * For backwards compatibility, we have to run a bunch of monkey-patchable code that belongs to the CJS loader (exposed
+ * by `require('module')`) even when the entry point is ESM.
+ * This monkey-patchable code is bypassed under `--experimental-default-type=module`.
+ * Because of backwards compatibility, this function is exposed publicly via `import { runMain } from 'node:module'`.
+ * @param {string} main - First positional CLI argument, such as `'entry.js'` from `node entry.js`
+ */
 function executeUserEntryPoint(main = process.argv[1]) {
   const resolvedMain = resolveMainPath(main);
   const useESMLoader = shouldUseESMLoader(resolvedMain);
diff --git a/lib/internal/navigator.js b/lib/internal/navigator.js
index 3b8343cd7ed6f8..5971891ea73cc9 100644
--- a/lib/internal/navigator.js
+++ b/lib/internal/navigator.js
@@ -27,7 +27,7 @@ class Navigator {
     if (arguments[0] === kInitialize) {
       return;
     }
-    throw ERR_ILLEGAL_CONSTRUCTOR();
+    throw new ERR_ILLEGAL_CONSTRUCTOR();
   }
 
   /**
diff --git a/lib/internal/per_context/primordials.js b/lib/internal/per_context/primordials.js
index 64438ddd5219f1..c4f2b12aff2cba 100644
--- a/lib/internal/per_context/primordials.js
+++ b/lib/internal/per_context/primordials.js
@@ -172,6 +172,7 @@ function copyPrototype(src, dest, prefix) {
 
 // Create copies of the namespace objects
 [
+  'Atomics',
   'JSON',
   'Math',
   'Proxy',
diff --git a/lib/internal/perf/observe.js b/lib/internal/perf/observe.js
index b97ae08402260a..244d01f541d886 100644
--- a/lib/internal/perf/observe.js
+++ b/lib/internal/perf/observe.js
@@ -15,7 +15,6 @@ const {
   ObjectDefineProperties,
   ObjectFreeze,
   ObjectKeys,
-  ReflectConstruct,
   SafeMap,
   SafeSet,
   Symbol,
@@ -171,9 +170,18 @@ function maybeIncrementObserverCount(type) {
   }
 }
 
+const kSkipThrow = Symbol('kSkipThrow');
+const performanceObserverSorter = (first, second) => {
+  return first.startTime - second.startTime;
+};
+
 class PerformanceObserverEntryList {
-  constructor() {
-    throw new ERR_ILLEGAL_CONSTRUCTOR();
+  constructor(skipThrowSymbol = undefined, entries = []) {
+    if (skipThrowSymbol !== kSkipThrow) {
+      throw new ERR_ILLEGAL_CONSTRUCTOR();
+    }
+
+    this[kBuffer] = ArrayPrototypeSort(entries, performanceObserverSorter);
   }
 
   getEntries() {
@@ -232,14 +240,6 @@ ObjectDefineProperties(PerformanceObserverEntryList.prototype, {
   },
 });
 
-function createPerformanceObserverEntryList(entries) {
-  return ReflectConstruct(function PerformanceObserverEntryList() {
-    this[kBuffer] = ArrayPrototypeSort(entries, (first, second) => {
-      return first.startTime - second.startTime;
-    });
-  }, [], PerformanceObserverEntryList);
-}
-
 class PerformanceObserver {
   #buffer = [];
   #entryTypes = new SafeSet();
@@ -349,8 +349,9 @@ class PerformanceObserver {
   }
 
   [kDispatch]() {
-    this.#callback(createPerformanceObserverEntryList(this.takeRecords()),
-                   this);
+    const entryList = new PerformanceObserverEntryList(kSkipThrow, this.takeRecords());
+
+    this.#callback(entryList, this);
   }
 
   [kInspect](depth, options) {
@@ -523,9 +524,7 @@ function filterBufferMapByNameAndType(name, type) {
     bufferList = ArrayPrototypeSlice(bufferList);
   }
 
-  return ArrayPrototypeSort(bufferList, (first, second) => {
-    return first.startTime - second.startTime;
-  });
+  return ArrayPrototypeSort(bufferList, performanceObserverSorter);
 }
 
 function observerCallback(name, type, startTime, duration, details) {
diff --git a/lib/internal/perf/performance_entry.js b/lib/internal/perf/performance_entry.js
index 036bfc173bd024..76af221a5d1ae2 100644
--- a/lib/internal/perf/performance_entry.js
+++ b/lib/internal/perf/performance_entry.js
@@ -2,7 +2,6 @@
 
 const {
   ObjectDefineProperties,
-  ReflectConstruct,
   Symbol,
 } = primordials;
 
@@ -25,14 +24,28 @@ const kEntryType = Symbol('PerformanceEntry.EntryType');
 const kStartTime = Symbol('PerformanceEntry.StartTime');
 const kDuration = Symbol('PerformanceEntry.Duration');
 const kDetail = Symbol('NodePerformanceEntry.Detail');
+const kSkipThrow = Symbol('kSkipThrow');
 
 function isPerformanceEntry(obj) {
   return obj?.[kName] !== undefined;
 }
 
 class PerformanceEntry {
-  constructor() {
-    throw new ERR_ILLEGAL_CONSTRUCTOR();
+  constructor(
+    skipThrowSymbol = undefined,
+    name = undefined,
+    type = undefined,
+    start = undefined,
+    duration = undefined,
+  ) {
+    if (skipThrowSymbol !== kSkipThrow) {
+      throw new ERR_ILLEGAL_CONSTRUCTOR();
+    }
+
+    this[kName] = name;
+    this[kEntryType] = type;
+    this[kStartTime] = start;
+    this[kDuration] = duration;
   }
 
   get name() {
@@ -84,17 +97,8 @@ ObjectDefineProperties(PerformanceEntry.prototype, {
   toJSON: kEnumerableProperty,
 });
 
-function initPerformanceEntry(entry, name, type, start, duration) {
-  entry[kName] = name;
-  entry[kEntryType] = type;
-  entry[kStartTime] = start;
-  entry[kDuration] = duration;
-}
-
 function createPerformanceEntry(name, type, start, duration) {
-  return ReflectConstruct(function PerformanceEntry() {
-    initPerformanceEntry(this, name, type, start, duration);
-  }, [], PerformanceEntry);
+  return new PerformanceEntry(kSkipThrow, name, type, start, duration);
 }
 
 /**
@@ -119,17 +123,18 @@ class PerformanceNodeEntry extends PerformanceEntry {
 }
 
 function createPerformanceNodeEntry(name, type, start, duration, detail) {
-  return ReflectConstruct(function PerformanceNodeEntry() {
-    initPerformanceEntry(this, name, type, start, duration);
-    this[kDetail] = detail;
-  }, [], PerformanceNodeEntry);
+  const entry = new PerformanceNodeEntry(kSkipThrow, name, type, start, duration);
+
+  entry[kDetail] = detail;
+
+  return entry;
 }
 
 module.exports = {
-  initPerformanceEntry,
   createPerformanceEntry,
   PerformanceEntry,
   isPerformanceEntry,
   PerformanceNodeEntry,
   createPerformanceNodeEntry,
+  kSkipThrow,
 };
diff --git a/lib/internal/perf/resource_timing.js b/lib/internal/perf/resource_timing.js
index 13f25d0af79cf7..e7c2f1fa448864 100644
--- a/lib/internal/perf/resource_timing.js
+++ b/lib/internal/perf/resource_timing.js
@@ -3,19 +3,17 @@
 
 const {
   ObjectDefineProperties,
-  ObjectSetPrototypeOf,
-  ReflectConstruct,
   Symbol,
   SymbolToStringTag,
 } = primordials;
-const { initPerformanceEntry, PerformanceEntry } = require('internal/perf/performance_entry');
-const assert = require('internal/assert');
-const { enqueue, bufferResourceTiming } = require('internal/perf/observe');
 const {
   codes: {
     ERR_ILLEGAL_CONSTRUCTOR,
   },
 } = require('internal/errors');
+const { PerformanceEntry, kSkipThrow } = require('internal/perf/performance_entry');
+const assert = require('internal/assert');
+const { enqueue, bufferResourceTiming } = require('internal/perf/observe');
 const { validateInternalField } = require('internal/validators');
 const { kEnumerableProperty } = require('internal/util');
 
@@ -25,8 +23,12 @@ const kTimingInfo = Symbol('kTimingInfo');
 const kInitiatorType = Symbol('kInitiatorType');
 
 class PerformanceResourceTiming extends PerformanceEntry {
-  constructor() {
-    throw new ERR_ILLEGAL_CONSTRUCTOR();
+  constructor(skipThrowSymbol = undefined, name = undefined, type = undefined) {
+    if (skipThrowSymbol !== kSkipThrow) {
+      throw new ERR_ILLEGAL_CONSTRUCTOR();
+    }
+
+    super(skipThrowSymbol, name, type);
   }
 
   get name() {
@@ -189,16 +191,17 @@ ObjectDefineProperties(PerformanceResourceTiming.prototype, {
 });
 
 function createPerformanceResourceTiming(requestedUrl, initiatorType, timingInfo, cacheMode = '') {
-  return ReflectConstruct(function PerformanceResourceTiming() {
-    initPerformanceEntry(this, requestedUrl, 'resource');
-    this[kInitiatorType] = initiatorType;
-    this[kRequestedUrl] = requestedUrl;
-    // https://fetch.spec.whatwg.org/#fetch-timing-info
-    // This class is using timingInfo assuming it's already validated.
-    // The spec doesn't say to validate it in the class construction.
-    this[kTimingInfo] = timingInfo;
-    this[kCacheMode] = cacheMode;
-  }, [], PerformanceResourceTiming);
+  const resourceTiming = new PerformanceResourceTiming(kSkipThrow, requestedUrl, 'resource');
+
+  resourceTiming[kInitiatorType] = initiatorType;
+  resourceTiming[kRequestedUrl] = requestedUrl;
+  // https://fetch.spec.whatwg.org/#fetch-timing-info
+  // This class is using timingInfo assuming it's already validated.
+  // The spec doesn't say to validate it in the class construction.
+  resourceTiming[kTimingInfo] = timingInfo;
+  resourceTiming[kCacheMode] = cacheMode;
+
+  return resourceTiming;
 }
 
 // https://w3c.github.io/resource-timing/#dfn-mark-resource-timing
@@ -221,7 +224,6 @@ function markResourceTiming(
     cacheMode,
   );
 
-  ObjectSetPrototypeOf(resource, PerformanceResourceTiming.prototype);
   enqueue(resource);
   bufferResourceTiming(resource);
   return resource;
diff --git a/lib/internal/perf/usertiming.js b/lib/internal/perf/usertiming.js
index 42c343a632be40..ff417d94700550 100644
--- a/lib/internal/perf/usertiming.js
+++ b/lib/internal/perf/usertiming.js
@@ -2,16 +2,14 @@
 
 const {
   ObjectDefineProperties,
-  ObjectSetPrototypeOf,
   SafeMap,
   SafeSet,
   SafeArrayIterator,
   Symbol,
   SymbolToStringTag,
-  ReflectConstruct,
 } = primordials;
 
-const { initPerformanceEntry, PerformanceEntry } = require('internal/perf/performance_entry');
+const { PerformanceEntry, kSkipThrow } = require('internal/perf/performance_entry');
 const { now } = require('internal/perf/utils');
 const { enqueue, bufferUserTiming } = require('internal/perf/observe');
 const nodeTiming = require('internal/perf/nodetiming');
@@ -35,7 +33,6 @@ const {
 
 const { structuredClone } = require('internal/structured_clone');
 const {
-  kEmptyObject,
   lazyDOMException,
   kEnumerableProperty,
 } = require('internal/util');
@@ -69,27 +66,29 @@ function getMark(name) {
   return ts;
 }
 
-class PerformanceMark {
-  constructor(name, options = kEmptyObject) {
+class PerformanceMark extends PerformanceEntry {
+  constructor(name, options = undefined) {
     if (arguments.length === 0) {
       throw new ERR_MISSING_ARGS('name');
     }
     name = `${name}`;
-    options ??= kEmptyObject;
     if (nodeTimingReadOnlyAttributes.has(name))
       throw new ERR_INVALID_ARG_VALUE('name', name);
-    validateObject(options, 'options');
-    const startTime = options.startTime ?? now();
+    if (options != null) {
+      validateObject(options, 'options');
+    }
+    const startTime = options?.startTime ?? now();
     validateNumber(startTime, 'startTime');
     if (startTime < 0)
       throw new ERR_PERFORMANCE_INVALID_TIMESTAMP(startTime);
     markTimings.set(name, startTime);
 
-    let detail = options.detail;
+    let detail = options?.detail;
     detail = detail != null ?
       structuredClone(detail) :
       null;
-    initPerformanceEntry(this, name, 'mark', startTime, 0);
+
+    super(kSkipThrow, name, 'mark', startTime, 0);
     this[kDetail] = detail;
   }
 
@@ -108,8 +107,7 @@ class PerformanceMark {
     };
   }
 }
-ObjectSetPrototypeOf(PerformanceMark, PerformanceEntry);
-ObjectSetPrototypeOf(PerformanceMark.prototype, PerformanceEntry.prototype);
+
 ObjectDefineProperties(PerformanceMark.prototype, {
   detail: kEnumerableProperty,
   [SymbolToStringTag]: {
@@ -120,8 +118,18 @@ ObjectDefineProperties(PerformanceMark.prototype, {
 });
 
 class PerformanceMeasure extends PerformanceEntry {
-  constructor() {
-    throw new ERR_ILLEGAL_CONSTRUCTOR();
+  constructor(
+    skipThrowSymbol = undefined,
+    name = undefined,
+    type = undefined,
+    start = undefined,
+    duration = undefined,
+  ) {
+    if (skipThrowSymbol !== kSkipThrow) {
+      throw new ERR_ILLEGAL_CONSTRUCTOR();
+    }
+
+    super(skipThrowSymbol, name, type, start, duration);
   }
 
   get detail() {
@@ -139,10 +147,11 @@ ObjectDefineProperties(PerformanceMeasure.prototype, {
 });
 
 function createPerformanceMeasure(name, start, duration, detail) {
-  return ReflectConstruct(function PerformanceMeasure() {
-    initPerformanceEntry(this, name, 'measure', start, duration);
-    this[kDetail] = detail;
-  }, [], PerformanceMeasure);
+  const measure = new PerformanceMeasure(kSkipThrow, name, 'measure', start, duration);
+
+  measure[kDetail] = detail;
+
+  return measure;
 }
 
 function mark(name, options) {
diff --git a/lib/internal/policy/manifest.js b/lib/internal/policy/manifest.js
index fab7d132ca6023..fdba0c9bd98f08 100644
--- a/lib/internal/policy/manifest.js
+++ b/lib/internal/policy/manifest.js
@@ -15,7 +15,6 @@ const {
   StringPrototypeEndsWith,
   StringPrototypeStartsWith,
   Symbol,
-  uncurryThis,
 } = primordials;
 const {
   ERR_MANIFEST_ASSERT_INTEGRITY,
@@ -27,13 +26,8 @@ let debug = require('internal/util/debuglog').debuglog('policy', (fn) => {
   debug = fn;
 });
 const SRI = require('internal/policy/sri');
-const crypto = require('crypto');
-const { Buffer } = require('buffer');
 const { URL } = require('internal/url');
-const { createHash, timingSafeEqual } = crypto;
-const HashUpdate = uncurryThis(crypto.Hash.prototype.update);
-const HashDigest = uncurryThis(crypto.Hash.prototype.digest);
-const BufferToString = uncurryThis(Buffer.prototype.toString);
+const { internalVerifyIntegrity } = internalBinding('crypto');
 const kRelativeURLStringPattern = /^\.{0,2}\//;
 const { getOptionValue } = require('internal/options');
 const shouldAbortOnUncaughtException = getOptionValue(
@@ -589,16 +583,13 @@ class Manifest {
         // Avoid clobbered Symbol.iterator
         for (let i = 0; i < integrityEntries.length; i++) {
           const { algorithm, value: expected } = integrityEntries[i];
-          const hash = createHash(algorithm);
           // TODO(tniessen): the content should not be passed as a string in the
           // first place, see https://github.com/nodejs/node/issues/39707
-          HashUpdate(hash, content, 'utf8');
-          const digest = HashDigest(hash, 'buffer');
-          if (digest.length === expected.length &&
-            timingSafeEqual(digest, expected)) {
+          const mismatchedIntegrity = internalVerifyIntegrity(algorithm, content, expected);
+          if (mismatchedIntegrity === undefined) {
             return true;
           }
-          realIntegrities.set(algorithm, BufferToString(digest, 'base64'));
+          realIntegrities.set(algorithm, mismatchedIntegrity);
         }
       }
 
diff --git a/lib/internal/process/esm_loader.js b/lib/internal/process/esm_loader.js
index e735101ab18c47..a3451ddab307f2 100644
--- a/lib/internal/process/esm_loader.js
+++ b/lib/internal/process/esm_loader.js
@@ -9,8 +9,7 @@ const { getOptionValue } = require('internal/options');
 const {
   hasUncaughtExceptionCaptureCallback,
 } = require('internal/process/execution');
-const { pathToFileURL } = require('internal/url');
-const { kEmptyObject } = require('internal/util');
+const { kEmptyObject, getCWDURL } = require('internal/util');
 
 let esmLoader;
 
@@ -23,14 +22,7 @@ module.exports = {
     try {
       const userImports = getOptionValue('--import');
       if (userImports.length > 0) {
-        let cwd;
-        try {
-          // `process.cwd()` can fail if the parent directory is deleted while the process runs.
-          cwd = process.cwd() + '/';
-        } catch {
-          cwd = '/';
-        }
-        const parentURL = pathToFileURL(cwd).href;
+        const parentURL = getCWDURL().href;
         await SafePromiseAllReturnVoid(userImports, (specifier) => esmLoader.import(
           specifier,
           parentURL,
diff --git a/lib/internal/process/execution.js b/lib/internal/process/execution.js
index 4b77aa47c2cb35..b8c507c798182e 100644
--- a/lib/internal/process/execution.js
+++ b/lib/internal/process/execution.js
@@ -1,6 +1,7 @@
 'use strict';
 
 const {
+  Symbol,
   RegExpPrototypeExec,
   globalThis,
 } = primordials;
@@ -25,7 +26,9 @@ const {
   emitAfter,
   popAsyncContext,
 } = require('internal/async_hooks');
-
+const {
+  makeContextifyScript, runScriptInThisContext,
+} = require('internal/vm');
 // shouldAbortOnUncaughtToggle is a typed array for faster
 // communication with JS.
 const { shouldAbortOnUncaughtToggle } = internalBinding('util');
@@ -53,7 +56,6 @@ function evalModule(source, print) {
 
 function evalScript(name, body, breakFirstLine, print, shouldLoadESM = false) {
   const CJSModule = require('internal/modules/cjs/loader').Module;
-  const { kVmBreakFirstLineSymbol } = require('internal/util');
   const { pathToFileURL } = require('internal/url');
 
   const cwd = tryGetCwd();
@@ -79,16 +81,25 @@ function evalScript(name, body, breakFirstLine, print, shouldLoadESM = false) {
     `;
     globalThis.__filename = name;
     RegExpPrototypeExec(/^/, ''); // Necessary to reset RegExp statics before user code runs.
-    const result = module._compile(script, `${name}-wrapper`)(() =>
-      require('vm').runInThisContext(body, {
-        filename: name,
-        displayErrors: true,
-        [kVmBreakFirstLineSymbol]: !!breakFirstLine,
-        importModuleDynamically(specifier, _, importAssertions) {
-          const loader = asyncESM.esmLoader;
-          return loader.import(specifier, baseUrl, importAssertions);
-        },
-      }));
+    const result = module._compile(script, `${name}-wrapper`)(() => {
+      const hostDefinedOptionId = Symbol(name);
+      async function importModuleDynamically(specifier, _, importAttributes) {
+        const loader = asyncESM.esmLoader;
+        return loader.import(specifier, baseUrl, importAttributes);
+      }
+      const script = makeContextifyScript(
+        body,                    // code
+        name,                    // filename,
+        0,                       // lineOffset
+        0,                       // columnOffset,
+        undefined,               // cachedData
+        false,                   // produceCachedData
+        undefined,               // parsingContext
+        hostDefinedOptionId,     // hostDefinedOptionId
+        importModuleDynamically, // importModuleDynamically
+      );
+      return runScriptInThisContext(script, true, !!breakFirstLine);
+    });
     if (print) {
       const { log } = require('internal/console/global');
       log(result);
diff --git a/lib/internal/process/pre_execution.js b/lib/internal/process/pre_execution.js
index 1f4a08515b5ae9..917ba90a1c8bbb 100644
--- a/lib/internal/process/pre_execution.js
+++ b/lib/internal/process/pre_execution.js
@@ -52,7 +52,7 @@ const {
 } = require('internal/v8/startup_snapshot');
 
 function prepareMainThreadExecution(expandArgv1 = false, initializeModules = true) {
-  prepareExecution({
+  return prepareExecution({
     expandArgv1,
     initializeModules,
     isMainThread: true,
@@ -73,12 +73,12 @@ function prepareExecution(options) {
   refreshRuntimeOptions();
   reconnectZeroFillToggle();
 
-  // Patch the process object with legacy properties and normalizations
-  patchProcessObject(expandArgv1);
+  // Patch the process object and get the resolved main entry point.
+  const mainEntry = patchProcessObject(expandArgv1);
   setupTraceCategoryState();
   setupInspectorHooks();
   setupWarningHandler();
-  setupFetch();
+  setupUndici();
   setupWebCrypto();
   setupCustomEvent();
   setupCodeCoverage();
@@ -131,6 +131,8 @@ function prepareExecution(options) {
   if (initializeModules) {
     setupUserModules();
   }
+
+  return mainEntry;
 }
 
 function setupSymbolDisposePolyfill() {
@@ -176,12 +178,20 @@ function refreshRuntimeOptions() {
   refreshOptions();
 }
 
+/**
+ * Patch the process object with legacy properties and normalizations.
+ * Replace `process.argv[0]` with `process.execPath`, preserving the original `argv[0]` value as `process.argv0`.
+ * Replace `process.argv[1]` with the resolved absolute file path of the entry point, if found.
+ * @param {boolean} expandArgv1 - Whether to replace `process.argv[1]` with the resolved absolute file path of
+ * the main entry point.
+ */
 function patchProcessObject(expandArgv1) {
   const binding = internalBinding('process_methods');
   binding.patchProcessObject(process);
 
   require('internal/process/per_thread').refreshHrtimeBuffer();
 
+  // Since we replace process.argv[0] below, preserve the original value in case the user needs it.
   ObjectDefineProperty(process, 'argv0', {
     __proto__: null,
     enumerable: true,
@@ -194,12 +204,17 @@ function patchProcessObject(expandArgv1) {
   process._exiting = false;
   process.argv[0] = process.execPath;
 
+  /** @type {string} */
+  let mainEntry;
+  // If requested, update process.argv[1] to replace whatever the user provided with the resolved absolute file path of
+  // the entry point.
   if (expandArgv1 && process.argv[1] &&
       !StringPrototypeStartsWith(process.argv[1], '-')) {
     // Expand process.argv[1] into a full path.
     const path = require('path');
     try {
-      process.argv[1] = path.resolve(process.argv[1]);
+      mainEntry = path.resolve(process.argv[1]);
+      process.argv[1] = mainEntry;
     } catch {
       // Continue regardless of error.
     }
@@ -226,6 +241,8 @@ function patchProcessObject(expandArgv1) {
   addReadOnlyProcessAlias('traceDeprecation', '--trace-deprecation');
   addReadOnlyProcessAlias('_breakFirstLine', '--inspect-brk', false);
   addReadOnlyProcessAlias('_breakNodeFirstLine', '--inspect-brk-node', false);
+
+  return mainEntry;
 }
 
 function addReadOnlyProcessAlias(name, option, enumerable = true) {
@@ -262,9 +279,9 @@ function setupWarningHandler() {
 }
 
 // https://fetch.spec.whatwg.org/
-function setupFetch() {
-  if (getEmbedderOptions().noBrowserGlobals ||
-      getOptionValue('--no-experimental-fetch')) {
+// https://websockets.spec.whatwg.org/
+function setupUndici() {
+  if (getEmbedderOptions().noBrowserGlobals) {
     return;
   }
 
@@ -278,12 +295,6 @@ function setupFetch() {
     return undici;
   }
 
-  async function fetch(input, init = undefined) {
-    return lazyUndici().fetch(input, init);
-  }
-
-  defineOperation(globalThis, 'fetch', fetch);
-
   function lazyInterface(name) {
     return {
       configurable: true,
@@ -297,17 +308,32 @@ function setupFetch() {
     };
   }
 
-  ObjectDefineProperties(globalThis, {
-    FormData: lazyInterface('FormData'),
-    Headers: lazyInterface('Headers'),
-    Request: lazyInterface('Request'),
-    Response: lazyInterface('Response'),
-  });
+  if (!getOptionValue('--no-experimental-fetch')) {
+    // Fetch is meant to return a Promise, but not be async.
+    function fetch(input, init = undefined) {
+      return lazyUndici().fetch(input, init);
+    }
 
-  // The WebAssembly Web API: https://webassembly.github.io/spec/web-api
-  internalBinding('wasm_web_api').setImplementation((streamState, source) => {
-    require('internal/wasm_web_api').wasmStreamingCallback(streamState, source);
-  });
+    defineOperation(globalThis, 'fetch', fetch);
+
+    ObjectDefineProperties(globalThis, {
+      FormData: lazyInterface('FormData'),
+      Headers: lazyInterface('Headers'),
+      Request: lazyInterface('Request'),
+      Response: lazyInterface('Response'),
+    });
+
+    // The WebAssembly Web API: https://webassembly.github.io/spec/web-api
+    internalBinding('wasm_web_api').setImplementation((streamState, source) => {
+      require('internal/wasm_web_api').wasmStreamingCallback(streamState, source);
+    });
+  }
+
+  if (getOptionValue('--experimental-websocket')) {
+    ObjectDefineProperties(globalThis, {
+      WebSocket: lazyInterface('WebSocket'),
+    });
+  }
 }
 
 // TODO(aduh95): move this to internal/bootstrap/web/* when the CLI flag is
diff --git a/lib/internal/streams/duplexify.js b/lib/internal/streams/duplexify.js
index 788bcb63242c38..2503b531519066 100644
--- a/lib/internal/streams/duplexify.js
+++ b/lib/internal/streams/duplexify.js
@@ -85,6 +85,11 @@ module.exports = function duplexify(body, name) {
   if (typeof body === 'function') {
     const { value, write, final, destroy } = fromAsyncGen(body);
 
+    // Body might be a constructor function instead of an async generator function.
+    if (isDuplexNodeStream(value)) {
+      return value;
+    }
+
     if (isIterable(value)) {
       return from(Duplexify, value, {
         // TODO (ronag): highWaterMark?
diff --git a/lib/internal/streams/readable.js b/lib/internal/streams/readable.js
index 1b40192d9458ba..a129b1b6f4b75d 100644
--- a/lib/internal/streams/readable.js
+++ b/lib/internal/streams/readable.js
@@ -72,7 +72,7 @@ const {
 } = require('internal/errors');
 const { validateObject } = require('internal/validators');
 
-const kPaused = Symbol('kPaused');
+const kState = Symbol('kState');
 
 const { StringDecoder } = require('string_decoder');
 const from = require('internal/streams/from');
@@ -83,6 +83,173 @@ const nop = () => {};
 
 const { errorOrDestroy } = destroyImpl;
 
+const kErroredValue = Symbol('kErroredValue');
+const kDefaultEncodingValue = Symbol('kDefaultEncodingValue');
+const kDecoderValue = Symbol('kDecoderValue');
+const kEncodingValue = Symbol('kEncodingValue');
+
+const kObjectMode = 1 << 0;
+const kEnded = 1 << 1;
+const kEndEmitted = 1 << 2;
+const kReading = 1 << 3;
+const kConstructed = 1 << 4;
+const kSync = 1 << 5;
+const kNeedReadable = 1 << 6;
+const kEmittedReadable = 1 << 7;
+const kReadableListening = 1 << 8;
+const kResumeScheduled = 1 << 9;
+const kErrorEmitted = 1 << 10;
+const kEmitClose = 1 << 11;
+const kAutoDestroy = 1 << 12;
+const kDestroyed = 1 << 13;
+const kClosed = 1 << 14;
+const kCloseEmitted = 1 << 15;
+const kMultiAwaitDrain = 1 << 16;
+const kReadingMore = 1 << 17;
+const kDataEmitted = 1 << 18;
+const kErrored = 1 << 19;
+const kDefaultUTF8Encoding = 1 << 20;
+const kDecoder = 1 << 21;
+const kEncoding = 1 << 22;
+const kHasFlowing = 1 << 23;
+const kFlowing = 1 << 24;
+const kHasPaused = 1 << 25;
+const kPaused = 1 << 26;
+
+// TODO(benjamingr) it is likely slower to do it this way than with free functions
+function makeBitMapDescriptor(bit) {
+  return {
+    enumerable: false,
+    get() { return (this[kState] & bit) !== 0; },
+    set(value) {
+      if (value) this[kState] |= bit;
+      else this[kState] &= ~bit;
+    },
+  };
+}
+ObjectDefineProperties(ReadableState.prototype, {
+  objectMode: makeBitMapDescriptor(kObjectMode),
+  ended: makeBitMapDescriptor(kEnded),
+  endEmitted: makeBitMapDescriptor(kEndEmitted),
+  reading: makeBitMapDescriptor(kReading),
+  // Stream is still being constructed and cannot be
+  // destroyed until construction finished or failed.
+  // Async construction is opt in, therefore we start as
+  // constructed.
+  constructed: makeBitMapDescriptor(kConstructed),
+  // A flag to be able to tell if the event 'readable'/'data' is emitted
+  // immediately, or on a later tick.  We set this to true at first, because
+  // any actions that shouldn't happen until "later" should generally also
+  // not happen before the first read call.
+  sync: makeBitMapDescriptor(kSync),
+  // Whenever we return null, then we set a flag to say
+  // that we're awaiting a 'readable' event emission.
+  needReadable: makeBitMapDescriptor(kNeedReadable),
+  emittedReadable: makeBitMapDescriptor(kEmittedReadable),
+  readableListening: makeBitMapDescriptor(kReadableListening),
+  resumeScheduled: makeBitMapDescriptor(kResumeScheduled),
+  // True if the error was already emitted and should not be thrown again.
+  errorEmitted: makeBitMapDescriptor(kErrorEmitted),
+  emitClose: makeBitMapDescriptor(kEmitClose),
+  autoDestroy: makeBitMapDescriptor(kAutoDestroy),
+  // Has it been destroyed.
+  destroyed: makeBitMapDescriptor(kDestroyed),
+  // Indicates whether the stream has finished destroying.
+  closed: makeBitMapDescriptor(kClosed),
+  // True if close has been emitted or would have been emitted
+  // depending on emitClose.
+  closeEmitted: makeBitMapDescriptor(kCloseEmitted),
+  multiAwaitDrain: makeBitMapDescriptor(kMultiAwaitDrain),
+  // If true, a maybeReadMore has been scheduled.
+  readingMore: makeBitMapDescriptor(kReadingMore),
+  dataEmitted: makeBitMapDescriptor(kDataEmitted),
+
+  // Indicates whether the stream has errored. When true no further
+  // _read calls, 'data' or 'readable' events should occur. This is needed
+  // since when autoDestroy is disabled we need a way to tell whether the
+  // stream has failed.
+  errored: {
+    __proto__: null,
+    enumerable: false,
+    get() {
+      return (this[kState] & kErrored) !== 0 ? this[kErroredValue] : null;
+    },
+    set(value) {
+      if (value) {
+        this[kErroredValue] = value;
+        this[kState] |= kErrored;
+      } else {
+        this[kState] &= ~kErrored;
+      }
+    },
+  },
+
+  defaultEncoding: {
+    __proto__: null,
+    enumerable: false,
+    get() { return (this[kState] & kDefaultUTF8Encoding) !== 0 ? 'utf8' : this[kDefaultEncodingValue]; },
+    set(value) {
+      if (value === 'utf8' || value === 'utf-8') {
+        this[kState] |= kDefaultUTF8Encoding;
+      } else {
+        this[kState] &= ~kDefaultUTF8Encoding;
+        this[kDefaultEncodingValue] = value;
+      }
+    },
+  },
+
+  decoder: {
+    __proto__: null,
+    enumerable: false,
+    get() {
+      return (this[kState] & kDecoder) !== 0 ? this[kDecoderValue] : null;
+    },
+    set(value) {
+      if (value) {
+        this[kDecoderValue] = value;
+        this[kState] |= kDecoder;
+      } else {
+        this[kState] &= ~kDecoder;
+      }
+    },
+  },
+
+  encoding: {
+    __proto__: null,
+    enumerable: false,
+    get() {
+      return (this[kState] & kEncoding) !== 0 ? this[kEncodingValue] : null;
+    },
+    set(value) {
+      if (value) {
+        this[kEncodingValue] = value;
+        this[kState] |= kEncoding;
+      } else {
+        this[kState] &= ~kEncoding;
+      }
+    },
+  },
+
+  flowing: {
+    __proto__: null,
+    enumerable: false,
+    get() {
+      return (this[kState] & kHasFlowing) !== 0 ? (this[kState] & kFlowing) !== 0 : null;
+    },
+    set(value) {
+      if (value == null) {
+        this[kState] &= ~(kHasFlowing | kFlowing);
+      } else if (value) {
+        this[kState] |= (kHasFlowing | kFlowing);
+      } else {
+        this[kState] |= kHasFlowing;
+        this[kState] &= ~kFlowing;
+      }
+    },
+  },
+});
+
+
 function ReadableState(options, stream, isDuplex) {
   // Duplex streams are both readable and writable, but share
   // the same options object.
@@ -92,13 +259,15 @@ function ReadableState(options, stream, isDuplex) {
   if (typeof isDuplex !== 'boolean')
     isDuplex = stream instanceof Stream.Duplex;
 
+  // Bit map field to store ReadableState more effciently with 1 bit per field
+  // instead of a V8 slot per field.
+  this[kState] = kEmitClose | kAutoDestroy | kConstructed | kSync;
   // Object stream flag. Used to make read(n) ignore n and to
   // make all the buffer merging and length checks go away.
-  this.objectMode = !!(options && options.objectMode);
+  if (options && options.objectMode) this[kState] |= kObjectMode;
 
-  if (isDuplex)
-    this.objectMode = this.objectMode ||
-      !!(options && options.readableObjectMode);
+  if (isDuplex && options && options.readableObjectMode)
+    this[kState] |= kObjectMode;
 
   // The point at which it stops calling _read() to fill the buffer
   // Note: 0 is a valid value, means "don't call _read preemptively ever"
@@ -112,62 +281,19 @@ function ReadableState(options, stream, isDuplex) {
   this.buffer = new BufferList();
   this.length = 0;
   this.pipes = [];
-  this.flowing = null;
-  this.ended = false;
-  this.endEmitted = false;
-  this.reading = false;
-
-  // Stream is still being constructed and cannot be
-  // destroyed until construction finished or failed.
-  // Async construction is opt in, therefore we start as
-  // constructed.
-  this.constructed = true;
-
-  // A flag to be able to tell if the event 'readable'/'data' is emitted
-  // immediately, or on a later tick.  We set this to true at first, because
-  // any actions that shouldn't happen until "later" should generally also
-  // not happen before the first read call.
-  this.sync = true;
-
-  // Whenever we return null, then we set a flag to say
-  // that we're awaiting a 'readable' event emission.
-  this.needReadable = false;
-  this.emittedReadable = false;
-  this.readableListening = false;
-  this.resumeScheduled = false;
-  this[kPaused] = null;
-
-  // True if the error was already emitted and should not be thrown again.
-  this.errorEmitted = false;
 
   // Should close be emitted on destroy. Defaults to true.
-  this.emitClose = !options || options.emitClose !== false;
+  if (options && options.emitClose === false) this[kState] &= ~kEmitClose;
 
   // Should .destroy() be called after 'end' (and potentially 'finish').
-  this.autoDestroy = !options || options.autoDestroy !== false;
-
-  // Has it been destroyed.
-  this.destroyed = false;
-
-  // Indicates whether the stream has errored. When true no further
-  // _read calls, 'data' or 'readable' events should occur. This is needed
-  // since when autoDestroy is disabled we need a way to tell whether the
-  // stream has failed.
-  this.errored = null;
-
-  // Indicates whether the stream has finished destroying.
-  this.closed = false;
-
-  // True if close has been emitted or would have been emitted
-  // depending on emitClose.
-  this.closeEmitted = false;
+  if (options && options.autoDestroy === false) this[kState] &= ~kAutoDestroy;
 
   // Crypto is kind of old and crusty.  Historically, its default string
   // encoding is 'binary' so we have to make this configurable.
   // Everything else in the universe uses 'utf8', though.
   const defaultEncoding = options?.defaultEncoding;
-  if (defaultEncoding == null) {
-    this.defaultEncoding = 'utf8';
+  if (defaultEncoding == null || defaultEncoding === 'utf8' || defaultEncoding === 'utf-8') {
+    this[kState] |= kDefaultUTF8Encoding;
   } else if (Buffer.isEncoding(defaultEncoding)) {
     this.defaultEncoding = defaultEncoding;
   } else {
@@ -177,15 +303,7 @@ function ReadableState(options, stream, isDuplex) {
   // Ref the piped dest which we need a drain event on it
   // type: null | Writable | Set<Writable>.
   this.awaitDrainWriters = null;
-  this.multiAwaitDrain = false;
-
-  // If true, a maybeReadMore has been scheduled.
-  this.readingMore = false;
 
-  this.dataEmitted = false;
-
-  this.decoder = null;
-  this.encoding = null;
   if (options && options.encoding) {
     this.decoder = new StringDecoder(options.encoding);
     this.encoding = options.encoding;
@@ -250,106 +368,190 @@ Readable.prototype[SymbolAsyncDispose] = function() {
 // similar to how Writable.write() returns true if you should
 // write() some more.
 Readable.prototype.push = function(chunk, encoding) {
-  return readableAddChunk(this, chunk, encoding, false);
+  debug('push', chunk);
+
+  const state = this._readableState;
+  return (state[kState] & kObjectMode) === 0 ?
+    readableAddChunkPushByteMode(this, state, chunk, encoding) :
+    readableAddChunkPushObjectMode(this, state, chunk, encoding);
 };
 
 // Unshift should *always* be something directly out of read().
 Readable.prototype.unshift = function(chunk, encoding) {
-  return readableAddChunk(this, chunk, encoding, true);
+  debug('unshift', chunk);
+  const state = this._readableState;
+  return (state[kState] & kObjectMode) === 0 ?
+    readableAddChunkUnshiftByteMode(this, state, chunk, encoding) :
+    readableAddChunkUnshiftObjectMode(this, state, chunk);
 };
 
-function readableAddChunk(stream, chunk, encoding, addToFront) {
-  debug('readableAddChunk', chunk);
-  const state = stream._readableState;
 
-  let err;
-  if (!state.objectMode) {
-    if (typeof chunk === 'string') {
-      encoding = encoding || state.defaultEncoding;
-      if (state.encoding !== encoding) {
-        if (addToFront && state.encoding) {
-          // When unshifting, if state.encoding is set, we have to save
-          // the string in the BufferList with the state encoding.
-          chunk = Buffer.from(chunk, encoding).toString(state.encoding);
-        } else {
-          chunk = Buffer.from(chunk, encoding);
-          encoding = '';
-        }
+function readableAddChunkUnshiftByteMode(stream, state, chunk, encoding) {
+  if (chunk === null) {
+    state[kState] &= ~kReading;
+    onEofChunk(stream, state);
+
+    return false;
+  }
+
+  if (typeof chunk === 'string') {
+    encoding = encoding || state.defaultEncoding;
+    if (state.encoding !== encoding) {
+      if (state.encoding) {
+        // When unshifting, if state.encoding is set, we have to save
+        // the string in the BufferList with the state encoding.
+        chunk = Buffer.from(chunk, encoding).toString(state.encoding);
+      } else {
+        chunk = Buffer.from(chunk, encoding);
       }
-    } else if (chunk instanceof Buffer) {
-      encoding = '';
-    } else if (Stream._isUint8Array(chunk)) {
-      chunk = Stream._uint8ArrayToBuffer(chunk);
-      encoding = '';
-    } else if (chunk != null) {
-      err = new ERR_INVALID_ARG_TYPE(
-        'chunk', ['string', 'Buffer', 'Uint8Array'], chunk);
     }
+  } else if (Stream._isUint8Array(chunk)) {
+    chunk = Stream._uint8ArrayToBuffer(chunk);
+  } else if (chunk !== undefined && !(chunk instanceof Buffer)) {
+    errorOrDestroy(stream, new ERR_INVALID_ARG_TYPE(
+      'chunk', ['string', 'Buffer', 'Uint8Array'], chunk));
+    return false;
   }
 
-  if (err) {
-    errorOrDestroy(stream, err);
-  } else if (chunk === null) {
-    state.reading = false;
+
+  if (!(chunk && chunk.length > 0)) {
+    return canPushMore(state);
+  }
+
+  return readableAddChunkUnshiftValue(stream, state, chunk);
+}
+
+function readableAddChunkUnshiftObjectMode(stream, state, chunk) {
+  if (chunk === null) {
+    state[kState] &= ~kReading;
     onEofChunk(stream, state);
-  } else if (state.objectMode || (chunk && chunk.length > 0)) {
-    if (addToFront) {
-      if (state.endEmitted)
-        errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());
-      else if (state.destroyed || state.errored)
-        return false;
-      else
-        addChunk(stream, state, chunk, true);
-    } else if (state.ended) {
-      errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());
-    } else if (state.destroyed || state.errored) {
-      return false;
-    } else {
-      state.reading = false;
-      if (state.decoder && !encoding) {
-        chunk = state.decoder.write(chunk);
-        if (state.objectMode || chunk.length !== 0)
-          addChunk(stream, state, chunk, false);
-        else
-          maybeReadMore(stream, state);
-      } else {
-        addChunk(stream, state, chunk, false);
-      }
+
+    return false;
+  }
+
+  return readableAddChunkUnshiftValue(stream, state, chunk);
+}
+
+function readableAddChunkUnshiftValue(stream, state, chunk) {
+  if ((state[kState] & kEndEmitted) !== 0)
+    errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());
+  else if (state.destroyed || state.errored)
+    return false;
+  else
+    addChunk(stream, state, chunk, true);
+
+  return canPushMore(state);
+}
+
+function readableAddChunkPushByteMode(stream, state, chunk, encoding) {
+  if (chunk === null) {
+    state[kState] &= ~kReading;
+    onEofChunk(stream, state);
+    return false;
+  }
+
+  if (typeof chunk === 'string') {
+    encoding = encoding || state.defaultEncoding;
+    if (state.encoding !== encoding) {
+      chunk = Buffer.from(chunk, encoding);
+      encoding = '';
     }
-  } else if (!addToFront) {
-    state.reading = false;
+  } else if (chunk instanceof Buffer) {
+    encoding = '';
+  } else if (Stream._isUint8Array(chunk)) {
+    chunk = Stream._uint8ArrayToBuffer(chunk);
+    encoding = '';
+  } else if (chunk !== undefined) {
+    errorOrDestroy(stream, new ERR_INVALID_ARG_TYPE(
+      'chunk', ['string', 'Buffer', 'Uint8Array'], chunk));
+    return false;
+  }
+
+  if (!chunk || chunk.length <= 0) {
+    state[kState] &= ~kReading;
     maybeReadMore(stream, state);
+
+    return canPushMore(state);
+  }
+
+  if ((state[kState] & kEnded) !== 0) {
+    errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());
+    return false;
+  }
+
+  if ((state[kState] & (kDestroyed | kErrored)) !== 0) {
+    return false;
+  }
+
+  state[kState] &= ~kReading;
+  if ((state[kState] & kDecoder) !== 0 && !encoding) {
+    chunk = state[kDecoderValue].write(chunk);
+    if (chunk.length === 0) {
+      maybeReadMore(stream, state);
+      return canPushMore(state);
+    }
+  }
+
+  addChunk(stream, state, chunk, false);
+  return canPushMore(state);
+}
+
+function readableAddChunkPushObjectMode(stream, state, chunk, encoding) {
+  if (chunk === null) {
+    state[kState] &= ~kReading;
+    onEofChunk(stream, state);
+    return false;
   }
 
+  if ((state[kState] & kEnded) !== 0) {
+    errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());
+    return false;
+  }
+
+  if ((state[kState] & (kDestroyed | kErrored)) !== 0) {
+    return false;
+  }
+
+  state[kState] &= ~kReading;
+
+  if ((state[kState] & kDecoder) !== 0 && !encoding) {
+    chunk = state[kDecoderValue].write(chunk);
+  }
+
+  addChunk(stream, state, chunk, false);
+  return canPushMore(state);
+}
+
+function canPushMore(state) {
   // We can push more data if we are below the highWaterMark.
   // Also, if we have no data yet, we can stand some more bytes.
   // This is to work around cases where hwm=0, such as the repl.
-  return !state.ended &&
+  return (state[kState] & kEnded) === 0 &&
     (state.length < state.highWaterMark || state.length === 0);
 }
 
 function addChunk(stream, state, chunk, addToFront) {
-  if (state.flowing && state.length === 0 && !state.sync &&
+  if ((state[kState] & (kFlowing | kSync)) === kFlowing && state.length === 0 &&
       stream.listenerCount('data') > 0) {
     // Use the guard to avoid creating `Set()` repeatedly
     // when we have multiple pipes.
-    if (state.multiAwaitDrain) {
+    if ((state[kState] & kMultiAwaitDrain) !== 0) {
       state.awaitDrainWriters.clear();
     } else {
       state.awaitDrainWriters = null;
     }
 
-    state.dataEmitted = true;
+    state[kState] |= kDataEmitted;
     stream.emit('data', chunk);
   } else {
     // Update the buffer info.
-    state.length += state.objectMode ? 1 : chunk.length;
+    state.length += (state[kState] & kObjectMode) !== 0 ? 1 : chunk.length;
     if (addToFront)
       state.buffer.unshift(chunk);
     else
       state.buffer.push(chunk);
 
-    if (state.needReadable)
+    if ((state[kState] & kNeedReadable) !== 0)
       emitReadable(stream);
   }
   maybeReadMore(stream, state);
@@ -357,7 +559,7 @@ function addChunk(stream, state, chunk, addToFront) {
 
 Readable.prototype.isPaused = function() {
   const state = this._readableState;
-  return state[kPaused] === true || state.flowing === false;
+  return (state[kState] & kPaused) !== 0 || (state[kState] & (kHasFlowing | kFlowing)) === kHasFlowing;
 };
 
 // Backwards compatibility.
@@ -404,17 +606,17 @@ function computeNewHighWaterMark(n) {
 function howMuchToRead(n, state) {
   if (n <= 0 || (state.length === 0 && state.ended))
     return 0;
-  if (state.objectMode)
+  if ((state[kState] & kObjectMode) !== 0)
     return 1;
   if (NumberIsNaN(n)) {
     // Only flow one buffer at a time.
-    if (state.flowing && state.length)
+    if ((state[kState] & kFlowing) !== 0 && state.length)
       return state.buffer.first().length;
     return state.length;
   }
   if (n <= state.length)
     return n;
-  return state.ended ? state.length : 0;
+  return (state[kState] & kEnded) !== 0 ? state.length : 0;
 }
 
 // You can override either this method, or the async _read(n) below.
@@ -435,19 +637,19 @@ Readable.prototype.read = function(n) {
     state.highWaterMark = computeNewHighWaterMark(n);
 
   if (n !== 0)
-    state.emittedReadable = false;
+    state[kState] &= ~kEmittedReadable;
 
   // If we're doing read(0) to trigger a readable event, but we
   // already have a bunch of data in the buffer, then just trigger
   // the 'readable' event and move on.
   if (n === 0 &&
-      state.needReadable &&
+      (state[kState] & kNeedReadable) !== 0 &&
       ((state.highWaterMark !== 0 ?
         state.length >= state.highWaterMark :
         state.length > 0) ||
-       state.ended)) {
-    debug('read: emitReadable', state.length, state.ended);
-    if (state.length === 0 && state.ended)
+       (state[kState] & kEnded) !== 0)) {
+    debug('read: emitReadable', state.length, (state[kState] & kEnded) !== 0);
+    if (state.length === 0 && (state[kState] & kEnded) !== 0)
       endReadable(this);
     else
       emitReadable(this);
@@ -457,7 +659,7 @@ Readable.prototype.read = function(n) {
   n = howMuchToRead(n, state);
 
   // If we've ended, and we're now clear, then finish it up.
-  if (n === 0 && state.ended) {
+  if (n === 0 && (state[kState] & kEnded) !== 0) {
     if (state.length === 0)
       endReadable(this);
     return null;
@@ -486,7 +688,7 @@ Readable.prototype.read = function(n) {
   // 3. Actually pull the requested chunks out of the buffer and return.
 
   // if we need a readable event, then we need to do some reading.
-  let doRead = state.needReadable;
+  let doRead = (state[kState] & kNeedReadable) !== 0;
   debug('need readable', doRead);
 
   // If we currently have less than the highWaterMark, then also read some.
@@ -498,17 +700,15 @@ Readable.prototype.read = function(n) {
   // However, if we've ended, then there's no point, if we're already
   // reading, then it's unnecessary, if we're constructing we have to wait,
   // and if we're destroyed or errored, then it's not allowed,
-  if (state.ended || state.reading || state.destroyed || state.errored ||
-      !state.constructed) {
+  if ((state[kState] & (kReading | kEnded | kDestroyed | kErrored | kConstructed)) !== kConstructed) {
     doRead = false;
     debug('reading, ended or constructing', doRead);
   } else if (doRead) {
     debug('do read');
-    state.reading = true;
-    state.sync = true;
+    state[kState] |= kReading | kSync;
     // If the length is currently zero, then we *need* a readable event.
     if (state.length === 0)
-      state.needReadable = true;
+      state[kState] |= kNeedReadable;
 
     // Call internal read method
     try {
@@ -516,11 +716,11 @@ Readable.prototype.read = function(n) {
     } catch (err) {
       errorOrDestroy(this, err);
     }
+    state[kState] &= ~kSync;
 
-    state.sync = false;
     // If _read pushed data synchronously, then `reading` will be false,
     // and we need to re-evaluate how much data we can return to the user.
-    if (!state.reading)
+    if ((state[kState] & kReading) === 0)
       n = howMuchToRead(nOrig, state);
   }
 
@@ -531,11 +731,11 @@ Readable.prototype.read = function(n) {
     ret = null;
 
   if (ret === null) {
-    state.needReadable = state.length <= state.highWaterMark;
+    state[kState] |= state.length <= state.highWaterMark ? kNeedReadable : 0;
     n = 0;
   } else {
     state.length -= n;
-    if (state.multiAwaitDrain) {
+    if ((state[kState] & kMultiAwaitDrain) !== 0) {
       state.awaitDrainWriters.clear();
     } else {
       state.awaitDrainWriters = null;
@@ -545,16 +745,16 @@ Readable.prototype.read = function(n) {
   if (state.length === 0) {
     // If we have nothing in the buffer, then we want to know
     // as soon as we *do* get something into the buffer.
-    if (!state.ended)
-      state.needReadable = true;
+    if ((state[kState] & kEnded) === 0)
+      state[kState] |= kNeedReadable;
 
     // If we tried to read() past the EOF, then emit end on the next tick.
-    if (nOrig !== n && state.ended)
+    if (nOrig !== n && (state[kState] & kEnded) !== 0)
       endReadable(this);
   }
 
-  if (ret !== null && !state.errorEmitted && !state.closeEmitted) {
-    state.dataEmitted = true;
+  if (ret !== null && (state[kState] & (kErrorEmitted | kCloseEmitted)) === 0) {
+    state[kState] |= kDataEmitted;
     this.emit('data', ret);
   }
 
@@ -563,25 +763,26 @@ Readable.prototype.read = function(n) {
 
 function onEofChunk(stream, state) {
   debug('onEofChunk');
-  if (state.ended) return;
-  if (state.decoder) {
-    const chunk = state.decoder.end();
+  if ((state[kState] & kEnded) !== 0) return;
+  const decoder = (state[kState] & kDecoder) !== 0 ? state[kDecoderValue] : null;
+  if (decoder) {
+    const chunk = decoder.end();
     if (chunk && chunk.length) {
       state.buffer.push(chunk);
-      state.length += state.objectMode ? 1 : chunk.length;
+      state.length += (state[kState] & kObjectMode) !== 0 ? 1 : chunk.length;
     }
   }
-  state.ended = true;
+  state[kState] |= kEnded;
 
-  if (state.sync) {
+  if ((state[kState] & kSync) !== 0) {
     // If we are sync, wait until next tick to emit the data.
     // Otherwise we risk emitting data in the flow()
     // the readable code triggers during a read() call.
     emitReadable(stream);
   } else {
     // Emit 'readable' now to make sure it gets picked up.
-    state.needReadable = false;
-    state.emittedReadable = true;
+    state[kState] &= ~kNeedReadable;
+    state[kState] |= kEmittedReadable;
     // We have to emit readable now that we are EOF. Modules
     // in the ecosystem (e.g. dicer) rely on this event being sync.
     emitReadable_(stream);
@@ -593,21 +794,21 @@ function onEofChunk(stream, state) {
 // a nextTick recursion warning, but that's not so bad.
 function emitReadable(stream) {
   const state = stream._readableState;
-  debug('emitReadable', state.needReadable, state.emittedReadable);
-  state.needReadable = false;
-  if (!state.emittedReadable) {
-    debug('emitReadable', state.flowing);
-    state.emittedReadable = true;
+  debug('emitReadable');
+  state[kState] &= ~kNeedReadable;
+  if ((state[kState] & kEmittedReadable) === 0) {
+    debug('emitReadable', (state[kState] & kFlowing) !== 0);
+    state[kState] |= kEmittedReadable;
     process.nextTick(emitReadable_, stream);
   }
 }
 
 function emitReadable_(stream) {
   const state = stream._readableState;
-  debug('emitReadable_', state.destroyed, state.length, state.ended);
-  if (!state.destroyed && !state.errored && (state.length || state.ended)) {
+  debug('emitReadable_');
+  if ((state[kState] & (kDestroyed | kErrored)) === 0 && (state.length || state.ended)) {
     stream.emit('readable');
-    state.emittedReadable = false;
+    state[kState] &= ~kEmittedReadable;
   }
 
   // The stream needs another readable event if:
@@ -616,10 +817,9 @@ function emitReadable_(stream) {
   // 2. It is not ended.
   // 3. It is below the highWaterMark, so we can schedule
   //    another readable later.
-  state.needReadable =
-    !state.flowing &&
-    !state.ended &&
-    state.length <= state.highWaterMark;
+  state[kState] |=
+    (state[kState] & (kFlowing | kEnded)) === 0 &&
+    state.length <= state.highWaterMark ? kNeedReadable : 0;
   flow(stream);
 }
 
@@ -631,8 +831,8 @@ function emitReadable_(stream) {
 // However, if we're not ended, or reading, and the length < hwm,
 // then go ahead and try to read some more preemptively.
 function maybeReadMore(stream, state) {
-  if (!state.readingMore && state.constructed) {
-    state.readingMore = true;
+  if ((state[kState] & (kReadingMore | kConstructed)) === kConstructed) {
+    state[kState] |= kReadingMore;
     process.nextTick(maybeReadMore_, stream, state);
   }
 }
@@ -661,9 +861,9 @@ function maybeReadMore_(stream, state) {
   //   called push() with new data. In this case we skip performing more
   //   read()s. The execution ends in this method again after the _read() ends
   //   up calling push() with more data.
-  while (!state.reading && !state.ended &&
+  while ((state[kState] & (kReading | kEnded)) === 0 &&
          (state.length < state.highWaterMark ||
-          (state.flowing && state.length === 0))) {
+          ((state[kState] & kFlowing) !== 0 && state.length === 0))) {
     const len = state.length;
     debug('maybeReadMore read 0');
     stream.read(0);
@@ -671,7 +871,7 @@ function maybeReadMore_(stream, state) {
       // Didn't get any data, stop spinning.
       break;
   }
-  state.readingMore = false;
+  state[kState] &= ~kReadingMore;
 }
 
 // Abstract method.  to be overridden in specific implementation classes.
@@ -688,7 +888,7 @@ Readable.prototype.pipe = function(dest, pipeOpts) {
 
   if (state.pipes.length === 1) {
     if (!state.multiAwaitDrain) {
-      state.multiAwaitDrain = true;
+      state[kState] |= kMultiAwaitDrain;
       state.awaitDrainWriters = new SafeSet(
         state.awaitDrainWriters ? [state.awaitDrainWriters] : [],
       );
@@ -969,16 +1169,16 @@ function updateReadableListening(self) {
   const state = self._readableState;
   state.readableListening = self.listenerCount('readable') > 0;
 
-  if (state.resumeScheduled && state[kPaused] === false) {
+  if ((state[kState] & (kHasPaused | kPaused | kResumeScheduled)) === (kHasPaused | kResumeScheduled)) {
     // Flowing needs to be set to true now, otherwise
     // the upcoming resume will not flow.
-    state.flowing = true;
+    state[kState] |= kHasFlowing | kFlowing;
 
     // Crude way to check if we should resume.
   } else if (self.listenerCount('data') > 0) {
     self.resume();
-  } else if (!state.readableListening) {
-    state.flowing = null;
+  } else if ((state[kState] & kReadableListening) === 0) {
+    state[kState] &= ~(kHasFlowing | kFlowing);
   }
 }
 
@@ -991,15 +1191,21 @@ function nReadingNextTick(self) {
 // If the user uses them, then switch into old mode.
 Readable.prototype.resume = function() {
   const state = this._readableState;
-  if (!state.flowing) {
+  if ((state[kState] & kFlowing) === 0) {
     debug('resume');
     // We flow only if there is no one listening
     // for readable, but we still have to call
     // resume().
-    state.flowing = !state.readableListening;
+    state[kState] |= kHasFlowing;
+    if (!state.readableListening) {
+      state[kState] |= kFlowing;
+    } else {
+      state[kState] &= ~kFlowing;
+    }
     resume(this, state);
   }
-  state[kPaused] = false;
+  state[kState] |= kHasPaused;
+  state[kState] &= ~kPaused;
   return this;
 };
 
@@ -1011,33 +1217,35 @@ function resume(stream, state) {
 }
 
 function resume_(stream, state) {
-  debug('resume', state.reading);
-  if (!state.reading) {
+  debug('resume', (state[kState] & kReading) !== 0);
+  if ((state[kState] & kReading) === 0) {
     stream.read(0);
   }
 
-  state.resumeScheduled = false;
+  state[kState] &= ~kResumeScheduled;
   stream.emit('resume');
   flow(stream);
-  if (state.flowing && !state.reading)
+  if ((state[kState] & (kFlowing | kReading)) === kFlowing)
     stream.read(0);
 }
 
 Readable.prototype.pause = function() {
-  debug('call pause flowing=%j', this._readableState.flowing);
-  if (this._readableState.flowing !== false) {
+  const state = this._readableState;
+  debug('call pause');
+  if (state.flowing !== false) {
     debug('pause');
-    this._readableState.flowing = false;
+    state[kState] |= kHasFlowing;
+    state[kState] &= ~kFlowing;
     this.emit('pause');
   }
-  this._readableState[kPaused] = true;
+  state[kState] |= kHasPaused | kPaused;
   return this;
 };
 
 function flow(stream) {
   const state = stream._readableState;
-  debug('flow', state.flowing);
-  while (state.flowing && stream.read() !== null);
+  debug('flow');
+  while ((state[kState] & kFlowing) !== 0 && stream.read() !== null);
 }
 
 // Wrap an old-style stream as the async data source.
@@ -1316,10 +1524,15 @@ ObjectDefineProperties(ReadableState.prototype, {
   paused: {
     __proto__: null,
     get() {
-      return this[kPaused] !== false;
+      return (this[kState] & kPaused) !== 0;
     },
     set(value) {
-      this[kPaused] = !!value;
+      this[kState] |= kHasPaused;
+      if (value) {
+        this[kState] |= kPaused;
+      } else {
+        this[kState] &= ~kPaused;
+      }
     },
   },
 });
@@ -1359,9 +1572,9 @@ function fromList(n, state) {
 function endReadable(stream) {
   const state = stream._readableState;
 
-  debug('endReadable', state.endEmitted);
-  if (!state.endEmitted) {
-    state.ended = true;
+  debug('endReadable', (state[kState] & kEndEmitted) !== 0);
+  if ((state[kState] & kEndEmitted) === 0) {
+    state[kState] |= kEnded;
     process.nextTick(endReadableNT, state, stream);
   }
 }
diff --git a/lib/internal/streams/transform.js b/lib/internal/streams/transform.js
index 2527ce94c8f44d..02646f44344901 100644
--- a/lib/internal/streams/transform.js
+++ b/lib/internal/streams/transform.js
@@ -182,7 +182,12 @@ Transform.prototype._write = function(chunk, encoding, callback) {
       this.push(val);
     }
 
-    if (
+    if (rState.ended) {
+      // If user has called this.push(null) we have to
+      // delay the callback to properly progate the new
+      // state.
+      process.nextTick(callback);
+    } else if (
       wState.ended || // Backwards compat.
       length === rState.length || // Backwards compat.
       rState.length < rState.highWaterMark
diff --git a/lib/internal/streams/writable.js b/lib/internal/streams/writable.js
index 718d4e48478677..b8f8b72ce8d113 100644
--- a/lib/internal/streams/writable.js
+++ b/lib/internal/streams/writable.js
@@ -72,7 +72,222 @@ ObjectSetPrototypeOf(Writable, Stream);
 
 function nop() {}
 
-const kOnFinished = Symbol('kOnFinished');
+const kOnFinishedValue = Symbol('kOnFinishedValue');
+const kErroredValue = Symbol('kErroredValue');
+const kDefaultEncodingValue = Symbol('kDefaultEncodingValue');
+const kWriteCbValue = Symbol('kWriteCbValue');
+const kAfterWriteTickInfoValue = Symbol('kAfterWriteTickInfoValue');
+const kBufferedValue = Symbol('kBufferedValue');
+const kState = Symbol('kState');
+
+const kObjectMode = 1 << 0;
+const kEnded = 1 << 1;
+const kConstructed = 1 << 2;
+const kSync = 1 << 3;
+const kErrorEmitted = 1 << 4;
+const kEmitClose = 1 << 5;
+const kAutoDestroy = 1 << 6;
+const kDestroyed = 1 << 7;
+const kClosed = 1 << 8;
+const kCloseEmitted = 1 << 9;
+const kFinalCalled = 1 << 10;
+const kNeedDrain = 1 << 11;
+const kEnding = 1 << 12;
+const kFinished = 1 << 13;
+const kDecodeStrings = 1 << 14;
+const kWriting = 1 << 15;
+const kBufferProcessing = 1 << 16;
+const kPrefinished = 1 << 17;
+const kAllBuffers = 1 << 18;
+const kAllNoop = 1 << 19;
+const kOnFinished = 1 << 20;
+const kErrored = 1 << 21;
+const kHasWritable = 1 << 22;
+const kWritable = 1 << 23;
+const kCorked = 1 << 24;
+const kDefaultUTF8Encoding = 1 << 25;
+const kWriteCb = 1 << 26;
+const kExpectWriteCb = 1 << 27;
+const kAfterWriteTickInfo = 1 << 28;
+const kAfterWritePending = 1 << 29;
+const kBuffered = 1 << 30;
+
+// TODO(benjamingr) it is likely slower to do it this way than with free functions
+function makeBitMapDescriptor(bit) {
+  return {
+    enumerable: false,
+    get() { return (this[kState] & bit) !== 0; },
+    set(value) {
+      if (value) this[kState] |= bit;
+      else this[kState] &= ~bit;
+    },
+  };
+}
+ObjectDefineProperties(WritableState.prototype, {
+  // Object stream flag to indicate whether or not this stream
+  // contains buffers or objects.
+  objectMode: makeBitMapDescriptor(kObjectMode),
+
+  // if _final has been called.
+  finalCalled: makeBitMapDescriptor(kFinalCalled),
+
+  // drain event flag.
+  needDrain: makeBitMapDescriptor(kNeedDrain),
+
+  // At the start of calling end()
+  ending: makeBitMapDescriptor(kEnding),
+
+  // When end() has been called, and returned.
+  ended: makeBitMapDescriptor(kEnded),
+
+  // When 'finish' is emitted.
+  finished: makeBitMapDescriptor(kFinished),
+
+  // Has it been destroyed.
+  destroyed: makeBitMapDescriptor(kDestroyed),
+
+  // Should we decode strings into buffers before passing to _write?
+  // this is here so that some node-core streams can optimize string
+  // handling at a lower level.
+  decodeStrings: makeBitMapDescriptor(kDecodeStrings),
+
+  // A flag to see when we're in the middle of a write.
+  writing: makeBitMapDescriptor(kWriting),
+
+  // A flag to be able to tell if the onwrite cb is called immediately,
+  // or on a later tick.  We set this to true at first, because any
+  // actions that shouldn't happen until "later" should generally also
+  // not happen before the first write call.
+  sync: makeBitMapDescriptor(kSync),
+
+  // A flag to know if we're processing previously buffered items, which
+  // may call the _write() callback in the same tick, so that we don't
+  // end up in an overlapped onwrite situation.
+  bufferProcessing: makeBitMapDescriptor(kBufferProcessing),
+
+  // Stream is still being constructed and cannot be
+  // destroyed until construction finished or failed.
+  // Async construction is opt in, therefore we start as
+  // constructed.
+  constructed: makeBitMapDescriptor(kConstructed),
+
+  // Emit prefinish if the only thing we're waiting for is _write cbs
+  // This is relevant for synchronous Transform streams.
+  prefinished: makeBitMapDescriptor(kPrefinished),
+
+  // True if the error was already emitted and should not be thrown again.
+  errorEmitted: makeBitMapDescriptor(kErrorEmitted),
+
+  // Should close be emitted on destroy. Defaults to true.
+  emitClose: makeBitMapDescriptor(kEmitClose),
+
+  // Should .destroy() be called after 'finish' (and potentially 'end').
+  autoDestroy: makeBitMapDescriptor(kAutoDestroy),
+
+  // Indicates whether the stream has finished destroying.
+  closed: makeBitMapDescriptor(kClosed),
+
+  // True if close has been emitted or would have been emitted
+  // depending on emitClose.
+  closeEmitted: makeBitMapDescriptor(kCloseEmitted),
+
+  allBuffers: makeBitMapDescriptor(kAllBuffers),
+  allNoop: makeBitMapDescriptor(kAllNoop),
+
+  // Indicates whether the stream has errored. When true all write() calls
+  // should return false. This is needed since when autoDestroy
+  // is disabled we need a way to tell whether the stream has failed.
+  // This is/should be a cold path.
+  errored: {
+    __proto__: null,
+    enumerable: false,
+    get() { return (this[kState] & kErrored) !== 0 ? this[kErroredValue] : null; },
+    set(value) {
+      if (value) {
+        this[kErroredValue] = value;
+        this[kState] |= kErrored;
+      } else {
+        this[kState] &= ~kErrored;
+      }
+    },
+  },
+
+  writable: {
+    __proto__: null,
+    enumerable: false,
+    get() { return (this[kState] & kHasWritable) !== 0 ? (this[kState] & kWritable) !== 0 : undefined; },
+    set(value) {
+      if (value == null) {
+        this[kState] &= ~(kHasWritable | kWritable);
+      } else if (value) {
+        this[kState] |= (kHasWritable | kWritable);
+      } else {
+        this[kState] |= kHasWritable;
+        this[kState] &= ~kWritable;
+      }
+    },
+  },
+
+  defaultEncoding: {
+    __proto__: null,
+    enumerable: false,
+    get() { return (this[kState] & kDefaultUTF8Encoding) !== 0 ? 'utf8' : this[kDefaultEncodingValue]; },
+    set(value) {
+      if (value === 'utf8' || value === 'utf-8') {
+        this[kState] |= kDefaultUTF8Encoding;
+      } else {
+        this[kState] &= ~kDefaultUTF8Encoding;
+        this[kDefaultEncodingValue] = value;
+      }
+    },
+  },
+
+  // The callback that the user supplies to write(chunk, encoding, cb).
+  writecb: {
+    __proto__: null,
+    enumerable: false,
+    get() { return (this[kState] & kWriteCb) !== 0 ? this[kWriteCbValue] : nop; },
+    set(value) {
+      if (value) {
+        this[kWriteCbValue] = value;
+        this[kState] |= kWriteCb;
+      } else {
+        this[kState] &= ~kWriteCb;
+      }
+    },
+  },
+
+  // Storage for data passed to the afterWrite() callback in case of
+  // synchronous _write() completion.
+  afterWriteTickInfo: {
+    __proto__: null,
+    enumerable: false,
+    get() { return (this[kState] & kAfterWriteTickInfo) !== 0 ? this[kAfterWriteTickInfoValue] : null; },
+    set(value) {
+      if (value) {
+        this[kAfterWriteTickInfoValue] = value;
+        this[kState] |= kAfterWriteTickInfo;
+      } else {
+        this[kState] &= ~kAfterWriteTickInfo;
+      }
+    },
+  },
+
+  buffered: {
+    __proto__: null,
+    enumerable: false,
+    get() { return (this[kState] & kBuffered) !== 0 ? this[kBufferedValue] : []; },
+    set(value) {
+      this[kBufferedValue] = value;
+      if (value) {
+        this[kState] |= kBuffered;
+      } else {
+        this[kState] &= ~kBuffered;
+      }
+    },
+  },
+
+});
 
 function WritableState(options, stream, isDuplex) {
   // Duplex streams are both readable and writable, but share
@@ -83,13 +298,12 @@ function WritableState(options, stream, isDuplex) {
   if (typeof isDuplex !== 'boolean')
     isDuplex = stream instanceof Stream.Duplex;
 
-  // Object stream flag to indicate whether or not this stream
-  // contains buffers or objects.
-  this.objectMode = !!(options && options.objectMode);
+  // Bit map field to store WritableState more effciently with 1 bit per field
+  // instead of a V8 slot per field.
+  this[kState] = kSync | kConstructed | kEmitClose | kAutoDestroy;
 
-  if (isDuplex)
-    this.objectMode = this.objectMode ||
-      !!(options && options.writableObjectMode);
+  if (options && options.objectMode) this[kState] |= kObjectMode;
+  if (isDuplex && options && options.writableObjectMode) this[kState] |= kObjectMode;
 
   // The point at which write() starts returning false
   // Note: 0 is a valid value, means that we always return false if
@@ -98,35 +312,23 @@ function WritableState(options, stream, isDuplex) {
     getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex) :
     getDefaultHighWaterMark(false);
 
-  // if _final has been called.
-  this.finalCalled = false;
+  if (!options || options.decodeStrings !== false) this[kState] |= kDecodeStrings;
 
-  // drain event flag.
-  this.needDrain = false;
-  // At the start of calling end()
-  this.ending = false;
-  // When end() has been called, and returned.
-  this.ended = false;
-  // When 'finish' is emitted.
-  this.finished = false;
-
-  // Has it been destroyed
-  this.destroyed = false;
+  // Should close be emitted on destroy. Defaults to true.
+  if (options && options.emitClose === false) this[kState] &= ~kEmitClose;
 
-  // Should we decode strings into buffers before passing to _write?
-  // this is here so that some node-core streams can optimize string
-  // handling at a lower level.
-  const noDecode = !!(options && options.decodeStrings === false);
-  this.decodeStrings = !noDecode;
+  // Should .destroy() be called after 'end' (and potentially 'finish').
+  if (options && options.autoDestroy === false) this[kState] &= ~kAutoDestroy;
 
   // Crypto is kind of old and crusty.  Historically, its default string
   // encoding is 'binary' so we have to make this configurable.
   // Everything else in the universe uses 'utf8', though.
   const defaultEncoding = options?.defaultEncoding;
-  if (defaultEncoding == null) {
-    this.defaultEncoding = 'utf8';
+  if (defaultEncoding == null || defaultEncoding === 'utf8' || defaultEncoding === 'utf-8') {
+    this[kState] |= kDefaultUTF8Encoding;
   } else if (Buffer.isEncoding(defaultEncoding)) {
-    this.defaultEncoding = defaultEncoding;
+    this[kState] &= ~kDefaultUTF8Encoding;
+    this[kDefaultEncodingValue] = defaultEncoding;
   } else {
     throw new ERR_UNKNOWN_ENCODING(defaultEncoding);
   }
@@ -136,91 +338,37 @@ function WritableState(options, stream, isDuplex) {
   // socket or file.
   this.length = 0;
 
-  // A flag to see when we're in the middle of a write.
-  this.writing = false;
-
   // When true all writes will be buffered until .uncork() call.
   this.corked = 0;
 
-  // A flag to be able to tell if the onwrite cb is called immediately,
-  // or on a later tick.  We set this to true at first, because any
-  // actions that shouldn't happen until "later" should generally also
-  // not happen before the first write call.
-  this.sync = true;
-
-  // A flag to know if we're processing previously buffered items, which
-  // may call the _write() callback in the same tick, so that we don't
-  // end up in an overlapped onwrite situation.
-  this.bufferProcessing = false;
-
   // The callback that's passed to _write(chunk, cb).
   this.onwrite = onwrite.bind(undefined, stream);
 
-  // The callback that the user supplies to write(chunk, encoding, cb).
-  this.writecb = null;
-
   // The amount that is being written when _write is called.
   this.writelen = 0;
 
-  // Storage for data passed to the afterWrite() callback in case of
-  // synchronous _write() completion.
-  this.afterWriteTickInfo = null;
-
   resetBuffer(this);
 
   // Number of pending user-supplied write callbacks
   // this must be 0 before 'finish' can be emitted.
   this.pendingcb = 0;
-
-  // Stream is still being constructed and cannot be
-  // destroyed until construction finished or failed.
-  // Async construction is opt in, therefore we start as
-  // constructed.
-  this.constructed = true;
-
-  // Emit prefinish if the only thing we're waiting for is _write cbs
-  // This is relevant for synchronous Transform streams.
-  this.prefinished = false;
-
-  // True if the error was already emitted and should not be thrown again.
-  this.errorEmitted = false;
-
-  // Should close be emitted on destroy. Defaults to true.
-  this.emitClose = !options || options.emitClose !== false;
-
-  // Should .destroy() be called after 'finish' (and potentially 'end').
-  this.autoDestroy = !options || options.autoDestroy !== false;
-
-  // Indicates whether the stream has errored. When true all write() calls
-  // should return false. This is needed since when autoDestroy
-  // is disabled we need a way to tell whether the stream has failed.
-  this.errored = null;
-
-  // Indicates whether the stream has finished destroying.
-  this.closed = false;
-
-  // True if close has been emitted or would have been emitted
-  // depending on emitClose.
-  this.closeEmitted = false;
-
-  this[kOnFinished] = [];
 }
 
 function resetBuffer(state) {
-  state.buffered = [];
+  state[kBufferedValue] = null;
   state.bufferedIndex = 0;
-  state.allBuffers = true;
-  state.allNoop = true;
+  state[kState] |= kAllBuffers | kAllNoop;
+  state[kState] &= ~kBuffered;
 }
 
 WritableState.prototype.getBuffer = function getBuffer() {
-  return ArrayPrototypeSlice(this.buffered, this.bufferedIndex);
+  return (this[kState] & kBuffered) === 0 ? [] : ArrayPrototypeSlice(this.buffered, this.bufferedIndex);
 };
 
 ObjectDefineProperty(WritableState.prototype, 'bufferedRequestCount', {
   __proto__: null,
   get() {
-    return this.buffered.length - this.bufferedIndex;
+    return (this[kState] & kBuffered) === 0 ? 0 : this[kBufferedValue].length - this.bufferedIndex;
   },
 });
 
@@ -267,11 +415,13 @@ function Writable(options) {
   destroyImpl.construct(this, () => {
     const state = this._writableState;
 
-    if (!state.writing) {
+    if ((state[kState] & kWriting) === 0) {
       clearBuffer(this, state);
     }
 
-    finishMaybe(this, state);
+    if ((state[kState] & kEnding) !== 0) {
+      finishMaybe(this, state);
+    }
   });
 }
 
@@ -295,10 +445,10 @@ function _write(stream, chunk, encoding, cb) {
 
   if (typeof encoding === 'function') {
     cb = encoding;
-    encoding = state.defaultEncoding;
+    encoding = (state[kState] & kDefaultUTF8Encoding) !== 0 ? 'utf8' : state.defaultEncoding;
   } else {
     if (!encoding)
-      encoding = state.defaultEncoding;
+      encoding = (state[kState] & kDefaultUTF8Encoding) !== 0 ? 'utf8' : state.defaultEncoding;
     else if (encoding !== 'buffer' && !Buffer.isEncoding(encoding))
       throw new ERR_UNKNOWN_ENCODING(encoding);
     if (typeof cb !== 'function')
@@ -307,9 +457,9 @@ function _write(stream, chunk, encoding, cb) {
 
   if (chunk === null) {
     throw new ERR_STREAM_NULL_VALUES();
-  } else if (!state.objectMode) {
+  } else if ((state[kState] & kObjectMode) === 0) {
     if (typeof chunk === 'string') {
-      if (state.decodeStrings !== false) {
+      if ((state[kState] & kDecodeStrings) !== 0) {
         chunk = Buffer.from(chunk, encoding);
         encoding = 'buffer';
       }
@@ -325,9 +475,9 @@ function _write(stream, chunk, encoding, cb) {
   }
 
   let err;
-  if (state.ending) {
+  if ((state[kState] & kEnding) !== 0) {
     err = new ERR_STREAM_WRITE_AFTER_END();
-  } else if (state.destroyed) {
+  } else if ((state[kState] & kDestroyed) !== 0) {
     err = new ERR_STREAM_DESTROYED('write');
   }
 
@@ -345,7 +495,10 @@ Writable.prototype.write = function(chunk, encoding, cb) {
 };
 
 Writable.prototype.cork = function() {
-  this._writableState.corked++;
+  const state = this._writableState;
+
+  state[kState] |= kCorked;
+  state.corked++;
 };
 
 Writable.prototype.uncork = function() {
@@ -354,7 +507,11 @@ Writable.prototype.uncork = function() {
   if (state.corked) {
     state.corked--;
 
-    if (!state.writing)
+    if (!state.corked) {
+      state[kState] &= ~kCorked;
+    }
+
+    if ((state[kState] & kWriting) === 0)
       clearBuffer(this, state);
   }
 };
@@ -373,50 +530,57 @@ Writable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) {
 // in the queue, and wait our turn.  Otherwise, call _write
 // If we return false, then we need a drain event, so set that flag.
 function writeOrBuffer(stream, state, chunk, encoding, callback) {
-  const len = state.objectMode ? 1 : chunk.length;
+  const len = (state[kState] & kObjectMode) !== 0 ? 1 : chunk.length;
 
   state.length += len;
 
-  // stream._write resets state.length
-  const ret = state.length < state.highWaterMark;
-  // We must ensure that previous needDrain will not be reset to false.
-  if (!ret)
-    state.needDrain = true;
-
-  if (state.writing || state.corked || state.errored || !state.constructed) {
-    state.buffered.push({ chunk, encoding, callback });
-    if (state.allBuffers && encoding !== 'buffer') {
-      state.allBuffers = false;
+  if ((state[kState] & (kWriting | kErrored | kCorked | kConstructed)) !== kConstructed) {
+    if ((state[kState] & kBuffered) === 0) {
+      state[kState] |= kBuffered;
+      state[kBufferedValue] = [];
+    }
+
+    state[kBufferedValue].push({ chunk, encoding, callback });
+    if ((state[kState] & kAllBuffers) !== 0 && encoding !== 'buffer') {
+      state[kState] &= ~kAllBuffers;
     }
-    if (state.allNoop && callback !== nop) {
-      state.allNoop = false;
+    if ((state[kState] & kAllNoop) !== 0 && callback !== nop) {
+      state[kState] &= ~kAllNoop;
     }
   } else {
     state.writelen = len;
-    state.writecb = callback;
-    state.writing = true;
-    state.sync = true;
+    if (callback !== nop) {
+      state.writecb = callback;
+    }
+    state[kState] |= kWriting | kSync | kExpectWriteCb;
     stream._write(chunk, encoding, state.onwrite);
-    state.sync = false;
+    state[kState] &= ~kSync;
+  }
+
+  const ret = state.length < state.highWaterMark;
+
+  if (!ret) {
+    state[kState] |= kNeedDrain;
   }
 
   // Return false if errored or destroyed in order to break
   // any synchronous while(stream.write(data)) loops.
-  return ret && !state.errored && !state.destroyed;
+  return ret && (state[kState] & (kDestroyed | kErrored)) === 0;
 }
 
 function doWrite(stream, state, writev, len, chunk, encoding, cb) {
   state.writelen = len;
-  state.writecb = cb;
-  state.writing = true;
-  state.sync = true;
-  if (state.destroyed)
+  if (cb !== nop) {
+    state.writecb = cb;
+  }
+  state[kState] |= kWriting | kSync | kExpectWriteCb;
+  if ((state[kState] & kDestroyed) !== 0)
     state.onwrite(new ERR_STREAM_DESTROYED('write'));
   else if (writev)
     stream._writev(chunk, state.onwrite);
   else
     stream._write(chunk, encoding, state.onwrite);
-  state.sync = false;
+  state[kState] &= ~kSync;
 }
 
 function onwriteError(stream, state, er, cb) {
@@ -434,16 +598,16 @@ function onwriteError(stream, state, er, cb) {
 
 function onwrite(stream, er) {
   const state = stream._writableState;
-  const sync = state.sync;
-  const cb = state.writecb;
 
-  if (typeof cb !== 'function') {
+  if ((state[kState] & kExpectWriteCb) === 0) {
     errorOrDestroy(stream, new ERR_MULTIPLE_CALLBACK());
     return;
   }
 
-  state.writing = false;
-  state.writecb = null;
+  const sync = (state[kState] & kSync) !== 0;
+  const cb = (state[kState] & kWriteCb) !== 0 ? state[kWriteCbValue] : nop;
+
+  state[kState] &= ~(kWriting | kExpectWriteCb | kWriteCb);
   state.length -= state.writelen;
   state.writelen = 0;
 
@@ -451,8 +615,9 @@ function onwrite(stream, er) {
     // Avoid V8 leak, https://github.com/nodejs/node/pull/34103#issuecomment-652002364
     er.stack; // eslint-disable-line no-unused-expressions
 
-    if (!state.errored) {
-      state.errored = er;
+    if ((state[kState] & kErrored) === 0) {
+      state[kErroredValue] = er;
+      state[kState] |= kErrored;
     }
 
     // In case of duplex streams we need to notify the readable side of the
@@ -467,21 +632,40 @@ function onwrite(stream, er) {
       onwriteError(stream, state, er, cb);
     }
   } else {
-    if (state.buffered.length > state.bufferedIndex) {
+    if ((state[kState] & kBuffered) !== 0) {
       clearBuffer(stream, state);
     }
 
     if (sync) {
+      const needDrain = (state[kState] & kNeedDrain) !== 0 && state.length === 0;
+      const needTick = needDrain || (state[kState] & kDestroyed !== 0) || cb !== nop;
+
       // It is a common case that the callback passed to .write() is always
       // the same. In that case, we do not schedule a new nextTick(), but
       // rather just increase a counter, to improve performance and avoid
       // memory allocations.
-      if (state.afterWriteTickInfo !== null &&
-          state.afterWriteTickInfo.cb === cb) {
-        state.afterWriteTickInfo.count++;
+      if (cb === nop) {
+        if ((state[kState] & kAfterWritePending) === 0 && needTick) {
+          process.nextTick(afterWrite, stream, state, 1, cb);
+          state[kState] |= kAfterWritePending;
+        } else {
+          state.pendingcb--;
+          if ((state[kState] & kEnding) !== 0) {
+            finishMaybe(stream, state, true);
+          }
+        }
+      } else if ((state[kState] & kAfterWriteTickInfo) !== 0 &&
+                 state[kAfterWriteTickInfoValue].cb === cb) {
+        state[kAfterWriteTickInfoValue].count++;
+      } else if (needTick) {
+        state[kAfterWriteTickInfoValue] = { count: 1, cb, stream, state };
+        process.nextTick(afterWriteTick, state[kAfterWriteTickInfoValue]);
+        state[kState] |= (kAfterWritePending | kAfterWriteTickInfo);
       } else {
-        state.afterWriteTickInfo = { count: 1, cb, stream, state };
-        process.nextTick(afterWriteTick, state.afterWriteTickInfo);
+        state.pendingcb--;
+        if ((state[kState] & kEnding) !== 0) {
+          finishMaybe(stream, state, true);
+        }
       }
     } else {
       afterWrite(stream, state, 1, cb);
@@ -490,15 +674,17 @@ function onwrite(stream, er) {
 }
 
 function afterWriteTick({ stream, state, count, cb }) {
-  state.afterWriteTickInfo = null;
+  state[kState] &= ~kAfterWriteTickInfo;
+  state[kAfterWriteTickInfoValue] = null;
   return afterWrite(stream, state, count, cb);
 }
 
 function afterWrite(stream, state, count, cb) {
-  const needDrain = !state.ending && !stream.destroyed && state.length === 0 &&
-    state.needDrain;
+  state[kState] &= ~kAfterWritePending;
+
+  const needDrain = (state[kState] & (kEnding | kNeedDrain | kDestroyed)) === kNeedDrain && state.length === 0;
   if (needDrain) {
-    state.needDrain = false;
+    state[kState] &= ~kNeedDrain;
     stream.emit('drain');
   }
 
@@ -507,44 +693,44 @@ function afterWrite(stream, state, count, cb) {
     cb(null);
   }
 
-  if (state.destroyed) {
+  if ((state[kState] & kDestroyed) !== 0) {
     errorBuffer(state);
   }
 
-  finishMaybe(stream, state);
+  if ((state[kState] & kEnding) !== 0) {
+    finishMaybe(stream, state, true);
+  }
 }
 
 // If there's something in the buffer waiting, then invoke callbacks.
 function errorBuffer(state) {
-  if (state.writing) {
+  if ((state[kState] & kWriting) !== 0) {
     return;
   }
 
-  for (let n = state.bufferedIndex; n < state.buffered.length; ++n) {
-    const { chunk, callback } = state.buffered[n];
-    const len = state.objectMode ? 1 : chunk.length;
-    state.length -= len;
-    callback(state.errored ?? new ERR_STREAM_DESTROYED('write'));
+  if ((state[kState] & kBuffered) !== 0) {
+    for (let n = state.bufferedIndex; n < state.buffered.length; ++n) {
+      const { chunk, callback } = state[kBufferedValue][n];
+      const len = (state[kState] & kObjectMode) !== 0 ? 1 : chunk.length;
+      state.length -= len;
+      callback(state.errored ?? new ERR_STREAM_DESTROYED('write'));
+    }
   }
 
-  const onfinishCallbacks = state[kOnFinished].splice(0);
-  for (let i = 0; i < onfinishCallbacks.length; i++) {
-    onfinishCallbacks[i](state.errored ?? new ERR_STREAM_DESTROYED('end'));
-  }
+
+  callFinishedCallbacks(state, state.errored ?? new ERR_STREAM_DESTROYED('end'));
 
   resetBuffer(state);
 }
 
 // If there's something in the buffer waiting, then process it.
 function clearBuffer(stream, state) {
-  if (state.corked ||
-      state.bufferProcessing ||
-      state.destroyed ||
-      !state.constructed) {
+  if ((state[kState] & (kDestroyed | kBufferProcessing | kCorked | kBuffered)) !== kBuffered) {
     return;
   }
 
-  const { buffered, bufferedIndex, objectMode } = state;
+  const objectMode = (state[kState] & kObjectMode) !== 0;
+  const { [kBufferedValue]: buffered, bufferedIndex } = state;
   const bufferedLength = buffered.length - bufferedIndex;
 
   if (!bufferedLength) {
@@ -553,20 +739,20 @@ function clearBuffer(stream, state) {
 
   let i = bufferedIndex;
 
-  state.bufferProcessing = true;
+  state[kState] |= kBufferProcessing;
   if (bufferedLength > 1 && stream._writev) {
     state.pendingcb -= bufferedLength - 1;
 
-    const callback = state.allNoop ? nop : (err) => {
+    const callback = (state[kState] & kAllNoop) !== 0 ? nop : (err) => {
       for (let n = i; n < buffered.length; ++n) {
         buffered[n].callback(err);
       }
     };
     // Make a copy of `buffered` if it's going to be used by `callback` above,
     // since `doWrite` will mutate the array.
-    const chunks = state.allNoop && i === 0 ?
+    const chunks = (state[kState] & kAllNoop) !== 0 && i === 0 ?
       buffered : ArrayPrototypeSlice(buffered, i);
-    chunks.allBuffers = state.allBuffers;
+    chunks.allBuffers = (state[kState] & kAllBuffers) !== 0;
 
     doWrite(stream, state, true, state.length, chunks, '', callback);
 
@@ -577,7 +763,7 @@ function clearBuffer(stream, state) {
       buffered[i++] = null;
       const len = objectMode ? 1 : chunk.length;
       doWrite(stream, state, false, len, chunk, encoding, callback);
-    } while (i < buffered.length && !state.writing);
+    } while (i < buffered.length && (state[kState] & kWriting) === 0);
 
     if (i === buffered.length) {
       resetBuffer(state);
@@ -588,7 +774,7 @@ function clearBuffer(stream, state) {
       state.bufferedIndex = i;
     }
   }
-  state.bufferProcessing = false;
+  state[kState] &= ~kBufferProcessing;
 }
 
 Writable.prototype._write = function(chunk, encoding, cb) {
@@ -615,7 +801,7 @@ Writable.prototype.end = function(chunk, encoding, cb) {
 
   let err;
 
-  if (chunk !== null && chunk !== undefined) {
+  if (chunk != null) {
     const ret = _write(this, chunk, encoding);
     if (ret instanceof Error) {
       err = ret;
@@ -623,36 +809,40 @@ Writable.prototype.end = function(chunk, encoding, cb) {
   }
 
   // .end() fully uncorks.
-  if (state.corked) {
+  if ((state[kState] & kCorked) !== 0) {
     state.corked = 1;
     this.uncork();
   }
 
   if (err) {
     // Do nothing...
-  } else if (!state.errored && !state.ending) {
+  } else if ((state[kState] & (kEnding | kErrored)) === 0) {
     // This is forgiving in terms of unnecessary calls to end() and can hide
     // logic errors. However, usually such errors are harmless and causing a
     // hard error can be disproportionately destructive. It is not always
     // trivial for the user to determine whether end() needs to be called
     // or not.
 
-    state.ending = true;
+    state[kState] |= kEnding;
     finishMaybe(this, state, true);
-    state.ended = true;
-  } else if (state.finished) {
+    state[kState] |= kEnded;
+  } else if ((state[kState] & kFinished) !== 0) {
     err = new ERR_STREAM_ALREADY_FINISHED('end');
-  } else if (state.destroyed) {
+  } else if ((state[kState] & kDestroyed) !== 0) {
     err = new ERR_STREAM_DESTROYED('end');
   }
 
   if (typeof cb === 'function') {
     if (err) {
       process.nextTick(cb, err);
-    } else if (state.finished) {
+    } else if ((state[kState] & kErrored) !== 0) {
+      process.nextTick(cb, state[kErroredValue]);
+    } else if ((state[kState] & kFinished) !== 0) {
       process.nextTick(cb, null);
     } else {
-      state[kOnFinished].push(cb);
+      state[kState] |= kOnFinished;
+      state[kOnFinishedValue] ??= [];
+      state[kOnFinishedValue].push(cb);
     }
   }
 
@@ -660,16 +850,19 @@ Writable.prototype.end = function(chunk, encoding, cb) {
 };
 
 function needFinish(state) {
-  return (state.ending &&
-          !state.destroyed &&
-          state.constructed &&
-          state.length === 0 &&
-          !state.errored &&
-          state.buffered.length === 0 &&
-          !state.finished &&
-          !state.writing &&
-          !state.errorEmitted &&
-          !state.closeEmitted);
+  return (
+    // State is ended && constructed but not destroyed, finished, writing, errorEmitted or closedEmitted
+    (state[kState] & (
+      kEnding |
+          kDestroyed |
+          kConstructed |
+          kFinished |
+          kWriting |
+          kErrorEmitted |
+          kCloseEmitted |
+          kErrored |
+          kBuffered
+    )) === (kEnding | kConstructed) && state.length === 0);
 }
 
 function callFinal(stream, state) {
@@ -684,13 +877,10 @@ function callFinal(stream, state) {
 
     state.pendingcb--;
     if (err) {
-      const onfinishCallbacks = state[kOnFinished].splice(0);
-      for (let i = 0; i < onfinishCallbacks.length; i++) {
-        onfinishCallbacks[i](err);
-      }
-      errorOrDestroy(stream, err, state.sync);
+      callFinishedCallbacks(state, err);
+      errorOrDestroy(stream, err, (state[kState] & kSync) !== 0);
     } else if (needFinish(state)) {
-      state.prefinished = true;
+      state[kState] |= kPrefinished;
       stream.emit('prefinish');
       // Backwards compat. Don't check state.sync here.
       // Some streams assume 'finish' will be emitted
@@ -700,7 +890,7 @@ function callFinal(stream, state) {
     }
   }
 
-  state.sync = true;
+  state[kState] |= kSync;
   state.pendingcb++;
 
   try {
@@ -709,16 +899,16 @@ function callFinal(stream, state) {
     onFinish(err);
   }
 
-  state.sync = false;
+  state[kState] &= ~kSync;
 }
 
 function prefinish(stream, state) {
-  if (!state.prefinished && !state.finalCalled) {
-    if (typeof stream._final === 'function' && !state.destroyed) {
-      state.finalCalled = true;
+  if ((state[kState] & (kPrefinished | kFinalCalled)) === 0) {
+    if (typeof stream._final === 'function' && (state[kState] & kDestroyed) === 0) {
+      state[kState] |= kFinalCalled;
       callFinal(stream, state);
     } else {
-      state.prefinished = true;
+      state[kState] |= kPrefinished;
       stream.emit('prefinish');
     }
   }
@@ -747,16 +937,13 @@ function finishMaybe(stream, state, sync) {
 
 function finish(stream, state) {
   state.pendingcb--;
-  state.finished = true;
+  state[kState] |= kFinished;
 
-  const onfinishCallbacks = state[kOnFinished].splice(0);
-  for (let i = 0; i < onfinishCallbacks.length; i++) {
-    onfinishCallbacks[i](null);
-  }
+  callFinishedCallbacks(state, null);
 
   stream.emit('finish');
 
-  if (state.autoDestroy) {
+  if ((state[kState] & kAutoDestroy) !== 0) {
     // In case of duplex streams we need a way to detect
     // if the readable side is ready for autoDestroy as well.
     const rState = stream._readableState;
@@ -772,25 +959,38 @@ function finish(stream, state) {
   }
 }
 
-ObjectDefineProperties(Writable.prototype, {
+function callFinishedCallbacks(state, err) {
+  if ((state[kState] & kOnFinished) === 0) {
+    return;
+  }
+
+  const onfinishCallbacks = state[kOnFinishedValue];
+  state[kOnFinishedValue] = null;
+  state[kState] &= ~kOnFinished;
+  for (let i = 0; i < onfinishCallbacks.length; i++) {
+    onfinishCallbacks[i](err);
+  }
+}
 
+ObjectDefineProperties(Writable.prototype, {
   closed: {
     __proto__: null,
     get() {
-      return this._writableState ? this._writableState.closed : false;
+      return this._writableState ? (this._writableState[kState] & kClosed) !== 0 : false;
     },
   },
 
   destroyed: {
     __proto__: null,
     get() {
-      return this._writableState ? this._writableState.destroyed : false;
+      return this._writableState ? (this._writableState[kState] & kDestroyed) !== 0 : false;
     },
     set(value) {
       // Backward compatibility, the user is explicitly managing destroyed.
-      if (this._writableState) {
-        this._writableState.destroyed = value;
-      }
+      if (!this._writableState) return;
+
+      if (value) this._writableState[kState] |= kDestroyed;
+      else this._writableState[kState] &= ~kDestroyed;
     },
   },
 
@@ -802,8 +1002,8 @@ ObjectDefineProperties(Writable.prototype, {
       // where the writable side was disabled upon construction.
       // Compat. The user might manually disable writable side through
       // deprecated setter.
-      return !!w && w.writable !== false && !w.destroyed && !w.errored &&
-        !w.ending && !w.ended;
+      return !!w && w.writable !== false && !w.errored &&
+        (w[kState] & (kEnding | kEnded | kDestroyed)) === 0;
     },
     set(val) {
       // Backwards compatible.
@@ -816,58 +1016,64 @@ ObjectDefineProperties(Writable.prototype, {
   writableFinished: {
     __proto__: null,
     get() {
-      return this._writableState ? this._writableState.finished : false;
+      const state = this._writableState;
+      return state ? (state[kState] & kFinished) !== 0 : false;
     },
   },
 
   writableObjectMode: {
     __proto__: null,
     get() {
-      return this._writableState ? this._writableState.objectMode : false;
+      const state = this._writableState;
+      return state ? (state[kState] & kObjectMode) !== 0 : false;
     },
   },
 
   writableBuffer: {
     __proto__: null,
     get() {
-      return this._writableState && this._writableState.getBuffer();
+      const state = this._writableState;
+      return state && state.getBuffer();
     },
   },
 
   writableEnded: {
     __proto__: null,
     get() {
-      return this._writableState ? this._writableState.ending : false;
+      const state = this._writableState;
+      return state ? (state[kState] & kEnding) !== 0 : false;
     },
   },
 
   writableNeedDrain: {
     __proto__: null,
     get() {
-      const wState = this._writableState;
-      if (!wState) return false;
-      return !wState.destroyed && !wState.ending && wState.needDrain;
+      const state = this._writableState;
+      return state ? (state[kState] & (kDestroyed | kEnding | kNeedDrain)) === kNeedDrain : false;
     },
   },
 
   writableHighWaterMark: {
     __proto__: null,
     get() {
-      return this._writableState && this._writableState.highWaterMark;
+      const state = this._writableState;
+      return state && state.highWaterMark;
     },
   },
 
   writableCorked: {
     __proto__: null,
     get() {
-      return this._writableState ? this._writableState.corked : 0;
+      const state = this._writableState;
+      return state ? state.corked : 0;
     },
   },
 
   writableLength: {
     __proto__: null,
     get() {
-      return this._writableState && this._writableState.length;
+      const state = this._writableState;
+      return state && state.length;
     },
   },
 
@@ -875,18 +1081,19 @@ ObjectDefineProperties(Writable.prototype, {
     __proto__: null,
     enumerable: false,
     get() {
-      return this._writableState ? this._writableState.errored : null;
+      const state = this._writableState;
+      return state ? state.errored : null;
     },
   },
 
   writableAborted: {
     __proto__: null,
-    enumerable: false,
     get: function() {
-      return !!(
-        this._writableState.writable !== false &&
-        (this._writableState.destroyed || this._writableState.errored) &&
-        !this._writableState.finished
+      const state = this._writableState;
+      return (
+        (state[kState] & (kHasWritable | kWritable)) !== kHasWritable &&
+        (state[kState] & (kDestroyed | kErrored)) !== 0 &&
+        (state[kState] & kFinished) === 0
       );
     },
   },
@@ -897,9 +1104,7 @@ Writable.prototype.destroy = function(err, cb) {
   const state = this._writableState;
 
   // Invoke pending callbacks.
-  if (!state.destroyed &&
-    (state.bufferedIndex < state.buffered.length ||
-      state[kOnFinished].length)) {
+  if ((state[kState] & (kBuffered | kOnFinished | kDestroyed)) !== kDestroyed) {
     process.nextTick(errorBuffer, state);
   }
 
diff --git a/lib/internal/test_runner/harness.js b/lib/internal/test_runner/harness.js
index 357347627fcc2b..2f18b0bcf091ac 100644
--- a/lib/internal/test_runner/harness.js
+++ b/lib/internal/test_runner/harness.js
@@ -21,12 +21,15 @@ const { kEmptyObject } = require('internal/util');
 const { kCancelledByParent, Test, Suite } = require('internal/test_runner/test');
 const {
   parseCommandLine,
+  reporterScope,
   setupTestReporters,
 } = require('internal/test_runner/utils');
 const { bigint: hrtime } = process.hrtime;
 
 const testResources = new SafeMap();
 
+testResources.set(reporterScope.asyncId(), reporterScope);
+
 function createTestTree(options = kEmptyObject) {
   return setup(new Test({ __proto__: null, ...options, name: '<root>' }));
 }
@@ -40,9 +43,14 @@ function createProcessEventHandler(eventName, rootTest) {
       throw err;
     }
 
-    // Check if this error is coming from a test. If it is, fail the test.
     const test = testResources.get(executionAsyncId());
 
+    // Check if this error is coming from a reporter. If it is, throw it.
+    if (test === reporterScope) {
+      throw err;
+    }
+
+    // Check if this error is coming from a test. If it is, fail the test.
     if (!test || test.finished) {
       // If the test is already finished or the resource that created the error
       // is not mapped to a Test, report this as a top level diagnostic.
diff --git a/lib/internal/test_runner/runner.js b/lib/internal/test_runner/runner.js
index 51d01114696030..cc9bcc09b714fe 100644
--- a/lib/internal/test_runner/runner.js
+++ b/lib/internal/test_runner/runner.js
@@ -29,6 +29,7 @@ const {
 
 const { spawn } = require('child_process');
 const { finished } = require('internal/streams/end-of-stream');
+const { resolve } = require('path');
 const { DefaultDeserializer, DefaultSerializer } = require('v8');
 // TODO(aduh95): switch to internal/readline/interface when backporting to Node.js 16.x is no longer a concern.
 const { createInterface } = require('readline');
@@ -110,14 +111,17 @@ function filterExecArgv(arg, i, arr) {
   !ArrayPrototypeSome(kFilterArgValues, (p) => arg === p || (i > 0 && arr[i - 1] === p) || StringPrototypeStartsWith(arg, `${p}=`));
 }
 
-function getRunArgs({ path, inspectPort, testNamePatterns }) {
+function getRunArgs(path, { inspectPort, testNamePatterns, only }) {
   const argv = ArrayPrototypeFilter(process.execArgv, filterExecArgv);
   if (isUsingInspector()) {
     ArrayPrototypePush(argv, `--inspect-port=${getInspectPort(inspectPort)}`);
   }
-  if (testNamePatterns) {
+  if (testNamePatterns != null) {
     ArrayPrototypeForEach(testNamePatterns, (pattern) => ArrayPrototypePush(argv, `--test-name-pattern=${pattern}`));
   }
+  if (only === true) {
+    ArrayPrototypePush(argv, '--test-only');
+  }
   ArrayPrototypePush(argv, path);
 
   return argv;
@@ -136,6 +140,17 @@ class FileTest extends Test {
   #rawBufferSize = 0;
   #reportedChildren = 0;
   failedSubtests = false;
+
+  constructor(options) {
+    super(options);
+    this.loc ??= {
+      __proto__: null,
+      line: 1,
+      column: 1,
+      file: resolve(this.name),
+    };
+  }
+
   #skipReporting() {
     return this.#reportedChildren > 0 && (!this.error || this.error.failureType === kSubtestsFailed);
   }
@@ -301,17 +316,17 @@ class FileTest extends Test {
   }
 }
 
-function runTestFile(path, root, inspectPort, filesWatcher, testNamePatterns) {
+function runTestFile(path, filesWatcher, opts) {
   const watchMode = filesWatcher != null;
-  const subtest = root.createSubtest(FileTest, path, async (t) => {
-    const args = getRunArgs({ __proto__: null, path, inspectPort, testNamePatterns });
+  const subtest = opts.root.createSubtest(FileTest, path, async (t) => {
+    const args = getRunArgs(path, opts);
     const stdio = ['pipe', 'pipe', 'pipe'];
     const env = { __proto__: null, ...process.env, NODE_TEST_CONTEXT: 'child-v8' };
     if (watchMode) {
       stdio.push('ipc');
       env.WATCH_REPORT_DEPENDENCIES = '1';
     }
-    if (root.harness.shouldColorizeTestFiles) {
+    if (opts.root.harness.shouldColorizeTestFiles) {
       env.FORCE_COLOR = '1';
     }
 
@@ -358,7 +373,7 @@ function runTestFile(path, root, inspectPort, filesWatcher, testNamePatterns) {
       filesWatcher.runningProcesses.delete(path);
       filesWatcher.runningSubtests.delete(path);
       if (filesWatcher.runningSubtests.size === 0) {
-        root.reporter[kEmitMessage]('test:watch:drained');
+        opts.root.reporter[kEmitMessage]('test:watch:drained');
       }
     }
 
@@ -381,10 +396,10 @@ function runTestFile(path, root, inspectPort, filesWatcher, testNamePatterns) {
   return subtest.start();
 }
 
-function watchFiles(testFiles, root, inspectPort, signal, testNamePatterns) {
+function watchFiles(testFiles, opts) {
   const runningProcesses = new SafeMap();
   const runningSubtests = new SafeMap();
-  const watcher = new FilesWatcher({ __proto__: null, debounce: 200, mode: 'filter', signal });
+  const watcher = new FilesWatcher({ __proto__: null, debounce: 200, mode: 'filter', signal: opts.signal });
   const filesWatcher = { __proto__: null, watcher, runningProcesses, runningSubtests };
 
   watcher.on('changed', ({ owners }) => {
@@ -400,19 +415,19 @@ function watchFiles(testFiles, root, inspectPort, signal, testNamePatterns) {
       }
       if (!runningSubtests.size) {
         // Reset the topLevel counter
-        root.harness.counters.topLevel = 0;
+        opts.root.harness.counters.topLevel = 0;
       }
       await runningSubtests.get(file);
-      runningSubtests.set(file, runTestFile(file, root, inspectPort, filesWatcher, testNamePatterns));
+      runningSubtests.set(file, runTestFile(file, filesWatcher, opts));
     }, undefined, (error) => {
       triggerUncaughtException(error, true /* fromPromise */);
     }));
   });
-  if (signal) {
+  if (opts.signal) {
     kResistStopPropagation ??= require('internal/event_target').kResistStopPropagation;
-    signal.addEventListener(
+    opts.signal.addEventListener(
       'abort',
-      () => root.postRun(),
+      () => opts.root.postRun(),
       { __proto__: null, once: true, [kResistStopPropagation]: true },
     );
   }
@@ -420,12 +435,11 @@ function watchFiles(testFiles, root, inspectPort, signal, testNamePatterns) {
   return filesWatcher;
 }
 
-function run(options) {
-  if (options === null || typeof options !== 'object') {
-    options = kEmptyObject;
-  }
+function run(options = kEmptyObject) {
+  validateObject(options, 'options');
+
   let { testNamePatterns, shard } = options;
-  const { concurrency, timeout, signal, files, inspectPort, watch, setup } = options;
+  const { concurrency, timeout, signal, files, inspectPort, watch, setup, only } = options;
 
   if (files != null) {
     validateArray(files, 'options.files');
@@ -433,6 +447,9 @@ function run(options) {
   if (watch != null) {
     validateBoolean(watch, 'options.watch');
   }
+  if (only != null) {
+    validateBoolean(only, 'options.only');
+  }
   if (shard != null) {
     validateObject(shard, 'options.shard');
     // Avoid re-evaluating the shard object in case it's a getter
@@ -478,14 +495,15 @@ function run(options) {
 
   let postRun = () => root.postRun();
   let filesWatcher;
+  const opts = { __proto__: null, root, signal, inspectPort, testNamePatterns, only };
   if (watch) {
-    filesWatcher = watchFiles(testFiles, root, inspectPort, signal, testNamePatterns);
+    filesWatcher = watchFiles(testFiles, opts);
     postRun = undefined;
   }
   const runFiles = () => {
     root.harness.bootstrapComplete = true;
     return SafePromiseAllSettledReturnVoid(testFiles, (path) => {
-      const subtest = runTestFile(path, root, inspectPort, filesWatcher, testNamePatterns);
+      const subtest = runTestFile(path, filesWatcher, opts);
       filesWatcher?.runningSubtests.set(path, subtest);
       return subtest;
     });
diff --git a/lib/internal/test_runner/test.js b/lib/internal/test_runner/test.js
index 4afb93f4a60df0..4eb02c5d4e3118 100644
--- a/lib/internal/test_runner/test.js
+++ b/lib/internal/test_runner/test.js
@@ -86,7 +86,7 @@ function stopTest(timeout, signal) {
 
   if (timeout === kDefaultTimeout) {
     disposeFunction = abortListener[SymbolDispose];
-  } if (timeout !== kDefaultTimeout) {
+  } else {
     timer = setTimeout(() => deferred.resolve(), timeout);
     timer.unref();
 
diff --git a/lib/internal/test_runner/utils.js b/lib/internal/test_runner/utils.js
index 971534af3e8e8b..b70ca649c8b8df 100644
--- a/lib/internal/test_runner/utils.js
+++ b/lib/internal/test_runner/utils.js
@@ -20,6 +20,7 @@ const {
   StringPrototypeSlice,
 } = primordials;
 
+const { AsyncResource } = require('async_hooks');
 const { relative } = require('path');
 const { createWriteStream } = require('fs');
 const { pathToFileURL } = require('internal/url');
@@ -163,15 +164,15 @@ async function getReportersMap(reporters, destinations, rootTest) {
   });
 }
 
-
-async function setupTestReporters(rootTest) {
+const reporterScope = new AsyncResource('TestReporterScope');
+const setupTestReporters = reporterScope.bind(async (rootTest) => {
   const { reporters, destinations } = parseCommandLine();
   const reportersMap = await getReportersMap(reporters, destinations, rootTest);
   for (let i = 0; i < reportersMap.length; i++) {
     const { reporter, destination } = reportersMap[i];
     compose(rootTest.reporter, reporter).pipe(destination);
   }
-}
+});
 
 let globalTestOptions;
 
@@ -417,6 +418,7 @@ module.exports = {
   isTestFailureError,
   kDefaultPattern,
   parseCommandLine,
+  reporterScope,
   setupTestReporters,
   getCoverageReport,
 };
diff --git a/lib/internal/tls/secure-context.js b/lib/internal/tls/secure-context.js
index 36d33e6ac8e2e3..0fa3098ffa1020 100644
--- a/lib/internal/tls/secure-context.js
+++ b/lib/internal/tls/secure-context.js
@@ -101,8 +101,10 @@ function processCiphers(ciphers, name) {
       ArrayPrototypeFilter(
         ciphers,
         (cipher) => {
-          return cipher.length > 0 &&
-            !StringPrototypeStartsWith(cipher, 'TLS_');
+          if (cipher.length === 0) return false;
+          if (StringPrototypeStartsWith(cipher, 'TLS_')) return false;
+          if (StringPrototypeStartsWith(cipher, '!TLS_')) return false;
+          return true;
         }), ':');
 
   const cipherSuites =
@@ -110,8 +112,10 @@ function processCiphers(ciphers, name) {
       ArrayPrototypeFilter(
         ciphers,
         (cipher) => {
-          return cipher.length > 0 &&
-            StringPrototypeStartsWith(cipher, 'TLS_');
+          if (cipher.length === 0) return false;
+          if (StringPrototypeStartsWith(cipher, 'TLS_')) return true;
+          if (StringPrototypeStartsWith(cipher, '!TLS_')) return true;
+          return false;
         }), ':');
 
   // Specifying empty cipher suites for both TLS1.2 and TLS1.3 is invalid, its
diff --git a/lib/internal/url.js b/lib/internal/url.js
index 92d5e84e87c71f..ca41c48582b19d 100644
--- a/lib/internal/url.js
+++ b/lib/internal/url.js
@@ -780,13 +780,7 @@ class URL {
       base = `${base}`;
     }
 
-    const href = bindingUrl.parse(input, base);
-
-    if (!href) {
-      throw new ERR_INVALID_URL(input);
-    }
-
-    this.#updateContext(href);
+    this.#updateContext(bindingUrl.parse(input, base));
   }
 
   [inspect.custom](depth, opts) {
@@ -861,7 +855,7 @@ class URL {
   set href(value) {
     value = `${value}`;
     const href = bindingUrl.update(this.#context.href, updateActions.kHref, value);
-    if (!href) { throw ERR_INVALID_URL(value); }
+    if (!href) { throw new ERR_INVALID_URL(value); }
     this.#updateContext(href);
   }
 
diff --git a/lib/internal/util.js b/lib/internal/util.js
index 3586084ba7b8bd..558a5da69773bb 100644
--- a/lib/internal/util.js
+++ b/lib/internal/util.js
@@ -63,7 +63,7 @@ const {
   sleep: _sleep,
   toUSVString: _toUSVString,
 } = internalBinding('util');
-const { isNativeError } = internalBinding('types');
+const { isNativeError, isPromise } = internalBinding('types');
 const { getOptionValue } = require('internal/options');
 
 const noCrypto = !process.versions.openssl;
@@ -358,6 +358,36 @@ function getConstructorOf(obj) {
   return null;
 }
 
+let cachedURL;
+let cachedCWD;
+
+/**
+ * Get the current working directory while accounting for the possibility that it has been deleted.
+ * `process.cwd()` can fail if the parent directory is deleted while the process runs.
+ * @returns {URL} The current working directory or the volume root if it cannot be determined.
+ */
+function getCWDURL() {
+  const { sep } = require('path');
+  const { pathToFileURL } = require('internal/url');
+
+  let cwd;
+
+  try {
+    // The implementation of `process.cwd()` already uses proper cache when it can.
+    // It's a relatively cheap call performance-wise for the most common use case.
+    cwd = process.cwd();
+  } catch {
+    cachedURL ??= pathToFileURL(sep);
+  }
+
+  if (cwd != null && cwd !== cachedCWD) {
+    cachedURL = pathToFileURL(cwd + sep);
+    cachedCWD = cwd;
+  }
+
+  return cachedURL;
+}
+
 function getSystemErrorName(err) {
   const entry = uvErrmapGet(err);
   return entry ? entry[0] : `Unknown system error ${err}`;
@@ -409,7 +439,10 @@ function promisify(original) {
           resolve(values[0]);
         }
       });
-      ReflectApply(original, this, args);
+      if (isPromise(ReflectApply(original, this, args))) {
+        process.emitWarning('Calling promisify on a function that returns a Promise is likely a mistake.',
+                            'DeprecationWarning', 'DEP0174');
+      }
     });
   }
 
@@ -850,6 +883,7 @@ module.exports = {
   filterDuplicateStrings,
   filterOwnProperties,
   getConstructorOf,
+  getCWDURL,
   getInternalGlobal,
   getSystemErrorMap,
   getSystemErrorName,
diff --git a/lib/internal/util/inspect.js b/lib/internal/util/inspect.js
index 2e3e1b60be871c..73da4446f824fe 100644
--- a/lib/internal/util/inspect.js
+++ b/lib/internal/util/inspect.js
@@ -154,6 +154,7 @@ const { BuiltinModule } = require('internal/bootstrap/realm');
 const {
   validateObject,
   validateString,
+  kValidateObjectAllowArray,
 } = require('internal/validators');
 
 let hexSlice;
@@ -2155,7 +2156,7 @@ function format(...args) {
 }
 
 function formatWithOptions(inspectOptions, ...args) {
-  validateObject(inspectOptions, 'inspectOptions', { allowArray: true });
+  validateObject(inspectOptions, 'inspectOptions', kValidateObjectAllowArray);
   return formatWithOptionsInternal(inspectOptions, args);
 }
 
diff --git a/lib/internal/validators.js b/lib/internal/validators.js
index c73cb213ebe72b..088a0a668ba8b2 100644
--- a/lib/internal/validators.js
+++ b/lib/internal/validators.js
@@ -177,7 +177,7 @@ function validateNumber(value, name, min = undefined, max) {
     throw new ERR_INVALID_ARG_TYPE(name, 'number', value);
 
   if ((min != null && value < min) || (max != null && value > max) ||
-      ((min != null || max != null) && NumberIsNaN(value))) {
+    ((min != null || max != null) && NumberIsNaN(value))) {
     throw new ERR_OUT_OF_RANGE(
       name,
       `${min != null ? `>= ${min}` : ''}${min != null && max != null ? ' && ' : ''}${max != null ? `<= ${max}` : ''}`,
@@ -218,41 +218,48 @@ function validateBoolean(value, name) {
     throw new ERR_INVALID_ARG_TYPE(name, 'boolean', value);
 }
 
-/**
- * @param {any} options
- * @param {string} key
- * @param {boolean} defaultValue
- * @returns {boolean}
- */
-function getOwnPropertyValueOrDefault(options, key, defaultValue) {
-  return options == null || !ObjectPrototypeHasOwnProperty(options, key) ?
-    defaultValue :
-    options[key];
-}
+const kValidateObjectNone = 0;
+const kValidateObjectAllowNullable = 1 << 0;
+const kValidateObjectAllowArray = 1 << 1;
+const kValidateObjectAllowFunction = 1 << 2;
 
 /**
  * @callback validateObject
  * @param {*} value
  * @param {string} name
- * @param {{
- *   allowArray?: boolean,
- *   allowFunction?: boolean,
- *   nullable?: boolean
- * }} [options]
+ * @param {number} [options]
  */
 
 /** @type {validateObject} */
 const validateObject = hideStackFrames(
-  (value, name, options = null) => {
-    const allowArray = getOwnPropertyValueOrDefault(options, 'allowArray', false);
-    const allowFunction = getOwnPropertyValueOrDefault(options, 'allowFunction', false);
-    const nullable = getOwnPropertyValueOrDefault(options, 'nullable', false);
-    if ((!nullable && value === null) ||
-        (!allowArray && ArrayIsArray(value)) ||
-        (typeof value !== 'object' && (
-          !allowFunction || typeof value !== 'function'
-        ))) {
-      throw new ERR_INVALID_ARG_TYPE(name, 'Object', value);
+  (value, name, options = kValidateObjectNone) => {
+    if (options === kValidateObjectNone) {
+      if (value === null || ArrayIsArray(value)) {
+        throw new ERR_INVALID_ARG_TYPE(name, 'Object', value);
+      }
+
+      if (typeof value !== 'object') {
+        throw new ERR_INVALID_ARG_TYPE(name, 'Object', value);
+      }
+    } else {
+      const throwOnNullable = (kValidateObjectAllowNullable & options) === 0;
+
+      if (throwOnNullable && value === null) {
+        throw new ERR_INVALID_ARG_TYPE(name, 'Object', value);
+      }
+
+      const throwOnArray = (kValidateObjectAllowArray & options) === 0;
+
+      if (throwOnArray && ArrayIsArray(value)) {
+        throw new ERR_INVALID_ARG_TYPE(name, 'Object', value);
+      }
+
+      const throwOnFunction = (kValidateObjectAllowFunction & options) === 0;
+      const typeofValue = typeof value;
+
+      if (typeofValue !== 'object' && (throwOnFunction || typeofValue !== 'function')) {
+        throw new ERR_INVALID_ARG_TYPE(name, 'Object', value);
+      }
     }
   });
 
@@ -564,6 +571,10 @@ module.exports = {
   validateInteger,
   validateNumber,
   validateObject,
+  kValidateObjectNone,
+  kValidateObjectAllowNullable,
+  kValidateObjectAllowArray,
+  kValidateObjectAllowFunction,
   validateOneOf,
   validatePlainFunction,
   validatePort,
diff --git a/lib/internal/vm.js b/lib/internal/vm.js
index ba5e2324667374..b67eb177b35f07 100644
--- a/lib/internal/vm.js
+++ b/lib/internal/vm.js
@@ -1,75 +1,79 @@
 'use strict';
 
 const {
-  ArrayPrototypeForEach,
+  ReflectApply,
+  Symbol,
 } = primordials;
 
 const {
+  ContextifyScript,
   compileFunction,
   isContext: _isContext,
 } = internalBinding('contextify');
 const {
-  validateArray,
-  validateBoolean,
-  validateBuffer,
+  runInContext,
+} = ContextifyScript.prototype;
+const {
+  default_host_defined_options,
+  vm_dynamic_import_missing_flag,
+} = internalBinding('symbols');
+const {
   validateFunction,
   validateObject,
-  validateString,
-  validateStringArray,
-  validateUint32,
+  kValidateObjectAllowArray,
 } = require('internal/validators');
+
 const {
-  ERR_INVALID_ARG_TYPE,
-} = require('internal/errors').codes;
+  getOptionValue,
+} = require('internal/options');
+
 
 function isContext(object) {
-  validateObject(object, 'object', { __proto__: null, allowArray: true });
+  validateObject(object, 'object', kValidateObjectAllowArray);
 
   return _isContext(object);
 }
 
-function internalCompileFunction(code, params, options) {
-  validateString(code, 'code');
-  if (params !== undefined) {
-    validateStringArray(params, 'params');
+function getHostDefinedOptionId(importModuleDynamically, filename) {
+  if (importModuleDynamically !== undefined) {
+    // Check that it's either undefined or a function before we pass
+    // it into the native constructor.
+    validateFunction(importModuleDynamically,
+                     'options.importModuleDynamically');
   }
-
-  const {
-    filename = '',
-    columnOffset = 0,
-    lineOffset = 0,
-    cachedData = undefined,
-    produceCachedData = false,
-    parsingContext = undefined,
-    contextExtensions = [],
-    importModuleDynamically,
-  } = options;
-
-  validateString(filename, 'options.filename');
-  validateUint32(columnOffset, 'options.columnOffset');
-  validateUint32(lineOffset, 'options.lineOffset');
-  if (cachedData !== undefined)
-    validateBuffer(cachedData, 'options.cachedData');
-  validateBoolean(produceCachedData, 'options.produceCachedData');
-  if (parsingContext !== undefined) {
-    if (
-      typeof parsingContext !== 'object' ||
-      parsingContext === null ||
-      !isContext(parsingContext)
-    ) {
-      throw new ERR_INVALID_ARG_TYPE(
-        'options.parsingContext',
-        'Context',
-        parsingContext,
-      );
-    }
+  if (importModuleDynamically === undefined) {
+    // We need a default host defined options that are the same for all
+    // scripts not needing custom module callbacks so that the isolate
+    // compilation cache can be hit.
+    return default_host_defined_options;
+  }
+  // We should've thrown here immediately when we introduced
+  // --experimental-vm-modules and importModuleDynamically, but since
+  // users are already using this callback to throw a similar error,
+  // we also defer the error to the time when an actual import() is called
+  // to avoid breaking them. To ensure that the isolate compilation
+  // cache can still be hit, use a constant sentinel symbol here.
+  if (!getOptionValue('--experimental-vm-modules')) {
+    return vm_dynamic_import_missing_flag;
   }
-  validateArray(contextExtensions, 'options.contextExtensions');
-  ArrayPrototypeForEach(contextExtensions, (extension, i) => {
-    const name = `options.contextExtensions[${i}]`;
-    validateObject(extension, name, { __proto__: null, nullable: true });
+
+  return Symbol(filename);
+}
+
+function registerImportModuleDynamically(referrer, importModuleDynamically) {
+  const { importModuleDynamicallyWrap } = require('internal/vm/module');
+  const { registerModule } = require('internal/modules/esm/utils');
+  registerModule(referrer, {
+    __proto__: null,
+    importModuleDynamically:
+      importModuleDynamicallyWrap(importModuleDynamically),
   });
+}
 
+function internalCompileFunction(
+  code, filename, lineOffset, columnOffset,
+  cachedData, produceCachedData, parsingContext, contextExtensions,
+  params, hostDefinedOptionId, importModuleDynamically) {
   const result = compileFunction(
     code,
     filename,
@@ -80,6 +84,7 @@ function internalCompileFunction(code, params, options) {
     parsingContext,
     contextExtensions,
     params,
+    hostDefinedOptionId,
   );
 
   if (produceCachedData) {
@@ -95,22 +100,65 @@ function internalCompileFunction(code, params, options) {
   }
 
   if (importModuleDynamically !== undefined) {
-    validateFunction(importModuleDynamically,
-                     'options.importModuleDynamically');
-    const { importModuleDynamicallyWrap } = require('internal/vm/module');
-    const wrapped = importModuleDynamicallyWrap(importModuleDynamically);
-    const func = result.function;
-    const { registerModule } = require('internal/modules/esm/utils');
-    registerModule(func, {
-      __proto__: null,
-      importModuleDynamically: wrapped,
-    });
+    registerImportModuleDynamically(result.function, importModuleDynamically);
   }
 
   return result;
 }
 
+function makeContextifyScript(code,
+                              filename,
+                              lineOffset,
+                              columnOffset,
+                              cachedData,
+                              produceCachedData,
+                              parsingContext,
+                              hostDefinedOptionId,
+                              importModuleDynamically) {
+  let script;
+  // Calling `ReThrow()` on a native TryCatch does not generate a new
+  // abort-on-uncaught-exception check. A dummy try/catch in JS land
+  // protects against that.
+  try { // eslint-disable-line no-useless-catch
+    script = new ContextifyScript(code,
+                                  filename,
+                                  lineOffset,
+                                  columnOffset,
+                                  cachedData,
+                                  produceCachedData,
+                                  parsingContext,
+                                  hostDefinedOptionId);
+  } catch (e) {
+    throw e; /* node-do-not-add-exception-line */
+  }
+
+  if (importModuleDynamically !== undefined) {
+    registerImportModuleDynamically(script, importModuleDynamically);
+  }
+  return script;
+}
+
+// Internal version of vm.Script.prototype.runInThisContext() which skips
+// argument validation.
+function runScriptInThisContext(script, displayErrors, breakOnFirstLine) {
+  return ReflectApply(
+    runInContext,
+    script,
+    [
+      null,                // sandbox - use current context
+      -1,                  // timeout
+      displayErrors,       // displayErrors
+      false,               // breakOnSigint
+      breakOnFirstLine,    // breakOnFirstLine
+    ],
+  );
+}
+
 module.exports = {
+  getHostDefinedOptionId,
   internalCompileFunction,
   isContext,
+  makeContextifyScript,
+  registerImportModuleDynamically,
+  runScriptInThisContext,
 };
diff --git a/lib/internal/vm/module.js b/lib/internal/vm/module.js
index c77ee9b107e0ad..d9a073fd4d7906 100644
--- a/lib/internal/vm/module.js
+++ b/lib/internal/vm/module.js
@@ -7,6 +7,7 @@ const {
   ArrayPrototypeIndexOf,
   ArrayPrototypeSome,
   ObjectDefineProperty,
+  ObjectFreeze,
   ObjectGetPrototypeOf,
   ObjectSetPrototypeOf,
   ReflectApply,
@@ -340,9 +341,7 @@ class SourceTextModule extends Module {
     if (this[kWrap] === undefined) {
       throw new ERR_VM_MODULE_NOT_MODULE();
     }
-    if (this[kDependencySpecifiers] === undefined) {
-      this[kDependencySpecifiers] = this[kWrap].getStaticDependencySpecifiers();
-    }
+    this[kDependencySpecifiers] ??= ObjectFreeze(this[kWrap].getStaticDependencySpecifiers());
     return this[kDependencySpecifiers];
   }
 
diff --git a/lib/internal/webstreams/readablestream.js b/lib/internal/webstreams/readablestream.js
index 28e985875c5ddb..83b49028eae8e0 100644
--- a/lib/internal/webstreams/readablestream.js
+++ b/lib/internal/webstreams/readablestream.js
@@ -14,11 +14,9 @@ const {
   ObjectCreate,
   ObjectDefineProperties,
   ObjectSetPrototypeOf,
-  Promise,
   PromisePrototypeThen,
   PromiseResolve,
   PromiseReject,
-  ReflectConstruct,
   SafePromiseAll,
   Symbol,
   SymbolAsyncIterator,
@@ -60,6 +58,8 @@ const {
   validateAbortSignal,
   validateBuffer,
   validateObject,
+  kValidateObjectAllowNullable,
+  kValidateObjectAllowFunction,
 } = require('internal/validators');
 
 const {
@@ -346,7 +346,7 @@ class ReadableStream {
   getReader(options = kEmptyObject) {
     if (!isReadableStream(this))
       throw new ERR_INVALID_THIS('ReadableStream');
-    validateObject(options, 'options', { nullable: true, allowFunction: true });
+    validateObject(options, 'options', kValidateObjectAllowNullable | kValidateObjectAllowFunction);
     const mode = options?.mode;
 
     if (mode === undefined)
@@ -477,9 +477,13 @@ class ReadableStream {
 
     // eslint-disable-next-line no-use-before-define
     const reader = new ReadableStreamDefaultReader(this);
-    let done = false;
+
+    // No __proto__ here to avoid the performance hit.
+    const state = {
+      done: false,
+      current: undefined,
+    };
     let started = false;
-    let current;
 
     // The nextSteps function is not an async function in order
     // to make it more efficient. Because nextSteps explicitly
@@ -488,7 +492,7 @@ class ReadableStream {
     // unnecessary Promise allocations to occur, which just add
     // cost.
     function nextSteps() {
-      if (done)
+      if (state.done)
         return PromiseResolve({ done: true, value: undefined });
 
       if (reader[kState].stream === undefined) {
@@ -498,31 +502,15 @@ class ReadableStream {
       }
       const promise = createDeferredPromise();
 
-      readableStreamDefaultReaderRead(reader, {
-        [kChunk](chunk) {
-          current = undefined;
-          promise.resolve({ value: chunk, done: false });
-        },
-        [kClose]() {
-          current = undefined;
-          done = true;
-          readableStreamReaderGenericRelease(reader);
-          promise.resolve({ done: true, value: undefined });
-        },
-        [kError](error) {
-          current = undefined;
-          done = true;
-          readableStreamReaderGenericRelease(reader);
-          promise.reject(error);
-        },
-      });
+      // eslint-disable-next-line no-use-before-define
+      readableStreamDefaultReaderRead(reader, new ReadableStreamAsyncIteratorReadRequest(reader, state, promise));
       return promise.promise;
     }
 
     async function returnSteps(value) {
-      if (done)
+      if (state.done)
         return { done: true, value }; // eslint-disable-line node-core/avoid-prototype-pollution
-      done = true;
+      state.done = true;
 
       if (reader[kState].stream === undefined) {
         throw new ERR_INVALID_STATE.TypeError(
@@ -559,19 +547,19 @@ class ReadableStream {
         // need to investigate if it's a bug in our impl or
         // the spec.
         if (!started) {
-          current = PromiseResolve();
+          state.current = PromiseResolve();
           started = true;
         }
-        current = current !== undefined ?
-          PromisePrototypeThen(current, nextSteps, nextSteps) :
+        state.current = state.current !== undefined ?
+          PromisePrototypeThen(state.current, nextSteps, nextSteps) :
           nextSteps();
-        return current;
+        return state.current;
       },
 
       return(error) {
-        return current ?
+        return state.current ?
           PromisePrototypeThen(
-            current,
+            state.current,
             () => returnSteps(error),
             () => returnSteps(error)) :
           returnSteps(error);
@@ -653,26 +641,37 @@ ObjectDefineProperties(ReadableStream.prototype, {
   [SymbolToStringTag]: getNonWritablePropertyDescriptor(ReadableStream.name),
 });
 
-function TransferredReadableStream() {
-  return ReflectConstruct(
-    function() {
-      markTransferMode(this, false, true);
-      this[kType] = 'ReadableStream';
-      this[kState] = {
-        disturbed: false,
-        state: 'readable',
-        storedError: undefined,
-        stream: undefined,
-        transfer: {
-          writable: undefined,
-          port: undefined,
-          promise: undefined,
-        },
-      };
-      this[kIsClosedPromise] = createDeferredPromise();
+function InternalTransferredReadableStream() {
+  markTransferMode(this, false, true);
+  this[kType] = 'ReadableStream';
+  this[kState] = {
+    disturbed: false,
+    reader: undefined,
+    state: 'readable',
+    storedError: undefined,
+    stream: undefined,
+    transfer: {
+      writable: undefined,
+      port1: undefined,
+      port2: undefined,
+      promise: undefined,
     },
-    [], ReadableStream);
+  };
+
+  this[kIsClosedPromise] = createDeferredPromise();
+}
+
+ObjectSetPrototypeOf(InternalTransferredReadableStream.prototype, ReadableStream.prototype);
+ObjectSetPrototypeOf(InternalTransferredReadableStream, ReadableStream);
+
+function TransferredReadableStream() {
+  const stream = new InternalTransferredReadableStream();
+
+  stream.constructor = ReadableStream;
+
+  return stream;
 }
+
 TransferredReadableStream.prototype[kDeserialize] = () => {};
 
 class ReadableStreamBYOBRequest {
@@ -773,6 +772,33 @@ function createReadableStreamBYOBRequest(controller, view) {
   return stream;
 }
 
+class ReadableStreamAsyncIteratorReadRequest {
+  constructor(reader, state, promise) {
+    this.reader = reader;
+    this.state = state;
+    this.promise = promise;
+  }
+
+  [kChunk](chunk) {
+    this.state.current = undefined;
+    this.promise.resolve({ value: chunk, done: false });
+  }
+
+  [kClose]() {
+    this.state.current = undefined;
+    this.state.done = true;
+    readableStreamReaderGenericRelease(this.reader);
+    this.promise.resolve({ done: true, value: undefined });
+  }
+
+  [kError](error) {
+    this.state.current = undefined;
+    this.state.done = true;
+    readableStreamReaderGenericRelease(this.reader);
+    this.promise.reject(error);
+  }
+}
+
 class DefaultReadRequest {
   constructor() {
     this[kState] = createDeferredPromise();
@@ -1336,7 +1362,9 @@ function readableStreamPipeTo(
 
   const promise = createDeferredPromise();
 
-  let currentWrite = PromiseResolve();
+  const state = {
+    currentWrite: PromiseResolve(),
+  };
 
   // The error here can be undefined. The rejected arg
   // tells us that the promise must be rejected even
@@ -1353,9 +1381,9 @@ function readableStreamPipeTo(
   }
 
   async function waitForCurrentWrite() {
-    const write = currentWrite;
+    const write = state.currentWrite;
     await write;
-    if (write !== currentWrite)
+    if (write !== state.currentWrite)
       await waitForCurrentWrite();
   }
 
@@ -1446,20 +1474,14 @@ function readableStreamPipeTo(
   async function step() {
     if (shuttingDown)
       return true;
+
     await writer[kState].ready.promise;
-    return new Promise((resolve, reject) => {
-      readableStreamDefaultReaderRead(
-        reader,
-        {
-          [kChunk](chunk) {
-            currentWrite = writableStreamDefaultWriterWrite(writer, chunk);
-            setPromiseHandled(currentWrite);
-            resolve(false);
-          },
-          [kClose]: () => resolve(true),
-          [kError]: reject,
-        });
-    });
+
+    const promise = createDeferredPromise();
+    // eslint-disable-next-line no-use-before-define
+    readableStreamDefaultReaderRead(reader, new PipeToReadableStreamReadRequest(writer, state, promise));
+
+    return promise.promise;
   }
 
   async function run() {
@@ -1521,6 +1543,28 @@ function readableStreamPipeTo(
   return promise.promise;
 }
 
+class PipeToReadableStreamReadRequest {
+  constructor(writer, state, promise) {
+    this.writer = writer;
+    this.state = state;
+    this.promise = promise;
+  }
+
+  [kChunk](chunk) {
+    this.state.currentWrite = writableStreamDefaultWriterWrite(this.writer, chunk);
+    setPromiseHandled(this.state.currentWrite);
+    this.promise.resolve(false);
+  }
+
+  [kClose]() {
+    this.promise.resolve(true);
+  }
+
+  [kError](error) {
+    this.promise.reject(error);
+  }
+}
+
 function readableStreamTee(stream, cloneForBranch2) {
   if (isReadableByteStreamController(stream[kState].controller)) {
     return readableByteStreamTee(stream);
diff --git a/lib/internal/webstreams/transformstream.js b/lib/internal/webstreams/transformstream.js
index 7a8f20a6eece38..4d47856a6a12de 100644
--- a/lib/internal/webstreams/transformstream.js
+++ b/lib/internal/webstreams/transformstream.js
@@ -4,9 +4,9 @@ const {
   FunctionPrototypeBind,
   FunctionPrototypeCall,
   ObjectDefineProperties,
+  ObjectSetPrototypeOf,
   PromisePrototypeThen,
   PromiseResolve,
-  ReflectConstruct,
   SymbolToStringTag,
   Symbol,
 } = primordials;
@@ -247,25 +247,33 @@ ObjectDefineProperties(TransformStream.prototype, {
   [SymbolToStringTag]: getNonWritablePropertyDescriptor(TransformStream.name),
 });
 
-function TransferredTransformStream() {
-  return ReflectConstruct(
-    function() {
-      markTransferMode(this, false, true);
-      this[kType] = 'TransformStream';
-      this[kState] = {
-        readable: undefined,
-        writable: undefined,
-        backpressure: undefined,
-        backpressureChange: {
-          promise: undefined,
-          resolve: undefined,
-          reject: undefined,
-        },
-        controller: undefined,
-      };
+function InternalTransferredTransformStream() {
+  markTransferMode(this, false, true);
+  this[kType] = 'TransformStream';
+  this[kState] = {
+    readable: undefined,
+    writable: undefined,
+    backpressure: undefined,
+    backpressureChange: {
+      promise: undefined,
+      resolve: undefined,
+      reject: undefined,
     },
-    [], TransformStream);
+    controller: undefined,
+  };
 }
+
+ObjectSetPrototypeOf(InternalTransferredTransformStream.prototype, TransformStream.prototype);
+ObjectSetPrototypeOf(InternalTransferredTransformStream, TransformStream);
+
+function TransferredTransformStream() {
+  const stream = new InternalTransferredTransformStream();
+
+  stream.constructor = TransformStream;
+
+  return stream;
+}
+
 TransferredTransformStream.prototype[kDeserialize] = () => {};
 
 class TransformStreamDefaultController {
diff --git a/lib/internal/webstreams/writablestream.js b/lib/internal/webstreams/writablestream.js
index 46d6ae28772c32..2115aba36e927b 100644
--- a/lib/internal/webstreams/writablestream.js
+++ b/lib/internal/webstreams/writablestream.js
@@ -6,10 +6,10 @@ const {
   FunctionPrototypeBind,
   FunctionPrototypeCall,
   ObjectDefineProperties,
+  ObjectSetPrototypeOf,
   PromisePrototypeThen,
   PromiseResolve,
   PromiseReject,
-  ReflectConstruct,
   Symbol,
   SymbolToStringTag,
 } = primordials;
@@ -326,55 +326,63 @@ ObjectDefineProperties(WritableStream.prototype, {
   [SymbolToStringTag]: getNonWritablePropertyDescriptor(WritableStream.name),
 });
 
-function TransferredWritableStream() {
-  return ReflectConstruct(
-    function() {
-      markTransferMode(this, false, true);
-      this[kType] = 'WritableStream';
-      this[kState] = {
-        close: createDeferredPromise(),
-        closeRequest: {
-          promise: undefined,
-          resolve: undefined,
-          reject: undefined,
-        },
-        inFlightWriteRequest: {
-          promise: undefined,
-          resolve: undefined,
-          reject: undefined,
-        },
-        inFlightCloseRequest: {
-          promise: undefined,
-          resolve: undefined,
-          reject: undefined,
-        },
-        pendingAbortRequest: {
-          abort: {
-            promise: undefined,
-            resolve: undefined,
-            reject: undefined,
-          },
-          reason: undefined,
-          wasAlreadyErroring: false,
-        },
-        backpressure: false,
-        controller: undefined,
-        state: 'writable',
-        storedError: undefined,
-        writeRequests: [],
-        writer: undefined,
-        transfer: {
-          promise: undefined,
-          port1: undefined,
-          port2: undefined,
-          readable: undefined,
-        },
-      };
-      this[kIsClosedPromise] = createDeferredPromise();
-      this[kControllerErrorFunction] = () => {};
+function InternalTransferredWritableStream() {
+  markTransferMode(this, false, true);
+  this[kType] = 'WritableStream';
+  this[kState] = {
+    close: createDeferredPromise(),
+    closeRequest: {
+      promise: undefined,
+      resolve: undefined,
+      reject: undefined,
+    },
+    inFlightWriteRequest: {
+      promise: undefined,
+      resolve: undefined,
+      reject: undefined,
     },
-    [], WritableStream);
+    inFlightCloseRequest: {
+      promise: undefined,
+      resolve: undefined,
+      reject: undefined,
+    },
+    pendingAbortRequest: {
+      abort: {
+        promise: undefined,
+        resolve: undefined,
+        reject: undefined,
+      },
+      reason: undefined,
+      wasAlreadyErroring: false,
+    },
+    backpressure: false,
+    controller: undefined,
+    state: 'writable',
+    storedError: undefined,
+    writeRequests: [],
+    writer: undefined,
+    transfer: {
+      readable: undefined,
+      port1: undefined,
+      port2: undefined,
+      promise: undefined,
+    },
+  };
+
+  this[kIsClosedPromise] = createDeferredPromise();
 }
+
+ObjectSetPrototypeOf(InternalTransferredWritableStream.prototype, WritableStream.prototype);
+ObjectSetPrototypeOf(InternalTransferredWritableStream, WritableStream);
+
+function TransferredWritableStream() {
+  const stream = new InternalTransferredWritableStream();
+
+  stream.constructor = WritableStream;
+
+  return stream;
+}
+
 TransferredWritableStream.prototype[kDeserialize] = () => {};
 
 class WritableStreamDefaultWriter {
diff --git a/lib/internal/worker.js b/lib/internal/worker.js
index 401bc43550ea7f..b58cbe56d01703 100644
--- a/lib/internal/worker.js
+++ b/lib/internal/worker.js
@@ -4,6 +4,7 @@ const {
   ArrayPrototypeForEach,
   ArrayPrototypeMap,
   ArrayPrototypePush,
+  AtomicsAdd,
   Float64Array,
   FunctionPrototypeBind,
   JSONStringify,
@@ -21,7 +22,7 @@ const {
   SymbolFor,
   TypedArrayPrototypeFill,
   Uint32Array,
-  globalThis: { Atomics, SharedArrayBuffer },
+  globalThis: { SharedArrayBuffer },
 } = primordials;
 
 const EventEmitter = require('events');
@@ -100,13 +101,12 @@ let cwdCounter;
 
 const environmentData = new SafeMap();
 
-// SharedArrayBuffers can be disabled with --no-harmony-sharedarraybuffer.
-// Atomics can be disabled with --no-harmony-atomics.
-if (isMainThread && SharedArrayBuffer !== undefined && Atomics !== undefined) {
+// SharedArrayBuffers can be disabled with --enable-sharedarraybuffer-per-context.
+if (isMainThread && SharedArrayBuffer !== undefined) {
   cwdCounter = new Uint32Array(new SharedArrayBuffer(4));
   const originalChdir = process.chdir;
   process.chdir = function(path) {
-    Atomics.add(cwdCounter, 0, 1);
+    AtomicsAdd(cwdCounter, 0, 1);
     originalChdir(path);
   };
 }
diff --git a/lib/os.js b/lib/os.js
index 34391697b5891c..1ad17c635182d4 100644
--- a/lib/os.js
+++ b/lib/os.js
@@ -61,9 +61,9 @@ const {
 } = internalBinding('os');
 
 function getCheckedFunction(fn) {
-  return hideStackFrames(function checkError(...args) {
+  return hideStackFrames(function checkError() {
     const ctx = {};
-    const ret = fn(...args, ctx);
+    const ret = fn(ctx);
     if (ret === undefined) {
       throw new ERR_SYSTEM_ERROR(ctx);
     }
diff --git a/lib/repl.js b/lib/repl.js
index afb86b18ad1d89..d8021215b3f425 100644
--- a/lib/repl.js
+++ b/lib/repl.js
@@ -118,6 +118,9 @@ const {
 } = require('internal/util');
 const { inspect } = require('internal/util/inspect');
 const vm = require('vm');
+
+const { runInThisContext, runInContext } = vm.Script.prototype;
+
 const path = require('path');
 const fs = require('fs');
 const { Interface } = require('readline');
@@ -185,7 +188,9 @@ const history = require('internal/repl/history');
 const {
   extensionFormatMap,
 } = require('internal/modules/esm/formats');
-
+const {
+  makeContextifyScript,
+} = require('internal/vm');
 let nextREPLResourceNumber = 1;
 // This prevents v8 code cache from getting confused and using a different
 // cache from a resource of the same name
@@ -204,6 +209,7 @@ const domainSet = new SafeWeakSet();
 
 const kBufferedCommandSymbol = Symbol('bufferedCommand');
 const kContextId = Symbol('contextId');
+const kLoadingSymbol = Symbol('loading');
 
 let addedNewListener = false;
 
@@ -429,8 +435,6 @@ function REPLServer(prompt,
   }
 
   function defaultEval(code, context, file, cb) {
-    const asyncESM = require('internal/process/esm_loader');
-
     let result, script, wrappedErr;
     let err = null;
     let wrappedCmd = false;
@@ -448,6 +452,21 @@ function REPLServer(prompt,
       wrappedCmd = true;
     }
 
+    const hostDefinedOptionId = Symbol(`eval:${file}`);
+    let parentURL;
+    try {
+      const { pathToFileURL } = require('internal/url');
+      // Adding `/repl` prevents dynamic imports from loading relative
+      // to the parent of `process.cwd()`.
+      parentURL = pathToFileURL(path.join(process.cwd(), 'repl')).href;
+    } catch {
+      // Continue regardless of error.
+    }
+    async function importModuleDynamically(specifier, _, importAttributes) {
+      const asyncESM = require('internal/process/esm_loader');
+      return asyncESM.esmLoader.import(specifier, parentURL,
+                                       importAttributes);
+    }
     // `experimentalREPLAwait` is set to true by default.
     // Shall be false in case `--no-experimental-repl-await` flag is used.
     if (experimentalREPLAwait && StringPrototypeIncludes(code, 'await')) {
@@ -465,28 +484,21 @@ function REPLServer(prompt,
       } catch (e) {
         let recoverableError = false;
         if (e.name === 'SyntaxError') {
-          let parentURL;
-          try {
-            const { pathToFileURL } = require('internal/url');
-            // Adding `/repl` prevents dynamic imports from loading relative
-            // to the parent of `process.cwd()`.
-            parentURL = pathToFileURL(path.join(process.cwd(), 'repl')).href;
-          } catch {
-            // Continue regardless of error.
-          }
-
           // Remove all "await"s and attempt running the script
           // in order to detect if error is truly non recoverable
           const fallbackCode = SideEffectFreeRegExpPrototypeSymbolReplace(/\bawait\b/g, code, '');
           try {
-            vm.createScript(fallbackCode, {
-              filename: file,
-              displayErrors: true,
-              importModuleDynamically: (specifier, _, importAssertions) => {
-                return asyncESM.esmLoader.import(specifier, parentURL,
-                                                 importAssertions);
-              },
-            });
+            makeContextifyScript(
+              fallbackCode,            // code
+              file,                    // filename,
+              0,                       // lineOffset
+              0,                       // columnOffset,
+              undefined,               // cachedData
+              false,                   // produceCachedData
+              undefined,               // parsingContext
+              hostDefinedOptionId,     // hostDefinedOptionId
+              importModuleDynamically, // importModuleDynamically
+            );
           } catch (fallbackError) {
             if (isRecoverableError(fallbackError, fallbackCode)) {
               recoverableError = true;
@@ -506,15 +518,6 @@ function REPLServer(prompt,
       return cb(null);
 
     if (err === null) {
-      let parentURL;
-      try {
-        const { pathToFileURL } = require('internal/url');
-        // Adding `/repl` prevents dynamic imports from loading relative
-        // to the parent of `process.cwd()`.
-        parentURL = pathToFileURL(path.join(process.cwd(), 'repl')).href;
-      } catch {
-        // Continue regardless of error.
-      }
       while (true) {
         try {
           if (self.replMode === module.exports.REPL_MODE_STRICT &&
@@ -523,14 +526,17 @@ function REPLServer(prompt,
             // value for statements and declarations that don't return a value.
             code = `'use strict'; void 0;\n${code}`;
           }
-          script = vm.createScript(code, {
-            filename: file,
-            displayErrors: true,
-            importModuleDynamically: (specifier, _, importAssertions) => {
-              return asyncESM.esmLoader.import(specifier, parentURL,
-                                               importAssertions);
-            },
-          });
+          script = makeContextifyScript(
+            code,                    // code
+            file,                    // filename,
+            0,                       // lineOffset
+            0,                       // columnOffset,
+            undefined,               // cachedData
+            false,                   // produceCachedData
+            undefined,               // parsingContext
+            hostDefinedOptionId,     // hostDefinedOptionId
+            importModuleDynamically, // importModuleDynamically
+          );
         } catch (e) {
           debug('parse error %j', code, e);
           if (wrappedCmd) {
@@ -590,9 +596,9 @@ function REPLServer(prompt,
           };
 
           if (self.useGlobal) {
-            result = script.runInThisContext(scriptOptions);
+            result = ReflectApply(runInThisContext, script, [scriptOptions]);
           } else {
-            result = script.runInContext(context, scriptOptions);
+            result = ReflectApply(runInContext, script, [context, scriptOptions]);
           }
         } finally {
           if (self.breakEvalOnSigint) {
@@ -882,7 +888,7 @@ function REPLServer(prompt,
       self[kBufferedCommandSymbol] += cmd + '\n';
 
       // code alignment
-      const matches = self._sawKeyPress ?
+      const matches = self._sawKeyPress && !self[kLoadingSymbol] ?
         RegExpPrototypeExec(/^\s+/, cmd) : null;
       if (matches) {
         const prefix = matches[0];
@@ -1801,8 +1807,10 @@ function defineDefaultCommands(repl) {
         const stats = fs.statSync(file);
         if (stats && stats.isFile()) {
           _turnOnEditorMode(this);
+          this[kLoadingSymbol] = true;
           const data = fs.readFileSync(file, 'utf8');
           this.write(data);
+          this[kLoadingSymbol] = false;
           _turnOffEditorMode(this);
           this.write('\n');
         } else {
diff --git a/lib/stream.js b/lib/stream.js
index 9a09401e7d016a..cdbc1fe0380694 100644
--- a/lib/stream.js
+++ b/lib/stream.js
@@ -64,7 +64,7 @@ for (const key of ObjectKeys(streamReturningOperators)) {
   const op = streamReturningOperators[key];
   function fn(...args) {
     if (new.target) {
-      throw ERR_ILLEGAL_CONSTRUCTOR();
+      throw new ERR_ILLEGAL_CONSTRUCTOR();
     }
     return Stream.Readable.from(ReflectApply(op, this, args));
   }
@@ -82,7 +82,7 @@ for (const key of ObjectKeys(promiseReturningOperators)) {
   const op = promiseReturningOperators[key];
   function fn(...args) {
     if (new.target) {
-      throw ERR_ILLEGAL_CONSTRUCTOR();
+      throw new ERR_ILLEGAL_CONSTRUCTOR();
     }
     return ReflectApply(op, this, args);
   }
diff --git a/lib/vm.js b/lib/vm.js
index 4b9bedec3f4934..d396a3df8c0e13 100644
--- a/lib/vm.js
+++ b/lib/vm.js
@@ -39,14 +39,16 @@ const {
   ERR_INVALID_ARG_TYPE,
 } = require('internal/errors').codes;
 const {
+  validateArray,
   validateBoolean,
   validateBuffer,
-  validateFunction,
   validateInt32,
-  validateObject,
   validateOneOf,
+  validateObject,
   validateString,
+  validateStringArray,
   validateUint32,
+  kValidateObjectAllowNullable,
 } = require('internal/validators');
 const {
   emitExperimentalWarning,
@@ -54,8 +56,10 @@ const {
   kVmBreakFirstLineSymbol,
 } = require('internal/util');
 const {
+  getHostDefinedOptionId,
   internalCompileFunction,
   isContext,
+  registerImportModuleDynamically,
 } = require('internal/vm');
 const kParsingContext = Symbol('script parsing context');
 
@@ -86,6 +90,8 @@ class Script extends ContextifyScript {
     }
     validateBoolean(produceCachedData, 'options.produceCachedData');
 
+    const hostDefinedOptionId =
+        getHostDefinedOptionId(importModuleDynamically, filename);
     // Calling `ReThrow()` on a native TryCatch does not generate a new
     // abort-on-uncaught-exception check. A dummy try/catch in JS land
     // protects against that.
@@ -96,21 +102,14 @@ class Script extends ContextifyScript {
             columnOffset,
             cachedData,
             produceCachedData,
-            parsingContext);
+            parsingContext,
+            hostDefinedOptionId);
     } catch (e) {
       throw e; /* node-do-not-add-exception-line */
     }
 
     if (importModuleDynamically !== undefined) {
-      validateFunction(importModuleDynamically,
-                       'options.importModuleDynamically');
-      const { importModuleDynamicallyWrap } = require('internal/vm/module');
-      const { registerModule } = require('internal/modules/esm/utils');
-      registerModule(this, {
-        __proto__: null,
-        importModuleDynamically:
-          importModuleDynamicallyWrap(importModuleDynamically),
-      });
+      registerImportModuleDynamically(this, importModuleDynamically);
     }
   }
 
@@ -297,7 +296,54 @@ function runInThisContext(code, options) {
 }
 
 function compileFunction(code, params, options = kEmptyObject) {
-  return internalCompileFunction(code, params, options).function;
+  validateString(code, 'code');
+  if (params !== undefined) {
+    validateStringArray(params, 'params');
+  }
+  const {
+    filename = '',
+    columnOffset = 0,
+    lineOffset = 0,
+    cachedData = undefined,
+    produceCachedData = false,
+    parsingContext = undefined,
+    contextExtensions = [],
+    importModuleDynamically,
+  } = options;
+
+  validateString(filename, 'options.filename');
+  validateInt32(columnOffset, 'options.columnOffset');
+  validateInt32(lineOffset, 'options.lineOffset');
+  if (cachedData !== undefined)
+    validateBuffer(cachedData, 'options.cachedData');
+  validateBoolean(produceCachedData, 'options.produceCachedData');
+  if (parsingContext !== undefined) {
+    if (
+      typeof parsingContext !== 'object' ||
+      parsingContext === null ||
+      !isContext(parsingContext)
+    ) {
+      throw new ERR_INVALID_ARG_TYPE(
+        'options.parsingContext',
+        'Context',
+        parsingContext,
+      );
+    }
+  }
+  validateArray(contextExtensions, 'options.contextExtensions');
+  ArrayPrototypeForEach(contextExtensions, (extension, i) => {
+    const name = `options.contextExtensions[${i}]`;
+    validateObject(extension, name, kValidateObjectAllowNullable);
+  });
+
+  const hostDefinedOptionId =
+      getHostDefinedOptionId(importModuleDynamically, filename);
+
+  return internalCompileFunction(
+    code, filename, lineOffset, columnOffset,
+    cachedData, produceCachedData, parsingContext, contextExtensions,
+    params, hostDefinedOptionId, importModuleDynamically,
+  ).function;
 }
 
 const measureMemoryModes = {
diff --git a/onboarding.md b/onboarding.md
index 1e912f0c8a4379..be393a64f3fc67 100644
--- a/onboarding.md
+++ b/onboarding.md
@@ -10,7 +10,7 @@ onboarding session.
   possible to add them to the organization if they are not using two-factor
   authentication. If they cannot receive SMS messages from GitHub, try
   [using a TOTP mobile app][].
-* Suggest the new Collaborator install [`node-core-utils`][] and
+* Suggest the new Collaborator install [`@node-core/utils`][] and
   [set up the credentials][] for it.
 
 ## Fifteen minutes before the onboarding session
@@ -230,7 +230,7 @@ needs to be pointed out separately during the onboarding.
   request.
   * Be sure to add the `PR-URL: <full-pr-url>` and appropriate `Reviewed-By:`
     metadata.
-  * [`node-core-utils`][] automates the generation of metadata and the landing
+  * [`@node-core/utils`][] automates the generation of metadata and the landing
     process. See the documentation of [`git-node`][].
   * [`core-validate-commit`][] automates the validation of commit messages.
     This will be run during `git node land --final` of the [`git-node`][]
@@ -260,10 +260,10 @@ needs to be pointed out separately during the onboarding.
 [Labels]: doc/contributing/collaborator-guide.md#labels
 [Landing pull requests]: doc/contributing/collaborator-guide.md#landing-pull-requests
 [Publicizing or hiding organization membership]: https://help.github.com/articles/publicizing-or-hiding-organization-membership/
+[`@node-core/utils`]: https://github.com/nodejs/node-core-utils
 [`author-ready`]: doc/contributing/collaborator-guide.md#author-ready-pull-requests
 [`core-validate-commit`]: https://github.com/nodejs/core-validate-commit
 [`git-node`]: https://github.com/nodejs/node-core-utils/blob/HEAD/docs/git-node.md
-[`node-core-utils`]: https://github.com/nodejs/node-core-utils
 [set up the credentials]: https://github.com/nodejs/node-core-utils#setting-up-github-credentials
 [static-analysis]: doc/contributing/static-analysis.md
 [two-factor authentication]: https://help.github.com/articles/securing-your-account-with-two-factor-authentication-2fa/
diff --git a/pyproject.toml b/pyproject.toml
index 6b51197ad66c2e..d0c3a056f2e92c 100644
--- a/pyproject.toml
+++ b/pyproject.toml
@@ -20,6 +20,7 @@ select = [
 exclude = [
   "deps",
   "tools/inspector_protocol",
+  "tools/node_modules",
 ]
 ignore = [
   "E401",
diff --git a/src/acorn_version.h b/src/acorn_version.h
index 8c71b2ece5aa80..7e0add93c19bf8 100644
--- a/src/acorn_version.h
+++ b/src/acorn_version.h
@@ -1,5 +1,5 @@
 // This is an auto generated file, please do not edit.
-// Refer to tools/update-acorn.sh
+// Refer to tools/dep_updaters/update-acorn.sh
 #ifndef SRC_ACORN_VERSION_H_
 #define SRC_ACORN_VERSION_H_
 #define ACORN_VERSION "8.10.0"
diff --git a/src/crypto/crypto_context.cc b/src/crypto/crypto_context.cc
index 3876adf7d72211..6e5bbe07d0c337 100644
--- a/src/crypto/crypto_context.cc
+++ b/src/crypto/crypto_context.cc
@@ -1052,34 +1052,60 @@ void SecureContext::LoadPKCS12(const FunctionCallbackInfo<Value>& args) {
   EVP_PKEY* pkey_ptr = nullptr;
   X509* cert_ptr = nullptr;
   STACK_OF(X509)* extra_certs_ptr = nullptr;
-  if (d2i_PKCS12_bio(in.get(), &p12_ptr) &&
-      (p12.reset(p12_ptr), true) &&  // Move ownership to the smart pointer.
-      PKCS12_parse(p12.get(), pass.data(),
-                   &pkey_ptr,
-                   &cert_ptr,
-                   &extra_certs_ptr) &&
-      (pkey.reset(pkey_ptr), cert.reset(cert_ptr),
-       extra_certs.reset(extra_certs_ptr), true) &&  // Move ownership.
-      SSL_CTX_use_certificate_chain(sc->ctx_.get(),
-                                    std::move(cert),
-                                    extra_certs.get(),
-                                    &sc->cert_,
-                                    &sc->issuer_) &&
-      SSL_CTX_use_PrivateKey(sc->ctx_.get(), pkey.get())) {
-    // Add CA certs too
-    for (int i = 0; i < sk_X509_num(extra_certs.get()); i++) {
-      X509* ca = sk_X509_value(extra_certs.get(), i);
-
-      if (cert_store == GetOrCreateRootCertStore()) {
-        cert_store = NewRootCertStore();
-        SSL_CTX_set_cert_store(sc->ctx_.get(), cert_store);
-      }
-      X509_STORE_add_cert(cert_store, ca);
-      SSL_CTX_add_client_CA(sc->ctx_.get(), ca);
+
+  if (!d2i_PKCS12_bio(in.get(), &p12_ptr)) {
+    goto done;
+  }
+
+  // Move ownership to the smart pointer:
+  p12.reset(p12_ptr);
+
+  if (!PKCS12_parse(
+          p12.get(), pass.data(), &pkey_ptr, &cert_ptr, &extra_certs_ptr)) {
+    goto done;
+  }
+
+  // Move ownership of the parsed data:
+  pkey.reset(pkey_ptr);
+  cert.reset(cert_ptr);
+  extra_certs.reset(extra_certs_ptr);
+
+  if (!pkey) {
+    return THROW_ERR_CRYPTO_OPERATION_FAILED(
+        env, "Unable to load private key from PFX data");
+  }
+
+  if (!cert) {
+    return THROW_ERR_CRYPTO_OPERATION_FAILED(
+        env, "Unable to load certificate from PFX data");
+  }
+
+  if (!SSL_CTX_use_certificate_chain(sc->ctx_.get(),
+                                     std::move(cert),
+                                     extra_certs.get(),
+                                     &sc->cert_,
+                                     &sc->issuer_)) {
+    goto done;
+  }
+
+  if (!SSL_CTX_use_PrivateKey(sc->ctx_.get(), pkey.get())) {
+    goto done;
+  }
+
+  // Add CA certs too
+  for (int i = 0; i < sk_X509_num(extra_certs.get()); i++) {
+    X509* ca = sk_X509_value(extra_certs.get(), i);
+
+    if (cert_store == GetOrCreateRootCertStore()) {
+      cert_store = NewRootCertStore();
+      SSL_CTX_set_cert_store(sc->ctx_.get(), cert_store);
     }
-    ret = true;
+    X509_STORE_add_cert(cert_store, ca);
+    SSL_CTX_add_client_CA(sc->ctx_.get(), ca);
   }
+  ret = true;
 
+done:
   if (!ret) {
     // TODO(@jasnell): Should this use ThrowCryptoError?
     unsigned long err = ERR_get_error();  // NOLINT(runtime/int)
diff --git a/src/crypto/crypto_hash.cc b/src/crypto/crypto_hash.cc
index 5627bac590f2b3..12dd5de3bd7de7 100644
--- a/src/crypto/crypto_hash.cc
+++ b/src/crypto/crypto_hash.cc
@@ -67,6 +67,9 @@ void Hash::Initialize(Environment* env, Local<Object> target) {
   SetMethodNoSideEffect(context, target, "getHashes", GetHashes);
 
   HashJob::Initialize(env, target);
+
+  SetMethodNoSideEffect(
+      context, target, "internalVerifyIntegrity", InternalVerifyIntegrity);
 }
 
 void Hash::RegisterExternalReferences(ExternalReferenceRegistry* registry) {
@@ -76,6 +79,8 @@ void Hash::RegisterExternalReferences(ExternalReferenceRegistry* registry) {
   registry->Register(GetHashes);
 
   HashJob::RegisterExternalReferences(registry);
+
+  registry->Register(InternalVerifyIntegrity);
 }
 
 void Hash::New(const FunctionCallbackInfo<Value>& args) {
@@ -308,5 +313,50 @@ bool HashTraits::DeriveBits(
   return true;
 }
 
+void InternalVerifyIntegrity(const v8::FunctionCallbackInfo<v8::Value>& args) {
+  Environment* env = Environment::GetCurrent(args);
+
+  CHECK_EQ(args.Length(), 3);
+
+  CHECK(args[0]->IsString());
+  Utf8Value algorithm(env->isolate(), args[0]);
+
+  CHECK(args[1]->IsString() || IsAnyBufferSource(args[1]));
+  ByteSource content = ByteSource::FromStringOrBuffer(env, args[1]);
+
+  CHECK(args[2]->IsArrayBufferView());
+  ArrayBufferOrViewContents<unsigned char> expected(args[2]);
+
+  const EVP_MD* md_type = EVP_get_digestbyname(*algorithm);
+  unsigned char digest[EVP_MAX_MD_SIZE];
+  unsigned int digest_size;
+  if (md_type == nullptr || EVP_Digest(content.data(),
+                                       content.size(),
+                                       digest,
+                                       &digest_size,
+                                       md_type,
+                                       nullptr) != 1) {
+    return ThrowCryptoError(
+        env, ERR_get_error(), "Digest method not supported");
+  }
+
+  if (digest_size != expected.size() ||
+      CRYPTO_memcmp(digest, expected.data(), digest_size) != 0) {
+    Local<Value> error;
+    MaybeLocal<Value> rc =
+        StringBytes::Encode(env->isolate(),
+                            reinterpret_cast<const char*>(digest),
+                            digest_size,
+                            BASE64,
+                            &error);
+    if (rc.IsEmpty()) {
+      CHECK(!error.IsEmpty());
+      env->isolate()->ThrowException(error);
+      return;
+    }
+    args.GetReturnValue().Set(rc.FromMaybe(Local<Value>()));
+  }
+}
+
 }  // namespace crypto
 }  // namespace node
diff --git a/src/crypto/crypto_hash.h b/src/crypto/crypto_hash.h
index 96a9804420db63..2d17c3510ed214 100644
--- a/src/crypto/crypto_hash.h
+++ b/src/crypto/crypto_hash.h
@@ -82,6 +82,8 @@ struct HashTraits final {
 
 using HashJob = DeriveBitsJob<HashTraits>;
 
+void InternalVerifyIntegrity(const v8::FunctionCallbackInfo<v8::Value>& args);
+
 }  // namespace crypto
 }  // namespace node
 
diff --git a/src/crypto/crypto_rsa.cc b/src/crypto/crypto_rsa.cc
index 3f8499457cf107..f222ab9cf5ccbc 100644
--- a/src/crypto/crypto_rsa.cc
+++ b/src/crypto/crypto_rsa.cc
@@ -577,7 +577,9 @@ Maybe<bool> GetRsaKeyDetail(
       int64_t salt_length = 20;
 
       if (params->hashAlgorithm != nullptr) {
-        hash_nid = OBJ_obj2nid(params->hashAlgorithm->algorithm);
+        const ASN1_OBJECT* hash_obj;
+        X509_ALGOR_get0(&hash_obj, nullptr, nullptr, params->hashAlgorithm);
+        hash_nid = OBJ_obj2nid(hash_obj);
       }
 
       if (target
@@ -590,9 +592,13 @@ Maybe<bool> GetRsaKeyDetail(
       }
 
       if (params->maskGenAlgorithm != nullptr) {
-        mgf_nid = OBJ_obj2nid(params->maskGenAlgorithm->algorithm);
+        const ASN1_OBJECT* mgf_obj;
+        X509_ALGOR_get0(&mgf_obj, nullptr, nullptr, params->maskGenAlgorithm);
+        mgf_nid = OBJ_obj2nid(mgf_obj);
         if (mgf_nid == NID_mgf1) {
-          mgf1_hash_nid = OBJ_obj2nid(params->maskHash->algorithm);
+          const ASN1_OBJECT* mgf1_hash_obj;
+          X509_ALGOR_get0(&mgf1_hash_obj, nullptr, nullptr, params->maskHash);
+          mgf1_hash_nid = OBJ_obj2nid(mgf1_hash_obj);
         }
       }
 
diff --git a/src/crypto/crypto_tls.cc b/src/crypto/crypto_tls.cc
index 43a661cca7c313..5e1a1f2fbf01c9 100644
--- a/src/crypto/crypto_tls.cc
+++ b/src/crypto/crypto_tls.cc
@@ -223,7 +223,7 @@ int SelectALPNCallback(
     const unsigned char* in,
     unsigned int inlen,
     void* arg) {
-  TLSWrap* w = static_cast<TLSWrap*>(arg);
+  TLSWrap* w = static_cast<TLSWrap*>(SSL_get_app_data(s));
   if (w->alpn_callback_enabled_) {
     Environment* env = w->env();
     HandleScope handle_scope(env->isolate());
@@ -1293,7 +1293,8 @@ void TLSWrap::EnableALPNCb(const FunctionCallbackInfo<Value>& args) {
   wrap->alpn_callback_enabled_ = true;
 
   SSL* ssl = wrap->ssl_.get();
-  SSL_CTX_set_alpn_select_cb(SSL_get_SSL_CTX(ssl), SelectALPNCallback, wrap);
+  SSL_CTX* ssl_ctx = SSL_get_SSL_CTX(ssl);
+  SSL_CTX_set_alpn_select_cb(ssl_ctx, SelectALPNCallback, nullptr);
 }
 
 void TLSWrap::GetServername(const FunctionCallbackInfo<Value>& args) {
@@ -1589,7 +1590,8 @@ void TLSWrap::SetALPNProtocols(const FunctionCallbackInfo<Value>& args) {
   } else {
     w->alpn_protos_ = std::vector<unsigned char>(
         protos.data(), protos.data() + protos.length());
-    SSL_CTX_set_alpn_select_cb(SSL_get_SSL_CTX(ssl), SelectALPNCallback, w);
+    SSL_CTX* ssl_ctx = SSL_get_SSL_CTX(ssl);
+    SSL_CTX_set_alpn_select_cb(ssl_ctx, SelectALPNCallback, nullptr);
   }
 }
 
diff --git a/src/debug_utils.h b/src/debug_utils.h
index 31c929f122cd1f..280b4cb39c780a 100644
--- a/src/debug_utils.h
+++ b/src/debug_utils.h
@@ -51,6 +51,7 @@ void NODE_EXTERN_PRIVATE FWrite(FILE* file, const std::string& str);
   V(SEA)                                                                       \
   V(WASI)                                                                      \
   V(MKSNAPSHOT)                                                                \
+  V(SNAPSHOT_SERDES)                                                           \
   V(PERMISSION_MODEL)
 
 enum class DebugCategory : unsigned int {
diff --git a/src/env_properties.h b/src/env_properties.h
index db471d4efb8d1d..7356846d6e7085 100644
--- a/src/env_properties.h
+++ b/src/env_properties.h
@@ -33,6 +33,7 @@
 // Symbols are per-isolate primitives but Environment proxies them
 // for the sake of convenience.
 #define PER_ISOLATE_SYMBOL_PROPERTIES(V)                                       \
+  V(default_host_defined_options, "default_host_defined_options")              \
   V(fs_use_promises_symbol, "fs_use_promises_symbol")                          \
   V(async_id_symbol, "async_id_symbol")                                        \
   V(handle_onclose_symbol, "handle_onclose")                                   \
@@ -45,7 +46,8 @@
   V(owner_symbol, "owner_symbol")                                              \
   V(onpskexchange_symbol, "onpskexchange")                                     \
   V(resource_symbol, "resource_symbol")                                        \
-  V(trigger_async_id_symbol, "trigger_async_id_symbol")
+  V(trigger_async_id_symbol, "trigger_async_id_symbol")                        \
+  V(vm_dynamic_import_missing_flag, "vm_dynamic_import_missing_flag")
 
 // Strings are per-isolate primitives but Environment proxies them
 // for the sake of convenience.  Strings should be ASCII-only.
@@ -57,6 +59,7 @@
   V(args_string, "args")                                                       \
   V(asn1curve_string, "asn1Curve")                                             \
   V(async_ids_stack_string, "async_ids_stack")                                 \
+  V(base_string, "base")                                                       \
   V(bits_string, "bits")                                                       \
   V(block_list_string, "blockList")                                            \
   V(buffer_string, "buffer")                                                   \
@@ -72,6 +75,10 @@
   V(channel_string, "channel")                                                 \
   V(chunks_sent_since_last_write_string, "chunksSentSinceLastWrite")           \
   V(clone_unsupported_type_str, "Cannot clone object of unsupported type.")    \
+  V(clone_transfer_needed_str,                                                 \
+    "Object that needs transfer was found in message but not listed in "       \
+    "transferList")                                                            \
+  V(clone_untransferable_str, "Found invalid value in transferList.")          \
   V(code_string, "code")                                                       \
   V(commonjs_string, "commonjs")                                               \
   V(config_string, "config")                                                   \
diff --git a/src/inspector/node_string.cc b/src/inspector/node_string.cc
index 0f780f46c8ebdd..7960971a094fd4 100644
--- a/src/inspector/node_string.cc
+++ b/src/inspector/node_string.cc
@@ -97,16 +97,6 @@ double toDouble(const char* buffer, size_t length, bool* ok) {
   return d;
 }
 
-std::unique_ptr<Value> parseMessage(const std::string_view message,
-                                    bool binary) {
-  if (binary) {
-    return Value::parseBinary(
-        reinterpret_cast<const uint8_t*>(message.data()),
-        message.length());
-  }
-  return parseJSON(message);
-}
-
 ProtocolMessage jsonToMessage(String message) {
   return message;
 }
diff --git a/src/inspector/node_string.h b/src/inspector/node_string.h
index e36da446248ef1..369041841ef96d 100644
--- a/src/inspector/node_string.h
+++ b/src/inspector/node_string.h
@@ -68,8 +68,6 @@ void builderAppendQuotedString(StringBuilder& builder, const std::string_view);
 std::unique_ptr<Value> parseJSON(const std::string_view);
 std::unique_ptr<Value> parseJSON(v8_inspector::StringView view);
 
-std::unique_ptr<Value> parseMessage(const std::string_view message,
-                                    bool binary);
 ProtocolMessage jsonToMessage(String message);
 ProtocolMessage binaryToMessage(std::vector<uint8_t> message);
 String fromUTF8(const uint8_t* data, size_t length);
diff --git a/src/inspector_agent.cc b/src/inspector_agent.cc
index f0b4cc43c864ae..de372400fd9ced 100644
--- a/src/inspector_agent.cc
+++ b/src/inspector_agent.cc
@@ -253,8 +253,8 @@ class ChannelImpl final : public v8_inspector::V8Inspector::Channel,
                        "[inspector received] %s\n",
                        raw_message);
     std::unique_ptr<protocol::DictionaryValue> value =
-        protocol::DictionaryValue::cast(protocol::StringUtil::parseMessage(
-            raw_message, false));
+        protocol::DictionaryValue::cast(
+            protocol::StringUtil::parseJSON(message));
     int call_id;
     std::string method;
     node_dispatcher_->parseCommand(value.get(), &call_id, &method);
diff --git a/src/js_native_api.h b/src/js_native_api.h
index 3aa0ee5c1c5c5c..d665052b947552 100644
--- a/src/js_native_api.h
+++ b/src/js_native_api.h
@@ -28,7 +28,7 @@
 #ifndef NAPI_EXTERN
 #ifdef _WIN32
 #define NAPI_EXTERN __declspec(dllexport)
-#elif defined(__wasm32__)
+#elif defined(__wasm__)
 #define NAPI_EXTERN                                                            \
   __attribute__((visibility("default")))                                       \
   __attribute__((__import_module__("napi")))
@@ -517,6 +517,16 @@ NAPI_EXTERN napi_status NAPI_CDECL napi_add_finalizer(napi_env env,
 
 #endif  // NAPI_VERSION >= 5
 
+#ifdef NAPI_EXPERIMENTAL
+
+NAPI_EXTERN napi_status NAPI_CDECL
+node_api_post_finalizer(napi_env env,
+                        napi_finalize finalize_cb,
+                        void* finalize_data,
+                        void* finalize_hint);
+
+#endif  // NAPI_EXPERIMENTAL
+
 #if NAPI_VERSION >= 6
 
 // BigInt
diff --git a/src/js_native_api_v8.cc b/src/js_native_api_v8.cc
index 823799a901ad83..044244eccfe9ea 100644
--- a/src/js_native_api_v8.cc
+++ b/src/js_native_api_v8.cc
@@ -57,8 +57,22 @@
     (out) = v8::type::New((buffer), (byte_offset), (length));                  \
   } while (0)
 
-namespace v8impl {
+void napi_env__::InvokeFinalizerFromGC(v8impl::RefTracker* finalizer) {
+  if (module_api_version != NAPI_VERSION_EXPERIMENTAL) {
+    EnqueueFinalizer(finalizer);
+  } else {
+    // The experimental code calls finalizers immediately to release native
+    // objects as soon as possible. In that state any code that may affect GC
+    // state causes a fatal error. To work around this issue the finalizer code
+    // can call node_api_post_finalizer.
+    auto restore_state = node::OnScopeLeave(
+        [this, saved = in_gc_finalizer] { in_gc_finalizer = saved; });
+    in_gc_finalizer = true;
+    finalizer->Finalize();
+  }
+}
 
+namespace v8impl {
 namespace {
 
 template <typename CCharType, typename StringMaker>
@@ -68,6 +82,7 @@ napi_status NewString(napi_env env,
                       napi_value* result,
                       StringMaker string_maker) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   if (length > 0) CHECK_ARG(env, str);
   CHECK_ARG(env, result);
   RETURN_STATUS_IF_FALSE(
@@ -92,6 +107,7 @@ napi_status NewExternalString(napi_env env,
                               StringMaker string_maker) {
   napi_status status;
 #if defined(V8_ENABLE_SANDBOX)
+  env->CheckGCAccess();
   status = create_api(env, str, length, result);
   if (status == napi_ok) {
     if (copied != nullptr) {
@@ -604,28 +620,70 @@ void Finalizer::ResetFinalizer() {
   finalize_hint_ = nullptr;
 }
 
-// Wrapper around v8impl::Persistent that implements reference counting.
-RefBase::RefBase(napi_env env,
-                 uint32_t initial_refcount,
-                 Ownership ownership,
-                 napi_finalize finalize_callback,
-                 void* finalize_data,
-                 void* finalize_hint)
+TrackedFinalizer::TrackedFinalizer(napi_env env,
+                                   napi_finalize finalize_callback,
+                                   void* finalize_data,
+                                   void* finalize_hint)
     : Finalizer(env, finalize_callback, finalize_data, finalize_hint),
-      refcount_(initial_refcount),
-      ownership_(ownership) {
+      RefTracker() {
   Link(finalize_callback == nullptr ? &env->reflist : &env->finalizing_reflist);
 }
 
-// When a RefBase is being deleted, it may have been queued to call its
+TrackedFinalizer* TrackedFinalizer::New(napi_env env,
+                                        napi_finalize finalize_callback,
+                                        void* finalize_data,
+                                        void* finalize_hint) {
+  return new TrackedFinalizer(
+      env, finalize_callback, finalize_data, finalize_hint);
+}
+
+// When a TrackedFinalizer is being deleted, it may have been queued to call its
 // finalizer.
-RefBase::~RefBase() {
+TrackedFinalizer::~TrackedFinalizer() {
   // Remove from the env's tracked list.
   Unlink();
   // Try to remove the finalizer from the scheduled second pass callback.
   env_->DequeueFinalizer(this);
 }
 
+void TrackedFinalizer::Finalize() {
+  FinalizeCore(/*deleteMe:*/ true);
+}
+
+void TrackedFinalizer::FinalizeCore(bool deleteMe) {
+  // Swap out the field finalize_callback so that it can not be accidentally
+  // called more than once.
+  napi_finalize finalize_callback = finalize_callback_;
+  void* finalize_data = finalize_data_;
+  void* finalize_hint = finalize_hint_;
+  ResetFinalizer();
+
+  // Either the RefBase is going to be deleted in the finalize_callback or not,
+  // it should be removed from the tracked list.
+  Unlink();
+  // If the finalize_callback is present, it should either delete the
+  // derived RefBase, or the RefBase ownership was set to Ownership::kRuntime
+  // and the deleteMe parameter is true.
+  if (finalize_callback != nullptr) {
+    env_->CallFinalizer(finalize_callback, finalize_data, finalize_hint);
+  }
+
+  if (deleteMe) {
+    delete this;
+  }
+}
+
+// Wrapper around v8impl::Persistent that implements reference counting.
+RefBase::RefBase(napi_env env,
+                 uint32_t initial_refcount,
+                 Ownership ownership,
+                 napi_finalize finalize_callback,
+                 void* finalize_data,
+                 void* finalize_hint)
+    : TrackedFinalizer(env, finalize_callback, finalize_data, finalize_hint),
+      refcount_(initial_refcount),
+      ownership_(ownership) {}
+
 RefBase* RefBase::New(napi_env env,
                       uint32_t initial_refcount,
                       Ownership ownership,
@@ -660,31 +718,9 @@ uint32_t RefBase::RefCount() {
 }
 
 void RefBase::Finalize() {
-  Ownership ownership = ownership_;
-  // Swap out the field finalize_callback so that it can not be accidentally
-  // called more than once.
-  napi_finalize finalize_callback = finalize_callback_;
-  void* finalize_data = finalize_data_;
-  void* finalize_hint = finalize_hint_;
-  ResetFinalizer();
-
-  // Either the RefBase is going to be deleted in the finalize_callback or not,
-  // it should be removed from the tracked list.
-  Unlink();
-  // 1. If the finalize_callback is present, it should either delete the
-  //    RefBase, or set ownership with Ownership::kRuntime.
-  // 2. If the finalizer is not present, the RefBase can be deleted after the
-  //    call.
-  if (finalize_callback != nullptr) {
-    env_->CallFinalizer(finalize_callback, finalize_data, finalize_hint);
-    // No access to `this` after finalize_callback is called.
-  }
-
   // If the RefBase is not Ownership::kRuntime, userland code should delete it.
-  // Now delete it if it is Ownership::kRuntime.
-  if (ownership == Ownership::kRuntime) {
-    delete this;
-  }
+  // Delete it if it is Ownership::kRuntime.
+  FinalizeCore(/*deleteMe:*/ ownership_ == Ownership::kRuntime);
 }
 
 template <typename... Args>
@@ -779,7 +815,7 @@ void Reference::WeakCallback(const v8::WeakCallbackInfo<Reference>& data) {
   Reference* reference = data.GetParameter();
   // The reference must be reset during the weak callback as the API protocol.
   reference->persistent_.Reset();
-  reference->env_->EnqueueFinalizer(reference);
+  reference->env_->InvokeFinalizerFromGC(reference);
 }
 
 }  // end of namespace v8impl
@@ -1436,6 +1472,7 @@ napi_status NAPI_CDECL napi_is_array(napi_env env,
                                      napi_value value,
                                      bool* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -1495,6 +1532,7 @@ napi_status NAPI_CDECL napi_get_prototype(napi_env env,
 
 napi_status NAPI_CDECL napi_create_object(napi_env env, napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsValueFromV8LocalValue(v8::Object::New(env->isolate));
@@ -1504,6 +1542,7 @@ napi_status NAPI_CDECL napi_create_object(napi_env env, napi_value* result) {
 
 napi_status NAPI_CDECL napi_create_array(napi_env env, napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsValueFromV8LocalValue(v8::Array::New(env->isolate));
@@ -1515,6 +1554,7 @@ napi_status NAPI_CDECL napi_create_array_with_length(napi_env env,
                                                      size_t length,
                                                      napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result =
@@ -1615,6 +1655,7 @@ napi_status NAPI_CDECL napi_create_double(napi_env env,
                                           double value,
                                           napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result =
@@ -1627,6 +1668,7 @@ napi_status NAPI_CDECL napi_create_int32(napi_env env,
                                          int32_t value,
                                          napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result =
@@ -1639,6 +1681,7 @@ napi_status NAPI_CDECL napi_create_uint32(napi_env env,
                                           uint32_t value,
                                           napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsValueFromV8LocalValue(
@@ -1651,6 +1694,7 @@ napi_status NAPI_CDECL napi_create_int64(napi_env env,
                                          int64_t value,
                                          napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsValueFromV8LocalValue(
@@ -1663,6 +1707,7 @@ napi_status NAPI_CDECL napi_create_bigint_int64(napi_env env,
                                                 int64_t value,
                                                 napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result =
@@ -1675,6 +1720,7 @@ napi_status NAPI_CDECL napi_create_bigint_uint64(napi_env env,
                                                  uint64_t value,
                                                  napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsValueFromV8LocalValue(
@@ -1689,6 +1735,7 @@ napi_status NAPI_CDECL napi_create_bigint_words(napi_env env,
                                                 const uint64_t* words,
                                                 napi_value* result) {
   NAPI_PREAMBLE(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, words);
   CHECK_ARG(env, result);
 
@@ -1709,6 +1756,7 @@ napi_status NAPI_CDECL napi_get_boolean(napi_env env,
                                         bool value,
                                         napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   v8::Isolate* isolate = env->isolate;
@@ -1726,6 +1774,7 @@ napi_status NAPI_CDECL napi_create_symbol(napi_env env,
                                           napi_value description,
                                           napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   v8::Isolate* isolate = env->isolate;
@@ -1748,6 +1797,7 @@ napi_status NAPI_CDECL node_api_symbol_for(napi_env env,
                                            size_t length,
                                            napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   napi_value js_description_string;
@@ -1793,6 +1843,7 @@ napi_status NAPI_CDECL napi_create_error(napi_env env,
                                          napi_value msg,
                                          napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, msg);
   CHECK_ARG(env, result);
 
@@ -1813,6 +1864,7 @@ napi_status NAPI_CDECL napi_create_type_error(napi_env env,
                                               napi_value msg,
                                               napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, msg);
   CHECK_ARG(env, result);
 
@@ -1833,6 +1885,7 @@ napi_status NAPI_CDECL napi_create_range_error(napi_env env,
                                                napi_value msg,
                                                napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, msg);
   CHECK_ARG(env, result);
 
@@ -1853,6 +1906,7 @@ napi_status NAPI_CDECL node_api_create_syntax_error(napi_env env,
                                                     napi_value msg,
                                                     napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, msg);
   CHECK_ARG(env, result);
 
@@ -1874,6 +1928,7 @@ napi_status NAPI_CDECL napi_typeof(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -1913,6 +1968,7 @@ napi_status NAPI_CDECL napi_typeof(napi_env env,
 
 napi_status NAPI_CDECL napi_get_undefined(napi_env env, napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsValueFromV8LocalValue(v8::Undefined(env->isolate));
@@ -1922,6 +1978,7 @@ napi_status NAPI_CDECL napi_get_undefined(napi_env env, napi_value* result) {
 
 napi_status NAPI_CDECL napi_get_null(napi_env env, napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsValueFromV8LocalValue(v8::Null(env->isolate));
@@ -1967,6 +2024,7 @@ napi_status NAPI_CDECL napi_get_new_target(napi_env env,
   CHECK_ENV(env);
   CHECK_ARG(env, cbinfo);
   CHECK_ARG(env, result);
+  env->CheckGCAccess();
 
   v8impl::CallbackWrapper* info =
       reinterpret_cast<v8impl::CallbackWrapper*>(cbinfo);
@@ -2013,6 +2071,7 @@ napi_status NAPI_CDECL napi_call_function(napi_env env,
 
 napi_status NAPI_CDECL napi_get_global(napi_env env, napi_value* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsValueFromV8LocalValue(env->context()->Global());
@@ -2110,6 +2169,7 @@ napi_status NAPI_CDECL napi_is_error(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot
   // throw JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2125,6 +2185,7 @@ napi_status NAPI_CDECL napi_get_value_double(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2142,6 +2203,7 @@ napi_status NAPI_CDECL napi_get_value_int32(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2166,6 +2228,7 @@ napi_status NAPI_CDECL napi_get_value_uint32(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2190,6 +2253,7 @@ napi_status NAPI_CDECL napi_get_value_int64(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2223,6 +2287,7 @@ napi_status NAPI_CDECL napi_get_value_bigint_int64(napi_env env,
                                                    int64_t* result,
                                                    bool* lossless) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
   CHECK_ARG(env, lossless);
@@ -2241,6 +2306,7 @@ napi_status NAPI_CDECL napi_get_value_bigint_uint64(napi_env env,
                                                     uint64_t* result,
                                                     bool* lossless) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
   CHECK_ARG(env, lossless);
@@ -2260,6 +2326,7 @@ napi_status NAPI_CDECL napi_get_value_bigint_words(napi_env env,
                                                    size_t* word_count,
                                                    uint64_t* words) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, word_count);
 
@@ -2290,6 +2357,7 @@ napi_status NAPI_CDECL napi_get_value_bool(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2312,6 +2380,7 @@ napi_status NAPI_CDECL napi_get_value_bool(napi_env env,
 napi_status NAPI_CDECL napi_get_value_string_latin1(
     napi_env env, napi_value value, char* buf, size_t bufsize, size_t* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
 
   v8::Local<v8::Value> val = v8impl::V8LocalValueFromJsValue(value);
@@ -2350,6 +2419,7 @@ napi_status NAPI_CDECL napi_get_value_string_latin1(
 napi_status NAPI_CDECL napi_get_value_string_utf8(
     napi_env env, napi_value value, char* buf, size_t bufsize, size_t* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
 
   v8::Local<v8::Value> val = v8impl::V8LocalValueFromJsValue(value);
@@ -2391,6 +2461,7 @@ napi_status NAPI_CDECL napi_get_value_string_utf16(napi_env env,
                                                    size_t bufsize,
                                                    size_t* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
 
   v8::Local<v8::Value> val = v8impl::V8LocalValueFromJsValue(value);
@@ -2577,6 +2648,7 @@ napi_status NAPI_CDECL napi_get_value_external(napi_env env,
                                                napi_value value,
                                                void** result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2597,6 +2669,7 @@ napi_status NAPI_CDECL napi_create_reference(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2621,6 +2694,7 @@ napi_status NAPI_CDECL napi_delete_reference(napi_env env, napi_ref ref) {
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, ref);
 
   delete reinterpret_cast<v8impl::Reference*>(ref);
@@ -2639,6 +2713,7 @@ napi_status NAPI_CDECL napi_reference_ref(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, ref);
 
   v8impl::Reference* reference = reinterpret_cast<v8impl::Reference*>(ref);
@@ -2661,6 +2736,7 @@ napi_status NAPI_CDECL napi_reference_unref(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, ref);
 
   v8impl::Reference* reference = reinterpret_cast<v8impl::Reference*>(ref);
@@ -2687,6 +2763,7 @@ napi_status NAPI_CDECL napi_get_reference_value(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, ref);
   CHECK_ARG(env, result);
 
@@ -2701,6 +2778,7 @@ napi_status NAPI_CDECL napi_open_handle_scope(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsHandleScopeFromV8HandleScope(
@@ -2714,6 +2792,7 @@ napi_status NAPI_CDECL napi_close_handle_scope(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, scope);
   if (env->open_handle_scopes == 0) {
     return napi_handle_scope_mismatch;
@@ -2729,6 +2808,7 @@ napi_status NAPI_CDECL napi_open_escapable_handle_scope(
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = v8impl::JsEscapableHandleScopeFromV8EscapableHandleScope(
@@ -2742,6 +2822,7 @@ napi_status NAPI_CDECL napi_close_escapable_handle_scope(
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, scope);
   if (env->open_handle_scopes == 0) {
     return napi_handle_scope_mismatch;
@@ -2759,6 +2840,7 @@ napi_status NAPI_CDECL napi_escape_handle(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, scope);
   CHECK_ARG(env, escapee);
   CHECK_ARG(env, result);
@@ -2837,6 +2919,7 @@ napi_status NAPI_CDECL napi_is_exception_pending(napi_env env, bool* result) {
   // NAPI_PREAMBLE is not used here: this function must execute when there is a
   // pending exception.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   *result = !env->last_exception.IsEmpty();
@@ -2848,6 +2931,7 @@ napi_status NAPI_CDECL napi_get_and_clear_last_exception(napi_env env,
   // NAPI_PREAMBLE is not used here: this function must execute when there is a
   // pending exception.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, result);
 
   if (env->last_exception.IsEmpty()) {
@@ -2865,6 +2949,7 @@ napi_status NAPI_CDECL napi_is_arraybuffer(napi_env env,
                                            napi_value value,
                                            bool* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -2917,6 +3002,7 @@ napi_status NAPI_CDECL napi_get_arraybuffer_info(napi_env env,
                                                  void** data,
                                                  size_t* byte_length) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, arraybuffer);
 
   v8::Local<v8::Value> value = v8impl::V8LocalValueFromJsValue(arraybuffer);
@@ -2939,6 +3025,7 @@ napi_status NAPI_CDECL napi_is_typedarray(napi_env env,
                                           napi_value value,
                                           bool* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -3025,6 +3112,7 @@ napi_status NAPI_CDECL napi_get_typedarray_info(napi_env env,
                                                 napi_value* arraybuffer,
                                                 size_t* byte_offset) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, typedarray);
 
   v8::Local<v8::Value> value = v8impl::V8LocalValueFromJsValue(typedarray);
@@ -3115,6 +3203,7 @@ napi_status NAPI_CDECL napi_is_dataview(napi_env env,
                                         napi_value value,
                                         bool* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -3131,6 +3220,7 @@ napi_status NAPI_CDECL napi_get_dataview_info(napi_env env,
                                               napi_value* arraybuffer,
                                               size_t* byte_offset) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, dataview);
 
   v8::Local<v8::Value> value = v8impl::V8LocalValueFromJsValue(dataview);
@@ -3206,6 +3296,7 @@ napi_status NAPI_CDECL napi_is_promise(napi_env env,
                                        napi_value value,
                                        bool* is_promise) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, is_promise);
 
@@ -3232,6 +3323,7 @@ napi_status NAPI_CDECL napi_is_date(napi_env env,
                                     napi_value value,
                                     bool* is_date) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, is_date);
 
@@ -3244,6 +3336,7 @@ napi_status NAPI_CDECL napi_get_date_value(napi_env env,
                                            napi_value value,
                                            double* result) {
   NAPI_PREAMBLE(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -3290,6 +3383,7 @@ napi_status NAPI_CDECL napi_add_finalizer(napi_env env,
   // Omit NAPI_PREAMBLE and GET_RETURN_STATUS because V8 calls here cannot throw
   // JS exceptions.
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, js_object);
   CHECK_ARG(env, finalize_cb);
 
@@ -3310,6 +3404,20 @@ napi_status NAPI_CDECL napi_add_finalizer(napi_env env,
   return napi_clear_last_error(env);
 }
 
+#ifdef NAPI_EXPERIMENTAL
+
+napi_status NAPI_CDECL node_api_post_finalizer(napi_env env,
+                                               napi_finalize finalize_cb,
+                                               void* finalize_data,
+                                               void* finalize_hint) {
+  CHECK_ENV(env);
+  env->EnqueueFinalizer(v8impl::TrackedFinalizer::New(
+      env, finalize_cb, finalize_data, finalize_hint));
+  return napi_clear_last_error(env);
+}
+
+#endif
+
 napi_status NAPI_CDECL napi_adjust_external_memory(napi_env env,
                                                    int64_t change_in_bytes,
                                                    int64_t* adjusted_value) {
@@ -3355,6 +3463,7 @@ napi_status NAPI_CDECL napi_get_instance_data(napi_env env, void** data) {
 napi_status NAPI_CDECL napi_detach_arraybuffer(napi_env env,
                                                napi_value arraybuffer) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, arraybuffer);
 
   v8::Local<v8::Value> value = v8impl::V8LocalValueFromJsValue(arraybuffer);
@@ -3374,6 +3483,7 @@ napi_status NAPI_CDECL napi_is_detached_arraybuffer(napi_env env,
                                                     napi_value arraybuffer,
                                                     bool* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, arraybuffer);
   CHECK_ARG(env, result);
 
diff --git a/src/js_native_api_v8.h b/src/js_native_api_v8.h
index 1ac738af2adb88..db39686c91127e 100644
--- a/src/js_native_api_v8.h
+++ b/src/js_native_api_v8.h
@@ -105,6 +105,9 @@ struct napi_env__ {
     CallIntoModule([&](napi_env env) { cb(env, data, hint); });
   }
 
+  // Invoke finalizer from V8 garbage collector.
+  void InvokeFinalizerFromGC(v8impl::RefTracker* finalizer);
+
   // Enqueue the finalizer to the napi_env's own queue of the second pass
   // weak callback.
   // Implementation should drain the queue at the time it is safe to call
@@ -130,6 +133,19 @@ struct napi_env__ {
     delete this;
   }
 
+  void CheckGCAccess() {
+    if (module_api_version == NAPI_VERSION_EXPERIMENTAL && in_gc_finalizer) {
+      v8impl::OnFatalError(
+          nullptr,
+          "Finalizer is calling a function that may affect GC state.\n"
+          "The finalizers are run directly from GC and must not affect GC "
+          "state.\n"
+          "Use `node_api_post_finalizer` from inside of the finalizer to work "
+          "around this issue.\n"
+          "It schedules the call as a new task in the event loop.");
+    }
+  }
+
   v8::Isolate* const isolate;  // Shortcut for context()->GetIsolate()
   v8impl::Persistent<v8::Context> context_persistent;
 
@@ -148,6 +164,7 @@ struct napi_env__ {
   int refs = 1;
   void* instance_data = nullptr;
   int32_t module_api_version = NODE_API_DEFAULT_MODULE_API_VERSION;
+  bool in_gc_finalizer = false;
 
  protected:
   // Should not be deleted directly. Delete with `napi_env__::DeleteMe()`
@@ -211,6 +228,7 @@ inline napi_status napi_set_last_error(napi_env env,
 // NAPI_PREAMBLE is not wrapped in do..while: try_catch must have function scope
 #define NAPI_PREAMBLE(env)                                                     \
   CHECK_ENV((env));                                                            \
+  (env)->CheckGCAccess();                                                      \
   RETURN_STATUS_IF_FALSE(                                                      \
       (env), (env)->last_exception.IsEmpty(), napi_pending_exception);         \
   RETURN_STATUS_IF_FALSE((env),                                                \
@@ -355,8 +373,28 @@ enum class Ownership {
   kUserland,
 };
 
-// Wrapper around Finalizer that implements reference counting.
-class RefBase : public Finalizer, public RefTracker {
+// Wrapper around Finalizer that can be tracked.
+class TrackedFinalizer : public Finalizer, public RefTracker {
+ protected:
+  TrackedFinalizer(napi_env env,
+                   napi_finalize finalize_callback,
+                   void* finalize_data,
+                   void* finalize_hint);
+
+ public:
+  static TrackedFinalizer* New(napi_env env,
+                               napi_finalize finalize_callback,
+                               void* finalize_data,
+                               void* finalize_hint);
+  ~TrackedFinalizer() override;
+
+ protected:
+  void Finalize() override;
+  void FinalizeCore(bool deleteMe);
+};
+
+// Wrapper around TrackedFinalizer that implements reference counting.
+class RefBase : public TrackedFinalizer {
  protected:
   RefBase(napi_env env,
           uint32_t initial_refcount,
@@ -372,7 +410,6 @@ class RefBase : public Finalizer, public RefTracker {
                       napi_finalize finalize_callback,
                       void* finalize_data,
                       void* finalize_hint);
-  virtual ~RefBase();
 
   void* Data();
   uint32_t Ref();
diff --git a/src/js_native_api_v8_internals.h b/src/js_native_api_v8_internals.h
index 4f1b94d3d0c9d7..7bf3bf0fa7e1a2 100644
--- a/src/js_native_api_v8_internals.h
+++ b/src/js_native_api_v8_internals.h
@@ -17,6 +17,7 @@
 
 #include "env.h"
 #include "gtest/gtest_prod.h"
+#include "node_errors.h"
 #include "node_internals.h"
 
 #define NAPI_ARRAYSIZE(array) node::arraysize((array))
@@ -34,6 +35,11 @@ using Persistent = v8::Global<T>;
 
 using PersistentToLocal = node::PersistentToLocal;
 
+[[noreturn]] inline void OnFatalError(const char* location,
+                                      const char* message) {
+  node::OnFatalError(location, message);
+}
+
 }  // end of namespace v8impl
 
 #endif  // SRC_JS_NATIVE_API_V8_INTERNALS_H_
diff --git a/src/module_wrap.cc b/src/module_wrap.cc
index a4190c9290e609..99802b372f432f 100644
--- a/src/module_wrap.cc
+++ b/src/module_wrap.cc
@@ -249,19 +249,19 @@ void ModuleWrap::New(const FunctionCallbackInfo<Value>& args) {
   args.GetReturnValue().Set(that);
 }
 
-static Local<Object> createImportAssertionContainer(Environment* env,
-  Isolate* isolate, Local<FixedArray> raw_assertions) {
-  Local<Object> assertions =
-        Object::New(isolate, v8::Null(env->isolate()), nullptr, nullptr, 0);
-  for (int i = 0; i < raw_assertions->Length(); i += 3) {
-      assertions
-          ->Set(env->context(),
-                raw_assertions->Get(env->context(), i).As<String>(),
-                raw_assertions->Get(env->context(), i + 1).As<Value>())
-          .ToChecked();
-  }
-
-  return assertions;
+static Local<Object> createImportAttributesContainer(
+    Environment* env, Isolate* isolate, Local<FixedArray> raw_attributes) {
+  Local<Object> attributes =
+      Object::New(isolate, v8::Null(env->isolate()), nullptr, nullptr, 0);
+  for (int i = 0; i < raw_attributes->Length(); i += 3) {
+    attributes
+        ->Set(env->context(),
+              raw_attributes->Get(env->context(), i).As<String>(),
+              raw_attributes->Get(env->context(), i + 1).As<Value>())
+        .ToChecked();
+  }
+
+  return attributes;
 }
 
 void ModuleWrap::Link(const FunctionCallbackInfo<Value>& args) {
@@ -297,13 +297,13 @@ void ModuleWrap::Link(const FunctionCallbackInfo<Value>& args) {
     Utf8Value specifier_utf8(env->isolate(), specifier);
     std::string specifier_std(*specifier_utf8, specifier_utf8.length());
 
-    Local<FixedArray> raw_assertions = module_request->GetImportAssertions();
-    Local<Object> assertions =
-      createImportAssertionContainer(env, isolate, raw_assertions);
+    Local<FixedArray> raw_attributes = module_request->GetImportAssertions();
+    Local<Object> attributes =
+        createImportAttributesContainer(env, isolate, raw_attributes);
 
     Local<Value> argv[] = {
         specifier,
-        assertions,
+        attributes,
     };
 
     MaybeLocal<Value> maybe_resolve_return_value =
@@ -499,7 +499,7 @@ void ModuleWrap::GetError(const FunctionCallbackInfo<Value>& args) {
 MaybeLocal<Module> ModuleWrap::ResolveModuleCallback(
     Local<Context> context,
     Local<String> specifier,
-    Local<FixedArray> import_assertions,
+    Local<FixedArray> import_attributes,
     Local<Module> referrer) {
   Environment* env = Environment::GetCurrent(context);
   if (env == nullptr) {
@@ -552,7 +552,7 @@ static MaybeLocal<Promise> ImportModuleDynamically(
     Local<v8::Data> host_defined_options,
     Local<Value> resource_name,
     Local<String> specifier,
-    Local<FixedArray> import_assertions) {
+    Local<FixedArray> import_attributes) {
   Isolate* isolate = context->GetIsolate();
   Environment* env = Environment::GetCurrent(context);
   if (env == nullptr) {
@@ -577,18 +577,16 @@ static MaybeLocal<Promise> ImportModuleDynamically(
     return handle_scope.Escape(resolver->GetPromise());
   }
 
-  Local<Value> object;
-
   Local<Symbol> id =
       options->Get(context, HostDefinedOptions::kID).As<Symbol>();
 
-  Local<Object> assertions =
-    createImportAssertionContainer(env, isolate, import_assertions);
+  Local<Object> attributes =
+      createImportAttributesContainer(env, isolate, import_attributes);
 
   Local<Value> import_args[] = {
       id,
       Local<Value>(specifier),
-      assertions,
+      attributes,
   };
 
   Local<Value> result;
diff --git a/src/module_wrap.h b/src/module_wrap.h
index 6435bad40936fe..1fc801edced9c5 100644
--- a/src/module_wrap.h
+++ b/src/module_wrap.h
@@ -97,7 +97,7 @@ class ModuleWrap : public BaseObject {
   static v8::MaybeLocal<v8::Module> ResolveModuleCallback(
       v8::Local<v8::Context> context,
       v8::Local<v8::String> specifier,
-      v8::Local<v8::FixedArray> import_assertions,
+      v8::Local<v8::FixedArray> import_attributes,
       v8::Local<v8::Module> referrer);
   static ModuleWrap* GetFromModule(node::Environment*, v8::Local<v8::Module>);
 
diff --git a/src/node.cc b/src/node.cc
index 17f3829d743941..a9336a14304fc6 100644
--- a/src/node.cc
+++ b/src/node.cc
@@ -753,6 +753,13 @@ static ExitCode ProcessGlobalArgsInternal(std::vector<std::string>* args,
                 "--no-harmony-import-assertions") == v8_args.end()) {
     v8_args.emplace_back("--harmony-import-assertions");
   }
+  // TODO(aduh95): remove this when the harmony-import-attributes flag
+  // is removed in V8.
+  if (std::find(v8_args.begin(),
+                v8_args.end(),
+                "--no-harmony-import-attributes") == v8_args.end()) {
+    v8_args.emplace_back("--harmony-import-attributes");
+  }
 
   auto env_opts = per_process::cli_options->per_isolate->per_env;
   if (std::find(v8_args.begin(), v8_args.end(),
@@ -838,6 +845,12 @@ static ExitCode InitializeNodeWithArgsInternal(
   V8::SetFlagsFromString(NODE_V8_OPTIONS, sizeof(NODE_V8_OPTIONS) - 1);
 #endif
 
+  if (!!(flags & ProcessInitializationFlags::kGeneratePredictableSnapshot) ||
+      per_process::cli_options->per_isolate->build_snapshot) {
+    v8::V8::SetFlagsFromString("--predictable");
+    v8::V8::SetFlagsFromString("--random_seed=42");
+  }
+
   // Specify this explicitly to avoid being affected by V8 changes to the
   // default value.
   V8::SetFlagsFromString("--rehash-snapshot");
@@ -916,9 +929,14 @@ static ExitCode InitializeNodeWithArgsInternal(
 
     // Initialize ICU.
     // If icu_data_dir is empty here, it will load the 'minimal' data.
-    if (!i18n::InitializeICUDirectory(per_process::cli_options->icu_data_dir)) {
-      errors->push_back("could not initialize ICU "
-                        "(check NODE_ICU_DATA or --icu-data-dir parameters)\n");
+    std::string icu_error;
+    if (!i18n::InitializeICUDirectory(per_process::cli_options->icu_data_dir,
+                                      &icu_error)) {
+      errors->push_back(icu_error +
+                        ": Could not initialize ICU. "
+                        "Check the directory specified by NODE_ICU_DATA or "
+                        "--icu-data-dir contains " U_ICUDATA_NAME ".dat and "
+                        "it's readable\n");
       return ExitCode::kInvalidCommandLineArgument;
     }
     per_process::metadata.versions.InitializeIntlVersions();
diff --git a/src/node.h b/src/node.h
index ca01c42e8af484..f2740116a4710b 100644
--- a/src/node.h
+++ b/src/node.h
@@ -265,6 +265,8 @@ enum Flags : uint32_t {
   // cppgc::InitializeProcess() before creating a Node.js environment
   // and call cppgc::ShutdownProcess() before process shutdown.
   kNoInitializeCppgc = 1 << 13,
+  // Initialize the process for predictable snapshot generation.
+  kGeneratePredictableSnapshot = 1 << 14,
 
   // Emulate the behavior of InitializeNodeWithArgs() when passing
   // a flags argument to the InitializeOncePerProcess() replacement
diff --git a/src/node_api.cc b/src/node_api.cc
index 1f1cfb916a7f1e..23e9fedf8b146e 100644
--- a/src/node_api.cc
+++ b/src/node_api.cc
@@ -82,9 +82,8 @@ void node_napi_env__::trigger_fatal_exception(v8::Local<v8::Value> local_err) {
   node::errors::TriggerUncaughtException(isolate, local_err, local_msg);
 }
 
-// option enforceUncaughtExceptionPolicy is added for not breaking existing
-// running n-api add-ons, and should be deprecated in the next major Node.js
-// release.
+// The option enforceUncaughtExceptionPolicy is added for not breaking existing
+// running Node-API add-ons.
 template <bool enforceUncaughtExceptionPolicy, typename T>
 void node_napi_env__::CallbackIntoModule(T&& call) {
   CallIntoModule(call, [](napi_env env_, v8::Local<v8::Value> local_err) {
@@ -93,19 +92,24 @@ void node_napi_env__::CallbackIntoModule(T&& call) {
       return;
     }
     node::Environment* node_env = env->node_env();
-    if (!node_env->options()->force_node_api_uncaught_exceptions_policy &&
+    // If the module api version is less than NAPI_VERSION_EXPERIMENTAL,
+    // and the option --force-node-api-uncaught-exceptions-policy is not
+    // specified, emit a warning about the uncaught exception instead of
+    // triggering uncaught exception event.
+    if (env->module_api_version < NAPI_VERSION_EXPERIMENTAL &&
+        !node_env->options()->force_node_api_uncaught_exceptions_policy &&
         !enforceUncaughtExceptionPolicy) {
       ProcessEmitDeprecationWarning(
           node_env,
           "Uncaught N-API callback exception detected, please run node "
-          "with option --force-node-api-uncaught-exceptions-policy=true"
+          "with option --force-node-api-uncaught-exceptions-policy=true "
           "to handle those exceptions properly.",
           "DEP0168");
       return;
     }
     // If there was an unhandled exception in the complete callback,
     // report it as a fatal exception. (There is no JavaScript on the
-    // callstack that can possibly handle it.)
+    // call stack that can possibly handle it.)
     env->trigger_fatal_exception(local_err);
   });
 }
@@ -914,6 +918,7 @@ napi_status NAPI_CDECL napi_async_init(napi_env env,
                                        napi_value async_resource_name,
                                        napi_async_context* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, async_resource_name);
   CHECK_ARG(env, result);
 
@@ -947,6 +952,7 @@ napi_status NAPI_CDECL napi_async_init(napi_env env,
 napi_status NAPI_CDECL napi_async_destroy(napi_env env,
                                           napi_async_context async_context) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, async_context);
 
   v8impl::AsyncContext* node_async_context =
@@ -1096,6 +1102,7 @@ napi_status NAPI_CDECL napi_is_buffer(napi_env env,
                                       napi_value value,
                                       bool* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
   CHECK_ARG(env, result);
 
@@ -1108,6 +1115,7 @@ napi_status NAPI_CDECL napi_get_buffer_info(napi_env env,
                                             void** data,
                                             size_t* length) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, value);
 
   v8::Local<v8::Value> buffer = v8impl::V8LocalValueFromJsValue(value);
@@ -1229,6 +1237,7 @@ napi_create_async_work(napi_env env,
                        void* data,
                        napi_async_work* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, execute);
   CHECK_ARG(env, result);
 
@@ -1259,6 +1268,7 @@ napi_create_async_work(napi_env env,
 napi_status NAPI_CDECL napi_delete_async_work(napi_env env,
                                               napi_async_work work) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, work);
 
   uvimpl::Work::Delete(reinterpret_cast<uvimpl::Work*>(work));
@@ -1313,6 +1323,7 @@ napi_create_threadsafe_function(napi_env env,
                                 napi_threadsafe_function_call_js call_js_cb,
                                 napi_threadsafe_function* result) {
   CHECK_ENV(env);
+  env->CheckGCAccess();
   CHECK_ARG(env, async_resource_name);
   RETURN_STATUS_IF_FALSE(env, initial_thread_count > 0, napi_invalid_arg);
   CHECK_ARG(env, result);
diff --git a/src/node_api.h b/src/node_api.h
index 27acc6a0df43be..49a23aed9c6e90 100644
--- a/src/node_api.h
+++ b/src/node_api.h
@@ -1,11 +1,11 @@
 #ifndef SRC_NODE_API_H_
 #define SRC_NODE_API_H_
 
-#ifdef BUILDING_NODE_EXTENSION
+#if defined(BUILDING_NODE_EXTENSION) && !defined(NAPI_EXTERN)
 #ifdef _WIN32
 // Building native addon against node
 #define NAPI_EXTERN __declspec(dllimport)
-#elif defined(__wasm32__)
+#elif defined(__wasm__)
 #define NAPI_EXTERN __attribute__((__import_module__("napi")))
 #endif
 #endif
@@ -17,8 +17,13 @@ struct uv_loop_s;  // Forward declaration.
 #ifdef _WIN32
 #define NAPI_MODULE_EXPORT __declspec(dllexport)
 #else
+#ifdef __EMSCRIPTEN__
+#define NAPI_MODULE_EXPORT                                                     \
+  __attribute__((visibility("default"))) __attribute__((used))
+#else
 #define NAPI_MODULE_EXPORT __attribute__((visibility("default")))
 #endif
+#endif
 
 #if defined(__GNUC__)
 #define NAPI_NO_RETURN __attribute__((noreturn))
@@ -49,7 +54,7 @@ typedef struct napi_module {
   NAPI_MODULE_INITIALIZER_X_HELPER(base, version)
 #define NAPI_MODULE_INITIALIZER_X_HELPER(base, version) base##version
 
-#ifdef __wasm32__
+#ifdef __wasm__
 #define NAPI_MODULE_INITIALIZER_BASE napi_register_wasm_v
 #else
 #define NAPI_MODULE_INITIALIZER_BASE napi_register_module_v
@@ -143,7 +148,6 @@ NAPI_EXTERN napi_status NAPI_CDECL napi_get_buffer_info(napi_env env,
                                                         void** data,
                                                         size_t* length);
 
-#ifndef __wasm32__
 // Methods to manage simple async operations
 NAPI_EXTERN napi_status NAPI_CDECL
 napi_create_async_work(napi_env env,
@@ -159,7 +163,6 @@ NAPI_EXTERN napi_status NAPI_CDECL napi_queue_async_work(napi_env env,
                                                          napi_async_work work);
 NAPI_EXTERN napi_status NAPI_CDECL napi_cancel_async_work(napi_env env,
                                                           napi_async_work work);
-#endif  // __wasm32__
 
 // version management
 NAPI_EXTERN napi_status NAPI_CDECL
@@ -197,7 +200,6 @@ napi_close_callback_scope(napi_env env, napi_callback_scope scope);
 
 #if NAPI_VERSION >= 4
 
-#ifndef __wasm32__
 // Calling into JS from other threads
 NAPI_EXTERN napi_status NAPI_CDECL
 napi_create_threadsafe_function(napi_env env,
@@ -231,7 +233,6 @@ napi_unref_threadsafe_function(napi_env env, napi_threadsafe_function func);
 
 NAPI_EXTERN napi_status NAPI_CDECL
 napi_ref_threadsafe_function(napi_env env, napi_threadsafe_function func);
-#endif  // __wasm32__
 
 #endif  // NAPI_VERSION >= 4
 
diff --git a/src/node_constants.cc b/src/node_constants.cc
index 05582b28dafd9f..149c7c10732291 100644
--- a/src/node_constants.cc
+++ b/src/node_constants.cc
@@ -1058,6 +1058,10 @@ void DefineSystemConstants(Local<Object> target) {
   NODE_DEFINE_CONSTANT(target, UV_DIRENT_CHAR);
   NODE_DEFINE_CONSTANT(target, UV_DIRENT_BLOCK);
 
+  // Define module specific constants
+  NODE_DEFINE_CONSTANT(target, EXTENSIONLESS_FORMAT_JAVASCRIPT);
+  NODE_DEFINE_CONSTANT(target, EXTENSIONLESS_FORMAT_WASM);
+
   NODE_DEFINE_CONSTANT(target, S_IFMT);
   NODE_DEFINE_CONSTANT(target, S_IFREG);
   NODE_DEFINE_CONSTANT(target, S_IFDIR);
diff --git a/src/node_constants.h b/src/node_constants.h
index 08f94bd623aa60..97429c0e5e9462 100644
--- a/src/node_constants.h
+++ b/src/node_constants.h
@@ -27,6 +27,9 @@
 #include "node.h"
 #include "v8.h"
 
+#define EXTENSIONLESS_FORMAT_JAVASCRIPT (0)
+#define EXTENSIONLESS_FORMAT_WASM (1)
+
 #if HAVE_OPENSSL
 
 #ifndef RSA_PSS_SALTLEN_DIGEST
diff --git a/src/node_contextify.cc b/src/node_contextify.cc
index b64faf812c6c47..4c7988eaed7c9e 100644
--- a/src/node_contextify.cc
+++ b/src/node_contextify.cc
@@ -771,10 +771,12 @@ void ContextifyScript::New(const FunctionCallbackInfo<Value>& args) {
   bool produce_cached_data = false;
   Local<Context> parsing_context = context;
 
+  Local<Symbol> id_symbol;
   if (argc > 2) {
     // new ContextifyScript(code, filename, lineOffset, columnOffset,
-    //                      cachedData, produceCachedData, parsingContext)
-    CHECK_EQ(argc, 7);
+    //                      cachedData, produceCachedData, parsingContext,
+    //                      hostDefinedOptionId)
+    CHECK_EQ(argc, 8);
     CHECK(args[2]->IsNumber());
     line_offset = args[2].As<Int32>()->Value();
     CHECK(args[3]->IsNumber());
@@ -793,6 +795,8 @@ void ContextifyScript::New(const FunctionCallbackInfo<Value>& args) {
       CHECK_NOT_NULL(sandbox);
       parsing_context = sandbox->context();
     }
+    CHECK(args[7]->IsSymbol());
+    id_symbol = args[7].As<Symbol>();
   }
 
   ContextifyScript* contextify_script =
@@ -816,7 +820,6 @@ void ContextifyScript::New(const FunctionCallbackInfo<Value>& args) {
 
   Local<PrimitiveArray> host_defined_options =
       PrimitiveArray::New(isolate, loader::HostDefinedOptions::kLength);
-  Local<Symbol> id_symbol = Symbol::New(isolate, filename);
   host_defined_options->Set(
       isolate, loader::HostDefinedOptions::kID, id_symbol);
 
@@ -1189,6 +1192,10 @@ void ContextifyContext::CompileFunction(
     params_buf = args[8].As<Array>();
   }
 
+  // Argument 10: host-defined option symbol
+  CHECK(args[9]->IsSymbol());
+  Local<Symbol> id_symbol = args[9].As<Symbol>();
+
   // Read cache from cached data buffer
   ScriptCompiler::CachedData* cached_data = nullptr;
   if (!cached_data_buf.IsEmpty()) {
@@ -1200,7 +1207,6 @@ void ContextifyContext::CompileFunction(
   // Set host_defined_options
   Local<PrimitiveArray> host_defined_options =
       PrimitiveArray::New(isolate, loader::HostDefinedOptions::kLength);
-  Local<Symbol> id_symbol = Symbol::New(isolate, filename);
   host_defined_options->Set(
       isolate, loader::HostDefinedOptions::kID, id_symbol);
 
diff --git a/src/node_credentials.cc b/src/node_credentials.cc
index c1f7a4f2acbdf6..8a832b0e3efb3a 100644
--- a/src/node_credentials.cc
+++ b/src/node_credentials.cc
@@ -116,7 +116,7 @@ bool SafeGetenv(const char* key,
       ret = uv_os_getenv(key, *val, &init_sz);
     }
 
-    if (ret >= 0) {  // Env key value fetch success.
+    if (ret == 0) {  // Env key value fetch success.
       *text = *val;
       return true;
     }
diff --git a/src/node_dir.cc b/src/node_dir.cc
index 8f93f189cfbe27..10cde6067899c7 100644
--- a/src/node_dir.cc
+++ b/src/node_dir.cc
@@ -397,6 +397,32 @@ static void OpenDir(const FunctionCallbackInfo<Value>& args) {
   }
 }
 
+static void OpenDirSync(const FunctionCallbackInfo<Value>& args) {
+  Environment* env = Environment::GetCurrent(args);
+  Isolate* isolate = env->isolate();
+
+  CHECK_GE(args.Length(), 1);
+
+  BufferValue path(isolate, args[0]);
+  CHECK_NOT_NULL(*path);
+  THROW_IF_INSUFFICIENT_PERMISSIONS(
+      env, permission::PermissionScope::kFileSystemRead, path.ToStringView());
+
+  uv_fs_t req;
+  auto make = OnScopeLeave([&req]() { uv_fs_req_cleanup(&req); });
+  FS_DIR_SYNC_TRACE_BEGIN(opendir);
+  int err = uv_fs_opendir(nullptr, &req, *path, nullptr);
+  FS_DIR_SYNC_TRACE_END(opendir);
+  if (err < 0) {
+    return env->ThrowUVException(err, "opendir");
+  }
+
+  uv_dir_t* dir = static_cast<uv_dir_t*>(req.ptr);
+  DirHandle* handle = DirHandle::New(env, dir);
+
+  args.GetReturnValue().Set(handle->object().As<Value>());
+}
+
 void Initialize(Local<Object> target,
                 Local<Value> unused,
                 Local<Context> context,
@@ -405,6 +431,7 @@ void Initialize(Local<Object> target,
   Isolate* isolate = env->isolate();
 
   SetMethod(context, target, "opendir", OpenDir);
+  SetMethod(context, target, "opendirSync", OpenDirSync);
 
   // Create FunctionTemplate for DirHandle
   Local<FunctionTemplate> dir = NewFunctionTemplate(isolate, DirHandle::New);
@@ -419,6 +446,7 @@ void Initialize(Local<Object> target,
 
 void RegisterExternalReferences(ExternalReferenceRegistry* registry) {
   registry->Register(OpenDir);
+  registry->Register(OpenDirSync);
   registry->Register(DirHandle::New);
   registry->Register(DirHandle::Read);
   registry->Register(DirHandle::Close);
diff --git a/src/node_errors.h b/src/node_errors.h
index 569dafe82df83d..0f4a2d0cc6eaaf 100644
--- a/src/node_errors.h
+++ b/src/node_errors.h
@@ -75,13 +75,11 @@ void AppendExceptionLine(Environment* env,
   V(ERR_INVALID_MODULE, Error)                                                 \
   V(ERR_INVALID_STATE, Error)                                                  \
   V(ERR_INVALID_THIS, TypeError)                                               \
-  V(ERR_INVALID_TRANSFER_OBJECT, TypeError)                                    \
   V(ERR_INVALID_URL, TypeError)                                                \
   V(ERR_INVALID_URL_SCHEME, TypeError)                                         \
   V(ERR_MEMORY_ALLOCATION_FAILED, Error)                                       \
   V(ERR_MESSAGE_TARGET_CONTEXT_UNAVAILABLE, Error)                             \
   V(ERR_MISSING_ARGS, TypeError)                                               \
-  V(ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST, TypeError)                      \
   V(ERR_MISSING_PASSPHRASE, TypeError)                                         \
   V(ERR_MISSING_PLATFORM_FOR_WORKER, Error)                                    \
   V(ERR_MODULE_NOT_FOUND, Error)                                               \
@@ -168,16 +166,12 @@ ERRORS_WITH_CODE(V)
   V(ERR_INVALID_MODULE, "No such module")                                      \
   V(ERR_INVALID_STATE, "Invalid state")                                        \
   V(ERR_INVALID_THIS, "Value of \"this\" is the wrong type")                   \
-  V(ERR_INVALID_TRANSFER_OBJECT, "Found invalid object in transferList")       \
   V(ERR_INVALID_URL_SCHEME, "The URL must be of scheme file:")                 \
   V(ERR_MEMORY_ALLOCATION_FAILED, "Failed to allocate memory")                 \
   V(ERR_OSSL_EVP_INVALID_DIGEST, "Invalid digest used")                        \
   V(ERR_MESSAGE_TARGET_CONTEXT_UNAVAILABLE,                                    \
     "A message object could not be deserialized successfully in the target "   \
     "vm.Context")                                                              \
-  V(ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST,                                 \
-    "Object that needs transfer was found in message but not listed "          \
-    "in transferList")                                                         \
   V(ERR_MISSING_PLATFORM_FOR_WORKER,                                           \
     "The V8 platform used by this instance of Node does not support "          \
     "creating Workers")                                                        \
diff --git a/src/node_file-inl.h b/src/node_file-inl.h
index cdf21a4b3a6c22..6c059add3bfc02 100644
--- a/src/node_file-inl.h
+++ b/src/node_file-inl.h
@@ -349,6 +349,38 @@ int SyncCall(Environment* env, v8::Local<v8::Value> ctx,
   return err;
 }
 
+// Similar to SyncCall but throws immediately if there is an error.
+template <typename Predicate, typename Func, typename... Args>
+int SyncCallAndThrowIf(Predicate should_throw,
+                       Environment* env,
+                       FSReqWrapSync* req_wrap,
+                       Func fn,
+                       Args... args) {
+  env->PrintSyncTrace();
+  int result = fn(nullptr, &(req_wrap->req), args..., nullptr);
+  if (should_throw(result)) {
+    env->ThrowUVException(result,
+                          req_wrap->syscall_p,
+                          nullptr,
+                          req_wrap->path_p,
+                          req_wrap->dest_p);
+  }
+  return result;
+}
+
+constexpr bool is_uv_error(int result) {
+  return result < 0;
+}
+
+// Similar to SyncCall but throws immediately if there is an error.
+template <typename Func, typename... Args>
+int SyncCallAndThrowOnError(Environment* env,
+                            FSReqWrapSync* req_wrap,
+                            Func fn,
+                            Args... args) {
+  return SyncCallAndThrowIf(is_uv_error, env, req_wrap, fn, args...);
+}
+
 }  // namespace fs
 }  // namespace node
 
diff --git a/src/node_file.cc b/src/node_file.cc
index ee97188d266ed2..afaa028784e710 100644
--- a/src/node_file.cc
+++ b/src/node_file.cc
@@ -981,46 +981,74 @@ void Access(const FunctionCallbackInfo<Value>& args) {
   THROW_IF_INSUFFICIENT_PERMISSIONS(
       env, permission::PermissionScope::kFileSystemRead, path.ToStringView());
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 2);
-  if (req_wrap_async != nullptr) {  // access(path, mode, req)
+  if (argc > 2) {  // access(path, mode, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 2);
+    CHECK_NOT_NULL(req_wrap_async);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_ACCESS, req_wrap_async, "path", TRACE_STR_COPY(*path))
     AsyncCall(env, req_wrap_async, args, "access", UTF8, AfterNoArgs,
               uv_fs_access, *path, mode);
-  } else {  // access(path, mode, undefined, ctx)
-    CHECK_EQ(argc, 4);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // access(path, mode)
+    FSReqWrapSync req_wrap_sync("access", *path);
     FS_SYNC_TRACE_BEGIN(access);
-    SyncCall(env, args[3], &req_wrap_sync, "access", uv_fs_access, *path, mode);
+    SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_access, *path, mode);
     FS_SYNC_TRACE_END(access);
   }
 }
 
-
 void Close(const FunctionCallbackInfo<Value>& args) {
   Environment* env = Environment::GetCurrent(args);
 
   const int argc = args.Length();
-  CHECK_GE(argc, 2);
+  CHECK_GE(argc, 1);
 
   CHECK(args[0]->IsInt32());
   int fd = args[0].As<Int32>()->Value();
   env->RemoveUnmanagedFd(fd);
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 1);
-  if (req_wrap_async != nullptr) {  // close(fd, req)
+  if (argc > 1) {  // close(fd, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 1);
+    CHECK_NOT_NULL(req_wrap_async);
     FS_ASYNC_TRACE_BEGIN0(UV_FS_CLOSE, req_wrap_async)
     AsyncCall(env, req_wrap_async, args, "close", UTF8, AfterNoArgs,
               uv_fs_close, fd);
-  } else {  // close(fd, undefined, ctx)
-    CHECK_EQ(argc, 3);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // close(fd)
+    FSReqWrapSync req_wrap_sync("close");
     FS_SYNC_TRACE_BEGIN(close);
-    SyncCall(env, args[2], &req_wrap_sync, "close", uv_fs_close, fd);
+    SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_close, fd);
     FS_SYNC_TRACE_END(close);
   }
 }
 
+static void ExistsSync(const FunctionCallbackInfo<Value>& args) {
+  Environment* env = Environment::GetCurrent(args);
+  Isolate* isolate = env->isolate();
+  CHECK_GE(args.Length(), 1);
+
+  BufferValue path(isolate, args[0]);
+  CHECK_NOT_NULL(*path);
+  THROW_IF_INSUFFICIENT_PERMISSIONS(
+      env, permission::PermissionScope::kFileSystemRead, path.ToStringView());
+
+  uv_fs_t req;
+  auto make = OnScopeLeave([&req]() { uv_fs_req_cleanup(&req); });
+  FS_SYNC_TRACE_BEGIN(access);
+  int err = uv_fs_access(nullptr, &req, path.out(), 0, nullptr);
+  FS_SYNC_TRACE_END(access);
+
+#ifdef _WIN32
+  // In case of an invalid symlink, `uv_fs_access` on win32
+  // will **not** return an error and is therefore not enough.
+  // Double check with `uv_fs_stat()`.
+  if (err == 0) {
+    FS_SYNC_TRACE_BEGIN(stat);
+    err = uv_fs_stat(nullptr, &req, path.out(), nullptr);
+    FS_SYNC_TRACE_END(stat);
+  }
+#endif  // _WIN32
+
+  args.GetReturnValue().Set(err == 0);
+}
 
 // Used to speed up module loading. Returns an array [string, boolean]
 static void InternalModuleReadJSON(const FunctionCallbackInfo<Value>& args) {
@@ -1106,13 +1134,17 @@ static void InternalModuleStat(const FunctionCallbackInfo<Value>& args) {
   args.GetReturnValue().Set(rc);
 }
 
+constexpr bool is_uv_error_except_no_entry(int result) {
+  return result < 0 && result != UV_ENOENT;
+}
+
 static void Stat(const FunctionCallbackInfo<Value>& args) {
   Realm* realm = Realm::GetCurrent(args);
   BindingData* binding_data = realm->GetBindingData<BindingData>();
   Environment* env = realm->env();
 
   const int argc = args.Length();
-  CHECK_GE(argc, 2);
+  CHECK_GE(argc, 3);
 
   BufferValue path(realm->isolate(), args[0]);
   CHECK_NOT_NULL(*path);
@@ -1120,22 +1152,28 @@ static void Stat(const FunctionCallbackInfo<Value>& args) {
       env, permission::PermissionScope::kFileSystemRead, path.ToStringView());
 
   bool use_bigint = args[1]->IsTrue();
-  FSReqBase* req_wrap_async = GetReqWrap(args, 2, use_bigint);
-  if (req_wrap_async != nullptr) {  // stat(path, use_bigint, req)
+  if (!args[2]->IsUndefined()) {  // stat(path, use_bigint, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 2, use_bigint);
+    CHECK_NOT_NULL(req_wrap_async);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_STAT, req_wrap_async, "path", TRACE_STR_COPY(*path))
     AsyncCall(env, req_wrap_async, args, "stat", UTF8, AfterStat,
               uv_fs_stat, *path);
-  } else {  // stat(path, use_bigint, undefined, ctx)
-    CHECK_EQ(argc, 4);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // stat(path, use_bigint, undefined, do_not_throw_if_no_entry)
+    bool do_not_throw_if_no_entry = args[3]->IsFalse();
+    FSReqWrapSync req_wrap_sync("stat", *path);
     FS_SYNC_TRACE_BEGIN(stat);
-    int err = SyncCall(env, args[3], &req_wrap_sync, "stat", uv_fs_stat, *path);
+    int result;
+    if (do_not_throw_if_no_entry) {
+      result = SyncCallAndThrowIf(
+          is_uv_error_except_no_entry, env, &req_wrap_sync, uv_fs_stat, *path);
+    } else {
+      result = SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_stat, *path);
+    }
     FS_SYNC_TRACE_END(stat);
-    if (err != 0) {
-      return;  // error info is in ctx
+    if (is_uv_error(result)) {
+      return;
     }
-
     Local<Value> arr = FillGlobalStatsArray(binding_data, use_bigint,
         static_cast<const uv_stat_t*>(req_wrap_sync.req.ptr));
     args.GetReturnValue().Set(arr);
@@ -1224,8 +1262,9 @@ static void StatFs(const FunctionCallbackInfo<Value>& args) {
       env, permission::PermissionScope::kFileSystemRead, path.ToStringView());
 
   bool use_bigint = args[1]->IsTrue();
-  FSReqBase* req_wrap_async = GetReqWrap(args, 2, use_bigint);
-  if (req_wrap_async != nullptr) {  // statfs(path, use_bigint, req)
+  if (argc > 2) {  // statfs(path, use_bigint, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 2, use_bigint);
+    CHECK_NOT_NULL(req_wrap_async);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_STATFS, req_wrap_async, "path", TRACE_STR_COPY(*path))
     AsyncCall(env,
@@ -1236,15 +1275,14 @@ static void StatFs(const FunctionCallbackInfo<Value>& args) {
               AfterStatFs,
               uv_fs_statfs,
               *path);
-  } else {  // statfs(path, use_bigint, undefined, ctx)
-    CHECK_EQ(argc, 4);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // statfs(path, use_bigint)
+    FSReqWrapSync req_wrap_sync("statfs", *path);
     FS_SYNC_TRACE_BEGIN(statfs);
-    int err =
-        SyncCall(env, args[3], &req_wrap_sync, "statfs", uv_fs_statfs, *path);
+    int result =
+        SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_statfs, *path);
     FS_SYNC_TRACE_END(statfs);
-    if (err != 0) {
-      return;  // error info is in ctx
+    if (is_uv_error(result)) {
+      return;
     }
 
     Local<Value> arr = FillGlobalStatFsArray(
@@ -1436,7 +1474,7 @@ static void FTruncate(const FunctionCallbackInfo<Value>& args) {
   Environment* env = Environment::GetCurrent(args);
 
   const int argc = args.Length();
-  CHECK_GE(argc, 3);
+  CHECK_GE(argc, 2);
 
   CHECK(args[0]->IsInt32());
   const int fd = args[0].As<Int32>()->Value();
@@ -1444,17 +1482,15 @@ static void FTruncate(const FunctionCallbackInfo<Value>& args) {
   CHECK(IsSafeJsInt(args[1]));
   const int64_t len = args[1].As<Integer>()->Value();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 2);
-  if (req_wrap_async != nullptr) {
+  if (argc > 2) {
+    FSReqBase* req_wrap_async = GetReqWrap(args, 2);
     FS_ASYNC_TRACE_BEGIN0(UV_FS_FTRUNCATE, req_wrap_async)
     AsyncCall(env, req_wrap_async, args, "ftruncate", UTF8, AfterNoArgs,
               uv_fs_ftruncate, fd, len);
   } else {
-    CHECK_EQ(argc, 4);
-    FSReqWrapSync req_wrap_sync;
+    FSReqWrapSync req_wrap_sync("ftruncate");
     FS_SYNC_TRACE_BEGIN(ftruncate);
-    SyncCall(env, args[3], &req_wrap_sync, "ftruncate", uv_fs_ftruncate, fd,
-             len);
+    SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_ftruncate, fd, len);
     FS_SYNC_TRACE_END(ftruncate);
   }
 }
@@ -1463,21 +1499,21 @@ static void Fdatasync(const FunctionCallbackInfo<Value>& args) {
   Environment* env = Environment::GetCurrent(args);
 
   const int argc = args.Length();
-  CHECK_GE(argc, 2);
+  CHECK_GE(argc, 1);
 
   CHECK(args[0]->IsInt32());
   const int fd = args[0].As<Int32>()->Value();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 1);
-  if (req_wrap_async != nullptr) {
+  if (argc > 1) {  // fdatasync(fd, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 1);
+    CHECK_NOT_NULL(req_wrap_async);
     FS_ASYNC_TRACE_BEGIN0(UV_FS_FDATASYNC, req_wrap_async)
     AsyncCall(env, req_wrap_async, args, "fdatasync", UTF8, AfterNoArgs,
               uv_fs_fdatasync, fd);
-  } else {
-    CHECK_EQ(argc, 3);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // fdatasync(fd)
+    FSReqWrapSync req_wrap_sync("fdatasync");
     FS_SYNC_TRACE_BEGIN(fdatasync);
-    SyncCall(env, args[2], &req_wrap_sync, "fdatasync", uv_fs_fdatasync, fd);
+    SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_fdatasync, fd);
     FS_SYNC_TRACE_END(fdatasync);
   }
 }
@@ -1509,24 +1545,24 @@ static void Unlink(const FunctionCallbackInfo<Value>& args) {
   Environment* env = Environment::GetCurrent(args);
 
   const int argc = args.Length();
-  CHECK_GE(argc, 2);
+  CHECK_GE(argc, 1);
 
   BufferValue path(env->isolate(), args[0]);
   CHECK_NOT_NULL(*path);
   THROW_IF_INSUFFICIENT_PERMISSIONS(
       env, permission::PermissionScope::kFileSystemWrite, path.ToStringView());
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 1);
-  if (req_wrap_async != nullptr) {
+  if (argc > 1) {  // unlink(path, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 1);
+    CHECK_NOT_NULL(req_wrap_async);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_UNLINK, req_wrap_async, "path", TRACE_STR_COPY(*path))
     AsyncCall(env, req_wrap_async, args, "unlink", UTF8, AfterNoArgs,
               uv_fs_unlink, *path);
-  } else {
-    CHECK_EQ(argc, 3);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // unlink(path)
+    FSReqWrapSync req_wrap_sync("unlink", *path);
     FS_SYNC_TRACE_BEGIN(unlink);
-    SyncCall(env, args[2], &req_wrap_sync, "unlink", uv_fs_unlink, *path);
+    SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_unlink, *path);
     FS_SYNC_TRACE_END(unlink);
   }
 }
@@ -1855,8 +1891,8 @@ static void ReadDir(const FunctionCallbackInfo<Value>& args) {
 
   bool with_types = args[2]->IsTrue();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 3);
-  if (req_wrap_async != nullptr) {  // readdir(path, encoding, withTypes, req)
+  if (argc > 3) {  // readdir(path, encoding, withTypes, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 3);
     req_wrap_async->set_with_file_types(with_types);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_SCANDIR, req_wrap_async, "path", TRACE_STR_COPY(*path))
@@ -1869,18 +1905,16 @@ static void ReadDir(const FunctionCallbackInfo<Value>& args) {
               uv_fs_scandir,
               *path,
               0 /*flags*/);
-  } else {  // readdir(path, encoding, withTypes, undefined, ctx)
-    CHECK_EQ(argc, 5);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // readdir(path, encoding, withTypes)
+    FSReqWrapSync req_wrap_sync("scandir", *path);
     FS_SYNC_TRACE_BEGIN(readdir);
-    int err = SyncCall(env, args[4], &req_wrap_sync, "scandir",
-                       uv_fs_scandir, *path, 0 /*flags*/);
+    int err = SyncCallAndThrowOnError(
+        env, &req_wrap_sync, uv_fs_scandir, *path, 0 /*flags*/);
     FS_SYNC_TRACE_END(readdir);
-    if (err < 0) {
-      return;  // syscall failed, no need to continue, error info is in ctx
+    if (is_uv_error(err)) {
+      return;
     }
 
-    CHECK_GE(req_wrap_sync.req.result, 0);
     int r;
     std::vector<Local<Value>> name_v;
     std::vector<Local<Value>> type_v;
@@ -1891,12 +1925,8 @@ static void ReadDir(const FunctionCallbackInfo<Value>& args) {
       r = uv_fs_scandir_next(&(req_wrap_sync.req), &ent);
       if (r == UV_EOF)
         break;
-      if (r != 0) {
-        Local<Object> ctx = args[4].As<Object>();
-        ctx->Set(env->context(), env->errno_string(),
-                 Integer::New(isolate, r)).Check();
-        ctx->Set(env->context(), env->syscall_string(),
-                 OneByteString(isolate, "readdir")).Check();
+      if (is_uv_error(r)) {
+        env->ThrowUVException(r, "scandir", nullptr, *path);
         return;
       }
 
@@ -1907,8 +1937,7 @@ static void ReadDir(const FunctionCallbackInfo<Value>& args) {
                                                        &error);
 
       if (filename.IsEmpty()) {
-        Local<Object> ctx = args[4].As<Object>();
-        ctx->Set(env->context(), env->error_string(), error).Check();
+        isolate->ThrowException(error);
         return;
       }
 
@@ -1945,7 +1974,6 @@ static inline Maybe<void> CheckOpenPermissions(Environment* env,
   const int write_as_side_effect = flags & (UV_FS_O_APPEND | UV_FS_O_CREAT |
                                             UV_FS_O_TRUNC | UV_FS_O_TEMPORARY);
 
-  // TODO(rafaelgss): it can be optimized to avoid two permission checks
   auto pathView = path.ToStringView();
   if (rwflags != UV_FS_O_WRONLY) {
     THROW_IF_INSUFFICIENT_PERMISSIONS(
@@ -1964,74 +1992,6 @@ static inline Maybe<void> CheckOpenPermissions(Environment* env,
   return JustVoid();
 }
 
-static void ReadFileSync(const FunctionCallbackInfo<Value>& args) {
-  Environment* env = Environment::GetCurrent(args);
-  auto isolate = env->isolate();
-
-  CHECK_GE(args.Length(), 2);
-
-  BufferValue path(env->isolate(), args[0]);
-  CHECK_NOT_NULL(*path);
-
-  CHECK(args[1]->IsInt32());
-  const int flags = args[1].As<Int32>()->Value();
-
-  if (CheckOpenPermissions(env, path, flags).IsNothing()) return;
-
-  uv_fs_t req;
-  auto defer_req_cleanup = OnScopeLeave([&req]() { uv_fs_req_cleanup(&req); });
-
-  FS_SYNC_TRACE_BEGIN(open);
-  uv_file file = uv_fs_open(nullptr, &req, *path, flags, 438, nullptr);
-  FS_SYNC_TRACE_END(open);
-  if (req.result < 0) {
-    // req will be cleaned up by scope leave.
-    Local<Value> out[] = {
-        Integer::New(isolate, req.result),       // errno
-        FIXED_ONE_BYTE_STRING(isolate, "open"),  // syscall
-    };
-    return args.GetReturnValue().Set(Array::New(isolate, out, arraysize(out)));
-  }
-  uv_fs_req_cleanup(&req);
-
-  auto defer_close = OnScopeLeave([file]() {
-    uv_fs_t close_req;
-    CHECK_EQ(0, uv_fs_close(nullptr, &close_req, file, nullptr));
-    uv_fs_req_cleanup(&close_req);
-  });
-
-  std::string result{};
-  char buffer[8192];
-  uv_buf_t buf = uv_buf_init(buffer, sizeof(buffer));
-
-  FS_SYNC_TRACE_BEGIN(read);
-  while (true) {
-    auto r = uv_fs_read(nullptr, &req, file, &buf, 1, -1, nullptr);
-    if (req.result < 0) {
-      FS_SYNC_TRACE_END(read);
-      // req will be cleaned up by scope leave.
-      Local<Value> out[] = {
-          Integer::New(isolate, req.result),       // errno
-          FIXED_ONE_BYTE_STRING(isolate, "read"),  // syscall
-      };
-      return args.GetReturnValue().Set(
-          Array::New(isolate, out, arraysize(out)));
-    }
-    uv_fs_req_cleanup(&req);
-    if (r <= 0) {
-      break;
-    }
-    result.append(buf.base, r);
-  }
-  FS_SYNC_TRACE_END(read);
-
-  args.GetReturnValue().Set(String::NewFromUtf8(env->isolate(),
-                                                result.data(),
-                                                v8::NewStringType::kNormal,
-                                                result.size())
-                                .ToLocalChecked());
-}
-
 static void Open(const FunctionCallbackInfo<Value>& args) {
   Environment* env = Environment::GetCurrent(args);
 
@@ -2049,21 +2009,22 @@ static void Open(const FunctionCallbackInfo<Value>& args) {
 
   if (CheckOpenPermissions(env, path, flags).IsNothing()) return;
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 3);
-  if (req_wrap_async != nullptr) {  // open(path, flags, mode, req)
+  if (argc > 3) {  // open(path, flags, mode, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 3);
+    CHECK_NOT_NULL(req_wrap_async);
     req_wrap_async->set_is_plain_open(true);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_OPEN, req_wrap_async, "path", TRACE_STR_COPY(*path))
     AsyncCall(env, req_wrap_async, args, "open", UTF8, AfterInteger,
               uv_fs_open, *path, flags, mode);
-  } else {  // open(path, flags, mode, undefined, ctx)
-    CHECK_EQ(argc, 5);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // open(path, flags, mode)
+    FSReqWrapSync req_wrap_sync("open", *path);
     FS_SYNC_TRACE_BEGIN(open);
-    int result = SyncCall(env, args[4], &req_wrap_sync, "open",
-                          uv_fs_open, *path, flags, mode);
+    int result = SyncCallAndThrowOnError(
+        env, &req_wrap_sync, uv_fs_open, *path, flags, mode);
     FS_SYNC_TRACE_END(open);
-    if (result >= 0) env->AddUnmanagedFd(result);
+    if (is_uv_error(result)) return;
+    env->AddUnmanagedFd(result);
     args.GetReturnValue().Set(result);
   }
 }
@@ -2129,8 +2090,8 @@ static void CopyFile(const FunctionCallbackInfo<Value>& args) {
   CHECK(args[2]->IsInt32());
   const int flags = args[2].As<Int32>()->Value();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 3);
-  if (req_wrap_async != nullptr) {  // copyFile(src, dest, flags, req)
+  if (argc > 3) {  // copyFile(src, dest, flags, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 3);
     FS_ASYNC_TRACE_BEGIN2(UV_FS_COPYFILE,
                           req_wrap_async,
                           "src",
@@ -2140,17 +2101,15 @@ static void CopyFile(const FunctionCallbackInfo<Value>& args) {
     AsyncDestCall(env, req_wrap_async, args, "copyfile",
                   *dest, dest.length(), UTF8, AfterNoArgs,
                   uv_fs_copyfile, *src, *dest, flags);
-  } else {  // copyFile(src, dest, flags, undefined, ctx)
-    CHECK_EQ(argc, 5);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // copyFile(src, dest, flags)
+    FSReqWrapSync req_wrap_sync("copyfile", *src, *dest);
     FS_SYNC_TRACE_BEGIN(copyfile);
-    SyncCall(env, args[4], &req_wrap_sync, "copyfile",
-             uv_fs_copyfile, *src, *dest, flags);
+    SyncCallAndThrowOnError(
+        env, &req_wrap_sync, uv_fs_copyfile, *src, *dest, flags);
     FS_SYNC_TRACE_END(copyfile);
   }
 }
 
-
 // Wrapper for write(2).
 //
 // bytesWritten = write(fd, buffer, offset, length, position, callback)
@@ -2237,18 +2196,29 @@ static void WriteBuffers(const FunctionCallbackInfo<Value>& args) {
     iovs[i] = uv_buf_init(Buffer::Data(chunk), Buffer::Length(chunk));
   }
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 3);
-  if (req_wrap_async != nullptr) {  // writeBuffers(fd, chunks, pos, req)
+  if (argc > 3) {  // writeBuffers(fd, chunks, pos, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 3);
     FS_ASYNC_TRACE_BEGIN0(UV_FS_WRITE, req_wrap_async)
-    AsyncCall(env, req_wrap_async, args, "write", UTF8, AfterInteger,
-              uv_fs_write, fd, *iovs, iovs.length(), pos);
-  } else {  // writeBuffers(fd, chunks, pos, undefined, ctx)
-    CHECK_EQ(argc, 5);
-    FSReqWrapSync req_wrap_sync;
+    AsyncCall(env,
+              req_wrap_async,
+              args,
+              "write",
+              UTF8,
+              AfterInteger,
+              uv_fs_write,
+              fd,
+              *iovs,
+              iovs.length(),
+              pos);
+  } else {  // writeBuffers(fd, chunks, pos)
+    FSReqWrapSync req_wrap_sync("write");
     FS_SYNC_TRACE_BEGIN(write);
-    int bytesWritten = SyncCall(env, args[4], &req_wrap_sync, "write",
-                                uv_fs_write, fd, *iovs, iovs.length(), pos);
+    int bytesWritten = SyncCallAndThrowOnError(
+        env, &req_wrap_sync, uv_fs_write, fd, *iovs, iovs.length(), pos);
     FS_SYNC_TRACE_END(write, "bytesWritten", bytesWritten);
+    if (is_uv_error(bytesWritten)) {
+      return;
+    }
     args.GetReturnValue().Set(bytesWritten);
   }
 }
@@ -2412,6 +2382,69 @@ static void Read(const FunctionCallbackInfo<Value>& args) {
   }
 }
 
+static void ReadFileUtf8(const FunctionCallbackInfo<Value>& args) {
+  Environment* env = Environment::GetCurrent(args);
+  auto isolate = env->isolate();
+
+  CHECK_GE(args.Length(), 2);
+
+  CHECK(args[1]->IsInt32());
+  const int flags = args[1].As<Int32>()->Value();
+
+  uv_file file;
+  uv_fs_t req;
+
+  bool is_fd = args[0]->IsInt32();
+
+  // Check for file descriptor
+  if (is_fd) {
+    file = args[0].As<Int32>()->Value();
+  } else {
+    BufferValue path(env->isolate(), args[0]);
+    CHECK_NOT_NULL(*path);
+    if (CheckOpenPermissions(env, path, flags).IsNothing()) return;
+
+    FS_SYNC_TRACE_BEGIN(open);
+    file = uv_fs_open(nullptr, &req, *path, flags, O_RDONLY, nullptr);
+    FS_SYNC_TRACE_END(open);
+    if (req.result < 0) {
+      uv_fs_req_cleanup(&req);
+      // req will be cleaned up by scope leave.
+      return env->ThrowUVException(req.result, "open", nullptr, path.out());
+    }
+  }
+
+  auto defer_close = OnScopeLeave([file, is_fd, &req]() {
+    if (!is_fd) {
+      FS_SYNC_TRACE_BEGIN(close);
+      CHECK_EQ(0, uv_fs_close(nullptr, &req, file, nullptr));
+      FS_SYNC_TRACE_END(close);
+    }
+    uv_fs_req_cleanup(&req);
+  });
+
+  std::string result{};
+  char buffer[8192];
+  uv_buf_t buf = uv_buf_init(buffer, sizeof(buffer));
+
+  FS_SYNC_TRACE_BEGIN(read);
+  while (true) {
+    auto r = uv_fs_read(nullptr, &req, file, &buf, 1, -1, nullptr);
+    if (req.result < 0) {
+      FS_SYNC_TRACE_END(read);
+      // req will be cleaned up by scope leave.
+      return env->ThrowUVException(req.result, "read", nullptr);
+    }
+    if (r <= 0) {
+      break;
+    }
+    result.append(buf.base, r);
+  }
+  FS_SYNC_TRACE_END(read);
+
+  args.GetReturnValue().Set(
+      ToV8Value(env->context(), result, isolate).ToLocalChecked());
+}
 
 // Wrapper for readv(2).
 //
@@ -2477,18 +2510,16 @@ static void Chmod(const FunctionCallbackInfo<Value>& args) {
   CHECK(args[1]->IsInt32());
   int mode = args[1].As<Int32>()->Value();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 2);
-  if (req_wrap_async != nullptr) {  // chmod(path, mode, req)
+  if (argc > 2) {  // chmod(path, mode, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 2);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_CHMOD, req_wrap_async, "path", TRACE_STR_COPY(*path))
     AsyncCall(env, req_wrap_async, args, "chmod", UTF8, AfterNoArgs,
               uv_fs_chmod, *path, mode);
-  } else {  // chmod(path, mode, undefined, ctx)
-    CHECK_EQ(argc, 4);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // chmod(path, mode)
+    FSReqWrapSync req_wrap_sync("chmod", *path);
     FS_SYNC_TRACE_BEGIN(chmod);
-    SyncCall(env, args[3], &req_wrap_sync, "chmod",
-             uv_fs_chmod, *path, mode);
+    SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_chmod, *path, mode);
     FS_SYNC_TRACE_END(chmod);
   }
 }
@@ -2509,22 +2540,19 @@ static void FChmod(const FunctionCallbackInfo<Value>& args) {
   CHECK(args[1]->IsInt32());
   const int mode = args[1].As<Int32>()->Value();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 2);
-  if (req_wrap_async != nullptr) {  // fchmod(fd, mode, req)
+  if (argc > 2) {  // fchmod(fd, mode, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 2);
     FS_ASYNC_TRACE_BEGIN0(UV_FS_FCHMOD, req_wrap_async)
     AsyncCall(env, req_wrap_async, args, "fchmod", UTF8, AfterNoArgs,
               uv_fs_fchmod, fd, mode);
-  } else {  // fchmod(fd, mode, undefined, ctx)
-    CHECK_EQ(argc, 4);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // fchmod(fd, mode)
+    FSReqWrapSync req_wrap_sync("fchmod");
     FS_SYNC_TRACE_BEGIN(fchmod);
-    SyncCall(env, args[3], &req_wrap_sync, "fchmod",
-             uv_fs_fchmod, fd, mode);
+    SyncCallAndThrowOnError(env, &req_wrap_sync, uv_fs_fchmod, fd, mode);
     FS_SYNC_TRACE_END(fchmod);
   }
 }
 
-
 /* fs.chown(path, uid, gid);
  * Wrapper for chown(1) / EIO_CHOWN
  */
@@ -2647,18 +2675,17 @@ static void UTimes(const FunctionCallbackInfo<Value>& args) {
   CHECK(args[2]->IsNumber());
   const double mtime = args[2].As<Number>()->Value();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 3);
-  if (req_wrap_async != nullptr) {  // utimes(path, atime, mtime, req)
+  if (argc > 3) {  // utimes(path, atime, mtime, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 3);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_UTIME, req_wrap_async, "path", TRACE_STR_COPY(*path))
     AsyncCall(env, req_wrap_async, args, "utime", UTF8, AfterNoArgs,
               uv_fs_utime, *path, atime, mtime);
-  } else {  // utimes(path, atime, mtime, undefined, ctx)
-    CHECK_EQ(argc, 5);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // utimes(path, atime, mtime)
+    FSReqWrapSync req_wrap_sync("utime", *path);
     FS_SYNC_TRACE_BEGIN(utimes);
-    SyncCall(env, args[4], &req_wrap_sync, "utime",
-             uv_fs_utime, *path, atime, mtime);
+    SyncCallAndThrowOnError(
+        env, &req_wrap_sync, uv_fs_utime, *path, atime, mtime);
     FS_SYNC_TRACE_END(utimes);
   }
 }
@@ -2678,17 +2705,16 @@ static void FUTimes(const FunctionCallbackInfo<Value>& args) {
   CHECK(args[2]->IsNumber());
   const double mtime = args[2].As<Number>()->Value();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 3);
-  if (req_wrap_async != nullptr) {  // futimes(fd, atime, mtime, req)
+  if (argc > 3) {  // futimes(fd, atime, mtime, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 3);
     FS_ASYNC_TRACE_BEGIN0(UV_FS_FUTIME, req_wrap_async)
     AsyncCall(env, req_wrap_async, args, "futime", UTF8, AfterNoArgs,
               uv_fs_futime, fd, atime, mtime);
-  } else {  // futimes(fd, atime, mtime, undefined, ctx)
-    CHECK_EQ(argc, 5);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // futimes(fd, atime, mtime)
+    FSReqWrapSync req_wrap_sync("futime");
     FS_SYNC_TRACE_BEGIN(futimes);
-    SyncCall(env, args[4], &req_wrap_sync, "futime",
-             uv_fs_futime, fd, atime, mtime);
+    SyncCallAndThrowOnError(
+        env, &req_wrap_sync, uv_fs_futime, fd, atime, mtime);
     FS_SYNC_TRACE_END(futimes);
   }
 }
@@ -2710,18 +2736,17 @@ static void LUTimes(const FunctionCallbackInfo<Value>& args) {
   CHECK(args[2]->IsNumber());
   const double mtime = args[2].As<Number>()->Value();
 
-  FSReqBase* req_wrap_async = GetReqWrap(args, 3);
-  if (req_wrap_async != nullptr) {  // lutimes(path, atime, mtime, req)
+  if (argc > 3) {  // lutimes(path, atime, mtime, req)
+    FSReqBase* req_wrap_async = GetReqWrap(args, 3);
     FS_ASYNC_TRACE_BEGIN1(
         UV_FS_LUTIME, req_wrap_async, "path", TRACE_STR_COPY(*path))
     AsyncCall(env, req_wrap_async, args, "lutime", UTF8, AfterNoArgs,
               uv_fs_lutime, *path, atime, mtime);
-  } else {  // lutimes(path, atime, mtime, undefined, ctx)
-    CHECK_EQ(argc, 5);
-    FSReqWrapSync req_wrap_sync;
+  } else {  // lutimes(path, atime, mtime)
+    FSReqWrapSync req_wrap_sync("lutime", *path);
     FS_SYNC_TRACE_BEGIN(lutimes);
-    SyncCall(env, args[4], &req_wrap_sync, "lutime",
-             uv_fs_lutime, *path, atime, mtime);
+    SyncCallAndThrowOnError(
+        env, &req_wrap_sync, uv_fs_lutime, *path, atime, mtime);
     FS_SYNC_TRACE_END(lutimes);
   }
 }
@@ -2767,6 +2792,51 @@ static void Mkdtemp(const FunctionCallbackInfo<Value>& args) {
   }
 }
 
+static void GetFormatOfExtensionlessFile(
+    const FunctionCallbackInfo<Value>& args) {
+  CHECK_EQ(args.Length(), 1);
+  CHECK(args[0]->IsString());
+
+  Environment* env = Environment::GetCurrent(args);
+  node::Utf8Value input(args.GetIsolate(), args[0]);
+
+  THROW_IF_INSUFFICIENT_PERMISSIONS(
+      env, permission::PermissionScope::kFileSystemRead, input.ToStringView());
+
+  uv_fs_t req;
+  FS_SYNC_TRACE_BEGIN(open)
+  uv_file file = uv_fs_open(nullptr, &req, input.out(), O_RDONLY, 0, nullptr);
+  FS_SYNC_TRACE_END(open);
+
+  if (req.result < 0) {
+    return args.GetReturnValue().Set(EXTENSIONLESS_FORMAT_JAVASCRIPT);
+  }
+
+  auto cleanup = OnScopeLeave([&req, &file]() {
+    FS_SYNC_TRACE_BEGIN(close);
+    CHECK_EQ(0, uv_fs_close(nullptr, &req, file, nullptr));
+    FS_SYNC_TRACE_END(close);
+    uv_fs_req_cleanup(&req);
+  });
+
+  char buffer[4];
+  uv_buf_t buf = uv_buf_init(buffer, sizeof(buffer));
+  int err = uv_fs_read(nullptr, &req, file, &buf, 1, 0, nullptr);
+
+  if (err < 0) {
+    return args.GetReturnValue().Set(EXTENSIONLESS_FORMAT_JAVASCRIPT);
+  }
+
+  // We do this by taking advantage of the fact that all Wasm files start with
+  // the header `0x00 0x61 0x73 0x6d`
+  if (buffer[0] == 0x00 && buffer[1] == 0x61 && buffer[2] == 0x73 &&
+      buffer[3] == 0x6d) {
+    return args.GetReturnValue().Set(EXTENSIONLESS_FORMAT_WASM);
+  }
+
+  return args.GetReturnValue().Set(EXTENSIONLESS_FORMAT_JAVASCRIPT);
+}
+
 static bool FileURLToPath(
     Environment* env,
     const ada::url_aggregator& file_url,
@@ -2909,11 +2979,19 @@ BindingData::FilePathIsFileReturnType BindingData::FilePathIsFile(
   return BindingData::FilePathIsFileReturnType::kIsNotFile;
 }
 
+namespace {
+
+// define the final index of the algorithm resolution
+// when packageConfig.main is defined.
+constexpr uint8_t legacy_main_extensions_with_main_end = 7;
+// define the final index of the algorithm resolution
+// when packageConfig.main is NOT defined
+constexpr uint8_t legacy_main_extensions_package_fallback_end = 10;
 // the possible file extensions that should be tested
 // 0-6: when packageConfig.main is defined
 // 7-9: when packageConfig.main is NOT defined,
 //      or when the previous case didn't found the file
-const std::array<std::string, 10> BindingData::legacy_main_extensions = {
+constexpr std::array<std::string_view, 10> legacy_main_extensions = {
     "",
     ".js",
     ".json",
@@ -2925,6 +3003,8 @@ const std::array<std::string, 10> BindingData::legacy_main_extensions = {
     ".json",
     ".node"};
 
+}  // namespace
+
 void BindingData::LegacyMainResolve(const FunctionCallbackInfo<Value>& args) {
   CHECK_GE(args.Length(), 1);
   CHECK(args[0]->IsString());
@@ -2965,9 +3045,8 @@ void BindingData::LegacyMainResolve(const FunctionCallbackInfo<Value>& args) {
 
     FromNamespacedPath(&initial_file_path);
 
-    for (int i = 0; i < BindingData::legacy_main_extensions_with_main_end;
-         i++) {
-      file_path = initial_file_path + BindingData::legacy_main_extensions[i];
+    for (int i = 0; i < legacy_main_extensions_with_main_end; i++) {
+      file_path = initial_file_path + std::string(legacy_main_extensions[i]);
 
       switch (FilePathIsFile(env, file_path)) {
         case BindingData::FilePathIsFileReturnType::kIsFile:
@@ -3000,10 +3079,10 @@ void BindingData::LegacyMainResolve(const FunctionCallbackInfo<Value>& args) {
 
   FromNamespacedPath(&initial_file_path);
 
-  for (int i = BindingData::legacy_main_extensions_with_main_end;
-       i < BindingData::legacy_main_extensions_package_fallback_end;
+  for (int i = legacy_main_extensions_with_main_end;
+       i < legacy_main_extensions_package_fallback_end;
        i++) {
-    file_path = initial_file_path + BindingData::legacy_main_extensions[i];
+    file_path = initial_file_path + std::string(legacy_main_extensions[i]);
 
     switch (FilePathIsFile(env, file_path)) {
       case BindingData::FilePathIsFileReturnType::kIsFile:
@@ -3170,11 +3249,17 @@ static void CreatePerIsolateProperties(IsolateData* isolate_data,
                                        Local<ObjectTemplate> target) {
   Isolate* isolate = isolate_data->isolate();
 
+  SetMethod(isolate,
+            target,
+            "getFormatOfExtensionlessFile",
+            GetFormatOfExtensionlessFile);
   SetMethod(isolate, target, "access", Access);
   SetMethod(isolate, target, "close", Close);
+  SetMethod(isolate, target, "existsSync", ExistsSync);
   SetMethod(isolate, target, "open", Open);
   SetMethod(isolate, target, "openFileHandle", OpenFileHandle);
   SetMethod(isolate, target, "read", Read);
+  SetMethod(isolate, target, "readFileUtf8", ReadFileUtf8);
   SetMethod(isolate, target, "readBuffers", ReadBuffers);
   SetMethod(isolate, target, "fdatasync", Fdatasync);
   SetMethod(isolate, target, "fsync", Fsync);
@@ -3188,7 +3273,6 @@ static void CreatePerIsolateProperties(IsolateData* isolate_data,
   SetMethod(isolate, target, "stat", Stat);
   SetMethod(isolate, target, "lstat", LStat);
   SetMethod(isolate, target, "fstat", FStat);
-  SetMethodNoSideEffect(isolate, target, "readFileSync", ReadFileSync);
   SetMethod(isolate, target, "statfs", StatFs);
   SetMethod(isolate, target, "link", Link);
   SetMethod(isolate, target, "symlink", Symlink);
@@ -3289,10 +3373,13 @@ void RegisterExternalReferences(ExternalReferenceRegistry* registry) {
   StatWatcher::RegisterExternalReferences(registry);
   BindingData::RegisterExternalReferences(registry);
 
+  registry->Register(GetFormatOfExtensionlessFile);
   registry->Register(Close);
+  registry->Register(ExistsSync);
   registry->Register(Open);
   registry->Register(OpenFileHandle);
   registry->Register(Read);
+  registry->Register(ReadFileUtf8);
   registry->Register(ReadBuffers);
   registry->Register(Fdatasync);
   registry->Register(Fsync);
@@ -3306,7 +3393,6 @@ void RegisterExternalReferences(ExternalReferenceRegistry* registry) {
   registry->Register(Stat);
   registry->Register(LStat);
   registry->Register(FStat);
-  registry->Register(ReadFileSync);
   registry->Register(StatFs);
   registry->Register(Link);
   registry->Register(Symlink);
diff --git a/src/node_file.h b/src/node_file.h
index 0fa2da0b4f7f8a..bdad1ae25f4892 100644
--- a/src/node_file.h
+++ b/src/node_file.h
@@ -102,14 +102,6 @@ class BindingData : public SnapshotableObject {
 
   static FilePathIsFileReturnType FilePathIsFile(Environment* env,
                                                  const std::string& file_path);
-
-  static const std::array<std::string, 10> legacy_main_extensions;
-  // define the final index of the algorithm resolution
-  // when packageConfig.main is defined.
-  static const uint8_t legacy_main_extensions_with_main_end = 7;
-  // define the final index of the algorithm resolution
-  // when packageConfig.main is NOT defined
-  static const uint8_t legacy_main_extensions_package_fallback_end = 10;
 };
 
 // structure used to store state during a complex operation, e.g., mkdirp.
@@ -465,10 +457,22 @@ int MKDirpSync(uv_loop_t* loop,
 
 class FSReqWrapSync {
  public:
-  FSReqWrapSync() = default;
+  FSReqWrapSync(const char* syscall = nullptr,
+                const char* path = nullptr,
+                const char* dest = nullptr)
+      : syscall_p(syscall), path_p(path), dest_p(dest) {}
   ~FSReqWrapSync() { uv_fs_req_cleanup(&req); }
+
   uv_fs_t req;
+  const char* syscall_p;
+  const char* path_p;
+  const char* dest_p;
+
+  FSReqWrapSync(const FSReqWrapSync&) = delete;
+  FSReqWrapSync& operator=(const FSReqWrapSync&) = delete;
 
+  // TODO(joyeecheung): move these out of FSReqWrapSync and into a special
+  // class for mkdirp
   FSContinuationData* continuation_data() const {
     return continuation_data_.get();
   }
@@ -476,9 +480,6 @@ class FSReqWrapSync {
     continuation_data_ = std::move(data);
   }
 
-  FSReqWrapSync(const FSReqWrapSync&) = delete;
-  FSReqWrapSync& operator=(const FSReqWrapSync&) = delete;
-
  private:
   std::unique_ptr<FSContinuationData> continuation_data_;
 };
@@ -515,6 +516,18 @@ inline int SyncCall(Environment* env, v8::Local<v8::Value> ctx,
                     FSReqWrapSync* req_wrap, const char* syscall,
                     Func fn, Args... args);
 
+// Similar to SyncCall but throws immediately if there is an error.
+template <typename Predicate, typename Func, typename... Args>
+int SyncCallAndThrowIf(Predicate should_throw,
+                       Environment* env,
+                       FSReqWrapSync* req_wrap,
+                       Func fn,
+                       Args... args);
+template <typename Func, typename... Args>
+int SyncCallAndThrowOnError(Environment* env,
+                            FSReqWrapSync* req_wrap,
+                            Func fn,
+                            Args... args);
 }  // namespace fs
 
 }  // namespace node
diff --git a/src/node_http_parser.cc b/src/node_http_parser.cc
index a12d89c3cd6cb4..20c1bbb0bf9a06 100644
--- a/src/node_http_parser.cc
+++ b/src/node_http_parser.cc
@@ -84,8 +84,18 @@ const uint32_t kLenientNone = 0;
 const uint32_t kLenientHeaders = 1 << 0;
 const uint32_t kLenientChunkedLength = 1 << 1;
 const uint32_t kLenientKeepAlive = 1 << 2;
-const uint32_t kLenientAll = kLenientHeaders | kLenientChunkedLength |
-  kLenientKeepAlive;
+const uint32_t kLenientTransferEncoding = 1 << 3;
+const uint32_t kLenientVersion = 1 << 4;
+const uint32_t kLenientDataAfterClose = 1 << 5;
+const uint32_t kLenientOptionalLFAfterCR = 1 << 6;
+const uint32_t kLenientOptionalCRLFAfterChunk = 1 << 7;
+const uint32_t kLenientOptionalCRBeforeLF = 1 << 8;
+const uint32_t kLenientSpacesAfterChunkSize = 1 << 9;
+const uint32_t kLenientAll =
+    kLenientHeaders | kLenientChunkedLength | kLenientKeepAlive |
+    kLenientTransferEncoding | kLenientVersion | kLenientDataAfterClose |
+    kLenientOptionalLFAfterCR | kLenientOptionalCRLFAfterChunk |
+    kLenientOptionalCRBeforeLF | kLenientSpacesAfterChunkSize;
 
 inline bool IsOWS(char c) {
   return c == ' ' || c == '\t';
@@ -930,6 +940,27 @@ class Parser : public AsyncWrap, public StreamListener {
     if (lenient_flags & kLenientKeepAlive) {
       llhttp_set_lenient_keep_alive(&parser_, 1);
     }
+    if (lenient_flags & kLenientTransferEncoding) {
+      llhttp_set_lenient_transfer_encoding(&parser_, 1);
+    }
+    if (lenient_flags & kLenientVersion) {
+      llhttp_set_lenient_version(&parser_, 1);
+    }
+    if (lenient_flags & kLenientDataAfterClose) {
+      llhttp_set_lenient_data_after_close(&parser_, 1);
+    }
+    if (lenient_flags & kLenientOptionalLFAfterCR) {
+      llhttp_set_lenient_optional_lf_after_cr(&parser_, 1);
+    }
+    if (lenient_flags & kLenientOptionalCRLFAfterChunk) {
+      llhttp_set_lenient_optional_crlf_after_chunk(&parser_, 1);
+    }
+    if (lenient_flags & kLenientOptionalCRBeforeLF) {
+      llhttp_set_lenient_optional_cr_before_lf(&parser_, 1);
+    }
+    if (lenient_flags & kLenientSpacesAfterChunkSize) {
+      llhttp_set_lenient_spaces_after_chunk_size(&parser_, 1);
+    }
 
     header_nread_ = 0;
     url_.Reset();
@@ -1236,6 +1267,23 @@ void InitializeHttpParser(Local<Object> target,
          Integer::NewFromUnsigned(env->isolate(), kLenientChunkedLength));
   t->Set(FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientKeepAlive"),
          Integer::NewFromUnsigned(env->isolate(), kLenientKeepAlive));
+  t->Set(FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientTransferEncoding"),
+         Integer::NewFromUnsigned(env->isolate(), kLenientTransferEncoding));
+  t->Set(FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientVersion"),
+         Integer::NewFromUnsigned(env->isolate(), kLenientVersion));
+  t->Set(FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientDataAfterClose"),
+         Integer::NewFromUnsigned(env->isolate(), kLenientDataAfterClose));
+  t->Set(FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientOptionalLFAfterCR"),
+         Integer::NewFromUnsigned(env->isolate(), kLenientOptionalLFAfterCR));
+  t->Set(
+      FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientOptionalCRLFAfterChunk"),
+      Integer::NewFromUnsigned(env->isolate(), kLenientOptionalCRLFAfterChunk));
+  t->Set(FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientOptionalCRBeforeLF"),
+         Integer::NewFromUnsigned(env->isolate(), kLenientOptionalCRBeforeLF));
+  t->Set(
+      FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientSpacesAfterChunkSize"),
+      Integer::NewFromUnsigned(env->isolate(), kLenientSpacesAfterChunkSize));
+
   t->Set(FIXED_ONE_BYTE_STRING(env->isolate(), "kLenientAll"),
          Integer::NewFromUnsigned(env->isolate(), kLenientAll));
 
diff --git a/src/node_i18n.cc b/src/node_i18n.cc
index 372df8d029fc4f..d45325954d9807 100644
--- a/src/node_i18n.cc
+++ b/src/node_i18n.cc
@@ -54,20 +54,21 @@
 #include "util-inl.h"
 #include "v8.h"
 
-#include <unicode/utypes.h>
 #include <unicode/putil.h>
+#include <unicode/timezone.h>
 #include <unicode/uchar.h>
 #include <unicode/uclean.h>
+#include <unicode/ucnv.h>
 #include <unicode/udata.h>
 #include <unicode/uidna.h>
-#include <unicode/ucnv.h>
-#include <unicode/utf8.h>
-#include <unicode/utf16.h>
-#include <unicode/timezone.h>
 #include <unicode/ulocdata.h>
+#include <unicode/urename.h>
+#include <unicode/ustring.h>
+#include <unicode/utf16.h>
+#include <unicode/utf8.h>
+#include <unicode/utypes.h>
 #include <unicode/uvernum.h>
 #include <unicode/uversion.h>
-#include <unicode/ustring.h>
 
 #ifdef NODE_HAVE_SMALL_ICU
 /* if this is defined, we have a 'secondary' entry point.
@@ -569,8 +570,7 @@ ConverterObject::ConverterObject(
   }
 }
 
-
-bool InitializeICUDirectory(const std::string& path) {
+bool InitializeICUDirectory(const std::string& path, std::string* error) {
   UErrorCode status = U_ZERO_ERROR;
   if (path.empty()) {
 #ifdef NODE_HAVE_SMALL_ICU
@@ -583,7 +583,12 @@ bool InitializeICUDirectory(const std::string& path) {
     u_setDataDirectory(path.c_str());
     u_init(&status);
   }
-  return status == U_ZERO_ERROR;
+  if (status == U_ZERO_ERROR) {
+    return true;
+  }
+
+  *error = u_errorName(status);
+  return false;
 }
 
 void SetDefaultTimeZone(const char* tzid) {
diff --git a/src/node_i18n.h b/src/node_i18n.h
index f32ade831b17a0..e516282865fb18 100644
--- a/src/node_i18n.h
+++ b/src/node_i18n.h
@@ -38,7 +38,7 @@
 namespace node {
 namespace i18n {
 
-bool InitializeICUDirectory(const std::string& path);
+bool InitializeICUDirectory(const std::string& path, std::string* error);
 
 void SetDefaultTimeZone(const char* tzid);
 
diff --git a/src/node_messaging.cc b/src/node_messaging.cc
index d3d2070d623c80..6d2cbf8726c4e4 100644
--- a/src/node_messaging.cc
+++ b/src/node_messaging.cc
@@ -321,8 +321,9 @@ class SerializerDelegate : public ValueSerializer::Delegate {
     }
 
     if (JSTransferable::IsJSTransferable(env_, context_, object)) {
-      JSTransferable* js_transferable = JSTransferable::Wrap(env_, object);
-      return WriteHostObject(BaseObjectPtr<BaseObject>{js_transferable});
+      BaseObjectPtr<JSTransferable> js_transferable =
+          JSTransferable::Wrap(env_, object);
+      return WriteHostObject(js_transferable);
     }
 
     // Convert process.env to a regular object.
@@ -431,7 +432,7 @@ class SerializerDelegate : public ValueSerializer::Delegate {
           return Just(true);
         }
       }
-      THROW_ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST(env_);
+      ThrowDataCloneError(env_->clone_transfer_needed_str());
       return Nothing<bool>();
     }
 
@@ -475,7 +476,7 @@ Maybe<bool> Message::Serialize(Environment* env,
     Local<Value> entry_val = transfer_list_v[i];
     if (!entry_val->IsObject()) {
       // Only object can be transferred.
-      THROW_ERR_INVALID_TRANSFER_OBJECT(env);
+      ThrowDataCloneException(context, env->clone_untransferable_str());
       return Nothing<bool>();
     }
     Local<Object> entry = entry_val.As<Object>();
@@ -533,11 +534,10 @@ Maybe<bool> Message::Serialize(Environment* env,
       host_object = BaseObjectPtr<BaseObject>{Unwrap<BaseObject>(entry)};
     } else {
       if (!JSTransferable::IsJSTransferable(env, context, entry)) {
-        THROW_ERR_INVALID_TRANSFER_OBJECT(env);
+        ThrowDataCloneException(context, env->clone_untransferable_str());
         return Nothing<bool>();
       }
-      JSTransferable* js_transferable = JSTransferable::Wrap(env, entry);
-      host_object = BaseObjectPtr<BaseObject>{js_transferable};
+      host_object = JSTransferable::Wrap(env, entry);
     }
 
     if (env->message_port_constructor_template()->HasInstance(entry) &&
@@ -795,7 +795,7 @@ void MessagePort::OnMessage(MessageProcessingMode mode) {
 
   size_t processing_limit;
   if (mode == MessageProcessingMode::kNormalOperation) {
-    Mutex::ScopedLock(data_->mutex_);
+    Mutex::ScopedLock lock(data_->mutex_);
     processing_limit = std::max(data_->incoming_messages_.size(),
                                 static_cast<size_t>(1000));
   } else {
@@ -1190,22 +1190,26 @@ Local<FunctionTemplate> GetMessagePortConstructorTemplate(Environment* env) {
 }
 
 // static
-JSTransferable* JSTransferable::Wrap(Environment* env, Local<Object> target) {
+BaseObjectPtr<JSTransferable> JSTransferable::Wrap(Environment* env,
+                                                   Local<Object> target) {
   Local<Context> context = env->context();
   Local<Value> wrapper_val =
       target->GetPrivate(context, env->js_transferable_wrapper_private_symbol())
           .ToLocalChecked();
   DCHECK(wrapper_val->IsObject() || wrapper_val->IsUndefined());
-  JSTransferable* wrapper;
+  BaseObjectPtr<JSTransferable> wrapper;
   if (wrapper_val->IsObject()) {
-    wrapper = Unwrap<JSTransferable>(wrapper_val);
+    wrapper =
+        BaseObjectPtr<JSTransferable>{Unwrap<JSTransferable>(wrapper_val)};
   } else {
     Local<Object> wrapper_obj = env->js_transferable_constructor_template()
                                     ->GetFunction(context)
                                     .ToLocalChecked()
                                     ->NewInstance(context)
                                     .ToLocalChecked();
-    wrapper = new JSTransferable(env, wrapper_obj, target);
+    // Make sure the JSTransferable wrapper object is not garbage collected
+    // until the strong BaseObjectPtr's reference count is decreased to 0.
+    wrapper = MakeDetachedBaseObject<JSTransferable>(env, wrapper_obj, target);
     target
         ->SetPrivate(
             context, env->js_transferable_wrapper_private_symbol(), wrapper_obj)
@@ -1226,12 +1230,18 @@ JSTransferable::JSTransferable(Environment* env,
                                Local<Object> obj,
                                Local<Object> target)
     : BaseObject(env, obj) {
-  MakeWeak();
   target_.Reset(env->isolate(), target);
-  target_.SetWeak();
+}
+
+JSTransferable::~JSTransferable() {
+  HandleScope scope(env()->isolate());
+  target_.Get(env()->isolate())
+      ->DeletePrivate(env()->context(),
+                      env()->js_transferable_wrapper_private_symbol());
 }
 
 Local<Object> JSTransferable::target() const {
+  DCHECK(!target_.IsEmpty());
   return target_.Get(env()->isolate());
 }
 
@@ -1335,8 +1345,7 @@ JSTransferable::NestedTransferables() const {
     if (!JSTransferable::IsJSTransferable(env(), context, obj)) {
       continue;
     }
-    JSTransferable* js_transferable = JSTransferable::Wrap(env(), obj);
-    ret.emplace_back(js_transferable);
+    ret.emplace_back(JSTransferable::Wrap(env(), obj));
   }
   return Just(ret);
 }
@@ -1397,8 +1406,7 @@ BaseObjectPtr<BaseObject> JSTransferable::Data::Deserialize(
   if (!JSTransferable::IsJSTransferable(env, context, ret.As<Object>())) {
     return {};
   }
-  JSTransferable* js_transferable = JSTransferable::Wrap(env, ret.As<Object>());
-  return BaseObjectPtr<BaseObject>{js_transferable};
+  return JSTransferable::Wrap(env, ret.As<Object>());
 }
 
 Maybe<bool> JSTransferable::Data::FinalizeTransferWrite(
diff --git a/src/node_messaging.h b/src/node_messaging.h
index d1c16bc1c03cb7..a32d477c2e2f79 100644
--- a/src/node_messaging.h
+++ b/src/node_messaging.h
@@ -324,11 +324,17 @@ class MessagePort : public HandleWrap {
 // See e.g. FileHandle in internal/fs/promises.js for an example.
 class JSTransferable : public BaseObject {
  public:
-  static JSTransferable* Wrap(Environment* env, v8::Local<v8::Object> target);
+  static BaseObjectPtr<JSTransferable> Wrap(Environment* env,
+                                            v8::Local<v8::Object> target);
   static bool IsJSTransferable(Environment* env,
                                v8::Local<v8::Context> context,
                                v8::Local<v8::Object> object);
 
+  JSTransferable(Environment* env,
+                 v8::Local<v8::Object> obj,
+                 v8::Local<v8::Object> target);
+  ~JSTransferable();
+
   BaseObject::TransferMode GetTransferMode() const override;
   std::unique_ptr<TransferData> TransferForMessaging() override;
   std::unique_ptr<TransferData> CloneForMessaging() const override;
@@ -345,10 +351,6 @@ class JSTransferable : public BaseObject {
   v8::Local<v8::Object> target() const;
 
  private:
-  JSTransferable(Environment* env,
-                 v8::Local<v8::Object> obj,
-                 v8::Local<v8::Object> target);
-
   template <TransferMode mode>
   std::unique_ptr<TransferData> TransferOrClone() const;
 
diff --git a/src/node_options.cc b/src/node_options.cc
index b544f1209143c0..fc9940b64c5c33 100644
--- a/src/node_options.cc
+++ b/src/node_options.cc
@@ -10,9 +10,8 @@
 #include "openssl/opensslv.h"
 #endif
 
-#include <errno.h>
 #include <algorithm>
-#include <cstdlib>  // strtoul, errno
+#include <charconv>
 #include <limits>
 #include <sstream>
 #include <string_view>
@@ -114,12 +113,19 @@ void EnvironmentOptions::CheckOptions(std::vector<std::string>* errors,
     errors->push_back("--policy-integrity cannot be empty");
   }
 
-  if (!module_type.empty()) {
-    if (module_type != "commonjs" && module_type != "module") {
+  if (!input_type.empty()) {
+    if (input_type != "commonjs" && input_type != "module") {
       errors->push_back("--input-type must be \"module\" or \"commonjs\"");
     }
   }
 
+  if (!type.empty()) {
+    if (type != "commonjs" && type != "module") {
+      errors->push_back("--experimental-default-type must be "
+                        "\"module\" or \"commonjs\"");
+    }
+  }
+
   if (syntax_check_only && has_eval_string) {
     errors->push_back("either --check or --eval can be used, not both");
   }
@@ -370,6 +376,11 @@ EnvironmentOptionsParser::EnvironmentOptionsParser() {
             &EnvironmentOptions::experimental_fetch,
             kAllowedInEnvvar,
             true);
+  AddOption("--experimental-websocket",
+            "experimental WebSocket API",
+            &EnvironmentOptions::experimental_websocket,
+            kAllowedInEnvvar,
+            true);
   AddOption("--experimental-global-customevent",
             "expose experimental CustomEvent on the global scope",
             &EnvironmentOptions::experimental_global_customevent,
@@ -469,7 +480,7 @@ EnvironmentOptionsParser::EnvironmentOptionsParser() {
             kAllowedInEnvvar);
   AddOption("--input-type",
             "set module type for string input",
-            &EnvironmentOptions::module_type,
+            &EnvironmentOptions::input_type,
             kAllowedInEnvvar);
   AddOption(
       "--experimental-specifier-resolution", "", NoOp{}, kAllowedInEnvvar);
@@ -584,6 +595,9 @@ EnvironmentOptionsParser::EnvironmentOptionsParser() {
   AddOption("--test",
             "launch test runner on startup",
             &EnvironmentOptions::test_runner);
+  AddOption("--test-concurrency",
+            "specify test runner concurrency",
+            &EnvironmentOptions::test_runner_concurrency);
   AddOption("--experimental-test-coverage",
             "enable code coverage in the test runner",
             &EnvironmentOptions::test_runner_coverage);
@@ -641,6 +655,10 @@ EnvironmentOptionsParser::EnvironmentOptionsParser() {
             "show stack traces on process warnings",
             &EnvironmentOptions::trace_warnings,
             kAllowedInEnvvar);
+  AddOption("--experimental-default-type",
+            "set module system to use by default",
+            &EnvironmentOptions::type,
+            kAllowedInEnvvar);
   AddOption("--extra-info-on-fatal-exception",
             "hide extra information on fatal exception that causes exit",
             &EnvironmentOptions::extra_info_on_fatal_exception,
@@ -1010,17 +1028,17 @@ inline std::string RemoveBrackets(const std::string& host) {
     return host;
 }
 
-inline int ParseAndValidatePort(const std::string& port,
-                                std::vector<std::string>* errors) {
-  char* endptr;
-  errno = 0;
-  const unsigned long result =                 // NOLINT(runtime/int)
-    strtoul(port.c_str(), &endptr, 10);
-  if (errno != 0 || *endptr != '\0'||
-      (result != 0 && result < 1024) || result > 65535) {
+inline uint16_t ParseAndValidatePort(const std::string_view port,
+                                     std::vector<std::string>* errors) {
+  uint16_t result{};
+  auto r = std::from_chars(port.data(), port.data() + port.size(), result);
+
+  if (r.ec == std::errc::result_out_of_range ||
+      (result != 0 && result < 1024)) {
     errors->push_back(" must be 0 or in range 1024 to 65535.");
   }
-  return static_cast<int>(result);
+
+  return result;
 }
 
 HostPort SplitHostPort(const std::string& arg,
diff --git a/src/node_options.h b/src/node_options.h
index bc18a45e681a3c..ba16f54e129aec 100644
--- a/src/node_options.h
+++ b/src/node_options.h
@@ -28,24 +28,20 @@ class HostPort {
 
   void set_host(const std::string& host) { host_name_ = host; }
 
-  void set_port(int port) { port_ = port; }
+  void set_port(uint16_t port) { port_ = port; }
 
   const std::string& host() const { return host_name_; }
 
-  int port() const {
-    // TODO(joyeecheung): make port a uint16_t
-    CHECK_GE(port_, 0);
-    return port_;
-  }
+  uint16_t port() const { return port_; }
 
   void Update(const HostPort& other) {
     if (!other.host_name_.empty()) host_name_ = other.host_name_;
-    if (other.port_ >= 0) port_ = other.port_;
+    port_ = other.port_;
   }
 
  private:
   std::string host_name_;
-  int port_;
+  uint16_t port_;
 };
 
 class Options {
@@ -111,12 +107,14 @@ class EnvironmentOptions : public Options {
   std::string dns_result_order;
   bool enable_source_maps = false;
   bool experimental_fetch = true;
+  bool experimental_websocket = false;
   bool experimental_global_customevent = true;
   bool experimental_global_web_crypto = true;
   bool experimental_https_modules = false;
   bool experimental_wasm_modules = false;
   bool experimental_import_meta_resolve = false;
-  std::string module_type;
+  std::string input_type;  // Value of --input-type
+  std::string type;        // Value of --experimental-default-type
   std::string experimental_policy;
   std::string experimental_policy_integrity;
   bool has_policy_integrity_string = false;
@@ -161,6 +159,7 @@ class EnvironmentOptions : public Options {
   std::string env_file;
   bool has_env_file_string = false;
   bool test_runner = false;
+  uint64_t test_runner_concurrency = 0;
   bool test_runner_coverage = false;
   std::vector<std::string> test_name_pattern;
   std::vector<std::string> test_reporter;
diff --git a/src/node_snapshotable.cc b/src/node_snapshotable.cc
index 2c10f176c94033..562a47ddcc9c8e 100644
--- a/src/node_snapshotable.cc
+++ b/src/node_snapshotable.cc
@@ -145,7 +145,8 @@ class SnapshotDeserializer : public BlobDeserializer<SnapshotDeserializer> {
  public:
   explicit SnapshotDeserializer(std::string_view v)
       : BlobDeserializer<SnapshotDeserializer>(
-            per_process::enabled_debug_list.enabled(DebugCategory::MKSNAPSHOT),
+            per_process::enabled_debug_list.enabled(
+                DebugCategory::SNAPSHOT_SERDES),
             v) {}
 
   template <typename T,
@@ -159,7 +160,7 @@ class SnapshotSerializer : public BlobSerializer<SnapshotSerializer> {
   SnapshotSerializer()
       : BlobSerializer<SnapshotSerializer>(
             per_process::enabled_debug_list.enabled(
-                DebugCategory::MKSNAPSHOT)) {
+                DebugCategory::SNAPSHOT_SERDES)) {
     // Currently the snapshot blob built with an empty script is around 4MB.
     // So use that as the default sink size.
     sink.reserve(4 * 1024 * 1024);
diff --git a/src/node_url.cc b/src/node_url.cc
index 666492ca47cee3..89fcfec20f5685 100644
--- a/src/node_url.cc
+++ b/src/node_url.cc
@@ -227,6 +227,35 @@ void BindingData::Format(const FunctionCallbackInfo<Value>& args) {
                                 .ToLocalChecked());
 }
 
+void BindingData::ThrowInvalidURL(node::Environment* env,
+                                  std::string_view input,
+                                  std::optional<std::string> base) {
+  Local<Value> err = ERR_INVALID_URL(env->isolate(), "Invalid URL");
+  DCHECK(err->IsObject());
+
+  auto err_object = err.As<Object>();
+
+  USE(err_object->Set(env->context(),
+                      env->input_string(),
+                      v8::String::NewFromUtf8(env->isolate(),
+                                              input.data(),
+                                              v8::NewStringType::kNormal,
+                                              input.size())
+                          .ToLocalChecked()));
+
+  if (base.has_value()) {
+    USE(err_object->Set(env->context(),
+                        env->base_string(),
+                        v8::String::NewFromUtf8(env->isolate(),
+                                                base.value().c_str(),
+                                                v8::NewStringType::kNormal,
+                                                base.value().size())
+                            .ToLocalChecked()));
+  }
+
+  env->isolate()->ThrowException(err);
+}
+
 void BindingData::Parse(const FunctionCallbackInfo<Value>& args) {
   CHECK_GE(args.Length(), 1);
   CHECK(args[0]->IsString());  // input
@@ -235,15 +264,16 @@ void BindingData::Parse(const FunctionCallbackInfo<Value>& args) {
   Realm* realm = Realm::GetCurrent(args);
   BindingData* binding_data = realm->GetBindingData<BindingData>();
   Isolate* isolate = realm->isolate();
+  std::optional<std::string> base_{};
 
   Utf8Value input(isolate, args[0]);
   ada::result<ada::url_aggregator> base;
   ada::url_aggregator* base_pointer = nullptr;
   if (args[1]->IsString()) {
-    base =
-        ada::parse<ada::url_aggregator>(Utf8Value(isolate, args[1]).ToString());
+    base_ = Utf8Value(isolate, args[1]).ToString();
+    base = ada::parse<ada::url_aggregator>(*base_);
     if (!base) {
-      return args.GetReturnValue().Set(false);
+      return ThrowInvalidURL(realm->env(), input.ToStringView(), base_);
     }
     base_pointer = &base.value();
   }
@@ -251,7 +281,7 @@ void BindingData::Parse(const FunctionCallbackInfo<Value>& args) {
       ada::parse<ada::url_aggregator>(input.ToStringView(), base_pointer);
 
   if (!out) {
-    return args.GetReturnValue().Set(false);
+    return ThrowInvalidURL(realm->env(), input.ToStringView(), base_);
   }
 
   binding_data->UpdateComponents(out->get_components(), out->type);
diff --git a/src/node_url.h b/src/node_url.h
index c485caa2eb0343..f3aa136a5b538d 100644
--- a/src/node_url.h
+++ b/src/node_url.h
@@ -76,6 +76,9 @@ class BindingData : public SnapshotableObject {
                         const ada::scheme::type type);
 
   static v8::CFunction fast_can_parse_methods_[];
+  static void ThrowInvalidURL(Environment* env,
+                              std::string_view input,
+                              std::optional<std::string> base);
 };
 
 std::string FromFilePath(const std::string_view file_path);
diff --git a/src/node_version.h b/src/node_version.h
index 9001284dabf584..ae869e02ab848f 100644
--- a/src/node_version.h
+++ b/src/node_version.h
@@ -29,7 +29,7 @@
 #define NODE_VERSION_IS_LTS 0
 #define NODE_VERSION_LTS_CODENAME ""
 
-#define NODE_VERSION_IS_RELEASE 0
+#define NODE_VERSION_IS_RELEASE 1
 
 #ifndef NODE_STRINGIFY
 #define NODE_STRINGIFY(n) NODE_STRINGIFY_HELPER(n)
@@ -95,7 +95,7 @@
 #if defined(NODE_EMBEDDER_MODULE_VERSION)
 #define NODE_MODULE_VERSION NODE_EMBEDDER_MODULE_VERSION
 #else
-#define NODE_MODULE_VERSION 115
+#define NODE_MODULE_VERSION 120
 #endif
 
 // The NAPI_VERSION supported by the runtime. This is the inclusive range of
diff --git a/src/node_wasi.cc b/src/node_wasi.cc
index e1a16c4e4b7d47..9c1707ec3ad230 100644
--- a/src/node_wasi.cc
+++ b/src/node_wasi.cc
@@ -83,8 +83,8 @@ WASI::WASI(Environment* env,
   int err = uvwasi_init(&uvw_, options);
   if (err != UVWASI_ESUCCESS) {
     Local<Value> exception;
-    if (!WASIException(env->context(), err, "uvwasi_init").ToLocal(&exception))
-      return;
+    CHECK(
+        WASIException(env->context(), err, "uvwasi_init").ToLocal(&exception));
 
     env->isolate()->ThrowException(exception);
   }
diff --git a/src/pipe_wrap.cc b/src/pipe_wrap.cc
index 944d7c3e72c534..738a51a140d0af 100644
--- a/src/pipe_wrap.cc
+++ b/src/pipe_wrap.cc
@@ -62,7 +62,6 @@ MaybeLocal<Object> PipeWrap::Instantiate(Environment* env,
       constructor->NewInstance(env->context(), 1, &type_value));
 }
 
-
 void PipeWrap::Initialize(Local<Object> target,
                           Local<Value> unused,
                           Local<Context> context,
@@ -71,8 +70,7 @@ void PipeWrap::Initialize(Local<Object> target,
   Isolate* isolate = env->isolate();
 
   Local<FunctionTemplate> t = NewFunctionTemplate(isolate, New);
-  t->InstanceTemplate()
-    ->SetInternalFieldCount(StreamBase::kInternalFieldCount);
+  t->InstanceTemplate()->SetInternalFieldCount(StreamBase::kInternalFieldCount);
 
   t->Inherit(LibuvStreamWrap::GetConstructorTemplate(env));
 
@@ -102,9 +100,7 @@ void PipeWrap::Initialize(Local<Object> target,
   NODE_DEFINE_CONSTANT(constants, IPC);
   NODE_DEFINE_CONSTANT(constants, UV_READABLE);
   NODE_DEFINE_CONSTANT(constants, UV_WRITABLE);
-  target->Set(context,
-              env->constants_string(),
-              constants).Check();
+  target->Set(context, env->constants_string(), constants).Check();
 }
 
 void PipeWrap::RegisterExternalReferences(ExternalReferenceRegistry* registry) {
@@ -152,7 +148,6 @@ void PipeWrap::New(const FunctionCallbackInfo<Value>& args) {
   new PipeWrap(env, args.This(), provider, ipc);
 }
 
-
 PipeWrap::PipeWrap(Environment* env,
                    Local<Object> object,
                    ProviderType provider,
@@ -163,16 +158,14 @@ PipeWrap::PipeWrap(Environment* env,
                    // Suggestion: uv_pipe_init() returns void.
 }
 
-
 void PipeWrap::Bind(const FunctionCallbackInfo<Value>& args) {
   PipeWrap* wrap;
   ASSIGN_OR_RETURN_UNWRAP(&wrap, args.Holder());
   node::Utf8Value name(args.GetIsolate(), args[0]);
-  int err = uv_pipe_bind(&wrap->handle_, *name);
+  int err = uv_pipe_bind2(&wrap->handle_, *name, name.length(), 0);
   args.GetReturnValue().Set(err);
 }
 
-
 #ifdef _WIN32
 void PipeWrap::SetPendingInstances(const FunctionCallbackInfo<Value>& args) {
   PipeWrap* wrap;
@@ -183,7 +176,6 @@ void PipeWrap::SetPendingInstances(const FunctionCallbackInfo<Value>& args) {
 }
 #endif
 
-
 void PipeWrap::Fchmod(const v8::FunctionCallbackInfo<v8::Value>& args) {
   PipeWrap* wrap;
   ASSIGN_OR_RETURN_UNWRAP(&wrap, args.Holder());
@@ -193,20 +185,17 @@ void PipeWrap::Fchmod(const v8::FunctionCallbackInfo<v8::Value>& args) {
   args.GetReturnValue().Set(err);
 }
 
-
 void PipeWrap::Listen(const FunctionCallbackInfo<Value>& args) {
   PipeWrap* wrap;
   ASSIGN_OR_RETURN_UNWRAP(&wrap, args.Holder());
   Environment* env = wrap->env();
   int backlog;
   if (!args[0]->Int32Value(env->context()).To(&backlog)) return;
-  int err = uv_listen(reinterpret_cast<uv_stream_t*>(&wrap->handle_),
-                      backlog,
-                      OnConnection);
+  int err = uv_listen(
+      reinterpret_cast<uv_stream_t*>(&wrap->handle_), backlog, OnConnection);
   args.GetReturnValue().Set(err);
 }
 
-
 void PipeWrap::Open(const FunctionCallbackInfo<Value>& args) {
   Environment* env = Environment::GetCurrent(args);
 
@@ -222,7 +211,6 @@ void PipeWrap::Open(const FunctionCallbackInfo<Value>& args) {
   args.GetReturnValue().Set(err);
 }
 
-
 void PipeWrap::Connect(const FunctionCallbackInfo<Value>& args) {
   Environment* env = Environment::GetCurrent(args);
 
@@ -237,10 +225,8 @@ void PipeWrap::Connect(const FunctionCallbackInfo<Value>& args) {
 
   ConnectWrap* req_wrap =
       new ConnectWrap(env, req_wrap_obj, AsyncWrap::PROVIDER_PIPECONNECTWRAP);
-  req_wrap->Dispatch(uv_pipe_connect,
-                     &wrap->handle_,
-                     *name,
-                     AfterConnect);
+  req_wrap->Dispatch(
+      uv_pipe_connect2, &wrap->handle_, *name, name.length(), 0, AfterConnect);
 
   TRACE_EVENT_NESTABLE_ASYNC_BEGIN1(TRACING_CATEGORY_NODE2(net, native),
                                     "connect",
@@ -251,7 +237,6 @@ void PipeWrap::Connect(const FunctionCallbackInfo<Value>& args) {
   args.GetReturnValue().Set(0);  // uv_pipe_connect() doesn't return errors.
 }
 
-
 }  // namespace node
 
 NODE_BINDING_CONTEXT_AWARE_INTERNAL(pipe_wrap, node::PipeWrap::Initialize)
diff --git a/src/quic/session.cc b/src/quic/session.cc
index 73ca658e3ed062..b4a3ea796f338b 100644
--- a/src/quic/session.cc
+++ b/src/quic/session.cc
@@ -1303,10 +1303,10 @@ void Session::SelectPreferredAddress(PreferredAddress* preferredAddress) {
       auto ipv4 = preferredAddress->ipv4();
       if (ipv4.has_value()) {
         if (ipv4->address.empty() || ipv4->port == 0) return;
-        SocketAddress::New(AF_INET,
-                           std::string(ipv4->address).c_str(),
-                           ipv4->port,
-                           &remote_address_);
+        CHECK(SocketAddress::New(AF_INET,
+                                 std::string(ipv4->address).c_str(),
+                                 ipv4->port,
+                                 &remote_address_));
         preferredAddress->Use(ipv4.value());
       }
       break;
@@ -1315,10 +1315,10 @@ void Session::SelectPreferredAddress(PreferredAddress* preferredAddress) {
       auto ipv6 = preferredAddress->ipv6();
       if (ipv6.has_value()) {
         if (ipv6->address.empty() || ipv6->port == 0) return;
-        SocketAddress::New(AF_INET,
-                           std::string(ipv6->address).c_str(),
-                           ipv6->port,
-                           &remote_address_);
+        CHECK(SocketAddress::New(AF_INET,
+                                 std::string(ipv6->address).c_str(),
+                                 ipv6->port,
+                                 &remote_address_));
         preferredAddress->Use(ipv6.value());
       }
       break;
diff --git a/src/undici_version.h b/src/undici_version.h
index 47aef25a73212d..6631e1443fdfbb 100644
--- a/src/undici_version.h
+++ b/src/undici_version.h
@@ -1,6 +1,6 @@
 // This is an auto generated file, please do not edit.
-// Refer to tools/update-undici.sh
+// Refer to tools/dep_updaters/update-undici.sh
 #ifndef SRC_UNDICI_VERSION_H_
 #define SRC_UNDICI_VERSION_H_
-#define UNDICI_VERSION "5.23.0"
+#define UNDICI_VERSION "5.26.3"
 #endif  // SRC_UNDICI_VERSION_H_
diff --git a/test/abort/test-addon-uv-handle-leak.js b/test/abort/test-addon-uv-handle-leak.js
index e494b12f2de558..d2c4f8e646f457 100644
--- a/test/abort/test-addon-uv-handle-leak.js
+++ b/test/abort/test-addon-uv-handle-leak.js
@@ -78,6 +78,7 @@ if (process.argv[2] === 'child') {
 
   if (!(common.isFreeBSD ||
         common.isAIX ||
+        common.isIBMi ||
         (common.isLinux && !isGlibc()) ||
         common.isWindows)) {
     assert(stderr.includes('ExampleOwnerClass'), stderr);
diff --git a/test/benchmark/test-benchmark-mime.js b/test/benchmark/test-benchmark-mime.js
new file mode 100644
index 00000000000000..275184b9b90045
--- /dev/null
+++ b/test/benchmark/test-benchmark-mime.js
@@ -0,0 +1,7 @@
+'use strict';
+
+require('../common');
+
+const runBenchmark = require('../common/benchmark');
+
+runBenchmark('mime', { NODEJS_BENCHMARK_ZERO_ALLOWED: 1 });
diff --git a/test/benchmark/test-benchmark-validators.js b/test/benchmark/test-benchmark-validators.js
new file mode 100644
index 00000000000000..3a6caba9b0bb20
--- /dev/null
+++ b/test/benchmark/test-benchmark-validators.js
@@ -0,0 +1,10 @@
+'use strict';
+
+require('../common');
+
+// Minimal test for assert benchmarks. This makes sure the benchmarks aren't
+// completely broken but nothing more than that.
+
+const runBenchmark = require('../common/benchmark');
+
+runBenchmark('validators');
diff --git a/test/common/assertSnapshot.js b/test/common/assertSnapshot.js
index 0bd0fc18534f8b..88f40281e069b7 100644
--- a/test/common/assertSnapshot.js
+++ b/test/common/assertSnapshot.js
@@ -8,6 +8,10 @@ const assert = require('node:assert/strict');
 const stackFramesRegexp = /(?<=\n)(\s+)((.+?)\s+\()?(?:\(?(.+?):(\d+)(?::(\d+))?)\)?(\s+\{)?(\[\d+m)?(\n|$)/g;
 const windowNewlineRegexp = /\r/g;
 
+function replaceNodeVersion(str) {
+  return str.replaceAll(process.version, '*');
+}
+
 function replaceStackTrace(str, replacement = '$1*$7$8\n') {
   return str.replace(stackFramesRegexp, replacement);
 }
@@ -84,6 +88,7 @@ module.exports = {
   assertSnapshot,
   getSnapshotPath,
   replaceFullPaths,
+  replaceNodeVersion,
   replaceStackTrace,
   replaceWindowsLineEndings,
   replaceWindowsPaths,
diff --git a/test/common/debugger.js b/test/common/debugger.js
index 4aff5b9a0f74d9..d5d77fc7c648dd 100644
--- a/test/common/debugger.js
+++ b/test/common/debugger.js
@@ -4,7 +4,7 @@ const spawn = require('child_process').spawn;
 
 const BREAK_MESSAGE = new RegExp('(?:' + [
   'assert', 'break', 'break on start', 'debugCommand',
-  'exception', 'other', 'promiseRejection',
+  'exception', 'other', 'promiseRejection', 'step',
 ].join('|') + ') in', 'i');
 
 let TIMEOUT = common.platformTimeout(5000);
@@ -121,13 +121,13 @@ function startCLI(args, flags = [], spawnOpts = {}) {
     get breakInfo() {
       const output = this.output;
       const breakMatch =
-        output.match(/break (?:on start )?in ([^\n]+):(\d+)\n/i);
+        output.match(/(step |break (?:on start )?)in ([^\n]+):(\d+)\n/i);
 
       if (breakMatch === null) {
         throw new Error(
           `Could not find breakpoint info in ${JSON.stringify(output)}`);
       }
-      return { filename: breakMatch[1], line: +breakMatch[2] };
+      return { filename: breakMatch[2], line: +breakMatch[3] };
     },
 
     ctrlC() {
diff --git a/test/common/gc.js b/test/common/gc.js
new file mode 100644
index 00000000000000..af637af7bedcd6
--- /dev/null
+++ b/test/common/gc.js
@@ -0,0 +1,70 @@
+'use strict';
+
+// TODO(joyeecheung): merge ongc.js and gcUntil from common/index.js
+// into this.
+
+// This function can be used to check if an object factor leaks or not,
+// but it needs to be used with care:
+// 1. The test should be set up with an ideally small
+//   --max-old-space-size or --max-heap-size, which combined with
+//   the maxCount parameter can reproduce a leak of the objects
+//   created by fn().
+// 2. This works under the assumption that if *none* of the objects
+//   created by fn() can be garbage-collected, the test would crash due
+//   to OOM.
+// 3. If *any* of the objects created by fn() can be garbage-collected,
+//   it is considered leak-free. The FinalizationRegistry is used to
+//   terminate the test early once we detect any of the object is
+//   garbage-collected to make the test less prone to false positives.
+//   This may be especially important for memory management relying on
+//   emphemeron GC which can be inefficient to deal with extremely fast
+//   heap growth.
+// Note that this can still produce false positives. When the test using
+// this function still crashes due to OOM, inspect the heap to confirm
+// if a leak is present (e.g. using heap snapshots).
+// The generateSnapshotAt parameter can be used to specify a count
+// interval to create the heap snapshot which may enforce a more thorough GC.
+// This can be tried for code paths that require it for the GC to catch up
+// with heap growth. However this type of forced GC can be in conflict with
+// other logic in V8 such as bytecode aging, and it can slow down the test
+// significantly, so it should be used scarcely and only as a last resort.
+async function checkIfCollectable(
+  fn, maxCount = 4096, generateSnapshotAt = Infinity, logEvery = 128) {
+  let anyFinalized = false;
+  let count = 0;
+
+  const f = new FinalizationRegistry(() => {
+    anyFinalized = true;
+  });
+
+  async function createObject() {
+    const obj = await fn();
+    f.register(obj);
+    if (count++ < maxCount && !anyFinalized) {
+      setImmediate(createObject, 1);
+    }
+    // This can force a more thorough GC, but can slow the test down
+    // significantly in a big heap. Use it with care.
+    if (count % generateSnapshotAt === 0) {
+      // XXX(joyeecheung): This itself can consume a bit of JS heap memory,
+      // but the other alternative writeHeapSnapshot can run into disk space
+      // not enough problems in the CI & be slower depending on file system.
+      // Just do this for now as long as it works and only invent some
+      // internal voodoo when we absolutely have no other choice.
+      require('v8').getHeapSnapshot().pause().read();
+      console.log(`Generated heap snapshot at ${count}`);
+    }
+    if (count % logEvery === 0) {
+      console.log(`Created ${count} objects`);
+    }
+    if (anyFinalized) {
+      console.log(`Found finalized object at ${count}, stop testing`);
+    }
+  }
+
+  createObject();
+}
+
+module.exports = {
+  checkIfCollectable,
+};
diff --git a/test/common/globals.js b/test/common/globals.js
index f18b358e657a55..8b9b6b34f6abaf 100644
--- a/test/common/globals.js
+++ b/test/common/globals.js
@@ -123,6 +123,7 @@ const webIdlExposedWindow = new Set([
   'Headers',
   'Request',
   'Response',
+  'WebSocket',
 ]);
 
 const nodeGlobals = new Set([
diff --git a/test/common/index.js b/test/common/index.js
index c10dea59319264..6345a636a0f805 100644
--- a/test/common/index.js
+++ b/test/common/index.js
@@ -123,7 +123,6 @@ if (process.argv.length === 2 &&
 }
 
 const isWindows = process.platform === 'win32';
-const isAIX = process.platform === 'aix';
 const isSunOS = process.platform === 'sunos';
 const isFreeBSD = process.platform === 'freebsd';
 const isOpenBSD = process.platform === 'openbsd';
@@ -274,7 +273,7 @@ function platformTimeout(ms) {
   if (process.features.debug)
     ms = multipliers.two * ms;
 
-  if (isAIX)
+  if (exports.isAIX || exports.isIBMi)
     return multipliers.two * ms; // Default localhost speed is slower on AIX
 
   if (isPi)
@@ -370,6 +369,9 @@ if (global.ReadableStream) {
     global.DecompressionStream,
   );
 }
+if (global.WebSocket) {
+  knownGlobals.push(WebSocket);
+}
 
 function allowGlobals(...allowlist) {
   knownGlobals = knownGlobals.concat(allowlist);
@@ -720,9 +722,8 @@ function expectsError(validator, exact) {
       assert.fail(`Expected one argument, got ${inspect(args)}`);
     }
     const error = args.pop();
-    const descriptor = Object.getOwnPropertyDescriptor(error, 'message');
     // The error message should be non-enumerable
-    assert.strictEqual(descriptor.enumerable, false);
+    assert.strictEqual(Object.prototype.propertyIsEnumerable.call(error, 'message'), false);
 
     assert.throws(() => { throw error; }, validator);
     return true;
@@ -815,7 +816,7 @@ function invalidArgTypeHelper(input) {
   if (input == null) {
     return ` Received ${input}`;
   }
-  if (typeof input === 'function' && input.name) {
+  if (typeof input === 'function') {
     return ` Received function ${input.name}`;
   }
   if (typeof input === 'object') {
@@ -926,7 +927,6 @@ const common = {
   hasQuic,
   hasMultiLocalhost,
   invalidArgTypeHelper,
-  isAIX,
   isAlive,
   isAsan,
   isDumbTerminal,
@@ -997,7 +997,12 @@ const common = {
   },
 
   // On IBMi, process.platform and os.platform() both return 'aix',
+  // when built with Python versions earlier than 3.9.
   // It is not enough to differentiate between IBMi and real AIX system.
+  get isAIX() {
+    return require('os').type() === 'AIX';
+  },
+
   get isIBMi() {
     return require('os').type() === 'OS400';
   },
diff --git a/deps/npm/node_modules/jackspeak/dist/cjs/package.json b/test/common/package.json
similarity index 100%
rename from deps/npm/node_modules/jackspeak/dist/cjs/package.json
rename to test/common/package.json
diff --git a/test/embedding/embedtest.cc b/test/embedding/embedtest.cc
index a03dfbed93939c..689891f0d1a5bf 100644
--- a/test/embedding/embedtest.cc
+++ b/test/embedding/embedtest.cc
@@ -89,7 +89,7 @@ int RunNodeInstance(MultiIsolatePlatform* platform,
       snapshot_as_file = true;
     } else if (arg == "--embedder-snapshot-blob") {
       assert(i + 1 < args.size());
-      snapshot_blob_path = args[i + i];
+      snapshot_blob_path = args[i + 1];
       i++;
     } else {
       filtered_args.push_back(arg);
@@ -121,9 +121,10 @@ int RunNodeInstance(MultiIsolatePlatform* platform,
 
   if (is_building_snapshot) {
     // It contains at least the binary path, the code to snapshot,
-    // and --embedder-snapshot-create. Insert an anonymous filename
-    // as process.argv[1].
-    assert(filtered_args.size() >= 3);
+    // and --embedder-snapshot-create (which is filtered, so at least
+    // 2 arguments should remain after filtering).
+    assert(filtered_args.size() >= 2);
+    // Insert an anonymous filename as process.argv[1].
     filtered_args.insert(filtered_args.begin() + 1,
                          node::GetAnonymousMainPath());
   }
@@ -153,19 +154,26 @@ int RunNodeInstance(MultiIsolatePlatform* platform,
     Context::Scope context_scope(setup->context());
 
     MaybeLocal<Value> loadenv_ret;
-    if (snapshot) {
+    if (snapshot) {  // Deserializing snapshot
       loadenv_ret = node::LoadEnvironment(env, node::StartExecutionCallback{});
-    } else {
+    } else if (is_building_snapshot) {
+      // Environment created for snapshotting must set process.argv[1] to
+      // the name of the main script, which was inserted above.
       loadenv_ret = node::LoadEnvironment(
           env,
-          // Snapshots do not support userland require()s (yet)
-          "if (!require('v8').startupSnapshot.isBuildingSnapshot()) {"
-          "  const publicRequire ="
-          "    require('module').createRequire(process.cwd() + '/');"
-          "  globalThis.require = publicRequire;"
-          "} else globalThis.require = require;"
+          "const assert = require('assert');"
+          "assert(require('v8').startupSnapshot.isBuildingSnapshot());"
           "globalThis.embedVars = { nön_ascıı: '🏳️‍🌈' };"
+          "globalThis.require = require;"
           "require('vm').runInThisContext(process.argv[2]);");
+    } else {
+      loadenv_ret = node::LoadEnvironment(
+          env,
+          "const publicRequire = require('module').createRequire(process.cwd() "
+          "+ '/');"
+          "globalThis.require = publicRequire;"
+          "globalThis.embedVars = { nön_ascıı: '🏳️‍🌈' };"
+          "require('vm').runInThisContext(process.argv[1]);");
     }
 
     if (loadenv_ret.IsEmpty())  // There has been a JS exception.
diff --git a/test/embedding/test-embedding.js b/test/embedding/test-embedding.js
index 5d448b78a433e8..1fb3bc73f494cb 100644
--- a/test/embedding/test-embedding.js
+++ b/test/embedding/test-embedding.js
@@ -3,7 +3,10 @@ const common = require('../common');
 const fixtures = require('../common/fixtures');
 const tmpdir = require('../common/tmpdir');
 const assert = require('assert');
-const child_process = require('child_process');
+const {
+  spawnSyncAndExit,
+  spawnSyncAndExitWithoutError,
+} = require('../common/child_process');
 const path = require('path');
 const fs = require('fs');
 
@@ -21,39 +24,54 @@ function resolveBuiltBinary(bin) {
 
 const binary = resolveBuiltBinary('embedtest');
 
-assert.strictEqual(
-  child_process.spawnSync(binary, ['console.log(42)'])
-    .stdout.toString().trim(),
-  '42');
-
-assert.strictEqual(
-  child_process.spawnSync(binary, ['console.log(embedVars.nön_ascıı)'])
-    .stdout.toString().trim(),
-  '🏳️‍🌈');
-
-assert.strictEqual(
-  child_process.spawnSync(binary, ['console.log(42)'])
-    .stdout.toString().trim(),
-  '42');
+spawnSyncAndExitWithoutError(
+  binary,
+  ['console.log(42)'],
+  {
+    trim: true,
+    stdout: '42',
+  });
 
-assert.strictEqual(
-  child_process.spawnSync(binary, ['throw new Error()']).status,
-  1);
+spawnSyncAndExitWithoutError(
+  binary,
+  ['console.log(embedVars.nön_ascıı)'],
+  {
+    trim: true,
+    stdout: '🏳️‍🌈',
+  });
 
-// Cannot require internals anymore:
-assert.strictEqual(
-  child_process.spawnSync(binary, ['require("lib/internal/test/binding")']).status,
-  1);
+spawnSyncAndExit(
+  binary,
+  ['throw new Error()'],
+  {
+    status: 1,
+    signal: null,
+  });
 
-assert.strictEqual(
-  child_process.spawnSync(binary, ['process.exitCode = 8']).status,
-  8);
+spawnSyncAndExit(
+  binary,
+  ['require("lib/internal/test/binding")'],
+  {
+    status: 1,
+    signal: null,
+  });
 
+spawnSyncAndExit(
+  binary,
+  ['process.exitCode = 8'],
+  {
+    status: 8,
+    signal: null,
+  });
 
 const fixturePath = JSON.stringify(fixtures.path('exit.js'));
-assert.strictEqual(
-  child_process.spawnSync(binary, [`require(${fixturePath})`, 92]).status,
-  92);
+spawnSyncAndExit(
+  binary,
+  [`require(${fixturePath})`, 92],
+  {
+    status: 92,
+    signal: null,
+  });
 
 function getReadFileCodeForPath(path) {
   return `(require("fs").readFileSync(${JSON.stringify(path)}, "utf8"))`;
@@ -64,31 +82,49 @@ for (const extraSnapshotArgs of [[], ['--embedder-snapshot-as-file']]) {
   // readSync + eval since snapshots don't support userland require() (yet)
   const snapshotFixture = fixtures.path('snapshot', 'echo-args.js');
   const blobPath = tmpdir.resolve('embedder-snapshot.blob');
-  const buildSnapshotArgs = [
+  const buildSnapshotExecArgs = [
     `eval(${getReadFileCodeForPath(snapshotFixture)})`, 'arg1', 'arg2',
+  ];
+  const embedTestBuildArgs = [
     '--embedder-snapshot-blob', blobPath, '--embedder-snapshot-create',
     ...extraSnapshotArgs,
   ];
-  const runEmbeddedArgs = [
-    '--embedder-snapshot-blob', blobPath, ...extraSnapshotArgs, 'arg3', 'arg4',
+  const buildSnapshotArgs = [
+    ...buildSnapshotExecArgs,
+    ...embedTestBuildArgs,
+  ];
+
+  const runSnapshotExecArgs = [
+    'arg3', 'arg4',
+  ];
+  const embedTestRunArgs = [
+    '--embedder-snapshot-blob', blobPath,
+    ...extraSnapshotArgs,
+  ];
+  const runSnapshotArgs = [
+    ...runSnapshotExecArgs,
+    ...embedTestRunArgs,
   ];
 
   fs.rmSync(blobPath, { force: true });
-  const child = child_process.spawnSync(binary, [
-    '--', ...buildSnapshotArgs,
-  ], {
-    cwd: tmpdir.path,
-  });
-  if (child.status !== 0) {
-    console.log(child.stderr.toString());
-    console.log(child.stdout.toString());
-  }
-  assert.strictEqual(child.status, 0);
-  const spawnResult = child_process.spawnSync(binary, ['--', ...runEmbeddedArgs]);
-  assert.deepStrictEqual(JSON.parse(spawnResult.stdout), {
-    originalArgv: [binary, ...buildSnapshotArgs],
-    currentArgv: [binary, ...runEmbeddedArgs],
-  });
+  spawnSyncAndExitWithoutError(
+    binary,
+    [ '--', ...buildSnapshotArgs ],
+    { cwd: tmpdir.path },
+    {});
+  spawnSyncAndExitWithoutError(
+    binary,
+    [ '--', ...runSnapshotArgs ],
+    { cwd: tmpdir.path },
+    {
+      stdout(output) {
+        assert.deepStrictEqual(JSON.parse(output), {
+          originalArgv: [binary, '__node_anonymous_main', ...buildSnapshotExecArgs],
+          currentArgv: [binary, ...runSnapshotExecArgs],
+        });
+        return true;
+      },
+    });
 }
 
 // Create workers and vm contexts after deserialization
@@ -99,14 +135,20 @@ for (const extraSnapshotArgs of [[], ['--embedder-snapshot-as-file']]) {
     `eval(${getReadFileCodeForPath(snapshotFixture)})`,
     '--embedder-snapshot-blob', blobPath, '--embedder-snapshot-create',
   ];
+  const runEmbeddedArgs = [
+    '--embedder-snapshot-blob', blobPath,
+  ];
 
   fs.rmSync(blobPath, { force: true });
-  assert.strictEqual(child_process.spawnSync(binary, [
-    '--', ...buildSnapshotArgs,
-  ], {
-    cwd: tmpdir.path,
-  }).status, 0);
-  assert.strictEqual(
-    child_process.spawnSync(binary, ['--', '--embedder-snapshot-blob', blobPath]).status,
-    0);
+
+  spawnSyncAndExitWithoutError(
+    binary,
+    [ '--', ...buildSnapshotArgs ],
+    { cwd: tmpdir.path },
+    {});
+  spawnSyncAndExitWithoutError(
+    binary,
+    [ '--', ...runEmbeddedArgs ],
+    { cwd: tmpdir.path },
+    {});
 }
diff --git a/test/es-module/es-module.status b/test/es-module/es-module.status
index d986e94222a3e7..58a422dc152258 100644
--- a/test/es-module/es-module.status
+++ b/test/es-module/es-module.status
@@ -9,3 +9,7 @@ prefix es-module
 [$system==linux || $system==freebsd]
 # https://github.com/nodejs/node/issues/47836
 test-esm-loader-http-imports: PASS,FLAKY
+
+[$arch==arm || $arch==arm64]
+# https://github.com/nodejs/node/issues/47297
+test-wasm-web-api: SKIP
diff --git a/test/es-module/test-esm-assertionless-json-import.js b/test/es-module/test-esm-assertionless-json-import.js
index 23c71a1ba105d2..bd8acdae995a76 100644
--- a/test/es-module/test-esm-assertionless-json-import.js
+++ b/test/es-module/test-esm-assertionless-json-import.js
@@ -9,7 +9,7 @@ async function test() {
       import('../fixtures/experimental.json'),
       import(
         '../fixtures/experimental.json',
-        { assert: { type: 'json' } }
+        { with: { type: 'json' } }
       ),
     ]);
 
@@ -24,7 +24,7 @@ async function test() {
       import('../fixtures/experimental.json?test'),
       import(
         '../fixtures/experimental.json?test',
-        { assert: { type: 'json' } }
+        { with: { type: 'json' } }
       ),
     ]);
 
@@ -39,7 +39,7 @@ async function test() {
       import('../fixtures/experimental.json#test'),
       import(
         '../fixtures/experimental.json#test',
-        { assert: { type: 'json' } }
+        { with: { type: 'json' } }
       ),
     ]);
 
@@ -54,7 +54,7 @@ async function test() {
       import('../fixtures/experimental.json?test2#test'),
       import(
         '../fixtures/experimental.json?test2#test',
-        { assert: { type: 'json' } }
+        { with: { type: 'json' } }
       ),
     ]);
 
@@ -69,7 +69,7 @@ async function test() {
       import('data:application/json,{"ofLife":42}'),
       import(
         'data:application/json,{"ofLife":42}',
-        { assert: { type: 'json' } }
+        { with: { type: 'json' } }
       ),
     ]);
 
diff --git a/test/es-module/test-esm-data-urls.js b/test/es-module/test-esm-data-urls.js
index 7ba7c5f4fb1088..0817cf179df340 100644
--- a/test/es-module/test-esm-data-urls.js
+++ b/test/es-module/test-esm-data-urls.js
@@ -60,21 +60,21 @@ function createBase64URL(mime, body) {
   }
   {
     const ns = await import('data:application/json;foo="test,"this"',
-      { assert: { type: 'json' } });
+      { with: { type: 'json' } });
     assert.deepStrictEqual(Object.keys(ns), ['default']);
     assert.strictEqual(ns.default, 'this');
   }
   {
     const ns = await import(`data:application/json;foo=${
       encodeURIComponent('test,')
-    },0`, { assert: { type: 'json' } });
+    },0`, { with: { type: 'json' } });
     assert.deepStrictEqual(Object.keys(ns), ['default']);
     assert.strictEqual(ns.default, 0);
   }
   {
     await assert.rejects(async () =>
       import('data:application/json;foo="test,",0',
-        { assert: { type: 'json' } }), {
+        { with: { type: 'json' } }), {
       name: 'SyntaxError',
       message: /Unterminated string in JSON at position 3/
     });
@@ -82,14 +82,14 @@ function createBase64URL(mime, body) {
   {
     const body = '{"x": 1}';
     const plainESMURL = createURL('application/json', body);
-    const ns = await import(plainESMURL, { assert: { type: 'json' } });
+    const ns = await import(plainESMURL, { with: { type: 'json' } });
     assert.deepStrictEqual(Object.keys(ns), ['default']);
     assert.strictEqual(ns.default.x, 1);
   }
   {
     const body = '{"default": 2}';
     const plainESMURL = createURL('application/json', body);
-    const ns = await import(plainESMURL, { assert: { type: 'json' } });
+    const ns = await import(plainESMURL, { with: { type: 'json' } });
     assert.deepStrictEqual(Object.keys(ns), ['default']);
     assert.strictEqual(ns.default.default, 2);
   }
diff --git a/test/es-module/test-esm-dynamic-import-assertion.js b/test/es-module/test-esm-dynamic-import-attribute.js
similarity index 78%
rename from test/es-module/test-esm-dynamic-import-assertion.js
rename to test/es-module/test-esm-dynamic-import-attribute.js
index 71ef9cd1d1d30b..4558cd27ca4237 100644
--- a/test/es-module/test-esm-dynamic-import-assertion.js
+++ b/test/es-module/test-esm-dynamic-import-attribute.js
@@ -5,7 +5,7 @@ const { strictEqual } = require('assert');
 async function test() {
   {
     const results = await Promise.allSettled([
-      import('../fixtures/empty.js', { assert: { type: 'json' } }),
+      import('../fixtures/empty.js', { with: { type: 'json' } }),
       import('../fixtures/empty.js'),
     ]);
 
@@ -16,7 +16,7 @@ async function test() {
   {
     const results = await Promise.allSettled([
       import('../fixtures/empty.js'),
-      import('../fixtures/empty.js', { assert: { type: 'json' } }),
+      import('../fixtures/empty.js', { with: { type: 'json' } }),
     ]);
 
     strictEqual(results[0].status, 'fulfilled');
@@ -25,7 +25,7 @@ async function test() {
 
   {
     const results = await Promise.allSettled([
-      import('../fixtures/empty.json', { assert: { type: 'json' } }),
+      import('../fixtures/empty.json', { with: { type: 'json' } }),
       import('../fixtures/empty.json'),
     ]);
 
@@ -36,7 +36,7 @@ async function test() {
   {
     const results = await Promise.allSettled([
       import('../fixtures/empty.json'),
-      import('../fixtures/empty.json', { assert: { type: 'json' } }),
+      import('../fixtures/empty.json', { with: { type: 'json' } }),
     ]);
 
     strictEqual(results[0].status, 'rejected');
diff --git a/test/es-module/test-esm-dynamic-import-assertion.mjs b/test/es-module/test-esm-dynamic-import-attribute.mjs
similarity index 75%
rename from test/es-module/test-esm-dynamic-import-assertion.mjs
rename to test/es-module/test-esm-dynamic-import-attribute.mjs
index 4010259b743cbd..b3d2cb20c36e34 100644
--- a/test/es-module/test-esm-dynamic-import-assertion.mjs
+++ b/test/es-module/test-esm-dynamic-import-attribute.mjs
@@ -3,7 +3,7 @@ import { strictEqual } from 'assert';
 
 {
   const results = await Promise.allSettled([
-    import('../fixtures/empty.js', { assert: { type: 'json' } }),
+    import('../fixtures/empty.js', { with: { type: 'json' } }),
     import('../fixtures/empty.js'),
   ]);
 
@@ -14,7 +14,7 @@ import { strictEqual } from 'assert';
 {
   const results = await Promise.allSettled([
     import('../fixtures/empty.js'),
-    import('../fixtures/empty.js', { assert: { type: 'json' } }),
+    import('../fixtures/empty.js', { with: { type: 'json' } }),
   ]);
 
   strictEqual(results[0].status, 'fulfilled');
@@ -23,7 +23,7 @@ import { strictEqual } from 'assert';
 
 {
   const results = await Promise.allSettled([
-    import('../fixtures/empty.json', { assert: { type: 'json' } }),
+    import('../fixtures/empty.json', { with: { type: 'json' } }),
     import('../fixtures/empty.json'),
   ]);
 
@@ -34,7 +34,7 @@ import { strictEqual } from 'assert';
 {
   const results = await Promise.allSettled([
     import('../fixtures/empty.json'),
-    import('../fixtures/empty.json', { assert: { type: 'json' } }),
+    import('../fixtures/empty.json', { with: { type: 'json' } }),
   ]);
 
   strictEqual(results[0].status, 'rejected');
diff --git a/test/es-module/test-esm-experimental-warnings.mjs b/test/es-module/test-esm-experimental-warnings.mjs
index 85b458258b6134..d499aae0afc1cd 100644
--- a/test/es-module/test-esm-experimental-warnings.mjs
+++ b/test/es-module/test-esm-experimental-warnings.mjs
@@ -24,14 +24,18 @@ describe('ESM: warn for obsolete hooks provided', { concurrency: true }, () => {
 
   describe('experimental warnings for enabled experimental feature', () => {
     for (
-      const [experiment, arg] of [
-        [/Custom ESM Loaders/, `--experimental-loader=${fileURL('es-module-loaders', 'hooks-custom.mjs')}`],
+      const [experiment, ...args] of [
+        [
+          /`--experimental-loader` may be removed in the future/,
+          '--experimental-loader',
+          fileURL('es-module-loaders', 'hooks-custom.mjs'),
+        ],
         [/Network Imports/, '--experimental-network-imports'],
       ]
     ) {
       it(`should print for ${experiment.toString().replaceAll('/', '')}`, async () => {
         const { code, signal, stderr } = await spawnPromisified(execPath, [
-          arg,
+          ...args,
           '--input-type=module',
           '--eval',
           `import ${JSON.stringify(fileURL('es-module-loaders', 'module-named-exports.mjs'))}`,
diff --git a/test/es-module/test-esm-extensionless-esm-and-wasm.mjs b/test/es-module/test-esm-extensionless-esm-and-wasm.mjs
new file mode 100644
index 00000000000000..db20bc047feec1
--- /dev/null
+++ b/test/es-module/test-esm-extensionless-esm-and-wasm.mjs
@@ -0,0 +1,106 @@
+// Flags: --experimental-wasm-modules
+import { mustNotCall, spawnPromisified } from '../common/index.mjs';
+import * as fixtures from '../common/fixtures.mjs';
+import { describe, it } from 'node:test';
+import { match, ok, strictEqual } from 'node:assert';
+
+describe('extensionless ES modules within a "type": "module" package scope', { concurrency: true }, () => {
+  it('should run as the entry point', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      fixtures.path('es-modules/package-type-module/noext-esm'),
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, 'executed\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it('should be importable', async () => {
+    const { default: defaultExport } =
+              await import(fixtures.fileURL('es-modules/package-type-module/noext-esm'));
+    strictEqual(defaultExport, 'module');
+  });
+
+  it('should be importable from a module scope under node_modules', async () => {
+    const { default: defaultExport } =
+      await import(fixtures.fileURL(
+        'es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-esm'));
+    strictEqual(defaultExport, 'module');
+  });
+});
+describe('extensionless Wasm modules within a "type": "module" package scope', { concurrency: true }, () => {
+  it('should run as the entry point', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-wasm-modules',
+      '--no-warnings',
+      fixtures.path('es-modules/package-type-module/noext-wasm'),
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, 'executed\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it('should be importable', async () => {
+    const { add } = await import(fixtures.fileURL('es-modules/package-type-module/noext-wasm'));
+    strictEqual(add(1, 2), 3);
+  });
+
+  it('should be importable from a module scope under node_modules', async () => {
+    const { add } = await import(fixtures.fileURL(
+      'es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-wasm'));
+    strictEqual(add(1, 2), 3);
+  });
+});
+
+describe('extensionless ES modules within no package scope', { concurrency: true }, () => {
+  // This succeeds with `--experimental-default-type=module`
+  it('should error as the entry point', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      fixtures.path('es-modules/noext-esm'),
+    ]);
+
+    match(stderr, /SyntaxError/);
+    strictEqual(stdout, '');
+    strictEqual(code, 1);
+    strictEqual(signal, null);
+  });
+
+  // This succeeds with `--experimental-default-type=module`
+  it('should error on import', async () => {
+    try {
+      await import(fixtures.fileURL('es-modules/noext-esm'));
+      mustNotCall();
+    } catch (err) {
+      ok(err instanceof SyntaxError);
+    }
+  });
+});
+
+describe('extensionless Wasm within no package scope', { concurrency: true }, () => {
+  // This succeeds with `--experimental-default-type=module`
+  it('should error as the entry point', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-wasm-modules',
+      '--no-warnings',
+      fixtures.path('es-modules/noext-wasm'),
+    ]);
+
+    match(stderr, /SyntaxError/);
+    strictEqual(stdout, '');
+    strictEqual(code, 1);
+    strictEqual(signal, null);
+  });
+
+  // This succeeds with `--experimental-default-type=module`
+  it('should error on import', async () => {
+    try {
+      await import(fixtures.fileURL('es-modules/noext-wasm'));
+      mustNotCall();
+    } catch (err) {
+      ok(err instanceof SyntaxError);
+    }
+  });
+});
diff --git a/test/es-module/test-esm-import-assertion-2.mjs b/test/es-module/test-esm-import-assertion-2.mjs
deleted file mode 100644
index 8001c29772b1f0..00000000000000
--- a/test/es-module/test-esm-import-assertion-2.mjs
+++ /dev/null
@@ -1,6 +0,0 @@
-import '../common/index.mjs';
-import { strictEqual } from 'assert';
-
-import secret from '../fixtures/experimental.json' assert { type: 'json', unsupportedAssertion: 'should ignore' };
-
-strictEqual(secret.ofLife, 42);
diff --git a/test/es-module/test-esm-import-assertion-validation.js b/test/es-module/test-esm-import-assertion-validation.js
deleted file mode 100644
index ec2d2a2c08f7b5..00000000000000
--- a/test/es-module/test-esm-import-assertion-validation.js
+++ /dev/null
@@ -1,45 +0,0 @@
-// Flags: --expose-internals
-'use strict';
-const common = require('../common');
-
-const assert = require('assert');
-
-const { validateAssertions } = require('internal/modules/esm/assert');
-
-common.expectWarning(
-  'ExperimentalWarning',
-  'Import assertions are not a stable feature of the JavaScript language. ' +
-  'Avoid relying on their current behavior and syntax as those might change ' +
-  'in a future version of Node.js.'
-);
-
-
-const url = 'test://';
-
-assert.ok(validateAssertions(url, 'builtin', {}));
-assert.ok(validateAssertions(url, 'commonjs', {}));
-assert.ok(validateAssertions(url, 'json', { type: 'json' }));
-assert.ok(validateAssertions(url, 'module', {}));
-assert.ok(validateAssertions(url, 'wasm', {}));
-
-assert.throws(() => validateAssertions(url, 'json', {}), {
-  code: 'ERR_IMPORT_ASSERTION_TYPE_MISSING',
-});
-
-assert.throws(() => validateAssertions(url, 'module', { type: 'json' }), {
-  code: 'ERR_IMPORT_ASSERTION_TYPE_FAILED',
-});
-
-// The HTML spec specifically disallows this for now, while Wasm module import
-// and whether it will require a type assertion is still an open question.
-assert.throws(() => validateAssertions(url, 'module', { type: 'javascript' }), {
-  code: 'ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED',
-});
-
-assert.throws(() => validateAssertions(url, 'module', { type: 'css' }), {
-  code: 'ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED',
-});
-
-assert.throws(() => validateAssertions(url, 'module', { type: false }), {
-  code: 'ERR_INVALID_ARG_TYPE',
-});
diff --git a/test/es-module/test-esm-import-assertion-warning.mjs b/test/es-module/test-esm-import-assertion-warning.mjs
index 0b18d8ff9eaf62..a11b5164cebffc 100644
--- a/test/es-module/test-esm-import-assertion-warning.mjs
+++ b/test/es-module/test-esm-import-assertion-warning.mjs
@@ -1,10 +1,37 @@
-import { expectWarning } from '../common/index.mjs';
+import { spawnPromisified } from '../common/index.mjs';
+import assert from 'node:assert';
+import { execPath } from 'node:process';
 
-expectWarning(
-  'ExperimentalWarning',
-  'Import assertions are not a stable feature of the JavaScript language. ' +
-  'Avoid relying on their current behavior and syntax as those might change ' +
-  'in a future version of Node.js.'
-);
+await Promise.all([
+  // Using importAssertions in the resolve hook should warn but still work.
+  `data:text/javascript,export ${encodeURIComponent(function resolve() {
+    return { shortCircuit: true, url: 'data:application/json,1', importAssertions: { type: 'json' } };
+  })}`,
+  // Setting importAssertions on the context object of the load hook should warn but still work.
+  `data:text/javascript,export ${encodeURIComponent(function load(u, c, n) {
+    c.importAssertions = { type: 'json' };
+    return n('data:application/json,1', c);
+  })}`,
+  // Creating a new context object with importAssertions in the load hook should warn but still work.
+  `data:text/javascript,export ${encodeURIComponent(function load(u, c, n) {
+    return n('data:application/json,1', { importAssertions: { type: 'json' } });
+  })}`,
+].map(async (loaderURL) => {
+  const { stdout, stderr, code } = await spawnPromisified(execPath, [
+    '--input-type=module',
+    '--eval', `
+    import assert from 'node:assert';
+    import { register } from 'node:module';
+    
+    register(${JSON.stringify(loaderURL)});
+    
+    assert.deepStrictEqual(
+      { ...await import('data:') },
+      { default: 1 }
+      );`,
+  ]);
 
-await import('data:text/javascript,', { assert: { someUnsupportedKey: 'value' } });
+  assert.match(stderr, /Use `importAttributes` instead of `importAssertions`/);
+  assert.strictEqual(stdout, '');
+  assert.strictEqual(code, 0);
+}));
diff --git a/test/es-module/test-esm-import-assertion-1.mjs b/test/es-module/test-esm-import-attributes-1.mjs
similarity index 57%
rename from test/es-module/test-esm-import-assertion-1.mjs
rename to test/es-module/test-esm-import-attributes-1.mjs
index 72b3426bdbb601..c699a27bb51a75 100644
--- a/test/es-module/test-esm-import-assertion-1.mjs
+++ b/test/es-module/test-esm-import-attributes-1.mjs
@@ -1,6 +1,6 @@
 import '../common/index.mjs';
 import { strictEqual } from 'assert';
 
-import secret from '../fixtures/experimental.json' assert { type: 'json' };
+import secret from '../fixtures/experimental.json' with { type: 'json' };
 
 strictEqual(secret.ofLife, 42);
diff --git a/test/es-module/test-esm-import-assertion-4.mjs b/test/es-module/test-esm-import-attributes-2.mjs
similarity index 68%
rename from test/es-module/test-esm-import-assertion-4.mjs
rename to test/es-module/test-esm-import-attributes-2.mjs
index 547983e51f449a..85d6020019af05 100644
--- a/test/es-module/test-esm-import-assertion-4.mjs
+++ b/test/es-module/test-esm-import-attributes-2.mjs
@@ -1,10 +1,10 @@
 import '../common/index.mjs';
 import { strictEqual } from 'assert';
 
-import secret0 from '../fixtures/experimental.json' assert { type: 'json' };
+import secret0 from '../fixtures/experimental.json' with { type: 'json' };
 const secret1 = await import('../fixtures/experimental.json', {
-  assert: { type: 'json' },
-  });
+  with: { type: 'json' },
+});
 
 strictEqual(secret0.ofLife, 42);
 strictEqual(secret1.default.ofLife, 42);
diff --git a/test/es-module/test-esm-import-assertion-3.mjs b/test/es-module/test-esm-import-attributes-3.mjs
similarity index 69%
rename from test/es-module/test-esm-import-assertion-3.mjs
rename to test/es-module/test-esm-import-attributes-3.mjs
index b9de9232cfff4d..8950ca5c595e12 100644
--- a/test/es-module/test-esm-import-assertion-3.mjs
+++ b/test/es-module/test-esm-import-attributes-3.mjs
@@ -1,9 +1,9 @@
 import '../common/index.mjs';
 import { strictEqual } from 'assert';
 
-import secret0 from '../fixtures/experimental.json' assert { type: 'json' };
+import secret0 from '../fixtures/experimental.json' with { type: 'json' };
 const secret1 = await import('../fixtures/experimental.json',
-  { assert: { type: 'json' } });
+  { with: { type: 'json' } });
 
 strictEqual(secret0.ofLife, 42);
 strictEqual(secret1.default.ofLife, 42);
diff --git a/test/es-module/test-esm-import-assertion-errors.js b/test/es-module/test-esm-import-attributes-errors.js
similarity index 59%
rename from test/es-module/test-esm-import-assertion-errors.js
rename to test/es-module/test-esm-import-attributes-errors.js
index e2abd3fb43976d..4521248db176e5 100644
--- a/test/es-module/test-esm-import-assertion-errors.js
+++ b/test/es-module/test-esm-import-attributes-errors.js
@@ -5,31 +5,29 @@ const { rejects } = require('assert');
 const jsModuleDataUrl = 'data:text/javascript,export{}';
 const jsonModuleDataUrl = 'data:application/json,""';
 
-common.expectWarning(
-  'ExperimentalWarning',
-  'Import assertions are not a stable feature of the JavaScript language. ' +
-  'Avoid relying on their current behavior and syntax as those might change ' +
-  'in a future version of Node.js.'
-);
-
 async function test() {
   await rejects(
-    import('data:text/css,', { assert: { type: 'css' } }),
+    import('data:text/css,', { with: { type: 'css' } }),
     { code: 'ERR_UNKNOWN_MODULE_FORMAT' }
   );
 
   await rejects(
-    import(`data:text/javascript,import${JSON.stringify(jsModuleDataUrl)}assert{type:"json"}`),
+    import('data:text/css,', { with: { unsupportedAttribute: 'value' } }),
+    { code: 'ERR_IMPORT_ATTRIBUTE_UNSUPPORTED' }
+  );
+
+  await rejects(
+    import(`data:text/javascript,import${JSON.stringify(jsModuleDataUrl)}with{type:"json"}`),
     { code: 'ERR_IMPORT_ASSERTION_TYPE_FAILED' }
   );
 
   await rejects(
-    import(jsModuleDataUrl, { assert: { type: 'json' } }),
+    import(jsModuleDataUrl, { with: { type: 'json' } }),
     { code: 'ERR_IMPORT_ASSERTION_TYPE_FAILED' }
   );
 
   await rejects(
-    import(jsModuleDataUrl, { assert: { type: 'unsupported' } }),
+    import(jsModuleDataUrl, { with: { type: 'unsupported' } }),
     { code: 'ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED' }
   );
 
@@ -39,17 +37,17 @@ async function test() {
   );
 
   await rejects(
-    import(jsonModuleDataUrl, { assert: {} }),
+    import(jsonModuleDataUrl, { with: {} }),
     { code: 'ERR_IMPORT_ASSERTION_TYPE_MISSING' }
   );
 
   await rejects(
-    import(jsonModuleDataUrl, { assert: { foo: 'bar' } }),
+    import(jsonModuleDataUrl, { with: { foo: 'bar' } }),
     { code: 'ERR_IMPORT_ASSERTION_TYPE_MISSING' }
   );
 
   await rejects(
-    import(jsonModuleDataUrl, { assert: { type: 'unsupported' }}),
+    import(jsonModuleDataUrl, { with: { type: 'unsupported' } }),
     { code: 'ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED' }
   );
 }
diff --git a/test/es-module/test-esm-import-assertion-errors.mjs b/test/es-module/test-esm-import-attributes-errors.mjs
similarity index 56%
rename from test/es-module/test-esm-import-assertion-errors.mjs
rename to test/es-module/test-esm-import-attributes-errors.mjs
index 9cc08c06528fc6..ff932636e39a5f 100644
--- a/test/es-module/test-esm-import-assertion-errors.mjs
+++ b/test/es-module/test-esm-import-attributes-errors.mjs
@@ -1,36 +1,28 @@
-import { expectWarning } from '../common/index.mjs';
+import '../common/index.mjs';
 import { rejects } from 'assert';
 
 const jsModuleDataUrl = 'data:text/javascript,export{}';
 const jsonModuleDataUrl = 'data:application/json,""';
 
-expectWarning(
-  'ExperimentalWarning',
-  'Import assertions are not a stable feature of the JavaScript language. ' +
-  'Avoid relying on their current behavior and syntax as those might change ' +
-  'in a future version of Node.js.'
-);
-
-
 await rejects(
   // This rejects because of the unsupported MIME type, not because of the
   // unsupported assertion.
-  import('data:text/css,', { assert: { type: 'css' } }),
+  import('data:text/css,', { with: { type: 'css' } }),
   { code: 'ERR_UNKNOWN_MODULE_FORMAT' }
 );
 
 await rejects(
-  import(`data:text/javascript,import${JSON.stringify(jsModuleDataUrl)}assert{type:"json"}`),
+  import(`data:text/javascript,import${JSON.stringify(jsModuleDataUrl)}with{type:"json"}`),
   { code: 'ERR_IMPORT_ASSERTION_TYPE_FAILED' }
 );
 
 await rejects(
-  import(jsModuleDataUrl, { assert: { type: 'json' } }),
+  import(jsModuleDataUrl, { with: { type: 'json' } }),
   { code: 'ERR_IMPORT_ASSERTION_TYPE_FAILED' }
 );
 
 await rejects(
-  import(import.meta.url, { assert: { type: 'unsupported' } }),
+  import(import.meta.url, { with: { type: 'unsupported' } }),
   { code: 'ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED' }
 );
 
@@ -40,16 +32,16 @@ await rejects(
 );
 
 await rejects(
-  import(jsonModuleDataUrl, { assert: {} }),
+  import(jsonModuleDataUrl, { with: {} }),
   { code: 'ERR_IMPORT_ASSERTION_TYPE_MISSING' }
 );
 
 await rejects(
-  import(jsonModuleDataUrl, { assert: { foo: 'bar' } }),
+  import(jsonModuleDataUrl, { with: { foo: 'bar' } }),
   { code: 'ERR_IMPORT_ASSERTION_TYPE_MISSING' }
 );
 
 await rejects(
-  import(jsonModuleDataUrl, { assert: { type: 'unsupported' }}),
+  import(jsonModuleDataUrl, { with: { type: 'unsupported' } }),
   { code: 'ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED' }
 );
diff --git a/test/es-module/test-esm-import-attributes-validation.js b/test/es-module/test-esm-import-attributes-validation.js
new file mode 100644
index 00000000000000..f436f7073126d7
--- /dev/null
+++ b/test/es-module/test-esm-import-attributes-validation.js
@@ -0,0 +1,45 @@
+// Flags: --expose-internals
+'use strict';
+require('../common');
+
+const assert = require('assert');
+
+const { validateAttributes } = require('internal/modules/esm/assert');
+
+const url = 'test://';
+
+assert.ok(validateAttributes(url, 'builtin', {}));
+assert.ok(validateAttributes(url, 'commonjs', {}));
+assert.ok(validateAttributes(url, 'json', { type: 'json' }));
+assert.ok(validateAttributes(url, 'module', {}));
+assert.ok(validateAttributes(url, 'wasm', {}));
+
+assert.throws(() => validateAttributes(url, 'json', {}), {
+  code: 'ERR_IMPORT_ASSERTION_TYPE_MISSING',
+});
+
+assert.throws(() => validateAttributes(url, 'json', { type: 'json', unsupportedAttribute: 'value' }), {
+  code: 'ERR_IMPORT_ATTRIBUTE_UNSUPPORTED',
+});
+
+assert.throws(() => validateAttributes(url, 'module', { unsupportedAttribute: 'value' }), {
+  code: 'ERR_IMPORT_ATTRIBUTE_UNSUPPORTED',
+});
+
+assert.throws(() => validateAttributes(url, 'module', { type: 'json' }), {
+  code: 'ERR_IMPORT_ASSERTION_TYPE_FAILED',
+});
+
+// The HTML spec specifically disallows this for now, while Wasm module import
+// and whether it will require a type assertion is still an open question.
+assert.throws(() => validateAttributes(url, 'module', { type: 'javascript' }), {
+  code: 'ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED',
+});
+
+assert.throws(() => validateAttributes(url, 'module', { type: 'css' }), {
+  code: 'ERR_IMPORT_ASSERTION_TYPE_UNSUPPORTED',
+});
+
+assert.throws(() => validateAttributes(url, 'module', { type: false }), {
+  code: 'ERR_INVALID_ARG_TYPE',
+});
diff --git a/test/es-module/test-esm-import-meta-resolve.mjs b/test/es-module/test-esm-import-meta-resolve.mjs
index 8495c161312822..a6435655750c88 100644
--- a/test/es-module/test-esm-import-meta-resolve.mjs
+++ b/test/es-module/test-esm-import-meta-resolve.mjs
@@ -9,10 +9,8 @@ const fixtures = dirname.slice(0, dirname.lastIndexOf('/', dirname.length - 2) +
 
 assert.strictEqual(import.meta.resolve('./test-esm-import-meta.mjs'),
                    dirname + 'test-esm-import-meta.mjs');
-const notFound = import.meta.resolve('./notfound.mjs');
-assert.strictEqual(new URL(notFound).href, new URL('./notfound.mjs', import.meta.url).href);
-const noExtension = import.meta.resolve('./asset');
-assert.strictEqual(new URL(noExtension).href, new URL('./asset', import.meta.url).href);
+assert.strictEqual(import.meta.resolve('./notfound.mjs'), new URL('./notfound.mjs', import.meta.url).href);
+assert.strictEqual(import.meta.resolve('./asset'), new URL('./asset', import.meta.url).href);
 try {
   import.meta.resolve('does-not-exist');
   assert.fail();
diff --git a/test/es-module/test-esm-json-cache.mjs b/test/es-module/test-esm-json-cache.mjs
index b766519d663f9a..f8d24fd394a4a2 100644
--- a/test/es-module/test-esm-json-cache.mjs
+++ b/test/es-module/test-esm-json-cache.mjs
@@ -6,7 +6,7 @@ import { createRequire } from 'module';
 
 import mod from '../fixtures/es-modules/json-cache/mod.cjs';
 import another from '../fixtures/es-modules/json-cache/another.cjs';
-import test from '../fixtures/es-modules/json-cache/test.json' assert
+import test from '../fixtures/es-modules/json-cache/test.json' with
   { type: 'json' };
 
 const require = createRequire(import.meta.url);
diff --git a/test/es-module/test-esm-json.mjs b/test/es-module/test-esm-json.mjs
index 2740c0097f77da..422a8f717594ab 100644
--- a/test/es-module/test-esm-json.mjs
+++ b/test/es-module/test-esm-json.mjs
@@ -2,9 +2,12 @@ import { spawnPromisified } from '../common/index.mjs';
 import * as fixtures from '../common/fixtures.mjs';
 import assert from 'node:assert';
 import { execPath } from 'node:process';
-import { describe, it } from 'node:test';
+import { describe, it, test } from 'node:test';
 
-import secret from '../fixtures/experimental.json' assert { type: 'json' };
+import { mkdir, rm, writeFile } from 'node:fs/promises';
+import * as tmpdir from '../common/tmpdir.js';
+
+import secret from '../fixtures/experimental.json' with { type: 'json' };
 
 describe('ESM: importing JSON', () => {
   it('should load JSON', () => {
@@ -17,8 +20,64 @@ describe('ESM: importing JSON', () => {
     ]);
 
     assert.match(stderr, /ExperimentalWarning: Importing JSON modules/);
-    assert.match(stderr, /ExperimentalWarning: Import assertions/);
     assert.strictEqual(code, 0);
     assert.strictEqual(signal, null);
   });
+
+  test('should load different modules when the URL is different', async (t) => {
+    const root = tmpdir.fileURL(`./test-esm-json-${Math.random()}/`);
+    try {
+      await mkdir(root, { recursive: true });
+
+      await t.test('json', async () => {
+        let i = 0;
+        const url = new URL('./foo.json', root);
+        await writeFile(url, JSON.stringify({ id: i++ }));
+        const absoluteURL = await import(`${url}`, {
+          with: { type: 'json' },
+        });
+        await writeFile(url, JSON.stringify({ id: i++ }));
+        const queryString = await import(`${url}?a=2`, {
+          with: { type: 'json' },
+        });
+        await writeFile(url, JSON.stringify({ id: i++ }));
+        const hash = await import(`${url}#a=2`, {
+          with: { type: 'json' },
+        });
+        await writeFile(url, JSON.stringify({ id: i++ }));
+        const queryStringAndHash = await import(`${url}?a=2#a=2`, {
+          with: { type: 'json' },
+        });
+
+        assert.notDeepStrictEqual(absoluteURL, queryString);
+        assert.notDeepStrictEqual(absoluteURL, hash);
+        assert.notDeepStrictEqual(queryString, hash);
+        assert.notDeepStrictEqual(absoluteURL, queryStringAndHash);
+        assert.notDeepStrictEqual(queryString, queryStringAndHash);
+        assert.notDeepStrictEqual(hash, queryStringAndHash);
+      });
+
+      await t.test('js', async () => {
+        let i = 0;
+        const url = new URL('./foo.mjs', root);
+        await writeFile(url, `export default ${JSON.stringify({ id: i++ })}\n`);
+        const absoluteURL = await import(`${url}`);
+        await writeFile(url, `export default ${JSON.stringify({ id: i++ })}\n`);
+        const queryString = await import(`${url}?a=1`);
+        await writeFile(url, `export default ${JSON.stringify({ id: i++ })}\n`);
+        const hash = await import(`${url}#a=1`);
+        await writeFile(url, `export default ${JSON.stringify({ id: i++ })}\n`);
+        const queryStringAndHash = await import(`${url}?a=1#a=1`);
+
+        assert.notDeepStrictEqual(absoluteURL, queryString);
+        assert.notDeepStrictEqual(absoluteURL, hash);
+        assert.notDeepStrictEqual(queryString, hash);
+        assert.notDeepStrictEqual(absoluteURL, queryStringAndHash);
+        assert.notDeepStrictEqual(queryString, queryStringAndHash);
+        assert.notDeepStrictEqual(hash, queryStringAndHash);
+      });
+    } finally {
+      await rm(root, { force: true, recursive: true });
+    }
+  });
 });
diff --git a/test/es-module/test-esm-loader-default-resolver.mjs b/test/es-module/test-esm-loader-default-resolver.mjs
index 27320fcfcfe862..2a69010e05047f 100644
--- a/test/es-module/test-esm-loader-default-resolver.mjs
+++ b/test/es-module/test-esm-loader-default-resolver.mjs
@@ -49,4 +49,18 @@ describe('default resolver', () => {
     assert.strictEqual(stdout.trim(), 'index.byoe!');
     assert.strictEqual(stderr, '');
   });
+
+  it('should identify the parent module of an invalid URL host in import specifier', async () => {
+    if (process.platform === 'win32') return;
+
+    const { code, stderr } = await spawnPromisified(execPath, [
+      '--no-warnings',
+      fixtures.path('es-modules', 'invalid-posix-host.mjs'),
+    ]);
+
+    assert.match(stderr, /ERR_INVALID_FILE_URL_HOST/);
+    assert.match(stderr, /file:\/\/hmm\.js/);
+    assert.match(stderr, /invalid-posix-host\.mjs/);
+    assert.strictEqual(code, 1);
+  });
 });
diff --git a/test/es-module/test-esm-loader-hooks.mjs b/test/es-module/test-esm-loader-hooks.mjs
index 7ff1fc520d90b5..a4c2f52d0df367 100644
--- a/test/es-module/test-esm-loader-hooks.mjs
+++ b/test/es-module/test-esm-loader-hooks.mjs
@@ -517,6 +517,37 @@ describe('Loader hooks', { concurrency: true }, () => {
       assert.strictEqual(signal, null);
     });
 
+    it('should have `register` accept URL objects as `parentURL`', async () => {
+      const { code, signal, stdout, stderr } = await spawnPromisified(execPath, [
+        '--no-warnings',
+        '--import',
+        `data:text/javascript,${encodeURIComponent(
+          'import{ register } from "node:module";' +
+          'import { pathToFileURL } from "node:url";' +
+          'register("./hooks-initialize.mjs", pathToFileURL("./"));'
+        )}`,
+        '--input-type=module',
+        '--eval',
+        `
+        import {register} from 'node:module';
+        register(
+          ${JSON.stringify(fixtures.fileURL('es-module-loaders/loader-load-foo-or-42.mjs'))},
+          new URL('data:'),
+        );
+
+        import('node:os').then((result) => {
+          console.log(JSON.stringify(result));
+        });
+        `,
+      ], { cwd: fixtures.fileURL('es-module-loaders/') });
+
+      assert.strictEqual(stderr, '');
+      assert.deepStrictEqual(stdout.split('\n').sort(), ['hooks initialize 1', '{"default":"foo"}', ''].sort());
+
+      assert.strictEqual(code, 0);
+      assert.strictEqual(signal, null);
+    });
+
     it('should have `register` work with cjs', async () => {
       const { code, signal, stdout, stderr } = await spawnPromisified(execPath, [
         '--no-warnings',
diff --git a/test/es-module/test-esm-type-flag-errors.js b/test/es-module/test-esm-type-field-errors.js
similarity index 100%
rename from test/es-module/test-esm-type-flag-errors.js
rename to test/es-module/test-esm-type-field-errors.js
diff --git a/test/es-module/test-esm-type-flag.mjs b/test/es-module/test-esm-type-field.mjs
similarity index 100%
rename from test/es-module/test-esm-type-flag.mjs
rename to test/es-module/test-esm-type-field.mjs
diff --git a/test/es-module/test-esm-type-flag-cli-entry.mjs b/test/es-module/test-esm-type-flag-cli-entry.mjs
new file mode 100644
index 00000000000000..002840751532ff
--- /dev/null
+++ b/test/es-module/test-esm-type-flag-cli-entry.mjs
@@ -0,0 +1,92 @@
+import { spawnPromisified } from '../common/index.mjs';
+import * as fixtures from '../common/fixtures.mjs';
+import { describe, it } from 'node:test';
+import { match, strictEqual } from 'node:assert';
+
+describe('--experimental-default-type=module should not support extension searching', { concurrency: true }, () => {
+  it('should support extension searching under --experimental-default-type=commonjs', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=commonjs',
+      'index',
+    ], {
+      cwd: fixtures.path('es-modules/package-without-type'),
+    });
+
+    strictEqual(stdout, 'package-without-type\n');
+    strictEqual(stderr, '');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it('should error with implicit extension under --experimental-default-type=module', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      'index',
+    ], {
+      cwd: fixtures.path('es-modules/package-without-type'),
+    });
+
+    match(stderr, /ENOENT.*Did you mean to import .*index\.js\?/s);
+    strictEqual(stdout, '');
+    strictEqual(code, 1);
+    strictEqual(signal, null);
+  });
+});
+
+describe('--experimental-default-type=module should not parse paths as URLs', { concurrency: true }, () => {
+  it('should not parse a `?` in a filename as starting a query string', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      'file#1.js',
+    ], {
+      cwd: fixtures.path('es-modules/package-without-type'),
+    });
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, 'file#1\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it('should resolve `..`', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      '../package-without-type/file#1.js',
+    ], {
+      cwd: fixtures.path('es-modules/package-without-type'),
+    });
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, 'file#1\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it('should allow a leading `./`', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      './file#1.js',
+    ], {
+      cwd: fixtures.path('es-modules/package-without-type'),
+    });
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, 'file#1\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it('should not require a leading `./`', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      'file#1.js',
+    ], {
+      cwd: fixtures.path('es-modules/package-without-type'),
+    });
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, 'file#1\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+});
diff --git a/test/es-module/test-esm-type-flag-errors.mjs b/test/es-module/test-esm-type-flag-errors.mjs
new file mode 100644
index 00000000000000..6d54eff94763ef
--- /dev/null
+++ b/test/es-module/test-esm-type-flag-errors.mjs
@@ -0,0 +1,31 @@
+import { spawnPromisified } from '../common/index.mjs';
+import * as fixtures from '../common/fixtures.mjs';
+import { describe, it } from 'node:test';
+import { match, strictEqual } from 'node:assert';
+
+describe('--experimental-default-type=module should not affect the interpretation of files with unknown extensions',
+         { concurrency: true }, () => {
+           it('should error on an entry point with an unknown extension', async () => {
+             const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+               '--experimental-default-type=module',
+               fixtures.path('es-modules/package-type-module/extension.unknown'),
+             ]);
+
+             match(stderr, /ERR_UNKNOWN_FILE_EXTENSION/);
+             strictEqual(stdout, '');
+             strictEqual(code, 1);
+             strictEqual(signal, null);
+           });
+
+           it('should error on an import with an unknown extension', async () => {
+             const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+               '--experimental-default-type=module',
+               fixtures.path('es-modules/package-type-module/imports-unknownext.mjs'),
+             ]);
+
+             match(stderr, /ERR_UNKNOWN_FILE_EXTENSION/);
+             strictEqual(stdout, '');
+             strictEqual(code, 1);
+             strictEqual(signal, null);
+           });
+         });
diff --git a/test/es-module/test-esm-type-flag-loose-files.mjs b/test/es-module/test-esm-type-flag-loose-files.mjs
new file mode 100644
index 00000000000000..ed95e1807f57c7
--- /dev/null
+++ b/test/es-module/test-esm-type-flag-loose-files.mjs
@@ -0,0 +1,75 @@
+// Flags: --experimental-default-type=module --experimental-wasm-modules
+import { spawnPromisified } from '../common/index.mjs';
+import * as fixtures from '../common/fixtures.mjs';
+import { describe, it } from 'node:test';
+import { strictEqual } from 'node:assert';
+
+describe('the type flag should change the interpretation of certain files outside of any package scope',
+         { concurrency: true }, () => {
+           it('should run as ESM a .js file that is outside of any package scope', async () => {
+             const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+               '--experimental-default-type=module',
+               fixtures.path('es-modules/loose.js'),
+             ]);
+
+             strictEqual(stderr, '');
+             strictEqual(stdout, 'executed\n');
+             strictEqual(code, 0);
+             strictEqual(signal, null);
+           });
+
+           it('should run as ESM an extensionless JavaScript file that is outside of any package scope', async () => {
+             const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+               '--experimental-default-type=module',
+               fixtures.path('es-modules/noext-esm'),
+             ]);
+
+             strictEqual(stderr, '');
+             strictEqual(stdout, 'executed\n');
+             strictEqual(code, 0);
+             strictEqual(signal, null);
+           });
+
+           it('should run as Wasm an extensionless Wasm file that is outside of any package scope', async () => {
+             const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+               '--experimental-default-type=module',
+               '--experimental-wasm-modules',
+               '--no-warnings',
+               fixtures.path('es-modules/noext-wasm'),
+             ]);
+
+             strictEqual(stderr, '');
+             strictEqual(stdout, '');
+             strictEqual(code, 0);
+             strictEqual(signal, null);
+           });
+
+           it('should import as ESM a .js file that is outside of any package scope', async () => {
+             const { default: defaultExport } = await import(fixtures.fileURL('es-modules/loose.js'));
+             strictEqual(defaultExport, 'module');
+           });
+
+           it('should import as ESM an extensionless JavaScript file that is outside of any package scope',
+              async () => {
+                const { default: defaultExport } = await import(fixtures.fileURL('es-modules/noext-esm'));
+                strictEqual(defaultExport, 'module');
+              });
+
+           it('should import as Wasm an extensionless Wasm file that is outside of any package scope', async () => {
+             const { add } = await import(fixtures.fileURL('es-modules/noext-wasm'));
+             strictEqual(add(1, 2), 3);
+           });
+
+           it('should check as ESM input passed via --check', async () => {
+             const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+               '--experimental-default-type=module',
+               '--check',
+               fixtures.path('es-modules/loose.js'),
+             ]);
+
+             strictEqual(stderr, '');
+             strictEqual(stdout, '');
+             strictEqual(code, 0);
+             strictEqual(signal, null);
+           });
+         });
diff --git a/test/es-module/test-esm-type-flag-package-scopes.mjs b/test/es-module/test-esm-type-flag-package-scopes.mjs
new file mode 100644
index 00000000000000..bf9d7d7ca4944c
--- /dev/null
+++ b/test/es-module/test-esm-type-flag-package-scopes.mjs
@@ -0,0 +1,167 @@
+// Flags: --experimental-default-type=module --experimental-wasm-modules
+import { spawnPromisified } from '../common/index.mjs';
+import * as fixtures from '../common/fixtures.mjs';
+import { describe, it } from 'node:test';
+import { strictEqual } from 'node:assert';
+
+describe('the type flag should change the interpretation of certain files within a "type": "module" package scope',
+         { concurrency: true }, () => {
+           it('should run as ESM an extensionless JavaScript file within a "type": "module" scope', async () => {
+             const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+               '--experimental-default-type=module',
+               fixtures.path('es-modules/package-type-module/noext-esm'),
+             ]);
+
+             strictEqual(stderr, '');
+             strictEqual(stdout, 'executed\n');
+             strictEqual(code, 0);
+             strictEqual(signal, null);
+           });
+
+           it('should import an extensionless JavaScript file within a "type": "module" scope', async () => {
+             const { default: defaultExport } =
+              await import(fixtures.fileURL('es-modules/package-type-module/noext-esm'));
+             strictEqual(defaultExport, 'module');
+           });
+
+           it('should import an extensionless JavaScript file within a "type": "module" scope under node_modules',
+              async () => {
+                const { default: defaultExport } =
+                await import(fixtures.fileURL(
+                  'es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-esm'));
+                strictEqual(defaultExport, 'module');
+              });
+
+           it('should run as Wasm an extensionless Wasm file within a "type": "module" scope', async () => {
+             const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+               '--experimental-default-type=module',
+               '--experimental-wasm-modules',
+               '--no-warnings',
+               fixtures.path('es-modules/package-type-module/noext-wasm'),
+             ]);
+
+             strictEqual(stderr, '');
+             strictEqual(stdout, 'executed\n');
+             strictEqual(code, 0);
+             strictEqual(signal, null);
+           });
+
+           it('should import as Wasm an extensionless Wasm file within a "type": "module" scope', async () => {
+             const { add } = await import(fixtures.fileURL('es-modules/package-type-module/noext-wasm'));
+             strictEqual(add(1, 2), 3);
+           });
+
+           it('should import an extensionless Wasm file within a "type": "module" scope under node_modules',
+              async () => {
+                const { add } = await import(fixtures.fileURL(
+                  'es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-wasm'));
+                strictEqual(add(1, 2), 3);
+              });
+         });
+
+describe(`the type flag should change the interpretation of certain files within a package scope that lacks a
+"type" field and is not under node_modules`, { concurrency: true }, () => {
+  it('should run as ESM a .js file within package scope that has no defined "type" and is not under node_modules',
+     async () => {
+       const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+         '--experimental-default-type=module',
+         fixtures.path('es-modules/package-without-type/module.js'),
+       ]);
+
+       strictEqual(stderr, '');
+       strictEqual(stdout, 'executed\n');
+       strictEqual(code, 0);
+       strictEqual(signal, null);
+     });
+
+  it(`should run as ESM an extensionless JavaScript file within a package scope that has no defined "type" and is not
+under node_modules`, async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      fixtures.path('es-modules/package-without-type/noext-esm'),
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, 'executed\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it(`should run as Wasm an extensionless Wasm file within a package scope that has no defined "type" and is not under
+  node_modules`, async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      '--experimental-wasm-modules',
+      '--no-warnings',
+      fixtures.path('es-modules/noext-wasm'),
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, '');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it('should import as ESM a .js file within package scope that has no defined "type" and is not under node_modules',
+     async () => {
+       const { default: defaultExport } = await import(fixtures.fileURL('es-modules/package-without-type/module.js'));
+       strictEqual(defaultExport, 'module');
+     });
+
+  it(`should import as ESM an extensionless JavaScript file within a package scope that has no defined "type" and is
+  not under node_modules`, async () => {
+    const { default: defaultExport } = await import(fixtures.fileURL('es-modules/package-without-type/noext-esm'));
+    strictEqual(defaultExport, 'module');
+  });
+
+  it(`should import as Wasm an extensionless Wasm file within a package scope that has no defined "type" and is not
+  under node_modules`, async () => {
+    const { add } = await import(fixtures.fileURL('es-modules/noext-wasm'));
+    strictEqual(add(1, 2), 3);
+  });
+});
+
+describe(`the type flag should NOT change the interpretation of certain files within a package scope that lacks a
+"type" field and is under node_modules`, { concurrency: true }, () => {
+  it('should run as CommonJS a .js file within package scope that has no defined "type" and is under node_modules',
+     async () => {
+       const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+         '--experimental-default-type=module',
+         fixtures.path('es-modules/package-type-module/node_modules/dep-with-package-json-without-type/run.js'),
+       ]);
+
+       strictEqual(stderr, '');
+       strictEqual(stdout, 'executed\n');
+       strictEqual(code, 0);
+       strictEqual(signal, null);
+     });
+
+  it(`should import as CommonJS a .js file within a package scope that has no defined "type" and is under
+  node_modules`, async () => {
+    const { default: defaultExport } =
+      await import(fixtures.fileURL(
+        'es-modules/package-type-module/node_modules/dep-with-package-json-without-type/run.js'));
+    strictEqual(defaultExport, 42);
+  });
+
+  it(`should run as CommonJS an extensionless JavaScript file within a package scope that has no defined "type" and is
+  under node_modules`, async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      fixtures.path('es-modules/package-type-module/node_modules/dep-with-package-json-without-type/noext-cjs'),
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, 'executed\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  it(`should import as CommonJS an extensionless JavaScript file within a package scope that has no defined "type" and
+  is under node_modules`, async () => {
+    const { default: defaultExport } =
+      await import(fixtures.fileURL(
+        'es-modules/package-type-module/node_modules/dep-with-package-json-without-type/noext-cjs'));
+    strictEqual(defaultExport, 42);
+  });
+});
diff --git a/test/es-module/test-esm-type-flag-string-input.mjs b/test/es-module/test-esm-type-flag-string-input.mjs
new file mode 100644
index 00000000000000..c4236c00c4f28f
--- /dev/null
+++ b/test/es-module/test-esm-type-flag-string-input.mjs
@@ -0,0 +1,44 @@
+import { spawnPromisified } from '../common/index.mjs';
+import { spawn } from 'node:child_process';
+import { describe, it } from 'node:test';
+import { strictEqual, match } from 'node:assert';
+
+describe('the type flag should change the interpretation of string input', { concurrency: true }, () => {
+  it('should run as ESM input passed via --eval', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      '--eval',
+      'import "data:text/javascript,console.log(42)"',
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, '42\n');
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+
+  // ESM is unsupported for --print via --input-type=module
+
+  it('should run as ESM input passed via STDIN', async () => {
+    const child = spawn(process.execPath, [
+      '--experimental-default-type=module',
+    ]);
+    child.stdin.end('console.log(typeof import.meta.resolve)');
+
+    match((await child.stdout.toArray()).toString(), /^function\r?\n$/);
+  });
+
+  it('should be overridden by --input-type', async () => {
+    const { code, signal, stdout, stderr } = await spawnPromisified(process.execPath, [
+      '--experimental-default-type=module',
+      '--input-type=commonjs',
+      '--eval',
+      'console.log(require("process").version)',
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, `${process.version}\n`);
+    strictEqual(code, 0);
+    strictEqual(signal, null);
+  });
+});
diff --git a/test/es-module/test-esm-unknown-or-no-extension.js b/test/es-module/test-esm-unknown-extension.js
similarity index 60%
rename from test/es-module/test-esm-unknown-or-no-extension.js
rename to test/es-module/test-esm-unknown-extension.js
index 3f0660e5aa9225..dae9568c523fe5 100644
--- a/test/es-module/test-esm-unknown-or-no-extension.js
+++ b/test/es-module/test-esm-unknown-extension.js
@@ -7,14 +7,11 @@ const { execPath } = require('node:process');
 const { describe, it } = require('node:test');
 
 
-// In a "type": "module" package scope, files with unknown extensions or no
-// extensions should throw; both when used as a main entry point and also when
-// referenced via `import`.
-describe('ESM: extensionless and unknown specifiers', { concurrency: true }, () => {
+// In a "type": "module" package scope, files with unknown extensions should throw;
+// both when used as a main entry point and also when referenced via `import`.
+describe('ESM: unknown specifiers', { concurrency: true }, () => {
   for (
     const fixturePath of [
-      '/es-modules/package-type-module/noext-esm',
-      '/es-modules/package-type-module/imports-noext.mjs',
       '/es-modules/package-type-module/extension.unknown',
       '/es-modules/package-type-module/imports-unknownext.mjs',
     ]
@@ -26,11 +23,7 @@ describe('ESM: extensionless and unknown specifiers', { concurrency: true }, ()
       assert.strictEqual(code, 1);
       assert.strictEqual(signal, null);
       assert.strictEqual(stdout, '');
-      assert.ok(stderr.includes('ERR_UNKNOWN_FILE_EXTENSION'));
-      if (fixturePath.includes('noext')) {
-        // Check for explanation to users
-        assert.ok(stderr.includes('extensionless'));
-      }
+      assert.match(stderr, /ERR_UNKNOWN_FILE_EXTENSION/);
     });
   }
 });
diff --git a/test/parallel/test-esm-url-extname.js b/test/es-module/test-esm-url-extname.js
similarity index 100%
rename from test/parallel/test-esm-url-extname.js
rename to test/es-module/test-esm-url-extname.js
diff --git a/test/es-module/test-esm-virtual-json.mjs b/test/es-module/test-esm-virtual-json.mjs
new file mode 100644
index 00000000000000..a42b037fc1f200
--- /dev/null
+++ b/test/es-module/test-esm-virtual-json.mjs
@@ -0,0 +1,30 @@
+import '../common/index.mjs';
+import * as fixtures from '../common/fixtures.mjs';
+import { register } from 'node:module';
+import assert from 'node:assert';
+
+async function resolve(referrer, context, next) {
+  const result = await next(referrer, context);
+  const url = new URL(result.url);
+  url.searchParams.set('randomSeed', Math.random());
+  result.url = url.href;
+  return result;
+}
+
+function load(url, context, next) {
+  if (context.importAttributes.type === 'json') {
+    return {
+      shortCircuit: true,
+      format: 'json',
+      source: JSON.stringify({ data: Math.random() }),
+    };
+  }
+  return next(url, context);
+}
+
+register(`data:text/javascript,export ${encodeURIComponent(resolve)};export ${encodeURIComponent(load)}`);
+
+assert.notDeepStrictEqual(
+  await import(fixtures.fileURL('empty.json'), { with: { type: 'json' } }),
+  await import(fixtures.fileURL('empty.json'), { with: { type: 'json' } }),
+);
diff --git a/test/es-module/test-esm-wasm.mjs b/test/es-module/test-esm-wasm.mjs
index fac1d4b2837df0..be33e3d437df3a 100644
--- a/test/es-module/test-esm-wasm.mjs
+++ b/test/es-module/test-esm-wasm.mjs
@@ -29,6 +29,56 @@ describe('ESM: WASM modules', { concurrency: true }, () => {
     strictEqual(code, 0);
   });
 
+  it('should not allow code injection through export names', async () => {
+    const { code, stderr, stdout } = await spawnPromisified(execPath, [
+      '--no-warnings',
+      '--experimental-wasm-modules',
+      '--input-type=module',
+      '--eval',
+      `import * as wasmExports from ${JSON.stringify(fixtures.fileURL('es-modules/export-name-code-injection.wasm'))};`,
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, '');
+    strictEqual(code, 0);
+  });
+
+  it('should allow non-identifier export names', async () => {
+    const { code, stderr, stdout } = await spawnPromisified(execPath, [
+      '--no-warnings',
+      '--experimental-wasm-modules',
+      '--input-type=module',
+      '--eval',
+      [
+        'import { strictEqual } from "node:assert";',
+        `import * as wasmExports from ${JSON.stringify(fixtures.fileURL('es-modules/export-name-syntax-error.wasm'))};`,
+        'assert.strictEqual(wasmExports["?f!o:o<b>a[r]"]?.value, 12682);',
+      ].join('\n'),
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, '');
+    strictEqual(code, 0);
+  });
+
+  it('should properly escape import names as well', async () => {
+    const { code, stderr, stdout } = await spawnPromisified(execPath, [
+      '--no-warnings',
+      '--experimental-wasm-modules',
+      '--input-type=module',
+      '--eval',
+      [
+        'import { strictEqual } from "node:assert";',
+        `import * as wasmExports from ${JSON.stringify(fixtures.fileURL('es-modules/import-name.wasm'))};`,
+        'assert.strictEqual(wasmExports.xor(), 12345);',
+      ].join('\n'),
+    ]);
+
+    strictEqual(stderr, '');
+    strictEqual(stdout, '');
+    strictEqual(code, 0);
+  });
+
   it('should emit experimental warning', async () => {
     const { code, signal, stderr } = await spawnPromisified(execPath, [
       '--experimental-wasm-modules',
diff --git a/test/es-module/test-vm-compile-function-leak.js b/test/es-module/test-vm-compile-function-leak.js
index ff061cdaec7a01..f9f04588fdc7c3 100644
--- a/test/es-module/test-vm-compile-function-leak.js
+++ b/test/es-module/test-vm-compile-function-leak.js
@@ -4,16 +4,13 @@
 // This tests that vm.compileFunction with dynamic import callback does not leak.
 // See https://github.com/nodejs/node/issues/44211
 require('../common');
+const { checkIfCollectable } = require('../common/gc');
 const vm = require('vm');
-let count = 0;
 
-function main() {
-  // Try to reach the maximum old space size.
-  vm.compileFunction(`"${Math.random().toString().repeat(512)}"`, [], {
+async function createCompiledFunction() {
+  return vm.compileFunction(`"${Math.random().toString().repeat(512)}"`, [], {
     async importModuleDynamically() {},
   });
-  if (count++ < 2048) {
-    setTimeout(main, 1);
-  }
 }
-main();
+
+checkIfCollectable(createCompiledFunction, 2048);
diff --git a/test/es-module/test-vm-compile-function-lineoffset.js b/test/es-module/test-vm-compile-function-lineoffset.js
new file mode 100644
index 00000000000000..47846a3aa6eb8b
--- /dev/null
+++ b/test/es-module/test-vm-compile-function-lineoffset.js
@@ -0,0 +1,34 @@
+'use strict';
+
+require('../common');
+
+const assert = require('assert');
+const { compileFunction } = require('node:vm');
+
+const min = -2147483648;
+const max = 2147483647;
+
+compileFunction('', [], { lineOffset: min, columnOffset: min });
+compileFunction('', [], { lineOffset: max, columnOffset: max });
+
+assert.throws(
+  () => {
+    compileFunction('', [], { lineOffset: min - 1, columnOffset: max });
+  },
+  {
+    code: 'ERR_OUT_OF_RANGE',
+    name: 'RangeError',
+    message: /The value of "options\.lineOffset" is out of range/,
+  }
+);
+
+assert.throws(
+  () => {
+    compileFunction('', [], { lineOffset: min, columnOffset: min - 1 });
+  },
+  {
+    code: 'ERR_OUT_OF_RANGE',
+    name: 'RangeError',
+    message: /The value of "options\.columnOffset" is out of range/,
+  }
+);
diff --git a/test/es-module/test-vm-contextified-script-leak.js b/test/es-module/test-vm-contextified-script-leak.js
index 7498b46ab80cfa..a8625fc94d246e 100644
--- a/test/es-module/test-vm-contextified-script-leak.js
+++ b/test/es-module/test-vm-contextified-script-leak.js
@@ -4,16 +4,13 @@
 // This tests that vm.Script with dynamic import callback does not leak.
 // See: https://github.com/nodejs/node/issues/33439
 require('../common');
+const { checkIfCollectable } = require('../common/gc');
 const vm = require('vm');
-let count = 0;
 
-function main() {
+async function createContextifyScript() {
   // Try to reach the maximum old space size.
-  new vm.Script(`"${Math.random().toString().repeat(512)}";`, {
+  return new vm.Script(`"${Math.random().toString().repeat(512)}";`, {
     async importModuleDynamically() {},
   });
-  if (count++ < 2 * 1024) {
-    setTimeout(main, 1);
-  }
 }
-main();
+checkIfCollectable(createContextifyScript, 2048, 512);
diff --git a/test/es-module/test-vm-source-text-module-leak.js b/test/es-module/test-vm-source-text-module-leak.js
index bf7f70c670e34c..d05e812ac32c95 100644
--- a/test/es-module/test-vm-source-text-module-leak.js
+++ b/test/es-module/test-vm-source-text-module-leak.js
@@ -4,20 +4,18 @@
 // This tests that vm.SourceTextModule() does not leak.
 // See: https://github.com/nodejs/node/issues/33439
 require('../common');
-
+const { checkIfCollectable } = require('../common/gc');
 const vm = require('vm');
-let count = 0;
-async function createModule() {
+
+async function createSourceTextModule() {
   // Try to reach the maximum old space size.
   const m = new vm.SourceTextModule(`
-  const bar = new Array(512).fill("----");
-  export { bar };
-`);
+    const bar = new Array(512).fill("----");
+    export { bar };
+  `);
   await m.link(() => {});
   await m.evaluate();
-  if (count++ < 4096) {
-    setTimeout(createModule, 1);
-  }
   return m;
 }
-createModule();
+
+checkIfCollectable(createSourceTextModule, 4096, 1024);
diff --git a/test/es-module/test-vm-synthetic-module-leak.js b/test/es-module/test-vm-synthetic-module-leak.js
index 9de02cb22f1128..bc0e4689535327 100644
--- a/test/es-module/test-vm-synthetic-module-leak.js
+++ b/test/es-module/test-vm-synthetic-module-leak.js
@@ -4,20 +4,15 @@
 // This tests that vm.SyntheticModule does not leak.
 // See https://github.com/nodejs/node/issues/44211
 require('../common');
+const { checkIfCollectable } = require('../common/gc');
 const vm = require('vm');
 
-let count = 0;
-async function createModule() {
-  // Try to reach the maximum old space size.
+async function createSyntheticModule() {
   const m = new vm.SyntheticModule(['bar'], () => {
     m.setExport('bar', new Array(512).fill('----'));
   });
   await m.link(() => {});
   await m.evaluate();
-  if (count++ < 4 * 1024) {
-    setTimeout(createModule, 1);
-  }
   return m;
 }
-
-createModule();
+checkIfCollectable(createSyntheticModule, 4096);
diff --git a/test/parallel/test-wasm-memory-out-of-bound.js b/test/es-module/test-wasm-memory-out-of-bound.js
similarity index 100%
rename from test/parallel/test-wasm-memory-out-of-bound.js
rename to test/es-module/test-wasm-memory-out-of-bound.js
diff --git a/test/parallel/test-wasm-simple.js b/test/es-module/test-wasm-simple.js
similarity index 100%
rename from test/parallel/test-wasm-simple.js
rename to test/es-module/test-wasm-simple.js
diff --git a/test/parallel/test-wasm-web-api.js b/test/es-module/test-wasm-web-api.js
similarity index 100%
rename from test/parallel/test-wasm-web-api.js
rename to test/es-module/test-wasm-web-api.js
diff --git a/test/message/core_line_numbers.js b/test/fixtures/errors/core_line_numbers.js
similarity index 95%
rename from test/message/core_line_numbers.js
rename to test/fixtures/errors/core_line_numbers.js
index 585a6042652df1..5482a21bae9a1f 100644
--- a/test/message/core_line_numbers.js
+++ b/test/fixtures/errors/core_line_numbers.js
@@ -1,5 +1,5 @@
 'use strict';
-require('../common');
+require('../../common');
 Error.stackTraceLimit = 3;
 
 const punycode = require('punycode');
diff --git a/test/message/core_line_numbers.out b/test/fixtures/errors/core_line_numbers.snapshot
similarity index 54%
rename from test/message/core_line_numbers.out
rename to test/fixtures/errors/core_line_numbers.snapshot
index b5f4b6c72010e9..54cdb52744b29e 100644
--- a/test/message/core_line_numbers.out
+++ b/test/fixtures/errors/core_line_numbers.snapshot
@@ -4,7 +4,7 @@ node:punycode:49
 
 RangeError: Invalid input
     at error (node:punycode:49:8)
-    at Object.decode (node:punycode:*:*)
-    at Object.<anonymous> (*test*message*core_line_numbers.js:*:*)
+    at Object.decode (node:punycode:242:5)
+    at Object.<anonymous> (*core_line_numbers.js:13:10)
 
 Node.js *
diff --git a/test/fixtures/errors/force_colors.snapshot b/test/fixtures/errors/force_colors.snapshot
index f843a3586ee800..3624d9f0804545 100644
--- a/test/fixtures/errors/force_colors.snapshot
+++ b/test/fixtures/errors/force_colors.snapshot
@@ -4,11 +4,11 @@ throw new Error('Should include grayed stack trace')
 
 Error: Should include grayed stack trace
     at Object.<anonymous> (/test*force_colors.js:1:7)
-    at Module._compile (node:internal*modules*cjs*loader:1264:14)
-    at Module._extensions..js (node:internal*modules*cjs*loader:1318:10)
-    at Module.load (node:internal*modules*cjs*loader:1113:32)
-    at Module._load (node:internal*modules*cjs*loader:954:12)
-    at Function.executeUserEntryPoint [as runMain] (node:internal*modules*run_main:80:12)
-    at node:internal*main*run_main_module:23:47
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
 
 Node.js *
diff --git a/test/message/if-error-has-good-stack.js b/test/fixtures/errors/if-error-has-good-stack.js
similarity index 93%
rename from test/message/if-error-has-good-stack.js
rename to test/fixtures/errors/if-error-has-good-stack.js
index 4f529d3e5d17ff..85c127c4e24c54 100644
--- a/test/message/if-error-has-good-stack.js
+++ b/test/fixtures/errors/if-error-has-good-stack.js
@@ -1,6 +1,6 @@
 'use strict';
 
-require('../common');
+require('../../common');
 Error.stackTraceLimit = 4;
 
 const assert = require('assert');
diff --git a/test/message/if-error-has-good-stack.out b/test/fixtures/errors/if-error-has-good-stack.snapshot
similarity index 94%
rename from test/message/if-error-has-good-stack.out
rename to test/fixtures/errors/if-error-has-good-stack.snapshot
index e394127bd4c473..9296b25f10b7c6 100644
--- a/test/message/if-error-has-good-stack.out
+++ b/test/fixtures/errors/if-error-has-good-stack.snapshot
@@ -3,7 +3,7 @@ node:assert:*
     ^
 
 AssertionError [ERR_ASSERTION]: ifError got unwanted exception: test error
-    at z (*if-error-has-good-stack.js:*:*
+    at z (*if-error-has-good-stack.js:*:*)
     at y (*if-error-has-good-stack.js:*:*)
     at x (*if-error-has-good-stack.js:*:*)
     at Object.<anonymous> (*if-error-has-good-stack.js:*:*)
diff --git a/test/message/promise_unhandled_warn_with_error.js b/test/fixtures/errors/promise_unhandled_warn_with_error.js
similarity index 88%
rename from test/message/promise_unhandled_warn_with_error.js
rename to test/fixtures/errors/promise_unhandled_warn_with_error.js
index e07f52039101a3..b71757a259f04a 100644
--- a/test/message/promise_unhandled_warn_with_error.js
+++ b/test/fixtures/errors/promise_unhandled_warn_with_error.js
@@ -1,7 +1,7 @@
 // Flags: --unhandled-rejections=warn-with-error-code
 'use strict';
 
-require('../common');
+require('../../common');
 const assert = require('assert');
 
 Promise.reject(new Error('alas'));
diff --git a/test/fixtures/errors/promise_unhandled_warn_with_error.snapshot b/test/fixtures/errors/promise_unhandled_warn_with_error.snapshot
new file mode 100644
index 00000000000000..d7f1aa2f72007f
--- /dev/null
+++ b/test/fixtures/errors/promise_unhandled_warn_with_error.snapshot
@@ -0,0 +1,10 @@
+(node:*) UnhandledPromiseRejectionWarning: Error: alas
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+(Use `node --trace-warnings ...` to show where the warning was created)
+(node:*) UnhandledPromiseRejectionWarning: Unhandled promise rejection. This error originated either by throwing inside of an async function without a catch block, or by rejecting a promise which was not handled with .catch(). To terminate the node process on unhandled promise rejection, use the CLI flag `--unhandled-rejections=strict` (see https:*nodejs.org*api*cli.html#cli_unhandled_rejections_mode). (rejection id: 1)
diff --git a/test/message/test-no-extra-info-on-fatal-exception.js b/test/fixtures/errors/test-no-extra-info-on-fatal-exception.js
similarity index 81%
rename from test/message/test-no-extra-info-on-fatal-exception.js
rename to test/fixtures/errors/test-no-extra-info-on-fatal-exception.js
index dbc61b0f2382e0..d72a7a22cd727e 100644
--- a/test/message/test-no-extra-info-on-fatal-exception.js
+++ b/test/fixtures/errors/test-no-extra-info-on-fatal-exception.js
@@ -1,7 +1,7 @@
 // Flags: --no-extra-info-on-fatal-exception
 
 'use strict';
-require('../common');
+require('../../common');
 Error.stackTraceLimit = 1;
 
 throw new Error('foo');
diff --git a/test/fixtures/errors/test-no-extra-info-on-fatal-exception.snapshot b/test/fixtures/errors/test-no-extra-info-on-fatal-exception.snapshot
new file mode 100644
index 00000000000000..26e096170b3fbd
--- /dev/null
+++ b/test/fixtures/errors/test-no-extra-info-on-fatal-exception.snapshot
@@ -0,0 +1,6 @@
+*test-no-extra-info-on-fatal-exception.js:7
+throw new Error('foo');
+^
+
+Error: foo
+    at Object.<anonymous> (*test-no-extra-info-on-fatal-exception.js:7:7)
diff --git a/test/message/throw_error_with_getter_throw.js b/test/fixtures/errors/throw_error_with_getter_throw.js
similarity index 88%
rename from test/message/throw_error_with_getter_throw.js
rename to test/fixtures/errors/throw_error_with_getter_throw.js
index a807ff3e2b6504..0f38a9493dc7c3 100644
--- a/test/message/throw_error_with_getter_throw.js
+++ b/test/fixtures/errors/throw_error_with_getter_throw.js
@@ -1,5 +1,5 @@
 'use strict';
-require('../common');
+require('../../common');
 throw {  // eslint-disable-line no-throw-literal
   get stack() {
     throw new Error('weird throw but ok');
diff --git a/test/fixtures/errors/throw_error_with_getter_throw.snapshot b/test/fixtures/errors/throw_error_with_getter_throw.snapshot
new file mode 100644
index 00000000000000..30bbb336a22aaf
--- /dev/null
+++ b/test/fixtures/errors/throw_error_with_getter_throw.snapshot
@@ -0,0 +1,8 @@
+
+*throw_error_with_getter_throw.js:*
+throw {  * eslint-disable-line no-throw-literal
+^
+[object Object]
+(Use `node --trace-uncaught ...` to show where the exception was thrown)
+
+Node.js *
diff --git a/test/message/throw_null.js b/test/fixtures/errors/throw_null.js
similarity index 97%
rename from test/message/throw_null.js
rename to test/fixtures/errors/throw_null.js
index fb233d1db56704..d8fc14ba784488 100644
--- a/test/message/throw_null.js
+++ b/test/fixtures/errors/throw_null.js
@@ -20,7 +20,7 @@
 // USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 'use strict';
-require('../common');
+require('../../common');
 
 // eslint-disable-next-line no-throw-literal
 throw null;
diff --git a/test/fixtures/errors/throw_null.snapshot b/test/fixtures/errors/throw_null.snapshot
new file mode 100644
index 00000000000000..88494ec6832205
--- /dev/null
+++ b/test/fixtures/errors/throw_null.snapshot
@@ -0,0 +1,8 @@
+
+*throw_null.js:*
+throw null;
+^
+null
+(Use `node --trace-uncaught ...` to show where the exception was thrown)
+
+Node.js *
diff --git a/test/message/throw_undefined.js b/test/fixtures/errors/throw_undefined.js
similarity index 97%
rename from test/message/throw_undefined.js
rename to test/fixtures/errors/throw_undefined.js
index a89aaf2ee2da59..8c486a7ff4c470 100644
--- a/test/message/throw_undefined.js
+++ b/test/fixtures/errors/throw_undefined.js
@@ -20,7 +20,7 @@
 // USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 'use strict';
-require('../common');
+require('../../common');
 
 // eslint-disable-next-line no-throw-literal
 throw undefined;
diff --git a/test/fixtures/errors/throw_undefined.snapshot b/test/fixtures/errors/throw_undefined.snapshot
new file mode 100644
index 00000000000000..baae7384453373
--- /dev/null
+++ b/test/fixtures/errors/throw_undefined.snapshot
@@ -0,0 +1,8 @@
+
+*throw_undefined.js:*
+throw undefined;
+^
+undefined
+(Use `node --trace-uncaught ...` to show where the exception was thrown)
+
+Node.js *
diff --git a/test/message/timeout_throw.js b/test/fixtures/errors/timeout_throw.js
similarity index 98%
rename from test/message/timeout_throw.js
rename to test/fixtures/errors/timeout_throw.js
index 9bcbd85b5036e2..bd4130479b48c6 100644
--- a/test/message/timeout_throw.js
+++ b/test/fixtures/errors/timeout_throw.js
@@ -20,7 +20,7 @@
 // USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 'use strict';
-require('../common');
+require('../../common');
 
 setTimeout(function() {
   // eslint-disable-next-line no-undef,no-unused-expressions
diff --git a/test/fixtures/errors/timeout_throw.snapshot b/test/fixtures/errors/timeout_throw.snapshot
new file mode 100644
index 00000000000000..ddbb221c27ca3a
--- /dev/null
+++ b/test/fixtures/errors/timeout_throw.snapshot
@@ -0,0 +1,10 @@
+*timeout_throw.js:*
+  undefined_reference_error_maker;
+  ^
+
+ReferenceError: undefined_reference_error_maker is not defined
+    at Timeout._onTimeout (*timeout_throw.js:*:*)
+    at listOnTimeout (node:internal*timers:*:*)
+    at process.processTimers (node:internal*timers:*:*)
+
+Node.js *
diff --git a/test/message/undefined_reference_in_new_context.js b/test/fixtures/errors/undefined_reference_in_new_context.js
similarity index 98%
rename from test/message/undefined_reference_in_new_context.js
rename to test/fixtures/errors/undefined_reference_in_new_context.js
index 29a67632f8f7dd..baa45de11ecef7 100644
--- a/test/message/undefined_reference_in_new_context.js
+++ b/test/fixtures/errors/undefined_reference_in_new_context.js
@@ -20,7 +20,7 @@
 // USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 'use strict';
-require('../common');
+require('../../common');
 const vm = require('vm');
 
 console.error('before');
diff --git a/test/fixtures/errors/undefined_reference_in_new_context.snapshot b/test/fixtures/errors/undefined_reference_in_new_context.snapshot
new file mode 100644
index 00000000000000..798306c282bfd1
--- /dev/null
+++ b/test/fixtures/errors/undefined_reference_in_new_context.snapshot
@@ -0,0 +1,13 @@
+before
+evalmachine.<anonymous>:*
+Error.stackTraceLimit = 5; foo.bar = 5;
+                           ^
+
+ReferenceError: foo is not defined
+    at evalmachine.<anonymous>:*:*
+    at Script.runInContext (node:vm:*:*)
+    at Script.runInNewContext (node:vm:*:*)
+    at Object.runInNewContext (node:vm:*:*)
+    at Object.<anonymous> (*undefined_reference_in_new_context.js:*:*)
+
+Node.js *
diff --git a/test/message/unhandled_promise_trace_warnings.js b/test/fixtures/errors/unhandled_promise_trace_warnings.js
similarity index 86%
rename from test/message/unhandled_promise_trace_warnings.js
rename to test/fixtures/errors/unhandled_promise_trace_warnings.js
index 66c1f39e5de091..53c5315a2dabfd 100644
--- a/test/message/unhandled_promise_trace_warnings.js
+++ b/test/fixtures/errors/unhandled_promise_trace_warnings.js
@@ -1,5 +1,5 @@
 // Flags: --trace-warnings --unhandled-rejections=warn
 'use strict';
-require('../common');
+require('../../common');
 const p = Promise.reject(new Error('This was rejected'));
 setImmediate(() => p.catch(() => {}));
diff --git a/test/fixtures/errors/unhandled_promise_trace_warnings.snapshot b/test/fixtures/errors/unhandled_promise_trace_warnings.snapshot
new file mode 100644
index 00000000000000..1ed082d0736851
--- /dev/null
+++ b/test/fixtures/errors/unhandled_promise_trace_warnings.snapshot
@@ -0,0 +1,26 @@
+(node:*) UnhandledPromiseRejectionWarning: Error: This was rejected
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+(node:*) Error: This was rejected
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+    at *
+(node:*) PromiseRejectionHandledWarning: Promise rejection was handled asynchronously (rejection id: 1)
+    at *
+    at *
+    at Promise.then (<anonymous>)
+    at Promise.catch (<anonymous>)
+    at *
+    at *
diff --git a/test/fixtures/es-module-loaders/assertionless-json-import.mjs b/test/fixtures/es-module-loaders/assertionless-json-import.mjs
index e7e7b20fd26798..3ffc4c1148fe69 100644
--- a/test/fixtures/es-module-loaders/assertionless-json-import.mjs
+++ b/test/fixtures/es-module-loaders/assertionless-json-import.mjs
@@ -2,20 +2,20 @@ const DATA_URL_PATTERN = /^data:application\/json(?:[^,]*?)(;base64)?,([\s\S]*)$
 const JSON_URL_PATTERN = /^[^?]+\.json(\?[^#]*)?(#.*)?$/;
 
 export async function resolve(specifier, context, next) {
-  const noAssertionSpecified = context.importAssertions.type == null;
+  const noAttributesSpecified = context.importAttributes.type == null;
 
   // Mutation from resolve hook should be discarded.
-  context.importAssertions.type = 'whatever';
+  context.importAttributes.type = 'whatever';
 
-  // This fixture assumes that no other resolve hooks in the chain will error on invalid import assertions
+  // This fixture assumes that no other resolve hooks in the chain will error on invalid import attributes
   // (as defaultResolve doesn't).
   const result = await next(specifier, context);
 
-  if (noAssertionSpecified &&
+  if (noAttributesSpecified &&
       (DATA_URL_PATTERN.test(result.url) || JSON_URL_PATTERN.test(result.url))) {
-    // Clean new import assertions object to ensure that this test isn't passing due to mutation.
-    result.importAssertions = {
-      ...(result.importAssertions ?? context.importAssertions),
+    // Clean new import attributes object to ensure that this test isn't passing due to mutation.
+    result.importAttributes = {
+      ...(result.importAttributes ?? context.importAttributes),
       type: 'json',
     };
   }
diff --git a/test/fixtures/es-module-loaders/builtin-named-exports-loader.mjs b/test/fixtures/es-module-loaders/builtin-named-exports-loader.mjs
index 38fa0b3a7488aa..fca31c585a6ea9 100644
--- a/test/fixtures/es-module-loaders/builtin-named-exports-loader.mjs
+++ b/test/fixtures/es-module-loaders/builtin-named-exports-loader.mjs
@@ -14,7 +14,7 @@ export async function resolve(specifier, context, next) {
     return {
       shortCircuit: true,
       url: `custom-${def.url}`,
-      importAssertions: context.importAssertions,
+      importAttributes: context.importAttributes,
     };
   }
   return def;
diff --git a/test/fixtures/es-module-loaders/hooks-custom.mjs b/test/fixtures/es-module-loaders/hooks-custom.mjs
index ea2ffaf7e97070..5656f95232b856 100644
--- a/test/fixtures/es-module-loaders/hooks-custom.mjs
+++ b/test/fixtures/es-module-loaders/hooks-custom.mjs
@@ -6,7 +6,7 @@ import count from '../es-modules/stateful.mjs';
 // used to assert node-land and user-land have different contexts
 count();
 
-export function resolve(specifier, { importAssertions }, next) {
+export function resolve(specifier, { importAttributes }, next) {
   let format = '';
 
   if (specifier === 'esmHook/format.false') {
@@ -24,7 +24,7 @@ export function resolve(specifier, { importAssertions }, next) {
       format,
       shortCircuit: true,
       url: pathToFileURL(specifier).href,
-      importAssertions,
+      importAttributes,
     };
   }
 
diff --git a/test/fixtures/es-module-loaders/hooks-input.mjs b/test/fixtures/es-module-loaders/hooks-input.mjs
index ee0a468cc0e8d1..1d3759f458224e 100644
--- a/test/fixtures/es-module-loaders/hooks-input.mjs
+++ b/test/fixtures/es-module-loaders/hooks-input.mjs
@@ -22,12 +22,12 @@ export async function resolve(specifier, context, next) {
       assert.strictEqual(context.parentURL, undefined);
     }
 
-    assert.deepStrictEqual(context.importAssertions, {});
+    assert.deepStrictEqual(context.importAttributes, {});
   } else if (resolveCalls === 2) {
     url = new URL(specifier, context.parentURL).href;
     assert.match(specifier, /experimental\.json$/);
     assert.match(context.parentURL, /json-modules\.mjs$/);
-    assert.deepStrictEqual(context.importAssertions, {
+    assert.deepStrictEqual(context.importAttributes, {
       type: 'json',
     });
   }
@@ -35,7 +35,7 @@ export async function resolve(specifier, context, next) {
   // Ensure `context` has all and only the properties it's supposed to
   assert.deepStrictEqual(Reflect.ownKeys(context), [
     'conditions',
-    'importAssertions',
+    'importAttributes',
     'parentURL',
   ]);
   assert.ok(Array.isArray(context.conditions));
@@ -59,11 +59,11 @@ export async function load(url, context, next) {
 
   if (loadCalls === 1) {
     assert.match(url, /json-modules\.mjs$/);
-    assert.deepStrictEqual(context.importAssertions, {});
+    assert.deepStrictEqual(context.importAttributes, {});
     format = 'module';
   } else if (loadCalls === 2) {
     assert.match(url, /experimental\.json$/);
-    assert.deepStrictEqual(context.importAssertions, {
+    assert.deepStrictEqual(context.importAttributes, {
       type: 'json',
     });
     format = 'json';
@@ -73,7 +73,7 @@ export async function load(url, context, next) {
   // Ensure `context` has all and only the properties it's supposed to
   assert.deepStrictEqual(Object.keys(context), [
     'format',
-    'importAssertions',
+    'importAttributes',
   ]);
   assert.strictEqual(context.format, 'test');
   assert.strictEqual(typeof next, 'function');
diff --git a/test/fixtures/es-module-loaders/loader-invalid-format.mjs b/test/fixtures/es-module-loaders/loader-invalid-format.mjs
index e7dd06c108ba1d..dc61a792b2be8b 100644
--- a/test/fixtures/es-module-loaders/loader-invalid-format.mjs
+++ b/test/fixtures/es-module-loaders/loader-invalid-format.mjs
@@ -1,4 +1,4 @@
-export async function resolve(specifier, { parentURL, importAssertions }, next) {
+export async function resolve(specifier, { parentURL, importAttributes }, next) {
   if (parentURL && specifier === '../fixtures/es-modules/test-esm-ok.mjs') {
     return {
       shortCircuit: true,
diff --git a/test/fixtures/es-module-loaders/loader-invalid-url.mjs b/test/fixtures/es-module-loaders/loader-invalid-url.mjs
index a54f39521f29ac..aac2b16b6f58fe 100644
--- a/test/fixtures/es-module-loaders/loader-invalid-url.mjs
+++ b/test/fixtures/es-module-loaders/loader-invalid-url.mjs
@@ -1,9 +1,9 @@
-export async function resolve(specifier, { parentURL, importAssertions }, next) {
+export async function resolve(specifier, { parentURL, importAttributes }, next) {
   if (parentURL && specifier === '../fixtures/es-modules/test-esm-ok.mjs') {
     return {
       shortCircuit: true,
       url: specifier,
-      importAssertions,
+      importAttributes,
     };
   }
   return next(specifier);
diff --git a/test/fixtures/es-module-loaders/loader-with-dep.mjs b/test/fixtures/es-module-loaders/loader-with-dep.mjs
index 1b5fd6c3c1642a..625341eaed7eb2 100644
--- a/test/fixtures/es-module-loaders/loader-with-dep.mjs
+++ b/test/fixtures/es-module-loaders/loader-with-dep.mjs
@@ -3,9 +3,9 @@ import {createRequire} from '../../common/index.mjs';
 const require = createRequire(import.meta.url);
 const dep = require('./loader-dep.js');
 
-export async function resolve(specifier, { parentURL, importAssertions }, defaultResolve) {
+export async function resolve(specifier, { parentURL, importAttributes }, defaultResolve) {
   return {
-    url: (await defaultResolve(specifier, { parentURL, importAssertions }, defaultResolve)).url,
+    url: (await defaultResolve(specifier, { parentURL, importAttributes }, defaultResolve)).url,
     format: dep.format
   };
 }
diff --git a/test/fixtures/es-module-loaders/not-found-assert-loader.mjs b/test/fixtures/es-module-loaders/not-found-assert-loader.mjs
index 2486899ea3753f..bf66efbd0810e5 100644
--- a/test/fixtures/es-module-loaders/not-found-assert-loader.mjs
+++ b/test/fixtures/es-module-loaders/not-found-assert-loader.mjs
@@ -3,7 +3,7 @@ import assert from 'node:assert';
 // A loader that asserts that the defaultResolve will throw "not found"
 // (skipping the top-level main of course, and the built-in ones needed for run-worker).
 let mainLoad = true;
-export async function resolve(specifier, { importAssertions }, next) {
+export async function resolve(specifier, { importAttributes }, next) {
   if (mainLoad || specifier === 'path' || specifier === 'worker_threads') {
     mainLoad = false;
     return next(specifier);
@@ -11,6 +11,6 @@ export async function resolve(specifier, { importAssertions }, next) {
   await assert.rejects(next(specifier), { code: 'ERR_MODULE_NOT_FOUND' });
   return {
     url: 'node:fs',
-    importAssertions,
+    importAttributes,
   };
 }
diff --git a/test/fixtures/es-module-loaders/string-sources.mjs b/test/fixtures/es-module-loaders/string-sources.mjs
index 396d17cb17a75c..39ad32c465fa31 100644
--- a/test/fixtures/es-module-loaders/string-sources.mjs
+++ b/test/fixtures/es-module-loaders/string-sources.mjs
@@ -23,7 +23,7 @@ const SOURCES = {
 export function resolve(specifier, context, next) {
   if (specifier.startsWith('test:')) {
     return {
-      importAssertions: context.importAssertions,
+      importAttributes: context.importAttributes,
       shortCircuit: true,
       url: specifier,
     };
diff --git a/test/fixtures/es-modules/export-name-code-injection.wasm b/test/fixtures/es-modules/export-name-code-injection.wasm
new file mode 100644
index 00000000000000..c88b6b81e3f852
Binary files /dev/null and b/test/fixtures/es-modules/export-name-code-injection.wasm differ
diff --git a/test/fixtures/es-modules/export-name-code-injection.wat b/test/fixtures/es-modules/export-name-code-injection.wat
new file mode 100644
index 00000000000000..3cca749ea3a4ab
--- /dev/null
+++ b/test/fixtures/es-modules/export-name-code-injection.wat
@@ -0,0 +1,8 @@
+;; Compiled using the WebAssembly Binary Toolkit (https://github.com/WebAssembly/wabt)
+;; $ wat2wasm export-name-code-injection.wat
+
+(module
+  (global $0 i32 (i32.const 123))
+  (global $1 i32 (i32.const 456))
+  (export ";import.meta.done=()=>{};console.log('code injection');{/*" (global $0))
+  (export "/*/$;`//" (global $1)))
diff --git a/test/fixtures/es-modules/export-name-syntax-error.wasm b/test/fixtures/es-modules/export-name-syntax-error.wasm
new file mode 100644
index 00000000000000..30787c5ab54ed2
Binary files /dev/null and b/test/fixtures/es-modules/export-name-syntax-error.wasm differ
diff --git a/test/fixtures/es-modules/export-name-syntax-error.wat b/test/fixtures/es-modules/export-name-syntax-error.wat
new file mode 100644
index 00000000000000..fe8728e8207628
--- /dev/null
+++ b/test/fixtures/es-modules/export-name-syntax-error.wat
@@ -0,0 +1,6 @@
+;; Compiled using the WebAssembly Binary Toolkit (https://github.com/WebAssembly/wabt)
+;; $ wat2wasm export-name-syntax-error.wat
+
+(module
+  (global $0 i32 (i32.const 12682))
+  (export "?f!o:o<b>a[r]" (global $0)))
diff --git a/test/fixtures/es-modules/import-json-named-export.mjs b/test/fixtures/es-modules/import-json-named-export.mjs
index 01798c59ac587d..be1a4116eb5ffa 100644
--- a/test/fixtures/es-modules/import-json-named-export.mjs
+++ b/test/fixtures/es-modules/import-json-named-export.mjs
@@ -1 +1 @@
-import { ofLife } from '../experimental.json' assert { type: 'json' };
+import { ofLife } from '../experimental.json' with { type: 'json' };
diff --git a/test/fixtures/es-modules/import-name.wasm b/test/fixtures/es-modules/import-name.wasm
new file mode 100644
index 00000000000000..1c261b7a45af0f
Binary files /dev/null and b/test/fixtures/es-modules/import-name.wasm differ
diff --git a/test/fixtures/es-modules/import-name.wat b/test/fixtures/es-modules/import-name.wat
new file mode 100644
index 00000000000000..3501aa5ead9eda
--- /dev/null
+++ b/test/fixtures/es-modules/import-name.wat
@@ -0,0 +1,10 @@
+;; Compiled using the WebAssembly Binary Toolkit (https://github.com/WebAssembly/wabt)
+;; $ wat2wasm import-name.wat
+
+(module
+  (global $0 (import "./export-name-code-injection.wasm" ";import.meta.done=()=>{};console.log('code injection');{/*") i32)
+  (global $1 (import "./export-name-code-injection.wasm" "/*/$;`//") i32)
+  (global $2 (import "./export-name-syntax-error.wasm" "?f!o:o<b>a[r]") i32)
+  (func $xor (result i32)
+    (i32.xor (i32.xor (global.get $0) (global.get $1)) (global.get $2)))
+  (export "xor" (func $xor)))
diff --git a/test/fixtures/es-modules/imports-loose.mjs b/test/fixtures/es-modules/imports-loose.mjs
new file mode 100644
index 00000000000000..13831e5db03e82
--- /dev/null
+++ b/test/fixtures/es-modules/imports-loose.mjs
@@ -0,0 +1 @@
+import './loose.js';
diff --git a/test/fixtures/es-modules/imports-noext.mjs b/test/fixtures/es-modules/imports-noext.mjs
new file mode 100644
index 00000000000000..96eca54521b9d3
--- /dev/null
+++ b/test/fixtures/es-modules/imports-noext.mjs
@@ -0,0 +1 @@
+import './noext-esm';
diff --git a/test/fixtures/es-modules/invalid-posix-host.mjs b/test/fixtures/es-modules/invalid-posix-host.mjs
new file mode 100644
index 00000000000000..65ebb2c0496c15
--- /dev/null
+++ b/test/fixtures/es-modules/invalid-posix-host.mjs
@@ -0,0 +1 @@
+import "file://hmm.js";
diff --git a/test/fixtures/es-modules/json-modules.mjs b/test/fixtures/es-modules/json-modules.mjs
index 607c09e51cda2b..c1eae2b689a696 100644
--- a/test/fixtures/es-modules/json-modules.mjs
+++ b/test/fixtures/es-modules/json-modules.mjs
@@ -1 +1 @@
-import secret from '../experimental.json' assert { type: 'json' };
+import secret from '../experimental.json' with { type: 'json' };
diff --git a/test/fixtures/es-modules/loose.js b/test/fixtures/es-modules/loose.js
new file mode 100644
index 00000000000000..69147a3b8ca027
--- /dev/null
+++ b/test/fixtures/es-modules/loose.js
@@ -0,0 +1,3 @@
+// This file can be run or imported only if `--experimental-default-type=module` is set.
+export default 'module';
+console.log('executed');
diff --git a/test/fixtures/es-modules/noext-esm b/test/fixtures/es-modules/noext-esm
new file mode 100644
index 00000000000000..251d6e538a1fcf
--- /dev/null
+++ b/test/fixtures/es-modules/noext-esm
@@ -0,0 +1,2 @@
+export default 'module';
+console.log('executed');
diff --git a/test/fixtures/es-modules/noext-wasm b/test/fixtures/es-modules/noext-wasm
new file mode 100644
index 00000000000000..9e035904b2e4d0
Binary files /dev/null and b/test/fixtures/es-modules/noext-wasm differ
diff --git a/test/fixtures/es-modules/package-type-module/index.js b/test/fixtures/es-modules/package-type-module/index.js
index e8f4db3e164302..86d88056422197 100644
--- a/test/fixtures/es-modules/package-type-module/index.js
+++ b/test/fixtures/es-modules/package-type-module/index.js
@@ -1,4 +1,4 @@
-import 'dep/dep.js';
+import 'dep-without-package-json/dep.js';
 const identifier = 'package-type-module';
 console.log(identifier);
 export default identifier;
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-esm b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-esm
new file mode 100644
index 00000000000000..251d6e538a1fcf
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-esm
@@ -0,0 +1,2 @@
+export default 'module';
+console.log('executed');
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-wasm b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-wasm
new file mode 100644
index 00000000000000..9e035904b2e4d0
Binary files /dev/null and b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/noext-wasm differ
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/package.json b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/package.json
new file mode 100644
index 00000000000000..8d155c74efe78a
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/package.json
@@ -0,0 +1,8 @@
+{
+  "name": "dep-with-package-json-type-module",
+  "type": "module",
+  "version": "1.0.0",
+  "exports": {
+    "./*": "./*"
+  }
+}
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/wasm-dep.mjs b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/wasm-dep.mjs
new file mode 100644
index 00000000000000..a0e28aa17b6bd9
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-type-module/wasm-dep.mjs
@@ -0,0 +1,15 @@
+import { strictEqual } from 'assert';
+
+export function jsFn () {
+  state = 'WASM JS Function Executed';
+  return 42;
+}
+
+export let state = 'JS Function Executed';
+
+export function jsInitFn () {
+  strictEqual(state, 'JS Function Executed');
+  state = 'WASM Start Executed';
+}
+
+console.log('executed');
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/dep.js b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/dep.js
new file mode 100644
index 00000000000000..0d702867cd5ccf
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/dep.js
@@ -0,0 +1,2 @@
+// Controlling package.json has no "type" field -> should still be CommonJS as it is in node_modules
+module.exports = 42;
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/noext-cjs b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/noext-cjs
new file mode 100644
index 00000000000000..7712b3bad54497
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/noext-cjs
@@ -0,0 +1,3 @@
+// No package.json -> should still be CommonJS as it is in node_modules
+module.exports = 42;
+console.log('executed');
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/package.json b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/package.json
new file mode 100644
index 00000000000000..1b83367ebe3f5f
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/package.json
@@ -0,0 +1,7 @@
+{
+  "name": "dep-with-package-json-without-type",
+  "version": "1.0.0",
+  "exports": {
+    "./*": "./*"
+  }
+}
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/run.js b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/run.js
new file mode 100644
index 00000000000000..7712b3bad54497
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-with-package-json-without-type/run.js
@@ -0,0 +1,3 @@
+// No package.json -> should still be CommonJS as it is in node_modules
+module.exports = 42;
+console.log('executed');
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep/dep.js b/test/fixtures/es-modules/package-type-module/node_modules/dep-without-package-json/dep.js
similarity index 100%
rename from test/fixtures/es-modules/package-type-module/node_modules/dep/dep.js
rename to test/fixtures/es-modules/package-type-module/node_modules/dep-without-package-json/dep.js
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-without-package-json/noext-cjs b/test/fixtures/es-modules/package-type-module/node_modules/dep-without-package-json/noext-cjs
new file mode 100644
index 00000000000000..7712b3bad54497
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-without-package-json/noext-cjs
@@ -0,0 +1,3 @@
+// No package.json -> should still be CommonJS as it is in node_modules
+module.exports = 42;
+console.log('executed');
diff --git a/test/fixtures/es-modules/package-type-module/node_modules/dep-without-package-json/run.js b/test/fixtures/es-modules/package-type-module/node_modules/dep-without-package-json/run.js
new file mode 100644
index 00000000000000..7712b3bad54497
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/node_modules/dep-without-package-json/run.js
@@ -0,0 +1,3 @@
+// No package.json -> should still be CommonJS as it is in node_modules
+module.exports = 42;
+console.log('executed');
diff --git a/test/fixtures/es-modules/package-type-module/noext-wasm b/test/fixtures/es-modules/package-type-module/noext-wasm
new file mode 100644
index 00000000000000..9e035904b2e4d0
Binary files /dev/null and b/test/fixtures/es-modules/package-type-module/noext-wasm differ
diff --git a/test/fixtures/es-modules/package-type-module/wasm-dep.mjs b/test/fixtures/es-modules/package-type-module/wasm-dep.mjs
new file mode 100644
index 00000000000000..a0e28aa17b6bd9
--- /dev/null
+++ b/test/fixtures/es-modules/package-type-module/wasm-dep.mjs
@@ -0,0 +1,15 @@
+import { strictEqual } from 'assert';
+
+export function jsFn () {
+  state = 'WASM JS Function Executed';
+  return 42;
+}
+
+export let state = 'JS Function Executed';
+
+export function jsInitFn () {
+  strictEqual(state, 'JS Function Executed');
+  state = 'WASM Start Executed';
+}
+
+console.log('executed');
diff --git a/test/fixtures/es-modules/package-without-type/file#1.js b/test/fixtures/es-modules/package-without-type/file#1.js
new file mode 100644
index 00000000000000..6ab97dbf4b58cf
--- /dev/null
+++ b/test/fixtures/es-modules/package-without-type/file#1.js
@@ -0,0 +1 @@
+console.log('file#1');
diff --git a/test/fixtures/es-modules/package-without-type/module.js b/test/fixtures/es-modules/package-without-type/module.js
new file mode 100644
index 00000000000000..69147a3b8ca027
--- /dev/null
+++ b/test/fixtures/es-modules/package-without-type/module.js
@@ -0,0 +1,3 @@
+// This file can be run or imported only if `--experimental-default-type=module` is set.
+export default 'module';
+console.log('executed');
diff --git a/test/fixtures/es-modules/package-without-type/noext-esm b/test/fixtures/es-modules/package-without-type/noext-esm
new file mode 100644
index 00000000000000..69147a3b8ca027
--- /dev/null
+++ b/test/fixtures/es-modules/package-without-type/noext-esm
@@ -0,0 +1,3 @@
+// This file can be run or imported only if `--experimental-default-type=module` is set.
+export default 'module';
+console.log('executed');
diff --git a/test/fixtures/keys/cert-without-key.pfx b/test/fixtures/keys/cert-without-key.pfx
new file mode 100644
index 00000000000000..6d3dfca11fe984
Binary files /dev/null and b/test/fixtures/keys/cert-without-key.pfx differ
diff --git a/test/fixtures/permission/fs-traversal.js b/test/fixtures/permission/fs-traversal.js
index 2c35fb90ed6c1a..87132177643c45 100644
--- a/test/fixtures/permission/fs-traversal.js
+++ b/test/fixtures/permission/fs-traversal.js
@@ -6,11 +6,16 @@ const assert = require('assert');
 const fs = require('fs');
 const path = require('path');
 
+// This should not affect how the permission model resolves paths.
+const { resolve } = path;
+path.resolve = (s) => s;
+
 const blockedFolder = process.env.BLOCKEDFOLDER;
 const allowedFolder = process.env.ALLOWEDFOLDER;
-const traversalPath = allowedFolder + '../file.md';
-const traversalFolderPath = allowedFolder + '../folder';
-const bufferTraversalPath = Buffer.from(allowedFolder + '../file.md');
+const traversalPath = allowedFolder + '/../file.md';
+const traversalFolderPath = allowedFolder + '/../folder';
+const bufferTraversalPath = Buffer.from(traversalPath);
+const uint8ArrayTraversalPath = new TextEncoder().encode(traversalPath);
 
 {
   assert.ok(process.permission.has('fs.read', allowedFolder));
@@ -27,7 +32,7 @@ const bufferTraversalPath = Buffer.from(allowedFolder + '../file.md');
   }, common.expectsError({
     code: 'ERR_ACCESS_DENIED',
     permission: 'FileSystemWrite',
-    resource: path.toNamespacedPath(path.resolve(traversalPath)),
+    resource: path.toNamespacedPath(resolve(traversalPath)),
   }));
 }
 
@@ -39,7 +44,7 @@ const bufferTraversalPath = Buffer.from(allowedFolder + '../file.md');
   }, common.expectsError({
     code: 'ERR_ACCESS_DENIED',
     permission: 'FileSystemRead',
-    resource: path.toNamespacedPath(path.resolve(traversalPath)),
+    resource: path.toNamespacedPath(resolve(traversalPath)),
   }));
 }
 
@@ -51,7 +56,7 @@ const bufferTraversalPath = Buffer.from(allowedFolder + '../file.md');
   }, common.expectsError({
     code: 'ERR_ACCESS_DENIED',
     permission: 'FileSystemWrite',
-    resource: path.resolve(traversalFolderPath + 'XXXXXX'),
+    resource: resolve(traversalFolderPath + 'XXXXXX'),
   }));
 }
 
@@ -63,7 +68,7 @@ const bufferTraversalPath = Buffer.from(allowedFolder + '../file.md');
   }, common.expectsError({
     code: 'ERR_ACCESS_DENIED',
     permission: 'FileSystemWrite',
-    resource: path.resolve(traversalFolderPath + 'XXXXXX'),
+    resource: resolve(traversalFolderPath + 'XXXXXX'),
   }));
 }
 
@@ -75,7 +80,19 @@ const bufferTraversalPath = Buffer.from(allowedFolder + '../file.md');
   }, common.expectsError({
     code: 'ERR_ACCESS_DENIED',
     permission: 'FileSystemRead',
-    resource: path.resolve(traversalPath),
+    resource: resolve(traversalPath),
+  }));
+}
+
+{
+  assert.throws(() => {
+    fs.readFile(uint8ArrayTraversalPath, (error) => {
+      assert.ifError(error);
+    });
+  }, common.expectsError({
+    code: 'ERR_ACCESS_DENIED',
+    permission: 'FileSystemRead',
+    resource: resolve(traversalPath),
   }));
 }
 
diff --git a/test/fixtures/policy/crypto-hash-tampering/.gitattributes b/test/fixtures/policy/crypto-hash-tampering/.gitattributes
new file mode 100644
index 00000000000000..cbdcbbc258e6e7
--- /dev/null
+++ b/test/fixtures/policy/crypto-hash-tampering/.gitattributes
@@ -0,0 +1 @@
+*.js text eol=lf
diff --git a/test/fixtures/policy/crypto-hash-tampering/main.js b/test/fixtures/policy/crypto-hash-tampering/main.js
new file mode 100644
index 00000000000000..2ee233fe75461b
--- /dev/null
+++ b/test/fixtures/policy/crypto-hash-tampering/main.js
@@ -0,0 +1,8 @@
+const h = require('crypto').createHash('sha384');
+const fakeDigest = h.digest();
+
+const kHandle = Object.getOwnPropertySymbols(h)
+                      .find((s) => s.description === 'kHandle');
+h[kHandle].constructor.prototype.digest = () => fakeDigest;
+
+require('./protected.js');
diff --git a/test/fixtures/policy/crypto-hash-tampering/policy.json b/test/fixtures/policy/crypto-hash-tampering/policy.json
new file mode 100644
index 00000000000000..3d981911533f56
--- /dev/null
+++ b/test/fixtures/policy/crypto-hash-tampering/policy.json
@@ -0,0 +1,15 @@
+{
+  "resources": {
+    "./main.js": {
+      "integrity": true,
+      "dependencies": {
+        "./protected.js": true,
+        "crypto": true
+      }
+    },
+    "./protected.js": {
+      "integrity": "sha384-OLBgp1GsljhM2TJ+sbHjaiH9txEUvgdDTAzHv2P24donTt6/529l+9Ua0vFImLlb",
+      "dependencies": true
+    }
+  }
+}
diff --git a/test/fixtures/policy/crypto-hash-tampering/protected.js b/test/fixtures/policy/crypto-hash-tampering/protected.js
new file mode 100644
index 00000000000000..2b57adba5b191a
--- /dev/null
+++ b/test/fixtures/policy/crypto-hash-tampering/protected.js
@@ -0,0 +1 @@
+console.log(require('fs').readFileSync('/etc/passwd').length);
diff --git a/test/fixtures/snapshot/cwd.js b/test/fixtures/snapshot/cwd.js
new file mode 100644
index 00000000000000..4860cc6662af8a
--- /dev/null
+++ b/test/fixtures/snapshot/cwd.js
@@ -0,0 +1,10 @@
+const {
+  setDeserializeMainFunction,
+} = require('v8').startupSnapshot;
+
+// To make sure the cwd is present in the cache
+process.cwd();
+
+setDeserializeMainFunction(() => {
+  console.log(process.cwd());
+});
diff --git a/test/fixtures/source-map/output/source_map_sourcemapping_url_string.snapshot b/test/fixtures/source-map/output/source_map_sourcemapping_url_string.snapshot
index a2a988e82eda2c..6a109c904e1155 100644
--- a/test/fixtures/source-map/output/source_map_sourcemapping_url_string.snapshot
+++ b/test/fixtures/source-map/output/source_map_sourcemapping_url_string.snapshot
@@ -1,3 +1,3 @@
 Error: an exception.
     at Object.<anonymous> (*typescript-sourcemapping_url_string.ts:3:7)
-    at Module._compile (node:internal*modules*cjs*loader:1264:14)
+    *
diff --git a/test/fixtures/test-runner/custom_reporters/throwing-async.js b/test/fixtures/test-runner/custom_reporters/throwing-async.js
new file mode 100644
index 00000000000000..b24a632e697e4f
--- /dev/null
+++ b/test/fixtures/test-runner/custom_reporters/throwing-async.js
@@ -0,0 +1,8 @@
+'use strict';
+
+module.exports = async function * customReporter() {
+  yield 'Going to throw an error\n';
+  setImmediate(() => {
+    throw new Error('Reporting error');
+  });
+};
diff --git a/test/fixtures/test-runner/custom_reporters/throwing.js b/test/fixtures/test-runner/custom_reporters/throwing.js
new file mode 100644
index 00000000000000..8d04901c773ac8
--- /dev/null
+++ b/test/fixtures/test-runner/custom_reporters/throwing.js
@@ -0,0 +1,6 @@
+'use strict';
+
+module.exports = async function * customReporter() {
+  yield 'Going to throw an error\n';
+  throw new Error('Reporting error');
+};
diff --git a/test/fixtures/test-runner/output/abort.snapshot b/test/fixtures/test-runner/output/abort.snapshot
index ceca09da14bfb1..1b758a2314c486 100644
--- a/test/fixtures/test-runner/output/abort.snapshot
+++ b/test/fixtures/test-runner/output/abort.snapshot
@@ -32,7 +32,7 @@ TAP version 13
     # Subtest: not ok 2
     not ok 6 - not ok 2
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort.js:(LINE):7'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
@@ -41,7 +41,7 @@ TAP version 13
     # Subtest: not ok 3
     not ok 7 - not ok 3
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort.js:(LINE):7'
       failureType: 'testAborted'
       error: 'This operation was aborted'
@@ -62,7 +62,7 @@ TAP version 13
     # Subtest: not ok 4
     not ok 8 - not ok 4
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort.js:(LINE):7'
       failureType: 'testAborted'
       error: 'This operation was aborted'
@@ -83,7 +83,7 @@ TAP version 13
     # Subtest: not ok 5
     not ok 9 - not ok 5
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort.js:(LINE):7'
       failureType: 'testAborted'
       error: 'This operation was aborted'
@@ -169,7 +169,7 @@ not ok 2 - promise abort signal
     # Subtest: not ok 2
     not ok 6 - not ok 2
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort.js:(LINE):5'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
@@ -178,7 +178,7 @@ not ok 2 - promise abort signal
     # Subtest: not ok 3
     not ok 7 - not ok 3
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort.js:(LINE):5'
       failureType: 'testAborted'
       error: 'This operation was aborted'
@@ -199,7 +199,7 @@ not ok 2 - promise abort signal
     # Subtest: not ok 4
     not ok 8 - not ok 4
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort.js:(LINE):5'
       failureType: 'testAborted'
       error: 'This operation was aborted'
@@ -220,7 +220,7 @@ not ok 2 - promise abort signal
     # Subtest: not ok 5
     not ok 9 - not ok 5
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort.js:(LINE):5'
       failureType: 'testAborted'
       error: 'This operation was aborted'
diff --git a/test/fixtures/test-runner/output/abort_hooks.snapshot b/test/fixtures/test-runner/output/abort_hooks.snapshot
index d0b567bb6a22cd..278b5e5fd36ca5 100644
--- a/test/fixtures/test-runner/output/abort_hooks.snapshot
+++ b/test/fixtures/test-runner/output/abort_hooks.snapshot
@@ -11,7 +11,7 @@ TAP version 13
     # Subtest: test 1
     not ok 1 - test 1
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort_hooks.js:(LINE):3'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
@@ -20,7 +20,7 @@ TAP version 13
     # Subtest: test 2
     not ok 2 - test 2
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort_hooks.js:(LINE):3'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
diff --git a/test/fixtures/test-runner/output/abort_suite.snapshot b/test/fixtures/test-runner/output/abort_suite.snapshot
index e7e8c4f4e2360f..30d48d236ff4a5 100644
--- a/test/fixtures/test-runner/output/abort_suite.snapshot
+++ b/test/fixtures/test-runner/output/abort_suite.snapshot
@@ -32,7 +32,7 @@ TAP version 13
     # Subtest: not ok 2
     not ok 6 - not ok 2
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort_suite.js:(LINE):3'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
@@ -41,7 +41,7 @@ TAP version 13
     # Subtest: not ok 3
     not ok 7 - not ok 3
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort_suite.js:(LINE):3'
       failureType: 'testAborted'
       error: 'This operation was aborted'
@@ -62,7 +62,7 @@ TAP version 13
     # Subtest: not ok 4
     not ok 8 - not ok 4
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort_suite.js:(LINE):3'
       failureType: 'testAborted'
       error: 'This operation was aborted'
@@ -83,7 +83,7 @@ TAP version 13
     # Subtest: not ok 5
     not ok 9 - not ok 5
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/abort_suite.js:(LINE):3'
       failureType: 'testAborted'
       error: 'This operation was aborted'
diff --git a/test/fixtures/test-runner/output/arbitrary-output.snapshot b/test/fixtures/test-runner/output/arbitrary-output.snapshot
index 2389096398cd09..601aaa42f3c74a 100644
--- a/test/fixtures/test-runner/output/arbitrary-output.snapshot
+++ b/test/fixtures/test-runner/output/arbitrary-output.snapshot
@@ -1,17 +1,17 @@
 TAP version 13
 ok 1 - test
   ---
-  duration_ms: ZERO
+  duration_ms: *
   ...
 # arbitrary - pre
 ok 2 - test
   ---
-  duration_ms: ZERO
+  duration_ms: *
   ...
 # arbitrary - mid
 ok 3 - test
   ---
-  duration_ms: ZERO
+  duration_ms: *
   ...
 # arbitrary - post
 1..3
diff --git a/test/fixtures/test-runner/output/describe_it.snapshot b/test/fixtures/test-runner/output/describe_it.snapshot
index be345f11575c8d..1d4f7853ead0d1 100644
--- a/test/fixtures/test-runner/output/describe_it.snapshot
+++ b/test/fixtures/test-runner/output/describe_it.snapshot
@@ -513,7 +513,7 @@ not ok 51 - subtest sync throw fails
     # Subtest: should not run
     not ok 1 - should not run
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/describe_it.js:(LINE):3'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
@@ -544,7 +544,7 @@ not ok 52 - describe sync throw fails
     # Subtest: should not run
     not ok 1 - should not run
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/describe_it.js:(LINE):3'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
diff --git a/test/fixtures/test-runner/output/hooks.snapshot b/test/fixtures/test-runner/output/hooks.snapshot
index 5afe398ed3d0ea..6cf29612c535cb 100644
--- a/test/fixtures/test-runner/output/hooks.snapshot
+++ b/test/fixtures/test-runner/output/hooks.snapshot
@@ -37,7 +37,7 @@ ok 1 - describe hooks
     # Subtest: 1
     not ok 1 - 1
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/hooks.js:(LINE):3'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
@@ -46,7 +46,7 @@ ok 1 - describe hooks
     # Subtest: 2
     not ok 2 - 2
       ---
-      duration_ms: ZERO
+      duration_ms: *
       location: '/test/fixtures/test-runner/output/hooks.js:(LINE):3'
       failureType: 'cancelledByParent'
       error: 'test did not finish before its parent and was cancelled'
diff --git a/test/fixtures/test-runner/output/junit_reporter.snapshot b/test/fixtures/test-runner/output/junit_reporter.snapshot
index 6516387e7ed582..e0a4c331dd5c22 100644
--- a/test/fixtures/test-runner/output/junit_reporter.snapshot
+++ b/test/fixtures/test-runner/output/junit_reporter.snapshot
@@ -10,6 +10,7 @@
 		<skipped type="todo" message="true"/>
 		<failure type="testCodeFailure" message="thrown from sync fail todo">
 [Error [ERR_TEST_FAILURE]: thrown from sync fail todo] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from sync fail todo
       *
@@ -18,8 +19,7 @@
       *
       *
       *
-      at async Test.processPendingSubtests (node:internal/test_runner/test:374:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -27,6 +27,7 @@
 		<skipped type="todo" message="this is a failing todo"/>
 		<failure type="testCodeFailure" message="thrown from sync fail todo with message">
 [Error [ERR_TEST_FAILURE]: thrown from sync fail todo with message] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from sync fail todo with message
       *
@@ -35,8 +36,7 @@
       *
       *
       *
-      at async Test.processPendingSubtests (node:internal/test_runner/test:374:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -51,6 +51,7 @@
 	<testcase name="sync throw fail" time="*" classname="test" failure="thrown from sync throw fail">
 		<failure type="testCodeFailure" message="thrown from sync throw fail">
 [Error [ERR_TEST_FAILURE]: thrown from sync throw fail] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from sync throw fail
       *
@@ -59,8 +60,7 @@
       *
       *
       *
-      at async Test.processPendingSubtests (node:internal/test_runner/test:374:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -71,6 +71,7 @@
 	<testcase name="async throw fail" time="*" classname="test" failure="thrown from async throw fail">
 		<failure type="testCodeFailure" message="thrown from async throw fail">
 [Error [ERR_TEST_FAILURE]: thrown from async throw fail] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from async throw fail
       *
@@ -79,8 +80,7 @@
       *
       *
       *
-      at async Test.processPendingSubtests (node:internal/test_runner/test:374:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -88,6 +88,7 @@
 		<skipped type="skipped" message="true"/>
 		<failure type="testCodeFailure" message="thrown from async throw fail">
 [Error [ERR_TEST_FAILURE]: thrown from async throw fail] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from async throw fail
       *
@@ -96,8 +97,7 @@
       *
       *
       *
-      at async Test.processPendingSubtests (node:internal/test_runner/test:374:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -107,6 +107,7 @@
 
 true !== false
 ] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: AssertionError [ERR_ASSERTION]: Expected values to be strictly equal:
   
@@ -124,8 +125,7 @@ true !== false
     actual: true,
     expected: false,
     operator: 'strictEqual'
-  },
-  code: 'ERR_TEST_FAILURE'
+  }
 }
 		</failure>
 	</testcase>
@@ -133,6 +133,7 @@ true !== false
 	<testcase name="reject fail" time="*" classname="test" failure="rejected from reject fail">
 		<failure type="testCodeFailure" message="rejected from reject fail">
 [Error [ERR_TEST_FAILURE]: rejected from reject fail] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: rejected from reject fail
       *
@@ -141,8 +142,7 @@ true !== false
       *
       *
       *
-      at async Test.processPendingSubtests (node:internal/test_runner/test:374:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -156,6 +156,7 @@ true !== false
 			<failure type="testCodeFailure" message="thrown from subtest sync throw fail">
 Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from subtest sync throw fail
       *
@@ -167,8 +168,7 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
       *
       *
       *
-      at Test.postRun (node:internal/test_runner/test:715:19),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 			</failure>
 		</testcase>
@@ -176,7 +176,7 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
 	</testsuite>
 	<testcase name="sync throw non-error fail" time="*" classname="test" failure="Symbol(thrown symbol from sync throw non-error fail)">
 		<failure type="testCodeFailure" message="Symbol(thrown symbol from sync throw non-error fail)">
-[Error [ERR_TEST_FAILURE]: Symbol(thrown symbol from sync throw non-error fail)] { failureType: 'testCodeFailure', cause: Symbol(thrown symbol from sync throw non-error fail), code: 'ERR_TEST_FAILURE' }
+[Error [ERR_TEST_FAILURE]: Symbol(thrown symbol from sync throw non-error fail)] { code: 'ERR_TEST_FAILURE', failureType: 'testCodeFailure', cause: Symbol(thrown symbol from sync throw non-error fail) }
 		</failure>
 	</testcase>
 	<testsuite name="level 0a" time="*" disabled="0" errors="0" tests="4" failures="0" skipped="0" hostname="HOSTNAME">
@@ -188,7 +188,7 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
 	<testsuite name="top level" time="*" disabled="0" errors="0" tests="2" failures="1" skipped="0" hostname="HOSTNAME">
 		<testcase name="+long running" time="*" classname="test" failure="test did not finish before its parent and was cancelled">
 			<failure type="cancelledByParent" message="test did not finish before its parent and was cancelled">
-[Error [ERR_TEST_FAILURE]: test did not finish before its parent and was cancelled] { failureType: 'cancelledByParent', cause: 'test did not finish before its parent and was cancelled', code: 'ERR_TEST_FAILURE' }
+[Error [ERR_TEST_FAILURE]: test did not finish before its parent and was cancelled] { code: 'ERR_TEST_FAILURE', failureType: 'cancelledByParent', cause: 'test did not finish before its parent and was cancelled' }
 			</failure>
 		</testcase>
 		<testsuite name="+short running" time="*" disabled="0" errors="0" tests="1" failures="0" skipped="0" hostname="HOSTNAME">
@@ -205,6 +205,7 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
 	<testcase name="sync skip option is false fail" time="*" classname="test" failure="this should be executed">
 		<failure type="testCodeFailure" message="this should be executed">
 [Error [ERR_TEST_FAILURE]: this should be executed] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: this should be executed
       *
@@ -213,8 +214,7 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
       *
       *
       *
-      at async Test.processPendingSubtests (node:internal/test_runner/test:374:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -236,11 +236,11 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
 	<testcase name="callback fail" time="*" classname="test" failure="callback failure">
 		<failure type="testCodeFailure" message="callback failure">
 [Error [ERR_TEST_FAILURE]: callback failure] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: callback failure
       *
-      at process.processImmediate (node:internal/timers:478:21),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -249,12 +249,13 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
 	<testcase name="callback t is this in test" time="*" classname="test"/>
 	<testcase name="callback also returns a Promise" time="*" classname="test" failure="passed a callback but also returned a Promise">
 		<failure type="callbackAndPromisePresent" message="passed a callback but also returned a Promise">
-[Error [ERR_TEST_FAILURE]: passed a callback but also returned a Promise] { failureType: 'callbackAndPromisePresent', cause: 'passed a callback but also returned a Promise', code: 'ERR_TEST_FAILURE' }
+[Error [ERR_TEST_FAILURE]: passed a callback but also returned a Promise] { code: 'ERR_TEST_FAILURE', failureType: 'callbackAndPromisePresent', cause: 'passed a callback but also returned a Promise' }
 		</failure>
 	</testcase>
 	<testcase name="callback throw" time="*" classname="test" failure="thrown from callback throw">
 		<failure type="testCodeFailure" message="thrown from callback throw">
 [Error [ERR_TEST_FAILURE]: thrown from callback throw] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from callback throw
       *
@@ -263,8 +264,7 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
       *
       *
       *
-      at async Test.processPendingSubtests (node:internal/test_runner/test:374:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -273,9 +273,9 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fail
 Error [ERR_TEST_FAILURE]: callback invoked multiple times
     *
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'multipleCallbackInvocations',
-  cause: 'callback invoked multiple times',
-  code: 'ERR_TEST_FAILURE'
+  cause: 'callback invoked multiple times'
 }
 		</failure>
 	</testcase>
@@ -284,14 +284,14 @@ Error [ERR_TEST_FAILURE]: callback invoked multiple times
 		<failure type="uncaughtException" message="callback invoked multiple times">
 Error [ERR_TEST_FAILURE]: callback invoked multiple times
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'uncaughtException',
   cause: Error [ERR_TEST_FAILURE]: callback invoked multiple times
       * {
+    code: 'ERR_TEST_FAILURE',
     failureType: 'multipleCallbackInvocations',
-    cause: 'callback invoked multiple times',
-    code: 'ERR_TEST_FAILURE'
-  },
-  code: 'ERR_TEST_FAILURE'
+    cause: 'callback invoked multiple times'
+  }
 }
 		</failure>
 	</testcase>
@@ -299,11 +299,11 @@ Error [ERR_TEST_FAILURE]: callback invoked multiple times
 		<failure type="uncaughtException" message="thrown from callback async throw">
 Error [ERR_TEST_FAILURE]: thrown from callback async throw
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'uncaughtException',
   cause: Error: thrown from callback async throw
       *
-      at process.processImmediate (node:internal/timers:478:21),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -319,7 +319,7 @@ Error [ERR_TEST_FAILURE]: thrown from callback async throw
 	<!-- 'only' and 'runOnly' require the &#45;&#45;test-only command-line option. -->
 	<testcase name="custom inspect symbol fail" time="*" classname="test" failure="customized">
 		<failure type="testCodeFailure" message="customized">
-[Error [ERR_TEST_FAILURE]: customized] { failureType: 'testCodeFailure', cause: customized, code: 'ERR_TEST_FAILURE' }
+[Error [ERR_TEST_FAILURE]: customized] { code: 'ERR_TEST_FAILURE', failureType: 'testCodeFailure', cause: customized }
 		</failure>
 	</testcase>
 	<testcase name="custom inspect symbol that throws fail" time="*" classname="test" failure="{  foo: 1,  [Symbol(nodejs.util.inspect.custom)]: [Function: [nodejs.util.inspect.custom]]}">
@@ -328,9 +328,9 @@ Error [ERR_TEST_FAILURE]: thrown from callback async throw
   foo: 1,
   [Symbol(nodejs.util.inspect.custom)]: [Function: [nodejs.util.inspect.custom]]
 }] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
-  cause: { foo: 1, [Symbol(nodejs.util.inspect.custom)]: [Function: [nodejs.util.inspect.custom]] },
-  code: 'ERR_TEST_FAILURE'
+  cause: { foo: 1, [Symbol(nodejs.util.inspect.custom)]: [Function: [nodejs.util.inspect.custom]] }
 }
 		</failure>
 	</testcase>
@@ -339,6 +339,7 @@ Error [ERR_TEST_FAILURE]: thrown from callback async throw
 			<failure type="testCodeFailure" message="thrown from subtest sync throw fails at first">
 Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fails at first
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from subtest sync throw fails at first
       *
@@ -350,8 +351,7 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fails at first
       *
       *
       *
-      at Test.postRun (node:internal/test_runner/test:715:19),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 			</failure>
 		</testcase>
@@ -359,6 +359,7 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fails at first
 			<failure type="testCodeFailure" message="thrown from subtest sync throw fails at second">
 Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fails at second
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: Error: thrown from subtest sync throw fails at second
       *
@@ -370,20 +371,19 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fails at second
       *
       *
       *
-      at async Test.run (node:internal/test_runner/test:632:9),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 			</failure>
 		</testcase>
 	</testsuite>
 	<testcase name="timed out async test" time="*" classname="test" failure="test timed out after 5ms">
 		<failure type="testTimeoutFailure" message="test timed out after 5ms">
-[Error [ERR_TEST_FAILURE]: test timed out after 5ms] { failureType: 'testTimeoutFailure', cause: 'test timed out after 5ms', code: 'ERR_TEST_FAILURE' }
+[Error [ERR_TEST_FAILURE]: test timed out after 5ms] { code: 'ERR_TEST_FAILURE', failureType: 'testTimeoutFailure', cause: 'test timed out after 5ms' }
 		</failure>
 	</testcase>
 	<testcase name="timed out callback test" time="*" classname="test" failure="test timed out after 5ms">
 		<failure type="testTimeoutFailure" message="test timed out after 5ms">
-[Error [ERR_TEST_FAILURE]: test timed out after 5ms] { failureType: 'testTimeoutFailure', cause: 'test timed out after 5ms', code: 'ERR_TEST_FAILURE' }
+[Error [ERR_TEST_FAILURE]: test timed out after 5ms] { code: 'ERR_TEST_FAILURE', failureType: 'testTimeoutFailure', cause: 'test timed out after 5ms' }
 		</failure>
 	</testcase>
 	<testcase name="large timeout async test is ok" time="*" classname="test"/>
@@ -391,19 +391,19 @@ Error [ERR_TEST_FAILURE]: thrown from subtest sync throw fails at second
 	<testcase name="successful thenable" time="*" classname="test"/>
 	<testcase name="rejected thenable" time="*" classname="test" failure="custom error">
 		<failure type="testCodeFailure" message="custom error">
-[Error [ERR_TEST_FAILURE]: custom error] { failureType: 'testCodeFailure', cause: 'custom error', code: 'ERR_TEST_FAILURE' }
+[Error [ERR_TEST_FAILURE]: custom error] { code: 'ERR_TEST_FAILURE', failureType: 'testCodeFailure', cause: 'custom error' }
 		</failure>
 	</testcase>
 	<testcase name="unfinished test with uncaughtException" time="*" classname="test" failure="foo">
 		<failure type="uncaughtException" message="foo">
 Error [ERR_TEST_FAILURE]: foo
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'uncaughtException',
   cause: Error: foo
       *
       *
-      at process.processTimers (node:internal/timers:514:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -411,12 +411,12 @@ Error [ERR_TEST_FAILURE]: foo
 		<failure type="unhandledRejection" message="bar">
 Error [ERR_TEST_FAILURE]: bar
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'unhandledRejection',
   cause: Error: bar
       *
       *
-      at process.processTimers (node:internal/timers:514:7),
-  code: 'ERR_TEST_FAILURE'
+      *
 }
 		</failure>
 	</testcase>
@@ -435,6 +435,7 @@ should loosely deep-equal
   bar: 2,
   c: [Circular *1]
 }] {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'testCodeFailure',
   cause: AssertionError [ERR_ASSERTION]: Expected values to be loosely deep-equal:
   
@@ -455,8 +456,7 @@ should loosely deep-equal
     actual: [Object],
     expected: [Object],
     operator: 'deepEqual'
-  },
-  code: 'ERR_TEST_FAILURE'
+  }
 }
 		</failure>
 	</testcase>
@@ -464,9 +464,9 @@ should loosely deep-equal
 		<failure type="parentAlreadyFinished" message="test could not be started because its parent finished">
 Error [ERR_TEST_FAILURE]: test could not be started because its parent finished
     * {
+  code: 'ERR_TEST_FAILURE',
   failureType: 'parentAlreadyFinished',
-  cause: 'test could not be started because its parent finished',
-  code: 'ERR_TEST_FAILURE'
+  cause: 'test could not be started because its parent finished'
 }
 		</failure>
 	</testcase>
diff --git a/test/fixtures/test-runner/output/spec_reporter.snapshot b/test/fixtures/test-runner/output/spec_reporter.snapshot
index 5dc05d5b43c12d..8f14dc7fc9bade 100644
--- a/test/fixtures/test-runner/output/spec_reporter.snapshot
+++ b/test/fixtures/test-runner/output/spec_reporter.snapshot
@@ -178,9 +178,9 @@
  callback called twice in future tick (*ms)
   Error [ERR_TEST_FAILURE]: callback invoked multiple times
       * {
+    code: 'ERR_TEST_FAILURE',
     failureType: 'multipleCallbackInvocations',
-    cause: 'callback invoked multiple times',
-    code: 'ERR_TEST_FAILURE'
+    cause: 'callback invoked multiple times'
   }
 
  callback async throw (*ms)
@@ -449,9 +449,9 @@
  callback called twice in future tick (*ms)
   Error [ERR_TEST_FAILURE]: callback invoked multiple times
       * {
+    code: 'ERR_TEST_FAILURE',
     failureType: 'multipleCallbackInvocations',
-    cause: 'callback invoked multiple times',
-    code: 'ERR_TEST_FAILURE'
+    cause: 'callback invoked multiple times'
   }
 
 *
diff --git a/test/fixtures/test-runner/output/spec_reporter_cli.snapshot b/test/fixtures/test-runner/output/spec_reporter_cli.snapshot
index 25c22069c3b8e7..a9b70560d905b2 100644
--- a/test/fixtures/test-runner/output/spec_reporter_cli.snapshot
+++ b/test/fixtures/test-runner/output/spec_reporter_cli.snapshot
@@ -178,9 +178,9 @@
  callback called twice in future tick (*ms)
   Error [ERR_TEST_FAILURE]: callback invoked multiple times
       * {
+    code: 'ERR_TEST_FAILURE',
     failureType: 'multipleCallbackInvocations',
-    cause: 'callback invoked multiple times',
-    code: 'ERR_TEST_FAILURE'
+    cause: 'callback invoked multiple times'
   }
 
  callback async throw (*ms)
@@ -449,9 +449,9 @@
  callback called twice in future tick (*ms)
   Error [ERR_TEST_FAILURE]: callback invoked multiple times
       * {
+    code: 'ERR_TEST_FAILURE',
     failureType: 'multipleCallbackInvocations',
-    cause: 'callback invoked multiple times',
-    code: 'ERR_TEST_FAILURE'
+    cause: 'callback invoked multiple times'
   }
 
 *
diff --git a/test/fixtures/test-runner/output/unresolved_promise.snapshot b/test/fixtures/test-runner/output/unresolved_promise.snapshot
index 839ec311a65e04..0090885468c338 100644
--- a/test/fixtures/test-runner/output/unresolved_promise.snapshot
+++ b/test/fixtures/test-runner/output/unresolved_promise.snapshot
@@ -18,7 +18,7 @@ not ok 2 - never resolving promise
 # Subtest: fail
 not ok 3 - fail
   ---
-  duration_ms: ZERO
+  duration_ms: *
   location: '/test/fixtures/test-runner/output/unresolved_promise.js:(LINE):1'
   failureType: 'cancelledByParent'
   error: 'Promise resolution is still pending but the event loop has already resolved'
diff --git a/test/fixtures/test-runner/test_only.js b/test/fixtures/test-runner/test_only.js
new file mode 100644
index 00000000000000..efc79b9dfadca6
--- /dev/null
+++ b/test/fixtures/test-runner/test_only.js
@@ -0,0 +1,5 @@
+'use strict';
+const test = require('node:test');
+
+test('this should be skipped');
+test.only('this should be executed');
diff --git a/test/fixtures/wpt/README.md b/test/fixtures/wpt/README.md
index 890c8f9e1dbe3b..15f1fc695bd762 100644
--- a/test/fixtures/wpt/README.md
+++ b/test/fixtures/wpt/README.md
@@ -31,7 +31,7 @@ Last update:
 - user-timing: https://github.com/web-platform-tests/wpt/tree/5ae85bf826/user-timing
 - wasm/jsapi: https://github.com/web-platform-tests/wpt/tree/cde25e7e3c/wasm/jsapi
 - wasm/webapi: https://github.com/web-platform-tests/wpt/tree/fd1b23eeaa/wasm/webapi
-- WebCryptoAPI: https://github.com/web-platform-tests/wpt/tree/17b7ca10fd/WebCryptoAPI
+- WebCryptoAPI: https://github.com/web-platform-tests/wpt/tree/d4e14d714c/WebCryptoAPI
 - webidl/ecmascript-binding/es-exceptions: https://github.com/web-platform-tests/wpt/tree/a370aad338/webidl/ecmascript-binding/es-exceptions
 - webmessaging/broadcastchannel: https://github.com/web-platform-tests/wpt/tree/e97fac4791/webmessaging/broadcastchannel
 
diff --git a/test/fixtures/wpt/WebCryptoAPI/import_export/ec_importKey.https.any.js b/test/fixtures/wpt/WebCryptoAPI/import_export/ec_importKey.https.any.js
index 25defa369c1d31..31f062e313f6fe 100644
--- a/test/fixtures/wpt/WebCryptoAPI/import_export/ec_importKey.https.any.js
+++ b/test/fixtures/wpt/WebCryptoAPI/import_export/ec_importKey.https.any.js
@@ -71,7 +71,7 @@
             [true, false].forEach(function(extractable) {
 
                 // Test public keys first
-                [[]].forEach(function(usages) { // Only valid usages argument is empty array
+                allValidUsages(vector.publicUsages, true).forEach(function(usages) {
                     ['spki', 'spki_compressed', 'jwk', 'raw', 'raw_compressed'].forEach(function(format) {
                         var algorithm = {name: vector.name, namedCurve: curve};
                         var data = keyData[curve];
@@ -88,7 +88,7 @@
                 ['pkcs8', 'jwk'].forEach(function(format) {
                     var algorithm = {name: vector.name, namedCurve: curve};
                     var data = keyData[curve];
-                    allValidUsages(vector.privateUsages, []).forEach(function(usages) {
+                    allValidUsages(vector.privateUsages).forEach(function(usages) {
                         testFormat(format, algorithm, data, curve, usages, extractable);
                     });
                     testEmptyUsages(format, algorithm, data, curve, extractable);
@@ -219,46 +219,6 @@
         return base64String.replace(/=/g, "");
     }
 
-    // Want to test every valid combination of usages. Start by creating a list
-    // of all non-empty subsets to possible usages.
-    function allNonemptySubsetsOf(arr) {
-        var results = [];
-        var firstElement;
-        var remainingElements;
-
-        for(var i=0; i<arr.length; i++) {
-            firstElement = arr[i];
-            remainingElements = arr.slice(i+1);
-            results.push([firstElement]);
-
-            if (remainingElements.length > 0) {
-                allNonemptySubsetsOf(remainingElements).forEach(function(combination) {
-                    combination.push(firstElement);
-                    results.push(combination);
-                });
-            }
-        }
-
-        return results;
-    }
-
-    // Return a list of all valid usage combinations, given the possible ones
-    // and the ones that are required for a particular operation.
-    function allValidUsages(possibleUsages, requiredUsages) {
-        var allUsages = [];
-
-        allNonemptySubsetsOf(possibleUsages).forEach(function(usage) {
-            for (var i=0; i<requiredUsages.length; i++) {
-                if (!usage.includes(requiredUsages[i])) {
-                    return;
-                }
-            }
-            allUsages.push(usage);
-        });
-
-        return allUsages;
-    }
-
     // Convert method parameters to a string to uniquely name each test
     function parameterString(format, compressed, data, algorithm, extractable, usages) {
         if ("byteLength" in data) {
@@ -311,4 +271,3 @@
 
         return "{" + keyValuePairs.join(", ") + "}";
     }
-
diff --git a/test/fixtures/wpt/WebCryptoAPI/import_export/okp_importKey.https.any.js b/test/fixtures/wpt/WebCryptoAPI/import_export/okp_importKey.https.any.js
index 2257a5fa418ad5..a56bd31cbe14b1 100644
--- a/test/fixtures/wpt/WebCryptoAPI/import_export/okp_importKey.https.any.js
+++ b/test/fixtures/wpt/WebCryptoAPI/import_export/okp_importKey.https.any.js
@@ -72,7 +72,7 @@
         [true, false].forEach(function(extractable) {
 
             // Test public keys first
-            [[]].forEach(function(usages) { // Only valid usages argument is empty array
+            allValidUsages(vector.publicUsages, true).forEach(function(usages) {
                 ['spki', 'jwk', 'raw'].forEach(function(format) {
                     var algorithm = {name: vector.name};
                     var data = keyData[vector.name];
@@ -81,17 +81,27 @@
                     }
 
                     testFormat(format, algorithm, data, vector.name, usages, extractable);
+
+                    // Test for https://github.com/WICG/webcrypto-secure-curves/pull/24
+                    if (format === "jwk" && extractable) {
+                        testJwkAlgBehaviours(algorithm, data.jwk, vector.name, usages);
+                    }
                 });
 
             });
 
             // Next, test private keys
-            allValidUsages(vector.privateUsages, []).forEach(function(usages) {
+            allValidUsages(vector.privateUsages).forEach(function(usages) {
                 ['pkcs8', 'jwk'].forEach(function(format) {
                     var algorithm = {name: vector.name};
                     var data = keyData[vector.name];
 
                     testFormat(format, algorithm, data, vector.name, usages, extractable);
+
+                    // Test for https://github.com/WICG/webcrypto-secure-curves/pull/24
+                    if (format === "jwk" && extractable) {
+                        testJwkAlgBehaviours(algorithm, data.jwk, vector.name, usages);
+                    }
                 });
             });
         });
@@ -126,6 +136,28 @@
         }, "Good parameters: " + keySize.toString() + " bits " + parameterString(format, keyData[format], algorithm, extractable, usages));
     }
 
+    // Test importKey/exportKey "alg" behaviours, alg is ignored upon import and alg is missing for Ed25519 and Ed448 JWK export
+    // https://github.com/WICG/webcrypto-secure-curves/pull/24
+    function testJwkAlgBehaviours(algorithm, keyData, crv, usages) {
+        promise_test(function(test) {
+            return subtle.importKey('jwk', { ...keyData, alg: 'this is ignored' }, algorithm, true, usages).
+            then(function(key) {
+                assert_equals(key.constructor, CryptoKey, "Imported a CryptoKey object");
+
+                return subtle.exportKey('jwk', key).
+                then(function(result) {
+                    assert_equals(Object.keys(result).length, keyData.d ? 6 : 5, "Correct number of JWK members");
+                    assert_equals(result.alg, undefined, 'No JWK "alg" member is present');
+                    assert_true(equalJwk(keyData, result), "Round trip works");
+                }, function(err) {
+                    assert_unreached("Threw an unexpected error: " + err.toString());
+                });
+            }, function(err) {
+                assert_unreached("Threw an unexpected error: " + err.toString());
+            });
+        }, "Good parameters with ignored JWK alg: " + crv.toString() + " " + parameterString('jwk', keyData, algorithm, true, usages));
+    }
+
 
 
     // Helper methods follow:
@@ -194,46 +226,6 @@
         return base64String.replace(/=/g, "");
     }
 
-    // Want to test every valid combination of usages. Start by creating a list
-    // of all non-empty subsets to possible usages.
-    function allNonemptySubsetsOf(arr) {
-        var results = [];
-        var firstElement;
-        var remainingElements;
-
-        for(var i=0; i<arr.length; i++) {
-            firstElement = arr[i];
-            remainingElements = arr.slice(i+1);
-            results.push([firstElement]);
-
-            if (remainingElements.length > 0) {
-                allNonemptySubsetsOf(remainingElements).forEach(function(combination) {
-                    combination.push(firstElement);
-                    results.push(combination);
-                });
-            }
-        }
-
-        return results;
-    }
-
-    // Return a list of all valid usage combinations, given the possible ones
-    // and the ones that are required for a particular operation.
-    function allValidUsages(possibleUsages, requiredUsages) {
-        var allUsages = [];
-
-        allNonemptySubsetsOf(possibleUsages).forEach(function(usage) {
-            for (var i=0; i<requiredUsages.length; i++) {
-                if (!usage.includes(requiredUsages[i])) {
-                    return;
-                }
-            }
-            allUsages.push(usage);
-        });
-
-        return allUsages;
-    }
-
     // Convert method parameters to a string to uniquely name each test
     function parameterString(format, data, algorithm, extractable, usages) {
         if ("byteLength" in data) {
diff --git a/test/fixtures/wpt/WebCryptoAPI/import_export/rsa_importKey.https.any.js b/test/fixtures/wpt/WebCryptoAPI/import_export/rsa_importKey.https.any.js
index 5582b2f506b067..c0917cab683caa 100644
--- a/test/fixtures/wpt/WebCryptoAPI/import_export/rsa_importKey.https.any.js
+++ b/test/fixtures/wpt/WebCryptoAPI/import_export/rsa_importKey.https.any.js
@@ -78,7 +78,7 @@
                 [true, false].forEach(function(extractable) {
 
                     // Test public keys first
-                    allValidUsages(vector.publicUsages, []).forEach(function(usages) {
+                    allValidUsages(vector.publicUsages, true).forEach(function(usages) {
                         ['spki', 'jwk'].forEach(function(format) {
                             var algorithm = {name: vector.name, hash: hash};
                             var data = keyData[size];
@@ -95,7 +95,7 @@
                     ['pkcs8', 'jwk'].forEach(function(format) {
                         var algorithm = {name: vector.name, hash: hash};
                         var data = keyData[size];
-                        allValidUsages(vector.privateUsages, []).forEach(function(usages) {
+                        allValidUsages(vector.privateUsages).forEach(function(usages) {
                             testFormat(format, algorithm, data, size, usages, extractable);
                         });
                         testEmptyUsages(format, algorithm, data, size, extractable);
@@ -217,46 +217,6 @@
         return base64String.replace(/=/g, "");
     }
 
-    // Want to test every valid combination of usages. Start by creating a list
-    // of all non-empty subsets to possible usages.
-    function allNonemptySubsetsOf(arr) {
-        var results = [];
-        var firstElement;
-        var remainingElements;
-
-        for(var i=0; i<arr.length; i++) {
-            firstElement = arr[i];
-            remainingElements = arr.slice(i+1);
-            results.push([firstElement]);
-
-            if (remainingElements.length > 0) {
-                allNonemptySubsetsOf(remainingElements).forEach(function(combination) {
-                    combination.push(firstElement);
-                    results.push(combination);
-                });
-            }
-        }
-
-        return results;
-    }
-
-    // Return a list of all valid usage combinations, given the possible ones
-    // and the ones that are required for a particular operation.
-    function allValidUsages(possibleUsages, requiredUsages) {
-        var allUsages = [];
-
-        allNonemptySubsetsOf(possibleUsages).forEach(function(usage) {
-            for (var i=0; i<requiredUsages.length; i++) {
-                if (!usage.includes(requiredUsages[i])) {
-                    return;
-                }
-            }
-            allUsages.push(usage);
-        });
-
-        return allUsages;
-    }
-
     // Convert method parameters to a string to uniquely name each test
     function parameterString(format, data, algorithm, extractable, usages) {
         if ("byteLength" in data) {
diff --git a/test/fixtures/wpt/WebCryptoAPI/import_export/symmetric_importKey.https.any.js b/test/fixtures/wpt/WebCryptoAPI/import_export/symmetric_importKey.https.any.js
index a9ce9be0a1becf..01b3180189db83 100644
--- a/test/fixtures/wpt/WebCryptoAPI/import_export/symmetric_importKey.https.any.js
+++ b/test/fixtures/wpt/WebCryptoAPI/import_export/symmetric_importKey.https.any.js
@@ -49,7 +49,7 @@
                         data = jwkData(keyData, algorithm);
                     }
                     // Generate all combinations of valid usages for testing
-                    allValidUsages(vector.legalUsages, []).forEach(function(usages) {
+                    allValidUsages(vector.legalUsages).forEach(function(usages) {
                         testFormat(format, algorithm, data, keyData.length * 8, usages, extractable);
                     });
                     testEmptyUsages(format, algorithm, data, keyData.length * 8, extractable);
@@ -173,46 +173,6 @@
         return base64String.replace(/=/g, "");
     }
 
-    // Want to test every valid combination of usages. Start by creating a list
-    // of all non-empty subsets to possible usages.
-    function allNonemptySubsetsOf(arr) {
-        var results = [];
-        var firstElement;
-        var remainingElements;
-
-        for(var i=0; i<arr.length; i++) {
-            firstElement = arr[i];
-            remainingElements = arr.slice(i+1);
-            results.push([firstElement]);
-
-            if (remainingElements.length > 0) {
-                allNonemptySubsetsOf(remainingElements).forEach(function(combination) {
-                    combination.push(firstElement);
-                    results.push(combination);
-                });
-            }
-        }
-
-        return results;
-    }
-
-    // Return a list of all valid usage combinations, given the possible ones
-    // and the ones that are required for a particular operation.
-    function allValidUsages(possibleUsages, requiredUsages) {
-        var allUsages = [];
-
-        allNonemptySubsetsOf(possibleUsages).forEach(function(usage) {
-            for (var i=0; i<requiredUsages.length; i++) {
-                if (!usage.includes(requiredUsages[i])) {
-                    return;
-                }
-            }
-            allUsages.push(usage);
-        });
-
-        return allUsages;
-    }
-
     // Convert method parameters to a string to uniquely name each test
     function parameterString(format, data, algorithm, extractable, usages) {
         var result = "(" +
diff --git a/test/fixtures/wpt/WebCryptoAPI/sign_verify/eddsa.js b/test/fixtures/wpt/WebCryptoAPI/sign_verify/eddsa.js
index d425fec2dc343e..d77a8808831176 100644
--- a/test/fixtures/wpt/WebCryptoAPI/sign_verify/eddsa.js
+++ b/test/fixtures/wpt/WebCryptoAPI/sign_verify/eddsa.js
@@ -167,6 +167,7 @@ function run_test() {
           promise_test(function(test) {
               return subtle.sign(algorithm, vector.privateKey, vector.data)
               .then(function(signature) {
+                  assert_true(equalBuffers(signature, vector.signature), "Signing did not give the expected output");
                   // Can we verify the signature?
                   return subtle.verify(algorithm, vector.publicKey, signature, vector.data)
                   .then(function(is_verified) {
diff --git a/test/fixtures/wpt/WebCryptoAPI/sign_verify/hmac.js b/test/fixtures/wpt/WebCryptoAPI/sign_verify/hmac.js
index 8df4b042f54cf6..f5e2ad2769cdd8 100644
--- a/test/fixtures/wpt/WebCryptoAPI/sign_verify/hmac.js
+++ b/test/fixtures/wpt/WebCryptoAPI/sign_verify/hmac.js
@@ -117,6 +117,7 @@ function run_test() {
             promise_test(function(test) {
                 return subtle.sign({name: "HMAC", hash: vector.hash}, vector.key, vector.plaintext)
                 .then(function(signature) {
+                    assert_true(equalBuffers(signature, vector.signature), "Signing did not give the expected output");
                     // Can we get the verify the new signature?
                     return subtle.verify({name: "HMAC", hash: vector.hash}, vector.key, signature, vector.plaintext)
                     .then(function(is_verified) {
diff --git a/test/fixtures/wpt/WebCryptoAPI/util/helpers.js b/test/fixtures/wpt/WebCryptoAPI/util/helpers.js
index ce240a1549cb21..bda97003263ff4 100644
--- a/test/fixtures/wpt/WebCryptoAPI/util/helpers.js
+++ b/test/fixtures/wpt/WebCryptoAPI/util/helpers.js
@@ -235,7 +235,7 @@ function allValidUsages(validUsages, emptyIsValid, mandatoryUsages) {
         }
     });
 
-    if (emptyIsValid) {
+    if (emptyIsValid && validUsages.length !== 0) {
         okaySubsets.push([]);
     }
 
diff --git a/test/fixtures/wpt/versions.json b/test/fixtures/wpt/versions.json
index 21d93af89f03d8..e069e93b99efd6 100644
--- a/test/fixtures/wpt/versions.json
+++ b/test/fixtures/wpt/versions.json
@@ -84,7 +84,7 @@
     "path": "wasm/webapi"
   },
   "WebCryptoAPI": {
-    "commit": "17b7ca10fd17ab22e60d62da6bc6e7424ea52740",
+    "commit": "d4e14d714c5242e174ba9aec43caf5eb514d0f09",
     "path": "WebCryptoAPI"
   },
   "webidl/ecmascript-binding/es-exceptions": {
diff --git a/test/js-native-api/test_finalizer/binding.gyp b/test/js-native-api/test_finalizer/binding.gyp
new file mode 100644
index 00000000000000..4c63346f30ce74
--- /dev/null
+++ b/test/js-native-api/test_finalizer/binding.gyp
@@ -0,0 +1,11 @@
+{
+  "targets": [
+    {
+      "target_name": "test_finalizer",
+      "defines": [ "NAPI_EXPERIMENTAL" ],
+      "sources": [
+        "test_finalizer.c"
+      ]
+    }
+  ]
+}
diff --git a/test/js-native-api/test_finalizer/test.js b/test/js-native-api/test_finalizer/test.js
new file mode 100644
index 00000000000000..cfbf57239c3a6d
--- /dev/null
+++ b/test/js-native-api/test_finalizer/test.js
@@ -0,0 +1,43 @@
+'use strict';
+// Flags: --expose-gc
+
+const common = require('../../common');
+const test_finalizer = require(`./build/${common.buildType}/test_finalizer`);
+const assert = require('assert');
+
+// The goal of this test is to show that we can run "pure" finalizers in the
+// current JS loop tick. Thus, we do not use common.gcUntil function works
+// asynchronously using micro tasks.
+// We use IIFE for the obj scope instead of {} to be compatible with
+// non-V8 JS engines that do not support scoped variables.
+(() => {
+  const obj = {};
+  test_finalizer.addFinalizer(obj);
+})();
+
+for (let i = 0; i < 10; ++i) {
+  global.gc();
+  if (test_finalizer.getFinalizerCallCount() === 1) {
+    break;
+  }
+}
+
+assert.strictEqual(test_finalizer.getFinalizerCallCount(), 1);
+
+// The finalizer that access JS cannot run synchronously. They are run in the
+// next JS loop tick. Thus, we must use common.gcUntil.
+async function runAsyncTests() {
+  // We do not use common.mustCall() because we want to see the finalizer
+  // called in response to GC and not as a part of env destruction.
+  let js_is_called = false;
+  // We use IIFE for the obj scope instead of {} to be compatible with
+  // non-V8 JS engines that do not support scoped variables.
+  (() => {
+    const obj = {};
+    test_finalizer.addFinalizerWithJS(obj, () => { js_is_called = true; });
+  })();
+  await common.gcUntil('ensure JS finalizer called',
+                       () => (test_finalizer.getFinalizerCallCount() === 2));
+  assert(js_is_called);
+}
+runAsyncTests();
diff --git a/test/js-native-api/test_finalizer/test_fatal_finalize.js b/test/js-native-api/test_finalizer/test_fatal_finalize.js
new file mode 100644
index 00000000000000..352310128a97f6
--- /dev/null
+++ b/test/js-native-api/test_finalizer/test_fatal_finalize.js
@@ -0,0 +1,31 @@
+'use strict';
+const common = require('../../common');
+
+if (process.argv[2] === 'child') {
+  const test_finalizer = require(`./build/${common.buildType}/test_finalizer`);
+
+  (() => {
+    const obj = {};
+    test_finalizer.addFinalizerFailOnJS(obj);
+  })();
+
+  // Collect garbage 10 times. At least one of those should throw the exception
+  // and cause the whole process to bail with it, its text printed to stderr and
+  // asserted by the parent process to match expectations.
+  let gcCount = 10;
+  (function gcLoop() {
+    global.gc();
+    if (--gcCount > 0) {
+      setImmediate(() => gcLoop());
+    }
+  })();
+  return;
+}
+
+const assert = require('assert');
+const { spawnSync } = require('child_process');
+const child = spawnSync(process.execPath, [
+  '--expose-gc', __filename, 'child',
+]);
+assert.strictEqual(child.signal, common.isWindows ? null : 'SIGABRT');
+assert.match(child.stderr.toString(), /Finalizer is calling a function that may affect GC state/);
diff --git a/test/js-native-api/test_finalizer/test_finalizer.c b/test/js-native-api/test_finalizer/test_finalizer.c
new file mode 100644
index 00000000000000..378781b7042f96
--- /dev/null
+++ b/test/js-native-api/test_finalizer/test_finalizer.c
@@ -0,0 +1,146 @@
+#include <js_native_api.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "../common.h"
+#include "../entry_point.h"
+
+typedef struct {
+  int32_t finalize_count;
+  napi_ref js_func;
+} FinalizerData;
+
+static void finalizerOnlyCallback(napi_env env,
+                                  void* finalize_data,
+                                  void* finalize_hint) {
+  FinalizerData* data = (FinalizerData*)finalize_data;
+  int32_t count = ++data->finalize_count;
+
+  // It is safe to access instance data
+  NODE_API_CALL_RETURN_VOID(env, napi_get_instance_data(env, (void**)&data));
+  NODE_API_ASSERT_RETURN_VOID(env,
+                              count = data->finalize_count,
+                              "Expected to be the same FinalizerData");
+}
+
+static void finalizerCallingJSCallback(napi_env env,
+                                       void* finalize_data,
+                                       void* finalize_hint) {
+  napi_value js_func, undefined;
+  FinalizerData* data = (FinalizerData*)finalize_data;
+  NODE_API_CALL_RETURN_VOID(
+      env, napi_get_reference_value(env, data->js_func, &js_func));
+  NODE_API_CALL_RETURN_VOID(env, napi_get_undefined(env, &undefined));
+  NODE_API_CALL_RETURN_VOID(
+      env, napi_call_function(env, undefined, js_func, 0, NULL, NULL));
+  NODE_API_CALL_RETURN_VOID(env, napi_delete_reference(env, data->js_func));
+  data->js_func = NULL;
+  ++data->finalize_count;
+}
+
+// Schedule async finalizer to run JavaScript-touching code.
+static void finalizerWithJSCallback(napi_env env,
+                                    void* finalize_data,
+                                    void* finalize_hint) {
+  NODE_API_CALL_RETURN_VOID(
+      env,
+      node_api_post_finalizer(
+          env, finalizerCallingJSCallback, finalize_data, finalize_hint));
+}
+
+static void finalizerWithFailedJSCallback(napi_env env,
+                                          void* finalize_data,
+                                          void* finalize_hint) {
+  napi_value obj;
+  FinalizerData* data = (FinalizerData*)finalize_data;
+  ++data->finalize_count;
+  NODE_API_CALL_RETURN_VOID(env, napi_create_object(env, &obj));
+}
+
+static napi_value addFinalizer(napi_env env, napi_callback_info info) {
+  size_t argc = 1;
+  napi_value argv[1] = {0};
+  FinalizerData* data;
+
+  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, argv, NULL, NULL));
+  NODE_API_CALL(env, napi_get_instance_data(env, (void**)&data));
+  NODE_API_CALL(env,
+                napi_add_finalizer(
+                    env, argv[0], data, finalizerOnlyCallback, NULL, NULL));
+  return NULL;
+}
+
+// This finalizer is going to call JavaScript from finalizer and succeed.
+static napi_value addFinalizerWithJS(napi_env env, napi_callback_info info) {
+  size_t argc = 2;
+  napi_value argv[2] = {0};
+  napi_valuetype arg_type;
+  FinalizerData* data;
+
+  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, argv, NULL, NULL));
+  NODE_API_CALL(env, napi_get_instance_data(env, (void**)&data));
+  NODE_API_CALL(env, napi_typeof(env, argv[1], &arg_type));
+  NODE_API_ASSERT(
+      env, arg_type == napi_function, "Expected function as the second arg");
+  NODE_API_CALL(env, napi_create_reference(env, argv[1], 1, &data->js_func));
+  NODE_API_CALL(env,
+                napi_add_finalizer(
+                    env, argv[0], data, finalizerWithJSCallback, NULL, NULL));
+  return NULL;
+}
+
+// This finalizer is going to call JavaScript from finalizer and fail.
+static napi_value addFinalizerFailOnJS(napi_env env, napi_callback_info info) {
+  size_t argc = 1;
+  napi_value argv[1] = {0};
+  FinalizerData* data;
+
+  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, argv, NULL, NULL));
+  NODE_API_CALL(env, napi_get_instance_data(env, (void**)&data));
+  NODE_API_CALL(
+      env,
+      napi_add_finalizer(
+          env, argv[0], data, finalizerWithFailedJSCallback, NULL, NULL));
+  return NULL;
+}
+
+static napi_value getFinalizerCallCount(napi_env env, napi_callback_info info) {
+  size_t argc = 1;
+  napi_value argv[1];
+  FinalizerData* data;
+  napi_value result;
+
+  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, argv, NULL, NULL));
+  NODE_API_CALL(env, napi_get_instance_data(env, (void**)&data));
+  NODE_API_CALL(env, napi_create_int32(env, data->finalize_count, &result));
+  return result;
+}
+
+static void finalizeData(napi_env env, void* data, void* hint) {
+  free(data);
+}
+
+EXTERN_C_START
+napi_value Init(napi_env env, napi_value exports) {
+  FinalizerData* data = (FinalizerData*)malloc(sizeof(FinalizerData));
+  NODE_API_ASSERT(env, data != NULL, "Failed to allocate memory");
+  memset(data, 0, sizeof(FinalizerData));
+  NODE_API_CALL(env, napi_set_instance_data(env, data, finalizeData, NULL));
+  napi_property_descriptor descriptors[] = {
+      DECLARE_NODE_API_PROPERTY("addFinalizer", addFinalizer),
+      DECLARE_NODE_API_PROPERTY("addFinalizerWithJS", addFinalizerWithJS),
+      DECLARE_NODE_API_PROPERTY("addFinalizerFailOnJS", addFinalizerFailOnJS),
+      DECLARE_NODE_API_PROPERTY("getFinalizerCallCount",
+                                getFinalizerCallCount)};
+
+  NODE_API_CALL(
+      env,
+      napi_define_properties(env,
+                             exports,
+                             sizeof(descriptors) / sizeof(*descriptors),
+                             descriptors));
+
+  return exports;
+}
+EXTERN_C_END
diff --git a/test/js-native-api/test_reference/binding.gyp b/test/js-native-api/test_reference/binding.gyp
index d8940028915f15..a9d81ef9d2c05d 100644
--- a/test/js-native-api/test_reference/binding.gyp
+++ b/test/js-native-api/test_reference/binding.gyp
@@ -5,6 +5,12 @@
       "sources": [
         "test_reference.c"
       ]
+    },
+    {
+      "target_name": "test_finalizer",
+      "sources": [
+        "test_finalizer.c"
+      ]
     }
   ]
 }
diff --git a/test/js-native-api/test_reference/test_finalizer.c b/test/js-native-api/test_reference/test_finalizer.c
new file mode 100644
index 00000000000000..51492d9623f69c
--- /dev/null
+++ b/test/js-native-api/test_reference/test_finalizer.c
@@ -0,0 +1,71 @@
+#include <assert.h>
+#include <js_native_api.h>
+#include <stdlib.h>
+#include "../common.h"
+#include "../entry_point.h"
+
+static int test_value = 1;
+static int finalize_count = 0;
+
+static void FinalizeExternalCallJs(napi_env env, void* data, void* hint) {
+  int* actual_value = data;
+  NODE_API_ASSERT_RETURN_VOID(
+      env,
+      actual_value == &test_value,
+      "The correct pointer was passed to the finalizer");
+
+  napi_ref finalizer_ref = (napi_ref)hint;
+  napi_value js_finalizer;
+  napi_value recv;
+  NODE_API_CALL_RETURN_VOID(
+      env, napi_get_reference_value(env, finalizer_ref, &js_finalizer));
+  NODE_API_CALL_RETURN_VOID(env, napi_get_global(env, &recv));
+  NODE_API_CALL_RETURN_VOID(
+      env, napi_call_function(env, recv, js_finalizer, 0, NULL, NULL));
+  NODE_API_CALL_RETURN_VOID(env, napi_delete_reference(env, finalizer_ref));
+}
+
+static napi_value CreateExternalWithJsFinalize(napi_env env,
+                                               napi_callback_info info) {
+  size_t argc = 1;
+  napi_value args[1];
+  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, args, NULL, NULL));
+  NODE_API_ASSERT(env, argc == 1, "Wrong number of arguments");
+  napi_value finalizer = args[0];
+  napi_valuetype finalizer_valuetype;
+  NODE_API_CALL(env, napi_typeof(env, finalizer, &finalizer_valuetype));
+  NODE_API_ASSERT(env,
+                  finalizer_valuetype == napi_function,
+                  "Wrong type of first argument");
+  napi_ref finalizer_ref;
+  NODE_API_CALL(env, napi_create_reference(env, finalizer, 1, &finalizer_ref));
+
+  napi_value result;
+  NODE_API_CALL(env,
+                napi_create_external(env,
+                                     &test_value,
+                                     FinalizeExternalCallJs,
+                                     finalizer_ref, /* finalize_hint */
+                                     &result));
+
+  finalize_count = 0;
+  return result;
+}
+
+EXTERN_C_START
+napi_value Init(napi_env env, napi_value exports) {
+  napi_property_descriptor descriptors[] = {
+      DECLARE_NODE_API_PROPERTY("createExternalWithJsFinalize",
+                                CreateExternalWithJsFinalize),
+  };
+
+  NODE_API_CALL(
+      env,
+      napi_define_properties(env,
+                             exports,
+                             sizeof(descriptors) / sizeof(*descriptors),
+                             descriptors));
+
+  return exports;
+}
+EXTERN_C_END
diff --git a/test/js-native-api/test_reference/test_finalizer.js b/test/js-native-api/test_reference/test_finalizer.js
index b70582fd0342fe..a5270512dc87c1 100644
--- a/test/js-native-api/test_reference/test_finalizer.js
+++ b/test/js-native-api/test_reference/test_finalizer.js
@@ -2,7 +2,7 @@
 // Flags: --expose-gc --force-node-api-uncaught-exceptions-policy
 
 const common = require('../../common');
-const test_reference = require(`./build/${common.buildType}/test_reference`);
+const binding = require(`./build/${common.buildType}/test_finalizer`);
 const assert = require('assert');
 
 process.on('uncaughtException', common.mustCall((err) => {
@@ -11,7 +11,7 @@ process.on('uncaughtException', common.mustCall((err) => {
 
 (async function() {
   {
-    test_reference.createExternalWithJsFinalize(
+    binding.createExternalWithJsFinalize(
       common.mustCall(() => {
         throw new Error('finalizer error');
       }));
diff --git a/test/js-native-api/test_reference/test_reference.c b/test/js-native-api/test_reference/test_reference.c
index 82c1f17d9dce0e..058be07363588b 100644
--- a/test/js-native-api/test_reference/test_reference.c
+++ b/test/js-native-api/test_reference/test_reference.c
@@ -22,20 +22,6 @@ static void FinalizeExternal(napi_env env, void* data, void* hint) {
   finalize_count++;
 }
 
-static void FinalizeExternalCallJs(napi_env env, void* data, void* hint) {
-  int *actual_value = data;
-  NODE_API_ASSERT_RETURN_VOID(env, actual_value == &test_value,
-      "The correct pointer was passed to the finalizer");
-
-  napi_ref finalizer_ref = (napi_ref)hint;
-  napi_value js_finalizer;
-  napi_value recv;
-  NODE_API_CALL_RETURN_VOID(env, napi_get_reference_value(env, finalizer_ref, &js_finalizer));
-  NODE_API_CALL_RETURN_VOID(env, napi_get_global(env, &recv));
-  NODE_API_CALL_RETURN_VOID(env, napi_call_function(env, recv, js_finalizer, 0, NULL, NULL));
-  NODE_API_CALL_RETURN_VOID(env, napi_delete_reference(env, finalizer_ref));
-}
-
 static napi_value CreateExternal(napi_env env, napi_callback_info info) {
   int* data = &test_value;
 
@@ -118,31 +104,6 @@ CreateExternalWithFinalize(napi_env env, napi_callback_info info) {
   return result;
 }
 
-static napi_value
-CreateExternalWithJsFinalize(napi_env env, napi_callback_info info) {
-  size_t argc = 1;
-  napi_value args[1];
-  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, args, NULL, NULL));
-  NODE_API_ASSERT(env, argc == 1, "Wrong number of arguments");
-  napi_value finalizer = args[0];
-  napi_valuetype finalizer_valuetype;
-  NODE_API_CALL(env, napi_typeof(env, finalizer, &finalizer_valuetype));
-  NODE_API_ASSERT(env, finalizer_valuetype == napi_function, "Wrong type of first argument");
-  napi_ref finalizer_ref;
-  NODE_API_CALL(env, napi_create_reference(env, finalizer, 1, &finalizer_ref));
-
-  napi_value result;
-  NODE_API_CALL(env,
-      napi_create_external(env,
-                           &test_value,
-                           FinalizeExternalCallJs,
-                           finalizer_ref, /* finalize_hint */
-                           &result));
-
-  finalize_count = 0;
-  return result;
-}
-
 static napi_value CheckExternal(napi_env env, napi_callback_info info) {
   size_t argc = 1;
   napi_value arg;
@@ -263,24 +224,24 @@ static napi_value ValidateDeleteBeforeFinalize(napi_env env, napi_callback_info
 EXTERN_C_START
 napi_value Init(napi_env env, napi_value exports) {
   napi_property_descriptor descriptors[] = {
-    DECLARE_NODE_API_GETTER("finalizeCount", GetFinalizeCount),
-    DECLARE_NODE_API_PROPERTY("createExternal", CreateExternal),
-    DECLARE_NODE_API_PROPERTY("createExternalWithFinalize",
-        CreateExternalWithFinalize),
-    DECLARE_NODE_API_PROPERTY("createExternalWithJsFinalize",
-        CreateExternalWithJsFinalize),
-    DECLARE_NODE_API_PROPERTY("checkExternal", CheckExternal),
-    DECLARE_NODE_API_PROPERTY("createReference", CreateReference),
-    DECLARE_NODE_API_PROPERTY("createSymbol", CreateSymbol),
-    DECLARE_NODE_API_PROPERTY("createSymbolFor", CreateSymbolFor),
-    DECLARE_NODE_API_PROPERTY("createSymbolForEmptyString", CreateSymbolForEmptyString),
-    DECLARE_NODE_API_PROPERTY("createSymbolForIncorrectLength", CreateSymbolForIncorrectLength),
-    DECLARE_NODE_API_PROPERTY("deleteReference", DeleteReference),
-    DECLARE_NODE_API_PROPERTY("incrementRefcount", IncrementRefcount),
-    DECLARE_NODE_API_PROPERTY("decrementRefcount", DecrementRefcount),
-    DECLARE_NODE_API_GETTER("referenceValue", GetReferenceValue),
-    DECLARE_NODE_API_PROPERTY("validateDeleteBeforeFinalize",
-                          ValidateDeleteBeforeFinalize),
+      DECLARE_NODE_API_GETTER("finalizeCount", GetFinalizeCount),
+      DECLARE_NODE_API_PROPERTY("createExternal", CreateExternal),
+      DECLARE_NODE_API_PROPERTY("createExternalWithFinalize",
+                                CreateExternalWithFinalize),
+      DECLARE_NODE_API_PROPERTY("checkExternal", CheckExternal),
+      DECLARE_NODE_API_PROPERTY("createReference", CreateReference),
+      DECLARE_NODE_API_PROPERTY("createSymbol", CreateSymbol),
+      DECLARE_NODE_API_PROPERTY("createSymbolFor", CreateSymbolFor),
+      DECLARE_NODE_API_PROPERTY("createSymbolForEmptyString",
+                                CreateSymbolForEmptyString),
+      DECLARE_NODE_API_PROPERTY("createSymbolForIncorrectLength",
+                                CreateSymbolForIncorrectLength),
+      DECLARE_NODE_API_PROPERTY("deleteReference", DeleteReference),
+      DECLARE_NODE_API_PROPERTY("incrementRefcount", IncrementRefcount),
+      DECLARE_NODE_API_PROPERTY("decrementRefcount", DecrementRefcount),
+      DECLARE_NODE_API_GETTER("referenceValue", GetReferenceValue),
+      DECLARE_NODE_API_PROPERTY("validateDeleteBeforeFinalize",
+                                ValidateDeleteBeforeFinalize),
   };
 
   NODE_API_CALL(env, napi_define_properties(
diff --git a/test/known_issues/test-cwd-enoent-file.js b/test/known_issues/test-cwd-enoent-file.js
index 0f75896134f7e3..6d99987895baf4 100644
--- a/test/known_issues/test-cwd-enoent-file.js
+++ b/test/known_issues/test-cwd-enoent-file.js
@@ -5,7 +5,7 @@
 const common = require('../common');
 const assert = require('assert');
 
-if (common.isSunOS || common.isWindows || common.isAIX) {
+if (common.isSunOS || common.isWindows || common.isAIX || common.isIBMi) {
   // The current working directory cannot be removed on these platforms.
   // Change this to common.skip() when this is no longer a known issue test.
   assert.fail('cannot rmdir current working directory');
diff --git a/test/message/eval_messages.out b/test/message/eval_messages.out
index 3f44332c03a470..e07bbe4d6acd3c 100644
--- a/test/message/eval_messages.out
+++ b/test/message/eval_messages.out
@@ -2,10 +2,9 @@
 [eval]:1
 with(this){__filename}
 ^^^^
+
 SyntaxError: Strict mode code may not include a with statement
-    at new Script (node:vm:*:*)
-    at createScript (node:vm:*:*)
-    at Object.runInThisContext (node:vm:*:*)
+    at makeContextifyScript (node:internal/vm:*:*)
     at node:internal/process/execution:*:*
     at [eval]-wrapper:*:*
     at runScript (node:internal/process/execution:*:*)
@@ -21,8 +20,7 @@ throw new Error("hello")
 
 Error: hello
     at [eval]:1:7
-    at Script.runInThisContext (node:vm:*:*)
-    at Object.runInThisContext (node:vm:*:*)
+    at runScriptInThisContext (node:internal/vm:*:*)
     at node:internal/process/execution:*:*
     at [eval]-wrapper:*:*
     at runScript (node:internal/process/execution:*:*)
@@ -37,8 +35,7 @@ throw new Error("hello")
 
 Error: hello
     at [eval]:1:7
-    at Script.runInThisContext (node:vm:*:*)
-    at Object.runInThisContext (node:vm:*:*)
+    at runScriptInThisContext (node:internal/vm:*:*)
     at node:internal/process/execution:*:*
     at [eval]-wrapper:*:*
     at runScript (node:internal/process/execution:*:*)
@@ -53,8 +50,7 @@ var x = 100; y = x;
 
 ReferenceError: y is not defined
     at [eval]:1:16
-    at Script.runInThisContext (node:vm:*:*)
-    at Object.runInThisContext (node:vm:*:*)
+    at runScriptInThisContext (node:internal/vm:*:*)
     at node:internal/process/execution:*:*
     at [eval]-wrapper:*:*
     at runScript (node:internal/process/execution:*:*)
diff --git a/test/message/internal_assert.out b/test/message/internal_assert.out
index bd25c879478083..197b863bf6ae69 100644
--- a/test/message/internal_assert.out
+++ b/test/message/internal_assert.out
@@ -5,7 +5,6 @@ node:internal/assert:*
 Error [ERR_INTERNAL_ASSERTION]: This is caused by either a bug in Node.js or incorrect usage of Node.js internals.
 Please open an issue with this stack trace at https://github.com/nodejs/node/issues
 
-    at new NodeError (node:internal/errors:*:*)
     at assert (node:internal/assert:*:*)
     at * (*test*message*internal_assert.js:7:1)
     at *
diff --git a/test/message/internal_assert_fail.out b/test/message/internal_assert_fail.out
index 408d6d3364470d..e6895691cda9c1 100644
--- a/test/message/internal_assert_fail.out
+++ b/test/message/internal_assert_fail.out
@@ -6,7 +6,6 @@ Error [ERR_INTERNAL_ASSERTION]: Unreachable!
 This is caused by either a bug in Node.js or incorrect usage of Node.js internals.
 Please open an issue with this stack trace at https://github.com/nodejs/node/issues
 
-    at new NodeError (node:internal/errors:*:*)
     at Function.fail (node:internal/assert:*:*)
     at * (*test*message*internal_assert_fail.js:7:8)
     at *
diff --git a/test/message/promise_unhandled_warn_with_error.out b/test/message/promise_unhandled_warn_with_error.out
deleted file mode 100644
index 66c98c57f71717..00000000000000
--- a/test/message/promise_unhandled_warn_with_error.out
+++ /dev/null
@@ -1,10 +0,0 @@
-*UnhandledPromiseRejectionWarning: Error: alas
-    at *promise_unhandled_warn_with_error.js:*:*
-    at *
-    at *
-    at *
-    at *
-    at *
-    at *
-(Use `* --trace-warnings ...` to show where the warning was created)
-*UnhandledPromiseRejectionWarning: Unhandled promise rejection. This error originated either by throwing inside of an async function without a catch block, or by rejecting a promise which was not handled with .catch(). To terminate the node process on unhandled promise rejection, use the CLI flag `--unhandled-rejections=strict` (see https://nodejs.org/api/cli.html#cli_unhandled_rejections_mode). (rejection id: 1)
\ No newline at end of file
diff --git a/test/message/stdin_messages.out b/test/message/stdin_messages.out
index 3fd047aacb11a2..6afc8a62d7fcd9 100644
--- a/test/message/stdin_messages.out
+++ b/test/message/stdin_messages.out
@@ -4,9 +4,7 @@ with(this){__filename}
 ^^^^
 
 SyntaxError: Strict mode code may not include a with statement
-    at new Script (node:vm:*)
-    at createScript (node:vm:*)
-    at Object.runInThisContext (node:vm:*)
+    at makeContextifyScript (node:internal/vm:*:*)
     at node:internal/process/execution:*:*
     at [stdin]-wrapper:*:*
     at runScript (node:internal/process/execution:*:*)
@@ -14,6 +12,8 @@ SyntaxError: Strict mode code may not include a with statement
     at node:internal/main/eval_stdin:*:*
     at Socket.<anonymous> (node:internal/process/execution:*:*)
     at Socket.emit (node:events:*:*)
+    at endReadableNT (node:internal/streams/readable:*:*)
+    at process.processTicksAndRejections (node:internal/process/task_queues:*:*)
 
 Node.js *
 42
@@ -24,8 +24,7 @@ throw new Error("hello")
 
 Error: hello
     at [stdin]:1:7
-    at Script.runInThisContext (node:vm:*)
-    at Object.runInThisContext (node:vm:*)
+    at runScriptInThisContext (node:internal/vm:*:*)
     at node:internal/process/execution:*:*
     at [stdin]-wrapper:*:*
     at runScript (node:internal/process/execution:*:*)
@@ -33,6 +32,7 @@ Error: hello
     at node:internal/main/eval_stdin:*:*
     at Socket.<anonymous> (node:internal/process/execution:*:*)
     at Socket.emit (node:events:*:*)
+    at endReadableNT (node:internal/streams/readable:*:*)
 
 Node.js *
 [stdin]:1
@@ -41,8 +41,7 @@ throw new Error("hello")
 
 Error: hello
     at [stdin]:1:*
-    at Script.runInThisContext (node:vm:*)
-    at Object.runInThisContext (node:vm:*)
+    at runScriptInThisContext (node:internal/vm:*:*)
     at node:internal/process/execution:*:*
     at [stdin]-wrapper:*:*
     at runScript (node:internal/process/execution:*:*)
@@ -50,6 +49,7 @@ Error: hello
     at node:internal/main/eval_stdin:*:*
     at Socket.<anonymous> (node:internal/process/execution:*:*)
     at Socket.emit (node:events:*:*)
+    at endReadableNT (node:internal/streams/readable:*:*)
 
 Node.js *
 100
@@ -59,8 +59,7 @@ let x = 100; y = x;
 
 ReferenceError: y is not defined
     at [stdin]:1:16
-    at Script.runInThisContext (node:vm:*)
-    at Object.runInThisContext (node:vm:*)
+    at runScriptInThisContext (node:internal/vm:*:*)
     at node:internal/process/execution:*:*
     at [stdin]-wrapper:*:*
     at runScript (node:internal/process/execution:*:*)
@@ -68,6 +67,7 @@ ReferenceError: y is not defined
     at node:internal/main/eval_stdin:*:*
     at Socket.<anonymous> (node:internal/process/execution:*:*)
     at Socket.emit (node:events:*:*)
+    at endReadableNT (node:internal/streams/readable:*:*)
 
 Node.js *
 
diff --git a/test/message/test-no-extra-info-on-fatal-exception.out b/test/message/test-no-extra-info-on-fatal-exception.out
deleted file mode 100644
index d26573344cc41a..00000000000000
--- a/test/message/test-no-extra-info-on-fatal-exception.out
+++ /dev/null
@@ -1,6 +0,0 @@
-*:7
-throw new Error('foo');
-^
-
-Error: foo
-    at Object.<anonymous> (*:7:7)
diff --git a/test/message/throw_error_with_getter_throw.out b/test/message/throw_error_with_getter_throw.out
deleted file mode 100644
index 565acfe9e6bf06..00000000000000
--- a/test/message/throw_error_with_getter_throw.out
+++ /dev/null
@@ -1,8 +0,0 @@
-
-*:3
-throw {  // eslint-disable-line no-throw-literal
-^
-[object Object]
-(Use `* --trace-uncaught ...` to show where the exception was thrown)
-
-Node.js *
diff --git a/test/message/throw_null.out b/test/message/throw_null.out
deleted file mode 100644
index 0fe2a49d050b18..00000000000000
--- a/test/message/throw_null.out
+++ /dev/null
@@ -1,8 +0,0 @@
-
-*test*message*throw_null.js:*
-throw null;
-^
-null
-(Use `* --trace-uncaught ...` to show where the exception was thrown)
-
-Node.js *
diff --git a/test/message/throw_undefined.out b/test/message/throw_undefined.out
deleted file mode 100644
index 56b0cac4259d6d..00000000000000
--- a/test/message/throw_undefined.out
+++ /dev/null
@@ -1,8 +0,0 @@
-
-*test*message*throw_undefined.js:*
-throw undefined;
-^
-undefined
-(Use `* --trace-uncaught ...` to show where the exception was thrown)
-
-Node.js *
diff --git a/test/message/timeout_throw.out b/test/message/timeout_throw.out
deleted file mode 100644
index 83b861caa7ca29..00000000000000
--- a/test/message/timeout_throw.out
+++ /dev/null
@@ -1,9 +0,0 @@
-*test*message*timeout_throw.js:*
-  undefined_reference_error_maker;
-  ^
-ReferenceError: undefined_reference_error_maker is not defined
-    at Timeout._onTimeout (*test*message*timeout_throw.js:*:*)
-    at listOnTimeout (node:internal/timers:*:*)
-    at process.processTimers (node:internal/timers:*:*)
-
-Node.js *
diff --git a/test/message/undefined_reference_in_new_context.out b/test/message/undefined_reference_in_new_context.out
deleted file mode 100644
index 8d8228bd902950..00000000000000
--- a/test/message/undefined_reference_in_new_context.out
+++ /dev/null
@@ -1,13 +0,0 @@
-before
-evalmachine.<anonymous>:1
-Error.stackTraceLimit = 5; foo.bar = 5;
-                           ^
-
-ReferenceError: foo is not defined
-    at evalmachine.<anonymous>:*:*
-    at Script.runInContext (node:vm:*)
-    at Script.runInNewContext (node:vm:*)
-    at Object.runInNewContext (node:vm:*)
-    at Object.<anonymous> (*test*message*undefined_reference_in_new_context.js:*)
-
-Node.js *
diff --git a/test/message/unhandled_promise_trace_warnings.out b/test/message/unhandled_promise_trace_warnings.out
deleted file mode 100644
index a8717d0e13d1e4..00000000000000
--- a/test/message/unhandled_promise_trace_warnings.out
+++ /dev/null
@@ -1,26 +0,0 @@
-(node:*) UnhandledPromiseRejectionWarning: Error: This was rejected
-    at * (*test*message*unhandled_promise_trace_warnings.js:*)
-    at *
-    at *
-    at *
-    at *
-    at *
-    at *
-    at *
-    at *
-    at *
-(node:*) Error: This was rejected
-    at * (*test*message*unhandled_promise_trace_warnings.js:*)
-    at *
-    at *
-    at *
-    at *
-    at *
-    at *
-(node:*) PromiseRejectionHandledWarning: Promise rejection was handled asynchronously (rejection id: 1)
-    at handledRejection (node:internal/process/promises:*)
-    at promiseRejectHandler (node:internal/process/promises:*)
-    at Promise.then *
-    at Promise.catch *
-    at Immediate.<anonymous> (*test*message*unhandled_promise_trace_warnings.js:*)
-    at *
diff --git a/test/node-api/test_buffer/binding.gyp b/test/node-api/test_buffer/binding.gyp
index e41a3993cd7c9d..e5d0955ae6308e 100644
--- a/test/node-api/test_buffer/binding.gyp
+++ b/test/node-api/test_buffer/binding.gyp
@@ -3,6 +3,10 @@
     {
       "target_name": "test_buffer",
       "sources": [ "test_buffer.c" ]
+    },
+    {
+      "target_name": "test_finalizer",
+      "sources": [ "test_finalizer.c" ]
     }
   ]
 }
diff --git a/test/node-api/test_buffer/test_buffer.c b/test/node-api/test_buffer/test_buffer.c
index bc61cd7a2e9062..013a7e2d417fbe 100644
--- a/test/node-api/test_buffer/test_buffer.c
+++ b/test/node-api/test_buffer/test_buffer.c
@@ -22,17 +22,6 @@ static void noopDeleter(napi_env env, void* data, void* finalize_hint) {
   deleterCallCount++;
 }
 
-static void malignDeleter(napi_env env, void* data, void* finalize_hint) {
-  NODE_API_ASSERT_RETURN_VOID(env, data != NULL && strcmp(data, theText) == 0, "invalid data");
-  napi_ref finalizer_ref = (napi_ref)finalize_hint;
-  napi_value js_finalizer;
-  napi_value recv;
-  NODE_API_CALL_RETURN_VOID(env, napi_get_reference_value(env, finalizer_ref, &js_finalizer));
-  NODE_API_CALL_RETURN_VOID(env, napi_get_global(env, &recv));
-  NODE_API_CALL_RETURN_VOID(env, napi_call_function(env, recv, js_finalizer, 0, NULL, NULL));
-  NODE_API_CALL_RETURN_VOID(env, napi_delete_reference(env, finalizer_ref));
-}
-
 static napi_value newBuffer(napi_env env, napi_callback_info info) {
   napi_value theBuffer;
   char* theCopy;
@@ -118,30 +107,6 @@ static napi_value staticBuffer(napi_env env, napi_callback_info info) {
   return theBuffer;
 }
 
-static napi_value malignFinalizerBuffer(napi_env env, napi_callback_info info) {
-  size_t argc = 1;
-  napi_value args[1];
-  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, args, NULL, NULL));
-  NODE_API_ASSERT(env, argc == 1, "Wrong number of arguments");
-  napi_value finalizer = args[0];
-  napi_valuetype finalizer_valuetype;
-  NODE_API_CALL(env, napi_typeof(env, finalizer, &finalizer_valuetype));
-  NODE_API_ASSERT(env, finalizer_valuetype == napi_function, "Wrong type of first argument");
-  napi_ref finalizer_ref;
-  NODE_API_CALL(env, napi_create_reference(env, finalizer, 1, &finalizer_ref));
-
-  napi_value theBuffer;
-  NODE_API_CALL(
-      env,
-      napi_create_external_buffer(env,
-                                  sizeof(theText),
-                                  (void*)theText,
-                                  malignDeleter,
-                                  finalizer_ref,  // finalize_hint
-                                  &theBuffer));
-  return theBuffer;
-}
-
 static napi_value Init(napi_env env, napi_value exports) {
   napi_value theValue;
 
@@ -151,14 +116,13 @@ static napi_value Init(napi_env env, napi_value exports) {
       napi_set_named_property(env, exports, "theText", theValue));
 
   napi_property_descriptor methods[] = {
-    DECLARE_NODE_API_PROPERTY("newBuffer", newBuffer),
-    DECLARE_NODE_API_PROPERTY("newExternalBuffer", newExternalBuffer),
-    DECLARE_NODE_API_PROPERTY("getDeleterCallCount", getDeleterCallCount),
-    DECLARE_NODE_API_PROPERTY("copyBuffer", copyBuffer),
-    DECLARE_NODE_API_PROPERTY("bufferHasInstance", bufferHasInstance),
-    DECLARE_NODE_API_PROPERTY("bufferInfo", bufferInfo),
-    DECLARE_NODE_API_PROPERTY("staticBuffer", staticBuffer),
-    DECLARE_NODE_API_PROPERTY("malignFinalizerBuffer", malignFinalizerBuffer),
+      DECLARE_NODE_API_PROPERTY("newBuffer", newBuffer),
+      DECLARE_NODE_API_PROPERTY("newExternalBuffer", newExternalBuffer),
+      DECLARE_NODE_API_PROPERTY("getDeleterCallCount", getDeleterCallCount),
+      DECLARE_NODE_API_PROPERTY("copyBuffer", copyBuffer),
+      DECLARE_NODE_API_PROPERTY("bufferHasInstance", bufferHasInstance),
+      DECLARE_NODE_API_PROPERTY("bufferInfo", bufferInfo),
+      DECLARE_NODE_API_PROPERTY("staticBuffer", staticBuffer),
   };
 
   NODE_API_CALL(env, napi_define_properties(
diff --git a/test/node-api/test_buffer/test_finalizer.c b/test/node-api/test_buffer/test_finalizer.c
new file mode 100644
index 00000000000000..eb5426d8f29cdf
--- /dev/null
+++ b/test/node-api/test_buffer/test_finalizer.c
@@ -0,0 +1,61 @@
+#include <node_api.h>
+#include <stdlib.h>
+#include <string.h>
+#include "../../js-native-api/common.h"
+
+static const char theText[] =
+    "Lorem ipsum dolor sit amet, consectetur adipiscing elit.";
+
+static void malignDeleter(napi_env env, void* data, void* finalize_hint) {
+  NODE_API_ASSERT_RETURN_VOID(
+      env, data != NULL && strcmp(data, theText) == 0, "invalid data");
+  napi_ref finalizer_ref = (napi_ref)finalize_hint;
+  napi_value js_finalizer;
+  napi_value recv;
+  NODE_API_CALL_RETURN_VOID(
+      env, napi_get_reference_value(env, finalizer_ref, &js_finalizer));
+  NODE_API_CALL_RETURN_VOID(env, napi_get_global(env, &recv));
+  NODE_API_CALL_RETURN_VOID(
+      env, napi_call_function(env, recv, js_finalizer, 0, NULL, NULL));
+  NODE_API_CALL_RETURN_VOID(env, napi_delete_reference(env, finalizer_ref));
+}
+
+static napi_value malignFinalizerBuffer(napi_env env, napi_callback_info info) {
+  size_t argc = 1;
+  napi_value args[1];
+  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, args, NULL, NULL));
+  NODE_API_ASSERT(env, argc == 1, "Wrong number of arguments");
+  napi_value finalizer = args[0];
+  napi_valuetype finalizer_valuetype;
+  NODE_API_CALL(env, napi_typeof(env, finalizer, &finalizer_valuetype));
+  NODE_API_ASSERT(env,
+                  finalizer_valuetype == napi_function,
+                  "Wrong type of first argument");
+  napi_ref finalizer_ref;
+  NODE_API_CALL(env, napi_create_reference(env, finalizer, 1, &finalizer_ref));
+
+  napi_value theBuffer;
+  NODE_API_CALL(env,
+                napi_create_external_buffer(env,
+                                            sizeof(theText),
+                                            (void*)theText,
+                                            malignDeleter,
+                                            finalizer_ref,  // finalize_hint
+                                            &theBuffer));
+  return theBuffer;
+}
+
+static napi_value Init(napi_env env, napi_value exports) {
+  napi_property_descriptor methods[] = {
+      DECLARE_NODE_API_PROPERTY("malignFinalizerBuffer", malignFinalizerBuffer),
+  };
+
+  NODE_API_CALL(
+      env,
+      napi_define_properties(
+          env, exports, sizeof(methods) / sizeof(methods[0]), methods));
+
+  return exports;
+}
+
+NAPI_MODULE(NODE_GYP_MODULE_NAME, Init)
diff --git a/test/node-api/test_buffer/test_finalizer.js b/test/node-api/test_buffer/test_finalizer.js
index b706c68c7c3e02..35511fcb016c95 100644
--- a/test/node-api/test_buffer/test_finalizer.js
+++ b/test/node-api/test_buffer/test_finalizer.js
@@ -2,7 +2,7 @@
 // Flags: --expose-gc --force-node-api-uncaught-exceptions-policy
 
 const common = require('../../common');
-const binding = require(`./build/${common.buildType}/test_buffer`);
+const binding = require(`./build/${common.buildType}/test_finalizer`);
 const assert = require('assert');
 const tick = require('util').promisify(require('../../common/tick'));
 
diff --git a/test/node-api/test_threadsafe_function/binding.gyp b/test/node-api/test_threadsafe_function/binding.gyp
index b60352e05af103..58a9d04d4a5619 100644
--- a/test/node-api/test_threadsafe_function/binding.gyp
+++ b/test/node-api/test_threadsafe_function/binding.gyp
@@ -3,6 +3,20 @@
     {
       'target_name': 'binding',
       'sources': ['binding.c']
+    },
+    {
+      'target_name': 'test_uncaught_exception_v9',
+      'defines': [
+        'NAPI_VERSION=9'
+      ],
+      'sources': ['test_uncaught_exception.c']
+    },
+    {
+      'target_name': 'test_uncaught_exception',
+      'defines': [
+        'NAPI_EXPERIMENTAL'
+      ],
+      'sources': ['test_uncaught_exception.c']
     }
   ]
 }
diff --git a/test/node-api/test_threadsafe_function/test_force_uncaught_exception.js b/test/node-api/test_threadsafe_function/test_legacy_uncaught_exception.js
similarity index 85%
rename from test/node-api/test_threadsafe_function/test_force_uncaught_exception.js
rename to test/node-api/test_threadsafe_function/test_legacy_uncaught_exception.js
index b1f95715eadf60..a8743e00b5b8c5 100644
--- a/test/node-api/test_threadsafe_function/test_force_uncaught_exception.js
+++ b/test/node-api/test_threadsafe_function/test_legacy_uncaught_exception.js
@@ -2,7 +2,7 @@
 // Flags: --no-force-node-api-uncaught-exceptions-policy
 
 const common = require('../../common');
-const binding = require(`./build/${common.buildType}/binding`);
+const binding = require(`./build/${common.buildType}/test_uncaught_exception_v9`);
 
 process.on(
   'uncaughtException',
diff --git a/test/node-api/test_threadsafe_function/test_uncaught_exception.c b/test/node-api/test_threadsafe_function/test_uncaught_exception.c
new file mode 100644
index 00000000000000..f8499d4fe4d680
--- /dev/null
+++ b/test/node-api/test_threadsafe_function/test_uncaught_exception.c
@@ -0,0 +1,62 @@
+#include <node_api.h>
+#include "../../js-native-api/common.h"
+
+// Testing calling into JavaScript
+static void ThreadSafeFunctionFinalize(napi_env env,
+                                       void* finalize_data,
+                                       void* finalize_hint) {
+  napi_ref js_func_ref = (napi_ref)finalize_data;
+  napi_value js_func;
+  napi_value recv;
+  NODE_API_CALL_RETURN_VOID(
+      env, napi_get_reference_value(env, js_func_ref, &js_func));
+  NODE_API_CALL_RETURN_VOID(env, napi_get_global(env, &recv));
+  NODE_API_CALL_RETURN_VOID(
+      env, napi_call_function(env, recv, js_func, 0, NULL, NULL));
+  NODE_API_CALL_RETURN_VOID(env, napi_delete_reference(env, js_func_ref));
+}
+
+// Testing calling into JavaScript
+static napi_value CallIntoModule(napi_env env, napi_callback_info info) {
+  size_t argc = 4;
+  napi_value argv[4];
+  NODE_API_CALL(env, napi_get_cb_info(env, info, &argc, argv, NULL, NULL));
+
+  napi_ref finalize_func;
+  NODE_API_CALL(env, napi_create_reference(env, argv[3], 1, &finalize_func));
+
+  napi_threadsafe_function tsfn;
+  NODE_API_CALL(env,
+                napi_create_threadsafe_function(env,
+                                                argv[0],
+                                                argv[1],
+                                                argv[2],
+                                                0,
+                                                1,
+                                                finalize_func,
+                                                ThreadSafeFunctionFinalize,
+                                                NULL,
+                                                NULL,
+                                                &tsfn));
+  NODE_API_CALL(env,
+                napi_call_threadsafe_function(tsfn, NULL, napi_tsfn_blocking));
+  NODE_API_CALL(env, napi_release_threadsafe_function(tsfn, napi_tsfn_release));
+  return NULL;
+}
+
+// Module init
+static napi_value Init(napi_env env, napi_value exports) {
+  napi_property_descriptor properties[] = {
+      DECLARE_NODE_API_PROPERTY("CallIntoModule", CallIntoModule),
+  };
+
+  NODE_API_CALL(
+      env,
+      napi_define_properties(env,
+                             exports,
+                             sizeof(properties) / sizeof(properties[0]),
+                             properties));
+
+  return exports;
+}
+NAPI_MODULE(NODE_GYP_MODULE_NAME, Init)
diff --git a/test/node-api/test_threadsafe_function/test_uncaught_exception.js b/test/node-api/test_threadsafe_function/test_uncaught_exception.js
index 2529757908999b..81b2623d702790 100644
--- a/test/node-api/test_threadsafe_function/test_uncaught_exception.js
+++ b/test/node-api/test_threadsafe_function/test_uncaught_exception.js
@@ -1,27 +1,7 @@
 'use strict';
-// Flags: --force-node-api-uncaught-exceptions-policy
 
 const common = require('../../common');
-const assert = require('assert');
-const binding = require(`./build/${common.buildType}/binding`);
+const binding = require(`./build/${common.buildType}/test_uncaught_exception`);
+const { testUncaughtException } = require('./uncaught_exception');
 
-const callbackCheck = common.mustCall((err) => {
-  assert.throws(() => { throw err; }, /callback error/);
-  process.removeListener('uncaughtException', callbackCheck);
-  process.on('uncaughtException', finalizerCheck);
-});
-const finalizerCheck = common.mustCall((err) => {
-  assert.throws(() => { throw err; }, /finalizer error/);
-});
-process.on('uncaughtException', callbackCheck);
-
-binding.CallIntoModule(
-  common.mustCall(() => {
-    throw new Error('callback error');
-  }),
-  {},
-  'resource_name',
-  common.mustCall(function finalizer() {
-    throw new Error('finalizer error');
-  }),
-);
+testUncaughtException(binding);
diff --git a/test/node-api/test_threadsafe_function/test_uncaught_exception_v9.js b/test/node-api/test_threadsafe_function/test_uncaught_exception_v9.js
new file mode 100644
index 00000000000000..28e628918fdff2
--- /dev/null
+++ b/test/node-api/test_threadsafe_function/test_uncaught_exception_v9.js
@@ -0,0 +1,8 @@
+'use strict';
+// Flags: --force-node-api-uncaught-exceptions-policy
+
+const common = require('../../common');
+const binding = require(`./build/${common.buildType}/test_uncaught_exception_v9`);
+const { testUncaughtException } = require('./uncaught_exception');
+
+testUncaughtException(binding);
diff --git a/test/node-api/test_threadsafe_function/uncaught_exception.js b/test/node-api/test_threadsafe_function/uncaught_exception.js
new file mode 100644
index 00000000000000..da2aa2f4efef8a
--- /dev/null
+++ b/test/node-api/test_threadsafe_function/uncaught_exception.js
@@ -0,0 +1,31 @@
+'use strict';
+
+const common = require('../../common');
+const assert = require('assert');
+
+function testUncaughtException(binding) {
+  const callbackCheck = common.mustCall((err) => {
+    assert.throws(() => { throw err; }, /callback error/);
+    process.removeListener('uncaughtException', callbackCheck);
+    process.on('uncaughtException', finalizerCheck);
+  });
+  const finalizerCheck = common.mustCall((err) => {
+    assert.throws(() => { throw err; }, /finalizer error/);
+  });
+  process.on('uncaughtException', callbackCheck);
+
+  binding.CallIntoModule(
+    common.mustCall(() => {
+      throw new Error('callback error');
+    }),
+    {},
+    'resource_name',
+    common.mustCall(function finalizer() {
+      throw new Error('finalizer error');
+    }),
+  );
+}
+
+module.exports = {
+  testUncaughtException,
+};
diff --git a/test/parallel/parallel.status b/test/parallel/parallel.status
index 6f4b9de73778b2..ffe3505021b522 100644
--- a/test/parallel/parallel.status
+++ b/test/parallel/parallel.status
@@ -36,8 +36,6 @@ test-http-server-request-timeouts-mixed: PASS,FLAKY
 # https://github.com/nodejs/node/pull/31178
 test-crypto-dh-stateless: SKIP
 test-crypto-keygen: SKIP
-# https://github.com/nodejs/node/issues/47297
-test-wasm-web-api: SKIP
 
 [$system==solaris] # Also applies to SmartOS
 # https://github.com/nodejs/node/issues/43457
@@ -53,6 +51,8 @@ test-domain-no-error-handler-abort-on-uncaught-8: PASS, FLAKY
 test-domain-no-error-handler-abort-on-uncaught-9: PASS, FLAKY
 test-domain-throw-error-then-throw-from-uncaught-exception-handler: PASS, FLAKY
 test-domain-with-abort-on-uncaught-exception: PASS, FLAKY
+# https://github.com/nodejs/node/issues/50050
+test-tick-processor-arguments: SKIP
 
 [$system==freebsd]
 # https://github.com/nodejs/node/issues/31727
diff --git a/test/parallel/test-assert.js b/test/parallel/test-assert.js
index 0343e8422885ad..3132c52504421d 100644
--- a/test/parallel/test-assert.js
+++ b/test/parallel/test-assert.js
@@ -1,4 +1,3 @@
-// Flags: --expose-internals
 // Copyright Joyent, Inc. and other Node contributors.
 //
 // Permission is hereby granted, free of charge, to any person obtaining a
@@ -26,7 +25,6 @@ const common = require('../common');
 const assert = require('assert');
 const { inspect } = require('util');
 const vm = require('vm');
-const { internalBinding } = require('internal/test/binding');
 const a = assert;
 
 // Disable colored output to prevent color codes from breaking assertion
@@ -478,7 +476,7 @@ assert.throws(() => {
 {
   // Bad args to AssertionError constructor should throw TypeError.
   const args = [1, true, false, '', null, Infinity, Symbol('test'), undefined];
-  args.forEach((input) => {
+  for (const input of args) {
     assert.throws(
       () => new assert.AssertionError(input),
       {
@@ -487,7 +485,7 @@ assert.throws(() => {
         message: 'The "options" argument must be of type object.' +
                  common.invalidArgTypeHelper(input)
       });
-  });
+  }
 }
 
 assert.throws(
@@ -802,37 +800,6 @@ assert.throws(
   }
 );
 
-{
-  // Test caching.
-  const fs = internalBinding('fs');
-  const tmp = fs.close;
-  fs.close = common.mustCall(tmp, 1);
-  function throwErr() {
-    assert(
-      (Buffer.from('test') instanceof Error)
-    );
-  }
-  assert.throws(
-    () => throwErr(),
-    {
-      code: 'ERR_ASSERTION',
-      constructor: assert.AssertionError,
-      message: 'The expression evaluated to a falsy value:\n\n  ' +
-               "assert(\n    (Buffer.from('test') instanceof Error)\n  )\n"
-    }
-  );
-  assert.throws(
-    () => throwErr(),
-    {
-      code: 'ERR_ASSERTION',
-      constructor: assert.AssertionError,
-      message: 'The expression evaluated to a falsy value:\n\n  ' +
-               "assert(\n    (Buffer.from('test') instanceof Error)\n  )\n"
-    }
-  );
-  fs.close = tmp;
-}
-
 assert.throws(
   () => {
     a(
@@ -998,11 +965,8 @@ assert.throws(
   }
 );
 
-[
-  1,
-  false,
-  Symbol(),
-].forEach((input) => {
+const inputs = [1, false, Symbol()];
+for (const input of inputs) {
   assert.throws(
     () => assert.throws(() => {}, input),
     {
@@ -1012,7 +976,7 @@ assert.throws(
                common.invalidArgTypeHelper(input)
     }
   );
-});
+}
 
 {
 
diff --git a/test/parallel/test-blob-buffer-too-large.js b/test/parallel/test-blob-buffer-too-large.js
index 2fd8b8754bd593..a9cf53b025bbff 100644
--- a/test/parallel/test-blob-buffer-too-large.js
+++ b/test/parallel/test-blob-buffer-too-large.js
@@ -3,17 +3,17 @@
 
 const common = require('../common');
 const assert = require('assert');
-const { Blob } = require('buffer');
+const { Blob, kMaxLength } = require('buffer');
 
 if (common.isFreeBSD)
   common.skip('Oversized buffer make the FreeBSD CI runner crash');
 
 try {
-  new Blob([new Uint8Array(0xffffffff), [1]]);
+  new Blob([new Uint8Array(kMaxLength), [1]]);
 } catch (e) {
   if (
     e.message === 'Array buffer allocation failed' ||
-    e.message === 'Invalid typed array length: 4294967295'
+    e.message === `Invalid typed array length: ${kMaxLength}`
   ) {
     common.skip(
       'Insufficient memory on this platform for oversized buffer test.'
diff --git a/test/parallel/test-blob-createobjecturl.js b/test/parallel/test-blob-createobjecturl.js
index 70c64b138db1ac..614b8ae4a6aff0 100644
--- a/test/parallel/test-blob-createobjecturl.js
+++ b/test/parallel/test-blob-createobjecturl.js
@@ -24,6 +24,8 @@ const assert = require('assert');
   const id = URL.createObjectURL(blob);
   assert.strictEqual(typeof id, 'string');
   const otherBlob = resolveObjectURL(id);
+  assert.ok(otherBlob instanceof Blob);
+  assert.strictEqual(otherBlob.constructor, Blob);
   assert.strictEqual(otherBlob.size, 5);
   assert.strictEqual(
     Buffer.from(await otherBlob.arrayBuffer()).toString(),
diff --git a/test/parallel/test-blob.js b/test/parallel/test-blob.js
index a517bad1ccb42d..cb9e2f239547f0 100644
--- a/test/parallel/test-blob.js
+++ b/test/parallel/test-blob.js
@@ -331,12 +331,54 @@ assert.throws(() => new Blob({}), {
   const b = new Blob(Array(10).fill('hello'));
   const stream = b.stream();
   const reader = stream.getReader();
-  assert.strictEqual(stream[kState].controller.desiredSize, 1);
+  assert.strictEqual(stream[kState].controller.desiredSize, 0);
   const { value, done } = await reader.read();
   assert.strictEqual(value.byteLength, 5);
   assert(!done);
   setTimeout(() => {
-    assert.strictEqual(stream[kState].controller.desiredSize, 0);
+    // The blob stream is now a byte stream hence after the first read,
+    // it should pull in the next 'hello' which is 5 bytes hence -5.
+    assert.strictEqual(stream[kState].controller.desiredSize, -5);
+  }, 0);
+})().then(common.mustCall());
+
+(async () => {
+  const blob = new Blob(['hello', 'world']);
+  const stream = blob.stream();
+  const reader = stream.getReader({ mode: 'byob' });
+  const decoder = new TextDecoder();
+  const chunks = [];
+  while (true) {
+    const { value, done } = await reader.read(new Uint8Array(100));
+    if (done) break;
+    chunks.push(decoder.decode(value, { stream: true }));
+  }
+  assert.strictEqual(chunks.join(''), 'helloworld');
+})().then(common.mustCall());
+
+(async () => {
+  const b = new Blob(Array(10).fill('hello'));
+  const stream = b.stream();
+  const reader = stream.getReader({ mode: 'byob' });
+  assert.strictEqual(stream[kState].controller.desiredSize, 0);
+  const { value, done } = await reader.read(new Uint8Array(100));
+  assert.strictEqual(value.byteLength, 5);
+  assert(!done);
+  setTimeout(() => {
+    assert.strictEqual(stream[kState].controller.desiredSize, -5);
+  }, 0);
+})().then(common.mustCall());
+
+(async () => {
+  const b = new Blob(Array(10).fill('hello'));
+  const stream = b.stream();
+  const reader = stream.getReader({ mode: 'byob' });
+  assert.strictEqual(stream[kState].controller.desiredSize, 0);
+  const { value, done } = await reader.read(new Uint8Array(2));
+  assert.strictEqual(value.byteLength, 2);
+  assert(!done);
+  setTimeout(() => {
+    assert.strictEqual(stream[kState].controller.desiredSize, -3);
   }, 0);
 })().then(common.mustCall());
 
@@ -431,3 +473,20 @@ assert.throws(() => new Blob({}), {
 
   await new Blob(chunks).arrayBuffer();
 })().then(common.mustCall());
+
+{
+  const blob = new Blob(['hello']);
+
+  assert.ok(blob.slice(0, 1).constructor === Blob);
+  assert.ok(blob.slice(0, 1) instanceof Blob);
+}
+
+(async () => {
+  const blob = new Blob(['hello']);
+
+  assert.ok(structuredClone(blob).constructor === Blob);
+  assert.ok(structuredClone(blob) instanceof Blob);
+  assert.ok(structuredClone(blob).size === blob.size);
+  assert.ok(structuredClone(blob).size === blob.size);
+  assert.ok((await structuredClone(blob).text()) === (await blob.text()));
+})().then(common.mustCall());
diff --git a/test/parallel/test-bootstrap-modules.js b/test/parallel/test-bootstrap-modules.js
index 9abe2dee22c1c7..78db466a95b38e 100644
--- a/test/parallel/test-bootstrap-modules.js
+++ b/test/parallel/test-bootstrap-modules.js
@@ -74,7 +74,6 @@ const expectedModules = new Set([
   'NativeModule internal/webstreams/queuingstrategies',
   'NativeModule internal/blob',
   'NativeModule internal/fs/utils',
-  'NativeModule internal/fs/read/utf8',
   'NativeModule fs',
   'Internal Binding options',
   'NativeModule internal/options',
diff --git a/test/parallel/test-buffer-alloc.js b/test/parallel/test-buffer-alloc.js
index c6b728027057ec..aad9c6bcab69e9 100644
--- a/test/parallel/test-buffer-alloc.js
+++ b/test/parallel/test-buffer-alloc.js
@@ -4,13 +4,16 @@ const common = require('../common');
 const assert = require('assert');
 const vm = require('vm');
 
-const SlowBuffer = require('buffer').SlowBuffer;
+const {
+  SlowBuffer,
+  kMaxLength,
+} = require('buffer');
 
 // Verify the maximum Uint8Array size. There is no concrete limit by spec. The
 // internal limits should be updated if this fails.
 assert.throws(
-  () => new Uint8Array(2 ** 32 + 1),
-  { message: 'Invalid typed array length: 4294967297' }
+  () => new Uint8Array(kMaxLength + 1),
+  { message: `Invalid typed array length: ${kMaxLength + 1}` },
 );
 
 const b = Buffer.allocUnsafe(1024);
diff --git a/test/parallel/test-buffer-over-max-length.js b/test/parallel/test-buffer-over-max-length.js
index d2df358cc00ca4..f29d6b62d4aa40 100644
--- a/test/parallel/test-buffer-over-max-length.js
+++ b/test/parallel/test-buffer-over-max-length.js
@@ -12,18 +12,8 @@ const bufferMaxSizeMsg = {
   name: 'RangeError',
 };
 
-assert.throws(() => Buffer((-1 >>> 0) + 2), bufferMaxSizeMsg);
-assert.throws(() => SlowBuffer((-1 >>> 0) + 2), bufferMaxSizeMsg);
-assert.throws(() => Buffer.alloc((-1 >>> 0) + 2), bufferMaxSizeMsg);
-assert.throws(() => Buffer.allocUnsafe((-1 >>> 0) + 2), bufferMaxSizeMsg);
-assert.throws(() => Buffer.allocUnsafeSlow((-1 >>> 0) + 2), bufferMaxSizeMsg);
-
 assert.throws(() => Buffer(kMaxLength + 1), bufferMaxSizeMsg);
 assert.throws(() => SlowBuffer(kMaxLength + 1), bufferMaxSizeMsg);
 assert.throws(() => Buffer.alloc(kMaxLength + 1), bufferMaxSizeMsg);
 assert.throws(() => Buffer.allocUnsafe(kMaxLength + 1), bufferMaxSizeMsg);
 assert.throws(() => Buffer.allocUnsafeSlow(kMaxLength + 1), bufferMaxSizeMsg);
-
-// issue GH-4331
-assert.throws(() => Buffer.allocUnsafe(0x100000001), bufferMaxSizeMsg);
-assert.throws(() => Buffer.allocUnsafe(0xFFFFFFFFF), bufferMaxSizeMsg);
diff --git a/test/parallel/test-buffer-tostring-rangeerror.js b/test/parallel/test-buffer-tostring-rangeerror.js
index d2e1e0d6e46438..0ebea759b5c42b 100644
--- a/test/parallel/test-buffer-tostring-rangeerror.js
+++ b/test/parallel/test-buffer-tostring-rangeerror.js
@@ -1,17 +1,22 @@
 'use strict';
 require('../common');
 
-// This test ensures that Node.js throws a RangeError when trying to convert a
-// gigantic buffer into a string.
+// This test ensures that Node.js throws an Error when trying to convert a
+// large buffer into a string.
 // Regression test for https://github.com/nodejs/node/issues/649.
 
 const assert = require('assert');
-const SlowBuffer = require('buffer').SlowBuffer;
+const {
+  SlowBuffer,
+  constants: {
+    MAX_STRING_LENGTH,
+  },
+} = require('buffer');
 
-const len = 1422561062959;
+const len = MAX_STRING_LENGTH + 1;
 const message = {
-  code: 'ERR_OUT_OF_RANGE',
-  name: 'RangeError',
+  code: 'ERR_STRING_TOO_LONG',
+  name: 'Error',
 };
 assert.throws(() => Buffer(len).toString('utf8'), message);
 assert.throws(() => SlowBuffer(len).toString('utf8'), message);
diff --git a/test/parallel/test-cwd-enoent-preload.js b/test/parallel/test-cwd-enoent-preload.js
index 2077d9c1478335..21b20d6d035672 100644
--- a/test/parallel/test-cwd-enoent-preload.js
+++ b/test/parallel/test-cwd-enoent-preload.js
@@ -1,7 +1,7 @@
 'use strict';
 const common = require('../common');
 // Fails with EINVAL on SmartOS, EBUSY on Windows, EBUSY on AIX.
-if (common.isSunOS || common.isWindows || common.isAIX)
+if (common.isSunOS || common.isWindows || common.isAIX || common.isIBMi)
   common.skip('cannot rmdir current working directory');
 if (!common.isMainThread)
   common.skip('process.chdir is not available in Workers');
diff --git a/test/parallel/test-cwd-enoent-repl.js b/test/parallel/test-cwd-enoent-repl.js
index 5ea8abc7e42b52..0a61cbfbced9b4 100644
--- a/test/parallel/test-cwd-enoent-repl.js
+++ b/test/parallel/test-cwd-enoent-repl.js
@@ -1,7 +1,7 @@
 'use strict';
 const common = require('../common');
 // Fails with EINVAL on SmartOS, EBUSY on Windows, EBUSY on AIX.
-if (common.isSunOS || common.isWindows || common.isAIX)
+if (common.isSunOS || common.isWindows || common.isAIX || common.isIBMi)
   common.skip('cannot rmdir current working directory');
 if (!common.isMainThread)
   common.skip('process.chdir is not available in Workers');
diff --git a/test/parallel/test-cwd-enoent.js b/test/parallel/test-cwd-enoent.js
index 8beb1e3fbe0a05..876888bc2be518 100644
--- a/test/parallel/test-cwd-enoent.js
+++ b/test/parallel/test-cwd-enoent.js
@@ -1,7 +1,7 @@
 'use strict';
 const common = require('../common');
 // Fails with EINVAL on SmartOS, EBUSY on Windows, EBUSY on AIX.
-if (common.isSunOS || common.isWindows || common.isAIX)
+if (common.isSunOS || common.isWindows || common.isAIX || common.isIBMi)
   common.skip('cannot rmdir current working directory');
 if (!common.isMainThread)
   common.skip('process.chdir is not available in Workers');
diff --git a/test/parallel/test-debugger-break.js b/test/parallel/test-debugger-break.js
index 65b4355cfe7bc2..8e3a290321a2e7 100644
--- a/test/parallel/test-debugger-break.js
+++ b/test/parallel/test-debugger-break.js
@@ -27,7 +27,7 @@ const cli = startCLI(['--port=0', script]);
 
   await cli.stepCommand('n');
   assert.ok(
-    cli.output.includes(`break in ${script}:2`),
+    cli.output.includes(`step in ${script}:2`),
     'pauses in next line of the script');
   assert.match(
     cli.output,
@@ -36,7 +36,7 @@ const cli = startCLI(['--port=0', script]);
 
   await cli.stepCommand('next');
   assert.ok(
-    cli.output.includes(`break in ${script}:3`),
+    cli.output.includes(`step in ${script}:3`),
     'pauses in next line of the script');
   assert.match(
     cli.output,
@@ -89,7 +89,7 @@ const cli = startCLI(['--port=0', script]);
   await cli.stepCommand('');
   assert.match(
     cli.output,
-    /break in node:timers/,
+    /step in node:timers/,
     'entered timers.js');
 
   await cli.stepCommand('cont');
diff --git a/test/parallel/test-debugger-run-after-quit-restart.js b/test/parallel/test-debugger-run-after-quit-restart.js
index 2c56f7227aed69..0e1048699206dc 100644
--- a/test/parallel/test-debugger-run-after-quit-restart.js
+++ b/test/parallel/test-debugger-run-after-quit-restart.js
@@ -25,7 +25,7 @@ const path = require('path');
     .then(() => cli.stepCommand('n'))
     .then(() => {
       assert.ok(
-        cli.output.includes(`break in ${script}:2`),
+        cli.output.includes(`step in ${script}:2`),
         'steps to the 2nd line'
       );
     })
diff --git a/test/parallel/test-error-format-list.js b/test/parallel/test-error-format-list.js
index 54ae4e0aee714d..2fd95584d22318 100644
--- a/test/parallel/test-error-format-list.js
+++ b/test/parallel/test-error-format-list.js
@@ -11,7 +11,7 @@ if (!common.hasIntl) common.skip('missing Intl');
   const and = new Intl.ListFormat('en', { style: 'long', type: 'conjunction' });
   const or = new Intl.ListFormat('en', { style: 'long', type: 'disjunction' });
 
-  const input = ['apple', 'banana', 'orange'];
+  const input = ['apple', 'banana', 'orange', 'pear'];
   for (let i = 0; i < input.length; i++) {
     const slicedInput = input.slice(0, i);
     strictEqual(formatList(slicedInput), and.format(slicedInput));
diff --git a/test/parallel/test-error-value-type-detection.mjs b/test/parallel/test-error-value-type-detection.mjs
index b0e418ab5129ab..c317197054c1f0 100644
--- a/test/parallel/test-error-value-type-detection.mjs
+++ b/test/parallel/test-error-value-type-detection.mjs
@@ -12,6 +12,10 @@ strictEqual(
   'type bigint (1n)',
 );
 
+strictEqual(
+  determineSpecificType(true),
+  'type boolean (true)',
+);
 strictEqual(
   determineSpecificType(false),
   'type boolean (false)',
@@ -42,6 +46,27 @@ strictEqual(
   "type string ('')",
 );
 
+strictEqual(
+  determineSpecificType(''),
+  "type string ('')",
+);
+strictEqual(
+  determineSpecificType("''"),
+  "type string (\"''\")",
+);
+strictEqual(
+  determineSpecificType('Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor'),
+  "type string ('Lorem ipsum dolor sit ame...')",
+);
+strictEqual(
+  determineSpecificType("Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor'"),
+  "type string ('Lorem ipsum dolor sit ame...')",
+);
+strictEqual(
+  determineSpecificType("Lorem' ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor"),
+  "type string (\"Lorem' ipsum dolor sit am...\")",
+);
+
 strictEqual(
   determineSpecificType(Symbol('foo')),
   'type symbol (Symbol(foo))',
@@ -52,6 +77,38 @@ strictEqual(
   'function foo',
 );
 
+const implicitlyNamed = function() {}; // eslint-disable-line func-style
+strictEqual(
+  determineSpecificType(implicitlyNamed),
+  'function implicitlyNamed',
+);
+strictEqual(
+  determineSpecificType(() => {}),
+  'function ',
+);
+function noName() {}
+delete noName.name;
+strictEqual(
+  noName.name,
+  '',
+);
+strictEqual(
+  determineSpecificType(noName),
+  'function ',
+);
+
+function * generatorFn() {}
+strictEqual(
+  determineSpecificType(generatorFn),
+  'function generatorFn',
+);
+
+async function asyncFn() {}
+strictEqual(
+  determineSpecificType(asyncFn),
+  'function asyncFn',
+);
+
 strictEqual(
   determineSpecificType(null),
   'null',
@@ -134,6 +191,10 @@ strictEqual(
   determineSpecificType({}),
   'an instance of Object',
 );
+strictEqual(
+  determineSpecificType(new Object()),
+  'an instance of Object',
+);
 
 strictEqual(
   determineSpecificType(Promise.resolve('foo')),
diff --git a/test/parallel/test-events-on-async-iterator.js b/test/parallel/test-events-on-async-iterator.js
index 94f66a81edb0c0..057af8537f3275 100644
--- a/test/parallel/test-events-on-async-iterator.js
+++ b/test/parallel/test-events-on-async-iterator.js
@@ -40,6 +40,15 @@ async function invalidArgType() {
     code: 'ERR_INVALID_ARG_TYPE',
     name: 'TypeError',
   }));
+
+  const ee = new EventEmitter();
+
+  [1, 'hi', null, false, () => {}, Symbol(), 1n].map((options) => {
+    return assert.throws(() => on(ee, 'foo', options), common.expectsError({
+      code: 'ERR_INVALID_ARG_TYPE',
+      name: 'TypeError',
+    }));
+  });
 }
 
 async function error() {
diff --git a/test/parallel/test-events-once.js b/test/parallel/test-events-once.js
index be05028faaf0c2..1a82824d4ad922 100644
--- a/test/parallel/test-events-once.js
+++ b/test/parallel/test-events-once.js
@@ -4,10 +4,10 @@
 const common = require('../common');
 const { once, EventEmitter } = require('events');
 const {
-  strictEqual,
   deepStrictEqual,
   fail,
   rejects,
+  strictEqual,
 } = require('assert');
 const { kEvents } = require('internal/event_target');
 
@@ -24,18 +24,16 @@ async function onceAnEvent() {
   strictEqual(ee.listenerCount('myevent'), 0);
 }
 
-async function onceAnEventWithNullOptions() {
+async function onceAnEventWithInvalidOptions() {
   const ee = new EventEmitter();
 
-  process.nextTick(() => {
-    ee.emit('myevent', 42);
-  });
-
-  const [value] = await once(ee, 'myevent', null);
-  strictEqual(value, 42);
+  await Promise.all([1, 'hi', null, false, () => {}, Symbol(), 1n].map((options) => {
+    return rejects(once(ee, 'myevent', options), {
+      code: 'ERR_INVALID_ARG_TYPE',
+    });
+  }));
 }
 
-
 async function onceAnEventWithTwoArgs() {
   const ee = new EventEmitter();
 
@@ -267,7 +265,7 @@ async function eventTargetAbortSignalAfterEvent() {
 
 Promise.all([
   onceAnEvent(),
-  onceAnEventWithNullOptions(),
+  onceAnEventWithInvalidOptions(),
   onceAnEventWithTwoArgs(),
   catchesErrors(),
   catchesErrorsWithAbortSignal(),
diff --git a/test/parallel/test-fetch.mjs b/test/parallel/test-fetch.mjs
index e24a38eb27db37..bbdb7130ed2324 100644
--- a/test/parallel/test-fetch.mjs
+++ b/test/parallel/test-fetch.mjs
@@ -10,6 +10,14 @@ assert.strictEqual(typeof globalThis.Headers, 'function');
 assert.strictEqual(typeof globalThis.Request, 'function');
 assert.strictEqual(typeof globalThis.Response, 'function');
 
+{
+  const asyncFunction = async function() {}.constructor;
+
+  assert.ok(!(fetch instanceof asyncFunction));
+  assert.notStrictEqual(Reflect.getPrototypeOf(fetch), Reflect.getPrototypeOf(async function() {}));
+  assert.strictEqual(Reflect.getPrototypeOf(fetch), Reflect.getPrototypeOf(function() {}));
+}
+
 const server = http.createServer(common.mustCall((req, res) => {
   res.end('Hello world');
 }));
diff --git a/test/parallel/test-fs-access.js b/test/parallel/test-fs-access.js
index d2afc65a11807f..5a8b85433eeefa 100644
--- a/test/parallel/test-fs-access.js
+++ b/test/parallel/test-fs-access.js
@@ -63,10 +63,10 @@ if (!common.isWindows && process.getuid() === 0) {
   }
 }
 
-assert.strictEqual(typeof fs.F_OK, 'number');
-assert.strictEqual(typeof fs.R_OK, 'number');
-assert.strictEqual(typeof fs.W_OK, 'number');
-assert.strictEqual(typeof fs.X_OK, 'number');
+assert.strictEqual(typeof fs.constants.F_OK, 'number');
+assert.strictEqual(typeof fs.constants.R_OK, 'number');
+assert.strictEqual(typeof fs.constants.W_OK, 'number');
+assert.strictEqual(typeof fs.constants.X_OK, 'number');
 
 const throwNextTick = (e) => { process.nextTick(() => { throw e; }); };
 
@@ -76,16 +76,16 @@ fs.access(__filename, common.mustCall(function(...args) {
 fs.promises.access(__filename)
   .then(common.mustCall())
   .catch(throwNextTick);
-fs.access(__filename, fs.R_OK, common.mustCall(function(...args) {
+fs.access(__filename, fs.constants.R_OK, common.mustCall(function(...args) {
   assert.deepStrictEqual(args, [null]);
 }));
-fs.promises.access(__filename, fs.R_OK)
+fs.promises.access(__filename, fs.constants.R_OK)
   .then(common.mustCall())
   .catch(throwNextTick);
-fs.access(readOnlyFile, fs.R_OK, common.mustCall(function(...args) {
+fs.access(readOnlyFile, fs.constants.R_OK, common.mustCall(function(...args) {
   assert.deepStrictEqual(args, [null]);
 }));
-fs.promises.access(readOnlyFile, fs.R_OK)
+fs.promises.access(readOnlyFile, fs.constants.R_OK)
   .then(common.mustCall())
   .catch(throwNextTick);
 
@@ -111,8 +111,8 @@ fs.promises.access(readOnlyFile, fs.R_OK)
       assert.strictEqual(err.path, readOnlyFile);
     }
   }
-  fs.access(readOnlyFile, fs.W_OK, common.mustCall(expectedError));
-  fs.promises.access(readOnlyFile, fs.W_OK)
+  fs.access(readOnlyFile, fs.constants.W_OK, common.mustCall(expectedError));
+  fs.promises.access(readOnlyFile, fs.constants.W_OK)
     .then(common.mustNotCall(), common.mustCall(expectedError))
     .catch(throwNextTick);
 }
@@ -124,18 +124,18 @@ fs.promises.access(readOnlyFile, fs.R_OK)
     return true;
   };
   assert.throws(
-    () => { fs.access(100, fs.F_OK, common.mustNotCall()); },
+    () => { fs.access(100, fs.constants.F_OK, common.mustNotCall()); },
     expectedError
   );
 
-  fs.promises.access(100, fs.F_OK)
+  fs.promises.access(100, fs.constants.F_OK)
     .then(common.mustNotCall(), common.mustCall(expectedError))
     .catch(throwNextTick);
 }
 
 assert.throws(
   () => {
-    fs.access(__filename, fs.F_OK);
+    fs.access(__filename, fs.constants.F_OK);
   },
   {
     code: 'ERR_INVALID_ARG_TYPE',
@@ -144,7 +144,7 @@ assert.throws(
 
 assert.throws(
   () => {
-    fs.access(__filename, fs.F_OK, common.mustNotMutateObjectDeep({}));
+    fs.access(__filename, fs.constants.F_OK, common.mustNotMutateObjectDeep({}));
   },
   {
     code: 'ERR_INVALID_ARG_TYPE',
@@ -153,14 +153,14 @@ assert.throws(
 
 // Regular access should not throw.
 fs.accessSync(__filename);
-const mode = fs.R_OK | fs.W_OK;
+const mode = fs.constants.R_OK | fs.constants.W_OK;
 fs.accessSync(readWriteFile, mode);
 
 // Invalid modes should throw.
 [
   false,
   1n,
-  { [Symbol.toPrimitive]() { return fs.R_OK; } },
+  { [Symbol.toPrimitive]() { return fs.constants.R_OK; } },
   [1],
   'r',
 ].forEach((mode, i) => {
diff --git a/test/parallel/test-fs-null-bytes.js b/test/parallel/test-fs-null-bytes.js
index 2851ac657ded33..302d37196f0495 100644
--- a/test/parallel/test-fs-null-bytes.js
+++ b/test/parallel/test-fs-null-bytes.js
@@ -52,7 +52,7 @@ function check(async, sync) {
 }
 
 check(fs.access, fs.accessSync, 'foo\u0000bar');
-check(fs.access, fs.accessSync, 'foo\u0000bar', fs.F_OK);
+check(fs.access, fs.accessSync, 'foo\u0000bar', fs.constants.F_OK);
 check(fs.appendFile, fs.appendFileSync, 'foo\u0000bar', 'abc');
 check(fs.chmod, fs.chmodSync, 'foo\u0000bar', '0644');
 check(fs.chown, fs.chownSync, 'foo\u0000bar', 12, 34);
@@ -87,7 +87,7 @@ const fileUrl = new URL('file:///C:/foo\u0000bar');
 const fileUrl2 = new URL('file:///C:/foo%00bar');
 
 check(fs.access, fs.accessSync, fileUrl);
-check(fs.access, fs.accessSync, fileUrl, fs.F_OK);
+check(fs.access, fs.accessSync, fileUrl, fs.constants.F_OK);
 check(fs.appendFile, fs.appendFileSync, fileUrl, 'abc');
 check(fs.chmod, fs.chmodSync, fileUrl, '0644');
 check(fs.chown, fs.chownSync, fileUrl, 12, 34);
@@ -119,7 +119,7 @@ check(null, fs.watchFile, fileUrl, assert.fail);
 check(fs.writeFile, fs.writeFileSync, fileUrl, 'abc');
 
 check(fs.access, fs.accessSync, fileUrl2);
-check(fs.access, fs.accessSync, fileUrl2, fs.F_OK);
+check(fs.access, fs.accessSync, fileUrl2, fs.constants.F_OK);
 check(fs.appendFile, fs.appendFileSync, fileUrl2, 'abc');
 check(fs.chmod, fs.chmodSync, fileUrl2, '0644');
 check(fs.chown, fs.chownSync, fileUrl2, 12, 34);
diff --git a/test/parallel/test-fs-read-position-validation.mjs b/test/parallel/test-fs-read-position-validation.mjs
index 5b90a3e2c0e845..504f02c3374cd6 100644
--- a/test/parallel/test-fs-read-position-validation.mjs
+++ b/test/parallel/test-fs-read-position-validation.mjs
@@ -75,8 +75,7 @@ async function testInvalid(code, position) {
 
   await testValid(2n ** 63n - 1n - BigInt(length), [ 'EFBIG', 'EOVERFLOW' ]);
   await testInvalid('ERR_OUT_OF_RANGE', 2n ** 63n);
-
-  // TODO(LiviaMedeiros): test `2n ** 63n - BigInt(length)`
+  await testInvalid('ERR_OUT_OF_RANGE', 2n ** 63n - BigInt(length));
 
   await testInvalid('ERR_OUT_OF_RANGE', NaN);
   await testInvalid('ERR_OUT_OF_RANGE', -Infinity);
diff --git a/test/parallel/test-fs-read-promises-position-validation.mjs b/test/parallel/test-fs-read-promises-position-validation.mjs
new file mode 100644
index 00000000000000..8bc238d3f269f4
--- /dev/null
+++ b/test/parallel/test-fs-read-promises-position-validation.mjs
@@ -0,0 +1,84 @@
+import '../common/index.mjs';
+import * as fixtures from '../common/fixtures.mjs';
+import fs from 'fs';
+import assert from 'assert';
+
+// This test ensures that "position" argument is correctly validated
+
+const filepath = fixtures.path('x.txt');
+
+const buffer = Buffer.from('xyz\n');
+const offset = 0;
+const length = buffer.byteLength;
+
+// allowedErrors is an array of acceptable internal errors
+// For example, on some platforms read syscall might return -EFBIG
+async function testValid(position, allowedErrors = []) {
+  let fh;
+  try {
+    fh = await fs.promises.open(filepath, 'r');
+    await fh.read(buffer, offset, length, position);
+    await fh.read({ buffer, offset, length, position });
+    await fh.read(buffer, { offset, length, position });
+  } catch (err) {
+    if (!allowedErrors.includes(err.code)) {
+      assert.fail(err);
+    }
+  } finally {
+    await fh?.close();
+  }
+}
+
+async function testInvalid(code, position) {
+  let fh;
+  try {
+    fh = await fs.promises.open(filepath, 'r');
+    await assert.rejects(
+      fh.read(buffer, offset, length, position),
+      { code }
+    );
+    await assert.rejects(
+      fh.read({ buffer, offset, length, position }),
+      { code }
+    );
+    await assert.rejects(
+      fh.read(buffer, { offset, length, position }),
+      { code }
+    );
+  } finally {
+    await fh?.close();
+  }
+}
+
+{
+  await testValid(undefined);
+  await testValid(null);
+  await testValid(-1);
+  await testValid(-1n);
+
+  await testValid(0);
+  await testValid(0n);
+  await testValid(1);
+  await testValid(1n);
+  await testValid(9);
+  await testValid(9n);
+  await testValid(Number.MAX_SAFE_INTEGER, [ 'EFBIG', 'EOVERFLOW']);
+
+  await testValid(2n ** 63n - 1n - BigInt(length), [ 'EFBIG', 'EOVERFLOW']);
+  await testInvalid('ERR_OUT_OF_RANGE', 2n ** 63n);
+  await testInvalid('ERR_OUT_OF_RANGE', 2n ** 63n - BigInt(length));
+
+  await testInvalid('ERR_OUT_OF_RANGE', NaN);
+  await testInvalid('ERR_OUT_OF_RANGE', -Infinity);
+  await testInvalid('ERR_OUT_OF_RANGE', Infinity);
+  await testInvalid('ERR_OUT_OF_RANGE', -0.999);
+  await testInvalid('ERR_OUT_OF_RANGE', -(2n ** 64n));
+  await testInvalid('ERR_OUT_OF_RANGE', Number.MAX_SAFE_INTEGER + 1);
+  await testInvalid('ERR_OUT_OF_RANGE', Number.MAX_VALUE);
+
+  for (const badTypeValue of [
+    false, true, '1', Symbol(1), {}, [], () => {}, Promise.resolve(1),
+  ]) {
+    testInvalid('ERR_INVALID_ARG_TYPE', badTypeValue);
+  }
+}
diff --git a/test/parallel/test-fs-readSync-position-validation.mjs b/test/parallel/test-fs-readSync-position-validation.mjs
index 93fe4be1f0b65d..305e37778d9aac 100644
--- a/test/parallel/test-fs-readSync-position-validation.mjs
+++ b/test/parallel/test-fs-readSync-position-validation.mjs
@@ -28,7 +28,7 @@ function testValid(position, allowedErrors = []) {
   }
 }
 
-function testInvalid(code, position, internalCatch = false) {
+function testInvalid(code, position) {
   let fdSync;
   try {
     fdSync = fs.openSync(filepath, 'r');
@@ -61,8 +61,7 @@ function testInvalid(code, position, internalCatch = false) {
 
   testValid(2n ** 63n - 1n - BigInt(length), [ 'EFBIG', 'EOVERFLOW' ]);
   testInvalid('ERR_OUT_OF_RANGE', 2n ** 63n);
-
-  // TODO(LiviaMedeiros): test `2n ** 63n - BigInt(length)`
+  testInvalid('ERR_OUT_OF_RANGE', 2n ** 63n - BigInt(length));
 
   testInvalid('ERR_OUT_OF_RANGE', NaN);
   testInvalid('ERR_OUT_OF_RANGE', -Infinity);
diff --git a/test/parallel/test-fs-readdir-types.js b/test/parallel/test-fs-readdir-types.js
index 9116a04f44ed70..3cc6b1cceff7fc 100644
--- a/test/parallel/test-fs-readdir-types.js
+++ b/test/parallel/test-fs-readdir-types.js
@@ -29,7 +29,7 @@ tmpdir.refresh();
 
 // Create the necessary files
 files.forEach(function(currentFile) {
-  fs.closeSync(fs.openSync(`${readdirDir}/${currentFile}`, 'w'));
+  fs.writeFileSync(`${readdirDir}/${currentFile}`, '', 'utf8');
 });
 
 
@@ -95,7 +95,7 @@ binding.readdir = common.mustCall((path, encoding, types, req, ctx) => {
     };
     oldReaddir(path, encoding, types, req);
   } else {
-    const results = oldReaddir(path, encoding, types, req, ctx);
+    const results = oldReaddir(path, encoding, types);
     results[1] = results[1].map(() => UNKNOWN);
     return results;
   }
diff --git a/test/parallel/test-fs-readfile-error.js b/test/parallel/test-fs-readfile-error.js
index 8c5a3a71c6f530..da4638d22d59f1 100644
--- a/test/parallel/test-fs-readfile-error.js
+++ b/test/parallel/test-fs-readfile-error.js
@@ -61,7 +61,7 @@ assert.throws(
   {
     code: 'ERR_INVALID_ARG_TYPE',
     message: 'The "path" argument must be of type string or an instance of ' +
-             'Buffer or URL. Received type function ([Function (anonymous)])',
+             'Buffer or URL. Received function ',
     name: 'TypeError'
   }
 );
diff --git a/test/parallel/test-fs-readfile-pipe-large.js b/test/parallel/test-fs-readfile-pipe-large.js
index 1a685ebc612b85..4376774bb411d6 100644
--- a/test/parallel/test-fs-readfile-pipe-large.js
+++ b/test/parallel/test-fs-readfile-pipe-large.js
@@ -3,7 +3,7 @@ const common = require('../common');
 
 // Simulate `cat readfile.js | node readfile.js`
 
-if (common.isWindows || common.isAIX)
+if (common.isWindows || common.isAIX || common.isIBMi)
   common.skip(`No /dev/stdin on ${process.platform}.`);
 
 const assert = require('assert');
diff --git a/test/parallel/test-fs-readfile-pipe.js b/test/parallel/test-fs-readfile-pipe.js
index 0cffbd0f5aa162..79d5699fef64a4 100644
--- a/test/parallel/test-fs-readfile-pipe.js
+++ b/test/parallel/test-fs-readfile-pipe.js
@@ -24,7 +24,7 @@ const common = require('../common');
 
 // Simulate `cat readfile.js | node readfile.js`
 
-if (common.isWindows || common.isAIX)
+if (common.isWindows || common.isAIX || common.isIBMi)
   common.skip(`No /dev/stdin on ${process.platform}.`);
 
 const assert = require('assert');
diff --git a/test/parallel/test-fs-readfilesync-pipe-large.js b/test/parallel/test-fs-readfilesync-pipe-large.js
index 2cb857a329fbee..5450337c4f680a 100644
--- a/test/parallel/test-fs-readfilesync-pipe-large.js
+++ b/test/parallel/test-fs-readfilesync-pipe-large.js
@@ -3,7 +3,7 @@ const common = require('../common');
 
 // Simulate `cat readfile.js | node readfile.js`
 
-if (common.isWindows || common.isAIX)
+if (common.isWindows || common.isAIX || common.isIBMi)
   common.skip(`No /dev/stdin on ${process.platform}.`);
 
 const assert = require('assert');
diff --git a/test/parallel/test-fs-realpath-pipe.js b/test/parallel/test-fs-realpath-pipe.js
index 29fe1d3b7d28e1..f637642ca21d67 100644
--- a/test/parallel/test-fs-realpath-pipe.js
+++ b/test/parallel/test-fs-realpath-pipe.js
@@ -2,7 +2,7 @@
 
 const common = require('../common');
 
-if (common.isWindows || common.isAIX)
+if (common.isWindows || common.isAIX || common.isIBMi)
   common.skip(`No /dev/stdin on ${process.platform}.`);
 
 const assert = require('assert');
diff --git a/test/parallel/test-fs-utimes.js b/test/parallel/test-fs-utimes.js
index 8f8286f8a3343f..e6ae75d4e33a5f 100644
--- a/test/parallel/test-fs-utimes.js
+++ b/test/parallel/test-fs-utimes.js
@@ -39,7 +39,7 @@ function stat_resource(resource, statSync = fs.statSync) {
   const stats = fs.fstatSync(resource);
   // Ensure mtime has been written to disk
   // except for directories on AIX where it cannot be synced
-  if (common.isAIX && stats.isDirectory())
+  if ((common.isAIX || common.isIBMi) && stats.isDirectory())
     return stats;
   fs.fsyncSync(resource);
   return fs.fstatSync(resource);
diff --git a/test/parallel/test-fs-write-file-flush.js b/test/parallel/test-fs-write-file-flush.js
new file mode 100644
index 00000000000000..98a8d637c5fa28
--- /dev/null
+++ b/test/parallel/test-fs-write-file-flush.js
@@ -0,0 +1,114 @@
+'use strict';
+const common = require('../common');
+const tmpdir = require('../common/tmpdir');
+const assert = require('node:assert');
+const fs = require('node:fs');
+const fsp = require('node:fs/promises');
+const test = require('node:test');
+const data = 'foo';
+let cnt = 0;
+
+function nextFile() {
+  return tmpdir.resolve(`${cnt++}.out`);
+}
+
+tmpdir.refresh();
+
+test('synchronous version', async (t) => {
+  await t.test('validation', (t) => {
+    for (const v of ['true', '', 0, 1, [], {}, Symbol()]) {
+      assert.throws(() => {
+        fs.writeFileSync(nextFile(), data, { flush: v });
+      }, { code: 'ERR_INVALID_ARG_TYPE' });
+    }
+  });
+
+  await t.test('performs flush', (t) => {
+    const spy = t.mock.method(fs, 'fsyncSync');
+    const file = nextFile();
+    fs.writeFileSync(file, data, { flush: true });
+    const calls = spy.mock.calls;
+    assert.strictEqual(calls.length, 1);
+    assert.strictEqual(calls[0].result, undefined);
+    assert.strictEqual(calls[0].error, undefined);
+    assert.strictEqual(calls[0].arguments.length, 1);
+    assert.strictEqual(typeof calls[0].arguments[0], 'number');
+    assert.strictEqual(fs.readFileSync(file, 'utf8'), data);
+  });
+
+  await t.test('does not perform flush', (t) => {
+    const spy = t.mock.method(fs, 'fsyncSync');
+
+    for (const v of [undefined, null, false]) {
+      const file = nextFile();
+      fs.writeFileSync(file, data, { flush: v });
+      assert.strictEqual(fs.readFileSync(file, 'utf8'), data);
+    }
+
+    assert.strictEqual(spy.mock.calls.length, 0);
+  });
+});
+
+test('callback version', async (t) => {
+  await t.test('validation', (t) => {
+    for (const v of ['true', '', 0, 1, [], {}, Symbol()]) {
+      assert.throws(() => {
+        fs.writeFileSync(nextFile(), data, { flush: v });
+      }, { code: 'ERR_INVALID_ARG_TYPE' });
+    }
+  });
+
+  await t.test('performs flush', (t, done) => {
+    const spy = t.mock.method(fs, 'fsync');
+    const file = nextFile();
+    fs.writeFile(file, data, { flush: true }, common.mustSucceed(() => {
+      const calls = spy.mock.calls;
+      assert.strictEqual(calls.length, 1);
+      assert.strictEqual(calls[0].result, undefined);
+      assert.strictEqual(calls[0].error, undefined);
+      assert.strictEqual(calls[0].arguments.length, 2);
+      assert.strictEqual(typeof calls[0].arguments[0], 'number');
+      assert.strictEqual(typeof calls[0].arguments[1], 'function');
+      assert.strictEqual(fs.readFileSync(file, 'utf8'), data);
+      done();
+    }));
+  });
+
+  await t.test('does not perform flush', (t, done) => {
+    const values = [undefined, null, false];
+    const spy = t.mock.method(fs, 'fsync');
+    let cnt = 0;
+
+    for (const v of values) {
+      const file = nextFile();
+
+      fs.writeFile(file, data, { flush: v }, common.mustSucceed(() => {
+        assert.strictEqual(fs.readFileSync(file, 'utf8'), data);
+        cnt++;
+
+        if (cnt === values.length) {
+          assert.strictEqual(spy.mock.calls.length, 0);
+          done();
+        }
+      }));
+    }
+  });
+});
+
+test('promise based version', async (t) => {
+  await t.test('validation', async (t) => {
+    for (const v of ['true', '', 0, 1, [], {}, Symbol()]) {
+      await assert.rejects(() => {
+        return fsp.writeFile(nextFile(), data, { flush: v });
+      }, { code: 'ERR_INVALID_ARG_TYPE' });
+    }
+  });
+
+  await t.test('success path', async (t) => {
+    for (const v of [undefined, null, false, true]) {
+      const file = nextFile();
+      await fsp.writeFile(file, data, { flush: v });
+      assert.strictEqual(await fsp.readFile(file, 'utf8'), data);
+    }
+  });
+});
diff --git a/test/parallel/test-fs-write-stream-flush.js b/test/parallel/test-fs-write-stream-flush.js
new file mode 100644
index 00000000000000..452dd0a1051ab6
--- /dev/null
+++ b/test/parallel/test-fs-write-stream-flush.js
@@ -0,0 +1,81 @@
+'use strict';
+const common = require('../common');
+const tmpdir = require('../common/tmpdir');
+const assert = require('node:assert');
+const fs = require('node:fs');
+const fsp = require('node:fs/promises');
+const test = require('node:test');
+const data = 'foo';
+let cnt = 0;
+
+function nextFile() {
+  return tmpdir.resolve(`${cnt++}.out`);
+}
+
+tmpdir.refresh();
+
+test('validation', () => {
+  for (const flush of ['true', '', 0, 1, [], {}, Symbol()]) {
+    assert.throws(() => {
+      fs.createWriteStream(nextFile(), { flush });
+    }, { code: 'ERR_INVALID_ARG_TYPE' });
+  }
+});
+
+test('performs flush', (t, done) => {
+  const spy = t.mock.method(fs, 'fsync');
+  const file = nextFile();
+  const stream = fs.createWriteStream(file, { flush: true });
+
+  stream.write(data, common.mustSucceed(() => {
+    stream.close(common.mustSucceed(() => {
+      const calls = spy.mock.calls;
+      assert.strictEqual(calls.length, 1);
+      assert.strictEqual(calls[0].result, undefined);
+      assert.strictEqual(calls[0].error, undefined);
+      assert.strictEqual(calls[0].arguments.length, 2);
+      assert.strictEqual(typeof calls[0].arguments[0], 'number');
+      assert.strictEqual(typeof calls[0].arguments[1], 'function');
+      assert.strictEqual(fs.readFileSync(file, 'utf8'), data);
+      done();
+    }));
+  }));
+});
+
+test('does not perform flush', (t, done) => {
+  const values = [undefined, null, false];
+  const spy = t.mock.method(fs, 'fsync');
+  let cnt = 0;
+
+  for (const flush of values) {
+    const file = nextFile();
+    const stream = fs.createWriteStream(file, { flush });
+
+    stream.write(data, common.mustSucceed(() => {
+      stream.close(common.mustSucceed(() => {
+        assert.strictEqual(fs.readFileSync(file, 'utf8'), data);
+        cnt++;
+
+        if (cnt === values.length) {
+          assert.strictEqual(spy.mock.calls.length, 0);
+          done();
+        }
+      }));
+    }));
+  }
+});
+
+test('works with file handles', async () => {
+  const file = nextFile();
+  const handle = await fsp.open(file, 'w');
+  const stream = handle.createWriteStream({ flush: true });
+
+  return new Promise((resolve) => {
+    stream.write(data, common.mustSucceed(() => {
+      stream.close(common.mustSucceed(() => {
+        assert.strictEqual(fs.readFileSync(file, 'utf8'), data);
+        resolve();
+      }));
+    }));
+  });
+});
diff --git a/test/parallel/test-fs-write.js b/test/parallel/test-fs-write.js
index 59b83f531cf0a6..a4aeb4e16a748f 100644
--- a/test/parallel/test-fs-write.js
+++ b/test/parallel/test-fs-write.js
@@ -35,13 +35,23 @@ const fn4 = tmpdir.resolve('write4.txt');
 const expected = 'ümlaut.';
 const constants = fs.constants;
 
-const { externalizeString, isOneByteString } = global;
+const {
+  createExternalizableString,
+  externalizeString,
+  isOneByteString,
+} = global;
 
 // Account for extra globals exposed by --expose_externalize_string.
-common.allowGlobals(externalizeString, isOneByteString, global.x);
+common.allowGlobals(
+  createExternalizableString,
+  externalizeString,
+  isOneByteString,
+  global.x,
+);
 
 {
-  const expected = 'ümlaut sechzig';  // Must be a unique string.
+  // Must be a unique string.
+  const expected = createExternalizableString('ümlaut sechzig');
   externalizeString(expected);
   assert.strictEqual(isOneByteString(expected), true);
   const fd = fs.openSync(fn, 'w');
@@ -51,7 +61,8 @@ common.allowGlobals(externalizeString, isOneByteString, global.x);
 }
 
 {
-  const expected = 'ümlaut neunzig';  // Must be a unique string.
+  // Must be a unique string.
+  const expected = createExternalizableString('ümlaut neunzig');
   externalizeString(expected);
   assert.strictEqual(isOneByteString(expected), true);
   const fd = fs.openSync(fn, 'w');
@@ -61,7 +72,8 @@ common.allowGlobals(externalizeString, isOneByteString, global.x);
 }
 
 {
-  const expected = 'Zhōngwén 1';  // Must be a unique string.
+  // Must be a unique string.
+  const expected = createExternalizableString('Zhōngwén 1');
   externalizeString(expected);
   assert.strictEqual(isOneByteString(expected), false);
   const fd = fs.openSync(fn, 'w');
@@ -71,7 +83,8 @@ common.allowGlobals(externalizeString, isOneByteString, global.x);
 }
 
 {
-  const expected = 'Zhōngwén 2';  // Must be a unique string.
+  // Must be a unique string.
+  const expected = createExternalizableString('Zhōngwén 2');
   externalizeString(expected);
   assert.strictEqual(isOneByteString(expected), false);
   const fd = fs.openSync(fn, 'w');
diff --git a/test/parallel/test-http-client-error-rawbytes.js b/test/parallel/test-http-client-error-rawbytes.js
index c0ea16a6432698..0c8efb8c9767ab 100644
--- a/test/parallel/test-http-client-error-rawbytes.js
+++ b/test/parallel/test-http-client-error-rawbytes.js
@@ -19,11 +19,11 @@ server.listen(0, common.mustCall(() => {
   const req = http.get(`http://localhost:${server.address().port}/`);
   req.end();
   req.on('error', common.mustCall((err) => {
-    const reason = 'Content-Length can\'t be present with Transfer-Encoding';
+    const reason = "Transfer-Encoding can't be present with Content-Length";
     assert.strictEqual(err.message, `Parse Error: ${reason}`);
     assert(err.bytesParsed < response.length);
     assert(err.bytesParsed >= response.indexOf('Transfer-Encoding'));
-    assert.strictEqual(err.code, 'HPE_UNEXPECTED_CONTENT_LENGTH');
+    assert.strictEqual(err.code, 'HPE_INVALID_TRANSFER_ENCODING');
     assert.strictEqual(err.reason, reason);
     assert.deepStrictEqual(err.rawPacket, response);
 
diff --git a/test/parallel/test-http-client-reject-chunked-with-content-length.js b/test/parallel/test-http-client-reject-chunked-with-content-length.js
index a3da5180e18f73..de736829b25277 100644
--- a/test/parallel/test-http-client-reject-chunked-with-content-length.js
+++ b/test/parallel/test-http-client-reject-chunked-with-content-length.js
@@ -20,7 +20,7 @@ server.listen(0, () => {
   const req = http.get({ port: server.address().port }, common.mustNotCall());
   req.on('error', common.mustCall((err) => {
     assert.match(err.message, /^Parse Error/);
-    assert.strictEqual(err.code, 'HPE_UNEXPECTED_CONTENT_LENGTH');
+    assert.strictEqual(err.code, 'HPE_INVALID_TRANSFER_ENCODING');
     server.close();
   }));
 });
diff --git a/test/parallel/test-http-dummy-characters-smuggling.js b/test/parallel/test-http-dummy-characters-smuggling.js
new file mode 100644
index 00000000000000..ac6f8560e72567
--- /dev/null
+++ b/test/parallel/test-http-dummy-characters-smuggling.js
@@ -0,0 +1,90 @@
+'use strict';
+
+const common = require('../common');
+const http = require('http');
+const net = require('net');
+const assert = require('assert');
+
+// Verify that arbitrary characters after a \r cannot be used to perform HTTP request smuggling attacks.
+
+{
+  const server = http.createServer(common.mustNotCall());
+
+  server.listen(0, common.mustCall(() => {
+    const client = net.connect(server.address().port);
+    let response = '';
+
+    client.on('data', common.mustCall((chunk) => {
+      response += chunk;
+    }));
+
+    client.setEncoding('utf8');
+    client.on('error', common.mustNotCall());
+    client.on('end', common.mustCall(() => {
+      assert.strictEqual(
+        response,
+        'HTTP/1.1 400 Bad Request\r\nConnection: close\r\n\r\n'
+      );
+      server.close();
+    }));
+
+    client.write('' +
+      'GET / HTTP/1.1\r\n' +
+      'Connection: close\r\n' +
+      'Host: a\r\n\rZ\r\n' + // Note the Z at the end of the line instead of a \n
+      'GET /evil: HTTP/1.1\r\n' +
+      'Host: a\r\n\r\n'
+    );
+
+    client.resume();
+  }));
+}
+
+{
+  const server = http.createServer((request, response) => {
+    // Since chunk parsing failed, none of this should be called
+
+    request.on('data', common.mustNotCall());
+    request.on('end', common.mustNotCall());
+  });
+
+  server.listen(0, common.mustCall(() => {
+    const client = net.connect(server.address().port);
+    let response = '';
+
+    client.on('data', common.mustCall((chunk) => {
+      response += chunk;
+    }));
+
+    client.setEncoding('utf8');
+    client.on('error', common.mustNotCall());
+    client.on('end', common.mustCall(() => {
+      assert.strictEqual(
+        response,
+        'HTTP/1.1 400 Bad Request\r\nConnection: close\r\n\r\n'
+      );
+      server.close();
+    }));
+
+    client.write('' +
+      'GET / HTTP/1.1\r\n' +
+      'Host: a\r\n' +
+      'Connection: close \r\n' +
+      'Transfer-Encoding: chunked \r\n' +
+      '\r\n' +
+      '5\r\r;ABCD\r\n' + // Note the second \r instead of \n after the chunk length
+      '34\r\n' +
+      'E\r\n' +
+      '0\r\n' +
+      '\r\n' +
+      'GET / HTTP/1.1 \r\n' +
+      'Host: a\r\n' +
+      'Content-Length: 5\r\n' +
+      '\r\n' +
+      '0\r\n' +
+      '\r\n'
+    );
+
+    client.resume();
+  }));
+}
diff --git a/test/parallel/test-http-invalid-te.js b/test/parallel/test-http-invalid-te.js
index 9ae8a87d8e128a..5651e94186a2f7 100644
--- a/test/parallel/test-http-invalid-te.js
+++ b/test/parallel/test-http-invalid-te.js
@@ -27,7 +27,7 @@ I AM A SMUGGLED REQUEST!!!
 const server = http.createServer(common.mustNotCall());
 
 server.on('clientError', common.mustCall((err) => {
-  assert.strictEqual(err.code, 'HPE_UNEXPECTED_CONTENT_LENGTH');
+  assert.strictEqual(err.code, 'HPE_INVALID_TRANSFER_ENCODING');
   server.close();
 }));
 
diff --git a/test/parallel/test-http-response-splitting.js b/test/parallel/test-http-response-splitting.js
index 25d8348dd9a78d..78e7a94b2537f6 100644
--- a/test/parallel/test-http-response-splitting.js
+++ b/test/parallel/test-http-response-splitting.js
@@ -8,10 +8,10 @@ const assert = require('assert');
 const Countdown = require('../common/countdown');
 
 // Response splitting example, credit: Amit Klein, Safebreach
-const str = '/welcome?lang=bar%c4%8d%c4%8aContent­Length:%200%c4%8d%c4%8a%c' +
-            '4%8d%c4%8aHTTP/1.1%20200%20OK%c4%8d%c4%8aContent­Length:%202' +
-            '0%c4%8d%c4%8aLast­Modified:%20Mon,%2027%20Oct%202003%2014:50:18' +
-            '%20GMT%c4%8d%c4%8aContent­Type:%20text/html%c4%8d%c4%8a%c4%8' +
+const str = '/welcome?lang=bar%c4%8d%c4%8aContent-Length:%200%c4%8d%c4%8a%c' +
+            '4%8d%c4%8aHTTP/1.1%20200%20OK%c4%8d%c4%8aContent-Length:%202' +
+            '0%c4%8d%c4%8aLast-Modified:%20Mon,%2027%20Oct%202003%2014:50:18' +
+            '%20GMT%c4%8d%c4%8aContent-Type:%20text/html%c4%8d%c4%8a%c4%8' +
             'd%c4%8a%3chtml%3eGotcha!%3c/html%3e';
 
 // Response splitting example, credit: Сковорода Никита Андреевич (@ChALkeR)
diff --git a/test/parallel/test-http-server-reject-chunked-with-content-length.js b/test/parallel/test-http-server-reject-chunked-with-content-length.js
index 4e287ec184308a..19db134c2a86f4 100644
--- a/test/parallel/test-http-server-reject-chunked-with-content-length.js
+++ b/test/parallel/test-http-server-reject-chunked-with-content-length.js
@@ -12,7 +12,7 @@ const reqstr = 'POST / HTTP/1.1\r\n' +
 const server = http.createServer(common.mustNotCall());
 server.on('clientError', common.mustCall((err) => {
   assert.match(err.message, /^Parse Error/);
-  assert.strictEqual(err.code, 'HPE_UNEXPECTED_CONTENT_LENGTH');
+  assert.strictEqual(err.code, 'HPE_INVALID_TRANSFER_ENCODING');
   server.close();
 }));
 server.listen(0, () => {
diff --git a/test/parallel/test-http-url.parse-only-support-http-https-protocol.js b/test/parallel/test-http-url.parse-only-support-http-https-protocol.js
index 9b2a575ba7b1d7..3f6633075c6aec 100644
--- a/test/parallel/test-http-url.parse-only-support-http-https-protocol.js
+++ b/test/parallel/test-http-url.parse-only-support-http-https-protocol.js
@@ -34,7 +34,7 @@ const invalidUrls = [
   'f://some.host/path',
 ];
 
-invalidUrls.forEach((invalid) => {
+for (const invalid of invalidUrls) {
   assert.throws(
     () => { http.request(url.parse(invalid)); },
     {
@@ -42,4 +42,4 @@ invalidUrls.forEach((invalid) => {
       name: 'TypeError'
     }
   );
-});
+}
diff --git a/test/parallel/test-https-foafssl.js b/test/parallel/test-https-foafssl.js
index ff2c7d4387ee1b..d6dde97a41da9c 100644
--- a/test/parallel/test-https-foafssl.js
+++ b/test/parallel/test-https-foafssl.js
@@ -81,7 +81,7 @@ server.listen(0, function() {
     console.log('server.close() called');
   });
 
-  client.stdin.write('GET /\n\n');
+  client.stdin.write('GET /\r\n\r\n');
 
   client.on('error', function(error) {
     throw error;
diff --git a/test/parallel/test-icu-data-dir.js b/test/parallel/test-icu-data-dir.js
index f1da0dc685ae9d..0a3166180be3f4 100644
--- a/test/parallel/test-icu-data-dir.js
+++ b/test/parallel/test-icu-data-dir.js
@@ -1,27 +1,33 @@
 // Flags: --expose-internals
 'use strict';
 const common = require('../common');
+const { spawnSyncAndExit } = require('../common/child_process');
 const { internalBinding } = require('internal/test/binding');
-const os = require('os');
 
 const { hasSmallICU } = internalBinding('config');
 if (!(common.hasIntl && hasSmallICU))
   common.skip('missing Intl');
 
-const assert = require('assert');
-const { spawnSync } = require('child_process');
-
-const expected =
-    'could not initialize ICU (check NODE_ICU_DATA or ' +
-    `--icu-data-dir parameters)${os.EOL}`;
-
 {
-  const child = spawnSync(process.execPath, ['--icu-data-dir=/', '-e', '0']);
-  assert(child.stderr.toString().includes(expected));
+  spawnSyncAndExit(
+    process.execPath,
+    ['--icu-data-dir=/', '-e', '0'],
+    {
+      status: 9,
+      signal: null,
+      stderr: /Could not initialize ICU/
+    });
 }
 
 {
   const env = { ...process.env, NODE_ICU_DATA: '/' };
-  const child = spawnSync(process.execPath, ['-e', '0'], { env });
-  assert(child.stderr.toString().includes(expected));
+  spawnSyncAndExit(
+    process.execPath,
+    ['-e', '0'],
+    { env },
+    {
+      status: 9,
+      signal: null,
+      stderr: /Could not initialize ICU/
+    });
 }
diff --git a/test/parallel/test-mime-api.js b/test/parallel/test-mime-api.js
index 0510ddaed20267..0fabd1a4cce35f 100644
--- a/test/parallel/test-mime-api.js
+++ b/test/parallel/test-mime-api.js
@@ -1,8 +1,10 @@
+// Flags: --expose-internals
 'use strict';
 
 require('../common');
 const assert = require('assert');
 const { MIMEType, MIMEParams } = require('util');
+const { toASCIILower } = require('internal/mime');
 
 
 const WHITESPACES = '\t\n\f\r ';
@@ -158,3 +160,8 @@ assert.throws(() => params.set(`x${NOT_HTTP_TOKEN_CODE_POINT}`, 'x'), /parameter
 assert.throws(() => params.set('x', `${NOT_HTTP_QUOTED_STRING_CODE_POINT};`), /parameter value/i);
 assert.throws(() => params.set('x', `${NOT_HTTP_QUOTED_STRING_CODE_POINT}x`), /parameter value/i);
 assert.throws(() => params.set('x', `x${NOT_HTTP_QUOTED_STRING_CODE_POINT}`), /parameter value/i);
+
+assert.strictEqual(toASCIILower('someThing'), 'something');
+assert.strictEqual(toASCIILower('SomeThing'), 'something');
+assert.strictEqual(toASCIILower('SomeThing3'), 'something3');
+assert.strictEqual(toASCIILower('ABCDEFGHIJKLMNOPQRSTUVWXYZ'), 'abcdefghijklmnopqrstuvwxyz');
diff --git a/test/parallel/test-net-isipv6.js b/test/parallel/test-net-isipv6.js
index 855f17a076c697..dbb8d80b7b16bd 100644
--- a/test/parallel/test-net-isipv6.js
+++ b/test/parallel/test-net-isipv6.js
@@ -235,10 +235,10 @@ const v6not = [
   '02001:0000:1234:0000:0000:C1C0:ABCD:0876',
 ];
 
-v6.forEach((ip) => {
+for (const ip of v6) {
   assert.strictEqual(net.isIPv6(ip), true);
-});
+}
 
-v6not.forEach((ip) => {
+for (const ip of v6not) {
   assert.strictEqual(net.isIPv6(ip), false);
-});
+}
diff --git a/test/parallel/test-net-perf_hooks.js b/test/parallel/test-net-perf_hooks.js
index 6b0d13aab27019..06b88ed7e7e7b9 100644
--- a/test/parallel/test-net-perf_hooks.js
+++ b/test/parallel/test-net-perf_hooks.js
@@ -49,12 +49,12 @@ obs.observe({ type: 'net' });
 
 process.on('exit', () => {
   assert.strictEqual(entries.length, 1);
-  entries.forEach((entry) => {
+  for (const entry of entries) {
     assert.strictEqual(entry.name, 'connect');
     assert.strictEqual(entry.entryType, 'net');
     assert.strictEqual(typeof entry.startTime, 'number');
     assert.strictEqual(typeof entry.duration, 'number');
     assert.strictEqual(!!entry.detail.host, true);
     assert.strictEqual(!!entry.detail.port, true);
-  });
+  }
 });
diff --git a/test/parallel/test-node-output-errors.mjs b/test/parallel/test-node-output-errors.mjs
index 4c4fc08c0cf382..c0acee2bfc8c12 100644
--- a/test/parallel/test-node-output-errors.mjs
+++ b/test/parallel/test-node-output-errors.mjs
@@ -11,14 +11,15 @@ const skipForceColors =
   (common.isWindows && (Number(os.release().split('.')[0]) !== 10 || Number(os.release().split('.')[2]) < 14393)); // See https://github.com/nodejs/node/pull/33132
 
 
-function replaceNodeVersion(str) {
-  return str.replaceAll(process.version, '*');
-}
-
 function replaceStackTrace(str) {
   return snapshot.replaceStackTrace(str, '$1at *$7\n');
 }
 
+function replaceForceColorsStackTrace(str) {
+  // eslint-disable-next-line no-control-regex
+  return str.replaceAll(/(\[90m\W+)at .*node:.*/g, '$1at *');
+}
+
 describe('errors output', { concurrency: true }, () => {
   function normalize(str) {
     return str.replaceAll(snapshot.replaceWindowsPaths(process.cwd()), '')
@@ -35,9 +36,12 @@ describe('errors output', { concurrency: true }, () => {
   }
   const common = snapshot
     .transform(snapshot.replaceWindowsLineEndings, snapshot.replaceWindowsPaths);
-  const defaultTransform = snapshot.transform(common, normalize, replaceNodeVersion);
-  const errTransform = snapshot.transform(common, normalizeNoNumbers, replaceNodeVersion);
-  const promiseTransform = snapshot.transform(common, replaceStackTrace, normalizeNoNumbers, replaceNodeVersion);
+  const defaultTransform = snapshot.transform(common, normalize, snapshot.replaceNodeVersion);
+  const errTransform = snapshot.transform(common, normalizeNoNumbers, snapshot.replaceNodeVersion);
+  const promiseTransform = snapshot.transform(common, replaceStackTrace,
+                                              normalizeNoNumbers, snapshot.replaceNodeVersion);
+  const forceColorsTransform = snapshot.transform(common, normalize,
+                                                  replaceForceColorsStackTrace, snapshot.replaceNodeVersion);
 
   const tests = [
     { name: 'errors/async_error_eval_cjs.js' },
@@ -45,7 +49,9 @@ describe('errors output', { concurrency: true }, () => {
     { name: 'errors/async_error_microtask_main.js' },
     { name: 'errors/async_error_nexttick_main.js' },
     { name: 'errors/async_error_sync_main.js' },
+    { name: 'errors/core_line_numbers.js' },
     { name: 'errors/async_error_sync_esm.mjs' },
+    { name: 'errors/test-no-extra-info-on-fatal-exception.js' },
     { name: 'errors/error_aggregateTwoErrors.js', transform: errTransform },
     { name: 'errors/error_exit.js', transform: errTransform },
     { name: 'errors/error_with_nul.js', transform: errTransform },
@@ -53,11 +59,20 @@ describe('errors output', { concurrency: true }, () => {
     { name: 'errors/events_unhandled_error_nexttick.js', transform: errTransform },
     { name: 'errors/events_unhandled_error_sameline.js', transform: errTransform },
     { name: 'errors/events_unhandled_error_subclass.js', transform: errTransform },
+    { name: 'errors/if-error-has-good-stack.js', transform: errTransform },
     { name: 'errors/throw_custom_error.js', transform: errTransform },
+    { name: 'errors/throw_error_with_getter_throw.js', transform: errTransform },
     { name: 'errors/throw_in_line_with_tabs.js', transform: errTransform },
     { name: 'errors/throw_non_error.js', transform: errTransform },
+    { name: 'errors/throw_null.js', transform: errTransform },
+    { name: 'errors/throw_undefined.js', transform: errTransform },
+    { name: 'errors/timeout_throw.js', transform: errTransform },
+    { name: 'errors/undefined_reference_in_new_context.js', transform: errTransform },
     { name: 'errors/promise_always_throw_unhandled.js', transform: promiseTransform },
-    { skip: skipForceColors, name: 'errors/force_colors.js', env: { FORCE_COLOR: 1 } },
+    { name: 'errors/promise_unhandled_warn_with_error.js', transform: promiseTransform },
+    { name: 'errors/unhandled_promise_trace_warnings.js', transform: promiseTransform },
+    { skip: skipForceColors, name: 'errors/force_colors.js',
+      transform: forceColorsTransform, env: { FORCE_COLOR: 1 } },
   ];
   for (const { name, transform = defaultTransform, env, skip = false } of tests) {
     it(name, { skip }, async () => {
diff --git a/test/parallel/test-node-output-sourcemaps.mjs b/test/parallel/test-node-output-sourcemaps.mjs
index 2043fa57f06a8d..b01f30765c7de8 100644
--- a/test/parallel/test-node-output-sourcemaps.mjs
+++ b/test/parallel/test-node-output-sourcemaps.mjs
@@ -4,10 +4,6 @@ import * as snapshot from '../common/assertSnapshot.js';
 import * as path from 'node:path';
 import { describe, it } from 'node:test';
 
-function replaceNodeVersion(str) {
-  return str.replaceAll(process.version, '*');
-}
-
 describe('sourcemaps output', { concurrency: true }, () => {
   function normalize(str) {
     const result = str
@@ -16,7 +12,8 @@ describe('sourcemaps output', { concurrency: true }, () => {
     .replaceAll('/Users/bencoe/oss/coffee-script-test', '')
     .replaceAll(/\/(\w)/g, '*$1')
     .replaceAll('*test*', '*')
-    .replaceAll('*fixtures*source-map*', '*');
+    .replaceAll('*fixtures*source-map*', '*')
+    .replaceAll(/(\W+).*node:internal\*modules.*/g, '$1*');
     if (common.isWindows) {
       const currentDeviceLetter = path.parse(process.cwd()).root.substring(0, 1).toLowerCase();
       const regex = new RegExp(`${currentDeviceLetter}:/?`, 'gi');
@@ -25,7 +22,8 @@ describe('sourcemaps output', { concurrency: true }, () => {
     return result;
   }
   const defaultTransform = snapshot
-    .transform(snapshot.replaceWindowsLineEndings, snapshot.replaceWindowsPaths, normalize, replaceNodeVersion);
+    .transform(snapshot.replaceWindowsLineEndings, snapshot.replaceWindowsPaths,
+               normalize, snapshot.replaceNodeVersion);
 
   const tests = [
     { name: 'source-map/output/source_map_disabled_by_api.js' },
diff --git a/test/parallel/test-os.js b/test/parallel/test-os.js
index f0f55fbe261946..f7059260ce507e 100644
--- a/test/parallel/test-os.js
+++ b/test/parallel/test-os.js
@@ -81,6 +81,15 @@ const hostname = os.hostname();
 is.string(hostname);
 assert.ok(hostname.length > 0);
 
+// IBMi process priority is different.
+if (!common.isIBMi) {
+  const DUMMY_PRIORITY = 10;
+  os.setPriority(DUMMY_PRIORITY);
+  const priority = os.getPriority();
+  is.number(priority);
+  assert.strictEqual(priority, DUMMY_PRIORITY);
+}
+
 // On IBMi, os.uptime() returns 'undefined'
 if (!common.isIBMi) {
   const uptime = os.uptime();
diff --git a/test/parallel/test-parse-args.mjs b/test/parallel/test-parse-args.mjs
index 98c162643e64ff..41af0eba1c923d 100644
--- a/test/parallel/test-parse-args.mjs
+++ b/test/parallel/test-parse-args.mjs
@@ -451,7 +451,7 @@ const candidateGreedyOptions = [
   '--foo',
 ];
 
-candidateGreedyOptions.forEach((value) => {
+for (const value of candidateGreedyOptions) {
   test(`greedy: when short option with value '${value}' then eaten`, () => {
     const args = ['-w', value];
     const options = { with: { type: 'string', short: 'w' } };
@@ -469,7 +469,7 @@ candidateGreedyOptions.forEach((value) => {
     const result = parseArgs({ args, options, strict: false });
     assert.deepStrictEqual(result, expectedResult);
   });
-});
+}
 
 test('strict: when candidate option value is plain text then does not throw', () => {
   const args = ['--with', 'abc'];
diff --git a/test/parallel/test-permission-fs-traversal-path.js b/test/parallel/test-permission-fs-traversal-path.js
index 547cd81c77cf18..d618c3e4f79879 100644
--- a/test/parallel/test-permission-fs-traversal-path.js
+++ b/test/parallel/test-permission-fs-traversal-path.js
@@ -18,7 +18,7 @@ const tmpdir = require('../common/tmpdir');
 
 const file = fixtures.path('permission', 'fs-traversal.js');
 const blockedFolder = tmpdir.path;
-const allowedFolder = tmpdir.resolve('subdirectory/');
+const allowedFolder = tmpdir.resolve('subdirectory');
 const commonPathWildcard = path.join(__filename, '../../common*');
 
 {
diff --git a/test/parallel/test-pipe-abstract-socket-http.js b/test/parallel/test-pipe-abstract-socket-http.js
new file mode 100644
index 00000000000000..6d3beb44d1e277
--- /dev/null
+++ b/test/parallel/test-pipe-abstract-socket-http.js
@@ -0,0 +1,27 @@
+'use strict';
+const common = require('../common');
+const assert = require('assert');
+const http = require('http');
+
+if (!common.isLinux) common.skip();
+
+const server = http.createServer(
+  common.mustCall((req, res) => {
+    res.end('ok');
+  })
+);
+
+server.listen(
+  '\0abstract',
+  common.mustCall(() => {
+    http.get(
+      {
+        socketPath: server.address(),
+      },
+      common.mustCall((res) => {
+        assert.strictEqual(res.statusCode, 200);
+        server.close();
+      })
+    );
+  })
+);
diff --git a/test/parallel/test-policy-crypto-hash-tampering.js b/test/parallel/test-policy-crypto-hash-tampering.js
new file mode 100644
index 00000000000000..96066defb59a1b
--- /dev/null
+++ b/test/parallel/test-policy-crypto-hash-tampering.js
@@ -0,0 +1,21 @@
+'use strict';
+
+const common = require('../common');
+if (!common.hasCrypto)
+  common.skip('missing crypto');
+common.requireNoPackageJSONAbove();
+
+const fixtures = require('../common/fixtures');
+
+const assert = require('assert');
+const { spawnSync } = require('child_process');
+
+const mainPath = fixtures.path('policy', 'crypto-hash-tampering', 'main.js');
+const policyPath = fixtures.path(
+  'policy',
+  'crypto-hash-tampering',
+  'policy.json');
+const { status, stderr } =
+    spawnSync(process.execPath, ['--experimental-policy', policyPath, mainPath], { encoding: 'utf8' });
+assert.strictEqual(status, 1);
+assert(stderr.includes('sha384-Bnp/T8gFNzT9mHj2G/AeuMH8LcAQ4mljw15nxBNl5yaGM7VgbMzDT7O4+dXZTJJn'));
diff --git a/test/parallel/test-process-dlopen-error-message-crash.js b/test/parallel/test-process-dlopen-error-message-crash.js
index d678021764e8f4..de8b3033195a46 100644
--- a/test/parallel/test-process-dlopen-error-message-crash.js
+++ b/test/parallel/test-process-dlopen-error-message-crash.js
@@ -17,7 +17,7 @@ assert.throws(() => {
 }, ({ name, code, message }) => {
   assert.strictEqual(name, 'Error');
   assert.strictEqual(code, 'ERR_DLOPEN_FAILED');
-  if (!common.isAIX) {
+  if (!common.isAIX && !common.isIBMi) {
     assert.match(message, /foo-%s\.node/);
   }
   return true;
diff --git a/test/parallel/test-process-env-ignore-getter-setter.js b/test/parallel/test-process-env-ignore-getter-setter.js
index 677960570a0bc1..e17e3752856e81 100644
--- a/test/parallel/test-process-env-ignore-getter-setter.js
+++ b/test/parallel/test-process-env-ignore-getter-setter.js
@@ -40,7 +40,7 @@ assert.throws(
 
 const attributes = ['configurable', 'writable', 'enumerable'];
 
-attributes.forEach((attribute) => {
+for (const attribute of attributes) {
   assert.throws(
     () => {
       Object.defineProperty(process.env, 'goo', {
@@ -55,7 +55,7 @@ attributes.forEach((attribute) => {
           ' and enumerable data descriptor'
     }
   );
-});
+}
 
 assert.strictEqual(process.env.goo, undefined);
 Object.defineProperty(process.env, 'goo', {
diff --git a/test/parallel/test-readline-async-iterators.js b/test/parallel/test-readline-async-iterators.js
index fdd3edaaf9e119..32fa32a1284a09 100644
--- a/test/parallel/test-readline-async-iterators.js
+++ b/test/parallel/test-readline-async-iterators.js
@@ -73,115 +73,6 @@ async function testMutual() {
   }
 }
 
-async function testPerformance() {
-  const loremIpsum = `Lorem ipsum dolor sit amet, consectetur adipiscing elit,
-sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.
-Dui accumsan sit amet nulla facilisi morbi tempus iaculis urna.
-Eget dolor morbi non arcu risus quis varius quam quisque.
-Lacus viverra vitae congue eu consequat ac felis donec.
-Amet porttitor eget dolor morbi non arcu.
-Velit ut tortor pretium viverra suspendisse.
-Mauris nunc congue nisi vitae suscipit tellus.
-Amet nisl suscipit adipiscing bibendum est ultricies integer.
-Sit amet dictum sit amet justo donec enim diam.
-Condimentum mattis pellentesque id nibh tortor id aliquet lectus proin.
-Diam in arcu cursus euismod quis viverra nibh.
-`;
-
-  const REPETITIONS = 10000;
-  const SAMPLE = 100;
-  const THRESHOLD = 81;
-
-  function getLoremIpsumStream() {
-    const readable = Readable({
-      objectMode: true,
-    });
-    let i = 0;
-    readable._read = () => readable.push(
-      i++ >= REPETITIONS ? null : loremIpsum
-    );
-    return readable;
-  }
-
-  function oldWay() {
-    const readable = new Readable({
-      objectMode: true,
-      read: () => {
-        this.resume();
-      },
-      destroy: (err, cb) => {
-        this.off('line', lineListener);
-        this.off('close', closeListener);
-        this.close();
-        cb(err);
-      },
-    });
-    const lineListener = (input) => {
-      if (!readable.push(input)) {
-        // TODO(rexagod): drain to resume flow
-        this.pause();
-      }
-    };
-    const closeListener = () => {
-      readable.push(null);
-    };
-    const errorListener = (err) => {
-      readable.destroy(err);
-    };
-    this.on('error', errorListener);
-    this.on('line', lineListener);
-    this.on('close', closeListener);
-    return readable[Symbol.asyncIterator]();
-  }
-
-  function getAvg(mean, x, n) {
-    return (mean * n + x) / (n + 1);
-  }
-
-  let totalTimeOldWay = 0;
-  let totalTimeNewWay = 0;
-  let totalCharsOldWay = 0;
-  let totalCharsNewWay = 0;
-  const linesOldWay = [];
-  const linesNewWay = [];
-
-  for (let time = 0; time < SAMPLE; time++) {
-    const rlOldWay = readline.createInterface({
-      input: getLoremIpsumStream(),
-    });
-    let currenttotalTimeOldWay = Date.now();
-    for await (const line of oldWay.call(rlOldWay)) {
-      totalCharsOldWay += line.length;
-      if (time === 0) {
-        linesOldWay.push(line);
-      }
-    }
-    currenttotalTimeOldWay = Date.now() - currenttotalTimeOldWay;
-    totalTimeOldWay = getAvg(totalTimeOldWay, currenttotalTimeOldWay, SAMPLE);
-
-    const rlNewWay = readline.createInterface({
-      input: getLoremIpsumStream(),
-    });
-    let currentTotalTimeNewWay = Date.now();
-    for await (const line of rlNewWay) {
-      totalCharsNewWay += line.length;
-      if (time === 0) {
-        linesNewWay.push(line);
-      }
-    }
-    currentTotalTimeNewWay = Date.now() - currentTotalTimeNewWay;
-    totalTimeNewWay = getAvg(totalTimeNewWay, currentTotalTimeNewWay, SAMPLE);
-  }
-
-  assert.strictEqual(totalCharsOldWay, totalCharsNewWay);
-  assert.strictEqual(linesOldWay.length, linesNewWay.length);
-  linesOldWay.forEach((line, index) =>
-    assert.strictEqual(line, linesNewWay[index])
-  );
-  const percentage = totalTimeNewWay * 100 / totalTimeOldWay;
-  assert.ok(percentage <= THRESHOLD, `Failed: ${totalTimeNewWay} isn't lesser than ${THRESHOLD}% of ${totalTimeOldWay}. Actual percentage: ${percentage.toFixed(2)}%`);
-}
-
 async function testSlowStreamForLeaks() {
   const message = 'a\nb\nc\n';
   const DELAY = 1;
@@ -225,6 +116,5 @@ async function testSlowStreamForLeaks() {
 
 testSimple()
   .then(testMutual)
-  .then(testPerformance)
   .then(testSlowStreamForLeaks)
   .then(common.mustCall());
diff --git a/test/parallel/test-repl-save-load.js b/test/parallel/test-repl-save-load.js
index 19b4cf8f755407..365bad8260bfc6 100644
--- a/test/parallel/test-repl-save-load.js
+++ b/test/parallel/test-repl-save-load.js
@@ -67,9 +67,14 @@ testMe.complete('inner.o', common.mustSucceed((data) => {
 // Clear the REPL.
 putIn.run(['.clear']);
 
+testMe._sawKeyPress = true;
 // Load the file back in.
 putIn.run([`.load ${saveFileName}`]);
 
+// Make sure loading doesn't insert extra indentation
+// https://github.com/nodejs/node/issues/47673
+assert.strictEqual(testMe.line, '');
+
 // Make sure that the REPL data is "correct".
 testMe.complete('inner.o', common.mustSucceed((data) => {
   assert.deepStrictEqual(data, works);
diff --git a/test/parallel/test-repl-top-level-await.js b/test/parallel/test-repl-top-level-await.js
index 1abcca75f1e2a0..c8bc26fad62e5c 100644
--- a/test/parallel/test-repl-top-level-await.js
+++ b/test/parallel/test-repl-top-level-await.js
@@ -207,8 +207,8 @@ async function ctrlCTest() {
   assert.deepStrictEqual(output.slice(0, 3), [
     'await new Promise(() => {})\r',
     'Uncaught:',
-    'Error [ERR_SCRIPT_EXECUTION_INTERRUPTED]: ' +
-      'Script execution was interrupted by `SIGINT`',
+    '[Error [ERR_SCRIPT_EXECUTION_INTERRUPTED]: ' +
+      'Script execution was interrupted by `SIGINT`] {',
   ]);
   assert.deepStrictEqual(output.slice(-2), [
     '}',
diff --git a/test/parallel/test-repl-underscore.js b/test/parallel/test-repl-underscore.js
index 3abd01ba9d0cbc..0f8103ce4573cd 100644
--- a/test/parallel/test-repl-underscore.js
+++ b/test/parallel/test-repl-underscore.js
@@ -180,9 +180,9 @@ function testError() {
       /^Uncaught Error: ENOENT: no such file or directory, scandir '.*nonexistent\?'/,
       /Object\.readdirSync/,
       /^ {2}errno: -(2|4058),$/,
-      "  syscall: 'scandir',",
       "  code: 'ENOENT',",
-      "  path: '/nonexistent?'",
+      "  syscall: 'scandir',",
+      /^ {2}path: '*'/,
       '}',
       "'ENOENT'",
       "'scandir'",
diff --git a/test/parallel/test-repl.js b/test/parallel/test-repl.js
index 74299d4b4cbad5..98a0bc79c64d91 100644
--- a/test/parallel/test-repl.js
+++ b/test/parallel/test-repl.js
@@ -209,7 +209,10 @@ const errorTests = [
   // should throw
   {
     send: 'JSON.parse(\'{invalid: \\\'json\\\'}\');',
-    expect: [/^Uncaught SyntaxError: /]
+    expect: [
+      'Uncaught:',
+      /^SyntaxError: /,
+    ],
   },
   // End of input to JSON.parse error is special case of syntax error,
   // should throw
@@ -220,7 +223,10 @@ const errorTests = [
   // should throw
   {
     send: 'JSON.parse(\'{\');',
-    expect: [/^Uncaught SyntaxError: /]
+    expect: [
+      'Uncaught:',
+      /^SyntaxError: /,
+    ],
   },
   // invalid RegExps are a special case of syntax error,
   // should throw
diff --git a/test/parallel/test-runner-cli-concurrency.js b/test/parallel/test-runner-cli-concurrency.js
new file mode 100644
index 00000000000000..fbabaf08e27279
--- /dev/null
+++ b/test/parallel/test-runner-cli-concurrency.js
@@ -0,0 +1,26 @@
+'use strict';
+require('../common');
+const fixtures = require('../common/fixtures');
+const assert = require('node:assert');
+const { spawnSync } = require('node:child_process');
+const { test } = require('node:test');
+const cwd = fixtures.path('test-runner', 'default-behavior');
+const env = { ...process.env, 'NODE_DEBUG': 'test_runner' };
+
+test('default concurrency', async () => {
+  const args = ['--test'];
+  const cp = spawnSync(process.execPath, args, { cwd, env });
+  assert.match(cp.stderr.toString(), /concurrency: true,/);
+});
+
+test('concurrency of one', async () => {
+  const args = ['--test', '--test-concurrency=1'];
+  const cp = spawnSync(process.execPath, args, { cwd, env });
+  assert.match(cp.stderr.toString(), /concurrency: 1,/);
+});
+
+test('concurrency of two', async () => {
+  const args = ['--test', '--test-concurrency=2'];
+  const cp = spawnSync(process.execPath, args, { cwd, env });
+  assert.match(cp.stderr.toString(), /concurrency: 2,/);
+});
diff --git a/test/parallel/test-runner-filetest-location.js b/test/parallel/test-runner-filetest-location.js
new file mode 100644
index 00000000000000..4e09bcd35eea4f
--- /dev/null
+++ b/test/parallel/test-runner-filetest-location.js
@@ -0,0 +1,20 @@
+'use strict';
+const common = require('../common');
+const fixtures = require('../common/fixtures');
+const { strictEqual } = require('node:assert');
+const { relative } = require('node:path');
+const { run } = require('node:test');
+const fixture = fixtures.path('test-runner', 'never_ending_sync.js');
+const relativePath = relative(process.cwd(), fixture);
+const stream = run({
+  files: [relativePath],
+  timeout: common.platformTimeout(100),
+});
+
+stream.on('test:fail', common.mustCall((result) => {
+  strictEqual(result.name, relativePath);
+  strictEqual(result.details.error.failureType, 'testTimeoutFailure');
+  strictEqual(result.line, 1);
+  strictEqual(result.column, 1);
+  strictEqual(result.file, fixture);
+}));
diff --git a/test/parallel/test-runner-output.mjs b/test/parallel/test-runner-output.mjs
index fff6fed92655e9..372ca8f3bae0ff 100644
--- a/test/parallel/test-runner-output.mjs
+++ b/test/parallel/test-runner-output.mjs
@@ -10,7 +10,6 @@ const skipForceColors =
 
 function replaceTestDuration(str) {
   return str
-    .replaceAll(/duration_ms: 0(\r?\n)/g, 'duration_ms: ZERO$1')
     .replaceAll(/duration_ms: [0-9.]+/g, 'duration_ms: *')
     .replaceAll(/duration_ms [0-9.]+/g, 'duration_ms *');
 }
@@ -20,7 +19,6 @@ const stackTraceBasePath = new RegExp(`${color}\\(${process.cwd()}/?${color}(.*)
 
 function replaceSpecDuration(str) {
   return str
-    .replaceAll(/\(0(\r?\n)ms\)/g, '(ZEROms)')
     .replaceAll(/[0-9.]+ms/g, '*ms')
     .replaceAll(/duration_ms [0-9.]+/g, 'duration_ms *')
     .replace(stackTraceBasePath, '$3');
@@ -28,7 +26,6 @@ function replaceSpecDuration(str) {
 
 function replaceJunitDuration(str) {
   return str
-    .replaceAll(/time="0"/g, 'time="ZERO"')
     .replaceAll(/time="[0-9.]+"/g, 'time="*"')
     .replaceAll(/duration_ms [0-9.]+/g, 'duration_ms *')
     .replaceAll(hostname(), 'HOSTNAME')
diff --git a/test/parallel/test-runner-reporters.js b/test/parallel/test-runner-reporters.js
index c7c883286c70c0..bb831491366dfc 100644
--- a/test/parallel/test-runner-reporters.js
+++ b/test/parallel/test-runner-reporters.js
@@ -134,4 +134,25 @@ describe('node:test reporters', { concurrency: true }, () => {
     assert.strictEqual(child.stdout.toString(), '');
     assert.match(child.stderr.toString(), /ERR_INVALID_ARG_TYPE/);
   });
+
+  it('should throw when reporter errors', async () => {
+    const child = spawnSync(process.execPath,
+                            ['--test', '--test-reporter', fixtures.fileURL('test-runner/custom_reporters/throwing.js'),
+                             fixtures.path('test-runner/default-behavior/index.test.js')]);
+    assert.strictEqual(child.status, 7);
+    assert.strictEqual(child.signal, null);
+    assert.strictEqual(child.stdout.toString(), 'Going to throw an error\n');
+    assert.match(child.stderr.toString(), /Error: Reporting error\r?\n\s+at customReporter/);
+  });
+
+  it('should throw when reporter errors asynchronously', async () => {
+    const child = spawnSync(process.execPath,
+                            ['--test', '--test-reporter',
+                             fixtures.fileURL('test-runner/custom_reporters/throwing-async.js'),
+                             fixtures.path('test-runner/default-behavior/index.test.js')]);
+    assert.strictEqual(child.status, 7);
+    assert.strictEqual(child.signal, null);
+    assert.strictEqual(child.stdout.toString(), 'Going to throw an error\n');
+    assert.match(child.stderr.toString(), /Emitted 'error' event on Duplex instance/);
+  });
 });
diff --git a/test/parallel/test-runner-run.mjs b/test/parallel/test-runner-run.mjs
index be15c42d465fca..0d7aa346409647 100644
--- a/test/parallel/test-runner-run.mjs
+++ b/test/parallel/test-runner-run.mjs
@@ -8,7 +8,6 @@ import assert from 'node:assert';
 const testFixtures = fixtures.path('test-runner');
 
 describe('require(\'node:test\').run', { concurrency: true }, () => {
-
   it('should run with no tests', async () => {
     const stream = run({ files: [] });
     stream.on('test:fail', common.mustNotCall());
@@ -65,13 +64,6 @@ describe('require(\'node:test\').run', { concurrency: true }, () => {
     for await (const _ of stream);
   });
 
-  it('should validate files', async () => {
-    [Symbol(), {}, () => {}, 0, 1, 0n, 1n, '', '1', Promise.resolve([]), true, false]
-      .forEach((files) => assert.throws(() => run({ files }), {
-        code: 'ERR_INVALID_ARG_TYPE'
-      }));
-  });
-
   it('should be piped with dot', async () => {
     const result = await run({
       files: [join(testFixtures, 'default-behavior/test/random.cjs')]
@@ -104,6 +96,16 @@ describe('require(\'node:test\').run', { concurrency: true }, () => {
       assert.match(stringResults[1], /tests 1/);
       assert.match(stringResults[1], /pass 1/);
     });
+
+    it('spec', async () => {
+      const result = await run({
+        files: [join(testFixtures, 'default-behavior/test/random.cjs')]
+      }).compose(spec).toArray();
+      const stringResults = result.map((bfr) => bfr.toString());
+      assert.match(stringResults[0], /this should pass/);
+      assert.match(stringResults[1], /tests 1/);
+      assert.match(stringResults[1], /pass 1/);
+    });
   });
 
   it('should be piped with tap', async () => {
@@ -148,6 +150,18 @@ describe('require(\'node:test\').run', { concurrency: true }, () => {
     assert.strictEqual(result[5], 'ok 2 - this should be executed\n');
   });
 
+  it('should pass only to children', async () => {
+    const result = await run({
+      files: [join(testFixtures, 'test_only.js')],
+      only: true
+    })
+      .compose(tap)
+      .toArray();
+
+    assert.strictEqual(result[2], 'ok 1 - this should be skipped # SKIP \'only\' option not set\n');
+    assert.strictEqual(result[5], 'ok 2 - this should be executed\n');
+  });
+
   it('should emit "test:watch:drained" event on watch mode', async () => {
     const controller = new AbortController();
     await run({
@@ -425,4 +439,20 @@ describe('require(\'node:test\').run', { concurrency: true }, () => {
       assert.deepStrictEqual(executedTestFiles.sort(), [...shardsTestsFiles].sort());
     });
   });
+
+  describe('validation', () => {
+    it('should only allow array in options.files', async () => {
+      [Symbol(), {}, () => {}, 0, 1, 0n, 1n, '', '1', Promise.resolve([]), true, false]
+        .forEach((files) => assert.throws(() => run({ files }), {
+          code: 'ERR_INVALID_ARG_TYPE'
+        }));
+    });
+
+    it('should only allow object as options', () => {
+      [Symbol(), [], () => {}, 0, 1, 0n, 1n, '', '1', true, false]
+        .forEach((options) => assert.throws(() => run(options), {
+          code: 'ERR_INVALID_ARG_TYPE'
+        }));
+    });
+  });
 });
diff --git a/test/parallel/test-snapshot-cwd.js b/test/parallel/test-snapshot-cwd.js
new file mode 100644
index 00000000000000..c41ded27b45a3e
--- /dev/null
+++ b/test/parallel/test-snapshot-cwd.js
@@ -0,0 +1,47 @@
+'use strict';
+
+// This tests that process.cwd() is accurate when
+// restoring state from a snapshot
+
+require('../common');
+const { spawnSyncAndExitWithoutError } = require('../common/child_process');
+const tmpdir = require('../common/tmpdir');
+const fixtures = require('../common/fixtures');
+const fs = require('fs');
+
+tmpdir.refresh();
+const blobPath = tmpdir.resolve('snapshot.blob');
+const file = fixtures.path('snapshot', 'cwd.js');
+
+const subdir = tmpdir.resolve('foo');
+fs.mkdirSync(subdir);
+
+{
+  // Create the snapshot.
+  spawnSyncAndExitWithoutError(process.execPath, [
+    '--snapshot-blob',
+    blobPath,
+    '--build-snapshot',
+    file,
+  ], {
+    cwd: tmpdir.path,
+    encoding: 'utf8'
+  }, {
+    status: 0,
+  });
+}
+
+{
+  spawnSyncAndExitWithoutError(process.execPath, [
+    '--snapshot-blob',
+    blobPath,
+    file,
+  ], {
+    cwd: subdir,
+    encoding: 'utf8'
+  }, {
+    status: 0,
+    trim: true,
+    stdout: subdir,
+  });
+}
diff --git a/test/parallel/test-stream-destroy.js b/test/parallel/test-stream-destroy.js
index 77c3a0aaa3fea5..5269ccfec50271 100644
--- a/test/parallel/test-stream-destroy.js
+++ b/test/parallel/test-stream-destroy.js
@@ -62,11 +62,11 @@ const http = require('http');
 
   server.listen(0, () => {
     const req = http.request({
+      method: 'POST',
       port: server.address().port,
       agent: new http.Agent()
     });
 
-    req.write('asd');
     req.on('response', (res) => {
       const buf = [];
       res.on('data', (data) => buf.push(data));
@@ -78,6 +78,8 @@ const http = require('http');
         server.close();
       }));
     });
+
+    req.end('asd');
   });
 }
 
@@ -97,11 +99,10 @@ const http = require('http');
 
   server.listen(0, () => {
     const req = http.request({
+      method: 'POST',
       port: server.address().port,
       agent: new http.Agent()
     });
-
-    req.write('asd');
     req.on('response', (res) => {
       const buf = [];
       res.on('data', (data) => buf.push(data));
@@ -113,5 +114,7 @@ const http = require('http');
         server.close();
       }));
     });
+
+    req.end('asd');
   });
 }
diff --git a/test/parallel/test-tls-basic-validations.js b/test/parallel/test-tls-basic-validations.js
index 4a3aab314680ac..64ae23758f2353 100644
--- a/test/parallel/test-tls-basic-validations.js
+++ b/test/parallel/test-tls-basic-validations.js
@@ -135,3 +135,12 @@ assert.throws(() => { tls.createSecureContext({ maxVersion: 'fhqwhgads' }); },
                 code: 'ERR_TLS_INVALID_PROTOCOL_VERSION',
                 name: 'TypeError'
               });
+
+for (const checkServerIdentity of [undefined, null, 1, true]) {
+  assert.throws(() => {
+    tls.connect({ checkServerIdentity });
+  }, {
+    code: 'ERR_INVALID_ARG_TYPE',
+    name: 'TypeError',
+  });
+}
diff --git a/test/parallel/test-tls-client-mindhsize.js b/test/parallel/test-tls-client-mindhsize.js
index 92ac995936825d..585632d37a20c8 100644
--- a/test/parallel/test-tls-client-mindhsize.js
+++ b/test/parallel/test-tls-client-mindhsize.js
@@ -74,16 +74,23 @@ testDHE1024();
 assert.throws(() => test(512, true, common.mustNotCall()),
               /DH parameter is less than 1024 bits/);
 
-let errMessage = /minDHSize is not a positive number/;
-[0, -1, -Infinity, NaN].forEach((minDHSize) => {
-  assert.throws(() => tls.connect({ minDHSize }),
-                errMessage);
-});
+for (const minDHSize of [0, -1, -Infinity, NaN]) {
+  assert.throws(() => {
+    tls.connect({ minDHSize });
+  }, {
+    code: 'ERR_OUT_OF_RANGE',
+    name: 'RangeError',
+  });
+}
 
-errMessage = /minDHSize is not a number/;
-[true, false, null, undefined, {}, [], '', '1'].forEach((minDHSize) => {
-  assert.throws(() => tls.connect({ minDHSize }), errMessage);
-});
+for (const minDHSize of [true, false, null, undefined, {}, [], '', '1']) {
+  assert.throws(() => {
+    tls.connect({ minDHSize });
+  }, {
+    code: 'ERR_INVALID_ARG_TYPE',
+    name: 'TypeError',
+  });
+}
 
 process.on('exit', function() {
   assert.strictEqual(nsuccess, 1);
diff --git a/test/parallel/test-tls-invalid-pfx.js b/test/parallel/test-tls-invalid-pfx.js
new file mode 100644
index 00000000000000..c16858f0f78873
--- /dev/null
+++ b/test/parallel/test-tls-invalid-pfx.js
@@ -0,0 +1,23 @@
+'use strict';
+const common = require('../common');
+if (!common.hasCrypto)
+  common.skip('missing crypto');
+const fixtures = require('../common/fixtures');
+
+const {
+  assert, connect, keys
+} = require(fixtures.path('tls-connect'));
+
+const invalidPfx = fixtures.readKey('cert-without-key.pfx');
+
+connect({
+  client: {
+    pfx: invalidPfx,
+    passphrase: 'test',
+    rejectUnauthorized: false
+  },
+  server: keys.agent1
+}, common.mustCall((e, pair, cleanup) => {
+  assert.strictEqual(e.message, 'Unable to load private key from PFX data');
+  cleanup();
+}));
diff --git a/test/parallel/test-tls-set-ciphers.js b/test/parallel/test-tls-set-ciphers.js
index b66c419cf5f4d1..313c5e238956b0 100644
--- a/test/parallel/test-tls-set-ciphers.js
+++ b/test/parallel/test-tls-set-ciphers.js
@@ -1,7 +1,7 @@
 'use strict';
 const common = require('../common');
-if (!common.hasCrypto)
-  common.skip('missing crypto');
+if (!common.hasOpenSSL3)
+  common.skip('missing crypto, or OpenSSL version lower than 3');
 
 const fixtures = require('../common/fixtures');
 const { inspect } = require('util');
@@ -85,6 +85,7 @@ test('AES256-SHA', U, 'AES256-SHA');
 
 test(U, 'TLS_AES_256_GCM_SHA384', 'TLS_AES_256_GCM_SHA384');
 test('TLS_AES_256_GCM_SHA384', U, 'TLS_AES_256_GCM_SHA384');
+test('TLS_AES_256_GCM_SHA384:!TLS_CHACHA20_POLY1305_SHA256', U, 'TLS_AES_256_GCM_SHA384');
 
 // Do not have shared ciphers.
 test('TLS_AES_256_GCM_SHA384', 'TLS_CHACHA20_POLY1305_SHA256',
diff --git a/test/parallel/test-tls-socket-close.js b/test/parallel/test-tls-socket-close.js
index 70af760d53bb4d..0c90593c6af5ca 100644
--- a/test/parallel/test-tls-socket-close.js
+++ b/test/parallel/test-tls-socket-close.js
@@ -6,6 +6,7 @@ if (!common.hasCrypto)
 const assert = require('assert');
 const tls = require('tls');
 const net = require('net');
+const Countdown = require('../common/countdown');
 const fixtures = require('../common/fixtures');
 
 const key = fixtures.readKey('agent2-key.pem');
@@ -14,19 +15,28 @@ const cert = fixtures.readKey('agent2-cert.pem');
 let serverTlsSocket;
 const tlsServer = tls.createServer({ cert, key }, (socket) => {
   serverTlsSocket = socket;
+  socket.on('close', dec);
 });
 
 // A plain net server, that manually passes connections to the TLS
-// server to be upgraded
+// server to be upgraded.
 let netSocket;
+let netSocketCloseEmitted = false;
 const netServer = net.createServer((socket) => {
-  tlsServer.emit('connection', socket);
-
   netSocket = socket;
-}).listen(0, common.mustCall(function() {
+  tlsServer.emit('connection', socket);
+  socket.on('close', () => {
+    netSocketCloseEmitted = true;
+    assert.strictEqual(serverTlsSocket.destroyed, true);
+  });
+}).listen(0, common.mustCall(() => {
   connectClient(netServer);
 }));
 
+const countdown = new Countdown(2, () => {
+  netServer.close();
+});
+
 // A client that connects, sends one message, and closes the raw connection:
 function connectClient(server) {
   const clientTlsSocket = tls.connect({
@@ -41,18 +51,22 @@ function connectClient(server) {
       assert(serverTlsSocket);
 
       netSocket.destroy();
+      assert.strictEqual(netSocket.destroyed, true);
 
       setImmediate(() => {
-        assert.strictEqual(netSocket.destroyed, true);
-
+        // Close callbacks are executed after `setImmediate()` callbacks.
+        assert.strictEqual(netSocketCloseEmitted, false);
+        assert.strictEqual(serverTlsSocket.destroyed, false);
         setImmediate(() => {
-          assert.strictEqual(clientTlsSocket.destroyed, true);
-          assert.strictEqual(serverTlsSocket.destroyed, true);
-
-          tlsServer.close();
-          netServer.close();
+          assert.strictEqual(netSocketCloseEmitted, true);
         });
       });
     }));
   }));
+
+  clientTlsSocket.on('close', dec);
+}
+
+function dec() {
+  countdown.dec();
 }
diff --git a/test/parallel/test-trace-events-bootstrap.js b/test/parallel/test-trace-events-bootstrap.js
index 9497bd896e7bd6..0ad9c33800d799 100644
--- a/test/parallel/test-trace-events-bootstrap.js
+++ b/test/parallel/test-trace-events-bootstrap.js
@@ -32,7 +32,7 @@ if (process.argv[2] === 'child') {
     const file = tmpdir.resolve('node_trace.1.log');
 
     assert(fs.existsSync(file));
-    fs.readFile(file, common.mustCall((err, data) => {
+    fs.readFile(file, common.mustSucceed((data) => {
       const traces = JSON.parse(data.toString()).traceEvents
         .filter((trace) => trace.cat !== '__metadata');
       traces.forEach((trace) => {
diff --git a/test/parallel/test-url-null-char.js b/test/parallel/test-url-null-char.js
index 468080844d534b..d81cbcfb6648d8 100644
--- a/test/parallel/test-url-null-char.js
+++ b/test/parallel/test-url-null-char.js
@@ -4,5 +4,5 @@ const assert = require('assert');
 
 assert.throws(
   () => { new URL('a\0b'); },
-  { input: 'a\0b' }
+  { code: 'ERR_INVALID_URL', input: 'a\0b' }
 );
diff --git a/test/parallel/test-util-promisify.js b/test/parallel/test-util-promisify.js
index 0fc2d650ee9272..e2318a4973b972 100644
--- a/test/parallel/test-util-promisify.js
+++ b/test/parallel/test-util-promisify.js
@@ -7,6 +7,29 @@ const vm = require('vm');
 const { promisify } = require('util');
 const { customPromisifyArgs } = require('internal/util');
 
+{
+  const warningHandler = common.mustNotCall();
+  process.on('warning', warningHandler);
+  function foo() {}
+  foo.constructor = (async () => {}).constructor;
+  promisify(foo);
+  process.off('warning', warningHandler);
+}
+
+common.expectWarning(
+  'DeprecationWarning',
+  'Calling promisify on a function that returns a Promise is likely a mistake.',
+  'DEP0174');
+promisify(async (callback) => { callback(); })().then(common.mustCall(() => {
+  // We must add the second `expectWarning` call in the `.then` handler, when
+  // the first warning has already been triggered.
+  common.expectWarning(
+    'DeprecationWarning',
+    'Calling promisify on a function that returns a Promise is likely a mistake.',
+    'DEP0174');
+  promisify(async () => {})().then(common.mustNotCall());
+}));
+
 const stat = promisify(fs.stat);
 
 {
diff --git a/test/parallel/test-validators.js b/test/parallel/test-validators.js
index a40139678eee65..848fa0c27bbebe 100644
--- a/test/parallel/test-validators.js
+++ b/test/parallel/test-validators.js
@@ -9,6 +9,9 @@ const {
   validateInteger,
   validateNumber,
   validateObject,
+  kValidateObjectAllowNullable,
+  kValidateObjectAllowArray,
+  kValidateObjectAllowFunction,
   validateString,
   validateInt32,
   validateUint32,
@@ -106,10 +109,6 @@ const invalidArgValueError = {
 
 {
   // validateObject tests.
-  Object.prototype.nullable = true;
-  Object.prototype.allowArray = true;
-  Object.prototype.allowFunction = true;
-
   validateObject({}, 'foo');
   validateObject({ a: 42, b: 'foo' }, 'foo');
 
@@ -121,18 +120,14 @@ const invalidArgValueError = {
     });
 
   // validateObject options tests:
-  validateObject(null, 'foo', { nullable: true });
-  validateObject([], 'foo', { allowArray: true });
-  validateObject(() => {}, 'foo', { allowFunction: true });
+  validateObject(null, 'foo', kValidateObjectAllowNullable);
+  validateObject([], 'foo', kValidateObjectAllowArray);
+  validateObject(() => {}, 'foo', kValidateObjectAllowFunction);
 
   // validateObject should not be affected by Object.prototype tampering.
-  assert.throws(() => validateObject(null, 'foo', { allowArray: true }), invalidArgTypeError);
-  assert.throws(() => validateObject([], 'foo', { nullable: true }), invalidArgTypeError);
-  assert.throws(() => validateObject(() => {}, 'foo', { nullable: true }), invalidArgTypeError);
-
-  delete Object.prototype.nullable;
-  delete Object.prototype.allowArray;
-  delete Object.prototype.allowFunction;
+  assert.throws(() => validateObject(null, 'foo', kValidateObjectAllowArray), invalidArgTypeError);
+  assert.throws(() => validateObject([], 'foo', kValidateObjectAllowNullable), invalidArgTypeError);
+  assert.throws(() => validateObject(() => {}, 'foo', kValidateObjectAllowNullable), invalidArgTypeError);
 }
 
 {
diff --git a/test/parallel/test-vm-dynamic-import-callback-missing-flag.js b/test/parallel/test-vm-dynamic-import-callback-missing-flag.js
new file mode 100644
index 00000000000000..4b0d09ca3674a7
--- /dev/null
+++ b/test/parallel/test-vm-dynamic-import-callback-missing-flag.js
@@ -0,0 +1,28 @@
+'use strict';
+
+const common = require('../common');
+const { Script, compileFunction } = require('vm');
+const assert = require('assert');
+
+assert(
+  !process.execArgv.includes('--experimental-vm-modules'),
+  'This test must be run without --experimental-vm-modules');
+
+assert.rejects(async () => {
+  const script = new Script('import("fs")', {
+    importModuleDynamically: common.mustNotCall(),
+  });
+  const imported = script.runInThisContext();
+  await imported;
+}, {
+  code: 'ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG'
+}).then(common.mustCall());
+
+assert.rejects(async () => {
+  const imported = compileFunction('return import("fs")', [], {
+    importModuleDynamically: common.mustNotCall(),
+  })();
+  await imported;
+}, {
+  code: 'ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING_FLAG'
+}).then(common.mustCall());
diff --git a/test/parallel/test-vm-module-dynamic-import.js b/test/parallel/test-vm-module-dynamic-import.js
index cd318511401412..b74d3b28d7a547 100644
--- a/test/parallel/test-vm-module-dynamic-import.js
+++ b/test/parallel/test-vm-module-dynamic-import.js
@@ -58,11 +58,11 @@ async function test() {
   }
 
   {
-    const s = new Script('import("foo", { assert: { key: "value" } })', {
-      importModuleDynamically: common.mustCall((specifier, wrap, assertion) => {
+    const s = new Script('import("foo", { with: { key: "value" } })', {
+      importModuleDynamically: common.mustCall((specifier, wrap, attributes) => {
         assert.strictEqual(specifier, 'foo');
         assert.strictEqual(wrap, s);
-        assert.deepStrictEqual(assertion, { __proto__: null, key: 'value' });
+        assert.deepStrictEqual(attributes, { __proto__: null, key: 'value' });
         return foo;
       }),
     });
diff --git a/test/parallel/test-vm-no-dynamic-import-callback.js b/test/parallel/test-vm-no-dynamic-import-callback.js
new file mode 100644
index 00000000000000..35b553d587c6e4
--- /dev/null
+++ b/test/parallel/test-vm-no-dynamic-import-callback.js
@@ -0,0 +1,20 @@
+'use strict';
+
+const common = require('../common');
+const { Script, compileFunction } = require('vm');
+const assert = require('assert');
+
+assert.rejects(async () => {
+  const script = new Script('import("fs")');
+  const imported = script.runInThisContext();
+  await imported;
+}, {
+  code: 'ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING'
+}).then(common.mustCall());
+
+assert.rejects(async () => {
+  const imported = compileFunction('return import("fs")')();
+  await imported;
+}, {
+  code: 'ERR_VM_DYNAMIC_IMPORT_CALLBACK_MISSING'
+}).then(common.mustCall());
diff --git a/test/parallel/test-websocket.js b/test/parallel/test-websocket.js
new file mode 100644
index 00000000000000..2a7069ccf3b739
--- /dev/null
+++ b/test/parallel/test-websocket.js
@@ -0,0 +1,7 @@
+// Flags: --experimental-websocket
+'use strict';
+
+require('../common');
+const assert = require('assert');
+
+assert.strictEqual(typeof WebSocket, 'function');
diff --git a/test/parallel/test-whatwg-encoding-custom-internals.js b/test/parallel/test-whatwg-encoding-custom-internals.js
index c810b43b1ae447..505e623a681998 100644
--- a/test/parallel/test-whatwg-encoding-custom-internals.js
+++ b/test/parallel/test-whatwg-encoding-custom-internals.js
@@ -13,10 +13,20 @@ const { getEncodingFromLabel } = require('internal/encoding');
   const mappings = {
     'utf-8': [
       'unicode-1-1-utf-8',
+      'unicode11utf8',
+      'unicode20utf8',
       'utf8',
+      'x-unicode20utf8',
+    ],
+    'utf-16be': [
+      'unicodefffe',
     ],
-    'utf-16be': [],
     'utf-16le': [
+      'csunicode',
+      'iso-10646-ucs-2',
+      'ucs-2',
+      'unicode',
+      'unicodefeff',
       'utf-16',
     ],
     'ibm866': [
@@ -258,7 +268,15 @@ const { getEncodingFromLabel } = require('internal/encoding');
       'ksc5601',
       'ksc_5601',
       'windows-949',
-    ]
+    ],
+    'replacement': [
+      'csiso2022kr',
+      'hz-gb-2312',
+      'iso-2022-cn',
+      'iso-2022-cn-ext',
+      'iso-2022-kr',
+    ],
+    'x-user-defined': []
   };
   Object.entries(mappings).forEach((i) => {
     const enc = i[0];
diff --git a/test/parallel/test-whatwg-encoding-custom-textdecoder-api-invalid-label.js b/test/parallel/test-whatwg-encoding-custom-textdecoder-api-invalid-label.js
index a701d79a285a16..569c17baff4b6e 100644
--- a/test/parallel/test-whatwg-encoding-custom-textdecoder-api-invalid-label.js
+++ b/test/parallel/test-whatwg-encoding-custom-textdecoder-api-invalid-label.js
@@ -8,8 +8,17 @@ const assert = require('assert');
 [
   'utf-8',
   'unicode-1-1-utf-8',
+  'unicode11utf8',
+  'unicode20utf8',
+  'x-unicode20utf8',
   'utf8',
+  'unicodefffe',
   'utf-16be',
+  'csunicode',
+  'iso-10646-ucs-2',
+  'ucs-2',
+  'unicode',
+  'unicodefeff',
   'utf-16le',
   'utf-16',
 ].forEach((i) => {
diff --git a/test/parallel/test-whatwg-encoding-custom-textdecoder.js b/test/parallel/test-whatwg-encoding-custom-textdecoder.js
index e4379aa03f870d..835c4d962d2ada 100644
--- a/test/parallel/test-whatwg-encoding-custom-textdecoder.js
+++ b/test/parallel/test-whatwg-encoding-custom-textdecoder.js
@@ -13,19 +13,21 @@ const util = require('util');
 const buf = Buffer.from([0xef, 0xbb, 0xbf, 0x74, 0x65,
                          0x73, 0x74, 0xe2, 0x82, 0xac]);
 
+const encoding_sets = ['unicode-1-1-utf-8', 'unicode11utf8', 'unicode20utf8',
+                       'utf8', 'utf-8', 'x-unicode20utf8'];
 // Make Sure TextDecoder exist
 assert(TextDecoder);
 
 // Test TextDecoder, UTF-8, fatal: false, ignoreBOM: false
 {
-  ['unicode-1-1-utf-8', 'utf8', 'utf-8'].forEach((i) => {
+  encoding_sets.forEach((i) => {
     const dec = new TextDecoder(i);
     assert.strictEqual(dec.encoding, 'utf-8');
     const res = dec.decode(buf);
     assert.strictEqual(res, 'test€');
   });
 
-  ['unicode-1-1-utf-8', 'utf8', 'utf-8'].forEach((i) => {
+  encoding_sets.forEach((i) => {
     const dec = new TextDecoder(i);
     let res = '';
     res += dec.decode(buf.slice(0, 8), { stream: true });
@@ -36,13 +38,13 @@ assert(TextDecoder);
 
 // Test TextDecoder, UTF-8, fatal: false, ignoreBOM: true
 {
-  ['unicode-1-1-utf-8', 'utf8', 'utf-8'].forEach((i) => {
+  encoding_sets.forEach((i) => {
     const dec = new TextDecoder(i, { ignoreBOM: true });
     const res = dec.decode(buf);
     assert.strictEqual(res, '\ufefftest€');
   });
 
-  ['unicode-1-1-utf-8', 'utf8', 'utf-8'].forEach((i) => {
+  encoding_sets.forEach((i) => {
     const dec = new TextDecoder(i, { ignoreBOM: true });
     let res = '';
     res += dec.decode(buf.slice(0, 8), { stream: true });
diff --git a/test/parallel/test-whatwg-url-custom-parsing.js b/test/parallel/test-whatwg-url-custom-parsing.js
index 905028fee3812c..cdeda59eec0c98 100644
--- a/test/parallel/test-whatwg-url-custom-parsing.js
+++ b/test/parallel/test-whatwg-url-custom-parsing.js
@@ -55,7 +55,7 @@ for (const test of failureTests) {
     () => new URL(test.input, test.base),
     (error) => {
       assert.throws(() => { throw error; }, expectedError);
-      assert.strictEqual(`${error}`, 'TypeError [ERR_INVALID_URL]: Invalid URL');
+      assert.strictEqual(`${error}`, 'TypeError: Invalid URL');
       assert.strictEqual(error.message, 'Invalid URL');
       return true;
     });
diff --git a/test/parallel/test-whatwg-webstreams-transfer.js b/test/parallel/test-whatwg-webstreams-transfer.js
index f8783259422890..31e45858da52eb 100644
--- a/test/parallel/test-whatwg-webstreams-transfer.js
+++ b/test/parallel/test-whatwg-webstreams-transfer.js
@@ -105,7 +105,9 @@ const theData = 'hello';
   });
 
   assert.throws(() => port2.postMessage(readable), {
-    code: 'ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST',
+    constructor: DOMException,
+    name: 'DataCloneError',
+    code: 25,
   });
 
   port2.postMessage(readable, [readable]);
@@ -155,7 +157,9 @@ const theData = 'hello';
   });
 
   assert.throws(() => port2.postMessage(readable), {
-    code: 'ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST',
+    constructor: DOMException,
+    name: 'DataCloneError',
+    code: 25,
   });
 
   port2.postMessage(readable, [readable]);
@@ -206,7 +210,9 @@ const theData = 'hello';
   });
 
   assert.throws(() => port2.postMessage(writable), {
-    code: 'ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST',
+    constructor: DOMException,
+    name: 'DataCloneError',
+    code: 25,
   });
 
   port2.postMessage(writable, [writable]);
@@ -292,7 +298,9 @@ const theData = 'hello';
   });
 
   assert.throws(() => port2.postMessage(transform), {
-    code: 'ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST',
+    constructor: DOMException,
+    name: 'DataCloneError',
+    code: 25,
   });
 
   port2.postMessage(transform, [transform]);
diff --git a/test/parallel/test-worker-message-port-transfer-filehandle.js b/test/parallel/test-worker-message-port-transfer-filehandle.js
index 9fabf01b604fc4..8e3082240cd2c7 100644
--- a/test/parallel/test-worker-message-port-transfer-filehandle.js
+++ b/test/parallel/test-worker-message-port-transfer-filehandle.js
@@ -14,7 +14,9 @@ const { once } = require('events');
   assert.throws(() => {
     port1.postMessage(fh);
   }, {
-    code: 'ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST'
+    constructor: DOMException,
+    name: 'DataCloneError',
+    code: 25,
   });
 
   // Check that transferring FileHandle instances works.
diff --git a/test/parallel/test-worker-no-atomics.js b/test/parallel/test-worker-no-atomics.js
deleted file mode 100644
index 3dd5a47c127d7c..00000000000000
--- a/test/parallel/test-worker-no-atomics.js
+++ /dev/null
@@ -1,21 +0,0 @@
-// Flags: --no-harmony-atomics
-
-'use strict';
-
-const common = require('../common');
-const assert = require('assert');
-const { Worker } = require('worker_threads');
-
-// Regression test for https://github.com/nodejs/node/issues/39717.
-
-// Do not use isMainThread so that this test itself can be run inside a Worker.
-if (!process.env.HAS_STARTED_WORKER) {
-  process.env.HAS_STARTED_WORKER = 1;
-  const w = new Worker(__filename);
-
-  w.on('exit', common.mustCall((status) => {
-    assert.strictEqual(status, 2);
-  }));
-} else {
-  process.exit(2);
-}
diff --git a/test/parallel/test-worker-no-sab.js b/test/parallel/test-worker-no-sab.js
index 3721795671a140..e96c987484a7d6 100644
--- a/test/parallel/test-worker-no-sab.js
+++ b/test/parallel/test-worker-no-sab.js
@@ -1,4 +1,4 @@
-// Flags: --no-harmony-sharedarraybuffer
+// Flags: --enable-sharedarraybuffer-per-context
 
 'use strict';
 
diff --git a/test/parallel/test-worker-process-cwd.js b/test/parallel/test-worker-process-cwd.js
index e24515cce777a3..1a581a37025078 100644
--- a/test/parallel/test-worker-process-cwd.js
+++ b/test/parallel/test-worker-process-cwd.js
@@ -16,7 +16,7 @@ if (!process.env.HAS_STARTED_WORKER) {
   // Normalize the current working dir to also work with the root folder.
   process.chdir(__dirname);
 
-  assert(!process.cwd.toString().includes('Atomics.load'));
+  assert.doesNotMatch(process.cwd.toString(), /AtomicsLoad/);
 
   // 1. Start the first worker.
   const w = new Worker(__filename);
@@ -32,7 +32,7 @@ if (!process.env.HAS_STARTED_WORKER) {
   // 2. Save the current cwd and verify that `process.cwd` includes the
   //    Atomics.load call and spawn a new worker.
   const cwd = process.cwd();
-  assert(process.cwd.toString().includes('Atomics.load'));
+  assert.match(process.cwd.toString(), /AtomicsLoad/);
 
   const w = new Worker(__filename);
   w.once('message', common.mustCall((message) => {
@@ -56,7 +56,7 @@ if (!process.env.HAS_STARTED_WORKER) {
   const cwd = process.cwd();
   // Send the current cwd to the parent.
   parentPort.postMessage(cwd);
-  assert(process.cwd.toString().includes('Atomics.load'));
+  assert.match(process.cwd.toString(), /AtomicsLoad/);
 
   parentPort.once('message', common.mustCall((message) => {
     // 7. Verify that the current cwd is identical to the received one but
diff --git a/test/parallel/test-worker-workerdata-messageport.js b/test/parallel/test-worker-workerdata-messageport.js
index 18f05731e8f635..3e4770d9a12c34 100644
--- a/test/parallel/test-worker-workerdata-messageport.js
+++ b/test/parallel/test-worker-workerdata-messageport.js
@@ -54,7 +54,9 @@ const meowScript = () => 'meow';
     workerData,
     transferList: []
   }), {
-    code: 'ERR_MISSING_TRANSFERABLE_IN_TRANSFER_LIST',
+    constructor: DOMException,
+    name: 'DataCloneError',
+    code: 25,
     message: 'Object that needs transfer was found in message but not ' +
              'listed in transferList'
   });
diff --git a/test/pummel/test-heapdump-shadow-realm.js b/test/pummel/test-heapdump-shadow-realm.js
index 7ec40118c5b9ca..1482fe6b6fcb8b 100644
--- a/test/pummel/test-heapdump-shadow-realm.js
+++ b/test/pummel/test-heapdump-shadow-realm.js
@@ -11,7 +11,7 @@ let counter = 0;
 // snapshot can handle it.
 function createRealms() {
   // Use setImmediate to give GC some time to kick in to avoid OOM.
-  if (counter++ < 100) {
+  if (counter++ < 10) {
     realm = new ShadowRealm();
     realm.evaluate('undefined');
     setImmediate(createRealms);
diff --git a/test/pummel/test-structuredclone-jstransferable.js b/test/pummel/test-structuredclone-jstransferable.js
new file mode 100644
index 00000000000000..e537b8c3458708
--- /dev/null
+++ b/test/pummel/test-structuredclone-jstransferable.js
@@ -0,0 +1,8 @@
+// Flags: --max-old-space-size=10
+'use strict';
+require('../common');
+const { createHistogram } = require('perf_hooks');
+
+for (let i = 0; i < 1e4; i++) {
+  structuredClone(createHistogram());
+}
diff --git a/test/sequential/sequential.status b/test/sequential/sequential.status
index 0688f5b05e789c..5cefcb95773bed 100644
--- a/test/sequential/sequential.status
+++ b/test/sequential/sequential.status
@@ -15,10 +15,6 @@ test-watch-mode-inspect: PASS, FLAKY
 # https://github.com/nodejs/node/issues/47116
 test-http-max-sockets: PASS, FLAKY
 
-[$system==win32 || $system==freebsd]
-# https://github.com/nodejs/node/issues/49564
-test-http-regr-gh-2928: PASS, FLAKY
-
 [$system==linux]
 
 [$system==macos]
diff --git a/test/sequential/test-async-wrap-getasyncid.js b/test/sequential/test-async-wrap-getasyncid.js
index ac4c66872e5b8d..7fc7c820d06cc9 100644
--- a/test/sequential/test-async-wrap-getasyncid.js
+++ b/test/sequential/test-async-wrap-getasyncid.js
@@ -165,7 +165,7 @@ if (common.hasCrypto) { // eslint-disable-line node-core/crypto-check
   req.oncomplete = () => { };
 
   testInitialized(req, 'FSReqCallback');
-  binding.access(path.toNamespacedPath('../'), fs.F_OK, req);
+  binding.access(path.toNamespacedPath('../'), fs.constants.F_OK, req);
 
   const StatWatcher = binding.StatWatcher;
   testInitialized(new StatWatcher(), 'StatWatcher');
diff --git a/test/sequential/test-http-regr-gh-2928.js b/test/sequential/test-http-regr-gh-2928.js
index 149aaeb6e6e420..25476e0453c53b 100644
--- a/test/sequential/test-http-regr-gh-2928.js
+++ b/test/sequential/test-http-regr-gh-2928.js
@@ -25,7 +25,7 @@ function execAndClose() {
   const parser = parsers.pop();
   parser.initialize(HTTPParser.RESPONSE, {});
 
-  const socket = net.connect(common.PORT);
+  const socket = net.connect(common.PORT, common.localhostIPv4);
   socket.on('error', (e) => {
     // If SmartOS and ECONNREFUSED, then retry. See
     // https://github.com/nodejs/node/issues/2663.
@@ -57,7 +57,7 @@ const server = net.createServer(function(c) {
   c.end('HTTP/1.1 200 OK\r\n\r\n', function() {
     c.destroySoon();
   });
-}).listen(common.PORT, execAndClose);
+}).listen(common.PORT, common.localhostIPv4, execAndClose);
 
 process.on('exit', function() {
   assert.strictEqual(gotResponses, COUNT);
diff --git a/test/sequential/test-perf-hooks.js b/test/sequential/test-perf-hooks.js
index 5ed9ff22ce2d38..1e11f26571480d 100644
--- a/test/sequential/test-perf-hooks.js
+++ b/test/sequential/test-perf-hooks.js
@@ -41,8 +41,40 @@ const epsilon = 50;
 assert.strictEqual(performance.nodeTiming.name, 'node');
 assert.strictEqual(performance.nodeTiming.entryType, 'node');
 
+// If timing.duration gets copied into the argument instead of being computed
+// via the getter, this should be called right after timing is created.
+function checkNodeTiming(timing) {
+  // Calculate the difference between now() and duration as soon as possible.
+  const now = performance.now();
+  const delta = Math.abs(now - timing.duration);
+
+  log(JSON.stringify(timing, null, 2));
+  // Check that the properties are still reasonable.
+  assert.strictEqual(timing.name, 'node');
+  assert.strictEqual(timing.entryType, 'node');
+
+  // Check that duration is positive and practically the same as
+  // performance.now() i.e. measures Node.js instance up time.
+  assert.strictEqual(typeof timing.duration, 'number');
+  assert(timing.duration > 0, `timing.duration ${timing.duration} <= 0`);
+  assert(delta < 10,
+         `now (${now}) - timing.duration (${timing.duration}) = ${delta} >= ${10}`);
+
+  // Check that the following fields do not change.
+  assert.strictEqual(timing.startTime, initialTiming.startTime);
+  assert.strictEqual(timing.nodeStart, initialTiming.nodeStart);
+  assert.strictEqual(timing.v8Start, initialTiming.v8Start);
+  assert.strictEqual(timing.environment, initialTiming.environment);
+  assert.strictEqual(timing.bootstrapComplete, initialTiming.bootstrapComplete);
+
+  assert.strictEqual(typeof timing.loopStart, 'number');
+  assert.strictEqual(typeof timing.loopExit, 'number');
+}
+
+log('check initial nodeTiming');
 // Copy all the values from the getters.
 const initialTiming = { ...performance.nodeTiming };
+checkNodeTiming(initialTiming);
 
 {
   const {
@@ -87,36 +119,6 @@ const initialTiming = { ...performance.nodeTiming };
          `bootstrapComplete ${bootstrapComplete} >= ${testStartTime}`);
 }
 
-function checkNodeTiming(timing) {
-  // Calculate the difference between now() and duration as soon as possible.
-  const now = performance.now();
-  const delta = Math.abs(now - timing.duration);
-
-  log(JSON.stringify(timing, null, 2));
-  // Check that the properties are still reasonable.
-  assert.strictEqual(timing.name, 'node');
-  assert.strictEqual(timing.entryType, 'node');
-
-  // Check that duration is positive and practically the same as
-  // performance.now() i.e. measures Node.js instance up time.
-  assert.strictEqual(typeof timing.duration, 'number');
-  assert(timing.duration > 0, `timing.duration ${timing.duration} <= 0`);
-  assert(delta < 10,
-         `now (${now}) - timing.duration (${timing.duration}) = ${delta} >= 10`);
-
-  // Check that the following fields do not change.
-  assert.strictEqual(timing.startTime, initialTiming.startTime);
-  assert.strictEqual(timing.nodeStart, initialTiming.nodeStart);
-  assert.strictEqual(timing.v8Start, initialTiming.v8Start);
-  assert.strictEqual(timing.environment, initialTiming.environment);
-  assert.strictEqual(timing.bootstrapComplete, initialTiming.bootstrapComplete);
-
-  assert.strictEqual(typeof timing.loopStart, 'number');
-  assert.strictEqual(typeof timing.loopExit, 'number');
-}
-
-log('check initial nodeTiming');
-checkNodeTiming(initialTiming);
 assert.strictEqual(initialTiming.loopExit, -1);
 
 function checkValue(timing, name, min, max) {
diff --git a/test/v8-updates/v8-updates.status b/test/v8-updates/v8-updates.status
index 46149f4751ffb5..07ff708ab023dc 100644
--- a/test/v8-updates/v8-updates.status
+++ b/test/v8-updates/v8-updates.status
@@ -5,6 +5,8 @@ prefix v8-updates
 # sample-test                        : PASS,FLAKY
 
 [true] # This section applies to all platforms
+# https://github.com/nodejs/node/issues/50079
+test-linux-perf: SKIP
 
 [$system==win32]
 
diff --git a/test/wasi/README.md b/test/wasi/README.md
index b99b4fa76d3993..6aab9dd0581514 100644
--- a/test/wasi/README.md
+++ b/test/wasi/README.md
@@ -1,9 +1,16 @@
 # WASI Tests
 
-Compile with clang and `wasm32-wasi` target. The clang version used must be
-built with wasi-libc. You can specify the location for clang and the sysroot
-if needed when running make:
+Compile with clang and `wasm32-wasi` target by using the wasi-sdk
+[version 20](https://github.com/WebAssembly/wasi-sdk/releases/tag/wasi-sdk-20)
+
+Install wasi-sdk and then set WASI\_SDK\_PATH to the root of the install.
+
+You can then rebuild the wasm for the tests by running:
 
 ```bash
-make CC=/usr/local/opt/llvm/bin/clang SYSROOT=/path/to/wasi-libc/sysroot
+make CC=${WASI_SDK_PATH}/bin/clang SYSROOT=${WASI_SDK_PATH}/share/wasi-sysroot
 ```
+
+If you update the version of the wasi-sdk to be used for the compile
+remove all of the \*.wasm files in the wasm directory to ensure
+you rebuild/test all of the tests with the new version.
diff --git a/test/wasi/c/clock_getres.c b/test/wasi/c/clock_getres.c
index eaac02c665b9f2..2d72c5305f33af 100644
--- a/test/wasi/c/clock_getres.c
+++ b/test/wasi/c/clock_getres.c
@@ -10,8 +10,11 @@ int main() {
   assert(r == 0);
   r = clock_getres(CLOCK_MONOTONIC, &ts);
   assert(r == 0);
-  r = clock_getres(CLOCK_PROCESS_CPUTIME_ID, &ts);
-  assert(r == 0);
-  r = clock_getres(CLOCK_THREAD_CPUTIME_ID, &ts);
-  assert(r == 0);
+  // don't run these tests until
+  // https://github.com/WebAssembly/wasi-libc/issues/266
+  // is resolved
+  // r = clock_getres(CLOCK_PROCESS_CPUTIME_ID, &ts);
+  // assert(r == 0);
+  // r = clock_getres(CLOCK_THREAD_CPUTIME_ID, &ts);
+  // assert(r == 0);
 }
diff --git a/test/wasi/c/poll.c b/test/wasi/c/poll.c
index 9afb6325a98a03..bd2ff62613ea23 100644
--- a/test/wasi/c/poll.c
+++ b/test/wasi/c/poll.c
@@ -10,11 +10,11 @@ int main(void) {
   time_t before, now;
   int ret;
   char* platform;
-  int is_aix;
+  int is_aix_or_os400;
   int is_win;
 
   platform = getenv("NODE_PLATFORM");
-  is_aix = platform != NULL && 0 == strcmp(platform, "aix");
+  is_aix_or_os400 = platform != NULL && (0 == strcmp(platform, "aix") || 0 == strcmp(platform, "os400"));
   is_win = platform != NULL && 0 == strcmp(platform, "win32");
 
   // Test sleep() behavior.
@@ -64,7 +64,7 @@ int main(void) {
   ret = poll(fds, 1, 2000);
   assert(ret == 1);
 
-  if (is_aix)
+  if (is_aix_or_os400)
     assert(fds[0].revents == POLLIN);
   else
     assert(fds[0].revents == (POLLHUP | POLLIN));
diff --git a/test/wasi/c/readdir.c b/test/wasi/c/readdir.c
index a18ae5de34eb8f..192a00474aab6a 100644
--- a/test/wasi/c/readdir.c
+++ b/test/wasi/c/readdir.c
@@ -14,7 +14,6 @@ int main() {
 
   platform = getenv("NODE_PLATFORM");
   assert(platform != NULL);
-  has_d_type = (0 != strcmp(platform, "aix") && 0 != strcmp(platform, "sunos"));
 
   dir = opendir("/sandbox");
   assert(dir != NULL);
@@ -25,17 +24,9 @@ int main() {
     if (strcmp(entry->d_name, "input.txt") == 0 ||
         strcmp(entry->d_name, "input2.txt") == 0 ||
         strcmp(entry->d_name, "notadir") == 0) {
-      if (has_d_type) {
         assert(entry->d_type == DT_REG);
-      } else {
-        assert(entry->d_type == DT_UNKNOWN);
-      }
     } else if (strcmp(entry->d_name, "subdir") == 0) {
-      if (has_d_type) {
         assert(entry->d_type == DT_DIR);
-      } else {
-        assert(entry->d_type == DT_UNKNOWN);
-      }
     } else {
       assert("unexpected file");
     }
diff --git a/test/wasi/c/sock.c b/test/wasi/c/sock.c
index de4a3ccc5f95a6..d11e86c805784d 100644
--- a/test/wasi/c/sock.c
+++ b/test/wasi/c/sock.c
@@ -9,9 +9,9 @@ int main(void) {
   int fd = 0 ;
   socklen_t addrlen = 0;
   int flags = 0;
-  int ret = accept(0, NULL, &addrlen);
+  int ret = accept(10, NULL, &addrlen);
   assert(ret == -1);
-  assert(errno == ENOTSUP);
+  assert(errno == EBADF);
 
   return 0;
 }
diff --git a/test/wasi/wasm/cant_dotdot.wasm b/test/wasi/wasm/cant_dotdot.wasm
index b078dfca1afbc9..75e36467a2252d 100755
Binary files a/test/wasi/wasm/cant_dotdot.wasm and b/test/wasi/wasm/cant_dotdot.wasm differ
diff --git a/test/wasi/wasm/clock_getres.wasm b/test/wasi/wasm/clock_getres.wasm
index 9d47599c7b9478..67e0a46564e667 100755
Binary files a/test/wasi/wasm/clock_getres.wasm and b/test/wasi/wasm/clock_getres.wasm differ
diff --git a/test/wasi/wasm/create_symlink.wasm b/test/wasi/wasm/create_symlink.wasm
index 291f17eedcfa76..89a24c50ca3146 100755
Binary files a/test/wasi/wasm/create_symlink.wasm and b/test/wasi/wasm/create_symlink.wasm differ
diff --git a/test/wasi/wasm/exitcode.wasm b/test/wasi/wasm/exitcode.wasm
index 0472e62d851095..853e0e26fa5f71 100755
Binary files a/test/wasi/wasm/exitcode.wasm and b/test/wasi/wasm/exitcode.wasm differ
diff --git a/test/wasi/wasm/fd_prestat_get_refresh.wasm b/test/wasi/wasm/fd_prestat_get_refresh.wasm
index d645b42c806791..251fb9166682b4 100755
Binary files a/test/wasi/wasm/fd_prestat_get_refresh.wasm and b/test/wasi/wasm/fd_prestat_get_refresh.wasm differ
diff --git a/test/wasi/wasm/follow_symlink.wasm b/test/wasi/wasm/follow_symlink.wasm
index b79242eb13141a..b8d0d0eb125d58 100755
Binary files a/test/wasi/wasm/follow_symlink.wasm and b/test/wasi/wasm/follow_symlink.wasm differ
diff --git a/test/wasi/wasm/freopen.wasm b/test/wasi/wasm/freopen.wasm
index 5f774d782332f2..18aef3a8d5b1e7 100755
Binary files a/test/wasi/wasm/freopen.wasm and b/test/wasi/wasm/freopen.wasm differ
diff --git a/test/wasi/wasm/ftruncate.wasm b/test/wasi/wasm/ftruncate.wasm
index 60542eeb6a0ff6..ff0591ad8e3912 100755
Binary files a/test/wasi/wasm/ftruncate.wasm and b/test/wasi/wasm/ftruncate.wasm differ
diff --git a/test/wasi/wasm/getentropy.wasm b/test/wasi/wasm/getentropy.wasm
index f9e4cb52869892..3f40499255b74f 100755
Binary files a/test/wasi/wasm/getentropy.wasm and b/test/wasi/wasm/getentropy.wasm differ
diff --git a/test/wasi/wasm/getrusage.wasm b/test/wasi/wasm/getrusage.wasm
index ff131ee42a09b6..fb0197fde2c997 100755
Binary files a/test/wasi/wasm/getrusage.wasm and b/test/wasi/wasm/getrusage.wasm differ
diff --git a/test/wasi/wasm/gettimeofday.wasm b/test/wasi/wasm/gettimeofday.wasm
index 408a5cfc9ef209..8bb6733251f2b8 100755
Binary files a/test/wasi/wasm/gettimeofday.wasm and b/test/wasi/wasm/gettimeofday.wasm differ
diff --git a/test/wasi/wasm/link.wasm b/test/wasi/wasm/link.wasm
index 4a9719df3035d5..fbc79e1d88368e 100755
Binary files a/test/wasi/wasm/link.wasm and b/test/wasi/wasm/link.wasm differ
diff --git a/test/wasi/wasm/main_args.wasm b/test/wasi/wasm/main_args.wasm
index 1e14b8351b71e6..3245c8410532f2 100755
Binary files a/test/wasi/wasm/main_args.wasm and b/test/wasi/wasm/main_args.wasm differ
diff --git a/test/wasi/wasm/notdir.wasm b/test/wasi/wasm/notdir.wasm
index ae22933603d049..4d63ef3cd8f6f5 100755
Binary files a/test/wasi/wasm/notdir.wasm and b/test/wasi/wasm/notdir.wasm differ
diff --git a/test/wasi/wasm/poll.wasm b/test/wasi/wasm/poll.wasm
index 22c0fe859d7ad3..07e09ddd39abc6 100755
Binary files a/test/wasi/wasm/poll.wasm and b/test/wasi/wasm/poll.wasm differ
diff --git a/test/wasi/wasm/preopen_populates.wasm b/test/wasi/wasm/preopen_populates.wasm
index 1236bbe1cc6e6e..21b23a241c5f28 100755
Binary files a/test/wasi/wasm/preopen_populates.wasm and b/test/wasi/wasm/preopen_populates.wasm differ
diff --git a/test/wasi/wasm/read_file.wasm b/test/wasi/wasm/read_file.wasm
index bc1433e09e961e..1027a76adc3d21 100755
Binary files a/test/wasi/wasm/read_file.wasm and b/test/wasi/wasm/read_file.wasm differ
diff --git a/test/wasi/wasm/read_file_twice.wasm b/test/wasi/wasm/read_file_twice.wasm
index 6b73ae11309fde..469b5c815b666a 100755
Binary files a/test/wasi/wasm/read_file_twice.wasm and b/test/wasi/wasm/read_file_twice.wasm differ
diff --git a/test/wasi/wasm/readdir.wasm b/test/wasi/wasm/readdir.wasm
index c315d2d5b8e87e..40626f7240b268 100755
Binary files a/test/wasi/wasm/readdir.wasm and b/test/wasi/wasm/readdir.wasm differ
diff --git a/test/wasi/wasm/sock.wasm b/test/wasi/wasm/sock.wasm
index 78e7b8e430f911..905bf605a703f4 100755
Binary files a/test/wasi/wasm/sock.wasm and b/test/wasi/wasm/sock.wasm differ
diff --git a/test/wasi/wasm/stat.wasm b/test/wasi/wasm/stat.wasm
index 6f924b74d9b22c..4a9c94095d74a7 100755
Binary files a/test/wasi/wasm/stat.wasm and b/test/wasi/wasm/stat.wasm differ
diff --git a/test/wasi/wasm/stdin.wasm b/test/wasi/wasm/stdin.wasm
index f9ea0fd336d50e..1560949d8cb78f 100755
Binary files a/test/wasi/wasm/stdin.wasm and b/test/wasi/wasm/stdin.wasm differ
diff --git a/test/wasi/wasm/symlink_escape.wasm b/test/wasi/wasm/symlink_escape.wasm
index 4ff589da7d438c..21c459b78b82d4 100755
Binary files a/test/wasi/wasm/symlink_escape.wasm and b/test/wasi/wasm/symlink_escape.wasm differ
diff --git a/test/wasi/wasm/symlink_loop.wasm b/test/wasi/wasm/symlink_loop.wasm
index 409102d7ee21a0..4f8f1643101ca9 100755
Binary files a/test/wasi/wasm/symlink_loop.wasm and b/test/wasi/wasm/symlink_loop.wasm differ
diff --git a/test/wasi/wasm/write_file.wasm b/test/wasi/wasm/write_file.wasm
index 005c3da09de043..8a87d526db0113 100755
Binary files a/test/wasi/wasm/write_file.wasm and b/test/wasi/wasm/write_file.wasm differ
diff --git a/test/wpt/status/FileAPI/blob.json b/test/wpt/status/FileAPI/blob.json
index 017d931d7abdc4..8ea03bbc019992 100644
--- a/test/wpt/status/FileAPI/blob.json
+++ b/test/wpt/status/FileAPI/blob.json
@@ -44,12 +44,5 @@
   },
   "Blob-slice.any.js": {
     "skip": "Depends on File API"
-  },
-  "Blob-stream.any.js": {
-    "fail": {
-      "expected": [
-        "Reading Blob.stream() with BYOB reader"
-      ]
-    }
   }
 }
diff --git a/tools/bootstrap/windows_boxstarter b/tools/bootstrap/windows_boxstarter
index eb0b2d72e98381..00ac4a0b711004 100644
--- a/tools/bootstrap/windows_boxstarter
+++ b/tools/bootstrap/windows_boxstarter
@@ -14,11 +14,11 @@
 
 # Git and Unix tools will be added to the PATH
 choco install git -params /GitAndUnixToolsOnPath -y
-choco install python python2 -y
+choco install python3 -y
 
-# Installs VS 2019 Build Tools
-choco install visualstudio2019buildtools -y
-choco install visualstudio2019-workload-vctools -y --params="--add Microsoft.VisualStudio.Component.VC.Tools.ARM64 --add Microsoft.VisualStudio.Component.VC.ATL.ARM64"
+# Installs VS 2022 Build Tools
+choco install visualstudio2022buildtools -y
+choco install visualstudio2022-workload-vctools -y --params="--add Microsoft.VisualStudio.Component.VC.Tools.ARM64 --add Microsoft.VisualStudio.Component.VC.ATL.ARM64"
 
 # NASM
 choco install nasm -y
diff --git a/tools/checkimports.py b/tools/checkimports.py
index b94919e3cc47e4..ed003d8b6b98cd 100755
--- a/tools/checkimports.py
+++ b/tools/checkimports.py
@@ -8,9 +8,9 @@
 import itertools
 
 def do_exist(file_name, lines, imported):
-  if not any(not re.match('using \w+::{0};'.format(imported), line) and
-             re.search('\\b{0}\\b'.format(imported), line) for line in lines):
-    print('File "{0}" does not use "{1}"'.format(file_name, imported))
+  if not any(not re.match(fr'using \w+::{imported};', line) and
+             re.search(fr'\b{imported}\b', line) for line in lines):
+    print(f'File "{file_name}" does not use "{imported}"')
     return False
   return True
 
@@ -27,18 +27,16 @@ def is_valid(file_name):
       usings.append(matches.group(1))
       importeds.append(matches.group(2))
 
-  valid = all([do_exist(file_name, lines, imported) for imported in importeds])
+  valid = all(do_exist(file_name, lines, imported) for imported in importeds)
 
   sorted_usings = sorted(usings, key=lambda x: x.lower())
   if sorted_usings != usings:
-    print("using statements aren't sorted in '{0}'.".format(file_name))
+    print(f"using statements aren't sorted in '{file_name}'.")
     for num, actual, expected in zip(line_numbers, usings, sorted_usings):
       if actual != expected:
-        print('\tLine {0}: Actual: {1}, Expected: {2}'
-            .format(num, actual, expected))
+        print(f'\tLine {num}: Actual: {actual}, Expected: {expected}')
     return False
-  else:
-    return valid
+  return valid
 
 if __name__ == '__main__':
   if len(sys.argv) > 1:
diff --git a/tools/dep_updaters/update-acorn.sh b/tools/dep_updaters/update-acorn.sh
index 41d8fd2b08f6d1..53d85156653d9c 100755
--- a/tools/dep_updaters/update-acorn.sh
+++ b/tools/dep_updaters/update-acorn.sh
@@ -38,7 +38,7 @@ rm -rf deps/acorn/acorn
 # update version information in src/acorn_version.h
 cat > "$ROOT/src/acorn_version.h" <<EOF
 // This is an auto generated file, please do not edit.
-// Refer to tools/update-acorn.sh
+// Refer to tools/dep_updaters/update-acorn.sh
 #ifndef SRC_ACORN_VERSION_H_
 #define SRC_ACORN_VERSION_H_
 #define ACORN_VERSION "$NEW_VERSION"
diff --git a/tools/dep_updaters/update-eslint.sh b/tools/dep_updaters/update-eslint.sh
index a6344c6ade9727..60292fb505d293 100755
--- a/tools/dep_updaters/update-eslint.sh
+++ b/tools/dep_updaters/update-eslint.sh
@@ -47,7 +47,7 @@ rm -rf ../node_modules/eslint
         eslint-plugin-markdown \
         @babel/core \
         @babel/eslint-parser \
-        @babel/plugin-syntax-import-assertions
+        @babel/plugin-syntax-import-attributes
     )
     (
         cd node_modules/eslint
@@ -62,7 +62,7 @@ rm -rf ../node_modules/eslint
         eslint-plugin-markdown \
         @babel/core \
         @babel/eslint-parser \
-        @babel/plugin-syntax-import-assertions
+        @babel/plugin-syntax-import-attributes
     )
     # Use dmn to remove some unneeded files.
     "$NODE" "$NPM" exec --package=dmn@2.2.2 --yes -- dmn -f clean
diff --git a/tools/dep_updaters/update-undici.sh b/tools/dep_updaters/update-undici.sh
index a869daf025df24..e50a3b909b8adf 100755
--- a/tools/dep_updaters/update-undici.sh
+++ b/tools/dep_updaters/update-undici.sh
@@ -34,13 +34,16 @@ rm -f deps/undici/undici.js
 
     "$NODE" "$NPM" install --global-style --no-bin-links --ignore-scripts "undici@$NEW_VERSION"
     cd node_modules/undici
+    "$NODE" "$NPM" install --no-bin-link --ignore-scripts
     "$NODE" "$NPM" run build:node
+    "$NODE" "$NPM" prune --production
+    rm node_modules/.package-lock.json
 )
 
 # update version information in src/undici_version.h
 cat > "$ROOT/src/undici_version.h" <<EOF
 // This is an auto generated file, please do not edit.
-// Refer to tools/update-undici.sh
+// Refer to tools/dep_updaters/update-undici.sh
 #ifndef SRC_UNDICI_VERSION_H_
 #define SRC_UNDICI_VERSION_H_
 #define UNDICI_VERSION "$NEW_VERSION"
diff --git a/tools/dep_updaters/update-uvwasi.sh b/tools/dep_updaters/update-uvwasi.sh
index 04aa2c6469157f..c36a7377bf44bc 100755
--- a/tools/dep_updaters/update-uvwasi.sh
+++ b/tools/dep_updaters/update-uvwasi.sh
@@ -75,4 +75,4 @@ echo ""
 # Update the version number on maintaining-dependencies.md
 # and print the new version as the last line of the script as we need
 # to add it to $GITHUB_ENV variable
-finalize_version_update "acorn" "$NEW_VERSION"
+finalize_version_update "uvwasi" "$NEW_VERSION"
diff --git a/tools/doc/allhtml.mjs b/tools/doc/allhtml.mjs
index cdf7140f728469..ccf3a10ea7f95b 100644
--- a/tools/doc/allhtml.mjs
+++ b/tools/doc/allhtml.mjs
@@ -27,7 +27,7 @@ for (const link of toc.match(/<a.*?>/g)) {
   const data = fs.readFileSync(new URL(`./${href}`, source), 'utf8');
 
   // Split the doc.
-  const match = /(<\/ul>\s*)?<\/\w+>\s*<\w+ id="apicontent">/.exec(data);
+  const match = /(<\/ul>\s*)?<\/\w+>\s*<\w+ role="main" id="apicontent">/.exec(data);
 
   // Get module name
   const moduleName = href.replace(/\.html$/, '');
@@ -89,7 +89,7 @@ all = all.slice(0, tocStart.index + tocStart[0].length) +
   all.slice(tocStart.index + tocStart[0].length);
 
 // Replace apicontent with the concatenated set of apicontents from each source.
-const apiStart = /<\w+ id="apicontent">\s*/.exec(all);
+const apiStart = /<\w+ role="main" id="apicontent">\s*/.exec(all);
 const apiEnd = all.lastIndexOf('<!-- API END -->');
 all = all.slice(0, apiStart.index + apiStart[0].length)
     .replace(
diff --git a/tools/doc/html.mjs b/tools/doc/html.mjs
index 168f68c1b03f21..95782efe03d554 100644
--- a/tools/doc/html.mjs
+++ b/tools/doc/html.mjs
@@ -467,7 +467,7 @@ export function buildToc({ filename, apilinks }) {
         .use(htmlStringify)
         .processSync(toc).toString();
 
-      file.toc = `<details id="toc" open><summary>Table of contents</summary>${inner}</details>`;
+      file.toc = `<details role="navigation" id="toc" open><summary>Table of contents</summary>${inner}</details>`;
       file.tocPicker = `<div class="toc">${inner}</div>`;
     } else {
       file.toc = file.tocPicker = '<!-- TOC -->';
diff --git a/tools/genv8constants.py b/tools/genv8constants.py
deleted file mode 100755
index 01aa37cc715de0..00000000000000
--- a/tools/genv8constants.py
+++ /dev/null
@@ -1,118 +0,0 @@
-#!/usr/bin/env python
-
-#
-# genv8constants.py output_file libv8_base.a
-#
-# Emits v8dbg constants stored in libv8_base.a in a format suitable for the V8
-# ustack helper.
-#
-
-from __future__ import print_function
-import re
-import subprocess
-import sys
-import errno
-
-if len(sys.argv) != 3:
-  print("Usage: genv8constants.py outfile libv8_base.a")
-  sys.exit(2)
-
-outfile = open(sys.argv[1], 'w')
-try:
-  pipe = subprocess.Popen([ 'objdump', '-z', '-D', sys.argv[2] ],
-      bufsize=-1, stdout=subprocess.PIPE).stdout
-except OSError as e:
-  if e.errno == errno.ENOENT:
-    print('''
-      Node.js compile error: could not find objdump
-
-      Check that GNU binutils are installed and included in PATH
-      ''')
-  else:
-    print('problem running objdump: ', e.strerror)
-
-  sys.exit()
-
-pattern = re.compile('([0-9a-fA-F]{8}|[0-9a-fA-F]{16}) <(.*)>:')
-v8dbg = re.compile('^v8dbg.*$')
-numpattern = re.compile('^[0-9a-fA-F]{2} $')
-octets = 4
-
-outfile.write("""
-/*
- * File automatically generated by genv8constants. Do not edit.
- *
- * The following offsets are dynamically from libv8_base.a.  See src/v8ustack.d
- * for details on how these values are used.
- */
-
-#ifndef V8_CONSTANTS_H
-#define V8_CONSTANTS_H
-
-""")
-
-curr_sym = None
-curr_val = 0
-curr_octet = 0
-
-def out_reset():
-  global curr_sym, curr_val, curr_octet
-  curr_sym = None
-  curr_val = 0
-  curr_octet = 0
-
-def out_define():
-  global curr_sym, curr_val, curr_octet, outfile, octets
-  if curr_sym != None:
-    wrapped_val = curr_val & 0xffffffff
-    if curr_val & 0x80000000 != 0:
-      wrapped_val = 0x100000000 - wrapped_val
-      outfile.write("#define %s -0x%x\n" % (curr_sym.upper(), wrapped_val))
-    else:
-      outfile.write("#define %s 0x%x\n" % (curr_sym.upper(), wrapped_val))
-  out_reset()
-
-for line in pipe:
-  line = line.decode('utf-8')
-  if curr_sym != None:
-    #
-    # This bit of code has nasty knowledge of the objdump text output
-    # format, but this is the most obvious robust approach.  We could almost
-    # rely on looking at numbered fields, but some instructions look very
-    # much like hex numbers (e.g., "adc"), and we don't want to risk picking
-    # those up by mistake, so we look at character-based columns instead.
-    #
-    for i in range(0, 3):
-      # 6-character margin, 2-characters + 1 space for each field
-      idx = 6 + i * 3
-      octetstr = line[idx:idx+3]
-      if curr_octet > octets:
-        break
-
-      if not numpattern.match(octetstr):
-        break
-
-      curr_val += int('0x%s' % octetstr, 16) << (curr_octet * 8)
-      curr_octet += 1
-
-  match = pattern.match(line)
-  if match is None:
-    continue
-
-  # Print previous symbol
-  out_define()
-
-  v8match = v8dbg.match(match.group(2))
-  if v8match != None:
-    out_reset()
-    curr_sym = match.group(2)
-
-# Print last symbol
-out_define()
-
-outfile.write("""
-
-#endif /* V8_CONSTANTS_H */
-""")
-
-outfile.close()
diff --git a/tools/github_reporter/index.js b/tools/github_reporter/index.js
index 3b22136ab5260a..e9cf741b2ddc86 100644
--- a/tools/github_reporter/index.js
+++ b/tools/github_reporter/index.js
@@ -1621,7 +1621,7 @@ var require_oidc_utils = __commonJS({
  
         Error Code : ${error.statusCode}
  
-        Error Message: ${error.result.message}`);
+        Error Message: ${error.message}`);
           });
           const id_token = (_a = res.result) === null || _a === void 0 ? void 0 : _a.value;
           if (!id_token) {
diff --git a/tools/github_reporter/package.json b/tools/github_reporter/package.json
index ff8ac3ec813d20..a4606a05892ced 100644
--- a/tools/github_reporter/package.json
+++ b/tools/github_reporter/package.json
@@ -1,7 +1,8 @@
 {
   "name": "@reporters/github",
-  "version": "1.5.2",
+  "version": "1.5.3",
   "description": "A github actions reporter for `node:test`",
+  "type": "commonjs",
   "keywords": [
     "github actions",
     "node:test",
diff --git a/tools/icu/icu_versions.json b/tools/icu/icu_versions.json
index e659b92ab47057..e635d9b841ae93 100644
--- a/tools/icu/icu_versions.json
+++ b/tools/icu/icu_versions.json
@@ -1,3 +1,3 @@
 {
-    "minimum_icu": 71
+    "minimum_icu": 73
 }
diff --git a/tools/inspector_protocol/lib/base_string_adapter_cc.template b/tools/inspector_protocol/lib/base_string_adapter_cc.template
index 639b39bb520d85..af078b8e8ae729 100644
--- a/tools/inspector_protocol/lib/base_string_adapter_cc.template
+++ b/tools/inspector_protocol/lib/base_string_adapter_cc.template
@@ -128,18 +128,6 @@ std::unique_ptr<base::Value> toBaseValue(Value* value, int depth) {
   return nullptr;
 }
 
-// static
-std::unique_ptr<Value> StringUtil::parseMessage(
-    const std::string& message, bool binary) {
-  if (binary) {
-    return Value::parseBinary(
-        reinterpret_cast<const uint8_t*>(message.data()),
-        message.length());
-  }
-  std::unique_ptr<base::Value> value = base::JSONReader::ReadDeprecated(message);
-  return toProtocolValue(value.get(), 1000);
-}
-
 // static
 ProtocolMessage StringUtil::jsonToMessage(String message) {
   return message;
diff --git a/tools/inspector_protocol/lib/base_string_adapter_h.template b/tools/inspector_protocol/lib/base_string_adapter_h.template
index 8bf3c355c0e584..46f9e1778b12bb 100644
--- a/tools/inspector_protocol/lib/base_string_adapter_h.template
+++ b/tools/inspector_protocol/lib/base_string_adapter_h.template
@@ -92,7 +92,6 @@ class {{config.lib.export_macro}} StringUtil {
     return builder.toString();
   }
 
-  static std::unique_ptr<Value> parseMessage(const std::string& message, bool binary);
   static ProtocolMessage jsonToMessage(String message);
   static ProtocolMessage binaryToMessage(std::vector<uint8_t> message);
 
diff --git a/tools/install.py b/tools/install.py
index 11616e1bcac530..c2cd85e7dde4e7 100755
--- a/tools/install.py
+++ b/tools/install.py
@@ -263,6 +263,7 @@ def wanted_v8_headers(files_arg, dest):
       'deps/v8/include/v8-forward.h',
       'deps/v8/include/v8-function-callback.h',
       'deps/v8/include/v8-function.h',
+      'deps/v8/include/v8-handle-base.h',
       'deps/v8/include/v8-initialization.h',
       'deps/v8/include/v8-internal.h',
       'deps/v8/include/v8-isolate.h',
@@ -285,6 +286,7 @@ def wanted_v8_headers(files_arg, dest):
       'deps/v8/include/v8-regexp.h',
       'deps/v8/include/v8-script.h',
       'deps/v8/include/v8-snapshot.h',
+      'deps/v8/include/v8-source-location.h',
       'deps/v8/include/v8-statistics.h',
       'deps/v8/include/v8-template.h',
       'deps/v8/include/v8-traced-handle.h',
diff --git a/tools/lint-md/lint-md.mjs b/tools/lint-md/lint-md.mjs
index 102a661a693f87..bdea9c710cfea5 100644
--- a/tools/lint-md/lint-md.mjs
+++ b/tools/lint-md/lint-md.mjs
@@ -105,6 +105,8 @@ var extend$1 = function extend() {
 };
 var extend$2 = getDefaultExportFromCjs(extend$1);
 
+function ok$B() {}
+
 function isPlainObject(value) {
 	if (typeof value !== 'object' || value === null) {
 		return false;
@@ -193,28 +195,28 @@ function wrap(middleware, callback) {
   }
 }
 
-function stringifyPosition$3(value) {
+function stringifyPosition$2(value) {
   if (!value || typeof value !== 'object') {
     return ''
   }
   if ('position' in value || 'type' in value) {
-    return position$3(value.position)
+    return position$2(value.position)
   }
   if ('start' in value || 'end' in value) {
-    return position$3(value)
+    return position$2(value)
   }
   if ('line' in value || 'column' in value) {
-    return point$5(value)
+    return point$4(value)
   }
   return ''
 }
-function point$5(point) {
-  return index$3(point && point.line) + ':' + index$3(point && point.column)
+function point$4(point) {
+  return index$2(point && point.line) + ':' + index$2(point && point.column)
 }
-function position$3(pos) {
-  return point$5(pos && pos.start) + '-' + point$5(pos && pos.end)
+function position$2(pos) {
+  return point$4(pos && pos.start) + '-' + point$4(pos && pos.end)
 }
-function index$3(value) {
+function index$2(value) {
   return value && typeof value === 'number' ? value : 1
 }
 
@@ -285,7 +287,7 @@ let VFileMessage$1 = class VFileMessage extends Error {
     this.file;
     this.message = reason;
     this.line = start ? start.line : undefined;
-    this.name = stringifyPosition$3(options.place) || '1:1';
+    this.name = stringifyPosition$2(options.place) || '1:1';
     this.place = options.place || undefined;
     this.reason = this.message;
     this.ruleId = options.ruleId || undefined;
@@ -814,19 +816,19 @@ function isUint8Array$2(value) {
   )
 }
 
-const emptyOptions = {};
-function toString(value, options) {
-  const settings = options || emptyOptions;
+const emptyOptions$3 = {};
+function toString$2(value, options) {
+  const settings = options || emptyOptions$3;
   const includeImageAlt =
     typeof settings.includeImageAlt === 'boolean'
       ? settings.includeImageAlt
       : true;
   const includeHtml =
     typeof settings.includeHtml === 'boolean' ? settings.includeHtml : true;
-  return one(value, includeImageAlt, includeHtml)
+  return one$2(value, includeImageAlt, includeHtml)
 }
-function one(value, includeImageAlt, includeHtml) {
-  if (node(value)) {
+function one$2(value, includeImageAlt, includeHtml) {
+  if (node$2(value)) {
     if ('value' in value) {
       return value.type === 'html' && !includeHtml ? '' : value.value
     }
@@ -834,802 +836,26 @@ function one(value, includeImageAlt, includeHtml) {
       return value.alt
     }
     if ('children' in value) {
-      return all(value.children, includeImageAlt, includeHtml)
+      return all$2(value.children, includeImageAlt, includeHtml)
     }
   }
   if (Array.isArray(value)) {
-    return all(value, includeImageAlt, includeHtml)
+    return all$2(value, includeImageAlt, includeHtml)
   }
   return ''
 }
-function all(values, includeImageAlt, includeHtml) {
+function all$2(values, includeImageAlt, includeHtml) {
   const result = [];
   let index = -1;
   while (++index < values.length) {
-    result[index] = one(values[index], includeImageAlt, includeHtml);
+    result[index] = one$2(values[index], includeImageAlt, includeHtml);
   }
   return result.join('')
 }
-function node(value) {
+function node$2(value) {
   return Boolean(value && typeof value === 'object')
 }
 
-function splice(list, start, remove, items) {
-  const end = list.length;
-  let chunkStart = 0;
-  let parameters;
-  if (start < 0) {
-    start = -start > end ? 0 : end + start;
-  } else {
-    start = start > end ? end : start;
-  }
-  remove = remove > 0 ? remove : 0;
-  if (items.length < 10000) {
-    parameters = Array.from(items);
-    parameters.unshift(start, remove);
-    list.splice(...parameters);
-  } else {
-    if (remove) list.splice(start, remove);
-    while (chunkStart < items.length) {
-      parameters = items.slice(chunkStart, chunkStart + 10000);
-      parameters.unshift(start, 0);
-      list.splice(...parameters);
-      chunkStart += 10000;
-      start += 10000;
-    }
-  }
-}
-function push(list, items) {
-  if (list.length > 0) {
-    splice(list, list.length, 0, items);
-    return list
-  }
-  return items
-}
-
-const hasOwnProperty = {}.hasOwnProperty;
-function combineExtensions(extensions) {
-  const all = {};
-  let index = -1;
-  while (++index < extensions.length) {
-    syntaxExtension(all, extensions[index]);
-  }
-  return all
-}
-function syntaxExtension(all, extension) {
-  let hook;
-  for (hook in extension) {
-    const maybe = hasOwnProperty.call(all, hook) ? all[hook] : undefined;
-    const left = maybe || (all[hook] = {});
-    const right = extension[hook];
-    let code;
-    if (right) {
-      for (code in right) {
-        if (!hasOwnProperty.call(left, code)) left[code] = [];
-        const value = right[code];
-        constructs(
-          left[code],
-          Array.isArray(value) ? value : value ? [value] : []
-        );
-      }
-    }
-  }
-}
-function constructs(existing, list) {
-  let index = -1;
-  const before = [];
-  while (++index < list.length) {
-(list[index].add === 'after' ? existing : before).push(list[index]);
-  }
-  splice(existing, 0, 0, before);
-}
-
-const unicodePunctuationRegex =
-  /[!-\/:-@\[-`\{-~\xA1\xA7\xAB\xB6\xB7\xBB\xBF\u037E\u0387\u055A-\u055F\u0589\u058A\u05BE\u05C0\u05C3\u05C6\u05F3\u05F4\u0609\u060A\u060C\u060D\u061B\u061D-\u061F\u066A-\u066D\u06D4\u0700-\u070D\u07F7-\u07F9\u0830-\u083E\u085E\u0964\u0965\u0970\u09FD\u0A76\u0AF0\u0C77\u0C84\u0DF4\u0E4F\u0E5A\u0E5B\u0F04-\u0F12\u0F14\u0F3A-\u0F3D\u0F85\u0FD0-\u0FD4\u0FD9\u0FDA\u104A-\u104F\u10FB\u1360-\u1368\u1400\u166E\u169B\u169C\u16EB-\u16ED\u1735\u1736\u17D4-\u17D6\u17D8-\u17DA\u1800-\u180A\u1944\u1945\u1A1E\u1A1F\u1AA0-\u1AA6\u1AA8-\u1AAD\u1B5A-\u1B60\u1B7D\u1B7E\u1BFC-\u1BFF\u1C3B-\u1C3F\u1C7E\u1C7F\u1CC0-\u1CC7\u1CD3\u2010-\u2027\u2030-\u2043\u2045-\u2051\u2053-\u205E\u207D\u207E\u208D\u208E\u2308-\u230B\u2329\u232A\u2768-\u2775\u27C5\u27C6\u27E6-\u27EF\u2983-\u2998\u29D8-\u29DB\u29FC\u29FD\u2CF9-\u2CFC\u2CFE\u2CFF\u2D70\u2E00-\u2E2E\u2E30-\u2E4F\u2E52-\u2E5D\u3001-\u3003\u3008-\u3011\u3014-\u301F\u3030\u303D\u30A0\u30FB\uA4FE\uA4FF\uA60D-\uA60F\uA673\uA67E\uA6F2-\uA6F7\uA874-\uA877\uA8CE\uA8CF\uA8F8-\uA8FA\uA8FC\uA92E\uA92F\uA95F\uA9C1-\uA9CD\uA9DE\uA9DF\uAA5C-\uAA5F\uAADE\uAADF\uAAF0\uAAF1\uABEB\uFD3E\uFD3F\uFE10-\uFE19\uFE30-\uFE52\uFE54-\uFE61\uFE63\uFE68\uFE6A\uFE6B\uFF01-\uFF03\uFF05-\uFF0A\uFF0C-\uFF0F\uFF1A\uFF1B\uFF1F\uFF20\uFF3B-\uFF3D\uFF3F\uFF5B\uFF5D\uFF5F-\uFF65]/;
-
-const asciiAlpha = regexCheck(/[A-Za-z]/);
-const asciiAlphanumeric = regexCheck(/[\dA-Za-z]/);
-const asciiAtext = regexCheck(/[#-'*+\--9=?A-Z^-~]/);
-function asciiControl(code) {
-  return (
-    code !== null && (code < 32 || code === 127)
-  )
-}
-const asciiDigit = regexCheck(/\d/);
-const asciiHexDigit = regexCheck(/[\dA-Fa-f]/);
-const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/);
-function markdownLineEnding(code) {
-  return code !== null && code < -2
-}
-function markdownLineEndingOrSpace(code) {
-  return code !== null && (code < 0 || code === 32)
-}
-function markdownSpace(code) {
-  return code === -2 || code === -1 || code === 32
-}
-const unicodePunctuation = regexCheck(unicodePunctuationRegex);
-const unicodeWhitespace = regexCheck(/\s/);
-function regexCheck(regex) {
-  return check
-  function check(code) {
-    return code !== null && regex.test(String.fromCharCode(code))
-  }
-}
-
-function factorySpace(effects, ok, type, max) {
-  const limit = max ? max - 1 : Number.POSITIVE_INFINITY;
-  let size = 0;
-  return start
-  function start(code) {
-    if (markdownSpace(code)) {
-      effects.enter(type);
-      return prefix(code)
-    }
-    return ok(code)
-  }
-  function prefix(code) {
-    if (markdownSpace(code) && size++ < limit) {
-      effects.consume(code);
-      return prefix
-    }
-    effects.exit(type);
-    return ok(code)
-  }
-}
-
-const content$1 = {
-  tokenize: initializeContent
-};
-function initializeContent(effects) {
-  const contentStart = effects.attempt(
-    this.parser.constructs.contentInitial,
-    afterContentStartConstruct,
-    paragraphInitial
-  );
-  let previous;
-  return contentStart
-  function afterContentStartConstruct(code) {
-    if (code === null) {
-      effects.consume(code);
-      return
-    }
-    effects.enter('lineEnding');
-    effects.consume(code);
-    effects.exit('lineEnding');
-    return factorySpace(effects, contentStart, 'linePrefix')
-  }
-  function paragraphInitial(code) {
-    effects.enter('paragraph');
-    return lineStart(code)
-  }
-  function lineStart(code) {
-    const token = effects.enter('chunkText', {
-      contentType: 'text',
-      previous
-    });
-    if (previous) {
-      previous.next = token;
-    }
-    previous = token;
-    return data(code)
-  }
-  function data(code) {
-    if (code === null) {
-      effects.exit('chunkText');
-      effects.exit('paragraph');
-      effects.consume(code);
-      return
-    }
-    if (markdownLineEnding(code)) {
-      effects.consume(code);
-      effects.exit('chunkText');
-      return lineStart
-    }
-    effects.consume(code);
-    return data
-  }
-}
-
-const document$1 = {
-  tokenize: initializeDocument
-};
-const containerConstruct = {
-  tokenize: tokenizeContainer
-};
-function initializeDocument(effects) {
-  const self = this;
-  const stack = [];
-  let continued = 0;
-  let childFlow;
-  let childToken;
-  let lineStartOffset;
-  return start
-  function start(code) {
-    if (continued < stack.length) {
-      const item = stack[continued];
-      self.containerState = item[1];
-      return effects.attempt(
-        item[0].continuation,
-        documentContinue,
-        checkNewContainers
-      )(code)
-    }
-    return checkNewContainers(code)
-  }
-  function documentContinue(code) {
-    continued++;
-    if (self.containerState._closeFlow) {
-      self.containerState._closeFlow = undefined;
-      if (childFlow) {
-        closeFlow();
-      }
-      const indexBeforeExits = self.events.length;
-      let indexBeforeFlow = indexBeforeExits;
-      let point;
-      while (indexBeforeFlow--) {
-        if (
-          self.events[indexBeforeFlow][0] === 'exit' &&
-          self.events[indexBeforeFlow][1].type === 'chunkFlow'
-        ) {
-          point = self.events[indexBeforeFlow][1].end;
-          break
-        }
-      }
-      exitContainers(continued);
-      let index = indexBeforeExits;
-      while (index < self.events.length) {
-        self.events[index][1].end = Object.assign({}, point);
-        index++;
-      }
-      splice(
-        self.events,
-        indexBeforeFlow + 1,
-        0,
-        self.events.slice(indexBeforeExits)
-      );
-      self.events.length = index;
-      return checkNewContainers(code)
-    }
-    return start(code)
-  }
-  function checkNewContainers(code) {
-    if (continued === stack.length) {
-      if (!childFlow) {
-        return documentContinued(code)
-      }
-      if (childFlow.currentConstruct && childFlow.currentConstruct.concrete) {
-        return flowStart(code)
-      }
-      self.interrupt = Boolean(
-        childFlow.currentConstruct && !childFlow._gfmTableDynamicInterruptHack
-      );
-    }
-    self.containerState = {};
-    return effects.check(
-      containerConstruct,
-      thereIsANewContainer,
-      thereIsNoNewContainer
-    )(code)
-  }
-  function thereIsANewContainer(code) {
-    if (childFlow) closeFlow();
-    exitContainers(continued);
-    return documentContinued(code)
-  }
-  function thereIsNoNewContainer(code) {
-    self.parser.lazy[self.now().line] = continued !== stack.length;
-    lineStartOffset = self.now().offset;
-    return flowStart(code)
-  }
-  function documentContinued(code) {
-    self.containerState = {};
-    return effects.attempt(
-      containerConstruct,
-      containerContinue,
-      flowStart
-    )(code)
-  }
-  function containerContinue(code) {
-    continued++;
-    stack.push([self.currentConstruct, self.containerState]);
-    return documentContinued(code)
-  }
-  function flowStart(code) {
-    if (code === null) {
-      if (childFlow) closeFlow();
-      exitContainers(0);
-      effects.consume(code);
-      return
-    }
-    childFlow = childFlow || self.parser.flow(self.now());
-    effects.enter('chunkFlow', {
-      contentType: 'flow',
-      previous: childToken,
-      _tokenizer: childFlow
-    });
-    return flowContinue(code)
-  }
-  function flowContinue(code) {
-    if (code === null) {
-      writeToChild(effects.exit('chunkFlow'), true);
-      exitContainers(0);
-      effects.consume(code);
-      return
-    }
-    if (markdownLineEnding(code)) {
-      effects.consume(code);
-      writeToChild(effects.exit('chunkFlow'));
-      continued = 0;
-      self.interrupt = undefined;
-      return start
-    }
-    effects.consume(code);
-    return flowContinue
-  }
-  function writeToChild(token, eof) {
-    const stream = self.sliceStream(token);
-    if (eof) stream.push(null);
-    token.previous = childToken;
-    if (childToken) childToken.next = token;
-    childToken = token;
-    childFlow.defineSkip(token.start);
-    childFlow.write(stream);
-    if (self.parser.lazy[token.start.line]) {
-      let index = childFlow.events.length;
-      while (index--) {
-        if (
-          childFlow.events[index][1].start.offset < lineStartOffset &&
-          (!childFlow.events[index][1].end ||
-            childFlow.events[index][1].end.offset > lineStartOffset)
-        ) {
-          return
-        }
-      }
-      const indexBeforeExits = self.events.length;
-      let indexBeforeFlow = indexBeforeExits;
-      let seen;
-      let point;
-      while (indexBeforeFlow--) {
-        if (
-          self.events[indexBeforeFlow][0] === 'exit' &&
-          self.events[indexBeforeFlow][1].type === 'chunkFlow'
-        ) {
-          if (seen) {
-            point = self.events[indexBeforeFlow][1].end;
-            break
-          }
-          seen = true;
-        }
-      }
-      exitContainers(continued);
-      index = indexBeforeExits;
-      while (index < self.events.length) {
-        self.events[index][1].end = Object.assign({}, point);
-        index++;
-      }
-      splice(
-        self.events,
-        indexBeforeFlow + 1,
-        0,
-        self.events.slice(indexBeforeExits)
-      );
-      self.events.length = index;
-    }
-  }
-  function exitContainers(size) {
-    let index = stack.length;
-    while (index-- > size) {
-      const entry = stack[index];
-      self.containerState = entry[1];
-      entry[0].exit.call(self, effects);
-    }
-    stack.length = size;
-  }
-  function closeFlow() {
-    childFlow.write([null]);
-    childToken = undefined;
-    childFlow = undefined;
-    self.containerState._closeFlow = undefined;
-  }
-}
-function tokenizeContainer(effects, ok, nok) {
-  return factorySpace(
-    effects,
-    effects.attempt(this.parser.constructs.document, ok, nok),
-    'linePrefix',
-    this.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4
-  )
-}
-
-function classifyCharacter(code) {
-  if (
-    code === null ||
-    markdownLineEndingOrSpace(code) ||
-    unicodeWhitespace(code)
-  ) {
-    return 1
-  }
-  if (unicodePunctuation(code)) {
-    return 2
-  }
-}
-
-function resolveAll(constructs, events, context) {
-  const called = [];
-  let index = -1;
-  while (++index < constructs.length) {
-    const resolve = constructs[index].resolveAll;
-    if (resolve && !called.includes(resolve)) {
-      events = resolve(events, context);
-      called.push(resolve);
-    }
-  }
-  return events
-}
-
-const attention = {
-  name: 'attention',
-  tokenize: tokenizeAttention,
-  resolveAll: resolveAllAttention
-};
-function resolveAllAttention(events, context) {
-  let index = -1;
-  let open;
-  let group;
-  let text;
-  let openingSequence;
-  let closingSequence;
-  let use;
-  let nextEvents;
-  let offset;
-  while (++index < events.length) {
-    if (
-      events[index][0] === 'enter' &&
-      events[index][1].type === 'attentionSequence' &&
-      events[index][1]._close
-    ) {
-      open = index;
-      while (open--) {
-        if (
-          events[open][0] === 'exit' &&
-          events[open][1].type === 'attentionSequence' &&
-          events[open][1]._open &&
-          context.sliceSerialize(events[open][1]).charCodeAt(0) ===
-            context.sliceSerialize(events[index][1]).charCodeAt(0)
-        ) {
-          if (
-            (events[open][1]._close || events[index][1]._open) &&
-            (events[index][1].end.offset - events[index][1].start.offset) % 3 &&
-            !(
-              (events[open][1].end.offset -
-                events[open][1].start.offset +
-                events[index][1].end.offset -
-                events[index][1].start.offset) %
-              3
-            )
-          ) {
-            continue
-          }
-          use =
-            events[open][1].end.offset - events[open][1].start.offset > 1 &&
-            events[index][1].end.offset - events[index][1].start.offset > 1
-              ? 2
-              : 1;
-          const start = Object.assign({}, events[open][1].end);
-          const end = Object.assign({}, events[index][1].start);
-          movePoint(start, -use);
-          movePoint(end, use);
-          openingSequence = {
-            type: use > 1 ? 'strongSequence' : 'emphasisSequence',
-            start,
-            end: Object.assign({}, events[open][1].end)
-          };
-          closingSequence = {
-            type: use > 1 ? 'strongSequence' : 'emphasisSequence',
-            start: Object.assign({}, events[index][1].start),
-            end
-          };
-          text = {
-            type: use > 1 ? 'strongText' : 'emphasisText',
-            start: Object.assign({}, events[open][1].end),
-            end: Object.assign({}, events[index][1].start)
-          };
-          group = {
-            type: use > 1 ? 'strong' : 'emphasis',
-            start: Object.assign({}, openingSequence.start),
-            end: Object.assign({}, closingSequence.end)
-          };
-          events[open][1].end = Object.assign({}, openingSequence.start);
-          events[index][1].start = Object.assign({}, closingSequence.end);
-          nextEvents = [];
-          if (events[open][1].end.offset - events[open][1].start.offset) {
-            nextEvents = push(nextEvents, [
-              ['enter', events[open][1], context],
-              ['exit', events[open][1], context]
-            ]);
-          }
-          nextEvents = push(nextEvents, [
-            ['enter', group, context],
-            ['enter', openingSequence, context],
-            ['exit', openingSequence, context],
-            ['enter', text, context]
-          ]);
-          nextEvents = push(
-            nextEvents,
-            resolveAll(
-              context.parser.constructs.insideSpan.null,
-              events.slice(open + 1, index),
-              context
-            )
-          );
-          nextEvents = push(nextEvents, [
-            ['exit', text, context],
-            ['enter', closingSequence, context],
-            ['exit', closingSequence, context],
-            ['exit', group, context]
-          ]);
-          if (events[index][1].end.offset - events[index][1].start.offset) {
-            offset = 2;
-            nextEvents = push(nextEvents, [
-              ['enter', events[index][1], context],
-              ['exit', events[index][1], context]
-            ]);
-          } else {
-            offset = 0;
-          }
-          splice(events, open - 1, index - open + 3, nextEvents);
-          index = open + nextEvents.length - offset - 2;
-          break
-        }
-      }
-    }
-  }
-  index = -1;
-  while (++index < events.length) {
-    if (events[index][1].type === 'attentionSequence') {
-      events[index][1].type = 'data';
-    }
-  }
-  return events
-}
-function tokenizeAttention(effects, ok) {
-  const attentionMarkers = this.parser.constructs.attentionMarkers.null;
-  const previous = this.previous;
-  const before = classifyCharacter(previous);
-  let marker;
-  return start
-  function start(code) {
-    marker = code;
-    effects.enter('attentionSequence');
-    return inside(code)
-  }
-  function inside(code) {
-    if (code === marker) {
-      effects.consume(code);
-      return inside
-    }
-    const token = effects.exit('attentionSequence');
-    const after = classifyCharacter(code);
-    const open =
-      !after || (after === 2 && before) || attentionMarkers.includes(code);
-    const close =
-      !before || (before === 2 && after) || attentionMarkers.includes(previous);
-    token._open = Boolean(marker === 42 ? open : open && (before || !close));
-    token._close = Boolean(marker === 42 ? close : close && (after || !open));
-    return ok(code)
-  }
-}
-function movePoint(point, offset) {
-  point.column += offset;
-  point.offset += offset;
-  point._bufferIndex += offset;
-}
-
-const autolink = {
-  name: 'autolink',
-  tokenize: tokenizeAutolink
-};
-function tokenizeAutolink(effects, ok, nok) {
-  let size = 0;
-  return start
-  function start(code) {
-    effects.enter('autolink');
-    effects.enter('autolinkMarker');
-    effects.consume(code);
-    effects.exit('autolinkMarker');
-    effects.enter('autolinkProtocol');
-    return open
-  }
-  function open(code) {
-    if (asciiAlpha(code)) {
-      effects.consume(code);
-      return schemeOrEmailAtext
-    }
-    return emailAtext(code)
-  }
-  function schemeOrEmailAtext(code) {
-    if (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) {
-      size = 1;
-      return schemeInsideOrEmailAtext(code)
-    }
-    return emailAtext(code)
-  }
-  function schemeInsideOrEmailAtext(code) {
-    if (code === 58) {
-      effects.consume(code);
-      size = 0;
-      return urlInside
-    }
-    if (
-      (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) &&
-      size++ < 32
-    ) {
-      effects.consume(code);
-      return schemeInsideOrEmailAtext
-    }
-    size = 0;
-    return emailAtext(code)
-  }
-  function urlInside(code) {
-    if (code === 62) {
-      effects.exit('autolinkProtocol');
-      effects.enter('autolinkMarker');
-      effects.consume(code);
-      effects.exit('autolinkMarker');
-      effects.exit('autolink');
-      return ok
-    }
-    if (code === null || code === 32 || code === 60 || asciiControl(code)) {
-      return nok(code)
-    }
-    effects.consume(code);
-    return urlInside
-  }
-  function emailAtext(code) {
-    if (code === 64) {
-      effects.consume(code);
-      return emailAtSignOrDot
-    }
-    if (asciiAtext(code)) {
-      effects.consume(code);
-      return emailAtext
-    }
-    return nok(code)
-  }
-  function emailAtSignOrDot(code) {
-    return asciiAlphanumeric(code) ? emailLabel(code) : nok(code)
-  }
-  function emailLabel(code) {
-    if (code === 46) {
-      effects.consume(code);
-      size = 0;
-      return emailAtSignOrDot
-    }
-    if (code === 62) {
-      effects.exit('autolinkProtocol').type = 'autolinkEmail';
-      effects.enter('autolinkMarker');
-      effects.consume(code);
-      effects.exit('autolinkMarker');
-      effects.exit('autolink');
-      return ok
-    }
-    return emailValue(code)
-  }
-  function emailValue(code) {
-    if ((code === 45 || asciiAlphanumeric(code)) && size++ < 63) {
-      const next = code === 45 ? emailValue : emailLabel;
-      effects.consume(code);
-      return next
-    }
-    return nok(code)
-  }
-}
-
-const blankLine = {
-  tokenize: tokenizeBlankLine,
-  partial: true
-};
-function tokenizeBlankLine(effects, ok, nok) {
-  return start
-  function start(code) {
-    return markdownSpace(code)
-      ? factorySpace(effects, after, 'linePrefix')(code)
-      : after(code)
-  }
-  function after(code) {
-    return code === null || markdownLineEnding(code) ? ok(code) : nok(code)
-  }
-}
-
-const blockQuote = {
-  name: 'blockQuote',
-  tokenize: tokenizeBlockQuoteStart,
-  continuation: {
-    tokenize: tokenizeBlockQuoteContinuation
-  },
-  exit: exit$1
-};
-function tokenizeBlockQuoteStart(effects, ok, nok) {
-  const self = this;
-  return start
-  function start(code) {
-    if (code === 62) {
-      const state = self.containerState;
-      if (!state.open) {
-        effects.enter('blockQuote', {
-          _container: true
-        });
-        state.open = true;
-      }
-      effects.enter('blockQuotePrefix');
-      effects.enter('blockQuoteMarker');
-      effects.consume(code);
-      effects.exit('blockQuoteMarker');
-      return after
-    }
-    return nok(code)
-  }
-  function after(code) {
-    if (markdownSpace(code)) {
-      effects.enter('blockQuotePrefixWhitespace');
-      effects.consume(code);
-      effects.exit('blockQuotePrefixWhitespace');
-      effects.exit('blockQuotePrefix');
-      return ok
-    }
-    effects.exit('blockQuotePrefix');
-    return ok(code)
-  }
-}
-function tokenizeBlockQuoteContinuation(effects, ok, nok) {
-  const self = this;
-  return contStart
-  function contStart(code) {
-    if (markdownSpace(code)) {
-      return factorySpace(
-        effects,
-        contBefore,
-        'linePrefix',
-        self.parser.constructs.disable.null.includes('codeIndented')
-          ? undefined
-          : 4
-      )(code)
-    }
-    return contBefore(code)
-  }
-  function contBefore(code) {
-    return effects.attempt(blockQuote, ok, nok)(code)
-  }
-}
-function exit$1(effects) {
-  effects.exit('blockQuote');
-}
-
-const characterEscape = {
-  name: 'characterEscape',
-  tokenize: tokenizeCharacterEscape
-};
-function tokenizeCharacterEscape(effects, ok, nok) {
-  return start
-  function start(code) {
-    effects.enter('characterEscape');
-    effects.enter('escapeMarker');
-    effects.consume(code);
-    effects.exit('escapeMarker');
-    return inside
-  }
-  function inside(code) {
-    if (asciiPunctuation(code)) {
-      effects.enter('characterEscapeValue');
-      effects.consume(code);
-      effects.exit('characterEscapeValue');
-      effects.exit('characterEscape');
-      return ok
-    }
-    return nok(code)
-  }
-}
-
 const characterEntities = {
   AElig: 'Æ',
   AMP: '&',
@@ -3758,9 +2984,813 @@ const characterEntities = {
   zwnj: '‌'
 };
 
-const own$5 = {}.hasOwnProperty;
-function decodeNamedCharacterReference(value) {
-  return own$5.call(characterEntities, value) ? characterEntities[value] : false
+const own$5 = {}.hasOwnProperty;
+function decodeNamedCharacterReference(value) {
+  return own$5.call(characterEntities, value) ? characterEntities[value] : false
+}
+
+function splice(list, start, remove, items) {
+  const end = list.length;
+  let chunkStart = 0;
+  let parameters;
+  if (start < 0) {
+    start = -start > end ? 0 : end + start;
+  } else {
+    start = start > end ? end : start;
+  }
+  remove = remove > 0 ? remove : 0;
+  if (items.length < 10000) {
+    parameters = Array.from(items);
+    parameters.unshift(start, remove);
+    list.splice(...parameters);
+  } else {
+    if (remove) list.splice(start, remove);
+    while (chunkStart < items.length) {
+      parameters = items.slice(chunkStart, chunkStart + 10000);
+      parameters.unshift(start, 0);
+      list.splice(...parameters);
+      chunkStart += 10000;
+      start += 10000;
+    }
+  }
+}
+function push(list, items) {
+  if (list.length > 0) {
+    splice(list, list.length, 0, items);
+    return list
+  }
+  return items
+}
+
+const hasOwnProperty = {}.hasOwnProperty;
+function combineExtensions(extensions) {
+  const all = {};
+  let index = -1;
+  while (++index < extensions.length) {
+    syntaxExtension(all, extensions[index]);
+  }
+  return all
+}
+function syntaxExtension(all, extension) {
+  let hook;
+  for (hook in extension) {
+    const maybe = hasOwnProperty.call(all, hook) ? all[hook] : undefined;
+    const left = maybe || (all[hook] = {});
+    const right = extension[hook];
+    let code;
+    if (right) {
+      for (code in right) {
+        if (!hasOwnProperty.call(left, code)) left[code] = [];
+        const value = right[code];
+        constructs(
+          left[code],
+          Array.isArray(value) ? value : value ? [value] : []
+        );
+      }
+    }
+  }
+}
+function constructs(existing, list) {
+  let index = -1;
+  const before = [];
+  while (++index < list.length) {
+(list[index].add === 'after' ? existing : before).push(list[index]);
+  }
+  splice(existing, 0, 0, before);
+}
+
+function decodeNumericCharacterReference(value, base) {
+  const code = Number.parseInt(value, base);
+  if (
+    code < 9 ||
+    code === 11 ||
+    (code > 13 && code < 32) ||
+    (code > 126 && code < 160) ||
+    (code > 55_295 && code < 57_344) ||
+    (code > 64_975 && code < 65_008)  ||
+    (code & 65_535) === 65_535 ||
+    (code & 65_535) === 65_534  ||
+    code > 1_114_111
+  ) {
+    return '\uFFFD'
+  }
+  return String.fromCharCode(code)
+}
+
+function normalizeIdentifier$1(value) {
+  return (
+    value
+      .replace(/[\t\n\r ]+/g, ' ')
+      .replace(/^ | $/g, '')
+      .toLowerCase()
+      .toUpperCase()
+  )
+}
+
+const unicodePunctuationInternal = regexCheck(/\p{P}/u);
+const asciiAlpha = regexCheck(/[A-Za-z]/);
+const asciiAlphanumeric = regexCheck(/[\dA-Za-z]/);
+const asciiAtext = regexCheck(/[#-'*+\--9=?A-Z^-~]/);
+function asciiControl(code) {
+  return (
+    code !== null && (code < 32 || code === 127)
+  )
+}
+const asciiDigit = regexCheck(/\d/);
+const asciiHexDigit = regexCheck(/[\dA-Fa-f]/);
+const asciiPunctuation = regexCheck(/[!-/:-@[-`{-~]/);
+function markdownLineEnding(code) {
+  return code !== null && code < -2
+}
+function markdownLineEndingOrSpace(code) {
+  return code !== null && (code < 0 || code === 32)
+}
+function markdownSpace(code) {
+  return code === -2 || code === -1 || code === 32
+}
+function unicodePunctuation(code) {
+  return asciiPunctuation(code) || unicodePunctuationInternal(code)
+}
+const unicodeWhitespace = regexCheck(/\s/);
+function regexCheck(regex) {
+  return check
+  function check(code) {
+    return code !== null && code > -1 && regex.test(String.fromCharCode(code))
+  }
+}
+
+function factorySpace(effects, ok, type, max) {
+  const limit = max ? max - 1 : Number.POSITIVE_INFINITY;
+  let size = 0;
+  return start
+  function start(code) {
+    if (markdownSpace(code)) {
+      effects.enter(type);
+      return prefix(code)
+    }
+    return ok(code)
+  }
+  function prefix(code) {
+    if (markdownSpace(code) && size++ < limit) {
+      effects.consume(code);
+      return prefix
+    }
+    effects.exit(type);
+    return ok(code)
+  }
+}
+
+const content$1 = {
+  tokenize: initializeContent
+};
+function initializeContent(effects) {
+  const contentStart = effects.attempt(
+    this.parser.constructs.contentInitial,
+    afterContentStartConstruct,
+    paragraphInitial
+  );
+  let previous;
+  return contentStart
+  function afterContentStartConstruct(code) {
+    if (code === null) {
+      effects.consume(code);
+      return
+    }
+    effects.enter('lineEnding');
+    effects.consume(code);
+    effects.exit('lineEnding');
+    return factorySpace(effects, contentStart, 'linePrefix')
+  }
+  function paragraphInitial(code) {
+    effects.enter('paragraph');
+    return lineStart(code)
+  }
+  function lineStart(code) {
+    const token = effects.enter('chunkText', {
+      contentType: 'text',
+      previous
+    });
+    if (previous) {
+      previous.next = token;
+    }
+    previous = token;
+    return data(code)
+  }
+  function data(code) {
+    if (code === null) {
+      effects.exit('chunkText');
+      effects.exit('paragraph');
+      effects.consume(code);
+      return
+    }
+    if (markdownLineEnding(code)) {
+      effects.consume(code);
+      effects.exit('chunkText');
+      return lineStart
+    }
+    effects.consume(code);
+    return data
+  }
+}
+
+const document$1 = {
+  tokenize: initializeDocument
+};
+const containerConstruct = {
+  tokenize: tokenizeContainer
+};
+function initializeDocument(effects) {
+  const self = this;
+  const stack = [];
+  let continued = 0;
+  let childFlow;
+  let childToken;
+  let lineStartOffset;
+  return start
+  function start(code) {
+    if (continued < stack.length) {
+      const item = stack[continued];
+      self.containerState = item[1];
+      return effects.attempt(
+        item[0].continuation,
+        documentContinue,
+        checkNewContainers
+      )(code)
+    }
+    return checkNewContainers(code)
+  }
+  function documentContinue(code) {
+    continued++;
+    if (self.containerState._closeFlow) {
+      self.containerState._closeFlow = undefined;
+      if (childFlow) {
+        closeFlow();
+      }
+      const indexBeforeExits = self.events.length;
+      let indexBeforeFlow = indexBeforeExits;
+      let point;
+      while (indexBeforeFlow--) {
+        if (
+          self.events[indexBeforeFlow][0] === 'exit' &&
+          self.events[indexBeforeFlow][1].type === 'chunkFlow'
+        ) {
+          point = self.events[indexBeforeFlow][1].end;
+          break
+        }
+      }
+      exitContainers(continued);
+      let index = indexBeforeExits;
+      while (index < self.events.length) {
+        self.events[index][1].end = Object.assign({}, point);
+        index++;
+      }
+      splice(
+        self.events,
+        indexBeforeFlow + 1,
+        0,
+        self.events.slice(indexBeforeExits)
+      );
+      self.events.length = index;
+      return checkNewContainers(code)
+    }
+    return start(code)
+  }
+  function checkNewContainers(code) {
+    if (continued === stack.length) {
+      if (!childFlow) {
+        return documentContinued(code)
+      }
+      if (childFlow.currentConstruct && childFlow.currentConstruct.concrete) {
+        return flowStart(code)
+      }
+      self.interrupt = Boolean(
+        childFlow.currentConstruct && !childFlow._gfmTableDynamicInterruptHack
+      );
+    }
+    self.containerState = {};
+    return effects.check(
+      containerConstruct,
+      thereIsANewContainer,
+      thereIsNoNewContainer
+    )(code)
+  }
+  function thereIsANewContainer(code) {
+    if (childFlow) closeFlow();
+    exitContainers(continued);
+    return documentContinued(code)
+  }
+  function thereIsNoNewContainer(code) {
+    self.parser.lazy[self.now().line] = continued !== stack.length;
+    lineStartOffset = self.now().offset;
+    return flowStart(code)
+  }
+  function documentContinued(code) {
+    self.containerState = {};
+    return effects.attempt(
+      containerConstruct,
+      containerContinue,
+      flowStart
+    )(code)
+  }
+  function containerContinue(code) {
+    continued++;
+    stack.push([self.currentConstruct, self.containerState]);
+    return documentContinued(code)
+  }
+  function flowStart(code) {
+    if (code === null) {
+      if (childFlow) closeFlow();
+      exitContainers(0);
+      effects.consume(code);
+      return
+    }
+    childFlow = childFlow || self.parser.flow(self.now());
+    effects.enter('chunkFlow', {
+      contentType: 'flow',
+      previous: childToken,
+      _tokenizer: childFlow
+    });
+    return flowContinue(code)
+  }
+  function flowContinue(code) {
+    if (code === null) {
+      writeToChild(effects.exit('chunkFlow'), true);
+      exitContainers(0);
+      effects.consume(code);
+      return
+    }
+    if (markdownLineEnding(code)) {
+      effects.consume(code);
+      writeToChild(effects.exit('chunkFlow'));
+      continued = 0;
+      self.interrupt = undefined;
+      return start
+    }
+    effects.consume(code);
+    return flowContinue
+  }
+  function writeToChild(token, eof) {
+    const stream = self.sliceStream(token);
+    if (eof) stream.push(null);
+    token.previous = childToken;
+    if (childToken) childToken.next = token;
+    childToken = token;
+    childFlow.defineSkip(token.start);
+    childFlow.write(stream);
+    if (self.parser.lazy[token.start.line]) {
+      let index = childFlow.events.length;
+      while (index--) {
+        if (
+          childFlow.events[index][1].start.offset < lineStartOffset &&
+          (!childFlow.events[index][1].end ||
+            childFlow.events[index][1].end.offset > lineStartOffset)
+        ) {
+          return
+        }
+      }
+      const indexBeforeExits = self.events.length;
+      let indexBeforeFlow = indexBeforeExits;
+      let seen;
+      let point;
+      while (indexBeforeFlow--) {
+        if (
+          self.events[indexBeforeFlow][0] === 'exit' &&
+          self.events[indexBeforeFlow][1].type === 'chunkFlow'
+        ) {
+          if (seen) {
+            point = self.events[indexBeforeFlow][1].end;
+            break
+          }
+          seen = true;
+        }
+      }
+      exitContainers(continued);
+      index = indexBeforeExits;
+      while (index < self.events.length) {
+        self.events[index][1].end = Object.assign({}, point);
+        index++;
+      }
+      splice(
+        self.events,
+        indexBeforeFlow + 1,
+        0,
+        self.events.slice(indexBeforeExits)
+      );
+      self.events.length = index;
+    }
+  }
+  function exitContainers(size) {
+    let index = stack.length;
+    while (index-- > size) {
+      const entry = stack[index];
+      self.containerState = entry[1];
+      entry[0].exit.call(self, effects);
+    }
+    stack.length = size;
+  }
+  function closeFlow() {
+    childFlow.write([null]);
+    childToken = undefined;
+    childFlow = undefined;
+    self.containerState._closeFlow = undefined;
+  }
+}
+function tokenizeContainer(effects, ok, nok) {
+  return factorySpace(
+    effects,
+    effects.attempt(this.parser.constructs.document, ok, nok),
+    'linePrefix',
+    this.parser.constructs.disable.null.includes('codeIndented') ? undefined : 4
+  )
+}
+
+function classifyCharacter(code) {
+  if (
+    code === null ||
+    markdownLineEndingOrSpace(code) ||
+    unicodeWhitespace(code)
+  ) {
+    return 1
+  }
+  if (unicodePunctuation(code)) {
+    return 2
+  }
+}
+
+function resolveAll(constructs, events, context) {
+  const called = [];
+  let index = -1;
+  while (++index < constructs.length) {
+    const resolve = constructs[index].resolveAll;
+    if (resolve && !called.includes(resolve)) {
+      events = resolve(events, context);
+      called.push(resolve);
+    }
+  }
+  return events
+}
+
+const attention = {
+  name: 'attention',
+  tokenize: tokenizeAttention,
+  resolveAll: resolveAllAttention
+};
+function resolveAllAttention(events, context) {
+  let index = -1;
+  let open;
+  let group;
+  let text;
+  let openingSequence;
+  let closingSequence;
+  let use;
+  let nextEvents;
+  let offset;
+  while (++index < events.length) {
+    if (
+      events[index][0] === 'enter' &&
+      events[index][1].type === 'attentionSequence' &&
+      events[index][1]._close
+    ) {
+      open = index;
+      while (open--) {
+        if (
+          events[open][0] === 'exit' &&
+          events[open][1].type === 'attentionSequence' &&
+          events[open][1]._open &&
+          context.sliceSerialize(events[open][1]).charCodeAt(0) ===
+            context.sliceSerialize(events[index][1]).charCodeAt(0)
+        ) {
+          if (
+            (events[open][1]._close || events[index][1]._open) &&
+            (events[index][1].end.offset - events[index][1].start.offset) % 3 &&
+            !(
+              (events[open][1].end.offset -
+                events[open][1].start.offset +
+                events[index][1].end.offset -
+                events[index][1].start.offset) %
+              3
+            )
+          ) {
+            continue
+          }
+          use =
+            events[open][1].end.offset - events[open][1].start.offset > 1 &&
+            events[index][1].end.offset - events[index][1].start.offset > 1
+              ? 2
+              : 1;
+          const start = Object.assign({}, events[open][1].end);
+          const end = Object.assign({}, events[index][1].start);
+          movePoint(start, -use);
+          movePoint(end, use);
+          openingSequence = {
+            type: use > 1 ? 'strongSequence' : 'emphasisSequence',
+            start,
+            end: Object.assign({}, events[open][1].end)
+          };
+          closingSequence = {
+            type: use > 1 ? 'strongSequence' : 'emphasisSequence',
+            start: Object.assign({}, events[index][1].start),
+            end
+          };
+          text = {
+            type: use > 1 ? 'strongText' : 'emphasisText',
+            start: Object.assign({}, events[open][1].end),
+            end: Object.assign({}, events[index][1].start)
+          };
+          group = {
+            type: use > 1 ? 'strong' : 'emphasis',
+            start: Object.assign({}, openingSequence.start),
+            end: Object.assign({}, closingSequence.end)
+          };
+          events[open][1].end = Object.assign({}, openingSequence.start);
+          events[index][1].start = Object.assign({}, closingSequence.end);
+          nextEvents = [];
+          if (events[open][1].end.offset - events[open][1].start.offset) {
+            nextEvents = push(nextEvents, [
+              ['enter', events[open][1], context],
+              ['exit', events[open][1], context]
+            ]);
+          }
+          nextEvents = push(nextEvents, [
+            ['enter', group, context],
+            ['enter', openingSequence, context],
+            ['exit', openingSequence, context],
+            ['enter', text, context]
+          ]);
+          nextEvents = push(
+            nextEvents,
+            resolveAll(
+              context.parser.constructs.insideSpan.null,
+              events.slice(open + 1, index),
+              context
+            )
+          );
+          nextEvents = push(nextEvents, [
+            ['exit', text, context],
+            ['enter', closingSequence, context],
+            ['exit', closingSequence, context],
+            ['exit', group, context]
+          ]);
+          if (events[index][1].end.offset - events[index][1].start.offset) {
+            offset = 2;
+            nextEvents = push(nextEvents, [
+              ['enter', events[index][1], context],
+              ['exit', events[index][1], context]
+            ]);
+          } else {
+            offset = 0;
+          }
+          splice(events, open - 1, index - open + 3, nextEvents);
+          index = open + nextEvents.length - offset - 2;
+          break
+        }
+      }
+    }
+  }
+  index = -1;
+  while (++index < events.length) {
+    if (events[index][1].type === 'attentionSequence') {
+      events[index][1].type = 'data';
+    }
+  }
+  return events
+}
+function tokenizeAttention(effects, ok) {
+  const attentionMarkers = this.parser.constructs.attentionMarkers.null;
+  const previous = this.previous;
+  const before = classifyCharacter(previous);
+  let marker;
+  return start
+  function start(code) {
+    marker = code;
+    effects.enter('attentionSequence');
+    return inside(code)
+  }
+  function inside(code) {
+    if (code === marker) {
+      effects.consume(code);
+      return inside
+    }
+    const token = effects.exit('attentionSequence');
+    const after = classifyCharacter(code);
+    const open =
+      !after || (after === 2 && before) || attentionMarkers.includes(code);
+    const close =
+      !before || (before === 2 && after) || attentionMarkers.includes(previous);
+    token._open = Boolean(marker === 42 ? open : open && (before || !close));
+    token._close = Boolean(marker === 42 ? close : close && (after || !open));
+    return ok(code)
+  }
+}
+function movePoint(point, offset) {
+  point.column += offset;
+  point.offset += offset;
+  point._bufferIndex += offset;
+}
+
+const autolink = {
+  name: 'autolink',
+  tokenize: tokenizeAutolink
+};
+function tokenizeAutolink(effects, ok, nok) {
+  let size = 0;
+  return start
+  function start(code) {
+    effects.enter('autolink');
+    effects.enter('autolinkMarker');
+    effects.consume(code);
+    effects.exit('autolinkMarker');
+    effects.enter('autolinkProtocol');
+    return open
+  }
+  function open(code) {
+    if (asciiAlpha(code)) {
+      effects.consume(code);
+      return schemeOrEmailAtext
+    }
+    return emailAtext(code)
+  }
+  function schemeOrEmailAtext(code) {
+    if (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) {
+      size = 1;
+      return schemeInsideOrEmailAtext(code)
+    }
+    return emailAtext(code)
+  }
+  function schemeInsideOrEmailAtext(code) {
+    if (code === 58) {
+      effects.consume(code);
+      size = 0;
+      return urlInside
+    }
+    if (
+      (code === 43 || code === 45 || code === 46 || asciiAlphanumeric(code)) &&
+      size++ < 32
+    ) {
+      effects.consume(code);
+      return schemeInsideOrEmailAtext
+    }
+    size = 0;
+    return emailAtext(code)
+  }
+  function urlInside(code) {
+    if (code === 62) {
+      effects.exit('autolinkProtocol');
+      effects.enter('autolinkMarker');
+      effects.consume(code);
+      effects.exit('autolinkMarker');
+      effects.exit('autolink');
+      return ok
+    }
+    if (code === null || code === 32 || code === 60 || asciiControl(code)) {
+      return nok(code)
+    }
+    effects.consume(code);
+    return urlInside
+  }
+  function emailAtext(code) {
+    if (code === 64) {
+      effects.consume(code);
+      return emailAtSignOrDot
+    }
+    if (asciiAtext(code)) {
+      effects.consume(code);
+      return emailAtext
+    }
+    return nok(code)
+  }
+  function emailAtSignOrDot(code) {
+    return asciiAlphanumeric(code) ? emailLabel(code) : nok(code)
+  }
+  function emailLabel(code) {
+    if (code === 46) {
+      effects.consume(code);
+      size = 0;
+      return emailAtSignOrDot
+    }
+    if (code === 62) {
+      effects.exit('autolinkProtocol').type = 'autolinkEmail';
+      effects.enter('autolinkMarker');
+      effects.consume(code);
+      effects.exit('autolinkMarker');
+      effects.exit('autolink');
+      return ok
+    }
+    return emailValue(code)
+  }
+  function emailValue(code) {
+    if ((code === 45 || asciiAlphanumeric(code)) && size++ < 63) {
+      const next = code === 45 ? emailValue : emailLabel;
+      effects.consume(code);
+      return next
+    }
+    return nok(code)
+  }
+}
+
+const blankLine = {
+  tokenize: tokenizeBlankLine,
+  partial: true
+};
+function tokenizeBlankLine(effects, ok, nok) {
+  return start
+  function start(code) {
+    return markdownSpace(code)
+      ? factorySpace(effects, after, 'linePrefix')(code)
+      : after(code)
+  }
+  function after(code) {
+    return code === null || markdownLineEnding(code) ? ok(code) : nok(code)
+  }
+}
+
+const blockQuote = {
+  name: 'blockQuote',
+  tokenize: tokenizeBlockQuoteStart,
+  continuation: {
+    tokenize: tokenizeBlockQuoteContinuation
+  },
+  exit: exit$1
+};
+function tokenizeBlockQuoteStart(effects, ok, nok) {
+  const self = this;
+  return start
+  function start(code) {
+    if (code === 62) {
+      const state = self.containerState;
+      if (!state.open) {
+        effects.enter('blockQuote', {
+          _container: true
+        });
+        state.open = true;
+      }
+      effects.enter('blockQuotePrefix');
+      effects.enter('blockQuoteMarker');
+      effects.consume(code);
+      effects.exit('blockQuoteMarker');
+      return after
+    }
+    return nok(code)
+  }
+  function after(code) {
+    if (markdownSpace(code)) {
+      effects.enter('blockQuotePrefixWhitespace');
+      effects.consume(code);
+      effects.exit('blockQuotePrefixWhitespace');
+      effects.exit('blockQuotePrefix');
+      return ok
+    }
+    effects.exit('blockQuotePrefix');
+    return ok(code)
+  }
+}
+function tokenizeBlockQuoteContinuation(effects, ok, nok) {
+  const self = this;
+  return contStart
+  function contStart(code) {
+    if (markdownSpace(code)) {
+      return factorySpace(
+        effects,
+        contBefore,
+        'linePrefix',
+        self.parser.constructs.disable.null.includes('codeIndented')
+          ? undefined
+          : 4
+      )(code)
+    }
+    return contBefore(code)
+  }
+  function contBefore(code) {
+    return effects.attempt(blockQuote, ok, nok)(code)
+  }
+}
+function exit$1(effects) {
+  effects.exit('blockQuote');
+}
+
+const characterEscape = {
+  name: 'characterEscape',
+  tokenize: tokenizeCharacterEscape
+};
+function tokenizeCharacterEscape(effects, ok, nok) {
+  return start
+  function start(code) {
+    effects.enter('characterEscape');
+    effects.enter('escapeMarker');
+    effects.consume(code);
+    effects.exit('escapeMarker');
+    return inside
+  }
+  function inside(code) {
+    if (asciiPunctuation(code)) {
+      effects.enter('characterEscapeValue');
+      effects.consume(code);
+      effects.exit('characterEscapeValue');
+      effects.exit('characterEscape');
+      return ok
+    }
+    return nok(code)
+  }
 }
 
 const characterReference = {
@@ -4731,16 +4761,6 @@ function factoryWhitespace(effects, ok) {
   }
 }
 
-function normalizeIdentifier(value) {
-  return (
-    value
-      .replace(/[\t\n\r ]+/g, ' ')
-      .replace(/^ | $/g, '')
-      .toLowerCase()
-      .toUpperCase()
-  )
-}
-
 const definition$1 = {
   name: 'definition',
   tokenize: tokenizeDefinition
@@ -4769,7 +4789,7 @@ function tokenizeDefinition(effects, ok, nok) {
     )(code)
   }
   function labelAfter(code) {
-    identifier = normalizeIdentifier(
+    identifier = normalizeIdentifier$1(
       self.sliceSerialize(self.events[self.events.length - 1][1]).slice(1, -1)
     );
     if (code === 58) {
@@ -5914,7 +5934,7 @@ function tokenizeLabelEnd(effects, ok, nok) {
       return labelEndNok(code)
     }
     defined = self.parser.defined.includes(
-      normalizeIdentifier(
+      normalizeIdentifier$1(
         self.sliceSerialize({
           start: labelStart.end,
           end: self.now()
@@ -6043,7 +6063,7 @@ function tokenizeReferenceFull(effects, ok, nok) {
   }
   function referenceFullAfter(code) {
     return self.parser.defined.includes(
-      normalizeIdentifier(
+      normalizeIdentifier$1(
         self.sliceSerialize(self.events[self.events.length - 1][1]).slice(1, -1)
       )
     )
@@ -6184,7 +6204,7 @@ function tokenizeThematicBreak(effects, ok, nok) {
   }
 }
 
-const list$1 = {
+const list$2 = {
   name: 'list',
   tokenize: tokenizeListStart,
   continuation: {
@@ -6322,7 +6342,7 @@ function tokenizeListContinuation(effects, ok, nok) {
     self.interrupt = undefined;
     return factorySpace(
       effects,
-      effects.attempt(list$1, ok, nok),
+      effects.attempt(list$2, ok, nok),
       'linePrefix',
       self.parser.constructs.disable.null.includes('codeIndented')
         ? undefined
@@ -6972,19 +6992,19 @@ function serializeChunks(chunks, expandTabs) {
 }
 
 const document = {
-  [42]: list$1,
-  [43]: list$1,
-  [45]: list$1,
-  [48]: list$1,
-  [49]: list$1,
-  [50]: list$1,
-  [51]: list$1,
-  [52]: list$1,
-  [53]: list$1,
-  [54]: list$1,
-  [55]: list$1,
-  [56]: list$1,
-  [57]: list$1,
+  [42]: list$2,
+  [43]: list$2,
+  [45]: list$2,
+  [48]: list$2,
+  [49]: list$2,
+  [50]: list$2,
+  [51]: list$2,
+  [52]: list$2,
+  [53]: list$2,
+  [54]: list$2,
+  [55]: list$2,
+  [56]: list$2,
+  [57]: list$2,
   [62]: blockQuote
 };
 const contentInitial = {
@@ -7069,6 +7089,12 @@ function parse$1(options) {
   }
 }
 
+function postprocess(events) {
+  while (!subtokenize(events)) {
+  }
+  return events
+}
+
 const search = /[\0\t\n\r]/g;
 function preprocess() {
   let column = 1;
@@ -7083,7 +7109,11 @@ function preprocess() {
     let startPosition;
     let endPosition;
     let code;
-    value = buffer + value.toString(encoding);
+    value =
+      buffer +
+      (typeof value === 'string'
+        ? value.toString()
+        : new TextDecoder(encoding || undefined).decode(value));
     startPosition = 0;
     buffer = '';
     if (start) {
@@ -7148,30 +7178,6 @@ function preprocess() {
   }
 }
 
-function postprocess(events) {
-  while (!subtokenize(events)) {
-  }
-  return events
-}
-
-function decodeNumericCharacterReference(value, base) {
-  const code = Number.parseInt(value, base);
-  if (
-    code < 9 ||
-    code === 11 ||
-    (code > 13 && code < 32) ||
-    (code > 126 && code < 160) ||
-    (code > 55295 && code < 57344) ||
-    (code > 64975 && code < 65008)  ||
-    (code & 65535) === 65535 ||
-    (code & 65535) === 65534  ||
-    code > 1114111
-  ) {
-    return '\uFFFD'
-  }
-  return String.fromCharCode(code)
-}
-
 const characterEscapeOrReference =
   /\\([!-/:-@[-`{-~])|&(#(?:\d{1,7}|x[\da-f]{1,6})|[\da-z]{1,31});/gi;
 function decodeString(value) {
@@ -7190,44 +7196,18 @@ function decode($0, $1, $2) {
   return decodeNamedCharacterReference($2) || $0
 }
 
-function stringifyPosition$2(value) {
-  if (!value || typeof value !== 'object') {
-    return ''
-  }
-  if ('position' in value || 'type' in value) {
-    return position$2(value.position)
-  }
-  if ('start' in value || 'end' in value) {
-    return position$2(value)
-  }
-  if ('line' in value || 'column' in value) {
-    return point$4(value)
-  }
-  return ''
-}
-function point$4(point) {
-  return index$2(point && point.line) + ':' + index$2(point && point.column)
-}
-function position$2(pos) {
-  return point$4(pos && pos.start) + '-' + point$4(pos && pos.end)
-}
-function index$2(value) {
-  return value && typeof value === 'number' ? value : 1
-}
-
 const own$4 = {}.hasOwnProperty;
-const fromMarkdown =
-  function (value, encoding, options) {
-    if (typeof encoding !== 'string') {
-      options = encoding;
-      encoding = undefined;
-    }
-    return compiler(options)(
-      postprocess(
-        parse$1(options).document().write(preprocess()(value, encoding, true))
-      )
+function fromMarkdown(value, encoding, options) {
+  if (typeof encoding !== 'string') {
+    options = encoding;
+    encoding = undefined;
+  }
+  return compiler(options)(
+    postprocess(
+      parse$1(options).document().write(preprocess()(value, encoding, true))
     )
-  };
+  )
+}
 function compiler(options) {
   const config = {
     transforms: [],
@@ -7342,8 +7322,7 @@ function compiler(options) {
       exit,
       buffer,
       resume,
-      setData,
-      getData
+      data
     };
     const listStack = [];
     let index = -1;
@@ -7416,37 +7395,42 @@ function compiler(options) {
     let atMarker;
     while (++index <= length) {
       const event = events[index];
-      if (
-        event[1].type === 'listUnordered' ||
-        event[1].type === 'listOrdered' ||
-        event[1].type === 'blockQuote'
-      ) {
-        if (event[0] === 'enter') {
-          containerBalance++;
-        } else {
-          containerBalance--;
+      switch (event[1].type) {
+        case 'listUnordered':
+        case 'listOrdered':
+        case 'blockQuote': {
+          if (event[0] === 'enter') {
+            containerBalance++;
+          } else {
+            containerBalance--;
+          }
+          atMarker = undefined;
+          break
         }
-        atMarker = undefined;
-      } else if (event[1].type === 'lineEndingBlank') {
-        if (event[0] === 'enter') {
-          if (
-            listItem &&
-            !atMarker &&
-            !containerBalance &&
-            !firstBlankLineIndex
-          ) {
-            firstBlankLineIndex = index;
+        case 'lineEndingBlank': {
+          if (event[0] === 'enter') {
+            if (
+              listItem &&
+              !atMarker &&
+              !containerBalance &&
+              !firstBlankLineIndex
+            ) {
+              firstBlankLineIndex = index;
+            }
+            atMarker = undefined;
           }
+          break
+        }
+        case 'linePrefix':
+        case 'listItemValue':
+        case 'listItemMarker':
+        case 'listItemPrefix':
+        case 'listItemPrefixWhitespace': {
+          break
+        }
+        default: {
           atMarker = undefined;
         }
-      } else if (
-        event[1].type === 'linePrefix' ||
-        event[1].type === 'listItemValue' ||
-        event[1].type === 'listItemMarker' ||
-        event[1].type === 'listItemPrefix' ||
-        event[1].type === 'listItemPrefixWhitespace'
-      ) ; else {
-        atMarker = undefined;
       }
       if (
         (!containerBalance &&
@@ -7498,13 +7482,14 @@ function compiler(options) {
           length++;
         }
         if (event[1].type === 'listItemPrefix') {
-          listItem = {
+          const item = {
             type: 'listItem',
             _spread: false,
             start: Object.assign({}, event[1].start),
             end: undefined
           };
-          events.splice(index, 0, ['enter', listItem, event[2]]);
+          listItem = item;
+          events.splice(index, 0, ['enter', item, event[2]]);
           index++;
           length++;
           firstBlankLineIndex = undefined;
@@ -7515,12 +7500,6 @@ function compiler(options) {
     events[start][1]._spread = listSpread;
     return length
   }
-  function setData(key, value) {
-    data[key] = value;
-  }
-  function getData(key) {
-    return data[key]
-  }
   function opener(create, and) {
     return open
     function open(token) {
@@ -7536,13 +7515,14 @@ function compiler(options) {
   }
   function enter(node, token, errorHandler) {
     const parent = this.stack[this.stack.length - 1];
-    parent.children.push(node);
+    const siblings = parent.children;
+    siblings.push(node);
     this.stack.push(node);
     this.tokenStack.push([token, errorHandler]);
     node.position = {
-      start: point$3(token.start)
+      start: point$3(token.start),
+      end: undefined
     };
-    return node
   }
   function closer(and) {
     return close
@@ -7574,19 +7554,18 @@ function compiler(options) {
       }
     }
     node.position.end = point$3(token.end);
-    return node
   }
   function resume() {
-    return toString(this.stack.pop())
+    return toString$2(this.stack.pop())
   }
   function onenterlistordered() {
-    setData('expectingFirstListItemValue', true);
+    this.data.expectingFirstListItemValue = true;
   }
   function onenterlistitemvalue(token) {
-    if (getData('expectingFirstListItemValue')) {
+    if (this.data.expectingFirstListItemValue) {
       const ancestor = this.stack[this.stack.length - 2];
       ancestor.start = Number.parseInt(this.sliceSerialize(token), 10);
-      setData('expectingFirstListItemValue');
+      this.data.expectingFirstListItemValue = undefined;
     }
   }
   function onexitcodefencedfenceinfo() {
@@ -7600,15 +7579,15 @@ function compiler(options) {
     node.meta = data;
   }
   function onexitcodefencedfence() {
-    if (getData('flowCodeInside')) return
+    if (this.data.flowCodeInside) return
     this.buffer();
-    setData('flowCodeInside', true);
+    this.data.flowCodeInside = true;
   }
   function onexitcodefenced() {
     const data = this.resume();
     const node = this.stack[this.stack.length - 1];
     node.value = data.replace(/^(\r?\n|\r)|(\r?\n|\r)$/g, '');
-    setData('flowCodeInside');
+    this.data.flowCodeInside = undefined;
   }
   function onexitcodeindented() {
     const data = this.resume();
@@ -7619,7 +7598,7 @@ function compiler(options) {
     const label = this.resume();
     const node = this.stack[this.stack.length - 1];
     node.label = label;
-    node.identifier = normalizeIdentifier(
+    node.identifier = normalizeIdentifier$1(
       this.sliceSerialize(token)
     ).toLowerCase();
   }
@@ -7641,24 +7620,26 @@ function compiler(options) {
     }
   }
   function onexitsetextheadingtext() {
-    setData('setextHeadingSlurpLineEnding', true);
+    this.data.setextHeadingSlurpLineEnding = true;
   }
   function onexitsetextheadinglinesequence(token) {
     const node = this.stack[this.stack.length - 1];
-    node.depth = this.sliceSerialize(token).charCodeAt(0) === 61 ? 1 : 2;
+    node.depth = this.sliceSerialize(token).codePointAt(0) === 61 ? 1 : 2;
   }
   function onexitsetextheading() {
-    setData('setextHeadingSlurpLineEnding');
+    this.data.setextHeadingSlurpLineEnding = undefined;
   }
   function onenterdata(token) {
     const node = this.stack[this.stack.length - 1];
-    let tail = node.children[node.children.length - 1];
+    const siblings = node.children;
+    let tail = siblings[siblings.length - 1];
     if (!tail || tail.type !== 'text') {
       tail = text();
       tail.position = {
-        start: point$3(token.start)
+        start: point$3(token.start),
+        end: undefined
       };
-      node.children.push(tail);
+      siblings.push(tail);
     }
     this.stack.push(tail);
   }
@@ -7669,14 +7650,14 @@ function compiler(options) {
   }
   function onexitlineending(token) {
     const context = this.stack[this.stack.length - 1];
-    if (getData('atHardBreak')) {
+    if (this.data.atHardBreak) {
       const tail = context.children[context.children.length - 1];
       tail.position.end = point$3(token.end);
-      setData('atHardBreak');
+      this.data.atHardBreak = undefined;
       return
     }
     if (
-      !getData('setextHeadingSlurpLineEnding') &&
+      !this.data.setextHeadingSlurpLineEnding &&
       config.canContainEols.includes(context.type)
     ) {
       onenterdata.call(this, token);
@@ -7684,7 +7665,7 @@ function compiler(options) {
     }
   }
   function onexithardbreak() {
-    setData('atHardBreak', true);
+    this.data.atHardBreak = true;
   }
   function onexithtmlflow() {
     const data = this.resume();
@@ -7703,8 +7684,8 @@ function compiler(options) {
   }
   function onexitlink() {
     const node = this.stack[this.stack.length - 1];
-    if (getData('inReference')) {
-      const referenceType = getData('referenceType') || 'shortcut';
+    if (this.data.inReference) {
+      const referenceType = this.data.referenceType || 'shortcut';
       node.type += 'Reference';
       node.referenceType = referenceType;
       delete node.url;
@@ -7713,12 +7694,12 @@ function compiler(options) {
       delete node.identifier;
       delete node.label;
     }
-    setData('referenceType');
+    this.data.referenceType = undefined;
   }
   function onexitimage() {
     const node = this.stack[this.stack.length - 1];
-    if (getData('inReference')) {
-      const referenceType = getData('referenceType') || 'shortcut';
+    if (this.data.inReference) {
+      const referenceType = this.data.referenceType || 'shortcut';
       node.type += 'Reference';
       node.referenceType = referenceType;
       delete node.url;
@@ -7727,19 +7708,19 @@ function compiler(options) {
       delete node.identifier;
       delete node.label;
     }
-    setData('referenceType');
+    this.data.referenceType = undefined;
   }
   function onexitlabeltext(token) {
     const string = this.sliceSerialize(token);
     const ancestor = this.stack[this.stack.length - 2];
     ancestor.label = decodeString(string);
-    ancestor.identifier = normalizeIdentifier(string).toLowerCase();
+    ancestor.identifier = normalizeIdentifier$1(string).toLowerCase();
   }
   function onexitlabel() {
     const fragment = this.stack[this.stack.length - 1];
     const value = this.resume();
     const node = this.stack[this.stack.length - 1];
-    setData('inReference', true);
+    this.data.inReference = true;
     if (node.type === 'link') {
       const children = fragment.children;
       node.children = children;
@@ -7758,33 +7739,33 @@ function compiler(options) {
     node.title = data;
   }
   function onexitresource() {
-    setData('inReference');
+    this.data.inReference = undefined;
   }
   function onenterreference() {
-    setData('referenceType', 'collapsed');
+    this.data.referenceType = 'collapsed';
   }
   function onexitreferencestring(token) {
     const label = this.resume();
     const node = this.stack[this.stack.length - 1];
     node.label = label;
-    node.identifier = normalizeIdentifier(
+    node.identifier = normalizeIdentifier$1(
       this.sliceSerialize(token)
     ).toLowerCase();
-    setData('referenceType', 'full');
+    this.data.referenceType = 'full';
   }
   function onexitcharacterreferencemarker(token) {
-    setData('characterReferenceType', token.type);
+    this.data.characterReferenceType = token.type;
   }
   function onexitcharacterreferencevalue(token) {
     const data = this.sliceSerialize(token);
-    const type = getData('characterReferenceType');
+    const type = this.data.characterReferenceType;
     let value;
     if (type) {
       value = decodeNumericCharacterReference(
         data,
         type === 'characterReferenceMarkerNumeric' ? 10 : 16
       );
-      setData('characterReferenceType');
+      this.data.characterReferenceType = undefined;
     } else {
       const result = decodeNamedCharacterReference(data);
       value = result;
@@ -7841,7 +7822,7 @@ function compiler(options) {
   function heading() {
     return {
       type: 'heading',
-      depth: undefined,
+      depth: 0,
       children: []
     }
   }
@@ -7935,20 +7916,28 @@ function extension(combined, extension) {
   let key;
   for (key in extension) {
     if (own$4.call(extension, key)) {
-      if (key === 'canContainEols') {
-        const right = extension[key];
-        if (right) {
-          combined[key].push(...right);
+      switch (key) {
+        case 'canContainEols': {
+          const right = extension[key];
+          if (right) {
+            combined[key].push(...right);
+          }
+          break
         }
-      } else if (key === 'transforms') {
-        const right = extension[key];
-        if (right) {
-          combined[key].push(...right);
+        case 'transforms': {
+          const right = extension[key];
+          if (right) {
+            combined[key].push(...right);
+          }
+          break
         }
-      } else if (key === 'enter' || key === 'exit') {
-        const right = extension[key];
-        if (right) {
-          Object.assign(combined[key], right);
+        case 'enter':
+        case 'exit': {
+          const right = extension[key];
+          if (right) {
+            Object.assign(combined[key], right);
+          }
+          break
         }
       }
     }
@@ -7988,17 +7977,16 @@ function defaultOnError(left, right) {
 }
 
 function remarkParse(options) {
-  const parser = (doc) => {
-    const settings =  (this.data('settings'));
-    return fromMarkdown(
-      doc,
-      Object.assign({}, settings, options, {
-        extensions: this.data('micromarkExtensions') || [],
-        mdastExtensions: this.data('fromMarkdownExtensions') || []
-      })
-    )
-  };
-  Object.assign(this, {Parser: parser});
+  const self = this;
+  self.parser = parser;
+  function parser(doc) {
+    return fromMarkdown(doc, {
+      ...self.data('settings'),
+      ...options,
+      extensions: self.data('micromarkExtensions') || [],
+      mdastExtensions: self.data('fromMarkdownExtensions') || []
+    })
+  }
 }
 
 const own$3 = {}.hasOwnProperty;
@@ -8021,6 +8009,7 @@ function zwitch(key, options) {
   return one
 }
 
+const own$2 = {}.hasOwnProperty;
 function configure(base, extension) {
   let index = -1;
   let key;
@@ -8030,16 +8019,41 @@ function configure(base, extension) {
     }
   }
   for (key in extension) {
-    if (key === 'extensions') ; else if (key === 'unsafe' || key === 'join') {
-      base[key] = [...(base[key] || []), ...(extension[key] || [])];
-    } else if (key === 'handlers') {
-      base[key] = Object.assign(base[key], extension[key] || {});
-    } else {
-      base.options[key] = extension[key];
+    if (own$2.call(extension, key)) {
+      switch (key) {
+        case 'extensions': {
+          break
+        }
+        case 'unsafe': {
+          list$1(base[key], extension[key]);
+          break
+        }
+        case 'join': {
+          list$1(base[key], extension[key]);
+          break
+        }
+        case 'handlers': {
+          map$4(base[key], extension[key]);
+          break
+        }
+        default: {
+          base.options[key] = extension[key];
+        }
+      }
     }
   }
   return base
 }
+function list$1(left, right) {
+  if (right) {
+    left.push(...right);
+  }
+}
+function map$4(left, right) {
+  if (right) {
+    Object.assign(left, right);
+  }
+}
 
 function blockquote(node, _, state, info) {
   const exit = state.enter('blockquote');
@@ -8117,7 +8131,7 @@ function longestStreak(value, substring) {
 
 function formatCodeAsIndented(node, state) {
   return Boolean(
-    !state.options.fences &&
+    state.options.fences === false &&
       node.value &&
       !node.lang &&
       /[^ \r\n]/.test(node.value) &&
@@ -8287,176 +8301,196 @@ function emphasisPeek(_, _1, state) {
   return state.options.emphasis || '*'
 }
 
-const convert =
+const convert$A =
   (
     function (test) {
-      if (test === undefined || test === null) {
-        return ok
+      if (test === null || test === undefined) {
+        return ok$A
       }
-      if (typeof test === 'string') {
-        return typeFactory(test)
+      if (typeof test === 'function') {
+        return castFactory$A(test)
       }
       if (typeof test === 'object') {
-        return Array.isArray(test) ? anyFactory(test) : propsFactory(test)
+        return Array.isArray(test) ? anyFactory$A(test) : propsFactory$A(test)
       }
-      if (typeof test === 'function') {
-        return castFactory(test)
+      if (typeof test === 'string') {
+        return typeFactory$A(test)
       }
       throw new Error('Expected function, string, or object as test')
     }
   );
-function anyFactory(tests) {
+function anyFactory$A(tests) {
   const checks = [];
   let index = -1;
   while (++index < tests.length) {
-    checks[index] = convert(tests[index]);
+    checks[index] = convert$A(tests[index]);
   }
-  return castFactory(any)
+  return castFactory$A(any)
   function any(...parameters) {
     let index = -1;
     while (++index < checks.length) {
-      if (checks[index].call(this, ...parameters)) return true
+      if (checks[index].apply(this, parameters)) return true
     }
     return false
   }
 }
-function propsFactory(check) {
-  return castFactory(all)
+function propsFactory$A(check) {
+  const checkAsRecord =  (check);
+  return castFactory$A(all)
   function all(node) {
+    const nodeAsRecord =  (
+       (node)
+    );
     let key;
     for (key in check) {
-      if (node[key] !== check[key]) return false
+      if (nodeAsRecord[key] !== checkAsRecord[key]) return false
     }
     return true
   }
 }
-function typeFactory(check) {
-  return castFactory(type)
+function typeFactory$A(check) {
+  return castFactory$A(type)
   function type(node) {
     return node && node.type === check
   }
 }
-function castFactory(check) {
-  return assertion
-  function assertion(node, ...parameters) {
+function castFactory$A(testFunction) {
+  return check
+  function check(value, index, parent) {
     return Boolean(
-      node &&
-        typeof node === 'object' &&
-        'type' in node &&
-        Boolean(check.call(this, node, ...parameters))
+      looksLikeANode(value) &&
+        testFunction.call(
+          this,
+          value,
+          typeof index === 'number' ? index : undefined,
+          parent || undefined
+        )
     )
   }
 }
-function ok() {
+function ok$A() {
   return true
 }
+function looksLikeANode(value) {
+  return value !== null && typeof value === 'object' && 'type' in value
+}
 
-function color$2(d) {
+function color$B(d) {
   return '\u001B[33m' + d + '\u001B[39m'
 }
 
-const CONTINUE$1 = true;
-const EXIT$1 = false;
-const SKIP$1 = 'skip';
-const visitParents$1 =
-  (
-    function (tree, test, visitor, reverse) {
-      if (typeof test === 'function' && typeof visitor !== 'function') {
-        reverse = visitor;
-        visitor = test;
-        test = null;
-      }
-      const is = convert(test);
-      const step = reverse ? -1 : 1;
-      factory(tree, undefined, [])();
-      function factory(node, index, parents) {
-        const value = node && typeof node === 'object' ? node : {};
-        if (typeof value.type === 'string') {
-          const name =
-            typeof value.tagName === 'string'
-              ? value.tagName
-              :
-              typeof value.name === 'string'
-              ? value.name
-              : undefined;
-          Object.defineProperty(visit, 'name', {
-            value:
-              'node (' + color$2(node.type + (name ? '<' + name + '>' : '')) + ')'
-          });
+const empty = [];
+const CONTINUE$A = true;
+const EXIT$A = false;
+const SKIP$A = 'skip';
+function visitParents$A(tree, test, visitor, reverse) {
+  let check;
+  if (typeof test === 'function' && typeof visitor !== 'function') {
+    reverse = visitor;
+    visitor = test;
+  } else {
+    check = test;
+  }
+  const is = convert$A(check);
+  const step = reverse ? -1 : 1;
+  factory(tree, undefined, [])();
+  function factory(node, index, parents) {
+    const value =  (
+      node && typeof node === 'object' ? node : {}
+    );
+    if (typeof value.type === 'string') {
+      const name =
+        typeof value.tagName === 'string'
+          ? value.tagName
+          :
+          typeof value.name === 'string'
+          ? value.name
+          : undefined;
+      Object.defineProperty(visit, 'name', {
+        value:
+          'node (' + color$B(node.type + (name ? '<' + name + '>' : '')) + ')'
+      });
+    }
+    return visit
+    function visit() {
+      let result = empty;
+      let subresult;
+      let offset;
+      let grandparents;
+      if (!test || is(node, index, parents[parents.length - 1] || undefined)) {
+        result = toResult$A(visitor(node, parents));
+        if (result[0] === EXIT$A) {
+          return result
         }
-        return visit
-        function visit() {
-          let result = [];
-          let subresult;
-          let offset;
-          let grandparents;
-          if (!test || is(node, index, parents[parents.length - 1] || null)) {
-            result = toResult$1(visitor(node, parents));
-            if (result[0] === EXIT$1) {
-              return result
-            }
-          }
-          if (node.children && result[0] !== SKIP$1) {
-            offset = (reverse ? node.children.length : -1) + step;
-            grandparents = parents.concat(node);
-            while (offset > -1 && offset < node.children.length) {
-              subresult = factory(node.children[offset], offset, grandparents)();
-              if (subresult[0] === EXIT$1) {
-                return subresult
-              }
-              offset =
-                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+      }
+      if ('children' in node && node.children) {
+        const nodeAsParent =  (node);
+        if (nodeAsParent.children && result[0] !== SKIP$A) {
+          offset = (reverse ? nodeAsParent.children.length : -1) + step;
+          grandparents = parents.concat(nodeAsParent);
+          while (offset > -1 && offset < nodeAsParent.children.length) {
+            const child = nodeAsParent.children[offset];
+            subresult = factory(child, offset, grandparents)();
+            if (subresult[0] === EXIT$A) {
+              return subresult
             }
+            offset =
+              typeof subresult[1] === 'number' ? subresult[1] : offset + step;
           }
-          return result
         }
       }
+      return result
     }
-  );
-function toResult$1(value) {
+  }
+}
+function toResult$A(value) {
   if (Array.isArray(value)) {
     return value
   }
   if (typeof value === 'number') {
-    return [CONTINUE$1, value]
+    return [CONTINUE$A, value]
   }
-  return [value]
+  return value === null || value === undefined ? empty : [value]
 }
 
-const visit$1 =
-  (
-    function (tree, test, visitor, reverse) {
-      if (typeof test === 'function' && typeof visitor !== 'function') {
-        reverse = visitor;
-        visitor = test;
-        test = null;
-      }
-      visitParents$1(tree, test, overload, reverse);
-      function overload(node, parents) {
-        const parent = parents[parents.length - 1];
-        return visitor(
-          node,
-          parent ? parent.children.indexOf(node) : null,
-          parent
-        )
-      }
-    }
-  );
+function visit$A(tree, testOrVisitor, visitorOrReverse, maybeReverse) {
+  let reverse;
+  let test;
+  let visitor;
+  if (
+    typeof testOrVisitor === 'function' &&
+    typeof visitorOrReverse !== 'function'
+  ) {
+    test = undefined;
+    visitor = testOrVisitor;
+    reverse = visitorOrReverse;
+  } else {
+    test = testOrVisitor;
+    visitor = visitorOrReverse;
+    reverse = maybeReverse;
+  }
+  visitParents$A(tree, test, overload, reverse);
+  function overload(node, parents) {
+    const parent = parents[parents.length - 1];
+    const index = parent ? parent.children.indexOf(node) : undefined;
+    return visitor(node, index, parent)
+  }
+}
 
 function formatHeadingAsSetext(node, state) {
   let literalWithBreak = false;
-  visit$1(node, (node) => {
+  visit$A(node, function (node) {
     if (
       ('value' in node && /\r?\n|\r/.test(node.value)) ||
       node.type === 'break'
     ) {
       literalWithBreak = true;
-      return EXIT$1
+      return EXIT$A
     }
   });
   return Boolean(
     (!node.depth || node.depth < 3) &&
-      toString(node) &&
+      toString$2(node) &&
       (state.options.setext || literalWithBreak)
   )
 }
@@ -8516,16 +8550,183 @@ function htmlPeek() {
   return '<'
 }
 
-image.peek = imagePeek;
-function image(node, _, state, info) {
+image.peek = imagePeek;
+function image(node, _, state, info) {
+  const quote = checkQuote(state);
+  const suffix = quote === '"' ? 'Quote' : 'Apostrophe';
+  const exit = state.enter('image');
+  let subexit = state.enter('label');
+  const tracker = state.createTracker(info);
+  let value = tracker.move('![');
+  value += tracker.move(
+    state.safe(node.alt, {before: value, after: ']', ...tracker.current()})
+  );
+  value += tracker.move('](');
+  subexit();
+  if (
+    (!node.url && node.title) ||
+    /[\0- \u007F]/.test(node.url)
+  ) {
+    subexit = state.enter('destinationLiteral');
+    value += tracker.move('<');
+    value += tracker.move(
+      state.safe(node.url, {before: value, after: '>', ...tracker.current()})
+    );
+    value += tracker.move('>');
+  } else {
+    subexit = state.enter('destinationRaw');
+    value += tracker.move(
+      state.safe(node.url, {
+        before: value,
+        after: node.title ? ' ' : ')',
+        ...tracker.current()
+      })
+    );
+  }
+  subexit();
+  if (node.title) {
+    subexit = state.enter(`title${suffix}`);
+    value += tracker.move(' ' + quote);
+    value += tracker.move(
+      state.safe(node.title, {
+        before: value,
+        after: quote,
+        ...tracker.current()
+      })
+    );
+    value += tracker.move(quote);
+    subexit();
+  }
+  value += tracker.move(')');
+  exit();
+  return value
+}
+function imagePeek() {
+  return '!'
+}
+
+imageReference.peek = imageReferencePeek;
+function imageReference(node, _, state, info) {
+  const type = node.referenceType;
+  const exit = state.enter('imageReference');
+  let subexit = state.enter('label');
+  const tracker = state.createTracker(info);
+  let value = tracker.move('![');
+  const alt = state.safe(node.alt, {
+    before: value,
+    after: ']',
+    ...tracker.current()
+  });
+  value += tracker.move(alt + '][');
+  subexit();
+  const stack = state.stack;
+  state.stack = [];
+  subexit = state.enter('reference');
+  const reference = state.safe(state.associationId(node), {
+    before: value,
+    after: ']',
+    ...tracker.current()
+  });
+  subexit();
+  state.stack = stack;
+  exit();
+  if (type === 'full' || !alt || alt !== reference) {
+    value += tracker.move(reference + ']');
+  } else if (type === 'shortcut') {
+    value = value.slice(0, -1);
+  } else {
+    value += tracker.move(']');
+  }
+  return value
+}
+function imageReferencePeek() {
+  return '!'
+}
+
+inlineCode.peek = inlineCodePeek;
+function inlineCode(node, _, state) {
+  let value = node.value || '';
+  let sequence = '`';
+  let index = -1;
+  while (new RegExp('(^|[^`])' + sequence + '([^`]|$)').test(value)) {
+    sequence += '`';
+  }
+  if (
+    /[^ \r\n]/.test(value) &&
+    ((/^[ \r\n]/.test(value) && /[ \r\n]$/.test(value)) || /^`|`$/.test(value))
+  ) {
+    value = ' ' + value + ' ';
+  }
+  while (++index < state.unsafe.length) {
+    const pattern = state.unsafe[index];
+    const expression = state.compilePattern(pattern);
+    let match;
+    if (!pattern.atBreak) continue
+    while ((match = expression.exec(value))) {
+      let position = match.index;
+      if (
+        value.charCodeAt(position) === 10  &&
+        value.charCodeAt(position - 1) === 13
+      ) {
+        position--;
+      }
+      value = value.slice(0, position) + ' ' + value.slice(match.index + 1);
+    }
+  }
+  return sequence + value + sequence
+}
+function inlineCodePeek() {
+  return '`'
+}
+
+function formatLinkAsAutolink(node, state) {
+  const raw = toString$2(node);
+  return Boolean(
+    !state.options.resourceLink &&
+      node.url &&
+      !node.title &&
+      node.children &&
+      node.children.length === 1 &&
+      node.children[0].type === 'text' &&
+      (raw === node.url || 'mailto:' + raw === node.url) &&
+      /^[a-z][a-z+.-]+:/i.test(node.url) &&
+      !/[\0- <>\u007F]/.test(node.url)
+  )
+}
+
+link.peek = linkPeek;
+function link(node, _, state, info) {
   const quote = checkQuote(state);
   const suffix = quote === '"' ? 'Quote' : 'Apostrophe';
-  const exit = state.enter('image');
-  let subexit = state.enter('label');
   const tracker = state.createTracker(info);
-  let value = tracker.move('![');
+  let exit;
+  let subexit;
+  if (formatLinkAsAutolink(node, state)) {
+    const stack = state.stack;
+    state.stack = [];
+    exit = state.enter('autolink');
+    let value = tracker.move('<');
+    value += tracker.move(
+      state.containerPhrasing(node, {
+        before: value,
+        after: '>',
+        ...tracker.current()
+      })
+    );
+    value += tracker.move('>');
+    exit();
+    state.stack = stack;
+    return value
+  }
+  exit = state.enter('link');
+  subexit = state.enter('label');
+  let value = tracker.move('[');
   value += tracker.move(
-    state.safe(node.alt, {before: value, after: ']', ...tracker.current()})
+    state.containerPhrasing(node, {
+      before: value,
+      after: '](',
+      ...tracker.current()
+    })
   );
   value += tracker.move('](');
   subexit();
@@ -8567,23 +8768,23 @@ function image(node, _, state, info) {
   exit();
   return value
 }
-function imagePeek() {
-  return '!'
+function linkPeek(node, _, state) {
+  return formatLinkAsAutolink(node, state) ? '<' : '['
 }
 
-imageReference.peek = imageReferencePeek;
-function imageReference(node, _, state, info) {
+linkReference.peek = linkReferencePeek;
+function linkReference(node, _, state, info) {
   const type = node.referenceType;
-  const exit = state.enter('imageReference');
+  const exit = state.enter('linkReference');
   let subexit = state.enter('label');
   const tracker = state.createTracker(info);
-  let value = tracker.move('![');
-  const alt = state.safe(node.alt, {
+  let value = tracker.move('[');
+  const text = state.containerPhrasing(node, {
     before: value,
     after: ']',
     ...tracker.current()
   });
-  value += tracker.move(alt + '][');
+  value += tracker.move(text + '][');
   subexit();
   const stack = state.stack;
   state.stack = [];
@@ -8596,7 +8797,7 @@ function imageReference(node, _, state, info) {
   subexit();
   state.stack = stack;
   exit();
-  if (type === 'full' || !alt || alt !== reference) {
+  if (type === 'full' || !text || text !== reference) {
     value += tracker.move(reference + ']');
   } else if (type === 'shortcut') {
     value = value.slice(0, -1);
@@ -8605,966 +8806,1609 @@ function imageReference(node, _, state, info) {
   }
   return value
 }
-function imageReferencePeek() {
-  return '!'
+function linkReferencePeek() {
+  return '['
 }
 
-function patternCompile(pattern) {
-  if (!pattern._compiled) {
-    const before =
-      (pattern.atBreak ? '[\\r\\n][\\t ]*' : '') +
-      (pattern.before ? '(?:' + pattern.before + ')' : '');
-    pattern._compiled = new RegExp(
-      (before ? '(' + before + ')' : '') +
-        (/[|\\{}()[\]^$+*?.-]/.test(pattern.character) ? '\\' : '') +
-        pattern.character +
-        (pattern.after ? '(?:' + pattern.after + ')' : ''),
-      'g'
-    );
+function checkBullet(state) {
+  const marker = state.options.bullet || '*';
+  if (marker !== '*' && marker !== '+' && marker !== '-') {
+    throw new Error(
+      'Cannot serialize items with `' +
+        marker +
+        '` for `options.bullet`, expected `*`, `+`, or `-`'
+    )
   }
-  return pattern._compiled
+  return marker
 }
 
-inlineCode.peek = inlineCodePeek;
-function inlineCode(node, _, state) {
-  let value = node.value || '';
-  let sequence = '`';
-  let index = -1;
-  while (new RegExp('(^|[^`])' + sequence + '([^`]|$)').test(value)) {
-    sequence += '`';
+function checkBulletOther(state) {
+  const bullet = checkBullet(state);
+  const bulletOther = state.options.bulletOther;
+  if (!bulletOther) {
+    return bullet === '*' ? '-' : '*'
+  }
+  if (bulletOther !== '*' && bulletOther !== '+' && bulletOther !== '-') {
+    throw new Error(
+      'Cannot serialize items with `' +
+        bulletOther +
+        '` for `options.bulletOther`, expected `*`, `+`, or `-`'
+    )
+  }
+  if (bulletOther === bullet) {
+    throw new Error(
+      'Expected `bullet` (`' +
+        bullet +
+        '`) and `bulletOther` (`' +
+        bulletOther +
+        '`) to be different'
+    )
+  }
+  return bulletOther
+}
+
+function checkBulletOrdered(state) {
+  const marker = state.options.bulletOrdered || '.';
+  if (marker !== '.' && marker !== ')') {
+    throw new Error(
+      'Cannot serialize items with `' +
+        marker +
+        '` for `options.bulletOrdered`, expected `.` or `)`'
+    )
+  }
+  return marker
+}
+
+function checkRule(state) {
+  const marker = state.options.rule || '*';
+  if (marker !== '*' && marker !== '-' && marker !== '_') {
+    throw new Error(
+      'Cannot serialize rules with `' +
+        marker +
+        '` for `options.rule`, expected `*`, `-`, or `_`'
+    )
+  }
+  return marker
+}
+
+function list(node, parent, state, info) {
+  const exit = state.enter('list');
+  const bulletCurrent = state.bulletCurrent;
+  let bullet = node.ordered ? checkBulletOrdered(state) : checkBullet(state);
+  const bulletOther = node.ordered
+    ? bullet === '.'
+      ? ')'
+      : '.'
+    : checkBulletOther(state);
+  let useDifferentMarker =
+    parent && state.bulletLastUsed ? bullet === state.bulletLastUsed : false;
+  if (!node.ordered) {
+    const firstListItem = node.children ? node.children[0] : undefined;
+    if (
+      (bullet === '*' || bullet === '-') &&
+      firstListItem &&
+      (!firstListItem.children || !firstListItem.children[0]) &&
+      state.stack[state.stack.length - 1] === 'list' &&
+      state.stack[state.stack.length - 2] === 'listItem' &&
+      state.stack[state.stack.length - 3] === 'list' &&
+      state.stack[state.stack.length - 4] === 'listItem' &&
+      state.indexStack[state.indexStack.length - 1] === 0 &&
+      state.indexStack[state.indexStack.length - 2] === 0 &&
+      state.indexStack[state.indexStack.length - 3] === 0
+    ) {
+      useDifferentMarker = true;
+    }
+    if (checkRule(state) === bullet && firstListItem) {
+      let index = -1;
+      while (++index < node.children.length) {
+        const item = node.children[index];
+        if (
+          item &&
+          item.type === 'listItem' &&
+          item.children &&
+          item.children[0] &&
+          item.children[0].type === 'thematicBreak'
+        ) {
+          useDifferentMarker = true;
+          break
+        }
+      }
+    }
+  }
+  if (useDifferentMarker) {
+    bullet = bulletOther;
+  }
+  state.bulletCurrent = bullet;
+  const value = state.containerFlow(node, info);
+  state.bulletLastUsed = bullet;
+  state.bulletCurrent = bulletCurrent;
+  exit();
+  return value
+}
+
+function checkListItemIndent(state) {
+  const style = state.options.listItemIndent || 'one';
+  if (style !== 'tab' && style !== 'one' && style !== 'mixed') {
+    throw new Error(
+      'Cannot serialize items with `' +
+        style +
+        '` for `options.listItemIndent`, expected `tab`, `one`, or `mixed`'
+    )
   }
+  return style
+}
+
+function listItem(node, parent, state, info) {
+  const listItemIndent = checkListItemIndent(state);
+  let bullet = state.bulletCurrent || checkBullet(state);
+  if (parent && parent.type === 'list' && parent.ordered) {
+    bullet =
+      (typeof parent.start === 'number' && parent.start > -1
+        ? parent.start
+        : 1) +
+      (state.options.incrementListMarker === false
+        ? 0
+        : parent.children.indexOf(node)) +
+      bullet;
+  }
+  let size = bullet.length + 1;
   if (
-    /[^ \r\n]/.test(value) &&
-    ((/^[ \r\n]/.test(value) && /[ \r\n]$/.test(value)) || /^`|`$/.test(value))
+    listItemIndent === 'tab' ||
+    (listItemIndent === 'mixed' &&
+      ((parent && parent.type === 'list' && parent.spread) || node.spread))
   ) {
-    value = ' ' + value + ' ';
+    size = Math.ceil(size / 4) * 4;
   }
-  while (++index < state.unsafe.length) {
-    const pattern = state.unsafe[index];
-    const expression = patternCompile(pattern);
-    let match;
-    if (!pattern.atBreak) continue
-    while ((match = expression.exec(value))) {
-      let position = match.index;
-      if (
-        value.charCodeAt(position) === 10  &&
-        value.charCodeAt(position - 1) === 13
-      ) {
-        position--;
-      }
-      value = value.slice(0, position) + ' ' + value.slice(match.index + 1);
+  const tracker = state.createTracker(info);
+  tracker.move(bullet + ' '.repeat(size - bullet.length));
+  tracker.shift(size);
+  const exit = state.enter('listItem');
+  const value = state.indentLines(
+    state.containerFlow(node, tracker.current()),
+    map
+  );
+  exit();
+  return value
+  function map(line, index, blank) {
+    if (index) {
+      return (blank ? '' : ' '.repeat(size)) + line
     }
+    return (blank ? bullet : bullet + ' '.repeat(size - bullet.length)) + line
   }
-  return sequence + value + sequence
 }
-function inlineCodePeek() {
-  return '`'
+
+function paragraph(node, _, state, info) {
+  const exit = state.enter('paragraph');
+  const subexit = state.enter('phrasing');
+  const value = state.containerPhrasing(node, info);
+  subexit();
+  exit();
+  return value
+}
+
+const phrasing =
+  (
+    convert$A([
+      'break',
+      'delete',
+      'emphasis',
+      'footnote',
+      'footnoteReference',
+      'image',
+      'imageReference',
+      'inlineCode',
+      'link',
+      'linkReference',
+      'strong',
+      'text'
+    ])
+  );
+
+function root(node, _, state, info) {
+  const hasPhrasing = node.children.some(function (d) {
+    return phrasing(d)
+  });
+  const fn = hasPhrasing ? state.containerPhrasing : state.containerFlow;
+  return fn.call(state, node, info)
 }
 
-function formatLinkAsAutolink(node, state) {
-  const raw = toString(node);
-  return Boolean(
-    !state.options.resourceLink &&
-      node.url &&
-      !node.title &&
-      node.children &&
-      node.children.length === 1 &&
-      node.children[0].type === 'text' &&
-      (raw === node.url || 'mailto:' + raw === node.url) &&
-      /^[a-z][a-z+.-]+:/i.test(node.url) &&
-      !/[\0- <>\u007F]/.test(node.url)
-  )
+function checkStrong(state) {
+  const marker = state.options.strong || '*';
+  if (marker !== '*' && marker !== '_') {
+    throw new Error(
+      'Cannot serialize strong with `' +
+        marker +
+        '` for `options.strong`, expected `*`, or `_`'
+    )
+  }
+  return marker
 }
 
-link.peek = linkPeek;
-function link(node, _, state, info) {
-  const quote = checkQuote(state);
-  const suffix = quote === '"' ? 'Quote' : 'Apostrophe';
+strong.peek = strongPeek;
+function strong(node, _, state, info) {
+  const marker = checkStrong(state);
+  const exit = state.enter('strong');
   const tracker = state.createTracker(info);
-  let exit;
-  let subexit;
-  if (formatLinkAsAutolink(node, state)) {
-    const stack = state.stack;
-    state.stack = [];
-    exit = state.enter('autolink');
-    let value = tracker.move('<');
-    value += tracker.move(
-      state.containerPhrasing(node, {
-        before: value,
-        after: '>',
-        ...tracker.current()
-      })
-    );
-    value += tracker.move('>');
-    exit();
-    state.stack = stack;
-    return value
-  }
-  exit = state.enter('link');
-  subexit = state.enter('label');
-  let value = tracker.move('[');
+  let value = tracker.move(marker + marker);
   value += tracker.move(
     state.containerPhrasing(node, {
       before: value,
-      after: '](',
+      after: marker,
       ...tracker.current()
     })
   );
-  value += tracker.move('](');
-  subexit();
+  value += tracker.move(marker + marker);
+  exit();
+  return value
+}
+function strongPeek(_, _1, state) {
+  return state.options.strong || '*'
+}
+
+function text$1(node, _, state, info) {
+  return state.safe(node.value, info)
+}
+
+function checkRuleRepetition(state) {
+  const repetition = state.options.ruleRepetition || 3;
+  if (repetition < 3) {
+    throw new Error(
+      'Cannot serialize rules with repetition `' +
+        repetition +
+        '` for `options.ruleRepetition`, expected `3` or more'
+    )
+  }
+  return repetition
+}
+
+function thematicBreak(_, _1, state) {
+  const value = (
+    checkRule(state) + (state.options.ruleSpaces ? ' ' : '')
+  ).repeat(checkRuleRepetition(state));
+  return state.options.ruleSpaces ? value.slice(0, -1) : value
+}
+
+const handle = {
+  blockquote,
+  break: hardBreak,
+  code: code$1,
+  definition,
+  emphasis,
+  hardBreak,
+  heading,
+  html,
+  image,
+  imageReference,
+  inlineCode,
+  link,
+  linkReference,
+  list,
+  listItem,
+  paragraph,
+  root,
+  strong,
+  text: text$1,
+  thematicBreak
+};
+
+const join = [joinDefaults];
+function joinDefaults(left, right, parent, state) {
   if (
-    (!node.url && node.title) ||
-    /[\0- \u007F]/.test(node.url)
+    right.type === 'code' &&
+    formatCodeAsIndented(right, state) &&
+    (left.type === 'list' ||
+      (left.type === right.type && formatCodeAsIndented(left, state)))
   ) {
-    subexit = state.enter('destinationLiteral');
-    value += tracker.move('<');
-    value += tracker.move(
-      state.safe(node.url, {before: value, after: '>', ...tracker.current()})
-    );
-    value += tracker.move('>');
-  } else {
-    subexit = state.enter('destinationRaw');
-    value += tracker.move(
-      state.safe(node.url, {
-        before: value,
-        after: node.title ? ' ' : ')',
-        ...tracker.current()
-      })
-    );
+    return false
   }
-  subexit();
-  if (node.title) {
-    subexit = state.enter(`title${suffix}`);
-    value += tracker.move(' ' + quote);
-    value += tracker.move(
-      state.safe(node.title, {
-        before: value,
-        after: quote,
-        ...tracker.current()
-      })
-    );
-    value += tracker.move(quote);
-    subexit();
+  if ('spread' in parent && typeof parent.spread === 'boolean') {
+    if (
+      left.type === 'paragraph' &&
+      (left.type === right.type ||
+        right.type === 'definition' ||
+        (right.type === 'heading' && formatHeadingAsSetext(right, state)))
+    ) {
+      return
+    }
+    return parent.spread ? 1 : 0
   }
-  value += tracker.move(')');
-  exit();
-  return value
-}
-function linkPeek(node, _, state) {
-  return formatLinkAsAutolink(node, state) ? '<' : '['
 }
 
-linkReference.peek = linkReferencePeek;
-function linkReference(node, _, state, info) {
-  const type = node.referenceType;
-  const exit = state.enter('linkReference');
-  let subexit = state.enter('label');
-  const tracker = state.createTracker(info);
-  let value = tracker.move('[');
-  const text = state.containerPhrasing(node, {
-    before: value,
-    after: ']',
-    ...tracker.current()
-  });
-  value += tracker.move(text + '][');
-  subexit();
-  const stack = state.stack;
-  state.stack = [];
-  subexit = state.enter('reference');
-  const reference = state.safe(state.associationId(node), {
-    before: value,
-    after: ']',
-    ...tracker.current()
-  });
-  subexit();
-  state.stack = stack;
-  exit();
-  if (type === 'full' || !text || text !== reference) {
-    value += tracker.move(reference + ']');
-  } else if (type === 'shortcut') {
-    value = value.slice(0, -1);
-  } else {
-    value += tracker.move(']');
+const fullPhrasingSpans = [
+  'autolink',
+  'destinationLiteral',
+  'destinationRaw',
+  'reference',
+  'titleQuote',
+  'titleApostrophe'
+];
+const unsafe = [
+  {character: '\t', after: '[\\r\\n]', inConstruct: 'phrasing'},
+  {character: '\t', before: '[\\r\\n]', inConstruct: 'phrasing'},
+  {
+    character: '\t',
+    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedLangTilde']
+  },
+  {
+    character: '\r',
+    inConstruct: [
+      'codeFencedLangGraveAccent',
+      'codeFencedLangTilde',
+      'codeFencedMetaGraveAccent',
+      'codeFencedMetaTilde',
+      'destinationLiteral',
+      'headingAtx'
+    ]
+  },
+  {
+    character: '\n',
+    inConstruct: [
+      'codeFencedLangGraveAccent',
+      'codeFencedLangTilde',
+      'codeFencedMetaGraveAccent',
+      'codeFencedMetaTilde',
+      'destinationLiteral',
+      'headingAtx'
+    ]
+  },
+  {character: ' ', after: '[\\r\\n]', inConstruct: 'phrasing'},
+  {character: ' ', before: '[\\r\\n]', inConstruct: 'phrasing'},
+  {
+    character: ' ',
+    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedLangTilde']
+  },
+  {
+    character: '!',
+    after: '\\[',
+    inConstruct: 'phrasing',
+    notInConstruct: fullPhrasingSpans
+  },
+  {character: '"', inConstruct: 'titleQuote'},
+  {atBreak: true, character: '#'},
+  {character: '#', inConstruct: 'headingAtx', after: '(?:[\r\n]|$)'},
+  {character: '&', after: '[#A-Za-z]', inConstruct: 'phrasing'},
+  {character: "'", inConstruct: 'titleApostrophe'},
+  {character: '(', inConstruct: 'destinationRaw'},
+  {
+    before: '\\]',
+    character: '(',
+    inConstruct: 'phrasing',
+    notInConstruct: fullPhrasingSpans
+  },
+  {atBreak: true, before: '\\d+', character: ')'},
+  {character: ')', inConstruct: 'destinationRaw'},
+  {atBreak: true, character: '*', after: '(?:[ \t\r\n*])'},
+  {character: '*', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},
+  {atBreak: true, character: '+', after: '(?:[ \t\r\n])'},
+  {atBreak: true, character: '-', after: '(?:[ \t\r\n-])'},
+  {atBreak: true, before: '\\d+', character: '.', after: '(?:[ \t\r\n]|$)'},
+  {atBreak: true, character: '<', after: '[!/?A-Za-z]'},
+  {
+    character: '<',
+    after: '[!/?A-Za-z]',
+    inConstruct: 'phrasing',
+    notInConstruct: fullPhrasingSpans
+  },
+  {character: '<', inConstruct: 'destinationLiteral'},
+  {atBreak: true, character: '='},
+  {atBreak: true, character: '>'},
+  {character: '>', inConstruct: 'destinationLiteral'},
+  {atBreak: true, character: '['},
+  {character: '[', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},
+  {character: '[', inConstruct: ['label', 'reference']},
+  {character: '\\', after: '[\\r\\n]', inConstruct: 'phrasing'},
+  {character: ']', inConstruct: ['label', 'reference']},
+  {atBreak: true, character: '_'},
+  {character: '_', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},
+  {atBreak: true, character: '`'},
+  {
+    character: '`',
+    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedMetaGraveAccent']
+  },
+  {character: '`', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},
+  {atBreak: true, character: '~'}
+];
+
+function association(node) {
+  if (node.label || !node.identifier) {
+    return node.label || ''
   }
-  return value
-}
-function linkReferencePeek() {
-  return '['
+  return decodeString(node.identifier)
 }
 
-function checkBullet(state) {
-  const marker = state.options.bullet || '*';
-  if (marker !== '*' && marker !== '+' && marker !== '-') {
-    throw new Error(
-      'Cannot serialize items with `' +
-        marker +
-        '` for `options.bullet`, expected `*`, `+`, or `-`'
-    )
+function compilePattern(pattern) {
+  if (!pattern._compiled) {
+    const before =
+      (pattern.atBreak ? '[\\r\\n][\\t ]*' : '') +
+      (pattern.before ? '(?:' + pattern.before + ')' : '');
+    pattern._compiled = new RegExp(
+      (before ? '(' + before + ')' : '') +
+        (/[|\\{}()[\]^$+*?.-]/.test(pattern.character) ? '\\' : '') +
+        pattern.character +
+        (pattern.after ? '(?:' + pattern.after + ')' : ''),
+      'g'
+    );
   }
-  return marker
+  return pattern._compiled
 }
 
-function checkBulletOther(state) {
-  const bullet = checkBullet(state);
-  const bulletOther = state.options.bulletOther;
-  if (!bulletOther) {
-    return bullet === '*' ? '-' : '*'
-  }
-  if (bulletOther !== '*' && bulletOther !== '+' && bulletOther !== '-') {
-    throw new Error(
-      'Cannot serialize items with `' +
-        bulletOther +
-        '` for `options.bulletOther`, expected `*`, `+`, or `-`'
-    )
-  }
-  if (bulletOther === bullet) {
-    throw new Error(
-      'Expected `bullet` (`' +
-        bullet +
-        '`) and `bulletOther` (`' +
-        bulletOther +
-        '`) to be different'
-    )
+function containerPhrasing(parent, state, info) {
+  const indexStack = state.indexStack;
+  const children = parent.children || [];
+  const results = [];
+  let index = -1;
+  let before = info.before;
+  indexStack.push(-1);
+  let tracker = state.createTracker(info);
+  while (++index < children.length) {
+    const child = children[index];
+    let after;
+    indexStack[indexStack.length - 1] = index;
+    if (index + 1 < children.length) {
+      let handle = state.handle.handlers[children[index + 1].type];
+      if (handle && handle.peek) handle = handle.peek;
+      after = handle
+        ? handle(children[index + 1], parent, state, {
+            before: '',
+            after: '',
+            ...tracker.current()
+          }).charAt(0)
+        : '';
+    } else {
+      after = info.after;
+    }
+    if (
+      results.length > 0 &&
+      (before === '\r' || before === '\n') &&
+      child.type === 'html'
+    ) {
+      results[results.length - 1] = results[results.length - 1].replace(
+        /(\r?\n|\r)$/,
+        ' '
+      );
+      before = ' ';
+      tracker = state.createTracker(info);
+      tracker.move(results.join(''));
+    }
+    results.push(
+      tracker.move(
+        state.handle(child, parent, state, {
+          ...tracker.current(),
+          before,
+          after
+        })
+      )
+    );
+    before = results[results.length - 1].slice(-1);
   }
-  return bulletOther
+  indexStack.pop();
+  return results.join('')
 }
 
-function checkBulletOrdered(state) {
-  const marker = state.options.bulletOrdered || '.';
-  if (marker !== '.' && marker !== ')') {
-    throw new Error(
-      'Cannot serialize items with `' +
-        marker +
-        '` for `options.bulletOrdered`, expected `.` or `)`'
-    )
+function containerFlow(parent, state, info) {
+  const indexStack = state.indexStack;
+  const children = parent.children || [];
+  const tracker = state.createTracker(info);
+  const results = [];
+  let index = -1;
+  indexStack.push(-1);
+  while (++index < children.length) {
+    const child = children[index];
+    indexStack[indexStack.length - 1] = index;
+    results.push(
+      tracker.move(
+        state.handle(child, parent, state, {
+          before: '\n',
+          after: '\n',
+          ...tracker.current()
+        })
+      )
+    );
+    if (child.type !== 'list') {
+      state.bulletLastUsed = undefined;
+    }
+    if (index < children.length - 1) {
+      results.push(
+        tracker.move(between(child, children[index + 1], parent, state))
+      );
+    }
   }
-  return marker
+  indexStack.pop();
+  return results.join('')
 }
-
-function checkBulletOrderedOther(state) {
-  const bulletOrdered = checkBulletOrdered(state);
-  const bulletOrderedOther = state.options.bulletOrderedOther;
-  if (!bulletOrderedOther) {
-    return bulletOrdered === '.' ? ')' : '.'
-  }
-  if (bulletOrderedOther !== '.' && bulletOrderedOther !== ')') {
-    throw new Error(
-      'Cannot serialize items with `' +
-        bulletOrderedOther +
-        '` for `options.bulletOrderedOther`, expected `*`, `+`, or `-`'
-    )
-  }
-  if (bulletOrderedOther === bulletOrdered) {
-    throw new Error(
-      'Expected `bulletOrdered` (`' +
-        bulletOrdered +
-        '`) and `bulletOrderedOther` (`' +
-        bulletOrderedOther +
-        '`) to be different'
-    )
+function between(left, right, parent, state) {
+  let index = state.join.length;
+  while (index--) {
+    const result = state.join[index](left, right, parent, state);
+    if (result === true || result === 1) {
+      break
+    }
+    if (typeof result === 'number') {
+      return '\n'.repeat(1 + result)
+    }
+    if (result === false) {
+      return '\n\n<!---->\n\n'
+    }
   }
-  return bulletOrderedOther
+  return '\n\n'
 }
 
-function checkRule(state) {
-  const marker = state.options.rule || '*';
-  if (marker !== '*' && marker !== '-' && marker !== '_') {
-    throw new Error(
-      'Cannot serialize rules with `' +
-        marker +
-        '` for `options.rule`, expected `*`, `-`, or `_`'
-    )
+const eol$1 = /\r?\n|\r/g;
+function indentLines(value, map) {
+  const result = [];
+  let start = 0;
+  let line = 0;
+  let match;
+  while ((match = eol$1.exec(value))) {
+    one(value.slice(start, match.index));
+    result.push(match[0]);
+    start = match.index + match[0].length;
+    line++;
+  }
+  one(value.slice(start));
+  return result.join('')
+  function one(value) {
+    result.push(map(value, line, !value));
   }
-  return marker
 }
 
-function list(node, parent, state, info) {
-  const exit = state.enter('list');
-  const bulletCurrent = state.bulletCurrent;
-  let bullet = node.ordered ? checkBulletOrdered(state) : checkBullet(state);
-  const bulletOther = node.ordered
-    ? checkBulletOrderedOther(state)
-    : checkBulletOther(state);
-  const bulletLastUsed = state.bulletLastUsed;
-  let useDifferentMarker = false;
-  if (
-    parent &&
-    (node.ordered
-      ? state.options.bulletOrderedOther
-      : state.options.bulletOther) &&
-    bulletLastUsed &&
-    bullet === bulletLastUsed
-  ) {
-    useDifferentMarker = true;
+function safe(state, input, config) {
+  const value = (config.before || '') + (input || '') + (config.after || '');
+  const positions = [];
+  const result = [];
+  const infos = {};
+  let index = -1;
+  while (++index < state.unsafe.length) {
+    const pattern = state.unsafe[index];
+    if (!patternInScope(state.stack, pattern)) {
+      continue
+    }
+    const expression = state.compilePattern(pattern);
+    let match;
+    while ((match = expression.exec(value))) {
+      const before = 'before' in pattern || Boolean(pattern.atBreak);
+      const after = 'after' in pattern;
+      const position = match.index + (before ? match[1].length : 0);
+      if (positions.includes(position)) {
+        if (infos[position].before && !before) {
+          infos[position].before = false;
+        }
+        if (infos[position].after && !after) {
+          infos[position].after = false;
+        }
+      } else {
+        positions.push(position);
+        infos[position] = {before, after};
+      }
+    }
   }
-  if (!node.ordered) {
-    const firstListItem = node.children ? node.children[0] : undefined;
+  positions.sort(numerical);
+  let start = config.before ? config.before.length : 0;
+  const end = value.length - (config.after ? config.after.length : 0);
+  index = -1;
+  while (++index < positions.length) {
+    const position = positions[index];
+    if (position < start || position >= end) {
+      continue
+    }
     if (
-      (bullet === '*' || bullet === '-') &&
-      firstListItem &&
-      (!firstListItem.children || !firstListItem.children[0]) &&
-      state.stack[state.stack.length - 1] === 'list' &&
-      state.stack[state.stack.length - 2] === 'listItem' &&
-      state.stack[state.stack.length - 3] === 'list' &&
-      state.stack[state.stack.length - 4] === 'listItem' &&
-      state.indexStack[state.indexStack.length - 1] === 0 &&
-      state.indexStack[state.indexStack.length - 2] === 0 &&
-      state.indexStack[state.indexStack.length - 3] === 0
+      (position + 1 < end &&
+        positions[index + 1] === position + 1 &&
+        infos[position].after &&
+        !infos[position + 1].before &&
+        !infos[position + 1].after) ||
+      (positions[index - 1] === position - 1 &&
+        infos[position].before &&
+        !infos[position - 1].before &&
+        !infos[position - 1].after)
     ) {
-      useDifferentMarker = true;
+      continue
     }
-    if (checkRule(state) === bullet && firstListItem) {
-      let index = -1;
-      while (++index < node.children.length) {
-        const item = node.children[index];
-        if (
-          item &&
-          item.type === 'listItem' &&
-          item.children &&
-          item.children[0] &&
-          item.children[0].type === 'thematicBreak'
-        ) {
-          useDifferentMarker = true;
-          break
-        }
-      }
+    if (start !== position) {
+      result.push(escapeBackslashes(value.slice(start, position), '\\'));
+    }
+    start = position;
+    if (
+      /[!-/:-@[-`{-~]/.test(value.charAt(position)) &&
+      (!config.encode || !config.encode.includes(value.charAt(position)))
+    ) {
+      result.push('\\');
+    } else {
+      result.push(
+        '&#x' + value.charCodeAt(position).toString(16).toUpperCase() + ';'
+      );
+      start++;
     }
   }
-  if (useDifferentMarker) {
-    bullet = bulletOther;
+  result.push(escapeBackslashes(value.slice(start, end), config.after));
+  return result.join('')
+}
+function numerical(a, b) {
+  return a - b
+}
+function escapeBackslashes(value, after) {
+  const expression = /\\(?=[!-/:-@[-`{-~])/g;
+  const positions = [];
+  const results = [];
+  const whole = value + after;
+  let index = -1;
+  let start = 0;
+  let match;
+  while ((match = expression.exec(whole))) {
+    positions.push(match.index);
   }
-  state.bulletCurrent = bullet;
-  const value = state.containerFlow(node, info);
-  state.bulletLastUsed = bullet;
-  state.bulletCurrent = bulletCurrent;
-  exit();
-  return value
+  while (++index < positions.length) {
+    if (start !== positions[index]) {
+      results.push(value.slice(start, positions[index]));
+    }
+    results.push('\\');
+    start = positions[index];
+  }
+  results.push(value.slice(start));
+  return results.join('')
 }
 
-function checkListItemIndent(state) {
-  const style = state.options.listItemIndent || 'tab';
-  if (style === 1 || style === '1') {
-    return 'one'
+function track(config) {
+  const options = config || {};
+  const now = options.now || {};
+  let lineShift = options.lineShift || 0;
+  let line = now.line || 1;
+  let column = now.column || 1;
+  return {move, current, shift}
+  function current() {
+    return {now: {line, column}, lineShift}
   }
-  if (style !== 'tab' && style !== 'one' && style !== 'mixed') {
-    throw new Error(
-      'Cannot serialize items with `' +
-        style +
-        '` for `options.listItemIndent`, expected `tab`, `one`, or `mixed`'
-    )
+  function shift(value) {
+    lineShift += value;
+  }
+  function move(input) {
+    const value = input || '';
+    const chunks = value.split(/\r?\n|\r/g);
+    const tail = chunks[chunks.length - 1];
+    line += chunks.length - 1;
+    column =
+      chunks.length === 1 ? column + tail.length : 1 + tail.length + lineShift;
+    return value
   }
-  return style
 }
 
-function listItem(node, parent, state, info) {
-  const listItemIndent = checkListItemIndent(state);
-  let bullet = state.bulletCurrent || checkBullet(state);
-  if (parent && parent.type === 'list' && parent.ordered) {
-    bullet =
-      (typeof parent.start === 'number' && parent.start > -1
-        ? parent.start
-        : 1) +
-      (state.options.incrementListMarker === false
-        ? 0
-        : parent.children.indexOf(node)) +
-      bullet;
+function toMarkdown(tree, options = {}) {
+  const state = {
+    enter,
+    indentLines,
+    associationId: association,
+    containerPhrasing: containerPhrasingBound,
+    containerFlow: containerFlowBound,
+    createTracker: track,
+    compilePattern,
+    safe: safeBound,
+    stack: [],
+    unsafe: [...unsafe],
+    join: [...join],
+    handlers: {...handle},
+    options: {},
+    indexStack: [],
+    handle: undefined
+  };
+  configure(state, options);
+  if (state.options.tightDefinitions) {
+    state.join.push(joinDefinition);
   }
-  let size = bullet.length + 1;
+  state.handle = zwitch('type', {
+    invalid,
+    unknown,
+    handlers: state.handlers
+  });
+  let result = state.handle(tree, undefined, state, {
+    before: '\n',
+    after: '\n',
+    now: {line: 1, column: 1},
+    lineShift: 0
+  });
   if (
-    listItemIndent === 'tab' ||
-    (listItemIndent === 'mixed' &&
-      ((parent && parent.type === 'list' && parent.spread) || node.spread))
+    result &&
+    result.charCodeAt(result.length - 1) !== 10 &&
+    result.charCodeAt(result.length - 1) !== 13
   ) {
-    size = Math.ceil(size / 4) * 4;
+    result += '\n';
   }
-  const tracker = state.createTracker(info);
-  tracker.move(bullet + ' '.repeat(size - bullet.length));
-  tracker.shift(size);
-  const exit = state.enter('listItem');
-  const value = state.indentLines(
-    state.containerFlow(node, tracker.current()),
-    map
-  );
-  exit();
-  return value
-  function map(line, index, blank) {
-    if (index) {
-      return (blank ? '' : ' '.repeat(size)) + line
+  return result
+  function enter(name) {
+    state.stack.push(name);
+    return exit
+    function exit() {
+      state.stack.pop();
     }
-    return (blank ? bullet : bullet + ' '.repeat(size - bullet.length)) + line
   }
 }
-
-function paragraph(node, _, state, info) {
-  const exit = state.enter('paragraph');
-  const subexit = state.enter('phrasing');
-  const value = state.containerPhrasing(node, info);
-  subexit();
-  exit();
-  return value
+function invalid(value) {
+  throw new Error('Cannot handle value `' + value + '`, expected node')
 }
-
-const phrasing =  (
-  convert([
-    'break',
-    'delete',
-    'emphasis',
-    'footnote',
-    'footnoteReference',
-    'image',
-    'imageReference',
-    'inlineCode',
-    'link',
-    'linkReference',
-    'strong',
-    'text'
-  ])
-);
-
-function root(node, _, state, info) {
-  const hasPhrasing = node.children.some((d) => phrasing(d));
-  const fn = hasPhrasing ? state.containerPhrasing : state.containerFlow;
-  return fn.call(state, node, info)
+function unknown(value) {
+  const node =  (value);
+  throw new Error('Cannot handle unknown node `' + node.type + '`')
 }
-
-function checkStrong(state) {
-  const marker = state.options.strong || '*';
-  if (marker !== '*' && marker !== '_') {
-    throw new Error(
-      'Cannot serialize strong with `' +
-        marker +
-        '` for `options.strong`, expected `*`, or `_`'
-    )
+function joinDefinition(left, right) {
+  if (left.type === 'definition' && left.type === right.type) {
+    return 0
   }
-  return marker
 }
-
-strong.peek = strongPeek;
-function strong(node, _, state, info) {
-  const marker = checkStrong(state);
-  const exit = state.enter('strong');
-  const tracker = state.createTracker(info);
-  let value = tracker.move(marker + marker);
-  value += tracker.move(
-    state.containerPhrasing(node, {
-      before: value,
-      after: marker,
-      ...tracker.current()
-    })
-  );
-  value += tracker.move(marker + marker);
-  exit();
-  return value
+function containerPhrasingBound(parent, info) {
+  return containerPhrasing(parent, this, info)
 }
-function strongPeek(_, _1, state) {
-  return state.options.strong || '*'
+function containerFlowBound(parent, info) {
+  return containerFlow(parent, this, info)
+}
+function safeBound(value, config) {
+  return safe(this, value, config)
 }
 
-function text$1(node, _, state, info) {
-  return state.safe(node.value, info)
+function remarkStringify(options) {
+  const self = this;
+  self.compiler = compiler;
+  function compiler(tree) {
+    return toMarkdown(tree, {
+      ...self.data('settings'),
+      ...options,
+      extensions: self.data('toMarkdownExtensions') || []
+    })
+  }
 }
 
-function checkRuleRepetition(state) {
-  const repetition = state.options.ruleRepetition || 3;
-  if (repetition < 3) {
-    throw new Error(
-      'Cannot serialize rules with repetition `' +
-        repetition +
-        '` for `options.ruleRepetition`, expected `3` or more'
-    )
+function ccount(value, character) {
+  const source = String(value);
+  if (typeof character !== 'string') {
+    throw new TypeError('Expected character')
   }
-  return repetition
+  let count = 0;
+  let index = source.indexOf(character);
+  while (index !== -1) {
+    count++;
+    index = source.indexOf(character, index + character.length);
+  }
+  return count
 }
 
-function thematicBreak(_, _1, state) {
-  const value = (
-    checkRule(state) + (state.options.ruleSpaces ? ' ' : '')
-  ).repeat(checkRuleRepetition(state));
-  return state.options.ruleSpaces ? value.slice(0, -1) : value
+function escapeStringRegexp(string) {
+	if (typeof string !== 'string') {
+		throw new TypeError('Expected a string');
+	}
+	return string
+		.replace(/[|\\{}()[\]^$+*?.]/g, '\\$&')
+		.replace(/-/g, '\\x2d');
 }
 
-const handle = {
-  blockquote,
-  break: hardBreak,
-  code: code$1,
-  definition,
-  emphasis,
-  hardBreak,
-  heading,
-  html,
-  image,
-  imageReference,
-  inlineCode,
-  link,
-  linkReference,
-  list,
-  listItem,
-  paragraph,
-  root,
-  strong,
-  text: text$1,
-  thematicBreak
-};
-
-const join = [joinDefaults];
-function joinDefaults(left, right, parent, state) {
-  if (
-    right.type === 'code' &&
-    formatCodeAsIndented(right, state) &&
-    (left.type === 'list' ||
-      (left.type === right.type && formatCodeAsIndented(left, state)))
-  ) {
-    return false
-  }
-  if (
-    left.type === 'list' &&
-    left.type === right.type &&
-    Boolean(left.ordered) === Boolean(right.ordered) &&
-    !(left.ordered
-      ? state.options.bulletOrderedOther
-      : state.options.bulletOther)
-  ) {
-    return false
+function findAndReplace(tree, list, options) {
+  const settings = options || {};
+  const ignored = convert$A(settings.ignore || []);
+  const pairs = toPairs(list);
+  let pairIndex = -1;
+  while (++pairIndex < pairs.length) {
+    visitParents$A(tree, 'text', visitor);
   }
-  if ('spread' in parent && typeof parent.spread === 'boolean') {
-    if (
-      left.type === 'paragraph' &&
-      (left.type === right.type ||
-        right.type === 'definition' ||
-        (right.type === 'heading' && formatHeadingAsSetext(right, state)))
-    ) {
-      return
+  function visitor(node, parents) {
+    let index = -1;
+    let grandparent;
+    while (++index < parents.length) {
+      const parent = parents[index];
+      const siblings = grandparent ? grandparent.children : undefined;
+      if (
+        ignored(
+          parent,
+          siblings ? siblings.indexOf(parent) : undefined,
+          grandparent
+        )
+      ) {
+        return
+      }
+      grandparent = parent;
+    }
+    if (grandparent) {
+      return handler(node, parents)
+    }
+  }
+  function handler(node, parents) {
+    const parent = parents[parents.length - 1];
+    const find = pairs[pairIndex][0];
+    const replace = pairs[pairIndex][1];
+    let start = 0;
+    const siblings = parent.children;
+    const index = siblings.indexOf(node);
+    let change = false;
+    let nodes = [];
+    find.lastIndex = 0;
+    let match = find.exec(node.value);
+    while (match) {
+      const position = match.index;
+      const matchObject = {
+        index: match.index,
+        input: match.input,
+        stack: [...parents, node]
+      };
+      let value = replace(...match, matchObject);
+      if (typeof value === 'string') {
+        value = value.length > 0 ? {type: 'text', value} : undefined;
+      }
+      if (value === false) {
+        find.lastIndex = position + 1;
+      } else {
+        if (start !== position) {
+          nodes.push({
+            type: 'text',
+            value: node.value.slice(start, position)
+          });
+        }
+        if (Array.isArray(value)) {
+          nodes.push(...value);
+        } else if (value) {
+          nodes.push(value);
+        }
+        start = position + match[0].length;
+        change = true;
+      }
+      if (!find.global) {
+        break
+      }
+      match = find.exec(node.value);
     }
-    return parent.spread ? 1 : 0
+    if (change) {
+      if (start < node.value.length) {
+        nodes.push({type: 'text', value: node.value.slice(start)});
+      }
+      parent.children.splice(index, 1, ...nodes);
+    } else {
+      nodes = [node];
+    }
+    return index + nodes.length
   }
 }
+function toPairs(tupleOrList) {
+  const result = [];
+  if (!Array.isArray(tupleOrList)) {
+    throw new TypeError('Expected find and replace tuple or list of tuples')
+  }
+  const list =
+    !tupleOrList[0] || Array.isArray(tupleOrList[0])
+      ? tupleOrList
+      : [tupleOrList];
+  let index = -1;
+  while (++index < list.length) {
+    const tuple = list[index];
+    result.push([toExpression(tuple[0]), toFunction(tuple[1])]);
+  }
+  return result
+}
+function toExpression(find) {
+  return typeof find === 'string' ? new RegExp(escapeStringRegexp(find), 'g') : find
+}
+function toFunction(replace) {
+  return typeof replace === 'function'
+    ? replace
+    : function () {
+        return replace
+      }
+}
 
-const fullPhrasingSpans = [
-  'autolink',
-  'destinationLiteral',
-  'destinationRaw',
-  'reference',
-  'titleQuote',
-  'titleApostrophe'
-];
-const unsafe = [
-  {character: '\t', after: '[\\r\\n]', inConstruct: 'phrasing'},
-  {character: '\t', before: '[\\r\\n]', inConstruct: 'phrasing'},
-  {
-    character: '\t',
-    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedLangTilde']
-  },
-  {
-    character: '\r',
-    inConstruct: [
-      'codeFencedLangGraveAccent',
-      'codeFencedLangTilde',
-      'codeFencedMetaGraveAccent',
-      'codeFencedMetaTilde',
-      'destinationLiteral',
-      'headingAtx'
-    ]
-  },
-  {
-    character: '\n',
-    inConstruct: [
-      'codeFencedLangGraveAccent',
-      'codeFencedLangTilde',
-      'codeFencedMetaGraveAccent',
-      'codeFencedMetaTilde',
-      'destinationLiteral',
-      'headingAtx'
+const inConstruct = 'phrasing';
+const notInConstruct = ['autolink', 'link', 'image', 'label'];
+function gfmAutolinkLiteralFromMarkdown() {
+  return {
+    transforms: [transformGfmAutolinkLiterals],
+    enter: {
+      literalAutolink: enterLiteralAutolink,
+      literalAutolinkEmail: enterLiteralAutolinkValue,
+      literalAutolinkHttp: enterLiteralAutolinkValue,
+      literalAutolinkWww: enterLiteralAutolinkValue
+    },
+    exit: {
+      literalAutolink: exitLiteralAutolink,
+      literalAutolinkEmail: exitLiteralAutolinkEmail,
+      literalAutolinkHttp: exitLiteralAutolinkHttp,
+      literalAutolinkWww: exitLiteralAutolinkWww
+    }
+  }
+}
+function gfmAutolinkLiteralToMarkdown() {
+  return {
+    unsafe: [
+      {
+        character: '@',
+        before: '[+\\-.\\w]',
+        after: '[\\-.\\w]',
+        inConstruct,
+        notInConstruct
+      },
+      {
+        character: '.',
+        before: '[Ww]',
+        after: '[\\-.\\w]',
+        inConstruct,
+        notInConstruct
+      },
+      {
+        character: ':',
+        before: '[ps]',
+        after: '\\/',
+        inConstruct,
+        notInConstruct
+      }
     ]
-  },
-  {character: ' ', after: '[\\r\\n]', inConstruct: 'phrasing'},
-  {character: ' ', before: '[\\r\\n]', inConstruct: 'phrasing'},
-  {
-    character: ' ',
-    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedLangTilde']
-  },
-  {
-    character: '!',
-    after: '\\[',
-    inConstruct: 'phrasing',
-    notInConstruct: fullPhrasingSpans
-  },
-  {character: '"', inConstruct: 'titleQuote'},
-  {atBreak: true, character: '#'},
-  {character: '#', inConstruct: 'headingAtx', after: '(?:[\r\n]|$)'},
-  {character: '&', after: '[#A-Za-z]', inConstruct: 'phrasing'},
-  {character: "'", inConstruct: 'titleApostrophe'},
-  {character: '(', inConstruct: 'destinationRaw'},
-  {
-    before: '\\]',
-    character: '(',
-    inConstruct: 'phrasing',
-    notInConstruct: fullPhrasingSpans
-  },
-  {atBreak: true, before: '\\d+', character: ')'},
-  {character: ')', inConstruct: 'destinationRaw'},
-  {atBreak: true, character: '*', after: '(?:[ \t\r\n*])'},
-  {character: '*', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},
-  {atBreak: true, character: '+', after: '(?:[ \t\r\n])'},
-  {atBreak: true, character: '-', after: '(?:[ \t\r\n-])'},
-  {atBreak: true, before: '\\d+', character: '.', after: '(?:[ \t\r\n]|$)'},
-  {atBreak: true, character: '<', after: '[!/?A-Za-z]'},
-  {
-    character: '<',
-    after: '[!/?A-Za-z]',
-    inConstruct: 'phrasing',
-    notInConstruct: fullPhrasingSpans
-  },
-  {character: '<', inConstruct: 'destinationLiteral'},
-  {atBreak: true, character: '='},
-  {atBreak: true, character: '>'},
-  {character: '>', inConstruct: 'destinationLiteral'},
-  {atBreak: true, character: '['},
-  {character: '[', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},
-  {character: '[', inConstruct: ['label', 'reference']},
-  {character: '\\', after: '[\\r\\n]', inConstruct: 'phrasing'},
-  {character: ']', inConstruct: ['label', 'reference']},
-  {atBreak: true, character: '_'},
-  {character: '_', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},
-  {atBreak: true, character: '`'},
-  {
-    character: '`',
-    inConstruct: ['codeFencedLangGraveAccent', 'codeFencedMetaGraveAccent']
-  },
-  {character: '`', inConstruct: 'phrasing', notInConstruct: fullPhrasingSpans},
-  {atBreak: true, character: '~'}
-];
-
-function association(node) {
-  if (node.label || !node.identifier) {
-    return node.label || ''
   }
-  return decodeString(node.identifier)
 }
-
-function containerPhrasing(parent, state, info) {
-  const indexStack = state.indexStack;
-  const children = parent.children || [];
-  const results = [];
-  let index = -1;
-  let before = info.before;
-  indexStack.push(-1);
-  let tracker = state.createTracker(info);
-  while (++index < children.length) {
-    const child = children[index];
-    let after;
-    indexStack[indexStack.length - 1] = index;
-    if (index + 1 < children.length) {
-      let handle = state.handle.handlers[children[index + 1].type];
-      if (handle && handle.peek) handle = handle.peek;
-      after = handle
-        ? handle(children[index + 1], parent, state, {
-            before: '',
-            after: '',
-            ...tracker.current()
-          }).charAt(0)
-        : '';
-    } else {
-      after = info.after;
-    }
-    if (
-      results.length > 0 &&
-      (before === '\r' || before === '\n') &&
-      child.type === 'html'
-    ) {
-      results[results.length - 1] = results[results.length - 1].replace(
-        /(\r?\n|\r)$/,
-        ' '
-      );
-      before = ' ';
-      tracker = state.createTracker(info);
-      tracker.move(results.join(''));
-    }
-    results.push(
-      tracker.move(
-        state.handle(child, parent, state, {
-          ...tracker.current(),
-          before,
-          after
-        })
-      )
-    );
-    before = results[results.length - 1].slice(-1);
+function enterLiteralAutolink(token) {
+  this.enter({type: 'link', title: null, url: '', children: []}, token);
+}
+function enterLiteralAutolinkValue(token) {
+  this.config.enter.autolinkProtocol.call(this, token);
+}
+function exitLiteralAutolinkHttp(token) {
+  this.config.exit.autolinkProtocol.call(this, token);
+}
+function exitLiteralAutolinkWww(token) {
+  this.config.exit.data.call(this, token);
+  const node = this.stack[this.stack.length - 1];
+  ok$B(node.type === 'link');
+  node.url = 'http://' + this.sliceSerialize(token);
+}
+function exitLiteralAutolinkEmail(token) {
+  this.config.exit.autolinkEmail.call(this, token);
+}
+function exitLiteralAutolink(token) {
+  this.exit(token);
+}
+function transformGfmAutolinkLiterals(tree) {
+  findAndReplace(
+    tree,
+    [
+      [/(https?:\/\/|www(?=\.))([-.\w]+)([^ \t\r\n]*)/gi, findUrl],
+      [/([-.\w+]+)@([-\w]+(?:\.[-\w]+)+)/g, findEmail]
+    ],
+    {ignore: ['link', 'linkReference']}
+  );
+}
+function findUrl(_, protocol, domain, path, match) {
+  let prefix = '';
+  if (!previous(match)) {
+    return false
+  }
+  if (/^w/i.test(protocol)) {
+    domain = protocol + domain;
+    protocol = '';
+    prefix = 'http://';
+  }
+  if (!isCorrectDomain(domain)) {
+    return false
+  }
+  const parts = splitUrl(domain + path);
+  if (!parts[0]) return false
+  const result = {
+    type: 'link',
+    title: null,
+    url: prefix + protocol + parts[0],
+    children: [{type: 'text', value: protocol + parts[0]}]
+  };
+  if (parts[1]) {
+    return [result, {type: 'text', value: parts[1]}]
+  }
+  return result
+}
+function findEmail(_, atext, label, match) {
+  if (
+    !previous(match, true) ||
+    /[-\d_]$/.test(label)
+  ) {
+    return false
   }
-  indexStack.pop();
-  return results.join('')
+  return {
+    type: 'link',
+    title: null,
+    url: 'mailto:' + atext + '@' + label,
+    children: [{type: 'text', value: atext + '@' + label}]
+  }
+}
+function isCorrectDomain(domain) {
+  const parts = domain.split('.');
+  if (
+    parts.length < 2 ||
+    (parts[parts.length - 1] &&
+      (/_/.test(parts[parts.length - 1]) ||
+        !/[a-zA-Z\d]/.test(parts[parts.length - 1]))) ||
+    (parts[parts.length - 2] &&
+      (/_/.test(parts[parts.length - 2]) ||
+        !/[a-zA-Z\d]/.test(parts[parts.length - 2])))
+  ) {
+    return false
+  }
+  return true
+}
+function splitUrl(url) {
+  const trailExec = /[!"&'),.:;<>?\]}]+$/.exec(url);
+  if (!trailExec) {
+    return [url, undefined]
+  }
+  url = url.slice(0, trailExec.index);
+  let trail = trailExec[0];
+  let closingParenIndex = trail.indexOf(')');
+  const openingParens = ccount(url, '(');
+  let closingParens = ccount(url, ')');
+  while (closingParenIndex !== -1 && openingParens > closingParens) {
+    url += trail.slice(0, closingParenIndex + 1);
+    trail = trail.slice(closingParenIndex + 1);
+    closingParenIndex = trail.indexOf(')');
+    closingParens++;
+  }
+  return [url, trail]
+}
+function previous(match, email) {
+  const code = match.input.charCodeAt(match.index - 1);
+  return (
+    (match.index === 0 ||
+      unicodeWhitespace(code) ||
+      unicodePunctuation(code)) &&
+    (!email || code !== 47)
+  )
 }
 
-function containerFlow(parent, state, info) {
-  const indexStack = state.indexStack;
-  const children = parent.children || [];
-  const tracker = state.createTracker(info);
-  const results = [];
-  let index = -1;
-  indexStack.push(-1);
-  while (++index < children.length) {
-    const child = children[index];
-    indexStack[indexStack.length - 1] = index;
-    results.push(
-      tracker.move(
-        state.handle(child, parent, state, {
-          before: '\n',
-          after: '\n',
-          ...tracker.current()
-        })
-      )
-    );
-    if (child.type !== 'list') {
-      state.bulletLastUsed = undefined;
-    }
-    if (index < children.length - 1) {
-      results.push(
-        tracker.move(between(child, children[index + 1], parent, state))
-      );
+footnoteReference.peek = footnoteReferencePeek;
+function gfmFootnoteFromMarkdown() {
+  return {
+    enter: {
+      gfmFootnoteDefinition: enterFootnoteDefinition,
+      gfmFootnoteDefinitionLabelString: enterFootnoteDefinitionLabelString,
+      gfmFootnoteCall: enterFootnoteCall,
+      gfmFootnoteCallString: enterFootnoteCallString
+    },
+    exit: {
+      gfmFootnoteDefinition: exitFootnoteDefinition,
+      gfmFootnoteDefinitionLabelString: exitFootnoteDefinitionLabelString,
+      gfmFootnoteCall: exitFootnoteCall,
+      gfmFootnoteCallString: exitFootnoteCallString
     }
   }
-  indexStack.pop();
-  return results.join('')
 }
-function between(left, right, parent, state) {
-  let index = state.join.length;
-  while (index--) {
-    const result = state.join[index](left, right, parent, state);
-    if (result === true || result === 1) {
-      break
-    }
-    if (typeof result === 'number') {
-      return '\n'.repeat(1 + result)
-    }
-    if (result === false) {
-      return '\n\n<!---->\n\n'
-    }
+function gfmFootnoteToMarkdown() {
+  return {
+    unsafe: [{character: '[', inConstruct: ['phrasing', 'label', 'reference']}],
+    handlers: {footnoteDefinition, footnoteReference}
+  }
+}
+function enterFootnoteDefinition(token) {
+  this.enter(
+    {type: 'footnoteDefinition', identifier: '', label: '', children: []},
+    token
+  );
+}
+function enterFootnoteDefinitionLabelString() {
+  this.buffer();
+}
+function exitFootnoteDefinitionLabelString(token) {
+  const label = this.resume();
+  const node = this.stack[this.stack.length - 1];
+  ok$B(node.type === 'footnoteDefinition');
+  node.label = label;
+  node.identifier = normalizeIdentifier$1(
+    this.sliceSerialize(token)
+  ).toLowerCase();
+}
+function exitFootnoteDefinition(token) {
+  this.exit(token);
+}
+function enterFootnoteCall(token) {
+  this.enter({type: 'footnoteReference', identifier: '', label: ''}, token);
+}
+function enterFootnoteCallString() {
+  this.buffer();
+}
+function exitFootnoteCallString(token) {
+  const label = this.resume();
+  const node = this.stack[this.stack.length - 1];
+  ok$B(node.type === 'footnoteReference');
+  node.label = label;
+  node.identifier = normalizeIdentifier$1(
+    this.sliceSerialize(token)
+  ).toLowerCase();
+}
+function exitFootnoteCall(token) {
+  this.exit(token);
+}
+function footnoteReference(node, _, state, info) {
+  const tracker = state.createTracker(info);
+  let value = tracker.move('[^');
+  const exit = state.enter('footnoteReference');
+  const subexit = state.enter('reference');
+  value += tracker.move(
+    state.safe(state.associationId(node), {
+      ...tracker.current(),
+      before: value,
+      after: ']'
+    })
+  );
+  subexit();
+  exit();
+  value += tracker.move(']');
+  return value
+}
+function footnoteReferencePeek() {
+  return '['
+}
+function footnoteDefinition(node, _, state, info) {
+  const tracker = state.createTracker(info);
+  let value = tracker.move('[^');
+  const exit = state.enter('footnoteDefinition');
+  const subexit = state.enter('label');
+  value += tracker.move(
+    state.safe(state.associationId(node), {
+      ...tracker.current(),
+      before: value,
+      after: ']'
+    })
+  );
+  subexit();
+  value += tracker.move(
+    ']:' + (node.children && node.children.length > 0 ? ' ' : '')
+  );
+  tracker.shift(4);
+  value += tracker.move(
+    state.indentLines(state.containerFlow(node, tracker.current()), map$1)
+  );
+  exit();
+  return value
+}
+function map$1(line, index, blank) {
+  if (index === 0) {
+    return line
   }
-  return '\n\n'
+  return (blank ? '' : '    ') + line
 }
 
-const eol$1 = /\r?\n|\r/g;
-function indentLines(value, map) {
-  const result = [];
-  let start = 0;
-  let line = 0;
-  let match;
-  while ((match = eol$1.exec(value))) {
-    one(value.slice(start, match.index));
-    result.push(match[0]);
-    start = match.index + match[0].length;
-    line++;
+const constructsWithoutStrikethrough = [
+  'autolink',
+  'destinationLiteral',
+  'destinationRaw',
+  'reference',
+  'titleQuote',
+  'titleApostrophe'
+];
+handleDelete.peek = peekDelete;
+function gfmStrikethroughFromMarkdown() {
+  return {
+    canContainEols: ['delete'],
+    enter: {strikethrough: enterStrikethrough},
+    exit: {strikethrough: exitStrikethrough}
   }
-  one(value.slice(start));
-  return result.join('')
-  function one(value) {
-    result.push(map(value, line, !value));
+}
+function gfmStrikethroughToMarkdown() {
+  return {
+    unsafe: [
+      {
+        character: '~',
+        inConstruct: 'phrasing',
+        notInConstruct: constructsWithoutStrikethrough
+      }
+    ],
+    handlers: {delete: handleDelete}
   }
 }
+function enterStrikethrough(token) {
+  this.enter({type: 'delete', children: []}, token);
+}
+function exitStrikethrough(token) {
+  this.exit(token);
+}
+function handleDelete(node, _, state, info) {
+  const tracker = state.createTracker(info);
+  const exit = state.enter('strikethrough');
+  let value = tracker.move('~~');
+  value += state.containerPhrasing(node, {
+    ...tracker.current(),
+    before: value,
+    after: '~'
+  });
+  value += tracker.move('~~');
+  exit();
+  return value
+}
+function peekDelete() {
+  return '~'
+}
 
-function safe(state, input, config) {
-  const value = (config.before || '') + (input || '') + (config.after || '');
-  const positions = [];
-  const result = [];
-  const infos = {};
-  let index = -1;
-  while (++index < state.unsafe.length) {
-    const pattern = state.unsafe[index];
-    if (!patternInScope(state.stack, pattern)) {
-      continue
+function markdownTable(table, options = {}) {
+  const align = (options.align || []).concat();
+  const stringLength = options.stringLength || defaultStringLength;
+  const alignments = [];
+  const cellMatrix = [];
+  const sizeMatrix = [];
+  const longestCellByColumn = [];
+  let mostCellsPerRow = 0;
+  let rowIndex = -1;
+  while (++rowIndex < table.length) {
+    const row = [];
+    const sizes = [];
+    let columnIndex = -1;
+    if (table[rowIndex].length > mostCellsPerRow) {
+      mostCellsPerRow = table[rowIndex].length;
     }
-    const expression = patternCompile(pattern);
-    let match;
-    while ((match = expression.exec(value))) {
-      const before = 'before' in pattern || Boolean(pattern.atBreak);
-      const after = 'after' in pattern;
-      const position = match.index + (before ? match[1].length : 0);
-      if (positions.includes(position)) {
-        if (infos[position].before && !before) {
-          infos[position].before = false;
-        }
-        if (infos[position].after && !after) {
-          infos[position].after = false;
+    while (++columnIndex < table[rowIndex].length) {
+      const cell = serialize(table[rowIndex][columnIndex]);
+      if (options.alignDelimiters !== false) {
+        const size = stringLength(cell);
+        sizes[columnIndex] = size;
+        if (
+          longestCellByColumn[columnIndex] === undefined ||
+          size > longestCellByColumn[columnIndex]
+        ) {
+          longestCellByColumn[columnIndex] = size;
         }
-      } else {
-        positions.push(position);
-        infos[position] = {before, after};
       }
+      row.push(cell);
     }
+    cellMatrix[rowIndex] = row;
+    sizeMatrix[rowIndex] = sizes;
   }
-  positions.sort(numerical);
-  let start = config.before ? config.before.length : 0;
-  const end = value.length - (config.after ? config.after.length : 0);
-  index = -1;
-  while (++index < positions.length) {
-    const position = positions[index];
-    if (position < start || position >= end) {
-      continue
+  let columnIndex = -1;
+  if (typeof align === 'object' && 'length' in align) {
+    while (++columnIndex < mostCellsPerRow) {
+      alignments[columnIndex] = toAlignment(align[columnIndex]);
     }
-    if (
-      (position + 1 < end &&
-        positions[index + 1] === position + 1 &&
-        infos[position].after &&
-        !infos[position + 1].before &&
-        !infos[position + 1].after) ||
-      (positions[index - 1] === position - 1 &&
-        infos[position].before &&
-        !infos[position - 1].before &&
-        !infos[position - 1].after)
-    ) {
-      continue
+  } else {
+    const code = toAlignment(align);
+    while (++columnIndex < mostCellsPerRow) {
+      alignments[columnIndex] = code;
     }
-    if (start !== position) {
-      result.push(escapeBackslashes(value.slice(start, position), '\\'));
+  }
+  columnIndex = -1;
+  const row = [];
+  const sizes = [];
+  while (++columnIndex < mostCellsPerRow) {
+    const code = alignments[columnIndex];
+    let before = '';
+    let after = '';
+    if (code === 99 ) {
+      before = ':';
+      after = ':';
+    } else if (code === 108 ) {
+      before = ':';
+    } else if (code === 114 ) {
+      after = ':';
     }
-    start = position;
-    if (
-      /[!-/:-@[-`{-~]/.test(value.charAt(position)) &&
-      (!config.encode || !config.encode.includes(value.charAt(position)))
-    ) {
-      result.push('\\');
-    } else {
-      result.push(
-        '&#x' + value.charCodeAt(position).toString(16).toUpperCase() + ';'
-      );
-      start++;
+    let size =
+      options.alignDelimiters === false
+        ? 1
+        : Math.max(
+            1,
+            longestCellByColumn[columnIndex] - before.length - after.length
+          );
+    const cell = before + '-'.repeat(size) + after;
+    if (options.alignDelimiters !== false) {
+      size = before.length + size + after.length;
+      if (size > longestCellByColumn[columnIndex]) {
+        longestCellByColumn[columnIndex] = size;
+      }
+      sizes[columnIndex] = size;
+    }
+    row[columnIndex] = cell;
+  }
+  cellMatrix.splice(1, 0, row);
+  sizeMatrix.splice(1, 0, sizes);
+  rowIndex = -1;
+  const lines = [];
+  while (++rowIndex < cellMatrix.length) {
+    const row = cellMatrix[rowIndex];
+    const sizes = sizeMatrix[rowIndex];
+    columnIndex = -1;
+    const line = [];
+    while (++columnIndex < mostCellsPerRow) {
+      const cell = row[columnIndex] || '';
+      let before = '';
+      let after = '';
+      if (options.alignDelimiters !== false) {
+        const size =
+          longestCellByColumn[columnIndex] - (sizes[columnIndex] || 0);
+        const code = alignments[columnIndex];
+        if (code === 114 ) {
+          before = ' '.repeat(size);
+        } else if (code === 99 ) {
+          if (size % 2) {
+            before = ' '.repeat(size / 2 + 0.5);
+            after = ' '.repeat(size / 2 - 0.5);
+          } else {
+            before = ' '.repeat(size / 2);
+            after = before;
+          }
+        } else {
+          after = ' '.repeat(size);
+        }
+      }
+      if (options.delimiterStart !== false && !columnIndex) {
+        line.push('|');
+      }
+      if (
+        options.padding !== false &&
+        !(options.alignDelimiters === false && cell === '') &&
+        (options.delimiterStart !== false || columnIndex)
+      ) {
+        line.push(' ');
+      }
+      if (options.alignDelimiters !== false) {
+        line.push(before);
+      }
+      line.push(cell);
+      if (options.alignDelimiters !== false) {
+        line.push(after);
+      }
+      if (options.padding !== false) {
+        line.push(' ');
+      }
+      if (
+        options.delimiterEnd !== false ||
+        columnIndex !== mostCellsPerRow - 1
+      ) {
+        line.push('|');
+      }
+    }
+    lines.push(
+      options.delimiterEnd === false
+        ? line.join('').replace(/ +$/, '')
+        : line.join('')
+    );
+  }
+  return lines.join('\n')
+}
+function serialize(value) {
+  return value === null || value === undefined ? '' : String(value)
+}
+function defaultStringLength(value) {
+  return value.length
+}
+function toAlignment(value) {
+  const code = typeof value === 'string' ? value.codePointAt(0) : 0;
+  return code === 67  || code === 99
+    ? 99
+    : code === 76  || code === 108
+    ? 108
+    : code === 82  || code === 114
+    ? 114
+    : 0
+}
+
+function gfmTableFromMarkdown() {
+  return {
+    enter: {
+      table: enterTable,
+      tableData: enterCell,
+      tableHeader: enterCell,
+      tableRow: enterRow
+    },
+    exit: {
+      codeText: exitCodeText,
+      table: exitTable,
+      tableData: exit,
+      tableHeader: exit,
+      tableRow: exit
     }
   }
-  result.push(escapeBackslashes(value.slice(start, end), config.after));
-  return result.join('')
 }
-function numerical(a, b) {
-  return a - b
+function enterTable(token) {
+  const align = token._align;
+  this.enter(
+    {
+      type: 'table',
+      align: align.map(function (d) {
+        return d === 'none' ? null : d
+      }),
+      children: []
+    },
+    token
+  );
+  this.data.inTable = true;
 }
-function escapeBackslashes(value, after) {
-  const expression = /\\(?=[!-/:-@[-`{-~])/g;
-  const positions = [];
-  const results = [];
-  const whole = value + after;
-  let index = -1;
-  let start = 0;
-  let match;
-  while ((match = expression.exec(whole))) {
-    positions.push(match.index);
+function exitTable(token) {
+  this.exit(token);
+  this.data.inTable = undefined;
+}
+function enterRow(token) {
+  this.enter({type: 'tableRow', children: []}, token);
+}
+function exit(token) {
+  this.exit(token);
+}
+function enterCell(token) {
+  this.enter({type: 'tableCell', children: []}, token);
+}
+function exitCodeText(token) {
+  let value = this.resume();
+  if (this.data.inTable) {
+    value = value.replace(/\\([\\|])/g, replace);
   }
-  while (++index < positions.length) {
-    if (start !== positions[index]) {
-      results.push(value.slice(start, positions[index]));
+  const node = this.stack[this.stack.length - 1];
+  ok$B(node.type === 'inlineCode');
+  node.value = value;
+  this.exit(token);
+}
+function replace($0, $1) {
+  return $1 === '|' ? $1 : $0
+}
+function gfmTableToMarkdown(options) {
+  const settings = options || {};
+  const padding = settings.tableCellPadding;
+  const alignDelimiters = settings.tablePipeAlign;
+  const stringLength = settings.stringLength;
+  const around = padding ? ' ' : '|';
+  return {
+    unsafe: [
+      {character: '\r', inConstruct: 'tableCell'},
+      {character: '\n', inConstruct: 'tableCell'},
+      {atBreak: true, character: '|', after: '[\t :-]'},
+      {character: '|', inConstruct: 'tableCell'},
+      {atBreak: true, character: ':', after: '-'},
+      {atBreak: true, character: '-', after: '[:|-]'}
+    ],
+    handlers: {
+      inlineCode: inlineCodeWithTable,
+      table: handleTable,
+      tableCell: handleTableCell,
+      tableRow: handleTableRow
     }
-    results.push('\\');
-    start = positions[index];
   }
-  results.push(value.slice(start));
-  return results.join('')
-}
-
-function track(config) {
-  const options = config || {};
-  const now = options.now || {};
-  let lineShift = options.lineShift || 0;
-  let line = now.line || 1;
-  let column = now.column || 1;
-  return {move, current, shift}
-  function current() {
-    return {now: {line, column}, lineShift}
+  function handleTable(node, _, state, info) {
+    return serializeData(handleTableAsData(node, state, info), node.align)
   }
-  function shift(value) {
-    lineShift += value;
+  function handleTableRow(node, _, state, info) {
+    const row = handleTableRowAsData(node, state, info);
+    const value = serializeData([row]);
+    return value.slice(0, value.indexOf('\n'))
   }
-  function move(input) {
-    const value = input || '';
-    const chunks = value.split(/\r?\n|\r/g);
-    const tail = chunks[chunks.length - 1];
-    line += chunks.length - 1;
-    column =
-      chunks.length === 1 ? column + tail.length : 1 + tail.length + lineShift;
+  function handleTableCell(node, _, state, info) {
+    const exit = state.enter('tableCell');
+    const subexit = state.enter('phrasing');
+    const value = state.containerPhrasing(node, {
+      ...info,
+      before: around,
+      after: around
+    });
+    subexit();
+    exit();
     return value
   }
-}
-
-function toMarkdown(tree, options = {}) {
-  const state = {
-    enter,
-    indentLines,
-    associationId: association,
-    containerPhrasing: containerPhrasingBound,
-    containerFlow: containerFlowBound,
-    createTracker: track,
-    safe: safeBound,
-    stack: [],
-    unsafe: [],
-    join: [],
-    handlers: {},
-    options: {},
-    indexStack: [],
-    handle: undefined
-  };
-  configure(state, {unsafe, join, handlers: handle});
-  configure(state, options);
-  if (state.options.tightDefinitions) {
-    configure(state, {join: [joinDefinition]});
+  function serializeData(matrix, align) {
+    return markdownTable(matrix, {
+      align,
+      alignDelimiters,
+      padding,
+      stringLength
+    })
   }
-  state.handle = zwitch('type', {
-    invalid,
-    unknown,
-    handlers: state.handlers
-  });
-  let result = state.handle(tree, undefined, state, {
-    before: '\n',
-    after: '\n',
-    now: {line: 1, column: 1},
-    lineShift: 0
-  });
-  if (
-    result &&
-    result.charCodeAt(result.length - 1) !== 10 &&
-    result.charCodeAt(result.length - 1) !== 13
-  ) {
-    result += '\n';
+  function handleTableAsData(node, state, info) {
+    const children = node.children;
+    let index = -1;
+    const result = [];
+    const subexit = state.enter('table');
+    while (++index < children.length) {
+      result[index] = handleTableRowAsData(children[index], state, info);
+    }
+    subexit();
+    return result
   }
-  return result
-  function enter(name) {
-    state.stack.push(name);
-    return exit
-    function exit() {
-      state.stack.pop();
+  function handleTableRowAsData(node, state, info) {
+    const children = node.children;
+    let index = -1;
+    const result = [];
+    const subexit = state.enter('tableRow');
+    while (++index < children.length) {
+      result[index] = handleTableCell(children[index], node, state, info);
     }
+    subexit();
+    return result
+  }
+  function inlineCodeWithTable(node, parent, state) {
+    let value = handle.inlineCode(node, parent, state);
+    if (state.stack.includes('tableCell')) {
+      value = value.replace(/\|/g, '\\$&');
+    }
+    return value
   }
 }
-function invalid(value) {
-  throw new Error('Cannot handle value `' + value + '`, expected node')
-}
-function unknown(node) {
-  throw new Error('Cannot handle unknown node `' + node.type + '`')
+
+function gfmTaskListItemFromMarkdown() {
+  return {
+    exit: {
+      taskListCheckValueChecked: exitCheck,
+      taskListCheckValueUnchecked: exitCheck,
+      paragraph: exitParagraphWithTaskListItem
+    }
+  }
 }
-function joinDefinition(left, right) {
-  if (left.type === 'definition' && left.type === right.type) {
-    return 0
+function gfmTaskListItemToMarkdown() {
+  return {
+    unsafe: [{atBreak: true, character: '-', after: '[:|-]'}],
+    handlers: {listItem: listItemWithTaskListItem}
   }
 }
-function containerPhrasingBound(parent, info) {
-  return containerPhrasing(parent, this, info)
+function exitCheck(token) {
+  const node = this.stack[this.stack.length - 2];
+  ok$B(node.type === 'listItem');
+  node.checked = token.type === 'taskListCheckValueChecked';
 }
-function containerFlowBound(parent, info) {
-  return containerFlow(parent, this, info)
+function exitParagraphWithTaskListItem(token) {
+  const parent = this.stack[this.stack.length - 2];
+  if (
+    parent &&
+    parent.type === 'listItem' &&
+    typeof parent.checked === 'boolean'
+  ) {
+    const node = this.stack[this.stack.length - 1];
+    ok$B(node.type === 'paragraph');
+    const head = node.children[0];
+    if (head && head.type === 'text') {
+      const siblings = parent.children;
+      let index = -1;
+      let firstParaghraph;
+      while (++index < siblings.length) {
+        const sibling = siblings[index];
+        if (sibling.type === 'paragraph') {
+          firstParaghraph = sibling;
+          break
+        }
+      }
+      if (firstParaghraph === node) {
+        head.value = head.value.slice(1);
+        if (head.value.length === 0) {
+          node.children.shift();
+        } else if (
+          node.position &&
+          head.position &&
+          typeof head.position.start.offset === 'number'
+        ) {
+          head.position.start.column++;
+          head.position.start.offset++;
+          node.position.start = Object.assign({}, head.position.start);
+        }
+      }
+    }
+  }
+  this.exit(token);
 }
-function safeBound(value, config) {
-  return safe(this, value, config)
+function listItemWithTaskListItem(node, parent, state, info) {
+  const head = node.children[0];
+  const checkable =
+    typeof node.checked === 'boolean' && head && head.type === 'paragraph';
+  const checkbox = '[' + (node.checked ? 'x' : ' ') + '] ';
+  const tracker = state.createTracker(info);
+  if (checkable) {
+    tracker.move(checkbox);
+  }
+  let value = handle.listItem(node, parent, state, {
+    ...info,
+    ...tracker.current()
+  });
+  if (checkable) {
+    value = value.replace(/^(?:[*+-]|\d+\.)([\r\n]| {1,3})/, check);
+  }
+  return value
+  function check($0) {
+    return $0 + checkbox
+  }
 }
 
-function remarkStringify(options) {
-  const compiler = (tree) => {
-    const settings =  (this.data('settings'));
-    return toMarkdown(
-      tree,
-      Object.assign({}, settings, options, {
-        extensions:
-           (
-            this.data('toMarkdownExtensions')
-          ) || []
-      })
-    )
-  };
-  Object.assign(this, {Compiler: compiler});
+function gfmFromMarkdown() {
+  return [
+    gfmAutolinkLiteralFromMarkdown(),
+    gfmFootnoteFromMarkdown(),
+    gfmStrikethroughFromMarkdown(),
+    gfmTableFromMarkdown(),
+    gfmTaskListItemFromMarkdown()
+  ]
+}
+function gfmToMarkdown(options) {
+  return {
+    extensions: [
+      gfmAutolinkLiteralToMarkdown(),
+      gfmFootnoteToMarkdown(),
+      gfmStrikethroughToMarkdown(),
+      gfmTableToMarkdown(options),
+      gfmTaskListItemToMarkdown()
+    ]
+  }
 }
 
 const wwwPrefix = {
@@ -9600,9 +10444,11 @@ const emailAutolink = {
   previous: previousEmail
 };
 const text = {};
-const gfmAutolinkLiteral = {
-  text
-};
+function gfmAutolinkLiteral() {
+  return {
+    text
+  }
+}
 let code = 48;
 while (code < 123) {
   text[code] = emailAutolink;
@@ -9757,2114 +10603,1266 @@ function tokenizeProtocolAutolink(effects, ok, nok) {
   function protocolAfter(code) {
     effects.exit('literalAutolinkHttp');
     effects.exit('literalAutolink');
-    return ok(code)
-  }
-}
-function tokenizeWwwPrefix(effects, ok, nok) {
-  let size = 0;
-  return wwwPrefixInside
-  function wwwPrefixInside(code) {
-    if ((code === 87 || code === 119) && size < 3) {
-      size++;
-      effects.consume(code);
-      return wwwPrefixInside
-    }
-    if (code === 46 && size === 3) {
-      effects.consume(code);
-      return wwwPrefixAfter
-    }
-    return nok(code)
-  }
-  function wwwPrefixAfter(code) {
-    return code === null ? nok(code) : ok(code)
-  }
-}
-function tokenizeDomain(effects, ok, nok) {
-  let underscoreInLastSegment;
-  let underscoreInLastLastSegment;
-  let seen;
-  return domainInside
-  function domainInside(code) {
-    if (code === 46 || code === 95) {
-      return effects.check(trail, domainAfter, domainAtPunctuation)(code)
-    }
-    if (
-      code === null ||
-      markdownLineEndingOrSpace(code) ||
-      unicodeWhitespace(code) ||
-      (code !== 45 && unicodePunctuation(code))
-    ) {
-      return domainAfter(code)
-    }
-    seen = true;
-    effects.consume(code);
-    return domainInside
-  }
-  function domainAtPunctuation(code) {
-    if (code === 95) {
-      underscoreInLastSegment = true;
-    }
-    else {
-      underscoreInLastLastSegment = underscoreInLastSegment;
-      underscoreInLastSegment = undefined;
-    }
-    effects.consume(code);
-    return domainInside
-  }
-  function domainAfter(code) {
-    if (underscoreInLastLastSegment || underscoreInLastSegment || !seen) {
-      return nok(code)
-    }
-    return ok(code)
-  }
-}
-function tokenizePath(effects, ok) {
-  let sizeOpen = 0;
-  let sizeClose = 0;
-  return pathInside
-  function pathInside(code) {
-    if (code === 40) {
-      sizeOpen++;
-      effects.consume(code);
-      return pathInside
-    }
-    if (code === 41 && sizeClose < sizeOpen) {
-      return pathAtPunctuation(code)
-    }
-    if (
-      code === 33 ||
-      code === 34 ||
-      code === 38 ||
-      code === 39 ||
-      code === 41 ||
-      code === 42 ||
-      code === 44 ||
-      code === 46 ||
-      code === 58 ||
-      code === 59 ||
-      code === 60 ||
-      code === 63 ||
-      code === 93 ||
-      code === 95 ||
-      code === 126
-    ) {
-      return effects.check(trail, ok, pathAtPunctuation)(code)
-    }
-    if (
-      code === null ||
-      markdownLineEndingOrSpace(code) ||
-      unicodeWhitespace(code)
-    ) {
-      return ok(code)
-    }
-    effects.consume(code);
-    return pathInside
-  }
-  function pathAtPunctuation(code) {
-    if (code === 41) {
-      sizeClose++;
-    }
-    effects.consume(code);
-    return pathInside
-  }
-}
-function tokenizeTrail(effects, ok, nok) {
-  return trail
-  function trail(code) {
-    if (
-      code === 33 ||
-      code === 34 ||
-      code === 39 ||
-      code === 41 ||
-      code === 42 ||
-      code === 44 ||
-      code === 46 ||
-      code === 58 ||
-      code === 59 ||
-      code === 63 ||
-      code === 95 ||
-      code === 126
-    ) {
-      effects.consume(code);
-      return trail
-    }
-    if (code === 38) {
-      effects.consume(code);
-      return trailCharRefStart
-    }
-    if (code === 93) {
-      effects.consume(code);
-      return trailBracketAfter
-    }
-    if (
-      code === 60 ||
-      code === null ||
-      markdownLineEndingOrSpace(code) ||
-      unicodeWhitespace(code)
-    ) {
-      return ok(code)
-    }
-    return nok(code)
-  }
-  function trailBracketAfter(code) {
-    if (
-      code === null ||
-      code === 40 ||
-      code === 91 ||
-      markdownLineEndingOrSpace(code) ||
-      unicodeWhitespace(code)
-    ) {
-      return ok(code)
-    }
-    return trail(code)
-  }
-  function trailCharRefStart(code) {
-    return asciiAlpha(code) ? trailCharRefInside(code) : nok(code)
-  }
-  function trailCharRefInside(code) {
-    if (code === 59) {
-      effects.consume(code);
-      return trail
-    }
-    if (asciiAlpha(code)) {
-      effects.consume(code);
-      return trailCharRefInside
-    }
-    return nok(code)
-  }
-}
-function tokenizeEmailDomainDotTrail(effects, ok, nok) {
-  return start
-  function start(code) {
-    effects.consume(code);
-    return after
-  }
-  function after(code) {
-    return asciiAlphanumeric(code) ? nok(code) : ok(code)
-  }
-}
-function previousWww(code) {
-  return (
-    code === null ||
-    code === 40 ||
-    code === 42 ||
-    code === 95 ||
-    code === 91 ||
-    code === 93 ||
-    code === 126 ||
-    markdownLineEndingOrSpace(code)
-  )
-}
-function previousProtocol(code) {
-  return !asciiAlpha(code)
-}
-function previousEmail(code) {
-  return !(code === 47 || gfmAtext(code))
-}
-function gfmAtext(code) {
-  return (
-    code === 43 ||
-    code === 45 ||
-    code === 46 ||
-    code === 95 ||
-    asciiAlphanumeric(code)
-  )
-}
-function previousUnbalanced(events) {
-  let index = events.length;
-  let result = false;
-  while (index--) {
-    const token = events[index][1];
-    if (
-      (token.type === 'labelLink' || token.type === 'labelImage') &&
-      !token._balanced
-    ) {
-      result = true;
-      break
-    }
-    if (token._gfmAutolinkLiteralWalkedInto) {
-      result = false;
-      break
-    }
-  }
-  if (events.length > 0 && !result) {
-    events[events.length - 1][1]._gfmAutolinkLiteralWalkedInto = true;
+    return ok(code)
   }
-  return result
 }
-
-const indent = {
-  tokenize: tokenizeIndent,
-  partial: true
-};
-function gfmFootnote() {
-  return {
-    document: {
-      [91]: {
-        tokenize: tokenizeDefinitionStart,
-        continuation: {
-          tokenize: tokenizeDefinitionContinuation
-        },
-        exit: gfmFootnoteDefinitionEnd
-      }
-    },
-    text: {
-      [91]: {
-        tokenize: tokenizeGfmFootnoteCall
-      },
-      [93]: {
-        add: 'after',
-        tokenize: tokenizePotentialGfmFootnoteCall,
-        resolveTo: resolveToPotentialGfmFootnoteCall
-      }
+function tokenizeWwwPrefix(effects, ok, nok) {
+  let size = 0;
+  return wwwPrefixInside
+  function wwwPrefixInside(code) {
+    if ((code === 87 || code === 119) && size < 3) {
+      size++;
+      effects.consume(code);
+      return wwwPrefixInside
+    }
+    if (code === 46 && size === 3) {
+      effects.consume(code);
+      return wwwPrefixAfter
     }
+    return nok(code)
+  }
+  function wwwPrefixAfter(code) {
+    return code === null ? nok(code) : ok(code)
   }
 }
-function tokenizePotentialGfmFootnoteCall(effects, ok, nok) {
-  const self = this;
-  let index = self.events.length;
-  const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = []);
-  let labelStart;
-  while (index--) {
-    const token = self.events[index][1];
-    if (token.type === 'labelImage') {
-      labelStart = token;
-      break
+function tokenizeDomain(effects, ok, nok) {
+  let underscoreInLastSegment;
+  let underscoreInLastLastSegment;
+  let seen;
+  return domainInside
+  function domainInside(code) {
+    if (code === 46 || code === 95) {
+      return effects.check(trail, domainAfter, domainAtPunctuation)(code)
     }
     if (
-      token.type === 'gfmFootnoteCall' ||
-      token.type === 'labelLink' ||
-      token.type === 'label' ||
-      token.type === 'image' ||
-      token.type === 'link'
+      code === null ||
+      markdownLineEndingOrSpace(code) ||
+      unicodeWhitespace(code) ||
+      (code !== 45 && unicodePunctuation(code))
     ) {
-      break
+      return domainAfter(code)
     }
+    seen = true;
+    effects.consume(code);
+    return domainInside
   }
-  return start
-  function start(code) {
-    if (!labelStart || !labelStart._balanced) {
-      return nok(code)
+  function domainAtPunctuation(code) {
+    if (code === 95) {
+      underscoreInLastSegment = true;
     }
-    const id = normalizeIdentifier(
-      self.sliceSerialize({
-        start: labelStart.end,
-        end: self.now()
-      })
-    );
-    if (id.codePointAt(0) !== 94 || !defined.includes(id.slice(1))) {
-      return nok(code)
+    else {
+      underscoreInLastLastSegment = underscoreInLastSegment;
+      underscoreInLastSegment = undefined;
     }
-    effects.enter('gfmFootnoteCallLabelMarker');
     effects.consume(code);
-    effects.exit('gfmFootnoteCallLabelMarker');
+    return domainInside
+  }
+  function domainAfter(code) {
+    if (underscoreInLastLastSegment || underscoreInLastSegment || !seen) {
+      return nok(code)
+    }
     return ok(code)
   }
 }
-function resolveToPotentialGfmFootnoteCall(events, context) {
-  let index = events.length;
-  while (index--) {
+function tokenizePath(effects, ok) {
+  let sizeOpen = 0;
+  let sizeClose = 0;
+  return pathInside
+  function pathInside(code) {
+    if (code === 40) {
+      sizeOpen++;
+      effects.consume(code);
+      return pathInside
+    }
+    if (code === 41 && sizeClose < sizeOpen) {
+      return pathAtPunctuation(code)
+    }
     if (
-      events[index][1].type === 'labelImage' &&
-      events[index][0] === 'enter'
+      code === 33 ||
+      code === 34 ||
+      code === 38 ||
+      code === 39 ||
+      code === 41 ||
+      code === 42 ||
+      code === 44 ||
+      code === 46 ||
+      code === 58 ||
+      code === 59 ||
+      code === 60 ||
+      code === 63 ||
+      code === 93 ||
+      code === 95 ||
+      code === 126
     ) {
-      events[index][1];
-      break
+      return effects.check(trail, ok, pathAtPunctuation)(code)
+    }
+    if (
+      code === null ||
+      markdownLineEndingOrSpace(code) ||
+      unicodeWhitespace(code)
+    ) {
+      return ok(code)
     }
-  }
-  events[index + 1][1].type = 'data';
-  events[index + 3][1].type = 'gfmFootnoteCallLabelMarker';
-  const call = {
-    type: 'gfmFootnoteCall',
-    start: Object.assign({}, events[index + 3][1].start),
-    end: Object.assign({}, events[events.length - 1][1].end)
-  };
-  const marker = {
-    type: 'gfmFootnoteCallMarker',
-    start: Object.assign({}, events[index + 3][1].end),
-    end: Object.assign({}, events[index + 3][1].end)
-  };
-  marker.end.column++;
-  marker.end.offset++;
-  marker.end._bufferIndex++;
-  const string = {
-    type: 'gfmFootnoteCallString',
-    start: Object.assign({}, marker.end),
-    end: Object.assign({}, events[events.length - 1][1].start)
-  };
-  const chunk = {
-    type: 'chunkString',
-    contentType: 'string',
-    start: Object.assign({}, string.start),
-    end: Object.assign({}, string.end)
-  };
-  const replacement = [
-    events[index + 1],
-    events[index + 2],
-    ['enter', call, context],
-    events[index + 3],
-    events[index + 4],
-    ['enter', marker, context],
-    ['exit', marker, context],
-    ['enter', string, context],
-    ['enter', chunk, context],
-    ['exit', chunk, context],
-    ['exit', string, context],
-    events[events.length - 2],
-    events[events.length - 1],
-    ['exit', call, context]
-  ];
-  events.splice(index, events.length - index + 1, ...replacement);
-  return events
-}
-function tokenizeGfmFootnoteCall(effects, ok, nok) {
-  const self = this;
-  const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = []);
-  let size = 0;
-  let data;
-  return start
-  function start(code) {
-    effects.enter('gfmFootnoteCall');
-    effects.enter('gfmFootnoteCallLabelMarker');
     effects.consume(code);
-    effects.exit('gfmFootnoteCallLabelMarker');
-    return callStart
+    return pathInside
   }
-  function callStart(code) {
-    if (code !== 94) return nok(code)
-    effects.enter('gfmFootnoteCallMarker');
+  function pathAtPunctuation(code) {
+    if (code === 41) {
+      sizeClose++;
+    }
     effects.consume(code);
-    effects.exit('gfmFootnoteCallMarker');
-    effects.enter('gfmFootnoteCallString');
-    effects.enter('chunkString').contentType = 'string';
-    return callData
+    return pathInside
   }
-  function callData(code) {
+}
+function tokenizeTrail(effects, ok, nok) {
+  return trail
+  function trail(code) {
     if (
-      size > 999 ||
-      (code === 93 && !data) ||
-      code === null ||
-      code === 91 ||
-      markdownLineEndingOrSpace(code)
+      code === 33 ||
+      code === 34 ||
+      code === 39 ||
+      code === 41 ||
+      code === 42 ||
+      code === 44 ||
+      code === 46 ||
+      code === 58 ||
+      code === 59 ||
+      code === 63 ||
+      code === 95 ||
+      code === 126
     ) {
-      return nok(code)
-    }
-    if (code === 93) {
-      effects.exit('chunkString');
-      const token = effects.exit('gfmFootnoteCallString');
-      if (!defined.includes(normalizeIdentifier(self.sliceSerialize(token)))) {
-        return nok(code)
-      }
-      effects.enter('gfmFootnoteCallLabelMarker');
       effects.consume(code);
-      effects.exit('gfmFootnoteCallLabelMarker');
-      effects.exit('gfmFootnoteCall');
-      return ok
-    }
-    if (!markdownLineEndingOrSpace(code)) {
-      data = true;
+      return trail
     }
-    size++;
-    effects.consume(code);
-    return code === 92 ? callEscape : callData
-  }
-  function callEscape(code) {
-    if (code === 91 || code === 92 || code === 93) {
+    if (code === 38) {
       effects.consume(code);
-      size++;
-      return callData
+      return trailCharRefStart
     }
-    return callData(code)
-  }
-}
-function tokenizeDefinitionStart(effects, ok, nok) {
-  const self = this;
-  const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = []);
-  let identifier;
-  let size = 0;
-  let data;
-  return start
-  function start(code) {
-    effects.enter('gfmFootnoteDefinition')._container = true;
-    effects.enter('gfmFootnoteDefinitionLabel');
-    effects.enter('gfmFootnoteDefinitionLabelMarker');
-    effects.consume(code);
-    effects.exit('gfmFootnoteDefinitionLabelMarker');
-    return labelAtMarker
-  }
-  function labelAtMarker(code) {
-    if (code === 94) {
-      effects.enter('gfmFootnoteDefinitionMarker');
+    if (code === 93) {
       effects.consume(code);
-      effects.exit('gfmFootnoteDefinitionMarker');
-      effects.enter('gfmFootnoteDefinitionLabelString');
-      effects.enter('chunkString').contentType = 'string';
-      return labelInside
+      return trailBracketAfter
+    }
+    if (
+      code === 60 ||
+      code === null ||
+      markdownLineEndingOrSpace(code) ||
+      unicodeWhitespace(code)
+    ) {
+      return ok(code)
     }
     return nok(code)
   }
-  function labelInside(code) {
+  function trailBracketAfter(code) {
     if (
-      size > 999 ||
-      (code === 93 && !data) ||
       code === null ||
+      code === 40 ||
       code === 91 ||
-      markdownLineEndingOrSpace(code)
+      markdownLineEndingOrSpace(code) ||
+      unicodeWhitespace(code)
     ) {
-      return nok(code)
-    }
-    if (code === 93) {
-      effects.exit('chunkString');
-      const token = effects.exit('gfmFootnoteDefinitionLabelString');
-      identifier = normalizeIdentifier(self.sliceSerialize(token));
-      effects.enter('gfmFootnoteDefinitionLabelMarker');
-      effects.consume(code);
-      effects.exit('gfmFootnoteDefinitionLabelMarker');
-      effects.exit('gfmFootnoteDefinitionLabel');
-      return labelAfter
-    }
-    if (!markdownLineEndingOrSpace(code)) {
-      data = true;
+      return ok(code)
     }
-    size++;
-    effects.consume(code);
-    return code === 92 ? labelEscape : labelInside
+    return trail(code)
   }
-  function labelEscape(code) {
-    if (code === 91 || code === 92 || code === 93) {
+  function trailCharRefStart(code) {
+    return asciiAlpha(code) ? trailCharRefInside(code) : nok(code)
+  }
+  function trailCharRefInside(code) {
+    if (code === 59) {
       effects.consume(code);
-      size++;
-      return labelInside
+      return trail
     }
-    return labelInside(code)
-  }
-  function labelAfter(code) {
-    if (code === 58) {
-      effects.enter('definitionMarker');
+    if (asciiAlpha(code)) {
       effects.consume(code);
-      effects.exit('definitionMarker');
-      if (!defined.includes(identifier)) {
-        defined.push(identifier);
-      }
-      return factorySpace(
-        effects,
-        whitespaceAfter,
-        'gfmFootnoteDefinitionWhitespace'
-      )
+      return trailCharRefInside
     }
     return nok(code)
   }
-  function whitespaceAfter(code) {
-    return ok(code)
+}
+function tokenizeEmailDomainDotTrail(effects, ok, nok) {
+  return start
+  function start(code) {
+    effects.consume(code);
+    return after
+  }
+  function after(code) {
+    return asciiAlphanumeric(code) ? nok(code) : ok(code)
   }
 }
-function tokenizeDefinitionContinuation(effects, ok, nok) {
-  return effects.check(blankLine, ok, effects.attempt(indent, ok, nok))
+function previousWww(code) {
+  return (
+    code === null ||
+    code === 40 ||
+    code === 42 ||
+    code === 95 ||
+    code === 91 ||
+    code === 93 ||
+    code === 126 ||
+    markdownLineEndingOrSpace(code)
+  )
 }
-function gfmFootnoteDefinitionEnd(effects) {
-  effects.exit('gfmFootnoteDefinition');
+function previousProtocol(code) {
+  return !asciiAlpha(code)
 }
-function tokenizeIndent(effects, ok, nok) {
-  const self = this;
-  return factorySpace(
-    effects,
-    afterPrefix,
-    'gfmFootnoteDefinitionIndent',
-    4 + 1
-  )
-  function afterPrefix(code) {
-    const tail = self.events[self.events.length - 1];
-    return tail &&
-      tail[1].type === 'gfmFootnoteDefinitionIndent' &&
-      tail[2].sliceSerialize(tail[1], true).length === 4
-      ? ok(code)
-      : nok(code)
-  }
+function previousEmail(code) {
+  return !(code === 47 || gfmAtext(code))
 }
-
-function gfmStrikethrough(options) {
-  const options_ = options || {};
-  let single = options_.singleTilde;
-  const tokenizer = {
-    tokenize: tokenizeStrikethrough,
-    resolveAll: resolveAllStrikethrough
-  };
-  if (single === null || single === undefined) {
-    single = true;
-  }
-  return {
-    text: {
-      [126]: tokenizer
-    },
-    insideSpan: {
-      null: [tokenizer]
-    },
-    attentionMarkers: {
-      null: [126]
-    }
-  }
-  function resolveAllStrikethrough(events, context) {
-    let index = -1;
-    while (++index < events.length) {
-      if (
-        events[index][0] === 'enter' &&
-        events[index][1].type === 'strikethroughSequenceTemporary' &&
-        events[index][1]._close
-      ) {
-        let open = index;
-        while (open--) {
-          if (
-            events[open][0] === 'exit' &&
-            events[open][1].type === 'strikethroughSequenceTemporary' &&
-            events[open][1]._open &&
-            events[index][1].end.offset - events[index][1].start.offset ===
-              events[open][1].end.offset - events[open][1].start.offset
-          ) {
-            events[index][1].type = 'strikethroughSequence';
-            events[open][1].type = 'strikethroughSequence';
-            const strikethrough = {
-              type: 'strikethrough',
-              start: Object.assign({}, events[open][1].start),
-              end: Object.assign({}, events[index][1].end)
-            };
-            const text = {
-              type: 'strikethroughText',
-              start: Object.assign({}, events[open][1].end),
-              end: Object.assign({}, events[index][1].start)
-            };
-            const nextEvents = [
-              ['enter', strikethrough, context],
-              ['enter', events[open][1], context],
-              ['exit', events[open][1], context],
-              ['enter', text, context]
-            ];
-            const insideSpan = context.parser.constructs.insideSpan.null;
-            if (insideSpan) {
-              splice(
-                nextEvents,
-                nextEvents.length,
-                0,
-                resolveAll(insideSpan, events.slice(open + 1, index), context)
-              );
-            }
-            splice(nextEvents, nextEvents.length, 0, [
-              ['exit', text, context],
-              ['enter', events[index][1], context],
-              ['exit', events[index][1], context],
-              ['exit', strikethrough, context]
-            ]);
-            splice(events, open - 1, index - open + 3, nextEvents);
-            index = open + nextEvents.length - 2;
-            break
-          }
-        }
-      }
-    }
-    index = -1;
-    while (++index < events.length) {
-      if (events[index][1].type === 'strikethroughSequenceTemporary') {
-        events[index][1].type = 'data';
-      }
-    }
-    return events
-  }
-  function tokenizeStrikethrough(effects, ok, nok) {
-    const previous = this.previous;
-    const events = this.events;
-    let size = 0;
-    return start
-    function start(code) {
-      if (
-        previous === 126 &&
-        events[events.length - 1][1].type !== 'characterEscape'
-      ) {
-        return nok(code)
-      }
-      effects.enter('strikethroughSequenceTemporary');
-      return more(code)
-    }
-    function more(code) {
-      const before = classifyCharacter(previous);
-      if (code === 126) {
-        if (size > 1) return nok(code)
-        effects.consume(code);
-        size++;
-        return more
-      }
-      if (size < 2 && !single) return nok(code)
-      const token = effects.exit('strikethroughSequenceTemporary');
-      const after = classifyCharacter(code);
-      token._open = !after || (after === 2 && Boolean(before));
-      token._close = !before || (before === 2 && Boolean(after));
-      return ok(code)
-    }
-  }
+function gfmAtext(code) {
+  return (
+    code === 43 ||
+    code === 45 ||
+    code === 46 ||
+    code === 95 ||
+    asciiAlphanumeric(code)
+  )
 }
-
-class EditMap {
-  constructor() {
-    this.map = [];
-  }
-  add(index, remove, add) {
-    addImpl(this, index, remove, add);
-  }
-  consume(events) {
-    this.map.sort((a, b) => a[0] - b[0]);
-    if (this.map.length === 0) {
-      return
-    }
-    let index = this.map.length;
-    const vecs = [];
-    while (index > 0) {
-      index -= 1;
-      vecs.push(events.slice(this.map[index][0] + this.map[index][1]));
-      vecs.push(this.map[index][2]);
-      events.length = this.map[index][0];
+function previousUnbalanced(events) {
+  let index = events.length;
+  let result = false;
+  while (index--) {
+    const token = events[index][1];
+    if (
+      (token.type === 'labelLink' || token.type === 'labelImage') &&
+      !token._balanced
+    ) {
+      result = true;
+      break
     }
-    vecs.push([...events]);
-    events.length = 0;
-    let slice = vecs.pop();
-    while (slice) {
-      events.push(...slice);
-      slice = vecs.pop();
+    if (token._gfmAutolinkLiteralWalkedInto) {
+      result = false;
+      break
     }
-    this.map.length = 0;
-  }
-}
-function addImpl(editMap, at, remove, add) {
-  let index = 0;
-  if (remove === 0 && add.length === 0) {
-    return
   }
-  while (index < editMap.map.length) {
-    if (editMap.map[index][0] === at) {
-      editMap.map[index][1] += remove;
-      editMap.map[index][2].push(...add);
-      return
-    }
-    index += 1;
+  if (events.length > 0 && !result) {
+    events[events.length - 1][1]._gfmAutolinkLiteralWalkedInto = true;
   }
-  editMap.map.push([at, remove, add]);
+  return result
 }
 
-function gfmTableAlign(events, index) {
-  let inDelimiterRow = false;
-  const align = [];
-  while (index < events.length) {
-    const event = events[index];
-    if (inDelimiterRow) {
-      if (event[0] === 'enter') {
-        if (event[1].type === 'tableContent') {
-          align.push(
-            events[index + 1][1].type === 'tableDelimiterMarker'
-              ? 'left'
-              : 'none'
-          );
-        }
-      }
-      else if (event[1].type === 'tableContent') {
-        if (events[index - 1][1].type === 'tableDelimiterMarker') {
-          const alignIndex = align.length - 1;
-          align[alignIndex] = align[alignIndex] === 'left' ? 'center' : 'right';
-        }
+const indent = {
+  tokenize: tokenizeIndent,
+  partial: true
+};
+function gfmFootnote() {
+  return {
+    document: {
+      [91]: {
+        tokenize: tokenizeDefinitionStart,
+        continuation: {
+          tokenize: tokenizeDefinitionContinuation
+        },
+        exit: gfmFootnoteDefinitionEnd
       }
-      else if (event[1].type === 'tableDelimiterRow') {
-        break
+    },
+    text: {
+      [91]: {
+        tokenize: tokenizeGfmFootnoteCall
+      },
+      [93]: {
+        add: 'after',
+        tokenize: tokenizePotentialGfmFootnoteCall,
+        resolveTo: resolveToPotentialGfmFootnoteCall
       }
-    } else if (event[0] === 'enter' && event[1].type === 'tableDelimiterRow') {
-      inDelimiterRow = true;
     }
-    index += 1;
   }
-  return align
 }
-
-const gfmTable = {
-  flow: {
-    null: {
-      tokenize: tokenizeTable,
-      resolveAll: resolveTable
+function tokenizePotentialGfmFootnoteCall(effects, ok, nok) {
+  const self = this;
+  let index = self.events.length;
+  const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = []);
+  let labelStart;
+  while (index--) {
+    const token = self.events[index][1];
+    if (token.type === 'labelImage') {
+      labelStart = token;
+      break
+    }
+    if (
+      token.type === 'gfmFootnoteCall' ||
+      token.type === 'labelLink' ||
+      token.type === 'label' ||
+      token.type === 'image' ||
+      token.type === 'link'
+    ) {
+      break
     }
   }
-};
-function tokenizeTable(effects, ok, nok) {
-  const self = this;
-  let size = 0;
-  let sizeB = 0;
-  let seen;
   return start
   function start(code) {
-    let index = self.events.length - 1;
-    while (index > -1) {
-      const type = self.events[index][1].type;
-      if (
-        type === 'lineEnding' ||
-        type === 'linePrefix'
-      )
-        index--;
-      else break
+    if (!labelStart || !labelStart._balanced) {
+      return nok(code)
     }
-    const tail = index > -1 ? self.events[index][1].type : null;
-    const next =
-      tail === 'tableHead' || tail === 'tableRow' ? bodyRowStart : headRowBefore;
-    if (next === bodyRowStart && self.parser.lazy[self.now().line]) {
+    const id = normalizeIdentifier$1(
+      self.sliceSerialize({
+        start: labelStart.end,
+        end: self.now()
+      })
+    );
+    if (id.codePointAt(0) !== 94 || !defined.includes(id.slice(1))) {
       return nok(code)
     }
-    return next(code)
-  }
-  function headRowBefore(code) {
-    effects.enter('tableHead');
-    effects.enter('tableRow');
-    return headRowStart(code)
+    effects.enter('gfmFootnoteCallLabelMarker');
+    effects.consume(code);
+    effects.exit('gfmFootnoteCallLabelMarker');
+    return ok(code)
   }
-  function headRowStart(code) {
-    if (code === 124) {
-      return headRowBreak(code)
+}
+function resolveToPotentialGfmFootnoteCall(events, context) {
+  let index = events.length;
+  while (index--) {
+    if (
+      events[index][1].type === 'labelImage' &&
+      events[index][0] === 'enter'
+    ) {
+      events[index][1];
+      break
     }
-    seen = true;
-    sizeB += 1;
-    return headRowBreak(code)
   }
-  function headRowBreak(code) {
-    if (code === null) {
+  events[index + 1][1].type = 'data';
+  events[index + 3][1].type = 'gfmFootnoteCallLabelMarker';
+  const call = {
+    type: 'gfmFootnoteCall',
+    start: Object.assign({}, events[index + 3][1].start),
+    end: Object.assign({}, events[events.length - 1][1].end)
+  };
+  const marker = {
+    type: 'gfmFootnoteCallMarker',
+    start: Object.assign({}, events[index + 3][1].end),
+    end: Object.assign({}, events[index + 3][1].end)
+  };
+  marker.end.column++;
+  marker.end.offset++;
+  marker.end._bufferIndex++;
+  const string = {
+    type: 'gfmFootnoteCallString',
+    start: Object.assign({}, marker.end),
+    end: Object.assign({}, events[events.length - 1][1].start)
+  };
+  const chunk = {
+    type: 'chunkString',
+    contentType: 'string',
+    start: Object.assign({}, string.start),
+    end: Object.assign({}, string.end)
+  };
+  const replacement = [
+    events[index + 1],
+    events[index + 2],
+    ['enter', call, context],
+    events[index + 3],
+    events[index + 4],
+    ['enter', marker, context],
+    ['exit', marker, context],
+    ['enter', string, context],
+    ['enter', chunk, context],
+    ['exit', chunk, context],
+    ['exit', string, context],
+    events[events.length - 2],
+    events[events.length - 1],
+    ['exit', call, context]
+  ];
+  events.splice(index, events.length - index + 1, ...replacement);
+  return events
+}
+function tokenizeGfmFootnoteCall(effects, ok, nok) {
+  const self = this;
+  const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = []);
+  let size = 0;
+  let data;
+  return start
+  function start(code) {
+    effects.enter('gfmFootnoteCall');
+    effects.enter('gfmFootnoteCallLabelMarker');
+    effects.consume(code);
+    effects.exit('gfmFootnoteCallLabelMarker');
+    return callStart
+  }
+  function callStart(code) {
+    if (code !== 94) return nok(code)
+    effects.enter('gfmFootnoteCallMarker');
+    effects.consume(code);
+    effects.exit('gfmFootnoteCallMarker');
+    effects.enter('gfmFootnoteCallString');
+    effects.enter('chunkString').contentType = 'string';
+    return callData
+  }
+  function callData(code) {
+    if (
+      size > 999 ||
+      (code === 93 && !data) ||
+      code === null ||
+      code === 91 ||
+      markdownLineEndingOrSpace(code)
+    ) {
       return nok(code)
     }
-    if (markdownLineEnding(code)) {
-      if (sizeB > 1) {
-        sizeB = 0;
-        self.interrupt = true;
-        effects.exit('tableRow');
-        effects.enter('lineEnding');
-        effects.consume(code);
-        effects.exit('lineEnding');
-        return headDelimiterStart
+    if (code === 93) {
+      effects.exit('chunkString');
+      const token = effects.exit('gfmFootnoteCallString');
+      if (!defined.includes(normalizeIdentifier$1(self.sliceSerialize(token)))) {
+        return nok(code)
       }
-      return nok(code)
-    }
-    if (markdownSpace(code)) {
-      return factorySpace(effects, headRowBreak, 'whitespace')(code)
-    }
-    sizeB += 1;
-    if (seen) {
-      seen = false;
-      size += 1;
-    }
-    if (code === 124) {
-      effects.enter('tableCellDivider');
+      effects.enter('gfmFootnoteCallLabelMarker');
       effects.consume(code);
-      effects.exit('tableCellDivider');
-      seen = true;
-      return headRowBreak
+      effects.exit('gfmFootnoteCallLabelMarker');
+      effects.exit('gfmFootnoteCall');
+      return ok
     }
-    effects.enter('data');
-    return headRowData(code)
-  }
-  function headRowData(code) {
-    if (code === null || code === 124 || markdownLineEndingOrSpace(code)) {
-      effects.exit('data');
-      return headRowBreak(code)
+    if (!markdownLineEndingOrSpace(code)) {
+      data = true;
     }
+    size++;
     effects.consume(code);
-    return code === 92 ? headRowEscape : headRowData
+    return code === 92 ? callEscape : callData
   }
-  function headRowEscape(code) {
-    if (code === 92 || code === 124) {
+  function callEscape(code) {
+    if (code === 91 || code === 92 || code === 93) {
       effects.consume(code);
-      return headRowData
+      size++;
+      return callData
     }
-    return headRowData(code)
+    return callData(code)
   }
-  function headDelimiterStart(code) {
-    self.interrupt = false;
-    if (self.parser.lazy[self.now().line]) {
-      return nok(code)
-    }
-    effects.enter('tableDelimiterRow');
-    seen = false;
-    if (markdownSpace(code)) {
-      return factorySpace(
-        effects,
-        headDelimiterBefore,
-        'linePrefix',
-        self.parser.constructs.disable.null.includes('codeIndented')
-          ? undefined
-          : 4
-      )(code)
-    }
-    return headDelimiterBefore(code)
+}
+function tokenizeDefinitionStart(effects, ok, nok) {
+  const self = this;
+  const defined = self.parser.gfmFootnotes || (self.parser.gfmFootnotes = []);
+  let identifier;
+  let size = 0;
+  let data;
+  return start
+  function start(code) {
+    effects.enter('gfmFootnoteDefinition')._container = true;
+    effects.enter('gfmFootnoteDefinitionLabel');
+    effects.enter('gfmFootnoteDefinitionLabelMarker');
+    effects.consume(code);
+    effects.exit('gfmFootnoteDefinitionLabelMarker');
+    return labelAtMarker
   }
-  function headDelimiterBefore(code) {
-    if (code === 45 || code === 58) {
-      return headDelimiterValueBefore(code)
-    }
-    if (code === 124) {
-      seen = true;
-      effects.enter('tableCellDivider');
+  function labelAtMarker(code) {
+    if (code === 94) {
+      effects.enter('gfmFootnoteDefinitionMarker');
       effects.consume(code);
-      effects.exit('tableCellDivider');
-      return headDelimiterCellBefore
+      effects.exit('gfmFootnoteDefinitionMarker');
+      effects.enter('gfmFootnoteDefinitionLabelString');
+      effects.enter('chunkString').contentType = 'string';
+      return labelInside
     }
-    return headDelimiterNok(code)
+    return nok(code)
   }
-  function headDelimiterCellBefore(code) {
-    if (markdownSpace(code)) {
-      return factorySpace(effects, headDelimiterValueBefore, 'whitespace')(code)
+  function labelInside(code) {
+    if (
+      size > 999 ||
+      (code === 93 && !data) ||
+      code === null ||
+      code === 91 ||
+      markdownLineEndingOrSpace(code)
+    ) {
+      return nok(code)
     }
-    return headDelimiterValueBefore(code)
-  }
-  function headDelimiterValueBefore(code) {
-    if (code === 58) {
-      sizeB += 1;
-      seen = true;
-      effects.enter('tableDelimiterMarker');
+    if (code === 93) {
+      effects.exit('chunkString');
+      const token = effects.exit('gfmFootnoteDefinitionLabelString');
+      identifier = normalizeIdentifier$1(self.sliceSerialize(token));
+      effects.enter('gfmFootnoteDefinitionLabelMarker');
       effects.consume(code);
-      effects.exit('tableDelimiterMarker');
-      return headDelimiterLeftAlignmentAfter
-    }
-    if (code === 45) {
-      sizeB += 1;
-      return headDelimiterLeftAlignmentAfter(code)
-    }
-    if (code === null || markdownLineEnding(code)) {
-      return headDelimiterCellAfter(code)
+      effects.exit('gfmFootnoteDefinitionLabelMarker');
+      effects.exit('gfmFootnoteDefinitionLabel');
+      return labelAfter
     }
-    return headDelimiterNok(code)
-  }
-  function headDelimiterLeftAlignmentAfter(code) {
-    if (code === 45) {
-      effects.enter('tableDelimiterFiller');
-      return headDelimiterFiller(code)
+    if (!markdownLineEndingOrSpace(code)) {
+      data = true;
     }
-    return headDelimiterNok(code)
+    size++;
+    effects.consume(code);
+    return code === 92 ? labelEscape : labelInside
   }
-  function headDelimiterFiller(code) {
-    if (code === 45) {
+  function labelEscape(code) {
+    if (code === 91 || code === 92 || code === 93) {
       effects.consume(code);
-      return headDelimiterFiller
+      size++;
+      return labelInside
     }
+    return labelInside(code)
+  }
+  function labelAfter(code) {
     if (code === 58) {
-      seen = true;
-      effects.exit('tableDelimiterFiller');
-      effects.enter('tableDelimiterMarker');
+      effects.enter('definitionMarker');
       effects.consume(code);
-      effects.exit('tableDelimiterMarker');
-      return headDelimiterRightAlignmentAfter
-    }
-    effects.exit('tableDelimiterFiller');
-    return headDelimiterRightAlignmentAfter(code)
-  }
-  function headDelimiterRightAlignmentAfter(code) {
-    if (markdownSpace(code)) {
-      return factorySpace(effects, headDelimiterCellAfter, 'whitespace')(code)
-    }
-    return headDelimiterCellAfter(code)
-  }
-  function headDelimiterCellAfter(code) {
-    if (code === 124) {
-      return headDelimiterBefore(code)
-    }
-    if (code === null || markdownLineEnding(code)) {
-      if (!seen || size !== sizeB) {
-        return headDelimiterNok(code)
+      effects.exit('definitionMarker');
+      if (!defined.includes(identifier)) {
+        defined.push(identifier);
       }
-      effects.exit('tableDelimiterRow');
-      effects.exit('tableHead');
-      return ok(code)
+      return factorySpace(
+        effects,
+        whitespaceAfter,
+        'gfmFootnoteDefinitionWhitespace'
+      )
     }
-    return headDelimiterNok(code)
-  }
-  function headDelimiterNok(code) {
     return nok(code)
   }
-  function bodyRowStart(code) {
-    effects.enter('tableRow');
-    return bodyRowBreak(code)
+  function whitespaceAfter(code) {
+    return ok(code)
   }
-  function bodyRowBreak(code) {
-    if (code === 124) {
-      effects.enter('tableCellDivider');
-      effects.consume(code);
-      effects.exit('tableCellDivider');
-      return bodyRowBreak
-    }
-    if (code === null || markdownLineEnding(code)) {
-      effects.exit('tableRow');
-      return ok(code)
-    }
-    if (markdownSpace(code)) {
-      return factorySpace(effects, bodyRowBreak, 'whitespace')(code)
-    }
-    effects.enter('data');
-    return bodyRowData(code)
+}
+function tokenizeDefinitionContinuation(effects, ok, nok) {
+  return effects.check(blankLine, ok, effects.attempt(indent, ok, nok))
+}
+function gfmFootnoteDefinitionEnd(effects) {
+  effects.exit('gfmFootnoteDefinition');
+}
+function tokenizeIndent(effects, ok, nok) {
+  const self = this;
+  return factorySpace(
+    effects,
+    afterPrefix,
+    'gfmFootnoteDefinitionIndent',
+    4 + 1
+  )
+  function afterPrefix(code) {
+    const tail = self.events[self.events.length - 1];
+    return tail &&
+      tail[1].type === 'gfmFootnoteDefinitionIndent' &&
+      tail[2].sliceSerialize(tail[1], true).length === 4
+      ? ok(code)
+      : nok(code)
   }
-  function bodyRowData(code) {
-    if (code === null || code === 124 || markdownLineEndingOrSpace(code)) {
-      effects.exit('data');
-      return bodyRowBreak(code)
-    }
-    effects.consume(code);
-    return code === 92 ? bodyRowEscape : bodyRowData
+}
+
+function gfmStrikethrough(options) {
+  const options_ = options || {};
+  let single = options_.singleTilde;
+  const tokenizer = {
+    tokenize: tokenizeStrikethrough,
+    resolveAll: resolveAllStrikethrough
+  };
+  if (single === null || single === undefined) {
+    single = true;
   }
-  function bodyRowEscape(code) {
-    if (code === 92 || code === 124) {
-      effects.consume(code);
-      return bodyRowData
+  return {
+    text: {
+      [126]: tokenizer
+    },
+    insideSpan: {
+      null: [tokenizer]
+    },
+    attentionMarkers: {
+      null: [126]
     }
-    return bodyRowData(code)
   }
-}
-function resolveTable(events, context) {
-  let index = -1;
-  let inFirstCellAwaitingPipe = true;
-  let rowKind = 0;
-  let lastCell = [0, 0, 0, 0];
-  let cell = [0, 0, 0, 0];
-  let afterHeadAwaitingFirstBodyRow = false;
-  let lastTableEnd = 0;
-  let currentTable;
-  let currentBody;
-  let currentCell;
-  const map = new EditMap();
-  while (++index < events.length) {
-    const event = events[index];
-    const token = event[1];
-    if (event[0] === 'enter') {
-      if (token.type === 'tableHead') {
-        afterHeadAwaitingFirstBodyRow = false;
-        if (lastTableEnd !== 0) {
-          flushTableEnd(map, context, lastTableEnd, currentTable, currentBody);
-          currentBody = undefined;
-          lastTableEnd = 0;
-        }
-        currentTable = {
-          type: 'table',
-          start: Object.assign({}, token.start),
-          end: Object.assign({}, token.end)
-        };
-        map.add(index, 0, [['enter', currentTable, context]]);
-      } else if (
-        token.type === 'tableRow' ||
-        token.type === 'tableDelimiterRow'
-      ) {
-        inFirstCellAwaitingPipe = true;
-        currentCell = undefined;
-        lastCell = [0, 0, 0, 0];
-        cell = [0, index + 1, 0, 0];
-        if (afterHeadAwaitingFirstBodyRow) {
-          afterHeadAwaitingFirstBodyRow = false;
-          currentBody = {
-            type: 'tableBody',
-            start: Object.assign({}, token.start),
-            end: Object.assign({}, token.end)
-          };
-          map.add(index, 0, [['enter', currentBody, context]]);
-        }
-        rowKind = token.type === 'tableDelimiterRow' ? 2 : currentBody ? 3 : 1;
-      }
-      else if (
-        rowKind &&
-        (token.type === 'data' ||
-          token.type === 'tableDelimiterMarker' ||
-          token.type === 'tableDelimiterFiller')
+  function resolveAllStrikethrough(events, context) {
+    let index = -1;
+    while (++index < events.length) {
+      if (
+        events[index][0] === 'enter' &&
+        events[index][1].type === 'strikethroughSequenceTemporary' &&
+        events[index][1]._close
       ) {
-        inFirstCellAwaitingPipe = false;
-        if (cell[2] === 0) {
-          if (lastCell[1] !== 0) {
-            cell[0] = cell[1];
-            currentCell = flushCell(
-              map,
-              context,
-              lastCell,
-              rowKind,
-              undefined,
-              currentCell
-            );
-            lastCell = [0, 0, 0, 0];
-          }
-          cell[2] = index;
-        }
-      } else if (token.type === 'tableCellDivider') {
-        if (inFirstCellAwaitingPipe) {
-          inFirstCellAwaitingPipe = false;
-        } else {
-          if (lastCell[1] !== 0) {
-            cell[0] = cell[1];
-            currentCell = flushCell(
-              map,
-              context,
-              lastCell,
-              rowKind,
-              undefined,
-              currentCell
-            );
+        let open = index;
+        while (open--) {
+          if (
+            events[open][0] === 'exit' &&
+            events[open][1].type === 'strikethroughSequenceTemporary' &&
+            events[open][1]._open &&
+            events[index][1].end.offset - events[index][1].start.offset ===
+              events[open][1].end.offset - events[open][1].start.offset
+          ) {
+            events[index][1].type = 'strikethroughSequence';
+            events[open][1].type = 'strikethroughSequence';
+            const strikethrough = {
+              type: 'strikethrough',
+              start: Object.assign({}, events[open][1].start),
+              end: Object.assign({}, events[index][1].end)
+            };
+            const text = {
+              type: 'strikethroughText',
+              start: Object.assign({}, events[open][1].end),
+              end: Object.assign({}, events[index][1].start)
+            };
+            const nextEvents = [
+              ['enter', strikethrough, context],
+              ['enter', events[open][1], context],
+              ['exit', events[open][1], context],
+              ['enter', text, context]
+            ];
+            const insideSpan = context.parser.constructs.insideSpan.null;
+            if (insideSpan) {
+              splice(
+                nextEvents,
+                nextEvents.length,
+                0,
+                resolveAll(insideSpan, events.slice(open + 1, index), context)
+              );
+            }
+            splice(nextEvents, nextEvents.length, 0, [
+              ['exit', text, context],
+              ['enter', events[index][1], context],
+              ['exit', events[index][1], context],
+              ['exit', strikethrough, context]
+            ]);
+            splice(events, open - 1, index - open + 3, nextEvents);
+            index = open + nextEvents.length - 2;
+            break
           }
-          lastCell = cell;
-          cell = [lastCell[1], index, 0, 0];
         }
       }
     }
-    else if (token.type === 'tableHead') {
-      afterHeadAwaitingFirstBodyRow = true;
-      lastTableEnd = index;
-    } else if (
-      token.type === 'tableRow' ||
-      token.type === 'tableDelimiterRow'
-    ) {
-      lastTableEnd = index;
-      if (lastCell[1] !== 0) {
-        cell[0] = cell[1];
-        currentCell = flushCell(
-          map,
-          context,
-          lastCell,
-          rowKind,
-          index,
-          currentCell
-        );
-      } else if (cell[1] !== 0) {
-        currentCell = flushCell(map, context, cell, rowKind, index, currentCell);
+    index = -1;
+    while (++index < events.length) {
+      if (events[index][1].type === 'strikethroughSequenceTemporary') {
+        events[index][1].type = 'data';
       }
-      rowKind = 0;
-    } else if (
-      rowKind &&
-      (token.type === 'data' ||
-        token.type === 'tableDelimiterMarker' ||
-        token.type === 'tableDelimiterFiller')
-    ) {
-      cell[3] = index;
-    }
-  }
-  if (lastTableEnd !== 0) {
-    flushTableEnd(map, context, lastTableEnd, currentTable, currentBody);
-  }
-  map.consume(context.events);
-  index = -1;
-  while (++index < context.events.length) {
-    const event = context.events[index];
-    if (event[0] === 'enter' && event[1].type === 'table') {
-      event[1]._align = gfmTableAlign(context.events, index);
     }
+    return events
   }
-  return events
-}
-function flushCell(map, context, range, rowKind, rowEnd, previousCell) {
-  const groupName =
-    rowKind === 1
-      ? 'tableHeader'
-      : rowKind === 2
-      ? 'tableDelimiter'
-      : 'tableData';
-  const valueName = 'tableContent';
-  if (range[0] !== 0) {
-    previousCell.end = Object.assign({}, getPoint(context.events, range[0]));
-    map.add(range[0], 0, [['exit', previousCell, context]]);
-  }
-  const now = getPoint(context.events, range[1]);
-  previousCell = {
-    type: groupName,
-    start: Object.assign({}, now),
-    end: Object.assign({}, now)
-  };
-  map.add(range[1], 0, [['enter', previousCell, context]]);
-  if (range[2] !== 0) {
-    const relatedStart = getPoint(context.events, range[2]);
-    const relatedEnd = getPoint(context.events, range[3]);
-    const valueToken = {
-      type: valueName,
-      start: Object.assign({}, relatedStart),
-      end: Object.assign({}, relatedEnd)
-    };
-    map.add(range[2], 0, [['enter', valueToken, context]]);
-    if (rowKind !== 2) {
-      const start = context.events[range[2]];
-      const end = context.events[range[3]];
-      start[1].end = Object.assign({}, end[1].end);
-      start[1].type = 'chunkText';
-      start[1].contentType = 'text';
-      if (range[3] > range[2] + 1) {
-        const a = range[2] + 1;
-        const b = range[3] - range[2] - 1;
-        map.add(a, b, []);
+  function tokenizeStrikethrough(effects, ok, nok) {
+    const previous = this.previous;
+    const events = this.events;
+    let size = 0;
+    return start
+    function start(code) {
+      if (
+        previous === 126 &&
+        events[events.length - 1][1].type !== 'characterEscape'
+      ) {
+        return nok(code)
+      }
+      effects.enter('strikethroughSequenceTemporary');
+      return more(code)
+    }
+    function more(code) {
+      const before = classifyCharacter(previous);
+      if (code === 126) {
+        if (size > 1) return nok(code)
+        effects.consume(code);
+        size++;
+        return more
       }
+      if (size < 2 && !single) return nok(code)
+      const token = effects.exit('strikethroughSequenceTemporary');
+      const after = classifyCharacter(code);
+      token._open = !after || (after === 2 && Boolean(before));
+      token._close = !before || (before === 2 && Boolean(after));
+      return ok(code)
     }
-    map.add(range[3] + 1, 0, [['exit', valueToken, context]]);
   }
-  if (rowEnd !== undefined) {
-    previousCell.end = Object.assign({}, getPoint(context.events, rowEnd));
-    map.add(rowEnd, 0, [['exit', previousCell, context]]);
-    previousCell = undefined;
-  }
-  return previousCell
-}
-function flushTableEnd(map, context, index, table, tableBody) {
-  const exits = [];
-  const related = getPoint(context.events, index);
-  if (tableBody) {
-    tableBody.end = Object.assign({}, related);
-    exits.push(['exit', tableBody, context]);
-  }
-  table.end = Object.assign({}, related);
-  exits.push(['exit', table, context]);
-  map.add(index + 1, 0, exits);
-}
-function getPoint(events, index) {
-  const event = events[index];
-  const side = event[0] === 'enter' ? 'start' : 'end';
-  return event[1][side]
 }
 
-const tasklistCheck = {
-  tokenize: tokenizeTasklistCheck
-};
-const gfmTaskListItem = {
-  text: {
-    [91]: tasklistCheck
-  }
-};
-function tokenizeTasklistCheck(effects, ok, nok) {
-  const self = this;
-  return open
-  function open(code) {
-    if (
-      self.previous !== null ||
-      !self._gfmTasklistFirstContentOfListItem
-    ) {
-      return nok(code)
-    }
-    effects.enter('taskListCheck');
-    effects.enter('taskListCheckMarker');
-    effects.consume(code);
-    effects.exit('taskListCheckMarker');
-    return inside
+class EditMap {
+  constructor() {
+    this.map = [];
   }
-  function inside(code) {
-    if (markdownLineEndingOrSpace(code)) {
-      effects.enter('taskListCheckValueUnchecked');
-      effects.consume(code);
-      effects.exit('taskListCheckValueUnchecked');
-      return close
-    }
-    if (code === 88 || code === 120) {
-      effects.enter('taskListCheckValueChecked');
-      effects.consume(code);
-      effects.exit('taskListCheckValueChecked');
-      return close
-    }
-    return nok(code)
+  add(index, remove, add) {
+    addImpl(this, index, remove, add);
   }
-  function close(code) {
-    if (code === 93) {
-      effects.enter('taskListCheckMarker');
-      effects.consume(code);
-      effects.exit('taskListCheckMarker');
-      effects.exit('taskListCheck');
-      return after
+  consume(events) {
+    this.map.sort(function (a, b) {
+      return a[0] - b[0]
+    });
+    if (this.map.length === 0) {
+      return
     }
-    return nok(code)
-  }
-  function after(code) {
-    if (markdownLineEnding(code)) {
-      return ok(code)
+    let index = this.map.length;
+    const vecs = [];
+    while (index > 0) {
+      index -= 1;
+      vecs.push(
+        events.slice(this.map[index][0] + this.map[index][1]),
+        this.map[index][2]
+      );
+      events.length = this.map[index][0];
     }
-    if (markdownSpace(code)) {
-      return effects.check(
-        {
-          tokenize: spaceThenNonSpace
-        },
-        ok,
-        nok
-      )(code)
+    vecs.push([...events]);
+    events.length = 0;
+    let slice = vecs.pop();
+    while (slice) {
+      events.push(...slice);
+      slice = vecs.pop();
     }
-    return nok(code)
-  }
-}
-function spaceThenNonSpace(effects, ok, nok) {
-  return factorySpace(effects, after, 'whitespace')
-  function after(code) {
-    return code === null ? nok(code) : ok(code)
+    this.map.length = 0;
   }
 }
-
-function gfm(options) {
-  return combineExtensions([
-    gfmAutolinkLiteral,
-    gfmFootnote(),
-    gfmStrikethrough(options),
-    gfmTable,
-    gfmTaskListItem
-  ])
-}
-
-function ccount(value, character) {
-  const source = String(value);
-  if (typeof character !== 'string') {
-    throw new TypeError('Expected character')
+function addImpl(editMap, at, remove, add) {
+  let index = 0;
+  if (remove === 0 && add.length === 0) {
+    return
   }
-  let count = 0;
-  let index = source.indexOf(character);
-  while (index !== -1) {
-    count++;
-    index = source.indexOf(character, index + character.length);
+  while (index < editMap.map.length) {
+    if (editMap.map[index][0] === at) {
+      editMap.map[index][1] += remove;
+      editMap.map[index][2].push(...add);
+      return
+    }
+    index += 1;
   }
-  return count
-}
-
-function escapeStringRegexp(string) {
-	if (typeof string !== 'string') {
-		throw new TypeError('Expected a string');
-	}
-	return string
-		.replace(/[|\\{}()[\]^$+*?.]/g, '\\$&')
-		.replace(/-/g, '\\x2d');
+  editMap.map.push([at, remove, add]);
 }
 
-const own$2 = {}.hasOwnProperty;
-const findAndReplace =
-  (
-    function (tree, find, replace, options) {
-      let settings;
-      let schema;
-      if (typeof find === 'string' || find instanceof RegExp) {
-        schema = [[find, replace]];
-        settings = options;
-      } else {
-        schema = find;
-        settings = replace;
-      }
-      if (!settings) {
-        settings = {};
-      }
-      const ignored = convert(settings.ignore || []);
-      const pairs = toPairs(schema);
-      let pairIndex = -1;
-      while (++pairIndex < pairs.length) {
-        visitParents$1(tree, 'text', visitor);
-      }
-      return tree
-      function visitor(node, parents) {
-        let index = -1;
-        let grandparent;
-        while (++index < parents.length) {
-          const parent = parents[index];
-          if (
-            ignored(
-              parent,
-              grandparent ? grandparent.children.indexOf(parent) : undefined,
-              grandparent
-            )
-          ) {
-            return
-          }
-          grandparent = parent;
-        }
-        if (grandparent) {
-          return handler(node, parents)
+function gfmTableAlign(events, index) {
+  let inDelimiterRow = false;
+  const align = [];
+  while (index < events.length) {
+    const event = events[index];
+    if (inDelimiterRow) {
+      if (event[0] === 'enter') {
+        if (event[1].type === 'tableContent') {
+          align.push(
+            events[index + 1][1].type === 'tableDelimiterMarker'
+              ? 'left'
+              : 'none'
+          );
         }
       }
-      function handler(node, parents) {
-        const parent = parents[parents.length - 1];
-        const find = pairs[pairIndex][0];
-        const replace = pairs[pairIndex][1];
-        let start = 0;
-        const index = parent.children.indexOf(node);
-        let change = false;
-        let nodes = [];
-        find.lastIndex = 0;
-        let match = find.exec(node.value);
-        while (match) {
-          const position = match.index;
-          const matchObject = {
-            index: match.index,
-            input: match.input,
-            stack: [...parents, node]
-          };
-          let value = replace(...match, matchObject);
-          if (typeof value === 'string') {
-            value = value.length > 0 ? {type: 'text', value} : undefined;
-          }
-          if (value !== false) {
-            if (start !== position) {
-              nodes.push({
-                type: 'text',
-                value: node.value.slice(start, position)
-              });
-            }
-            if (Array.isArray(value)) {
-              nodes.push(...value);
-            } else if (value) {
-              nodes.push(value);
-            }
-            start = position + match[0].length;
-            change = true;
-          }
-          if (!find.global) {
-            break
-          }
-          match = find.exec(node.value);
-        }
-        if (change) {
-          if (start < node.value.length) {
-            nodes.push({type: 'text', value: node.value.slice(start)});
-          }
-          parent.children.splice(index, 1, ...nodes);
-        } else {
-          nodes = [node];
+      else if (event[1].type === 'tableContent') {
+        if (events[index - 1][1].type === 'tableDelimiterMarker') {
+          const alignIndex = align.length - 1;
+          align[alignIndex] = align[alignIndex] === 'left' ? 'center' : 'right';
         }
-        return index + nodes.length
       }
+      else if (event[1].type === 'tableDelimiterRow') {
+        break
+      }
+    } else if (event[0] === 'enter' && event[1].type === 'tableDelimiterRow') {
+      inDelimiterRow = true;
     }
-  );
-function toPairs(schema) {
-  const result = [];
-  if (typeof schema !== 'object') {
-    throw new TypeError('Expected array or object as schema')
+    index += 1;
+  }
+  return align
+}
+
+function gfmTable() {
+  return {
+    flow: {
+      null: {
+        tokenize: tokenizeTable,
+        resolveAll: resolveTable
+      }
+    }
+  }
+}
+function tokenizeTable(effects, ok, nok) {
+  const self = this;
+  let size = 0;
+  let sizeB = 0;
+  let seen;
+  return start
+  function start(code) {
+    let index = self.events.length - 1;
+    while (index > -1) {
+      const type = self.events[index][1].type;
+      if (
+        type === 'lineEnding' ||
+        type === 'linePrefix'
+      )
+        index--;
+      else break
+    }
+    const tail = index > -1 ? self.events[index][1].type : null;
+    const next =
+      tail === 'tableHead' || tail === 'tableRow' ? bodyRowStart : headRowBefore;
+    if (next === bodyRowStart && self.parser.lazy[self.now().line]) {
+      return nok(code)
+    }
+    return next(code)
+  }
+  function headRowBefore(code) {
+    effects.enter('tableHead');
+    effects.enter('tableRow');
+    return headRowStart(code)
+  }
+  function headRowStart(code) {
+    if (code === 124) {
+      return headRowBreak(code)
+    }
+    seen = true;
+    sizeB += 1;
+    return headRowBreak(code)
   }
-  if (Array.isArray(schema)) {
-    let index = -1;
-    while (++index < schema.length) {
-      result.push([
-        toExpression(schema[index][0]),
-        toFunction(schema[index][1])
-      ]);
+  function headRowBreak(code) {
+    if (code === null) {
+      return nok(code)
     }
-  } else {
-    let key;
-    for (key in schema) {
-      if (own$2.call(schema, key)) {
-        result.push([toExpression(key), toFunction(schema[key])]);
+    if (markdownLineEnding(code)) {
+      if (sizeB > 1) {
+        sizeB = 0;
+        self.interrupt = true;
+        effects.exit('tableRow');
+        effects.enter('lineEnding');
+        effects.consume(code);
+        effects.exit('lineEnding');
+        return headDelimiterStart
       }
+      return nok(code)
     }
+    if (markdownSpace(code)) {
+      return factorySpace(effects, headRowBreak, 'whitespace')(code)
+    }
+    sizeB += 1;
+    if (seen) {
+      seen = false;
+      size += 1;
+    }
+    if (code === 124) {
+      effects.enter('tableCellDivider');
+      effects.consume(code);
+      effects.exit('tableCellDivider');
+      seen = true;
+      return headRowBreak
+    }
+    effects.enter('data');
+    return headRowData(code)
   }
-  return result
-}
-function toExpression(find) {
-  return typeof find === 'string' ? new RegExp(escapeStringRegexp(find), 'g') : find
-}
-function toFunction(replace) {
-  return typeof replace === 'function' ? replace : () => replace
-}
-
-const inConstruct = 'phrasing';
-const notInConstruct = ['autolink', 'link', 'image', 'label'];
-const gfmAutolinkLiteralFromMarkdown = {
-  transforms: [transformGfmAutolinkLiterals],
-  enter: {
-    literalAutolink: enterLiteralAutolink,
-    literalAutolinkEmail: enterLiteralAutolinkValue,
-    literalAutolinkHttp: enterLiteralAutolinkValue,
-    literalAutolinkWww: enterLiteralAutolinkValue
-  },
-  exit: {
-    literalAutolink: exitLiteralAutolink,
-    literalAutolinkEmail: exitLiteralAutolinkEmail,
-    literalAutolinkHttp: exitLiteralAutolinkHttp,
-    literalAutolinkWww: exitLiteralAutolinkWww
-  }
-};
-const gfmAutolinkLiteralToMarkdown = {
-  unsafe: [
-    {
-      character: '@',
-      before: '[+\\-.\\w]',
-      after: '[\\-.\\w]',
-      inConstruct,
-      notInConstruct
-    },
-    {
-      character: '.',
-      before: '[Ww]',
-      after: '[\\-.\\w]',
-      inConstruct,
-      notInConstruct
-    },
-    {character: ':', before: '[ps]', after: '\\/', inConstruct, notInConstruct}
-  ]
-};
-function enterLiteralAutolink(token) {
-  this.enter({type: 'link', title: null, url: '', children: []}, token);
-}
-function enterLiteralAutolinkValue(token) {
-  this.config.enter.autolinkProtocol.call(this, token);
-}
-function exitLiteralAutolinkHttp(token) {
-  this.config.exit.autolinkProtocol.call(this, token);
-}
-function exitLiteralAutolinkWww(token) {
-  this.config.exit.data.call(this, token);
-  const node =  (this.stack[this.stack.length - 1]);
-  node.url = 'http://' + this.sliceSerialize(token);
-}
-function exitLiteralAutolinkEmail(token) {
-  this.config.exit.autolinkEmail.call(this, token);
-}
-function exitLiteralAutolink(token) {
-  this.exit(token);
-}
-function transformGfmAutolinkLiterals(tree) {
-  findAndReplace(
-    tree,
-    [
-      [/(https?:\/\/|www(?=\.))([-.\w]+)([^ \t\r\n]*)/gi, findUrl],
-      [/([-.\w+]+)@([-\w]+(?:\.[-\w]+)+)/g, findEmail]
-    ],
-    {ignore: ['link', 'linkReference']}
-  );
-}
-function findUrl(_, protocol, domain, path, match) {
-  let prefix = '';
-  if (!previous(match)) {
-    return false
-  }
-  if (/^w/i.test(protocol)) {
-    domain = protocol + domain;
-    protocol = '';
-    prefix = 'http://';
-  }
-  if (!isCorrectDomain(domain)) {
-    return false
+  function headRowData(code) {
+    if (code === null || code === 124 || markdownLineEndingOrSpace(code)) {
+      effects.exit('data');
+      return headRowBreak(code)
+    }
+    effects.consume(code);
+    return code === 92 ? headRowEscape : headRowData
   }
-  const parts = splitUrl(domain + path);
-  if (!parts[0]) return false
-  const result = {
-    type: 'link',
-    title: null,
-    url: prefix + protocol + parts[0],
-    children: [{type: 'text', value: protocol + parts[0]}]
-  };
-  if (parts[1]) {
-    return [result, {type: 'text', value: parts[1]}]
+  function headRowEscape(code) {
+    if (code === 92 || code === 124) {
+      effects.consume(code);
+      return headRowData
+    }
+    return headRowData(code)
   }
-  return result
-}
-function findEmail(_, atext, label, match) {
-  if (
-    !previous(match, true) ||
-    /[-\d_]$/.test(label)
-  ) {
-    return false
+  function headDelimiterStart(code) {
+    self.interrupt = false;
+    if (self.parser.lazy[self.now().line]) {
+      return nok(code)
+    }
+    effects.enter('tableDelimiterRow');
+    seen = false;
+    if (markdownSpace(code)) {
+      return factorySpace(
+        effects,
+        headDelimiterBefore,
+        'linePrefix',
+        self.parser.constructs.disable.null.includes('codeIndented')
+          ? undefined
+          : 4
+      )(code)
+    }
+    return headDelimiterBefore(code)
   }
-  return {
-    type: 'link',
-    title: null,
-    url: 'mailto:' + atext + '@' + label,
-    children: [{type: 'text', value: atext + '@' + label}]
+  function headDelimiterBefore(code) {
+    if (code === 45 || code === 58) {
+      return headDelimiterValueBefore(code)
+    }
+    if (code === 124) {
+      seen = true;
+      effects.enter('tableCellDivider');
+      effects.consume(code);
+      effects.exit('tableCellDivider');
+      return headDelimiterCellBefore
+    }
+    return headDelimiterNok(code)
   }
-}
-function isCorrectDomain(domain) {
-  const parts = domain.split('.');
-  if (
-    parts.length < 2 ||
-    (parts[parts.length - 1] &&
-      (/_/.test(parts[parts.length - 1]) ||
-        !/[a-zA-Z\d]/.test(parts[parts.length - 1]))) ||
-    (parts[parts.length - 2] &&
-      (/_/.test(parts[parts.length - 2]) ||
-        !/[a-zA-Z\d]/.test(parts[parts.length - 2])))
-  ) {
-    return false
+  function headDelimiterCellBefore(code) {
+    if (markdownSpace(code)) {
+      return factorySpace(effects, headDelimiterValueBefore, 'whitespace')(code)
+    }
+    return headDelimiterValueBefore(code)
   }
-  return true
-}
-function splitUrl(url) {
-  const trailExec = /[!"&'),.:;<>?\]}]+$/.exec(url);
-  if (!trailExec) {
-    return [url, undefined]
+  function headDelimiterValueBefore(code) {
+    if (code === 58) {
+      sizeB += 1;
+      seen = true;
+      effects.enter('tableDelimiterMarker');
+      effects.consume(code);
+      effects.exit('tableDelimiterMarker');
+      return headDelimiterLeftAlignmentAfter
+    }
+    if (code === 45) {
+      sizeB += 1;
+      return headDelimiterLeftAlignmentAfter(code)
+    }
+    if (code === null || markdownLineEnding(code)) {
+      return headDelimiterCellAfter(code)
+    }
+    return headDelimiterNok(code)
   }
-  url = url.slice(0, trailExec.index);
-  let trail = trailExec[0];
-  let closingParenIndex = trail.indexOf(')');
-  const openingParens = ccount(url, '(');
-  let closingParens = ccount(url, ')');
-  while (closingParenIndex !== -1 && openingParens > closingParens) {
-    url += trail.slice(0, closingParenIndex + 1);
-    trail = trail.slice(closingParenIndex + 1);
-    closingParenIndex = trail.indexOf(')');
-    closingParens++;
+  function headDelimiterLeftAlignmentAfter(code) {
+    if (code === 45) {
+      effects.enter('tableDelimiterFiller');
+      return headDelimiterFiller(code)
+    }
+    return headDelimiterNok(code)
   }
-  return [url, trail]
-}
-function previous(match, email) {
-  const code = match.input.charCodeAt(match.index - 1);
-  return (
-    (match.index === 0 ||
-      unicodeWhitespace(code) ||
-      unicodePunctuation(code)) &&
-    (!email || code !== 47)
-  )
-}
-
-footnoteReference.peek = footnoteReferencePeek;
-function gfmFootnoteFromMarkdown() {
-  return {
-    enter: {
-      gfmFootnoteDefinition: enterFootnoteDefinition,
-      gfmFootnoteDefinitionLabelString: enterFootnoteDefinitionLabelString,
-      gfmFootnoteCall: enterFootnoteCall,
-      gfmFootnoteCallString: enterFootnoteCallString
-    },
-    exit: {
-      gfmFootnoteDefinition: exitFootnoteDefinition,
-      gfmFootnoteDefinitionLabelString: exitFootnoteDefinitionLabelString,
-      gfmFootnoteCall: exitFootnoteCall,
-      gfmFootnoteCallString: exitFootnoteCallString
+  function headDelimiterFiller(code) {
+    if (code === 45) {
+      effects.consume(code);
+      return headDelimiterFiller
+    }
+    if (code === 58) {
+      seen = true;
+      effects.exit('tableDelimiterFiller');
+      effects.enter('tableDelimiterMarker');
+      effects.consume(code);
+      effects.exit('tableDelimiterMarker');
+      return headDelimiterRightAlignmentAfter
+    }
+    effects.exit('tableDelimiterFiller');
+    return headDelimiterRightAlignmentAfter(code)
+  }
+  function headDelimiterRightAlignmentAfter(code) {
+    if (markdownSpace(code)) {
+      return factorySpace(effects, headDelimiterCellAfter, 'whitespace')(code)
     }
+    return headDelimiterCellAfter(code)
   }
-}
-function gfmFootnoteToMarkdown() {
-  return {
-    unsafe: [{character: '[', inConstruct: ['phrasing', 'label', 'reference']}],
-    handlers: {footnoteDefinition, footnoteReference}
+  function headDelimiterCellAfter(code) {
+    if (code === 124) {
+      return headDelimiterBefore(code)
+    }
+    if (code === null || markdownLineEnding(code)) {
+      if (!seen || size !== sizeB) {
+        return headDelimiterNok(code)
+      }
+      effects.exit('tableDelimiterRow');
+      effects.exit('tableHead');
+      return ok(code)
+    }
+    return headDelimiterNok(code)
   }
-}
-function enterFootnoteDefinition(token) {
-  this.enter(
-    {type: 'footnoteDefinition', identifier: '', label: '', children: []},
-    token
-  );
-}
-function enterFootnoteDefinitionLabelString() {
-  this.buffer();
-}
-function exitFootnoteDefinitionLabelString(token) {
-  const label = this.resume();
-  const node =  (
-    this.stack[this.stack.length - 1]
-  );
-  node.label = label;
-  node.identifier = normalizeIdentifier(
-    this.sliceSerialize(token)
-  ).toLowerCase();
-}
-function exitFootnoteDefinition(token) {
-  this.exit(token);
-}
-function enterFootnoteCall(token) {
-  this.enter({type: 'footnoteReference', identifier: '', label: ''}, token);
-}
-function enterFootnoteCallString() {
-  this.buffer();
-}
-function exitFootnoteCallString(token) {
-  const label = this.resume();
-  const node =  (
-    this.stack[this.stack.length - 1]
-  );
-  node.label = label;
-  node.identifier = normalizeIdentifier(
-    this.sliceSerialize(token)
-  ).toLowerCase();
-}
-function exitFootnoteCall(token) {
-  this.exit(token);
-}
-function footnoteReference(node, _, context, safeOptions) {
-  const tracker = track(safeOptions);
-  let value = tracker.move('[^');
-  const exit = context.enter('footnoteReference');
-  const subexit = context.enter('reference');
-  value += tracker.move(
-    safe(context, association(node), {
-      ...tracker.current(),
-      before: value,
-      after: ']'
-    })
-  );
-  subexit();
-  exit();
-  value += tracker.move(']');
-  return value
-}
-function footnoteReferencePeek() {
-  return '['
-}
-function footnoteDefinition(node, _, context, safeOptions) {
-  const tracker = track(safeOptions);
-  let value = tracker.move('[^');
-  const exit = context.enter('footnoteDefinition');
-  const subexit = context.enter('label');
-  value += tracker.move(
-    safe(context, association(node), {
-      ...tracker.current(),
-      before: value,
-      after: ']'
-    })
-  );
-  subexit();
-  value += tracker.move(
-    ']:' + (node.children && node.children.length > 0 ? ' ' : '')
-  );
-  tracker.shift(4);
-  value += tracker.move(
-    indentLines(containerFlow(node, context, tracker.current()), map$1)
-  );
-  exit();
-  return value
-}
-function map$1(line, index, blank) {
-  if (index === 0) {
-    return line
+  function headDelimiterNok(code) {
+    return nok(code)
   }
-  return (blank ? '' : '    ') + line
-}
-
-const constructsWithoutStrikethrough = [
-  'autolink',
-  'destinationLiteral',
-  'destinationRaw',
-  'reference',
-  'titleQuote',
-  'titleApostrophe'
-];
-handleDelete.peek = peekDelete;
-const gfmStrikethroughFromMarkdown = {
-  canContainEols: ['delete'],
-  enter: {strikethrough: enterStrikethrough},
-  exit: {strikethrough: exitStrikethrough}
-};
-const gfmStrikethroughToMarkdown = {
-  unsafe: [
-    {
-      character: '~',
-      inConstruct: 'phrasing',
-      notInConstruct: constructsWithoutStrikethrough
+  function bodyRowStart(code) {
+    effects.enter('tableRow');
+    return bodyRowBreak(code)
+  }
+  function bodyRowBreak(code) {
+    if (code === 124) {
+      effects.enter('tableCellDivider');
+      effects.consume(code);
+      effects.exit('tableCellDivider');
+      return bodyRowBreak
     }
-  ],
-  handlers: {delete: handleDelete}
-};
-function enterStrikethrough(token) {
-  this.enter({type: 'delete', children: []}, token);
-}
-function exitStrikethrough(token) {
-  this.exit(token);
-}
-function handleDelete(node, _, context, safeOptions) {
-  const tracker = track(safeOptions);
-  const exit = context.enter('strikethrough');
-  let value = tracker.move('~~');
-  value += containerPhrasing(node, context, {
-    ...tracker.current(),
-    before: value,
-    after: '~'
-  });
-  value += tracker.move('~~');
-  exit();
-  return value
-}
-function peekDelete() {
-  return '~'
-}
-
-function markdownTable(table, options = {}) {
-  const align = (options.align || []).concat();
-  const stringLength = options.stringLength || defaultStringLength;
-  const alignments = [];
-  const cellMatrix = [];
-  const sizeMatrix = [];
-  const longestCellByColumn = [];
-  let mostCellsPerRow = 0;
-  let rowIndex = -1;
-  while (++rowIndex < table.length) {
-    const row = [];
-    const sizes = [];
-    let columnIndex = -1;
-    if (table[rowIndex].length > mostCellsPerRow) {
-      mostCellsPerRow = table[rowIndex].length;
+    if (code === null || markdownLineEnding(code)) {
+      effects.exit('tableRow');
+      return ok(code)
     }
-    while (++columnIndex < table[rowIndex].length) {
-      const cell = serialize(table[rowIndex][columnIndex]);
-      if (options.alignDelimiters !== false) {
-        const size = stringLength(cell);
-        sizes[columnIndex] = size;
-        if (
-          longestCellByColumn[columnIndex] === undefined ||
-          size > longestCellByColumn[columnIndex]
-        ) {
-          longestCellByColumn[columnIndex] = size;
+    if (markdownSpace(code)) {
+      return factorySpace(effects, bodyRowBreak, 'whitespace')(code)
+    }
+    effects.enter('data');
+    return bodyRowData(code)
+  }
+  function bodyRowData(code) {
+    if (code === null || code === 124 || markdownLineEndingOrSpace(code)) {
+      effects.exit('data');
+      return bodyRowBreak(code)
+    }
+    effects.consume(code);
+    return code === 92 ? bodyRowEscape : bodyRowData
+  }
+  function bodyRowEscape(code) {
+    if (code === 92 || code === 124) {
+      effects.consume(code);
+      return bodyRowData
+    }
+    return bodyRowData(code)
+  }
+}
+function resolveTable(events, context) {
+  let index = -1;
+  let inFirstCellAwaitingPipe = true;
+  let rowKind = 0;
+  let lastCell = [0, 0, 0, 0];
+  let cell = [0, 0, 0, 0];
+  let afterHeadAwaitingFirstBodyRow = false;
+  let lastTableEnd = 0;
+  let currentTable;
+  let currentBody;
+  let currentCell;
+  const map = new EditMap();
+  while (++index < events.length) {
+    const event = events[index];
+    const token = event[1];
+    if (event[0] === 'enter') {
+      if (token.type === 'tableHead') {
+        afterHeadAwaitingFirstBodyRow = false;
+        if (lastTableEnd !== 0) {
+          flushTableEnd(map, context, lastTableEnd, currentTable, currentBody);
+          currentBody = undefined;
+          lastTableEnd = 0;
+        }
+        currentTable = {
+          type: 'table',
+          start: Object.assign({}, token.start),
+          end: Object.assign({}, token.end)
+        };
+        map.add(index, 0, [['enter', currentTable, context]]);
+      } else if (
+        token.type === 'tableRow' ||
+        token.type === 'tableDelimiterRow'
+      ) {
+        inFirstCellAwaitingPipe = true;
+        currentCell = undefined;
+        lastCell = [0, 0, 0, 0];
+        cell = [0, index + 1, 0, 0];
+        if (afterHeadAwaitingFirstBodyRow) {
+          afterHeadAwaitingFirstBodyRow = false;
+          currentBody = {
+            type: 'tableBody',
+            start: Object.assign({}, token.start),
+            end: Object.assign({}, token.end)
+          };
+          map.add(index, 0, [['enter', currentBody, context]]);
+        }
+        rowKind = token.type === 'tableDelimiterRow' ? 2 : currentBody ? 3 : 1;
+      }
+      else if (
+        rowKind &&
+        (token.type === 'data' ||
+          token.type === 'tableDelimiterMarker' ||
+          token.type === 'tableDelimiterFiller')
+      ) {
+        inFirstCellAwaitingPipe = false;
+        if (cell[2] === 0) {
+          if (lastCell[1] !== 0) {
+            cell[0] = cell[1];
+            currentCell = flushCell(
+              map,
+              context,
+              lastCell,
+              rowKind,
+              undefined,
+              currentCell
+            );
+            lastCell = [0, 0, 0, 0];
+          }
+          cell[2] = index;
+        }
+      } else if (token.type === 'tableCellDivider') {
+        if (inFirstCellAwaitingPipe) {
+          inFirstCellAwaitingPipe = false;
+        } else {
+          if (lastCell[1] !== 0) {
+            cell[0] = cell[1];
+            currentCell = flushCell(
+              map,
+              context,
+              lastCell,
+              rowKind,
+              undefined,
+              currentCell
+            );
+          }
+          lastCell = cell;
+          cell = [lastCell[1], index, 0, 0];
         }
       }
-      row.push(cell);
-    }
-    cellMatrix[rowIndex] = row;
-    sizeMatrix[rowIndex] = sizes;
-  }
-  let columnIndex = -1;
-  if (typeof align === 'object' && 'length' in align) {
-    while (++columnIndex < mostCellsPerRow) {
-      alignments[columnIndex] = toAlignment(align[columnIndex]);
     }
-  } else {
-    const code = toAlignment(align);
-    while (++columnIndex < mostCellsPerRow) {
-      alignments[columnIndex] = code;
+    else if (token.type === 'tableHead') {
+      afterHeadAwaitingFirstBodyRow = true;
+      lastTableEnd = index;
+    } else if (
+      token.type === 'tableRow' ||
+      token.type === 'tableDelimiterRow'
+    ) {
+      lastTableEnd = index;
+      if (lastCell[1] !== 0) {
+        cell[0] = cell[1];
+        currentCell = flushCell(
+          map,
+          context,
+          lastCell,
+          rowKind,
+          index,
+          currentCell
+        );
+      } else if (cell[1] !== 0) {
+        currentCell = flushCell(map, context, cell, rowKind, index, currentCell);
+      }
+      rowKind = 0;
+    } else if (
+      rowKind &&
+      (token.type === 'data' ||
+        token.type === 'tableDelimiterMarker' ||
+        token.type === 'tableDelimiterFiller')
+    ) {
+      cell[3] = index;
     }
   }
-  columnIndex = -1;
-  const row = [];
-  const sizes = [];
-  while (++columnIndex < mostCellsPerRow) {
-    const code = alignments[columnIndex];
-    let before = '';
-    let after = '';
-    if (code === 99 ) {
-      before = ':';
-      after = ':';
-    } else if (code === 108 ) {
-      before = ':';
-    } else if (code === 114 ) {
-      after = ':';
-    }
-    let size =
-      options.alignDelimiters === false
-        ? 1
-        : Math.max(
-            1,
-            longestCellByColumn[columnIndex] - before.length - after.length
-          );
-    const cell = before + '-'.repeat(size) + after;
-    if (options.alignDelimiters !== false) {
-      size = before.length + size + after.length;
-      if (size > longestCellByColumn[columnIndex]) {
-        longestCellByColumn[columnIndex] = size;
-      }
-      sizes[columnIndex] = size;
+  if (lastTableEnd !== 0) {
+    flushTableEnd(map, context, lastTableEnd, currentTable, currentBody);
+  }
+  map.consume(context.events);
+  index = -1;
+  while (++index < context.events.length) {
+    const event = context.events[index];
+    if (event[0] === 'enter' && event[1].type === 'table') {
+      event[1]._align = gfmTableAlign(context.events, index);
     }
-    row[columnIndex] = cell;
   }
-  cellMatrix.splice(1, 0, row);
-  sizeMatrix.splice(1, 0, sizes);
-  rowIndex = -1;
-  const lines = [];
-  while (++rowIndex < cellMatrix.length) {
-    const row = cellMatrix[rowIndex];
-    const sizes = sizeMatrix[rowIndex];
-    columnIndex = -1;
-    const line = [];
-    while (++columnIndex < mostCellsPerRow) {
-      const cell = row[columnIndex] || '';
-      let before = '';
-      let after = '';
-      if (options.alignDelimiters !== false) {
-        const size =
-          longestCellByColumn[columnIndex] - (sizes[columnIndex] || 0);
-        const code = alignments[columnIndex];
-        if (code === 114 ) {
-          before = ' '.repeat(size);
-        } else if (code === 99 ) {
-          if (size % 2) {
-            before = ' '.repeat(size / 2 + 0.5);
-            after = ' '.repeat(size / 2 - 0.5);
-          } else {
-            before = ' '.repeat(size / 2);
-            after = before;
-          }
-        } else {
-          after = ' '.repeat(size);
-        }
-      }
-      if (options.delimiterStart !== false && !columnIndex) {
-        line.push('|');
-      }
-      if (
-        options.padding !== false &&
-        !(options.alignDelimiters === false && cell === '') &&
-        (options.delimiterStart !== false || columnIndex)
-      ) {
-        line.push(' ');
-      }
-      if (options.alignDelimiters !== false) {
-        line.push(before);
-      }
-      line.push(cell);
-      if (options.alignDelimiters !== false) {
-        line.push(after);
-      }
-      if (options.padding !== false) {
-        line.push(' ');
-      }
-      if (
-        options.delimiterEnd !== false ||
-        columnIndex !== mostCellsPerRow - 1
-      ) {
-        line.push('|');
+  return events
+}
+function flushCell(map, context, range, rowKind, rowEnd, previousCell) {
+  const groupName =
+    rowKind === 1
+      ? 'tableHeader'
+      : rowKind === 2
+      ? 'tableDelimiter'
+      : 'tableData';
+  const valueName = 'tableContent';
+  if (range[0] !== 0) {
+    previousCell.end = Object.assign({}, getPoint(context.events, range[0]));
+    map.add(range[0], 0, [['exit', previousCell, context]]);
+  }
+  const now = getPoint(context.events, range[1]);
+  previousCell = {
+    type: groupName,
+    start: Object.assign({}, now),
+    end: Object.assign({}, now)
+  };
+  map.add(range[1], 0, [['enter', previousCell, context]]);
+  if (range[2] !== 0) {
+    const relatedStart = getPoint(context.events, range[2]);
+    const relatedEnd = getPoint(context.events, range[3]);
+    const valueToken = {
+      type: valueName,
+      start: Object.assign({}, relatedStart),
+      end: Object.assign({}, relatedEnd)
+    };
+    map.add(range[2], 0, [['enter', valueToken, context]]);
+    if (rowKind !== 2) {
+      const start = context.events[range[2]];
+      const end = context.events[range[3]];
+      start[1].end = Object.assign({}, end[1].end);
+      start[1].type = 'chunkText';
+      start[1].contentType = 'text';
+      if (range[3] > range[2] + 1) {
+        const a = range[2] + 1;
+        const b = range[3] - range[2] - 1;
+        map.add(a, b, []);
       }
     }
-    lines.push(
-      options.delimiterEnd === false
-        ? line.join('').replace(/ +$/, '')
-        : line.join('')
-    );
+    map.add(range[3] + 1, 0, [['exit', valueToken, context]]);
   }
-  return lines.join('\n')
-}
-function serialize(value) {
-  return value === null || value === undefined ? '' : String(value)
-}
-function defaultStringLength(value) {
-  return value.length
-}
-function toAlignment(value) {
-  const code = typeof value === 'string' ? value.codePointAt(0) : 0;
-  return code === 67  || code === 99
-    ? 99
-    : code === 76  || code === 108
-    ? 108
-    : code === 82  || code === 114
-    ? 114
-    : 0
-}
-
-const gfmTableFromMarkdown = {
-  enter: {
-    table: enterTable,
-    tableData: enterCell,
-    tableHeader: enterCell,
-    tableRow: enterRow
-  },
-  exit: {
-    codeText: exitCodeText,
-    table: exitTable,
-    tableData: exit,
-    tableHeader: exit,
-    tableRow: exit
+  if (rowEnd !== undefined) {
+    previousCell.end = Object.assign({}, getPoint(context.events, rowEnd));
+    map.add(rowEnd, 0, [['exit', previousCell, context]]);
+    previousCell = undefined;
   }
-};
-function enterTable(token) {
-  const align = token._align;
-  this.enter(
-    {
-      type: 'table',
-      align: align.map((d) => (d === 'none' ? null : d)),
-      children: []
-    },
-    token
-  );
-  this.setData('inTable', true);
-}
-function exitTable(token) {
-  this.exit(token);
-  this.setData('inTable');
-}
-function enterRow(token) {
-  this.enter({type: 'tableRow', children: []}, token);
-}
-function exit(token) {
-  this.exit(token);
-}
-function enterCell(token) {
-  this.enter({type: 'tableCell', children: []}, token);
-}
-function exitCodeText(token) {
-  let value = this.resume();
-  if (this.getData('inTable')) {
-    value = value.replace(/\\([\\|])/g, replace);
+  return previousCell
+}
+function flushTableEnd(map, context, index, table, tableBody) {
+  const exits = [];
+  const related = getPoint(context.events, index);
+  if (tableBody) {
+    tableBody.end = Object.assign({}, related);
+    exits.push(['exit', tableBody, context]);
   }
-  const node =  (this.stack[this.stack.length - 1]);
-  node.value = value;
-  this.exit(token);
+  table.end = Object.assign({}, related);
+  exits.push(['exit', table, context]);
+  map.add(index + 1, 0, exits);
 }
-function replace($0, $1) {
-  return $1 === '|' ? $1 : $0
+function getPoint(events, index) {
+  const event = events[index];
+  const side = event[0] === 'enter' ? 'start' : 'end';
+  return event[1][side]
 }
-function gfmTableToMarkdown(options) {
-  const settings = options || {};
-  const padding = settings.tableCellPadding;
-  const alignDelimiters = settings.tablePipeAlign;
-  const stringLength = settings.stringLength;
-  const around = padding ? ' ' : '|';
+
+const tasklistCheck = {
+  tokenize: tokenizeTasklistCheck
+};
+function gfmTaskListItem() {
   return {
-    unsafe: [
-      {character: '\r', inConstruct: 'tableCell'},
-      {character: '\n', inConstruct: 'tableCell'},
-      {atBreak: true, character: '|', after: '[\t :-]'},
-      {character: '|', inConstruct: 'tableCell'},
-      {atBreak: true, character: ':', after: '-'},
-      {atBreak: true, character: '-', after: '[:|-]'}
-    ],
-    handlers: {
-      table: handleTable,
-      tableRow: handleTableRow,
-      tableCell: handleTableCell,
-      inlineCode: inlineCodeWithTable
+    text: {
+      [91]: tasklistCheck
     }
   }
-  function handleTable(node, _, context, safeOptions) {
-    return serializeData(
-      handleTableAsData(node, context, safeOptions),
-      node.align
-    )
-  }
-  function handleTableRow(node, _, context, safeOptions) {
-    const row = handleTableRowAsData(node, context, safeOptions);
-    const value = serializeData([row]);
-    return value.slice(0, value.indexOf('\n'))
-  }
-  function handleTableCell(node, _, context, safeOptions) {
-    const exit = context.enter('tableCell');
-    const subexit = context.enter('phrasing');
-    const value = containerPhrasing(node, context, {
-      ...safeOptions,
-      before: around,
-      after: around
-    });
-    subexit();
-    exit();
-    return value
-  }
-  function serializeData(matrix, align) {
-    return markdownTable(matrix, {
-      align,
-      alignDelimiters,
-      padding,
-      stringLength
-    })
-  }
-  function handleTableAsData(node, context, safeOptions) {
-    const children = node.children;
-    let index = -1;
-    const result = [];
-    const subexit = context.enter('table');
-    while (++index < children.length) {
-      result[index] = handleTableRowAsData(
-        children[index],
-        context,
-        safeOptions
-      );
+}
+function tokenizeTasklistCheck(effects, ok, nok) {
+  const self = this;
+  return open
+  function open(code) {
+    if (
+      self.previous !== null ||
+      !self._gfmTasklistFirstContentOfListItem
+    ) {
+      return nok(code)
     }
-    subexit();
-    return result
+    effects.enter('taskListCheck');
+    effects.enter('taskListCheckMarker');
+    effects.consume(code);
+    effects.exit('taskListCheckMarker');
+    return inside
   }
-  function handleTableRowAsData(node, context, safeOptions) {
-    const children = node.children;
-    let index = -1;
-    const result = [];
-    const subexit = context.enter('tableRow');
-    while (++index < children.length) {
-      result[index] = handleTableCell(
-        children[index],
-        node,
-        context,
-        safeOptions
-      );
+  function inside(code) {
+    if (markdownLineEndingOrSpace(code)) {
+      effects.enter('taskListCheckValueUnchecked');
+      effects.consume(code);
+      effects.exit('taskListCheckValueUnchecked');
+      return close
     }
-    subexit();
-    return result
-  }
-  function inlineCodeWithTable(node, parent, context) {
-    let value = inlineCode(node, parent, context);
-    if (context.stack.includes('tableCell')) {
-      value = value.replace(/\|/g, '\\$&');
+    if (code === 88 || code === 120) {
+      effects.enter('taskListCheckValueChecked');
+      effects.consume(code);
+      effects.exit('taskListCheckValueChecked');
+      return close
     }
-    return value
+    return nok(code)
   }
-}
-
-const gfmTaskListItemFromMarkdown = {
-  exit: {
-    taskListCheckValueChecked: exitCheck,
-    taskListCheckValueUnchecked: exitCheck,
-    paragraph: exitParagraphWithTaskListItem
+  function close(code) {
+    if (code === 93) {
+      effects.enter('taskListCheckMarker');
+      effects.consume(code);
+      effects.exit('taskListCheckMarker');
+      effects.exit('taskListCheck');
+      return after
+    }
+    return nok(code)
   }
-};
-const gfmTaskListItemToMarkdown = {
-  unsafe: [{atBreak: true, character: '-', after: '[:|-]'}],
-  handlers: {listItem: listItemWithTaskListItem}
-};
-function exitCheck(token) {
-  const node =  (this.stack[this.stack.length - 2]);
-  node.checked = token.type === 'taskListCheckValueChecked';
-}
-function exitParagraphWithTaskListItem(token) {
-  const parent =  (this.stack[this.stack.length - 2]);
-  if (
-    parent &&
-    parent.type === 'listItem' &&
-    typeof parent.checked === 'boolean'
-  ) {
-    const node =  (this.stack[this.stack.length - 1]);
-    const head = node.children[0];
-    if (head && head.type === 'text') {
-      const siblings = parent.children;
-      let index = -1;
-      let firstParaghraph;
-      while (++index < siblings.length) {
-        const sibling = siblings[index];
-        if (sibling.type === 'paragraph') {
-          firstParaghraph = sibling;
-          break
-        }
-      }
-      if (firstParaghraph === node) {
-        head.value = head.value.slice(1);
-        if (head.value.length === 0) {
-          node.children.shift();
-        } else if (
-          node.position &&
-          head.position &&
-          typeof head.position.start.offset === 'number'
-        ) {
-          head.position.start.column++;
-          head.position.start.offset++;
-          node.position.start = Object.assign({}, head.position.start);
-        }
-      }
+  function after(code) {
+    if (markdownLineEnding(code)) {
+      return ok(code)
+    }
+    if (markdownSpace(code)) {
+      return effects.check(
+        {
+          tokenize: spaceThenNonSpace
+        },
+        ok,
+        nok
+      )(code)
     }
+    return nok(code)
   }
-  this.exit(token);
 }
-function listItemWithTaskListItem(node, parent, context, safeOptions) {
-  const head = node.children[0];
-  const checkable =
-    typeof node.checked === 'boolean' && head && head.type === 'paragraph';
-  const checkbox = '[' + (node.checked ? 'x' : ' ') + '] ';
-  const tracker = track(safeOptions);
-  if (checkable) {
-    tracker.move(checkbox);
-  }
-  let value = listItem(node, parent, context, {
-    ...safeOptions,
-    ...tracker.current()
-  });
-  if (checkable) {
-    value = value.replace(/^(?:[*+-]|\d+\.)([\r\n]| {1,3})/, check);
-  }
-  return value
-  function check($0) {
-    return $0 + checkbox
+function spaceThenNonSpace(effects, ok, nok) {
+  return factorySpace(effects, after, 'whitespace')
+  function after(code) {
+    return code === null ? nok(code) : ok(code)
   }
 }
 
-function gfmFromMarkdown() {
-  return [
-    gfmAutolinkLiteralFromMarkdown,
-    gfmFootnoteFromMarkdown(),
-    gfmStrikethroughFromMarkdown,
-    gfmTableFromMarkdown,
-    gfmTaskListItemFromMarkdown
-  ]
-}
-function gfmToMarkdown(options) {
-  return {
-    extensions: [
-      gfmAutolinkLiteralToMarkdown,
-      gfmFootnoteToMarkdown(),
-      gfmStrikethroughToMarkdown,
-      gfmTableToMarkdown(options),
-      gfmTaskListItemToMarkdown
-    ]
-  }
+function gfm(options) {
+  return combineExtensions([
+    gfmAutolinkLiteral(),
+    gfmFootnote(),
+    gfmStrikethrough(options),
+    gfmTable(),
+    gfmTaskListItem()
+  ])
 }
 
-function remarkGfm(options = {}) {
-  const data = this.data();
-  add('micromarkExtensions', gfm(options));
-  add('fromMarkdownExtensions', gfmFromMarkdown());
-  add('toMarkdownExtensions', gfmToMarkdown(options));
-  function add(field, value) {
-    const list =  (
-      data[field] ? data[field] : (data[field] = [])
-    );
-    list.push(value);
-  }
+const emptyOptions$2 = {};
+function remarkGfm(options) {
+  const self =  (this);
+  const settings = options || emptyOptions$2;
+  const data = self.data();
+  const micromarkExtensions =
+    data.micromarkExtensions || (data.micromarkExtensions = []);
+  const fromMarkdownExtensions =
+    data.fromMarkdownExtensions || (data.fromMarkdownExtensions = []);
+  const toMarkdownExtensions =
+    data.toMarkdownExtensions || (data.toMarkdownExtensions = []);
+  micromarkExtensions.push(gfm(settings));
+  fromMarkdownExtensions.push(gfmFromMarkdown());
+  toMarkdownExtensions.push(gfmToMarkdown(settings));
 }
 
 function location(file) {
@@ -11914,14 +11912,78 @@ function location(file) {
   }
 }
 
-function color$1(d) {
+const convert$z =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$z
+      }
+      if (typeof test === 'string') {
+        return typeFactory$z(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$z(test) : propsFactory$z(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$z(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$z(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$z(tests[index]);
+  }
+  return castFactory$z(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$z(check) {
+  return castFactory$z(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$z(check) {
+  return castFactory$z(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$z(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$z() {
+  return true
+}
+
+function color$A(d) {
   return '\u001B[33m' + d + '\u001B[39m'
 }
 
-const CONTINUE = true;
-const SKIP = 'skip';
-const EXIT = false;
-const visitParents =
+const CONTINUE$z = true;
+const SKIP$z = 'skip';
+const EXIT$z = false;
+const visitParents$z =
   (
     function (tree, test, visitor, reverse) {
       if (typeof test === 'function' && typeof visitor !== 'function') {
@@ -11929,7 +11991,7 @@ const visitParents =
         visitor = test;
         test = null;
       }
-      var is = convert(test);
+      var is = convert$z(test);
       var step = reverse ? -1 : 1;
       factory(tree, null, [])();
       function factory(node, index, parents) {
@@ -11945,7 +12007,7 @@ const visitParents =
           Object.defineProperty(visit, 'name', {
             value:
               'node (' +
-              color$1(value.type + (name ? '<' + name + '>' : '')) +
+              color$A(value.type + (name ? '<' + name + '>' : '')) +
               ')'
           });
         }
@@ -11956,17 +12018,17 @@ const visitParents =
           var offset;
           var grandparents;
           if (!test || is(node, index, parents[parents.length - 1] || null)) {
-            result = toResult(visitor(node, parents));
-            if (result[0] === EXIT) {
+            result = toResult$z(visitor(node, parents));
+            if (result[0] === EXIT$z) {
               return result
             }
           }
-          if (node.children && result[0] !== SKIP) {
+          if (node.children && result[0] !== SKIP$z) {
             offset = (reverse ? node.children.length : -1) + step;
             grandparents = parents.concat(node);
             while (offset > -1 && offset < node.children.length) {
               subresult = factory(node.children[offset], offset, grandparents)();
-              if (subresult[0] === EXIT) {
+              if (subresult[0] === EXIT$z) {
                 return subresult
               }
               offset =
@@ -11978,17 +12040,17 @@ const visitParents =
       }
     }
   );
-function toResult(value) {
+function toResult$z(value) {
   if (Array.isArray(value)) {
     return value
   }
   if (typeof value === 'number') {
-    return [CONTINUE, value]
+    return [CONTINUE$z, value]
   }
   return [value]
 }
 
-const visit =
+const visit$z =
   (
     function (tree, test, visitor, reverse) {
       if (typeof test === 'function' && typeof visitor !== 'function') {
@@ -11996,7 +12058,7 @@ const visit =
         visitor = test;
         test = null;
       }
-      visitParents(tree, test, overload, reverse);
+      visitParents$z(tree, test, overload, reverse);
       function overload(node, parents) {
         var parent = parents[parents.length - 1];
         return visitor(
@@ -12034,7 +12096,7 @@ function messageControl(options) {
     const gaps = detectGaps(tree, file);
     const scope = {};
     const globals = [];
-    visit(tree, options.test, visitor);
+    visit$z(tree, options.test, visitor);
     file.messages = file.messages.filter((m) => filter(m));
     function visitor(node, position, parent) {
       const mark = options.marker(node);
@@ -12169,7 +12231,7 @@ function detectGaps(tree, file) {
   const gaps = [];
   let offset = 0;
   let gap;
-  visit(tree, one);
+  visit$z(tree, one);
   if (
     lastNode &&
     lastNode.position &&
@@ -12764,615 +12826,1833 @@ var pluralize = {exports: {}};
 var pluralizeExports = pluralize.exports;
 var plural = getDefaultExportFromCjs(pluralizeExports);
 
+const convert$y =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$y
+      }
+      if (typeof test === 'string') {
+        return typeFactory$y(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$y(test) : propsFactory$y(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$y(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$y(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$y(tests[index]);
+  }
+  return castFactory$y(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$y(check) {
+  return castFactory$y(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$y(check) {
+  return castFactory$y(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$y(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$y() {
+  return true
+}
+
+function color$z(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$y = true;
+const EXIT$y = false;
+const SKIP$y = 'skip';
+const visitParents$y =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$y(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$z(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$y(visitor(node, parents));
+            if (result[0] === EXIT$y) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$y) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$y) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$y(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$y, value]
+  }
+  return [value]
+}
+
+const visit$y =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$y(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
+/**
+ * ## When should I use this?
+ *
+ * You can use this package to check that list items are not indented.
+ *
+ * ## API
+ *
+ * There are no options.
+ *
+ * ## Recommendation
+ *
+ * There is no specific handling of indented list items (or anything else) in
+ * markdown.
+ * While it is possible to use an indent to align ordered lists on their marker:
+ *
+ * ```markdown
+ *   1. One
+ *  10. Ten
+ * 100. Hundred
+ * ```
+ *
+ * …such a style is uncommon and a bit hard to maintain: adding a 10th item
+ * means 9 other items have to change (more arduous, while unlikely, would be
+ * the 100th item).
+ * Hence, it’s recommended to not indent items and to turn this rule on.
+ *
+ * ## Fix
+ *
+ * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
+ * formats all items without indent.
+ *
+ * @module list-item-bullet-indent
+ * @summary
+ *   remark-lint rule to warn when list items are indented.
+ * @author Titus Wormer
+ * @copyright 2015 Titus Wormer
+ * @license MIT
+ * @example
+ *   {"name": "ok.md"}
+ *
+ *   Paragraph.
+ *
+ *   * List item
+ *   * List item
+ *
+ * @example
+ *   {"name": "not-ok.md", "label": "input"}
+ *
+ *   Paragraph.
+ *
+ *   ·* List item
+ *   ·* List item
+ *
+ * @example
+ *   {"name": "not-ok.md", "label": "output"}
+ *
+ *   3:2: Incorrect indentation before bullet: remove 1 space
+ *   4:2: Incorrect indentation before bullet: remove 1 space
+ */
+const remarkLintListItemBulletIndent = lintRule(
+  {
+    origin: 'remark-lint:list-item-bullet-indent',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-list-item-bullet-indent#readme'
+  },
+  (tree, file) => {
+    visit$y(tree, 'list', (list, _, grandparent) => {
+      let index = -1;
+      while (++index < list.children.length) {
+        const item = list.children[index];
+        if (
+          grandparent &&
+          grandparent.type === 'root' &&
+          grandparent.position &&
+          typeof grandparent.position.start.column === 'number' &&
+          item.position &&
+          typeof item.position.start.column === 'number'
+        ) {
+          const indent =
+            item.position.start.column - grandparent.position.start.column;
+          if (indent) {
+            file.message(
+              'Incorrect indentation before bullet: remove ' +
+                indent +
+                ' ' +
+                plural('space', indent),
+              item.position.start
+            );
+          }
+        }
+      }
+    });
+  }
+);
+var remarkLintListItemBulletIndent$1 = remarkLintListItemBulletIndent;
+
+const convert$x =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$x
+      }
+      if (typeof test === 'string') {
+        return typeFactory$x(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$x(test) : propsFactory$x(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$x(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$x(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$x(tests[index]);
+  }
+  return castFactory$x(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$x(check) {
+  return castFactory$x(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$x(check) {
+  return castFactory$x(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$x(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$x() {
+  return true
+}
+
+function color$y(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$x = true;
+const EXIT$x = false;
+const SKIP$x = 'skip';
+const visitParents$x =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$x(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$y(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$x(visitor(node, parents));
+            if (result[0] === EXIT$x) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$x) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$x) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$x(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$x, value]
+  }
+  return [value]
+}
+
+const visit$x =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$x(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
+const pointStart = point$2('start');
+const pointEnd = point$2('end');
+function point$2(type) {
+  return point
+  function point(node) {
+    const point = (node && node.position && node.position[type]) || {};
+    return {
+      line: point.line || null,
+      column: point.column || null,
+      offset: point.offset > -1 ? point.offset : null
+    }
+  }
+}
+
+function generated(node) {
+  return (
+    !node ||
+    !node.position ||
+    !node.position.start ||
+    !node.position.start.line ||
+    !node.position.start.column ||
+    !node.position.end ||
+    !node.position.end.line ||
+    !node.position.end.column
+  )
+}
+
 /**
  * ## When should I use this?
  *
- * You can use this package to check that list items are not indented.
+ * You can use this package to check that the spacing between list item markers
+ * and content is inconsistent.
  *
  * ## API
  *
- * There are no options.
+ * The following options (default: `'tab-size'`) are accepted:
+ *
+ * *   `'space'`
+ *     — prefer a single space
+ * *   `'tab-size'`
+ *     — prefer spaces the size of the next tab stop
+ * *   `'mixed'`
+ *     — prefer `'space'` for tight lists and `'tab-size'` for loose lists
  *
  * ## Recommendation
  *
- * There is no specific handling of indented list items (or anything else) in
- * markdown.
- * While it is possible to use an indent to align ordered lists on their marker:
+ * First, some background.
+ * The number of spaces that occur after list markers (`*`, `-`, and `+` for
+ * unordered lists, or `.` and `)` for unordered lists) and before the content
+ * on the first line, defines how much indentation can be used for further
+ * lines.
+ * At least one space is required and up to 4 spaces are allowed (if there is no
+ * further content after the marker then it’s a blank line which is handled as
+ * if there was one space; if there are 5 or more spaces and then content, it’s
+ * also seen as one space and the rest is seen as indented code).
  *
- * ```markdown
- *   1. One
- *  10. Ten
- * 100. Hundred
- * ```
+ * There are two types of lists in markdown (other than ordered and unordered):
+ * tight and loose lists.
+ * Lists are tight by default but if there is a blank line between two list
+ * items or between two blocks inside an item, that turns the whole list into a
+ * loose list.
+ * When turning markdown into HTML, paragraphs in tight lists are not wrapped
+ * in `<p>` tags.
  *
- * …such a style is uncommon and a bit hard to maintain: adding a 10th item
- * means 9 other items have to change (more arduous, while unlikely, would be
- * the 100th item).
- * Hence, it’s recommended to not indent items and to turn this rule on.
+ * Historically, how indentation of lists works in markdown has been a mess,
+ * especially with how they interact with indented code.
+ * CommonMark made that a *lot* better, but there remain (documented but
+ * complex) edge cases and some behavior intuitive.
+ * Due to this, the default of this list is `'tab-size'`, which worked the best
+ * in most markdown parsers.
+ * Currently, the situation between markdown parsers is better, so choosing
+ * `'space'` (which seems to be the most common style used by authors) should
+ * be okay.
  *
  * ## Fix
  *
  * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
- * formats all items without indent.
+ * uses `'tab-size'` (named `'tab'` there) by default.
+ * [`listItemIndent: '1'` (for `'space'`) or `listItemIndent: 'mixed'`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify#optionslistitemindent)
+ * is supported.
  *
- * @module list-item-bullet-indent
+ * @module list-item-indent
  * @summary
- *   remark-lint rule to warn when list items are indented.
+ *   remark-lint rule to warn when spacing between list item markers and
+ *   content is inconsistent.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   Paragraph.
+ *   *···List
+ *   ····item.
+ *
+ *   Paragraph.
+ *
+ *   11.·List
+ *   ····item.
+ *
+ *   Paragraph.
+ *
+ *   *···List
+ *   ····item.
+ *
+ *   *···List
+ *   ····item.
+ *
+ * @example
+ *   {"name": "ok.md", "config": "mixed"}
+ *
+ *   *·List item.
+ *
+ *   Paragraph.
+ *
+ *   11.·List item
+ *
+ *   Paragraph.
+ *
+ *   *···List
+ *   ····item.
+ *
+ *   *···List
+ *   ····item.
+ *
+ * @example
+ *   {"name": "ok.md", "config": "space"}
+ *
+ *   *·List item.
+ *
+ *   Paragraph.
+ *
+ *   11.·List item
+ *
+ *   Paragraph.
+ *
+ *   *·List
+ *   ··item.
+ *
+ *   *·List
+ *   ··item.
+ *
+ * @example
+ *   {"name": "not-ok.md", "config": "space", "label": "input"}
+ *
+ *   *···List
+ *   ····item.
+ *
+ * @example
+ *   {"name": "not-ok.md", "config": "space", "label": "output"}
+ *
+ *    1:5: Incorrect list-item indent: remove 2 spaces
+ *
+ * @example
+ *   {"name": "not-ok.md", "config": "tab-size", "label": "input"}
+ *
+ *   *·List
+ *   ··item.
+ *
+ * @example
+ *   {"name": "not-ok.md", "config": "tab-size", "label": "output"}
  *
- *   * List item
- *   * List item
+ *    1:3: Incorrect list-item indent: add 2 spaces
  *
  * @example
- *   {"name": "not-ok.md", "label": "input"}
+ *   {"name": "not-ok.md", "config": "mixed", "label": "input"}
  *
- *   Paragraph.
+ *   *···List item.
  *
- *   ·* List item
- *   ·* List item
+ * @example
+ *   {"name": "not-ok.md", "config": "mixed", "label": "output"}
+ *
+ *    1:5: Incorrect list-item indent: remove 2 spaces
  *
  * @example
- *   {"name": "not-ok.md", "label": "output"}
+ *   {"name": "not-ok.md", "config": "💩", "label": "output", "positionless": true}
  *
- *   3:2: Incorrect indentation before bullet: remove 1 space
- *   4:2: Incorrect indentation before bullet: remove 1 space
+ *    1:1: Incorrect list-item indent style `💩`: use either `'tab-size'`, `'space'`, or `'mixed'`
  */
-const remarkLintListItemBulletIndent = lintRule(
+const remarkLintListItemIndent = lintRule(
   {
-    origin: 'remark-lint:list-item-bullet-indent',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-list-item-bullet-indent#readme'
+    origin: 'remark-lint:list-item-indent',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-list-item-indent#readme'
   },
-  (tree, file) => {
-    visit$1(tree, 'list', (list, _, grandparent) => {
+  (tree, file, option = 'tab-size') => {
+    const value = String(file);
+    if (option !== 'tab-size' && option !== 'space' && option !== 'mixed') {
+      file.fail(
+        'Incorrect list-item indent style `' +
+          option +
+          "`: use either `'tab-size'`, `'space'`, or `'mixed'`"
+      );
+    }
+    visit$x(tree, 'list', (node) => {
+      if (generated(node)) return
+      const spread = node.spread;
       let index = -1;
-      while (++index < list.children.length) {
-        const item = list.children[index];
-        if (
-          grandparent &&
-          grandparent.type === 'root' &&
-          grandparent.position &&
-          typeof grandparent.position.start.column === 'number' &&
-          item.position &&
-          typeof item.position.start.column === 'number'
-        ) {
-          const indent =
-            item.position.start.column - grandparent.position.start.column;
-          if (indent) {
-            file.message(
-              'Incorrect indentation before bullet: remove ' +
-                indent +
-                ' ' +
-                plural('space', indent),
-              item.position.start
-            );
-          }
+      while (++index < node.children.length) {
+        const item = node.children[index];
+        const head = item.children[0];
+        const final = pointStart(head);
+        const marker = value
+          .slice(pointStart(item).offset, final.offset)
+          .replace(/\[[x ]?]\s*$/i, '');
+        const bulletSize = marker.replace(/\s+$/, '').length;
+        const style =
+          option === 'tab-size' || (option === 'mixed' && spread)
+            ? Math.ceil(bulletSize / 4) * 4
+            : bulletSize + 1;
+        if (marker.length !== style) {
+          const diff = style - marker.length;
+          const abs = Math.abs(diff);
+          file.message(
+            'Incorrect list-item indent: ' +
+              (diff > 0 ? 'add' : 'remove') +
+              ' ' +
+              abs +
+              ' ' +
+              plural('space', abs),
+            final
+          );
         }
       }
     });
   }
 );
-var remarkLintListItemBulletIndent$1 = remarkLintListItemBulletIndent;
+var remarkLintListItemIndent$1 = remarkLintListItemIndent;
 
-const pointStart = point$2('start');
-const pointEnd = point$2('end');
-function point$2(type) {
-  return point
-  function point(node) {
-    const point = (node && node.position && node.position[type]) || {};
-    return {
-      line: point.line || null,
-      column: point.column || null,
-      offset: point.offset > -1 ? point.offset : null
+const convert$w =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$w
+      }
+      if (typeof test === 'string') {
+        return typeFactory$w(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$w(test) : propsFactory$w(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$w(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$w(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$w(tests[index]);
+  }
+  return castFactory$w(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$w(check) {
+  return castFactory$w(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
     }
+    return true
+  }
+}
+function typeFactory$w(check) {
+  return castFactory$w(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$w(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
   }
 }
+function ok$w() {
+  return true
+}
 
-function generated(node) {
-  return (
-    !node ||
-    !node.position ||
-    !node.position.start ||
-    !node.position.start.line ||
-    !node.position.start.column ||
-    !node.position.end ||
-    !node.position.end.line ||
-    !node.position.end.column
-  )
+function color$x(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
 }
 
-/**
- * ## When should I use this?
- *
- * You can use this package to check that the spacing between list item markers
- * and content is inconsistent.
- *
- * ## API
- *
- * The following options (default: `'tab-size'`) are accepted:
- *
- * *   `'space'`
- *     — prefer a single space
- * *   `'tab-size'`
- *     — prefer spaces the size of the next tab stop
- * *   `'mixed'`
- *     — prefer `'space'` for tight lists and `'tab-size'` for loose lists
- *
- * ## Recommendation
- *
- * First, some background.
- * The number of spaces that occur after list markers (`*`, `-`, and `+` for
- * unordered lists, or `.` and `)` for unordered lists) and before the content
- * on the first line, defines how much indentation can be used for further
- * lines.
- * At least one space is required and up to 4 spaces are allowed (if there is no
- * further content after the marker then it’s a blank line which is handled as
- * if there was one space; if there are 5 or more spaces and then content, it’s
- * also seen as one space and the rest is seen as indented code).
+const CONTINUE$w = true;
+const EXIT$w = false;
+const SKIP$w = 'skip';
+const visitParents$w =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$w(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$x(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$w(visitor(node, parents));
+            if (result[0] === EXIT$w) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$w) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$w) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$w(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$w, value]
+  }
+  return [value]
+}
+
+const visit$w =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$w(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
+/**
+ * ## When should I use this?
  *
- * There are two types of lists in markdown (other than ordered and unordered):
- * tight and loose lists.
- * Lists are tight by default but if there is a blank line between two list
- * items or between two blocks inside an item, that turns the whole list into a
- * loose list.
- * When turning markdown into HTML, paragraphs in tight lists are not wrapped
- * in `<p>` tags.
+ * You can use this package to check that lines in block quotes start with `>`.
  *
- * Historically, how indentation of lists works in markdown has been a mess,
- * especially with how they interact with indented code.
- * CommonMark made that a *lot* better, but there remain (documented but
- * complex) edge cases and some behavior intuitive.
- * Due to this, the default of this list is `'tab-size'`, which worked the best
- * in most markdown parsers.
- * Currently, the situation between markdown parsers is better, so choosing
- * `'space'` (which seems to be the most common style used by authors) should
- * be okay.
+ * ## API
+ *
+ * There are no options.
+ *
+ * ## Recommendation
+ *
+ * Rules around “lazy” lines are not straightforward and visually confusing,
+ * so it’s recommended to start each line with a `>`.
  *
  * ## Fix
  *
  * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
- * uses `'tab-size'` (named `'tab'` there) by default.
- * [`listItemIndent: '1'` (for `'space'`) or `listItemIndent: 'mixed'`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify#optionslistitemindent)
- * is supported.
+ * adds `>` markers to every line in a block quote.
  *
- * @module list-item-indent
+ * @module no-blockquote-without-marker
  * @summary
- *   remark-lint rule to warn when spacing between list item markers and
- *   content is inconsistent.
+ *   remark-lint rule to warn when lines in block quotes start without `>`.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   *···List
- *   ····item.
- *
- *   Paragraph.
- *
- *   11.·List
- *   ····item.
- *
- *   Paragraph.
- *
- *   *···List
- *   ····item.
- *
- *   *···List
- *   ····item.
+ *   > Foo…
+ *   > …bar…
+ *   > …baz.
  *
  * @example
- *   {"name": "ok.md", "config": "mixed"}
- *
- *   *·List item.
- *
- *   Paragraph.
- *
- *   11.·List item
- *
- *   Paragraph.
- *
- *   *···List
- *   ····item.
+ *   {"name": "ok-tabs.md"}
  *
- *   *···List
- *   ····item.
+ *   >»Foo…
+ *   >»…bar…
+ *   >»…baz.
  *
  * @example
- *   {"name": "ok.md", "config": "space"}
- *
- *   *·List item.
+ *   {"name": "not-ok.md", "label": "input"}
  *
- *   Paragraph.
+ *   > Foo…
+ *   …bar…
+ *   > …baz.
  *
- *   11.·List item
+ * @example
+ *   {"name": "not-ok.md", "label": "output"}
  *
- *   Paragraph.
+ *   2:1: Missing marker in block quote
  *
- *   *·List
- *   ··item.
+ * @example
+ *   {"name": "not-ok-tabs.md", "label": "input"}
  *
- *   *·List
- *   ··item.
+ *   >»Foo…
+ *   »…bar…
+ *   …baz.
  *
  * @example
- *   {"name": "not-ok.md", "config": "space", "label": "input"}
+ *   {"name": "not-ok-tabs.md", "label": "output"}
+ *
+ *   2:1: Missing marker in block quote
+ *   3:1: Missing marker in block quote
+ */
+const remarkLintNoBlockquoteWithoutMarker = lintRule(
+  {
+    origin: 'remark-lint:no-blockquote-without-marker',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-blockquote-without-marker#readme'
+  },
+  (tree, file) => {
+    const value = String(file);
+    const loc = location(file);
+    visit$w(tree, 'blockquote', (node) => {
+      let index = -1;
+      while (++index < node.children.length) {
+        const child = node.children[index];
+        if (child.type === 'paragraph' && !generated(child)) {
+          const end = pointEnd(child).line;
+          const column = pointStart(child).column;
+          let line = pointStart(child).line;
+          while (++line <= end) {
+            const offset = loc.toOffset({line, column});
+            if (/>[\t ]+$/.test(value.slice(offset - 5, offset))) {
+              continue
+            }
+            file.message('Missing marker in block quote', {
+              line,
+              column: column - 2
+            });
+          }
+        }
+      }
+    });
+  }
+);
+var remarkLintNoBlockquoteWithoutMarker$1 = remarkLintNoBlockquoteWithoutMarker;
+
+const convert$v =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$v
+      }
+      if (typeof test === 'string') {
+        return typeFactory$v(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$v(test) : propsFactory$v(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$v(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$v(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$v(tests[index]);
+  }
+  return castFactory$v(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$v(check) {
+  return castFactory$v(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$v(check) {
+  return castFactory$v(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$v(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$v() {
+  return true
+}
+
+function color$w(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$v = true;
+const EXIT$v = false;
+const SKIP$v = 'skip';
+const visitParents$v =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$v(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$w(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$v(visitor(node, parents));
+            if (result[0] === EXIT$v) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$v) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$v) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$v(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$v, value]
+  }
+  return [value]
+}
+
+const visit$v =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$v(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
+const emptyOptions$1 = {};
+function toString$1(value, options) {
+  const settings = options || emptyOptions$1;
+  const includeImageAlt =
+    typeof settings.includeImageAlt === 'boolean'
+      ? settings.includeImageAlt
+      : true;
+  const includeHtml =
+    typeof settings.includeHtml === 'boolean' ? settings.includeHtml : true;
+  return one$1(value, includeImageAlt, includeHtml)
+}
+function one$1(value, includeImageAlt, includeHtml) {
+  if (node$1(value)) {
+    if ('value' in value) {
+      return value.type === 'html' && !includeHtml ? '' : value.value
+    }
+    if (includeImageAlt && 'alt' in value && value.alt) {
+      return value.alt
+    }
+    if ('children' in value) {
+      return all$1(value.children, includeImageAlt, includeHtml)
+    }
+  }
+  if (Array.isArray(value)) {
+    return all$1(value, includeImageAlt, includeHtml)
+  }
+  return ''
+}
+function all$1(values, includeImageAlt, includeHtml) {
+  const result = [];
+  let index = -1;
+  while (++index < values.length) {
+    result[index] = one$1(values[index], includeImageAlt, includeHtml);
+  }
+  return result.join('')
+}
+function node$1(value) {
+  return Boolean(value && typeof value === 'object')
+}
+
+/**
+ * ## When should I use this?
  *
- *   *···List
- *   ····item.
+ * You can use this package to check that autolink literal URLs are not used.
  *
- * @example
- *   {"name": "not-ok.md", "config": "space", "label": "output"}
+ * ## API
  *
- *    1:5: Incorrect list-item indent: remove 2 spaces
+ * There are no options.
  *
- * @example
- *   {"name": "not-ok.md", "config": "tab-size", "label": "input"}
+ * ## Recommendation
  *
- *   *·List
- *   ··item.
+ * Autolink literal URLs (just a URL) are a feature enabled by GFM.
+ * They don’t work everywhere.
+ * Due to this, it’s recommended to instead use normal autolinks
+ * (`<https://url>`) or links (`[text](url)`).
  *
- * @example
- *   {"name": "not-ok.md", "config": "tab-size", "label": "output"}
+ * ## Fix
  *
- *    1:3: Incorrect list-item indent: add 2 spaces
+ * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
+ * never creates autolink literals and always uses normal autolinks (`<url>`).
  *
+ * @module no-literal-urls
+ * @summary
+ *   remark-lint rule to warn for autolink literals.
+ * @author Titus Wormer
+ * @copyright 2015 Titus Wormer
+ * @license MIT
  * @example
- *   {"name": "not-ok.md", "config": "mixed", "label": "input"}
+ *   {"name": "ok.md"}
  *
- *   *···List item.
+ *   <http://foo.bar/baz>
  *
  * @example
- *   {"name": "not-ok.md", "config": "mixed", "label": "output"}
+ *   {"name": "not-ok.md", "label": "input", "gfm": true}
  *
- *    1:5: Incorrect list-item indent: remove 2 spaces
+ *   http://foo.bar/baz
  *
  * @example
- *   {"name": "not-ok.md", "config": "💩", "label": "output", "positionless": true}
+ *   {"name": "not-ok.md", "label": "output", "gfm": true}
  *
- *    1:1: Incorrect list-item indent style `💩`: use either `'tab-size'`, `'space'`, or `'mixed'`
+ *   1:1-1:19: Don’t use literal URLs without angle brackets
  */
-const remarkLintListItemIndent = lintRule(
+const remarkLintNoLiteralUrls = lintRule(
   {
-    origin: 'remark-lint:list-item-indent',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-list-item-indent#readme'
+    origin: 'remark-lint:no-literal-urls',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-literal-urls#readme'
   },
-  (tree, file, option = 'tab-size') => {
-    const value = String(file);
-    if (option !== 'tab-size' && option !== 'space' && option !== 'mixed') {
-      file.fail(
-        'Incorrect list-item indent style `' +
-          option +
-          "`: use either `'tab-size'`, `'space'`, or `'mixed'`"
-      );
-    }
-    visit$1(tree, 'list', (node) => {
-      if (generated(node)) return
-      const spread = node.spread;
-      let index = -1;
-      while (++index < node.children.length) {
-        const item = node.children[index];
-        const head = item.children[0];
-        const final = pointStart(head);
-        const marker = value
-          .slice(pointStart(item).offset, final.offset)
-          .replace(/\[[x ]?]\s*$/i, '');
-        const bulletSize = marker.replace(/\s+$/, '').length;
-        const style =
-          option === 'tab-size' || (option === 'mixed' && spread)
-            ? Math.ceil(bulletSize / 4) * 4
-            : bulletSize + 1;
-        if (marker.length !== style) {
-          const diff = style - marker.length;
-          const abs = Math.abs(diff);
-          file.message(
-            'Incorrect list-item indent: ' +
-              (diff > 0 ? 'add' : 'remove') +
-              ' ' +
-              abs +
-              ' ' +
-              plural('space', abs),
-            final
-          );
-        }
+  (tree, file) => {
+    visit$v(tree, 'link', (node) => {
+      const value = toString$1(node);
+      if (
+        !generated(node) &&
+        pointStart(node).column === pointStart(node.children[0]).column &&
+        pointEnd(node).column ===
+          pointEnd(node.children[node.children.length - 1]).column &&
+        (node.url === 'mailto:' + value || node.url === value)
+      ) {
+        file.message('Don’t use literal URLs without angle brackets', node);
       }
     });
   }
 );
-var remarkLintListItemIndent$1 = remarkLintListItemIndent;
+var remarkLintNoLiteralUrls$1 = remarkLintNoLiteralUrls;
+
+const convert$u =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$u
+      }
+      if (typeof test === 'string') {
+        return typeFactory$u(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$u(test) : propsFactory$u(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$u(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$u(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$u(tests[index]);
+  }
+  return castFactory$u(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$u(check) {
+  return castFactory$u(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$u(check) {
+  return castFactory$u(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$u(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$u() {
+  return true
+}
+
+function color$v(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$u = true;
+const EXIT$u = false;
+const SKIP$u = 'skip';
+const visitParents$u =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$u(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$v(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$u(visitor(node, parents));
+            if (result[0] === EXIT$u) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$u) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$u) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$u(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$u, value]
+  }
+  return [value]
+}
+
+const visit$u =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$u(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
  *
- * You can use this package to check that lines in block quotes start with `>`.
+ * You can use this package to check that ordered list markers are consistent.
  *
  * ## API
  *
- * There are no options.
+ * The following options (default: `'consistent'`) are accepted:
+ *
+ * *   `'.'`
+ *     — prefer dots
+ * *   `')'`
+ *     — prefer parens
+ * *   `'consistent'`
+ *     — detect the first used style and warn when further markers differ
  *
  * ## Recommendation
  *
- * Rules around “lazy” lines are not straightforward and visually confusing,
- * so it’s recommended to start each line with a `>`.
+ * Parens for list markers were not supported in markdown before CommonMark.
+ * While they should work in most places now, not all markdown parsers follow
+ * CommonMark.
+ * Due to this, it’s recommended to prefer dots.
  *
  * ## Fix
  *
  * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
- * adds `>` markers to every line in a block quote.
+ * formats ordered lists with dots by default.
+ * Pass
+ * [`bulletOrdered: ')'`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify#optionsbulletordered)
+ * to always use parens.
  *
- * @module no-blockquote-without-marker
+ * @module ordered-list-marker-style
  * @summary
- *   remark-lint rule to warn when lines in block quotes start without `>`.
+ *   remark-lint rule to warn when ordered list markers are inconsistent.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   > Foo…
- *   > …bar…
- *   > …baz.
+ *   1.  Foo
+ *
+ *
+ *   1.  Bar
+ *
+ *   Unordered lists are not affected by this rule.
+ *
+ *   * Foo
  *
  * @example
- *   {"name": "ok-tabs.md"}
+ *   {"name": "ok.md", "config": "."}
  *
- *   >»Foo…
- *   >»…bar…
- *   >»…baz.
+ *   1.  Foo
+ *
+ *   2.  Bar
  *
  * @example
- *   {"name": "not-ok.md", "label": "input"}
+ *   {"name": "ok.md", "config": ")"}
  *
- *   > Foo…
- *   …bar…
- *   > …baz.
+ *   1)  Foo
+ *
+ *   2)  Bar
  *
  * @example
- *   {"name": "not-ok.md", "label": "output"}
+ *   {"name": "not-ok.md", "label": "input"}
  *
- *   2:1: Missing marker in block quote
+ *   1.  Foo
+ *
+ *   2)  Bar
  *
  * @example
- *   {"name": "not-ok-tabs.md", "label": "input"}
+ *   {"name": "not-ok.md", "label": "output"}
  *
- *   >»Foo…
- *   »…bar…
- *   …baz.
+ *   3:1-3:8: Marker style should be `.`
  *
  * @example
- *   {"name": "not-ok-tabs.md", "label": "output"}
+ *   {"name": "not-ok.md", "label": "output", "config": "💩", "positionless": true}
  *
- *   2:1: Missing marker in block quote
- *   3:1: Missing marker in block quote
+ *   1:1: Incorrect ordered list item marker style `💩`: use either `'.'` or `')'`
  */
-const remarkLintNoBlockquoteWithoutMarker = lintRule(
+const remarkLintOrderedListMarkerStyle = lintRule(
   {
-    origin: 'remark-lint:no-blockquote-without-marker',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-blockquote-without-marker#readme'
+    origin: 'remark-lint:ordered-list-marker-style',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-ordered-list-marker-style#readme'
   },
-  (tree, file) => {
+  (tree, file, option = 'consistent') => {
     const value = String(file);
-    const loc = location(file);
-    visit$1(tree, 'blockquote', (node) => {
+    if (option !== 'consistent' && option !== '.' && option !== ')') {
+      file.fail(
+        'Incorrect ordered list item marker style `' +
+          option +
+          "`: use either `'.'` or `')'`"
+      );
+    }
+    visit$u(tree, 'list', (node) => {
       let index = -1;
+      if (!node.ordered) return
       while (++index < node.children.length) {
         const child = node.children[index];
-        if (child.type === 'paragraph' && !generated(child)) {
-          const end = pointEnd(child).line;
-          const column = pointStart(child).column;
-          let line = pointStart(child).line;
-          while (++line <= end) {
-            const offset = loc.toOffset({line, column});
-            if (/>[\t ]+$/.test(value.slice(offset - 5, offset))) {
-              continue
-            }
-            file.message('Missing marker in block quote', {
-              line,
-              column: column - 2
-            });
+        if (!generated(child)) {
+          const marker =  (
+            value
+              .slice(
+                pointStart(child).offset,
+                pointStart(child.children[0]).offset
+              )
+              .replace(/\s|\d/g, '')
+              .replace(/\[[x ]?]\s*$/i, '')
+          );
+          if (option === 'consistent') {
+            option = marker;
+          } else if (marker !== option) {
+            file.message('Marker style should be `' + option + '`', child);
           }
         }
       }
     });
   }
 );
-var remarkLintNoBlockquoteWithoutMarker$1 = remarkLintNoBlockquoteWithoutMarker;
+var remarkLintOrderedListMarkerStyle$1 = remarkLintOrderedListMarkerStyle;
 
-/**
- * ## When should I use this?
- *
- * You can use this package to check that autolink literal URLs are not used.
- *
- * ## API
- *
- * There are no options.
- *
- * ## Recommendation
- *
- * Autolink literal URLs (just a URL) are a feature enabled by GFM.
- * They don’t work everywhere.
- * Due to this, it’s recommended to instead use normal autolinks
- * (`<https://url>`) or links (`[text](url)`).
- *
- * ## Fix
- *
- * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
- * never creates autolink literals and always uses normal autolinks (`<url>`).
- *
- * @module no-literal-urls
- * @summary
- *   remark-lint rule to warn for autolink literals.
- * @author Titus Wormer
- * @copyright 2015 Titus Wormer
- * @license MIT
- * @example
- *   {"name": "ok.md"}
- *
- *   <http://foo.bar/baz>
- *
- * @example
- *   {"name": "not-ok.md", "label": "input", "gfm": true}
- *
- *   http://foo.bar/baz
- *
- * @example
- *   {"name": "not-ok.md", "label": "output", "gfm": true}
- *
- *   1:1-1:19: Don’t use literal URLs without angle brackets
- */
-const remarkLintNoLiteralUrls = lintRule(
-  {
-    origin: 'remark-lint:no-literal-urls',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-literal-urls#readme'
-  },
-  (tree, file) => {
-    visit$1(tree, 'link', (node) => {
-      const value = toString(node);
-      if (
-        !generated(node) &&
-        pointStart(node).column === pointStart(node.children[0]).column &&
-        pointEnd(node).column ===
-          pointEnd(node.children[node.children.length - 1]).column &&
-        (node.url === 'mailto:' + value || node.url === value)
-      ) {
-        file.message('Don’t use literal URLs without angle brackets', node);
+const convert$t =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$t
+      }
+      if (typeof test === 'string') {
+        return typeFactory$t(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$t(test) : propsFactory$t(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$t(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$t(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$t(tests[index]);
+  }
+  return castFactory$t(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$t(check) {
+  return castFactory$t(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$t(check) {
+  return castFactory$t(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$t(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$t() {
+  return true
+}
+
+function color$u(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$t = true;
+const EXIT$t = false;
+const SKIP$t = 'skip';
+const visitParents$t =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$t(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$u(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$t(visitor(node, parents));
+            if (result[0] === EXIT$t) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$t) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$t) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
       }
-    });
+    }
+  );
+function toResult$t(value) {
+  if (Array.isArray(value)) {
+    return value
   }
-);
-var remarkLintNoLiteralUrls$1 = remarkLintNoLiteralUrls;
+  if (typeof value === 'number') {
+    return [CONTINUE$t, value]
+  }
+  return [value]
+}
+
+const visit$t =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$t(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
  *
- * You can use this package to check that ordered list markers are consistent.
+ * You can use this package to check that hard breaks use two spaces and
+ * not more.
  *
  * ## API
  *
- * The following options (default: `'consistent'`) are accepted:
- *
- * *   `'.'`
- *     — prefer dots
- * *   `')'`
- *     — prefer parens
- * *   `'consistent'`
- *     — detect the first used style and warn when further markers differ
+ * There are no options.
  *
  * ## Recommendation
  *
- * Parens for list markers were not supported in markdown before CommonMark.
- * While they should work in most places now, not all markdown parsers follow
- * CommonMark.
- * Due to this, it’s recommended to prefer dots.
- *
- * ## Fix
- *
- * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
- * formats ordered lists with dots by default.
- * Pass
- * [`bulletOrdered: ')'`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify#optionsbulletordered)
- * to always use parens.
+ * Less than two spaces do not create a hard breaks and more than two spaces
+ * have no effect.
+ * Due to this, it’s recommended to turn this rule on.
  *
- * @module ordered-list-marker-style
+ * @module hard-break-spaces
  * @summary
- *   remark-lint rule to warn when ordered list markers are inconsistent.
+ *   remark-lint rule to warn when more spaces are used than needed
+ *   for hard breaks.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   1.  Foo
- *
- *
- *   1.  Bar
- *
- *   Unordered lists are not affected by this rule.
- *
- *   * Foo
- *
- * @example
- *   {"name": "ok.md", "config": "."}
- *
- *   1.  Foo
- *
- *   2.  Bar
- *
- * @example
- *   {"name": "ok.md", "config": ")"}
- *
- *   1)  Foo
- *
- *   2)  Bar
+ *   Lorem ipsum··
+ *   dolor sit amet
  *
  * @example
  *   {"name": "not-ok.md", "label": "input"}
  *
- *   1.  Foo
- *
- *   2)  Bar
+ *   Lorem ipsum···
+ *   dolor sit amet.
  *
  * @example
  *   {"name": "not-ok.md", "label": "output"}
  *
- *   3:1-3:8: Marker style should be `.`
- *
- * @example
- *   {"name": "not-ok.md", "label": "output", "config": "💩", "positionless": true}
- *
- *   1:1: Incorrect ordered list item marker style `💩`: use either `'.'` or `')'`
+ *   1:12-2:1: Use two spaces for hard line breaks
  */
-const remarkLintOrderedListMarkerStyle = lintRule(
+const remarkLintHardBreakSpaces = lintRule(
   {
-    origin: 'remark-lint:ordered-list-marker-style',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-ordered-list-marker-style#readme'
+    origin: 'remark-lint:hard-break-spaces',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-hard-break-spaces#readme'
   },
-  (tree, file, option = 'consistent') => {
+  (tree, file) => {
     const value = String(file);
-    if (option !== 'consistent' && option !== '.' && option !== ')') {
-      file.fail(
-        'Incorrect ordered list item marker style `' +
-          option +
-          "`: use either `'.'` or `')'`"
-      );
+    visit$t(tree, 'break', (node) => {
+      if (!generated(node)) {
+        const slice = value
+          .slice(pointStart(node).offset, pointEnd(node).offset)
+          .split('\n', 1)[0]
+          .replace(/\r$/, '');
+        if (slice.length > 2) {
+          file.message('Use two spaces for hard line breaks', node);
+        }
+      }
+    });
+  }
+);
+var remarkLintHardBreakSpaces$1 = remarkLintHardBreakSpaces;
+
+function stringifyPosition$1(value) {
+  if (!value || typeof value !== 'object') {
+    return ''
+  }
+  if ('position' in value || 'type' in value) {
+    return position$1(value.position)
+  }
+  if ('start' in value || 'end' in value) {
+    return position$1(value)
+  }
+  if ('line' in value || 'column' in value) {
+    return point$1(value)
+  }
+  return ''
+}
+function point$1(point) {
+  return index$1(point && point.line) + ':' + index$1(point && point.column)
+}
+function position$1(pos) {
+  return point$1(pos && pos.start) + '-' + point$1(pos && pos.end)
+}
+function index$1(value) {
+  return value && typeof value === 'number' ? value : 1
+}
+
+const convert$s =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$s
+      }
+      if (typeof test === 'string') {
+        return typeFactory$s(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$s(test) : propsFactory$s(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$s(test)
+      }
+      throw new Error('Expected function, string, or object as test')
     }
-    visit$1(tree, 'list', (node) => {
-      let index = -1;
-      if (!node.ordered) return
-      while (++index < node.children.length) {
-        const child = node.children[index];
-        if (!generated(child)) {
-          const marker =  (
-            value
-              .slice(
-                pointStart(child).offset,
-                pointStart(child.children[0]).offset
-              )
-              .replace(/\s|\d/g, '')
-              .replace(/\[[x ]?]\s*$/i, '')
-          );
-          if (option === 'consistent') {
-            option = marker;
-          } else if (marker !== option) {
-            file.message('Marker style should be `' + option + '`', child);
+  );
+function anyFactory$s(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$s(tests[index]);
+  }
+  return castFactory$s(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$s(check) {
+  return castFactory$s(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$s(check) {
+  return castFactory$s(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$s(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$s() {
+  return true
+}
+
+function color$t(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$s = true;
+const EXIT$s = false;
+const SKIP$s = 'skip';
+const visitParents$s =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$s(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$t(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$s(visitor(node, parents));
+            if (result[0] === EXIT$s) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$s) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$s) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
           }
+          return result
         }
       }
-    });
+    }
+  );
+function toResult$s(value) {
+  if (Array.isArray(value)) {
+    return value
   }
-);
-var remarkLintOrderedListMarkerStyle$1 = remarkLintOrderedListMarkerStyle;
+  if (typeof value === 'number') {
+    return [CONTINUE$s, value]
+  }
+  return [value]
+}
+
+const visit$s =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$s(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
  *
- * You can use this package to check that hard breaks use two spaces and
- * not more.
+ * You can use this package to check that identifiers are defined once.
  *
  * ## API
  *
@@ -13380,60 +14660,251 @@ var remarkLintOrderedListMarkerStyle$1 = remarkLintOrderedListMarkerStyle;
  *
  * ## Recommendation
  *
- * Less than two spaces do not create a hard breaks and more than two spaces
- * have no effect.
- * Due to this, it’s recommended to turn this rule on.
+ * It’s a mistake when the same identifier is defined multiple times.
  *
- * @module hard-break-spaces
+ * @module no-duplicate-definitions
  * @summary
- *   remark-lint rule to warn when more spaces are used than needed
- *   for hard breaks.
+ *   remark-lint rule to warn when identifiers are defined multiple times.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   Lorem ipsum··
- *   dolor sit amet
+ *   [foo]: bar
+ *   [baz]: qux
  *
  * @example
  *   {"name": "not-ok.md", "label": "input"}
  *
- *   Lorem ipsum···
- *   dolor sit amet.
+ *   [foo]: bar
+ *   [foo]: qux
  *
  * @example
  *   {"name": "not-ok.md", "label": "output"}
  *
- *   1:12-2:1: Use two spaces for hard line breaks
+ *   2:1-2:11: Do not use definitions with the same identifier (1:1)
  */
-const remarkLintHardBreakSpaces = lintRule(
+const remarkLintNoDuplicateDefinitions = lintRule(
   {
-    origin: 'remark-lint:hard-break-spaces',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-hard-break-spaces#readme'
+    origin: 'remark-lint:no-duplicate-definitions',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-duplicate-definitions#readme'
   },
   (tree, file) => {
-    const value = String(file);
-    visit$1(tree, 'break', (node) => {
-      if (!generated(node)) {
-        const slice = value
-          .slice(pointStart(node).offset, pointEnd(node).offset)
-          .split('\n', 1)[0]
-          .replace(/\r$/, '');
-        if (slice.length > 2) {
-          file.message('Use two spaces for hard line breaks', node);
+    const map = Object.create(null);
+    visit$s(tree, (node) => {
+      if (
+        (node.type === 'definition' || node.type === 'footnoteDefinition') &&
+        !generated(node)
+      ) {
+        const identifier = node.identifier;
+        const duplicate = map[identifier];
+        if (duplicate) {
+          file.message(
+            'Do not use definitions with the same identifier (' +
+              duplicate +
+              ')',
+            node
+          );
         }
+        map[identifier] = stringifyPosition$1(pointStart(node));
       }
     });
   }
 );
-var remarkLintHardBreakSpaces$1 = remarkLintHardBreakSpaces;
+var remarkLintNoDuplicateDefinitions$1 = remarkLintNoDuplicateDefinitions;
+
+const convert$r =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$r
+      }
+      if (typeof test === 'string') {
+        return typeFactory$r(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$r(test) : propsFactory$r(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$r(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$r(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$r(tests[index]);
+  }
+  return castFactory$r(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$r(check) {
+  return castFactory$r(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$r(check) {
+  return castFactory$r(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$r(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$r() {
+  return true
+}
+
+function color$s(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$r = true;
+const EXIT$r = false;
+const SKIP$r = 'skip';
+const visitParents$r =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$r(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$s(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$r(visitor(node, parents));
+            if (result[0] === EXIT$r) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$r) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$r) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$r(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$r, value]
+  }
+  return [value]
+}
+
+const visit$r =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$r(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
+function headingStyle(node, relative) {
+  const last = node.children[node.children.length - 1];
+  const depth = node.depth;
+  const pos = node.position && node.position.end;
+  const final = last && last.position && last.position.end;
+  if (!pos) {
+    return null
+  }
+  if (!last) {
+    if (pos.column - 1 <= depth * 2) {
+      return consolidate(depth, relative)
+    }
+    return 'atx-closed'
+  }
+  if (final && final.line + 1 === pos.line) {
+    return 'setext'
+  }
+  if (final && final.column + depth < pos.column) {
+    return 'atx-closed'
+  }
+  return consolidate(depth, relative)
+}
+function consolidate(depth, relative) {
+  return depth < 3
+    ? 'atx'
+    : relative === 'atx' || relative === 'setext'
+    ? relative
+    : null
+}
 
 /**
  * ## When should I use this?
  *
- * You can use this package to check that identifiers are defined once.
+ * You can use this package to check that there is on space between `#`
+ * characters and the content in headings.
  *
  * ## API
  *
@@ -13441,257 +14912,727 @@ var remarkLintHardBreakSpaces$1 = remarkLintHardBreakSpaces;
  *
  * ## Recommendation
  *
- * It’s a mistake when the same identifier is defined multiple times.
+ * One space is required and more than one space has no effect.
+ * Due to this, it’s recommended to turn this rule on.
  *
- * @module no-duplicate-definitions
+ * ## Fix
+ *
+ * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
+ * formats headings with exactly one space.
+ *
+ * @module no-heading-content-indent
  * @summary
- *   remark-lint rule to warn when identifiers are defined multiple times.
+ *   remark-lint rule to warn when there are too many spaces between
+ *   hashes and content in headings.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   [foo]: bar
- *   [baz]: qux
+ *   #·Foo
+ *
+ *   ## Bar·##
+ *
+ *     ##·Baz
+ *
+ *   Setext headings are not affected.
+ *
+ *   Baz
+ *   ===
  *
  * @example
  *   {"name": "not-ok.md", "label": "input"}
  *
- *   [foo]: bar
- *   [foo]: qux
+ *   #··Foo
+ *
+ *   ## Bar··##
+ *
+ *     ##··Baz
  *
  * @example
  *   {"name": "not-ok.md", "label": "output"}
  *
- *   2:1-2:11: Do not use definitions with the same identifier (1:1)
+ *   1:4: Remove 1 space before this heading’s content
+ *   3:7: Remove 1 space after this heading’s content
+ *   5:7: Remove 1 space before this heading’s content
+ *
+ * @example
+ *   {"name": "empty-heading.md"}
+ *
+ *   #··
  */
-const remarkLintNoDuplicateDefinitions = lintRule(
+const remarkLintNoHeadingContentIndent = lintRule(
   {
-    origin: 'remark-lint:no-duplicate-definitions',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-duplicate-definitions#readme'
+    origin: 'remark-lint:no-heading-content-indent',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-heading-content-indent#readme'
   },
   (tree, file) => {
-    const map = Object.create(null);
-    visit$1(tree, (node) => {
-      if (
-        (node.type === 'definition' || node.type === 'footnoteDefinition') &&
-        !generated(node)
-      ) {
-        const identifier = node.identifier;
-        const duplicate = map[identifier];
-        if (duplicate) {
+    visit$r(tree, 'heading', (node) => {
+      if (generated(node)) {
+        return
+      }
+      const type = headingStyle(node, 'atx');
+      if (type === 'atx' || type === 'atx-closed') {
+        const head = pointStart(node.children[0]).column;
+        if (!head) {
+          return
+        }
+        const diff = head - pointStart(node).column - 1 - node.depth;
+        if (diff) {
           file.message(
-            'Do not use definitions with the same identifier (' +
-              duplicate +
-              ')',
-            node
+            'Remove ' +
+              Math.abs(diff) +
+              ' ' +
+              plural('space', Math.abs(diff)) +
+              ' before this heading’s content',
+            pointStart(node.children[0])
+          );
+        }
+      }
+      if (type === 'atx-closed') {
+        const final = pointEnd(node.children[node.children.length - 1]);
+        const diff = pointEnd(node).column - final.column - 1 - node.depth;
+        if (diff) {
+          file.message(
+            'Remove ' +
+              diff +
+              ' ' +
+              plural('space', diff) +
+              ' after this heading’s content',
+            final
           );
         }
-        map[identifier] = stringifyPosition$2(pointStart(node));
       }
     });
   }
 );
-var remarkLintNoDuplicateDefinitions$1 = remarkLintNoDuplicateDefinitions;
+var remarkLintNoHeadingContentIndent$1 = remarkLintNoHeadingContentIndent;
 
-function headingStyle(node, relative) {
-  const last = node.children[node.children.length - 1];
-  const depth = node.depth;
-  const pos = node.position && node.position.end;
-  const final = last && last.position && last.position.end;
-  if (!pos) {
-    return null
+const convert$q =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$q
+      }
+      if (typeof test === 'string') {
+        return typeFactory$q(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$q(test) : propsFactory$q(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$q(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$q(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$q(tests[index]);
   }
-  if (!last) {
-    if (pos.column - 1 <= depth * 2) {
-      return consolidate(depth, relative)
+  return castFactory$q(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$q(check) {
+  return castFactory$q(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$q(check) {
+  return castFactory$q(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$q(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$q() {
+  return true
+}
+
+function color$r(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$q = true;
+const EXIT$q = false;
+const SKIP$q = 'skip';
+const visitParents$q =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$q(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$r(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$q(visitor(node, parents));
+            if (result[0] === EXIT$q) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$q) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$q) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$q(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$q, value]
+  }
+  return [value]
+}
+
+const visit$q =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$q(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
+const emptyOptions = {};
+function toString(value, options) {
+  const settings = options || emptyOptions;
+  const includeImageAlt =
+    typeof settings.includeImageAlt === 'boolean'
+      ? settings.includeImageAlt
+      : true;
+  const includeHtml =
+    typeof settings.includeHtml === 'boolean' ? settings.includeHtml : true;
+  return one(value, includeImageAlt, includeHtml)
+}
+function one(value, includeImageAlt, includeHtml) {
+  if (node(value)) {
+    if ('value' in value) {
+      return value.type === 'html' && !includeHtml ? '' : value.value
+    }
+    if (includeImageAlt && 'alt' in value && value.alt) {
+      return value.alt
+    }
+    if ('children' in value) {
+      return all(value.children, includeImageAlt, includeHtml)
     }
-    return 'atx-closed'
   }
-  if (final && final.line + 1 === pos.line) {
-    return 'setext'
+  if (Array.isArray(value)) {
+    return all(value, includeImageAlt, includeHtml)
   }
-  if (final && final.column + depth < pos.column) {
-    return 'atx-closed'
+  return ''
+}
+function all(values, includeImageAlt, includeHtml) {
+  const result = [];
+  let index = -1;
+  while (++index < values.length) {
+    result[index] = one(values[index], includeImageAlt, includeHtml);
   }
-  return consolidate(depth, relative)
+  return result.join('')
 }
-function consolidate(depth, relative) {
-  return depth < 3
-    ? 'atx'
-    : relative === 'atx' || relative === 'setext'
-    ? relative
-    : null
+function node(value) {
+  return Boolean(value && typeof value === 'object')
 }
 
 /**
  * ## When should I use this?
  *
- * You can use this package to check that there is on space between `#`
- * characters and the content in headings.
+ * You can use this package to check that inline constructs (links) are
+ * not padded.
+ * Historically, it was possible to pad emphasis, strong, and strikethrough
+ * too, but this was removed in CommonMark, making this rule much less useful.
  *
  * ## API
  *
  * There are no options.
  *
- * ## Recommendation
- *
- * One space is required and more than one space has no effect.
- * Due to this, it’s recommended to turn this rule on.
- *
- * ## Fix
- *
- * [`remark-stringify`](https://github.com/remarkjs/remark/tree/main/packages/remark-stringify)
- * formats headings with exactly one space.
- *
- * @module no-heading-content-indent
+ * @module no-inline-padding
  * @summary
- *   remark-lint rule to warn when there are too many spaces between
- *   hashes and content in headings.
+ *   remark-lint rule to warn when inline constructs are padded.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   #·Foo
- *
- *   ## Bar·##
- *
- *     ##·Baz
- *
- *   Setext headings are not affected.
- *
- *   Baz
- *   ===
+ *   Alpha [bravo](http://echo.fox/trot)
  *
  * @example
  *   {"name": "not-ok.md", "label": "input"}
  *
- *   #··Foo
- *
- *   ## Bar··##
- *
- *     ##··Baz
+ *   Alpha [ bravo ](http://echo.fox/trot)
  *
  * @example
  *   {"name": "not-ok.md", "label": "output"}
  *
- *   1:4: Remove 1 space before this heading’s content
- *   3:7: Remove 1 space after this heading’s content
- *   5:7: Remove 1 space before this heading’s content
- *
- * @example
- *   {"name": "empty-heading.md"}
- *
- *   #··
+ *   1:7-1:38: Don’t pad `link` with inner spaces
  */
-const remarkLintNoHeadingContentIndent = lintRule(
+const remarkLintNoInlinePadding = lintRule(
   {
-    origin: 'remark-lint:no-heading-content-indent',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-heading-content-indent#readme'
+    origin: 'remark-lint:no-inline-padding',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-inline-padding#readme'
   },
   (tree, file) => {
-    visit$1(tree, 'heading', (node) => {
-      if (generated(node)) {
-        return
-      }
-      const type = headingStyle(node, 'atx');
-      if (type === 'atx' || type === 'atx-closed') {
-        const head = pointStart(node.children[0]).column;
-        if (!head) {
-          return
-        }
-        const diff = head - pointStart(node).column - 1 - node.depth;
-        if (diff) {
-          file.message(
-            'Remove ' +
-              Math.abs(diff) +
-              ' ' +
-              plural('space', Math.abs(diff)) +
-              ' before this heading’s content',
-            pointStart(node.children[0])
-          );
-        }
-      }
-      if (type === 'atx-closed') {
-        const final = pointEnd(node.children[node.children.length - 1]);
-        const diff = pointEnd(node).column - final.column - 1 - node.depth;
-        if (diff) {
-          file.message(
-            'Remove ' +
-              diff +
-              ' ' +
-              plural('space', diff) +
-              ' after this heading’s content',
-            final
-          );
+    visit$q(tree, (node) => {
+      if (
+        (node.type === 'link' || node.type === 'linkReference') &&
+        !generated(node)
+      ) {
+        const value = toString(node);
+        if (value.charAt(0) === ' ' || value.charAt(value.length - 1) === ' ') {
+          file.message('Don’t pad `' + node.type + '` with inner spaces', node);
         }
       }
     });
   }
 );
-var remarkLintNoHeadingContentIndent$1 = remarkLintNoHeadingContentIndent;
+var remarkLintNoInlinePadding$1 = remarkLintNoInlinePadding;
+
+const convert$p =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$p
+      }
+      if (typeof test === 'string') {
+        return typeFactory$p(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$p(test) : propsFactory$p(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$p(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$p(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$p(tests[index]);
+  }
+  return castFactory$p(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$p(check) {
+  return castFactory$p(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$p(check) {
+  return castFactory$p(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$p(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$p() {
+  return true
+}
+
+function color$q(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$p = true;
+const EXIT$p = false;
+const SKIP$p = 'skip';
+const visitParents$p =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$p(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$q(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$p(visitor(node, parents));
+            if (result[0] === EXIT$p) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$p) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$p) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$p(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$p, value]
+  }
+  return [value]
+}
+
+const visit$p =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$p(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
  *
- * You can use this package to check that inline constructs (links) are
- * not padded.
- * Historically, it was possible to pad emphasis, strong, and strikethrough
- * too, but this was removed in CommonMark, making this rule much less useful.
+ * You can use this package to check that collapsed or full reference images
+ * are used.
  *
  * ## API
  *
  * There are no options.
  *
- * @module no-inline-padding
+ * ## Recommendation
+ *
+ * Shortcut references use an implicit style that looks a lot like something
+ * that could occur as plain text instead of syntax.
+ * In some cases, plain text is intended instead of an image.
+ * Due to this, it’s recommended to use collapsed (or full) references
+ * instead.
+ *
+ * @module no-shortcut-reference-image
  * @summary
- *   remark-lint rule to warn when inline constructs are padded.
+ *   remark-lint rule to warn when shortcut reference images are used.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   Alpha [bravo](http://echo.fox/trot)
+ *   ![foo][]
+ *
+ *   [foo]: http://foo.bar/baz.png
  *
  * @example
  *   {"name": "not-ok.md", "label": "input"}
  *
- *   Alpha [ bravo ](http://echo.fox/trot)
+ *   ![foo]
+ *
+ *   [foo]: http://foo.bar/baz.png
  *
  * @example
  *   {"name": "not-ok.md", "label": "output"}
  *
- *   1:7-1:38: Don’t pad `link` with inner spaces
+ *   1:1-1:7: Use the trailing [] on reference images
  */
-const remarkLintNoInlinePadding = lintRule(
+const remarkLintNoShortcutReferenceImage = lintRule(
   {
-    origin: 'remark-lint:no-inline-padding',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-inline-padding#readme'
+    origin: 'remark-lint:no-shortcut-reference-image',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-shortcut-reference-image#readme'
   },
   (tree, file) => {
-    visit$1(tree, (node) => {
-      if (
-        (node.type === 'link' || node.type === 'linkReference') &&
-        !generated(node)
-      ) {
-        const value = toString(node);
-        if (value.charAt(0) === ' ' || value.charAt(value.length - 1) === ' ') {
-          file.message('Don’t pad `' + node.type + '` with inner spaces', node);
-        }
+    visit$p(tree, 'imageReference', (node) => {
+      if (!generated(node) && node.referenceType === 'shortcut') {
+        file.message('Use the trailing [] on reference images', node);
       }
     });
   }
 );
-var remarkLintNoInlinePadding$1 = remarkLintNoInlinePadding;
+var remarkLintNoShortcutReferenceImage$1 = remarkLintNoShortcutReferenceImage;
+
+const convert$o =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$o
+      }
+      if (typeof test === 'string') {
+        return typeFactory$o(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$o(test) : propsFactory$o(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$o(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$o(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$o(tests[index]);
+  }
+  return castFactory$o(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$o(check) {
+  return castFactory$o(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$o(check) {
+  return castFactory$o(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$o(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$o() {
+  return true
+}
+
+function color$p(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$o = true;
+const EXIT$o = false;
+const SKIP$o = 'skip';
+const visitParents$o =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$o(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$p(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$o(visitor(node, parents));
+            if (result[0] === EXIT$o) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$o) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$o) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$o(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$o, value]
+  }
+  return [value]
+}
+
+const visit$o =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$o(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
  *
- * You can use this package to check that collapsed or full reference images
+ * You can use this package to check that collapsed or full reference links
  * are used.
  *
  * ## API
@@ -13702,107 +15643,215 @@ var remarkLintNoInlinePadding$1 = remarkLintNoInlinePadding;
  *
  * Shortcut references use an implicit style that looks a lot like something
  * that could occur as plain text instead of syntax.
- * In some cases, plain text is intended instead of an image.
+ * In some cases, plain text is intended instead of a link.
  * Due to this, it’s recommended to use collapsed (or full) references
  * instead.
  *
- * @module no-shortcut-reference-image
+ * @module no-shortcut-reference-link
  * @summary
- *   remark-lint rule to warn when shortcut reference images are used.
+ *   remark-lint rule to warn when shortcut reference links are used.
  * @author Titus Wormer
  * @copyright 2015 Titus Wormer
  * @license MIT
  * @example
  *   {"name": "ok.md"}
  *
- *   ![foo][]
+ *   [foo][]
  *
- *   [foo]: http://foo.bar/baz.png
+ *   [foo]: http://foo.bar/baz
  *
  * @example
  *   {"name": "not-ok.md", "label": "input"}
  *
- *   ![foo]
+ *   [foo]
  *
- *   [foo]: http://foo.bar/baz.png
+ *   [foo]: http://foo.bar/baz
  *
  * @example
  *   {"name": "not-ok.md", "label": "output"}
  *
- *   1:1-1:7: Use the trailing [] on reference images
+ *   1:1-1:6: Use the trailing `[]` on reference links
  */
-const remarkLintNoShortcutReferenceImage = lintRule(
+const remarkLintNoShortcutReferenceLink = lintRule(
   {
-    origin: 'remark-lint:no-shortcut-reference-image',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-shortcut-reference-image#readme'
+    origin: 'remark-lint:no-shortcut-reference-link',
+    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-shortcut-reference-link#readme'
   },
   (tree, file) => {
-    visit$1(tree, 'imageReference', (node) => {
+    visit$o(tree, 'linkReference', (node) => {
       if (!generated(node) && node.referenceType === 'shortcut') {
-        file.message('Use the trailing [] on reference images', node);
+        file.message('Use the trailing `[]` on reference links', node);
+      }
+    });
+  }
+);
+var remarkLintNoShortcutReferenceLink$1 = remarkLintNoShortcutReferenceLink;
+
+function normalizeIdentifier(value) {
+  return (
+    value
+      .replace(/[\t\n\r ]+/g, ' ')
+      .replace(/^ | $/g, '')
+      .toLowerCase()
+      .toUpperCase()
+  )
+}
+
+const convert$n =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$n
+      }
+      if (typeof test === 'string') {
+        return typeFactory$n(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$n(test) : propsFactory$n(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$n(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$n(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$n(tests[index]);
+  }
+  return castFactory$n(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$n(check) {
+  return castFactory$n(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$n(check) {
+  return castFactory$n(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$n(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$n() {
+  return true
+}
+
+function color$o(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$n = true;
+const EXIT$n = false;
+const SKIP$n = 'skip';
+const visitParents$n =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
       }
-    });
+      const is = convert$n(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$o(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$n(visitor(node, parents));
+            if (result[0] === EXIT$n) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$n) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$n) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$n(value) {
+  if (Array.isArray(value)) {
+    return value
   }
-);
-var remarkLintNoShortcutReferenceImage$1 = remarkLintNoShortcutReferenceImage;
+  if (typeof value === 'number') {
+    return [CONTINUE$n, value]
+  }
+  return [value]
+}
 
-/**
- * ## When should I use this?
- *
- * You can use this package to check that collapsed or full reference links
- * are used.
- *
- * ## API
- *
- * There are no options.
- *
- * ## Recommendation
- *
- * Shortcut references use an implicit style that looks a lot like something
- * that could occur as plain text instead of syntax.
- * In some cases, plain text is intended instead of a link.
- * Due to this, it’s recommended to use collapsed (or full) references
- * instead.
- *
- * @module no-shortcut-reference-link
- * @summary
- *   remark-lint rule to warn when shortcut reference links are used.
- * @author Titus Wormer
- * @copyright 2015 Titus Wormer
- * @license MIT
- * @example
- *   {"name": "ok.md"}
- *
- *   [foo][]
- *
- *   [foo]: http://foo.bar/baz
- *
- * @example
- *   {"name": "not-ok.md", "label": "input"}
- *
- *   [foo]
- *
- *   [foo]: http://foo.bar/baz
- *
- * @example
- *   {"name": "not-ok.md", "label": "output"}
- *
- *   1:1-1:6: Use the trailing `[]` on reference links
- */
-const remarkLintNoShortcutReferenceLink = lintRule(
-  {
-    origin: 'remark-lint:no-shortcut-reference-link',
-    url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-shortcut-reference-link#readme'
-  },
-  (tree, file) => {
-    visit$1(tree, 'linkReference', (node) => {
-      if (!generated(node) && node.referenceType === 'shortcut') {
-        file.message('Use the trailing `[]` on reference links', node);
+const visit$n =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
       }
-    });
-  }
-);
-var remarkLintNoShortcutReferenceLink$1 = remarkLintNoShortcutReferenceLink;
+      visitParents$n(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
@@ -13949,7 +15998,7 @@ const remarkLintNoUndefinedReferences = lintRule(
         regexes.push(new RegExp(value.source, 'i'));
       }
     }
-    visit$1(tree, (node) => {
+    visit$n(tree, (node) => {
       if (
         (node.type === 'definition' || node.type === 'footnoteDefinition') &&
         !generated(node)
@@ -13957,7 +16006,7 @@ const remarkLintNoUndefinedReferences = lintRule(
         map[normalizeIdentifier(node.identifier)] = true;
       }
     });
-    visit$1(tree, (node) => {
+    visit$n(tree, (node) => {
       if (
         (node.type === 'imageReference' ||
           node.type === 'linkReference' ||
@@ -13974,17 +16023,17 @@ const remarkLintNoUndefinedReferences = lintRule(
     });
     function findInPhrasing(node) {
       let ranges = [];
-      visit$1(node, (child) => {
+      visit$n(node, (child) => {
         if (child === node) return
         if (child.type === 'link' || child.type === 'linkReference') {
           ranges = [];
-          return SKIP$1
+          return SKIP$n
         }
         if (child.type !== 'text') return
         const start = pointStart(child).offset;
         const end = pointEnd(child).offset;
         if (typeof start !== 'number' || typeof end !== 'number') {
-          return EXIT$1
+          return EXIT$n
         }
         const source = contents.slice(start, end);
         const lines = [[start, '']];
@@ -14051,7 +16100,7 @@ const remarkLintNoUndefinedReferences = lintRule(
       while (++index < ranges.length) {
         handleRange(ranges[index]);
       }
-      return SKIP$1
+      return SKIP$n
       function handleRange(range) {
         if (range.length === 1) return
         if (range.length === 3) range.length = 2;
@@ -14080,9 +16129,165 @@ const remarkLintNoUndefinedReferences = lintRule(
         regexes.some((regex) => regex.test(normalized))
       )
     }
-  }
-);
-var remarkLintNoUndefinedReferences$1 = remarkLintNoUndefinedReferences;
+  }
+);
+var remarkLintNoUndefinedReferences$1 = remarkLintNoUndefinedReferences;
+
+const convert$m =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$m
+      }
+      if (typeof test === 'string') {
+        return typeFactory$m(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$m(test) : propsFactory$m(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$m(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$m(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$m(tests[index]);
+  }
+  return castFactory$m(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$m(check) {
+  return castFactory$m(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$m(check) {
+  return castFactory$m(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$m(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$m() {
+  return true
+}
+
+function color$n(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$m = true;
+const EXIT$m = false;
+const SKIP$m = 'skip';
+const visitParents$m =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$m(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$n(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$m(visitor(node, parents));
+            if (result[0] === EXIT$m) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$m) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$m) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$m(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$m, value]
+  }
+  return [value]
+}
+
+const visit$m =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$m(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
@@ -14128,7 +16333,7 @@ const remarkLintNoUnusedDefinitions = lintRule(
   },
   (tree, file) => {
     const map = Object.create(null);
-    visit$1(tree, (node) => {
+    visit$m(tree, (node) => {
       if (
         (node.type === 'definition' || node.type === 'footnoteDefinition') &&
         !generated(node)
@@ -14136,7 +16341,7 @@ const remarkLintNoUnusedDefinitions = lintRule(
         map[node.identifier.toUpperCase()] = {node, used: false};
       }
     });
-    visit$1(tree, (node) => {
+    visit$m(tree, (node) => {
       if (
         node.type === 'imageReference' ||
         node.type === 'linkReference' ||
@@ -14182,6 +16387,162 @@ const remarkPresetLintRecommended = {
 };
 var remarkPresetLintRecommended$1 = remarkPresetLintRecommended;
 
+const convert$l =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$l
+      }
+      if (typeof test === 'string') {
+        return typeFactory$l(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$l(test) : propsFactory$l(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$l(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$l(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$l(tests[index]);
+  }
+  return castFactory$l(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$l(check) {
+  return castFactory$l(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$l(check) {
+  return castFactory$l(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$l(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$l() {
+  return true
+}
+
+function color$m(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$l = true;
+const EXIT$l = false;
+const SKIP$l = 'skip';
+const visitParents$l =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$l(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$m(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$l(visitor(node, parents));
+            if (result[0] === EXIT$l) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$l) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$l) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$l(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$l, value]
+  }
+  return [value]
+}
+
+const visit$l =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$l(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -14267,7 +16628,7 @@ const remarkLintBlockquoteIndentation = lintRule(
     url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-blockquote-indentation#readme'
   },
   (tree, file, option = 'consistent') => {
-    visit$1(tree, 'blockquote', (node) => {
+    visit$l(tree, 'blockquote', (node) => {
       if (generated(node) || node.children.length === 0) {
         return
       }
@@ -14296,6 +16657,162 @@ function check(node) {
   return pointStart(node.children[0]).column - pointStart(node).column
 }
 
+const convert$k =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$k
+      }
+      if (typeof test === 'string') {
+        return typeFactory$k(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$k(test) : propsFactory$k(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$k(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$k(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$k(tests[index]);
+  }
+  return castFactory$k(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$k(check) {
+  return castFactory$k(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$k(check) {
+  return castFactory$k(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$k(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$k() {
+  return true
+}
+
+function color$l(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$k = true;
+const EXIT$k = false;
+const SKIP$k = 'skip';
+const visitParents$k =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$k(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$l(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$k(visitor(node, parents));
+            if (result[0] === EXIT$k) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$k) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$k) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$k(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$k, value]
+  }
+  return [value]
+}
+
+const visit$k =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$k(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -14411,7 +16928,7 @@ const remarkLintCheckboxCharacterStyle = lintRule(
           "`: use either `'x'`, or `'X'`"
       );
     }
-    visit$1(tree, 'listItem', (node) => {
+    visit$k(tree, 'listItem', (node) => {
       const head = node.children[0];
       const point = pointStart(head);
       if (
@@ -14448,6 +16965,162 @@ const remarkLintCheckboxCharacterStyle = lintRule(
 );
 var remarkLintCheckboxCharacterStyle$1 = remarkLintCheckboxCharacterStyle;
 
+const convert$j =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$j
+      }
+      if (typeof test === 'string') {
+        return typeFactory$j(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$j(test) : propsFactory$j(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$j(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$j(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$j(tests[index]);
+  }
+  return castFactory$j(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$j(check) {
+  return castFactory$j(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$j(check) {
+  return castFactory$j(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$j(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$j() {
+  return true
+}
+
+function color$k(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$j = true;
+const EXIT$j = false;
+const SKIP$j = 'skip';
+const visitParents$j =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$j(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$k(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$j(visitor(node, parents));
+            if (result[0] === EXIT$j) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$j) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$j) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$j(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$j, value]
+  }
+  return [value]
+}
+
+const visit$j =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$j(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -14518,7 +17191,7 @@ const remarkLintCheckboxContentIndent = lintRule(
   (tree, file) => {
     const value = String(file);
     const loc = location(file);
-    visit$1(tree, 'listItem', (node) => {
+    visit$j(tree, 'listItem', (node) => {
       const head = node.children[0];
       const point = pointStart(head);
       if (
@@ -14541,10 +17214,166 @@ const remarkLintCheckboxContentIndent = lintRule(
           end: loc.toPoint(final)
         });
       }
-    });
-  }
-);
-var remarkLintCheckboxContentIndent$1 = remarkLintCheckboxContentIndent;
+    });
+  }
+);
+var remarkLintCheckboxContentIndent$1 = remarkLintCheckboxContentIndent;
+
+const convert$i =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$i
+      }
+      if (typeof test === 'string') {
+        return typeFactory$i(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$i(test) : propsFactory$i(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$i(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$i(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$i(tests[index]);
+  }
+  return castFactory$i(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$i(check) {
+  return castFactory$i(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$i(check) {
+  return castFactory$i(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$i(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$i() {
+  return true
+}
+
+function color$j(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$i = true;
+const EXIT$i = false;
+const SKIP$i = 'skip';
+const visitParents$i =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$i(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$j(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$i(visitor(node, parents));
+            if (result[0] === EXIT$i) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$i) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$i) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$i(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$i, value]
+  }
+  return [value]
+}
+
+const visit$i =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$i(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
@@ -14691,7 +17520,7 @@ const remarkLintCodeBlockStyle = lintRule(
           "`: use either `'consistent'`, `'fenced'`, or `'indented'`"
       );
     }
-    visit$1(tree, 'code', (node) => {
+    visit$i(tree, 'code', (node) => {
       if (generated(node)) {
         return
       }
@@ -14711,6 +17540,162 @@ const remarkLintCodeBlockStyle = lintRule(
 );
 var remarkLintCodeBlockStyle$1 = remarkLintCodeBlockStyle;
 
+const convert$h =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$h
+      }
+      if (typeof test === 'string') {
+        return typeFactory$h(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$h(test) : propsFactory$h(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$h(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$h(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$h(tests[index]);
+  }
+  return castFactory$h(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$h(check) {
+  return castFactory$h(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$h(check) {
+  return castFactory$h(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$h(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$h() {
+  return true
+}
+
+function color$i(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$h = true;
+const EXIT$h = false;
+const SKIP$h = 'skip';
+const visitParents$h =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$h(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$i(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$h(visitor(node, parents));
+            if (result[0] === EXIT$h) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$h) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$h) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$h(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$h, value]
+  }
+  return [value]
+}
+
+const visit$h =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$h(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -14759,7 +17744,7 @@ const remarkLintDefinitionSpacing = lintRule(
   },
   (tree, file) => {
     const value = String(file);
-    visit$1(tree, (node) => {
+    visit$h(tree, (node) => {
       if (node.type === 'definition' || node.type === 'footnoteDefinition') {
         const start = pointStart(node).offset;
         const end = pointEnd(node).offset;
@@ -14773,10 +17758,166 @@ const remarkLintDefinitionSpacing = lintRule(
           }
         }
       }
-    });
-  }
-);
-var remarkLintDefinitionSpacing$1 = remarkLintDefinitionSpacing;
+    });
+  }
+);
+var remarkLintDefinitionSpacing$1 = remarkLintDefinitionSpacing;
+
+const convert$g =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$g
+      }
+      if (typeof test === 'string') {
+        return typeFactory$g(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$g(test) : propsFactory$g(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$g(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$g(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$g(tests[index]);
+  }
+  return castFactory$g(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$g(check) {
+  return castFactory$g(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$g(check) {
+  return castFactory$g(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$g(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$g() {
+  return true
+}
+
+function color$h(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$g = true;
+const EXIT$g = false;
+const SKIP$g = 'skip';
+const visitParents$g =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$g(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$h(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$g(visitor(node, parents));
+            if (result[0] === EXIT$g) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$g) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$g) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$g(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$g, value]
+  }
+  return [value]
+}
+
+const visit$g =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$g(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
@@ -14894,7 +18035,7 @@ const remarkLintFencedCodeFlag = lintRule(
         }
       }
     }
-    visit$1(tree, 'code', (node) => {
+    visit$g(tree, 'code', (node) => {
       if (!generated(node)) {
         if (node.lang) {
           if (allowed.length > 0 && !allowed.includes(node.lang)) {
@@ -14915,6 +18056,162 @@ const remarkLintFencedCodeFlag = lintRule(
 );
 var remarkLintFencedCodeFlag$1 = remarkLintFencedCodeFlag;
 
+const convert$f =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$f
+      }
+      if (typeof test === 'string') {
+        return typeFactory$f(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$f(test) : propsFactory$f(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$f(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$f(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$f(tests[index]);
+  }
+  return castFactory$f(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$f(check) {
+  return castFactory$f(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$f(check) {
+  return castFactory$f(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$f(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$f() {
+  return true
+}
+
+function color$g(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$f = true;
+const EXIT$f = false;
+const SKIP$f = 'skip';
+const visitParents$f =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$f(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$g(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$f(visitor(node, parents));
+            if (result[0] === EXIT$f) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$f) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$f) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$f(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$f, value]
+  }
+  return [value]
+}
+
+const visit$f =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$f(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -15030,7 +18327,7 @@ const remarkLintFencedCodeMarker = lintRule(
           "`: use either `'consistent'`, `` '`' ``, or `'~'`"
       );
     }
-    visit$1(tree, 'code', (node) => {
+    visit$f(tree, 'code', (node) => {
       const start = pointStart(node).offset;
       if (typeof start === 'number') {
         const marker = contents
@@ -15107,9 +18404,165 @@ const remarkLintFileExtension = lintRule(
     if (ext && ext.slice(1) !== option) {
       file.message('Incorrect extension: use `' + option + '`');
     }
-  }
-);
-var remarkLintFileExtension$1 = remarkLintFileExtension;
+  }
+);
+var remarkLintFileExtension$1 = remarkLintFileExtension;
+
+const convert$e =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$e
+      }
+      if (typeof test === 'string') {
+        return typeFactory$e(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$e(test) : propsFactory$e(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$e(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$e(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$e(tests[index]);
+  }
+  return castFactory$e(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$e(check) {
+  return castFactory$e(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$e(check) {
+  return castFactory$e(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$e(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$e() {
+  return true
+}
+
+function color$f(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$e = true;
+const EXIT$e = false;
+const SKIP$e = 'skip';
+const visitParents$e =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$e(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$f(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$e(visitor(node, parents));
+            if (result[0] === EXIT$e) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$e) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$e) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$e(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$e, value]
+  }
+  return [value]
+}
+
+const visit$e =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$e(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
@@ -15173,7 +18626,7 @@ const remarkLintFinalDefinition = lintRule(
   },
   (tree, file) => {
     let last = 0;
-    visit$1(
+    visit$e(
       tree,
       (node) => {
         if (
@@ -15203,6 +18656,162 @@ const remarkLintFinalDefinition = lintRule(
 );
 var remarkLintFinalDefinition$1 = remarkLintFinalDefinition;
 
+const convert$d =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$d
+      }
+      if (typeof test === 'string') {
+        return typeFactory$d(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$d(test) : propsFactory$d(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$d(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$d(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$d(tests[index]);
+  }
+  return castFactory$d(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$d(check) {
+  return castFactory$d(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$d(check) {
+  return castFactory$d(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$d(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$d() {
+  return true
+}
+
+function color$e(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$d = true;
+const EXIT$d = false;
+const SKIP$d = 'skip';
+const visitParents$d =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$d(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$e(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$d(visitor(node, parents));
+            if (result[0] === EXIT$d) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$d) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$d) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$d(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$d, value]
+  }
+  return [value]
+}
+
+const visit$d =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$d(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -15317,7 +18926,7 @@ const remarkLintFirstHeadingLevel = lintRule(
     url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-first-heading-level#readme'
   },
   (tree, file, option = 1) => {
-    visit$1(tree, (node) => {
+    visit$d(tree, (node) => {
       if (!generated(node)) {
         let rank;
         if (node.type === 'heading') {
@@ -15329,7 +18938,7 @@ const remarkLintFirstHeadingLevel = lintRule(
           if (rank !== option) {
             file.message('First heading level should be `' + option + '`', node);
           }
-          return EXIT$1
+          return EXIT$d
         }
       }
     });
@@ -15341,6 +18950,162 @@ function infer(node) {
   return results ? Number(results[1]) : undefined
 }
 
+const convert$c =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$c
+      }
+      if (typeof test === 'string') {
+        return typeFactory$c(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$c(test) : propsFactory$c(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$c(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$c(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$c(tests[index]);
+  }
+  return castFactory$c(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$c(check) {
+  return castFactory$c(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$c(check) {
+  return castFactory$c(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$c(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$c() {
+  return true
+}
+
+function color$d(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$c = true;
+const EXIT$c = false;
+const SKIP$c = 'skip';
+const visitParents$c =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$c(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$d(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$c(visitor(node, parents));
+            if (result[0] === EXIT$c) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$c) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$c) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$c(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$c, value]
+  }
+  return [value]
+}
+
+const visit$c =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$c(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -15472,7 +19237,7 @@ const remarkLintHeadingStyle = lintRule(
           "`: use either `'consistent'`, `'atx'`, `'atx-closed'`, or `'setext'`"
       );
     }
-    visit$1(tree, 'heading', (node) => {
+    visit$c(tree, 'heading', (node) => {
       if (!generated(node)) {
         if (option === 'consistent') {
           option = headingStyle(node) || 'consistent';
@@ -15485,6 +19250,162 @@ const remarkLintHeadingStyle = lintRule(
 );
 var remarkLintHeadingStyle$1 = remarkLintHeadingStyle;
 
+const convert$b =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$b
+      }
+      if (typeof test === 'string') {
+        return typeFactory$b(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$b(test) : propsFactory$b(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$b(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$b(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$b(tests[index]);
+  }
+  return castFactory$b(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$b(check) {
+  return castFactory$b(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$b(check) {
+  return castFactory$b(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$b(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$b() {
+  return true
+}
+
+function color$c(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$b = true;
+const EXIT$b = false;
+const SKIP$b = 'skip';
+const visitParents$b =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$b(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$c(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$b(visitor(node, parents));
+            if (result[0] === EXIT$b) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$b) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$b) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$b(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$b, value]
+  }
+  return [value]
+}
+
+const visit$b =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$b(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -15601,7 +19522,7 @@ const remarkLintMaximumLineLength = lintRule(
   (tree, file, option = 80) => {
     const value = String(file);
     const lines = value.split(/\r?\n/);
-    visit$1(tree, (node) => {
+    visit$b(tree, (node) => {
       if (
         (node.type === 'heading' ||
           node.type === 'table' ||
@@ -15621,7 +19542,7 @@ const remarkLintMaximumLineLength = lintRule(
         allowList(pointStart(node).line - 1, pointEnd(node).line);
       }
     });
-    visit$1(tree, (node, pos, parent) => {
+    visit$b(tree, (node, pos, parent) => {
       if (
         (node.type === 'link' ||
           node.type === 'image' ||
@@ -15643,27 +19564,183 @@ const remarkLintMaximumLineLength = lintRule(
         ) {
           return
         }
-        allowList(initial.line - 1, final.line);
-      }
-    });
-    let index = -1;
-    while (++index < lines.length) {
-      const lineLength = lines[index].length;
-      if (lineLength > option) {
-        file.message('Line must be at most ' + option + ' characters', {
-          line: index + 1,
-          column: lineLength + 1
-        });
+        allowList(initial.line - 1, final.line);
+      }
+    });
+    let index = -1;
+    while (++index < lines.length) {
+      const lineLength = lines[index].length;
+      if (lineLength > option) {
+        file.message('Line must be at most ' + option + ' characters', {
+          line: index + 1,
+          column: lineLength + 1
+        });
+      }
+    }
+    function allowList(initial, final) {
+      while (initial < final) {
+        lines[initial++] = '';
+      }
+    }
+  }
+);
+var remarkLintMaximumLineLength$1 = remarkLintMaximumLineLength;
+
+const convert$a =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$a
+      }
+      if (typeof test === 'string') {
+        return typeFactory$a(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$a(test) : propsFactory$a(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$a(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$a(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$a(tests[index]);
+  }
+  return castFactory$a(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$a(check) {
+  return castFactory$a(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$a(check) {
+  return castFactory$a(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$a(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$a() {
+  return true
+}
+
+function color$b(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$a = true;
+const EXIT$a = false;
+const SKIP$a = 'skip';
+const visitParents$a =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$a(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$b(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$a(visitor(node, parents));
+            if (result[0] === EXIT$a) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$a) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$a) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
       }
     }
-    function allowList(initial, final) {
-      while (initial < final) {
-        lines[initial++] = '';
+  );
+function toResult$a(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$a, value]
+  }
+  return [value]
+}
+
+const visit$a =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$a(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
       }
     }
-  }
-);
-var remarkLintMaximumLineLength$1 = remarkLintMaximumLineLength;
+  );
 
 /**
  * ## When should I use this?
@@ -15724,7 +19801,7 @@ const remarkLintNoConsecutiveBlankLines = lintRule(
     url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-consecutive-blank-lines#readme'
   },
   (tree, file) => {
-    visit$1(tree, (node) => {
+    visit$a(tree, (node) => {
       if (!generated(node) && 'children' in node) {
         const head = node.children[0];
         if (head && !generated(head)) {
@@ -15902,6 +19979,162 @@ const remarkLintNofileNameOuterDashes = lintRule(
 );
 var remarkLintNofileNameOuterDashes$1 = remarkLintNofileNameOuterDashes;
 
+const convert$9 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$9
+      }
+      if (typeof test === 'string') {
+        return typeFactory$9(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$9(test) : propsFactory$9(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$9(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$9(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$9(tests[index]);
+  }
+  return castFactory$9(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$9(check) {
+  return castFactory$9(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$9(check) {
+  return castFactory$9(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$9(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$9() {
+  return true
+}
+
+function color$a(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$9 = true;
+const EXIT$9 = false;
+const SKIP$9 = 'skip';
+const visitParents$9 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$9(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$a(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$9(visitor(node, parents));
+            if (result[0] === EXIT$9) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$9) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$9) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$9(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$9, value]
+  }
+  return [value]
+}
+
+const visit$9 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$9(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -15979,25 +20212,206 @@ const remarkLintNoHeadingIndent = lintRule(
     url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-heading-indent#readme'
   },
   (tree, file) => {
-    visit$1(tree, 'heading', (node, _, parent) => {
+    visit$9(tree, 'heading', (node, _, parent) => {
       if (generated(node) || (parent && parent.type !== 'root')) {
         return
       }
-      const diff = pointStart(node).column - 1;
-      if (diff) {
-        file.message(
-          'Remove ' +
-            diff +
-            ' ' +
-            plural('space', diff) +
-            ' before this heading',
-          pointStart(node)
-        );
+      const diff = pointStart(node).column - 1;
+      if (diff) {
+        file.message(
+          'Remove ' +
+            diff +
+            ' ' +
+            plural('space', diff) +
+            ' before this heading',
+          pointStart(node)
+        );
+      }
+    });
+  }
+);
+var remarkLintNoHeadingIndent$1 = remarkLintNoHeadingIndent;
+
+const convert$8 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$8
+      }
+      if (typeof test === 'string') {
+        return typeFactory$8(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$8(test) : propsFactory$8(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$8(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$8(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$8(tests[index]);
+  }
+  return castFactory$8(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$8(check) {
+  return castFactory$8(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$8(check) {
+  return castFactory$8(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$8(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$8() {
+  return true
+}
+
+function color$9(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$8 = true;
+const EXIT$8 = false;
+const SKIP$8 = 'skip';
+const visitParents$8 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$8(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$9(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$8(visitor(node, parents));
+            if (result[0] === EXIT$8) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$8) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$8) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$8(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$8, value]
+  }
+  return [value]
+}
+
+const visit$8 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
       }
-    });
+      visitParents$8(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
+function stringifyPosition(value) {
+  if (!value || typeof value !== 'object') {
+    return ''
   }
-);
-var remarkLintNoHeadingIndent$1 = remarkLintNoHeadingIndent;
+  if ('position' in value || 'type' in value) {
+    return position(value.position)
+  }
+  if ('start' in value || 'end' in value) {
+    return position(value)
+  }
+  if ('line' in value || 'column' in value) {
+    return point(value)
+  }
+  return ''
+}
+function point(point) {
+  return index(point && point.line) + ':' + index(point && point.column)
+}
+function position(pos) {
+  return point(pos && pos.start) + '-' + point(pos && pos.end)
+}
+function index(value) {
+  return value && typeof value === 'number' ? value : 1
+}
 
 /**
  * ## When should I use this?
@@ -16049,7 +20463,7 @@ const remarkLintNoMultipleToplevelHeadings = lintRule(
   },
   (tree, file, option = 1) => {
     let duplicate;
-    visit$1(tree, 'heading', (node) => {
+    visit$8(tree, 'heading', (node) => {
       if (!generated(node) && node.depth === option) {
         if (duplicate) {
           file.message(
@@ -16057,7 +20471,7 @@ const remarkLintNoMultipleToplevelHeadings = lintRule(
             node
           );
         } else {
-          duplicate = stringifyPosition$2(pointStart(node));
+          duplicate = stringifyPosition(pointStart(node));
         }
       }
     });
@@ -16065,6 +20479,162 @@ const remarkLintNoMultipleToplevelHeadings = lintRule(
 );
 var remarkLintNoMultipleToplevelHeadings$1 = remarkLintNoMultipleToplevelHeadings;
 
+const convert$7 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$7
+      }
+      if (typeof test === 'string') {
+        return typeFactory$7(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$7(test) : propsFactory$7(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$7(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$7(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$7(tests[index]);
+  }
+  return castFactory$7(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$7(check) {
+  return castFactory$7(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$7(check) {
+  return castFactory$7(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$7(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$7() {
+  return true
+}
+
+function color$8(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$7 = true;
+const EXIT$7 = false;
+const SKIP$7 = 'skip';
+const visitParents$7 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$7(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$8(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$7(visitor(node, parents));
+            if (result[0] === EXIT$7) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$7) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$7) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$7(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$7, value]
+  }
+  return [value]
+}
+
+const visit$7 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$7(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -16154,7 +20724,7 @@ const remarkLintNoShellDollars = lintRule(
     url: 'https://github.com/remarkjs/remark-lint/tree/main/packages/remark-lint-no-shell-dollars#readme'
   },
   (tree, file) => {
-    visit$1(tree, 'code', (node) => {
+    visit$7(tree, 'code', (node) => {
       if (!generated(node) && node.lang && flags.has(node.lang)) {
         const lines = node.value
           .split('\n')
@@ -16163,18 +20733,174 @@ const remarkLintNoShellDollars = lintRule(
         if (lines.length === 0) {
           return
         }
-        while (++index < lines.length) {
-          const line = lines[index];
-          if (line.trim() && !/^\s*\$\s*/.test(line)) {
-            return
+        while (++index < lines.length) {
+          const line = lines[index];
+          if (line.trim() && !/^\s*\$\s*/.test(line)) {
+            return
+          }
+        }
+        file.message('Do not use dollar signs before shell commands', node);
+      }
+    });
+  }
+);
+var remarkLintNoShellDollars$1 = remarkLintNoShellDollars;
+
+const convert$6 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$6
+      }
+      if (typeof test === 'string') {
+        return typeFactory$6(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$6(test) : propsFactory$6(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$6(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$6(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$6(tests[index]);
+  }
+  return castFactory$6(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$6(check) {
+  return castFactory$6(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$6(check) {
+  return castFactory$6(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$6(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$6() {
+  return true
+}
+
+function color$7(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$6 = true;
+const EXIT$6 = false;
+const SKIP$6 = 'skip';
+const visitParents$6 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$6(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$7(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$6(visitor(node, parents));
+            if (result[0] === EXIT$6) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$6) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$6) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
           }
+          return result
         }
-        file.message('Do not use dollar signs before shell commands', node);
       }
-    });
+    }
+  );
+function toResult$6(value) {
+  if (Array.isArray(value)) {
+    return value
   }
-);
-var remarkLintNoShellDollars$1 = remarkLintNoShellDollars;
+  if (typeof value === 'number') {
+    return [CONTINUE$6, value]
+  }
+  return [value]
+}
+
+const visit$6 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$6(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
@@ -16261,7 +20987,7 @@ const remarkLintNoTableIndentation = lintRule(
   (tree, file) => {
     const value = String(file);
     const loc = location(value);
-    visit$1(tree, 'table', (node, _, parent) => {
+    visit$6(tree, 'table', (node, _, parent) => {
       const end = pointEnd(node).line;
       let line = pointStart(node).line;
       let column = 0;
@@ -16295,7 +21021,7 @@ const remarkLintNoTableIndentation = lintRule(
         }
         line++;
       }
-      return SKIP$1
+      return SKIP$6
     });
   }
 );
@@ -16767,7 +21493,7 @@ function validateLinks(tree, vfile) {
           : "#";
         vfile.message(
           `Self-reference must start with hash (expected "${expected}", got "${node.url}")`,
-          node
+          node,
         );
       }
     }
@@ -16775,7 +21501,7 @@ function validateLinks(tree, vfile) {
       if (previousDefinitionLabel && previousDefinitionLabel > node.label) {
         vfile.message(
           `Unordered reference ("${node.label}" should be before "${previousDefinitionLabel}")`,
-          node
+          node,
         );
       }
       previousDefinitionLabel = node.label;
@@ -16784,7 +21510,7 @@ function validateLinks(tree, vfile) {
 }
 const remarkLintNodejsLinks = lintRule(
   "remark-lint:nodejs-links",
-  validateLinks
+  validateLinks,
 );
 
 /*! js-yaml 4.1.0 https://github.com/nodeca/js-yaml @license MIT */
@@ -20072,7 +24798,7 @@ const allowedKeys = [
 const changesExpectedKeys = ["version", "pr-url", "description"];
 const VERSION_PLACEHOLDER = "REPLACEME";
 const MAX_SAFE_SEMVER_VERSION = semverParse(
-  Array.from({ length: 3 }, () => Number.MAX_SAFE_INTEGER).join(".")
+  Array.from({ length: 3 }, () => Number.MAX_SAFE_INTEGER).join("."),
 );
 const validVersionNumberRegex = /^v\d+\.\d+\.\d+$/;
 const prUrlRegex = new RegExp("^https://github.com/nodejs/node/pull/\\d+$");
@@ -20082,7 +24808,7 @@ let invalidVersionMessage = "version(s) must respect the pattern `vx.x.x` or";
 if (process.env.NODE_RELEASED_VERSIONS) {
   console.log("Using release list from env...");
   releasedVersions = process.env.NODE_RELEASED_VERSIONS.split(",").map(
-    (v) => `v${v}`
+    (v) => `v${v}`,
   );
   invalidVersionMessage = `version not listed in the changelogs, `;
 }
@@ -20120,7 +24846,7 @@ function areVersionsUnordered(versions) {
     if (
       semverLt(
         getValidSemver(versions[index - 1]),
-        getValidSemver(versions[index])
+        getValidSemver(versions[index]),
       )
     ) {
       return true;
@@ -20140,7 +24866,7 @@ function validateSecurityChange(file, node, change, index) {
     if (typeof change.commit !== "string" || isNaN(`0x${change.commit}`)) {
       file.message(
         `changes[${index}]: Ill-formed security change commit ID`,
-        node
+        node,
       );
     }
     if (Object.keys(change)[1] === "commit") {
@@ -20154,7 +24880,7 @@ function validateSecurityChange(file, node, change, index) {
     file.message(
       `changes[${index}]: Invalid keys. Expected keys are: ` +
         securityChangeExpectedKeys.join(", "),
-      node
+      node,
     );
   }
 }
@@ -20176,7 +24902,7 @@ function validateChanges(file, node, changes) {
       file.message(
         `changes[${index}]: Invalid keys. Expected keys are: ` +
           changesExpectedKeys.join(", "),
-        node
+        node,
       );
     }
     if (containsInvalidVersionNumber(change.version)) {
@@ -20187,22 +24913,22 @@ function validateChanges(file, node, changes) {
     if (!isAncient && !isSecurityChange && !prUrlRegex.test(change["pr-url"])) {
       file.message(
         `changes[${index}]: PR-URL does not match the expected pattern`,
-        node
+        node,
       );
     }
     if (typeof change.description !== "string" || !change.description.length) {
       file.message(
         `changes[${index}]: must contain a non-empty description`,
-        node
+        node,
       );
     } else if (!change.description.endsWith(".")) {
       file.message(
         `changes[${index}]: description must end with a period`,
-        node
+        node,
       );
     }
     changesVersions.push(
-      Array.isArray(change.version) ? change.version[0] : change.version
+      Array.isArray(change.version) ? change.version[0] : change.version,
     );
   }
   if (areVersionsUnordered(changesVersions)) {
@@ -20215,14 +24941,14 @@ function validateMeta(node, file, meta) {
       file.message(
         "YAML dictionary contains illegal keys. Accepted values are: " +
           allowedKeys.join(", "),
-        node
+        node,
       );
       break;
     case kWrongKeyOrder:
       file.message(
         "YAML dictionary keys should be in this order: " +
           allowedKeys.join(", "),
-        node
+        node,
       );
       break;
   }
@@ -20234,7 +24960,7 @@ function validateMeta(node, file, meta) {
   if (containsInvalidVersionNumber(meta.deprecated)) {
     file.message(
       `Invalid \`deprecated\` value: ${invalidVersionMessage}`,
-      node
+      node,
     );
   } else if (areVersionsUnordered(meta.deprecated)) {
     file.message("Versions in `deprecated` list are not in order", node);
@@ -20249,11 +24975,11 @@ function validateMeta(node, file, meta) {
   }
 }
 function validateYAMLComments(tree, file) {
-  visit$1(tree, "html", function visitor(node) {
+  visit$A(tree, "html", function visitor(node) {
     if (node.value.startsWith("<!--YAML\n"))
       file.message(
         "Expected `<!-- YAML`, found `<!--YAML`. Please add a space",
-        node
+        node,
       );
     if (!node.value.startsWith("<!-- YAML\n")) return;
     try {
@@ -20262,12 +24988,168 @@ function validateYAMLComments(tree, file) {
     } catch (e) {
       file.message(e, node);
     }
-  });
-}
-const remarkLintNodejsYamlComments = lintRule(
-  "remark-lint:nodejs-yaml-comments",
-  validateYAMLComments
-);
+  });
+}
+const remarkLintNodejsYamlComments = lintRule(
+  "remark-lint:nodejs-yaml-comments",
+  validateYAMLComments,
+);
+
+const convert$5 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$5
+      }
+      if (typeof test === 'string') {
+        return typeFactory$5(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$5(test) : propsFactory$5(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$5(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$5(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$5(tests[index]);
+  }
+  return castFactory$5(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$5(check) {
+  return castFactory$5(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$5(check) {
+  return castFactory$5(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$5(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$5() {
+  return true
+}
+
+function color$6(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$5 = true;
+const EXIT$5 = false;
+const SKIP$5 = 'skip';
+const visitParents$5 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$5(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$6(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$5(visitor(node, parents));
+            if (result[0] === EXIT$5) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$5) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$5) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$5(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$5, value]
+  }
+  return [value]
+}
+
+const visit$5 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$5(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 const remarkLintProhibitedStrings = lintRule('remark-lint:prohibited-strings', prohibitedStrings);
 function testProhibited (val, content) {
@@ -20321,7 +25203,7 @@ function testProhibited (val, content) {
 }
 function prohibitedStrings (ast, file, strings) {
   const myLocation = location(file);
-  visit$1(ast, 'text', checkText);
+  visit$5(ast, 'text', checkText);
   function checkText (node) {
     const content = node.value;
     const initial = pointStart(node).offset;
@@ -20340,6 +25222,162 @@ function prohibitedStrings (ast, file, strings) {
   }
 }
 
+const convert$4 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$4
+      }
+      if (typeof test === 'string') {
+        return typeFactory$4(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$4(test) : propsFactory$4(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$4(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$4(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$4(tests[index]);
+  }
+  return castFactory$4(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$4(check) {
+  return castFactory$4(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$4(check) {
+  return castFactory$4(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$4(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$4() {
+  return true
+}
+
+function color$5(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$4 = true;
+const EXIT$4 = false;
+const SKIP$4 = 'skip';
+const visitParents$4 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$4(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$5(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$4(visitor(node, parents));
+            if (result[0] === EXIT$4) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$4) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$4) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$4(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$4, value]
+  }
+  return [value]
+}
+
+const visit$4 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$4(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -20427,7 +25465,7 @@ const remarkLintRuleStyle = lintRule(
         "Incorrect preferred rule style: provide a correct markdown rule or `'consistent'`"
       );
     }
-    visit$1(tree, 'thematicBreak', (node) => {
+    visit$4(tree, 'thematicBreak', (node) => {
       const initial = pointStart(node).offset;
       const final = pointEnd(node).offset;
       if (typeof initial === 'number' && typeof final === 'number') {
@@ -20438,10 +25476,166 @@ const remarkLintRuleStyle = lintRule(
           file.message('Rules should use `' + option + '`', node);
         }
       }
-    });
-  }
-);
-var remarkLintRuleStyle$1 = remarkLintRuleStyle;
+    });
+  }
+);
+var remarkLintRuleStyle$1 = remarkLintRuleStyle;
+
+const convert$3 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$3
+      }
+      if (typeof test === 'string') {
+        return typeFactory$3(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$3(test) : propsFactory$3(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$3(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$3(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$3(tests[index]);
+  }
+  return castFactory$3(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$3(check) {
+  return castFactory$3(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$3(check) {
+  return castFactory$3(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$3(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$3() {
+  return true
+}
+
+function color$4(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$3 = true;
+const EXIT$3 = false;
+const SKIP$3 = 'skip';
+const visitParents$3 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$3(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$4(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$3(visitor(node, parents));
+            if (result[0] === EXIT$3) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$3) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$3) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$3(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$3, value]
+  }
+  return [value]
+}
+
+const visit$3 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$3(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
 
 /**
  * ## When should I use this?
@@ -20533,7 +25727,7 @@ const remarkLintStrongMarker = lintRule(
           "`: use either `'consistent'`, `'*'`, or `'_'`"
       );
     }
-    visit$1(tree, 'strong', (node) => {
+    visit$3(tree, 'strong', (node) => {
       const start = pointStart(node).offset;
       if (typeof start === 'number') {
         const marker =  (value.charAt(start));
@@ -20548,6 +25742,162 @@ const remarkLintStrongMarker = lintRule(
 );
 var remarkLintStrongMarker$1 = remarkLintStrongMarker;
 
+const convert$2 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$2
+      }
+      if (typeof test === 'string') {
+        return typeFactory$2(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$2(test) : propsFactory$2(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$2(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$2(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$2(tests[index]);
+  }
+  return castFactory$2(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$2(check) {
+  return castFactory$2(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$2(check) {
+  return castFactory$2(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$2(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$2() {
+  return true
+}
+
+function color$3(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$2 = true;
+const EXIT$2 = false;
+const SKIP$2 = 'skip';
+const visitParents$2 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$2(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$3(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$2(visitor(node, parents));
+            if (result[0] === EXIT$2) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$2) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$2) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult$2(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE$2, value]
+  }
+  return [value]
+}
+
+const visit$2 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$2(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -20749,7 +26099,7 @@ const remarkLintTableCellPadding = lintRule(
           "`, expected `'padded'`, `'compact'`, or `'consistent'`"
       );
     }
-    visit$1(tree, 'table', (node) => {
+    visit$2(tree, 'table', (node) => {
       const rows = node.children;
       const align = node.align || [];
       const sizes = [];
@@ -20807,7 +26157,7 @@ const remarkLintTableCellPadding = lintRule(
         checkSide('start', entries[index], style, sizes);
         checkSide('end', entries[index], style, sizes);
       }
-      return SKIP$1
+      return SKIP$2
     });
     function checkSide(side, entry, style, sizes) {
       const cell = entry.node;
@@ -20828,25 +26178,181 @@ const remarkLintTableCellPadding = lintRule(
           if (size(cell) < sizes[column]) {
             return
           }
-          reason += ' with 1 space, not ' + spacing;
+          reason += ' with 1 space, not ' + spacing;
+        }
+      }
+      file.message(
+        reason,
+        side === 'start'
+          ? pointStart(cell.children[0])
+          : pointEnd(cell.children[cell.children.length - 1])
+      );
+    }
+  }
+);
+var remarkLintTableCellPadding$1 = remarkLintTableCellPadding;
+function size(node) {
+  const head = pointStart(node.children[0]).offset;
+  const tail = pointEnd(node.children[node.children.length - 1]).offset;
+  return typeof head === 'number' && typeof tail === 'number' ? tail - head : 0
+}
+
+const convert$1 =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok$1
+      }
+      if (typeof test === 'string') {
+        return typeFactory$1(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory$1(test) : propsFactory$1(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory$1(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory$1(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert$1(tests[index]);
+  }
+  return castFactory$1(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory$1(check) {
+  return castFactory$1(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory$1(check) {
+  return castFactory$1(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory$1(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok$1() {
+  return true
+}
+
+function color$2(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE$1 = true;
+const EXIT$1 = false;
+const SKIP$1 = 'skip';
+const visitParents$1 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert$1(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$2(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult$1(visitor(node, parents));
+            if (result[0] === EXIT$1) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP$1) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT$1) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
         }
       }
-      file.message(
-        reason,
-        side === 'start'
-          ? pointStart(cell.children[0])
-          : pointEnd(cell.children[cell.children.length - 1])
-      );
     }
+  );
+function toResult$1(value) {
+  if (Array.isArray(value)) {
+    return value
   }
-);
-var remarkLintTableCellPadding$1 = remarkLintTableCellPadding;
-function size(node) {
-  const head = pointStart(node.children[0]).offset;
-  const tail = pointEnd(node.children[node.children.length - 1]).offset;
-  return typeof head === 'number' && typeof tail === 'number' ? tail - head : 0
+  if (typeof value === 'number') {
+    return [CONTINUE$1, value]
+  }
+  return [value]
 }
 
+const visit$1 =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents$1(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -20931,6 +26437,162 @@ const remarkLintTablePipes = lintRule(
 );
 var remarkLintTablePipes$1 = remarkLintTablePipes;
 
+const convert =
+  (
+    function (test) {
+      if (test === undefined || test === null) {
+        return ok
+      }
+      if (typeof test === 'string') {
+        return typeFactory(test)
+      }
+      if (typeof test === 'object') {
+        return Array.isArray(test) ? anyFactory(test) : propsFactory(test)
+      }
+      if (typeof test === 'function') {
+        return castFactory(test)
+      }
+      throw new Error('Expected function, string, or object as test')
+    }
+  );
+function anyFactory(tests) {
+  const checks = [];
+  let index = -1;
+  while (++index < tests.length) {
+    checks[index] = convert(tests[index]);
+  }
+  return castFactory(any)
+  function any(...parameters) {
+    let index = -1;
+    while (++index < checks.length) {
+      if (checks[index].call(this, ...parameters)) return true
+    }
+    return false
+  }
+}
+function propsFactory(check) {
+  return castFactory(all)
+  function all(node) {
+    let key;
+    for (key in check) {
+      if (node[key] !== check[key]) return false
+    }
+    return true
+  }
+}
+function typeFactory(check) {
+  return castFactory(type)
+  function type(node) {
+    return node && node.type === check
+  }
+}
+function castFactory(check) {
+  return assertion
+  function assertion(node, ...parameters) {
+    return Boolean(
+      node &&
+        typeof node === 'object' &&
+        'type' in node &&
+        Boolean(check.call(this, node, ...parameters))
+    )
+  }
+}
+function ok() {
+  return true
+}
+
+function color$1(d) {
+  return '\u001B[33m' + d + '\u001B[39m'
+}
+
+const CONTINUE = true;
+const EXIT = false;
+const SKIP = 'skip';
+const visitParents =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      const is = convert(test);
+      const step = reverse ? -1 : 1;
+      factory(tree, undefined, [])();
+      function factory(node, index, parents) {
+        const value = node && typeof node === 'object' ? node : {};
+        if (typeof value.type === 'string') {
+          const name =
+            typeof value.tagName === 'string'
+              ? value.tagName
+              :
+              typeof value.name === 'string'
+              ? value.name
+              : undefined;
+          Object.defineProperty(visit, 'name', {
+            value:
+              'node (' + color$1(node.type + (name ? '<' + name + '>' : '')) + ')'
+          });
+        }
+        return visit
+        function visit() {
+          let result = [];
+          let subresult;
+          let offset;
+          let grandparents;
+          if (!test || is(node, index, parents[parents.length - 1] || null)) {
+            result = toResult(visitor(node, parents));
+            if (result[0] === EXIT) {
+              return result
+            }
+          }
+          if (node.children && result[0] !== SKIP) {
+            offset = (reverse ? node.children.length : -1) + step;
+            grandparents = parents.concat(node);
+            while (offset > -1 && offset < node.children.length) {
+              subresult = factory(node.children[offset], offset, grandparents)();
+              if (subresult[0] === EXIT) {
+                return subresult
+              }
+              offset =
+                typeof subresult[1] === 'number' ? subresult[1] : offset + step;
+            }
+          }
+          return result
+        }
+      }
+    }
+  );
+function toResult(value) {
+  if (Array.isArray(value)) {
+    return value
+  }
+  if (typeof value === 'number') {
+    return [CONTINUE, value]
+  }
+  return [value]
+}
+
+const visit =
+  (
+    function (tree, test, visitor, reverse) {
+      if (typeof test === 'function' && typeof visitor !== 'function') {
+        reverse = visitor;
+        visitor = test;
+        test = null;
+      }
+      visitParents(tree, test, overload, reverse);
+      function overload(node, parents) {
+        const parent = parents[parents.length - 1];
+        return visitor(
+          node,
+          parent ? parent.children.indexOf(node) : null,
+          parent
+        )
+      }
+    }
+  );
+
 /**
  * ## When should I use this?
  *
@@ -21034,7 +26696,7 @@ const remarkLintUnorderedListMarkerStyle = lintRule(
           "`: use either `'-'`, `'*'`, or `'+'`"
       );
     }
-    visit$1(tree, 'list', (node) => {
+    visit(tree, 'list', (node) => {
       if (node.ordered) return
       let index = -1;
       while (++index < node.children.length) {
@@ -21140,36 +26802,11 @@ const plugins = [
 ];
 const settings = {
   emphasis: "_",
-  listItemIndent: 1,
+  listItemIndent: "one",
   tightDefinitions: true,
 };
 const remarkPresetLintNode = { plugins, settings };
 
-function stringifyPosition$1(value) {
-  if (!value || typeof value !== 'object') {
-    return ''
-  }
-  if ('position' in value || 'type' in value) {
-    return position$1(value.position)
-  }
-  if ('start' in value || 'end' in value) {
-    return position$1(value)
-  }
-  if ('line' in value || 'column' in value) {
-    return point$1(value)
-  }
-  return ''
-}
-function point$1(point) {
-  return index$1(point && point.line) + ':' + index$1(point && point.column)
-}
-function position$1(pos) {
-  return point$1(pos && pos.start) + '-' + point$1(pos && pos.end)
-}
-function index$1(value) {
-  return value && typeof value === 'number' ? value : 1
-}
-
 class VFileMessage extends Error {
   constructor(causeOrReason, optionsOrParentOrPlace, origin) {
     super();
@@ -21237,7 +26874,7 @@ class VFileMessage extends Error {
     this.file;
     this.message = reason;
     this.line = start ? start.line : undefined;
-    this.name = stringifyPosition$1(options.place) || '1:1';
+    this.name = stringifyPosition$2(options.place) || '1:1';
     this.place = options.place || undefined;
     this.reason = this.message;
     this.ruleId = options.ruleId || undefined;
@@ -21870,31 +27507,6 @@ function stringWidth(string, options) {
 	return width;
 }
 
-function stringifyPosition(value) {
-  if (!value || typeof value !== 'object') {
-    return ''
-  }
-  if ('position' in value || 'type' in value) {
-    return position(value.position)
-  }
-  if ('start' in value || 'end' in value) {
-    return position(value)
-  }
-  if ('line' in value || 'column' in value) {
-    return point(value)
-  }
-  return ''
-}
-function point(point) {
-  return index(point && point.line) + ':' + index(point && point.column)
-}
-function position(pos) {
-  return point(pos && pos.start) + '-' + point(pos && pos.end)
-}
-function index(value) {
-  return value && typeof value === 'number' ? value : 1
-}
-
 function compareFile(a, b) {
   return compareString(a, b, 'path')
 }
@@ -22152,7 +27764,7 @@ function createAncestorsLines(state, ancestors) {
         typeof value.name === 'string'
         ? value.name
         : undefined;
-    const position = stringifyPosition(node.position);
+    const position = stringifyPosition$2(node.position);
     lines.push(
       '    at ' +
         state.yellow +
@@ -22257,7 +27869,7 @@ function createMessageLine(state, message) {
   }
   const place = message.place || message.position;
   const row = [
-    stringifyPosition(place),
+    stringifyPosition$2(place),
     (label === 'error' ? state.red : state.yellow) + label + state.defaultColor,
     formatReason(state, reason),
     message.ruleId || '',
diff --git a/tools/lint-md/package-lock.json b/tools/lint-md/package-lock.json
index d6fe5fdb82b3a6..6c1310c681d71e 100644
--- a/tools/lint-md/package-lock.json
+++ b/tools/lint-md/package-lock.json
@@ -8,17 +8,17 @@
       "name": "lint-md",
       "version": "1.0.0",
       "dependencies": {
-        "remark-parse": "^10.0.2",
-        "remark-preset-lint-node": "^4.0.0",
-        "remark-stringify": "^10.0.3",
+        "remark-parse": "^11.0.0",
+        "remark-preset-lint-node": "^5.0.0",
+        "remark-stringify": "^11.0.0",
         "to-vfile": "^8.0.0",
         "unified": "^11.0.3",
         "vfile-reporter": "^8.1.0"
       },
       "devDependencies": {
-        "@rollup/plugin-commonjs": "^25.0.4",
-        "@rollup/plugin-node-resolve": "^15.2.1",
-        "rollup": "^3.29.0",
+        "@rollup/plugin-commonjs": "^25.0.5",
+        "@rollup/plugin-node-resolve": "^15.2.2",
+        "rollup": "^4.0.2",
         "rollup-plugin-cleanup": "^3.2.1"
       }
     },
@@ -29,9 +29,9 @@
       "dev": true
     },
     "node_modules/@rollup/plugin-commonjs": {
-      "version": "25.0.4",
-      "resolved": "https://registry.npmjs.org/@rollup/plugin-commonjs/-/plugin-commonjs-25.0.4.tgz",
-      "integrity": "sha512-L92Vz9WUZXDnlQQl3EwbypJR4+DM2EbsO+/KOcEkP4Mc6Ct453EeDB2uH9lgRwj4w5yflgNpq9pHOiY8aoUXBQ==",
+      "version": "25.0.5",
+      "resolved": "https://registry.npmjs.org/@rollup/plugin-commonjs/-/plugin-commonjs-25.0.5.tgz",
+      "integrity": "sha512-xY8r/A9oisSeSuLCTfhssyDjo9Vp/eDiRLXkg1MXCcEEgEjPmLU+ZyDB20OOD0NlyDa/8SGbK5uIggF5XTx77w==",
       "dev": true,
       "dependencies": {
         "@rollup/pluginutils": "^5.0.1",
@@ -45,7 +45,7 @@
         "node": ">=14.0.0"
       },
       "peerDependencies": {
-        "rollup": "^2.68.0||^3.0.0"
+        "rollup": "^2.68.0||^3.0.0||^4.0.0"
       },
       "peerDependenciesMeta": {
         "rollup": {
@@ -54,9 +54,9 @@
       }
     },
     "node_modules/@rollup/plugin-node-resolve": {
-      "version": "15.2.1",
-      "resolved": "https://registry.npmjs.org/@rollup/plugin-node-resolve/-/plugin-node-resolve-15.2.1.tgz",
-      "integrity": "sha512-nsbUg588+GDSu8/NS8T4UAshO6xeaOfINNuXeVHcKV02LJtoRaM1SiOacClw4kws1SFiNhdLGxlbMY9ga/zs/w==",
+      "version": "15.2.2",
+      "resolved": "https://registry.npmjs.org/@rollup/plugin-node-resolve/-/plugin-node-resolve-15.2.2.tgz",
+      "integrity": "sha512-f64bU4OKqV0yihtxFemmuf0oj37pToCFMISCA+sJbbIAl5wcpbRO9XgWNWb1tDiWQJUcPxo6V0l59hcuZOQ3kw==",
       "dev": true,
       "dependencies": {
         "@rollup/pluginutils": "^5.0.1",
@@ -70,7 +70,7 @@
         "node": ">=14.0.0"
       },
       "peerDependencies": {
-        "rollup": "^2.78.0||^3.0.0"
+        "rollup": "^2.78.0||^3.0.0||^4.0.0"
       },
       "peerDependenciesMeta": {
         "rollup": {
@@ -79,9 +79,9 @@
       }
     },
     "node_modules/@rollup/pluginutils": {
-      "version": "5.0.4",
-      "resolved": "https://registry.npmjs.org/@rollup/pluginutils/-/pluginutils-5.0.4.tgz",
-      "integrity": "sha512-0KJnIoRI8A+a1dqOYLxH8vBf8bphDmty5QvIm2hqm7oFCFYKCAZWWd2hXgMibaPsNDhI0AtpYfQZJG47pt/k4g==",
+      "version": "5.0.5",
+      "resolved": "https://registry.npmjs.org/@rollup/pluginutils/-/pluginutils-5.0.5.tgz",
+      "integrity": "sha512-6aEYR910NyP73oHiJglti74iRyOwgFU4x3meH/H8OJx6Ry0j6cOVZ5X/wTvub7G7Ao6qaHBEaNsV3GLJkSsF+Q==",
       "dev": true,
       "dependencies": {
         "@types/estree": "^1.0.0",
@@ -92,7 +92,7 @@
         "node": ">=14.0.0"
       },
       "peerDependencies": {
-        "rollup": "^1.20.0||^2.0.0||^3.0.0"
+        "rollup": "^1.20.0||^2.0.0||^3.0.0||^4.0.0"
       },
       "peerDependenciesMeta": {
         "rollup": {
@@ -100,47 +100,208 @@
         }
       }
     },
+    "node_modules/@rollup/rollup-android-arm-eabi": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-android-arm-eabi/-/rollup-android-arm-eabi-4.0.2.tgz",
+      "integrity": "sha512-xDvk1pT4vaPU2BOLy0MqHMdYZyntqpaBf8RhBiezlqG9OjY8F50TyctHo8znigYKd+QCFhCmlmXHOL/LoaOl3w==",
+      "cpu": [
+        "arm"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "android"
+      ]
+    },
+    "node_modules/@rollup/rollup-android-arm64": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-android-arm64/-/rollup-android-arm64-4.0.2.tgz",
+      "integrity": "sha512-lqCglytY3E6raze27DD9VQJWohbwCxzqs9aSHcj5X/8hJpzZfNdbsr4Ja9Hqp6iPyF53+5PtPx0pKRlkSvlHZg==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "android"
+      ]
+    },
+    "node_modules/@rollup/rollup-darwin-arm64": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-darwin-arm64/-/rollup-darwin-arm64-4.0.2.tgz",
+      "integrity": "sha512-nkBKItS6E6CCzvRwgiKad+j+1ibmL7SIInj7oqMWmdkCjiSX6VeVZw2mLlRKIUL+JjsBgpATTfo7BiAXc1v0jA==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "darwin"
+      ]
+    },
+    "node_modules/@rollup/rollup-darwin-x64": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-darwin-x64/-/rollup-darwin-x64-4.0.2.tgz",
+      "integrity": "sha512-vX2C8xvWPIbpEgQht95+dY6BReKAvtDgPDGi0XN0kWJKkm4WdNmq5dnwscv/zxvi+n6jUTBhs6GtpkkWT4q8Gg==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "darwin"
+      ]
+    },
+    "node_modules/@rollup/rollup-linux-arm-gnueabihf": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-linux-arm-gnueabihf/-/rollup-linux-arm-gnueabihf-4.0.2.tgz",
+      "integrity": "sha512-DVFIfcHOjgmeHOAqji4xNz2wczt1Bmzy9MwBZKBa83SjBVO/i38VHDR+9ixo8QpBOiEagmNw12DucG+v55tCrg==",
+      "cpu": [
+        "arm"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "linux"
+      ]
+    },
+    "node_modules/@rollup/rollup-linux-arm64-gnu": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-linux-arm64-gnu/-/rollup-linux-arm64-gnu-4.0.2.tgz",
+      "integrity": "sha512-GCK/a9ItUxPI0V5hQEJjH4JtOJO90GF2Hja7TO+EZ8rmkGvEi8/ZDMhXmcuDpQT7/PWrTT9RvnG8snMd5SrhBQ==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "linux"
+      ]
+    },
+    "node_modules/@rollup/rollup-linux-arm64-musl": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-linux-arm64-musl/-/rollup-linux-arm64-musl-4.0.2.tgz",
+      "integrity": "sha512-cLuBp7rOjIB1R2j/VazjCmHC7liWUur2e9mFflLJBAWCkrZ+X0+QwHLvOQakIwDymungzAKv6W9kHZnTp/Mqrg==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "linux"
+      ]
+    },
+    "node_modules/@rollup/rollup-linux-x64-gnu": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-linux-x64-gnu/-/rollup-linux-x64-gnu-4.0.2.tgz",
+      "integrity": "sha512-Zqw4iVnJr2naoyQus0yLy7sLtisCQcpdMKUCeXPBjkJtpiflRime/TMojbnl8O3oxUAj92mxr+t7im/RbgA20w==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "linux"
+      ]
+    },
+    "node_modules/@rollup/rollup-linux-x64-musl": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-linux-x64-musl/-/rollup-linux-x64-musl-4.0.2.tgz",
+      "integrity": "sha512-jJRU9TyUD/iMqjf8aLAp7XiN3pIj5v6Qcu+cdzBfVTKDD0Fvua4oUoK8eVJ9ZuKBEQKt3WdlcwJXFkpmMLk6kg==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "linux"
+      ]
+    },
+    "node_modules/@rollup/rollup-win32-arm64-msvc": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-win32-arm64-msvc/-/rollup-win32-arm64-msvc-4.0.2.tgz",
+      "integrity": "sha512-ZkS2NixCxHKC4zbOnw64ztEGGDVIYP6nKkGBfOAxEPW71Sji9v8z3yaHNuae/JHPwXA+14oDefnOuVfxl59SmQ==",
+      "cpu": [
+        "arm64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "win32"
+      ]
+    },
+    "node_modules/@rollup/rollup-win32-ia32-msvc": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-win32-ia32-msvc/-/rollup-win32-ia32-msvc-4.0.2.tgz",
+      "integrity": "sha512-3SKjj+tvnZ0oZq2BKB+fI+DqYI83VrRzk7eed8tJkxeZ4zxJZcLSE8YDQLYGq1tZAnAX+H076RHHB4gTZXsQzw==",
+      "cpu": [
+        "ia32"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "win32"
+      ]
+    },
+    "node_modules/@rollup/rollup-win32-x64-msvc": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/@rollup/rollup-win32-x64-msvc/-/rollup-win32-x64-msvc-4.0.2.tgz",
+      "integrity": "sha512-MBdJIOxRauKkry7t2q+rTHa3aWjVez2eioWg+etRVS3dE4tChhmt5oqZYr48R6bPmcwEhxQr96gVRfeQrLbqng==",
+      "cpu": [
+        "x64"
+      ],
+      "dev": true,
+      "optional": true,
+      "os": [
+        "win32"
+      ]
+    },
     "node_modules/@types/debug": {
-      "version": "4.1.8",
-      "resolved": "https://registry.npmjs.org/@types/debug/-/debug-4.1.8.tgz",
-      "integrity": "sha512-/vPO1EPOs306Cvhwv7KfVfYvOJqA/S/AXjaHQiJboCZzcNDb+TIJFN9/2C9DZ//ijSKWioNyUxD792QmDJ+HKQ==",
+      "version": "4.1.9",
+      "resolved": "https://registry.npmjs.org/@types/debug/-/debug-4.1.9.tgz",
+      "integrity": "sha512-8Hz50m2eoS56ldRlepxSBa6PWEVCtzUo/92HgLc2qTMnotJNIm7xP+UZhyWoYsyOdd5dxZ+NZLb24rsKyFs2ow==",
       "dependencies": {
         "@types/ms": "*"
       }
     },
     "node_modules/@types/estree": {
-      "version": "1.0.1",
-      "resolved": "https://registry.npmjs.org/@types/estree/-/estree-1.0.1.tgz",
-      "integrity": "sha512-LG4opVs2ANWZ1TJoKc937iMmNstM/d0ae1vNbnBvBhqCSezgVUOzcLCqbI5elV8Vy6WKwKjaqR+zO9VKirBBCA=="
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/@types/estree/-/estree-1.0.2.tgz",
+      "integrity": "sha512-VeiPZ9MMwXjO32/Xu7+OwflfmeoRwkE/qzndw42gGtgJwZopBnzy2gD//NN1+go1mADzkDcqf/KnFRSjTJ8xJA=="
     },
     "node_modules/@types/estree-jsx": {
-      "version": "1.0.0",
-      "resolved": "https://registry.npmjs.org/@types/estree-jsx/-/estree-jsx-1.0.0.tgz",
-      "integrity": "sha512-3qvGd0z8F2ENTGr/GG1yViqfiKmRfrXVx5sJyHGFu3z7m5g5utCQtGp/g29JnjflhtQJBv1WDQukHiT58xPcYQ==",
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/@types/estree-jsx/-/estree-jsx-1.0.1.tgz",
+      "integrity": "sha512-sHyakZlAezNFxmYRo0fopDZW+XvK6ipeZkkp5EAOLjdPfZp8VjZBJ67vSRI99RSCAoqXVmXOHS4fnWoxpuGQtQ==",
       "dependencies": {
         "@types/estree": "*"
       }
     },
     "node_modules/@types/hast": {
-      "version": "2.3.5",
-      "resolved": "https://registry.npmjs.org/@types/hast/-/hast-2.3.5.tgz",
-      "integrity": "sha512-SvQi0L/lNpThgPoleH53cdjB3y9zpLlVjRbqB3rH8hx1jiRSBGAhyjV3H+URFjNVRqt2EdYNrbZE5IsGlNfpRg==",
+      "version": "2.3.6",
+      "resolved": "https://registry.npmjs.org/@types/hast/-/hast-2.3.6.tgz",
+      "integrity": "sha512-47rJE80oqPmFdVDCD7IheXBrVdwuBgsYwoczFvKmwfo2Mzsnt+V9OONsYauFmICb6lQPpCuXYJWejBNs4pDJRg==",
       "dependencies": {
         "@types/unist": "^2"
       }
     },
+    "node_modules/@types/hast/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/@types/mdast": {
-      "version": "3.0.12",
-      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.12.tgz",
-      "integrity": "sha512-DT+iNIRNX884cx0/Q1ja7NyUPpZuv0KPyL5rGNxm1WC1OtHstl7n4Jb7nk+xacNShQMbczJjt8uFzznpp6kYBg==",
+      "version": "4.0.1",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-4.0.1.tgz",
+      "integrity": "sha512-IlKct1rUTJ1T81d8OHzyop15kGv9A/ff7Gz7IJgrk6jDb4Udw77pCJ+vq8oxZf4Ghpm+616+i1s/LNg/Vh7d+g==",
       "dependencies": {
-        "@types/unist": "^2"
+        "@types/unist": "*"
       }
     },
     "node_modules/@types/ms": {
-      "version": "0.7.31",
-      "resolved": "https://registry.npmjs.org/@types/ms/-/ms-0.7.31.tgz",
-      "integrity": "sha512-iiUgKzV9AuaEkZqkOLDIvlQiL6ltuZd9tGcW3gwpnX8JbuiuhFlEGmmFXEXkN50Cvq7Os88IY2v0dkDqXYWVgA=="
+      "version": "0.7.32",
+      "resolved": "https://registry.npmjs.org/@types/ms/-/ms-0.7.32.tgz",
+      "integrity": "sha512-xPSg0jm4mqgEkNhowKgZFBNtwoEwF6gJ4Dhww+GFpm3IgtNseHQZ5IqdNwnquZEoANxyDAKDRAdVo4Z72VvD/g=="
     },
     "node_modules/@types/resolve": {
       "version": "1.20.2",
@@ -154,9 +315,9 @@
       "integrity": "sha512-dPWnWsf+kzIG140B8z2w3fr5D03TLWbOAFQl45xUpI3vcizeXriNR5VYkWZ+WTMsUHqZ9Xlt3hrxGNANFyNQfw=="
     },
     "node_modules/@types/unist": {
-      "version": "2.0.8",
-      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
-      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-3.0.0.tgz",
+      "integrity": "sha512-MFETx3tbTjE7Uk6vvnWINA/1iJ7LuMdO4fcq8UfF0pRbj01aGLduVvQcRyswuACJdpnHgg8E3rQLhaRdNEJS0w=="
     },
     "node_modules/ansi-regex": {
       "version": "6.0.1",
@@ -356,12 +517,6 @@
         "node": "^8.16.0 || ^10.6.0 || >=11.0.0"
       }
     },
-    "node_modules/function-bind": {
-      "version": "1.1.1",
-      "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.1.tgz",
-      "integrity": "sha512-yIovAzMX49sF8Yl58fSCWJ5svSLuaibPxXQJFLmBObTuCr0Mf1KiPopGM9NiFjiYBCbfaa2Fh6breQ6ANVTI0A==",
-      "dev": true
-    },
     "node_modules/glob": {
       "version": "8.1.0",
       "resolved": "https://registry.npmjs.org/glob/-/glob-8.1.0.tgz",
@@ -382,13 +537,10 @@
       }
     },
     "node_modules/has": {
-      "version": "1.0.3",
-      "resolved": "https://registry.npmjs.org/has/-/has-1.0.3.tgz",
-      "integrity": "sha512-f2dvO0VU6Oej7RkWJGrehjbzMAjFp5/VKPp5tTpWIV4JHHZK1/BxbFRtf/siA2SWTe09caDmVtYYzWEIbBS4zw==",
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/has/-/has-1.0.4.tgz",
+      "integrity": "sha512-qdSAmqLF6209RFj4VVItywPMbm3vWylknmB3nvNiUIs72xAimcM8nVYxYr7ncvZq5qzk9MKIZR8ijqD/1QuYjQ==",
       "dev": true,
-      "dependencies": {
-        "function-bind": "^1.1.1"
-      },
       "engines": {
         "node": ">= 0.4.0"
       }
@@ -580,15 +732,28 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/mdast-comment-marker/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/mdast-comment-marker/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/mdast-util-find-and-replace": {
-      "version": "2.2.2",
-      "resolved": "https://registry.npmjs.org/mdast-util-find-and-replace/-/mdast-util-find-and-replace-2.2.2.tgz",
-      "integrity": "sha512-MTtdFRz/eMDHXzeK6W3dO7mXUlF82Gom4y0oOgvHhh/HXZAGvIQDUvQ0SuUx+j2tv44b8xTHOm8K/9OoRFnXKw==",
+      "version": "3.0.1",
+      "resolved": "https://registry.npmjs.org/mdast-util-find-and-replace/-/mdast-util-find-and-replace-3.0.1.tgz",
+      "integrity": "sha512-SG21kZHGC3XRTSUhtofZkBzZTJNM5ecCi0SK2IMKmSXR8vO3peL+kb1O0z7Zl83jKtutG4k5Wv/W7V3/YHvzPA==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
+        "@types/mdast": "^4.0.0",
         "escape-string-regexp": "^5.0.0",
-        "unist-util-is": "^5.0.0",
-        "unist-util-visit-parents": "^5.0.0"
+        "unist-util-is": "^6.0.0",
+        "unist-util-visit-parents": "^6.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -596,22 +761,22 @@
       }
     },
     "node_modules/mdast-util-from-markdown": {
-      "version": "1.3.1",
-      "resolved": "https://registry.npmjs.org/mdast-util-from-markdown/-/mdast-util-from-markdown-1.3.1.tgz",
-      "integrity": "sha512-4xTO/M8c82qBcnQc1tgpNtubGUW/Y1tBQ1B0i5CtSoelOLKFYlElIr3bvgREYYO5iRqbMY1YuqZng0GVOI8Qww==",
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-from-markdown/-/mdast-util-from-markdown-2.0.0.tgz",
+      "integrity": "sha512-n7MTOr/z+8NAX/wmhhDji8O3bRvPTV/U0oTCaZJkjhPSKTPhS3xufVhKGF8s1pJ7Ox4QgoIU7KHseh09S+9rTA==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "@types/unist": "^2.0.0",
+        "@types/mdast": "^4.0.0",
+        "@types/unist": "^3.0.0",
         "decode-named-character-reference": "^1.0.0",
-        "mdast-util-to-string": "^3.1.0",
-        "micromark": "^3.0.0",
-        "micromark-util-decode-numeric-character-reference": "^1.0.0",
-        "micromark-util-decode-string": "^1.0.0",
-        "micromark-util-normalize-identifier": "^1.0.0",
-        "micromark-util-symbol": "^1.0.0",
-        "micromark-util-types": "^1.0.0",
-        "unist-util-stringify-position": "^3.0.0",
-        "uvu": "^0.5.0"
+        "devlop": "^1.0.0",
+        "mdast-util-to-string": "^4.0.0",
+        "micromark": "^4.0.0",
+        "micromark-util-decode-numeric-character-reference": "^2.0.0",
+        "micromark-util-decode-string": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "unist-util-stringify-position": "^4.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -619,17 +784,17 @@
       }
     },
     "node_modules/mdast-util-gfm": {
-      "version": "2.0.2",
-      "resolved": "https://registry.npmjs.org/mdast-util-gfm/-/mdast-util-gfm-2.0.2.tgz",
-      "integrity": "sha512-qvZ608nBppZ4icQlhQQIAdc6S3Ffj9RGmzwUKUWuEICFnd1LVkN3EktF7ZHAgfcEdvZB5owU9tQgt99e2TlLjg==",
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-gfm/-/mdast-util-gfm-3.0.0.tgz",
+      "integrity": "sha512-dgQEX5Amaq+DuUqf26jJqSK9qgixgd6rYDHAv4aTBuA92cTknZlKpPfa86Z/s8Dj8xsAQpFfBmPUHWJBWqS4Bw==",
       "dependencies": {
-        "mdast-util-from-markdown": "^1.0.0",
-        "mdast-util-gfm-autolink-literal": "^1.0.0",
-        "mdast-util-gfm-footnote": "^1.0.0",
-        "mdast-util-gfm-strikethrough": "^1.0.0",
-        "mdast-util-gfm-table": "^1.0.0",
-        "mdast-util-gfm-task-list-item": "^1.0.0",
-        "mdast-util-to-markdown": "^1.0.0"
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-gfm-autolink-literal": "^2.0.0",
+        "mdast-util-gfm-footnote": "^2.0.0",
+        "mdast-util-gfm-strikethrough": "^2.0.0",
+        "mdast-util-gfm-table": "^2.0.0",
+        "mdast-util-gfm-task-list-item": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -637,14 +802,15 @@
       }
     },
     "node_modules/mdast-util-gfm-autolink-literal": {
-      "version": "1.0.3",
-      "resolved": "https://registry.npmjs.org/mdast-util-gfm-autolink-literal/-/mdast-util-gfm-autolink-literal-1.0.3.tgz",
-      "integrity": "sha512-My8KJ57FYEy2W2LyNom4n3E7hKTuQk/0SES0u16tjA9Z3oFkF4RrC/hPAPgjlSpezsOvI8ObcXcElo92wn5IGA==",
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-gfm-autolink-literal/-/mdast-util-gfm-autolink-literal-2.0.0.tgz",
+      "integrity": "sha512-FyzMsduZZHSc3i0Px3PQcBT4WJY/X/RCtEJKuybiC6sjPqLv7h1yqAkmILZtuxMSsUyaLUWNp71+vQH2zqp5cg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
+        "@types/mdast": "^4.0.0",
         "ccount": "^2.0.0",
-        "mdast-util-find-and-replace": "^2.0.0",
-        "micromark-util-character": "^1.0.0"
+        "devlop": "^1.0.0",
+        "mdast-util-find-and-replace": "^3.0.0",
+        "micromark-util-character": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -652,13 +818,15 @@
       }
     },
     "node_modules/mdast-util-gfm-footnote": {
-      "version": "1.0.2",
-      "resolved": "https://registry.npmjs.org/mdast-util-gfm-footnote/-/mdast-util-gfm-footnote-1.0.2.tgz",
-      "integrity": "sha512-56D19KOGbE00uKVj3sgIykpwKL179QsVFwx/DCW0u/0+URsryacI4MAdNJl0dh+u2PSsD9FtxPFbHCzJ78qJFQ==",
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-gfm-footnote/-/mdast-util-gfm-footnote-2.0.0.tgz",
+      "integrity": "sha512-5jOT2boTSVkMnQ7LTrd6n/18kqwjmuYqo7JUPe+tRCY6O7dAuTFMtTPauYYrMPpox9hlN0uOx/FL8XvEfG9/mQ==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "mdast-util-to-markdown": "^1.3.0",
-        "micromark-util-normalize-identifier": "^1.0.0"
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.1.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -666,12 +834,13 @@
       }
     },
     "node_modules/mdast-util-gfm-strikethrough": {
-      "version": "1.0.3",
-      "resolved": "https://registry.npmjs.org/mdast-util-gfm-strikethrough/-/mdast-util-gfm-strikethrough-1.0.3.tgz",
-      "integrity": "sha512-DAPhYzTYrRcXdMjUtUjKvW9z/FNAMTdU0ORyMcbmkwYNbKocDpdk+PX1L1dQgOID/+vVs1uBQ7ElrBQfZ0cuiQ==",
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-gfm-strikethrough/-/mdast-util-gfm-strikethrough-2.0.0.tgz",
+      "integrity": "sha512-mKKb915TF+OC5ptj5bJ7WFRPdYtuHv0yTRxK2tJvi+BDqbkiG7h7u/9SI89nRAYcmap2xHQL9D+QG/6wSrTtXg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "mdast-util-to-markdown": "^1.3.0"
+        "@types/mdast": "^4.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -679,14 +848,15 @@
       }
     },
     "node_modules/mdast-util-gfm-table": {
-      "version": "1.0.7",
-      "resolved": "https://registry.npmjs.org/mdast-util-gfm-table/-/mdast-util-gfm-table-1.0.7.tgz",
-      "integrity": "sha512-jjcpmNnQvrmN5Vx7y7lEc2iIOEytYv7rTvu+MeyAsSHTASGCCRA79Igg2uKssgOs1i1po8s3plW0sTu1wkkLGg==",
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-gfm-table/-/mdast-util-gfm-table-2.0.0.tgz",
+      "integrity": "sha512-78UEvebzz/rJIxLvE7ZtDd/vIQ0RHv+3Mh5DR96p7cS7HsBhYIICDBCu8csTNWNO6tBWfqXPWekRuj2FNOGOZg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.0.0",
         "markdown-table": "^3.0.0",
-        "mdast-util-from-markdown": "^1.0.0",
-        "mdast-util-to-markdown": "^1.3.0"
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -694,12 +864,14 @@
       }
     },
     "node_modules/mdast-util-gfm-task-list-item": {
-      "version": "1.0.2",
-      "resolved": "https://registry.npmjs.org/mdast-util-gfm-task-list-item/-/mdast-util-gfm-task-list-item-1.0.2.tgz",
-      "integrity": "sha512-PFTA1gzfp1B1UaiJVyhJZA1rm0+Tzn690frc/L8vNX1Jop4STZgOE6bxUhnzdVSB+vm2GU1tIsuQcA9bxTQpMQ==",
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-gfm-task-list-item/-/mdast-util-gfm-task-list-item-2.0.0.tgz",
+      "integrity": "sha512-IrtvNvjxC1o06taBAVJznEnkiHxLFTzgonUdy8hzFVeDun0uTjxxrRGVaNFqkU1wJR3RBPEfsxmU6jDWPofrTQ==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "mdast-util-to-markdown": "^1.3.0"
+        "@types/mdast": "^4.0.0",
+        "devlop": "^1.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "mdast-util-to-markdown": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -718,6 +890,19 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/mdast-util-heading-style/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/mdast-util-heading-style/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/mdast-util-mdx-expression": {
       "version": "1.3.2",
       "resolved": "https://registry.npmjs.org/mdast-util-mdx-expression/-/mdast-util-mdx-expression-1.3.2.tgz",
@@ -734,7 +919,43 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/mdast-util-phrasing": {
+    "node_modules/mdast-util-mdx-expression/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/mdast-util-mdx-expression/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/mdast-util-mdx-expression/node_modules/mdast-util-from-markdown": {
+      "version": "1.3.1",
+      "resolved": "https://registry.npmjs.org/mdast-util-from-markdown/-/mdast-util-from-markdown-1.3.1.tgz",
+      "integrity": "sha512-4xTO/M8c82qBcnQc1tgpNtubGUW/Y1tBQ1B0i5CtSoelOLKFYlElIr3bvgREYYO5iRqbMY1YuqZng0GVOI8Qww==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "@types/unist": "^2.0.0",
+        "decode-named-character-reference": "^1.0.0",
+        "mdast-util-to-string": "^3.1.0",
+        "micromark": "^3.0.0",
+        "micromark-util-decode-numeric-character-reference": "^1.0.0",
+        "micromark-util-decode-string": "^1.0.0",
+        "micromark-util-normalize-identifier": "^1.0.0",
+        "micromark-util-symbol": "^1.0.0",
+        "micromark-util-types": "^1.0.0",
+        "unist-util-stringify-position": "^3.0.0",
+        "uvu": "^0.5.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/mdast-util-mdx-expression/node_modules/mdast-util-phrasing": {
       "version": "3.0.1",
       "resolved": "https://registry.npmjs.org/mdast-util-phrasing/-/mdast-util-phrasing-3.0.1.tgz",
       "integrity": "sha512-WmI1gTXUBJo4/ZmSk79Wcb2HcjPJBzM1nlI/OUWA8yk2X9ik3ffNbBGsU+09BFmXaL1IBb9fiuvq6/KMiNycSg==",
@@ -747,7 +968,7 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/mdast-util-to-markdown": {
+    "node_modules/mdast-util-mdx-expression/node_modules/mdast-util-to-markdown": {
       "version": "1.5.0",
       "resolved": "https://registry.npmjs.org/mdast-util-to-markdown/-/mdast-util-to-markdown-1.5.0.tgz",
       "integrity": "sha512-bbv7TPv/WC49thZPg3jXuqzuvI45IL2EVAr/KxF0BSdHsU0ceFHOmwQn6evxAh1GaoK/6GQ1wp4R4oW2+LFL/A==",
@@ -766,7 +987,7 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/mdast-util-to-string": {
+    "node_modules/mdast-util-mdx-expression/node_modules/mdast-util-to-string": {
       "version": "3.2.0",
       "resolved": "https://registry.npmjs.org/mdast-util-to-string/-/mdast-util-to-string-3.2.0.tgz",
       "integrity": "sha512-V4Zn/ncyN1QNSqSBxTrMOLpjr+IKdHl2v3KVLoWmDPscP4r9GcCi71gjgvUV1SFSKh92AjAG4peFuBl2/YgCJg==",
@@ -778,7 +999,7 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/micromark": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark": {
       "version": "3.2.0",
       "resolved": "https://registry.npmjs.org/micromark/-/micromark-3.2.0.tgz",
       "integrity": "sha512-uD66tJj54JLYq0De10AhWycZWGQNUvDI55xPgk2sQM5kn1JYlhbCMTtEeT27+vAhW2FBQxLlOmS3pmA7/2z4aA==",
@@ -812,7 +1033,7 @@
         "uvu": "^0.5.0"
       }
     },
-    "node_modules/micromark-core-commonmark": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-core-commonmark": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-core-commonmark/-/micromark-core-commonmark-1.1.0.tgz",
       "integrity": "sha512-BgHO1aRbolh2hcrzL2d1La37V0Aoz73ymF8rAcKnohLy93titmv62E0gP8Hrx9PKcKrqCZ1BbLGbP3bEhoXYlw==",
@@ -845,162 +1066,48 @@
         "uvu": "^0.5.0"
       }
     },
-    "node_modules/micromark-extension-gfm": {
-      "version": "2.0.3",
-      "resolved": "https://registry.npmjs.org/micromark-extension-gfm/-/micromark-extension-gfm-2.0.3.tgz",
-      "integrity": "sha512-vb9OoHqrhCmbRidQv/2+Bc6pkP0FrtlhurxZofvOEy5o8RtuuvTq+RQ1Vw5ZDNrVraQZu3HixESqbG+0iKk/MQ==",
-      "dependencies": {
-        "micromark-extension-gfm-autolink-literal": "^1.0.0",
-        "micromark-extension-gfm-footnote": "^1.0.0",
-        "micromark-extension-gfm-strikethrough": "^1.0.0",
-        "micromark-extension-gfm-table": "^1.0.0",
-        "micromark-extension-gfm-tagfilter": "^1.0.0",
-        "micromark-extension-gfm-task-list-item": "^1.0.0",
-        "micromark-util-combine-extensions": "^1.0.0",
-        "micromark-util-types": "^1.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
-    "node_modules/micromark-extension-gfm-autolink-literal": {
-      "version": "1.0.5",
-      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-autolink-literal/-/micromark-extension-gfm-autolink-literal-1.0.5.tgz",
-      "integrity": "sha512-z3wJSLrDf8kRDOh2qBtoTRD53vJ+CWIyo7uyZuxf/JAbNJjiHsOpG1y5wxk8drtv3ETAHutCu6N3thkOOgueWg==",
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-factory-destination": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/micromark-factory-destination/-/micromark-factory-destination-1.1.0.tgz",
+      "integrity": "sha512-XaNDROBgx9SgSChd69pjiGKbV+nfHGDPVYFs5dOoDd7ZnMAE+Cuu91BCpsY8RT2NP9vo/B8pds2VQNCLiu0zhg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
       "dependencies": {
         "micromark-util-character": "^1.0.0",
-        "micromark-util-sanitize-uri": "^1.0.0",
         "micromark-util-symbol": "^1.0.0",
         "micromark-util-types": "^1.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/micromark-extension-gfm-footnote": {
-      "version": "1.1.2",
-      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-footnote/-/micromark-extension-gfm-footnote-1.1.2.tgz",
-      "integrity": "sha512-Yxn7z7SxgyGWRNa4wzf8AhYYWNrwl5q1Z8ii+CSTTIqVkmGZF1CElX2JI8g5yGoM3GAman9/PVCUFUSJ0kB/8Q==",
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-factory-label": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/micromark-factory-label/-/micromark-factory-label-1.1.0.tgz",
+      "integrity": "sha512-OLtyez4vZo/1NjxGhcpDSbHQ+m0IIGnT8BoPamh+7jVlzLJBH98zzuCoUeMxvM6WsNeh8wx8cKvqLiPHEACn0w==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
       "dependencies": {
-        "micromark-core-commonmark": "^1.0.0",
-        "micromark-factory-space": "^1.0.0",
         "micromark-util-character": "^1.0.0",
-        "micromark-util-normalize-identifier": "^1.0.0",
-        "micromark-util-sanitize-uri": "^1.0.0",
         "micromark-util-symbol": "^1.0.0",
         "micromark-util-types": "^1.0.0",
         "uvu": "^0.5.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/micromark-extension-gfm-strikethrough": {
-      "version": "1.0.7",
-      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-strikethrough/-/micromark-extension-gfm-strikethrough-1.0.7.tgz",
-      "integrity": "sha512-sX0FawVE1o3abGk3vRjOH50L5TTLr3b5XMqnP9YDRb34M0v5OoZhG+OHFz1OffZ9dlwgpTBKaT4XW/AsUVnSDw==",
-      "dependencies": {
-        "micromark-util-chunked": "^1.0.0",
-        "micromark-util-classify-character": "^1.0.0",
-        "micromark-util-resolve-all": "^1.0.0",
-        "micromark-util-symbol": "^1.0.0",
-        "micromark-util-types": "^1.0.0",
-        "uvu": "^0.5.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
-    "node_modules/micromark-extension-gfm-table": {
-      "version": "1.0.7",
-      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-table/-/micromark-extension-gfm-table-1.0.7.tgz",
-      "integrity": "sha512-3ZORTHtcSnMQEKtAOsBQ9/oHp9096pI/UvdPtN7ehKvrmZZ2+bbWhi0ln+I9drmwXMt5boocn6OlwQzNXeVeqw==",
-      "dependencies": {
-        "micromark-factory-space": "^1.0.0",
-        "micromark-util-character": "^1.0.0",
-        "micromark-util-symbol": "^1.0.0",
-        "micromark-util-types": "^1.0.0",
-        "uvu": "^0.5.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
-    "node_modules/micromark-extension-gfm-tagfilter": {
-      "version": "1.0.2",
-      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-tagfilter/-/micromark-extension-gfm-tagfilter-1.0.2.tgz",
-      "integrity": "sha512-5XWB9GbAUSHTn8VPU8/1DBXMuKYT5uOgEjJb8gN3mW0PNW5OPHpSdojoqf+iq1xo7vWzw/P8bAHY0n6ijpXF7g==",
-      "dependencies": {
-        "micromark-util-types": "^1.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
-    "node_modules/micromark-extension-gfm-task-list-item": {
-      "version": "1.0.5",
-      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-task-list-item/-/micromark-extension-gfm-task-list-item-1.0.5.tgz",
-      "integrity": "sha512-RMFXl2uQ0pNQy6Lun2YBYT9g9INXtWJULgbt01D/x8/6yJ2qpKyzdZD3pi6UIkzF++Da49xAelVKUeUMqd5eIQ==",
-      "dependencies": {
-        "micromark-factory-space": "^1.0.0",
-        "micromark-util-character": "^1.0.0",
-        "micromark-util-symbol": "^1.0.0",
-        "micromark-util-types": "^1.0.0",
-        "uvu": "^0.5.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
-    "node_modules/micromark-factory-destination": {
-      "version": "1.1.0",
-      "resolved": "https://registry.npmjs.org/micromark-factory-destination/-/micromark-factory-destination-1.1.0.tgz",
-      "integrity": "sha512-XaNDROBgx9SgSChd69pjiGKbV+nfHGDPVYFs5dOoDd7ZnMAE+Cuu91BCpsY8RT2NP9vo/B8pds2VQNCLiu0zhg==",
-      "funding": [
-        {
-          "type": "GitHub Sponsors",
-          "url": "https://github.com/sponsors/unifiedjs"
-        },
-        {
-          "type": "OpenCollective",
-          "url": "https://opencollective.com/unified"
-        }
-      ],
-      "dependencies": {
-        "micromark-util-character": "^1.0.0",
-        "micromark-util-symbol": "^1.0.0",
-        "micromark-util-types": "^1.0.0"
-      }
-    },
-    "node_modules/micromark-factory-label": {
-      "version": "1.1.0",
-      "resolved": "https://registry.npmjs.org/micromark-factory-label/-/micromark-factory-label-1.1.0.tgz",
-      "integrity": "sha512-OLtyez4vZo/1NjxGhcpDSbHQ+m0IIGnT8BoPamh+7jVlzLJBH98zzuCoUeMxvM6WsNeh8wx8cKvqLiPHEACn0w==",
-      "funding": [
-        {
-          "type": "GitHub Sponsors",
-          "url": "https://github.com/sponsors/unifiedjs"
-        },
-        {
-          "type": "OpenCollective",
-          "url": "https://opencollective.com/unified"
-        }
-      ],
-      "dependencies": {
-        "micromark-util-character": "^1.0.0",
-        "micromark-util-symbol": "^1.0.0",
-        "micromark-util-types": "^1.0.0",
-        "uvu": "^0.5.0"
-      }
-    },
-    "node_modules/micromark-factory-space": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-factory-space": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-factory-space/-/micromark-factory-space-1.1.0.tgz",
       "integrity": "sha512-cRzEj7c0OL4Mw2v6nwzttyOZe8XY/Z8G0rzmWQZTBi/jjwyw/U4uqKtUORXQrR5bAZZnbTI/feRV/R7hc4jQYQ==",
@@ -1019,7 +1126,7 @@
         "micromark-util-types": "^1.0.0"
       }
     },
-    "node_modules/micromark-factory-title": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-factory-title": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-factory-title/-/micromark-factory-title-1.1.0.tgz",
       "integrity": "sha512-J7n9R3vMmgjDOCY8NPw55jiyaQnH5kBdV2/UXCtZIpnHH3P6nHUKaH7XXEYuWwx/xUJcawa8plLBEjMPU24HzQ==",
@@ -1040,7 +1147,7 @@
         "micromark-util-types": "^1.0.0"
       }
     },
-    "node_modules/micromark-factory-whitespace": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-factory-whitespace": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-factory-whitespace/-/micromark-factory-whitespace-1.1.0.tgz",
       "integrity": "sha512-v2WlmiymVSp5oMg+1Q0N1Lxmt6pMhIHD457whWM7/GUlEks1hI9xj5w3zbc4uuMKXGisksZk8DzP2UyGbGqNsQ==",
@@ -1061,7 +1168,7 @@
         "micromark-util-types": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-character": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-character": {
       "version": "1.2.0",
       "resolved": "https://registry.npmjs.org/micromark-util-character/-/micromark-util-character-1.2.0.tgz",
       "integrity": "sha512-lXraTwcX3yH/vMDaFWCQJP1uIszLVebzUa3ZHdrgxr7KEU/9mL4mVgCpGbyhvNLNlauROiNUq7WN5u7ndbY6xg==",
@@ -1080,7 +1187,7 @@
         "micromark-util-types": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-chunked": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-chunked": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-chunked/-/micromark-util-chunked-1.1.0.tgz",
       "integrity": "sha512-Ye01HXpkZPNcV6FiyoW2fGZDUw4Yc7vT0E9Sad83+bEDiCJ1uXu0S3mr8WLpsz3HaG3x2q0HM6CTuPdcZcluFQ==",
@@ -1098,7 +1205,7 @@
         "micromark-util-symbol": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-classify-character": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-classify-character": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-classify-character/-/micromark-util-classify-character-1.1.0.tgz",
       "integrity": "sha512-SL0wLxtKSnklKSUplok1WQFoGhUdWYKggKUiqhX+Swala+BtptGCu5iPRc+xvzJ4PXE/hwM3FNXsfEVgoZsWbw==",
@@ -1118,7 +1225,7 @@
         "micromark-util-types": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-combine-extensions": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-combine-extensions": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-combine-extensions/-/micromark-util-combine-extensions-1.1.0.tgz",
       "integrity": "sha512-Q20sp4mfNf9yEqDL50WwuWZHUrCO4fEyeDCnMGmG5Pr0Cz15Uo7KBs6jq+dq0EgX4DPwwrh9m0X+zPV1ypFvUA==",
@@ -1137,7 +1244,7 @@
         "micromark-util-types": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-decode-numeric-character-reference": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-decode-numeric-character-reference": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-decode-numeric-character-reference/-/micromark-util-decode-numeric-character-reference-1.1.0.tgz",
       "integrity": "sha512-m9V0ExGv0jB1OT21mrWcuf4QhP46pH1KkfWy9ZEezqHKAxkj4mPCy3nIH1rkbdMlChLHX531eOrymlwyZIf2iw==",
@@ -1155,7 +1262,7 @@
         "micromark-util-symbol": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-decode-string": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-decode-string": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-decode-string/-/micromark-util-decode-string-1.1.0.tgz",
       "integrity": "sha512-YphLGCK8gM1tG1bd54azwyrQRjCFcmgj2S2GoJDNnh4vYtnL38JS8M4gpxzOPNyHdNEpheyWXCTnnTDY3N+NVQ==",
@@ -1176,7 +1283,7 @@
         "micromark-util-symbol": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-encode": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-encode": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-encode/-/micromark-util-encode-1.1.0.tgz",
       "integrity": "sha512-EuEzTWSTAj9PA5GOAs992GzNh2dGQO52UvAbtSOMvXTxv3Criqb6IOzJUBCmEqrrXSblJIJBbFFv6zPxpreiJw==",
@@ -1191,7 +1298,7 @@
         }
       ]
     },
-    "node_modules/micromark-util-html-tag-name": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-html-tag-name": {
       "version": "1.2.0",
       "resolved": "https://registry.npmjs.org/micromark-util-html-tag-name/-/micromark-util-html-tag-name-1.2.0.tgz",
       "integrity": "sha512-VTQzcuQgFUD7yYztuQFKXT49KghjtETQ+Wv/zUjGSGBioZnkA4P1XXZPT1FHeJA6RwRXSF47yvJ1tsJdoxwO+Q==",
@@ -1206,7 +1313,7 @@
         }
       ]
     },
-    "node_modules/micromark-util-normalize-identifier": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-normalize-identifier": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-normalize-identifier/-/micromark-util-normalize-identifier-1.1.0.tgz",
       "integrity": "sha512-N+w5vhqrBihhjdpM8+5Xsxy71QWqGn7HYNUvch71iV2PM7+E3uWGox1Qp90loa1ephtCxG2ftRV/Conitc6P2Q==",
@@ -1224,7 +1331,7 @@
         "micromark-util-symbol": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-resolve-all": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-resolve-all": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-resolve-all/-/micromark-util-resolve-all-1.1.0.tgz",
       "integrity": "sha512-b/G6BTMSg+bX+xVCshPTPyAu2tmA0E4X98NSR7eIbeC6ycCqCeE7wjfDIgzEbkzdEVJXRtOG4FbEm/uGbCRouA==",
@@ -1242,7 +1349,7 @@
         "micromark-util-types": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-sanitize-uri": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-sanitize-uri": {
       "version": "1.2.0",
       "resolved": "https://registry.npmjs.org/micromark-util-sanitize-uri/-/micromark-util-sanitize-uri-1.2.0.tgz",
       "integrity": "sha512-QO4GXv0XZfWey4pYFndLUKEAktKkG5kZTdUNaTAkzbuJxn2tNBOr+QtxR2XpWaMhbImT2dPzyLrPXLlPhph34A==",
@@ -1262,7 +1369,7 @@
         "micromark-util-symbol": "^1.0.0"
       }
     },
-    "node_modules/micromark-util-subtokenize": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-subtokenize": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-subtokenize/-/micromark-util-subtokenize-1.1.0.tgz",
       "integrity": "sha512-kUQHyzRoxvZO2PuLzMt2P/dwVsTiivCK8icYTeR+3WgbuPqfHgPPy7nFKbeqRivBvn/3N3GBiNC+JRTMSxEC7A==",
@@ -1283,7 +1390,7 @@
         "uvu": "^0.5.0"
       }
     },
-    "node_modules/micromark-util-symbol": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-symbol": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-symbol/-/micromark-util-symbol-1.1.0.tgz",
       "integrity": "sha512-uEjpEYY6KMs1g7QfJ2eX1SQEV+ZT4rUD3UcF6l57acZvLNK7PBZL+ty82Z1qhK1/yXIY4bdx04FKMgR0g4IAag==",
@@ -1298,7 +1405,7 @@
         }
       ]
     },
-    "node_modules/micromark-util-types": {
+    "node_modules/mdast-util-mdx-expression/node_modules/micromark-util-types": {
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/micromark-util-types/-/micromark-util-types-1.1.0.tgz",
       "integrity": "sha512-ukRBgie8TIAcacscVHSiddHjO4k/q3pnedmzMQ4iwDcK0FtFCohKOlFbaOL/mPgfnPsL3C1ZyxJa4sbWrBl3jg==",
@@ -1313,186 +1420,904 @@
         }
       ]
     },
-    "node_modules/minimatch": {
-      "version": "5.1.6",
-      "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-5.1.6.tgz",
-      "integrity": "sha512-lKwV/1brpG6mBUFHtb7NUmtABCb2WZZmm2wNiOA5hAb8VdCS4B3dtMWyvcoViccwAW/COERjXLt0zP1zXUN26g==",
-      "dev": true,
-      "dependencies": {
-        "brace-expansion": "^2.0.1"
-      },
-      "engines": {
-        "node": ">=10"
-      }
-    },
-    "node_modules/mri": {
-      "version": "1.2.0",
-      "resolved": "https://registry.npmjs.org/mri/-/mri-1.2.0.tgz",
-      "integrity": "sha512-tzzskb3bG8LvYGFF/mDTpq3jpI6Q9wc3LEmBaghu+DdCssd1FakN7Bc0hVNmEyGq1bq3RgfkCb3cmQLpNPOroA==",
-      "engines": {
-        "node": ">=4"
-      }
-    },
-    "node_modules/ms": {
-      "version": "2.1.2",
-      "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.2.tgz",
-      "integrity": "sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w=="
-    },
-    "node_modules/once": {
-      "version": "1.4.0",
-      "resolved": "https://registry.npmjs.org/once/-/once-1.4.0.tgz",
-      "integrity": "sha512-lNaJgI+2Q5URQBkccEKHTQOPaXdUxnZZElQTZY0MFUAuaEqe1E+Nyvgdz/aIyNi6Z9MzO5dv1H8n58/GELp3+w==",
-      "dev": true,
-      "dependencies": {
-        "wrappy": "1"
-      }
-    },
-    "node_modules/path-parse": {
-      "version": "1.0.7",
-      "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.7.tgz",
-      "integrity": "sha512-LDJzPVEEEPR+y48z93A0Ed0yXb8pAByGWo/k5YYdYgpY2/2EsOsksJrq7lOHxryrVOn1ejG6oAp8ahvOIQD8sw==",
-      "dev": true
-    },
-    "node_modules/perf-regexes": {
-      "version": "1.0.1",
-      "resolved": "https://registry.npmjs.org/perf-regexes/-/perf-regexes-1.0.1.tgz",
-      "integrity": "sha512-L7MXxUDtqr4PUaLFCDCXBfGV/6KLIuSEccizDI7JxT+c9x1G1v04BQ4+4oag84SHaCdrBgQAIs/Cqn+flwFPng==",
-      "dev": true,
-      "engines": {
-        "node": ">=6.14"
-      }
-    },
-    "node_modules/picomatch": {
-      "version": "2.3.1",
-      "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-2.3.1.tgz",
-      "integrity": "sha512-JU3teHTNjmE2VCGFzuY8EXzCDVwEqB2a8fsIvwaStHhAWJEeVd1o1QD80CU6+ZdEXXSLbSsuLwJjkCBWqRQUVA==",
-      "dev": true,
-      "engines": {
-        "node": ">=8.6"
-      },
-      "funding": {
-        "url": "https://github.com/sponsors/jonschlinkert"
-      }
-    },
-    "node_modules/pluralize": {
-      "version": "8.0.0",
-      "resolved": "https://registry.npmjs.org/pluralize/-/pluralize-8.0.0.tgz",
-      "integrity": "sha512-Nc3IT5yHzflTfbjgqWcCPpo7DaKy4FnpB0l/zCAW0Tc7jxAiuqSxHasntB3D7887LSrA93kDJ9IXovxJYxyLCA==",
-      "engines": {
-        "node": ">=4"
-      }
-    },
-    "node_modules/remark-gfm": {
-      "version": "3.0.1",
-      "resolved": "https://registry.npmjs.org/remark-gfm/-/remark-gfm-3.0.1.tgz",
-      "integrity": "sha512-lEFDoi2PICJyNrACFOfDD3JlLkuSbOa5Wd8EPt06HUdptv8Gn0bxYTdbU/XXQ3swAPkEaGxxPN9cbnMHvVu1Ig==",
+    "node_modules/mdast-util-mdx-expression/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "mdast-util-gfm": "^2.0.0",
-        "micromark-extension-gfm": "^2.0.0",
-        "unified": "^10.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-gfm/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/mdast-util-mdx-expression/node_modules/unist-util-stringify-position": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-3.0.3.tgz",
+      "integrity": "sha512-k5GzIBZ/QatR8N5X2y+drfpWG8IDBzdnVj6OInRNWm1oXrzydiaAT2OQiA8DPRRZyAKb9b6I2a6PxYklZD0gKg==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint": {
-      "version": "9.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint/-/remark-lint-9.1.2.tgz",
-      "integrity": "sha512-m9e/aPlh7tsvfJfj8tPxrQzD6oEdb9Foko+Ya/6OwUP9EoGMfehv1Qtv26W1DoH58Wn8rT8CD+KuprTWscMmIA==",
+    "node_modules/mdast-util-mdx-expression/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "remark-message-control": "^7.0.0",
-        "unified": "^10.1.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-blockquote-indentation": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-blockquote-indentation/-/remark-lint-blockquote-indentation-3.1.2.tgz",
-      "integrity": "sha512-5DOrFsZd5dXqA4p/VZvWSrqIWNFbBXjX7IV/FkVkxlNhNF/0FMf/4v8x1I2W3mzaZ7yDsWS/egpZnmligq1ckQ==",
+    "node_modules/mdast-util-mdx-expression/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "pluralize": "^8.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-blockquote-indentation/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/mdast-util-phrasing": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-phrasing/-/mdast-util-phrasing-4.0.0.tgz",
+      "integrity": "sha512-xadSsJayQIucJ9n053dfQwVu1kuXg7jCTdYsMK8rqzKZh52nLfSH/k0sAxE0u+pj/zKZX+o5wB+ML5mRayOxFA==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "@types/mdast": "^4.0.0",
+        "unist-util-is": "^6.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-checkbox-character-style": {
-      "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-checkbox-character-style/-/remark-lint-checkbox-character-style-4.1.2.tgz",
-      "integrity": "sha512-5ITz+1cCuJ3Jv/Q7rKgDEucCOnIgjWDnSHPJA1tb4TI/D316h+ALbDhZIpP8gyfAm6sBAh3Pwz9XZJN2uJB5UQ==",
+    "node_modules/mdast-util-to-markdown": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-to-markdown/-/mdast-util-to-markdown-2.1.0.tgz",
+      "integrity": "sha512-SR2VnIEdVNCJbP6y7kVTJgPLifdr8WEU440fQec7qHoHOUz/oJ2jmNRqdDQ3rbiStOXb2mCDGTuwsK5OPUgYlQ==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/mdast": "^4.0.0",
+        "@types/unist": "^3.0.0",
+        "longest-streak": "^3.0.0",
+        "mdast-util-phrasing": "^4.0.0",
+        "mdast-util-to-string": "^4.0.0",
+        "micromark-util-decode-string": "^2.0.0",
+        "unist-util-visit": "^5.0.0",
+        "zwitch": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-checkbox-character-style/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/mdast-util-to-string": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-to-string/-/mdast-util-to-string-4.0.0.tgz",
+      "integrity": "sha512-0H44vDimn51F0YwvxSJSm0eCDOJTRlmN0R1yBh4HLj9wiV1Dn0QoXGbvFAWj2hSItVTlCmBF1hqKlIyUBVFLPg==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "@types/mdast": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/micromark/-/micromark-4.0.0.tgz",
+      "integrity": "sha512-o/sd0nMof8kYff+TqcDx3VSrgBTcZpSvYcAHIfHhv5VAuNmisCxjhx6YmxS8PFEpb9z5WKWKPdzf0jM23ro3RQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "@types/debug": "^4.0.0",
+        "debug": "^4.0.0",
+        "decode-named-character-reference": "^1.0.0",
+        "devlop": "^1.0.0",
+        "micromark-core-commonmark": "^2.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-combine-extensions": "^2.0.0",
+        "micromark-util-decode-numeric-character-reference": "^2.0.0",
+        "micromark-util-encode": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0",
+        "micromark-util-resolve-all": "^2.0.0",
+        "micromark-util-sanitize-uri": "^2.0.0",
+        "micromark-util-subtokenize": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-core-commonmark": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-core-commonmark/-/micromark-core-commonmark-2.0.0.tgz",
+      "integrity": "sha512-jThOz/pVmAYUtkroV3D5c1osFXAMv9e0ypGDOIZuCeAe91/sD6BoE2Sjzt30yuXtwOYUmySOhMas/PVyh02itA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "decode-named-character-reference": "^1.0.0",
+        "devlop": "^1.0.0",
+        "micromark-factory-destination": "^2.0.0",
+        "micromark-factory-label": "^2.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-factory-title": "^2.0.0",
+        "micromark-factory-whitespace": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-classify-character": "^2.0.0",
+        "micromark-util-html-tag-name": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0",
+        "micromark-util-resolve-all": "^2.0.0",
+        "micromark-util-subtokenize": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-extension-gfm": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-extension-gfm/-/micromark-extension-gfm-3.0.0.tgz",
+      "integrity": "sha512-vsKArQsicm7t0z2GugkCKtZehqUm31oeGBV/KVSorWSy8ZlNAv7ytjFhvaryUiCUJYqs+NoE6AFhpQvBTM6Q4w==",
+      "dependencies": {
+        "micromark-extension-gfm-autolink-literal": "^2.0.0",
+        "micromark-extension-gfm-footnote": "^2.0.0",
+        "micromark-extension-gfm-strikethrough": "^2.0.0",
+        "micromark-extension-gfm-table": "^2.0.0",
+        "micromark-extension-gfm-tagfilter": "^2.0.0",
+        "micromark-extension-gfm-task-list-item": "^2.0.0",
+        "micromark-util-combine-extensions": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-autolink-literal": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-autolink-literal/-/micromark-extension-gfm-autolink-literal-2.0.0.tgz",
+      "integrity": "sha512-rTHfnpt/Q7dEAK1Y5ii0W8bhfJlVJFnJMHIPisfPK3gpVNuOP0VnRl96+YJ3RYWV/P4gFeQoGKNlT3RhuvpqAg==",
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-sanitize-uri": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-footnote": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-footnote/-/micromark-extension-gfm-footnote-2.0.0.tgz",
+      "integrity": "sha512-6Rzu0CYRKDv3BfLAUnZsSlzx3ak6HAoI85KTiijuKIz5UxZxbUI+pD6oHgw+6UtQuiRwnGRhzMmPRv4smcz0fg==",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-core-commonmark": "^2.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-normalize-identifier": "^2.0.0",
+        "micromark-util-sanitize-uri": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-strikethrough": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-strikethrough/-/micromark-extension-gfm-strikethrough-2.0.0.tgz",
+      "integrity": "sha512-c3BR1ClMp5fxxmwP6AoOY2fXO9U8uFMKs4ADD66ahLTNcwzSCyRVU4k7LPV5Nxo/VJiR4TdzxRQY2v3qIUceCw==",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-classify-character": "^2.0.0",
+        "micromark-util-resolve-all": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-table": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-table/-/micromark-extension-gfm-table-2.0.0.tgz",
+      "integrity": "sha512-PoHlhypg1ItIucOaHmKE8fbin3vTLpDOUg8KAr8gRCF1MOZI9Nquq2i/44wFvviM4WuxJzc3demT8Y3dkfvYrw==",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-tagfilter": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-tagfilter/-/micromark-extension-gfm-tagfilter-2.0.0.tgz",
+      "integrity": "sha512-xHlTOmuCSotIA8TW1mDIM6X2O1SiX5P9IuDtqGonFhEK0qgRI4yeC6vMxEV2dgyr2TiD+2PQ10o+cOhdVAcwfg==",
+      "dependencies": {
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-extension-gfm-task-list-item": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/micromark-extension-gfm-task-list-item/-/micromark-extension-gfm-task-list-item-2.0.1.tgz",
+      "integrity": "sha512-cY5PzGcnULaN5O7T+cOzfMoHjBW7j+T9D2sucA5d/KbsBTPcYdebm9zUd9zzdgJGCwahV+/W78Z3nbulBYVbTw==",
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/micromark-factory-destination": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-factory-destination/-/micromark-factory-destination-2.0.0.tgz",
+      "integrity": "sha512-j9DGrQLm/Uhl2tCzcbLhy5kXsgkHUrjJHg4fFAeoMRwJmJerT9aw4FEhIbZStWN8A3qMwOp1uzHr4UL8AInxtA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-label": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-factory-label/-/micromark-factory-label-2.0.0.tgz",
+      "integrity": "sha512-RR3i96ohZGde//4WSe/dJsxOX6vxIg9TimLAS3i4EhBAFx8Sm5SmqVfR8E87DPSR31nEAjZfbt91OMZWcNgdZw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-space": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-factory-space/-/micromark-factory-space-2.0.0.tgz",
+      "integrity": "sha512-TKr+LIDX2pkBJXFLzpyPyljzYK3MtmllMUMODTQJIUfDGncESaqB90db9IAUcz4AZAJFdd8U9zOp9ty1458rxg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-title": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-factory-title/-/micromark-factory-title-2.0.0.tgz",
+      "integrity": "sha512-jY8CSxmpWLOxS+t8W+FG3Xigc0RDQA9bKMY/EwILvsesiRniiVMejYTE4wumNc2f4UbAa4WsHqe3J1QS1sli+A==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-factory-whitespace": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-factory-whitespace/-/micromark-factory-whitespace-2.0.0.tgz",
+      "integrity": "sha512-28kbwaBjc5yAI1XadbdPYHX/eDnqaUFVikLwrO7FDnKG7lpgxnvk/XGRhX/PN0mOZ+dBSZ+LgunHS+6tYQAzhA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-factory-space": "^2.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-character": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/micromark-util-character/-/micromark-util-character-2.0.1.tgz",
+      "integrity": "sha512-3wgnrmEAJ4T+mGXAUfMvMAbxU9RDG43XmGce4j6CwPtVxB3vfwXSZ6KhFwDzZ3mZHhmPimMAXg71veiBGzeAZw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-chunked": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-chunked/-/micromark-util-chunked-2.0.0.tgz",
+      "integrity": "sha512-anK8SWmNphkXdaKgz5hJvGa7l00qmcaUQoMYsBwDlSKFKjc6gjGXPDw3FNL3Nbwq5L8gE+RCbGqTw49FK5Qyvg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-classify-character": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-classify-character/-/micromark-util-classify-character-2.0.0.tgz",
+      "integrity": "sha512-S0ze2R9GH+fu41FA7pbSqNWObo/kzwf8rN/+IGlW/4tC6oACOs8B++bh+i9bVyNnwCcuksbFwsBme5OCKXCwIw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-combine-extensions": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-combine-extensions/-/micromark-util-combine-extensions-2.0.0.tgz",
+      "integrity": "sha512-vZZio48k7ON0fVS3CUgFatWHoKbbLTK/rT7pzpJ4Bjp5JjkZeasRfrS9wsBdDJK2cJLHMckXZdzPSSr1B8a4oQ==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-decode-numeric-character-reference": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-decode-numeric-character-reference/-/micromark-util-decode-numeric-character-reference-2.0.0.tgz",
+      "integrity": "sha512-pIgcsGxpHEtTG/rPJRz/HOLSqp5VTuIIjXlPI+6JSDlK2oljApusG6KzpS8AF0ENUMCHlC/IBb5B9xdFiVlm5Q==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-decode-string": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-decode-string/-/micromark-util-decode-string-2.0.0.tgz",
+      "integrity": "sha512-r4Sc6leeUTn3P6gk20aFMj2ntPwn6qpDZqWvYmAG6NgvFTIlj4WtrAudLi65qYoaGdXYViXYw2pkmn7QnIFasA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "decode-named-character-reference": "^1.0.0",
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-decode-numeric-character-reference": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-encode": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-encode/-/micromark-util-encode-2.0.0.tgz",
+      "integrity": "sha512-pS+ROfCXAGLWCOc8egcBvT0kf27GoWMqtdarNfDcjb6YLuV5cM3ioG45Ys2qOVqeqSbjaKg72vU+Wby3eddPsA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ]
+    },
+    "node_modules/micromark-util-html-tag-name": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-html-tag-name/-/micromark-util-html-tag-name-2.0.0.tgz",
+      "integrity": "sha512-xNn4Pqkj2puRhKdKTm8t1YHC/BAjx6CEwRFXntTaRf/x16aqka6ouVoutm+QdkISTlT7e2zU7U4ZdlDLJd2Mcw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ]
+    },
+    "node_modules/micromark-util-normalize-identifier": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-normalize-identifier/-/micromark-util-normalize-identifier-2.0.0.tgz",
+      "integrity": "sha512-2xhYT0sfo85FMrUPtHcPo2rrp1lwbDEEzpx7jiH2xXJLqBuy4H0GgXk5ToU8IEwoROtXuL8ND0ttVa4rNqYK3w==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-resolve-all": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-resolve-all/-/micromark-util-resolve-all-2.0.0.tgz",
+      "integrity": "sha512-6KU6qO7DZ7GJkaCgwBNtplXCvGkJToU86ybBAUdavvgsCiG8lSSvYxr9MhwmQ+udpzywHsl4RpGJsYWG1pDOcA==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-sanitize-uri": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-sanitize-uri/-/micromark-util-sanitize-uri-2.0.0.tgz",
+      "integrity": "sha512-WhYv5UEcZrbAtlsnPuChHUAsu/iBPOVaEVsntLBIdpibO0ddy8OzavZz3iL2xVvBZOpolujSliP65Kq0/7KIYw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "micromark-util-character": "^2.0.0",
+        "micromark-util-encode": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-subtokenize": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-subtokenize/-/micromark-util-subtokenize-2.0.0.tgz",
+      "integrity": "sha512-vc93L1t+gpR3p8jxeVdaYlbV2jTYteDje19rNSS/H5dlhxUYll5Fy6vJ2cDwP8RnsXi818yGty1ayP55y3W6fg==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
+      "dependencies": {
+        "devlop": "^1.0.0",
+        "micromark-util-chunked": "^2.0.0",
+        "micromark-util-symbol": "^2.0.0",
+        "micromark-util-types": "^2.0.0"
+      }
+    },
+    "node_modules/micromark-util-symbol": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-symbol/-/micromark-util-symbol-2.0.0.tgz",
+      "integrity": "sha512-8JZt9ElZ5kyTnO94muPxIGS8oyElRJaiJO8EzV6ZSyGQ1Is8xwl4Q45qU5UOg+bGH4AikWziz0iN4sFLWs8PGw==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ]
+    },
+    "node_modules/micromark-util-types": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-types/-/micromark-util-types-2.0.0.tgz",
+      "integrity": "sha512-oNh6S2WMHWRZrmutsRmDDfkzKtxF+bc2VxLC9dvtrDIRFln627VsFP6fLMgTryGDljgLPjkrzQSDcPrjPyDJ5w==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ]
+    },
+    "node_modules/minimatch": {
+      "version": "5.1.6",
+      "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-5.1.6.tgz",
+      "integrity": "sha512-lKwV/1brpG6mBUFHtb7NUmtABCb2WZZmm2wNiOA5hAb8VdCS4B3dtMWyvcoViccwAW/COERjXLt0zP1zXUN26g==",
+      "dev": true,
+      "dependencies": {
+        "brace-expansion": "^2.0.1"
+      },
+      "engines": {
+        "node": ">=10"
+      }
+    },
+    "node_modules/mri": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/mri/-/mri-1.2.0.tgz",
+      "integrity": "sha512-tzzskb3bG8LvYGFF/mDTpq3jpI6Q9wc3LEmBaghu+DdCssd1FakN7Bc0hVNmEyGq1bq3RgfkCb3cmQLpNPOroA==",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/ms": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.2.tgz",
+      "integrity": "sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w=="
+    },
+    "node_modules/once": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/once/-/once-1.4.0.tgz",
+      "integrity": "sha512-lNaJgI+2Q5URQBkccEKHTQOPaXdUxnZZElQTZY0MFUAuaEqe1E+Nyvgdz/aIyNi6Z9MzO5dv1H8n58/GELp3+w==",
+      "dev": true,
+      "dependencies": {
+        "wrappy": "1"
+      }
+    },
+    "node_modules/path-parse": {
+      "version": "1.0.7",
+      "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.7.tgz",
+      "integrity": "sha512-LDJzPVEEEPR+y48z93A0Ed0yXb8pAByGWo/k5YYdYgpY2/2EsOsksJrq7lOHxryrVOn1ejG6oAp8ahvOIQD8sw==",
+      "dev": true
+    },
+    "node_modules/perf-regexes": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/perf-regexes/-/perf-regexes-1.0.1.tgz",
+      "integrity": "sha512-L7MXxUDtqr4PUaLFCDCXBfGV/6KLIuSEccizDI7JxT+c9x1G1v04BQ4+4oag84SHaCdrBgQAIs/Cqn+flwFPng==",
+      "dev": true,
+      "engines": {
+        "node": ">=6.14"
+      }
+    },
+    "node_modules/picomatch": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-2.3.1.tgz",
+      "integrity": "sha512-JU3teHTNjmE2VCGFzuY8EXzCDVwEqB2a8fsIvwaStHhAWJEeVd1o1QD80CU6+ZdEXXSLbSsuLwJjkCBWqRQUVA==",
+      "dev": true,
+      "engines": {
+        "node": ">=8.6"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/jonschlinkert"
+      }
+    },
+    "node_modules/pluralize": {
+      "version": "8.0.0",
+      "resolved": "https://registry.npmjs.org/pluralize/-/pluralize-8.0.0.tgz",
+      "integrity": "sha512-Nc3IT5yHzflTfbjgqWcCPpo7DaKy4FnpB0l/zCAW0Tc7jxAiuqSxHasntB3D7887LSrA93kDJ9IXovxJYxyLCA==",
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/remark-gfm": {
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/remark-gfm/-/remark-gfm-4.0.0.tgz",
+      "integrity": "sha512-U92vJgBPkbw4Zfu/IiW2oTZLSL3Zpv+uI7My2eq8JxKgqraFdU8YUGicEJCEgSbeaG+QDFqIcwwfMTOEelPxuA==",
+      "dependencies": {
+        "@types/mdast": "^4.0.0",
+        "mdast-util-gfm": "^3.0.0",
+        "micromark-extension-gfm": "^3.0.0",
+        "remark-parse": "^11.0.0",
+        "remark-stringify": "^11.0.0",
+        "unified": "^11.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint": {
+      "version": "9.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint/-/remark-lint-9.1.2.tgz",
+      "integrity": "sha512-m9e/aPlh7tsvfJfj8tPxrQzD6oEdb9Foko+Ya/6OwUP9EoGMfehv1Qtv26W1DoH58Wn8rT8CD+KuprTWscMmIA==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "remark-message-control": "^7.0.0",
+        "unified": "^10.1.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-blockquote-indentation": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-blockquote-indentation/-/remark-lint-blockquote-indentation-3.1.2.tgz",
+      "integrity": "sha512-5DOrFsZd5dXqA4p/VZvWSrqIWNFbBXjX7IV/FkVkxlNhNF/0FMf/4v8x1I2W3mzaZ7yDsWS/egpZnmligq1ckQ==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "pluralize": "^8.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-blockquote-indentation/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-blockquote-indentation/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-blockquote-indentation/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-blockquote-indentation/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-blockquote-indentation/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-blockquote-indentation/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-character-style": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-checkbox-character-style/-/remark-lint-checkbox-character-style-4.1.2.tgz",
+      "integrity": "sha512-5ITz+1cCuJ3Jv/Q7rKgDEucCOnIgjWDnSHPJA1tb4TI/D316h+ALbDhZIpP8gyfAm6sBAh3Pwz9XZJN2uJB5UQ==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-character-style/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-checkbox-character-style/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-checkbox-character-style/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-character-style/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-character-style/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-character-style/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -1501,22 +2326,1580 @@
     },
     "node_modules/remark-lint-checkbox-content-indent": {
       "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-checkbox-content-indent/-/remark-lint-checkbox-content-indent-4.1.2.tgz",
-      "integrity": "sha512-8uaHAm4bSqB7XpnecLRObe00Lj9eoHiecV+44CfJeWyoo50cTPR/hIMfsMtDxsNt4LZP+6oCV9z+vACJqDv8Hg==",
+      "resolved": "https://registry.npmjs.org/remark-lint-checkbox-content-indent/-/remark-lint-checkbox-content-indent-4.1.2.tgz",
+      "integrity": "sha512-8uaHAm4bSqB7XpnecLRObe00Lj9eoHiecV+44CfJeWyoo50cTPR/hIMfsMtDxsNt4LZP+6oCV9z+vACJqDv8Hg==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0",
+        "vfile-location": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-content-indent/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-checkbox-content-indent/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-checkbox-content-indent/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-content-indent/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-content-indent/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-checkbox-content-indent/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-code-block-style": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-code-block-style/-/remark-lint-code-block-style-3.1.2.tgz",
+      "integrity": "sha512-3wsWmzzdyEsB9sOzBOf46TSkwwVKXN2JpTEQb6feN0Tl6Vg75F7T9MHqMz7aqk/56bOXSxUzdpXDscGBhziLRA==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-code-block-style/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-code-block-style/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-code-block-style/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-code-block-style/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-code-block-style/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-code-block-style/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-definition-spacing": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-definition-spacing/-/remark-lint-definition-spacing-3.1.2.tgz",
+      "integrity": "sha512-l058jAKfZfCOmlbIzoTll+CrZm9Bh42ZVCHcODPSZC8Yx4terCKgIoks+RWJDEdUbEw0YQoYvPc59ZVmp3BIew==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-definition-spacing/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-definition-spacing/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-definition-spacing/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-definition-spacing/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-definition-spacing/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-definition-spacing/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-flag": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-fenced-code-flag/-/remark-lint-fenced-code-flag-3.1.2.tgz",
+      "integrity": "sha512-yh4m3dlPmRsqM/BFhpqHYfrmBvFQ+D5dZZKDDYP2rf3YEoXlEVt8T8lWQueTTSxcq6yXAqL/XQL/iqqUHlLcHw==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-flag/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-flag/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-fenced-code-flag/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-flag/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-flag/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-flag/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-marker": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-fenced-code-marker/-/remark-lint-fenced-code-marker-3.1.2.tgz",
+      "integrity": "sha512-6XNqjOuhT+0c7Q/22aCsMz61ne9g8HRpYF79EXQPdbzYa+PcfPXMiQKStONY3PfC8OE2/3WXI2zcs8w9x+8+VQ==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-marker/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-marker/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-fenced-code-marker/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-marker/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-marker/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-fenced-code-marker/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-file-extension": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-file-extension/-/remark-lint-file-extension-2.1.2.tgz",
+      "integrity": "sha512-Nq54F5R7F1gyj/IMW6SvkAbVNrH+p38WK3//KCoZLDUYFrH0oXgXXFGHi9CT/O0VEopW+bWJfTn8YAJRs0qI5Q==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-file-extension/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-file-extension/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-file-extension/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-final-definition": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-final-definition/-/remark-lint-final-definition-3.1.2.tgz",
+      "integrity": "sha512-3O3JT6xqlrgq+UjhMPxshgMtwXn99w0BEO9JwbDls49N0XCu0n22Pq1n6X3tEVzskPLo3YYyVYfW2Z2C2rneKQ==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-final-definition/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-final-definition/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-final-definition/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-final-definition/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-final-definition/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-final-definition/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-final-newline": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-final-newline/-/remark-lint-final-newline-2.1.2.tgz",
+      "integrity": "sha512-K0FdPGPyEB94PwNgopwVJFE8oRWi7IhY2ycXFVAMReI51el7EHB8F1gX14tB6p6zyGy6mUh69bCVU9mMTNeOUg==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-final-newline/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-final-newline/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-final-newline/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-first-heading-level": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-first-heading-level/-/remark-lint-first-heading-level-3.1.2.tgz",
+      "integrity": "sha512-uSgDMAKOolDcxfJwQU+iJK2Vbz2ZIzBAjQiN0f+9O/7XwrAH5IuVQH60w7chuxVrauVHmd1rbjmvzXVq8R30VQ==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-first-heading-level/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-first-heading-level/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-first-heading-level/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-first-heading-level/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-first-heading-level/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-first-heading-level/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-hard-break-spaces": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-hard-break-spaces/-/remark-lint-hard-break-spaces-3.1.2.tgz",
+      "integrity": "sha512-HaW0xsl3TI7VFAqGWWcZtPqyz0NWu19KKjSO7OGFTUJU4S9YiRnhIxmSFM0ZLSsVAynE+dhzVKa8U7dOpWDcOg==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-hard-break-spaces/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-hard-break-spaces/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-hard-break-spaces/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-hard-break-spaces/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-hard-break-spaces/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-hard-break-spaces/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-heading-style": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-heading-style/-/remark-lint-heading-style-3.1.2.tgz",
+      "integrity": "sha512-0RkcRPV/H2bPFgeInzBkK1cWUwtFTm83I+Db/Z5tDY02GzKOosHLvxtJyj/1391/opAH1LYbHtHWffir99IUgw==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "mdast-util-heading-style": "^2.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-heading-style/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-heading-style/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-heading-style/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-heading-style/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-heading-style/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-heading-style/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-bullet-indent": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-list-item-bullet-indent/-/remark-lint-list-item-bullet-indent-4.1.2.tgz",
+      "integrity": "sha512-WgU5nooqIEm6f35opcbHKBzWrdFJA3XcyTfB3nv/v0KX43/h6qFGmmMJ5kEiaFExuQp3dZSdatWuY0YZ9YRbUg==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "pluralize": "^8.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-bullet-indent/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-list-item-bullet-indent/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-list-item-bullet-indent/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-bullet-indent/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-bullet-indent/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-bullet-indent/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-indent": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-list-item-indent/-/remark-lint-list-item-indent-3.1.2.tgz",
+      "integrity": "sha512-tkrra1pxZVE4OVJGfN435u/v0ljruXU+dHzWiKDYeifquD4aWhJxvSApu7+FbE098D/4usVXgMxwFkNhrpZcSQ==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "pluralize": "^8.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-indent/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-list-item-indent/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-list-item-indent/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-indent/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-indent/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-list-item-indent/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-maximum-line-length": {
+      "version": "3.1.3",
+      "resolved": "https://registry.npmjs.org/remark-lint-maximum-line-length/-/remark-lint-maximum-line-length-3.1.3.tgz",
+      "integrity": "sha512-TA7IE+0c8agRm1k7JZr7ZZFiL44JMBAj1KlMxSTACBuebdPJe7IPaLIQga10bnz75jfWMzSiRURMFHo4lt3kdw==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-maximum-line-length/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-maximum-line-length/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-maximum-line-length/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-maximum-line-length/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-maximum-line-length/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-maximum-line-length/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-blockquote-without-marker": {
+      "version": "5.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-blockquote-without-marker/-/remark-lint-no-blockquote-without-marker-5.1.2.tgz",
+      "integrity": "sha512-QPbqsrt7EfpSWqTkZJ9tepabPIhBDlNqZkuxxMQYD0OQ2N+tHDUq3zE1JxI5ts1V9o/mWApgySocqGd3jlcKmQ==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0",
+        "vfile-location": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-blockquote-without-marker/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-blockquote-without-marker/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-blockquote-without-marker/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-blockquote-without-marker/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-blockquote-without-marker/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-blockquote-without-marker/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-consecutive-blank-lines": {
+      "version": "4.1.3",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-consecutive-blank-lines/-/remark-lint-no-consecutive-blank-lines-4.1.3.tgz",
+      "integrity": "sha512-yU3jH6UMHvaxX3DPBen+7CoPiCcqJ4BeteyOKeKX+tKWCWKILpiz+TVToRbeLnWO4IvFNnSRFMSXmcWSDdbY4w==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "@types/unist": "^2.0.0",
+        "pluralize": "^8.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-consecutive-blank-lines/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-consecutive-blank-lines/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-consecutive-blank-lines/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-consecutive-blank-lines/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-consecutive-blank-lines/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-consecutive-blank-lines/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-duplicate-definitions": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-duplicate-definitions/-/remark-lint-no-duplicate-definitions-3.1.2.tgz",
+      "integrity": "sha512-vi0nXA7p+pjQOorZOkr9E+QDhG74JAdbzqglWPrWWNI3z2rUYWYHTNSyWJbwEXaIIcev1ZAw8SCAOis5MNm+pA==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-stringify-position": "^3.0.0",
+        "unist-util-visit": "^4.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-duplicate-definitions/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-duplicate-definitions/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-duplicate-definitions/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-duplicate-definitions/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-duplicate-definitions/node_modules/unist-util-stringify-position": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-3.0.3.tgz",
+      "integrity": "sha512-k5GzIBZ/QatR8N5X2y+drfpWG8IDBzdnVj6OInRNWm1oXrzydiaAT2OQiA8DPRRZyAKb9b6I2a6PxYklZD0gKg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-duplicate-definitions/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-duplicate-definitions/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-articles": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-file-name-articles/-/remark-lint-no-file-name-articles-2.1.2.tgz",
+      "integrity": "sha512-kM4vwBkne7f9euDKsuyxTtrsiafjH+KOwu8ZmuSVWh5U+u0EMcPyN5fxfaQIW+5FkrJA1jwnRu7ciXJBJt74Og==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-articles/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-articles/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-file-name-articles/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-consecutive-dashes": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-file-name-consecutive-dashes/-/remark-lint-no-file-name-consecutive-dashes-2.1.2.tgz",
+      "integrity": "sha512-gw06jaaFwBR3s+3E2kJlv+E7rAzS7Nj+MFU7TViwbsYnR7PA96htLVDCjClyNUE7JHUNcv93HdLm8ykg8kRyNA==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-consecutive-dashes/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-consecutive-dashes/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-file-name-consecutive-dashes/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-outer-dashes": {
+      "version": "2.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-file-name-outer-dashes/-/remark-lint-no-file-name-outer-dashes-2.1.2.tgz",
+      "integrity": "sha512-VrbHg25Oo9k/bNbS7ye1X7F6ER4uZSubO+t5DHJ4WZ6iVbNtBar/JwzVelY1YxUAutv42OvHfuveh4vKlcNgVA==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
+        "unified": "^10.0.0",
+        "unified-lint-rule": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-outer-dashes/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-file-name-outer-dashes/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-file-name-outer-dashes/node_modules/unified": {
+      "version": "10.1.2",
+      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
+      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "bail": "^2.0.0",
+        "extend": "^3.0.0",
+        "is-buffer": "^2.0.0",
+        "is-plain-obj": "^4.0.0",
+        "trough": "^2.0.0",
+        "vfile": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-heading-content-indent": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-heading-content-indent/-/remark-lint-no-heading-content-indent-4.1.2.tgz",
+      "integrity": "sha512-TTxFsm1f4ZHFxZQCuz7j0QK4RvP6oArTiwazKLr16yaZe1608ypogMek4A30j2xX8WuO9+2uBzLXCY5OBo5x5Q==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
+        "mdast-util-heading-style": "^2.0.0",
+        "pluralize": "^8.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
         "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0",
-        "vfile-location": "^4.0.0"
+        "unist-util-visit": "^4.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-checkbox-content-indent/node_modules/unified": {
+    "node_modules/remark-lint-no-heading-content-indent/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-heading-content-indent/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-heading-content-indent/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -1534,12 +3917,52 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-code-block-style": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-code-block-style/-/remark-lint-code-block-style-3.1.2.tgz",
-      "integrity": "sha512-3wsWmzzdyEsB9sOzBOf46TSkwwVKXN2JpTEQb6feN0Tl6Vg75F7T9MHqMz7aqk/56bOXSxUzdpXDscGBhziLRA==",
+    "node_modules/remark-lint-no-heading-content-indent/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-heading-content-indent/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-heading-content-indent/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-heading-indent": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-heading-indent/-/remark-lint-no-heading-indent-4.1.2.tgz",
+      "integrity": "sha512-XFoSebfsYV6EFYRCYkCzSw6xxgltN5l3aPH+UfCk/0geMnl3DrCQjbQt9qhxQzBSBa4gA91CGs2DRI5Xxbwzig==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
+        "pluralize": "^8.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
         "unist-util-generated": "^2.0.0",
@@ -1551,7 +3974,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-code-block-style/node_modules/unified": {
+    "node_modules/remark-lint-no-heading-indent/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-heading-indent/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-heading-indent/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -1569,15 +4005,55 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-definition-spacing": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-definition-spacing/-/remark-lint-definition-spacing-3.1.2.tgz",
-      "integrity": "sha512-l058jAKfZfCOmlbIzoTll+CrZm9Bh42ZVCHcODPSZC8Yx4terCKgIoks+RWJDEdUbEw0YQoYvPc59ZVmp3BIew==",
+    "node_modules/remark-lint-no-heading-indent/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-heading-indent/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-heading-indent/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-inline-padding": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-inline-padding/-/remark-lint-no-inline-padding-4.1.2.tgz",
+      "integrity": "sha512-dGyhWsiqCZS3Slob0EVBUfsFBbdpMIBCvb56LlCgaHbnLsnNYx8PpF/wA5CgsN8BXIbXfRpyPB5cIJwIq5taYg==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
+        "mdast-util-to-string": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
-        "unist-util-position": "^4.0.0",
+        "unist-util-generated": "^2.0.0",
         "unist-util-visit": "^4.0.0"
       },
       "funding": {
@@ -1585,7 +4061,32 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-definition-spacing/node_modules/unified": {
+    "node_modules/remark-lint-no-inline-padding/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-inline-padding/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-inline-padding/node_modules/mdast-util-to-string": {
+      "version": "3.2.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-to-string/-/mdast-util-to-string-3.2.0.tgz",
+      "integrity": "sha512-V4Zn/ncyN1QNSqSBxTrMOLpjr+IKdHl2v3KVLoWmDPscP4r9GcCi71gjgvUV1SFSKh92AjAG4peFuBl2/YgCJg==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-inline-padding/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -1603,12 +4104,52 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-fenced-code-flag": {
+    "node_modules/remark-lint-no-inline-padding/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-inline-padding/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-inline-padding/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-literal-urls": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-fenced-code-flag/-/remark-lint-fenced-code-flag-3.1.2.tgz",
-      "integrity": "sha512-yh4m3dlPmRsqM/BFhpqHYfrmBvFQ+D5dZZKDDYP2rf3YEoXlEVt8T8lWQueTTSxcq6yXAqL/XQL/iqqUHlLcHw==",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-literal-urls/-/remark-lint-no-literal-urls-3.1.2.tgz",
+      "integrity": "sha512-4tV9JGLKxAMFSuWDMOqLozkFJ3HyRvhzgrPrxASoziaml23m7UXAozk5dkIrFny1cN2oG988Z8tORxX2FL1Ilw==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
+        "mdast-util-to-string": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
         "unist-util-generated": "^2.0.0",
@@ -1620,41 +4161,32 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-fenced-code-flag/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-literal-urls/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
+        "@types/unist": "^2"
       }
     },
-    "node_modules/remark-lint-fenced-code-marker": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-fenced-code-marker/-/remark-lint-fenced-code-marker-3.1.2.tgz",
-      "integrity": "sha512-6XNqjOuhT+0c7Q/22aCsMz61ne9g8HRpYF79EXQPdbzYa+PcfPXMiQKStONY3PfC8OE2/3WXI2zcs8w9x+8+VQ==",
+    "node_modules/remark-lint-no-literal-urls/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-literal-urls/node_modules/mdast-util-to-string": {
+      "version": "3.2.0",
+      "resolved": "https://registry.npmjs.org/mdast-util-to-string/-/mdast-util-to-string-3.2.0.tgz",
+      "integrity": "sha512-V4Zn/ncyN1QNSqSBxTrMOLpjr+IKdHl2v3KVLoWmDPscP4r9GcCi71gjgvUV1SFSKh92AjAG4peFuBl2/YgCJg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/mdast": "^3.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-fenced-code-marker/node_modules/unified": {
+    "node_modules/remark-lint-no-literal-urls/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -1672,48 +4204,56 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-file-extension": {
-      "version": "2.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-file-extension/-/remark-lint-file-extension-2.1.2.tgz",
-      "integrity": "sha512-Nq54F5R7F1gyj/IMW6SvkAbVNrH+p38WK3//KCoZLDUYFrH0oXgXXFGHi9CT/O0VEopW+bWJfTn8YAJRs0qI5Q==",
+    "node_modules/remark-lint-no-literal-urls/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-file-extension/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-literal-urls/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-final-definition": {
+    "node_modules/remark-lint-no-literal-urls/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-multiple-toplevel-headings": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-final-definition/-/remark-lint-final-definition-3.1.2.tgz",
-      "integrity": "sha512-3O3JT6xqlrgq+UjhMPxshgMtwXn99w0BEO9JwbDls49N0XCu0n22Pq1n6X3tEVzskPLo3YYyVYfW2Z2C2rneKQ==",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-multiple-toplevel-headings/-/remark-lint-no-multiple-toplevel-headings-3.1.2.tgz",
+      "integrity": "sha512-9rJSsrwdzwKmtuloBjJobLzjGL7Lgtk3+vMNUyuH9z/nBfkUCN3qxn3Nt9AxL+wwSAsHV6e74W+W2S1ohBLt6A==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
         "unist-util-generated": "^2.0.0",
         "unist-util-position": "^4.0.0",
+        "unist-util-stringify-position": "^3.0.0",
         "unist-util-visit": "^4.0.0"
       },
       "funding": {
@@ -1721,7 +4261,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-final-definition/node_modules/unified": {
+    "node_modules/remark-lint-no-multiple-toplevel-headings/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-multiple-toplevel-headings/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-multiple-toplevel-headings/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -1739,42 +4292,61 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-final-newline": {
-      "version": "2.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-final-newline/-/remark-lint-final-newline-2.1.2.tgz",
-      "integrity": "sha512-K0FdPGPyEB94PwNgopwVJFE8oRWi7IhY2ycXFVAMReI51el7EHB8F1gX14tB6p6zyGy6mUh69bCVU9mMTNeOUg==",
+    "node_modules/remark-lint-no-multiple-toplevel-headings/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-final-newline/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-multiple-toplevel-headings/node_modules/unist-util-stringify-position": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-3.0.3.tgz",
+      "integrity": "sha512-k5GzIBZ/QatR8N5X2y+drfpWG8IDBzdnVj6OInRNWm1oXrzydiaAT2OQiA8DPRRZyAKb9b6I2a6PxYklZD0gKg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-multiple-toplevel-headings/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-first-heading-level": {
+    "node_modules/remark-lint-no-multiple-toplevel-headings/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-shell-dollars": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-first-heading-level/-/remark-lint-first-heading-level-3.1.2.tgz",
-      "integrity": "sha512-uSgDMAKOolDcxfJwQU+iJK2Vbz2ZIzBAjQiN0f+9O/7XwrAH5IuVQH60w7chuxVrauVHmd1rbjmvzXVq8R30VQ==",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-shell-dollars/-/remark-lint-no-shell-dollars-3.1.2.tgz",
+      "integrity": "sha512-np2MDEhXHviXhbQFjnC1QYv5/fxCV1cIHfGMoJpqiW7Zcu/UGCOo5TE3XswZH4ukHZJ65c3X2A6qfLDW+ur3CQ==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
         "unified": "^10.0.0",
@@ -1787,7 +4359,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-first-heading-level/node_modules/unified": {
+    "node_modules/remark-lint-no-shell-dollars/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-shell-dollars/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-shell-dollars/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -1805,48 +4390,51 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-hard-break-spaces": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-hard-break-spaces/-/remark-lint-hard-break-spaces-3.1.2.tgz",
-      "integrity": "sha512-HaW0xsl3TI7VFAqGWWcZtPqyz0NWu19KKjSO7OGFTUJU4S9YiRnhIxmSFM0ZLSsVAynE+dhzVKa8U7dOpWDcOg==",
+    "node_modules/remark-lint-no-shell-dollars/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-hard-break-spaces/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-shell-dollars/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-heading-style": {
+    "node_modules/remark-lint-no-shell-dollars/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-shortcut-reference-image": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-heading-style/-/remark-lint-heading-style-3.1.2.tgz",
-      "integrity": "sha512-0RkcRPV/H2bPFgeInzBkK1cWUwtFTm83I+Db/Z5tDY02GzKOosHLvxtJyj/1391/opAH1LYbHtHWffir99IUgw==",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-shortcut-reference-image/-/remark-lint-no-shortcut-reference-image-3.1.2.tgz",
+      "integrity": "sha512-NX4XJFPyDeJJ77pmETxRj4oM/zayf7Lmn/O87HgExBkQIPz2NYbDeKD8QEyliLaV/oKA2rQufpzuFw55xa1Tww==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
-        "mdast-util-heading-style": "^2.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
         "unist-util-generated": "^2.0.0",
@@ -1857,7 +4445,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-heading-style/node_modules/unified": {
+    "node_modules/remark-lint-no-shortcut-reference-image/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-shortcut-reference-image/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-shortcut-reference-image/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -1875,51 +4476,54 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-list-item-bullet-indent": {
-      "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-list-item-bullet-indent/-/remark-lint-list-item-bullet-indent-4.1.2.tgz",
-      "integrity": "sha512-WgU5nooqIEm6f35opcbHKBzWrdFJA3XcyTfB3nv/v0KX43/h6qFGmmMJ5kEiaFExuQp3dZSdatWuY0YZ9YRbUg==",
+    "node_modules/remark-lint-no-shortcut-reference-image/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "pluralize": "^8.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-list-item-bullet-indent/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-shortcut-reference-image/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-shortcut-reference-image/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-list-item-indent": {
+    "node_modules/remark-lint-no-shortcut-reference-link": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-list-item-indent/-/remark-lint-list-item-indent-3.1.2.tgz",
-      "integrity": "sha512-tkrra1pxZVE4OVJGfN435u/v0ljruXU+dHzWiKDYeifquD4aWhJxvSApu7+FbE098D/4usVXgMxwFkNhrpZcSQ==",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-shortcut-reference-link/-/remark-lint-no-shortcut-reference-link-3.1.2.tgz",
+      "integrity": "sha512-/9iPN7FLKaaIzw4tLWKu7Rx0wAP7E2EuzIeentQlkY0rO/mMHipmT3IlgiebsAInKagzTY6TNFoG1rq2VnaCcA==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
-        "pluralize": "^8.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
         "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
         "unist-util-visit": "^4.0.0"
       },
       "funding": {
@@ -1927,7 +4531,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-list-item-indent/node_modules/unified": {
+    "node_modules/remark-lint-no-shortcut-reference-link/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-shortcut-reference-link/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-shortcut-reference-link/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -1945,50 +4562,53 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-maximum-line-length": {
-      "version": "3.1.3",
-      "resolved": "https://registry.npmjs.org/remark-lint-maximum-line-length/-/remark-lint-maximum-line-length-3.1.3.tgz",
-      "integrity": "sha512-TA7IE+0c8agRm1k7JZr7ZZFiL44JMBAj1KlMxSTACBuebdPJe7IPaLIQga10bnz75jfWMzSiRURMFHo4lt3kdw==",
+    "node_modules/remark-lint-no-shortcut-reference-link/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-maximum-line-length/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-shortcut-reference-link/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-blockquote-without-marker": {
-      "version": "5.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-blockquote-without-marker/-/remark-lint-no-blockquote-without-marker-5.1.2.tgz",
-      "integrity": "sha512-QPbqsrt7EfpSWqTkZJ9tepabPIhBDlNqZkuxxMQYD0OQ2N+tHDUq3zE1JxI5ts1V9o/mWApgySocqGd3jlcKmQ==",
+    "node_modules/remark-lint-no-shortcut-reference-link/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-table-indentation": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-table-indentation/-/remark-lint-no-table-indentation-4.1.2.tgz",
+      "integrity": "sha512-5lkO+Yrtni/CDMZi7mlwbB2zzRQLH94DesboXg51aO2UfZlSn5dZNhmN5wkyCU2AiApUhlFNbxfKMHOWFPLdog==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
         "unist-util-position": "^4.0.0",
         "unist-util-visit": "^4.0.0",
         "vfile-location": "^4.0.0"
@@ -1998,7 +4618,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-blockquote-without-marker/node_modules/unified": {
+    "node_modules/remark-lint-no-table-indentation/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-table-indentation/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-table-indentation/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2016,62 +4649,74 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-consecutive-blank-lines": {
-      "version": "4.1.3",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-consecutive-blank-lines/-/remark-lint-no-consecutive-blank-lines-4.1.3.tgz",
-      "integrity": "sha512-yU3jH6UMHvaxX3DPBen+7CoPiCcqJ4BeteyOKeKX+tKWCWKILpiz+TVToRbeLnWO4IvFNnSRFMSXmcWSDdbY4w==",
+    "node_modules/remark-lint-no-table-indentation/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-table-indentation/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
         "@types/unist": "^2.0.0",
-        "pluralize": "^8.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-consecutive-blank-lines/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-table-indentation/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-duplicate-definitions": {
+    "node_modules/remark-lint-no-tabs": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-duplicate-definitions/-/remark-lint-no-duplicate-definitions-3.1.2.tgz",
-      "integrity": "sha512-vi0nXA7p+pjQOorZOkr9E+QDhG74JAdbzqglWPrWWNI3z2rUYWYHTNSyWJbwEXaIIcev1ZAw8SCAOis5MNm+pA==",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-tabs/-/remark-lint-no-tabs-3.1.2.tgz",
+      "integrity": "sha512-PQQmRpGHRW9tMnAXtlQbMke8byIJu9hlotCH6pJZPO4FodpXvD4JW5EMM3BmO0JQDZsQWrx3qfqxCEMxrj8Qbg==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-stringify-position": "^3.0.0",
-        "unist-util-visit": "^4.0.0"
+        "vfile-location": "^4.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-duplicate-definitions/node_modules/unified": {
+    "node_modules/remark-lint-no-tabs/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-tabs/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-tabs/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2089,85 +4734,92 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-file-name-articles": {
-      "version": "2.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-file-name-articles/-/remark-lint-no-file-name-articles-2.1.2.tgz",
-      "integrity": "sha512-kM4vwBkne7f9euDKsuyxTtrsiafjH+KOwu8ZmuSVWh5U+u0EMcPyN5fxfaQIW+5FkrJA1jwnRu7ciXJBJt74Og==",
+    "node_modules/remark-lint-no-trailing-spaces": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-trailing-spaces/-/remark-lint-no-trailing-spaces-2.0.1.tgz",
+      "integrity": "sha512-cj8t+nvtO6eAY2lJC7o5du8VeOCK13XiDUHL4U6k5aw6ZLr3EYWbQ/rNc6cr60eHkh5Ldm09KiZjV3CWpxqJ0g==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
+        "unified-lint-rule": "^1.0.2"
       }
     },
-    "node_modules/remark-lint-no-file-name-articles/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-trailing-spaces/node_modules/unified-lint-rule": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmjs.org/unified-lint-rule/-/unified-lint-rule-1.0.6.tgz",
+      "integrity": "sha512-YPK15YBFwnsVorDFG/u0cVVQN5G2a3V8zv5/N6KN3TCG+ajKtaALcy7u14DCSrJI+gZeyYquFL9cioJXOGXSvg==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "wrapped": "^1.0.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-file-name-consecutive-dashes": {
-      "version": "2.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-file-name-consecutive-dashes/-/remark-lint-no-file-name-consecutive-dashes-2.1.2.tgz",
-      "integrity": "sha512-gw06jaaFwBR3s+3E2kJlv+E7rAzS7Nj+MFU7TViwbsYnR7PA96htLVDCjClyNUE7JHUNcv93HdLm8ykg8kRyNA==",
+    "node_modules/remark-lint-no-undefined-references": {
+      "version": "4.2.1",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-undefined-references/-/remark-lint-no-undefined-references-4.2.1.tgz",
+      "integrity": "sha512-HdNg5b2KiuNplcuVvRtsrUiROw557kAG1CiZYB7jQrrVWFgd86lKTa3bDiywe+87dGrGmHd3qQ28eZYTuHz2Nw==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
+        "micromark-util-normalize-identifier": "^1.0.0",
         "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0"
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0",
+        "vfile-location": "^4.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-file-name-consecutive-dashes/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-undefined-references/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
+        "@types/unist": "^2"
       }
     },
-    "node_modules/remark-lint-no-file-name-outer-dashes": {
-      "version": "2.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-file-name-outer-dashes/-/remark-lint-no-file-name-outer-dashes-2.1.2.tgz",
-      "integrity": "sha512-VrbHg25Oo9k/bNbS7ye1X7F6ER4uZSubO+t5DHJ4WZ6iVbNtBar/JwzVelY1YxUAutv42OvHfuveh4vKlcNgVA==",
+    "node_modules/remark-lint-no-undefined-references/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-undefined-references/node_modules/micromark-util-normalize-identifier": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-normalize-identifier/-/micromark-util-normalize-identifier-1.1.0.tgz",
+      "integrity": "sha512-N+w5vhqrBihhjdpM8+5Xsxy71QWqGn7HYNUvch71iV2PM7+E3uWGox1Qp90loa1ephtCxG2ftRV/Conitc6P2Q==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ],
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
+        "micromark-util-symbol": "^1.0.0"
       }
     },
-    "node_modules/remark-lint-no-file-name-outer-dashes/node_modules/unified": {
+    "node_modules/remark-lint-no-undefined-references/node_modules/micromark-util-symbol": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/micromark-util-symbol/-/micromark-util-symbol-1.1.0.tgz",
+      "integrity": "sha512-uEjpEYY6KMs1g7QfJ2eX1SQEV+ZT4rUD3UcF6l57acZvLNK7PBZL+ty82Z1qhK1/yXIY4bdx04FKMgR0g4IAag==",
+      "funding": [
+        {
+          "type": "GitHub Sponsors",
+          "url": "https://github.com/sponsors/unifiedjs"
+        },
+        {
+          "type": "OpenCollective",
+          "url": "https://opencollective.com/unified"
+        }
+      ]
+    },
+    "node_modules/remark-lint-no-undefined-references/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2185,54 +4837,54 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-heading-content-indent": {
+    "node_modules/remark-lint-no-undefined-references/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-undefined-references/node_modules/unist-util-visit": {
       "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-heading-content-indent/-/remark-lint-no-heading-content-indent-4.1.2.tgz",
-      "integrity": "sha512-TTxFsm1f4ZHFxZQCuz7j0QK4RvP6oArTiwazKLr16yaZe1608ypogMek4A30j2xX8WuO9+2uBzLXCY5OBo5x5Q==",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "mdast-util-heading-style": "^2.0.0",
-        "pluralize": "^8.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-heading-content-indent/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-undefined-references/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-heading-indent": {
-      "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-heading-indent/-/remark-lint-no-heading-indent-4.1.2.tgz",
-      "integrity": "sha512-XFoSebfsYV6EFYRCYkCzSw6xxgltN5l3aPH+UfCk/0geMnl3DrCQjbQt9qhxQzBSBa4gA91CGs2DRI5Xxbwzig==",
+    "node_modules/remark-lint-no-unused-definitions": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-no-unused-definitions/-/remark-lint-no-unused-definitions-3.1.2.tgz",
+      "integrity": "sha512-bOcaJAnjKxT3kASFquUA3fO9xem9wZhVqt8TbqjA84+G4n40qjaLXDs/4vq73aMsSde73K0f3j1u0pMe7et8yQ==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
-        "pluralize": "^8.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
         "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
         "unist-util-visit": "^4.0.0"
       },
       "funding": {
@@ -2240,7 +4892,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-heading-indent/node_modules/unified": {
+    "node_modules/remark-lint-no-unused-definitions/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-no-unused-definitions/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-no-unused-definitions/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2258,48 +4923,51 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-inline-padding": {
+    "node_modules/remark-lint-no-unused-definitions/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-no-unused-definitions/node_modules/unist-util-visit": {
       "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-inline-padding/-/remark-lint-no-inline-padding-4.1.2.tgz",
-      "integrity": "sha512-dGyhWsiqCZS3Slob0EVBUfsFBbdpMIBCvb56LlCgaHbnLsnNYx8PpF/wA5CgsN8BXIbXfRpyPB5cIJwIq5taYg==",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "mdast-util-to-string": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-inline-padding/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-no-unused-definitions/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-literal-urls": {
+    "node_modules/remark-lint-ordered-list-marker-style": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-literal-urls/-/remark-lint-no-literal-urls-3.1.2.tgz",
-      "integrity": "sha512-4tV9JGLKxAMFSuWDMOqLozkFJ3HyRvhzgrPrxASoziaml23m7UXAozk5dkIrFny1cN2oG988Z8tORxX2FL1Ilw==",
+      "resolved": "https://registry.npmjs.org/remark-lint-ordered-list-marker-style/-/remark-lint-ordered-list-marker-style-3.1.2.tgz",
+      "integrity": "sha512-62iVE/YQsA0Azaqt8yAJWPplWLS47kDLjXeC2PlRIAzCqbNt9qH3HId8vZ15QTSrp8rHmJwrCMdcqV6AZUi7gQ==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
-        "mdast-util-to-string": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
         "unist-util-generated": "^2.0.0",
@@ -2311,7 +4979,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-literal-urls/node_modules/unified": {
+    "node_modules/remark-lint-ordered-list-marker-style/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-ordered-list-marker-style/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-ordered-list-marker-style/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2329,119 +5010,110 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-multiple-toplevel-headings": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-multiple-toplevel-headings/-/remark-lint-no-multiple-toplevel-headings-3.1.2.tgz",
-      "integrity": "sha512-9rJSsrwdzwKmtuloBjJobLzjGL7Lgtk3+vMNUyuH9z/nBfkUCN3qxn3Nt9AxL+wwSAsHV6e74W+W2S1ohBLt6A==",
+    "node_modules/remark-lint-ordered-list-marker-style/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-stringify-position": "^3.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-multiple-toplevel-headings/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-ordered-list-marker-style/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-shell-dollars": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-shell-dollars/-/remark-lint-no-shell-dollars-3.1.2.tgz",
-      "integrity": "sha512-np2MDEhXHviXhbQFjnC1QYv5/fxCV1cIHfGMoJpqiW7Zcu/UGCOo5TE3XswZH4ukHZJ65c3X2A6qfLDW+ur3CQ==",
+    "node_modules/remark-lint-ordered-list-marker-style/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-shell-dollars/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-prohibited-strings": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/remark-lint-prohibited-strings/-/remark-lint-prohibited-strings-3.1.0.tgz",
+      "integrity": "sha512-zwfDDdYl7ye0gEHcwhdkv1ZGXj1ibw4gnLLZkkvySnDdTz2tshY3fOJLY5NikbVseaIRVGOr5qa+8J9WNQT/fA==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "escape-string-regexp": "^5.0.0",
+        "unified-lint-rule": "^2.0.0",
+        "unist-util-position": "^4.0.1",
+        "unist-util-visit": "^4.0.0",
+        "vfile-location": "^4.0.1"
+      }
+    },
+    "node_modules/remark-lint-prohibited-strings/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-prohibited-strings/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-shortcut-reference-image": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-shortcut-reference-image/-/remark-lint-no-shortcut-reference-image-3.1.2.tgz",
-      "integrity": "sha512-NX4XJFPyDeJJ77pmETxRj4oM/zayf7Lmn/O87HgExBkQIPz2NYbDeKD8QEyliLaV/oKA2rQufpzuFw55xa1Tww==",
+    "node_modules/remark-lint-prohibited-strings/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-shortcut-reference-image/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-prohibited-strings/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-shortcut-reference-link": {
+    "node_modules/remark-lint-rule-style": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-shortcut-reference-link/-/remark-lint-no-shortcut-reference-link-3.1.2.tgz",
-      "integrity": "sha512-/9iPN7FLKaaIzw4tLWKu7Rx0wAP7E2EuzIeentQlkY0rO/mMHipmT3IlgiebsAInKagzTY6TNFoG1rq2VnaCcA==",
+      "resolved": "https://registry.npmjs.org/remark-lint-rule-style/-/remark-lint-rule-style-3.1.2.tgz",
+      "integrity": "sha512-0CsX2XcX9pIhAP5N7Y8mhYXp3/Ld+NvxXY1p0LHAq0NZu17UsZLuegvx/s25uFbQs08DcmSqyKnepU9qGGqmTQ==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
         "unist-util-visit": "^4.0.0"
       },
       "funding": {
@@ -2449,7 +5121,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-shortcut-reference-link/node_modules/unified": {
+    "node_modules/remark-lint-rule-style/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-rule-style/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-rule-style/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2467,57 +5152,75 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-table-indentation": {
+    "node_modules/remark-lint-rule-style/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-rule-style/node_modules/unist-util-visit": {
       "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-table-indentation/-/remark-lint-no-table-indentation-4.1.2.tgz",
-      "integrity": "sha512-5lkO+Yrtni/CDMZi7mlwbB2zzRQLH94DesboXg51aO2UfZlSn5dZNhmN5wkyCU2AiApUhlFNbxfKMHOWFPLdog==",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0",
-        "vfile-location": "^4.0.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-table-indentation/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-rule-style/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-tabs": {
+    "node_modules/remark-lint-strong-marker": {
       "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-tabs/-/remark-lint-no-tabs-3.1.2.tgz",
-      "integrity": "sha512-PQQmRpGHRW9tMnAXtlQbMke8byIJu9hlotCH6pJZPO4FodpXvD4JW5EMM3BmO0JQDZsQWrx3qfqxCEMxrj8Qbg==",
+      "resolved": "https://registry.npmjs.org/remark-lint-strong-marker/-/remark-lint-strong-marker-3.1.2.tgz",
+      "integrity": "sha512-U/g4wngmiI0Q6WBRQG6pZxnDS33Wt/0QYA3+KNFBDykoi1vXsDEorIqy3dEag9z6XHwcMvFDsff6VRUhaOJWQg==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
-        "vfile-location": "^4.0.0"
+        "unist-util-position": "^4.0.0",
+        "unist-util-visit": "^4.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-tabs/node_modules/unified": {
+    "node_modules/remark-lint-strong-marker/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-strong-marker/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-strong-marker/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2535,72 +5238,55 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-trailing-spaces": {
-      "version": "2.0.1",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-trailing-spaces/-/remark-lint-no-trailing-spaces-2.0.1.tgz",
-      "integrity": "sha512-cj8t+nvtO6eAY2lJC7o5du8VeOCK13XiDUHL4U6k5aw6ZLr3EYWbQ/rNc6cr60eHkh5Ldm09KiZjV3CWpxqJ0g==",
-      "dependencies": {
-        "unified-lint-rule": "^1.0.2"
-      }
-    },
-    "node_modules/remark-lint-no-trailing-spaces/node_modules/unified-lint-rule": {
-      "version": "1.0.6",
-      "resolved": "https://registry.npmjs.org/unified-lint-rule/-/unified-lint-rule-1.0.6.tgz",
-      "integrity": "sha512-YPK15YBFwnsVorDFG/u0cVVQN5G2a3V8zv5/N6KN3TCG+ajKtaALcy7u14DCSrJI+gZeyYquFL9cioJXOGXSvg==",
+    "node_modules/remark-lint-strong-marker/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "wrapped": "^1.0.1"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-undefined-references": {
-      "version": "4.2.1",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-undefined-references/-/remark-lint-no-undefined-references-4.2.1.tgz",
-      "integrity": "sha512-HdNg5b2KiuNplcuVvRtsrUiROw557kAG1CiZYB7jQrrVWFgd86lKTa3bDiywe+87dGrGmHd3qQ28eZYTuHz2Nw==",
+    "node_modules/remark-lint-strong-marker/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "micromark-util-normalize-identifier": "^1.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0",
-        "vfile-location": "^4.0.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-undefined-references/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-strong-marker/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-unused-definitions": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-no-unused-definitions/-/remark-lint-no-unused-definitions-3.1.2.tgz",
-      "integrity": "sha512-bOcaJAnjKxT3kASFquUA3fO9xem9wZhVqt8TbqjA84+G4n40qjaLXDs/4vq73aMsSde73K0f3j1u0pMe7et8yQ==",
+    "node_modules/remark-lint-table-cell-padding": {
+      "version": "4.1.3",
+      "resolved": "https://registry.npmjs.org/remark-lint-table-cell-padding/-/remark-lint-table-cell-padding-4.1.3.tgz",
+      "integrity": "sha512-N9xtnS6MG/H3srAMjqqaF26A7socr87pIgt64dr5rxoSbDRWRPChGQ8y7wKyV8VeyRNF37e3E5KB3bQVqjSYaQ==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
+        "@types/unist": "^2.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
+        "unist-util-position": "^4.0.0",
         "unist-util-visit": "^4.0.0"
       },
       "funding": {
@@ -2608,7 +5294,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-no-unused-definitions/node_modules/unified": {
+    "node_modules/remark-lint-table-cell-padding/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-table-cell-padding/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-table-cell-padding/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2626,57 +5325,49 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-ordered-list-marker-style": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-ordered-list-marker-style/-/remark-lint-ordered-list-marker-style-3.1.2.tgz",
-      "integrity": "sha512-62iVE/YQsA0Azaqt8yAJWPplWLS47kDLjXeC2PlRIAzCqbNt9qH3HId8vZ15QTSrp8rHmJwrCMdcqV6AZUi7gQ==",
+    "node_modules/remark-lint-table-cell-padding/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-ordered-list-marker-style/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-table-cell-padding/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-prohibited-strings": {
-      "version": "3.1.0",
-      "resolved": "https://registry.npmjs.org/remark-lint-prohibited-strings/-/remark-lint-prohibited-strings-3.1.0.tgz",
-      "integrity": "sha512-zwfDDdYl7ye0gEHcwhdkv1ZGXj1ibw4gnLLZkkvySnDdTz2tshY3fOJLY5NikbVseaIRVGOr5qa+8J9WNQT/fA==",
+    "node_modules/remark-lint-table-cell-padding/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
-        "escape-string-regexp": "^5.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-position": "^4.0.1",
-        "unist-util-visit": "^4.0.0",
-        "vfile-location": "^4.0.1"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-rule-style": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-rule-style/-/remark-lint-rule-style-3.1.2.tgz",
-      "integrity": "sha512-0CsX2XcX9pIhAP5N7Y8mhYXp3/Ld+NvxXY1p0LHAq0NZu17UsZLuegvx/s25uFbQs08DcmSqyKnepU9qGGqmTQ==",
+    "node_modules/remark-lint-table-pipes": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-table-pipes/-/remark-lint-table-pipes-4.1.2.tgz",
+      "integrity": "sha512-Ex2cJDXA0hdD9CC5Nu0p3K5LP+AhzPvk4sIOSbevCTSRyCS/SkNk4CQ6pwWBxuPVuHQUkqXkT8lgu8wwr/9A3A==",
       "dependencies": {
         "@types/mdast": "^3.0.0",
         "unified": "^10.0.0",
@@ -2689,7 +5380,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-rule-style/node_modules/unified": {
+    "node_modules/remark-lint-table-pipes/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-table-pipes/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-table-pipes/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2707,49 +5411,54 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-strong-marker": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-strong-marker/-/remark-lint-strong-marker-3.1.2.tgz",
-      "integrity": "sha512-U/g4wngmiI0Q6WBRQG6pZxnDS33Wt/0QYA3+KNFBDykoi1vXsDEorIqy3dEag9z6XHwcMvFDsff6VRUhaOJWQg==",
+    "node_modules/remark-lint-table-pipes/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-strong-marker/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-table-pipes/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-table-cell-padding": {
-      "version": "4.1.3",
-      "resolved": "https://registry.npmjs.org/remark-lint-table-cell-padding/-/remark-lint-table-cell-padding-4.1.3.tgz",
-      "integrity": "sha512-N9xtnS6MG/H3srAMjqqaF26A7socr87pIgt64dr5rxoSbDRWRPChGQ8y7wKyV8VeyRNF37e3E5KB3bQVqjSYaQ==",
+    "node_modules/remark-lint-table-pipes/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
         "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
+    "node_modules/remark-lint-unordered-list-marker-style": {
+      "version": "3.1.2",
+      "resolved": "https://registry.npmjs.org/remark-lint-unordered-list-marker-style/-/remark-lint-unordered-list-marker-style-3.1.2.tgz",
+      "integrity": "sha512-JFiyB4ZprJGGndCaFB8FssXd48m4Kh+CUqzNgu3lBLEiW8dEAGRlD9M2AzyyA+Q29WJP/FntDCbP22DeON91UA==",
+      "dependencies": {
+        "@types/mdast": "^3.0.0",
         "unified": "^10.0.0",
         "unified-lint-rule": "^2.0.0",
+        "unist-util-generated": "^2.0.0",
         "unist-util-position": "^4.0.0",
         "unist-util-visit": "^4.0.0"
       },
@@ -2758,7 +5467,20 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-table-cell-padding/node_modules/unified": {
+    "node_modules/remark-lint-unordered-list-marker-style/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-lint-unordered-list-marker-style/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/remark-lint-unordered-list-marker-style/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
       "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
@@ -2776,75 +5498,58 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-table-pipes": {
-      "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-table-pipes/-/remark-lint-table-pipes-4.1.2.tgz",
-      "integrity": "sha512-Ex2cJDXA0hdD9CC5Nu0p3K5LP+AhzPvk4sIOSbevCTSRyCS/SkNk4CQ6pwWBxuPVuHQUkqXkT8lgu8wwr/9A3A==",
+    "node_modules/remark-lint-unordered-list-marker-style/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-table-pipes/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint-unordered-list-marker-style/node_modules/unist-util-visit": {
+      "version": "4.1.2",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
+      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
       "dependencies": {
         "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "unist-util-is": "^5.0.0",
+        "unist-util-visit-parents": "^5.1.1"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-unordered-list-marker-style": {
-      "version": "3.1.2",
-      "resolved": "https://registry.npmjs.org/remark-lint-unordered-list-marker-style/-/remark-lint-unordered-list-marker-style-3.1.2.tgz",
-      "integrity": "sha512-JFiyB4ZprJGGndCaFB8FssXd48m4Kh+CUqzNgu3lBLEiW8dEAGRlD9M2AzyyA+Q29WJP/FntDCbP22DeON91UA==",
+    "node_modules/remark-lint-unordered-list-marker-style/node_modules/unist-util-visit-parents": {
+      "version": "5.1.3",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
+      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
       "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "unified": "^10.0.0",
-        "unified-lint-rule": "^2.0.0",
-        "unist-util-generated": "^2.0.0",
-        "unist-util-position": "^4.0.0",
-        "unist-util-visit": "^4.0.0"
+        "@types/unist": "^2.0.0",
+        "unist-util-is": "^5.0.0"
       },
       "funding": {
         "type": "opencollective",
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/remark-lint-unordered-list-marker-style/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+    "node_modules/remark-lint/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
+        "@types/unist": "^2"
       }
     },
+    "node_modules/remark-lint/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/remark-lint/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
@@ -2879,6 +5584,19 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/remark-message-control/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-message-control/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/remark-message-control/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
@@ -2898,31 +5616,14 @@
       }
     },
     "node_modules/remark-parse": {
-      "version": "10.0.2",
-      "resolved": "https://registry.npmjs.org/remark-parse/-/remark-parse-10.0.2.tgz",
-      "integrity": "sha512-3ydxgHa/ZQzG8LvC7jTXccARYDcRld3VfcgIIFs7bI6vbRSxJJmzgLEIIoYKyrfhaY+ujuWaf/PJiMZXoiCXgw==",
-      "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "mdast-util-from-markdown": "^1.0.0",
-        "unified": "^10.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
-    "node_modules/remark-parse/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "version": "11.0.0",
+      "resolved": "https://registry.npmjs.org/remark-parse/-/remark-parse-11.0.0.tgz",
+      "integrity": "sha512-FCxlKLNGknS5ba/1lmpYijMUzX2esxW5xQqjWxw2eHFfS2MSdaHVINFmhjo+qN1WhZhNimq0dZATN9pH0IDrpA==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "@types/mdast": "^4.0.0",
+        "mdast-util-from-markdown": "^2.0.0",
+        "micromark-util-types": "^2.0.0",
+        "unified": "^11.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -2930,48 +5631,48 @@
       }
     },
     "node_modules/remark-preset-lint-node": {
-      "version": "4.0.0",
-      "resolved": "https://registry.npmjs.org/remark-preset-lint-node/-/remark-preset-lint-node-4.0.0.tgz",
-      "integrity": "sha512-r1n+NkNnzAV/QawwfxngfNO7oTpgVwy2OXYp6X6ETDAO9JFBKog2R/goORGf5THgNQCpwhHs2FVxTWWcO4Z6kQ==",
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/remark-preset-lint-node/-/remark-preset-lint-node-5.0.0.tgz",
+      "integrity": "sha512-E8q3jgNVuhm738oQV7dLNEukO1JVIgYuNoNdn4hliVYdrjJY3zJdsntJbUzZqMmBopcMAy3HwOwwHWz7C0Qsvw==",
       "dependencies": {
         "js-yaml": "^4.1.0",
-        "remark-gfm": "^3.0.1",
-        "remark-lint-blockquote-indentation": "^3.1.1",
-        "remark-lint-checkbox-character-style": "^4.1.1",
-        "remark-lint-checkbox-content-indent": "^4.1.1",
-        "remark-lint-code-block-style": "^3.1.0",
-        "remark-lint-definition-spacing": "^3.1.1",
-        "remark-lint-fenced-code-flag": "^3.1.1",
-        "remark-lint-fenced-code-marker": "^3.1.1",
-        "remark-lint-file-extension": "^2.1.1",
-        "remark-lint-final-definition": "^3.1.1",
-        "remark-lint-first-heading-level": "^3.1.1",
-        "remark-lint-heading-style": "^3.1.1",
-        "remark-lint-list-item-indent": "^3.1.1",
-        "remark-lint-maximum-line-length": "^3.1.2",
-        "remark-lint-no-consecutive-blank-lines": "^4.1.2",
-        "remark-lint-no-file-name-articles": "^2.1.1",
-        "remark-lint-no-file-name-consecutive-dashes": "^2.1.1",
-        "remark-lint-no-file-name-outer-dashes": "^2.1.1",
-        "remark-lint-no-heading-indent": "^4.1.1",
-        "remark-lint-no-multiple-toplevel-headings": "^3.1.1",
-        "remark-lint-no-shell-dollars": "^3.1.1",
-        "remark-lint-no-table-indentation": "^4.1.1",
-        "remark-lint-no-tabs": "^3.1.1",
+        "remark-gfm": "^4.0.0",
+        "remark-lint-blockquote-indentation": "^3.1.2",
+        "remark-lint-checkbox-character-style": "^4.1.2",
+        "remark-lint-checkbox-content-indent": "^4.1.2",
+        "remark-lint-code-block-style": "^3.1.2",
+        "remark-lint-definition-spacing": "^3.1.2",
+        "remark-lint-fenced-code-flag": "^3.1.2",
+        "remark-lint-fenced-code-marker": "^3.1.2",
+        "remark-lint-file-extension": "^2.1.2",
+        "remark-lint-final-definition": "^3.1.2",
+        "remark-lint-first-heading-level": "^3.1.2",
+        "remark-lint-heading-style": "^3.1.2",
+        "remark-lint-list-item-indent": "^3.1.2",
+        "remark-lint-maximum-line-length": "^3.1.3",
+        "remark-lint-no-consecutive-blank-lines": "^4.1.3",
+        "remark-lint-no-file-name-articles": "^2.1.2",
+        "remark-lint-no-file-name-consecutive-dashes": "^2.1.2",
+        "remark-lint-no-file-name-outer-dashes": "^2.1.2",
+        "remark-lint-no-heading-indent": "^4.1.2",
+        "remark-lint-no-multiple-toplevel-headings": "^3.1.2",
+        "remark-lint-no-shell-dollars": "^3.1.2",
+        "remark-lint-no-table-indentation": "^4.1.2",
+        "remark-lint-no-tabs": "^3.1.2",
         "remark-lint-no-trailing-spaces": "^2.0.1",
         "remark-lint-prohibited-strings": "^3.1.0",
-        "remark-lint-rule-style": "^3.1.1",
-        "remark-lint-strong-marker": "^3.1.1",
-        "remark-lint-table-cell-padding": "^4.1.2",
-        "remark-lint-table-pipes": "^4.1.1",
-        "remark-lint-unordered-list-marker-style": "^3.1.1",
-        "remark-preset-lint-recommended": "^6.1.2",
-        "semver": "^7.3.5",
-        "unified-lint-rule": "^2.1.1",
-        "unist-util-visit": "^4.1.2"
+        "remark-lint-rule-style": "^3.1.2",
+        "remark-lint-strong-marker": "^3.1.2",
+        "remark-lint-table-cell-padding": "^4.1.3",
+        "remark-lint-table-pipes": "^4.1.2",
+        "remark-lint-unordered-list-marker-style": "^3.1.2",
+        "remark-preset-lint-recommended": "^6.1.3",
+        "semver": "^7.5.4",
+        "unified-lint-rule": "^2.1.2",
+        "unist-util-visit": "^5.0.0"
       },
       "engines": {
-        "node": ">=12.0.0"
+        "node": ">=18.0.0"
       }
     },
     "node_modules/remark-preset-lint-recommended": {
@@ -3002,6 +5703,19 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/remark-preset-lint-recommended/node_modules/@types/mdast": {
+      "version": "3.0.13",
+      "resolved": "https://registry.npmjs.org/@types/mdast/-/mdast-3.0.13.tgz",
+      "integrity": "sha512-HjiGiWedR0DVFkeNljpa6Lv4/IZU1+30VY5d747K7lBudFc3R0Ibr6yJ9lN3BE28VnZyDfLF/VB1Ql1ZIbKrmg==",
+      "dependencies": {
+        "@types/unist": "^2"
+      }
+    },
+    "node_modules/remark-preset-lint-recommended/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/remark-preset-lint-recommended/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
@@ -3021,31 +5735,13 @@
       }
     },
     "node_modules/remark-stringify": {
-      "version": "10.0.3",
-      "resolved": "https://registry.npmjs.org/remark-stringify/-/remark-stringify-10.0.3.tgz",
-      "integrity": "sha512-koyOzCMYoUHudypbj4XpnAKFbkddRMYZHwghnxd7ue5210WzGw6kOBwauJTRUMq16jsovXx8dYNvSSWP89kZ3A==",
-      "dependencies": {
-        "@types/mdast": "^3.0.0",
-        "mdast-util-to-markdown": "^1.0.0",
-        "unified": "^10.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
-    "node_modules/remark-stringify/node_modules/unified": {
-      "version": "10.1.2",
-      "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
-      "integrity": "sha512-pUSWAi/RAnVy1Pif2kAoeWNBa3JVrx0MId2LASj8G+7AiHWoKZNTomq6LG326T68U7/e263X6fTdcXIy7XnF7Q==",
+      "version": "11.0.0",
+      "resolved": "https://registry.npmjs.org/remark-stringify/-/remark-stringify-11.0.0.tgz",
+      "integrity": "sha512-1OSmLd3awB/t8qdoEOMazZkNsfVTeY4fTsgzcQFdXNq8ToTN4ZGwrMnlda4K6smTFKD+GRV6O48i6Z4iKgPPpw==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "bail": "^2.0.0",
-        "extend": "^3.0.0",
-        "is-buffer": "^2.0.0",
-        "is-plain-obj": "^4.0.0",
-        "trough": "^2.0.0",
-        "vfile": "^5.0.0"
+        "@types/mdast": "^4.0.0",
+        "mdast-util-to-markdown": "^2.0.0",
+        "unified": "^11.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -3053,9 +5749,9 @@
       }
     },
     "node_modules/resolve": {
-      "version": "1.22.4",
-      "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.22.4.tgz",
-      "integrity": "sha512-PXNdCiPqDqeUou+w1C2eTQbNfxKSuMxqTCuvlmmMsk1NWHL5fRrhY6Pl0qEYYc6+QqGClco1Qj8XnjPego4wfg==",
+      "version": "1.22.6",
+      "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.22.6.tgz",
+      "integrity": "sha512-njhxM7mV12JfufShqGy3Rz8j11RPdLy4xi15UurGJeoHLfJpVXKdh3ueuOqbYUcDZnffr6X739JBo5LzyahEsw==",
       "dev": true,
       "dependencies": {
         "is-core-module": "^2.13.0",
@@ -3070,18 +5766,30 @@
       }
     },
     "node_modules/rollup": {
-      "version": "3.29.0",
-      "resolved": "https://registry.npmjs.org/rollup/-/rollup-3.29.0.tgz",
-      "integrity": "sha512-nszM8DINnx1vSS+TpbWKMkxem0CDWk3cSit/WWCBVs9/JZ1I/XLwOsiUglYuYReaeWWSsW9kge5zE5NZtf/a4w==",
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/rollup/-/rollup-4.0.2.tgz",
+      "integrity": "sha512-MCScu4usMPCeVFaiLcgMDaBQeYi1z6vpWxz0r0hq0Hv77Y2YuOTZldkuNJ54BdYBH3e+nkrk6j0Rre/NLDBYzg==",
       "dev": true,
       "bin": {
         "rollup": "dist/bin/rollup"
       },
       "engines": {
-        "node": ">=14.18.0",
+        "node": ">=18.0.0",
         "npm": ">=8.0.0"
       },
       "optionalDependencies": {
+        "@rollup/rollup-android-arm-eabi": "4.0.2",
+        "@rollup/rollup-android-arm64": "4.0.2",
+        "@rollup/rollup-darwin-arm64": "4.0.2",
+        "@rollup/rollup-darwin-x64": "4.0.2",
+        "@rollup/rollup-linux-arm-gnueabihf": "4.0.2",
+        "@rollup/rollup-linux-arm64-gnu": "4.0.2",
+        "@rollup/rollup-linux-arm64-musl": "4.0.2",
+        "@rollup/rollup-linux-x64-gnu": "4.0.2",
+        "@rollup/rollup-linux-x64-musl": "4.0.2",
+        "@rollup/rollup-win32-arm64-msvc": "4.0.2",
+        "@rollup/rollup-win32-ia32-msvc": "4.0.2",
+        "@rollup/rollup-win32-x64-msvc": "4.0.2",
         "fsevents": "~2.3.2"
       }
     },
@@ -3227,23 +5935,6 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/to-vfile/node_modules/@types/unist": {
-      "version": "3.0.0",
-      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-3.0.0.tgz",
-      "integrity": "sha512-MFETx3tbTjE7Uk6vvnWINA/1iJ7LuMdO4fcq8UfF0pRbj01aGLduVvQcRyswuACJdpnHgg8E3rQLhaRdNEJS0w=="
-    },
-    "node_modules/to-vfile/node_modules/unist-util-stringify-position": {
-      "version": "4.0.0",
-      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-4.0.0.tgz",
-      "integrity": "sha512-0ASV06AAoKCDkS2+xw5RXJywruurpbC4JZSm7nr7MOt1ojAzvyyaO+UxZf18j8FCF6kmzCZKcAgN/yu2gm2XgQ==",
-      "dependencies": {
-        "@types/unist": "^3.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
     "node_modules/to-vfile/node_modules/vfile": {
       "version": "6.0.1",
       "resolved": "https://registry.npmjs.org/vfile/-/vfile-6.0.1.tgz",
@@ -3313,6 +6004,11 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/unified-lint-rule/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/unified-lint-rule/node_modules/unified": {
       "version": "10.1.2",
       "resolved": "https://registry.npmjs.org/unified/-/unified-10.1.2.tgz",
@@ -3348,6 +6044,23 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/unified-message-control/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/unified-message-control/node_modules/unist-util-is": {
+      "version": "5.2.1",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
+      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
     "node_modules/unified-message-control/node_modules/unist-util-visit": {
       "version": "3.1.0",
       "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-3.1.0.tgz",
@@ -3375,23 +6088,6 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/unified/node_modules/@types/unist": {
-      "version": "3.0.0",
-      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-3.0.0.tgz",
-      "integrity": "sha512-MFETx3tbTjE7Uk6vvnWINA/1iJ7LuMdO4fcq8UfF0pRbj01aGLduVvQcRyswuACJdpnHgg8E3rQLhaRdNEJS0w=="
-    },
-    "node_modules/unified/node_modules/unist-util-stringify-position": {
-      "version": "4.0.0",
-      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-4.0.0.tgz",
-      "integrity": "sha512-0ASV06AAoKCDkS2+xw5RXJywruurpbC4JZSm7nr7MOt1ojAzvyyaO+UxZf18j8FCF6kmzCZKcAgN/yu2gm2XgQ==",
-      "dependencies": {
-        "@types/unist": "^3.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
     "node_modules/unified/node_modules/vfile": {
       "version": "6.0.1",
       "resolved": "https://registry.npmjs.org/vfile/-/vfile-6.0.1.tgz",
@@ -3429,11 +6125,11 @@
       }
     },
     "node_modules/unist-util-is": {
-      "version": "5.2.1",
-      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-5.2.1.tgz",
-      "integrity": "sha512-u9njyyfEh43npf1M+yGKDGVPbY/JWEemg5nH05ncKPfi+kBbKBJoTdsogMu33uhytuLlv9y0O7GH7fEdwLdLQw==",
+      "version": "6.0.0",
+      "resolved": "https://registry.npmjs.org/unist-util-is/-/unist-util-is-6.0.0.tgz",
+      "integrity": "sha512-2qCTHimwdxLfz+YzdGfkqNlH0tLi9xjTnHddPmJwtIG9MGsdbutfTc4P+haPD7l7Cjxf/WZj+we5qfVPvvxfYw==",
       "dependencies": {
-        "@types/unist": "^2.0.0"
+        "@types/unist": "^3.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -3452,12 +6148,17 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/unist-util-position/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/unist-util-stringify-position": {
-      "version": "3.0.3",
-      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-3.0.3.tgz",
-      "integrity": "sha512-k5GzIBZ/QatR8N5X2y+drfpWG8IDBzdnVj6OInRNWm1oXrzydiaAT2OQiA8DPRRZyAKb9b6I2a6PxYklZD0gKg==",
+      "version": "4.0.0",
+      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-4.0.0.tgz",
+      "integrity": "sha512-0ASV06AAoKCDkS2+xw5RXJywruurpbC4JZSm7nr7MOt1ojAzvyyaO+UxZf18j8FCF6kmzCZKcAgN/yu2gm2XgQ==",
       "dependencies": {
-        "@types/unist": "^2.0.0"
+        "@types/unist": "^3.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -3465,13 +6166,13 @@
       }
     },
     "node_modules/unist-util-visit": {
-      "version": "4.1.2",
-      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-4.1.2.tgz",
-      "integrity": "sha512-MSd8OUGISqHdVvfY9TPhyK2VdUrPgxkUtWSuMHF6XAAFuL4LokseigBnZtPnJMu+FbynTkFNnFlyjxpVKujMRg==",
+      "version": "5.0.0",
+      "resolved": "https://registry.npmjs.org/unist-util-visit/-/unist-util-visit-5.0.0.tgz",
+      "integrity": "sha512-MR04uvD+07cwl/yhVuVWAtw+3GOR/knlL55Nd/wAdblk27GCVt3lqpTivy/tkJcZoNPzTwS1Y+KMojlLDhoTzg==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "unist-util-is": "^5.0.0",
-        "unist-util-visit-parents": "^5.1.1"
+        "@types/unist": "^3.0.0",
+        "unist-util-is": "^6.0.0",
+        "unist-util-visit-parents": "^6.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -3479,12 +6180,12 @@
       }
     },
     "node_modules/unist-util-visit-parents": {
-      "version": "5.1.3",
-      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-5.1.3.tgz",
-      "integrity": "sha512-x6+y8g7wWMyQhL1iZfhIPhDAs7Xwbn9nRosDXl7qoPTSCy0yNxnKc+hWokFifWQIDGi154rdUqKvbCa4+1kLhg==",
+      "version": "6.0.1",
+      "resolved": "https://registry.npmjs.org/unist-util-visit-parents/-/unist-util-visit-parents-6.0.1.tgz",
+      "integrity": "sha512-L/PqWzfTP9lzzEa6CKs0k2nARxTdZduw3zyh8d2NVBnsyvHjSX4TWse388YrrQKbvI8w20fGjGlhgT96WwKykw==",
       "dependencies": {
-        "@types/unist": "^2.0.0",
-        "unist-util-is": "^5.0.0"
+        "@types/unist": "^3.0.0",
+        "unist-util-is": "^6.0.0"
       },
       "funding": {
         "type": "opencollective",
@@ -3536,6 +6237,11 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/vfile-location/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
     "node_modules/vfile-message": {
       "version": "3.1.4",
       "resolved": "https://registry.npmjs.org/vfile-message/-/vfile-message-3.1.4.tgz",
@@ -3549,6 +6255,23 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/vfile-message/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/vfile-message/node_modules/unist-util-stringify-position": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-3.0.3.tgz",
+      "integrity": "sha512-k5GzIBZ/QatR8N5X2y+drfpWG8IDBzdnVj6OInRNWm1oXrzydiaAT2OQiA8DPRRZyAKb9b6I2a6PxYklZD0gKg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
     "node_modules/vfile-reporter": {
       "version": "8.1.0",
       "resolved": "https://registry.npmjs.org/vfile-reporter/-/vfile-reporter-8.1.0.tgz",
@@ -3568,23 +6291,6 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/vfile-reporter/node_modules/@types/unist": {
-      "version": "3.0.0",
-      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-3.0.0.tgz",
-      "integrity": "sha512-MFETx3tbTjE7Uk6vvnWINA/1iJ7LuMdO4fcq8UfF0pRbj01aGLduVvQcRyswuACJdpnHgg8E3rQLhaRdNEJS0w=="
-    },
-    "node_modules/vfile-reporter/node_modules/unist-util-stringify-position": {
-      "version": "4.0.0",
-      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-4.0.0.tgz",
-      "integrity": "sha512-0ASV06AAoKCDkS2+xw5RXJywruurpbC4JZSm7nr7MOt1ojAzvyyaO+UxZf18j8FCF6kmzCZKcAgN/yu2gm2XgQ==",
-      "dependencies": {
-        "@types/unist": "^3.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
     "node_modules/vfile-reporter/node_modules/vfile": {
       "version": "6.0.1",
       "resolved": "https://registry.npmjs.org/vfile/-/vfile-6.0.1.tgz",
@@ -3625,23 +6331,6 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/vfile-sort/node_modules/@types/unist": {
-      "version": "3.0.0",
-      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-3.0.0.tgz",
-      "integrity": "sha512-MFETx3tbTjE7Uk6vvnWINA/1iJ7LuMdO4fcq8UfF0pRbj01aGLduVvQcRyswuACJdpnHgg8E3rQLhaRdNEJS0w=="
-    },
-    "node_modules/vfile-sort/node_modules/unist-util-stringify-position": {
-      "version": "4.0.0",
-      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-4.0.0.tgz",
-      "integrity": "sha512-0ASV06AAoKCDkS2+xw5RXJywruurpbC4JZSm7nr7MOt1ojAzvyyaO+UxZf18j8FCF6kmzCZKcAgN/yu2gm2XgQ==",
-      "dependencies": {
-        "@types/unist": "^3.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
     "node_modules/vfile-sort/node_modules/vfile": {
       "version": "6.0.1",
       "resolved": "https://registry.npmjs.org/vfile/-/vfile-6.0.1.tgz",
@@ -3682,23 +6371,6 @@
         "url": "https://opencollective.com/unified"
       }
     },
-    "node_modules/vfile-statistics/node_modules/@types/unist": {
-      "version": "3.0.0",
-      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-3.0.0.tgz",
-      "integrity": "sha512-MFETx3tbTjE7Uk6vvnWINA/1iJ7LuMdO4fcq8UfF0pRbj01aGLduVvQcRyswuACJdpnHgg8E3rQLhaRdNEJS0w=="
-    },
-    "node_modules/vfile-statistics/node_modules/unist-util-stringify-position": {
-      "version": "4.0.0",
-      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-4.0.0.tgz",
-      "integrity": "sha512-0ASV06AAoKCDkS2+xw5RXJywruurpbC4JZSm7nr7MOt1ojAzvyyaO+UxZf18j8FCF6kmzCZKcAgN/yu2gm2XgQ==",
-      "dependencies": {
-        "@types/unist": "^3.0.0"
-      },
-      "funding": {
-        "type": "opencollective",
-        "url": "https://opencollective.com/unified"
-      }
-    },
     "node_modules/vfile-statistics/node_modules/vfile": {
       "version": "6.0.1",
       "resolved": "https://registry.npmjs.org/vfile/-/vfile-6.0.1.tgz",
@@ -3726,6 +6398,23 @@
         "url": "https://opencollective.com/unified"
       }
     },
+    "node_modules/vfile/node_modules/@types/unist": {
+      "version": "2.0.8",
+      "resolved": "https://registry.npmjs.org/@types/unist/-/unist-2.0.8.tgz",
+      "integrity": "sha512-d0XxK3YTObnWVp6rZuev3c49+j4Lo8g4L1ZRm9z5L0xpoZycUPshHgczK5gsUMaZOstjVYYi09p5gYvUtfChYw=="
+    },
+    "node_modules/vfile/node_modules/unist-util-stringify-position": {
+      "version": "3.0.3",
+      "resolved": "https://registry.npmjs.org/unist-util-stringify-position/-/unist-util-stringify-position-3.0.3.tgz",
+      "integrity": "sha512-k5GzIBZ/QatR8N5X2y+drfpWG8IDBzdnVj6OInRNWm1oXrzydiaAT2OQiA8DPRRZyAKb9b6I2a6PxYklZD0gKg==",
+      "dependencies": {
+        "@types/unist": "^2.0.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/unified"
+      }
+    },
     "node_modules/wrapped": {
       "version": "1.0.1",
       "resolved": "https://registry.npmjs.org/wrapped/-/wrapped-1.0.1.tgz",
diff --git a/tools/lint-md/package.json b/tools/lint-md/package.json
index 34ab76997c86e9..0255adedd42373 100644
--- a/tools/lint-md/package.json
+++ b/tools/lint-md/package.json
@@ -6,17 +6,17 @@
     "build": "rollup -f es -p '@rollup/plugin-node-resolve={exportConditions: [\"node\"]}'  -p @rollup/plugin-commonjs -p rollup-plugin-cleanup lint-md.src.mjs --file lint-md.mjs"
   },
   "dependencies": {
-    "remark-parse": "^10.0.2",
-    "remark-preset-lint-node": "^4.0.0",
-    "remark-stringify": "^10.0.3",
+    "remark-parse": "^11.0.0",
+    "remark-preset-lint-node": "^5.0.0",
+    "remark-stringify": "^11.0.0",
     "to-vfile": "^8.0.0",
     "unified": "^11.0.3",
     "vfile-reporter": "^8.1.0"
   },
   "devDependencies": {
-    "@rollup/plugin-commonjs": "^25.0.4",
-    "@rollup/plugin-node-resolve": "^15.2.1",
-    "rollup": "^3.29.0",
+    "@rollup/plugin-commonjs": "^25.0.5",
+    "@rollup/plugin-node-resolve": "^15.2.2",
+    "rollup": "^4.0.2",
     "rollup-plugin-cleanup": "^3.2.1"
   }
 }
diff --git a/tools/node_modules/eslint/bin/eslint.js b/tools/node_modules/eslint/bin/eslint.js
index 7094ac77bc4bda..5c7972cc086eb7 100755
--- a/tools/node_modules/eslint/bin/eslint.js
+++ b/tools/node_modules/eslint/bin/eslint.js
@@ -92,6 +92,14 @@ function getErrorMessage(error) {
     return util.format("%o", error);
 }
 
+/**
+ * Tracks error messages that are shown to the user so we only ever show the
+ * same message once.
+ * @type {Set<string>}
+ */
+
+const displayedErrors = new Set();
+
 /**
  * Catch and report unexpected error.
  * @param {any} error The thrown error object.
@@ -101,14 +109,17 @@ function onFatalError(error) {
     process.exitCode = 2;
 
     const { version } = require("../package.json");
-    const message = getErrorMessage(error);
-
-    console.error(`
+    const message = `
 Oops! Something went wrong! :(
 
 ESLint: ${version}
 
-${message}`);
+${getErrorMessage(error)}`;
+
+    if (!displayedErrors.has(message)) {
+        console.error(message);
+        displayedErrors.add(message);
+    }
 }
 
 //------------------------------------------------------------------------------
diff --git a/tools/node_modules/eslint/lib/cli.js b/tools/node_modules/eslint/lib/cli.js
index a14930e9b0f244..807d28a0d1bc59 100644
--- a/tools/node_modules/eslint/lib/cli.js
+++ b/tools/node_modules/eslint/lib/cli.js
@@ -91,7 +91,8 @@ async function translateOptions({
     reportUnusedDisableDirectives,
     resolvePluginsRelativeTo,
     rule,
-    rulesdir
+    rulesdir,
+    warnIgnored
 }, configType) {
 
     let overrideConfig, overrideConfigFile;
@@ -182,6 +183,7 @@ async function translateOptions({
 
     if (configType === "flat") {
         options.ignorePatterns = ignorePattern;
+        options.warnIgnored = warnIgnored;
     } else {
         options.resolvePluginsRelativeTo = resolvePluginsRelativeTo;
         options.rulePaths = rulesdir;
@@ -385,7 +387,9 @@ const cli = {
         if (useStdin) {
             results = await engine.lintText(text, {
                 filePath: options.stdinFilename,
-                warnIgnored: true
+
+                // flatConfig respects CLI flag and constructor warnIgnored, eslintrc forces true for backwards compatibility
+                warnIgnored: usingFlatConfig ? void 0 : true
             });
         } else {
             results = await engine.lintFiles(files);
diff --git a/tools/node_modules/eslint/lib/config/flat-config-schema.js b/tools/node_modules/eslint/lib/config/flat-config-schema.js
index 3922e8a94fe7bd..df850995d87ff0 100644
--- a/tools/node_modules/eslint/lib/config/flat-config-schema.js
+++ b/tools/node_modules/eslint/lib/config/flat-config-schema.js
@@ -179,9 +179,7 @@ class InvalidRuleSeverityError extends Error {
  * @throws {InvalidRuleSeverityError} If the value isn't a valid rule severity.
  */
 function assertIsRuleSeverity(ruleId, value) {
-    const severity = typeof value === "string"
-        ? ruleSeverities.get(value.toLowerCase())
-        : ruleSeverities.get(value);
+    const severity = ruleSeverities.get(value);
 
     if (typeof severity === "undefined") {
         throw new InvalidRuleSeverityError(ruleId, value);
@@ -507,7 +505,7 @@ const eslintrcKeys = [
 // Full schema
 //-----------------------------------------------------------------------------
 
-exports.flatConfigSchema = {
+const flatConfigSchema = {
 
     // eslintrc-style keys that should always error
     ...Object.fromEntries(eslintrcKeys.map(key => [key, createEslintrcErrorSchema(key)])),
@@ -533,3 +531,13 @@ exports.flatConfigSchema = {
     plugins: pluginsSchema,
     rules: rulesSchema
 };
+
+//-----------------------------------------------------------------------------
+// Exports
+//-----------------------------------------------------------------------------
+
+module.exports = {
+    flatConfigSchema,
+    assertIsRuleSeverity,
+    assertIsRuleOptions
+};
diff --git a/tools/node_modules/eslint/lib/eslint/eslint-helpers.js b/tools/node_modules/eslint/lib/eslint/eslint-helpers.js
index e25b10e8bc4e10..72828363c3da3d 100644
--- a/tools/node_modules/eslint/lib/eslint/eslint-helpers.js
+++ b/tools/node_modules/eslint/lib/eslint/eslint-helpers.js
@@ -594,9 +594,9 @@ function createIgnoreResult(filePath, baseDir) {
     const isInNodeModules = baseDir && path.dirname(path.relative(baseDir, filePath)).split(path.sep).includes("node_modules");
 
     if (isInNodeModules) {
-        message = "File ignored by default because it is located under the node_modules directory. Use ignore pattern \"!**/node_modules/\" to override.";
+        message = "File ignored by default because it is located under the node_modules directory. Use ignore pattern \"!**/node_modules/\" to disable file ignore settings or use \"--no-warn-ignored\" to suppress this warning.";
     } else {
-        message = "File ignored because of a matching ignore pattern. Use \"--no-ignore\" to override.";
+        message = "File ignored because of a matching ignore pattern. Use \"--no-ignore\" to disable file ignore settings or use \"--no-warn-ignored\" to suppress this warning.";
     }
 
     return {
@@ -676,6 +676,7 @@ function processOptions({
     overrideConfigFile = null,
     plugins = {},
     reportUnusedDisableDirectives = null, // ← should be null by default because if it's a string then it overrides the 'reportUnusedDisableDirectives' setting in config files. And we cannot use `overrideConfig.reportUnusedDisableDirectives` instead because we cannot configure the `error` severity with that.
+    warnIgnored = true,
     ...unknownOptions
 }) {
     const errors = [];
@@ -781,6 +782,9 @@ function processOptions({
     ) {
         errors.push("'reportUnusedDisableDirectives' must be any of \"error\", \"warn\", \"off\", and null.");
     }
+    if (typeof warnIgnored !== "boolean") {
+        errors.push("'warnIgnored' must be a boolean.");
+    }
     if (errors.length > 0) {
         throw new ESLintInvalidOptionsError(errors);
     }
@@ -802,7 +806,8 @@ function processOptions({
         globInputPaths,
         ignore,
         ignorePatterns,
-        reportUnusedDisableDirectives
+        reportUnusedDisableDirectives,
+        warnIgnored
     };
 }
 
diff --git a/tools/node_modules/eslint/lib/eslint/flat-eslint.js b/tools/node_modules/eslint/lib/eslint/flat-eslint.js
index 4ef38611361620..306c80de1d659e 100644
--- a/tools/node_modules/eslint/lib/eslint/flat-eslint.js
+++ b/tools/node_modules/eslint/lib/eslint/flat-eslint.js
@@ -84,6 +84,7 @@ const LintResultCache = require("../cli-engine/lint-result-cache");
  *      when a string.
  * @property {Record<string,Plugin>} [plugins] An array of plugin implementations.
  * @property {"error" | "warn" | "off"} [reportUnusedDisableDirectives] the severity to report unused eslint-disable directives.
+ * @property {boolean} warnIgnored Show warnings when the file list includes ignored files
  */
 
 //------------------------------------------------------------------------------
@@ -749,7 +750,8 @@ class FlatESLint {
             fixTypes,
             reportUnusedDisableDirectives,
             globInputPaths,
-            errorOnUnmatchedPattern
+            errorOnUnmatchedPattern,
+            warnIgnored
         } = eslintOptions;
         const startTime = Date.now();
         const fixTypesSet = fixTypes ? new Set(fixTypes) : null;
@@ -795,7 +797,11 @@ class FlatESLint {
                  * pattern, then notify the user.
                  */
                 if (ignored) {
-                    return createIgnoreResult(filePath, cwd);
+                    if (warnIgnored) {
+                        return createIgnoreResult(filePath, cwd);
+                    }
+
+                    return void 0;
                 }
 
                 const config = configs.getConfig(filePath);
@@ -908,7 +914,7 @@ class FlatESLint {
 
         const {
             filePath,
-            warnIgnored = false,
+            warnIgnored,
             ...unknownOptions
         } = options || {};
 
@@ -922,7 +928,7 @@ class FlatESLint {
             throw new Error("'options.filePath' must be a non-empty string or undefined");
         }
 
-        if (typeof warnIgnored !== "boolean") {
+        if (typeof warnIgnored !== "boolean" && typeof warnIgnored !== "undefined") {
             throw new Error("'options.warnIgnored' must be a boolean or undefined");
         }
 
@@ -937,7 +943,8 @@ class FlatESLint {
             allowInlineConfig,
             cwd,
             fix,
-            reportUnusedDisableDirectives
+            reportUnusedDisableDirectives,
+            warnIgnored: constructorWarnIgnored
         } = eslintOptions;
         const results = [];
         const startTime = Date.now();
@@ -945,7 +952,9 @@ class FlatESLint {
 
         // Clear the last used config arrays.
         if (resolvedFilename && await this.isPathIgnored(resolvedFilename)) {
-            if (warnIgnored) {
+            const shouldWarnIgnored = typeof warnIgnored === "boolean" ? warnIgnored : constructorWarnIgnored;
+
+            if (shouldWarnIgnored) {
                 results.push(createIgnoreResult(resolvedFilename, cwd));
             }
         } else {
diff --git a/tools/node_modules/eslint/lib/linter/apply-disable-directives.js b/tools/node_modules/eslint/lib/linter/apply-disable-directives.js
index 13ced990ff485d..55f7683f3f53ac 100644
--- a/tools/node_modules/eslint/lib/linter/apply-disable-directives.js
+++ b/tools/node_modules/eslint/lib/linter/apply-disable-directives.js
@@ -87,7 +87,7 @@ function createIndividualDirectivesRemoval(directives, commentToken) {
     return directives.map(directive => {
         const { ruleId } = directive;
 
-        const regex = new RegExp(String.raw`(?:^|\s*,\s*)${escapeRegExp(ruleId)}(?:\s*,\s*|$)`, "u");
+        const regex = new RegExp(String.raw`(?:^|\s*,\s*)(?<quote>['"]?)${escapeRegExp(ruleId)}\k<quote>(?:\s*,\s*|$)`, "u");
         const match = regex.exec(listText);
         const matchedText = match[0];
         const matchStartOffset = listStartOffset + match.index;
diff --git a/tools/node_modules/eslint/lib/linter/code-path-analysis/code-path-state.js b/tools/node_modules/eslint/lib/linter/code-path-analysis/code-path-state.js
index d187297d32b0d3..2b0dc2bfca0403 100644
--- a/tools/node_modules/eslint/lib/linter/code-path-analysis/code-path-state.js
+++ b/tools/node_modules/eslint/lib/linter/code-path-analysis/code-path-state.js
@@ -12,13 +12,622 @@
 const CodePathSegment = require("./code-path-segment"),
     ForkContext = require("./fork-context");
 
+//-----------------------------------------------------------------------------
+// Contexts
+//-----------------------------------------------------------------------------
+
+/**
+ * Represents the context in which a `break` statement can be used.
+ *
+ * A `break` statement without a label is only valid in a few places in
+ * JavaScript: any type of loop or a `switch` statement. Otherwise, `break`
+ * without a label causes a syntax error. For these contexts, `breakable` is
+ * set to `true` to indicate that a `break` without a label is valid.
+ *
+ * However, a `break` statement with a label is also valid inside of a labeled
+ * statement. For example, this is valid:
+ *
+ *     a : {
+ *         break a;
+ *     }
+ *
+ * The `breakable` property is set false for labeled statements to indicate
+ * that `break` without a label is invalid.
+ */
+class BreakContext {
+
+    /**
+     * Creates a new instance.
+     * @param {BreakContext} upperContext The previous `BreakContext`.
+     * @param {boolean} breakable Indicates if we are inside a statement where
+     *      `break` without a label will exit the statement.
+     * @param {string|null} label The label for the statement.
+     * @param {ForkContext} forkContext The current fork context.
+     */
+    constructor(upperContext, breakable, label, forkContext) {
+
+        /**
+         * The previous `BreakContext`
+         * @type {BreakContext}
+         */
+        this.upper = upperContext;
+
+        /**
+         * Indicates if we are inside a statement where `break` without a label
+         * will exit the statement.
+         * @type {boolean}
+         */
+        this.breakable = breakable;
+
+        /**
+         * The label associated with the statement.
+         * @type {string|null}
+         */
+        this.label = label;
+
+        /**
+         * The fork context for the `break`.
+         * @type {ForkContext}
+         */
+        this.brokenForkContext = ForkContext.newEmpty(forkContext);
+    }
+}
+
+/**
+ * Represents the context for `ChainExpression` nodes.
+ */
+class ChainContext {
+
+    /**
+     * Creates a new instance.
+     * @param {ChainContext} upperContext The previous `ChainContext`.
+     */
+    constructor(upperContext) {
+
+        /**
+         * The previous `ChainContext`
+         * @type {ChainContext}
+         */
+        this.upper = upperContext;
+
+        /**
+         * The number of choice contexts inside of the `ChainContext`.
+         * @type {number}
+         */
+        this.choiceContextCount = 0;
+
+    }
+}
+
+/**
+ * Represents a choice in the code path.
+ *
+ * Choices are created by logical operators such as `&&`, loops, conditionals,
+ * and `if` statements. This is the point at which the code path has a choice of
+ * which direction to go.
+ *
+ * The result of a choice might be in the left (test) expression of another choice,
+ * and in that case, may create a new fork. For example, `a || b` is a choice
+ * but does not create a new fork because the result of the expression is
+ * not used as the test expression in another expression. In this case,
+ * `isForkingAsResult` is false. In the expression `a || b || c`, the `a || b`
+ * expression appears as the test expression for `|| c`, so the
+ * result of `a || b` creates a fork because execution may or may not
+ * continue to `|| c`. `isForkingAsResult` for `a || b` in this case is true
+ * while `isForkingAsResult` for `|| c` is false. (`isForkingAsResult` is always
+ * false for `if` statements, conditional expressions, and loops.)
+ *
+ * All of the choices except one (`??`) operate on a true/false fork, meaning if
+ * true go one way and if false go the other (tracked by `trueForkContext` and
+ * `falseForkContext`). The `??` operator doesn't operate on true/false because
+ * the left expression is evaluated to be nullish or not, so only if nullish do
+ * we fork to the right expression (tracked by `nullishForkContext`).
+ */
+class ChoiceContext {
+
+    /**
+     * Creates a new instance.
+     * @param {ChoiceContext} upperContext The previous `ChoiceContext`.
+     * @param {string} kind The kind of choice. If it's a logical or assignment expression, this
+     *      is `"&&"` or `"||"` or `"??"`; if it's an `if` statement or
+     *      conditional expression, this is `"test"`; otherwise, this is `"loop"`.
+     * @param {boolean} isForkingAsResult Indicates if the result of the choice
+     *      creates a fork.
+     * @param {ForkContext} forkContext The containing `ForkContext`.
+     */
+    constructor(upperContext, kind, isForkingAsResult, forkContext) {
+
+        /**
+         * The previous `ChoiceContext`
+         * @type {ChoiceContext}
+         */
+        this.upper = upperContext;
+
+        /**
+         * The kind of choice. If it's a logical or assignment expression, this
+         * is `"&&"` or `"||"` or `"??"`; if it's an `if` statement or
+         * conditional expression, this is `"test"`; otherwise, this is `"loop"`.
+         * @type {string}
+         */
+        this.kind = kind;
+
+        /**
+         * Indicates if the result of the choice forks the code path.
+         * @type {boolean}
+         */
+        this.isForkingAsResult = isForkingAsResult;
+
+        /**
+         * The fork context for the `true` path of the choice.
+         * @type {ForkContext}
+         */
+        this.trueForkContext = ForkContext.newEmpty(forkContext);
+
+        /**
+         * The fork context for the `false` path of the choice.
+         * @type {ForkContext}
+         */
+        this.falseForkContext = ForkContext.newEmpty(forkContext);
+
+        /**
+         * The fork context for when the choice result is `null` or `undefined`.
+         * @type {ForkContext}
+         */
+        this.nullishForkContext = ForkContext.newEmpty(forkContext);
+
+        /**
+         * Indicates if any of `trueForkContext`, `falseForkContext`, or
+         * `nullishForkContext` have been updated with segments from a child context.
+         * @type {boolean}
+         */
+        this.processed = false;
+    }
+
+}
+
+/**
+ * Base class for all loop contexts.
+ */
+class LoopContextBase {
+
+    /**
+     * Creates a new instance.
+     * @param {LoopContext|null} upperContext The previous `LoopContext`.
+     * @param {string} type The AST node's `type` for the loop.
+     * @param {string|null} label The label for the loop from an enclosing `LabeledStatement`.
+     * @param {BreakContext} breakContext The context for breaking the loop.
+     */
+    constructor(upperContext, type, label, breakContext) {
+
+        /**
+         * The previous `LoopContext`.
+         * @type {LoopContext}
+         */
+        this.upper = upperContext;
+
+        /**
+         * The AST node's `type` for the loop.
+         * @type {string}
+         */
+        this.type = type;
+
+        /**
+         * The label for the loop from an enclosing `LabeledStatement`.
+         * @type {string|null}
+         */
+        this.label = label;
+
+        /**
+         * The fork context for when `break` is encountered.
+         * @type {ForkContext}
+         */
+        this.brokenForkContext = breakContext.brokenForkContext;
+    }
+}
+
+/**
+ * Represents the context for a `while` loop.
+ */
+class WhileLoopContext extends LoopContextBase {
+
+    /**
+     * Creates a new instance.
+     * @param {LoopContext|null} upperContext The previous `LoopContext`.
+     * @param {string|null} label The label for the loop from an enclosing `LabeledStatement`.
+     * @param {BreakContext} breakContext The context for breaking the loop.
+     */
+    constructor(upperContext, label, breakContext) {
+        super(upperContext, "WhileStatement", label, breakContext);
+
+        /**
+         * The hardcoded literal boolean test condition for
+         * the loop. Used to catch infinite or skipped loops.
+         * @type {boolean|undefined}
+         */
+        this.test = void 0;
+
+        /**
+         * The segments representing the test condition where `continue` will
+         * jump to. The test condition will typically have just one segment but
+         * it's possible for there to be more than one.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.continueDestSegments = null;
+    }
+}
+
+/**
+ * Represents the context for a `do-while` loop.
+ */
+class DoWhileLoopContext extends LoopContextBase {
+
+    /**
+     * Creates a new instance.
+     * @param {LoopContext|null} upperContext The previous `LoopContext`.
+     * @param {string|null} label The label for the loop from an enclosing `LabeledStatement`.
+     * @param {BreakContext} breakContext The context for breaking the loop.
+     * @param {ForkContext} forkContext The enclosing fork context.
+     */
+    constructor(upperContext, label, breakContext, forkContext) {
+        super(upperContext, "DoWhileStatement", label, breakContext);
+
+        /**
+         * The hardcoded literal boolean test condition for
+         * the loop. Used to catch infinite or skipped loops.
+         * @type {boolean|undefined}
+         */
+        this.test = void 0;
+
+        /**
+         * The segments at the start of the loop body. This is the only loop
+         * where the test comes at the end, so the first iteration always
+         * happens and we need a reference to the first statements.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.entrySegments = null;
+
+        /**
+         * The fork context to follow when a `continue` is found.
+         * @type {ForkContext}
+         */
+        this.continueForkContext = ForkContext.newEmpty(forkContext);
+    }
+}
+
+/**
+ * Represents the context for a `for` loop.
+ */
+class ForLoopContext extends LoopContextBase {
+
+    /**
+     * Creates a new instance.
+     * @param {LoopContext|null} upperContext The previous `LoopContext`.
+     * @param {string|null} label The label for the loop from an enclosing `LabeledStatement`.
+     * @param {BreakContext} breakContext The context for breaking the loop.
+     */
+    constructor(upperContext, label, breakContext) {
+        super(upperContext, "ForStatement", label, breakContext);
+
+        /**
+         * The hardcoded literal boolean test condition for
+         * the loop. Used to catch infinite or skipped loops.
+         * @type {boolean|undefined}
+         */
+        this.test = void 0;
+
+        /**
+         * The end of the init expression. This may change during the lifetime
+         * of the instance as we traverse the loop because some loops don't have
+         * an init expression.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.endOfInitSegments = null;
+
+        /**
+         * The start of the test expression. This may change during the lifetime
+         * of the instance as we traverse the loop because some loops don't have
+         * a test expression.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.testSegments = null;
+
+        /**
+         * The end of the test expression. This may change during the lifetime
+         * of the instance as we traverse the loop because some loops don't have
+         * a test expression.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.endOfTestSegments = null;
+
+        /**
+         * The start of the update expression. This may change during the lifetime
+         * of the instance as we traverse the loop because some loops don't have
+         * an update expression.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.updateSegments = null;
+
+        /**
+         * The end of the update expresion. This may change during the lifetime
+         * of the instance as we traverse the loop because some loops don't have
+         * an update expression.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.endOfUpdateSegments = null;
+
+        /**
+         * The segments representing the test condition where `continue` will
+         * jump to. The test condition will typically have just one segment but
+         * it's possible for there to be more than one. This may change during the
+         * lifetime of the instance as we traverse the loop because some loops
+         * don't have an update expression. When there is an update expression, this
+         * will end up pointing to that expression; otherwise it will end up pointing
+         * to the test expression.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.continueDestSegments = null;
+    }
+}
+
+/**
+ * Represents the context for a `for-in` loop.
+ *
+ * Terminology:
+ * - "left" means the part of the loop to the left of the `in` keyword. For
+ *   example, in `for (var x in y)`, the left is `var x`.
+ * - "right" means the part of the loop to the right of the `in` keyword. For
+ *   example, in `for (var x in y)`, the right is `y`.
+ */
+class ForInLoopContext extends LoopContextBase {
+
+    /**
+     * Creates a new instance.
+     * @param {LoopContext|null} upperContext The previous `LoopContext`.
+     * @param {string|null} label The label for the loop from an enclosing `LabeledStatement`.
+     * @param {BreakContext} breakContext The context for breaking the loop.
+     */
+    constructor(upperContext, label, breakContext) {
+        super(upperContext, "ForInStatement", label, breakContext);
+
+        /**
+         * The segments that came immediately before the start of the loop.
+         * This allows you to traverse backwards out of the loop into the
+         * surrounding code. This is necessary to evaluate the right expression
+         * correctly, as it must be evaluated in the same way as the left
+         * expression, but the pointer to these segments would otherwise be
+         * lost if not stored on the instance. Once the right expression has
+         * been evaluated, this property is no longer used.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.prevSegments = null;
+
+        /**
+         * Segments representing the start of everything to the left of the
+         * `in` keyword. This can be used to move forward towards
+         * `endOfLeftSegments`. `leftSegments` and `endOfLeftSegments` are
+         * effectively the head and tail of a doubly-linked list.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.leftSegments = null;
+
+        /**
+         * Segments representing the end of everything to the left of the
+         * `in` keyword. This can be used to move backward towards `leftSegments`.
+         * `leftSegments` and `endOfLeftSegments` are effectively the head
+         * and tail of a doubly-linked list.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.endOfLeftSegments = null;
+
+        /**
+         * The segments representing the left expression where `continue` will
+         * jump to. In `for-in` loops, `continue` must always re-execute the
+         * left expression each time through the loop. This contains the same
+         * segments as `leftSegments`, but is duplicated here so each loop
+         * context has the same property pointing to where `continue` should
+         * end up.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.continueDestSegments = null;
+    }
+}
+
+/**
+ * Represents the context for a `for-of` loop.
+ */
+class ForOfLoopContext extends LoopContextBase {
+
+    /**
+     * Creates a new instance.
+     * @param {LoopContext|null} upperContext The previous `LoopContext`.
+     * @param {string|null} label The label for the loop from an enclosing `LabeledStatement`.
+     * @param {BreakContext} breakContext The context for breaking the loop.
+     */
+    constructor(upperContext, label, breakContext) {
+        super(upperContext, "ForOfStatement", label, breakContext);
+
+        /**
+         * The segments that came immediately before the start of the loop.
+         * This allows you to traverse backwards out of the loop into the
+         * surrounding code. This is necessary to evaluate the right expression
+         * correctly, as it must be evaluated in the same way as the left
+         * expression, but the pointer to these segments would otherwise be
+         * lost if not stored on the instance. Once the right expression has
+         * been evaluated, this property is no longer used.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.prevSegments = null;
+
+        /**
+         * Segments representing the start of everything to the left of the
+         * `of` keyword. This can be used to move forward towards
+         * `endOfLeftSegments`. `leftSegments` and `endOfLeftSegments` are
+         * effectively the head and tail of a doubly-linked list.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.leftSegments = null;
+
+        /**
+         * Segments representing the end of everything to the left of the
+         * `of` keyword. This can be used to move backward towards `leftSegments`.
+         * `leftSegments` and `endOfLeftSegments` are effectively the head
+         * and tail of a doubly-linked list.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.endOfLeftSegments = null;
+
+        /**
+         * The segments representing the left expression where `continue` will
+         * jump to. In `for-in` loops, `continue` must always re-execute the
+         * left expression each time through the loop. This contains the same
+         * segments as `leftSegments`, but is duplicated here so each loop
+         * context has the same property pointing to where `continue` should
+         * end up.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.continueDestSegments = null;
+    }
+}
+
+/**
+ * Represents the context for any loop.
+ * @typedef {WhileLoopContext|DoWhileLoopContext|ForLoopContext|ForInLoopContext|ForOfLoopContext} LoopContext
+ */
+
+/**
+ * Represents the context for a `switch` statement.
+ */
+class SwitchContext {
+
+    /**
+     * Creates a new instance.
+     * @param {SwitchContext} upperContext The previous context.
+     * @param {boolean} hasCase Indicates if there is at least one `case` statement.
+     *      `default` doesn't count.
+     */
+    constructor(upperContext, hasCase) {
+
+        /**
+         * The previous context.
+         * @type {SwitchContext}
+         */
+        this.upper = upperContext;
+
+        /**
+         * Indicates if there is at least one `case` statement. `default` doesn't count.
+         * @type {boolean}
+         */
+        this.hasCase = hasCase;
+
+        /**
+         * The `default` keyword.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.defaultSegments = null;
+
+        /**
+         * The default case body starting segments.
+         * @type {Array<CodePathSegment>|null}
+         */
+        this.defaultBodySegments = null;
+
+        /**
+         * Indicates if a `default` case and is empty exists.
+         * @type {boolean}
+         */
+        this.foundEmptyDefault = false;
+
+        /**
+         * Indicates that a `default` exists and is the last case.
+         * @type {boolean}
+         */
+        this.lastIsDefault = false;
+
+        /**
+         * The number of fork contexts created. This is equivalent to the
+         * number of `case` statements plus a `default` statement (if present).
+         * @type {number}
+         */
+        this.forkCount = 0;
+    }
+}
+
+/**
+ * Represents the context for a `try` statement.
+ */
+class TryContext {
+
+    /**
+     * Creates a new instance.
+     * @param {TryContext} upperContext The previous context.
+     * @param {boolean} hasFinalizer Indicates if the `try` statement has a
+     *      `finally` block.
+     * @param {ForkContext} forkContext The enclosing fork context.
+     */
+    constructor(upperContext, hasFinalizer, forkContext) {
+
+        /**
+         * The previous context.
+         * @type {TryContext}
+         */
+        this.upper = upperContext;
+
+        /**
+         * Indicates if the `try` statement has a `finally` block.
+         * @type {boolean}
+         */
+        this.hasFinalizer = hasFinalizer;
+
+        /**
+         * Tracks the traversal position inside of the `try` statement. This is
+         * used to help determine the context necessary to create paths because
+         * a `try` statement may or may not have `catch` or `finally` blocks,
+         * and code paths behave differently in those blocks.
+         * @type {"try"|"catch"|"finally"}
+         */
+        this.position = "try";
+
+        /**
+         * If the `try` statement has a `finally` block, this affects how a
+         * `return` statement behaves in the `try` block. Without `finally`,
+         * `return` behaves as usual and doesn't require a fork; with `finally`,
+         * `return` forks into the `finally` block, so we need a fork context
+         * to track it.
+         * @type {ForkContext|null}
+         */
+        this.returnedForkContext = hasFinalizer
+            ? ForkContext.newEmpty(forkContext)
+            : null;
+
+        /**
+         * When a `throw` occurs inside of a `try` block, the code path forks
+         * into the `catch` or `finally` blocks, and this fork context tracks
+         * that path.
+         * @type {ForkContext}
+         */
+        this.thrownForkContext = ForkContext.newEmpty(forkContext);
+
+        /**
+         * Indicates if the last segment in the `try` block is reachable.
+         * @type {boolean}
+         */
+        this.lastOfTryIsReachable = false;
+
+        /**
+         * Indicates if the last segment in the `catch` block is reachable.
+         * @type {boolean}
+         */
+        this.lastOfCatchIsReachable = false;
+    }
+}
+
 //------------------------------------------------------------------------------
 // Helpers
 //------------------------------------------------------------------------------
 
 /**
  * Adds given segments into the `dest` array.
- * If the `others` array does not includes the given segments, adds to the `all`
+ * If the `others` array does not include the given segments, adds to the `all`
  * array as well.
  *
  * This adds only reachable and used segments.
@@ -40,9 +649,9 @@ function addToReturnedOrThrown(dest, others, all, segments) {
 }
 
 /**
- * Gets a loop-context for a `continue` statement.
- * @param {CodePathState} state A state to get.
- * @param {string} label The label of a `continue` statement.
+ * Gets a loop context for a `continue` statement based on a given label.
+ * @param {CodePathState} state The state to search within.
+ * @param {string|null} label The label of a `continue` statement.
  * @returns {LoopContext} A loop-context for a `continue` statement.
  */
 function getContinueContext(state, label) {
@@ -65,9 +674,9 @@ function getContinueContext(state, label) {
 
 /**
  * Gets a context for a `break` statement.
- * @param {CodePathState} state A state to get.
- * @param {string} label The label of a `break` statement.
- * @returns {LoopContext|SwitchContext} A context for a `break` statement.
+ * @param {CodePathState} state The state to search within.
+ * @param {string|null} label The label of a `break` statement.
+ * @returns {BreakContext} A context for a `break` statement.
  */
 function getBreakContext(state, label) {
     let context = state.breakContext;
@@ -84,8 +693,10 @@ function getBreakContext(state, label) {
 }
 
 /**
- * Gets a context for a `return` statement.
- * @param {CodePathState} state A state to get.
+ * Gets a context for a `return` statement. There is just one special case:
+ * if there is a `try` statement with a `finally` block, because that alters
+ * how `return` behaves; otherwise, this just passes through the given state.
+ * @param {CodePathState} state The state to search within
  * @returns {TryContext|CodePathState} A context for a `return` statement.
  */
 function getReturnContext(state) {
@@ -102,8 +713,11 @@ function getReturnContext(state) {
 }
 
 /**
- * Gets a context for a `throw` statement.
- * @param {CodePathState} state A state to get.
+ * Gets a context for a `throw` statement. There is just one special case:
+ * if there is a `try` statement with a `finally` block and we are inside of
+ * a `catch` because that changes how `throw` behaves; otherwise, this just
+ * passes through the given state.
+ * @param {CodePathState} state The state to search within.
  * @returns {TryContext|CodePathState} A context for a `throw` statement.
  */
 function getThrowContext(state) {
@@ -122,13 +736,13 @@ function getThrowContext(state) {
 }
 
 /**
- * Removes a given element from a given array.
- * @param {any[]} xs An array to remove the specific element.
- * @param {any} x An element to be removed.
+ * Removes a given value from a given array.
+ * @param {any[]} elements An array to remove the specific element.
+ * @param {any} value The value to be removed.
  * @returns {void}
  */
-function remove(xs, x) {
-    xs.splice(xs.indexOf(x), 1);
+function removeFromArray(elements, value) {
+    elements.splice(elements.indexOf(value), 1);
 }
 
 /**
@@ -141,48 +755,77 @@ function remove(xs, x) {
  * @param {CodePathSegment[]} nextSegments Backward segments to disconnect.
  * @returns {void}
  */
-function removeConnection(prevSegments, nextSegments) {
+function disconnectSegments(prevSegments, nextSegments) {
     for (let i = 0; i < prevSegments.length; ++i) {
         const prevSegment = prevSegments[i];
         const nextSegment = nextSegments[i];
 
-        remove(prevSegment.nextSegments, nextSegment);
-        remove(prevSegment.allNextSegments, nextSegment);
-        remove(nextSegment.prevSegments, prevSegment);
-        remove(nextSegment.allPrevSegments, prevSegment);
+        removeFromArray(prevSegment.nextSegments, nextSegment);
+        removeFromArray(prevSegment.allNextSegments, nextSegment);
+        removeFromArray(nextSegment.prevSegments, prevSegment);
+        removeFromArray(nextSegment.allPrevSegments, prevSegment);
     }
 }
 
 /**
- * Creates looping path.
- * @param {CodePathState} state The instance.
+ * Creates looping path between two arrays of segments, ensuring that there are
+ * paths going between matching segments in the arrays.
+ * @param {CodePathState} state The state to operate on.
  * @param {CodePathSegment[]} unflattenedFromSegments Segments which are source.
  * @param {CodePathSegment[]} unflattenedToSegments Segments which are destination.
  * @returns {void}
  */
 function makeLooped(state, unflattenedFromSegments, unflattenedToSegments) {
+
     const fromSegments = CodePathSegment.flattenUnusedSegments(unflattenedFromSegments);
     const toSegments = CodePathSegment.flattenUnusedSegments(unflattenedToSegments);
-
     const end = Math.min(fromSegments.length, toSegments.length);
 
+    /*
+     * This loop effectively updates a doubly-linked list between two collections
+     * of segments making sure that segments in the same array indices are
+     * combined to create a path.
+     */
     for (let i = 0; i < end; ++i) {
+
+        // get the segments in matching array indices
         const fromSegment = fromSegments[i];
         const toSegment = toSegments[i];
 
+        /*
+         * If the destination segment is reachable, then create a path from the
+         * source segment to the destination segment.
+         */
         if (toSegment.reachable) {
             fromSegment.nextSegments.push(toSegment);
         }
+
+        /*
+         * If the source segment is reachable, then create a path from the
+         * destination segment back to the source segment.
+         */
         if (fromSegment.reachable) {
             toSegment.prevSegments.push(fromSegment);
         }
+
+        /*
+         * Also update the arrays that don't care if the segments are reachable
+         * or not. This should always happen regardless of anything else.
+         */
         fromSegment.allNextSegments.push(toSegment);
         toSegment.allPrevSegments.push(fromSegment);
 
+        /*
+         * If the destination segment has at least two previous segments in its
+         * path then that means there was one previous segment before this iteration
+         * of the loop was executed. So, we need to mark the source segment as
+         * looped.
+         */
         if (toSegment.allPrevSegments.length >= 2) {
             CodePathSegment.markPrevSegmentAsLooped(toSegment, fromSegment);
         }
 
+        // let the code path analyzer know that there's been a loop created
         state.notifyLooped(fromSegment, toSegment);
     }
 }
@@ -198,15 +841,27 @@ function makeLooped(state, unflattenedFromSegments, unflattenedToSegments) {
  * @returns {void}
  */
 function finalizeTestSegmentsOfFor(context, choiceContext, head) {
+
+    /*
+     * If this choice context doesn't already contain paths from a
+     * child context, then add the current head to each potential path.
+     */
     if (!choiceContext.processed) {
         choiceContext.trueForkContext.add(head);
         choiceContext.falseForkContext.add(head);
-        choiceContext.qqForkContext.add(head);
+        choiceContext.nullishForkContext.add(head);
     }
 
+    /*
+     * If the test condition isn't a hardcoded truthy value, then `break`
+     * must follow the same path as if the test condition is false. To represent
+     * that, we append the path for when the loop test is false (represented by
+     * `falseForkContext`) to the `brokenForkContext`.
+     */
     if (context.test !== true) {
         context.brokenForkContext.addAll(choiceContext.falseForkContext);
     }
+
     context.endOfTestSegments = choiceContext.trueForkContext.makeNext(0, -1);
 }
 
@@ -220,35 +875,124 @@ function finalizeTestSegmentsOfFor(context, choiceContext, head) {
 class CodePathState {
 
     /**
+     * Creates a new instance.
      * @param {IdGenerator} idGenerator An id generator to generate id for code
      *   path segments.
      * @param {Function} onLooped A callback function to notify looping.
      */
     constructor(idGenerator, onLooped) {
+
+        /**
+         * The ID generator to use when creating new segments.
+         * @type {IdGenerator}
+         */
         this.idGenerator = idGenerator;
+
+        /**
+         * A callback function to call when there is a loop.
+         * @type {Function}
+         */
         this.notifyLooped = onLooped;
+
+        /**
+         * The root fork context for this state.
+         * @type {ForkContext}
+         */
         this.forkContext = ForkContext.newRoot(idGenerator);
+
+        /**
+         * Context for logical expressions, conditional expressions, `if` statements,
+         * and loops.
+         * @type {ChoiceContext}
+         */
         this.choiceContext = null;
+
+        /**
+         * Context for `switch` statements.
+         * @type {SwitchContext}
+         */
         this.switchContext = null;
+
+        /**
+         * Context for `try` statements.
+         * @type {TryContext}
+         */
         this.tryContext = null;
+
+        /**
+         * Context for loop statements.
+         * @type {LoopContext}
+         */
         this.loopContext = null;
+
+        /**
+         * Context for `break` statements.
+         * @type {BreakContext}
+         */
         this.breakContext = null;
+
+        /**
+         * Context for `ChainExpression` nodes.
+         * @type {ChainContext}
+         */
         this.chainContext = null;
 
+        /**
+         * An array that tracks the current segments in the state. The array
+         * starts empty and segments are added with each `onCodePathSegmentStart`
+         * event and removed with each `onCodePathSegmentEnd` event. Effectively,
+         * this is tracking the code path segment traversal as the state is
+         * modified.
+         * @type {Array<CodePathSegment>}
+         */
         this.currentSegments = [];
+
+        /**
+         * Tracks the starting segment for this path. This value never changes.
+         * @type {CodePathSegment}
+         */
         this.initialSegment = this.forkContext.head[0];
 
-        // returnedSegments and thrownSegments push elements into finalSegments also.
-        const final = this.finalSegments = [];
-        const returned = this.returnedForkContext = [];
-        const thrown = this.thrownForkContext = [];
+        /**
+         * The final segments of the code path which are either `return` or `throw`.
+         * This is a union of the segments in `returnedForkContext` and `thrownForkContext`.
+         * @type {Array<CodePathSegment>}
+         */
+        this.finalSegments = [];
+
+        /**
+         * The final segments of the code path which are `return`. These
+         * segments are also contained in `finalSegments`.
+         * @type {Array<CodePathSegment>}
+         */
+        this.returnedForkContext = [];
+
+        /**
+         * The final segments of the code path which are `throw`. These
+         * segments are also contained in `finalSegments`.
+         * @type {Array<CodePathSegment>}
+         */
+        this.thrownForkContext = [];
+
+        /*
+         * We add an `add` method so that these look more like fork contexts and
+         * can be used interchangeably when a fork context is needed to add more
+         * segments to a path.
+         *
+         * Ultimately, we want anything added to `returned` or `thrown` to also
+         * be added to `final`. We only add reachable and used segments to these
+         * arrays.
+         */
+        const final = this.finalSegments;
+        const returned = this.returnedForkContext;
+        const thrown = this.thrownForkContext;
 
         returned.add = addToReturnedOrThrown.bind(null, returned, thrown, final);
         thrown.add = addToReturnedOrThrown.bind(null, thrown, returned, final);
     }
 
     /**
-     * The head segments.
+     * A passthrough property exposing the current pointer as part of the API.
      * @type {CodePathSegment[]}
      */
     get headSegments() {
@@ -341,77 +1085,72 @@ class CodePathState {
      *   If the new context is LogicalExpression's or AssignmentExpression's, this is `"&&"` or `"||"` or `"??"`.
      *   If it's IfStatement's or ConditionalExpression's, this is `"test"`.
      *   Otherwise, this is `"loop"`.
-     * @param {boolean} isForkingAsResult A flag that shows that goes different
-     *   paths between `true` and `false`.
+     * @param {boolean} isForkingAsResult Indicates if the result of the choice
+     *      creates a fork.
      * @returns {void}
      */
     pushChoiceContext(kind, isForkingAsResult) {
-        this.choiceContext = {
-            upper: this.choiceContext,
-            kind,
-            isForkingAsResult,
-            trueForkContext: ForkContext.newEmpty(this.forkContext),
-            falseForkContext: ForkContext.newEmpty(this.forkContext),
-            qqForkContext: ForkContext.newEmpty(this.forkContext),
-            processed: false
-        };
+        this.choiceContext = new ChoiceContext(this.choiceContext, kind, isForkingAsResult, this.forkContext);
     }
 
     /**
      * Pops the last choice context and finalizes it.
+     * This is called upon leaving a node that represents a choice.
      * @throws {Error} (Unreachable.)
      * @returns {ChoiceContext} The popped context.
      */
     popChoiceContext() {
-        const context = this.choiceContext;
-
-        this.choiceContext = context.upper;
-
+        const poppedChoiceContext = this.choiceContext;
         const forkContext = this.forkContext;
-        const headSegments = forkContext.head;
+        const head = forkContext.head;
+
+        this.choiceContext = poppedChoiceContext.upper;
 
-        switch (context.kind) {
+        switch (poppedChoiceContext.kind) {
             case "&&":
             case "||":
             case "??":
 
                 /*
-                 * If any result were not transferred from child contexts,
-                 * this sets the head segments to both cases.
-                 * The head segments are the path of the right-hand operand.
+                 * The `head` are the path of the right-hand operand.
+                 * If we haven't previously added segments from child contexts,
+                 * then we add these segments to all possible forks.
                  */
-                if (!context.processed) {
-                    context.trueForkContext.add(headSegments);
-                    context.falseForkContext.add(headSegments);
-                    context.qqForkContext.add(headSegments);
+                if (!poppedChoiceContext.processed) {
+                    poppedChoiceContext.trueForkContext.add(head);
+                    poppedChoiceContext.falseForkContext.add(head);
+                    poppedChoiceContext.nullishForkContext.add(head);
                 }
 
                 /*
-                 * Transfers results to upper context if this context is in
-                 * test chunk.
+                 * If this context is the left (test) expression for another choice
+                 * context, such as `a || b` in the expression `a || b || c`,
+                 * then we take the segments for this context and move them up
+                 * to the parent context.
                  */
-                if (context.isForkingAsResult) {
+                if (poppedChoiceContext.isForkingAsResult) {
                     const parentContext = this.choiceContext;
 
-                    parentContext.trueForkContext.addAll(context.trueForkContext);
-                    parentContext.falseForkContext.addAll(context.falseForkContext);
-                    parentContext.qqForkContext.addAll(context.qqForkContext);
+                    parentContext.trueForkContext.addAll(poppedChoiceContext.trueForkContext);
+                    parentContext.falseForkContext.addAll(poppedChoiceContext.falseForkContext);
+                    parentContext.nullishForkContext.addAll(poppedChoiceContext.nullishForkContext);
                     parentContext.processed = true;
 
-                    return context;
+                    // Exit early so we don't collapse all paths into one.
+                    return poppedChoiceContext;
                 }
 
                 break;
 
             case "test":
-                if (!context.processed) {
+                if (!poppedChoiceContext.processed) {
 
                     /*
                      * The head segments are the path of the `if` block here.
                      * Updates the `true` path with the end of the `if` block.
                      */
-                    context.trueForkContext.clear();
-                    context.trueForkContext.add(headSegments);
+                    poppedChoiceContext.trueForkContext.clear();
+                    poppedChoiceContext.trueForkContext.add(head);
                 } else {
 
                     /*
@@ -419,8 +1158,8 @@ class CodePathState {
                      * Updates the `false` path with the end of the `else`
                      * block.
                      */
-                    context.falseForkContext.clear();
-                    context.falseForkContext.add(headSegments);
+                    poppedChoiceContext.falseForkContext.clear();
+                    poppedChoiceContext.falseForkContext.add(head);
                 }
 
                 break;
@@ -428,82 +1167,129 @@ class CodePathState {
             case "loop":
 
                 /*
-                 * Loops are addressed in popLoopContext().
-                 * This is called from popLoopContext().
+                 * Loops are addressed in `popLoopContext()` so just return
+                 * the context without modification.
                  */
-                return context;
+                return poppedChoiceContext;
 
             /* c8 ignore next */
             default:
                 throw new Error("unreachable");
         }
 
-        // Merges all paths.
-        const prevForkContext = context.trueForkContext;
+        /*
+         * Merge the true path with the false path to create a single path.
+         */
+        const combinedForkContext = poppedChoiceContext.trueForkContext;
 
-        prevForkContext.addAll(context.falseForkContext);
-        forkContext.replaceHead(prevForkContext.makeNext(0, -1));
+        combinedForkContext.addAll(poppedChoiceContext.falseForkContext);
+        forkContext.replaceHead(combinedForkContext.makeNext(0, -1));
 
-        return context;
+        return poppedChoiceContext;
     }
 
     /**
-     * Makes a code path segment of the right-hand operand of a logical
+     * Creates a code path segment to represent right-hand operand of a logical
      * expression.
+     * This is called in the preprocessing phase when entering a node.
      * @throws {Error} (Unreachable.)
      * @returns {void}
      */
     makeLogicalRight() {
-        const context = this.choiceContext;
+        const currentChoiceContext = this.choiceContext;
         const forkContext = this.forkContext;
 
-        if (context.processed) {
+        if (currentChoiceContext.processed) {
 
             /*
-             * This got segments already from the child choice context.
-             * Creates the next path from own true/false fork context.
+             * This context was already assigned segments from a child
+             * choice context. In this case, we are concerned only about
+             * the path that does not short-circuit and so ends up on the
+             * right-hand operand of the logical expression.
              */
             let prevForkContext;
 
-            switch (context.kind) {
+            switch (currentChoiceContext.kind) {
                 case "&&": // if true then go to the right-hand side.
-                    prevForkContext = context.trueForkContext;
+                    prevForkContext = currentChoiceContext.trueForkContext;
                     break;
                 case "||": // if false then go to the right-hand side.
-                    prevForkContext = context.falseForkContext;
+                    prevForkContext = currentChoiceContext.falseForkContext;
                     break;
-                case "??": // Both true/false can short-circuit, so needs the third path to go to the right-hand side. That's qqForkContext.
-                    prevForkContext = context.qqForkContext;
+                case "??": // Both true/false can short-circuit, so needs the third path to go to the right-hand side. That's nullishForkContext.
+                    prevForkContext = currentChoiceContext.nullishForkContext;
                     break;
                 default:
                     throw new Error("unreachable");
             }
 
+            /*
+             * Create the segment for the right-hand operand of the logical expression
+             * and adjust the fork context pointer to point there. The right-hand segment
+             * is added at the end of all segments in `prevForkContext`.
+             */
             forkContext.replaceHead(prevForkContext.makeNext(0, -1));
+
+            /*
+             * We no longer need this list of segments.
+             *
+             * Reset `processed` because we've removed the segments from the child
+             * choice context. This allows `popChoiceContext()` to continue adding
+             * segments later.
+             */
             prevForkContext.clear();
-            context.processed = false;
+            currentChoiceContext.processed = false;
+
         } else {
 
             /*
-             * This did not get segments from the child choice context.
-             * So addresses the head segments.
-             * The head segments are the path of the left-hand operand.
+             * This choice context was not assigned segments from a child
+             * choice context, which means that it's a terminal logical
+             * expression.
+             *
+             * `head` is the segments for the left-hand operand of the
+             * logical expression.
+             *
+             * Each of the fork contexts below are empty at this point. We choose
+             * the path(s) that will short-circuit and add the segment for the
+             * left-hand operand to it. Ultimately, this will be the only segment
+             * in that path due to the short-circuting, so we are just seeding
+             * these paths to start.
              */
-            switch (context.kind) {
-                case "&&": // the false path can short-circuit.
-                    context.falseForkContext.add(forkContext.head);
+            switch (currentChoiceContext.kind) {
+                case "&&":
+
+                    /*
+                     * In most contexts, when a && expression evaluates to false,
+                     * it short circuits, so we need to account for that by setting
+                     * the `falseForkContext` to the left operand.
+                     *
+                     * When a && expression is the left-hand operand for a ??
+                     * expression, such as `(a && b) ?? c`, a nullish value will
+                     * also short-circuit in a different way than a false value,
+                     * so we also set the `nullishForkContext` to the left operand.
+                     * This path is only used with a ?? expression and is thrown
+                     * away for any other type of logical expression, so it's safe
+                     * to always add.
+                     */
+                    currentChoiceContext.falseForkContext.add(forkContext.head);
+                    currentChoiceContext.nullishForkContext.add(forkContext.head);
                     break;
                 case "||": // the true path can short-circuit.
-                    context.trueForkContext.add(forkContext.head);
+                    currentChoiceContext.trueForkContext.add(forkContext.head);
                     break;
                 case "??": // both can short-circuit.
-                    context.trueForkContext.add(forkContext.head);
-                    context.falseForkContext.add(forkContext.head);
+                    currentChoiceContext.trueForkContext.add(forkContext.head);
+                    currentChoiceContext.falseForkContext.add(forkContext.head);
                     break;
                 default:
                     throw new Error("unreachable");
             }
 
+            /*
+             * Create the segment for the right-hand operand of the logical expression
+             * and adjust the fork context pointer to point there.
+             */
             forkContext.replaceHead(forkContext.makeNext(-1, -1));
         }
     }
@@ -524,7 +1310,7 @@ class CodePathState {
         if (!context.processed) {
             context.trueForkContext.add(forkContext.head);
             context.falseForkContext.add(forkContext.head);
-            context.qqForkContext.add(forkContext.head);
+            context.nullishForkContext.add(forkContext.head);
         }
 
         context.processed = false;
@@ -562,22 +1348,20 @@ class CodePathState {
     //--------------------------------------------------------------------------
 
     /**
-     * Push a new `ChainExpression` context to the stack.
-     * This method is called on entering to each `ChainExpression` node.
-     * This context is used to count forking in the optional chain then merge them on the exiting from the `ChainExpression` node.
+     * Pushes a new `ChainExpression` context to the stack. This method is
+     * called when entering a `ChainExpression` node. A chain context is used to
+     * count forking in the optional chain then merge them on the exiting from the
+     * `ChainExpression` node.
      * @returns {void}
      */
     pushChainContext() {
-        this.chainContext = {
-            upper: this.chainContext,
-            countChoiceContexts: 0
-        };
+        this.chainContext = new ChainContext(this.chainContext);
     }
 
     /**
-     * Pop a `ChainExpression` context from the stack.
-     * This method is called on exiting from each `ChainExpression` node.
-     * This merges all forks of the last optional chaining.
+     * Pop a `ChainExpression` context from the stack. This method is called on
+     * exiting from each `ChainExpression` node. This merges all forks of the
+     * last optional chaining.
      * @returns {void}
      */
     popChainContext() {
@@ -586,7 +1370,7 @@ class CodePathState {
         this.chainContext = context.upper;
 
         // pop all choice contexts of this.
-        for (let i = context.countChoiceContexts; i > 0; --i) {
+        for (let i = context.choiceContextCount; i > 0; --i) {
             this.popChoiceContext();
         }
     }
@@ -599,7 +1383,7 @@ class CodePathState {
      */
     makeOptionalNode() {
         if (this.chainContext) {
-            this.chainContext.countChoiceContexts += 1;
+            this.chainContext.choiceContextCount += 1;
             this.pushChoiceContext("??", false);
         }
     }
@@ -627,16 +1411,7 @@ class CodePathState {
      * @returns {void}
      */
     pushSwitchContext(hasCase, label) {
-        this.switchContext = {
-            upper: this.switchContext,
-            hasCase,
-            defaultSegments: null,
-            defaultBodySegments: null,
-            foundDefault: false,
-            lastIsDefault: false,
-            countForks: 0
-        };
-
+        this.switchContext = new SwitchContext(this.switchContext, hasCase);
         this.pushBreakContext(true, label);
     }
 
@@ -657,7 +1432,7 @@ class CodePathState {
         const forkContext = this.forkContext;
         const brokenForkContext = this.popBreakContext().brokenForkContext;
 
-        if (context.countForks === 0) {
+        if (context.forkCount === 0) {
 
             /*
              * When there is only one `default` chunk and there is one or more
@@ -684,47 +1459,54 @@ class CodePathState {
         brokenForkContext.add(lastSegments);
 
         /*
-         * A path which is failed in all case test should be connected to path
-         * of `default` chunk.
+         * Any value that doesn't match a `case` test should flow to the default
+         * case. That happens normally when the default case is last in the `switch`,
+         * but if it's not, we need to rewire some of the paths to be correct.
          */
         if (!context.lastIsDefault) {
             if (context.defaultBodySegments) {
 
                 /*
-                 * Remove a link from `default` label to its chunk.
-                 * It's false route.
+                 * There is a non-empty default case, so remove the path from the `default`
+                 * label to its body for an accurate representation.
+                 */
+                disconnectSegments(context.defaultSegments, context.defaultBodySegments);
+
+                /*
+                 * Connect the path from the last non-default case to the body of the
+                 * default case.
                  */
-                removeConnection(context.defaultSegments, context.defaultBodySegments);
                 makeLooped(this, lastCaseSegments, context.defaultBodySegments);
+
             } else {
 
                 /*
-                 * It handles the last case body as broken if `default` chunk
-                 * does not exist.
+                 * There is no default case, so we treat this as if the last case
+                 * had a `break` in it.
                  */
                 brokenForkContext.add(lastCaseSegments);
             }
         }
 
-        // Pops the segment context stack until the entry segment.
-        for (let i = 0; i < context.countForks; ++i) {
+        // Traverse up to the original fork context for the `switch` statement
+        for (let i = 0; i < context.forkCount; ++i) {
             this.forkContext = this.forkContext.upper;
         }
 
         /*
-         * Creates a path from all brokenForkContext paths.
-         * This is a path after switch statement.
+         * Creates a path from all `brokenForkContext` paths.
+         * This is a path after `switch` statement.
          */
         this.forkContext.replaceHead(brokenForkContext.makeNext(0, -1));
     }
 
     /**
      * Makes a code path segment for a `SwitchCase` node.
-     * @param {boolean} isEmpty `true` if the body is empty.
-     * @param {boolean} isDefault `true` if the body is the default case.
+     * @param {boolean} isCaseBodyEmpty `true` if the body is empty.
+     * @param {boolean} isDefaultCase `true` if the body is the default case.
      * @returns {void}
      */
-    makeSwitchCaseBody(isEmpty, isDefault) {
+    makeSwitchCaseBody(isCaseBodyEmpty, isDefaultCase) {
         const context = this.switchContext;
 
         if (!context.hasCase) {
@@ -734,7 +1516,7 @@ class CodePathState {
         /*
          * Merge forks.
          * The parent fork context has two segments.
-         * Those are from the current case and the body of the previous case.
+         * Those are from the current `case` and the body of the previous case.
          */
         const parentForkContext = this.forkContext;
         const forkContext = this.pushForkContext();
@@ -742,26 +1524,53 @@ class CodePathState {
         forkContext.add(parentForkContext.makeNext(0, -1));
 
         /*
-         * Save `default` chunk info.
-         * If the `default` label is not at the last, we must make a path from
-         * the last `case` to the `default` chunk.
+         * Add information about the default case.
+         *
+         * The purpose of this is to identify the starting segments for the
+         * default case to make sure there is a path there.
          */
-        if (isDefault) {
+        if (isDefaultCase) {
+
+            /*
+             * This is the default case in the `switch`.
+             *
+             * We first save the current pointer as `defaultSegments` to point
+             * to the `default` keyword.
+             */
             context.defaultSegments = parentForkContext.head;
-            if (isEmpty) {
-                context.foundDefault = true;
+
+            /*
+             * If the body of the case is empty then we just set
+             * `foundEmptyDefault` to true; otherwise, we save a reference
+             * to the current pointer as `defaultBodySegments`.
+             */
+            if (isCaseBodyEmpty) {
+                context.foundEmptyDefault = true;
             } else {
                 context.defaultBodySegments = forkContext.head;
             }
+
         } else {
-            if (!isEmpty && context.foundDefault) {
-                context.foundDefault = false;
+
+            /*
+             * This is not the default case in the `switch`.
+             *
+             * If it's not empty and there is already an empty default case found,
+             * that means the default case actually comes before this case,
+             * and that it will fall through to this case. So, we can now
+             * ignore the previous default case (reset `foundEmptyDefault` to false)
+             * and set `defaultBodySegments` to the current segments because this is
+             * effectively the new default case.
+             */
+            if (!isCaseBodyEmpty && context.foundEmptyDefault) {
+                context.foundEmptyDefault = false;
                 context.defaultBodySegments = forkContext.head;
             }
         }
 
-        context.lastIsDefault = isDefault;
-        context.countForks += 1;
+        // keep track if the default case ends up last
+        context.lastIsDefault = isDefaultCase;
+        context.forkCount += 1;
     }
 
     //--------------------------------------------------------------------------
@@ -775,19 +1584,7 @@ class CodePathState {
      * @returns {void}
      */
     pushTryContext(hasFinalizer) {
-        this.tryContext = {
-            upper: this.tryContext,
-            position: "try",
-            hasFinalizer,
-
-            returnedForkContext: hasFinalizer
-                ? ForkContext.newEmpty(this.forkContext)
-                : null,
-
-            thrownForkContext: ForkContext.newEmpty(this.forkContext),
-            lastOfTryIsReachable: false,
-            lastOfCatchIsReachable: false
-        };
+        this.tryContext = new TryContext(this.tryContext, hasFinalizer, this.forkContext);
     }
 
     /**
@@ -799,25 +1596,35 @@ class CodePathState {
 
         this.tryContext = context.upper;
 
+        /*
+         * If we're inside the `catch` block, that means there is no `finally`,
+         * so we can process the `try` and `catch` blocks the simple way and
+         * merge their two paths.
+         */
         if (context.position === "catch") {
-
-            // Merges two paths from the `try` block and `catch` block merely.
             this.popForkContext();
             return;
         }
 
         /*
-         * The following process is executed only when there is the `finally`
+         * The following process is executed only when there is a `finally`
          * block.
          */
 
-        const returned = context.returnedForkContext;
-        const thrown = context.thrownForkContext;
+        const originalReturnedForkContext = context.returnedForkContext;
+        const originalThrownForkContext = context.thrownForkContext;
 
-        if (returned.empty && thrown.empty) {
+        // no `return` or `throw` in `try` or `catch` so there's nothing left to do
+        if (originalReturnedForkContext.empty && originalThrownForkContext.empty) {
             return;
         }
 
+        /*
+         * The following process is executed only when there is a `finally`
+         * block and there was a `return` or `throw` in the `try` or `catch`
+         * blocks.
+         */
+
         // Separate head to normal paths and leaving paths.
         const headSegments = this.forkContext.head;
 
@@ -826,10 +1633,10 @@ class CodePathState {
         const leavingSegments = headSegments.slice(headSegments.length / 2 | 0);
 
         // Forwards the leaving path to upper contexts.
-        if (!returned.empty) {
+        if (!originalReturnedForkContext.empty) {
             getReturnContext(this).returnedForkContext.add(leavingSegments);
         }
-        if (!thrown.empty) {
+        if (!originalThrownForkContext.empty) {
             getThrowContext(this).thrownForkContext.add(leavingSegments);
         }
 
@@ -852,16 +1659,20 @@ class CodePathState {
     makeCatchBlock() {
         const context = this.tryContext;
         const forkContext = this.forkContext;
-        const thrown = context.thrownForkContext;
+        const originalThrownForkContext = context.thrownForkContext;
 
-        // Update state.
+        /*
+         * We are now in a catch block so we need to update the context
+         * with that information. This includes creating a new fork
+         * context in case we encounter any `throw` statements here.
+         */
         context.position = "catch";
         context.thrownForkContext = ForkContext.newEmpty(forkContext);
         context.lastOfTryIsReachable = forkContext.reachable;
 
-        // Merge thrown paths.
-        thrown.add(forkContext.head);
-        const thrownSegments = thrown.makeNext(0, -1);
+        // Merge the thrown paths from the `try` and `catch` blocks
+        originalThrownForkContext.add(forkContext.head);
+        const thrownSegments = originalThrownForkContext.makeNext(0, -1);
 
         // Fork to a bypass and the merged thrown path.
         this.pushForkContext();
@@ -880,8 +1691,8 @@ class CodePathState {
     makeFinallyBlock() {
         const context = this.tryContext;
         let forkContext = this.forkContext;
-        const returned = context.returnedForkContext;
-        const thrown = context.thrownForkContext;
+        const originalReturnedForkContext = context.returnedForkContext;
+        const originalThrownForContext = context.thrownForkContext;
         const headOfLeavingSegments = forkContext.head;
 
         // Update state.
@@ -895,9 +1706,15 @@ class CodePathState {
         } else {
             context.lastOfTryIsReachable = forkContext.reachable;
         }
+
+
         context.position = "finally";
 
-        if (returned.empty && thrown.empty) {
+        /*
+         * If there was no `return` or `throw` in either the `try` or `catch`
+         * blocks, then there's no further code paths to create for `finally`.
+         */
+        if (originalReturnedForkContext.empty && originalThrownForContext.empty) {
 
             // This path does not leave.
             return;
@@ -905,18 +1722,18 @@ class CodePathState {
 
         /*
          * Create a parallel segment from merging returned and thrown.
-         * This segment will leave at the end of this finally block.
+         * This segment will leave at the end of this `finally` block.
          */
         const segments = forkContext.makeNext(-1, -1);
 
         for (let i = 0; i < forkContext.count; ++i) {
             const prevSegsOfLeavingSegment = [headOfLeavingSegments[i]];
 
-            for (let j = 0; j < returned.segmentsList.length; ++j) {
-                prevSegsOfLeavingSegment.push(returned.segmentsList[j][i]);
+            for (let j = 0; j < originalReturnedForkContext.segmentsList.length; ++j) {
+                prevSegsOfLeavingSegment.push(originalReturnedForkContext.segmentsList[j][i]);
             }
-            for (let j = 0; j < thrown.segmentsList.length; ++j) {
-                prevSegsOfLeavingSegment.push(thrown.segmentsList[j][i]);
+            for (let j = 0; j < originalThrownForContext.segmentsList.length; ++j) {
+                prevSegsOfLeavingSegment.push(originalThrownForContext.segmentsList[j][i]);
             }
 
             segments.push(
@@ -971,63 +1788,32 @@ class CodePathState {
      */
     pushLoopContext(type, label) {
         const forkContext = this.forkContext;
+
+        // All loops need a path to account for `break` statements
         const breakContext = this.pushBreakContext(true, label);
 
         switch (type) {
             case "WhileStatement":
                 this.pushChoiceContext("loop", false);
-                this.loopContext = {
-                    upper: this.loopContext,
-                    type,
-                    label,
-                    test: void 0,
-                    continueDestSegments: null,
-                    brokenForkContext: breakContext.brokenForkContext
-                };
+                this.loopContext = new WhileLoopContext(this.loopContext, label, breakContext);
                 break;
 
             case "DoWhileStatement":
                 this.pushChoiceContext("loop", false);
-                this.loopContext = {
-                    upper: this.loopContext,
-                    type,
-                    label,
-                    test: void 0,
-                    entrySegments: null,
-                    continueForkContext: ForkContext.newEmpty(forkContext),
-                    brokenForkContext: breakContext.brokenForkContext
-                };
+                this.loopContext = new DoWhileLoopContext(this.loopContext, label, breakContext, forkContext);
                 break;
 
             case "ForStatement":
                 this.pushChoiceContext("loop", false);
-                this.loopContext = {
-                    upper: this.loopContext,
-                    type,
-                    label,
-                    test: void 0,
-                    endOfInitSegments: null,
-                    testSegments: null,
-                    endOfTestSegments: null,
-                    updateSegments: null,
-                    endOfUpdateSegments: null,
-                    continueDestSegments: null,
-                    brokenForkContext: breakContext.brokenForkContext
-                };
+                this.loopContext = new ForLoopContext(this.loopContext, label, breakContext);
                 break;
 
             case "ForInStatement":
+                this.loopContext = new ForInLoopContext(this.loopContext, label, breakContext);
+                break;
+
             case "ForOfStatement":
-                this.loopContext = {
-                    upper: this.loopContext,
-                    type,
-                    label,
-                    prevSegments: null,
-                    leftSegments: null,
-                    endOfLeftSegments: null,
-                    continueDestSegments: null,
-                    brokenForkContext: breakContext.brokenForkContext
-                };
+                this.loopContext = new ForOfLoopContext(this.loopContext, label, breakContext);
                 break;
 
             /* c8 ignore next */
@@ -1054,6 +1840,11 @@ class CodePathState {
             case "WhileStatement":
             case "ForStatement":
                 this.popChoiceContext();
+
+                /*
+                 * Creates the path from the end of the loop body up to the
+                 * location where `continue` would jump to.
+                 */
                 makeLooped(
                     this,
                     forkContext.head,
@@ -1068,11 +1859,21 @@ class CodePathState {
                     choiceContext.trueForkContext.add(forkContext.head);
                     choiceContext.falseForkContext.add(forkContext.head);
                 }
+
+                /*
+                 * If this isn't a hardcoded `true` condition, then `break`
+                 * should continue down the path as if the condition evaluated
+                 * to false.
+                 */
                 if (context.test !== true) {
                     brokenForkContext.addAll(choiceContext.falseForkContext);
                 }
 
-                // `true` paths go to looping.
+                /*
+                 * When the condition is true, the loop continues back to the top,
+                 * so create a path from each possible true condition back to the
+                 * top of the loop.
+                 */
                 const segmentsList = choiceContext.trueForkContext.segmentsList;
 
                 for (let i = 0; i < segmentsList.length; ++i) {
@@ -1088,6 +1889,11 @@ class CodePathState {
             case "ForInStatement":
             case "ForOfStatement":
                 brokenForkContext.add(forkContext.head);
+
+                /*
+                 * Creates the path from the end of the loop body up to the
+                 * left expression (left of `in` or `of`) of the loop.
+                 */
                 makeLooped(
                     this,
                     forkContext.head,
@@ -1100,7 +1906,14 @@ class CodePathState {
                 throw new Error("unreachable");
         }
 
-        // Go next.
+        /*
+         * If there wasn't a `break` statement in the loop, then we're at
+         * the end of the loop's path, so we make an unreachable segment
+         * to mark that.
+         *
+         * If there was a `break` statement, then we continue on into the
+         * `brokenForkContext`.
+         */
         if (brokenForkContext.empty) {
             forkContext.replaceHead(forkContext.makeUnreachable(-1, -1));
         } else {
@@ -1138,7 +1951,11 @@ class CodePathState {
             choiceContext.falseForkContext.add(forkContext.head);
         }
 
-        // Update state.
+        /*
+         * If this isn't a hardcoded `true` condition, then `break`
+         * should continue down the path as if the condition evaluated
+         * to false.
+         */
         if (context.test !== true) {
             context.brokenForkContext.addAll(choiceContext.falseForkContext);
         }
@@ -1170,7 +1987,11 @@ class CodePathState {
 
         context.test = test;
 
-        // Creates paths of `continue` statements.
+        /*
+         * If there is a `continue` statement in the loop then `continueForkContext`
+         * won't be empty. We wire up the path from `continue` to the loop
+         * test condition and then continue the traversal in the root fork context.
+         */
         if (!context.continueForkContext.empty) {
             context.continueForkContext.add(forkContext.head);
             const testSegments = context.continueForkContext.makeNext(0, -1);
@@ -1190,7 +2011,14 @@ class CodePathState {
         const endOfInitSegments = forkContext.head;
         const testSegments = forkContext.makeNext(-1, -1);
 
-        // Update state.
+        /*
+         * Update the state.
+         *
+         * The `continueDestSegments` are set to `testSegments` because we
+         * don't yet know if there is an update expression in this loop. So,
+         * from what we already know at this point, a `continue` statement
+         * will jump back to the test expression.
+         */
         context.test = test;
         context.endOfInitSegments = endOfInitSegments;
         context.continueDestSegments = context.testSegments = testSegments;
@@ -1217,7 +2045,14 @@ class CodePathState {
             context.endOfInitSegments = forkContext.head;
         }
 
-        // Update state.
+        /*
+         * Update the state.
+         *
+         * The `continueDestSegments` are now set to `updateSegments` because we
+         * know there is an update expression in this loop. So, a `continue` statement
+         * in the loop will jump to the update expression first, and then to any
+         * test expression the loop might have.
+         */
         const updateSegments = forkContext.makeDisconnected(-1, -1);
 
         context.continueDestSegments = context.updateSegments = updateSegments;
@@ -1233,11 +2068,30 @@ class CodePathState {
         const choiceContext = this.choiceContext;
         const forkContext = this.forkContext;
 
-        // Update state.
+        /*
+         * Determine what to do based on which part of the `for` loop are present.
+         * 1. If there is an update expression, then `updateSegments` is not null and
+         *    we need to assign `endOfUpdateSegments`, and if there is a test
+         *    expression, we then need to create the looped path to get back to
+         *    the test condition.
+         * 2. If there is no update expression but there is a test expression,
+         *    then we only need to update the test segment information.
+         * 3. If there is no update expression and no test expression, then we
+         *    just save `endOfInitSegments`.
+         */
         if (context.updateSegments) {
             context.endOfUpdateSegments = forkContext.head;
 
-            // `update` -> `test`
+            /*
+             * In a `for` loop that has both an update expression and a test
+             * condition, execution flows from the test expression into the
+             * loop body, to the update expression, and then back to the test
+             * expression to determine if the loop should continue.
+             *
+             * To account for that, we need to make a path from the end of the
+             * update expression to the start of the test expression. This is
+             * effectively what creates the loop in the code path.
+             */
             if (context.testSegments) {
                 makeLooped(
                     this,
@@ -1257,12 +2111,18 @@ class CodePathState {
 
         let bodySegments = context.endOfTestSegments;
 
+        /*
+         * If there is a test condition, then there `endOfTestSegments` is also
+         * the start of the loop body. If there isn't a test condition then
+         * `bodySegments` will be null and we need to look elsewhere to find
+         * the start of the body.
+         *
+         * The body starts at the end of the init expression and ends at the end
+         * of the update expression, so we use those locations to determine the
+         * body segments.
+         */
         if (!bodySegments) {
 
-            /*
-             * If there is not the `test` part, the `body` path comes from the
-             * `init` part and the `update` part.
-             */
             const prevForkContext = ForkContext.newEmpty(forkContext);
 
             prevForkContext.add(context.endOfInitSegments);
@@ -1272,7 +2132,16 @@ class CodePathState {
 
             bodySegments = prevForkContext.makeNext(0, -1);
         }
+
+        /*
+         * If there was no test condition and no update expression, then
+         * `continueDestSegments` will be null. In that case, a
+         * `continue` should skip directly to the body of the loop.
+         * Otherwise, we want to keep the current `continueDestSegments`.
+         */
         context.continueDestSegments = context.continueDestSegments || bodySegments;
+
+        // move pointer to the body
         forkContext.replaceHead(bodySegments);
     }
 
@@ -1336,19 +2205,15 @@ class CodePathState {
     //--------------------------------------------------------------------------
 
     /**
-     * Creates new context for BreakStatement.
-     * @param {boolean} breakable The flag to indicate it can break by
-     *      an unlabeled BreakStatement.
-     * @param {string|null} label The label of this context.
-     * @returns {Object} The new context.
+     * Creates new context in which a `break` statement can be used. This occurs inside of a loop,
+     * labeled statement, or switch statement.
+     * @param {boolean} breakable Indicates if we are inside a statement where
+     *      `break` without a label will exit the statement.
+     * @param {string|null} label The label associated with the statement.
+     * @returns {BreakContext} The new context.
      */
     pushBreakContext(breakable, label) {
-        this.breakContext = {
-            upper: this.breakContext,
-            breakable,
-            label,
-            brokenForkContext: ForkContext.newEmpty(this.forkContext)
-        };
+        this.breakContext = new BreakContext(this.breakContext, breakable, label, this.forkContext);
         return this.breakContext;
     }
 
@@ -1380,7 +2245,7 @@ class CodePathState {
      *
      * It registers the head segment to a context of `break`.
      * It makes new unreachable segment, then it set the head with the segment.
-     * @param {string} label A label of the break statement.
+     * @param {string|null} label A label of the break statement.
      * @returns {void}
      */
     makeBreak(label) {
@@ -1406,7 +2271,7 @@ class CodePathState {
      *
      * It makes a looping path.
      * It makes new unreachable segment, then it set the head with the segment.
-     * @param {string} label A label of the continue statement.
+     * @param {string|null} label A label of the continue statement.
      * @returns {void}
      */
     makeContinue(label) {
@@ -1422,7 +2287,7 @@ class CodePathState {
             if (context.continueDestSegments) {
                 makeLooped(this, forkContext.head, context.continueDestSegments);
 
-                // If the context is a for-in/of loop, this effects a break also.
+                // If the context is a for-in/of loop, this affects a break also.
                 if (context.type === "ForInStatement" ||
                     context.type === "ForOfStatement"
                 ) {
diff --git a/tools/node_modules/eslint/lib/linter/code-path-analysis/code-path.js b/tools/node_modules/eslint/lib/linter/code-path-analysis/code-path.js
index f6a88a00af924e..3bf570d754bfa9 100644
--- a/tools/node_modules/eslint/lib/linter/code-path-analysis/code-path.js
+++ b/tools/node_modules/eslint/lib/linter/code-path-analysis/code-path.js
@@ -80,7 +80,9 @@ class CodePath {
     }
 
     /**
-     * The initial code path segment.
+     * The initial code path segment. This is the segment that is at the head
+     * of the code path.
+     * This is a passthrough to the underlying `CodePathState`.
      * @type {CodePathSegment}
      */
     get initialSegment() {
@@ -88,8 +90,10 @@ class CodePath {
     }
 
     /**
-     * Final code path segments.
-     * This array is a mix of `returnedSegments` and `thrownSegments`.
+     * Final code path segments. These are the terminal (tail) segments in the
+     * code path, which is the combination of `returnedSegments` and `thrownSegments`.
+     * All segments in this array are reachable.
+     * This is a passthrough to the underlying `CodePathState`.
      * @type {CodePathSegment[]}
      */
     get finalSegments() {
@@ -97,9 +101,14 @@ class CodePath {
     }
 
     /**
-     * Final code path segments which is with `return` statements.
-     * This array contains the last path segment if it's reachable.
-     * Since the reachable last path returns `undefined`.
+     * Final code path segments that represent normal completion of the code path.
+     * For functions, this means both explicit `return` statements and implicit returns,
+     * such as the last reachable segment in a function that does not have an
+     * explicit `return` as this implicitly returns `undefined`. For scripts,
+     * modules, class field initializers, and class static blocks, this means
+     * all lines of code have been executed.
+     * These segments are also present in `finalSegments`.
+     * This is a passthrough to the underlying `CodePathState`.
      * @type {CodePathSegment[]}
      */
     get returnedSegments() {
@@ -107,7 +116,9 @@ class CodePath {
     }
 
     /**
-     * Final code path segments which is with `throw` statements.
+     * Final code path segments that represent `throw` statements.
+     * This is a passthrough to the underlying `CodePathState`.
+     * These segments are also present in `finalSegments`.
      * @type {CodePathSegment[]}
      */
     get thrownSegments() {
@@ -115,7 +126,12 @@ class CodePath {
     }
 
     /**
-     * Current code path segments.
+     * Tracks the traversal of the code path through each segment. This array
+     * starts empty and segments are added or removed as the code path is
+     * traversed. This array always ends up empty at the end of a code path
+     * traversal. The `CodePathState` uses this to track its progress through
+     * the code path.
+     * This is a passthrough to the underlying `CodePathState`.
      * @type {CodePathSegment[]}
      * @deprecated
      */
@@ -126,46 +142,70 @@ class CodePath {
     /**
      * Traverses all segments in this code path.
      *
-     *     codePath.traverseSegments(function(segment, controller) {
+     *     codePath.traverseSegments((segment, controller) => {
      *         // do something.
      *     });
      *
      * This method enumerates segments in order from the head.
      *
-     * The `controller` object has two methods.
+     * The `controller` argument has two methods:
      *
-     * - `controller.skip()` - Skip the following segments in this branch.
-     * - `controller.break()` - Skip all following segments.
-     * @param {Object} [options] Omittable.
-     * @param {CodePathSegment} [options.first] The first segment to traverse.
-     * @param {CodePathSegment} [options.last] The last segment to traverse.
+     * - `skip()` - skips the following segments in this branch
+     * - `break()` - skips all following segments in the traversal
+     *
+     * A note on the parameters: the `options` argument is optional. This means
+     * the first argument might be an options object or the callback function.
+     * @param {Object} [optionsOrCallback] Optional first and last segments to traverse.
+     * @param {CodePathSegment} [optionsOrCallback.first] The first segment to traverse.
+     * @param {CodePathSegment} [optionsOrCallback.last] The last segment to traverse.
      * @param {Function} callback A callback function.
      * @returns {void}
      */
-    traverseSegments(options, callback) {
+    traverseSegments(optionsOrCallback, callback) {
+
+        // normalize the arguments into a callback and options
         let resolvedOptions;
         let resolvedCallback;
 
-        if (typeof options === "function") {
-            resolvedCallback = options;
+        if (typeof optionsOrCallback === "function") {
+            resolvedCallback = optionsOrCallback;
             resolvedOptions = {};
         } else {
-            resolvedOptions = options || {};
+            resolvedOptions = optionsOrCallback || {};
             resolvedCallback = callback;
         }
 
+        // determine where to start traversing from based on the options
         const startSegment = resolvedOptions.first || this.internal.initialSegment;
         const lastSegment = resolvedOptions.last;
 
-        let item = null;
+        // set up initial location information
+        let record = null;
         let index = 0;
         let end = 0;
         let segment = null;
-        const visited = Object.create(null);
+
+        // segments that have already been visited during traversal
+        const visited = new Set();
+
+        // tracks the traversal steps
         const stack = [[startSegment, 0]];
+
+        // tracks the last skipped segment during traversal
         let skippedSegment = null;
+
+        // indicates if we exited early from the traversal
         let broken = false;
+
+        /**
+         * Maintains traversal state.
+         */
         const controller = {
+
+            /**
+             * Skip the following segments in this branch.
+             * @returns {void}
+             */
             skip() {
                 if (stack.length <= 1) {
                     broken = true;
@@ -173,32 +213,52 @@ class CodePath {
                     skippedSegment = stack[stack.length - 2][0];
                 }
             },
+
+            /**
+             * Stop traversal completely - do not traverse to any
+             * other segments.
+             * @returns {void}
+             */
             break() {
                 broken = true;
             }
         };
 
         /**
-         * Checks a given previous segment has been visited.
+         * Checks if a given previous segment has been visited.
          * @param {CodePathSegment} prevSegment A previous segment to check.
          * @returns {boolean} `true` if the segment has been visited.
          */
         function isVisited(prevSegment) {
             return (
-                visited[prevSegment.id] ||
+                visited.has(prevSegment) ||
                 segment.isLoopedPrevSegment(prevSegment)
             );
         }
 
+        // the traversal
         while (stack.length > 0) {
-            item = stack[stack.length - 1];
-            segment = item[0];
-            index = item[1];
+
+            /*
+             * This isn't a pure stack. We use the top record all the time
+             * but don't always pop it off. The record is popped only if
+             * one of the following is true:
+             *
+             * 1) We have already visited the segment.
+             * 2) We have not visited *all* of the previous segments.
+             * 3) We have traversed past the available next segments.
+             *
+             * Otherwise, we just read the value and sometimes modify the
+             * record as we traverse.
+             */
+            record = stack[stack.length - 1];
+            segment = record[0];
+            index = record[1];
 
             if (index === 0) {
 
                 // Skip if this segment has been visited already.
-                if (visited[segment.id]) {
+                if (visited.has(segment)) {
                     stack.pop();
                     continue;
                 }
@@ -212,18 +272,29 @@ class CodePath {
                     continue;
                 }
 
-                // Reset the flag of skipping if all branches have been skipped.
+                // Reset the skipping flag if all branches have been skipped.
                 if (skippedSegment && segment.prevSegments.includes(skippedSegment)) {
                     skippedSegment = null;
                 }
-                visited[segment.id] = true;
+                visited.add(segment);
 
-                // Call the callback when the first time.
+                /*
+                 * If the most recent segment hasn't been skipped, then we call
+                 * the callback, passing in the segment and the controller.
+                 */
                 if (!skippedSegment) {
                     resolvedCallback.call(this, segment, controller);
+
+                    // exit if we're at the last segment
                     if (segment === lastSegment) {
                         controller.skip();
                     }
+
+                    /*
+                     * If the previous statement was executed, or if the callback
+                     * called a method on the controller, we might need to exit the
+                     * loop, so check for that and break accordingly.
+                     */
                     if (broken) {
                         break;
                     }
@@ -233,12 +304,35 @@ class CodePath {
             // Update the stack.
             end = segment.nextSegments.length - 1;
             if (index < end) {
-                item[1] += 1;
+
+                /*
+                 * If we haven't yet visited all of the next segments, update
+                 * the current top record on the stack to the next index to visit
+                 * and then push a record for the current segment on top.
+                 *
+                 * Setting the current top record's index lets us know how many
+                 * times we've been here and ensures that the segment won't be
+                 * reprocessed (because we only process segments with an index
+                 * of 0).
+                 */
+                record[1] += 1;
                 stack.push([segment.nextSegments[index], 0]);
             } else if (index === end) {
-                item[0] = segment.nextSegments[index];
-                item[1] = 0;
+
+                /*
+                 * If we are at the last next segment, then reset the top record
+                 * in the stack to next segment and set its index to 0 so it will
+                 * be processed next.
+                 */
+                record[0] = segment.nextSegments[index];
+                record[1] = 0;
             } else {
+
+                /*
+                 * If index > end, that means we have no more segments that need
+                 * processing. So, we pop that record off of the stack in order to
+                 * continue traversing at the next level up.
+                 */
                 stack.pop();
             }
         }
diff --git a/tools/node_modules/eslint/lib/linter/code-path-analysis/fork-context.js b/tools/node_modules/eslint/lib/linter/code-path-analysis/fork-context.js
index 04c59b5e417253..33140272f53b42 100644
--- a/tools/node_modules/eslint/lib/linter/code-path-analysis/fork-context.js
+++ b/tools/node_modules/eslint/lib/linter/code-path-analysis/fork-context.js
@@ -21,8 +21,8 @@ const assert = require("assert"),
 //------------------------------------------------------------------------------
 
 /**
- * Gets whether or not a given segment is reachable.
- * @param {CodePathSegment} segment A segment to get.
+ * Determines whether or not a given segment is reachable.
+ * @param {CodePathSegment} segment The segment to check.
  * @returns {boolean} `true` if the segment is reachable.
  */
 function isReachable(segment) {
@@ -30,32 +30,64 @@ function isReachable(segment) {
 }
 
 /**
- * Creates new segments from the specific range of `context.segmentsList`.
+ * Creates a new segment for each fork in the given context and appends it
+ * to the end of the specified range of segments. Ultimately, this ends up calling
+ * `new CodePathSegment()` for each of the forks using the `create` argument
+ * as a wrapper around special behavior.
+ *
+ * The `startIndex` and `endIndex` arguments specify a range of segments in
+ * `context` that should become `allPrevSegments` for the newly created
+ * `CodePathSegment` objects.
  *
  * When `context.segmentsList` is `[[a, b], [c, d], [e, f]]`, `begin` is `0`, and
- * `end` is `-1`, this creates `[g, h]`. This `g` is from `a`, `c`, and `e`.
- * This `h` is from `b`, `d`, and `f`.
- * @param {ForkContext} context An instance.
- * @param {number} begin The first index of the previous segments.
- * @param {number} end The last index of the previous segments.
- * @param {Function} create A factory function of new segments.
- * @returns {CodePathSegment[]} New segments.
+ * `end` is `-1`, this creates two new segments, `[g, h]`. This `g` is appended to
+ * the end of the path from `a`, `c`, and `e`. This `h` is appended to the end of
+ * `b`, `d`, and `f`.
+ * @param {ForkContext} context An instance from which the previous segments
+ *      will be obtained.
+ * @param {number} startIndex The index of the first segment in the context
+ *      that should be specified as previous segments for the newly created segments.
+ * @param {number} endIndex The index of the last segment in the context
+ *      that should be specified as previous segments for the newly created segments.
+ * @param {Function} create A function that creates new `CodePathSegment`
+ *      instances in a particular way. See the `CodePathSegment.new*` methods.
+ * @returns {Array<CodePathSegment>} An array of the newly-created segments.
  */
-function makeSegments(context, begin, end, create) {
+function createSegments(context, startIndex, endIndex, create) {
+
+    /** @type {Array<Array<CodePathSegment>>} */
     const list = context.segmentsList;
 
-    const normalizedBegin = begin >= 0 ? begin : list.length + begin;
-    const normalizedEnd = end >= 0 ? end : list.length + end;
+    /*
+     * Both `startIndex` and `endIndex` work the same way: if the number is zero
+     * or more, then the number is used as-is. If the number is negative,
+     * then that number is added to the length of the segments list to
+     * determine the index to use. That means -1 for either argument
+     * is the last element, -2 is the second to last, and so on.
+     *
+     * So if `startIndex` is 0, `endIndex` is -1, and `list.length` is 3, the
+     * effective `startIndex` is 0 and the effective `endIndex` is 2, so this function
+     * will include items at indices 0, 1, and 2.
+     *
+     * Therefore, if `startIndex` is -1 and `endIndex` is -1, that means we'll only
+     * be using the last segment in `list`.
+     */
+    const normalizedBegin = startIndex >= 0 ? startIndex : list.length + startIndex;
+    const normalizedEnd = endIndex >= 0 ? endIndex : list.length + endIndex;
 
+    /** @type {Array<CodePathSegment>} */
     const segments = [];
 
     for (let i = 0; i < context.count; ++i) {
+
+        // this is passed into `new CodePathSegment` to add to code path.
         const allPrevSegments = [];
 
         for (let j = normalizedBegin; j <= normalizedEnd; ++j) {
             allPrevSegments.push(list[j][i]);
         }
 
+        // note: `create` is just a wrapper that augments `new CodePathSegment`.
         segments.push(create(context.idGenerator.next(), allPrevSegments));
     }
 
@@ -63,28 +95,57 @@ function makeSegments(context, begin, end, create) {
 }
 
 /**
- * `segments` becomes doubly in a `finally` block. Then if a code path exits by a
- * control statement (such as `break`, `continue`) from the `finally` block, the
- * destination's segments may be half of the source segments. In that case, this
- * merges segments.
- * @param {ForkContext} context An instance.
- * @param {CodePathSegment[]} segments Segments to merge.
- * @returns {CodePathSegment[]} The merged segments.
+ * Inside of a `finally` block we end up with two parallel paths. If the code path
+ * exits by a control statement (such as `break` or `continue`) from the `finally`
+ * block, then we need to merge the remaining parallel paths back into one.
+ * @param {ForkContext} context The fork context to work on.
+ * @param {Array<CodePathSegment>} segments Segments to merge.
+ * @returns {Array<CodePathSegment>} The merged segments.
  */
 function mergeExtraSegments(context, segments) {
     let currentSegments = segments;
 
+    /*
+     * We need to ensure that the array returned from this function contains no more
+     * than the number of segments that the context allows. `context.count` indicates
+     * how many items should be in the returned array to ensure that the new segment
+     * entries will line up with the already existing segment entries.
+     */
     while (currentSegments.length > context.count) {
         const merged = [];
 
-        for (let i = 0, length = currentSegments.length / 2 | 0; i < length; ++i) {
+        /*
+         * Because `context.count` is a factor of 2 inside of a `finally` block,
+         * we can divide the segment count by 2 to merge the paths together.
+         * This loops through each segment in the list and creates a new `CodePathSegment`
+         * that has the segment and the segment two slots away as previous segments.
+         *
+         * If `currentSegments` is [a,b,c,d], this will create new segments e and f, such
+         * that:
+         *
+         * When `i` is 0:
+         * a->e
+         * c->e
+         *
+         * When `i` is 1:
+         * b->f
+         * d->f
+         */
+        for (let i = 0, length = Math.floor(currentSegments.length / 2); i < length; ++i) {
             merged.push(CodePathSegment.newNext(
                 context.idGenerator.next(),
                 [currentSegments[i], currentSegments[i + length]]
             ));
         }
+
+        /*
+         * Go through the loop condition one more time to see if we have the
+         * number of segments for the context. If not, we'll keep merging paths
+         * of the merged segments until we get there.
+         */
         currentSegments = merged;
     }
+
     return currentSegments;
 }
 
@@ -93,25 +154,55 @@ function mergeExtraSegments(context, segments) {
 //------------------------------------------------------------------------------
 
 /**
- * A class to manage forking.
+ * Manages the forking of code paths.
  */
 class ForkContext {
 
     /**
+     * Creates a new instance.
      * @param {IdGenerator} idGenerator An identifier generator for segments.
-     * @param {ForkContext|null} upper An upper fork context.
-     * @param {number} count A number of parallel segments.
+     * @param {ForkContext|null} upper The preceding fork context.
+     * @param {number} count The number of parallel segments in each element
+     *      of `segmentsList`.
      */
     constructor(idGenerator, upper, count) {
+
+        /**
+         * The ID generator that will generate segment IDs for any new
+         * segments that are created.
+         * @type {IdGenerator}
+         */
         this.idGenerator = idGenerator;
+
+        /**
+         * The preceding fork context.
+         * @type {ForkContext|null}
+         */
         this.upper = upper;
+
+        /**
+         * The number of elements in each element of `segmentsList`. In most
+         * cases, this is 1 but can be 2 when there is a `finally` present,
+         * which forks the code path outside of normal flow. In the case of nested
+         * `finally` blocks, this can be a multiple of 2.
+         * @type {number}
+         */
         this.count = count;
+
+        /**
+         * The segments within this context. Each element in this array has
+         * `count` elements that represent one step in each fork. For example,
+         * when `segmentsList` is `[[a, b], [c, d], [e, f]]`, there is one path
+         * a->c->e and one path b->d->f, and `count` is 2 because each element
+         * is an array with two elements.
+         * @type {Array<Array<CodePathSegment>>}
+         */
         this.segmentsList = [];
     }
 
     /**
-     * The head segments.
-     * @type {CodePathSegment[]}
+     * The segments that begin this fork context.
+     * @type {Array<CodePathSegment>}
      */
     get head() {
         const list = this.segmentsList;
@@ -120,7 +211,7 @@ class ForkContext {
     }
 
     /**
-     * A flag which shows empty.
+     * Indicates if the context contains no segments.
      * @type {boolean}
      */
     get empty() {
@@ -128,7 +219,7 @@ class ForkContext {
     }
 
     /**
-     * A flag which shows reachable.
+     * Indicates if there are any segments that are reachable.
      * @type {boolean}
      */
     get reachable() {
@@ -138,75 +229,82 @@ class ForkContext {
     }
 
     /**
-     * Creates new segments from this context.
-     * @param {number} begin The first index of previous segments.
-     * @param {number} end The last index of previous segments.
-     * @returns {CodePathSegment[]} New segments.
+     * Creates new segments in this context and appends them to the end of the
+     * already existing `CodePathSegment`s specified by `startIndex` and
+     * `endIndex`.
+     * @param {number} startIndex The index of the first segment in the context
+     *      that should be specified as previous segments for the newly created segments.
+     * @param {number} endIndex The index of the last segment in the context
+     *      that should be specified as previous segments for the newly created segments.
+     * @returns {Array<CodePathSegment>} An array of the newly created segments.
      */
-    makeNext(begin, end) {
-        return makeSegments(this, begin, end, CodePathSegment.newNext);
+    makeNext(startIndex, endIndex) {
+        return createSegments(this, startIndex, endIndex, CodePathSegment.newNext);
     }
 
     /**
-     * Creates new segments from this context.
-     * The new segments is always unreachable.
-     * @param {number} begin The first index of previous segments.
-     * @param {number} end The last index of previous segments.
-     * @returns {CodePathSegment[]} New segments.
+     * Creates new unreachable segments in this context and appends them to the end of the
+     * already existing `CodePathSegment`s specified by `startIndex` and
+     * `endIndex`.
+     * @param {number} startIndex The index of the first segment in the context
+     *      that should be specified as previous segments for the newly created segments.
+     * @param {number} endIndex The index of the last segment in the context
+     *      that should be specified as previous segments for the newly created segments.
+     * @returns {Array<CodePathSegment>} An array of the newly created segments.
      */
-    makeUnreachable(begin, end) {
-        return makeSegments(this, begin, end, CodePathSegment.newUnreachable);
+    makeUnreachable(startIndex, endIndex) {
+        return createSegments(this, startIndex, endIndex, CodePathSegment.newUnreachable);
     }
 
     /**
-     * Creates new segments from this context.
-     * The new segments don't have connections for previous segments.
-     * But these inherit the reachable flag from this context.
-     * @param {number} begin The first index of previous segments.
-     * @param {number} end The last index of previous segments.
-     * @returns {CodePathSegment[]} New segments.
+     * Creates new segments in this context and does not append them to the end
+     *  of the already existing `CodePathSegment`s specified by `startIndex` and
+     * `endIndex`. The `startIndex` and `endIndex` are only used to determine if
+     * the new segments should be reachable. If any of the segments in this range
+     * are reachable then the new segments are also reachable; otherwise, the new
+     * segments are unreachable.
+     * @param {number} startIndex The index of the first segment in the context
+     *      that should be considered for reachability.
+     * @param {number} endIndex The index of the last segment in the context
+     *      that should be considered for reachability.
+     * @returns {Array<CodePathSegment>} An array of the newly created segments.
      */
-    makeDisconnected(begin, end) {
-        return makeSegments(this, begin, end, CodePathSegment.newDisconnected);
+    makeDisconnected(startIndex, endIndex) {
+        return createSegments(this, startIndex, endIndex, CodePathSegment.newDisconnected);
     }
 
     /**
-     * Adds segments into this context.
-     * The added segments become the head.
-     * @param {CodePathSegment[]} segments Segments to add.
+     * Adds segments to the head of this context.
+     * @param {Array<CodePathSegment>} segments The segments to add.
      * @returns {void}
      */
     add(segments) {
         assert(segments.length >= this.count, `${segments.length} >= ${this.count}`);
-
         this.segmentsList.push(mergeExtraSegments(this, segments));
     }
 
     /**
-     * Replaces the head segments with given segments.
+     * Replaces the head segments with the given segments.
      * The current head segments are removed.
-     * @param {CodePathSegment[]} segments Segments to add.
+     * @param {Array<CodePathSegment>} replacementHeadSegments The new head segments.
      * @returns {void}
      */
-    replaceHead(segments) {
-        assert(segments.length >= this.count, `${segments.length} >= ${this.count}`);
-
-        this.segmentsList.splice(-1, 1, mergeExtraSegments(this, segments));
+    replaceHead(replacementHeadSegments) {
+        assert(
+            replacementHeadSegments.length >= this.count,
+            `${replacementHeadSegments.length} >= ${this.count}`
+        );
+        this.segmentsList.splice(-1, 1, mergeExtraSegments(this, replacementHeadSegments));
     }
 
     /**
      * Adds all segments of a given fork context into this context.
-     * @param {ForkContext} context A fork context to add.
+     * @param {ForkContext} otherForkContext The fork context to add from.
      * @returns {void}
      */
-    addAll(context) {
-        assert(context.count === this.count);
-
-        const source = context.segmentsList;
-
-        for (let i = 0; i < source.length; ++i) {
-            this.segmentsList.push(source[i]);
-        }
+    addAll(otherForkContext) {
+        assert(otherForkContext.count === this.count);
+        this.segmentsList.push(...otherForkContext.segmentsList);
     }
 
     /**
@@ -218,7 +316,8 @@ class ForkContext {
     }
 
     /**
-     * Creates the root fork context.
+     * Creates a new root context, meaning that there are no parent
+     * fork contexts.
      * @param {IdGenerator} idGenerator An identifier generator for segments.
      * @returns {ForkContext} New fork context.
      */
@@ -233,14 +332,16 @@ class ForkContext {
     /**
      * Creates an empty fork context preceded by a given context.
      * @param {ForkContext} parentContext The parent fork context.
-     * @param {boolean} forkLeavingPath A flag which shows inside of `finally` block.
+     * @param {boolean} shouldForkLeavingPath Indicates that we are inside of
+     *      a `finally` block and should therefore fork the path that leaves
+     *      `finally`.
      * @returns {ForkContext} New fork context.
      */
-    static newEmpty(parentContext, forkLeavingPath) {
+    static newEmpty(parentContext, shouldForkLeavingPath) {
         return new ForkContext(
             parentContext.idGenerator,
             parentContext,
-            (forkLeavingPath ? 2 : 1) * parentContext.count
+            (shouldForkLeavingPath ? 2 : 1) * parentContext.count
         );
     }
 }
diff --git a/tools/node_modules/eslint/lib/linter/config-comment-parser.js b/tools/node_modules/eslint/lib/linter/config-comment-parser.js
index 9aab3c44458546..cde261204f5ed9 100644
--- a/tools/node_modules/eslint/lib/linter/config-comment-parser.js
+++ b/tools/node_modules/eslint/lib/linter/config-comment-parser.js
@@ -139,7 +139,7 @@ module.exports = class ConfigCommentParser {
         const items = {};
 
         string.split(",").forEach(name => {
-            const trimmedName = name.trim();
+            const trimmedName = name.trim().replace(/^(?<quote>['"]?)(?<ruleId>.*)\k<quote>$/us, "$<ruleId>");
 
             if (trimmedName) {
                 items[trimmedName] = true;
diff --git a/tools/node_modules/eslint/lib/linter/linter.js b/tools/node_modules/eslint/lib/linter/linter.js
index 48b2bdbe5c3919..e195812e513a21 100644
--- a/tools/node_modules/eslint/lib/linter/linter.js
+++ b/tools/node_modules/eslint/lib/linter/linter.js
@@ -42,7 +42,8 @@ const
     ruleReplacements = require("../../conf/replacements.json");
 const { getRuleFromConfig } = require("../config/flat-config-helpers");
 const { FlatConfigArray } = require("../config/flat-config-array");
-
+const { RuleValidator } = require("../config/rule-validator");
+const { assertIsRuleOptions, assertIsRuleSeverity } = require("../config/flat-config-schema");
 const debug = require("debug")("eslint:linter");
 const MAX_AUTOFIX_PASSES = 10;
 const DEFAULT_PARSER_NAME = "espree";
@@ -50,7 +51,6 @@ const DEFAULT_ECMA_VERSION = 5;
 const commentParser = new ConfigCommentParser();
 const DEFAULT_ERROR_LOC = { start: { line: 1, column: 0 }, end: { line: 1, column: 1 } };
 const parserSymbol = Symbol.for("eslint.RuleTester.parser");
-const globals = require("../../conf/globals");
 
 //------------------------------------------------------------------------------
 // Typedefs
@@ -145,29 +145,6 @@ function isEspree(parser) {
     return !!(parser === espree || parser[parserSymbol] === espree);
 }
 
-/**
- * Retrieves globals for the given ecmaVersion.
- * @param {number} ecmaVersion The version to retrieve globals for.
- * @returns {Object} The globals for the given ecmaVersion.
- */
-function getGlobalsForEcmaVersion(ecmaVersion) {
-
-    switch (ecmaVersion) {
-        case 3:
-            return globals.es3;
-
-        case 5:
-            return globals.es5;
-
-        default:
-            if (ecmaVersion < 2015) {
-                return globals[`es${ecmaVersion + 2009}`];
-            }
-
-            return globals[`es${ecmaVersion}`];
-    }
-}
-
 /**
  * Ensures that variables representing built-in properties of the Global Object,
  * and any globals declared by special block comments, are present in the global
@@ -361,13 +338,13 @@ function extractDirectiveComment(value) {
  * Parses comments in file to extract file-specific config of rules, globals
  * and environments and merges them with global config; also code blocks
  * where reporting is disabled or enabled and merges them with reporting config.
- * @param {ASTNode} ast The top node of the AST.
+ * @param {SourceCode} sourceCode The SourceCode object to get comments from.
  * @param {function(string): {create: Function}} ruleMapper A map from rule IDs to defined rules
  * @param {string|null} warnInlineConfig If a string then it should warn directive comments as disabled. The string value is the config name what the setting came from.
  * @returns {{configuredRules: Object, enabledGlobals: {value:string,comment:Token}[], exportedVariables: Object, problems: LintMessage[], disableDirectives: DisableDirective[]}}
  * A collection of the directive comments that were found, along with any problems that occurred when parsing
  */
-function getDirectiveComments(ast, ruleMapper, warnInlineConfig) {
+function getDirectiveComments(sourceCode, ruleMapper, warnInlineConfig) {
     const configuredRules = {};
     const enabledGlobals = Object.create(null);
     const exportedVariables = {};
@@ -377,7 +354,7 @@ function getDirectiveComments(ast, ruleMapper, warnInlineConfig) {
         builtInRules: Rules
     });
 
-    ast.comments.filter(token => token.type !== "Shebang").forEach(comment => {
+    sourceCode.getInlineConfigNodes().filter(token => token.type !== "Shebang").forEach(comment => {
         const { directivePart, justificationPart } = extractDirectiveComment(comment.value);
 
         const match = directivesPattern.exec(directivePart);
@@ -511,6 +488,69 @@ function getDirectiveComments(ast, ruleMapper, warnInlineConfig) {
     };
 }
 
+/**
+ * Parses comments in file to extract disable directives.
+ * @param {SourceCode} sourceCode The SourceCode object to get comments from.
+ * @param {function(string): {create: Function}} ruleMapper A map from rule IDs to defined rules
+ * @returns {{problems: LintMessage[], disableDirectives: DisableDirective[]}}
+ * A collection of the directive comments that were found, along with any problems that occurred when parsing
+ */
+function getDirectiveCommentsForFlatConfig(sourceCode, ruleMapper) {
+    const problems = [];
+    const disableDirectives = [];
+
+    sourceCode.getInlineConfigNodes().filter(token => token.type !== "Shebang").forEach(comment => {
+        const { directivePart, justificationPart } = extractDirectiveComment(comment.value);
+
+        const match = directivesPattern.exec(directivePart);
+
+        if (!match) {
+            return;
+        }
+        const directiveText = match[1];
+        const lineCommentSupported = /^eslint-disable-(next-)?line$/u.test(directiveText);
+
+        if (comment.type === "Line" && !lineCommentSupported) {
+            return;
+        }
+
+        if (directiveText === "eslint-disable-line" && comment.loc.start.line !== comment.loc.end.line) {
+            const message = `${directiveText} comment should not span multiple lines.`;
+
+            problems.push(createLintingProblem({
+                ruleId: null,
+                message,
+                loc: comment.loc
+            }));
+            return;
+        }
+
+        const directiveValue = directivePart.slice(match.index + directiveText.length);
+
+        switch (directiveText) {
+            case "eslint-disable":
+            case "eslint-enable":
+            case "eslint-disable-next-line":
+            case "eslint-disable-line": {
+                const directiveType = directiveText.slice("eslint-".length);
+                const options = { commentToken: comment, type: directiveType, value: directiveValue, justification: justificationPart, ruleMapper };
+                const { directives, directiveProblems } = createDisableDirectives(options);
+
+                disableDirectives.push(...directives);
+                problems.push(...directiveProblems);
+                break;
+            }
+
+            // no default
+        }
+    });
+
+    return {
+        problems,
+        disableDirectives
+    };
+}
+
 /**
  * Normalize ECMAScript version from the initial config
  * @param {Parser} parser The parser which uses this options.
@@ -1313,7 +1353,7 @@ class Linter {
 
         const sourceCode = slots.lastSourceCode;
         const commentDirectives = options.allowInlineConfig
-            ? getDirectiveComments(sourceCode.ast, ruleId => getRule(slots, ruleId), options.warnInlineConfig)
+            ? getDirectiveComments(sourceCode, ruleId => getRule(slots, ruleId), options.warnInlineConfig)
             : { configuredRules: {}, enabledGlobals: {}, exportedVariables: {}, problems: [], disableDirectives: [] };
 
         // augment global scope with declared global variables
@@ -1324,7 +1364,6 @@ class Linter {
         );
 
         const configuredRules = Object.assign({}, config.rules, commentDirectives.configuredRules);
-
         let lintingProblems;
 
         try {
@@ -1540,19 +1579,6 @@ class Linter {
             languageOptions.ecmaVersion
         );
 
-        /*
-         * add configured globals and language globals
-         *
-         * using Object.assign instead of object spread for performance reasons
-         * https://github.com/eslint/eslint/issues/16302
-         */
-        const configuredGlobals = Object.assign(
-            {},
-            getGlobalsForEcmaVersion(languageOptions.ecmaVersion),
-            languageOptions.sourceType === "commonjs" ? globals.commonjs : void 0,
-            languageOptions.globals
-        );
-
         // double check that there is a parser to avoid mysterious error messages
         if (!languageOptions.parser) {
             throw new TypeError(`No parser specified for ${options.filename}`);
@@ -1608,25 +1634,113 @@ class Linter {
         }
 
         const sourceCode = slots.lastSourceCode;
-        const commentDirectives = options.allowInlineConfig
-            ? getDirectiveComments(
-                sourceCode.ast,
-                ruleId => getRuleFromConfig(ruleId, config),
-                options.warnInlineConfig
-            )
-            : { configuredRules: {}, enabledGlobals: {}, exportedVariables: {}, problems: [], disableDirectives: [] };
 
-        // augment global scope with declared global variables
-        addDeclaredGlobals(
-            sourceCode.scopeManager.scopes[0],
-            configuredGlobals,
-            { exportedVariables: commentDirectives.exportedVariables, enabledGlobals: commentDirectives.enabledGlobals }
-        );
+        /*
+         * Make adjustments based on the language options. For JavaScript,
+         * this is primarily about adding variables into the global scope
+         * to account for ecmaVersion and configured globals.
+         */
+        sourceCode.applyLanguageOptions(languageOptions);
 
-        const configuredRules = Object.assign({}, config.rules, commentDirectives.configuredRules);
+        const mergedInlineConfig = {
+            rules: {}
+        };
+        const inlineConfigProblems = [];
+
+        /*
+         * Inline config can be either enabled or disabled. If disabled, it's possible
+         * to detect the inline config and emit a warning (though this is not required).
+         * So we first check to see if inline config is allowed at all, and if so, we
+         * need to check if it's a warning or not.
+         */
+        if (options.allowInlineConfig) {
+
+            // if inline config should warn then add the warnings
+            if (options.warnInlineConfig) {
+                sourceCode.getInlineConfigNodes().forEach(node => {
+                    inlineConfigProblems.push(createLintingProblem({
+                        ruleId: null,
+                        message: `'${sourceCode.text.slice(node.range[0], node.range[1])}' has no effect because you have 'noInlineConfig' setting in ${options.warnInlineConfig}.`,
+                        loc: node.loc,
+                        severity: 1
+                    }));
+
+                });
+            } else {
+                const inlineConfigResult = sourceCode.applyInlineConfig();
+
+                inlineConfigProblems.push(
+                    ...inlineConfigResult.problems
+                        .map(createLintingProblem)
+                        .map(problem => {
+                            problem.fatal = true;
+                            return problem;
+                        })
+                );
+
+                // next we need to verify information about the specified rules
+                const ruleValidator = new RuleValidator();
+
+                for (const { config: inlineConfig, node } of inlineConfigResult.configs) {
+
+                    Object.keys(inlineConfig.rules).forEach(ruleId => {
+                        const rule = getRuleFromConfig(ruleId, config);
+                        const ruleValue = inlineConfig.rules[ruleId];
+
+                        if (!rule) {
+                            inlineConfigProblems.push(createLintingProblem({ ruleId, loc: node.loc }));
+                            return;
+                        }
+
+                        try {
+
+                            const ruleOptions = Array.isArray(ruleValue) ? ruleValue : [ruleValue];
+
+                            assertIsRuleOptions(ruleId, ruleValue);
+                            assertIsRuleSeverity(ruleId, ruleOptions[0]);
+
+                            ruleValidator.validate({
+                                plugins: config.plugins,
+                                rules: {
+                                    [ruleId]: ruleOptions
+                                }
+                            });
+                            mergedInlineConfig.rules[ruleId] = ruleValue;
+                        } catch (err) {
+
+                            let baseMessage = err.message.slice(
+                                err.message.startsWith("Key \"rules\":")
+                                    ? err.message.indexOf(":", 12) + 1
+                                    : err.message.indexOf(":") + 1
+                            ).trim();
+
+                            if (err.messageTemplate) {
+                                baseMessage += ` You passed "${ruleValue}".`;
+                            }
+
+                            inlineConfigProblems.push(createLintingProblem({
+                                ruleId,
+                                message: `Inline configuration for rule "${ruleId}" is invalid:\n\t${baseMessage}\n`,
+                                loc: node.loc
+                            }));
+                        }
+                    });
+                }
+            }
+        }
 
+        const commentDirectives = options.allowInlineConfig && !options.warnInlineConfig
+            ? getDirectiveCommentsForFlatConfig(
+                sourceCode,
+                ruleId => getRuleFromConfig(ruleId, config)
+            )
+            : { problems: [], disableDirectives: [] };
+
+        const configuredRules = Object.assign({}, config.rules, mergedInlineConfig.rules);
         let lintingProblems;
 
+        sourceCode.finalize();
+
         try {
             lintingProblems = runRules(
                 sourceCode,
@@ -1667,6 +1781,7 @@ class Linter {
             disableFixes: options.disableFixes,
             problems: lintingProblems
                 .concat(commentDirectives.problems)
+                .concat(inlineConfigProblems)
                 .sort((problemA, problemB) => problemA.line - problemB.line || problemA.column - problemB.column),
             reportUnusedDisableDirectives: options.reportUnusedDisableDirectives
         });
diff --git a/tools/node_modules/eslint/lib/options.js b/tools/node_modules/eslint/lib/options.js
index 2bc4018afb5d5b..ae9a5d5552a239 100644
--- a/tools/node_modules/eslint/lib/options.js
+++ b/tools/node_modules/eslint/lib/options.js
@@ -55,6 +55,7 @@ const optionator = require("optionator");
  * @property {string} [stdinFilename] Specify filename to process STDIN as
  * @property {boolean} quiet Report errors only
  * @property {boolean} [version] Output the version number
+ * @property {boolean} warnIgnored Show warnings when the file list includes ignored files
  * @property {string[]} _ Positional filenames or patterns
  */
 
@@ -139,6 +140,17 @@ module.exports = function(usingFlatConfig) {
         };
     }
 
+    let warnIgnoredFlag;
+
+    if (usingFlatConfig) {
+        warnIgnoredFlag = {
+            option: "warn-ignored",
+            type: "Boolean",
+            default: "true",
+            description: "Suppress warnings when the file list includes ignored files"
+        };
+    }
+
     return optionator({
         prepend: "eslint [options] file.js [file.js] [dir]",
         defaults: {
@@ -349,6 +361,7 @@ module.exports = function(usingFlatConfig) {
                 default: "false",
                 description: "Exit with exit code 2 in case of fatal error"
             },
+            warnIgnoredFlag,
             {
                 option: "debug",
                 type: "Boolean",
diff --git a/tools/node_modules/eslint/lib/rule-tester/flat-rule-tester.js b/tools/node_modules/eslint/lib/rule-tester/flat-rule-tester.js
index d5f5981e67ee08..51cb73b5f8023d 100644
--- a/tools/node_modules/eslint/lib/rule-tester/flat-rule-tester.js
+++ b/tools/node_modules/eslint/lib/rule-tester/flat-rule-tester.js
@@ -133,6 +133,15 @@ const suggestionObjectParameters = new Set([
 ]);
 const friendlySuggestionObjectParameterList = `[${[...suggestionObjectParameters].map(key => `'${key}'`).join(", ")}]`;
 
+const forbiddenMethods = [
+    "applyInlineConfig",
+    "applyLanguageOptions",
+    "finalize"
+];
+
+/** @type {Map<string,WeakSet>} */
+const forbiddenMethodCalls = new Map(forbiddenMethods.map(methodName => ([methodName, new WeakSet()])));
+
 const hasOwnProperty = Function.call.bind(Object.hasOwnProperty);
 
 /**
@@ -291,6 +300,34 @@ function emitCodePathCurrentSegmentsWarning(ruleName) {
     }
 }
 
+/**
+ * Function to replace forbidden `SourceCode` methods. Allows just one call per method.
+ * @param {string} methodName The name of the method to forbid.
+ * @param {Function} prototype The prototype with the original method to call.
+ * @returns {Function} The function that throws the error.
+ */
+function throwForbiddenMethodError(methodName, prototype) {
+
+    const original = prototype[methodName];
+
+    return function(...args) {
+
+        const called = forbiddenMethodCalls.get(methodName);
+
+        /* eslint-disable no-invalid-this -- needed to operate as a method. */
+        if (!called.has(this)) {
+            called.add(this);
+
+            return original.apply(this, args);
+        }
+        /* eslint-enable no-invalid-this -- not needed past this point */
+
+        throw new Error(
+            `\`SourceCode#${methodName}()\` cannot be called inside a rule.`
+        );
+    };
+}
+
 //------------------------------------------------------------------------------
 // Public Interface
 //------------------------------------------------------------------------------
@@ -498,6 +535,7 @@ class FlatRuleTester {
         }
 
         const baseConfig = [
+            { files: ["**"] }, // Make sure the default config matches for all files
             {
                 plugins: {
 
@@ -679,11 +717,6 @@ class FlatRuleTester {
                 }
             }
 
-            // Verify the code.
-            const { getComments } = SourceCode.prototype;
-            const originalCurrentSegments = Object.getOwnPropertyDescriptor(CodePath.prototype, "currentSegments");
-            let messages;
-
             // check for validation errors
             try {
                 configs.normalizeSync();
@@ -693,6 +726,11 @@ class FlatRuleTester {
                 throw error;
             }
 
+            // Verify the code.
+            const { getComments, applyLanguageOptions, applyInlineConfig, finalize } = SourceCode.prototype;
+            const originalCurrentSegments = Object.getOwnPropertyDescriptor(CodePath.prototype, "currentSegments");
+            let messages;
+
             try {
                 SourceCode.prototype.getComments = getCommentsDeprecation;
                 Object.defineProperty(CodePath.prototype, "currentSegments", {
@@ -702,10 +740,17 @@ class FlatRuleTester {
                     }
                 });
 
+                forbiddenMethods.forEach(methodName => {
+                    SourceCode.prototype[methodName] = throwForbiddenMethodError(methodName, SourceCode.prototype);
+                });
+
                 messages = linter.verify(code, configs, filename);
             } finally {
                 SourceCode.prototype.getComments = getComments;
                 Object.defineProperty(CodePath.prototype, "currentSegments", originalCurrentSegments);
+                SourceCode.prototype.applyInlineConfig = applyInlineConfig;
+                SourceCode.prototype.applyLanguageOptions = applyLanguageOptions;
+                SourceCode.prototype.finalize = finalize;
             }
 
 
diff --git a/tools/node_modules/eslint/lib/rule-tester/rule-tester.js b/tools/node_modules/eslint/lib/rule-tester/rule-tester.js
index 82d79790a31640..3bc80ab1837a6f 100644
--- a/tools/node_modules/eslint/lib/rule-tester/rule-tester.js
+++ b/tools/node_modules/eslint/lib/rule-tester/rule-tester.js
@@ -163,6 +163,12 @@ const suggestionObjectParameters = new Set([
 ]);
 const friendlySuggestionObjectParameterList = `[${[...suggestionObjectParameters].map(key => `'${key}'`).join(", ")}]`;
 
+const forbiddenMethods = [
+    "applyInlineConfig",
+    "applyLanguageOptions",
+    "finalize"
+];
+
 const hasOwnProperty = Function.call.bind(Object.hasOwnProperty);
 
 const DEPRECATED_SOURCECODE_PASSTHROUGHS = {
@@ -186,7 +192,12 @@ const DEPRECATED_SOURCECODE_PASSTHROUGHS = {
     getTokens: "getTokens",
     getTokensAfter: "getTokensAfter",
     getTokensBefore: "getTokensBefore",
-    getTokensBetween: "getTokensBetween"
+    getTokensBetween: "getTokensBetween",
+
+    getScope: "getScope",
+    getAncestors: "getAncestors",
+    getDeclaredVariables: "getDeclaredVariables",
+    markVariableAsUsed: "markVariableAsUsed"
 };
 
 /**
@@ -330,6 +341,19 @@ function getCommentsDeprecation() {
     );
 }
 
+/**
+ * Function to replace forbidden `SourceCode` methods.
+ * @param {string} methodName The name of the method to forbid.
+ * @returns {Function} The function that throws the error.
+ */
+function throwForbiddenMethodError(methodName) {
+    return () => {
+        throw new Error(
+            `\`SourceCode#${methodName}()\` cannot be called inside a rule.`
+        );
+    };
+}
+
 /**
  * Emit a deprecation warning if function-style format is being used.
  * @param {string} ruleName Name of the rule.
@@ -391,6 +415,22 @@ function emitCodePathCurrentSegmentsWarning(ruleName) {
     }
 }
 
+/**
+ * Emit a deprecation warning if `context.parserServices` is used.
+ * @param {string} ruleName Name of the rule.
+ * @returns {void}
+ */
+function emitParserServicesWarning(ruleName) {
+    if (!emitParserServicesWarning[`warned-${ruleName}`]) {
+        emitParserServicesWarning[`warned-${ruleName}`] = true;
+        process.emitWarning(
+            `"${ruleName}" rule is using \`context.parserServices\`, which is deprecated and will be removed in ESLint v9. Please use \`sourceCode.parserServices\` instead.`,
+            "DeprecationWarning"
+        );
+    }
+}
+
+
 //------------------------------------------------------------------------------
 // Public Interface
 //------------------------------------------------------------------------------
@@ -622,26 +662,37 @@ class RuleTester {
                 freezeDeeply(context.settings);
                 freezeDeeply(context.parserOptions);
 
-                const newContext = Object.freeze(
-                    Object.create(
-                        context,
-                        Object.fromEntries(Object.keys(DEPRECATED_SOURCECODE_PASSTHROUGHS).map(methodName => [
-                            methodName,
-                            {
-                                value(...args) {
-
-                                    // emit deprecation warning
-                                    emitDeprecatedContextMethodWarning(ruleName, methodName);
-
-                                    // call the original method
-                                    return context[methodName].call(this, ...args);
-                                },
-                                enumerable: true
-                            }
-                        ]))
-                    )
+                // wrap all deprecated methods
+                const newContext = Object.create(
+                    context,
+                    Object.fromEntries(Object.keys(DEPRECATED_SOURCECODE_PASSTHROUGHS).map(methodName => [
+                        methodName,
+                        {
+                            value(...args) {
+
+                                // emit deprecation warning
+                                emitDeprecatedContextMethodWarning(ruleName, methodName);
+
+                                // call the original method
+                                return context[methodName].call(this, ...args);
+                            },
+                            enumerable: true
+                        }
+                    ]))
                 );
 
+                // emit warning about context.parserServices
+                const parserServices = context.parserServices;
+
+                Object.defineProperty(newContext, "parserServices", {
+                    get() {
+                        emitParserServicesWarning(ruleName);
+                        return parserServices;
+                    }
+                });
+
+                Object.freeze(newContext);
+
                 return (typeof rule === "function" ? rule : rule.create)(newContext);
             }
         }));
@@ -761,7 +812,7 @@ class RuleTester {
             validate(config, "rule-tester", id => (id === ruleName ? rule : null));
 
             // Verify the code.
-            const { getComments } = SourceCode.prototype;
+            const { getComments, applyLanguageOptions, applyInlineConfig, finalize } = SourceCode.prototype;
             const originalCurrentSegments = Object.getOwnPropertyDescriptor(CodePath.prototype, "currentSegments");
             let messages;
 
@@ -774,10 +825,17 @@ class RuleTester {
                     }
                 });
 
+                forbiddenMethods.forEach(methodName => {
+                    SourceCode.prototype[methodName] = throwForbiddenMethodError(methodName);
+                });
+
                 messages = linter.verify(code, config, filename);
             } finally {
                 SourceCode.prototype.getComments = getComments;
                 Object.defineProperty(CodePath.prototype, "currentSegments", originalCurrentSegments);
+                SourceCode.prototype.applyInlineConfig = applyInlineConfig;
+                SourceCode.prototype.applyLanguageOptions = applyLanguageOptions;
+                SourceCode.prototype.finalize = finalize;
             }
 
             const fatalErrorMessage = messages.find(m => m.fatal);
diff --git a/tools/node_modules/eslint/lib/rules/array-callback-return.js b/tools/node_modules/eslint/lib/rules/array-callback-return.js
index 24a33d16c997df..6d8f258fa140f2 100644
--- a/tools/node_modules/eslint/lib/rules/array-callback-return.js
+++ b/tools/node_modules/eslint/lib/rules/array-callback-return.js
@@ -136,6 +136,76 @@ function getArrayMethodName(node) {
     return null;
 }
 
+/**
+ * Checks if the given node is a void expression.
+ * @param {ASTNode} node The node to check.
+ * @returns {boolean} - `true` if the node is a void expression
+ */
+function isExpressionVoid(node) {
+    return node.type === "UnaryExpression" && node.operator === "void";
+}
+
+/**
+ * Fixes the linting error by prepending "void " to the given node
+ * @param {Object} sourceCode context given by context.sourceCode
+ * @param {ASTNode} node The node to fix.
+ * @param {Object} fixer The fixer object provided by ESLint.
+ * @returns {Array<Object>} - An array of fix objects to apply to the node.
+ */
+function voidPrependFixer(sourceCode, node, fixer) {
+
+    const requiresParens =
+
+        // prepending `void ` will fail if the node has a lower precedence than void
+        astUtils.getPrecedence(node) < astUtils.getPrecedence({ type: "UnaryExpression", operator: "void" }) &&
+
+        // check if there are parentheses around the node to avoid redundant parentheses
+        !astUtils.isParenthesised(sourceCode, node);
+
+    // avoid parentheses issues
+    const returnOrArrowToken = sourceCode.getTokenBefore(
+        node,
+        node.parent.type === "ArrowFunctionExpression"
+            ? astUtils.isArrowToken
+
+            // isReturnToken
+            : token => token.type === "Keyword" && token.value === "return"
+    );
+
+    const firstToken = sourceCode.getTokenAfter(returnOrArrowToken);
+
+    const prependSpace =
+
+        // is return token, as => allows void to be adjacent
+        returnOrArrowToken.value === "return" &&
+
+        // If two tokens (return and "(") are adjacent
+        returnOrArrowToken.range[1] === firstToken.range[0];
+
+    return [
+        fixer.insertTextBefore(firstToken, `${prependSpace ? " " : ""}void ${requiresParens ? "(" : ""}`),
+        fixer.insertTextAfter(node, requiresParens ? ")" : "")
+    ];
+}
+
+/**
+ * Fixes the linting error by `wrapping {}` around the given node's body.
+ * @param {Object} sourceCode context given by context.sourceCode
+ * @param {ASTNode} node The node to fix.
+ * @param {Object} fixer The fixer object provided by ESLint.
+ * @returns {Array<Object>} - An array of fix objects to apply to the node.
+ */
+function curlyWrapFixer(sourceCode, node, fixer) {
+    const arrowToken = sourceCode.getTokenBefore(node.body, astUtils.isArrowToken);
+    const firstToken = sourceCode.getTokenAfter(arrowToken);
+    const lastToken = sourceCode.getLastToken(node);
+
+    return [
+        fixer.insertTextBefore(firstToken, "{"),
+        fixer.insertTextAfter(lastToken, "}")
+    ];
+}
+
 //------------------------------------------------------------------------------
 // Rule Definition
 //------------------------------------------------------------------------------
@@ -151,6 +221,9 @@ module.exports = {
             url: "https://eslint.org/docs/latest/rules/array-callback-return"
         },
 
+        // eslint-disable-next-line eslint-plugin/require-meta-has-suggestions -- false positive
+        hasSuggestions: true,
+
         schema: [
             {
                 type: "object",
@@ -162,6 +235,10 @@ module.exports = {
                     checkForEach: {
                         type: "boolean",
                         default: false
+                    },
+                    allowVoid: {
+                        type: "boolean",
+                        default: false
                     }
                 },
                 additionalProperties: false
@@ -172,13 +249,15 @@ module.exports = {
             expectedAtEnd: "{{arrayMethodName}}() expects a value to be returned at the end of {{name}}.",
             expectedInside: "{{arrayMethodName}}() expects a return value from {{name}}.",
             expectedReturnValue: "{{arrayMethodName}}() expects a return value from {{name}}.",
-            expectedNoReturnValue: "{{arrayMethodName}}() expects no useless return value from {{name}}."
+            expectedNoReturnValue: "{{arrayMethodName}}() expects no useless return value from {{name}}.",
+            wrapBraces: "Wrap the expression in `{}`.",
+            prependVoid: "Prepend `void` to the expression."
         }
     },
 
     create(context) {
 
-        const options = context.options[0] || { allowImplicit: false, checkForEach: false };
+        const options = context.options[0] || { allowImplicit: false, checkForEach: false, allowVoid: false };
         const sourceCode = context.sourceCode;
 
         let funcInfo = {
@@ -205,26 +284,56 @@ module.exports = {
                 return;
             }
 
-            let messageId = null;
+            const messageAndSuggestions = { messageId: "", suggest: [] };
 
             if (funcInfo.arrayMethodName === "forEach") {
                 if (options.checkForEach && node.type === "ArrowFunctionExpression" && node.expression) {
-                    messageId = "expectedNoReturnValue";
+
+                    if (options.allowVoid) {
+                        if (isExpressionVoid(node.body)) {
+                            return;
+                        }
+
+                        messageAndSuggestions.messageId = "expectedNoReturnValue";
+                        messageAndSuggestions.suggest = [
+                            {
+                                messageId: "wrapBraces",
+                                fix(fixer) {
+                                    return curlyWrapFixer(sourceCode, node, fixer);
+                                }
+                            },
+                            {
+                                messageId: "prependVoid",
+                                fix(fixer) {
+                                    return voidPrependFixer(sourceCode, node.body, fixer);
+                                }
+                            }
+                        ];
+                    } else {
+                        messageAndSuggestions.messageId = "expectedNoReturnValue";
+                        messageAndSuggestions.suggest = [{
+                            messageId: "wrapBraces",
+                            fix(fixer) {
+                                return curlyWrapFixer(sourceCode, node, fixer);
+                            }
+                        }];
+                    }
                 }
             } else {
                 if (node.body.type === "BlockStatement" && isAnySegmentReachable(funcInfo.currentSegments)) {
-                    messageId = funcInfo.hasReturn ? "expectedAtEnd" : "expectedInside";
+                    messageAndSuggestions.messageId = funcInfo.hasReturn ? "expectedAtEnd" : "expectedInside";
                 }
             }
 
-            if (messageId) {
+            if (messageAndSuggestions.messageId) {
                 const name = astUtils.getFunctionNameWithKind(node);
 
                 context.report({
                     node,
                     loc: astUtils.getFunctionHeadLoc(node, sourceCode),
-                    messageId,
-                    data: { name, arrayMethodName: fullMethodName(funcInfo.arrayMethodName) }
+                    messageId: messageAndSuggestions.messageId,
+                    data: { name, arrayMethodName: fullMethodName(funcInfo.arrayMethodName) },
+                    suggest: messageAndSuggestions.suggest.length !== 0 ? messageAndSuggestions.suggest : null
                 });
             }
         }
@@ -285,30 +394,46 @@ module.exports = {
 
                 funcInfo.hasReturn = true;
 
-                let messageId = null;
+                const messageAndSuggestions = { messageId: "", suggest: [] };
 
                 if (funcInfo.arrayMethodName === "forEach") {
 
                     // if checkForEach: true, returning a value at any path inside a forEach is not allowed
                     if (options.checkForEach && node.argument) {
-                        messageId = "expectedNoReturnValue";
+
+                        if (options.allowVoid) {
+                            if (isExpressionVoid(node.argument)) {
+                                return;
+                            }
+
+                            messageAndSuggestions.messageId = "expectedNoReturnValue";
+                            messageAndSuggestions.suggest = [{
+                                messageId: "prependVoid",
+                                fix(fixer) {
+                                    return voidPrependFixer(sourceCode, node.argument, fixer);
+                                }
+                            }];
+                        } else {
+                            messageAndSuggestions.messageId = "expectedNoReturnValue";
+                        }
                     }
                 } else {
 
                     // if allowImplicit: false, should also check node.argument
                     if (!options.allowImplicit && !node.argument) {
-                        messageId = "expectedReturnValue";
+                        messageAndSuggestions.messageId = "expectedReturnValue";
                     }
                 }
 
-                if (messageId) {
+                if (messageAndSuggestions.messageId) {
                     context.report({
                         node,
-                        messageId,
+                        messageId: messageAndSuggestions.messageId,
                         data: {
                             name: astUtils.getFunctionNameWithKind(funcInfo.node),
                             arrayMethodName: fullMethodName(funcInfo.arrayMethodName)
-                        }
+                        },
+                        suggest: messageAndSuggestions.suggest.length !== 0 ? messageAndSuggestions.suggest : null
                     });
                 }
             },
diff --git a/tools/node_modules/eslint/lib/rules/index.js b/tools/node_modules/eslint/lib/rules/index.js
index e42639656f7320..840abe73b0fbfe 100644
--- a/tools/node_modules/eslint/lib/rules/index.js
+++ b/tools/node_modules/eslint/lib/rules/index.js
@@ -175,6 +175,7 @@ module.exports = new LazyLoadingRuleMap(Object.entries({
     "no-new-wrappers": () => require("./no-new-wrappers"),
     "no-nonoctal-decimal-escape": () => require("./no-nonoctal-decimal-escape"),
     "no-obj-calls": () => require("./no-obj-calls"),
+    "no-object-constructor": () => require("./no-object-constructor"),
     "no-octal": () => require("./no-octal"),
     "no-octal-escape": () => require("./no-octal-escape"),
     "no-param-reassign": () => require("./no-param-reassign"),
diff --git a/tools/node_modules/eslint/lib/rules/logical-assignment-operators.js b/tools/node_modules/eslint/lib/rules/logical-assignment-operators.js
index 27ca585e99581d..c084c04c8eda08 100644
--- a/tools/node_modules/eslint/lib/rules/logical-assignment-operators.js
+++ b/tools/node_modules/eslint/lib/rules/logical-assignment-operators.js
@@ -150,6 +150,31 @@ function isInsideWithBlock(node) {
     return node.parent.type === "WithStatement" && node.parent.body === node ? true : isInsideWithBlock(node.parent);
 }
 
+/**
+ * Gets the leftmost operand of a consecutive logical expression.
+ * @param {SourceCode} sourceCode The ESLint source code object
+ * @param {LogicalExpression} node LogicalExpression
+ * @returns {Expression} Leftmost operand
+ */
+function getLeftmostOperand(sourceCode, node) {
+    let left = node.left;
+
+    while (left.type === "LogicalExpression" && left.operator === node.operator) {
+
+        if (astUtils.isParenthesised(sourceCode, left)) {
+
+            /*
+             * It should have associativity,
+             * but ignore it if use parentheses to make the evaluation order clear.
+             */
+            return left;
+        }
+        left = left.left;
+    }
+    return left;
+
+}
+
 //------------------------------------------------------------------------------
 // Rule Definition
 //------------------------------------------------------------------------------
@@ -318,7 +343,10 @@ module.exports = {
 
             // foo = foo || bar
             "AssignmentExpression[operator='='][right.type='LogicalExpression']"(assignment) {
-                if (!astUtils.isSameReference(assignment.left, assignment.right.left)) {
+                const leftOperand = getLeftmostOperand(sourceCode, assignment.right);
+
+                if (!astUtils.isSameReference(assignment.left, leftOperand)
+                ) {
                     return;
                 }
 
@@ -342,10 +370,10 @@ module.exports = {
                         yield ruleFixer.insertTextBefore(assignmentOperatorToken, assignment.right.operator);
 
                         // -> foo ||= bar
-                        const logicalOperatorToken = getOperatorToken(assignment.right);
+                        const logicalOperatorToken = getOperatorToken(leftOperand.parent);
                         const firstRightOperandToken = sourceCode.getTokenAfter(logicalOperatorToken);
 
-                        yield ruleFixer.removeRange([assignment.right.range[0], firstRightOperandToken.range[0]]);
+                        yield ruleFixer.removeRange([leftOperand.parent.range[0], firstRightOperandToken.range[0]]);
                     }
                 };
 
diff --git a/tools/node_modules/eslint/lib/rules/no-misleading-character-class.js b/tools/node_modules/eslint/lib/rules/no-misleading-character-class.js
index 99aa9404868f6c..20591df2cc9952 100644
--- a/tools/node_modules/eslint/lib/rules/no-misleading-character-class.js
+++ b/tools/node_modules/eslint/lib/rules/no-misleading-character-class.js
@@ -13,27 +13,34 @@ const { isValidWithUnicodeFlag } = require("./utils/regular-expressions");
 // Helpers
 //------------------------------------------------------------------------------
 
+/**
+ * @typedef {import('@eslint-community/regexpp').AST.Character} Character
+ * @typedef {import('@eslint-community/regexpp').AST.CharacterClassElement} CharacterClassElement
+ */
+
 /**
  * Iterate character sequences of a given nodes.
  *
  * CharacterClassRange syntax can steal a part of character sequence,
  * so this function reverts CharacterClassRange syntax and restore the sequence.
- * @param {import('@eslint-community/regexpp').AST.CharacterClassElement[]} nodes The node list to iterate character sequences.
- * @returns {IterableIterator<number[]>} The list of character sequences.
+ * @param {CharacterClassElement[]} nodes The node list to iterate character sequences.
+ * @returns {IterableIterator<Character[]>} The list of character sequences.
  */
 function *iterateCharacterSequence(nodes) {
+
+    /** @type {Character[]} */
     let seq = [];
 
     for (const node of nodes) {
         switch (node.type) {
             case "Character":
-                seq.push(node.value);
+                seq.push(node);
                 break;
 
             case "CharacterClassRange":
-                seq.push(node.min.value);
+                seq.push(node.min);
                 yield seq;
-                seq = [node.max.value];
+                seq = [node.max];
                 break;
 
             case "CharacterSet":
@@ -55,32 +62,74 @@ function *iterateCharacterSequence(nodes) {
     }
 }
 
+
+/**
+ * Checks whether the given character node is a Unicode code point escape or not.
+ * @param {Character} char the character node to check.
+ * @returns {boolean} `true` if the character node is a Unicode code point escape.
+ */
+function isUnicodeCodePointEscape(char) {
+    return /^\\u\{[\da-f]+\}$/iu.test(char.raw);
+}
+
+/**
+ * Each function returns `true` if it detects that kind of problem.
+ * @type {Record<string, (chars: Character[]) => boolean>}
+ */
 const hasCharacterSequence = {
     surrogatePairWithoutUFlag(chars) {
-        return chars.some((c, i) => i !== 0 && isSurrogatePair(chars[i - 1], c));
+        return chars.some((c, i) => {
+            if (i === 0) {
+                return false;
+            }
+            const c1 = chars[i - 1];
+
+            return (
+                isSurrogatePair(c1.value, c.value) &&
+                !isUnicodeCodePointEscape(c1) &&
+                !isUnicodeCodePointEscape(c)
+            );
+        });
+    },
+
+    surrogatePair(chars) {
+        return chars.some((c, i) => {
+            if (i === 0) {
+                return false;
+            }
+            const c1 = chars[i - 1];
+
+            return (
+                isSurrogatePair(c1.value, c.value) &&
+                (
+                    isUnicodeCodePointEscape(c1) ||
+                    isUnicodeCodePointEscape(c)
+                )
+            );
+        });
     },
 
     combiningClass(chars) {
         return chars.some((c, i) => (
             i !== 0 &&
-            isCombiningCharacter(c) &&
-            !isCombiningCharacter(chars[i - 1])
+            isCombiningCharacter(c.value) &&
+            !isCombiningCharacter(chars[i - 1].value)
         ));
     },
 
     emojiModifier(chars) {
         return chars.some((c, i) => (
             i !== 0 &&
-            isEmojiModifier(c) &&
-            !isEmojiModifier(chars[i - 1])
+            isEmojiModifier(c.value) &&
+            !isEmojiModifier(chars[i - 1].value)
         ));
     },
 
     regionalIndicatorSymbol(chars) {
         return chars.some((c, i) => (
             i !== 0 &&
-            isRegionalIndicatorSymbol(c) &&
-            isRegionalIndicatorSymbol(chars[i - 1])
+            isRegionalIndicatorSymbol(c.value) &&
+            isRegionalIndicatorSymbol(chars[i - 1].value)
         ));
     },
 
@@ -90,9 +139,9 @@ const hasCharacterSequence = {
         return chars.some((c, i) => (
             i !== 0 &&
             i !== lastIndex &&
-            c === 0x200d &&
-            chars[i - 1] !== 0x200d &&
-            chars[i + 1] !== 0x200d
+            c.value === 0x200d &&
+            chars[i - 1].value !== 0x200d &&
+            chars[i + 1].value !== 0x200d
         ));
     }
 };
@@ -120,6 +169,7 @@ module.exports = {
 
         messages: {
             surrogatePairWithoutUFlag: "Unexpected surrogate pair in character class. Use 'u' flag.",
+            surrogatePair: "Unexpected surrogate pair in character class.",
             combiningClass: "Unexpected combined character in character class.",
             emojiModifier: "Unexpected modified Emoji in character class.",
             regionalIndicatorSymbol: "Unexpected national flag in character class.",
diff --git a/tools/node_modules/eslint/lib/rules/no-new-object.js b/tools/node_modules/eslint/lib/rules/no-new-object.js
index 08a482be715034..06275f47125134 100644
--- a/tools/node_modules/eslint/lib/rules/no-new-object.js
+++ b/tools/node_modules/eslint/lib/rules/no-new-object.js
@@ -1,6 +1,7 @@
 /**
  * @fileoverview A rule to disallow calls to the Object constructor
  * @author Matt DuVall <http://www.mattduvall.com/>
+ * @deprecated in ESLint v8.50.0
  */
 
 "use strict";
@@ -26,6 +27,12 @@ module.exports = {
             url: "https://eslint.org/docs/latest/rules/no-new-object"
         },
 
+        deprecated: true,
+
+        replacedBy: [
+            "no-object-constructor"
+        ],
+
         schema: [],
 
         messages: {
diff --git a/tools/node_modules/eslint/lib/rules/no-object-constructor.js b/tools/node_modules/eslint/lib/rules/no-object-constructor.js
new file mode 100644
index 00000000000000..1299779f7ec843
--- /dev/null
+++ b/tools/node_modules/eslint/lib/rules/no-object-constructor.js
@@ -0,0 +1,118 @@
+/**
+ * @fileoverview Rule to disallow calls to the `Object` constructor without an argument
+ * @author Francesco Trotta
+ */
+
+"use strict";
+
+//------------------------------------------------------------------------------
+// Requirements
+//------------------------------------------------------------------------------
+
+const { getVariableByName, isArrowToken } = require("./utils/ast-utils");
+
+//------------------------------------------------------------------------------
+// Helpers
+//------------------------------------------------------------------------------
+
+/**
+ * Tests if a node appears at the beginning of an ancestor ExpressionStatement node.
+ * @param {ASTNode} node The node to check.
+ * @returns {boolean} Whether the node appears at the beginning of an ancestor ExpressionStatement node.
+ */
+function isStartOfExpressionStatement(node) {
+    const start = node.range[0];
+    let ancestor = node;
+
+    while ((ancestor = ancestor.parent) && ancestor.range[0] === start) {
+        if (ancestor.type === "ExpressionStatement") {
+            return true;
+        }
+    }
+    return false;
+}
+
+//------------------------------------------------------------------------------
+// Rule Definition
+//------------------------------------------------------------------------------
+
+/** @type {import('../shared/types').Rule} */
+module.exports = {
+    meta: {
+        type: "suggestion",
+
+        docs: {
+            description: "Disallow calls to the `Object` constructor without an argument",
+            recommended: false,
+            url: "https://eslint.org/docs/latest/rules/no-object-constructor"
+        },
+
+        hasSuggestions: true,
+
+        schema: [],
+
+        messages: {
+            preferLiteral: "The object literal notation {} is preferable.",
+            useLiteral: "Replace with '{{replacement}}'."
+        }
+    },
+
+    create(context) {
+
+        const sourceCode = context.sourceCode;
+
+        /**
+         * Determines whether or not an object literal that replaces a specified node needs to be enclosed in parentheses.
+         * @param {ASTNode} node The node to be replaced.
+         * @returns {boolean} Whether or not parentheses around the object literal are required.
+         */
+        function needsParentheses(node) {
+            if (isStartOfExpressionStatement(node)) {
+                return true;
+            }
+
+            const prevToken = sourceCode.getTokenBefore(node);
+
+            if (prevToken && isArrowToken(prevToken)) {
+                return true;
+            }
+
+            return false;
+        }
+
+        /**
+         * Reports on nodes where the `Object` constructor is called without arguments.
+         * @param {ASTNode} node The node to evaluate.
+         * @returns {void}
+         */
+        function check(node) {
+            if (node.callee.type !== "Identifier" || node.callee.name !== "Object" || node.arguments.length) {
+                return;
+            }
+
+            const variable = getVariableByName(sourceCode.getScope(node), "Object");
+
+            if (variable && variable.identifiers.length === 0) {
+                const replacement = needsParentheses(node) ? "({})" : "{}";
+
+                context.report({
+                    node,
+                    messageId: "preferLiteral",
+                    suggest: [
+                        {
+                            messageId: "useLiteral",
+                            data: { replacement },
+                            fix: fixer => fixer.replaceText(node, replacement)
+                        }
+                    ]
+                });
+            }
+        }
+
+        return {
+            CallExpression: check,
+            NewExpression: check
+        };
+
+    }
+};
diff --git a/tools/node_modules/eslint/lib/source-code/source-code.js b/tools/node_modules/eslint/lib/source-code/source-code.js
index 07c0d294829989..4bbd5ae3a5cb69 100644
--- a/tools/node_modules/eslint/lib/source-code/source-code.js
+++ b/tools/node_modules/eslint/lib/source-code/source-code.js
@@ -12,7 +12,15 @@ const
     { isCommentToken } = require("@eslint-community/eslint-utils"),
     TokenStore = require("./token-store"),
     astUtils = require("../shared/ast-utils"),
-    Traverser = require("../shared/traverser");
+    Traverser = require("../shared/traverser"),
+    globals = require("../../conf/globals"),
+    {
+        directivesPattern
+    } = require("../shared/directives"),
+
+    /* eslint-disable-next-line n/no-restricted-require -- Too messy to figure out right now. */
+    ConfigCommentParser = require("../linter/config-comment-parser"),
+    eslintScope = require("eslint-scope");
 
 //------------------------------------------------------------------------------
 // Type Definitions
@@ -24,6 +32,8 @@ const
 // Private
 //------------------------------------------------------------------------------
 
+const commentParser = new ConfigCommentParser();
+
 /**
  * Validates that the given AST has the required information.
  * @param {ASTNode} ast The Program node of the AST to check.
@@ -49,6 +59,29 @@ function validate(ast) {
     }
 }
 
+/**
+ * Retrieves globals for the given ecmaVersion.
+ * @param {number} ecmaVersion The version to retrieve globals for.
+ * @returns {Object} The globals for the given ecmaVersion.
+ */
+function getGlobalsForEcmaVersion(ecmaVersion) {
+
+    switch (ecmaVersion) {
+        case 3:
+            return globals.es3;
+
+        case 5:
+            return globals.es5;
+
+        default:
+            if (ecmaVersion < 2015) {
+                return globals[`es${ecmaVersion + 2009}`];
+            }
+
+            return globals[`es${ecmaVersion}`];
+    }
+}
+
 /**
  * Check to see if its a ES6 export declaration.
  * @param {ASTNode} astNode An AST node.
@@ -83,6 +116,36 @@ function sortedMerge(tokens, comments) {
     return result;
 }
 
+/**
+ * Normalizes a value for a global in a config
+ * @param {(boolean|string|null)} configuredValue The value given for a global in configuration or in
+ * a global directive comment
+ * @returns {("readable"|"writeable"|"off")} The value normalized as a string
+ * @throws Error if global value is invalid
+ */
+function normalizeConfigGlobal(configuredValue) {
+    switch (configuredValue) {
+        case "off":
+            return "off";
+
+        case true:
+        case "true":
+        case "writeable":
+        case "writable":
+            return "writable";
+
+        case null:
+        case false:
+        case "false":
+        case "readable":
+        case "readonly":
+            return "readonly";
+
+        default:
+            throw new Error(`'${configuredValue}' is not a valid configuration for a global (use 'readonly', 'writable', or 'off')`);
+    }
+}
+
 /**
  * Determines if two nodes or tokens overlap.
  * @param {ASTNode|Token} first The first node or token to check.
@@ -145,6 +208,116 @@ function isSpaceBetween(sourceCode, first, second, checkInsideOfJSXText) {
     return false;
 }
 
+//-----------------------------------------------------------------------------
+// Directive Comments
+//-----------------------------------------------------------------------------
+
+/**
+ * Extract the directive and the justification from a given directive comment and trim them.
+ * @param {string} value The comment text to extract.
+ * @returns {{directivePart: string, justificationPart: string}} The extracted directive and justification.
+ */
+function extractDirectiveComment(value) {
+    const match = /\s-{2,}\s/u.exec(value);
+
+    if (!match) {
+        return { directivePart: value.trim(), justificationPart: "" };
+    }
+
+    const directive = value.slice(0, match.index).trim();
+    const justification = value.slice(match.index + match[0].length).trim();
+
+    return { directivePart: directive, justificationPart: justification };
+}
+
+/**
+ * Ensures that variables representing built-in properties of the Global Object,
+ * and any globals declared by special block comments, are present in the global
+ * scope.
+ * @param {Scope} globalScope The global scope.
+ * @param {Object|undefined} configGlobals The globals declared in configuration
+ * @param {Object|undefined} inlineGlobals The globals declared in the source code
+ * @returns {void}
+ */
+function addDeclaredGlobals(globalScope, configGlobals = {}, inlineGlobals = {}) {
+
+    // Define configured global variables.
+    for (const id of new Set([...Object.keys(configGlobals), ...Object.keys(inlineGlobals)])) {
+
+        /*
+         * `normalizeConfigGlobal` will throw an error if a configured global value is invalid. However, these errors would
+         * typically be caught when validating a config anyway (validity for inline global comments is checked separately).
+         */
+        const configValue = configGlobals[id] === void 0 ? void 0 : normalizeConfigGlobal(configGlobals[id]);
+        const commentValue = inlineGlobals[id] && inlineGlobals[id].value;
+        const value = commentValue || configValue;
+        const sourceComments = inlineGlobals[id] && inlineGlobals[id].comments;
+
+        if (value === "off") {
+            continue;
+        }
+
+        let variable = globalScope.set.get(id);
+
+        if (!variable) {
+            variable = new eslintScope.Variable(id, globalScope);
+
+            globalScope.variables.push(variable);
+            globalScope.set.set(id, variable);
+        }
+
+        variable.eslintImplicitGlobalSetting = configValue;
+        variable.eslintExplicitGlobal = sourceComments !== void 0;
+        variable.eslintExplicitGlobalComments = sourceComments;
+        variable.writeable = (value === "writable");
+    }
+
+    /*
+     * "through" contains all references which definitions cannot be found.
+     * Since we augment the global scope using configuration, we need to update
+     * references and remove the ones that were added by configuration.
+     */
+    globalScope.through = globalScope.through.filter(reference => {
+        const name = reference.identifier.name;
+        const variable = globalScope.set.get(name);
+
+        if (variable) {
+
+            /*
+             * Links the variable and the reference.
+             * And this reference is removed from `Scope#through`.
+             */
+            reference.resolved = variable;
+            variable.references.push(reference);
+
+            return false;
+        }
+
+        return true;
+    });
+}
+
+/**
+ * Sets the given variable names as exported so they won't be triggered by
+ * the `no-unused-vars` rule.
+ * @param {eslint.Scope} globalScope The global scope to define exports in.
+ * @param {Record<string,string>} variables An object whose keys are the variable
+ *      names to export.
+ * @returns {void}
+ */
+function markExportedVariables(globalScope, variables) {
+
+    Object.keys(variables).forEach(name => {
+        const variable = globalScope.set.get(name);
+
+        if (variable) {
+            variable.eslintUsed = true;
+            variable.eslintExported = true;
+        }
+    });
+
+}
+
 //------------------------------------------------------------------------------
 // Public Interface
 //------------------------------------------------------------------------------
@@ -187,7 +360,9 @@ class SourceCode extends TokenStore {
          * General purpose caching for the class.
          */
         this[caches] = new Map([
-            ["scopes", new WeakMap()]
+            ["scopes", new WeakMap()],
+            ["vars", new Map()],
+            ["configNodes", void 0]
         ]);
 
         /**
@@ -266,7 +441,7 @@ class SourceCode extends TokenStore {
         // Cache for comments found using getComments().
         this._commentCache = new WeakMap();
 
-        // don't allow modification of this object
+        // don't allow further modification of this object
         Object.freeze(this);
         Object.freeze(this.lines);
     }
@@ -724,6 +899,178 @@ class SourceCode extends TokenStore {
     }
 
 
+    /**
+     * Returns an array of all inline configuration nodes found in the
+     * source code.
+     * @returns {Array<Token>} An array of all inline configuration nodes.
+     */
+    getInlineConfigNodes() {
+
+        // check the cache first
+        let configNodes = this[caches].get("configNodes");
+
+        if (configNodes) {
+            return configNodes;
+        }
+
+        // calculate fresh config nodes
+        configNodes = this.ast.comments.filter(comment => {
+
+            // shebang comments are never directives
+            if (comment.type === "Shebang") {
+                return false;
+            }
+
+            const { directivePart } = extractDirectiveComment(comment.value);
+
+            const directiveMatch = directivesPattern.exec(directivePart);
+
+            if (!directiveMatch) {
+                return false;
+            }
+
+            // only certain comment types are supported as line comments
+            return comment.type !== "Line" || !!/^eslint-disable-(next-)?line$/u.test(directiveMatch[1]);
+        });
+
+        this[caches].set("configNodes", configNodes);
+
+        return configNodes;
+    }
+
+    /**
+     * Applies language options sent in from the core.
+     * @param {Object} languageOptions The language options for this run.
+     * @returns {void}
+     */
+    applyLanguageOptions(languageOptions) {
+
+        /*
+         * Add configured globals and language globals
+         *
+         * Using Object.assign instead of object spread for performance reasons
+         * https://github.com/eslint/eslint/issues/16302
+         */
+        const configGlobals = Object.assign(
+            {},
+            getGlobalsForEcmaVersion(languageOptions.ecmaVersion),
+            languageOptions.sourceType === "commonjs" ? globals.commonjs : void 0,
+            languageOptions.globals
+        );
+        const varsCache = this[caches].get("vars");
+
+        varsCache.set("configGlobals", configGlobals);
+    }
+
+    /**
+     * Applies configuration found inside of the source code. This method is only
+     * called when ESLint is running with inline configuration allowed.
+     * @returns {{problems:Array<Problem>,configs:{config:FlatConfigArray,node:ASTNode}}} Information
+     *      that ESLint needs to further process the inline configuration.
+     */
+    applyInlineConfig() {
+
+        const problems = [];
+        const configs = [];
+        const exportedVariables = {};
+        const inlineGlobals = Object.create(null);
+
+        this.getInlineConfigNodes().forEach(comment => {
+
+            const { directivePart } = extractDirectiveComment(comment.value);
+            const match = directivesPattern.exec(directivePart);
+            const directiveText = match[1];
+            const directiveValue = directivePart.slice(match.index + directiveText.length);
+
+            switch (directiveText) {
+                case "exported":
+                    Object.assign(exportedVariables, commentParser.parseStringConfig(directiveValue, comment));
+                    break;
+
+                case "globals":
+                case "global":
+                    for (const [id, { value }] of Object.entries(commentParser.parseStringConfig(directiveValue, comment))) {
+                        let normalizedValue;
+
+                        try {
+                            normalizedValue = normalizeConfigGlobal(value);
+                        } catch (err) {
+                            problems.push({
+                                ruleId: null,
+                                loc: comment.loc,
+                                message: err.message
+                            });
+                            continue;
+                        }
+
+                        if (inlineGlobals[id]) {
+                            inlineGlobals[id].comments.push(comment);
+                            inlineGlobals[id].value = normalizedValue;
+                        } else {
+                            inlineGlobals[id] = {
+                                comments: [comment],
+                                value: normalizedValue
+                            };
+                        }
+                    }
+                    break;
+
+                case "eslint": {
+                    const parseResult = commentParser.parseJsonConfig(directiveValue, comment.loc);
+
+                    if (parseResult.success) {
+                        configs.push({
+                            config: {
+                                rules: parseResult.config
+                            },
+                            node: comment
+                        });
+                    } else {
+                        problems.push(parseResult.error);
+                    }
+
+                    break;
+                }
+
+                // no default
+            }
+        });
+
+        // save all the new variables for later
+        const varsCache = this[caches].get("vars");
+
+        varsCache.set("inlineGlobals", inlineGlobals);
+        varsCache.set("exportedVariables", exportedVariables);
+
+        return {
+            configs,
+            problems
+        };
+    }
+
+    /**
+     * Called by ESLint core to indicate that it has finished providing
+     * information. We now add in all the missing variables and ensure that
+     * state-changing methods cannot be called by rules.
+     * @returns {void}
+     */
+    finalize() {
+
+        // Step 1: ensure that all of the necessary variables are up to date
+        const varsCache = this[caches].get("vars");
+        const globalScope = this.scopeManager.scopes[0];
+        const configGlobals = varsCache.get("configGlobals");
+        const inlineGlobals = varsCache.get("inlineGlobals");
+        const exportedVariables = varsCache.get("exportedVariables");
+
+        addDeclaredGlobals(globalScope, configGlobals, inlineGlobals);
+
+        if (exportedVariables) {
+            markExportedVariables(globalScope, exportedVariables);
+        }
+
+    }
+
 }
 
 module.exports = SourceCode;
diff --git a/tools/node_modules/eslint/node_modules/@babel/compat-data/data/plugins.json b/tools/node_modules/eslint/node_modules/@babel/compat-data/data/plugins.json
index 499ba7635a557d..266426827131f0 100644
--- a/tools/node_modules/eslint/node_modules/@babel/compat-data/data/plugins.json
+++ b/tools/node_modules/eslint/node_modules/@babel/compat-data/data/plugins.json
@@ -4,6 +4,7 @@
     "opera": "98",
     "edge": "112",
     "firefox": "116",
+    "safari": "tp",
     "node": "20",
     "deno": "1.32",
     "opera_mobile": "75",
diff --git a/tools/node_modules/eslint/node_modules/@babel/compat-data/package.json b/tools/node_modules/eslint/node_modules/@babel/compat-data/package.json
index b89baca359dc68..191a1440fd7b86 100644
--- a/tools/node_modules/eslint/node_modules/@babel/compat-data/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/compat-data/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/compat-data",
-  "version": "7.22.9",
+  "version": "7.22.20",
   "author": "The Babel Team (https://babel.dev/team)",
   "license": "MIT",
   "description": "",
diff --git a/tools/node_modules/eslint/node_modules/@babel/core/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/core/lib/index.js
index 32c15a6f14b810..76f15cfb6c403f 100644
--- a/tools/node_modules/eslint/node_modules/@babel/core/lib/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/core/lib/index.js
@@ -1,13 +1,5 @@
 "use strict";
 
-if (typeof process === "object" && process.version === "v20.6.0") {
-  if (exports["___internal__alreadyRunning" + ""]) return;
-  Object.defineProperty(exports, "___internal__alreadyRunning", {
-    value: true,
-    enumerable: false,
-    configurable: true
-  });
-}
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
@@ -232,24 +224,21 @@ var _transformAst = require("./transform-ast.js");
 var _parse = require("./parse.js");
 var thisFile = require("./index.js");
 ;
-const version = "7.22.17";
+const version = "7.23.0";
 exports.version = version;
 const DEFAULT_EXTENSIONS = Object.freeze([".js", ".jsx", ".es6", ".es", ".mjs", ".cjs"]);
 exports.DEFAULT_EXTENSIONS = DEFAULT_EXTENSIONS;
 ;
 {
-  {
-    exports.OptionManager = class OptionManager {
-      init(opts) {
-        return (0, _index2.loadOptionsSync)(opts);
-      }
-    };
-    exports.Plugin = function Plugin(alias) {
-      throw new Error(`The (${alias}) Babel 5 plugin is being run with an unsupported Babel version.`);
-    };
-  }
+  exports.OptionManager = class OptionManager {
+    init(opts) {
+      return (0, _index2.loadOptionsSync)(opts);
+    }
+  };
+  exports.Plugin = function Plugin(alias) {
+    throw new Error(`The (${alias}) Babel 5 plugin is being run with an unsupported Babel version.`);
+  };
 }
 0 && (exports.types = exports.traverse = exports.tokTypes = exports.template = 0);
-if (typeof process === "object" && process.version === "v20.6.0") delete exports["___internal__alreadyRunning" + ""];
 
 //# sourceMappingURL=index.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/core/lib/transformation/normalize-file.js b/tools/node_modules/eslint/node_modules/@babel/core/lib/transformation/normalize-file.js
index 450f4021b07ab9..74986d9b64999e 100644
--- a/tools/node_modules/eslint/node_modules/@babel/core/lib/transformation/normalize-file.js
+++ b/tools/node_modules/eslint/node_modules/@babel/core/lib/transformation/normalize-file.js
@@ -72,9 +72,11 @@ function* normalizeFile(pluginPasses, options, code, ast) {
       const lastComment = extractComments(INLINE_SOURCEMAP_REGEX, ast);
       if (lastComment) {
         try {
-          inputMap = _convertSourceMap().fromComment(lastComment);
+          inputMap = _convertSourceMap().fromComment("//" + lastComment);
         } catch (err) {
-          debug("discarding unknown inline input sourcemap", err);
+          {
+            debug("discarding unknown inline input sourcemap");
+          }
         }
       }
     }
diff --git a/tools/node_modules/eslint/node_modules/@babel/core/package.json b/tools/node_modules/eslint/node_modules/@babel/core/package.json
index 1f951f25710912..6d61fbeec23ea9 100644
--- a/tools/node_modules/eslint/node_modules/@babel/core/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/core/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/core",
-  "version": "7.22.17",
+  "version": "7.23.0",
   "description": "Babel compiler core.",
   "main": "./lib/index.js",
   "author": "The Babel Team (https://babel.dev/team)",
@@ -48,29 +48,29 @@
   "dependencies": {
     "@ampproject/remapping": "^2.2.0",
     "@babel/code-frame": "^7.22.13",
-    "@babel/generator": "^7.22.15",
+    "@babel/generator": "^7.23.0",
     "@babel/helper-compilation-targets": "^7.22.15",
-    "@babel/helper-module-transforms": "^7.22.17",
-    "@babel/helpers": "^7.22.15",
-    "@babel/parser": "^7.22.16",
+    "@babel/helper-module-transforms": "^7.23.0",
+    "@babel/helpers": "^7.23.0",
+    "@babel/parser": "^7.23.0",
     "@babel/template": "^7.22.15",
-    "@babel/traverse": "^7.22.17",
-    "@babel/types": "^7.22.17",
-    "convert-source-map": "^1.7.0",
+    "@babel/traverse": "^7.23.0",
+    "@babel/types": "^7.23.0",
+    "convert-source-map": "^2.0.0",
     "debug": "^4.1.0",
     "gensync": "^1.0.0-beta.2",
     "json5": "^2.2.3",
     "semver": "^6.3.1"
   },
   "devDependencies": {
-    "@babel/helper-transform-fixture-test-runner": "^7.22.15",
+    "@babel/helper-transform-fixture-test-runner": "^7.22.19",
     "@babel/plugin-syntax-flow": "^7.22.5",
     "@babel/plugin-transform-flow-strip-types": "^7.22.5",
-    "@babel/plugin-transform-modules-commonjs": "^7.22.15",
-    "@babel/preset-env": "^7.22.15",
-    "@babel/preset-typescript": "^7.22.15",
+    "@babel/plugin-transform-modules-commonjs": "^7.23.0",
+    "@babel/preset-env": "^7.22.20",
+    "@babel/preset-typescript": "^7.23.0",
     "@jridgewell/trace-mapping": "^0.3.17",
-    "@types/convert-source-map": "^1.5.1",
+    "@types/convert-source-map": "^2.0.0",
     "@types/debug": "^4.1.0",
     "@types/gensync": "^1.0.0",
     "@types/resolve": "^1.3.2",
diff --git a/tools/node_modules/eslint/node_modules/@babel/generator/lib/generators/modules.js b/tools/node_modules/eslint/node_modules/@babel/generator/lib/generators/modules.js
index b5691d5ec288fc..8e77f32a3b0804 100644
--- a/tools/node_modules/eslint/node_modules/@babel/generator/lib/generators/modules.js
+++ b/tools/node_modules/eslint/node_modules/@babel/generator/lib/generators/modules.js
@@ -12,6 +12,7 @@ exports.ExportSpecifier = ExportSpecifier;
 exports.ImportAttribute = ImportAttribute;
 exports.ImportDeclaration = ImportDeclaration;
 exports.ImportDefaultSpecifier = ImportDefaultSpecifier;
+exports.ImportExpression = ImportExpression;
 exports.ImportNamespaceSpecifier = ImportNamespaceSpecifier;
 exports.ImportSpecifier = ImportSpecifier;
 exports._printAttributes = _printAttributes;
@@ -198,6 +199,10 @@ function ImportDeclaration(node) {
     this.noIndentInnerCommentsHere();
     this.word("module");
     this.space();
+  } else if (node.phase) {
+    this.noIndentInnerCommentsHere();
+    this.word(node.phase);
+    this.space();
   }
   const specifiers = node.specifiers.slice(0);
   const hasSpecifiers = !!specifiers.length;
@@ -250,5 +255,20 @@ function ImportNamespaceSpecifier(node) {
   this.space();
   this.print(node.local, node);
 }
+function ImportExpression(node) {
+  this.word("import");
+  if (node.phase) {
+    this.tokenChar(46);
+    this.word(node.phase);
+  }
+  this.tokenChar(40);
+  this.print(node.source, node);
+  if (node.options != null) {
+    this.tokenChar(44);
+    this.space();
+    this.print(node.options, node);
+  }
+  this.tokenChar(41);
+}
 
 //# sourceMappingURL=modules.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/generator/package.json b/tools/node_modules/eslint/node_modules/@babel/generator/package.json
index 6b2661d8993ea9..b4c036e9e5dd36 100644
--- a/tools/node_modules/eslint/node_modules/@babel/generator/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/generator/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/generator",
-  "version": "7.22.15",
+  "version": "7.23.0",
   "description": "Turns an AST into code.",
   "author": "The Babel Team (https://babel.dev/team)",
   "license": "MIT",
@@ -19,14 +19,14 @@
     "lib"
   ],
   "dependencies": {
-    "@babel/types": "^7.22.15",
+    "@babel/types": "^7.23.0",
     "@jridgewell/gen-mapping": "^0.3.2",
     "@jridgewell/trace-mapping": "^0.3.17",
     "jsesc": "^2.5.1"
   },
   "devDependencies": {
-    "@babel/helper-fixtures": "^7.22.13",
-    "@babel/parser": "^7.22.15",
+    "@babel/helper-fixtures": "^7.22.19",
+    "@babel/parser": "^7.23.0",
     "@jridgewell/sourcemap-codec": "^1.4.15",
     "@types/jsesc": "^2.5.0",
     "charcodes": "^0.2.0"
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-environment-visitor/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/helper-environment-visitor/lib/index.js
index 6bc279a316cd38..e5ffd6e5f626a6 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-environment-visitor/lib/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-environment-visitor/lib/index.js
@@ -6,16 +6,12 @@ Object.defineProperty(exports, "__esModule", {
 exports.default = void 0;
 exports.requeueComputedKeyAndDecorators = requeueComputedKeyAndDecorators;
 {
-  {
-    {
-      exports.skipAllButComputedKey = function skipAllButComputedKey(path) {
-        path.skip();
-        if (path.node.computed) {
-          path.context.maybeQueue(path.get("key"));
-        }
-      };
+  exports.skipAllButComputedKey = function skipAllButComputedKey(path) {
+    path.skip();
+    if (path.node.computed) {
+      path.context.maybeQueue(path.get("key"));
     }
-  }
+  };
 }
 function requeueComputedKeyAndDecorators(path) {
   const {
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-environment-visitor/package.json b/tools/node_modules/eslint/node_modules/@babel/helper-environment-visitor/package.json
index 6827809e6123e2..5316931bb0f3a6 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-environment-visitor/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-environment-visitor/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/helper-environment-visitor",
-  "version": "7.22.5",
+  "version": "7.22.20",
   "description": "Helper visitor to only visit nodes in the current 'this' context",
   "repository": {
     "type": "git",
@@ -18,8 +18,8 @@
     "./package.json": "./package.json"
   },
   "devDependencies": {
-    "@babel/traverse": "^7.22.5",
-    "@babel/types": "^7.22.5"
+    "@babel/traverse": "^7.22.20",
+    "@babel/types": "^7.22.19"
   },
   "engines": {
     "node": ">=6.9.0"
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-function-name/package.json b/tools/node_modules/eslint/node_modules/@babel/helper-function-name/package.json
index 1b26608d8019bf..0f1e3d4feafcf2 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-function-name/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-function-name/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/helper-function-name",
-  "version": "7.22.5",
+  "version": "7.23.0",
   "description": "Helper function to change the property 'name' of every function",
   "repository": {
     "type": "git",
@@ -14,8 +14,8 @@
   },
   "main": "./lib/index.js",
   "dependencies": {
-    "@babel/template": "^7.22.5",
-    "@babel/types": "^7.22.5"
+    "@babel/template": "^7.22.15",
+    "@babel/types": "^7.23.0"
   },
   "engines": {
     "node": ">=6.9.0"
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/dynamic-import.js b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/dynamic-import.js
index 5a27b74fe76469..90fcea61419276 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/dynamic-import.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/dynamic-import.js
@@ -6,17 +6,13 @@ Object.defineProperty(exports, "__esModule", {
 exports.buildDynamicImport = buildDynamicImport;
 var _core = require("@babel/core");
 {
-  {
-    {
-      exports.getDynamicImportSource = function getDynamicImportSource(node) {
-        const [source] = node.arguments;
-        return _core.types.isStringLiteral(source) || _core.types.isTemplateLiteral(source) ? source : _core.template.expression.ast`\`\${${source}}\``;
-      };
-    }
-  }
+  exports.getDynamicImportSource = function getDynamicImportSource(node) {
+    const [source] = node.arguments;
+    return _core.types.isStringLiteral(source) || _core.types.isTemplateLiteral(source) ? source : _core.template.expression.ast`\`\${${source}}\``;
+  };
 }
 function buildDynamicImport(node, deferToThen, wrapWithPromise, builder) {
-  const [specifier] = node.arguments;
+  const specifier = _core.types.isCallExpression(node) ? node.arguments[0] : node.source;
   if (_core.types.isStringLiteral(specifier) || _core.types.isTemplateLiteral(specifier) && specifier.quasis.length === 0) {
     if (deferToThen) {
       return _core.template.expression.ast`
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/index.js
index 9f44b1cd25795e..e002e265d1c2cd 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/index.js
@@ -49,6 +49,7 @@ var _helperModuleImports = require("@babel/helper-module-imports");
 var _rewriteThis = require("./rewrite-this.js");
 var _rewriteLiveReferences = require("./rewrite-live-references.js");
 var _normalizeAndLoadMetadata = require("./normalize-and-load-metadata.js");
+var Lazy = require("./lazy-modules.js");
 var _dynamicImport = require("./dynamic-import.js");
 var _getModuleName = require("./get-module-name.js");
 const {
@@ -67,11 +68,7 @@ const {
   variableDeclarator
 } = _core.types;
 {
-  {
-    {
-      exports.getDynamicImportSource = require("./dynamic-import").getDynamicImportSource;
-    }
-  }
+  exports.getDynamicImportSource = require("./dynamic-import").getDynamicImportSource;
 }
 function rewriteModuleStatementsAndPrepareHeader(path, {
   exportName,
@@ -81,6 +78,8 @@ function rewriteModuleStatementsAndPrepareHeader(path, {
   noInterop,
   importInterop = noInterop ? "none" : "babel",
   lazy,
+  getWrapperPayload = Lazy.toGetWrapperPayload(lazy != null ? lazy : false),
+  wrapReference = Lazy.wrapReference,
   esNamespaceOnly,
   filename,
   constantReexports = arguments[1].loose,
@@ -93,14 +92,14 @@ function rewriteModuleStatementsAndPrepareHeader(path, {
   const meta = (0, _normalizeAndLoadMetadata.default)(path, exportName, {
     importInterop,
     initializeReexports: constantReexports,
-    lazy,
+    getWrapperPayload,
     esNamespaceOnly,
     filename
   });
   if (!allowTopLevelThis) {
     (0, _rewriteThis.default)(path);
   }
-  (0, _rewriteLiveReferences.default)(path, meta);
+  (0, _rewriteLiveReferences.default)(path, meta, wrapReference);
   if (strictMode !== false) {
     const hasStrict = path.node.directives.some(directive => {
       return directive.value.value === "use strict";
@@ -118,7 +117,7 @@ function rewriteModuleStatementsAndPrepareHeader(path, {
     meta.exportNameListName = nameList.name;
     headers.push(nameList.statement);
   }
-  headers.push(...buildExportInitializationStatements(path, meta, constantReexports, noIncompleteNsImportDetection));
+  headers.push(...buildExportInitializationStatements(path, meta, wrapReference, constantReexports, noIncompleteNsImportDetection));
   return {
     meta,
     headers
@@ -148,7 +147,8 @@ function wrapInterop(programPath, expr, type) {
   }
   return callExpression(programPath.hub.addHelper(helper), [expr]);
 }
-function buildNamespaceInitStatements(metadata, sourceMetadata, constantReexports = false) {
+function buildNamespaceInitStatements(metadata, sourceMetadata, constantReexports = false, wrapReference = Lazy.wrapReference) {
+  var _wrapReference;
   const statements = [];
   const srcNamespaceId = identifier(sourceMetadata.name);
   for (const localName of sourceMetadata.importsNamespace) {
@@ -158,12 +158,12 @@ function buildNamespaceInitStatements(metadata, sourceMetadata, constantReexport
       SOURCE: cloneNode(srcNamespaceId)
     }));
   }
-  const srcNamespace = sourceMetadata.lazy ? callExpression(srcNamespaceId, []) : srcNamespaceId;
+  const srcNamespace = (_wrapReference = wrapReference(srcNamespaceId, sourceMetadata.wrap)) != null ? _wrapReference : srcNamespaceId;
   if (constantReexports) {
-    statements.push(...buildReexportsFromMeta(metadata, sourceMetadata, true));
+    statements.push(...buildReexportsFromMeta(metadata, sourceMetadata, true, wrapReference));
   }
   for (const exportName of sourceMetadata.reexportNamespace) {
-    statements.push((sourceMetadata.lazy ? _core.template.statement`
+    statements.push((!_core.types.isIdentifier(srcNamespace) ? _core.template.statement`
             Object.defineProperty(EXPORTS, "NAME", {
               enumerable: true,
               get: function() {
@@ -195,8 +195,10 @@ const ReexportTemplate = {
     });
     `
 };
-function buildReexportsFromMeta(meta, metadata, constantReexports) {
-  const namespace = metadata.lazy ? callExpression(identifier(metadata.name), []) : identifier(metadata.name);
+function buildReexportsFromMeta(meta, metadata, constantReexports, wrapReference) {
+  var _wrapReference2;
+  let namespace = identifier(metadata.name);
+  namespace = (_wrapReference2 = wrapReference(namespace, metadata.wrap)) != null ? _wrapReference2 : namespace;
   const {
     stringSpecifiers
   } = meta;
@@ -291,7 +293,7 @@ function buildExportNameListDeclaration(programPath, metadata) {
     statement: variableDeclaration("var", [variableDeclarator(name, valueToNode(exportedVars))])
   };
 }
-function buildExportInitializationStatements(programPath, metadata, constantReexports = false, noIncompleteNsImportDetection = false) {
+function buildExportInitializationStatements(programPath, metadata, wrapReference, constantReexports = false, noIncompleteNsImportDetection = false) {
   const initStatements = [];
   for (const [localName, data] of metadata.local) {
     if (data.kind === "import") {} else if (data.kind === "hoisted") {
@@ -304,7 +306,7 @@ function buildExportInitializationStatements(programPath, metadata, constantReex
   }
   for (const data of metadata.source.values()) {
     if (!constantReexports) {
-      const reexportsStatements = buildReexportsFromMeta(metadata, data, false);
+      const reexportsStatements = buildReexportsFromMeta(metadata, data, false, wrapReference);
       const reexports = [...data.reexports.keys()];
       for (let i = 0; i < reexportsStatements.length; i++) {
         initStatements.push([reexports[i], reexportsStatements[i]]);
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/lazy-modules.js b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/lazy-modules.js
new file mode 100644
index 00000000000000..e54ad95b39eecb
--- /dev/null
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/lazy-modules.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toGetWrapperPayload = toGetWrapperPayload;
+exports.wrapReference = wrapReference;
+var _core = require("@babel/core");
+var _normalizeAndLoadMetadata = require("./normalize-and-load-metadata.js");
+function toGetWrapperPayload(lazy) {
+  return (source, metadata) => {
+    if (lazy === false) return null;
+    if ((0, _normalizeAndLoadMetadata.isSideEffectImport)(metadata) || metadata.reexportAll) return null;
+    if (lazy === true) {
+      return /\./.test(source) ? null : "lazy";
+    }
+    if (Array.isArray(lazy)) {
+      return lazy.indexOf(source) === -1 ? null : "lazy";
+    }
+    if (typeof lazy === "function") {
+      return lazy(source) ? "lazy" : null;
+    }
+    throw new Error(`.lazy must be a boolean, string array, or function`);
+  };
+}
+function wrapReference(ref, payload) {
+  if (payload === "lazy") return _core.types.callExpression(ref, []);
+  return null;
+}
+
+//# sourceMappingURL=lazy-modules.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/normalize-and-load-metadata.js b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/normalize-and-load-metadata.js
index edcac69a06496a..35d6757d24a69c 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/normalize-and-load-metadata.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/normalize-and-load-metadata.js
@@ -31,7 +31,7 @@ function resolveImportInterop(importInterop, source, filename) {
 function normalizeModuleAndLoadMetadata(programPath, exportName, {
   importInterop,
   initializeReexports = false,
-  lazy = false,
+  getWrapperPayload,
   esNamespaceOnly = false,
   filename
 }) {
@@ -46,12 +46,17 @@ function normalizeModuleAndLoadMetadata(programPath, exportName, {
     hasExports
   } = getModuleMetadata(programPath, {
     initializeReexports,
-    lazy
+    getWrapperPayload
   }, stringSpecifiers);
   removeImportExportDeclarations(programPath);
   for (const [source, metadata] of sources) {
-    if (metadata.importsNamespace.size > 0) {
-      metadata.name = metadata.importsNamespace.values().next().value;
+    const {
+      importsNamespace,
+      imports
+    } = metadata;
+    if (importsNamespace.size > 0 && imports.size === 0) {
+      const [nameOfnamespace] = importsNamespace;
+      metadata.name = nameOfnamespace;
     }
     const resolvedInterop = resolveImportInterop(importInterop, source, filename);
     if (resolvedInterop === "none") {
@@ -96,12 +101,13 @@ function assertExportSpecifier(path) {
   }
 }
 function getModuleMetadata(programPath, {
-  lazy,
+  getWrapperPayload,
   initializeReexports
 }, stringSpecifiers) {
   const localData = getLocalExportMetadata(programPath, initializeReexports, stringSpecifiers);
+  const importNodes = new Map();
   const sourceData = new Map();
-  const getData = sourceNode => {
+  const getData = (sourceNode, node) => {
     const source = sourceNode.value;
     let data = sourceData.get(source);
     if (!data) {
@@ -114,17 +120,23 @@ function getModuleMetadata(programPath, {
         reexports: new Map(),
         reexportNamespace: new Set(),
         reexportAll: null,
-        lazy: false,
+        wrap: null,
+        get lazy() {
+          return this.wrap === "lazy";
+        },
         referenced: false
       };
       sourceData.set(source, data);
+      importNodes.set(source, [node]);
+    } else {
+      importNodes.get(source).push(node);
     }
     return data;
   };
   let hasExports = false;
   programPath.get("body").forEach(child => {
     if (child.isImportDeclaration()) {
-      const data = getData(child.node.source);
+      const data = getData(child.node.source, child.node);
       if (!data.loc) data.loc = child.node.loc;
       child.get("specifiers").forEach(spec => {
         if (spec.isImportDefaultSpecifier()) {
@@ -165,7 +177,7 @@ function getModuleMetadata(programPath, {
       });
     } else if (child.isExportAllDeclaration()) {
       hasExports = true;
-      const data = getData(child.node.source);
+      const data = getData(child.node.source, child.node);
       if (!data.loc) data.loc = child.node.loc;
       data.reexportAll = {
         loc: child.node.loc
@@ -173,7 +185,7 @@ function getModuleMetadata(programPath, {
       data.referenced = true;
     } else if (child.isExportNamedDeclaration() && child.node.source) {
       hasExports = true;
-      const data = getData(child.node.source);
+      const data = getData(child.node.source, child.node);
       if (!data.loc) data.loc = child.node.loc;
       child.get("specifiers").forEach(spec => {
         assertExportSpecifier(spec);
@@ -211,17 +223,9 @@ function getModuleMetadata(programPath, {
       metadata.interop = "default";
     }
   }
-  for (const [source, metadata] of sourceData) {
-    if (lazy !== false && !(isSideEffectImport(metadata) || metadata.reexportAll)) {
-      if (lazy === true) {
-        metadata.lazy = !/\./.test(source);
-      } else if (Array.isArray(lazy)) {
-        metadata.lazy = lazy.indexOf(source) !== -1;
-      } else if (typeof lazy === "function") {
-        metadata.lazy = lazy(source);
-      } else {
-        throw new Error(`.lazy must be a boolean, string array, or function`);
-      }
+  if (getWrapperPayload) {
+    for (const [source, metadata] of sourceData) {
+      metadata.wrap = getWrapperPayload(source, metadata, importNodes.get(source));
     }
   }
   return {
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/rewrite-live-references.js b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/rewrite-live-references.js
index 86427d4715789f..6ada457a4db5c5 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/rewrite-live-references.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/lib/rewrite-live-references.js
@@ -9,11 +9,14 @@ var _core = require("@babel/core");
 var _helperSimpleAccess = require("@babel/helper-simple-access");
 const {
   assignmentExpression,
-  callExpression,
   cloneNode,
   expressionStatement,
   getOuterBindingIdentifiers,
   identifier,
+  isArrowFunctionExpression,
+  isClassExpression,
+  isFunctionExpression,
+  isIdentifier,
   isMemberExpression,
   isVariableDeclaration,
   jsxIdentifier,
@@ -43,7 +46,7 @@ function isInType(path) {
     }
   } while (path = path.parentPath);
 }
-function rewriteLiveReferences(programPath, metadata) {
+function rewriteLiveReferences(programPath, metadata, wrapReference) {
   const imported = new Map();
   const exported = new Map();
   const requeueInParent = path => {
@@ -83,17 +86,21 @@ function rewriteLiveReferences(programPath, metadata) {
     scope: programPath.scope,
     imported,
     exported,
-    buildImportReference: ([source, importName, localName], identNode) => {
+    buildImportReference([source, importName, localName], identNode) {
       const meta = metadata.source.get(source);
       meta.referenced = true;
       if (localName) {
-        if (meta.lazy) {
-          identNode = callExpression(identNode, []);
+        if (meta.wrap) {
+          var _wrapReference;
+          identNode = (_wrapReference = wrapReference(identNode, meta.wrap)) != null ? _wrapReference : identNode;
         }
         return identNode;
       }
       let namespace = identifier(meta.name);
-      if (meta.lazy) namespace = callExpression(namespace, []);
+      if (meta.wrap) {
+        var _wrapReference2;
+        namespace = (_wrapReference2 = wrapReference(namespace, meta.wrap)) != null ? _wrapReference2 : namespace;
+      }
       if (importName === "default" && meta.interop === "node-default") {
         return namespace;
       }
@@ -131,14 +138,34 @@ const rewriteBindingInitVisitor = {
       exported,
       metadata
     } = this;
-    Object.keys(path.getOuterBindingIdentifiers()).forEach(localName => {
-      const exportNames = exported.get(localName) || [];
-      if (exportNames.length > 0) {
-        const statement = expressionStatement(buildBindingExportAssignmentExpression(metadata, exportNames, identifier(localName), path.scope));
-        statement._blockHoist = path.node._blockHoist;
-        requeueInParent(path.insertAfter(statement)[0]);
+    const isVar = path.node.kind === "var";
+    for (const decl of path.get("declarations")) {
+      const {
+        id
+      } = decl.node;
+      let {
+        init
+      } = decl.node;
+      if (isIdentifier(id) && exported.has(id.name) && !isArrowFunctionExpression(init) && (!isFunctionExpression(init) || init.id) && (!isClassExpression(init) || init.id)) {
+        if (!init) {
+          if (isVar) {
+            continue;
+          } else {
+            init = path.scope.buildUndefinedNode();
+          }
+        }
+        decl.node.init = buildBindingExportAssignmentExpression(metadata, exported.get(id.name), init, path.scope);
+        requeueInParent(decl.get("init"));
+      } else {
+        for (const localName of Object.keys(decl.getOuterBindingIdentifiers())) {
+          if (exported.has(localName)) {
+            const statement = expressionStatement(buildBindingExportAssignmentExpression(metadata, exported.get(localName), identifier(localName), path.scope));
+            statement._blockHoist = path.node._blockHoist;
+            requeueInParent(path.insertAfter(statement)[0]);
+          }
+        }
       }
-    });
+    }
   }
 };
 const buildBindingExportAssignmentExpression = (metadata, exportNames, localExpr, scope) => {
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/package.json b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/package.json
index 5bb205ab8ad490..63f51e03bc25d5 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-module-transforms/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/helper-module-transforms",
-  "version": "7.22.17",
+  "version": "7.23.0",
   "description": "Babel helper functions for implementing ES6 module transformations",
   "author": "The Babel Team (https://babel.dev/team)",
   "homepage": "https://babel.dev/docs/en/next/babel-helper-module-transforms",
@@ -15,15 +15,15 @@
   },
   "main": "./lib/index.js",
   "dependencies": {
-    "@babel/helper-environment-visitor": "^7.22.5",
+    "@babel/helper-environment-visitor": "^7.22.20",
     "@babel/helper-module-imports": "^7.22.15",
     "@babel/helper-simple-access": "^7.22.5",
     "@babel/helper-split-export-declaration": "^7.22.6",
-    "@babel/helper-validator-identifier": "^7.22.15"
+    "@babel/helper-validator-identifier": "^7.22.20"
   },
   "devDependencies": {
-    "@babel/core": "^7.22.17",
-    "@babel/traverse": "^7.22.17"
+    "@babel/core": "^7.23.0",
+    "@babel/traverse": "^7.23.0"
   },
   "peerDependencies": {
     "@babel/core": "^7.0.0"
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/lib/identifier.js b/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/lib/identifier.js
index cd1f4500a4cf48..8ef8303613598e 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/lib/identifier.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/lib/identifier.js
@@ -7,11 +7,11 @@ exports.isIdentifierChar = isIdentifierChar;
 exports.isIdentifierName = isIdentifierName;
 exports.isIdentifierStart = isIdentifierStart;
 let nonASCIIidentifierStartChars = "\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u037f\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u052f\u0531-\u0556\u0559\u0560-\u0588\u05d0-\u05ea\u05ef-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u0860-\u086a\u0870-\u0887\u0889-\u088e\u08a0-\u08c9\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u09fc\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0af9\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c39\u0c3d\u0c58-\u0c5a\u0c5d\u0c60\u0c61\u0c80\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cdd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d04-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d54-\u0d56\u0d5f-\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e86-\u0e8a\u0e8c-\u0ea3\u0ea5\u0ea7-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f5\u13f8-\u13fd\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f8\u1700-\u1711\u171f-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191e\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19b0-\u19c9\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4c\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1c80-\u1c88\u1c90-\u1cba\u1cbd-\u1cbf\u1ce9-\u1cec\u1cee-\u1cf3\u1cf5\u1cf6\u1cfa\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312f\u3131-\u318e\u31a0-\u31bf\u31f0-\u31ff\u3400-\u4dbf\u4e00-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua69d\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua7ca\ua7d0\ua7d1\ua7d3\ua7d5-\ua7d9\ua7f2-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua8fd\ua8fe\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\ua9e0-\ua9e4\ua9e6-\ua9ef\ua9fa-\ua9fe\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa7e-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uab30-\uab5a\uab5c-\uab69\uab70-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc";
-let nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u0898-\u089f\u08ca-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b55-\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3c\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0cf3\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d81-\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ece\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1715\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u180f-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1abf-\u1ace\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua82c\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
+let nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u0898-\u089f\u08ca-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b55-\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3c\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0cf3\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d81-\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ece\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1715\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u180f-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1abf-\u1ace\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1dff\u200c\u200d\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\u30fb\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua82c\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f\uff65";
 const nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
 const nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
 nonASCIIidentifierStartChars = nonASCIIidentifierChars = null;
-const astralIdentifierStartCodes = [0, 11, 2, 25, 2, 18, 2, 1, 2, 14, 3, 13, 35, 122, 70, 52, 268, 28, 4, 48, 48, 31, 14, 29, 6, 37, 11, 29, 3, 35, 5, 7, 2, 4, 43, 157, 19, 35, 5, 35, 5, 39, 9, 51, 13, 10, 2, 14, 2, 6, 2, 1, 2, 10, 2, 14, 2, 6, 2, 1, 68, 310, 10, 21, 11, 7, 25, 5, 2, 41, 2, 8, 70, 5, 3, 0, 2, 43, 2, 1, 4, 0, 3, 22, 11, 22, 10, 30, 66, 18, 2, 1, 11, 21, 11, 25, 71, 55, 7, 1, 65, 0, 16, 3, 2, 2, 2, 28, 43, 28, 4, 28, 36, 7, 2, 27, 28, 53, 11, 21, 11, 18, 14, 17, 111, 72, 56, 50, 14, 50, 14, 35, 349, 41, 7, 1, 79, 28, 11, 0, 9, 21, 43, 17, 47, 20, 28, 22, 13, 52, 58, 1, 3, 0, 14, 44, 33, 24, 27, 35, 30, 0, 3, 0, 9, 34, 4, 0, 13, 47, 15, 3, 22, 0, 2, 0, 36, 17, 2, 24, 20, 1, 64, 6, 2, 0, 2, 3, 2, 14, 2, 9, 8, 46, 39, 7, 3, 1, 3, 21, 2, 6, 2, 1, 2, 4, 4, 0, 19, 0, 13, 4, 159, 52, 19, 3, 21, 2, 31, 47, 21, 1, 2, 0, 185, 46, 42, 3, 37, 47, 21, 0, 60, 42, 14, 0, 72, 26, 38, 6, 186, 43, 117, 63, 32, 7, 3, 0, 3, 7, 2, 1, 2, 23, 16, 0, 2, 0, 95, 7, 3, 38, 17, 0, 2, 0, 29, 0, 11, 39, 8, 0, 22, 0, 12, 45, 20, 0, 19, 72, 264, 8, 2, 36, 18, 0, 50, 29, 113, 6, 2, 1, 2, 37, 22, 0, 26, 5, 2, 1, 2, 31, 15, 0, 328, 18, 16, 0, 2, 12, 2, 33, 125, 0, 80, 921, 103, 110, 18, 195, 2637, 96, 16, 1071, 18, 5, 4026, 582, 8634, 568, 8, 30, 18, 78, 18, 29, 19, 47, 17, 3, 32, 20, 6, 18, 689, 63, 129, 74, 6, 0, 67, 12, 65, 1, 2, 0, 29, 6135, 9, 1237, 43, 8, 8936, 3, 2, 6, 2, 1, 2, 290, 16, 0, 30, 2, 3, 0, 15, 3, 9, 395, 2309, 106, 6, 12, 4, 8, 8, 9, 5991, 84, 2, 70, 2, 1, 3, 0, 3, 1, 3, 3, 2, 11, 2, 0, 2, 6, 2, 64, 2, 3, 3, 7, 2, 6, 2, 27, 2, 3, 2, 4, 2, 0, 4, 6, 2, 339, 3, 24, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 7, 1845, 30, 7, 5, 262, 61, 147, 44, 11, 6, 17, 0, 322, 29, 19, 43, 485, 27, 757, 6, 2, 3, 2, 1, 2, 14, 2, 196, 60, 67, 8, 0, 1205, 3, 2, 26, 2, 1, 2, 0, 3, 0, 2, 9, 2, 3, 2, 0, 2, 0, 7, 0, 5, 0, 2, 0, 2, 0, 2, 2, 2, 1, 2, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 1, 2, 0, 3, 3, 2, 6, 2, 3, 2, 3, 2, 0, 2, 9, 2, 16, 6, 2, 2, 4, 2, 16, 4421, 42719, 33, 4153, 7, 221, 3, 5761, 15, 7472, 3104, 541, 1507, 4938, 6, 4191];
+const astralIdentifierStartCodes = [0, 11, 2, 25, 2, 18, 2, 1, 2, 14, 3, 13, 35, 122, 70, 52, 268, 28, 4, 48, 48, 31, 14, 29, 6, 37, 11, 29, 3, 35, 5, 7, 2, 4, 43, 157, 19, 35, 5, 35, 5, 39, 9, 51, 13, 10, 2, 14, 2, 6, 2, 1, 2, 10, 2, 14, 2, 6, 2, 1, 68, 310, 10, 21, 11, 7, 25, 5, 2, 41, 2, 8, 70, 5, 3, 0, 2, 43, 2, 1, 4, 0, 3, 22, 11, 22, 10, 30, 66, 18, 2, 1, 11, 21, 11, 25, 71, 55, 7, 1, 65, 0, 16, 3, 2, 2, 2, 28, 43, 28, 4, 28, 36, 7, 2, 27, 28, 53, 11, 21, 11, 18, 14, 17, 111, 72, 56, 50, 14, 50, 14, 35, 349, 41, 7, 1, 79, 28, 11, 0, 9, 21, 43, 17, 47, 20, 28, 22, 13, 52, 58, 1, 3, 0, 14, 44, 33, 24, 27, 35, 30, 0, 3, 0, 9, 34, 4, 0, 13, 47, 15, 3, 22, 0, 2, 0, 36, 17, 2, 24, 20, 1, 64, 6, 2, 0, 2, 3, 2, 14, 2, 9, 8, 46, 39, 7, 3, 1, 3, 21, 2, 6, 2, 1, 2, 4, 4, 0, 19, 0, 13, 4, 159, 52, 19, 3, 21, 2, 31, 47, 21, 1, 2, 0, 185, 46, 42, 3, 37, 47, 21, 0, 60, 42, 14, 0, 72, 26, 38, 6, 186, 43, 117, 63, 32, 7, 3, 0, 3, 7, 2, 1, 2, 23, 16, 0, 2, 0, 95, 7, 3, 38, 17, 0, 2, 0, 29, 0, 11, 39, 8, 0, 22, 0, 12, 45, 20, 0, 19, 72, 264, 8, 2, 36, 18, 0, 50, 29, 113, 6, 2, 1, 2, 37, 22, 0, 26, 5, 2, 1, 2, 31, 15, 0, 328, 18, 16, 0, 2, 12, 2, 33, 125, 0, 80, 921, 103, 110, 18, 195, 2637, 96, 16, 1071, 18, 5, 4026, 582, 8634, 568, 8, 30, 18, 78, 18, 29, 19, 47, 17, 3, 32, 20, 6, 18, 689, 63, 129, 74, 6, 0, 67, 12, 65, 1, 2, 0, 29, 6135, 9, 1237, 43, 8, 8936, 3, 2, 6, 2, 1, 2, 290, 16, 0, 30, 2, 3, 0, 15, 3, 9, 395, 2309, 106, 6, 12, 4, 8, 8, 9, 5991, 84, 2, 70, 2, 1, 3, 0, 3, 1, 3, 3, 2, 11, 2, 0, 2, 6, 2, 64, 2, 3, 3, 7, 2, 6, 2, 27, 2, 3, 2, 4, 2, 0, 4, 6, 2, 339, 3, 24, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 7, 1845, 30, 7, 5, 262, 61, 147, 44, 11, 6, 17, 0, 322, 29, 19, 43, 485, 27, 757, 6, 2, 3, 2, 1, 2, 14, 2, 196, 60, 67, 8, 0, 1205, 3, 2, 26, 2, 1, 2, 0, 3, 0, 2, 9, 2, 3, 2, 0, 2, 0, 7, 0, 5, 0, 2, 0, 2, 0, 2, 2, 2, 1, 2, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 1, 2, 0, 3, 3, 2, 6, 2, 3, 2, 3, 2, 0, 2, 9, 2, 16, 6, 2, 2, 4, 2, 16, 4421, 42719, 33, 4153, 7, 221, 3, 5761, 15, 7472, 16, 621, 2467, 541, 1507, 4938, 6, 4191];
 const astralIdentifierCodes = [509, 0, 227, 0, 150, 4, 294, 9, 1368, 2, 2, 1, 6, 3, 41, 2, 5, 0, 166, 1, 574, 3, 9, 9, 370, 1, 81, 2, 71, 10, 50, 3, 123, 2, 54, 14, 32, 10, 3, 1, 11, 3, 46, 10, 8, 0, 46, 9, 7, 2, 37, 13, 2, 9, 6, 1, 45, 0, 13, 2, 49, 13, 9, 3, 2, 11, 83, 11, 7, 0, 3, 0, 158, 11, 6, 9, 7, 3, 56, 1, 2, 6, 3, 1, 3, 2, 10, 0, 11, 1, 3, 6, 4, 4, 193, 17, 10, 9, 5, 0, 82, 19, 13, 9, 214, 6, 3, 8, 28, 1, 83, 16, 16, 9, 82, 12, 9, 9, 84, 14, 5, 9, 243, 14, 166, 9, 71, 5, 2, 1, 3, 3, 2, 0, 2, 1, 13, 9, 120, 6, 3, 6, 4, 0, 29, 9, 41, 6, 2, 3, 9, 0, 10, 10, 47, 15, 406, 7, 2, 7, 17, 9, 57, 21, 2, 13, 123, 5, 4, 0, 2, 1, 2, 6, 2, 0, 9, 9, 49, 4, 2, 1, 2, 4, 9, 9, 330, 3, 10, 1, 2, 0, 49, 6, 4, 4, 14, 9, 5351, 0, 7, 14, 13835, 9, 87, 9, 39, 4, 60, 6, 26, 9, 1014, 0, 2, 54, 8, 3, 82, 0, 12, 1, 19628, 1, 4706, 45, 3, 22, 543, 4, 4, 5, 9, 7, 3, 6, 31, 3, 149, 2, 1418, 49, 513, 54, 5, 49, 9, 0, 15, 0, 23, 4, 2, 14, 1361, 6, 2, 16, 3, 6, 2, 1, 2, 4, 101, 0, 161, 6, 10, 9, 357, 0, 62, 13, 499, 13, 983, 6, 110, 6, 6, 9, 4759, 9, 787719, 239];
 function isInAstralSet(code, set) {
   let pos = 0x10000;
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/package.json b/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/package.json
index cd582967dd548c..67bddb4bf985a2 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/helper-validator-identifier",
-  "version": "7.22.15",
+  "version": "7.22.20",
   "description": "Validate identifier/keywords name",
   "repository": {
     "type": "git",
@@ -17,7 +17,7 @@
     "./package.json": "./package.json"
   },
   "devDependencies": {
-    "@unicode/unicode-15.0.0": "^1.3.1",
+    "@unicode/unicode-15.1.0": "^1.5.2",
     "charcodes": "^0.2.0"
   },
   "engines": {
diff --git a/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/scripts/generate-identifier-regex.js b/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/scripts/generate-identifier-regex.js
index 7d795d246a99b5..7f753a95843031 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/scripts/generate-identifier-regex.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helper-validator-identifier/scripts/generate-identifier-regex.js
@@ -2,7 +2,7 @@
 
 // Always use the latest available version of Unicode!
 // https://tc39.github.io/ecma262/#sec-conformance
-const version = "15.0.0";
+const version = "15.1.0";
 
 const start = require(
   "@unicode/unicode-" + version + "/Binary_Property/ID_Start/code-points.js"
@@ -10,15 +10,11 @@ const start = require(
   return ch > 0x7f;
 });
 let last = -1;
-const cont = [0x200c, 0x200d].concat(
-  require(
-    "@unicode/unicode-" +
-      version +
-      "/Binary_Property/ID_Continue/code-points.js"
-  ).filter(function (ch) {
-    return ch > 0x7f && search(start, ch, last + 1) == -1;
-  })
-);
+const cont = require(
+  "@unicode/unicode-" + version + "/Binary_Property/ID_Continue/code-points.js"
+).filter(function (ch) {
+  return ch > 0x7f && search(start, ch, last + 1) == -1;
+});
 
 function search(arr, ch, starting) {
   for (let i = starting; arr[i] <= ch && i < arr.length; last = i++) {
diff --git a/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers-generated.js b/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers-generated.js
index 2176556b8f5692..aff47496d37b4f 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers-generated.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers-generated.js
@@ -20,13 +20,14 @@ var _default = Object.freeze({
   applyDecs2203: helper("7.19.0", 'function applyDecs2203Factory(){function createAddInitializerMethod(e,t){return function(r){!function(e,t){if(e.v)throw new Error("attempted to call "+t+" after decoration was finished")}(t,"addInitializer"),assertCallable(r,"An initializer"),e.push(r)}}function memberDec(e,t,r,a,n,i,s,o){var c;switch(n){case 1:c="accessor";break;case 2:c="method";break;case 3:c="getter";break;case 4:c="setter";break;default:c="field"}var l,u,f={kind:c,name:s?"#"+t:t,static:i,private:s},p={v:!1};0!==n&&(f.addInitializer=createAddInitializerMethod(a,p)),0===n?s?(l=r.get,u=r.set):(l=function(){return this[t]},u=function(e){this[t]=e}):2===n?l=function(){return r.value}:(1!==n&&3!==n||(l=function(){return r.get.call(this)}),1!==n&&4!==n||(u=function(e){r.set.call(this,e)})),f.access=l&&u?{get:l,set:u}:l?{get:l}:{set:u};try{return e(o,f)}finally{p.v=!0}}function assertCallable(e,t){if("function"!=typeof e)throw new TypeError(t+" must be a function")}function assertValidReturnValue(e,t){var r=typeof t;if(1===e){if("object"!==r||null===t)throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");void 0!==t.get&&assertCallable(t.get,"accessor.get"),void 0!==t.set&&assertCallable(t.set,"accessor.set"),void 0!==t.init&&assertCallable(t.init,"accessor.init")}else if("function"!==r){var a;throw a=0===e?"field":10===e?"class":"method",new TypeError(a+" decorators must return a function or void 0")}}function applyMemberDec(e,t,r,a,n,i,s,o){var c,l,u,f,p,d,h=r[0];if(s?c=0===n||1===n?{get:r[3],set:r[4]}:3===n?{get:r[3]}:4===n?{set:r[3]}:{value:r[3]}:0!==n&&(c=Object.getOwnPropertyDescriptor(t,a)),1===n?u={get:c.get,set:c.set}:2===n?u=c.value:3===n?u=c.get:4===n&&(u=c.set),"function"==typeof h)void 0!==(f=memberDec(h,a,c,o,n,i,s,u))&&(assertValidReturnValue(n,f),0===n?l=f:1===n?(l=f.init,p=f.get||u.get,d=f.set||u.set,u={get:p,set:d}):u=f);else for(var v=h.length-1;v>=0;v--){var g;if(void 0!==(f=memberDec(h[v],a,c,o,n,i,s,u)))assertValidReturnValue(n,f),0===n?g=f:1===n?(g=f.init,p=f.get||u.get,d=f.set||u.set,u={get:p,set:d}):u=f,void 0!==g&&(void 0===l?l=g:"function"==typeof l?l=[l,g]:l.push(g))}if(0===n||1===n){if(void 0===l)l=function(e,t){return t};else if("function"!=typeof l){var y=l;l=function(e,t){for(var r=t,a=0;a<y.length;a++)r=y[a].call(e,r);return r}}else{var m=l;l=function(e,t){return m.call(e,t)}}e.push(l)}0!==n&&(1===n?(c.get=u.get,c.set=u.set):2===n?c.value=u:3===n?c.get=u:4===n&&(c.set=u),s?1===n?(e.push((function(e,t){return u.get.call(e,t)})),e.push((function(e,t){return u.set.call(e,t)}))):2===n?e.push(u):e.push((function(e,t){return u.call(e,t)})):Object.defineProperty(t,a,c))}function pushInitializers(e,t){t&&e.push((function(e){for(var r=0;r<t.length;r++)t[r].call(e);return e}))}return function(e,t,r){var a=[];return function(e,t,r){for(var a,n,i=new Map,s=new Map,o=0;o<r.length;o++){var c=r[o];if(Array.isArray(c)){var l,u,f=c[1],p=c[2],d=c.length>3,h=f>=5;if(h?(l=t,0!=(f-=5)&&(u=n=n||[])):(l=t.prototype,0!==f&&(u=a=a||[])),0!==f&&!d){var v=h?s:i,g=v.get(p)||0;if(!0===g||3===g&&4!==f||4===g&&3!==f)throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: "+p);!g&&f>2?v.set(p,f):v.set(p,!0)}applyMemberDec(e,l,c,p,f,h,d,u)}}pushInitializers(e,a),pushInitializers(e,n)}(a,e,t),function(e,t,r){if(r.length>0){for(var a=[],n=t,i=t.name,s=r.length-1;s>=0;s--){var o={v:!1};try{var c=r[s](n,{kind:"class",name:i,addInitializer:createAddInitializerMethod(a,o)})}finally{o.v=!0}void 0!==c&&(assertValidReturnValue(10,c),n=c)}e.push(n,(function(){for(var e=0;e<a.length;e++)a[e].call(n)}))}}(a,e,r),a}}var applyDecs2203Impl;export default function applyDecs2203(e,t,r){return(applyDecs2203Impl=applyDecs2203Impl||applyDecs2203Factory())(e,t,r)}'),
   applyDecs2203R: helper("7.20.0", 'function applyDecs2203RFactory(){function createAddInitializerMethod(e,t){return function(r){!function(e,t){if(e.v)throw new Error("attempted to call "+t+" after decoration was finished")}(t,"addInitializer"),assertCallable(r,"An initializer"),e.push(r)}}function memberDec(e,t,r,n,a,i,s,o){var c;switch(a){case 1:c="accessor";break;case 2:c="method";break;case 3:c="getter";break;case 4:c="setter";break;default:c="field"}var l,u,f={kind:c,name:s?"#"+t:t,static:i,private:s},p={v:!1};0!==a&&(f.addInitializer=createAddInitializerMethod(n,p)),0===a?s?(l=r.get,u=r.set):(l=function(){return this[t]},u=function(e){this[t]=e}):2===a?l=function(){return r.value}:(1!==a&&3!==a||(l=function(){return r.get.call(this)}),1!==a&&4!==a||(u=function(e){r.set.call(this,e)})),f.access=l&&u?{get:l,set:u}:l?{get:l}:{set:u};try{return e(o,f)}finally{p.v=!0}}function assertCallable(e,t){if("function"!=typeof e)throw new TypeError(t+" must be a function")}function assertValidReturnValue(e,t){var r=typeof t;if(1===e){if("object"!==r||null===t)throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");void 0!==t.get&&assertCallable(t.get,"accessor.get"),void 0!==t.set&&assertCallable(t.set,"accessor.set"),void 0!==t.init&&assertCallable(t.init,"accessor.init")}else if("function"!==r){var n;throw n=0===e?"field":10===e?"class":"method",new TypeError(n+" decorators must return a function or void 0")}}function applyMemberDec(e,t,r,n,a,i,s,o){var c,l,u,f,p,d,h=r[0];if(s?c=0===a||1===a?{get:r[3],set:r[4]}:3===a?{get:r[3]}:4===a?{set:r[3]}:{value:r[3]}:0!==a&&(c=Object.getOwnPropertyDescriptor(t,n)),1===a?u={get:c.get,set:c.set}:2===a?u=c.value:3===a?u=c.get:4===a&&(u=c.set),"function"==typeof h)void 0!==(f=memberDec(h,n,c,o,a,i,s,u))&&(assertValidReturnValue(a,f),0===a?l=f:1===a?(l=f.init,p=f.get||u.get,d=f.set||u.set,u={get:p,set:d}):u=f);else for(var v=h.length-1;v>=0;v--){var g;if(void 0!==(f=memberDec(h[v],n,c,o,a,i,s,u)))assertValidReturnValue(a,f),0===a?g=f:1===a?(g=f.init,p=f.get||u.get,d=f.set||u.set,u={get:p,set:d}):u=f,void 0!==g&&(void 0===l?l=g:"function"==typeof l?l=[l,g]:l.push(g))}if(0===a||1===a){if(void 0===l)l=function(e,t){return t};else if("function"!=typeof l){var y=l;l=function(e,t){for(var r=t,n=0;n<y.length;n++)r=y[n].call(e,r);return r}}else{var m=l;l=function(e,t){return m.call(e,t)}}e.push(l)}0!==a&&(1===a?(c.get=u.get,c.set=u.set):2===a?c.value=u:3===a?c.get=u:4===a&&(c.set=u),s?1===a?(e.push((function(e,t){return u.get.call(e,t)})),e.push((function(e,t){return u.set.call(e,t)}))):2===a?e.push(u):e.push((function(e,t){return u.call(e,t)})):Object.defineProperty(t,n,c))}function applyMemberDecs(e,t){for(var r,n,a=[],i=new Map,s=new Map,o=0;o<t.length;o++){var c=t[o];if(Array.isArray(c)){var l,u,f=c[1],p=c[2],d=c.length>3,h=f>=5;if(h?(l=e,0!==(f-=5)&&(u=n=n||[])):(l=e.prototype,0!==f&&(u=r=r||[])),0!==f&&!d){var v=h?s:i,g=v.get(p)||0;if(!0===g||3===g&&4!==f||4===g&&3!==f)throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: "+p);!g&&f>2?v.set(p,f):v.set(p,!0)}applyMemberDec(a,l,c,p,f,h,d,u)}}return pushInitializers(a,r),pushInitializers(a,n),a}function pushInitializers(e,t){t&&e.push((function(e){for(var r=0;r<t.length;r++)t[r].call(e);return e}))}return function(e,t,r){return{e:applyMemberDecs(e,t),get c(){return function(e,t){if(t.length>0){for(var r=[],n=e,a=e.name,i=t.length-1;i>=0;i--){var s={v:!1};try{var o=t[i](n,{kind:"class",name:a,addInitializer:createAddInitializerMethod(r,s)})}finally{s.v=!0}void 0!==o&&(assertValidReturnValue(10,o),n=o)}return[n,function(){for(var e=0;e<r.length;e++)r[e].call(n)}]}}(e,r)}}}}export default function applyDecs2203R(e,t,r){return(applyDecs2203R=applyDecs2203RFactory())(e,t,r)}'),
   applyDecs2301: helper("7.21.0", 'import checkInRHS from"checkInRHS";function applyDecs2301Factory(){function createAddInitializerMethod(e,t){return function(r){!function(e,t){if(e.v)throw new Error("attempted to call "+t+" after decoration was finished")}(t,"addInitializer"),assertCallable(r,"An initializer"),e.push(r)}}function assertInstanceIfPrivate(e,t){if(!e(t))throw new TypeError("Attempted to access private element on non-instance")}function memberDec(e,t,r,n,a,i,s,o,c){var u;switch(a){case 1:u="accessor";break;case 2:u="method";break;case 3:u="getter";break;case 4:u="setter";break;default:u="field"}var l,f,p={kind:u,name:s?"#"+t:t,static:i,private:s},d={v:!1};if(0!==a&&(p.addInitializer=createAddInitializerMethod(n,d)),s||0!==a&&2!==a)if(2===a)l=function(e){return assertInstanceIfPrivate(c,e),r.value};else{var h=0===a||1===a;(h||3===a)&&(l=s?function(e){return assertInstanceIfPrivate(c,e),r.get.call(e)}:function(e){return r.get.call(e)}),(h||4===a)&&(f=s?function(e,t){assertInstanceIfPrivate(c,e),r.set.call(e,t)}:function(e,t){r.set.call(e,t)})}else l=function(e){return e[t]},0===a&&(f=function(e,r){e[t]=r});var v=s?c.bind():function(e){return t in e};p.access=l&&f?{get:l,set:f,has:v}:l?{get:l,has:v}:{set:f,has:v};try{return e(o,p)}finally{d.v=!0}}function assertCallable(e,t){if("function"!=typeof e)throw new TypeError(t+" must be a function")}function assertValidReturnValue(e,t){var r=typeof t;if(1===e){if("object"!==r||null===t)throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");void 0!==t.get&&assertCallable(t.get,"accessor.get"),void 0!==t.set&&assertCallable(t.set,"accessor.set"),void 0!==t.init&&assertCallable(t.init,"accessor.init")}else if("function"!==r){var n;throw n=0===e?"field":10===e?"class":"method",new TypeError(n+" decorators must return a function or void 0")}}function curryThis2(e){return function(t){e(this,t)}}function applyMemberDec(e,t,r,n,a,i,s,o,c){var u,l,f,p,d,h,v,g=r[0];if(s?u=0===a||1===a?{get:(p=r[3],function(){return p(this)}),set:curryThis2(r[4])}:3===a?{get:r[3]}:4===a?{set:r[3]}:{value:r[3]}:0!==a&&(u=Object.getOwnPropertyDescriptor(t,n)),1===a?f={get:u.get,set:u.set}:2===a?f=u.value:3===a?f=u.get:4===a&&(f=u.set),"function"==typeof g)void 0!==(d=memberDec(g,n,u,o,a,i,s,f,c))&&(assertValidReturnValue(a,d),0===a?l=d:1===a?(l=d.init,h=d.get||f.get,v=d.set||f.set,f={get:h,set:v}):f=d);else for(var y=g.length-1;y>=0;y--){var m;if(void 0!==(d=memberDec(g[y],n,u,o,a,i,s,f,c)))assertValidReturnValue(a,d),0===a?m=d:1===a?(m=d.init,h=d.get||f.get,v=d.set||f.set,f={get:h,set:v}):f=d,void 0!==m&&(void 0===l?l=m:"function"==typeof l?l=[l,m]:l.push(m))}if(0===a||1===a){if(void 0===l)l=function(e,t){return t};else if("function"!=typeof l){var b=l;l=function(e,t){for(var r=t,n=0;n<b.length;n++)r=b[n].call(e,r);return r}}else{var I=l;l=function(e,t){return I.call(e,t)}}e.push(l)}0!==a&&(1===a?(u.get=f.get,u.set=f.set):2===a?u.value=f:3===a?u.get=f:4===a&&(u.set=f),s?1===a?(e.push((function(e,t){return f.get.call(e,t)})),e.push((function(e,t){return f.set.call(e,t)}))):2===a?e.push(f):e.push((function(e,t){return f.call(e,t)})):Object.defineProperty(t,n,u))}function applyMemberDecs(e,t,r){for(var n,a,i,s=[],o=new Map,c=new Map,u=0;u<t.length;u++){var l=t[u];if(Array.isArray(l)){var f,p,d=l[1],h=l[2],v=l.length>3,g=d>=5,y=r;if(g?(f=e,0!==(d-=5)&&(p=a=a||[]),v&&!i&&(i=function(t){return checkInRHS(t)===e}),y=i):(f=e.prototype,0!==d&&(p=n=n||[])),0!==d&&!v){var m=g?c:o,b=m.get(h)||0;if(!0===b||3===b&&4!==d||4===b&&3!==d)throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: "+h);!b&&d>2?m.set(h,d):m.set(h,!0)}applyMemberDec(s,f,l,h,d,g,v,p,y)}}return pushInitializers(s,n),pushInitializers(s,a),s}function pushInitializers(e,t){t&&e.push((function(e){for(var r=0;r<t.length;r++)t[r].call(e);return e}))}return function(e,t,r,n){return{e:applyMemberDecs(e,t,n),get c(){return function(e,t){if(t.length>0){for(var r=[],n=e,a=e.name,i=t.length-1;i>=0;i--){var s={v:!1};try{var o=t[i](n,{kind:"class",name:a,addInitializer:createAddInitializerMethod(r,s)})}finally{s.v=!0}void 0!==o&&(assertValidReturnValue(10,o),n=o)}return[n,function(){for(var e=0;e<r.length;e++)r[e].call(n)}]}}(e,r)}}}}export default function applyDecs2301(e,t,r,n){return(applyDecs2301=applyDecs2301Factory())(e,t,r,n)}'),
-  applyDecs2305: helper("7.21.0", 'import checkInRHS from"checkInRHS";function createAddInitializerMethod(e,t){return function(r){assertNotFinished(t,"addInitializer"),assertCallable(r,"An initializer"),e.push(r)}}function assertInstanceIfPrivate(e,t){if(!e(t))throw new TypeError("Attempted to access private element on non-instance")}function memberDec(e,t,r,n,a,i,s,o,c,l){var u;switch(i){case 1:u="accessor";break;case 2:u="method";break;case 3:u="getter";break;case 4:u="setter";break;default:u="field"}var f,d,p={kind:u,name:o?"#"+r:r,static:s,private:o},h={v:!1};if(0!==i&&(p.addInitializer=createAddInitializerMethod(a,h)),o||0!==i&&2!==i)if(2===i)f=function(e){return assertInstanceIfPrivate(l,e),n.value};else{var v=0===i||1===i;(v||3===i)&&(f=o?function(e){return assertInstanceIfPrivate(l,e),n.get.call(e)}:function(e){return n.get.call(e)}),(v||4===i)&&(d=o?function(e,t){assertInstanceIfPrivate(l,e),n.set.call(e,t)}:function(e,t){n.set.call(e,t)})}else f=function(e){return e[r]},0===i&&(d=function(e,t){e[r]=t});var y=o?l.bind():function(e){return r in e};p.access=f&&d?{get:f,set:d,has:y}:f?{get:f,has:y}:{set:d,has:y};try{return e.call(t,c,p)}finally{h.v=!0}}function assertNotFinished(e,t){if(e.v)throw new Error("attempted to call "+t+" after decoration was finished")}function assertCallable(e,t){if("function"!=typeof e)throw new TypeError(t+" must be a function")}function assertValidReturnValue(e,t){var r=typeof t;if(1===e){if("object"!==r||null===t)throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");void 0!==t.get&&assertCallable(t.get,"accessor.get"),void 0!==t.set&&assertCallable(t.set,"accessor.set"),void 0!==t.init&&assertCallable(t.init,"accessor.init")}else if("function"!==r){var n;throw n=0===e?"field":5===e?"class":"method",new TypeError(n+" decorators must return a function or void 0")}}function curryThis1(e){return function(){return e(this)}}function curryThis2(e){return function(t){e(this,t)}}function applyMemberDec(e,t,r,n,a,i,s,o,c,l){var u,f,d,p,h,v,y=r[0];n||Array.isArray(y)||(y=[y]),o?u=0===i||1===i?{get:curryThis1(r[3]),set:curryThis2(r[4])}:3===i?{get:r[3]}:4===i?{set:r[3]}:{value:r[3]}:0!==i&&(u=Object.getOwnPropertyDescriptor(t,a)),1===i?d={get:u.get,set:u.set}:2===i?d=u.value:3===i?d=u.get:4===i&&(d=u.set);for(var g=n?2:1,m=y.length-1;m>=0;m-=g){var b;if(void 0!==(p=memberDec(y[m],n?y[m-1]:void 0,a,u,c,i,s,o,d,l)))assertValidReturnValue(i,p),0===i?b=p:1===i?(b=p.init,h=p.get||d.get,v=p.set||d.set,d={get:h,set:v}):d=p,void 0!==b&&(void 0===f?f=b:"function"==typeof f?f=[f,b]:f.push(b))}if(0===i||1===i){if(void 0===f)f=function(e,t){return t};else if("function"!=typeof f){var I=f;f=function(e,t){for(var r=t,n=I.length-1;n>=0;n--)r=I[n].call(e,r);return r}}else{var w=f;f=function(e,t){return w.call(e,t)}}e.push(f)}0!==i&&(1===i?(u.get=d.get,u.set=d.set):2===i?u.value=d:3===i?u.get=d:4===i&&(u.set=d),o?1===i?(e.push((function(e,t){return d.get.call(e,t)})),e.push((function(e,t){return d.set.call(e,t)}))):2===i?e.push(d):e.push((function(e,t){return d.call(e,t)})):Object.defineProperty(t,a,u))}function applyMemberDecs(e,t,r){for(var n,a,i,s=[],o=new Map,c=new Map,l=0;l<t.length;l++){var u=t[l];if(Array.isArray(u)){var f,d,p=u[1],h=u[2],v=u.length>3,y=16&p,g=!!(8&p),m=r;if(p&=7,g?(f=e,0!==p&&(d=a=a||[]),v&&!i&&(i=function(t){return checkInRHS(t)===e}),m=i):(f=e.prototype,0!==p&&(d=n=n||[])),0!==p&&!v){var b=g?c:o,I=b.get(h)||0;if(!0===I||3===I&&4!==p||4===I&&3!==p)throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: "+h);b.set(h,!(!I&&p>2)||p)}applyMemberDec(s,f,u,y,h,p,g,v,d,m)}}return pushInitializers(s,n),pushInitializers(s,a),s}function pushInitializers(e,t){t&&e.push((function(e){for(var r=0;r<t.length;r++)t[r].call(e);return e}))}function applyClassDecs(e,t,r){if(t.length){for(var n=[],a=e,i=e.name,s=r?2:1,o=t.length-1;o>=0;o-=s){var c={v:!1};try{var l=t[o].call(r?t[o-1]:void 0,a,{kind:"class",name:i,addInitializer:createAddInitializerMethod(n,c)})}finally{c.v=!0}void 0!==l&&(assertValidReturnValue(5,l),a=l)}return[a,function(){for(var e=0;e<n.length;e++)n[e].call(a)}]}}export default function applyDecs2305(e,t,r,n,a){return{e:applyMemberDecs(e,t,a),get c(){return applyClassDecs(e,r,n)}}}'),
+  applyDecs2305: helper("7.21.0", 'import checkInRHS from"checkInRHS";function createAddInitializerMethod(e,t){return function(r){assertNotFinished(t,"addInitializer"),assertCallable(r,"An initializer"),e.push(r)}}function assertInstanceIfPrivate(e,t){if(!e(t))throw new TypeError("Attempted to access private element on non-instance")}function memberDec(e,t,r,a,n,i,s,o,c,l,u){var f;switch(i){case 1:f="accessor";break;case 2:f="method";break;case 3:f="getter";break;case 4:f="setter";break;default:f="field"}var d,p,h={kind:f,name:o?"#"+r:r,static:s,private:o,metadata:u},v={v:!1};if(0!==i&&(h.addInitializer=createAddInitializerMethod(n,v)),o||0!==i&&2!==i)if(2===i)d=function(e){return assertInstanceIfPrivate(l,e),a.value};else{var y=0===i||1===i;(y||3===i)&&(d=o?function(e){return assertInstanceIfPrivate(l,e),a.get.call(e)}:function(e){return a.get.call(e)}),(y||4===i)&&(p=o?function(e,t){assertInstanceIfPrivate(l,e),a.set.call(e,t)}:function(e,t){a.set.call(e,t)})}else d=function(e){return e[r]},0===i&&(p=function(e,t){e[r]=t});var m=o?l.bind():function(e){return r in e};h.access=d&&p?{get:d,set:p,has:m}:d?{get:d,has:m}:{set:p,has:m};try{return e.call(t,c,h)}finally{v.v=!0}}function assertNotFinished(e,t){if(e.v)throw new Error("attempted to call "+t+" after decoration was finished")}function assertCallable(e,t){if("function"!=typeof e)throw new TypeError(t+" must be a function")}function assertValidReturnValue(e,t){var r=typeof t;if(1===e){if("object"!==r||null===t)throw new TypeError("accessor decorators must return an object with get, set, or init properties or void 0");void 0!==t.get&&assertCallable(t.get,"accessor.get"),void 0!==t.set&&assertCallable(t.set,"accessor.set"),void 0!==t.init&&assertCallable(t.init,"accessor.init")}else if("function"!==r){var a;throw a=0===e?"field":5===e?"class":"method",new TypeError(a+" decorators must return a function or void 0")}}function curryThis1(e){return function(){return e(this)}}function curryThis2(e){return function(t){e(this,t)}}function applyMemberDec(e,t,r,a,n,i,s,o,c,l,u){var f,d,p,h,v,y,m=r[0];a||Array.isArray(m)||(m=[m]),o?f=0===i||1===i?{get:curryThis1(r[3]),set:curryThis2(r[4])}:3===i?{get:r[3]}:4===i?{set:r[3]}:{value:r[3]}:0!==i&&(f=Object.getOwnPropertyDescriptor(t,n)),1===i?p={get:f.get,set:f.set}:2===i?p=f.value:3===i?p=f.get:4===i&&(p=f.set);for(var g=a?2:1,b=m.length-1;b>=0;b-=g){var I;if(void 0!==(h=memberDec(m[b],a?m[b-1]:void 0,n,f,c,i,s,o,p,l,u)))assertValidReturnValue(i,h),0===i?I=h:1===i?(I=h.init,v=h.get||p.get,y=h.set||p.set,p={get:v,set:y}):p=h,void 0!==I&&(void 0===d?d=I:"function"==typeof d?d=[d,I]:d.push(I))}if(0===i||1===i){if(void 0===d)d=function(e,t){return t};else if("function"!=typeof d){var w=d;d=function(e,t){for(var r=t,a=w.length-1;a>=0;a--)r=w[a].call(e,r);return r}}else{var M=d;d=function(e,t){return M.call(e,t)}}e.push(d)}0!==i&&(1===i?(f.get=p.get,f.set=p.set):2===i?f.value=p:3===i?f.get=p:4===i&&(f.set=p),o?1===i?(e.push((function(e,t){return p.get.call(e,t)})),e.push((function(e,t){return p.set.call(e,t)}))):2===i?e.push(p):e.push((function(e,t){return p.call(e,t)})):Object.defineProperty(t,n,f))}function applyMemberDecs(e,t,r,a){for(var n,i,s,o=[],c=new Map,l=new Map,u=0;u<t.length;u++){var f=t[u];if(Array.isArray(f)){var d,p,h=f[1],v=f[2],y=f.length>3,m=16&h,g=!!(8&h),b=r;if(h&=7,g?(d=e,0!==h&&(p=i=i||[]),y&&!s&&(s=function(t){return checkInRHS(t)===e}),b=s):(d=e.prototype,0!==h&&(p=n=n||[])),0!==h&&!y){var I=g?l:c,w=I.get(v)||0;if(!0===w||3===w&&4!==h||4===w&&3!==h)throw new Error("Attempted to decorate a public method/accessor that has the same name as a previously decorated public method/accessor. This is not currently supported by the decorators plugin. Property name was: "+v);I.set(v,!(!w&&h>2)||h)}applyMemberDec(o,d,f,m,v,h,g,y,p,b,a)}}return pushInitializers(o,n),pushInitializers(o,i),o}function pushInitializers(e,t){t&&e.push((function(e){for(var r=0;r<t.length;r++)t[r].call(e);return e}))}function applyClassDecs(e,t,r,a){if(t.length){for(var n=[],i=e,s=e.name,o=r?2:1,c=t.length-1;c>=0;c-=o){var l={v:!1};try{var u=t[c].call(r?t[c-1]:void 0,i,{kind:"class",name:s,addInitializer:createAddInitializerMethod(n,l),metadata:a})}finally{l.v=!0}void 0!==u&&(assertValidReturnValue(5,u),i=u)}return[defineMetadata(i,a),function(){for(var e=0;e<n.length;e++)n[e].call(i)}]}}function defineMetadata(e,t){return Object.defineProperty(e,Symbol.metadata||Symbol.for("Symbol.metadata"),{configurable:!0,enumerable:!0,value:t})}export default function applyDecs2305(e,t,r,a,n,i){if(arguments.length>=6)var s=i[Symbol.metadata||Symbol.for("Symbol.metadata")];var o=Object.create(void 0===s?null:s),c=applyMemberDecs(e,t,n,o);return r.length||defineMetadata(e,o),{e:c,get c(){return applyClassDecs(e,r,a,o)}}}'),
   asyncGeneratorDelegate: helper("7.0.0-beta.0", 'import OverloadYield from"OverloadYield";export default function _asyncGeneratorDelegate(t){var e={},n=!1;function pump(e,r){return n=!0,r=new Promise((function(n){n(t[e](r))})),{done:!1,value:new OverloadYield(r,1)}}return e["undefined"!=typeof Symbol&&Symbol.iterator||"@@iterator"]=function(){return this},e.next=function(t){return n?(n=!1,t):pump("next",t)},"function"==typeof t.throw&&(e.throw=function(t){if(n)throw n=!1,t;return pump("throw",t)}),"function"==typeof t.return&&(e.return=function(t){return n?(n=!1,t):pump("return",t)}),e}'),
   asyncIterator: helper("7.15.9", 'export default function _asyncIterator(r){var n,t,o,e=2;for("undefined"!=typeof Symbol&&(t=Symbol.asyncIterator,o=Symbol.iterator);e--;){if(t&&null!=(n=r[t]))return n.call(r);if(o&&null!=(n=r[o]))return new AsyncFromSyncIterator(n.call(r));t="@@asyncIterator",o="@@iterator"}throw new TypeError("Object is not async iterable")}function AsyncFromSyncIterator(r){function AsyncFromSyncIteratorContinuation(r){if(Object(r)!==r)return Promise.reject(new TypeError(r+" is not an object."));var n=r.done;return Promise.resolve(r.value).then((function(r){return{value:r,done:n}}))}return AsyncFromSyncIterator=function(r){this.s=r,this.n=r.next},AsyncFromSyncIterator.prototype={s:null,n:null,next:function(){return AsyncFromSyncIteratorContinuation(this.n.apply(this.s,arguments))},return:function(r){var n=this.s.return;return void 0===n?Promise.resolve({value:r,done:!0}):AsyncFromSyncIteratorContinuation(n.apply(this.s,arguments))},throw:function(r){var n=this.s.return;return void 0===n?Promise.reject(r):AsyncFromSyncIteratorContinuation(n.apply(this.s,arguments))}},new AsyncFromSyncIterator(r)}'),
   awaitAsyncGenerator: helper("7.0.0-beta.0", 'import OverloadYield from"OverloadYield";export default function _awaitAsyncGenerator(e){return new OverloadYield(e,0)}'),
   checkInRHS: helper("7.20.5", 'export default function _checkInRHS(e){if(Object(e)!==e)throw TypeError("right-hand side of \'in\' should be an object, got "+(null!==e?typeof e:"null"));return e}'),
   defineAccessor: helper("7.20.7", "export default function _defineAccessor(e,r,n,t){var c={configurable:!0,enumerable:!0};return c[e]=t,Object.defineProperty(r,n,c)}"),
   dispose: helper("7.22.0", 'function dispose_SuppressedError(r,e){return"undefined"!=typeof SuppressedError?dispose_SuppressedError=SuppressedError:(dispose_SuppressedError=function(r,e){this.suppressed=r,this.error=e,this.stack=(new Error).stack},dispose_SuppressedError.prototype=Object.create(Error.prototype,{constructor:{value:dispose_SuppressedError,writable:!0,configurable:!0}})),new dispose_SuppressedError(r,e)}export default function _dispose(r,e,s){function next(){for(;r.length>0;)try{var o=r.pop(),p=o.d.call(o.v);if(o.a)return Promise.resolve(p).then(next,err)}catch(r){return err(r)}if(s)throw e}function err(r){return e=s?new dispose_SuppressedError(r,e):r,s=!0,next()}return next()}'),
+  importDeferProxy: helper("7.23.0", "export default function _importDeferProxy(e){var t=null,constValue=function(e){return function(){return e}},proxy=function(r){return function(n,o,f){return null===t&&(t=e()),r(t,o,f)}};return new Proxy({},{defineProperty:constValue(!1),deleteProperty:constValue(!1),get:proxy(Reflect.get),getOwnPropertyDescriptor:proxy(Reflect.getOwnPropertyDescriptor),getPrototypeOf:constValue(null),isExtensible:constValue(!1),has:proxy(Reflect.has),ownKeys:proxy(Reflect.ownKeys),preventExtensions:constValue(!0),set:constValue(!1),setPrototypeOf:constValue(!1)})}"),
   iterableToArrayLimit: helper("7.0.0-beta.0", 'export default function _iterableToArrayLimit(r,l){var t=null==r?null:"undefined"!=typeof Symbol&&r[Symbol.iterator]||r["@@iterator"];if(null!=t){var e,n,i,u,a=[],f=!0,o=!1;try{if(i=(t=t.call(r)).next,0===l){if(Object(t)!==t)return;f=!1}else for(;!(f=(e=i.call(t)).done)&&(a.push(e.value),a.length!==l);f=!0);}catch(r){o=!0,n=r}finally{try{if(!f&&null!=t.return&&(u=t.return(),Object(u)!==u))return}finally{if(o)throw n}}return a}}'),
   iterableToArrayLimitLoose: helper("7.0.0-beta.0", 'export default function _iterableToArrayLimitLoose(e,r){var t=e&&("undefined"!=typeof Symbol&&e[Symbol.iterator]||e["@@iterator"]);if(null!=t){var o,l=[];for(t=t.call(e);e.length<r&&!(o=t.next()).done;)l.push(o.value);return l}}'),
   jsx: helper("7.0.0-beta.0", 'var REACT_ELEMENT_TYPE;export default function _createRawReactElement(e,r,E,l){REACT_ELEMENT_TYPE||(REACT_ELEMENT_TYPE="function"==typeof Symbol&&Symbol.for&&Symbol.for("react.element")||60103);var o=e&&e.defaultProps,n=arguments.length-3;if(r||0===n||(r={children:void 0}),1===n)r.children=l;else if(n>1){for(var t=new Array(n),f=0;f<n;f++)t[f]=arguments[f+3];r.children=t}if(r&&o)for(var i in o)void 0===r[i]&&(r[i]=o[i]);else r||(r=o||{});return{$$typeof:REACT_ELEMENT_TYPE,type:e,key:void 0===E?null:""+E,ref:null,props:r,_owner:null}}'),
diff --git a/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers.js b/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers.js
index 1ed8b9448b1b66..5f4b4a2dd6d84d 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers.js
@@ -1780,5 +1780,10 @@ helpers.identity = helper("7.17.0")`
     return x;
   }
 `;
+helpers.nullishReceiverError = helper("7.22.6")`
+  export default function _nullishReceiverError(r) {
+    throw new TypeError("Cannot set property of null or undefined.");
+  }
+`;
 
 //# sourceMappingURL=helpers.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers/applyDecs2305.js b/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers/applyDecs2305.js
index 11c66cd6ab4d56..35ad119c41b6e5 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers/applyDecs2305.js
+++ b/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers/applyDecs2305.js
@@ -17,7 +17,7 @@ function assertInstanceIfPrivate(has, target) {
     throw new TypeError("Attempted to access private element on non-instance");
   }
 }
-function memberDec(dec, thisArg, name, desc, initializers, kind, isStatic, isPrivate, value, hasPrivateBrand) {
+function memberDec(dec, thisArg, name, desc, initializers, kind, isStatic, isPrivate, value, hasPrivateBrand, metadata) {
   var kindStr;
   switch (kind) {
     case 1:
@@ -39,7 +39,8 @@ function memberDec(dec, thisArg, name, desc, initializers, kind, isStatic, isPri
     kind: kindStr,
     name: isPrivate ? "#" + name : name,
     static: isStatic,
-    private: isPrivate
+    private: isPrivate,
+    metadata: metadata
   };
   var decoratorFinishedRef = {
     v: false
@@ -156,7 +157,7 @@ function curryThis2(fn) {
     fn(this, value);
   };
 }
-function applyMemberDec(ret, base, decInfo, decoratorsHaveThis, name, kind, isStatic, isPrivate, initializers, hasPrivateBrand) {
+function applyMemberDec(ret, base, decInfo, decoratorsHaveThis, name, kind, isStatic, isPrivate, initializers, hasPrivateBrand, metadata) {
   var decs = decInfo[0];
   if (!decoratorsHaveThis && !Array.isArray(decs)) {
     decs = [decs];
@@ -202,7 +203,7 @@ function applyMemberDec(ret, base, decInfo, decoratorsHaveThis, name, kind, isSt
   var inc = decoratorsHaveThis ? 2 : 1;
   for (var i = decs.length - 1; i >= 0; i -= inc) {
     var dec = decs[i];
-    newValue = memberDec(dec, decoratorsHaveThis ? decs[i - 1] : undefined, name, desc, initializers, kind, isStatic, isPrivate, value, hasPrivateBrand);
+    newValue = memberDec(dec, decoratorsHaveThis ? decs[i - 1] : undefined, name, desc, initializers, kind, isStatic, isPrivate, value, hasPrivateBrand, metadata);
     if (newValue !== void 0) {
       assertValidReturnValue(kind, newValue);
       var newInit;
@@ -283,7 +284,7 @@ function applyMemberDec(ret, base, decInfo, decoratorsHaveThis, name, kind, isSt
     }
   }
 }
-function applyMemberDecs(Class, decInfos, instanceBrand) {
+function applyMemberDecs(Class, decInfos, instanceBrand, metadata) {
   var ret = [];
   var protoInitializers;
   var staticInitializers;
@@ -329,7 +330,7 @@ function applyMemberDecs(Class, decInfos, instanceBrand) {
       }
       existingNonFields.set(name, !existingKind && kind > 2 ? kind : true);
     }
-    applyMemberDec(ret, base, decInfo, decoratorsHaveThis, name, kind, isStatic, isPrivate, initializers, hasPrivateBrand);
+    applyMemberDec(ret, base, decInfo, decoratorsHaveThis, name, kind, isStatic, isPrivate, initializers, hasPrivateBrand, metadata);
   }
   pushInitializers(ret, protoInitializers);
   pushInitializers(ret, staticInitializers);
@@ -345,7 +346,7 @@ function pushInitializers(ret, initializers) {
     });
   }
 }
-function applyClassDecs(targetClass, classDecs, decoratorsHaveThis) {
+function applyClassDecs(targetClass, classDecs, decoratorsHaveThis, metadata) {
   if (classDecs.length) {
     var initializers = [];
     var newClass = targetClass;
@@ -359,7 +360,8 @@ function applyClassDecs(targetClass, classDecs, decoratorsHaveThis) {
         var nextNewClass = classDecs[i].call(decoratorsHaveThis ? classDecs[i - 1] : undefined, newClass, {
           kind: "class",
           name: name,
-          addInitializer: createAddInitializerMethod(initializers, decoratorFinishedRef)
+          addInitializer: createAddInitializerMethod(initializers, decoratorFinishedRef),
+          metadata
         });
       } finally {
         decoratorFinishedRef.v = true;
@@ -369,18 +371,31 @@ function applyClassDecs(targetClass, classDecs, decoratorsHaveThis) {
         newClass = nextNewClass;
       }
     }
-    return [newClass, function () {
+    return [defineMetadata(newClass, metadata), function () {
       for (var i = 0; i < initializers.length; i++) {
         initializers[i].call(newClass);
       }
     }];
   }
 }
-function applyDecs2305(targetClass, memberDecs, classDecs, classDecsHaveThis, instanceBrand) {
+function defineMetadata(Class, metadata) {
+  return Object.defineProperty(Class, Symbol.metadata || Symbol.for("Symbol.metadata"), {
+    configurable: true,
+    enumerable: true,
+    value: metadata
+  });
+}
+function applyDecs2305(targetClass, memberDecs, classDecs, classDecsHaveThis, instanceBrand, parentClass) {
+  if (arguments.length >= 6) {
+    var parentMetadata = parentClass[Symbol.metadata || Symbol.for("Symbol.metadata")];
+  }
+  var metadata = Object.create(parentMetadata === void 0 ? null : parentMetadata);
+  var e = applyMemberDecs(targetClass, memberDecs, instanceBrand, metadata);
+  if (!classDecs.length) defineMetadata(targetClass, metadata);
   return {
-    e: applyMemberDecs(targetClass, memberDecs, instanceBrand),
+    e: e,
     get c() {
-      return applyClassDecs(targetClass, classDecs, classDecsHaveThis);
+      return applyClassDecs(targetClass, classDecs, classDecsHaveThis, metadata);
     }
   };
 }
diff --git a/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers/importDeferProxy.js b/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers/importDeferProxy.js
new file mode 100644
index 00000000000000..a9cd56391ff04f
--- /dev/null
+++ b/tools/node_modules/eslint/node_modules/@babel/helpers/lib/helpers/importDeferProxy.js
@@ -0,0 +1,35 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = _importDeferProxy;
+function _importDeferProxy(init) {
+  var ns = null;
+  var constValue = function (v) {
+    return function () {
+      return v;
+    };
+  };
+  var proxy = function (run) {
+    return function (arg1, arg2, arg3) {
+      if (ns === null) ns = init();
+      return run(ns, arg2, arg3);
+    };
+  };
+  return new Proxy({}, {
+    defineProperty: constValue(false),
+    deleteProperty: constValue(false),
+    get: proxy(Reflect.get),
+    getOwnPropertyDescriptor: proxy(Reflect.getOwnPropertyDescriptor),
+    getPrototypeOf: constValue(null),
+    isExtensible: constValue(false),
+    has: proxy(Reflect.has),
+    ownKeys: proxy(Reflect.ownKeys),
+    preventExtensions: constValue(true),
+    set: constValue(false),
+    setPrototypeOf: constValue(false)
+  });
+}
+
+//# sourceMappingURL=importDeferProxy.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/helpers/package.json b/tools/node_modules/eslint/node_modules/@babel/helpers/package.json
index 605c9e4c3f7c2a..289c86f9c3531b 100644
--- a/tools/node_modules/eslint/node_modules/@babel/helpers/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/helpers/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/helpers",
-  "version": "7.22.15",
+  "version": "7.23.1",
   "description": "Collection of helper functions used by Babel transforms.",
   "author": "The Babel Team (https://babel.dev/team)",
   "homepage": "https://babel.dev/docs/en/next/babel-helpers",
@@ -16,13 +16,13 @@
   "main": "./lib/index.js",
   "dependencies": {
     "@babel/template": "^7.22.15",
-    "@babel/traverse": "^7.22.15",
-    "@babel/types": "^7.22.15"
+    "@babel/traverse": "^7.23.0",
+    "@babel/types": "^7.23.0"
   },
   "devDependencies": {
-    "@babel/generator": "^7.22.15",
+    "@babel/generator": "^7.23.0",
     "@babel/helper-plugin-test-runner": "^7.22.5",
-    "@babel/parser": "^7.22.15",
+    "@babel/parser": "^7.23.0",
     "regenerator-runtime": "^0.14.0",
     "terser": "^5.19.2"
   },
diff --git a/tools/node_modules/eslint/node_modules/@babel/highlight/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/highlight/lib/index.js
index eca79d65df92ec..cb718afd154ce0 100644
--- a/tools/node_modules/eslint/node_modules/@babel/highlight/lib/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/highlight/lib/index.js
@@ -91,9 +91,7 @@ function getChalk(forceColor) {
   return _chalk.default;
 }
 {
-  {
-    exports.getChalk = options => getChalk(options.forceColor);
-  }
+  exports.getChalk = options => getChalk(options.forceColor);
 }
 function highlight(code, options = {}) {
   if (code !== "" && shouldHighlight(options)) {
diff --git a/tools/node_modules/eslint/node_modules/@babel/highlight/package.json b/tools/node_modules/eslint/node_modules/@babel/highlight/package.json
index b8c3df7e254b0f..d88c972268588e 100644
--- a/tools/node_modules/eslint/node_modules/@babel/highlight/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/highlight/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/highlight",
-  "version": "7.22.13",
+  "version": "7.22.20",
   "description": "Syntax highlight JavaScript strings for output in terminals.",
   "author": "The Babel Team (https://babel.dev/team)",
   "homepage": "https://babel.dev/docs/en/next/babel-highlight",
@@ -15,7 +15,7 @@
   },
   "main": "./lib/index.js",
   "dependencies": {
-    "@babel/helper-validator-identifier": "^7.22.5",
+    "@babel/helper-validator-identifier": "^7.22.20",
     "chalk": "^2.4.2",
     "js-tokens": "^4.0.0"
   },
diff --git a/tools/node_modules/eslint/node_modules/@babel/parser/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/parser/lib/index.js
index 2e32aee09b1bc3..bcf69004cd8aa6 100644
--- a/tools/node_modules/eslint/node_modules/@babel/parser/lib/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/parser/lib/index.js
@@ -113,6 +113,7 @@ var StandardErrors = {
   DecoratorExportClass: "Decorators must be placed *after* the 'export' keyword. Remove the 'decoratorsBeforeExport: false' option to use the '@decorator export class {}' syntax.",
   DecoratorSemicolon: "Decorators must not be followed by a semicolon.",
   DecoratorStaticBlock: "Decorators can't be used with a static block.",
+  DeferImportRequiresNamespace: 'Only `import defer * as x from "./module"` is valid.',
   DeletePrivateField: "Deleting a private field is not allowed.",
   DestructureNamedImport: "ES2015 named imports do not destructure. Use another statement for destructuring after the import.",
   DuplicateConstructor: "Duplicate constructor in the same class.",
@@ -122,6 +123,9 @@ var StandardErrors = {
   }) => `\`${exportName}\` has already been exported. Exported identifiers must be unique.`,
   DuplicateProto: "Redefinition of __proto__ property.",
   DuplicateRegExpFlags: "Duplicate regular expression flag.",
+  DynamicImportPhaseRequiresImportExpressions: ({
+    phase
+  }) => `'import.${phase}(...)' can only be parsed when using the 'createImportExpressions' option.`,
   ElementAfterRest: "Rest element must be last element.",
   EscapedCharNotAnIdentifier: "Invalid Unicode escape.",
   ExportBindingIsString: ({
@@ -176,6 +180,9 @@ var StandardErrors = {
   InvalidLhsBinding: ({
     ancestor
   }) => `Binding invalid left-hand side in ${toNodeDescription(ancestor)}.`,
+  InvalidLhsOptionalChaining: ({
+    ancestor
+  }) => `Invalid optional chaining in the left-hand side of ${toNodeDescription(ancestor)}.`,
   InvalidNumber: "Invalid number.",
   InvalidOrMissingExponent: "Floating-point numbers require a valid exponent after the 'e'.",
   InvalidOrUnexpectedToken: ({
@@ -241,6 +248,7 @@ var StandardErrors = {
   RestTrailingComma: "Unexpected trailing comma after rest element.",
   SloppyFunction: "In non-strict mode code, functions can only be declared at top level or inside a block.",
   SloppyFunctionAnnexB: "In non-strict mode code, functions can only be declared at top level, inside a block, or as the body of an if statement.",
+  SourcePhaseImportRequiresDefault: 'Only `import source x from "./module"` is valid.',
   StaticPrototype: "Classes may not have static property named prototype.",
   SuperNotAllowed: "`super()` is only valid inside a class constructor of a subclass. Maybe a typo in the method name ('constructor') or not extending another class?",
   SuperPrivateField: "Private fields can't be accessed on super.",
@@ -662,8 +670,9 @@ var estree = superClass => class ESTreeParserMixin extends superClass {
       node.type = "ImportExpression";
       node.source = node.arguments[0];
       if (this.hasPlugin("importAttributes") || this.hasPlugin("importAssertions")) {
-        var _node$arguments$;
-        node.attributes = (_node$arguments$ = node.arguments[1]) != null ? _node$arguments$ : null;
+        var _node$arguments$, _node$arguments$2;
+        node.options = (_node$arguments$ = node.arguments[1]) != null ? _node$arguments$ : null;
+        node.attributes = (_node$arguments$2 = node.arguments[1]) != null ? _node$arguments$2 : null;
       }
       delete node.arguments;
       delete node.callee;
@@ -719,6 +728,12 @@ var estree = superClass => class ESTreeParserMixin extends superClass {
     }
     return node;
   }
+  isOptionalMemberExpression(node) {
+    if (node.type === "ChainExpression") {
+      return node.expression.type === "MemberExpression";
+    }
+    return super.isOptionalMemberExpression(node);
+  }
   hasPropertyAsPrivateName(node) {
     if (node.type === "ChainExpression") {
       node = node.expression;
@@ -1092,6 +1107,9 @@ const tt = {
   _await: createKeywordLike("await", {
     startsExpr
   }),
+  _defer: createKeywordLike("defer", {
+    startsExpr
+  }),
   _from: createKeywordLike("from", {
     startsExpr
   }),
@@ -1113,6 +1131,9 @@ const tt = {
   _set: createKeywordLike("set", {
     startsExpr
   }),
+  _source: createKeywordLike("source", {
+    startsExpr
+  }),
   _static: createKeywordLike("static", {
     startsExpr
   }),
@@ -1226,16 +1247,16 @@ const tt = {
   })
 };
 function tokenIsIdentifier(token) {
-  return token >= 93 && token <= 130;
+  return token >= 93 && token <= 132;
 }
 function tokenKeywordOrIdentifierIsKeyword(token) {
   return token <= 92;
 }
 function tokenIsKeywordOrIdentifier(token) {
-  return token >= 58 && token <= 130;
+  return token >= 58 && token <= 132;
 }
 function tokenIsLiteralPropertyName(token) {
-  return token >= 58 && token <= 134;
+  return token >= 58 && token <= 136;
 }
 function tokenComesBeforeExpression(token) {
   return tokenBeforeExprs[token];
@@ -1247,7 +1268,7 @@ function tokenIsAssignment(token) {
   return token >= 29 && token <= 33;
 }
 function tokenIsFlowInterfaceOrTypeOrOpaque(token) {
-  return token >= 127 && token <= 129;
+  return token >= 129 && token <= 131;
 }
 function tokenIsLoop(token) {
   return token >= 90 && token <= 92;
@@ -1265,10 +1286,10 @@ function tokenIsPrefix(token) {
   return tokenPrefixes[token];
 }
 function tokenIsTSTypeOperator(token) {
-  return token >= 119 && token <= 121;
+  return token >= 121 && token <= 123;
 }
 function tokenIsTSDeclarationStart(token) {
-  return token >= 122 && token <= 128;
+  return token >= 124 && token <= 130;
 }
 function tokenLabelName(token) {
   return tokenLabels[token];
@@ -1299,16 +1320,16 @@ function getExportedToken(token) {
       context.push(types.template);
     }
   };
-  tokenTypes[140].updateContext = context => {
+  tokenTypes[142].updateContext = context => {
     context.push(types.j_expr, types.j_oTag);
   };
 }
 let nonASCIIidentifierStartChars = "\xaa\xb5\xba\xc0-\xd6\xd8-\xf6\xf8-\u02c1\u02c6-\u02d1\u02e0-\u02e4\u02ec\u02ee\u0370-\u0374\u0376\u0377\u037a-\u037d\u037f\u0386\u0388-\u038a\u038c\u038e-\u03a1\u03a3-\u03f5\u03f7-\u0481\u048a-\u052f\u0531-\u0556\u0559\u0560-\u0588\u05d0-\u05ea\u05ef-\u05f2\u0620-\u064a\u066e\u066f\u0671-\u06d3\u06d5\u06e5\u06e6\u06ee\u06ef\u06fa-\u06fc\u06ff\u0710\u0712-\u072f\u074d-\u07a5\u07b1\u07ca-\u07ea\u07f4\u07f5\u07fa\u0800-\u0815\u081a\u0824\u0828\u0840-\u0858\u0860-\u086a\u0870-\u0887\u0889-\u088e\u08a0-\u08c9\u0904-\u0939\u093d\u0950\u0958-\u0961\u0971-\u0980\u0985-\u098c\u098f\u0990\u0993-\u09a8\u09aa-\u09b0\u09b2\u09b6-\u09b9\u09bd\u09ce\u09dc\u09dd\u09df-\u09e1\u09f0\u09f1\u09fc\u0a05-\u0a0a\u0a0f\u0a10\u0a13-\u0a28\u0a2a-\u0a30\u0a32\u0a33\u0a35\u0a36\u0a38\u0a39\u0a59-\u0a5c\u0a5e\u0a72-\u0a74\u0a85-\u0a8d\u0a8f-\u0a91\u0a93-\u0aa8\u0aaa-\u0ab0\u0ab2\u0ab3\u0ab5-\u0ab9\u0abd\u0ad0\u0ae0\u0ae1\u0af9\u0b05-\u0b0c\u0b0f\u0b10\u0b13-\u0b28\u0b2a-\u0b30\u0b32\u0b33\u0b35-\u0b39\u0b3d\u0b5c\u0b5d\u0b5f-\u0b61\u0b71\u0b83\u0b85-\u0b8a\u0b8e-\u0b90\u0b92-\u0b95\u0b99\u0b9a\u0b9c\u0b9e\u0b9f\u0ba3\u0ba4\u0ba8-\u0baa\u0bae-\u0bb9\u0bd0\u0c05-\u0c0c\u0c0e-\u0c10\u0c12-\u0c28\u0c2a-\u0c39\u0c3d\u0c58-\u0c5a\u0c5d\u0c60\u0c61\u0c80\u0c85-\u0c8c\u0c8e-\u0c90\u0c92-\u0ca8\u0caa-\u0cb3\u0cb5-\u0cb9\u0cbd\u0cdd\u0cde\u0ce0\u0ce1\u0cf1\u0cf2\u0d04-\u0d0c\u0d0e-\u0d10\u0d12-\u0d3a\u0d3d\u0d4e\u0d54-\u0d56\u0d5f-\u0d61\u0d7a-\u0d7f\u0d85-\u0d96\u0d9a-\u0db1\u0db3-\u0dbb\u0dbd\u0dc0-\u0dc6\u0e01-\u0e30\u0e32\u0e33\u0e40-\u0e46\u0e81\u0e82\u0e84\u0e86-\u0e8a\u0e8c-\u0ea3\u0ea5\u0ea7-\u0eb0\u0eb2\u0eb3\u0ebd\u0ec0-\u0ec4\u0ec6\u0edc-\u0edf\u0f00\u0f40-\u0f47\u0f49-\u0f6c\u0f88-\u0f8c\u1000-\u102a\u103f\u1050-\u1055\u105a-\u105d\u1061\u1065\u1066\u106e-\u1070\u1075-\u1081\u108e\u10a0-\u10c5\u10c7\u10cd\u10d0-\u10fa\u10fc-\u1248\u124a-\u124d\u1250-\u1256\u1258\u125a-\u125d\u1260-\u1288\u128a-\u128d\u1290-\u12b0\u12b2-\u12b5\u12b8-\u12be\u12c0\u12c2-\u12c5\u12c8-\u12d6\u12d8-\u1310\u1312-\u1315\u1318-\u135a\u1380-\u138f\u13a0-\u13f5\u13f8-\u13fd\u1401-\u166c\u166f-\u167f\u1681-\u169a\u16a0-\u16ea\u16ee-\u16f8\u1700-\u1711\u171f-\u1731\u1740-\u1751\u1760-\u176c\u176e-\u1770\u1780-\u17b3\u17d7\u17dc\u1820-\u1878\u1880-\u18a8\u18aa\u18b0-\u18f5\u1900-\u191e\u1950-\u196d\u1970-\u1974\u1980-\u19ab\u19b0-\u19c9\u1a00-\u1a16\u1a20-\u1a54\u1aa7\u1b05-\u1b33\u1b45-\u1b4c\u1b83-\u1ba0\u1bae\u1baf\u1bba-\u1be5\u1c00-\u1c23\u1c4d-\u1c4f\u1c5a-\u1c7d\u1c80-\u1c88\u1c90-\u1cba\u1cbd-\u1cbf\u1ce9-\u1cec\u1cee-\u1cf3\u1cf5\u1cf6\u1cfa\u1d00-\u1dbf\u1e00-\u1f15\u1f18-\u1f1d\u1f20-\u1f45\u1f48-\u1f4d\u1f50-\u1f57\u1f59\u1f5b\u1f5d\u1f5f-\u1f7d\u1f80-\u1fb4\u1fb6-\u1fbc\u1fbe\u1fc2-\u1fc4\u1fc6-\u1fcc\u1fd0-\u1fd3\u1fd6-\u1fdb\u1fe0-\u1fec\u1ff2-\u1ff4\u1ff6-\u1ffc\u2071\u207f\u2090-\u209c\u2102\u2107\u210a-\u2113\u2115\u2118-\u211d\u2124\u2126\u2128\u212a-\u2139\u213c-\u213f\u2145-\u2149\u214e\u2160-\u2188\u2c00-\u2ce4\u2ceb-\u2cee\u2cf2\u2cf3\u2d00-\u2d25\u2d27\u2d2d\u2d30-\u2d67\u2d6f\u2d80-\u2d96\u2da0-\u2da6\u2da8-\u2dae\u2db0-\u2db6\u2db8-\u2dbe\u2dc0-\u2dc6\u2dc8-\u2dce\u2dd0-\u2dd6\u2dd8-\u2dde\u3005-\u3007\u3021-\u3029\u3031-\u3035\u3038-\u303c\u3041-\u3096\u309b-\u309f\u30a1-\u30fa\u30fc-\u30ff\u3105-\u312f\u3131-\u318e\u31a0-\u31bf\u31f0-\u31ff\u3400-\u4dbf\u4e00-\ua48c\ua4d0-\ua4fd\ua500-\ua60c\ua610-\ua61f\ua62a\ua62b\ua640-\ua66e\ua67f-\ua69d\ua6a0-\ua6ef\ua717-\ua71f\ua722-\ua788\ua78b-\ua7ca\ua7d0\ua7d1\ua7d3\ua7d5-\ua7d9\ua7f2-\ua801\ua803-\ua805\ua807-\ua80a\ua80c-\ua822\ua840-\ua873\ua882-\ua8b3\ua8f2-\ua8f7\ua8fb\ua8fd\ua8fe\ua90a-\ua925\ua930-\ua946\ua960-\ua97c\ua984-\ua9b2\ua9cf\ua9e0-\ua9e4\ua9e6-\ua9ef\ua9fa-\ua9fe\uaa00-\uaa28\uaa40-\uaa42\uaa44-\uaa4b\uaa60-\uaa76\uaa7a\uaa7e-\uaaaf\uaab1\uaab5\uaab6\uaab9-\uaabd\uaac0\uaac2\uaadb-\uaadd\uaae0-\uaaea\uaaf2-\uaaf4\uab01-\uab06\uab09-\uab0e\uab11-\uab16\uab20-\uab26\uab28-\uab2e\uab30-\uab5a\uab5c-\uab69\uab70-\uabe2\uac00-\ud7a3\ud7b0-\ud7c6\ud7cb-\ud7fb\uf900-\ufa6d\ufa70-\ufad9\ufb00-\ufb06\ufb13-\ufb17\ufb1d\ufb1f-\ufb28\ufb2a-\ufb36\ufb38-\ufb3c\ufb3e\ufb40\ufb41\ufb43\ufb44\ufb46-\ufbb1\ufbd3-\ufd3d\ufd50-\ufd8f\ufd92-\ufdc7\ufdf0-\ufdfb\ufe70-\ufe74\ufe76-\ufefc\uff21-\uff3a\uff41-\uff5a\uff66-\uffbe\uffc2-\uffc7\uffca-\uffcf\uffd2-\uffd7\uffda-\uffdc";
-let nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u0898-\u089f\u08ca-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b55-\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3c\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0cf3\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d81-\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ece\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1715\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u180f-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1abf-\u1ace\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1dff\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua82c\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f";
+let nonASCIIidentifierChars = "\u200c\u200d\xb7\u0300-\u036f\u0387\u0483-\u0487\u0591-\u05bd\u05bf\u05c1\u05c2\u05c4\u05c5\u05c7\u0610-\u061a\u064b-\u0669\u0670\u06d6-\u06dc\u06df-\u06e4\u06e7\u06e8\u06ea-\u06ed\u06f0-\u06f9\u0711\u0730-\u074a\u07a6-\u07b0\u07c0-\u07c9\u07eb-\u07f3\u07fd\u0816-\u0819\u081b-\u0823\u0825-\u0827\u0829-\u082d\u0859-\u085b\u0898-\u089f\u08ca-\u08e1\u08e3-\u0903\u093a-\u093c\u093e-\u094f\u0951-\u0957\u0962\u0963\u0966-\u096f\u0981-\u0983\u09bc\u09be-\u09c4\u09c7\u09c8\u09cb-\u09cd\u09d7\u09e2\u09e3\u09e6-\u09ef\u09fe\u0a01-\u0a03\u0a3c\u0a3e-\u0a42\u0a47\u0a48\u0a4b-\u0a4d\u0a51\u0a66-\u0a71\u0a75\u0a81-\u0a83\u0abc\u0abe-\u0ac5\u0ac7-\u0ac9\u0acb-\u0acd\u0ae2\u0ae3\u0ae6-\u0aef\u0afa-\u0aff\u0b01-\u0b03\u0b3c\u0b3e-\u0b44\u0b47\u0b48\u0b4b-\u0b4d\u0b55-\u0b57\u0b62\u0b63\u0b66-\u0b6f\u0b82\u0bbe-\u0bc2\u0bc6-\u0bc8\u0bca-\u0bcd\u0bd7\u0be6-\u0bef\u0c00-\u0c04\u0c3c\u0c3e-\u0c44\u0c46-\u0c48\u0c4a-\u0c4d\u0c55\u0c56\u0c62\u0c63\u0c66-\u0c6f\u0c81-\u0c83\u0cbc\u0cbe-\u0cc4\u0cc6-\u0cc8\u0cca-\u0ccd\u0cd5\u0cd6\u0ce2\u0ce3\u0ce6-\u0cef\u0cf3\u0d00-\u0d03\u0d3b\u0d3c\u0d3e-\u0d44\u0d46-\u0d48\u0d4a-\u0d4d\u0d57\u0d62\u0d63\u0d66-\u0d6f\u0d81-\u0d83\u0dca\u0dcf-\u0dd4\u0dd6\u0dd8-\u0ddf\u0de6-\u0def\u0df2\u0df3\u0e31\u0e34-\u0e3a\u0e47-\u0e4e\u0e50-\u0e59\u0eb1\u0eb4-\u0ebc\u0ec8-\u0ece\u0ed0-\u0ed9\u0f18\u0f19\u0f20-\u0f29\u0f35\u0f37\u0f39\u0f3e\u0f3f\u0f71-\u0f84\u0f86\u0f87\u0f8d-\u0f97\u0f99-\u0fbc\u0fc6\u102b-\u103e\u1040-\u1049\u1056-\u1059\u105e-\u1060\u1062-\u1064\u1067-\u106d\u1071-\u1074\u1082-\u108d\u108f-\u109d\u135d-\u135f\u1369-\u1371\u1712-\u1715\u1732-\u1734\u1752\u1753\u1772\u1773\u17b4-\u17d3\u17dd\u17e0-\u17e9\u180b-\u180d\u180f-\u1819\u18a9\u1920-\u192b\u1930-\u193b\u1946-\u194f\u19d0-\u19da\u1a17-\u1a1b\u1a55-\u1a5e\u1a60-\u1a7c\u1a7f-\u1a89\u1a90-\u1a99\u1ab0-\u1abd\u1abf-\u1ace\u1b00-\u1b04\u1b34-\u1b44\u1b50-\u1b59\u1b6b-\u1b73\u1b80-\u1b82\u1ba1-\u1bad\u1bb0-\u1bb9\u1be6-\u1bf3\u1c24-\u1c37\u1c40-\u1c49\u1c50-\u1c59\u1cd0-\u1cd2\u1cd4-\u1ce8\u1ced\u1cf4\u1cf7-\u1cf9\u1dc0-\u1dff\u200c\u200d\u203f\u2040\u2054\u20d0-\u20dc\u20e1\u20e5-\u20f0\u2cef-\u2cf1\u2d7f\u2de0-\u2dff\u302a-\u302f\u3099\u309a\u30fb\ua620-\ua629\ua66f\ua674-\ua67d\ua69e\ua69f\ua6f0\ua6f1\ua802\ua806\ua80b\ua823-\ua827\ua82c\ua880\ua881\ua8b4-\ua8c5\ua8d0-\ua8d9\ua8e0-\ua8f1\ua8ff-\ua909\ua926-\ua92d\ua947-\ua953\ua980-\ua983\ua9b3-\ua9c0\ua9d0-\ua9d9\ua9e5\ua9f0-\ua9f9\uaa29-\uaa36\uaa43\uaa4c\uaa4d\uaa50-\uaa59\uaa7b-\uaa7d\uaab0\uaab2-\uaab4\uaab7\uaab8\uaabe\uaabf\uaac1\uaaeb-\uaaef\uaaf5\uaaf6\uabe3-\uabea\uabec\uabed\uabf0-\uabf9\ufb1e\ufe00-\ufe0f\ufe20-\ufe2f\ufe33\ufe34\ufe4d-\ufe4f\uff10-\uff19\uff3f\uff65";
 const nonASCIIidentifierStart = new RegExp("[" + nonASCIIidentifierStartChars + "]");
 const nonASCIIidentifier = new RegExp("[" + nonASCIIidentifierStartChars + nonASCIIidentifierChars + "]");
 nonASCIIidentifierStartChars = nonASCIIidentifierChars = null;
-const astralIdentifierStartCodes = [0, 11, 2, 25, 2, 18, 2, 1, 2, 14, 3, 13, 35, 122, 70, 52, 268, 28, 4, 48, 48, 31, 14, 29, 6, 37, 11, 29, 3, 35, 5, 7, 2, 4, 43, 157, 19, 35, 5, 35, 5, 39, 9, 51, 13, 10, 2, 14, 2, 6, 2, 1, 2, 10, 2, 14, 2, 6, 2, 1, 68, 310, 10, 21, 11, 7, 25, 5, 2, 41, 2, 8, 70, 5, 3, 0, 2, 43, 2, 1, 4, 0, 3, 22, 11, 22, 10, 30, 66, 18, 2, 1, 11, 21, 11, 25, 71, 55, 7, 1, 65, 0, 16, 3, 2, 2, 2, 28, 43, 28, 4, 28, 36, 7, 2, 27, 28, 53, 11, 21, 11, 18, 14, 17, 111, 72, 56, 50, 14, 50, 14, 35, 349, 41, 7, 1, 79, 28, 11, 0, 9, 21, 43, 17, 47, 20, 28, 22, 13, 52, 58, 1, 3, 0, 14, 44, 33, 24, 27, 35, 30, 0, 3, 0, 9, 34, 4, 0, 13, 47, 15, 3, 22, 0, 2, 0, 36, 17, 2, 24, 20, 1, 64, 6, 2, 0, 2, 3, 2, 14, 2, 9, 8, 46, 39, 7, 3, 1, 3, 21, 2, 6, 2, 1, 2, 4, 4, 0, 19, 0, 13, 4, 159, 52, 19, 3, 21, 2, 31, 47, 21, 1, 2, 0, 185, 46, 42, 3, 37, 47, 21, 0, 60, 42, 14, 0, 72, 26, 38, 6, 186, 43, 117, 63, 32, 7, 3, 0, 3, 7, 2, 1, 2, 23, 16, 0, 2, 0, 95, 7, 3, 38, 17, 0, 2, 0, 29, 0, 11, 39, 8, 0, 22, 0, 12, 45, 20, 0, 19, 72, 264, 8, 2, 36, 18, 0, 50, 29, 113, 6, 2, 1, 2, 37, 22, 0, 26, 5, 2, 1, 2, 31, 15, 0, 328, 18, 16, 0, 2, 12, 2, 33, 125, 0, 80, 921, 103, 110, 18, 195, 2637, 96, 16, 1071, 18, 5, 4026, 582, 8634, 568, 8, 30, 18, 78, 18, 29, 19, 47, 17, 3, 32, 20, 6, 18, 689, 63, 129, 74, 6, 0, 67, 12, 65, 1, 2, 0, 29, 6135, 9, 1237, 43, 8, 8936, 3, 2, 6, 2, 1, 2, 290, 16, 0, 30, 2, 3, 0, 15, 3, 9, 395, 2309, 106, 6, 12, 4, 8, 8, 9, 5991, 84, 2, 70, 2, 1, 3, 0, 3, 1, 3, 3, 2, 11, 2, 0, 2, 6, 2, 64, 2, 3, 3, 7, 2, 6, 2, 27, 2, 3, 2, 4, 2, 0, 4, 6, 2, 339, 3, 24, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 7, 1845, 30, 7, 5, 262, 61, 147, 44, 11, 6, 17, 0, 322, 29, 19, 43, 485, 27, 757, 6, 2, 3, 2, 1, 2, 14, 2, 196, 60, 67, 8, 0, 1205, 3, 2, 26, 2, 1, 2, 0, 3, 0, 2, 9, 2, 3, 2, 0, 2, 0, 7, 0, 5, 0, 2, 0, 2, 0, 2, 2, 2, 1, 2, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 1, 2, 0, 3, 3, 2, 6, 2, 3, 2, 3, 2, 0, 2, 9, 2, 16, 6, 2, 2, 4, 2, 16, 4421, 42719, 33, 4153, 7, 221, 3, 5761, 15, 7472, 3104, 541, 1507, 4938, 6, 4191];
+const astralIdentifierStartCodes = [0, 11, 2, 25, 2, 18, 2, 1, 2, 14, 3, 13, 35, 122, 70, 52, 268, 28, 4, 48, 48, 31, 14, 29, 6, 37, 11, 29, 3, 35, 5, 7, 2, 4, 43, 157, 19, 35, 5, 35, 5, 39, 9, 51, 13, 10, 2, 14, 2, 6, 2, 1, 2, 10, 2, 14, 2, 6, 2, 1, 68, 310, 10, 21, 11, 7, 25, 5, 2, 41, 2, 8, 70, 5, 3, 0, 2, 43, 2, 1, 4, 0, 3, 22, 11, 22, 10, 30, 66, 18, 2, 1, 11, 21, 11, 25, 71, 55, 7, 1, 65, 0, 16, 3, 2, 2, 2, 28, 43, 28, 4, 28, 36, 7, 2, 27, 28, 53, 11, 21, 11, 18, 14, 17, 111, 72, 56, 50, 14, 50, 14, 35, 349, 41, 7, 1, 79, 28, 11, 0, 9, 21, 43, 17, 47, 20, 28, 22, 13, 52, 58, 1, 3, 0, 14, 44, 33, 24, 27, 35, 30, 0, 3, 0, 9, 34, 4, 0, 13, 47, 15, 3, 22, 0, 2, 0, 36, 17, 2, 24, 20, 1, 64, 6, 2, 0, 2, 3, 2, 14, 2, 9, 8, 46, 39, 7, 3, 1, 3, 21, 2, 6, 2, 1, 2, 4, 4, 0, 19, 0, 13, 4, 159, 52, 19, 3, 21, 2, 31, 47, 21, 1, 2, 0, 185, 46, 42, 3, 37, 47, 21, 0, 60, 42, 14, 0, 72, 26, 38, 6, 186, 43, 117, 63, 32, 7, 3, 0, 3, 7, 2, 1, 2, 23, 16, 0, 2, 0, 95, 7, 3, 38, 17, 0, 2, 0, 29, 0, 11, 39, 8, 0, 22, 0, 12, 45, 20, 0, 19, 72, 264, 8, 2, 36, 18, 0, 50, 29, 113, 6, 2, 1, 2, 37, 22, 0, 26, 5, 2, 1, 2, 31, 15, 0, 328, 18, 16, 0, 2, 12, 2, 33, 125, 0, 80, 921, 103, 110, 18, 195, 2637, 96, 16, 1071, 18, 5, 4026, 582, 8634, 568, 8, 30, 18, 78, 18, 29, 19, 47, 17, 3, 32, 20, 6, 18, 689, 63, 129, 74, 6, 0, 67, 12, 65, 1, 2, 0, 29, 6135, 9, 1237, 43, 8, 8936, 3, 2, 6, 2, 1, 2, 290, 16, 0, 30, 2, 3, 0, 15, 3, 9, 395, 2309, 106, 6, 12, 4, 8, 8, 9, 5991, 84, 2, 70, 2, 1, 3, 0, 3, 1, 3, 3, 2, 11, 2, 0, 2, 6, 2, 64, 2, 3, 3, 7, 2, 6, 2, 27, 2, 3, 2, 4, 2, 0, 4, 6, 2, 339, 3, 24, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 30, 2, 24, 2, 7, 1845, 30, 7, 5, 262, 61, 147, 44, 11, 6, 17, 0, 322, 29, 19, 43, 485, 27, 757, 6, 2, 3, 2, 1, 2, 14, 2, 196, 60, 67, 8, 0, 1205, 3, 2, 26, 2, 1, 2, 0, 3, 0, 2, 9, 2, 3, 2, 0, 2, 0, 7, 0, 5, 0, 2, 0, 2, 0, 2, 2, 2, 1, 2, 0, 3, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 1, 2, 0, 3, 3, 2, 6, 2, 3, 2, 3, 2, 0, 2, 9, 2, 16, 6, 2, 2, 4, 2, 16, 4421, 42719, 33, 4153, 7, 221, 3, 5761, 15, 7472, 16, 621, 2467, 541, 1507, 4938, 6, 4191];
 const astralIdentifierCodes = [509, 0, 227, 0, 150, 4, 294, 9, 1368, 2, 2, 1, 6, 3, 41, 2, 5, 0, 166, 1, 574, 3, 9, 9, 370, 1, 81, 2, 71, 10, 50, 3, 123, 2, 54, 14, 32, 10, 3, 1, 11, 3, 46, 10, 8, 0, 46, 9, 7, 2, 37, 13, 2, 9, 6, 1, 45, 0, 13, 2, 49, 13, 9, 3, 2, 11, 83, 11, 7, 0, 3, 0, 158, 11, 6, 9, 7, 3, 56, 1, 2, 6, 3, 1, 3, 2, 10, 0, 11, 1, 3, 6, 4, 4, 193, 17, 10, 9, 5, 0, 82, 19, 13, 9, 214, 6, 3, 8, 28, 1, 83, 16, 16, 9, 82, 12, 9, 9, 84, 14, 5, 9, 243, 14, 166, 9, 71, 5, 2, 1, 3, 3, 2, 0, 2, 1, 13, 9, 120, 6, 3, 6, 4, 0, 29, 9, 41, 6, 2, 3, 9, 0, 10, 10, 47, 15, 406, 7, 2, 7, 17, 9, 57, 21, 2, 13, 123, 5, 4, 0, 2, 1, 2, 6, 2, 0, 9, 9, 49, 4, 2, 1, 2, 4, 9, 9, 330, 3, 10, 1, 2, 0, 49, 6, 4, 4, 14, 9, 5351, 0, 7, 14, 13835, 9, 87, 9, 39, 4, 60, 6, 26, 9, 1014, 0, 2, 54, 8, 3, 82, 0, 12, 1, 19628, 1, 4706, 45, 3, 22, 543, 4, 4, 5, 9, 7, 3, 6, 31, 3, 149, 2, 1418, 49, 513, 54, 5, 49, 9, 0, 15, 0, 23, 4, 2, 14, 1361, 6, 2, 16, 3, 6, 2, 1, 2, 4, 101, 0, 161, 6, 10, 9, 357, 0, 62, 13, 499, 13, 983, 6, 110, 6, 6, 9, 4759, 9, 787719, 239];
 function isInAstralSet(code, set) {
   let pos = 0x10000;
@@ -1832,7 +1853,7 @@ class State {
     this.comments = [];
     this.commentStack = [];
     this.pos = 0;
-    this.type = 137;
+    this.type = 139;
     this.value = null;
     this.start = 0;
     this.end = 0;
@@ -2320,7 +2341,7 @@ class Tokenizer extends CommentsParser {
     this.state.start = this.state.pos;
     if (!this.isLookahead) this.state.startLoc = this.state.curPosition();
     if (this.state.pos >= this.length) {
-      this.finishToken(137);
+      this.finishToken(139);
       return;
     }
     this.getTokenFromCode(this.codePointAtPos(this.state.pos));
@@ -2504,10 +2525,10 @@ class Tokenizer extends CommentsParser {
       }
     } else if (isIdentifierStart(next)) {
       ++this.state.pos;
-      this.finishToken(136, this.readWord1(next));
+      this.finishToken(138, this.readWord1(next));
     } else if (next === 92) {
       ++this.state.pos;
-      this.finishToken(136, this.readWord1());
+      this.finishToken(138, this.readWord1());
     } else {
       this.finishOp(27, 1);
     }
@@ -2940,7 +2961,7 @@ class Tokenizer extends CommentsParser {
       mods += char;
     }
     this.state.pos = pos;
-    this.finishToken(135, {
+    this.finishToken(137, {
       pattern: content,
       flags: mods
     });
@@ -2980,10 +3001,10 @@ class Tokenizer extends CommentsParser {
     }
     if (isBigInt) {
       const str = this.input.slice(startLoc.index, this.state.pos).replace(/[_n]/g, "");
-      this.finishToken(133, str);
+      this.finishToken(135, str);
       return;
     }
-    this.finishToken(132, val);
+    this.finishToken(134, val);
   }
   readNumber(startsWithDot) {
     const start = this.state.pos;
@@ -3061,15 +3082,15 @@ class Tokenizer extends CommentsParser {
     }
     const str = this.input.slice(start, this.state.pos).replace(/[_mn]/g, "");
     if (isBigInt) {
-      this.finishToken(133, str);
+      this.finishToken(135, str);
       return;
     }
     if (isDecimal) {
-      this.finishToken(134, str);
+      this.finishToken(136, str);
       return;
     }
     const val = isOctal ? parseInt(str, 8) : parseFloat(str);
-    this.finishToken(132, val);
+    this.finishToken(134, val);
   }
   readCodePoint(throwOnInvalid) {
     const {
@@ -3089,7 +3110,7 @@ class Tokenizer extends CommentsParser {
     this.state.pos = pos + 1;
     this.state.lineStart = lineStart;
     this.state.curLine = curLine;
-    this.finishToken(131, str);
+    this.finishToken(133, str);
   }
   readTemplateContinuation() {
     if (!this.match(8)) {
@@ -3179,7 +3200,7 @@ class Tokenizer extends CommentsParser {
     if (type !== undefined) {
       this.finishToken(type, tokenLabelName(type));
     } else {
-      this.finishToken(130, word);
+      this.finishToken(132, word);
     }
   }
   checkKeywordEscapes() {
@@ -3547,7 +3568,7 @@ class UtilParser extends Tokenizer {
     }
   }
   canInsertSemicolon() {
-    return this.match(137) || this.match(8) || this.hasPrecedingLineBreak();
+    return this.match(139) || this.match(8) || this.hasPrecedingLineBreak();
   }
   hasPrecedingLineBreak() {
     return lineBreak.test(this.input.slice(this.state.lastTokEndLoc.index, this.state.start));
@@ -3961,7 +3982,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     return !!this.getPluginOption("flow", "enums");
   }
   finishToken(type, val) {
-    if (type !== 131 && type !== 13 && type !== 28) {
+    if (type !== 133 && type !== 13 && type !== 28) {
       if (this.flowPragma === undefined) {
         this.flowPragma = null;
       }
@@ -3993,7 +4014,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     const node = this.startNode();
     const moduloLoc = this.state.startLoc;
     this.next();
-    this.expectContextual(108);
+    this.expectContextual(110);
     if (this.state.lastTokStart > moduloLoc.index + 1) {
       this.raise(FlowErrors.UnexpectedSpaceBetweenModuloChecks, {
         at: moduloLoc
@@ -4061,7 +4082,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
       return this.flowParseDeclareFunction(node);
     } else if (this.match(74)) {
       return this.flowParseDeclareVariable(node);
-    } else if (this.eatContextual(125)) {
+    } else if (this.eatContextual(127)) {
       if (this.match(16)) {
         return this.flowParseDeclareModuleExports(node);
       } else {
@@ -4072,11 +4093,11 @@ var flow = superClass => class FlowParserMixin extends superClass {
         }
         return this.flowParseDeclareModule(node);
       }
-    } else if (this.isContextual(128)) {
+    } else if (this.isContextual(130)) {
       return this.flowParseDeclareTypeAlias(node);
-    } else if (this.isContextual(129)) {
+    } else if (this.isContextual(131)) {
       return this.flowParseDeclareOpaqueType(node);
-    } else if (this.isContextual(127)) {
+    } else if (this.isContextual(129)) {
       return this.flowParseDeclareInterface(node);
     } else if (this.match(82)) {
       return this.flowParseDeclareExportDeclaration(node, insideModule);
@@ -4093,7 +4114,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
   }
   flowParseDeclareModule(node) {
     this.scope.enter(0);
-    if (this.match(131)) {
+    if (this.match(133)) {
       node.id = super.parseExprAtom();
     } else {
       node.id = this.parseIdentifier();
@@ -4105,14 +4126,14 @@ var flow = superClass => class FlowParserMixin extends superClass {
       let bodyNode = this.startNode();
       if (this.match(83)) {
         this.next();
-        if (!this.isContextual(128) && !this.match(87)) {
+        if (!this.isContextual(130) && !this.match(87)) {
           this.raise(FlowErrors.InvalidNonTypeImportInDeclareModule, {
             at: this.state.lastTokStartLoc
           });
         }
         super.parseImport(bodyNode);
       } else {
-        this.expectContextual(123, FlowErrors.UnsupportedStatementInDeclareModule);
+        this.expectContextual(125, FlowErrors.UnsupportedStatementInDeclareModule);
         bodyNode = this.flowParseDeclare(bodyNode, true);
       }
       body.push(bodyNode);
@@ -4160,7 +4181,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
       node.default = true;
       return this.finishNode(node, "DeclareExportDeclaration");
     } else {
-      if (this.match(75) || this.isLet() || (this.isContextual(128) || this.isContextual(127)) && !insideModule) {
+      if (this.match(75) || this.isLet() || (this.isContextual(130) || this.isContextual(129)) && !insideModule) {
         const label = this.state.value;
         throw this.raise(FlowErrors.UnsupportedDeclareExportKind, {
           at: this.state.startLoc,
@@ -4168,11 +4189,11 @@ var flow = superClass => class FlowParserMixin extends superClass {
           suggestion: exportSuggestions[label]
         });
       }
-      if (this.match(74) || this.match(68) || this.match(80) || this.isContextual(129)) {
+      if (this.match(74) || this.match(68) || this.match(80) || this.isContextual(131)) {
         node.declaration = this.flowParseDeclare(this.startNode());
         node.default = false;
         return this.finishNode(node, "DeclareExportDeclaration");
-      } else if (this.match(55) || this.match(5) || this.isContextual(127) || this.isContextual(128) || this.isContextual(129)) {
+      } else if (this.match(55) || this.match(5) || this.isContextual(129) || this.isContextual(130) || this.isContextual(131)) {
         node = this.parseExport(node, null);
         if (node.type === "ExportNamedDeclaration") {
           node.type = "ExportDeclaration";
@@ -4187,7 +4208,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
   }
   flowParseDeclareModuleExports(node) {
     this.next();
-    this.expectContextual(109);
+    this.expectContextual(111);
     node.typeAnnotation = this.flowParseTypeAnnotation();
     this.semicolon();
     return this.finishNode(node, "DeclareModuleExports");
@@ -4226,12 +4247,12 @@ var flow = superClass => class FlowParserMixin extends superClass {
     if (isClass) {
       node.implements = [];
       node.mixins = [];
-      if (this.eatContextual(115)) {
+      if (this.eatContextual(117)) {
         do {
           node.mixins.push(this.flowParseInterfaceExtends());
         } while (this.eat(12));
       }
-      if (this.eatContextual(111)) {
+      if (this.eatContextual(113)) {
         do {
           node.implements.push(this.flowParseInterfaceExtends());
         } while (this.eat(12));
@@ -4290,7 +4311,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     return this.finishNode(node, "TypeAlias");
   }
   flowParseOpaqueType(node, declare) {
-    this.expectContextual(128);
+    this.expectContextual(130);
     node.id = this.flowParseRestrictedIdentifier(true, true);
     this.scope.declareName(node.id.name, 8201, node.id.loc.start);
     if (this.match(47)) {
@@ -4334,7 +4355,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     const node = this.startNode();
     node.params = [];
     this.state.inType = true;
-    if (this.match(47) || this.match(140)) {
+    if (this.match(47) || this.match(142)) {
       this.next();
     } else {
       this.unexpected();
@@ -4391,7 +4412,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
   }
   flowParseInterfaceType() {
     const node = this.startNode();
-    this.expectContextual(127);
+    this.expectContextual(129);
     node.extends = [];
     if (this.eat(81)) {
       do {
@@ -4408,7 +4429,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     return this.finishNode(node, "InterfaceTypeAnnotation");
   }
   flowParseObjectPropertyKey() {
-    return this.match(132) || this.match(131) ? super.parseExprAtom() : this.parseIdentifier(true);
+    return this.match(134) || this.match(133) ? super.parseExprAtom() : this.parseIdentifier(true);
   }
   flowParseObjectTypeIndexer(node, isStatic, variance) {
     node.static = isStatic;
@@ -4509,7 +4530,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
       let protoStartLoc = null;
       let inexactStartLoc = null;
       const node = this.startNode();
-      if (allowProto && this.isContextual(116)) {
+      if (allowProto && this.isContextual(118)) {
         const lookahead = this.lookahead();
         if (lookahead.type !== 14 && lookahead.type !== 17) {
           this.next();
@@ -4517,7 +4538,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
           allowStatic = false;
         }
       }
-      if (allowStatic && this.isContextual(104)) {
+      if (allowStatic && this.isContextual(106)) {
         const lookahead = this.lookahead();
         if (lookahead.type !== 14 && lookahead.type !== 17) {
           this.next();
@@ -4547,7 +4568,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
         nodeStart.callProperties.push(this.flowParseObjectTypeCallProperty(node, isStatic));
       } else {
         let kind = "init";
-        if (this.isContextual(98) || this.isContextual(103)) {
+        if (this.isContextual(99) || this.isContextual(104)) {
           const lookahead = this.lookahead();
           if (tokenIsLiteralPropertyName(lookahead.type)) {
             kind = this.state.value;
@@ -4870,7 +4891,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
         node.returnType = this.flowParseType();
         node.typeParameters = null;
         return this.finishNode(node, "FunctionTypeAnnotation");
-      case 131:
+      case 133:
         return this.parseLiteral(this.state.value, "StringLiteralTypeAnnotation");
       case 85:
       case 86:
@@ -4880,10 +4901,10 @@ var flow = superClass => class FlowParserMixin extends superClass {
       case 53:
         if (this.state.value === "-") {
           this.next();
-          if (this.match(132)) {
+          if (this.match(134)) {
             return this.parseLiteralAtNode(-this.state.value, "NumberLiteralTypeAnnotation", node);
           }
-          if (this.match(133)) {
+          if (this.match(135)) {
             return this.parseLiteralAtNode(-this.state.value, "BigIntLiteralTypeAnnotation", node);
           }
           throw this.raise(FlowErrors.UnexpectedSubtractionOperand, {
@@ -4892,9 +4913,9 @@ var flow = superClass => class FlowParserMixin extends superClass {
         }
         this.unexpected();
         return;
-      case 132:
+      case 134:
         return this.parseLiteral(this.state.value, "NumberLiteralTypeAnnotation");
-      case 133:
+      case 135:
         return this.parseLiteral(this.state.value, "BigIntLiteralTypeAnnotation");
       case 88:
         this.next();
@@ -4916,7 +4937,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
           this.next();
           return super.createIdentifier(node, label);
         } else if (tokenIsIdentifier(this.state.type)) {
-          if (this.isContextual(127)) {
+          if (this.isContextual(129)) {
             return this.flowParseInterfaceType();
           }
           return this.flowIdentToTypeAnnotation(startLoc, node, this.parseIdentifier());
@@ -5001,7 +5022,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     return type;
   }
   flowParseTypeOrImplicitInstantiation() {
-    if (this.state.type === 130 && this.state.value === "_") {
+    if (this.state.type === 132 && this.state.value === "_") {
       const startLoc = this.state.startLoc;
       const node = this.parseIdentifier();
       return this.flowParseGenericType(startLoc, node);
@@ -5057,14 +5078,14 @@ var flow = superClass => class FlowParserMixin extends superClass {
     return super.parseFunctionBodyAndFinish(node, type, isMethod);
   }
   parseStatementLike(flags) {
-    if (this.state.strict && this.isContextual(127)) {
+    if (this.state.strict && this.isContextual(129)) {
       const lookahead = this.lookahead();
       if (tokenIsKeywordOrIdentifier(lookahead.type)) {
         const node = this.startNode();
         this.next();
         return this.flowParseInterface(node);
       }
-    } else if (this.shouldParseEnums() && this.isContextual(124)) {
+    } else if (this.shouldParseEnums() && this.isContextual(126)) {
       const node = this.startNode();
       this.next();
       return this.flowParseEnumDeclaration(node);
@@ -5097,7 +5118,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     const {
       type
     } = this.state;
-    if (tokenIsFlowInterfaceOrTypeOrOpaque(type) || this.shouldParseEnums() && type === 124) {
+    if (tokenIsFlowInterfaceOrTypeOrOpaque(type) || this.shouldParseEnums() && type === 126) {
       return !this.state.containsEsc;
     }
     return super.shouldParseExportDeclaration();
@@ -5106,13 +5127,13 @@ var flow = superClass => class FlowParserMixin extends superClass {
     const {
       type
     } = this.state;
-    if (tokenIsFlowInterfaceOrTypeOrOpaque(type) || this.shouldParseEnums() && type === 124) {
+    if (tokenIsFlowInterfaceOrTypeOrOpaque(type) || this.shouldParseEnums() && type === 126) {
       return this.state.containsEsc;
     }
     return super.isExportDefaultSpecifier();
   }
   parseExportDefaultExpression() {
-    if (this.shouldParseEnums() && this.isContextual(124)) {
+    if (this.shouldParseEnums() && this.isContextual(126)) {
       const node = this.startNode();
       this.next();
       return this.flowParseEnumDeclaration(node);
@@ -5246,7 +5267,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     super.assertModuleNodeAllowed(node);
   }
   parseExportDeclaration(node) {
-    if (this.isContextual(128)) {
+    if (this.isContextual(130)) {
       node.exportKind = "type";
       const declarationNode = this.startNode();
       this.next();
@@ -5257,17 +5278,17 @@ var flow = superClass => class FlowParserMixin extends superClass {
       } else {
         return this.flowParseTypeAlias(declarationNode);
       }
-    } else if (this.isContextual(129)) {
+    } else if (this.isContextual(131)) {
       node.exportKind = "type";
       const declarationNode = this.startNode();
       this.next();
       return this.flowParseOpaqueType(declarationNode, false);
-    } else if (this.isContextual(127)) {
+    } else if (this.isContextual(129)) {
       node.exportKind = "type";
       const declarationNode = this.startNode();
       this.next();
       return this.flowParseInterface(declarationNode);
-    } else if (this.shouldParseEnums() && this.isContextual(124)) {
+    } else if (this.shouldParseEnums() && this.isContextual(126)) {
       node.exportKind = "value";
       const declarationNode = this.startNode();
       this.next();
@@ -5278,7 +5299,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
   }
   eatExportStar(node) {
     if (super.eatExportStar(node)) return true;
-    if (this.isContextual(128) && this.lookahead().type === 55) {
+    if (this.isContextual(130) && this.lookahead().type === 55) {
       node.exportKind = "type";
       this.next();
       this.next();
@@ -5306,7 +5327,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     const {
       startLoc
     } = this.state;
-    if (this.isContextual(123)) {
+    if (this.isContextual(125)) {
       if (super.parseClassMemberFromModifier(classBody, member)) {
         return;
       }
@@ -5337,7 +5358,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
         identifierName: fullWord
       });
     }
-    this.finishToken(130, fullWord);
+    this.finishToken(132, fullWord);
   }
   getTokenFromCode(code) {
     const next = this.input.charCodeAt(this.state.pos + 1);
@@ -5463,7 +5484,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     if (node.superClass && this.match(47)) {
       node.superTypeParameters = this.flowParseTypeParameterInstantiation();
     }
-    if (this.isContextual(111)) {
+    if (this.isContextual(113)) {
       this.next();
       const implemented = node.implements = [];
       do {
@@ -5565,7 +5586,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
   }
   isPotentialImportPhase(isExport) {
     if (super.isPotentialImportPhase(isExport)) return true;
-    if (this.isContextual(128)) {
+    if (this.isContextual(130)) {
       if (!isExport) return true;
       const ch = this.lookaheadCharCode();
       return ch === 123 || ch === 42;
@@ -5679,7 +5700,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     var _jsx;
     let state = null;
     let jsx;
-    if (this.hasPlugin("jsx") && (this.match(140) || this.match(47))) {
+    if (this.hasPlugin("jsx") && (this.match(142) || this.match(47))) {
       state = this.state.clone();
       jsx = this.tryParse(() => super.parseMaybeAssign(refExpressionErrors, afterLeftParse), state);
       if (!jsx.error) return jsx.node;
@@ -5965,7 +5986,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
     const startLoc = this.state.startLoc;
     const endOfInit = () => this.match(12) || this.match(8);
     switch (this.state.type) {
-      case 132:
+      case 134:
         {
           const literal = this.parseNumericLiteral(this.state.value);
           if (endOfInit()) {
@@ -5980,7 +6001,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
             loc: startLoc
           };
         }
-      case 131:
+      case 133:
         {
           const literal = this.parseStringLiteral(this.state.value);
           if (endOfInit()) {
@@ -6164,7 +6185,7 @@ var flow = superClass => class FlowParserMixin extends superClass {
   flowEnumParseExplicitType({
     enumName
   }) {
-    if (!this.eatContextual(101)) return null;
+    if (!this.eatContextual(102)) return null;
     if (!tokenIsIdentifier(this.state.type)) {
       throw this.raise(FlowErrors.EnumInvalidExplicitTypeUnknownSupplied, {
         at: this.state.startLoc,
@@ -6592,14 +6613,14 @@ var jsx = superClass => class JSXParserMixin extends superClass {
           if (this.state.pos === this.state.start) {
             if (ch === 60 && this.state.canStartJSXElement) {
               ++this.state.pos;
-              this.finishToken(140);
+              this.finishToken(142);
             } else {
               super.getTokenFromCode(ch);
             }
             return;
           }
           out += this.input.slice(chunkStart, this.state.pos);
-          this.finishToken(139, out);
+          this.finishToken(141, out);
           return;
         case 38:
           out += this.input.slice(chunkStart, this.state.pos);
@@ -6657,7 +6678,7 @@ var jsx = superClass => class JSXParserMixin extends superClass {
       }
     }
     out += this.input.slice(chunkStart, this.state.pos++);
-    this.finishToken(131, out);
+    this.finishToken(133, out);
   }
   jsxReadEntity() {
     const startPos = ++this.state.pos;
@@ -6697,11 +6718,11 @@ var jsx = superClass => class JSXParserMixin extends superClass {
     do {
       ch = this.input.charCodeAt(++this.state.pos);
     } while (isIdentifierChar(ch) || ch === 45);
-    this.finishToken(138, this.input.slice(start, this.state.pos));
+    this.finishToken(140, this.input.slice(start, this.state.pos));
   }
   jsxParseIdentifier() {
     const node = this.startNode();
-    if (this.match(138)) {
+    if (this.match(140)) {
       node.name = this.state.value;
     } else if (tokenIsKeyword(this.state.type)) {
       node.name = tokenLabelName(this.state.type);
@@ -6748,8 +6769,8 @@ var jsx = superClass => class JSXParserMixin extends superClass {
           });
         }
         return node;
-      case 140:
-      case 131:
+      case 142:
+      case 133:
         return this.parseExprAtom();
       default:
         throw this.raise(JsxErrors.UnsupportedJsxValue, {
@@ -6799,7 +6820,7 @@ var jsx = superClass => class JSXParserMixin extends superClass {
   }
   jsxParseOpeningElementAt(startLoc) {
     const node = this.startNodeAt(startLoc);
-    if (this.eat(141)) {
+    if (this.eat(143)) {
       return this.finishNode(node, "JSXOpeningFragment");
     }
     node.name = this.jsxParseElementName();
@@ -6807,21 +6828,21 @@ var jsx = superClass => class JSXParserMixin extends superClass {
   }
   jsxParseOpeningElementAfterName(node) {
     const attributes = [];
-    while (!this.match(56) && !this.match(141)) {
+    while (!this.match(56) && !this.match(143)) {
       attributes.push(this.jsxParseAttribute());
     }
     node.attributes = attributes;
     node.selfClosing = this.eat(56);
-    this.expect(141);
+    this.expect(143);
     return this.finishNode(node, "JSXOpeningElement");
   }
   jsxParseClosingElementAt(startLoc) {
     const node = this.startNodeAt(startLoc);
-    if (this.eat(141)) {
+    if (this.eat(143)) {
       return this.finishNode(node, "JSXClosingFragment");
     }
     node.name = this.jsxParseElementName();
-    this.expect(141);
+    this.expect(143);
     return this.finishNode(node, "JSXClosingElement");
   }
   jsxParseElementAt(startLoc) {
@@ -6832,7 +6853,7 @@ var jsx = superClass => class JSXParserMixin extends superClass {
     if (!openingElement.selfClosing) {
       contents: for (;;) {
         switch (this.state.type) {
-          case 140:
+          case 142:
             startLoc = this.state.startLoc;
             this.next();
             if (this.eat(56)) {
@@ -6841,7 +6862,7 @@ var jsx = superClass => class JSXParserMixin extends superClass {
             }
             children.push(this.jsxParseElementAt(startLoc));
             break;
-          case 139:
+          case 141:
             children.push(this.parseExprAtom());
             break;
           case 5:
@@ -6905,12 +6926,12 @@ var jsx = superClass => class JSXParserMixin extends superClass {
     context[context.length - 1] = newContext;
   }
   parseExprAtom(refExpressionErrors) {
-    if (this.match(139)) {
+    if (this.match(141)) {
       return this.parseLiteral(this.state.value, "JSXText");
-    } else if (this.match(140)) {
+    } else if (this.match(142)) {
       return this.jsxParseElement();
     } else if (this.match(47) && this.input.charCodeAt(this.state.pos) !== 33) {
-      this.replaceToken(140);
+      this.replaceToken(142);
       return this.jsxParseElement();
     } else {
       return super.parseExprAtom(refExpressionErrors);
@@ -6933,7 +6954,7 @@ var jsx = superClass => class JSXParserMixin extends superClass {
       }
       if (code === 62) {
         ++this.state.pos;
-        this.finishToken(141);
+        this.finishToken(143);
         return;
       }
       if ((code === 34 || code === 39) && context === types.j_oTag) {
@@ -6943,7 +6964,7 @@ var jsx = superClass => class JSXParserMixin extends superClass {
     }
     if (code === 60 && this.state.canStartJSXElement && this.input.charCodeAt(this.state.pos + 1) !== 33) {
       ++this.state.pos;
-      this.finishToken(140);
+      this.finishToken(142);
       return;
     }
     super.getTokenFromCode(code);
@@ -6953,12 +6974,12 @@ var jsx = superClass => class JSXParserMixin extends superClass {
       context,
       type
     } = this.state;
-    if (type === 56 && prevType === 140) {
+    if (type === 56 && prevType === 142) {
       context.splice(-2, 2, types.j_cTag);
       this.state.canStartJSXElement = false;
-    } else if (type === 140) {
+    } else if (type === 142) {
       context.push(types.j_oTag);
-    } else if (type === 141) {
+    } else if (type === 143) {
       const out = context[context.length - 1];
       if (out === types.j_oTag && prevType === 56 || out === types.j_cTag) {
         context.pop();
@@ -7096,7 +7117,7 @@ class LValParser extends NodeUtils {
           this.expressionScope.recordArrowParameterBindingError(Errors.InvalidParenthesizedAssignment, {
             at: node
           });
-        } else if (parenthesized.type !== "MemberExpression") {
+        } else if (parenthesized.type !== "MemberExpression" && !this.isOptionalMemberExpression(parenthesized)) {
           this.raise(Errors.InvalidParenthesizedAssignment, {
             at: node
           });
@@ -7326,7 +7347,7 @@ class LValParser extends NodeUtils {
     } = this.state;
     if (type === 21) {
       return this.parseBindingRestProperty(prop);
-    } else if (type === 136) {
+    } else if (type === 138) {
       this.expectPlugin("destructuringPrivate", startLoc);
       this.classScope.usePrivateName(this.state.value, startLoc);
       prop.key = this.parsePrivateName();
@@ -7368,6 +7389,9 @@ class LValParser extends NodeUtils {
       ObjectPattern: "properties"
     }, type);
   }
+  isOptionalMemberExpression(expression) {
+    return expression.type === "OptionalMemberExpression";
+  }
   checkLVal(expression, {
     in: ancestor,
     binding = 64,
@@ -7378,7 +7402,17 @@ class LValParser extends NodeUtils {
     var _expression$extra;
     const type = expression.type;
     if (this.isObjectMethod(expression)) return;
-    if (type === "MemberExpression") {
+    const isOptionalMemberExpression = this.isOptionalMemberExpression(expression);
+    if (isOptionalMemberExpression || type === "MemberExpression") {
+      if (isOptionalMemberExpression) {
+        this.expectPlugin("optionalChainingAssign", expression.loc.start);
+        if (ancestor.type !== "AssignmentExpression") {
+          this.raise(Errors.InvalidLhsOptionalChaining, {
+            at: expression,
+            ancestor
+          });
+        }
+      }
       if (binding !== 64) {
         this.raise(Errors.InvalidPropertyBindingPattern, {
           at: expression
@@ -7413,7 +7447,7 @@ class LValParser extends NodeUtils {
       return;
     }
     const [key, isParenthesizedExpression] = Array.isArray(validity) ? validity : [validity, type === "ParenthesizedExpression"];
-    const nextAncestor = type === "ArrayPattern" || type === "ObjectPattern" || type === "ParenthesizedExpression" ? {
+    const nextAncestor = type === "ArrayPattern" || type === "ObjectPattern" ? {
       type
     } : ancestor;
     for (const child of [].concat(expression[key])) {
@@ -7552,7 +7586,6 @@ const TSErrors = ParseErrorEnum`typescript`({
   InvalidPropertyAccessAfterInstantiationExpression: "Invalid property access after an instantiation expression. " + "You can either wrap the instantiation expression in parentheses, or delete the type arguments.",
   InvalidTupleMemberLabel: "Tuple members must be labeled with a simple identifier.",
   MissingInterfaceName: "'interface' declarations must be followed by an identifier.",
-  MixedLabeledAndUnlabeledElements: "Tuple members must all have names or all not have names.",
   NonAbstractClassHasAbstractMethod: "Abstract methods can only appear within an abstract class.",
   NonClassMethodPropertyHasAbstractModifer: "'abstract' modifier can only appear on a class, method, or property declaration.",
   OptionalTypeBeforeRequired: "A required element cannot follow an optional element.",
@@ -7645,7 +7678,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     return tokenIsIdentifier(this.state.type);
   }
   tsTokenCanFollowModifier() {
-    return (this.match(0) || this.match(5) || this.match(55) || this.match(21) || this.match(136) || this.isLiteralPropertyName()) && !this.hasPrecedingLineBreak();
+    return (this.match(0) || this.match(5) || this.match(55) || this.match(21) || this.match(138) || this.isLiteralPropertyName()) && !this.hasPrecedingLineBreak();
   }
   tsNextTokenCanFollowModifier() {
     this.next();
@@ -7812,7 +7845,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     const node = this.startNode();
     this.expect(83);
     this.expect(10);
-    if (!this.match(131)) {
+    if (!this.match(133)) {
       this.raise(TSErrors.UnsupportedImportTypeArgument, {
         at: this.state.startLoc
       });
@@ -7886,7 +7919,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   tsParseTypeParameters(parseModifiers) {
     const node = this.startNode();
-    if (this.match(47) || this.match(140)) {
+    if (this.match(47) || this.match(142)) {
       this.next();
     } else {
       this.unexpected();
@@ -8081,9 +8114,9 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   tsIsStartOfMappedType() {
     this.next();
     if (this.eat(53)) {
-      return this.isContextual(120);
+      return this.isContextual(122);
     }
-    if (this.isContextual(120)) {
+    if (this.isContextual(122)) {
       this.next();
     }
     if (!this.match(0)) {
@@ -8108,8 +8141,8 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     if (this.match(53)) {
       node.readonly = this.state.value;
       this.next();
-      this.expectContextual(120);
-    } else if (this.eatContextual(120)) {
+      this.expectContextual(122);
+    } else if (this.eatContextual(122)) {
       node.readonly = true;
     }
     this.expect(0);
@@ -8132,9 +8165,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     const node = this.startNode();
     node.elementTypes = this.tsParseBracketedList("TupleElementTypes", this.tsParseTupleElementType.bind(this), true, false);
     let seenOptionalElement = false;
-    let labeledElements = null;
     node.elementTypes.forEach(elementNode => {
-      var _labeledElements;
       const {
         type
       } = elementNode;
@@ -8144,18 +8175,6 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
         });
       }
       seenOptionalElement || (seenOptionalElement = type === "TSNamedTupleMember" && elementNode.optional || type === "TSOptionalType");
-      let checkType = type;
-      if (type === "TSRestType") {
-        elementNode = elementNode.typeAnnotation;
-        checkType = elementNode.type;
-      }
-      const isLabeled = checkType === "TSNamedTupleMember";
-      (_labeledElements = labeledElements) != null ? _labeledElements : labeledElements = isLabeled;
-      if (labeledElements !== isLabeled) {
-        this.raise(TSErrors.MixedLabeledAndUnlabeledElements, {
-          at: elementNode
-        });
-      }
     });
     return this.finishNode(node, "TSTupleType");
   }
@@ -8252,9 +8271,9 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   tsParseLiteralTypeNode() {
     const node = this.startNode();
     switch (this.state.type) {
-      case 132:
+      case 134:
+      case 135:
       case 133:
-      case 131:
       case 85:
       case 86:
         node.literal = super.parseExprAtom();
@@ -8275,7 +8294,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   tsParseThisTypeOrThisTypePredicate() {
     const thisKeyword = this.tsParseThisTypeNode();
-    if (this.isContextual(114) && !this.hasPrecedingLineBreak()) {
+    if (this.isContextual(116) && !this.hasPrecedingLineBreak()) {
       return this.tsParseThisTypePredicate(thisKeyword);
     } else {
       return thisKeyword;
@@ -8283,9 +8302,9 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   tsParseNonArrayType() {
     switch (this.state.type) {
-      case 131:
-      case 132:
       case 133:
+      case 134:
+      case 135:
       case 85:
       case 86:
         return this.tsParseLiteralTypeNode();
@@ -8293,7 +8312,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
         if (this.state.value === "-") {
           const node = this.startNode();
           const nextToken = this.lookahead();
-          if (nextToken.type !== 132 && nextToken.type !== 133) {
+          if (nextToken.type !== 134 && nextToken.type !== 135) {
             this.unexpected();
           }
           node.literal = this.parseMaybeUnary();
@@ -8375,7 +8394,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   tsParseInferType() {
     const node = this.startNode();
-    this.expectContextual(113);
+    this.expectContextual(115);
     const typeParameter = this.startNode();
     typeParameter.name = this.tsParseTypeParameterName();
     typeParameter.constraint = this.tsTryParse(() => this.tsParseConstraintForInferType());
@@ -8392,7 +8411,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   tsParseTypeOperatorOrHigher() {
     const isTypeOperator = tokenIsTSTypeOperator(this.state.type) && !this.state.containsEsc;
-    return isTypeOperator ? this.tsParseTypeOperator() : this.isContextual(113) ? this.tsParseInferType() : this.tsInAllowConditionalTypesContext(() => this.tsParseArrayTypeOrHigher());
+    return isTypeOperator ? this.tsParseTypeOperator() : this.isContextual(115) ? this.tsParseInferType() : this.tsInAllowConditionalTypesContext(() => this.tsParseArrayTypeOrHigher());
   }
   tsParseUnionOrIntersectionType(kind, parseConstituentType, operator) {
     const node = this.startNode();
@@ -8523,13 +8542,13 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   tsParseTypePredicatePrefix() {
     const id = this.parseIdentifier();
-    if (this.isContextual(114) && !this.hasPrecedingLineBreak()) {
+    if (this.isContextual(116) && !this.hasPrecedingLineBreak()) {
       this.next();
       return id;
     }
   }
   tsParseTypePredicateAsserts() {
-    if (this.state.type !== 107) {
+    if (this.state.type !== 109) {
       return false;
     }
     const containsEsc = this.state.containsEsc;
@@ -8568,7 +8587,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     return this.finishNode(node, "TSConditionalType");
   }
   isAbstractConstructorSignature() {
-    return this.isContextual(122) && this.lookahead().type === 77;
+    return this.isContextual(124) && this.lookahead().type === 77;
   }
   tsParseNonConditionalType() {
     if (this.tsIsStartOfFunctionType()) {
@@ -8616,7 +8635,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   tsParseInterfaceDeclaration(node, properties = {}) {
     if (this.hasFollowingLineBreak()) return null;
-    this.expectContextual(127);
+    this.expectContextual(129);
     if (properties.declare) node.declare = true;
     if (tokenIsIdentifier(this.state.type)) {
       node.id = this.parseIdentifier();
@@ -8642,7 +8661,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     node.typeAnnotation = this.tsInType(() => {
       node.typeParameters = this.tsTryParseTypeParameters(this.tsParseInOutModifiers);
       this.expect(29);
-      if (this.isContextual(112) && this.lookahead().type !== 16) {
+      if (this.isContextual(114) && this.lookahead().type !== 16) {
         const node = this.startNode();
         this.next();
         return this.finishNode(node, "TSIntrinsicKeyword");
@@ -8707,7 +8726,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   tsParseEnumMember() {
     const node = this.startNode();
-    node.id = this.match(131) ? super.parseStringLiteral(this.state.value) : this.parseIdentifier(true);
+    node.id = this.match(133) ? super.parseStringLiteral(this.state.value) : this.parseIdentifier(true);
     if (this.eat(29)) {
       node.initializer = super.parseMaybeAssignAllowIn();
     }
@@ -8716,7 +8735,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   tsParseEnumDeclaration(node, properties = {}) {
     if (properties.const) node.const = true;
     if (properties.declare) node.declare = true;
-    this.expectContextual(124);
+    this.expectContextual(126);
     node.id = this.parseIdentifier();
     this.checkIdentifier(node.id, node.const ? 8971 : 8459);
     this.expect(5);
@@ -8751,10 +8770,10 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     return this.finishNode(node, "TSModuleDeclaration");
   }
   tsParseAmbientExternalModuleDeclaration(node) {
-    if (this.isContextual(110)) {
+    if (this.isContextual(112)) {
       node.global = true;
       node.id = this.parseIdentifier();
-    } else if (this.match(131)) {
+    } else if (this.match(133)) {
       node.id = super.parseStringLiteral(this.state.value);
     } else {
       this.unexpected();
@@ -8786,16 +8805,16 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     return this.finishNode(node, "TSImportEqualsDeclaration");
   }
   tsIsExternalModuleReference() {
-    return this.isContextual(117) && this.lookaheadCharCode() === 40;
+    return this.isContextual(119) && this.lookaheadCharCode() === 40;
   }
   tsParseModuleReference() {
     return this.tsIsExternalModuleReference() ? this.tsParseExternalModuleReference() : this.tsParseEntityName(false);
   }
   tsParseExternalModuleReference() {
     const node = this.startNode();
-    this.expectContextual(117);
+    this.expectContextual(119);
     this.expect(10);
-    if (!this.match(131)) {
+    if (!this.match(133)) {
       this.unexpected();
     }
     node.expression = super.parseExprAtom();
@@ -8829,7 +8848,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     }
     let startType = this.state.type;
     let kind;
-    if (this.isContextual(99)) {
+    if (this.isContextual(100)) {
       startType = 74;
       kind = "let";
     }
@@ -8841,11 +8860,11 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
         case 80:
           nany.declare = true;
           return this.parseClass(nany, true, false);
-        case 124:
+        case 126:
           return this.tsParseEnumDeclaration(nany, {
             declare: true
           });
-        case 110:
+        case 112:
           return this.tsParseAmbientExternalModuleDeclaration(nany);
         case 75:
         case 74:
@@ -8858,7 +8877,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
             const: true,
             declare: true
           });
-        case 127:
+        case 129:
           {
             const result = this.tsParseInterfaceDeclaration(nany, {
               declare: true
@@ -8911,7 +8930,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
         break;
       case "module":
         if (this.tsCheckLineTerminator(next)) {
-          if (this.match(131)) {
+          if (this.match(133)) {
             return this.tsParseAmbientExternalModuleDeclaration(node);
           } else if (tokenIsIdentifier(this.state.type)) {
             return this.tsParseModuleOrNamespaceDeclaration(node);
@@ -9165,7 +9184,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   }
   parseExprOp(left, leftStartLoc, minPrec) {
     let isSatisfies;
-    if (tokenOperatorPrecedence(58) > minPrec && !this.hasPrecedingLineBreak() && (this.isContextual(93) || (isSatisfies = this.isContextual(118)))) {
+    if (tokenOperatorPrecedence(58) > minPrec && !this.hasPrecedingLineBreak() && (this.isContextual(93) || (isSatisfies = this.isContextual(120)))) {
       const node = this.startNodeAt(leftStartLoc);
       node.expression = left;
       node.typeAnnotation = this.tsInType(() => {
@@ -9203,7 +9222,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
   checkDuplicateExports() {}
   isPotentialImportPhase(isExport) {
     if (super.isPotentialImportPhase(isExport)) return true;
-    if (this.isContextual(128)) {
+    if (this.isContextual(130)) {
       const ch = this.lookaheadCharCode();
       return isExport ? ch === 123 || ch === 42 : ch !== 61;
     }
@@ -9218,7 +9237,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     }
   }
   parseImport(node) {
-    if (this.match(131)) {
+    if (this.match(133)) {
       node.importKind = "value";
       return super.parseImport(node);
     }
@@ -9226,7 +9245,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     if (tokenIsIdentifier(this.state.type) && this.lookaheadCharCode() === 61) {
       node.importKind = "value";
       return this.tsParseImportEqualsDeclaration(node);
-    } else if (this.isContextual(128)) {
+    } else if (this.isContextual(130)) {
       const maybeDefaultIdentifier = this.parseMaybeImportPhase(node, false);
       if (this.lookaheadCharCode() === 61) {
         return this.tsParseImportEqualsDeclaration(node, maybeDefaultIdentifier);
@@ -9247,7 +9266,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     if (this.match(83)) {
       this.next();
       let maybeDefaultIdentifier = null;
-      if (this.isContextual(128) && this.isPotentialImportPhase(false)) {
+      if (this.isContextual(130) && this.isPotentialImportPhase(false)) {
         maybeDefaultIdentifier = this.parseMaybeImportPhase(node, false);
       } else {
         node.importKind = "value";
@@ -9261,7 +9280,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
       return this.finishNode(assign, "TSExportAssignment");
     } else if (this.eatContextual(93)) {
       const decl = node;
-      this.expectContextual(126);
+      this.expectContextual(128);
       decl.id = this.parseIdentifier();
       this.semicolon();
       return this.finishNode(decl, "TSNamespaceExportDeclaration");
@@ -9270,7 +9289,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     }
   }
   isAbstractClass() {
-    return this.isContextual(122) && this.lookahead().type === 80;
+    return this.isContextual(124) && this.lookahead().type === 80;
   }
   parseExportDefaultExpression() {
     if (this.isAbstractClass()) {
@@ -9279,7 +9298,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
       cls.abstract = true;
       return this.parseClass(cls, true, true);
     }
-    if (this.match(127)) {
+    if (this.match(129)) {
       const result = this.tsParseInterfaceDeclaration(this.startNode());
       if (result) return result;
     }
@@ -9316,10 +9335,10 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
         const: true
       });
     }
-    if (this.isContextual(124)) {
+    if (this.isContextual(126)) {
       return this.tsParseEnumDeclaration(this.startNode());
     }
-    if (this.isContextual(127)) {
+    if (this.isContextual(129)) {
       const result = this.tsParseInterfaceDeclaration(this.startNode());
       if (result) return result;
     }
@@ -9337,7 +9356,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     });
   }
   tsIsStartOfStaticBlocks() {
-    return this.isContextual(104) && this.lookaheadCharCode() === 123;
+    return this.isContextual(106) && this.lookaheadCharCode() === 123;
   }
   parseClassMember(classBody, member, state) {
     const modifiers = ["declare", "private", "public", "protected", "override", "abstract", "readonly", "static"];
@@ -9459,12 +9478,12 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     return node;
   }
   parseExportDeclaration(node) {
-    if (!this.state.isAmbientContext && this.isContextual(123)) {
+    if (!this.state.isAmbientContext && this.isContextual(125)) {
       return this.tsInAmbientContext(() => this.parseExportDeclaration(node));
     }
     const startLoc = this.state.startLoc;
-    const isDeclare = this.eatContextual(123);
-    if (isDeclare && (this.isContextual(123) || !this.shouldParseExportDeclaration())) {
+    const isDeclare = this.eatContextual(125);
+    if (isDeclare && (this.isContextual(125) || !this.shouldParseExportDeclaration())) {
       throw this.raise(TSErrors.ExpectedAmbientAfterExportDeclare, {
         at: this.state.startLoc
       });
@@ -9482,7 +9501,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     return declaration;
   }
   parseClassId(node, isStatement, optionalId, bindingType) {
-    if ((!isStatement || optionalId) && this.isContextual(111)) {
+    if ((!isStatement || optionalId) && this.isContextual(113)) {
       return;
     }
     super.parseClassId(node, isStatement, optionalId, node.declare ? 1024 : 8331);
@@ -9577,7 +9596,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     if (node.superClass && (this.match(47) || this.match(51))) {
       node.superTypeParameters = this.tsParseTypeArgumentsInExpression();
     }
-    if (this.eatContextual(111)) {
+    if (this.eatContextual(113)) {
       node.implements = this.tsParseHeritageClause("implements");
     }
   }
@@ -9613,7 +9632,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     let state;
     let jsx;
     let typeCast;
-    if (this.hasPlugin("jsx") && (this.match(140) || this.match(47))) {
+    if (this.hasPlugin("jsx") && (this.match(142) || this.match(47))) {
       state = this.state.clone();
       jsx = this.tryParse(() => super.parseMaybeAssign(refExpressionErrors, afterLeftParse), state);
       if (!jsx.error) return jsx.node;
@@ -9926,7 +9945,7 @@ var typescript = superClass => class TypeScriptParserMixin extends superClass {
     if (this.match(80)) {
       node.abstract = true;
       return this.maybeTakeDecorators(decorators, this.parseClass(node, true, false));
-    } else if (this.isContextual(127)) {
+    } else if (this.isContextual(129)) {
       if (!this.hasFollowingLineBreak()) {
         node.abstract = true;
         this.raise(TSErrors.NonClassMethodPropertyHasAbstractModifer, {
@@ -10123,13 +10142,13 @@ const PlaceholderErrors = ParseErrorEnum`placeholders`({
 });
 var placeholders = superClass => class PlaceholdersParserMixin extends superClass {
   parsePlaceholder(expectedNode) {
-    if (this.match(142)) {
+    if (this.match(144)) {
       const node = this.startNode();
       this.next();
       this.assertNoSpace();
       node.name = super.parseIdentifier(true);
       this.assertNoSpace();
-      this.expect(142);
+      this.expect(144);
       return this.finishPlaceholder(node, expectedNode);
     }
   }
@@ -10140,7 +10159,7 @@ var placeholders = superClass => class PlaceholdersParserMixin extends superClas
   }
   getTokenFromCode(code) {
     if (code === 37 && this.input.charCodeAt(this.state.pos + 1) === 37) {
-      this.finishOp(142, 2);
+      this.finishOp(144, 2);
     } else {
       super.getTokenFromCode(code);
     }
@@ -10174,7 +10193,7 @@ var placeholders = superClass => class PlaceholdersParserMixin extends superClas
       return true;
     }
     const nextToken = this.lookahead();
-    if (nextToken.type === 142) {
+    if (nextToken.type === 144) {
       return true;
     }
     return false;
@@ -10211,7 +10230,7 @@ var placeholders = superClass => class PlaceholdersParserMixin extends superClas
     const oldStrict = this.state.strict;
     const placeholder = this.parsePlaceholder("Identifier");
     if (placeholder) {
-      if (this.match(81) || this.match(142) || this.match(5)) {
+      if (this.match(81) || this.match(144) || this.match(5)) {
         node.id = placeholder;
       } else if (optionalId || !isStatement) {
         node.id = null;
@@ -10232,7 +10251,7 @@ var placeholders = superClass => class PlaceholdersParserMixin extends superClas
   parseExport(node, decorators) {
     const placeholder = this.parsePlaceholder("Identifier");
     if (!placeholder) return super.parseExport(node, decorators);
-    if (!this.isContextual(97) && !this.match(12)) {
+    if (!this.isContextual(98) && !this.match(12)) {
       node.specifiers = [];
       node.source = null;
       node.declaration = this.finishPlaceholder(placeholder, "Declaration");
@@ -10248,7 +10267,7 @@ var placeholders = superClass => class PlaceholdersParserMixin extends superClas
     if (this.match(65)) {
       const next = this.nextTokenStart();
       if (this.isUnparsedContextual(next, "from")) {
-        if (this.input.startsWith(tokenLabelName(142), this.nextTokenStartSince(next + 4))) {
+        if (this.input.startsWith(tokenLabelName(144), this.nextTokenStartSince(next + 4))) {
           return true;
         }
       }
@@ -10276,7 +10295,7 @@ var placeholders = superClass => class PlaceholdersParserMixin extends superClas
     const placeholder = this.parsePlaceholder("Identifier");
     if (!placeholder) return super.parseImport(node);
     node.specifiers = [];
-    if (!this.isContextual(97) && !this.match(12)) {
+    if (!this.isContextual(98) && !this.match(12)) {
       node.source = this.finishPlaceholder(placeholder, "StringLiteral");
       this.semicolon();
       return this.finishNode(node, "ImportDeclaration");
@@ -10288,7 +10307,7 @@ var placeholders = superClass => class PlaceholdersParserMixin extends superClas
       const hasStarImport = this.maybeParseStarImportSpecifier(node);
       if (!hasStarImport) this.parseNamedImportSpecifiers(node);
     }
-    this.expectContextual(97);
+    this.expectContextual(98);
     node.source = this.parseImportSource();
     this.semicolon();
     return this.finishNode(node, "ImportDeclaration");
@@ -10432,6 +10451,9 @@ function validatePlugins(plugins) {
     error.missingPlugins = "doExpressions";
     throw error;
   }
+  if (hasPlugin(plugins, "optionalChainingAssign") && getPluginOption(plugins, "optionalChainingAssign", "version") !== "2023-07") {
+    throw new Error("The 'optionalChainingAssign' plugin requires a 'version' option," + " representing the last proposal update. Currently, the" + " only supported value is '2023-07'.");
+  }
 }
 const mixinPlugins = {
   estree,
@@ -10457,6 +10479,7 @@ const defaultOptions = {
   strictMode: null,
   ranges: false,
   tokens: false,
+  createImportExpressions: false,
   createParenthesizedExpressions: false,
   errorRecovery: false,
   attachComment: true,
@@ -10511,7 +10534,7 @@ class ExpressionParser extends LValParser {
     this.enterInitialScopes();
     this.nextToken();
     const expr = this.parseExpression();
-    if (!this.match(137)) {
+    if (!this.match(139)) {
       this.unexpected();
     }
     this.finalizeRemainingComments();
@@ -10554,7 +10577,7 @@ class ExpressionParser extends LValParser {
   }
   parseMaybeAssign(refExpressionErrors, afterLeftParse) {
     const startLoc = this.state.startLoc;
-    if (this.isContextual(106)) {
+    if (this.isContextual(108)) {
       if (this.prodParam.hasYield) {
         let left = this.parseYield();
         if (afterLeftParse) {
@@ -10633,7 +10656,7 @@ class ExpressionParser extends LValParser {
     return expr;
   }
   parseMaybeUnaryOrPrivate(refExpressionErrors) {
-    return this.match(136) ? this.parsePrivateName() : this.parseMaybeUnary(refExpressionErrors);
+    return this.match(138) ? this.parsePrivateName() : this.parseMaybeUnary(refExpressionErrors);
   }
   parseExprOps(refExpressionErrors) {
     const startLoc = this.state.startLoc;
@@ -10708,7 +10731,7 @@ class ExpressionParser extends LValParser {
             });
           case "smart":
             return this.withTopicBindingContext(() => {
-              if (this.prodParam.hasYield && this.isContextual(106)) {
+              if (this.prodParam.hasYield && this.isContextual(108)) {
                 throw this.raise(Errors.PipeBodyIsTighter, {
                   at: this.state.startLoc
                 });
@@ -10896,7 +10919,7 @@ class ExpressionParser extends LValParser {
     if (computed) {
       node.property = this.parseExpression();
       this.expect(3);
-    } else if (this.match(136)) {
+    } else if (this.match(138)) {
       if (base.type === "Super") {
         this.raise(Errors.SuperPrivateField, {
           at: startLoc
@@ -11073,12 +11096,18 @@ class ExpressionParser extends LValParser {
         if (this.match(16)) {
           return this.parseImportMetaProperty(node);
         }
-        if (!this.match(10)) {
+        if (this.match(10)) {
+          if (this.options.createImportExpressions) {
+            return this.parseImportCall(node);
+          } else {
+            return this.finishNode(node, "Import");
+          }
+        } else {
           this.raise(Errors.UnsupportedImport, {
             at: this.state.lastTokStartLoc
           });
+          return this.finishNode(node, "Import");
         }
-        return this.finishNode(node, "Import");
       case 78:
         node = this.startNode();
         this.next();
@@ -11093,13 +11122,13 @@ class ExpressionParser extends LValParser {
           this.readRegexp();
           return this.parseRegExpLiteral(this.state.value);
         }
-      case 132:
+      case 134:
         return this.parseNumericLiteral(this.state.value);
-      case 133:
+      case 135:
         return this.parseBigIntLiteral(this.state.value);
-      case 134:
+      case 136:
         return this.parseDecimalLiteral(this.state.value);
-      case 131:
+      case 133:
         return this.parseStringLiteral(this.state.value);
       case 84:
         return this.parseNullLiteral();
@@ -11155,7 +11184,7 @@ class ExpressionParser extends LValParser {
             });
           }
         }
-      case 136:
+      case 138:
         {
           this.raise(Errors.PrivateInExpectedIn, {
             at: this.state.startLoc,
@@ -11199,7 +11228,7 @@ class ExpressionParser extends LValParser {
         }
       default:
         if (tokenIsIdentifier(type)) {
-          if (this.isContextual(125) && this.lookaheadInLineCharCode() === 123) {
+          if (this.isContextual(127) && this.lookaheadInLineCharCode() === 123) {
             return this.parseModuleExpression();
           }
           const canBeArrow = this.state.potentialArrowAt === this.state.start;
@@ -11351,7 +11380,7 @@ class ExpressionParser extends LValParser {
     if (this.prodParam.hasYield && this.match(16)) {
       const meta = this.createIdentifier(this.startNodeAtNode(node), "function");
       this.next();
-      if (this.match(102)) {
+      if (this.match(103)) {
         this.expectPlugin("functionSent");
       } else if (!this.hasPlugin("functionSent")) {
         this.unexpected();
@@ -11376,13 +11405,26 @@ class ExpressionParser extends LValParser {
   parseImportMetaProperty(node) {
     const id = this.createIdentifier(this.startNodeAtNode(node), "import");
     this.next();
-    if (this.isContextual(100)) {
+    if (this.isContextual(101)) {
       if (!this.inModule) {
         this.raise(Errors.ImportMetaOutsideModule, {
           at: id
         });
       }
       this.sawUnambiguousESM = true;
+    } else if (this.isContextual(105) || this.isContextual(97)) {
+      const isSource = this.isContextual(105);
+      if (!isSource) this.unexpected();
+      this.expectPlugin(isSource ? "sourcePhaseImports" : "deferredImportEvaluation");
+      if (!this.options.createImportExpressions) {
+        throw this.raise(Errors.DynamicImportPhaseRequiresImportExpressions, {
+          at: this.state.startLoc,
+          phase: this.state.value
+        });
+      }
+      this.next();
+      node.phase = isSource ? "source" : "defer";
+      return this.parseImportCall(node);
     }
     return this.parseMetaProperty(node, id, "meta");
   }
@@ -11542,10 +11584,12 @@ class ExpressionParser extends LValParser {
     return this.finishNode(node, "NewExpression");
   }
   parseNewCallee(node) {
-    node.callee = this.parseNoCallExpr();
-    if (node.callee.type === "Import") {
+    const isImport = this.match(83);
+    const callee = this.parseNoCallExpr();
+    node.callee = callee;
+    if (isImport && (callee.type === "Import" || callee.type === "ImportExpression")) {
       this.raise(Errors.ImportCallNotNewExpression, {
-        at: node.callee
+        at: callee
       });
     }
   }
@@ -11788,19 +11832,19 @@ class ExpressionParser extends LValParser {
         key = this.parseIdentifier(true);
       } else {
         switch (type) {
-          case 132:
+          case 134:
             key = this.parseNumericLiteral(value);
             break;
-          case 131:
+          case 133:
             key = this.parseStringLiteral(value);
             break;
-          case 133:
+          case 135:
             key = this.parseBigIntLiteral(value);
             break;
-          case 134:
+          case 136:
             key = this.parseDecimalLiteral(value);
             break;
-          case 136:
+          case 138:
             {
               const privateKeyLoc = this.state.startLoc;
               if (refExpressionErrors != null) {
@@ -11820,7 +11864,7 @@ class ExpressionParser extends LValParser {
         }
       }
       prop.key = key;
-      if (type !== 136) {
+      if (type !== 138) {
         prop.computed = false;
       }
     }
@@ -12006,7 +12050,7 @@ class ExpressionParser extends LValParser {
     const tokenIsKeyword = tokenKeywordOrIdentifierIsKeyword(type);
     if (liberal) {
       if (tokenIsKeyword) {
-        this.replaceToken(130);
+        this.replaceToken(132);
       }
     } else {
       this.checkReservedWord(name, startLoc, tokenIsKeyword, false);
@@ -12101,7 +12145,7 @@ class ExpressionParser extends LValParser {
     const {
       type
     } = this.state;
-    return type === 53 || type === 10 || type === 0 || tokenIsTemplate(type) || type === 101 && !this.state.containsEsc || type === 135 || type === 56 || this.hasPlugin("v8intrinsic") && type === 54;
+    return type === 53 || type === 10 || type === 0 || tokenIsTemplate(type) || type === 102 && !this.state.containsEsc || type === 137 || type === 56 || this.hasPlugin("v8intrinsic") && type === 54;
   }
   parseYield() {
     const node = this.startNode();
@@ -12115,7 +12159,7 @@ class ExpressionParser extends LValParser {
       delegating = this.eat(55);
       switch (this.state.type) {
         case 13:
-        case 137:
+        case 139:
         case 8:
         case 11:
         case 3:
@@ -12131,6 +12175,22 @@ class ExpressionParser extends LValParser {
     node.argument = argument;
     return this.finishNode(node, "YieldExpression");
   }
+  parseImportCall(node) {
+    this.next();
+    node.source = this.parseMaybeAssignAllowIn();
+    if (this.hasPlugin("importAttributes") || this.hasPlugin("importAssertions")) {
+      node.options = null;
+    }
+    if (this.eat(12)) {
+      this.expectImportAttributesPlugin();
+      if (!this.match(11)) {
+        node.options = this.parseMaybeAssignAllowIn();
+        this.eat(12);
+      }
+    }
+    this.expect(11);
+    return this.finishNode(node, "ImportExpression");
+  }
   checkPipelineAtInfixOperator(left, leftStartLoc) {
     if (this.hasPlugin(["pipelineOperator", {
       proposal: "smart"
@@ -12295,7 +12355,7 @@ function babel7CompatTokens(tokens, input) {
     } = token;
     if (typeof type === "number") {
       {
-        if (type === 136) {
+        if (type === 138) {
           const {
             loc,
             start,
@@ -12312,7 +12372,7 @@ function babel7CompatTokens(tokens, input) {
             startLoc: loc.start,
             endLoc: hashEndLoc
           }), new Token({
-            type: getExportedToken(130),
+            type: getExportedToken(132),
             value: value,
             start: hashEndPos,
             end: end,
@@ -12403,7 +12463,7 @@ class StatementParser extends ExpressionParser {
     }
     return this.finishNode(file, "File");
   }
-  parseProgram(program, end = 137, sourceType = this.options.sourceType) {
+  parseProgram(program, end = 139, sourceType = this.options.sourceType) {
     program.sourceType = sourceType;
     program.interpreter = this.parseInterpreterDirective();
     this.parseBlockBody(program, true, true, end);
@@ -12416,7 +12476,7 @@ class StatementParser extends ExpressionParser {
       }
     }
     let finishedProgram;
-    if (end === 137) {
+    if (end === 139) {
       finishedProgram = this.finishNode(program, "Program");
     } else {
       finishedProgram = this.finishNodeAt(program, "Program", createPositionWithColumnOffset(this.state.startLoc, -1));
@@ -12448,7 +12508,7 @@ class StatementParser extends ExpressionParser {
     return this.finishNode(node, "InterpreterDirective");
   }
   isLet() {
-    if (!this.isContextual(99)) {
+    if (!this.isContextual(100)) {
       return false;
     }
     return this.hasFollowingBindingAtom();
@@ -12487,7 +12547,7 @@ class StatementParser extends ExpressionParser {
       type,
       containsEsc
     } = this.lookahead();
-    if (type === 101 && !containsEsc) {
+    if (type === 102 && !containsEsc) {
       return false;
     } else if (tokenIsIdentifier(type) && !this.hasFollowingLineBreak()) {
       this.expectPlugin("explicitResourceManagement");
@@ -12585,7 +12645,7 @@ class StatementParser extends ExpressionParser {
           return this.parseVarStatement(node, "await using");
         }
         break;
-      case 105:
+      case 107:
         if (this.state.containsEsc || !this.hasInLineFollowingBindingIdentifier()) {
           break;
         }
@@ -12600,7 +12660,7 @@ class StatementParser extends ExpressionParser {
           });
         }
         return this.parseVarStatement(node, "using");
-      case 99:
+      case 100:
         {
           if (this.state.containsEsc) {
             break;
@@ -12763,7 +12823,7 @@ class StatementParser extends ExpressionParser {
         while (this.eat(16)) {
           const node = this.startNodeAt(startLoc);
           node.object = expr;
-          if (this.match(136)) {
+          if (this.match(138)) {
             this.classScope.usePrivateName(this.state.value, this.state.startLoc);
             node.property = this.parsePrivateName();
           } else {
@@ -12853,10 +12913,10 @@ class StatementParser extends ExpressionParser {
       }
       return this.parseFor(node, null);
     }
-    const startsWithLet = this.isContextual(99);
+    const startsWithLet = this.isContextual(100);
     {
       const startsWithAwaitUsing = this.isContextual(96) && this.startsAwaitUsing();
-      const starsWithUsingDeclaration = startsWithAwaitUsing || this.isContextual(105) && this.startsUsingForOf();
+      const starsWithUsingDeclaration = startsWithAwaitUsing || this.isContextual(107) && this.startsUsingForOf();
       const isLetOrUsing = startsWithLet && this.hasFollowingBindingAtom() || starsWithUsingDeclaration;
       if (this.match(74) || this.match(75) || isLetOrUsing) {
         const initNode = this.startNode();
@@ -12881,7 +12941,7 @@ class StatementParser extends ExpressionParser {
             at: init
           });
         }
-        if ((isForIn || this.isContextual(101)) && init.declarations.length === 1) {
+        if ((isForIn || this.isContextual(102)) && init.declarations.length === 1) {
           return this.parseForIn(node, init, awaitAt);
         }
         if (awaitAt !== null) {
@@ -12893,7 +12953,7 @@ class StatementParser extends ExpressionParser {
     const startsWithAsync = this.isContextual(95);
     const refExpressionErrors = new ExpressionErrors();
     const init = this.parseExpression(true, refExpressionErrors);
-    const isForOf = this.isContextual(101);
+    const isForOf = this.isContextual(102);
     if (isForOf) {
       if (startsWithLet) {
         this.raise(Errors.ForOfLet, {
@@ -13203,12 +13263,12 @@ class StatementParser extends ExpressionParser {
       this.parseVarId(decl, kind);
       decl.init = !this.eat(29) ? null : isFor ? this.parseMaybeAssignDisallowIn() : this.parseMaybeAssignAllowIn();
       if (decl.init === null && !allowMissingInitializer) {
-        if (decl.id.type !== "Identifier" && !(isFor && (this.match(58) || this.isContextual(101)))) {
+        if (decl.id.type !== "Identifier" && !(isFor && (this.match(58) || this.isContextual(102)))) {
           this.raise(Errors.DeclarationMissingInitializer, {
             at: this.state.lastTokEndLoc,
             kind: "destructuring"
           });
-        } else if (kind === "const" && !(this.match(58) || this.isContextual(101))) {
+        } else if (kind === "const" && !(this.match(58) || this.isContextual(102))) {
           this.raise(Errors.DeclarationMissingInitializer, {
             at: this.state.lastTokEndLoc,
             kind: "const"
@@ -13371,7 +13431,7 @@ class StatementParser extends ExpressionParser {
     return false;
   }
   parseClassMember(classBody, member, state) {
-    const isStatic = this.isContextual(104);
+    const isStatic = this.isContextual(106);
     if (isStatic) {
       if (this.parseClassMemberFromModifier(classBody, member)) {
         return;
@@ -13395,7 +13455,7 @@ class StatementParser extends ExpressionParser {
     this.parsePropertyNamePrefixOperator(member);
     if (this.eat(55)) {
       method.kind = "method";
-      const isPrivateName = this.match(136);
+      const isPrivateName = this.match(138);
       this.parseClassElementName(method);
       if (isPrivateName) {
         this.pushClassPrivateMethod(classBody, privateMethod, true, false);
@@ -13410,7 +13470,7 @@ class StatementParser extends ExpressionParser {
       return;
     }
     const isContextual = tokenIsIdentifier(this.state.type) && !this.state.containsEsc;
-    const isPrivate = this.match(136);
+    const isPrivate = this.match(138);
     const key = this.parseClassElementName(member);
     const maybeQuestionTokenStartLoc = this.state.startLoc;
     this.parsePostMemberNameModifiers(publicMember);
@@ -13451,7 +13511,7 @@ class StatementParser extends ExpressionParser {
         this.unexpected(maybeQuestionTokenStartLoc);
       }
       method.kind = "method";
-      const isPrivate = this.match(136);
+      const isPrivate = this.match(138);
       this.parseClassElementName(method);
       this.parsePostMemberNameModifiers(publicMember);
       if (isPrivate) {
@@ -13467,7 +13527,7 @@ class StatementParser extends ExpressionParser {
     } else if (isContextual && (key.name === "get" || key.name === "set") && !(this.match(55) && this.isLineTerminator())) {
       this.resetPreviousNodeTrailingComments(key);
       method.kind = key.name;
-      const isPrivate = this.match(136);
+      const isPrivate = this.match(138);
       this.parseClassElementName(publicMethod);
       if (isPrivate) {
         this.pushClassPrivateMethod(classBody, privateMethod, false, false);
@@ -13483,7 +13543,7 @@ class StatementParser extends ExpressionParser {
     } else if (isContextual && key.name === "accessor" && !this.isLineTerminator()) {
       this.expectPlugin("decoratorAutoAccessors");
       this.resetPreviousNodeTrailingComments(key);
-      const isPrivate = this.match(136);
+      const isPrivate = this.match(138);
       this.parseClassElementName(publicProp);
       this.pushClassAccessorProperty(classBody, accessorProp, isPrivate);
     } else if (this.isLineTerminator()) {
@@ -13501,12 +13561,12 @@ class StatementParser extends ExpressionParser {
       type,
       value
     } = this.state;
-    if ((type === 130 || type === 131) && member.static && value === "prototype") {
+    if ((type === 132 || type === 133) && member.static && value === "prototype") {
       this.raise(Errors.StaticPrototype, {
         at: this.state.startLoc
       });
     }
-    if (type === 136) {
+    if (type === 138) {
       if (value === "constructor") {
         this.raise(Errors.ConstructorClassPrivateField, {
           at: this.state.startLoc
@@ -13643,7 +13703,7 @@ class StatementParser extends ExpressionParser {
       this.unexpected(null, 5);
     }
     if (hasNamespace && parseAfterNamespace) {
-      this.unexpected(null, 97);
+      this.unexpected(null, 98);
     }
     let hasDeclaration;
     if (isFromRequired || hasSpecifiers) {
@@ -13784,14 +13844,14 @@ class StatementParser extends ExpressionParser {
       type
     } = this.state;
     if (tokenIsIdentifier(type)) {
-      if (type === 95 && !this.state.containsEsc || type === 99) {
+      if (type === 95 && !this.state.containsEsc || type === 100) {
         return false;
       }
-      if ((type === 128 || type === 127) && !this.state.containsEsc) {
+      if ((type === 130 || type === 129) && !this.state.containsEsc) {
         const {
           type: nextType
         } = this.lookahead();
-        if (tokenIsIdentifier(nextType) && nextType !== 97 || nextType === 5) {
+        if (tokenIsIdentifier(nextType) && nextType !== 98 || nextType === 5) {
           this.expectOnePlugin(["flow", "typescript"]);
           return false;
         }
@@ -13811,7 +13871,7 @@ class StatementParser extends ExpressionParser {
     return false;
   }
   parseExportFrom(node, expect) {
-    if (this.eatContextual(97)) {
+    if (this.eatContextual(98)) {
       node.source = this.parseImportSource();
       this.checkExport(node);
       this.maybeParseImportAttributes(node);
@@ -13935,8 +13995,8 @@ class StatementParser extends ExpressionParser {
         this.expect(12);
         if (this.eat(8)) break;
       }
-      const isMaybeTypeOnly = this.isContextual(128);
-      const isString = this.match(131);
+      const isMaybeTypeOnly = this.isContextual(130);
+      const isString = this.match(133);
       const node = this.startNode();
       node.local = this.parseModuleExportName();
       nodes.push(this.parseExportSpecifier(node, isString, isInTypeExport, isMaybeTypeOnly));
@@ -13954,7 +14014,7 @@ class StatementParser extends ExpressionParser {
     return this.finishNode(node, "ExportSpecifier");
   }
   parseModuleExportName() {
-    if (this.match(131)) {
+    if (this.match(133)) {
       const result = this.parseStringLiteral(this.state.value);
       const surrogate = result.value.match(loneSurrogate);
       if (surrogate) {
@@ -13979,11 +14039,27 @@ class StatementParser extends ExpressionParser {
     return false;
   }
   checkImportReflection(node) {
-    if (node.module) {
+    const {
+      specifiers
+    } = node;
+    const singleBindingType = specifiers.length === 1 ? specifiers[0].type : null;
+    if (node.phase === "source") {
+      if (singleBindingType !== "ImportDefaultSpecifier") {
+        this.raise(Errors.SourcePhaseImportRequiresDefault, {
+          at: specifiers[0].loc.start
+        });
+      }
+    } else if (node.phase === "defer") {
+      if (singleBindingType !== "ImportNamespaceSpecifier") {
+        this.raise(Errors.DeferImportRequiresNamespace, {
+          at: specifiers[0].loc.start
+        });
+      }
+    } else if (node.module) {
       var _node$assertions;
-      if (node.specifiers.length !== 1 || node.specifiers[0].type !== "ImportDefaultSpecifier") {
+      if (singleBindingType !== "ImportDefaultSpecifier") {
         this.raise(Errors.ImportReflectionNotBinding, {
-          at: node.specifiers[0].loc.start
+          at: specifiers[0].loc.start
         });
       }
       if (((_node$assertions = node.assertions) == null ? void 0 : _node$assertions.length) > 0) {
@@ -14019,7 +14095,8 @@ class StatementParser extends ExpressionParser {
     }
   }
   isPotentialImportPhase(isExport) {
-    return !isExport && this.isContextual(125);
+    if (isExport) return false;
+    return this.isContextual(105) || this.isContextual(97) || this.isContextual(127);
   }
   applyImportPhase(node, isExport, phase, loc) {
     if (isExport) {
@@ -14031,6 +14108,15 @@ class StatementParser extends ExpressionParser {
     } else if (this.hasPlugin("importReflection")) {
       node.module = false;
     }
+    if (phase === "source") {
+      this.expectPlugin("sourcePhaseImports", loc);
+      node.phase = "source";
+    } else if (phase === "defer") {
+      this.expectPlugin("deferredImportEvaluation", loc);
+      node.phase = "defer";
+    } else if (this.hasPlugin("sourcePhaseImports")) {
+      node.phase = null;
+    }
   }
   parseMaybeImportPhase(node, isExport) {
     if (!this.isPotentialImportPhase(isExport)) {
@@ -14041,7 +14127,7 @@ class StatementParser extends ExpressionParser {
     const {
       type
     } = this.state;
-    const isImportPhase = tokenIsKeywordOrIdentifier(type) ? type !== 97 || this.lookaheadCharCode() === 102 : type !== 12;
+    const isImportPhase = tokenIsKeywordOrIdentifier(type) ? type !== 98 || this.lookaheadCharCode() === 102 : type !== 12;
     if (isImportPhase) {
       this.resetPreviousIdentifierLeadingComments(phaseIdentifier);
       this.applyImportPhase(node, isExport, phaseIdentifier.name, phaseIdentifier.loc.start);
@@ -14055,10 +14141,10 @@ class StatementParser extends ExpressionParser {
     const {
       type
     } = this.state;
-    return tokenIsIdentifier(type) ? type !== 97 || this.lookaheadCharCode() === 102 : type !== 12;
+    return tokenIsIdentifier(type) ? type !== 98 || this.lookaheadCharCode() === 102 : type !== 12;
   }
   parseImport(node) {
-    if (this.match(131)) {
+    if (this.match(133)) {
       return this.parseImportSourceAndAttributes(node);
     }
     return this.parseImportSpecifiersAndAfter(node, this.parseMaybeImportPhase(node, false));
@@ -14069,7 +14155,7 @@ class StatementParser extends ExpressionParser {
     const parseNext = !hasDefault || this.eat(12);
     const hasStar = parseNext && this.maybeParseStarImportSpecifier(node);
     if (parseNext && !hasStar) this.parseNamedImportSpecifiers(node);
-    this.expectContextual(97);
+    this.expectContextual(98);
     return this.parseImportSourceAndAttributes(node);
   }
   parseImportSourceAndAttributes(node) {
@@ -14083,7 +14169,7 @@ class StatementParser extends ExpressionParser {
     return this.finishNode(node, "ImportDeclaration");
   }
   parseImportSource() {
-    if (!this.match(131)) this.unexpected();
+    if (!this.match(133)) this.unexpected();
     return this.parseExprAtom();
   }
   parseImportSpecifierLocal(node, specifier, type) {
@@ -14116,13 +14202,13 @@ class StatementParser extends ExpressionParser {
         });
       }
       attrNames.add(keyName);
-      if (this.match(131)) {
+      if (this.match(133)) {
         node.key = this.parseStringLiteral(keyName);
       } else {
         node.key = this.parseIdentifier(true);
       }
       this.expect(14);
-      if (!this.match(131)) {
+      if (!this.match(133)) {
         throw this.raise(Errors.ModuleAttributeInvalidValue, {
           at: this.state.startLoc
         });
@@ -14152,7 +14238,7 @@ class StatementParser extends ExpressionParser {
       }
       attributes.add(node.key.name);
       this.expect(14);
-      if (!this.match(131)) {
+      if (!this.match(133)) {
         throw this.raise(Errors.ModuleAttributeInvalidValue, {
           at: this.state.startLoc
         });
@@ -14243,8 +14329,8 @@ class StatementParser extends ExpressionParser {
         if (this.eat(8)) break;
       }
       const specifier = this.startNode();
-      const importedIsString = this.match(131);
-      const isMaybeTypeOnly = this.isContextual(128);
+      const importedIsString = this.match(133);
+      const isMaybeTypeOnly = this.isContextual(130);
       specifier.imported = this.parseModuleExportName();
       const importSpecifier = this.parseImportSpecifier(specifier, importedIsString, node.importKind === "type" || node.importKind === "typeof", isMaybeTypeOnly, undefined);
       node.specifiers.push(importSpecifier);
diff --git a/tools/node_modules/eslint/node_modules/@babel/parser/package.json b/tools/node_modules/eslint/node_modules/@babel/parser/package.json
index 1d8dd2bb3dd4b0..768f887baf9b6f 100644
--- a/tools/node_modules/eslint/node_modules/@babel/parser/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/parser/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/parser",
-  "version": "7.22.16",
+  "version": "7.23.0",
   "description": "A JavaScript parser",
   "author": "The Babel Team (https://babel.dev/team)",
   "homepage": "https://babel.dev/docs/en/next/babel-parser",
@@ -36,9 +36,9 @@
   "devDependencies": {
     "@babel/code-frame": "^7.22.13",
     "@babel/helper-check-duplicate-nodes": "^7.22.5",
-    "@babel/helper-fixtures": "^7.22.13",
+    "@babel/helper-fixtures": "^7.22.19",
     "@babel/helper-string-parser": "^7.22.5",
-    "@babel/helper-validator-identifier": "^7.22.15",
+    "@babel/helper-validator-identifier": "^7.22.20",
     "charcodes": "^0.2.0"
   },
   "bin": "./bin/babel-parser.js",
diff --git a/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-assertions/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-assertions/lib/index.js
deleted file mode 100644
index 2aad5b2850bed1..00000000000000
--- a/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-assertions/lib/index.js
+++ /dev/null
@@ -1,19 +0,0 @@
-"use strict";
-
-Object.defineProperty(exports, "__esModule", {
-  value: true
-});
-exports.default = void 0;
-var _helperPluginUtils = require("@babel/helper-plugin-utils");
-var _default = (0, _helperPluginUtils.declare)(api => {
-  api.assertVersion(7);
-  return {
-    name: "syntax-import-assertions",
-    manipulateOptions(opts, parserOpts) {
-      parserOpts.plugins.push("importAssertions");
-    }
-  };
-});
-exports.default = _default;
-
-//# sourceMappingURL=index.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-assertions/LICENSE b/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-attributes/LICENSE
similarity index 100%
rename from tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-assertions/LICENSE
rename to tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-attributes/LICENSE
diff --git a/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-attributes/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-attributes/lib/index.js
new file mode 100644
index 00000000000000..6e78b9a07c3ee6
--- /dev/null
+++ b/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-attributes/lib/index.js
@@ -0,0 +1,31 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _helperPluginUtils = require("@babel/helper-plugin-utils");
+var _default = (0, _helperPluginUtils.declare)((api, {
+  deprecatedAssertSyntax
+}) => {
+  api.assertVersion("^7.22.0");
+  if (deprecatedAssertSyntax != null && typeof deprecatedAssertSyntax !== "boolean") {
+    throw new Error("'deprecatedAssertSyntax' must be a boolean, if specified.");
+  }
+  return {
+    name: "syntax-import-attributes",
+    manipulateOptions({
+      parserOpts,
+      generatorOpts
+    }) {
+      var _generatorOpts$import;
+      (_generatorOpts$import = generatorOpts.importAttributesKeyword) != null ? _generatorOpts$import : generatorOpts.importAttributesKeyword = "with";
+      parserOpts.plugins.push(["importAttributes", {
+        deprecatedAssertSyntax: Boolean(deprecatedAssertSyntax)
+      }]);
+    }
+  };
+});
+exports.default = _default;
+
+//# sourceMappingURL=index.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-assertions/package.json b/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-attributes/package.json
similarity index 66%
rename from tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-assertions/package.json
rename to tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-attributes/package.json
index 28c6f943851bb2..2239fa8e4c9859 100644
--- a/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-assertions/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/plugin-syntax-import-attributes/package.json
@@ -1,11 +1,11 @@
 {
-  "name": "@babel/plugin-syntax-import-assertions",
+  "name": "@babel/plugin-syntax-import-attributes",
   "version": "7.22.5",
-  "description": "Allow parsing of the module assertion attributes in the import statement",
+  "description": "Allow parsing of the module attributes in the import statement",
   "repository": {
     "type": "git",
     "url": "https://github.com/babel/babel.git",
-    "directory": "packages/babel-plugin-syntax-import-assertions"
+    "directory": "packages/babel-plugin-syntax-import-attributes"
   },
   "license": "MIT",
   "publishConfig": {
@@ -28,5 +28,9 @@
     "node": ">=6.9.0"
   },
   "author": "The Babel Team (https://babel.dev/team)",
+  "exports": {
+    ".": "./lib/index.js",
+    "./package.json": "./package.json"
+  },
   "type": "commonjs"
 }
\ No newline at end of file
diff --git a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/index.js
index ef4fbabc184448..38255007ece047 100644
--- a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/index.js
@@ -1,13 +1,5 @@
 "use strict";
 
-if (typeof process === "object" && process.version === "v20.6.0") {
-  if (exports["___internal__alreadyRunning" + ""]) return;
-  Object.defineProperty(exports, "___internal__alreadyRunning", {
-    value: true,
-    enumerable: false,
-    configurable: true
-  });
-}
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
@@ -99,6 +91,5 @@ traverse.hasType = function (tree, type, denylistTypes) {
   return state.has;
 };
 traverse.cache = cache;
-if (typeof process === "object" && process.version === "v20.6.0") delete exports["___internal__alreadyRunning" + ""];
 
 //# sourceMappingURL=index.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/conversion.js b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/conversion.js
index d582891838a016..a7884c7ce0a3e3 100644
--- a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/conversion.js
+++ b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/conversion.js
@@ -88,12 +88,10 @@ function ensureBlock() {
   return this.node;
 }
 {
-  {
-    exports.arrowFunctionToShadowed = function () {
-      if (!this.isArrowFunctionExpression()) return;
-      this.arrowFunctionToExpression();
-    };
-  }
+  exports.arrowFunctionToShadowed = function () {
+    if (!this.isArrowFunctionExpression()) return;
+    this.arrowFunctionToExpression();
+  };
 }
 function unwrapFunctionEnvironment() {
   if (!this.isArrowFunctionExpression() && !this.isFunctionExpression() && !this.isFunctionDeclaration()) {
diff --git a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/evaluation.js b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/evaluation.js
index 2f96dc12ecf67b..6ddf14d999c994 100644
--- a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/evaluation.js
+++ b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/evaluation.js
@@ -5,10 +5,14 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.evaluate = evaluate;
 exports.evaluateTruthy = evaluateTruthy;
-const VALID_CALLEES = ["String", "Number", "Math"];
+const VALID_OBJECT_CALLEES = ["Number", "String", "Math"];
+const VALID_IDENTIFIER_CALLEES = ["isFinite", "isNaN", "parseFloat", "parseInt", "decodeURI", "decodeURIComponent", "encodeURI", "encodeURIComponent", null, null];
 const INVALID_METHODS = ["random"];
-function isValidCallee(val) {
-  return VALID_CALLEES.includes(val);
+function isValidObjectCallee(val) {
+  return VALID_OBJECT_CALLEES.includes(val);
+}
+function isValidIdentifierCallee(val) {
+  return VALID_IDENTIFIER_CALLEES.includes(val);
 }
 function isInvalidMethod(val) {
   return INVALID_METHODS.includes(val);
@@ -283,13 +287,13 @@ function _evaluate(path, state) {
     const callee = path.get("callee");
     let context;
     let func;
-    if (callee.isIdentifier() && !path.scope.getBinding(callee.node.name) && isValidCallee(callee.node.name)) {
+    if (callee.isIdentifier() && !path.scope.getBinding(callee.node.name) && (isValidObjectCallee(callee.node.name) || isValidIdentifierCallee(callee.node.name))) {
       func = global[callee.node.name];
     }
     if (callee.isMemberExpression()) {
       const object = callee.get("object");
       const property = callee.get("property");
-      if (object.isIdentifier() && property.isIdentifier() && isValidCallee(object.node.name) && !isInvalidMethod(property.node.name)) {
+      if (object.isIdentifier() && property.isIdentifier() && isValidObjectCallee(object.node.name) && !isInvalidMethod(property.node.name)) {
         context = global[object.node.name];
         func = context[property.node.name];
       }
diff --git a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/lib/virtual-types-validator.js b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/lib/virtual-types-validator.js
index c005263bc7df23..619ebee89e6479 100644
--- a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/lib/virtual-types-validator.js
+++ b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/path/lib/virtual-types-validator.js
@@ -150,14 +150,12 @@ function isForAwaitStatement() {
   });
 }
 {
-  {
-    exports.isExistentialTypeParam = function isExistentialTypeParam() {
-      throw new Error("`path.isExistentialTypeParam` has been renamed to `path.isExistsTypeAnnotation()` in Babel 7.");
-    };
-    exports.isNumericLiteralTypeAnnotation = function isNumericLiteralTypeAnnotation() {
-      throw new Error("`path.isNumericLiteralTypeAnnotation()` has been renamed to `path.isNumberLiteralTypeAnnotation()` in Babel 7.");
-    };
-  }
+  exports.isExistentialTypeParam = function isExistentialTypeParam() {
+    throw new Error("`path.isExistentialTypeParam` has been renamed to `path.isExistsTypeAnnotation()` in Babel 7.");
+  };
+  exports.isNumericLiteralTypeAnnotation = function isNumericLiteralTypeAnnotation() {
+    throw new Error("`path.isNumericLiteralTypeAnnotation()` has been renamed to `path.isNumberLiteralTypeAnnotation()` in Babel 7.");
+  };
 }
 
 //# sourceMappingURL=virtual-types-validator.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/scope/index.js b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/scope/index.js
index 6e52b86950ccf7..0f087c6aa76fb4 100644
--- a/tools/node_modules/eslint/node_modules/@babel/traverse/lib/scope/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/traverse/lib/scope/index.js
@@ -47,7 +47,6 @@ const {
   memberExpression,
   numericLiteral,
   toIdentifier,
-  unaryExpression,
   variableDeclaration,
   variableDeclarator,
   isRecordExpression,
@@ -56,7 +55,8 @@ const {
   isTopicReference,
   isMetaProperty,
   isPrivateName,
-  isExportDeclaration
+  isExportDeclaration,
+  buildUndefinedNode
 } = _t;
 function gatherNodeParts(node, parts) {
   switch (node == null ? void 0 : node.type) {
@@ -506,7 +506,7 @@ class Scope {
     }
   }
   buildUndefinedNode() {
-    return unaryExpression("void", numericLiteral(0), true);
+    return buildUndefinedNode();
   }
   registerConstantViolation(path) {
     const ids = path.getBindingIdentifiers();
diff --git a/tools/node_modules/eslint/node_modules/@babel/traverse/package.json b/tools/node_modules/eslint/node_modules/@babel/traverse/package.json
index c802d4626bfb5a..debdbf795a74e7 100644
--- a/tools/node_modules/eslint/node_modules/@babel/traverse/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/traverse/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/traverse",
-  "version": "7.22.17",
+  "version": "7.23.0",
   "description": "The Babel Traverse module maintains the overall tree state, and is responsible for replacing, removing, and adding nodes",
   "author": "The Babel Team (https://babel.dev/team)",
   "homepage": "https://babel.dev/docs/en/next/babel-traverse",
@@ -17,18 +17,18 @@
   "main": "./lib/index.js",
   "dependencies": {
     "@babel/code-frame": "^7.22.13",
-    "@babel/generator": "^7.22.15",
-    "@babel/helper-environment-visitor": "^7.22.5",
-    "@babel/helper-function-name": "^7.22.5",
+    "@babel/generator": "^7.23.0",
+    "@babel/helper-environment-visitor": "^7.22.20",
+    "@babel/helper-function-name": "^7.23.0",
     "@babel/helper-hoist-variables": "^7.22.5",
     "@babel/helper-split-export-declaration": "^7.22.6",
-    "@babel/parser": "^7.22.16",
-    "@babel/types": "^7.22.17",
+    "@babel/parser": "^7.23.0",
+    "@babel/types": "^7.23.0",
     "debug": "^4.1.0",
     "globals": "^11.1.0"
   },
   "devDependencies": {
-    "@babel/core": "^7.22.17",
+    "@babel/core": "^7.23.0",
     "@babel/helper-plugin-test-runner": "^7.22.5"
   },
   "engines": {
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/lib/asserts/generated/index.js b/tools/node_modules/eslint/node_modules/@babel/types/lib/asserts/generated/index.js
index a63dab34753c43..b2d40fa7cbb606 100644
--- a/tools/node_modules/eslint/node_modules/@babel/types/lib/asserts/generated/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/types/lib/asserts/generated/index.js
@@ -108,6 +108,7 @@ exports.assertImport = assertImport;
 exports.assertImportAttribute = assertImportAttribute;
 exports.assertImportDeclaration = assertImportDeclaration;
 exports.assertImportDefaultSpecifier = assertImportDefaultSpecifier;
+exports.assertImportExpression = assertImportExpression;
 exports.assertImportNamespaceSpecifier = assertImportNamespaceSpecifier;
 exports.assertImportOrExportDeclaration = assertImportOrExportDeclaration;
 exports.assertImportSpecifier = assertImportSpecifier;
@@ -511,6 +512,9 @@ function assertImportNamespaceSpecifier(node, opts) {
 function assertImportSpecifier(node, opts) {
   assert("ImportSpecifier", node, opts);
 }
+function assertImportExpression(node, opts) {
+  assert("ImportExpression", node, opts);
+}
 function assertMetaProperty(node, opts) {
   assert("MetaProperty", node, opts);
 }
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/generated/index.js b/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/generated/index.js
index 5b61c3e1714c14..df8586d74d6121 100644
--- a/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/generated/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/generated/index.js
@@ -85,6 +85,7 @@ exports.import = _import;
 exports.importAttribute = importAttribute;
 exports.importDeclaration = importDeclaration;
 exports.importDefaultSpecifier = importDefaultSpecifier;
+exports.importExpression = importExpression;
 exports.importNamespaceSpecifier = importNamespaceSpecifier;
 exports.importSpecifier = importSpecifier;
 exports.indexedAccessType = indexedAccessType;
@@ -729,6 +730,13 @@ function importSpecifier(local, imported) {
     imported
   });
 }
+function importExpression(source, options = null) {
+  return (0, _validateNode.default)({
+    type: "ImportExpression",
+    source,
+    options
+  });
+}
 function metaProperty(meta, property) {
   return (0, _validateNode.default)({
     type: "MetaProperty",
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/generated/uppercase.js b/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/generated/uppercase.js
index 25a83cbd1b31b7..1d02118882bec0 100644
--- a/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/generated/uppercase.js
+++ b/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/generated/uppercase.js
@@ -495,6 +495,12 @@ Object.defineProperty(exports, "ImportDefaultSpecifier", {
     return _index.importDefaultSpecifier;
   }
 });
+Object.defineProperty(exports, "ImportExpression", {
+  enumerable: true,
+  get: function () {
+    return _index.importExpression;
+  }
+});
 Object.defineProperty(exports, "ImportNamespaceSpecifier", {
   enumerable: true,
   get: function () {
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/productions.js b/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/productions.js
new file mode 100644
index 00000000000000..6e64717f09c3c0
--- /dev/null
+++ b/tools/node_modules/eslint/node_modules/@babel/types/lib/builders/productions.js
@@ -0,0 +1,12 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.buildUndefinedNode = buildUndefinedNode;
+var _index = require("./generated/index.js");
+function buildUndefinedNode() {
+  return (0, _index.unaryExpression)("void", (0, _index.numericLiteral)(0), true);
+}
+
+//# sourceMappingURL=productions.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/lib/definitions/core.js b/tools/node_modules/eslint/node_modules/@babel/types/lib/definitions/core.js
index 64d6c09e6a361a..a5277b1372c130 100644
--- a/tools/node_modules/eslint/node_modules/@babel/types/lib/definitions/core.js
+++ b/tools/node_modules/eslint/node_modules/@babel/types/lib/definitions/core.js
@@ -37,7 +37,7 @@ defineType("AssignmentExpression", {
       }()
     },
     left: {
-      validate: !process.env.BABEL_TYPES_8_BREAKING ? (0, _utils.assertNodeType)("LVal") : (0, _utils.assertNodeType)("Identifier", "MemberExpression", "ArrayPattern", "ObjectPattern", "TSAsExpression", "TSSatisfiesExpression", "TSTypeAssertion", "TSNonNullExpression")
+      validate: !process.env.BABEL_TYPES_8_BREAKING ? (0, _utils.assertNodeType)("LVal", "OptionalMemberExpression") : (0, _utils.assertNodeType)("Identifier", "MemberExpression", "OptionalMemberExpression", "ArrayPattern", "ObjectPattern", "TSAsExpression", "TSSatisfiesExpression", "TSTypeAssertion", "TSNonNullExpression")
     },
     right: {
       validate: (0, _utils.assertNodeType)("Expression")
@@ -1170,6 +1170,10 @@ defineType("ImportDeclaration", {
       optional: true,
       validate: (0, _utils.assertValueType)("boolean")
     },
+    phase: {
+      default: null,
+      validate: (0, _utils.assertOneOf)("source", "defer")
+    },
     specifiers: {
       validate: (0, _utils.chain)((0, _utils.assertValueType)("array"), (0, _utils.assertEach)((0, _utils.assertNodeType)("ImportSpecifier", "ImportDefaultSpecifier", "ImportNamespaceSpecifier")))
     },
@@ -1216,6 +1220,23 @@ defineType("ImportSpecifier", {
     }
   }
 });
+defineType("ImportExpression", {
+  visitor: ["source", "options"],
+  aliases: ["Expression"],
+  fields: {
+    phase: {
+      default: null,
+      validate: (0, _utils.assertOneOf)("source", "defer")
+    },
+    source: {
+      validate: (0, _utils.assertNodeType)("Expression")
+    },
+    options: {
+      validate: (0, _utils.assertNodeType)("Expression"),
+      optional: true
+    }
+  }
+});
 defineType("MetaProperty", {
   visitor: ["meta", "property"],
   aliases: ["Expression"],
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/lib/index.js b/tools/node_modules/eslint/node_modules/@babel/types/lib/index.js
index e5de3d4880b8df..33df87ac129be6 100644
--- a/tools/node_modules/eslint/node_modules/@babel/types/lib/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/types/lib/index.js
@@ -1,13 +1,5 @@
 "use strict";
 
-if (typeof process === "object" && process.version === "v20.6.0") {
-  if (exports["___internal__alreadyRunning" + ""]) return;
-  Object.defineProperty(exports, "___internal__alreadyRunning", {
-    value: true,
-    enumerable: false,
-    configurable: true
-  });
-}
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
@@ -457,6 +449,18 @@ Object.keys(_uppercase).forEach(function (key) {
     }
   });
 });
+var _productions = require("./builders/productions.js");
+Object.keys(_productions).forEach(function (key) {
+  if (key === "default" || key === "__esModule") return;
+  if (Object.prototype.hasOwnProperty.call(_exportNames, key)) return;
+  if (key in exports && exports[key] === _productions[key]) return;
+  Object.defineProperty(exports, key, {
+    enumerable: true,
+    get: function () {
+      return _productions[key];
+    }
+  });
+});
 var _cloneNode = require("./clone/cloneNode.js");
 var _clone = require("./clone/clone.js");
 var _cloneDeep = require("./clone/cloneDeep.js");
@@ -574,6 +578,5 @@ const react = {
   buildChildren: _buildChildren.default
 };
 exports.react = react;
-if (typeof process === "object" && process.version === "v20.6.0") delete exports["___internal__alreadyRunning" + ""];
 
 //# sourceMappingURL=index.js.map
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/lib/index.js.flow b/tools/node_modules/eslint/node_modules/@babel/types/lib/index.js.flow
index 4810ff88754dc8..a1203c1a883867 100644
--- a/tools/node_modules/eslint/node_modules/@babel/types/lib/index.js.flow
+++ b/tools/node_modules/eslint/node_modules/@babel/types/lib/index.js.flow
@@ -46,7 +46,7 @@ declare class BabelNodeArrayExpression extends BabelNode {
 declare class BabelNodeAssignmentExpression extends BabelNode {
   type: "AssignmentExpression";
   operator: string;
-  left: BabelNodeLVal;
+  left: BabelNodeLVal | BabelNodeOptionalMemberExpression;
   right: BabelNodeExpression;
 }
 
@@ -478,6 +478,7 @@ declare class BabelNodeImportDeclaration extends BabelNode {
   attributes?: Array<BabelNodeImportAttribute>;
   importKind?: "type" | "typeof" | "value";
   module?: boolean;
+  phase?: "source" | "defer";
 }
 
 declare class BabelNodeImportDefaultSpecifier extends BabelNode {
@@ -497,6 +498,13 @@ declare class BabelNodeImportSpecifier extends BabelNode {
   importKind?: "type" | "typeof" | "value";
 }
 
+declare class BabelNodeImportExpression extends BabelNode {
+  type: "ImportExpression";
+  source: BabelNodeExpression;
+  options?: BabelNodeExpression;
+  phase?: "source" | "defer";
+}
+
 declare class BabelNodeMetaProperty extends BabelNode {
   type: "MetaProperty";
   meta: BabelNodeIdentifier;
@@ -1619,8 +1627,8 @@ declare class BabelNodeTSTypeParameter extends BabelNode {
   out?: boolean;
 }
 
-type BabelNodeStandardized = BabelNodeArrayExpression | BabelNodeAssignmentExpression | BabelNodeBinaryExpression | BabelNodeInterpreterDirective | BabelNodeDirective | BabelNodeDirectiveLiteral | BabelNodeBlockStatement | BabelNodeBreakStatement | BabelNodeCallExpression | BabelNodeCatchClause | BabelNodeConditionalExpression | BabelNodeContinueStatement | BabelNodeDebuggerStatement | BabelNodeDoWhileStatement | BabelNodeEmptyStatement | BabelNodeExpressionStatement | BabelNodeFile | BabelNodeForInStatement | BabelNodeForStatement | BabelNodeFunctionDeclaration | BabelNodeFunctionExpression | BabelNodeIdentifier | BabelNodeIfStatement | BabelNodeLabeledStatement | BabelNodeStringLiteral | BabelNodeNumericLiteral | BabelNodeNullLiteral | BabelNodeBooleanLiteral | BabelNodeRegExpLiteral | BabelNodeLogicalExpression | BabelNodeMemberExpression | BabelNodeNewExpression | BabelNodeProgram | BabelNodeObjectExpression | BabelNodeObjectMethod | BabelNodeObjectProperty | BabelNodeRestElement | BabelNodeReturnStatement | BabelNodeSequenceExpression | BabelNodeParenthesizedExpression | BabelNodeSwitchCase | BabelNodeSwitchStatement | BabelNodeThisExpression | BabelNodeThrowStatement | BabelNodeTryStatement | BabelNodeUnaryExpression | BabelNodeUpdateExpression | BabelNodeVariableDeclaration | BabelNodeVariableDeclarator | BabelNodeWhileStatement | BabelNodeWithStatement | BabelNodeAssignmentPattern | BabelNodeArrayPattern | BabelNodeArrowFunctionExpression | BabelNodeClassBody | BabelNodeClassExpression | BabelNodeClassDeclaration | BabelNodeExportAllDeclaration | BabelNodeExportDefaultDeclaration | BabelNodeExportNamedDeclaration | BabelNodeExportSpecifier | BabelNodeForOfStatement | BabelNodeImportDeclaration | BabelNodeImportDefaultSpecifier | BabelNodeImportNamespaceSpecifier | BabelNodeImportSpecifier | BabelNodeMetaProperty | BabelNodeClassMethod | BabelNodeObjectPattern | BabelNodeSpreadElement | BabelNodeSuper | BabelNodeTaggedTemplateExpression | BabelNodeTemplateElement | BabelNodeTemplateLiteral | BabelNodeYieldExpression | BabelNodeAwaitExpression | BabelNodeImport | BabelNodeBigIntLiteral | BabelNodeExportNamespaceSpecifier | BabelNodeOptionalMemberExpression | BabelNodeOptionalCallExpression | BabelNodeClassProperty | BabelNodeClassAccessorProperty | BabelNodeClassPrivateProperty | BabelNodeClassPrivateMethod | BabelNodePrivateName | BabelNodeStaticBlock;
-type BabelNodeExpression = BabelNodeArrayExpression | BabelNodeAssignmentExpression | BabelNodeBinaryExpression | BabelNodeCallExpression | BabelNodeConditionalExpression | BabelNodeFunctionExpression | BabelNodeIdentifier | BabelNodeStringLiteral | BabelNodeNumericLiteral | BabelNodeNullLiteral | BabelNodeBooleanLiteral | BabelNodeRegExpLiteral | BabelNodeLogicalExpression | BabelNodeMemberExpression | BabelNodeNewExpression | BabelNodeObjectExpression | BabelNodeSequenceExpression | BabelNodeParenthesizedExpression | BabelNodeThisExpression | BabelNodeUnaryExpression | BabelNodeUpdateExpression | BabelNodeArrowFunctionExpression | BabelNodeClassExpression | BabelNodeMetaProperty | BabelNodeSuper | BabelNodeTaggedTemplateExpression | BabelNodeTemplateLiteral | BabelNodeYieldExpression | BabelNodeAwaitExpression | BabelNodeImport | BabelNodeBigIntLiteral | BabelNodeOptionalMemberExpression | BabelNodeOptionalCallExpression | BabelNodeTypeCastExpression | BabelNodeJSXElement | BabelNodeJSXFragment | BabelNodeBindExpression | BabelNodeDoExpression | BabelNodeRecordExpression | BabelNodeTupleExpression | BabelNodeDecimalLiteral | BabelNodeModuleExpression | BabelNodeTopicReference | BabelNodePipelineTopicExpression | BabelNodePipelineBareFunction | BabelNodePipelinePrimaryTopicReference | BabelNodeTSInstantiationExpression | BabelNodeTSAsExpression | BabelNodeTSSatisfiesExpression | BabelNodeTSTypeAssertion | BabelNodeTSNonNullExpression;
+type BabelNodeStandardized = BabelNodeArrayExpression | BabelNodeAssignmentExpression | BabelNodeBinaryExpression | BabelNodeInterpreterDirective | BabelNodeDirective | BabelNodeDirectiveLiteral | BabelNodeBlockStatement | BabelNodeBreakStatement | BabelNodeCallExpression | BabelNodeCatchClause | BabelNodeConditionalExpression | BabelNodeContinueStatement | BabelNodeDebuggerStatement | BabelNodeDoWhileStatement | BabelNodeEmptyStatement | BabelNodeExpressionStatement | BabelNodeFile | BabelNodeForInStatement | BabelNodeForStatement | BabelNodeFunctionDeclaration | BabelNodeFunctionExpression | BabelNodeIdentifier | BabelNodeIfStatement | BabelNodeLabeledStatement | BabelNodeStringLiteral | BabelNodeNumericLiteral | BabelNodeNullLiteral | BabelNodeBooleanLiteral | BabelNodeRegExpLiteral | BabelNodeLogicalExpression | BabelNodeMemberExpression | BabelNodeNewExpression | BabelNodeProgram | BabelNodeObjectExpression | BabelNodeObjectMethod | BabelNodeObjectProperty | BabelNodeRestElement | BabelNodeReturnStatement | BabelNodeSequenceExpression | BabelNodeParenthesizedExpression | BabelNodeSwitchCase | BabelNodeSwitchStatement | BabelNodeThisExpression | BabelNodeThrowStatement | BabelNodeTryStatement | BabelNodeUnaryExpression | BabelNodeUpdateExpression | BabelNodeVariableDeclaration | BabelNodeVariableDeclarator | BabelNodeWhileStatement | BabelNodeWithStatement | BabelNodeAssignmentPattern | BabelNodeArrayPattern | BabelNodeArrowFunctionExpression | BabelNodeClassBody | BabelNodeClassExpression | BabelNodeClassDeclaration | BabelNodeExportAllDeclaration | BabelNodeExportDefaultDeclaration | BabelNodeExportNamedDeclaration | BabelNodeExportSpecifier | BabelNodeForOfStatement | BabelNodeImportDeclaration | BabelNodeImportDefaultSpecifier | BabelNodeImportNamespaceSpecifier | BabelNodeImportSpecifier | BabelNodeImportExpression | BabelNodeMetaProperty | BabelNodeClassMethod | BabelNodeObjectPattern | BabelNodeSpreadElement | BabelNodeSuper | BabelNodeTaggedTemplateExpression | BabelNodeTemplateElement | BabelNodeTemplateLiteral | BabelNodeYieldExpression | BabelNodeAwaitExpression | BabelNodeImport | BabelNodeBigIntLiteral | BabelNodeExportNamespaceSpecifier | BabelNodeOptionalMemberExpression | BabelNodeOptionalCallExpression | BabelNodeClassProperty | BabelNodeClassAccessorProperty | BabelNodeClassPrivateProperty | BabelNodeClassPrivateMethod | BabelNodePrivateName | BabelNodeStaticBlock;
+type BabelNodeExpression = BabelNodeArrayExpression | BabelNodeAssignmentExpression | BabelNodeBinaryExpression | BabelNodeCallExpression | BabelNodeConditionalExpression | BabelNodeFunctionExpression | BabelNodeIdentifier | BabelNodeStringLiteral | BabelNodeNumericLiteral | BabelNodeNullLiteral | BabelNodeBooleanLiteral | BabelNodeRegExpLiteral | BabelNodeLogicalExpression | BabelNodeMemberExpression | BabelNodeNewExpression | BabelNodeObjectExpression | BabelNodeSequenceExpression | BabelNodeParenthesizedExpression | BabelNodeThisExpression | BabelNodeUnaryExpression | BabelNodeUpdateExpression | BabelNodeArrowFunctionExpression | BabelNodeClassExpression | BabelNodeImportExpression | BabelNodeMetaProperty | BabelNodeSuper | BabelNodeTaggedTemplateExpression | BabelNodeTemplateLiteral | BabelNodeYieldExpression | BabelNodeAwaitExpression | BabelNodeImport | BabelNodeBigIntLiteral | BabelNodeOptionalMemberExpression | BabelNodeOptionalCallExpression | BabelNodeTypeCastExpression | BabelNodeJSXElement | BabelNodeJSXFragment | BabelNodeBindExpression | BabelNodeDoExpression | BabelNodeRecordExpression | BabelNodeTupleExpression | BabelNodeDecimalLiteral | BabelNodeModuleExpression | BabelNodeTopicReference | BabelNodePipelineTopicExpression | BabelNodePipelineBareFunction | BabelNodePipelinePrimaryTopicReference | BabelNodeTSInstantiationExpression | BabelNodeTSAsExpression | BabelNodeTSSatisfiesExpression | BabelNodeTSTypeAssertion | BabelNodeTSNonNullExpression;
 type BabelNodeBinary = BabelNodeBinaryExpression | BabelNodeLogicalExpression;
 type BabelNodeScopable = BabelNodeBlockStatement | BabelNodeCatchClause | BabelNodeDoWhileStatement | BabelNodeForInStatement | BabelNodeForStatement | BabelNodeFunctionDeclaration | BabelNodeFunctionExpression | BabelNodeProgram | BabelNodeObjectMethod | BabelNodeSwitchStatement | BabelNodeWhileStatement | BabelNodeArrowFunctionExpression | BabelNodeClassExpression | BabelNodeClassDeclaration | BabelNodeForOfStatement | BabelNodeClassMethod | BabelNodeClassPrivateMethod | BabelNodeStaticBlock | BabelNodeTSModuleBlock;
 type BabelNodeBlockParent = BabelNodeBlockStatement | BabelNodeCatchClause | BabelNodeDoWhileStatement | BabelNodeForInStatement | BabelNodeForStatement | BabelNodeFunctionDeclaration | BabelNodeFunctionExpression | BabelNodeProgram | BabelNodeObjectMethod | BabelNodeSwitchStatement | BabelNodeWhileStatement | BabelNodeArrowFunctionExpression | BabelNodeForOfStatement | BabelNodeClassMethod | BabelNodeClassPrivateMethod | BabelNodeStaticBlock | BabelNodeTSModuleBlock;
@@ -1672,7 +1680,7 @@ type BabelNodeModuleDeclaration = BabelNodeExportAllDeclaration | BabelNodeExpor
 
 declare module "@babel/types" {
   declare export function arrayExpression(elements?: Array<null | BabelNodeExpression | BabelNodeSpreadElement>): BabelNodeArrayExpression;
-  declare export function assignmentExpression(operator: string, left: BabelNodeLVal, right: BabelNodeExpression): BabelNodeAssignmentExpression;
+  declare export function assignmentExpression(operator: string, left: BabelNodeLVal | BabelNodeOptionalMemberExpression, right: BabelNodeExpression): BabelNodeAssignmentExpression;
   declare export function binaryExpression(operator: "+" | "-" | "/" | "%" | "*" | "**" | "&" | "|" | ">>" | ">>>" | "<<" | "^" | "==" | "===" | "!=" | "!==" | "in" | "instanceof" | ">" | "<" | ">=" | "<=" | "|>", left: BabelNodeExpression | BabelNodePrivateName, right: BabelNodeExpression): BabelNodeBinaryExpression;
   declare export function interpreterDirective(value: string): BabelNodeInterpreterDirective;
   declare export function directive(value: BabelNodeDirectiveLiteral): BabelNodeDirective;
@@ -1737,6 +1745,7 @@ declare module "@babel/types" {
   declare export function importDefaultSpecifier(local: BabelNodeIdentifier): BabelNodeImportDefaultSpecifier;
   declare export function importNamespaceSpecifier(local: BabelNodeIdentifier): BabelNodeImportNamespaceSpecifier;
   declare export function importSpecifier(local: BabelNodeIdentifier, imported: BabelNodeIdentifier | BabelNodeStringLiteral): BabelNodeImportSpecifier;
+  declare export function importExpression(source: BabelNodeExpression, options?: BabelNodeExpression): BabelNodeImportExpression;
   declare export function metaProperty(meta: BabelNodeIdentifier, property: BabelNodeIdentifier): BabelNodeMetaProperty;
   declare export function classMethod(kind?: "get" | "set" | "method" | "constructor", key: BabelNodeIdentifier | BabelNodeStringLiteral | BabelNodeNumericLiteral | BabelNodeBigIntLiteral | BabelNodeExpression, params: Array<BabelNodeIdentifier | BabelNodePattern | BabelNodeRestElement | BabelNodeTSParameterProperty>, body: BabelNodeBlockStatement, computed?: boolean, _static?: boolean, generator?: boolean, async?: boolean): BabelNodeClassMethod;
   declare export function objectPattern(properties: Array<BabelNodeRestElement | BabelNodeObjectProperty>): BabelNodeObjectPattern;
@@ -2054,6 +2063,8 @@ declare module "@babel/types" {
   declare export function assertImportNamespaceSpecifier(node: ?Object, opts?: ?Object): void
   declare export function isImportSpecifier(node: ?Object, opts?: ?Object): boolean %checks (node instanceof BabelNodeImportSpecifier)
   declare export function assertImportSpecifier(node: ?Object, opts?: ?Object): void
+  declare export function isImportExpression(node: ?Object, opts?: ?Object): boolean %checks (node instanceof BabelNodeImportExpression)
+  declare export function assertImportExpression(node: ?Object, opts?: ?Object): void
   declare export function isMetaProperty(node: ?Object, opts?: ?Object): boolean %checks (node instanceof BabelNodeMetaProperty)
   declare export function assertMetaProperty(node: ?Object, opts?: ?Object): void
   declare export function isClassMethod(node: ?Object, opts?: ?Object): boolean %checks (node instanceof BabelNodeClassMethod)
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/lib/validators/generated/index.js b/tools/node_modules/eslint/node_modules/@babel/types/lib/validators/generated/index.js
index d346ee694cc184..6f8ae4c8d128c9 100644
--- a/tools/node_modules/eslint/node_modules/@babel/types/lib/validators/generated/index.js
+++ b/tools/node_modules/eslint/node_modules/@babel/types/lib/validators/generated/index.js
@@ -108,6 +108,7 @@ exports.isImport = isImport;
 exports.isImportAttribute = isImportAttribute;
 exports.isImportDeclaration = isImportDeclaration;
 exports.isImportDefaultSpecifier = isImportDefaultSpecifier;
+exports.isImportExpression = isImportExpression;
 exports.isImportNamespaceSpecifier = isImportNamespaceSpecifier;
 exports.isImportOrExportDeclaration = isImportOrExportDeclaration;
 exports.isImportSpecifier = isImportSpecifier;
@@ -638,6 +639,11 @@ function isImportSpecifier(node, opts) {
   if (node.type !== "ImportSpecifier") return false;
   return opts == null || (0, _shallowEqual.default)(node, opts);
 }
+function isImportExpression(node, opts) {
+  if (!node) return false;
+  if (node.type !== "ImportExpression") return false;
+  return opts == null || (0, _shallowEqual.default)(node, opts);
+}
 function isMetaProperty(node, opts) {
   if (!node) return false;
   if (node.type !== "MetaProperty") return false;
@@ -1622,6 +1628,7 @@ function isStandardized(node, opts) {
     case "ImportDefaultSpecifier":
     case "ImportNamespaceSpecifier":
     case "ImportSpecifier":
+    case "ImportExpression":
     case "MetaProperty":
     case "ClassMethod":
     case "ObjectPattern":
@@ -1686,6 +1693,7 @@ function isExpression(node, opts) {
     case "UpdateExpression":
     case "ArrowFunctionExpression":
     case "ClassExpression":
+    case "ImportExpression":
     case "MetaProperty":
     case "Super":
     case "TaggedTemplateExpression":
diff --git a/tools/node_modules/eslint/node_modules/@babel/types/package.json b/tools/node_modules/eslint/node_modules/@babel/types/package.json
index 5bd9c9ba3466bf..4acb0bf1799da6 100644
--- a/tools/node_modules/eslint/node_modules/@babel/types/package.json
+++ b/tools/node_modules/eslint/node_modules/@babel/types/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@babel/types",
-  "version": "7.22.17",
+  "version": "7.23.0",
   "description": "Babel Types is a Lodash-esque utility library for AST nodes",
   "author": "The Babel Team (https://babel.dev/team)",
   "homepage": "https://babel.dev/docs/en/next/babel-types",
@@ -25,12 +25,12 @@
   },
   "dependencies": {
     "@babel/helper-string-parser": "^7.22.5",
-    "@babel/helper-validator-identifier": "^7.22.15",
+    "@babel/helper-validator-identifier": "^7.22.20",
     "to-fast-properties": "^2.0.0"
   },
   "devDependencies": {
-    "@babel/generator": "^7.22.15",
-    "@babel/parser": "^7.22.16",
+    "@babel/generator": "^7.23.0",
+    "@babel/parser": "^7.23.0",
     "glob": "^7.2.0"
   },
   "engines": {
diff --git a/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/index.js b/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/index.js
index 9f6d71e90102f8..956ba7d82d3fbd 100644
--- a/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/index.js
+++ b/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/index.js
@@ -45,10 +45,10 @@ function isLargeIdContinue(cp) {
     return isInRange(cp, largeIdContinueRanges !== null && largeIdContinueRanges !== void 0 ? largeIdContinueRanges : (largeIdContinueRanges = initLargeIdContinueRanges()));
 }
 function initLargeIdStartRanges() {
-    return restoreRanges("4q 0 b 0 5 0 6 m 2 u 2 cp 5 b f 4 8 0 2 0 3m 4 2 1 3 3 2 0 7 0 2 2 2 0 2 j 2 2a 2 3u 9 4l 2 11 3 0 7 14 20 q 5 3 1a 16 10 1 2 2q 2 0 g 1 8 1 b 2 3 0 h 0 2 t u 2g c 0 p w a 1 5 0 6 l 5 0 a 0 4 0 o o 8 a 6 n 2 5 i 15 1n 1h 4 0 j 0 8 9 g f 5 7 3 1 3 l 2 6 2 0 4 3 4 0 h 0 e 1 2 2 f 1 b 0 9 5 5 1 3 l 2 6 2 1 2 1 2 1 w 3 2 0 k 2 h 8 2 2 2 l 2 6 2 1 2 4 4 0 j 0 g 1 o 0 c 7 3 1 3 l 2 6 2 1 2 4 4 0 v 1 2 2 g 0 i 0 2 5 4 2 2 3 4 1 2 0 2 1 4 1 4 2 4 b n 0 1h 7 2 2 2 m 2 f 4 0 r 2 3 0 3 1 v 0 5 7 2 2 2 m 2 9 2 4 4 0 w 1 2 1 g 1 i 8 2 2 2 14 3 0 h 0 6 2 9 2 p 5 6 h 4 n 2 8 2 0 3 6 1n 1b 2 1 d 6 1n 1 2 0 2 4 2 n 2 0 2 9 2 1 a 0 3 4 2 0 m 3 x 0 1s 7 2 z s 4 38 16 l 0 h 5 5 3 4 0 4 1 8 2 5 c d 0 i 11 2 0 6 0 3 16 2 98 2 3 3 6 2 0 2 3 3 14 2 3 3 w 2 3 3 6 2 0 2 3 3 e 2 1k 2 3 3 1u 12 f h 2d 3 5 4 h7 3 g 2 p 6 22 4 a 8 h e i f h f c 2 2 g 1f 10 0 5 0 1w 2g 8 14 2 0 6 1x b u 1e t 3 4 c 17 5 p 1j m a 1g 2b 0 2m 1a i 7 1j t e 1 b 17 r z 16 2 b z 3 8 8 16 3 2 16 3 2 5 2 1 4 0 6 5b 1t 7p 3 5 3 11 3 5 3 7 2 0 2 0 2 0 2 u 3 1g 2 6 2 0 4 2 2 6 4 3 3 5 5 c 6 2 2 6 39 0 e 0 h c 2u 0 5 0 3 9 2 0 3 5 7 0 2 0 2 0 2 f 3 3 6 4 5 0 i 14 22g 6c 7 3 4 1 d 11 2 0 6 0 3 1j 8 0 h m a 6 2 6 2 6 2 6 2 6 2 6 2 6 2 6 fb 2 q 8 8 4 3 4 5 2d 5 4 2 2h 2 3 6 16 2 2l i v 1d f e9 533 1t h3g 1w 19 3 7g 4 f b 1 l 1a h u 3 27 14 8 3 2u 3 1r 6 1 2 0 2 4 p f 2 2 2 3 2 m u 1f f 1d 1r 5 4 0 2 1 c r b m q s 8 1a t 0 h 4 2 9 b 4 2 14 o 2 2 7 l m 4 0 4 1d 2 0 4 1 3 4 3 0 2 0 p 2 3 a 8 2 d 5 3 5 3 5 a 6 2 6 2 16 2 d 7 36 u 8mb d m 5 1c 6it a5 3 2x 13 6 d 4 6 0 2 9 2 c 2 4 2 0 2 1 2 1 2 2z y a2 j 1r 3 1h 15 b 39 4 2 3q 11 p 7 p c 2g 4 5 3 5 3 5 3 2 10 b 2 p 2 i 2 1 2 e 3 d z 3e 1y 1g 7g s 4 1c 1c v e t 6 11 b t 3 z 5 7 2 4 17 4d j z 5 z 5 13 9 1f d a 2 e 2 6 2 1 2 a 2 e 2 6 2 1 1w 8m a l b 7 p 5 2 15 2 8 1y 5 3 0 2 17 2 1 4 0 3 m b m a u 1u i 2 1 b l b p 1z 1j 7 1 1t 0 g 3 2 2 2 s 17 s 4 s 10 7 2 r s 1h b l b i e h 33 20 1k 1e e 1e e z 9p 15 7 1 27 s b 0 9 l 17 h 1b k s m d 1g 1m 1 3 0 e 18 x o r z u 0 3 0 9 y 4 0 d 1b f 3 m 0 2 0 10 h 2 o k 1 1s 6 2 0 2 3 2 e 2 9 8 1a 13 7 3 1 3 l 2 6 2 1 2 4 4 0 j 0 d 4 4f 1g j 3 l 2 v 1b l 1 2 0 55 1a 16 3 11 1b l 0 1o 16 e 0 20 q 12 6 56 17 39 1r w 7 3 0 3 7 2 1 2 n g 0 2 0 2n 7 3 12 h 0 2 0 t 0 b 13 8 0 m 0 c 19 k 0 j 20 7c 8 2 10 i 0 1e t 35 6 2 1 2 11 m 0 q 5 2 1 2 v f 0 94 i g 0 2 c 2 x 3h 0 28 pl 2v 32 i 5f 219 2o g tr i 5 33u g6 6nu fs 8 u i 26 i t j 1b h 3 w k 6 i j5 1r 3l 22 6 0 1v c 1t 1 2 0 t 4qf 9 yd 17 8 6w8 3 2 6 2 1 2 82 g 0 u 2 3 0 f 3 9 az 1s5 2y 6 c 4 8 8 9 4mf 2c 2 1y 2 1 3 0 3 1 3 3 2 b 2 0 2 6 2 1s 2 3 3 7 2 6 2 r 2 3 2 4 2 0 4 6 2 9f 3 o 2 o 2 u 2 o 2 u 2 o 2 u 2 o 2 u 2 o 2 7 1f9 u 7 5 7a 1p 43 18 b 6 h 0 8y t j 17 dh r l1 6 2 3 2 1 2 e 2 5g 1o 1v 8 0 xh 3 2 q 2 1 2 0 3 0 2 9 2 3 2 0 2 0 7 0 5 0 2 0 2 0 2 2 2 1 2 0 3 0 2 0 2 0 2 0 2 0 2 1 2 0 3 3 2 6 2 3 2 3 2 0 2 9 2 g 6 2 2 4 2 g 3et wyn x 37d 7 65 3 4g1 f 5rk 2e8 f1 15v 3t6 6 38f");
+    return restoreRanges("4q 0 b 0 5 0 6 m 2 u 2 cp 5 b f 4 8 0 2 0 3m 4 2 1 3 3 2 0 7 0 2 2 2 0 2 j 2 2a 2 3u 9 4l 2 11 3 0 7 14 20 q 5 3 1a 16 10 1 2 2q 2 0 g 1 8 1 b 2 3 0 h 0 2 t u 2g c 0 p w a 1 5 0 6 l 5 0 a 0 4 0 o o 8 a 6 n 2 5 i 15 1n 1h 4 0 j 0 8 9 g f 5 7 3 1 3 l 2 6 2 0 4 3 4 0 h 0 e 1 2 2 f 1 b 0 9 5 5 1 3 l 2 6 2 1 2 1 2 1 w 3 2 0 k 2 h 8 2 2 2 l 2 6 2 1 2 4 4 0 j 0 g 1 o 0 c 7 3 1 3 l 2 6 2 1 2 4 4 0 v 1 2 2 g 0 i 0 2 5 4 2 2 3 4 1 2 0 2 1 4 1 4 2 4 b n 0 1h 7 2 2 2 m 2 f 4 0 r 2 3 0 3 1 v 0 5 7 2 2 2 m 2 9 2 4 4 0 w 1 2 1 g 1 i 8 2 2 2 14 3 0 h 0 6 2 9 2 p 5 6 h 4 n 2 8 2 0 3 6 1n 1b 2 1 d 6 1n 1 2 0 2 4 2 n 2 0 2 9 2 1 a 0 3 4 2 0 m 3 x 0 1s 7 2 z s 4 38 16 l 0 h 5 5 3 4 0 4 1 8 2 5 c d 0 i 11 2 0 6 0 3 16 2 98 2 3 3 6 2 0 2 3 3 14 2 3 3 w 2 3 3 6 2 0 2 3 3 e 2 1k 2 3 3 1u 12 f h 2d 3 5 4 h7 3 g 2 p 6 22 4 a 8 h e i f h f c 2 2 g 1f 10 0 5 0 1w 2g 8 14 2 0 6 1x b u 1e t 3 4 c 17 5 p 1j m a 1g 2b 0 2m 1a i 7 1j t e 1 b 17 r z 16 2 b z 3 8 8 16 3 2 16 3 2 5 2 1 4 0 6 5b 1t 7p 3 5 3 11 3 5 3 7 2 0 2 0 2 0 2 u 3 1g 2 6 2 0 4 2 2 6 4 3 3 5 5 c 6 2 2 6 39 0 e 0 h c 2u 0 5 0 3 9 2 0 3 5 7 0 2 0 2 0 2 f 3 3 6 4 5 0 i 14 22g 6c 7 3 4 1 d 11 2 0 6 0 3 1j 8 0 h m a 6 2 6 2 6 2 6 2 6 2 6 2 6 2 6 fb 2 q 8 8 4 3 4 5 2d 5 4 2 2h 2 3 6 16 2 2l i v 1d f e9 533 1t h3g 1w 19 3 7g 4 f b 1 l 1a h u 3 27 14 8 3 2u 3 1r 6 1 2 0 2 4 p f 2 2 2 3 2 m u 1f f 1d 1r 5 4 0 2 1 c r b m q s 8 1a t 0 h 4 2 9 b 4 2 14 o 2 2 7 l m 4 0 4 1d 2 0 4 1 3 4 3 0 2 0 p 2 3 a 8 2 d 5 3 5 3 5 a 6 2 6 2 16 2 d 7 36 u 8mb d m 5 1c 6it a5 3 2x 13 6 d 4 6 0 2 9 2 c 2 4 2 0 2 1 2 1 2 2z y a2 j 1r 3 1h 15 b 39 4 2 3q 11 p 7 p c 2g 4 5 3 5 3 5 3 2 10 b 2 p 2 i 2 1 2 e 3 d z 3e 1y 1g 7g s 4 1c 1c v e t 6 11 b t 3 z 5 7 2 4 17 4d j z 5 z 5 13 9 1f d a 2 e 2 6 2 1 2 a 2 e 2 6 2 1 1w 8m a l b 7 p 5 2 15 2 8 1y 5 3 0 2 17 2 1 4 0 3 m b m a u 1u i 2 1 b l b p 1z 1j 7 1 1t 0 g 3 2 2 2 s 17 s 4 s 10 7 2 r s 1h b l b i e h 33 20 1k 1e e 1e e z 9p 15 7 1 27 s b 0 9 l 17 h 1b k s m d 1g 1m 1 3 0 e 18 x o r z u 0 3 0 9 y 4 0 d 1b f 3 m 0 2 0 10 h 2 o k 1 1s 6 2 0 2 3 2 e 2 9 8 1a 13 7 3 1 3 l 2 6 2 1 2 4 4 0 j 0 d 4 4f 1g j 3 l 2 v 1b l 1 2 0 55 1a 16 3 11 1b l 0 1o 16 e 0 20 q 12 6 56 17 39 1r w 7 3 0 3 7 2 1 2 n g 0 2 0 2n 7 3 12 h 0 2 0 t 0 b 13 8 0 m 0 c 19 k 0 j 20 7c 8 2 10 i 0 1e t 35 6 2 1 2 11 m 0 q 5 2 1 2 v f 0 94 i g 0 2 c 2 x 3h 0 28 pl 2v 32 i 5f 219 2o g tr i 5 33u g6 6nu fs 8 u i 26 i t j 1b h 3 w k 6 i j5 1r 3l 22 6 0 1v c 1t 1 2 0 t 4qf 9 yd 17 8 6w8 3 2 6 2 1 2 82 g 0 u 2 3 0 f 3 9 az 1s5 2y 6 c 4 8 8 9 4mf 2c 2 1y 2 1 3 0 3 1 3 3 2 b 2 0 2 6 2 1s 2 3 3 7 2 6 2 r 2 3 2 4 2 0 4 6 2 9f 3 o 2 o 2 u 2 o 2 u 2 o 2 u 2 o 2 u 2 o 2 7 1f9 u 7 5 7a 1p 43 18 b 6 h 0 8y t j 17 dh r l1 6 2 3 2 1 2 e 2 5g 1o 1v 8 0 xh 3 2 q 2 1 2 0 3 0 2 9 2 3 2 0 2 0 7 0 5 0 2 0 2 0 2 2 2 1 2 0 3 0 2 0 2 0 2 0 2 0 2 1 2 0 3 3 2 6 2 3 2 3 2 0 2 9 2 g 6 2 2 4 2 g 3et wyn x 37d 7 65 3 4g1 f 5rk g h9 1wj f1 15v 3t6 6 38f");
 }
 function initLargeIdContinueRanges() {
-    return restoreRanges("53 0 g9 33 o 0 70 4 7e 18 2 0 2 1 2 1 2 0 21 a 1d u 7 0 2u 6 3 5 3 1 2 3 3 9 o 0 v q 2k a g 9 y 8 a 0 p 3 2 8 2 2 2 4 18 2 1p 7 17 n 2 w 1j 2 2 h 2 6 b 1 3 9 i 2 1l 0 2 6 3 1 3 2 a 0 b 1 3 9 f 0 3 2 1l 0 2 4 5 1 3 2 4 0 l b 4 0 c 2 1l 0 2 7 2 2 2 2 l 1 3 9 b 5 2 2 1l 0 2 6 3 1 3 2 8 2 b 1 3 9 j 0 1o 4 4 2 2 3 a 0 f 9 h 4 1k 0 2 6 2 2 2 3 8 1 c 1 3 9 i 2 1l 0 2 6 2 2 2 3 8 1 c 1 3 9 4 0 d 3 1k 1 2 6 2 2 2 3 a 0 b 1 3 9 i 2 1z 0 5 5 2 0 2 7 7 9 3 1 1q 0 3 6 d 7 2 9 2g 0 3 8 c 6 2 9 1r 1 7 9 c 0 2 0 2 0 5 1 1e j 2 1 6 a 2 z a 0 2t j 2 9 d 3 5 2 2 2 3 6 4 3 e b 2 e jk 2 a 8 pt 3 t 2 u 1 v 1 1t v a 0 3 9 y 2 2 a 40 0 3b b 5 b b 9 3l a 1p 4 1m 9 2 s 3 a 7 9 n d 2 f 1e 4 1c g c 9 i 8 d 2 v c 3 9 19 d 1d j 9 9 7 9 3b 2 2 k 5 0 7 0 3 2 5j 1r g0 1 k 0 3g c 5 0 4 b 2db 2 3y 0 2p v ff 5 2y 1 n7q 9 1y 0 5 9 x 1 29 1 7l 0 4 0 5 0 o 4 5 0 2c 1 1f h b 9 7 h e a t 7 q c 19 3 1c d g 9 c 0 b 9 1c d d 0 9 1 3 9 y 2 1f 0 2 2 3 1 6 1 2 0 16 4 6 1 6l 7 2 1 3 9 fmt 0 ki f h f 4 1 p 2 5d 9 12 0 ji 0 6b 0 46 4 86 9 120 2 2 1 6 3 15 2 5 0 4m 1 fy 3 9 9 aa 1 29 2 1z a 1e 3 3f 2 1i e w a 3 1 b 3 1a a 8 0 1a 9 7 2 11 d 2 9 6 1 19 0 d 2 1d d 9 3 2 b 2b b 7 0 3 0 4e b 6 9 7 3 1k 1 2 6 3 1 3 2 a 0 b 1 3 6 4 4 5d h a 9 5 0 2a j d 9 5y 6 3 8 s 1 2b g g 9 2a c 9 9 2c e 5 9 6r e 4m 9 1z 5 2 1 3 3 2 0 2 1 d 9 3c 6 3 6 4 0 t 9 15 6 2 3 9 0 a a 1b f ba 7 2 7 h 9 1l l 2 d 3f 5 4 0 2 1 2 6 2 0 9 9 1d 4 2 1 2 4 9 9 96 3 a 1 2 0 1d 6 4 4 e 9 44n 0 7 e aob 9 2f 9 13 4 1o 6 q 9 s6 0 2 1i 8 3 2a 0 c 1 f58 1 3mq 19 3 m f3 4 4 5 9 7 3 6 v 3 45 2 13e 1d e9 1i 5 1d 9 0 f 0 n 4 2 e 11t 6 2 g 3 6 2 1 2 4 2t 0 4h 6 a 9 9x 0 1q d dv d rb 6 32 6 6 9 3o7 9 gvt3 6n");
+    return restoreRanges("53 0 g9 33 o 0 70 4 7e 18 2 0 2 1 2 1 2 0 21 a 1d u 7 0 2u 6 3 5 3 1 2 3 3 9 o 0 v q 2k a g 9 y 8 a 0 p 3 2 8 2 2 2 4 18 2 1p 7 17 n 2 w 1j 2 2 h 2 6 b 1 3 9 i 2 1l 0 2 6 3 1 3 2 a 0 b 1 3 9 f 0 3 2 1l 0 2 4 5 1 3 2 4 0 l b 4 0 c 2 1l 0 2 7 2 2 2 2 l 1 3 9 b 5 2 2 1l 0 2 6 3 1 3 2 8 2 b 1 3 9 j 0 1o 4 4 2 2 3 a 0 f 9 h 4 1k 0 2 6 2 2 2 3 8 1 c 1 3 9 i 2 1l 0 2 6 2 2 2 3 8 1 c 1 3 9 4 0 d 3 1k 1 2 6 2 2 2 3 a 0 b 1 3 9 i 2 1z 0 5 5 2 0 2 7 7 9 3 1 1q 0 3 6 d 7 2 9 2g 0 3 8 c 6 2 9 1r 1 7 9 c 0 2 0 2 0 5 1 1e j 2 1 6 a 2 z a 0 2t j 2 9 d 3 5 2 2 2 3 6 4 3 e b 2 e jk 2 a 8 pt 3 t 2 u 1 v 1 1t v a 0 3 9 y 2 2 a 40 0 3b b 5 b b 9 3l a 1p 4 1m 9 2 s 3 a 7 9 n d 2 f 1e 4 1c g c 9 i 8 d 2 v c 3 9 19 d 1d j 9 9 7 9 3b 2 2 k 5 0 7 0 3 2 5j 1r el 1 1e 1 k 0 3g c 5 0 4 b 2db 2 3y 0 2p v ff 5 2y 1 2p 0 n51 9 1y 0 5 9 x 1 29 1 7l 0 4 0 5 0 o 4 5 0 2c 1 1f h b 9 7 h e a t 7 q c 19 3 1c d g 9 c 0 b 9 1c d d 0 9 1 3 9 y 2 1f 0 2 2 3 1 6 1 2 0 16 4 6 1 6l 7 2 1 3 9 fmt 0 ki f h f 4 1 p 2 5d 9 12 0 12 0 ig 0 6b 0 46 4 86 9 120 2 2 1 6 3 15 2 5 0 4m 1 fy 3 9 9 aa 1 29 2 1z a 1e 3 3f 2 1i e w a 3 1 b 3 1a a 8 0 1a 9 7 2 11 d 2 9 6 1 19 0 d 2 1d d 9 3 2 b 2b b 7 0 3 0 4e b 6 9 7 3 1k 1 2 6 3 1 3 2 a 0 b 1 3 6 4 4 5d h a 9 5 0 2a j d 9 5y 6 3 8 s 1 2b g g 9 2a c 9 9 2c e 5 9 6r e 4m 9 1z 5 2 1 3 3 2 0 2 1 d 9 3c 6 3 6 4 0 t 9 15 6 2 3 9 0 a a 1b f ba 7 2 7 h 9 1l l 2 d 3f 5 4 0 2 1 2 6 2 0 9 9 1d 4 2 1 2 4 9 9 96 3 a 1 2 0 1d 6 4 4 e 9 44n 0 7 e aob 9 2f 9 13 4 1o 6 q 9 s6 0 2 1i 8 3 2a 0 c 1 f58 1 3mq 19 3 m f3 4 4 5 9 7 3 6 v 3 45 2 13e 1d e9 1i 5 1d 9 0 f 0 n 4 2 e 11t 6 2 g 3 6 2 1 2 4 2t 0 4h 6 a 9 9x 0 1q d dv d rb 6 32 6 6 9 3o7 9 gvt3 6n");
 }
 function isInRange(cp, ranges) {
     let l = 0, r = (ranges.length / 2) | 0, i = 0, min = 0, max = 0;
@@ -117,6 +117,7 @@ const scNameSet = new Set(["Script", "Script_Extensions", "sc", "scx"]);
 const gcValueSets = new DataSet("C Cased_Letter Cc Cf Close_Punctuation Cn Co Combining_Mark Connector_Punctuation Control Cs Currency_Symbol Dash_Punctuation Decimal_Number Enclosing_Mark Final_Punctuation Format Initial_Punctuation L LC Letter Letter_Number Line_Separator Ll Lm Lo Lowercase_Letter Lt Lu M Mark Math_Symbol Mc Me Mn Modifier_Letter Modifier_Symbol N Nd Nl No Nonspacing_Mark Number Open_Punctuation Other Other_Letter Other_Number Other_Punctuation Other_Symbol P Paragraph_Separator Pc Pd Pe Pf Pi Po Private_Use Ps Punctuation S Sc Separator Sk Sm So Space_Separator Spacing_Mark Surrogate Symbol Titlecase_Letter Unassigned Uppercase_Letter Z Zl Zp Zs cntrl digit punct", "", "", "", "", "", "");
 const scValueSets = new DataSet("Adlam Adlm Aghb Ahom Anatolian_Hieroglyphs Arab Arabic Armenian Armi Armn Avestan Avst Bali Balinese Bamu Bamum Bass Bassa_Vah Batak Batk Beng Bengali Bhaiksuki Bhks Bopo Bopomofo Brah Brahmi Brai Braille Bugi Buginese Buhd Buhid Cakm Canadian_Aboriginal Cans Cari Carian Caucasian_Albanian Chakma Cham Cher Cherokee Common Copt Coptic Cprt Cuneiform Cypriot Cyrillic Cyrl Deseret Deva Devanagari Dsrt Dupl Duployan Egyp Egyptian_Hieroglyphs Elba Elbasan Ethi Ethiopic Geor Georgian Glag Glagolitic Gonm Goth Gothic Gran Grantha Greek Grek Gujarati Gujr Gurmukhi Guru Han Hang Hangul Hani Hano Hanunoo Hatr Hatran Hebr Hebrew Hira Hiragana Hluw Hmng Hung Imperial_Aramaic Inherited Inscriptional_Pahlavi Inscriptional_Parthian Ital Java Javanese Kaithi Kali Kana Kannada Katakana Kayah_Li Khar Kharoshthi Khmer Khmr Khoj Khojki Khudawadi Knda Kthi Lana Lao Laoo Latin Latn Lepc Lepcha Limb Limbu Lina Linb Linear_A Linear_B Lisu Lyci Lycian Lydi Lydian Mahajani Mahj Malayalam Mand Mandaic Mani Manichaean Marc Marchen Masaram_Gondi Meetei_Mayek Mend Mende_Kikakui Merc Mero Meroitic_Cursive Meroitic_Hieroglyphs Miao Mlym Modi Mong Mongolian Mro Mroo Mtei Mult Multani Myanmar Mymr Nabataean Narb Nbat New_Tai_Lue Newa Nko Nkoo Nshu Nushu Ogam Ogham Ol_Chiki Olck Old_Hungarian Old_Italic Old_North_Arabian Old_Permic Old_Persian Old_South_Arabian Old_Turkic Oriya Orkh Orya Osage Osge Osma Osmanya Pahawh_Hmong Palm Palmyrene Pau_Cin_Hau Pauc Perm Phag Phags_Pa Phli Phlp Phnx Phoenician Plrd Prti Psalter_Pahlavi Qaac Qaai Rejang Rjng Runic Runr Samaritan Samr Sarb Saur Saurashtra Sgnw Sharada Shavian Shaw Shrd Sidd Siddham SignWriting Sind Sinh Sinhala Sora Sora_Sompeng Soyo Soyombo Sund Sundanese Sylo Syloti_Nagri Syrc Syriac Tagalog Tagb Tagbanwa Tai_Le Tai_Tham Tai_Viet Takr Takri Tale Talu Tamil Taml Tang Tangut Tavt Telu Telugu Tfng Tglg Thaa Thaana Thai Tibetan Tibt Tifinagh Tirh Tirhuta Ugar Ugaritic Vai Vaii Wara Warang_Citi Xpeo Xsux Yi Yiii Zanabazar_Square Zanb Zinh Zyyy", "Dogr Dogra Gong Gunjala_Gondi Hanifi_Rohingya Maka Makasar Medefaidrin Medf Old_Sogdian Rohg Sogd Sogdian Sogo", "Elym Elymaic Hmnp Nand Nandinagari Nyiakeng_Puachue_Hmong Wancho Wcho", "Chorasmian Chrs Diak Dives_Akuru Khitan_Small_Script Kits Yezi Yezidi", "Cpmn Cypro_Minoan Old_Uyghur Ougr Tangsa Tnsa Toto Vith Vithkuqi", "Hrkt Katakana_Or_Hiragana Kawi Nag_Mundari Nagm Unknown Zzzz", "");
 const binPropertySets = new DataSet("AHex ASCII ASCII_Hex_Digit Alpha Alphabetic Any Assigned Bidi_C Bidi_Control Bidi_M Bidi_Mirrored CI CWCF CWCM CWKCF CWL CWT CWU Case_Ignorable Cased Changes_When_Casefolded Changes_When_Casemapped Changes_When_Lowercased Changes_When_NFKC_Casefolded Changes_When_Titlecased Changes_When_Uppercased DI Dash Default_Ignorable_Code_Point Dep Deprecated Dia Diacritic Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Ext Extender Gr_Base Gr_Ext Grapheme_Base Grapheme_Extend Hex Hex_Digit IDC IDS IDSB IDST IDS_Binary_Operator IDS_Trinary_Operator ID_Continue ID_Start Ideo Ideographic Join_C Join_Control LOE Logical_Order_Exception Lower Lowercase Math NChar Noncharacter_Code_Point Pat_Syn Pat_WS Pattern_Syntax Pattern_White_Space QMark Quotation_Mark RI Radical Regional_Indicator SD STerm Sentence_Terminal Soft_Dotted Term Terminal_Punctuation UIdeo Unified_Ideograph Upper Uppercase VS Variation_Selector White_Space XIDC XIDS XID_Continue XID_Start space", "Extended_Pictographic", "", "EBase EComp EMod EPres ExtPict", "", "", "");
+const binPropertyOfStringsSets = new DataSet("", "", "", "", "", "", "Basic_Emoji Emoji_Keycap_Sequence RGI_Emoji RGI_Emoji_Flag_Sequence RGI_Emoji_Modifier_Sequence RGI_Emoji_Tag_Sequence RGI_Emoji_ZWJ_Sequence");
 function isValidUnicodeProperty(version, name, value) {
     if (gcNameSet.has(name)) {
         return version >= 2018 && gcValueSets.es2018.has(value);
@@ -136,6 +137,9 @@ function isValidLoneUnicodeProperty(version, value) {
         (version >= 2019 && binPropertySets.es2019.has(value)) ||
         (version >= 2021 && binPropertySets.es2021.has(value)));
 }
+function isValidLoneUnicodePropertyOfString(version, value) {
+    return version >= 2024 && binPropertyOfStringsSets.es2024.has(value);
+}
 
 const BACKSPACE = 0x08;
 const CHARACTER_TABULATION = 0x09;
@@ -378,19 +382,6 @@ class RegExpSyntaxError extends SyntaxError {
     }
 }
 
-const binPropertyOfStringSets = new Set([
-    "Basic_Emoji",
-    "Emoji_Keycap_Sequence",
-    "RGI_Emoji_Modifier_Sequence",
-    "RGI_Emoji_Flag_Sequence",
-    "RGI_Emoji_Tag_Sequence",
-    "RGI_Emoji_ZWJ_Sequence",
-    "RGI_Emoji",
-]);
-function isValidLoneUnicodePropertyOfString(version, value) {
-    return version >= 2024 && binPropertyOfStringSets.has(value);
-}
-
 const SYNTAX_CHARACTER = new Set([
     CIRCUMFLEX_ACCENT,
     DOLLAR_SIGN,
@@ -1957,7 +1948,7 @@ class RegExpParserState {
     constructor(options) {
         var _a;
         this._node = DUMMY_PATTERN;
-        this._expressionBuffer = null;
+        this._expressionBufferMap = new Map();
         this._flags = DUMMY_FLAGS;
         this._backreferences = [];
         this._capturingGroups = [];
@@ -2297,19 +2288,21 @@ class RegExpParserState {
         const node = this._node;
         if (node.type !== "CharacterClass" ||
             (node.parent.type !== "Alternative" &&
-                node.parent.type !== "CharacterClass") ||
-            (this._expressionBuffer && node.elements.length > 0)) {
+                node.parent.type !== "CharacterClass")) {
             throw new Error("UnknownError");
         }
         const parent = node.parent;
         node.end = end;
         node.raw = this.source.slice(start, end);
         this._node = parent;
-        const expression = this._expressionBuffer;
-        this._expressionBuffer = null;
+        const expression = this._expressionBufferMap.get(node);
         if (!expression) {
             return;
         }
+        if (node.elements.length > 0) {
+            throw new Error("UnknownError");
+        }
+        this._expressionBufferMap.delete(node);
         const newNode = {
             type: "ExpressionCharacterClass",
             parent,
@@ -2367,7 +2360,7 @@ class RegExpParserState {
             throw new Error("UnknownError");
         }
         const right = parent.elements.pop();
-        const left = (_a = this._expressionBuffer) !== null && _a !== void 0 ? _a : parent.elements.pop();
+        const left = (_a = this._expressionBufferMap.get(parent)) !== null && _a !== void 0 ? _a : parent.elements.pop();
         if (!left ||
             !right ||
             left.type === "ClassSubtraction" ||
@@ -2386,7 +2379,7 @@ class RegExpParserState {
         };
         left.parent = node;
         right.parent = node;
-        this._expressionBuffer = node;
+        this._expressionBufferMap.set(parent, node);
     }
     onClassSubtraction(start, end) {
         var _a;
@@ -2395,7 +2388,7 @@ class RegExpParserState {
             throw new Error("UnknownError");
         }
         const right = parent.elements.pop();
-        const left = (_a = this._expressionBuffer) !== null && _a !== void 0 ? _a : parent.elements.pop();
+        const left = (_a = this._expressionBufferMap.get(parent)) !== null && _a !== void 0 ? _a : parent.elements.pop();
         if (!left ||
             !right ||
             left.type === "ClassIntersection" ||
@@ -2414,7 +2407,7 @@ class RegExpParserState {
         };
         left.parent = node;
         right.parent = node;
-        this._expressionBuffer = node;
+        this._expressionBufferMap.set(parent, node);
     }
     onClassStringDisjunctionEnter(start) {
         const parent = this._node;
diff --git a/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/index.mjs b/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/index.mjs
index a47266313ae095..1f4adaff89e0d5 100644
--- a/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/index.mjs
+++ b/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/index.mjs
@@ -41,10 +41,10 @@ function isLargeIdContinue(cp) {
     return isInRange(cp, largeIdContinueRanges !== null && largeIdContinueRanges !== void 0 ? largeIdContinueRanges : (largeIdContinueRanges = initLargeIdContinueRanges()));
 }
 function initLargeIdStartRanges() {
-    return restoreRanges("4q 0 b 0 5 0 6 m 2 u 2 cp 5 b f 4 8 0 2 0 3m 4 2 1 3 3 2 0 7 0 2 2 2 0 2 j 2 2a 2 3u 9 4l 2 11 3 0 7 14 20 q 5 3 1a 16 10 1 2 2q 2 0 g 1 8 1 b 2 3 0 h 0 2 t u 2g c 0 p w a 1 5 0 6 l 5 0 a 0 4 0 o o 8 a 6 n 2 5 i 15 1n 1h 4 0 j 0 8 9 g f 5 7 3 1 3 l 2 6 2 0 4 3 4 0 h 0 e 1 2 2 f 1 b 0 9 5 5 1 3 l 2 6 2 1 2 1 2 1 w 3 2 0 k 2 h 8 2 2 2 l 2 6 2 1 2 4 4 0 j 0 g 1 o 0 c 7 3 1 3 l 2 6 2 1 2 4 4 0 v 1 2 2 g 0 i 0 2 5 4 2 2 3 4 1 2 0 2 1 4 1 4 2 4 b n 0 1h 7 2 2 2 m 2 f 4 0 r 2 3 0 3 1 v 0 5 7 2 2 2 m 2 9 2 4 4 0 w 1 2 1 g 1 i 8 2 2 2 14 3 0 h 0 6 2 9 2 p 5 6 h 4 n 2 8 2 0 3 6 1n 1b 2 1 d 6 1n 1 2 0 2 4 2 n 2 0 2 9 2 1 a 0 3 4 2 0 m 3 x 0 1s 7 2 z s 4 38 16 l 0 h 5 5 3 4 0 4 1 8 2 5 c d 0 i 11 2 0 6 0 3 16 2 98 2 3 3 6 2 0 2 3 3 14 2 3 3 w 2 3 3 6 2 0 2 3 3 e 2 1k 2 3 3 1u 12 f h 2d 3 5 4 h7 3 g 2 p 6 22 4 a 8 h e i f h f c 2 2 g 1f 10 0 5 0 1w 2g 8 14 2 0 6 1x b u 1e t 3 4 c 17 5 p 1j m a 1g 2b 0 2m 1a i 7 1j t e 1 b 17 r z 16 2 b z 3 8 8 16 3 2 16 3 2 5 2 1 4 0 6 5b 1t 7p 3 5 3 11 3 5 3 7 2 0 2 0 2 0 2 u 3 1g 2 6 2 0 4 2 2 6 4 3 3 5 5 c 6 2 2 6 39 0 e 0 h c 2u 0 5 0 3 9 2 0 3 5 7 0 2 0 2 0 2 f 3 3 6 4 5 0 i 14 22g 6c 7 3 4 1 d 11 2 0 6 0 3 1j 8 0 h m a 6 2 6 2 6 2 6 2 6 2 6 2 6 2 6 fb 2 q 8 8 4 3 4 5 2d 5 4 2 2h 2 3 6 16 2 2l i v 1d f e9 533 1t h3g 1w 19 3 7g 4 f b 1 l 1a h u 3 27 14 8 3 2u 3 1r 6 1 2 0 2 4 p f 2 2 2 3 2 m u 1f f 1d 1r 5 4 0 2 1 c r b m q s 8 1a t 0 h 4 2 9 b 4 2 14 o 2 2 7 l m 4 0 4 1d 2 0 4 1 3 4 3 0 2 0 p 2 3 a 8 2 d 5 3 5 3 5 a 6 2 6 2 16 2 d 7 36 u 8mb d m 5 1c 6it a5 3 2x 13 6 d 4 6 0 2 9 2 c 2 4 2 0 2 1 2 1 2 2z y a2 j 1r 3 1h 15 b 39 4 2 3q 11 p 7 p c 2g 4 5 3 5 3 5 3 2 10 b 2 p 2 i 2 1 2 e 3 d z 3e 1y 1g 7g s 4 1c 1c v e t 6 11 b t 3 z 5 7 2 4 17 4d j z 5 z 5 13 9 1f d a 2 e 2 6 2 1 2 a 2 e 2 6 2 1 1w 8m a l b 7 p 5 2 15 2 8 1y 5 3 0 2 17 2 1 4 0 3 m b m a u 1u i 2 1 b l b p 1z 1j 7 1 1t 0 g 3 2 2 2 s 17 s 4 s 10 7 2 r s 1h b l b i e h 33 20 1k 1e e 1e e z 9p 15 7 1 27 s b 0 9 l 17 h 1b k s m d 1g 1m 1 3 0 e 18 x o r z u 0 3 0 9 y 4 0 d 1b f 3 m 0 2 0 10 h 2 o k 1 1s 6 2 0 2 3 2 e 2 9 8 1a 13 7 3 1 3 l 2 6 2 1 2 4 4 0 j 0 d 4 4f 1g j 3 l 2 v 1b l 1 2 0 55 1a 16 3 11 1b l 0 1o 16 e 0 20 q 12 6 56 17 39 1r w 7 3 0 3 7 2 1 2 n g 0 2 0 2n 7 3 12 h 0 2 0 t 0 b 13 8 0 m 0 c 19 k 0 j 20 7c 8 2 10 i 0 1e t 35 6 2 1 2 11 m 0 q 5 2 1 2 v f 0 94 i g 0 2 c 2 x 3h 0 28 pl 2v 32 i 5f 219 2o g tr i 5 33u g6 6nu fs 8 u i 26 i t j 1b h 3 w k 6 i j5 1r 3l 22 6 0 1v c 1t 1 2 0 t 4qf 9 yd 17 8 6w8 3 2 6 2 1 2 82 g 0 u 2 3 0 f 3 9 az 1s5 2y 6 c 4 8 8 9 4mf 2c 2 1y 2 1 3 0 3 1 3 3 2 b 2 0 2 6 2 1s 2 3 3 7 2 6 2 r 2 3 2 4 2 0 4 6 2 9f 3 o 2 o 2 u 2 o 2 u 2 o 2 u 2 o 2 u 2 o 2 7 1f9 u 7 5 7a 1p 43 18 b 6 h 0 8y t j 17 dh r l1 6 2 3 2 1 2 e 2 5g 1o 1v 8 0 xh 3 2 q 2 1 2 0 3 0 2 9 2 3 2 0 2 0 7 0 5 0 2 0 2 0 2 2 2 1 2 0 3 0 2 0 2 0 2 0 2 0 2 1 2 0 3 3 2 6 2 3 2 3 2 0 2 9 2 g 6 2 2 4 2 g 3et wyn x 37d 7 65 3 4g1 f 5rk 2e8 f1 15v 3t6 6 38f");
+    return restoreRanges("4q 0 b 0 5 0 6 m 2 u 2 cp 5 b f 4 8 0 2 0 3m 4 2 1 3 3 2 0 7 0 2 2 2 0 2 j 2 2a 2 3u 9 4l 2 11 3 0 7 14 20 q 5 3 1a 16 10 1 2 2q 2 0 g 1 8 1 b 2 3 0 h 0 2 t u 2g c 0 p w a 1 5 0 6 l 5 0 a 0 4 0 o o 8 a 6 n 2 5 i 15 1n 1h 4 0 j 0 8 9 g f 5 7 3 1 3 l 2 6 2 0 4 3 4 0 h 0 e 1 2 2 f 1 b 0 9 5 5 1 3 l 2 6 2 1 2 1 2 1 w 3 2 0 k 2 h 8 2 2 2 l 2 6 2 1 2 4 4 0 j 0 g 1 o 0 c 7 3 1 3 l 2 6 2 1 2 4 4 0 v 1 2 2 g 0 i 0 2 5 4 2 2 3 4 1 2 0 2 1 4 1 4 2 4 b n 0 1h 7 2 2 2 m 2 f 4 0 r 2 3 0 3 1 v 0 5 7 2 2 2 m 2 9 2 4 4 0 w 1 2 1 g 1 i 8 2 2 2 14 3 0 h 0 6 2 9 2 p 5 6 h 4 n 2 8 2 0 3 6 1n 1b 2 1 d 6 1n 1 2 0 2 4 2 n 2 0 2 9 2 1 a 0 3 4 2 0 m 3 x 0 1s 7 2 z s 4 38 16 l 0 h 5 5 3 4 0 4 1 8 2 5 c d 0 i 11 2 0 6 0 3 16 2 98 2 3 3 6 2 0 2 3 3 14 2 3 3 w 2 3 3 6 2 0 2 3 3 e 2 1k 2 3 3 1u 12 f h 2d 3 5 4 h7 3 g 2 p 6 22 4 a 8 h e i f h f c 2 2 g 1f 10 0 5 0 1w 2g 8 14 2 0 6 1x b u 1e t 3 4 c 17 5 p 1j m a 1g 2b 0 2m 1a i 7 1j t e 1 b 17 r z 16 2 b z 3 8 8 16 3 2 16 3 2 5 2 1 4 0 6 5b 1t 7p 3 5 3 11 3 5 3 7 2 0 2 0 2 0 2 u 3 1g 2 6 2 0 4 2 2 6 4 3 3 5 5 c 6 2 2 6 39 0 e 0 h c 2u 0 5 0 3 9 2 0 3 5 7 0 2 0 2 0 2 f 3 3 6 4 5 0 i 14 22g 6c 7 3 4 1 d 11 2 0 6 0 3 1j 8 0 h m a 6 2 6 2 6 2 6 2 6 2 6 2 6 2 6 fb 2 q 8 8 4 3 4 5 2d 5 4 2 2h 2 3 6 16 2 2l i v 1d f e9 533 1t h3g 1w 19 3 7g 4 f b 1 l 1a h u 3 27 14 8 3 2u 3 1r 6 1 2 0 2 4 p f 2 2 2 3 2 m u 1f f 1d 1r 5 4 0 2 1 c r b m q s 8 1a t 0 h 4 2 9 b 4 2 14 o 2 2 7 l m 4 0 4 1d 2 0 4 1 3 4 3 0 2 0 p 2 3 a 8 2 d 5 3 5 3 5 a 6 2 6 2 16 2 d 7 36 u 8mb d m 5 1c 6it a5 3 2x 13 6 d 4 6 0 2 9 2 c 2 4 2 0 2 1 2 1 2 2z y a2 j 1r 3 1h 15 b 39 4 2 3q 11 p 7 p c 2g 4 5 3 5 3 5 3 2 10 b 2 p 2 i 2 1 2 e 3 d z 3e 1y 1g 7g s 4 1c 1c v e t 6 11 b t 3 z 5 7 2 4 17 4d j z 5 z 5 13 9 1f d a 2 e 2 6 2 1 2 a 2 e 2 6 2 1 1w 8m a l b 7 p 5 2 15 2 8 1y 5 3 0 2 17 2 1 4 0 3 m b m a u 1u i 2 1 b l b p 1z 1j 7 1 1t 0 g 3 2 2 2 s 17 s 4 s 10 7 2 r s 1h b l b i e h 33 20 1k 1e e 1e e z 9p 15 7 1 27 s b 0 9 l 17 h 1b k s m d 1g 1m 1 3 0 e 18 x o r z u 0 3 0 9 y 4 0 d 1b f 3 m 0 2 0 10 h 2 o k 1 1s 6 2 0 2 3 2 e 2 9 8 1a 13 7 3 1 3 l 2 6 2 1 2 4 4 0 j 0 d 4 4f 1g j 3 l 2 v 1b l 1 2 0 55 1a 16 3 11 1b l 0 1o 16 e 0 20 q 12 6 56 17 39 1r w 7 3 0 3 7 2 1 2 n g 0 2 0 2n 7 3 12 h 0 2 0 t 0 b 13 8 0 m 0 c 19 k 0 j 20 7c 8 2 10 i 0 1e t 35 6 2 1 2 11 m 0 q 5 2 1 2 v f 0 94 i g 0 2 c 2 x 3h 0 28 pl 2v 32 i 5f 219 2o g tr i 5 33u g6 6nu fs 8 u i 26 i t j 1b h 3 w k 6 i j5 1r 3l 22 6 0 1v c 1t 1 2 0 t 4qf 9 yd 17 8 6w8 3 2 6 2 1 2 82 g 0 u 2 3 0 f 3 9 az 1s5 2y 6 c 4 8 8 9 4mf 2c 2 1y 2 1 3 0 3 1 3 3 2 b 2 0 2 6 2 1s 2 3 3 7 2 6 2 r 2 3 2 4 2 0 4 6 2 9f 3 o 2 o 2 u 2 o 2 u 2 o 2 u 2 o 2 u 2 o 2 7 1f9 u 7 5 7a 1p 43 18 b 6 h 0 8y t j 17 dh r l1 6 2 3 2 1 2 e 2 5g 1o 1v 8 0 xh 3 2 q 2 1 2 0 3 0 2 9 2 3 2 0 2 0 7 0 5 0 2 0 2 0 2 2 2 1 2 0 3 0 2 0 2 0 2 0 2 0 2 1 2 0 3 3 2 6 2 3 2 3 2 0 2 9 2 g 6 2 2 4 2 g 3et wyn x 37d 7 65 3 4g1 f 5rk g h9 1wj f1 15v 3t6 6 38f");
 }
 function initLargeIdContinueRanges() {
-    return restoreRanges("53 0 g9 33 o 0 70 4 7e 18 2 0 2 1 2 1 2 0 21 a 1d u 7 0 2u 6 3 5 3 1 2 3 3 9 o 0 v q 2k a g 9 y 8 a 0 p 3 2 8 2 2 2 4 18 2 1p 7 17 n 2 w 1j 2 2 h 2 6 b 1 3 9 i 2 1l 0 2 6 3 1 3 2 a 0 b 1 3 9 f 0 3 2 1l 0 2 4 5 1 3 2 4 0 l b 4 0 c 2 1l 0 2 7 2 2 2 2 l 1 3 9 b 5 2 2 1l 0 2 6 3 1 3 2 8 2 b 1 3 9 j 0 1o 4 4 2 2 3 a 0 f 9 h 4 1k 0 2 6 2 2 2 3 8 1 c 1 3 9 i 2 1l 0 2 6 2 2 2 3 8 1 c 1 3 9 4 0 d 3 1k 1 2 6 2 2 2 3 a 0 b 1 3 9 i 2 1z 0 5 5 2 0 2 7 7 9 3 1 1q 0 3 6 d 7 2 9 2g 0 3 8 c 6 2 9 1r 1 7 9 c 0 2 0 2 0 5 1 1e j 2 1 6 a 2 z a 0 2t j 2 9 d 3 5 2 2 2 3 6 4 3 e b 2 e jk 2 a 8 pt 3 t 2 u 1 v 1 1t v a 0 3 9 y 2 2 a 40 0 3b b 5 b b 9 3l a 1p 4 1m 9 2 s 3 a 7 9 n d 2 f 1e 4 1c g c 9 i 8 d 2 v c 3 9 19 d 1d j 9 9 7 9 3b 2 2 k 5 0 7 0 3 2 5j 1r g0 1 k 0 3g c 5 0 4 b 2db 2 3y 0 2p v ff 5 2y 1 n7q 9 1y 0 5 9 x 1 29 1 7l 0 4 0 5 0 o 4 5 0 2c 1 1f h b 9 7 h e a t 7 q c 19 3 1c d g 9 c 0 b 9 1c d d 0 9 1 3 9 y 2 1f 0 2 2 3 1 6 1 2 0 16 4 6 1 6l 7 2 1 3 9 fmt 0 ki f h f 4 1 p 2 5d 9 12 0 ji 0 6b 0 46 4 86 9 120 2 2 1 6 3 15 2 5 0 4m 1 fy 3 9 9 aa 1 29 2 1z a 1e 3 3f 2 1i e w a 3 1 b 3 1a a 8 0 1a 9 7 2 11 d 2 9 6 1 19 0 d 2 1d d 9 3 2 b 2b b 7 0 3 0 4e b 6 9 7 3 1k 1 2 6 3 1 3 2 a 0 b 1 3 6 4 4 5d h a 9 5 0 2a j d 9 5y 6 3 8 s 1 2b g g 9 2a c 9 9 2c e 5 9 6r e 4m 9 1z 5 2 1 3 3 2 0 2 1 d 9 3c 6 3 6 4 0 t 9 15 6 2 3 9 0 a a 1b f ba 7 2 7 h 9 1l l 2 d 3f 5 4 0 2 1 2 6 2 0 9 9 1d 4 2 1 2 4 9 9 96 3 a 1 2 0 1d 6 4 4 e 9 44n 0 7 e aob 9 2f 9 13 4 1o 6 q 9 s6 0 2 1i 8 3 2a 0 c 1 f58 1 3mq 19 3 m f3 4 4 5 9 7 3 6 v 3 45 2 13e 1d e9 1i 5 1d 9 0 f 0 n 4 2 e 11t 6 2 g 3 6 2 1 2 4 2t 0 4h 6 a 9 9x 0 1q d dv d rb 6 32 6 6 9 3o7 9 gvt3 6n");
+    return restoreRanges("53 0 g9 33 o 0 70 4 7e 18 2 0 2 1 2 1 2 0 21 a 1d u 7 0 2u 6 3 5 3 1 2 3 3 9 o 0 v q 2k a g 9 y 8 a 0 p 3 2 8 2 2 2 4 18 2 1p 7 17 n 2 w 1j 2 2 h 2 6 b 1 3 9 i 2 1l 0 2 6 3 1 3 2 a 0 b 1 3 9 f 0 3 2 1l 0 2 4 5 1 3 2 4 0 l b 4 0 c 2 1l 0 2 7 2 2 2 2 l 1 3 9 b 5 2 2 1l 0 2 6 3 1 3 2 8 2 b 1 3 9 j 0 1o 4 4 2 2 3 a 0 f 9 h 4 1k 0 2 6 2 2 2 3 8 1 c 1 3 9 i 2 1l 0 2 6 2 2 2 3 8 1 c 1 3 9 4 0 d 3 1k 1 2 6 2 2 2 3 a 0 b 1 3 9 i 2 1z 0 5 5 2 0 2 7 7 9 3 1 1q 0 3 6 d 7 2 9 2g 0 3 8 c 6 2 9 1r 1 7 9 c 0 2 0 2 0 5 1 1e j 2 1 6 a 2 z a 0 2t j 2 9 d 3 5 2 2 2 3 6 4 3 e b 2 e jk 2 a 8 pt 3 t 2 u 1 v 1 1t v a 0 3 9 y 2 2 a 40 0 3b b 5 b b 9 3l a 1p 4 1m 9 2 s 3 a 7 9 n d 2 f 1e 4 1c g c 9 i 8 d 2 v c 3 9 19 d 1d j 9 9 7 9 3b 2 2 k 5 0 7 0 3 2 5j 1r el 1 1e 1 k 0 3g c 5 0 4 b 2db 2 3y 0 2p v ff 5 2y 1 2p 0 n51 9 1y 0 5 9 x 1 29 1 7l 0 4 0 5 0 o 4 5 0 2c 1 1f h b 9 7 h e a t 7 q c 19 3 1c d g 9 c 0 b 9 1c d d 0 9 1 3 9 y 2 1f 0 2 2 3 1 6 1 2 0 16 4 6 1 6l 7 2 1 3 9 fmt 0 ki f h f 4 1 p 2 5d 9 12 0 12 0 ig 0 6b 0 46 4 86 9 120 2 2 1 6 3 15 2 5 0 4m 1 fy 3 9 9 aa 1 29 2 1z a 1e 3 3f 2 1i e w a 3 1 b 3 1a a 8 0 1a 9 7 2 11 d 2 9 6 1 19 0 d 2 1d d 9 3 2 b 2b b 7 0 3 0 4e b 6 9 7 3 1k 1 2 6 3 1 3 2 a 0 b 1 3 6 4 4 5d h a 9 5 0 2a j d 9 5y 6 3 8 s 1 2b g g 9 2a c 9 9 2c e 5 9 6r e 4m 9 1z 5 2 1 3 3 2 0 2 1 d 9 3c 6 3 6 4 0 t 9 15 6 2 3 9 0 a a 1b f ba 7 2 7 h 9 1l l 2 d 3f 5 4 0 2 1 2 6 2 0 9 9 1d 4 2 1 2 4 9 9 96 3 a 1 2 0 1d 6 4 4 e 9 44n 0 7 e aob 9 2f 9 13 4 1o 6 q 9 s6 0 2 1i 8 3 2a 0 c 1 f58 1 3mq 19 3 m f3 4 4 5 9 7 3 6 v 3 45 2 13e 1d e9 1i 5 1d 9 0 f 0 n 4 2 e 11t 6 2 g 3 6 2 1 2 4 2t 0 4h 6 a 9 9x 0 1q d dv d rb 6 32 6 6 9 3o7 9 gvt3 6n");
 }
 function isInRange(cp, ranges) {
     let l = 0, r = (ranges.length / 2) | 0, i = 0, min = 0, max = 0;
@@ -113,6 +113,7 @@ const scNameSet = new Set(["Script", "Script_Extensions", "sc", "scx"]);
 const gcValueSets = new DataSet("C Cased_Letter Cc Cf Close_Punctuation Cn Co Combining_Mark Connector_Punctuation Control Cs Currency_Symbol Dash_Punctuation Decimal_Number Enclosing_Mark Final_Punctuation Format Initial_Punctuation L LC Letter Letter_Number Line_Separator Ll Lm Lo Lowercase_Letter Lt Lu M Mark Math_Symbol Mc Me Mn Modifier_Letter Modifier_Symbol N Nd Nl No Nonspacing_Mark Number Open_Punctuation Other Other_Letter Other_Number Other_Punctuation Other_Symbol P Paragraph_Separator Pc Pd Pe Pf Pi Po Private_Use Ps Punctuation S Sc Separator Sk Sm So Space_Separator Spacing_Mark Surrogate Symbol Titlecase_Letter Unassigned Uppercase_Letter Z Zl Zp Zs cntrl digit punct", "", "", "", "", "", "");
 const scValueSets = new DataSet("Adlam Adlm Aghb Ahom Anatolian_Hieroglyphs Arab Arabic Armenian Armi Armn Avestan Avst Bali Balinese Bamu Bamum Bass Bassa_Vah Batak Batk Beng Bengali Bhaiksuki Bhks Bopo Bopomofo Brah Brahmi Brai Braille Bugi Buginese Buhd Buhid Cakm Canadian_Aboriginal Cans Cari Carian Caucasian_Albanian Chakma Cham Cher Cherokee Common Copt Coptic Cprt Cuneiform Cypriot Cyrillic Cyrl Deseret Deva Devanagari Dsrt Dupl Duployan Egyp Egyptian_Hieroglyphs Elba Elbasan Ethi Ethiopic Geor Georgian Glag Glagolitic Gonm Goth Gothic Gran Grantha Greek Grek Gujarati Gujr Gurmukhi Guru Han Hang Hangul Hani Hano Hanunoo Hatr Hatran Hebr Hebrew Hira Hiragana Hluw Hmng Hung Imperial_Aramaic Inherited Inscriptional_Pahlavi Inscriptional_Parthian Ital Java Javanese Kaithi Kali Kana Kannada Katakana Kayah_Li Khar Kharoshthi Khmer Khmr Khoj Khojki Khudawadi Knda Kthi Lana Lao Laoo Latin Latn Lepc Lepcha Limb Limbu Lina Linb Linear_A Linear_B Lisu Lyci Lycian Lydi Lydian Mahajani Mahj Malayalam Mand Mandaic Mani Manichaean Marc Marchen Masaram_Gondi Meetei_Mayek Mend Mende_Kikakui Merc Mero Meroitic_Cursive Meroitic_Hieroglyphs Miao Mlym Modi Mong Mongolian Mro Mroo Mtei Mult Multani Myanmar Mymr Nabataean Narb Nbat New_Tai_Lue Newa Nko Nkoo Nshu Nushu Ogam Ogham Ol_Chiki Olck Old_Hungarian Old_Italic Old_North_Arabian Old_Permic Old_Persian Old_South_Arabian Old_Turkic Oriya Orkh Orya Osage Osge Osma Osmanya Pahawh_Hmong Palm Palmyrene Pau_Cin_Hau Pauc Perm Phag Phags_Pa Phli Phlp Phnx Phoenician Plrd Prti Psalter_Pahlavi Qaac Qaai Rejang Rjng Runic Runr Samaritan Samr Sarb Saur Saurashtra Sgnw Sharada Shavian Shaw Shrd Sidd Siddham SignWriting Sind Sinh Sinhala Sora Sora_Sompeng Soyo Soyombo Sund Sundanese Sylo Syloti_Nagri Syrc Syriac Tagalog Tagb Tagbanwa Tai_Le Tai_Tham Tai_Viet Takr Takri Tale Talu Tamil Taml Tang Tangut Tavt Telu Telugu Tfng Tglg Thaa Thaana Thai Tibetan Tibt Tifinagh Tirh Tirhuta Ugar Ugaritic Vai Vaii Wara Warang_Citi Xpeo Xsux Yi Yiii Zanabazar_Square Zanb Zinh Zyyy", "Dogr Dogra Gong Gunjala_Gondi Hanifi_Rohingya Maka Makasar Medefaidrin Medf Old_Sogdian Rohg Sogd Sogdian Sogo", "Elym Elymaic Hmnp Nand Nandinagari Nyiakeng_Puachue_Hmong Wancho Wcho", "Chorasmian Chrs Diak Dives_Akuru Khitan_Small_Script Kits Yezi Yezidi", "Cpmn Cypro_Minoan Old_Uyghur Ougr Tangsa Tnsa Toto Vith Vithkuqi", "Hrkt Katakana_Or_Hiragana Kawi Nag_Mundari Nagm Unknown Zzzz", "");
 const binPropertySets = new DataSet("AHex ASCII ASCII_Hex_Digit Alpha Alphabetic Any Assigned Bidi_C Bidi_Control Bidi_M Bidi_Mirrored CI CWCF CWCM CWKCF CWL CWT CWU Case_Ignorable Cased Changes_When_Casefolded Changes_When_Casemapped Changes_When_Lowercased Changes_When_NFKC_Casefolded Changes_When_Titlecased Changes_When_Uppercased DI Dash Default_Ignorable_Code_Point Dep Deprecated Dia Diacritic Emoji Emoji_Component Emoji_Modifier Emoji_Modifier_Base Emoji_Presentation Ext Extender Gr_Base Gr_Ext Grapheme_Base Grapheme_Extend Hex Hex_Digit IDC IDS IDSB IDST IDS_Binary_Operator IDS_Trinary_Operator ID_Continue ID_Start Ideo Ideographic Join_C Join_Control LOE Logical_Order_Exception Lower Lowercase Math NChar Noncharacter_Code_Point Pat_Syn Pat_WS Pattern_Syntax Pattern_White_Space QMark Quotation_Mark RI Radical Regional_Indicator SD STerm Sentence_Terminal Soft_Dotted Term Terminal_Punctuation UIdeo Unified_Ideograph Upper Uppercase VS Variation_Selector White_Space XIDC XIDS XID_Continue XID_Start space", "Extended_Pictographic", "", "EBase EComp EMod EPres ExtPict", "", "", "");
+const binPropertyOfStringsSets = new DataSet("", "", "", "", "", "", "Basic_Emoji Emoji_Keycap_Sequence RGI_Emoji RGI_Emoji_Flag_Sequence RGI_Emoji_Modifier_Sequence RGI_Emoji_Tag_Sequence RGI_Emoji_ZWJ_Sequence");
 function isValidUnicodeProperty(version, name, value) {
     if (gcNameSet.has(name)) {
         return version >= 2018 && gcValueSets.es2018.has(value);
@@ -132,6 +133,9 @@ function isValidLoneUnicodeProperty(version, value) {
         (version >= 2019 && binPropertySets.es2019.has(value)) ||
         (version >= 2021 && binPropertySets.es2021.has(value)));
 }
+function isValidLoneUnicodePropertyOfString(version, value) {
+    return version >= 2024 && binPropertyOfStringsSets.es2024.has(value);
+}
 
 const BACKSPACE = 0x08;
 const CHARACTER_TABULATION = 0x09;
@@ -374,19 +378,6 @@ class RegExpSyntaxError extends SyntaxError {
     }
 }
 
-const binPropertyOfStringSets = new Set([
-    "Basic_Emoji",
-    "Emoji_Keycap_Sequence",
-    "RGI_Emoji_Modifier_Sequence",
-    "RGI_Emoji_Flag_Sequence",
-    "RGI_Emoji_Tag_Sequence",
-    "RGI_Emoji_ZWJ_Sequence",
-    "RGI_Emoji",
-]);
-function isValidLoneUnicodePropertyOfString(version, value) {
-    return version >= 2024 && binPropertyOfStringSets.has(value);
-}
-
 const SYNTAX_CHARACTER = new Set([
     CIRCUMFLEX_ACCENT,
     DOLLAR_SIGN,
@@ -1953,7 +1944,7 @@ class RegExpParserState {
     constructor(options) {
         var _a;
         this._node = DUMMY_PATTERN;
-        this._expressionBuffer = null;
+        this._expressionBufferMap = new Map();
         this._flags = DUMMY_FLAGS;
         this._backreferences = [];
         this._capturingGroups = [];
@@ -2293,19 +2284,21 @@ class RegExpParserState {
         const node = this._node;
         if (node.type !== "CharacterClass" ||
             (node.parent.type !== "Alternative" &&
-                node.parent.type !== "CharacterClass") ||
-            (this._expressionBuffer && node.elements.length > 0)) {
+                node.parent.type !== "CharacterClass")) {
             throw new Error("UnknownError");
         }
         const parent = node.parent;
         node.end = end;
         node.raw = this.source.slice(start, end);
         this._node = parent;
-        const expression = this._expressionBuffer;
-        this._expressionBuffer = null;
+        const expression = this._expressionBufferMap.get(node);
         if (!expression) {
             return;
         }
+        if (node.elements.length > 0) {
+            throw new Error("UnknownError");
+        }
+        this._expressionBufferMap.delete(node);
         const newNode = {
             type: "ExpressionCharacterClass",
             parent,
@@ -2363,7 +2356,7 @@ class RegExpParserState {
             throw new Error("UnknownError");
         }
         const right = parent.elements.pop();
-        const left = (_a = this._expressionBuffer) !== null && _a !== void 0 ? _a : parent.elements.pop();
+        const left = (_a = this._expressionBufferMap.get(parent)) !== null && _a !== void 0 ? _a : parent.elements.pop();
         if (!left ||
             !right ||
             left.type === "ClassSubtraction" ||
@@ -2382,7 +2375,7 @@ class RegExpParserState {
         };
         left.parent = node;
         right.parent = node;
-        this._expressionBuffer = node;
+        this._expressionBufferMap.set(parent, node);
     }
     onClassSubtraction(start, end) {
         var _a;
@@ -2391,7 +2384,7 @@ class RegExpParserState {
             throw new Error("UnknownError");
         }
         const right = parent.elements.pop();
-        const left = (_a = this._expressionBuffer) !== null && _a !== void 0 ? _a : parent.elements.pop();
+        const left = (_a = this._expressionBufferMap.get(parent)) !== null && _a !== void 0 ? _a : parent.elements.pop();
         if (!left ||
             !right ||
             left.type === "ClassIntersection" ||
@@ -2410,7 +2403,7 @@ class RegExpParserState {
         };
         left.parent = node;
         right.parent = node;
-        this._expressionBuffer = node;
+        this._expressionBufferMap.set(parent, node);
     }
     onClassStringDisjunctionEnter(start) {
         const parent = this._node;
diff --git a/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/package.json b/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/package.json
index b41687324daf0a..5248576e747638 100644
--- a/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/package.json
+++ b/tools/node_modules/eslint/node_modules/@eslint-community/regexpp/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@eslint-community/regexpp",
-  "version": "4.8.0",
+  "version": "4.9.1",
   "description": "Regular expression parser for ECMAScript.",
   "keywords": [
     "regexp",
@@ -66,15 +66,15 @@
   },
   "dependencies": {},
   "devDependencies": {
-    "@eslint-community/eslint-plugin-mysticatea": "^15.3.0",
+    "@eslint-community/eslint-plugin-mysticatea": "^15.5.1",
     "@rollup/plugin-node-resolve": "^14.1.0",
-    "@types/eslint": "^8.4.10",
+    "@types/eslint": "^8.44.3",
     "@types/jsdom": "^16.2.15",
     "@types/mocha": "^9.1.1",
     "@types/node": "^12.20.55",
     "dts-bundle": "^0.7.3",
-    "eslint": "^8.31.0",
-    "js-tokens": "^8.0.1",
+    "eslint": "^8.50.0",
+    "js-tokens": "^8.0.2",
     "jsdom": "^19.0.0",
     "mocha": "^9.2.2",
     "npm-run-all": "^4.1.5",
diff --git a/tools/node_modules/eslint/node_modules/@eslint/js/package.json b/tools/node_modules/eslint/node_modules/@eslint/js/package.json
index 7bfcf6e6b60d51..7e43db7f2e9a7e 100644
--- a/tools/node_modules/eslint/node_modules/@eslint/js/package.json
+++ b/tools/node_modules/eslint/node_modules/@eslint/js/package.json
@@ -1,6 +1,6 @@
 {
   "name": "@eslint/js",
-  "version": "8.49.0",
+  "version": "8.51.0",
   "description": "ESLint JavaScript language implementation",
   "main": "./src/index.js",
   "scripts": {},
diff --git a/tools/node_modules/eslint/node_modules/@eslint/js/src/configs/eslint-all.js b/tools/node_modules/eslint/node_modules/@eslint/js/src/configs/eslint-all.js
index 177ff92f3164e7..52f580035a8598 100644
--- a/tools/node_modules/eslint/node_modules/@eslint/js/src/configs/eslint-all.js
+++ b/tools/node_modules/eslint/node_modules/@eslint/js/src/configs/eslint-all.js
@@ -152,11 +152,11 @@ module.exports = Object.freeze({
         "no-new": "error",
         "no-new-func": "error",
         "no-new-native-nonconstructor": "error",
-        "no-new-object": "error",
         "no-new-symbol": "error",
         "no-new-wrappers": "error",
         "no-nonoctal-decimal-escape": "error",
         "no-obj-calls": "error",
+        "no-object-constructor": "error",
         "no-octal": "error",
         "no-octal-escape": "error",
         "no-param-reassign": "error",
diff --git a/tools/node_modules/eslint/node_modules/@types/mdast/LICENSE b/tools/node_modules/eslint/node_modules/@types/mdast/LICENSE
old mode 100755
new mode 100644
diff --git a/tools/node_modules/eslint/node_modules/@types/mdast/package.json b/tools/node_modules/eslint/node_modules/@types/mdast/package.json
old mode 100755
new mode 100644
index af4f0bff32f31d..81452e9484730e
--- a/tools/node_modules/eslint/node_modules/@types/mdast/package.json
+++ b/tools/node_modules/eslint/node_modules/@types/mdast/package.json
@@ -1,6 +1,6 @@
 {
     "name": "@types/mdast",
-    "version": "3.0.12",
+    "version": "3.0.13",
     "description": "TypeScript definitions for Mdast",
     "homepage": "https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/mdast",
     "license": "MIT",
@@ -37,6 +37,6 @@
     "dependencies": {
         "@types/unist": "^2"
     },
-    "typesPublisherContentHash": "46b61589850b899948f440f265e9953256f1c124c52474829c42c8d5ae6d2325",
-    "typeScriptVersion": "4.3"
+    "typesPublisherContentHash": "4f7e7836da8059c1699be808ec47184aefe23f7e21adb87b32171a0cd60e111c",
+    "typeScriptVersion": "4.5"
 }
\ No newline at end of file
diff --git a/tools/node_modules/eslint/node_modules/browserslist/cli.js b/tools/node_modules/eslint/node_modules/browserslist/cli.js
index c54aa9879288e9..7b5236da3ee53d 100755
--- a/tools/node_modules/eslint/node_modules/browserslist/cli.js
+++ b/tools/node_modules/eslint/node_modules/browserslist/cli.js
@@ -38,7 +38,12 @@ if (isArg('--help') || isArg('-h')) {
 } else if (isArg('--version') || isArg('-v')) {
   process.stdout.write('browserslist ' + pkg.version + '\n')
 } else if (isArg('--update-db')) {
-  /* c8 ignore next 3 */
+  /* c8 ignore next 8 */
+  process.stdout.write(
+    'The --update-db command is deprecated.\n' +
+      'Please use npx update-browserslist-db@latest instead.\n'
+  )
+  process.stdout.write('Browserslist DB update will still be made.\n')
   updateDb(function (str) {
     process.stdout.write(str)
   })
diff --git a/tools/node_modules/eslint/node_modules/browserslist/index.js b/tools/node_modules/eslint/node_modules/browserslist/index.js
index 60544cb82027a7..18021be30db387 100644
--- a/tools/node_modules/eslint/node_modules/browserslist/index.js
+++ b/tools/node_modules/eslint/node_modules/browserslist/index.js
@@ -298,10 +298,10 @@ function filterJumps(list, name, nVersions, context) {
   return list.slice(jump - 1 - nVersions)
 }
 
-function isSupported(flags) {
+function isSupported(flags, withPartial) {
   return (
     typeof flags === 'string' &&
-    (flags.indexOf('y') >= 0 || flags.indexOf('a') >= 0)
+    (flags.indexOf('y') >= 0 || (withPartial && flags.indexOf('a') >= 0))
   )
 }
 
@@ -883,10 +883,11 @@ var QUERIES = {
     select: coverQuery
   },
   supports: {
-    matches: ['feature'],
-    regexp: /^supports\s+([\w-]+)$/,
+    matches: ['supportType', 'feature'],
+    regexp: /^(?:(fully|partially) )?supports\s+([\w-]+)$/,
     select: function (context, node) {
       env.loadFeature(browserslist.cache, node.feature)
+      var withPartial = node.supportType !== 'fully'
       var features = browserslist.cache[node.feature]
       var result = []
       for (var name in features) {
@@ -895,13 +896,13 @@ var QUERIES = {
         var checkDesktop =
           context.mobileToDesktop &&
           name in browserslist.desktopNames &&
-          isSupported(features[name][data.released.slice(-1)[0]])
+          isSupported(features[name][data.released.slice(-1)[0]], withPartial)
         data.versions.forEach(function (version) {
           var flags = features[name][version]
           if (flags === undefined && checkDesktop) {
             flags = features[browserslist.desktopNames[name]][version]
           }
-          if (isSupported(flags)) {
+          if (isSupported(flags, withPartial)) {
             result.push(name + ' ' + version)
           }
         })
@@ -1001,7 +1002,7 @@ var QUERIES = {
     matches: [],
     regexp: /^(firefox|ff|fx)\s+esr$/i,
     select: function () {
-      return ['firefox 102', 'firefox 115']
+      return ['firefox 115']
     }
   },
   opera_mini_all: {
diff --git a/tools/node_modules/eslint/node_modules/browserslist/package.json b/tools/node_modules/eslint/node_modules/browserslist/package.json
index ceb63ad6ece3d8..13bd3cd132ba29 100644
--- a/tools/node_modules/eslint/node_modules/browserslist/package.json
+++ b/tools/node_modules/eslint/node_modules/browserslist/package.json
@@ -1,6 +1,6 @@
 {
   "name": "browserslist",
-  "version": "4.21.10",
+  "version": "4.22.1",
   "description": "Share target browsers between different front-end tools, like Autoprefixer, Stylelint and babel-env-preset",
   "keywords": [
     "caniuse",
@@ -25,10 +25,10 @@
   "license": "MIT",
   "repository": "browserslist/browserslist",
   "dependencies": {
-    "caniuse-lite": "^1.0.30001517",
-    "electron-to-chromium": "^1.4.477",
+    "caniuse-lite": "^1.0.30001541",
+    "electron-to-chromium": "^1.4.535",
     "node-releases": "^2.0.13",
-    "update-browserslist-db": "^1.0.11"
+    "update-browserslist-db": "^1.0.13"
   },
   "engines": {
     "node": "^6 || ^7 || ^8 || ^9 || ^10 || ^11 || ^12 || >=13.7"
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/agents.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/agents.js
index c128fe716456a0..dfe73f2831b71b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/agents.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/agents.js
@@ -1 +1 @@
-module.exports={A:{A:{K:0,F:0,G:0.0268696,H:0.0537391,A:0,B:0.416478,KC:0},B:"ms",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","KC","K","F","G","H","A","B","","",""],E:"IE",F:{KC:962323200,K:998870400,F:1161129600,G:1237420800,H:1300060800,A:1346716800,B:1381968000}},B:{A:{"0":0.035192,"1":0.607062,"2":3.20687,C:0.004399,L:0.004399,M:0.004399,I:0.004399,N:0,D:0.004399,O:0.008798,P:0,Q:0.004399,R:0.004399,S:0.004399,T:0.008798,U:0.004399,V:0.008798,W:0.004399,X:0.004399,Y:0.004399,Z:0.008798,a:0,b:0.013197,c:0,d:0,e:0,f:0,g:0,h:0,i:0.017596,j:0,k:0,l:0,q:0,r:0,s:0,t:0,u:0.008798,v:0.013197,w:0.083581,x:0.013197,y:0.092379,z:0.096778,E:1.03376},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","C","L","M","I","N","D","O","P","Q","R","S","T","U","V","W","X","Y","Z","a","b","c","d","e","f","g","h","i","j","k","l","q","r","s","t","u","v","w","x","y","z","0","1","2","E","","",""],E:"Edge",F:{"0":1683158400,"1":1685664000,"2":1689897600,C:1438128000,L:1447286400,M:1470096000,I:1491868800,N:1508198400,D:1525046400,O:1542067200,P:1579046400,Q:1581033600,R:1586736000,S:1590019200,T:1594857600,U:1598486400,V:1602201600,W:1605830400,X:1611360000,Y:1614816000,Z:1618358400,a:1622073600,b:1626912000,c:1630627200,d:1632441600,e:1634774400,f:1637539200,g:1641427200,h:1643932800,i:1646265600,j:1649635200,k:1651190400,l:1653955200,q:1655942400,r:1659657600,s:1661990400,t:1664755200,u:1666915200,v:1670198400,w:1673481600,x:1675900800,y:1678665600,z:1680825600,E:1692576000},D:{C:"ms",L:"ms",M:"ms",I:"ms",N:"ms",D:"ms",O:"ms"}},C:{A:{"0":0.026394,"1":0.030793,"2":0.580668,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,LC:0,"0B":0,J:0,K:0,F:0,G:0,H:0,A:0,B:0.008798,C:0,L:0,M:0,I:0,N:0,D:0,O:0,m:0,n:0,o:0,AB:0,BB:0,CB:0,DB:0,EB:0,FB:0,GB:0,HB:0,IB:0,JB:0,KB:0,LB:0,MB:0,NB:0,OB:0,PB:0.008798,QB:0.004399,RB:0,SB:0,TB:0,UB:0.004399,VB:0,WB:0.008798,XB:0,YB:0.052788,ZB:0.004399,aB:0.004399,bB:0,cB:0.008798,dB:0,eB:0,"1B":0.004399,fB:0,"2B":0,gB:0,hB:0,iB:0,jB:0,kB:0,lB:0,mB:0,nB:0,oB:0,pB:0,qB:0.030793,p:0,rB:0,sB:0,tB:0,uB:0,vB:0.039591,P:0,Q:0,R:0,"3B":0,S:0.008798,T:0,U:0,V:0,W:0,X:0.004399,Y:0,Z:0.004399,a:0.008798,b:0,c:0,d:0.013197,e:0,f:0,g:0,h:0,i:0,j:0,k:0,l:0.118773,q:0.017596,r:0,s:0.004399,t:0.004399,u:0.004399,v:0.008798,w:0.008798,x:0.008798,y:0.013197,z:0.065985,E:1.39008,"4B":0.052788,"5B":0,"6B":0,MC:0,NC:0,OC:0},B:"moz",C:["LC","0B","NC","OC","J","3","K","F","G","H","A","B","C","L","M","I","N","D","O","4","m","n","o","5","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","OB","PB","QB","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","1B","fB","2B","gB","hB","iB","jB","kB","lB","mB","nB","oB","pB","qB","p","rB","sB","tB","uB","vB","P","Q","R","3B","S","T","U","V","W","X","Y","Z","a","b","c","d","e","f","g","h","i","j","k","l","q","r","s","t","u","v","w","x","y","z","0","1","2","E","4B","5B","6B","MC"],E:"Firefox",F:{"0":1683590400,"1":1686009600,"2":1688428800,"3":1308614400,"4":1357603200,"5":1372118400,"6":1375747200,"7":1379376000,"8":1386633600,"9":1391472000,LC:1161648000,"0B":1213660800,NC:1246320000,OC:1264032000,J:1300752000,K:1313452800,F:1317081600,G:1317081600,H:1320710400,A:1324339200,B:1327968000,C:1331596800,L:1335225600,M:1338854400,I:1342483200,N:1346112000,D:1349740800,O:1353628800,m:1361232000,n:1364860800,o:1368489600,AB:1395100800,BB:1398729600,CB:1402358400,DB:1405987200,EB:1409616000,FB:1413244800,GB:1417392000,HB:1421107200,IB:1424736000,JB:1428278400,KB:1431475200,LB:1435881600,MB:1439251200,NB:1442880000,OB:1446508800,PB:1450137600,QB:1453852800,RB:1457395200,SB:1461628800,TB:1465257600,UB:1470096000,VB:1474329600,WB:1479168000,XB:1485216000,YB:1488844800,ZB:1492560000,aB:1497312000,bB:1502150400,cB:1506556800,dB:1510617600,eB:1516665600,"1B":1520985600,fB:1525824000,"2B":1529971200,gB:1536105600,hB:1540252800,iB:1544486400,jB:1548720000,kB:1552953600,lB:1558396800,mB:1562630400,nB:1567468800,oB:1571788800,pB:1575331200,qB:1578355200,p:1581379200,rB:1583798400,sB:1586304000,tB:1588636800,uB:1591056000,vB:1593475200,P:1595894400,Q:1598313600,R:1600732800,"3B":1603152000,S:1605571200,T:1607990400,U:1611619200,V:1614038400,W:1616457600,X:1618790400,Y:1622505600,Z:1626134400,a:1628553600,b:1630972800,c:1633392000,d:1635811200,e:1638835200,f:1641859200,g:1644364800,h:1646697600,i:1649116800,j:1651536000,k:1653955200,l:1656374400,q:1658793600,r:1661212800,s:1663632000,t:1666051200,u:1668470400,v:1670889600,w:1673913600,x:1676332800,y:1678752000,z:1681171200,E:1690848000,"4B":1693267200,"5B":null,"6B":null,MC:null}},D:{A:{"0":0.255142,"1":2.10712,"2":12.8099,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,J:0,K:0,F:0,G:0,H:0,A:0,B:0,C:0,L:0,M:0,I:0,N:0,D:0,O:0,m:0,n:0,o:0,AB:0,BB:0,CB:0,DB:0,EB:0,FB:0,GB:0.004399,HB:0,IB:0,JB:0,KB:0.013197,LB:0,MB:0,NB:0,OB:0,PB:0,QB:0,RB:0,SB:0,TB:0.004399,UB:0.017596,VB:0.030793,WB:0.013197,XB:0,YB:0,ZB:0.008798,aB:0,bB:0.004399,cB:0.048389,dB:0.004399,eB:0,"1B":0,fB:0.021995,"2B":0.004399,gB:0.004399,hB:0.008798,iB:0,jB:0.008798,kB:0.026394,lB:0.004399,mB:0.039591,nB:0.065985,oB:0.039591,pB:0.021995,qB:0.026394,p:0.030793,rB:0.048389,sB:0.048389,tB:0.096778,uB:0.026394,vB:0.039591,P:0.202354,Q:0.079182,R:0.057187,S:0.114374,T:0.030793,U:0.083581,V:0.092379,W:0.08798,X:0.048389,Y:0.039591,Z:0.048389,a:0.061586,b:0.035192,c:0.127571,d:0.030793,e:0.017596,f:0.026394,g:0.026394,h:0.061586,i:0.04399,j:0.035192,k:0.035192,l:0.039591,q:0.211152,r:0.052788,s:0.048389,t:0.052788,u:0.123172,v:0.180359,w:1.83878,x:0.149566,y:0.285935,z:0.228748,E:5.7231,"4B":0.017596,"5B":0.004399,"6B":0},B:"webkit",C:["","","","","","","J","3","K","F","G","H","A","B","C","L","M","I","N","D","O","4","m","n","o","5","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","OB","PB","QB","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","1B","fB","2B","gB","hB","iB","jB","kB","lB","mB","nB","oB","pB","qB","p","rB","sB","tB","uB","vB","P","Q","R","S","T","U","V","W","X","Y","Z","a","b","c","d","e","f","g","h","i","j","k","l","q","r","s","t","u","v","w","x","y","z","0","1","2","E","4B","5B","6B"],E:"Chrome",F:{"0":1682985600,"1":1685404800,"2":1689724800,"3":1274745600,"4":1332892800,"5":1348531200,"6":1352246400,"7":1357862400,"8":1361404800,"9":1364428800,J:1264377600,K:1283385600,F:1287619200,G:1291248000,H:1296777600,A:1299542400,B:1303862400,C:1307404800,L:1312243200,M:1316131200,I:1316131200,N:1319500800,D:1323734400,O:1328659200,m:1337040000,n:1340668800,o:1343692800,AB:1369094400,BB:1374105600,CB:1376956800,DB:1384214400,EB:1389657600,FB:1392940800,GB:1397001600,HB:1400544000,IB:1405468800,JB:1409011200,KB:1412640000,LB:1416268800,MB:1421798400,NB:1425513600,OB:1429401600,PB:1432080000,QB:1437523200,RB:1441152000,SB:1444780800,TB:1449014400,UB:1453248000,VB:1456963200,WB:1460592000,XB:1464134400,YB:1469059200,ZB:1472601600,aB:1476230400,bB:1480550400,cB:1485302400,dB:1489017600,eB:1492560000,"1B":1496707200,fB:1500940800,"2B":1504569600,gB:1508198400,hB:1512518400,iB:1516752000,jB:1520294400,kB:1523923200,lB:1527552000,mB:1532390400,nB:1536019200,oB:1539648000,pB:1543968000,qB:1548720000,p:1552348800,rB:1555977600,sB:1559606400,tB:1564444800,uB:1568073600,vB:1571702400,P:1575936000,Q:1580860800,R:1586304000,S:1589846400,T:1594684800,U:1598313600,V:1601942400,W:1605571200,X:1611014400,Y:1614556800,Z:1618272000,a:1621987200,b:1626739200,c:1630368000,d:1632268800,e:1634601600,f:1637020800,g:1641340800,h:1643673600,i:1646092800,j:1648512000,k:1650931200,l:1653350400,q:1655769600,r:1659398400,s:1661817600,t:1664236800,u:1666656000,v:1669680000,w:1673308800,x:1675728000,y:1678147200,z:1680566400,E:1692057600,"4B":null,"5B":null,"6B":null}},E:{A:{"3":0,J:0,K:0,F:0,G:0,H:0,A:0,B:0,C:0,L:0.017596,M:0.105576,I:0.017596,D:0.026394,PC:0,"7B":0,QC:0.008798,RC:0,SC:0,TC:0.140768,"8B":0,wB:0.004399,xB:0.030793,"9B":0.136369,UC:0.255142,VC:0.039591,AC:0.035192,BC:0.070384,yB:0.123172,WC:0.576269,zB:0.171561,CC:0.180359,DC:0.184758,EC:0.422304,FC:0.189157,GC:1.15254,HC:1.65402,XC:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","PC","7B","J","3","QC","K","RC","F","SC","G","H","TC","A","8B","B","wB","C","xB","L","9B","M","UC","I","VC","AC","BC","yB","WC","zB","CC","DC","EC","FC","GC","HC","D","XC",""],E:"Safari",F:{"3":1275868800,PC:1205798400,"7B":1226534400,J:1244419200,QC:1311120000,K:1343174400,RC:1382400000,F:1382400000,SC:1410998400,G:1413417600,H:1443657600,TC:1458518400,A:1474329600,"8B":1490572800,B:1505779200,wB:1522281600,C:1537142400,xB:1553472000,L:1568851200,"9B":1585008000,M:1600214400,UC:1619395200,I:1632096000,VC:1635292800,AC:1639353600,BC:1647216000,yB:1652745600,WC:1658275200,zB:1662940800,CC:1666569600,DC:1670889600,EC:1674432000,FC:1679875200,GC:1684368000,HC:1690156800,D:null,XC:null}},F:{A:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,H:0,B:0,C:0,I:0,N:0,D:0,O:0,m:0,n:0,o:0,AB:0.004399,BB:0,CB:0,DB:0,EB:0,FB:0,GB:0,HB:0,IB:0,JB:0,KB:0,LB:0,MB:0,NB:0,OB:0,PB:0,QB:0,RB:0,SB:0.013197,TB:0,UB:0,VB:0,WB:0,XB:0,YB:0,ZB:0,aB:0,bB:0,cB:0,dB:0,eB:0,fB:0,gB:0,hB:0,iB:0,jB:0,kB:0,lB:0,mB:0,nB:0,oB:0,pB:0,qB:0,p:0,rB:0,sB:0,tB:0,uB:0,vB:0,P:0,Q:0,R:0,"3B":0,S:0,T:0,U:0.004399,V:0,W:0,X:0,Y:0,Z:0,a:0,b:0,c:0,d:0,e:0.057187,f:0,g:0.079182,h:0,i:0.030793,j:0.83581,k:0.466294,l:0.008798,YC:0,ZC:0,aC:0,bC:0,wB:0,IC:0,cC:0,xB:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","H","YC","ZC","aC","bC","B","wB","IC","cC","C","xB","I","N","D","O","4","m","n","o","5","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","OB","PB","QB","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","fB","gB","hB","iB","jB","kB","lB","mB","nB","oB","pB","qB","p","rB","sB","tB","uB","vB","P","Q","R","3B","S","T","U","V","W","X","Y","Z","a","b","c","d","e","f","g","h","i","j","k","l","","",""],E:"Opera",F:{"4":1390867200,"5":1405987200,"6":1409616000,"7":1413331200,"8":1417132800,"9":1422316800,H:1150761600,YC:1223424000,ZC:1251763200,aC:1267488000,bC:1277942400,B:1292457600,wB:1302566400,IC:1309219200,cC:1323129600,C:1323129600,xB:1352073600,I:1372723200,N:1377561600,D:1381104000,O:1386288000,m:1393891200,n:1399334400,o:1401753600,AB:1425945600,BB:1430179200,CB:1433808000,DB:1438646400,EB:1442448000,FB:1445904000,GB:1449100800,HB:1454371200,IB:1457308800,JB:1462320000,KB:1465344000,LB:1470096000,MB:1474329600,NB:1477267200,OB:1481587200,PB:1486425600,QB:1490054400,RB:1494374400,SB:1498003200,TB:1502236800,UB:1506470400,VB:1510099200,WB:1515024000,XB:1517961600,YB:1521676800,ZB:1525910400,aB:1530144000,bB:1534982400,cB:1537833600,dB:1543363200,eB:1548201600,fB:1554768000,gB:1561593600,hB:1566259200,iB:1570406400,jB:1573689600,kB:1578441600,lB:1583971200,mB:1587513600,nB:1592956800,oB:1595894400,pB:1600128000,qB:1603238400,p:1613520000,rB:1612224000,sB:1616544000,tB:1619568000,uB:1623715200,vB:1627948800,P:1631577600,Q:1633392000,R:1635984000,"3B":1638403200,S:1642550400,T:1644969600,U:1647993600,V:1650412800,W:1652745600,X:1654646400,Y:1657152000,Z:1660780800,a:1663113600,b:1668816000,c:1668643200,d:1671062400,e:1675209600,f:1677024000,g:1679529600,h:1681948800,i:1684195200,j:1687219200,k:1690329600,l:1692748800},D:{H:"o",B:"o",C:"o",YC:"o",ZC:"o",aC:"o",bC:"o",wB:"o",IC:"o",cC:"o",xB:"o"}},G:{A:{G:0,D:0.0965185,"7B":0,dC:0,JC:0.00279764,eC:0.00419646,fC:0.00279764,gC:0.0125894,hC:0.00419646,iC:0.00839291,jC:0.0391669,kC:0.00279764,lC:0.0545539,mC:0.0223811,nC:0.0195835,oC:0.015387,pC:0.257383,qC:0.00699409,rC:0.0111905,sC:0.0181846,tC:0.0573516,uC:0.149674,vC:0.257383,wC:0.0965185,AC:0.10631,BC:0.120298,yB:0.170656,xC:1.13864,zB:0.43783,CC:0.863071,DC:0.440628,EC:0.879857,FC:0.211222,GC:2.6032,HC:5.87084},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","7B","dC","JC","eC","fC","gC","G","hC","iC","jC","kC","lC","mC","nC","oC","pC","qC","rC","sC","tC","uC","vC","wC","AC","BC","yB","xC","zB","CC","DC","EC","FC","GC","HC","D",""],E:"Safari on iOS",F:{"7B":1270252800,dC:1283904000,JC:1299628800,eC:1331078400,fC:1359331200,gC:1394409600,G:1410912000,hC:1413763200,iC:1442361600,jC:1458518400,kC:1473724800,lC:1490572800,mC:1505779200,nC:1522281600,oC:1537142400,pC:1553472000,qC:1568851200,rC:1572220800,sC:1580169600,tC:1585008000,uC:1600214400,vC:1619395200,wC:1632096000,AC:1639353600,BC:1647216000,yB:1652659200,xC:1658275200,zB:1662940800,CC:1666569600,DC:1670889600,EC:1674432000,FC:1679875200,GC:1684368000,HC:null,D:null}},H:{A:{yC:1.08194},B:"o",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","yC","","",""],E:"Opera Mini",F:{yC:1426464000}},I:{A:{"0B":0,J:0.0136938,E:0,zC:0,"0C":0.00684689,"1C":0,"2C":0.0273876,JC:0.0479282,"3C":0,"4C":0.212254},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","zC","0C","1C","0B","J","2C","JC","3C","4C","E","","",""],E:"Android Browser",F:{zC:1256515200,"0C":1274313600,"1C":1291593600,"0B":1298332800,J:1318896000,"2C":1341792000,JC:1374624000,"3C":1386547200,"4C":1401667200,E:1692057600}},J:{A:{F:0,A:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","F","A","","",""],E:"Blackberry Browser",F:{F:1325376000,A:1359504000}},K:{A:{A:0,B:0,C:0,p:0,wB:0,IC:0,xB:0},B:"o",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A","B","wB","IC","C","xB","p","","",""],E:"Opera Mobile",F:{A:1287100800,B:1300752000,wB:1314835200,IC:1318291200,C:1330300800,xB:1349740800,p:1673827200},D:{p:"webkit"}},L:{A:{E:37.5486},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","E","","",""],E:"Chrome for Android",F:{E:1692057600}},M:{A:{E:0.263294},B:"moz",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","E","","",""],E:"Firefox for Android",F:{E:1690848000}},N:{A:{A:0,B:0},B:"ms",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A","B","","",""],E:"IE Mobile",F:{A:1340150400,B:1353456000}},O:{A:{yB:1.00276},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","yB","","",""],E:"UC Browser for Android",F:{yB:1687132800},D:{yB:"webkit"}},P:{A:{J:0.115947,m:0.0843248,n:0.210812,o:0,"5C":0,"6C":0,"7C":0.0421624,"8C":0,"9C":0,"8B":0,AD:0.0105406,BD:0,CD:0.0210812,DD:0.0210812,ED:0,zB:0.0316218,FD:0.0316218,GD:0.0316218,HD:0.052703},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","J","5C","6C","7C","8C","9C","8B","AD","BD","CD","DD","ED","zB","FD","GD","HD","m","n","o","","",""],E:"Samsung Internet",F:{J:1461024000,"5C":1481846400,"6C":1509408000,"7C":1528329600,"8C":1546128000,"9C":1554163200,"8B":1567900800,AD:1582588800,BD:1593475200,CD:1605657600,DD:1618531200,ED:1629072000,zB:1640736000,FD:1651708800,GD:1659657600,HD:1667260800,m:1677369600,n:1684454400,o:1689292800}},Q:{A:{"9B":0.173662},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","9B","","",""],E:"QQ Browser",F:{"9B":1663718400}},R:{A:{ID:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","ID","","",""],E:"Baidu Browser",F:{ID:1663027200}},S:{A:{JD:0.05602,KD:0},B:"moz",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","JD","KD","","",""],E:"KaiOS Browser",F:{JD:1527811200,KD:1631664000}}};
+module.exports={A:{A:{J:0,D:0,E:0.0259843,F:0.0649608,A:0,B:0.389765,NC:0},B:"ms",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","NC","J","D","E","F","A","B","","",""],E:"IE",F:{NC:962323200,J:998870400,D:1161129600,E:1237420800,F:1300060800,A:1346716800,B:1381968000}},B:{A:{"0":0.02721,"1":0.176865,"2":0.14512,"3":2.54867,C:0.004535,K:0.004535,L:0.004535,G:0.004535,M:0,N:0.004535,O:0.013605,P:0,Q:0.00907,R:0.00907,S:0.00907,T:0.00907,U:0.004535,V:0.00907,W:0.004535,X:0.004535,Y:0.004535,Z:0.00907,a:0,b:0.013605,c:0,d:0,e:0,f:0,g:0,h:0,i:0.013605,j:0,k:0,l:0,m:0,r:0,s:0,t:0,u:0.00907,v:0.00907,w:0.07256,x:0.013605,y:0.12698,z:0.12698,H:1.76865},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","C","K","L","G","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z","a","b","c","d","e","f","g","h","i","j","k","l","m","r","s","t","u","v","w","x","y","z","0","1","2","3","H","","",""],E:"Edge",F:{"0":1683158400,"1":1685664000,"2":1689897600,"3":1692576000,C:1438128000,K:1447286400,L:1470096000,G:1491868800,M:1508198400,N:1525046400,O:1542067200,P:1579046400,Q:1581033600,R:1586736000,S:1590019200,T:1594857600,U:1598486400,V:1602201600,W:1605830400,X:1611360000,Y:1614816000,Z:1618358400,a:1622073600,b:1626912000,c:1630627200,d:1632441600,e:1634774400,f:1637539200,g:1641427200,h:1643932800,i:1646265600,j:1649635200,k:1651190400,l:1653955200,m:1655942400,r:1659657600,s:1661990400,t:1664755200,u:1666915200,v:1670198400,w:1673481600,x:1675900800,y:1678665600,z:1680825600,H:1694649600},D:{C:"ms",K:"ms",L:"ms",G:"ms",M:"ms",N:"ms",O:"ms"}},C:{A:{"0":0.01814,"1":0.01814,"2":0.31745,"3":0.113375,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,OC:0,"3B":0,I:0,J:0,D:0,E:0,F:0,A:0,B:0.00907,C:0,K:0,L:0,G:0,M:0,N:0,O:0,n:0,o:0,p:0,AB:0,BB:0,CB:0,DB:0,EB:0,FB:0,GB:0,HB:0,IB:0,JB:0,KB:0,LB:0,MB:0,NB:0,OB:0,PB:0,QB:0.004535,RB:0.004535,SB:0.004535,TB:0,UB:0,VB:0.01814,WB:0,XB:0.00907,YB:0,ZB:0.05442,aB:0.00907,bB:0.00907,cB:0,dB:0.013605,eB:0,fB:0,"4B":0.004535,gB:0,"5B":0,hB:0,iB:0,jB:0,kB:0,lB:0,mB:0,nB:0,oB:0,pB:0,qB:0,rB:0.013605,q:0,sB:0,tB:0,uB:0,vB:0,wB:0.03628,P:0,Q:0,R:0,"6B":0,S:0.004535,T:0,U:0,V:0,W:0,X:0.004535,Y:0.004535,Z:0,a:0.004535,b:0,c:0,d:0.004535,e:0,f:0,g:0,h:0,i:0,j:0,k:0,l:0.11791,m:0.022675,r:0,s:0.004535,t:0.004535,u:0.004535,v:0.00907,w:0.00907,x:0.00907,y:0.00907,z:0.06349,H:1.56457,xB:0.13605,"7B":0,"8B":0,PC:0,QC:0,RC:0},B:"moz",C:["OC","3B","QC","RC","I","4","J","D","E","F","A","B","C","K","L","G","M","N","O","5","n","o","p","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","OB","PB","QB","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","fB","4B","gB","5B","hB","iB","jB","kB","lB","mB","nB","oB","pB","qB","rB","q","sB","tB","uB","vB","wB","P","Q","R","6B","S","T","U","V","W","X","Y","Z","a","b","c","d","e","f","g","h","i","j","k","l","m","r","s","t","u","v","w","x","y","z","0","1","2","3","H","xB","7B","8B","PC"],E:"Firefox",F:{"0":1683590400,"1":1686009600,"2":1688428800,"3":1690848000,"4":1308614400,"5":1357603200,"6":1372118400,"7":1375747200,"8":1379376000,"9":1386633600,OC:1161648000,"3B":1213660800,QC:1246320000,RC:1264032000,I:1300752000,J:1313452800,D:1317081600,E:1317081600,F:1320710400,A:1324339200,B:1327968000,C:1331596800,K:1335225600,L:1338854400,G:1342483200,M:1346112000,N:1349740800,O:1353628800,n:1361232000,o:1364860800,p:1368489600,AB:1391472000,BB:1395100800,CB:1398729600,DB:1402358400,EB:1405987200,FB:1409616000,GB:1413244800,HB:1417392000,IB:1421107200,JB:1424736000,KB:1428278400,LB:1431475200,MB:1435881600,NB:1439251200,OB:1442880000,PB:1446508800,QB:1450137600,RB:1453852800,SB:1457395200,TB:1461628800,UB:1465257600,VB:1470096000,WB:1474329600,XB:1479168000,YB:1485216000,ZB:1488844800,aB:1492560000,bB:1497312000,cB:1502150400,dB:1506556800,eB:1510617600,fB:1516665600,"4B":1520985600,gB:1525824000,"5B":1529971200,hB:1536105600,iB:1540252800,jB:1544486400,kB:1548720000,lB:1552953600,mB:1558396800,nB:1562630400,oB:1567468800,pB:1571788800,qB:1575331200,rB:1578355200,q:1581379200,sB:1583798400,tB:1586304000,uB:1588636800,vB:1591056000,wB:1593475200,P:1595894400,Q:1598313600,R:1600732800,"6B":1603152000,S:1605571200,T:1607990400,U:1611619200,V:1614038400,W:1616457600,X:1618790400,Y:1622505600,Z:1626134400,a:1628553600,b:1630972800,c:1633392000,d:1635811200,e:1638835200,f:1641859200,g:1644364800,h:1646697600,i:1649116800,j:1651536000,k:1653955200,l:1656374400,m:1658793600,r:1661212800,s:1663632000,t:1666051200,u:1668470400,v:1670889600,w:1673913600,x:1676332800,y:1678752000,z:1681171200,H:1693267200,xB:1695686400,"7B":null,"8B":null,PC:null}},D:{A:{"0":0.15419,"1":0.829905,"2":1.44213,"3":15.3691,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,I:0,J:0,D:0,E:0,F:0,A:0,B:0,C:0,K:0,L:0,G:0,M:0,N:0,O:0,n:0,o:0,p:0,AB:0,BB:0,CB:0,DB:0,EB:0,FB:0,GB:0,HB:0.004535,IB:0,JB:0,KB:0,LB:0.013605,MB:0,NB:0,OB:0,PB:0,QB:0,RB:0,SB:0,TB:0,UB:0.00907,VB:0.01814,WB:0.03628,XB:0.00907,YB:0.004535,ZB:0,aB:0.00907,bB:0,cB:0.00907,dB:0.031745,eB:0.00907,fB:0.00907,"4B":0,gB:0.02721,"5B":0.004535,hB:0.004535,iB:0.004535,jB:0,kB:0.013605,lB:0.022675,mB:0.004535,nB:0.031745,oB:0.06349,pB:0.077095,qB:0.022675,rB:0.031745,q:0.040815,sB:0.040815,tB:0.040815,uB:0.104305,vB:0.03628,wB:0.04535,P:0.204075,Q:0.068025,R:0.06349,S:0.113375,T:0.03628,U:0.086165,V:0.0907,W:0.09977,X:0.058955,Y:0.04535,Z:0.068025,a:0.07256,b:0.02721,c:0.131515,d:0.02721,e:0.013605,f:0.022675,g:0.02721,h:0.068025,i:0.04535,j:0.031745,k:0.03628,l:0.040815,m:0.21768,r:0.04535,s:0.049885,t:0.05442,u:0.17233,v:0.213145,w:1.78679,x:0.185935,y:0.32652,z:0.24489,H:3.86382,xB:0.022675,"7B":0.013605,"8B":0},B:"webkit",C:["","","","","","","I","4","J","D","E","F","A","B","C","K","L","G","M","N","O","5","n","o","p","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","OB","PB","QB","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","fB","4B","gB","5B","hB","iB","jB","kB","lB","mB","nB","oB","pB","qB","rB","q","sB","tB","uB","vB","wB","P","Q","R","S","T","U","V","W","X","Y","Z","a","b","c","d","e","f","g","h","i","j","k","l","m","r","s","t","u","v","w","x","y","z","0","1","2","3","H","xB","7B","8B"],E:"Chrome",F:{"0":1682985600,"1":1685404800,"2":1689724800,"3":1692057600,"4":1274745600,"5":1332892800,"6":1348531200,"7":1352246400,"8":1357862400,"9":1361404800,I:1264377600,J:1283385600,D:1287619200,E:1291248000,F:1296777600,A:1299542400,B:1303862400,C:1307404800,K:1312243200,L:1316131200,G:1316131200,M:1319500800,N:1323734400,O:1328659200,n:1337040000,o:1340668800,p:1343692800,AB:1364428800,BB:1369094400,CB:1374105600,DB:1376956800,EB:1384214400,FB:1389657600,GB:1392940800,HB:1397001600,IB:1400544000,JB:1405468800,KB:1409011200,LB:1412640000,MB:1416268800,NB:1421798400,OB:1425513600,PB:1429401600,QB:1432080000,RB:1437523200,SB:1441152000,TB:1444780800,UB:1449014400,VB:1453248000,WB:1456963200,XB:1460592000,YB:1464134400,ZB:1469059200,aB:1472601600,bB:1476230400,cB:1480550400,dB:1485302400,eB:1489017600,fB:1492560000,"4B":1496707200,gB:1500940800,"5B":1504569600,hB:1508198400,iB:1512518400,jB:1516752000,kB:1520294400,lB:1523923200,mB:1527552000,nB:1532390400,oB:1536019200,pB:1539648000,qB:1543968000,rB:1548720000,q:1552348800,sB:1555977600,tB:1559606400,uB:1564444800,vB:1568073600,wB:1571702400,P:1575936000,Q:1580860800,R:1586304000,S:1589846400,T:1594684800,U:1598313600,V:1601942400,W:1605571200,X:1611014400,Y:1614556800,Z:1618272000,a:1621987200,b:1626739200,c:1630368000,d:1632268800,e:1634601600,f:1637020800,g:1641340800,h:1643673600,i:1646092800,j:1648512000,k:1650931200,l:1653350400,m:1655769600,r:1659398400,s:1661817600,t:1664236800,u:1666656000,v:1669680000,w:1673308800,x:1675728000,y:1678147200,z:1680566400,H:1694476800,xB:null,"7B":null,"8B":null}},E:{A:{"4":0,I:0,J:0,D:0,E:0,F:0,A:0,B:0,C:0,K:0.01814,L:0.0907,G:0.01814,SC:0,"9B":0,TC:0.00907,UC:0,VC:0,WC:0.1814,AC:0,yB:0.004535,zB:0.02721,BC:0.131515,XC:0.240355,YC:0.040815,CC:0.03628,DC:0.068025,"0B":0.10884,ZC:0.5442,"1B":0.068025,EC:0.158725,FC:0.15419,GC:0.3628,HC:0.185935,IC:0.44443,JC:2.50332,"2B":0.09977,KC:0,aC:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","SC","9B","I","4","TC","J","UC","D","VC","E","F","WC","A","AC","B","yB","C","zB","K","BC","L","XC","G","YC","CC","DC","0B","ZC","1B","EC","FC","GC","HC","IC","JC","2B","KC","aC",""],E:"Safari",F:{"4":1275868800,SC:1205798400,"9B":1226534400,I:1244419200,TC:1311120000,J:1343174400,UC:1382400000,D:1382400000,VC:1410998400,E:1413417600,F:1443657600,WC:1458518400,A:1474329600,AC:1490572800,B:1505779200,yB:1522281600,C:1537142400,zB:1553472000,K:1568851200,BC:1585008000,L:1600214400,XC:1619395200,G:1632096000,YC:1635292800,CC:1639353600,DC:1647216000,"0B":1652745600,ZC:1658275200,"1B":1662940800,EC:1666569600,FC:1670889600,GC:1674432000,HC:1679875200,IC:1684368000,JC:1690156800,"2B":1695686400,KC:null,aC:null}},F:{A:{"5":0,"6":0,"7":0,"8":0,"9":0,F:0,B:0,C:0,G:0,M:0,N:0,O:0,n:0,o:0,p:0,AB:0,BB:0.004535,CB:0,DB:0,EB:0,FB:0,GB:0,HB:0,IB:0,JB:0,KB:0,LB:0,MB:0,NB:0,OB:0,PB:0,QB:0,RB:0,SB:0,TB:0.013605,UB:0,VB:0,WB:0,XB:0,YB:0,ZB:0,aB:0,bB:0.004535,cB:0.004535,dB:0,eB:0,fB:0,gB:0,hB:0,iB:0,jB:0,kB:0,lB:0,mB:0,nB:0,oB:0,pB:0,qB:0,rB:0,q:0,sB:0,tB:0,uB:0,vB:0.004535,wB:0,P:0,Q:0,R:0,"6B":0,S:0,T:0,U:0.004535,V:0,W:0,X:0,Y:0.004535,Z:0,a:0,b:0,c:0,d:0,e:0.05442,f:0,g:0.11791,h:0,i:0.022675,j:0.26303,k:0.58048,l:0.64397,m:0,bC:0,cC:0,dC:0,eC:0,yB:0,LC:0,fC:0,zB:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","F","bC","cC","dC","eC","B","yB","LC","fC","C","zB","G","M","N","O","5","n","o","p","6","7","8","9","AB","BB","CB","DB","EB","FB","GB","HB","IB","JB","KB","LB","MB","NB","OB","PB","QB","RB","SB","TB","UB","VB","WB","XB","YB","ZB","aB","bB","cB","dB","eB","fB","gB","hB","iB","jB","kB","lB","mB","nB","oB","pB","qB","rB","q","sB","tB","uB","vB","wB","P","Q","R","6B","S","T","U","V","W","X","Y","Z","a","b","c","d","e","f","g","h","i","j","k","l","m","","",""],E:"Opera",F:{"5":1390867200,"6":1405987200,"7":1409616000,"8":1413331200,"9":1417132800,F:1150761600,bC:1223424000,cC:1251763200,dC:1267488000,eC:1277942400,B:1292457600,yB:1302566400,LC:1309219200,fC:1323129600,C:1323129600,zB:1352073600,G:1372723200,M:1377561600,N:1381104000,O:1386288000,n:1393891200,o:1399334400,p:1401753600,AB:1422316800,BB:1425945600,CB:1430179200,DB:1433808000,EB:1438646400,FB:1442448000,GB:1445904000,HB:1449100800,IB:1454371200,JB:1457308800,KB:1462320000,LB:1465344000,MB:1470096000,NB:1474329600,OB:1477267200,PB:1481587200,QB:1486425600,RB:1490054400,SB:1494374400,TB:1498003200,UB:1502236800,VB:1506470400,WB:1510099200,XB:1515024000,YB:1517961600,ZB:1521676800,aB:1525910400,bB:1530144000,cB:1534982400,dB:1537833600,eB:1543363200,fB:1548201600,gB:1554768000,hB:1561593600,iB:1566259200,jB:1570406400,kB:1573689600,lB:1578441600,mB:1583971200,nB:1587513600,oB:1592956800,pB:1595894400,qB:1600128000,rB:1603238400,q:1613520000,sB:1612224000,tB:1616544000,uB:1619568000,vB:1623715200,wB:1627948800,P:1631577600,Q:1633392000,R:1635984000,"6B":1638403200,S:1642550400,T:1644969600,U:1647993600,V:1650412800,W:1652745600,X:1654646400,Y:1657152000,Z:1660780800,a:1663113600,b:1668816000,c:1668643200,d:1671062400,e:1675209600,f:1677024000,g:1679529600,h:1681948800,i:1684195200,j:1687219200,k:1690329600,l:1692748800,m:1696204800},D:{F:"o",B:"o",C:"o",bC:"o",cC:"o",dC:"o",eC:"o",yB:"o",LC:"o",fC:"o",zB:"o"}},G:{A:{E:0,"9B":0,gC:0,MC:0.00285607,hC:0.00285607,iC:0.00285607,jC:0.00999624,kC:0.00285607,lC:0.00999624,mC:0.0342728,nC:0.00142803,oC:0.0514092,pC:0.0214205,qC:0.0157084,rC:0.0142803,sC:0.238482,tC:0.00714017,uC:0.0128523,vC:0.155656,wC:0.0499812,xC:0.135663,yC:0.225629,zC:0.0899662,CC:0.0985344,DC:0.112815,"0B":0.157084,"0C":1.03961,"1B":0.411274,EC:0.761142,FC:0.386997,GC:0.722585,HC:0.164224,IC:0.489816,JC:7.98414,"2B":0.704021,KC:0.00142803},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","9B","gC","MC","hC","iC","jC","E","kC","lC","mC","nC","oC","pC","qC","rC","sC","tC","uC","vC","wC","xC","yC","zC","CC","DC","0B","0C","1B","EC","FC","GC","HC","IC","JC","2B","KC","",""],E:"Safari on iOS",F:{"9B":1270252800,gC:1283904000,MC:1299628800,hC:1331078400,iC:1359331200,jC:1394409600,E:1410912000,kC:1413763200,lC:1442361600,mC:1458518400,nC:1473724800,oC:1490572800,pC:1505779200,qC:1522281600,rC:1537142400,sC:1553472000,tC:1568851200,uC:1572220800,vC:1580169600,wC:1585008000,xC:1600214400,yC:1619395200,zC:1632096000,CC:1639353600,DC:1647216000,"0B":1652659200,"0C":1658275200,"1B":1662940800,EC:1666569600,FC:1670889600,GC:1674432000,HC:1679875200,IC:1684368000,JC:1690156800,"2B":1694995200,KC:null}},H:{A:{"1C":1.02942},B:"o",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","1C","","",""],E:"Opera Mini",F:{"1C":1426464000}},I:{A:{"3B":0,I:0.0156469,H:0,"2C":0,"3C":0.0156469,"4C":0,"5C":0.0156469,MC:0.0547642,"6C":0,"7C":0.242527},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","2C","3C","4C","3B","I","5C","MC","6C","7C","H","","",""],E:"Android Browser",F:{"2C":1256515200,"3C":1274313600,"4C":1291593600,"3B":1298332800,I:1318896000,"5C":1341792000,MC:1374624000,"6C":1386547200,"7C":1401667200,H:1694476800}},J:{A:{D:0,A:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","D","A","","",""],E:"Blackberry Browser",F:{D:1325376000,A:1359504000}},K:{A:{A:0,B:0,C:0,q:0,yB:0,LC:0,zB:0},B:"o",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A","B","yB","LC","C","zB","q","","",""],E:"Opera Mobile",F:{A:1287100800,B:1300752000,yB:1314835200,LC:1318291200,C:1330300800,zB:1349740800,q:1673827200},D:{q:"webkit"}},L:{A:{H:36.3803},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","H","","",""],E:"Chrome for Android",F:{H:1694476800}},M:{A:{xB:0.278664},B:"moz",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","xB","","",""],E:"Firefox for Android",F:{xB:1695686400}},N:{A:{A:0,B:0},B:"ms",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","A","B","","",""],E:"IE Mobile",F:{A:1340150400,B:1353456000}},O:{A:{"0B":0.890632},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","0B","","",""],E:"UC Browser for Android",F:{"0B":1687132800},D:{"0B":"webkit"}},P:{A:{I:0.107075,n:0.0642449,o:0.139197,p:1.87381,"8C":0,"9C":0,AD:0.0321224,BD:0,CD:0,AC:0,DD:0.0107075,ED:0,FD:0.021415,GD:0.0107075,HD:0,"1B":0.021415,"2B":0.0321224,ID:0.021415,JD:0.0535374},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","I","8C","9C","AD","BD","CD","AC","DD","ED","FD","GD","HD","1B","2B","ID","JD","n","o","p","","",""],E:"Samsung Internet",F:{I:1461024000,"8C":1481846400,"9C":1509408000,AD:1528329600,BD:1546128000,CD:1554163200,AC:1567900800,DD:1582588800,ED:1593475200,FD:1605657600,GD:1618531200,HD:1629072000,"1B":1640736000,"2B":1651708800,ID:1659657600,JD:1667260800,n:1677369600,o:1684454400,p:1689292800}},Q:{A:{BC:0.16392},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","BC","","",""],E:"QQ Browser",F:{BC:1663718400}},R:{A:{KD:0},B:"webkit",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","KD","","",""],E:"Baidu Browser",F:{KD:1663027200}},S:{A:{LD:0.05464,MD:0},B:"moz",C:["","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","","LD","MD","","",""],E:"KaiOS Browser",F:{LD:1527811200,MD:1631664000}}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/browserVersions.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/browserVersions.js
index 443b01de780546..cb228a7682528d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/browserVersions.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/browserVersions.js
@@ -1 +1 @@
-module.exports={"0":"113","1":"114","2":"115","3":"5","4":"19","5":"23","6":"24","7":"25","8":"26","9":"27",A:"10",B:"11",C:"12",D:"17",E:"116",F:"7",G:"8",H:"9",I:"15",J:"4",K:"6",L:"13",M:"14",N:"16",O:"18",P:"79",Q:"80",R:"81",S:"83",T:"84",U:"85",V:"86",W:"87",X:"88",Y:"89",Z:"90",a:"91",b:"92",c:"93",d:"94",e:"95",f:"96",g:"97",h:"98",i:"99",j:"100",k:"101",l:"102",m:"20",n:"21",o:"22",p:"73",q:"103",r:"104",s:"105",t:"106",u:"107",v:"108",w:"109",x:"110",y:"111",z:"112",AB:"28",BB:"29",CB:"30",DB:"31",EB:"32",FB:"33",GB:"34",HB:"35",IB:"36",JB:"37",KB:"38",LB:"39",MB:"40",NB:"41",OB:"42",PB:"43",QB:"44",RB:"45",SB:"46",TB:"47",UB:"48",VB:"49",WB:"50",XB:"51",YB:"52",ZB:"53",aB:"54",bB:"55",cB:"56",dB:"57",eB:"58",fB:"60",gB:"62",hB:"63",iB:"64",jB:"65",kB:"66",lB:"67",mB:"68",nB:"69",oB:"70",pB:"71",qB:"72",rB:"74",sB:"75",tB:"76",uB:"77",vB:"78",wB:"11.1",xB:"12.1",yB:"15.5",zB:"16.0","0B":"3","1B":"59","2B":"61","3B":"82","4B":"117","5B":"118","6B":"119","7B":"3.2","8B":"10.1","9B":"13.1",AC:"15.2-15.3",BC:"15.4",CC:"16.1",DC:"16.2",EC:"16.3",FC:"16.4",GC:"16.5",HC:"16.6",IC:"11.5",JC:"4.2-4.3",KC:"5.5",LC:"2",MC:"120",NC:"3.5",OC:"3.6",PC:"3.1",QC:"5.1",RC:"6.1",SC:"7.1",TC:"9.1",UC:"14.1",VC:"15.1",WC:"15.6",XC:"TP",YC:"9.5-9.6",ZC:"10.0-10.1",aC:"10.5",bC:"10.6",cC:"11.6",dC:"4.0-4.1",eC:"5.0-5.1",fC:"6.0-6.1",gC:"7.0-7.1",hC:"8.1-8.4",iC:"9.0-9.2",jC:"9.3",kC:"10.0-10.2",lC:"10.3",mC:"11.0-11.2",nC:"11.3-11.4",oC:"12.0-12.1",pC:"12.2-12.5",qC:"13.0-13.1",rC:"13.2",sC:"13.3",tC:"13.4-13.7",uC:"14.0-14.4",vC:"14.5-14.8",wC:"15.0-15.1",xC:"15.6-15.7",yC:"all",zC:"2.1","0C":"2.2","1C":"2.3","2C":"4.1","3C":"4.4","4C":"4.4.3-4.4.4","5C":"5.0-5.4","6C":"6.2-6.4","7C":"7.2-7.4","8C":"8.2","9C":"9.2",AD:"11.1-11.2",BD:"12.0",CD:"13.0",DD:"14.0",ED:"15.0",FD:"17.0",GD:"18.0",HD:"19.0",ID:"13.18",JD:"2.5",KD:"3.0-3.1"};
+module.exports={"0":"113","1":"114","2":"115","3":"116","4":"5","5":"19","6":"23","7":"24","8":"25","9":"26",A:"10",B:"11",C:"12",D:"7",E:"8",F:"9",G:"15",H:"117",I:"4",J:"6",K:"13",L:"14",M:"16",N:"17",O:"18",P:"79",Q:"80",R:"81",S:"83",T:"84",U:"85",V:"86",W:"87",X:"88",Y:"89",Z:"90",a:"91",b:"92",c:"93",d:"94",e:"95",f:"96",g:"97",h:"98",i:"99",j:"100",k:"101",l:"102",m:"103",n:"20",o:"21",p:"22",q:"73",r:"104",s:"105",t:"106",u:"107",v:"108",w:"109",x:"110",y:"111",z:"112",AB:"27",BB:"28",CB:"29",DB:"30",EB:"31",FB:"32",GB:"33",HB:"34",IB:"35",JB:"36",KB:"37",LB:"38",MB:"39",NB:"40",OB:"41",PB:"42",QB:"43",RB:"44",SB:"45",TB:"46",UB:"47",VB:"48",WB:"49",XB:"50",YB:"51",ZB:"52",aB:"53",bB:"54",cB:"55",dB:"56",eB:"57",fB:"58",gB:"60",hB:"62",iB:"63",jB:"64",kB:"65",lB:"66",mB:"67",nB:"68",oB:"69",pB:"70",qB:"71",rB:"72",sB:"74",tB:"75",uB:"76",vB:"77",wB:"78",xB:"118",yB:"11.1",zB:"12.1","0B":"15.5","1B":"16.0","2B":"17.0","3B":"3","4B":"59","5B":"61","6B":"82","7B":"119","8B":"120","9B":"3.2",AC:"10.1",BC:"13.1",CC:"15.2-15.3",DC:"15.4",EC:"16.1",FC:"16.2",GC:"16.3",HC:"16.4",IC:"16.5",JC:"16.6",KC:"17.1",LC:"11.5",MC:"4.2-4.3",NC:"5.5",OC:"2",PC:"121",QC:"3.5",RC:"3.6",SC:"3.1",TC:"5.1",UC:"6.1",VC:"7.1",WC:"9.1",XC:"14.1",YC:"15.1",ZC:"15.6",aC:"TP",bC:"9.5-9.6",cC:"10.0-10.1",dC:"10.5",eC:"10.6",fC:"11.6",gC:"4.0-4.1",hC:"5.0-5.1",iC:"6.0-6.1",jC:"7.0-7.1",kC:"8.1-8.4",lC:"9.0-9.2",mC:"9.3",nC:"10.0-10.2",oC:"10.3",pC:"11.0-11.2",qC:"11.3-11.4",rC:"12.0-12.1",sC:"12.2-12.5",tC:"13.0-13.1",uC:"13.2",vC:"13.3",wC:"13.4-13.7",xC:"14.0-14.4",yC:"14.5-14.8",zC:"15.0-15.1","0C":"15.6-15.7","1C":"all","2C":"2.1","3C":"2.2","4C":"2.3","5C":"4.1","6C":"4.4","7C":"4.4.3-4.4.4","8C":"5.0-5.4","9C":"6.2-6.4",AD:"7.2-7.4",BD:"8.2",CD:"9.2",DD:"11.1-11.2",ED:"12.0",FD:"13.0",GD:"14.0",HD:"15.0",ID:"18.0",JD:"19.0",KD:"13.18",LD:"2.5",MD:"3.0-3.1"};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/aac.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/aac.js
index 5f001c311f7e89..9a3e56c5765890 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/aac.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/aac.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC","132":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 4 5 6 7 8 9 C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H","16":"A B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"132":"E"},N:{"1":"A","2":"B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"132":"JD KD"}},B:6,C:"AAC audio file format",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC","132":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 5 6 7 8 9 C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F","16":"A B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"132":"xB"},N:{"1":"A","2":"B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"132":"LD MD"}},B:6,C:"AAC audio file format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/abortcontroller.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/abortcontroller.js
index 19232b280d0c00..657fe3dac4b763 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/abortcontroller.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/abortcontroller.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I"},C:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB NC OC"},D:{"1":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B","130":"C wB"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"AbortController & AbortSignal",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G"},C:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB QC RC"},D:{"1":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC","130":"C yB"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"AbortController & AbortSignal",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ac3-ec3.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ac3-ec3.js
index 115d0ff3a3b627..5d4ebb714e435e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ac3-ec3.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ac3-ec3.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"C L M I N D O","2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC","132":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","132":"A"},K:{"2":"A B C p wB IC","132":"xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"AC-3 (Dolby Digital) and EC-3 (Dolby Digital Plus) codecs",D:false};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"C K L G M N O","2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC","132":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","132":"A"},K:{"2":"A B C q yB LC","132":"zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"AC-3 (Dolby Digital) and EC-3 (Dolby Digital Plus) codecs",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/accelerometer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/accelerometer.js
index 593d82438fb432..d18496fbfd38bf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/accelerometer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/accelerometer.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","194":"eB 1B fB 2B gB hB iB jB kB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:4,C:"Accelerometer",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","194":"fB 4B gB 5B hB iB jB kB lB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:4,C:"Accelerometer",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/addeventlistener.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/addeventlistener.js
index 2a31eddb28b4b4..29d4626a7cb7e6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/addeventlistener.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/addeventlistener.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","130":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","257":"3 LC 0B J K NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"EventTarget.addEventListener()",D:true};
+module.exports={A:{A:{"1":"F A B","130":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","257":"4 OC 3B I J QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"EventTarget.addEventListener()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/alternate-stylesheet.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/alternate-stylesheet.js
index ff328c6b915f83..623320d308c53a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/alternate-stylesheet.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/alternate-stylesheet.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","2":"K F KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"H B C YC ZC aC bC wB IC cC xB","16":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"16":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"2":"p","16":"A B C wB IC xB"},L:{"16":"E"},M:{"16":"E"},N:{"16":"A B"},O:{"16":"yB"},P:{"16":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"16":"ID"},S:{"1":"JD KD"}},B:1,C:"Alternate stylesheet",D:false};
+module.exports={A:{A:{"1":"E F A B","2":"J D NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"F B C bC cC dC eC yB LC fC zB","16":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"16":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"2":"q","16":"A B C yB LC zB"},L:{"16":"H"},M:{"16":"xB"},N:{"16":"A B"},O:{"16":"0B"},P:{"16":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"16":"KD"},S:{"1":"LD MD"}},B:1,C:"Alternate stylesheet",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ambient-light.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ambient-light.js
index 4c87da831592e6..c0566bfffe4c2d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ambient-light.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ambient-light.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L","132":"M I N D O","322":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC","132":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B","194":"0 1 2 fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","322":"0 1 2 eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB YC ZC aC bC wB IC cC xB","322":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"132":"JD KD"}},B:4,C:"Ambient Light Sensor",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K","132":"L G M N O","322":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC","132":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B","194":"0 1 2 3 gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","322":"0 1 2 3 fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB bC cC dC eC yB LC fC zB","322":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"132":"LD MD"}},B:4,C:"Ambient Light Sensor",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/apng.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/apng.js
index d02bfd24bc5a30..1f8e47373d0f4f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/apng.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/apng.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC"},D:{"1":"0 1 2 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB"},E:{"1":"G H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC SC"},F:{"1":"B C SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"4 5 6 7 8 9 H I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Animated PNG (APNG)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC"},D:{"1":"0 1 2 3 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB"},E:{"1":"E F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC VC"},F:{"1":"B C TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"5 6 7 8 9 F G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Animated PNG (APNG)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-find-index.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-find-index.js
index 64793a44e5ff3c..2624055f687651 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-find-index.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-find-index.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},E:{"1":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB YC ZC aC bC wB IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","16":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Array.prototype.findIndex",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB"},E:{"1":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB bC cC dC eC yB LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","16":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Array.prototype.findIndex",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-find.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-find.js
index da8cfc3b0764eb..b2e3c529852ce1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-find.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-find.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"C L M"},C:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},E:{"1":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB YC ZC aC bC wB IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","16":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Array.prototype.find",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"C K L"},C:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB"},E:{"1":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB bC cC dC eC yB LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","16":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Array.prototype.find",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-flat.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-flat.js
index a34f215e77fd84..9dc0b0bbb349c5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-flat.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-flat.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B NC OC"},D:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB"},E:{"1":"C L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B wB"},F:{"1":"cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB YC ZC aC bC wB IC cC xB"},G:{"1":"D oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"flat & flatMap array methods",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B QC RC"},D:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB"},E:{"1":"C K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC yB"},F:{"1":"dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB bC cC dC eC yB LC fC zB"},G:{"1":"rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"flat & flatMap array methods",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-includes.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-includes.js
index 20a963a61d207a..277bf986b90b5e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-includes.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/array-includes.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB NC OC"},D:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Array.prototype.includes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QC RC"},D:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Array.prototype.includes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/arrow-functions.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/arrow-functions.js
index 4d3553ba71008f..da01ca25e87a69 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/arrow-functions.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/arrow-functions.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC"},D:{"1":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Arrow functions",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC"},D:{"1":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Arrow functions",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/asmjs.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/asmjs.js
index 588092ab976092..5e7dcd2791403a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/asmjs.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/asmjs.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"L M I N D O","132":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","322":"C"},C:{"1":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o","132":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","132":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","132":"p"},L:{"132":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"132":"yB"},P:{"2":"J","132":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"132":"9B"},R:{"132":"ID"},S:{"1":"JD KD"}},B:6,C:"asm.js",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"K L G M N O","132":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","322":"C"},C:{"1":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB","132":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","132":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","132":"q"},L:{"132":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"132":"0B"},P:{"2":"I","132":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"132":"BC"},R:{"132":"KD"},S:{"1":"LD MD"}},B:6,C:"asm.js",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/async-clipboard.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/async-clipboard.js
index 29df0f7a91ee51..085f3bf4721073 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/async-clipboard.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/async-clipboard.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB NC OC","132":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","66":"eB 1B fB 2B"},E:{"1":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB"},F:{"1":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC","260":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","260":"E"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"132":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J 5C 6C 7C 8C","260":"m n o 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD","132":"KD"}},B:5,C:"Asynchronous Clipboard API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB QC RC","132":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","66":"fB 4B gB 5B"},E:{"1":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB"},F:{"1":"WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC","260":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","260":"H"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"132":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I 8C 9C AD BD","260":"n o p CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD","132":"MD"}},B:5,C:"Asynchronous Clipboard API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/async-functions.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/async-functions.js
index 1dec12fb1011be..186b7d21d2a5b7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/async-functions.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/async-functions.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L","194":"M"},C:{"1":"0 1 2 YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB NC OC"},D:{"1":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC","258":"8B"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC","258":"lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"Async functions",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K","194":"L"},C:{"1":"0 1 2 3 ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB QC RC"},D:{"1":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC","258":"AC"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC","258":"oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"Async functions",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/atob-btoa.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/atob-btoa.js
index a8b2f6e140ed25..f9b3d0abf16811 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/atob-btoa.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/atob-btoa.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","2":"H YC ZC","16":"aC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","16":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Base64 encoding and decoding",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","2":"F bC cC","16":"dC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","16":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Base64 encoding and decoding",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audio-api.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audio-api.js
index c81f42d5ef58cf..16c8da0d13eff6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audio-api.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audio-api.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L","33":"4 5 6 7 8 9 M I N D O m n o AB BB CB DB EB FB"},E:{"1":"I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","33":"K F G H A B C L M RC SC TC 8B wB xB 9B"},F:{"1":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 I N D O m n"},G:{"1":"D vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"G fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Web Audio API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K","33":"5 6 7 8 9 L G M N O n o p AB BB CB DB EB FB GB"},E:{"1":"G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","33":"J D E F A B C K L UC VC WC AC yB zB BC"},F:{"1":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 G M N O n o"},G:{"1":"yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Web Audio API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audio.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audio.js
index 4143dbb240923a..ab9933b1584f31 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audio.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audio.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","132":"3 4 J K F G H A B C L M I N D O NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H","4":"YC ZC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","2":"zC 0C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Audio element",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","132":"4 5 I J D E F A B C K L G M N O QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F","4":"bC cC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","2":"2C 3C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Audio element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audiotracks.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audiotracks.js
index b5c3e621dcab62..2e197407ddefbd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audiotracks.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/audiotracks.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"C L M I N D O","322":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB NC OC","194":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB","322":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB YC ZC aC bC wB IC cC xB","322":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","322":"p"},L:{"322":"E"},M:{"2":"E"},N:{"1":"A B"},O:{"322":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"322":"9B"},R:{"322":"ID"},S:{"194":"JD KD"}},B:1,C:"Audio Tracks",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"C K L G M N O","322":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB QC RC","194":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB","322":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB bC cC dC eC yB LC fC zB","322":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","322":"q"},L:{"322":"H"},M:{"2":"xB"},N:{"1":"A B"},O:{"322":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"322":"BC"},R:{"322":"KD"},S:{"194":"LD MD"}},B:1,C:"Audio Tracks",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/autofocus.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/autofocus.js
index dd0a59a7db5ca2..57da5eb6e8d1f1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/autofocus.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/autofocus.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"Autofocus attribute",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"Autofocus attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/auxclick.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/auxclick.js
index 2e52d8d3ebd0f8..8ea1cb02e221cf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/auxclick.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/auxclick.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB NC OC","129":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:5,C:"Auxclick",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB QC RC","129":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:5,C:"Auxclick",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/av1.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/av1.js
index ffe4dbd66be907..499be400921b87 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/av1.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/av1.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D","194":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB NC OC","66":"bB cB dB eB 1B fB 2B gB hB iB","260":"jB","516":"kB"},D:{"1":"0 1 2 oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB","66":"lB mB nB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:6,C:"AV1 video format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N","194":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB QC RC","66":"cB dB eB fB 4B gB 5B hB iB jB","260":"kB","516":"lB"},D:{"1":"0 1 2 3 pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB","66":"mB nB oB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC","1026":"2B KC aC"},F:{"1":"eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC","1028":"2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:6,C:"AV1 video format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/avif.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/avif.js
index 418d4ba2cc08e1..797cd535d63466 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/avif.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/avif.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z","4162":"1 2 E"},C:{"1":"0 1 2 E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB NC OC","194":"uB vB P Q R 3B S T U V W X Y Z a b","257":"c d e f g h i j k l q r s t u v w x","2049":"y z"},D:{"1":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB","1796":"CC DC EC"},F:{"1":"pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC","257":"D FC GC HC","1281":"zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:6,C:"AVIF image format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z","4162":"1 2 3 H"},C:{"1":"0 1 2 3 H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB QC RC","194":"vB wB P Q R 6B S T U V W X Y Z a b","257":"c d e f g h i j k l m r s t u v w x","2049":"y z"},D:{"1":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B","1796":"EC FC GC"},F:{"1":"qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C","257":"HC IC JC 2B KC","1281":"1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:6,C:"AVIF image format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-attachment.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-attachment.js
index e6d444a089dd5c..8f271c90def47a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-attachment.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-attachment.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","132":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","132":"3 4 5 6 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H A B C D QC RC SC TC 8B wB xB BC yB WC zB CC DC EC FC GC HC XC","132":"J L PC 7B 9B","2050":"M I UC VC AC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","132":"H YC ZC"},G:{"2":"7B dC JC","772":"G eC fC gC hC iC jC kC lC mC nC oC pC","2050":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 3C 4C","132":"2C JC"},J:{"260":"F A"},K:{"1":"B C p wB IC xB","132":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"2":"J","1028":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS background-attachment",D:true};
+module.exports={A:{A:{"1":"F A B","132":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","132":"4 5 6 7 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F A B C TC UC VC WC AC yB zB DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","132":"I K SC 9B BC","2050":"L G XC YC CC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","132":"F bC cC"},G:{"2":"9B gC MC","772":"E hC iC jC kC lC mC nC oC pC qC rC sC","2050":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 6C 7C","132":"5C MC"},J:{"260":"D A"},K:{"1":"B C q yB LC zB","132":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"2":"I","1028":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS background-attachment",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-clip-text.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-clip-text.js
index 4ddf793bda54bb..4c5ebdb38db441 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-clip-text.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-clip-text.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"I N D O","33":"0 1 2 C L M P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB NC OC"},D:{"33":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"M I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC 7B","33":"3 J K F G H A B C L QC RC SC TC 8B wB xB 9B"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC","33":"G fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC"},H:{"2":"yC"},I:{"16":"0B zC 0C 1C","33":"J E 2C JC 3C 4C"},J:{"33":"F A"},K:{"16":"A B C wB IC xB","33":"p"},L:{"33":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"33":"yB"},P:{"33":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"33":"9B"},R:{"33":"ID"},S:{"1":"JD KD"}},B:7,C:"Background-clip: text",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"G M N O","33":"0 1 2 3 C K L P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB QC RC"},D:{"33":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC 9B","33":"4 I J D E F A B C K TC UC VC WC AC yB zB BC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC","33":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC"},H:{"2":"1C"},I:{"16":"3B 2C 3C 4C","33":"I H 5C MC 6C 7C"},J:{"33":"D A"},K:{"16":"A B C yB LC zB","33":"q"},L:{"33":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"33":"0B"},P:{"33":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"33":"BC"},R:{"33":"KD"},S:{"1":"LD MD"}},B:7,C:"Background-clip: text",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-img-opts.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-img-opts.js
index 5e42977de1579f..3d3182690de834 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-img-opts.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-img-opts.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC","36":"OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","516":"3 J K F G H A B C L M"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","772":"3 J K PC 7B QC RC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC","36":"ZC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","4":"7B dC JC fC","516":"eC"},H:{"132":"yC"},I:{"1":"E 3C 4C","36":"zC","516":"0B J 2C JC","548":"0C 1C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 Background-image options",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC","36":"RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","516":"4 I J D E F A B C K L"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","772":"4 I J SC 9B TC UC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC","36":"cC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","4":"9B gC MC iC","516":"hC"},H:{"132":"1C"},I:{"1":"H 6C 7C","36":"2C","516":"3B I 5C MC","548":"3C 4C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 Background-image options",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-position-x-y.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-position-x-y.js
index f40daa6f8ba4c3..e2df0f8eb96eaf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-position-x-y.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-position-x-y.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:7,C:"background-position-x & background-position-y",D:true};
+module.exports={A:{A:{"1":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:7,C:"background-position-x & background-position-y",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-repeat-round-space.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-repeat-round-space.js
index e2e6c2bd1b6360..44350215c1378e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-repeat-round-space.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-repeat-round-space.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G KC","132":"H"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB NC OC"},D:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC"},F:{"1":"4 5 6 7 8 9 B C m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H I N D O YC ZC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"CSS background-repeat round and space",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E NC","132":"F"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB QC RC"},D:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC"},F:{"1":"5 6 7 8 9 B C n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F G M N O bC cC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"CSS background-repeat round and space",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-sync.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-sync.js
index 203bacce3c44cd..11563f1fcc8a03 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-sync.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/background-sync.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B NC OC","16":"5B 6B MC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"Background Sync API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB QC RC","16":"7B 8B PC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"Background Sync API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/battery-status.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/battery-status.js
index d46ea48fb2732a..7cb2a4ab05a72c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/battery-status.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/battery-status.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"PB QB RB SB TB UB VB WB XB","2":"0 1 2 3 LC 0B J K F G H YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","132":"4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","164":"A B C L M I"},D:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB","66":"JB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD","2":"KD"}},B:4,C:"Battery Status API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"QB RB SB TB UB VB WB XB YB","2":"0 1 2 3 4 OC 3B I J D E F ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","132":"5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","164":"A B C K L G"},D:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB","66":"KB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD","2":"MD"}},B:4,C:"Battery Status API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/beacon.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/beacon.js
index 6696d7dcf1f499..4509eef162b1ec 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/beacon.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/beacon.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB NC OC"},D:{"1":"0 1 2 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Beacon API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB QC RC"},D:{"1":"0 1 2 3 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Beacon API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/beforeafterprint.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/beforeafterprint.js
index 4641b1a15752f6..2c5b8e9bcf11b6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/beforeafterprint.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/beforeafterprint.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","16":"KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC"},D:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB xB"},F:{"1":"WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB YC ZC aC bC wB IC cC xB"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"16":"A B"},O:{"1":"yB"},P:{"2":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","16":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Printing Events",D:true};
+module.exports={A:{A:{"1":"J D E F A B","16":"NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC"},D:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB zB"},F:{"1":"XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB bC cC dC eC yB LC fC zB"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"16":"A B"},O:{"1":"0B"},P:{"2":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","16":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Printing Events",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/bigint.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/bigint.js
index f33a0cb813bdd6..da960f92a19631 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/bigint.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/bigint.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB NC OC","194":"jB kB lB"},D:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB"},E:{"1":"M I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB 9B"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB YC ZC aC bC wB IC cC xB"},G:{"1":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"BigInt",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB QC RC","194":"kB lB mB"},D:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB"},E:{"1":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB BC"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bC cC dC eC yB LC fC zB"},G:{"1":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"BigInt",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/blobbuilder.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/blobbuilder.js
index 6cb6bd5369b231..df4565937f0f32 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/blobbuilder.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/blobbuilder.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC","36":"K F G H A B C"},D:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F","36":"4 G H A B C L M I N D O"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B C YC ZC aC bC wB IC cC"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC"},H:{"2":"yC"},I:{"1":"E","2":"zC 0C 1C","36":"0B J 2C JC 3C 4C"},J:{"1":"A","2":"F"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Blob constructing",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC","36":"J D E F A B C"},D:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D","36":"5 E F A B C K L G M N O"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B C bC cC dC eC yB LC fC"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC"},H:{"2":"1C"},I:{"1":"H","2":"2C 3C 4C","36":"3B I 5C MC 6C 7C"},J:{"1":"A","2":"D"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Blob constructing",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/bloburls.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/bloburls.js
index cf7bf793f4bf9e..3025ff2f306ce7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/bloburls.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/bloburls.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","129":"A B"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"C L M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F","33":"4 G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","33":"K"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B zC 0C 1C","33":"J 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Blob URLs",D:true};
+module.exports={A:{A:{"2":"J D E F NC","129":"A B"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D","33":"5 E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","33":"J"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B 2C 3C 4C","33":"I 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Blob URLs",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/border-image.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/border-image.js
index 838dc9cc52cef0..33ca00adf026a3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/border-image.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/border-image.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"C L"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","260":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","804":"3 J K F G H A B C L M NC OC"},D:{"1":"0 1 2 cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","260":"XB YB ZB aB bB","388":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","1412":"4 5 6 7 8 9 I N D O m n o AB BB","1956":"3 J K F G H A B C L M"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","129":"A B C L M I TC 8B wB xB 9B UC VC AC","1412":"K F G H RC SC","1956":"3 J PC 7B QC"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H YC ZC","260":"KB LB MB NB OB","388":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB","1796":"aC bC","1828":"B C wB IC cC xB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","129":"jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC","1412":"G fC gC hC iC","1956":"7B dC JC eC"},H:{"1828":"yC"},I:{"1":"E","388":"3C 4C","1956":"0B J zC 0C 1C 2C JC"},J:{"1412":"A","1924":"F"},K:{"1":"p","2":"A","1828":"B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","260":"5C 6C","388":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","260":"JD"}},B:4,C:"CSS3 Border images",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"C K"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","260":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","804":"4 I J D E F A B C K L QC RC"},D:{"1":"0 1 2 3 dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","260":"YB ZB aB bB cB","388":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","1412":"5 6 7 8 9 G M N O n o p AB BB CB","1956":"4 I J D E F A B C K L"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","129":"A B C K L G WC AC yB zB BC XC YC CC","1412":"J D E F UC VC","1956":"4 I SC 9B TC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F bC cC","260":"LB MB NB OB PB","388":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB","1796":"dC eC","1828":"B C yB LC fC zB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","129":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC","1412":"E iC jC kC lC","1956":"9B gC MC hC"},H:{"1828":"1C"},I:{"1":"H","388":"6C 7C","1956":"3B I 2C 3C 4C 5C MC"},J:{"1412":"A","1924":"D"},K:{"1":"q","2":"A","1828":"B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","260":"8C 9C","388":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","260":"LD"}},B:4,C:"CSS3 Border images",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/border-radius.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/border-radius.js
index eb45c923bd113f..2991ddaeda9c82 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/border-radius.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/border-radius.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","257":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","289":"0B NC OC","292":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"J"},E:{"1":"3 F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"J PC 7B","129":"K QC RC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"7B"},H:{"2":"yC"},I:{"1":"0B J E 0C 1C 2C JC 3C 4C","33":"zC"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","257":"JD"}},B:4,C:"CSS3 Border-radius (rounded corners)",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","257":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","289":"3B QC RC","292":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"I"},E:{"1":"4 D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"I SC 9B","129":"J TC UC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"9B"},H:{"2":"1C"},I:{"1":"3B I H 3C 4C 5C MC 6C 7C","33":"2C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","257":"LD"}},B:4,C:"CSS3 Border-radius (rounded corners)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/broadcastchannel.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/broadcastchannel.js
index dba0375ee44645..602e86cc9dfe6d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/broadcastchannel.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/broadcastchannel.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB NC OC"},D:{"1":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB YC ZC aC bC wB IC cC xB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"BroadcastChannel",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB QC RC"},D:{"1":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB bC cC dC eC yB LC fC zB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"BroadcastChannel",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/brotli.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/brotli.js
index 1f35cb9badfbea..cca88eda74ea01 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/brotli.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/brotli.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M"},C:{"1":"0 1 2 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB NC OC"},D:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","194":"VB","257":"WB"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","513":"B C wB xB"},F:{"1":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB","194":"IB JB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Brotli Accept-Encoding/Content-Encoding",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L"},C:{"1":"0 1 2 3 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB QC RC"},D:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","194":"WB","257":"XB"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","513":"B C yB zB"},F:{"1":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB","194":"JB KB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Brotli Accept-Encoding/Content-Encoding",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/calc.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/calc.js
index 29de609ad36b10..06e2a01d348a5a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/calc.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/calc.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","260":"H","516":"A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","33":"3 J K F G H A B C L M I"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I N D O","33":"4 5 6 7 m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","33":"K"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"fC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","132":"3C 4C"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"calc() as CSS unit value",D:true};
+module.exports={A:{A:{"2":"J D E NC","260":"F","516":"A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","33":"4 I J D E F A B C K L G"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G M N O","33":"5 6 7 8 n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","33":"J"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"iC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","132":"6C 7C"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"calc() as CSS unit value",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas-blending.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas-blending.js
index 614ba3bb3c3a80..b4c40ae99870ef 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas-blending.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas-blending.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O NC OC"},D:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC"},F:{"1":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C I N YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Canvas blend modes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O QC RC"},D:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC"},F:{"1":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C G M bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Canvas blend modes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas-text.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas-text.js
index 7de75ac81d3632..e010e01e16b68e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas-text.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas-text.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"KC","8":"K F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","8":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","8":"H YC ZC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","8":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Text API for Canvas",D:true};
+module.exports={A:{A:{"1":"F A B","2":"NC","8":"J D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","8":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","8":"F bC cC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","8":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Text API for Canvas",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas.js
index 5c057e43199548..aaf942de8fd584 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/canvas.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"KC","8":"K F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","132":"LC 0B NC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","132":"PC 7B"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"260":"yC"},I:{"1":"0B J E 2C JC 3C 4C","132":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Canvas (basic support)",D:true};
+module.exports={A:{A:{"1":"F A B","2":"NC","8":"J D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","132":"OC 3B QC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","132":"SC 9B"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"260":"1C"},I:{"1":"3B I H 5C MC 6C 7C","132":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Canvas (basic support)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ch-unit.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ch-unit.js
index 74b0217cf4423d..37beb088934038 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ch-unit.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ch-unit.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","132":"H A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 J K F G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"ch (character) unit",D:true};
+module.exports={A:{A:{"2":"J D E NC","132":"F A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"ch (character) unit",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/chacha20-poly1305.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/chacha20-poly1305.js
index c489ea1805fab2..624ca377d4b4b0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/chacha20-poly1305.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/chacha20-poly1305.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB","129":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C","16":"4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"ChaCha20-Poly1305 cipher suites for TLS",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB","129":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C","16":"7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"ChaCha20-Poly1305 cipher suites for TLS",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/channel-messaging.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/channel-messaging.js
index 95da513d036128..5a491a1a1cca6d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/channel-messaging.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/channel-messaging.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 LC 0B J K F G H A B C L M I N D O m n o NC OC","194":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","2":"H YC ZC","16":"aC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Channel messaging",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 OC 3B I J D E F A B C K L G M N O n o p QC RC","194":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","2":"F bC cC","16":"dC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Channel messaging",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/childnode-remove.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/childnode-remove.js
index b0df38880f11b8..9ef382891954ad 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/childnode-remove.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/childnode-remove.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"C"},C:{"1":"0 1 2 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 J K F G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","16":"K"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"ChildNode.remove()",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"C"},C:{"1":"0 1 2 3 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 I J D E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","16":"J"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"ChildNode.remove()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/classlist.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/classlist.js
index 0233c6ac6fa40f..c81f698210055c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/classlist.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/classlist.js
@@ -1 +1 @@
-module.exports={A:{A:{"8":"K F G H KC","1924":"A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"LC 0B NC","516":"6 7","772":"3 4 5 J K F G H A B C L M I N D O m n o OC"},D:{"1":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","8":"3 J K F","516":"6 7 8 9","772":"5","900":"4 G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"3 J PC 7B","900":"K QC RC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","8":"H B YC ZC aC bC wB","900":"C IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"7B dC JC","900":"eC fC"},H:{"900":"yC"},I:{"1":"E 3C 4C","8":"zC 0C 1C","900":"0B J 2C JC"},J:{"1":"A","900":"F"},K:{"1":"p","8":"A B","900":"C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"900":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"classList (DOMTokenList)",D:true};
+module.exports={A:{A:{"8":"J D E F NC","1924":"A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"OC 3B QC","516":"7 8","772":"4 5 6 I J D E F A B C K L G M N O n o p RC"},D:{"1":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","8":"4 I J D","516":"7 8 9 AB","772":"6","900":"5 E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"4 I SC 9B","900":"J TC UC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","8":"F B bC cC dC eC yB","900":"C LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"9B gC MC","900":"hC iC"},H:{"900":"1C"},I:{"1":"H 6C 7C","8":"2C 3C 4C","900":"3B I 5C MC"},J:{"1":"A","900":"D"},K:{"1":"q","8":"A B","900":"C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"900":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"classList (DOMTokenList)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/client-hints-dpr-width-viewport.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/client-hints-dpr-width-viewport.js
index 09a6c8f48737f5..3effbd52888e6c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/client-hints-dpr-width-viewport.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/client-hints-dpr-width-viewport.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:6,C:"Client Hints: DPR, Width, Viewport-Width",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:6,C:"Client Hints: DPR, Width, Viewport-Width",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/clipboard.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/clipboard.js
index b4faf7ea953101..117528353c0534 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/clipboard.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/clipboard.js
@@ -1 +1 @@
-module.exports={A:{A:{"2436":"K F G H A B KC"},B:{"260":"D O","2436":"C L M I N","8196":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC","772":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB","4100":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 J K F G H A B C","2564":"4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","8196":"0 1 2 eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","10244":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},E:{"1":"C L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC 7B","2308":"A B 8B wB","2820":"3 J K F G H QC RC SC TC"},F:{"2":"H B YC ZC aC bC wB IC cC","16":"C","516":"xB","2564":"4 5 6 7 8 9 I N D O m n o AB BB","8196":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","10244":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"1":"D oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC","2820":"G eC fC gC hC iC jC kC lC mC nC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","260":"E","2308":"3C 4C"},J:{"2":"F","2308":"A"},K:{"2":"A B C wB IC","16":"xB","8196":"p"},L:{"8196":"E"},M:{"1028":"E"},N:{"2":"A B"},O:{"8196":"yB"},P:{"2052":"5C 6C","2308":"J","8196":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"8196":"9B"},R:{"8196":"ID"},S:{"4100":"JD KD"}},B:5,C:"Synchronous Clipboard API",D:true};
+module.exports={A:{A:{"2436":"J D E F A B NC"},B:{"260":"N O","2436":"C K L G M","8196":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC","772":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB","4100":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 I J D E F A B C","2564":"5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","8196":"0 1 2 3 fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","10244":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB"},E:{"1":"C K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC 9B","2308":"A B AC yB","2820":"4 I J D E F TC UC VC WC"},F:{"2":"F B bC cC dC eC yB LC fC","16":"C","516":"zB","2564":"5 6 7 8 9 G M N O n o p AB BB CB","8196":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","10244":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB"},G:{"1":"rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC","2820":"E hC iC jC kC lC mC nC oC pC qC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","260":"H","2308":"6C 7C"},J:{"2":"D","2308":"A"},K:{"2":"A B C yB LC","16":"zB","8196":"q"},L:{"8196":"H"},M:{"1028":"xB"},N:{"2":"A B"},O:{"8196":"0B"},P:{"2052":"8C 9C","2308":"I","8196":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"8196":"BC"},R:{"8196":"KD"},S:{"4100":"LD MD"}},B:5,C:"Synchronous Clipboard API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/colr-v1.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/colr-v1.js
index 8221933f19f291..952639ccdb0a9b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/colr-v1.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/colr-v1.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g"},C:{"1":"0 1 2 u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g NC OC","258":"h i j k l q r","578":"s t"},D:{"1":"0 1 2 h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y","194":"Z a b c d e f g"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"16":"A B"},O:{"1":"yB"},P:{"1":"m n o GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"COLR/CPAL(v1) Font Formats",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g"},C:{"1":"0 1 2 3 u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g QC RC","258":"h i j k l m r","578":"s t"},D:{"1":"0 1 2 3 h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y","194":"Z a b c d e f g"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"16":"A B"},O:{"1":"0B"},P:{"1":"n o p ID JD","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"COLR/CPAL(v1) Font Formats",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/colr.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/colr.js
index cb789d86082a87..5d32482cc03956 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/colr.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/colr.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","257":"H A B"},B:{"1":"0 1 2 C L M I N D O x y z E","513":"P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w"},C:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB NC OC"},D:{"1":"0 1 2 x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB","513":"pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w"},E:{"1":"M I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","129":"B C L wB xB 9B"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB YC ZC aC bC wB IC cC xB","513":"eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"16":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"COLR/CPAL(v0) Font Formats",D:true};
+module.exports={A:{A:{"2":"J D E NC","257":"F A B"},B:{"1":"0 1 2 3 C K L G M N O x y z H","513":"P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w"},C:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB QC RC"},D:{"1":"0 1 2 3 x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB","513":"qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w"},E:{"1":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","129":"B C K yB zB BC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB bC cC dC eC yB LC fC zB","513":"fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"16":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"COLR/CPAL(v0) Font Formats",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/comparedocumentposition.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/comparedocumentposition.js
index 2fb09b41497bf5..594f57ced35da1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/comparedocumentposition.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/comparedocumentposition.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC 0B NC OC"},D:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M","132":"4 5 6 7 8 9 I N D O m n o AB BB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J K PC 7B","132":"F G H RC SC TC","260":"QC"},F:{"1":"4 5 6 7 8 9 C D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","16":"H B YC ZC aC bC wB IC","132":"I N"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B","132":"G dC JC eC fC gC hC iC jC"},H:{"1":"yC"},I:{"1":"E 3C 4C","16":"zC 0C","132":"0B J 1C 2C JC"},J:{"132":"F A"},K:{"1":"C p xB","16":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Node.compareDocumentPosition()",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC 3B QC RC"},D:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L","132":"5 6 7 8 9 G M N O n o p AB BB CB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I J SC 9B","132":"D E F UC VC WC","260":"TC"},F:{"1":"5 6 7 8 9 C N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","16":"F B bC cC dC eC yB LC","132":"G M"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B","132":"E gC MC hC iC jC kC lC mC"},H:{"1":"1C"},I:{"1":"H 6C 7C","16":"2C 3C","132":"3B I 4C 5C MC"},J:{"132":"D A"},K:{"1":"C q zB","16":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Node.compareDocumentPosition()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/console-basic.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/console-basic.js
index 1f4ae814aaac8b..053b005074bdfa 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/console-basic.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/console-basic.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F KC","132":"G H"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H YC ZC aC bC"},G:{"1":"7B dC JC eC","513":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"4097":"yC"},I:{"1025":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"258":"F A"},K:{"2":"A","258":"B C wB IC xB","1025":"p"},L:{"1025":"E"},M:{"2049":"E"},N:{"258":"A B"},O:{"258":"yB"},P:{"1025":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1025":"ID"},S:{"1":"JD KD"}},B:1,C:"Basic console logging functions",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D NC","132":"E F"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F bC cC dC eC"},G:{"1":"9B gC MC hC","513":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"4097":"1C"},I:{"1025":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"258":"D A"},K:{"2":"A","258":"B C yB LC zB","1025":"q"},L:{"1025":"H"},M:{"2049":"xB"},N:{"258":"A B"},O:{"258":"0B"},P:{"1025":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1025":"KD"},S:{"1":"LD MD"}},B:1,C:"Basic console logging functions",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/console-time.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/console-time.js
index c2cbc66b307a24..d6fc55c4695121 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/console-time.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/console-time.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H YC ZC aC bC","16":"B"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"p","16":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"console.time and console.timeEnd",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F bC cC dC eC","16":"B"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"q","16":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"console.time and console.timeEnd",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/const.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/const.js
index 51f5124a4cdaf1..f44cd8d804c169 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/const.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/const.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","2052":"B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","132":"3 LC 0B J K F G H A B C NC OC","260":"4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","260":"3 4 J K F G H A B C L M I N D O m","772":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB","1028":"NB OB PB QB RB SB TB UB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","260":"3 J A PC 7B 8B","772":"K F G H QC RC SC TC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H YC","132":"B ZC aC bC wB IC","644":"C cC xB","772":"4 5 6 7 8 9 I N D O m n o","1028":"AB BB CB DB EB FB GB HB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","260":"7B dC JC kC lC","772":"G eC fC gC hC iC jC"},H:{"644":"yC"},I:{"1":"E","16":"zC 0C","260":"1C","772":"0B J 2C JC 3C 4C"},J:{"772":"F A"},K:{"1":"p","132":"A B wB IC","644":"C xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","1028":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"const",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","2052":"B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","132":"4 OC 3B I J D E F A B C QC RC","260":"5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","260":"4 5 I J D E F A B C K L G M N O n","772":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB","1028":"OB PB QB RB SB TB UB VB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","260":"4 I A SC 9B AC","772":"J D E F TC UC VC WC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F bC","132":"B cC dC eC yB LC","644":"C fC zB","772":"5 6 7 8 9 G M N O n o p AB","1028":"BB CB DB EB FB GB HB IB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","260":"9B gC MC nC oC","772":"E hC iC jC kC lC mC"},H:{"644":"1C"},I:{"1":"H","16":"2C 3C","260":"4C","772":"3B I 5C MC 6C 7C"},J:{"772":"D A"},K:{"1":"q","132":"A B yB LC","644":"C zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","1028":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"const",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/constraint-validation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/constraint-validation.js
index df3787952143d3..3f84cbd62efd91 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/constraint-validation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/constraint-validation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","900":"A B"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","388":"M I N","900":"C L"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","260":"VB WB","388":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","900":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB"},D:{"1":"0 1 2 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M","388":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB","900":"4 5 6 I N D O m n o"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B","388":"G H SC TC","900":"K F QC RC"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H B YC ZC aC bC wB IC","388":"4 5 6 7 8 I N D O m n o","900":"C cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC","388":"G gC hC iC jC","900":"eC fC"},H:{"2":"yC"},I:{"1":"E","16":"0B zC 0C 1C","388":"3C 4C","900":"J 2C JC"},J:{"16":"F","388":"A"},K:{"1":"p","16":"A B wB IC","900":"C xB"},L:{"1":"E"},M:{"1":"E"},N:{"900":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","388":"JD"}},B:1,C:"Constraint Validation API",D:true};
+module.exports={A:{A:{"2":"J D E F NC","900":"A B"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","388":"L G M","900":"C K"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","260":"WB XB","388":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","900":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB"},D:{"1":"0 1 2 3 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L","388":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB","900":"5 6 7 G M N O n o p"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B","388":"E F VC WC","900":"J D TC UC"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F B bC cC dC eC yB LC","388":"5 6 7 8 9 G M N O n o p","900":"C fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC","388":"E jC kC lC mC","900":"hC iC"},H:{"2":"1C"},I:{"1":"H","16":"3B 2C 3C 4C","388":"6C 7C","900":"I 5C MC"},J:{"16":"D","388":"A"},K:{"1":"q","16":"A B yB LC","900":"C zB"},L:{"1":"H"},M:{"1":"xB"},N:{"900":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","388":"LD"}},B:1,C:"Constraint Validation API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contenteditable.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contenteditable.js
index 64f9ae3ed467b0..4b131afedfed0b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contenteditable.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contenteditable.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC","4":"0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"contenteditable attribute (basic support)",D:true};
+module.exports={A:{A:{"1":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC","4":"3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"contenteditable attribute (basic support)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contentsecuritypolicy.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contentsecuritypolicy.js
index 01ae1320ea32d7..5f7412a84d4f28 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contentsecuritypolicy.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contentsecuritypolicy.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","132":"A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","129":"3 4 J K F G H A B C L M I N D O m n o"},D:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L","257":"4 5 6 M I N D O m n o"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B","257":"K RC","260":"QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC","257":"fC","260":"eC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F","257":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Content Security Policy 1.0",D:true};
+module.exports={A:{A:{"2":"J D E F NC","132":"A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","129":"4 5 I J D E F A B C K L G M N O n o p"},D:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K","257":"5 6 7 L G M N O n o p"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B","257":"J UC","260":"TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC","257":"iC","260":"hC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D","257":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Content Security Policy 1.0",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contentsecuritypolicy2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contentsecuritypolicy2.js
index 310b574750fff2..06222242b62ed6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contentsecuritypolicy2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/contentsecuritypolicy2.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M","4100":"I N D O"},C:{"1":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB NC OC","132":"DB EB FB GB","260":"HB","516":"IB JB KB LB MB NB OB PB QB"},D:{"1":"0 1 2 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB","1028":"IB JB KB","2052":"LB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n o YC ZC aC bC wB IC cC xB","1028":"5 6 7","2052":"8"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Content Security Policy Level 2",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L","4100":"G M N O"},C:{"1":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB QC RC","132":"EB FB GB HB","260":"IB","516":"JB KB LB MB NB OB PB QB RB"},D:{"1":"0 1 2 3 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB","1028":"JB KB LB","2052":"MB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o p bC cC dC eC yB LC fC zB","1028":"6 7 8","2052":"9"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Content Security Policy Level 2",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cookie-store-api.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cookie-store-api.js
index 7a41fdbda6ebae..0839ca77d7a133 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cookie-store-api.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cookie-store-api.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","194":"P Q R S T U V"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB","194":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB YC ZC aC bC wB IC cC xB","194":"XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"Cookie Store API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","194":"P Q R S T U V"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB","194":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB bC cC dC eC yB LC fC zB","194":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"Cookie Store API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cors.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cors.js
index 8f3ba9915764ac..844fe3324c4f9c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cors.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cors.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F KC","132":"A","260":"G H"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B","1025":"2B gB hB iB jB kB lB mB nB oB"},D:{"1":"0 1 2 4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 J K F G H A B C"},E:{"2":"PC 7B","513":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","644":"3 J QC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC"},G:{"513":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","644":"7B dC JC eC"},H:{"2":"yC"},I:{"1":"E 3C 4C","132":"0B J zC 0C 1C 2C JC"},J:{"1":"A","132":"F"},K:{"1":"C p xB","2":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","132":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Cross-Origin Resource Sharing",D:true};
+module.exports={A:{A:{"1":"B","2":"J D NC","132":"A","260":"E F"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B","1025":"5B hB iB jB kB lB mB nB oB pB"},D:{"1":"0 1 2 3 5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 I J D E F A B C"},E:{"2":"SC 9B","513":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","644":"4 I TC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC"},G:{"513":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","644":"9B gC MC hC"},H:{"2":"1C"},I:{"1":"H 6C 7C","132":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","132":"D"},K:{"1":"C q zB","2":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","132":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Cross-Origin Resource Sharing",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/createimagebitmap.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/createimagebitmap.js
index b069fa8565bc49..15369a1f581ac6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/createimagebitmap.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/createimagebitmap.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB NC OC","1028":"c d e f g","3076":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b","8196":"0 1 2 h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","132":"WB XB","260":"YB ZB","516":"aB bB cB dB eB"},E:{"2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B UC","4100":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB YC ZC aC bC wB IC cC xB","132":"JB KB","260":"LB MB","516":"NB OB PB QB RB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC","4100":"D wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"8196":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","16":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"3076":"JD KD"}},B:1,C:"createImageBitmap",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB QC RC","1028":"c d e f g","3076":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b","8196":"0 1 2 3 h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","132":"XB YB","260":"ZB aB","516":"bB cB dB eB fB"},E:{"2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC XC","4100":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB bC cC dC eC yB LC fC zB","132":"KB LB","260":"MB NB","516":"OB PB QB RB SB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC","4100":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"8196":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","16":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"3076":"LD MD"}},B:1,C:"createImageBitmap",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/credential-management.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/credential-management.js
index df4a987ef9c5c0..947aad23e6687e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/credential-management.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/credential-management.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB","66":"UB VB WB","129":"XB YB ZB aB bB cB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB YC ZC aC bC wB IC cC xB"},G:{"1":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:5,C:"Credential Management API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","66":"VB WB XB","129":"YB ZB aB bB cB dB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB bC cC dC eC yB LC fC zB"},G:{"1":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:5,C:"Credential Management API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cryptography.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cryptography.js
index 72d146f5e4b061..14632dd1338441 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cryptography.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/cryptography.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G H A","164":"B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","513":"C L M I N D O"},C:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB NC OC","66":"EB FB"},D:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","8":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"3 J K F PC 7B QC RC","289":"G H A SC TC 8B"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","8":"4 5 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"7B dC JC eC fC gC","289":"G hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","8":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"8":"F A"},K:{"1":"p","8":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"8":"A","164":"B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Web Cryptography",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E F A","164":"B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","513":"C K L G M N O"},C:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB QC RC","66":"FB GB"},D:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","8":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"4 I J D SC 9B TC UC","289":"E F A VC WC AC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","8":"5 6 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"9B gC MC hC iC jC","289":"E kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","8":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"8":"D A"},K:{"1":"q","8":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"8":"A","164":"B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Web Cryptography",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-all.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-all.js
index 9325cbe1c79efa..ecba177dd2a506 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-all.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-all.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC"},H:{"2":"yC"},I:{"1":"E 4C","2":"0B J zC 0C 1C 2C JC 3C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS all property",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC"},H:{"2":"1C"},I:{"1":"H 7C","2":"3B I 2C 3C 4C 5C MC 6C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS all property",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-anchor-positioning.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-anchor-positioning.js
index a1fec42aa4d3e5..5572a7d3237398 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-anchor-positioning.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-anchor-positioning.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","194":"4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Anchor Positioning",D:false};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z","194":"H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Anchor Positioning",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-animation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-animation.js
index 43da92528e50bb..ec65278e811cdc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-animation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-animation.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B J NC OC","33":"3 K F G H A B C L M I"},D:{"1":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B","33":"K F G QC RC SC","292":"3 J"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC","33":"4 5 6 7 8 9 C I N D O m n o AB BB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"G fC gC hC","164":"7B dC JC eC"},H:{"2":"yC"},I:{"1":"E","33":"J 2C JC 3C 4C","164":"0B zC 0C 1C"},J:{"33":"F A"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"CSS Animation",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B I QC RC","33":"4 J D E F A B C K L G"},D:{"1":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B","33":"J D E TC UC VC","292":"4 I"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC","33":"5 6 7 8 9 C G M N O n o p AB BB CB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"E iC jC kC","164":"9B gC MC hC"},H:{"2":"1C"},I:{"1":"H","33":"I 5C MC 6C 7C","164":"3B 2C 3C 4C"},J:{"33":"D A"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"CSS Animation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-any-link.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-any-link.js
index d26937d6953a84..3cd7c17dbf2ab2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-any-link.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-any-link.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC","33":"3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB NC OC"},D:{"1":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J K PC 7B QC","33":"F G RC SC"},F:{"1":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC","33":"G fC gC hC"},H:{"2":"yC"},I:{"1":"E","16":"0B J zC 0C 1C 2C JC","33":"3C 4C"},J:{"16":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","16":"J","33":"5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","33":"JD"}},B:5,C:"CSS :any-link selector",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC","33":"4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB QC RC"},D:{"1":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I J SC 9B TC","33":"D E UC VC"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC","33":"E iC jC kC"},H:{"2":"1C"},I:{"1":"H","16":"3B I 2C 3C 4C 5C MC","33":"6C 7C"},J:{"16":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","16":"I","33":"8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","33":"LD"}},B:5,C:"CSS :any-link selector",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-appearance.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-appearance.js
index 4b24e2cb3c9c4e..a933af239fb197 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-appearance.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-appearance.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","33":"S","164":"P Q R","388":"C L M I N D O"},C:{"1":"0 1 2 Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","164":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P","676":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB NC OC"},D:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"S","164":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","164":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"oB pB qB","164":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","164":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","164":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"164":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A","388":"B"},O:{"1":"yB"},P:{"164":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"164":"9B"},R:{"1":"ID"},S:{"1":"KD","164":"JD"}},B:5,C:"CSS Appearance",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","33":"S","164":"P Q R","388":"C K L G M N O"},C:{"1":"0 1 2 3 Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","164":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P","676":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB QC RC"},D:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"S","164":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","164":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC"},F:{"1":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"pB qB rB","164":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","164":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","164":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"164":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A","388":"B"},O:{"1":"0B"},P:{"164":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"164":"BC"},R:{"1":"KD"},S:{"1":"MD","164":"LD"}},B:5,C:"CSS Appearance",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-at-counter-style.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-at-counter-style.js
index 6d0569290616e6..b9b34912d48f43 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-at-counter-style.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-at-counter-style.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P Q R S T U V W X Y Z","132":"0 1 2 a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB NC OC","132":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z","132":"0 1 2 a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC","4":"D XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB YC ZC aC bC wB IC cC xB","132":"uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","4":"D"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","132":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","132":"p"},L:{"132":"E"},M:{"132":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED","132":"m n o zB FD GD HD"},Q:{"2":"9B"},R:{"132":"ID"},S:{"132":"JD KD"}},B:4,C:"CSS Counter Styles",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T U V W X Y Z","132":"0 1 2 3 a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB QC RC","132":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z","132":"0 1 2 3 a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC","4":"2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB bC cC dC eC yB LC fC zB","132":"vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC","4":"2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","132":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","132":"q"},L:{"132":"H"},M:{"132":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I 8C 9C AD BD CD AC DD ED FD GD HD","132":"n o p 1B 2B ID JD"},Q:{"2":"BC"},R:{"132":"KD"},S:{"132":"LD MD"}},B:4,C:"CSS Counter Styles",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-autofill.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-autofill.js
index 6730c4e7592513..3ceef876f13d36 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-autofill.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-autofill.js
@@ -1 +1 @@
-module.exports={A:{D:{"33":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},L:{"33":"E"},B:{"2":"C L M I N D O","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U NC OC"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},K:{"2":"A B C wB IC xB","33":"p"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC","2":"XC","33":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B UC"},G:{"1":"D wC AC BC yB xC zB CC DC EC FC GC HC","33":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC"},P:{"33":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},I:{"2":"0B J zC 0C 1C 2C JC","33":"E 3C 4C"}},B:6,C:":autofill CSS pseudo-class",D:undefined};
+module.exports={A:{D:{"33":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},L:{"33":"H"},B:{"2":"C K L G M N O","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U QC RC"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},K:{"2":"A B C yB LC zB","33":"q"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"aC","33":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC XC"},G:{"1":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC"},P:{"33":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},I:{"2":"3B I 2C 3C 4C 5C MC","33":"H 6C 7C"}},B:6,C:":autofill CSS pseudo-class",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-backdrop-filter.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-backdrop-filter.js
index 0dbb52c8d5763a..293a0acceca043 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-backdrop-filter.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-backdrop-filter.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N","257":"D O"},C:{"1":"0 1 2 q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB NC OC","578":"oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},D:{"1":"0 1 2 tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB","194":"TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB"},E:{"2":"3 J K F G PC 7B QC RC SC","33":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB YC ZC aC bC wB IC cC xB","194":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB"},G:{"2":"G 7B dC JC eC fC gC hC","33":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o BD CD DD ED zB FD GD HD","2":"J","194":"5C 6C 7C 8C 9C 8B AD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS Backdrop Filter",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M","257":"N O"},C:{"1":"0 1 2 3 m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB QC RC","578":"pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l"},D:{"1":"0 1 2 3 uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB","194":"UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB"},E:{"2":"4 I J D E SC 9B TC UC VC","33":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB bC cC dC eC yB LC fC zB","194":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB"},G:{"2":"E 9B gC MC hC iC jC kC","33":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p ED FD GD HD 1B 2B ID JD","2":"I","194":"8C 9C AD BD CD AC DD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS Backdrop Filter",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-background-offsets.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-background-offsets.js
index 7c945999d5fb7d..d40745de99bdcf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-background-offsets.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-background-offsets.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C NC OC"},D:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 J K F G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS background-position edge offsets",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C QC RC"},D:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 I J D E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS background-position edge offsets",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-backgroundblendmode.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-backgroundblendmode.js
index 803f4fd475108e..6f96aa7b43c43b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-backgroundblendmode.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-backgroundblendmode.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB NC OC"},D:{"1":"0 1 2 HB IB JB KB LB MB NB OB PB QB RB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB","260":"SB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC","132":"G H A SC TC"},F:{"1":"5 6 7 8 9 o AB BB CB DB EB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n YC ZC aC bC wB IC cC xB","260":"FB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","132":"G hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS background-blend-mode",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB QC RC"},D:{"1":"0 1 2 3 IB JB KB LB MB NB OB PB QB RB SB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB","260":"TB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC","132":"E F A VC WC"},F:{"1":"6 7 8 9 p AB BB CB DB EB FB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o bC cC dC eC yB LC fC zB","260":"GB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","132":"E kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS background-blend-mode",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-boxdecorationbreak.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-boxdecorationbreak.js
index 8885620bfec854..09e8730776d5da 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-boxdecorationbreak.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-boxdecorationbreak.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","164":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB NC OC"},D:{"2":"3 4 J K F G H A B C L M I N D O m n","164":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K PC 7B QC","164":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H YC ZC aC bC","129":"B C wB IC cC xB","164":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"7B dC JC eC fC","164":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"132":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","164":"E 3C 4C"},J:{"2":"F","164":"A"},K:{"2":"A","129":"B C wB IC xB","164":"p"},L:{"164":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"164":"yB"},P:{"164":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"164":"9B"},R:{"164":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS box-decoration-break",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","164":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB QC RC"},D:{"2":"4 5 I J D E F A B C K L G M N O n o","164":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J SC 9B TC","164":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F bC cC dC eC","129":"B C yB LC fC zB","164":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"9B gC MC hC iC","164":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"132":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","164":"H 6C 7C"},J:{"2":"D","164":"A"},K:{"2":"A","129":"B C yB LC zB","164":"q"},L:{"164":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"164":"0B"},P:{"164":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"164":"BC"},R:{"164":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS box-decoration-break",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-boxshadow.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-boxshadow.js
index 7a830d34b6e8ce..370c7a7e5852fe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-boxshadow.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-boxshadow.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","33":"NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 J K F G H"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"3","164":"J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"dC JC","164":"7B"},H:{"2":"yC"},I:{"1":"J E 2C JC 3C 4C","164":"0B zC 0C 1C"},J:{"1":"A","33":"F"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 Box-shadow",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","33":"QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 I J D E F"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"4","164":"I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"gC MC","164":"9B"},H:{"2":"1C"},I:{"1":"I H 5C MC 6C 7C","164":"3B 2C 3C 4C"},J:{"1":"A","33":"D"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 Box-shadow",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-canvas.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-canvas.js
index ce047f37c7d947..8da18735cda296 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-canvas.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-canvas.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"2":"PC 7B","33":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB"},G:{"33":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"E","33":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"33":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","33":"J"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS Canvas Drawings",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"2":"SC 9B","33":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB"},G:{"33":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"H","33":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"33":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","33":"I"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS Canvas Drawings",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-caret-color.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-caret-color.js
index 88e1d4bfd1c517..2fef7998b0ab1d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-caret-color.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-caret-color.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB NC OC"},D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:2,C:"CSS caret-color",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB QC RC"},D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:2,C:"CSS caret-color",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cascade-layers.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cascade-layers.js
index 11d5d334f59a26..8b57f9505ee72b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cascade-layers.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cascade-layers.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e","322":"f g h"},C:{"1":"0 1 2 g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c NC OC","194":"d e f"},D:{"1":"0 1 2 i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e","322":"f g h"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U YC ZC aC bC wB IC cC xB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:4,C:"CSS Cascade Layers",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e","322":"f g h"},C:{"1":"0 1 2 3 g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c QC RC","194":"d e f"},D:{"1":"0 1 2 3 i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e","322":"f g h"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC"},F:{"1":"V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U bC cC dC eC yB LC fC zB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p ID JD","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:4,C:"CSS Cascade Layers",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cascade-scope.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cascade-scope.js
index 59b9905d65dc05..2a5b60857cf112 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cascade-scope.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cascade-scope.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q","194":"0 1 2 r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q","194":"0 1 2 r s t u v w x y z E 4B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y YC ZC aC bC wB IC cC xB","194":"Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"194":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Scoped Styles: the @scope rule",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m","194":"0 1 2 3 r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m","194":"0 1 2 3 r s t u v w x y z H"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y bC cC dC eC yB LC fC zB","194":"Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"194":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Scoped Styles: the @scope rule",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-case-insensitive.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-case-insensitive.js
index 41f4c007e75ddb..2bb93583920bcc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-case-insensitive.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-case-insensitive.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Case-insensitive CSS attribute selectors",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Case-insensitive CSS attribute selectors",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-clip-path.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-clip-path.js
index d886762ad4e4a1..8d7a7810a6c70d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-clip-path.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-clip-path.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D","260":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","3138":"O"},C:{"1":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB NC OC","644":"TB UB VB WB XB YB ZB"},D:{"2":"3 4 5 J K F G H A B C L M I N D O m n o","260":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","292":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},E:{"2":"3 J K PC 7B QC RC","260":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","292":"F G H A B C L SC TC 8B wB xB"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","260":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","292":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},G:{"2":"7B dC JC eC fC","260":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","292":"G gC hC iC jC kC lC mC nC oC pC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","260":"E","292":"3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","260":"p"},L:{"260":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"260":"yB"},P:{"292":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"260":"9B"},R:{"260":"ID"},S:{"1":"KD","644":"JD"}},B:4,C:"CSS clip-path property (for HTML)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N","260":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","3138":"O"},C:{"1":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB QC RC","644":"UB VB WB XB YB ZB aB"},D:{"2":"4 5 6 I J D E F A B C K L G M N O n o p","260":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","292":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},E:{"2":"4 I J SC 9B TC UC","260":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","292":"D E F A B C K VC WC AC yB zB"},F:{"2":"F B C bC cC dC eC yB LC fC zB","260":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","292":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},G:{"2":"9B gC MC hC iC","260":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","292":"E jC kC lC mC nC oC pC qC rC sC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","260":"H","292":"6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","260":"q"},L:{"260":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"260":"0B"},P:{"292":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"260":"BC"},R:{"260":"KD"},S:{"1":"MD","644":"LD"}},B:4,C:"CSS clip-path property (for HTML)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-color-adjust.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-color-adjust.js
index a770ef3f32adab..dc68674d9038d6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-color-adjust.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-color-adjust.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB NC OC"},D:{"16":"3 J K F G H A B C L M I N D O","33":"0 1 2 4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","33":"K F G H A B C L M I RC SC TC 8B wB xB 9B UC VC AC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","16":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"16":"0B J zC 0C 1C 2C JC 3C 4C","33":"E"},J:{"16":"F A"},K:{"2":"A B C wB IC xB","33":"p"},L:{"16":"E"},M:{"1":"E"},N:{"16":"A B"},O:{"16":"yB"},P:{"16":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"33":"9B"},R:{"16":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS print-color-adjust",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB QC RC"},D:{"16":"4 I J D E F A B C K L G M N O","33":"0 1 2 3 5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","33":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"16":"3B I 2C 3C 4C 5C MC 6C 7C","33":"H"},J:{"16":"D A"},K:{"2":"A B C yB LC zB","33":"q"},L:{"16":"H"},M:{"1":"xB"},N:{"16":"A B"},O:{"16":"0B"},P:{"16":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"33":"BC"},R:{"16":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS print-color-adjust",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-color-function.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-color-function.js
index 734dbb82a22195..062ff7318a223b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-color-function.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-color-function.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u","322":"v w x"},C:{"1":"0 1 2 E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x NC OC","578":"y z"},D:{"1":"0 1 2 y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u","322":"v w x"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC","132":"B C L M 8B wB xB 9B UC"},F:{"1":"h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d YC ZC aC bC wB IC cC xB","322":"e f g"},G:{"1":"D wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC","132":"lC mC nC oC pC qC rC sC tC uC vC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"o","2":"J m n 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:4,C:"CSS color() function",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u","322":"v w x"},C:{"1":"0 1 2 3 H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x QC RC","578":"y z"},D:{"1":"0 1 2 3 y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u","322":"v w x"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC","132":"B C K L AC yB zB BC XC"},F:{"1":"h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d bC cC dC eC yB LC fC zB","322":"e f g"},G:{"1":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC","132":"oC pC qC rC sC tC uC vC wC xC yC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"p","2":"I n o 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:4,C:"CSS color() function",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-conic-gradients.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-conic-gradients.js
index 9dbd3480d56e7c..b0d6449a4ce4fe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-conic-gradients.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-conic-gradients.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB NC OC","578":"sB tB uB vB P Q R 3B"},D:{"1":"0 1 2 pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","257":"nB oB","450":"1B fB 2B gB hB iB jB kB lB mB"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB"},F:{"1":"eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB YC ZC aC bC wB IC cC xB","257":"cB dB","450":"SB TB UB VB WB XB YB ZB aB bB"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"CSS Conical Gradients",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB QC RC","578":"tB uB vB wB P Q R 6B"},D:{"1":"0 1 2 3 qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB","257":"oB pB","450":"4B gB 5B hB iB jB kB lB mB nB"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB"},F:{"1":"fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB bC cC dC eC yB LC fC zB","257":"dB eB","450":"TB UB VB WB XB YB ZB aB bB cB"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"CSS Conical Gradients",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-queries-style.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-queries-style.js
index 38c4afc128f09c..bac9d40464266c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-queries-style.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-queries-style.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t","194":"u v w x","260":"0 1 2 y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t","194":"u v w x","260":"0 1 2 y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b YC ZC aC bC wB IC cC xB","194":"c d e f g","260":"h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","260":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","194":"p"},L:{"260":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","260":"o"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Container Style Queries",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t","194":"u v w x","260":"0 1 2 3 y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t","194":"u v w x","260":"0 1 2 3 y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b bC cC dC eC yB LC fC zB","194":"c d e f g","260":"h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","260":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","194":"q"},L:{"260":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","260":"p"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Container Style Queries",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-queries.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-queries.js
index cb3ff85124a6b7..cbfc93cc815fb7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-queries.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-queries.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r","516":"s"},C:{"1":"0 1 2 x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w NC OC"},D:{"1":"0 1 2 t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a","194":"c d e f g h i j k l q r","450":"b","516":"s"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"1":"d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB YC ZC aC bC wB IC cC xB","194":"P Q R 3B S T U V W X Y Z","516":"a b c"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Container Queries (Size)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r","516":"s"},C:{"1":"0 1 2 3 x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w QC RC"},D:{"1":"0 1 2 3 t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a","194":"c d e f g h i j k l m r","450":"b","516":"s"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB bC cC dC eC yB LC fC zB","194":"P Q R 6B S T U V W X Y Z","516":"a b c"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Container Queries (Size)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-query-units.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-query-units.js
index a054a66e8505a2..f53f342f21e768 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-query-units.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-container-query-units.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r"},C:{"1":"0 1 2 x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w NC OC"},D:{"1":"0 1 2 s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b","194":"k l q r","450":"c d e f g h i j"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"1":"a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB YC ZC aC bC wB IC cC xB","194":"P Q R 3B S T U V W X Y Z"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Container Query Units",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r"},C:{"1":"0 1 2 3 x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w QC RC"},D:{"1":"0 1 2 3 s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b","194":"k l m r","450":"c d e f g h i j"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB bC cC dC eC yB LC fC zB","194":"P Q R 6B S T U V W X Y Z"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Container Query Units",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-containment.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-containment.js
index b0980f9b85f64c..62f3af88372d15 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-containment.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-containment.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NC OC","194":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB"},D:{"1":"0 1 2 YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","66":"XB"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB YC ZC aC bC wB IC cC xB","66":"KB LB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","194":"JD"}},B:2,C:"CSS Containment",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB QC RC","194":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB"},D:{"1":"0 1 2 3 ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","66":"YB"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB bC cC dC eC yB LC fC zB","66":"LB MB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","194":"LD"}},B:2,C:"CSS Containment",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-content-visibility.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-content-visibility.js
index ef5467d1191327..ab7444727025be 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-content-visibility.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-content-visibility.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S T"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v NC OC","194":"0 1 2 w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS content-visibility",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S T"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v QC RC","194":"0 1 2 3 w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS content-visibility",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-counters.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-counters.js
index d3da63ebc4a6a5..1f7b5f486895fc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-counters.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-counters.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","2":"K F KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS Counters",D:true};
+module.exports={A:{A:{"1":"E F A B","2":"J D NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS Counters",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-crisp-edges.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-crisp-edges.js
index ca42b5944ecc3a..fa02f6143f29b7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-crisp-edges.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-crisp-edges.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K KC","2340":"F G H A B"},B:{"2":"C L M I N D O","1025":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC","513":"jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b","545":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB","1025":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","164":"K","4644":"F G H RC SC TC"},F:{"2":"4 5 6 7 8 9 H B I N D O m n o YC ZC aC bC wB IC","545":"C cC xB","1025":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC","4260":"eC fC","4644":"G gC hC iC jC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","1025":"E"},J:{"2":"F","4260":"A"},K:{"2":"A B wB IC","545":"C xB","1025":"p"},L:{"1025":"E"},M:{"1":"E"},N:{"2340":"A B"},O:{"1025":"yB"},P:{"1025":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1025":"9B"},R:{"1025":"ID"},S:{"1":"KD","4097":"JD"}},B:4,C:"Crisp edges/pixelated images",D:true};
+module.exports={A:{A:{"2":"J NC","2340":"D E F A B"},B:{"2":"C K L G M N O","1025":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC","513":"kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b","545":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB","1025":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","164":"J","4644":"D E F UC VC WC"},F:{"2":"5 6 7 8 9 F B G M N O n o p AB bC cC dC eC yB LC","545":"C fC zB","1025":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC","4260":"hC iC","4644":"E jC kC lC mC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","1025":"H"},J:{"2":"D","4260":"A"},K:{"2":"A B yB LC","545":"C zB","1025":"q"},L:{"1025":"H"},M:{"1":"xB"},N:{"2340":"A B"},O:{"1025":"0B"},P:{"1025":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1025":"BC"},R:{"1025":"KD"},S:{"1":"MD","4097":"LD"}},B:4,C:"Crisp edges/pixelated images",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cross-fade.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cross-fade.js
index 5c80e4e7ffd7ca..915b7e5b424a4f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cross-fade.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-cross-fade.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 J K F G H A B C L M I N","33":"0 1 2 4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B","33":"K F G H QC RC SC TC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC","33":"G eC fC gC hC iC jC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","33":"E 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","33":"p"},L:{"33":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"33":"yB"},P:{"33":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"33":"9B"},R:{"33":"ID"},S:{"2":"JD KD"}},B:4,C:"CSS Cross-Fade Function",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 I J D E F A B C K L G M","33":"0 1 2 3 5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B","33":"J D E F TC UC VC WC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC","33":"E hC iC jC kC lC mC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","33":"H 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","33":"q"},L:{"33":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"33":"0B"},P:{"33":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"33":"BC"},R:{"33":"KD"},S:{"2":"LD MD"}},B:4,C:"CSS Cross-Fade Function",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-default-pseudo.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-default-pseudo.js
index 9316f2928dc3eb..42fd8d18876d68 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-default-pseudo.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-default-pseudo.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC 0B NC OC"},D:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B","132":"K F G H A QC RC SC TC"},F:{"1":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H B YC ZC aC bC wB IC","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB","260":"C cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC fC","132":"G gC hC iC jC kC"},H:{"260":"yC"},I:{"1":"E","16":"0B zC 0C 1C","132":"J 2C JC 3C 4C"},J:{"16":"F","132":"A"},K:{"1":"p","16":"A B C wB IC","260":"xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","132":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:":default CSS pseudo-class",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC 3B QC RC"},D:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B","132":"J D E F A TC UC VC WC"},F:{"1":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F B bC cC dC eC yB LC","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB","260":"C fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC iC","132":"E jC kC lC mC nC"},H:{"260":"1C"},I:{"1":"H","16":"3B 2C 3C 4C","132":"I 5C MC 6C 7C"},J:{"16":"D","132":"A"},K:{"1":"q","16":"A B C yB LC","260":"zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","132":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:":default CSS pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-descendant-gtgt.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-descendant-gtgt.js
index 3c42f5464cbd42..0d82c1adba1ca2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-descendant-gtgt.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-descendant-gtgt.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"P"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"B","2":"3 J K F G H A C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Explicit descendant combinator >>",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"P"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"B","2":"4 I J D E F A C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Explicit descendant combinator >>",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-deviceadaptation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-deviceadaptation.js
index e3f987b17d7a7a..53244994a87da2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-deviceadaptation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-deviceadaptation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","164":"A B"},B:{"66":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","164":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB","66":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB YC ZC aC bC wB IC cC xB","66":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"292":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A p","292":"B C wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"164":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"66":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Device Adaptation",D:true};
+module.exports={A:{A:{"2":"J D E F NC","164":"A B"},B:{"66":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","164":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB","66":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB bC cC dC eC yB LC fC zB","66":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"292":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A q","292":"B C yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"164":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"66":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Device Adaptation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-dir-pseudo.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-dir-pseudo.js
index a4be6af177faf5..4c2f14ed80c068 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-dir-pseudo.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-dir-pseudo.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r","194":"0 1 2 s t u v w x y z E"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N NC OC","33":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z","194":"0 1 2 a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z YC ZC aC bC wB IC cC xB","194":"a b c d e f g h i j k l"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"KD","33":"JD"}},B:5,C:":dir() CSS pseudo-class",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r","194":"0 1 2 3 s t u v w x y z H"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M QC RC","33":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},D:{"1":"8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z","194":"0 1 2 3 a b c d e f g h i j k l m r s t u v w x y z H xB 7B"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z bC cC dC eC yB LC fC zB","194":"a b c d e f g h i j k l m"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"MD","33":"LD"}},B:5,C:":dir() CSS pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-display-contents.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-display-contents.js
index cf2e768dfb2964..bfc83ec37c2359 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-display-contents.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-display-contents.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","132":"P Q R S T U V W X","260":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB NC OC","132":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B","260":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","132":"jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X","194":"eB 1B fB 2B gB hB iB","260":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B PC 7B QC RC SC TC 8B","132":"C L M I wB xB 9B UC VC AC BC yB WC","516":"D CC DC EC FC GC HC XC","772":"zB"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YC ZC aC bC wB IC cC xB","132":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB","260":"tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC","132":"nC oC pC qC rC sC","260":"tC uC vC wC AC BC yB xC","516":"D CC DC EC FC GC HC","772":"zB"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","260":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","260":"p"},L:{"260":"E"},M:{"260":"E"},N:{"2":"A B"},O:{"132":"yB"},P:{"2":"J 5C 6C 7C 8C","132":"9C 8B AD BD CD DD","260":"m n o ED zB FD GD HD"},Q:{"132":"9B"},R:{"260":"ID"},S:{"132":"JD","260":"KD"}},B:4,C:"CSS display: contents",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","132":"P Q R S T U V W X","260":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB QC RC","132":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B","260":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","132":"kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X","194":"fB 4B gB 5B hB iB jB","260":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B SC 9B TC UC VC WC AC","132":"C K L G yB zB BC XC YC CC DC 0B ZC","260":"2B KC aC","772":"1B EC FC GC HC IC JC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB bC cC dC eC yB LC fC zB","132":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB","260":"uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC","132":"qC rC sC tC uC vC","260":"wC xC yC zC CC DC 0B 0C","516":"EC FC GC HC IC JC","772":"1B"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","260":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","260":"q"},L:{"260":"H"},M:{"260":"xB"},N:{"2":"A B"},O:{"132":"0B"},P:{"2":"I 8C 9C AD BD","132":"CD AC DD ED FD GD","260":"n o p HD 1B 2B ID JD"},Q:{"132":"BC"},R:{"260":"KD"},S:{"132":"LD","260":"MD"}},B:4,C:"CSS display: contents",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-element-function.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-element-function.js
index f2c8d0c8438d83..809edb4da8861a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-element-function.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-element-function.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"33":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","164":"LC 0B NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"33":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"33":"JD KD"}},B:5,C:"CSS element() function",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"33":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","164":"OC 3B QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"33":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"33":"LD MD"}},B:5,C:"CSS element() function",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-env-function.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-env-function.js
index ef09bb417b11ea..7349c022d67b1c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-env-function.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-env-function.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB NC OC"},D:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","132":"B"},F:{"1":"cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC","132":"mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:7,C:"CSS Environment Variables env()",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB QC RC"},D:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","132":"B"},F:{"1":"dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC","132":"pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:7,C:"CSS Environment Variables env()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-exclusions.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-exclusions.js
index f9780c7f933107..2197d5ed543921 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-exclusions.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-exclusions.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","33":"A B"},B:{"2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","33":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"33":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Exclusions Level 1",D:true};
+module.exports={A:{A:{"2":"J D E F NC","33":"A B"},B:{"2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","33":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"33":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Exclusions Level 1",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-featurequeries.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-featurequeries.js
index c759d2e106f73d..10df855f6fb7f2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-featurequeries.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-featurequeries.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC"},D:{"1":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B C YC ZC aC bC wB IC cC"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS Feature Queries",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC"},D:{"1":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B C bC cC dC eC yB LC fC"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS Feature Queries",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-file-selector-button.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-file-selector-button.js
index 97b082442f25bf..b9eb1b8121fc6b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-file-selector-button.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-file-selector-button.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X"},L:{"1":"E"},B:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E","33":"C L M I N D O P Q R S T U V W X"},C:{"1":"0 1 2 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R NC OC"},M:{"1":"E"},A:{"2":"K F G H KC","33":"A B"},F:{"1":"sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB"},K:{"1":"p","2":"A B C wB IC xB"},E:{"1":"I D UC VC AC BC yB WC zB CC DC EC FC GC HC","2":"XC","33":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B"},G:{"1":"D vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC"},P:{"1":"m n o ED zB FD GD HD","33":"J 5C 6C 7C 8C 9C 8B AD BD CD DD"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","33":"3C 4C"}},B:6,C:"::file-selector-button CSS pseudo-element",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X"},L:{"1":"H"},B:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H","33":"C K L G M N O P Q R S T U V W X"},C:{"1":"0 1 2 3 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R QC RC"},M:{"1":"xB"},A:{"2":"J D E F NC","33":"A B"},F:{"1":"tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB"},K:{"1":"q","2":"A B C yB LC zB"},E:{"1":"G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"aC","33":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC"},G:{"1":"yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC"},P:{"1":"n o p HD 1B 2B ID JD","33":"I 8C 9C AD BD CD AC DD ED FD GD"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","33":"6C 7C"}},B:6,C:"::file-selector-button CSS pseudo-element",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-filter-function.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-filter-function.js
index a2ab8e56da3d0c..b43ff3d7fc4c81 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-filter-function.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-filter-function.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC","33":"H"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC","33":"iC jC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS filter() function",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC","33":"F"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC","33":"lC mC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS filter() function",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-filters.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-filters.js
index d1f64ac3daebbd..c735b666593cfa 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-filters.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-filters.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","1028":"L M I N D O","1346":"C"},C:{"1":"0 1 2 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC","196":"GB","516":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB OC"},D:{"1":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I N D","33":"4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","33":"K F G H RC SC"},F:{"1":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"G fC gC hC iC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","33":"3C 4C"},J:{"2":"F","33":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","33":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"CSS Filter Effects",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","1028":"K L G M N O","1346":"C"},C:{"1":"0 1 2 3 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC","196":"HB","516":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB RC"},D:{"1":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G M N","33":"5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","33":"J D E F UC VC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"E iC jC kC lC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","33":"6C 7C"},J:{"2":"D","33":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","33":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"CSS Filter Effects",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-first-letter.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-first-letter.js
index f85d2cc0a04a74..63a7f3d8403b08 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-first-letter.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-first-letter.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","16":"KC","516":"G","1540":"K F"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","132":"0B","260":"LC"},D:{"1":"0 1 2 4 5 6 7 8 9 H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 K F G","132":"J"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 PC","132":"J 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","16":"H YC","260":"B ZC aC bC wB IC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC"},H:{"1":"yC"},I:{"1":"0B J E 2C JC 3C 4C","16":"zC 0C","132":"1C"},J:{"1":"F A"},K:{"1":"C p xB","260":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"::first-letter CSS pseudo-element selector",D:true};
+module.exports={A:{A:{"1":"F A B","16":"NC","516":"E","1540":"J D"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","132":"3B","260":"OC"},D:{"1":"0 1 2 3 5 6 7 8 9 F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 J D E","132":"I"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 SC","132":"I 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","16":"F bC","260":"B cC dC eC yB LC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC"},H:{"1":"1C"},I:{"1":"3B I H 5C MC 6C 7C","16":"2C 3C","132":"4C"},J:{"1":"D A"},K:{"1":"C q zB","260":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"::first-letter CSS pseudo-element selector",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-first-line.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-first-line.js
index 5889baad0975f3..5c12e06c5be69d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-first-line.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-first-line.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","132":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS first-line pseudo-element",D:true};
+module.exports={A:{A:{"1":"F A B","132":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS first-line pseudo-element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-fixed.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-fixed.js
index bf2e3a2aa721e9..f3ddf6c50f6870 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-fixed.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-fixed.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"F G H A B","2":"KC","8":"K"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","1025":"TC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC","132":"eC fC gC"},H:{"2":"yC"},I:{"1":"0B E 3C 4C","260":"zC 0C 1C","513":"J 2C JC"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS position:fixed",D:true};
+module.exports={A:{A:{"1":"D E F A B","2":"NC","8":"J"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","1025":"WC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC","132":"hC iC jC"},H:{"2":"1C"},I:{"1":"3B H 6C 7C","260":"2C 3C 4C","513":"I 5C MC"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS position:fixed",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-focus-visible.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-focus-visible.js
index fcffa6810b89be..34b8632bce639f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-focus-visible.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-focus-visible.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","328":"P Q R S T U"},C:{"1":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","161":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T"},D:{"1":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB","328":"lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B UC","578":"I VC AC"},F:{"1":"qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB YC ZC aC bC wB IC cC xB","328":"kB lB mB nB oB pB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC","578":"wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"161":"JD KD"}},B:5,C:":focus-visible CSS pseudo-class",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","328":"P Q R S T U"},C:{"1":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","161":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T"},D:{"1":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB","328":"mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC XC","578":"G YC CC"},F:{"1":"rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB bC cC dC eC yB LC fC zB","328":"lB mB nB oB pB qB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC","578":"zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"161":"LD MD"}},B:5,C:":focus-visible CSS pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-focus-within.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-focus-within.js
index 09bc5b6d5ed5ef..4037b18385ab95 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-focus-within.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-focus-within.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB NC OC"},D:{"1":"0 1 2 fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","194":"1B"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB YC ZC aC bC wB IC cC xB","194":"SB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:7,C:":focus-within CSS pseudo-class",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB QC RC"},D:{"1":"0 1 2 3 gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB","194":"4B"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB bC cC dC eC yB LC fC zB","194":"TB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:7,C:":focus-within CSS pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-palette.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-palette.js
index 48f6229a3cd375..f1bf0f68aff573 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-palette.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-palette.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r"},C:{"1":"0 1 2 u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t NC OC"},D:{"1":"0 1 2 k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V YC ZC aC bC wB IC cC xB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS font-palette",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r"},C:{"1":"0 1 2 3 u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t QC RC"},D:{"1":"0 1 2 3 k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC"},F:{"1":"W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V bC cC dC eC yB LC fC zB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p JD","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS font-palette",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-rendering-controls.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-rendering-controls.js
index 41cd20350062d7..26262d58a6383a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-rendering-controls.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-rendering-controls.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB NC OC","194":"SB TB UB VB WB XB YB ZB aB bB cB dB"},D:{"1":"0 1 2 fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","66":"VB WB XB YB ZB aB bB cB dB eB 1B"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB","66":"IB JB KB LB MB NB OB PB QB RB SB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","66":"5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","194":"JD"}},B:5,C:"CSS font-display",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB QC RC","194":"TB UB VB WB XB YB ZB aB bB cB dB eB"},D:{"1":"0 1 2 3 gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","66":"WB XB YB ZB aB bB cB dB eB fB 4B"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB","66":"JB KB LB MB NB OB PB QB RB SB TB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","66":"8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","194":"LD"}},B:5,C:"CSS font-display",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-stretch.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-stretch.js
index 0f78db8d16f746..c91c2ddf546f6a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-stretch.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-font-stretch.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G NC OC"},D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS font-stretch",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E QC RC"},D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS font-stretch",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-gencontent.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-gencontent.js
index d1203bb4a38c6c..e9f5374775276f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-gencontent.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-gencontent.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F KC","132":"G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS Generated content for pseudo-elements",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D NC","132":"E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS Generated content for pseudo-elements",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-gradients.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-gradients.js
index 56a4609dd718b7..07d01ebd9c46c8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-gradients.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-gradients.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC","260":"4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB","292":"3 J K F G H A B C L M I OC"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"4 5 6 7 A B C L M I N D O m n o","548":"3 J K F G H"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B","260":"F G H A B C L M I RC SC TC 8B wB xB 9B UC VC AC","292":"K QC","804":"3 J"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC","33":"C cC","164":"wB IC"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","260":"G gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC","292":"eC fC","804":"7B dC JC"},H:{"2":"yC"},I:{"1":"E 3C 4C","33":"J 2C JC","548":"0B zC 0C 1C"},J:{"1":"A","548":"F"},K:{"1":"p xB","2":"A B","33":"C","164":"wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS Gradients",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC","260":"5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB","292":"4 I J D E F A B C K L G RC"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"5 6 7 8 A B C K L G M N O n o p","548":"4 I J D E F"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B","260":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC","292":"J TC","804":"4 I"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC","33":"C fC","164":"yB LC"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","260":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC","292":"hC iC","804":"9B gC MC"},H:{"2":"1C"},I:{"1":"H 6C 7C","33":"I 5C MC","548":"3B 2C 3C 4C"},J:{"1":"A","548":"D"},K:{"1":"q zB","2":"A B","33":"C","164":"yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS Gradients",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-grid-animation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-grid-animation.js
index df137ef806d19a..11e543bbfba58a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-grid-animation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-grid-animation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"CSS Grid animation",D:false};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"CSS Grid animation",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-grid.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-grid.js
index 5b3ae8b02454ed..6284508f51c4a9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-grid.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-grid.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","8":"H","292":"A B"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","292":"C L M I"},C:{"1":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N D O NC OC","8":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB","584":"MB NB OB PB QB RB SB TB UB VB WB XB","1025":"YB ZB"},D:{"1":"0 1 2 eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 J K F G H A B C L M I N D O m n o","8":"7 8 9 AB","200":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB","1025":"dB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","8":"K F G H A RC SC TC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o YC ZC aC bC wB IC cC xB","200":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","8":"G fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C","8":"JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"292":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"5C","8":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS Grid Layout (level 1)",D:true};
+module.exports={A:{A:{"2":"J D E NC","8":"F","292":"A B"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","292":"C K L G"},C:{"1":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M N O QC RC","8":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB","584":"NB OB PB QB RB SB TB UB VB WB XB YB","1025":"ZB aB"},D:{"1":"0 1 2 3 fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 I J D E F A B C K L G M N O n o p","8":"8 9 AB BB","200":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","1025":"eB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","8":"J D E F A UC VC WC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB bC cC dC eC yB LC fC zB","200":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","8":"E iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C","8":"MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"292":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"8C","8":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS Grid Layout (level 1)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-hanging-punctuation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-hanging-punctuation.js
index 35aa18e7fbad6b..dec6dca2704175 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-hanging-punctuation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-hanging-punctuation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:4,C:"CSS hanging-punctuation",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:4,C:"CSS hanging-punctuation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-has.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-has.js
index 9e0068b55c1212..18ffb76bc70195 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-has.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-has.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l NC OC","322":"0 1 2 q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j","194":"k l q r"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z YC ZC aC bC wB IC cC xB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:":has() CSS relational pseudo-class",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l QC RC","322":"0 1 2 3 m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j","194":"k l m r"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC"},F:{"1":"a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z bC cC dC eC yB LC fC zB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:":has() CSS relational pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-hyphens.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-hyphens.js
index 3331bec309989b..efdb8a8c52e30f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-hyphens.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-hyphens.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","33":"A B"},B:{"1":"0 1 2 s t u v w x y z E","33":"C L M I N D O","132":"P Q R S T U V W","260":"X Y Z a b c d e f g h i j k l q r"},C:{"1":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC","33":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},D:{"1":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","132":"bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W"},E:{"1":"XC","2":"3 J PC 7B","33":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC"},F:{"1":"a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB YC ZC aC bC wB IC cC xB","132":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z"},G:{"2":"7B dC","33":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","132":"5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS Hyphenation",D:true};
+module.exports={A:{A:{"2":"J D E F NC","33":"A B"},B:{"1":"0 1 2 3 s t u v w x y z H","33":"C K L G M N O","132":"P Q R S T U V W","260":"X Y Z a b c d e f g h i j k l m r"},C:{"1":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC","33":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},D:{"1":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB","132":"cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W"},E:{"1":"2B KC aC","2":"4 I SC 9B","33":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC"},F:{"1":"a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB bC cC dC eC yB LC fC zB","132":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z"},G:{"1":"2B KC","2":"9B gC","33":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","132":"8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS Hyphenation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-image-orientation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-image-orientation.js
index 06c279c2667694..42adf7d61fe0c7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-image-orientation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-image-orientation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q","257":"R S T U V W X"},C:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q","257":"R S T U V W X"},E:{"1":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB"},F:{"1":"uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB YC ZC aC bC wB IC cC xB","257":"mB nB oB pB qB p rB sB tB"},G:{"1":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","132":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD","257":"CD DD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 image-orientation",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q","257":"R S T U V W X"},C:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q","257":"R S T U V W X"},E:{"1":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB"},F:{"1":"vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB bC cC dC eC yB LC fC zB","257":"nB oB pB qB rB q sB tB uB"},G:{"1":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","132":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED","257":"FD GD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 image-orientation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-image-set.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-image-set.js
index 90caffc1442cb3..7b739c9247a539 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-image-set.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-image-set.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"1 2 E","2":"C L M I N D O","164":"P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z","2049":"0"},C:{"1":"0 1 2 E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U NC OC","66":"V W","2305":"Y Z a b c d e f g h i j k l q r s t u v w x y z","2820":"X"},D:{"1":"1 2 E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m","164":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z","2049":"0"},E:{"1":"D XC","2":"3 J PC 7B QC","132":"A B C L 8B wB xB 9B","164":"K F G H RC SC TC","1540":"M I UC VC AC BC yB WC zB CC DC EC FC GC HC"},F:{"1":"j k l","2":"H B C YC ZC aC bC wB IC cC xB","164":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h","2049":"i"},G:{"1":"D","2":"7B dC JC eC","132":"kC lC mC nC oC pC qC rC sC tC","164":"G fC gC hC iC jC","1540":"uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","164":"3C 4C"},J:{"2":"F","164":"A"},K:{"2":"A B C wB IC xB","164":"p"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"164":"yB"},P:{"164":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"164":"9B"},R:{"164":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS image-set",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"1 2 3 H","2":"C K L G M N O","164":"P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z","2049":"0"},C:{"1":"0 1 2 3 H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U QC RC","66":"V W","2305":"Y Z a b c d e f g h i j k l m r s t u v w x y z","2820":"X"},D:{"1":"1 2 3 H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n","164":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z","2049":"0"},E:{"1":"2B KC aC","2":"4 I SC 9B TC","132":"A B C K AC yB zB BC","164":"J D E F UC VC WC","1540":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC"},F:{"1":"j k l m","2":"F B C bC cC dC eC yB LC fC zB","164":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h","2049":"i"},G:{"1":"2B KC","2":"9B gC MC hC","132":"nC oC pC qC rC sC tC uC vC wC","164":"E iC jC kC lC mC","1540":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","164":"6C 7C"},J:{"2":"D","164":"A"},K:{"2":"A B C yB LC zB","164":"q"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"164":"0B"},P:{"164":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"164":"BC"},R:{"164":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS image-set",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-in-out-of-range.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-in-out-of-range.js
index 8268313152c3c2..5a94823523efc5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-in-out-of-range.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-in-out-of-range.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C","260":"L M I N D O"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC","516":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},D:{"1":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J","16":"3 K F G H A B C L M","260":"YB","772":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","16":"3","772":"K F G H A QC RC SC TC"},F:{"1":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H YC","260":"B C LB ZC aC bC wB IC cC xB","772":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC","772":"G eC fC gC hC iC jC kC"},H:{"132":"yC"},I:{"1":"E","2":"0B zC 0C 1C","260":"J 2C JC 3C 4C"},J:{"2":"F","260":"A"},K:{"1":"p","260":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","260":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","516":"JD"}},B:5,C:":in-range and :out-of-range CSS pseudo-classes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C","260":"K L G M N O"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC","516":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},D:{"1":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I","16":"4 J D E F A B C K L","260":"ZB","772":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","16":"4","772":"J D E F A TC UC VC WC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F bC","260":"B C MB cC dC eC yB LC fC zB","772":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC","772":"E hC iC jC kC lC mC nC"},H:{"132":"1C"},I:{"1":"H","2":"3B 2C 3C 4C","260":"I 5C MC 6C 7C"},J:{"2":"D","260":"A"},K:{"1":"q","260":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","260":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","516":"LD"}},B:5,C:":in-range and :out-of-range CSS pseudo-classes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-indeterminate-pseudo.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-indeterminate-pseudo.js
index 3d134c2171d098..bcfe73a529eb0a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-indeterminate-pseudo.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-indeterminate-pseudo.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","132":"A B","388":"H"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C L M I N D O"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC 0B NC OC","132":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","388":"3 J"},D:{"1":"0 1 2 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J K PC 7B","132":"F G H A RC SC TC","388":"QC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H B YC ZC aC bC wB IC","132":"4 5 6 7 I N D O m n o","516":"C cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC fC","132":"G gC hC iC jC kC"},H:{"516":"yC"},I:{"1":"E","16":"0B zC 0C 1C 4C","132":"3C","388":"J 2C JC"},J:{"16":"F","132":"A"},K:{"1":"p","16":"A B C wB IC","516":"xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","132":"JD"}},B:5,C:":indeterminate CSS pseudo-class",D:true};
+module.exports={A:{A:{"2":"J D E NC","132":"A B","388":"F"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C K L G M N O"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC 3B QC RC","132":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","388":"4 I"},D:{"1":"0 1 2 3 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I J SC 9B","132":"D E F A UC VC WC","388":"TC"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F B bC cC dC eC yB LC","132":"5 6 7 8 G M N O n o p","516":"C fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC iC","132":"E jC kC lC mC nC"},H:{"516":"1C"},I:{"1":"H","16":"3B 2C 3C 4C 7C","132":"6C","388":"I 5C MC"},J:{"16":"D","132":"A"},K:{"1":"q","16":"A B C yB LC","516":"zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","132":"LD"}},B:5,C:":indeterminate CSS pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-initial-letter.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-initial-letter.js
index 58e2f3c5ef2053..e61ba79e0d5a06 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-initial-letter.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-initial-letter.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w","260":"0 1 2 x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w","260":"0 1 2 x y z E 4B 5B 6B"},E:{"2":"3 J K F G PC 7B QC RC SC","4":"H","164":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g YC ZC aC bC wB IC cC xB","260":"h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC","164":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"260":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"n o","2":"J m 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Initial Letter",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w","260":"0 1 2 3 x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w","260":"0 1 2 3 x y z H xB 7B 8B"},E:{"2":"4 I J D E SC 9B TC UC VC","4":"F","164":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g bC cC dC eC yB LC fC zB","260":"h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC","164":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"260":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"o p","2":"I n 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Initial Letter",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-initial-value.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-initial-value.js
index f51c8322142ac7..10993d099697a2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-initial-value.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-initial-value.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","33":"3 J K F G H A B C L M I N D O NC OC","164":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS initial value",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","33":"4 I J D E F A B C K L G M N O QC RC","164":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS initial value",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-lch-lab.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-lch-lab.js
index 7ebb6e661279dc..7675a655ab3142 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-lch-lab.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-lch-lab.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w","322":"x"},C:{"1":"0 1 2 E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x NC OC","194":"y z"},D:{"1":"0 1 2 y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w","322":"x"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B UC"},F:{"1":"h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g YC ZC aC bC wB IC cC xB"},G:{"1":"D wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"o","2":"J m n 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:4,C:"LCH and Lab color values",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w","322":"x"},C:{"1":"0 1 2 3 H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x QC RC","194":"y z"},D:{"1":"0 1 2 3 y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w","322":"x"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC XC"},F:{"1":"h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g bC cC dC eC yB LC fC zB"},G:{"1":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"p","2":"I n o 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:4,C:"LCH and Lab color values",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-letter-spacing.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-letter-spacing.js
index edccc92faba873..a50a2d96744264 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-letter-spacing.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-letter-spacing.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","16":"KC","132":"K F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC","132":"3 J K 7B QC"},F:{"1":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H YC","132":"B C I N ZC aC bC wB IC cC xB"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"2":"yC"},I:{"1":"E 3C 4C","16":"zC 0C","132":"0B J 1C 2C JC"},J:{"132":"F A"},K:{"1":"p","132":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"letter-spacing CSS property",D:true};
+module.exports={A:{A:{"1":"F A B","16":"NC","132":"J D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC","132":"4 I J 9B TC"},F:{"1":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F bC","132":"B C G M cC dC eC yB LC fC zB"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"2":"1C"},I:{"1":"H 6C 7C","16":"2C 3C","132":"3B I 4C 5C MC"},J:{"132":"D A"},K:{"1":"q","132":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"letter-spacing CSS property",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-line-clamp.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-line-clamp.js
index 4cec69b7baa266..b65a778519f9f1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-line-clamp.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-line-clamp.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB NC OC","33":"0 1 2 mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"16":"3 J K F G H A B C L","33":"0 1 2 4 5 6 7 8 9 M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"J PC 7B","33":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"7B dC JC","33":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"16":"zC 0C","33":"0B J E 1C 2C JC 3C 4C"},J:{"33":"F A"},K:{"2":"A B C wB IC xB","33":"p"},L:{"33":"E"},M:{"33":"E"},N:{"2":"A B"},O:{"33":"yB"},P:{"33":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"33":"9B"},R:{"33":"ID"},S:{"2":"JD","33":"KD"}},B:5,C:"CSS line-clamp",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB QC RC","33":"0 1 2 3 nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"16":"4 I J D E F A B C K","33":"0 1 2 3 5 6 7 8 9 L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"I SC 9B","33":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"9B gC MC","33":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"16":"2C 3C","33":"3B I H 4C 5C MC 6C 7C"},J:{"33":"D A"},K:{"2":"A B C yB LC zB","33":"q"},L:{"33":"H"},M:{"33":"xB"},N:{"2":"A B"},O:{"33":"0B"},P:{"33":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"33":"BC"},R:{"33":"KD"},S:{"2":"LD","33":"MD"}},B:5,C:"CSS line-clamp",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-logical-props.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-logical-props.js
index 9c557028a9e38f..9cfbde2241b626 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-logical-props.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-logical-props.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","1028":"W X","1540":"P Q R S T U V"},C:{"1":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC","164":"3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NC OC","1540":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB"},D:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","292":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB","1028":"W X","1540":"nB oB pB qB p rB sB tB uB vB P Q R S T U V"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","292":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB","1540":"L M xB 9B","3076":"UC"},F:{"1":"tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","292":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB","1028":"rB sB","1540":"cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p"},G:{"1":"D wC AC BC yB xC zB CC DC EC FC GC HC","292":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC","1540":"pC qC rC sC tC uC","3076":"vC"},H:{"2":"yC"},I:{"1":"E","292":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"292":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o ED zB FD GD HD","292":"J 5C 6C 7C 8C 9C","1540":"8B AD BD CD DD"},Q:{"1540":"9B"},R:{"1":"ID"},S:{"1":"KD","1540":"JD"}},B:5,C:"CSS Logical Properties",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","1028":"W X","1540":"P Q R S T U V"},C:{"1":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC","164":"4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB QC RC","1540":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB"},D:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","292":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB","1028":"W X","1540":"oB pB qB rB q sB tB uB vB wB P Q R S T U V"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","292":"4 I J D E F A B C SC 9B TC UC VC WC AC yB","1540":"K L zB BC","3076":"XC"},F:{"1":"uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","292":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB","1028":"sB tB","1540":"dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q"},G:{"1":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","292":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC","1540":"sC tC uC vC wC xC","3076":"yC"},H:{"2":"1C"},I:{"1":"H","292":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"292":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p HD 1B 2B ID JD","292":"I 8C 9C AD BD CD","1540":"AC DD ED FD GD"},Q:{"1540":"BC"},R:{"1":"KD"},S:{"1":"MD","1540":"LD"}},B:5,C:"CSS Logical Properties",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-marker-pseudo.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-marker-pseudo.js
index ed535d87e7e761..d75b2b077216fe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-marker-pseudo.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-marker-pseudo.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S T U"},C:{"1":"0 1 2 mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB NC OC"},D:{"1":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U"},E:{"1":"XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B","129":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC"},F:{"1":"qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"CSS ::marker pseudo-element",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S T U"},C:{"1":"0 1 2 3 nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB QC RC"},D:{"1":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U"},E:{"1":"aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC","129":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC"},F:{"1":"rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"CSS ::marker pseudo-element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-masks.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-masks.js
index 4cba45f901506e..9705fa72cad163 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-masks.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-masks.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N","164":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","3138":"D","12292":"O"},C:{"1":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","260":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB NC OC"},D:{"164":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B","164":"3 J K F G H A B C L M I QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","164":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","164":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"164":"E 3C 4C","676":"0B J zC 0C 1C 2C JC"},J:{"164":"F A"},K:{"2":"A B C wB IC xB","164":"p"},L:{"164":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"164":"yB"},P:{"164":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"164":"9B"},R:{"164":"ID"},S:{"1":"KD","260":"JD"}},B:4,C:"CSS Masks",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M","164":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","3138":"N","12292":"O"},C:{"1":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","260":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB QC RC"},D:{"164":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B","164":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","164":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","164":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"164":"H 6C 7C","676":"3B I 2C 3C 4C 5C MC"},J:{"164":"D A"},K:{"2":"A B C yB LC zB","164":"q"},L:{"164":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"164":"0B"},P:{"164":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"164":"BC"},R:{"164":"KD"},S:{"1":"MD","260":"LD"}},B:4,C:"CSS Masks",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-matches-pseudo.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-matches-pseudo.js
index b3d552b3eab5e5..d8a8a3bab4fa41 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-matches-pseudo.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-matches-pseudo.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","1220":"P Q R S T U V W"},C:{"1":"0 1 2 vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC 0B NC OC","548":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB"},D:{"1":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M","164":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB","196":"jB kB lB","1220":"mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W"},E:{"1":"M I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","16":"3","164":"K F G QC RC SC","260":"H A B C L TC 8B wB xB 9B"},F:{"1":"sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","164":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","196":"YB ZB aB","1220":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB"},G:{"1":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC fC","164":"G gC hC","260":"iC jC kC lC mC nC oC pC qC rC sC tC"},H:{"2":"yC"},I:{"1":"E","16":"0B zC 0C 1C","164":"J 2C JC 3C 4C"},J:{"16":"F","164":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o ED zB FD GD HD","164":"J 5C 6C 7C 8C 9C 8B AD BD CD DD"},Q:{"1220":"9B"},R:{"1":"ID"},S:{"1":"KD","548":"JD"}},B:5,C:":is() CSS pseudo-class",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","1220":"P Q R S T U V W"},C:{"1":"0 1 2 3 wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC 3B QC RC","548":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB"},D:{"1":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L","164":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB","196":"kB lB mB","1220":"nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W"},E:{"1":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","16":"4","164":"J D E TC UC VC","260":"F A B C K WC AC yB zB BC"},F:{"1":"tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","164":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","196":"ZB aB bB","1220":"cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB"},G:{"1":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC iC","164":"E jC kC","260":"lC mC nC oC pC qC rC sC tC uC vC wC"},H:{"2":"1C"},I:{"1":"H","16":"3B 2C 3C 4C","164":"I 5C MC 6C 7C"},J:{"16":"D","164":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p HD 1B 2B ID JD","164":"I 8C 9C AD BD CD AC DD ED FD GD"},Q:{"1220":"BC"},R:{"1":"KD"},S:{"1":"MD","548":"LD"}},B:5,C:":is() CSS pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-math-functions.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-math-functions.js
index 00c55f7abb7e4c..213b45fd236507 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-math-functions.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-math-functions.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB NC OC"},D:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB"},E:{"1":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B","132":"C L wB xB"},F:{"1":"kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB YC ZC aC bC wB IC cC xB"},G:{"1":"D tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC","132":"nC oC pC qC rC sC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"CSS math functions min(), max() and clamp()",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB QC RC"},D:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB"},E:{"1":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC","132":"C K yB zB"},F:{"1":"lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB bC cC dC eC yB LC fC zB"},G:{"1":"wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC","132":"qC rC sC tC uC vC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"CSS math functions min(), max() and clamp()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-interaction.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-interaction.js
index 5f703163921ccb..b19680b7790de6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-interaction.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-interaction.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB NC OC"},D:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"Media Queries: interaction media features",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB QC RC"},D:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"Media Queries: interaction media features",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-range-syntax.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-range-syntax.js
index e07dc740c29525..0238c7b179fda7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-range-syntax.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-range-syntax.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 r s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q"},C:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB NC OC"},D:{"1":"0 1 2 r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"1":"a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z YC ZC aC bC wB IC cC xB"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"Media Queries: Range Syntax",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 r s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m"},C:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB QC RC"},D:{"1":"0 1 2 3 r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC"},F:{"1":"a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z bC cC dC eC yB LC fC zB"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"Media Queries: Range Syntax",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-resolution.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-resolution.js
index 09abea1348927c..d226320ad78543 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-resolution.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-resolution.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","132":"H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","1028":"C L M I N D O"},C:{"1":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","260":"3 J K F G H A B C L M I NC OC","1028":"4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B"},D:{"1":"0 1 2 mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","548":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB","1028":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"PC 7B","548":"3 J K F G H A B C L M I QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H","548":"B C YC ZC aC bC wB IC cC","1028":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},G:{"1":"D zB CC DC EC FC GC HC","16":"7B","548":"G dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"132":"yC"},I:{"1":"E","16":"zC 0C","548":"0B J 1C 2C JC","1028":"3C 4C"},J:{"548":"F A"},K:{"1":"p xB","548":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","1028":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Media Queries: resolution feature",D:true};
+module.exports={A:{A:{"2":"J D E NC","132":"F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","1028":"C K L G M N O"},C:{"1":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","260":"4 I J D E F A B C K L G QC RC","1028":"5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B"},D:{"1":"0 1 2 3 nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","548":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB","1028":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B","548":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F","548":"B C bC cC dC eC yB LC fC","1028":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","16":"9B","548":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"132":"1C"},I:{"1":"H","16":"2C 3C","548":"3B I 4C 5C MC","1028":"6C 7C"},J:{"548":"D A"},K:{"1":"q zB","548":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","1028":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Media Queries: resolution feature",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-scripting.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-scripting.js
index e61276a98ebee8..9acb26277edc54 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-scripting.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-media-scripting.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"Media Queries: scripting media feature",D:false};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"Media Queries: scripting media feature",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-mediaqueries.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-mediaqueries.js
index 36a65982ad1566..990503880cbcc7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-mediaqueries.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-mediaqueries.js
@@ -1 +1 @@
-module.exports={A:{A:{"8":"K F G KC","129":"H A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","129":"3 4 5 6 7 J K F G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","129":"3 J K QC","388":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","129":"7B dC JC eC fC"},H:{"1":"yC"},I:{"1":"E 3C 4C","129":"0B J zC 0C 1C 2C JC"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"129":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS3 Media Queries",D:true};
+module.exports={A:{A:{"8":"J D E NC","129":"F A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","129":"4 5 6 7 8 I J D E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","129":"4 I J TC","388":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","129":"9B gC MC hC iC"},H:{"1":"1C"},I:{"1":"H 6C 7C","129":"3B I 2C 3C 4C 5C MC"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"129":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS3 Media Queries",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-mixblendmode.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-mixblendmode.js
index ecac56515acd59..5776c5c9ece7cf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-mixblendmode.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-mixblendmode.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB NC OC"},D:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB","194":"BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"2":"3 J K F PC 7B QC RC","260":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB YC ZC aC bC wB IC cC xB"},G:{"2":"7B dC JC eC fC gC","260":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Blending of HTML/SVG elements",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB QC RC"},D:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB","194":"CB DB EB FB GB HB IB JB KB LB MB NB"},E:{"2":"4 I J D SC 9B TC UC","260":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB bC cC dC eC yB LC fC zB"},G:{"2":"9B gC MC hC iC jC","260":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Blending of HTML/SVG elements",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-motion-paths.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-motion-paths.js
index 7c07a34bfe672b..b04495b6541121 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-motion-paths.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-motion-paths.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB NC OC"},D:{"1":"0 1 2 SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","194":"PB QB RB"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB YC ZC aC bC wB IC cC xB","194":"CB DB EB"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"CSS Motion Path",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB QC RC"},D:{"1":"0 1 2 3 TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","194":"QB RB SB"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB bC cC dC eC yB LC fC zB","194":"DB EB FB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"CSS Motion Path",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-namespaces.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-namespaces.js
index 6f7cdfa0c83bed..10055a3e1e8e50 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-namespaces.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-namespaces.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC 7B"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS namespaces",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC 9B"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS namespaces",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-nesting.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-nesting.js
index 2bdffbcdf16c7a..d16643d4b48e71 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-nesting.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-nesting.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v","194":"w x y"},C:{"1":"4B 5B 6B MC","2":"0 1 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z NC OC","322":"2 E"},D:{"1":"0 1 2 z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v","194":"w x y"},E:{"1":"D GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC"},F:{"1":"h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d YC ZC aC bC wB IC cC xB","194":"e f g"},G:{"1":"D GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Nesting",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v","194":"w x y","516":"0 1 2 3 z H"},C:{"1":"H xB 7B 8B PC","2":"0 1 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z QC RC","322":"2 3"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v","194":"w x y","516":"0 1 2 3 z H xB 7B 8B"},E:{"1":"aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC","516":"IC JC 2B KC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d bC cC dC eC yB LC fC zB","194":"e f g","516":"h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC","516":"IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","516":"H"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"516":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Nesting",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-not-sel-list.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-not-sel-list.js
index 8decc8e0217fe9..75015da0f7dd15 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-not-sel-list.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-not-sel-list.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O Q R S T U V W","16":"P"},C:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S NC OC"},D:{"1":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"selector list argument of :not()",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O Q R S T U V W","16":"P"},C:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S QC RC"},D:{"1":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD GD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"selector list argument of :not()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-nth-child-of.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-nth-child-of.js
index 4a79bbfa26a523..e7c64cde3af4b7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-nth-child-of.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-nth-child-of.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x"},C:{"1":"0 1 2 E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z NC OC"},D:{"1":"0 1 2 y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"o","2":"J m n 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"selector list argument of :nth-child and :nth-last-child CSS pseudo-classes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x"},C:{"1":"0 1 2 3 H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z QC RC"},D:{"1":"0 1 2 3 y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"p","2":"I n o 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"selector list argument of :nth-child and :nth-last-child CSS pseudo-classes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-opacity.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-opacity.js
index e6babad7bc3cfa..e1bd704e485f5f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-opacity.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-opacity.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","4":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS3 Opacity",D:true};
+module.exports={A:{A:{"1":"F A B","4":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS3 Opacity",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-optional-pseudo.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-optional-pseudo.js
index 8bed11e0811f03..36f3fa9e893bac 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-optional-pseudo.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-optional-pseudo.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H YC","132":"B C ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"132":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"p","132":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:":optional CSS pseudo-class",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F bC","132":"B C cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"132":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"q","132":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:":optional CSS pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow-anchor.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow-anchor.js
index 2fa0ec1f2b8fe7..f194d8a0fe2b8f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow-anchor.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow-anchor.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB NC OC"},D:{"1":"0 1 2 cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"CSS overflow-anchor (Scroll Anchoring)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB QC RC"},D:{"1":"0 1 2 3 dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"CSS overflow-anchor (Scroll Anchoring)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow-overlay.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow-overlay.js
index 5ec6dd31b70029..8184d4aa3dc316 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow-overlay.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow-overlay.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z","2":"C L M I N D O","130":"1 2 E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z","16":"3 J K F G H A B C L M","130":"1 2 E 4B 5B 6B"},E:{"1":"3 J K F G H A B QC RC SC TC 8B wB","16":"PC 7B","130":"C L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i","2":"H B C YC ZC aC bC wB IC cC xB","130":"j k l"},G:{"1":"G dC JC eC fC gC hC iC jC kC lC mC nC","16":"7B","130":"D oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J zC 0C 1C 2C JC 3C 4C","130":"E"},J:{"16":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"130":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS overflow: overlay",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z","2":"C K L G M N O","130":"1 2 3 H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z","16":"4 I J D E F A B C K L","130":"1 2 3 H xB 7B 8B"},E:{"1":"4 I J D E F A B TC UC VC WC AC yB","16":"SC 9B","130":"C K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i","2":"F B C bC cC dC eC yB LC fC zB","130":"j k l m"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC","16":"9B","130":"rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I 2C 3C 4C 5C MC 6C 7C","130":"H"},J:{"16":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"130":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS overflow: overlay",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow.js
index 47796e7a5c3301..0f77c8852d8c75 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overflow.js
@@ -1 +1 @@
-module.exports={A:{A:{"388":"K F G H A B KC"},B:{"1":"0 1 2 Z a b c d e f g h i j k l q r s t u v w x y z E","260":"P Q R S T U V W X Y","388":"C L M I N D O"},C:{"1":"0 1 2 R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","260":"2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q","388":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB NC OC"},D:{"1":"0 1 2 Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","260":"mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y","388":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB"},E:{"1":"D zB CC DC EC FC GC HC XC","260":"M I 9B UC VC AC BC yB WC","388":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB"},F:{"1":"tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","260":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB","388":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB YC ZC aC bC wB IC cC xB"},G:{"1":"D zB CC DC EC FC GC HC","260":"tC uC vC wC AC BC yB xC","388":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"388":"yC"},I:{"1":"E","388":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"388":"F A"},K:{"1":"p","388":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"388":"A B"},O:{"388":"yB"},P:{"1":"m n o ED zB FD GD HD","388":"J 5C 6C 7C 8C 9C 8B AD BD CD DD"},Q:{"388":"9B"},R:{"1":"ID"},S:{"1":"KD","388":"JD"}},B:5,C:"CSS overflow property",D:true};
+module.exports={A:{A:{"388":"J D E F A B NC"},B:{"1":"0 1 2 3 Z a b c d e f g h i j k l m r s t u v w x y z H","260":"P Q R S T U V W X Y","388":"C K L G M N O"},C:{"1":"0 1 2 3 R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","260":"5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q","388":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB QC RC"},D:{"1":"0 1 2 3 Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","260":"nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y","388":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","260":"L G BC XC YC CC DC 0B ZC","388":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB"},F:{"1":"uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","260":"cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB","388":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB bC cC dC eC yB LC fC zB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","260":"wC xC yC zC CC DC 0B 0C","388":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC"},H:{"388":"1C"},I:{"1":"H","388":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"388":"D A"},K:{"1":"q","388":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"388":"A B"},O:{"388":"0B"},P:{"1":"n o p HD 1B 2B ID JD","388":"I 8C 9C AD BD CD AC DD ED FD GD"},Q:{"388":"BC"},R:{"1":"KD"},S:{"1":"MD","388":"LD"}},B:5,C:"CSS overflow property",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overscroll-behavior.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overscroll-behavior.js
index 88b94efed1bebd..878272d1dd3b93 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overscroll-behavior.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-overscroll-behavior.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","132":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C L M I N D","516":"O"},C:{"1":"0 1 2 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB NC OC"},D:{"1":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB","260":"hB iB"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B","1090":"I UC VC AC BC yB WC"},F:{"1":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB YC ZC aC bC wB IC cC xB","260":"WB XB"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC","1090":"vC wC AC BC yB xC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"CSS overscroll-behavior",D:true};
+module.exports={A:{A:{"2":"J D E F NC","132":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C K L G M N","516":"O"},C:{"1":"0 1 2 3 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB QC RC"},D:{"1":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB","260":"iB jB"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC","1090":"G XC YC CC DC 0B ZC"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB bC cC dC eC yB LC fC zB","260":"XB YB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC","1090":"yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"CSS overscroll-behavior",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-page-break.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-page-break.js
index b60d28f8a0705f..cc2878cf6fa29c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-page-break.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-page-break.js
@@ -1 +1 @@
-module.exports={A:{A:{"388":"A B","900":"K F G H KC"},B:{"388":"C L M I N D O","900":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"772":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","900":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB NC OC"},D:{"900":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"772":"A","900":"3 J K F G H B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"16":"H YC","129":"B C ZC aC bC wB IC cC xB","900":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"900":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"129":"yC"},I:{"900":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"900":"F A"},K:{"129":"A B C wB IC xB","900":"p"},L:{"900":"E"},M:{"772":"E"},N:{"388":"A B"},O:{"900":"yB"},P:{"900":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"900":"9B"},R:{"900":"ID"},S:{"772":"KD","900":"JD"}},B:2,C:"CSS page-break properties",D:true};
+module.exports={A:{A:{"388":"A B","900":"J D E F NC"},B:{"388":"C K L G M N O","900":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"772":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","900":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB QC RC"},D:{"900":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"772":"A","900":"4 I J D E F B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"16":"F bC","129":"B C cC dC eC yB LC fC zB","900":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"900":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"129":"1C"},I:{"900":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"900":"D A"},K:{"129":"A B C yB LC zB","900":"q"},L:{"900":"H"},M:{"772":"xB"},N:{"388":"A B"},O:{"900":"0B"},P:{"900":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"900":"BC"},R:{"900":"KD"},S:{"772":"MD","900":"LD"}},B:2,C:"CSS page-break properties",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-paged-media.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-paged-media.js
index ae4605bff35825..f487c85c965faa 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-paged-media.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-paged-media.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F KC","132":"G H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C L M I N D O"},C:{"2":"3 LC 0B J K F G H A B C L M I N D O NC OC","132":"0 1 2 4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","132":"H B C YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"16":"yC"},I:{"16":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"1":"p","16":"A B C wB IC xB"},L:{"1":"E"},M:{"132":"E"},N:{"258":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"132":"JD KD"}},B:5,C:"CSS Paged Media (@page)",D:true};
+module.exports={A:{A:{"2":"J D NC","132":"E F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C K L G M N O"},C:{"2":"4 OC 3B I J D E F A B C K L G M N O QC RC","132":"0 1 2 3 5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","132":"F B C bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"16":"1C"},I:{"16":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"1":"q","16":"A B C yB LC zB"},L:{"1":"H"},M:{"132":"xB"},N:{"258":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"132":"LD MD"}},B:5,C:"CSS Paged Media (@page)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-paint-api.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-paint-api.js
index 2586d1359b3883..097e27e4ba6a27 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-paint-api.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-paint-api.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB"},E:{"2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB","194":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:4,C:"CSS Painting API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB"},E:{"2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB","194":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:4,C:"CSS Painting API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-placeholder-shown.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-placeholder-shown.js
index 12d9e1e32da7e7..ff204d2204ea0d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-placeholder-shown.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-placeholder-shown.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","292":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","164":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},D:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","164":"JD"}},B:5,C:":placeholder-shown CSS pseudo-class",D:true};
+module.exports={A:{A:{"2":"J D E F NC","292":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","164":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},D:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","164":"LD"}},B:5,C:":placeholder-shown CSS pseudo-class",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-placeholder.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-placeholder.js
index 4db539e9f20d79..7085341061a2ac 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-placeholder.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-placeholder.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","36":"C L M I N D O"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","33":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","130":"3 LC 0B J K F G H A B C L M I N D O NC OC"},D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","36":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","36":"3 K F G H A QC RC SC TC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","36":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC","36":"G JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","36":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"36":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"36":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","36":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","33":"JD"}},B:5,C:"::placeholder CSS pseudo-element",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","36":"C K L G M N O"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","33":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","130":"4 OC 3B I J D E F A B C K L G M N O QC RC"},D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","36":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","36":"4 J D E F A TC UC VC WC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","36":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC","36":"E MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","36":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"36":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"36":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","36":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","33":"LD"}},B:5,C:"::placeholder CSS pseudo-element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-print-color-adjust.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-print-color-adjust.js
index 6f1f631538683f..f6536b062f53d7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-print-color-adjust.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-print-color-adjust.js
@@ -1 +1 @@
-module.exports={A:{D:{"2":"3 J K F G H A B C L M I N","33":"0 1 2 4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},L:{"33":"E"},B:{"2":"C L M I N D O","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB NC OC","33":"UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},K:{"2":"A B C wB IC xB","33":"p"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC","2":"3 J PC 7B QC XC","33":"K F G H A B C L M I RC SC TC 8B wB xB 9B UC VC AC"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"G fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},P:{"33":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},I:{"2":"0B J zC 0C 1C 2C JC","33":"E 3C 4C"}},B:6,C:"print-color-adjust property",D:undefined};
+module.exports={A:{D:{"2":"4 I J D E F A B C K L G M","33":"0 1 2 3 5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},L:{"33":"H"},B:{"2":"C K L G M N O","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB QC RC","33":"VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},K:{"2":"A B C yB LC zB","33":"q"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"4 I SC 9B TC aC","33":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},P:{"33":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},I:{"2":"3B I 2C 3C 4C 5C MC","33":"H 6C 7C"}},B:6,C:"print-color-adjust property",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-read-only-write.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-read-only-write.js
index 48f62ceed6766a..266a34fc234d5a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-read-only-write.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-read-only-write.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC","33":"3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB NC OC"},D:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC 7B","132":"3 J K F G QC RC SC"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H B YC ZC aC bC wB","132":"4 C I N D O m n o IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC","132":"G JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","16":"zC 0C","132":"0B J 1C 2C JC 3C 4C"},J:{"1":"A","132":"F"},K:{"1":"p","2":"A B wB","132":"C IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","33":"JD"}},B:1,C:"CSS :read-only and :read-write selectors",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC","33":"4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB QC RC"},D:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC 9B","132":"4 I J D E TC UC VC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F B bC cC dC eC yB","132":"5 C G M N O n o p LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC","132":"E MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","16":"2C 3C","132":"3B I 4C 5C MC 6C 7C"},J:{"1":"A","132":"D"},K:{"1":"q","2":"A B yB","132":"C LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","33":"LD"}},B:1,C:"CSS :read-only and :read-write selectors",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-rebeccapurple.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-rebeccapurple.js
index 26599e4d295894..b1c7ca5f9a83cd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-rebeccapurple.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-rebeccapurple.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","132":"B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB NC OC"},D:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC","16":"RC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Rebeccapurple color",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","132":"B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB QC RC"},D:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC","16":"UC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Rebeccapurple color",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-reflections.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-reflections.js
index ff0c3790140759..fb13eb7b6eca53 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-reflections.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-reflections.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"33":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"PC 7B","33":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"33":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"33":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"33":"F A"},K:{"2":"A B C wB IC xB","33":"p"},L:{"33":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"33":"yB"},P:{"33":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"33":"9B"},R:{"33":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS Reflections",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"33":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"SC 9B","33":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"33":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"33":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"33":"D A"},K:{"2":"A B C yB LC zB","33":"q"},L:{"33":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"33":"0B"},P:{"33":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"33":"BC"},R:{"33":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS Reflections",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-regions.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-regions.js
index 2c704966981669..82f251a2d4a3b3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-regions.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-regions.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","420":"A B"},B:{"2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","420":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 J K F G H A B C L M HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","36":"I N D O","66":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB"},E:{"2":"3 J K C L M I D PC 7B QC wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"F G H A B RC SC TC 8B"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"D 7B dC JC eC fC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"G gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"420":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Regions",D:true};
+module.exports={A:{A:{"2":"J D E F NC","420":"A B"},B:{"2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","420":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 I J D E F A B C K L IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","36":"G M N O","66":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB"},E:{"2":"4 I J C K L G SC 9B TC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"D E F A B UC VC WC AC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"9B gC MC hC iC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"E jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"420":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Regions",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-relative-colors.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-relative-colors.js
index c89776fe7bbf18..e1f8f3efe26b51 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-relative-colors.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-relative-colors.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B","194":"5B 6B"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Relative colors",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","194":"xB 7B 8B"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Relative colors",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-repeating-gradients.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-repeating-gradients.js
index 5646b5e7563202..996e8c89738622 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-repeating-gradients.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-repeating-gradients.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC","33":"3 J K F G H A B C L M I OC"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H","33":"4 5 6 7 A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B","33":"K QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC","33":"C cC","36":"wB IC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC","33":"eC fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B zC 0C 1C","33":"J 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p xB","2":"A B","33":"C","36":"wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS Repeating Gradients",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC","33":"4 I J D E F A B C K L G RC"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F","33":"5 6 7 8 A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B","33":"J TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC","33":"C fC","36":"yB LC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC","33":"hC iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B 2C 3C 4C","33":"I 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q zB","2":"A B","33":"C","36":"yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS Repeating Gradients",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-resize.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-resize.js
index 43493f0b0e4dae..1ac219007bc6ba 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-resize.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-resize.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","33":"J"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC","132":"xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:2,C:"CSS resize property",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","33":"I"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC","132":"zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:2,C:"CSS resize property",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-revert-value.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-revert-value.js
index c43fae9c6e24fa..28a0502f144f17 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-revert-value.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-revert-value.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S"},C:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB NC OC"},D:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC"},F:{"1":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB YC ZC aC bC wB IC cC xB"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"CSS revert value",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S"},C:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB QC RC"},D:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC"},F:{"1":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB bC cC dC eC yB LC fC zB"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"CSS revert value",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-rrggbbaa.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-rrggbbaa.js
index b62217605488ff..dd99cebdbb8a14 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-rrggbbaa.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-rrggbbaa.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB NC OC"},D:{"1":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","194":"YB ZB aB bB cB dB eB 1B fB 2B"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB YC ZC aC bC wB IC cC xB","194":"LB MB NB OB PB QB RB SB TB UB VB WB XB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","194":"5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"#rrggbbaa hex color notation",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB QC RC"},D:{"1":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","194":"ZB aB bB cB dB eB fB 4B gB 5B"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB bC cC dC eC yB LC fC zB","194":"MB NB OB PB QB RB SB TB UB VB WB XB YB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","194":"8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"#rrggbbaa hex color notation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scroll-behavior.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scroll-behavior.js
index 08f43b1c919157..2bb6e47ddacea5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scroll-behavior.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scroll-behavior.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","129":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB","129":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","450":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB 9B","578":"M I UC VC AC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o YC ZC aC bC wB IC cC xB","129":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","450":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC","578":"vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"129":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"129":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"CSS Scroll-behavior",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","129":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB","129":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","450":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB BC","578":"L G XC YC CC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB bC cC dC eC yB LC fC zB","129":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","450":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC","578":"yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"129":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"129":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"CSS Scroll-behavior",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scroll-timeline.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scroll-timeline.js
index 39ffd1b0975775..3f97be01f53672 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scroll-timeline.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scroll-timeline.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P Q R S T U V W X Y","194":"0 1 2 Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T","194":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","322":"U V W"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB YC ZC aC bC wB IC cC xB","194":"sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","322":"p rB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS @scroll-timeline",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T U V W X Y","194":"0 1 2 3 Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T","194":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","322":"U V W"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB bC cC dC eC yB LC fC zB","194":"tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","322":"q sB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS @scroll-timeline",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scrollbar.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scrollbar.js
index 0113c03adc6861..dcf7b2cea232bc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scrollbar.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-scrollbar.js
@@ -1 +1 @@
-module.exports={A:{A:{"132":"K F G H A B KC"},B:{"2":"C L M I N D O","292":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB NC OC","3138":"hB","4097":"0 1 2 iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"292":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"16":"3 J PC 7B","292":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","292":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC fC","292":"gC","804":"G hC iC jC kC lC mC nC oC pC qC rC sC tC"},H:{"2":"yC"},I:{"16":"zC 0C","292":"0B J E 1C 2C JC 3C 4C"},J:{"292":"F A"},K:{"2":"A B C wB IC xB","292":"p"},L:{"292":"E"},M:{"4097":"E"},N:{"2":"A B"},O:{"292":"yB"},P:{"292":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"292":"9B"},R:{"292":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS scrollbar styling",D:true};
+module.exports={A:{A:{"132":"J D E F A B NC"},B:{"2":"C K L G M N O","292":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB QC RC","3138":"iB","4097":"0 1 2 3 jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"292":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"16":"4 I SC 9B","292":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","292":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC iC","292":"jC","804":"E kC lC mC nC oC pC qC rC sC tC uC vC wC"},H:{"2":"1C"},I:{"16":"2C 3C","292":"3B I H 4C 5C MC 6C 7C"},J:{"292":"D A"},K:{"2":"A B C yB LC zB","292":"q"},L:{"292":"H"},M:{"4097":"xB"},N:{"2":"A B"},O:{"292":"0B"},P:{"292":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"292":"BC"},R:{"292":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS scrollbar styling",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sel2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sel2.js
index 16ee7127b33803..90f9a40d2a7fb7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sel2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sel2.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"F G H A B","2":"KC","8":"K"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS 2.1 selectors",D:true};
+module.exports={A:{A:{"1":"D E F A B","2":"NC","8":"J"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS 2.1 selectors",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sel3.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sel3.js
index 6d074bbe196c78..af2acabfb49218 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sel3.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sel3.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"KC","8":"K","132":"F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS3 selectors",D:true};
+module.exports={A:{A:{"1":"F A B","2":"NC","8":"J","132":"D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS3 selectors",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-selection.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-selection.js
index b440f3aa386c0e..d1c2cdc5d79ade 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-selection.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-selection.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","33":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"C p IC xB","16":"A B wB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","33":"JD"}},B:5,C:"::selection CSS pseudo-element",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","33":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"C q LC zB","16":"A B yB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","33":"LD"}},B:5,C:"::selection CSS pseudo-element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-shapes.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-shapes.js
index 85c5ce1e571bb0..3655063c9a4a5f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-shapes.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-shapes.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB NC OC","322":"XB YB ZB aB bB cB dB eB 1B fB 2B"},D:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB","194":"GB HB IB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC","33":"G H A SC TC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","33":"G hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"CSS Shapes Level 1",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB QC RC","322":"YB ZB aB bB cB dB eB fB 4B gB 5B"},D:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB","194":"HB IB JB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC","33":"E F A VC WC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","33":"E kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"CSS Shapes Level 1",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-snappoints.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-snappoints.js
index 2dddbe42502113..38c2396192cd38 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-snappoints.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-snappoints.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","6308":"A","6436":"B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","6436":"C L M I N D O"},C:{"1":"0 1 2 mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB NC OC","2052":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB"},D:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB","8258":"kB lB mB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC","3108":"H A TC 8B"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB YC ZC aC bC wB IC cC xB","8258":"aB bB cB dB eB fB gB hB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC","3108":"iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2052":"JD"}},B:4,C:"CSS Scroll Snap",D:true};
+module.exports={A:{A:{"2":"J D E F NC","6308":"A","6436":"B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","6436":"C K L G M N O"},C:{"1":"0 1 2 3 nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB QC RC","2052":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB"},D:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB","8258":"lB mB nB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC","3108":"F A WC AC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bC cC dC eC yB LC fC zB","8258":"bB cB dB eB fB gB hB iB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC","3108":"lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2052":"LD"}},B:4,C:"CSS Scroll Snap",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sticky.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sticky.js
index 550560c1c5b011..5e0353a53e850d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sticky.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-sticky.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I","1028":"P Q R S T U V W X Y Z","4100":"N D O"},C:{"1":"0 1 2 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 LC 0B J K F G H A B C L M I N D O m n o NC OC","194":"8 9 AB BB CB DB","516":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB"},D:{"1":"0 1 2 a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m n o JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","322":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB YB ZB aB bB","1028":"cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC","33":"G H A B C SC TC 8B wB xB","2084":"F RC"},F:{"1":"vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB YC ZC aC bC wB IC cC xB","322":"LB MB NB","1028":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"G hC iC jC kC lC mC nC oC pC","2084":"fC gC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"1028":"9B"},R:{"1":"ID"},S:{"1":"KD","516":"JD"}},B:5,C:"CSS position:sticky",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G","1028":"P Q R S T U V W X Y Z","4100":"M N O"},C:{"1":"0 1 2 3 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 OC 3B I J D E F A B C K L G M N O n o p QC RC","194":"9 AB BB CB DB EB","516":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB"},D:{"1":"0 1 2 3 a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n o p KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","322":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB ZB aB bB cB","1028":"dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC","33":"E F A B C VC WC AC yB zB","2084":"D UC"},F:{"1":"wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB bC cC dC eC yB LC fC zB","322":"MB NB OB","1028":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"E kC lC mC nC oC pC qC rC sC","2084":"iC jC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"1028":"BC"},R:{"1":"KD"},S:{"1":"MD","516":"LD"}},B:5,C:"CSS position:sticky",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-subgrid.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-subgrid.js
index 46bfb93f52c45e..9ba777f6625f10 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-subgrid.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-subgrid.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z","194":"1 2 E"},C:{"1":"0 1 2 pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB NC OC"},D:{"1":"4B 5B 6B","2":"0 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z","194":"1 2 E"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i YC ZC aC bC wB IC cC xB","194":"j k l"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"CSS Subgrid",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"H","2":"0 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z","194":"1 2 3"},C:{"1":"0 1 2 3 qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB QC RC"},D:{"1":"H xB 7B 8B","2":"0 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z","194":"1 2 3"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i bC cC dC eC yB LC fC zB","194":"j k l"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"CSS Subgrid",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-supports-api.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-supports-api.js
index 01858acafd8238..27b6dbc895e4c9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-supports-api.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-supports-api.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I N D O"},C:{"1":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O NC OC","66":"m n","260":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},D:{"1":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o","260":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC","132":"xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"132":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC","132":"xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS.supports() API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G M N O"},C:{"1":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O QC RC","66":"n o","260":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},D:{"1":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB","260":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC","132":"zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"132":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC","132":"zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS.supports() API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-table.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-table.js
index 43f408b724bb26..766b9c3174cabc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-table.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-table.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","2":"K F KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","132":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS Table display",D:true};
+module.exports={A:{A:{"1":"E F A B","2":"J D NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","132":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS Table display",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-align-last.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-align-last.js
index c58f4275d38284..f7cd992f39ea8d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-align-last.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-align-last.js
@@ -1 +1 @@
-module.exports={A:{A:{"132":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","4":"C L M I N D O"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B NC OC","33":"4 5 6 7 8 9 C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},D:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB","322":"HB IB JB KB LB MB NB OB PB QB RB SB"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n YC ZC aC bC wB IC cC xB","578":"5 6 7 8 9 o AB BB CB DB EB FB"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","33":"JD"}},B:4,C:"CSS3 text-align-last",D:true};
+module.exports={A:{A:{"132":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","4":"C K L G M N O"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B QC RC","33":"5 6 7 8 9 C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},D:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB","322":"IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o bC cC dC eC yB LC fC zB","578":"6 7 8 9 p AB BB CB DB EB FB GB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","33":"LD"}},B:4,C:"CSS3 text-align-last",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-box-trim.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-box-trim.js
index e167b6fdba76ca..6944a431e9be4e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-box-trim.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-box-trim.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC","194":"D FC GC HC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC","194":"D FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS text-box-trim & text-box-edge",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC","194":"HC IC JC 2B KC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC","194":"HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS text-box-trim & text-box-edge",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-indent.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-indent.js
index 701c0b32232ddc..751a7e45494273 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-indent.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-indent.js
@@ -1 +1 @@
-module.exports={A:{A:{"132":"K F G H A B KC"},B:{"132":"C L M I N D O","388":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"132":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB","388":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"D zB CC DC EC FC GC HC XC","132":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"132":"4 5 6 H B C I N D O m n o YC ZC aC bC wB IC cC xB","388":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D zB CC DC EC FC GC HC","132":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"132":"yC"},I:{"132":"0B J zC 0C 1C 2C JC 3C 4C","388":"E"},J:{"132":"F A"},K:{"132":"A B C wB IC xB","388":"p"},L:{"388":"E"},M:{"132":"E"},N:{"132":"A B"},O:{"388":"yB"},P:{"132":"J","388":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"388":"9B"},R:{"388":"ID"},S:{"132":"JD KD"}},B:4,C:"CSS text-indent",D:true};
+module.exports={A:{A:{"132":"J D E F A B NC"},B:{"132":"C K L G M N O","388":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"132":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB","388":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","132":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"132":"5 6 7 F B C G M N O n o p bC cC dC eC yB LC fC zB","388":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"1B EC FC GC HC IC JC 2B KC","132":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"132":"1C"},I:{"132":"3B I 2C 3C 4C 5C MC 6C 7C","388":"H"},J:{"132":"D A"},K:{"132":"A B C yB LC zB","388":"q"},L:{"388":"H"},M:{"132":"xB"},N:{"132":"A B"},O:{"388":"0B"},P:{"132":"I","388":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"388":"BC"},R:{"388":"KD"},S:{"132":"LD MD"}},B:4,C:"CSS text-indent",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-justify.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-justify.js
index a06e180993c3ed..f586ec5af2aa6d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-justify.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-justify.js
@@ -1 +1 @@
-module.exports={A:{A:{"16":"K F KC","132":"G H A B"},B:{"132":"C L M I N D O","322":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB NC OC","1025":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","1602":"aB"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","322":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB YC ZC aC bC wB IC cC xB","322":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","322":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","322":"p"},L:{"322":"E"},M:{"1025":"E"},N:{"132":"A B"},O:{"322":"yB"},P:{"2":"J","322":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"322":"9B"},R:{"322":"ID"},S:{"2":"JD","1025":"KD"}},B:4,C:"CSS text-justify",D:true};
+module.exports={A:{A:{"16":"J D NC","132":"E F A B"},B:{"132":"C K L G M N O","322":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB QC RC","1025":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","1602":"bB"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","322":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB bC cC dC eC yB LC fC zB","322":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","322":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","322":"q"},L:{"322":"H"},M:{"1025":"xB"},N:{"132":"A B"},O:{"322":"0B"},P:{"2":"I","322":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"322":"BC"},R:{"322":"KD"},S:{"2":"LD","1025":"MD"}},B:4,C:"CSS text-justify",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-orientation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-orientation.js
index 30d2ba018800b8..b0b65f7b56dde2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-orientation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-orientation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB NC OC","194":"KB LB MB"},D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"1":"M I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC","16":"A","33":"B C L 8B wB xB 9B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS text-orientation",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB QC RC","194":"LB MB NB"},D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"1":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC","16":"A","33":"B C K AC yB zB BC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS text-orientation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-spacing.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-spacing.js
index f66a8f1e748033..78801661814a4e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-spacing.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-spacing.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F KC","161":"G H A B"},B:{"2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","161":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"16":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS Text 4 text-spacing",D:false};
+module.exports={A:{A:{"2":"J D NC","161":"E F A B"},B:{"2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","161":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"16":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS Text 4 text-spacing",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-wrap-balance.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-wrap-balance.js
index 9f2089afc4f9f2..73a58cae8845f0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-wrap-balance.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-text-wrap-balance.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"1 2 E","2":"0 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"1 2 E 4B 5B 6B","2":"0 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS text-wrap: balance",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"1 2 3 H","2":"0 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z"},C:{"1":"8B PC","2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B QC RC"},D:{"1":"1 2 3 H xB 7B 8B","2":"0 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS text-wrap: balance",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-textshadow.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-textshadow.js
index 517f28cf50baf4..f4264221cc7f1e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-textshadow.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-textshadow.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","129":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"C L M I N D O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","260":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"4":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"A","4":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"129":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 Text-shadow",D:true};
+module.exports={A:{A:{"2":"J D E F NC","129":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","260":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"4":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"A","4":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"129":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 Text-shadow",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-touch-action.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-touch-action.js
index aab2fa448cc8bf..5f9d3b87cb634b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-touch-action.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-touch-action.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H KC","289":"A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC","194":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","1025":"YB ZB aB bB cB"},D:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC","516":"jC kC lC mC nC oC pC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","289":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","194":"JD"}},B:2,C:"CSS touch-action property",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F NC","289":"A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC","194":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","1025":"ZB aB bB cB dB"},D:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC","516":"mC nC oC pC qC rC sC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","289":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","194":"LD"}},B:2,C:"CSS touch-action property",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-transitions.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-transitions.js
index 5425f5baf82222..e8d7061002b40c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-transitions.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-transitions.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","33":"3 K F G H A B C L M I","164":"J"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 4 5 6 7 J K F G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"K QC","164":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H YC ZC","33":"C","164":"B aC bC wB IC cC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"fC","164":"7B dC JC eC"},H:{"2":"yC"},I:{"1":"E 3C 4C","33":"0B J zC 0C 1C 2C JC"},J:{"1":"A","33":"F"},K:{"1":"p xB","33":"C","164":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"CSS3 Transitions",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","33":"4 J D E F A B C K L G","164":"I"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 5 6 7 8 I J D E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"J TC","164":"4 I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F bC cC","33":"C","164":"B dC eC yB LC fC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"iC","164":"9B gC MC hC"},H:{"2":"1C"},I:{"1":"H 6C 7C","33":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","33":"D"},K:{"1":"q zB","33":"C","164":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"CSS3 Transitions",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-unicode-bidi.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-unicode-bidi.js
index 9fe58015878d8e..6aedd33f816b31 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-unicode-bidi.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-unicode-bidi.js
@@ -1 +1 @@
-module.exports={A:{A:{"132":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C L M I N D O"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","33":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","132":"3 LC 0B J K F G H NC OC","292":"A B C L M I N"},D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 J K F G H A B C L M I N","548":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"132":"3 J K F G PC 7B QC RC SC","548":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"132":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"132":"G 7B dC JC eC fC gC hC","548":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"16":"yC"},I:{"1":"E","16":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"1":"p","16":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","16":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","33":"JD"}},B:4,C:"CSS unicode-bidi property",D:false};
+module.exports={A:{A:{"132":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C K L G M N O"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","33":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","132":"4 OC 3B I J D E F QC RC","292":"A B C K L G M"},D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 I J D E F A B C K L G M","548":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"132":"4 I J D E SC 9B TC UC VC","548":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"132":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"132":"E 9B gC MC hC iC jC kC","548":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"16":"1C"},I:{"1":"H","16":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"1":"q","16":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","16":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","33":"LD"}},B:4,C:"CSS unicode-bidi property",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-unset-value.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-unset-value.js
index cadb117ba8f56b..f13e2ef251a583 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-unset-value.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-unset-value.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS unset value",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB bC cC dC eC yB LC fC zB"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS unset value",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-variables.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-variables.js
index 23b5308f1556cb..12682dca3eb478 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-variables.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-variables.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M","260":"I"},C:{"1":"0 1 2 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB","194":"UB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC","260":"TC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB YC ZC aC bC wB IC cC xB","194":"HB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC","260":"jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS Variables (Custom Properties)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L","260":"G"},C:{"1":"0 1 2 3 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","194":"VB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC","260":"WC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB bC cC dC eC yB LC fC zB","194":"IB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC","260":"mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS Variables (Custom Properties)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-when-else.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-when-else.js
index ae3d06a15cc402..0f4ac47fd57c8c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-when-else.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-when-else.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"CSS @when / @else conditional rules",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"CSS @when / @else conditional rules",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-widows-orphans.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-widows-orphans.js
index f9db21f310c6aa..5fb8e047fedf09 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-widows-orphans.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-widows-orphans.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F KC","129":"G H"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 J K F G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","129":"H B YC ZC aC bC wB IC cC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"2":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:2,C:"CSS widows & orphans",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D NC","129":"E F"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 I J D E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","129":"F B bC cC dC eC yB LC fC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"2":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:2,C:"CSS widows & orphans",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-width-stretch.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-width-stretch.js
index 11cc6e7bbe79dc..30b04cd7699650 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-width-stretch.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-width-stretch.js
@@ -1 +1 @@
-module.exports={A:{D:{"2":"3 4 J K F G H A B C L M I N D O m n","33":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},L:{"33":"E"},B:{"2":"C L M I N D O","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"LC","33":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},M:{"33":"E"},A:{"2":"K F G H A B KC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},K:{"2":"A B C wB IC xB","33":"p"},E:{"2":"3 J K PC 7B QC RC XC","33":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC"},G:{"2":"7B dC JC eC fC","33":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},P:{"2":"J","33":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},I:{"2":"0B J zC 0C 1C 2C JC","33":"E 3C 4C"}},B:6,C:"width: stretch property",D:undefined};
+module.exports={A:{D:{"2":"4 5 I J D E F A B C K L G M N O n o","33":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},L:{"33":"H"},B:{"2":"C K L G M N O","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"OC","33":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},M:{"33":"xB"},A:{"2":"J D E F A B NC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},K:{"2":"A B C yB LC zB","33":"q"},E:{"2":"4 I J SC 9B TC UC aC","33":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC"},G:{"2":"9B gC MC hC iC","33":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},P:{"2":"I","33":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},I:{"2":"3B I 2C 3C 4C 5C MC","33":"H 6C 7C"}},B:6,C:"width: stretch property",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-writing-mode.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-writing-mode.js
index 6e0916c8017e9b..54d84b644f8bdc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-writing-mode.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-writing-mode.js
@@ -1 +1 @@
-module.exports={A:{A:{"132":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB NC OC","322":"IB JB KB LB MB"},D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K","16":"F","33":"4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","16":"3","33":"K F G H A QC RC SC TC 8B"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC","33":"G eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"zC 0C 1C","33":"0B J 2C JC 3C 4C"},J:{"33":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"36":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","33":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS writing-mode property",D:true};
+module.exports={A:{A:{"132":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB QC RC","322":"JB KB LB MB NB"},D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J","16":"D","33":"5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","16":"4","33":"J D E F A TC UC VC WC AC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC","33":"E hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"2C 3C 4C","33":"3B I 5C MC 6C 7C"},J:{"33":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"36":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","33":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS writing-mode property",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-zoom.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-zoom.js
index 321c1ab08fb0b4..67108d75abee49 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-zoom.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css-zoom.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F KC","129":"G H A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B"},H:{"2":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"129":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS zoom",D:true};
+module.exports={A:{A:{"1":"J D NC","129":"E F A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B"},H:{"2":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"129":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS zoom",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-attr.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-attr.js
index 55b8b2922ae2d5..9fc5bf9e2d753a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-attr.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-attr.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS3 attr() function for all properties",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS3 attr() function for all properties",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-boxsizing.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-boxsizing.js
index 64744174528dfe..acdde39df3e90f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-boxsizing.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-boxsizing.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","8":"K F KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","33":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 J K F G H"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"7B dC JC"},H:{"1":"yC"},I:{"1":"J E 2C JC 3C 4C","33":"0B zC 0C 1C"},J:{"1":"A","33":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"CSS3 Box-sizing",D:true};
+module.exports={A:{A:{"1":"E F A B","8":"J D NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","33":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 I J D E F"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"4 I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"9B gC MC"},H:{"1":"1C"},I:{"1":"I H 5C MC 6C 7C","33":"3B 2C 3C 4C"},J:{"1":"A","33":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"CSS3 Box-sizing",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-colors.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-colors.js
index 7dda0bb0b6219e..975cf1bd386801 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-colors.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-colors.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","4":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","2":"H","4":"YC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS3 Colors",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","4":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","2":"F","4":"bC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS3 Colors",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors-grab.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors-grab.js
index f7cebbb6a9d0f4..36c4cb060e02f0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors-grab.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors-grab.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M"},C:{"1":"0 1 2 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","33":"3 4 5 6 7 8 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"3 J K F G H A PC 7B QC RC SC TC 8B"},F:{"1":"C bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H B YC ZC aC bC wB IC","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"33":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:2,C:"CSS grab & grabbing cursors",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L"},C:{"1":"0 1 2 3 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","33":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"4 I J D E F A SC 9B TC UC VC WC AC"},F:{"1":"C cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F B bC cC dC eC yB LC","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"33":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:2,C:"CSS grab & grabbing cursors",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors-newer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors-newer.js
index 12bc42d94d6797..23cf92307b728c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors-newer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors-newer.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","33":"3 4 5 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"3 J K F G PC 7B QC RC SC"},F:{"1":"6 7 8 9 C AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H B YC ZC aC bC wB IC","33":"4 5 I N D O m n o"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"33":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:2,C:"CSS3 Cursors: zoom-in & zoom-out",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","33":"4 5 6 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"4 I J D E SC 9B TC UC VC"},F:{"1":"7 8 9 C AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F B bC cC dC eC yB LC","33":"5 6 G M N O n o p"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"33":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:2,C:"CSS3 Cursors: zoom-in & zoom-out",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors.js
index 9aa1820363cb93..f214935145a8fb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-cursors.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","132":"K F G KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","4":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"J"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","4":"J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","260":"H B C YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","16":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:2,C:"CSS3 Cursors (original values)",D:true};
+module.exports={A:{A:{"1":"F A B","132":"J D E NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","4":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"I"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","4":"I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","260":"F B C bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","16":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:2,C:"CSS3 Cursors (original values)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-tabsize.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-tabsize.js
index d8abb9115e73fc..e0ad873c8e9ba1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-tabsize.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/css3-tabsize.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","33":"ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z","164":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},D:{"1":"0 1 2 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m","132":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},E:{"1":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC","132":"F G H A B C L RC SC TC 8B wB xB"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H YC ZC aC","132":"4 5 6 7 8 9 I N D O m n o AB","164":"B C bC wB IC cC xB"},G:{"1":"D tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC","132":"G gC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"164":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","132":"3C 4C"},J:{"132":"F A"},K:{"1":"p","2":"A","164":"B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"164":"JD KD"}},B:4,C:"CSS3 tab-size",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","33":"aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z","164":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB"},D:{"1":"0 1 2 3 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n","132":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},E:{"1":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC","132":"D E F A B C K UC VC WC AC yB zB"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F bC cC dC","132":"5 6 7 8 9 G M N O n o p AB BB","164":"B C eC yB LC fC zB"},G:{"1":"wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC","132":"E jC kC lC mC nC oC pC qC rC sC tC uC vC"},H:{"164":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","132":"6C 7C"},J:{"132":"D A"},K:{"1":"q","2":"A","164":"B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"164":"LD MD"}},B:4,C:"CSS3 tab-size",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/currentcolor.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/currentcolor.js
index a2a6829683692a..6b2319ab18b938 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/currentcolor.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/currentcolor.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS currentColor value",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS currentColor value",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/custom-elements.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/custom-elements.js
index 70c57cd82cafe9..06cf0db24f4628 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/custom-elements.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/custom-elements.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","8":"A B"},B:{"1":"P","2":"0 1 2 Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","8":"C L M I N D O"},C:{"2":"0 1 2 3 4 LC 0B J K F G H A B C L M I N D O m n o 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","66":"5 6 7 8 9 AB BB","72":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB"},D:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P","2":"0 1 2 3 4 5 6 7 8 J K F G H A B C L M I N D O m n o Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","66":"9 AB BB CB DB EB"},E:{"2":"3 J PC 7B QC","8":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB","2":"H B C lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","66":"4 I N D O"},G:{"2":"7B dC JC eC fC","8":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"4C","2":"0B J E zC 0C 1C 2C JC 3C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J 5C 6C 7C 8C 9C 8B AD BD","2":"m n o CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"2":"ID"},S:{"2":"KD","72":"JD"}},B:7,C:"Custom Elements (deprecated V0 spec)",D:true};
+module.exports={A:{A:{"2":"J D E F NC","8":"A B"},B:{"1":"P","2":"0 1 2 3 Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","8":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 OC 3B I J D E F A B C K L G M N O n o p 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","66":"6 7 8 9 AB BB CB","72":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB"},D:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P","2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","66":"AB BB CB DB EB FB"},E:{"2":"4 I SC 9B TC","8":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB","2":"F B C mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","66":"5 G M N O"},G:{"2":"9B gC MC hC iC","8":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"7C","2":"3B I H 2C 3C 4C 5C MC 6C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I 8C 9C AD BD CD AC DD ED","2":"n o p FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"2":"KD"},S:{"2":"MD","72":"LD"}},B:7,C:"Custom Elements (deprecated V0 spec)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/custom-elementsv1.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/custom-elementsv1.js
index f2b6078209f4d6..cae410f3e65871 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/custom-elementsv1.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/custom-elementsv1.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","8":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","8":"C L M I N D O"},C:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB NC OC","8":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","456":"WB XB YB ZB aB bB cB dB eB","712":"1B fB 2B gB"},D:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","8":"YB ZB","132":"aB bB cB dB eB 1B fB 2B gB hB iB jB kB"},E:{"2":"3 J K F PC 7B QC RC SC","8":"G H A TC","132":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB YC ZC aC bC wB IC cC xB","132":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC","132":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","132":"5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","8":"JD"}},B:1,C:"Custom Elements (V1)",D:true};
+module.exports={A:{A:{"2":"J D E F NC","8":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","8":"C K L G M N O"},C:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB QC RC","8":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","456":"XB YB ZB aB bB cB dB eB fB","712":"4B gB 5B hB"},D:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","8":"ZB aB","132":"bB cB dB eB fB 4B gB 5B hB iB jB kB lB"},E:{"2":"4 I J D SC 9B TC UC VC","8":"E F A WC","132":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB bC cC dC eC yB LC fC zB","132":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC","132":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","132":"8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","8":"LD"}},B:1,C:"Custom Elements (V1)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/customevent.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/customevent.js
index d5345ccd3ebe22..e2a5ef80d1b4d2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/customevent.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/customevent.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","132":"H A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC","132":"K F G H A"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J","16":"3 K F G L M","388":"H A B C"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","16":"3 K","388":"QC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H YC ZC aC bC","132":"B wB IC"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"dC","16":"7B JC","388":"eC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"zC 0C 1C","388":"0B J 2C JC"},J:{"1":"A","388":"F"},K:{"1":"C p xB","2":"A","132":"B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"CustomEvent",D:true};
+module.exports={A:{A:{"2":"J D E NC","132":"F A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC","132":"J D E F A"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I","16":"4 J D E K L","388":"F A B C"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","16":"4 J","388":"TC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F bC cC dC eC","132":"B yB LC"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"gC","16":"9B MC","388":"hC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"2C 3C 4C","388":"3B I 5C MC"},J:{"1":"A","388":"D"},K:{"1":"C q zB","2":"A","132":"B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"CustomEvent",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/datalist.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/datalist.js
index 2dd853e631122c..5958f8ec56eccb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/datalist.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/datalist.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G H","260":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I","1284":"N D O"},C:{"1":"0 1 2 x y z E 4B 5B 6B MC","8":"LC 0B NC OC","516":"l q r s t u v w","4612":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k"},D:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","8":"3 4 J K F G H A B C L M I N D O","132":"5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB"},F:{"1":"H B C iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB"},G:{"8":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC","2049":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E 4C","8":"0B J zC 0C 1C 2C JC 3C"},J:{"1":"A","8":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"8":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:1,C:"Datalist element",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E F","260":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G","1284":"M N O"},C:{"1":"0 1 2 3 x y z H xB 7B 8B PC","8":"OC 3B QC RC","516":"l m r s t u v w","4612":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k"},D:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","8":"4 5 I J D E F A B C K L G M N O","132":"6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"4 I J D E F A B C SC 9B TC UC VC WC AC yB"},F:{"1":"F B C jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB"},G:{"8":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC","2049":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H 7C","8":"3B I 2C 3C 4C 5C MC 6C"},J:{"1":"A","8":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"8":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:1,C:"Datalist element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dataset.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dataset.js
index 5d85467e591c2e..b89d7d10dd5bab 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dataset.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dataset.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","4":"K F G H A KC"},B:{"1":"C L M I N","129":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","4":"3 LC 0B J NC OC","129":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"RB SB TB UB VB WB XB YB ZB aB","4":"3 J K","129":"0 1 2 4 5 6 7 8 9 F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"4":"3 J PC 7B","129":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"C EB FB GB HB IB JB KB LB MB NB wB IC cC xB","4":"H B YC ZC aC bC","129":"4 5 6 7 8 9 I N D O m n o AB BB CB DB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"4":"7B dC JC","129":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"4":"yC"},I:{"4":"zC 0C 1C","129":"0B J E 2C JC 3C 4C"},J:{"129":"F A"},K:{"1":"C wB IC xB","4":"A B","129":"p"},L:{"129":"E"},M:{"129":"E"},N:{"1":"B","4":"A"},O:{"129":"yB"},P:{"129":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"129":"9B"},R:{"129":"ID"},S:{"1":"JD","129":"KD"}},B:1,C:"dataset & data-* attributes",D:true};
+module.exports={A:{A:{"1":"B","4":"J D E F A NC"},B:{"1":"C K L G M","129":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","4":"4 OC 3B I QC RC","129":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"SB TB UB VB WB XB YB ZB aB bB","4":"4 I J","129":"0 1 2 3 5 6 7 8 9 D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"4":"4 I SC 9B","129":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"C FB GB HB IB JB KB LB MB NB OB yB LC fC zB","4":"F B bC cC dC eC","129":"5 6 7 8 9 G M N O n o p AB BB CB DB EB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"4":"9B gC MC","129":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"4":"1C"},I:{"4":"2C 3C 4C","129":"3B I H 5C MC 6C 7C"},J:{"129":"D A"},K:{"1":"C yB LC zB","4":"A B","129":"q"},L:{"129":"H"},M:{"129":"xB"},N:{"1":"B","4":"A"},O:{"129":"0B"},P:{"129":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"129":"BC"},R:{"129":"KD"},S:{"1":"LD","129":"MD"}},B:1,C:"dataset & data-* attributes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/datauri.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/datauri.js
index 9821b5ab45d001..c75f8bcac32a82 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/datauri.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/datauri.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F KC","132":"G","260":"H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L I N D O","772":"M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"260":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Data URIs",D:true};
+module.exports={A:{A:{"2":"J D NC","132":"E","260":"F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K G M N O","772":"L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"260":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Data URIs",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/date-tolocaledatestring.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/date-tolocaledatestring.js
index 0243e7ce7836de..09114957454bb2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/date-tolocaledatestring.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/date-tolocaledatestring.js
@@ -1 +1 @@
-module.exports={A:{A:{"16":"KC","132":"K F G H A B"},B:{"1":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C L M I N D"},C:{"1":"0 1 2 cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","132":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC","260":"YB ZB aB bB","772":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},D:{"1":"0 1 2 oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 4 5 J K F G H A B C L M I N D O m n o","260":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB","772":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB"},E:{"1":"C L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B","132":"K F G H A QC RC SC TC","260":"B 8B wB"},F:{"1":"dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H B C YC ZC aC bC wB IC cC","132":"xB","260":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB","772":"4 5 6 I N D O m n o"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC","132":"G fC gC hC iC jC kC"},H:{"132":"yC"},I:{"1":"E","16":"0B zC 0C 1C","132":"J 2C JC","772":"3C 4C"},J:{"132":"F A"},K:{"1":"p","16":"A B C wB IC","132":"xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","260":"J 5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","132":"JD"}},B:6,C:"Date.prototype.toLocaleDateString",D:true};
+module.exports={A:{A:{"16":"NC","132":"J D E F A B"},B:{"1":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C K L G M N"},C:{"1":"0 1 2 3 dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","132":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC","260":"ZB aB bB cB","772":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},D:{"1":"0 1 2 3 pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 5 6 I J D E F A B C K L G M N O n o p","260":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB","772":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"C K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B","132":"J D E F A TC UC VC WC","260":"B AC yB"},F:{"1":"eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F B C bC cC dC eC yB LC fC","132":"zB","260":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","772":"5 6 7 G M N O n o p"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC","132":"E iC jC kC lC mC nC"},H:{"132":"1C"},I:{"1":"H","16":"3B 2C 3C 4C","132":"I 5C MC","772":"6C 7C"},J:{"132":"D A"},K:{"1":"q","16":"A B C yB LC","132":"zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","260":"I 8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","132":"LD"}},B:6,C:"Date.prototype.toLocaleDateString",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/declarative-shadow-dom.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/declarative-shadow-dom.js
index c02cf595275d13..09cf8f18f1153c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/declarative-shadow-dom.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/declarative-shadow-dom.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T","66":"U V W X Y"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"1":"uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB YC ZC aC bC wB IC cC xB"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"Declarative Shadow DOM",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T","66":"U V W X Y"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC"},F:{"1":"vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB bC cC dC eC yB LC fC zB"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD GD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"Declarative Shadow DOM",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/decorators.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/decorators.js
index d5e11215d4b70a..bf4f0b32ff2fe9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/decorators.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/decorators.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Decorators",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Decorators",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/details.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/details.js
index 9df50a7bee6c03..3a68fc12a83597 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/details.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/details.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"H A B KC","8":"K F G"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC","8":"3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB NC OC","194":"TB UB"},D:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","8":"3 J K F G H A B","257":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB","769":"C L M I N D O"},E:{"1":"C L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"3 J PC 7B QC","257":"K F G H A RC SC TC","1025":"B 8B wB"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"C wB IC cC xB","8":"H B YC ZC aC bC"},G:{"1":"G D fC gC hC iC jC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"7B dC JC eC","1025":"kC lC mC"},H:{"8":"yC"},I:{"1":"J E 2C JC 3C 4C","8":"0B zC 0C 1C"},J:{"1":"A","8":"F"},K:{"1":"p","8":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Details & Summary elements",D:true};
+module.exports={A:{A:{"2":"F A B NC","8":"J D E"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC","8":"4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB QC RC","194":"UB VB"},D:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","8":"4 I J D E F A B","257":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB","769":"C K L G M N O"},E:{"1":"C K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"4 I SC 9B TC","257":"J D E F A UC VC WC","1025":"B AC yB"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"C yB LC fC zB","8":"F B bC cC dC eC"},G:{"1":"E iC jC kC lC mC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"9B gC MC hC","1025":"nC oC pC"},H:{"8":"1C"},I:{"1":"I H 5C MC 6C 7C","8":"3B 2C 3C 4C"},J:{"1":"A","8":"D"},K:{"1":"q","8":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Details & Summary elements",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/deviceorientation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/deviceorientation.js
index c4f74944f46aa7..bdc511587ec4d5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/deviceorientation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/deviceorientation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","132":"B"},B:{"1":"C L M I N D O","4":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"LC 0B NC","4":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"3 J OC"},D:{"2":"3 J K","4":"0 1 2 4 5 6 7 8 9 F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","4":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"7B dC","4":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"zC 0C 1C","4":"0B J E 2C JC 3C 4C"},J:{"2":"F","4":"A"},K:{"1":"C xB","2":"A B wB IC","4":"p"},L:{"4":"E"},M:{"4":"E"},N:{"1":"B","2":"A"},O:{"4":"yB"},P:{"4":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"4":"9B"},R:{"4":"ID"},S:{"4":"JD KD"}},B:4,C:"DeviceOrientation & DeviceMotion events",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","132":"B"},B:{"1":"C K L G M N O","4":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"OC 3B QC","4":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"4 I RC"},D:{"2":"4 I J","4":"0 1 2 3 5 6 7 8 9 D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","4":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"9B gC","4":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"2C 3C 4C","4":"3B I H 5C MC 6C 7C"},J:{"2":"D","4":"A"},K:{"1":"C zB","2":"A B yB LC","4":"q"},L:{"4":"H"},M:{"4":"xB"},N:{"1":"B","2":"A"},O:{"4":"0B"},P:{"4":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"4":"BC"},R:{"4":"KD"},S:{"4":"LD MD"}},B:4,C:"DeviceOrientation & DeviceMotion events",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/devicepixelratio.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/devicepixelratio.js
index a5f7816cdddd52..e555a49f2b9916 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/devicepixelratio.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/devicepixelratio.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N D NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H B YC ZC aC bC wB IC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"C p xB","2":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Window.devicePixelRatio",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M N QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F B bC cC dC eC yB LC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"C q zB","2":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Window.devicePixelRatio",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dialog.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dialog.js
index 3e833b92bc0845..81033e144eb733 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dialog.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dialog.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB NC OC","194":"ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P","1218":"Q R 3B S T U V W X Y Z a b c d e f g"},D:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB","322":"EB FB GB HB IB"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C I N D O YC ZC aC bC wB IC cC xB","578":"4 5 m n o"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:1,C:"Dialog element",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB QC RC","194":"aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P","1218":"Q R 6B S T U V W X Y Z a b c d e f g"},D:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB","322":"FB GB HB IB JB"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C G M N O bC cC dC eC yB LC fC zB","578":"5 6 n o p"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:1,C:"Dialog element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dispatchevent.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dispatchevent.js
index c406b3bd5a7733..4875d29fd7a4de 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dispatchevent.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dispatchevent.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","16":"KC","129":"H A","130":"K F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","16":"H"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","129":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"EventTarget.dispatchEvent",D:true};
+module.exports={A:{A:{"1":"B","16":"NC","129":"F A","130":"J D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","16":"F"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","129":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"EventTarget.dispatchEvent",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dnssec.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dnssec.js
index d304ff338c9b89..206fadf5b3f159 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dnssec.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dnssec.js
@@ -1 +1 @@
-module.exports={A:{A:{"132":"K F G H A B KC"},B:{"132":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"132":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"132":"0 1 2 3 J DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","388":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB"},E:{"132":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"132":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"132":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"132":"yC"},I:{"132":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"132":"F A"},K:{"132":"A B C p wB IC xB"},L:{"132":"E"},M:{"132":"E"},N:{"132":"A B"},O:{"132":"yB"},P:{"132":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"132":"9B"},R:{"132":"ID"},S:{"132":"JD KD"}},B:6,C:"DNSSEC and DANE",D:true};
+module.exports={A:{A:{"132":"J D E F A B NC"},B:{"132":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"132":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"132":"0 1 2 3 4 I EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","388":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB"},E:{"132":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"132":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"132":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"132":"1C"},I:{"132":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"132":"D A"},K:{"132":"A B C q yB LC zB"},L:{"132":"H"},M:{"132":"xB"},N:{"132":"A B"},O:{"132":"0B"},P:{"132":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"132":"BC"},R:{"132":"KD"},S:{"132":"LD MD"}},B:6,C:"DNSSEC and DANE",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/do-not-track.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/do-not-track.js
index 741c0bdb6f8f8d..1edd60fc84d813 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/do-not-track.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/do-not-track.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","164":"H A","260":"B"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I N"},C:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G NC OC","516":"4 5 6 7 8 9 H A B C L M I N D O m n o AB BB CB DB"},D:{"1":"0 1 2 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m n o"},E:{"1":"K A B C QC TC 8B wB","2":"3 J L M I D PC 7B xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","1028":"F G H RC SC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC"},G:{"1":"iC jC kC lC mC nC oC","2":"D 7B dC JC eC fC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","1028":"G gC hC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"16":"F","1028":"A"},K:{"1":"p xB","16":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"164":"A","260":"B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:7,C:"Do Not Track API",D:true};
+module.exports={A:{A:{"2":"J D E NC","164":"F A","260":"B"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G M"},C:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E QC RC","516":"5 6 7 8 9 F A B C K L G M N O n o p AB BB CB DB EB"},D:{"1":"0 1 2 3 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n o p"},E:{"1":"J A B C TC WC AC yB","2":"4 I K L G SC 9B zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","1028":"D E F UC VC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC"},G:{"1":"lC mC nC oC pC qC rC","2":"9B gC MC hC iC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","1028":"E jC kC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"16":"D","1028":"A"},K:{"1":"q zB","16":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"164":"A","260":"B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:7,C:"Do Not Track API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-currentscript.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-currentscript.js
index c027fcff6e463a..dff1fa35ce4569 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-currentscript.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-currentscript.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB"},E:{"1":"G H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC SC"},F:{"1":"4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C I YC ZC aC bC wB IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"document.currentScript",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB"},E:{"1":"E F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC VC"},F:{"1":"5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C G bC cC dC eC yB LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"document.currentScript",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-evaluate-xpath.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-evaluate-xpath.js
index 8507601df3e577..00ed079909631b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-evaluate-xpath.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-evaluate-xpath.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","16":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","16":"H"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:7,C:"document.evaluate & XPath",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","16":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","16":"F"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:7,C:"document.evaluate & XPath",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-execcommand.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-execcommand.js
index 35fa1edc26f241..7d3142ec3d1723 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-execcommand.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-execcommand.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","16":"H YC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC","16":"JC eC fC"},H:{"2":"yC"},I:{"1":"E 2C JC 3C 4C","2":"0B J zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:7,C:"Document.execCommand()",D:true};
+module.exports={A:{A:{"1":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","16":"F bC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC","16":"MC hC iC"},H:{"2":"1C"},I:{"1":"H 5C MC 6C 7C","2":"3B I 2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:7,C:"Document.execCommand()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-policy.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-policy.js
index 07ff6caf116e9e..cd4aadb8b5e716 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-policy.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-policy.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P Q R S T","132":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T","132":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB YC ZC aC bC wB IC cC xB","132":"pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","132":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","132":"p"},L:{"132":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"132":"ID"},S:{"2":"JD KD"}},B:7,C:"Document Policy",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T","132":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T","132":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB bC cC dC eC yB LC fC zB","132":"qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","132":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","132":"q"},L:{"132":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"132":"KD"},S:{"2":"LD MD"}},B:7,C:"Document Policy",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-scrollingelement.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-scrollingelement.js
index b4395c80c76701..1f6defb551b971 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-scrollingelement.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/document-scrollingelement.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"C L"},C:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB NC OC"},D:{"1":"0 1 2 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"document.scrollingElement",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"C K"},C:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB QC RC"},D:{"1":"0 1 2 3 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"document.scrollingElement",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/documenthead.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/documenthead.js
index 589c8c5e549cd1..0ca2e63d0a4524 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/documenthead.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/documenthead.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","16":"3"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H YC ZC aC bC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"document.head",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","16":"4"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F bC cC dC eC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"document.head",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dom-manip-convenience.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dom-manip-convenience.js
index e54b62129a30f6..ea5f0ff7f1f21c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dom-manip-convenience.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dom-manip-convenience.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB NC OC"},D:{"1":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","194":"YB ZB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB YC ZC aC bC wB IC cC xB","194":"MB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"DOM manipulation convenience methods",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB QC RC"},D:{"1":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","194":"ZB aB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB bC cC dC eC yB LC fC zB","194":"NB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"DOM manipulation convenience methods",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dom-range.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dom-range.js
index a1f42aa33b7732..8d05b5928ef1d2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dom-range.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dom-range.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"KC","8":"K F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Document Object Model Range",D:true};
+module.exports={A:{A:{"1":"F A B","2":"NC","8":"J D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Document Object Model Range",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/domcontentloaded.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/domcontentloaded.js
index 99abbb821353cc..b8f2367143adc5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/domcontentloaded.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/domcontentloaded.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"DOMContentLoaded",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"DOMContentLoaded",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dommatrix.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dommatrix.js
index c10a9b04d229d1..29edd706e14424 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dommatrix.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dommatrix.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","132":"A B"},B:{"132":"C L M I N D O","1028":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB NC OC","1028":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2564":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","3076":"VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB"},D:{"16":"3 J K F","132":"4 5 6 7 8 9 H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB","388":"G","1028":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"16":"J PC 7B","132":"3 K F G H A QC RC SC TC 8B","1028":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB","1028":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"16":"7B dC JC","132":"G eC fC gC hC iC jC kC lC","1028":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"132":"J 2C JC 3C 4C","292":"0B zC 0C 1C","1028":"E"},J:{"16":"F","132":"A"},K:{"2":"A B C wB IC xB","1028":"p"},L:{"1028":"E"},M:{"1028":"E"},N:{"132":"A B"},O:{"1028":"yB"},P:{"132":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1028":"9B"},R:{"1028":"ID"},S:{"1028":"KD","2564":"JD"}},B:4,C:"DOMMatrix",D:true};
+module.exports={A:{A:{"2":"J D E F NC","132":"A B"},B:{"132":"C K L G M N O","1028":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB QC RC","1028":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2564":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","3076":"WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB"},D:{"16":"4 I J D","132":"5 6 7 8 9 F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB","388":"E","1028":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"16":"I SC 9B","132":"4 J D E F A TC UC VC WC AC","1028":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","1028":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"16":"9B gC MC","132":"E hC iC jC kC lC mC nC oC","1028":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"132":"I 5C MC 6C 7C","292":"3B 2C 3C 4C","1028":"H"},J:{"16":"D","132":"A"},K:{"2":"A B C yB LC zB","1028":"q"},L:{"1028":"H"},M:{"1028":"xB"},N:{"132":"A B"},O:{"1028":"0B"},P:{"132":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1028":"BC"},R:{"1028":"KD"},S:{"1028":"MD","2564":"LD"}},B:4,C:"DOMMatrix",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/download.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/download.js
index 1124b112f598a7..29a4224455987b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/download.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/download.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Download attribute",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Download attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dragndrop.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dragndrop.js
index 70379310b49656..14c0dd2797c403 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dragndrop.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/dragndrop.js
@@ -1 +1 @@
-module.exports={A:{A:{"644":"K F G H KC","772":"A B"},B:{"1":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I N D"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","8":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","8":"H B YC ZC aC bC wB IC cC"},G:{"1":"D wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","1025":"E"},J:{"2":"F A"},K:{"1":"xB","8":"A B C wB IC","1025":"p"},L:{"1025":"E"},M:{"2":"E"},N:{"1":"A B"},O:{"1025":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:1,C:"Drag and Drop",D:true};
+module.exports={A:{A:{"644":"J D E F NC","772":"A B"},B:{"1":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G M N"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","8":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","8":"F B bC cC dC eC yB LC fC"},G:{"1":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","1025":"H"},J:{"2":"D A"},K:{"1":"zB","8":"A B C yB LC","1025":"q"},L:{"1025":"H"},M:{"2":"xB"},N:{"1":"A B"},O:{"1025":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:1,C:"Drag and Drop",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-closest.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-closest.js
index 73c1459c1fa618..8f95b6373bca0c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-closest.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-closest.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M"},C:{"1":"0 1 2 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB NC OC"},D:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Element.closest()",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L"},C:{"1":"0 1 2 3 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB QC RC"},D:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Element.closest()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-from-point.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-from-point.js
index 00a2abb9beec17..9802a8e3d060f2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-from-point.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-from-point.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","16":"KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","16":"LC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","16":"H YC ZC aC bC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"C p xB","16":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"document.elementFromPoint()",D:true};
+module.exports={A:{A:{"1":"J D E F A B","16":"NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","16":"OC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","16":"F bC cC dC eC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"C q zB","16":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"document.elementFromPoint()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-scroll-methods.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-scroll-methods.js
index 36f8d6dbe2ab80..66b640a665c527 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-scroll-methods.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/element-scroll-methods.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB NC OC"},D:{"1":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB"},E:{"1":"M I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC","132":"A B C L 8B wB xB 9B"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB YC ZC aC bC wB IC cC xB"},G:{"1":"D vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC","132":"kC lC mC nC oC pC qC rC sC tC uC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Scroll methods on elements (scroll, scrollTo, scrollBy)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB QC RC"},D:{"1":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB"},E:{"1":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC","132":"A B C K AC yB zB BC"},F:{"1":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB bC cC dC eC yB LC fC zB"},G:{"1":"yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC","132":"nC oC pC qC rC sC tC uC vC wC xC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Scroll methods on elements (scroll, scrollTo, scrollBy)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eme.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eme.js
index 8450cf51ea85cb..35a1c0c51d0c8c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eme.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eme.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","164":"B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB NC OC"},D:{"1":"0 1 2 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB","132":"HB IB JB KB LB MB NB"},E:{"1":"C L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC","164":"F G H A B SC TC 8B wB"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n YC ZC aC bC wB IC cC xB","132":"5 6 7 8 9 o AB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Encrypted Media Extensions",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","164":"B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB QC RC"},D:{"1":"0 1 2 3 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB","132":"IB JB KB LB MB NB OB"},E:{"1":"C K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC","164":"D E F A B VC WC AC yB"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o bC cC dC eC yB LC fC zB","132":"6 7 8 9 p AB BB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Encrypted Media Extensions",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eot.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eot.js
index 442f278e4bb071..b349c675f7b20c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eot.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eot.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","2":"KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"EOT - Embedded OpenType fonts",D:true};
+module.exports={A:{A:{"1":"J D E F A B","2":"NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"EOT - Embedded OpenType fonts",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es5.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es5.js
index 145675fee8ed60..c67a68b0a4d640 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es5.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es5.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F KC","260":"H","1026":"G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","4":"LC 0B NC OC","132":"3 4 J K F G H A B C L M I N D O m"},D:{"1":"0 1 2 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"3 J K F G H A B C L M I N D O","132":"4 m n o"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","4":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","4":"H B C YC ZC aC bC wB IC cC","132":"xB"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","4":"7B dC JC eC"},H:{"132":"yC"},I:{"1":"E 3C 4C","4":"0B zC 0C 1C","132":"2C JC","900":"J"},J:{"1":"A","4":"F"},K:{"1":"p","4":"A B C wB IC","132":"xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"ECMAScript 5",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D NC","260":"F","1026":"E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","4":"OC 3B QC RC","132":"4 5 I J D E F A B C K L G M N O n"},D:{"1":"0 1 2 3 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"4 I J D E F A B C K L G M N O","132":"5 n o p"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","4":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","4":"F B C bC cC dC eC yB LC fC","132":"zB"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","4":"9B gC MC hC"},H:{"132":"1C"},I:{"1":"H 6C 7C","4":"3B 2C 3C 4C","132":"5C MC","900":"I"},J:{"1":"A","4":"D"},K:{"1":"q","4":"A B C yB LC","132":"zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"ECMAScript 5",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-class.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-class.js
index 9a7a6636366bbc..6c48045e11c951 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-class.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-class.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB","132":"OB PB QB RB SB TB UB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB YC ZC aC bC wB IC cC xB","132":"BB CB DB EB FB GB HB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"ES6 classes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","132":"PB QB RB SB TB UB VB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB bC cC dC eC yB LC fC zB","132":"CB DB EB FB GB HB IB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"ES6 classes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-generators.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-generators.js
index 93e4a9c6f094da..ab5d2ce6771744 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-generators.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-generators.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"ES6 Generators",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"ES6 Generators",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-module-dynamic-import.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-module-dynamic-import.js
index 813b51c3fbcd50..2497ebba0ac243 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-module-dynamic-import.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-module-dynamic-import.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB NC OC","194":"kB"},D:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"JavaScript modules: dynamic import()",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB QC RC","194":"lB"},D:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"JavaScript modules: dynamic import()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-module.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-module.js
index 0a5f0b21543489..22b2dfa300902e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-module.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-module.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M","2049":"N D O","2242":"I"},C:{"1":"0 1 2 fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB NC OC","322":"aB bB cB dB eB 1B"},D:{"1":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B","194":"fB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC","1540":"8B"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB YC ZC aC bC wB IC cC xB","194":"TB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC","1540":"lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"JavaScript modules via script tag",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L","2049":"M N O","2242":"G"},C:{"1":"0 1 2 3 gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB QC RC","322":"bB cB dB eB fB 4B"},D:{"1":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B","194":"gB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC","1540":"AC"},F:{"1":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB bC cC dC eC yB LC fC zB","194":"UB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC","1540":"oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"JavaScript modules via script tag",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-number.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-number.js
index 8bb463f6eec602..97e7fc7ce27e4a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-number.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-number.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I NC OC","132":"4 5 6 N D O m n o","260":"7 8 9 AB BB CB","516":"DB"},D:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I N D O","1028":"4 5 6 7 8 9 m n o AB BB CB DB EB FB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","1028":"4 I N D O m"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C","1028":"2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"ES6 Number",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G QC RC","132":"5 6 7 M N O n o p","260":"8 9 AB BB CB DB","516":"EB"},D:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G M N O","1028":"5 6 7 8 9 n o p AB BB CB DB EB FB GB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","1028":"5 G M N O n"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C","1028":"5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"ES6 Number",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-string-includes.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-string-includes.js
index edb30e472e9fe5..094edf8af30f73 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-string-includes.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6-string-includes.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB NC OC"},D:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"String.prototype.includes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB QC RC"},D:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"String.prototype.includes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6.js
index 2a2f67e2f81a78..6d09561b78b09f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/es6.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","388":"B"},B:{"257":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M","769":"I N D O"},C:{"2":"3 LC 0B J NC OC","4":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","257":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 J K F G H A B C L M I N D O m","4":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","257":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC","4":"G H SC TC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","4":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB","257":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC","4":"G gC hC iC jC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","4":"3C 4C","257":"E"},J:{"2":"F","4":"A"},K:{"2":"A B C wB IC xB","257":"p"},L:{"257":"E"},M:{"257":"E"},N:{"2":"A","388":"B"},O:{"257":"yB"},P:{"4":"J","257":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"257":"9B"},R:{"257":"ID"},S:{"4":"JD","257":"KD"}},B:6,C:"ECMAScript 2015 (ES6)",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","388":"B"},B:{"257":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L","769":"G M N O"},C:{"2":"4 OC 3B I QC RC","4":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","257":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 I J D E F A B C K L G M N O n","4":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","257":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC","4":"E F VC WC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","4":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB","257":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC","4":"E jC kC lC mC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","4":"6C 7C","257":"H"},J:{"2":"D","4":"A"},K:{"2":"A B C yB LC zB","257":"q"},L:{"257":"H"},M:{"257":"xB"},N:{"2":"A","388":"B"},O:{"257":"0B"},P:{"4":"I","257":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"257":"BC"},R:{"257":"KD"},S:{"4":"LD","257":"MD"}},B:6,C:"ECMAScript 2015 (ES6)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eventsource.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eventsource.js
index 57e94c3d431e51..4d94540f99cb72 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eventsource.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/eventsource.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","4":"H YC ZC aC bC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"F A"},K:{"1":"C p wB IC xB","4":"A B"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Server-sent events",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","4":"F bC cC dC eC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"D A"},K:{"1":"C q yB LC zB","4":"A B"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Server-sent events",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/extended-system-fonts.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/extended-system-fonts.js
index 862776d0e923b1..539f956ae1dbc8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/extended-system-fonts.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/extended-system-fonts.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"ui-serif, ui-sans-serif, ui-monospace and ui-rounded values for font-family",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"ui-serif, ui-sans-serif, ui-monospace and ui-rounded values for font-family",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/feature-policy.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/feature-policy.js
index 00d6c23322e44b..385d1160179b69 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/feature-policy.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/feature-policy.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"P Q R S T U V W","2":"C L M I N D O","1025":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p NC OC","260":"0 1 2 rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"rB sB tB uB vB P Q R S T U V W","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B","132":"fB 2B gB hB iB jB kB lB mB nB oB pB qB p","1025":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B PC 7B QC RC SC TC 8B","772":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"gB hB iB jB kB lB mB nB oB pB qB p rB","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB YC ZC aC bC wB IC cC xB","132":"TB UB VB WB XB YB ZB aB bB cB dB eB fB","1025":"sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC","772":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","1025":"p"},L:{"1025":"E"},M:{"260":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C","132":"8C 9C 8B"},Q:{"132":"9B"},R:{"1025":"ID"},S:{"2":"JD","260":"KD"}},B:7,C:"Feature Policy",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"P Q R S T U V W","2":"C K L G M N O","1025":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q QC RC","260":"0 1 2 3 sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"sB tB uB vB wB P Q R S T U V W","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B","132":"gB 5B hB iB jB kB lB mB nB oB pB qB rB q","1025":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B SC 9B TC UC VC WC AC","772":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"hB iB jB kB lB mB nB oB pB qB rB q sB","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB bC cC dC eC yB LC fC zB","132":"UB VB WB XB YB ZB aB bB cB dB eB fB gB","1025":"tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC","772":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","1025":"q"},L:{"1025":"H"},M:{"260":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD","132":"BD CD AC"},Q:{"132":"BC"},R:{"1025":"KD"},S:{"2":"LD","260":"MD"}},B:7,C:"Feature Policy",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fetch.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fetch.js
index b4d1dc14a18a47..7591bb55cb23a0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fetch.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fetch.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB NC OC","1025":"LB","1218":"GB HB IB JB KB"},D:{"1":"0 1 2 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB","260":"MB","772":"NB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 H B C I N D O m n o YC ZC aC bC wB IC cC xB","260":"9","772":"AB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Fetch",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB QC RC","1025":"MB","1218":"HB IB JB KB LB"},D:{"1":"0 1 2 3 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB","260":"NB","772":"OB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p bC cC dC eC yB LC fC zB","260":"AB","772":"BB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Fetch",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fieldset-disabled.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fieldset-disabled.js
index 7829a1a58be91c..b8e88decebc8f8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fieldset-disabled.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fieldset-disabled.js
@@ -1 +1 @@
-module.exports={A:{A:{"16":"KC","132":"G H","388":"K F A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I","16":"4 N D O"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","16":"H YC"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC"},H:{"388":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A","260":"B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"disabled attribute of the fieldset element",D:true};
+module.exports={A:{A:{"16":"NC","132":"E F","388":"J D A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G","16":"5 M N O"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","16":"F bC"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC"},H:{"388":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A","260":"B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"disabled attribute of the fieldset element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fileapi.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fileapi.js
index 9c714690504cc5..907050bcd3efec 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fileapi.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fileapi.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","260":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I N D O"},C:{"1":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC","260":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o OC"},D:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J","260":"4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB","388":"K F G H A B C"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B","260":"K F G H RC SC TC","388":"QC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B YC ZC aC bC","260":"4 5 6 C I N D O m n o wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","260":"G fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E 4C","2":"zC 0C 1C","260":"3C","388":"0B J 2C JC"},J:{"260":"A","388":"F"},K:{"1":"p","2":"A B","260":"C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A","260":"B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"File API",D:true};
+module.exports={A:{A:{"2":"J D E F NC","260":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G M N O"},C:{"1":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC","260":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB RC"},D:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I","260":"5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB","388":"J D E F A B C"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B","260":"J D E F UC VC WC","388":"TC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B bC cC dC eC","260":"5 6 7 C G M N O n o p yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","260":"E iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H 7C","2":"2C 3C 4C","260":"6C","388":"3B I 5C MC"},J:{"260":"A","388":"D"},K:{"1":"q","2":"A B","260":"C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A","260":"B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"File API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filereader.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filereader.js
index 1c33785602fd60..408f5f6898214f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filereader.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filereader.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","132":"A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","2":"LC 0B NC"},D:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H B YC ZC aC bC"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"C p wB IC xB","2":"A B"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"FileReader API",D:true};
+module.exports={A:{A:{"2":"J D E F NC","132":"A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","2":"OC 3B QC"},D:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F B bC cC dC eC"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"C q yB LC zB","2":"A B"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"FileReader API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filereadersync.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filereadersync.js
index 5533d201df1718..82e86ddb846add 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filereadersync.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filereadersync.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H YC ZC","16":"B aC bC wB IC"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"C p IC xB","2":"A","16":"B wB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"FileReaderSync",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F bC cC","16":"B dC eC yB LC"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"C q LC zB","2":"A","16":"B yB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"FileReaderSync",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filesystem.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filesystem.js
index 51ada534b5352f..b2e97cfbec99a3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filesystem.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/filesystem.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 J K F","33":"0 1 2 4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","36":"G H A B C"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","33":"A"},K:{"2":"A B C wB IC xB","33":"p"},L:{"33":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"33":"yB"},P:{"2":"J","33":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"33":"ID"},S:{"2":"JD KD"}},B:7,C:"Filesystem & FileWriter API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 I J D","33":"0 1 2 3 5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","36":"E F A B C"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","33":"A"},K:{"2":"A B C yB LC zB","33":"q"},L:{"33":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"33":"0B"},P:{"2":"I","33":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"33":"KD"},S:{"2":"LD MD"}},B:7,C:"Filesystem & FileWriter API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flac.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flac.js
index a12463f46414cc..163b8c408c4791 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flac.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flac.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB NC OC"},D:{"1":"0 1 2 cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","16":"QB RB SB","388":"TB UB VB WB XB YB ZB aB bB"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","516":"B C wB xB"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"zC 0C 1C","16":"0B J 2C JC 3C 4C"},J:{"1":"A","2":"F"},K:{"1":"p xB","16":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","129":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"FLAC audio format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB QC RC"},D:{"1":"0 1 2 3 dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB","16":"RB SB TB","388":"UB VB WB XB YB ZB aB bB cB"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","516":"B C yB zB"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"2C 3C 4C","16":"3B I 5C MC 6C 7C"},J:{"1":"A","2":"D"},K:{"1":"q zB","16":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","129":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"FLAC audio format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flexbox-gap.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flexbox-gap.js
index 2f63e2349252cd..f082515f73b43e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flexbox-gap.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flexbox-gap.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S"},C:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB NC OC"},D:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S"},E:{"1":"I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B"},F:{"1":"oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB YC ZC aC bC wB IC cC xB"},G:{"1":"D vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"gap property for Flexbox",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S"},C:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB QC RC"},D:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S"},E:{"1":"G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC"},F:{"1":"pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB bC cC dC eC yB LC fC zB"},G:{"1":"yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"gap property for Flexbox",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flexbox.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flexbox.js
index 9e5e5e8872be2c..fd4570beaee47a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flexbox.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flexbox.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","1028":"B","1316":"A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","164":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC","516":"5 6 7 8 9 o"},D:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"5 6 7 8 9 n o AB","164":"3 4 J K F G H A B C L M I N D O m"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"F G RC SC","164":"3 J K PC 7B QC"},F:{"1":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B C YC ZC aC bC wB IC cC","33":"I N"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"G gC hC","164":"7B dC JC eC fC"},H:{"1":"yC"},I:{"1":"E 3C 4C","164":"0B J zC 0C 1C 2C JC"},J:{"1":"A","164":"F"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","292":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS Flexible Box Layout Module",D:true};
+module.exports={A:{A:{"2":"J D E F NC","1028":"B","1316":"A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","164":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC","516":"6 7 8 9 p AB"},D:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"6 7 8 9 o p AB BB","164":"4 5 I J D E F A B C K L G M N O n"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"D E UC VC","164":"4 I J SC 9B TC"},F:{"1":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B C bC cC dC eC yB LC fC","33":"G M"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"E jC kC","164":"9B gC MC hC iC"},H:{"1":"1C"},I:{"1":"H 6C 7C","164":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","164":"D"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","292":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS Flexible Box Layout Module",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flow-root.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flow-root.js
index 0c842a7bd16c37..eb72fa53408c19 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flow-root.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/flow-root.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB NC OC"},D:{"1":"0 1 2 eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB xB"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB YC ZC aC bC wB IC cC xB"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"display: flow-root",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB QC RC"},D:{"1":"0 1 2 3 fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB zB"},F:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB bC cC dC eC yB LC fC zB"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"display: flow-root",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/focusin-focusout-events.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/focusin-focusout-events.js
index ac48a889a6c186..da707f1db861b1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/focusin-focusout-events.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/focusin-focusout-events.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","2":"KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H YC ZC aC bC","16":"B wB IC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"J E 2C JC 3C 4C","2":"zC 0C 1C","16":"0B"},J:{"1":"F A"},K:{"1":"C p xB","2":"A","16":"B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"focusin & focusout events",D:true};
+module.exports={A:{A:{"1":"J D E F A B","2":"NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F bC cC dC eC","16":"B yB LC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"I H 5C MC 6C 7C","2":"2C 3C 4C","16":"3B"},J:{"1":"D A"},K:{"1":"C q zB","2":"A","16":"B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"focusin & focusout events",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-family-system-ui.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-family-system-ui.js
index da5d29b17e57c1..246c2608497593 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-family-system-ui.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-family-system-ui.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB NC OC","132":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a"},D:{"1":"0 1 2 cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","260":"ZB aB bB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC","16":"H","132":"A TC 8B"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC","132":"iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"132":"JD KD"}},B:5,C:"system-ui value for font-family",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QC RC","132":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a"},D:{"1":"0 1 2 3 dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","260":"aB bB cB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC","16":"F","132":"A WC AC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC","132":"lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"132":"LD MD"}},B:5,C:"system-ui value for font-family",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-feature.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-feature.js
index ec2a3f254e2eeb..83d294fc158a47 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-feature.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-feature.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB","164":"3 J K F G H A B C L M"},D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I","33":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB","292":"4 N D O m"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"F G H PC 7B RC SC","4":"3 J K QC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G gC hC iC","4":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","33":"3C 4C"},J:{"2":"F","33":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","33":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS font-feature-settings",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB","164":"4 I J D E F A B C K L"},D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G","33":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","292":"5 M N O n"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"D E F SC 9B UC VC","4":"4 I J TC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E jC kC lC","4":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","33":"6C 7C"},J:{"2":"D","33":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","33":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS font-feature-settings",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-kerning.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-kerning.js
index 4f0d9bb036fb7d..09bc759e1ad0e3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-kerning.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-kerning.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 LC 0B J K F G H A B C L M I N D O m n o NC OC","194":"6 7 8 9 AB BB CB DB EB FB"},D:{"1":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB","33":"BB CB DB EB"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC","33":"F G H SC"},F:{"1":"5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C I YC ZC aC bC wB IC cC xB","33":"4 N D O"},G:{"1":"D oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","33":"G hC iC jC kC lC mC nC"},H:{"2":"yC"},I:{"1":"E 4C","2":"0B J zC 0C 1C 2C JC","33":"3C"},J:{"2":"F","33":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 font-kerning",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 OC 3B I J D E F A B C K L G M N O n o p QC RC","194":"7 8 9 AB BB CB DB EB FB GB"},D:{"1":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB","33":"CB DB EB FB"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC","33":"D E F VC"},F:{"1":"6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C G bC cC dC eC yB LC fC zB","33":"5 M N O"},G:{"1":"rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","33":"E kC lC mC nC oC pC qC"},H:{"2":"1C"},I:{"1":"H 7C","2":"3B I 2C 3C 4C 5C MC","33":"6C"},J:{"2":"D","33":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 font-kerning",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-loading.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-loading.js
index 3fc1dfe081d61d..9d2dca2a995931 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-loading.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-loading.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB NC OC","194":"HB IB JB KB LB MB"},D:{"1":"0 1 2 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"CSS Font Loading",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB QC RC","194":"IB JB KB LB MB NB"},D:{"1":"0 1 2 3 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"CSS Font Loading",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-size-adjust.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-size-adjust.js
index f79071b43b1b70..b9f0e9fabe00a3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-size-adjust.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-size-adjust.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","194":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","194":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB YC ZC aC bC wB IC cC xB","194":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"194":"9B"},R:{"2":"ID"},S:{"1":"KD","2":"JD"}},B:2,C:"CSS font-size-adjust",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","194":"H","962":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z"},C:{"1":"xB 7B 8B PC","2":"OC","516":"0 1 2 3 b c d e f g h i j k l m r s t u v w x y z H","772":"4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","194":"8B","962":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B"},E:{"1":"2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC","772":"HC IC JC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB bC cC dC eC yB LC fC zB","194":"l m","962":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k"},G:{"1":"2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC","772":"HC IC JC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"194":"BC"},R:{"2":"KD"},S:{"2":"LD","516":"MD"}},B:2,C:"CSS font-size-adjust",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-smooth.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-smooth.js
index 92c008fa3d50b2..c340ccbebc7fa8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-smooth.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-smooth.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","676":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 LC 0B J K F G H A B C L M I N D O m n o NC OC","804":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"J","676":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"PC 7B","676":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","676":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"804":"JD KD"}},B:7,C:"CSS font-smooth",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","676":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 OC 3B I J D E F A B C K L G M N O n o p QC RC","804":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"I","676":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"SC 9B","676":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","676":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"804":"LD MD"}},B:7,C:"CSS font-smooth",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-unicode-range.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-unicode-range.js
index bb2805d2fae595..da4322094194c9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-unicode-range.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-unicode-range.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","4":"H A B"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","4":"C L M I N"},C:{"1":"0 1 2 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB NC OC","194":"IB JB KB LB MB NB OB PB"},D:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","4":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","4":"4 I N D O m n o"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","4":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","4":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","4":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"4":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","4":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Font unicode-range subsetting",D:true};
+module.exports={A:{A:{"2":"J D E NC","4":"F A B"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","4":"C K L G M"},C:{"1":"0 1 2 3 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB QC RC","194":"JB KB LB MB NB OB PB QB"},D:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","4":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","4":"5 G M N O n o p"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","4":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","4":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","4":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"4":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","4":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Font unicode-range subsetting",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-variant-alternates.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-variant-alternates.js
index 0f20e3565bba80..cf4de860f582a7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-variant-alternates.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-variant-alternates.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","130":"A B"},B:{"1":"0 1 2 y z E","130":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x"},C:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","130":"3 4 5 J K F G H A B C L M I N D O m n o","322":"6 7 8 9 AB BB CB DB EB FB"},D:{"1":"0 1 2 y z E 4B 5B 6B","2":"3 J K F G H A B C L M I","130":"4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"F G H PC 7B RC SC","130":"3 J K QC"},F:{"1":"h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","130":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B gC hC iC","130":"dC JC eC fC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","130":"3C 4C"},J:{"2":"F","130":"A"},K:{"2":"A B C wB IC xB","130":"p"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"130":"yB"},P:{"1":"o","130":"J m n 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"130":"9B"},R:{"130":"ID"},S:{"1":"JD KD"}},B:5,C:"CSS font-variant-alternates",D:true};
+module.exports={A:{A:{"2":"J D E F NC","130":"A B"},B:{"1":"0 1 2 3 y z H","130":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x"},C:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","130":"4 5 6 I J D E F A B C K L G M N O n o p","322":"7 8 9 AB BB CB DB EB FB GB"},D:{"1":"0 1 2 3 y z H xB 7B 8B","2":"4 I J D E F A B C K L G","130":"5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"D E F SC 9B UC VC","130":"4 I J TC"},F:{"1":"h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","130":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B jC kC lC","130":"gC MC hC iC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","130":"6C 7C"},J:{"2":"D","130":"A"},K:{"2":"A B C yB LC zB","130":"q"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"130":"0B"},P:{"1":"p","130":"I n o 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"130":"BC"},R:{"130":"KD"},S:{"1":"LD MD"}},B:5,C:"CSS font-variant-alternates",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-variant-numeric.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-variant-numeric.js
index dbedfaa2640e4b..2b7dcd0772907f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-variant-numeric.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/font-variant-numeric.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB NC OC"},D:{"1":"0 1 2 YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC"},F:{"1":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB YC ZC aC bC wB IC cC xB"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","16":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS font-variant-numeric",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB QC RC"},D:{"1":"0 1 2 3 ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC"},F:{"1":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB bC cC dC eC yB LC fC zB"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","16":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS font-variant-numeric",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fontface.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fontface.js
index 785375b729f483..61d5490aa02272 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fontface.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fontface.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","132":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","2":"H YC"},G:{"1":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","260":"7B dC"},H:{"2":"yC"},I:{"1":"J E 2C JC 3C 4C","2":"zC","4":"0B 0C 1C"},J:{"1":"A","4":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"@font-face Web fonts",D:true};
+module.exports={A:{A:{"1":"F A B","132":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","2":"F bC"},G:{"1":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","260":"9B gC"},H:{"2":"1C"},I:{"1":"I H 5C MC 6C 7C","2":"2C","4":"3B 3C 4C"},J:{"1":"A","4":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"@font-face Web fonts",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-attribute.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-attribute.js
index 995f52bffb93fb..bd5238ed2b2d01 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-attribute.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-attribute.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","16":"3"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"1":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Form attribute",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","16":"4"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"1":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Form attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-submit-attributes.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-submit-attributes.js
index 49c736db53516c..19d45fd42b5030 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-submit-attributes.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-submit-attributes.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","2":"H YC","16":"ZC aC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"1":"yC"},I:{"1":"J E 2C JC 3C 4C","2":"zC 0C 1C","16":"0B"},J:{"1":"A","2":"F"},K:{"1":"B C p wB IC xB","16":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Attributes for form submission",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","2":"F bC","16":"cC dC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"1":"1C"},I:{"1":"I H 5C MC 6C 7C","2":"2C 3C 4C","16":"3B"},J:{"1":"A","2":"D"},K:{"1":"B C q yB LC zB","16":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Attributes for form submission",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-validation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-validation.js
index 4f150cd1991dc5..7c367bb0d2d903 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-validation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/form-validation.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","132":"3 K F G H A QC RC SC TC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","2":"H YC"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B","132":"G dC JC eC fC gC hC iC jC kC"},H:{"516":"yC"},I:{"1":"E 4C","2":"0B zC 0C 1C","132":"J 2C JC 3C"},J:{"1":"A","132":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"260":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","132":"JD"}},B:1,C:"Form validation",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","132":"4 J D E F A TC UC VC WC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","2":"F bC"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B","132":"E gC MC hC iC jC kC lC mC nC"},H:{"516":"1C"},I:{"1":"H 7C","2":"3B 2C 3C 4C","132":"I 5C MC 6C"},J:{"1":"A","132":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"260":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","132":"LD"}},B:1,C:"Form validation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/forms.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/forms.js
index 1b84fe028a6eed..eb4bb8b72caa0a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/forms.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/forms.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","4":"A B","8":"K F G H"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","4":"C L M I"},C:{"4":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"LC 0B NC OC"},D:{"1":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB"},E:{"4":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"PC 7B"},F:{"1":"H B C YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","4":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},G:{"2":"7B","4":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","4":"3C 4C"},J:{"2":"F","4":"A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"4":"E"},N:{"4":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","4":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"4":"JD KD"}},B:1,C:"HTML5 form features",D:false};
+module.exports={A:{A:{"2":"NC","4":"A B","8":"J D E F"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","4":"C K L G"},C:{"4":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"OC 3B QC RC"},D:{"1":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB"},E:{"4":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"SC 9B"},F:{"1":"F B C ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","4":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},G:{"2":"9B","4":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","4":"6C 7C"},J:{"2":"D","4":"A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"4":"xB"},N:{"4":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","4":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"4":"LD MD"}},B:1,C:"HTML5 form features",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fullscreen.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fullscreen.js
index 8bdeaab2514f9d..dd3cb1708bff1d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fullscreen.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/fullscreen.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","548":"B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","516":"C L M I N D O"},C:{"1":"0 1 2 iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H NC OC","676":"4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB","1700":"TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB"},D:{"1":"0 1 2 pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M","676":"4 I N D O","804":"5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB"},E:{"1":"D FC GC HC XC","2":"3 J PC 7B","548":"BC yB WC zB CC DC EC","676":"QC","804":"K F G H A B C L M I RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B C YC ZC aC bC wB IC cC","804":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC","2052":"D oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","292":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A","548":"B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","804":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Full Screen API",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","548":"B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","516":"C K L G M N O"},C:{"1":"0 1 2 3 jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F QC RC","676":"5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB","1700":"UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB"},D:{"1":"0 1 2 3 qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L","676":"5 G M N O","804":"6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB"},E:{"1":"HC IC JC 2B KC aC","2":"4 I SC 9B","548":"DC 0B ZC 1B EC FC GC","676":"TC","804":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B C bC cC dC eC yB LC fC","804":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC","2052":"rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","292":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A","548":"B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","804":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Full Screen API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/gamepad.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/gamepad.js
index e9ada9ef4f518e..ce5b950b962dc0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/gamepad.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/gamepad.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC"},D:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m","33":"5 6 n o"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"Gamepad API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC"},D:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n","33":"6 7 o p"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"Gamepad API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/geolocation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/geolocation.js
index 51a1dfac92653e..9f49543972a740 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/geolocation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/geolocation.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"KC","8":"K F G"},B:{"1":"C L M I N D O","129":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB NC OC","8":"LC 0B","129":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","4":"J","129":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"J PC 7B","129":"A"},F:{"1":"4 5 6 7 8 9 B C N D O m n o AB BB CB DB EB FB GB HB IB JB KB bC wB IC cC xB","2":"H I YC","8":"ZC aC","129":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"G 7B dC JC eC fC gC hC iC jC","129":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J zC 0C 1C 2C JC 3C 4C","129":"E"},J:{"1":"F A"},K:{"1":"B C wB IC xB","8":"A","129":"p"},L:{"129":"E"},M:{"129":"E"},N:{"1":"A B"},O:{"129":"yB"},P:{"1":"J","129":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"129":"9B"},R:{"129":"ID"},S:{"1":"JD","129":"KD"}},B:2,C:"Geolocation",D:true};
+module.exports={A:{A:{"1":"F A B","2":"NC","8":"J D E"},B:{"1":"C K L G M N O","129":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB QC RC","8":"OC 3B","129":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","4":"I","129":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"I SC 9B","129":"A"},F:{"1":"5 6 7 8 9 B C M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB eC yB LC fC zB","2":"F G bC","8":"cC dC","129":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"E 9B gC MC hC iC jC kC lC mC","129":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I 2C 3C 4C 5C MC 6C 7C","129":"H"},J:{"1":"D A"},K:{"1":"B C yB LC zB","8":"A","129":"q"},L:{"129":"H"},M:{"129":"xB"},N:{"1":"A B"},O:{"129":"0B"},P:{"1":"I","129":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"129":"BC"},R:{"129":"KD"},S:{"1":"LD","129":"MD"}},B:2,C:"Geolocation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getboundingclientrect.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getboundingclientrect.js
index 2a325b88f8e253..6d5b7eb4affe20 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getboundingclientrect.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getboundingclientrect.js
@@ -1 +1 @@
-module.exports={A:{A:{"644":"K F KC","2049":"H A B","2692":"G"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2049":"C L M I N D O"},C:{"1":"0 1 2 4 5 6 7 8 9 C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC","260":"3 J K F G H A B","1156":"0B","1284":"NC","1796":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","16":"H YC","132":"ZC aC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","132":"A"},L:{"1":"E"},M:{"1":"E"},N:{"2049":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Element.getBoundingClientRect()",D:true};
+module.exports={A:{A:{"644":"J D NC","2049":"F A B","2692":"E"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2049":"C K L G M N O"},C:{"1":"0 1 2 3 5 6 7 8 9 C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC","260":"4 I J D E F A B","1156":"3B","1284":"QC","1796":"RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","16":"F bC","132":"cC dC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","132":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"2049":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Element.getBoundingClientRect()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getcomputedstyle.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getcomputedstyle.js
index 317c276b8fa039..b221a7e6931201 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getcomputedstyle.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getcomputedstyle.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC","132":"0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","260":"3 J K F G H A"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","260":"J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","260":"H YC ZC aC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","260":"7B dC JC"},H:{"260":"yC"},I:{"1":"J E 2C JC 3C 4C","260":"0B zC 0C 1C"},J:{"1":"A","260":"F"},K:{"1":"B C p wB IC xB","260":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"getComputedStyle",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC","132":"3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","260":"4 I J D E F A"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","260":"I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","260":"F bC cC dC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","260":"9B gC MC"},H:{"260":"1C"},I:{"1":"I H 5C MC 6C 7C","260":"3B 2C 3C 4C"},J:{"1":"A","260":"D"},K:{"1":"B C q yB LC zB","260":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"getComputedStyle",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getelementsbyclassname.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getelementsbyclassname.js
index a77cbb1bcf0f5b..1354ceda914c46 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getelementsbyclassname.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getelementsbyclassname.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"KC","8":"K F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","8":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"getElementsByClassName",D:true};
+module.exports={A:{A:{"1":"F A B","2":"NC","8":"J D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","8":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"getElementsByClassName",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getrandomvalues.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getrandomvalues.js
index c93042a69ed1a2..c506550df48a48 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getrandomvalues.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/getrandomvalues.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","33":"B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A","33":"B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"crypto.getRandomValues()",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","33":"B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A","33":"B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"crypto.getRandomValues()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/gyroscope.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/gyroscope.js
index 0f9be9455bd7ba..42e5ec0b83ff2e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/gyroscope.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/gyroscope.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","194":"eB 1B fB 2B gB hB iB jB kB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:4,C:"Gyroscope",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","194":"fB 4B gB 5B hB iB jB kB lB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:4,C:"Gyroscope",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hardwareconcurrency.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hardwareconcurrency.js
index df4f21e3945a2f..0b5a73adb4bea0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hardwareconcurrency.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hardwareconcurrency.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M"},C:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB NC OC"},D:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB"},E:{"2":"3 J K F PC 7B QC RC SC","129":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","194":"G H A TC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"2":"7B dC JC eC fC gC","129":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","194":"G hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"navigator.hardwareConcurrency",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L"},C:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB QC RC"},D:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB"},E:{"2":"4 I J D SC 9B TC UC VC","129":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","194":"E F A WC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"2":"9B gC MC hC iC jC","129":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","194":"E kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"navigator.hardwareConcurrency",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hashchange.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hashchange.js
index e762bde3965108..0718e79852c0bb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hashchange.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hashchange.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","8":"K F KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","8":"LC 0B NC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","8":"J"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","8":"H YC ZC aC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B"},H:{"2":"yC"},I:{"1":"0B J E 0C 1C 2C JC 3C 4C","2":"zC"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","8":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Hashchange event",D:true};
+module.exports={A:{A:{"1":"E F A B","8":"J D NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","8":"OC 3B QC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","8":"I"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","8":"F bC cC dC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B"},H:{"2":"1C"},I:{"1":"3B I H 3C 4C 5C MC 6C 7C","2":"2C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","8":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Hashchange event",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/heif.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/heif.js
index 853eb7d3c91a88..4785315bd10f35 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/heif.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/heif.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"D XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","130":"B C L M I wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D","2":"G 7B dC JC eC fC gC hC iC jC kC lC HC","130":"mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"HEIF/HEIC image format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","130":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC JC","130":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"HEIF/HEIC image format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hevc.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hevc.js
index 4da89c410842bc..60ce8a0ce71fc3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hevc.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hevc.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","132":"B"},B:{"132":"C L M I N D O","1028":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t","2052":"0 1 2 u v w x y z E 4B 5B 6B"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","516":"B C wB xB"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c YC ZC aC bC wB IC cC xB","2052":"d e f g h i j k l"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","2052":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","258":"p"},L:{"2052":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"n o","2":"J","258":"m 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:6,C:"HEVC/H.265 video format",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","132":"B"},B:{"132":"C K L G M N O","1028":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t","2052":"0 1 2 3 u v w x y z H xB 7B 8B"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","516":"B C yB zB"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c bC cC dC eC yB LC fC zB","2052":"d e f g h i j k l m"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","2052":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","258":"q"},L:{"2052":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"o p","2":"I","258":"n 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:6,C:"HEVC/H.265 video format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hidden.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hidden.js
index aeb80024a2a158..5f9a7be724453e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hidden.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/hidden.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H B YC ZC aC bC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"1":"yC"},I:{"1":"J E 2C JC 3C 4C","2":"0B zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"C p wB IC xB","2":"A B"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"hidden attribute",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F B bC cC dC eC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"1":"1C"},I:{"1":"I H 5C MC 6C 7C","2":"3B 2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"C q yB LC zB","2":"A B"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"hidden attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/high-resolution-time.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/high-resolution-time.js
index 0a21db5724299e..3a59f56edc1af1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/high-resolution-time.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/high-resolution-time.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","2":"3 LC 0B J K F G H A B C L M NC OC","129":"bB cB dB","769":"eB 1B","1281":"0 1 2 fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O","33":"5 m n o"},E:{"1":"G H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC SC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"High Resolution Time API",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB","2":"4 OC 3B I J D E F A B C K L QC RC","129":"cB dB eB","769":"fB 4B","1281":"0 1 2 3 gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O","33":"6 n o p"},E:{"1":"E F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC VC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"High Resolution Time API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/history.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/history.js
index 9ad3fe56bc9a18..37e4d26ba39805 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/history.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/history.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","4":"3 QC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l IC cC xB","2":"H B YC ZC aC bC wB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC","4":"JC"},H:{"2":"yC"},I:{"1":"E 0C 1C JC 3C 4C","2":"0B J zC 2C"},J:{"1":"F A"},K:{"1":"C p wB IC xB","2":"A B"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Session history management",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","4":"4 TC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m LC fC zB","2":"F B bC cC dC eC yB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC","4":"MC"},H:{"2":"1C"},I:{"1":"H 3C 4C MC 6C 7C","2":"3B I 2C 5C"},J:{"1":"D A"},K:{"1":"C q yB LC zB","2":"A B"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Session history management",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/html-media-capture.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/html-media-capture.js
index fa8cf17096e6b4..f84277c96a6ac5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/html-media-capture.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/html-media-capture.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"7B dC JC eC","129":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC","257":"0C 1C"},J:{"1":"A","16":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"516":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"16":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:2,C:"HTML Media Capture",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"9B gC MC hC","129":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C","257":"3C 4C"},J:{"1":"A","16":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"516":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"16":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:2,C:"HTML Media Capture",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/html5semantic.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/html5semantic.js
index f5d2066121052f..a46065649ad038 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/html5semantic.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/html5semantic.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G","260":"H A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC","132":"0B NC OC","260":"3 4 J K F G H A B C L M I N D O m"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 J","260":"4 5 6 7 K F G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","132":"J PC 7B","260":"3 K QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","132":"H B YC ZC aC bC","260":"C wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","132":"7B","260":"dC JC eC fC"},H:{"132":"yC"},I:{"1":"E 3C 4C","132":"zC","260":"0B J 0C 1C 2C JC"},J:{"260":"F A"},K:{"1":"p","132":"A","260":"B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"260":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"HTML5 semantic elements",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E","260":"F A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC","132":"3B QC RC","260":"4 5 I J D E F A B C K L G M N O n"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 I","260":"5 6 7 8 J D E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","132":"I SC 9B","260":"4 J TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","132":"F B bC cC dC eC","260":"C yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","132":"9B","260":"gC MC hC iC"},H:{"132":"1C"},I:{"1":"H 6C 7C","132":"2C","260":"3B I 3C 4C 5C MC"},J:{"260":"D A"},K:{"1":"q","132":"A","260":"B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"260":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"HTML5 semantic elements",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http-live-streaming.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http-live-streaming.js
index 2a51fab73c06ae..617a41d53b4e1e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http-live-streaming.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http-live-streaming.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"C L M I N D O","2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"HTTP Live Streaming (HLS)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"C K L G M N O","2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"HTTP Live Streaming (HLS)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http2.js
index 240bb35ec48751..e9235ba51b3f04 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http2.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","132":"B"},B:{"1":"C L M I N D O","513":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB NC OC","513":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"NB OB PB QB RB SB TB UB VB WB","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB","513":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC","260":"H A TC 8B"},F:{"1":"AB BB CB DB EB FB GB HB IB JB","2":"4 5 6 7 8 9 H B C I N D O m n o YC ZC aC bC wB IC cC xB","513":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","513":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","513":"p"},L:{"513":"E"},M:{"513":"E"},N:{"2":"A B"},O:{"513":"yB"},P:{"1":"J","513":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"513":"9B"},R:{"513":"ID"},S:{"1":"JD","513":"KD"}},B:6,C:"HTTP/2 protocol",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","132":"B"},B:{"1":"C K L G M N O","513":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB QC RC","513":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"OB PB QB RB SB TB UB VB WB XB","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB","513":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC","260":"F A WC AC"},F:{"1":"BB CB DB EB FB GB HB IB JB KB","2":"5 6 7 8 9 F B C G M N O n o p AB bC cC dC eC yB LC fC zB","513":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","513":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","513":"q"},L:{"513":"H"},M:{"513":"xB"},N:{"2":"A B"},O:{"513":"0B"},P:{"1":"I","513":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"513":"BC"},R:{"513":"KD"},S:{"1":"LD","513":"MD"}},B:6,C:"HTTP/2 protocol",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http3.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http3.js
index 3d52738fe89d9a..e3d620e64885ee 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http3.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/http3.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","322":"P Q R S T","578":"U V"},C:{"1":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB NC OC","194":"qB p rB sB tB uB vB P Q R 3B S T U V W"},D:{"1":"0 1 2 W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB","322":"P Q R S T","578":"U V"},E:{"2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB 9B","2052":"D FC GC HC XC","2116":"zB CC DC EC","3140":"M I UC VC AC BC yB WC"},F:{"1":"rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB YC ZC aC bC wB IC cC xB","578":"p"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC","2052":"D FC GC HC","2116":"uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:6,C:"HTTP/3 protocol",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","322":"P Q R S T","578":"U V"},C:{"1":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB QC RC","194":"rB q sB tB uB vB wB P Q R 6B S T U V W"},D:{"1":"0 1 2 3 W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB","322":"P Q R S T","578":"U V"},E:{"2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB BC","2052":"HC IC JC 2B KC aC","2116":"1B EC FC GC","3140":"L G XC YC CC DC 0B ZC"},F:{"1":"sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB bC cC dC eC yB LC fC zB","578":"q"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC","2052":"HC IC JC 2B KC","2116":"xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:6,C:"HTTP/3 protocol",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-sandbox.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-sandbox.js
index df8c922210f985..94248129c3c0d3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-sandbox.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-sandbox.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N NC OC","4":"4 5 6 7 8 9 D O m n o"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC"},H:{"2":"yC"},I:{"1":"0B J E 0C 1C 2C JC 3C 4C","2":"zC"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"sandbox attribute for iframes",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M QC RC","4":"5 6 7 8 9 N O n o p AB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC"},H:{"2":"1C"},I:{"1":"3B I H 3C 4C 5C MC 6C 7C","2":"2C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"sandbox attribute for iframes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-seamless.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-seamless.js
index 85c55868478c2f..0ebf7a080e27d5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-seamless.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-seamless.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 9 J K F G H A B C L M I N D O AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","66":"5 6 7 8 m n o"},E:{"2":"3 J K G H A B C L M I D PC 7B QC RC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","130":"F SC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","130":"gC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"seamless attribute for iframes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 I J D E F A B C K L G M N O AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","66":"6 7 8 9 n o p"},E:{"2":"4 I J E F A B C K L G SC 9B TC UC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","130":"D VC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","130":"jC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"seamless attribute for iframes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-srcdoc.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-srcdoc.js
index fd95873ff93207..7483d6e2d2297a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-srcdoc.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/iframe-srcdoc.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","8":"C L M I N D O"},C:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC","8":"3 4 5 6 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L","8":"4 M I N D O"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B","8":"3 J QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B YC ZC aC bC","8":"C wB IC cC xB"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B","8":"dC JC eC"},H:{"2":"yC"},I:{"1":"E 3C 4C","8":"0B J zC 0C 1C 2C JC"},J:{"1":"A","8":"F"},K:{"1":"p","2":"A B","8":"C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"8":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"srcdoc attribute for iframes",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","8":"C K L G M N O"},C:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC","8":"4 5 6 7 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K","8":"5 L G M N O"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B","8":"4 I TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B bC cC dC eC","8":"C yB LC fC zB"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B","8":"gC MC hC"},H:{"2":"1C"},I:{"1":"H 6C 7C","8":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","8":"D"},K:{"1":"q","2":"A B","8":"C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"8":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"srcdoc attribute for iframes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/imagecapture.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/imagecapture.js
index 1023bc124060b4..72b8ac52cd8217 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/imagecapture.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/imagecapture.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB NC OC","194":"0 1 2 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","322":"ZB aB bB cB dB eB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB YC ZC aC bC wB IC cC xB","322":"MB NB OB PB QB RB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"194":"JD KD"}},B:5,C:"ImageCapture API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB QC RC","194":"0 1 2 3 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","322":"aB bB cB dB eB fB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB bC cC dC eC yB LC fC zB","322":"NB OB PB QB RB SB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"194":"LD MD"}},B:5,C:"ImageCapture API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ime.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ime.js
index bd698cf8b204e6..6050e512b9c426 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ime.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ime.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","161":"B"},B:{"2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","161":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A","161":"B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Input Method Editor API",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","161":"B"},B:{"2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","161":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A","161":"B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Input Method Editor API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/img-naturalwidth-naturalheight.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/img-naturalwidth-naturalheight.js
index 4a95f9cabea838..0d6c5575d32eca 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/img-naturalwidth-naturalheight.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/img-naturalwidth-naturalheight.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"naturalWidth & naturalHeight image properties",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"naturalWidth & naturalHeight image properties",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/import-maps.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/import-maps.js
index 4b4a321d18b6bd..50108c29e2bba5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/import-maps.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/import-maps.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","194":"P Q R S T U V W X"},C:{"1":"0 1 2 v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k NC OC","322":"l q r s t u"},D:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p","194":"rB sB tB uB vB P Q R S T U V W X"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"1":"tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB YC ZC aC bC wB IC cC xB","194":"gB hB iB jB kB lB mB nB oB pB qB p rB sB"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"Import maps",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","194":"P Q R S T U V W X"},C:{"1":"0 1 2 3 v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k QC RC","322":"l m r s t u"},D:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q","194":"sB tB uB vB wB P Q R S T U V W X"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC"},F:{"1":"uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB bC cC dC eC yB LC fC zB","194":"hB iB jB kB lB mB nB oB pB qB rB q sB tB"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD GD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"Import maps",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/imports.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/imports.js
index 79e9908af4e769..80d4bf84c01079 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/imports.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/imports.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","8":"A B"},B:{"1":"P","2":"0 1 2 Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","8":"C L M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB NC OC","8":"0 1 2 CB DB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","72":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},D:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P","2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","66":"CB DB EB FB GB","72":"HB"},E:{"2":"3 J PC 7B QC","8":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB","2":"H B C I N lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","66":"4 D O m n","72":"o"},G:{"2":"7B dC JC eC fC","8":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"8":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J 5C 6C 7C 8C 9C 8B AD BD","2":"m n o CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"2":"ID"},S:{"1":"JD","8":"KD"}},B:5,C:"HTML Imports",D:true};
+module.exports={A:{A:{"2":"J D E F NC","8":"A B"},B:{"1":"P","2":"0 1 2 3 Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","8":"C K L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB QC RC","8":"0 1 2 3 DB EB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","72":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},D:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P","2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","66":"DB EB FB GB HB","72":"IB"},E:{"2":"4 I SC 9B TC","8":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB","2":"F B C G M mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","66":"5 N O n o","72":"p"},G:{"2":"9B gC MC hC iC","8":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"8":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I 8C 9C AD BD CD AC DD ED","2":"n o p FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"2":"KD"},S:{"1":"LD","8":"MD"}},B:5,C:"HTML Imports",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indeterminate-checkbox.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indeterminate-checkbox.js
index 99c58a1228f0d8..9b2f442b1275d6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indeterminate-checkbox.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indeterminate-checkbox.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","16":"KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","2":"LC 0B","16":"NC"},D:{"1":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H B YC ZC aC bC wB IC"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"indeterminate checkbox",D:true};
+module.exports={A:{A:{"1":"J D E F A B","16":"NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","2":"OC 3B","16":"QC"},D:{"1":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F B bC cC dC eC yB LC"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"indeterminate checkbox",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indexeddb.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indexeddb.js
index f81efcde834409..b2acbef49f25f9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indexeddb.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indexeddb.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","132":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C L M I N D O"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","33":"A B C L M I","36":"3 J K F G H"},D:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"A","8":"3 J K F G H","33":"5","36":"4 B C L M I N D O m n o"},E:{"1":"A B C L M I D 8B wB xB 9B VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"3 J K F PC 7B QC RC","260":"G H SC TC","516":"UC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H YC ZC","8":"B C aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC wC AC BC yB xC zB CC DC EC FC GC HC","8":"7B dC JC eC fC gC","260":"G hC iC jC","516":"vC"},H:{"2":"yC"},I:{"1":"E 3C 4C","8":"0B J zC 0C 1C 2C JC"},J:{"1":"A","8":"F"},K:{"1":"p","2":"A","8":"B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"IndexedDB",D:true};
+module.exports={A:{A:{"2":"J D E F NC","132":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C K L G M N O"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","33":"A B C K L G","36":"4 I J D E F"},D:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"A","8":"4 I J D E F","33":"6","36":"5 B C K L G M N O n o p"},E:{"1":"A B C K L G AC yB zB BC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"4 I J D SC 9B TC UC","260":"E F VC WC","516":"XC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F bC cC","8":"B C dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"9B gC MC hC iC jC","260":"E kC lC mC","516":"yC"},H:{"2":"1C"},I:{"1":"H 6C 7C","8":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","8":"D"},K:{"1":"q","2":"A","8":"B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"IndexedDB",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indexeddb2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indexeddb2.js
index 9da73d96cf5b55..e97971f1d94204 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indexeddb2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/indexeddb2.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB NC OC","132":"QB RB SB","260":"TB UB VB WB"},D:{"1":"0 1 2 eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB","132":"UB VB WB XB","260":"YB ZB aB bB cB dB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB YC ZC aC bC wB IC cC xB","132":"HB IB JB KB","260":"LB MB NB OB PB QB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC","16":"kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","260":"5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","260":"JD"}},B:2,C:"IndexedDB 2.0",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB QC RC","132":"RB SB TB","260":"UB VB WB XB"},D:{"1":"0 1 2 3 fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB","132":"VB WB XB YB","260":"ZB aB bB cB dB eB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB bC cC dC eC yB LC fC zB","132":"IB JB KB LB","260":"MB NB OB PB QB RB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC","16":"nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","260":"8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","260":"LD"}},B:2,C:"IndexedDB 2.0",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/inline-block.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/inline-block.js
index 959f6dd1ef9392..c9e8c6161a12bd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/inline-block.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/inline-block.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","4":"KC","132":"K F"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","36":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS inline-block",D:true};
+module.exports={A:{A:{"1":"E F A B","4":"NC","132":"J D"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","36":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS inline-block",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/innertext.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/innertext.js
index fee42c2ea63f01..bb71e9ebaef158 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/innertext.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/innertext.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","16":"KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","16":"H"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"HTMLElement.innerText",D:true};
+module.exports={A:{A:{"1":"J D E F A B","16":"NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","16":"F"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"HTMLElement.innerText",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-autocomplete-onoff.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-autocomplete-onoff.js
index 00cdd965a4b23d..5cd1ace1e7ca8d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-autocomplete-onoff.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-autocomplete-onoff.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A KC","132":"B"},B:{"132":"C L M I N D O","260":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB NC OC","516":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"4 5 6 7 8 D O m n o","2":"3 J K F G H A B C L M I N","132":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB","260":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"K QC RC","2":"3 J PC 7B","2052":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"7B dC JC","1025":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1025":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2052":"A B"},O:{"1025":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"260":"9B"},R:{"1":"ID"},S:{"516":"JD KD"}},B:1,C:"autocomplete attribute: on & off values",D:true};
+module.exports={A:{A:{"1":"J D E F A NC","132":"B"},B:{"132":"C K L G M N O","260":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB QC RC","516":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"5 6 7 8 9 N O n o p","2":"4 I J D E F A B C K L G M","132":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB","260":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"J TC UC","2":"4 I SC 9B","2052":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"9B gC MC","1025":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1025":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2052":"A B"},O:{"1025":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"260":"BC"},R:{"1":"KD"},S:{"516":"LD MD"}},B:1,C:"autocomplete attribute: on & off values",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-color.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-color.js
index ca66c600ffe986..40a5931fa3e3ee 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-color.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-color.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC"},D:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB"},F:{"1":"4 5 6 7 8 9 B C D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H I N YC ZC aC bC"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC","129":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"Color input type",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC"},D:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB"},F:{"1":"5 6 7 8 9 B C N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F G M bC cC dC eC"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC","129":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"Color input type",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-datetime.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-datetime.js
index 86c76da8064bc6..e52335449b97ca 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-datetime.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-datetime.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB NC OC","1090":"ZB aB bB cB","2052":"dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b","4100":"0 1 2 c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O","2052":"5 6 m n o"},E:{"2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B","4100":"I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"7B dC JC","260":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B zC 0C 1C","514":"J 2C JC"},J:{"1":"A","2":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"4100":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2052":"JD KD"}},B:1,C:"Date and time input types",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB QC RC","1090":"aB bB cB dB","2052":"eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b","4100":"0 1 2 3 c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O","2052":"6 7 n o p"},E:{"2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC","4100":"G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"9B gC MC","260":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B 2C 3C 4C","514":"I 5C MC"},J:{"1":"A","2":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"4100":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2052":"LD MD"}},B:1,C:"Date and time input types",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-email-tel-url.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-email-tel-url.js
index 879fd4c37e3eca..90bdf1abf4e24f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-email-tel-url.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-email-tel-url.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","132":"zC 0C 1C"},J:{"1":"A","132":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Email, telephone & URL input types",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","132":"2C 3C 4C"},J:{"1":"A","132":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Email, telephone & URL input types",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-event.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-event.js
index beae2f638dbe9a..4b73fc44ae2be4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-event.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-event.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","2561":"A B","2692":"H"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2561":"C L M I N D O"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC","1537":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB OC","1796":"0B NC"},D:{"1":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M","1025":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB","1537":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB"},E:{"1":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J K PC 7B","1025":"F G H A B C RC SC TC 8B wB","1537":"QC","4097":"L xB"},F:{"1":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","16":"H B C YC ZC aC bC wB IC","260":"cC","1025":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","1537":"4 I N D O m n"},G:{"1":"D rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC","1025":"G hC iC jC kC lC mC nC oC","1537":"eC fC gC","4097":"pC qC"},H:{"2":"yC"},I:{"16":"zC 0C","1025":"E 4C","1537":"0B J 1C 2C JC 3C"},J:{"1025":"A","1537":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2561":"A B"},O:{"1":"yB"},P:{"1025":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","1537":"JD"}},B:1,C:"input event",D:true};
+module.exports={A:{A:{"2":"J D E NC","2561":"A B","2692":"F"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2561":"C K L G M N O"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC","1537":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB RC","1796":"3B QC"},D:{"1":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L","1025":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB","1537":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB"},E:{"1":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I J SC 9B","1025":"D E F A B C UC VC WC AC yB","1537":"TC","4097":"K zB"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","16":"F B C bC cC dC eC yB LC","260":"fC","1025":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","1537":"5 G M N O n o"},G:{"1":"uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC","1025":"E kC lC mC nC oC pC qC rC","1537":"hC iC jC","4097":"sC tC"},H:{"2":"1C"},I:{"16":"2C 3C","1025":"H 7C","1537":"3B I 4C 5C MC 6C"},J:{"1025":"A","1537":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2561":"A B"},O:{"1":"0B"},P:{"1025":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","1537":"LD"}},B:1,C:"input event",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-accept.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-accept.js
index 34a770757ce993..f49344b1e6f901 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-accept.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-accept.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J","16":"3 5 6 7 K F G n o","132":"4 H A B C L M I N D O m"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","132":"K F G H A B RC SC TC 8B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"2":"fC gC","132":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","514":"7B dC JC eC"},H:{"2":"yC"},I:{"2":"zC 0C 1C","260":"0B J 2C JC","514":"E 3C 4C"},J:{"132":"A","260":"F"},K:{"2":"A B C wB IC xB","514":"p"},L:{"260":"E"},M:{"2":"E"},N:{"514":"A","1028":"B"},O:{"2":"yB"},P:{"260":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"260":"9B"},R:{"260":"ID"},S:{"1":"JD KD"}},B:1,C:"accept attribute for file input",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I","16":"4 6 7 8 J D E o p","132":"5 F A B C K L G M N O n"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","132":"J D E F A B UC VC WC AC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"2":"iC jC","132":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","514":"9B gC MC hC"},H:{"2":"1C"},I:{"2":"2C 3C 4C","260":"3B I 5C MC","514":"H 6C 7C"},J:{"132":"A","260":"D"},K:{"2":"A B C yB LC zB","514":"q"},L:{"260":"H"},M:{"2":"xB"},N:{"514":"A","1028":"B"},O:{"2":"0B"},P:{"260":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"260":"BC"},R:{"260":"KD"},S:{"1":"LD MD"}},B:1,C:"accept attribute for file input",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-directory.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-directory.js
index fe3958a9141c25..92fc0c6186721a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-directory.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-directory.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB NC OC"},D:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C I N YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Directory selection from file input",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB QC RC"},D:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C G M bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Directory selection from file input",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-multiple.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-multiple.js
index ee31944eefb3a3..a7fe41a479f6de 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-multiple.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-file-multiple.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","2":"LC 0B NC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","2":"H YC ZC aC"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC"},H:{"130":"yC"},I:{"130":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"130":"A B C p wB IC xB"},L:{"132":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"130":"yB"},P:{"130":"J","132":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"132":"9B"},R:{"132":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"Multiple file selection",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","2":"OC 3B QC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","2":"F bC cC dC"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC"},H:{"130":"1C"},I:{"130":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"130":"A B C q yB LC zB"},L:{"132":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"130":"0B"},P:{"130":"I","132":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"132":"BC"},R:{"132":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"Multiple file selection",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-inputmode.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-inputmode.js
index 061c1c1bd6d98b..1572f36ea76c0d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-inputmode.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-inputmode.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N NC OC","4":"4 D O m","194":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d"},D:{"1":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB","66":"cB dB eB 1B fB 2B gB hB iB jB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB YC ZC aC bC wB IC cC xB","66":"PB QB RB SB TB UB VB WB XB YB"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"194":"JD KD"}},B:1,C:"inputmode attribute",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M QC RC","4":"5 N O n","194":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d"},D:{"1":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB","66":"dB eB fB 4B gB 5B hB iB jB kB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB bC cC dC eC yB LC fC zB","66":"QB RB SB TB UB VB WB XB YB ZB"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"194":"LD MD"}},B:1,C:"inputmode attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-minlength.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-minlength.js
index 81b1f3de1f66ae..3a6938b308d2db 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-minlength.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-minlength.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB NC OC"},D:{"1":"0 1 2 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"Minimum length attribute for input fields",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB QC RC"},D:{"1":"0 1 2 3 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"Minimum length attribute for input fields",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-number.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-number.js
index 1796d1b9fb414c..9ef17ef6bc7bf9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-number.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-number.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","129":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"C L","1025":"M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC","513":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"388":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B zC 0C 1C","388":"J E 2C JC 3C 4C"},J:{"2":"F","388":"A"},K:{"1":"A B C wB IC xB","388":"p"},L:{"388":"E"},M:{"641":"E"},N:{"388":"A B"},O:{"388":"yB"},P:{"388":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"388":"9B"},R:{"388":"ID"},S:{"513":"JD KD"}},B:1,C:"Number input type",D:true};
+module.exports={A:{A:{"2":"J D E F NC","129":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"C K","1025":"L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC","513":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"388":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B 2C 3C 4C","388":"I H 5C MC 6C 7C"},J:{"2":"D","388":"A"},K:{"1":"A B C yB LC zB","388":"q"},L:{"388":"H"},M:{"641":"xB"},N:{"388":"A B"},O:{"388":"0B"},P:{"388":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"388":"BC"},R:{"388":"KD"},S:{"513":"LD MD"}},B:1,C:"Number input type",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-pattern.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-pattern.js
index 79a48da56bcfdb..f7f274d0a5642c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-pattern.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-pattern.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","16":"3","388":"K F G H A QC RC SC TC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC","388":"G eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E 4C","2":"0B J zC 0C 1C 2C JC 3C"},J:{"1":"A","2":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Pattern attribute for input fields",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","16":"4","388":"J D E F A TC UC VC WC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC","388":"E hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H 7C","2":"3B I 2C 3C 4C 5C MC 6C"},J:{"1":"A","2":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Pattern attribute for input fields",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-placeholder.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-placeholder.js
index 6c1c4d1c3125eb..a2da51c54ba6f5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-placeholder.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-placeholder.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","132":"J PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l IC cC xB","2":"H YC ZC aC bC","132":"B wB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B E zC 0C 1C JC 3C 4C","4":"J 2C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"input placeholder attribute",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","132":"I SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m LC fC zB","2":"F bC cC dC eC","132":"B yB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B H 2C 3C 4C MC 6C 7C","4":"I 5C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"input placeholder attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-range.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-range.js
index 4014dd22d4f392..32c9985797bd66 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-range.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-range.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"E JC 3C 4C","4":"0B J zC 0C 1C 2C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Range input type",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"H MC 6C 7C","4":"3B I 2C 3C 4C 5C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Range input type",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-search.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-search.js
index 83c875b8be004e..3be78ed549ce69 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-search.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-search.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","129":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"C L M I N D O"},C:{"2":"LC 0B NC OC","129":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 5 6 7 J K F G H A B C L M n o","129":"4 I N D O m"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H YC ZC aC bC","16":"B wB IC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC"},H:{"129":"yC"},I:{"1":"E 3C 4C","16":"zC 0C","129":"0B J 1C 2C JC"},J:{"1":"F","129":"A"},K:{"1":"C p","2":"A","16":"B wB IC","129":"xB"},L:{"1":"E"},M:{"129":"E"},N:{"129":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"129":"JD KD"}},B:1,C:"Search input type",D:true};
+module.exports={A:{A:{"2":"J D E F NC","129":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"C K L G M N O"},C:{"2":"OC 3B QC RC","129":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 6 7 8 I J D E F A B C K L o p","129":"5 G M N O n"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F bC cC dC eC","16":"B yB LC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC"},H:{"129":"1C"},I:{"1":"H 6C 7C","16":"2C 3C","129":"3B I 4C 5C MC"},J:{"1":"D","129":"A"},K:{"1":"C q","2":"A","16":"B yB LC","129":"zB"},L:{"1":"H"},M:{"129":"xB"},N:{"129":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"129":"LD MD"}},B:1,C:"Search input type",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-selection.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-selection.js
index 10fbbab6509e19..b800707d6f8e5c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-selection.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/input-selection.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","16":"H YC ZC aC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"2":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Selection controls for input & textarea",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","16":"F bC cC dC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"2":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Selection controls for input & textarea",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/insert-adjacent.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/insert-adjacent.js
index c4ecf8dec1b9cf..d9c79df40d35f1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/insert-adjacent.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/insert-adjacent.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","16":"KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","16":"H"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Element.insertAdjacentElement() & Element.insertAdjacentText()",D:true};
+module.exports={A:{A:{"1":"J D E F A B","16":"NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","16":"F"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Element.insertAdjacentElement() & Element.insertAdjacentText()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/insertadjacenthtml.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/insertadjacenthtml.js
index 6c18813c4a01f7..2ee80d6cd01637 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/insertadjacenthtml.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/insertadjacenthtml.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","16":"KC","132":"K F G H"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","16":"H YC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Element.insertAdjacentHTML()",D:true};
+module.exports={A:{A:{"1":"A B","16":"NC","132":"J D E F"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","16":"F bC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Element.insertAdjacentHTML()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/internationalization.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/internationalization.js
index efb894dabc8698..2d649f08738ab8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/internationalization.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/internationalization.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC"},D:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 J K F G H A B C L M I N D O m n o"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"Internationalization API",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC"},D:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 I J D E F A B C K L G M N O n o p"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"Internationalization API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intersectionobserver-v2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intersectionobserver-v2.js
index d7ba7e0766e886..78c039358358c4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intersectionobserver-v2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intersectionobserver-v2.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"IntersectionObserver V2",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"IntersectionObserver V2",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intersectionobserver.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intersectionobserver.js
index 2ade2ea6d45755..b541c2f0a49fb8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intersectionobserver.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intersectionobserver.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"N D O","2":"C L M","260":"I","513":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB NC OC","194":"YB ZB aB"},D:{"1":"eB 1B fB 2B gB hB iB","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","260":"XB YB ZB aB bB cB dB","513":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB YC ZC aC bC wB IC cC xB","260":"KB LB MB NB OB PB QB","513":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","513":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","513":"p"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","260":"5C 6C"},Q:{"513":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"IntersectionObserver",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"M N O","2":"C K L","260":"G","513":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB QC RC","194":"ZB aB bB"},D:{"1":"fB 4B gB 5B hB iB jB","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","260":"YB ZB aB bB cB dB eB","513":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB"},F:{"1":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB bC cC dC eC yB LC fC zB","260":"LB MB NB OB PB QB RB","513":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","513":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","513":"q"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","260":"8C 9C"},Q:{"513":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"IntersectionObserver",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intl-pluralrules.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intl-pluralrules.js
index 5398a600574d11..47775c890bc527 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intl-pluralrules.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intl-pluralrules.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D","130":"O"},C:{"1":"0 1 2 eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB NC OC"},D:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB xB"},F:{"1":"WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB YC ZC aC bC wB IC cC xB"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"Intl.PluralRules API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N","130":"O"},C:{"1":"0 1 2 3 fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB QC RC"},D:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB zB"},F:{"1":"XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB bC cC dC eC yB LC fC zB"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"Intl.PluralRules API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intrinsic-width.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intrinsic-width.js
index 3ed8ea7f55e2e4..56e456444fadcd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intrinsic-width.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/intrinsic-width.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","1025":"0 1 2 d e f g h i j k l q r s t u v w x y z E","1537":"P Q R S T U V W X Y Z a b c"},C:{"2":"LC","932":"3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB NC OC","2308":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 J K F G H A B C L M I N D O m n","545":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB","1025":"0 1 2 d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","1537":"SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC","516":"B C L M I wB xB 9B UC VC AC BC yB WC","548":"H A TC 8B","676":"F G RC SC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","513":"GB","545":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB","1025":"e f g h i j k l","1537":"FB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d"},G:{"1":"D zB CC DC EC FC GC HC","2":"7B dC JC eC fC","516":"uC vC wC AC BC yB xC","548":"iC jC kC lC mC nC oC pC qC rC sC tC","676":"G gC hC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","545":"3C 4C","1025":"E"},J:{"2":"F","545":"A"},K:{"2":"A B C wB IC xB","1025":"p"},L:{"1025":"E"},M:{"2308":"E"},N:{"2":"A B"},O:{"1537":"yB"},P:{"545":"J","1025":"m n o FD GD HD","1537":"5C 6C 7C 8C 9C 8B AD BD CD DD ED zB"},Q:{"1537":"9B"},R:{"1537":"ID"},S:{"932":"JD","2308":"KD"}},B:5,C:"Intrinsic & Extrinsic Sizing",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","1025":"0 1 2 3 d e f g h i j k l m r s t u v w x y z H","1537":"P Q R S T U V W X Y Z a b c"},C:{"2":"OC","932":"4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB QC RC","2308":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 I J D E F A B C K L G M N O n o","545":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB","1025":"0 1 2 3 d e f g h i j k l m r s t u v w x y z H xB 7B 8B","1537":"TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC","516":"B C K L G yB zB BC XC YC CC DC 0B ZC","548":"F A WC AC","676":"D E UC VC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","513":"HB","545":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB","1025":"e f g h i j k l m","1537":"GB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC","516":"xC yC zC CC DC 0B 0C","548":"lC mC nC oC pC qC rC sC tC uC vC wC","676":"E jC kC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","545":"6C 7C","1025":"H"},J:{"2":"D","545":"A"},K:{"2":"A B C yB LC zB","1025":"q"},L:{"1025":"H"},M:{"2308":"xB"},N:{"2":"A B"},O:{"1537":"0B"},P:{"545":"I","1025":"n o p 2B ID JD","1537":"8C 9C AD BD CD AC DD ED FD GD HD 1B"},Q:{"1537":"BC"},R:{"1537":"KD"},S:{"932":"LD","2308":"MD"}},B:5,C:"Intrinsic & Extrinsic Sizing",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpeg2000.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpeg2000.js
index 6f8b16f4dce33a..614f186c1c4d4c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpeg2000.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpeg2000.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","129":"3 QC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"JPEG 2000 image format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","129":"4 TC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"JPEG 2000 image format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpegxl.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpegxl.js
index 00ff8d7e2c1cfa..a72cae6977a51f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpegxl.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpegxl.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z x y z E","578":"a b c d e f g h i j k l q r s t u v w"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y NC OC","322":"0 1 2 Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z x y z E 4B 5B 6B","194":"a b c d e f g h i j k l q r s t u v w"},E:{"1":"D XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB YC ZC aC bC wB IC cC xB","194":"uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"JPEG XL image format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z x y z H","578":"a b c d e f g h i j k l m r s t u v w"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y QC RC","322":"0 1 2 3 Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z x y z H xB 7B 8B","194":"a b c d e f g h i j k l m r s t u v w"},E:{"1":"2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB bC cC dC eC yB LC fC zB","194":"vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"JPEG XL image format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpegxr.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpegxr.js
index da8263d9abba8a..c080287d5c128e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpegxr.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/jpegxr.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"C L M I N D O","2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"1":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"JPEG XR image format",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"C K L G M N O","2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"1":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"JPEG XR image format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/js-regexp-lookbehind.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/js-regexp-lookbehind.js
index 5c1aa4a793a90e..c3ea2defb33a9c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/js-regexp-lookbehind.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/js-regexp-lookbehind.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB NC OC"},D:{"1":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"1":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB YC ZC aC bC wB IC cC xB"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"Lookbehind in JS regular expressions",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB QC RC"},D:{"1":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC"},F:{"1":"WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB bC cC dC eC yB LC fC zB"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"Lookbehind in JS regular expressions",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/json.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/json.js
index 456329d3a3c1d5..142fa89c6a742d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/json.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/json.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F KC","129":"G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"JSON parsing",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D NC","129":"E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"JSON parsing",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/justify-content-space-evenly.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/justify-content-space-evenly.js
index 382728309f5090..6eabb983217eaf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/justify-content-space-evenly.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/justify-content-space-evenly.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I","132":"N D O"},C:{"1":"0 1 2 YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB NC OC"},D:{"1":"0 1 2 fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB","132":"dB eB 1B"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC","132":"8B"},F:{"1":"TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB YC ZC aC bC wB IC cC xB","132":"QB RB SB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC","132":"lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C","132":"7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","132":"JD"}},B:5,C:"CSS justify-content: space-evenly",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G","132":"M N O"},C:{"1":"0 1 2 3 ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB QC RC"},D:{"1":"0 1 2 3 gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","132":"eB fB 4B"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC","132":"AC"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bC cC dC eC yB LC fC zB","132":"RB SB TB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC","132":"oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C","132":"AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","132":"LD"}},B:5,C:"CSS justify-content: space-evenly",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/kerning-pairs-ligatures.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/kerning-pairs-ligatures.js
index b1ac9185f85194..1e83f4ba2b048d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/kerning-pairs-ligatures.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/kerning-pairs-ligatures.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"zC 0C 1C","132":"0B J 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:7,C:"High-quality kerning pairs & ligatures",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"2C 3C 4C","132":"3B I 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:7,C:"High-quality kerning pairs & ligatures",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-charcode.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-charcode.js
index 190669d408e521..2afcb60ea4c265 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-charcode.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-charcode.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","16":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC","16":"C"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"p xB","2":"A B wB IC","16":"C"},L:{"1":"E"},M:{"130":"E"},N:{"130":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:7,C:"KeyboardEvent.charCode",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","16":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC","16":"C"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"q zB","2":"A B yB LC","16":"C"},L:{"1":"H"},M:{"130":"xB"},N:{"130":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:7,C:"KeyboardEvent.charCode",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-code.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-code.js
index 16f8fcf5e82a2d..8c94f6b3a5b59a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-code.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-code.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB NC OC"},D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB","194":"OB PB QB RB SB TB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB YC ZC aC bC wB IC cC xB","194":"BB CB DB EB FB GB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"194":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J","194":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"194":"ID"},S:{"1":"JD KD"}},B:5,C:"KeyboardEvent.code",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB QC RC"},D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","194":"PB QB RB SB TB UB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB bC cC dC eC yB LC fC zB","194":"CB DB EB FB GB HB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"194":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I","194":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"194":"KD"},S:{"1":"LD MD"}},B:5,C:"KeyboardEvent.code",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-getmodifierstate.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-getmodifierstate.js
index e43cfb99cd7f0f..f8df870f04736b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-getmodifierstate.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-getmodifierstate.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M NC OC"},D:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B I N YC ZC aC bC wB IC cC","16":"C"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p xB","2":"A B wB IC","16":"C"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"KeyboardEvent.getModifierState()",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L QC RC"},D:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B G M bC cC dC eC yB LC fC","16":"C"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q zB","2":"A B yB LC","16":"C"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"KeyboardEvent.getModifierState()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-key.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-key.js
index 3d15ed117bf422..f34bfe3ea042b5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-key.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-key.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","260":"H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I N D O"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n o NC OC","132":"5 6 7 8 9 AB"},D:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"4 5 6 7 8 9 H B I N D O m n o AB BB CB DB EB FB GB HB IB JB YC ZC aC bC wB IC cC","16":"C"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"1":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p xB","2":"A B wB IC","16":"C"},L:{"1":"E"},M:{"1":"E"},N:{"260":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"KeyboardEvent.key",D:true};
+module.exports={A:{A:{"2":"J D E NC","260":"F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G M N O"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o p QC RC","132":"6 7 8 9 AB BB"},D:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"5 6 7 8 9 F B G M N O n o p AB BB CB DB EB FB GB HB IB JB KB bC cC dC eC yB LC fC","16":"C"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"1":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q zB","2":"A B yB LC","16":"C"},L:{"1":"H"},M:{"1":"xB"},N:{"260":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"KeyboardEvent.key",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-location.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-location.js
index 0eca61fe7a86b6..d3b9ed450122cc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-location.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-location.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M NC OC"},D:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"K PC 7B","132":"3 J QC"},F:{"1":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC","16":"C","132":"I N"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC","132":"eC fC gC"},H:{"2":"yC"},I:{"1":"E 3C 4C","16":"zC 0C","132":"0B J 1C 2C JC"},J:{"132":"F A"},K:{"1":"p xB","2":"A B wB IC","16":"C"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"KeyboardEvent.location",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L QC RC"},D:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"J SC 9B","132":"4 I TC"},F:{"1":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC","16":"C","132":"G M"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC","132":"hC iC jC"},H:{"2":"1C"},I:{"1":"H 6C 7C","16":"2C 3C","132":"3B I 4C 5C MC"},J:{"132":"D A"},K:{"1":"q zB","2":"A B yB LC","16":"C"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"KeyboardEvent.location",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-which.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-which.js
index 7b9929c01b7881..3bc9466c29967c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-which.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/keyboardevent-which.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","16":"3"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","16":"H YC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC","16":"zC 0C","132":"3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"132":"E"},M:{"132":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"2":"J","132":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"132":"ID"},S:{"1":"JD KD"}},B:7,C:"KeyboardEvent.which",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","16":"4"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","16":"F bC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC","16":"2C 3C","132":"6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"132":"H"},M:{"132":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"2":"I","132":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"132":"KD"},S:{"1":"LD MD"}},B:7,C:"KeyboardEvent.which",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/lazyload.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/lazyload.js
index f484813b182a7c..b69e6a77a7370f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/lazyload.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/lazyload.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"C L M I N D O","2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"1":"B","2":"A"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Resource Hints: Lazyload",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"C K L G M N O","2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"1":"B","2":"A"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Resource Hints: Lazyload",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/let.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/let.js
index 8d5ed4bacfa845..8a677380d6d193 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/let.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/let.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","2052":"B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","194":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I N D O","322":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB","516":"NB OB PB QB RB SB TB UB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC","1028":"A 8B"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","322":"4 5 6 7 8 9 I N D O m n o","516":"AB BB CB DB EB FB GB HB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC","1028":"kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","516":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"let",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","2052":"B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","194":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G M N O","322":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB","516":"OB PB QB RB SB TB UB VB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC","1028":"A AC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","322":"5 6 7 8 9 G M N O n o p AB","516":"BB CB DB EB FB GB HB IB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC","1028":"nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","516":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"let",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-icon-png.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-icon-png.js
index 4dcff588a038ae..f0ad369cf17095 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-icon-png.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-icon-png.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","130":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC"},H:{"130":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F","130":"A"},K:{"1":"p","130":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"130":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"PNG favicons",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","130":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC"},H:{"130":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D","130":"A"},K:{"1":"q","130":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"130":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"PNG favicons",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-icon-svg.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-icon-svg.js
index d71c3e1c0f3491..a0a5ee2e1104a3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-icon-svg.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-icon-svg.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P","1537":"0 1 2 Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"LC 0B NC OC","260":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB","513":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P","1537":"0 1 2 Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB aB bB cB dB eB fB gB hB iB jB kB YC ZC aC bC wB IC cC xB","1537":"lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"D oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","130":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC"},H:{"130":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","130":"A"},K:{"130":"A B C wB IC xB","1537":"p"},L:{"1537":"E"},M:{"2":"E"},N:{"130":"A B"},O:{"2":"yB"},P:{"2":"J 5C 6C 7C 8C 9C 8B AD BD","1537":"m n o CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"1537":"ID"},S:{"513":"JD KD"}},B:1,C:"SVG favicons",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P","1537":"0 1 2 3 Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"OC 3B QC RC","260":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB","513":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P","1537":"0 1 2 3 Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bB cB dB eB fB gB hB iB jB kB lB bC cC dC eC yB LC fC zB","1537":"mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","130":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC"},H:{"130":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","130":"A"},K:{"130":"A B C yB LC zB","1537":"q"},L:{"1537":"H"},M:{"2":"xB"},N:{"130":"A B"},O:{"2":"0B"},P:{"2":"I 8C 9C AD BD CD AC DD ED","1537":"n o p FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"1537":"KD"},S:{"513":"LD MD"}},B:1,C:"SVG favicons",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-dns-prefetch.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-dns-prefetch.js
index 459e95ac12225d..428dc6d08a69de 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-dns-prefetch.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-dns-prefetch.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G KC","132":"H"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"LC 0B","260":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"16":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"16":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"1":"p","16":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","16":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Resource Hints: dns-prefetch",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E NC","132":"F"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"OC 3B","260":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"16":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"16":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"1":"q","16":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","16":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Resource Hints: dns-prefetch",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-modulepreload.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-modulepreload.js
index 7054738ecd7f07..150b8742b3ab25 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-modulepreload.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-modulepreload.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"2 E 4B 5B 6B MC","2":"0 1 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z NC OC"},D:{"1":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB"},E:{"1":"D XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB YC ZC aC bC wB IC cC xB"},G:{"1":"D","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:1,C:"Resource Hints: modulepreload",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"2 3 H xB 7B 8B PC","2":"0 1 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z QC RC"},D:{"1":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB"},E:{"1":"2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB bC cC dC eC yB LC fC zB"},G:{"1":"2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:1,C:"Resource Hints: modulepreload",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-preconnect.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-preconnect.js
index 22df1834ba7fcd..045f1085b2e280 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-preconnect.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-preconnect.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M","260":"I N D O"},C:{"1":"2 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB NC OC","129":"LB","514":"0 1 pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z"},D:{"1":"0 1 2 SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Resource Hints: preconnect",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L","260":"G M N O"},C:{"1":"2 3 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB QC RC","129":"MB","514":"0 1 qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z"},D:{"1":"0 1 2 3 TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Resource Hints: preconnect",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-prefetch.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-prefetch.js
index 28e01842bd5873..aca5eb24edc04d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-prefetch.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-prefetch.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F"},E:{"2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB","194":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC","194":"D tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"J E 3C 4C","2":"0B zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Resource Hints: prefetch",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D"},E:{"2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB","194":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC","194":"wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"I H 6C 7C","2":"3B 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Resource Hints: prefetch",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-preload.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-preload.js
index 3c52c77f49a031..ba79bff552423d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-preload.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-preload.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N","1028":"D O"},C:{"1":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB NC OC","132":"cB","578":"dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T"},D:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","322":"B"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC","322":"mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:4,C:"Resource Hints: preload",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M","1028":"N O"},C:{"1":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB QC RC","132":"dB","578":"eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T"},D:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","322":"B"},F:{"1":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC","322":"pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:4,C:"Resource Hints: preload",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-prerender.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-prerender.js
index f6160c5b3e1841..f013d513fea878 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-prerender.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/link-rel-prerender.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:5,C:"Resource Hints: prerender",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:5,C:"Resource Hints: prerender",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/loading-lazy-attr.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/loading-lazy-attr.js
index 526e16424a9ce9..1389f6bc8b1003 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/loading-lazy-attr.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/loading-lazy-attr.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB NC OC","132":"0 1 2 sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB","66":"sB tB"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB","322":"M I 9B UC VC AC","580":"BC yB WC zB CC DC EC"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB YC ZC aC bC wB IC cC xB","66":"gB hB"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC","322":"tC uC vC wC AC","580":"BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"132":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD","132":"KD"}},B:1,C:"Lazy loading via attribute for images & iframes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB QC RC","132":"0 1 2 3 tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB","66":"tB uB"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB","322":"L G BC XC YC CC","580":"DC 0B ZC 1B EC FC GC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB bC cC dC eC yB LC fC zB","66":"hB iB"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC","322":"wC xC yC zC CC","580":"DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"132":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD","132":"MD"}},B:1,C:"Lazy loading via attribute for images & iframes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/localecompare.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/localecompare.js
index 40fc234c84facb..a8a07deb21fa32 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/localecompare.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/localecompare.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","16":"KC","132":"K F G H A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","132":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC"},D:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 4 5 J K F G H A B C L M I N D O m n o"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","132":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H B C YC ZC aC bC wB IC cC","132":"xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","132":"G 7B dC JC eC fC gC hC iC jC"},H:{"132":"yC"},I:{"1":"E 3C 4C","132":"0B J zC 0C 1C 2C JC"},J:{"132":"F A"},K:{"1":"p","16":"A B C wB IC","132":"xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","132":"A"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","132":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","4":"JD"}},B:6,C:"localeCompare()",D:true};
+module.exports={A:{A:{"1":"B","16":"NC","132":"J D E F A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","132":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC"},D:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 5 6 I J D E F A B C K L G M N O n o p"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","132":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F B C bC cC dC eC yB LC fC","132":"zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","132":"E 9B gC MC hC iC jC kC lC mC"},H:{"132":"1C"},I:{"1":"H 6C 7C","132":"3B I 2C 3C 4C 5C MC"},J:{"132":"D A"},K:{"1":"q","16":"A B C yB LC","132":"zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","132":"A"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","132":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","4":"LD"}},B:6,C:"localeCompare()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/magnetometer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/magnetometer.js
index 6ee2662c0e1aba..b6d2e533d41120 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/magnetometer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/magnetometer.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","194":"eB 1B fB 2B gB hB iB jB kB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"194":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:4,C:"Magnetometer",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","194":"fB 4B gB 5B hB iB jB kB lB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"194":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:4,C:"Magnetometer",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/matchesselector.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/matchesselector.js
index c06495dc16cf08..ac370cee9e7318 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/matchesselector.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/matchesselector.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","36":"H A B"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","36":"C L M"},C:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC","36":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB OC"},D:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","36":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB"},E:{"1":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","36":"3 K F QC RC"},F:{"1":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B YC ZC aC bC wB","36":"4 C I N D O m IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B","36":"dC JC eC fC gC"},H:{"2":"yC"},I:{"1":"E","2":"zC","36":"0B J 0C 1C 2C JC 3C 4C"},J:{"36":"F A"},K:{"1":"p","2":"A B","36":"C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"36":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","36":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"matches() DOM method",D:true};
+module.exports={A:{A:{"2":"J D E NC","36":"F A B"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","36":"C K L"},C:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC","36":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB RC"},D:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","36":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB"},E:{"1":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","36":"4 J D TC UC"},F:{"1":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B bC cC dC eC yB","36":"5 C G M N O n LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B","36":"gC MC hC iC jC"},H:{"2":"1C"},I:{"1":"H","2":"2C","36":"3B I 3C 4C 5C MC 6C 7C"},J:{"36":"D A"},K:{"1":"q","2":"A B","36":"C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"36":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","36":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"matches() DOM method",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/matchmedia.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/matchmedia.js
index 107e5790603d12..5ed6cbdd774299 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/matchmedia.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/matchmedia.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B C YC ZC aC bC wB IC cC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"1":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"matchMedia",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B C bC cC dC eC yB LC fC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"1":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"matchMedia",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mathml.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mathml.js
index 49124a458d8f18..315491422f2722 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mathml.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mathml.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"H A B KC","8":"K F G"},B:{"2":"C L M I N D O","8":"P Q R S T U V W X Y Z a b c d e f","584":"g h i j k l q r s t u v","1025":"0 1 2 w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","129":"LC 0B NC OC"},D:{"1":"6","8":"3 4 5 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f","584":"g h i j k l q r s t u v","1025":"0 1 2 w x y z E 4B 5B 6B"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","260":"3 J K F G H PC 7B QC RC SC TC"},F:{"2":"H","8":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B","584":"S T U V W X Y Z a b c d","1025":"e f g h i j k l","2052":"B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"7B dC JC"},H:{"8":"yC"},I:{"8":"0B J zC 0C 1C 2C JC 3C 4C","1025":"E"},J:{"1":"A","8":"F"},K:{"8":"A B C p wB IC xB"},L:{"1025":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"8":"yB"},P:{"1":"n o","8":"J m 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"8":"9B"},R:{"8":"ID"},S:{"1":"JD KD"}},B:2,C:"MathML",D:true};
+module.exports={A:{A:{"2":"F A B NC","8":"J D E"},B:{"2":"C K L G M N O","8":"P Q R S T U V W X Y Z a b c d e f","584":"g h i j k l m r s t u v","1025":"0 1 2 3 w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","129":"OC 3B QC RC"},D:{"1":"7","8":"4 5 6 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f","584":"g h i j k l m r s t u v","1025":"0 1 2 3 w x y z H xB 7B 8B"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","260":"4 I J D E F SC 9B TC UC VC WC"},F:{"2":"F","8":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B","584":"S T U V W X Y Z a b c d","1025":"e f g h i j k l m","2052":"B C bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"9B gC MC"},H:{"8":"1C"},I:{"8":"3B I 2C 3C 4C 5C MC 6C 7C","1025":"H"},J:{"1":"A","8":"D"},K:{"8":"A B C q yB LC zB"},L:{"1025":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"8":"0B"},P:{"1":"o p","8":"I n 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"8":"BC"},R:{"8":"KD"},S:{"1":"LD MD"}},B:2,C:"MathML",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/maxlength.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/maxlength.js
index 3304dc132ade67..305ca29c2e8a00 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/maxlength.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/maxlength.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","16":"KC","900":"K F G H"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","1025":"C L M I N D O"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","900":"LC 0B NC OC","1025":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 PC","900":"J 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H","132":"B C YC ZC aC bC wB IC cC xB"},G:{"1":"D dC JC eC fC gC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B","2052":"G hC"},H:{"132":"yC"},I:{"1":"0B J 1C 2C JC 3C 4C","16":"zC 0C","4097":"E"},J:{"1":"F A"},K:{"132":"A B C wB IC xB","4097":"p"},L:{"4097":"E"},M:{"4097":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"4097":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1025":"JD KD"}},B:1,C:"maxlength attribute for input and textarea elements",D:true};
+module.exports={A:{A:{"1":"A B","16":"NC","900":"J D E F"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","1025":"C K L G M N O"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","900":"OC 3B QC RC","1025":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 SC","900":"I 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F","132":"B C bC cC dC eC yB LC fC zB"},G:{"1":"gC MC hC iC jC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B","2052":"E kC"},H:{"132":"1C"},I:{"1":"3B I 4C 5C MC 6C 7C","16":"2C 3C","4097":"H"},J:{"1":"D A"},K:{"132":"A B C yB LC zB","4097":"q"},L:{"4097":"H"},M:{"4097":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"4097":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1025":"LD MD"}},B:1,C:"maxlength attribute for input and textarea elements",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-backdrop-pseudo-element.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-backdrop-pseudo-element.js
index eb5a6614b0bc9a..9d5297e6c8cf56 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-backdrop-pseudo-element.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-backdrop-pseudo-element.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB","33":"EB FB GB HB IB"},L:{"1":"E"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","33":"C L M I N D O"},C:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB NC OC"},M:{"1":"E"},A:{"2":"K F G H A KC","33":"B"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C I N D O YC ZC aC bC wB IC cC xB","33":"4 5 m n o"},K:{"1":"p","2":"A B C wB IC xB"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC XC"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","33":"3C 4C"}},B:6,C:"CSS ::backdrop pseudo-element",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB","33":"FB GB HB IB JB"},L:{"1":"H"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","33":"C K L G M N O"},C:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB QC RC"},M:{"1":"xB"},A:{"2":"J D E F A NC","33":"B"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C G M N O bC cC dC eC yB LC fC zB","33":"5 6 n o p"},K:{"1":"q","2":"A B C yB LC zB"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC aC"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","33":"6C 7C"}},B:6,C:"CSS ::backdrop pseudo-element",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-isolate-override.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-isolate-override.js
index f607f82e5d61a1..9160e2c417d735 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-isolate-override.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-isolate-override.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},L:{"1":"E"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N NC OC","33":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB YC ZC aC bC wB IC cC xB"},K:{"1":"p","2":"A B C wB IC xB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC","2":"3 J K PC 7B QC RC XC","33":"F G H A SC TC 8B"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC","33":"G gC hC iC jC kC lC"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"}},B:6,C:"isolate-override from unicode-bidi",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},L:{"1":"H"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M QC RC","33":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB bC cC dC eC yB LC fC zB"},K:{"1":"q","2":"A B C yB LC zB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"4 I J SC 9B TC UC aC","33":"D E F A VC WC AC"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC","33":"E jC kC lC mC nC oC"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"}},B:6,C:"isolate-override from unicode-bidi",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-isolate.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-isolate.js
index 112367945b33c2..8a21c53d83cf11 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-isolate.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-isolate.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I","33":"4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},L:{"1":"E"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H NC OC","33":"4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB"},K:{"1":"p","2":"A B C wB IC xB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC","2":"3 J PC 7B QC XC","33":"K F G H A RC SC TC 8B"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"G fC gC hC iC jC kC lC"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"}},B:6,C:"isolate from unicode-bidi",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G","33":"5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},L:{"1":"H"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F QC RC","33":"5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB"},K:{"1":"q","2":"A B C yB LC zB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"4 I SC 9B TC aC","33":"J D E F A UC VC WC AC"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"E iC jC kC lC mC nC oC"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"}},B:6,C:"isolate from unicode-bidi",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-plaintext.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-plaintext.js
index df685fed0df324..e761fba4e3c339 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-plaintext.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-css-unicode-bidi-plaintext.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},L:{"1":"E"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H NC OC","33":"4 5 6 7 8 9 A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB YC ZC aC bC wB IC cC xB"},K:{"1":"p","2":"A B C wB IC xB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC","2":"3 J PC 7B QC XC","33":"K F G H A RC SC TC 8B"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"G fC gC hC iC jC kC lC"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"}},B:6,C:"plaintext from unicode-bidi",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},L:{"1":"H"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F QC RC","33":"5 6 7 8 9 A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB bC cC dC eC yB LC fC zB"},K:{"1":"q","2":"A B C yB LC zB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"4 I SC 9B TC aC","33":"J D E F A UC VC WC AC"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"E iC jC kC lC mC nC oC"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"}},B:6,C:"plaintext from unicode-bidi",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-color.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-color.js
index b4824f27574e98..1ae4b8311372da 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-color.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-color.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},L:{"1":"E"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC","33":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB YC ZC aC bC wB IC cC xB"},K:{"1":"p","2":"A B C wB IC xB"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC","2":"3 J K F PC 7B QC RC SC XC","33":"G H A B C TC 8B wB"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","33":"G hC iC jC kC lC mC nC oC"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"}},B:6,C:"text-decoration-color property",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},L:{"1":"H"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC","33":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bC cC dC eC yB LC fC zB"},K:{"1":"q","2":"A B C yB LC zB"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"4 I J D SC 9B TC UC VC aC","33":"E F A B C WC AC yB"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","33":"E kC lC mC nC oC pC qC rC"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"}},B:6,C:"text-decoration-color property",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-line.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-line.js
index 9e00a4dec11ee2..436ffe5161fe25 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-line.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-line.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},L:{"1":"E"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC","33":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB YC ZC aC bC wB IC cC xB"},K:{"1":"p","2":"A B C wB IC xB"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC","2":"3 J K F PC 7B QC RC SC XC","33":"G H A B C TC 8B wB"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","33":"G hC iC jC kC lC mC nC oC"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"}},B:6,C:"text-decoration-line property",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},L:{"1":"H"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC","33":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bC cC dC eC yB LC fC zB"},K:{"1":"q","2":"A B C yB LC zB"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"4 I J D SC 9B TC UC VC aC","33":"E F A B C WC AC yB"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","33":"E kC lC mC nC oC pC qC rC"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"}},B:6,C:"text-decoration-line property",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-shorthand.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-shorthand.js
index ea27ca40f4a6bc..8017856588b101 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-shorthand.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-shorthand.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},L:{"1":"E"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB YC ZC aC bC wB IC cC xB"},K:{"1":"p","2":"A B C wB IC xB"},E:{"2":"3 J K F PC 7B QC RC SC XC","33":"G H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC"},G:{"2":"7B dC JC eC fC gC","33":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"}},B:6,C:"text-decoration shorthand property",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},L:{"1":"H"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bC cC dC eC yB LC fC zB"},K:{"1":"q","2":"A B C yB LC zB"},E:{"2":"4 I J D SC 9B TC UC VC aC","33":"E F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC"},G:{"2":"9B gC MC hC iC jC","33":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"}},B:6,C:"text-decoration shorthand property",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-style.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-style.js
index 73303dad0fed59..e451c29202d126 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-style.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mdn-text-decoration-style.js
@@ -1 +1 @@
-module.exports={A:{D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},L:{"1":"E"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC","33":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},M:{"1":"E"},A:{"2":"K F G H A B KC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB YC ZC aC bC wB IC cC xB"},K:{"1":"p","2":"A B C wB IC xB"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC","2":"3 J K F PC 7B QC RC SC XC","33":"G H A B C TC 8B wB"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","33":"G hC iC jC kC lC mC nC oC"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"}},B:6,C:"text-decoration-style property",D:undefined};
+module.exports={A:{D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},L:{"1":"H"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC","33":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},M:{"1":"xB"},A:{"2":"J D E F A B NC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bC cC dC eC yB LC fC zB"},K:{"1":"q","2":"A B C yB LC zB"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC","2":"4 I J D SC 9B TC UC VC aC","33":"E F A B C WC AC yB"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","33":"E kC lC mC nC oC pC qC rC"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"}},B:6,C:"text-decoration-style property",D:undefined};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/media-fragments.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/media-fragments.js
index 1bb3def3182f0f..24484648a4b6f8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/media-fragments.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/media-fragments.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","132":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB NC OC","132":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 J K F G H A B C L M I N D","132":"0 1 2 4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J PC 7B QC","132":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"7B dC JC eC fC gC","132":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","132":"E 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","132":"p"},L:{"132":"E"},M:{"132":"E"},N:{"132":"A B"},O:{"132":"yB"},P:{"2":"J 5C","132":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"132":"9B"},R:{"132":"ID"},S:{"132":"JD KD"}},B:2,C:"Media Fragments",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","132":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB QC RC","132":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 I J D E F A B C K L G M N","132":"0 1 2 3 5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I SC 9B TC","132":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"9B gC MC hC iC jC","132":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","132":"H 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","132":"q"},L:{"132":"H"},M:{"132":"xB"},N:{"132":"A B"},O:{"132":"0B"},P:{"2":"I 8C","132":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"132":"BC"},R:{"132":"KD"},S:{"132":"LD MD"}},B:2,C:"Media Fragments",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediacapture-fromelement.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediacapture-fromelement.js
index 5350c7688c16f8..cbd7158e98c0ec 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediacapture-fromelement.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediacapture-fromelement.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB NC OC","260":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","324":"XB YB ZB aB bB cB dB eB 1B fB 2B"},E:{"2":"3 J K F G H A PC 7B QC RC SC TC 8B","132":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB","324":"IB JB KB LB MB NB OB PB QB RB SB TB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"260":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","132":"5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"260":"JD KD"}},B:5,C:"Media Capture from DOM Elements API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QC RC","260":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","324":"YB ZB aB bB cB dB eB fB 4B gB 5B"},E:{"2":"4 I J D E F A SC 9B TC UC VC WC AC","132":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB","324":"JB KB LB MB NB OB PB QB RB SB TB UB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"260":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","132":"8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"260":"LD MD"}},B:5,C:"Media Capture from DOM Elements API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediarecorder.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediarecorder.js
index 05d689044071c9..05dfca21e62382 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediarecorder.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediarecorder.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB","194":"TB UB"},E:{"1":"I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB","322":"L M xB 9B"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB YC ZC aC bC wB IC cC xB","194":"GB HB"},G:{"1":"D vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC","578":"oC pC qC rC sC tC uC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"MediaRecorder API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB","194":"UB VB"},E:{"1":"G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB","322":"K L zB BC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB bC cC dC eC yB LC fC zB","194":"HB IB"},G:{"1":"yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC","578":"rC sC tC uC vC wC xC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"MediaRecorder API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediasource.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediasource.js
index 17db512c457902..684345daec1ea7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediasource.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mediasource.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","132":"B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 LC 0B J K F G H A B C L M I N D O m n o NC OC","66":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},D:{"1":"0 1 2 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I N","33":"5 6 7 8 9 AB BB CB","66":"4 D O m n o"},E:{"1":"G H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC SC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC","260":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E 4C","2":"0B J zC 0C 1C 2C JC 3C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Media Source Extensions",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","132":"B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 OC 3B I J D E F A B C K L G M N O n o p QC RC","66":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},D:{"1":"0 1 2 3 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G M","33":"6 7 8 9 AB BB CB DB","66":"5 N O n o p"},E:{"1":"E F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC VC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC","260":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H 7C","2":"3B I 2C 3C 4C 5C MC 6C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Media Source Extensions",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/menu.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/menu.js
index 4ae165bb1dc2bb..1a262d697c8679 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/menu.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/menu.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 LC 0B J K F NC OC","132":"4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T","450":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","66":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","66":"HB IB JB KB LB MB NB OB PB QB RB SB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"450":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Context menu item (menuitem element)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 OC 3B I J D QC RC","132":"5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T","450":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","66":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","66":"IB JB KB LB MB NB OB PB QB RB SB TB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"450":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Context menu item (menuitem element)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/meta-theme-color.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/meta-theme-color.js
index a087935d67a46f..15b653c1df6f13 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/meta-theme-color.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/meta-theme-color.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB","132":"0 1 2 p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","258":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B UC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"513":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","16":"5C"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:1,C:"theme-color Meta Tag",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB","132":"0 1 2 3 q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","258":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC XC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"513":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","16":"8C"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:1,C:"theme-color Meta Tag",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/meter.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/meter.js
index 0faa96c543bc58..fb14a86d0e5ba9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/meter.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/meter.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H YC ZC aC bC"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"meter element",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F bC cC dC eC"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"meter element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/midi.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/midi.js
index 46434d6c23b628..33f4f3232fab9f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/midi.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/midi.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u NC OC"},D:{"1":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:5,C:"Web MIDI API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u QC RC"},D:{"1":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:5,C:"Web MIDI API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/minmaxwh.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/minmaxwh.js
index b66ad3a0a452ef..b01d1b422bdf11 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/minmaxwh.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/minmaxwh.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","8":"K KC","129":"F","257":"G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS min/max-width/height",D:true};
+module.exports={A:{A:{"1":"F A B","8":"J NC","129":"D","257":"E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS min/max-width/height",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mp3.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mp3.js
index f043cf8193de2f..c538e47c13f1cc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mp3.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mp3.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","132":"3 4 J K F G H A B C L M I N D O m n NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","2":"zC 0C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"MP3 audio format",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","132":"4 5 I J D E F A B C K L G M N O n o QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","2":"2C 3C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"MP3 audio format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mpeg-dash.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mpeg-dash.js
index 2f4245d245365e..3bd7163e2331a4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mpeg-dash.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mpeg-dash.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"C L M I N D O","2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","386":"n o"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"Dynamic Adaptive Streaming over HTTP (MPEG-DASH)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"C K L G M N O","2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","386":"o p"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"Dynamic Adaptive Streaming over HTTP (MPEG-DASH)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mpeg4.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mpeg4.js
index 6e421435d0a55c..71cf15f36d9c41 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mpeg4.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mpeg4.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m NC OC","4":"5 6 7 8 9 n o AB BB CB DB EB FB GB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E 3C 4C","4":"0B J zC 0C 2C JC","132":"1C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"260":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"MPEG-4/H.264 video format",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n QC RC","4":"6 7 8 9 o p AB BB CB DB EB FB GB HB"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H 6C 7C","4":"3B I 2C 3C 5C MC","132":"4C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"260":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"MPEG-4/H.264 video format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/multibackgrounds.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/multibackgrounds.js
index e2df03269c9c9e..58c7f942209483 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/multibackgrounds.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/multibackgrounds.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","2":"LC 0B NC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 Multiple backgrounds",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","2":"OC 3B QC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 Multiple backgrounds",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/multicolumn.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/multicolumn.js
index 8ea6cc88b5fb00..3155b43aae6e61 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/multicolumn.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/multicolumn.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"C L M I N D O","516":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"132":"YB ZB aB bB cB dB eB 1B fB 2B gB hB iB","164":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB NC OC","516":"jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a","1028":"0 1 2 b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"420":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","516":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","132":"H TC","164":"F G SC","420":"3 J K PC 7B QC RC"},F:{"1":"C wB IC cC xB","2":"H B YC ZC aC bC","420":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB","516":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","132":"iC jC","164":"G gC hC","420":"7B dC JC eC fC"},H:{"1":"yC"},I:{"420":"0B J zC 0C 1C 2C JC 3C 4C","516":"E"},J:{"420":"F A"},K:{"1":"C wB IC xB","2":"A B","516":"p"},L:{"516":"E"},M:{"1028":"E"},N:{"1":"A B"},O:{"516":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","420":"J"},Q:{"516":"9B"},R:{"516":"ID"},S:{"164":"JD KD"}},B:4,C:"CSS3 Multiple column layout",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"C K L G M N O","516":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"132":"ZB aB bB cB dB eB fB 4B gB 5B hB iB jB","164":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB QC RC","516":"kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a","1028":"0 1 2 3 b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"420":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","516":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","132":"F WC","164":"D E VC","420":"4 I J SC 9B TC UC"},F:{"1":"C yB LC fC zB","2":"F B bC cC dC eC","420":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB","516":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","132":"lC mC","164":"E jC kC","420":"9B gC MC hC iC"},H:{"1":"1C"},I:{"420":"3B I 2C 3C 4C 5C MC 6C 7C","516":"H"},J:{"420":"D A"},K:{"1":"C yB LC zB","2":"A B","516":"q"},L:{"516":"H"},M:{"1028":"xB"},N:{"1":"A B"},O:{"516":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","420":"I"},Q:{"516":"BC"},R:{"516":"KD"},S:{"164":"LD MD"}},B:4,C:"CSS3 Multiple column layout",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mutation-events.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mutation-events.js
index a214a90b7f19f4..222814e4e15e80 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mutation-events.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mutation-events.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","260":"H A B"},B:{"132":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I N D O"},C:{"2":"3 LC 0B J NC OC","260":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"16":"3 J K F G H A B C L M","132":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"16":"PC 7B","132":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"C cC xB","2":"H YC ZC aC bC","16":"B wB IC","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"16":"7B dC","132":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"16":"zC 0C","132":"0B J E 1C 2C JC 3C 4C"},J:{"132":"F A"},K:{"1":"C xB","2":"A","16":"B wB IC","132":"p"},L:{"132":"E"},M:{"260":"E"},N:{"260":"A B"},O:{"132":"yB"},P:{"132":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"132":"9B"},R:{"132":"ID"},S:{"260":"JD KD"}},B:5,C:"Mutation events",D:true};
+module.exports={A:{A:{"2":"J D E NC","260":"F A B"},B:{"132":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G M N O"},C:{"2":"4 OC 3B I QC RC","260":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"16":"4 I J D E F A B C K L","132":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"16":"SC 9B","132":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"C fC zB","2":"F bC cC dC eC","16":"B yB LC","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"16":"9B gC","132":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"16":"2C 3C","132":"3B I H 4C 5C MC 6C 7C"},J:{"132":"D A"},K:{"1":"C zB","2":"A","16":"B yB LC","132":"q"},L:{"132":"H"},M:{"260":"xB"},N:{"260":"A B"},O:{"132":"0B"},P:{"132":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"132":"BC"},R:{"132":"KD"},S:{"260":"LD MD"}},B:5,C:"Mutation events",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mutationobserver.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mutationobserver.js
index 3d4c2678603bd5..90ab33ead43409 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mutationobserver.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/mutationobserver.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G KC","8":"H A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L NC OC"},D:{"1":"0 1 2 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I N D","33":"4 5 6 7 8 O m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","33":"K"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B zC 0C 1C","8":"J 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","8":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Mutation Observer",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E NC","8":"F A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K QC RC"},D:{"1":"0 1 2 3 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G M N","33":"5 6 7 8 9 O n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","33":"J"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B 2C 3C 4C","8":"I 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","8":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Mutation Observer",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/namevalue-storage.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/namevalue-storage.js
index 6b1ac76a508fd5..76759e9a5786ad 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/namevalue-storage.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/namevalue-storage.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","2":"KC","8":"K F"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","4":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Web Storage - name/value pairs",D:true};
+module.exports={A:{A:{"1":"E F A B","2":"NC","8":"J D"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","4":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Web Storage - name/value pairs",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/native-filesystem-api.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/native-filesystem-api.js
index 3001cdfae7e763..5755d16b39e80d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/native-filesystem-api.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/native-filesystem-api.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","194":"P Q R S T U","260":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x NC OC","516":"0 1 2 y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p","194":"rB sB tB uB vB P Q R S T U","260":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC","516":"D AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB YC ZC aC bC wB IC cC xB","194":"gB hB iB jB kB lB mB nB oB pB","260":"qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC","516":"D AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","516":"E"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"516":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"File System Access API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","194":"P Q R S T U","260":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x QC RC","516":"0 1 2 3 y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q","194":"sB tB uB vB wB P Q R S T U","260":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC","516":"CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB bC cC dC eC yB LC fC zB","194":"hB iB jB kB lB mB nB oB pB qB","260":"rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC","516":"CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","516":"H"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"516":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"File System Access API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/nav-timing.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/nav-timing.js
index 9b12f94060bf61..b9a6cb19fb9bf9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/nav-timing.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/nav-timing.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J","33":"K F G H A B C"},E:{"1":"G H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC SC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"J E 2C JC 3C 4C","2":"0B zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Navigation Timing API",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I","33":"J D E F A B C"},E:{"1":"E F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC VC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"I H 5C MC 6C 7C","2":"3B 2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Navigation Timing API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/netinfo.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/netinfo.js
index 898119bb5e25c4..a4a73b6238b461 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/netinfo.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/netinfo.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","1028":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB","1028":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB YC ZC aC bC wB IC cC xB","1028":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"zC 3C 4C","132":"0B J 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","132":"J","516":"5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"KD","260":"JD"}},B:7,C:"Network Information API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","1028":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB","1028":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB bC cC dC eC yB LC fC zB","1028":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"2C 6C 7C","132":"3B I 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","132":"I","516":"8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"MD","260":"LD"}},B:7,C:"Network Information API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/notifications.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/notifications.js
index a45ff5670b632f..b3b9f8adad9849 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/notifications.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/notifications.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC"},D:{"1":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J","36":"3 4 K F G H A B C L M I N D O m n"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC","516":"D FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","36":"E 3C 4C"},J:{"1":"A","2":"F"},K:{"2":"A B C wB IC xB","36":"p"},L:{"257":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"36":"J","130":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"130":"ID"},S:{"1":"JD KD"}},B:1,C:"Web Notifications",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC"},D:{"1":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I","36":"4 5 J D E F A B C K L G M N O n o"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC","516":"HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","36":"H 6C 7C"},J:{"1":"A","2":"D"},K:{"2":"A B C yB LC zB","36":"q"},L:{"257":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"36":"I","130":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"130":"KD"},S:{"1":"LD MD"}},B:1,C:"Web Notifications",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-entries.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-entries.js
index 492ab9548ab39f..e221693264aec4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-entries.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-entries.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB NC OC"},D:{"1":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","16":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Object.entries",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB QC RC"},D:{"1":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","16":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Object.entries",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-fit.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-fit.js
index 0aa42d3686271c..1f6fd696fc78d3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-fit.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-fit.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I","260":"N D O"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB NC OC"},D:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC","132":"G H SC TC"},F:{"1":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H I N D O YC ZC aC","33":"B C bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","132":"G hC iC jC"},H:{"33":"yC"},I:{"1":"E 4C","2":"0B J zC 0C 1C 2C JC 3C"},J:{"2":"F A"},K:{"1":"p","2":"A","33":"B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 object-fit/object-position",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G","260":"M N O"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB QC RC"},D:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC","132":"E F VC WC"},F:{"1":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F G M N O bC cC dC","33":"B C eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","132":"E kC lC mC"},H:{"33":"1C"},I:{"1":"H 7C","2":"3B I 2C 3C 4C 5C MC 6C"},J:{"2":"D A"},K:{"1":"q","2":"A","33":"B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 object-fit/object-position",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-observe.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-observe.js
index 4e9a13ef49265d..b8efa4bacf6be0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-observe.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-observe.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB","2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB","2":"4 H B C I N D O m n o JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"J","2":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Object.observe data binding",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB","2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB","2":"5 F B C G M N O n o p KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"I","2":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Object.observe data binding",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-values.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-values.js
index f2571e97eff624..2b47f200156cb3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-values.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/object-values.js
@@ -1 +1 @@
-module.exports={A:{A:{"8":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB NC OC"},D:{"1":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","8":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","8":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"8":"yC"},I:{"1":"E","8":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"8":"F A"},K:{"1":"p","8":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"8":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","8":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Object.values method",D:true};
+module.exports={A:{A:{"8":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB QC RC"},D:{"1":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","8":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","8":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"8":"1C"},I:{"1":"H","8":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"8":"D A"},K:{"1":"q","8":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"8":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","8":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Object.values method",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/objectrtc.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/objectrtc.js
index bc2e76d52cc0ff..3dd017e958bbd3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/objectrtc.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/objectrtc.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"L M I N D O","2":"0 1 2 C P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"Object RTC (ORTC) API for WebRTC",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"K L G M N O","2":"0 1 2 3 C P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"Object RTC (ORTC) API for WebRTC",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/offline-apps.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/offline-apps.js
index c3ab625a0b7159..2d107541d6ea9f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/offline-apps.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/offline-apps.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"H KC","8":"K F G"},B:{"1":"C L M I N D O P Q R S T","2":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S NC OC","2":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","4":"0B","8":"LC"},D:{"1":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T","2":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB bC wB IC cC xB","2":"H p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC","8":"ZC aC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J zC 0C 1C 2C JC 3C 4C","2":"E"},J:{"1":"F A"},K:{"1":"B C wB IC xB","2":"A p"},L:{"2":"E"},M:{"2":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"2":"ID"},S:{"1":"JD","2":"KD"}},B:7,C:"Offline web applications",D:true};
+module.exports={A:{A:{"1":"A B","2":"F NC","8":"J D E"},B:{"1":"C K L G M N O P Q R S T","2":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S QC RC","2":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","4":"3B","8":"OC"},D:{"1":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T","2":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB eC yB LC fC zB","2":"F q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC","8":"cC dC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I 2C 3C 4C 5C MC 6C 7C","2":"H"},J:{"1":"D A"},K:{"1":"B C yB LC zB","2":"A q"},L:{"2":"H"},M:{"2":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"2":"KD"},S:{"1":"LD","2":"MD"}},B:7,C:"Offline web applications",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/offscreencanvas.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/offscreencanvas.js
index d84e2e454a3c5c..50aae6341fd809 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/offscreencanvas.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/offscreencanvas.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB NC OC","194":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r"},D:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","322":"eB 1B fB 2B gB hB iB jB kB lB mB"},E:{"1":"D XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC","516":"DC EC FC GC HC"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB YC ZC aC bC wB IC cC xB","322":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB"},G:{"1":"D","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC","516":"DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"194":"JD KD"}},B:1,C:"OffscreenCanvas",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB QC RC","194":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r"},D:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","322":"fB 4B gB 5B hB iB jB kB lB mB nB"},E:{"1":"2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC","516":"FC GC HC IC JC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB bC cC dC eC yB LC fC zB","322":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB"},G:{"1":"2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC","516":"FC GC HC IC JC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"194":"LD MD"}},B:1,C:"OffscreenCanvas",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ogg-vorbis.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ogg-vorbis.js
index b7c450a12b2d6b..03f78c1ab8555e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ogg-vorbis.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ogg-vorbis.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B","132":"I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"A","2":"F"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Ogg Vorbis audio format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC","132":"G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"A","2":"D"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Ogg Vorbis audio format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ogv.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ogv.js
index a5dfc20b5e587a..6ffa310ce36742 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ogv.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ogv.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","8":"H A B"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","8":"C L M I N"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"1":"E"},N:{"8":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"2":"ID"},S:{"1":"JD KD"}},B:6,C:"Ogg/Theora video format",D:true};
+module.exports={A:{A:{"2":"J D E NC","8":"F A B"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","8":"C K L G M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"1":"xB"},N:{"8":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"2":"KD"},S:{"1":"LD MD"}},B:6,C:"Ogg/Theora video format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ol-reversed.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ol-reversed.js
index 4955f1f2775573..d31b378fb1f1ef 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ol-reversed.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ol-reversed.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N D NC OC"},D:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I","16":"4 N D O"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","16":"K"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC","16":"C"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Reversed attribute of ordered lists",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M N QC RC"},D:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G","16":"5 M N O"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","16":"J"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC","16":"C"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Reversed attribute of ordered lists",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/once-event-listener.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/once-event-listener.js
index 2bf203242eab1f..ae1ae6967e45eb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/once-event-listener.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/once-event-listener.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I"},C:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB NC OC"},D:{"1":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"\"once\" event listener option",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G"},C:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB QC RC"},D:{"1":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"\"once\" event listener option",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/online-status.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/online-status.js
index 4d93e56d4d0e87..3c0117c14f85e4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/online-status.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/online-status.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F KC","260":"G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B","516":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB"},D:{"1":"0 1 2 4 5 6 7 8 9 M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L"},E:{"1":"3 K G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","1025":"F"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC","4":"xB"},G:{"1":"G D JC eC fC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC","1025":"gC"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"A","132":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Online/offline status",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D NC","260":"E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B","516":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},D:{"1":"0 1 2 3 5 6 7 8 9 L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K"},E:{"1":"4 J E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","1025":"D"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC","4":"zB"},G:{"1":"E MC hC iC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC","1025":"jC"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"A","132":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Online/offline status",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/opus.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/opus.js
index 74bc59dcbf07f8..ad3bdc2f146d51 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/opus.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/opus.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M NC OC"},D:{"1":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB"},E:{"2":"3 J K F G H A PC 7B QC RC SC TC 8B","132":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC","132":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Opus audio format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L QC RC"},D:{"1":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB"},E:{"2":"4 I J D E F A SC 9B TC UC VC WC AC","132":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC","132":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Opus audio format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/orientation-sensor.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/orientation-sensor.js
index fd8404645868c6..c3d6b68c753aeb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/orientation-sensor.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/orientation-sensor.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","194":"eB 1B fB 2B gB hB iB jB kB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:4,C:"Orientation Sensor",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","194":"fB 4B gB 5B hB iB jB kB lB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:4,C:"Orientation Sensor",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/outline.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/outline.js
index d67809cdf858b5..824c6a68b08d77 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/outline.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/outline.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F KC","260":"G","388":"H A B"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","388":"C L M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC","129":"xB","260":"H B YC ZC aC bC wB IC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"C p xB","260":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"388":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS outline properties",D:true};
+module.exports={A:{A:{"2":"J D NC","260":"E","388":"F A B"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","388":"C K L"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC","129":"zB","260":"F B bC cC dC eC yB LC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"C q zB","260":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"388":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS outline properties",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pad-start-end.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pad-start-end.js
index d59f7d56c1c5d9..bf4cf994a2db31 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pad-start-end.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pad-start-end.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M"},C:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB NC OC"},D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"String.prototype.padStart(), String.prototype.padEnd()",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L"},C:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB QC RC"},D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"String.prototype.padStart(), String.prototype.padEnd()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/page-transition-events.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/page-transition-events.js
index 8228cdb370d1ba..f7fcad9937f267 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/page-transition-events.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/page-transition-events.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"PageTransitionEvent",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"PageTransitionEvent",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pagevisibility.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pagevisibility.js
index 84463c4f285652..4b070de3d9d334 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pagevisibility.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pagevisibility.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H NC OC","33":"A B C L M I N D"},D:{"1":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L","33":"4 5 6 7 8 9 M I N D O m n o AB BB CB DB EB"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC"},F:{"1":"5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B C YC ZC aC bC wB IC cC","33":"4 I N D O"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","33":"3C 4C"},J:{"1":"A","2":"F"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","33":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Page Visibility",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F QC RC","33":"A B C K L G M N"},D:{"1":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K","33":"5 6 7 8 9 L G M N O n o p AB BB CB DB EB FB"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC"},F:{"1":"6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B C bC cC dC eC yB LC fC","33":"5 G M N O"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","33":"6C 7C"},J:{"1":"A","2":"D"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","33":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Page Visibility",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passive-event-listener.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passive-event-listener.js
index d61b19f9401584..dfa925daea6125 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passive-event-listener.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passive-event-listener.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB NC OC"},D:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"Passive event listeners",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB QC RC"},D:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"Passive event listeners",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passkeys.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passkeys.js
index f310cb2a68b4cf..a181e03ff77a7d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passkeys.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passkeys.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u"},E:{"1":"D CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB"},F:{"1":"g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f YC ZC aC bC wB IC cC xB"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"n o","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","16":"m"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"Passkeys",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u"},E:{"1":"EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B"},F:{"1":"g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f bC cC dC eC yB LC fC zB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"o p","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","16":"n"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"Passkeys",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passwordrules.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passwordrules.js
index d81b7c0ff3cae0..31386b1dc6b4d7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passwordrules.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/passwordrules.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","16":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B NC OC","16":"5B 6B MC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"4B 5B 6B"},E:{"1":"C L xB","2":"3 J K F G H A B PC 7B QC RC SC TC 8B wB","16":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB YC ZC aC bC wB IC cC xB","16":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"16":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","16":"E"},J:{"2":"F","16":"A"},K:{"2":"A B C wB IC xB","16":"p"},L:{"16":"E"},M:{"16":"E"},N:{"2":"A","16":"B"},O:{"16":"yB"},P:{"2":"J 5C 6C","16":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"16":"9B"},R:{"16":"ID"},S:{"2":"JD KD"}},B:1,C:"Password Rules",D:false};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","16":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB QC RC","16":"7B 8B PC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"xB 7B 8B"},E:{"1":"C K zB","2":"4 I J D E F A B SC 9B TC UC VC WC AC yB","16":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB bC cC dC eC yB LC fC zB","16":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"16":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","16":"H"},J:{"2":"D","16":"A"},K:{"2":"A B C yB LC zB","16":"q"},L:{"16":"H"},M:{"16":"xB"},N:{"2":"A","16":"B"},O:{"16":"0B"},P:{"2":"I 8C 9C","16":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"16":"BC"},R:{"16":"KD"},S:{"2":"LD MD"}},B:1,C:"Password Rules",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/path2d.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/path2d.js
index c78c2674480758..435d32d0e046cb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/path2d.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/path2d.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L","132":"M I N D O"},C:{"1":"0 1 2 UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB NC OC","132":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},D:{"1":"0 1 2 mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB","132":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC RC","132":"G H SC"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n o YC ZC aC bC wB IC cC xB","132":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","16":"G","132":"hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","132":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Path2D",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K","132":"L G M N O"},C:{"1":"0 1 2 3 VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB QC RC","132":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},D:{"1":"0 1 2 3 nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB","132":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC UC","132":"E F VC"},F:{"1":"cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o p bC cC dC eC yB LC fC zB","132":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","16":"E","132":"kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","132":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Path2D",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/payment-request.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/payment-request.js
index 94744451b8ba97..c1df3bf1c50222 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/payment-request.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/payment-request.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L","322":"M","8196":"I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB NC OC","4162":"bB cB dB eB 1B fB 2B gB hB iB jB","16452":"0 1 2 kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","194":"ZB aB bB cB dB eB","1090":"1B fB","8196":"2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC","514":"A B 8B","8196":"C wB"},F:{"1":"kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB YC ZC aC bC wB IC cC xB","194":"MB NB OB PB QB RB SB TB","8196":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC","514":"kC lC mC","8196":"nC oC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"2049":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o BD CD DD ED zB FD GD HD","2":"J","8196":"5C 6C 7C 8C 9C 8B AD"},Q:{"8196":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:2,C:"Payment Request API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K","322":"L","8196":"G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB QC RC","4162":"cB dB eB fB 4B gB 5B hB iB jB kB","16452":"0 1 2 3 lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","194":"aB bB cB dB eB fB","1090":"4B gB","8196":"5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC","514":"A B AC","8196":"C yB"},F:{"1":"lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB bC cC dC eC yB LC fC zB","194":"NB OB PB QB RB SB TB UB","8196":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC","514":"nC oC pC","8196":"qC rC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"2049":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p ED FD GD HD 1B 2B ID JD","2":"I","8196":"8C 9C AD BD CD AC DD"},Q:{"8196":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:2,C:"Payment Request API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pdf-viewer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pdf-viewer.js
index 8b55ec6eac530e..0e1aa5af304647 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pdf-viewer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pdf-viewer.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","132":"B"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"C L M"},C:{"1":"0 1 2 4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N D O NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"16":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"Built-in PDF viewer",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","132":"B"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"C K L"},C:{"1":"0 1 2 3 5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M N O QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"16":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"Built-in PDF viewer",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/permissions-api.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/permissions-api.js
index c7e32d6620d234..9a9380ae1d520b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/permissions-api.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/permissions-api.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB NC OC"},D:{"1":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB YC ZC aC bC wB IC cC xB"},G:{"1":"D zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Permissions API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB QC RC"},D:{"1":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB bC cC dC eC yB LC fC zB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Permissions API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/permissions-policy.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/permissions-policy.js
index f878c73da6327a..a36922d23e2505 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/permissions-policy.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/permissions-policy.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","258":"P Q R S T U","322":"V W","388":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p NC OC","258":"0 1 2 rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B","258":"fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U","322":"V W","388":"0 1 2 X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B PC 7B QC RC SC TC 8B","258":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB YC ZC aC bC wB IC cC xB","258":"TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB","322":"qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d","388":"e f g h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC","258":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","258":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","388":"p"},L:{"388":"E"},M:{"258":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J 5C 6C 7C","258":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"258":"9B"},R:{"388":"ID"},S:{"2":"JD","258":"KD"}},B:5,C:"Permissions Policy",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","258":"P Q R S T U","322":"V W","388":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q QC RC","258":"0 1 2 3 sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B","258":"gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U","322":"V W","388":"0 1 2 3 X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B SC 9B TC UC VC WC AC","258":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB bC cC dC eC yB LC fC zB","258":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB","322":"rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d","388":"e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC","258":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","258":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","388":"q"},L:{"388":"H"},M:{"258":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I 8C 9C AD","258":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"258":"BC"},R:{"388":"KD"},S:{"2":"LD","258":"MD"}},B:5,C:"Permissions Policy",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/picture-in-picture.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/picture-in-picture.js
index 1385ee35624768..ce21c8d9a0ab02 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/picture-in-picture.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/picture-in-picture.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB NC OC","132":"0 1 2 qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","1090":"lB","1412":"pB","1668":"mB nB oB"},D:{"1":"0 1 2 oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB","2114":"nB"},E:{"1":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC","4100":"A B C L 8B wB xB"},F:{"1":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB YC ZC aC bC wB IC cC xB","8196":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB"},G:{"1":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC","4100":"iC jC kC lC mC nC oC pC qC rC sC tC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"16388":"E"},M:{"16388":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"Picture-in-Picture",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB QC RC","132":"0 1 2 3 rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","1090":"mB","1412":"qB","1668":"nB oB pB"},D:{"1":"0 1 2 3 pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB","2114":"oB"},E:{"1":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC","4100":"A B C K AC yB zB"},F:{"1":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB bC cC dC eC yB LC fC zB","8196":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB"},G:{"1":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC","4100":"lC mC nC oC pC qC rC sC tC uC vC wC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"16388":"H"},M:{"16388":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"Picture-in-Picture",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/picture.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/picture.js
index de321138a88556..125cf17ae2f4f9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/picture.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/picture.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB NC OC","578":"GB HB IB JB"},D:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB","194":"JB"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 H B C I N D O m n o YC ZC aC bC wB IC cC xB","322":"6"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Picture element",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB QC RC","578":"HB IB JB KB"},D:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB","194":"KB"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 F B C G M N O n o p bC cC dC eC yB LC fC zB","322":"7"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Picture element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ping.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ping.js
index ad707c1f90cc5c..8121c1987af97f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ping.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ping.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N"},C:{"2":"LC","194":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"194":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"194":"JD KD"}},B:1,C:"Ping attribute",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M"},C:{"2":"OC","194":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"194":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"194":"LD MD"}},B:1,C:"Ping attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/png-alpha.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/png-alpha.js
index b7ff926ff5e074..bdfc40895f9f17 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/png-alpha.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/png-alpha.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"F G H A B","2":"KC","8":"K"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"PNG alpha transparency",D:true};
+module.exports={A:{A:{"1":"D E F A B","2":"NC","8":"J"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"PNG alpha transparency",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointer-events.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointer-events.js
index 9d5068588d3a22..740caf91a64b97 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointer-events.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointer-events.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","2":"LC 0B NC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:7,C:"CSS pointer-events (for HTML)",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","2":"OC 3B QC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:7,C:"CSS pointer-events (for HTML)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointer.js
index 517ddd1507a8fa..336e72cf6a1283 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointer.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H KC","164":"A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC","8":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB","328":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB"},D:{"1":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m n","8":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","584":"YB ZB aB"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC","8":"F G H A B C RC SC TC 8B wB","1096":"xB"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","8":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB","584":"LB MB NB"},G:{"1":"D rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC","6148":"qC"},H:{"2":"yC"},I:{"1":"E","8":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"8":"F A"},K:{"1":"p","2":"A","8":"B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","36":"A"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"5C","8":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","328":"JD"}},B:2,C:"Pointer events",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F NC","164":"A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC","8":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB","328":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB"},D:{"1":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n o","8":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","584":"ZB aB bB"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC","8":"D E F A B C UC VC WC AC yB","1096":"zB"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","8":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB","584":"MB NB OB"},G:{"1":"uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC","6148":"tC"},H:{"2":"1C"},I:{"1":"H","8":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"8":"D A"},K:{"1":"q","2":"A","8":"B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","36":"A"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"8C","8":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","328":"LD"}},B:2,C:"Pointer events",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointerlock.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointerlock.js
index f26b0330053985..95527c5ea7ba12 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointerlock.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/pointerlock.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C"},C:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L NC OC","33":"4 5 6 7 8 9 M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB"},D:{"1":"0 1 2 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I","33":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB","66":"4 N D O m n"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 I N D O m n o"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Pointer Lock API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C"},C:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K QC RC","33":"5 6 7 8 9 L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},D:{"1":"0 1 2 3 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G","33":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB","66":"5 M N O n o"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 G M N O n o p"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Pointer Lock API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/portals.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/portals.js
index 188e0b733e4a3d..b8e61c954c2bb3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/portals.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/portals.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O P Q R S T","322":"0 1 2 Z a b c d e f g h i j k l q r s t u v w x y z E","450":"U V W X Y"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB","194":"sB tB uB vB P Q R S T","322":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","450":"U"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB YC ZC aC bC wB IC cC xB","194":"gB hB iB jB kB lB mB nB oB pB qB","322":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"450":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Portals",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O P Q R S T","322":"0 1 2 3 Z a b c d e f g h i j k l m r s t u v w x y z H","450":"U V W X Y"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB","194":"tB uB vB wB P Q R S T","322":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","450":"U"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB bC cC dC eC yB LC fC zB","194":"hB iB jB kB lB mB nB oB pB qB rB","322":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"450":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Portals",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/prefers-color-scheme.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/prefers-color-scheme.js
index 194f698507fb83..bee23c0157896e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/prefers-color-scheme.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/prefers-color-scheme.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB NC OC"},D:{"1":"0 1 2 tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB"},E:{"1":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB"},F:{"1":"gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB YC ZC aC bC wB IC cC xB"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"prefers-color-scheme media query",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB QC RC"},D:{"1":"0 1 2 3 uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB"},E:{"1":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB"},F:{"1":"hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB bC cC dC eC yB LC fC zB"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"prefers-color-scheme media query",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/prefers-reduced-motion.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/prefers-reduced-motion.js
index 835846479ecf13..d8c913aa5a3eb0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/prefers-reduced-motion.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/prefers-reduced-motion.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB NC OC"},D:{"1":"0 1 2 rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"prefers-reduced-motion media query",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB QC RC"},D:{"1":"0 1 2 3 sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"prefers-reduced-motion media query",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/progress.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/progress.js
index 5433de3f63d68b..65bdc3dc089ded 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/progress.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/progress.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H YC ZC aC bC"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC","132":"gC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"progress element",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F bC cC dC eC"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC","132":"jC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"progress element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/promise-finally.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/promise-finally.js
index 5ee73294229ce9..80702120b6e3b8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/promise-finally.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/promise-finally.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D"},C:{"1":"0 1 2 eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB NC OC"},D:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"Promise.prototype.finally",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N"},C:{"1":"0 1 2 3 fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB QC RC"},D:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"Promise.prototype.finally",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/promises.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/promises.js
index 5892996eaa52f8..a33826ab81d477 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/promises.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/promises.js
@@ -1 +1 @@
-module.exports={A:{A:{"8":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","4":"9 AB","8":"3 4 5 6 7 8 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"EB","8":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB"},E:{"1":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"3 J K F PC 7B QC RC"},F:{"1":"5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","4":"4","8":"H B C I N D O YC ZC aC bC wB IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"7B dC JC eC fC gC"},H:{"8":"yC"},I:{"1":"E 4C","8":"0B J zC 0C 1C 2C JC 3C"},J:{"8":"F A"},K:{"1":"p","8":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"8":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Promises",D:true};
+module.exports={A:{A:{"8":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","4":"AB BB","8":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"FB","8":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB"},E:{"1":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"4 I J D SC 9B TC UC"},F:{"1":"6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","4":"5","8":"F B C G M N O bC cC dC eC yB LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"9B gC MC hC iC jC"},H:{"8":"1C"},I:{"1":"H 7C","8":"3B I 2C 3C 4C 5C MC 6C"},J:{"8":"D A"},K:{"1":"q","8":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"8":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Promises",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/proximity.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/proximity.js
index 10edb8a89b7b3b..a7d947d947bfcc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/proximity.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/proximity.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"JD KD"}},B:4,C:"Proximity API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"LD MD"}},B:4,C:"Proximity API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/proxy.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/proxy.js
index 5ca0b181171c83..4960dab400cd28 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/proxy.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/proxy.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N D NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I N D O KB LB MB NB OB PB QB RB SB TB UB","66":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"7 8 9 H B C AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB","66":"4 5 6 I N D O m n o"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Proxy object",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M N QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G M N O LB MB NB OB PB QB RB SB TB UB VB","66":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"8 9 F B C AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB","66":"5 6 7 G M N O n o p"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Proxy object",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/publickeypinning.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/publickeypinning.js
index 601a8bda1262cc..23da88e6b312a9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/publickeypinning.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/publickeypinning.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB","2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB","2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB","2":"4 H B C I N D O kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","4":"5","16":"6 m n o"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"J 5C 6C 7C 8C 9C 8B","2":"m n o AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"JD","2":"KD"}},B:6,C:"HTTP Public Key Pinning",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB","2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB","2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB","2":"5 F B C G M N O lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","4":"6","16":"7 n o p"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"I 8C 9C AD BD CD AC","2":"n o p DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"LD","2":"MD"}},B:6,C:"HTTP Public Key Pinning",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/push-api.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/push-api.js
index eec4e108f24e26..2364b50b606417 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/push-api.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/push-api.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"D O","2":"C L M I N","257":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB NC OC","257":"0 1 2 QB SB TB UB VB WB XB ZB aB bB cB dB eB 1B 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","1281":"RB YB fB"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","257":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","388":"QB RB SB TB UB VB"},E:{"2":"3 J K PC 7B QC RC","514":"F G H A B C L M I SC TC 8B wB xB 9B UC VC AC BC yB WC zB","2564":"D CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB YC ZC aC bC wB IC cC xB","16":"JB KB LB MB NB","257":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC","4100":"D FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"2":"ID"},S:{"257":"JD KD"}},B:5,C:"Push API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"N O","2":"C K L G M","257":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB QC RC","257":"0 1 2 3 RB TB UB VB WB XB YB aB bB cB dB eB fB 4B 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","1281":"SB ZB gB"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB","257":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","388":"RB SB TB UB VB WB"},E:{"2":"4 I J SC 9B TC UC","514":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B","2564":"EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB bC cC dC eC yB LC fC zB","16":"KB LB MB NB OB","257":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC","4100":"HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"2":"KD"},S:{"257":"LD MD"}},B:5,C:"Push API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/queryselector.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/queryselector.js
index c1508d2f0efc63..a00aa9342a49c1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/queryselector.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/queryselector.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"KC","8":"K F","132":"G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","8":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","8":"H YC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"querySelector/querySelectorAll",D:true};
+module.exports={A:{A:{"1":"F A B","2":"NC","8":"J D","132":"E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","8":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","8":"F bC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"querySelector/querySelectorAll",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/readonly-attr.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/readonly-attr.js
index e75a31cad5cf91..7fc7a4a26be33c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/readonly-attr.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/readonly-attr.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","16":"KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC 0B NC OC"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 4 5 6 7 J K F G H A B C L M I N D O m n o"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H YC","132":"B C ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC fC"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"p","132":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"257":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"readonly attribute of input and textarea elements",D:true};
+module.exports={A:{A:{"1":"J D E F A B","16":"NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC 3B QC RC"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 5 6 7 8 I J D E F A B C K L G M N O n o p"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F bC","132":"B C cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC iC"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"q","132":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"257":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"readonly attribute of input and textarea elements",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/referrer-policy.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/referrer-policy.js
index 9cc1c115095490..088adb153bed40 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/referrer-policy.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/referrer-policy.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","132":"B"},B:{"1":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C L M I N D O","516":"P Q R S T"},C:{"1":"W X Y Z a","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB NC OC","516":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V","2049":"0 1 2 b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m","260":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB","516":"2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T"},E:{"2":"3 J K F PC 7B QC RC","132":"G H A B SC TC 8B","516":"C wB xB","1025":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","1540":"L M 9B UC"},F:{"1":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","516":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB"},G:{"2":"7B dC JC eC fC gC","132":"G hC iC jC kC lC mC nC","516":"oC pC qC rC","1025":"D wC AC BC yB xC zB CC DC EC FC GC HC","1540":"sC tC uC vC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2049":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J","516":"5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"516":"JD KD"}},B:4,C:"Referrer Policy",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","132":"B"},B:{"1":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C K L G M N O","516":"P Q R S T"},C:{"1":"W X Y Z a","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB QC RC","516":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V","2049":"0 1 2 3 b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n","260":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB","516":"5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T"},E:{"2":"4 I J D SC 9B TC UC","132":"E F A B VC WC AC","516":"C yB zB","1025":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","1540":"K L BC XC"},F:{"1":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","516":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB"},G:{"2":"9B gC MC hC iC jC","132":"E kC lC mC nC oC pC qC","516":"rC sC tC uC","1025":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","1540":"vC wC xC yC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2049":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I","516":"8C 9C AD BD CD AC DD ED FD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"516":"LD MD"}},B:4,C:"Referrer Policy",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/registerprotocolhandler.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/registerprotocolhandler.js
index c19600d17a78d3..4e9d035a9489a5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/registerprotocolhandler.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/registerprotocolhandler.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","129":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC"},D:{"2":"3 J K F G H A B C","129":"0 1 2 4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B YC ZC aC bC wB IC","129":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","129":"A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:1,C:"Custom protocol handling",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","129":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC"},D:{"2":"4 I J D E F A B C","129":"0 1 2 3 5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B bC cC dC eC yB LC","129":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","129":"A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:1,C:"Custom protocol handling",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rel-noopener.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rel-noopener.js
index 8a43dccee4c6fb..f43e822967c7b3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rel-noopener.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rel-noopener.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"rel=noopener",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"rel=noopener",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rel-noreferrer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rel-noreferrer.js
index d012c01592df74..c6857f9904b866 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rel-noreferrer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rel-noreferrer.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","132":"B"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"C"},C:{"1":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M I"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Link type \"noreferrer\"",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","132":"B"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"C"},C:{"1":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L G"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Link type \"noreferrer\"",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rellist.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rellist.js
index 9987c22ac9418f..b014b5607fd3d2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rellist.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rellist.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N","132":"D"},C:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB NC OC"},D:{"1":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB","132":"WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G PC 7B QC RC SC"},F:{"1":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB YC ZC aC bC wB IC cC xB","132":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","132":"5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"relList (DOMTokenList)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M","132":"N"},C:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB QC RC"},D:{"1":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","132":"XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E SC 9B TC UC VC"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB bC cC dC eC yB LC fC zB","132":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","132":"8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"relList (DOMTokenList)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rem.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rem.js
index 9b158422fc667e..6bddbb37254dff 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rem.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rem.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G KC","132":"H A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","2":"LC 0B NC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H B YC ZC aC bC wB IC"},G:{"1":"G D dC JC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B","260":"eC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"C p xB","2":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"rem (root em) units",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E NC","132":"F A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","2":"OC 3B QC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F B bC cC dC eC yB LC"},G:{"1":"E gC MC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B","260":"hC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"C q zB","2":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"rem (root em) units",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/requestanimationframe.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/requestanimationframe.js
index 6e7deb8e49413c..cc2bcea93eea27 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/requestanimationframe.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/requestanimationframe.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","33":"4 B C L M I N D O m n o","164":"3 J K F G H A"},D:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H","33":"5 o","164":"4 O m n","420":"A B C L M I N D"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","33":"K"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","33":"fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"requestAnimationFrame",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","33":"5 B C K L G M N O n o p","164":"4 I J D E F A"},D:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F","33":"6 p","164":"5 O n o","420":"A B C K L G M N"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","33":"J"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","33":"iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"requestAnimationFrame",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/requestidlecallback.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/requestidlecallback.js
index a48d6f2a8c2e9a..9a18242a5b17cb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/requestidlecallback.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/requestidlecallback.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB NC OC","194":"ZB aB"},D:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB"},E:{"2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB","322":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC","322":"D tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"requestIdleCallback",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB QC RC","194":"aB bB"},D:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB"},E:{"1":"aC","2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB","322":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC","322":"wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"requestIdleCallback",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/resizeobserver.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/resizeobserver.js
index 121cd5b48eaea9..8a144707c7e8be 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/resizeobserver.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/resizeobserver.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB NC OC"},D:{"1":"0 1 2 iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","194":"aB bB cB dB eB 1B fB 2B gB hB"},E:{"1":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB xB","66":"L"},F:{"1":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB YC ZC aC bC wB IC cC xB","194":"NB OB PB QB RB SB TB UB VB WB XB"},G:{"1":"D tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"Resize Observer",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB QC RC"},D:{"1":"0 1 2 3 jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","194":"bB cB dB eB fB 4B gB 5B hB iB"},E:{"1":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB zB","66":"K"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB bC cC dC eC yB LC fC zB","194":"OB PB QB RB SB TB UB VB WB XB YB"},G:{"1":"wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"Resize Observer",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/resource-timing.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/resource-timing.js
index cac9cd1987859b..727aa51abf2b82 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/resource-timing.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/resource-timing.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB NC OC","194":"DB EB FB GB"},D:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 J K F G H A B C L M I N D O m n o"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","260":"B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Resource Timing",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB QC RC","194":"EB FB GB HB"},D:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 I J D E F A B C K L G M N O n o p"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","260":"B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Resource Timing",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rest-parameters.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rest-parameters.js
index 6ae692204867b9..b79a7a03f0d328 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rest-parameters.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rest-parameters.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M NC OC"},D:{"1":"0 1 2 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","194":"QB RB SB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB YC ZC aC bC wB IC cC xB","194":"DB EB FB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Rest parameters",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L QC RC"},D:{"1":"0 1 2 3 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB","194":"RB SB TB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB bC cC dC eC yB LC fC zB","194":"EB FB GB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Rest parameters",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rtcpeerconnection.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rtcpeerconnection.js
index 8fe1287fe06f05..ff05d69fc807ec 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rtcpeerconnection.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/rtcpeerconnection.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M","260":"I N D O"},C:{"1":"0 1 2 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC","33":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},D:{"1":"0 1 2 cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m n o","33":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C I N D YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","130":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"33":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"WebRTC Peer-to-peer connections",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L","260":"G M N O"},C:{"1":"0 1 2 3 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC","33":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},D:{"1":"0 1 2 3 dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n o p","33":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C G M N bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","130":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"33":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"WebRTC Peer-to-peer connections",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ruby.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ruby.js
index 1b2dca9d72567e..0812c3df1cf391 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ruby.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ruby.js
@@ -1 +1 @@
-module.exports={A:{A:{"4":"K F G KC","132":"H A B"},B:{"4":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB NC OC"},D:{"4":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","8":"J"},E:{"4":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"J PC 7B"},F:{"4":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","8":"H B C YC ZC aC bC wB IC cC xB"},G:{"4":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"7B dC JC"},H:{"8":"yC"},I:{"4":"0B J E 2C JC 3C 4C","8":"zC 0C 1C"},J:{"4":"A","8":"F"},K:{"4":"p","8":"A B C wB IC xB"},L:{"4":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"4":"yB"},P:{"4":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"4":"9B"},R:{"4":"ID"},S:{"1":"JD KD"}},B:1,C:"Ruby annotation",D:true};
+module.exports={A:{A:{"4":"J D E NC","132":"F A B"},B:{"4":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB QC RC"},D:{"4":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","8":"I"},E:{"4":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"I SC 9B"},F:{"4":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","8":"F B C bC cC dC eC yB LC fC zB"},G:{"4":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"9B gC MC"},H:{"8":"1C"},I:{"4":"3B I H 5C MC 6C 7C","8":"2C 3C 4C"},J:{"4":"A","8":"D"},K:{"4":"q","8":"A B C yB LC zB"},L:{"4":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"4":"0B"},P:{"4":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"4":"BC"},R:{"4":"KD"},S:{"1":"LD MD"}},B:1,C:"Ruby annotation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/run-in.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/run-in.js
index 79c019973082b9..cd5193c6aaed71 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/run-in.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/run-in.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","2":"K F KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB","2":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K QC","2":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"RC","129":"J PC 7B"},F:{"1":"H B C I N D O YC ZC aC bC wB IC cC xB","2":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"dC JC eC fC gC","2":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","129":"7B"},H:{"1":"yC"},I:{"1":"0B J zC 0C 1C 2C JC 3C","2":"E 4C"},J:{"1":"F A"},K:{"1":"A B C wB IC xB","2":"p"},L:{"2":"E"},M:{"2":"E"},N:{"1":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:4,C:"display: run-in",D:true};
+module.exports={A:{A:{"1":"E F A B","2":"J D NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB","2":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J TC","2":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"UC","129":"I SC 9B"},F:{"1":"F B C G M N O bC cC dC eC yB LC fC zB","2":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"gC MC hC iC jC","2":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","129":"9B"},H:{"1":"1C"},I:{"1":"3B I 2C 3C 4C 5C MC 6C","2":"H 7C"},J:{"1":"D A"},K:{"1":"A B C yB LC zB","2":"q"},L:{"2":"H"},M:{"2":"xB"},N:{"1":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:4,C:"display: run-in",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/same-site-cookie-attribute.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/same-site-cookie-attribute.js
index a10c486d1d73fc..95e384ef21d638 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/same-site-cookie-attribute.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/same-site-cookie-attribute.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","388":"B"},B:{"1":"O P Q R S T U","2":"C L M I","129":"N D","513":"0 1 2 V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B NC OC"},D:{"1":"XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","513":"0 1 2 Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B wB","2052":"M UC","3076":"C L xB 9B"},F:{"1":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB YC ZC aC bC wB IC cC xB","513":"pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC","2052":"oC pC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","513":"p"},L:{"513":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"16":"9B"},R:{"513":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"'SameSite' cookie attribute",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","388":"B"},B:{"1":"O P Q R S T U","2":"C K L G","129":"M N","513":"0 1 2 3 V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B QC RC"},D:{"1":"YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","513":"0 1 2 3 Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC yB","2052":"L XC","3076":"C K zB BC"},F:{"1":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB bC cC dC eC yB LC fC zB","513":"qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC","2052":"rC sC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","513":"q"},L:{"513":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"16":"BC"},R:{"513":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"'SameSite' cookie attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/screen-orientation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/screen-orientation.js
index fd1e26fc14efeb..dcc42367d484e6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/screen-orientation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/screen-orientation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","164":"B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","36":"C L M I N D O"},C:{"1":"0 1 2 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N D NC OC","36":"4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},D:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A","36":"B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","16":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"Screen Orientation",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","164":"B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","36":"C K L G M N O"},C:{"1":"0 1 2 3 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M N QC RC","36":"5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},D:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A","36":"B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","16":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"Screen Orientation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/script-async.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/script-async.js
index 5edd0bd652c4d2..9669df86dfe298 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/script-async.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/script-async.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","2":"LC 0B NC"},D:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","132":"3"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"async attribute for external scripts",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","2":"OC 3B QC"},D:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","132":"4"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"async attribute for external scripts",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/script-defer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/script-defer.js
index 699ff88e1ad018..daa383036ab956 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/script-defer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/script-defer.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","132":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","257":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"defer attribute for external scripts",D:true};
+module.exports={A:{A:{"1":"A B","132":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","257":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"defer attribute for external scripts",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/scrollintoview.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/scrollintoview.js
index 2ee580538032db..d487099c0b6017 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/scrollintoview.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/scrollintoview.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F KC","132":"G H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","132":"C L M I N D O"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","132":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB NC OC"},D:{"1":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J PC 7B","132":"K F G H A B C L M I QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H YC ZC aC bC","16":"B wB IC","132":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB cC xB"},G:{"1":"D zB CC DC EC FC GC HC","16":"7B dC JC","132":"G eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"1":"E","16":"zC 0C","132":"0B J 1C 2C JC 3C 4C"},J:{"132":"F A"},K:{"1":"p","132":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"132":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"scrollIntoView",D:true};
+module.exports={A:{A:{"2":"J D NC","132":"E F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","132":"C K L G M N O"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","132":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB QC RC"},D:{"1":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B","132":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F bC cC dC eC","16":"B yB LC","132":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB fC zB"},G:{"1":"1B EC FC GC HC IC JC 2B KC","16":"9B gC MC","132":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"1":"H","16":"2C 3C","132":"3B I 4C 5C MC 6C 7C"},J:{"132":"D A"},K:{"1":"q","132":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"132":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"scrollIntoView",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/scrollintoviewifneeded.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/scrollintoviewifneeded.js
index 5000618205581e..bffe3a93553bed 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/scrollintoviewifneeded.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/scrollintoviewifneeded.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"Element.scrollIntoViewIfNeeded()",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"Element.scrollIntoViewIfNeeded()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sdch.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sdch.js
index 53fd3948bba22a..fedd265826f19f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sdch.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sdch.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","2":"0 1 2 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB","2":"H B C p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"SDCH Accept-Encoding/Content-Encoding",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB","2":"0 1 2 3 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB","2":"F B C q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"SDCH Accept-Encoding/Content-Encoding",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/selection-api.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/selection-api.js
index 2ea7f00bb21208..654968b7efd569 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/selection-api.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/selection-api.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","16":"KC","260":"K F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","132":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB NC OC","2180":"PB QB RB SB TB UB VB WB XB"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","132":"H B C YC ZC aC bC wB IC cC xB"},G:{"16":"JC","132":"7B dC","516":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E 3C 4C","16":"0B J zC 0C 1C 2C","1025":"JC"},J:{"1":"A","16":"F"},K:{"1":"p","16":"A B C wB IC","132":"xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","16":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2180":"JD"}},B:5,C:"Selection API",D:true};
+module.exports={A:{A:{"1":"F A B","16":"NC","260":"J D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","132":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QC RC","2180":"QB RB SB TB UB VB WB XB YB"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","132":"F B C bC cC dC eC yB LC fC zB"},G:{"16":"MC","132":"9B gC","516":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H 6C 7C","16":"3B I 2C 3C 4C 5C","1025":"MC"},J:{"1":"A","16":"D"},K:{"1":"q","16":"A B C yB LC","132":"zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","16":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2180":"LD"}},B:5,C:"Selection API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/server-timing.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/server-timing.js
index ed831a4ad323b9..f004a041694417 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/server-timing.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/server-timing.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB NC OC"},D:{"1":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B","196":"fB 2B gB hB","324":"iB"},E:{"2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB","516":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"Server Timing",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB QC RC"},D:{"1":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B","196":"gB 5B hB iB","324":"jB"},E:{"2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB","516":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"Server Timing",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/serviceworkers.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/serviceworkers.js
index ccb89a6edbb523..9e4c5ae346c11f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/serviceworkers.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/serviceworkers.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M","322":"I N"},C:{"1":"0 1 2 QB SB TB UB VB WB XB ZB aB bB cB dB eB 1B 2B gB hB iB jB kB lB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB NC OC","194":"FB GB HB IB JB KB LB MB NB OB PB","513":"RB YB fB mB"},D:{"1":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB","4":"MB NB OB PB QB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B PC 7B QC RC SC TC 8B"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 H B C I N D O m n o YC ZC aC bC wB IC cC xB","4":"9 AB BB CB DB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","4":"E"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"Service Workers",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L","322":"G M"},C:{"1":"0 1 2 3 RB TB UB VB WB XB YB aB bB cB dB eB fB 4B 5B hB iB jB kB lB mB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB QC RC","194":"GB HB IB JB KB LB MB NB OB PB QB","513":"SB ZB gB nB"},D:{"1":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB","4":"NB OB PB QB RB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B SC 9B TC UC VC WC AC"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p bC cC dC eC yB LC fC zB","4":"AB BB CB DB EB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","4":"H"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"Service Workers",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/setimmediate.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/setimmediate.js
index 110461b0daf9aa..0596aee846da53 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/setimmediate.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/setimmediate.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"C L M I N D O","2":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"1":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Efficient Script Yielding: setImmediate()",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"C K L G M N O","2":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"1":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Efficient Script Yielding: setImmediate()",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/shadowdom.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/shadowdom.js
index 9ecd6f7e61914a..6fd372d808147f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/shadowdom.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/shadowdom.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"P","2":"0 1 2 C L M I N D O Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","66":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB"},D:{"1":"HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P","2":"0 1 2 3 4 5 6 J K F G H A B C L M I N D O m n o Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"7 8 9 AB BB CB DB EB FB GB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB","2":"H B C lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","33":"4 I N D O m n"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC","33":"3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"5C 6C 7C 8C 9C 8B AD BD","2":"m n o CD DD ED zB FD GD HD","33":"J"},Q:{"1":"9B"},R:{"2":"ID"},S:{"1":"JD","2":"KD"}},B:7,C:"Shadow DOM (deprecated V0 spec)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"P","2":"0 1 2 3 C K L G M N O Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","66":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB"},D:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P","2":"0 1 2 3 4 5 6 7 I J D E F A B C K L G M N O n o p Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"8 9 AB BB CB DB EB FB GB HB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB","2":"F B C mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","33":"5 G M N O n o"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC","33":"6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"8C 9C AD BD CD AC DD ED","2":"n o p FD GD HD 1B 2B ID JD","33":"I"},Q:{"1":"BC"},R:{"2":"KD"},S:{"1":"LD","2":"MD"}},B:7,C:"Shadow DOM (deprecated V0 spec)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/shadowdomv1.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/shadowdomv1.js
index 9b8f8bf423fda3..88d1dd67fd1277 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/shadowdomv1.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/shadowdomv1.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB NC OC","322":"eB","578":"1B fB 2B gB"},D:{"1":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},E:{"1":"A B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC"},F:{"1":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC","132":"kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","4":"5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"Shadow DOM (V1)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB QC RC","322":"fB","578":"4B gB 5B hB"},D:{"1":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB"},E:{"1":"A B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC","132":"nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","4":"8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"Shadow DOM (V1)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sharedarraybuffer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sharedarraybuffer.js
index f59e5b9d201cbf..4020e65e1de863 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sharedarraybuffer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sharedarraybuffer.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"P Q R S T U V W X Y Z","2":"C L M I","194":"N D O","513":"0 1 2 a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB NC OC","194":"dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p","450":"rB sB tB uB vB","513":"0 1 2 P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B","194":"fB 2B gB hB iB jB kB lB","513":"0 1 2 a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A PC 7B QC RC SC TC","194":"B C L M I 8B wB xB 9B UC VC","513":"D AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB YC ZC aC bC wB IC cC xB","194":"TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB","513":"vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC","194":"lC mC nC oC pC qC rC sC tC uC vC wC","513":"D AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","513":"p"},L:{"513":"E"},M:{"513":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD","513":"m n o ED zB FD GD HD"},Q:{"2":"9B"},R:{"513":"ID"},S:{"2":"JD","513":"KD"}},B:6,C:"Shared Array Buffer",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"P Q R S T U V W X Y Z","2":"C K L G","194":"M N O","513":"0 1 2 3 a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB QC RC","194":"eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q","450":"sB tB uB vB wB","513":"0 1 2 3 P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B","194":"gB 5B hB iB jB kB lB mB","513":"0 1 2 3 a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A SC 9B TC UC VC WC","194":"B C K L G AC yB zB BC XC YC","513":"CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB bC cC dC eC yB LC fC zB","194":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB","513":"wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC","194":"oC pC qC rC sC tC uC vC wC xC yC zC","513":"CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","513":"q"},L:{"513":"H"},M:{"513":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I 8C 9C AD BD CD AC DD ED FD GD","513":"n o p HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"513":"KD"},S:{"2":"LD","513":"MD"}},B:6,C:"Shared Array Buffer",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sharedworkers.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sharedworkers.js
index ce2695d12a9cb4..7cff8a1556fb0e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sharedworkers.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sharedworkers.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 K D QC zB CC DC EC FC GC HC XC","2":"J F G H A B C L M I PC 7B RC SC TC 8B wB xB 9B UC VC AC BC yB WC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","2":"H YC ZC aC"},G:{"1":"D eC fC zB CC DC EC FC GC HC","2":"G 7B dC JC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"B C wB IC xB","2":"p","16":"A"},L:{"2":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"J","2":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"JD KD"}},B:1,C:"Shared Web Workers",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 J TC 1B EC FC GC HC IC JC 2B KC aC","2":"I D E F A B C K L G SC 9B UC VC WC AC yB zB BC XC YC CC DC 0B ZC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","2":"F bC cC dC"},G:{"1":"hC iC 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"B C yB LC zB","2":"q","16":"A"},L:{"2":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"I","2":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"LD MD"}},B:1,C:"Shared Web Workers",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sni.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sni.js
index b1384a6bcd7389..88028b762b02f4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sni.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sni.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K KC","132":"F G"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B"},H:{"1":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Server Name Indication",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J NC","132":"D E"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B"},H:{"1":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Server Name Indication",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/spdy.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/spdy.js
index 5ed66bc812bbd7..bcbd4558bc196c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/spdy.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/spdy.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H A KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","2":"0 1 2 3 LC 0B J K F G H A B C XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","2":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"G H A B C TC 8B wB","2":"3 J K F PC 7B QC RC SC","129":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB OB QB xB","2":"H B C MB NB PB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC"},G:{"1":"G hC iC jC kC lC mC nC oC","2":"7B dC JC eC fC gC","257":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J 2C JC 3C 4C","2":"E zC 0C 1C"},J:{"2":"F A"},K:{"1":"xB","2":"A B C p wB IC"},L:{"2":"E"},M:{"2":"E"},N:{"1":"B","2":"A"},O:{"2":"yB"},P:{"1":"J","2":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"JD","2":"KD"}},B:7,C:"SPDY protocol",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F A NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","2":"0 1 2 3 4 OC 3B I J D E F A B C YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","2":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"E F A B C WC AC yB","2":"4 I J D SC 9B TC UC VC","129":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB PB RB zB","2":"F B C NB OB QB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC"},G:{"1":"E kC lC mC nC oC pC qC rC","2":"9B gC MC hC iC jC","257":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I 5C MC 6C 7C","2":"H 2C 3C 4C"},J:{"2":"D A"},K:{"1":"zB","2":"A B C q yB LC"},L:{"2":"H"},M:{"2":"xB"},N:{"1":"B","2":"A"},O:{"2":"0B"},P:{"1":"I","2":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"LD","2":"MD"}},B:7,C:"SPDY protocol",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/speech-recognition.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/speech-recognition.js
index e09a5cb1f5348d..ba9427c803b9a4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/speech-recognition.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/speech-recognition.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","514":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC","322":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 J K F G H A B C L M I N D O m n o","164":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M PC 7B QC RC SC TC 8B wB xB 9B","1060":"I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 H B C I N D O m n o YC ZC aC bC wB IC cC xB","514":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC","1060":"D vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","164":"p"},L:{"164":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"164":"yB"},P:{"164":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"164":"9B"},R:{"164":"ID"},S:{"322":"JD KD"}},B:7,C:"Speech Recognition API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","514":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC","322":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 I J D E F A B C K L G M N O n o p","164":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L SC 9B TC UC VC WC AC yB zB BC","1060":"G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p bC cC dC eC yB LC fC zB","514":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC","1060":"yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","164":"q"},L:{"164":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"164":"0B"},P:{"164":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"164":"BC"},R:{"164":"KD"},S:{"322":"LD MD"}},B:7,C:"Speech Recognition API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/speech-synthesis.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/speech-synthesis.js
index 71669573a181e1..68a08a61686cc7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/speech-synthesis.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/speech-synthesis.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"M I N D O","2":"C L","257":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB NC OC","194":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},D:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB","257":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC"},F:{"1":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB","2":"4 5 6 7 8 H B C I N D O m n o YC ZC aC bC wB IC cC xB","257":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"2":"ID"},S:{"1":"JD KD"}},B:7,C:"Speech Synthesis API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"L G M N O","2":"C K","257":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB QC RC","194":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},D:{"1":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB","257":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC"},F:{"1":"AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB","2":"5 6 7 8 9 F B C G M N O n o p bC cC dC eC yB LC fC zB","257":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"2":"KD"},S:{"1":"LD MD"}},B:7,C:"Speech Synthesis API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/spellcheck-attribute.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/spellcheck-attribute.js
index 7c89742770f490..65edac457e31df 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/spellcheck-attribute.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/spellcheck-attribute.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"4":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"4":"yC"},I:{"4":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"A","4":"F"},K:{"4":"A B C p wB IC xB"},L:{"4":"E"},M:{"4":"E"},N:{"4":"A B"},O:{"4":"yB"},P:{"4":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"4":"ID"},S:{"2":"JD KD"}},B:1,C:"Spellcheck attribute",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"4":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"4":"1C"},I:{"4":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"A","4":"D"},K:{"4":"A B C q yB LC zB"},L:{"4":"H"},M:{"4":"xB"},N:{"4":"A B"},O:{"4":"0B"},P:{"4":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"4":"KD"},S:{"2":"LD MD"}},B:1,C:"Spellcheck attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sql-storage.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sql-storage.js
index cb0acea2a859ca..3243f7a69f6ac5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sql-storage.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sql-storage.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"P Q R S T U V W X Y Z a b c d e f g h i j k l q r","2":"C L M I N D O","129":"0 1 2 s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r","129":"0 1 2 s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB xB","2":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z aC bC wB IC cC xB","2":"H YC ZC","129":"a b c d e f g h i j k l"},G:{"1":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC","2":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J zC 0C 1C 2C JC 3C 4C","129":"E"},J:{"1":"F A"},K:{"1":"B C wB IC xB","2":"A","129":"p"},L:{"129":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"Web SQL Database",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"P Q R S T U V W X Y Z a b c d e f g h i j","2":"C K L G M N O","129":"k l m r s t u v w","385":"0 1 2 3 x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j","129":"k l m r s t u v w","385":"0 1 2 3 x y z H xB","897":"7B 8B"},E:{"1":"4 I J D E F A B C SC 9B TC UC VC WC AC yB zB","2":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z dC eC yB LC fC zB","2":"F bC cC","257":"a b c d e f g h i j k l m"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC","2":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I 2C 3C 4C 5C MC 6C 7C","257":"H"},J:{"1":"D A"},K:{"1":"B C yB LC zB","2":"A","257":"q"},L:{"257":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"Web SQL Database",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/srcset.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/srcset.js
index f6c84affbe1f15..d1b1b55c9cc0cc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/srcset.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/srcset.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C","514":"L M I"},C:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB NC OC","194":"EB FB GB HB IB JB"},D:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB","260":"GB HB IB JB"},E:{"2":"3 J K F PC 7B QC RC","260":"G SC","1028":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m YC ZC aC bC wB IC cC xB","260":"5 6 n o"},G:{"2":"7B dC JC eC fC gC","260":"G hC","1028":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Srcset and sizes attributes",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C","514":"K L G"},C:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB QC RC","194":"FB GB HB IB JB KB"},D:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB","260":"HB IB JB KB"},E:{"2":"4 I J D SC 9B TC UC","260":"E VC","1028":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n bC cC dC eC yB LC fC zB","260":"6 7 o p"},G:{"2":"9B gC MC hC iC jC","260":"E kC","1028":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Srcset and sizes attributes",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/stream.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/stream.js
index 2944225c810e78..f788d496c64ee1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/stream.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/stream.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N NC OC","129":"IB JB KB LB MB NB","420":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB"},D:{"1":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m","420":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B"},F:{"1":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B I N D YC ZC aC bC wB IC cC","420":"4 5 6 7 8 9 C O m n o AB BB CB DB EB FB GB HB IB JB KB LB xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC","513":"D tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","1537":"mC nC oC pC qC rC sC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","420":"A"},K:{"1":"p","2":"A B wB IC","420":"C xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","420":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:4,C:"getUserMedia/Stream API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M QC RC","129":"JB KB LB MB NB OB","420":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB"},D:{"1":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n","420":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B G M N bC cC dC eC yB LC fC","420":"5 6 7 8 9 C O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC","513":"wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","1537":"pC qC rC sC tC uC vC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","420":"A"},K:{"1":"q","2":"A B yB LC","420":"C zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","420":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:4,C:"getUserMedia/Stream API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/streams.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/streams.js
index e126705b4b17f5..33131008b642d2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/streams.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/streams.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","130":"B"},B:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"C L","260":"M I","1028":"P Q R S T U V W X","5124":"N D O"},C:{"1":"0 1 2 l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB NC OC","5124":"j k","7172":"jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i","7746":"dB eB 1B fB 2B gB hB iB"},D:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","260":"YB ZB aB bB cB dB eB","1028":"1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X"},E:{"2":"3 J K F G H PC 7B QC RC SC TC","1028":"I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","3076":"A B C L M 8B wB xB 9B"},F:{"1":"tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB YC ZC aC bC wB IC cC xB","260":"LB MB NB OB PB QB RB","1028":"SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC","16":"kC","1028":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o ED zB FD GD HD","2":"J 5C 6C","1028":"7C 8C 9C 8B AD BD CD DD"},Q:{"1028":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:1,C:"Streams",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","130":"B"},B:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"C K","260":"L G","1028":"P Q R S T U V W X","5124":"M N O"},C:{"1":"0 1 2 3 l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB QC RC","5124":"j k","7172":"kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i","7746":"eB fB 4B gB 5B hB iB jB"},D:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB","260":"ZB aB bB cB dB eB fB","1028":"4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X"},E:{"2":"4 I J D E F SC 9B TC UC VC WC","1028":"G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","3076":"A B C K L AC yB zB BC"},F:{"1":"uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB bC cC dC eC yB LC fC zB","260":"MB NB OB PB QB RB SB","1028":"TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC","16":"nC","1028":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p HD 1B 2B ID JD","2":"I 8C 9C","1028":"AD BD CD AC DD ED FD GD"},Q:{"1028":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:1,C:"Streams",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/stricttransportsecurity.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/stricttransportsecurity.js
index 7afb07d44a0938..02e970d7c6e432 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/stricttransportsecurity.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/stricttransportsecurity.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A KC","129":"B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Strict Transport Security",D:true};
+module.exports={A:{A:{"2":"J D E F A NC","129":"B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Strict Transport Security",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/style-scoped.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/style-scoped.js
index 8979b333e3a82a..5e6dc5919b7a65 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/style-scoped.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/style-scoped.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"5 6 7 8 9 n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","2":"0 1 2 3 4 LC 0B J K F G H A B C L M I N D O m 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","322":"bB cB dB eB 1B fB"},D:{"2":"0 1 2 3 4 J K F G H A B C L M I N D O JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","194":"5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"JD","2":"KD"}},B:7,C:"Scoped CSS",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"6 7 8 9 o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB","2":"0 1 2 3 4 5 OC 3B I J D E F A B C K L G M N O n 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","322":"cB dB eB fB 4B gB"},D:{"2":"0 1 2 3 4 5 I J D E F A B C K L G M N O KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","194":"6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"LD","2":"MD"}},B:7,C:"Scoped CSS",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/subresource-bundling.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/subresource-bundling.js
index 9f7d576b19171e..81e4a04d2abd14 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/subresource-bundling.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/subresource-bundling.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 r s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Subresource Loading with Web Bundles",D:false};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 r s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Subresource Loading with Web Bundles",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/subresource-integrity.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/subresource-integrity.js
index 5a333ed92dfa37..d9d21df33c23ba 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/subresource-integrity.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/subresource-integrity.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N"},C:{"1":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB NC OC"},D:{"1":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC","194":"mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Subresource Integrity",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M"},C:{"1":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QC RC"},D:{"1":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC"},F:{"1":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC","194":"pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Subresource Integrity",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-css.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-css.js
index 0e7d7629414bab..b7f5e8b345e891 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-css.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-css.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","516":"C L M I"},C:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","260":"3 4 5 J K F G H A B C L M I N D O m n o"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"J"},E:{"1":"3 K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC","132":"J 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","132":"7B dC"},H:{"260":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"p","260":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"SVG in CSS backgrounds",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","516":"C K L G"},C:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","260":"4 5 6 I J D E F A B C K L G M N O n o p"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"I"},E:{"1":"4 J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC","132":"I 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","132":"9B gC"},H:{"260":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"q","260":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"SVG in CSS backgrounds",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-filters.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-filters.js
index bfb371797474b9..c8a382e6c4b02c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-filters.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-filters.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC"},D:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J","4":"3 K F"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"SVG filters",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC"},D:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I","4":"4 J D"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"SVG filters",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-fonts.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-fonts.js
index 4549cf0a2e4f70..335de0cac4cd30 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-fonts.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-fonts.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"H A B KC","8":"K F G"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB","2":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","130":"KB LB MB NB OB PB QB RB SB TB UB VB WB"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC"},F:{"1":"4 5 6 H B C I N D O m n o YC ZC aC bC wB IC cC xB","2":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","130":"7 8 9 AB BB CB DB EB FB GB HB IB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"258":"yC"},I:{"1":"0B J 2C JC 3C 4C","2":"E zC 0C 1C"},J:{"1":"F A"},K:{"1":"A B C wB IC xB","2":"p"},L:{"130":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"J","130":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"130":"ID"},S:{"2":"JD KD"}},B:2,C:"SVG fonts",D:true};
+module.exports={A:{A:{"2":"F A B NC","8":"J D E"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB","2":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","130":"LB MB NB OB PB QB RB SB TB UB VB WB XB"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC"},F:{"1":"5 6 7 F B C G M N O n o p bC cC dC eC yB LC fC zB","2":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","130":"8 9 AB BB CB DB EB FB GB HB IB JB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"258":"1C"},I:{"1":"3B I 5C MC 6C 7C","2":"H 2C 3C 4C"},J:{"1":"D A"},K:{"1":"A B C yB LC zB","2":"q"},L:{"130":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"I","130":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"130":"KD"},S:{"2":"LD MD"}},B:2,C:"SVG fonts",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-fragment.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-fragment.js
index 16118953feaa68..8534ada25cf21f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-fragment.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-fragment.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","260":"H A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M NC OC"},D:{"1":"0 1 2 WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB","132":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},E:{"1":"C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F H A B PC 7B QC RC TC 8B","132":"G SC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"4 I N D O m n o","4":"B C ZC aC bC wB IC cC","16":"H YC","132":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC iC jC kC lC mC","132":"G hC"},H:{"1":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F","132":"A"},K:{"1":"p xB","4":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","132":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"SVG fragment identifiers",D:true};
+module.exports={A:{A:{"2":"J D E NC","260":"F A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L QC RC"},D:{"1":"0 1 2 3 XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB","132":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB"},E:{"1":"C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D F A B SC 9B TC UC WC AC","132":"E VC"},F:{"1":"KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"5 G M N O n o p","4":"B C cC dC eC yB LC fC","16":"F bC","132":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC lC mC nC oC pC","132":"E kC"},H:{"1":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D","132":"A"},K:{"1":"q zB","4":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","132":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"SVG fragment identifiers",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-html.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-html.js
index 79298b4efc1ef0..d5ffae5885de99 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-html.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-html.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","388":"H A B"},B:{"4":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I N D O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC","4":"0B"},D:{"4":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"PC 7B","4":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"4":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"4":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","4":"E 3C 4C"},J:{"1":"A","2":"F"},K:{"4":"A B C p wB IC xB"},L:{"4":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"4":"yB"},P:{"4":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"4":"9B"},R:{"4":"ID"},S:{"1":"JD KD"}},B:2,C:"SVG effects for HTML",D:true};
+module.exports={A:{A:{"2":"J D E NC","388":"F A B"},B:{"4":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC","4":"3B"},D:{"4":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"SC 9B","4":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"4":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"4":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","4":"H 6C 7C"},J:{"1":"A","2":"D"},K:{"4":"A B C q yB LC zB"},L:{"4":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"4":"0B"},P:{"4":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"4":"BC"},R:{"4":"KD"},S:{"1":"LD MD"}},B:2,C:"SVG effects for HTML",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-html5.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-html5.js
index bd236df0f67af9..c1019d01a397a0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-html5.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-html5.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G","129":"H A B"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"C L M I N"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","8":"3 J K"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"3 J PC 7B","129":"K F G QC RC SC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"B bC wB IC","8":"H YC ZC aC"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","8":"7B dC JC","129":"G eC fC gC hC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"zC 0C 1C","129":"0B J 2C JC"},J:{"1":"A","129":"F"},K:{"1":"C p xB","8":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"129":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Inline SVG in HTML5",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E","129":"F A B"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"C K L G M"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","8":"4 I J"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"4 I SC 9B","129":"J D E TC UC VC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"B eC yB LC","8":"F bC cC dC"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","8":"9B gC MC","129":"E hC iC jC kC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"2C 3C 4C","129":"3B I 5C MC"},J:{"1":"A","129":"D"},K:{"1":"C q zB","8":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"129":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Inline SVG in HTML5",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-img.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-img.js
index 75528b7c13db1f..94e1e20c2b19d6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-img.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-img.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC","4":"7B","132":"3 J K F G QC RC SC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","132":"G 7B dC JC eC fC gC hC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"zC 0C 1C","132":"0B J 2C JC"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"SVG in HTML img element",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC","4":"9B","132":"4 I J D E TC UC VC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","132":"E 9B gC MC hC iC jC kC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"2C 3C 4C","132":"3B I 5C MC"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"SVG in HTML img element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-smil.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-smil.js
index ceda2d0ff6a369..aed6300dbd6510 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-smil.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg-smil.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","8":"C L M I N D O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"LC 0B NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"J"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"PC 7B","132":"3 J QC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","132":"7B dC JC eC"},H:{"2":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"8":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"SVG SMIL animation",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","8":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"OC 3B QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"I"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"SC 9B","132":"4 I TC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","132":"9B gC MC hC"},H:{"2":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"8":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"SVG SMIL animation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg.js
index 7fbb35878744b0..9915b8fee733d8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/svg.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G","772":"H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","513":"C L M I N D O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","4":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","4":"PC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"E 3C 4C","2":"zC 0C 1C","132":"0B J 2C JC"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"257":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"SVG (basic support)",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E","772":"F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","513":"C K L G M N O"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","4":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","4":"SC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"H 6C 7C","2":"2C 3C 4C","132":"3B I 5C MC"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"257":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"SVG (basic support)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sxg.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sxg.js
index 5e5c8372f820de..bd934ad7df46fe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sxg.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/sxg.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB","132":"pB qB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:6,C:"Signed HTTP Exchanges (SXG)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB","132":"qB rB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:6,C:"Signed HTTP Exchanges (SXG)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tabindex-attr.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tabindex-attr.js
index 97ea347a2bd10a..d3a8e3bad2f1f3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tabindex-attr.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tabindex-attr.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"F G H A B","16":"K KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"16":"LC 0B NC OC","129":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"16":"3 J PC 7B","257":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","16":"H"},G:{"769":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"16":"yC"},I:{"16":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"16":"F A"},K:{"1":"p","16":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"16":"A B"},O:{"1":"yB"},P:{"16":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"129":"JD KD"}},B:1,C:"tabindex global attribute",D:true};
+module.exports={A:{A:{"1":"D E F A B","16":"J NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"16":"OC 3B QC RC","129":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"16":"4 I SC 9B","257":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","16":"F"},G:{"769":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"16":"1C"},I:{"16":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"16":"D A"},K:{"1":"q","16":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"16":"A B"},O:{"1":"0B"},P:{"16":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"129":"LD MD"}},B:1,C:"tabindex global attribute",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/template-literals.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/template-literals.js
index 9bc3ef938873bd..195e122433d8f3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/template-literals.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/template-literals.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","16":"C"},C:{"1":"0 1 2 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB NC OC"},D:{"1":"0 1 2 NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB"},E:{"1":"A B L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC","129":"C"},F:{"1":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB YC ZC aC bC wB IC cC xB"},G:{"1":"D iC jC kC lC mC nC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC","129":"oC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"ES6 Template Literals (Template Strings)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","16":"C"},C:{"1":"0 1 2 3 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB QC RC"},D:{"1":"0 1 2 3 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},E:{"1":"A B K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC","129":"C"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB bC cC dC eC yB LC fC zB"},G:{"1":"lC mC nC oC pC qC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC","129":"rC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"ES6 Template Literals (Template Strings)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/template.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/template.js
index af1c94587b0699..2c6e0db74094f4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/template.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/template.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C","388":"L M"},C:{"1":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 LC 0B J K F G H A B C L M I N D O m n NC OC"},D:{"1":"0 1 2 HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 J K F G H A B C L M I N D O m n o","132":"8 9 AB BB CB DB EB FB GB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F PC 7B QC","388":"G SC","514":"RC"},F:{"1":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","132":"4 I N D O m n"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC","388":"G hC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"HTML templates",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C","388":"K L"},C:{"1":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 OC 3B I J D E F A B C K L G M N O n o QC RC"},D:{"1":"0 1 2 3 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 I J D E F A B C K L G M N O n o p","132":"9 AB BB CB DB EB FB GB HB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D SC 9B TC","388":"E VC","514":"UC"},F:{"1":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","132":"5 G M N O n o"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC","388":"E kC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"HTML templates",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/temporal.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/temporal.js
index c0374a5ac609ea..3f67d8c13b2b73 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/temporal.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/temporal.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"Temporal",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"Temporal",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/testfeat.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/testfeat.js
index a10a288d49f325..34c0a8a652256e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/testfeat.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/testfeat.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G A B KC","16":"H"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 4 5 6 7 8 9 LC 0B K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","16":"3 J"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"B C"},E:{"2":"J K PC 7B QC","16":"3 F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC IC cC xB","16":"wB"},G:{"2":"7B dC JC eC fC","16":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 2C JC 3C 4C","16":"1C"},J:{"2":"A","16":"F"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Test feature - updated",D:false};
+module.exports={A:{A:{"2":"J D E A B NC","16":"F"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 5 6 7 8 9 OC 3B J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","16":"4 I"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"B C"},E:{"2":"I J SC 9B TC","16":"4 D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC LC fC zB","16":"yB"},G:{"2":"9B gC MC hC iC","16":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 5C MC 6C 7C","16":"4C"},J:{"2":"A","16":"D"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Test feature - updated",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-decoration.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-decoration.js
index d3f94a1a3e764f..404559814f3248 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-decoration.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-decoration.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","2052":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 LC 0B J NC OC","1028":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","1060":"4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},D:{"2":"3 4 5 6 7 J K F G H A B C L M I N D O m n o","226":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB","2052":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F PC 7B QC RC","772":"L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","804":"G H A B C TC 8B wB","1316":"SC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB YC ZC aC bC wB IC cC xB","226":"HB IB JB KB LB MB NB OB PB","2052":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"7B dC JC eC fC gC","292":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","2052":"p"},L:{"2052":"E"},M:{"1028":"E"},N:{"2":"A B"},O:{"2052":"yB"},P:{"2":"J 5C 6C","2052":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2052":"9B"},R:{"2052":"ID"},S:{"1028":"JD KD"}},B:4,C:"text-decoration styling",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","2052":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 OC 3B I QC RC","1028":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","1060":"5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},D:{"2":"4 5 6 7 8 I J D E F A B C K L G M N O n o p","226":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB","2052":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D SC 9B TC UC","772":"K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","804":"E F A B C WC AC yB","1316":"VC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB bC cC dC eC yB LC fC zB","226":"IB JB KB LB MB NB OB PB QB","2052":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"9B gC MC hC iC jC","292":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","2052":"q"},L:{"2052":"H"},M:{"1028":"xB"},N:{"2":"A B"},O:{"2052":"0B"},P:{"2":"I 8C 9C","2052":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2052":"BC"},R:{"2052":"KD"},S:{"1028":"LD MD"}},B:4,C:"text-decoration styling",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-emphasis.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-emphasis.js
index e73d666a9be265..eb8b85ddf65eab 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-emphasis.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-emphasis.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 i j k l q r s t u v w x y z E","2":"C L M I N D O","164":"P Q R S T U V W X Y Z a b c d e f g h"},C:{"1":"0 1 2 SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB NC OC","322":"RB"},D:{"1":"0 1 2 i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 J K F G H A B C L M I N D O m n o","164":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h"},E:{"1":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC","164":"F RC"},F:{"1":"V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","164":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC","164":"3C 4C"},J:{"2":"F","164":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o GD HD","164":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD"},Q:{"164":"9B"},R:{"164":"ID"},S:{"1":"JD KD"}},B:4,C:"text-emphasis styling",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 i j k l m r s t u v w x y z H","2":"C K L G M N O","164":"P Q R S T U V W X Y Z a b c d e f g h"},C:{"1":"0 1 2 3 TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB QC RC","322":"SB"},D:{"1":"0 1 2 3 i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 I J D E F A B C K L G M N O n o p","164":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h"},E:{"1":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC","164":"D UC"},F:{"1":"V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","164":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC","164":"6C 7C"},J:{"2":"D","164":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p ID JD","164":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B"},Q:{"164":"BC"},R:{"164":"KD"},S:{"1":"LD MD"}},B:4,C:"text-emphasis styling",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-overflow.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-overflow.js
index 7e4ff735d447c1..c1619271b4313c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-overflow.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-overflow.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B","2":"KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","8":"3 LC 0B J K NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","33":"H YC ZC aC bC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"p xB","33":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"CSS3 Text-overflow",D:true};
+module.exports={A:{A:{"1":"J D E F A B","2":"NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","8":"4 OC 3B I J QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","33":"F bC cC dC eC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"q zB","33":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"CSS3 Text-overflow",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-size-adjust.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-size-adjust.js
index 7a100edb482051..a9b017ce4b169c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-size-adjust.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-size-adjust.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","33":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","258":"8"},E:{"2":"3 J K F G H A B C L M I D PC 7B RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","258":"QC"},F:{"1":"PB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB QB YC ZC aC bC wB IC cC xB"},G:{"2":"7B dC JC","33":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"33":"E"},N:{"161":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS text-size-adjust",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","33":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","258":"9"},E:{"2":"4 I J D E F A B C K L G SC 9B UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","258":"TC"},F:{"1":"QB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB RB bC cC dC eC yB LC fC zB"},G:{"2":"9B gC MC","33":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"33":"xB"},N:{"161":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS text-size-adjust",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-stroke.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-stroke.js
index aec8df968670d2..c374df3addc1e2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-stroke.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/text-stroke.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M","33":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","161":"I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB NC OC","161":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","450":"UB"},D:{"33":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"33":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"33":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","36":"7B"},H:{"2":"yC"},I:{"2":"0B","33":"J E zC 0C 1C 2C JC 3C 4C"},J:{"33":"F A"},K:{"2":"A B C wB IC xB","33":"p"},L:{"33":"E"},M:{"161":"E"},N:{"2":"A B"},O:{"33":"yB"},P:{"33":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"33":"9B"},R:{"33":"ID"},S:{"161":"JD KD"}},B:7,C:"CSS text-stroke and text-fill",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L","33":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","161":"G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB QC RC","161":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","450":"VB"},D:{"33":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"33":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"33":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","36":"9B"},H:{"2":"1C"},I:{"2":"3B","33":"I H 2C 3C 4C 5C MC 6C 7C"},J:{"33":"D A"},K:{"2":"A B C yB LC zB","33":"q"},L:{"33":"H"},M:{"161":"xB"},N:{"2":"A B"},O:{"33":"0B"},P:{"33":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"33":"BC"},R:{"33":"KD"},S:{"161":"LD MD"}},B:7,C:"CSS text-stroke and text-fill",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/textcontent.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/textcontent.js
index 32297cad850e29..add270b38fb157 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/textcontent.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/textcontent.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","16":"H"},G:{"1":"G D dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Node.textContent",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","16":"F"},G:{"1":"E gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Node.textContent",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/textencoder.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/textencoder.js
index ca7d8a10f5ebdc..b329bff2bedeaf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/textencoder.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/textencoder.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N D O NC OC","132":"4"},D:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"TextEncoder & TextDecoder",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M N O QC RC","132":"5"},D:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"TextEncoder & TextDecoder",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-1.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-1.js
index 29e1bec34f43b0..61e1607e26b4df 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-1.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-1.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F KC","66":"G H A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB","2":"3 4 LC 0B J K F G H A B C L M I N D O m n o NC OC","66":"5","129":"mB nB oB pB qB p rB sB tB uB","388":"0 1 2 vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T","2":"3 4 J K F G H A B C L M I N D O m n","1540":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"F G H A B C L SC TC 8B wB xB","2":"3 J K PC 7B QC RC","513":"M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB xB","2":"H B C YC ZC aC bC wB IC cC","1540":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"1":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"1":"A","2":"F"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"129":"E"},N:{"1":"B","66":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"TLS 1.1",D:true};
+module.exports={A:{A:{"1":"B","2":"J D NC","66":"E F A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB","2":"4 5 OC 3B I J D E F A B C K L G M N O n o p QC RC","66":"6","129":"nB oB pB qB rB q sB tB uB vB","388":"0 1 2 3 wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T","2":"4 5 I J D E F A B C K L G M N O n o","1540":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"D E F A B C K VC WC AC yB zB","2":"4 I J SC 9B TC UC","513":"L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB zB","2":"F B C bC cC dC eC yB LC fC","1540":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"1":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"1":"A","2":"D"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"129":"xB"},N:{"1":"B","66":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"TLS 1.1",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-2.js
index ad282780201079..edfed6201dee90 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-2.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F KC","66":"G H A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 LC 0B J K F G H A B C L M I N D O m n o NC OC","66":"6 7 8"},D:{"1":"0 1 2 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC"},F:{"1":"4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H I YC","66":"B C ZC aC bC wB IC cC xB"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"1":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"1":"A","2":"F"},K:{"1":"p xB","2":"A B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","66":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"TLS 1.2",D:true};
+module.exports={A:{A:{"1":"B","2":"J D NC","66":"E F A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 OC 3B I J D E F A B C K L G M N O n o p QC RC","66":"7 8 9"},D:{"1":"0 1 2 3 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC"},F:{"1":"5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F G bC","66":"B C cC dC eC yB LC fC zB"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"1":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"1":"A","2":"D"},K:{"1":"q zB","2":"A B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","66":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"TLS 1.2",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-3.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-3.js
index ca5d76ec3b5c68..82de93bdbb2513 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-3.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/tls1-3.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB NC OC","132":"fB 2B gB","450":"XB YB ZB aB bB cB dB eB 1B"},D:{"1":"0 1 2 oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","706":"aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB"},E:{"1":"M I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB","1028":"L xB 9B"},F:{"1":"dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB YC ZC aC bC wB IC cC xB","706":"aB bB cB"},G:{"1":"D pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:6,C:"TLS 1.3",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB QC RC","132":"gB 5B hB","450":"YB ZB aB bB cB dB eB fB 4B"},D:{"1":"0 1 2 3 pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","706":"bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB"},E:{"1":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB","1028":"K zB BC"},F:{"1":"eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bC cC dC eC yB LC fC zB","706":"bB cB dB"},G:{"1":"sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:6,C:"TLS 1.3",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/touch.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/touch.js
index a29518b1fdcd17..9dbefe892a33ce 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/touch.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/touch.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","8":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","578":"C L M I N D O"},C:{"1":"0 1 2 4 5 6 O m n o YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","4":"3 J K F G H A B C L M I N D","194":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB"},D:{"1":"0 1 2 5 6 7 8 9 o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m n"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"8":"A","260":"B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:2,C:"Touch events",D:true};
+module.exports={A:{A:{"2":"J D E F NC","8":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","578":"C K L G M N O"},C:{"1":"0 1 2 3 5 6 7 O n o p ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","4":"4 I J D E F A B C K L G M N","194":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB"},D:{"1":"0 1 2 3 6 7 8 9 p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n o"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"8":"A","260":"B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:2,C:"Touch events",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/transforms2d.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/transforms2d.js
index 19d2335fc38482..0b0a76a7f48ffe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/transforms2d.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/transforms2d.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G","129":"A B","161":"H"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"C L M I N"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","33":"3 J K F G H A B C L M I NC OC"},D:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","33":"3 J K F G PC 7B QC RC SC"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H YC ZC","33":"4 B C I N D O m n o aC bC wB IC cC"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","33":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","33":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"33":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 2D Transforms",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E","129":"A B","161":"F"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"C K L G M"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","33":"4 I J D E F A B C K L G QC RC"},D:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","33":"4 I J D E SC 9B TC UC VC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F bC cC","33":"5 B C G M N O n o p dC eC yB LC fC"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","33":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"33":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 2D Transforms",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/transforms3d.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/transforms3d.js
index b09139b23a3ba9..82af1a54417bae 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/transforms3d.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/transforms3d.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","132":"A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H NC OC","33":"A B C L M I"},D:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B","33":"4 5 6 7 8 9 C L M I N D O m n o AB BB CB DB EB FB GB HB"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B","33":"3 J K F G QC RC SC","257":"H A B C L M I TC 8B wB xB 9B UC VC AC"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 I N D O m n o"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","33":"G 7B dC JC eC fC gC hC","257":"iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"zC 0C 1C","33":"0B J 2C JC 3C 4C"},J:{"33":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:5,C:"CSS3 3D Transforms",D:true};
+module.exports={A:{A:{"2":"J D E F NC","132":"A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F QC RC","33":"A B C K L G"},D:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B","33":"5 6 7 8 9 C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B","33":"4 I J D E TC UC VC","257":"F A B C K L G WC AC yB zB BC XC YC CC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 G M N O n o p"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","33":"E 9B gC MC hC iC jC kC","257":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"2C 3C 4C","33":"3B I 5C MC 6C 7C"},J:{"33":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:5,C:"CSS3 3D Transforms",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/trusted-types.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/trusted-types.js
index f0131c5fbf29e8..cc4026c270fea3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/trusted-types.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/trusted-types.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"Trusted Types for DOM manipulation",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"Trusted Types for DOM manipulation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ttf.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ttf.js
index 1611a84ee91831..aedaada8bd680c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ttf.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/ttf.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","132":"H A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l ZC aC bC wB IC cC xB","2":"H YC"},G:{"1":"G D JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC"},H:{"2":"yC"},I:{"1":"0B J E 0C 1C 2C JC 3C 4C","2":"zC"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"TTF/OTF - TrueType and OpenType font support",D:true};
+module.exports={A:{A:{"2":"J D E NC","132":"F A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m cC dC eC yB LC fC zB","2":"F bC"},G:{"1":"E MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC"},H:{"2":"1C"},I:{"1":"3B I H 3C 4C 5C MC 6C 7C","2":"2C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"TTF/OTF - TrueType and OpenType font support",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/typedarrays.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/typedarrays.js
index 0a7809c0e5981b..6644d709d8c005 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/typedarrays.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/typedarrays.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"B","2":"K F G H KC","132":"A"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B","260":"QC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H B YC ZC aC bC wB IC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC","260":"JC"},H:{"1":"yC"},I:{"1":"J E 2C JC 3C 4C","2":"0B zC 0C 1C"},J:{"1":"A","2":"F"},K:{"1":"C p xB","2":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Typed Arrays",D:true};
+module.exports={A:{A:{"1":"B","2":"J D E F NC","132":"A"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B","260":"TC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F B bC cC dC eC yB LC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC","260":"MC"},H:{"1":"1C"},I:{"1":"I H 5C MC 6C 7C","2":"3B 2C 3C 4C"},J:{"1":"A","2":"D"},K:{"1":"C q zB","2":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Typed Arrays",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/u2f.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/u2f.js
index 29d8d8c9783923..634968fed364f3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/u2f.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/u2f.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O t u v w x y z E","513":"P Q R S T U V W X Y Z a b c d e f g h i j k l q r s"},C:{"1":"lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y","2":"1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB E 4B 5B 6B MC NC OC","322":"0 TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB z"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB t u v w x y z E 4B 5B 6B","130":"KB LB MB","513":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g","578":"h i j k l q r s"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB xB"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB NB YC ZC aC bC wB IC cC xB","513":"MB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"D sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"1":"KD","322":"JD"}},B:7,C:"FIDO U2F API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O t u v w x y z H","513":"P Q R S T U V W X Y Z a b c d e f g h i j k l m r s"},C:{"1":"mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y","2":"1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB H xB 7B 8B PC QC RC","322":"0 UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB z"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB t u v w x y z H xB 7B 8B","130":"LB MB NB","513":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g","578":"h i j k l m r s"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB zB"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB OB bC cC dC eC yB LC fC zB","513":"NB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"1":"MD","322":"LD"}},B:7,C:"FIDO U2F API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/unhandledrejection.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/unhandledrejection.js
index 730e6e37d80a7c..7a6851ae237324 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/unhandledrejection.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/unhandledrejection.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB NC OC"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB"},G:{"1":"D nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC","16":"mC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:1,C:"unhandledrejection/rejectionhandled events",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB QC RC"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB"},G:{"1":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC","16":"pC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:1,C:"unhandledrejection/rejectionhandled events",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/upgradeinsecurerequests.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/upgradeinsecurerequests.js
index ebf27056ed144a..dd1ff344b99173 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/upgradeinsecurerequests.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/upgradeinsecurerequests.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N"},C:{"1":"0 1 2 OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB NC OC"},D:{"1":"0 1 2 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Upgrade Insecure Requests",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M"},C:{"1":"0 1 2 3 PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB QC RC"},D:{"1":"0 1 2 3 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Upgrade Insecure Requests",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/url-scroll-to-text-fragment.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/url-scroll-to-text-fragment.js
index 430ee8a6e983a1..c4febe2ac54b3f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/url-scroll-to-text-fragment.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/url-scroll-to-text-fragment.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","66":"P Q R"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p","66":"rB sB tB uB vB P Q"},E:{"1":"D CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB"},F:{"1":"mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB YC ZC aC bC wB IC cC xB","66":"kB lB"},G:{"1":"D CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o CD DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"URL Scroll-To-Text Fragment",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","66":"P Q R"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q","66":"sB tB uB vB wB P Q"},E:{"1":"EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B"},F:{"1":"nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB bC cC dC eC yB LC fC zB","66":"lB mB"},G:{"1":"EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p FD GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"URL Scroll-To-Text Fragment",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/url.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/url.js
index 9ec7b6028bfd95..7e367cb3003b55 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/url.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/url.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 LC 0B J K F G H A B C L M I N D O m n o NC OC"},D:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O m n o","130":"5 6 7 8 9 AB BB CB DB"},E:{"1":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC RC","130":"F"},F:{"1":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","130":"I N D O"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC","130":"gC"},H:{"2":"yC"},I:{"1":"E 4C","2":"0B J zC 0C 1C 2C JC","130":"3C"},J:{"2":"F","130":"A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"URL API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 OC 3B I J D E F A B C K L G M N O n o p QC RC"},D:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O n o p","130":"6 7 8 9 AB BB CB DB EB"},E:{"1":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC UC","130":"D"},F:{"1":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","130":"G M N O"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC","130":"jC"},H:{"2":"1C"},I:{"1":"H 7C","2":"3B I 2C 3C 4C 5C MC","130":"6C"},J:{"2":"D","130":"A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"URL API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/urlsearchparams.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/urlsearchparams.js
index 19c89562e8083a..b06f0d296e4248 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/urlsearchparams.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/urlsearchparams.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N"},C:{"1":"0 1 2 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC","132":"BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},D:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB"},E:{"1":"B C L M I D 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC"},F:{"1":"IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB"},G:{"1":"D lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"URLSearchParams",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M"},C:{"1":"0 1 2 3 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC","132":"CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},D:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB"},E:{"1":"B C K L G AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC"},F:{"1":"JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB"},G:{"1":"oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"URLSearchParams",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/use-strict.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/use-strict.js
index 39b533e2b83f6b..d162de457fab36 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/use-strict.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/use-strict.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","132":"3 QC"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H B YC ZC aC bC wB IC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"1":"yC"},I:{"1":"0B J E 2C JC 3C 4C","2":"zC 0C 1C"},J:{"1":"F A"},K:{"1":"C p IC xB","2":"A B wB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"ECMAScript 5 Strict Mode",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","132":"4 TC"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F B bC cC dC eC yB LC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"1":"1C"},I:{"1":"3B I H 5C MC 6C 7C","2":"2C 3C 4C"},J:{"1":"D A"},K:{"1":"C q LC zB","2":"A B yB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"ECMAScript 5 Strict Mode",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/user-select-none.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/user-select-none.js
index 11ceee51c22a42..abd8d61e839f18 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/user-select-none.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/user-select-none.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","33":"A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","33":"C L M I N D O"},C:{"1":"0 1 2 nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","33":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB NC OC"},D:{"1":"0 1 2 aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","33":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB"},E:{"1":"XC","33":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC"},F:{"1":"NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","33":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB"},G:{"33":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","33":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"33":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"33":"A B"},O:{"1":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","33":"J 5C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","33":"JD"}},B:5,C:"CSS user-select: none",D:true};
+module.exports={A:{A:{"2":"J D E F NC","33":"A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","33":"C K L G M N O"},C:{"1":"0 1 2 3 oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","33":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB QC RC"},D:{"1":"0 1 2 3 bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","33":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB"},E:{"1":"aC","33":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC"},F:{"1":"OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","33":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB"},G:{"33":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","33":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"33":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"33":"A B"},O:{"1":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","33":"I 8C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","33":"LD"}},B:5,C:"CSS user-select: none",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/user-timing.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/user-timing.js
index 798e4c336ce31a..131512c0fdb735 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/user-timing.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/user-timing.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB NC OC"},D:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 J K F G H A B C L M I N D O m n o"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"User Timing API",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB QC RC"},D:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 I J D E F A B C K L G M N O n o p"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"User Timing API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/variable-fonts.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/variable-fonts.js
index b4825a35488a74..6ebbab0662febd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/variable-fonts.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/variable-fonts.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB NC OC","4609":"gB hB iB jB kB lB mB nB oB","4674":"2B","5698":"fB","7490":"ZB aB bB cB dB","7746":"eB 1B","8705":"0 1 2 pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB","4097":"kB","4290":"1B fB 2B","6148":"gB hB iB jB"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","4609":"B C wB xB","8193":"L M 9B UC"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB YC ZC aC bC wB IC cC xB","4097":"ZB","6148":"VB WB XB YB"},G:{"1":"D qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC","4097":"mC nC oC pC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"4097":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"2":"J 5C 6C 7C","4097":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:5,C:"Variable fonts",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB QC RC","4609":"hB iB jB kB lB mB nB oB pB","4674":"5B","5698":"gB","7490":"aB bB cB dB eB","7746":"fB 4B","8705":"0 1 2 3 qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB","4097":"lB","4290":"4B gB 5B","6148":"hB iB jB kB"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","4609":"B C yB zB","8193":"K L BC XC"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB bC cC dC eC yB LC fC zB","4097":"aB","6148":"WB XB YB ZB"},G:{"1":"tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC","4097":"pC qC rC sC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"4097":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"2":"I 8C 9C AD","4097":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:5,C:"Variable fonts",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/vector-effect.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/vector-effect.js
index 94ac7c497d3547..06266288104cbb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/vector-effect.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/vector-effect.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M NC OC"},D:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K F G H A B C L M"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","2":"H B YC ZC aC bC wB IC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC"},H:{"1":"yC"},I:{"1":"E 3C 4C","16":"0B J zC 0C 1C 2C JC"},J:{"16":"F A"},K:{"1":"C p xB","2":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"SVG vector-effect: non-scaling-stroke",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L QC RC"},D:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J D E F A B C K L"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","2":"F B bC cC dC eC yB LC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC"},H:{"1":"1C"},I:{"1":"H 6C 7C","16":"3B I 2C 3C 4C 5C MC"},J:{"16":"D A"},K:{"1":"C q zB","2":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"SVG vector-effect: non-scaling-stroke",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/vibration.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/vibration.js
index 9264672343e317..775783a47ca5e5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/vibration.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/vibration.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A NC OC","33":"B C L M I"},D:{"1":"0 1 2 CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C I N YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"Vibration API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A QC RC","33":"B C K L G"},D:{"1":"0 1 2 3 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C G M bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"Vibration API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/video.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/video.js
index e0d609189cafc2..bf81bb337769f2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/video.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/video.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","260":"3 4 J K F G H A B C L M I N D O NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A QC RC SC TC 8B","2":"PC 7B","513":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"1":"G 7B dC JC eC fC gC hC iC jC kC lC","513":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","132":"zC 0C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Video element",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","260":"4 5 I J D E F A B C K L G M N O QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A TC UC VC WC AC","2":"SC 9B","513":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC","513":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","132":"2C 3C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Video element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/videotracks.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/videotracks.js
index bfaf865c4234d5..050b1d1437cdb3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/videotracks.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/videotracks.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"C L M I N D O","322":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB NC OC","194":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB","322":"0 1 2 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K PC 7B QC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB YC ZC aC bC wB IC cC xB","322":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","322":"p"},L:{"322":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"322":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"322":"9B"},R:{"322":"ID"},S:{"194":"JD KD"}},B:1,C:"Video Tracks",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"C K L G M N O","322":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB QC RC","194":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB","322":"0 1 2 3 SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J SC 9B TC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB bC cC dC eC yB LC fC zB","322":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","322":"q"},L:{"322":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"322":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"322":"BC"},R:{"322":"KD"},S:{"194":"LD MD"}},B:1,C:"Video Tracks",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/view-transitions.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/view-transitions.js
index 2c5f891077093a..36d03238ac34f4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/view-transitions.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/view-transitions.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"View Transitions API (single-document)",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"View Transitions API (single-document)",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/viewport-unit-variants.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/viewport-unit-variants.js
index 0aa14427504f9a..41425f201a2250 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/viewport-unit-variants.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/viewport-unit-variants.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r","194":"s t u"},C:{"1":"0 1 2 k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j NC OC"},D:{"1":"0 1 2 v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i","194":"j k l q r s t u"},E:{"1":"D BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC"},F:{"1":"d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z YC ZC aC bC wB IC cC xB","194":"a b c"},G:{"1":"D BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"n o","2":"J m 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:5,C:"Small, Large, and Dynamic viewport units",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r","194":"s t u"},C:{"1":"0 1 2 3 k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j QC RC"},D:{"1":"0 1 2 3 v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i","194":"j k l m r s t u"},E:{"1":"DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC"},F:{"1":"d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z bC cC dC eC yB LC fC zB","194":"a b c"},G:{"1":"DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"o p","2":"I n 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:5,C:"Small, Large, and Dynamic viewport units",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/viewport-units.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/viewport-units.js
index 1148dcbf50a719..4654e11b85cb53 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/viewport-units.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/viewport-units.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","132":"H","260":"A B"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","260":"C L M I"},C:{"1":"0 1 2 4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M I N D O NC OC"},D:{"1":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 J K F G H A B C L M I N D O","260":"5 6 7 m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC","260":"K"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC","516":"gC","772":"fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"260":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"Viewport units: vw, vh, vmin, vmax",D:true};
+module.exports={A:{A:{"2":"J D E NC","132":"F","260":"A B"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","260":"C K L G"},C:{"1":"0 1 2 3 5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L G M N O QC RC"},D:{"1":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 I J D E F A B C K L G M N O","260":"6 7 8 n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC","260":"J"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC","516":"jC","772":"iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"260":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"Viewport units: vw, vh, vmin, vmax",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wai-aria.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wai-aria.js
index 54d438ba7c26ac..47e9183005ee20 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wai-aria.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wai-aria.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F KC","4":"G H A B"},B:{"4":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"4":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"4":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"PC 7B","4":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H","4":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"4":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"4":"yC"},I:{"2":"0B J zC 0C 1C 2C JC","4":"E 3C 4C"},J:{"2":"F A"},K:{"4":"A B C p wB IC xB"},L:{"4":"E"},M:{"4":"E"},N:{"4":"A B"},O:{"4":"yB"},P:{"4":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"4":"9B"},R:{"4":"ID"},S:{"4":"JD KD"}},B:2,C:"WAI-ARIA Accessibility features",D:true};
+module.exports={A:{A:{"2":"J D NC","4":"E F A B"},B:{"4":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"4":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"4":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"SC 9B","4":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F","4":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"4":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"4":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC","4":"H 6C 7C"},J:{"2":"D A"},K:{"4":"A B C q yB LC zB"},L:{"4":"H"},M:{"4":"xB"},N:{"4":"A B"},O:{"4":"0B"},P:{"4":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"4":"BC"},R:{"4":"KD"},S:{"4":"LD MD"}},B:2,C:"WAI-ARIA Accessibility features",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wake-lock.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wake-lock.js
index c9a72637a87137..fea80a5c4c4dea 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wake-lock.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wake-lock.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","194":"P Q R S T U V W X Y"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB","194":"pB qB p rB sB tB uB vB P Q R S T"},E:{"1":"D FC GC HC XC","2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC"},F:{"1":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB YC ZC aC bC wB IC cC xB","194":"eB fB gB hB iB jB kB lB mB nB oB pB qB"},G:{"1":"D FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o DD ED zB FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:4,C:"Screen Wake Lock API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","194":"P Q R S T U V W X Y"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB","194":"qB rB q sB tB uB vB wB P Q R S T"},E:{"1":"HC IC JC 2B KC aC","2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC"},F:{"1":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB bC cC dC eC yB LC fC zB","194":"fB gB hB iB jB kB lB mB nB oB pB qB rB"},G:{"1":"HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p GD HD 1B 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:4,C:"Screen Wake Lock API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wasm.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wasm.js
index b859eb6565edd0..583f101950ca65 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wasm.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wasm.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M","578":"I"},C:{"1":"0 1 2 ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB NC OC","194":"TB UB VB WB XB","1025":"YB"},D:{"1":"0 1 2 dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB","322":"XB YB ZB aB bB cB"},E:{"1":"B C L M I D wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB YC ZC aC bC wB IC cC xB","322":"KB LB MB NB OB PB"},G:{"1":"D mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","194":"JD"}},B:6,C:"WebAssembly",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L","578":"G"},C:{"1":"0 1 2 3 aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB QC RC","194":"UB VB WB XB YB","1025":"ZB"},D:{"1":"0 1 2 3 eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB","322":"YB ZB aB bB cB dB"},E:{"1":"B C K L G yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC"},F:{"1":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB bC cC dC eC yB LC fC zB","322":"LB MB NB OB PB QB"},G:{"1":"pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","194":"LD"}},B:6,C:"WebAssembly",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wav.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wav.js
index 14c2e3216148b9..34ccfd6e413198 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wav.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wav.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC 0B"},D:{"1":"0 1 2 4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l aC bC wB IC cC xB","2":"H YC ZC"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","16":"A"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"Wav audio format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC 3B"},D:{"1":"0 1 2 3 5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m dC eC yB LC fC zB","2":"F bC cC"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","16":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"Wav audio format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wbr-element.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wbr-element.js
index 0189574cf4f66e..256980d60d5a70 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wbr-element.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wbr-element.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F KC","2":"G H A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"PC"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","16":"H"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC"},H:{"1":"yC"},I:{"1":"0B J E 1C 2C JC 3C 4C","16":"zC 0C"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"wbr (word break opportunity) element",D:true};
+module.exports={A:{A:{"1":"J D NC","2":"E F A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"SC"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","16":"F"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC"},H:{"1":"1C"},I:{"1":"3B I H 4C 5C MC 6C 7C","16":"2C 3C"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"wbr (word break opportunity) element",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-animation.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-animation.js
index d13cec2c9c364d..2bc73294c067b4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-animation.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-animation.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","260":"P Q R S"},C:{"1":"0 1 2 R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB NC OC","260":"1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB","516":"TB UB VB WB XB YB ZB aB bB cB dB eB","580":"FB GB HB IB JB KB LB MB NB OB PB QB RB SB","2049":"sB tB uB vB P Q"},D:{"1":"0 1 2 T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB","132":"IB JB KB","260":"LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC 8B","1090":"B C L wB xB","2049":"M 9B UC"},F:{"1":"pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n o YC ZC aC bC wB IC cC xB","132":"5 6 7","260":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC","1090":"mC nC oC pC qC rC sC","2049":"D tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"260":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"260":"9B"},R:{"1":"ID"},S:{"1":"KD","516":"JD"}},B:5,C:"Web Animations API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","260":"P Q R S"},C:{"1":"0 1 2 3 R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB QC RC","260":"4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB","516":"UB VB WB XB YB ZB aB bB cB dB eB fB","580":"GB HB IB JB KB LB MB NB OB PB QB RB SB TB","2049":"tB uB vB wB P Q"},D:{"1":"0 1 2 3 T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB","132":"JB KB LB","260":"MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC AC","1090":"B C K yB zB","2049":"L BC XC"},F:{"1":"qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o p bC cC dC eC yB LC fC zB","132":"6 7 8","260":"9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC","1090":"pC qC rC sC tC uC vC","2049":"wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"260":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"260":"BC"},R:{"1":"KD"},S:{"1":"MD","516":"LD"}},B:5,C:"Web Animations API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-app-manifest.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-app-manifest.js
index f60731ad6ce00c..1a019d74007f33 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-app-manifest.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-app-manifest.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N","130":"D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","578":"tB uB vB P Q R 3B S T U"},D:{"1":"0 1 2 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB"},E:{"2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC","4":"D XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC","4":"D FC GC HC","260":"nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:5,C:"Add to home screen (A2HS)",D:false};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M","130":"N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","578":"uB vB wB P Q R 6B S T U"},D:{"1":"0 1 2 3 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC","4":"2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC","4":"HC IC JC 2B KC","260":"qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:5,C:"Add to home screen (A2HS)",D:false};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-bluetooth.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-bluetooth.js
index ce5d2c90544a13..601e4d4debe3c1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-bluetooth.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-bluetooth.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","1025":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB","194":"RB SB TB UB VB WB XB YB","706":"ZB aB bB","1025":"0 1 2 cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB YC ZC aC bC wB IC cC xB","450":"IB JB KB LB","706":"MB NB OB","1025":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C 4C","1025":"E"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","1025":"p"},L:{"1025":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1025":"yB"},P:{"1":"m n o 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C"},Q:{"2":"9B"},R:{"1025":"ID"},S:{"2":"JD KD"}},B:7,C:"Web Bluetooth",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","1025":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB","194":"SB TB UB VB WB XB YB ZB","706":"aB bB cB","1025":"0 1 2 3 dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB bC cC dC eC yB LC fC zB","450":"JB KB LB MB","706":"NB OB PB","1025":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C 7C","1025":"H"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","1025":"q"},L:{"1025":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1025":"0B"},P:{"1":"n o p 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C"},Q:{"2":"BC"},R:{"1025":"KD"},S:{"2":"LD MD"}},B:7,C:"Web Bluetooth",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-serial.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-serial.js
index 1616c8e994992a..80c6decbd7e180 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-serial.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-serial.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","66":"P Q R S T U V W X"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB","66":"vB P Q R S T U V W X"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB YC ZC aC bC wB IC cC xB","66":"jB kB lB mB nB oB pB qB p rB sB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"Web Serial API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","66":"P Q R S T U V W X"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB","66":"wB P Q R S T U V W X"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB bC cC dC eC yB LC fC zB","66":"kB lB mB nB oB pB qB rB q sB tB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"Web Serial API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-share.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-share.js
index acb7f800cd078d..5d16c1c80dacdf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-share.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/web-share.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q","516":"R S T U V W X Y Z a b c d"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"3 7 8 9 J K F G H A B C L M I N D AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X","130":"4 5 6 O m n o","1028":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"M I D UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB","2049":"L xB 9B"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC","2049":"pC qC rC sC tC"},H:{"2":"yC"},I:{"2":"0B J zC 0C 1C 2C JC 3C","258":"E 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J","258":"5C 6C 7C"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:4,C:"Web Share API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q","516":"R S T U V W X Y Z a b c d"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"4 8 9 I J D E F A B C K L G M N AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X","130":"5 6 7 O n o p","1028":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"L G XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB","2049":"K zB BC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC","2049":"sC tC uC vC wC"},H:{"2":"1C"},I:{"2":"3B I 2C 3C 4C 5C MC 6C","258":"H 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I","258":"8C 9C AD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:4,C:"Web Share API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webauthn.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webauthn.js
index c194dbe3f85cc7..ee60cc6d87b55a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webauthn.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webauthn.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C","226":"L M I N D"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B NC OC","4100":"1 2 E 4B 5B 6B MC","5124":"0 fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z"},D:{"1":"0 1 2 lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB"},E:{"1":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB","322":"xB"},F:{"1":"aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB YC ZC aC bC wB IC cC xB"},G:{"1":"D vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC","578":"rC","2052":"uC","3076":"sC tC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1028":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2":"JD"}},B:2,C:"Web Authentication API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C","226":"K L G M N"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B QC RC","4100":"1 2 3 H xB 7B 8B PC","5124":"0 gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z"},D:{"1":"0 1 2 3 mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB"},E:{"1":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB","322":"zB"},F:{"1":"bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bC cC dC eC yB LC fC zB"},G:{"1":"yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC","578":"uC","2052":"xC","3076":"vC wC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1028":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2":"LD"}},B:2,C:"Web Authentication API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webcodecs.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webcodecs.js
index d4634732b4f6d1..98b3e1fd2a465b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webcodecs.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webcodecs.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c"},E:{"2":"3 J K F G H A B C L M I PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC","132":"D FC GC HC XC"},F:{"1":"Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P YC ZC aC bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC","132":"D FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o FD GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:5,C:"WebCodecs API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC","132":"HC IC JC 2B KC aC"},F:{"1":"Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC","132":"HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p 2B ID JD","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:5,C:"WebCodecs API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgl.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgl.js
index 10e6fd59ccf596..e6c35ae3b11617 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgl.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgl.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"KC","8":"K F G H A","129":"B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","129":"C L M I N D O"},C:{"1":"0 1 2 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","129":"3 4 5 J K F G H A B C L M I N D O m n o"},D:{"1":"0 1 2 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F","129":"4 5 6 7 8 9 G H A B C L M I N D O m n o AB BB CB DB EB"},E:{"1":"G H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B","129":"K F QC RC SC"},F:{"1":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B YC ZC aC bC wB IC cC","129":"C I N D O xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC gC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"1":"A","2":"F"},K:{"1":"C p xB","2":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"8":"A","129":"B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","129":"JD"}},B:6,C:"WebGL - 3D Canvas graphics",D:true};
+module.exports={A:{A:{"2":"NC","8":"J D E F A","129":"B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","129":"C K L G M N O"},C:{"1":"0 1 2 3 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","129":"4 5 6 I J D E F A B C K L G M N O n o p"},D:{"1":"0 1 2 3 GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D","129":"5 6 7 8 9 E F A B C K L G M N O n o p AB BB CB DB EB FB"},E:{"1":"E F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B","129":"J D TC UC VC"},F:{"1":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B bC cC dC eC yB LC fC","129":"C G M N O zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC jC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"1":"A","2":"D"},K:{"1":"C q zB","2":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"8":"A","129":"B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","129":"LD"}},B:6,C:"WebGL - 3D Canvas graphics",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgl2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgl2.js
index ced6f9e435b612..3c0dce87c324fa 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgl2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgl2.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 LC 0B J K F G H A B C L M I N D O m n o NC OC","194":"OB PB QB","450":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB","2242":"RB SB TB UB VB WB"},D:{"1":"0 1 2 cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","578":"PB QB RB SB TB UB VB WB XB YB ZB aB bB"},E:{"1":"I D VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H A PC 7B QC RC SC TC","1090":"B C L M 8B wB xB 9B UC"},F:{"1":"PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB YC ZC aC bC wB IC cC xB"},G:{"1":"D wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC","1090":"oC pC qC rC sC tC uC vC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","2242":"JD"}},B:6,C:"WebGL 2.0",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 OC 3B I J D E F A B C K L G M N O n o p QC RC","194":"PB QB RB","450":"8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB","2242":"SB TB UB VB WB XB"},D:{"1":"0 1 2 3 dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB","578":"QB RB SB TB UB VB WB XB YB ZB aB bB cB"},E:{"1":"G YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A SC 9B TC UC VC WC","1090":"B C K L AC yB zB BC XC"},F:{"1":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB bC cC dC eC yB LC fC zB"},G:{"1":"zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC","1090":"rC sC tC uC vC wC xC yC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p AD BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","2242":"LD"}},B:6,C:"WebGL 2.0",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgpu.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgpu.js
index 5c52a7b9cdfe64..75620d88557313 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgpu.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webgpu.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 E","2":"C L M I N D O P","578":"Q R S T U V W X Y Z a b c","1602":"d e f g h i j k l q r s t u v w x y z"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB NC OC","194":"0 1 2 hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P","578":"Q R S T U V W X Y Z a b c","1602":"d e f g h i j k l q r s t u v w x y z","2049":"0 1 2 E 4B 5B 6B"},E:{"2":"3 J K F G H A B I D PC 7B QC RC SC TC 8B VC AC BC yB WC zB CC DC EC FC GC HC XC","322":"C L M wB xB 9B UC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB YC ZC aC bC wB IC cC xB","578":"p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h","2049":"i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"194":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD","194":"KD"}},B:5,C:"WebGPU",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 H","2":"C K L G M N O P","578":"Q R S T U V W X Y Z a b c","1602":"d e f g h i j k l m r s t u v w x y z"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB QC RC","194":"0 1 2 3 iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P","578":"Q R S T U V W X Y Z a b c","1602":"d e f g h i j k l m r s t u v w x y z","2049":"0 1 2 3 H xB 7B 8B"},E:{"2":"4 I J D E F A B G SC 9B TC UC VC WC AC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","322":"C K L yB zB BC XC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB bC cC dC eC yB LC fC zB","578":"q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h","2049":"i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"194":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD","194":"MD"}},B:5,C:"WebGPU",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webhid.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webhid.js
index df66037a3124ed..ec901525b63036 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webhid.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webhid.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O","66":"P Q R S T U V W X"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB","66":"vB P Q R S T U V W X"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB YC ZC aC bC wB IC cC xB","66":"kB lB mB nB oB pB qB p rB sB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"WebHID API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O","66":"P Q R S T U V W X"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB","66":"wB P Q R S T U V W X"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB bC cC dC eC yB LC fC zB","66":"lB mB nB oB pB qB rB q sB tB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"WebHID API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webkit-user-drag.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webkit-user-drag.js
index 2f2164ba9f5152..ba707c3a4a55f7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webkit-user-drag.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webkit-user-drag.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","132":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"16":"3 J K F G H A B C L M I","132":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"H B C YC ZC aC bC wB IC cC xB","132":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"CSS -webkit-user-drag property",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","132":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"16":"4 I J D E F A B C K L G","132":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"F B C bC cC dC eC yB LC fC zB","132":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"CSS -webkit-user-drag property",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webm.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webm.js
index 1ad3d3d00f4216..d88c35923c47a1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webm.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webm.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G KC","520":"H A B"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","8":"C L","388":"M I N D O"},C:{"1":"0 1 2 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o"},D:{"1":"0 1 2 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J","132":"4 5 6 K F G H A B C L M I N D O m n o"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"PC","8":"3 J 7B QC","520":"K F G H A B C RC SC TC 8B wB","1028":"L xB 9B","7172":"M","8196":"I UC VC AC BC yB WC"},F:{"1":"4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H YC ZC aC","132":"B C I bC wB IC cC xB"},G:{"2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC","1028":"pC qC rC sC tC","3076":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"zC 0C","132":"0B J 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"8":"A B"},O:{"1":"yB"},P:{"1":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD","132":"J"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:6,C:"WebM video format",D:true};
+module.exports={A:{A:{"2":"J D E NC","520":"F A B"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","8":"C K","388":"L G M N O"},C:{"1":"0 1 2 3 BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB"},D:{"1":"0 1 2 3 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I","132":"5 6 7 J D E F A B C K L G M N O n o p"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"SC","8":"4 I 9B TC","520":"J D E F A B C UC VC WC AC yB","1028":"K zB BC","7172":"L","8196":"G XC YC CC DC 0B ZC"},F:{"1":"5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F bC cC dC","132":"B C G eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC","1028":"sC tC uC vC wC","3076":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"2C 3C","132":"3B I 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"8":"A B"},O:{"1":"0B"},P:{"1":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD","132":"I"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:6,C:"WebM video format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webnfc.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webnfc.js
index c94637686d0ebb..1276299ddf14fc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webnfc.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webnfc.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Y Z a b c d e f g h i j k l q r s t u v w x y z E","450":"Q R S T U V W X"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","450":"Q R S T U V W X"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","450":"lB mB nB oB pB qB p rB sB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"257":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"Web NFC",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Y Z a b c d e f g h i j k l m r s t u v w x y z H","450":"Q R S T U V W X"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","450":"Q R S T U V W X"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","450":"mB nB oB pB qB rB q sB tB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"257":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"Web NFC",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webp.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webp.js
index d2621a228da3e3..ece14f79a0e812 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webp.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webp.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D"},C:{"1":"0 1 2 jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","8":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB"},D:{"1":"0 1 2 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J","8":"K F G","132":"4 H A B C L M I N D O m n o","260":"5 6 7 8 9 AB BB CB DB"},E:{"1":"D zB CC DC EC FC GC HC XC","2":"3 J K F G H A B C L PC 7B QC RC SC TC 8B wB xB 9B","516":"M I UC VC AC BC yB WC"},F:{"1":"4 5 6 7 8 9 m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H YC ZC aC","8":"B bC","132":"wB IC cC","260":"C I N D O xB"},G:{"1":"D uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC"},H:{"1":"yC"},I:{"1":"E JC 3C 4C","2":"0B zC 0C 1C","132":"J 2C"},J:{"2":"F A"},K:{"1":"C p wB IC xB","2":"A","132":"B"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","8":"JD"}},B:6,C:"WebP image format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N"},C:{"1":"0 1 2 3 kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","8":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB"},D:{"1":"0 1 2 3 FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I","8":"J D E","132":"5 F A B C K L G M N O n o p","260":"6 7 8 9 AB BB CB DB EB"},E:{"1":"1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F A B C K SC 9B TC UC VC WC AC yB zB BC","516":"L G XC YC CC DC 0B ZC"},F:{"1":"5 6 7 8 9 n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F bC cC dC","8":"B eC","132":"yB LC fC","260":"C G M N O zB"},G:{"1":"xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC"},H:{"1":"1C"},I:{"1":"H MC 6C 7C","2":"3B 2C 3C 4C","132":"I 5C"},J:{"2":"D A"},K:{"1":"C q yB LC zB","2":"A","132":"B"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","8":"LD"}},B:6,C:"WebP image format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/websockets.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/websockets.js
index 98598bce1fa912..6f1af5581d3b29 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/websockets.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/websockets.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B NC OC","132":"3 J","292":"K F G H A"},D:{"1":"0 1 2 4 5 6 7 8 9 N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 J K F G H A B C L M","260":"I"},E:{"1":"F G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","132":"3 QC","260":"K RC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H YC ZC aC bC","132":"B C wB IC cC"},G:{"1":"G D fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC","132":"JC eC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","129":"F"},K:{"1":"p xB","2":"A","132":"B C wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Web Sockets",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B QC RC","132":"4 I","292":"J D E F A"},D:{"1":"0 1 2 3 5 6 7 8 9 M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 I J D E F A B C K L","260":"G"},E:{"1":"D E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","132":"4 TC","260":"J UC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F bC cC dC eC","132":"B C yB LC fC"},G:{"1":"E iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC","132":"MC hC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","129":"D"},K:{"1":"q zB","2":"A","132":"B C yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Web Sockets",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webtransport.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webtransport.js
index a9b107266cfa8e..80983dbe2fd896 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webtransport.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webtransport.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 h i j k l q r s t u v w x y z E","2":"C L M I N D O P Q R S T U V W X Y Z a b c d e f g"},C:{"1":"1 2 E 4B 5B 6B MC","2":"0 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z NC OC"},D:{"1":"0 1 2 g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z e f","66":"a b c d"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o GD HD","2":"J 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:5,C:"WebTransport",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 h i j k l m r s t u v w x y z H","2":"C K L G M N O P Q R S T U V W X Y Z a b c d e f g"},C:{"1":"1 2 3 H xB 7B 8B PC","2":"0 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z QC RC"},D:{"1":"0 1 2 3 g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z e f","66":"a b c d"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p ID JD","2":"I 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:5,C:"WebTransport",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webusb.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webusb.js
index 06169ee1f81cb9..a0a968d1213c8a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webusb.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webusb.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB","66":"aB bB cB dB eB 1B fB"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB YC ZC aC bC wB IC cC xB","66":"NB OB PB QB RB SB TB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"m n o 8C 9C 8B AD BD CD DD ED zB FD GD HD","2":"J 5C 6C 7C"},Q:{"2":"9B"},R:{"1":"ID"},S:{"2":"JD KD"}},B:7,C:"WebUSB",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","66":"bB cB dB eB fB 4B gB"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB bC cC dC eC yB LC fC zB","66":"OB PB QB RB SB TB UB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"n o p BD CD AC DD ED FD GD HD 1B 2B ID JD","2":"I 8C 9C AD"},Q:{"2":"BC"},R:{"1":"KD"},S:{"2":"LD MD"}},B:7,C:"WebUSB",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webvr.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webvr.js
index 3a86cb107dd453..b56dceff581bb3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webvr.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webvr.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","66":"P","257":"I N D O"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB NC OC","129":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","194":"aB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","66":"dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","66":"QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"513":"J","516":"m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:7,C:"WebVR API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","66":"P","257":"G M N O"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB QC RC","129":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","194":"bB"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","66":"eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","66":"RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"513":"I","516":"n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:7,C:"WebVR API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webvtt.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webvtt.js
index f7d57a13c1c98e..7210b2cc6d5ee2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webvtt.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webvtt.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 LC 0B J K F G H A B C L M I N D O m n o NC OC","66":"6 7 8 9 AB BB CB","129":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB","257":"0 1 2 bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"1":"0 1 2 4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 J K F G H A B C L M I N D"},E:{"1":"K F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC eC fC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B J zC 0C 1C 2C JC"},J:{"1":"A","2":"F"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"B","2":"A"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"129":"JD KD"}},B:4,C:"WebVTT - Web Video Text Tracks",D:true};
+module.exports={A:{A:{"1":"A B","2":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 OC 3B I J D E F A B C K L G M N O n o p QC RC","66":"7 8 9 AB BB CB DB","129":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB","257":"0 1 2 3 cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"1":"0 1 2 3 5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 I J D E F A B C K L G M N"},E:{"1":"J D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC hC iC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","2":"D"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"B","2":"A"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"129":"LD MD"}},B:4,C:"WebVTT - Web Video Text Tracks",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webworkers.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webworkers.js
index b302b16bf75225..d21d5c375ad74b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webworkers.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webworkers.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","2":"KC","8":"K F G H"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","8":"LC 0B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","8":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l bC wB IC cC xB","2":"H YC","8":"ZC aC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"E zC 3C 4C","2":"0B J 0C 1C 2C JC"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","8":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Web Workers",D:true};
+module.exports={A:{A:{"1":"A B","2":"NC","8":"J D E F"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","8":"OC 3B"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","8":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m eC yB LC fC zB","2":"F bC","8":"cC dC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"H 2C 6C 7C","2":"3B I 3C 4C 5C MC"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","8":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Web Workers",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webxr.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webxr.js
index f7087a7c45feb9..4f7c834358fc66 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webxr.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/webxr.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"C L M I N D O","132":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB NC OC","322":"0 1 2 uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC"},D:{"2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB","66":"jB kB lB mB nB oB pB qB p rB sB tB uB vB","132":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"2":"3 J K F G H A B C PC 7B QC RC SC TC 8B wB xB","578":"L M I D 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YC ZC aC bC wB IC cC xB","66":"YB ZB aB bB cB dB eB fB gB hB iB jB","132":"kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C wB IC xB","132":"p"},L:{"132":"E"},M:{"322":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J 5C 6C 7C 8C 9C 8B AD","132":"m n o BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD","322":"KD"}},B:4,C:"WebXR Device API",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"C K L G M N O","132":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB QC RC","322":"0 1 2 3 vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC"},D:{"2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB","66":"kB lB mB nB oB pB qB rB q sB tB uB vB wB","132":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"2":"4 I J D E F A B C SC 9B TC UC VC WC AC yB zB","578":"K L G BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB bC cC dC eC yB LC fC zB","66":"ZB aB bB cB dB eB fB gB hB iB jB kB","132":"lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C yB LC zB","132":"q"},L:{"132":"H"},M:{"322":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I 8C 9C AD BD CD AC DD","132":"n o p ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD","322":"MD"}},B:4,C:"WebXR Device API",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/will-change.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/will-change.js
index cedd628bf894c4..4e2461508374cc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/will-change.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/will-change.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L M I N D O"},C:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB NC OC","194":"BB CB DB EB FB GB HB"},D:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},E:{"1":"A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 5 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS will-change property",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K L G M N O"},C:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB QC RC","194":"CB DB EB FB GB HB IB"},D:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},E:{"1":"A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC"},F:{"1":"7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 6 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS will-change property",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/woff.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/woff.js
index bae20d53d5c921..23c3303a7efb3d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/woff.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/woff.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC OC","2":"LC 0B NC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"J"},E:{"1":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J PC 7B"},F:{"1":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l wB IC cC xB","2":"H B YC ZC aC bC"},G:{"1":"G D eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC"},H:{"2":"yC"},I:{"1":"E 3C 4C","2":"0B zC 0C 1C 2C JC","130":"J"},J:{"1":"F A"},K:{"1":"B C p wB IC xB","2":"A"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"WOFF - Web Open Font Format",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC RC","2":"OC 3B QC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"I"},E:{"1":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I SC 9B"},F:{"1":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m yB LC fC zB","2":"F B bC cC dC eC"},G:{"1":"E hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC"},H:{"2":"1C"},I:{"1":"H 6C 7C","2":"3B 2C 3C 4C 5C MC","130":"I"},J:{"1":"D A"},K:{"1":"B C q yB LC zB","2":"A"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"WOFF - Web Open Font Format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/woff2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/woff2.js
index 10fdd713747945..fda53916da34d6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/woff2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/woff2.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"1":"0 1 2 M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","2":"C L"},C:{"1":"0 1 2 LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB NC OC"},D:{"1":"0 1 2 IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","2":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB"},E:{"1":"C L M I D xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"3 J K F G H PC 7B QC RC SC TC","132":"A B 8B wB"},F:{"1":"5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"4 H B C I N D O m n o YC ZC aC bC wB IC cC xB"},G:{"1":"D kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"G 7B dC JC eC fC gC hC iC jC"},H:{"2":"yC"},I:{"1":"E","2":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"2":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:2,C:"WOFF 2.0 - Web Open Font Format",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"1":"0 1 2 3 L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","2":"C K"},C:{"1":"0 1 2 3 MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB QC RC"},D:{"1":"0 1 2 3 JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","2":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB"},E:{"1":"C K L G zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"4 I J D E F SC 9B TC UC VC WC","132":"A B AC yB"},F:{"1":"6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"5 F B C G M N O n o p bC cC dC eC yB LC fC zB"},G:{"1":"nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"E 9B gC MC hC iC jC kC lC mC"},H:{"2":"1C"},I:{"1":"H","2":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"2":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:2,C:"WOFF 2.0 - Web Open Font Format",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/word-break.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/word-break.js
index 00bf3f96a9c6d3..801dc8fc24da69 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/word-break.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/word-break.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"K F G H A B KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"3 LC 0B J K F G H A B C L M NC OC"},D:{"1":"0 1 2 QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB"},E:{"1":"H A B C L M I D TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","4":"3 J K F G PC 7B QC RC SC"},F:{"1":"DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","2":"H B C YC ZC aC bC wB IC cC xB","4":"4 5 6 7 8 9 I N D O m n o AB BB CB"},G:{"1":"D iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","4":"G 7B dC JC eC fC gC hC"},H:{"2":"yC"},I:{"1":"E","4":"0B J zC 0C 1C 2C JC 3C 4C"},J:{"4":"F A"},K:{"1":"p","2":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"CSS3 word-break",D:true};
+module.exports={A:{A:{"1":"J D E F A B NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"4 OC 3B I J D E F A B C K L QC RC"},D:{"1":"0 1 2 3 RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB"},E:{"1":"F A B C K L G WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","4":"4 I J D E SC 9B TC UC VC"},F:{"1":"EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","2":"F B C bC cC dC eC yB LC fC zB","4":"5 6 7 8 9 G M N O n o p AB BB CB DB"},G:{"1":"lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","4":"E 9B gC MC hC iC jC kC"},H:{"2":"1C"},I:{"1":"H","4":"3B I 2C 3C 4C 5C MC 6C 7C"},J:{"4":"D A"},K:{"1":"q","2":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"CSS3 word-break",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wordwrap.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wordwrap.js
index 3de52058fb0536..a56b8594570638 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wordwrap.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/wordwrap.js
@@ -1 +1 @@
-module.exports={A:{A:{"4":"K F G H A B KC"},B:{"1":"0 1 2 O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E","4":"C L M I N D"},C:{"1":"0 1 2 VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","4":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB NC OC"},D:{"1":"0 1 2 5 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","4":"3 4 J K F G H A B C L M I N D O m n o"},E:{"1":"F G H A B C L M I D RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","4":"3 J K PC 7B QC"},F:{"1":"4 5 6 7 8 9 I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H YC ZC","4":"B C aC bC wB IC cC"},G:{"1":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","4":"7B dC JC eC fC"},H:{"4":"yC"},I:{"1":"E 3C 4C","4":"0B J zC 0C 1C 2C JC"},J:{"1":"A","4":"F"},K:{"1":"p","4":"A B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"4":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"KD","4":"JD"}},B:4,C:"CSS3 Overflow-wrap",D:true};
+module.exports={A:{A:{"4":"J D E F A B NC"},B:{"1":"0 1 2 3 O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","4":"C K L G M N"},C:{"1":"0 1 2 3 WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","4":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB QC RC"},D:{"1":"0 1 2 3 6 7 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","4":"4 5 I J D E F A B C K L G M N O n o p"},E:{"1":"D E F A B C K L G UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","4":"4 I J SC 9B TC"},F:{"1":"5 6 7 8 9 G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F bC cC","4":"B C dC eC yB LC fC"},G:{"1":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","4":"9B gC MC hC iC"},H:{"4":"1C"},I:{"1":"H 6C 7C","4":"3B I 2C 3C 4C 5C MC"},J:{"1":"A","4":"D"},K:{"1":"q","4":"A B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"4":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"MD","4":"LD"}},B:4,C:"CSS3 Overflow-wrap",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/x-doc-messaging.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/x-doc-messaging.js
index 8f1dc7d2e5238f..8976faf17f051b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/x-doc-messaging.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/x-doc-messaging.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F KC","132":"G H","260":"A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC","2":"LC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"PC 7B"},F:{"1":"4 5 6 7 8 9 B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB","2":"H"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"4":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"Cross-document messaging",D:true};
+module.exports={A:{A:{"2":"J D NC","132":"E F","260":"A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC","2":"OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"SC 9B"},F:{"1":"5 6 7 8 9 B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB","2":"F"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"4":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"Cross-document messaging",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/x-frame-options.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/x-frame-options.js
index 4c8c2b44d2058c..010c73352ac098 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/x-frame-options.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/x-frame-options.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"G H A B","2":"K F KC"},B:{"1":"C L M I N D O","4":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB","4":"0 1 2 3 J K F G H A B C L M I N D oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","16":"LC 0B NC OC"},D:{"4":"0 1 2 8 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 4 5 6 7 J K F G H A B C L M I N D O m n o"},E:{"4":"K F G H A B C L M I D QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","16":"3 J PC 7B"},F:{"4":"4 5 6 7 8 9 C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l cC xB","16":"H B YC ZC aC bC wB IC"},G:{"4":"G D gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","16":"7B dC JC eC fC"},H:{"2":"yC"},I:{"4":"J E 2C JC 3C 4C","16":"0B zC 0C 1C"},J:{"4":"F A"},K:{"4":"p xB","16":"A B C wB IC"},L:{"4":"E"},M:{"4":"E"},N:{"1":"A B"},O:{"4":"yB"},P:{"4":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"4":"9B"},R:{"4":"ID"},S:{"1":"JD","4":"KD"}},B:6,C:"X-Frame-Options HTTP header",D:true};
+module.exports={A:{A:{"1":"E F A B","2":"J D NC"},B:{"1":"C K L G M N O","4":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB","4":"0 1 2 3 4 I J D E F A B C K L G M N pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","16":"OC 3B QC RC"},D:{"4":"0 1 2 3 9 AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 5 6 7 8 I J D E F A B C K L G M N O n o p"},E:{"4":"J D E F A B C K L G TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","16":"4 I SC 9B"},F:{"4":"5 6 7 8 9 C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m fC zB","16":"F B bC cC dC eC yB LC"},G:{"4":"E jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","16":"9B gC MC hC iC"},H:{"2":"1C"},I:{"4":"I H 5C MC 6C 7C","16":"3B 2C 3C 4C"},J:{"4":"D A"},K:{"4":"q zB","16":"A B C yB LC"},L:{"4":"H"},M:{"4":"xB"},N:{"1":"A B"},O:{"4":"0B"},P:{"4":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"4":"BC"},R:{"4":"KD"},S:{"1":"LD","4":"MD"}},B:6,C:"X-Frame-Options HTTP header",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhr2.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhr2.js
index 494909dfb09625..64c3a14cc7e393 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhr2.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhr2.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H KC","132":"A B"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","2":"LC 0B","260":"A B","388":"K F G H","900":"3 J NC OC"},D:{"1":"0 1 2 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","16":"3 J K","132":"BB CB","388":"4 5 6 7 8 9 F G H A B C L M I N D O m n o AB"},E:{"1":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","2":"J PC 7B","132":"F RC","388":"3 K QC"},F:{"1":"4 5 6 7 8 9 C O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l xB","2":"H B YC ZC aC bC wB IC cC","132":"I N D"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","2":"7B dC JC","132":"gC","388":"eC fC"},H:{"2":"yC"},I:{"1":"E 4C","2":"zC 0C 1C","388":"3C","900":"0B J 2C JC"},J:{"132":"A","388":"F"},K:{"1":"C p xB","2":"A B wB IC"},L:{"1":"E"},M:{"1":"E"},N:{"132":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"XMLHttpRequest advanced features",D:true};
+module.exports={A:{A:{"2":"J D E F NC","132":"A B"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","2":"OC 3B","260":"A B","388":"J D E F","900":"4 I QC RC"},D:{"1":"0 1 2 3 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","16":"4 I J","132":"CB DB","388":"5 6 7 8 9 D E F A B C K L G M N O n o p AB BB"},E:{"1":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","2":"I SC 9B","132":"D UC","388":"4 J TC"},F:{"1":"5 6 7 8 9 C O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m zB","2":"F B bC cC dC eC yB LC fC","132":"G M N"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","2":"9B gC MC","132":"jC","388":"hC iC"},H:{"2":"1C"},I:{"1":"H 7C","2":"2C 3C 4C","388":"6C","900":"3B I 5C MC"},J:{"132":"A","388":"D"},K:{"1":"C q zB","2":"A B yB LC"},L:{"1":"H"},M:{"1":"xB"},N:{"132":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"XMLHttpRequest advanced features",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhtml.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhtml.js
index 038c385931907f..7a659f3d35e3d4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhtml.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhtml.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"H A B","2":"K F G KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"1":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"1":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"1":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"1":"yC"},I:{"1":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"1":"F A"},K:{"1":"A B C p wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:1,C:"XHTML served as application/xhtml+xml",D:true};
+module.exports={A:{A:{"1":"F A B","2":"J D E NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"1":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"1":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"1":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"1":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"1":"1C"},I:{"1":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"1":"D A"},K:{"1":"A B C q yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:1,C:"XHTML served as application/xhtml+xml",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhtmlsmil.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhtmlsmil.js
index 981c1cafaa1d24..836190acd94521 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhtmlsmil.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xhtmlsmil.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"H A B KC","4":"K F G"},B:{"2":"C L M I N D O","8":"0 1 2 P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"8":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"8":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B"},E:{"8":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"8":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"8":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"8":"yC"},I:{"8":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"8":"F A"},K:{"8":"A B C p wB IC xB"},L:{"8":"E"},M:{"8":"E"},N:{"2":"A B"},O:{"8":"yB"},P:{"8":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"8":"9B"},R:{"8":"ID"},S:{"8":"JD KD"}},B:7,C:"XHTML+SMIL animation",D:true};
+module.exports={A:{A:{"2":"F A B NC","4":"J D E"},B:{"2":"C K L G M N O","8":"0 1 2 3 P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"8":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"8":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B"},E:{"8":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"8":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"8":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"8":"1C"},I:{"8":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"8":"D A"},K:{"8":"A B C q yB LC zB"},L:{"8":"H"},M:{"8":"xB"},N:{"2":"A B"},O:{"8":"0B"},P:{"8":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"8":"BC"},R:{"8":"KD"},S:{"8":"LD MD"}},B:7,C:"XHTML+SMIL animation",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xml-serializer.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xml-serializer.js
index 4b3fade5914984..27c22f8c2ea9ed 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xml-serializer.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/xml-serializer.js
@@ -1 +1 @@
-module.exports={A:{A:{"1":"A B","260":"K F G H KC"},B:{"1":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"1":"0 1 2 4 5 6 7 8 9 C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC","132":"B","260":"3 LC 0B J K F NC OC","516":"G H A"},D:{"1":"0 1 2 DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B","132":"3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB"},E:{"1":"G H A B C L M I D SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC","132":"3 J K F PC 7B QC RC"},F:{"1":"4 5 6 7 8 9 O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l","16":"H YC","132":"B C I N D ZC aC bC wB IC cC xB"},G:{"1":"G D hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC","132":"7B dC JC eC fC gC"},H:{"132":"yC"},I:{"1":"E 3C 4C","132":"0B J zC 0C 1C 2C JC"},J:{"132":"F A"},K:{"1":"p","16":"A","132":"B C wB IC xB"},L:{"1":"E"},M:{"1":"E"},N:{"1":"A B"},O:{"1":"yB"},P:{"1":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"1":"9B"},R:{"1":"ID"},S:{"1":"JD KD"}},B:4,C:"DOM Parsing and Serialization",D:true};
+module.exports={A:{A:{"1":"A B","260":"J D E F NC"},B:{"1":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"1":"0 1 2 3 5 6 7 8 9 C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC","132":"B","260":"4 OC 3B I J D QC RC","516":"E F A"},D:{"1":"0 1 2 3 EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B","132":"4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB"},E:{"1":"E F A B C K L G VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC","132":"4 I J D SC 9B TC UC"},F:{"1":"5 6 7 8 9 O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m","16":"F bC","132":"B C G M N cC dC eC yB LC fC zB"},G:{"1":"E kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC","132":"9B gC MC hC iC jC"},H:{"132":"1C"},I:{"1":"H 6C 7C","132":"3B I 2C 3C 4C 5C MC"},J:{"132":"D A"},K:{"1":"q","16":"A","132":"B C yB LC zB"},L:{"1":"H"},M:{"1":"xB"},N:{"1":"A B"},O:{"1":"0B"},P:{"1":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"1":"BC"},R:{"1":"KD"},S:{"1":"LD MD"}},B:4,C:"DOM Parsing and Serialization",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/zstd.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/zstd.js
index 6f81dfd98deb0f..c0fbffa36795e1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/zstd.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/features/zstd.js
@@ -1 +1 @@
-module.exports={A:{A:{"2":"K F G H A B KC"},B:{"2":"0 1 2 C L M I N D O P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E"},C:{"2":"0 1 2 3 4 5 6 7 8 9 LC 0B J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B 5B 6B MC NC OC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 J K F G H A B C L M I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB 1B fB 2B gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R S T U V W X Y Z a b c d e f g h i j k l q r s t u v w x y z E 4B","194":"5B 6B"},E:{"2":"3 J K F G H A B C L M I D PC 7B QC RC SC TC 8B wB xB 9B UC VC AC BC yB WC zB CC DC EC FC GC HC XC"},F:{"2":"4 5 6 7 8 9 H B C I N D O m n o AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB p rB sB tB uB vB P Q R 3B S T U V W X Y Z a b c d e f g h i j k l YC ZC aC bC wB IC cC xB"},G:{"2":"G D 7B dC JC eC fC gC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC AC BC yB xC zB CC DC EC FC GC HC"},H:{"2":"yC"},I:{"2":"0B J E zC 0C 1C 2C JC 3C 4C"},J:{"2":"F A"},K:{"2":"A B C p wB IC xB"},L:{"2":"E"},M:{"2":"E"},N:{"2":"A B"},O:{"2":"yB"},P:{"2":"J m n o 5C 6C 7C 8C 9C 8B AD BD CD DD ED zB FD GD HD"},Q:{"2":"9B"},R:{"2":"ID"},S:{"2":"JD KD"}},B:6,C:"zstd (Zstandard) content-encoding",D:true};
+module.exports={A:{A:{"2":"J D E F A B NC"},B:{"2":"0 1 2 3 C K L G M N O P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H"},C:{"2":"0 1 2 3 4 5 6 7 8 9 OC 3B I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H xB 7B 8B PC QC RC"},D:{"2":"0 1 2 3 4 5 6 7 8 9 I J D E F A B C K L G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB 4B gB 5B hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R S T U V W X Y Z a b c d e f g h i j k l m r s t u v w x y z H","194":"xB 7B 8B"},E:{"2":"4 I J D E F A B C K L G SC 9B TC UC VC WC AC yB zB BC XC YC CC DC 0B ZC 1B EC FC GC HC IC JC 2B KC aC"},F:{"2":"5 6 7 8 9 F B C G M N O n o p AB BB CB DB EB FB GB HB IB JB KB LB MB NB OB PB QB RB SB TB UB VB WB XB YB ZB aB bB cB dB eB fB gB hB iB jB kB lB mB nB oB pB qB rB q sB tB uB vB wB P Q R 6B S T U V W X Y Z a b c d e f g h i j k l m bC cC dC eC yB LC fC zB"},G:{"2":"E 9B gC MC hC iC jC kC lC mC nC oC pC qC rC sC tC uC vC wC xC yC zC CC DC 0B 0C 1B EC FC GC HC IC JC 2B KC"},H:{"2":"1C"},I:{"2":"3B I H 2C 3C 4C 5C MC 6C 7C"},J:{"2":"D A"},K:{"2":"A B C q yB LC zB"},L:{"2":"H"},M:{"2":"xB"},N:{"2":"A B"},O:{"2":"0B"},P:{"2":"I n o p 8C 9C AD BD CD AC DD ED FD GD HD 1B 2B ID JD"},Q:{"2":"BC"},R:{"2":"KD"},S:{"2":"LD MD"}},B:6,C:"zstd (Zstandard) content-encoding",D:true};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AD.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AD.js
index 57ff028fedea47..4166a6245dfca5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AD.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AD.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00364,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.02547,"49":0,"50":0,"51":0,"52":0.00364,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00364,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00364,"103":0,"104":0,"105":0,"106":0,"107":0.01819,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00364,"114":0.00728,"115":0.20009,"116":0.57844,"117":0.00728,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00364},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00364,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00364,"39":0.00364,"40":0.00364,"41":0.00364,"42":0,"43":0.01091,"44":0.00728,"45":0.00364,"46":0.00364,"47":0.00364,"48":0,"49":0.00364,"50":0,"51":0.00364,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00364,"78":0,"79":0.00364,"80":0.00364,"81":0,"83":0,"84":0,"85":0,"86":0.01819,"87":0.00364,"88":0,"89":0.00364,"90":0,"91":0.03274,"92":0.02183,"93":0,"94":0,"95":0,"96":0,"97":0.00364,"98":0,"99":0,"100":0,"101":0,"102":0.00364,"103":0.05093,"104":0,"105":0,"106":0,"107":0.00364,"108":0.00364,"109":0.30923,"110":0,"111":0.00728,"112":0.01091,"113":0.04729,"114":0.40746,"115":2.72122,"116":1.90267,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00364,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00364,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00364,"96":0,"97":0,"98":0,"99":0.00728,"100":0.12733,"101":0.11278,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00364},B:{"12":0.00364,"13":0,"14":0.00364,"15":0,"16":0,"17":0,"18":0.00364,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.00364,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00364,"107":0,"108":0,"109":0.00728,"110":0.00364,"111":0,"112":0.00728,"113":0.00364,"114":0.05093,"115":0.77126,"116":0.25102},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00364,"9":0.00728,"10":0,"11":0,"12":0,"13":0,"14":0.01455,"15":0,"17":0.09095,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.05457,"14.1":0.07276,"15.1":0.02183,"15.2-15.3":0.03274,"15.4":0.04366,"15.5":0.08731,"15.6":0.36744,"16.0":0.10186,"16.1":0.12005,"16.2":0.11642,"16.3":0.31287,"16.4":0.17462,"16.5":1.39335,"16.6":1.90267},G:{"8":0,"17":0.57439,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.01172,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01172,"8.1-8.4":0.04103,"9.0-9.2":0,"9.3":0.08206,"10.0-10.2":0,"10.3":0.04103,"11.0-11.2":0.02344,"11.3-11.4":0,"12.0-12.1":0.01758,"12.2-12.5":0.12308,"13.0-13.1":0.00586,"13.2":0,"13.3":0,"13.4-13.7":0.04103,"14.0-14.4":0.01172,"14.5-14.8":0.24031,"15.0-15.1":0.11136,"15.2-15.3":0.54509,"15.4":0.24617,"15.5":0.52164,"15.6-15.7":4.25521,"16.0":2.08657,"16.1":4.42518,"16.2":1.78179,"16.3":3.81562,"16.4":0.64473,"16.5":11.72819,"16.6":27.16064},P:{"4":0.01062,"20":0.01062,"21":0.04249,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0.06374,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0.00473,"4":0.02521,"2.1":0,"2.2":0.02206,"2.3":0.01733,"4.1":0.02364,"4.2-4.3":0.03782,"4.4":0,"4.4.3-4.4.4":0.12922},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00364,"7":0.00728,"8":0.04002,"9":0.00728,"10":0.00728,"11":0.0291,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.01272,"11":0.01272},L:{"0":25.81718},R:{_:"0"},M:{"0":0.27357},Q:{"13.1":0},O:{"0":0.03817},H:{"0":0.06625}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.03369,"49":0,"50":0,"51":0,"52":0.00421,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00421,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01263,"79":0,"80":0.00421,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00842,"102":0,"103":0.00842,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00421,"112":0,"113":0.00421,"114":0.00421,"115":0.07159,"116":0.03369,"117":0.67376,"118":0.05895,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0.00421,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0.00421,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00421,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00421,"45":0.00421,"46":0.00421,"47":0.00421,"48":0,"49":0.00842,"50":0,"51":0.00421,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00842,"80":0,"81":0.00421,"83":0,"84":0.00421,"85":0.01263,"86":0.00421,"87":0.00842,"88":0.00421,"89":0.00421,"90":0,"91":0.02527,"92":0.01684,"93":0,"94":0,"95":0,"96":0.00842,"97":0,"98":0,"99":0.02106,"100":0.01263,"101":0,"102":0,"103":0.04211,"104":0,"105":0.00842,"106":0,"107":0,"108":0.00421,"109":0.40426,"110":0.0379,"111":0.00421,"112":0.01263,"113":0.02948,"114":0.12633,"115":0.40426,"116":5.19637,"117":2.20235,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00421,"99":0.00421,"100":0.02527,"101":0.32004,"102":0.26108,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00421,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00421,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00421,"108":0,"109":0.00842,"110":0,"111":0,"112":0,"113":0,"114":0.00842,"115":0.0379,"116":0.5727,"117":0.48848},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00421,"10":0,"11":0,"12":0,"13":0,"14":0.02106,"15":0.00421,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.09264,"14.1":0.05474,"15.1":0.04632,"15.2-15.3":0.0379,"15.4":0.06317,"15.5":0.06738,"15.6":0.3832,"16.0":0.16002,"16.1":0.12633,"16.2":0.13475,"16.3":0.45479,"16.4":0.15581,"16.5":0.5348,"16.6":3.11614,"17.0":0.28214,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.03336,"8.1-8.4":0.0278,"9.0-9.2":0,"9.3":0.0278,"10.0-10.2":0,"10.3":0.03336,"11.0-11.2":0.02224,"11.3-11.4":0,"12.0-12.1":0.0278,"12.2-12.5":0.17236,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.06116,"14.0-14.4":0.03892,"14.5-14.8":0.18348,"15.0-15.1":0.14456,"15.2-15.3":0.68943,"15.4":0.2224,"15.5":0.49483,"15.6-15.7":3.31929,"16.0":2.10722,"16.1":3.4972,"16.2":1.32883,"16.3":2.72437,"16.4":0.54487,"16.5":2.27402,"16.6":33.36521,"17.0":3.53056,"17.1":0.00556},P:{"4":0.0409,"20":0.01023,"21":0.06135,"22":1.19642,"5.0-5.4":0,"6.2-6.4":0.01023,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02045,"12.0":0,"13.0":0,"14.0":0.02045,"15.0":0.01023,"16.0":0,"17.0":0.01023,"18.0":0,"19.0":0.02045},I:{"0":0,"3":0.00236,"4":0.00943,"2.1":0.00825,"2.2":0.00825,"2.3":0.01179,"4.1":0.01061,"4.2-4.3":0.02358,"4.4":0,"4.4.3-4.4.4":0.06837},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0379,"9":0.00421,"10":0.00842,"11":0.02527,"5.5":0},S:{"2.5":0.00579,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0.01158},L:{"0":25.02781},R:{_:"0"},M:{"0":0.19104},Q:{"13.1":0},O:{"0":0.02316},H:{"0":0.07673}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AE.js
index b6296fcba7d5a0..932de97b6ce042 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00268,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00536,"103":0.00268,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00268,"110":0,"111":0.00268,"112":0,"113":0.00268,"114":0.00268,"115":0.04824,"116":0.1474,"117":0.00536,"118":0.00268,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00536,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.09648,"36":0,"37":0,"38":0.00268,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00268,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00268,"57":0,"58":0.00268,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00268,"66":0,"67":0,"68":0,"69":0.0268,"70":0,"71":0,"72":0,"73":0.00268,"74":0,"75":0.00268,"76":0.00536,"77":0,"78":0.00268,"79":0.01072,"80":0.00268,"81":0.00268,"83":0.00268,"84":0.00268,"85":0.00536,"86":0.00536,"87":0.00536,"88":0.00268,"89":0.00268,"90":0.00268,"91":0.00268,"92":0.00268,"93":0.01608,"94":0,"95":0.00268,"96":0,"97":0.00268,"98":0.00804,"99":0.01072,"100":0.00536,"101":0.00536,"102":0.00536,"103":0.04288,"104":0.00536,"105":0.00536,"106":0.00804,"107":0.00536,"108":0.0134,"109":0.32696,"110":0.00804,"111":0.03216,"112":0.01876,"113":0.0536,"114":0.23316,"115":2.546,"116":1.4338,"117":0.00268,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00268,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00268,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00536,"72":0.01072,"73":0,"74":0.00536,"75":0.00804,"76":0.00804,"77":0.00804,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0.00268,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00268,"96":0.00268,"97":0,"98":0,"99":0.00804,"100":0.09112,"101":0.0536,"102":0.00268,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00268,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00268,"109":0.00804,"110":0.00268,"111":0.00268,"112":0,"113":0.00268,"114":0.02412,"115":0.47168,"116":0.1474},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00268,"14":0.01072,"15":0.00268,"17":0.00804,_:"0","3.1":0,"3.2":0,"5.1":0.00268,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00268,"13.1":0.01072,"14.1":0.02948,"15.1":0.00804,"15.2-15.3":0.00268,"15.4":0.00804,"15.5":0.01608,"15.6":0.06164,"16.0":0.00804,"16.1":0.0268,"16.2":0.02144,"16.3":0.0536,"16.4":0.03752,"16.5":0.13668,"16.6":0.19564},G:{"8":0,"17":0.24649,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00919,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0689,"10.0-10.2":0.00153,"10.3":0.05512,"11.0-11.2":0.00766,"11.3-11.4":0.00306,"12.0-12.1":0.00459,"12.2-12.5":0.20056,"13.0-13.1":0.00306,"13.2":0.00459,"13.3":0.01225,"13.4-13.7":0.03215,"14.0-14.4":0.07808,"14.5-14.8":0.18832,"15.0-15.1":0.11176,"15.2-15.3":0.09033,"15.4":0.08421,"15.5":0.15923,"15.6-15.7":1.18195,"16.0":0.57107,"16.1":0.74561,"16.2":0.4394,"16.3":0.89565,"16.4":0.18525,"16.5":2.95027,"16.6":6.97073},P:{"4":0.08186,"20":0.0614,"21":0.10233,"5.0-5.4":0.01023,"6.2-6.4":0,"7.2-7.4":0.02047,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01023,"12.0":0.01023,"13.0":0.01023,"14.0":0,"15.0":0,"16.0":0.01023,"17.0":0.02047,"18.0":0.01023,"19.0":0.0307},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.08072},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04288,"5.5":0},S:{"2.5":0.00732,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":68.5188},R:{_:"0"},M:{"0":0.15372},Q:{"13.1":0.00732},O:{"0":4.01136},H:{"0":1.03259}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00305,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00305,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00305,"103":0.00609,"104":0,"105":0.00305,"106":0,"107":0,"108":0,"109":0.00305,"110":0.00305,"111":0,"112":0,"113":0,"114":0,"115":0.02133,"116":0.01524,"117":0.1554,"118":0.01524,"119":0.00305,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00305,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.14626,"36":0,"37":0,"38":0.00305,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00305,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00305,"66":0,"67":0,"68":0.00305,"69":0.00305,"70":0,"71":0,"72":0.00305,"73":0.00914,"74":0,"75":0.00305,"76":0.00609,"77":0,"78":0.00305,"79":0.01524,"80":0.00305,"81":0.00609,"83":0.00305,"84":0.00609,"85":0.01219,"86":0.00609,"87":0.00914,"88":0.00914,"89":0.00305,"90":0.00305,"91":0.00609,"92":0.00305,"93":0.01219,"94":0.00305,"95":0.00305,"96":0,"97":0.00305,"98":0.00609,"99":0.00914,"100":0.01219,"101":0.01524,"102":0.00609,"103":0.05789,"104":0.01219,"105":0.01219,"106":0.00914,"107":0.01524,"108":0.01524,"109":0.49666,"110":0.01524,"111":0.07313,"112":0.02133,"113":0.18587,"114":0.10665,"115":0.11883,"116":4.10126,"117":0.95066,"118":0.00305,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00305,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00305,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00305,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00305,"71":0,"72":0.01219,"73":0.00609,"74":0.00305,"75":0.00609,"76":0,"77":0.04266,"78":0.01219,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00305,"95":0.00305,"96":0.00305,"97":0.00305,"98":0,"99":0.00609,"100":0.02742,"101":0.07313,"102":0.08836,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00305,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00305,"108":0.00914,"109":0.00609,"110":0,"111":0.00305,"112":0,"113":0.00305,"114":0.00914,"115":0.02438,"116":0.42963,"117":0.29556},E:{"4":0,"5":0,"6":0,"7":0,"8":0.01524,"9":0,"10":0,"11":0.00305,"12":0,"13":0.00305,"14":0.01219,"15":0.00305,_:"0","3.1":0,"3.2":0,"5.1":0.00305,"6.1":0,"7.1":0,"9.1":0.00305,"10.1":0,"11.1":0,"12.1":0.00305,"13.1":0.00914,"14.1":0.03961,"15.1":0.00609,"15.2-15.3":0.00609,"15.4":0.01219,"15.5":0.02133,"15.6":0.07008,"16.0":0.00609,"16.1":0.03047,"16.2":0.02438,"16.3":0.06094,"16.4":0.02438,"16.5":0.06094,"16.6":0.39306,"17.0":0.03961,"17.1":0},G:{"8":0.0016,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0032,"6.0-6.1":0,"7.0-7.1":0.01282,"8.1-8.4":0,"9.0-9.2":0.0016,"9.3":0.05769,"10.0-10.2":0.00641,"10.3":0.05769,"11.0-11.2":0.01282,"11.3-11.4":0.00801,"12.0-12.1":0.00641,"12.2-12.5":0.20031,"13.0-13.1":0.00641,"13.2":0.00641,"13.3":0.00961,"13.4-13.7":0.03525,"14.0-14.4":0.09134,"14.5-14.8":0.16025,"15.0-15.1":0.10737,"15.2-15.3":0.0657,"15.4":0.08012,"15.5":0.13461,"15.6-15.7":1.1618,"16.0":0.49356,"16.1":0.66663,"16.2":0.37498,"16.3":0.77239,"16.4":0.13942,"16.5":0.53523,"16.6":9.21905,"17.0":1.38454,"17.1":0.0032},P:{"4":0.09204,"20":0.05114,"21":0.07159,"22":1.58521,"5.0-5.4":0.01023,"6.2-6.4":0,"7.2-7.4":0.02045,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01023,"12.0":0,"13.0":0.01023,"14.0":0,"15.0":0,"16.0":0.01023,"17.0":0.02045,"18.0":0.02045,"19.0":0.03068},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.08524},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.09446,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.05963},R:{_:"0"},M:{"0":0.16687},Q:{"13.1":0},O:{"0":3.14971},H:{"0":0.90182}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AF.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AF.js
index 26d8766f6154f8..23ee2e99c6f137 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AF.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AF.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00144,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00144,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00144,"100":0,"101":0,"102":0.00144,"103":0,"104":0,"105":0.00144,"106":0,"107":0,"108":0.00144,"109":0,"110":0,"111":0,"112":0,"113":0.00144,"114":0.00287,"115":0.04598,"116":0.04311,"117":0.00287,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00144,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00144,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00144,"63":0.00144,"64":0,"65":0.00144,"66":0,"67":0.00144,"68":0,"69":0.00144,"70":0,"71":0.00144,"72":0.00144,"73":0.00144,"74":0,"75":0,"76":0.00144,"77":0,"78":0.00287,"79":0.00287,"80":0.00144,"81":0.00144,"83":0.00431,"84":0,"85":0.00144,"86":0.00287,"87":0.00144,"88":0.00144,"89":0.00144,"90":0,"91":0.00144,"92":0.00144,"93":0.00144,"94":0.00144,"95":0.00144,"96":0.00144,"97":0,"98":0.00144,"99":0.00144,"100":0.00287,"101":0,"102":0.00287,"103":0.00575,"104":0.00144,"105":0.00287,"106":0.00287,"107":0.00575,"108":0.00287,"109":0.30321,"110":0.00431,"111":0.00287,"112":0.00719,"113":0.00575,"114":0.0388,"115":0.45409,"116":0.26297,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00287,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00431,"70":0.05604,"71":0.01724,"72":0.02587,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00144,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01437,"96":0,"97":0,"98":0,"99":0.00287,"100":0.0115,"101":0.02012,"102":0.00144,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00144,"13":0,"14":0.00144,"15":0,"16":0.00431,"17":0.00144,"18":0.00862,"79":0,"80":0,"81":0.00144,"83":0,"84":0.00144,"85":0,"86":0,"87":0,"88":0,"89":0.00287,"90":0.00287,"91":0,"92":0.01437,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00287,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00575,"110":0.00144,"111":0.00144,"112":0.00144,"113":0.00144,"114":0.00719,"115":0.11209,"116":0.03161},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00144,"15":0,"17":0.01437,_:"0","3.1":0,"3.2":0,"5.1":0.00287,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00144,"14.1":0.00144,"15.1":0.00287,"15.2-15.3":0.00144,"15.4":0.00575,"15.5":0.00719,"15.6":0.01724,"16.0":0.00144,"16.1":0.01006,"16.2":0.00862,"16.3":0.02012,"16.4":0.01293,"16.5":0.09341,"16.6":0.09628},G:{"8":0,"17":0.27629,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00135,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00813,"10.0-10.2":0,"10.3":0.00948,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.00813,"12.2-12.5":0.25733,"13.0-13.1":0.00271,"13.2":0.00135,"13.3":0.00813,"13.4-13.7":0.01896,"14.0-14.4":0.11783,"14.5-14.8":0.11377,"15.0-15.1":0.10022,"15.2-15.3":0.17878,"15.4":0.17742,"15.5":0.16659,"15.6-15.7":1.51285,"16.0":0.47403,"16.1":0.57832,"16.2":0.43476,"16.3":0.92775,"16.4":0.49435,"16.5":3.18009,"16.6":4.48301},P:{"4":0.24148,"20":0.15092,"21":0.23142,"22":0.81498,"5.0-5.4":0.08049,"6.2-6.4":0.05031,"7.2-7.4":0.17105,"8.2":0.01006,"9.2":0.09055,"10.1":0,"11.1-11.2":0.05031,"12.0":0.01006,"13.0":0.07043,"14.0":0.03018,"15.0":0.02012,"16.0":0.08049,"17.0":0.06037,"18.0":0.09055,"19.0":0.16098},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00272,"4.4":0,"4.4.3-4.4.4":0.10182},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0273,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.1078},R:{_:"0"},M:{"0":0.05994},Q:{"13.1":0},O:{"0":1.09606},H:{"0":1.03768}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00145,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00145,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00145,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00145,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00145,"114":0.00145,"115":0.03199,"116":0.00436,"117":0.04362,"118":0.00291,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00145,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00145,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00291,"63":0.00145,"64":0,"65":0,"66":0,"67":0.00145,"68":0,"69":0.00145,"70":0.00145,"71":0.00291,"72":0.00145,"73":0.00145,"74":0,"75":0,"76":0,"77":0,"78":0.00145,"79":0.00145,"80":0.00291,"81":0.00291,"83":0.00145,"84":0,"85":0.00145,"86":0.00291,"87":0.00291,"88":0,"89":0.00145,"90":0.00145,"91":0.00145,"92":0.00291,"93":0.00145,"94":0.00291,"95":0,"96":0.00291,"97":0.00145,"98":0,"99":0.00145,"100":0,"101":0,"102":0.00436,"103":0.00291,"104":0,"105":0.00145,"106":0.00291,"107":0.00582,"108":0.01018,"109":0.29516,"110":0.00145,"111":0.00291,"112":0.01018,"113":0.00582,"114":0.01454,"115":0.01745,"116":0.6165,"117":0.14976,"118":0.00145,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00291,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00145,"70":0.04653,"71":0.00582,"72":0.02326,"73":0.00291,"74":0,"75":0,"76":0,"77":0.00291,"78":0,"79":0.00145,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01018,"96":0,"97":0,"98":0,"99":0,"100":0.00145,"101":0.01599,"102":0.01745,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00145,"13":0,"14":0.00291,"15":0,"16":0.00436,"17":0.00145,"18":0.01163,"79":0,"80":0,"81":0,"83":0,"84":0.00145,"85":0,"86":0,"87":0,"88":0,"89":0.00291,"90":0.00436,"91":0,"92":0.0189,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00145,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00872,"110":0.00145,"111":0.00291,"112":0.00291,"113":0.00145,"114":0.00582,"115":0.00436,"116":0.07997,"117":0.05671},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00145,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0.00291,"15.2-15.3":0.00291,"15.4":0.00291,"15.5":0.00436,"15.6":0.0189,"16.0":0.00145,"16.1":0.01454,"16.2":0.00436,"16.3":0.0189,"16.4":0.01163,"16.5":0.03635,"16.6":0.15558,"17.0":0.02617,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00288,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02301,"10.0-10.2":0,"10.3":0.01438,"11.0-11.2":0,"11.3-11.4":0.00288,"12.0-12.1":0.00863,"12.2-12.5":0.2517,"13.0-13.1":0.00863,"13.2":0.00288,"13.3":0.01438,"13.4-13.7":0.0187,"14.0-14.4":0.10068,"14.5-14.8":0.08054,"15.0-15.1":0.09493,"15.2-15.3":0.1467,"15.4":0.14383,"15.5":0.22293,"15.6-15.7":1.43107,"16.0":0.5336,"16.1":0.64434,"16.2":0.41997,"16.3":0.74214,"16.4":0.39552,"16.5":1.02117,"16.6":6.43766,"17.0":1.4886,"17.1":0.00144},P:{"4":0.26537,"20":0.10207,"21":0.14289,"22":0.7757,"5.0-5.4":0.06124,"6.2-6.4":0.05103,"7.2-7.4":0.26537,"8.2":0.01021,"9.2":0.08165,"10.1":0.01021,"11.1-11.2":0.03062,"12.0":0,"13.0":0.04083,"14.0":0.03062,"15.0":0.01021,"16.0":0.08165,"17.0":0.06124,"18.0":0.04083,"19.0":0.08165},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00099,"4.4":0,"4.4.3-4.4.4":0.06809},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03053,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.22315},R:{_:"0"},M:{"0":0.03418},Q:{"13.1":0},O:{"0":0.77769},H:{"0":0.87381}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AG.js
index 477d3603ff47e3..344f2976de29a5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.01756,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.01053,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00351,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00351,"114":0.01053,"115":0.11937,"116":0.27386,"117":0.00351,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00351,"50":0,"51":0,"52":0,"53":0.02107,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00351,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00351,"75":0,"76":0.00702,"77":0,"78":0,"79":0.01404,"80":0,"81":0.00351,"83":0.00351,"84":0,"85":0,"86":0.00702,"87":0,"88":0.00702,"89":0,"90":0,"91":0.00351,"92":0,"93":0.04213,"94":0,"95":0,"96":0,"97":0,"98":0.00351,"99":0,"100":0,"101":0,"102":0.01404,"103":0.01756,"104":0,"105":0,"106":0.01053,"107":0,"108":0.00351,"109":0.34408,"110":0.01053,"111":0.00351,"112":0.02458,"113":0.02809,"114":0.28088,"115":3.70762,"116":1.74146,"117":0.0316,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.02458,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.02107,"72":0.02107,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.08426,"101":0.10533,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00351,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.00351,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00351,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00351,"99":0,"100":0,"101":0,"102":0.00351,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01756,"110":0,"111":0,"112":0.00351,"113":0.00702,"114":0.10884,"115":1.7239,"116":0.38972},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01404,"15":0,"17":0.23524,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02107,"14.1":0.0316,"15.1":0.00702,"15.2-15.3":0.00702,"15.4":0.00351,"15.5":0.01053,"15.6":0.12991,"16.0":0.05618,"16.1":0.02809,"16.2":0.05267,"16.3":0.0632,"16.4":0.02809,"16.5":0.30195,"16.6":0.2563},G:{"8":0,"17":0.15581,"3.2":0.00806,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.11283,"6.0-6.1":0,"7.0-7.1":0.02418,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00269,"10.0-10.2":0,"10.3":0.04836,"11.0-11.2":0.00806,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.22029,"13.0-13.1":0,"13.2":0,"13.3":0.00537,"13.4-13.7":0.00537,"14.0-14.4":0.24447,"14.5-14.8":0.17999,"15.0-15.1":0.02418,"15.2-15.3":0.13432,"15.4":0.08328,"15.5":0.18268,"15.6-15.7":1.86438,"16.0":0.79518,"16.1":1.43993,"16.2":0.63131,"16.3":2.00408,"16.4":0.33043,"16.5":5.97463,"16.6":12.37371},P:{"4":0.35731,"20":0.14076,"21":0.41145,"5.0-5.4":0.02166,"6.2-6.4":0,"7.2-7.4":0.14076,"8.2":0,"9.2":0.04331,"10.1":0,"11.1-11.2":0.04331,"12.0":0,"13.0":0.02166,"14.0":0.01083,"15.0":0.02166,"16.0":0.03248,"17.0":0.04331,"18.0":0.01083,"19.0":0.05414},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":2.04478},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.01756,"11":0.00702,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":52.22282},R:{_:"0"},M:{"0":0.11031},Q:{"13.1":0},O:{"0":0.03893},H:{"0":0.28259}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00388,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00388,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00388,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00388,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00388,"115":0.06588,"116":0.03488,"117":0.34488,"118":0.02713,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00775,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00388,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00775,"77":0,"78":0,"79":0.00775,"80":0,"81":0,"83":0,"84":0.00388,"85":0.00775,"86":0.01163,"87":0.00388,"88":0.00388,"89":0,"90":0,"91":0.00388,"92":0,"93":0.031,"94":0.00775,"95":0,"96":0,"97":0,"98":0.00388,"99":0,"100":0,"101":0,"102":0.00388,"103":0.05038,"104":0,"105":0,"106":0.00775,"107":0,"108":0.00775,"109":0.372,"110":0.00775,"111":0.00388,"112":0.00388,"113":0.01938,"114":0.08913,"115":0.2325,"116":5.74663,"117":1.26713,"118":0.00388,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.02325,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00388,"72":0.00775,"73":0,"74":0,"75":0,"76":0,"77":0.04263,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00388,"96":0,"97":0,"98":0,"99":0.00775,"100":0.03875,"101":0.06588,"102":0.05038,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.00775,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00388,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00775,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02325,"110":0,"111":0.00388,"112":0,"113":0.00388,"114":0.0155,"115":0.0465,"116":1.18575,"117":0.75563},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00388,"15":0.00388,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02325,"14.1":0.02713,"15.1":0.00775,"15.2-15.3":0.00775,"15.4":0.00388,"15.5":0.01163,"15.6":0.10463,"16.0":0.14725,"16.1":0.02713,"16.2":0.02713,"16.3":0.09688,"16.4":0.06588,"16.5":0.0775,"16.6":1.44925,"17.0":0.062,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.05479,"6.0-6.1":0,"7.0-7.1":0.00548,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00822,"10.0-10.2":0,"10.3":0.01918,"11.0-11.2":0.00548,"11.3-11.4":0.00274,"12.0-12.1":0,"12.2-12.5":0.20272,"13.0-13.1":0,"13.2":0.00274,"13.3":0.01096,"13.4-13.7":0.01096,"14.0-14.4":0.13697,"14.5-14.8":0.07944,"15.0-15.1":0.06849,"15.2-15.3":0.09588,"15.4":0.05479,"15.5":0.16437,"15.6-15.7":1.43547,"16.0":0.5835,"16.1":1.31494,"16.2":0.44653,"16.3":1.4026,"16.4":0.37804,"16.5":0.76979,"16.6":17.99822,"17.0":1.8327,"17.1":0},P:{"4":0.18405,"20":0.07578,"21":0.46554,"22":4.29809,"5.0-5.4":0.02165,"6.2-6.4":0,"7.2-7.4":0.24901,"8.2":0,"9.2":0.02165,"10.1":0,"11.1-11.2":0.04331,"12.0":0,"13.0":0.03248,"14.0":0.02165,"15.0":0,"16.0":0.02165,"17.0":0.04331,"18.0":0.03248,"19.0":0.03248},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":2.23938},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.01938,"11":0.00775,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":49.158},R:{_:"0"},M:{"0":0.06125},Q:{"13.1":0},O:{"0":0.049},H:{"0":0.51609}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AI.js
index 3aa717c92d6e4c..8d5bd2cb857396 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.05415,"116":0.29783,"117":0.02166,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.01083,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00542,"93":0.00542,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.02166,"101":0,"102":0.00542,"103":0.03249,"104":0.00542,"105":0,"106":0.01083,"107":0,"108":0,"109":0.26534,"110":0,"111":0,"112":0,"113":0.14621,"114":1.68948,"115":5.702,"116":2.63169,"117":0.00542,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":3.02699,"100":0.15162,"101":6.11895,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00542,"106":0,"107":0,"108":0,"109":0.01083,"110":0,"111":0,"112":0,"113":0,"114":0.19494,"115":2.2743,"116":0.84474},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.00542,"13":0,"14":0.01083,"15":0,"17":0.53609,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00542,"13.1":0.01625,"14.1":0.02166,"15.1":0.08123,"15.2-15.3":0,"15.4":0,"15.5":0.00542,"15.6":0.09206,"16.0":0.01083,"16.1":0.0704,"16.2":0.02166,"16.3":0.1787,"16.4":0.01625,"16.5":2.58837,"16.6":0.44945},G:{"8":0,"17":0.06966,"3.2":0,"4.0-4.1":0.0055,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.044,"11.0-11.2":0.0055,"11.3-11.4":0,"12.0-12.1":0.0055,"12.2-12.5":0.01283,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0.15765,"15.0-15.1":0.02383,"15.2-15.3":0.15032,"15.4":0.58478,"15.5":0.10082,"15.6-15.7":0.69844,"16.0":0.39597,"16.1":1.945,"16.2":0.33364,"16.3":1.92117,"16.4":0.30247,"16.5":3.81668,"16.6":7.75252},P:{"4":0.16594,"20":0.05186,"21":0.12445,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.0726,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.03111,"14.0":0,"15.0":0,"16.0":0,"17.0":0.45633,"18.0":0.23854,"19.0":0.02074},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.31451},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":47.87822},R:{_:"0"},M:{"0":0.04127},Q:{"13.1":0},O:{"0":0},H:{"0":0.02604}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01377,"116":0.00459,"117":0.60601,"118":0.01377,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.03673,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.01377,"94":0,"95":0,"96":0.00918,"97":0.00918,"98":0.02755,"99":0,"100":0.01377,"101":0.01377,"102":0,"103":0.13773,"104":0,"105":0.00918,"106":0.00459,"107":0,"108":0.00459,"109":0.28464,"110":0.00459,"111":0.01377,"112":0,"113":0.18823,"114":0.14691,"115":0.08723,"116":8.34185,"117":1.42321,"118":0.01377,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.01377,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00918,"101":0.16987,"102":0.26628,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00459,"110":0,"111":0,"112":0,"113":0,"114":0.00459,"115":0.03673,"116":2.02463,"117":1.73999},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00459,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00459,"13.1":0.07805,"14.1":0.03214,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.01377,"15.6":0.16987,"16.0":0,"16.1":0.04591,"16.2":0.18823,"16.3":0.05968,"16.4":0.05509,"16.5":0.28464,"16.6":0.68865,"17.0":0.03214,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.01718,"11.0-11.2":0.00736,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.10064,"13.0-13.1":0.00736,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.02455,"14.5-14.8":1.72564,"15.0-15.1":0.12519,"15.2-15.3":0.01473,"15.4":0.19392,"15.5":0.08346,"15.6-15.7":0.41484,"16.0":0.32893,"16.1":0.4222,"16.2":0.19392,"16.3":1.04815,"16.4":0.12764,"16.5":1.13406,"16.6":17.63684,"17.0":0.77813,"17.1":0},P:{"4":0.06412,"20":0.12825,"21":0.16031,"22":5.51456,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.11756,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01069,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.01069,"17.0":0.44886,"18.0":0.04275,"19.0":0.12825},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.89525},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04591,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":47.17131},R:{_:"0"},M:{"0":0.10818},Q:{"13.1":0},O:{"0":0},H:{"0":0.03585}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AL.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AL.js
index 79e77a8556f37b..44f1127eb29664 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AL.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AL.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00188,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00188,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00564,"103":0.00188,"104":0,"105":0,"106":0,"107":0.01317,"108":0.00188,"109":0,"110":0,"111":0,"112":0,"113":0.00188,"114":0.00188,"115":0.07148,"116":0.12415,"117":0.00376,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00188,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.04514,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00188,"64":0,"65":0,"66":0,"67":0,"68":0.00188,"69":0,"70":0.00188,"71":0.00188,"72":0,"73":0,"74":0,"75":0.00188,"76":0,"77":0,"78":0.00188,"79":0.01693,"80":0.00188,"81":0.00188,"83":0.00376,"84":0.00188,"85":0.00188,"86":0.00376,"87":0.00564,"88":0.00188,"89":0.00188,"90":0.00188,"91":0.00564,"92":0.00188,"93":0.00188,"94":0,"95":0.00188,"96":0.00188,"97":0.00376,"98":0,"99":0.00188,"100":0,"101":0,"102":0.00188,"103":0.00752,"104":0.00564,"105":0.00188,"106":0.00188,"107":0.00376,"108":0.00564,"109":0.43639,"110":0.00376,"111":0.00376,"112":0.01317,"113":0.01881,"114":0.12038,"115":0.99693,"116":0.65083,"117":0.00188,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00188,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00376,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00188,"70":0,"71":0.00376,"72":0.00188,"73":0,"74":0,"75":0,"76":0.00188,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00188,"90":0,"91":0,"92":0,"93":0.00188,"94":0,"95":0.00376,"96":0.00188,"97":0,"98":0,"99":0,"100":0.03198,"101":0.03762,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00376,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00188,"105":0,"106":0,"107":0.00188,"108":0,"109":0.00188,"110":0,"111":0,"112":0.00188,"113":0,"114":0.00752,"115":0.12038,"116":0.04138},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00376,"15":0.00188,"17":0.00941,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00188,"10.1":0,"11.1":0,"12.1":0.00188,"13.1":0.00376,"14.1":0.00564,"15.1":0.00376,"15.2-15.3":0.00188,"15.4":0.00752,"15.5":0.01129,"15.6":0.04891,"16.0":0.00376,"16.1":0.01317,"16.2":0.01693,"16.3":0.03762,"16.4":0.01881,"16.5":0.11662,"16.6":0.16177},G:{"8":0,"17":0.50183,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.09535,"8.1-8.4":0,"9.0-9.2":0.00502,"9.3":0.02007,"10.0-10.2":0,"10.3":0.08029,"11.0-11.2":0.03011,"11.3-11.4":0,"12.0-12.1":0.00502,"12.2-12.5":0.46169,"13.0-13.1":0,"13.2":0,"13.3":0.01505,"13.4-13.7":0.05018,"14.0-14.4":0.2459,"14.5-14.8":0.64736,"15.0-15.1":0.24088,"15.2-15.3":0.18066,"15.4":0.28103,"15.5":0.61224,"15.6-15.7":4.59679,"16.0":1.917,"16.1":2.76008,"16.2":1.37502,"16.3":3.08125,"16.4":0.62729,"16.5":10.85966,"16.6":21.45836},P:{"4":0.1618,"20":0.06067,"21":0.20225,"22":2.90226,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.0809,"8.2":0,"9.2":0.01011,"10.1":0,"11.1-11.2":0.02022,"12.0":0.14157,"13.0":0.05056,"14.0":0.05056,"15.0":0.04045,"16.0":0.06067,"17.0":0.09101,"18.0":0.02022,"19.0":0.06067},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.04797,"4.2-4.3":0.00293,"4.4":0,"4.4.3-4.4.4":0.01355},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00188,"9":0,"10":0,"11":0.00564,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":41.05793},R:{_:"0"},M:{"0":0.27605},Q:{"13.1":0},O:{"0":0.02436},H:{"0":0.1691}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00175,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00175,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0035,"103":0,"104":0,"105":0,"106":0.0035,"107":0.00175,"108":0.0035,"109":0,"110":0,"111":0,"112":0,"113":0.00175,"114":0,"115":0.02975,"116":0.00525,"117":0.10325,"118":0.00875,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00175,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0105,"50":0,"51":0.00175,"52":0,"53":0,"54":0,"55":0.0035,"56":0.0035,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.0035,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00175,"69":0,"70":0.00175,"71":0.00175,"72":0,"73":0,"74":0,"75":0.00175,"76":0.00175,"77":0,"78":0,"79":0.01225,"80":0,"81":0,"83":0.0035,"84":0.00175,"85":0.00175,"86":0.00175,"87":0.00175,"88":0.00175,"89":0.00175,"90":0.00175,"91":0.00175,"92":0.00525,"93":0,"94":0,"95":0.00175,"96":0,"97":0.00175,"98":0,"99":0,"100":0,"101":0.00175,"102":0.00175,"103":0.00525,"104":0,"105":0.0035,"106":0.00525,"107":0.0035,"108":0.007,"109":0.36225,"110":0.00175,"111":0.007,"112":0.00525,"113":0.0035,"114":0.01925,"115":0.02975,"116":1.07625,"117":0.3185,"118":0.0035,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00175,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.007,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00175,"70":0,"71":0,"72":0.0035,"73":0.00175,"74":0,"75":0,"76":0,"77":0.00525,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0035,"96":0,"97":0,"98":0,"99":0,"100":0.0035,"101":0.028,"102":0.035,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00175,"90":0.00175,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00175,"107":0,"108":0.00175,"109":0.00525,"110":0,"111":0,"112":0.00175,"113":0.00175,"114":0,"115":0.0035,"116":0.06475,"117":0.06475},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00175,"10":0,"11":0,"12":0,"13":0,"14":0.00175,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00175,"13.1":0.0035,"14.1":0.0035,"15.1":0.00175,"15.2-15.3":0.00175,"15.4":0.00525,"15.5":0.014,"15.6":0.063,"16.0":0.00175,"16.1":0.01225,"16.2":0.01225,"16.3":0.028,"16.4":0.0105,"16.5":0.063,"16.6":0.29225,"17.0":0.02625,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.09223,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02306,"10.0-10.2":0,"10.3":0.05764,"11.0-11.2":0.02882,"11.3-11.4":0,"12.0-12.1":0.00576,"12.2-12.5":0.50147,"13.0-13.1":0,"13.2":0,"13.3":0.01153,"13.4-13.7":0.0634,"14.0-14.4":0.21327,"14.5-14.8":0.51877,"15.0-15.1":0.13257,"15.2-15.3":0.25362,"15.4":0.3055,"15.5":1.02024,"15.6-15.7":5.10697,"16.0":1.64853,"16.1":2.56501,"16.2":1.33727,"16.3":2.34022,"16.4":0.57641,"16.5":1.63123,"16.6":33.34518,"17.0":4.51327,"17.1":0.01153},P:{"4":0.14371,"20":0.06159,"21":0.18477,"22":3.0897,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.11291,"8.2":0,"9.2":0.01026,"10.1":0,"11.1-11.2":0.03079,"12.0":0.01026,"13.0":0.03079,"14.0":0.04106,"15.0":0.01026,"16.0":0.06159,"17.0":0.10265,"18.0":0.02053,"19.0":0.07185},I:{"0":0,"3":0,"4":0.00339,"2.1":0,"2.2":0.00226,"2.3":0.00226,"4.1":0.0237,"4.2-4.3":0.00564,"4.4":0,"4.4.3-4.4.4":0.03725},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00175,"9":0,"10":0,"11":0.00175,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":35.356},R:{_:"0"},M:{"0":0.2145},Q:{"13.1":0},O:{"0":0.066},H:{"0":0.18745}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AM.js
index 1b8f7dbb3aab3d..115158176719ce 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":38.62886,"53":0,"54":0,"55":0,"56":0.00727,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02182,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.01454,"109":0,"110":0,"111":0,"112":0,"113":0.02909,"114":0.00727,"115":0.15998,"116":0.29815,"117":0.00727,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01454,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.02182,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.01454,"80":0,"81":0.00727,"83":0,"84":0,"85":0.00727,"86":0.00727,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00727,"96":0,"97":0.02182,"98":0.02182,"99":0.00727,"100":0.00727,"101":0.00727,"102":0.01454,"103":0.02182,"104":0.00727,"105":0.00727,"106":0.02182,"107":0.01454,"108":0.04363,"109":1.59257,"110":0.01454,"111":0.02909,"112":0.05818,"113":0.04363,"114":0.31997,"115":5.18494,"116":2.76336,"117":0.00727,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.02182,"72":0.02182,"73":0,"74":0,"75":0,"76":0.07272,"77":0.00727,"78":0,"79":0.0509,"80":0,"81":0,"82":0.00727,"83":0,"84":0,"85":0.00727,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04363,"96":0,"97":0,"98":0,"99":0.02182,"100":0.19634,"101":0.51631,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00727,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00727,"110":0,"111":0.00727,"112":0,"113":0,"114":0.01454,"115":0.45814,"116":0.1309},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00727,"14":0.02182,"15":0,"17":0.00727,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.06545,"14.1":0.02182,"15.1":0.00727,"15.2-15.3":0.05818,"15.4":0.02909,"15.5":0.01454,"15.6":0.05818,"16.0":0.00727,"16.1":0.07272,"16.2":0.01454,"16.3":0.09454,"16.4":0.02182,"16.5":0.13817,"16.6":0.21089},G:{"8":0,"17":0.23208,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00142,"6.0-6.1":0.00285,"7.0-7.1":0.01424,"8.1-8.4":0.00285,"9.0-9.2":0.01851,"9.3":0.05126,"10.0-10.2":0,"10.3":0.03702,"11.0-11.2":0.00997,"11.3-11.4":0.0057,"12.0-12.1":0.0057,"12.2-12.5":0.27194,"13.0-13.1":0.00427,"13.2":0.00142,"13.3":0.02136,"13.4-13.7":0.03559,"14.0-14.4":0.15519,"14.5-14.8":0.22638,"15.0-15.1":0.08828,"15.2-15.3":0.13668,"15.4":0.08828,"15.5":0.10678,"15.6-15.7":1.33837,"16.0":0.53819,"16.1":0.63217,"16.2":0.33744,"16.3":0.766,"16.4":0.25344,"16.5":2.95437,"16.6":5.89451},P:{"4":0.01016,"20":0.06095,"21":0.08127,"22":0.77205,"5.0-5.4":0.01016,"6.2-6.4":0,"7.2-7.4":0.04063,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01016,"12.0":0.01016,"13.0":0.01016,"14.0":0,"15.0":0,"16.0":0.01016,"17.0":0.02032,"18.0":0.01016,"19.0":0.02032},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.00244,"4.1":0.00488,"4.2-4.3":0.00732,"4.4":0,"4.4.3-4.4.4":0.02808},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00727,"9":0,"10":0,"11":0.02909,"5.5":0},S:{"2.5":0.00273,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":29.97987},R:{_:"0"},M:{"0":0.07638},Q:{"13.1":0},O:{"0":0.0873},H:{"0":0.27377}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.01442,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":35.46107,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00721,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.04325,"72":0,"73":0,"74":0.09372,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00721,"101":0,"102":0.00721,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00721,"109":0,"110":0,"111":0.02163,"112":0.00721,"113":0,"114":0.00721,"115":0.10814,"116":0.02884,"117":0.3172,"118":0.02884,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01442,"50":0,"51":0,"52":0,"53":0.07209,"54":0,"55":0,"56":0,"57":0,"58":0.00721,"59":0,"60":0,"61":0,"62":0,"63":0.03605,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.03605,"71":0,"72":0,"73":0,"74":0.02163,"75":0,"76":0.0793,"77":0,"78":0,"79":0.06488,"80":0.0793,"81":0.00721,"83":0.17302,"84":0.02163,"85":0.02884,"86":0.05046,"87":0.00721,"88":0,"89":0.00721,"90":0.14418,"91":0.08651,"92":0.12255,"93":0.0793,"94":0.02884,"95":0.00721,"96":0,"97":0.05767,"98":0.04325,"99":0.07209,"100":0.01442,"101":0,"102":0.16581,"103":0.11534,"104":0,"105":0.05046,"106":0.06488,"107":0.04325,"108":0.10093,"109":1.62203,"110":0.02884,"111":0.02163,"112":0.02163,"113":0.02163,"114":0.10814,"115":0.22348,"116":6.22858,"117":1.50668,"118":0.01442,"119":0,"120":0},F:{"9":0,"11":0,"12":0.08651,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.01442,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0.02884,"63":0,"64":0,"65":0,"66":0,"67":0.00721,"68":0,"69":0.00721,"70":0.02884,"71":0,"72":0.02163,"73":0.00721,"74":0,"75":0,"76":0.03605,"77":0.04325,"78":0,"79":0.00721,"80":0,"81":0,"82":0.00721,"83":0,"84":0.02163,"85":0.00721,"86":0,"87":0.00721,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.02884,"94":0,"95":0.02884,"96":0,"97":0,"98":0,"99":0.00721,"100":0.02884,"101":0.47579,"102":0.27394,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.01442,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.01442,"108":0,"109":0,"110":0.04325,"111":0,"112":0,"113":0,"114":0.00721,"115":0.01442,"116":0.29557,"117":0.2379},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00721,"15":0.00721,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00721,"14.1":0.01442,"15.1":0.00721,"15.2-15.3":0.02163,"15.4":0.01442,"15.5":0.00721,"15.6":0.05046,"16.0":0.00721,"16.1":0.05767,"16.2":0.01442,"16.3":0.06488,"16.4":0.02163,"16.5":0.05046,"16.6":0.33882,"17.0":0.02884,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00381,"6.0-6.1":0.00953,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0324,"10.0-10.2":0,"10.3":0.02287,"11.0-11.2":0.00953,"11.3-11.4":0.00572,"12.0-12.1":0.00762,"12.2-12.5":0.20585,"13.0-13.1":0.00191,"13.2":0.00381,"13.3":6.44613,"13.4-13.7":0.03431,"14.0-14.4":0.09911,"14.5-14.8":0.21729,"15.0-15.1":0.06671,"15.2-15.3":0.0629,"15.4":0.05337,"15.5":0.13533,"15.6-15.7":1.06737,"16.0":0.41932,"16.1":0.49747,"16.2":0.29924,"16.3":0.4765,"16.4":0.12389,"16.5":0.47078,"16.6":6.93979,"17.0":1.23891,"17.1":0},P:{"4":0,"20":0.02073,"21":0.0622,"22":0.72566,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.02073,"8.2":0.0311,"9.2":0,"10.1":0,"11.1-11.2":0.01037,"12.0":0,"13.0":0.01037,"14.0":0,"15.0":0,"16.0":0.01037,"17.0":0.01037,"18.0":0.01037,"19.0":0.0311},I:{"0":0,"3":0,"4":0.00201,"2.1":0,"2.2":0,"2.3":0.00603,"4.1":0.00302,"4.2-4.3":0.00603,"4.4":0,"4.4.3-4.4.4":0.02011},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00721,"9":0,"10":0,"11":0.02884,"5.5":0},S:{"2.5":0.00279,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":26.34846},R:{_:"0"},M:{"0":0.06698},Q:{"13.1":0},O:{"0":0.11722},H:{"0":0.17175}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AO.js
index 562706814b344a..25d64b00b3e895 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.0041,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0041,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0041,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.0041,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.0041,"98":0,"99":0.01229,"100":0,"101":0,"102":0.01229,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.0041,"109":0.00819,"110":0,"111":0.00819,"112":0.0041,"113":0.02049,"114":0.00819,"115":0.12701,"116":0.18027,"117":0.0041,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0041,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.04097,"32":0,"33":0,"34":0,"35":0.01229,"36":0,"37":0,"38":0,"39":0,"40":0.01229,"41":0,"42":0.0041,"43":0.02868,"44":0,"45":0,"46":0.0041,"47":0,"48":0,"49":0.0041,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.0041,"60":0.0041,"61":0,"62":0,"63":0.0041,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.0041,"71":0,"72":0,"73":0.00819,"74":0,"75":0,"76":0,"77":0.0041,"78":0.0041,"79":0.01229,"80":0,"81":0.02868,"83":0.0041,"84":0.0041,"85":0,"86":0.01229,"87":0.02458,"88":0.01229,"89":0.00819,"90":0.0041,"91":0.01229,"92":0.0041,"93":0.00819,"94":0.00819,"95":0.00819,"96":0,"97":0,"98":0,"99":0.00819,"100":0.0041,"101":0.0041,"102":0.01639,"103":0.02458,"104":0,"105":0.0041,"106":0.0041,"107":0.00819,"108":0.01229,"109":1.0898,"110":0.02458,"111":0.0041,"112":0.01639,"113":0.03687,"114":0.11881,"115":2.4623,"116":1.78629,"117":0.01229,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.02868,"62":0,"63":0.0041,"64":0,"65":0,"66":0.00819,"67":0.00819,"68":0,"69":0.02049,"70":0.02049,"71":0.03687,"72":0.02458,"73":0,"74":0,"75":0.0041,"76":0,"77":0,"78":0,"79":0.00819,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.0041,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.08604,"96":0,"97":0,"98":0,"99":0.0041,"100":0.06146,"101":0.22534,"102":0.0041,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.0041,"13":0.0041,"14":0.0041,"15":0.01229,"16":0,"17":0,"18":0.01229,"79":0,"80":0,"81":0,"83":0,"84":0.0041,"85":0.0041,"86":0,"87":0,"88":0,"89":0.0041,"90":0.0041,"91":0,"92":0.01229,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00819,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.03687,"110":0.0041,"111":0.00819,"112":0.01639,"113":0.01229,"114":0.04507,"115":0.91363,"116":0.4097},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0.0041,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01639,"14.1":0.0041,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.01229,"16.0":0,"16.1":0,"16.2":0,"16.3":0.0041,"16.4":0,"16.5":0.01229,"16.6":0.02458},G:{"8":0.00234,"17":0.0316,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00468,"5.0-5.1":0.00234,"6.0-6.1":0,"7.0-7.1":0.16621,"8.1-8.4":0,"9.0-9.2":0.00234,"9.3":0.14163,"10.0-10.2":0.00234,"10.3":0.30082,"11.0-11.2":0.01522,"11.3-11.4":0.00702,"12.0-12.1":0.04916,"12.2-12.5":1.70895,"13.0-13.1":0.00585,"13.2":0.01756,"13.3":0.02575,"13.4-13.7":0.21537,"14.0-14.4":0.27039,"14.5-14.8":0.48225,"15.0-15.1":0.29029,"15.2-15.3":0.20133,"15.4":0.18026,"15.5":0.36754,"15.6-15.7":2.86893,"16.0":0.25985,"16.1":0.40617,"16.2":0.20718,"16.3":0.61803,"16.4":0.27273,"16.5":1.20446,"16.6":1.37184},P:{"4":0.32173,"20":0.10378,"21":0.18681,"5.0-5.4":0.01038,"6.2-6.4":0,"7.2-7.4":0.12454,"8.2":0,"9.2":0.01038,"10.1":0,"11.1-11.2":0.01038,"12.0":0.01038,"13.0":0.06227,"14.0":0.04151,"15.0":0.01038,"16.0":0.06227,"17.0":0.06227,"18.0":0.13492,"19.0":0.05189},I:{"0":0,"3":0,"4":0.00178,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00918,"4.2-4.3":0.03345,"4.4":0,"4.4.3-4.4.4":0.14558},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01229,"5.5":0},S:{"2.5":0.21841,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.82579},R:{_:"0"},M:{"0":0.15348},Q:{"13.1":0.0059},O:{"0":0.25383},H:{"0":1.00036}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00793,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00397,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0119,"100":0,"101":0,"102":0.00793,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00793,"112":0,"113":0.0119,"114":0,"115":0.07141,"116":0.0119,"117":0.15868,"118":0.01984,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00397,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00793,"32":0,"33":0,"34":0,"35":0.00793,"36":0,"37":0,"38":0,"39":0,"40":0.02777,"41":0,"42":0.0119,"43":0.0119,"44":0,"45":0,"46":0.00397,"47":0,"48":0,"49":0.00397,"50":0,"51":0.00397,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00397,"59":0.00397,"60":0.00397,"61":0,"62":0,"63":0.00397,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00397,"71":0,"72":0,"73":0.00397,"74":0.0119,"75":0.00397,"76":0.0119,"77":0.00397,"78":0,"79":0.00793,"80":0.00397,"81":0.0238,"83":0.00397,"84":0.00397,"85":0,"86":0.01984,"87":0.03174,"88":0.00793,"89":0.00397,"90":0.01984,"91":0.00793,"92":0.00793,"93":0.00793,"94":0.00793,"95":0.0119,"96":0,"97":0.00397,"98":0,"99":0.00793,"100":0.00397,"101":0.00397,"102":0.01587,"103":0.0119,"104":0,"105":0.00793,"106":0.00793,"107":0.00793,"108":0.01984,"109":0.92431,"110":0.00793,"111":0.00793,"112":0.0119,"113":0.01587,"114":0.05554,"115":0.05554,"116":2.78483,"117":0.89258,"118":0.0119,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00397,"33":0,"34":0,"35":0,"36":0,"37":0.00397,"38":0,"39":0,"40":0,"41":0,"42":0.00397,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.01984,"62":0,"63":0.00793,"64":0,"65":0,"66":0.00397,"67":0.0119,"68":0,"69":0.03174,"70":0.01587,"71":0.01587,"72":0.03967,"73":0.0119,"74":0,"75":0,"76":0,"77":0.00397,"78":0.00793,"79":0.00397,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00397,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.06347,"96":0,"97":0,"98":0,"99":0,"100":0.00793,"101":0.11504,"102":0.16661,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00397,"13":0.00793,"14":0.00397,"15":0.00397,"16":0,"17":0,"18":0.01587,"79":0,"80":0,"81":0,"83":0,"84":0.0119,"85":0.00397,"86":0,"87":0,"88":0.00397,"89":0.00397,"90":0.00793,"91":0,"92":0.0119,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00397,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.03967,"110":0.00793,"111":0.00793,"112":0.00793,"113":0.00397,"114":0.01984,"115":0.05157,"116":0.61092,"117":0.53555},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00397,"13.1":0.0119,"14.1":0.00397,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.0119,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0.00397,"16.6":0.0238,"17.0":0.00793,"17.1":0},G:{"8":0.00254,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00635,"5.0-5.1":0.00762,"6.0-6.1":0,"7.0-7.1":0.06735,"8.1-8.4":0.00381,"9.0-9.2":0.00254,"9.3":0.12581,"10.0-10.2":0.00127,"10.3":0.25289,"11.0-11.2":0.0216,"11.3-11.4":0.00254,"12.0-12.1":0.04448,"12.2-12.5":2.0727,"13.0-13.1":0.00381,"13.2":0.01525,"13.3":0.29229,"13.4-13.7":0.21858,"14.0-14.4":0.36726,"14.5-14.8":0.51976,"15.0-15.1":0.2351,"15.2-15.3":0.183,"15.4":0.16648,"15.5":0.34693,"15.6-15.7":3.2177,"16.0":0.28339,"16.1":0.43081,"16.2":0.19698,"16.3":0.50197,"16.4":0.28593,"16.5":0.63668,"16.6":1.76389,"17.0":0.31389,"17.1":0},P:{"4":0.30639,"20":0.0817,"21":0.14298,"22":0.40852,"5.0-5.4":0.02043,"6.2-6.4":0,"7.2-7.4":0.09192,"8.2":0.01021,"9.2":0.01021,"10.1":0,"11.1-11.2":0.01021,"12.0":0,"13.0":0.05107,"14.0":0.04085,"15.0":0.01021,"16.0":0.06128,"17.0":0.05107,"18.0":0.09192,"19.0":0.04085},I:{"0":0,"3":0,"4":0.00096,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00911,"4.2-4.3":0.04106,"4.4":0,"4.4.3-4.4.4":0.14491},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00397,"8":0.0119,"9":0,"10":0,"11":0.00793,"5.5":0},S:{"2.5":0.19306,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":75.71373},R:{_:"0"},M:{"0":0.10256},Q:{"13.1":0.00603},O:{"0":0.27149},H:{"0":0.74823}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AR.js
index 83b72d05d5ee59..203d49a6573580 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01476,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00369,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00369,"67":0,"68":0.00369,"69":0,"70":0,"71":0,"72":0,"73":0.00369,"74":0,"75":0,"76":0,"77":0,"78":0.00369,"79":0,"80":0.00369,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00738,"87":0,"88":0.01107,"89":0,"90":0,"91":0.04796,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00369,"100":0.00369,"101":0,"102":0.00738,"103":0.00369,"104":0.00369,"105":0.00369,"106":0.00369,"107":0.00369,"108":0.00369,"109":0.00369,"110":0.00369,"111":0.00369,"112":0.00369,"113":0.00738,"114":0.01476,"115":0.23241,"116":0.36521,"117":0.01476,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00738,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00369,"48":0,"49":0.04427,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00369,"59":0,"60":0,"61":0,"62":0.01107,"63":0,"64":0,"65":0,"66":0.01476,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00369,"74":0.00369,"75":0.00369,"76":0.00369,"77":0,"78":0.00369,"79":0.01845,"80":0.00369,"81":0.00369,"83":0.00369,"84":0,"85":0.00738,"86":0.00369,"87":0.00738,"88":0.01476,"89":0.00369,"90":0.00369,"91":0.01107,"92":0.00369,"93":0.00738,"94":0.00369,"95":0.00738,"96":0.00369,"97":0.00738,"98":0.00738,"99":0.00738,"100":0.00369,"101":0.00738,"102":0.00738,"103":0.02582,"104":0.01476,"105":0.01845,"106":0.01107,"107":0.01476,"108":0.02582,"109":1.66005,"110":0.01107,"111":0.01107,"112":0.02582,"113":0.03689,"114":0.26561,"115":5.05024,"116":2.97702,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00738,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00369,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00369,"72":0.00738,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00369,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02951,"96":0,"97":0,"98":0,"99":0.00369,"100":0.42424,"101":0.17707,"102":0.00369,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00369,"16":0,"17":0.00369,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00369,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01476,"110":0,"111":0,"112":0.00369,"113":0.00369,"114":0.02582,"115":0.59393,"116":0.22503},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00369,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00369,"12.1":0,"13.1":0.00738,"14.1":0.01107,"15.1":0,"15.2-15.3":0,"15.4":0.00369,"15.5":0.00369,"15.6":0.02951,"16.0":0,"16.1":0.00369,"16.2":0.00369,"16.3":0.01845,"16.4":0.00738,"16.5":0.05534,"16.6":0.05534},G:{"8":0.00067,"17":0.03301,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01752,"6.0-6.1":0,"7.0-7.1":0.00202,"8.1-8.4":0.00067,"9.0-9.2":0,"9.3":0.01482,"10.0-10.2":0,"10.3":0.01347,"11.0-11.2":0.00202,"11.3-11.4":0.05389,"12.0-12.1":0.00202,"12.2-12.5":0.11385,"13.0-13.1":0.00337,"13.2":0.00067,"13.3":0.00404,"13.4-13.7":0.0128,"14.0-14.4":0.02156,"14.5-14.8":0.07006,"15.0-15.1":0.01752,"15.2-15.3":0.01954,"15.4":0.02493,"15.5":0.04648,"15.6-15.7":0.71476,"16.0":0.13676,"16.1":0.31528,"16.2":0.13608,"16.3":0.34829,"16.4":0.05457,"16.5":1.18094,"16.6":3.37037},P:{"4":0.13069,"20":0.09048,"21":0.20106,"22":2.35238,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.27143,"8.2":0.01005,"9.2":0.01005,"10.1":0,"11.1-11.2":0.02011,"12.0":0.01005,"13.0":0.02011,"14.0":0.02011,"15.0":0.02011,"16.0":0.05026,"17.0":0.12064,"18.0":0.03016,"19.0":0.05026},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00244,"4.2-4.3":0.00731,"4.4":0,"4.4.3-4.4.4":0.05607},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02213,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.70907},R:{_:"0"},M:{"0":0.11991},Q:{"13.1":0},O:{"0":0.03156},H:{"0":0.17327}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01602,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.004,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.004,"67":0,"68":0.004,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.004,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.004,"87":0.004,"88":0.01201,"89":0,"90":0.004,"91":0.04004,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.004,"100":0.004,"101":0,"102":0.00801,"103":0.004,"104":0.00801,"105":0.004,"106":0.004,"107":0.004,"108":0.004,"109":0.004,"110":0.004,"111":0.004,"112":0.004,"113":0.004,"114":0.01201,"115":0.19219,"116":0.03203,"117":0.44444,"118":0.03604,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.004,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02803,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.01602,"63":0,"64":0,"65":0,"66":0.01201,"67":0,"68":0,"69":0,"70":0.004,"71":0,"72":0.004,"73":0,"74":0.004,"75":0.004,"76":0.004,"77":0,"78":0.004,"79":0.01602,"80":0.004,"81":0.004,"83":0.004,"84":0.004,"85":0.004,"86":0.004,"87":0.00801,"88":0.01201,"89":0.004,"90":0.004,"91":0.01201,"92":0.00801,"93":0.00801,"94":0.00801,"95":0.00801,"96":0.004,"97":0.00801,"98":0.004,"99":0.00801,"100":0.004,"101":0.00801,"102":0.00801,"103":0.02803,"104":0.01201,"105":0.01602,"106":0.01201,"107":0.01602,"108":0.02402,"109":1.8058,"110":0.01201,"111":0.01201,"112":0.02402,"113":0.03203,"114":0.08008,"115":0.16016,"116":7.57156,"117":2.23423,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.004,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.004,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.004,"71":0,"72":0.00801,"73":0.004,"74":0,"75":0,"76":0,"77":0.01201,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.004,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02803,"96":0,"97":0,"98":0,"99":0.004,"100":0.12012,"101":0.22022,"102":0.42442,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.004,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.004,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02002,"110":0,"111":0,"112":0.004,"113":0.004,"114":0.01201,"115":0.02002,"116":0.54454,"117":0.46046},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.004,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.004,"10.1":0,"11.1":0.004,"12.1":0,"13.1":0.00801,"14.1":0.01602,"15.1":0,"15.2-15.3":0,"15.4":0.004,"15.5":0.004,"15.6":0.03203,"16.0":0,"16.1":0.00801,"16.2":0.004,"16.3":0.01201,"16.4":0.00801,"16.5":0.02402,"16.6":0.11612,"17.0":0.00801,"17.1":0},G:{"8":0,"3.2":0.00142,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01495,"6.0-6.1":0,"7.0-7.1":0.00214,"8.1-8.4":0.00142,"9.0-9.2":0,"9.3":0.02064,"10.0-10.2":0,"10.3":0.01566,"11.0-11.2":0.00142,"11.3-11.4":0.04555,"12.0-12.1":0.00214,"12.2-12.5":0.11601,"13.0-13.1":0.00214,"13.2":0.00071,"13.3":0.02135,"13.4-13.7":0.01281,"14.0-14.4":0.02562,"14.5-14.8":0.06548,"15.0-15.1":0.01495,"15.2-15.3":0.01922,"15.4":0.02491,"15.5":0.04199,"15.6-15.7":0.73305,"16.0":0.12455,"16.1":0.28397,"16.2":0.11316,"16.3":0.28041,"16.4":0.03914,"16.5":0.14661,"16.6":4.47945,"17.0":0.34375,"17.1":0.00071},P:{"4":0.10193,"20":0.06116,"21":0.13251,"22":2.28328,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.19367,"8.2":0.01019,"9.2":0,"10.1":0,"11.1-11.2":0.01019,"12.0":0.01019,"13.0":0.03058,"14.0":0.02039,"15.0":0.01019,"16.0":0.03058,"17.0":0.10193,"18.0":0.02039,"19.0":0.04077},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01008,"4.4":0,"4.4.3-4.4.4":0.05795},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01602,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":72.40833},R:{_:"0"},M:{"0":0.11992},Q:{"13.1":0},O:{"0":0.03598},H:{"0":0.16462}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AS.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AS.js
index c612050cc6ed82..9aaa11b099f2dc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AS.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AS.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00663,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.30507,"116":0.1857,"117":0.01326,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00663,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.0199,"76":0.00663,"77":0.00663,"78":0,"79":0.00663,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.01326,"88":0.03316,"89":0,"90":0,"91":0,"92":0.00663,"93":4.76178,"94":0,"95":0,"96":0.06632,"97":0,"98":0,"99":0,"100":0.00663,"101":0.01326,"102":0,"103":1.48557,"104":0,"105":0,"106":0,"107":0,"108":0.00663,"109":0.81574,"110":0.01326,"111":0.01326,"112":0.00663,"113":0.06632,"114":2.85839,"115":13.17115,"116":1.00806,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.43108,"101":0.00663,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.15254,"90":0,"91":0,"92":0.00663,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.03316,"110":0.02653,"111":0,"112":0,"113":0,"114":0.56372,"115":1.70442,"116":0.65657},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00663,"14":0.04642,"15":0,"17":0.05306,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.03316,"13.1":0.03316,"14.1":0.1459,"15.1":0.19233,"15.2-15.3":0.07958,"15.4":0.1857,"15.5":0.39129,"15.6":1.45904,"16.0":0.03316,"16.1":0.74278,"16.2":0.23212,"16.3":1.05449,"16.4":0.24538,"16.5":4.50313,"16.6":3.98583},G:{"8":0,"17":0.31402,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.0103,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.10811,"13.0-13.1":0,"13.2":0,"13.3":0.01544,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0.03604,"15.0-15.1":0.11325,"15.2-15.3":0.14929,"15.4":0.31917,"15.5":0.48905,"15.6-15.7":3.9124,"16.0":1.67821,"16.1":3.94328,"16.2":1.71939,"16.3":3.09903,"16.4":0.80307,"16.5":10.78998,"16.6":23.96342},P:{"4":0,"20":0.0214,"21":0.0107,"22":0.08559,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.0107,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0107,"12.0":0,"13.0":0,"14.0":0.0107,"15.0":0,"16.0":0,"17.0":0.0321,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":4.54834},R:{_:"0"},M:{"0":0.02358},Q:{"13.1":0},O:{"0":0.02694},H:{"0":0.01594}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01425,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.04276,"116":0.00713,"117":0.47744,"118":0.0285,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.40618,"76":0.01425,"77":0,"78":0,"79":0.01425,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.14965,"88":0.1924,"89":0,"90":0,"91":0,"92":0,"93":13.99546,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00713,"102":0,"103":0.73398,"104":0,"105":0.5202,"106":0.00713,"107":0,"108":0.01425,"109":0.5487,"110":0.02138,"111":0.02138,"112":0.00713,"113":0.0285,"114":2.04516,"115":1.73162,"116":14.92184,"117":0.42756,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00713,"101":0.00713,"102":0.00713,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0285,"110":0,"111":0,"112":0,"113":0,"114":0.07839,"115":0.01425,"116":0.77673,"117":1.22567},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.22091,"15":0.00713,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01425,"13.1":0.02138,"14.1":0.34917,"15.1":0.64134,"15.2-15.3":0.54158,"15.4":0.06413,"15.5":0.29217,"15.6":0.71973,"16.0":0.01425,"16.1":0.14965,"16.2":0.22091,"16.3":0.36343,"16.4":0.13539,"16.5":1.76725,"16.6":5.316,"17.0":0.31354,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0137,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.0274,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.00913,"14.5-14.8":0.0274,"15.0-15.1":0.0685,"15.2-15.3":0.07307,"15.4":0.25117,"15.5":0.42014,"15.6-15.7":3.19217,"16.0":1.6349,"16.1":3.2013,"16.2":1.24216,"16.3":2.47975,"16.4":0.43384,"16.5":1.23759,"16.6":28.68384,"17.0":2.20575,"17.1":0.00457},P:{"4":0,"20":0,"21":0.01042,"22":0.15627,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":3.73515},R:{_:"0"},M:{"0":0.21842},Q:{"13.1":0},O:{"0":0.02299},H:{"0":0.00544}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AT.js
index edbc29f4423ef5..f12e3d0e1cffd0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.005,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.02,"46":0,"47":0.005,"48":0.035,"49":0,"50":0,"51":0,"52":0.035,"53":0.005,"54":0,"55":0,"56":0.005,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.015,"69":0,"70":0,"71":0,"72":0.005,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.03,"79":0,"80":0,"81":0,"82":0,"83":0.005,"84":0,"85":0.005,"86":0,"87":0,"88":0.005,"89":0,"90":0,"91":0.015,"92":0,"93":0,"94":0.005,"95":0,"96":0.02,"97":0,"98":0.005,"99":0,"100":0,"101":0,"102":0.47,"103":0.005,"104":0.01,"105":0.01,"106":0.005,"107":0.01,"108":0.01,"109":0.02,"110":0.01,"111":0.01,"112":0.015,"113":0.03,"114":0.065,"115":0.95,"116":2.86,"117":0.1,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.005,"35":0,"36":0,"37":0,"38":0.005,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.015,"50":0,"51":0,"52":0,"53":0.005,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.005,"66":0,"67":0,"68":0,"69":0,"70":0.005,"71":0,"72":0,"73":0,"74":0,"75":0.005,"76":0,"77":0,"78":0.005,"79":0.065,"80":0.005,"81":0.07,"83":0.005,"84":0.005,"85":0.015,"86":0.065,"87":0.02,"88":0.005,"89":0.05,"90":0.005,"91":0.005,"92":0.005,"93":0.005,"94":0.005,"95":0.005,"96":0.01,"97":0,"98":0.005,"99":0.015,"100":0.065,"101":0.125,"102":0.07,"103":0.1,"104":0.07,"105":0.01,"106":0.015,"107":0.01,"108":0.035,"109":0.52,"110":0.06,"111":0.03,"112":0.035,"113":0.135,"114":0.645,"115":5.555,"116":3.18,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.005,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.015,"72":0.005,"73":0,"74":0,"75":0,"76":0.005,"77":0.005,"78":0,"79":0,"80":0,"81":0.005,"82":0,"83":0,"84":0,"85":0.01,"86":0,"87":0,"88":0,"89":0.005,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.035,"96":0,"97":0,"98":0,"99":0.02,"100":0.73,"101":0.525,"102":0.005,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.005,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.005,"105":0,"106":0,"107":0.01,"108":0.01,"109":0.095,"110":0.02,"111":0.01,"112":0.03,"113":0.04,"114":0.24,"115":3.03,"116":1.13},E:{"4":0,"5":0,"6":0,"7":0,"8":0.005,"9":0,"10":0,"11":0,"12":0,"13":0.01,"14":0.045,"15":0.01,"17":0.025,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01,"10.1":0,"11.1":0.015,"12.1":0.015,"13.1":0.095,"14.1":0.095,"15.1":0.02,"15.2-15.3":0.02,"15.4":0.025,"15.5":0.04,"15.6":0.285,"16.0":0.045,"16.1":0.075,"16.2":0.07,"16.3":0.265,"16.4":0.08,"16.5":0.62,"16.6":0.795},G:{"8":0,"17":0.33811,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00284,"8.1-8.4":0,"9.0-9.2":0.00284,"9.3":0.05967,"10.0-10.2":0.00284,"10.3":0.06535,"11.0-11.2":0.00852,"11.3-11.4":0.01705,"12.0-12.1":0.00568,"12.2-12.5":0.31254,"13.0-13.1":0.00852,"13.2":0.01705,"13.3":0.01705,"13.4-13.7":0.02273,"14.0-14.4":0.14775,"14.5-14.8":0.33811,"15.0-15.1":0.11081,"15.2-15.3":0.12217,"15.4":0.12786,"15.5":0.23867,"15.6-15.7":1.69624,"16.0":1.04275,"16.1":1.70192,"16.2":0.7643,"16.3":1.77011,"16.4":0.37221,"16.5":6.14567,"16.6":12.93063},P:{"4":0.16577,"20":0.08289,"21":0.33155,"22":4.0304,"5.0-5.4":0.02072,"6.2-6.4":0,"7.2-7.4":0.01036,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01036,"12.0":0.01036,"13.0":0.03108,"14.0":0.01036,"15.0":0.01036,"16.0":0.03108,"17.0":0.03108,"18.0":0.03108,"19.0":0.07253},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.07319,"4.2-4.3":0.00542,"4.4":0,"4.4.3-4.4.4":0.07139},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.055,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":37.06},R:{_:"0"},M:{"0":1.005},Q:{"13.1":0},O:{"0":0.065},H:{"0":0.58698}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00542,"48":0.00542,"49":0,"50":0,"51":0,"52":0.03251,"53":0.00542,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.02168,"69":0,"70":0,"71":0,"72":0,"73":0.00542,"74":0,"75":0,"76":0,"77":0,"78":0.03251,"79":0,"80":0,"81":0,"82":0,"83":0.00542,"84":0,"85":0,"86":0,"87":0,"88":0.00542,"89":0,"90":0,"91":0.01626,"92":0,"93":0,"94":0,"95":0,"96":0.01626,"97":0,"98":0,"99":0.00542,"100":0,"101":0,"102":0.52564,"103":0.00542,"104":0.00542,"105":0.01084,"106":0.00542,"107":0.01084,"108":0.01084,"109":0.02168,"110":0.01084,"111":0.01626,"112":0.01084,"113":0.02168,"114":0.03251,"115":0.4281,"116":0.20592,"117":3.18637,"118":0.30888,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01084,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01084,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00542,"66":0,"67":0,"68":0.00542,"69":0.00542,"70":0.00542,"71":0,"72":0,"73":0,"74":0,"75":0.00542,"76":0.00542,"77":0.00542,"78":0.00542,"79":0.05961,"80":0.00542,"81":0.07045,"83":0.00542,"84":0.00542,"85":0.01084,"86":0.07045,"87":0.01626,"88":0.01084,"89":0.03251,"90":0.0271,"91":0,"92":0,"93":0.00542,"94":0.00542,"95":0.00542,"96":0.00542,"97":0.00542,"98":0.01626,"99":0.01626,"100":0.07045,"101":0.13006,"102":0.08129,"103":0.09754,"104":0.07587,"105":0.00542,"106":0.01626,"107":0.01084,"108":0.03251,"109":0.50397,"110":0.04877,"111":0.03793,"112":0.03251,"113":0.0867,"114":0.24927,"115":0.28721,"116":8.31275,"117":3.0238,"118":0.00542,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00542,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00542,"70":0,"71":0.00542,"72":0.01084,"73":0,"74":0,"75":0,"76":0,"77":0.03793,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.01084,"86":0,"87":0.00542,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0271,"96":0,"97":0,"98":0,"99":0.01626,"100":0.18425,"101":0.52022,"102":1.36559,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00542,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00542,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.01084,"108":0.01084,"109":0.0867,"110":0.01626,"111":0.00542,"112":0.01626,"113":0.03251,"114":0.10296,"115":0.11922,"116":2.40604,"117":2.43855},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00542,"14":0.04877,"15":0.00542,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01626,"10.1":0,"11.1":0.00542,"12.1":0.01084,"13.1":0.0867,"14.1":0.11922,"15.1":0.01626,"15.2-15.3":0.01626,"15.4":0.0271,"15.5":0.03793,"15.6":0.25469,"16.0":0.03793,"16.1":0.08129,"16.2":0.08129,"16.3":0.18967,"16.4":0.0867,"16.5":0.26553,"16.6":1.3114,"17.0":0.1138,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00582,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04659,"10.0-10.2":0,"10.3":0.06406,"11.0-11.2":0.01165,"11.3-11.4":0.01165,"12.0-12.1":0.01165,"12.2-12.5":0.27079,"13.0-13.1":0.01165,"13.2":0.02621,"13.3":0.02038,"13.4-13.7":0.03203,"14.0-14.4":0.14558,"14.5-14.8":0.34649,"15.0-15.1":0.13394,"15.2-15.3":0.10191,"15.4":0.11647,"15.5":0.19508,"15.6-15.7":1.42673,"16.0":1.04821,"16.1":1.60725,"16.2":0.75704,"16.3":1.39178,"16.4":0.23876,"16.5":0.93756,"16.6":17.29249,"17.0":2.47784,"17.1":0.00582},P:{"4":0.18599,"20":0.062,"21":0.16532,"22":3.57507,"5.0-5.4":0.01033,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01033,"12.0":0,"13.0":0.02067,"14.0":0.031,"15.0":0.01033,"16.0":0.02067,"17.0":0.031,"18.0":0.02067,"19.0":0.062},I:{"0":0,"3":0,"4":0.0029,"2.1":0,"2.2":0,"2.3":0.0029,"4.1":0.02614,"4.2-4.3":0.01162,"4.4":0,"4.4.3-4.4.4":0.1394},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.00542,"10":0,"11":0.04335,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":33.56177},R:{_:"0"},M:{"0":0.85207},Q:{"13.1":0},O:{"0":0.03665},H:{"0":0.4337}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AU.js
index 339a8dc591db8e..fa344adf199ffe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00553,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00553,"49":0,"50":0,"51":0,"52":0.00553,"53":0,"54":0.01106,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00553,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01659,"79":0,"80":0,"81":0,"82":0,"83":0.00553,"84":0,"85":0,"86":0,"87":0.00553,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.04424,"103":0.01106,"104":0,"105":0.00553,"106":0.00553,"107":0.00553,"108":0.00553,"109":0.00553,"110":0.00553,"111":0.00553,"112":0.00553,"113":0.01659,"114":0.03871,"115":0.35945,"116":1.02305,"117":0.03871,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.01659,"26":0.00553,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01659,"35":0,"36":0,"37":0,"38":0.04977,"39":0,"40":0,"41":0,"42":0,"43":0.00553,"44":0.00553,"45":0.00553,"46":0.00553,"47":0.00553,"48":0,"49":0.01106,"50":0,"51":0.00553,"52":0.00553,"53":0,"54":0,"55":0,"56":0.00553,"57":0,"58":0,"59":0.01659,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00553,"66":0.01659,"67":0.00553,"68":0.00553,"69":0.00553,"70":0,"71":0,"72":0.00553,"73":0.00553,"74":0.01106,"75":0.00553,"76":0.00553,"77":0,"78":0.00553,"79":0.06636,"80":0.00553,"81":0.02765,"83":0.01106,"84":0,"85":0.01659,"86":0.02212,"87":0.03871,"88":0.02212,"89":0.00553,"90":0.00553,"91":0.01659,"92":0.01106,"93":0.01106,"94":0.00553,"95":0.00553,"96":0.01106,"97":0.01659,"98":0.01106,"99":0.02765,"100":0.02212,"101":0.03318,"102":0.02212,"103":0.14378,"104":0.03871,"105":0.02212,"106":0.03318,"107":0.04424,"108":0.06083,"109":0.51429,"110":0.04977,"111":0.07189,"112":0.12719,"113":0.20461,"114":1.36038,"115":9.53925,"116":4.55672,"117":0.01659,"118":0.00553,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00553,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.02212,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00553,"72":0.00553,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00553,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00553,"96":0,"97":0,"98":0,"99":0.01659,"100":0.30968,"101":0.13272,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00553,"16":0,"17":0,"18":0.00553,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00553,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00553,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00553,"105":0.00553,"106":0,"107":0.00553,"108":0.01106,"109":0.04424,"110":0.01106,"111":0.01106,"112":0.02212,"113":0.02212,"114":0.22673,"115":2.8203,"116":0.8848},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00553,"10":0,"11":0,"12":0,"13":0.01659,"14":0.08295,"15":0.01659,"17":0.01659,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00553,"12.1":0.02765,"13.1":0.12166,"14.1":0.25438,"15.1":0.03318,"15.2-15.3":0.03871,"15.4":0.06636,"15.5":0.09954,"15.6":0.57512,"16.0":0.04977,"16.1":0.15484,"16.2":0.13825,"16.3":0.40369,"16.4":0.14378,"16.5":1.17236,"16.6":1.68112},G:{"8":0,"17":0.22081,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01577,"6.0-6.1":0.01577,"7.0-7.1":0.01577,"8.1-8.4":0.0276,"9.0-9.2":0.00789,"9.3":0.17349,"10.0-10.2":0.00789,"10.3":0.22869,"11.0-11.2":0.14983,"11.3-11.4":0.08675,"12.0-12.1":0.0552,"12.2-12.5":0.96998,"13.0-13.1":0.01577,"13.2":0.01183,"13.3":0.04337,"13.4-13.7":0.09463,"14.0-14.4":0.27601,"14.5-14.8":0.54019,"15.0-15.1":0.17349,"15.2-15.3":0.20898,"15.4":0.25235,"15.5":0.37458,"15.6-15.7":2.74826,"16.0":1.11192,"16.1":2.63786,"16.2":1.21838,"16.3":2.4486,"16.4":0.42979,"16.5":7.1447,"16.6":17.71585},P:{"4":0.22416,"20":0.10674,"21":0.25618,"22":2.38034,"5.0-5.4":0.0427,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01067,"12.0":0,"13.0":0.02135,"14.0":0.01067,"15.0":0.01067,"16.0":0.02135,"17.0":0.02135,"18.0":0.03202,"19.0":0.05337},I:{"0":0,"3":0.00621,"4":0.01862,"2.1":0.00207,"2.2":0.01035,"2.3":0.01241,"4.1":0.01448,"4.2-4.3":0.02483,"4.4":0,"4.4.3-4.4.4":0.07656},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.04424,"9":0.02212,"10":0.01106,"11":0.07742,"5.5":0},S:{"2.5":0.00447,_:"3.0-3.1"},J:{"7":0,"10":0.00447},N:{"10":0.01341,"11":0},L:{"0":25.20132},R:{_:"0"},M:{"0":0.38442},Q:{"13.1":0.00447},O:{"0":0.05364},H:{"0":0.14388}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00546,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01091,"53":0,"54":0.00546,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01637,"79":0,"80":0,"81":0,"82":0,"83":0.00546,"84":0,"85":0,"86":0,"87":0.00546,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03274,"103":0.00546,"104":0,"105":0.00546,"106":0.00546,"107":0,"108":0.00546,"109":0.00546,"110":0.00546,"111":0.00546,"112":0.00546,"113":0.01091,"114":0.01637,"115":0.14188,"116":0.09823,"117":1.06412,"118":0.09277,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.01637,"26":0.00546,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01637,"35":0,"36":0,"37":0,"38":0.04366,"39":0.00546,"40":0.00546,"41":0.00546,"42":0,"43":0.00546,"44":0.00546,"45":0.00546,"46":0.00546,"47":0.00546,"48":0,"49":0.01091,"50":0,"51":0.00546,"52":0.01091,"53":0.00546,"54":0,"55":0.00546,"56":0.00546,"57":0,"58":0,"59":0.01637,"60":0.00546,"61":0,"62":0,"63":0.00546,"64":0,"65":0.00546,"66":0.01637,"67":0.01637,"68":0.00546,"69":0.1146,"70":0.00546,"71":0,"72":0.00546,"73":0.00546,"74":0.00546,"75":0.00546,"76":0.00546,"77":0,"78":0.00546,"79":0.05457,"80":0.00546,"81":0.02183,"83":0.00546,"84":0.00546,"85":0.01637,"86":0.02183,"87":0.0382,"88":0.02183,"89":0.00546,"90":0.00546,"91":0.01091,"92":0.01091,"93":0.01091,"94":0.00546,"95":0.00546,"96":0.01091,"97":0.01091,"98":0.01091,"99":0.02183,"100":0.01637,"101":0.03274,"102":0.02183,"103":0.12551,"104":0.03274,"105":0.01637,"106":0.03274,"107":0.04366,"108":0.06548,"109":0.4693,"110":0.17462,"111":0.05457,"112":0.09277,"113":0.12005,"114":0.40928,"115":0.74215,"116":11.46516,"117":2.7667,"118":0.01637,"119":0.00546,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.02183,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00546,"73":0,"74":0,"75":0,"76":0,"77":0.01637,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00546,"96":0,"97":0,"98":0,"99":0.01091,"100":0.09823,"101":0.18008,"102":0.24557,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00546,"15":0.01091,"16":0,"17":0,"18":0.00546,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00546,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00546,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00546,"103":0,"104":0,"105":0.00546,"106":0,"107":0.00546,"108":0.01091,"109":0.0382,"110":0.00546,"111":0.01091,"112":0.01091,"113":0.01637,"114":0.06003,"115":0.13097,"116":2.04638,"117":1.36971},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00546,"10":0,"11":0,"12":0,"13":0.01637,"14":0.08186,"15":0.01637,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00546,"12.1":0.02729,"13.1":0.10368,"14.1":0.22374,"15.1":0.03274,"15.2-15.3":0.03274,"15.4":0.06003,"15.5":0.09277,"15.6":0.52387,"16.0":0.04366,"16.1":0.13643,"16.2":0.12005,"16.3":0.31651,"16.4":0.1146,"16.5":0.31651,"16.6":2.48839,"17.0":0.08731,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0123,"6.0-6.1":0.0164,"7.0-7.1":0.0123,"8.1-8.4":0.0246,"9.0-9.2":0.0164,"9.3":0.1517,"10.0-10.2":0.0041,"10.3":0.2132,"11.0-11.2":0.1148,"11.3-11.4":0.0779,"12.0-12.1":0.0492,"12.2-12.5":0.88149,"13.0-13.1":0.0082,"13.2":0.0082,"13.3":0.041,"13.4-13.7":0.0943,"14.0-14.4":0.2583,"14.5-14.8":0.5002,"15.0-15.1":0.1599,"15.2-15.3":0.1763,"15.4":0.246,"15.5":0.3444,"15.6-15.7":2.64448,"16.0":1.14389,"16.1":2.34928,"16.2":1.12339,"16.3":2.07049,"16.4":0.3362,"16.5":1.09879,"16.6":24.77612,"17.0":1.57849,"17.1":0},P:{"4":0.20022,"20":0.07377,"21":0.15807,"22":2.41318,"5.0-5.4":0.04215,"6.2-6.4":0.01054,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01054,"12.0":0,"13.0":0.02108,"14.0":0.01054,"15.0":0.01054,"16.0":0.03161,"17.0":0.02108,"18.0":0.02108,"19.0":0.04215},I:{"0":0,"3":0.00684,"4":0.02051,"2.1":0.00228,"2.2":0.0114,"2.3":0.01367,"4.1":0.0114,"4.2-4.3":0.02507,"4.4":0,"4.4.3-4.4.4":0.07521},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.03547,"9":0.02365,"10":0.01182,"11":0.07094,"5.5":0},S:{"2.5":0.00454,_:"3.0-3.1"},J:{"7":0,"10":0.00454},N:{"10":0.00909,"11":0},L:{"0":24.90616},R:{_:"0"},M:{"0":0.38161},Q:{"13.1":0.00454},O:{"0":0.05452},H:{"0":0.15914}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AW.js
index 342d2e21d279e4..f60f631a08078f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00293,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00293,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00879,"102":0.00293,"103":0,"104":0,"105":0,"106":0,"107":0.00293,"108":0.00293,"109":0.00879,"110":0.00879,"111":0,"112":0,"113":0,"114":0.01465,"115":0.0586,"116":0.16994,"117":0.01465,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00293,"50":0,"51":0,"52":0,"53":0.00879,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00586,"80":0,"81":0,"83":0.00293,"84":0,"85":0,"86":0,"87":0.00293,"88":0,"89":0.00293,"90":0,"91":0,"92":0.00293,"93":0.00293,"94":0.00293,"95":0,"96":0,"97":0,"98":0.00293,"99":0.00293,"100":0.00293,"101":0,"102":0,"103":0.02051,"104":0,"105":0,"106":0.00586,"107":0.02051,"108":0.11134,"109":0.34867,"110":0.0586,"111":0.04102,"112":0.08204,"113":0.01465,"114":0.30472,"115":2.51101,"116":1.18079,"117":0.00293,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00293,"100":0.07032,"101":0.03809,"102":0.00293,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00293,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00293,"109":0.01465,"110":0.00293,"111":0.00293,"112":0,"113":0.01172,"114":0.05567,"115":1.13977,"116":0.47173},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00293,"14":0.02051,"15":0.00293,"17":0.01465,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00586,"13.1":0.19631,"14.1":0.0879,"15.1":0.00879,"15.2-15.3":0.06153,"15.4":0.0293,"15.5":0.00879,"15.6":0.09669,"16.0":0.03809,"16.1":0.0293,"16.2":0.02344,"16.3":0.07618,"16.4":0.03223,"16.5":0.29007,"16.6":0.33402},G:{"8":0,"17":0.24512,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00791,"10.0-10.2":0,"10.3":0.03953,"11.0-11.2":0,"11.3-11.4":0.02767,"12.0-12.1":0.00791,"12.2-12.5":0.17791,"13.0-13.1":0,"13.2":0,"13.3":0.01581,"13.4-13.7":0.02767,"14.0-14.4":0.04744,"14.5-14.8":0.66023,"15.0-15.1":0.12651,"15.2-15.3":0.13837,"15.4":0.15814,"15.5":0.22139,"15.6-15.7":2.13093,"16.0":1.4193,"16.1":2.55,"16.2":0.91325,"16.3":2.52232,"16.4":0.46256,"16.5":8.02557,"16.6":19.57764},P:{"4":0.09193,"20":0.25535,"21":0.40857,"22":6.98648,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.286,"8.2":0.01021,"9.2":0,"10.1":0,"11.1-11.2":0.01021,"12.0":0,"13.0":0.01021,"14.0":0.03064,"15.0":0.01021,"16.0":0.02043,"17.0":0.03064,"18.0":0.05107,"19.0":0.11236},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.10376},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00586,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.00707,"11":0},L:{"0":40.74073},R:{_:"0"},M:{"0":0.27573},Q:{"13.1":0},O:{"0":0.03535},H:{"0":0.08032}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00294,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00587,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.02055,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00294,"108":0,"109":0,"110":0.01468,"111":0.03523,"112":0,"113":0,"114":0.01174,"115":0.01174,"116":0.01174,"117":0.21726,"118":0.02349,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00294,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00294,"76":0,"77":0,"78":0,"79":0.00587,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.00294,"88":0,"89":0,"90":0,"91":0,"92":0.03817,"93":0.00587,"94":0,"95":0,"96":0,"97":0,"98":0.00294,"99":0.00294,"100":0,"101":0,"102":0,"103":0.02642,"104":0,"105":0.01174,"106":0.02349,"107":0.06753,"108":0.0323,"109":0.38755,"110":0.02055,"111":0.05578,"112":0.02349,"113":0.01762,"114":0.04991,"115":0.1468,"116":2.88902,"117":0.78978,"118":0.00294,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00587,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00587,"101":0.04404,"102":0.0411,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.0323,"109":0.08221,"110":0,"111":0,"112":0,"113":0.00587,"114":0.01174,"115":0.06753,"116":1.00118,"117":0.74281},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01174,"15":0.00587,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02642,"14.1":0.02936,"15.1":0.01174,"15.2-15.3":0.01174,"15.4":0.01468,"15.5":0.01468,"15.6":0.06459,"16.0":0.01468,"16.1":0.01762,"16.2":0.02055,"16.3":0.08514,"16.4":0.02055,"16.5":0.09689,"16.6":0.6195,"17.0":0.03523,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01947,"10.0-10.2":0,"10.3":0.03115,"11.0-11.2":0,"11.3-11.4":0.00389,"12.0-12.1":0.01947,"12.2-12.5":0.45561,"13.0-13.1":0,"13.2":0,"13.3":0.02726,"13.4-13.7":0.1285,"14.0-14.4":0.12461,"14.5-14.8":0.71651,"15.0-15.1":0.05841,"15.2-15.3":0.15187,"15.4":0.11682,"15.5":0.21417,"15.6-15.7":3.29049,"16.0":1.13318,"16.1":1.95872,"16.2":0.80218,"16.3":1.62772,"16.4":0.37383,"16.5":0.99299,"16.6":24.2484,"17.0":2.02492,"17.1":0},P:{"4":0.09307,"20":0.07239,"21":0.81697,"22":7.65267,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.19649,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01034,"12.0":0.01034,"13.0":0.02068,"14.0":0.05171,"15.0":0,"16.0":0.05171,"17.0":0.07239,"18.0":0.03102,"19.0":0.10341},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.1568},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00294,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.00706,"11":0},L:{"0":40.55609},R:{_:"0"},M:{"0":0.33907},Q:{"13.1":0.01413},O:{"0":0.01413},H:{"0":0.11369}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AX.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AX.js
index 138d1179a8c11a..bc6618e6641a47 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AX.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AX.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.03163,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00527,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00527,"98":0,"99":0,"100":0,"101":0,"102":0.02636,"103":0,"104":0,"105":0.00527,"106":0,"107":0,"108":0.02636,"109":0,"110":0.00527,"111":0,"112":0,"113":0,"114":0.13707,"115":0.36904,"116":1.65541,"117":0.04218,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00527,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.07381,"77":0,"78":0,"79":0.33214,"80":0,"81":0.00527,"83":0,"84":0,"85":0.01582,"86":0.00527,"87":0.33741,"88":0,"89":0,"90":0,"91":0,"92":0.02636,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.05799,"104":0,"105":0,"106":0,"107":0,"108":0.01054,"109":1.21256,"110":0,"111":0.00527,"112":0.03163,"113":0.02636,"114":0.71699,"115":8.44574,"116":5.1771,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00527,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01054,"96":0,"97":0,"98":0.00527,"99":0.06326,"100":0.72754,"101":0.11071,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.05799,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00527,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01582,"110":0,"111":0,"112":0.0369,"113":0.10017,"114":0.07908,"115":2.62546,"116":1.05967},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.01582,"13":0,"14":0.28469,"15":0.01054,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01582,"14.1":0.24778,"15.1":0.01054,"15.2-15.3":0.04218,"15.4":0.02109,"15.5":0.02636,"15.6":0.24251,"16.0":0.10544,"16.1":0.02109,"16.2":0.06326,"16.3":0.0949,"16.4":0.04745,"16.5":0.39013,"16.6":0.61682},G:{"8":0,"17":0.02944,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00196,"9.3":0.02748,"10.0-10.2":0,"10.3":0.44161,"11.0-11.2":0.00196,"11.3-11.4":0.01963,"12.0-12.1":0.00981,"12.2-12.5":1.47204,"13.0-13.1":0,"13.2":0,"13.3":0.01963,"13.4-13.7":0.02355,"14.0-14.4":0.02355,"14.5-14.8":0.34544,"15.0-15.1":0.0844,"15.2-15.3":0.40039,"15.4":0.02748,"15.5":0.11188,"15.6-15.7":0.97743,"16.0":0.27674,"16.1":1.10305,"16.2":0.34348,"16.3":1.10697,"16.4":0.06477,"16.5":3.16194,"16.6":9.54274},P:{"4":0.01066,"20":0.08525,"21":0.17051,"22":4.76357,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.01066,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01066,"18.0":0.15985,"19.0":0.15985},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0175,"4.4":0,"4.4.3-4.4.4":0.0525},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":43.14298},R:{_:"0"},M:{"0":2.0945},Q:{"13.1":0},O:{"0":0},H:{"0":0.04029}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.02758,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00552,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01655,"103":0,"104":0,"105":0,"106":0.00552,"107":0,"108":0.01103,"109":0,"110":0.00552,"111":0,"112":0,"113":0.00552,"114":0,"115":0.17651,"116":0.08274,"117":1.6879,"118":0.15996,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.01655,"77":0,"78":0,"79":0.02758,"80":0,"81":0,"83":0,"84":0,"85":0.00552,"86":0,"87":0.03861,"88":0,"89":0,"90":0,"91":0,"92":0.01103,"93":0,"94":0,"95":0,"96":0.00552,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.07171,"104":0,"105":0.00552,"106":0.00552,"107":0,"108":0,"109":0.85498,"110":0,"111":0.00552,"112":0.00552,"113":0.00552,"114":0.07722,"115":0.33648,"116":12.9295,"117":4.36867,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.03861,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00552,"96":0,"97":0,"98":0,"99":0.00552,"100":0.04413,"101":0.14893,"102":0.07171,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.04964,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01103,"110":0,"111":0,"112":0.00552,"113":0.1048,"114":0.08826,"115":0.05516,"116":2.45462,"117":1.9306},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.01103,"13":0.02758,"14":0.3089,"15":0.00552,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01103,"13.1":0.06619,"14.1":0.11584,"15.1":0,"15.2-15.3":0.04413,"15.4":0.01655,"15.5":0.02758,"15.6":0.17651,"16.0":0.01655,"16.1":0.01103,"16.2":0.05516,"16.3":0.17651,"16.4":0.0331,"16.5":0.09377,"16.6":0.8605,"17.0":0.02758,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04013,"10.0-10.2":0,"10.3":0.36119,"11.0-11.2":0,"11.3-11.4":0.0086,"12.0-12.1":0.04873,"12.2-12.5":1.07209,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.01147,"14.0-14.4":0.0516,"14.5-14.8":0.18346,"15.0-15.1":0.01433,"15.2-15.3":0.24366,"15.4":0.0258,"15.5":0.07453,"15.6-15.7":0.62204,"16.0":0.49018,"16.1":1.30142,"16.2":0.26946,"16.3":0.45292,"16.4":0.01433,"16.5":0.18059,"16.6":22.2416,"17.0":0.8055,"17.1":0},P:{"4":0,"20":0.08611,"21":0.12916,"22":4.39157,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.01076,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.08611},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.07413},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00552,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":32.21495},R:{_:"0"},M:{"0":2.20164},Q:{"13.1":0},O:{"0":0},H:{"0":0.20377}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AZ.js
index 8920c2fd99da7e..e37a3f11a50244 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/AZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00289,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00289,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00289,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00289,"113":0.00289,"114":0.00289,"115":0.08673,"116":0.16479,"117":0.00578,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00289,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00289,"39":0,"40":0,"41":0,"42":0,"43":0.00289,"44":0.00289,"45":0.00289,"46":0.00289,"47":0.00289,"48":0,"49":0.00867,"50":0,"51":0.00289,"52":0,"53":0.01156,"54":0,"55":0.00289,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00289,"69":0,"70":0.00578,"71":0,"72":0.00289,"73":0.00289,"74":0.00289,"75":0,"76":0,"77":0.00289,"78":0.00289,"79":0.11853,"80":0.00289,"81":0.00867,"83":0.00578,"84":0.00289,"85":0.00289,"86":0.00867,"87":0.04047,"88":0.00289,"89":0,"90":0.00578,"91":0.00289,"92":0.00289,"93":0,"94":0,"95":0.00289,"96":0.00289,"97":0,"98":0.00289,"99":0.01446,"100":0.01156,"101":0.00578,"102":0.00578,"103":0.00578,"104":0.00578,"105":0.00578,"106":0.00578,"107":0.00578,"108":0.00578,"109":0.89621,"110":0.00578,"111":0.01156,"112":0.01156,"113":0.02602,"114":0.12431,"115":3.43162,"116":1.49754,"117":0.00289,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00289,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00867,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00289,"70":0.00867,"71":0.03758,"72":0.04337,"73":0,"74":0,"75":0,"76":0.00578,"77":0.00578,"78":0,"79":0.00578,"80":0,"81":0,"82":0,"83":0,"84":0.00289,"85":0.00867,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.10408,"96":0,"97":0,"98":0,"99":0.00867,"100":0.18792,"101":0.16479,"102":0.00289,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00289,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00289,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00289,"110":0,"111":0,"112":0,"113":0,"114":0.00867,"115":0.19081,"116":0.0636},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00289,"10":0,"11":0,"12":0,"13":0.00289,"14":0.00289,"15":0,"17":0.00289,_:"0","3.1":0,"3.2":0,"5.1":0.08095,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00578,"14.1":0.00578,"15.1":0.00578,"15.2-15.3":0,"15.4":0.00578,"15.5":0.00289,"15.6":0.01446,"16.0":0.00289,"16.1":0.01446,"16.2":0.00578,"16.3":0.02024,"16.4":0.01156,"16.5":0.04915,"16.6":0.05493},G:{"8":0,"17":0.11405,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00259,"6.0-6.1":0.0013,"7.0-7.1":0.02203,"8.1-8.4":0.01166,"9.0-9.2":0.0013,"9.3":0.01944,"10.0-10.2":0,"10.3":0.04925,"11.0-11.2":0.0324,"11.3-11.4":0.00259,"12.0-12.1":0.01296,"12.2-12.5":0.25013,"13.0-13.1":0.01296,"13.2":0.00389,"13.3":0.02203,"13.4-13.7":0.01944,"14.0-14.4":0.0985,"14.5-14.8":0.19051,"15.0-15.1":0.07776,"15.2-15.3":0.04018,"15.4":0.05702,"15.5":0.11535,"15.6-15.7":0.9746,"16.0":0.4238,"16.1":0.74132,"16.2":0.37714,"16.3":0.6493,"16.4":0.23199,"16.5":2.7644,"16.6":5.63766},P:{"4":0.46813,"20":0.18318,"21":0.40707,"5.0-5.4":0,"6.2-6.4":0.01018,"7.2-7.4":0.04071,"8.2":0,"9.2":0.01018,"10.1":0.01018,"11.1-11.2":0.02035,"12.0":0.01018,"13.0":0.09159,"14.0":0.01018,"15.0":0.01018,"16.0":0.05088,"17.0":0.15265,"18.0":0.08141,"19.0":0.1323},I:{"0":0,"3":0,"4":0.00903,"2.1":0,"2.2":0.00451,"2.3":0.00677,"4.1":0.01354,"4.2-4.3":0.02032,"4.4":0,"4.4.3-4.4.4":0.07449},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00289,"8":0.01446,"9":0.00289,"10":0.00289,"11":0.02024,"5.5":0},S:{"2.5":0.00711,_:"3.0-3.1"},J:{"7":0,"10":0.00711},N:{"10":0.01422,"11":0},L:{"0":70.37046},R:{_:"0"},M:{"0":0.44787},Q:{"13.1":0},O:{"0":0.24882},H:{"0":0.72688}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00284,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00853,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.02274,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00284,"103":0,"104":0,"105":0.00284,"106":0,"107":0,"108":0,"109":0,"110":0.00568,"111":0,"112":0.01137,"113":0.00284,"114":0.00284,"115":0.01989,"116":0.01421,"117":0.1421,"118":0.00568,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00284,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00284,"39":0,"40":0,"41":0.00284,"42":0,"43":0.00284,"44":0.00284,"45":0.00284,"46":0.00284,"47":0,"48":0,"49":0.01989,"50":0,"51":0.00853,"52":0,"53":0.00568,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00284,"69":0,"70":0.00284,"71":0,"72":0,"73":0.00284,"74":0.00284,"75":0.00853,"76":0.04547,"77":0.00284,"78":0.00284,"79":0.12505,"80":0.03695,"81":0.00853,"83":0.00568,"84":0.01705,"85":0.00284,"86":0.03695,"87":0.02842,"88":0.08526,"89":0.01989,"90":0.14494,"91":0.01705,"92":0.00284,"93":0,"94":0.03695,"95":0.00853,"96":0.00284,"97":0.00853,"98":0,"99":0.01989,"100":0.01137,"101":0.00568,"102":0.00568,"103":0.03126,"104":0.00853,"105":0.00853,"106":0.00853,"107":0.01421,"108":0.01137,"109":0.82134,"110":0.01421,"111":0.01421,"112":0.04263,"113":0.01137,"114":0.02842,"115":0.07105,"116":3.21999,"117":0.75881,"118":0.00284,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00284,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00568,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.01137,"54":0,"55":0,"56":0,"57":0,"58":0.02842,"60":0,"62":0.01705,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00284,"70":0.00853,"71":0.00284,"72":0.09663,"73":0.02558,"74":0,"75":0,"76":0,"77":0.03126,"78":0.00284,"79":0.00568,"80":0,"81":0,"82":0,"83":0,"84":0.00284,"85":0.01421,"86":0,"87":0,"88":0,"89":0,"90":0.00568,"91":0,"92":0,"93":0,"94":0,"95":0.05684,"96":0,"97":0,"98":0,"99":0.00284,"100":0.03126,"101":0.13926,"102":0.14778,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00284,"13":0,"14":0.00284,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.0341,"91":0,"92":0.00568,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00284,"108":0.00284,"109":0.01137,"110":0,"111":0,"112":0,"113":0,"114":0.00284,"115":0.00853,"116":0.13642,"117":0.09663},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00568,"10":0,"11":0,"12":0,"13":0,"14":0.00284,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.09094,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00568,"14.1":0.00568,"15.1":0.00284,"15.2-15.3":0,"15.4":0.00568,"15.5":0.00284,"15.6":0.01421,"16.0":0.00284,"16.1":0.01137,"16.2":0.00568,"16.3":0.00853,"16.4":0.00568,"16.5":0.01137,"16.6":0.0881,"17.0":0.00568,"17.1":0},G:{"8":0.00352,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00352,"6.0-6.1":0,"7.0-7.1":0.02642,"8.1-8.4":0.01057,"9.0-9.2":0.00352,"9.3":0.02114,"10.0-10.2":0,"10.3":0.07221,"11.0-11.2":0.03347,"11.3-11.4":0,"12.0-12.1":0.01585,"12.2-12.5":0.28181,"13.0-13.1":0.00176,"13.2":0.00176,"13.3":3.45924,"13.4-13.7":0.02994,"14.0-14.4":0.08102,"14.5-14.8":0.19727,"15.0-15.1":0.05284,"15.2-15.3":0.05284,"15.4":0.05636,"15.5":0.14443,"15.6-15.7":1.02861,"16.0":0.42272,"16.1":0.60766,"16.2":0.31352,"16.3":0.61646,"16.4":0.20079,"16.5":0.51783,"16.6":8.15669,"17.0":1.03214,"17.1":0},P:{"4":0.52002,"20":0.12236,"21":0.32629,"22":3.37504,"5.0-5.4":0,"6.2-6.4":0.02039,"7.2-7.4":0.07138,"8.2":0,"9.2":0.0102,"10.1":0,"11.1-11.2":0.02039,"12.0":0.03059,"13.0":0.08157,"14.0":0.03059,"15.0":0.03059,"16.0":0.03059,"17.0":0.10196,"18.0":0.07138,"19.0":0.12236},I:{"0":0,"3":0,"4":0.01081,"2.1":0,"2.2":0.00649,"2.3":0.00649,"4.1":0.01297,"4.2-4.3":0.03027,"4.4":0,"4.4.3-4.4.4":0.08865},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.02274,"9":0.00284,"10":0.00284,"11":0.03979,"5.5":0},S:{"2.5":0.00716,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.01432,"11":0},L:{"0":65.93823},R:{_:"0"},M:{"0":0.32927},Q:{"13.1":0},O:{"0":0.21474},H:{"0":0.90131}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BA.js
index 142f089a20f701..fce2b0b52cfbfd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00354,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.02829,"53":0,"54":0,"55":0,"56":0.00354,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00354,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00354,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00354,"98":0,"99":0.00354,"100":0,"101":0,"102":0.00354,"103":0.00354,"104":0.01768,"105":0,"106":0,"107":0,"108":0.00354,"109":0.00354,"110":0.01061,"111":0.01061,"112":0.00354,"113":0.01414,"114":0.01414,"115":0.42786,"116":0.4915,"117":0.01768,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00354},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00354,"38":0.00354,"39":0.00354,"40":0.00354,"41":0.00354,"42":0,"43":0.00354,"44":0.00707,"45":0.00354,"46":0.00707,"47":0.00354,"48":0,"49":0.04243,"50":0,"51":0.00354,"52":0,"53":0.01061,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00354,"66":0,"67":0,"68":0.00707,"69":0,"70":0.00354,"71":0,"72":0,"73":0,"74":0,"75":0.00354,"76":0,"77":0,"78":0.00354,"79":0.07779,"80":0,"81":0.01061,"83":0.00354,"84":0.00354,"85":0.01061,"86":0.00707,"87":0.01768,"88":0.00707,"89":0.00707,"90":0.00354,"91":0.01061,"92":0.00707,"93":0.00354,"94":0.00707,"95":0.00707,"96":0.00354,"97":0.00354,"98":0.00354,"99":0.01061,"100":0.01061,"101":0,"102":0.00354,"103":0.02475,"104":0.01768,"105":0.01061,"106":0.01414,"107":0.01414,"108":0.01768,"109":1.5028,"110":0.00707,"111":0.01061,"112":0.03536,"113":0.02829,"114":0.3041,"115":4.26795,"116":2.42216,"117":0.00354,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01414,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01414,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01061,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00354,"72":0.00707,"73":0.00354,"74":0,"75":0,"76":0,"77":0.00354,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0495,"96":0,"97":0,"98":0,"99":0.00707,"100":0.25459,"101":0.22984,"102":0.00354,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00354,"13":0,"14":0.00354,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.01061,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00707,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00354,"109":0.01414,"110":0,"111":0,"112":0.00707,"113":0.01414,"114":0.03182,"115":0.53747,"116":0.20862},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00707,"10":0,"11":0,"12":0,"13":0,"14":0.00707,"15":0,"17":0.00354,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00707,"13.1":0.01061,"14.1":0.01414,"15.1":0.00354,"15.2-15.3":0,"15.4":0.00354,"15.5":0.00707,"15.6":0.04597,"16.0":0.00707,"16.1":0.01768,"16.2":0.00707,"16.3":0.02829,"16.4":0.00707,"16.5":0.08486,"16.6":0.10608},G:{"8":0.00245,"17":0.09573,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00123,"5.0-5.1":0.00245,"6.0-6.1":0.00245,"7.0-7.1":0.02823,"8.1-8.4":0.02209,"9.0-9.2":0.00123,"9.3":0.10187,"10.0-10.2":0,"10.3":0.11782,"11.0-11.2":0.05891,"11.3-11.4":0.00368,"12.0-12.1":0.01964,"12.2-12.5":0.20864,"13.0-13.1":0.00123,"13.2":0,"13.3":0.00614,"13.4-13.7":0.01964,"14.0-14.4":0.081,"14.5-14.8":0.162,"15.0-15.1":0.02946,"15.2-15.3":0.0405,"15.4":0.04909,"15.5":0.08346,"15.6-15.7":0.97693,"16.0":0.39274,"16.1":0.7192,"16.2":0.3326,"16.3":0.77443,"16.4":0.13009,"16.5":3.04003,"16.6":4.76193},P:{"4":0.45841,"20":0.14262,"21":0.31579,"5.0-5.4":0.04075,"6.2-6.4":0.02037,"7.2-7.4":0.06112,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02037,"12.0":0.01019,"13.0":0.04075,"14.0":0.04075,"15.0":0.01019,"16.0":0.04075,"17.0":0.02037,"18.0":0.03056,"19.0":0.08149},I:{"0":0,"3":0,"4":0.02137,"2.1":0.00534,"2.2":0.01603,"2.3":0.01603,"4.1":0.06412,"4.2-4.3":0.03206,"4.4":0,"4.4.3-4.4.4":0.13626},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00354,"8":0.02829,"9":0.00707,"10":0.00707,"11":0.03182,"5.5":0},S:{"2.5":0.00646,_:"3.0-3.1"},J:{"7":0,"10":0.00646},N:{"10":0.0097,"11":0.0097},L:{"0":67.44981},R:{_:"0"},M:{"0":0.23917},Q:{"13.1":0},O:{"0":0.03232},H:{"0":0.28151}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00382,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.03054,"53":0,"54":0,"55":0,"56":0.00382,"57":0.00382,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00382,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00382,"78":0.00382,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00382,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00382,"100":0,"101":0,"102":0.00382,"103":0.00382,"104":0.00382,"105":0,"106":0.00763,"107":0,"108":0.00382,"109":0.00382,"110":0.00763,"111":0.01145,"112":0.00382,"113":0.00382,"114":0.00382,"115":0.39697,"116":0.03435,"117":0.98479,"118":0.12596,"119":0,"120":0,"3.5":0,"3.6":0.00382},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00382,"39":0,"40":0,"41":0,"42":0,"43":0.00382,"44":0.00382,"45":0.00382,"46":0.00382,"47":0.00382,"48":0,"49":0.04199,"50":0,"51":0.00382,"52":0,"53":0.01145,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00763,"66":0,"67":0,"68":0.01145,"69":0,"70":0.00382,"71":0,"72":0.00382,"73":0.00382,"74":0.00382,"75":0.00382,"76":0,"77":0,"78":0.00382,"79":0.09543,"80":0.00382,"81":0.01527,"83":0.00382,"84":0.00763,"85":0.01145,"86":0.00382,"87":0.03435,"88":0.00763,"89":0.00382,"90":0.00382,"91":0.00763,"92":0.00763,"93":0.00382,"94":0.01145,"95":0.00763,"96":0.00763,"97":0.00763,"98":0.00382,"99":0.01527,"100":0.01145,"101":0,"102":0.00763,"103":0.01527,"104":0.01145,"105":0.00382,"106":0.01145,"107":0.03054,"108":0.03054,"109":1.7291,"110":0.01145,"111":0.01145,"112":0.03817,"113":0.02672,"114":0.07252,"115":0.12596,"116":6.11102,"117":1.64894,"118":0.00382,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01909,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00763,"37":0,"38":0,"39":0,"40":0.00382,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01527,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00382,"70":0.00382,"71":0,"72":0.00763,"73":0.00382,"74":0,"75":0,"76":0,"77":0.01527,"78":0.00382,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0458,"96":0,"97":0,"98":0,"99":0.00382,"100":0.04962,"101":0.22139,"102":0.25574,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00382,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.01145,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00382,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00382,"109":0.01527,"110":0,"111":0,"112":0.00382,"113":0.00382,"114":0.00763,"115":0.02672,"116":0.47331,"117":0.34353},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00763,"10":0,"11":0,"12":0,"13":0,"14":0.00382,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00763,"13.1":0.01145,"14.1":0.01145,"15.1":0.00382,"15.2-15.3":0.00382,"15.4":0.00382,"15.5":0.01145,"15.6":0.04962,"16.0":0.01145,"16.1":0.00763,"16.2":0.01145,"16.3":0.02672,"16.4":0.00763,"16.5":0.04962,"16.6":0.19467,"17.0":0.01527,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00331,"6.0-6.1":0.0011,"7.0-7.1":0.03306,"8.1-8.4":0.01763,"9.0-9.2":0.00441,"9.3":0.07935,"10.0-10.2":0,"10.3":0.10249,"11.0-11.2":0.06833,"11.3-11.4":0.00771,"12.0-12.1":0.01653,"12.2-12.5":0.216,"13.0-13.1":0.0022,"13.2":0,"13.3":0.00661,"13.4-13.7":0.00992,"14.0-14.4":0.07384,"14.5-14.8":0.19285,"15.0-15.1":0.02204,"15.2-15.3":0.03967,"15.4":0.02865,"15.5":0.07494,"15.6-15.7":0.82211,"16.0":0.27771,"16.1":0.52126,"16.2":0.29204,"16.3":0.50693,"16.4":0.07714,"16.5":0.28983,"16.6":6.37303,"17.0":0.68105,"17.1":0.00331},P:{"4":0.39817,"20":0.1123,"21":0.22461,"22":3.95105,"5.0-5.4":0.02042,"6.2-6.4":0.02042,"7.2-7.4":0.06126,"8.2":0,"9.2":0.01021,"10.1":0,"11.1-11.2":0.02042,"12.0":0.01021,"13.0":0.04084,"14.0":0.03063,"15.0":0.01021,"16.0":0.04084,"17.0":0.02042,"18.0":0.03063,"19.0":0.06126},I:{"0":0,"3":0.01011,"4":0.02358,"2.1":0,"2.2":0.01348,"2.3":0.02021,"4.1":0.02695,"4.2-4.3":0.03032,"4.4":0,"4.4.3-4.4.4":0.15497},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00382,"8":0.02672,"9":0.00382,"10":0.00382,"11":0.03817,"5.5":0},S:{"2.5":0.00618,_:"3.0-3.1"},J:{"7":0,"10":0.00618},N:{"10":0.01855,"11":0},L:{"0":66.91288},R:{_:"0"},M:{"0":0.22259},Q:{"13.1":0},O:{"0":0.01855},H:{"0":0.24585}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BB.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BB.js
index 3b436a167177b3..9014736e89911e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BB.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BB.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01916,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00958,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00479,"113":0.00958,"114":0.01916,"115":0.11978,"116":0.79531,"117":0.03833,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00958,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00479,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00479,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00479,"77":0,"78":0,"79":0.18685,"80":0.0527,"81":0.00958,"83":0,"84":0.02396,"85":0.00958,"86":0,"87":0.01437,"88":0,"89":0,"90":0,"91":0.00479,"92":0,"93":0.00958,"94":0,"95":0.02875,"96":0.00479,"97":0,"98":0,"99":0.00479,"100":0,"101":0,"102":0,"103":0.1581,"104":0.00479,"105":0,"106":0.00958,"107":0.00479,"108":0.00479,"109":0.54138,"110":0.00479,"111":0.00958,"112":0.0527,"113":0.02875,"114":0.64679,"115":7.7183,"116":4.12505,"117":0.00479,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00479,"68":0,"69":0,"70":0,"71":0,"72":0.00958,"73":0,"74":0,"75":0,"76":0,"77":0.00479,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00958,"96":0,"97":0,"98":0,"99":0.00479,"100":0.83843,"101":0.20122,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.01916,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.00958,"85":0,"86":0,"87":0,"88":0,"89":0.00479,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00479,"106":0,"107":0,"108":0,"109":0.01916,"110":0,"111":0,"112":0.00479,"113":0,"114":0.17727,"115":2.53444,"116":0.66595},E:{"4":0,"5":0,"6":0,"7":0.00479,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00958,"14":0.00958,"15":0.00479,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01916,"14.1":0.04312,"15.1":0.00479,"15.2-15.3":0.00958,"15.4":0.01916,"15.5":0.04312,"15.6":0.38807,"16.0":0.02875,"16.1":0.11498,"16.2":0.08145,"16.3":0.13894,"16.4":0.02875,"16.5":0.25871,"16.6":0.77614},G:{"8":0,"17":0.13685,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00421,"6.0-6.1":0,"7.0-7.1":0.05895,"8.1-8.4":0,"9.0-9.2":0.00211,"9.3":0.16001,"10.0-10.2":0,"10.3":0.08211,"11.0-11.2":0.02316,"11.3-11.4":0.00211,"12.0-12.1":0,"12.2-12.5":0.66951,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.00211,"14.0-14.4":0.06106,"14.5-14.8":0.07579,"15.0-15.1":0.01263,"15.2-15.3":0.02948,"15.4":0.05053,"15.5":0.06948,"15.6-15.7":1.5243,"16.0":0.89479,"16.1":0.81268,"16.2":0.36423,"16.3":1.04638,"16.4":0.11159,"16.5":4.1392,"16.6":10.70591},P:{"4":0.1935,"20":0.1505,"21":0.24725,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.172,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03225,"12.0":0,"13.0":0.043,"14.0":0.03225,"15.0":0,"16.0":0.01075,"17.0":0.03225,"18.0":0.086,"19.0":0.043},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02643,"4.2-4.3":0.05287,"4.4":0,"4.4.3-4.4.4":1.21594},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":46.83018},R:{_:"0"},M:{"0":0.55215},Q:{"13.1":0},O:{"0":0.05209},H:{"0":0.08877}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.03425,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00489,"113":0.00489,"114":0.01468,"115":0.02447,"116":0.07829,"117":0.94435,"118":0.06361,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00489,"50":0.00489,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00489,"75":0,"76":0.01468,"77":0,"78":0,"79":0.08318,"80":0.02936,"81":0.00979,"83":0.00489,"84":0.03425,"85":0.01468,"86":0,"87":0.01468,"88":0,"89":0,"90":0,"91":0.00489,"92":0,"93":0.00979,"94":0,"95":0.00979,"96":0,"97":0,"98":0,"99":0.00489,"100":0.00489,"101":0,"102":0,"103":0.15168,"104":0.00489,"105":0,"106":0.00489,"107":0.00489,"108":0.00979,"109":0.38655,"110":0.00489,"111":0.00489,"112":0.03425,"113":0.01468,"114":0.10765,"115":0.25933,"116":11.17072,"117":2.45629,"118":0.01957,"119":0.00489,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00489,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00489,"68":0,"69":0,"70":0,"71":0,"72":0.00979,"73":0,"74":0,"75":0,"76":0,"77":0.00489,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00489,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00489,"96":0,"97":0,"98":0,"99":0.00489,"100":0.17126,"101":0.20061,"102":0.18104,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.00979,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00489,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.03425,"110":0,"111":0,"112":0,"113":0,"114":0.00979,"115":0.0734,"116":1.93274,"117":1.35536},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00489,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02447,"14.1":0.05382,"15.1":0.00979,"15.2-15.3":0.00489,"15.4":0.01468,"15.5":0.05382,"15.6":0.14679,"16.0":0.01468,"16.1":0.12722,"16.2":0.02936,"16.3":0.09786,"16.4":0.03425,"16.5":0.10275,"16.6":1.16943,"17.0":0.04404,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01417,"6.0-6.1":0,"7.0-7.1":0.00607,"8.1-8.4":0,"9.0-9.2":0.00405,"9.3":0.20038,"10.0-10.2":0,"10.3":0.07691,"11.0-11.2":0.00607,"11.3-11.4":0.00607,"12.0-12.1":0,"12.2-12.5":0.5222,"13.0-13.1":0.00405,"13.2":0,"13.3":0,"13.4-13.7":0.01214,"14.0-14.4":0.02024,"14.5-14.8":0.06072,"15.0-15.1":0.0081,"15.2-15.3":0.01822,"15.4":0.02631,"15.5":0.0506,"15.6-15.7":1.94509,"16.0":0.44326,"16.1":0.75901,"16.2":0.26717,"16.3":0.7327,"16.4":0.06679,"16.5":0.7327,"16.6":12.40529,"17.0":1.35003,"17.1":0.01012},P:{"4":0.16132,"20":0.15057,"21":0.24736,"22":4.46322,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.18283,"8.2":0,"9.2":0.01075,"10.1":0,"11.1-11.2":0.01075,"12.0":0,"13.0":0.06453,"14.0":0.04302,"15.0":0.01075,"16.0":0.01075,"17.0":0.03226,"18.0":0.06453,"19.0":0.03226},I:{"0":0,"3":0,"4":0.04201,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.08401,"4.4":0,"4.4.3-4.4.4":1.17616},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00734,"11":0.00734,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":47.73852},R:{_:"0"},M:{"0":0.53113},Q:{"13.1":0},O:{"0":0.09193},H:{"0":0.13538}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BD.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BD.js
index 5d27c2267dace4..2339f9e9a7a773 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BD.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BD.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.01362,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00545,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00272,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0109,"103":0,"104":0,"105":0.00272,"106":0,"107":0.00272,"108":0.00272,"109":0.00272,"110":0.00272,"111":0.00272,"112":0.00272,"113":0.00272,"114":0.00817,"115":0.25061,"116":0.44946,"117":0.03814,"118":0.00272,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00272,"47":0,"48":0,"49":0.00272,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00272,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00272,"71":0,"72":0.00272,"73":0.00272,"74":0.00272,"75":0.00272,"76":0,"77":0,"78":0.00272,"79":0.00545,"80":0.00272,"81":0.00817,"83":0.00272,"84":0.00272,"85":0.0109,"86":0.00272,"87":0.00545,"88":0.00817,"89":0,"90":0,"91":0.00272,"92":0,"93":0.00272,"94":0.00817,"95":0.00545,"96":0.00272,"97":0.00272,"98":0.00272,"99":0.00272,"100":0.00272,"101":0.00272,"102":0.00545,"103":0.00817,"104":0.00545,"105":0.00817,"106":0.02179,"107":0.02179,"108":0.02996,"109":0.49032,"110":0.01362,"111":0.01907,"112":0.02179,"113":0.02179,"114":0.10896,"115":2.60414,"116":1.53634,"117":0.0109,"118":0.00545,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00272,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00272,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00272,"62":0,"63":0,"64":0.00272,"65":0,"66":0,"67":0.00272,"68":0.00272,"69":0.01634,"70":0.02452,"71":0.16889,"72":0.15527,"73":0,"74":0,"75":0.00272,"76":0.00817,"77":0.00545,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0109,"96":0,"97":0,"98":0,"99":0.00272,"100":0.05993,"101":0.079,"102":0.00272,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00272,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00545,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00272,"108":0.00272,"109":0.00545,"110":0.00272,"111":0,"112":0,"113":0.00272,"114":0.00545,"115":0.20975,"116":0.07355},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00272,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00272,"14.1":0.00272,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00817,"16.0":0.00272,"16.1":0.00272,"16.2":0.00272,"16.3":0.00545,"16.4":0.00272,"16.5":0.01634,"16.6":0.01907},G:{"8":0,"17":0.03404,"3.2":0.00087,"4.0-4.1":0,"4.2-4.3":0.00087,"5.0-5.1":0.00145,"6.0-6.1":0,"7.0-7.1":0.04684,"8.1-8.4":0.00145,"9.0-9.2":0.00233,"9.3":0.02153,"10.0-10.2":0.00116,"10.3":0.01105,"11.0-11.2":0.00785,"11.3-11.4":0.00145,"12.0-12.1":0.00378,"12.2-12.5":0.12073,"13.0-13.1":0.0032,"13.2":0.00262,"13.3":0.00465,"13.4-13.7":0.01135,"14.0-14.4":0.03054,"14.5-14.8":0.03782,"15.0-15.1":0.02065,"15.2-15.3":0.03229,"15.4":0.03113,"15.5":0.04567,"15.6-15.7":0.41396,"16.0":0.08843,"16.1":0.144,"16.2":0.07796,"16.3":0.16611,"16.4":0.06807,"16.5":0.53003,"16.6":0.94428},P:{"4":0.20345,"20":0.04069,"21":0.10172,"22":0.48827,"5.0-5.4":0.01017,"6.2-6.4":0.01017,"7.2-7.4":0.06103,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01017,"12.0":0,"13.0":0.01017,"14.0":0.01017,"15.0":0.01017,"16.0":0.02034,"17.0":0.03052,"18.0":0.01017,"19.0":0.03052},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00498,"4.4":0,"4.4.3-4.4.4":0.13682},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00272,"9":0,"10":0,"11":0.02179,"5.5":0},S:{"2.5":0.01455,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":82.19154},R:{_:"0"},M:{"0":0.10186},Q:{"13.1":0},O:{"0":3.01226},H:{"0":2.10786}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00828,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00552,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00276,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00276,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01104,"103":0,"104":0,"105":0.00276,"106":0.00276,"107":0.00276,"108":0.00276,"109":0.00276,"110":0.00276,"111":0.00276,"112":0,"113":0.00276,"114":0.00276,"115":0.19313,"116":0.02207,"117":0.4911,"118":0.06346,"119":0.00276,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00276,"47":0,"48":0.00276,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00276,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00276,"70":0.00276,"71":0,"72":0,"73":0.00552,"74":0.00276,"75":0.00552,"76":0.00276,"77":0.00276,"78":0.00276,"79":0.00552,"80":0.00276,"81":0.00828,"83":0.00276,"84":0.00276,"85":0.01931,"86":0.00828,"87":0.00828,"88":0.00552,"89":0.00276,"90":0.00276,"91":0.00276,"92":0.00276,"93":0.00276,"94":0.00828,"95":0.00552,"96":0.00276,"97":0.00276,"98":0.00552,"99":0.00276,"100":0.00276,"101":0.00276,"102":0.00828,"103":0.01104,"104":0.00552,"105":0.01655,"106":0.03311,"107":0.03863,"108":0.04966,"109":0.49386,"110":0.01931,"111":0.02207,"112":0.03035,"113":0.0138,"114":0.03587,"115":0.05518,"116":3.1894,"117":0.90219,"118":0.01655,"119":0.00552,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00276,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00276,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00552,"62":0,"63":0.00276,"64":0.00276,"65":0,"66":0,"67":0,"68":0.00552,"69":0.0138,"70":0.0138,"71":0.03035,"72":0.28694,"73":0.06898,"74":0.00276,"75":0,"76":0.00276,"77":0.02759,"78":0.00552,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00552,"89":0,"90":0.00276,"91":0,"92":0,"93":0,"94":0.00276,"95":0.01104,"96":0,"97":0,"98":0,"99":0,"100":0.00828,"101":0.06622,"102":0.06346,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00276,"79":0,"80":0,"81":0,"83":0,"84":0.00276,"85":0.00276,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00552,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00276,"104":0,"105":0,"106":0.00276,"107":0.00828,"108":0.00552,"109":0.00552,"110":0.00276,"111":0.00276,"112":0.00276,"113":0,"114":0.00276,"115":0.00552,"116":0.1683,"117":0.1214},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00276,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00276,"15.6":0.00828,"16.0":0,"16.1":0.00276,"16.2":0.00276,"16.3":0.00276,"16.4":0.00276,"16.5":0.00552,"16.6":0.03311,"17.0":0.00552,"17.1":0},G:{"8":0,"3.2":0.00067,"4.0-4.1":0,"4.2-4.3":0.00067,"5.0-5.1":0.00168,"6.0-6.1":0,"7.0-7.1":0.07423,"8.1-8.4":0.00134,"9.0-9.2":0.00336,"9.3":0.02183,"10.0-10.2":0.00101,"10.3":0.01411,"11.0-11.2":0.00974,"11.3-11.4":0.00202,"12.0-12.1":0.00369,"12.2-12.5":0.1236,"13.0-13.1":0.00134,"13.2":0.00202,"13.3":0.19346,"13.4-13.7":0.01142,"14.0-14.4":0.03627,"14.5-14.8":0.03392,"15.0-15.1":0.02351,"15.2-15.3":0.02519,"15.4":0.03191,"15.5":0.05105,"15.6-15.7":0.441,"16.0":0.09405,"16.1":0.15618,"16.2":0.08229,"16.3":0.16794,"16.4":0.06214,"16.5":0.16324,"16.6":1.31966,"17.0":0.17029,"17.1":0.00034},P:{"4":0.17929,"20":0.03164,"21":0.07383,"22":0.50624,"5.0-5.4":0,"6.2-6.4":0.01055,"7.2-7.4":0.06328,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01055,"12.0":0,"13.0":0.01055,"14.0":0,"15.0":0,"16.0":0.02109,"17.0":0.03164,"18.0":0.01055,"19.0":0.02109},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00829,"4.4":0,"4.4.3-4.4.4":0.14654},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00276,"9":0,"10":0,"11":0.02759,"5.5":0},S:{"2.5":0.00724,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":81.11057},R:{_:"0"},M:{"0":0.09413},Q:{"13.1":0},O:{"0":3.38155},H:{"0":2.21427}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BE.js
index 3598e717ef4211..5a3033f05e7946 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00653,"49":0,"50":0,"51":0,"52":0.01306,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02612,"79":0,"80":0,"81":0,"82":0,"83":0.00653,"84":0,"85":0,"86":0,"87":0.27426,"88":0,"89":0,"90":0,"91":0.00653,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00653,"99":0,"100":0,"101":0.00653,"102":0.0653,"103":0,"104":0,"105":0,"106":0,"107":0.00653,"108":0.00653,"109":0.00653,"110":0.00653,"111":0,"112":0.00653,"113":0.01306,"114":0.01959,"115":0.45057,"116":1.52149,"117":0.05224,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00653,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01959,"50":0,"51":0,"52":0,"53":0.00653,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.01959,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.04571,"75":0.04571,"76":0.04571,"77":0.04571,"78":0.69218,"79":0.92073,"80":0.00653,"81":0.00653,"83":0.08489,"84":0,"85":0.00653,"86":0,"87":0.02612,"88":0.00653,"89":0.01959,"90":0.01306,"91":0.00653,"92":0.00653,"93":0.01306,"94":0,"95":0.07836,"96":0.00653,"97":0,"98":0.00653,"99":0.01306,"100":0.00653,"101":0.01306,"102":0.00653,"103":0.12407,"104":0.01306,"105":0.05877,"106":0.01959,"107":0.01306,"108":0.03918,"109":0.88155,"110":0.02612,"111":0.04571,"112":0.07836,"113":0.23508,"114":2.09613,"115":14.7578,"116":6.88915,"117":0.00653,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01306,"96":0,"97":0,"98":0,"99":0.01306,"100":0.34609,"101":0.24161,"102":0.01306,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00653,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00653,"91":0,"92":0.00653,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00653,"107":0.01306,"108":0.01306,"109":0.09795,"110":0.01306,"111":0.02612,"112":0.01959,"113":0.04571,"114":0.37221,"115":5.54397,"116":1.77616},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00653,"14":0.03265,"15":0.00653,"17":0.01306,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01959,"13.1":0.10448,"14.1":0.11754,"15.1":0.01959,"15.2-15.3":0.01959,"15.4":0.03918,"15.5":0.05877,"15.6":0.36568,"16.0":0.02612,"16.1":0.08489,"16.2":0.08489,"16.3":0.22202,"16.4":0.07836,"16.5":0.75748,"16.6":0.99256},G:{"8":0,"17":0.17488,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01543,"8.1-8.4":0.00257,"9.0-9.2":0,"9.3":0.04629,"10.0-10.2":0.00514,"10.3":0.0823,"11.0-11.2":0.02057,"11.3-11.4":0.04372,"12.0-12.1":0.01029,"12.2-12.5":0.28803,"13.0-13.1":0,"13.2":0,"13.3":0.01029,"13.4-13.7":0.02572,"14.0-14.4":0.09515,"14.5-14.8":0.18774,"15.0-15.1":0.07715,"15.2-15.3":0.09773,"15.4":0.12087,"15.5":0.18259,"15.6-15.7":1.79764,"16.0":0.94383,"16.1":1.82079,"16.2":0.77152,"16.3":1.81565,"16.4":0.27518,"16.5":5.1229,"16.6":11.65254},P:{"4":0.04127,"20":0.04127,"21":0.17539,"22":2.68238,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.05158,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01032,"14.0":0,"15.0":0,"16.0":0.01032,"17.0":0.01032,"18.0":0.01032,"19.0":0.04127},I:{"0":0,"3":0,"4":0.01065,"2.1":0,"2.2":0.00532,"2.3":0.00799,"4.1":0.03994,"4.2-4.3":0.01597,"4.4":0,"4.4.3-4.4.4":0.09319},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01306,"9":0,"10":0,"11":0.05224,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":26.42331},R:{_:"0"},M:{"0":0.22902},Q:{"13.1":0},O:{"0":0.02429},H:{"0":0.09527}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00617,"49":0,"50":0,"51":0,"52":0.01234,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00617,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.03085,"79":0,"80":0,"81":0,"82":0,"83":0.01234,"84":0,"85":0,"86":0,"87":0.04936,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00617,"95":0,"96":0,"97":0,"98":0.00617,"99":0,"100":0,"101":0,"102":0.07404,"103":0,"104":0.00617,"105":0.00617,"106":0,"107":0,"108":0.00617,"109":0.00617,"110":0.00617,"111":0,"112":0.00617,"113":0.01851,"114":0.00617,"115":0.1851,"116":0.1234,"117":1.73377,"118":0.17276,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00617,"35":0,"36":0,"37":0,"38":0.00617,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03085,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.01851,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.04319,"75":0.04319,"76":0.04319,"77":0.04319,"78":0.70955,"79":0.93784,"80":0.00617,"81":0.00617,"83":0.06787,"84":0.00617,"85":0.00617,"86":0,"87":0.01234,"88":0.00617,"89":0.01234,"90":0.00617,"91":0.00617,"92":0,"93":0.03702,"94":0.00617,"95":0.09255,"96":0.01234,"97":0.00617,"98":0.00617,"99":0.00617,"100":0.00617,"101":0.00617,"102":0.00617,"103":0.08021,"104":0.01234,"105":0.03702,"106":0.01851,"107":0.01851,"108":0.03702,"109":0.73423,"110":0.01234,"111":0.02468,"112":0.04319,"113":0.11106,"114":0.4319,"115":0.86997,"116":15.58542,"117":3.49839,"118":0.01234,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00617,"73":0,"74":0,"75":0,"76":0,"77":0.01234,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01234,"96":0,"97":0,"98":0,"99":0.01234,"100":0.08638,"101":0.22829,"102":0.43807,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00617,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00617,"93":0,"94":0,"95":0.00617,"96":0,"97":0,"98":0,"99":0.00617,"100":0,"101":0.00617,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00617,"108":0.01234,"109":0.08638,"110":0.01234,"111":0.00617,"112":0.01234,"113":0.01234,"114":0.10489,"115":0.31467,"116":4.10305,"117":2.11014},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00617,"14":0.03702,"15":0.00617,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.02468,"13.1":0.10489,"14.1":0.1234,"15.1":0.01851,"15.2-15.3":0.01851,"15.4":0.04319,"15.5":0.05553,"15.6":0.37637,"16.0":0.03085,"16.1":0.08021,"16.2":0.08021,"16.3":0.20978,"16.4":0.07404,"16.5":0.26531,"16.6":1.62271,"17.0":0.08021,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0143,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04576,"10.0-10.2":0,"10.3":0.08007,"11.0-11.2":0.02288,"11.3-11.4":0.03432,"12.0-12.1":0.01144,"12.2-12.5":0.28598,"13.0-13.1":0,"13.2":0,"13.3":0.05148,"13.4-13.7":0.0286,"14.0-14.4":0.13155,"14.5-14.8":0.2059,"15.0-15.1":0.07721,"15.2-15.3":0.10009,"15.4":0.12869,"15.5":0.18875,"15.6-15.7":1.75019,"16.0":1.00951,"16.1":1.80453,"16.2":0.74641,"16.3":1.56716,"16.4":0.21734,"16.5":0.73211,"16.6":17.26455,"17.0":1.73589,"17.1":0.00286},P:{"4":0.02092,"20":0.03138,"21":0.11506,"22":2.9498,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01046,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01046,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01046,"18.0":0.01046,"19.0":0.03138},I:{"0":0,"3":0,"4":0.01099,"2.1":0,"2.2":0.00733,"2.3":0.01099,"4.1":0.01832,"4.2-4.3":0.01832,"4.4":0,"4.4.3-4.4.4":0.10257},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01234,"9":0,"10":0,"11":0.04936,"5.5":0},S:{"2.5":0.00383,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":28.12061},R:{_:"0"},M:{"0":0.3064},Q:{"13.1":0},O:{"0":0.02298},H:{"0":0.13054}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BF.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BF.js
index c394405d6a2634..c933c974f3c268 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BF.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BF.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00269,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00269,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00269,"69":0,"70":0,"71":0,"72":0.00269,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.02421,"86":0,"87":0,"88":0,"89":0,"90":0.00269,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00538,"100":0,"101":0,"102":0.03228,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00269,"111":0.01345,"112":0.00269,"113":0.00269,"114":0.04573,"115":0.18561,"116":0.43847,"117":0.01076,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01076,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00269,"50":0.00269,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00269,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00807,"71":0,"72":0,"73":0,"74":0,"75":0.00269,"76":0,"77":0,"78":0,"79":0.00269,"80":0,"81":0.00538,"83":0.00269,"84":0,"85":0,"86":0,"87":0.00269,"88":0,"89":0,"90":0,"91":0.01076,"92":0.00269,"93":0.00538,"94":0.00269,"95":0.00538,"96":0,"97":0,"98":0,"99":0.01614,"100":0.00269,"101":0,"102":0,"103":0.02421,"104":0,"105":0.00538,"106":0.00269,"107":0.00538,"108":0.00269,"109":0.38467,"110":0.00269,"111":0.00538,"112":0.01614,"113":0.01076,"114":0.12374,"115":1.43377,"116":1.05448,"117":0.00269,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00807,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00269,"47":0.00269,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00807,"60":0.04035,"62":0.01345,"63":0.01614,"64":0.00538,"65":0,"66":0.01883,"67":0.03497,"68":0.00269,"69":0.0807,"70":0.04573,"71":0.11567,"72":0.1345,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00269,"80":0,"81":0,"82":0,"83":0,"84":0.00807,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02959,"96":0,"97":0,"98":0,"99":0.00269,"100":0.0538,"101":0.18292,"102":0.02152,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00538,"11.5":0,"11.6":0,"12.1":0.00269},B:{"12":0.00269,"13":0,"14":0,"15":0,"16":0.00538,"17":0.00269,"18":0.00538,"79":0,"80":0,"81":0,"83":0,"84":0.00269,"85":0.00269,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00269,"92":0.00807,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00269,"101":0,"102":0,"103":0.00269,"104":0,"105":0,"106":0.00269,"107":0.00269,"108":0.00807,"109":0.01076,"110":0.00269,"111":0.02152,"112":0.00269,"113":0.00538,"114":0.11567,"115":0.76127,"116":0.29321},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0.00269,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00807,"14.1":0.00269,"15.1":0,"15.2-15.3":0,"15.4":0.00269,"15.5":0.00269,"15.6":0.00807,"16.0":0,"16.1":0.00269,"16.2":0,"16.3":0.00807,"16.4":0.01076,"16.5":0.01345,"16.6":0.04035},G:{"8":0,"17":0.09306,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00177,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.06913,"10.0-10.2":0.00443,"10.3":0.07622,"11.0-11.2":0.00443,"11.3-11.4":0,"12.0-12.1":0.3563,"12.2-12.5":1.53775,"13.0-13.1":0.00443,"13.2":0,"13.3":0.00975,"13.4-13.7":0.02925,"14.0-14.4":0.20297,"14.5-14.8":0.1551,"15.0-15.1":0.13206,"15.2-15.3":0.11168,"15.4":0.05229,"15.5":0.12852,"15.6-15.7":0.72677,"16.0":0.24639,"16.1":0.55483,"16.2":0.19942,"16.3":0.30223,"16.4":0.18347,"16.5":1.58029,"16.6":2.09524},P:{"4":0.04128,"20":0.1032,"21":0.14448,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.07224,"8.2":0,"9.2":0.02064,"10.1":0,"11.1-11.2":0,"12.0":0.01032,"13.0":0,"14.0":0.01032,"15.0":0.01032,"16.0":0.01032,"17.0":0.01032,"18.0":0.02064,"19.0":0.0516},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00479,"4.4":0,"4.4.3-4.4.4":0.22673},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00807,"5.5":0},S:{"2.5":0.00731,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.90138},R:{_:"0"},M:{"0":0.10234},Q:{"13.1":0.05848},O:{"0":0.65059},H:{"0":5.77873}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00273,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00273,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.03007,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00547,"100":0,"101":0,"102":0.0082,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00273,"110":0,"111":0.00273,"112":0.00273,"113":0.00273,"114":0.05468,"115":0.19411,"116":0.04374,"117":0.54407,"118":0.06835,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00547,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00273,"65":0,"66":0,"67":0,"68":0,"69":0.00547,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00547,"80":0,"81":0.0164,"83":0,"84":0,"85":0,"86":0,"87":0.00273,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00547,"94":0.02734,"95":0.00273,"96":0.00273,"97":0.00547,"98":0,"99":0.00273,"100":0.00273,"101":0,"102":0,"103":0.00547,"104":0.00273,"105":0.01367,"106":0.01094,"107":0.00273,"108":0.01914,"109":0.45384,"110":0.00547,"111":0.00547,"112":0.01914,"113":0.00547,"114":0.01914,"115":0.04374,"116":1.922,"117":0.38003,"118":0,"119":0.00547,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00273,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.03554,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00273,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00273,"60":0.07108,"62":0.00273,"63":0.01094,"64":0.00273,"65":0,"66":0.01367,"67":0.03554,"68":0.00273,"69":0.04921,"70":0.03554,"71":0.06015,"72":0.19685,"73":0.03007,"74":0,"75":0,"76":0,"77":0.0082,"78":0,"79":0.01094,"80":0,"81":0,"82":0,"83":0,"84":0.00273,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00273,"91":0,"92":0,"93":0,"94":0,"95":0.01367,"96":0,"97":0,"98":0,"99":0,"100":0.00273,"101":0.13123,"102":0.1449,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00273},B:{"12":0.00273,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00547,"79":0,"80":0,"81":0,"83":0,"84":0.00273,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00273,"91":0,"92":0.0082,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00273,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00547,"109":0.05195,"110":0,"111":0,"112":0,"113":0.00273,"114":0.04648,"115":0.06015,"116":0.5632,"117":0.39916},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00547,"14.1":0.00273,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00273,"15.6":0.01094,"16.0":0,"16.1":0,"16.2":0,"16.3":0.0082,"16.4":0.01094,"16.5":0.01094,"16.6":0.04374,"17.0":0.00273,"17.1":0},G:{"8":0.00475,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00136,"6.0-6.1":0,"7.0-7.1":0.24153,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01832,"10.0-10.2":0,"10.3":0.01221,"11.0-11.2":0.00543,"11.3-11.4":0.00814,"12.0-12.1":0.48713,"12.2-12.5":0.51698,"13.0-13.1":0.00204,"13.2":0,"13.3":0.00407,"13.4-13.7":0.0095,"14.0-14.4":0.13705,"14.5-14.8":0.03596,"15.0-15.1":0.10652,"15.2-15.3":0.04681,"15.4":0.019,"15.5":0.04342,"15.6-15.7":0.65064,"16.0":0.23678,"16.1":0.31819,"16.2":0.12076,"16.3":0.19132,"16.4":0.26731,"16.5":0.53598,"16.6":1.86846,"17.0":0.82025,"17.1":0},P:{"4":0.02093,"20":0.07326,"21":0.07326,"22":0.57561,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.31397,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.01047,"15.0":0.01047,"16.0":0,"17.0":0.01047,"18.0":0.02093,"19.0":0.0314},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00152,"4.4":0,"4.4.3-4.4.4":0.12949},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0082,"5.5":0},S:{"2.5":0.00727,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":80.29328},R:{_:"0"},M:{"0":0.10899},Q:{"13.1":0.11626},O:{"0":0.46502},H:{"0":3.50828}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BG.js
index ca988175cee74c..71448df33a7437 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.06224,"46":0,"47":0,"48":0.00311,"49":0,"50":0,"51":0,"52":0.03423,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00934,"67":0,"68":0.00311,"69":0,"70":0,"71":0,"72":0.00311,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00622,"79":0,"80":0.00311,"81":0,"82":0,"83":0.00622,"84":0.00311,"85":0.00311,"86":0,"87":0,"88":0.00311,"89":0,"90":0.00311,"91":0.00311,"92":0,"93":0,"94":0,"95":0,"96":0.00311,"97":0.00311,"98":0.00311,"99":0.00311,"100":0.00311,"101":0,"102":0.04357,"103":0.00311,"104":0.00311,"105":0.00311,"106":0.00311,"107":0.00311,"108":0.00934,"109":0.00311,"110":0.00311,"111":0.00622,"112":0.00934,"113":0.01245,"114":0.01867,"115":0.42323,"116":0.70954,"117":0.02178,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00311,"34":0,"35":0,"36":0,"37":0,"38":0.00311,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0249,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00311,"69":0,"70":0.00311,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00311,"79":0.02178,"80":0.00311,"81":0.00934,"83":0.00311,"84":0,"85":0.00311,"86":0.00311,"87":0.00622,"88":0.00311,"89":0.00311,"90":0.00311,"91":0.00311,"92":0.00311,"93":0.00622,"94":0.00311,"95":0.00622,"96":0.00311,"97":0.00311,"98":0.00311,"99":0.01245,"100":0.00311,"101":0,"102":0.00622,"103":0.00934,"104":0.00622,"105":0.00622,"106":0.02178,"107":0.00622,"108":0.01245,"109":0.9585,"110":0.00622,"111":0.00934,"112":0.01245,"113":0.02178,"114":0.19294,"115":3.17735,"116":1.74894,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00622,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00311,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00622,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00311,"72":0.00311,"73":0,"74":0,"75":0,"76":0.00311,"77":0.00311,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00311,"86":0,"87":0.00311,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00311,"95":0.03112,"96":0,"97":0,"98":0,"99":0.00622,"100":0.14626,"101":0.1556,"102":0.00311,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00311,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00311,"109":0.0249,"110":0.00311,"111":0.00311,"112":0.00311,"113":0.00311,"114":0.0249,"115":0.61929,"116":0.19294},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00311,"15":0,"17":0.00311,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00622,"14.1":0.00934,"15.1":0,"15.2-15.3":0,"15.4":0.00311,"15.5":0.00311,"15.6":0.02178,"16.0":0.00311,"16.1":0.00622,"16.2":0.00622,"16.3":0.01867,"16.4":0.00622,"16.5":0.0529,"16.6":0.06224},G:{"8":0,"17":0.11199,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00135,"6.0-6.1":0,"7.0-7.1":0.01214,"8.1-8.4":0.0027,"9.0-9.2":0,"9.3":0.01349,"10.0-10.2":0,"10.3":0.03238,"11.0-11.2":0.02698,"11.3-11.4":0.0027,"12.0-12.1":0.00675,"12.2-12.5":0.15786,"13.0-13.1":0.00675,"13.2":0.0027,"13.3":0.01214,"13.4-13.7":0.02698,"14.0-14.4":0.07016,"14.5-14.8":0.19564,"15.0-15.1":0.04722,"15.2-15.3":0.05532,"15.4":0.07961,"15.5":0.11064,"15.6-15.7":0.96066,"16.0":0.56668,"16.1":0.8109,"16.2":0.43581,"16.3":0.83384,"16.4":0.20374,"16.5":2.7916,"16.6":5.90431},P:{"4":0.10243,"20":0.13316,"21":0.32778,"5.0-5.4":0.01024,"6.2-6.4":0.01024,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02049,"12.0":0.01024,"13.0":0.02049,"14.0":0.02049,"15.0":0.01024,"16.0":0.03073,"17.0":0.03073,"18.0":0.03073,"19.0":0.09219},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.08292,"4.2-4.3":0.05103,"4.4":0,"4.4.3-4.4.4":0.16584},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00311,"9":0,"10":0,"11":0.04046,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":71.29602},R:{_:"0"},M:{"0":0.20664},Q:{"13.1":0},O:{"0":0.02755},H:{"0":0.28693}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.21246,"46":0,"47":0,"48":0.02854,"49":0,"50":0,"51":0,"52":0.03488,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00317,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.01268,"67":0,"68":0.00317,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00634,"79":0,"80":0.00634,"81":0,"82":0,"83":0.00634,"84":0.00634,"85":0,"86":0,"87":0,"88":0.00317,"89":0,"90":0.00317,"91":0.00317,"92":0,"93":0,"94":0,"95":0,"96":0.00317,"97":0,"98":0.00317,"99":0.00317,"100":0,"101":0,"102":0.03805,"103":0.00317,"104":0.00317,"105":0,"106":0,"107":0.00317,"108":0.00634,"109":0.00317,"110":0.00317,"111":0.00317,"112":0.00634,"113":0.00634,"114":0.00951,"115":0.28222,"116":0.05708,"117":0.75153,"118":0.06025,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00317,"34":0,"35":0,"36":0,"37":0,"38":0.00317,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0222,"50":0,"51":0.00317,"52":0,"53":0.00317,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00317,"62":0,"63":0.00317,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00317,"72":0,"73":0,"74":0,"75":0.00951,"76":0.00317,"77":0.00951,"78":0.00951,"79":0.0222,"80":0.00634,"81":0.01268,"83":0.00317,"84":0.00317,"85":0.00634,"86":0.00634,"87":0.01268,"88":0.00317,"89":0.00317,"90":0.01268,"91":0.01268,"92":0.00317,"93":0.00634,"94":0.00317,"95":0.00634,"96":0.00317,"97":0.00317,"98":0.00317,"99":0.00951,"100":0.00634,"101":0,"102":0.00951,"103":0.01268,"104":0.00634,"105":0.00634,"106":0.0222,"107":0.01586,"108":0.01586,"109":0.94813,"110":0.00634,"111":0.00951,"112":0.01268,"113":0.01268,"114":0.04757,"115":0.10464,"116":3.97009,"117":1.01155,"118":0.00317,"119":0.00634,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00634,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00317,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00634,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00317,"70":0,"71":0,"72":0.00634,"73":0,"74":0,"75":0.00317,"76":0,"77":0.01268,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00317,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03488,"96":0,"97":0,"98":0,"99":0.00634,"100":0.03171,"101":0.15221,"102":0.16489,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00317,"79":0,"80":0,"81":0.00634,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00317,"90":0.00317,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00317,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02537,"110":0.00317,"111":0.00317,"112":0,"113":0.00317,"114":0.00634,"115":0.01903,"116":0.44711,"117":0.32344},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00317,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00317,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00634,"14.1":0.01268,"15.1":0,"15.2-15.3":0,"15.4":0.00317,"15.5":0.00634,"15.6":0.0222,"16.0":0.00317,"16.1":0.00634,"16.2":0.00634,"16.3":0.01586,"16.4":0.00634,"16.5":0.01903,"16.6":0.09513,"17.0":0.00951,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00831,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01108,"10.0-10.2":0,"10.3":0.03601,"11.0-11.2":0.02077,"11.3-11.4":0.00277,"12.0-12.1":0.00692,"12.2-12.5":0.16758,"13.0-13.1":0.00277,"13.2":0.00138,"13.3":0.44872,"13.4-13.7":0.02631,"14.0-14.4":0.06925,"14.5-14.8":0.18835,"15.0-15.1":0.04293,"15.2-15.3":0.05263,"15.4":0.06786,"15.5":0.09971,"15.6-15.7":0.89605,"16.0":0.4778,"16.1":0.69246,"16.2":0.36008,"16.3":0.66892,"16.4":0.14819,"16.5":0.45979,"16.6":7.80543,"17.0":0.93759,"17.1":0},P:{"4":0.10292,"20":0.11321,"21":0.21613,"22":2.91268,"5.0-5.4":0.01029,"6.2-6.4":0.01029,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02058,"12.0":0,"13.0":0.02058,"14.0":0.02058,"15.0":0.01029,"16.0":0.03088,"17.0":0.03088,"18.0":0.03088,"19.0":0.08234},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.04192,"4.2-4.3":0.06987,"4.4":0,"4.4.3-4.4.4":0.20261},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00634,"9":0,"10":0,"11":0.03805,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":70.68201},R:{_:"0"},M:{"0":0.20487},Q:{"13.1":0},O:{"0":0.02049},H:{"0":0.30387}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BH.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BH.js
index 913b980bd4d44d..4e1f0cfdd4bd21 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BH.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BH.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.036,"102":0.0024,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.0024,"114":0,"115":0.0672,"116":0.1752,"117":0.0048,"118":0.0024,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.0048,"56":0.0024,"57":0,"58":0.0168,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.0048,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.0024,"76":0.0024,"77":0,"78":0.0024,"79":0.024,"80":0,"81":0.012,"83":0.0024,"84":0,"85":0.0024,"86":0.0168,"87":0.012,"88":0.0048,"89":0.0024,"90":0,"91":0.0048,"92":0.0048,"93":0.0024,"94":0.0024,"95":0.0024,"96":0.0024,"97":0,"98":0.0048,"99":0.0072,"100":0,"101":0.0024,"102":0.012,"103":0.0144,"104":0.0024,"105":0,"106":0.0024,"107":0.0048,"108":0.0048,"109":0.2112,"110":0.0048,"111":0.012,"112":0.0072,"113":0.0192,"114":0.1536,"115":2.0784,"116":1.1808,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0096,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.0192,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0048,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0072,"70":0,"71":0.0048,"72":0.0024,"73":0,"74":0.0048,"75":0.0024,"76":0.0288,"77":0.012,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.0024,"98":0.0024,"99":0.0312,"100":0.048,"101":0.0216,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0024,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0384,"110":0.0024,"111":0,"112":0.0024,"113":0.0048,"114":0.0696,"115":0.5088,"116":0.1584},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0024,"14":0.0072,"15":0,"17":0.0048,_:"0","3.1":0,"3.2":0,"5.1":0.0024,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0048,"14.1":0.0144,"15.1":0.0024,"15.2-15.3":0.0024,"15.4":0.0072,"15.5":0.0096,"15.6":0.0456,"16.0":0.0024,"16.1":0.012,"16.2":0.0192,"16.3":0.0312,"16.4":0.0144,"16.5":0.0816,"16.6":0.1632},G:{"8":0,"17":0.30919,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0196,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.06532,"10.0-10.2":0,"10.3":0.02177,"11.0-11.2":0.00653,"11.3-11.4":0.00218,"12.0-12.1":0.00218,"12.2-12.5":0.22862,"13.0-13.1":0.01524,"13.2":0,"13.3":0.02613,"13.4-13.7":0.05226,"14.0-14.4":0.1829,"14.5-14.8":0.30701,"15.0-15.1":0.10016,"15.2-15.3":0.11105,"15.4":0.17201,"15.5":0.25475,"15.6-15.7":1.63085,"16.0":0.91449,"16.1":1.08868,"16.2":0.56394,"16.3":1.20191,"16.4":0.39846,"16.5":4.2524,"16.6":9.83517},P:{"4":0.10174,"20":0.11192,"21":0.34593,"5.0-5.4":0,"6.2-6.4":0.01017,"7.2-7.4":0.07122,"8.2":0,"9.2":0.02035,"10.1":0,"11.1-11.2":0.11192,"12.0":0.01017,"13.0":0.02035,"14.0":0.02035,"15.0":0.01017,"16.0":0.05087,"17.0":0.42733,"18.0":0.05087,"19.0":0.0814},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.1592},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0072,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":59.9176},R:{_:"0"},M:{"0":0.418},Q:{"13.1":0},O:{"0":3.7088},H:{"0":1.45343}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.01137,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00569,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.04833,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00569,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.01137,"114":0.00284,"115":0.0199,"116":0.01706,"117":0.20754,"118":0.02274,"119":0.00284,"120":0.00284,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00284,"57":0,"58":0.00853,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00284,"66":0,"67":0,"68":0.00569,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00284,"76":0.00284,"77":0,"78":0.00284,"79":0.02274,"80":0.04549,"81":0.00284,"83":0,"84":0,"85":0,"86":0.02559,"87":0.01137,"88":0.00284,"89":0.00284,"90":0.02274,"91":0.00284,"92":0,"93":0.00284,"94":0.00569,"95":0.00284,"96":0.00284,"97":0.00569,"98":0.00569,"99":0.00853,"100":0,"101":0,"102":0.00569,"103":0.03696,"104":0,"105":0.00569,"106":0.00569,"107":0.00569,"108":0.00853,"109":0.24166,"110":0.00569,"111":0.00853,"112":0.00853,"113":0.01706,"114":0.06539,"115":0.09951,"116":3.68169,"117":1.09171,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00853,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00569,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00569,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00569,"70":0,"71":0,"72":0.00569,"73":0,"74":0.00284,"75":0,"76":0.00284,"77":0.04833,"78":0.00284,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00569,"94":0,"95":0.00284,"96":0,"97":0,"98":0,"99":0.01706,"100":0.0398,"101":0.04265,"102":0.02559,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00284,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00569,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00569,"101":0,"102":0,"103":0,"104":0.00284,"105":0,"106":0,"107":0,"108":0.00569,"109":0.03696,"110":0.00284,"111":0.00284,"112":0.00284,"113":0.00853,"114":0.01137,"115":0.07676,"116":0.46341,"117":0.41792},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00284,"14":0.01422,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00284,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00569,"14.1":0.0199,"15.1":0.00284,"15.2-15.3":0.00569,"15.4":0.00853,"15.5":0.01422,"15.6":0.05402,"16.0":0.00569,"16.1":0.0199,"16.2":0.01422,"16.3":0.0398,"16.4":0.01706,"16.5":0.0597,"16.6":0.26156,"17.0":0.0398,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00912,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05242,"10.0-10.2":0,"10.3":0.02279,"11.0-11.2":0.0114,"11.3-11.4":0.00228,"12.0-12.1":0.01823,"12.2-12.5":0.19602,"13.0-13.1":0.03875,"13.2":0.00456,"13.3":1.03479,"13.4-13.7":0.03875,"14.0-14.4":0.13676,"14.5-14.8":0.24388,"15.0-15.1":0.07977,"15.2-15.3":0.10257,"15.4":0.17322,"15.5":0.27579,"15.6-15.7":1.49292,"16.0":0.74988,"16.1":0.93222,"16.2":0.47181,"16.3":1.05986,"16.4":0.33277,"16.5":1.00971,"16.6":12.1667,"17.0":1.91914,"17.1":0.00456},P:{"4":0.16208,"20":0.06078,"21":0.18234,"22":3.09984,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.07091,"8.2":0,"9.2":0.05065,"10.1":0,"11.1-11.2":0.1013,"12.0":0.01013,"13.0":0.01013,"14.0":0.02026,"15.0":0.01013,"16.0":0.04052,"17.0":0.11143,"18.0":0.04052,"19.0":0.08104},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.1498},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01706,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.64222},R:{_:"0"},M:{"0":0.5654},Q:{"13.1":0},O:{"0":3.08467},H:{"0":1.36193}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BI.js
index bff8dc5a082028..23f4a641d5dc07 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00248,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00248,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.02726,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00496,"103":0,"104":0.00248,"105":0,"106":0,"107":0.00248,"108":0,"109":0,"110":0.00248,"111":0,"112":0.00496,"113":0.00248,"114":0.00496,"115":0.22302,"116":0.20072,"117":0.00743,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00248,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00248,"48":0,"49":0.00991,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00248,"62":0,"63":0,"64":0.01982,"65":0,"66":0,"67":0.00248,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.04956,"74":0,"75":0,"76":0,"77":0,"78":0.00248,"79":0.02478,"80":0.00248,"81":0.00496,"83":0.01239,"84":0,"85":0,"86":0,"87":0.00248,"88":0.00248,"89":0.00248,"90":0,"91":0,"92":0,"93":0,"94":0.00496,"95":0.00496,"96":0,"97":0,"98":0.00248,"99":0.00248,"100":0,"101":0.0223,"102":0.00248,"103":0.02478,"104":0.00743,"105":0,"106":0.00248,"107":0.01487,"108":0.01487,"109":0.2924,"110":0.00248,"111":0.00496,"112":0.00496,"113":0.01239,"114":0.10655,"115":1.44467,"116":0.73101,"117":0.01735,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0.00248,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00991,"25":0,"26":0.00743,"27":0,"28":0.00743,"29":0,"30":0.00496,"31":0,"32":0.00248,"33":0,"34":0,"35":0.00248,"36":0,"37":0.1462,"38":0,"39":0,"40":0,"41":0,"42":0.00248,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00248,"51":0,"52":0,"53":0,"54":0,"55":0.00248,"56":0.00248,"57":0.00248,"58":0.00496,"60":0.06443,"62":0,"63":0.07434,"64":0.00743,"65":0.00743,"66":0.02478,"67":0.05204,"68":0.00991,"69":0.2255,"70":0.11399,"71":0.36427,"72":0.17346,"73":0,"74":0.00248,"75":0,"76":0.00496,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00248,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00991,"96":0,"97":0,"98":0,"99":0.00743,"100":0.04708,"101":0.08921,"102":0.00496,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00248},B:{"12":0.00248,"13":0,"14":0,"15":0,"16":0,"17":0.00496,"18":0.11399,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.00248,"87":0,"88":0,"89":0.00248,"90":0.00496,"91":0,"92":0.00743,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00496,"101":0,"102":0,"103":0,"104":0,"105":0.00248,"106":0,"107":0,"108":0,"109":0.00991,"110":0,"111":0.00248,"112":0.01487,"113":0.00248,"114":0.02726,"115":0.36427,"116":0.14125},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.1462,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00248,"13.1":0.00248,"14.1":0.00743,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00743,"16.0":0,"16.1":0,"16.2":0.00743,"16.3":0,"16.4":0,"16.5":0.01487,"16.6":0.00496},G:{"8":0,"17":0.01203,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00389,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01132,"10.0-10.2":0,"10.3":0.02087,"11.0-11.2":0.00248,"11.3-11.4":0,"12.0-12.1":0.01026,"12.2-12.5":0.48535,"13.0-13.1":0.00566,"13.2":0.00318,"13.3":0.00884,"13.4-13.7":0.08632,"14.0-14.4":0.10259,"14.5-14.8":0.0711,"15.0-15.1":0.09091,"15.2-15.3":0.11108,"15.4":0.03962,"15.5":0.07252,"15.6-15.7":0.39054,"16.0":0.11285,"16.1":0.30741,"16.2":0.231,"16.3":0.21402,"16.4":0.09339,"16.5":0.71882,"16.6":0.33182},P:{"4":0.20277,"20":0.02028,"21":0.30415,"5.0-5.4":0.08111,"6.2-6.4":0.02028,"7.2-7.4":0.10138,"8.2":0,"9.2":0.02028,"10.1":0,"11.1-11.2":0.03042,"12.0":0,"13.0":0.04055,"14.0":0.02028,"15.0":0,"16.0":0.02028,"17.0":0.02028,"18.0":0.03042,"19.0":0.02028},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00393,"4.2-4.3":0.00168,"4.4":0,"4.4.3-4.4.4":0.15926},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00248,"11":0.00743,"5.5":0},S:{"2.5":0.28584,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.93596},R:{_:"0"},M:{"0":0.03009},Q:{"13.1":0},O:{"0":0.60928},H:{"0":16.35773}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00237,"48":0,"49":0,"50":0,"51":0,"52":0.00237,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00237,"103":0.00237,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00474,"114":0.00474,"115":0.07584,"116":0.00948,"117":0.18012,"118":0.01422,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00237,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00237,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00711,"60":0,"61":0,"62":0,"63":0,"64":0.01185,"65":0,"66":0,"67":0.00237,"68":0,"69":0,"70":0.00711,"71":0,"72":0.00474,"73":0.00474,"74":0.00237,"75":0,"76":0,"77":0,"78":0,"79":0.00474,"80":0.00474,"81":0.00474,"83":0.00237,"84":0.00237,"85":0,"86":0,"87":0.00237,"88":0.00237,"89":0,"90":0.00237,"91":0.01185,"92":0.00237,"93":0.00474,"94":0,"95":0.00237,"96":0.00237,"97":0,"98":0,"99":0.00237,"100":0.00237,"101":0.00948,"102":0.00237,"103":0.00948,"104":0.01185,"105":0.00237,"106":0.00474,"107":0,"108":0.00948,"109":0.2607,"110":0.00474,"111":0.00237,"112":0.00474,"113":0.00711,"114":0.02607,"115":0.02844,"116":1.6353,"117":0.29862,"118":0.01896,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0.00237,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0.00474,"24":0.00711,"25":0,"26":0.00711,"27":0.00237,"28":0.00237,"29":0,"30":0.00474,"31":0.00237,"32":0.00711,"33":0.00237,"34":0,"35":0,"36":0,"37":0.19434,"38":0.00237,"39":0,"40":0,"41":0,"42":0.00237,"43":0,"44":0,"45":0.00237,"46":0,"47":0,"48":0,"49":0,"50":0.00711,"51":0.00237,"52":0,"53":0.00474,"54":0,"55":0,"56":0.00237,"57":0.00237,"58":0.00237,"60":0.02844,"62":0,"63":0.06162,"64":0.00474,"65":0.00474,"66":0.02844,"67":0.04503,"68":0.00948,"69":0.26781,"70":0.04029,"71":0.17301,"72":0.22041,"73":0.06636,"74":0,"75":0,"76":0.00237,"77":0.01185,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00237,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00948,"96":0,"97":0,"98":0,"99":0.00237,"100":0,"101":0.06399,"102":0.04977,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00237},B:{"12":0.00948,"13":0.00237,"14":0.00237,"15":0.00474,"16":0,"17":0.00237,"18":0.00711,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00237,"90":0,"91":0,"92":0.00948,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00237,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00237,"110":0.00237,"111":0.02133,"112":0,"113":0.00237,"114":0.01185,"115":0.01422,"116":0.21567,"117":0.16116},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.10665,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00237,"12.1":0,"13.1":0.00474,"14.1":0.00474,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00237,"15.6":0.00474,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0.00237,"16.6":0.00237,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0585,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03687,"10.0-10.2":0,"10.3":0.00886,"11.0-11.2":0.00319,"11.3-11.4":0,"12.0-12.1":0.00745,"12.2-12.5":0.56659,"13.0-13.1":0,"13.2":0.00142,"13.3":0.00248,"13.4-13.7":0.31202,"14.0-14.4":0.12835,"14.5-14.8":0.12055,"15.0-15.1":0.1085,"15.2-15.3":0.02624,"15.4":0.0468,"15.5":0.14289,"15.6-15.7":0.48859,"16.0":0.18827,"16.1":0.31202,"16.2":0.06914,"16.3":0.1514,"16.4":0.0312,"16.5":0.22834,"16.6":0.4464,"17.0":0.05496,"17.1":0},P:{"4":0.41263,"20":0.04126,"21":0.02063,"22":0.35074,"5.0-5.4":0.02063,"6.2-6.4":0.01032,"7.2-7.4":0.10316,"8.2":0.01032,"9.2":0.05158,"10.1":0,"11.1-11.2":0.01032,"12.0":0,"13.0":0.09284,"14.0":0.01032,"15.0":0.02063,"16.0":0.02063,"17.0":0.03095,"18.0":0.03095,"19.0":0.05158},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00377,"4.2-4.3":0.00151,"4.4":0,"4.4.3-4.4.4":0.1279},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00948,"5.5":0},S:{"2.5":0.23653,_:"3.0-3.1"},J:{"7":0,"10":0.34335},N:{"10":0,"11":0},L:{"0":76.55346},R:{_:"0"},M:{"0":0.02289},Q:{"13.1":0},O:{"0":0.25942},H:{"0":10.01912}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BJ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BJ.js
index 725c8c8b211b2c..c4300f69a7c2f9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BJ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BJ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00269,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00269,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00269,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00269,"100":0,"101":0,"102":0.00537,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00269,"111":0,"112":0.00269,"113":0.00269,"114":0.0376,"115":0.07789,"116":0.25517,"117":0.00806,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00269,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00269,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.02955,"62":0,"63":0.00269,"64":0.00269,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.01343,"71":0,"72":0.00269,"73":0,"74":0.0188,"75":0,"76":0.00269,"77":0.00269,"78":0.01343,"79":0.00806,"80":0.00806,"81":0.00806,"83":0,"84":0,"85":0.00537,"86":0.00269,"87":0.03492,"88":0.00269,"89":0.00269,"90":0,"91":0.00269,"92":0.00269,"93":0.01343,"94":0.00806,"95":0.00806,"96":0,"97":0.00269,"98":0.00806,"99":0.04835,"100":0.00537,"101":0,"102":0.00806,"103":0.0188,"104":0.00537,"105":0.01612,"106":0.01074,"107":0.00806,"108":0.02417,"109":0.62852,"110":0.00806,"111":0.00806,"112":0.01612,"113":0.0188,"114":0.1343,"115":1.58743,"116":1.00725,"117":0,"118":0.00269,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00537,"25":0,"26":0.00269,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00269,"38":0,"39":0,"40":0,"41":0,"42":0.00269,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00269,"57":0.00269,"58":0.00537,"60":0.05103,"62":0,"63":0.05372,"64":0.00806,"65":0,"66":0.0188,"67":0.02417,"68":0.00537,"69":0.12087,"70":0.06178,"71":0.16116,"72":0.12893,"73":0,"74":0,"75":0,"76":0,"77":0.00537,"78":0,"79":0.00269,"80":0,"81":0,"82":0.00269,"83":0.00269,"84":0,"85":0.00269,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00806,"96":0,"97":0,"98":0,"99":0.00269,"100":0.04835,"101":0.09401,"102":0.00269,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00269,"11.5":0,"11.6":0,"12.1":0.00269},B:{"12":0,"13":0,"14":0,"15":0.0188,"16":0,"17":0,"18":0.00537,"79":0,"80":0,"81":0,"83":0,"84":0.00269,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00269,"91":0,"92":0.00537,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00269,"101":0,"102":0,"103":0,"104":0.00269,"105":0,"106":0,"107":0.00269,"108":0.00269,"109":0.00806,"110":0.00269,"111":0.00269,"112":0.00269,"113":0.00269,"114":0.02417,"115":0.42707,"116":0.13967},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0.00269,_:"0","3.1":0,"3.2":0,"5.1":0.00537,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00269,"14.1":0.00269,"15.1":0.00269,"15.2-15.3":0,"15.4":0.00269,"15.5":0.00269,"15.6":0.00537,"16.0":0,"16.1":0.00269,"16.2":0.00269,"16.3":0.01612,"16.4":0.00537,"16.5":0.06178,"16.6":0.05103},G:{"8":0.00266,"17":0.10378,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00177,"7.0-7.1":0.02218,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01331,"10.0-10.2":0,"10.3":0.01419,"11.0-11.2":0.00266,"11.3-11.4":0.00177,"12.0-12.1":0.02306,"12.2-12.5":0.84887,"13.0-13.1":0.00355,"13.2":0,"13.3":0.02129,"13.4-13.7":0.20579,"14.0-14.4":0.16676,"14.5-14.8":0.19869,"15.0-15.1":0.14103,"15.2-15.3":0.14103,"15.4":0.14813,"15.5":0.17563,"15.6-15.7":1.27729,"16.0":0.48785,"16.1":0.52511,"16.2":0.17474,"16.3":0.64219,"16.4":0.2324,"16.5":1.4813,"16.6":1.81304},P:{"4":0.01068,"20":0.03204,"21":0.06407,"5.0-5.4":0.01068,"6.2-6.4":0,"7.2-7.4":0.01068,"8.2":0,"9.2":0.05339,"10.1":0,"11.1-11.2":0.01068,"12.0":0,"13.0":0,"14.0":0,"15.0":0.02136,"16.0":0.01068,"17.0":0.01068,"18.0":0.01068,"19.0":0.02136},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00096,"4.2-4.3":0.00797,"4.4":0,"4.4.3-4.4.4":0.10554},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00269,"5.5":0},S:{"2.5":0.07314,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":73.68546},R:{_:"0"},M:{"0":0.08045},Q:{"13.1":0.04388},O:{"0":0.30719},H:{"0":7.81767}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00252,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00252,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00504,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00252,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00252,"111":0,"112":0.00252,"113":0.00252,"114":0.00504,"115":0.04286,"116":0.01765,"117":0.24202,"118":0.02017,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00252,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00252,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00252,"43":0,"44":0,"45":0,"46":0.00252,"47":0,"48":0,"49":0,"50":0.00252,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.02017,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01261,"69":0,"70":0.01513,"71":0,"72":0,"73":0,"74":0.02773,"75":0,"76":0,"77":0,"78":0.00504,"79":0.00756,"80":0.01765,"81":0.01008,"83":0,"84":0.00252,"85":0.00504,"86":0,"87":0.02521,"88":0.02521,"89":0,"90":0.00252,"91":0.00504,"92":0.00252,"93":0.00756,"94":0.00504,"95":0.00504,"96":0,"97":0.00252,"98":0.02521,"99":0.06555,"100":0.00504,"101":0,"102":0.00504,"103":0.01008,"104":0.00252,"105":0.01261,"106":0.00504,"107":0.00252,"108":0.01008,"109":0.42857,"110":0.00252,"111":0.00504,"112":0.01261,"113":0.01261,"114":0.03782,"115":0.05798,"116":1.77478,"117":0.44622,"118":0.00252,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00252,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00252,"33":0,"34":0,"35":0,"36":0,"37":0.00504,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00252,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00252,"57":0.00252,"58":0.00252,"60":0.03277,"62":0,"63":0.11849,"64":0.00756,"65":0,"66":0.01261,"67":0.02521,"68":0.00252,"69":0.07311,"70":0.02521,"71":0.06303,"72":0.16387,"73":0.05294,"74":0,"75":0,"76":0,"77":0.01008,"78":0.00252,"79":0.00504,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00756,"86":0.00252,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01261,"96":0,"97":0,"98":0,"99":0,"100":0.00504,"101":0.05798,"102":0.06807,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00252},B:{"12":0,"13":0,"14":0,"15":0.01008,"16":0,"17":0,"18":0.00252,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00252,"91":0,"92":0.00504,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00252,"108":0,"109":0.00504,"110":0.00252,"111":0,"112":0.00252,"113":0,"114":0.00504,"115":0.01261,"116":0.26723,"117":0.18151},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00252,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00252,"14.1":0.00252,"15.1":0.00252,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00504,"16.0":0,"16.1":0.00252,"16.2":0.00504,"16.3":0.00504,"16.4":0.00252,"16.5":0.03277,"16.6":0.08319,"17.0":0.00252,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00433,"6.0-6.1":0.00692,"7.0-7.1":0.00952,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00519,"10.0-10.2":0,"10.3":0.00606,"11.0-11.2":0.00346,"11.3-11.4":0.00433,"12.0-12.1":0.00779,"12.2-12.5":0.64448,"13.0-13.1":0.00519,"13.2":0,"13.3":0.03893,"13.4-13.7":0.06228,"14.0-14.4":0.39188,"14.5-14.8":0.14101,"15.0-15.1":0.21194,"15.2-15.3":0.12543,"15.4":0.0744,"15.5":0.28115,"15.6-15.7":1.03203,"16.0":0.45849,"16.1":0.468,"16.2":0.14706,"16.3":0.42907,"16.4":0.09775,"16.5":0.95504,"16.6":2.63933,"17.0":0.30796,"17.1":0},P:{"4":0.20677,"20":0.03102,"21":0.03102,"22":0.28948,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01034,"8.2":0,"9.2":0.01034,"10.1":0,"11.1-11.2":0.01034,"12.0":0,"13.0":0,"14.0":0,"15.0":0.02068,"16.0":0.01034,"17.0":0.03102,"18.0":0.01034,"19.0":0.04135},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00381,"4.2-4.3":0.01088,"4.4":0,"4.4.3-4.4.4":0.19909},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00504,"5.5":0},S:{"2.5":0.09723,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":78.22363},R:{_:"0"},M:{"0":0.05983},Q:{"13.1":0.01496},O:{"0":0.3216},H:{"0":5.26799}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BM.js
index 33b1ad388b4dd7..103e43081de8eb 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01151,"116":0.01841,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.01841,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0.0023,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0023,"100":0,"101":0,"102":0,"103":0.0023,"104":0,"105":0,"106":0,"107":0.0023,"108":0,"109":0.02071,"110":0,"111":0,"112":0.0023,"113":0.0023,"114":0.04372,"115":0.29683,"116":0.15187,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.03221,"101":0.0023,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.0046,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.03221,"115":0.15187,"116":0.04372},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0046,"15":0,"17":0.05062,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0069,"14.1":0.03452,"15.1":0.01381,"15.2-15.3":0.01611,"15.4":0.02761,"15.5":0.06903,"15.6":0.43949,"16.0":0.01381,"16.1":0.10585,"16.2":0.12425,"16.3":0.34285,"16.4":0.11965,"16.5":1.00324,"16.6":1.91673},G:{"8":0,"17":0.59684,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05509,"10.0-10.2":0,"10.3":0.02755,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.03673,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.01836,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0.06427,"15.2-15.3":0.18364,"15.4":0.33056,"15.5":0.73457,"15.6-15.7":5.2889,"16.0":2.52508,"16.1":6.05102,"16.2":3.04846,"16.3":5.546,"16.4":1.04676,"16.5":18.62134,"16.6":47.61847},P:{"4":0.01061,"20":0,"21":0.07425,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.01841},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":2.2553},R:{_:"0"},M:{"0":0.0385},Q:{"13.1":0},O:{"0":0.0231},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.00485,"116":0.00243,"117":0.01456,"118":0.00243,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0.00243,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00485,"104":0,"105":0,"106":0,"107":0.00485,"108":0,"109":0.02183,"110":0,"111":0.00243,"112":0.00243,"113":0.00243,"114":0.0097,"115":0.05822,"116":0.45124,"117":0.1116,"118":0.00243,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00243,"101":0.01456,"102":0.00485,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01213,"110":0,"111":0,"112":0,"113":0,"114":0.00243,"115":0.02426,"116":0.12373,"117":0.09947},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00243,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0097,"14.1":0.03639,"15.1":0.01941,"15.2-15.3":0.02426,"15.4":0.02669,"15.5":0.08734,"15.6":0.45851,"16.0":0.01698,"16.1":0.10674,"16.2":0.1213,"16.3":0.29112,"16.4":0.09704,"16.5":0.30082,"16.6":2.97428,"17.0":0.14313,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00922,"10.0-10.2":0,"10.3":0.02766,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.03688,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.00922,"14.0-14.4":0.00922,"14.5-14.8":0,"15.0-15.1":0.10142,"15.2-15.3":0.12908,"15.4":0.22128,"15.5":0.66384,"15.6-15.7":4.86816,"16.0":3.28232,"16.1":5.03412,"16.2":2.38798,"16.3":4.0107,"16.4":0.6915,"16.5":2.0284,"16.6":63.17546,"17.0":4.49014,"17.1":0.01844},P:{"4":0.01094,"20":0,"21":0.01094,"22":0.47043,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.02426},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":2.26379},R:{_:"0"},M:{"0":0.0303},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BN.js
index 005829ac274dac..87117c10680a9b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0.00458,"4":0.00458,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0.00458,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00458,"32":0,"33":0,"34":0.00458,"35":0.00458,"36":0.00458,"37":0,"38":0.00458,"39":0.00458,"40":0.01374,"41":0,"42":0,"43":0,"44":0.00458,"45":0,"46":0,"47":0,"48":0.00458,"49":0,"50":0,"51":0,"52":0.00458,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00458,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01832,"79":0,"80":0,"81":0,"82":0.00458,"83":0,"84":0.00916,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00458,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00458,"113":0.0229,"114":0.00458,"115":0.3893,"116":0.74196,"117":0.01832,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00916},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00458,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0.00458,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00458,"32":0,"33":0.00458,"34":0.00458,"35":0,"36":0.00458,"37":0.00458,"38":0.05038,"39":0.00916,"40":0.00916,"41":0.00916,"42":0.00458,"43":0.01832,"44":0.0229,"45":0.01832,"46":0.01832,"47":0.01374,"48":0,"49":0.24274,"50":0,"51":0.01374,"52":0,"53":0.00458,"54":0,"55":0.03206,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.0229,"63":0,"64":0,"65":0.00458,"66":0.00458,"67":0,"68":0,"69":0,"70":0.00916,"71":0,"72":0,"73":0.00458,"74":0,"75":0.00458,"76":0,"77":0,"78":0,"79":0.10534,"80":0,"81":0.30228,"83":0.00458,"84":0,"85":0.00916,"86":0,"87":0.0229,"88":0.00458,"89":0.00458,"90":0,"91":0.01374,"92":0.01832,"93":0,"94":0.00458,"95":0.00916,"96":0,"97":0,"98":0.00916,"99":0.02748,"100":0.01374,"101":0,"102":0,"103":0.07786,"104":0.00916,"105":0.00458,"106":0.01374,"107":0.00916,"108":0.01374,"109":1.16332,"110":0.00458,"111":0.00916,"112":0.02748,"113":0.05954,"114":0.32976,"115":6.58604,"116":3.8243,"117":0.01374,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00916,"29":0,"30":0.00458,"31":0.00458,"32":0,"33":0,"34":0,"35":0,"36":0.00458,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00458,"55":0,"56":0,"57":0,"58":0,"60":0.00458,"62":0,"63":0.00458,"64":0.00458,"65":0,"66":0,"67":0,"68":0.00458,"69":0.00916,"70":0.0229,"71":0.14198,"72":0.12824,"73":0,"74":0.00458,"75":0,"76":0.00458,"77":0.00458,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03664,"96":0.00458,"97":0,"98":0,"99":0.00458,"100":0.42594,"101":0.2061,"102":0.00458,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00458},B:{"12":0.00916,"13":0,"14":0.01374,"15":0,"16":0,"17":0,"18":0.00458,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00458,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00458,"108":0,"109":0.01374,"110":0,"111":0.00916,"112":0.00458,"113":0.0687,"114":0.09618,"115":0.99844,"116":0.29312},E:{"4":0,"5":0.00458,"6":0,"7":0,"8":0.00458,"9":0.03206,"10":0,"11":0.00458,"12":0.00458,"13":0.0229,"14":0.05038,"15":0.02748,"17":0.0229,_:"0","3.1":0,"3.2":0,"5.1":0.00458,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.0229,"13.1":0.02748,"14.1":0.16488,"15.1":0.01832,"15.2-15.3":0.01374,"15.4":0.05954,"15.5":0.03206,"15.6":0.21068,"16.0":0.02748,"16.1":0.06412,"16.2":0.05038,"16.3":0.16946,"16.4":0.05496,"16.5":0.50838,"16.6":0.86104},G:{"8":0.00622,"17":0.09743,"3.2":0.00415,"4.0-4.1":0,"4.2-4.3":0.00415,"5.0-5.1":0.00829,"6.0-6.1":0.01036,"7.0-7.1":0.07255,"8.1-8.4":0.1223,"9.0-9.2":0.01244,"9.3":0.21144,"10.0-10.2":0,"10.3":0.64468,"11.0-11.2":0.15754,"11.3-11.4":0.00415,"12.0-12.1":0.24668,"12.2-12.5":0.53274,"13.0-13.1":0.04353,"13.2":0.00415,"13.3":0.00622,"13.4-13.7":0.01451,"14.0-14.4":0.1762,"14.5-14.8":0.24253,"15.0-15.1":0.0995,"15.2-15.3":0.13267,"15.4":0.23838,"15.5":0.13059,"15.6-15.7":1.51115,"16.0":0.85819,"16.1":0.9411,"16.2":0.36898,"16.3":1.09864,"16.4":0.24875,"16.5":4.30959,"16.6":8.15484},P:{"4":0.67386,"20":0.03159,"21":0.10529,"5.0-5.4":0.04212,"6.2-6.4":0.03159,"7.2-7.4":0.08423,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01053,"12.0":0,"13.0":0.03159,"14.0":0,"15.0":0,"16.0":0.04212,"17.0":0.02106,"18.0":0.01053,"19.0":0.04212},I:{"0":0,"3":0.01507,"4":0.07537,"2.1":0.01256,"2.2":0.04271,"2.3":0.05276,"4.1":0.05778,"4.2-4.3":0.103,"4.4":0,"4.4.3-4.4.4":0.25373},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00474,"7":0.01422,"8":0.11852,"9":0.0237,"10":0.01896,"11":0.08533,"5.5":0},S:{"2.5":0.01084,_:"3.0-3.1"},J:{"7":0,"10":0.02168},N:{"10":0.04228,"11":0.02818},L:{"0":49.4819},R:{_:"0"},M:{"0":0.20054},Q:{"13.1":0},O:{"0":1.65852},H:{"0":1.73438}};
+module.exports={C:{"2":0,"3":0.00444,"4":0.00444,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00444,"32":0,"33":0,"34":0.00444,"35":0.00444,"36":0.00444,"37":0.00444,"38":0.00444,"39":0.00444,"40":0.00889,"41":0.00444,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00444,"49":0,"50":0,"51":0,"52":0.00444,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01777,"79":0,"80":0.00444,"81":0,"82":0.00444,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00444,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00444,"113":0.00444,"114":0.00444,"115":0.20882,"116":0.04887,"117":0.75531,"118":0.05332,"119":0,"120":0,"3.5":0.00444,"3.6":0.00889},D:{"4":0,"5":0,"6":0,"7":0.00444,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0.00444,"20":0,"21":0.00444,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00444,"31":0.00889,"32":0,"33":0.00444,"34":0,"35":0.00444,"36":0.00444,"37":0.00444,"38":0.0311,"39":0.00444,"40":0.00444,"41":0.00889,"42":0.00444,"43":0.01333,"44":0.02222,"45":0.01333,"46":0.01333,"47":0.01777,"48":0,"49":0.23104,"50":0,"51":0.01333,"52":0,"53":0,"54":0,"55":0.02222,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.01333,"63":0,"64":0,"65":0.00889,"66":0,"67":0,"68":0.00444,"69":0,"70":0.01777,"71":0,"72":0,"73":0.00444,"74":0,"75":0.00444,"76":0,"77":0,"78":0,"79":0.09775,"80":0.00444,"81":0.0622,"83":0.00444,"84":0,"85":0.00889,"86":0,"87":0.00889,"88":0.01333,"89":0.01333,"90":0,"91":0.0311,"92":0.01333,"93":0,"94":0,"95":0.00444,"96":0.00444,"97":0.00444,"98":0.00889,"99":0.0311,"100":0.01777,"101":0,"102":0,"103":0.05776,"104":0.02222,"105":0,"106":0.01333,"107":0.00444,"108":0.00889,"109":0.97746,"110":0.00444,"111":0.00889,"112":0.02222,"113":0.04443,"114":0.09775,"115":0.17328,"116":8.2862,"117":1.92382,"118":0.01333,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00444,"29":0,"30":0.00444,"31":0.00444,"32":0,"33":0.00444,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00444,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00444,"62":0,"63":0.00444,"64":0,"65":0,"66":0,"67":0.00444,"68":0,"69":0.00444,"70":0.0311,"71":0.00889,"72":0.24881,"73":0.07553,"74":0.00444,"75":0,"76":0,"77":0.05332,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0311,"96":0,"97":0,"98":0,"99":0,"100":0.09775,"101":0.17328,"102":0.17328,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00444},B:{"12":0.00444,"13":0,"14":0.00889,"15":0,"16":0,"17":0,"18":0.00444,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00444,"105":0,"106":0,"107":0,"108":0.00444,"109":0.00889,"110":0,"111":0.00444,"112":0,"113":0.0622,"114":0.00444,"115":0.03554,"116":0.81307,"117":0.5376},E:{"4":0,"5":0.00444,"6":0,"7":0,"8":0,"9":0.0311,"10":0,"11":0,"12":0,"13":0.02666,"14":0.08886,"15":0.02666,_:"0","3.1":0,"3.2":0,"5.1":0.00444,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00444,"13.1":0.01777,"14.1":0.12885,"15.1":0.02222,"15.2-15.3":0.00889,"15.4":0.04887,"15.5":0.02222,"15.6":0.23992,"16.0":0.02222,"16.1":0.05332,"16.2":0.02666,"16.3":0.12885,"16.4":0.0311,"16.5":0.11552,"16.6":1.29291,"17.0":0.08886,"17.1":0},G:{"8":0.00712,"3.2":0.00237,"4.0-4.1":0,"4.2-4.3":0.01423,"5.0-5.1":0.00474,"6.0-6.1":0.01898,"7.0-7.1":0.09015,"8.1-8.4":0.09252,"9.0-9.2":0.00712,"9.3":0.18741,"10.0-10.2":0.08303,"10.3":0.65477,"11.0-11.2":0.14471,"11.3-11.4":0,"12.0-12.1":0.18267,"12.2-12.5":0.69035,"13.0-13.1":0.01423,"13.2":0.00237,"13.3":0.00474,"13.4-13.7":0.01898,"14.0-14.4":0.18741,"14.5-14.8":0.22063,"15.0-15.1":0.15183,"15.2-15.3":0.14708,"15.4":0.11862,"15.5":0.14708,"15.6-15.7":1.77214,"16.0":0.97266,"16.1":0.9181,"16.2":0.39618,"16.3":1.27395,"16.4":0.25384,"16.5":1.09365,"16.6":12.18196,"17.0":1.35461,"17.1":0},P:{"4":0.59281,"20":0.02117,"21":0.08469,"22":1.59846,"5.0-5.4":0.02117,"6.2-6.4":0.02117,"7.2-7.4":0.06352,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01059,"12.0":0.01059,"13.0":0.05293,"14.0":0,"15.0":0,"16.0":0.02117,"17.0":0.01059,"18.0":0.01059,"19.0":0.03176},I:{"0":0,"3":0.01508,"4":0.05782,"2.1":0.01006,"2.2":0.03519,"2.3":0.03771,"4.1":0.04022,"4.2-4.3":0.08547,"4.4":0,"4.4.3-4.4.4":0.22625},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00452,"7":0.01357,"8":0.11309,"9":0.02262,"10":0.02262,"11":0.06786,"5.5":0},S:{"2.5":0.01111,_:"3.0-3.1"},J:{"7":0,"10":0.01667},N:{"10":0.03668,"11":0.02445},L:{"0":47.77495},R:{_:"0"},M:{"0":0.23339},Q:{"13.1":0.00556},O:{"0":1.91717},H:{"0":1.72035}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BO.js
index 2a754762c6ec5d..787c215393bba3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00449,"40":0.00449,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.04039,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00449,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00449,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01346,"79":0.00449,"80":0,"81":0,"82":0,"83":0.00449,"84":0,"85":0,"86":0,"87":0,"88":0.00449,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00449,"100":0,"101":0,"102":0.00898,"103":0.00449,"104":0.00449,"105":0,"106":0.00449,"107":0.00449,"108":0.00449,"109":0.00449,"110":0.00449,"111":0.00898,"112":0.00898,"113":0.01346,"114":0.02244,"115":0.49368,"116":0.8976,"117":0.04488,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00449},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00449,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00898,"39":0.00449,"40":0.00449,"41":0.00449,"42":0.00449,"43":0.00449,"44":0.00898,"45":0.00898,"46":0.00449,"47":0.00449,"48":0,"49":0.00898,"50":0,"51":0.00449,"52":0,"53":0.00449,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00449,"61":0,"62":0.00449,"63":0,"64":0,"65":0,"66":0,"67":0.00449,"68":0.01795,"69":0.00449,"70":0.01346,"71":0,"72":0.00449,"73":0.00449,"74":0.00449,"75":0.00449,"76":0,"77":0.00449,"78":0.00449,"79":0.08527,"80":0.00449,"81":0.00898,"83":0.00898,"84":0.00449,"85":0.00449,"86":0.00449,"87":0.02244,"88":0.00898,"89":0.00898,"90":0.00898,"91":0.10322,"92":0.00898,"93":0.00449,"94":0.00449,"95":0.00449,"96":0.00898,"97":0.01346,"98":0.00449,"99":0.02693,"100":0.00898,"101":0.00898,"102":0.01795,"103":0.03142,"104":0.00898,"105":0.01346,"106":0.02244,"107":0.02244,"108":0.03142,"109":1.82662,"110":0.02693,"111":0.02693,"112":0.05386,"113":0.08078,"114":0.65525,"115":6.48516,"116":4.48351,"117":0.00449,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01346,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00449,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00449,"70":0.00449,"71":0.01346,"72":0.01795,"73":0,"74":0.00449,"75":0,"76":0.00449,"77":0.00449,"78":0,"79":0.00449,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.05834,"96":0,"97":0,"98":0.00449,"99":0.00898,"100":0.60139,"101":0.33211,"102":0.00449,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00449,"13":0.00449,"14":0.00449,"15":0,"16":0,"17":0,"18":0.00898,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00898,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00898,"108":0,"109":0.01795,"110":0,"111":0.00449,"112":0.00449,"113":0.00449,"114":0.0359,"115":0.75847,"116":0.31416},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00449,"10":0,"11":0,"12":0,"13":0,"14":0.00449,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00449,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00898,"14.1":0.01795,"15.1":0,"15.2-15.3":0,"15.4":0.00449,"15.5":0.00449,"15.6":0.02244,"16.0":0.00449,"16.1":0.00449,"16.2":0.00898,"16.3":0.02244,"16.4":0.01346,"16.5":0.06283,"16.6":0.07181},G:{"8":0.00085,"17":0.06651,"3.2":0.00128,"4.0-4.1":0,"4.2-4.3":0.00171,"5.0-5.1":0.01066,"6.0-6.1":0.00341,"7.0-7.1":0.02729,"8.1-8.4":0.02217,"9.0-9.2":0.00554,"9.3":0.01663,"10.0-10.2":0,"10.3":0.01066,"11.0-11.2":0.0405,"11.3-11.4":0.00085,"12.0-12.1":0.00938,"12.2-12.5":0.14368,"13.0-13.1":0.00682,"13.2":0.00085,"13.3":0.00341,"13.4-13.7":0.01279,"14.0-14.4":0.02856,"14.5-14.8":0.04093,"15.0-15.1":0.01407,"15.2-15.3":0.04775,"15.4":0.01705,"15.5":0.04988,"15.6-15.7":0.38797,"16.0":0.11938,"16.1":0.43188,"16.2":0.1036,"16.3":0.22724,"16.4":0.05244,"16.5":0.7073,"16.6":1.64824},P:{"4":0.35502,"20":0.13186,"21":0.32459,"5.0-5.4":0.01014,"6.2-6.4":0.01014,"7.2-7.4":0.29416,"8.2":0.01014,"9.2":0.02029,"10.1":0,"11.1-11.2":0.05072,"12.0":0.01014,"13.0":0.05072,"14.0":0.03043,"15.0":0.02029,"16.0":0.06086,"17.0":0.13186,"18.0":0.05072,"19.0":0.09129},I:{"0":0,"3":0,"4":0.01895,"2.1":0,"2.2":0.02274,"2.3":0.01137,"4.1":0.01895,"4.2-4.3":0.04168,"4.4":0,"4.4.3-4.4.4":0.18568},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00472,"8":0.03779,"9":0.00945,"10":0.00472,"11":0.03307,"5.5":0},S:{"2.5":0.00551,_:"3.0-3.1"},J:{"7":0,"10":0.00551},N:{"10":0.00827,"11":0.00827},L:{"0":70.22675},R:{_:"0"},M:{"0":0.16536},Q:{"13.1":0},O:{"0":0.22048},H:{"0":0.43835}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00473,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.06615,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.01418,"59":0,"60":0.00473,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00473,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00945,"79":0,"80":0,"81":0,"82":0,"83":0.00473,"84":0,"85":0,"86":0,"87":0,"88":0.00473,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00473,"100":0.00473,"101":0,"102":0.00473,"103":0,"104":0,"105":0.00473,"106":0.00473,"107":0,"108":0.00473,"109":0,"110":0.00473,"111":0.00473,"112":0.00473,"113":0.02363,"114":0.00945,"115":0.27405,"116":0.06615,"117":0.78908,"118":0.09923,"119":0,"120":0,"3.5":0,"3.6":0.00473},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.0189,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00945,"39":0.00473,"40":0,"41":0.00473,"42":0,"43":0.00473,"44":0.00473,"45":0.00473,"46":0.00473,"47":0.00473,"48":0,"49":0.0189,"50":0,"51":0.00473,"52":0,"53":0.00473,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00473,"61":0,"62":0.00473,"63":0,"64":0,"65":0,"66":0,"67":0.00473,"68":0.00945,"69":0.00473,"70":0.00945,"71":0,"72":0,"73":0,"74":0.00473,"75":0.00473,"76":0,"77":0,"78":0.00473,"79":0.08978,"80":0.00473,"81":0.0378,"83":0.02835,"84":0,"85":0.01418,"86":0.00473,"87":0.02363,"88":0.00945,"89":0.00473,"90":0.01418,"91":0.1134,"92":0.00473,"93":0.00473,"94":0.00473,"95":0.00473,"96":0.00473,"97":0.02363,"98":0.00473,"99":0.00945,"100":0.00473,"101":0.00945,"102":0.02363,"103":0.0378,"104":0.01418,"105":0.01418,"106":0.0189,"107":0.0189,"108":0.03308,"109":1.89945,"110":0.05198,"111":0.02835,"112":0.03308,"113":0.07088,"114":0.42053,"115":0.15593,"116":10.4706,"117":2.40975,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01418,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00473,"71":0.00473,"72":0.04253,"73":0.01418,"74":0.00473,"75":0,"76":0,"77":0.02363,"78":0,"79":0.00473,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0567,"96":0,"97":0,"98":0,"99":0.00473,"100":0.16538,"101":0.36855,"102":0.37328,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00473},B:{"12":0.00473,"13":0,"14":0.00473,"15":0,"16":0,"17":0,"18":0.00473,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.02363,"89":0,"90":0,"91":0,"92":0.01418,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00473,"108":0,"109":0.02363,"110":0.00473,"111":0,"112":0,"113":0.00473,"114":0.00945,"115":0.02835,"116":0.66623,"117":0.54338},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00473,"10":0,"11":0,"12":0,"13":0,"14":0.00473,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00473,"6.1":0,"7.1":0,"9.1":0.00473,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01418,"14.1":0.00945,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00473,"15.6":0.0189,"16.0":0,"16.1":0.00473,"16.2":0.00473,"16.3":0.0189,"16.4":0.00473,"16.5":0.02363,"16.6":0.09923,"17.0":0.01418,"17.1":0},G:{"8":0.00149,"3.2":0.0005,"4.0-4.1":0,"4.2-4.3":0.00149,"5.0-5.1":0.00647,"6.0-6.1":0.00348,"7.0-7.1":0.02138,"8.1-8.4":0.02188,"9.0-9.2":0.00696,"9.3":0.0194,"10.0-10.2":0,"10.3":0.0184,"11.0-11.2":0.08454,"11.3-11.4":0.00298,"12.0-12.1":0.02039,"12.2-12.5":0.1671,"13.0-13.1":0.00298,"13.2":0.00298,"13.3":0.03083,"13.4-13.7":0.01343,"14.0-14.4":0.03083,"14.5-14.8":0.04973,"15.0-15.1":0.00995,"15.2-15.3":0.01442,"15.4":0.03083,"15.5":0.04526,"15.6-15.7":0.4446,"16.0":0.11041,"16.1":0.45107,"16.2":0.10543,"16.3":0.18799,"16.4":0.04575,"16.5":0.10792,"16.6":2.49854,"17.0":0.34116,"17.1":0},P:{"4":0.28432,"20":0.10154,"21":0.18278,"22":1.83794,"5.0-5.4":0.01015,"6.2-6.4":0.01015,"7.2-7.4":0.27417,"8.2":0,"9.2":0.02031,"10.1":0,"11.1-11.2":0.03046,"12.0":0.01015,"13.0":0.05077,"14.0":0.05077,"15.0":0.01015,"16.0":0.06093,"17.0":0.09139,"18.0":0.04062,"19.0":0.08124},I:{"0":0,"3":0,"4":0.01758,"2.1":0,"2.2":0.01055,"2.3":0.01407,"4.1":0.0211,"4.2-4.3":0.05626,"4.4":0,"4.4.3-4.4.4":0.16879},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00473,"8":0.0378,"9":0.00473,"10":0.00945,"11":0.0378,"5.5":0},S:{"2.5":0.00528,_:"3.0-3.1"},J:{"7":0,"10":0.01055},N:{"10":0.01583,"11":0},L:{"0":67.9195},R:{_:"0"},M:{"0":0.15298},Q:{"13.1":0},O:{"0":0.1899},H:{"0":0.45945}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BR.js
index 97dd2feeb7bddb..6e84fd13d6032c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0.05312,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.03542,"43":0,"44":0,"45":0.03542,"46":0,"47":0,"48":0,"49":0,"50":0.10625,"51":0,"52":0.1151,"53":0,"54":0.12396,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00443,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00443,"76":0,"77":0,"78":0.00443,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00443,"88":0.00443,"89":0,"90":0,"91":0.00443,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02656,"103":0,"104":0.00443,"105":0.00443,"106":0,"107":0.00443,"108":0.00443,"109":0.00443,"110":0.00443,"111":0.00443,"112":0.00443,"113":0.00885,"114":0.01771,"115":0.19479,"116":0.46041,"117":0.01771,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00443,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.05312,"48":0,"49":0.00443,"50":0,"51":0.00443,"52":0,"53":0,"54":0,"55":0.05755,"56":0,"57":0.12396,"58":0,"59":0,"60":0.34973,"61":0,"62":0,"63":0.00443,"64":0,"65":0,"66":0.00443,"67":0,"68":0.00443,"69":0.00443,"70":0.00443,"71":0.00443,"72":0.00443,"73":0,"74":0.00443,"75":0.00885,"76":0.00443,"77":0.00885,"78":0.00443,"79":0.05312,"80":0.00885,"81":0.02214,"83":0.00443,"84":0.00443,"85":0.01771,"86":0.00885,"87":0.02656,"88":0.00885,"89":0.00443,"90":0.00885,"91":0.38072,"92":0.00885,"93":0.00443,"94":0.00443,"95":0.00443,"96":0.00443,"97":0.00443,"98":0.00443,"99":0.00443,"100":0.00885,"101":0.00443,"102":0.00885,"103":0.04427,"104":0.00885,"105":0.01771,"106":0.02214,"107":0.03984,"108":0.03542,"109":1.14659,"110":0.02656,"111":0.03984,"112":0.05312,"113":0.0487,"114":0.34973,"115":6.25978,"116":3.71425,"117":0.00885,"118":0.00443,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00443,"72":0.00443,"73":0,"74":0,"75":0,"76":0,"77":0.00443,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03542,"96":0,"97":0,"98":0,"99":0.01328,"100":1.36352,"101":0.45598,"102":0.00443,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.05755,"13":0.1151,"14":0.1151,"15":0.08411,"16":0,"17":0,"18":0.00443,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00885,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00443,"108":0.00443,"109":0.03099,"110":0.00443,"111":0.00443,"112":0.00443,"113":0.00443,"114":0.07969,"115":1.1643,"116":0.42057},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00443,"15":0,"17":0.00443,_:"0","3.1":0,"3.2":0,"5.1":0.01771,"6.1":0,"7.1":0,"9.1":0.01328,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00885,"14.1":0.00885,"15.1":0,"15.2-15.3":0,"15.4":0.00443,"15.5":0.00443,"15.6":0.02656,"16.0":0.00443,"16.1":0.00885,"16.2":0.00885,"16.3":0.01771,"16.4":0.00885,"16.5":0.06198,"16.6":0.07083},G:{"8":0.00128,"17":0.08594,"3.2":0.00257,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00385,"6.0-6.1":0,"7.0-7.1":0.00385,"8.1-8.4":0.00385,"9.0-9.2":0.0077,"9.3":0.03078,"10.0-10.2":0.00898,"10.3":0.03207,"11.0-11.2":0.02052,"11.3-11.4":0.03207,"12.0-12.1":0.01667,"12.2-12.5":0.14365,"13.0-13.1":0.00898,"13.2":0.00641,"13.3":0.01154,"13.4-13.7":0.02822,"14.0-14.4":0.05772,"14.5-14.8":0.1552,"15.0-15.1":0.02822,"15.2-15.3":0.03976,"15.4":0.05387,"15.5":0.07952,"15.6-15.7":1.27236,"16.0":0.43481,"16.1":0.74136,"16.2":0.32835,"16.3":0.77983,"16.4":0.11672,"16.5":2.30744,"16.6":5.97702},P:{"4":0.13118,"20":0.07063,"21":0.14127,"22":1.84656,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.25226,"8.2":0,"9.2":0.01009,"10.1":0,"11.1-11.2":0.02018,"12.0":0.01009,"13.0":0.01009,"14.0":0.01009,"15.0":0.01009,"16.0":0.02018,"17.0":0.07063,"18.0":0.01009,"19.0":0.05045},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01443,"4.2-4.3":0.00721,"4.4":0,"4.4.3-4.4.4":0.06492},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00448,"9":0.11658,"10":0,"11":0.22867,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":62.13503},R:{_:"0"},M:{"0":0.12261},Q:{"13.1":0},O:{"0":0.09474},H:{"0":0.28491}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0.07016,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.04677,"43":0,"44":0,"45":0.03274,"46":0,"47":0,"48":0,"49":0,"50":0.14031,"51":0,"52":0.14499,"53":0,"54":0.15434,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00468,"69":0,"70":0.00468,"71":0,"72":0,"73":0,"74":0,"75":0.00468,"76":0,"77":0,"78":0.00468,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00468,"88":0.00468,"89":0.00468,"90":0.00468,"91":0.00935,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02339,"103":0,"104":0.00468,"105":0.00468,"106":0.00468,"107":0.00468,"108":0.00468,"109":0.00468,"110":0.00468,"111":0.00468,"112":0.00468,"113":0.00935,"114":0.00468,"115":0.11225,"116":0.03742,"117":0.5285,"118":0.0608,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.06548,"48":0,"49":0.00468,"50":0,"51":0.00468,"52":0,"53":0,"54":0,"55":0.07483,"56":0,"57":0.15434,"58":0,"59":0,"60":0.44899,"61":0,"62":0,"63":0.00468,"64":0,"65":0,"66":0,"67":0,"68":0.00468,"69":0,"70":0.00468,"71":0.00468,"72":0.00468,"73":0,"74":0.00468,"75":0.00935,"76":0.00935,"77":0.01403,"78":0.00468,"79":0.05145,"80":0.01403,"81":0.02806,"83":0.00935,"84":0.00468,"85":0.01403,"86":0.01403,"87":0.03274,"88":0.00935,"89":0.00935,"90":0.02339,"91":0.45367,"92":0.01871,"93":0.00468,"94":0.00468,"95":0.00468,"96":0.00468,"97":0.00935,"98":0.00468,"99":0.00935,"100":0.01403,"101":0.00468,"102":0.02806,"103":0.03742,"104":0.00935,"105":0.01871,"106":0.02806,"107":0.05145,"108":0.04677,"109":1.15054,"110":0.02806,"111":0.03742,"112":0.04677,"113":0.05145,"114":0.09822,"115":0.16837,"116":8.18475,"117":2.9699,"118":0.01403,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00468,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0.00468,"66":0,"67":0,"68":0,"69":0,"70":0.00468,"71":0,"72":0.00935,"73":0,"74":0,"75":0,"76":0,"77":0.02339,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00468,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00468,"95":0.03742,"96":0,"97":0,"98":0,"99":0.00468,"100":0.30401,"101":0.58463,"102":0.92605,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.07016,"13":0.14499,"14":0.14499,"15":0.09822,"16":0,"17":0,"18":0.00468,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00468,"91":0,"92":0.00935,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00468,"107":0.00468,"108":0.00468,"109":0.03274,"110":0.00468,"111":0.00468,"112":0.00468,"113":0.00468,"114":0.02339,"115":0.02339,"116":0.86057,"117":0.91669},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00468,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01403,"6.1":0,"7.1":0,"9.1":0.00935,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00935,"14.1":0.01403,"15.1":0,"15.2-15.3":0,"15.4":0.00468,"15.5":0.00468,"15.6":0.02806,"16.0":0.00468,"16.1":0.00935,"16.2":0.00468,"16.3":0.01871,"16.4":0.00935,"16.5":0.02806,"16.6":0.12628,"17.0":0.01403,"17.1":0},G:{"8":0,"3.2":0.00257,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00128,"9.3":0.02181,"10.0-10.2":0,"10.3":0.0231,"11.0-11.2":0.05774,"11.3-11.4":0.02695,"12.0-12.1":0.04234,"12.2-12.5":0.10907,"13.0-13.1":0.00385,"13.2":0.00257,"13.3":0.39392,"13.4-13.7":0.02053,"14.0-14.4":0.04876,"14.5-14.8":0.13473,"15.0-15.1":0.02695,"15.2-15.3":0.03336,"15.4":0.04491,"15.5":0.07057,"15.6-15.7":1.15097,"16.0":0.36441,"16.1":0.61462,"16.2":0.26689,"16.3":0.5787,"16.4":0.07955,"16.5":0.27331,"16.6":7.32672,"17.0":0.88152,"17.1":0.00257},P:{"4":0.09252,"20":0.04112,"21":0.08224,"22":1.82992,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.17477,"8.2":0,"9.2":0.01028,"10.1":0,"11.1-11.2":0.02056,"12.0":0,"13.0":0.01028,"14.0":0.01028,"15.0":0.01028,"16.0":0.02056,"17.0":0.0514,"18.0":0.01028,"19.0":0.03084},I:{"0":0,"3":0,"4":0.03235,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02773,"4.4":0,"4.4.3-4.4.4":0.07395},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00472,"9":0.15584,"10":0,"11":0.32585,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":60.97009},R:{_:"0"},M:{"0":0.12775},Q:{"13.1":0},O:{"0":0.07985},H:{"0":0.28725}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BS.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BS.js
index 97f956c84b8ef5..9399ff500476c6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BS.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BS.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00411,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00411,"40":0.00411,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.02466,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00411,"76":0,"77":0,"78":0.00411,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.03288,"92":0,"93":0,"94":0,"95":0.05343,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02055,"103":0,"104":0.00411,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00411,"111":0,"112":0,"113":0,"114":0.04521,"115":0.12741,"116":0.34113,"117":0.01233,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00411},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00411,"40":0.00411,"41":0.00411,"42":0.00411,"43":0.00822,"44":0.01233,"45":0.00822,"46":0.00411,"47":0.00411,"48":0,"49":0.04521,"50":0,"51":0.00411,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00411,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00411,"70":0.00411,"71":0.00411,"72":0,"73":0,"74":0,"75":0.00411,"76":0.06576,"77":0,"78":0.00411,"79":0.00411,"80":0,"81":0.00411,"83":0.01644,"84":0,"85":0.00822,"86":0.00822,"87":0.01233,"88":0.00411,"89":0,"90":0.01233,"91":0.00411,"92":0,"93":0.09042,"94":0.00822,"95":0.00411,"96":0,"97":0.00411,"98":0.00411,"99":0,"100":0,"101":0,"102":0.00822,"103":0.1233,"104":0.00411,"105":0,"106":0.00411,"107":0.01233,"108":0.00822,"109":0.43977,"110":0.00822,"111":0.02055,"112":0.02466,"113":0.04932,"114":0.50553,"115":4.32372,"116":2.14542,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00411,"70":0,"71":0.00411,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00411,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00411,"96":0,"97":0,"98":0,"99":0.00411,"100":0.04521,"101":0.05343,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00411},B:{"12":0.00411,"13":0,"14":0.00411,"15":0.00411,"16":0,"17":0.00411,"18":0.00411,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00411,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00411,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00411,"108":0,"109":0.02055,"110":0,"111":0.00411,"112":0.00411,"113":0.02466,"114":0.12741,"115":2.29749,"116":0.69459},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01233,"10":0,"11":0,"12":0,"13":0.00411,"14":0.01644,"15":0.00411,"17":0.01644,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00411,"12.1":0.02055,"13.1":0.07809,"14.1":0.10275,"15.1":0.00822,"15.2-15.3":0.01233,"15.4":0.05343,"15.5":0.0822,"15.6":0.31236,"16.0":0.0411,"16.1":0.10686,"16.2":0.08631,"16.3":0.19728,"16.4":0.10686,"16.5":0.89187,"16.6":1.09737},G:{"8":0.02227,"17":0.31183,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02227,"8.1-8.4":0.03118,"9.0-9.2":0,"9.3":0.049,"10.0-10.2":0,"10.3":0.10691,"11.0-11.2":0.06237,"11.3-11.4":0.00445,"12.0-12.1":0.05791,"12.2-12.5":0.25837,"13.0-13.1":0,"13.2":0,"13.3":0.01782,"13.4-13.7":0.01336,"14.0-14.4":0.16928,"14.5-14.8":0.35192,"15.0-15.1":0.12028,"15.2-15.3":0.2851,"15.4":0.24946,"15.5":0.40983,"15.6-15.7":2.71292,"16.0":1.29632,"16.1":3.50585,"16.2":1.51905,"16.3":3.02029,"16.4":0.44102,"16.5":9.49743,"16.6":19.95708},P:{"4":0.03099,"20":0.11365,"21":0.23763,"5.0-5.4":0,"6.2-6.4":0.01033,"7.2-7.4":0.16531,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03099,"12.0":0,"13.0":0.03099,"14.0":0,"15.0":0.01033,"16.0":0.03099,"17.0":0.01033,"18.0":0.03099,"19.0":0.07232},I:{"0":0,"3":0.00663,"4":0.04865,"2.1":0.00885,"2.2":0.0199,"2.3":0.04423,"4.1":0.0398,"4.2-4.3":0.06855,"4.4":0,"4.4.3-4.4.4":0.27642},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00411,"7":0.00411,"8":0.05343,"9":0.01233,"10":0.01233,"11":0.04932,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.01178},N:{"10":0.01178,"11":0.01178},L:{"0":32.51277},R:{_:"0"},M:{"0":0.08246},Q:{"13.1":0},O:{"0":0.04123},H:{"0":0.07249}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00406,"41":0.00406,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01625,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00406,"68":0.00812,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00406,"76":0,"77":0,"78":0.00406,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04062,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01625,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00406,"113":0.00406,"114":0.04062,"115":0.05281,"116":0.02437,"117":0.41432,"118":0.04062,"119":0.00406,"120":0,"3.5":0,"3.6":0.00406},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00406,"40":0.00406,"41":0.00406,"42":0.00406,"43":0.00812,"44":0.00812,"45":0.00812,"46":0.00406,"47":0.00406,"48":0,"49":0.02843,"50":0,"51":0.00812,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00406,"71":0.00406,"72":0,"73":0,"74":0,"75":0.00406,"76":0.04468,"77":0,"78":0,"79":0.00406,"80":0,"81":0,"83":0.01219,"84":0,"85":0,"86":0,"87":0.00406,"88":0.00406,"89":0,"90":0.00812,"91":0.00812,"92":0,"93":0.03656,"94":0.01219,"95":0,"96":0,"97":0,"98":0.00406,"99":0,"100":0,"101":0.00406,"102":0.00406,"103":0.11374,"104":0,"105":0.00406,"106":0.00812,"107":0.00812,"108":0.00812,"109":0.45088,"110":0.00812,"111":0.00812,"112":0.02031,"113":0.00812,"114":0.11374,"115":0.24372,"116":5.5162,"117":1.14548,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00406,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00406,"73":0,"74":0,"75":0,"76":0,"77":0.00406,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00406,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00812,"96":0,"97":0,"98":0,"99":0,"100":0.00812,"101":0.04874,"102":0.03656,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00812,"13":0,"14":0.00406,"15":0.00406,"16":0,"17":0.00406,"18":0.00812,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00406,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00406,"108":0,"109":0.0325,"110":0,"111":0,"112":0.00406,"113":0.00812,"114":0.02843,"115":0.10967,"116":1.79134,"117":1.21048},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00406,"9":0.01625,"10":0,"11":0,"12":0,"13":0,"14":0.02031,"15":0.00406,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01219,"13.1":0.05687,"14.1":0.09343,"15.1":0.02031,"15.2-15.3":0.01625,"15.4":0.03656,"15.5":0.04874,"15.6":0.26809,"16.0":0.0325,"16.1":0.08936,"16.2":0.06905,"16.3":0.19904,"16.4":0.09749,"16.5":0.25591,"16.6":1.72229,"17.0":0.06499,"17.1":0.00406},G:{"8":0.01805,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01805,"8.1-8.4":0.0361,"9.0-9.2":0,"9.3":0.04964,"10.0-10.2":0,"10.3":0.08123,"11.0-11.2":0.07671,"11.3-11.4":0,"12.0-12.1":0.19855,"12.2-12.5":0.20758,"13.0-13.1":0.00451,"13.2":0,"13.3":0.00903,"13.4-13.7":0.01354,"14.0-14.4":0.09025,"14.5-14.8":0.27075,"15.0-15.1":0.05866,"15.2-15.3":0.27978,"15.4":0.23465,"15.5":0.37905,"15.6-15.7":2.72557,"16.0":1.13265,"16.1":3.0595,"16.2":1.26802,"16.3":2.48641,"16.4":0.32039,"16.5":1.30412,"16.6":28.27106,"17.0":1.94039,"17.1":0.00451},P:{"4":0.02056,"20":0.0925,"21":0.16444,"22":4.00834,"5.0-5.4":0,"6.2-6.4":0.01028,"7.2-7.4":0.185,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03083,"12.0":0.01028,"13.0":0.02056,"14.0":0.02056,"15.0":0,"16.0":0.02056,"17.0":0.02056,"18.0":0.04111,"19.0":0.04111},I:{"0":0,"3":0.00869,"4":0.05649,"2.1":0.01086,"2.2":0.03476,"2.3":0.0478,"4.1":0.04345,"4.2-4.3":0.0717,"4.4":0,"4.4.3-4.4.4":0.28245},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00406,"8":0.04468,"9":0.00812,"10":0.00812,"11":0.04062,"5.5":0},S:{"2.5":0.00594,_:"3.0-3.1"},J:{"7":0,"10":0.01188},N:{"10":0.01188,"11":0.01188},L:{"0":32.26173},R:{_:"0"},M:{"0":0.10095},Q:{"13.1":0},O:{"0":0.0475},H:{"0":0.06746}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BT.js
index 4acf4e38387660..98f3363fb8fcf4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BT.js
@@ -1 +1 @@
-module.exports={C:{"2":0.00307,"3":0.0092,"4":0.0092,"5":0.00307,"6":0.00307,"7":0,"8":0,"9":0,"10":0.00307,"11":0,"12":0.00307,"13":0,"14":0.00307,"15":0,"16":0.00307,"17":0,"18":0,"19":0,"20":0,"21":0.00307,"22":0.00307,"23":0,"24":0,"25":0.00307,"26":0.00307,"27":0.00307,"28":0.00307,"29":0.00307,"30":0,"31":0.00307,"32":0,"33":0.00307,"34":0.00307,"35":0.0092,"36":0.00614,"37":0.00614,"38":0.00307,"39":0.00614,"40":0.01227,"41":0.00614,"42":0.00307,"43":0.00307,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00307,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.01227,"115":0.07363,"116":0.16567,"117":0.01534,"118":0,"119":0,"120":0,"3.5":0.00614,"3.6":0.01534},D:{"4":0.00307,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0.00307,"11":0,"12":0,"13":0.00307,"14":0.00307,"15":0,"16":0,"17":0.00307,"18":0.00307,"19":0.00307,"20":0,"21":0.0092,"22":0,"23":0,"24":0,"25":0,"26":0.00307,"27":0,"28":0.00307,"29":0.00307,"30":0.00307,"31":0.0092,"32":0.00307,"33":0.00614,"34":0.00307,"35":0.00307,"36":0.00614,"37":0.0092,"38":0.00614,"39":0.0092,"40":0.0092,"41":0.01227,"42":0.01227,"43":0.02148,"44":0.04295,"45":0.02761,"46":0.01841,"47":0.01841,"48":0,"49":0,"50":0,"51":0.02148,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00307,"66":0.00307,"67":0.00307,"68":0,"69":0,"70":0.00614,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00307,"78":0,"79":0.00614,"80":0.00307,"81":0.00614,"83":0,"84":0,"85":0,"86":0,"87":0.00614,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00307,"95":0,"96":0,"97":0.00307,"98":0.02148,"99":0.0092,"100":0.00307,"101":0,"102":0,"103":0.01227,"104":0.00307,"105":0.00614,"106":0,"107":0.00307,"108":0.0092,"109":0.57678,"110":0,"111":0.00307,"112":0.02761,"113":0.03375,"114":0.16567,"115":3.26435,"116":2.24578,"117":0.00307,"118":0.00307,"119":0},F:{"9":0,"11":0.00307,"12":0.00307,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00307,"29":0,"30":0.00614,"31":0.00614,"32":0.00307,"33":0.00307,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00614,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00614,"70":0.00307,"71":0.02148,"72":0.03375,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00307,"96":0,"97":0,"98":0,"99":0,"100":0.01534,"101":0.03375,"102":0.00307,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.0092},B:{"12":0.0092,"13":0,"14":0.01534,"15":0,"16":0.00307,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00614,"93":0,"94":0,"95":0,"96":0.00307,"97":0,"98":0.00307,"99":0,"100":0.00307,"101":0.00307,"102":0,"103":0.0092,"104":0,"105":0.00614,"106":0.00307,"107":0.02454,"108":0.00307,"109":0.00614,"110":0.0092,"111":0.00614,"112":0.01227,"113":0.01841,"114":0.01841,"115":0.50929,"116":0.19328},E:{"4":0.00307,"5":0.00307,"6":0.00307,"7":0.00307,"8":0.00614,"9":0.03375,"10":0,"11":0,"12":0,"13":0.00307,"14":0.00307,"15":0.00307,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00614,"6.1":0.00307,"7.1":0.00307,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00614,"14.1":0.01841,"15.1":0.0092,"15.2-15.3":0,"15.4":0.03682,"15.5":0.00307,"15.6":0.08897,"16.0":0.00307,"16.1":0.0092,"16.2":0.02148,"16.3":0.01534,"16.4":0.00614,"16.5":0.05216,"16.6":0.05216},G:{"8":0.00869,"17":0.02473,"3.2":0.00668,"4.0-4.1":0.00267,"4.2-4.3":0.00468,"5.0-5.1":0.01002,"6.0-6.1":0.03342,"7.0-7.1":0.07351,"8.1-8.4":0.11963,"9.0-9.2":0.00802,"9.3":0.02139,"10.0-10.2":0,"10.3":0.0254,"11.0-11.2":0.23725,"11.3-11.4":0,"12.0-12.1":0.06483,"12.2-12.5":0.12297,"13.0-13.1":0.002,"13.2":0.00267,"13.3":0.01537,"13.4-13.7":0.03676,"14.0-14.4":0.07151,"14.5-14.8":0.09423,"15.0-15.1":0.01069,"15.2-15.3":0.03743,"15.4":0.01871,"15.5":0.10092,"15.6-15.7":0.62354,"16.0":0.34351,"16.1":0.34017,"16.2":0.29807,"16.3":0.51393,"16.4":0.27668,"16.5":1.32393,"16.6":1.80111},P:{"4":0.56724,"20":0.09282,"21":0.09282,"5.0-5.4":0,"6.2-6.4":0.05157,"7.2-7.4":0.06188,"8.2":0,"9.2":0.04125,"10.1":0,"11.1-11.2":0.01031,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.04125,"17.0":0.07219,"18.0":0.01031,"19.0":0.03094},I:{"0":0,"3":0.01814,"4":0.10158,"2.1":0.0254,"2.2":0.05805,"2.3":0.08707,"4.1":0.09433,"4.2-4.3":0.17777,"4.4":0,"4.4.3-4.4.4":0.37005},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00623,"7":0.0187,"8":0.19012,"9":0.03117,"10":0.03428,"11":0.09973,"5.5":0},S:{"2.5":0.0208,_:"3.0-3.1"},J:{"7":0,"10":0.05546},N:{"10":0.08381,"11":0.04789},L:{"0":77.05537},R:{_:"0"},M:{"0":0.07625},Q:{"13.1":0},O:{"0":2.25983},H:{"0":0.37408}};
+module.exports={C:{"2":0.00312,"3":0.00937,"4":0.00937,"5":0.00312,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00312,"12":0.00312,"13":0.00312,"14":0.00312,"15":0,"16":0,"17":0.00312,"18":0,"19":0.00312,"20":0.00312,"21":0.00312,"22":0.00312,"23":0.00312,"24":0.00312,"25":0,"26":0,"27":0.00312,"28":0.00312,"29":0.00312,"30":0,"31":0.00312,"32":0,"33":0.00312,"34":0.00312,"35":0.00625,"36":0.00312,"37":0.00625,"38":0.00312,"39":0.00937,"40":0.01562,"41":0.00625,"42":0.00312,"43":0.00312,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00937,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00937,"115":0.04997,"116":0.01562,"117":0.31542,"118":0.01249,"119":0,"120":0,"3.5":0.00312,"3.6":0.01874},D:{"4":0.00312,"5":0.00312,"6":0.00312,"7":0.00312,"8":0,"9":0,"10":0.00312,"11":0.00312,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00312,"18":0.00312,"19":0.00312,"20":0.00312,"21":0.00937,"22":0,"23":0,"24":0,"25":0.00312,"26":0,"27":0.00312,"28":0.00312,"29":0.00312,"30":0.00312,"31":0.00937,"32":0.00312,"33":0.00625,"34":0.00312,"35":0.00312,"36":0.00625,"37":0.00937,"38":0.00625,"39":0.01562,"40":0.00937,"41":0.01562,"42":0.00937,"43":0.02498,"44":0.02811,"45":0.03748,"46":0.02186,"47":0.01874,"48":0,"49":0,"50":0,"51":0.02498,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00625,"67":0,"68":0,"69":0,"70":0.00937,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00312,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.00937,"88":0.00312,"89":0,"90":0,"91":0,"92":0,"93":0.00312,"94":0.00312,"95":0,"96":0,"97":0,"98":0.02498,"99":0.01249,"100":0.00312,"101":0,"102":0,"103":0.02811,"104":0,"105":0.00312,"106":0.00312,"107":0.00312,"108":0.00312,"109":0.54028,"110":0.00312,"111":0.00312,"112":0.00937,"113":0.05934,"114":0.03435,"115":0.09057,"116":4.32848,"117":1.01498,"118":0.00625,"119":0,"120":0},F:{"9":0,"11":0.00312,"12":0.00312,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00312,"30":0.00625,"31":0.00937,"32":0.00625,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00312,"70":0.00312,"71":0.00312,"72":0.09057,"73":0.00937,"74":0,"75":0,"76":0,"77":0.03748,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00312,"101":0.01249,"102":0.01562,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00625},B:{"12":0.01874,"13":0,"14":0.01874,"15":0,"16":0,"17":0,"18":0.00312,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00312,"93":0,"94":0,"95":0,"96":0.00312,"97":0,"98":0.00312,"99":0,"100":0,"101":0.00625,"102":0.00312,"103":0.00625,"104":0,"105":0.00312,"106":0.00937,"107":0.02811,"108":0,"109":0.00312,"110":0.00625,"111":0.01874,"112":0.00937,"113":0.02498,"114":0.01874,"115":0.03123,"116":0.49343,"117":0.32479},E:{"4":0.00625,"5":0.00312,"6":0,"7":0.00312,"8":0.00625,"9":0.05309,"10":0,"11":0,"12":0,"13":0.00937,"14":0.02186,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00625,"6.1":0,"7.1":0.00312,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00312,"14.1":0.02811,"15.1":0.00312,"15.2-15.3":0.00312,"15.4":0.01249,"15.5":0.00625,"15.6":0.11555,"16.0":0,"16.1":0.02498,"16.2":0.00625,"16.3":0.00937,"16.4":0.00625,"16.5":0.01562,"16.6":0.11867,"17.0":0.00625,"17.1":0},G:{"8":0.00987,"3.2":0.00423,"4.0-4.1":0,"4.2-4.3":0.01269,"5.0-5.1":0.0275,"6.0-6.1":0.01693,"7.0-7.1":0.11636,"8.1-8.4":0.1749,"9.0-9.2":0.0134,"9.3":0.03385,"10.0-10.2":0.00141,"10.3":0.03667,"11.0-11.2":0.35967,"11.3-11.4":0.00141,"12.0-12.1":0.10719,"12.2-12.5":0.09027,"13.0-13.1":0,"13.2":0.00212,"13.3":0.00705,"13.4-13.7":0.00564,"14.0-14.4":0.15797,"14.5-14.8":0.07828,"15.0-15.1":0.0134,"15.2-15.3":0.05219,"15.4":0.01975,"15.5":0.04937,"15.6-15.7":0.69112,"16.0":0.34556,"16.1":0.17419,"16.2":0.19041,"16.3":0.22215,"16.4":0.26164,"16.5":0.66362,"16.6":2.77648,"17.0":0.30536,"17.1":0},P:{"4":0.46071,"20":0.10471,"21":0.11518,"22":0.69107,"5.0-5.4":0,"6.2-6.4":0.06282,"7.2-7.4":0.08377,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01047,"14.0":0,"15.0":0.01047,"16.0":0.04188,"17.0":0.01047,"18.0":0,"19.0":0.03141},I:{"0":0,"3":0.01139,"4":0.15945,"2.1":0.01898,"2.2":0.08352,"2.3":0.11389,"4.1":0.11769,"4.2-4.3":0.23159,"4.4":0,"4.4.3-4.4.4":0.44039},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00629,"7":0.02202,"8":0.21074,"9":0.04403,"10":0.03774,"11":0.10065,"5.5":0.00315},S:{"2.5":0.02063,_:"3.0-3.1"},J:{"7":0,"10":0.04814},N:{"10":0.08315,"11":0.04751},L:{"0":76.42468},R:{_:"0"},M:{"0":0.03439},Q:{"13.1":0},O:{"0":1.87054},H:{"0":0.65107}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BW.js
index 8459151f1f12e4..26c1620ceacd7e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.0037,"33":0,"34":0.0074,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0037,"50":0,"51":0,"52":0.0074,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0037,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01109,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.0037,"89":0,"90":0,"91":0.0074,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0037,"100":0,"101":0,"102":0.01109,"103":0.0037,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0037,"110":0.0074,"111":0,"112":0.05917,"113":0.0037,"114":0.01479,"115":0.20339,"116":0.34391,"117":0.02958,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0037,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.0037,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0037,"47":0,"48":0,"49":0.0037,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.0037,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.0037,"64":0,"65":0,"66":0.0037,"67":0,"68":0.0037,"69":0.0037,"70":0.0037,"71":0,"72":0.0037,"73":0,"74":0.0037,"75":0.0074,"76":0,"77":0,"78":0.0037,"79":0.0037,"80":0,"81":0.04438,"83":0.0037,"84":0,"85":0.0037,"86":0,"87":0.0074,"88":0.01479,"89":0.0037,"90":0.02219,"91":0,"92":0.0037,"93":0,"94":0,"95":0.01849,"96":0,"97":0.0037,"98":0,"99":0.01109,"100":0.0074,"101":0.0037,"102":0.0074,"103":0.01479,"104":0.06656,"105":0.0037,"106":0.0037,"107":0.01109,"108":0.01109,"109":0.71371,"110":0.0037,"111":0.01479,"112":0.02589,"113":0.04807,"114":0.52142,"115":4.35994,"116":2.44808,"117":0.0037,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.0037,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.0037,"58":0,"60":0.0074,"62":0,"63":0,"64":0,"65":0,"66":0.0037,"67":0.01109,"68":0,"69":0.04068,"70":0.02219,"71":0.12203,"72":0.08505,"73":0,"74":0,"75":0,"76":0.02958,"77":0.0074,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01479,"96":0,"97":0,"98":0,"99":0.01479,"100":0.07396,"101":0.14792,"102":0.0037,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.0037},B:{"12":0.0037,"13":0,"14":0.0037,"15":0.0037,"16":0.0037,"17":0,"18":0.01109,"79":0,"80":0.0037,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.0037,"91":0,"92":0.07026,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0037,"101":0,"102":0,"103":0,"104":0.0037,"105":0,"106":0,"107":0.0037,"108":0.0037,"109":0.05547,"110":0.0037,"111":0.0037,"112":0.0074,"113":0.01849,"114":0.09245,"115":1.22034,"116":0.35501},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0037,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01109,"14.1":0.0074,"15.1":0.0037,"15.2-15.3":0.01479,"15.4":0.0074,"15.5":0.01479,"15.6":0.03328,"16.0":0,"16.1":0.01109,"16.2":0.0074,"16.3":0.01109,"16.4":0.0037,"16.5":0.06656,"16.6":0.08505},G:{"8":0,"17":0.1379,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00305,"6.0-6.1":0,"7.0-7.1":0.03234,"8.1-8.4":0.00122,"9.0-9.2":0.00122,"9.3":0.04332,"10.0-10.2":0,"10.3":0.03173,"11.0-11.2":0.00183,"11.3-11.4":0,"12.0-12.1":0.00122,"12.2-12.5":0.21296,"13.0-13.1":0,"13.2":0.00244,"13.3":0.03051,"13.4-13.7":0.06102,"14.0-14.4":0.05675,"14.5-14.8":0.09092,"15.0-15.1":0.03417,"15.2-15.3":0.02136,"15.4":0.07993,"15.5":0.06224,"15.6-15.7":0.98057,"16.0":0.14278,"16.1":0.23492,"16.2":0.25323,"16.3":0.29411,"16.4":0.07261,"16.5":1.09773,"16.6":2.11675},P:{"4":0.20281,"20":0.08113,"21":0.30422,"5.0-5.4":0.01014,"6.2-6.4":0,"7.2-7.4":0.49689,"8.2":0,"9.2":0.01014,"10.1":0,"11.1-11.2":0.0507,"12.0":0,"13.0":0.08113,"14.0":0.02028,"15.0":0.08113,"16.0":0.04056,"17.0":0.16225,"18.0":0.03042,"19.0":0.12169},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00136,"4.4":0,"4.4.3-4.4.4":0.08562},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02589,"5.5":0},S:{"2.5":0.11344,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.20759},R:{_:"0"},M:{"0":0.26468},Q:{"13.1":0.0126},O:{"0":0.84447},H:{"0":1.10377}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00783,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00392,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00783,"50":0,"51":0,"52":0.01175,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00392,"61":0,"62":0,"63":0,"64":0,"65":0.00392,"66":0,"67":0,"68":0.00392,"69":0,"70":0,"71":0,"72":0.00392,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00783,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00392,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00392,"92":0.00392,"93":0,"94":0.00392,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01958,"103":0.00392,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00392,"114":0.01958,"115":0.09788,"116":0.05873,"117":0.40716,"118":0.02741,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00392,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00392,"47":0,"48":0,"49":0.00783,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00392,"64":0,"65":0,"66":0.00392,"67":0,"68":0,"69":0.00783,"70":0.00783,"71":0,"72":0,"73":0,"74":0.00783,"75":0.00392,"76":0,"77":0,"78":0.00392,"79":0.00392,"80":0.00392,"81":0.04698,"83":0.00392,"84":0,"85":0,"86":0.00392,"87":0.00392,"88":0.01566,"89":0,"90":0.00392,"91":0,"92":0.00392,"93":0.00392,"94":0,"95":0.01175,"96":0.00392,"97":0.00392,"98":0.00392,"99":0.01175,"100":0.00392,"101":0,"102":0.00392,"103":0.01566,"104":0.03915,"105":0.00392,"106":0.01175,"107":0.00392,"108":0.01566,"109":0.81824,"110":0.00783,"111":0.01175,"112":0.01958,"113":0.03915,"114":0.13703,"115":0.24665,"116":6.53414,"117":1.32719,"118":0.00392,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00392,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00392,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00392,"69":0.02741,"70":0.00783,"71":0.01175,"72":0.25056,"73":0.03915,"74":0,"75":0,"76":0,"77":0.02741,"78":0.00392,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01566,"96":0,"97":0,"98":0,"99":0.00392,"100":0.01175,"101":0.16052,"102":0.11745,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00392,"13":0.00392,"14":0.00392,"15":0.00392,"16":0.00783,"17":0.00392,"18":0.01175,"79":0,"80":0.00392,"81":0,"83":0,"84":0.00392,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00392,"91":0,"92":0.04698,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00392,"101":0,"102":0,"103":0,"104":0.00392,"105":0,"106":0,"107":0.00783,"108":0,"109":0.04307,"110":0.00783,"111":0.00783,"112":0.00392,"113":0.01175,"114":0.03915,"115":0.09396,"116":1.12361,"117":0.71253},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00392,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00392,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01566,"14.1":0.00783,"15.1":0,"15.2-15.3":0,"15.4":0.01175,"15.5":0.00392,"15.6":0.04307,"16.0":0.00392,"16.1":0.01958,"16.2":0.00392,"16.3":0.01175,"16.4":0.01566,"16.5":0.02741,"16.6":0.14486,"17.0":0.00783,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00123,"6.0-6.1":0.00185,"7.0-7.1":0.04677,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05231,"10.0-10.2":0,"10.3":0.03262,"11.0-11.2":0.00062,"11.3-11.4":0,"12.0-12.1":0.00185,"12.2-12.5":0.25047,"13.0-13.1":0,"13.2":0.00492,"13.3":0.00492,"13.4-13.7":0.01846,"14.0-14.4":0.02954,"14.5-14.8":0.05169,"15.0-15.1":0.06277,"15.2-15.3":0.032,"15.4":0.10462,"15.5":0.04739,"15.6-15.7":0.9422,"16.0":0.11693,"16.1":0.23693,"16.2":0.12616,"16.3":0.26955,"16.4":0.056,"16.5":0.29171,"16.6":2.93368,"17.0":0.32125,"17.1":0},P:{"4":0.21679,"20":0.04129,"21":0.20646,"22":1.52783,"5.0-5.4":0,"6.2-6.4":0.01032,"7.2-7.4":0.24776,"8.2":0,"9.2":0.01032,"10.1":0,"11.1-11.2":0.02065,"12.0":0.01032,"13.0":0.01032,"14.0":0.03097,"15.0":0.08259,"16.0":0.04129,"17.0":0.07226,"18.0":0.05162,"19.0":0.07226},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.09741},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01958,"5.5":0},S:{"2.5":0.1217,_:"3.0-3.1"},J:{"7":0,"10":0.00609},N:{"10":0,"11":0},L:{"0":73.13617},R:{_:"0"},M:{"0":0.12779},Q:{"13.1":0.01826},O:{"0":1.04054},H:{"0":1.22131}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BY.js
index 4812f8a8c3edb0..30b9d94d254183 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00396,"51":0,"52":0.04358,"53":0.00396,"54":0,"55":0.00396,"56":0.00396,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.01981,"65":0,"66":0,"67":0,"68":0.00396,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00396,"92":0,"93":0,"94":0,"95":0.00396,"96":0.00396,"97":0,"98":0,"99":0,"100":0,"101":0.00396,"102":0.01585,"103":0,"104":0.00396,"105":0.01189,"106":0.00792,"107":0.00396,"108":0.00396,"109":0,"110":0.00792,"111":0.00396,"112":0.01189,"113":0.00792,"114":0.01585,"115":0.36054,"116":0.45167,"117":0.01981,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02377,"50":0,"51":0,"52":0,"53":0.00792,"54":0,"55":0.00396,"56":0,"57":0,"58":0.01189,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00396,"70":0.00396,"71":0,"72":0,"73":0.00396,"74":0.00396,"75":0.00396,"76":0.00396,"77":0.00396,"78":0.00396,"79":0.01585,"80":0.00396,"81":0.00792,"83":0.00792,"84":0.00396,"85":0.01189,"86":0.00396,"87":0.00396,"88":0.00396,"89":0.00792,"90":0.00396,"91":0.00396,"92":0.00396,"93":0.0317,"94":0.00396,"95":0.00396,"96":0.00396,"97":0.00396,"98":0.00396,"99":0.0317,"100":0.01189,"101":0.00792,"102":0.02773,"103":0.01585,"104":0.00792,"105":0.0317,"106":0.05151,"107":0.01981,"108":0.03566,"109":1.25199,"110":0.01585,"111":0.03566,"112":0.03962,"113":0.0317,"114":0.30507,"115":3.52222,"116":1.79875,"117":0.00396,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00396,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00792,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00396,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00396,"68":0,"69":0.01189,"70":0.00396,"71":0.01189,"72":0.01585,"73":0.00396,"74":0.00396,"75":0,"76":0.00396,"77":0.00396,"78":0,"79":0.02377,"80":0.00396,"81":0.00396,"82":0.00792,"83":0.00396,"84":0.00396,"85":0.03566,"86":0.01585,"87":0.00396,"88":0,"89":0.00792,"90":0,"91":0.00396,"92":0,"93":0.00396,"94":0.00792,"95":0.38035,"96":0.00396,"97":0.00396,"98":0.00396,"99":0.01981,"100":0.76467,"101":0.95484,"102":0.01189,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00792},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00396,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00396,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00396,"109":0.01585,"110":0,"111":0,"112":0,"113":0.00396,"114":0.01981,"115":0.60222,"116":0.14659},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00792,"15":0,"17":0.01585,_:"0","3.1":0,"3.2":0,"5.1":0.00396,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00396,"13.1":0.01189,"14.1":0.01981,"15.1":0.00396,"15.2-15.3":0.00396,"15.4":0.00792,"15.5":0.02773,"15.6":0.13075,"16.0":0.00792,"16.1":0.03962,"16.2":0.04358,"16.3":0.09509,"16.4":0.03962,"16.5":0.36847,"16.6":0.46355},G:{"8":0,"17":0.29634,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.0247,"9.3":0.02744,"10.0-10.2":0.00549,"10.3":0.03018,"11.0-11.2":0.06037,"11.3-11.4":0,"12.0-12.1":0.00823,"12.2-12.5":0.17561,"13.0-13.1":0.01098,"13.2":0,"13.3":0.0247,"13.4-13.7":0.02744,"14.0-14.4":0.12622,"14.5-14.8":0.23598,"15.0-15.1":0.10427,"15.2-15.3":0.14543,"15.4":0.14817,"15.5":0.26067,"15.6-15.7":2.3982,"16.0":1.33355,"16.1":1.87136,"16.2":0.90001,"16.3":1.84392,"16.4":0.42805,"16.5":6.03939,"16.6":10.89889},P:{"4":0.06048,"20":0.09071,"21":0.07055,"22":0.63499,"5.0-5.4":0,"6.2-6.4":0.28222,"7.2-7.4":0.01008,"8.2":0,"9.2":0.01008,"10.1":0.01008,"11.1-11.2":0.01008,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.01008,"17.0":0.01008,"18.0":0.01008,"19.0":0.07055},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00758,"4.4":0,"4.4.3-4.4.4":0.03034},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00792,"9":0,"10":0,"11":0.03566,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":50.81608},R:{_:"0"},M:{"0":0.09057},Q:{"13.1":0},O:{"0":0.13284},H:{"0":0.84603}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.03719,"46":0,"47":0,"48":0.00465,"49":0.05114,"50":0.00465,"51":0.00465,"52":0.08833,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00465,"63":0,"64":0.00465,"65":0,"66":0,"67":0,"68":0.00465,"69":0,"70":0.01395,"71":0,"72":0,"73":0,"74":0.0093,"75":0,"76":0.0093,"77":0,"78":0.01395,"79":0,"80":0,"81":0.0093,"82":0,"83":0,"84":0.0093,"85":0,"86":0,"87":0.0093,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00465,"97":0.01395,"98":0,"99":0.00465,"100":0.00465,"101":0.02325,"102":0.0186,"103":0,"104":0.07438,"105":0.04184,"106":0.0093,"107":0.0093,"108":0.00465,"109":0.00465,"110":0.01395,"111":0,"112":0.01395,"113":0.0093,"114":0.0093,"115":0.42771,"116":0.05114,"117":0.56718,"118":0.05579,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.06044,"50":0,"51":0.06509,"52":0,"53":0.00465,"54":0,"55":0.0093,"56":0,"57":0,"58":0.0186,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00465,"65":0,"66":0,"67":0.01395,"68":0,"69":0,"70":0.00465,"71":0.02325,"72":0,"73":0.0093,"74":0.0093,"75":0.05114,"76":0.09763,"77":0.01395,"78":0.08833,"79":0.06044,"80":0.10228,"81":0.06044,"83":0.09763,"84":0.02325,"85":0.02325,"86":0.09298,"87":0.13947,"88":0.01395,"89":0.03254,"90":0.29754,"91":0.11623,"92":0.00465,"93":0.07438,"94":0.0093,"95":0.04649,"96":0.05114,"97":0.03719,"98":0.03719,"99":0.02325,"100":0.03719,"101":0.05114,"102":0.13017,"103":0.07438,"104":0.03719,"105":0.06974,"106":0.13947,"107":0.14877,"108":0.06509,"109":1.49698,"110":0.02325,"111":0.08833,"112":0.08368,"113":0.05579,"114":0.36727,"115":0.27894,"116":4.82566,"117":1.43189,"118":0.00465,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01395,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00465,"57":0,"58":0,"60":0.02789,"62":0.01395,"63":0.02325,"64":0,"65":0.00465,"66":0,"67":0.00465,"68":0.00465,"69":0.01395,"70":0.00465,"71":0,"72":0.02325,"73":0.05114,"74":0.01395,"75":0,"76":0,"77":0.07438,"78":0,"79":0.04649,"80":0.00465,"81":0,"82":0.01395,"83":0.0186,"84":0.00465,"85":0.04184,"86":0.03719,"87":0.04649,"88":0,"89":0.0093,"90":0,"91":0,"92":0,"93":0,"94":0.00465,"95":0.46955,"96":0.00465,"97":0.06509,"98":0,"99":0.01395,"100":0.08368,"101":0.81822,"102":0.80428,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0.0093,"12.1":0.00465},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00465,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.05579,"91":0,"92":0.00465,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00465,"106":0.0093,"107":0,"108":0.00465,"109":0.02325,"110":0.00465,"111":0,"112":0,"113":0.0093,"114":0.01395,"115":0.05579,"116":0.40911,"117":0.27894},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00465,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.0093,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00465,"13.1":0.0093,"14.1":0.02325,"15.1":0.00465,"15.2-15.3":0.00465,"15.4":0.0093,"15.5":0.02789,"15.6":0.13482,"16.0":0.0093,"16.1":0.04184,"16.2":0.02789,"16.3":0.09763,"16.4":0.03254,"16.5":0.09763,"16.6":0.71595,"17.0":0.08368,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.01708,"9.3":0.03757,"10.0-10.2":0,"10.3":0.02391,"11.0-11.2":0.02049,"11.3-11.4":0,"12.0-12.1":0.00683,"12.2-12.5":0.14346,"13.0-13.1":0,"13.2":0,"13.3":11.84195,"13.4-13.7":0.03757,"14.0-14.4":0.09905,"14.5-14.8":0.22543,"15.0-15.1":0.09905,"15.2-15.3":0.1093,"15.4":0.10588,"15.5":0.17761,"15.6-15.7":1.92299,"16.0":0.86074,"16.1":1.34917,"16.2":0.63531,"16.3":1.10666,"16.4":0.22543,"16.5":0.76851,"16.6":12.30306,"17.0":1.81028,"17.1":0},P:{"4":0.03211,"20":0.0214,"21":0.04281,"22":0.57791,"5.0-5.4":0,"6.2-6.4":0.19264,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.0107,"14.0":0,"15.0":0,"16.0":0,"17.0":0.0214,"18.0":0,"19.0":0.0214},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.008,"4.4":0,"4.4.3-4.4.4":0.032},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00501,"9":0,"10":0,"11":0.06008,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":39.36212},R:{_:"0"},M:{"0":0.07491},Q:{"13.1":0},O:{"0":0.12842},H:{"0":0.79029}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BZ.js
index 11a702678c96f6..0e48dee60647d8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/BZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0.00482,"3":0.00963,"4":0.00963,"5":0.00482,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00482,"12":0.00482,"13":0,"14":0,"15":0.00482,"16":0.00482,"17":0.00482,"18":0,"19":0,"20":0.00482,"21":0.01927,"22":0,"23":0.00482,"24":0.00482,"25":0,"26":0.00482,"27":0.00482,"28":0.00482,"29":0.00482,"30":0,"31":0.00482,"32":0,"33":0.00482,"34":0.00482,"35":0.00963,"36":0.00482,"37":0.00482,"38":0.01445,"39":0.01445,"40":0.0289,"41":0.00482,"42":0.00482,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00482,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00963,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00482,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00963,"111":0,"112":0.00963,"113":0.00482,"114":0.00482,"115":0.16378,"116":0.39981,"117":0.01927,"118":0,"119":0,"120":0,"3.5":0.00963,"3.6":0.02409},D:{"4":0,"5":0,"6":0,"7":0.00482,"8":0,"9":0,"10":0.00482,"11":0.00482,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0.00482,"20":0,"21":0.00482,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00482,"29":0,"30":0.00482,"31":0.01445,"32":0.00482,"33":0.00482,"34":0.00482,"35":0.00482,"36":0.00482,"37":0.01445,"38":0.00963,"39":0.02409,"40":0.01445,"41":0.01927,"42":0.01445,"43":0.03854,"44":0.07226,"45":0.03372,"46":0.03372,"47":0.0289,"48":0,"49":0,"50":0,"51":0.0289,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.01445,"71":0,"72":0,"73":0,"74":0,"75":0.01445,"76":0.03854,"77":0,"78":0,"79":0.01445,"80":0,"81":0.00482,"83":0,"84":0,"85":0,"86":0,"87":0.00482,"88":0.00482,"89":0.00482,"90":0.00482,"91":0.00482,"92":0.04335,"93":0.09152,"94":0,"95":0,"96":0,"97":0.00482,"98":0,"99":0.00482,"100":0.00482,"101":0,"102":0,"103":0.08671,"104":0.00482,"105":0.00482,"106":0.00482,"107":0,"108":2.47112,"109":0.47207,"110":0.00482,"111":0.03854,"112":0.01927,"113":0.01927,"114":1.5029,"115":6.2043,"116":3.69464,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00482,"27":0,"28":0.00482,"29":0.00482,"30":0.01445,"31":0.01927,"32":0.00482,"33":0.00482,"34":0,"35":0,"36":0,"37":0.00482,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00482,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.09152,"101":0.07226,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00482,"11.5":0.00482,"11.6":0,"12.1":0.00963},B:{"12":0.02409,"13":0,"14":0.01927,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00482,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01927,"110":0,"111":0,"112":0,"113":0.00482,"114":0.08189,"115":1.14163,"116":0.35164},E:{"4":0.00482,"5":0.00963,"6":0.00482,"7":0.00482,"8":0.00963,"9":0.04817,"10":0,"11":0,"12":0,"13":0,"14":0.06262,"15":0,"17":0.03854,_:"0","3.1":0,"3.2":0,"5.1":0.00963,"6.1":0.00482,"7.1":0.00482,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00482,"13.1":0.01927,"14.1":0.0289,"15.1":0.00963,"15.2-15.3":0.01445,"15.4":0.03854,"15.5":0.05299,"15.6":0.30829,"16.0":0.01445,"16.1":0.06744,"16.2":0.03854,"16.3":0.18305,"16.4":0.0578,"16.5":0.60213,"16.6":0.83816},G:{"8":0.01507,"17":0.32862,"3.2":0.00603,"4.0-4.1":0,"4.2-4.3":0.01206,"5.0-5.1":0.09647,"6.0-6.1":0.02412,"7.0-7.1":0.09647,"8.1-8.4":0.18692,"9.0-9.2":0.01809,"9.3":0.09045,"10.0-10.2":0,"10.3":0.08442,"11.0-11.2":0.31053,"11.3-11.4":0.09949,"12.0-12.1":0.08743,"12.2-12.5":0.15979,"13.0-13.1":0,"13.2":0.00603,"13.3":0.00301,"13.4-13.7":0,"14.0-14.4":0.16582,"14.5-14.8":0.15677,"15.0-15.1":0.07236,"15.2-15.3":0.47634,"15.4":0.32862,"15.5":0.27134,"15.6-15.7":2.03803,"16.0":0.60297,"16.1":0.98887,"16.2":0.74768,"16.3":2.41187,"16.4":0.43414,"16.5":5.93018,"16.6":13.86523},P:{"4":0.2172,"20":0.05171,"21":0.09309,"5.0-5.4":0.02069,"6.2-6.4":0.04137,"7.2-7.4":0.05171,"8.2":0,"9.2":0,"10.1":0.01034,"11.1-11.2":0.01034,"12.0":0,"13.0":0.02069,"14.0":0.01034,"15.0":0.01034,"16.0":0.03103,"17.0":0.01034,"18.0":0.01034,"19.0":0.04137},I:{"0":0,"3":0.02245,"4":0.18278,"2.1":0.03207,"2.2":0.0962,"2.3":0.1443,"4.1":0.17957,"4.2-4.3":0.27256,"4.4":0,"4.4.3-4.4.4":0.70545},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.01456,"7":0.02911,"8":0.28626,"9":0.06793,"10":0.06307,"11":0.17952,"5.5":0.00485},S:{"2.5":0.01555,_:"3.0-3.1"},J:{"7":0,"10":0.04665},N:{"10":0.07464,"11":0.04976},L:{"0":41.63756},R:{_:"0"},M:{"0":0.2747},Q:{"13.1":0},O:{"0":0.2747},H:{"0":0.22572}};
+module.exports={C:{"2":0.00485,"3":0.02424,"4":0.00485,"5":0,"6":0.00485,"7":0,"8":0,"9":0,"10":0.00485,"11":0.00485,"12":0.00485,"13":0.00485,"14":0,"15":0.00485,"16":0.00485,"17":0.00485,"18":0,"19":0,"20":0,"21":0.00969,"22":0,"23":0.00485,"24":0.00969,"25":0,"26":0.00485,"27":0,"28":0,"29":0.00485,"30":0.00485,"31":0.00485,"32":0.00485,"33":0.00485,"34":0.00485,"35":0.00969,"36":0.00485,"37":0.00485,"38":0.00969,"39":0.00969,"40":0.02424,"41":0.00485,"42":0.00485,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00969,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01454,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00485,"109":0.02424,"110":0,"111":0,"112":0,"113":0,"114":0.00485,"115":0.07271,"116":0.05816,"117":0.32475,"118":0.07271,"119":0,"120":0,"3.5":0.00485,"3.6":0.02424},D:{"4":0.00485,"5":0,"6":0,"7":0.00485,"8":0,"9":0,"10":0.00485,"11":0.00485,"12":0.00485,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0.00485,"20":0,"21":0.00969,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0.00485,"28":0,"29":0.00485,"30":0.00485,"31":0.00969,"32":0.00485,"33":0.00485,"34":0.00485,"35":0.00485,"36":0.00485,"37":0.00969,"38":0.00485,"39":0.02424,"40":0.01939,"41":0.02424,"42":0.01939,"43":0.03878,"44":0.05816,"45":0.02908,"46":0.03878,"47":0.02908,"48":0,"49":0,"50":0,"51":0.03393,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.02908,"71":0,"72":0.01454,"73":0,"74":0,"75":0.03878,"76":0.02908,"77":0,"78":0,"79":0.00485,"80":0,"81":0,"83":0,"84":0.00485,"85":0,"86":0,"87":0,"88":0.00485,"89":0,"90":0,"91":0.03393,"92":0.00485,"93":0.0824,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00485,"100":0,"101":0,"102":0.00485,"103":0.10179,"104":0,"105":0.00485,"106":0,"107":0.02424,"108":2.51559,"109":0.47016,"110":0.00485,"111":0.00969,"112":0.01939,"113":0.02424,"114":0.09694,"115":0.18419,"116":8.23505,"117":2.05028,"118":0,"119":0.00485,"120":0},F:{"9":0,"11":0.00485,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00485,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00969,"31":0.01454,"32":0.00485,"33":0.00485,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00969,"73":0.00485,"74":0,"75":0,"76":0,"77":0.01454,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.02908,"101":0.07755,"102":0.10179,"9.5-9.6":0.00485,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00969},B:{"12":0.01939,"13":0,"14":0.01939,"15":0,"16":0.00485,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00485,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02908,"110":0,"111":0.00485,"112":0,"113":0.00969,"114":0.00969,"115":0.03393,"116":0.98394,"117":0.67858},E:{"4":0.01939,"5":0.00485,"6":0.00485,"7":0.00485,"8":0.00969,"9":0.0824,"10":0,"11":0,"12":0,"13":0,"14":0.05816,"15":0.00485,_:"0","3.1":0,"3.2":0,"5.1":0.00969,"6.1":0.00485,"7.1":0.00485,"9.1":0.06786,"10.1":0,"11.1":0,"12.1":0.00485,"13.1":0.01939,"14.1":0.01454,"15.1":0.02424,"15.2-15.3":0.01939,"15.4":0.04362,"15.5":0.03393,"15.6":0.47016,"16.0":0.03878,"16.1":0.06786,"16.2":0.02908,"16.3":0.1551,"16.4":0.07755,"16.5":0.28597,"16.6":1.19236,"17.0":0.10179,"17.1":0},G:{"8":0.01751,"3.2":0.00292,"4.0-4.1":0,"4.2-4.3":0.01167,"5.0-5.1":0.02334,"6.0-6.1":0.01459,"7.0-7.1":0.09921,"8.1-8.4":0.17216,"9.0-9.2":0.01459,"9.3":0.1634,"10.0-10.2":0,"10.3":0.09629,"11.0-11.2":0.43477,"11.3-11.4":0.11672,"12.0-12.1":0.11088,"12.2-12.5":0.20134,"13.0-13.1":0,"13.2":0,"13.3":0.00292,"13.4-13.7":0.00584,"14.0-14.4":0.13714,"14.5-14.8":0.11672,"15.0-15.1":0.06419,"15.2-15.3":0.49313,"15.4":0.33556,"15.5":0.35015,"15.6-15.7":2.03963,"16.0":0.69447,"16.1":0.7324,"16.2":0.57483,"16.3":2.27014,"16.4":0.18675,"16.5":0.82869,"16.6":16.53296,"17.0":1.91708,"17.1":0.00584},P:{"4":0.23139,"20":0.03155,"21":0.06311,"22":1.7775,"5.0-5.4":0.02104,"6.2-6.4":0.04207,"7.2-7.4":0.06311,"8.2":0,"9.2":0.01052,"10.1":0,"11.1-11.2":0.01052,"12.0":0,"13.0":0.01052,"14.0":0,"15.0":0,"16.0":0.02104,"17.0":0.01052,"18.0":0,"19.0":0.01052},I:{"0":0,"3":0.03521,"4":0.24966,"2.1":0.02881,"2.2":0.12163,"2.3":0.17604,"4.1":0.12163,"4.2-4.3":0.30087,"4.4":0,"4.4.3-4.4.4":0.71697},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.01538,"7":0.03076,"8":0.28705,"9":0.04613,"10":0.07176,"11":0.95856,"5.5":0},S:{"2.5":0.03607,_:"3.0-3.1"},J:{"7":0,"10":0.06184},N:{"10":0.08854,"11":0.05059},L:{"0":42.42877},R:{_:"0"},M:{"0":0.20612},Q:{"13.1":0},O:{"0":0.1649},H:{"0":0.20978}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CA.js
index 3712e26b89d503..5fa0d262f6ec75 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.011,"39":0,"40":0,"41":0,"42":0,"43":0.0055,"44":0.03851,"45":0.011,"46":0,"47":0,"48":0.0055,"49":0,"50":0,"51":0,"52":0.0165,"53":0,"54":0,"55":0,"56":0,"57":0.011,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.03301,"66":0,"67":0,"68":0.0055,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.0055,"78":0.02751,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.0055,"88":0.0055,"89":0,"90":0,"91":0.0055,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0055,"101":0,"102":0.03851,"103":0.0055,"104":0.0055,"105":0.0055,"106":0.0055,"107":0.011,"108":0.011,"109":0.02751,"110":0.0165,"111":0.011,"112":0.011,"113":0.022,"114":0.02751,"115":0.42908,"116":1.18822,"117":0.04401,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.0055,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.0055,"39":0,"40":0,"41":0,"42":0.0055,"43":0.0165,"44":0,"45":0,"46":0,"47":0.011,"48":0.09352,"49":0.04401,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.022,"61":0,"62":0,"63":0,"64":0,"65":0.0055,"66":0.022,"67":0.0055,"68":0.0055,"69":0.0055,"70":0.0055,"71":0.0055,"72":0.0055,"73":0,"74":0.0055,"75":0.0055,"76":0.011,"77":0.0055,"78":0.011,"79":0.02751,"80":0.011,"81":0.03301,"83":0.22554,"84":0.0055,"85":0.011,"86":0.04951,"87":0.02751,"88":0.07701,"89":0.0055,"90":0.011,"91":0.011,"92":0.0055,"93":0.03851,"94":0.0055,"95":0.0055,"96":0.0055,"97":0.0055,"98":0.0055,"99":0.011,"100":0.0165,"101":0.022,"102":0.0165,"103":0.20904,"104":0.02751,"105":0.04401,"106":0.03301,"107":0.04951,"108":0.08802,"109":0.71513,"110":0.04951,"111":0.07701,"112":0.10452,"113":0.15403,"114":1.33124,"115":9.13166,"116":4.14225,"117":0.0055,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0055,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.011,"72":0.0055,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.0055,"95":0.02751,"96":0,"97":0,"98":0,"99":0.011,"100":0.29705,"101":0.16503,"102":0.0055,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.0055,"13":0.0055,"14":0,"15":0,"16":0,"17":0,"18":0.0055,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.0055,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0055,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.0055,"104":0,"105":0.0055,"106":0.0055,"107":0.011,"108":0.011,"109":0.07701,"110":0.011,"111":0.011,"112":0.011,"113":0.022,"114":0.18703,"115":3.00905,"116":0.93517},E:{"4":0,"5":0,"6":0,"7":0,"8":0.0055,"9":0.0165,"10":0,"11":0,"12":0,"13":0.011,"14":0.06051,"15":0.011,"17":0.0165,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.0165,"10.1":0,"11.1":0.0055,"12.1":0.02751,"13.1":0.13202,"14.1":0.18153,"15.1":0.022,"15.2-15.3":0.022,"15.4":0.04401,"15.5":0.06601,"15.6":0.51709,"16.0":0.05501,"16.1":0.09902,"16.2":0.11552,"16.3":0.28055,"16.4":0.10452,"16.5":1.00668,"16.6":1.59529},G:{"8":0,"17":0.29575,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00389,"6.0-6.1":0,"7.0-7.1":0.01167,"8.1-8.4":0.01557,"9.0-9.2":0.01946,"9.3":0.16733,"10.0-10.2":0.00389,"10.3":0.17122,"11.0-11.2":0.0895,"11.3-11.4":0.03891,"12.0-12.1":0.02724,"12.2-12.5":0.75883,"13.0-13.1":0.01167,"13.2":0.01167,"13.3":0.03891,"13.4-13.7":0.09729,"14.0-14.4":0.21403,"14.5-14.8":0.52534,"15.0-15.1":0.15566,"15.2-15.3":0.1829,"15.4":0.18679,"15.5":0.3619,"15.6-15.7":2.67731,"16.0":0.98064,"16.1":2.62283,"16.2":1.17522,"16.3":2.39324,"16.4":0.32688,"16.5":7.21473,"16.6":18.11076},P:{"4":0.09637,"20":0.05354,"21":0.17132,"22":2.55904,"5.0-5.4":0.01071,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.01071,"11.1-11.2":0,"12.0":0,"13.0":0.01071,"14.0":0,"15.0":0,"16.0":0.02141,"17.0":0.02141,"18.0":0.01071,"19.0":0.02141},I:{"0":0,"3":0,"4":0.01971,"2.1":0,"2.2":0.02956,"2.3":0.00985,"4.1":0.01478,"4.2-4.3":0.03449,"4.4":0,"4.4.3-4.4.4":0.15765},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0123,"9":0.00615,"10":0,"11":0.08607,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.0045},N:{"10":0,"11":0},L:{"0":26.17721},R:{_:"0"},M:{"0":0.38691},Q:{"13.1":0.0045},O:{"0":0.10798},H:{"0":0.17463}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00551,"39":0,"40":0,"41":0,"42":0,"43":0.01101,"44":0.03304,"45":0.01101,"46":0,"47":0,"48":0.01101,"49":0,"50":0,"51":0,"52":0.01652,"53":0,"54":0,"55":0,"56":0,"57":0.01101,"58":0,"59":0.00551,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00551,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00551,"78":0.02202,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.01101,"88":0.00551,"89":0,"90":0,"91":0.00551,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00551,"101":0,"102":0.03854,"103":0.00551,"104":0.00551,"105":0.00551,"106":0.00551,"107":0.00551,"108":0.00551,"109":0.01652,"110":0.01101,"111":0.00551,"112":0.00551,"113":0.01652,"114":0.01652,"115":0.22024,"116":0.12113,"117":1.34346,"118":0.11563,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00551,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00551,"39":0,"40":0,"41":0,"42":0.00551,"43":0,"44":0,"45":0,"46":0,"47":0.01101,"48":0.0881,"49":0.04955,"50":0,"51":0,"52":0.00551,"53":0,"54":0,"55":0,"56":0,"57":0.00551,"58":0,"59":0,"60":0.04405,"61":0,"62":0,"63":0,"64":0,"65":0.00551,"66":0.02202,"67":0.00551,"68":0.00551,"69":0,"70":0,"71":0.00551,"72":0.00551,"73":0,"74":0.00551,"75":0.00551,"76":0.01101,"77":0.00551,"78":0.02753,"79":0.02202,"80":0.01101,"81":0.03304,"83":0.23125,"84":0.00551,"85":0.01101,"86":0.03854,"87":0.02753,"88":0.06607,"89":0.00551,"90":0.00551,"91":0.01101,"92":0.00551,"93":0.05506,"94":0.00551,"95":0.00551,"96":0.01101,"97":0.00551,"98":0.00551,"99":0.01101,"100":0.01652,"101":0.02202,"102":0.01652,"103":0.1872,"104":0.02202,"105":0.04405,"106":0.03304,"107":0.04405,"108":0.0881,"109":0.67724,"110":0.04405,"111":0.06607,"112":0.11563,"113":0.0936,"114":0.3634,"115":0.61667,"116":10.96245,"117":2.67592,"118":0.00551,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00551,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01652,"73":0.00551,"74":0,"75":0,"76":0,"77":0.01652,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03304,"96":0,"97":0,"98":0,"99":0.00551,"100":0.06057,"101":0.19271,"102":0.1872,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00551,"13":0.00551,"14":0,"15":0,"16":0,"17":0,"18":0.00551,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00551,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00551,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00551,"106":0.00551,"107":0.00551,"108":0.01101,"109":0.06607,"110":0.01101,"111":0.01101,"112":0.00551,"113":0.01101,"114":0.03854,"115":0.12113,"116":2.19689,"117":1.58022},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00551,"9":0.01652,"10":0,"11":0,"12":0,"13":0.01101,"14":0.06057,"15":0.01101,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01101,"10.1":0,"11.1":0.00551,"12.1":0.02753,"13.1":0.13765,"14.1":0.17619,"15.1":0.02202,"15.2-15.3":0.02202,"15.4":0.04955,"15.5":0.06607,"15.6":0.47902,"16.0":0.04955,"16.1":0.0936,"16.2":0.09911,"16.3":0.23676,"16.4":0.0936,"16.5":0.29732,"16.6":2.60434,"17.0":0.09911,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01171,"8.1-8.4":0.01562,"9.0-9.2":0.01562,"9.3":0.15229,"10.0-10.2":0.00781,"10.3":0.16401,"11.0-11.2":0.06248,"11.3-11.4":0.04295,"12.0-12.1":0.03124,"12.2-12.5":0.71851,"13.0-13.1":0.00781,"13.2":0.01171,"13.3":0.04686,"13.4-13.7":0.08591,"14.0-14.4":0.20696,"14.5-14.8":0.52326,"15.0-15.1":0.15229,"15.2-15.3":0.17572,"15.4":0.17572,"15.5":0.34754,"15.6-15.7":2.4523,"16.0":0.83566,"16.1":2.19848,"16.2":0.99967,"16.3":1.87437,"16.4":0.2343,"16.5":0.83956,"16.6":24.44105,"17.0":1.75332,"17.1":0.00781},P:{"4":0.10621,"20":0.04248,"21":0.12745,"22":2.55959,"5.0-5.4":0.01062,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.01062,"11.1-11.2":0.01062,"12.0":0,"13.0":0.01062,"14.0":0,"15.0":0,"16.0":0.02124,"17.0":0.02124,"18.0":0.01062,"19.0":0.02124},I:{"0":0,"3":0,"4":0.02461,"2.1":0,"2.2":0.03445,"2.3":0.01476,"4.1":0.01476,"4.2-4.3":0.03445,"4.4":0,"4.4.3-4.4.4":0.14765},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01239,"9":0.00619,"10":0,"11":0.08053,"5.5":0},S:{"2.5":0.00449,_:"3.0-3.1"},J:{"7":0,"10":0.00449},N:{"10":0,"11":0},L:{"0":26.17418},R:{_:"0"},M:{"0":0.44491},Q:{"13.1":0.00449},O:{"0":0.12134},H:{"0":0.19571}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CD.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CD.js
index 7c4491751e8e4a..237dd71b2de215 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CD.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CD.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00576,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00144,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00432,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00144,"113":0,"114":0.00288,"115":0.02304,"116":0.04464,"117":0.00144,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00144,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00288,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00144,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00144,"80":0,"81":0.00288,"83":0,"84":0,"85":0.00288,"86":0,"87":0.00144,"88":0.00144,"89":0,"90":0.00144,"91":0,"92":0.00144,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00432,"99":0.00288,"100":0,"101":0,"102":0.00144,"103":0.00288,"104":0.00144,"105":0.00144,"106":0.00144,"107":0.00144,"108":0.00144,"109":0.04176,"110":0.00288,"111":0.00144,"112":0.00144,"113":0.00288,"114":0.02304,"115":0.22608,"116":0.12528,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00288,"25":0,"26":0.00288,"27":0.00288,"28":0.00288,"29":0.00144,"30":0.00576,"31":0,"32":0.00432,"33":0.00288,"34":0,"35":0,"36":0.00432,"37":0.01296,"38":0.0072,"39":0,"40":0,"41":0,"42":0.0072,"43":0,"44":0,"45":0.00144,"46":0.00144,"47":0.00288,"48":0,"49":0,"50":0.00288,"51":0.0072,"52":0,"53":0,"54":0.00144,"55":0.00432,"56":0.00144,"57":0.00432,"58":0.01008,"60":0.07056,"62":0.00144,"63":0.11808,"64":0.02016,"65":0.00864,"66":0.06624,"67":0.06192,"68":0.03744,"69":0.20448,"70":0.11088,"71":0.31104,"72":0.10512,"73":0,"74":0.01872,"75":0.00432,"76":0.01584,"77":0.00144,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00432,"96":0,"97":0,"98":0,"99":0.00288,"100":0.01584,"101":0.04176,"102":0.00144,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.0072},B:{"12":0.00144,"13":0,"14":0,"15":0.00144,"16":0,"17":0.00144,"18":0.00432,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00288,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00144,"110":0.00288,"111":0,"112":0,"113":0.00144,"114":0.01152,"115":0.07632,"116":0.0216},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00144,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00144,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00144,"15.1":0,"15.2-15.3":0,"15.4":0.00432,"15.5":0,"15.6":0.00144,"16.0":0,"16.1":0,"16.2":0.00144,"16.3":0.00144,"16.4":0,"16.5":0.00288,"16.6":0.00288},G:{"8":0.0007,"17":0.04661,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00417,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00904,"10.0-10.2":0,"10.3":0.02157,"11.0-11.2":0.00417,"11.3-11.4":0.0007,"12.0-12.1":0.0153,"12.2-12.5":0.73046,"13.0-13.1":0.00557,"13.2":0.00626,"13.3":0.02504,"13.4-13.7":0.07166,"14.0-14.4":0.36593,"14.5-14.8":0.45776,"15.0-15.1":0.15235,"15.2-15.3":0.15653,"15.4":0.17253,"15.5":0.28662,"15.6-15.7":0.97256,"16.0":0.20314,"16.1":0.44524,"16.2":0.24349,"16.3":0.42089,"16.4":0.38054,"16.5":0.92456,"16.6":0.83134},P:{"4":0.0829,"20":0.0829,"21":0.10362,"5.0-5.4":0.03109,"6.2-6.4":0,"7.2-7.4":0.05181,"8.2":0,"9.2":0.04145,"10.1":0,"11.1-11.2":0.05181,"12.0":0,"13.0":0,"14.0":0,"15.0":0.01036,"16.0":0.02072,"17.0":0.01036,"18.0":0.03109,"19.0":0.03109},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00272,"4.2-4.3":0.00612,"4.4":0,"4.4.3-4.4.4":0.10125},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00576,"5.5":0},S:{"2.5":0.1284,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.90608},R:{_:"0"},M:{"0":0.0428},Q:{"13.1":0.00856},O:{"0":0.428},H:{"0":26.87305}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.02148,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0033,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01322,"116":0.00496,"117":0.05782,"118":0.00661,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00165,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00496,"41":0,"42":0,"43":0.00165,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00165,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00165,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00165,"80":0,"81":0.0033,"83":0,"84":0,"85":0,"86":0,"87":0.00165,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00496,"99":0.00165,"100":0,"101":0,"102":0.00165,"103":0.00165,"104":0,"105":0.00165,"106":0.00165,"107":0.00165,"108":0.00165,"109":0.05452,"110":0.00661,"111":0.0033,"112":0.00165,"113":0.0033,"114":0.00496,"115":0.01156,"116":0.27588,"117":0.07599,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00496,"25":0,"26":0.0033,"27":0.00165,"28":0.00661,"29":0,"30":0.01156,"31":0.00165,"32":0.00661,"33":0.00496,"34":0,"35":0,"36":0.00165,"37":0.02808,"38":0.00661,"39":0,"40":0,"41":0,"42":0.00661,"43":0,"44":0,"45":0.00165,"46":0.00165,"47":0.00496,"48":0,"49":0,"50":0.0033,"51":0.00661,"52":0,"53":0,"54":0.0033,"55":0.0033,"56":0,"57":0.00496,"58":0.01322,"60":0.0859,"62":0.00165,"63":0.14538,"64":0.00991,"65":0.00661,"66":0.08921,"67":0.06773,"68":0.03304,"69":0.19824,"70":0.08921,"71":0.3684,"72":0.31553,"73":0.05121,"74":0.00826,"75":0.00165,"76":0.00661,"77":0.01652,"78":0.00165,"79":0.0033,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00661,"96":0,"97":0,"98":0,"99":0.00165,"100":0,"101":0.03469,"102":0.02974,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00496},B:{"12":0.00165,"13":0.00165,"14":0,"15":0.00165,"16":0,"17":0.00165,"18":0.0033,"79":0,"80":0,"81":0,"83":0,"84":0.00165,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0033,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00165,"110":0.00165,"111":0,"112":0,"113":0.00165,"114":0.0033,"115":0.00826,"116":0.08921,"117":0.05121},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00165,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00165,"13.1":0,"14.1":0.00165,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00165,"16.0":0,"16.1":0,"16.2":0.00165,"16.3":0.00165,"16.4":0,"16.5":0.00165,"16.6":0.00826,"17.0":0,"17.1":0},G:{"8":0.00399,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00798,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00638,"10.0-10.2":0,"10.3":0.02154,"11.0-11.2":0.00239,"11.3-11.4":0,"12.0-12.1":0.01995,"12.2-12.5":0.70933,"13.0-13.1":0.00319,"13.2":0.00319,"13.3":0.02234,"13.4-13.7":0.12766,"14.0-14.4":0.27847,"14.5-14.8":0.48193,"15.0-15.1":0.15479,"15.2-15.3":0.24575,"15.4":0.24176,"15.5":0.36863,"15.6-15.7":1.1753,"16.0":0.32873,"16.1":0.4939,"16.2":0.27847,"16.3":0.43964,"16.4":0.43645,"16.5":0.59204,"16.6":1.17371,"17.0":0.33352,"17.1":0},P:{"4":0.10292,"20":0.07204,"21":0.07204,"22":0.23672,"5.0-5.4":0.02058,"6.2-6.4":0,"7.2-7.4":0.05146,"8.2":0,"9.2":0.04117,"10.1":0,"11.1-11.2":0.06175,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.02058,"17.0":0.01029,"18.0":0.03088,"19.0":0.03088},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00116,"4.2-4.3":0.00578,"4.4":0,"4.4.3-4.4.4":0.07628},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00826,"5.5":0},S:{"2.5":0.10018,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":68.71647},R:{_:"0"},M:{"0":0.03339},Q:{"13.1":0.0167},O:{"0":0.32557},H:{"0":16.88945}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CF.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CF.js
index 2f32c3dca62ed5..1bc740ba0c6d51 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CF.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CF.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00138,"52":0,"53":0,"54":0,"55":0,"56":0.00276,"57":0,"58":0,"59":0,"60":0,"61":0.00414,"62":0,"63":0.00138,"64":0.00138,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00138,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00138,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00829,"102":0.00691,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00138,"114":0.00414,"115":0.04834,"116":0.1961,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00138,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.0221,"61":0,"62":0.00138,"63":0,"64":0,"65":0,"66":0.00138,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00138,"80":0,"81":0.00138,"83":0,"84":0.00138,"85":0,"86":0.00967,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00276,"93":0,"94":0,"95":0.00138,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00552,"106":0,"107":0,"108":0,"109":0.01657,"110":0.00967,"111":0,"112":0.00138,"113":0.00967,"114":0.01519,"115":0.27482,"116":0.14086,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00138,"51":0,"52":0,"53":0,"54":0,"55":0.00829,"56":0,"57":0,"58":0,"60":0.00138,"62":0,"63":0.00691,"64":0.00138,"65":0,"66":0.00552,"67":0.00829,"68":0.00414,"69":0.01243,"70":0.00138,"71":0.02072,"72":0.01243,"73":0.0221,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00276,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00138,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00276,"101":0.00829,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00138},B:{"12":0.00138,"13":0,"14":0.02072,"15":0.00138,"16":0,"17":0,"18":0.00276,"79":0,"80":0,"81":0,"83":0.00414,"84":0.00138,"85":0.00138,"86":0,"87":0,"88":0.00691,"89":0.00276,"90":0,"91":0,"92":0.00138,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00276,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00829,"110":0,"111":0.00138,"112":0,"113":0.00138,"114":0.02348,"115":0.12567,"116":0.05938},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00276,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00138,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00276,"16.0":0,"16.1":0.00138,"16.2":0,"16.3":0,"16.4":0.00138,"16.5":0.00138,"16.6":0},G:{"8":0,"17":0.00466,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00123,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.00245,"12.2-12.5":0.07558,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.00466,"14.0-14.4":0.05301,"14.5-14.8":0.08245,"15.0-15.1":0.02822,"15.2-15.3":0.0238,"15.4":0.05669,"15.5":0.03656,"15.6-15.7":1.02453,"16.0":0.03313,"16.1":0.2503,"16.2":0.0189,"16.3":0.08736,"16.4":0.11558,"16.5":0.36588,"16.6":0.18895},P:{"4":0.29161,"20":0.16089,"21":0.26144,"5.0-5.4":0.50278,"6.2-6.4":0,"7.2-7.4":0.08044,"8.2":0,"9.2":0.01006,"10.1":0,"11.1-11.2":0.01006,"12.0":0.05028,"13.0":0,"14.0":0,"15.0":0.01006,"16.0":0,"17.0":0.04022,"18.0":0.05028,"19.0":0.03017},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00698,"4.2-4.3":0.01397,"4.4":0,"4.4.3-4.4.4":0.06186},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01105,"5.5":0},S:{"2.5":0.29305,_:"3.0-3.1"},J:{"7":0,"10":0.01724},N:{"10":0,"11":0},L:{"0":70.44355},R:{_:"0"},M:{"0":0.09481},Q:{"13.1":0.01724},O:{"0":0.31028},H:{"0":19.13499}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00182,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00182,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00728,"62":0,"63":0,"64":0,"65":0,"66":0.00182,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00364,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00182,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00182,"115":0.05278,"116":0.03094,"117":0.36946,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00546,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00364,"50":0,"51":0,"52":0.00182,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.02366,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.01274,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.01092,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00364,"101":0.00182,"102":0.00182,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0273,"110":0.00182,"111":0,"112":0.00546,"113":0.00182,"114":0.0091,"115":0.04186,"116":0.6279,"117":0.06006,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00182,"52":0,"53":0,"54":0,"55":0.00546,"56":0,"57":0,"58":0.00182,"60":0.01456,"62":0,"63":0.0091,"64":0,"65":0,"66":0.00546,"67":0.00364,"68":0.00182,"69":0.00728,"70":0.00182,"71":0.02002,"72":0.0546,"73":0.00364,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00546,"93":0,"94":0,"95":0.00364,"96":0,"97":0,"98":0,"99":0.00546,"100":0,"101":0.02366,"102":0.00546,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00728},B:{"12":0.00182,"13":0,"14":0.00364,"15":0,"16":0,"17":0.00364,"18":0.00364,"79":0,"80":0,"81":0,"83":0.01274,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00182,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02548,"110":0,"111":0,"112":0.00364,"113":0,"114":0.00546,"115":0.00546,"116":0.10192,"117":0.01638},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00728,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00182,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00182,"16.0":0,"16.1":0.00182,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0.00182,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.03922,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00357,"10.0-10.2":0.00963,"10.3":0.00357,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.47956,"13.0-13.1":0,"13.2":0.00357,"13.3":0.00606,"13.4-13.7":0.05491,"14.0-14.4":0.06988,"14.5-14.8":0.07594,"15.0-15.1":0.06133,"15.2-15.3":0.0271,"15.4":0.04279,"15.5":0.00998,"15.6-15.7":0.80972,"16.0":0.26385,"16.1":0.15474,"16.2":0.03173,"16.3":0.12158,"16.4":0.07238,"16.5":0.38543,"16.6":0.56299,"17.0":0.2724,"17.1":0},P:{"4":0.53298,"20":0.0205,"21":0.07175,"22":0.13325,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.041,"8.2":0,"9.2":0.01025,"10.1":0,"11.1-11.2":0.01025,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.0205,"17.0":0,"18.0":0,"19.0":0.01025},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00474,"4.2-4.3":0.00355,"4.4":0,"4.4.3-4.4.4":0.09085},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00182,"5.5":0},S:{"2.5":0.39264,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":81.07062},R:{_:"0"},M:{"0":0.05726},Q:{"13.1":0},O:{"0":0.09816},H:{"0":9.37834}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CG.js
index ed30a1dd655818..c338ea177ff208 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CG.js
@@ -1 +1 @@
-module.exports={C:{"31":0.00542,"114":0.02167,"115":0.56347,"116":1.48453,"117":0.02167,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 118 119 120 3.5 3.6"},D:{"11":0.03251,"47":0.00542,"65":0.00542,"67":0.01625,"68":0.01084,"69":0.01625,"73":0.03793,"76":0.03251,"79":0.01625,"81":0.02709,"83":0.01625,"84":0.01625,"86":0.03793,"87":0.08669,"89":0.01084,"91":0.01084,"93":0.03251,"95":0.03793,"98":0.01625,"102":0.01625,"103":0.02709,"104":0.02167,"106":0.00542,"108":0.00542,"109":1.46286,"110":0.00542,"111":0.00542,"112":0.04334,"113":0.02167,"114":0.17879,"115":13.63711,"116":11.50783,"117":0.01084,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 66 70 71 72 74 75 77 78 80 85 88 90 92 94 96 97 99 100 101 105 107 118 119"},F:{"28":0.02709,"58":0.01084,"79":0.02167,"85":0.01625,"95":0.14087,"99":0.02167,"100":0.17879,"101":0.80728,"102":0.01084,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 82 83 84 86 87 88 89 90 91 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.01084,"18":0.01084,"92":0.01625,"108":0.01084,"109":0.08127,"111":0.00542,"112":0.02167,"113":0.01625,"114":0.0596,"115":8.21911,"116":4.10143,_:"13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 110"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 17 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 14.1 15.1 15.2-15.3 15.4 15.5 16.0 16.1 16.4","13.1":0.14629,"15.6":0.02709,"16.2":0.01625,"16.3":0.02709,"16.5":0.00542,"16.6":0.01084},G:{"8":0.00418,"17":0.03967,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00278,"6.0-6.1":0,"7.0-7.1":0.02227,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01809,"10.0-10.2":0.00139,"10.3":0.16842,"11.0-11.2":0.00139,"11.3-11.4":0.01461,"12.0-12.1":0.03828,"12.2-12.5":1.56725,"13.0-13.1":0,"13.2":0,"13.3":0.00278,"13.4-13.7":0.03201,"14.0-14.4":0.09465,"14.5-14.8":0.25402,"15.0-15.1":0.17329,"15.2-15.3":0.07516,"15.4":0.02853,"15.5":0.16424,"15.6-15.7":2.30703,"16.0":0.04802,"16.1":0.12388,"16.2":0.06472,"16.3":0.35284,"16.4":0.11205,"16.5":0.56858,"16.6":0.67993},P:{"4":0.085,"20":0.02428,"21":0.06071,"5.0-5.4":0.03109,"6.2-6.4":0,"7.2-7.4":0.13357,"8.2":0,"9.2":0.04145,"10.1":0,"11.1-11.2":0.05181,"12.0":0,"13.0":0,"14.0":0,"15.0":0.01036,"16.0":0.02072,"17.0":0.01036,"18.0":0.03109,"19.0":0.01214},I:{"0":0,"3":0,"4":0,"2.1":0.00004,"2.2":0,"2.3":0,"4.1":0.0018,"4.2-4.3":0.00223,"4.4":0,"4.4.3-4.4.4":0.03717},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"11":0.01084,_:"6 7 8 9 10 5.5"},S:{"2.5":0.15121,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":47.46301},R:{_:"0"},M:{"0":0.02749},Q:{"13.1":0.00916},O:{"0":0.19244},H:{"0":0.63334}};
+module.exports={C:{"114":0.0159,"115":0.31276,"116":0.04241,"117":1.16622,"118":0.12192,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 119 120 3.5 3.6"},D:{"11":0.03181,"68":0.0053,"69":0.0159,"73":0.05301,"76":0.0053,"79":0.0212,"81":0.0053,"83":0.0106,"84":0.0053,"86":0.02651,"87":0.04241,"89":0.0106,"91":0.02651,"92":0.0053,"93":0.04241,"95":0.02651,"98":0.0159,"101":0.0053,"102":0.0106,"103":0.02651,"104":0.04771,"106":0.0106,"108":0.0106,"109":1.49488,"110":0.0159,"112":0.04771,"113":0.0159,"114":0.12722,"115":0.18023,"116":17.85907,"117":6.38771,"118":0.0053,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 70 71 72 74 75 77 78 80 85 88 90 94 96 97 99 100 105 107 111 119 120"},F:{"28":0.0106,"42":0.0106,"79":0.0212,"85":0.0053,"90":0.0212,"95":0.11662,"101":0.5036,"102":0.49829,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 82 83 84 86 87 88 89 91 92 93 94 96 97 98 99 100 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.0053,"14":0.0053,"18":0.0159,"90":0.0106,"92":0.0106,"109":0.06891,"111":0.0106,"112":0.0159,"114":0.03711,"115":0.14313,"116":7.18816,"117":4.38393,_:"13 15 16 17 79 80 81 83 84 85 86 87 88 89 91 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 110 113"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 14.1 15.1 15.2-15.3 15.4 15.5 16.0 16.1 16.3 16.4 16.5 17.0 17.1","13.1":0.19614,"15.6":0.04771,"16.2":0.0159,"16.6":0.04241},G:{"8":0.00162,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00081,"6.0-6.1":0,"7.0-7.1":0.01461,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01624,"10.0-10.2":0,"10.3":0.12827,"11.0-11.2":0.00162,"11.3-11.4":0,"12.0-12.1":0.03978,"12.2-12.5":1.75192,"13.0-13.1":0.00325,"13.2":0.00162,"13.3":0.01055,"13.4-13.7":0.02679,"14.0-14.4":0.0893,"14.5-14.8":0.21838,"15.0-15.1":0.19971,"15.2-15.3":0.0755,"15.4":0.04059,"15.5":0.17454,"15.6-15.7":2.84383,"16.0":0.06008,"16.1":0.09174,"16.2":0.07225,"16.3":0.29388,"16.4":0.08605,"16.5":0.39698,"16.6":1.08135,"17.0":0.30362,"17.1":0.00568},P:{"4":0.1781,"20":0.07204,"21":0.02544,"22":0.19083,"5.0-5.4":0.02058,"6.2-6.4":0,"7.2-7.4":0.12722,"8.2":0,"9.2":0.04117,"10.1":0,"11.1-11.2":0.06175,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.02058,"17.0":0.01029,"18.0":0.03088,"19.0":0.03088},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00048,"4.2-4.3":0.00208,"4.4":0,"4.4.3-4.4.4":0.01624},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{_:"6 7 8 9 10 11 5.5"},S:{"2.5":0.16916,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.46325},R:{_:"0"},M:{"0":0.0235},Q:{"13.1":0},O:{"0":0.12687},H:{"0":0.52495}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CH.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CH.js
index 1017a7898ff0de..504e64c76ac43a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CH.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CH.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00667,"49":0,"50":0,"51":0,"52":0.02666,"53":0,"54":0,"55":0.00667,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00667,"76":0,"77":0,"78":0.05333,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00667,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00667,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00667,"99":0.00667,"100":0,"101":0.00667,"102":0.18665,"103":0.00667,"104":0,"105":0.00667,"106":0.00667,"107":0.00667,"108":0.01333,"109":0.02,"110":0.00667,"111":0.01333,"112":0.01333,"113":0.12665,"114":0.04666,"115":0.93991,"116":2.83305,"117":0.08666,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00667,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01333,"50":0.00667,"51":0,"52":0.09999,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.04666,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.07999,"80":0.00667,"81":0.00667,"83":0,"84":0.01333,"85":0.01333,"86":0.01333,"87":0.02666,"88":0.00667,"89":0.01333,"90":0.01333,"91":0.00667,"92":0.00667,"93":0.00667,"94":0,"95":0.00667,"96":0.00667,"97":0.00667,"98":0.00667,"99":0.02,"100":0.02,"101":0.02666,"102":0.02,"103":0.13999,"104":0.02,"105":0.01333,"106":0.01333,"107":0.02666,"108":0.04666,"109":0.85325,"110":0.02666,"111":0.04666,"112":0.10666,"113":0.22664,"114":1.86648,"115":13.6453,"116":5.53945,"117":0.00667,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00667,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00667,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00667,"85":0,"86":0,"87":0,"88":0,"89":0.00667,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02,"96":0,"97":0,"98":0,"99":0.03333,"100":0.32663,"101":0.3333,"102":0.00667,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00667,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00667,"91":0,"92":0.00667,"93":0,"94":0,"95":0,"96":0.00667,"97":0.00667,"98":0,"99":0.00667,"100":0.00667,"101":0,"102":0.00667,"103":0.02,"104":0,"105":0.01333,"106":0.00667,"107":0.01333,"108":0.04,"109":0.15332,"110":0.03333,"111":0.01333,"112":0.05333,"113":0.05999,"114":0.77326,"115":7.39926,"116":2.11312},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00667,"10":0,"11":0,"12":0,"13":0.00667,"14":0.04666,"15":0.01333,"17":0.02666,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00667,"12.1":0.06666,"13.1":0.16665,"14.1":0.20665,"15.1":0.02666,"15.2-15.3":0.03333,"15.4":0.04666,"15.5":0.07999,"15.6":0.49328,"16.0":0.06666,"16.1":0.10666,"16.2":0.12665,"16.3":0.33997,"16.4":0.15332,"16.5":1.0399,"16.6":1.35986},G:{"8":0,"17":0.19432,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00294,"7.0-7.1":0.00589,"8.1-8.4":0.00589,"9.0-9.2":0.30326,"9.3":0.13543,"10.0-10.2":0.00294,"10.3":0.08538,"11.0-11.2":0.02355,"11.3-11.4":0.05594,"12.0-12.1":0.01767,"12.2-12.5":0.4063,"13.0-13.1":0.00294,"13.2":0.00294,"13.3":0.03533,"13.4-13.7":0.053,"14.0-14.4":0.1531,"14.5-14.8":0.28853,"15.0-15.1":0.13543,"15.2-15.3":0.1796,"15.4":0.15016,"15.5":0.29442,"15.6-15.7":1.72826,"16.0":0.94804,"16.1":1.84898,"16.2":0.91566,"16.3":1.69588,"16.4":0.58001,"16.5":6.33599,"16.6":12.83096},P:{"4":0.10269,"20":0.06161,"21":0.267,"22":2.64944,"5.0-5.4":0.02054,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.01027,"13.0":0.01027,"14.0":0.01027,"15.0":0,"16.0":0.01027,"17.0":0.02054,"18.0":0.01027,"19.0":0.03081},I:{"0":0,"3":0,"4":0.00881,"2.1":0,"2.2":0.0044,"2.3":0.00587,"4.1":0.04111,"4.2-4.3":0.01321,"4.4":0,"4.4.3-4.4.4":0.04992},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01436,"9":0,"10":0,"11":0.07897,"5.5":0},S:{"2.5":0.00333,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":19.98167},R:{_:"0"},M:{"0":0.56678},Q:{"13.1":0},O:{"0":0.05001},H:{"0":0.19885}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00613,"49":0,"50":0,"51":0,"52":0.03066,"53":0,"54":0,"55":0.00613,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00613,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00613,"76":0,"77":0,"78":0.04906,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00613,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00613,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.01226,"99":0.00613,"100":0,"101":0,"102":0.19622,"103":0.00613,"104":0,"105":0.00613,"106":0.00613,"107":0.01226,"108":0.01226,"109":0.0184,"110":0.01226,"111":0.00613,"112":0.00613,"113":0.11038,"114":0.02453,"115":0.42924,"116":0.19009,"117":3.13958,"118":0.3066,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0.00613,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00613,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0184,"50":0,"51":0.00613,"52":0.19622,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.04906,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00613,"77":0,"78":0.00613,"79":0.04292,"80":0.00613,"81":0.01226,"83":0,"84":0.01226,"85":0.0184,"86":0.01226,"87":0.03066,"88":0,"89":0.01226,"90":0.00613,"91":0.01226,"92":0.00613,"93":0.00613,"94":0,"95":0.00613,"96":0.00613,"97":0.00613,"98":0.00613,"99":0.01226,"100":0.01226,"101":0.02453,"102":0.0184,"103":0.09811,"104":0.02453,"105":0.01226,"106":0.01226,"107":0.0184,"108":0.03679,"109":0.71744,"110":0.03066,"111":0.02453,"112":0.05519,"113":0.06745,"114":0.3066,"115":0.85235,"116":12.28853,"117":2.67355,"118":0.00613,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00613,"73":0,"74":0,"75":0,"76":0,"77":0.02453,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00613,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0184,"96":0,"97":0,"98":0,"99":0.0184,"100":0.09198,"101":0.33726,"102":0.61933,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00613,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00613,"93":0,"94":0,"95":0.00613,"96":0,"97":0.00613,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00613,"106":0.00613,"107":0.01226,"108":0.01226,"109":0.12877,"110":0.04906,"111":0.00613,"112":0.03066,"113":0.02453,"114":0.11651,"115":0.37405,"116":4.66032,"117":2.69195},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00613,"10":0,"11":0,"12":0,"13":0.01226,"14":0.05519,"15":0.01226,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00613,"12.1":0.07358,"13.1":0.14717,"14.1":0.18396,"15.1":0.02453,"15.2-15.3":0.04292,"15.4":0.04292,"15.5":0.07358,"15.6":0.48443,"16.0":0.06745,"16.1":0.11651,"16.2":0.1349,"16.3":0.325,"16.4":0.1349,"16.5":0.41698,"16.6":2.37922,"17.0":0.12877,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00341,"6.0-6.1":0,"7.0-7.1":0.00682,"8.1-8.4":0.00682,"9.0-9.2":0.57314,"9.3":0.11599,"10.0-10.2":0.00341,"10.3":0.0887,"11.0-11.2":0.0307,"11.3-11.4":0.06482,"12.0-12.1":0.01706,"12.2-12.5":0.40939,"13.0-13.1":0.00341,"13.2":0,"13.3":0.08188,"13.4-13.7":0.05458,"14.0-14.4":0.16034,"14.5-14.8":0.28657,"15.0-15.1":0.10917,"15.2-15.3":0.19446,"15.4":0.15693,"15.5":0.33433,"15.6-15.7":1.84565,"16.0":1.1531,"16.1":1.78424,"16.2":0.91429,"16.3":1.6853,"16.4":0.47762,"16.5":1.16334,"16.6":19.74263,"17.0":2.26868,"17.1":0.00682},P:{"4":0.062,"20":0.062,"21":0.16534,"22":3.07945,"5.0-5.4":0.02067,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.01033,"13.0":0.01033,"14.0":0,"15.0":0.01033,"16.0":0.01033,"17.0":0.01033,"18.0":0.01033,"19.0":0.031},I:{"0":0,"3":0,"4":0.01504,"2.1":0.00215,"2.2":0.0086,"2.3":0.01289,"4.1":0.01934,"4.2-4.3":0.01719,"4.4":0,"4.4.3-4.4.4":0.07092},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01226,"9":0,"10":0,"11":0.07358,"5.5":0},S:{"2.5":0.00387,_:"3.0-3.1"},J:{"7":0,"10":0.00387},N:{"10":0,"11":0},L:{"0":21.89036},R:{_:"0"},M:{"0":0.6885},Q:{"13.1":0},O:{"0":0.04255},H:{"0":0.22704}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CI.js
index e4790ccacdf7a8..e3586d5efdc6e0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00868,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00579,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00579,"101":0,"102":0.00868,"103":0,"104":0,"105":0.00289,"106":0,"107":0,"108":0.00289,"109":0,"110":0.00289,"111":0,"112":0.00579,"113":0.00289,"114":0.00868,"115":0.11861,"116":0.31823,"117":0.01447,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00289,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00868,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00289,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00579,"50":0.00289,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00289,"64":0.00289,"65":0,"66":0,"67":0.00289,"68":0,"69":0.00289,"70":0.00579,"71":0,"72":0.00579,"73":0.00289,"74":0,"75":0.00289,"76":0.00289,"77":0.00289,"78":0,"79":0.01447,"80":0.00289,"81":0.01447,"83":0.00289,"84":0,"85":0.00289,"86":0.00579,"87":0.07233,"88":0.01157,"89":0.00579,"90":0.00289,"91":0.00289,"92":0.00289,"93":0.00579,"94":0.02025,"95":0.01157,"96":0.00289,"97":0.00868,"98":0.00289,"99":0.01447,"100":0.00579,"101":0.00579,"102":0.01447,"103":0.02025,"104":0.01736,"105":0.02025,"106":0.01157,"107":0.01157,"108":0.02604,"109":0.75797,"110":0.00579,"111":0.00579,"112":0.02025,"113":0.01736,"114":0.11283,"115":2.43591,"116":1.33946,"117":0.00289,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00289,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00868,"62":0,"63":0.00289,"64":0,"65":0.00289,"66":0.00579,"67":0.00289,"68":0.00289,"69":0.00868,"70":0.02314,"71":0.04629,"72":0.03182,"73":0,"74":0,"75":0,"76":0.00289,"77":0,"78":0,"79":0.00289,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00579,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01447,"96":0,"97":0,"98":0,"99":0.00289,"100":0.02893,"101":0.13597,"102":0.00289,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00289,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00289,"79":0,"80":0,"81":0,"83":0,"84":0.00289,"85":0.00289,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01157,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00579,"108":0,"109":0.00579,"110":0.00289,"111":0,"112":0,"113":0.00579,"114":0.01736,"115":0.55835,"116":0.22276},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00289,"15":0.00289,"17":0.00289,_:"0","3.1":0,"3.2":0,"5.1":0.00289,"6.1":0,"7.1":0.00868,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00868,"14.1":0.01157,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00289,"15.6":0.02893,"16.0":0.00289,"16.1":0.00289,"16.2":0.00289,"16.3":0.00579,"16.4":0.00289,"16.5":0.02314,"16.6":0.02314},G:{"8":0.0083,"17":0.1806,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01661,"8.1-8.4":0,"9.0-9.2":0.00623,"9.3":0.0602,"10.0-10.2":0,"10.3":0.13078,"11.0-11.2":0.08926,"11.3-11.4":0.02491,"12.0-12.1":0.25949,"12.2-12.5":2.75887,"13.0-13.1":0.01868,"13.2":0,"13.3":0.06228,"13.4-13.7":0.20136,"14.0-14.4":0.85942,"14.5-14.8":0.6373,"15.0-15.1":0.60824,"15.2-15.3":0.42971,"15.4":0.21174,"15.5":0.33837,"15.6-15.7":3.19273,"16.0":0.97567,"16.1":1.094,"16.2":0.59163,"16.3":1.17703,"16.4":0.67051,"16.5":2.62808,"16.6":3.51864},P:{"4":0.04133,"20":0.07233,"21":0.24799,"5.0-5.4":0.01033,"6.2-6.4":0,"7.2-7.4":0.19632,"8.2":0,"9.2":0.02067,"10.1":0,"11.1-11.2":0.01033,"12.0":0,"13.0":0.01033,"14.0":0.01033,"15.0":0.01033,"16.0":0.05166,"17.0":0.02067,"18.0":0.04133,"19.0":0.05166},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.00153,"4.1":0.00153,"4.2-4.3":0.00254,"4.4":0,"4.4.3-4.4.4":0.08491},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00868,"5.5":0},S:{"2.5":0.01421,_:"3.0-3.1"},J:{"7":0,"10":0.0995},N:{"10":0,"11":0},L:{"0":66.93656},R:{_:"0"},M:{"0":0.12082},Q:{"13.1":0.02843},O:{"0":0.14925},H:{"0":1.98489}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00252,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00252,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00252,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00252,"101":0,"102":0.00504,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00504,"109":0.00252,"110":0.00252,"111":0.00252,"112":0.00252,"113":0.00252,"114":0.00252,"115":0.06053,"116":0.01765,"117":0.23455,"118":0.02018,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00757,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01009,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00252,"65":0,"66":0,"67":0.00252,"68":0,"69":0,"70":0.00252,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00504,"78":0,"79":0.01261,"80":0.00252,"81":0.01261,"83":0.00504,"84":0,"85":0.00252,"86":0,"87":0.05801,"88":0.00504,"89":0.01009,"90":0.00252,"91":0.00757,"92":0.00252,"93":0.00252,"94":0.00757,"95":0.00757,"96":0.00252,"97":0.00504,"98":0.00504,"99":0.00504,"100":0.00504,"101":0.00504,"102":0.01009,"103":0.01261,"104":0.01513,"105":0.00504,"106":0.01009,"107":0.01261,"108":0.01765,"109":0.60276,"110":0.00252,"111":0.00504,"112":0.00504,"113":0.01009,"114":0.03026,"115":0.07566,"116":1.9722,"117":0.54475,"118":0,"119":0.00252,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00252,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.01765,"62":0,"63":0.00252,"64":0,"65":0.00252,"66":0.00504,"67":0.00252,"68":0.00252,"69":0.00504,"70":0.00504,"71":0.05548,"72":0.03531,"73":0.00504,"74":0.00757,"75":0,"76":0.00252,"77":0.00504,"78":0.00252,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00504,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01261,"96":0,"97":0,"98":0,"99":0,"100":0.00504,"101":0.06809,"102":0.06557,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00252,"16":0,"17":0,"18":0.00504,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00252,"86":0,"87":0.00252,"88":0,"89":0,"90":0.00252,"91":0,"92":0.01009,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00504,"106":0,"107":0.00252,"108":0,"109":0.00504,"110":0,"111":0,"112":0.00504,"113":0.00252,"114":0.00504,"115":0.01513,"116":0.33543,"117":0.23707},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00504,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0.00252,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00757,"14.1":0.01009,"15.1":0,"15.2-15.3":0,"15.4":0.00252,"15.5":0.00252,"15.6":0.01513,"16.0":0,"16.1":0.00252,"16.2":0.00252,"16.3":0.00504,"16.4":0.00252,"16.5":0.00757,"16.6":0.02018,"17.0":0.00504,"17.1":0},G:{"8":0.0086,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00215,"6.0-6.1":0.0086,"7.0-7.1":0.03654,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03439,"10.0-10.2":0,"10.3":0.09457,"11.0-11.2":0.06663,"11.3-11.4":0.01719,"12.0-12.1":0.25791,"12.2-12.5":2.95738,"13.0-13.1":0.03224,"13.2":0.00645,"13.3":0.04299,"13.4-13.7":0.18484,"14.0-14.4":0.89194,"14.5-14.8":0.88764,"15.0-15.1":0.56096,"15.2-15.3":0.55236,"15.4":0.16334,"15.5":0.25791,"15.6-15.7":3.3507,"16.0":0.79952,"16.1":0.85326,"16.2":0.52442,"16.3":0.92633,"16.4":0.5803,"16.5":1.31105,"16.6":4.51774,"17.0":1.38842,"17.1":0},P:{"4":0.06145,"20":0.04097,"21":0.15362,"22":0.74764,"5.0-5.4":0.01024,"6.2-6.4":0,"7.2-7.4":0.20483,"8.2":0,"9.2":0.01024,"10.1":0,"11.1-11.2":0.02048,"12.0":0,"13.0":0,"14.0":0.02048,"15.0":0,"16.0":0.05121,"17.0":0.01024,"18.0":0.03072,"19.0":0.05121},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0013,"4.4":0,"4.4.3-4.4.4":0.05644},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00252,"5.5":0},S:{"2.5":0.01496,_:"3.0-3.1"},J:{"7":0,"10":0.05982},N:{"10":0,"11":0},L:{"0":69.48656},R:{_:"0"},M:{"0":0.10469},Q:{"13.1":0.00748},O:{"0":0.12713},H:{"0":1.3947}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CK.js
index e4dad3329780ee..948d4b8610ad49 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CK.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00361,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.01082,"113":0,"114":0.01082,"115":0.08657,"116":0.32463,"117":0.00721,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.02525,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00361,"83":0.01443,"84":0,"85":0,"86":0,"87":0.00361,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00361,"94":0.01082,"95":0,"96":0,"97":0,"98":0.01082,"99":0,"100":0,"101":0,"102":0,"103":0.00361,"104":0,"105":0.01804,"106":0.01082,"107":0,"108":0,"109":0.22003,"110":0.01443,"111":0.07575,"112":0.00361,"113":0.00361,"114":0.33545,"115":5.99483,"116":3.90277,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.02525,"72":0.01443,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00361,"100":0.04328,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00361,"110":0.01804,"111":0,"112":0,"113":0.00721,"114":0.01804,"115":0.64565,"116":0.19478},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.03607,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.04328,"15.1":0,"15.2-15.3":0.01082,"15.4":0.00721,"15.5":0.00721,"15.6":0.06853,"16.0":0,"16.1":0.02164,"16.2":0.02886,"16.3":0.0505,"16.4":0.00721,"16.5":0.17314,"16.6":0.20199},G:{"8":0,"17":0.05065,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00675,"10.0-10.2":0,"10.3":0,"11.0-11.2":0.00675,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.09454,"13.0-13.1":0.04052,"13.2":0,"13.3":0,"13.4-13.7":0.10804,"14.0-14.4":0.65164,"14.5-14.8":0.56386,"15.0-15.1":0.33764,"15.2-15.3":0.43218,"15.4":0.2431,"15.5":0.46594,"15.6-15.7":2.33984,"16.0":0.93864,"16.1":2.06973,"16.2":1.95493,"16.3":3.45067,"16.4":0.85085,"16.5":8.95082,"16.6":10.1967},P:{"4":0,"20":0.23337,"21":0.832,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.08117,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.34498,"12.0":0,"13.0":0.03044,"14.0":0.01015,"15.0":0,"16.0":0.05073,"17.0":0.02029,"18.0":0.18263,"19.0":0.30439},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00361,"11":0.02525,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":44.93612},R:{_:"0"},M:{"0":0.12147},Q:{"13.1":0},O:{"0":0.05754},H:{"0":0.29052}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00742,"108":0,"109":0,"110":0,"111":0,"112":0.00742,"113":0.00371,"114":0.00742,"115":0.06304,"116":0.01483,"117":0.3226,"118":0.02225,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.08528,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00371,"50":0.00371,"51":0,"52":0,"53":0.05562,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0.00742,"84":0,"85":0.00371,"86":0,"87":0.02596,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00371,"95":0,"96":0,"97":0,"98":0.00742,"99":0,"100":0,"101":0,"102":0.00371,"103":0.01483,"104":0,"105":0.01112,"106":0.0482,"107":0,"108":0,"109":0.22248,"110":0.00371,"111":0.08528,"112":0.01112,"113":0,"114":0.16315,"115":0.0927,"116":8.762,"117":1.46095,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01112,"73":0,"74":0,"75":0,"76":0,"77":0.00371,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00371,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.01112,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00371,"102":0,"103":0,"104":0.00371,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.02225,"111":0,"112":0,"113":0,"114":0.00371,"115":0.02225,"116":0.52283,"117":0.28181},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00371,"14":0.02596,"15":0.00742,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00742,"14.1":0.05933,"15.1":0,"15.2-15.3":0.00371,"15.4":0.02596,"15.5":0.01854,"15.6":0.09641,"16.0":0.00371,"16.1":0.0482,"16.2":0.0482,"16.3":0.03708,"16.4":0.00742,"16.5":0.10382,"16.6":0.36338,"17.0":0.00371,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.28932,"13.0-13.1":0.02019,"13.2":0,"13.3":0,"13.4-13.7":0.02019,"14.0-14.4":0.1884,"14.5-14.8":0.64929,"15.0-15.1":0.23213,"15.2-15.3":0.4037,"15.4":0.09756,"15.5":0.33978,"15.6-15.7":1.68883,"16.0":0.66275,"16.1":2.60053,"16.2":1.35914,"16.3":2.35494,"16.4":1.06982,"16.5":1.89405,"16.6":18.76218,"17.0":0.82423,"17.1":0},P:{"4":0,"20":0.1015,"21":0.56837,"22":3.82637,"5.0-5.4":0,"6.2-6.4":0.05075,"7.2-7.4":0.0406,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.17254,"12.0":0,"13.0":0.01015,"14.0":0.0406,"15.0":0,"16.0":0.0812,"17.0":0.0203,"18.0":0.21314,"19.0":0.30449},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.01854,"11":0.03708,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":44.9559},R:{_:"0"},M:{"0":0.37123},Q:{"13.1":0},O:{"0":0.06921},H:{"0":0.08935}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CL.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CL.js
index bb5b5651f29e25..4fba3899adbb27 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CL.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CL.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0044,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.0044,"74":0,"75":0,"76":0,"77":0,"78":0.0044,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0088,"103":0,"104":0.0088,"105":0,"106":0,"107":0.0044,"108":0,"109":0,"110":0.0044,"111":0.0044,"112":0,"113":0.0088,"114":0.01761,"115":0.15407,"116":0.46221,"117":0.01761,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01321,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0044,"47":0.0044,"48":0,"49":0.02201,"50":0,"51":0,"52":0,"53":0.0044,"54":0,"55":0,"56":0,"57":0,"58":0.0044,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.0044,"66":0,"67":0,"68":0.0044,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.0044,"75":0,"76":0,"77":0,"78":0,"79":0.05723,"80":0.0044,"81":0.0044,"83":0,"84":0,"85":0.0044,"86":0.0044,"87":0.01761,"88":0.0044,"89":0.0044,"90":0.0044,"91":0.02641,"92":0.0088,"93":0.0044,"94":0.0044,"95":0.0044,"96":0.0088,"97":0.0044,"98":0,"99":0.01761,"100":0.0044,"101":0.0044,"102":0.0088,"103":0.04842,"104":0.0088,"105":0.01761,"106":0.01761,"107":0.0088,"108":0.03081,"109":0.85399,"110":0.01321,"111":0.02641,"112":0.03522,"113":0.06603,"114":0.48862,"115":7.7035,"116":4.08946,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0044,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.0044,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.0044,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01761,"96":0,"97":0,"98":0,"99":0.01321,"100":1.48347,"101":0.47101,"102":0.0044,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0044,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.0044,"109":0.01321,"110":0.0044,"111":0.0044,"112":0.0044,"113":0.0044,"114":0.05723,"115":1.08289,"116":0.37417},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.0044,"10":0,"11":0,"12":0,"13":0,"14":0.01321,"15":0,"17":0.0044,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.0044,"13.1":0.02201,"14.1":0.03522,"15.1":0.0044,"15.2-15.3":0.0088,"15.4":0.0088,"15.5":0.01321,"15.6":0.06163,"16.0":0.0088,"16.1":0.02201,"16.2":0.01321,"16.3":0.04402,"16.4":0.02641,"16.5":0.16287,"16.6":0.14086},G:{"8":0,"17":0.11554,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00593,"6.0-6.1":0,"7.0-7.1":0.00444,"8.1-8.4":0.00593,"9.0-9.2":0,"9.3":0.05184,"10.0-10.2":0,"10.3":0.02074,"11.0-11.2":0.01629,"11.3-11.4":0.00593,"12.0-12.1":0.01037,"12.2-12.5":0.20145,"13.0-13.1":0.00296,"13.2":0,"13.3":0.00889,"13.4-13.7":0.03555,"14.0-14.4":0.09776,"14.5-14.8":0.237,"15.0-15.1":0.04148,"15.2-15.3":0.0948,"15.4":0.07851,"15.5":0.17627,"15.6-15.7":1.15688,"16.0":0.38809,"16.1":0.81766,"16.2":0.39254,"16.3":0.94357,"16.4":0.1822,"16.5":2.87368,"16.6":6.83461},P:{"4":0.15315,"20":0.08168,"21":0.14294,"22":1.50082,"5.0-5.4":0.01021,"6.2-6.4":0,"7.2-7.4":0.04084,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03063,"12.0":0.01021,"13.0":0.01021,"14.0":0.02042,"15.0":0.01021,"16.0":0.04084,"17.0":0.02042,"18.0":0.02042,"19.0":0.05105},I:{"0":0,"3":0,"4":0.00648,"2.1":0,"2.2":0.01297,"2.3":0.00324,"4.1":0.00648,"4.2-4.3":0.01297,"4.4":0,"4.4.3-4.4.4":0.08106},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00935,"9":0.00468,"10":0.00468,"11":0.05613,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":62.50664},R:{_:"0"},M:{"0":0.17354},Q:{"13.1":0},O:{"0":0.02239},H:{"0":0.20669}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00455,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00455,"69":0.00455,"70":0.00455,"71":0,"72":0,"73":0.00455,"74":0.00455,"75":0,"76":0.00455,"77":0,"78":0.00455,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0091,"103":0,"104":0.01364,"105":0,"106":0,"107":0,"108":0.00455,"109":0.00455,"110":0.00455,"111":0.00455,"112":0,"113":0.00455,"114":0.0091,"115":0.08641,"116":0.03184,"117":0.75952,"118":0.05003,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.0091,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00455,"48":0.00455,"49":0.01819,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00455,"66":0,"67":0,"68":0.00455,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00455,"75":0.0091,"76":0.00455,"77":0,"78":0,"79":0.05912,"80":0,"81":0.00455,"83":0.0091,"84":0.0091,"85":0.00455,"86":0.01364,"87":0.01364,"88":0.01364,"89":0.00455,"90":0.00455,"91":0.02729,"92":0.0091,"93":0.00455,"94":0.00455,"95":0.00455,"96":0.0091,"97":0.00455,"98":0.00455,"99":0.01819,"100":0.00455,"101":0.00455,"102":0.0091,"103":0.04093,"104":0.00455,"105":0.01364,"106":0.02729,"107":0.01364,"108":0.03184,"109":0.83228,"110":0.01819,"111":0.03184,"112":0.02729,"113":0.04093,"114":0.11825,"115":0.2365,"116":9.5508,"117":2.7288,"118":0.00455,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00455,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00455,"73":0,"74":0,"75":0,"76":0,"77":0.01819,"78":0.00455,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00455,"85":0.00455,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00455,"95":0.01819,"96":0,"97":0,"98":0,"99":0.0091,"100":0.42751,"101":0.63672,"102":1.13245,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00455,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0091,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00455,"108":0.00455,"109":0.01364,"110":0.00455,"111":0.0091,"112":0.00455,"113":0.00455,"114":0.02274,"115":0.04548,"116":0.9187,"117":0.7868},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00455,"10":0,"11":0,"12":0,"13":0,"14":0.01364,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.0091,"10.1":0,"11.1":0,"12.1":0.00455,"13.1":0.01819,"14.1":0.03638,"15.1":0.00455,"15.2-15.3":0.0091,"15.4":0.00455,"15.5":0.01364,"15.6":0.05912,"16.0":0.00455,"16.1":0.01819,"16.2":0.01364,"16.3":0.04548,"16.4":0.02274,"16.5":0.05912,"16.6":0.28198,"17.0":0.02729,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00303,"6.0-6.1":0,"7.0-7.1":0.00303,"8.1-8.4":0.00607,"9.0-9.2":0,"9.3":0.04397,"10.0-10.2":0,"10.3":0.01516,"11.0-11.2":0.02123,"11.3-11.4":0.00303,"12.0-12.1":0.01061,"12.2-12.5":0.18651,"13.0-13.1":0.01213,"13.2":0,"13.3":0.02881,"13.4-13.7":0.03639,"14.0-14.4":0.09401,"14.5-14.8":0.22139,"15.0-15.1":0.03639,"15.2-15.3":0.08795,"15.4":0.07127,"15.5":0.15315,"15.6-15.7":1.06751,"16.0":0.36999,"16.1":0.71723,"16.2":0.31843,"16.3":0.75969,"16.4":0.13192,"16.5":0.46552,"16.6":8.94493,"17.0":1.22066,"17.1":0.00303},P:{"4":0.13272,"20":0.05105,"21":0.10209,"22":1.59263,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.04084,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02042,"12.0":0,"13.0":0.01021,"14.0":0.01021,"15.0":0.01021,"16.0":0.03063,"17.0":0.02042,"18.0":0.02042,"19.0":0.04084},I:{"0":0,"3":0,"4":0.01011,"2.1":0,"2.2":0.00337,"2.3":0.00674,"4.1":0.00674,"4.2-4.3":0.03033,"4.4":0,"4.4.3-4.4.4":0.08089},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01462,"9":0.00487,"10":0.00487,"11":0.04386,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":61.06093},R:{_:"0"},M:{"0":0.19082},Q:{"13.1":0},O:{"0":0.02181},H:{"0":0.21163}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CM.js
index 92a9f986d2aa83..74402d0a7001e6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00223,"51":0.00223,"52":0.00668,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00223,"68":0,"69":0,"70":0,"71":0,"72":0.00223,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00445,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00223,"90":0,"91":0.00223,"92":0,"93":0,"94":0,"95":0.00223,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01782,"103":0,"104":0,"105":0.00223,"106":0,"107":0,"108":0.00445,"109":0.00445,"110":0.00445,"111":0.00223,"112":0.00223,"113":0.00891,"114":0.00891,"115":0.18484,"116":0.20043,"117":0.01559,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00223,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00223,"35":0.00223,"36":0,"37":0,"38":0.00223,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00223,"47":0,"48":0,"49":0.00223,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.01336,"57":0.00223,"58":0.00223,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00223,"65":0,"66":0,"67":0.00223,"68":0.00891,"69":0,"70":0.00223,"71":0,"72":0,"73":0,"74":0.00223,"75":0.00223,"76":0.00223,"77":0.00223,"78":0,"79":0.00668,"80":0.00223,"81":0.00668,"83":0,"84":0,"85":0.02227,"86":0.00223,"87":0.00223,"88":0.00223,"89":0.00223,"90":0.00223,"91":0.00223,"92":0.00223,"93":0.00223,"94":0,"95":0.00445,"96":0.00223,"97":0.00223,"98":0,"99":0.00223,"100":0,"101":0,"102":0.00668,"103":0.00668,"104":0.00223,"105":0.00445,"106":0.00891,"107":0.00223,"108":0.00891,"109":0.25611,"110":0.00223,"111":0.00445,"112":0.00445,"113":0.02004,"114":0.08463,"115":0.74382,"116":0.39863,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00668,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00223,"47":0,"48":0,"49":0,"50":0.00223,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00223,"60":0.02227,"62":0,"63":0.04009,"64":0.00445,"65":0.00891,"66":0.01782,"67":0.01559,"68":0.00891,"69":0.05568,"70":0.03563,"71":0.10912,"72":0.04231,"73":0,"74":0,"75":0,"76":0.00223,"77":0,"78":0,"79":0.00223,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01114,"96":0,"97":0,"98":0,"99":0.00445,"100":0.02672,"101":0.08017,"102":0.00223,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00223},B:{"12":0.00223,"13":0.00445,"14":0.00445,"15":0.00223,"16":0,"17":0.00223,"18":0.00668,"79":0,"80":0,"81":0,"83":0,"84":0.00223,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00223,"91":0,"92":0.00891,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00223,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00223,"109":0.00668,"110":0.00223,"111":0.00445,"112":0.00223,"113":0.00445,"114":0.02227,"115":0.20043,"116":0.06236},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0.00223,"11":0,"12":0,"13":0,"14":0.00223,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00223,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00223,"14.1":0.00445,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00668,"16.0":0,"16.1":0.00223,"16.2":0,"16.3":0.00223,"16.4":0,"16.5":0.00445,"16.6":0.00668},G:{"8":0.0101,"17":0.03283,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02273,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03915,"10.0-10.2":0.01263,"10.3":0.41041,"11.0-11.2":0.01389,"11.3-11.4":0.00253,"12.0-12.1":0.34095,"12.2-12.5":1.6795,"13.0-13.1":0.04167,"13.2":0.07198,"13.3":0.11113,"13.4-13.7":0.16795,"14.0-14.4":0.96224,"14.5-14.8":0.63013,"15.0-15.1":0.543,"15.2-15.3":0.52153,"15.4":0.25635,"15.5":0.519,"15.6-15.7":2.08486,"16.0":0.37884,"16.1":0.40535,"16.2":0.30559,"16.3":0.72484,"16.4":0.51143,"16.5":1.13903,"16.6":0.68317},P:{"4":0.28894,"20":0.09287,"21":0.10319,"5.0-5.4":0.03096,"6.2-6.4":0,"7.2-7.4":0.07224,"8.2":0,"9.2":0.10319,"10.1":0,"11.1-11.2":0.03096,"12.0":0.01032,"13.0":0.01032,"14.0":0.02064,"15.0":0.01032,"16.0":0.03096,"17.0":0.02064,"18.0":0.03096,"19.0":0.04128},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00154,"4.2-4.3":0.00964,"4.4":0,"4.4.3-4.4.4":0.08331},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02672,"5.5":0},S:{"2.5":0.1166,_:"3.0-3.1"},J:{"7":0,"10":0.00777},N:{"10":0,"11":0},L:{"0":72.2805},R:{_:"0"},M:{"0":0.12437},Q:{"13.1":0.00777},O:{"0":0.46638},H:{"0":7.50615}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00662,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00221,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00221,"79":0,"80":0,"81":0.00221,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00442,"89":0.00221,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00221,"96":0,"97":0,"98":0,"99":0.00221,"100":0,"101":0,"102":0.00883,"103":0.00442,"104":0.00221,"105":0,"106":0.0265,"107":0.00221,"108":0.00221,"109":0.00221,"110":0.00221,"111":0.00221,"112":0.00221,"113":0.00662,"114":0.00221,"115":0.10598,"116":0.02208,"117":0.18768,"118":0.0287,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00221,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00662,"57":0,"58":0.00221,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00221,"65":0,"66":0,"67":0,"68":0.00442,"69":0,"70":0.00221,"71":0.00221,"72":0.00221,"73":0,"74":0.00221,"75":0,"76":0.00221,"77":0,"78":0,"79":0.00221,"80":0,"81":0.00221,"83":0,"84":0,"85":0.00883,"86":0.00221,"87":0.00221,"88":0.00221,"89":0.00221,"90":0.00221,"91":0.00221,"92":0,"93":0,"94":0.00221,"95":0.00442,"96":0.00221,"97":0,"98":0,"99":0.00221,"100":0.00221,"101":0,"102":0.00221,"103":0.00883,"104":0,"105":0.00221,"106":0.00662,"107":0.00442,"108":0.00662,"109":0.21859,"110":0.00221,"111":0.00442,"112":0.00442,"113":0.01104,"114":0.02208,"115":0.04858,"116":0.89203,"117":0.21638,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00662,"38":0,"39":0,"40":0,"41":0,"42":0.00221,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00221,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00221,"60":0.01766,"62":0,"63":0.03312,"64":0.00442,"65":0.00662,"66":0.04195,"67":0.01104,"68":0.00662,"69":0.03533,"70":0.02208,"71":0.06182,"72":0.09936,"73":0.0265,"74":0,"75":0,"76":0,"77":0.00221,"78":0.00221,"79":0.00442,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00883,"96":0,"97":0,"98":0,"99":0,"100":0.00221,"101":0.05078,"102":0.06403,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00221},B:{"12":0.00221,"13":0.00221,"14":0.00442,"15":0,"16":0,"17":0.00221,"18":0.00442,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00221,"90":0.00221,"91":0,"92":0.00883,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00221,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00221,"108":0,"109":0.00221,"110":0,"111":0,"112":0.00221,"113":0.00221,"114":0.00662,"115":0.01546,"116":0.13469,"117":0.06845},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0.00221,"11":0,"12":0,"13":0.00221,"14":0.00221,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00221,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00221,"14.1":0.00221,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00442,"16.0":0,"16.1":0.00221,"16.2":0,"16.3":0.00221,"16.4":0,"16.5":0.00221,"16.6":0.00442,"17.0":0,"17.1":0},G:{"8":0.03371,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02107,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01686,"10.0-10.2":0.00421,"10.3":0.23318,"11.0-11.2":0.00421,"11.3-11.4":0.01124,"12.0-12.1":0.2093,"12.2-12.5":2.06916,"13.0-13.1":0.02529,"13.2":0.10114,"13.3":0.09693,"13.4-13.7":0.18823,"14.0-14.4":0.84986,"14.5-14.8":0.59139,"15.0-15.1":0.54925,"15.2-15.3":0.48744,"15.4":0.3273,"15.5":0.57875,"15.6-15.7":2.69286,"16.0":0.4453,"16.1":0.49025,"16.2":0.33854,"16.3":0.76839,"16.4":0.48463,"16.5":0.88919,"16.6":1.28814,"17.0":0.21492,"17.1":0},P:{"4":0.24378,"20":0.0711,"21":0.0711,"22":0.30472,"5.0-5.4":0.0711,"6.2-6.4":0.01016,"7.2-7.4":0.09142,"8.2":0,"9.2":0.09142,"10.1":0,"11.1-11.2":0.03047,"12.0":0,"13.0":0.01016,"14.0":0.02031,"15.0":0,"16.0":0.05079,"17.0":0.01016,"18.0":0.02031,"19.0":0.04063},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00081,"4.2-4.3":0.00377,"4.4":0,"4.4.3-4.4.4":0.04529},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0265,"5.5":0},S:{"2.5":0.17922,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":76.19139},R:{_:"0"},M:{"0":0.14026},Q:{"13.1":0},O:{"0":0.40518},H:{"0":3.76225}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CN.js
index 264ad46acf5278..3e5ff5e4a2c8b4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00344,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.0516,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00344,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00344,"69":0,"70":0,"71":0,"72":0.2236,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00344,"79":0,"80":0,"81":0,"82":0,"83":0.04128,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00344,"90":0.00344,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00344,"103":0,"104":0,"105":0,"106":0,"107":0.00344,"108":0.00688,"109":0.00688,"110":0.00688,"111":0.00688,"112":0.00344,"113":0.00344,"114":0.00688,"115":0.086,"116":0.13416,"117":0.00344,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00688,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00344,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00344,"41":0.00344,"42":0,"43":0.00344,"44":0,"45":0.00344,"46":0,"47":0.00344,"48":0.02064,"49":0.02064,"50":0.09632,"51":0,"52":0,"53":0.01032,"54":0,"55":0.01376,"56":0.00344,"57":0.01032,"58":0,"59":0.00344,"60":0.00344,"61":0.00344,"62":0.00688,"63":0.00688,"64":0,"65":0.00344,"66":0,"67":0.00344,"68":0,"69":0.31304,"70":0.14792,"71":0.00344,"72":0.00688,"73":0.15136,"74":0.10664,"75":0.086,"76":0.00344,"77":0.02064,"78":0.0516,"79":0.06192,"80":0.0172,"81":0.01376,"83":0.0688,"84":0.0172,"85":0.00344,"86":0.16856,"87":0.02408,"88":0.01032,"89":0.02064,"90":0.04816,"91":0.0344,"92":0.09976,"93":0.00344,"94":0.06192,"95":0.0344,"96":0.01032,"97":0.05848,"98":0.35432,"99":0.16856,"100":0.0688,"101":0.03096,"102":0.0172,"103":0.02064,"104":0.01032,"105":0.0172,"106":0.01376,"107":0.02408,"108":0.05504,"109":0.17888,"110":0.02064,"111":0.02064,"112":0.07568,"113":0.05848,"114":0.14792,"115":0.4816,"116":0.24424,"117":0.01376,"118":0.00344,"119":0},F:{"9":0,"11":0.00344,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00344,"96":0,"97":0,"98":0,"99":0,"100":0.00344,"101":0.00688,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.00344,"17":0.00344,"18":0.02064,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00344,"89":0,"90":0,"91":0,"92":0.0172,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00344,"99":0.00344,"100":0.00344,"101":0.00344,"102":0.00344,"103":0.00344,"104":0.00344,"105":0.00344,"106":0.00344,"107":0.0172,"108":0.03784,"109":0.0688,"110":0.04128,"111":0.04128,"112":0.03784,"113":0.12728,"114":0.18232,"115":1.7372,"116":0.50912},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00344,"14":0.02064,"15":0.00344,"17":0.00344,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00344,"13.1":0.02064,"14.1":0.02408,"15.1":0.00344,"15.2-15.3":0.00344,"15.4":0.01376,"15.5":0.01376,"15.6":0.0516,"16.0":0.00688,"16.1":0.02408,"16.2":0.02064,"16.3":0.04128,"16.4":0.01032,"16.5":0.07568,"16.6":0.13072},G:{"8":0,"17":0.04387,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.06336,"5.0-5.1":0.026,"6.0-6.1":0.01787,"7.0-7.1":0.0195,"8.1-8.4":0.01625,"9.0-9.2":0.04387,"9.3":0.04062,"10.0-10.2":0.03737,"10.3":0.24533,"11.0-11.2":0.18197,"11.3-11.4":0.06174,"12.0-12.1":0.10073,"12.2-12.5":0.39643,"13.0-13.1":0.02924,"13.2":0.07474,"13.3":0.06824,"13.4-13.7":0.47766,"14.0-14.4":0.67263,"14.5-14.8":0.75062,"15.0-15.1":0.3948,"15.2-15.3":0.35744,"15.4":0.54915,"15.5":0.4078,"15.6-15.7":1.22341,"16.0":0.56865,"16.1":1.20229,"16.2":0.77824,"16.3":1.28515,"16.4":0.4468,"16.5":2.06176,"16.6":3.58898},P:{"4":0,"20":0.01093,"21":0.02187,"22":0.17493,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.14213,"15.0":0,"16.0":0,"17.0":0.01093,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0.17121,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.17121,"4.4":0,"4.4.3-4.4.4":1.78061},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0435,"9":0.3045,"10":0,"11":2.34897,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":51.5564},R:{_:"0"},M:{"0":0.10496},Q:{"13.1":3.64736},O:{"0":9.07904},H:{"0":0.03726}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00353,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.02115,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00705,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00353,"69":0,"70":0,"71":0,"72":0.07755,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00353,"79":0,"80":0,"81":0,"82":0,"83":0.01763,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00353,"103":0,"104":0,"105":0,"106":0.00353,"107":0,"108":0.00353,"109":0.00353,"110":0.00705,"111":0.00353,"112":0.00353,"113":0.00353,"114":0.00705,"115":0.05993,"116":0.0564,"117":0.15158,"118":0.01058,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00353,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00353,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00353,"42":0,"43":0,"44":0,"45":0.00353,"46":0,"47":0.00353,"48":0.02115,"49":0.02115,"50":0.05288,"51":0,"52":0,"53":0.01058,"54":0,"55":0.01763,"56":0.00353,"57":0.01058,"58":0.00705,"59":0.00353,"60":0.00353,"61":0.00353,"62":0.00705,"63":0.01058,"64":0,"65":0.00353,"66":0,"67":0.00353,"68":0.00353,"69":0.3102,"70":0.4935,"71":0.00353,"72":0.00705,"73":0.2397,"74":0.00353,"75":0.0423,"76":0.00353,"77":0.0282,"78":0.05288,"79":0.06345,"80":0.01763,"81":0.01058,"83":0.06698,"84":0.01763,"85":0.00353,"86":0.12338,"87":0.04935,"88":0.0141,"89":0.02115,"90":0.04583,"91":0.03525,"92":0.0846,"93":0.00353,"94":0.0564,"95":0.01058,"96":0.00705,"97":0.0564,"98":0.41595,"99":0.1692,"100":0.07403,"101":0.03173,"102":0.01763,"103":0.02115,"104":0.00705,"105":0.0141,"106":0.01058,"107":0.02468,"108":0.02115,"109":0.18683,"110":0.00705,"111":0.00705,"112":0.0423,"113":0.05993,"114":0.13748,"115":0.08108,"116":0.67328,"117":0.16568,"118":0.01763,"119":0.00353,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00353,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00353,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00353,"102":0.00353,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.00353,"17":0.00353,"18":0.0282,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00353,"89":0.00353,"90":0,"91":0,"92":0.01763,"93":0,"94":0,"95":0,"96":0.00353,"97":0,"98":0,"99":0.00353,"100":0.00353,"101":0.00353,"102":0.00353,"103":0.00353,"104":0.00353,"105":0.00353,"106":0.00353,"107":0.01058,"108":0.02115,"109":0.04935,"110":0.02468,"111":0.02468,"112":0.03525,"113":0.11633,"114":0.10223,"115":0.14805,"116":1.42058,"117":0.84953},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00353,"14":0.02115,"15":0.00353,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00353,"13.1":0.02115,"14.1":0.02468,"15.1":0.00353,"15.2-15.3":0.00353,"15.4":0.0141,"15.5":0.01763,"15.6":0.0564,"16.0":0.00705,"16.1":0.02468,"16.2":0.02115,"16.3":0.03878,"16.4":0.0141,"16.5":0.03525,"16.6":0.20798,"17.0":0.0141,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.06187,"5.0-5.1":0.02912,"6.0-6.1":0.01638,"7.0-7.1":0.00728,"8.1-8.4":0.0091,"9.0-9.2":0.11464,"9.3":0.02366,"10.0-10.2":0.03276,"10.3":0.28024,"11.0-11.2":0.20199,"11.3-11.4":0.07279,"12.0-12.1":0.08553,"12.2-12.5":0.42764,"13.0-13.1":0.02912,"13.2":0.06005,"13.3":0.08371,"13.4-13.7":0.50043,"14.0-14.4":0.72971,"14.5-14.8":0.7006,"15.0-15.1":0.40398,"15.2-15.3":0.39488,"15.4":0.57503,"15.5":0.43492,"15.6-15.7":1.26289,"16.0":0.63145,"16.1":1.23378,"16.2":0.78066,"16.3":1.28837,"16.4":0.43128,"16.5":0.93716,"16.6":5.83951,"17.0":0.40034,"17.1":0},P:{"4":0,"20":0.01101,"21":0.02202,"22":0.20914,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.07705,"15.0":0,"16.0":0,"17.0":0.01101,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0.07649,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.53545,"4.4":0,"4.4.3-4.4.4":3.13621},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.03529,"9":0.67057,"10":0,"11":2.18817,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.2423},R:{_:"0"},M:{"0":0.12303},Q:{"13.1":3.885},O:{"0":8.12613},H:{"0":0.03678}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CO.js
index 65b5a9248f83cd..fade48e9aeb429 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00392,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00392,"74":0,"75":0,"76":0,"77":0,"78":0.00392,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00392,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00785,"103":0.00392,"104":0.00392,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.01177,"114":0.01569,"115":0.10592,"116":0.30207,"117":0.01177,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01177,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00392,"48":0,"49":0.00785,"50":0,"51":0,"52":0,"53":0.00392,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00392,"63":0,"64":0,"65":0.00392,"66":0,"67":0,"68":0.01177,"69":0,"70":0.00392,"71":0,"72":0,"73":0.00392,"74":0.00392,"75":0.00392,"76":0.00392,"77":0,"78":0,"79":0.09808,"80":0.00392,"81":0.00785,"83":0.00392,"84":0.00392,"85":0.00392,"86":0.00392,"87":0.01962,"88":0.01569,"89":0.01177,"90":0.00392,"91":0.01177,"92":0.00392,"93":0.00392,"94":0.00392,"95":0.01569,"96":0.00392,"97":0.01177,"98":0.00392,"99":0.01962,"100":0.00392,"101":0.00392,"102":0.00785,"103":0.03531,"104":0.00785,"105":0.01569,"106":0.01569,"107":0.01569,"108":0.01962,"109":0.80029,"110":0.01177,"111":0.02354,"112":0.03923,"113":0.05885,"114":0.34915,"115":6.07673,"116":3.69154,"117":0.00392,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00392,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00392,"72":0.00392,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03138,"96":0,"97":0,"98":0.00392,"99":0.01177,"100":0.58453,"101":0.27069,"102":0.00392,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00392,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00392,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01569,"110":0.00392,"111":0.00392,"112":0.01177,"113":0.00785,"114":0.05492,"115":0.80029,"116":0.30207},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00785,"15":0.00392,"17":0.00392,_:"0","3.1":0,"3.2":0,"5.1":0.00392,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01177,"14.1":0.01962,"15.1":0.00392,"15.2-15.3":0,"15.4":0.00785,"15.5":0.00785,"15.6":0.03531,"16.0":0.00392,"16.1":0.01569,"16.2":0.01569,"16.3":0.02746,"16.4":0.01177,"16.5":0.08238,"16.6":0.102},G:{"8":0,"17":0.07626,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00578,"6.0-6.1":0,"7.0-7.1":0.0104,"8.1-8.4":0.00347,"9.0-9.2":0.00116,"9.3":0.04853,"10.0-10.2":0,"10.3":0.04275,"11.0-11.2":0.00809,"11.3-11.4":0.00924,"12.0-12.1":0.00347,"12.2-12.5":0.20453,"13.0-13.1":0.00231,"13.2":0.00231,"13.3":0.00693,"13.4-13.7":0.01964,"14.0-14.4":0.05662,"14.5-14.8":0.14906,"15.0-15.1":0.0312,"15.2-15.3":0.10053,"15.4":0.04275,"15.5":0.08435,"15.6-15.7":0.98912,"16.0":0.37554,"16.1":0.68406,"16.2":0.31545,"16.3":0.69446,"16.4":0.12711,"16.5":2.20818,"16.6":5.24486},P:{"4":0.15636,"20":0.05212,"21":0.11466,"22":0.92771,"5.0-5.4":0.03127,"6.2-6.4":0,"7.2-7.4":0.07297,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01042,"12.0":0,"13.0":0.01042,"14.0":0.01042,"15.0":0,"16.0":0.03127,"17.0":0.04169,"18.0":0.01042,"19.0":0.03127},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.03133,"4.4":0,"4.4.3-4.4.4":0.0979},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01962,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":71.05141},R:{_:"0"},M:{"0":0.11546},Q:{"13.1":0},O:{"0":0.03646},H:{"0":0.13808}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00407,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00407,"79":0,"80":0,"81":0.00407,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00407,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00813,"103":0,"104":0.00407,"105":0,"106":0,"107":0,"108":0.00407,"109":0,"110":0,"111":0.00407,"112":0,"113":0.00407,"114":0.00407,"115":0.04878,"116":0.03252,"117":0.30488,"118":0.03252,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00407,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00813,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00407,"48":0,"49":0.00407,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00407,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00813,"69":0.00407,"70":0.00407,"71":0,"72":0.00407,"73":0,"74":0.00407,"75":0.00813,"76":0.00407,"77":0.00407,"78":0.00407,"79":0.07317,"80":0.00813,"81":0.00813,"83":0.00407,"84":0.00407,"85":0.00813,"86":0.00407,"87":0.02439,"88":0.01626,"89":0.0122,"90":0.00813,"91":0.01626,"92":0.00407,"93":0.00407,"94":0.00407,"95":0.00813,"96":0.00407,"97":0.0122,"98":0.00407,"99":0.01626,"100":0.00407,"101":0.00407,"102":0.00813,"103":0.03252,"104":0.00813,"105":0.02033,"106":0.01626,"107":0.01626,"108":0.02439,"109":0.80894,"110":0.0122,"111":0.02033,"112":0.03252,"113":0.04472,"114":0.10163,"115":0.18293,"116":8.43488,"117":2.34144,"118":0.00813,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00407,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00407,"73":0,"74":0,"75":0,"76":0,"77":0.00813,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02439,"96":0,"97":0,"98":0,"99":0.00813,"100":0.14228,"101":0.28862,"102":0.35772,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00813,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00407,"108":0,"109":0.0122,"110":0.00407,"111":0.00407,"112":0.00407,"113":0.00407,"114":0.0122,"115":0.02439,"116":0.67479,"117":0.5691},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00407,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00407,"6.1":0,"7.1":0,"9.1":0.0122,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0122,"14.1":0.01626,"15.1":0.00407,"15.2-15.3":0,"15.4":0.00813,"15.5":0.00407,"15.6":0.03659,"16.0":0.00407,"16.1":0.0122,"16.2":0.0122,"16.3":0.02846,"16.4":0.0122,"16.5":0.03659,"16.6":0.15447,"17.0":0.02033,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00286,"6.0-6.1":0,"7.0-7.1":0.00858,"8.1-8.4":0,"9.0-9.2":0.00286,"9.3":0.0429,"10.0-10.2":0,"10.3":0.03146,"11.0-11.2":0.01573,"11.3-11.4":0.00858,"12.0-12.1":0.00715,"12.2-12.5":0.1816,"13.0-13.1":0.00429,"13.2":0.02002,"13.3":0.11725,"13.4-13.7":0.02002,"14.0-14.4":0.06149,"14.5-14.8":0.16301,"15.0-15.1":0.03575,"15.2-15.3":0.09295,"15.4":0.04433,"15.5":0.07579,"15.6-15.7":0.93232,"16.0":0.38608,"16.1":0.67779,"16.2":0.32031,"16.3":0.65634,"16.4":0.10296,"16.5":0.36463,"16.6":8.33797,"17.0":1.39133,"17.1":0.00286},P:{"4":0.16469,"20":0.04117,"21":0.07205,"22":0.95724,"5.0-5.4":0.03088,"6.2-6.4":0,"7.2-7.4":0.08234,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01029,"12.0":0,"13.0":0.02059,"14.0":0.01029,"15.0":0,"16.0":0.02059,"17.0":0.03088,"18.0":0.01029,"19.0":0.02059},I:{"0":0,"3":0,"4":0.01943,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00648,"4.4":0,"4.4.3-4.4.4":0.09068},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00407,"9":0,"10":0,"11":0.0122,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.56127},R:{_:"0"},M:{"0":0.1187},Q:{"13.1":0},O:{"0":0.02968},H:{"0":0.118}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CR.js
index e31b9c3035fa76..9141521760aefa 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00408,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00408,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.01632,"74":0,"75":0,"76":0,"77":0,"78":0.00408,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00408,"86":0,"87":0,"88":0.00408,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00408,"102":0.02447,"103":0.00408,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00408,"110":0.00816,"111":0,"112":0.00408,"113":0.01224,"114":0.01224,"115":0.24474,"116":0.68935,"117":0.02447,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00408},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00408,"39":0.00408,"40":0.00408,"41":0.00408,"42":0.00408,"43":0.00816,"44":0.00816,"45":0.00816,"46":0.00408,"47":0.00408,"48":0,"49":0.00408,"50":0,"51":0.00408,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00408,"68":0.00816,"69":0,"70":0,"71":0,"72":0,"73":0.00408,"74":0,"75":0,"76":0.00408,"77":0,"78":0,"79":0.01632,"80":0.00816,"81":0.00408,"83":0.00408,"84":0,"85":0.00408,"86":0.0204,"87":0.00408,"88":0.00408,"89":0,"90":0.01224,"91":0.00408,"92":0.00408,"93":0.00408,"94":0.00408,"95":0.00408,"96":0.00408,"97":0.00408,"98":0.00816,"99":0.01224,"100":0.00408,"101":0.00408,"102":0.00408,"103":0.04487,"104":0.00408,"105":0.00408,"106":0.00408,"107":0.00408,"108":0.00816,"109":0.32224,"110":0.01224,"111":0.01632,"112":0.02447,"113":0.03671,"114":0.76685,"115":5.66573,"116":3.23873,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00816,"29":0,"30":0,"31":0.00408,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00816,"72":0.00816,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00408,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01224,"96":0,"97":0,"98":0,"99":0.00816,"100":0.61593,"101":0.2529,"102":0.00408,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00408},B:{"12":0.00408,"13":0,"14":0.00408,"15":0,"16":0,"17":0.01632,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00408,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00408,"106":0,"107":0,"108":0,"109":0.01224,"110":0,"111":0.00408,"112":0.00408,"113":0.00408,"114":0.05303,"115":1.24817,"116":0.41606},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01224,"10":0,"11":0,"12":0,"13":0,"14":0.00816,"15":0,"17":0.01632,_:"0","3.1":0,"3.2":0,"5.1":0.00408,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00408,"13.1":0.0204,"14.1":0.02855,"15.1":0.00816,"15.2-15.3":0.00408,"15.4":0.01632,"15.5":0.02447,"15.6":0.13053,"16.0":0.00816,"16.1":0.06934,"16.2":0.02447,"16.3":0.0775,"16.4":0.03263,"16.5":0.33448,"16.6":0.46093},G:{"8":0.00191,"17":0.21604,"3.2":0.00191,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00574,"6.0-6.1":0.01147,"7.0-7.1":0.04971,"8.1-8.4":0.02868,"9.0-9.2":0.00382,"9.3":0.04015,"10.0-10.2":0,"10.3":0.03059,"11.0-11.2":0.06883,"11.3-11.4":0.01721,"12.0-12.1":0.02294,"12.2-12.5":0.17589,"13.0-13.1":0,"13.2":0,"13.3":0.00382,"13.4-13.7":0.01721,"14.0-14.4":0.06692,"14.5-14.8":0.23899,"15.0-15.1":0.02868,"15.2-15.3":0.06309,"15.4":0.03824,"15.5":0.08986,"15.6-15.7":1.05154,"16.0":0.39767,"16.1":0.76667,"16.2":0.54298,"16.3":0.95977,"16.4":0.19692,"16.5":3.93467,"16.6":10.02595},P:{"4":0.11246,"20":0.11246,"21":0.19425,"5.0-5.4":0,"6.2-6.4":0.02045,"7.2-7.4":0.08179,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02045,"12.0":0.01022,"13.0":0.02045,"14.0":0.01022,"15.0":0,"16.0":0.02045,"17.0":0.05112,"18.0":0.02045,"19.0":0.0409},I:{"0":0,"3":0.00653,"4":0.03265,"2.1":0.00653,"2.2":0.01959,"2.3":0.02612,"4.1":0.02612,"4.2-4.3":0.04897,"4.4":0,"4.4.3-4.4.4":0.18283},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00408,"7":0.00408,"8":0.04487,"9":0.00816,"10":0.00816,"11":0.05303,"5.5":0},S:{"2.5":0.00592,_:"3.0-3.1"},J:{"7":0,"10":0.00592},N:{"10":0.01184,"11":0.01184},L:{"0":58.97288},R:{_:"0"},M:{"0":0.37894},Q:{"13.1":0.00592},O:{"0":0.05921},H:{"0":0.25225}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00437,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00437,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00437,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.01748,"74":0,"75":0,"76":0,"77":0,"78":0.0306,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00437,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02186,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00874,"111":0,"112":0,"113":0.01748,"114":0.01311,"115":0.15736,"116":0.04371,"117":0.80426,"118":0.07431,"119":0,"120":0,"3.5":0,"3.6":0.00437},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00437,"40":0.00437,"41":0.00437,"42":0.00437,"43":0.00874,"44":0.00874,"45":0.00437,"46":0.00874,"47":0.00437,"48":0,"49":0,"50":0,"51":0.00874,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00437,"66":0,"67":0.00437,"68":0.01748,"69":0,"70":0.00437,"71":0,"72":0,"73":0.00437,"74":0,"75":0,"76":0,"77":0.00437,"78":0,"79":0.01311,"80":0.01311,"81":0.01748,"83":0.00437,"84":0,"85":0.00437,"86":0.02623,"87":0.00437,"88":0.00437,"89":0.00437,"90":0.00437,"91":0.00437,"92":0.00437,"93":0.00874,"94":0.00437,"95":0,"96":0.02186,"97":0.00437,"98":0.00874,"99":0.01311,"100":0.00437,"101":0.00437,"102":0.00874,"103":0.0306,"104":0.00437,"105":0.00874,"106":0.00874,"107":0.00437,"108":0.00874,"109":0.37591,"110":0.01311,"111":0.01311,"112":0.0306,"113":0.02623,"114":0.1049,"115":0.19232,"116":8.47974,"117":2.38657,"118":0.00437,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00874,"29":0,"30":0,"31":0.00437,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00437,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00437,"70":0,"71":0,"72":0.01748,"73":0.00874,"74":0,"75":0,"76":0,"77":0.02186,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01311,"96":0,"97":0.00437,"98":0,"99":0.00437,"100":0.1661,"101":0.29286,"102":0.50704,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00437,"13":0,"14":0.00874,"15":0,"16":0,"17":0.01748,"18":0.00437,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00437,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00437,"106":0,"107":0,"108":0,"109":0.01311,"110":0,"111":0.00437,"112":0,"113":0.00437,"114":0.01311,"115":0.0306,"116":1.06215,"117":0.86109},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01311,"10":0,"11":0,"12":0,"13":0.00437,"14":0.00437,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00437,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02623,"14.1":0.02623,"15.1":0.00437,"15.2-15.3":0.00437,"15.4":0.00874,"15.5":0.02186,"15.6":0.10928,"16.0":0.01311,"16.1":0.02186,"16.2":0.01748,"16.3":0.08305,"16.4":0.0306,"16.5":0.10928,"16.6":0.69062,"17.0":0.06557,"17.1":0},G:{"8":0.00181,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00181,"5.0-5.1":0.01265,"6.0-6.1":0.01807,"7.0-7.1":0.04518,"8.1-8.4":0.0253,"9.0-9.2":0.00361,"9.3":0.05784,"10.0-10.2":0,"10.3":0.03615,"11.0-11.2":0.08675,"11.3-11.4":0.01807,"12.0-12.1":0.0253,"12.2-12.5":0.19881,"13.0-13.1":0,"13.2":0.00542,"13.3":0.00361,"13.4-13.7":0.01807,"14.0-14.4":0.06868,"14.5-14.8":0.15363,"15.0-15.1":0.02892,"15.2-15.3":0.05422,"15.4":0.03615,"15.5":0.07591,"15.6-15.7":0.99045,"16.0":0.28918,"16.1":0.63439,"16.2":0.28195,"16.3":0.64885,"16.4":0.13013,"16.5":0.441,"16.6":11.69198,"17.0":1.71521,"17.1":0.00361},P:{"4":0.09243,"20":0.09243,"21":0.1335,"22":2.82413,"5.0-5.4":0,"6.2-6.4":0.02054,"7.2-7.4":0.08216,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01027,"12.0":0.01027,"13.0":0.01027,"14.0":0.01027,"15.0":0.01027,"16.0":0.02054,"17.0":0.07189,"18.0":0.01027,"19.0":0.05135},I:{"0":0,"3":0.00341,"4":0.04771,"2.1":0.00682,"2.2":0.02726,"2.3":0.03408,"4.1":0.02726,"4.2-4.3":0.05794,"4.4":0,"4.4.3-4.4.4":0.20108},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00437,"7":0.00437,"8":0.04371,"9":0.00874,"10":0.00874,"11":0.0306,"5.5":0},S:{"2.5":0.00563,_:"3.0-3.1"},J:{"7":0,"10":0.01126},N:{"10":0.01876,"11":0.00938},L:{"0":57.73335},R:{_:"0"},M:{"0":0.28708},Q:{"13.1":0},O:{"0":0.06755},H:{"0":0.28778}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CU.js
index 32a5aa64b4868b..17f464299037cd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00252,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00252,"41":0.00252,"42":0,"43":0.00757,"44":0,"45":0,"46":0,"47":0.00252,"48":0,"49":0.00252,"50":0.00505,"51":0,"52":0.01767,"53":0,"54":0.02524,"55":0.00252,"56":0.00505,"57":0.00757,"58":0,"59":0.00252,"60":0.00505,"61":0.00252,"62":0.00252,"63":0.00252,"64":0.00505,"65":0.00252,"66":0.00505,"67":0.00505,"68":0.00757,"69":0,"70":0.00505,"71":0.00252,"72":0.02019,"73":0.00252,"74":0,"75":0.00252,"76":0,"77":0.00505,"78":0.00252,"79":0.00252,"80":0,"81":0.00505,"82":0.00252,"83":0.00252,"84":0.00252,"85":0.01262,"86":0.00252,"87":0.00252,"88":0.00757,"89":0.0101,"90":0.00252,"91":0.00505,"92":0.00505,"93":0.00505,"94":0.00505,"95":0.0101,"96":0.01767,"97":0.01262,"98":0.0101,"99":0.02524,"100":0.02272,"101":0.03786,"102":0.06562,"103":0.0101,"104":0.03029,"105":0.00505,"106":0.02019,"107":0.00757,"108":0.01262,"109":0.01262,"110":0.05553,"111":0.02524,"112":0.03029,"113":0.04543,"114":0.0631,"115":0.6209,"116":0.94398,"117":0.03534,"118":0.00252,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01767,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00252,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00252,"68":0,"69":0,"70":0,"71":0.00252,"72":0.00252,"73":0,"74":0.00757,"75":0.00252,"76":0.00505,"77":0.00505,"78":0.00252,"79":0.00252,"80":0.00252,"81":0.0101,"83":0.00252,"84":0.00252,"85":0,"86":0.00505,"87":0.0101,"88":0.02272,"89":0.02776,"90":0.02272,"91":0.0101,"92":0.00757,"93":0.00252,"94":0.00505,"95":0.00757,"96":0.00252,"97":0.00505,"98":0.00252,"99":0.00252,"100":0.00757,"101":0.00252,"102":0.00757,"103":0.0101,"104":0.00757,"105":0.00505,"106":0.00757,"107":0.00757,"108":0.02019,"109":0.18678,"110":0.0101,"111":0.01262,"112":0.01514,"113":0.02524,"114":0.13882,"115":0.72439,"116":0.35588,"117":0.00252,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0.00252,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00252,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00252,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00757,"70":0.00757,"71":0.01514,"72":0.0101,"73":0,"74":0.00505,"75":0,"76":0.00252,"77":0.00252,"78":0,"79":0.00757,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00252,"88":0,"89":0,"90":0,"91":0,"92":0.00252,"93":0,"94":0.00252,"95":0.02524,"96":0,"97":0.00505,"98":0,"99":0.01767,"100":0.08077,"101":0.10853,"102":0.00505,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00252,"13":0.00252,"14":0.00505,"15":0.03534,"16":0.00505,"17":0.00252,"18":0.01514,"79":0,"80":0,"81":0,"83":0,"84":0.00757,"85":0.00252,"86":0,"87":0,"88":0.00252,"89":0.00505,"90":0.00505,"91":0,"92":0.02019,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00252,"99":0,"100":0.00757,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00252,"109":0.00505,"110":0.00505,"111":0.00757,"112":0.00505,"113":0.00757,"114":0.0631,"115":0.28521,"116":0.0732},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00505,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00252,"12.1":0,"13.1":0.00252,"14.1":0.00252,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.0101,"16.0":0,"16.1":0.00252,"16.2":0.00252,"16.3":0.0101,"16.4":0,"16.5":0.04796,"16.6":0.14387},G:{"8":0.00504,"17":0.08489,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00144,"7.0-7.1":0.02446,"8.1-8.4":0.12015,"9.0-9.2":0.00504,"9.3":0.01295,"10.0-10.2":0,"10.3":0.01871,"11.0-11.2":0.02158,"11.3-11.4":0.0036,"12.0-12.1":0.01871,"12.2-12.5":0.34173,"13.0-13.1":0.01439,"13.2":0.03166,"13.3":0.05324,"13.4-13.7":0.11151,"14.0-14.4":0.28058,"14.5-14.8":0.3813,"15.0-15.1":0.21655,"15.2-15.3":0.34317,"15.4":0.10144,"15.5":0.19712,"15.6-15.7":0.9626,"16.0":0.22734,"16.1":0.3554,"16.2":0.22374,"16.3":0.58634,"16.4":0.35252,"16.5":0.96836,"16.6":1.12663},P:{"4":0.22411,"20":0.1528,"21":0.40747,"5.0-5.4":0.04075,"6.2-6.4":0.01019,"7.2-7.4":0.32598,"8.2":0.01019,"9.2":0.05093,"10.1":0,"11.1-11.2":0.09168,"12.0":0,"13.0":0.06112,"14.0":0.05093,"15.0":0.02037,"16.0":0.18336,"17.0":0.12224,"18.0":0.05093,"19.0":0.14261},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.00222,"4.1":0.00444,"4.2-4.3":0.02222,"4.4":0,"4.4.3-4.4.4":0.20664},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01262,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":81.81776},R:{_:"0"},M:{"0":0.5906},Q:{"13.1":0},O:{"0":0.17942},H:{"0":0.79271}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00258,"34":0.00516,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00258,"43":0.00774,"44":0,"45":0.00258,"46":0,"47":0.00258,"48":0.00258,"49":0,"50":0.00516,"51":0,"52":0.05934,"53":0,"54":0.03096,"55":0.00258,"56":0.00258,"57":0.01032,"58":0,"59":0.00258,"60":0.00516,"61":0.00258,"62":0,"63":0.00258,"64":0.00516,"65":0.00258,"66":0.00516,"67":0.00258,"68":0.00516,"69":0,"70":0.00258,"71":0.00516,"72":0.02064,"73":0.00258,"74":0,"75":0,"76":0,"77":0.00258,"78":0.00516,"79":0.00258,"80":0.00258,"81":0.00258,"82":0.00516,"83":0.00258,"84":0.00774,"85":0.00516,"86":0.00258,"87":0.00258,"88":0.00774,"89":0.00516,"90":0.00516,"91":0.01032,"92":0.00516,"93":0.00774,"94":0.00516,"95":0.0129,"96":0.00516,"97":0.01806,"98":0.0129,"99":0.0258,"100":0.02322,"101":0.02322,"102":0.04128,"103":0.00774,"104":0.03096,"105":0.00516,"106":0.01806,"107":0.01032,"108":0.0129,"109":0.01806,"110":0.02322,"111":0.03096,"112":0.02064,"113":0.04386,"114":0.03354,"115":0.3999,"116":0.16512,"117":1.14552,"118":0.11094,"119":0.00258,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00258,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00258,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00258,"63":0.00258,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00258,"72":0.00258,"73":0.00258,"74":0.00258,"75":0.00516,"76":0,"77":0.00258,"78":0.00258,"79":0.00516,"80":0.03354,"81":0.00774,"83":0,"84":0.00258,"85":0,"86":0.00516,"87":0.00516,"88":0.02838,"89":0.01806,"90":0.0258,"91":0.01032,"92":0.00258,"93":0.00516,"94":0.00516,"95":0.01032,"96":0.00516,"97":0.00258,"98":0.00258,"99":0.00258,"100":0.00516,"101":0.00258,"102":0.00774,"103":0.01032,"104":0.00258,"105":0.00516,"106":0.0129,"107":0.00516,"108":0.0129,"109":0.17286,"110":0.01032,"111":0.0129,"112":0.0258,"113":0.01548,"114":0.11094,"115":0.05418,"116":0.97008,"117":0.25542,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00258,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0.00258,"67":0.00258,"68":0,"69":0.00516,"70":0.00774,"71":0.00516,"72":0.02322,"73":0.00258,"74":0,"75":0,"76":0.00258,"77":0.02322,"78":0,"79":0.01032,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00258,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01548,"96":0,"97":0.00774,"98":0,"99":0.0129,"100":0.01032,"101":0.08772,"102":0.07998,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00258,"13":0.00258,"14":0.00516,"15":0.03096,"16":0.00258,"17":0.00258,"18":0.01548,"79":0,"80":0,"81":0,"83":0,"84":0.00774,"85":0,"86":0,"87":0,"88":0,"89":0.00258,"90":0.00516,"91":0,"92":0.03096,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00258,"100":0.01032,"101":0,"102":0,"103":0.00258,"104":0,"105":0.00258,"106":0.00258,"107":0.00258,"108":0.00258,"109":0.00774,"110":0.00774,"111":0.00258,"112":0.00258,"113":0.00516,"114":0.03096,"115":0.04644,"116":0.26574,"117":0.15738},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00258,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00774,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00258,"14.1":0.00258,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00258,"15.6":0.00774,"16.0":0,"16.1":0.00258,"16.2":0,"16.3":0.00516,"16.4":0.00516,"16.5":0.00258,"16.6":0.07998,"17.0":0.00258,"17.1":0},G:{"8":0.00241,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00161,"6.0-6.1":0,"7.0-7.1":0.05796,"8.1-8.4":0.06601,"9.0-9.2":0.00161,"9.3":0.02576,"10.0-10.2":0,"10.3":0.01529,"11.0-11.2":0.01529,"11.3-11.4":0.00241,"12.0-12.1":0.00805,"12.2-12.5":0.3389,"13.0-13.1":0.02576,"13.2":0.01529,"13.3":0.34856,"13.4-13.7":0.13685,"14.0-14.4":0.25679,"14.5-14.8":0.40813,"15.0-15.1":0.19561,"15.2-15.3":0.35661,"15.4":0.13604,"15.5":0.21413,"15.6-15.7":1.47957,"16.0":0.24552,"16.1":0.34131,"16.2":0.25438,"16.3":0.33568,"16.4":0.22218,"16.5":0.50875,"16.6":1.64942,"17.0":0.3558,"17.1":0},P:{"4":0.24504,"20":0.13273,"21":0.31652,"22":0.75555,"5.0-5.4":0.03063,"6.2-6.4":0.01021,"7.2-7.4":0.29609,"8.2":0.01021,"9.2":0.03063,"10.1":0,"11.1-11.2":0.1021,"12.0":0,"13.0":0.05105,"14.0":0.04084,"15.0":0.02042,"16.0":0.11231,"17.0":0.09189,"18.0":0.06126,"19.0":0.16336},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00409,"4.2-4.3":0.01636,"4.4":0,"4.4.3-4.4.4":0.18405},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01032,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":80.9344},R:{_:"0"},M:{"0":0.56392},Q:{"13.1":0.02968},O:{"0":0.12614},H:{"0":0.81487}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CV.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CV.js
index e89b6886c01360..a21e3862314334 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CV.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CV.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00732,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00366,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00366,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00732,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00366,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.06586,"112":0,"113":0.00732,"114":0,"115":0.09879,"116":0.25979,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00366,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01464,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00366,"56":0.00366,"57":0,"58":0,"59":0,"60":0.00366,"61":0,"62":0.00366,"63":0,"64":0.00366,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00366,"71":0.00366,"72":0,"73":0.00366,"74":0.00366,"75":0.0183,"76":0.0183,"77":0,"78":0,"79":0.02927,"80":0,"81":0.17929,"83":0.02561,"84":0.00366,"85":0,"86":0.00366,"87":0.01464,"88":0.00732,"89":0,"90":0.00366,"91":0.00366,"92":0.00366,"93":0.02195,"94":0.00366,"95":0.04757,"96":0.00366,"97":0.02561,"98":0.00366,"99":0.05123,"100":0.00366,"101":0,"102":0.03293,"103":0.06952,"104":0.00366,"105":0.00366,"106":0.0183,"107":0.01098,"108":0.02195,"109":0.47933,"110":0.03659,"111":0.00732,"112":0.01098,"113":0.02927,"114":0.38054,"115":3.76145,"116":2.82109,"117":0.00366,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.01098,"72":0.00732,"73":0,"74":0.00732,"75":0,"76":0.00366,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00732,"96":0,"97":0,"98":0,"99":0.00732,"100":0.08782,"101":0.10245,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00366,"15":0.04025,"16":0.00366,"17":0,"18":0.00732,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00366,"90":0,"91":0,"92":0.00732,"93":0,"94":0,"95":0,"96":0.04025,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0183,"110":0.00366,"111":0,"112":0.45006,"113":0.01098,"114":0.23052,"115":1.48921,"116":0.79034},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00366,"15":0,"17":0.01464,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00732,"14.1":0.0805,"15.1":0,"15.2-15.3":0,"15.4":0.00366,"15.5":0.00366,"15.6":0.06586,"16.0":0,"16.1":0.00732,"16.2":0.01098,"16.3":0.02927,"16.4":0.00732,"16.5":0.05854,"16.6":0.08416},G:{"8":0,"17":0.10184,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02037,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.08147,"10.0-10.2":0.00313,"10.3":0.21777,"11.0-11.2":0.14727,"11.3-11.4":0.0893,"12.0-12.1":0.0047,"12.2-12.5":0.85542,"13.0-13.1":0.0047,"13.2":0,"13.3":0.01567,"13.4-13.7":0.03447,"14.0-14.4":0.41988,"14.5-14.8":0.41518,"15.0-15.1":0.34311,"15.2-15.3":0.13317,"15.4":0.07677,"15.5":0.11907,"15.6-15.7":3.58931,"16.0":0.52328,"16.1":0.77082,"16.2":0.53268,"16.3":0.67995,"16.4":0.1457,"16.5":2.9736,"16.6":3.36684},P:{"4":0.17439,"20":0.09233,"21":0.31801,"5.0-5.4":0.03078,"6.2-6.4":0.01026,"7.2-7.4":0.18465,"8.2":0,"9.2":0.04103,"10.1":0,"11.1-11.2":0.07181,"12.0":0,"13.0":0.18465,"14.0":0.02052,"15.0":0.43086,"16.0":0.11284,"17.0":0.07181,"18.0":0.15388,"19.0":0.20517},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00956,"4.4":0,"4.4.3-4.4.4":0.46388},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02927,"5.5":0},S:{"2.5":0.00634,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.10628},R:{_:"0"},M:{"0":0.25998},Q:{"13.1":0.00634},O:{"0":0.11414},H:{"0":0.13807}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00382,"51":0,"52":0.00382,"53":0,"54":0.00382,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01526,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00382,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.05341,"116":0.03815,"117":0.25561,"118":0.01526,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00382,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.01526,"41":0,"42":0.00382,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00382,"56":0,"57":0,"58":0,"59":0.00382,"60":0.00763,"61":0,"62":0,"63":0,"64":0,"65":0.00382,"66":0,"67":0,"68":0,"69":0,"70":0.00382,"71":0,"72":0,"73":0,"74":0,"75":0.01145,"76":0.00382,"77":0,"78":0,"79":0.01145,"80":0,"81":0.26705,"83":0.00382,"84":0.00382,"85":0,"86":0,"87":0.00763,"88":0.00763,"89":0,"90":0.00382,"91":0.02671,"92":0,"93":0.00763,"94":0,"95":0,"96":0.00382,"97":0.03434,"98":0,"99":0.02671,"100":0.00763,"101":0,"102":0.01526,"103":0.03052,"104":0.00382,"105":0.00763,"106":0.00763,"107":0,"108":0.00382,"109":0.51884,"110":0.04578,"111":0.01526,"112":0.02671,"113":0.01908,"114":0.1526,"115":0.12971,"116":5.67291,"117":1.52219,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00382,"69":0,"70":0,"71":0,"72":0.0496,"73":0.00382,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00763,"96":0,"97":0,"98":0,"99":0,"100":0.01526,"101":0.13353,"102":0.17168,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00382,"13":0.00382,"14":0.00382,"15":0.03434,"16":0.00382,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00763,"93":0,"94":0,"95":0,"96":0.06486,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00382,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00763,"110":0.00382,"111":0,"112":0.33572,"113":0.00763,"114":0.03052,"115":0.01145,"116":1.59849,"117":1.526},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00763,"14.1":0.04197,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00763,"15.6":0.08393,"16.0":0,"16.1":0,"16.2":0.00382,"16.3":0.00763,"16.4":0,"16.5":0.01908,"16.6":0.1259,"17.0":0.01145,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.03647,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01989,"10.0-10.2":0,"10.3":0.26688,"11.0-11.2":0.06133,"11.3-11.4":0.16908,"12.0-12.1":0.14422,"12.2-12.5":0.82055,"13.0-13.1":0.0116,"13.2":0,"13.3":0.00497,"13.4-13.7":0.04476,"14.0-14.4":0.52714,"14.5-14.8":0.45089,"15.0-15.1":0.2155,"15.2-15.3":0.11604,"15.4":0.10112,"15.5":0.39618,"15.6-15.7":4.4757,"16.0":0.45917,"16.1":0.63157,"16.2":0.11438,"16.3":0.44094,"16.4":0.13261,"16.5":2.1185,"16.6":4.40774,"17.0":0.35474,"17.1":0},P:{"4":0.26663,"20":0.03077,"21":0.13332,"22":1.62031,"5.0-5.4":0.01026,"6.2-6.4":0,"7.2-7.4":0.19485,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.04102,"12.0":0.01026,"13.0":0.01026,"14.0":0,"15.0":0.48199,"16.0":0.05128,"17.0":0.08204,"18.0":0.0923,"19.0":0.15383},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00437,"4.4":0,"4.4.3-4.4.4":0.54153},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.00382,"10":0,"11":0.00763,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":63.91095},R:{_:"0"},M:{"0":0.11752},Q:{"13.1":0},O:{"0":0.05567},H:{"0":0.27521}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CX.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CX.js
index f73d96d2f8ed27..13f0300999528c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CX.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CX.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":32.35,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":2.94,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":2.94,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":35.29,"116":2.94,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":23.53,"116":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0},P:{"4":0,"20":0,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":0},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":62.38293,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":8.32155,"117":0,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":8.32155,"117":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0,"17.0":0,"17.1":0},P:{"4":0,"20":0,"21":0,"22":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":12.67155},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CY.js
index 429e75a7f1a52e..09e31e3a584fcd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00396,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01979,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00396,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00396,"89":0,"90":0,"91":0.00792,"92":0.00396,"93":0,"94":0.00396,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00792,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00396,"112":0.00396,"113":0.00396,"114":0.00396,"115":0.54225,"116":1.23094,"117":0.11478,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00396},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01187,"39":0.00396,"40":0.00396,"41":0.00396,"42":0.00396,"43":0.00396,"44":0.01187,"45":0.00792,"46":0.00396,"47":0.00396,"48":0,"49":0.01187,"50":0,"51":0.00396,"52":0,"53":0,"54":0,"55":0,"56":0.00396,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00396,"66":0.00396,"67":0,"68":0.01187,"69":0,"70":0.00396,"71":0,"72":0,"73":0,"74":0,"75":0.00396,"76":0,"77":0,"78":0,"79":0.05937,"80":0.00396,"81":0,"83":0.01187,"84":0,"85":0,"86":0.00396,"87":0.01187,"88":0.00396,"89":0.00396,"90":0.00396,"91":0.01979,"92":0,"93":0.0752,"94":0,"95":0,"96":0,"97":0,"98":0.01187,"99":0.00396,"100":0.00396,"101":0.00396,"102":0.01187,"103":0.02375,"104":0.00396,"105":0.00792,"106":0.02375,"107":0.00792,"108":0.02375,"109":1.06074,"110":0.00396,"111":0.00792,"112":0.02771,"113":0.05145,"114":0.77181,"115":4.93563,"116":3.30097,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00396,"29":0,"30":0,"31":0.00396,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00396,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00792,"71":0.02375,"72":0.01583,"73":0,"74":0,"75":0,"76":0,"77":0.00396,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00792,"96":0,"97":0,"98":0,"99":0.00792,"100":0.18998,"101":0.13853,"102":0.00396,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00396},B:{"12":0.00396,"13":0,"14":0.00396,"15":0,"16":0,"17":0,"18":0.00396,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00396,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00396,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00396,"108":0.00396,"109":0.01979,"110":0.00792,"111":0,"112":0,"113":0.00396,"114":0.05145,"115":1.32593,"116":0.50267},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00792,"10":0,"11":0,"12":0,"13":0.00396,"14":0.03166,"15":0.00396,"17":0.00396,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00396,"13.1":0.06333,"14.1":0.04354,"15.1":0.04354,"15.2-15.3":0.00396,"15.4":0.00792,"15.5":0.01187,"15.6":0.06333,"16.0":0.01187,"16.1":0.01979,"16.2":0.01979,"16.3":0.05937,"16.4":0.01583,"16.5":0.21769,"16.6":0.30081},G:{"8":0.00377,"17":0.15437,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00565,"6.0-6.1":0.00565,"7.0-7.1":0.01694,"8.1-8.4":0.02447,"9.0-9.2":0.00188,"9.3":0.0866,"10.0-10.2":0.00188,"10.3":0.09977,"11.0-11.2":0.06024,"11.3-11.4":0.00565,"12.0-12.1":0.02636,"12.2-12.5":0.21649,"13.0-13.1":0.00377,"13.2":0,"13.3":0.01506,"13.4-13.7":0.04142,"14.0-14.4":0.07907,"14.5-14.8":0.2259,"15.0-15.1":0.09413,"15.2-15.3":0.22967,"15.4":0.07342,"15.5":0.13742,"15.6-15.7":1.11822,"16.0":0.56852,"16.1":1.01468,"16.2":0.61935,"16.3":1.19917,"16.4":0.24096,"16.5":4.03426,"16.6":8.40172},P:{"4":0.09243,"20":0.1027,"21":0.30811,"5.0-5.4":0,"6.2-6.4":0.01027,"7.2-7.4":0.01027,"8.2":0,"9.2":0.01027,"10.1":0,"11.1-11.2":0.01027,"12.0":0,"13.0":0.02054,"14.0":0.01027,"15.0":0.01027,"16.0":0.02054,"17.0":0.02054,"18.0":0.03081,"19.0":0.07189},I:{"0":0,"3":0,"4":0.03816,"2.1":0.00848,"2.2":0.0212,"2.3":0.03392,"4.1":0.02544,"4.2-4.3":0.05088,"4.4":0,"4.4.3-4.4.4":0.16961},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00396,"8":0.03958,"9":0.00792,"10":0.00792,"11":0.15436,"5.5":0},S:{"2.5":0.00604,_:"3.0-3.1"},J:{"7":0,"10":0.00604},N:{"10":0.01208,"11":0.01208},L:{"0":53.33256},R:{_:"0"},M:{"0":2.38055},Q:{"13.1":0},O:{"0":0.24772},H:{"0":0.37753}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00419,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00838,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0.00419,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00419,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01256,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00838,"110":0,"111":0,"112":0.00838,"113":0.00838,"114":0.00419,"115":0.09214,"116":0.18427,"117":1.05119,"118":0.08376,"119":0,"120":0,"3.5":0,"3.6":0.00419},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01256,"39":0.00419,"40":0,"41":0.00419,"42":0.00419,"43":0.00419,"44":0.00838,"45":0.00419,"46":0.00419,"47":0.00419,"48":0,"49":0.00419,"50":0,"51":0.00838,"52":0,"53":0,"54":0,"55":0,"56":0.00419,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00838,"69":0,"70":0.00419,"71":0,"72":0,"73":0,"74":0.00419,"75":0,"76":0,"77":0,"78":0,"79":0.03769,"80":0.00419,"81":0.00419,"83":0.00838,"84":0,"85":0.00419,"86":0,"87":0.01256,"88":0.02513,"89":0.00419,"90":0.00419,"91":0.02094,"92":0,"93":0.0712,"94":0,"95":0.01675,"96":0,"97":0,"98":0.00838,"99":0.00419,"100":0.00419,"101":0,"102":0.01256,"103":0.02932,"104":0,"105":0.00419,"106":0.02513,"107":0.00838,"108":0.01675,"109":1.18102,"110":0.00419,"111":0.01675,"112":0.01675,"113":0.03769,"114":0.0712,"115":0.29316,"116":8.11634,"117":1.80503,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00419,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00419,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00419,"72":0.0335,"73":0.00838,"74":0,"75":0,"76":0,"77":0.02513,"78":0,"79":0,"80":0,"81":0,"82":0.00419,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00838,"96":0,"97":0,"98":0,"99":0.00419,"100":0.0712,"101":0.11726,"102":0.20102,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00419,"13":0.00419,"14":0.00838,"15":0,"16":0,"17":0,"18":0.00419,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00419,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00838,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.01675,"108":0,"109":0.0335,"110":0.01256,"111":0,"112":0,"113":0.00419,"114":0.01256,"115":0.02094,"116":1.16426,"117":0.85435},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01256,"10":0,"11":0,"12":0,"13":0,"14":0.01675,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00419,"6.1":0,"7.1":0,"9.1":0.00419,"10.1":0,"11.1":0,"12.1":0.00419,"13.1":0.10051,"14.1":0.06282,"15.1":0.05026,"15.2-15.3":0.00838,"15.4":0.00838,"15.5":0.01675,"15.6":0.0712,"16.0":0.00838,"16.1":0.02094,"16.2":0.01256,"16.3":0.05863,"16.4":0.02513,"16.5":0.08376,"16.6":0.54863,"17.0":0.04188,"17.1":0},G:{"8":0.00391,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00782,"6.0-6.1":0.00391,"7.0-7.1":0.01759,"8.1-8.4":0.02736,"9.0-9.2":0.00977,"9.3":0.11726,"10.0-10.2":0,"10.3":0.06645,"11.0-11.2":0.07818,"11.3-11.4":0.00977,"12.0-12.1":0.03518,"12.2-12.5":0.19935,"13.0-13.1":0.00195,"13.2":0.00195,"13.3":0.03713,"13.4-13.7":0.04886,"14.0-14.4":0.08013,"14.5-14.8":0.23648,"15.0-15.1":0.09186,"15.2-15.3":0.20717,"15.4":0.06645,"15.5":0.11726,"15.6-15.7":1.14137,"16.0":0.44951,"16.1":0.8873,"16.2":0.42019,"16.3":0.92247,"16.4":0.16417,"16.5":0.67817,"16.6":11.83777,"17.0":1.38371,"17.1":0.00195},P:{"4":0.11239,"20":0.06131,"21":0.16348,"22":4.62862,"5.0-5.4":0,"6.2-6.4":0.01022,"7.2-7.4":0.01022,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01022,"12.0":0,"13.0":0.02044,"14.0":0.01022,"15.0":0.01022,"16.0":0.01022,"17.0":0.03065,"18.0":0.03065,"19.0":0.29631},I:{"0":0,"3":0.00721,"4":0.04685,"2.1":0.00721,"2.2":0.02522,"2.3":0.02883,"4.1":0.02883,"4.2-4.3":0.06126,"4.4":0,"4.4.3-4.4.4":0.15135},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00419,"8":0.04188,"9":0.00838,"10":0.00838,"11":0.07538,"5.5":0},S:{"2.5":0.00581,_:"3.0-3.1"},J:{"7":0,"10":0.01162},N:{"10":0.01453,"11":0.01453},L:{"0":52.16659},R:{_:"0"},M:{"0":1.28445},Q:{"13.1":0.00581},O:{"0":0.27316},H:{"0":0.41818}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CZ.js
index c6f9a14b9ff3ac..c45822d40c410b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/CZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00511,"49":0,"50":0,"51":0,"52":0.0767,"53":0,"54":0,"55":0,"56":0.00511,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00511,"66":0,"67":0,"68":0.00511,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01023,"79":0,"80":0,"81":0,"82":0,"83":0.00511,"84":0,"85":0,"86":0,"87":0,"88":0.00511,"89":0.00511,"90":0,"91":0.00511,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00511,"100":0.00511,"101":0,"102":0.10226,"103":0.00511,"104":0.00511,"105":0.00511,"106":0.00511,"107":0.01023,"108":0.00511,"109":0.01023,"110":0.00511,"111":0.01534,"112":0.01023,"113":0.03068,"114":0.0409,"115":0.86921,"116":2.25483,"117":0.07158,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00511,"39":0,"40":0,"41":0.00511,"42":0,"43":0,"44":0.00511,"45":0,"46":0,"47":0,"48":0,"49":0.01023,"50":0,"51":0,"52":0,"53":0.00511,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00511,"69":0.00511,"70":0.00511,"71":0.00511,"72":0,"73":0,"74":0.02557,"75":0.00511,"76":0,"77":0,"78":0,"79":0.06647,"80":0.00511,"81":0.01534,"83":0.00511,"84":0.00511,"85":0.01534,"86":0.01023,"87":0.03579,"88":0.00511,"89":0.01534,"90":0.01023,"91":0.01023,"92":0.00511,"93":0.00511,"94":0.00511,"95":0.01534,"96":0.00511,"97":0.00511,"98":0,"99":0.01534,"100":0.00511,"101":0.00511,"102":0.14828,"103":0.03068,"104":0.01023,"105":0.02045,"106":0.0409,"107":0.01534,"108":0.02045,"109":0.77718,"110":0.02557,"111":0.02557,"112":1.49811,"113":0.05624,"114":0.54709,"115":7.22978,"116":4.14664,"117":0.00511,"118":0.00511,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00511,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00511,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00511,"70":0,"71":0.01023,"72":0.01023,"73":0,"74":0,"75":0,"76":0.00511,"77":0.00511,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.02045,"86":0.00511,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.09203,"96":0,"97":0,"98":0,"99":0.02045,"100":0.71071,"101":0.71071,"102":0.01023,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00511},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00511,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00511,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00511,"105":0,"106":0,"107":0.01023,"108":0.00511,"109":0.06647,"110":0.02045,"111":0.01023,"112":0.01534,"113":0.01023,"114":0.18918,"115":2.7917,"116":0.96124},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00511,"10":0,"11":0,"12":0,"13":0.00511,"14":0.01534,"15":0.00511,"17":0.01534,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01023,"10.1":0,"11.1":0,"12.1":0.00511,"13.1":0.03068,"14.1":0.03579,"15.1":0.00511,"15.2-15.3":0.00511,"15.4":0.01534,"15.5":0.02557,"15.6":0.10737,"16.0":0.01534,"16.1":0.0409,"16.2":0.04602,"16.3":0.08181,"16.4":0.03579,"16.5":0.29144,"16.6":0.32723},G:{"8":0,"17":0.16111,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00313,"6.0-6.1":0,"7.0-7.1":0.00313,"8.1-8.4":0.00626,"9.0-9.2":0.00156,"9.3":0.0438,"10.0-10.2":0.00156,"10.3":0.05162,"11.0-11.2":0.01877,"11.3-11.4":0.00782,"12.0-12.1":0.01251,"12.2-12.5":0.22054,"13.0-13.1":0,"13.2":0,"13.3":0.00626,"13.4-13.7":0.01564,"14.0-14.4":0.04849,"14.5-14.8":0.13452,"15.0-15.1":0.03285,"15.2-15.3":0.09385,"15.4":0.061,"15.5":0.11105,"15.6-15.7":1.27634,"16.0":0.43014,"16.1":1.03702,"16.2":0.45047,"16.3":0.94318,"16.4":0.16423,"16.5":3.17989,"16.6":7.10744},P:{"4":0.11178,"20":0.08129,"21":0.20323,"22":2.39814,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01016,"12.0":0,"13.0":0.02032,"14.0":0.02032,"15.0":0.01016,"16.0":0.02032,"17.0":0.01016,"18.0":0.02032,"19.0":0.04065},I:{"0":0,"3":0,"4":0.00998,"2.1":0,"2.2":0.02994,"2.3":0.00998,"4.1":0.0499,"4.2-4.3":0.02994,"4.4":0,"4.4.3-4.4.4":0.15469},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0409,"9":0,"10":0.02557,"11":0.05624,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":51.72619},R:{_:"0"},M:{"0":0.38607},Q:{"13.1":0},O:{"0":0.13684},H:{"0":0.50894}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.03245,"49":0,"50":0,"51":0,"52":0.07573,"53":0,"54":0,"55":0,"56":0.01082,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00541,"69":0.00541,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02164,"79":0,"80":0.00541,"81":0.00541,"82":0,"83":0.00541,"84":0,"85":0,"86":0,"87":0,"88":0.00541,"89":0.00541,"90":0,"91":0.01623,"92":0,"93":0,"94":0,"95":0,"96":0.00541,"97":0,"98":0,"99":0.00541,"100":0,"101":0,"102":0.08654,"103":0.00541,"104":0.00541,"105":0.00541,"106":0.00541,"107":0.00541,"108":0.01082,"109":0.01082,"110":0.00541,"111":0.01082,"112":0.01082,"113":0.02705,"114":0.02164,"115":0.43813,"116":0.23259,"117":2.63418,"118":0.24881,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00541,"39":0,"40":0,"41":0.00541,"42":0,"43":0,"44":0,"45":0.00541,"46":0,"47":0,"48":0,"49":0.01082,"50":0,"51":0.01082,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00541,"69":0,"70":0.00541,"71":0.00541,"72":0,"73":0,"74":0.02705,"75":0,"76":0.01082,"77":0,"78":0.00541,"79":0.03786,"80":0.00541,"81":0.01082,"83":0.00541,"84":0.00541,"85":0.02164,"86":0.01082,"87":0.02705,"88":0.00541,"89":0.01623,"90":0.01623,"91":0.00541,"92":0,"93":0.07573,"94":0.00541,"95":0.01082,"96":0.01082,"97":0.01082,"98":0.00541,"99":0.01623,"100":0.00541,"101":0.00541,"102":0.16768,"103":0.03245,"104":0.01623,"105":0.02705,"106":0.04327,"107":0.02705,"108":0.0595,"109":0.86003,"110":0.02705,"111":0.02705,"112":0.75185,"113":0.02705,"114":0.1785,"115":0.28668,"116":10.59623,"117":3.14804,"118":0.00541,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00541,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00541,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.01082,"70":0,"71":0,"72":0.01623,"73":0.00541,"74":0,"75":0,"76":0,"77":0.04868,"78":0.00541,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.02164,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00541,"93":0,"94":0,"95":0.12441,"96":0,"97":0,"98":0,"99":0.01623,"100":0.15686,"101":0.6599,"102":0.91412,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00541,"15":0,"16":0,"17":0.00541,"18":0.00541,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00541,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00541,"105":0.00541,"106":0,"107":0.01082,"108":0.00541,"109":0.06491,"110":0.00541,"111":0.03786,"112":0.02164,"113":0.01082,"114":0.07032,"115":0.09195,"116":2.15819,"117":1.8012},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00541,"10":0,"11":0,"12":0,"13":0,"14":0.02164,"15":0.00541,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00541,"10.1":0,"11.1":0,"12.1":0,"13.1":0.03245,"14.1":0.04327,"15.1":0.01082,"15.2-15.3":0.00541,"15.4":0.02164,"15.5":0.02164,"15.6":0.10277,"16.0":0.01623,"16.1":0.04327,"16.2":0.04868,"16.3":0.07573,"16.4":0.03245,"16.5":0.119,"16.6":0.62744,"17.0":0.05409,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00175,"6.0-6.1":0,"7.0-7.1":0.00349,"8.1-8.4":0.00699,"9.0-9.2":0,"9.3":0.04192,"10.0-10.2":0.00175,"10.3":0.05764,"11.0-11.2":0.03144,"11.3-11.4":0.00524,"12.0-12.1":0.01397,"12.2-12.5":0.18689,"13.0-13.1":0.00349,"13.2":0.00175,"13.3":0.3895,"13.4-13.7":0.01747,"14.0-14.4":0.05065,"14.5-14.8":0.12401,"15.0-15.1":0.03668,"15.2-15.3":0.08908,"15.4":0.06812,"15.5":0.09956,"15.6-15.7":1.23837,"16.0":0.43317,"16.1":0.92223,"16.2":0.45413,"16.3":0.81918,"16.4":0.12226,"16.5":0.44539,"16.6":9.92792,"17.0":1.65058,"17.1":0.00349},P:{"4":0.09297,"20":0.05165,"21":0.11363,"22":2.26222,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01033,"14.0":0.01033,"15.0":0,"16.0":0.01033,"17.0":0.01033,"18.0":0.01033,"19.0":0.03099},I:{"0":0,"3":0,"4":0.02015,"2.1":0,"2.2":0.01511,"2.3":0.01511,"4.1":0.03526,"4.2-4.3":0.04029,"4.4":0,"4.4.3-4.4.4":0.16622},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.05409,"9":0.00541,"10":0.04868,"11":0.07573,"5.5":0},S:{"2.5":0.00459,_:"3.0-3.1"},J:{"7":0,"10":0.00459},N:{"10":0,"11":0},L:{"0":47.47934},R:{_:"0"},M:{"0":0.3581},Q:{"13.1":0},O:{"0":0.16987},H:{"0":0.51288}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DE.js
index b4bc4dfbc5d01b..6b1000e6546d32 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00544,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00544,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01632,"49":0.01088,"50":0.03807,"51":0,"52":0.07615,"53":0.03807,"54":0,"55":0,"56":0.02176,"57":0,"58":0,"59":0.01088,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00544,"69":0,"70":0,"71":0,"72":0.00544,"73":0,"74":0,"75":0,"76":0,"77":0.00544,"78":0.0272,"79":0,"80":0.00544,"81":0.00544,"82":0,"83":0.00544,"84":0,"85":0,"86":0,"87":0.00544,"88":0.00544,"89":0.00544,"90":0.00544,"91":0.01632,"92":0,"93":0,"94":0.00544,"95":0.00544,"96":0.00544,"97":0.00544,"98":0.00544,"99":0.00544,"100":0.00544,"101":0.00544,"102":0.60917,"103":0.00544,"104":0.01088,"105":0.01632,"106":0.01632,"107":0.02176,"108":0.0272,"109":0.0272,"110":0.0272,"111":0.0272,"112":0.02176,"113":0.04895,"114":0.05439,"115":1.07692,"116":3.55167,"117":0.11966,"118":0.00544,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.01088,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.02176,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03263,"50":0,"51":0,"52":0.01088,"53":0,"54":0,"55":0,"56":0.00544,"57":0,"58":0,"59":0,"60":0.00544,"61":0.00544,"62":0,"63":0.00544,"64":0,"65":0,"66":0.03807,"67":0,"68":0.00544,"69":0.00544,"70":0.00544,"71":0.00544,"72":0.01088,"73":0,"74":0.01088,"75":0.01088,"76":0.00544,"77":0.00544,"78":0.01088,"79":0.03263,"80":0.03263,"81":0.0272,"83":0.02176,"84":0.01088,"85":0.02176,"86":0.01632,"87":0.02176,"88":0.0272,"89":0.01632,"90":0.01088,"91":0.05983,"92":0.01088,"93":0.07071,"94":0.03263,"95":0.01088,"96":0.01632,"97":0.00544,"98":0.01088,"99":0.03263,"100":0.01088,"101":0.00544,"102":0.01088,"103":0.04895,"104":0.01088,"105":0.03807,"106":0.27739,"107":0.07615,"108":0.09246,"109":0.59285,"110":0.05983,"111":0.07615,"112":0.07615,"113":0.16317,"114":0.95726,"115":6.53768,"116":3.68764,"117":0.00544,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00544,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01088,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00544,"70":0.00544,"71":0.01632,"72":0.01632,"73":0,"74":0,"75":0,"76":0.00544,"77":0.00544,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04895,"96":0,"97":0,"98":0,"99":0.02176,"100":0.75058,"101":0.65812,"102":0.01088,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00544,"15":0.00544,"16":0,"17":0.00544,"18":0.00544,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00544,"91":0,"92":0.00544,"93":0,"94":0,"95":0,"96":0,"97":0.00544,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00544,"104":0,"105":0.00544,"106":0.00544,"107":0.01088,"108":0.02176,"109":0.0979,"110":0.01632,"111":0.04895,"112":0.01632,"113":0.0272,"114":0.21212,"115":3.44833,"116":1.20202},E:{"4":0,"5":0,"6":0,"7":0.00544,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00544,"14":0.02176,"15":0.00544,"17":0.01632,_:"0","3.1":0,"3.2":0,"5.1":0.00544,"6.1":0,"7.1":0,"9.1":0.02176,"10.1":0,"11.1":0.01088,"12.1":0.01088,"13.1":0.08159,"14.1":0.07615,"15.1":0.01088,"15.2-15.3":0.01088,"15.4":0.02176,"15.5":0.03263,"15.6":0.22844,"16.0":0.05439,"16.1":0.07071,"16.2":0.07615,"16.3":0.17405,"16.4":0.05983,"16.5":0.59285,"16.6":0.90831},G:{"8":0.00235,"17":0.22068,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00235,"6.0-6.1":0,"7.0-7.1":0.0047,"8.1-8.4":0,"9.0-9.2":0.02113,"9.3":0.07043,"10.0-10.2":0.00704,"10.3":0.08217,"11.0-11.2":0.03052,"11.3-11.4":0.11034,"12.0-12.1":0.01174,"12.2-12.5":0.32162,"13.0-13.1":0.0047,"13.2":0.0047,"13.3":0.01643,"13.4-13.7":0.05399,"14.0-14.4":0.11034,"14.5-14.8":0.21363,"15.0-15.1":0.16198,"15.2-15.3":0.09156,"15.4":0.11269,"15.5":0.15494,"15.6-15.7":1.48134,"16.0":0.80288,"16.1":1.2771,"16.2":0.62916,"16.3":1.37335,"16.4":0.2911,"16.5":4.77034,"16.6":11.01498},P:{"4":0.11288,"20":0.12315,"21":0.31813,"22":3.65336,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01026,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01026,"12.0":0.01026,"13.0":0.03079,"14.0":0.02052,"15.0":0.01026,"16.0":0.03079,"17.0":0.04105,"18.0":0.03079,"19.0":0.07184},I:{"0":0,"3":0,"4":0.00573,"2.1":0,"2.2":0,"2.3":0,"4.1":0.10608,"4.2-4.3":0.03154,"4.4":0,"4.4.3-4.4.4":0.09175},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00574,"9":0.00574,"10":0,"11":0.09186,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":37.5111},R:{_:"0"},M:{"0":0.93957},Q:{"13.1":0.00456},O:{"0":0.20068},H:{"0":0.60021}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00568,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01705,"49":0.01137,"50":0.00568,"51":0,"52":0.06821,"53":0.0341,"54":0,"55":0,"56":0.00568,"57":0,"58":0,"59":0.00568,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00568,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00568,"78":0.02274,"79":0,"80":0.00568,"81":0.00568,"82":0,"83":0.00568,"84":0,"85":0,"86":0,"87":0,"88":0.00568,"89":0.00568,"90":0,"91":0.01137,"92":0,"93":0,"94":0,"95":0.00568,"96":0.00568,"97":0.00568,"98":0,"99":0.00568,"100":0,"101":0.00568,"102":0.51156,"103":0.00568,"104":0.00568,"105":0.00568,"106":0.00568,"107":0.00568,"108":0.01705,"109":0.01137,"110":0.01137,"111":0.01705,"112":0.01705,"113":0.0341,"114":0.02274,"115":0.43198,"116":0.20462,"117":3.54113,"118":0.36946,"119":0.00568,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.01137,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00568,"42":0.00568,"43":0.02274,"44":0,"45":0,"46":0,"47":0,"48":0.00568,"49":0.00568,"50":0,"51":0,"52":0.00568,"53":0,"54":0,"55":0,"56":0.00568,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.0341,"67":0,"68":0,"69":0.00568,"70":0.00568,"71":0,"72":0.01137,"73":0,"74":0.00568,"75":0.01137,"76":0.00568,"77":0.00568,"78":0.00568,"79":0.02842,"80":0.02842,"81":0.02842,"83":0.01137,"84":0.00568,"85":0.01705,"86":0.01137,"87":0.01705,"88":0.01137,"89":0.01705,"90":0.01705,"91":0.06821,"92":0.00568,"93":0.09094,"94":0.02842,"95":0.00568,"96":0.01705,"97":0.00568,"98":0.00568,"99":0.02842,"100":0.00568,"101":0.00568,"102":0.01137,"103":0.04547,"104":0.01137,"105":0.03979,"106":0.22736,"107":0.05116,"108":0.09663,"109":0.61387,"110":0.05684,"111":0.05684,"112":0.08526,"113":0.07389,"114":0.35809,"115":0.41493,"116":9.7708,"117":3.06368,"118":0.01705,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00568,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00568,"70":0.00568,"71":0.00568,"72":0.02274,"73":0.00568,"74":0,"75":0,"76":0,"77":0.05684,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04547,"96":0,"97":0,"98":0,"99":0.01137,"100":0.1762,"101":0.50019,"102":1.37553,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00568,"16":0,"17":0.00568,"18":0.00568,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00568,"93":0,"94":0.00568,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00568,"104":0,"105":0.00568,"106":0.00568,"107":0.01137,"108":0.02274,"109":0.08526,"110":0.01705,"111":0.03979,"112":0.01705,"113":0.01705,"114":0.06821,"115":0.15347,"116":2.54075,"117":2.23381},E:{"4":0,"5":0,"6":0,"7":0.00568,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00568,"14":0.02274,"15":0.00568,_:"0","3.1":0,"3.2":0,"5.1":0.00568,"6.1":0,"7.1":0,"9.1":0.01137,"10.1":0,"11.1":0.00568,"12.1":0.00568,"13.1":0.05116,"14.1":0.07389,"15.1":0.01705,"15.2-15.3":0.01137,"15.4":0.02274,"15.5":0.0341,"15.6":0.22736,"16.0":0.05116,"16.1":0.07389,"16.2":0.07389,"16.3":0.16484,"16.4":0.05684,"16.5":0.19894,"16.6":1.39826,"17.0":0.13642,"17.1":0},G:{"8":0.00249,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00249,"6.0-6.1":0,"7.0-7.1":0.00997,"8.1-8.4":0,"9.0-9.2":0.02243,"9.3":0.05235,"10.0-10.2":0,"10.3":0.08226,"11.0-11.2":0.03241,"11.3-11.4":0.07229,"12.0-12.1":0.00997,"12.2-12.5":0.26174,"13.0-13.1":0.00499,"13.2":0.00499,"13.3":0.20939,"13.4-13.7":0.03739,"14.0-14.4":0.11716,"14.5-14.8":0.24429,"15.0-15.1":0.09722,"15.2-15.3":0.08475,"15.4":0.09472,"15.5":0.2742,"15.6-15.7":1.28376,"16.0":0.82011,"16.1":1.17657,"16.2":0.56835,"16.3":1.14666,"16.4":0.26922,"16.5":0.68052,"16.6":14.60498,"17.0":2.22851,"17.1":0.00249},P:{"4":0.06249,"20":0.08332,"21":0.18746,"22":3.30146,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01041,"12.0":0,"13.0":0.02083,"14.0":0.01041,"15.0":0.01041,"16.0":0.03124,"17.0":0.03124,"18.0":0.02083,"19.0":0.05207},I:{"0":0,"3":0,"4":0.00971,"2.1":0,"2.2":0,"2.3":0,"4.1":0.03885,"4.2-4.3":0.03885,"4.4":0,"4.4.3-4.4.4":0.12627},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00602,"9":0,"10":0,"11":0.09629,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":34.98484},R:{_:"0"},M:{"0":0.82004},Q:{"13.1":0.00432},O:{"0":0.14674},H:{"0":0.58023}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DJ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DJ.js
index 880c8f94308ec1..c61a7ea8fbd3f0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DJ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DJ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00486,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00243,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00243,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00243,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.05103,"113":0,"114":0,"115":0.33291,"116":0.21384,"117":0.00486,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00243,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00243,"47":0,"48":0,"49":0.00243,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00729,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00243,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00243,"74":0,"75":0,"76":0.00243,"77":0,"78":0.00243,"79":0.00243,"80":0,"81":0.00243,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01215,"89":0,"90":0.00729,"91":0,"92":0,"93":0,"94":0.00243,"95":0,"96":0.00243,"97":0,"98":0,"99":0,"100":0.00972,"101":0,"102":0.00486,"103":0,"104":0.00243,"105":0,"106":0,"107":0.00243,"108":0.00729,"109":0.5589,"110":0.01215,"111":0.00243,"112":0.00729,"113":0.00729,"114":0.15795,"115":2.27934,"116":1.58193,"117":0.00243,"118":0.00729,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00243,"70":0.00243,"71":0.10935,"72":0.05346,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00243,"96":0,"97":0,"98":0,"99":0.00243,"100":0.01701,"101":0.0729,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0.01215,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00972},B:{"12":0.00243,"13":0.00243,"14":0.00243,"15":0,"16":0,"17":0,"18":0.00243,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00243,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00486,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00243,"109":0.00729,"110":0,"111":0.00243,"112":0.00243,"113":0.00729,"114":0.03645,"115":0.52245,"116":0.11421},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00243,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00729,"14.1":0.00729,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00729,"15.6":0.00972,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0.00243,"16.5":0.01215,"16.6":0.00972},G:{"8":0,"17":0.13047,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05079,"10.0-10.2":0,"10.3":0.00263,"11.0-11.2":0.00088,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.23818,"13.0-13.1":0.06042,"13.2":0.00525,"13.3":0.01051,"13.4-13.7":0.03765,"14.0-14.4":0.14186,"14.5-14.8":0.53678,"15.0-15.1":0.04028,"15.2-15.3":0.0359,"15.4":0.0972,"15.5":0.21279,"15.6-15.7":0.4352,"16.0":0.44571,"16.1":0.29422,"16.2":0.338,"16.3":0.95359,"16.4":0.27496,"16.5":1.52452,"16.6":2.88968},P:{"4":0.57688,"20":0.73882,"21":0.79954,"5.0-5.4":0.01012,"6.2-6.4":0,"7.2-7.4":0.5364,"8.2":0,"9.2":0.01012,"10.1":0,"11.1-11.2":0.11133,"12.0":0.01012,"13.0":2.70224,"14.0":0.0506,"15.0":0.01012,"16.0":0.19229,"17.0":0.01012,"18.0":0.09109,"19.0":0.15181},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02477,"4.4":0,"4.4.3-4.4.4":0.04953},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":72.46092},R:{_:"0"},M:{"0":0.06813},Q:{"13.1":0},O:{"0":1.35503},H:{"0":0.98185}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00269,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00269,"103":0,"104":0,"105":0,"106":0.00269,"107":0,"108":0,"109":0.00539,"110":0.00539,"111":0.01077,"112":0.00269,"113":0.00539,"114":0.00269,"115":0.29084,"116":0.01347,"117":0.35278,"118":0.0404,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00269,"46":0.00269,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.01885,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00539,"66":0,"67":0.35548,"68":0,"69":0,"70":0.00269,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00539,"80":0,"81":0.00808,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00808,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.01077,"99":0.01885,"100":0,"101":0.00539,"102":0,"103":0.00539,"104":0,"105":0.00269,"106":0.00539,"107":0,"108":0.00808,"109":0.5386,"110":0.01077,"111":0.00539,"112":0.00539,"113":0.01077,"114":0.12388,"115":0.0781,"116":2.62298,"117":0.78636,"118":0.00808,"119":0.00269,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00269,"70":0,"71":0.01616,"72":0.11311,"73":0.02154,"74":0,"75":0,"76":0,"77":0.01347,"78":0.00269,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.36356,"100":0,"101":0.00808,"102":0.00808,"9.5-9.6":0,"10.0-10.1":0,"10.5":0.00269,"10.6":0.01885,"11.1":0.00269,"11.5":0,"11.6":0,"12.1":0.00269},B:{"12":0,"13":0,"14":0.00539,"15":0,"16":0,"17":0,"18":0.00269,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00539,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01885,"110":0.00269,"111":0,"112":0.00269,"113":0.02424,"114":0.01077,"115":0.0754,"116":0.56822,"117":0.40395},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00269,"15":0.00269,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00269,"14.1":0.00269,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00269,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0.01077,"16.6":0.06194,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00089,"8.1-8.4":0,"9.0-9.2":0.00894,"9.3":0.00805,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.00984,"12.0-12.1":0.05813,"12.2-12.5":0.10106,"13.0-13.1":0.0939,"13.2":0.04024,"13.3":0.04919,"13.4-13.7":0.02146,"14.0-14.4":0.30138,"14.5-14.8":0.73244,"15.0-15.1":0.06081,"15.2-15.3":0.06976,"15.4":0.02415,"15.5":0.03935,"15.6-15.7":0.47577,"16.0":0.08854,"16.1":0.27634,"16.2":0.47041,"16.3":0.31301,"16.4":0.10732,"16.5":0.68772,"16.6":4.16747,"17.0":0.68236,"17.1":0.00179},P:{"4":1.13567,"20":0.36181,"21":0.69346,"22":1.80903,"5.0-5.4":0.0201,"6.2-6.4":0.01005,"7.2-7.4":0.33166,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.13065,"12.0":0.03015,"13.0":1.00502,"14.0":0.03015,"15.0":0.01005,"16.0":0.0603,"17.0":0.01005,"18.0":0.201,"19.0":0.201},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01678,"4.4":0,"4.4.3-4.4.4":0.02937},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00269,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":73.02851},R:{_:"0"},M:{"0":0.16075},Q:{"13.1":0},O:{"0":1.28603},H:{"0":1.08609}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DK.js
index 595bfdc88c110c..1b0f79d74d5b4a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DK.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.03427,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01371,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.02056,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.05483,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00685,"109":0.00685,"110":0.00685,"111":0,"112":0.00685,"113":0.01371,"114":0.02742,"115":0.3427,"116":1.2817,"117":0.04112,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00685,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.01371,"45":0,"46":0,"47":0,"48":0,"49":0.01371,"50":0,"51":0,"52":0.03427,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00685,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.03427,"80":0,"81":0,"83":0,"84":0,"85":0.01371,"86":0.00685,"87":0.04112,"88":0.04798,"89":0.02056,"90":0.00685,"91":0,"92":0.01371,"93":0.05483,"94":0.00685,"95":0.01371,"96":0.00685,"97":0.00685,"98":0.00685,"99":0.02056,"100":0.00685,"101":0.00685,"102":0.00685,"103":0.1782,"104":0.02056,"105":0.02056,"106":0.01371,"107":0.02742,"108":0.03427,"109":0.67855,"110":0.06854,"111":0.0891,"112":0.14393,"113":0.28787,"114":2.51542,"115":18.37557,"116":9.57504,"117":0.00685,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00685,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01371,"96":0,"97":0,"98":0,"99":0.00685,"100":0.5963,"101":0.24674,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00685,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00685,"104":0,"105":0.00685,"106":0.00685,"107":0.02056,"108":0.03427,"109":0.06854,"110":0.01371,"111":0.00685,"112":0.02742,"113":0.04798,"114":0.23304,"115":4.57162,"116":1.60384},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.00685,"13":0.00685,"14":0.06169,"15":0.01371,"17":0.01371,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00685,"10.1":0,"11.1":0,"12.1":0.00685,"13.1":0.06854,"14.1":0.18506,"15.1":0.03427,"15.2-15.3":0.02742,"15.4":0.04798,"15.5":0.06169,"15.6":0.41124,"16.0":0.05483,"16.1":0.11652,"16.2":0.10281,"16.3":0.35641,"16.4":0.14393,"16.5":0.84304,"16.6":1.29541},G:{"8":0,"17":0.1966,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00317,"9.0-9.2":0.12684,"9.3":0.11733,"10.0-10.2":0.00317,"10.3":0.09513,"11.0-11.2":0.01903,"11.3-11.4":0.01903,"12.0-12.1":0.01268,"12.2-12.5":0.35515,"13.0-13.1":0,"13.2":0.00317,"13.3":0.00951,"13.4-13.7":0.02537,"14.0-14.4":0.13952,"14.5-14.8":0.22514,"15.0-15.1":0.07927,"15.2-15.3":0.11416,"15.4":0.0983,"15.5":0.28856,"15.6-15.7":1.76307,"16.0":0.84348,"16.1":1.83918,"16.2":0.78641,"16.3":2.21335,"16.4":0.28222,"16.5":6.69714,"16.6":15.32859},P:{"4":0.02075,"20":0.0415,"21":0.10376,"22":1.34882,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01038,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01038,"18.0":0.01038,"19.0":0.02075},I:{"0":0,"3":0,"4":0.00771,"2.1":0,"2.2":0.01157,"2.3":0.00578,"4.1":0.02507,"4.2-4.3":0.02121,"4.4":0,"4.4.3-4.4.4":0.09641},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.06361,"9":0.00707,"10":0.00707,"11":0.14843,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":18.41387},R:{_:"0"},M:{"0":0.28629},Q:{"13.1":0},O:{"0":0.00944},H:{"0":0.13403}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.02192,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01462,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00731,"88":0.00731,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.05116,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00731,"113":0.00731,"114":0.00731,"115":0.11693,"116":0.07308,"117":1.16928,"118":0.10962,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00731,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00731,"45":0,"46":0,"47":0,"48":0,"49":0.00731,"50":0,"51":0,"52":0.02923,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00731,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00731,"77":0,"78":0.00731,"79":0.01462,"80":0,"81":0,"83":0,"84":0,"85":0.00731,"86":0.02923,"87":0.02923,"88":0.02192,"89":0.01462,"90":0.00731,"91":0.00731,"92":0.00731,"93":0.05116,"94":0.00731,"95":0.00731,"96":0.00731,"97":0.00731,"98":0.00731,"99":0.00731,"100":0.00731,"101":0.00731,"102":0.00731,"103":0.2704,"104":0.01462,"105":0.02192,"106":0.00731,"107":0.04385,"108":0.03654,"109":0.85504,"110":0.07308,"111":0.08039,"112":0.16078,"113":0.14616,"114":0.89888,"115":1.50545,"116":26.10418,"117":7.62224,"118":0.00731,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00731,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.01462,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.02192,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00731,"96":0,"97":0,"98":0,"99":0.00731,"100":0.13154,"101":0.28501,"102":0.62849,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01462,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00731,"104":0,"105":0.00731,"106":0.00731,"107":0.00731,"108":0.00731,"109":0.06577,"110":0.00731,"111":0.00731,"112":0.01462,"113":0.02192,"114":0.04385,"115":0.23386,"116":3.26668,"117":2.71858},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00731,"14":0.0877,"15":0.02192,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00731,"13.1":0.08039,"14.1":0.28501,"15.1":0.05846,"15.2-15.3":0.05116,"15.4":0.07308,"15.5":0.10231,"15.6":0.49694,"16.0":0.0877,"16.1":0.16808,"16.2":0.13885,"16.3":0.41656,"16.4":0.24116,"16.5":0.4531,"16.6":2.03893,"17.0":0.11693,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.06629,"9.3":0.0904,"10.0-10.2":0,"10.3":0.06027,"11.0-11.2":0.02411,"11.3-11.4":0.00904,"12.0-12.1":0.00904,"12.2-12.5":0.28024,"13.0-13.1":0,"13.2":0,"13.3":0.06931,"13.4-13.7":0.02411,"14.0-14.4":0.09341,"14.5-14.8":0.20792,"15.0-15.1":0.07232,"15.2-15.3":0.12355,"15.4":0.09944,"15.5":0.23806,"15.6-15.7":1.47052,"16.0":0.79854,"16.1":1.56996,"16.2":0.6539,"16.3":1.76282,"16.4":0.16272,"16.5":0.74731,"16.6":18.95103,"17.0":2.01594,"17.1":0},P:{"4":0.0311,"20":0.0311,"21":0.04147,"22":1.05739,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01037,"18.0":0,"19.0":0.01037},I:{"0":0,"3":0,"4":0.00915,"2.1":0,"2.2":0.00457,"2.3":0.00457,"4.1":0.00762,"4.2-4.3":0.02135,"4.4":0,"4.4.3-4.4.4":0.08234},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.06577,"9":0.00731,"10":0.00731,"11":0.11693,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":14.74076},R:{_:"0"},M:{"0":0.21805},Q:{"13.1":0},O:{"0":0.01346},H:{"0":0.11214}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DM.js
index a3b6ca061b94f5..3876fbcf77cebe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.0042,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.01261,"100":0,"101":0,"102":0.0042,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.02101,"114":0,"115":0.18489,"116":0.19329,"117":0.0084,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.0042,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.0042,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.0042,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0084,"70":0,"71":0,"72":0.0042,"73":0.0042,"74":0,"75":0.0042,"76":0.47483,"77":0.06303,"78":0,"79":0.0084,"80":0,"81":0.0042,"83":0.0084,"84":0,"85":0,"86":0,"87":0.0084,"88":0.01681,"89":0,"90":0,"91":0,"92":0,"93":0.04622,"94":0.0042,"95":0.0042,"96":0,"97":0,"98":0,"99":0.0042,"100":0.0042,"101":0,"102":0.0042,"103":0.07984,"104":0,"105":0.07984,"106":0.02521,"107":0.0084,"108":0.0042,"109":0.4286,"110":0.05463,"111":0.01261,"112":0.01261,"113":0.08824,"114":0.46642,"115":5.42058,"116":3.06326,"117":0.0084,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.02101,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.0042,"71":0.13446,"72":0.04622,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0042,"96":0,"97":0,"98":0,"99":0,"100":0.18489,"101":0.12186,"102":0.05463,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.0042,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.0042,"109":0.0084,"110":0.0042,"111":0,"112":0.0042,"113":0.0084,"114":0.03782,"115":2.20185,"116":0.52525},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.05463,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.0042,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0084,"14.1":0.01261,"15.1":0,"15.2-15.3":0,"15.4":0.0042,"15.5":0.0084,"15.6":0.05883,"16.0":0,"16.1":0.03782,"16.2":0.07143,"16.3":0.02521,"16.4":0.0042,"16.5":0.24792,"16.6":0.14287},G:{"8":0,"17":0.1022,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04487,"10.0-10.2":0,"10.3":0.04985,"11.0-11.2":0.00623,"11.3-11.4":0.00623,"12.0-12.1":0.00374,"12.2-12.5":0.12339,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.03365,"14.5-14.8":0.04861,"15.0-15.1":0.02617,"15.2-15.3":0.00997,"15.4":0.01371,"15.5":0.03614,"15.6-15.7":1.22267,"16.0":0.36518,"16.1":1.30867,"16.2":0.25176,"16.3":0.66057,"16.4":0.12339,"16.5":2.89652,"16.6":5.12874},P:{"4":0.17803,"20":0.30369,"21":0.38747,"5.0-5.4":0.04189,"6.2-6.4":0.01047,"7.2-7.4":0.81682,"8.2":0,"9.2":0.01047,"10.1":0,"11.1-11.2":0.02094,"12.0":0,"13.0":0.02094,"14.0":0.01047,"15.0":0,"16.0":0.02094,"17.0":0.04189,"18.0":0.02094,"19.0":0.2618},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.54222},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03362,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":61.64759},R:{_:"0"},M:{"0":0.15075},Q:{"13.1":0},O:{"0":0.13915},H:{"0":0.99354}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.0086,"116":0.0602,"117":0.2107,"118":0.0086,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0086,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0043,"70":0,"71":0,"72":0,"73":0,"74":0.0043,"75":0.0043,"76":0.5762,"77":0.0731,"78":0,"79":0.0129,"80":0,"81":0.0043,"83":0,"84":0,"85":0,"86":0,"87":0.0043,"88":0.0043,"89":0.0129,"90":0.0043,"91":0.0086,"92":0,"93":0.043,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0258,"101":0,"102":0.0043,"103":0.0473,"104":0.0043,"105":0.1204,"106":0.0086,"107":0.0043,"108":0.0129,"109":0.4687,"110":0.0043,"111":0.0043,"112":0.0215,"113":0.0344,"114":0.2322,"115":0.3053,"116":6.7639,"117":1.6512,"118":0.0043,"119":0.0129,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.0215,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.2967,"73":0,"74":0,"75":0,"76":0,"77":0.0086,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0215,"101":0.1376,"102":0.0731,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0086,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.1161,"110":0,"111":0,"112":0,"113":0,"114":0.0129,"115":0.043,"116":1.6555,"117":1.0965},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0043,"14":0.1075,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.0043,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0086,"14.1":0.0301,"15.1":0,"15.2-15.3":0,"15.4":0.0086,"15.5":0.0215,"15.6":0.1075,"16.0":0,"16.1":0.0602,"16.2":0.0602,"16.3":0.0258,"16.4":0.0172,"16.5":0.0344,"16.6":0.4042,"17.0":0.0946,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.11702,"10.0-10.2":0,"10.3":0.03203,"11.0-11.2":0.00739,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.12442,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.1121,"14.0-14.4":0.08377,"14.5-14.8":0.05913,"15.0-15.1":0.01232,"15.2-15.3":0.00985,"15.4":0.01478,"15.5":0.12688,"15.6-15.7":1.25278,"16.0":0.16876,"16.1":1.7332,"16.2":0.1121,"16.3":0.32028,"16.4":0.04681,"16.5":0.18108,"16.6":6.89214,"17.0":0.78838,"17.1":0},P:{"4":0.06369,"20":0.13799,"21":0.11676,"22":3.89556,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.60503,"8.2":0,"9.2":0,"10.1":0.02123,"11.1-11.2":0.01061,"12.0":0,"13.0":0.04246,"14.0":0,"15.0":0,"16.0":0.02123,"17.0":0.0743,"18.0":0.03184,"19.0":0.06369},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.7481},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0.0057},L:{"0":62.5342},R:{_:"0"},M:{"0":0.0627},Q:{"13.1":0},O:{"0":0.1026},H:{"0":0.86882}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DO.js
index 5c36e93b889e37..34a23b6df43f67 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.004,"49":0,"50":0,"51":0,"52":0.004,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.004,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.044,"74":0,"75":0,"76":0,"77":0,"78":0.004,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.004,"103":0,"104":0.084,"105":0,"106":0,"107":0,"108":0,"109":0.004,"110":0,"111":0,"112":0.004,"113":0.008,"114":0.036,"115":0.104,"116":0.276,"117":0.008,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.008,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.004,"48":0.004,"49":0.02,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.004,"57":0,"58":0,"59":0,"60":0.004,"61":0,"62":0,"63":0,"64":0,"65":0.004,"66":0.02,"67":0,"68":0.004,"69":0,"70":0.004,"71":0.004,"72":0.004,"73":0.004,"74":0.004,"75":0.004,"76":0.016,"77":0.004,"78":0.004,"79":0.028,"80":0.004,"81":0.016,"83":0.004,"84":0.004,"85":0.012,"86":0.004,"87":0.028,"88":0.012,"89":0.004,"90":0.004,"91":0.032,"92":0.004,"93":0.016,"94":0.004,"95":0.004,"96":0.004,"97":0.012,"98":0.004,"99":0.008,"100":0.004,"101":0.004,"102":0.036,"103":0.052,"104":0.004,"105":0.028,"106":0.028,"107":0.02,"108":0.036,"109":0.732,"110":0.02,"111":0.04,"112":0.04,"113":0.048,"114":0.416,"115":5.632,"116":2.928,"117":0.008,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.004,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.004,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.004,"70":0,"71":0.008,"72":0.008,"73":0,"74":0,"75":0,"76":0.004,"77":0.004,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.008,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.008,"95":0.012,"96":0,"97":0,"98":0,"99":0.012,"100":0.568,"101":0.216,"102":0.004,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.004,"16":0,"17":0,"18":0.016,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.008,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.004,"106":0,"107":0.008,"108":0.004,"109":0.02,"110":0.004,"111":0.008,"112":0.004,"113":0.008,"114":0.072,"115":1.028,"116":0.328},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.008,"14":0.02,"15":0.004,"17":0.008,_:"0","3.1":0,"3.2":0,"5.1":0.004,"6.1":0,"7.1":0,"9.1":0.004,"10.1":0,"11.1":0,"12.1":0.004,"13.1":0.068,"14.1":0.032,"15.1":0.008,"15.2-15.3":0.004,"15.4":0.028,"15.5":0.016,"15.6":0.076,"16.0":0.008,"16.1":0.032,"16.2":0.032,"16.3":0.064,"16.4":0.024,"16.5":0.252,"16.6":0.192},G:{"8":0,"17":0.27862,"3.2":0.00812,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00271,"6.0-6.1":0,"7.0-7.1":0.02976,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.11902,"10.0-10.2":0,"10.3":0.02435,"11.0-11.2":0.00812,"11.3-11.4":0.00812,"12.0-12.1":0.00271,"12.2-12.5":0.35436,"13.0-13.1":0.00541,"13.2":0.00271,"13.3":0.02164,"13.4-13.7":0.06763,"14.0-14.4":0.25698,"14.5-14.8":0.43821,"15.0-15.1":0.11361,"15.2-15.3":0.2164,"15.4":0.18394,"15.5":0.3219,"15.6-15.7":3.37046,"16.0":0.93323,"16.1":1.67711,"16.2":0.85208,"16.3":1.89893,"16.4":0.30567,"16.5":4.98536,"16.6":10.54688},P:{"4":0.13514,"20":0.08317,"21":0.17673,"5.0-5.4":0.02079,"6.2-6.4":0,"7.2-7.4":0.07277,"8.2":0,"9.2":0.02079,"10.1":0,"11.1-11.2":0.06237,"12.0":0,"13.0":0.0104,"14.0":0.0104,"15.0":0.0104,"16.0":0.05198,"17.0":0.02079,"18.0":0.02079,"19.0":0.07277},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02019,"4.4":0,"4.4.3-4.4.4":0.40381},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.032,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":53.872},R:{_:"0"},M:{"0":0.444},Q:{"13.1":0},O:{"0":0.054},H:{"0":0.18177}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00432,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00432,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.04756,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00432,"103":0,"104":0.09945,"105":0.00432,"106":0.01297,"107":0,"108":0,"109":0.00865,"110":0,"111":0,"112":0.00432,"113":0.00865,"114":0.01297,"115":0.04324,"116":0.03027,"117":0.3243,"118":0.02594,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00432,"34":0,"35":0,"36":0,"37":0,"38":0.00432,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00432,"48":0,"49":0.02162,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00432,"64":0.00432,"65":0.00432,"66":0.00432,"67":0,"68":0.00432,"69":0.00865,"70":0.00432,"71":0,"72":0.00865,"73":0.00432,"74":0.00865,"75":0.00432,"76":0.00432,"77":0.00432,"78":0.00432,"79":0.02162,"80":0.00865,"81":0.02594,"83":0.00865,"84":0,"85":0.00865,"86":0.00865,"87":0.03892,"88":0.01297,"89":0.00865,"90":0.02594,"91":0.03027,"92":0.00865,"93":0.03027,"94":0.00432,"95":0.00432,"96":0.01297,"97":0.0173,"98":0.00432,"99":0.00865,"100":0.00432,"101":0.00432,"102":0.00865,"103":0.05189,"104":0.00432,"105":0.03027,"106":0.04324,"107":0.07351,"108":0.04324,"109":0.9729,"110":0.03892,"111":0.06918,"112":0.05621,"113":0.03892,"114":0.14269,"115":0.25512,"116":8.04264,"117":2.12741,"118":0.00432,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00432,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00432,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00432,"70":0,"71":0,"72":0.0173,"73":0,"74":0,"75":0,"76":0,"77":0.0173,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00432,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00432,"94":0.00865,"95":0.0173,"96":0.0173,"97":0,"98":0,"99":0.00865,"100":0.13837,"101":0.24214,"102":0.30268,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.0173,"79":0,"80":0,"81":0,"83":0,"84":0.00432,"85":0.00432,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0173,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00432,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00865,"108":0,"109":0.03027,"110":0.00432,"111":0.00865,"112":0.00432,"113":0.00865,"114":0.02162,"115":0.03027,"116":0.96858,"117":0.71778},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00432,"14":0.0173,"15":0.00432,_:"0","3.1":0,"3.2":0,"5.1":0.00432,"6.1":0,"7.1":0,"9.1":0.03459,"10.1":0,"11.1":0,"12.1":0.00432,"13.1":0.02162,"14.1":0.03892,"15.1":0.00865,"15.2-15.3":0.00432,"15.4":0.00865,"15.5":0.02162,"15.6":0.07783,"16.0":0.00865,"16.1":0.03027,"16.2":0.02594,"16.3":0.05621,"16.4":0.03892,"16.5":0.11675,"16.6":0.4324,"17.0":0.02162,"17.1":0},G:{"8":0,"3.2":0.02965,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.04582,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.1105,"10.0-10.2":0,"10.3":0.03234,"11.0-11.2":0.01078,"11.3-11.4":0.00809,"12.0-12.1":0.03504,"12.2-12.5":0.35037,"13.0-13.1":0.01078,"13.2":0.00539,"13.3":0.0539,"13.4-13.7":0.06199,"14.0-14.4":0.28568,"14.5-14.8":0.39618,"15.0-15.1":0.11859,"15.2-15.3":0.18057,"15.4":0.1671,"15.5":0.32611,"15.6-15.7":3.39855,"16.0":0.81393,"16.1":1.43381,"16.2":0.70343,"16.3":1.41764,"16.4":0.24526,"16.5":0.76811,"16.6":13.98771,"17.0":1.50119,"17.1":0.00809},P:{"4":0.08462,"20":0.06347,"21":0.10578,"22":1.25878,"5.0-5.4":0.01058,"6.2-6.4":0,"7.2-7.4":0.0952,"8.2":0,"9.2":0.01058,"10.1":0,"11.1-11.2":0.05289,"12.0":0,"13.0":0.01058,"14.0":0.01058,"15.0":0.01058,"16.0":0.05289,"17.0":0.03173,"18.0":0.02116,"19.0":0.04231},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02482,"4.4":0,"4.4.3-4.4.4":0.41569},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00528,"9":0,"10":0,"11":0.04228,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":52.41843},R:{_:"0"},M:{"0":0.33488},Q:{"13.1":0},O:{"0":0.06244},H:{"0":0.2042}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DZ.js
index f1c8b258cfbc12..f2463d0587c944 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/DZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0.00336,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00336,"35":0,"36":0,"37":0,"38":0.00336,"39":0,"40":0.00336,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00336,"48":0,"49":0,"50":0,"51":0,"52":0.02349,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00336,"69":0,"70":0,"71":0,"72":0.00336,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00671,"79":0,"80":0,"81":0,"82":0.00336,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00336,"89":0,"90":0.00336,"91":0.00336,"92":0,"93":0,"94":0.00336,"95":0,"96":0,"97":0,"98":0,"99":0.00336,"100":0,"101":0,"102":0.01007,"103":0.00336,"104":0.00671,"105":0.00336,"106":0.00671,"107":0.00336,"108":0.00671,"109":0.00671,"110":0.01007,"111":0.00671,"112":0.00671,"113":0.01342,"114":0.01678,"115":0.42944,"116":0.42273,"117":0.01342,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00336,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00336,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00336,"33":0.00336,"34":0,"35":0,"36":0,"37":0,"38":0.00336,"39":0,"40":0.00336,"41":0,"42":0.00336,"43":0.01678,"44":0.00336,"45":0,"46":0,"47":0.00336,"48":0,"49":0.02684,"50":0.00336,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00671,"57":0,"58":0.00671,"59":0,"60":0.00336,"61":0.00336,"62":0,"63":0.00671,"64":0.00336,"65":0.00336,"66":0,"67":0.00336,"68":0.01678,"69":0.00671,"70":0.00671,"71":0.00336,"72":0.00336,"73":0.00336,"74":0.00336,"75":0.00336,"76":0.00336,"77":0.00336,"78":0.00671,"79":0.02349,"80":0.00336,"81":0.0302,"83":0.01342,"84":0.00336,"85":0.01342,"86":0.01007,"87":0.01678,"88":0.00671,"89":0.00671,"90":0.00336,"91":0.00336,"92":0.00671,"93":0.00336,"94":0.00336,"95":0.02013,"96":0.00671,"97":0.00671,"98":0.02349,"99":0.00671,"100":0.01007,"101":0.00671,"102":0.02684,"103":0.03355,"104":0.01007,"105":0.0302,"106":0.0302,"107":0.03691,"108":0.04697,"109":2.73097,"110":0.01007,"111":0.02349,"112":0.0302,"113":0.02684,"114":0.17111,"115":2.40554,"116":1.47285,"117":0.00336,"118":0.00336,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00671,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00336,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00336,"64":0.00336,"65":0,"66":0,"67":0,"68":0,"69":0.00336,"70":0.01007,"71":0.0302,"72":0.02684,"73":0,"74":0,"75":0,"76":0.00336,"77":0.00336,"78":0,"79":0.01342,"80":0,"81":0,"82":0,"83":0,"84":0.00336,"85":0.00671,"86":0.00336,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.09394,"96":0,"97":0,"98":0.00336,"99":0.00671,"100":0.19124,"101":0.21808,"102":0.00671,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00336,"13":0,"14":0.00336,"15":0.00336,"16":0,"17":0,"18":0.00671,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00336,"91":0,"92":0.01007,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00336,"107":0.00671,"108":0.00336,"109":0.04026,"110":0.00336,"111":0.00336,"112":0.00336,"113":0.00671,"114":0.05704,"115":0.54016,"116":0.18788},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00336,"10":0,"11":0,"12":0,"13":0,"14":0.00671,"15":0,"17":0.00336,_:"0","3.1":0,"3.2":0,"5.1":0.00336,"6.1":0,"7.1":0,"9.1":0.00336,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00336,"14.1":0.00671,"15.1":0.00336,"15.2-15.3":0.00336,"15.4":0.00336,"15.5":0.00336,"15.6":0.02013,"16.0":0,"16.1":0.00671,"16.2":0.01007,"16.3":0.01007,"16.4":0.05368,"16.5":0.05033,"16.6":0.05033},G:{"8":0.00304,"17":0.08208,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00152,"5.0-5.1":0.00684,"6.0-6.1":0.00608,"7.0-7.1":0.06536,"8.1-8.4":0.00836,"9.0-9.2":0.0038,"9.3":0.11628,"10.0-10.2":0.00228,"10.3":0.0684,"11.0-11.2":0.02356,"11.3-11.4":0.00912,"12.0-12.1":0.01368,"12.2-12.5":0.18847,"13.0-13.1":0.00456,"13.2":0.00456,"13.3":0.01672,"13.4-13.7":0.02736,"14.0-14.4":0.07144,"14.5-14.8":0.1102,"15.0-15.1":0.05396,"15.2-15.3":0.05624,"15.4":0.0836,"15.5":0.12692,"15.6-15.7":0.95301,"16.0":0.36099,"16.1":0.45978,"16.2":0.24927,"16.3":0.59886,"16.4":0.22571,"16.5":1.43331,"16.6":2.16136},P:{"4":0.15369,"20":0.09221,"21":0.25614,"5.0-5.4":0,"6.2-6.4":0.01025,"7.2-7.4":0.10246,"8.2":0,"9.2":0.03074,"10.1":0.01025,"11.1-11.2":0.02049,"12.0":0.01025,"13.0":0.04098,"14.0":0.02049,"15.0":0.02049,"16.0":0.04098,"17.0":0.04098,"18.0":0.05123,"19.0":0.09221},I:{"0":0,"3":0,"4":0.0053,"2.1":0,"2.2":0,"2.3":0.01325,"4.1":0.0106,"4.2-4.3":0.0265,"4.4":0,"4.4.3-4.4.4":0.30215},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01747,"9":0.00349,"10":0.00349,"11":0.05941,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":76.56936},R:{_:"0"},M:{"0":0.16613},Q:{"13.1":0.00665},O:{"0":0.59805},H:{"0":0.7046}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00316,"39":0,"40":0,"41":0,"42":0,"43":0.00316,"44":0,"45":0,"46":0,"47":0.00316,"48":0,"49":0,"50":0,"51":0,"52":0.02844,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00316,"68":0,"69":0,"70":0,"71":0,"72":0.00316,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00316,"82":0,"83":0,"84":0,"85":0.00316,"86":0,"87":0,"88":0.00316,"89":0,"90":0,"91":0.00632,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00316,"100":0,"101":0,"102":0.01896,"103":0.00316,"104":0.00316,"105":0.00316,"106":0.00316,"107":0.00316,"108":0.00316,"109":0.00316,"110":0.0158,"111":0.00316,"112":0.00316,"113":0.00948,"114":0.00632,"115":0.31916,"116":0.02212,"117":0.3002,"118":0.02844,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00316,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00316,"34":0,"35":0,"36":0,"37":0,"38":0.00316,"39":0,"40":0.00316,"41":0,"42":0,"43":0.01264,"44":0,"45":0.00316,"46":0,"47":0.00316,"48":0,"49":0.02528,"50":0.00316,"51":0.00632,"52":0,"53":0,"54":0,"55":0.00316,"56":0.00632,"57":0,"58":0.00632,"59":0,"60":0.00316,"61":0.00316,"62":0,"63":0.00632,"64":0.00316,"65":0.00316,"66":0,"67":0,"68":0.00948,"69":0.00316,"70":0.00632,"71":0.00316,"72":0.00948,"73":0,"74":0.00948,"75":0.00316,"76":0.00316,"77":0.00316,"78":0.00316,"79":0.02528,"80":0.00316,"81":0.02528,"83":0.01264,"84":0.00632,"85":0.02528,"86":0.00632,"87":0.04424,"88":0.01264,"89":0.00632,"90":0.01264,"91":0.00632,"92":0.00948,"93":0.00948,"94":0.00316,"95":0.0158,"96":0.00948,"97":0.00948,"98":0.02212,"99":0.01264,"100":0.00948,"101":0.01264,"102":0.04108,"103":0.02212,"104":0.00948,"105":0.02528,"106":0.02212,"107":0.07268,"108":0.05372,"109":2.50588,"110":0.01896,"111":0.02212,"112":0.02844,"113":0.01896,"114":0.06636,"115":0.079,"116":2.49008,"117":0.75524,"118":0.00316,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00316,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00316,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00316,"70":0.00632,"71":0.00316,"72":0.0316,"73":0.01264,"74":0,"75":0,"76":0,"77":0.0158,"78":0.00316,"79":0.01264,"80":0,"81":0,"82":0,"83":0,"84":0.00632,"85":0.00948,"86":0.00948,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.07584,"96":0,"97":0,"98":0,"99":0.00316,"100":0.0316,"101":0.1264,"102":0.14852,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00316,"13":0.00316,"14":0,"15":0.00316,"16":0,"17":0,"18":0.00632,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.00316,"87":0,"88":0,"89":0,"90":0.02844,"91":0,"92":0.00948,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00316,"108":0.00316,"109":0.0316,"110":0.00316,"111":0.00632,"112":0.00316,"113":0.00316,"114":0.0158,"115":0.0158,"116":0.4582,"117":0.24648},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00316,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00316,"6.1":0,"7.1":0,"9.1":0.00316,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00316,"14.1":0.00316,"15.1":0,"15.2-15.3":0,"15.4":0.00316,"15.5":0.00316,"15.6":0.0158,"16.0":0,"16.1":0.00632,"16.2":0.00316,"16.3":0.00948,"16.4":0.00632,"16.5":0.0158,"16.6":0.06952,"17.0":0.00948,"17.1":0},G:{"8":0,"3.2":0.0024,"4.0-4.1":0,"4.2-4.3":0.0008,"5.0-5.1":0.0064,"6.0-6.1":0.0048,"7.0-7.1":0.06957,"8.1-8.4":0.0072,"9.0-9.2":0.004,"9.3":0.07436,"10.0-10.2":0.0032,"10.3":0.03598,"11.0-11.2":0.01919,"11.3-11.4":0.0064,"12.0-12.1":0.008,"12.2-12.5":0.15992,"13.0-13.1":0.0048,"13.2":0.004,"13.3":1.30577,"13.4-13.7":0.02079,"14.0-14.4":0.07117,"14.5-14.8":0.09356,"15.0-15.1":0.04478,"15.2-15.3":0.04958,"15.4":0.06957,"15.5":0.13673,"15.6-15.7":0.89157,"16.0":0.23669,"16.1":0.35343,"16.2":0.2127,"16.3":0.37422,"16.4":0.14953,"16.5":0.36542,"16.6":2.61235,"17.0":0.51655,"17.1":0},P:{"4":0.11425,"20":0.06232,"21":0.16619,"22":0.89325,"5.0-5.4":0,"6.2-6.4":0.01039,"7.2-7.4":0.09348,"8.2":0,"9.2":0.08309,"10.1":0,"11.1-11.2":0.01039,"12.0":0.01039,"13.0":0.04155,"14.0":0.02077,"15.0":0.01039,"16.0":0.03116,"17.0":0.04155,"18.0":0.03116,"19.0":0.06232},I:{"0":0,"3":0,"4":0.00609,"2.1":0,"2.2":0,"2.3":0.01827,"4.1":0.00913,"4.2-4.3":0.02131,"4.4":0,"4.4.3-4.4.4":0.25268},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01317,"9":0.00329,"10":0.00988,"11":0.05267,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":78.51548},R:{_:"0"},M:{"0":0.12312},Q:{"13.1":0.00684},O:{"0":0.47196},H:{"0":0.57633}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EC.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EC.js
index 52eab00d12b5ee..453404529913d8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EC.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EC.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01018,"53":0.00509,"54":0,"55":0,"56":0,"57":0.00509,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00509,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00509,"73":0.01018,"74":0,"75":0.00509,"76":0,"77":0,"78":0.00509,"79":0,"80":0,"81":0,"82":0.00509,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01018,"89":0.00509,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00509,"97":0,"98":0,"99":0.00509,"100":0.00509,"101":0,"102":0.01527,"103":0,"104":0.01018,"105":0,"106":0,"107":0.00509,"108":0.00509,"109":0.01527,"110":0.00509,"111":0.01018,"112":0.01018,"113":0.01527,"114":0.03562,"115":0.52417,"116":1.13994,"117":0.0458,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00509,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.02036,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.02036,"48":0,"49":0.01018,"50":0,"51":0,"52":0,"53":0.00509,"54":0,"55":0.00509,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00509,"66":0.00509,"67":0,"68":0.01018,"69":0,"70":0,"71":0,"72":0,"73":0.00509,"74":0.00509,"75":0.00509,"76":0.00509,"77":0,"78":0.00509,"79":0.10178,"80":0.00509,"81":0.00509,"83":0.00509,"84":0.00509,"85":0.01018,"86":0.00509,"87":0.03053,"88":0.00509,"89":0,"90":0.00509,"91":0.15776,"92":0.00509,"93":0.00509,"94":0.00509,"95":0.00509,"96":0.01018,"97":0.01527,"98":0.00509,"99":0.01018,"100":0.01018,"101":0.00509,"102":0.01018,"103":0.06616,"104":0.01527,"105":0.01527,"106":0.02036,"107":0.02036,"108":0.02545,"109":1.26716,"110":0.01527,"111":0.02545,"112":0.05089,"113":0.08651,"114":0.64121,"115":9.41465,"116":6.1068,"117":0.00509,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01018,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00509,"72":0.00509,"73":0,"74":0,"75":0,"76":0,"77":0.00509,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03562,"96":0,"97":0,"98":0,"99":0.01527,"100":0.79388,"101":0.45801,"102":0.01018,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00509,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00509,"108":0,"109":0.02036,"110":0.01018,"111":0.00509,"112":0.01018,"113":0.00509,"114":0.07125,"115":1.26716,"116":0.49363},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00509,"10":0,"11":0,"12":0,"13":0,"14":0.01018,"15":0,"17":0.00509,_:"0","3.1":0,"3.2":0,"5.1":0.01527,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00509,"13.1":0.02036,"14.1":0.06107,"15.1":0.00509,"15.2-15.3":0.00509,"15.4":0.01018,"15.5":0.01018,"15.6":0.05598,"16.0":0.00509,"16.1":0.06616,"16.2":0.02036,"16.3":0.05598,"16.4":0.02036,"16.5":0.15267,"16.6":0.19338},G:{"8":0,"17":0.11408,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01268,"6.0-6.1":0.00922,"7.0-7.1":0.00922,"8.1-8.4":0.00922,"9.0-9.2":0.0023,"9.3":0.02305,"10.0-10.2":0,"10.3":0.04148,"11.0-11.2":0.02535,"11.3-11.4":0.00691,"12.0-12.1":0.00922,"12.2-12.5":0.19359,"13.0-13.1":0.00115,"13.2":0,"13.3":0.00691,"13.4-13.7":0.01844,"14.0-14.4":0.04033,"14.5-14.8":0.10141,"15.0-15.1":0.09795,"15.2-15.3":0.02881,"15.4":0.03342,"15.5":0.15211,"15.6-15.7":1.03135,"16.0":0.37566,"16.1":0.52201,"16.2":0.30422,"16.3":0.7156,"16.4":0.09103,"16.5":2.08228,"16.6":5.45749},P:{"4":0.21378,"20":0.17306,"21":0.1527,"5.0-5.4":0.02036,"6.2-6.4":0,"7.2-7.4":0.11198,"8.2":0,"9.2":0.01018,"10.1":0.03054,"11.1-11.2":0.04072,"12.0":0.03054,"13.0":0.03054,"14.0":0.02036,"15.0":0.01018,"16.0":0.13234,"17.0":0.08144,"18.0":0.02036,"19.0":0.0509},I:{"0":0,"3":0,"4":0.01477,"2.1":0,"2.2":0.00985,"2.3":0.00985,"4.1":0.01477,"4.2-4.3":0.02462,"4.4":0,"4.4.3-4.4.4":0.14773},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01145,"9":0.00573,"10":0,"11":0.02863,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":59.31112},R:{_:"0"},M:{"0":0.15224},Q:{"13.1":0},O:{"0":0.04911},H:{"0":0.17203}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00541,"50":0,"51":0,"52":0.00541,"53":0,"54":0,"55":0,"56":0,"57":0.00541,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00541,"67":0,"68":0.00541,"69":0,"70":0,"71":0,"72":0,"73":0.01082,"74":0,"75":0.00541,"76":0,"77":0,"78":0.00541,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01082,"89":0.01082,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00541,"97":0,"98":0,"99":0.00541,"100":0.00541,"101":0,"102":0.01623,"103":0.00541,"104":0.01082,"105":0.00541,"106":0.00541,"107":0.00541,"108":0.00541,"109":0.01082,"110":0.01082,"111":0.01082,"112":0.01082,"113":0.02164,"114":0.02164,"115":0.25963,"116":0.08114,"117":1.30357,"118":0.12982,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01623,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.01623,"48":0,"49":0.01082,"50":0,"51":0,"52":0,"53":0.00541,"54":0,"55":0.00541,"56":0,"57":0,"58":0,"59":0,"60":0.00541,"61":0,"62":0,"63":0.00541,"64":0,"65":0.00541,"66":0,"67":0,"68":0.02164,"69":0.01082,"70":0.00541,"71":0.00541,"72":0.01082,"73":0.00541,"74":0.01082,"75":0.01082,"76":0.00541,"77":0,"78":0.01623,"79":0.10818,"80":0,"81":0.01082,"83":0.00541,"84":0.00541,"85":0.03786,"86":0.00541,"87":0.03245,"88":0.01082,"89":0,"90":0.00541,"91":0.14604,"92":0.00541,"93":0.01082,"94":0.00541,"95":0.00541,"96":0.01082,"97":0.01082,"98":0.00541,"99":0.01082,"100":0.01082,"101":0.00541,"102":0.00541,"103":0.08114,"104":0.01623,"105":0.02164,"106":0.02164,"107":0.01623,"108":0.03245,"109":1.25489,"110":0.01082,"111":0.04327,"112":0.05409,"113":0.07573,"114":0.27045,"115":0.27045,"116":14.33385,"117":3.79712,"118":0.00541,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01082,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00541,"70":0,"71":0,"72":0.00541,"73":0,"74":0,"75":0,"76":0,"77":0.01623,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03245,"96":0,"97":0,"98":0,"99":0.01623,"100":0.22177,"101":0.47599,"102":0.51926,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00541,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00541,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00541,"108":0,"109":0.02164,"110":0.00541,"111":0.00541,"112":0.00541,"113":0.00541,"114":0.02705,"115":0.04327,"116":1.07639,"117":0.89789},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00541,"10":0,"11":0,"12":0,"13":0,"14":0.01082,"15":0.00541,_:"0","3.1":0,"3.2":0,"5.1":0.02164,"6.1":0,"7.1":0,"9.1":0.02705,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02164,"14.1":0.03786,"15.1":0.00541,"15.2-15.3":0.01082,"15.4":0.01082,"15.5":0.01623,"15.6":0.07032,"16.0":0.00541,"16.1":0.03245,"16.2":0.03245,"16.3":0.0595,"16.4":0.03245,"16.5":0.08654,"16.6":0.40027,"17.0":0.03786,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01373,"6.0-6.1":0.00749,"7.0-7.1":0.00624,"8.1-8.4":0.00499,"9.0-9.2":0.00125,"9.3":0.01373,"10.0-10.2":0,"10.3":0.05118,"11.0-11.2":0.01872,"11.3-11.4":0.00999,"12.0-12.1":0.00749,"12.2-12.5":0.17476,"13.0-13.1":0.0025,"13.2":0,"13.3":0.06366,"13.4-13.7":0.01872,"14.0-14.4":0.03495,"14.5-14.8":0.09487,"15.0-15.1":0.07365,"15.2-15.3":0.02497,"15.4":0.03745,"15.5":0.12607,"15.6-15.7":0.98862,"16.0":0.3233,"16.1":0.5355,"16.2":0.29459,"16.3":0.60291,"16.4":0.07989,"16.5":0.27337,"16.6":7.28359,"17.0":1.15339,"17.1":0},P:{"4":0.17326,"20":0.09173,"21":0.10192,"22":1.25362,"5.0-5.4":0.01019,"6.2-6.4":0,"7.2-7.4":0.10192,"8.2":0,"9.2":0.01019,"10.1":0,"11.1-11.2":0.01019,"12.0":0.01019,"13.0":0.02038,"14.0":0.01019,"15.0":0.01019,"16.0":0.10192,"17.0":0.07134,"18.0":0.01019,"19.0":0.04077},I:{"0":0,"3":0,"4":0.01167,"2.1":0,"2.2":0.00389,"2.3":0.00778,"4.1":0.01167,"4.2-4.3":0.01944,"4.4":0,"4.4.3-4.4.4":0.19833},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01202,"9":0.00601,"10":0,"11":0.03606,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":56.13883},R:{_:"0"},M:{"0":0.13773},Q:{"13.1":0},O:{"0":0.04132},H:{"0":0.13909}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EE.js
index bfc3fc10ac3102..f2eb6ea593b56f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.02183,"49":0,"50":0,"51":0,"52":0.0291,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00728,"69":0.00728,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00728,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.0291,"88":0,"89":0,"90":0,"91":0,"92":0.02183,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.05821,"103":0.00728,"104":0,"105":0.00728,"106":0,"107":0,"108":0.00728,"109":0.00728,"110":0,"111":0.00728,"112":0.01455,"113":0.01455,"114":0.06548,"115":2.65574,"116":1.68803,"117":0.04366,"118":0.00728,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00728,"40":0,"41":0,"42":0,"43":0.00728,"44":0.00728,"45":0.00728,"46":0.00728,"47":0.00728,"48":0,"49":0.00728,"50":0,"51":0.00728,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.01455,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00728,"71":0.00728,"72":0,"73":0,"74":0.00728,"75":0,"76":0.00728,"77":0,"78":0.0291,"79":0.01455,"80":0.00728,"81":0.00728,"83":0.00728,"84":0,"85":0.02183,"86":0.00728,"87":0.03638,"88":0.00728,"89":0.00728,"90":0.01455,"91":0.01455,"92":0.00728,"93":0.14552,"94":0,"95":0.00728,"96":0.00728,"97":0.02183,"98":0,"99":0.00728,"100":0.00728,"101":0.00728,"102":0.02183,"103":0.02183,"104":0.00728,"105":0.01455,"106":0.08731,"107":0.01455,"108":0.05093,"109":1.14961,"110":0.05821,"111":5.05682,"112":0.09459,"113":0.18918,"114":2.09549,"115":18.30642,"116":9.44425,"117":0.00728,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.01455,"77":0.00728,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.08731,"96":0,"97":0,"98":0,"99":0.01455,"100":1.34606,"101":1.74624,"102":0.00728,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00728,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.02183,"87":0,"88":0.00728,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00728,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.01455,"109":0.02183,"110":0.01455,"111":0.00728,"112":0.00728,"113":0.00728,"114":0.17462,"115":3.52886,"116":0.96043},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01455,"10":0,"11":0,"12":0,"13":0,"14":0.07276,"15":0.00728,"17":0.01455,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01455,"10.1":0,"11.1":0,"12.1":0.01455,"13.1":0.04366,"14.1":0.08004,"15.1":0.01455,"15.2-15.3":0.01455,"15.4":0.0291,"15.5":0.07276,"15.6":0.1819,"16.0":0.02183,"16.1":0.08004,"16.2":0.08731,"16.3":0.14552,"16.4":0.07276,"16.5":0.5166,"16.6":0.47294},G:{"8":0.00342,"17":0.20678,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00342,"6.0-6.1":0.00342,"7.0-7.1":0.01538,"8.1-8.4":0.02392,"9.0-9.2":0.00342,"9.3":0.01025,"10.0-10.2":0.00342,"10.3":0.16064,"11.0-11.2":0.06152,"11.3-11.4":0.00513,"12.0-12.1":0.02051,"12.2-12.5":0.18114,"13.0-13.1":0.00342,"13.2":0.00171,"13.3":0.02051,"13.4-13.7":0.0188,"14.0-14.4":0.04614,"14.5-14.8":0.17772,"15.0-15.1":0.04785,"15.2-15.3":0.20678,"15.4":0.10253,"15.5":0.13671,"15.6-15.7":0.92451,"16.0":0.6733,"16.1":1.22357,"16.2":0.55881,"16.3":1.06293,"16.4":0.34178,"16.5":3.64678,"16.6":7.18076},P:{"4":0.02048,"20":0.05121,"21":0.25603,"5.0-5.4":0,"6.2-6.4":0.01024,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01024,"14.0":0.01024,"15.0":0.01024,"16.0":0.01024,"17.0":0.02048,"18.0":0.01024,"19.0":0.03072},I:{"0":0,"3":0.00135,"4":0.02294,"2.1":0.0054,"2.2":0.01485,"2.3":0.0189,"4.1":0.02294,"4.2-4.3":0.03914,"4.4":0,"4.4.3-4.4.4":0.10258},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00728,"8":0.04366,"9":0.00728,"10":0.00728,"11":0.08004,"5.5":0},S:{"2.5":0.00272,_:"3.0-3.1"},J:{"7":0,"10":0.00545},N:{"10":0.00953,"11":0.00953},L:{"0":25.88274},R:{_:"0"},M:{"0":0.17161},Q:{"13.1":0},O:{"0":0.03814},H:{"0":0.26821}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00702,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00702,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.16843,"49":0,"50":0,"51":0,"52":0.01404,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00702,"69":0.00702,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00702,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.02807,"88":0,"89":0,"90":0,"91":0,"92":0.03509,"93":0,"94":0,"95":0,"96":0,"97":0.02105,"98":0,"99":0.01404,"100":0,"101":0.00702,"102":0.05614,"103":0.02105,"104":0.00702,"105":0.00702,"106":0,"107":0.00702,"108":0.00702,"109":0.00702,"110":0,"111":0.00702,"112":0.00702,"113":0.00702,"114":0.03509,"115":3.22126,"116":0.16843,"117":1.71941,"118":0.14036,"119":0,"120":0,"3.5":0,"3.6":0.00702},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.02105,"40":0,"41":0.00702,"42":0.00702,"43":0.00702,"44":0.00702,"45":0.00702,"46":0.00702,"47":0.00702,"48":0,"49":0,"50":0,"51":0.01404,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00702,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00702,"71":0,"72":0,"73":0,"74":0,"75":0.02105,"76":0,"77":0,"78":0.01404,"79":0.00702,"80":0.00702,"81":0.00702,"83":0.12632,"84":0,"85":0.00702,"86":0,"87":0.01404,"88":0.01404,"89":0.00702,"90":0.04913,"91":0.00702,"92":0.03509,"93":0.5053,"94":0.00702,"95":0.01404,"96":0.01404,"97":0,"98":0,"99":0.00702,"100":0.00702,"101":0.00702,"102":0.02807,"103":0.04211,"104":0.03509,"105":0.02105,"106":0.13334,"107":0.03509,"108":0.0772,"109":1.13692,"110":0.06316,"111":0.0772,"112":0.11931,"113":0.12632,"114":0.44213,"115":0.82812,"116":22.50673,"117":4.7582,"118":0.01404,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.02105,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00702,"95":0.0772,"96":0,"97":0,"98":0,"99":0.00702,"100":0.1544,"101":2.12645,"102":1.61414,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00702,"13":0,"14":0.01404,"15":0,"16":0,"17":0,"18":0.01404,"79":0,"80":0,"81":0,"83":0.00702,"84":0,"85":0,"86":0.00702,"87":0,"88":0,"89":0,"90":0.18247,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00702,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.02105,"106":0,"107":0.01404,"108":0.02105,"109":0.03509,"110":0.01404,"111":0.00702,"112":0.00702,"113":0.00702,"114":0.03509,"115":0.09825,"116":2.35805,"117":1.66327},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01404,"10":0,"11":0,"12":0,"13":0,"14":0.06316,"15":0.00702,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.02807,"13.1":0.05614,"14.1":0.08422,"15.1":0.02105,"15.2-15.3":0.01404,"15.4":0.03509,"15.5":0.13334,"15.6":0.1965,"16.0":0.02105,"16.1":0.08422,"16.2":0.0772,"16.3":0.11229,"16.4":0.07018,"16.5":0.23861,"16.6":0.84216,"17.0":0.05614,"17.1":0},G:{"8":0.002,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00399,"6.0-6.1":0.002,"7.0-7.1":0.01598,"8.1-8.4":0.03195,"9.0-9.2":0.00599,"9.3":0.01398,"10.0-10.2":0.002,"10.3":0.11583,"11.0-11.2":0.0679,"11.3-11.4":0.00599,"12.0-12.1":0.01797,"12.2-12.5":0.17973,"13.0-13.1":0,"13.2":0.00399,"13.3":2.57813,"13.4-13.7":0.02596,"14.0-14.4":0.05991,"14.5-14.8":0.16575,"15.0-15.1":0.04194,"15.2-15.3":0.17973,"15.4":0.08587,"15.5":0.12182,"15.6-15.7":0.93659,"16.0":0.56315,"16.1":1.08836,"16.2":0.46131,"16.3":0.88467,"16.4":0.21967,"16.5":0.60908,"16.6":9.89713,"17.0":1.37593,"17.1":0.00599},P:{"4":0.04149,"20":0.04149,"21":0.16594,"22":1.5246,"5.0-5.4":0,"6.2-6.4":0.01037,"7.2-7.4":0.01037,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02074,"14.0":0.01037,"15.0":0.01037,"16.0":0,"17.0":0.01037,"18.0":0.01037,"19.0":0.03111},I:{"0":0,"3":0.00424,"4":0.03251,"2.1":0.0099,"2.2":0.01838,"2.3":0.02262,"4.1":0.02403,"4.2-4.3":0.03958,"4.4":0,"4.4.3-4.4.4":0.11733},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00725,"8":0.05802,"9":0.00725,"10":0.00725,"11":0.13053,"5.5":0},S:{"2.5":0.00596,_:"3.0-3.1"},J:{"7":0,"10":0.00895},N:{"10":0.00895,"11":0.00895},L:{"0":26.80841},R:{_:"0"},M:{"0":0.19085},Q:{"13.1":0},O:{"0":0.03578},H:{"0":0.22021}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EG.js
index f9bd6a4b076330..556b473e0afdce 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/EG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00929,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00232,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00232,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00697,"103":0,"104":0,"105":0.00232,"106":0,"107":0,"108":0.00232,"109":0,"110":0.00232,"111":0.00232,"112":0.00232,"113":0.00232,"114":0.00464,"115":0.17183,"116":0.19737,"117":0.00697,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00232,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00232,"41":0,"42":0,"43":0.0209,"44":0,"45":0,"46":0.00232,"47":0.00232,"48":0,"49":0.00697,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.01858,"59":0,"60":0,"61":0,"62":0,"63":0.00232,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00232,"70":0.00232,"71":0.00232,"72":0.00232,"73":0,"74":0.00232,"75":0,"76":0.00232,"77":0.00232,"78":0.00232,"79":0.02554,"80":0.00464,"81":0.00697,"83":0.00232,"84":0.00232,"85":0.00232,"86":0.00464,"87":0.00697,"88":0.00232,"89":0.00232,"90":0.00232,"91":0.00697,"92":0.00464,"93":0.00232,"94":0.00232,"95":0.00464,"96":0.00232,"97":0.00232,"98":0.00929,"99":0.00929,"100":0.00464,"101":0.00232,"102":0.01161,"103":0.00929,"104":0.00464,"105":0.00464,"106":0.00697,"107":0.00697,"108":0.01858,"109":0.84753,"110":0.00464,"111":0.00697,"112":0.01625,"113":0.01161,"114":0.11146,"115":1.74614,"116":0.98453,"117":0.00232,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00232,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00232,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0.00232,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00464,"74":0.00232,"75":0,"76":0,"77":0.00232,"78":0,"79":0.00464,"80":0,"81":0,"82":0.00464,"83":0.00232,"84":0.00232,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00232,"91":0,"92":0.00232,"93":0.00232,"94":0.00232,"95":0.00464,"96":0,"97":0.00232,"98":0.00232,"99":0.00697,"100":0.00929,"101":0.00464,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00232,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00464,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00232,"109":0.01625,"110":0.00232,"111":0,"112":0.00232,"113":0.00232,"114":0.01625,"115":0.32972,"116":0.10681},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00232,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.0418,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00232,"14.1":0.00464,"15.1":0,"15.2-15.3":0,"15.4":0.00232,"15.5":0.00232,"15.6":0.00929,"16.0":0.00232,"16.1":0.00697,"16.2":0.00232,"16.3":0.00929,"16.4":0.00232,"16.5":0.01625,"16.6":0.01858},G:{"8":0,"17":0.09709,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01775,"8.1-8.4":0,"9.0-9.2":0.00209,"9.3":0.01984,"10.0-10.2":0,"10.3":0.01984,"11.0-11.2":0.00835,"11.3-11.4":0.00418,"12.0-12.1":0.01566,"12.2-12.5":0.451,"13.0-13.1":0.00209,"13.2":0.00209,"13.3":0.01775,"13.4-13.7":0.04698,"14.0-14.4":0.13467,"14.5-14.8":0.18165,"15.0-15.1":0.0522,"15.2-15.3":0.06577,"15.4":0.07412,"15.5":0.11379,"15.6-15.7":1.17552,"16.0":0.39462,"16.1":0.5293,"16.2":0.25577,"16.3":0.61908,"16.4":0.18374,"16.5":2.10049,"16.6":3.84811},P:{"4":0.20645,"20":0.0929,"21":0.23742,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.07226,"8.2":0,"9.2":0.02065,"10.1":0,"11.1-11.2":0.03097,"12.0":0.01032,"13.0":0.04129,"14.0":0.03097,"15.0":0.02065,"16.0":0.06194,"17.0":0.07226,"18.0":0.06194,"19.0":0.07226},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.03165,"4.4":0,"4.4.3-4.4.4":0.17408},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00232,"9":0,"10":0,"11":0.03715,"5.5":0},S:{"2.5":0.00768,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.32241},R:{_:"0"},M:{"0":0.16124},Q:{"13.1":0},O:{"0":0.43765},H:{"0":0.41433}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01432,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00286,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00286,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00286,"89":0,"90":0,"91":0.00286,"92":0,"93":0,"94":0,"95":0.00286,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00573,"103":0,"104":0,"105":0.00286,"106":0.00286,"107":0,"108":0.00286,"109":0.00286,"110":0.00573,"111":0.00286,"112":0.00286,"113":0.00286,"114":0.00286,"115":0.20041,"116":0.0229,"117":0.31779,"118":0.03436,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00286,"39":0.00286,"40":0.00286,"41":0,"42":0,"43":0.02863,"44":0,"45":0,"46":0.00286,"47":0.00286,"48":0.00286,"49":0.00859,"50":0,"51":0,"52":0,"53":0.00286,"54":0,"55":0,"56":0.00286,"57":0,"58":0.00859,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00286,"69":0.00286,"70":0.00286,"71":0.00286,"72":0.00573,"73":0,"74":0.00286,"75":0.00573,"76":0.00286,"77":0.00573,"78":0.00286,"79":0.06012,"80":0.00859,"81":0.01432,"83":0.00286,"84":0.00286,"85":0.01145,"86":0.0229,"87":0.01718,"88":0.00573,"89":0.00286,"90":0.0229,"91":0.01145,"92":0.00573,"93":0.00286,"94":0.00573,"95":0.00573,"96":0.00573,"97":0.00286,"98":0.01432,"99":0.01145,"100":0.00573,"101":0.00286,"102":0.01432,"103":0.01432,"104":0.00859,"105":0.00859,"106":0.00859,"107":0.03149,"108":0.02577,"109":1.16238,"110":0.01145,"111":0.01145,"112":0.01718,"113":0.01718,"114":0.06585,"115":0.06871,"116":3.1722,"117":1.00491,"118":0.00286,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00286,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0.00573,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00573,"73":0.00573,"74":0.00286,"75":0,"76":0,"77":0.01718,"78":0.00286,"79":0.00859,"80":0,"81":0,"82":0.00859,"83":0.00286,"84":0.00286,"85":0,"86":0,"87":0,"88":0.00286,"89":0,"90":0.00286,"91":0,"92":0.00286,"93":0.00286,"94":0.00573,"95":0.00573,"96":0.00286,"97":0,"98":0.00573,"99":0.00859,"100":0.01145,"101":0.00859,"102":0.00573,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00573,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00286,"91":0,"92":0.00573,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00286,"108":0.00286,"109":0.0229,"110":0.00286,"111":0,"112":0.00286,"113":0.00286,"114":0.01145,"115":0.01718,"116":0.36933,"117":0.32066},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00286,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.04867,"6.1":0,"7.1":0,"9.1":0.00286,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00573,"14.1":0.00573,"15.1":0,"15.2-15.3":0,"15.4":0.00286,"15.5":0.00286,"15.6":0.01432,"16.0":0.00286,"16.1":0.00573,"16.2":0.00286,"16.3":0.01145,"16.4":0.00573,"16.5":0.01145,"16.6":0.05153,"17.0":0.00859,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02047,"8.1-8.4":0,"9.0-9.2":0.00361,"9.3":0.02047,"10.0-10.2":0,"10.3":0.02168,"11.0-11.2":0.00963,"11.3-11.4":0.00482,"12.0-12.1":0.00843,"12.2-12.5":0.29986,"13.0-13.1":0.00361,"13.2":0.00241,"13.3":0.63224,"13.4-13.7":0.03492,"14.0-14.4":0.11561,"14.5-14.8":0.20352,"15.0-15.1":0.0578,"15.2-15.3":0.06744,"15.4":0.06985,"15.5":0.12043,"15.6-15.7":1.27772,"16.0":0.43955,"16.1":0.50579,"16.2":0.23483,"16.3":0.55035,"16.4":0.15655,"16.5":0.47568,"16.6":5.5697,"17.0":0.96943,"17.1":0.0012},P:{"4":0.18635,"20":0.06212,"21":0.15529,"22":1.83246,"5.0-5.4":0,"6.2-6.4":0.01035,"7.2-7.4":0.06212,"8.2":0,"9.2":0.01035,"10.1":0,"11.1-11.2":0.02071,"12.0":0.01035,"13.0":0.03106,"14.0":0.02071,"15.0":0.01035,"16.0":0.05176,"17.0":0.05176,"18.0":0.04141,"19.0":0.06212},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00399,"4.2-4.3":0.01596,"4.4":0,"4.4.3-4.4.4":0.17162},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00301,"9":0.00301,"10":0.00301,"11":0.0511,"5.5":0},S:{"2.5":0.00714,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.73868},R:{_:"0"},M:{"0":0.21411},Q:{"13.1":0},O:{"0":0.64233},H:{"0":0.49325}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ER.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ER.js
index 2209d63540fc53..c9042755c11491 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ER.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ER.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00867,"43":0.00867,"44":0.04767,"45":0,"46":0,"47":0,"48":0.00867,"49":0,"50":0,"51":0,"52":0.06501,"53":0,"54":0,"55":0.00867,"56":0,"57":0,"58":0.00433,"59":0,"60":0,"61":0.026,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.06501,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00867,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00867,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.026,"100":0,"101":0,"102":0.00433,"103":0,"104":0.013,"105":0,"106":0,"107":0,"108":0,"109":0.04767,"110":0.00867,"111":0.00867,"112":0.00433,"113":0.00433,"114":0.01734,"115":0.61543,"116":0.60243,"117":0.05201,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00867,"34":0,"35":0,"36":0,"37":0,"38":0.013,"39":0,"40":0,"41":0,"42":0,"43":0.026,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00867,"54":0,"55":0.00867,"56":0,"57":0.00433,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00433,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00867,"73":0.013,"74":0.10835,"75":0,"76":0,"77":0,"78":0,"79":0.05634,"80":0.00867,"81":0.00433,"83":0,"84":0,"85":0,"86":0.00867,"87":0.08235,"88":0.01734,"89":0.00433,"90":0,"91":0.04767,"92":0.26004,"93":0.00867,"94":0,"95":0.013,"96":0.00433,"97":0.00867,"98":0.22537,"99":0,"100":0.01734,"101":0,"102":0.02167,"103":0,"104":0,"105":0,"106":0.00433,"107":0.01734,"108":0.00433,"109":5.8249,"110":0.01734,"111":0.013,"112":0.06501,"113":0.47241,"114":0.52875,"115":3.12048,"116":2.10199,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00433,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.06501,"64":0,"65":0,"66":0,"67":0.17769,"68":0.75845,"69":0,"70":0.00867,"71":0.32072,"72":0.04767,"73":0.00867,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00433,"82":0.04767,"83":0.00433,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":1.16585,"96":0,"97":0,"98":0,"99":0.013,"100":0,"101":0.06934,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.05634},B:{"12":0.00433,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.10835,"79":0,"80":0,"81":0,"83":0,"84":0.013,"85":0,"86":0,"87":0,"88":0,"89":0.03034,"90":0.04767,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00867,"99":0,"100":0.40306,"101":0,"102":0,"103":0,"104":0.00433,"105":0,"106":0,"107":0,"108":0.01734,"109":0.013,"110":0.013,"111":0.00867,"112":0.00433,"113":0.013,"114":0.11702,"115":0.84946,"116":0.4204},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00867,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00867,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.06679,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.05731,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.0382,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.00949,"12.2-12.5":0.23871,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.00949,"14.5-14.8":0.02859,"15.0-15.1":0.0191,"15.2-15.3":0.04769,"15.4":0,"15.5":0.00949,"15.6-15.7":0.04769,"16.0":0,"16.1":0.02859,"16.2":0.3628,"16.3":0.00949,"16.4":0.0191,"16.5":0.15268,"16.6":0.17179},P:{"4":0.0613,"20":0.13283,"21":0.0613,"5.0-5.4":0.14304,"6.2-6.4":0,"7.2-7.4":0.02043,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02043,"12.0":0,"13.0":0.05109,"14.0":0.01022,"15.0":0.21456,"16.0":0.02043,"17.0":0,"18.0":0.1737,"19.0":0.07152},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00017,"4.2-4.3":0.00011,"4.4":0,"4.4.3-4.4.4":0.02705},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.013,"5.5":0},S:{"2.5":0.10765,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.71708},R:{_:"0"},M:{"0":0.06799},Q:{"13.1":0},O:{"0":3.35427},H:{"0":4.51129}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00349,"38":0.00698,"39":0,"40":0,"41":0,"42":0,"43":0.00349,"44":0.01048,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00349,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00349,"60":0,"61":0,"62":0.00349,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00349,"100":0,"101":0,"102":0,"103":0.00698,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00349,"112":0,"113":0,"114":0.03143,"115":0.14666,"116":0.12222,"117":0.47491,"118":0.02794,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00349,"29":0,"30":0,"31":0,"32":0,"33":0.00349,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00349,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00349,"50":0,"51":0,"52":0,"53":0.01397,"54":0.00698,"55":0.01397,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00349,"70":0,"71":0,"72":0.00349,"73":0,"74":0.02794,"75":0.17809,"76":0,"77":0.17111,"78":0.00698,"79":0.02095,"80":0.00349,"81":0.00349,"83":0.00349,"84":0.00349,"85":0,"86":0.03143,"87":0.0419,"88":0,"89":0.00349,"90":0.02444,"91":0.01048,"92":0.25492,"93":0.01397,"94":0,"95":0.00698,"96":0.00698,"97":0.00349,"98":0.0419,"99":0,"100":0.02444,"101":0.00698,"102":0.00349,"103":0.00349,"104":0,"105":0,"106":0.11174,"107":0,"108":0.00349,"109":3.34184,"110":0,"111":0.01397,"112":0.02794,"113":0.00349,"114":0.0454,"115":0.0454,"116":3.63168,"117":0.83808,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.01746,"30":0,"31":0,"32":0,"33":0,"34":0.00349,"35":0,"36":0.00349,"37":0,"38":0.00349,"39":0,"40":0.00349,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00349,"58":0,"60":0,"62":0,"63":0.03841,"64":0,"65":0,"66":0,"67":0,"68":0.38761,"69":0.01397,"70":0.00349,"71":0.48888,"72":0.0419,"73":0.02444,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00349,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00349,"86":0.00349,"87":0,"88":0.00349,"89":0,"90":0.00698,"91":0,"92":0,"93":0.00349,"94":0,"95":0.00349,"96":0,"97":0,"98":0,"99":0,"100":0.01048,"101":0.09428,"102":0.25841,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00698},B:{"12":0,"13":0,"14":0,"15":0.00349,"16":0,"17":0,"18":0.01048,"79":0,"80":0,"81":0,"83":0,"84":0.00349,"85":0,"86":0,"87":0,"88":0,"89":0.02095,"90":0.02444,"91":0,"92":0.01397,"93":0,"94":0,"95":0,"96":0.02095,"97":0,"98":0,"99":0,"100":0.11524,"101":0,"102":0,"103":0.00349,"104":0,"105":0,"106":0,"107":0,"108":0.00349,"109":0.02095,"110":0,"111":0.01746,"112":0.00349,"113":0.0419,"114":0.01746,"115":0.00349,"116":0.3038,"117":0.25492},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.02095,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0,"17.0":0.00349,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01273,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.06363,"12.0-12.1":0,"12.2-12.5":0.31814,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.13362,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":0.0509,"16.0":0,"16.1":0.02545,"16.2":0.12089,"16.3":0.01909,"16.4":0.0509,"16.5":0.01273,"16.6":0.45811,"17.0":0.00636,"17.1":0},P:{"4":0.44132,"20":0.02006,"21":0.14042,"22":0.56168,"5.0-5.4":0.14042,"6.2-6.4":0.06018,"7.2-7.4":0.06018,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01003,"12.0":0,"13.0":0.05015,"14.0":0,"15.0":0,"16.0":0.2006,"17.0":0,"18.0":0.01003,"19.0":0.01003},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00008,"4.2-4.3":0.01711,"4.4":0,"4.4.3-4.4.4":0.06567},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.07682,"5.5":0},S:{"2.5":0.05206,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":70.65652},R:{_:"0"},M:{"0":0.01302},Q:{"13.1":0},O:{"0":3.28003},H:{"0":5.77935}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ES.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ES.js
index 037f93070ec1d8..d19a842a304313 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ES.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ES.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01363,"53":0,"54":0,"55":0,"56":0.00341,"57":0,"58":0,"59":0.00682,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00341,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01022,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00341,"89":0.00341,"90":0,"91":0.00341,"92":0,"93":0,"94":0,"95":0.00341,"96":0,"97":0,"98":0,"99":0,"100":0.00682,"101":0,"102":0.02386,"103":0.00341,"104":0.00341,"105":0,"106":0.00341,"107":0.00341,"108":0.00341,"109":0.00682,"110":0.00341,"111":0.00341,"112":0.00341,"113":0.00682,"114":0.01704,"115":0.22152,"116":0.60662,"117":0.02045,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00341,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02386,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.01704,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.02386,"67":0.00341,"68":0,"69":0,"70":0.00341,"71":0,"72":0,"73":0.00682,"74":0.00341,"75":0.00341,"76":0.00341,"77":0,"78":0.00341,"79":0.03067,"80":0.00341,"81":0.00341,"83":0.00341,"84":0.00341,"85":0.00341,"86":0.00341,"87":0.01363,"88":0.01022,"89":0.00341,"90":0.00341,"91":0.00682,"92":0.00341,"93":0.01363,"94":0.01363,"95":0.00682,"96":0.00341,"97":0.00341,"98":0.00341,"99":0.01363,"100":0.00341,"101":0.00341,"102":0.00341,"103":0.03067,"104":0.00682,"105":0.01022,"106":0.01363,"107":0.01363,"108":0.02386,"109":0.47371,"110":0.01363,"111":0.01363,"112":0.03067,"113":0.03408,"114":0.34762,"115":3.75221,"116":2.36515,"117":0.00341,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00341,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00341,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00341,"72":0.00341,"73":0,"74":0,"75":0,"76":0,"77":0.00341,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01022,"96":0,"97":0,"98":0,"99":0.00682,"100":0.2999,"101":0.1704,"102":0.00341,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00341,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00341,"91":0,"92":0.00682,"93":0,"94":0,"95":0.00682,"96":0,"97":0.00341,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00341,"108":0.00341,"109":0.02386,"110":0.00341,"111":0.00341,"112":0.00682,"113":0.00682,"114":0.04771,"115":0.79406,"116":0.30672},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00341,"14":0.02045,"15":0.00341,"17":0.00341,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00341,"10.1":0,"11.1":0.00682,"12.1":0.00682,"13.1":0.03749,"14.1":0.04771,"15.1":0.01022,"15.2-15.3":0.00341,"15.4":0.01022,"15.5":0.01704,"15.6":0.10224,"16.0":0.01022,"16.1":0.02726,"16.2":0.03067,"16.3":0.07157,"16.4":0.02045,"16.5":0.20107,"16.6":0.26582},G:{"8":0.00388,"17":0.11838,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00194,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05628,"10.0-10.2":0,"10.3":0.0718,"11.0-11.2":0.01164,"11.3-11.4":0.05434,"12.0-12.1":0.01164,"12.2-12.5":0.30856,"13.0-13.1":0.00776,"13.2":0.00582,"13.3":0.01552,"13.4-13.7":0.04075,"14.0-14.4":0.14167,"14.5-14.8":0.24646,"15.0-15.1":0.07762,"15.2-15.3":0.09509,"15.4":0.11256,"15.5":0.19018,"15.6-15.7":1.27887,"16.0":0.61712,"16.1":1.33127,"16.2":0.59965,"16.3":1.26917,"16.4":0.29497,"16.5":3.88124,"16.6":8.54844},P:{"4":0.10372,"20":0.09335,"21":0.22819,"22":2.27155,"5.0-5.4":0.01037,"6.2-6.4":0,"7.2-7.4":0.01037,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01037,"12.0":0.01037,"13.0":0.02074,"14.0":0.01037,"15.0":0.01037,"16.0":0.02074,"17.0":0.02074,"18.0":0.02074,"19.0":0.05186},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01518,"4.2-4.3":0.02276,"4.4":0,"4.4.3-4.4.4":0.13659},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00341,"9":0,"10":0,"11":0.03749,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.31659},R:{_:"0"},M:{"0":0.34278},Q:{"13.1":0},O:{"0":0.03296},H:{"0":0.24964}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00381,"49":0,"50":0,"51":0,"52":0.01143,"53":0,"54":0,"55":0,"56":0.00381,"57":0,"58":0,"59":0.00381,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00381,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01143,"79":0,"80":0,"81":0.00381,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00381,"89":0.00381,"90":0,"91":0.00381,"92":0,"93":0,"94":0,"95":0.00381,"96":0,"97":0,"98":0,"99":0,"100":0.00381,"101":0,"102":0.02286,"103":0.00381,"104":0.00381,"105":0.00381,"106":0,"107":0.00381,"108":0.00381,"109":0.01524,"110":0.00381,"111":0.00381,"112":0.00381,"113":0.01143,"114":0.00762,"115":0.11049,"116":0.04572,"117":0.71247,"118":0.06858,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01905,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00381,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.01524,"67":0.00381,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00381,"74":0,"75":0.00381,"76":0.00381,"77":0.00381,"78":0.00381,"79":0.02667,"80":0.00381,"81":0.00381,"83":0.00381,"84":0.00762,"85":0.00381,"86":0.00381,"87":0.01524,"88":0.00762,"89":0.00381,"90":0.00762,"91":0.00762,"92":0.00381,"93":0.01143,"94":0.00381,"95":0.00381,"96":0.00381,"97":0.00381,"98":0.00381,"99":0.01524,"100":0.00381,"101":0.00381,"102":0.00762,"103":0.0381,"104":0.00381,"105":0.01524,"106":0.01524,"107":0.02667,"108":0.01905,"109":0.52578,"110":0.01524,"111":0.01905,"112":0.0381,"113":0.03429,"114":0.13716,"115":0.16764,"116":6.08457,"117":2.12217,"118":0.00381,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00381,"73":0.00381,"74":0,"75":0,"76":0,"77":0.01524,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01143,"96":0,"97":0,"98":0,"99":0.00381,"100":0.08001,"101":0.16383,"102":0.38862,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00381,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.00381,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00381,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00381,"108":0.00381,"109":0.02286,"110":0.00381,"111":0.00381,"112":0.00381,"113":0.00381,"114":0.01905,"115":0.03048,"116":0.64008,"117":0.63627},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00381,"14":0.02286,"15":0.00381,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00381,"10.1":0,"11.1":0.00381,"12.1":0.00762,"13.1":0.03429,"14.1":0.05334,"15.1":0.00762,"15.2-15.3":0.00762,"15.4":0.01524,"15.5":0.02286,"15.6":0.1143,"16.0":0.01143,"16.1":0.03048,"16.2":0.03048,"16.3":0.0762,"16.4":0.03048,"16.5":0.08763,"16.6":0.46482,"17.0":0.03429,"17.1":0},G:{"8":0.00374,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00187,"9.3":0.04866,"10.0-10.2":0,"10.3":0.05989,"11.0-11.2":0.00936,"11.3-11.4":0.03556,"12.0-12.1":0.00749,"12.2-12.5":0.26202,"13.0-13.1":0.00561,"13.2":0.00374,"13.3":0.05989,"13.4-13.7":0.03556,"14.0-14.4":0.11604,"14.5-14.8":0.23021,"15.0-15.1":0.07299,"15.2-15.3":0.08984,"15.4":0.09732,"15.5":0.17593,"15.6-15.7":1.09488,"16.0":0.56896,"16.1":1.15103,"16.2":0.49784,"16.3":0.99194,"16.4":0.21149,"16.5":0.69249,"16.6":10.75977,"17.0":1.18846,"17.1":0.00187},P:{"4":0.07273,"20":0.07273,"21":0.15584,"22":2.43116,"5.0-5.4":0.01039,"6.2-6.4":0,"7.2-7.4":0.01039,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01039,"12.0":0.01039,"13.0":0.02078,"14.0":0.02078,"15.0":0.01039,"16.0":0.02078,"17.0":0.02078,"18.0":0.02078,"19.0":0.05195},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01201,"4.2-4.3":0.01801,"4.4":0,"4.4.3-4.4.4":0.10808},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00381,"9":0,"10":0,"11":0.03429,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":62.42631},R:{_:"0"},M:{"0":0.32807},Q:{"13.1":0},O:{"0":0.03095},H:{"0":0.23441}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ET.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ET.js
index 81dc4e3fdc5111..be0ad74a4f2fed 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ET.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ET.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00327,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00327,"48":0,"49":0,"50":0,"51":0,"52":0.00654,"53":0,"54":0,"55":0.00327,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00327,"68":0.00327,"69":0,"70":0,"71":0,"72":0.00654,"73":0,"74":0,"75":0,"76":0,"77":0.06871,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.01963,"85":0,"86":0,"87":0,"88":0,"89":0.00327,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01309,"96":0,"97":0.00327,"98":0,"99":0,"100":0,"101":0,"102":0.01309,"103":0,"104":0,"105":0.00327,"106":0,"107":0,"108":0.00327,"109":0.00327,"110":0.00327,"111":0.00654,"112":0.00327,"113":0.00654,"114":0.00982,"115":0.39264,"116":0.56278,"117":0.07853,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00654,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00327,"35":0,"36":0.00982,"37":0,"38":0.00654,"39":0,"40":0.00654,"41":0,"42":0,"43":0.00982,"44":0,"45":0,"46":0,"47":0.01309,"48":0,"49":0.00327,"50":0.00327,"51":0,"52":0,"53":0.00327,"54":0,"55":0,"56":0.00654,"57":0,"58":0.00982,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00327,"65":0.00327,"66":0,"67":0,"68":0.00327,"69":0.00327,"70":0.00654,"71":0,"72":0.00327,"73":0.00654,"74":0.00327,"75":0.00327,"76":0.01309,"77":0.00327,"78":0.00327,"79":0.16687,"80":0.00654,"81":0.0229,"83":0.00982,"84":0.00327,"85":0.00327,"86":0.00654,"87":0.00654,"88":0.00654,"89":0.00654,"90":0.00654,"91":0.00327,"92":0.00654,"93":0.01963,"94":0,"95":0.01963,"96":0.00654,"97":0.00327,"98":0.0818,"99":0.00654,"100":0.00327,"101":0.00327,"102":0.00982,"103":0.0589,"104":0.01309,"105":0.00654,"106":0.02618,"107":0.00982,"108":0.02945,"109":1.07976,"110":0.00654,"111":0.01636,"112":0.04581,"113":0.02618,"114":0.17996,"115":2.52598,"116":1.67199,"117":0.01309,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0.00327,"28":0.00982,"29":0,"30":0.00327,"31":0,"32":0.00654,"33":0.00327,"34":0.00327,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00654,"43":0,"44":0,"45":0.00327,"46":0.0229,"47":0,"48":0,"49":0,"50":0.00327,"51":0,"52":0,"53":0.00327,"54":0.00327,"55":0,"56":0,"57":0,"58":0.00327,"60":0.00982,"62":0,"63":0.00327,"64":0.00327,"65":0.00327,"66":0.00327,"67":0.01963,"68":0.00982,"69":0.03272,"70":0.02618,"71":0.15706,"72":0.09489,"73":0,"74":0,"75":0,"76":0.00654,"77":0.00327,"78":0,"79":0.00654,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00327,"86":0.00327,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03926,"96":0,"97":0,"98":0,"99":0.00982,"100":0.0818,"101":0.3043,"102":0.00654,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00982},B:{"12":0.00654,"13":0,"14":0.00327,"15":0.00327,"16":0.00327,"17":0.00327,"18":0.03272,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00327,"91":0,"92":0.00982,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00327,"109":0.02945,"110":0.00327,"111":0.00327,"112":0.01309,"113":0.01309,"114":0.04254,"115":0.6544,"116":0.29448},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.02945,"14":0.01963,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00327,"14.1":0.00654,"15.1":0,"15.2-15.3":0,"15.4":0.00327,"15.5":0.00327,"15.6":0.00982,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0.00327,"16.5":0.00654,"16.6":0.00982},G:{"8":0,"17":0.01914,"3.2":0,"4.0-4.1":0.0007,"4.2-4.3":0,"5.0-5.1":0.00278,"6.0-6.1":0.00383,"7.0-7.1":0.2436,"8.1-8.4":0.03689,"9.0-9.2":0.00104,"9.3":0.11379,"10.0-10.2":0.00139,"10.3":0.11449,"11.0-11.2":0.00835,"11.3-11.4":0.02088,"12.0-12.1":0.02436,"12.2-12.5":0.43256,"13.0-13.1":0.00452,"13.2":0.00035,"13.3":0.02088,"13.4-13.7":0.02993,"14.0-14.4":0.18479,"14.5-14.8":0.11797,"15.0-15.1":0.03376,"15.2-15.3":0.07447,"15.4":0.08282,"15.5":0.05568,"15.6-15.7":0.51295,"16.0":0.07586,"16.1":0.13641,"16.2":0.07343,"16.3":0.12702,"16.4":0.09083,"16.5":0.42804,"16.6":0.40576},P:{"4":0.50831,"20":0.14523,"21":0.1971,"5.0-5.4":0.02075,"6.2-6.4":0.02075,"7.2-7.4":0.26972,"8.2":0,"9.2":0.01037,"10.1":0,"11.1-11.2":0.02075,"12.0":0,"13.0":0.03112,"14.0":0.03112,"15.0":0.01037,"16.0":0.04149,"17.0":0.07262,"18.0":0.03112,"19.0":0.09336},I:{"0":0,"3":0,"4":0.00117,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0035,"4.2-4.3":0.06,"4.4":0,"4.4.3-4.4.4":0.36585},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01636,"5.5":0},S:{"2.5":0.1211,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":75.98562},R:{_:"0"},M:{"0":0.10765},Q:{"13.1":0.01346},O:{"0":0.49787},H:{"0":3.63069}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00631,"48":0,"49":0,"50":0,"51":0,"52":0.00316,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00316,"73":0,"74":0,"75":0,"76":0,"77":0.06628,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.01262,"85":0,"86":0,"87":0,"88":0.00316,"89":0.00316,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00631,"96":0,"97":0.00316,"98":0,"99":0,"100":0,"101":0,"102":0.01262,"103":0.00316,"104":0,"105":0,"106":0,"107":0.00316,"108":0.00947,"109":0,"110":0,"111":0.00316,"112":0.00316,"113":0.00316,"114":0.00316,"115":0.20198,"116":0.07574,"117":0.53336,"118":0.1073,"119":0.00316,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00316,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00316,"34":0.00316,"35":0,"36":0,"37":0,"38":0.00631,"39":0,"40":0.00947,"41":0,"42":0,"43":0.00631,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00316,"51":0,"52":0,"53":0.00316,"54":0,"55":0.00316,"56":0.00316,"57":0,"58":0.00631,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00316,"65":0.00316,"66":0,"67":0,"68":0.00316,"69":0.00316,"70":0.00947,"71":0.00316,"72":0.00316,"73":0.00316,"74":0.00316,"75":0.00316,"76":0.00947,"77":0.00316,"78":0.00316,"79":0.14833,"80":0.00947,"81":0.02209,"83":0.00631,"84":0.00631,"85":0.00316,"86":0.01578,"87":0.01262,"88":0.01578,"89":0,"90":0.00316,"91":0.00631,"92":0.00316,"93":0.02209,"94":0.00316,"95":0.00947,"96":0.00631,"97":0,"98":0.06312,"99":0.00316,"100":0,"101":0,"102":0.01578,"103":0.04734,"104":0.00631,"105":0.00631,"106":0.01894,"107":0.0284,"108":0.01578,"109":0.93102,"110":0.00631,"111":0.00947,"112":0.03787,"113":0.01578,"114":0.05681,"115":0.07574,"116":3.00451,"117":0.8395,"118":0.00631,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00316,"25":0,"26":0,"27":0,"28":0.00947,"29":0,"30":0.00316,"31":0,"32":0.00316,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00631,"43":0,"44":0,"45":0,"46":0.02209,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00316,"54":0.00316,"55":0,"56":0,"57":0,"58":0,"60":0.01578,"62":0,"63":0.00631,"64":0.00316,"65":0,"66":0.00316,"67":0.00631,"68":0.00947,"69":0.02209,"70":0.01262,"71":0.04418,"72":0.17989,"73":0.04734,"74":0,"75":0,"76":0,"77":0.01262,"78":0.00316,"79":0.00947,"80":0,"81":0,"82":0,"83":0.00316,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03472,"96":0,"97":0,"98":0,"99":0.00631,"100":0.00947,"101":0.16727,"102":0.1862,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00631},B:{"12":0.00631,"13":0,"14":0.00316,"15":0,"16":0.00316,"17":0,"18":0.04734,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00316,"91":0,"92":0.00947,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.04103,"110":0.00316,"111":0.00316,"112":0.00631,"113":0.00631,"114":0.02209,"115":0.01894,"116":0.46393,"117":0.37872},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01262,"14":0.00631,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00316,"15.1":0,"15.2-15.3":0,"15.4":0.00316,"15.5":0,"15.6":0.01262,"16.0":0,"16.1":0.00316,"16.2":0,"16.3":0,"16.4":0.00316,"16.5":0.01578,"16.6":0.01894,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00344,"6.0-6.1":0.00516,"7.0-7.1":0.20924,"8.1-8.4":0.0179,"9.0-9.2":0.0031,"9.3":0.14729,"10.0-10.2":0.00206,"10.3":0.06986,"11.0-11.2":0.00551,"11.3-11.4":0.02375,"12.0-12.1":0.02478,"12.2-12.5":0.44566,"13.0-13.1":0.00826,"13.2":0.00241,"13.3":0.01962,"13.4-13.7":0.06883,"14.0-14.4":0.18996,"14.5-14.8":0.13181,"15.0-15.1":0.0468,"15.2-15.3":0.08707,"15.4":0.06917,"15.5":0.0678,"15.6-15.7":0.53204,"16.0":0.06986,"16.1":0.11632,"16.2":0.0413,"16.3":0.12595,"16.4":0.04715,"16.5":0.1848,"16.6":0.54821,"17.0":0.1084,"17.1":0.00069},P:{"4":0.46278,"20":0.09256,"21":0.11313,"22":0.59648,"5.0-5.4":0.01028,"6.2-6.4":0.03085,"7.2-7.4":0.26739,"8.2":0.01028,"9.2":0.02057,"10.1":0,"11.1-11.2":0.01028,"12.0":0.01028,"13.0":0.03085,"14.0":0.01028,"15.0":0.01028,"16.0":0.05142,"17.0":0.10284,"18.0":0.03085,"19.0":0.08227},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00258,"4.2-4.3":0.06241,"4.4":0,"4.4.3-4.4.4":0.35334},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00631,"5.5":0},S:{"2.5":0.08897,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.38028},R:{_:"0"},M:{"0":0.08897},Q:{"13.1":0.00684},O:{"0":0.5133},H:{"0":2.88336}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FI.js
index d81142b8e9d48c..179e1f735a4d3e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00583,"47":0,"48":0,"49":0,"50":0.35587,"51":0,"52":0.19836,"53":0.51339,"54":0,"55":0.00583,"56":0.14585,"57":0,"58":0,"59":0.02917,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00583,"69":0,"70":0,"71":0,"72":0.00583,"73":0,"74":0,"75":0.00583,"76":0,"77":0,"78":0.02917,"79":0,"80":0,"81":0,"82":0,"83":0.01167,"84":0.00583,"85":0,"86":0,"87":0,"88":0.00583,"89":0.00583,"90":0.00583,"91":0.00583,"92":0,"93":0,"94":0,"95":0.00583,"96":0,"97":0,"98":0.01167,"99":0,"100":0,"101":0,"102":0.12251,"103":0.00583,"104":0.0175,"105":0.01167,"106":0.00583,"107":0.00583,"108":0.01167,"109":0.01167,"110":0.01167,"111":0.01167,"112":0.0175,"113":0.04084,"114":0.035,"115":0.59507,"116":1.94272,"117":0.07001,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00583,"39":0,"40":0,"41":0.00583,"42":0.05251,"43":0,"44":0,"45":0,"46":0,"47":0.00583,"48":0,"49":0.00583,"50":0,"51":0.00583,"52":0,"53":0,"54":0,"55":0.00583,"56":0.00583,"57":0.00583,"58":0.00583,"59":0,"60":0.0175,"61":0.08168,"62":0,"63":0,"64":0,"65":0.00583,"66":0.14585,"67":0,"68":0.00583,"69":0.00583,"70":0.00583,"71":0.01167,"72":0.00583,"73":0,"74":0.00583,"75":0.00583,"76":0.01167,"77":0.0175,"78":0.00583,"79":0.04667,"80":0.00583,"81":0.035,"83":0.02917,"84":0.00583,"85":0.035,"86":0.14585,"87":0.17502,"88":0.0175,"89":0.02917,"90":0.01167,"91":0.59507,"92":0.00583,"93":0.035,"94":0.0175,"95":0.00583,"96":0.02917,"97":0.00583,"98":0.00583,"99":0.09334,"100":0.14585,"101":0.3092,"102":0.14585,"103":0.20419,"104":0.15752,"105":0.07584,"106":0.035,"107":0.20419,"108":0.11668,"109":0.48422,"110":0.05251,"111":0.14002,"112":0.2567,"113":0.30337,"114":1.69186,"115":10.55954,"116":5.47229,"117":0.00583,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00583,"44":0,"45":0,"46":0.00583,"47":0.00583,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00583,"70":0.00583,"71":0.0175,"72":0.02334,"73":0.00583,"74":0.00583,"75":0.00583,"76":0.01167,"77":0.00583,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00583,"92":0,"93":0,"94":0,"95":0.02334,"96":0,"97":0,"98":0,"99":0.0175,"100":0.49006,"101":0.36754,"102":0.00583,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00583},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.01167,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00583,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01167,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00583,"101":0.00583,"102":0.01167,"103":0,"104":0.0175,"105":0.00583,"106":0.00583,"107":0.00583,"108":0.01167,"109":0.02917,"110":0.00583,"111":0.00583,"112":0.01167,"113":0.04084,"114":0.15752,"115":2.46195,"116":0.79342},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00583,"14":0.0175,"15":0.00583,"17":0.00583,_:"0","3.1":0,"3.2":0,"5.1":0.00583,"6.1":0,"7.1":0,"9.1":0.02917,"10.1":0,"11.1":0.02334,"12.1":0.00583,"13.1":0.04667,"14.1":0.05251,"15.1":0.00583,"15.2-15.3":0.01167,"15.4":0.0175,"15.5":0.02334,"15.6":0.17502,"16.0":0.02917,"16.1":0.02917,"16.2":0.04667,"16.3":0.10501,"16.4":0.07001,"16.5":0.39088,"16.6":0.63007},G:{"8":0,"17":0.14509,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00387,"9.0-9.2":0.00967,"9.3":0.02321,"10.0-10.2":0.0058,"10.3":0.04062,"11.0-11.2":0.02515,"11.3-11.4":0.17217,"12.0-12.1":0.02128,"12.2-12.5":0.24568,"13.0-13.1":0.00967,"13.2":0.00967,"13.3":0.01548,"13.4-13.7":0.04062,"14.0-14.4":0.13154,"14.5-14.8":0.18958,"15.0-15.1":0.13735,"15.2-15.3":0.16056,"15.4":0.15863,"15.5":0.21666,"15.6-15.7":1.23033,"16.0":0.63258,"16.1":1.27869,"16.2":0.62871,"16.3":1.33673,"16.4":0.5107,"16.5":3.9889,"16.6":7.96427},P:{"4":0.07142,"20":0.17346,"21":0.37753,"22":1.67337,"5.0-5.4":0.0102,"6.2-6.4":0,"7.2-7.4":0.0102,"8.2":0,"9.2":0.0102,"10.1":0,"11.1-11.2":0.0102,"12.0":0.0102,"13.0":0.0102,"14.0":0.03061,"15.0":0.0102,"16.0":0.05102,"17.0":0.05102,"18.0":0.04081,"19.0":0.07142},I:{"0":0,"3":0,"4":0.00736,"2.1":0,"2.2":0,"2.3":0.00368,"4.1":0.01104,"4.2-4.3":0.01472,"4.4":0,"4.4.3-4.4.4":0.05153},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0175,"9":0.00583,"10":0.00583,"11":0.04667,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":40.29757},R:{_:"0"},M:{"0":0.77071},Q:{"13.1":0},O:{"0":0.28329},H:{"0":0.49696}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0062,"47":0,"48":0,"49":0,"50":1.07915,"51":0,"52":0.22947,"53":1.40785,"54":0,"55":0.0062,"56":0.27909,"57":0,"58":0,"59":0.02481,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0062,"69":0,"70":0,"71":0,"72":0.0062,"73":0,"74":0,"75":0.0062,"76":0,"77":0,"78":0.01861,"79":0,"80":0,"81":0,"82":0,"83":0.0062,"84":0.0124,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.0062,"92":0,"93":0,"94":0.0062,"95":0.0124,"96":0,"97":0,"98":0.0124,"99":0,"100":0.0062,"101":0,"102":0.09923,"103":0.0062,"104":0.0124,"105":0.0124,"106":0.0062,"107":0.0062,"108":0.0062,"109":0.0062,"110":0.0062,"111":0.0062,"112":0.0062,"113":0.03101,"114":0.01861,"115":0.86208,"116":0.16745,"117":1.873,"118":0.16745,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.0062,"39":0,"40":0,"41":0.0062,"42":0.0124,"43":0,"44":0.0062,"45":0,"46":0,"47":0.0062,"48":0,"49":0.0062,"50":0,"51":0.0062,"52":0,"53":0,"54":0,"55":0.0062,"56":0.0062,"57":0.0062,"58":0,"59":0,"60":0.0124,"61":0.01861,"62":0,"63":0.0062,"64":0,"65":0,"66":0.13024,"67":0,"68":0,"69":0.0062,"70":0,"71":0.0062,"72":0,"73":0,"74":0,"75":0.0062,"76":0.0124,"77":0.01861,"78":0.0062,"79":0.02481,"80":0.0062,"81":0.03101,"83":0.03101,"84":0.0062,"85":0.02481,"86":0.14265,"87":0.01861,"88":0.0124,"89":0.01861,"90":0.0062,"91":0.77525,"92":0.0062,"93":0.03101,"94":0.0124,"95":0.0124,"96":0.02481,"97":0,"98":0.0062,"99":0.02481,"100":0.14885,"101":0.27909,"102":0.14885,"103":0.20467,"104":0.14265,"105":0.08063,"106":0.07442,"107":0.11784,"108":0.26669,"109":0.53957,"110":0.08683,"111":0.09923,"112":0.21707,"113":0.17986,"114":0.94891,"115":1.34583,"116":14.06614,"117":3.54134,"118":0.0062,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0062,"70":0.0124,"71":0.0062,"72":0.03101,"73":0.0062,"74":0.0062,"75":0,"76":0.0062,"77":0.04962,"78":0.0062,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.0124,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.0062,"94":0,"95":0.0124,"96":0,"97":0,"98":0,"99":0.0062,"100":0.13024,"101":0.37212,"102":0.53957,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.0062},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.0124,"18":0.0062,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.0062,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.0062,"102":0,"103":0,"104":0,"105":0,"106":0.0062,"107":0.0124,"108":0.01861,"109":0.03101,"110":0.0124,"111":0.0124,"112":0.0062,"113":0.01861,"114":0.03721,"115":0.20467,"116":1.99704,"117":1.41406},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0062,"14":0.01861,"15":0.0062,_:"0","3.1":0,"3.2":0,"5.1":0.0062,"6.1":0,"7.1":0,"9.1":0.0062,"10.1":0,"11.1":0.01861,"12.1":0.0062,"13.1":0.03101,"14.1":0.05582,"15.1":0.0062,"15.2-15.3":0.0062,"15.4":0.02481,"15.5":0.01861,"15.6":0.16745,"16.0":0.02481,"16.1":0.03101,"16.2":0.04341,"16.3":0.10543,"16.4":0.05582,"16.5":0.18606,"16.6":0.85588,"17.0":0.06202,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00374,"8.1-8.4":0.00374,"9.0-9.2":0.00749,"9.3":0.01871,"10.0-10.2":0,"10.3":0.03369,"11.0-11.2":0.01871,"11.3-11.4":0.14784,"12.0-12.1":0.01684,"12.2-12.5":0.20024,"13.0-13.1":0.00374,"13.2":0.00374,"13.3":0.10293,"13.4-13.7":0.02059,"14.0-14.4":0.08983,"14.5-14.8":0.20399,"15.0-15.1":0.11416,"15.2-15.3":0.12352,"15.4":0.12539,"15.5":0.25077,"15.6-15.7":1.06859,"16.0":0.6419,"16.1":1.08731,"16.2":0.57453,"16.3":1.02555,"16.4":0.41733,"16.5":1.06111,"16.6":9.91676,"17.0":1.20708,"17.1":0},P:{"4":0.03079,"20":0.10263,"21":0.20527,"22":1.56004,"5.0-5.4":0.01026,"6.2-6.4":0,"7.2-7.4":0.01026,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01026,"12.0":0.01026,"13.0":0.01026,"14.0":0.04105,"15.0":0.01026,"16.0":0.05132,"17.0":0.04105,"18.0":0.04105,"19.0":0.07184},I:{"0":0,"3":0,"4":0.00884,"2.1":0,"2.2":0.00295,"2.3":0.0059,"4.1":0.0059,"4.2-4.3":0.01474,"4.4":0,"4.4.3-4.4.4":0.05307},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.02481,"9":0.0062,"10":0.0062,"11":0.06202,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":37.35773},R:{_:"0"},M:{"0":0.62287},Q:{"13.1":0.0038},O:{"0":0.25826},H:{"0":0.54655}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FJ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FJ.js
index 6c959b4ed7510a..02add7fe08e290 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FJ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FJ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00287,"53":0,"54":0,"55":0,"56":0.00287,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00287,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01433,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0086,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00287,"103":0,"104":0.00573,"105":0,"106":0.00287,"107":0.00287,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00573,"114":0.00573,"115":0.14903,"116":0.35538,"117":0.01433,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0086,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00287,"70":0,"71":0,"72":0,"73":0.00287,"74":0.00287,"75":0,"76":0.00287,"77":0.00287,"78":0,"79":0.01146,"80":0.00287,"81":0.03439,"83":0.0086,"84":0,"85":0,"86":0.00287,"87":0.00573,"88":0.0172,"89":0,"90":0,"91":0.00287,"92":0.0086,"93":0.00287,"94":0.00573,"95":0.0086,"96":0.00287,"97":0,"98":0.00287,"99":0.00573,"100":0.00573,"101":0.00287,"102":0,"103":0.0172,"104":0.00287,"105":0.00573,"106":0.0086,"107":0.00573,"108":0.0086,"109":0.22355,"110":0.0086,"111":0.00573,"112":0.01433,"113":0.05445,"114":0.15763,"115":2.72557,"116":1.30976,"117":0.00287,"118":0.00287,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0.00573,"65":0,"66":0,"67":0.00287,"68":0,"69":0.00573,"70":0.00287,"71":0.02579,"72":0.04586,"73":0,"74":0,"75":0,"76":0.01433,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01146,"96":0,"97":0,"98":0,"99":0.01146,"100":0.02006,"101":0.04586,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00573,"14":0,"15":0.00287,"16":0,"17":0.00287,"18":0.00287,"79":0,"80":0,"81":0,"83":0,"84":0.00287,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00573,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00287,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00287,"108":0,"109":0.0086,"110":0.00573,"111":0.00287,"112":0.00573,"113":0.00287,"114":0.04012,"115":0.89706,"116":0.22641},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.03726,"15":0,"17":0.00287,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00287,"13.1":0.0086,"14.1":0.02006,"15.1":0.00287,"15.2-15.3":0.00573,"15.4":0.0086,"15.5":0.00287,"15.6":0.02866,"16.0":0.00287,"16.1":0.00573,"16.2":0.00287,"16.3":0.1347,"16.4":0.0086,"16.5":0.11464,"16.6":0.14043},G:{"8":0,"17":0.08151,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.16899,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05268,"10.0-10.2":0,"10.3":0.02883,"11.0-11.2":0.00398,"11.3-11.4":0.00994,"12.0-12.1":0.00199,"12.2-12.5":0.32903,"13.0-13.1":0.00596,"13.2":0.05567,"13.3":0.10239,"13.4-13.7":0.02585,"14.0-14.4":0.04076,"14.5-14.8":0.07853,"15.0-15.1":0.04871,"15.2-15.3":0.15805,"15.4":0.08847,"15.5":0.11531,"15.6-15.7":1.04474,"16.0":0.24354,"16.1":0.64911,"16.2":0.26839,"16.3":0.52486,"16.4":0.1342,"16.5":2.23263,"16.6":3.44636},P:{"4":0.19526,"20":0.25692,"21":0.88382,"5.0-5.4":0.02055,"6.2-6.4":0.02055,"7.2-7.4":0.52412,"8.2":0,"9.2":0.02055,"10.1":0.01028,"11.1-11.2":0.09249,"12.0":0.03083,"13.0":0.05138,"14.0":0.04111,"15.0":0.06166,"16.0":0.16443,"17.0":0.06166,"18.0":0.19526,"19.0":0.52412},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00451,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.08421},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0086,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.58881},R:{_:"0"},M:{"0":0.13555},Q:{"13.1":0.27823},O:{"0":0.54932},H:{"0":0.5133}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00274,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01371,"53":0,"54":0,"55":0,"56":0.00548,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02741,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00274,"101":0,"102":0.00548,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00274,"110":0,"111":0.00274,"112":0,"113":0.00274,"114":0.00548,"115":0.06853,"116":0.04386,"117":0.46323,"118":0.02467,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00274,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00548,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00274,"66":0,"67":0,"68":0,"69":0.00548,"70":0,"71":0,"72":0,"73":0,"74":0.00274,"75":0,"76":0.00274,"77":0.00274,"78":0.00274,"79":0.00548,"80":0,"81":0.01919,"83":0.00548,"84":0,"85":0,"86":0.00274,"87":0.00822,"88":0.03289,"89":0.00274,"90":0,"91":0.00274,"92":0.01096,"93":0.00822,"94":0.00274,"95":0.00274,"96":0,"97":0,"98":0.00548,"99":0.00822,"100":0,"101":0.00274,"102":0,"103":0.01371,"104":0.00274,"105":0.00548,"106":0.00274,"107":0.00822,"108":0.01645,"109":0.30699,"110":0.00274,"111":0.00822,"112":0.01371,"113":0.01371,"114":0.05482,"115":0.10416,"116":3.01236,"117":0.65236,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0.00548,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00822,"71":0.00274,"72":0.05756,"73":0.02467,"74":0,"75":0,"76":0.05208,"77":0.00274,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00274,"96":0,"97":0,"98":0,"99":0,"100":0.00274,"101":0.0603,"102":0.02741,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00274,"14":0,"15":0.00274,"16":0,"17":0.00274,"18":0.00274,"79":0,"80":0,"81":0,"83":0,"84":0.00274,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00274,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00274,"101":0,"102":0,"103":0,"104":0,"105":0.01645,"106":0,"107":0,"108":0,"109":0.00274,"110":0.00274,"111":0.00274,"112":0.00274,"113":0.00274,"114":0.01096,"115":0.04934,"116":0.56739,"117":0.43034},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00548,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00822,"14.1":0.01096,"15.1":0.00274,"15.2-15.3":0,"15.4":0.00274,"15.5":0.00548,"15.6":0.03837,"16.0":0.00274,"16.1":0.00822,"16.2":0.00822,"16.3":0.01371,"16.4":0.00548,"16.5":0.02741,"16.6":0.2138,"17.0":0.00822,"17.1":0},G:{"8":0.00201,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00302,"7.0-7.1":0.01308,"8.1-8.4":0,"9.0-9.2":0.00201,"9.3":0.05232,"10.0-10.2":0,"10.3":0.04729,"11.0-11.2":0.00201,"11.3-11.4":0.00805,"12.0-12.1":0.00101,"12.2-12.5":0.31492,"13.0-13.1":0.00604,"13.2":0.05836,"13.3":0.12375,"13.4-13.7":0.00805,"14.0-14.4":0.06842,"14.5-14.8":0.11168,"15.0-15.1":0.03622,"15.2-15.3":0.0654,"15.4":0.12074,"15.5":0.1147,"15.6-15.7":0.90854,"16.0":0.25153,"16.1":0.53627,"16.2":0.19921,"16.3":0.44371,"16.4":0.16501,"16.5":0.57551,"16.6":5.17254,"17.0":0.57953,"17.1":0},P:{"4":0.18482,"20":0.34911,"21":0.63661,"22":6.06829,"5.0-5.4":0,"6.2-6.4":0.04107,"7.2-7.4":0.45178,"8.2":0,"9.2":0.01027,"10.1":0,"11.1-11.2":0.05134,"12.0":0.0308,"13.0":0.07187,"14.0":0.06161,"15.0":0.04107,"16.0":0.13348,"17.0":0.05134,"18.0":0.2875,"19.0":0.58527},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.0966},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01096,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":68.65255},R:{_:"0"},M:{"0":0.24681},Q:{"13.1":0.32666},O:{"0":0.76945},H:{"0":0.90028}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FK.js
index e1b34ecd3505cb..8b23749a9986c9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FK.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.0427,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.0061,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.0061,"105":0,"106":0,"107":0,"108":0.4697,"109":0,"110":0.07015,"111":0,"112":0,"113":0.0305,"114":0.0305,"115":0.4819,"116":0.6344,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.05185,"80":0,"81":0.0061,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.0061,"92":0,"93":0,"94":0,"95":0,"96":0.0061,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.10675,"110":0,"111":0.0427,"112":0,"113":0.0183,"114":0.5368,"115":1.6653,"116":1.3603,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0122,"100":0.0366,"101":0.0061,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.0366,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.0305,"106":0,"107":0,"108":0,"109":0.59475,"110":0.1403,"111":0,"112":0,"113":0.0061,"114":0.24705,"115":1.1956,"116":0.2989},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.0061,"15.1":0.0366,"15.2-15.3":0.0061,"15.4":0,"15.5":0,"15.6":0.39955,"16.0":0.0061,"16.1":0.0122,"16.2":0.0061,"16.3":0,"16.4":0.0305,"16.5":0.1403,"16.6":0.3416},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02237,"10.0-10.2":0,"10.3":0,"11.0-11.2":0.02237,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.08949,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.88002,"14.5-14.8":0.02237,"15.0-15.1":0,"15.2-15.3":0.04475,"15.4":0,"15.5":0.1361,"15.6-15.7":0.90425,"16.0":0.15848,"16.1":0.40645,"16.2":0.06712,"16.3":0.27034,"16.4":0.20322,"16.5":8.89338,"16.6":6.52368},P:{"4":0,"20":0.02045,"21":0.17379,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.04089,"13.0":0.25557,"14.0":7.9943,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.1647,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":37.9278},R:{_:"0"},M:{"0":0.8896},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.0138,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":1.09456,"109":0,"110":0,"111":0.03679,"112":0,"113":0.08738,"114":0.0138,"115":0.21615,"116":0.30353,"117":2.55245,"118":0.16556,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.31733,"80":0,"81":0.03679,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.06439,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.25295,"110":0,"111":0,"112":0.03679,"113":0,"114":0,"115":1.23253,"116":3.84936,"117":1.94538,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.07818,"102":0.08738,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.08738,"79":0.0138,"80":0,"81":0,"83":0,"84":0.03679,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.05059,"110":0.15177,"111":0,"112":0.38172,"113":0,"114":0.82782,"115":0.07818,"116":2.41448,"117":0.80023},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0.07818,"15.2-15.3":0,"15.4":0,"15.5":0.0138,"15.6":0.43231,"16.0":0.0138,"16.1":0,"16.2":0.0138,"16.3":0.11498,"16.4":0.18856,"16.5":0.78643,"16.6":1.70163,"17.0":0.0138,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.09733,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0.13036,"15.0-15.1":0,"15.2-15.3":0.25898,"15.4":0,"15.5":0,"15.6-15.7":0.96986,"16.0":0.38759,"16.1":2.10309,"16.2":0.16164,"16.3":1.26186,"16.4":0.06431,"16.5":0.77693,"16.6":10.42161,"17.0":0.61529,"17.1":0},P:{"4":0,"20":0,"21":1.33268,"22":8.6932,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.11277,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":4.64389,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.10118,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":39.29373},R:{_:"0"},M:{"0":0.93437},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FM.js
index 9602a58f2bce66..9bf5af5e4b9781 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00817,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00817,"100":0,"101":0,"102":0.00817,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00408,"109":0.0245,"110":0,"111":0,"112":0,"113":0.00817,"114":0.00817,"115":0.22054,"116":0.84947,"117":0.09393,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00408,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01225,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00408,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00408,"62":0,"63":0.00408,"64":0,"65":0,"66":0,"67":0,"68":0.01634,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.02042,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.04901,"92":0,"93":0.04901,"94":0,"95":0,"96":0.00408,"97":0.00817,"98":0.00408,"99":0,"100":0.00408,"101":0,"102":0.00408,"103":0.15928,"104":0,"105":0.00408,"106":0.00408,"107":0.00408,"108":0.02042,"109":0.27771,"110":0.00408,"111":0,"112":0.00408,"113":0.02042,"114":0.2042,"115":4.93347,"116":2.48716,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00817,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00817,"69":0,"70":0,"71":0.01634,"72":0.02042,"73":0,"74":0,"75":0,"76":0.00408,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00817,"100":0.04492,"101":0.00817,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00408,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00817,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00817,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00408,"109":0.0245,"110":0,"111":0.00817,"112":0,"113":0,"114":0.15519,"115":2.58517,"116":1.29054},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00817,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02042,"14.1":0.00408,"15.1":0.06126,"15.2-15.3":0,"15.4":0.01634,"15.5":0.00817,"15.6":0.02042,"16.0":0,"16.1":0.04492,"16.2":0.00817,"16.3":0.01225,"16.4":0.0245,"16.5":0.08168,"16.6":0.08168},G:{"8":0,"17":0.00965,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02896,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.00965,"12.0-12.1":0,"12.2-12.5":0.40383,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.04988,"14.0-14.4":0.02896,"14.5-14.8":0.15767,"15.0-15.1":0.27512,"15.2-15.3":0.04827,"15.4":0.09814,"15.5":0.40383,"15.6-15.7":1.25173,"16.0":0.38453,"16.1":0.76906,"16.2":0.4328,"16.3":1.35952,"16.4":0.36522,"16.5":3.33043,"16.6":6.68017},P:{"4":0,"20":0.01044,"21":0.24022,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.094,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.02089,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.02089},I:{"0":0,"3":0,"4":0.63302,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00408,"11":0.00817,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.49884},R:{_:"0"},M:{"0":0.07099},Q:{"13.1":0.01775},O:{"0":0.76908},H:{"0":0.14562}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.09532,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00502,"110":0,"111":0.02509,"112":0,"113":0,"114":0.0301,"115":0.04014,"116":0.31607,"117":0.99838,"118":0.04014,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01505,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.02007,"60":0,"61":0,"62":0.04515,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01003,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00502,"75":0,"76":0,"77":0.02509,"78":0,"79":0.10034,"80":0.01003,"81":0.00502,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00502,"89":0,"90":0,"91":0,"92":0,"93":0.25085,"94":0.00502,"95":0,"96":0,"97":0,"98":0,"99":0.00502,"100":0,"101":0,"102":0,"103":0.07526,"104":0,"105":0.02007,"106":0,"107":0.02007,"108":0.03512,"109":0.37126,"110":0.01003,"111":0.00502,"112":0.02007,"113":0,"114":0.03512,"115":0.16054,"116":8.40849,"117":2.73427,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01003,"73":0,"74":0,"75":0,"76":0,"77":0.02007,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00502,"101":0.0602,"102":0.09532,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00502,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00502,"108":0.00502,"109":0.05017,"110":0,"111":0,"112":0.02007,"113":0,"114":0.05519,"115":0.0602,"116":4.12397,"117":3.76777},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00502,"15":0.01505,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01003,"14.1":0.01003,"15.1":0.02509,"15.2-15.3":0,"15.4":0,"15.5":0.02007,"15.6":0.09532,"16.0":0,"16.1":0.05519,"16.2":0.03512,"16.3":0.18061,"16.4":0.14549,"16.5":0.04515,"16.6":0.23078,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0.01223,"11.3-11.4":0,"12.0-12.1":0.01223,"12.2-12.5":0.09985,"13.0-13.1":0,"13.2":0,"13.3":0.05094,"13.4-13.7":0,"14.0-14.4":0.1406,"14.5-14.8":0.40347,"15.0-15.1":0.0754,"15.2-15.3":0.06317,"15.4":0.0754,"15.5":0.27713,"15.6-15.7":1.86045,"16.0":0.32604,"16.1":1.35713,"16.2":0.62762,"16.3":1.00664,"16.4":0.56649,"16.5":0.72951,"16.6":11.95541,"17.0":0.71728,"17.1":0},P:{"4":0,"20":0,"21":0.19602,"22":0.96979,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01032,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01032,"12.0":0,"13.0":0.14444,"14.0":0,"15.0":0,"16.0":0.07222,"17.0":0.01032,"18.0":0.01032,"19.0":0.01032},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.59617},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02509,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":49.31744},R:{_:"0"},M:{"0":0.51325},Q:{"13.1":0},O:{"0":2.43669},H:{"0":0.08963}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FO.js
index e6a80710dae278..cde3172e761e2f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.003,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.32667,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.05395,"116":0.47353,"117":0.00599,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.003,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.01798,"80":0,"81":0,"83":0,"84":0,"85":0.003,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.003,"98":0,"99":0.003,"100":0,"101":0,"102":0,"103":0.02098,"104":0,"105":0,"106":0,"107":0,"108":0.003,"109":0.11688,"110":0.01199,"111":0.00899,"112":0.01199,"113":0.02697,"114":0.14386,"115":1.45954,"116":0.62937,"117":0.00899,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.003,"96":0,"97":0,"98":0,"99":0.003,"100":0.08092,"101":0.00899,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00599,"110":0,"111":0,"112":0,"113":0.00599,"114":0.02398,"115":0.48851,"116":0.17982},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.04496,"15":0.003,"17":0.03596,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00899,"14.1":0.02398,"15.1":0.00599,"15.2-15.3":0.01199,"15.4":0.05395,"15.5":0.09291,"15.6":0.59341,"16.0":0.01499,"16.1":0.08991,"16.2":0.12288,"16.3":0.36863,"16.4":0.1978,"16.5":1.00999,"16.6":1.87313},G:{"8":0,"17":0.54153,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03332,"10.0-10.2":0,"10.3":0.15829,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.2666,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.05832,"14.5-14.8":0.09164,"15.0-15.1":0.09997,"15.2-15.3":0.19162,"15.4":0.34991,"15.5":0.59985,"15.6-15.7":8.89775,"16.0":3.1742,"16.1":6.44837,"16.2":2.94925,"16.3":5.75687,"16.4":0.68316,"16.5":15.62104,"16.6":37.3572},P:{"4":0,"20":0.08259,"21":0.09292,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.01032},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":6.51974},R:{_:"0"},M:{"0":0.04202},Q:{"13.1":0},O:{"0":0},H:{"0":0.00663}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.09191,"103":0,"104":0,"105":0,"106":0.05656,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.03182,"116":0.00354,"117":0.31462,"118":0.03535,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00707,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.03889,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00354,"80":0,"81":0,"83":0,"84":0,"85":0.00354,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01768,"93":0,"94":0,"95":0,"96":0,"97":0.00354,"98":0,"99":0,"100":0,"101":0.00354,"102":0,"103":0.39592,"104":0,"105":0,"106":0,"107":0.00707,"108":0.02475,"109":0.11312,"110":0.05303,"111":0.01768,"112":0.01768,"113":0.01061,"114":0.02828,"115":0.20503,"116":2.49925,"117":0.63984,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.04242,"101":0.03889,"102":0.10959,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01768,"110":0,"111":0,"112":0,"113":0,"114":0.00707,"115":0.01414,"116":0.39592,"117":0.30048},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.04242,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.03535,"14.1":0.02828,"15.1":0.01061,"15.2-15.3":0.02121,"15.4":0.07424,"15.5":0.11312,"15.6":0.71407,"16.0":0.01414,"16.1":0.21917,"16.2":0.26159,"16.3":0.50551,"16.4":0.09545,"16.5":0.30401,"16.6":3.98748,"17.0":0.15908,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04907,"10.0-10.2":0,"10.3":0.02453,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.13084,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.04089,"14.5-14.8":0.30257,"15.0-15.1":0.18808,"15.2-15.3":0.13902,"15.4":0.31892,"15.5":0.5806,"15.6-15.7":7.00814,"16.0":2.4369,"16.1":5.62614,"16.2":2.6904,"16.3":4.77567,"16.4":0.38434,"16.5":2.38784,"16.6":50.2427,"17.0":3.59811,"17.1":0.01636},P:{"4":0,"20":0.05155,"21":0.02062,"22":0.6804,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.01031},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.01707},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":5.62616},R:{_:"0"},M:{"0":0.02586},Q:{"13.1":0},O:{"0":0},H:{"0":0.02448}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FR.js
index c46d6586d494f3..1367d9df171290 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/FR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0.00433,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0.00433,"11":0,"12":0.013,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00433,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00433,"48":0.00867,"49":0,"50":0,"51":0,"52":0.02167,"53":0,"54":0.00433,"55":0,"56":0,"57":0,"58":0,"59":0.01734,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00433,"69":0,"70":0,"71":0,"72":0.00433,"73":0,"74":0,"75":0.00433,"76":0,"77":0.00433,"78":0.04767,"79":0,"80":0,"81":0,"82":0.00433,"83":0.00433,"84":0,"85":0,"86":0,"87":0,"88":0.00433,"89":0.00433,"90":0.00433,"91":0.01734,"92":0,"93":0.00867,"94":0.013,"95":0.00433,"96":0,"97":0,"98":0,"99":0.00433,"100":0.00433,"101":0.00433,"102":0.10402,"103":0.26004,"104":0.00867,"105":0.013,"106":0.01734,"107":0.01734,"108":0.01734,"109":0.026,"110":0.02167,"111":0.01734,"112":0.013,"113":0.03034,"114":0.05201,"115":0.58942,"116":1.66426,"117":0.05634,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00433},D:{"4":0.00433,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00433,"49":0.03034,"50":0,"51":0.00867,"52":0.00433,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.08668,"61":0,"62":0,"63":0,"64":0,"65":0.00433,"66":0.07801,"67":0.00433,"68":0.00433,"69":0.00433,"70":0.00433,"71":0.013,"72":0.00433,"73":0,"74":0.00867,"75":0.00433,"76":0.00867,"77":0.00433,"78":0.00867,"79":0.026,"80":0.013,"81":0.026,"83":0.00867,"84":0.00433,"85":0.026,"86":0.026,"87":0.03467,"88":0.013,"89":0.00867,"90":0.013,"91":0.00867,"92":0.00433,"93":0.00867,"94":0.16469,"95":0.02167,"96":0.026,"97":0.00867,"98":0.00867,"99":0.01734,"100":0.013,"101":0.01734,"102":0.01734,"103":0.06501,"104":0.10835,"105":0.03901,"106":0.07368,"107":0.09535,"108":0.12569,"109":0.73678,"110":0.07368,"111":0.16469,"112":0.09535,"113":0.06501,"114":0.4074,"115":4.19531,"116":2.6264,"117":0.00433,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00433,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00433,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00433,"70":0.00433,"71":0.03467,"72":0.026,"73":0,"74":0,"75":0,"76":0.00433,"77":0.00433,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00433,"92":0.00433,"93":0.00433,"94":0.00433,"95":0.03034,"96":0.00433,"97":0,"98":0,"99":0.01734,"100":0.26004,"101":0.2297,"102":0.00433,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00433,"15":0,"16":0,"17":0.013,"18":0.00433,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00433,"86":0.00433,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00433,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00433,"100":0,"101":0,"102":0,"103":0.00433,"104":0,"105":0.00433,"106":0.00867,"107":0.01734,"108":0.02167,"109":0.06501,"110":0.01734,"111":0.03034,"112":0.00867,"113":0.013,"114":0.12135,"115":1.56457,"116":0.60676},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00433,"14":0.03467,"15":0.00867,"17":0.00867,_:"0","3.1":0,"3.2":0,"5.1":0.00433,"6.1":0,"7.1":0,"9.1":0.026,"10.1":0,"11.1":0.02167,"12.1":0.02167,"13.1":0.07368,"14.1":0.10402,"15.1":0.01734,"15.2-15.3":0.013,"15.4":0.02167,"15.5":0.03901,"15.6":0.2167,"16.0":0.03034,"16.1":0.05634,"16.2":0.05201,"16.3":0.13435,"16.4":0.05634,"16.5":0.39439,"16.6":0.49408},G:{"8":0.00525,"17":0.19415,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00262,"7.0-7.1":0.01312,"8.1-8.4":0.00262,"9.0-9.2":0.01837,"9.3":0.0892,"10.0-10.2":0.00525,"10.3":0.09707,"11.0-11.2":0.08133,"11.3-11.4":0.07871,"12.0-12.1":0.04198,"12.2-12.5":0.51423,"13.0-13.1":0.03411,"13.2":0.01312,"13.3":0.03935,"13.4-13.7":0.11806,"14.0-14.4":0.24924,"14.5-14.8":0.40928,"15.0-15.1":0.16791,"15.2-15.3":0.15742,"15.4":0.16004,"15.5":0.27023,"15.6-15.7":2.02805,"16.0":1.07306,"16.1":1.80505,"16.2":0.83169,"16.3":1.77881,"16.4":0.3883,"16.5":5.08194,"16.6":10.46035},P:{"4":0.07294,"20":0.13546,"21":0.31261,"22":2.76136,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01042,"8.2":0.01042,"9.2":0.02084,"10.1":0,"11.1-11.2":0.04168,"12.0":0.01042,"13.0":0.03126,"14.0":0.02084,"15.0":0.01042,"16.0":0.04168,"17.0":0.03126,"18.0":0.04168,"19.0":0.07294},I:{"0":0,"3":0,"4":0.04462,"2.1":0,"2.2":0,"2.3":0,"4.1":0.11156,"4.2-4.3":0.08925,"4.4":0,"4.4.3-4.4.4":0.82554},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00453,"9":0.01812,"10":0,"11":0.07703,"5.5":0},S:{"2.5":0.01133,_:"3.0-3.1"},J:{"7":0,"10":0.00567},N:{"10":0.01133,"11":0},L:{"0":46.25534},R:{_:"0"},M:{"0":0.69125},Q:{"13.1":0.00567},O:{"0":0.64026},H:{"0":0.57933}};
+module.exports={C:{"2":0,"3":0,"4":0.00469,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0.00469,"11":0,"12":0.0375,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00469,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01406,"49":0,"50":0,"51":0,"52":0.02344,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.01875,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00469,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00938,"76":0,"77":0,"78":0.04688,"79":0,"80":0,"81":0,"82":0.00469,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00469,"89":0,"90":0,"91":0.01875,"92":0,"93":0.00938,"94":0.00938,"95":0,"96":0,"97":0,"98":0,"99":0.00469,"100":0.00469,"101":0,"102":0.1172,"103":0.4313,"104":0.00938,"105":0.00938,"106":0.01406,"107":0.00938,"108":0.01406,"109":0.02344,"110":0.01406,"111":0.01406,"112":0.01406,"113":0.0375,"114":0.03282,"115":0.33285,"116":0.12658,"117":1.96427,"118":0.18752,"119":0.00469,"120":0,"3.5":0,"3.6":0.00469},D:{"4":0.00469,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02813,"50":0,"51":0,"52":0.00469,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00469,"59":0,"60":0.12658,"61":0,"62":0.00469,"63":0,"64":0,"65":0.00469,"66":0.07032,"67":0,"68":0.00469,"69":0,"70":0.00469,"71":0.00938,"72":0.00469,"73":0,"74":0.00469,"75":0,"76":0.00469,"77":0.00469,"78":0.00469,"79":0.02344,"80":0.01406,"81":0.03282,"83":0.00469,"84":0.00469,"85":0.02813,"86":0.01875,"87":0.09845,"88":0.00938,"89":0.00938,"90":0.01406,"91":0.00938,"92":0.00938,"93":0.00938,"94":0.16408,"95":0.01875,"96":0.02813,"97":0.00938,"98":0.00938,"99":0.02344,"100":0.01406,"101":0.02344,"102":0.02813,"103":0.07032,"104":0.02813,"105":0.0375,"106":0.07032,"107":0.08438,"108":0.1172,"109":0.78758,"110":0.07032,"111":0.15002,"112":0.09376,"113":0.04688,"114":0.16877,"115":0.25315,"116":6.7601,"117":2.04397,"118":0.00469,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00938,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00469,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00469,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00469,"70":0.00469,"71":0.00938,"72":0.05157,"73":0.01406,"74":0,"75":0,"76":0,"77":0.03282,"78":0.00469,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00469,"92":0.00469,"93":0.00469,"94":0.00469,"95":0.02813,"96":0.00469,"97":0,"98":0,"99":0.00938,"100":0.07032,"101":0.22034,"102":0.3516,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00469,"15":0,"16":0,"17":0.00938,"18":0.00469,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00469,"86":0,"87":0,"88":0,"89":0,"90":0.00469,"91":0,"92":0.00469,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00469,"100":0,"101":0,"102":0,"103":0.00469,"104":0,"105":0.00469,"106":0.00938,"107":0.01875,"108":0.01875,"109":0.07501,"110":0.00938,"111":0.01406,"112":0.00938,"113":0.00938,"114":0.06563,"115":0.06094,"116":1.34077,"117":1.11106},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00469,"14":0.03282,"15":0.00938,_:"0","3.1":0,"3.2":0,"5.1":0.00469,"6.1":0,"7.1":0,"9.1":0.00938,"10.1":0,"11.1":0.01875,"12.1":0.02344,"13.1":0.0797,"14.1":0.12189,"15.1":0.01875,"15.2-15.3":0.01406,"15.4":0.02344,"15.5":0.04219,"15.6":0.22502,"16.0":0.03282,"16.1":0.05626,"16.2":0.04688,"16.3":0.12658,"16.4":0.06094,"16.5":0.17346,"16.6":0.8204,"17.0":0.04219,"17.1":0},G:{"8":0.00512,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00512,"7.0-7.1":0.01537,"8.1-8.4":0.00256,"9.0-9.2":0.01025,"9.3":0.082,"10.0-10.2":0.00512,"10.3":0.09737,"11.0-11.2":0.08968,"11.3-11.4":0.03844,"12.0-12.1":0.02819,"12.2-12.5":0.44842,"13.0-13.1":0.02819,"13.2":0.01025,"13.3":0.26649,"13.4-13.7":0.10506,"14.0-14.4":0.22549,"14.5-14.8":0.38179,"15.0-15.1":0.16143,"15.2-15.3":0.13324,"15.4":0.14349,"15.5":0.23574,"15.6-15.7":1.7706,"16.0":0.9532,"16.1":1.46568,"16.2":0.69953,"16.3":1.39649,"16.4":0.2793,"16.5":0.9122,"16.6":13.57801,"17.0":1.69885,"17.1":0.00512},P:{"4":0.07228,"20":0.10325,"21":0.18585,"22":2.6226,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01033,"8.2":0.01033,"9.2":0.02065,"10.1":0,"11.1-11.2":0.03098,"12.0":0.01033,"13.0":0.02065,"14.0":0.02065,"15.0":0.01033,"16.0":0.0413,"17.0":0.03098,"18.0":0.0413,"19.0":0.07228},I:{"0":0,"3":0,"4":0.03074,"2.1":0,"2.2":0.04612,"2.3":0,"4.1":0.04612,"4.2-4.3":0.06149,"4.4":0,"4.4.3-4.4.4":0.46115},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00493,"9":0.0148,"10":0.00493,"11":0.06909,"5.5":0},S:{"2.5":0.00531,_:"3.0-3.1"},J:{"7":0,"10":0.00531},N:{"10":0.01594,"11":0},L:{"0":44.75522},R:{_:"0"},M:{"0":0.63744},Q:{"13.1":0.00531},O:{"0":0.61619},H:{"0":0.5884}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GA.js
index 4924059ab4598e..861ccb53423431 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00298,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00298,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01787,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00298,"89":0,"90":0,"91":0.00298,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00298,"103":0,"104":0,"105":0,"106":0,"107":0.00893,"108":0.00298,"109":0,"110":0,"111":0,"112":0.00596,"113":0,"114":0.00298,"115":0.17272,"116":0.37225,"117":0.00298,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00298,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00298,"39":0,"40":0.00298,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00298,"50":0.00298,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00298,"65":0.00298,"66":0.00298,"67":0,"68":0,"69":0.00596,"70":0,"71":0,"72":0,"73":0.00893,"74":0,"75":0.00298,"76":0,"77":0,"78":0,"79":0.05063,"80":0,"81":0.05956,"83":0.01191,"84":0.02085,"85":0,"86":0.00596,"87":0.00298,"88":0.00298,"89":0.02382,"90":0.00298,"91":0.00893,"92":0,"93":0,"94":0,"95":0.03276,"96":0.00298,"97":0,"98":0.01787,"99":0,"100":0.00298,"101":0,"102":0.00298,"103":0.01191,"104":0.00596,"105":0.02382,"106":0.00893,"107":0.00298,"108":0,"109":0.75046,"110":0.01191,"111":0.00298,"112":0.08934,"113":0.03276,"114":0.17868,"115":2.59086,"116":0.92914,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.02085,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00298,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00596,"62":0,"63":0.01489,"64":0,"65":0,"66":0.00596,"67":0.00298,"68":0.00298,"69":0.03871,"70":0.07743,"71":0.36927,"72":0.11912,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0.00298,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.07445,"96":0,"97":0,"98":0,"99":0.00298,"100":0.05063,"101":0.17272,"102":0.00298,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.01191,"11.5":0,"11.6":0,"12.1":0.00596},B:{"12":0,"13":0.00298,"14":0,"15":0.00298,"16":0,"17":0.00298,"18":0.00298,"79":0,"80":0,"81":0,"83":0.01489,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00596,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01489,"110":0,"111":0.01191,"112":0.00298,"113":0.00596,"114":0.03574,"115":0.9202,"116":0.20846},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00298,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00596,"14.1":0.01191,"15.1":0,"15.2-15.3":0.00298,"15.4":0.00298,"15.5":0.00298,"15.6":0.01787,"16.0":0,"16.1":0.00298,"16.2":0.00298,"16.3":0.00298,"16.4":0,"16.5":0.02382,"16.6":0.02978},G:{"8":0.0356,"17":0.15371,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.16018,"6.0-6.1":0,"7.0-7.1":0.19739,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.16018,"10.0-10.2":0,"10.3":0.03398,"11.0-11.2":0.03883,"11.3-11.4":0.33815,"12.0-12.1":0.30579,"12.2-12.5":3.21327,"13.0-13.1":0,"13.2":0,"13.3":0.01294,"13.4-13.7":0.01133,"14.0-14.4":0.27667,"14.5-14.8":0.17474,"15.0-15.1":0.37375,"15.2-15.3":0.14885,"15.4":0.27344,"15.5":0.2249,"15.6-15.7":3.60805,"16.0":0.15047,"16.1":0.85428,"16.2":0.19416,"16.3":0.62453,"16.4":0.15856,"16.5":1.9367,"16.6":2.50784},P:{"4":0.29568,"20":0.10196,"21":0.21411,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.37725,"8.2":0,"9.2":0.0102,"10.1":0.0102,"11.1-11.2":0.06118,"12.0":0.02039,"13.0":0.02039,"14.0":0.02039,"15.0":0.02039,"16.0":0.06118,"17.0":0.02039,"18.0":0.12235,"19.0":0.04078},I:{"0":0,"3":0,"4":0.02396,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00436,"4.4":0,"4.4.3-4.4.4":0.32018},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02085,"5.5":0},S:{"2.5":0.02107,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.87309},R:{_:"0"},M:{"0":0.04915},Q:{"13.1":0},O:{"0":0.37919},H:{"0":2.90517}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00298,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00596,"49":0,"50":0,"51":0,"52":0.00298,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00298,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00298,"103":0,"104":0,"105":0,"106":0,"107":0.00298,"108":0,"109":0,"110":0,"111":0,"112":0.00596,"113":0,"114":0,"115":0.03873,"116":0.00894,"117":0.25024,"118":0.04171,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00596,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00298,"67":0,"68":0,"69":0.00894,"70":0,"71":0,"72":0,"73":0.00298,"74":0,"75":0.00298,"76":0,"77":0.00298,"78":0,"79":0.02085,"80":0.00894,"81":0.03277,"83":0.01787,"84":0.00596,"85":0,"86":0,"87":0.00596,"88":0.00596,"89":0.02383,"90":0,"91":0,"92":0,"93":0,"94":0.05064,"95":0.02383,"96":0,"97":0,"98":0.0149,"99":0,"100":0,"101":0.00596,"102":0.01787,"103":0.01192,"104":0,"105":0,"106":0.0149,"107":0,"108":0,"109":0.87285,"110":0.00894,"111":0.00298,"112":0.03575,"113":0.01192,"114":0.09235,"115":0.11022,"116":2.47257,"117":0.72986,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00894,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00298,"58":0.01192,"60":0.00596,"62":0,"63":0.00596,"64":0,"65":0,"66":0.00596,"67":0.00298,"68":0.00298,"69":0.04171,"70":0.0149,"71":0.06852,"72":0.24428,"73":0.08937,"74":0,"75":0,"76":0,"77":0.00596,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.06256,"96":0,"97":0,"98":0,"99":0,"100":0.00298,"101":0.07448,"102":0.09235,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00298,"11.5":0,"11.6":0,"12.1":0.00298},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00298,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00894,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00298,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00298,"109":0.02681,"110":0,"111":0.02979,"112":0,"113":0.00894,"114":0.01192,"115":0.02085,"116":0.74177,"117":0.48856},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00596,"14.1":0.00298,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.02085,"15.6":0.02085,"16.0":0,"16.1":0,"16.2":0.00298,"16.3":0.00298,"16.4":0.00298,"16.5":0.01192,"16.6":0.02383,"17.0":0,"17.1":0},G:{"8":0.00992,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00662,"6.0-6.1":0.00331,"7.0-7.1":0.49282,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07607,"10.0-10.2":0,"10.3":0.1108,"11.0-11.2":0.08269,"11.3-11.4":0.36383,"12.0-12.1":0.18191,"12.2-12.5":3.96573,"13.0-13.1":0,"13.2":0,"13.3":0.00331,"13.4-13.7":0.02481,"14.0-14.4":0.10915,"14.5-14.8":0.18853,"15.0-15.1":0.48951,"15.2-15.3":0.10419,"15.4":0.02646,"15.5":0.26129,"15.6-15.7":3.78547,"16.0":0.12238,"16.1":0.55897,"16.2":0.18191,"16.3":0.62016,"16.4":0.15545,"16.5":0.49282,"16.6":3.28438,"17.0":0.70947,"17.1":0.00496},P:{"4":0.41678,"20":0.20331,"21":0.16265,"22":1.69762,"5.0-5.4":0.01017,"6.2-6.4":0.02033,"7.2-7.4":0.41678,"8.2":0,"9.2":0.01017,"10.1":0,"11.1-11.2":0.08132,"12.0":0,"13.0":0.01017,"14.0":0.01017,"15.0":0.02033,"16.0":0.09149,"17.0":0.02033,"18.0":0.08132,"19.0":0.06099},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00259,"4.4":0,"4.4.3-4.4.4":0.09699},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00894,"5.5":0},S:{"2.5":0.02808,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.55528},R:{_:"0"},M:{"0":0.04213},Q:{"13.1":0},O:{"0":0.17553},H:{"0":2.09381}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GB.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GB.js
index 9a794b384a85c6..14e0534fb32632 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GB.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GB.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00504,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00504,"49":0,"50":0,"51":0,"52":0.01007,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.01007,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02518,"79":0,"80":0,"81":0,"82":0,"83":0.00504,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.01511,"90":0.02518,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01511,"103":0,"104":0,"105":0,"106":0.00504,"107":0,"108":0.00504,"109":0.00504,"110":0.00504,"111":0.00504,"112":0.00504,"113":0.01007,"114":0.02014,"115":0.287,"116":0.64448,"117":0.02014,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01007,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.04028,"57":0,"58":0,"59":0,"60":0.01511,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.05035,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00504,"75":0.00504,"76":0.01007,"77":0.00504,"78":0,"79":0.02518,"80":0.00504,"81":0.01511,"83":0.03021,"84":0.00504,"85":0.00504,"86":0.01007,"87":0.01511,"88":0.01511,"89":0.01007,"90":0.00504,"91":0.01511,"92":0.01007,"93":0.04532,"94":0.00504,"95":0.00504,"96":0.05035,"97":0.00504,"98":0.01007,"99":0.01511,"100":0.01007,"101":0.01007,"102":0.01007,"103":0.16112,"104":0.01007,"105":0.01511,"106":0.02518,"107":0.02014,"108":0.03525,"109":0.52364,"110":0.02518,"111":0.04532,"112":0.07049,"113":0.13595,"114":1.0926,"115":7.77404,"116":3.53961,"117":0.01511,"118":0.00504,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00504,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.01007,"72":0.01007,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01007,"96":0,"97":0,"98":0,"99":0.01007,"100":0.26686,"101":0.14098,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00504,"18":0.00504,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00504,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00504,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00504,"108":0.00504,"109":0.05035,"110":0.00504,"111":0.00504,"112":0.01511,"113":0.02518,"114":0.23665,"115":3.77122,"116":1.08756},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00504,"14":0.04028,"15":0.01007,"17":0.01511,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00504,"10.1":0,"11.1":0.01007,"12.1":0.01511,"13.1":0.06546,"14.1":0.12084,"15.1":0.01511,"15.2-15.3":0.01511,"15.4":0.02518,"15.5":0.04532,"15.6":0.35749,"16.0":0.03021,"16.1":0.06546,"16.2":0.09063,"16.3":0.21651,"16.4":0.06546,"16.5":0.6898,"16.6":1.22351},G:{"8":0,"17":0.22314,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0108,"8.1-8.4":0.0108,"9.0-9.2":0,"9.3":0.23394,"10.0-10.2":0.0036,"10.3":0.19795,"11.0-11.2":0.05758,"11.3-11.4":0.09358,"12.0-12.1":0.018,"12.2-12.5":0.96455,"13.0-13.1":0.0072,"13.2":0.0036,"13.3":0.02159,"13.4-13.7":0.05758,"14.0-14.4":0.14756,"14.5-14.8":0.3959,"15.0-15.1":0.10077,"15.2-15.3":0.12597,"15.4":0.14396,"15.5":0.25193,"15.6-15.7":3.05199,"16.0":0.96455,"16.1":2.25301,"16.2":0.98614,"16.3":2.04426,"16.4":0.26993,"16.5":6.4459,"16.6":16.86515},P:{"4":0.06339,"20":0.08452,"21":0.23242,"22":3.15885,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01056,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01056,"12.0":0,"13.0":0.02113,"14.0":0.02113,"15.0":0.01056,"16.0":0.02113,"17.0":0.02113,"18.0":0.02113,"19.0":0.04226},I:{"0":0,"3":0,"4":0.06066,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02275,"4.2-4.3":0.06066,"4.4":0,"4.4.3-4.4.4":0.3488},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00559,"9":0.00559,"10":0,"11":0.03916,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":32.49174},R:{_:"0"},M:{"0":0.30287},Q:{"13.1":0},O:{"0":0.14895},H:{"0":0.22563}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0052,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.0052,"49":0,"50":0,"51":0,"52":0.01039,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.01039,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01039,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.0052,"90":0.0052,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01559,"103":0,"104":0.0052,"105":0,"106":0.0052,"107":0,"108":0.0052,"109":0.0052,"110":0,"111":0.0052,"112":0.0052,"113":0.01559,"114":0.0052,"115":0.08835,"116":0.07276,"117":0.72238,"118":0.06236,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01039,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.02599,"57":0,"58":0,"59":0,"60":0.02079,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.04677,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.0052,"75":0.0052,"76":0.01039,"77":0.0052,"78":0.0052,"79":0.02079,"80":0.0052,"81":0.01559,"83":0.01559,"84":0.0052,"85":0.0052,"86":0.01039,"87":0.01559,"88":0.01039,"89":0.0052,"90":0.0052,"91":0.02079,"92":0.01039,"93":0.05197,"94":0.0052,"95":0.0052,"96":0.04677,"97":0.0052,"98":0.01039,"99":0.01039,"100":0.01039,"101":0.01559,"102":0.01039,"103":0.1767,"104":0.01559,"105":0.02599,"106":0.02599,"107":0.02599,"108":0.02599,"109":0.53009,"110":0.02079,"111":0.03118,"112":0.06756,"113":0.06236,"114":0.32741,"115":0.62884,"116":10.42518,"117":2.60889,"118":0.0052,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0052,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01559,"73":0.0052,"74":0,"75":0,"76":0,"77":0.01559,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01039,"96":0,"97":0,"98":0,"99":0.0052,"100":0.07276,"101":0.15071,"102":0.30143,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.0052,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0052,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.0052,"108":0.0052,"109":0.04677,"110":0.0052,"111":0.0052,"112":0.01039,"113":0.01559,"114":0.05197,"115":0.21308,"116":2.79079,"117":2.15156},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0052,"14":0.04158,"15":0.0052,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.0052,"10.1":0,"11.1":0.01039,"12.1":0.01039,"13.1":0.06236,"14.1":0.11953,"15.1":0.01559,"15.2-15.3":0.01559,"15.4":0.02599,"15.5":0.04158,"15.6":0.32741,"16.0":0.03118,"16.1":0.06236,"16.2":0.07796,"16.3":0.1767,"16.4":0.06236,"16.5":0.30143,"16.6":1.7306,"17.0":0.07276,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01102,"8.1-8.4":0.00735,"9.0-9.2":0,"9.3":0.202,"10.0-10.2":0,"10.3":0.17997,"11.0-11.2":0.04407,"11.3-11.4":0.06978,"12.0-12.1":0.01836,"12.2-12.5":0.85943,"13.0-13.1":0.00735,"13.2":0.00367,"13.3":0.0404,"13.4-13.7":0.05142,"14.0-14.4":0.13589,"14.5-14.8":0.40768,"15.0-15.1":0.09182,"15.2-15.3":0.1212,"15.4":0.13957,"15.5":0.22771,"15.6-15.7":2.83539,"16.0":0.96594,"16.1":2.01268,"16.2":0.89249,"16.3":1.70784,"16.4":0.19466,"16.5":0.7419,"16.6":22.52149,"17.0":1.75559,"17.1":0.00735},P:{"4":0.04211,"20":0.06316,"21":0.1579,"22":3.09474,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01053,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01053,"12.0":0,"13.0":0.01053,"14.0":0.02105,"15.0":0.01053,"16.0":0.02105,"17.0":0.02105,"18.0":0.02105,"19.0":0.03158},I:{"0":0,"3":0,"4":0.06266,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01566,"4.2-4.3":0.05482,"4.4":0,"4.4.3-4.4.4":0.30545},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0052,"9":0.0052,"10":0,"11":0.03638,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":30.90713},R:{_:"0"},M:{"0":0.29779},Q:{"13.1":0},O:{"0":0.12008},H:{"0":0.20008}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GD.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GD.js
index 41848c28903a0f..22c43aab42c85d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GD.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GD.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00806,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00806,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00403,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00403,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02417,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00403,"109":0.00403,"110":0,"111":0,"112":0,"113":0,"114":0.00806,"115":0.09667,"116":0.45114,"117":0.00403,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00403,"74":0,"75":0,"76":0.01208,"77":0.00806,"78":0,"79":0.01611,"80":0,"81":0,"83":0,"84":0.00403,"85":0,"86":0.01208,"87":0.01208,"88":0.00403,"89":0,"90":0,"91":0.01208,"92":0.00806,"93":0.00403,"94":0,"95":0.00403,"96":0.00403,"97":0,"98":0,"99":0,"100":0,"101":0.01208,"102":0.00403,"103":0.06445,"104":0.01208,"105":0.02014,"106":0.00403,"107":0.00403,"108":0.01611,"109":0.26988,"110":0.01208,"111":0.01611,"112":0.02014,"113":0.01611,"114":0.6324,"115":4.96652,"116":2.91627,"117":0.00806,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00806,"72":0.02014,"73":0,"74":0,"75":0,"76":0,"77":0.01208,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00806,"100":0.10876,"101":0.12487,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00403,"15":0,"16":0,"17":0,"18":0.00403,"79":0,"80":0,"81":0,"83":0,"84":0.00403,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00403,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00403,"109":0.00806,"110":0.01208,"111":0,"112":0.00403,"113":0.01208,"114":0.05639,"115":1.68773,"116":0.55586},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.02014,"15":0,"17":0.00403,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.05639,"14.1":0.11278,"15.1":0,"15.2-15.3":0,"15.4":0.00403,"15.5":0.06445,"15.6":0.41891,"16.0":0.00806,"16.1":0.04834,"16.2":0.02417,"16.3":0.26585,"16.4":0.01611,"16.5":0.32627,"16.6":0.59614},G:{"8":0,"17":0.1726,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00247,"6.0-6.1":0,"7.0-7.1":0.01973,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03945,"10.0-10.2":0.00493,"10.3":0.0863,"11.0-11.2":0.01726,"11.3-11.4":0.02466,"12.0-12.1":0,"12.2-12.5":0.38713,"13.0-13.1":0.00493,"13.2":0,"13.3":0,"13.4-13.7":0.01726,"14.0-14.4":0.03206,"14.5-14.8":0.0863,"15.0-15.1":0.02959,"15.2-15.3":0.04438,"15.4":0.07397,"15.5":0.34274,"15.6-15.7":1.04302,"16.0":0.84083,"16.1":1.94056,"16.2":0.68055,"16.3":0.96165,"16.4":0.12575,"16.5":5.28415,"16.6":12.39297},P:{"4":0.08372,"20":0.07325,"21":0.11511,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.19883,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03139,"12.0":0,"13.0":0.02093,"14.0":0.01046,"15.0":0,"16.0":0.04186,"17.0":0.04186,"18.0":0.02093,"19.0":0.02093},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.10054,"4.4":0,"4.4.3-4.4.4":0.50268},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00806,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":53.2697},R:{_:"0"},M:{"0":0.11347},Q:{"13.1":0},O:{"0":0.04778},H:{"0":0.26008}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01078,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.01617,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02695,"103":0,"104":0,"105":0.00539,"106":0,"107":0,"108":0.00539,"109":0,"110":0,"111":0,"112":0.00539,"113":0,"114":0,"115":0.03772,"116":0.09161,"117":0.68979,"118":0.04311,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00539,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00539,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.01617,"77":0.02156,"78":0,"79":0.00539,"80":0,"81":0,"83":0.00539,"84":0,"85":0,"86":0,"87":0.02695,"88":0.02695,"89":0,"90":0,"91":0,"92":0.00539,"93":0.01617,"94":0,"95":0,"96":0,"97":0,"98":0.00539,"99":0,"100":0,"101":0,"102":0.00539,"103":0.33412,"104":0.01078,"105":0.00539,"106":0.13473,"107":0.19939,"108":0.22095,"109":0.99158,"110":0.21556,"111":0.42034,"112":0.22634,"113":0.00539,"114":0.68979,"115":0.25867,"116":10.18521,"117":4.22498,"118":0.01617,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.01078,"71":0,"72":0.03772,"73":0.00539,"74":0,"75":0,"76":0,"77":0.02695,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00539,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00539,"96":0,"97":0.22095,"98":0,"99":0.02695,"100":0.04311,"101":0.17245,"102":0.10239,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00539,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01617,"110":0,"111":0.21017,"112":0.194,"113":0.00539,"114":0.02156,"115":0.12395,"116":1.54664,"117":1.57898},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00539,"14":0.00539,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00539,"13.1":0.02156,"14.1":0.07006,"15.1":0,"15.2-15.3":0.00539,"15.4":0.00539,"15.5":0.03772,"15.6":0.38801,"16.0":0.01078,"16.1":0.04311,"16.2":0.04311,"16.3":0.15089,"16.4":0.04311,"16.5":0.69518,"16.6":1.78376,"17.0":0.04311,"17.1":0},G:{"8":0.00203,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0324,"6.0-6.1":0,"7.0-7.1":0.01418,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03848,"10.0-10.2":0,"10.3":0.05468,"11.0-11.2":0.01823,"11.3-11.4":0.02633,"12.0-12.1":0.01013,"12.2-12.5":0.46779,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.00608,"14.0-14.4":0.03038,"14.5-14.8":0.09315,"15.0-15.1":0.33616,"15.2-15.3":0.01823,"15.4":0.02228,"15.5":1.07935,"15.6-15.7":1.0834,"16.0":0.30983,"16.1":0.87077,"16.2":0.27136,"16.3":0.39488,"16.4":0.0729,"16.5":0.52246,"16.6":12.91776,"17.0":1.2454,"17.1":0},P:{"4":0.0103,"20":0.03091,"21":0.05151,"22":2.51374,"5.0-5.4":0.0103,"6.2-6.4":0,"7.2-7.4":0.19574,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0206,"12.0":0,"13.0":0.0103,"14.0":0,"15.0":0,"16.0":0.05151,"17.0":0.0103,"18.0":0,"19.0":0.03091},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.62734},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01078,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00461},N:{"10":0,"11":0},L:{"0":46.51484},R:{_:"0"},M:{"0":0.11528},Q:{"13.1":0},O:{"0":0.05072},H:{"0":0.54567}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GE.js
index 90176f6154be6c..b15ac163f4c6a8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00438,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00876,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00876,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00438,"89":0,"90":0,"91":0.00438,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.01315,"100":0,"101":0,"102":0.00876,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00438,"111":0,"112":0,"113":0.01753,"114":0.03506,"115":0.21472,"116":0.28045,"117":0.00876,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00438,"40":0.00438,"41":0.00438,"42":0,"43":0.00438,"44":0.00438,"45":0.00438,"46":0.00438,"47":0.00876,"48":0,"49":0.03067,"50":0,"51":0.00438,"52":0,"53":0,"54":0,"55":0,"56":0.00438,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00438,"64":0,"65":0,"66":0.00438,"67":0,"68":0.01753,"69":0.00438,"70":0.00876,"71":0.00876,"72":0.00876,"73":0.01315,"74":0.01315,"75":0.00438,"76":0.01315,"77":0.00438,"78":0.01315,"79":0.08326,"80":0.01315,"81":0.02629,"83":0.05697,"84":0.00876,"85":0.01315,"86":0.02191,"87":0.06135,"88":0.02629,"89":0.00876,"90":0.0482,"91":0.00876,"92":0.00876,"93":0.00438,"94":0.00438,"95":0.00438,"96":0.00438,"97":0.00438,"98":0.02191,"99":0.00438,"100":0.00438,"101":0.00438,"102":0.01315,"103":0.04382,"104":0.01315,"105":0.00876,"106":0.03067,"107":0.01315,"108":0.02191,"109":2.39257,"110":0.01753,"111":0.02191,"112":0.08326,"113":0.0482,"114":0.43382,"115":6.16109,"116":3.46178,"117":0.00438,"118":0.00438,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01315,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.03944,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00876,"64":0,"65":0,"66":0.00876,"67":0.00438,"68":0,"69":0,"70":0,"71":0.00438,"72":0.00438,"73":0,"74":0,"75":0,"76":0,"77":0.00438,"78":0,"79":0.00438,"80":0.00438,"81":0,"82":0.00438,"83":0.00438,"84":0.00438,"85":0.01753,"86":0.00438,"87":0.00438,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.34618,"96":0,"97":0,"98":0,"99":0.01753,"100":0.52584,"101":0.59595,"102":0.00876,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00876,"13":0.00876,"14":0.01753,"15":0.00438,"16":0.00876,"17":0.01315,"18":0.01315,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00438,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00438,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00438,"108":0,"109":0.01315,"110":0.00438,"111":0.00438,"112":0.00876,"113":0.02191,"114":0.05697,"115":0.91584,"116":0.26292},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00438,"10":0,"11":0,"12":0,"13":0,"14":0.01315,"15":0,"17":0.00438,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.04382,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01753,"14.1":0.03506,"15.1":0.00438,"15.2-15.3":0.00438,"15.4":0.00876,"15.5":0.00876,"15.6":0.06135,"16.0":0.00438,"16.1":0.04382,"16.2":0.02191,"16.3":0.08764,"16.4":0.02629,"16.5":0.15775,"16.6":0.15337},G:{"8":0,"17":0.1643,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.04359,"6.0-6.1":0,"7.0-7.1":0.12071,"8.1-8.4":0.01677,"9.0-9.2":0.00335,"9.3":0.06371,"10.0-10.2":0,"10.3":0.0788,"11.0-11.2":0.03521,"11.3-11.4":0.00671,"12.0-12.1":0.01509,"12.2-12.5":0.63207,"13.0-13.1":0.00838,"13.2":0.00335,"13.3":0.02347,"13.4-13.7":0.03521,"14.0-14.4":0.12742,"14.5-14.8":0.36885,"15.0-15.1":0.11568,"15.2-15.3":0.13077,"15.4":0.11233,"15.5":0.21628,"15.6-15.7":1.70004,"16.0":0.72931,"16.1":1.016,"16.2":0.54321,"16.3":1.09312,"16.4":0.35711,"16.5":3.20727,"16.6":5.78584},P:{"4":0.60397,"20":0.08331,"21":0.17703,"5.0-5.4":0.02083,"6.2-6.4":0.01041,"7.2-7.4":0.08331,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02083,"12.0":0,"13.0":0.02083,"14.0":0,"15.0":0.01041,"16.0":0.03124,"17.0":0.03124,"18.0":0.02083,"19.0":0.07289},I:{"0":0,"3":0,"4":0.04158,"2.1":0,"2.2":0.03118,"2.3":0.03118,"4.1":0.04158,"4.2-4.3":0.14552,"4.4":0,"4.4.3-4.4.4":0.72761},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00438,"8":0.02629,"9":0.00438,"10":0.00438,"11":0.01753,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00562},N:{"10":0,"11":0},L:{"0":59.04064},R:{_:"0"},M:{"0":0.10674},Q:{"13.1":0},O:{"0":0.0618},H:{"0":0.31381}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0134,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00447,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00893,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00447,"89":0,"90":0,"91":0.00447,"92":0.00447,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00893,"100":0,"101":0,"102":0.00893,"103":0,"104":0,"105":0.00447,"106":0,"107":0,"108":0,"109":0.00447,"110":0,"111":0,"112":0,"113":0.03573,"114":0,"115":0.11165,"116":0.05359,"117":0.30815,"118":0.0268,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00447,"39":0,"40":0,"41":0.00447,"42":0,"43":0.00447,"44":0.00447,"45":0.00447,"46":0.00447,"47":0.0134,"48":0,"49":0.0134,"50":0,"51":0.00447,"52":0,"53":0,"54":0,"55":0,"56":0.00447,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00447,"64":0,"65":0,"66":0.00447,"67":0,"68":0.0134,"69":0.00447,"70":0.00447,"71":0,"72":0,"73":0.0134,"74":0.00447,"75":0,"76":0.06252,"77":0.0134,"78":0.0134,"79":0.08039,"80":0.09825,"81":0.10272,"83":0.04913,"84":0.00447,"85":0.01786,"86":0.00447,"87":0.06699,"88":0.08485,"89":0.00447,"90":0.16078,"91":0.00447,"92":0.00447,"93":0,"94":0.00447,"95":0.06252,"96":0.00447,"97":0.00447,"98":0.14738,"99":0.0268,"100":0.05359,"101":0.00447,"102":0.01786,"103":0.04466,"104":0.00447,"105":0.0134,"106":0.03126,"107":0.02233,"108":0.01786,"109":2.21067,"110":0.00893,"111":0.03126,"112":0.06699,"113":0.03126,"114":0.15184,"115":0.2099,"116":7.68152,"117":2.40717,"118":0.00447,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00893,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00447,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0268,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00447,"64":0,"65":0,"66":0.00447,"67":0,"68":0.00447,"69":0,"70":0,"71":0,"72":0.02233,"73":0.00447,"74":0.00447,"75":0,"76":0.00447,"77":0.0134,"78":0.00447,"79":0.00893,"80":0,"81":0.00447,"82":0,"83":0,"84":0.00447,"85":0.0134,"86":0.00447,"87":0.01786,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00447,"95":0.32602,"96":0,"97":0,"98":0,"99":0.00893,"100":0.07592,"101":0.50019,"102":0.50019,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00447,"13":0.01786,"14":0.0134,"15":0.00893,"16":0.00893,"17":0,"18":0.01786,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00447,"89":0,"90":0,"91":0,"92":0.00893,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00893,"101":0.00447,"102":0,"103":0,"104":0,"105":0,"106":0.00447,"107":0.00447,"108":0,"109":0.01786,"110":0.0134,"111":0.00447,"112":0.00447,"113":0.00893,"114":0.04913,"115":0.04019,"116":0.66543,"117":0.50019},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00447,"10":0,"11":0,"12":0,"13":0,"14":0.00893,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00447,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01786,"14.1":0.0268,"15.1":0.00893,"15.2-15.3":0.00447,"15.4":0.00893,"15.5":0.0134,"15.6":0.05359,"16.0":0.00447,"16.1":0.03573,"16.2":0.0134,"16.3":0.07146,"16.4":0.01786,"16.5":0.05806,"16.6":0.26796,"17.0":0.02233,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.05251,"6.0-6.1":0.00194,"7.0-7.1":0.12642,"8.1-8.4":0.00972,"9.0-9.2":0.00194,"9.3":0.04862,"10.0-10.2":0,"10.3":0.08752,"11.0-11.2":0.05251,"11.3-11.4":0.00583,"12.0-12.1":0.02528,"12.2-12.5":0.5932,"13.0-13.1":0.00778,"13.2":0.00778,"13.3":2.43893,"13.4-13.7":0.04084,"14.0-14.4":0.14587,"14.5-14.8":0.33064,"15.0-15.1":0.11281,"15.2-15.3":0.0953,"15.4":0.09336,"15.5":0.17504,"15.6-15.7":1.69014,"16.0":0.66322,"16.1":0.8791,"16.2":0.45122,"16.3":0.93551,"16.4":0.22367,"16.5":0.57959,"16.6":7.68827,"17.0":1.66485,"17.1":0.00389},P:{"4":0.65757,"20":0.06263,"21":0.10438,"22":1.32557,"5.0-5.4":0.03131,"6.2-6.4":0.02088,"7.2-7.4":0.07306,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02088,"12.0":0,"13.0":0.03131,"14.0":0,"15.0":0.01044,"16.0":0.02088,"17.0":0.03131,"18.0":0.02088,"19.0":0.05219},I:{"0":0,"3":0,"4":0.05018,"2.1":0,"2.2":0.02007,"2.3":0.04014,"4.1":0.04014,"4.2-4.3":0.13046,"4.4":0,"4.4.3-4.4.4":0.66232},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00502,"8":0.0201,"9":0.00502,"10":0.0201,"11":0.03015,"5.5":0},S:{"2.5":0.04427,_:"3.0-3.1"},J:{"7":0,"10":0.00553},N:{"10":0.01107,"11":0},L:{"0":55.79191},R:{_:"0"},M:{"0":0.11621},Q:{"13.1":0},O:{"0":0.04981},H:{"0":0.36675}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GF.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GF.js
index f8445ceef59876..9e4b420dd066c3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GF.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GF.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00389,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01168,"89":0,"90":0,"91":0.00389,"92":0,"93":0,"94":0,"95":0,"96":0.00779,"97":0.00389,"98":0,"99":0,"100":0,"101":0,"102":0.04672,"103":0.00389,"104":0,"105":0,"106":0.00389,"107":0,"108":0,"109":0.00389,"110":0,"111":0,"112":0.01168,"113":0.00389,"114":0.01557,"115":0.42823,"116":1.56888,"117":0.03504,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00389,"48":0,"49":0.00389,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00389,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00389,"70":0,"71":0.00389,"72":0,"73":0,"74":0.00389,"75":0,"76":0.01557,"77":0,"78":0,"79":0.31144,"80":0,"81":0.00389,"83":0.00779,"84":0.00779,"85":0,"86":0,"87":0.00389,"88":0,"89":0.00389,"90":0,"91":0,"92":0,"93":0,"94":0.00389,"95":0,"96":0,"97":0,"98":0,"99":0.05061,"100":0,"101":0,"102":0.00389,"103":0.03504,"104":0,"105":0.00779,"106":0,"107":0.00389,"108":0.00389,"109":0.28808,"110":0,"111":0.00779,"112":0.00779,"113":0.03504,"114":0.18297,"115":4.44581,"116":2.49931,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00389,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01947,"93":0,"94":0,"95":0.00389,"96":0,"97":0,"98":0,"99":0.00389,"100":0.17908,"101":0.09733,"102":0.00779,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00389,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.00389,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00389,"93":0,"94":0,"95":0.00389,"96":0,"97":0,"98":0,"99":0.00389,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00779,"108":0,"109":0.01168,"110":0,"111":0,"112":0.00389,"113":0.00389,"114":0.1129,"115":1.68178,"116":0.79028},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01947,"15":0.00389,"17":0.00389,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00389,"13.1":0.04282,"14.1":0.07397,"15.1":0.00389,"15.2-15.3":0.00779,"15.4":0.00779,"15.5":0.17908,"15.6":0.08954,"16.0":0.00779,"16.1":0.04282,"16.2":0.00779,"16.3":0.05061,"16.4":0.01557,"16.5":0.29976,"16.6":0.3893},G:{"8":0,"17":0.13914,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00224,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.10548,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.01571,"12.0-12.1":0,"12.2-12.5":0.27604,"13.0-13.1":0.00449,"13.2":0.00898,"13.3":0.06284,"13.4-13.7":0.06957,"14.0-14.4":0.81464,"14.5-14.8":0.24911,"15.0-15.1":0.14587,"15.2-15.3":0.32316,"15.4":0.17954,"15.5":0.23564,"15.6-15.7":1.33979,"16.0":1.38242,"16.1":1.11312,"16.2":0.94032,"16.3":1.645,"16.4":0.30297,"16.5":4.68813,"16.6":8.38432},P:{"4":0.1328,"20":0.21452,"21":0.42904,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.07151,"8.2":0,"9.2":0.01022,"10.1":0,"11.1-11.2":0.19409,"12.0":0,"13.0":0.03065,"14.0":0.02043,"15.0":0.01022,"16.0":0.10215,"17.0":0.04086,"18.0":0.05108,"19.0":0.14301},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.0745},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00389,"5.5":0},S:{"2.5":0.00611,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":55.16964},R:{_:"0"},M:{"0":0.33589},Q:{"13.1":0.00611},O:{"0":0.01221},H:{"0":0.09251}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00394,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00788,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00788,"88":0.00788,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.01182,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.05123,"103":0.00394,"104":0,"105":0,"106":0.00788,"107":0,"108":0.00394,"109":0.00394,"110":0.00394,"111":0.00394,"112":0.01182,"113":0.01182,"114":0.01182,"115":0.20493,"116":0.14976,"117":1.38329,"118":0.18129,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00394,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00394,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00394,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00394,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.01971,"77":0,"78":0,"79":0.00394,"80":0,"81":0.00394,"83":0.00788,"84":0,"85":0,"86":0.00394,"87":0,"88":0,"89":0.00788,"90":0.00394,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00394,"98":0,"99":0.03153,"100":0,"101":0,"102":0,"103":0.02365,"104":0,"105":0.00788,"106":0.00394,"107":0,"108":0.02759,"109":0.34681,"110":0.00394,"111":0.01576,"112":0.03547,"113":0.02759,"114":0.07882,"115":0.09458,"116":4.92231,"117":1.26506,"118":0.00394,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00394,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.03153,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01971,"73":0,"74":0,"75":0,"76":0,"77":0.00394,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00788,"93":0,"94":0,"95":0.00394,"96":0,"97":0,"98":0,"99":0,"100":0.16946,"101":0.08276,"102":0.21676,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.01576,"16":0,"17":0,"18":0.02759,"79":0,"80":0.01971,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00788,"100":0,"101":0,"102":0.00394,"103":0,"104":0,"105":0.00394,"106":0,"107":0,"108":0,"109":0.01182,"110":0.00394,"111":0,"112":0.00394,"113":0.00788,"114":0.06306,"115":0.04335,"116":1.59611,"117":1.59611},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01971,"14":0.04335,"15":0.00788,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00394,"13.1":0.04335,"14.1":0.14188,"15.1":0.01971,"15.2-15.3":0.00788,"15.4":0.00788,"15.5":0.04335,"15.6":0.09853,"16.0":0.01971,"16.1":0.06306,"16.2":0.03547,"16.3":0.11035,"16.4":0.05123,"16.5":0.16158,"16.6":0.61874,"17.0":0.02759,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0183,"10.0-10.2":0,"10.3":0.02092,"11.0-11.2":0.00523,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.12811,"13.0-13.1":0,"13.2":0,"13.3":0.0183,"13.4-13.7":0.06536,"14.0-14.4":0.47322,"14.5-14.8":0.95429,"15.0-15.1":0.05229,"15.2-15.3":0.07582,"15.4":0.17517,"15.5":0.1438,"15.6-15.7":1.67066,"16.0":1.47196,"16.1":1.01704,"16.2":1.05625,"16.3":1.21051,"16.4":0.17779,"16.5":1.16868,"16.6":13.95352,"17.0":2.03407,"17.1":0},P:{"4":0.04088,"20":0.12265,"21":0.21464,"22":3.31157,"5.0-5.4":0.01022,"6.2-6.4":0,"7.2-7.4":0.10221,"8.2":0,"9.2":0.01022,"10.1":0,"11.1-11.2":0.02044,"12.0":0,"13.0":0.02044,"14.0":0.02044,"15.0":0.01022,"16.0":0.03066,"17.0":0.03066,"18.0":0.04088,"19.0":0.21464},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.06547},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00394,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":52.67643},R:{_:"0"},M:{"0":0.53925},Q:{"13.1":0},O:{"0":0.01212},H:{"0":0.08604}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GG.js
index 78ef44420f4a8b..71beffd0fa0cfe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00448,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.04033,"103":0.00896,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00448,"113":0,"114":0.01792,"115":0.17924,"116":0.66319,"117":0.00448,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00448,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00448,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00448,"77":0,"78":0,"79":0.00448,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00896,"100":0.00448,"101":0,"102":0,"103":0.05377,"104":0,"105":0.00448,"106":0,"107":0,"108":0.00448,"109":0.45258,"110":0.00448,"111":0.00896,"112":0.03137,"113":0.02241,"114":0.5422,"115":4.18077,"116":1.77,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01792,"73":0,"74":0.00448,"75":0,"76":0,"77":0.01792,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00448,"100":0.10306,"101":0.13891,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00896,"110":0,"111":0,"112":0.01344,"113":0.00448,"114":0.24646,"115":2.58554,"116":0.60494},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00448,"14":0.03585,"15":0.01344,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.01792,"12.1":0.00448,"13.1":0.10754,"14.1":0.15235,"15.1":0.03585,"15.2-15.3":0.00896,"15.4":0.07618,"15.5":0.07618,"15.6":0.58701,"16.0":0.68559,"16.1":0.05377,"16.2":0.17028,"16.3":0.20613,"16.4":0.02241,"16.5":1.55491,"16.6":3.05156},G:{"8":0.03995,"17":0.09487,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00999,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.18475,"10.0-10.2":0,"10.3":0.4494,"11.0-11.2":0.00999,"11.3-11.4":0.01498,"12.0-12.1":0.00499,"12.2-12.5":1.36319,"13.0-13.1":0,"13.2":0,"13.3":0.03995,"13.4-13.7":0.00999,"14.0-14.4":0.05493,"14.5-14.8":0.28462,"15.0-15.1":0.04494,"15.2-15.3":0.04993,"15.4":0.27963,"15.5":0.2247,"15.6-15.7":4.62385,"16.0":1.11851,"16.1":2.46672,"16.2":1.24335,"16.3":3.42545,"16.4":0.55926,"16.5":9.13286,"16.6":24.17287},P:{"4":0.03267,"20":0.01089,"21":0.31578,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0.01089,"19.0":0.01089},I:{"0":0,"3":0,"4":0.10393,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.26559},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01344,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":23.22767},R:{_:"0"},M:{"0":0.77818},Q:{"13.1":0},O:{"0":0},H:{"0":0.17243}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00489,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.04887,"103":0.00977,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.01466,"115":0.01955,"116":0.0391,"117":0.81124,"118":0.04398,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.12218,"77":0.02932,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.00489,"87":0.00489,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.04887,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00977,"100":0,"101":0,"102":0,"103":0.02932,"104":0,"105":0,"106":0.02444,"107":0.00489,"108":0,"109":1.03604,"110":0,"111":0.00489,"112":0.02932,"113":0.00977,"114":0.30299,"115":0.37141,"116":6.94931,"117":2.47282,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00977,"73":0,"74":0,"75":0,"76":0,"77":0.00489,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02444,"96":0,"97":0,"98":0,"99":0,"100":0.0391,"101":0.04398,"102":0.10751,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01466,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01466,"110":0,"111":0,"112":0,"113":0,"114":0.02444,"115":0.10263,"116":1.65669,"117":1.60294},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00489,"14":0.05864,"15":0.00489,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.01466,"12.1":0,"13.1":0.1515,"14.1":0.16616,"15.1":0.00489,"15.2-15.3":0.00977,"15.4":0.08797,"15.5":0.07819,"15.6":0.55223,"16.0":0.55712,"16.1":0.04398,"16.2":0.15638,"16.3":0.16127,"16.4":0.04887,"16.5":0.27367,"16.6":3.81186,"17.0":0.10751,"17.1":0},G:{"8":0.02539,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01523,"7.0-7.1":0.01523,"8.1-8.4":0,"9.0-9.2":0.03046,"9.3":0.18278,"10.0-10.2":0,"10.3":0.45694,"11.0-11.2":0.01523,"11.3-11.4":0.02539,"12.0-12.1":0,"12.2-12.5":1.09158,"13.0-13.1":0,"13.2":0,"13.3":0.03554,"13.4-13.7":0.00508,"14.0-14.4":0.03046,"14.5-14.8":0.3097,"15.0-15.1":0.03046,"15.2-15.3":0.13708,"15.4":0.15739,"15.5":0.22847,"15.6-15.7":3.56414,"16.0":0.8885,"16.1":2.49794,"16.2":1.12204,"16.3":2.58933,"16.4":0.47725,"16.5":0.80726,"16.6":32.78297,"17.0":2.61472,"17.1":0},P:{"4":0.02129,"20":0.01065,"21":0.19165,"22":4.30147,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.01065,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.06388,"14.0":0.01065,"15.0":0,"16.0":0,"17.0":0.01065,"18.0":0.02129,"19.0":0.01065},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.32277},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04398,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":18.82108},R:{_:"0"},M:{"0":0.74139},Q:{"13.1":0},O:{"0":0.02045},H:{"0":0.02904}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GH.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GH.js
index c29969541a123e..27e960c227ea28 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GH.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GH.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00241,"69":0,"70":0,"71":0,"72":0.00241,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00482,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00241,"109":0.00241,"110":0.00241,"111":0.00241,"112":0.00241,"113":0.00963,"114":0.00963,"115":0.12522,"116":0.21913,"117":0.02167,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00241,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00241,"50":0.00241,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00241,"64":0.00241,"65":0.00241,"66":0,"67":0,"68":0.00241,"69":0.00241,"70":0.00482,"71":0,"72":0.00241,"73":0.00241,"74":0.00482,"75":0.00482,"76":0.00482,"77":0.00482,"78":0.00241,"79":0.01686,"80":0.00482,"81":0.01204,"83":0.00241,"84":0.00241,"85":0.00241,"86":0.00241,"87":0.00482,"88":0.00482,"89":0.00241,"90":0.00241,"91":0.00482,"92":0.00241,"93":0.00963,"94":0.00241,"95":0.00963,"96":0.00241,"97":0.00241,"98":0.00241,"99":0.00482,"100":0.00241,"101":0.00482,"102":0.00722,"103":0.02649,"104":0.00241,"105":0.00963,"106":0.00963,"107":0.00722,"108":0.00963,"109":0.49846,"110":0.00482,"111":0.00963,"112":0.01204,"113":0.01926,"114":0.14207,"115":1.40146,"116":0.71277,"117":0.00241,"118":0.00241,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00482,"25":0,"26":0.00241,"27":0.00722,"28":0.00482,"29":0,"30":0.00241,"31":0.00241,"32":0.00241,"33":0.00241,"34":0,"35":0,"36":0,"37":0.00241,"38":0,"39":0,"40":0,"41":0,"42":0.00482,"43":0,"44":0,"45":0,"46":0.00241,"47":0.00241,"48":0,"49":0,"50":0.00241,"51":0.00241,"52":0,"53":0,"54":0.00482,"55":0.00241,"56":0,"57":0.00241,"58":0.01204,"60":0.07946,"62":0,"63":0.08428,"64":0.02167,"65":0.01204,"66":0.06983,"67":0.08187,"68":0.04575,"69":0.39491,"70":0.27692,"71":0.76815,"72":0.35398,"73":0.00241,"74":0.00482,"75":0.00241,"76":0.01204,"77":0.00482,"78":0,"79":0.00722,"80":0,"81":0,"82":0,"83":0.00241,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02649,"96":0,"97":0,"98":0,"99":0.01686,"100":0.07946,"101":0.15652,"102":0.00482,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00482},B:{"12":0.00241,"13":0.00241,"14":0,"15":0.00722,"16":0.00241,"17":0.00241,"18":0.01204,"79":0,"80":0,"81":0,"83":0,"84":0.00241,"85":0,"86":0,"87":0,"88":0,"89":0.00482,"90":0.00482,"91":0,"92":0.01445,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00241,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00241,"108":0.00241,"109":0.00722,"110":0.00241,"111":0.00241,"112":0.00482,"113":0.00482,"114":0.03853,"115":0.37083,"116":0.09391},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00241,"12":0,"13":0,"14":0.00482,"15":0,"17":0.00241,_:"0","3.1":0,"3.2":0,"5.1":0.00241,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00241,"12.1":0.00241,"13.1":0.01204,"14.1":0.00963,"15.1":0.00241,"15.2-15.3":0,"15.4":0.00241,"15.5":0.00241,"15.6":0.02649,"16.0":0.00241,"16.1":0.00482,"16.2":0.00241,"16.3":0.01204,"16.4":0.00482,"16.5":0.03853,"16.6":0.02167},G:{"8":0.02267,"17":0.18623,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00324,"6.0-6.1":0,"7.0-7.1":0.01295,"8.1-8.4":0.00486,"9.0-9.2":0,"9.3":0.09716,"10.0-10.2":0.00162,"10.3":0.15222,"11.0-11.2":0.09068,"11.3-11.4":0.02591,"12.0-12.1":0.11174,"12.2-12.5":1.04935,"13.0-13.1":0.04048,"13.2":0.01457,"13.3":0.05182,"13.4-13.7":0.09716,"14.0-14.4":0.66232,"14.5-14.8":0.57973,"15.0-15.1":1.18699,"15.2-15.3":0.36598,"15.4":0.25748,"15.5":0.39512,"15.6-15.7":3.08974,"16.0":0.67527,"16.1":0.68985,"16.2":0.41941,"16.3":0.79025,"16.4":0.75138,"16.5":2.21367,"16.6":2.14889},P:{"4":0.19717,"20":0.10377,"21":0.21792,"5.0-5.4":0.02075,"6.2-6.4":0,"7.2-7.4":0.11415,"8.2":0,"9.2":0.06226,"10.1":0,"11.1-11.2":0.04151,"12.0":0.02075,"13.0":0.02075,"14.0":0.02075,"15.0":0.01038,"16.0":0.07264,"17.0":0.02075,"18.0":0.03113,"19.0":0.1349},I:{"0":0,"3":0,"4":0.00364,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00273,"4.2-4.3":0.01365,"4.4":0,"4.4.3-4.4.4":0.11647},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00482,"9":0,"10":0.00241,"11":0.00482,"5.5":0},S:{"2.5":0.01518,_:"3.0-3.1"},J:{"7":0,"10":0.01518},N:{"10":0,"11":0},L:{"0":58.93819},R:{_:"0"},M:{"0":0.22776},Q:{"13.1":0.01518},O:{"0":0.98696},H:{"0":12.24051}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00245,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00245,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00245,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00245,"98":0,"99":0,"100":0,"101":0,"102":0.00245,"103":0,"104":0.00245,"105":0,"106":0.00245,"107":0,"108":0,"109":0,"110":0.00245,"111":0.00245,"112":0.00245,"113":0.00735,"114":0.0049,"115":0.05633,"116":0.03674,"117":0.2547,"118":0.03184,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00245,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00245,"44":0,"45":0,"46":0,"47":0,"48":0.00245,"49":0.0049,"50":0.00245,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00245,"64":0.00245,"65":0.00245,"66":0,"67":0,"68":0.00245,"69":0.00245,"70":0.0049,"71":0,"72":0.00245,"73":0.0049,"74":0.0049,"75":0.0049,"76":0.0049,"77":0.0049,"78":0,"79":0.0098,"80":0.00245,"81":0.0098,"83":0.00245,"84":0.00245,"85":0.0049,"86":0.0049,"87":0.0049,"88":0.0049,"89":0.00245,"90":0.00245,"91":0.0049,"92":0.0049,"93":0.0098,"94":0.00245,"95":0.00735,"96":0.00245,"97":0.00245,"98":0.0049,"99":0.0049,"100":0.00245,"101":0.00245,"102":0.0098,"103":0.02204,"104":0.0049,"105":0.00735,"106":0.01225,"107":0.00735,"108":0.01225,"109":0.4947,"110":0.00245,"111":0.00735,"112":0.0098,"113":0.01469,"114":0.04898,"115":0.06857,"116":1.80246,"117":0.43347,"118":0.0049,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.0049,"25":0,"26":0.00245,"27":0.00735,"28":0.0049,"29":0,"30":0.00245,"31":0.00245,"32":0.00245,"33":0.00245,"34":0,"35":0,"36":0,"37":0.00245,"38":0.00245,"39":0,"40":0,"41":0,"42":0.0049,"43":0,"44":0,"45":0,"46":0.00245,"47":0,"48":0,"49":0,"50":0.00245,"51":0.00245,"52":0,"53":0,"54":0.00735,"55":0.00245,"56":0.00245,"57":0.00245,"58":0.01225,"60":0.07837,"62":0.0049,"63":0.08082,"64":0.01959,"65":0.01225,"66":0.05878,"67":0.07347,"68":0.03918,"69":0.29878,"70":0.17633,"71":0.43592,"72":0.81552,"73":0.12245,"74":0.0049,"75":0.00245,"76":0.0049,"77":0.03918,"78":0.00245,"79":0.00735,"80":0,"81":0,"82":0,"83":0.00245,"84":0,"85":0.00245,"86":0.00245,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02204,"96":0,"97":0,"98":0,"99":0.0098,"100":0.0098,"101":0.11755,"102":0.10776,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.0049},B:{"12":0.00245,"13":0.00245,"14":0.00245,"15":0.0049,"16":0.00245,"17":0.00245,"18":0.01225,"79":0,"80":0,"81":0,"83":0,"84":0.0049,"85":0,"86":0,"87":0,"88":0,"89":0.00735,"90":0.0049,"91":0,"92":0.01959,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00245,"101":0,"102":0,"103":0,"104":0,"105":0.00245,"106":0,"107":0,"108":0.00245,"109":0.01225,"110":0.00245,"111":0.00245,"112":0.0049,"113":0.00245,"114":0.01714,"115":0.02939,"116":0.28653,"117":0.16408},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00245,"12":0,"13":0.00245,"14":0.00245,"15":0.00245,_:"0","3.1":0,"3.2":0,"5.1":0.00245,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00245,"12.1":0.00245,"13.1":0.01225,"14.1":0.00735,"15.1":0.00245,"15.2-15.3":0,"15.4":0.00245,"15.5":0.00245,"15.6":0.01714,"16.0":0.00245,"16.1":0.0098,"16.2":0.00245,"16.3":0.01469,"16.4":0.00245,"16.5":0.01469,"16.6":0.03184,"17.0":0.0049,"17.1":0},G:{"8":0.01716,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00156,"6.0-6.1":0,"7.0-7.1":0.01404,"8.1-8.4":0.00312,"9.0-9.2":0,"9.3":0.06552,"10.0-10.2":0,"10.3":0.12167,"11.0-11.2":0.08736,"11.3-11.4":0.03744,"12.0-12.1":0.10139,"12.2-12.5":1.12782,"13.0-13.1":0.03588,"13.2":0.0234,"13.3":0.04368,"13.4-13.7":0.08268,"14.0-14.4":0.57405,"14.5-14.8":0.48981,"15.0-15.1":1.1559,"15.2-15.3":0.3385,"15.4":0.26051,"15.5":0.37126,"15.6-15.7":3.04808,"16.0":0.52569,"16.1":0.58809,"16.2":0.3619,"16.3":0.69572,"16.4":0.51477,"16.5":1.10286,"16.6":2.78133,"17.0":0.93595,"17.1":0},P:{"4":0.16481,"20":0.07211,"21":0.18541,"22":0.75196,"5.0-5.4":0.0206,"6.2-6.4":0,"7.2-7.4":0.11331,"8.2":0,"9.2":0.08241,"10.1":0,"11.1-11.2":0.0515,"12.0":0.0206,"13.0":0.0206,"14.0":0.0206,"15.0":0.0206,"16.0":0.0618,"17.0":0.0309,"18.0":0.0309,"19.0":0.13391},I:{"0":0,"3":0,"4":0.0008,"2.1":0,"2.2":0,"2.3":0.00321,"4.1":0.00321,"4.2-4.3":0.01847,"4.4":0,"4.4.3-4.4.4":0.12124},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0049,"9":0,"10":0.00245,"11":0.0049,"5.5":0},S:{"2.5":0.0151,_:"3.0-3.1"},J:{"7":0,"10":0.0151},N:{"10":0,"11":0},L:{"0":59.74773},R:{_:"0"},M:{"0":0.25673},Q:{"13.1":0.0151},O:{"0":1.01939},H:{"0":11.95279}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GI.js
index 096c0e8d1d8aee..4663acc469389f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.03007,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01504,"103":0,"104":0,"105":0.00501,"106":0.00501,"107":0,"108":0.1654,"109":0,"110":0,"111":0,"112":0.01002,"113":0,"114":0.00501,"115":0.15036,"116":0.70168,"117":0.01002,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.03007,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.01504,"77":0,"78":0,"79":0.00501,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00501,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.29571,"104":0.01002,"105":0.02506,"106":0,"107":0.07017,"108":0.00501,"109":0.51624,"110":0.01002,"111":0.34583,"112":0.17041,"113":0.20048,"114":0.47614,"115":7.38268,"116":5.27764,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.55132,"101":0.10525,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00501,"110":0.19046,"111":0.00501,"112":0,"113":0,"114":0.09022,"115":2.37569,"116":1.10765},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.02506,"14":0.06516,"15":0,"17":0.01002,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00501,"12.1":0.01504,"13.1":0.03007,"14.1":0.10525,"15.1":0.01002,"15.2-15.3":0.00501,"15.4":0.01504,"15.5":0.04511,"15.6":0.39094,"16.0":0.02005,"16.1":0.20549,"16.2":0.10525,"16.3":0.1253,"16.4":0.08019,"16.5":1.01744,"16.6":1.2129},G:{"8":0,"17":0.1044,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.058,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04253,"10.0-10.2":0.00773,"10.3":0.1044,"11.0-11.2":0.00387,"11.3-11.4":0.01547,"12.0-12.1":0.0232,"12.2-12.5":0.95123,"13.0-13.1":0.06187,"13.2":0,"13.3":0.01547,"13.4-13.7":0.0116,"14.0-14.4":0.22814,"14.5-14.8":0.60709,"15.0-15.1":0.14694,"15.2-15.3":0.14307,"15.4":0.15467,"15.5":0.1392,"15.6-15.7":3.12438,"16.0":1.50805,"16.1":2.43222,"16.2":1.0247,"16.3":2.14994,"16.4":0.40988,"16.5":7.70268,"16.6":17.48956},P:{"4":0.14753,"20":0.02108,"21":0.15807,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01054,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01054,"18.0":0,"19.0":0.03161},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.21048},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01002,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.00499,"11":0},L:{"0":33.1101},R:{_:"0"},M:{"0":0.23942},Q:{"13.1":0},O:{"0":0.00998},H:{"0":0.09917}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01639,"53":0.00546,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00546,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00546,"103":0,"104":0,"105":0.03825,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01093,"116":0.03825,"117":0.75403,"118":0.12021,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.02186,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.01639,"88":0,"89":0.03278,"90":0,"91":0.04371,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.17485,"104":0.00546,"105":0.02186,"106":0.05464,"107":0.25134,"108":0.25681,"109":0.69939,"110":0.02186,"111":0.14206,"112":0.08742,"113":0.26774,"114":0.49176,"115":0.20217,"116":11.8077,"117":4.4477,"118":0.00546,"119":0.00546,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00546,"73":0,"74":0,"75":0,"76":0,"77":0.00546,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00546,"96":0,"97":0,"98":0,"99":0,"100":0.01639,"101":0.08742,"102":0.39341,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.01639,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.06557,"111":0,"112":0,"113":0,"114":0.02186,"115":0.0601,"116":2.10364,"117":2.5954},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.03278,"14":0.02186,"15":0.00546,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00546,"13.1":0.08196,"14.1":0.16938,"15.1":0.00546,"15.2-15.3":0.03278,"15.4":0.03278,"15.5":0.10382,"15.6":0.22402,"16.0":0.01093,"16.1":0.07103,"16.2":0.1366,"16.3":0.30598,"16.4":0.10928,"16.5":0.21856,"16.6":1.75941,"17.0":0.05464,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01487,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05575,"10.0-10.2":0,"10.3":0.10406,"11.0-11.2":0.01115,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.498,"13.0-13.1":0.05946,"13.2":0,"13.3":0.01115,"13.4-13.7":0.04088,"14.0-14.4":0.13379,"14.5-14.8":0.39022,"15.0-15.1":0.14122,"15.2-15.3":0.36049,"15.4":0.24528,"15.5":0.2044,"15.6-15.7":2.87277,"16.0":1.0666,"16.1":2.04401,"16.2":0.84362,"16.3":2.57546,"16.4":0.56489,"16.5":1.19296,"16.6":21.59966,"17.0":1.38621,"17.1":0},P:{"4":0.05099,"20":0.06119,"21":0.0204,"22":2.529,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.0102,"14.0":0,"15.0":0,"16.0":0.0102,"17.0":0.0102,"18.0":0.0102,"19.0":0.05099},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.2832},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00907},N:{"10":0,"11":0},L:{"0":29.59783},R:{_:"0"},M:{"0":0.08165},Q:{"13.1":0.00454},O:{"0":0.01814},H:{"0":0.06442}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GL.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GL.js
index 28f8757a6514dd..d1e8a12c0a4ff1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GL.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GL.js
@@ -1 +1 @@
-module.exports={C:{"2":0.03895,"3":0.03895,"4":0.03408,"5":0.03408,"6":0.01948,"7":0,"8":0.00487,"9":0.01948,"10":0,"11":0.00974,"12":0.01461,"13":0.00974,"14":0.01461,"15":0.00974,"16":0.00974,"17":0.02435,"18":0.01461,"19":0.00974,"20":0.00487,"21":0.01948,"22":0.00487,"23":0.00487,"24":0.00487,"25":0.01461,"26":0.00974,"27":0.00974,"28":0.01461,"29":0.02435,"30":0.01461,"31":0.01948,"32":0.01948,"33":0.00487,"34":0.01948,"35":0.02921,"36":0.01948,"37":0.01948,"38":0.0633,"39":0.04869,"40":0.09251,"41":0.04382,"42":0.01461,"43":0.01461,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00974,"54":0,"55":0,"56":0.00487,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02435,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00487,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00487,"109":0,"110":0,"111":0,"112":0,"113":0.00974,"114":0.00487,"115":0.18015,"116":0.65732,"117":0.02921,"118":0,"119":0,"120":0,"3.5":0.01948,"3.6":0.12173},D:{"4":0.00487,"5":0.00487,"6":0.01948,"7":0.02435,"8":0.00487,"9":0.01461,"10":0.00974,"11":0.02435,"12":0.00974,"13":0.00487,"14":0.00487,"15":0.01461,"16":0,"17":0.01461,"18":0.00974,"19":0.02921,"20":0.01461,"21":0.02435,"22":0.01461,"23":0.01461,"24":0.00487,"25":0.00487,"26":0.01461,"27":0.01461,"28":0.02921,"29":0.01461,"30":0.02435,"31":0.05843,"32":0.01461,"33":0.02921,"34":0.00487,"35":0.01461,"36":0.03408,"37":0.04869,"38":0.04382,"39":0.07304,"40":0.06817,"41":0.09251,"42":0.0779,"43":0.1412,"44":0.21911,"45":0.20937,"46":0.13633,"47":0.12659,"48":0,"49":0.00487,"50":0,"51":0.16555,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.05356,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00487,"80":0.00487,"81":0,"83":0,"84":0,"85":0.00487,"86":0.0779,"87":0,"88":0.00487,"89":0,"90":0.00487,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00974,"97":0.00487,"98":0.00487,"99":0,"100":0,"101":0,"102":0.00974,"103":0.00974,"104":0,"105":0.00487,"106":0.02435,"107":0.00487,"108":0.00487,"109":0.46256,"110":0.01461,"111":0.02435,"112":0.01461,"113":0.07304,"114":0.31649,"115":3.55437,"116":5.20009,"117":0,"118":0,"119":0},F:{"9":0.00487,"11":0.01461,"12":0.00974,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0.00487,"21":0,"22":0,"23":0.00974,"24":0.00974,"25":0.01461,"26":0.00974,"27":0.00487,"28":0,"29":0.01948,"30":0.05843,"31":0.04869,"32":0.03895,"33":0.01461,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00487,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.01461,"100":0.18989,"101":0.13633,"102":0,"9.5-9.6":0.01461,"10.0-10.1":0.00974,"10.5":0,"10.6":0,"11.1":0.00487,"11.5":0.00487,"11.6":0.00487,"12.1":0.03408},B:{"12":0.0779,"13":0.00487,"14":0.10712,"15":0,"16":0,"17":0.00487,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00487,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00487,"106":0,"107":0.02921,"108":0.00487,"109":0.01948,"110":0.00487,"111":0.00487,"112":0,"113":0.00974,"114":0.07304,"115":1.6019,"116":0.39926},E:{"4":0.01948,"5":0.02921,"6":0.00487,"7":0.00974,"8":0.02435,"9":0.24832,"10":0,"11":0,"12":0,"13":0.00487,"14":0.18015,"15":0.00487,"17":0.00974,_:"0","3.1":0.00487,"3.2":0,"5.1":0.01461,"6.1":0.00487,"7.1":0.01461,"9.1":0.00487,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00974,"14.1":0.04869,"15.1":0.01948,"15.2-15.3":0.00974,"15.4":0.00974,"15.5":0.03408,"15.6":0.21911,"16.0":0.00974,"16.1":0.11199,"16.2":0.04382,"16.3":0.09738,"16.4":0.0779,"16.5":0.38465,"16.6":0.43334},G:{"8":0.06342,"17":0.13212,"3.2":0.00793,"4.0-4.1":0,"4.2-4.3":0.03964,"5.0-5.1":0.07927,"6.0-6.1":0.05813,"7.0-7.1":0.31708,"8.1-8.4":0.81913,"9.0-9.2":0.16118,"9.3":0.15854,"10.0-10.2":0.00793,"10.3":0.18497,"11.0-11.2":1.2974,"11.3-11.4":0.00264,"12.0-12.1":0.49941,"12.2-12.5":0.0872,"13.0-13.1":0,"13.2":0.02378,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.03964,"14.5-14.8":0.05549,"15.0-15.1":0.15061,"15.2-15.3":0.09512,"15.4":0.0185,"15.5":0.05813,"15.6-15.7":0.85877,"16.0":1.1917,"16.1":0.97239,"16.2":0.32765,"16.3":1.08865,"16.4":0.10569,"16.5":5.46968,"16.6":12.04122},P:{"4":0.39038,"20":0.03165,"21":0.07385,"5.0-5.4":0,"6.2-6.4":0.27432,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0.40093,"19.0":0.01055},I:{"0":0,"3":0.09891,"4":0.67794,"2.1":0.09273,"2.2":0.32146,"2.3":0.52134,"4.1":0.49043,"4.2-4.3":1.01589,"4.4":0,"4.4.3-4.4.4":2.3759},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.09424,"7":0.11408,"8":1.43838,"9":0.23808,"10":0.26784,"11":0.65471,"5.5":0},S:{"2.5":0.14367,_:"3.0-3.1"},J:{"7":0,"10":0.29247},N:{"10":0.38483,"11":0.25655},L:{"0":34.46331},R:{_:"0"},M:{"0":0.40535},Q:{"13.1":0.01026},O:{"0":0.67729},H:{"0":0.24288}};
+module.exports={C:{"2":0.03722,"3":0.05849,"4":0.02659,"5":0.03722,"6":0.02127,"7":0.01063,"8":0.00532,"9":0,"10":0.0319,"11":0.02127,"12":0.01063,"13":0.01595,"14":0.01063,"15":0.01595,"16":0.01063,"17":0.02127,"18":0.00532,"19":0.00532,"20":0.01595,"21":0.01595,"22":0.00532,"23":0.0319,"24":0.02127,"25":0.01063,"26":0.02127,"27":0.01063,"28":0.02127,"29":0.0319,"30":0.02127,"31":0.0319,"32":0.01063,"33":0.02127,"34":0.02127,"35":0.0319,"36":0.01063,"37":0.03722,"38":0.05317,"39":0.05849,"40":0.10634,"41":0.04785,"42":0.01063,"43":0.00532,"44":0.00532,"45":0,"46":0.00532,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00532,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02659,"79":0,"80":0,"81":0.00532,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00532,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00532,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.01595,"114":0,"115":0.02659,"116":0.09571,"117":0.86135,"118":0.06912,"119":0,"120":0,"3.5":0.0319,"3.6":0.12229},D:{"4":0.01595,"5":0,"6":0.01063,"7":0.01063,"8":0.01063,"9":0.00532,"10":0.01063,"11":0.02659,"12":0.02127,"13":0.01063,"14":0.00532,"15":0.00532,"16":0.00532,"17":0.01595,"18":0.02127,"19":0.01063,"20":0.01595,"21":0.07444,"22":0.01595,"23":0.01063,"24":0.01595,"25":0.00532,"26":0.01063,"27":0.01063,"28":0.0319,"29":0.01595,"30":0.02127,"31":0.03722,"32":0.01063,"33":0.04254,"34":0.02659,"35":0.02127,"36":0.0319,"37":0.04254,"38":0.05849,"39":0.07976,"40":0.04785,"41":0.14356,"42":0.10634,"43":0.17546,"44":0.34029,"45":0.20205,"46":0.1861,"47":0.14888,"48":0,"49":0,"50":0,"51":0.20205,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.05317,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0.00532,"84":0,"85":0,"86":0,"87":0.00532,"88":0.01063,"89":0,"90":0,"91":0.00532,"92":0.01063,"93":0,"94":0,"95":0.00532,"96":0.01063,"97":0,"98":0.00532,"99":0.00532,"100":0.00532,"101":0,"102":0,"103":0.04785,"104":0,"105":0,"106":0.01595,"107":0.01063,"108":0,"109":0.48385,"110":0.00532,"111":0.00532,"112":0.00532,"113":0.02127,"114":0.1861,"115":0.20736,"116":6.27406,"117":2.49367,"118":0.00532,"119":0.00532,"120":0},F:{"9":0,"11":0.02127,"12":0.01595,"15":0.00532,"16":0,"17":0,"18":0.00532,"19":0,"20":0.00532,"21":0,"22":0,"23":0,"24":0.01063,"25":0.01063,"26":0.00532,"27":0.02127,"28":0.01595,"29":0.01595,"30":0.05317,"31":0.07976,"32":0.05317,"33":0.01063,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00532,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00532,"96":0,"97":0,"98":0.00532,"99":0,"100":0.04785,"101":0.19673,"102":0.09571,"9.5-9.6":0.00532,"10.0-10.1":0.01063,"10.5":0,"10.6":0.00532,"11.1":0.00532,"11.5":0.01063,"11.6":0.00532,"12.1":0.0638},B:{"12":0.11166,"13":0.01595,"14":0.12229,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00532,"93":0.01063,"94":0,"95":0,"96":0,"97":0,"98":0.00532,"99":0,"100":0.00532,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00532,"107":0.01595,"108":0.00532,"109":0.01063,"110":0,"111":0.00532,"112":0,"113":0,"114":0.04785,"115":0.04785,"116":1.2814,"117":0.98896},E:{"4":0.02659,"5":0.02127,"6":0,"7":0.02127,"8":0.07444,"9":0.47321,"10":0,"11":0,"12":0,"13":0.01063,"14":0.04785,"15":0.00532,_:"0","3.1":0,"3.2":0,"5.1":0.0319,"6.1":0.00532,"7.1":0.0319,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.04785,"14.1":0.04254,"15.1":0,"15.2-15.3":0.01063,"15.4":0.01595,"15.5":0.09039,"15.6":0.1861,"16.0":0.00532,"16.1":0.04785,"16.2":0.05317,"16.3":0.12761,"16.4":0.01595,"16.5":0.60082,"16.6":1.5632,"17.0":0.02659,"17.1":0},G:{"8":0.06293,"3.2":0.03389,"4.0-4.1":0,"4.2-4.3":0.06293,"5.0-5.1":0.12345,"6.0-6.1":0.14039,"7.0-7.1":0.44054,"8.1-8.4":0.79152,"9.0-9.2":0.08472,"9.3":0.21301,"10.0-10.2":0,"10.3":0.22995,"11.0-11.2":2.10589,"11.3-11.4":0,"12.0-12.1":0.53494,"12.2-12.5":0.07504,"13.0-13.1":0,"13.2":0.0121,"13.3":0.00726,"13.4-13.7":0,"14.0-14.4":0.01936,"14.5-14.8":0.09682,"15.0-15.1":0.03873,"15.2-15.3":0.04599,"15.4":0.01936,"15.5":0.02663,"15.6-15.7":0.42844,"16.0":1.46686,"16.1":0.57125,"16.2":0.28321,"16.3":0.59062,"16.4":0.04115,"16.5":1.19092,"16.6":12.07133,"17.0":1.87109,"17.1":0},P:{"4":0.39682,"20":0.02145,"21":0.03217,"22":3.26034,"5.0-5.4":0,"6.2-6.4":0.24667,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.02145,"17.0":0.01072,"18.0":0.15015,"19.0":0},I:{"0":0,"3":0.0962,"4":0.92268,"2.1":0.11151,"2.2":0.36951,"2.3":0.52475,"4.1":0.60346,"4.2-4.3":1.10415,"4.4":0,"4.4.3-4.4.4":2.58656},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.11831,"7":0.1667,"8":1.50571,"9":0.29039,"10":0.26888,"11":0.84965,"5.5":0.01076},S:{"2.5":0.192,_:"3.0-3.1"},J:{"7":0,"10":0.22478},N:{"10":0.49701,"11":0.28037},L:{"0":32.73076},R:{_:"0"},M:{"0":0.38869},Q:{"13.1":0.00937},O:{"0":0.57601},H:{"0":0.30148}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GM.js
index 2830c49cd24875..02b49802355d61 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00568,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00379,"41":0,"42":0,"43":0.00189,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00189,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00189,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00189,"103":0,"104":0,"105":0,"106":0,"107":0.00189,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00189,"115":0.10033,"116":0.17037,"117":0.00568,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0.00189,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00189,"32":0,"33":0.00189,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00189,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00189,"47":0.00189,"48":0,"49":0.00568,"50":0.00189,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00189,"57":0.00189,"58":0.00189,"59":0,"60":0.00189,"61":0,"62":0.00189,"63":0.00189,"64":0.00568,"65":0.00189,"66":0.00379,"67":0.00189,"68":0.00189,"69":0.00189,"70":0.00568,"71":0,"72":0.00189,"73":0.00189,"74":0.00379,"75":0.00189,"76":0.00568,"77":0.00189,"78":0.00379,"79":0.00757,"80":0.00568,"81":0.01136,"83":0.00379,"84":0.00568,"85":0.00379,"86":0.00189,"87":0.00189,"88":0.00189,"89":0,"90":0.01136,"91":0,"92":0.00189,"93":0.00568,"94":0,"95":0.00189,"96":0,"97":0.00189,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00947,"104":0,"105":0.00189,"106":0.00757,"107":0,"108":0,"109":0.21391,"110":0.01136,"111":0.00189,"112":0.00189,"113":0.00379,"114":0.06436,"115":0.58304,"116":0.28963,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00189,"60":0.00379,"62":0,"63":0.00757,"64":0,"65":0,"66":0,"67":0.01136,"68":0.00189,"69":0.01893,"70":0.02082,"71":0.07004,"72":0.06626,"73":0,"74":0,"75":0,"76":0.00189,"77":0.00189,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00947,"96":0,"97":0,"98":0,"99":0,"100":0.01325,"101":0.0265,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00189,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00568,"13":0.00189,"14":0,"15":0.00189,"16":0,"17":0,"18":0.01136,"79":0,"80":0,"81":0,"83":0,"84":0.00189,"85":0,"86":0,"87":0,"88":0,"89":0.00189,"90":0,"91":0,"92":0.00189,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00379,"110":0.00379,"111":0,"112":0,"113":0,"114":0.00947,"115":0.27638,"116":0.08519},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00568,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00189,"6.1":0,"7.1":0,"9.1":0.00379,"10.1":0,"11.1":0,"12.1":0.00189,"13.1":0.00568,"14.1":0.02082,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.02461,"16.0":0,"16.1":0.00379,"16.2":0.00379,"16.3":0.01514,"16.4":0.00189,"16.5":0.01136,"16.6":0.03407},G:{"8":0,"17":0.04847,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02827,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.37361,"10.0-10.2":0,"10.3":0.48468,"11.0-11.2":0.02827,"11.3-11.4":0.02625,"12.0-12.1":0.2383,"12.2-12.5":2.51631,"13.0-13.1":0.04847,"13.2":0.00606,"13.3":0.13935,"13.4-13.7":0.26456,"14.0-14.4":0.70279,"14.5-14.8":0.66846,"15.0-15.1":0.29889,"15.2-15.3":0.22215,"15.4":0.41804,"15.5":1.03803,"15.6-15.7":4.28944,"16.0":0.54123,"16.1":0.725,"16.2":0.56344,"16.3":0.7351,"16.4":0.67452,"16.5":2.36081,"16.6":2.75057},P:{"4":0.26563,"20":0.15325,"21":0.27584,"5.0-5.4":0.02043,"6.2-6.4":0.03065,"7.2-7.4":0.15325,"8.2":0,"9.2":0.04087,"10.1":0,"11.1-11.2":0.01022,"12.0":0,"13.0":0.01022,"14.0":0.04087,"15.0":0,"16.0":0.05108,"17.0":0.02043,"18.0":0.01022,"19.0":0.05108},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00128,"4.2-4.3":0.00486,"4.4":0,"4.4.3-4.4.4":0.08958},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00189,"5.5":0},S:{"2.5":0.00811,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":72.5612},R:{_:"0"},M:{"0":0.02432},Q:{"13.1":0},O:{"0":0.4621},H:{"0":1.43526}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00164,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00164,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00164,"115":0.04765,"116":0.00657,"117":0.09365,"118":0.01479,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0.00164,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00164,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00164,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00329,"41":0.00164,"42":0,"43":0,"44":0,"45":0.00329,"46":0.00164,"47":0.00164,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00164,"57":0.00164,"58":0,"59":0.00164,"60":0.00164,"61":0,"62":0.00164,"63":0.00164,"64":0.00329,"65":0.00657,"66":0.00164,"67":0.00164,"68":0.0115,"69":0.00329,"70":0.01314,"71":0,"72":0,"73":0,"74":0.00164,"75":0.00164,"76":0.00164,"77":0,"78":0.00164,"79":0.00493,"80":0.00493,"81":0.0115,"83":0.00164,"84":0.00164,"85":0.00493,"86":0,"87":0.00164,"88":0,"89":0.00329,"90":0,"91":0,"92":0,"93":0.01479,"94":0,"95":0.00329,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00986,"104":0,"105":0,"106":0.01314,"107":0.00164,"108":0.00164,"109":0.1643,"110":0.00164,"111":0.00164,"112":0,"113":0.0115,"114":0.01479,"115":0.01643,"116":0.59477,"117":0.14787,"118":0.00164,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00164,"60":0.00164,"62":0,"63":0.00164,"64":0.00164,"65":0,"66":0,"67":0.00329,"68":0,"69":0.00986,"70":0.00822,"71":0.01479,"72":0.046,"73":0.01643,"74":0,"75":0,"76":0,"77":0.00164,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00164,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.01479,"102":0.0115,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00822,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00329,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00164,"110":0,"111":0,"112":0,"113":0,"114":0.00329,"115":0.00986,"116":0.1298,"117":0.09694},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00164,"15":0.00164,_:"0","3.1":0,"3.2":0,"5.1":0.00164,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00164,"14.1":0.02136,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.02136,"16.0":0.00164,"16.1":0.0115,"16.2":0,"16.3":0.00822,"16.4":0.00164,"16.5":0.00164,"16.6":0.01807,"17.0":0.00822,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02456,"6.0-6.1":0.11833,"7.0-7.1":0.11833,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.10493,"10.0-10.2":0,"10.3":0.36391,"11.0-11.2":0.02233,"11.3-11.4":0.0134,"12.0-12.1":0.84392,"12.2-12.5":3.19484,"13.0-13.1":0.21656,"13.2":0.01116,"13.3":0.10493,"13.4-13.7":0.27907,"14.0-14.4":0.99574,"14.5-14.8":1.13862,"15.0-15.1":0.25675,"15.2-15.3":0.17414,"15.4":0.43312,"15.5":1.04485,"15.6-15.7":5.42073,"16.0":0.23665,"16.1":0.48894,"16.2":0.58047,"16.3":0.71443,"16.4":0.35945,"16.5":0.86401,"16.6":3.56991,"17.0":0.45545,"17.1":0},P:{"4":0.37772,"20":0.06125,"21":0.15313,"22":0.56147,"5.0-5.4":0.02042,"6.2-6.4":0,"7.2-7.4":0.19396,"8.2":0,"9.2":0.02042,"10.1":0,"11.1-11.2":0.02042,"12.0":0,"13.0":0.02042,"14.0":0.04083,"15.0":0,"16.0":0.03063,"17.0":0.04083,"18.0":0.01021,"19.0":0.15313},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00119,"4.2-4.3":0.01228,"4.4":0,"4.4.3-4.4.4":0.1624},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0.00836,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":72.5624},R:{_:"0"},M:{"0":0.04179},Q:{"13.1":0},O:{"0":0.33428},H:{"0":0.76745}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GN.js
index d15c1876a06ce4..7ddd27d69fad29 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0.00111,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00444,"108":0,"109":0,"110":0.00111,"111":0,"112":0,"113":0,"114":0,"115":0.00776,"116":0.02994,"117":0.00333,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00111,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00665,"30":0,"31":0,"32":0,"33":0.00111,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00111,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00222,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00111,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00111,"73":0.00333,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00444,"83":0,"84":0,"85":0,"86":0,"87":0.00111,"88":0.00111,"89":0,"90":0.00111,"91":0,"92":0.00222,"93":0.00111,"94":0.00222,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00111,"103":0.00333,"104":0,"105":0,"106":0,"107":0,"108":0.00111,"109":0.02329,"110":0,"111":0.00111,"112":0.00111,"113":0.00111,"114":0.01109,"115":0.15415,"116":0.08761,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00222,"60":0.0122,"62":0,"63":0.00333,"64":0,"65":0.00111,"66":0.00222,"67":0.00444,"68":0,"69":0.0122,"70":0.00444,"71":0.02218,"72":0.00444,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00111,"100":0.00333,"101":0.01664,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00111},B:{"12":0.00222,"13":0,"14":0.00222,"15":0,"16":0,"17":0,"18":0.00222,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00111,"90":0,"91":0,"92":0.00111,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00222,"111":0,"112":0,"113":0.00111,"114":0.00333,"115":0.07098,"116":0.01553},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00111,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00111,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0.00111,"16.5":0.00111,"16.6":0.00111},G:{"8":0,"17":0.04493,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00281,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.1376,"10.0-10.2":0,"10.3":0.07021,"11.0-11.2":0.01404,"11.3-11.4":0.02668,"12.0-12.1":0.28363,"12.2-12.5":1.35077,"13.0-13.1":0.16288,"13.2":0.03651,"13.3":0.05897,"13.4-13.7":0.38894,"14.0-14.4":1.01659,"14.5-14.8":0.83545,"15.0-15.1":0.57709,"15.2-15.3":0.83405,"15.4":0.52655,"15.5":0.58271,"15.6-15.7":2.0767,"16.0":0.43387,"16.1":0.3749,"16.2":0.22466,"16.3":0.72734,"16.4":0.80456,"16.5":1.41816,"16.6":1.02501},P:{"4":0.20514,"20":0.16411,"21":0.30771,"5.0-5.4":0.02051,"6.2-6.4":0.01026,"7.2-7.4":0.29745,"8.2":0.03077,"9.2":0.0718,"10.1":0,"11.1-11.2":0.06154,"12.0":0,"13.0":0.03077,"14.0":0.12308,"15.0":0.04103,"16.0":0.72824,"17.0":0.03077,"18.0":0.17437,"19.0":0.65644},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00032,"4.2-4.3":0.00297,"4.4":0,"4.4.3-4.4.4":0.0178},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0.13337,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":73.2117},R:{_:"0"},M:{"0":0.04446},Q:{"13.1":0.01778},O:{"0":0.15115},H:{"0":6.64135}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00119,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.00119,"116":0.00357,"117":0.02616,"118":0.00238,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00119,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00119,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00119,"51":0,"52":0,"53":0,"54":0,"55":0.00119,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00119,"65":0,"66":0,"67":0,"68":0.00119,"69":0,"70":0,"71":0,"72":0.00119,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00832,"83":0,"84":0,"85":0,"86":0,"87":0.00357,"88":0,"89":0,"90":0.00119,"91":0,"92":0,"93":0.00238,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00119,"100":0,"101":0,"102":0,"103":0.00713,"104":0,"105":0.00238,"106":0,"107":0,"108":0,"109":0.03091,"110":0.00119,"111":0.00119,"112":0,"113":0,"114":0.00238,"115":0.00951,"116":0.14149,"117":0.05113,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00119,"60":0.00238,"62":0,"63":0.00476,"64":0,"65":0.00119,"66":0.00119,"67":0.00595,"68":0,"69":0.0107,"70":0.00238,"71":0.02021,"72":0.01784,"73":0.00238,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00595,"102":0.00713,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00119,"13":0,"14":0.00238,"15":0.00119,"16":0,"17":0,"18":0.00238,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00119,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00238,"111":0,"112":0,"113":0.00119,"114":0,"115":0.00476,"116":0.04518,"117":0.02259},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00119,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0.00238,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00164,"7.0-7.1":0.01641,"8.1-8.4":0,"9.0-9.2":0.02461,"9.3":0.03937,"10.0-10.2":0.01148,"10.3":0.09351,"11.0-11.2":0.03937,"11.3-11.4":0.01477,"12.0-12.1":0.27561,"12.2-12.5":1.44041,"13.0-13.1":0.13945,"13.2":0.01312,"13.3":0.04265,"13.4-13.7":0.47248,"14.0-14.4":1.54377,"14.5-14.8":0.63162,"15.0-15.1":0.57912,"15.2-15.3":0.5742,"15.4":0.17718,"15.5":0.79239,"15.6-15.7":3.17776,"16.0":0.54631,"16.1":0.6513,"16.2":0.39537,"16.3":0.77598,"16.4":0.64474,"16.5":1.18777,"16.6":1.85383,"17.0":0.1739,"17.1":0.00328},P:{"4":0.20435,"20":0.1737,"21":0.19413,"22":0.90936,"5.0-5.4":0.03065,"6.2-6.4":0.05109,"7.2-7.4":0.27587,"8.2":0.01022,"9.2":0.10218,"10.1":0.01022,"11.1-11.2":0.06131,"12.0":0,"13.0":0.03065,"14.0":0.11239,"15.0":0.04087,"16.0":0.57218,"17.0":0.03065,"18.0":0.10218,"19.0":0.48023},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00245,"4.4":0,"4.4.3-4.4.4":0.02419},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00238,"5.5":0},S:{"2.5":0.16741,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":76.65604},R:{_:"0"},M:{"0":0.03524},Q:{"13.1":0.01762},O:{"0":0.07049},H:{"0":1.96864}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GP.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GP.js
index 95baad42119697..6f8344269eab37 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GP.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GP.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00397,"53":0,"54":0.00397,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.01589,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00397,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01192,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00397,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00397,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.1033,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01589,"110":0.01192,"111":0.00795,"112":0.01192,"113":0.00397,"114":0.03178,"115":0.42511,"116":0.90187,"117":0.02384,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02384,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00397,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00397,"76":0,"77":0,"78":0,"79":0.01987,"80":0,"81":0.00397,"83":0,"84":0,"85":0.00397,"86":0,"87":0.01589,"88":0,"89":0,"90":0.00397,"91":0.00397,"92":0.00397,"93":0.00795,"94":0.00397,"95":0,"96":0,"97":0,"98":0.00795,"99":0,"100":0,"101":0.00397,"102":0.01589,"103":0.03576,"104":0.00397,"105":0.01589,"106":0.01192,"107":0.00795,"108":0.00795,"109":0.58403,"110":0.01192,"111":0.01192,"112":0.03576,"113":0.01192,"114":0.34962,"115":4.54909,"116":2.24872,"117":0.01589,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00397,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.01589,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01192,"96":0,"97":0,"98":0,"99":0.01192,"100":0.32181,"101":0.34168,"102":0.00795,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00397,"93":0,"94":0,"95":0,"96":0,"97":0.0437,"98":0,"99":0,"100":0,"101":0,"102":0.00795,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02781,"110":0.00795,"111":0.03576,"112":0.00397,"113":0.00795,"114":0.1033,"115":1.6488,"116":0.62773},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00795,"14":0.03178,"15":0.00397,"17":0.00397,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.02384,"13.1":0.15892,"14.1":0.11124,"15.1":0.01192,"15.2-15.3":0.01987,"15.4":0.06357,"15.5":0.02384,"15.6":0.147,"16.0":0.03178,"16.1":0.06357,"16.2":0.08343,"16.3":0.1033,"16.4":0.14303,"16.5":0.56814,"16.6":0.588},G:{"8":0.00525,"17":0.12861,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00525,"6.0-6.1":0.00262,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01837,"10.0-10.2":0,"10.3":0.01837,"11.0-11.2":0.00787,"11.3-11.4":0.05512,"12.0-12.1":0,"12.2-12.5":0.31497,"13.0-13.1":0,"13.2":0,"13.3":0.01837,"13.4-13.7":0.0525,"14.0-14.4":0.18111,"14.5-14.8":0.15749,"15.0-15.1":0.35172,"15.2-15.3":0.07349,"15.4":0.09974,"15.5":0.60107,"15.6-15.7":1.75071,"16.0":1.12602,"16.1":1.72709,"16.2":0.65619,"16.3":1.80583,"16.4":0.51445,"16.5":6.18917,"16.6":10.3704},P:{"4":0.01028,"20":0.21587,"21":0.42146,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.07196,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02056,"12.0":0.01028,"13.0":0.08224,"14.0":0.03084,"15.0":0.01028,"16.0":0.07196,"17.0":0.01028,"18.0":0.04112,"19.0":0.09252},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01139,"4.4":0,"4.4.3-4.4.4":0.2904},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03576,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.6588},R:{_:"0"},M:{"0":0.40381},Q:{"13.1":0},O:{"0":0.00603},H:{"0":0.40512}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00442,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.05746,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01326,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00442,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0884,"103":0.00442,"104":0,"105":0,"106":0,"107":0,"108":0.00442,"109":0.00442,"110":0.00884,"111":0.00442,"112":0.00884,"113":0.00442,"114":0.02652,"115":0.27846,"116":0.13702,"117":1.26854,"118":0.07956,"119":0,"120":0.00442,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00442,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.03536,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00884,"80":0.07956,"81":0.00442,"83":0.00442,"84":0.00442,"85":0,"86":0,"87":0.01768,"88":0.00442,"89":0,"90":0,"91":0.00442,"92":0,"93":0,"94":0,"95":0,"96":0.00442,"97":0.00442,"98":0.00442,"99":0.00442,"100":0,"101":0,"102":0.01768,"103":0.07072,"104":0,"105":0.00884,"106":0.00884,"107":0.11934,"108":0.00442,"109":0.56134,"110":0.00442,"111":0.00884,"112":0.03536,"113":0.00884,"114":0.08398,"115":0.21658,"116":6.62558,"117":2.01552,"118":0.00442,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00884,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00442,"73":0,"74":0,"75":0,"76":0.01768,"77":0.00884,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03094,"96":0,"97":0,"98":0,"99":0,"100":0.06188,"101":0.31824,"102":0.49062,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00442,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.04862,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00442,"105":0,"106":0,"107":0,"108":0.00442,"109":0.06188,"110":0.00442,"111":0.03536,"112":0.00442,"113":0.00884,"114":0.03536,"115":0.12818,"116":1.6575,"117":1.2376},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00442,"14":0.08398,"15":0.00442,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01326,"13.1":0.14144,"14.1":0.15912,"15.1":0.00442,"15.2-15.3":0.00884,"15.4":0.04862,"15.5":0.01326,"15.6":0.1989,"16.0":0.01768,"16.1":0.0442,"16.2":0.05746,"16.3":0.05304,"16.4":0.07956,"16.5":0.1989,"16.6":0.91052,"17.0":0.06188,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.06554,"10.0-10.2":0,"10.3":0.02269,"11.0-11.2":0,"11.3-11.4":0.02521,"12.0-12.1":0.00504,"12.2-12.5":0.11848,"13.0-13.1":0,"13.2":0,"13.3":0.7411,"13.4-13.7":0.02521,"14.0-14.4":0.21679,"14.5-14.8":0.18654,"15.0-15.1":0.07058,"15.2-15.3":0.05294,"15.4":0.11091,"15.5":0.45374,"15.6-15.7":1.3234,"16.0":0.79908,"16.1":1.24021,"16.2":0.5218,"16.3":1.36373,"16.4":0.39576,"16.5":1.30323,"16.6":13.52134,"17.0":2.06702,"17.1":0},P:{"4":0.06229,"20":0.26994,"21":0.24918,"22":5.29505,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.06229,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01038,"12.0":0,"13.0":0,"14.0":0.06229,"15.0":0.05191,"16.0":0.08306,"17.0":0.01038,"18.0":0.02076,"19.0":0.15574},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.1742},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0442,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":46.47966},R:{_:"0"},M:{"0":0.2511},Q:{"13.1":0},O:{"0":0.00558},H:{"0":0.12679}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GQ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GQ.js
index 3db5a47287893c..c946b75ba61a3b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GQ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GQ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00647,"35":0,"36":0,"37":0.0259,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03237,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.0259,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00647,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00647,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.01942,"94":0,"95":0,"96":0,"97":0.01295,"98":0,"99":0.09064,"100":0.06474,"101":0,"102":0.00647,"103":0.00647,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.71214,"116":0.60856,"117":0.00647,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.03237,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00647,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.03237,"73":0.00647,"74":0,"75":0.15538,"76":0,"77":0,"78":0.00647,"79":0.01942,"80":0,"81":0.00647,"83":0,"84":0,"85":0,"86":0,"87":0.01295,"88":0.01295,"89":0,"90":0.00647,"91":0,"92":0.01295,"93":0,"94":0,"95":0,"96":0,"97":0.00647,"98":0,"99":0.01942,"100":0.0259,"101":0,"102":0,"103":0.00647,"104":0,"105":0,"106":0,"107":0.00647,"108":0,"109":2.90035,"110":0,"111":0.00647,"112":0.00647,"113":0.0259,"114":0.08416,"115":9.89875,"116":7.16024,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00647,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00647,"64":0,"65":0,"66":0,"67":0.00647,"68":0,"69":0.00647,"70":0,"71":0.00647,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.01295,"99":0,"100":0.00647,"101":0.01942,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00647,"14":0,"15":0,"16":0.00647,"17":0,"18":0.03237,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.01295,"90":0.00647,"91":0,"92":0.04532,"93":0,"94":0,"95":0,"96":0,"97":0.00647,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.03237,"105":0,"106":0,"107":0.01295,"108":0,"109":0.12301,"110":0,"111":0,"112":0.01942,"113":0.37549,"114":0.34312,"115":12.46245,"116":3.47006},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00647,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00647,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.0259,"16.0":0,"16.1":0,"16.2":0.01295,"16.3":0,"16.4":0,"16.5":0.03884,"16.6":0.04532},G:{"8":0,"17":0.0111,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00303,"6.0-6.1":0,"7.0-7.1":0.07672,"8.1-8.4":0.01009,"9.0-9.2":0,"9.3":0.03533,"10.0-10.2":0,"10.3":0.00303,"11.0-11.2":0.09489,"11.3-11.4":0.00505,"12.0-12.1":0.24329,"12.2-12.5":2.47931,"13.0-13.1":0.0111,"13.2":0.01514,"13.3":0.09792,"13.4-13.7":0.08379,"14.0-14.4":1.66061,"14.5-14.8":0.39471,"15.0-15.1":0.2655,"15.2-15.3":0.0636,"15.4":0.10802,"15.5":0.04543,"15.6-15.7":1.73329,"16.0":0.10095,"16.1":0.22007,"16.2":0.20291,"16.3":0.51282,"16.4":0.30386,"16.5":0.73188,"16.6":0.57945},P:{"4":0.28516,"20":0.02037,"21":0.04074,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01018,"8.2":0,"9.2":0.01018,"10.1":0,"11.1-11.2":0.02037,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.01018,"17.0":0.01018,"18.0":0,"19.0":0.01018},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01271,"4.4":0,"4.4.3-4.4.4":0.24145},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00647,"5.5":0},S:{"2.5":0.31029,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":45.79567},R:{_:"0"},M:{"0":0.07052},Q:{"13.1":0.00353},O:{"0":0.18688},H:{"0":0.12351}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.02657,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00664,"57":0.00664,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01993,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.01329,"98":0.00664,"99":0.01329,"100":0.0465,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00664,"113":0,"114":0.01993,"115":0.39194,"116":0.07972,"117":0.59787,"118":0.01329,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00664,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00664,"63":0,"64":0.00664,"65":0,"66":0,"67":0,"68":0.00664,"69":0,"70":0.00664,"71":0,"72":0.05979,"73":0,"74":0,"75":0.01329,"76":0,"77":0,"78":0.00664,"79":0.00664,"80":0,"81":0.01329,"83":0.00664,"84":0,"85":0,"86":0,"87":0.06643,"88":0.00664,"89":0,"90":0.01993,"91":0,"92":0.01329,"93":0,"94":0,"95":0.00664,"96":0,"97":0.00664,"98":0,"99":0.01329,"100":0.10629,"101":0,"102":0,"103":0.03986,"104":0,"105":0.01329,"106":0,"107":0.00664,"108":0,"109":3.01592,"110":0,"111":0,"112":0.00664,"113":0.03986,"114":0.03322,"115":0.33879,"116":12.55527,"117":1.99954,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00664,"62":0,"63":0.00664,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00664,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00664,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.01329,"94":0,"95":0,"96":0,"97":0,"98":0.00664,"99":0,"100":0,"101":0.01329,"102":0.01329,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.01329,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.01329,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.01329,"90":0,"91":0,"92":0.03986,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.03322,"105":0,"106":0,"107":0,"108":0,"109":0.07307,"110":0,"111":0.00664,"112":0.00664,"113":0.8038,"114":0.45172,"115":0.82373,"116":8.96141,"117":10.30994},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00664,"13.1":0.00664,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.01993,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0.00664,"16.6":0.01993,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.06015,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04327,"10.0-10.2":0,"10.3":0.01372,"11.0-11.2":0.00844,"11.3-11.4":0.00317,"12.0-12.1":0.20156,"12.2-12.5":2.70362,"13.0-13.1":0.00106,"13.2":0.00633,"13.3":0.01477,"13.4-13.7":0.09603,"14.0-14.4":1.91849,"14.5-14.8":0.29231,"15.0-15.1":0.19206,"15.2-15.3":0.12136,"15.4":0.33241,"15.5":0.08759,"15.6-15.7":1.76864,"16.0":0.14246,"16.1":0.31342,"16.2":0.11925,"16.3":0.3303,"16.4":0.2005,"16.5":0.5308,"16.6":0.94553,"17.0":0.07704,"17.1":0},P:{"4":0.19483,"20":0.01025,"21":0.03076,"22":0.84084,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01025,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03076,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.01025},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02298,"4.4":0,"4.4.3-4.4.4":0.76474},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00664,"5.5":0},S:{"2.5":0.49348,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":43.92618},R:{_:"0"},M:{"0":0.07385},Q:{"13.1":0.00336},O:{"0":0.14435},H:{"0":0.12395}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GR.js
index 02048a1a4424fd..442e08878b1c18 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.1085,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00417,"79":0,"80":0,"81":0,"82":0,"83":0.00835,"84":0,"85":0,"86":0,"87":0,"88":0.00417,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01252,"103":0.00417,"104":0,"105":0.07094,"106":0.00417,"107":0.00417,"108":0.00417,"109":0.00417,"110":0.00417,"111":0.00417,"112":0.01669,"113":0.01252,"114":0.00835,"115":0.8805,"116":0.95979,"117":0.03338,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.05425,"35":0,"36":0,"37":0,"38":0.1085,"39":0.03338,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.05425,"48":0,"49":0.06677,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.02504,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.03338,"74":0,"75":0.00417,"76":0.00417,"77":0,"78":0,"79":0.07929,"80":0,"81":0.01669,"83":0,"84":0,"85":0,"86":0.00417,"87":0.00835,"88":0.00835,"89":0.01252,"90":0.00417,"91":0.00417,"92":0.00417,"93":0.00835,"94":0,"95":0.01252,"96":0.00835,"97":0,"98":0,"99":0.01669,"100":0.00417,"101":0.00835,"102":0.03756,"103":0.01669,"104":0.00417,"105":0.01252,"106":0.03756,"107":0.00835,"108":0.00835,"109":2.71245,"110":0.00417,"111":0.00835,"112":0.01669,"113":0.02504,"114":0.28376,"115":4.76557,"116":2.82512,"117":0.00417,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.03338,"26":0,"27":0,"28":0.00417,"29":0,"30":0,"31":0.16692,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.20448,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.10433,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00835,"72":0.00417,"73":0,"74":0,"75":0,"76":0,"77":0.00417,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02087,"96":0,"97":0,"98":0,"99":0.00417,"100":0.13354,"101":0.14606,"102":0.00417,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.07511,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01669,"110":0,"111":0,"112":0.00417,"113":0,"114":0.02087,"115":0.80956,"116":0.25873},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00835,"15":0,"17":0.00417,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00417,"13.1":0.01252,"14.1":0.02087,"15.1":0.00417,"15.2-15.3":0.00417,"15.4":0.00417,"15.5":0.00835,"15.6":0.04173,"16.0":0.00417,"16.1":0.01252,"16.2":0.01252,"16.3":0.03338,"16.4":0.01252,"16.5":0.1085,"16.6":0.16275},G:{"8":0,"17":0.08507,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00109,"6.0-6.1":0,"7.0-7.1":0.16033,"8.1-8.4":0.00109,"9.0-9.2":0,"9.3":0.04254,"10.0-10.2":0,"10.3":0.04581,"11.0-11.2":0.00545,"11.3-11.4":0.00327,"12.0-12.1":0.00436,"12.2-12.5":0.22469,"13.0-13.1":0.00218,"13.2":0.00109,"13.3":0.00654,"13.4-13.7":0.02072,"14.0-14.4":0.0589,"14.5-14.8":0.12652,"15.0-15.1":0.03381,"15.2-15.3":0.05344,"15.4":0.04799,"15.5":0.0938,"15.6-15.7":0.96964,"16.0":0.25632,"16.1":0.58898,"16.2":0.28031,"16.3":0.62606,"16.4":0.11561,"16.5":2.40173,"16.6":4.64531},P:{"4":0.14476,"20":0.06204,"21":0.19646,"5.0-5.4":0.01034,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01034,"12.0":0,"13.0":0.01034,"14.0":0.02068,"15.0":0.01034,"16.0":0.02068,"17.0":0.02068,"18.0":0.02068,"19.0":0.04136},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.55164,"4.2-4.3":0.08275,"4.4":0,"4.4.3-4.4.4":0.41373},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00417,"9":0,"10":0,"11":0.01252,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.11549},R:{_:"0"},M:{"0":0.25056},Q:{"13.1":0},O:{"0":0.04662},H:{"0":0.25376}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00456,"49":0,"50":0,"51":0,"52":0.15504,"53":0,"54":0,"55":0,"56":0.00456,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00456,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00912,"79":0,"80":0,"81":0,"82":0,"83":0.00912,"84":0,"85":0,"86":0.00456,"87":0,"88":0.00456,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01824,"103":0,"104":0,"105":0.0684,"106":0.00456,"107":0.00456,"108":0.00456,"109":0.00456,"110":0,"111":0.00912,"112":0.0228,"113":0.0228,"114":0.00456,"115":0.76608,"116":0.05016,"117":1.2768,"118":0.11856,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.05928,"35":0,"36":0,"37":0,"38":0.08208,"39":0.05472,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.06384,"48":0,"49":0.05472,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.01824,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00456,"71":0,"72":0,"73":0.06384,"74":0,"75":0,"76":0.00456,"77":0,"78":0,"79":0.07296,"80":0.00456,"81":0.01824,"83":0,"84":0,"85":0.00456,"86":0.00456,"87":0.00456,"88":0.00456,"89":0.01824,"90":0.00456,"91":0.00912,"92":0.00456,"93":0.00912,"94":0.00456,"95":0.00912,"96":0.00456,"97":0.00456,"98":0.00456,"99":0.01368,"100":0.00456,"101":0.00912,"102":0.05928,"103":0.01824,"104":0.00456,"105":0.01368,"106":0.03192,"107":0.00456,"108":0.01368,"109":2.80896,"110":0.00456,"111":0.00912,"112":0.01824,"113":0.01368,"114":0.07752,"115":0.08664,"116":7.51944,"117":2.14776,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.03648,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.20064,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.20064,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.16416,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00456,"70":0,"71":0,"72":0.00912,"73":0.00456,"74":0,"75":0,"76":0,"77":0.0228,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03648,"96":0,"97":0,"98":0,"99":0.00456,"100":0.03648,"101":0.15048,"102":0.19608,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.07296,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00456,"109":0.0228,"110":0,"111":0.00456,"112":0.00456,"113":0,"114":0.00912,"115":0.0456,"116":0.71592,"117":0.48336},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00912,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00456,"13.1":0.01368,"14.1":0.02736,"15.1":0.00456,"15.2-15.3":0.00456,"15.4":0.00456,"15.5":0.00912,"15.6":0.05016,"16.0":0.00456,"16.1":0.01368,"16.2":0.01368,"16.3":0.03192,"16.4":0.00912,"16.5":0.04104,"16.6":0.31464,"17.0":0.01824,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00112,"6.0-6.1":0.00112,"7.0-7.1":0.17872,"8.1-8.4":0.00112,"9.0-9.2":0,"9.3":0.04271,"10.0-10.2":0,"10.3":0.04159,"11.0-11.2":0.01012,"11.3-11.4":0.00337,"12.0-12.1":0.00562,"12.2-12.5":0.23155,"13.0-13.1":0.00112,"13.2":0.00225,"13.3":0.05283,"13.4-13.7":0.0236,"14.0-14.4":0.04946,"14.5-14.8":0.12814,"15.0-15.1":0.03035,"15.2-15.3":0.04271,"15.4":0.04046,"15.5":0.08318,"15.6-15.7":0.99701,"16.0":0.23604,"16.1":0.48333,"16.2":0.24391,"16.3":0.48558,"16.4":0.07981,"16.5":0.35856,"16.6":6.44515,"17.0":0.78344,"17.1":0.00225},P:{"4":0.17523,"20":0.05154,"21":0.1443,"22":1.83471,"5.0-5.4":0.01031,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01031,"12.0":0,"13.0":0.01031,"14.0":0.02061,"15.0":0,"16.0":0.02061,"17.0":0.01031,"18.0":0.02061,"19.0":0.04123},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.26866,"4.2-4.3":0.17911,"4.4":0,"4.4.3-4.4.4":0.80599},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00456,"9":0,"10":0,"11":0.01824,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":63.4436},R:{_:"0"},M:{"0":0.25568},Q:{"13.1":0},O:{"0":0.0544},H:{"0":0.25751}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GT.js
index f3c606c7203c96..601c09bf50db89 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.05994,"74":0,"75":0,"76":0,"77":0,"78":0.00353,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00705,"103":0,"104":0.00353,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00353,"111":0,"112":0,"113":0.00705,"114":0.00705,"115":0.11283,"116":0.38081,"117":0.01763,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00353,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00353,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.02468,"80":0,"81":0.00705,"83":0,"84":0,"85":0,"86":0,"87":0.00705,"88":0.00353,"89":0,"90":0,"91":0.01763,"92":0,"93":0.00705,"94":0,"95":0.00353,"96":0.00353,"97":0.00705,"98":0,"99":0.00705,"100":0.00705,"101":0.00353,"102":0,"103":0.02821,"104":0.00353,"105":0.00705,"106":0.01058,"107":0.00353,"108":0.00705,"109":0.52537,"110":0.00705,"111":0.02468,"112":0.02468,"113":0.02468,"114":0.24329,"115":4.61201,"116":2.55988,"117":0.00353,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00353,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00353,"70":0,"71":0.00705,"72":0.00353,"73":0,"74":0,"75":0,"76":0,"77":0.00353,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00353,"95":0.01058,"96":0,"97":0,"98":0,"99":0.00705,"100":0.47954,"101":0.22566,"102":0.00353,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00353,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00353,"99":0,"100":0.00353,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01058,"110":0.00353,"111":0.00353,"112":0.01058,"113":0.00705,"114":0.04231,"115":0.82861,"116":0.26798},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00353,"15":0,"17":0.01058,_:"0","3.1":0,"3.2":0,"5.1":0.00353,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00353,"13.1":0.01058,"14.1":0.02116,"15.1":0,"15.2-15.3":0.00353,"15.4":0.00353,"15.5":0.00705,"15.6":0.05289,"16.0":0.00705,"16.1":0.01763,"16.2":0.02821,"16.3":0.03173,"16.4":0.01763,"16.5":0.15514,"16.6":0.17277},G:{"8":0,"17":0.20865,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01456,"7.0-7.1":0.00162,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01132,"10.0-10.2":0,"10.3":0.00809,"11.0-11.2":0.00323,"11.3-11.4":0,"12.0-12.1":0.00323,"12.2-12.5":0.09381,"13.0-13.1":0,"13.2":0,"13.3":0.00485,"13.4-13.7":0.01941,"14.0-14.4":0.05176,"14.5-14.8":0.12293,"15.0-15.1":0.02588,"15.2-15.3":0.04205,"15.4":0.04691,"15.5":0.06955,"15.6-15.7":0.77477,"16.0":0.45774,"16.1":0.67772,"16.2":0.3801,"16.3":0.88152,"16.4":0.20865,"16.5":3.68297,"16.6":8.36878},P:{"4":0.07138,"20":0.12237,"21":0.25494,"5.0-5.4":0.0102,"6.2-6.4":0,"7.2-7.4":0.10197,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.04079,"12.0":0.0102,"13.0":0.02039,"14.0":0.04079,"15.0":0.0102,"16.0":0.06118,"17.0":0.04079,"18.0":0.04079,"19.0":0.08158},I:{"0":0,"3":0,"4":0.03632,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.10895},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00705,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.41754},R:{_:"0"},M:{"0":0.23954},Q:{"13.1":0},O:{"0":0.07769},H:{"0":0.34323}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.04327,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00361,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00721,"103":0,"104":0.00361,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00721,"114":0.00361,"115":0.05048,"116":0.02885,"117":0.42551,"118":0.03245,"119":0.00361,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00361,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00361,"76":0.00361,"77":0,"78":0.00361,"79":0.02164,"80":0,"81":0.00361,"83":0,"84":0,"85":0.01082,"86":0.01082,"87":0.00721,"88":0.00361,"89":0.00361,"90":0,"91":0.02885,"92":0,"93":0.00361,"94":0,"95":0,"96":0.00361,"97":0.00721,"98":0,"99":0.01082,"100":0.01082,"101":0.00361,"102":0,"103":0.02885,"104":0.00361,"105":0.00721,"106":0.00721,"107":0.00361,"108":0.01082,"109":0.55893,"110":0.00721,"111":0.02524,"112":0.01082,"113":0.02164,"114":0.06491,"115":0.10457,"116":5.94629,"117":1.52173,"118":0.00361,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00361,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00361,"72":0.01442,"73":0.00361,"74":0,"75":0,"76":0,"77":0.01442,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01082,"96":0,"97":0,"98":0,"99":0.00721,"100":0.14424,"101":0.25603,"102":0.27406,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00361,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00721,"99":0,"100":0.00361,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00361,"108":0.00361,"109":0.01442,"110":0.00361,"111":0.00361,"112":0.01082,"113":0.00721,"114":0.01082,"115":0.02524,"116":0.69596,"117":0.46878},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00721,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00361,"6.1":0,"7.1":0,"9.1":0.00721,"10.1":0,"11.1":0,"12.1":0.00361,"13.1":0.00721,"14.1":0.01442,"15.1":0.00361,"15.2-15.3":0.00361,"15.4":0.00361,"15.5":0.00721,"15.6":0.0577,"16.0":0.00721,"16.1":0.01803,"16.2":0.01803,"16.3":0.02885,"16.4":0.01442,"16.5":0.0577,"16.6":0.28127,"17.0":0.04327,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01785,"7.0-7.1":0.00162,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00974,"10.0-10.2":0.01785,"10.3":0.01136,"11.0-11.2":0.00162,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.13468,"13.0-13.1":0,"13.2":0,"13.3":0.00487,"13.4-13.7":0.02434,"14.0-14.4":0.05842,"14.5-14.8":0.11846,"15.0-15.1":0.02759,"15.2-15.3":0.0357,"15.4":0.05193,"15.5":0.0503,"15.6-15.7":0.73994,"16.0":0.37484,"16.1":0.64258,"16.2":0.31642,"16.3":0.6442,"16.4":0.13468,"16.5":0.43163,"16.6":10.10114,"17.0":2.02996,"17.1":0.00162},P:{"4":0.06122,"20":0.11224,"21":0.15306,"22":2.66324,"5.0-5.4":0.0102,"6.2-6.4":0,"7.2-7.4":0.10204,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.04082,"12.0":0,"13.0":0.03061,"14.0":0.05102,"15.0":0.0102,"16.0":0.05102,"17.0":0.03061,"18.0":0.04082,"19.0":0.09184},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.18245},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00361,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.26258},R:{_:"0"},M:{"0":0.29412},Q:{"13.1":0},O:{"0":0.06394},H:{"0":0.32083}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GU.js
index e4c1cb52592a7e..24f2ddf924963a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00853,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.04694,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00853,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0128,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01707,"110":0,"111":0.00427,"112":0,"113":0.0256,"114":0.00427,"115":0.58031,"116":0.54191,"117":0.00853,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01707,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00427,"77":0,"78":0,"79":0.0256,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.0128,"88":0,"89":0,"90":0.01707,"91":0.00427,"92":0.00427,"93":0.01707,"94":0,"95":0,"96":0,"97":0,"98":0.00427,"99":0.19202,"100":0.00427,"101":0,"102":0,"103":0.16641,"104":0,"105":0.03414,"106":0,"107":0.00427,"108":0.00853,"109":0.34989,"110":0.00427,"111":0.0256,"112":0.08961,"113":0.06401,"114":0.45657,"115":5.53003,"116":2.44072,"117":0.02134,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.0128,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00427,"100":0.16641,"101":0.08107,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00427,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00427,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00427,"109":0.04267,"110":0,"111":0.00427,"112":0.00427,"113":0.04267,"114":0.10241,"115":2.06096,"116":0.49924},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.04694,"15":0.00427,"17":0.00853,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.04267,"13.1":0.0384,"14.1":0.12801,"15.1":0.01707,"15.2-15.3":0.02134,"15.4":0.0128,"15.5":0.02987,"15.6":0.49924,"16.0":0.02134,"16.1":0.07681,"16.2":0.06827,"16.3":0.21335,"16.4":0.12801,"16.5":1.06248,"16.6":0.77659},G:{"8":0,"17":0.16003,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00865,"6.0-6.1":0,"7.0-7.1":0.00865,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.22924,"10.0-10.2":0.00433,"10.3":0.02163,"11.0-11.2":0,"11.3-11.4":0.13841,"12.0-12.1":0.06055,"12.2-12.5":0.56228,"13.0-13.1":0.00865,"13.2":0,"13.3":0.10381,"13.4-13.7":0.01298,"14.0-14.4":0.25951,"14.5-14.8":0.4282,"15.0-15.1":0.15571,"15.2-15.3":0.19464,"15.4":0.22491,"15.5":0.43685,"15.6-15.7":2.8114,"16.0":2.01556,"16.1":2.72057,"16.2":1.37542,"16.3":2.64272,"16.4":2.27507,"16.5":9.66257,"16.6":16.7127},P:{"4":0.21862,"20":0.2082,"21":0.5101,"5.0-5.4":0.06246,"6.2-6.4":0,"7.2-7.4":0.01041,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01041,"12.0":0,"13.0":0,"14.0":0.01041,"15.0":0.15615,"16.0":0.09369,"17.0":0.04164,"18.0":0.12492,"19.0":0.09369},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.10534},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00427,"11":0.00853,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":30.37599},R:{_:"0"},M:{"0":1.1122},Q:{"13.1":0},O:{"0":0.02867},H:{"0":0.10313}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00437,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0131,"79":0,"80":0,"81":0.0131,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.0131,"88":0,"89":0,"90":0,"91":0.00437,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.0131,"104":0,"105":0,"106":0,"107":0.00437,"108":0,"109":0.00437,"110":0,"111":0,"112":0,"113":0.00437,"114":0,"115":0.82517,"116":0.05239,"117":0.57195,"118":0.06112,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00437,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00873,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00437,"76":0.00437,"77":0,"78":0,"79":0.01746,"80":0,"81":0,"83":0,"84":0,"85":0.00437,"86":0,"87":0.00873,"88":0,"89":0,"90":0.00437,"91":0,"92":0.0131,"93":0.00437,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.14844,"100":0.00873,"101":0,"102":0,"103":0.15718,"104":0,"105":0.00873,"106":0.00437,"107":0,"108":0.00437,"109":0.39731,"110":0,"111":0.03056,"112":0.09169,"113":0.04366,"114":0.09605,"115":0.37984,"116":7.40037,"117":1.5412,"118":0.02183,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00437,"73":0.00437,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0262,"101":0.05676,"102":0.12225,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00437,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.05239,"110":0,"111":0,"112":0.00437,"113":0.00437,"114":0.07859,"115":0.47589,"116":1.45824,"117":1.08713},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.04366,"15":0.02183,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01746,"13.1":0.04366,"14.1":0.10042,"15.1":0.00873,"15.2-15.3":0.0131,"15.4":0.0131,"15.5":0.03493,"15.6":0.4104,"16.0":0.01746,"16.1":0.05239,"16.2":0.06112,"16.3":0.2183,"16.4":0.14408,"16.5":0.32308,"16.6":1.53247,"17.0":0.03929,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.08611,"10.0-10.2":0.0041,"10.3":0.0205,"11.0-11.2":0,"11.3-11.4":0.11891,"12.0-12.1":0.17222,"12.2-12.5":0.31163,"13.0-13.1":0,"13.2":0.0492,"13.3":0.041,"13.4-13.7":0.0328,"14.0-14.4":0.22962,"14.5-14.8":0.29113,"15.0-15.1":0.20502,"15.2-15.3":0.23782,"15.4":0.18042,"15.5":0.20502,"15.6-15.7":2.01328,"16.0":1.22191,"16.1":2.32491,"16.2":1.19731,"16.3":2.51353,"16.4":1.27112,"16.5":2.03789,"16.6":24.0692,"17.0":1.75496,"17.1":0},P:{"4":0.12451,"20":0.11413,"21":0.21789,"22":3.40316,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01038,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0.13488,"16.0":0.01038,"17.0":0.01038,"18.0":0.06225,"19.0":0.10375},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.13422},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":30.94472},R:{_:"0"},M:{"0":1.94373},Q:{"13.1":0},O:{"0":0.0338},H:{"0":0.06934}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GW.js
index 125af261987f1c..e49f1b1d344c22 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01762,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.01322,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.03524,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00441,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.00881,"116":0.10132,"117":0.02643,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00881,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00881,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00441,"44":0,"45":0,"46":0,"47":0.00441,"48":0,"49":0.00441,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00441,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00441,"71":0,"72":0,"73":0.00881,"74":0,"75":0,"76":0,"77":0.00441,"78":0,"79":0,"80":0,"81":0.09251,"83":0.03524,"84":0,"85":0,"86":0,"87":0,"88":0.00441,"89":0,"90":0.14537,"91":0,"92":0,"93":0,"94":0,"95":0.00441,"96":0,"97":0,"98":0,"99":0.00881,"100":0,"101":0,"102":0.04405,"103":0.00881,"104":0,"105":0.00441,"106":0,"107":0.01322,"108":0,"109":5.14504,"110":0,"111":0.41848,"112":0.00441,"113":0.00441,"114":0.0837,"115":3.89843,"116":4.28607,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00441,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00441,"69":0.00441,"70":0.00441,"71":0.06167,"72":0.00881,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00881,"100":0.02203,"101":0.14096,"102":0.00881,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00881,"14":0,"15":0,"16":0,"17":0,"18":0.00441,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01322,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00441,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.07048,"110":0.00881,"111":0.00441,"112":0.01762,"113":0.05286,"114":0.12334,"115":1.12328,"116":0.33478},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00881,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0.02203,"16.3":0,"16.4":0,"16.5":0.00441,"16.6":0.01322},G:{"8":0.0036,"17":0.04316,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00839,"6.0-6.1":0,"7.0-7.1":3.07785,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.13429,"10.0-10.2":0.04556,"10.3":0.13189,"11.0-11.2":0.16546,"11.3-11.4":0,"12.0-12.1":0.09592,"12.2-12.5":1.49156,"13.0-13.1":0.34891,"13.2":0,"13.3":0.14628,"13.4-13.7":0.04316,"14.0-14.4":0.26978,"14.5-14.8":0.59471,"15.0-15.1":0.13069,"15.2-15.3":0.04436,"15.4":0.16306,"15.5":0.18225,"15.6-15.7":2.76251,"16.0":0.16426,"16.1":0.22421,"16.2":0.07794,"16.3":0.32493,"16.4":0.21342,"16.5":0.41126,"16.6":0.68703},P:{"4":0.14442,"20":0.08253,"21":0.07221,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.06189,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01032,"12.0":0,"13.0":0.03095,"14.0":0,"15.0":0.01032,"16.0":0.02063,"17.0":0,"18.0":0.01032,"19.0":0.05158},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00116,"4.4":0,"4.4.3-4.4.4":0.03205},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01322,"5.5":0},S:{"2.5":0.60986,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":68.39722},R:{_:"0"},M:{"0":0.05036},Q:{"13.1":0},O:{"0":0.08393},H:{"0":0.65153}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01303,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00434,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00434,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00869,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.02172,"116":0,"117":0.0391,"118":0.00434,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00869,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00869,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00434,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.01303,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.03041,"71":0,"72":0,"73":0,"74":0,"75":0.01303,"76":0,"77":0,"78":0,"79":0.00434,"80":0,"81":0.00869,"83":0.00434,"84":0,"85":0,"86":0,"87":0,"88":0.00434,"89":0,"90":0.18679,"91":0,"92":0,"93":0,"94":0,"95":0.00434,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03041,"103":0.00434,"104":0,"105":0.00434,"106":0,"107":0.05213,"108":0.00434,"109":5.07814,"110":0,"111":0.2867,"112":0.00869,"113":0.00434,"114":0.02172,"115":0.03475,"116":6.05988,"117":1.55081,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00434,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00434,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00869,"69":0.00869,"70":0,"71":0,"72":0.04778,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00434,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.03475,"102":0.02172,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.01303,"13":0.00434,"14":0,"15":0.02606,"16":0,"17":0,"18":0.01738,"79":0,"80":0,"81":0,"83":0,"84":0.00869,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.02172,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0391,"110":0,"111":0,"112":0,"113":0.00869,"114":0.0391,"115":0.29539,"116":0.92093,"117":0.83405},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.03041,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0.02172,"16.3":0,"16.4":0,"16.5":0,"16.6":0.00434,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00149,"6.0-6.1":0,"7.0-7.1":0.01116,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.18231,"10.0-10.2":0.16594,"10.3":0.04242,"11.0-11.2":0.0506,"11.3-11.4":0.00223,"12.0-12.1":0.12278,"12.2-12.5":0.52164,"13.0-13.1":0.17785,"13.2":0,"13.3":0.13394,"13.4-13.7":0.05804,"14.0-14.4":0.16966,"14.5-14.8":0.67865,"15.0-15.1":0.52982,"15.2-15.3":0.07665,"15.4":0.02158,"15.5":0.19571,"15.6-15.7":2.48541,"16.0":0.09971,"16.1":0.06102,"16.2":0.19348,"16.3":0.37058,"16.4":0.11385,"16.5":0.19422,"16.6":0.70172,"17.0":0.06995,"17.1":0},P:{"4":0.19344,"20":0.0509,"21":0.08145,"22":0.2138,"5.0-5.4":0.01018,"6.2-6.4":0,"7.2-7.4":0.08145,"8.2":0,"9.2":0,"10.1":0.06108,"11.1-11.2":0.04072,"12.0":0,"13.0":0.02036,"14.0":0,"15.0":0.07127,"16.0":0.0509,"17.0":0.04072,"18.0":0.01018,"19.0":0.04072},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00037,"4.2-4.3":0.00097,"4.4":0,"4.4.3-4.4.4":0.03471},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0.8484,_:"3.0-3.1"},J:{"7":0,"10":0.00566},N:{"10":0,"11":0},L:{"0":73.32783},R:{_:"0"},M:{"0":0.04525},Q:{"13.1":0},O:{"0":0.06222},H:{"0":0.31057}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GY.js
index b257eb6643cfc5..e4dede817958d3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/GY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00331,"103":0.00331,"104":0,"105":0,"106":0,"107":0.00331,"108":0,"109":0,"110":0.00331,"111":0,"112":0,"113":0,"114":0.00992,"115":0.12232,"116":0.24464,"117":0.00331,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00331,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00331,"66":0,"67":0,"68":0,"69":0.00661,"70":0.00331,"71":0,"72":0,"73":0.01653,"74":0,"75":0.00331,"76":0.01984,"77":0.00992,"78":0,"79":0.03967,"80":0,"81":0.00331,"83":0.00331,"84":0,"85":0,"86":0.00331,"87":0.01322,"88":0.00331,"89":0.00331,"90":0.00331,"91":0.00661,"92":0.00331,"93":0.06281,"94":0,"95":0.00331,"96":0.00331,"97":0,"98":0,"99":0,"100":0.00331,"101":0,"102":0,"103":0.04298,"104":0,"105":0.02975,"106":0.00661,"107":0.00661,"108":0.00992,"109":0.21158,"110":0.00661,"111":0.00992,"112":0.03637,"113":0.04959,"114":0.38019,"115":3.53742,"116":1.58688,"117":0.00331,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00661,"71":0.00992,"72":0.00992,"73":0,"74":0,"75":0,"76":0.02314,"77":0.04628,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0.00992,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00331,"96":0,"97":0,"98":0,"99":0.00992,"100":0.21158,"101":0.12893,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00331,"79":0,"80":0,"81":0,"83":0,"84":0.03967,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00331,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00331,"109":0.01322,"110":0,"111":0.00331,"112":0.00331,"113":0.00331,"114":0.07934,"115":1.20669,"116":0.37688},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.03637,"15":0,"17":0.00992,_:"0","3.1":0,"3.2":0,"5.1":0.00661,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00331,"13.1":0.00992,"14.1":0.01322,"15.1":0,"15.2-15.3":0.00331,"15.4":0.01322,"15.5":0.00992,"15.6":0.04628,"16.0":0.12232,"16.1":0.00992,"16.2":0.00661,"16.3":0.02975,"16.4":0.01322,"16.5":0.06943,"16.6":0.14216},G:{"8":0,"17":0.19649,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01696,"6.0-6.1":0,"7.0-7.1":0.0523,"8.1-8.4":0,"9.0-9.2":0.00141,"9.3":0.07209,"10.0-10.2":0,"10.3":0.04382,"11.0-11.2":0.0099,"11.3-11.4":0.00707,"12.0-12.1":0,"12.2-12.5":0.21345,"13.0-13.1":0,"13.2":0.00141,"13.3":0,"13.4-13.7":0.0212,"14.0-14.4":0.07492,"14.5-14.8":0.13005,"15.0-15.1":0.03958,"15.2-15.3":0.01979,"15.4":0.07633,"15.5":0.1145,"15.6-15.7":1.45881,"16.0":0.47213,"16.1":0.70396,"16.2":0.31381,"16.3":1.145,"16.4":0.13288,"16.5":3.50284,"16.6":5.30516},P:{"4":0.31067,"20":0.20354,"21":0.55707,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.22497,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0857,"12.0":0.01071,"13.0":0.01071,"14.0":0.01071,"15.0":0.01071,"16.0":0.07499,"17.0":0.03214,"18.0":0.04285,"19.0":0.13927},I:{"0":0,"3":0,"4":0.09007,"2.1":0,"2.2":0,"2.3":0,"4.1":0.09007,"4.2-4.3":0.12009,"4.4":0,"4.4.3-4.4.4":0.87067},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00771,"11":0.01543,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.12956},R:{_:"0"},M:{"0":0.05355},Q:{"13.1":0},O:{"0":0.46189},H:{"0":0.58938}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00342,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00342,"108":0,"109":0,"110":0.00342,"111":0,"112":0,"113":0,"114":0.00342,"115":0.0649,"116":0.01366,"117":0.21179,"118":0.02733,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00342,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01025,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.01708,"70":0.00342,"71":0,"72":0,"73":0.01366,"74":0.01025,"75":0,"76":0.00683,"77":0.00683,"78":0,"79":0.02733,"80":0,"81":0.00342,"83":0.00342,"84":0,"85":0,"86":0.00342,"87":0.02733,"88":0.05124,"89":0.00342,"90":0,"91":0.00342,"92":0.01025,"93":0.03416,"94":0,"95":0,"96":0.00342,"97":0,"98":0,"99":0,"100":0,"101":0.00683,"102":0,"103":0.06149,"104":0,"105":0.01366,"106":0.00683,"107":0.00342,"108":0.00683,"109":0.23912,"110":0.00342,"111":0.00683,"112":0.01708,"113":0.03416,"114":0.14347,"115":0.1503,"116":4.92246,"117":0.84034,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00342,"72":0.01366,"73":0.01025,"74":0,"75":0,"76":0,"77":0.0205,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00342,"95":0.00683,"96":0,"97":0,"98":0,"99":0.00342,"100":0.02733,"101":0.21862,"102":0.20496,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00342,"16":0,"17":0.00342,"18":0.00342,"79":0,"80":0,"81":0,"83":0,"84":0.03074,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00342,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01708,"110":0,"111":0.00342,"112":0.00342,"113":0.00342,"114":0.02733,"115":0.04441,"116":1.0248,"117":0.63196},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0854,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00342,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01366,"14.1":0.01366,"15.1":0.00683,"15.2-15.3":0,"15.4":0.01025,"15.5":0.01025,"15.6":0.03416,"16.0":0.01025,"16.1":0.01366,"16.2":0.00683,"16.3":0.01708,"16.4":0.00683,"16.5":0.03758,"16.6":0.23912,"17.0":0.05807,"17.1":0},G:{"8":0,"3.2":0.00275,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.03298,"6.0-6.1":0,"7.0-7.1":0.0742,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07008,"10.0-10.2":0,"10.3":0.0371,"11.0-11.2":0.01512,"11.3-11.4":0,"12.0-12.1":0.01099,"12.2-12.5":0.28444,"13.0-13.1":0.00275,"13.2":0,"13.3":0,"13.4-13.7":0.00962,"14.0-14.4":0.05222,"14.5-14.8":0.08245,"15.0-15.1":0.03298,"15.2-15.3":0.03435,"15.4":0.02473,"15.5":0.09619,"15.6-15.7":1.52387,"16.0":0.29131,"16.1":0.43009,"16.2":0.24871,"16.3":0.45208,"16.4":0.06321,"16.5":0.54002,"16.6":8.17587,"17.0":0.92339,"17.1":0},P:{"4":0.25211,"20":0.15757,"21":0.30463,"22":4.59043,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.22059,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.08404,"12.0":0,"13.0":0.03151,"14.0":0.03151,"15.0":0.0105,"16.0":0.06303,"17.0":0.04202,"18.0":0.06303,"19.0":0.14706},I:{"0":0,"3":0,"4":0.07128,"2.1":0,"2.2":0,"2.3":0,"4.1":0.1782,"4.2-4.3":0.07128,"4.4":0,"4.4.3-4.4.4":0.7128},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02391,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.27956},R:{_:"0"},M:{"0":0.07242},Q:{"13.1":0},O:{"0":0.35554},H:{"0":0.36777}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HK.js
index 78529d8e812eda..52c1b875692c02 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HK.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.02156,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00539,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00539,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01078,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00539,"89":0.00539,"90":0.00539,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01617,"103":0,"104":0,"105":0,"106":0,"107":0.00539,"108":0,"109":0.00539,"110":0.00539,"111":0.00539,"112":0.00539,"113":0.01078,"114":0.01617,"115":0.20486,"116":0.48519,"117":0.01617,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00539,"27":0,"28":0,"29":0,"30":0.00539,"31":0,"32":0,"33":0,"34":0.04852,"35":0,"36":0,"37":0,"38":0.10243,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02696,"50":0,"51":0,"52":0,"53":0.02696,"54":0,"55":0.01078,"56":0,"57":0.00539,"58":0,"59":0,"60":0,"61":0.03235,"62":0.00539,"63":0.00539,"64":0,"65":0.00539,"66":0,"67":0.00539,"68":0,"69":0.01078,"70":0.01078,"71":0.00539,"72":0.00539,"73":0.00539,"74":0.02696,"75":0.01078,"76":0.00539,"77":0,"78":0.02156,"79":0.52293,"80":0.01078,"81":0.01617,"83":0.04852,"84":0.00539,"85":0.00539,"86":0.03235,"87":0.16173,"88":0.00539,"89":0.07008,"90":0.01078,"91":0.02156,"92":0.02156,"93":0.00539,"94":0.07547,"95":0.01078,"96":0.01617,"97":0.02156,"98":0.02696,"99":0.10782,"100":0.01617,"101":0.02156,"102":0.02156,"103":0.10243,"104":0.01617,"105":0.02696,"106":0.03235,"107":0.03774,"108":0.0593,"109":1.45018,"110":0.02696,"111":0.05391,"112":0.12938,"113":0.2372,"114":0.98655,"115":7.58514,"116":4.10794,"117":0.02696,"118":0.01078,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01078,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.02156,"37":0,"38":0,"39":0,"40":0.00539,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.08087,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.11321,"96":0,"97":0,"98":0,"99":0.00539,"100":0.03774,"101":0.05391,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00539,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01617,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00539,"108":0.00539,"109":0.38276,"110":0.05391,"111":0.01617,"112":0.01617,"113":0.03774,"114":0.10782,"115":2.07014,"116":0.69005},E:{"4":0,"5":0,"6":0,"7":0.00539,"8":0,"9":0,"10":0,"11":0,"12":0.00539,"13":0.02156,"14":0.10782,"15":0.02696,"17":0.01078,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01617,"13.1":0.08626,"14.1":0.22103,"15.1":0.02696,"15.2-15.3":0.03235,"15.4":0.10782,"15.5":0.14017,"15.6":0.58762,"16.0":0.04313,"16.1":0.10782,"16.2":0.12399,"16.3":0.3612,"16.4":0.1186,"16.5":0.98116,"16.6":1.56339},G:{"8":0,"17":0.09958,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02414,"6.0-6.1":0.01509,"7.0-7.1":0.03017,"8.1-8.4":0.04828,"9.0-9.2":0.00905,"9.3":0.2082,"10.0-10.2":0.00603,"10.3":0.16596,"11.0-11.2":0.02112,"11.3-11.4":0.02716,"12.0-12.1":0.03923,"12.2-12.5":0.84791,"13.0-13.1":0.0181,"13.2":0.01207,"13.3":0.03621,"13.4-13.7":0.09354,"14.0-14.4":0.37718,"14.5-14.8":0.52806,"15.0-15.1":0.22329,"15.2-15.3":0.27459,"15.4":0.40434,"15.5":0.3983,"15.6-15.7":2.32345,"16.0":0.89015,"16.1":1.68374,"16.2":0.83584,"16.3":1.8829,"16.4":0.3983,"16.5":5.3047,"16.6":12.93887},P:{"4":1.30407,"20":0.14011,"21":0.39877,"5.0-5.4":0.17244,"6.2-6.4":0.02155,"7.2-7.4":0.01078,"8.2":0.01078,"9.2":0.02155,"10.1":0,"11.1-11.2":0.02155,"12.0":0.01078,"13.0":0.04311,"14.0":0.02155,"15.0":0.02155,"16.0":0.03233,"17.0":0.097,"18.0":0.05389,"19.0":0.06466},I:{"0":0,"3":0,"4":0.00453,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00905,"4.4":0,"4.4.3-4.4.4":0.09955},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.16467,"10":0,"11":0.28817,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":31.03015},R:{_:"0"},M:{"0":0.18436},Q:{"13.1":0.09679},O:{"0":0.34107},H:{"0":0.07854}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01385,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00462,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00462,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00923,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00923,"103":0,"104":0,"105":0,"106":0.00923,"107":0.00462,"108":0,"109":0.00462,"110":0.00462,"111":0.00923,"112":0.00462,"113":0.00462,"114":0.00923,"115":0.07846,"116":0.03231,"117":0.40151,"118":0.03231,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00462,"27":0,"28":0,"29":0,"30":0.00462,"31":0,"32":0,"33":0,"34":0.02769,"35":0,"36":0,"37":0,"38":0.07384,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00462,"49":0.01385,"50":0,"51":0,"52":0,"53":0.02308,"54":0,"55":0.00923,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.02308,"62":0,"63":0,"64":0,"65":0.00462,"66":0,"67":0.00462,"68":0,"69":0.00923,"70":0.00462,"71":0.00462,"72":0.00462,"73":0.00462,"74":0.01846,"75":0.00923,"76":0.00462,"77":0.00462,"78":0.01385,"79":0.36459,"80":0.00923,"81":0.01385,"83":0.04154,"84":0.00462,"85":0.00462,"86":0.02308,"87":0.11076,"88":0.00462,"89":0.06461,"90":0.00923,"91":0.02769,"92":0.01385,"93":0,"94":0.03692,"95":0.00923,"96":0.00923,"97":0.01385,"98":0.01385,"99":0.08769,"100":0.01385,"101":0.01385,"102":0.01846,"103":0.06923,"104":0.00923,"105":0.01846,"106":0.02308,"107":0.02308,"108":0.03692,"109":0.85378,"110":0.01846,"111":0.02769,"112":0.07846,"113":0.11076,"114":0.26306,"115":0.35997,"116":7.18556,"117":1.69832,"118":0.02308,"119":0.00462,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00462,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01385,"37":0,"38":0,"39":0,"40":0.00462,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.05538,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00462,"73":0,"74":0,"75":0,"76":0,"77":0.00923,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02308,"96":0,"97":0,"98":0,"99":0.00462,"100":0.00462,"101":0.03692,"102":0.03231,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00462,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00462,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00462,"108":0.00462,"109":0.08769,"110":0.00923,"111":0.00462,"112":0.00923,"113":0.02308,"114":0.03231,"115":0.06461,"116":1.22298,"117":0.76148},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.00462,"13":0.01846,"14":0.07384,"15":0.01846,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00462,"10.1":0,"11.1":0,"12.1":0.01385,"13.1":0.06,"14.1":0.15691,"15.1":0.01846,"15.2-15.3":0.02308,"15.4":0.07846,"15.5":0.0923,"15.6":0.40151,"16.0":0.03231,"16.1":0.07384,"16.2":0.07846,"16.3":0.25844,"16.4":0.06923,"16.5":0.22152,"16.6":1.96599,"17.0":0.05077,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02234,"6.0-6.1":0.01117,"7.0-7.1":0.01862,"8.1-8.4":0.08191,"9.0-9.2":0.00745,"9.3":0.15266,"10.0-10.2":0.00372,"10.3":0.13032,"11.0-11.2":0.01489,"11.3-11.4":0.02234,"12.0-12.1":0.03351,"12.2-12.5":0.6553,"13.0-13.1":0.01117,"13.2":0.01117,"13.3":0.04096,"13.4-13.7":0.08191,"14.0-14.4":0.3351,"14.5-14.8":0.54733,"15.0-15.1":0.26435,"15.2-15.3":0.27925,"15.4":0.44307,"15.5":0.40956,"15.6-15.7":2.32707,"16.0":1.1021,"16.1":1.99942,"16.2":0.98668,"16.3":2.06271,"16.4":0.36116,"16.5":1.12444,"16.6":22.3808,"17.0":1.03508,"17.1":0.00372},P:{"4":1.04633,"20":0.09609,"21":0.26692,"22":4.8473,"5.0-5.4":0.14948,"6.2-6.4":0.02135,"7.2-7.4":0,"8.2":0,"9.2":0.01068,"10.1":0,"11.1-11.2":0.01068,"12.0":0.01068,"13.0":0.04271,"14.0":0.02135,"15.0":0.01068,"16.0":0.04271,"17.0":0.07474,"18.0":0.05338,"19.0":0.07474},I:{"0":0,"3":0,"4":0.0189,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00378,"4.4":0,"4.4.3-4.4.4":0.06425},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.08175,"10":0,"11":0.20438,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.00539,"11":0},L:{"0":32.73159},R:{_:"0"},M:{"0":0.19925},Q:{"13.1":0.07001},O:{"0":0.28002},H:{"0":0.09687}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HN.js
index 66a47791f12e93..ee2bf26bd77375 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.004,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.03203,"74":0,"75":0,"76":0,"77":0,"78":0.004,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.004,"101":0,"102":0.004,"103":0,"104":0,"105":0,"106":0.00801,"107":0,"108":0.004,"109":0,"110":0,"111":0,"112":0,"113":0.01201,"114":0.00801,"115":0.10811,"116":0.26827,"117":0.01201,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.004,"39":0,"40":0,"41":0.004,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.004,"48":0,"49":0.00801,"50":0,"51":0,"52":0,"53":0.004,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.004,"64":0.004,"65":0,"66":0.004,"67":0,"68":0.004,"69":0.00801,"70":0,"71":0,"72":0,"73":0,"74":0.004,"75":0.004,"76":0.004,"77":0.004,"78":0.004,"79":0.12012,"80":0.004,"81":0.01201,"83":0.004,"84":0,"85":0.00801,"86":0.01201,"87":0.02803,"88":0.00801,"89":0.004,"90":0.004,"91":0.02002,"92":0.01602,"93":0.07207,"94":0.004,"95":0,"96":0,"97":0.01201,"98":0.004,"99":0.02002,"100":0.004,"101":0.004,"102":0.02002,"103":0.05606,"104":0.004,"105":0.00801,"106":0.02002,"107":0.004,"108":0.79279,"109":0.64064,"110":0.00801,"111":0.01201,"112":0.15215,"113":0.05205,"114":0.84885,"115":5.1091,"116":2.94294,"117":0.004,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.004,"70":0,"71":0.00801,"72":0.00801,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.004,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02002,"96":0,"97":0,"98":0.00801,"99":0.00801,"100":0.47648,"101":0.27227,"102":0.004,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.004,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.004,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01602,"110":0,"111":0.004,"112":0.00801,"113":0.01201,"114":0.07207,"115":1.12512,"116":0.34434},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00801,"15":0.004,"17":0.00801,_:"0","3.1":0,"3.2":0,"5.1":0.004,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01201,"14.1":0.01201,"15.1":0.004,"15.2-15.3":0.004,"15.4":0.01201,"15.5":0.00801,"15.6":0.04004,"16.0":0.01201,"16.1":0.01602,"16.2":0.02402,"16.3":0.10811,"16.4":0.02803,"16.5":0.1962,"16.6":0.15215},G:{"8":0,"17":0.15133,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.04368,"7.0-7.1":0.04212,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04836,"10.0-10.2":0,"10.3":0.0312,"11.0-11.2":0.01092,"11.3-11.4":0.00312,"12.0-12.1":0.00624,"12.2-12.5":0.45242,"13.0-13.1":0.00468,"13.2":0.00156,"13.3":0.02184,"13.4-13.7":0.0468,"14.0-14.4":0.0624,"14.5-14.8":0.26677,"15.0-15.1":0.10452,"15.2-15.3":0.04836,"15.4":0.05928,"15.5":0.14197,"15.6-15.7":1.52887,"16.0":0.45866,"16.1":0.70047,"16.2":0.43526,"16.3":0.81904,"16.4":0.19657,"16.5":2.93606,"16.6":6.96729},P:{"4":0.3078,"20":0.1539,"21":0.29754,"5.0-5.4":0.0513,"6.2-6.4":0,"7.2-7.4":0.14364,"8.2":0,"9.2":0.02052,"10.1":0,"11.1-11.2":0.07182,"12.0":0.02052,"13.0":0.03078,"14.0":0.02052,"15.0":0.02052,"16.0":0.07182,"17.0":0.06156,"18.0":0.04104,"19.0":0.19494},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.04918,"4.4":0,"4.4.3-4.4.4":0.20901},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00801,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.07795},N:{"10":0,"11":0},L:{"0":62.61075},R:{_:"0"},M:{"0":0.10193},Q:{"13.1":0},O:{"0":0.11392},H:{"0":0.22139}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00427,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.02563,"74":0,"75":0,"76":0,"77":0,"78":0.00427,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00854,"103":0,"104":0,"105":0.00427,"106":0.00854,"107":0,"108":0.00427,"109":0,"110":0.00427,"111":0,"112":0.00427,"113":0.00854,"114":0.00427,"115":0.06834,"116":0.0299,"117":0.36731,"118":0.05979,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00427,"35":0,"36":0,"37":0,"38":0.00427,"39":0,"40":0,"41":0.00427,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00427,"50":0,"51":0,"52":0,"53":0.00854,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00427,"66":0,"67":0,"68":0.00427,"69":0.00427,"70":0,"71":0,"72":0,"73":0.00427,"74":0,"75":0.00854,"76":0.01281,"77":0,"78":0.00427,"79":0.12813,"80":0,"81":0.00854,"83":0,"84":0,"85":0.00854,"86":0.00854,"87":0.02563,"88":0.01281,"89":0,"90":0.00427,"91":0.02563,"92":0.00427,"93":0.03844,"94":0.00427,"95":0,"96":0.00427,"97":0.00854,"98":0,"99":0.02563,"100":0,"101":0.00427,"102":0.02563,"103":0.06407,"104":0.01281,"105":0.00854,"106":0.02136,"107":0.00427,"108":0.96952,"109":0.63638,"110":0.00427,"111":0.01708,"112":0.21782,"113":0.0299,"114":0.09823,"115":0.19647,"116":7.7177,"117":2.21665,"118":0.00427,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0.00427,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00427,"70":0,"71":0.00854,"72":0.01281,"73":0,"74":0,"75":0,"76":0,"77":0.01281,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00427,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02136,"96":0,"97":0,"98":0,"99":0.00427,"100":0.11105,"101":0.3246,"102":0.36304,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00427,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.00427,"88":0,"89":0,"90":0,"91":0,"92":0.00854,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00427,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00427,"108":0.00427,"109":0.01281,"110":0.00854,"111":0.00427,"112":0.00427,"113":0.00854,"114":0.0299,"115":0.04271,"116":0.91399,"117":0.80722},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00427,"14":0.00427,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00427,"6.1":0,"7.1":0,"9.1":0.00427,"10.1":0,"11.1":0,"12.1":0.00427,"13.1":0.00854,"14.1":0.01281,"15.1":0.00427,"15.2-15.3":0.00427,"15.4":0.00427,"15.5":0.00427,"15.6":0.04698,"16.0":0.00854,"16.1":0.02563,"16.2":0.01708,"16.3":0.04698,"16.4":0.01281,"16.5":0.05125,"16.6":0.2648,"17.0":0.0299,"17.1":0},G:{"8":0.00336,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00336,"6.0-6.1":0.04531,"7.0-7.1":0.02182,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07217,"10.0-10.2":0,"10.3":0.4414,"11.0-11.2":0.00671,"11.3-11.4":0.00336,"12.0-12.1":0.00671,"12.2-12.5":0.17958,"13.0-13.1":0.00336,"13.2":0.00336,"13.3":0.02182,"13.4-13.7":0.04028,"14.0-14.4":0.36419,"14.5-14.8":0.14433,"15.0-15.1":0.07217,"15.2-15.3":0.04364,"15.4":0.07217,"15.5":0.28699,"15.6-15.7":1.61118,"16.0":0.54881,"16.1":0.7116,"16.2":0.32224,"16.3":0.74181,"16.4":0.10406,"16.5":0.58237,"16.6":8.67854,"17.0":1.32083,"17.1":0},P:{"4":0.22913,"20":0.0729,"21":0.23954,"22":2.41624,"5.0-5.4":0.02083,"6.2-6.4":0,"7.2-7.4":0.13539,"8.2":0,"9.2":0.02083,"10.1":0,"11.1-11.2":0.05207,"12.0":0.01041,"13.0":0.04166,"14.0":0.01041,"15.0":0.01041,"16.0":0.05207,"17.0":0.04166,"18.0":0.03124,"19.0":0.10415},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0675,"4.4":0,"4.4.3-4.4.4":0.25876},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01281,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":60.70294},R:{_:"0"},M:{"0":0.10885},Q:{"13.1":0},O:{"0":0.10885},H:{"0":0.31458}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HR.js
index 00f21a0fc12296..9e5aa0bfb36fb0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00378,"49":0,"50":0,"51":0,"52":0.01135,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00378,"69":0,"70":0,"71":0,"72":0.00378,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01135,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00378,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00378,"100":0,"101":0,"102":0.03406,"103":0.00378,"104":0.00378,"105":0.00378,"106":0.00378,"107":0.01892,"108":0.00757,"109":0.00378,"110":0.01135,"111":0.02649,"112":0.08703,"113":0.01135,"114":0.01514,"115":0.3784,"116":0.94222,"117":0.03027,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00378,"42":0,"43":0,"44":0.00378,"45":0,"46":0,"47":0.00378,"48":0.00378,"49":0.01514,"50":0,"51":0.00378,"52":0,"53":0.00378,"54":0,"55":0.00378,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00378,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00378,"71":0,"72":0,"73":0,"74":0,"75":0.00378,"76":0,"77":0.00378,"78":0,"79":0.07946,"80":0.00378,"81":0.0227,"83":0,"84":0.00378,"85":0.00378,"86":0.00378,"87":0.01514,"88":0.00378,"89":0.00757,"90":0.00378,"91":0.00378,"92":0.00378,"93":0.00378,"94":0.00378,"95":0.00757,"96":0.00378,"97":0.00378,"98":0.00378,"99":0.01135,"100":0.00757,"101":0.00378,"102":0.00378,"103":0.02649,"104":0.00378,"105":0.00757,"106":0.03027,"107":0.00757,"108":0.01135,"109":0.70004,"110":0.01135,"111":0.01135,"112":0.03784,"113":0.03406,"114":0.3065,"115":4.94947,"116":3.11045,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00378,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01514,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00378,"70":0.00378,"71":0.01514,"72":0.00757,"73":0,"74":0,"75":0,"76":0.00378,"77":0.00757,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00378,"86":0.00378,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02649,"96":0,"97":0,"98":0,"99":0.00757,"100":0.33299,"101":0.28758,"102":0.00378,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00378,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00378,"109":0.02649,"110":0.00378,"111":0.00378,"112":0.00378,"113":0.00378,"114":0.04162,"115":0.83626,"116":0.31407},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00378,"10":0,"11":0,"12":0,"13":0.00378,"14":0.01514,"15":0.00378,"17":0.00378,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00378,"13.1":0.01135,"14.1":0.03784,"15.1":0.00378,"15.2-15.3":0.00378,"15.4":0.01135,"15.5":0.01892,"15.6":0.08325,"16.0":0.0227,"16.1":0.0227,"16.2":0.03784,"16.3":0.06433,"16.4":0.01514,"16.5":0.15893,"16.6":0.25353},G:{"8":0.00177,"17":0.12934,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00532,"8.1-8.4":0.00709,"9.0-9.2":0,"9.3":0.09922,"10.0-10.2":0,"10.3":0.04429,"11.0-11.2":0.01949,"11.3-11.4":0.00532,"12.0-12.1":0.03366,"12.2-12.5":0.17895,"13.0-13.1":0.00177,"13.2":0,"13.3":0.00709,"13.4-13.7":0.02303,"14.0-14.4":0.08682,"14.5-14.8":0.23388,"15.0-15.1":0.06556,"15.2-15.3":0.0691,"15.4":0.10808,"15.5":0.15592,"15.6-15.7":0.99043,"16.0":0.61481,"16.1":1.20305,"16.2":0.64139,"16.3":1.2438,"16.4":0.28349,"16.5":4.38343,"16.6":7.06593},P:{"4":0.19497,"20":0.10262,"21":0.33863,"5.0-5.4":0.03078,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.01026,"11.1-11.2":0.02052,"12.0":0.01026,"13.0":0.02052,"14.0":0.02052,"15.0":0.01026,"16.0":0.02052,"17.0":0.04105,"18.0":0.03078,"19.0":0.05131},I:{"0":0,"3":0,"4":0.00963,"2.1":0,"2.2":0.00642,"2.3":0.00642,"4.1":0.07058,"4.2-4.3":0.01925,"4.4":0,"4.4.3-4.4.4":0.08663},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01135,"9":0.00378,"10":0,"11":0.0227,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00622},N:{"10":0,"11":0},L:{"0":59.28375},R:{_:"0"},M:{"0":0.54701},Q:{"13.1":0},O:{"0":0.11189},H:{"0":0.62969}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.03433,"49":0,"50":0,"51":0,"52":0.01716,"53":0,"54":0,"55":0.00429,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00429,"69":0,"70":0,"71":0,"72":0.00429,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01287,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00429,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00429,"100":0,"101":0,"102":0.03433,"103":0.00429,"104":0,"105":0.00429,"106":0.00429,"107":0.02575,"108":0.00858,"109":0.00429,"110":0.00429,"111":0.03433,"112":0.00858,"113":0.01716,"114":0.00858,"115":0.25746,"116":0.07724,"117":1.29159,"118":0.12873,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00858,"42":0,"43":0.00429,"44":0.00429,"45":0,"46":0.00429,"47":0.00429,"48":0,"49":0.01716,"50":0,"51":0.00429,"52":0,"53":0.00429,"54":0,"55":0,"56":0.00429,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00429,"67":0,"68":0,"69":0,"70":0.00429,"71":0,"72":0,"73":0,"74":0,"75":0.00429,"76":0.00429,"77":0.00858,"78":0,"79":0.06437,"80":0.00429,"81":0.02575,"83":0,"84":0.00429,"85":0.00429,"86":0.00429,"87":0.02146,"88":0.00429,"89":0.00429,"90":0.00429,"91":0.00429,"92":0.00429,"93":0.00429,"94":0.00429,"95":0.00858,"96":0.00429,"97":0.00429,"98":0.00429,"99":0.01287,"100":0.00858,"101":0.00429,"102":0.00429,"103":0.02146,"104":0.00429,"105":0.01287,"106":0.03862,"107":0.01287,"108":0.01287,"109":0.86249,"110":0.00858,"111":0.02146,"112":0.04291,"113":0.02575,"114":0.09011,"115":0.17164,"116":8.30738,"117":2.65184,"118":0.00429,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00429,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00858,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00429,"70":0.00429,"71":0,"72":0.01716,"73":0.00429,"74":0,"75":0,"76":0,"77":0.03433,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00429,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00429,"93":0,"94":0.00429,"95":0.03433,"96":0,"97":0,"98":0,"99":0.00429,"100":0.09011,"101":0.32183,"102":0.3819,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00429,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00429,"108":0.00429,"109":0.03433,"110":0.00429,"111":0,"112":0.00429,"113":0.00858,"114":0.01287,"115":0.03433,"116":0.75093,"117":0.59216},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00429,"10":0,"11":0,"12":0,"13":0.00429,"14":0.01287,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01716,"14.1":0.03004,"15.1":0.02146,"15.2-15.3":0.00429,"15.4":0.00858,"15.5":0.01287,"15.6":0.07724,"16.0":0.02575,"16.1":0.02146,"16.2":0.08153,"16.3":0.0472,"16.4":0.01287,"16.5":0.05578,"16.6":0.39477,"17.0":0.01716,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00802,"8.1-8.4":0.01283,"9.0-9.2":0,"9.3":0.08177,"10.0-10.2":0,"10.3":0.02886,"11.0-11.2":0.02726,"11.3-11.4":0.00481,"12.0-12.1":0.02726,"12.2-12.5":0.1972,"13.0-13.1":0,"13.2":0.0016,"13.3":0.00641,"13.4-13.7":0.03046,"14.0-14.4":0.06253,"14.5-14.8":0.19399,"15.0-15.1":0.06734,"15.2-15.3":0.05611,"15.4":0.05932,"15.5":0.13147,"15.6-15.7":0.88339,"16.0":0.42646,"16.1":0.91385,"16.2":0.48097,"16.3":0.89461,"16.4":0.18277,"16.5":0.6397,"16.6":9.40945,"17.0":1.06776,"17.1":0.00321},P:{"4":0.1846,"20":0.0923,"21":0.22563,"22":3.84591,"5.0-5.4":0.02051,"6.2-6.4":0.01026,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.01026,"11.1-11.2":0.01026,"12.0":0,"13.0":0.01026,"14.0":0.02051,"15.0":0.01026,"16.0":0.03077,"17.0":0.03077,"18.0":0.03077,"19.0":0.05128},I:{"0":0,"3":0,"4":0.013,"2.1":0,"2.2":0.0065,"2.3":0.00975,"4.1":0.02275,"4.2-4.3":0.02275,"4.4":0,"4.4.3-4.4.4":0.091},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01287,"9":0.00429,"10":0.00429,"11":0.03862,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00571},N:{"10":0,"11":0},L:{"0":57.5626},R:{_:"0"},M:{"0":0.50239},Q:{"13.1":0},O:{"0":0.07993},H:{"0":0.5513}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HT.js
index aa1809e3108f83..894db5bebca84e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00134,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00134,"100":0,"101":0.00134,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00134,"114":0,"115":0.00939,"116":0.03353,"117":0.00134,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00536,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00134,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00402,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00134,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00536,"65":0,"66":0,"67":0,"68":0.00134,"69":0.00134,"70":0.00268,"71":0,"72":0,"73":0,"74":0.00268,"75":0.00536,"76":0.00805,"77":0.00134,"78":0.00134,"79":0,"80":0.00134,"81":0.00805,"83":0.00134,"84":0.00134,"85":0,"86":0.00134,"87":0.00402,"88":0.01207,"89":0.00134,"90":0.00268,"91":0.00134,"92":0.00939,"93":0.01609,"94":0.00268,"95":0.00134,"96":0.00134,"97":0,"98":0,"99":0.00134,"100":0,"101":0,"102":0.00134,"103":0.01207,"104":0,"105":0.00402,"106":0.00536,"107":0.00134,"108":0.00536,"109":0.06839,"110":0.00134,"111":0.00134,"112":0.01073,"113":0.00805,"114":0.03889,"115":0.28295,"116":0.15824,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00134,"64":0,"65":0,"66":0,"67":0,"68":0.00134,"69":0.00268,"70":0.00268,"71":0.01341,"72":0.00671,"73":0,"74":0,"75":0.00268,"76":0,"77":0,"78":0,"79":0.00134,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00268,"96":0,"97":0,"98":0.00402,"99":0.00134,"100":0.01073,"101":0.0228,"102":0.00134,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00402,"13":0,"14":0.00134,"15":0,"16":0.00134,"17":0,"18":0.00134,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00268,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00536,"107":0,"108":0,"109":0.00805,"110":0.00134,"111":0.00134,"112":0.00134,"113":0.00134,"114":0.00671,"115":0.15287,"116":0.04559},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00402,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00134,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00268,"14.1":0.00402,"15.1":0,"15.2-15.3":0,"15.4":0.00134,"15.5":0.00268,"15.6":0.00671,"16.0":0.01207,"16.1":0,"16.2":0,"16.3":0.00402,"16.4":0.00268,"16.5":0.00805,"16.6":0.00805},G:{"8":0,"17":0.08555,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00321,"6.0-6.1":0.00855,"7.0-7.1":0,"8.1-8.4":0.00749,"9.0-9.2":0,"9.3":0.07699,"10.0-10.2":0,"10.3":0.04919,"11.0-11.2":0.00107,"11.3-11.4":0.03422,"12.0-12.1":0.35822,"12.2-12.5":1.39547,"13.0-13.1":0.06202,"13.2":0.00214,"13.3":0.11014,"13.4-13.7":0.43735,"14.0-14.4":0.95598,"14.5-14.8":0.60203,"15.0-15.1":0.41704,"15.2-15.3":0.40741,"15.4":0.18927,"15.5":0.23311,"15.6-15.7":1.91088,"16.0":0.37319,"16.1":0.36464,"16.2":0.32935,"16.3":0.52611,"16.4":0.3101,"16.5":0.73356,"16.6":0.70682},P:{"4":0.34818,"20":0.17409,"21":0.30722,"5.0-5.4":0.07168,"6.2-6.4":0.02048,"7.2-7.4":0.17409,"8.2":0.02048,"9.2":0.23554,"10.1":0,"11.1-11.2":0.46083,"12.0":0.02048,"13.0":0.22529,"14.0":0.0512,"15.0":0.04096,"16.0":0.2765,"17.0":0.06144,"18.0":0.08193,"19.0":0.12289},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00178,"4.2-4.3":0.00606,"4.4":0,"4.4.3-4.4.4":0.09726},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00268,"5.5":0},S:{"2.5":0.00866,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":83.48},R:{_:"0"},M:{"0":0.11257},Q:{"13.1":0},O:{"0":0.18184},H:{"0":0.3689}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00123,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00123,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.0049,"114":0,"115":0.00245,"116":0.00858,"117":0.02083,"118":0.00245,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00123,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00123,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00123,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00368,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00123,"57":0,"58":0.00123,"59":0,"60":0.00123,"61":0,"62":0,"63":0,"64":0.0049,"65":0,"66":0,"67":0,"68":0,"69":0.00123,"70":0.00245,"71":0,"72":0,"73":0,"74":0.00245,"75":0.0049,"76":0.00368,"77":0,"78":0.00123,"79":0.00123,"80":0.00123,"81":0.00613,"83":0.00123,"84":0.00123,"85":0,"86":0.00123,"87":0.00368,"88":0.00368,"89":0,"90":0.00368,"91":0.00245,"92":0.00245,"93":0.02205,"94":0.00245,"95":0.00123,"96":0,"97":0.00123,"98":0,"99":0,"100":0.00123,"101":0.00245,"102":0.00123,"103":0.00613,"104":0,"105":0.0049,"106":0.00858,"107":0.00123,"108":0.00245,"109":0.05268,"110":0.00123,"111":0.00123,"112":0.00613,"113":0.0049,"114":0.0147,"115":0.0245,"116":0.26828,"117":0.06615,"118":0.00368,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00123,"68":0,"69":0.00123,"70":0.00123,"71":0.00368,"72":0.0098,"73":0.00245,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00123,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00245,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.0147,"102":0.0196,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00245,"13":0,"14":0.00123,"15":0.00123,"16":0,"17":0,"18":0.00123,"79":0,"80":0,"81":0,"83":0,"84":0.00123,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00123,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.01348,"107":0,"108":0,"109":0.00735,"110":0,"111":0,"112":0,"113":0.00123,"114":0.00123,"115":0.0049,"116":0.08453,"117":0.0588},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00123,"12":0,"13":0.00123,"14":0.00123,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00123,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00123,"14.1":0.00368,"15.1":0.00123,"15.2-15.3":0,"15.4":0,"15.5":0.00245,"15.6":0.0049,"16.0":0.00368,"16.1":0,"16.2":0,"16.3":0.00368,"16.4":0.00123,"16.5":0.00245,"16.6":0.00858,"17.0":0.00123,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00438,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.12703,"10.0-10.2":0,"10.3":0.06461,"11.0-11.2":0.00219,"11.3-11.4":0.00986,"12.0-12.1":0.27159,"12.2-12.5":1.58682,"13.0-13.1":0.0898,"13.2":0.01533,"13.3":0.09308,"13.4-13.7":0.5158,"14.0-14.4":0.93413,"14.5-14.8":0.81586,"15.0-15.1":0.42052,"15.2-15.3":0.36686,"15.4":0.16865,"15.5":0.32087,"15.6-15.7":1.93287,"16.0":0.46323,"16.1":0.29349,"16.2":0.25626,"16.3":0.50594,"16.4":0.15222,"16.5":0.38329,"16.6":0.93742,"17.0":0.18836,"17.1":0.00219},P:{"4":0.3623,"20":0.16562,"21":0.21738,"22":0.62109,"5.0-5.4":0.05176,"6.2-6.4":0.03105,"7.2-7.4":0.19668,"8.2":0.0207,"9.2":0.26914,"10.1":0,"11.1-11.2":0.31055,"12.0":0.01035,"13.0":0.16562,"14.0":0.08281,"15.0":0.01035,"16.0":0.22773,"17.0":0.06211,"18.0":0.12422,"19.0":0.12422},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00177,"4.2-4.3":0.01312,"4.4":0,"4.4.3-4.4.4":0.09963},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00123,"5.5":0},S:{"2.5":0.00878,_:"3.0-3.1"},J:{"7":0,"10":0.02633},N:{"10":0,"11":0},L:{"0":83.73843},R:{_:"0"},M:{"0":0.1404},Q:{"13.1":0},O:{"0":0.22815},H:{"0":0.29077}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HU.js
index 53661b375f8f23..ad343a7f3151aa 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/HU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.04082,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00408,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00816,"79":0,"80":0,"81":0,"82":0,"83":0.00408,"84":0,"85":0,"86":0,"87":0,"88":0.00408,"89":0.00408,"90":0,"91":0.00816,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00408,"98":0,"99":0.00408,"100":0,"101":0.00408,"102":0.02857,"103":0.00816,"104":0,"105":0.00408,"106":0.00408,"107":0.00408,"108":0.00408,"109":0.00408,"110":0.00408,"111":0.25717,"112":0.00816,"113":0.32248,"114":0.09389,"115":0.61638,"116":1.33073,"117":0.0449,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00408,"35":0,"36":0,"37":0,"38":0.01225,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01225,"50":0,"51":0,"52":0,"53":0.00408,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00408,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00408,"72":0,"73":0,"74":0.00408,"75":0,"76":0.00408,"77":0,"78":0.00408,"79":0.18369,"80":0.00408,"81":0.00816,"83":0.00408,"84":0.00408,"85":0.00408,"86":0.00408,"87":0.03674,"88":0.00408,"89":0.00408,"90":0.00408,"91":0.00408,"92":0.00408,"93":0,"94":0.00408,"95":0.00816,"96":0.00408,"97":0.00408,"98":0,"99":0.01633,"100":0.00816,"101":0.00408,"102":0.00408,"103":0.02449,"104":0.01225,"105":0.00816,"106":0.01225,"107":0.00816,"108":0.01225,"109":1.00417,"110":0.00816,"111":0.01225,"112":0.02449,"113":0.02857,"114":0.31023,"115":5.30252,"116":2.93904,"117":0.00408,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00408,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00408,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00816,"72":0.00816,"73":0,"74":0,"75":0,"76":0,"77":0.00408,"78":0,"79":0.00408,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00408,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.06123,"96":0,"97":0,"98":0,"99":0.02449,"100":0.3633,"101":0.39187,"102":0.00816,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00408,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00408,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00408,"105":0,"106":0,"107":0,"108":0,"109":0.02857,"110":0.00408,"111":0,"112":0.23267,"113":0.05307,"114":0.08164,"115":0.94294,"116":0.32248},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00816,"15":0.00408,"17":0.00816,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00408,"10.1":0,"11.1":0,"12.1":0.00408,"13.1":0.01225,"14.1":0.02041,"15.1":0.00408,"15.2-15.3":0.00408,"15.4":0.00816,"15.5":0.00816,"15.6":0.05715,"16.0":0.00816,"16.1":0.01633,"16.2":0.02041,"16.3":0.0449,"16.4":0.01633,"16.5":0.1592,"16.6":0.19185},G:{"8":0,"17":0.21358,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00521,"8.1-8.4":0,"9.0-9.2":0.00695,"9.3":0.02605,"10.0-10.2":0.00174,"10.3":0.03299,"11.0-11.2":0.00868,"11.3-11.4":0.00695,"12.0-12.1":0.00521,"12.2-12.5":0.18059,"13.0-13.1":0.00347,"13.2":0,"13.3":0.00521,"13.4-13.7":0.02431,"14.0-14.4":0.07119,"14.5-14.8":0.19622,"15.0-15.1":0.04688,"15.2-15.3":0.06251,"15.4":0.09203,"15.5":0.12329,"15.6-15.7":1.31103,"16.0":0.99152,"16.1":0.91512,"16.2":0.45322,"16.3":0.8717,"16.4":0.20143,"16.5":3.47119,"16.6":8.02419},P:{"4":0.47303,"20":0.08227,"21":0.2468,"22":2.56051,"5.0-5.4":0.02057,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01028,"14.0":0.01028,"15.0":0,"16.0":0.02057,"17.0":0.02057,"18.0":0.02057,"19.0":0.0617},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.04913,"4.2-4.3":0.04913,"4.4":0,"4.4.3-4.4.4":0.16582},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0049,"9":0,"10":0,"11":0.01959,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":59.92213},R:{_:"0"},M:{"0":0.30774},Q:{"13.1":0},O:{"0":0.02959},H:{"0":0.47063}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.02591,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0037,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0037,"79":0,"80":0,"81":0,"82":0,"83":0.0037,"84":0,"85":0,"86":0,"87":0,"88":0.0037,"89":0.0037,"90":0,"91":0.0037,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.0037,"99":0.0037,"100":0,"101":0,"102":0.02962,"103":0.0074,"104":0.0037,"105":0.0037,"106":0,"107":0,"108":0.0037,"109":0.0037,"110":0.0037,"111":0.0037,"112":0.0037,"113":0.0074,"114":0.02221,"115":0.98473,"116":0.07034,"117":1.15132,"118":0.10366,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01111,"35":0,"36":0,"37":0,"38":0.01481,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.0037,"48":0,"49":0.01111,"50":0,"51":0,"52":0,"53":0.0074,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.0037,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.0037,"77":0,"78":0.0037,"79":0.13697,"80":0.01851,"81":0.0037,"83":0.0074,"84":0,"85":0.0037,"86":0,"87":0.02591,"88":0.0037,"89":0.0074,"90":0.0037,"91":0.0037,"92":0.0037,"93":0,"94":0.0037,"95":0.0074,"96":0.0037,"97":0.0037,"98":0,"99":0.01481,"100":0.0037,"101":0.0037,"102":0.0037,"103":0.01851,"104":0.01111,"105":0.0074,"106":0.01481,"107":0.0074,"108":0.01111,"109":0.75891,"110":0.0074,"111":0.0074,"112":0.01851,"113":0.01111,"114":0.05183,"115":0.11106,"116":5.38271,"117":1.4771,"118":0.0037,"119":0.0037,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.0037,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0037,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01111,"73":0.0037,"74":0,"75":0,"76":0,"77":0.02221,"78":0,"79":0.0037,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.0037,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04813,"96":0,"97":0,"98":0,"99":0.0037,"100":0.04442,"101":0.28876,"102":0.29986,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02962,"110":0.0037,"111":0,"112":0.05923,"113":0.0037,"114":0.01111,"115":0.02591,"116":0.61453,"117":0.42203},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0074,"15":0.0037,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.0037,"10.1":0,"11.1":0,"12.1":0.0037,"13.1":0.01111,"14.1":0.01481,"15.1":0.0037,"15.2-15.3":0.0037,"15.4":0.0074,"15.5":0.0074,"15.6":0.04442,"16.0":0.0037,"16.1":0.01481,"16.2":0.01111,"16.3":0.02962,"16.4":0.01111,"16.5":0.04442,"16.6":0.22952,"17.0":0.02591,"17.1":0},G:{"8":0.00303,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00152,"6.0-6.1":0,"7.0-7.1":0.00455,"8.1-8.4":0,"9.0-9.2":0.0091,"9.3":0.02124,"10.0-10.2":0,"10.3":0.02428,"11.0-11.2":0.00607,"11.3-11.4":0.00455,"12.0-12.1":0.00455,"12.2-12.5":0.16691,"13.0-13.1":0.00303,"13.2":0,"13.3":0.08649,"13.4-13.7":0.02124,"14.0-14.4":0.05918,"14.5-14.8":0.16691,"15.0-15.1":0.04249,"15.2-15.3":0.05159,"15.4":0.14415,"15.5":0.09408,"15.6-15.7":1.0819,"16.0":0.51288,"16.1":0.66765,"16.2":0.30651,"16.3":0.58268,"16.4":0.1138,"16.5":0.42184,"16.6":8.77205,"17.0":1.57961,"17.1":0.00303},P:{"4":0.4336,"20":0.08259,"21":0.1755,"22":2.77708,"5.0-5.4":0.02065,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01032,"12.0":0,"13.0":0.01032,"14.0":0.01032,"15.0":0,"16.0":0.02065,"17.0":0.01032,"18.0":0.02065,"19.0":0.06194},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0.05382,"2.3":0,"4.1":0.04613,"4.2-4.3":0.03075,"4.4":0,"4.4.3-4.4.4":0.12301},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0037,"9":0,"10":0,"11":0.01111,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.48935},R:{_:"0"},M:{"0":0.3086},Q:{"13.1":0},O:{"0":0.02519},H:{"0":0.41142}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ID.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ID.js
index 2ead7dc41d03a6..200d1e3660c825 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ID.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ID.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.03223,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00322,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00322,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00322,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00645,"103":0.00645,"104":0,"105":0.00322,"106":0.00322,"107":0.00322,"108":0.00322,"109":0.00322,"110":0.00322,"111":0.00322,"112":0.00322,"113":0.01934,"114":0.01289,"115":0.24173,"116":0.53824,"117":0.02256,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.00322,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00322,"71":0.00322,"72":0,"73":0,"74":0.00322,"75":0,"76":0,"77":0,"78":0.00322,"79":0.00645,"80":0.00645,"81":0.00322,"83":0.00322,"84":0.00322,"85":0.00322,"86":0.00322,"87":0.00645,"88":0.00322,"89":0.00645,"90":0.00322,"91":0.00645,"92":0.00322,"93":0.00322,"94":0.00322,"95":0.00322,"96":0.00322,"97":0.00322,"98":0.00322,"99":0.01289,"100":0.00967,"101":0.00645,"102":0.00645,"103":0.01934,"104":0.00645,"105":0.00967,"106":0.00967,"107":0.02578,"108":0.01612,"109":0.59948,"110":0.00967,"111":0.02256,"112":0.02901,"113":0.02901,"114":0.24173,"115":4.11255,"116":2.41725,"117":0.00322,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00322,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00967,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00322,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00967,"70":0.01934,"71":0.08702,"72":0.06768,"73":0,"74":0,"75":0,"76":0.00322,"77":0.00322,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00967,"96":0,"97":0,"98":0,"99":0.00322,"100":0.05801,"101":0.07091,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00322,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00322,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00322,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00645,"110":0,"111":0,"112":0.00322,"113":0.00322,"114":0.02256,"115":0.60592,"116":0.21916},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00967,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.01289,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00322,"13.1":0.01289,"14.1":0.02256,"15.1":0.00645,"15.2-15.3":0.00322,"15.4":0.00645,"15.5":0.00967,"15.6":0.02901,"16.0":0.00322,"16.1":0.01612,"16.2":0.00967,"16.3":0.02256,"16.4":0.00967,"16.5":0.05801,"16.6":0.05157},G:{"8":0,"17":0.02575,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00089,"5.0-5.1":0.00622,"6.0-6.1":0.00178,"7.0-7.1":0.00089,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00977,"10.0-10.2":0,"10.3":0.00799,"11.0-11.2":0.00178,"11.3-11.4":0,"12.0-12.1":0.00799,"12.2-12.5":0.15629,"13.0-13.1":0.00444,"13.2":0.00355,"13.3":0.01421,"13.4-13.7":0.02486,"14.0-14.4":0.11988,"14.5-14.8":0.19003,"15.0-15.1":0.08969,"15.2-15.3":0.10301,"15.4":0.16073,"15.5":0.20602,"15.6-15.7":1.04252,"16.0":0.58076,"16.1":0.62249,"16.2":0.37651,"16.3":0.77345,"16.4":0.25575,"16.5":1.54691,"16.6":2.53703},P:{"4":0.1314,"20":0.07075,"21":0.20215,"22":1.01074,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.05054,"8.2":0,"9.2":0.01011,"10.1":0,"11.1-11.2":0.03032,"12.0":0.01011,"13.0":0.02021,"14.0":0.02021,"15.0":0.01011,"16.0":0.04043,"17.0":0.05054,"18.0":0.04043,"19.0":0.07075},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.05322},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01289,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":75.35368},R:{_:"0"},M:{"0":0.08132},Q:{"13.1":0.00678},O:{"0":1.20631},H:{"0":0.96882}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.02533,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00362,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00362,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00362,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00362,"100":0,"101":0,"102":0.00362,"103":0,"104":0,"105":0.00362,"106":0.00362,"107":0.00362,"108":0.00362,"109":0.00362,"110":0.00362,"111":0.00362,"112":0.00362,"113":0.01448,"114":0.00724,"115":0.12305,"116":0.05067,"117":0.72742,"118":0.06876,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00362,"69":0.00362,"70":0.00362,"71":0.00362,"72":0.00362,"73":0,"74":0.00362,"75":0.00362,"76":0,"77":0,"78":0.00362,"79":0.01086,"80":0.00724,"81":0.00724,"83":0.00362,"84":0.00362,"85":0.00362,"86":0.00362,"87":0.00724,"88":0.00724,"89":0.00724,"90":0.00724,"91":0.00362,"92":0.00362,"93":0.00362,"94":0.00362,"95":0.00362,"96":0.00362,"97":0.00362,"98":0.00362,"99":0.01448,"100":0.01086,"101":0.00362,"102":0.00724,"103":0.0181,"104":0.00724,"105":0.01086,"106":0.01086,"107":0.01448,"108":0.0181,"109":0.69847,"110":0.01086,"111":0.02895,"112":0.02533,"113":0.02533,"114":0.10133,"115":0.1339,"116":6.76391,"117":1.61769,"118":0.00362,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01086,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.01086,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00724,"70":0.01086,"71":0.01448,"72":0.13028,"73":0.03257,"74":0,"75":0,"76":0,"77":0.01448,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01086,"96":0,"97":0,"98":0,"99":0,"100":0.01448,"101":0.06876,"102":0.06876,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00362,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00362,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00362,"109":0.01448,"110":0,"111":0,"112":0.00362,"113":0.00362,"114":0.01086,"115":0.0181,"116":0.61161,"117":0.50304},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00724,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01086,"6.1":0,"7.1":0,"9.1":0.01086,"10.1":0,"11.1":0,"12.1":0.00362,"13.1":0.01448,"14.1":0.02533,"15.1":0.00724,"15.2-15.3":0.00362,"15.4":0.00724,"15.5":0.00724,"15.6":0.03619,"16.0":0.00724,"16.1":0.0181,"16.2":0.01086,"16.3":0.02533,"16.4":0.01448,"16.5":0.03619,"16.6":0.10495,"17.0":0.00724,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00093,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0093,"10.0-10.2":0.00093,"10.3":0.00744,"11.0-11.2":0.00372,"11.3-11.4":0.00093,"12.0-12.1":0.00744,"12.2-12.5":0.14418,"13.0-13.1":0.00465,"13.2":0.00465,"13.3":0.0679,"13.4-13.7":0.02697,"14.0-14.4":0.1172,"14.5-14.8":0.1851,"15.0-15.1":0.0893,"15.2-15.3":0.10511,"15.4":0.16185,"15.5":0.21022,"15.6-15.7":1.06597,"16.0":0.5488,"16.1":0.62414,"16.2":0.36276,"16.3":0.69018,"16.4":0.22789,"16.5":0.54322,"16.6":3.67322,"17.0":0.3423,"17.1":0},P:{"4":0.09196,"20":0.0613,"21":0.13283,"22":1.06261,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.05109,"8.2":0,"9.2":0.01022,"10.1":0,"11.1-11.2":0.02043,"12.0":0.01022,"13.0":0.02043,"14.0":0.02043,"15.0":0.01022,"16.0":0.03065,"17.0":0.04087,"18.0":0.04087,"19.0":0.0613},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.04362},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02533,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":71.88824},R:{_:"0"},M:{"0":0.08933},Q:{"13.1":0},O:{"0":1.59525},H:{"0":0.92429}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IE.js
index a85a352068a933..bd4c61fbcbd341 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00321,"53":0.08336,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00321,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00641,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00321,"85":0,"86":0,"87":0,"88":0.00321,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00641,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01924,"103":0,"104":0,"105":0.00321,"106":0.00321,"107":0.01282,"108":0.02885,"109":0,"110":0.00321,"111":0.00321,"112":0.00321,"113":0.00962,"114":0.01282,"115":0.15068,"116":0.46487,"117":0.01603,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00321,"39":0,"40":0,"41":0.00321,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00641,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00321,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.08977,"75":0.09618,"76":0.00321,"77":0,"78":0,"79":0.02244,"80":0.00321,"81":0.08656,"83":0,"84":0.00321,"85":0.00321,"86":0.00321,"87":0.01282,"88":0.01282,"89":0.01282,"90":0,"91":0.00321,"92":0.00321,"93":0.00962,"94":0,"95":0.00321,"96":0.00321,"97":0.00321,"98":0.00321,"99":0.00321,"100":0.00321,"101":0,"102":0.00321,"103":0.03847,"104":0.00321,"105":0.0513,"106":0.08336,"107":0.00962,"108":0.00962,"109":0.19236,"110":0.01282,"111":0.01282,"112":0.06412,"113":0.04168,"114":0.59311,"115":3.05852,"116":1.67674,"117":0.00321,"118":0.00321,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00321,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00641,"72":0.00962,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00321,"95":0.00962,"96":0,"97":0,"98":0,"99":0.00321,"100":0.14106,"101":0.07374,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00321},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00321,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00321,"109":0.00962,"110":0.00321,"111":0,"112":0.01282,"113":0.00321,"114":0.08015,"115":0.89447,"116":0.32381},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00321,"9":0,"10":0,"11":0,"12":0,"13":0.00321,"14":0.02565,"15":0.00321,"17":0.00321,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00641,"13.1":0.02885,"14.1":0.05771,"15.1":0.00641,"15.2-15.3":0.00641,"15.4":0.01603,"15.5":0.02244,"15.6":0.13786,"16.0":0.01282,"16.1":0.02885,"16.2":0.04168,"16.3":0.109,"16.4":0.02885,"16.5":0.25648,"16.6":0.35587},G:{"8":0,"17":0.15764,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.06449,"8.1-8.4":0.02508,"9.0-9.2":0,"9.3":0.0824,"10.0-10.2":0.00358,"10.3":0.11465,"11.0-11.2":0.3941,"11.3-11.4":0.01791,"12.0-12.1":0.01075,"12.2-12.5":0.79536,"13.0-13.1":0.00717,"13.2":0.01075,"13.3":0.02508,"13.4-13.7":0.06091,"14.0-14.4":0.1648,"14.5-14.8":0.50516,"15.0-15.1":0.13972,"15.2-15.3":0.18988,"15.4":0.20063,"15.5":0.34752,"15.6-15.7":2.74792,"16.0":1.22886,"16.1":2.98796,"16.2":1.2217,"16.3":2.54729,"16.4":0.35827,"16.5":6.54199,"16.6":14.8574},P:{"4":0.04174,"20":0.12523,"21":0.34438,"22":3.84039,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03131,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02087,"12.0":0,"13.0":0.02087,"14.0":0.02087,"15.0":0.01044,"16.0":0.03131,"17.0":0.03131,"18.0":0.03131,"19.0":0.08349},I:{"0":0,"3":0,"4":0.04509,"2.1":0,"2.2":0,"2.3":0,"4.1":0.09018,"4.2-4.3":0.03006,"4.4":0,"4.4.3-4.4.4":0.24047},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00641,"9":0.06091,"10":0,"11":0.02244,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":46.33654},R:{_:"0"},M:{"0":0.57749},Q:{"13.1":0},O:{"0":0.04756},H:{"0":0.27015}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00351,"53":0.07024,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00702,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00351,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00702,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01405,"103":0.00351,"104":0,"105":0,"106":0.00351,"107":0.02458,"108":0.01756,"109":0,"110":0.00351,"111":0.00351,"112":0.00351,"113":0.01054,"114":0.00351,"115":0.04214,"116":0.04214,"117":0.53734,"118":0.04566,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00351,"39":0.00702,"40":0.00351,"41":0.00702,"42":0.00351,"43":0.00351,"44":0.00702,"45":0.00702,"46":0.00351,"47":0.00351,"48":0.00351,"49":0.01405,"50":0.00351,"51":0.00702,"52":0.00351,"53":0.00702,"54":0.00351,"55":0.00351,"56":0.00351,"57":0.00351,"58":0.00351,"59":0.00351,"60":0.00351,"61":0,"62":0,"63":0.00702,"64":0,"65":0.00351,"66":0,"67":0,"68":0,"69":0,"70":0.00351,"71":0,"72":0,"73":0,"74":0.22126,"75":0.0281,"76":0.00351,"77":0,"78":0,"79":0.01756,"80":0.00351,"81":0.09834,"83":0.00351,"84":0.00351,"85":0.00351,"86":0,"87":0.01405,"88":0.00351,"89":0.01405,"90":0.00351,"91":0.00702,"92":0.00351,"93":0.01054,"94":0.00351,"95":0,"96":0.00702,"97":0.00351,"98":0,"99":0.00351,"100":0.00351,"101":0.00351,"102":0.00702,"103":0.04214,"104":0.00702,"105":0.05268,"106":0.01054,"107":0.01054,"108":0.01405,"109":0.2037,"110":0.01054,"111":0.01405,"112":0.0281,"113":0.0281,"114":0.18614,"115":0.18614,"116":4.57614,"117":1.48558,"118":0.00351,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00351,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01054,"73":0.00351,"74":0,"75":0,"76":0,"77":0.00702,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00702,"96":0,"97":0,"98":0,"99":0.00351,"100":0.03512,"101":0.08078,"102":0.13346,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00351,"109":0.01054,"110":0.00351,"111":0.00351,"112":0.00702,"113":0.00351,"114":0.02458,"115":0.03863,"116":0.80074,"117":0.6743},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00351,"14":0.04917,"15":0.00351,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00351,"13.1":0.03161,"14.1":0.07024,"15.1":0.01054,"15.2-15.3":0.01054,"15.4":0.02458,"15.5":0.02458,"15.6":0.17911,"16.0":0.01756,"16.1":0.03863,"16.2":0.06322,"16.3":0.16858,"16.4":0.03863,"16.5":0.10536,"16.6":0.75508,"17.0":0.03161,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.06376,"8.1-8.4":0.01875,"9.0-9.2":0,"9.3":0.12001,"10.0-10.2":0,"10.3":0.09376,"11.0-11.2":0.21377,"11.3-11.4":0.01875,"12.0-12.1":0.01125,"12.2-12.5":0.80256,"13.0-13.1":0,"13.2":0.015,"13.3":0.01875,"13.4-13.7":0.05625,"14.0-14.4":0.18001,"14.5-14.8":0.50254,"15.0-15.1":0.11251,"15.2-15.3":0.19127,"15.4":0.16126,"15.5":0.34503,"15.6-15.7":2.67772,"16.0":1.31636,"16.1":2.74522,"16.2":1.14759,"16.3":2.23893,"16.4":0.26252,"16.5":1.01633,"16.6":21.25296,"17.0":1.49637,"17.1":0},P:{"4":0.03119,"20":0.09357,"21":0.19753,"22":3.73232,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.02079,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0104,"12.0":0,"13.0":0.02079,"14.0":0.02079,"15.0":0.0104,"16.0":0.04159,"17.0":0.03119,"18.0":0.03119,"19.0":0.07278},I:{"0":0,"3":0,"4":0.03475,"2.1":0,"2.2":0,"2.3":0.05792,"4.1":0.01158,"4.2-4.3":0.03475,"4.4":0,"4.4.3-4.4.4":0.2085},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00351,"9":0.06322,"10":0,"11":0.02107,"5.5":0},S:{"2.5":0.00649,_:"3.0-3.1"},J:{"7":0,"10":0.00649},N:{"10":0,"11":0},L:{"0":43.34356},R:{_:"0"},M:{"0":0.51255},Q:{"13.1":0},O:{"0":0.03244},H:{"0":0.2457}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IL.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IL.js
index aa781e0976c286..ef28b2cf30da26 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IL.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IL.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00366,"25":0.00366,"26":0.01097,"27":0.00366,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00366,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00731,"53":0,"54":0,"55":0,"56":0.00731,"57":0,"58":0,"59":0.00731,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00366,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00366,"79":0.08777,"80":0.01097,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00731,"103":0,"104":0,"105":0.00366,"106":0,"107":0,"108":0,"109":0.00366,"110":0.00366,"111":0.00366,"112":0.00366,"113":0.01463,"114":0.00731,"115":0.14262,"116":0.34376,"117":0.01097,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0.00366,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.01829,"32":0.00366,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00731,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00366,"50":0,"51":0,"52":0.01463,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00366,"66":0.03291,"67":0,"68":0.00731,"69":0.00366,"70":0.00366,"71":0.00366,"72":0.00366,"73":0.00366,"74":0.00731,"75":0.00366,"76":0.00366,"77":0.00366,"78":0.00731,"79":0.04023,"80":0.04388,"81":0.01463,"83":0.00731,"84":0.00731,"85":0.00731,"86":0.01097,"87":0.01463,"88":0.00731,"89":0.00731,"90":0.00731,"91":0.00366,"92":0.00366,"93":0,"94":0.00366,"95":0.00366,"96":0.00366,"97":0.00366,"98":0.00366,"99":0.00366,"100":0.00366,"101":0,"102":0.01097,"103":0.01829,"104":0.00731,"105":0.00366,"106":0.01829,"107":0.01097,"108":0.02194,"109":0.54489,"110":0.01463,"111":0.01463,"112":0.02926,"113":0.04754,"114":0.43518,"115":5.69029,"116":2.73909,"117":0.00366,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00366,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00366,"72":0.00366,"73":0,"74":0,"75":0,"76":0,"77":0.00366,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01097,"96":0,"97":0,"98":0,"99":0.00366,"100":0.12434,"101":0.12068,"102":0.00366,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00366,"18":0.00366,"79":0,"80":0,"81":0,"83":0,"84":0.00366,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00366,"104":0.00366,"105":0,"106":0,"107":0.00366,"108":0.00366,"109":0.0256,"110":0.00366,"111":0.00366,"112":0.00366,"113":0.00731,"114":0.06217,"115":0.77528,"116":0.24868},E:{"4":0,"5":0,"6":0,"7":0.00366,"8":0.06217,"9":0,"10":0,"11":0,"12":0,"13":0.00366,"14":0.01097,"15":0.00366,"17":0.00366,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0.00366,"7.1":0,"9.1":0.02194,"10.1":0,"11.1":0.00731,"12.1":0,"13.1":0.00731,"14.1":0.02926,"15.1":0.00366,"15.2-15.3":0.00366,"15.4":0.00366,"15.5":0.01097,"15.6":0.06217,"16.0":0.00731,"16.1":0.01463,"16.2":0.01463,"16.3":0.04023,"16.4":0.01097,"16.5":0.1024,"16.6":0.17188},G:{"8":0,"17":0.15531,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00216,"7.0-7.1":0.01294,"8.1-8.4":0.00863,"9.0-9.2":0,"9.3":0.07118,"10.0-10.2":0.01079,"10.3":0.07334,"11.0-11.2":0.01941,"11.3-11.4":0.02157,"12.0-12.1":0.02804,"12.2-12.5":0.261,"13.0-13.1":0.01079,"13.2":0.00863,"13.3":0.02588,"13.4-13.7":0.06471,"14.0-14.4":0.20276,"14.5-14.8":0.42925,"15.0-15.1":0.06903,"15.2-15.3":0.10569,"15.4":0.13374,"15.5":0.23296,"15.6-15.7":1.33305,"16.0":0.79379,"16.1":1.22951,"16.2":0.64495,"16.3":1.32227,"16.4":0.19845,"16.5":4.2127,"16.6":9.87493},P:{"4":0.08208,"20":0.19495,"21":0.52328,"22":5.07892,"5.0-5.4":0.01026,"6.2-6.4":0,"7.2-7.4":0.01026,"8.2":0,"9.2":0.02052,"10.1":0,"11.1-11.2":0.06156,"12.0":0.01026,"13.0":0.0513,"14.0":0.0513,"15.0":0.02052,"16.0":0.04104,"17.0":0.06156,"18.0":0.07182,"19.0":0.12313},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02764,"4.4":0,"4.4.3-4.4.4":0.0599},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00366,"9":0.00366,"10":0.00366,"11":0.04388,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":55.74271},R:{_:"0"},M:{"0":0.20932},Q:{"13.1":0},O:{"0":0.03806},H:{"0":0.27023}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.0036,"25":0.0036,"26":0.01079,"27":0.0036,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.0036,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00719,"53":0,"54":0,"55":0,"56":0.00719,"57":0,"58":0,"59":0.00719,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0036,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0036,"79":0.0863,"80":0.00719,"81":0,"82":0,"83":0.0036,"84":0.0036,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00719,"103":0,"104":0,"105":0.0036,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.0036,"113":0.01079,"114":0.0036,"115":0.06113,"116":0.02877,"117":0.37039,"118":0.02877,"119":0,"120":0,"3.5":0,"3.6":0.0036},D:{"4":0.0036,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.01798,"32":0.0036,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.0036,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0036,"50":0,"51":0,"52":0.01798,"53":0,"54":0,"55":0,"56":0,"57":0.00719,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.0036,"66":0.03236,"67":0,"68":0.00719,"69":0.0036,"70":0.0036,"71":0.0036,"72":0.0036,"73":0.00719,"74":0.00719,"75":0.0036,"76":0.0036,"77":0.00719,"78":0.00719,"79":0.03596,"80":0.04675,"81":0.01079,"83":0.00719,"84":0.00719,"85":0.00719,"86":0.00719,"87":0.01438,"88":0.0036,"89":0.01798,"90":0.01438,"91":0.0036,"92":0.0036,"93":0,"94":0.0036,"95":0.0036,"96":0.0036,"97":0.01079,"98":0.0036,"99":0.0036,"100":0.0036,"101":0.01438,"102":0.01079,"103":0.02158,"104":0.00719,"105":0.01438,"106":0.01798,"107":0.01438,"108":0.02517,"109":0.48546,"110":0.0036,"111":0.01438,"112":0.02158,"113":0.01798,"114":0.09709,"115":0.19418,"116":6.36492,"117":1.76564,"118":0.0036,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0036,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0036,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0.01079,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.0036,"73":0,"74":0.01438,"75":0,"76":0,"77":0.01798,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01079,"96":0,"97":0,"98":0,"99":0.0036,"100":0.02158,"101":0.10069,"102":0.14744,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00719,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.0036,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.01798,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.0036,"109":0.01798,"110":0.0036,"111":0,"112":0.05034,"113":0.0036,"114":0.03596,"115":0.03236,"116":0.55738,"117":0.39916},E:{"4":0,"5":0,"6":0,"7":0.0036,"8":0.05754,"9":0,"10":0,"11":0,"12":0,"13":0.0036,"14":0.00719,"15":0.0036,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0.0036,"7.1":0,"9.1":0.01438,"10.1":0,"11.1":0.00719,"12.1":0,"13.1":0.00719,"14.1":0.02877,"15.1":0.0036,"15.2-15.3":0.0036,"15.4":0.0036,"15.5":0.01079,"15.6":0.04315,"16.0":0.00719,"16.1":0.01079,"16.2":0.01079,"16.3":0.03236,"16.4":0.01079,"16.5":0.02517,"16.6":0.25891,"17.0":0.02158,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00235,"6.0-6.1":0,"7.0-7.1":0.01176,"8.1-8.4":0.00706,"9.0-9.2":0,"9.3":0.05175,"10.0-10.2":0.0047,"10.3":0.06586,"11.0-11.2":0.02117,"11.3-11.4":0.01647,"12.0-12.1":0.03058,"12.2-12.5":0.25404,"13.0-13.1":0.00941,"13.2":0.00941,"13.3":0.80212,"13.4-13.7":0.04469,"14.0-14.4":0.17877,"14.5-14.8":0.45634,"15.0-15.1":0.06586,"15.2-15.3":0.09644,"15.4":0.11761,"15.5":0.22346,"15.6-15.7":1.55013,"16.0":0.71508,"16.1":1.15025,"16.2":0.5716,"16.3":1.07498,"16.4":0.15054,"16.5":0.58571,"16.6":13.5748,"17.0":1.40194,"17.1":0.00235},P:{"4":0.07153,"20":0.14306,"21":0.29634,"22":5.12967,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.02044,"10.1":0,"11.1-11.2":0.05109,"12.0":0.01022,"13.0":0.05109,"14.0":0.03066,"15.0":0.01022,"16.0":0.04087,"17.0":0.04087,"18.0":0.07153,"19.0":0.10218},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.04421,"4.4":0,"4.4.3-4.4.4":0.05894},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0036,"9":0.0036,"10":0.0036,"11":0.07552,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":54.95709},R:{_:"0"},M:{"0":0.18572},Q:{"13.1":0},O:{"0":0.03202},H:{"0":0.27283}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IM.js
index 2a0fab08a08ebc..fd033ca4a8becc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IM.js
@@ -1 +1 @@
-module.exports={C:{"2":0.00493,"3":0.00493,"4":0.00493,"5":0.00493,"6":0.00493,"7":0,"8":0,"9":0,"10":0,"11":0.00493,"12":0.00493,"13":0,"14":0.00493,"15":0.00493,"16":0,"17":0.00493,"18":0,"19":0.00493,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00493,"27":0,"28":0.00493,"29":0,"30":0,"31":0.00493,"32":0,"33":0.00493,"34":0.00986,"35":0.00493,"36":0,"37":0.00493,"38":0.00493,"39":0.00493,"40":0.00986,"41":0.00493,"42":0.00493,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01972,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00493,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00493,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00986,"103":0.02959,"104":0.0641,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00493,"113":0.00493,"114":0,"115":0.17259,"116":0.67555,"117":0.01479,"118":0,"119":0,"120":0,"3.5":0.00493,"3.6":0.00986},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0.00493,"20":0,"21":0.00493,"22":0,"23":0.00493,"24":0,"25":0,"26":0,"27":0,"28":0.00493,"29":0,"30":0,"31":0.00986,"32":0,"33":0.00493,"34":0.00493,"35":0,"36":0.00493,"37":0.00493,"38":0.00493,"39":0.01479,"40":0.00986,"41":0.01479,"42":0.00986,"43":0.02466,"44":0.04438,"45":0.02959,"46":0.02466,"47":0.01479,"48":0,"49":0.00493,"50":0,"51":0.02466,"52":0,"53":0,"54":0,"55":0.00493,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.0641,"68":0,"69":0,"70":0.00493,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00493,"77":0,"78":0,"79":0,"80":0.05424,"81":0,"83":0,"84":0,"85":0.00493,"86":0.01972,"87":0.05917,"88":0.02466,"89":0,"90":0,"91":0.04931,"92":0.00493,"93":0.00493,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00493,"102":0.00493,"103":0.07397,"104":0.01972,"105":0.24162,"106":0,"107":0,"108":0.00986,"109":0.46845,"110":0.00986,"111":0.02466,"112":0.01972,"113":0.02466,"114":1.32644,"115":4.26532,"116":2.30278,"117":0,"118":0,"119":0},F:{"9":0,"11":0.00493,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00986,"31":0.00986,"32":0.00493,"33":0.00493,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.38462,"101":0.34517,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0.00493,"11.6":0,"12.1":0.00986},B:{"12":0.00986,"13":0.00493,"14":0.01972,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.00493,"88":0,"89":0,"90":0,"91":0.00493,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00986,"108":0,"109":0.05917,"110":0,"111":0,"112":0,"113":0.00986,"114":0.15779,"115":3.17556,"116":1.11441},E:{"4":0,"5":0.00493,"6":0,"7":0,"8":0.00493,"9":0.03452,"10":0,"11":0,"12":0.00493,"13":0.01479,"14":0.09369,"15":0.00986,"17":0.01479,_:"0","3.1":0,"3.2":0,"5.1":0.00493,"6.1":0,"7.1":0.00493,"9.1":0,"10.1":0,"11.1":0,"12.1":0.2219,"13.1":0.09369,"14.1":0.08876,"15.1":0.01972,"15.2-15.3":0.03452,"15.4":0.01479,"15.5":0.0789,"15.6":1.23768,"16.0":0.01479,"16.1":0.03945,"16.2":0.0789,"16.3":0.25148,"16.4":0.19231,"16.5":1.85406,"16.6":1.9083},G:{"8":0.01317,"17":0.35132,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01317,"6.0-6.1":0.01757,"7.0-7.1":0.08344,"8.1-8.4":0.14492,"9.0-9.2":0.01317,"9.3":0.58407,"10.0-10.2":0.00878,"10.3":0.12735,"11.0-11.2":0.3118,"11.3-11.4":0.00878,"12.0-12.1":0.07026,"12.2-12.5":1.03639,"13.0-13.1":0.00878,"13.2":0,"13.3":0,"13.4-13.7":0.00439,"14.0-14.4":0.30741,"14.5-14.8":0.44354,"15.0-15.1":0.27666,"15.2-15.3":0.18444,"15.4":0.28106,"15.5":0.68507,"15.6-15.7":3.02575,"16.0":1.12862,"16.1":2.16062,"16.2":0.92661,"16.3":2.10792,"16.4":0.43476,"16.5":8.83571,"16.6":20.29753},P:{"4":0.06452,"20":0.12904,"21":0.33334,"5.0-5.4":0.01075,"6.2-6.4":0.04301,"7.2-7.4":0.01075,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01075,"18.0":0.01075,"19.0":0.04301},I:{"0":0,"3":0.01075,"4":0.17852,"2.1":0.02366,"2.2":0.06667,"2.3":0.12044,"4.1":0.1269,"4.2-4.3":0.23228,"4.4":0,"4.4.3-4.4.4":0.49253},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00986,"7":0.02466,"8":0.2071,"9":0.03945,"10":0.04438,"11":0.15286,"5.5":0.00493},S:{"2.5":0.01521,_:"3.0-3.1"},J:{"7":0,"10":0.02535},N:{"10":0.07287,"11":0.04372},L:{"0":25.53165},R:{_:"0"},M:{"0":0.54745},Q:{"13.1":0},O:{"0":0.10645},H:{"0":0.10078}};
+module.exports={C:{"2":0.00503,"3":0.00503,"4":0.00503,"5":0.00503,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.00503,"13":0,"14":0.00503,"15":0.00503,"16":0,"17":0.00503,"18":0,"19":0,"20":0,"21":0.00503,"22":0,"23":0,"24":0.00503,"25":0.00503,"26":0.00503,"27":0.00503,"28":0.00503,"29":0.00503,"30":0.00503,"31":0,"32":0.00503,"33":0,"34":0.00503,"35":0.00503,"36":0.00503,"37":0.00503,"38":0.00503,"39":0.01508,"40":0.01508,"41":0.00503,"42":0.00503,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.03015,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01508,"69":0,"70":0,"71":0,"72":0.00503,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01508,"103":0.0201,"104":0.0804,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.13065,"116":0.0402,"117":0.77385,"118":0.05528,"119":0,"120":0,"3.5":0.00503,"3.6":0.01508},D:{"4":0.00503,"5":0,"6":0.00503,"7":0.00503,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00503,"15":0,"16":0,"17":0,"18":0,"19":0.00503,"20":0.00503,"21":0.00503,"22":0,"23":0,"24":0,"25":0,"26":0.00503,"27":0,"28":0.00503,"29":0,"30":0.00503,"31":0.01005,"32":0,"33":0.00503,"34":0,"35":0.00503,"36":0.00503,"37":0.01005,"38":0.00503,"39":0.01508,"40":0.00503,"41":0.01005,"42":0.01508,"43":0.0201,"44":0.03518,"45":0.03015,"46":0.02513,"47":0.01508,"48":0,"49":0,"50":0,"51":0.02513,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00503,"66":0,"67":0.05025,"68":0,"69":0,"70":0.01005,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00503,"77":0.00503,"78":0,"79":0.01005,"80":0.03015,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.00503,"88":0,"89":0,"90":0.00503,"91":0,"92":0.00503,"93":0.0201,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.01508,"100":0,"101":0,"102":0.00503,"103":0.06533,"104":0.02513,"105":0.3819,"106":0,"107":0,"108":0.02513,"109":0.3819,"110":0.00503,"111":0.0201,"112":0.02513,"113":0.02513,"114":0.201,"115":0.43215,"116":5.83403,"117":1.81905,"118":0,"119":0,"120":0},F:{"9":0,"11":0.00503,"12":0.00503,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0.00503,"28":0,"29":0.00503,"30":0.00503,"31":0.01508,"32":0.00503,"33":0.00503,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.01005,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00503,"96":0,"97":0,"98":0,"99":0,"100":0.05025,"101":0.25125,"102":0.33165,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01005},B:{"12":0.00503,"13":0,"14":0.02513,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.01508,"105":0,"106":0,"107":0.01508,"108":0.00503,"109":0.01508,"110":0,"111":0,"112":0.00503,"113":0.00503,"114":0.0201,"115":0.13065,"116":2.5326,"117":2.2512},E:{"4":0,"5":0.00503,"6":0,"7":0.00503,"8":0.01005,"9":0.04523,"10":0,"11":0,"12":0,"13":0,"14":0.11558,"15":0.00503,_:"0","3.1":0,"3.2":0,"5.1":0.00503,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.21608,"13.1":0.07035,"14.1":0.11558,"15.1":0.0402,"15.2-15.3":0.03518,"15.4":0.01508,"15.5":0.05025,"15.6":2.18588,"16.0":0.0201,"16.1":0.03518,"16.2":0.06533,"16.3":0.29145,"16.4":0.13568,"16.5":0.2814,"16.6":2.59793,"17.0":0.06533,"17.1":0},G:{"8":0.0174,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.01305,"5.0-5.1":0.0174,"6.0-6.1":0.0087,"7.0-7.1":0.06524,"8.1-8.4":0.11743,"9.0-9.2":0.0087,"9.3":0.33489,"10.0-10.2":0,"10.3":0.06524,"11.0-11.2":0.36533,"11.3-11.4":0.0087,"12.0-12.1":0.09568,"12.2-12.5":0.93942,"13.0-13.1":0,"13.2":0,"13.3":0.0087,"13.4-13.7":0,"14.0-14.4":0.07828,"14.5-14.8":0.53495,"15.0-15.1":0.30009,"15.2-15.3":0.13047,"15.4":0.30879,"15.5":0.83504,"15.6-15.7":2.3094,"16.0":1.0264,"16.1":2.28766,"16.2":0.94377,"16.3":1.86144,"16.4":0.44796,"16.5":0.97856,"16.6":26.76471,"17.0":2.15283,"17.1":0.00435},P:{"4":0.04277,"20":0.09624,"21":0.19248,"22":2.24561,"5.0-5.4":0.01069,"6.2-6.4":0.04277,"7.2-7.4":0.02139,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.08555,"14.0":0,"15.0":0,"16.0":0.01069,"17.0":0.01069,"18.0":0,"19.0":0.03208},I:{"0":0,"3":0.02226,"4":0.27374,"2.1":0.01335,"2.2":0.08012,"2.3":0.13576,"4.1":0.10237,"4.2-4.3":0.26038,"4.4":0,"4.4.3-4.4.4":0.53412},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.01025,"7":0.02049,"8":0.19466,"9":0.04098,"10":0.04098,"11":0.21003,"5.5":0},S:{"2.5":0.0199,_:"3.0-3.1"},J:{"7":0,"10":0.02985},N:{"10":0.0796,"11":0.0398},L:{"0":25.85533},R:{_:"0"},M:{"0":0.55223},Q:{"13.1":0},O:{"0":0.08458},H:{"0":0.10362}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IN.js
index 959322837ed1ab..261029b06a9619 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00217,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00217,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00433,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00217,"109":0,"110":0.00217,"111":0.00217,"112":0.00217,"113":0.00433,"114":0.00433,"115":0.08877,"116":0.11475,"117":0.0065,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00217,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00217,"67":0,"68":0,"69":0,"70":0.00217,"71":0.00217,"72":0,"73":0,"74":0.00217,"75":0,"76":0,"77":0,"78":0,"79":0.00217,"80":0.00217,"81":0.00433,"83":0.00217,"84":0,"85":0.00217,"86":0.00217,"87":0.0065,"88":0.00217,"89":0.00217,"90":0.00217,"91":0.00217,"92":0.00217,"93":0.00217,"94":0.00433,"95":0.00217,"96":0.00217,"97":0.00433,"98":0.00217,"99":0.00433,"100":0.00217,"101":0.00433,"102":0.00217,"103":0.01083,"104":0.0065,"105":0.0065,"106":0.00866,"107":0.0065,"108":0.01516,"109":0.58672,"110":0.00866,"111":0.02815,"112":0.02382,"113":0.03464,"114":0.19052,"115":1.69303,"116":0.89198,"117":0.00217,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00217,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00217,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00217,"64":0.00217,"65":0,"66":0,"67":0.00217,"68":0.00217,"69":0.01516,"70":0.03031,"71":0.16021,"72":0.11691,"73":0,"74":0.00217,"75":0.00217,"76":0.01083,"77":0.0065,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00433,"96":0,"97":0,"98":0,"99":0,"100":0.01516,"101":0.02165,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00217,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00433,"110":0,"111":0,"112":0,"113":0.00217,"114":0.00866,"115":0.1732,"116":0.0498},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0.00217,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00217,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00217,"14.1":0.00217,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00433,"16.0":0,"16.1":0.00217,"16.2":0.00217,"16.3":0.00433,"16.4":0.00217,"16.5":0.01516,"16.6":0.01732},G:{"8":0.00089,"17":0.08866,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0003,"6.0-6.1":0,"7.0-7.1":0.00922,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00446,"10.0-10.2":0,"10.3":0.00357,"11.0-11.2":0.00357,"11.3-11.4":0.00536,"12.0-12.1":0.00268,"12.2-12.5":0.04106,"13.0-13.1":0.00119,"13.2":0.00179,"13.3":0.00268,"13.4-13.7":0.00655,"14.0-14.4":0.02469,"14.5-14.8":0.03451,"15.0-15.1":0.02618,"15.2-15.3":0.01904,"15.4":0.01369,"15.5":0.0244,"15.6-15.7":0.22433,"16.0":0.06783,"16.1":0.10145,"16.2":0.08003,"16.3":0.16839,"16.4":0.09402,"16.5":0.66376,"16.6":1.25849},P:{"4":0.05116,"20":0.05116,"21":0.13301,"22":0.45019,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.04093,"8.2":0,"9.2":0.01023,"10.1":0,"11.1-11.2":0.01023,"12.0":0,"13.0":0.01023,"14.0":0.01023,"15.0":0.01023,"16.0":0.02046,"17.0":0.02046,"18.0":0.01023,"19.0":0.04093},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.03866},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0065,"5.5":0},S:{"2.5":0.39175,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":84.5528},R:{_:"0"},M:{"0":0.1332},Q:{"13.1":0},O:{"0":2.14679},H:{"0":2.9819}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00225,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00225,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00225,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00225,"112":0.00225,"113":0.00449,"114":0.00225,"115":0.06516,"116":0.01124,"117":0.13257,"118":0.01573,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00225,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00225,"67":0,"68":0.00225,"69":0.00225,"70":0.00225,"71":0.00225,"72":0.00225,"73":0.00225,"74":0.00449,"75":0.00225,"76":0.00225,"77":0.00225,"78":0.00225,"79":0.00449,"80":0.00449,"81":0.00449,"83":0.00449,"84":0.00225,"85":0.00225,"86":0.00449,"87":0.00674,"88":0.00449,"89":0.00225,"90":0.00449,"91":0.00449,"92":0.00225,"93":0.00225,"94":0.00449,"95":0.00225,"96":0.00225,"97":0.00449,"98":0.00225,"99":0.00225,"100":0.00225,"101":0.00449,"102":0.00225,"103":0.00899,"104":0.00674,"105":0.00674,"106":0.00899,"107":0.00674,"108":0.01348,"109":0.58871,"110":0.00674,"111":0.03146,"112":0.02022,"113":0.02696,"114":0.09213,"115":0.10336,"116":2.12342,"117":0.57973,"118":0.00449,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00225,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00225,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00225,"64":0.00225,"65":0,"66":0,"67":0.00225,"68":0.00225,"69":0.01124,"70":0.01573,"71":0.03146,"72":0.23818,"73":0.05168,"74":0.00225,"75":0,"76":0.00225,"77":0.04494,"78":0.00449,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00449,"96":0,"97":0,"98":0,"99":0,"100":0.00225,"101":0.01798,"102":0.01798,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00225,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00225,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00449,"110":0,"111":0,"112":0,"113":0,"114":0.00449,"115":0.00674,"116":0.13707,"117":0.08988},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01124,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00225,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00449,"16.0":0,"16.1":0.00225,"16.2":0.00225,"16.3":0.00225,"16.4":0.00225,"16.5":0.00674,"16.6":0.02696,"17.0":0.00449,"17.1":0},G:{"8":0.00059,"3.2":0.00029,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00913,"8.1-8.4":0,"9.0-9.2":0.00059,"9.3":0.0053,"10.0-10.2":0.00059,"10.3":0.00383,"11.0-11.2":0.00501,"11.3-11.4":0.00589,"12.0-12.1":0.00353,"12.2-12.5":0.04418,"13.0-13.1":0.00206,"13.2":0.00236,"13.3":0.00707,"13.4-13.7":0.00648,"14.0-14.4":0.02415,"14.5-14.8":0.03063,"15.0-15.1":0.02474,"15.2-15.3":0.01591,"15.4":0.01178,"15.5":0.02121,"15.6-15.7":0.21237,"16.0":0.05714,"16.1":0.08542,"16.2":0.06598,"16.3":0.12931,"16.4":0.06568,"16.5":0.18851,"16.6":1.51104,"17.0":0.37349,"17.1":0.00088},P:{"4":0.06112,"20":0.04075,"21":0.0815,"22":0.51954,"5.0-5.4":0,"6.2-6.4":0.01019,"7.2-7.4":0.04075,"8.2":0,"9.2":0.01019,"10.1":0,"11.1-11.2":0.01019,"12.0":0,"13.0":0.01019,"14.0":0.01019,"15.0":0.01019,"16.0":0.01019,"17.0":0.01019,"18.0":0.01019,"19.0":0.04075},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.04899},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00449,"5.5":0},S:{"2.5":0.44192,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":84.16933},R:{_:"0"},M:{"0":0.14731},Q:{"13.1":0},O:{"0":2.20185},H:{"0":3.0241}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IQ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IQ.js
index 853d4a2b9e2ebf..61d0c587bb1c8c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IQ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IQ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00275,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00275,"103":0,"104":0,"105":0,"106":0,"107":0.00275,"108":0,"109":0,"110":0.00275,"111":0,"112":0,"113":0,"114":0.00275,"115":0.08513,"116":0.10984,"117":0.00275,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00275,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00824,"39":0,"40":0,"41":0,"42":0,"43":0.01648,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00275,"57":0,"58":0.00275,"59":0,"60":0.00275,"61":0,"62":0,"63":0.00275,"64":0.00275,"65":0.00275,"66":0.00275,"67":0,"68":0.00275,"69":0.00275,"70":0.00275,"71":0.00275,"72":0,"73":0.00549,"74":0.00275,"75":0.00275,"76":0,"77":0,"78":0.00275,"79":0.03021,"80":0.00549,"81":0.01098,"83":0.01098,"84":0.00275,"85":0.00275,"86":0.00275,"87":0.00824,"88":0.00549,"89":0.00275,"90":0.00275,"91":0.00275,"92":0.00275,"93":0.00275,"94":0.00275,"95":0.01922,"96":0.00275,"97":0.00275,"98":0.01098,"99":0.01098,"100":0.00275,"101":0.00275,"102":0.00824,"103":0.04119,"104":0.00275,"105":0.00549,"106":0.00824,"107":0.00549,"108":0.01098,"109":0.63707,"110":0.00549,"111":0.00549,"112":0.00824,"113":0.00824,"114":0.10435,"115":1.72174,"116":1.01327,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00549,"70":0,"71":0.01648,"72":0.01922,"73":0,"74":0.00549,"75":0,"76":0,"77":0.00275,"78":0,"79":0.00549,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02197,"96":0,"97":0,"98":0,"99":0.00549,"100":0.08787,"101":0.10435,"102":0.00275,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00275,"18":0.00275,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00824,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00275,"108":0,"109":0.01098,"110":0,"111":0,"112":0,"113":0.00275,"114":0.06041,"115":0.38444,"116":0.10709},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00275,"14":0.01648,"15":0.00275,"17":0.01373,_:"0","3.1":0,"3.2":0,"5.1":0.06865,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00275,"14.1":0.11259,"15.1":0.00549,"15.2-15.3":0,"15.4":0.01373,"15.5":0.0357,"15.6":0.10984,"16.0":0.00549,"16.1":0.07963,"16.2":0.07414,"16.3":0.11808,"16.4":0.02471,"16.5":0.29931,"16.6":0.61785},G:{"8":0,"17":0.30165,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00868,"6.0-6.1":0,"7.0-7.1":0.15842,"8.1-8.4":0,"9.0-9.2":0.00217,"9.3":0.05425,"10.0-10.2":0.00434,"10.3":0.09115,"11.0-11.2":0.01953,"11.3-11.4":0.01085,"12.0-12.1":0.01953,"12.2-12.5":0.38195,"13.0-13.1":0.00434,"13.2":0.00434,"13.3":0.01736,"13.4-13.7":0.04774,"14.0-14.4":0.19748,"14.5-14.8":0.31467,"15.0-15.1":0.09332,"15.2-15.3":0.09766,"15.4":0.13238,"15.5":0.2257,"15.6-15.7":2.80384,"16.0":0.88325,"16.1":0.93968,"16.2":0.43186,"16.3":1.16103,"16.4":0.37978,"16.5":4.40975,"16.6":8.49397},P:{"4":0.10291,"20":0.1132,"21":0.25728,"22":2.36695,"5.0-5.4":0.01029,"6.2-6.4":0.01029,"7.2-7.4":0.10291,"8.2":0.01029,"9.2":0.02058,"10.1":0,"11.1-11.2":0.05146,"12.0":0.01029,"13.0":0.05146,"14.0":0.04116,"15.0":0.02058,"16.0":0.05146,"17.0":0.07204,"18.0":0.04116,"19.0":0.08233},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00429,"4.2-4.3":0.00857,"4.4":0,"4.4.3-4.4.4":0.19719},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02197,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.33027},R:{_:"0"},M:{"0":0.10881},Q:{"13.1":0.00725},O:{"0":0.50778},H:{"0":0.4464}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00272,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00543,"69":0.00815,"70":0.00272,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0.00272,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00272,"103":0,"104":0,"105":0,"106":0,"107":0.00272,"108":0.00272,"109":0,"110":0,"111":0,"112":0,"113":0.00272,"114":0,"115":0.05432,"116":0.00815,"117":0.1195,"118":0.01901,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00543,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00815,"39":0,"40":0,"41":0,"42":0,"43":0.02173,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00272,"57":0,"58":0.00543,"59":0,"60":0.00272,"61":0,"62":0,"63":0.00272,"64":0.00272,"65":0.00272,"66":0.00272,"67":0,"68":0.00815,"69":0.00272,"70":0.00543,"71":0,"72":0.00815,"73":0.00815,"74":0.00272,"75":0.00543,"76":0,"77":0,"78":0.00543,"79":0.02444,"80":0.00272,"81":0.01086,"83":0.01086,"84":0.00543,"85":0.00272,"86":0.01358,"87":0.00815,"88":0.00815,"89":0.01358,"90":0.00272,"91":0.00272,"92":0.00272,"93":0,"94":0.00272,"95":0.01901,"96":0.00543,"97":0.00543,"98":0.01358,"99":0.01086,"100":0.00272,"101":0.00272,"102":0.00815,"103":0.0842,"104":0.00272,"105":0.00543,"106":0.01086,"107":0.00815,"108":0.01086,"109":0.61382,"110":0.00543,"111":0.00815,"112":0.00815,"113":0.00815,"114":0.04074,"115":0.04889,"116":1.93651,"117":0.56221,"118":0.00543,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0.00272,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00272,"70":0,"71":0,"72":0.03259,"73":0.01086,"74":0.00272,"75":0,"76":0,"77":0.01358,"78":0,"79":0.00272,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00272,"92":0,"93":0.00272,"94":0,"95":0.02988,"96":0,"97":0,"98":0,"99":0.00272,"100":0.0163,"101":0.05975,"102":0.07605,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00272,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00543,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01901,"110":0,"111":0.00272,"112":0.00272,"113":0.00272,"114":0.01901,"115":0.01358,"116":0.30419,"117":0.18197},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00815,"15":0.00272,_:"0","3.1":0,"3.2":0,"5.1":0.06247,"6.1":0,"7.1":0,"9.1":0.00815,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00272,"14.1":0.02173,"15.1":0.00272,"15.2-15.3":0,"15.4":0.01901,"15.5":0.02444,"15.6":0.11679,"16.0":0.00272,"16.1":0.0516,"16.2":0.0516,"16.3":0.08691,"16.4":0.01901,"16.5":0.09234,"16.6":0.83924,"17.0":0.04617,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01216,"6.0-6.1":0,"7.0-7.1":0.22704,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0446,"10.0-10.2":0.00203,"10.3":0.04865,"11.0-11.2":0.01824,"11.3-11.4":0.01014,"12.0-12.1":0.01419,"12.2-12.5":0.36488,"13.0-13.1":0.00405,"13.2":0,"13.3":0.03041,"13.4-13.7":0.04662,"14.0-14.4":0.17231,"14.5-14.8":0.29191,"15.0-15.1":0.0669,"15.2-15.3":0.08717,"15.4":0.11757,"15.5":0.18041,"15.6-15.7":2.48527,"16.0":0.6649,"16.1":0.72369,"16.2":0.34664,"16.3":0.82302,"16.4":0.25542,"16.5":0.88383,"16.6":10.40325,"17.0":1.64806,"17.1":0},P:{"4":0.11396,"20":0.09324,"21":0.2072,"22":2.58999,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.09324,"8.2":0,"9.2":0.02072,"10.1":0,"11.1-11.2":0.04144,"12.0":0.01036,"13.0":0.0518,"14.0":0.03108,"15.0":0.02072,"16.0":0.0518,"17.0":0.07252,"18.0":0.04144,"19.0":0.07252},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01244,"4.4":0,"4.4.3-4.4.4":0.21151},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01358,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.0496},R:{_:"0"},M:{"0":0.13111},Q:{"13.1":0},O:{"0":0.42976},H:{"0":0.55168}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IR.js
index 6682d2fff56e37..3cc0c718ccb58b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00247,"51":0,"52":0.01235,"53":0,"54":0,"55":0,"56":0.00247,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00988,"69":0,"70":0,"71":0,"72":0.00247,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0.00247,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00247,"89":0.00247,"90":0.00247,"91":0.00247,"92":0.00247,"93":0.00247,"94":0.00494,"95":0.00247,"96":0.00247,"97":0.00247,"98":0.00247,"99":0.00494,"100":0.00494,"101":0.00494,"102":0.02222,"103":0.00494,"104":0.00741,"105":0.00741,"106":0.00741,"107":0.00741,"108":0.01235,"109":0.00988,"110":0.00988,"111":0.01481,"112":0.01481,"113":0.02469,"114":0.02963,"115":0.48886,"116":0.47652,"117":0.01481,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00247,"47":0,"48":0,"49":0.00247,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00247,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00247,"70":0.00247,"71":0.00494,"72":0.00247,"73":0,"74":0,"75":0,"76":0.00247,"77":0.00247,"78":0.00247,"79":0.00494,"80":0.00494,"81":0.00494,"83":0.00247,"84":0.00247,"85":0.00247,"86":0.00494,"87":0.00494,"88":0.00247,"89":0.00247,"90":0.00247,"91":0.00494,"92":0.00494,"93":0.00247,"94":0.00247,"95":0.00494,"96":0.00494,"97":0.00247,"98":0.00247,"99":0.00494,"100":0.00494,"101":0.00247,"102":0.00988,"103":0.01235,"104":0.00741,"105":0.00988,"106":0.01481,"107":0.01235,"108":0.02222,"109":1.04933,"110":0.00988,"111":0.00988,"112":0.01728,"113":0.01975,"114":0.10864,"115":1.54559,"116":1.00241,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00247,"73":0,"74":0.00247,"75":0.00247,"76":0.00494,"77":0.00247,"78":0,"79":0.00494,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01728,"96":0,"97":0,"98":0,"99":0.00247,"100":0.02716,"101":0.04444,"102":0.00247,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00247,"14":0,"15":0,"16":0,"17":0.00247,"18":0.00494,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00247,"90":0.00247,"91":0,"92":0.01481,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00247,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00247,"109":0.01975,"110":0.00247,"111":0.00247,"112":0.00247,"113":0.00247,"114":0.01235,"115":0.14567,"116":0.04444},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00247,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00247,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00494,"16.0":0,"16.1":0,"16.2":0,"16.3":0.00247,"16.4":0.00247,"16.5":0.00494,"16.6":0.00741},G:{"8":0,"17":0.03952,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.04785,"7.0-7.1":0.00277,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00347,"10.0-10.2":0.00139,"10.3":0.01317,"11.0-11.2":0.00347,"11.3-11.4":0.00485,"12.0-12.1":0.01248,"12.2-12.5":0.35364,"13.0-13.1":0.00901,"13.2":0.00555,"13.3":0.02358,"13.4-13.7":0.04091,"14.0-14.4":0.14146,"14.5-14.8":0.147,"15.0-15.1":0.11788,"15.2-15.3":0.12135,"15.4":0.11788,"15.5":0.15879,"15.6-15.7":1.18781,"16.0":0.2836,"16.1":0.32868,"16.2":0.26211,"16.3":0.42991,"16.4":0.45834,"16.5":1.2523,"16.6":1.36186},P:{"4":0.21145,"20":0.71491,"21":1.05726,"22":2.35619,"5.0-5.4":0.03021,"6.2-6.4":0.02014,"7.2-7.4":0.28194,"8.2":0.03021,"9.2":0.10069,"10.1":0.04028,"11.1-11.2":0.17118,"12.0":0.07048,"13.0":0.22152,"14.0":0.21145,"15.0":0.12083,"16.0":0.35242,"17.0":0.41284,"18.0":0.37256,"19.0":0.48332},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00399,"4.4":0,"4.4.3-4.4.4":0.01847},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.4543,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":76.22385},R:{_:"0"},M:{"0":0.9715},Q:{"13.1":0},O:{"0":0.05272},H:{"0":0.43492}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00691,"53":0,"54":0,"55":0,"56":0.0023,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00691,"69":0,"70":0,"71":0,"72":0.0023,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0.0023,"83":0,"84":0,"85":0.0023,"86":0,"87":0,"88":0.0023,"89":0.0023,"90":0.0023,"91":0.0023,"92":0.0023,"93":0.0023,"94":0.0046,"95":0.0023,"96":0.0023,"97":0.0023,"98":0.0023,"99":0.0023,"100":0.0023,"101":0.0023,"102":0.01611,"103":0.0023,"104":0.0046,"105":0.00691,"106":0.00691,"107":0.0046,"108":0.00921,"109":0.00691,"110":0.00691,"111":0.01151,"112":0.00921,"113":0.02762,"114":0.01611,"115":0.32228,"116":0.06906,"117":0.43738,"118":0.03223,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0023,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.0023,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0023,"70":0.0023,"71":0.0023,"72":0,"73":0.0023,"74":0,"75":0,"76":0,"77":0.0023,"78":0.0023,"79":0.0046,"80":0.0023,"81":0.0046,"83":0.0023,"84":0.0023,"85":0.0023,"86":0.0046,"87":0.0046,"88":0.0023,"89":0.0046,"90":0.0023,"91":0.0046,"92":0.0023,"93":0,"94":0.0023,"95":0.0046,"96":0.0046,"97":0.0023,"98":0.0023,"99":0.0046,"100":0.0046,"101":0.0046,"102":0.00921,"103":0.01151,"104":0.00691,"105":0.00921,"106":0.01381,"107":0.01381,"108":0.01842,"109":0.85174,"110":0.00691,"111":0.01151,"112":0.01611,"113":0.01381,"114":0.03913,"115":0.04834,"116":1.86922,"117":0.39134,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.0023,"73":0.0023,"74":0.0023,"75":0,"76":0.0023,"77":0.00921,"78":0,"79":0.0023,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01381,"96":0,"97":0,"98":0,"99":0.0023,"100":0.0046,"101":0.02993,"102":0.02993,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.0023,"13":0.0023,"14":0,"15":0,"16":0,"17":0,"18":0.0046,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.0023,"90":0.0023,"91":0,"92":0.01381,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0023,"101":0,"102":0,"103":0,"104":0,"105":0.0023,"106":0,"107":0.0023,"108":0.0023,"109":0.01842,"110":0.0023,"111":0.0023,"112":0.0023,"113":0.0023,"114":0.00691,"115":0.01151,"116":0.1128,"117":0.06215},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.0023,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.0046,"16.0":0,"16.1":0,"16.2":0,"16.3":0.0023,"16.4":0.0023,"16.5":0.0023,"16.6":0.00921,"17.0":0.0023,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0022,"8.1-8.4":0.00073,"9.0-9.2":0.00073,"9.3":0.00294,"10.0-10.2":0,"10.3":0.01027,"11.0-11.2":0.00294,"11.3-11.4":0.00367,"12.0-12.1":0.01394,"12.2-12.5":0.35666,"13.0-13.1":0.00734,"13.2":0.00514,"13.3":0.05651,"13.4-13.7":0.04477,"14.0-14.4":0.13283,"14.5-14.8":0.13356,"15.0-15.1":0.10935,"15.2-15.3":0.11742,"15.4":0.11081,"15.5":0.15264,"15.6-15.7":1.21454,"16.0":0.29501,"16.1":0.33905,"16.2":0.24438,"16.3":0.39775,"16.4":0.39849,"16.5":0.7823,"16.6":2.02693,"17.0":0.33611,"17.1":0},P:{"4":0.16122,"20":0.60458,"21":0.80611,"22":2.97254,"5.0-5.4":0.03023,"6.2-6.4":0.03023,"7.2-7.4":0.26199,"8.2":0.03023,"9.2":0.11084,"10.1":0.03023,"11.1-11.2":0.16122,"12.0":0.06046,"13.0":0.2116,"14.0":0.19145,"15.0":0.10076,"16.0":0.32245,"17.0":0.39298,"18.0":0.3426,"19.0":0.47359},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00415,"4.4":0,"4.4.3-4.4.4":0.01815},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.37523,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":76.68266},R:{_:"0"},M:{"0":1.02383},Q:{"13.1":0},O:{"0":0.06158},H:{"0":0.43728}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IS.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IS.js
index c3dc693a42d6d5..eab0f6c381dbba 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IS.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IS.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.0157,"49":0,"50":0,"51":0,"52":0.01046,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00523,"78":0.01046,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00523,"89":0,"90":0,"91":0.01046,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.01046,"100":0,"101":0,"102":0.15173,"103":0.01046,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00523,"110":0,"111":0,"112":0.03139,"113":0.02616,"114":0.03139,"115":0.3924,"116":1.20336,"117":0.05755,"118":0.00523,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00523,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00523,"50":0,"51":0,"52":0,"53":0.00523,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00523,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00523,"72":0.00523,"73":0.00523,"74":0,"75":0.00523,"76":0,"77":0,"78":0.00523,"79":0.0157,"80":0,"81":0.00523,"83":0,"84":0,"85":0.0157,"86":0,"87":0.02616,"88":0.01046,"89":0.00523,"90":0.01046,"91":0.00523,"92":0,"93":0,"94":0,"95":0.00523,"96":0,"97":0,"98":0,"99":0,"100":0.00523,"101":0.00523,"102":0,"103":0.10464,"104":0.00523,"105":0.0157,"106":0,"107":0.00523,"108":0.05232,"109":0.40286,"110":0.07325,"111":0.03662,"112":0.04709,"113":0.41333,"114":1.14581,"115":7.61779,"116":4.67218,"117":0.00523,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00523,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00523,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00523,"86":0,"87":0,"88":0,"89":0.01046,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04186,"96":0.00523,"97":0,"98":0,"99":0.02616,"100":0.59122,"101":0.36624,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00523,"105":0,"106":0,"107":0.00523,"108":0.00523,"109":0.0157,"110":0,"111":0.0157,"112":0.00523,"113":0.01046,"114":0.08371,"115":2.37533,"116":1.72656},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00523,"14":0.04186,"15":0.0157,"17":0.0157,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01046,"10.1":0,"11.1":0,"12.1":0.03139,"13.1":0.16219,"14.1":0.14126,"15.1":0.01046,"15.2-15.3":0.02616,"15.4":0.06278,"15.5":0.09941,"15.6":0.58075,"16.0":0.06278,"16.1":0.07848,"16.2":0.15173,"16.3":0.25637,"16.4":0.10464,"16.5":1.0307,"16.6":1.14058},G:{"8":0,"17":0.27267,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01298,"10.0-10.2":0,"10.3":0.09413,"11.0-11.2":0.01948,"11.3-11.4":0.00974,"12.0-12.1":0.01298,"12.2-12.5":0.25968,"13.0-13.1":0,"13.2":0,"13.3":0.00649,"13.4-13.7":0.05194,"14.0-14.4":0.08115,"14.5-14.8":0.29539,"15.0-15.1":0.05843,"15.2-15.3":0.0779,"15.4":0.05194,"15.5":0.27916,"15.6-15.7":1.38281,"16.0":1.32762,"16.1":3.45377,"16.2":1.11663,"16.3":1.93139,"16.4":0.26293,"16.5":6.38818,"16.6":14.99664},P:{"4":0.03075,"20":0.0205,"21":0.61504,"22":3.95677,"5.0-5.4":0.01025,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.01025,"11.1-11.2":0,"12.0":0,"13.0":0.03075,"14.0":0,"15.0":0.01025,"16.0":0,"17.0":0.0615,"18.0":0.0205,"19.0":0.0205},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.00599,"4.1":0.01796,"4.2-4.3":0.01796,"4.4":0,"4.4.3-4.4.4":0.02994},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00523,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":32.24821},R:{_:"0"},M:{"0":0.44819},Q:{"13.1":0.00477},O:{"0":0.04291},H:{"0":0.26181}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.02328,"49":0,"50":0,"51":0,"52":0.04074,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00582,"78":0.02328,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00582,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.10476,"103":0.00582,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00582,"110":0,"111":0,"112":0.01746,"113":0.02328,"114":0.01164,"115":0.15132,"116":0.15132,"117":1.2804,"118":0.15714,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00582,"50":0,"51":0,"52":0,"53":0.00582,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00582,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00582,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00582,"80":0,"81":0.00582,"83":0,"84":0,"85":0.01746,"86":0.00582,"87":0.0291,"88":0.00582,"89":0.00582,"90":0.01164,"91":0.00582,"92":0.01164,"93":0.00582,"94":0,"95":0.00582,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00582,"103":0.15132,"104":0.00582,"105":0.01746,"106":0.01164,"107":0.02328,"108":0.04656,"109":0.20952,"110":0.0582,"111":0.05238,"112":0.06984,"113":0.09312,"114":0.27354,"115":0.71004,"116":14.13096,"117":4.0449,"118":0.01164,"119":0.01164,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00582,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.02328,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00582,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04074,"96":0,"97":0,"98":0,"99":0.00582,"100":0.18042,"101":0.38994,"102":0.77988,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00582,"108":0.01746,"109":0.01746,"110":0,"111":0.00582,"112":0.00582,"113":0.01746,"114":0.03492,"115":0.1164,"116":1.68198,"117":1.37934},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00582,"14":0.05238,"15":0.04074,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.0291,"13.1":0.10476,"14.1":0.31428,"15.1":0.04074,"15.2-15.3":0.02328,"15.4":0.09894,"15.5":0.13968,"15.6":0.63438,"16.0":0.09894,"16.1":0.10476,"16.2":0.18624,"16.3":0.34338,"16.4":0.18624,"16.5":0.58782,"16.6":2.63064,"17.0":0.18042,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00655,"10.0-10.2":0,"10.3":0.06225,"11.0-11.2":0.02293,"11.3-11.4":0,"12.0-12.1":0.01638,"12.2-12.5":0.17037,"13.0-13.1":0,"13.2":0,"13.3":0.00328,"13.4-13.7":0.04259,"14.0-14.4":0.0557,"14.5-14.8":0.25882,"15.0-15.1":0.05242,"15.2-15.3":0.09829,"15.4":0.08846,"15.5":0.17037,"15.6-15.7":1.186,"16.0":1.43828,"16.1":1.99196,"16.2":0.89442,"16.3":1.6414,"16.4":0.17364,"16.5":0.72078,"16.6":21.51189,"17.0":1.81832,"17.1":0},P:{"4":0.0102,"20":0.0204,"21":0.19376,"22":3.47747,"5.0-5.4":0.0102,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.0102,"11.1-11.2":0,"12.0":0,"13.0":0.0204,"14.0":0.0102,"15.0":0,"16.0":0.0102,"17.0":0.0102,"18.0":0.0102,"19.0":0.0204},I:{"0":0,"3":0,"4":0.0152,"2.1":0,"2.2":0,"2.3":0.0152,"4.1":0.0152,"4.2-4.3":0.0076,"4.4":0,"4.4.3-4.4.4":0.06081},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02328,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":27.19972},R:{_:"0"},M:{"0":0.3762},Q:{"13.1":0.00418},O:{"0":0.02508},H:{"0":0.14246}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IT.js
index d7b27dc1d39566..ab4a3fef3dd789 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/IT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00379,"48":0.00379,"49":0,"50":0,"51":0,"52":0.02652,"53":0,"54":0,"55":0,"56":0.00379,"57":0,"58":0,"59":0.01136,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00379,"69":0,"70":0,"71":0,"72":0.00379,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01894,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00379,"88":0.00379,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0303,"103":0.00379,"104":0.00379,"105":0.00379,"106":0.00379,"107":0.00379,"108":0.01515,"109":0.00758,"110":0.00758,"111":0.00758,"112":0.00379,"113":0.01515,"114":0.01894,"115":0.3788,"116":0.9167,"117":0.04167,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00758,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02273,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.0644,"64":0,"65":0.00379,"66":0.04924,"67":0,"68":0.00379,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00379,"75":0,"76":0,"77":0.00379,"78":0.00379,"79":0.03788,"80":0.00379,"81":0.01515,"83":0.00379,"84":0,"85":0.01515,"86":0.01136,"87":0.01515,"88":0.00758,"89":0.00758,"90":0.00379,"91":0.00379,"92":0.0947,"93":0.04546,"94":0.00379,"95":0.00379,"96":0.00379,"97":0.00379,"98":0.00379,"99":0.01515,"100":0.00379,"101":0.00379,"102":0.00758,"103":0.04167,"104":0.00758,"105":0.0303,"106":0.03788,"107":0.02652,"108":0.02652,"109":0.70836,"110":0.02273,"111":0.02652,"112":0.04167,"113":0.03788,"114":0.39016,"115":4.1024,"116":2.5872,"117":0.00379,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00379,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00758,"72":0.01136,"73":0,"74":0,"75":0,"76":0.08712,"77":0.00379,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00379,"95":0.01515,"96":0,"97":0,"98":0,"99":0.00758,"100":0.16288,"101":0.16667,"102":0.00379,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00379},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00758,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00379,"86":0,"87":0,"88":0,"89":0,"90":0.08712,"91":0,"92":0.00379,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00379,"107":0.00379,"108":0.00379,"109":0.04167,"110":0.00758,"111":0.00379,"112":0.00758,"113":0.00379,"114":0.0644,"115":1.00003,"116":0.37122},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00379,"14":0.02652,"15":0.00379,"17":0.00758,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00758,"10.1":0,"11.1":0.01136,"12.1":0.01136,"13.1":0.05303,"14.1":0.15152,"15.1":0.00758,"15.2-15.3":0.00758,"15.4":0.01515,"15.5":0.02652,"15.6":0.13258,"16.0":0.01515,"16.1":0.04546,"16.2":0.03788,"16.3":0.09091,"16.4":0.04167,"16.5":0.30304,"16.6":0.35607},G:{"8":0.00239,"17":0.21068,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00718,"6.0-6.1":0.00479,"7.0-7.1":0.00718,"8.1-8.4":0,"9.0-9.2":0.00239,"9.3":0.05506,"10.0-10.2":0,"10.3":0.06943,"11.0-11.2":0.02394,"11.3-11.4":0.09337,"12.0-12.1":0.02155,"12.2-12.5":0.33278,"13.0-13.1":0.01436,"13.2":0.01197,"13.3":0.02873,"13.4-13.7":0.07182,"14.0-14.4":0.18913,"14.5-14.8":0.3639,"15.0-15.1":0.13646,"15.2-15.3":0.14365,"15.4":0.13646,"15.5":0.22744,"15.6-15.7":1.52265,"16.0":0.81639,"16.1":1.41491,"16.2":0.63444,"16.3":1.41012,"16.4":0.42376,"16.5":5.31251,"16.6":10.24196},P:{"4":0.12483,"20":0.14563,"21":0.40569,"22":2.97504,"5.0-5.4":0.0104,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.0104,"10.1":0,"11.1-11.2":0.0208,"12.0":0.0104,"13.0":0.03121,"14.0":0.0208,"15.0":0.0104,"16.0":0.04161,"17.0":0.04161,"18.0":0.03121,"19.0":0.08322},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.04304,"4.2-4.3":0.00956,"4.4":0,"4.4.3-4.4.4":0.10043},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00389,"9":0,"10":0,"11":0.14763,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":54.91939},R:{_:"0"},M:{"0":0.40378},Q:{"13.1":0.00621},O:{"0":0.16772},H:{"0":0.34699}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00444,"48":0.00444,"49":0,"50":0,"51":0,"52":0.02663,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.01332,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00444,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0222,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00444,"88":0.00444,"89":0,"90":0,"91":0.00444,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03107,"103":0,"104":0.00444,"105":0.00444,"106":0.00444,"107":0.00444,"108":0.01776,"109":0.00444,"110":0.00444,"111":0.00888,"112":0.00444,"113":0.01332,"114":0.00888,"115":0.23527,"116":0.0799,"117":1.26068,"118":0.13317,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00444,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03107,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.04883,"64":0,"65":0.00444,"66":0.04883,"67":0,"68":0.00444,"69":0.00444,"70":0,"71":0,"72":0,"73":0.00444,"74":0.00444,"75":0.00444,"76":0.00444,"77":0.00444,"78":0.00444,"79":0.04439,"80":0.00444,"81":0.01332,"83":0.00444,"84":0,"85":0.01776,"86":0.01776,"87":0.0222,"88":0.00888,"89":0.00888,"90":0.00444,"91":0.00888,"92":0.07546,"93":0.03551,"94":0.00444,"95":0.00888,"96":0.00444,"97":0.00444,"98":0.00444,"99":0.01332,"100":0.00888,"101":0.00888,"102":0.01332,"103":0.04883,"104":0.00444,"105":0.03995,"106":0.05327,"107":0.03551,"108":0.03551,"109":0.93663,"110":0.02663,"111":0.03107,"112":0.04439,"113":0.03995,"114":0.14649,"115":0.16868,"116":7.72386,"117":2.73442,"118":0.00444,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00444,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01776,"73":0.00444,"74":0,"75":0,"76":0.07102,"77":0.01776,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00444,"95":0.01332,"96":0,"97":0,"98":0,"99":0.00444,"100":0.03995,"101":0.15537,"102":0.2841,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00444,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00888,"86":0,"87":0,"88":0,"89":0,"90":0.07102,"91":0,"92":0.00444,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00444,"107":0.00444,"108":0.00444,"109":0.04439,"110":0.00444,"111":0.00444,"112":0.00444,"113":0.00444,"114":0.03107,"115":0.05771,"116":0.88336,"117":0.85229},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00444,"9":0,"10":0,"11":0,"12":0.00444,"13":0.00444,"14":0.03551,"15":0.00888,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00888,"10.1":0,"11.1":0.00888,"12.1":0.01332,"13.1":0.05771,"14.1":0.15093,"15.1":0.01332,"15.2-15.3":0.00888,"15.4":0.01776,"15.5":0.02663,"15.6":0.15093,"16.0":0.01776,"16.1":0.05771,"16.2":0.03995,"16.3":0.09766,"16.4":0.04439,"16.5":0.1598,"16.6":0.67917,"17.0":0.06215,"17.1":0},G:{"8":0.00238,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0095,"6.0-6.1":0.00238,"7.0-7.1":0.00713,"8.1-8.4":0,"9.0-9.2":0.00713,"9.3":0.05464,"10.0-10.2":0.00238,"10.3":0.05464,"11.0-11.2":0.02613,"11.3-11.4":0.08077,"12.0-12.1":0.019,"12.2-12.5":0.30881,"13.0-13.1":0.01425,"13.2":0.01188,"13.3":0.08552,"13.4-13.7":0.06651,"14.0-14.4":0.19241,"14.5-14.8":0.36345,"15.0-15.1":0.12115,"15.2-15.3":0.13065,"15.4":0.1164,"15.5":0.19479,"15.6-15.7":1.31838,"16.0":0.73402,"16.1":1.18298,"16.2":0.52973,"16.3":1.07609,"16.4":0.28743,"16.5":0.89318,"16.6":13.343,"17.0":2.22106,"17.1":0.00238},P:{"4":0.1022,"20":0.08176,"21":0.2044,"22":2.80022,"5.0-5.4":0.01022,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02044,"12.0":0.01022,"13.0":0.03066,"14.0":0.02044,"15.0":0.02044,"16.0":0.03066,"17.0":0.03066,"18.0":0.03066,"19.0":0.06132},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01191,"4.2-4.3":0.01191,"4.4":0,"4.4.3-4.4.4":0.12502},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00444,"9":0.00444,"10":0,"11":0.13761,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":50.80456},R:{_:"0"},M:{"0":0.33922},Q:{"13.1":0.00556},O:{"0":0.1279},H:{"0":0.2843}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JE.js
index f28425caeae573..49d388d3a599a1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00468,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00935,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02338,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00468,"110":0,"111":0,"112":0,"113":0,"114":0.00468,"115":0.17298,"116":0.6732,"117":0.00935,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00468,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0.06545,"81":0,"83":0,"84":0,"85":0.00468,"86":0,"87":0.00468,"88":0.00468,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00468,"95":0.00468,"96":0.00935,"97":0,"98":0,"99":0,"100":0.00468,"101":0.00468,"102":0,"103":0.06545,"104":0,"105":0,"106":0,"107":0.0187,"108":0,"109":0.27115,"110":0,"111":0.00468,"112":0.0374,"113":0.04675,"114":0.53295,"115":4.46463,"116":2.7676,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00468,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00468,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.28518,"101":0.04675,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00468,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0187,"101":0,"102":0,"103":0,"104":0,"105":0.00468,"106":0,"107":0,"108":0.00935,"109":0.0187,"110":0,"111":0,"112":0,"113":0.00468,"114":0.1122,"115":3.0481,"116":0.8602},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.04675,"15":0.00468,"17":0.00935,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00468,"12.1":0.02805,"13.1":0.04675,"14.1":0.187,"15.1":0.00935,"15.2-15.3":0.02805,"15.4":0.05143,"15.5":0.10285,"15.6":0.561,"16.0":0.06545,"16.1":0.27583,"16.2":0.1309,"16.3":0.47218,"16.4":0.05143,"16.5":1.2903,"16.6":2.44035},G:{"8":0,"17":0.38613,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.33168,"7.0-7.1":0,"8.1-8.4":0.02475,"9.0-9.2":0.0099,"9.3":0.42078,"10.0-10.2":0,"10.3":0.42078,"11.0-11.2":0,"11.3-11.4":0.08911,"12.0-12.1":0.00495,"12.2-12.5":1.39601,"13.0-13.1":0,"13.2":0,"13.3":0.02475,"13.4-13.7":0.05445,"14.0-14.4":0.78711,"14.5-14.8":0.27722,"15.0-15.1":0.04455,"15.2-15.3":0.09406,"15.4":0.15841,"15.5":0.17326,"15.6-15.7":3.58409,"16.0":1.25245,"16.1":2.47025,"16.2":1.12869,"16.3":3.23261,"16.4":0.30693,"16.5":9.03449,"16.6":23.76195},P:{"4":0.30457,"20":0.0979,"21":0.20667,"5.0-5.4":0.03263,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.04351,"17.0":0.04351,"18.0":0.01088,"19.0":0.01088},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.29843},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.38803,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":23.39238},R:{_:"0"},M:{"0":0.22898},Q:{"13.1":0},O:{"0":0},H:{"0":0.05546}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00473,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.04255,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01418,"110":0.00473,"111":0,"112":0,"113":0,"114":0,"115":0.0331,"116":0.01891,"117":0.76121,"118":0.07565,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00946,"80":0.04255,"81":0,"83":0,"84":0,"85":0.00473,"86":0,"87":0.01891,"88":0,"89":0,"90":0.00946,"91":0.00473,"92":0,"93":0,"94":0.00473,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00473,"102":0,"103":0.04728,"104":0,"105":0,"106":0,"107":0.00473,"108":0.00473,"109":0.22222,"110":0,"111":0.00473,"112":0.00946,"113":0.01891,"114":0.17494,"115":0.34514,"116":6.71849,"117":1.98576,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00473,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00946,"100":0.09929,"101":0.11347,"102":0.16548,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00473,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00473,"101":0,"102":0,"103":0.00473,"104":0,"105":0,"106":0,"107":0,"108":0.00473,"109":0.03782,"110":0,"111":0,"112":0,"113":0,"114":0.01891,"115":0.04728,"116":2.14651,"117":1.79664},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.05674,"15":0.00946,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0.00473,"11.1":0,"12.1":0.02364,"13.1":0.05674,"14.1":0.14184,"15.1":0.02364,"15.2-15.3":0.04728,"15.4":0.01418,"15.5":0.09456,"15.6":0.31205,"16.0":0.01891,"16.1":0.66192,"16.2":0.12293,"16.3":0.30732,"16.4":0.09456,"16.5":0.25058,"16.6":2.94554,"17.0":0.19385,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.37863,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.04266,"9.3":0.33597,"10.0-10.2":0,"10.3":0.4213,"11.0-11.2":0.01067,"11.3-11.4":0.05866,"12.0-12.1":0,"12.2-12.5":1.09324,"13.0-13.1":0,"13.2":0,"13.3":0.04266,"13.4-13.7":0.08533,"14.0-14.4":0.64528,"14.5-14.8":0.49596,"15.0-15.1":0.06399,"15.2-15.3":0.07466,"15.4":0.32531,"15.5":0.35197,"15.6-15.7":3.19439,"16.0":1.96783,"16.1":2.58111,"16.2":1.11457,"16.3":3.1464,"16.4":0.19198,"16.5":0.68261,"16.6":33.01586,"17.0":1.97317,"17.1":0.02666},P:{"4":0.20435,"20":0.07529,"21":0.08604,"22":3.51703,"5.0-5.4":0.06453,"6.2-6.4":0,"7.2-7.4":0.01076,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.03227,"17.0":0.01076,"18.0":0.01076,"19.0":0.01076},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.21494},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.3546,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":20.09294},R:{_:"0"},M:{"0":0.28469},Q:{"13.1":0},O:{"0":0.01054},H:{"0":0.02496}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JM.js
index 956a2e005db390..ac6f2f2e7b3543 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00361,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.01083,"74":0,"75":0,"76":0,"77":0,"78":0.01083,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00361,"87":0,"88":0.00361,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00361,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00361,"111":0,"112":0,"113":0.00361,"114":0.00361,"115":0.09028,"116":0.28888,"117":0.00722,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00361,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00361,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00361,"65":0.00361,"66":0,"67":0,"68":0,"69":0.00722,"70":0.02889,"71":0,"72":0.00361,"73":0.01444,"74":0,"75":0.01083,"76":0.01806,"77":0.00361,"78":0,"79":0.04333,"80":0.00361,"81":0.01806,"83":0.05417,"84":0.00361,"85":0.00361,"86":0.00361,"87":0.01083,"88":0.01083,"89":0,"90":0,"91":0.00361,"92":0,"93":0.09028,"94":0.00361,"95":0.00361,"96":0.00361,"97":0.01083,"98":0,"99":0.00361,"100":0.01083,"101":0.00361,"102":0.00361,"103":0.14805,"104":0.00361,"105":0.01083,"106":0.01806,"107":0.00722,"108":0.01444,"109":0.24194,"110":0.00722,"111":0.01444,"112":0.04694,"113":0.05778,"114":0.56332,"115":4.49931,"116":1.94272,"117":0.01444,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00722,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00361,"70":0,"71":0.00722,"72":0.00722,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.13,"100":0.23472,"101":0.10111,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00361,"14":0,"15":0,"16":0.00361,"17":0,"18":0.00361,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00361,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00361,"104":0,"105":0,"106":0,"107":0,"108":0.00722,"109":0.00722,"110":0,"111":0,"112":0.00361,"113":0.00722,"114":0.06861,"115":1.15552,"116":0.33582},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00722,"15":0,"17":0.00722,_:"0","3.1":0,"3.2":0,"5.1":0.00361,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00361,"12.1":0.00361,"13.1":0.01806,"14.1":0.02528,"15.1":0.00361,"15.2-15.3":0.01444,"15.4":0.01444,"15.5":0.01806,"15.6":0.08666,"16.0":0.00361,"16.1":0.09028,"16.2":0.02167,"16.3":0.08305,"16.4":0.04333,"16.5":0.16972,"16.6":0.27444},G:{"8":0,"17":0.34311,"3.2":0.0047,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.1081,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0893,"10.0-10.2":0,"10.3":0.03995,"11.0-11.2":0.04465,"11.3-11.4":0.0047,"12.0-12.1":0.00235,"12.2-12.5":0.31961,"13.0-13.1":0.00235,"13.2":0.00235,"13.3":0.0094,"13.4-13.7":0.0282,"14.0-14.4":0.094,"14.5-14.8":0.23736,"15.0-15.1":0.05875,"15.2-15.3":0.0611,"15.4":0.07755,"15.5":0.17391,"15.6-15.7":2.67908,"16.0":0.66977,"16.1":1.13038,"16.2":0.69797,"16.3":1.36304,"16.4":0.26321,"16.5":5.008,"16.6":9.97135},P:{"4":0.18027,"20":0.18027,"21":0.34993,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.2757,"8.2":0,"9.2":0.0106,"10.1":0,"11.1-11.2":0.03181,"12.0":0.0106,"13.0":0.03181,"14.0":0.04242,"15.0":0.0106,"16.0":0.07423,"17.0":0.04242,"18.0":0.04242,"19.0":0.12725},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0833,"4.4":0,"4.4.3-4.4.4":0.74973},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00361,"11":0.00722,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":56.82915},R:{_:"0"},M:{"0":0.14056},Q:{"13.1":0.00639},O:{"0":0.42167},H:{"0":0.22985}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.01426,"74":0,"75":0,"76":0,"77":0,"78":0.0214,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00713,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00357,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00357,"115":0.05349,"116":0.04992,"117":0.33164,"118":0.02853,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00357,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01783,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00357,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00357,"64":0,"65":0.00357,"66":0,"67":0,"68":0,"69":0.00357,"70":0.0107,"71":0,"72":0,"73":0.0107,"74":0,"75":0.00713,"76":0.01426,"77":0.00357,"78":0,"79":0.02853,"80":0,"81":0.0107,"83":0.05349,"84":0,"85":0.00357,"86":0.00357,"87":0.0107,"88":0.00357,"89":0,"90":0,"91":0.00713,"92":0.00713,"93":0.07489,"94":0.00357,"95":0.01426,"96":0.00357,"97":0,"98":0,"99":0.00357,"100":0.00357,"101":0,"102":0.00357,"103":0.14264,"104":0.00357,"105":0.0107,"106":0.00713,"107":0.00713,"108":0.00713,"109":0.24605,"110":0.00357,"111":0.0107,"112":0.03923,"113":0.02853,"114":0.11055,"115":0.22466,"116":5.25272,"117":1.27306,"118":0.00713,"119":0.00357,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00357,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01426,"73":0.00357,"74":0,"75":0,"76":0,"77":0.01783,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00713,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00357,"96":0,"97":0,"98":0,"99":0.00357,"100":0.03209,"101":0.14264,"102":0.11411,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00357,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00713,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00357,"104":0,"105":0,"106":0,"107":0.01426,"108":0,"109":0.00357,"110":0.00357,"111":0,"112":0.00357,"113":0.00357,"114":0.0214,"115":0.04992,"116":0.99848,"117":0.66684},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00357,"14":0.00357,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00713,"13.1":0.02853,"14.1":0.04279,"15.1":0.00357,"15.2-15.3":0.00713,"15.4":0.00713,"15.5":0.01783,"15.6":0.09628,"16.0":0.00357,"16.1":0.03209,"16.2":0.02853,"16.3":0.03923,"16.4":0.0214,"16.5":0.04636,"16.6":0.43862,"17.0":0.02496,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00751,"6.0-6.1":0,"7.0-7.1":0.08515,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.08766,"10.0-10.2":0,"10.3":0.1152,"11.0-11.2":0.03506,"11.3-11.4":0.01252,"12.0-12.1":0,"12.2-12.5":0.29552,"13.0-13.1":0.00751,"13.2":0.01753,"13.3":0.02004,"13.4-13.7":0.07012,"14.0-14.4":0.14275,"14.5-14.8":0.26798,"15.0-15.1":0.0576,"15.2-15.3":0.09517,"15.4":0.0551,"15.5":0.09767,"15.6-15.7":2.79246,"16.0":0.64364,"16.1":1.09945,"16.2":0.66368,"16.3":1.02933,"16.4":0.20286,"16.5":0.96922,"16.6":13.37375,"17.0":2.37171,"17.1":0.00751},P:{"4":0.14835,"20":0.12716,"21":0.22252,"22":3.25306,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.40266,"8.2":0,"9.2":0.0106,"10.1":0,"11.1-11.2":0.04239,"12.0":0,"13.0":0.02119,"14.0":0.02119,"15.0":0.0106,"16.0":0.07417,"17.0":0.02119,"18.0":0.03179,"19.0":0.08477},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.06207,"4.4":0,"4.4.3-4.4.4":0.68276},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03209,"5.5":0},S:{"2.5":0.00643,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":55.94611},R:{_:"0"},M:{"0":0.19302},Q:{"13.1":0},O:{"0":0.3603},H:{"0":0.23147}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JO.js
index 490710f27d45a6..c5985347c752c6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00241,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00241,"103":0.00241,"104":0,"105":0,"106":0,"107":0,"108":0.00241,"109":0,"110":0,"111":0.00241,"112":0.00241,"113":0.00241,"114":0.00241,"115":0.05311,"116":0.1207,"117":0.00241,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00724,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00241,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00241,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00241,"56":0,"57":0,"58":0.00724,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00241,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00241,"79":0.00724,"80":0,"81":0.00483,"83":0.00483,"84":0.00241,"85":0.00483,"86":0.00483,"87":0.00483,"88":0.00483,"89":0.00241,"90":0.00241,"91":0.00241,"92":0.00241,"93":0.00241,"94":0.00241,"95":0.00241,"96":0.00241,"97":0,"98":0.00724,"99":0.02414,"100":0,"101":0,"102":0.00241,"103":0.00724,"104":0.00241,"105":0.00724,"106":0.00483,"107":0.00724,"108":0.01931,"109":0.41762,"110":0.00483,"111":0.00724,"112":0.0169,"113":0.01207,"114":0.12311,"115":2.02052,"116":1.08871,"117":0.00241,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00241,"72":0,"73":0,"74":0.00241,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00241,"94":0,"95":0.00724,"96":0.00241,"97":0,"98":0.00483,"99":0.02897,"100":0.04345,"101":0.02173,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00241,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00241,"108":0,"109":0.01207,"110":0.00241,"111":0,"112":0.00241,"113":0.00241,"114":0.02173,"115":0.41521,"116":0.13277},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00483,"15":0,"17":0.00241,_:"0","3.1":0,"3.2":0,"5.1":0.01448,"6.1":0,"7.1":0,"9.1":0.00241,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00724,"14.1":0.01207,"15.1":0.00241,"15.2-15.3":0.00241,"15.4":0.00483,"15.5":0.00966,"15.6":0.02414,"16.0":0.00241,"16.1":0.00966,"16.2":0.01207,"16.3":0.02173,"16.4":0.00724,"16.5":0.05069,"16.6":0.0869},G:{"8":0,"17":0.18233,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00181,"6.0-6.1":0,"7.0-7.1":0.02708,"8.1-8.4":0,"9.0-9.2":0.00181,"9.3":0.03791,"10.0-10.2":0,"10.3":0.02527,"11.0-11.2":0.00361,"11.3-11.4":0,"12.0-12.1":0.00722,"12.2-12.5":0.32856,"13.0-13.1":0.00361,"13.2":0,"13.3":0.01264,"13.4-13.7":0.04152,"14.0-14.4":0.23288,"14.5-14.8":0.29246,"15.0-15.1":0.05957,"15.2-15.3":0.09568,"15.4":0.14442,"15.5":0.20039,"15.6-15.7":1.88833,"16.0":0.67698,"16.1":0.86834,"16.2":0.44591,"16.3":1.09581,"16.4":0.30509,"16.5":3.65029,"16.6":7.4125},P:{"4":0.07142,"20":0.13263,"21":0.38769,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.12243,"8.2":0,"9.2":0.0102,"10.1":0,"11.1-11.2":0.06121,"12.0":0.0102,"13.0":0.05101,"14.0":0.07142,"15.0":0.09182,"16.0":0.08162,"17.0":0.05101,"18.0":0.05101,"19.0":0.12243},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02741,"4.4":0,"4.4.3-4.4.4":0.1188},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00724,"5.5":0},S:{"2.5":0.00759,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":70.38033},R:{_:"0"},M:{"0":0.14413},Q:{"13.1":0},O:{"0":0.20482},H:{"0":0.22264}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00494,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00247,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00987,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00247,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00247,"103":0.00247,"104":0,"105":0,"106":0,"107":0,"108":0.00494,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00247,"115":0.03208,"116":0.0074,"117":0.11846,"118":0.01234,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00494,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00247,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00247,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00247,"56":0,"57":0,"58":0.0074,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00247,"74":0,"75":0,"76":0,"77":0,"78":0.00494,"79":0.00494,"80":0.00247,"81":0.00987,"83":0.00494,"84":0.00247,"85":0.00494,"86":0.01728,"87":0.00494,"88":0.00494,"89":0.00247,"90":0.03208,"91":0,"92":0,"93":0.00247,"94":0.00247,"95":0.00247,"96":0.00247,"97":0,"98":0.0074,"99":0.01974,"100":0.00247,"101":0.00247,"102":0.00494,"103":0.00494,"104":0.00247,"105":0.00987,"106":0.02221,"107":0.00494,"108":0.01234,"109":0.41462,"110":0.00247,"111":0.00494,"112":0.01728,"113":0.0074,"114":0.03208,"115":0.2394,"116":2.43838,"117":0.6861,"118":0.01234,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00247,"73":0,"74":0.00247,"75":0,"76":0,"77":0.01234,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00987,"96":0,"97":0.01481,"98":0,"99":0.01974,"100":0.01974,"101":0.02962,"102":0.03208,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00247,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00247,"108":0,"109":0.00494,"110":0,"111":0,"112":0,"113":0.00247,"114":0.00494,"115":0.01234,"116":0.29369,"117":0.19991},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00247,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01234,"6.1":0,"7.1":0,"9.1":0.00247,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0074,"14.1":0.00987,"15.1":0.00247,"15.2-15.3":0.00247,"15.4":0.00247,"15.5":0.00494,"15.6":0.01481,"16.0":0,"16.1":0.00987,"16.2":0.00494,"16.3":0.01728,"16.4":0.00494,"16.5":0.01728,"16.6":0.10859,"17.0":0.0074,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00388,"6.0-6.1":0,"7.0-7.1":0.04461,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03685,"10.0-10.2":0,"10.3":0.0194,"11.0-11.2":0.00388,"11.3-11.4":0,"12.0-12.1":0.00776,"12.2-12.5":0.2638,"13.0-13.1":0.00388,"13.2":0.00194,"13.3":0.48105,"13.4-13.7":0.04073,"14.0-14.4":0.23471,"14.5-14.8":0.27932,"15.0-15.1":0.05237,"15.2-15.3":0.08729,"15.4":0.10668,"15.5":0.16682,"15.6-15.7":1.77872,"16.0":0.64787,"16.1":0.73903,"16.2":0.42868,"16.3":0.92525,"16.4":0.25992,"16.5":0.72546,"16.6":10.59863,"17.0":1.22396,"17.1":0},P:{"4":0.05129,"20":0.08206,"21":0.24617,"22":3.09766,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.08206,"8.2":0,"9.2":0.01026,"10.1":0.01026,"11.1-11.2":0.05129,"12.0":0,"13.0":0.04103,"14.0":0.06154,"15.0":0.08206,"16.0":0.0718,"17.0":0.04103,"18.0":0.05129,"19.0":0.10257},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01286,"4.4":0,"4.4.3-4.4.4":0.14144},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00987,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":69.53555},R:{_:"0"},M:{"0":0.15064},Q:{"13.1":0},O:{"0":0.20336},H:{"0":0.20679}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JP.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JP.js
index c7cbed084f69b8..1c8f003e1dbdaf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JP.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/JP.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00623,"49":0,"50":0,"51":0,"52":0.03116,"53":0,"54":0,"55":0,"56":0.00623,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00623,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01869,"79":0,"80":0,"81":0,"82":0,"83":0.00623,"84":0,"85":0,"86":0,"87":0,"88":0.00623,"89":0,"90":0,"91":0.00623,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00623,"102":0.06231,"103":0.00623,"104":0.00623,"105":0.00623,"106":0.00623,"107":0.00623,"108":0.00623,"109":0.00623,"110":0.00623,"111":0.00623,"112":0.00623,"113":0.01869,"114":0.06854,"115":0.42994,"116":1.66991,"117":0.05608,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00623,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00623,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03739,"50":0,"51":0,"52":0.00623,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00623,"62":0,"63":0,"64":0,"65":0.00623,"66":0,"67":0.00623,"68":0.00623,"69":0.00623,"70":0.00623,"71":0.00623,"72":0,"73":0,"74":0.00623,"75":0.00623,"76":0,"77":0,"78":0.00623,"79":0.01869,"80":0.01246,"81":0.08723,"83":0.01869,"84":0.00623,"85":0.00623,"86":0.01869,"87":0.01246,"88":0.00623,"89":0.01246,"90":0.01246,"91":0.01246,"92":0.01246,"93":0.00623,"94":0.01869,"95":0.02492,"96":0.00623,"97":0.01246,"98":0.03739,"99":0.03739,"100":0.01246,"101":0.01869,"102":0.01869,"103":0.06231,"104":0.01869,"105":0.02492,"106":0.03116,"107":0.01869,"108":0.04362,"109":0.63556,"110":0.03116,"111":0.06231,"112":0.08723,"113":0.14331,"114":1.1652,"115":10.90425,"116":5.72629,"117":0.01869,"118":0.00623,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00623,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00623,"72":0.00623,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01246,"96":0,"97":0,"98":0,"99":0.00623,"100":0.07477,"101":0.19316,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00623,"18":0.00623,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00623,"93":0,"94":0,"95":0,"96":0,"97":0.00623,"98":0,"99":0,"100":0.00623,"101":0,"102":0.00623,"103":0.00623,"104":0,"105":0,"106":0.00623,"107":0.00623,"108":0.01246,"109":0.23678,"110":0.01246,"111":0.01246,"112":0.01869,"113":0.03116,"114":0.23055,"115":5.95061,"116":2.06246},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01246,"14":0.04362,"15":0.00623,"17":0.01246,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0.00623,"11.1":0,"12.1":0.01246,"13.1":0.05608,"14.1":0.13085,"15.1":0.01246,"15.2-15.3":0.01246,"15.4":0.03116,"15.5":0.03739,"15.6":0.24301,"16.0":0.03116,"16.1":0.05608,"16.2":0.06231,"16.3":0.16824,"16.4":0.06231,"16.5":0.53587,"16.6":0.77264},G:{"8":0,"17":0.10061,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.06842,"8.1-8.4":0.02012,"9.0-9.2":0.0161,"9.3":0.09257,"10.0-10.2":0.02012,"10.3":0.10866,"11.0-11.2":0.06037,"11.3-11.4":0.02817,"12.0-12.1":0.0322,"12.2-12.5":0.37429,"13.0-13.1":0.0322,"13.2":0.10866,"13.3":0.02817,"13.4-13.7":0.10061,"14.0-14.4":0.35416,"14.5-14.8":0.7365,"15.0-15.1":0.24148,"15.2-15.3":0.28172,"15.4":0.35416,"15.5":0.46685,"15.6-15.7":2.96613,"16.0":0.91358,"16.1":2.49927,"16.2":1.27982,"16.3":2.65623,"16.4":0.5393,"16.5":7.39318,"16.6":18.35215},P:{"4":0,"20":0.02091,"21":0.03136,"22":0.68988,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01045,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01045,"18.0":0.01045,"19.0":0.01045},I:{"0":0,"3":0,"4":0.02075,"2.1":0,"2.2":0.02075,"2.3":0.00692,"4.1":0.01383,"4.2-4.3":0.09684,"4.4":0,"4.4.3-4.4.4":0.2006},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.02728,"10":0,"11":0.30919,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":22.90499},R:{_:"0"},M:{"0":0.25629},Q:{"13.1":0.02261},O:{"0":0.21106},H:{"0":0.10348}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01222,"49":0,"50":0,"51":0,"52":0.03056,"53":0,"54":0.165,"55":0,"56":0.00611,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00611,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.03056,"79":0,"80":0,"81":0,"82":0,"83":0.00611,"84":0,"85":0,"86":0,"87":0,"88":0.00611,"89":0,"90":0,"91":0.00611,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00611,"102":0.06111,"103":0,"104":0,"105":0,"106":0.00611,"107":0.00611,"108":0.00611,"109":0.00611,"110":0.00611,"111":0.00611,"112":0.00611,"113":0.01222,"114":0.01222,"115":0.18944,"116":0.10389,"117":1.55219,"118":0.13444,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00611,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00611,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03667,"50":0,"51":0,"52":0.00611,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00611,"66":0,"67":0.00611,"68":0.00611,"69":0.00611,"70":0.00611,"71":0,"72":0,"73":0,"74":0.00611,"75":0.00611,"76":0,"77":0,"78":0.00611,"79":0.01222,"80":0.01833,"81":0.08555,"83":0.01833,"84":0.00611,"85":0.01222,"86":0.01833,"87":0.01222,"88":0.00611,"89":0.01222,"90":0.01222,"91":0.01222,"92":0.01222,"93":0.00611,"94":0.01222,"95":0.01833,"96":0.00611,"97":0.02444,"98":0.01833,"99":0.03056,"100":0.01222,"101":0.01222,"102":0.01833,"103":0.06111,"104":0.01833,"105":0.02444,"106":0.03056,"107":0.02444,"108":0.04278,"109":0.62943,"110":0.03056,"111":0.04278,"112":0.06111,"113":0.08555,"114":0.32388,"115":0.50721,"116":12.8881,"117":3.28772,"118":0.01833,"119":0.00611,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00611,"73":0,"74":0,"75":0,"76":0,"77":0.01222,"78":0,"79":0,"80":0.00611,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01222,"96":0,"97":0,"98":0,"99":0,"100":0.01222,"101":0.12833,"102":0.09167,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00611,"18":0.00611,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00611,"93":0,"94":0,"95":0,"96":0,"97":0.00611,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00611,"104":0,"105":0.00611,"106":0.00611,"107":0.01222,"108":0.01222,"109":0.21389,"110":0.01222,"111":0.01222,"112":0.01222,"113":0.02444,"114":0.055,"115":0.15278,"116":4.35714,"117":3.13494},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01222,"14":0.03667,"15":0.00611,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01222,"13.1":0.04889,"14.1":0.11,"15.1":0.01222,"15.2-15.3":0.01222,"15.4":0.03056,"15.5":0.04278,"15.6":0.20777,"16.0":0.02444,"16.1":0.04889,"16.2":0.055,"16.3":0.14666,"16.4":0.04889,"16.5":0.15278,"16.6":1.14887,"17.0":0.04889,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.05396,"8.1-8.4":0.02076,"9.0-9.2":0.02076,"9.3":0.07887,"10.0-10.2":0.0083,"10.3":0.09963,"11.0-11.2":0.04151,"11.3-11.4":0.0166,"12.0-12.1":0.02906,"12.2-12.5":0.35285,"13.0-13.1":0.03736,"13.2":0.12038,"13.3":0.02906,"13.4-13.7":0.09132,"14.0-14.4":0.33209,"14.5-14.8":0.69739,"15.0-15.1":0.20756,"15.2-15.3":0.25322,"15.4":0.32794,"15.5":0.45247,"15.6-15.7":2.7771,"16.0":0.81777,"16.1":2.21255,"16.2":1.13326,"16.3":2.17934,"16.4":0.43172,"16.5":1.26194,"16.6":25.53772,"17.0":1.38232,"17.1":0},P:{"4":0,"20":0.02111,"21":0.03167,"22":0.7178,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.01056,"13.0":0.01056,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01056,"18.0":0,"19.0":0.01056},I:{"0":0,"3":0,"4":0.0171,"2.1":0,"2.2":0.07409,"2.3":0.0114,"4.1":0.02849,"4.2-4.3":0.06839,"4.4":0,"4.4.3-4.4.4":0.15387},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.01778,"10":0,"11":0.27555,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.01556,"11":0},L:{"0":23.84185},R:{_:"0"},M:{"0":0.26834},Q:{"13.1":0.02333},O:{"0":0.19834},H:{"0":0.10309}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KE.js
index 845f34b0a08d2c..39005e16ff3087 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00258,"48":0,"49":0,"50":0,"51":0,"52":0.00515,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00258,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00258,"100":0,"101":0.00258,"102":0.00773,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00258,"112":0.00258,"113":0.00515,"114":0.00515,"115":0.15714,"116":0.25502,"117":0.02061,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00515,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00258,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00258,"50":0,"51":0,"52":0,"53":0.00258,"54":0.00258,"55":0,"56":0.00258,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00258,"67":0,"68":0,"69":0.00258,"70":0.00258,"71":0,"72":0.00773,"73":0.00515,"74":0.00258,"75":0,"76":0.00258,"77":0,"78":0,"79":0.01288,"80":0.00258,"81":0.00258,"83":0.0103,"84":0,"85":0,"86":0,"87":0.0103,"88":0.00515,"89":0.00258,"90":0.00258,"91":0.00258,"92":0.00258,"93":0.01546,"94":0.00258,"95":0.00515,"96":0.00258,"97":0.00258,"98":0.00258,"99":0.00258,"100":0,"101":0.00258,"102":0.00258,"103":0.02061,"104":0.00258,"105":0.00515,"106":0.00515,"107":0.0103,"108":0.02576,"109":0.36322,"110":0.00515,"111":0.01288,"112":0.01288,"113":0.01803,"114":0.16744,"115":2.1896,"116":1.05616,"117":0.00515,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00515,"25":0,"26":0.00258,"27":0.00773,"28":0.00515,"29":0,"30":0.00258,"31":0.00258,"32":0.00258,"33":0.00515,"34":0,"35":0,"36":0,"37":0.00773,"38":0.00258,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00515,"47":0.00258,"48":0,"49":0,"50":0.00258,"51":0.00258,"52":0,"53":0,"54":0.00515,"55":0.00258,"56":0,"57":0.00258,"58":0.00773,"60":0.04122,"62":0.00258,"63":0.08501,"64":0.02834,"65":0.01546,"66":0.04894,"67":0.0747,"68":0.04122,"69":0.94797,"70":0.99949,"71":1.58939,"72":0.75992,"73":0,"74":0.04122,"75":0.00515,"76":0.04637,"77":0.01803,"78":0,"79":0.00258,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00773,"96":0,"97":0,"98":0.00258,"99":0.00258,"100":0.04122,"101":0.08501,"102":0.00258,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01546},B:{"12":0,"13":0,"14":0,"15":0.00258,"16":0,"17":0,"18":0.00258,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00515,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00258,"109":0.00258,"110":0,"111":0,"112":0.00258,"113":0.00258,"114":0.01546,"115":0.29882,"116":0.08501},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00258,"6.1":0,"7.1":0.00258,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00515,"14.1":0.00515,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00258,"15.6":0.01288,"16.0":0,"16.1":0.00258,"16.2":0.00258,"16.3":0.00515,"16.4":0.00515,"16.5":0.02061,"16.6":0.02576},G:{"8":0,"17":0.03125,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00138,"6.0-6.1":0.00083,"7.0-7.1":0.02074,"8.1-8.4":0.00028,"9.0-9.2":0.00083,"9.3":0.01466,"10.0-10.2":0.00055,"10.3":0.01438,"11.0-11.2":0.00277,"11.3-11.4":0.00083,"12.0-12.1":0.00387,"12.2-12.5":0.13993,"13.0-13.1":0.00083,"13.2":0.00028,"13.3":0.0047,"13.4-13.7":0.00747,"14.0-14.4":0.03208,"14.5-14.8":0.03789,"15.0-15.1":0.01853,"15.2-15.3":0.01936,"15.4":0.02765,"15.5":0.04646,"15.6-15.7":0.37498,"16.0":0.0719,"16.1":0.1568,"16.2":0.0766,"16.3":0.16564,"16.4":0.04895,"16.5":0.50827,"16.6":0.93358},P:{"4":0.12504,"20":0.04168,"21":0.11462,"22":0.62518,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.12504,"8.2":0,"9.2":0,"10.1":0.01042,"11.1-11.2":0.03126,"12.0":0,"13.0":0.01042,"14.0":0,"15.0":0,"16.0":0.02084,"17.0":0.01042,"18.0":0.02084,"19.0":0.0521},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00674,"4.4":0,"4.4.3-4.4.4":0.07417},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01288,"5.5":0},S:{"2.5":0.01485,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":52.00158},R:{_:"0"},M:{"0":0.1856},Q:{"13.1":0.00742},O:{"0":0.20787},H:{"0":28.27591}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00248,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00248,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00496,"103":0,"104":0,"105":0,"106":0,"107":0.00248,"108":0.00248,"109":0,"110":0.00248,"111":0.00248,"112":0,"113":0.00496,"114":0.00248,"115":0.07198,"116":0.02234,"117":0.25068,"118":0.02978,"119":0.00248,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00248,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00248,"50":0,"51":0,"52":0,"53":0.00248,"54":0.00248,"55":0,"56":0.00248,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00248,"67":0,"68":0,"69":0,"70":0.00248,"71":0,"72":0.00248,"73":0.00496,"74":0.00248,"75":0,"76":0,"77":0,"78":0,"79":0.00745,"80":0.00248,"81":0.00248,"83":0.00993,"84":0,"85":0,"86":0,"87":0.00745,"88":0.00496,"89":0,"90":0,"91":0.00496,"92":0.00248,"93":0.00248,"94":0.00248,"95":0.00496,"96":0.00745,"97":0.00248,"98":0.00248,"99":0.00496,"100":0.00248,"101":0.00248,"102":0.00248,"103":0.01489,"104":0.00248,"105":0.00496,"106":0.01241,"107":0.00993,"108":0.13899,"109":0.33755,"110":0.00248,"111":0.00993,"112":0.00745,"113":0.00993,"114":0.04716,"115":0.0695,"116":2.41499,"117":0.60809,"118":0.00248,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.01241,"25":0,"26":0.00248,"27":0.00745,"28":0.00496,"29":0,"30":0.00248,"31":0,"32":0.00248,"33":0.00745,"34":0,"35":0,"36":0,"37":0.00496,"38":0.00248,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00496,"47":0.00248,"48":0,"49":0,"50":0.00248,"51":0.00248,"52":0,"53":0,"54":0.00496,"55":0.00248,"56":0,"57":0.00248,"58":0.00993,"60":0.04716,"62":0,"63":0.08687,"64":0.02482,"65":0.01737,"66":0.04964,"67":0.07446,"68":0.03971,"69":0.38223,"70":0.38719,"71":0.47903,"72":2.72524,"73":0.34252,"74":0.00993,"75":0.00248,"76":0.01241,"77":0.11665,"78":0.00496,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00745,"96":0,"97":0,"98":0.00248,"99":0.00248,"100":0.01241,"101":0.04716,"102":0.0546,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01737},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00496,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00496,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00248,"108":0,"109":0.00248,"110":0,"111":0,"112":0.00248,"113":0.00248,"114":0.00496,"115":0.01241,"116":0.19111,"117":0.13899},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00248,"6.1":0,"7.1":0,"9.1":0.00496,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00496,"14.1":0.00496,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00248,"15.6":0.00993,"16.0":0,"16.1":0.00248,"16.2":0.00248,"16.3":0.00496,"16.4":0.00248,"16.5":0.00745,"16.6":0.03723,"17.0":0.00248,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00149,"6.0-6.1":0.00174,"7.0-7.1":0.02211,"8.1-8.4":0,"9.0-9.2":0.00124,"9.3":0.01541,"10.0-10.2":0,"10.3":0.01864,"11.0-11.2":0.00323,"11.3-11.4":0.00919,"12.0-12.1":0.00373,"12.2-12.5":0.11678,"13.0-13.1":0.00075,"13.2":0,"13.3":0.00422,"13.4-13.7":0.00944,"14.0-14.4":0.02659,"14.5-14.8":0.03578,"15.0-15.1":0.02286,"15.2-15.3":0.0169,"15.4":0.03777,"15.5":0.02957,"15.6-15.7":0.33743,"16.0":0.0497,"16.1":0.11182,"16.2":0.0564,"16.3":0.12051,"16.4":0.03653,"16.5":0.09492,"16.6":1.13058,"17.0":0.13716,"17.1":0},P:{"4":0.09154,"20":0.03051,"21":0.0712,"22":0.58994,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.09154,"8.2":0,"9.2":0.01017,"10.1":0.01017,"11.1-11.2":0.02034,"12.0":0,"13.0":0.01017,"14.0":0.01017,"15.0":0,"16.0":0.02034,"17.0":0.01017,"18.0":0.02034,"19.0":0.05086},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00599,"4.4":0,"4.4.3-4.4.4":0.07883},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01489,"5.5":0},S:{"2.5":0.00752,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":50.52555},R:{_:"0"},M:{"0":0.15788},Q:{"13.1":0.00752},O:{"0":0.2105},H:{"0":30.3635}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KG.js
index 6b64174f7d6ac7..94adf889918037 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00284,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00284,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00284,"95":0,"96":0,"97":0.00568,"98":0,"99":0,"100":0,"101":0,"102":0.03407,"103":0,"104":0,"105":0,"106":0,"107":0.00284,"108":0,"109":0,"110":0,"111":0.00284,"112":0,"113":0.00568,"114":0.00284,"115":0.11072,"116":0.11924,"117":0.00568,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01987,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00284,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00568,"80":0.00284,"81":0.01136,"83":0.00284,"84":0.00568,"85":0.00284,"86":0.00284,"87":0.00568,"88":0.00284,"89":0.00284,"90":0.00568,"91":0.00284,"92":0.00568,"93":0,"94":0.00852,"95":0,"96":0.00284,"97":0.00568,"98":0.00568,"99":0.00852,"100":0.0142,"101":0.00568,"102":0.00852,"103":0.01136,"104":0.00284,"105":0.00284,"106":0.01136,"107":0.00568,"108":0.02271,"109":0.9681,"110":0.00852,"111":0.01987,"112":0.02839,"113":0.02839,"114":0.22144,"115":2.33934,"116":1.35988,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00284,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00284,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00284,"71":0.01136,"72":0.00284,"73":0,"74":0,"75":0,"76":0.00284,"77":0,"78":0,"79":0.00284,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.0653,"86":0.01703,"87":0.00284,"88":0,"89":0,"90":0.01136,"91":0,"92":0,"93":0,"94":0,"95":0.07381,"96":0,"97":0.00568,"98":0,"99":0.00284,"100":0.22712,"101":0.20725,"102":0.00284,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.01136,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00284,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00284,"108":0,"109":0,"110":0,"111":0.00284,"112":0.00568,"113":0,"114":0.01136,"115":0.36055,"116":0.09653},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00284,"14":0.00284,"15":0,"17":0.00284,_:"0","3.1":0,"3.2":0,"5.1":0.07949,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00284,"13.1":0.00284,"14.1":0.0142,"15.1":0.00284,"15.2-15.3":0,"15.4":0.00284,"15.5":0.00852,"15.6":0.02271,"16.0":0.00284,"16.1":0.02839,"16.2":0.00568,"16.3":0.02555,"16.4":0.01987,"16.5":0.06246,"16.6":0.04826},G:{"8":0,"17":0.16916,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01007,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.00403,"11.0-11.2":0.0141,"11.3-11.4":0.00201,"12.0-12.1":0.00604,"12.2-12.5":0.16513,"13.0-13.1":0,"13.2":0.00806,"13.3":0.02618,"13.4-13.7":0.02618,"14.0-14.4":0.23964,"14.5-14.8":0.31818,"15.0-15.1":0.1309,"15.2-15.3":0.22353,"15.4":0.15707,"15.5":0.51553,"15.6-15.7":1.81643,"16.0":1.99163,"16.1":1.63519,"16.2":1.29486,"16.3":1.99969,"16.4":0.73906,"16.5":4.05173,"16.6":4.58337},P:{"4":0.14174,"20":0.17211,"21":0.47584,"5.0-5.4":0,"6.2-6.4":0.0405,"7.2-7.4":0.23286,"8.2":0,"9.2":0.05062,"10.1":0,"11.1-11.2":0.01012,"12.0":0,"13.0":0.05062,"14.0":0.02025,"15.0":0.02025,"16.0":0.07087,"17.0":0.0405,"18.0":0.07087,"19.0":0.14174},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02973,"4.4":0,"4.4.3-4.4.4":0.00878},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00852,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.12484},R:{_:"0"},M:{"0":0.06445},Q:{"13.1":0.06445},O:{"0":0.73758},H:{"0":0.48813}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00661,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.03966,"68":0.05949,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.10576,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00331,"98":0,"99":0,"100":0,"101":0,"102":0.01983,"103":0,"104":0,"105":0,"106":0,"107":0.00661,"108":0.195,"109":0,"110":0,"111":0,"112":0,"113":0.00331,"114":0.00331,"115":0.04627,"116":0.00992,"117":0.08593,"118":0.00661,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01322,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00331,"64":0,"65":0,"66":0,"67":0,"68":0.00331,"69":0,"70":0.00331,"71":0.01983,"72":0,"73":0,"74":0.00331,"75":0.10246,"76":0,"77":0.13551,"78":0,"79":0.23796,"80":0.14542,"81":0.00661,"83":0.00661,"84":0.01983,"85":0.00331,"86":0.01983,"87":0.31728,"88":0.15203,"89":0.00331,"90":0.09585,"91":0.25118,"92":0.01983,"93":0.06941,"94":0.00992,"95":0.18839,"96":0.00331,"97":0.00331,"98":0.05288,"99":0.1983,"100":0.00331,"101":0.00331,"102":0.18178,"103":0.00661,"104":0.00331,"105":0.00992,"106":0.50897,"107":0.00661,"108":0.01322,"109":0.80642,"110":0.00661,"111":0.00992,"112":0.25118,"113":0.01653,"114":0.18508,"115":0.0628,"116":1.96648,"117":0.47592,"118":0.00331,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00331,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0.00992,"63":0,"64":0,"65":0.0661,"66":0,"67":0,"68":0,"69":0.00331,"70":0,"71":0,"72":0.07932,"73":0,"74":0,"75":0.00331,"76":0,"77":0.00661,"78":0.00992,"79":0.00331,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.03966,"86":0.00992,"87":0,"88":0,"89":0,"90":0.00331,"91":0,"92":0,"93":0,"94":0,"95":0.07602,"96":0,"97":0,"98":0,"99":0.00331,"100":0.01983,"101":0.11237,"102":0.09915,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00661,"15":0.00331,"16":0,"17":0,"18":0.00331,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.08924,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00661,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.10907,"106":0,"107":0,"108":0,"109":0.00331,"110":0,"111":0.00331,"112":0.00661,"113":0.0661,"114":0.01322,"115":0.00331,"116":0.26771,"117":0.08924},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00331,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.07932,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00331,"14.1":0.00992,"15.1":0.00331,"15.2-15.3":0.00331,"15.4":0.00331,"15.5":0.00661,"15.6":0.01653,"16.0":0.00661,"16.1":0.01653,"16.2":0.00331,"16.3":0.00992,"16.4":0.00661,"16.5":0.01983,"16.6":0.07271,"17.0":0.00661,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00614,"10.0-10.2":0,"10.3":0.00614,"11.0-11.2":0.00307,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.15971,"13.0-13.1":0,"13.2":0.00307,"13.3":15.31396,"13.4-13.7":0.01229,"14.0-14.4":0.15357,"14.5-14.8":0.24571,"15.0-15.1":0.1075,"15.2-15.3":0.14436,"15.4":0.129,"15.5":0.32557,"15.6-15.7":1.32684,"16.0":1.14563,"16.1":1.21934,"16.2":0.67878,"16.3":1.24084,"16.4":1.07499,"16.5":1.21627,"16.6":5.29201,"17.0":0.81699,"17.1":0},P:{"4":0.09993,"20":0.10992,"21":0.15988,"22":0.94929,"5.0-5.4":0.00999,"6.2-6.4":0.01999,"7.2-7.4":0.19985,"8.2":0,"9.2":0.02998,"10.1":0,"11.1-11.2":0.02998,"12.0":0.01999,"13.0":0.02998,"14.0":0.01999,"15.0":0.01999,"16.0":0.09993,"17.0":0.02998,"18.0":0.03997,"19.0":0.1399},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01057,"4.4":0,"4.4.3-4.4.4":0.00604},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.16856,"10":0,"11":0.00992,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":53.99212},R:{_:"0"},M:{"0":0.04687},Q:{"13.1":0.0067},O:{"0":0.44857},H:{"0":0.29157}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KH.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KH.js
index 2e23a6161f02b6..64b671d41953ff 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KH.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KH.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0.00384,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00384,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00384,"51":0.00767,"52":0.01151,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.01535,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00767,"100":0,"101":0,"102":0.00767,"103":0.00384,"104":0,"105":0.00384,"106":0.00767,"107":0.00384,"108":0.00767,"109":0.00767,"110":0.00384,"111":0,"112":0.01151,"113":0.00767,"114":0.00384,"115":0.11895,"116":0.41056,"117":0.01535,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01535,"39":0,"40":0,"41":0.01535,"42":0,"43":0,"44":0.00384,"45":0.00384,"46":0,"47":0.00767,"48":0,"49":0.00384,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.04221,"57":0.00384,"58":0.00384,"59":0,"60":0.02686,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00384,"71":0,"72":0.00384,"73":0,"74":0.00384,"75":0,"76":0,"77":0,"78":0.00384,"79":0.02686,"80":0.00384,"81":0.00384,"83":0.01535,"84":0.00384,"85":0.00384,"86":0.01535,"87":0.00767,"88":0.00384,"89":0,"90":0.01151,"91":0.00767,"92":0.00384,"93":0.00384,"94":0.00767,"95":0.00384,"96":0.00384,"97":0.00767,"98":0.02302,"99":0.0307,"100":0.00384,"101":0.00384,"102":0.00767,"103":0.04988,"104":0.00767,"105":0.02686,"106":0.04604,"107":0.04604,"108":0.05372,"109":0.33766,"110":0.03837,"111":0.06139,"112":0.06523,"113":0.0729,"114":0.36835,"115":5.34494,"116":3.22692,"117":0.01535,"118":0.01151,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00767,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00384,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00384,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.01151,"72":0.00384,"73":0,"74":0,"75":0,"76":0,"77":0.00384,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00384,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00384,"96":0,"97":0,"98":0,"99":0.01151,"100":0.09976,"101":0.25324,"102":0.00384,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00384,"15":0,"16":0,"17":0,"18":0.00384,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00767,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00767,"104":0,"105":0,"106":0.00384,"107":0.00767,"108":0.01151,"109":0.00767,"110":0.00767,"111":0.00767,"112":0.00767,"113":0.00767,"114":0.0307,"115":0.54869,"116":0.1765},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00384,"10":0.00767,"11":0,"12":0,"13":0.01151,"14":0.01535,"15":0.00384,"17":0.00767,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01535,"14.1":0.03837,"15.1":0.00767,"15.2-15.3":0.01535,"15.4":0.01151,"15.5":0.01919,"15.6":0.13046,"16.0":0.01919,"16.1":0.04604,"16.2":0.04988,"16.3":0.08058,"16.4":0.01919,"16.5":0.16499,"16.6":0.25324},G:{"8":0,"17":0.19664,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00951,"8.1-8.4":0.00634,"9.0-9.2":0,"9.3":0.07295,"10.0-10.2":0.0444,"10.3":0.09198,"11.0-11.2":0.02537,"11.3-11.4":0.0222,"12.0-12.1":0.03489,"12.2-12.5":1.24644,"13.0-13.1":0.02537,"13.2":0.00634,"13.3":0.04123,"13.4-13.7":0.1903,"14.0-14.4":0.64701,"14.5-14.8":1.15446,"15.0-15.1":0.36473,"15.2-15.3":0.39011,"15.4":0.38376,"15.5":0.6026,"15.6-15.7":3.99304,"16.0":1.64923,"16.1":1.87441,"16.2":1.03077,"16.3":2.19791,"16.4":0.82461,"16.5":5.33779,"16.6":9.23568},P:{"4":0.06286,"20":0.05239,"21":0.1362,"5.0-5.4":0.01048,"6.2-6.4":0,"7.2-7.4":0.01048,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01048,"12.0":0.02095,"13.0":0,"14.0":0,"15.0":0,"16.0":0.02095,"17.0":0.01048,"18.0":0.01048,"19.0":0.07334},I:{"0":0,"3":0,"4":0.0135,"2.1":0,"2.2":0.00675,"2.3":0.00675,"4.1":0.01013,"4.2-4.3":0.02363,"4.4":0,"4.4.3-4.4.4":0.06076},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01623,"9":0.00406,"10":0.00406,"11":1.03851,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00616},N:{"10":0.00616,"11":0},L:{"0":49.27925},R:{_:"0"},M:{"0":0.16024},Q:{"13.1":0.0493},O:{"0":0.94294},H:{"0":0.46094}};
+module.exports={C:{"2":0,"3":0,"4":0.00381,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.01142,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00381,"51":0.00381,"52":0.01142,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00381,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.01522,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00381,"100":0,"101":0,"102":0.00381,"103":0,"104":0.00381,"105":0.00761,"106":0,"107":0.00381,"108":0.03044,"109":0.00381,"110":0.05708,"111":0.00761,"112":0.03805,"113":0.00381,"114":0.00381,"115":0.05327,"116":0.03044,"117":0.42616,"118":0.04566,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00761,"39":0,"40":0,"41":0.01142,"42":0,"43":0.00381,"44":0.00381,"45":0.00381,"46":0,"47":0.00381,"48":0.00381,"49":0.00381,"50":0,"51":0.00381,"52":0,"53":0,"54":0,"55":0,"56":0.02283,"57":0.00381,"58":0,"59":0,"60":0.00381,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00381,"69":0.00381,"70":0.01142,"71":0.01142,"72":0.00381,"73":0,"74":0,"75":0,"76":0.00381,"77":0,"78":0.00381,"79":0.02283,"80":0.00381,"81":0,"83":0.00381,"84":0.00381,"85":0,"86":0.00761,"87":0.01522,"88":0.00381,"89":0,"90":0.00381,"91":0.00761,"92":0.00381,"93":0,"94":0.01142,"95":0.00381,"96":0.00381,"97":0.01142,"98":0.01142,"99":0.04186,"100":0.00381,"101":0.00761,"102":0.01142,"103":0.0723,"104":0.01142,"105":0.02664,"106":0.04947,"107":0.09893,"108":0.11796,"109":0.33104,"110":0.06849,"111":0.06849,"112":0.14459,"113":0.04566,"114":0.11415,"115":0.23591,"116":6.33913,"117":1.49537,"118":0.01903,"119":0.00761,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00381,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00381,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00381,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00381,"72":0.01522,"73":0.00381,"74":0,"75":0,"76":0.00381,"77":0.01522,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.01142,"92":0.00761,"93":0,"94":0.00761,"95":0.00381,"96":0.03044,"97":0.00381,"98":0,"99":0,"100":0.01522,"101":0.14459,"102":0.14079,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00381,"13":0,"14":0.00381,"15":0,"16":0,"17":0,"18":0.00381,"79":0,"80":0,"81":0,"83":0,"84":0.00381,"85":0,"86":0,"87":0,"88":0,"89":0.01903,"90":0,"91":0,"92":0.01142,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00381,"104":0,"105":0,"106":0.01142,"107":0.02664,"108":0.00761,"109":0.00761,"110":0.01142,"111":0.01142,"112":0.00761,"113":0.00381,"114":0.01142,"115":0.01522,"116":0.36148,"117":0.27777},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00381,"10":0.00381,"11":0,"12":0,"13":0.00381,"14":0.01142,"15":0.00381,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00381,"13.1":0.01142,"14.1":0.01903,"15.1":0.00761,"15.2-15.3":0.00761,"15.4":0.00761,"15.5":0.01522,"15.6":0.10654,"16.0":0.01522,"16.1":0.02664,"16.2":0.02283,"16.3":0.06469,"16.4":0.01522,"16.5":0.04947,"16.6":0.32343,"17.0":0.02283,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01316,"8.1-8.4":0.00658,"9.0-9.2":0.00329,"9.3":0.0724,"10.0-10.2":0.02962,"10.3":0.05595,"11.0-11.2":0.0362,"11.3-11.4":0.0362,"12.0-12.1":0.03291,"12.2-12.5":1.27696,"13.0-13.1":0.01316,"13.2":0.01975,"13.3":0.12835,"13.4-13.7":0.13165,"14.0-14.4":0.63519,"14.5-14.8":1.09924,"15.0-15.1":0.45089,"15.2-15.3":0.32911,"15.4":0.35544,"15.5":0.59899,"15.6-15.7":3.85721,"16.0":1.60607,"16.1":1.88253,"16.2":0.83924,"16.3":2.25772,"16.4":0.57266,"16.5":1.60607,"16.6":13.49365,"17.0":1.16177,"17.1":0},P:{"4":0.07185,"20":0.05132,"21":0.08211,"22":1.34457,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01026,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.01026,"13.0":0.01026,"14.0":0,"15.0":0,"16.0":0.03079,"17.0":0.01026,"18.0":0.02053,"19.0":0.07185},I:{"0":0,"3":0,"4":0.01583,"2.1":0,"2.2":0.00791,"2.3":0.01187,"4.1":0.01583,"4.2-4.3":0.03166,"4.4":0,"4.4.3-4.4.4":0.0831},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01962,"9":0.00392,"10":0.00392,"11":1.34613,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.75766},R:{_:"0"},M:{"0":0.19824},Q:{"13.1":0.03098},O:{"0":0.78677},H:{"0":0.41055}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KI.js
index 46a4dac7286f11..59663ec072609f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00505,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00253,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00253,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00253,"96":0,"97":0.00253,"98":0,"99":0,"100":0.00253,"101":0,"102":0.00253,"103":0,"104":0.00253,"105":0.00505,"106":0,"107":0,"108":0,"109":0.00505,"110":0,"111":0.00505,"112":0.00253,"113":0,"114":0.01516,"115":0.06823,"116":0.18953,"117":0.00505,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00253,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00253,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.01264,"71":0,"72":0,"73":0,"74":0.00253,"75":0,"76":0,"77":0.01011,"78":0,"79":0,"80":0.00758,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.00253,"88":0.03032,"89":0,"90":0,"91":0.01011,"92":0,"93":0.01011,"94":0,"95":0,"96":0.02274,"97":0,"98":0.00253,"99":0.02527,"100":0,"101":0.00253,"102":0,"103":0.01516,"104":0.00253,"105":0.01011,"106":0.01011,"107":0.00253,"108":0.00505,"109":0.14404,"110":0,"111":0.02022,"112":0.02527,"113":0.02274,"114":0.21227,"115":1.27866,"116":0.63933,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00253,"64":0,"65":0,"66":0,"67":0.02022,"68":0,"69":0,"70":0.01011,"71":0.02022,"72":0.14404,"73":0,"74":0,"75":0.01516,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00253,"96":0,"97":0,"98":0,"99":0.00505,"100":0.00505,"101":0.02274,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00505,"13":0.00758,"14":0,"15":0.00253,"16":0,"17":0.00253,"18":0.02022,"79":0,"80":0,"81":0,"83":0,"84":0.01011,"85":0.00253,"86":0,"87":0,"88":0,"89":0.01516,"90":0.00505,"91":0,"92":0.02022,"93":0,"94":0,"95":0.00253,"96":0,"97":0,"98":0,"99":0,"100":0.00253,"101":0,"102":0,"103":0.00505,"104":0.00253,"105":0,"106":0.00253,"107":0.00253,"108":0.00253,"109":0.01264,"110":0,"111":0.01264,"112":0.00505,"113":0.02022,"114":0.04801,"115":0.58879,"116":0.10613},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00253,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0.00505,"16.3":0.01516,"16.4":0,"16.5":0.00505,"16.6":0.00758},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.01673,"9.3":0.07112,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.08367,"14.5-14.8":0.0502,"15.0-15.1":0.0251,"15.2-15.3":0.00837,"15.4":0.07531,"15.5":0.02092,"15.6-15.7":0.07112,"16.0":0.0251,"16.1":0.18842,"16.2":0.00418,"16.3":0.08367,"16.4":0.01255,"16.5":0.59857,"16.6":0.15898},P:{"4":0,"20":0.08266,"21":0.26865,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.22732,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.031,"13.0":0,"14.0":0.01033,"15.0":0.02067,"16.0":0.10333,"17.0":0.031,"18.0":0.14466,"19.0":0.34097},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.03756,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.12771},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01264,"5.5":0},S:{"2.5":0.00747,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":88.81231},R:{_:"0"},M:{"0":0.05231},Q:{"13.1":0},O:{"0":1.04622},H:{"0":1.13199}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.0098,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.0049,"106":0,"107":0,"108":0,"109":0,"110":0.00735,"111":0.0049,"112":0,"113":0.00245,"114":0,"115":0.02449,"116":0.00245,"117":0.06857,"118":0.00245,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.01225,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.0049,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00245,"64":0.0049,"65":0,"66":0,"67":0,"68":0,"69":0.00245,"70":0,"71":0,"72":0,"73":0,"74":0.0049,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00245,"86":0,"87":0.0049,"88":0.03918,"89":0,"90":0,"91":0,"92":0.02939,"93":0,"94":0,"95":0,"96":0.0098,"97":0,"98":0,"99":0.00735,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.02204,"106":0.00735,"107":0.00735,"108":0.00245,"109":0.08327,"110":0,"111":0,"112":0.04408,"113":0.0049,"114":0.09551,"115":0.09061,"116":1.51103,"117":0.28164,"118":0.00245,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00245,"64":0,"65":0.0098,"66":0,"67":0.00245,"68":0.01714,"69":0.01959,"70":0.0049,"71":0,"72":0.06612,"73":0.00735,"74":0.03429,"75":0,"76":0.00245,"77":0.05878,"78":0.00245,"79":0.00245,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.0049,"97":0,"98":0,"99":0,"100":0.00735,"101":0.01714,"102":0.01469,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00245,"13":0.00245,"14":0.0049,"15":0,"16":0.00735,"17":0,"18":0.00245,"79":0,"80":0.0098,"81":0,"83":0,"84":0.00735,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.01469,"91":0,"92":0.0098,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0049,"100":0.00245,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.0049,"109":0.03918,"110":0.0098,"111":0.00245,"112":0.0049,"113":0.06612,"114":0.03674,"115":0.06367,"116":0.40653,"117":0.28898},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00245,"13.1":0,"14.1":0.00245,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00245,"15.6":0.0049,"16.0":0,"16.1":0.00245,"16.2":0,"16.3":0.00245,"16.4":0,"16.5":0,"16.6":0.00245,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.03708,"9.3":0.02475,"10.0-10.2":0,"10.3":0,"11.0-11.2":0.01234,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.00409,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.03708,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0.00825,"15.2-15.3":0.00825,"15.4":0.03708,"15.5":0.01234,"15.6-15.7":0.00825,"16.0":0.02059,"16.1":0.033,"16.2":0.03708,"16.3":0.08658,"16.4":0.05774,"16.5":0.09891,"16.6":0.18965,"17.0":0.00409,"17.1":0},P:{"4":0.05181,"20":0.17617,"21":0.33161,"22":0.71504,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.48706,"8.2":0,"9.2":0.03109,"10.1":0.03109,"11.1-11.2":0.01036,"12.0":0,"13.0":0.01036,"14.0":0.03109,"15.0":0,"16.0":0.17617,"17.0":0.03109,"18.0":0.19689,"19.0":0.19689},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.2149},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0.00755,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":86.01977},R:{_:"0"},M:{"0":0.10571},Q:{"13.1":0},O:{"0":1.83489},H:{"0":2.6808}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KM.js
index bd962677fb1255..fd02cc9b3502cf 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00184,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00184,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00553,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00184,"79":0,"80":0,"81":0.00184,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00184,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00738,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00184,"111":0.00184,"112":0,"113":0,"114":0.00184,"115":0.25263,"116":0.21022,"117":0.01291,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00184,"41":0.00184,"42":0,"43":0,"44":0,"45":0,"46":0.00184,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00922,"59":0.00184,"60":0,"61":0,"62":0,"63":0,"64":0.00184,"65":0,"66":0,"67":0,"68":0,"69":0.00184,"70":0,"71":0,"72":0,"73":0,"74":0.00184,"75":0,"76":0,"77":0,"78":0,"79":0.02397,"80":0.00184,"81":0.00922,"83":0,"84":0.00184,"85":0,"86":0,"87":0.00553,"88":0,"89":0.00184,"90":0.00369,"91":0.00184,"92":0,"93":0,"94":0.00369,"95":0,"96":0,"97":0,"98":0.00184,"99":0,"100":0.00184,"101":0,"102":0.00184,"103":0.00184,"104":0,"105":0.00369,"106":0.00184,"107":0,"108":0.00184,"109":0.27844,"110":0.00184,"111":0.00184,"112":0.02766,"113":0.01106,"114":0.05532,"115":0.90725,"116":0.38171,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00184,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00184,"40":0,"41":0,"42":0.00184,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00369,"62":0,"63":0.00184,"64":0,"65":0.00184,"66":0,"67":0,"68":0,"69":0.02213,"70":0.00369,"71":0.01844,"72":0.00553,"73":0,"74":0.00184,"75":0,"76":0,"77":0,"78":0,"79":0.00369,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01106,"96":0,"97":0,"98":0,"99":0.00184,"100":0.00738,"101":0.02397,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00369,"13":0,"14":0,"15":0.00184,"16":0,"17":0.00369,"18":0.00369,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.01106,"90":0,"91":0,"92":0.00369,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00184,"101":0.00184,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00369,"108":0.00184,"109":0.00553,"110":0.00184,"111":0,"112":0,"113":0.00184,"114":0.01291,"115":0.17149,"116":0.05532},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00184,"12":0,"13":0,"14":0,"15":0,"17":0.00369,_:"0","3.1":0,"3.2":0,"5.1":0.00184,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00369,"14.1":0,"15.1":0,"15.2-15.3":0.00922,"15.4":0,"15.5":0.00184,"15.6":0.00184,"16.0":0,"16.1":0.00184,"16.2":0.00184,"16.3":0,"16.4":0.00184,"16.5":0.04979,"16.6":0.00553},G:{"8":0.00573,"17":0.00229,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00573,"10.0-10.2":0,"10.3":0.0229,"11.0-11.2":0.01374,"11.3-11.4":0,"12.0-12.1":0.11452,"12.2-12.5":0.15461,"13.0-13.1":0,"13.2":0,"13.3":0.00573,"13.4-13.7":0.07329,"14.0-14.4":1.656,"14.5-14.8":1.89879,"15.0-15.1":0.12025,"15.2-15.3":0.0355,"15.4":0.11452,"15.5":0.14659,"15.6-15.7":1.74647,"16.0":0.47985,"16.1":0.30234,"16.2":1.27578,"16.3":0.86808,"16.4":0.17178,"16.5":1.47849,"16.6":0.75929},P:{"4":0.06012,"20":0.74146,"21":2.41475,"5.0-5.4":0.02004,"6.2-6.4":0.01002,"7.2-7.4":0.07014,"8.2":0,"9.2":0.11022,"10.1":0,"11.1-11.2":0.12024,"12.0":0,"13.0":0.03006,"14.0":0.02004,"15.0":0,"16.0":0.04008,"17.0":0.19037,"18.0":0.02004,"19.0":0.0501},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.07582},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0.0734,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.51493},R:{_:"0"},M:{"0":0.16312},Q:{"13.1":0},O:{"0":0.08156},H:{"0":0.49418}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00361,"67":0,"68":0.00181,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00181,"82":0,"83":0,"84":0.00181,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00181,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00723,"114":0.00542,"115":0.24033,"116":0.02349,"117":0.14456,"118":0.00904,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00181,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00904,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00181,"68":0,"69":0,"70":0.00723,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00181,"80":0.00361,"81":0.01084,"83":0.00181,"84":0.00181,"85":0.00361,"86":0,"87":0,"88":0,"89":0.01265,"90":0.00181,"91":0,"92":0.00723,"93":0,"94":0,"95":0.00181,"96":0,"97":0,"98":0.00181,"99":0.00181,"100":0,"101":0,"102":0,"103":0.00723,"104":0,"105":0,"106":0.00181,"107":0,"108":0.00361,"109":0.25479,"110":0.00181,"111":0,"112":0.03795,"113":0.00723,"114":0.00181,"115":0.03253,"116":0.9035,"117":0.20238,"118":0.00181,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00181,"29":0,"30":0,"31":0,"32":0,"33":0.00181,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0.00181,"66":0,"67":0,"68":0.00181,"69":0.0777,"70":0.00723,"71":0.00542,"72":0.0777,"73":0.00723,"74":0,"75":0,"76":0,"77":0.00542,"78":0,"79":0.00181,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00181,"96":0.00361,"97":0,"98":0,"99":0,"100":0.00723,"101":0.02349,"102":0.02711,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00181,"13":0.00181,"14":0,"15":0,"16":0.00181,"17":0,"18":0.00723,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00181,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00181,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00181,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00181,"110":0.04879,"111":0.00181,"112":0,"113":0.00181,"114":0.00181,"115":0.00904,"116":0.16082,"117":0.16444},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00542,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00361,"14.1":0,"15.1":0,"15.2-15.3":0.00542,"15.4":0,"15.5":0,"15.6":0.00542,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0.03072,"16.6":0.01084,"17.0":0.00181,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02964,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.05709,"12.2-12.5":0.17237,"13.0-13.1":0.00769,"13.2":0.0022,"13.3":0,"13.4-13.7":0.01537,"14.0-14.4":1.78184,"14.5-14.8":3.00816,"15.0-15.1":0.18993,"15.2-15.3":0.06038,"15.4":0.08014,"15.5":0.01976,"15.6-15.7":1.34928,"16.0":0.18993,"16.1":0.22067,"16.2":0.44244,"16.3":0.97601,"16.4":0.46769,"16.5":1.12312,"16.6":0.59065,"17.0":0.1548,"17.1":0},P:{"4":0.51648,"20":0.04051,"21":0.55698,"22":2.80517,"5.0-5.4":0.01013,"6.2-6.4":0.04051,"7.2-7.4":0.1114,"8.2":0,"9.2":0.01013,"10.1":0,"11.1-11.2":0.39495,"12.0":0,"13.0":0,"14.0":0.02025,"15.0":0,"16.0":0.03038,"17.0":0.07089,"18.0":0.02025,"19.0":0.09114},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02442,"4.4":0,"4.4.3-4.4.4":0.10786},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01807,"5.5":0},S:{"2.5":0.06554,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":78.27341},R:{_:"0"},M:{"0":0.13928},Q:{"13.1":0},O:{"0":0.47519},H:{"0":1.2876}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KN.js
index 9a64d158f2bbb2..c4ff6d2695df0c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00458,"114":0,"115":0.19673,"116":0.21503,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.02288,"30":0,"31":0.00458,"32":0,"33":0,"34":0.00458,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00458,"49":0,"50":0,"51":0,"52":0,"53":0.00458,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00458,"61":0,"62":0,"63":0,"64":0.00458,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00458,"71":0,"72":0,"73":0,"74":0.02288,"75":0.04118,"76":0.04575,"77":0.00915,"78":0,"79":0.4209,"80":0.00458,"81":0.00458,"83":0.04575,"84":0,"85":0,"86":0,"87":0,"88":0.01373,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00458,"95":0.00458,"96":0,"97":0,"98":0,"99":0.00915,"100":0,"101":0,"102":0.00458,"103":0.05033,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.44378,"110":0.00458,"111":0.01373,"112":0.0915,"113":0.03203,"114":0.6771,"115":6.38213,"116":2.63978,"117":0.00915,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00915,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0.02745,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00915,"96":0,"97":0,"98":0,"99":0.00458,"100":0.0732,"101":0.0732,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00458,"15":0,"16":0.00458,"17":0,"18":0.00458,"79":0,"80":0,"81":0,"83":0,"84":0.00458,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0183,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00458,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.04118,"110":0.01373,"111":0,"112":0,"113":0.00915,"114":0.94245,"115":2.77245,"116":0.50325},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00458,"14":0.01373,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00458,"12.1":0.01373,"13.1":0.02745,"14.1":0.0549,"15.1":0.00915,"15.2-15.3":0.00458,"15.4":0.00458,"15.5":0.01373,"15.6":0.53528,"16.0":0.05948,"16.1":0.00915,"16.2":0.0183,"16.3":0.13725,"16.4":0.04118,"16.5":0.58103,"16.6":1.03853},G:{"8":0,"17":0.20215,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01758,"8.1-8.4":0,"9.0-9.2":0.00439,"9.3":0.08569,"10.0-10.2":0,"10.3":0.17798,"11.0-11.2":0.01758,"11.3-11.4":0.00439,"12.0-12.1":0.00439,"12.2-12.5":0.1648,"13.0-13.1":0,"13.2":0.00439,"13.3":0.00659,"13.4-13.7":0.04834,"14.0-14.4":0.01099,"14.5-14.8":0.1626,"15.0-15.1":0.03296,"15.2-15.3":0.00659,"15.4":0.03076,"15.5":0.04614,"15.6-15.7":0.84815,"16.0":0.52735,"16.1":0.87671,"16.2":0.35156,"16.3":1.25904,"16.4":0.29004,"16.5":5.42068,"16.6":11.37091},P:{"4":0.14802,"20":0.17973,"21":0.2326,"5.0-5.4":0.01057,"6.2-6.4":0,"7.2-7.4":0.21145,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03172,"12.0":0.01057,"13.0":0,"14.0":0,"15.0":0.01057,"16.0":0,"17.0":0.08458,"18.0":0,"19.0":0.02115},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.22709,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.79483},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03203,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":50.2823},R:{_:"0"},M:{"0":0.02713},Q:{"13.1":0},O:{"0":0.09223},H:{"0":1.39187}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.04164,"113":0,"114":0,"115":0.22382,"116":0.02082,"117":0.48407,"118":0.01562,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.02082,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.04685,"69":0.02603,"70":0.01562,"71":0.04164,"72":0.04164,"73":0.00521,"74":0.04164,"75":0.07808,"76":0.04685,"77":0.03644,"78":0.03644,"79":0.34353,"80":0.05205,"81":0.04685,"83":0.06767,"84":0.03123,"85":0.04685,"86":0.1041,"87":0.04685,"88":0.06767,"89":0.05205,"90":0.04685,"91":0.02082,"92":0,"93":0.01041,"94":0.00521,"95":0,"96":0,"97":0,"98":0,"99":0.00521,"100":0.00521,"101":0,"102":0,"103":0.03644,"104":0,"105":0.02082,"106":0,"107":0,"108":0.02082,"109":0.44243,"110":0.01041,"111":0,"112":0.04685,"113":0.02603,"114":0.13013,"115":0.3123,"116":8.4269,"117":2.12885,"118":0.00521,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00521,"50":0,"51":0,"52":0,"53":0,"54":0.00521,"55":0.00521,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00521,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.0989,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00521,"101":0.09369,"102":0.24464,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00521,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0.00521,"81":0.00521,"83":0.01041,"84":0.01041,"85":0.01041,"86":0.00521,"87":0,"88":0,"89":0.00521,"90":0.00521,"91":0,"92":0.04685,"93":0,"94":0,"95":0,"96":0,"97":0.00521,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00521,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.06246,"110":0.01562,"111":0.00521,"112":0,"113":0,"114":1.95708,"115":0.19259,"116":4.13277,"117":1.12949},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01041,"15":0.01562,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.21861,"10.1":0,"11.1":0,"12.1":0.00521,"13.1":0,"14.1":0.03644,"15.1":0.00521,"15.2-15.3":0.03644,"15.4":0.00521,"15.5":0.01041,"15.6":0.53612,"16.0":0,"16.1":0.16136,"16.2":0.01041,"16.3":0.06246,"16.4":0.02082,"16.5":0.7235,"16.6":0.86403,"17.0":0.01041,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02018,"10.0-10.2":0.01413,"10.3":0.28857,"11.0-11.2":0.00404,"11.3-11.4":0.00404,"12.0-12.1":0.00807,"12.2-12.5":0.45404,"13.0-13.1":0,"13.2":0,"13.3":0.01211,"13.4-13.7":0.02623,"14.0-14.4":0.06458,"14.5-14.8":0.08677,"15.0-15.1":0.05852,"15.2-15.3":0.01413,"15.4":0.02825,"15.5":0.11099,"15.6-15.7":0.94037,"16.0":0.32691,"16.1":0.72042,"16.2":0.14328,"16.3":1.02715,"16.4":0.3027,"16.5":0.73858,"16.6":13.09864,"17.0":1.27334,"17.1":0},P:{"4":0.27223,"20":0.05235,"21":0.08376,"22":2.03124,"5.0-5.4":0,"6.2-6.4":0.01047,"7.2-7.4":0.13611,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01047,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.01047,"17.0":0,"18.0":0,"19.0":0.07329},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.33643,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.43255},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.06767,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.54735},R:{_:"0"},M:{"0":0.11508},Q:{"13.1":0},O:{"0":0},H:{"0":1.06227}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KP.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KP.js
index 1c694982a9e082..f7194d934d8aff 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KP.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KP.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.02355,"100":0,"101":0.27379,"102":0,"103":0.01178,"104":0.01178,"105":0,"106":0,"107":0,"108":0,"109":0.05594,"110":0,"111":0,"112":0,"113":0.06771,"114":0.29734,"115":0.27379,"116":0.11482,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.01178,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01178,"96":0,"97":0,"98":0,"99":0,"100":0.01178,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.03533,"115":0.01178,"116":0.02355},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0.20608,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0.02355,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.33267,"16.0":0,"16.1":0.09126,"16.2":0.07949,"16.3":0.33267,"16.4":0.24141,"16.5":1.58976,"16.6":4.41894},G:{"8":0,"17":0.35444,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.05317,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.05317,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":4.21787,"16.0":4.46598,"16.1":4.36851,"16.2":1.55955,"16.3":4.06724,"16.4":3.11024,"16.5":39.51155,"16.6":26.85793},P:{"4":0,"20":0,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":2.69037},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":1.28,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.79886,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.15887,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":1.11659,"102":0,"103":0,"104":0,"105":0,"106":0.48113,"107":0,"108":0,"109":0.64,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":9.74977,"117":0.31773,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.15887,"116":2.23773,"117":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.15887,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":3.03659,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0.86515,"13.4-13.7":0.43257,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.43257,"15.6-15.7":6.04995,"16.0":1.29772,"16.1":2.59545,"16.2":5.61738,"16.3":1.7303,"16.4":0,"16.5":7.78025,"16.6":29.38462,"17.0":4.31965,"17.1":0},P:{"4":0,"20":0,"21":0,"22":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":7.00568},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":7.4488},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KR.js
index b3ada418ee0f17..220ccd3e340fcc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00345,"51":0,"52":0.00345,"53":0.00345,"54":0,"55":0,"56":0.00345,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00345,"79":0,"80":0.00345,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00345,"103":0,"104":0,"105":0,"106":0.00345,"107":0,"108":0,"109":0.00345,"110":0.00345,"111":0,"112":0,"113":0,"114":0,"115":0.03101,"116":0.13436,"117":0.00689,"118":0.00345,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00345,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00345,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00689,"69":0,"70":0,"71":0.00345,"72":0,"73":0,"74":0.00345,"75":0,"76":0,"77":0.02756,"78":0.00345,"79":0.00689,"80":0.00345,"81":0.01378,"83":0.00345,"84":0,"85":0.00345,"86":0.00689,"87":0.00345,"88":0,"89":0.00345,"90":0.02412,"91":0,"92":0,"93":0,"94":0.05857,"95":0,"96":0,"97":0.00345,"98":0.00345,"99":0.00345,"100":0.00689,"101":0.01034,"102":0.01034,"103":0.01034,"104":0.00689,"105":0.00345,"106":0.01034,"107":0.00689,"108":0.01723,"109":0.30316,"110":0.00689,"111":0.01378,"112":0.02067,"113":0.02412,"114":0.23426,"115":4.37171,"116":2.64921,"117":0.00345,"118":0.00345,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00689,"72":0.00345,"73":0,"74":0,"75":0,"76":0,"77":0.00345,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.01378,"101":0.0379,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00345,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00345,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00345,"104":0,"105":0.00345,"106":0.00345,"107":0.00689,"108":0.00689,"109":0.03445,"110":0.00345,"111":0.00689,"112":0.00689,"113":0.00689,"114":0.04823,"115":1.38834,"116":0.48575},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00345,"15":0,"17":0.00345,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00345,"14.1":0.00689,"15.1":0.01378,"15.2-15.3":0.00345,"15.4":0.00345,"15.5":0.00689,"15.6":0.02067,"16.0":0.00345,"16.1":0.00689,"16.2":0.01034,"16.3":0.02756,"16.4":0.01034,"16.5":0.09991,"16.6":0.12402},G:{"8":0,"17":0.15666,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00482,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00482,"10.0-10.2":0,"10.3":0.00241,"11.0-11.2":0.00723,"11.3-11.4":0,"12.0-12.1":0.00723,"12.2-12.5":0.06025,"13.0-13.1":0.08676,"13.2":0.00482,"13.3":0.01446,"13.4-13.7":0.02892,"14.0-14.4":0.10605,"14.5-14.8":0.23137,"15.0-15.1":0.0723,"15.2-15.3":0.094,"15.4":0.10605,"15.5":0.16148,"15.6-15.7":0.85319,"16.0":1.04359,"16.1":1.38824,"16.2":0.81703,"16.3":1.50633,"16.4":0.3567,"16.5":5.23722,"16.6":11.73012},P:{"4":0.01012,"20":0.29362,"21":1.18459,"22":13.86069,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.01012,"13.0":0.02025,"14.0":0.01012,"15.0":0.01012,"16.0":0.03037,"17.0":0.0405,"18.0":0.081,"19.0":0.11137},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.24756},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0689,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":34.39446},R:{_:"0"},M:{"0":0.12455},Q:{"13.1":0.00656},O:{"0":0.08522},H:{"0":0.2172}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00393,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00393,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01572,"116":0.00786,"117":0.1965,"118":0.01965,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00393,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00393,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00786,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.02751,"78":0,"79":0.00393,"80":0.00393,"81":0.01572,"83":0.00393,"84":0,"85":0.00393,"86":0.00786,"87":0.00786,"88":0,"89":0.00393,"90":0.02358,"91":0,"92":0,"93":0,"94":0.05502,"95":0.00393,"96":0,"97":0,"98":0.00393,"99":0.00393,"100":0.00786,"101":0.01179,"102":0.01179,"103":0.01179,"104":0.00786,"105":0.00786,"106":0.01179,"107":0.01179,"108":0.02358,"109":0.36156,"110":0.01179,"111":0.02358,"112":0.02751,"113":0.01965,"114":0.07074,"115":0.12969,"116":7.80891,"117":1.88247,"118":0.00393,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00393,"73":0,"74":0,"75":0,"76":0,"77":0.01572,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00393,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.02751,"102":0.02751,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00393,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00786,"108":0.00786,"109":0.03537,"110":0.00393,"111":0.00786,"112":0.00786,"113":0.00786,"114":0.02751,"115":0.03144,"116":1.21044,"117":0.97857},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00393,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00393,"14.1":0.00786,"15.1":0.01572,"15.2-15.3":0.00393,"15.4":0.00393,"15.5":0.00393,"15.6":0.01965,"16.0":0.00393,"16.1":0.00786,"16.2":0.00786,"16.3":0.02358,"16.4":0.00786,"16.5":0.02751,"16.6":0.20829,"17.0":0.02358,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01049,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00419,"9.3":0.00419,"10.0-10.2":0,"10.3":0.00839,"11.0-11.2":0.01049,"11.3-11.4":0,"12.0-12.1":0.00419,"12.2-12.5":0.04824,"13.0-13.1":0.08599,"13.2":0.0797,"13.3":0.02727,"13.4-13.7":0.01678,"14.0-14.4":0.09858,"14.5-14.8":0.16779,"15.0-15.1":0.06082,"15.2-15.3":0.08599,"15.4":0.10906,"15.5":0.14053,"15.6-15.7":0.69843,"16.0":0.77813,"16.1":1.00884,"16.2":0.60195,"16.3":1.01304,"16.4":0.22442,"16.5":0.74667,"16.6":13.38134,"17.0":1.39476,"17.1":0.0021},P:{"4":0,"20":0.17196,"21":0.47542,"22":14.6875,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.01012,"13.0":0.03035,"14.0":0.01012,"15.0":0.01012,"16.0":0.04046,"17.0":0.04046,"18.0":0.08092,"19.0":0.07081},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.19179},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.06288,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":33.98756},R:{_:"0"},M:{"0":0.13961},Q:{"13.1":0.00607},O:{"0":0.07284},H:{"0":0.23561}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KW.js
index a864e593deca2e..1b5a749c117f22 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00278,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00278,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00278,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00833,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00555,"113":0.00278,"114":0,"115":0.04718,"116":0.14153,"117":0.00833,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00278,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00278,"48":0,"49":0.0111,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00278,"57":0,"58":0.00278,"59":0,"60":0,"61":0,"62":0.00278,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00278,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00555,"76":0,"77":0,"78":0.00555,"79":0.00278,"80":0,"81":0.00278,"83":0.00278,"84":0,"85":0,"86":0.00278,"87":0.00555,"88":0.00278,"89":0.00278,"90":0.0111,"91":0.00278,"92":0.00278,"93":0.00555,"94":0.00278,"95":0.00278,"96":0.00278,"97":0,"98":0.0333,"99":0.0111,"100":0,"101":0.00278,"102":0.00278,"103":0.01943,"104":0.00278,"105":0.00278,"106":0.00278,"107":0.00278,"108":0.00555,"109":0.23588,"110":0.00555,"111":0.00833,"112":0.00833,"113":0.01665,"114":0.13875,"115":2.74725,"116":1.8537,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00555,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00278,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.01665,"68":0,"69":0.04718,"70":0.01943,"71":0.1665,"72":0.11655,"73":0,"74":0,"75":0.00278,"76":0.01388,"77":0.00833,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00555,"96":0,"97":0,"98":0,"99":0.00555,"100":0.12765,"101":0.0666,"102":0.00278,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00278,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00278,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00278,"106":0.00278,"107":0,"108":0.00278,"109":0.01388,"110":0,"111":0,"112":0.00278,"113":0.00555,"114":0.04995,"115":0.56055,"116":0.1998},E:{"4":0,"5":0,"6":0,"7":0.03053,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00278,"14":0.01665,"15":0.00555,"17":0.00555,_:"0","3.1":0,"3.2":0,"5.1":0.00278,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00278,"13.1":0.0111,"14.1":0.0666,"15.1":0.0111,"15.2-15.3":0.00278,"15.4":0.01665,"15.5":0.02498,"15.6":0.06383,"16.0":0.00833,"16.1":0.04163,"16.2":0.01665,"16.3":0.05828,"16.4":0.0222,"16.5":0.13598,"16.6":0.21645},G:{"8":0,"17":0.26656,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00606,"8.1-8.4":0,"9.0-9.2":0.00606,"9.3":0.05452,"10.0-10.2":0.01212,"10.3":0.03029,"11.0-11.2":0.00606,"11.3-11.4":0.01212,"12.0-12.1":0.01515,"12.2-12.5":0.41498,"13.0-13.1":0.01817,"13.2":0.03029,"13.3":0.04544,"13.4-13.7":0.06664,"14.0-14.4":0.52403,"14.5-14.8":0.74515,"15.0-15.1":0.25141,"15.2-15.3":0.24838,"15.4":0.29988,"15.5":0.49677,"15.6-15.7":2.293,"16.0":1.251,"16.1":1.65387,"16.2":1.10258,"16.3":2.16275,"16.4":0.79362,"16.5":6.4398,"16.6":11.03186},P:{"4":0.09204,"20":0.15339,"21":0.51131,"22":2.77129,"5.0-5.4":0.01023,"6.2-6.4":0,"7.2-7.4":0.05113,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02045,"12.0":0.02045,"13.0":0.05113,"14.0":0.03068,"15.0":0.03068,"16.0":0.05113,"17.0":0.03068,"18.0":0.05113,"19.0":0.11249},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.09943},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00833,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":50.20885},R:{_:"0"},M:{"0":0.07948},Q:{"13.1":0},O:{"0":2.8611},H:{"0":2.10677}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00295,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0059,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.0059,"115":0.01771,"116":0.00886,"117":0.16236,"118":0.01181,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00295,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00295,"48":0,"49":0.00886,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00295,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00295,"65":0,"66":0,"67":0,"68":0.00295,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00295,"76":0,"77":0,"78":0.00295,"79":0.0059,"80":0.00295,"81":0,"83":0,"84":0,"85":0,"86":0.0059,"87":0.0059,"88":0.00886,"89":0,"90":0.00886,"91":0,"92":0.00295,"93":0.00295,"94":0.00295,"95":0.00295,"96":0,"97":0,"98":0.00886,"99":0.00886,"100":0,"101":0.00295,"102":0.01181,"103":0.02362,"104":0.00295,"105":0.00295,"106":0.00886,"107":0.0059,"108":0.01181,"109":0.22435,"110":0.00295,"111":0.01181,"112":0.00886,"113":0.02066,"114":0.05609,"115":0.07675,"116":4.54608,"117":1.07748,"118":0.00295,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0059,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0059,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.0059,"68":0,"69":0.02362,"70":0.0059,"71":0.02657,"72":0.19188,"73":0.0797,"74":0.00295,"75":0,"76":0,"77":0.02952,"78":0.00295,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00886,"96":0,"97":0,"98":0,"99":0.0059,"100":0.01771,"101":0.0797,"102":0.14465,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00295,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00295,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00295,"105":0.00295,"106":0,"107":0,"108":0.00886,"109":0.0059,"110":0.00295,"111":0,"112":0.00295,"113":0.00295,"114":0.01771,"115":0.02066,"116":0.41918,"117":0.34834},E:{"4":0,"5":0,"6":0,"7":0.02362,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00295,"14":0.01476,"15":0.0059,_:"0","3.1":0,"3.2":0,"5.1":0.00295,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01181,"14.1":0.07675,"15.1":0.00886,"15.2-15.3":0.00295,"15.4":0.01771,"15.5":0.01771,"15.6":0.05609,"16.0":0.0059,"16.1":0.03247,"16.2":0.01476,"16.3":0.03542,"16.4":0.01771,"16.5":0.04133,"16.6":0.28634,"17.0":0.02657,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00656,"8.1-8.4":0,"9.0-9.2":0.00984,"9.3":0.04922,"10.0-10.2":0,"10.3":0.06235,"11.0-11.2":0.00656,"11.3-11.4":0.01969,"12.0-12.1":0.01313,"12.2-12.5":0.34129,"13.0-13.1":0.05907,"13.2":0.05579,"13.3":0.0361,"13.4-13.7":0.10173,"14.0-14.4":0.40692,"14.5-14.8":0.70883,"15.0-15.1":0.21002,"15.2-15.3":0.26909,"15.4":0.26253,"15.5":0.46927,"15.6-15.7":2.47105,"16.0":1.12559,"16.1":1.54564,"16.2":0.97464,"16.3":1.71956,"16.4":0.52834,"16.5":2.10679,"16.6":16.38505,"17.0":2.52683,"17.1":0.00656},P:{"4":0.0509,"20":0.18325,"21":0.47848,"22":3.66496,"5.0-5.4":0.01018,"6.2-6.4":0,"7.2-7.4":0.13235,"8.2":0,"9.2":0.01018,"10.1":0,"11.1-11.2":0.06108,"12.0":0.02036,"13.0":0.04072,"14.0":0.04072,"15.0":0.03054,"16.0":0.08144,"17.0":0.04072,"18.0":0.0509,"19.0":0.14253},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.08066},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00886,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":46.91831},R:{_:"0"},M:{"0":0.11277},Q:{"13.1":0.00705},O:{"0":2.18488},H:{"0":1.76824}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KY.js
index c0206f87b55e6d..7d71e9b6b49da6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00559,"111":0.04474,"112":0,"113":0.01678,"114":0.05034,"115":0.15101,"116":0.52015,"117":0.01119,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00559,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00559,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00559,"71":0,"72":0,"73":0,"74":0.00559,"75":0,"76":0.05593,"77":0.00559,"78":0,"79":0.03915,"80":0,"81":0.00559,"83":0.01678,"84":0,"85":0,"86":0,"87":0.00559,"88":0,"89":0,"90":0,"91":0.01119,"92":0.05034,"93":0.03915,"94":0,"95":0.00559,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.11745,"104":0,"105":0.02237,"106":0,"107":0.00559,"108":0.01119,"109":0.24609,"110":0.03915,"111":0.28524,"112":0.03915,"113":0.02797,"114":1.21368,"115":11.87394,"116":4.32339,"117":0,"118":0.02237,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01119,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.38592,"101":0.09508,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02797,"110":0.05034,"111":0,"112":0.00559,"113":0,"114":0.44185,"115":2.9531,"116":0.80539},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01119,"14":0.02237,"15":0.00559,"17":0.00559,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.07271,"13.1":0.12864,"14.1":0.11186,"15.1":0.03915,"15.2-15.3":0.07271,"15.4":0.05593,"15.5":0.09508,"15.6":0.51456,"16.0":0.01678,"16.1":0.1622,"16.2":0.12305,"16.3":0.79421,"16.4":0.05593,"16.5":0.87251,"16.6":3.37258},G:{"8":0,"17":0.48855,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.0099,"9.3":0.0132,"10.0-10.2":0,"10.3":0.06602,"11.0-11.2":0.0033,"11.3-11.4":0.02641,"12.0-12.1":0,"12.2-12.5":0.15845,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.05612,"14.0-14.4":0.03961,"14.5-14.8":0.18486,"15.0-15.1":0.15185,"15.2-15.3":0.02971,"15.4":0.02641,"15.5":0.24098,"15.6-15.7":2.76627,"16.0":0.88468,"16.1":1.37653,"16.2":0.80545,"16.3":2.5583,"16.4":0.40933,"16.5":6.9949,"16.6":15.69644},P:{"4":0.15365,"20":0.08195,"21":0.09219,"22":4.08708,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03073,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01024,"12.0":0,"13.0":0.01024,"14.0":0,"15.0":0,"16.0":0.02049,"17.0":0.05122,"18.0":0,"19.0":0.01024},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.18898},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00559,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":28.65059},R:{_:"0"},M:{"0":0.09255},Q:{"13.1":0},O:{"0":0.0617},H:{"0":0.05424}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00629,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00629,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00629,"112":0,"113":0,"114":0.01258,"115":0.28296,"116":0.0503,"117":0.91176,"118":0.05659,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00629,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00629,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.08174,"80":0,"81":0.00629,"83":0.00629,"84":0,"85":0,"86":0,"87":0.00629,"88":0,"89":0,"90":0,"91":0.01886,"92":0.06288,"93":0.00629,"94":0,"95":0,"96":0.00629,"97":0,"98":0,"99":0.00629,"100":0.00629,"101":0.01886,"102":0,"103":1.27646,"104":0,"105":0.00629,"106":0,"107":0.03144,"108":0.00629,"109":0.40243,"110":0,"111":0.01258,"112":0.03144,"113":0.03144,"114":0.35842,"115":0.59736,"116":19.74432,"117":3.04339,"118":0,"119":0.00629,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00629,"73":0,"74":0,"75":0,"76":0,"77":0.00629,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00629,"96":0,"97":0,"98":0,"99":0.03144,"100":0.06917,"101":0.13205,"102":0.18864,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01258,"110":0.06917,"111":0,"112":0,"113":0,"114":0.10061,"115":0.16349,"116":2.5152,"117":1.6223},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01258,"14":0.01258,"15":0.00629,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.06288,"13.1":0.42758,"14.1":0.18235,"15.1":0.00629,"15.2-15.3":0.03144,"15.4":0.06288,"15.5":0.03773,"15.6":0.80486,"16.0":0.01886,"16.1":0.29554,"16.2":0.08174,"16.3":1.52798,"16.4":0.08174,"16.5":0.17606,"16.6":2.68498,"17.0":0.03773,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00303,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00909,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.04544,"11.0-11.2":0.00606,"11.3-11.4":0.00606,"12.0-12.1":0,"12.2-12.5":0.21204,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.01515,"14.0-14.4":0.04241,"14.5-14.8":0.13025,"15.0-15.1":0.0212,"15.2-15.3":0.0727,"15.4":0.03332,"15.5":0.1454,"15.6-15.7":2.57175,"16.0":0.88148,"16.1":1.12685,"16.2":0.62401,"16.3":1.62363,"16.4":0.1454,"16.5":0.67247,"16.6":19.8349,"17.0":1.58425,"17.1":0.00303},P:{"4":0.0818,"20":0.03068,"21":0.05113,"22":4.09007,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03068,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.07158,"12.0":0,"13.0":0.01023,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0.01023,"19.0":0.0409},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.16462},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.16978,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":23.39747},R:{_:"0"},M:{"0":0.07795},Q:{"13.1":0},O:{"0":0.01114},H:{"0":0.08434}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KZ.js
index 56e8c8855a1834..be9b18388962b2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/KZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00285,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00285,"52":0.0114,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00285,"100":0,"101":0.00285,"102":0.00855,"103":0,"104":0,"105":0.01425,"106":0,"107":0.00285,"108":0,"109":0.00285,"110":0.00285,"111":0.0057,"112":0,"113":0.00285,"114":0.0057,"115":0.13395,"116":0.19665,"117":0.00855,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00285,"35":0.00285,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00285,"45":0.00285,"46":0,"47":0,"48":0,"49":0.0057,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00285,"65":0,"66":0.00285,"67":0,"68":0.0057,"69":0.0057,"70":0.0057,"71":0.00285,"72":0.0057,"73":0.00285,"74":0.01995,"75":0.00285,"76":0.00285,"77":0.0057,"78":0.0057,"79":0.01425,"80":0.0114,"81":0.00855,"83":0.00855,"84":0.00285,"85":0.01425,"86":0.0114,"87":0.0114,"88":0.00855,"89":0.0057,"90":0.00855,"91":0.00855,"92":0.0057,"93":0.00855,"94":0.00285,"95":0.00285,"96":0.0057,"97":0.00855,"98":0.00285,"99":0.00285,"100":0.00285,"101":0.00285,"102":0.01425,"103":0.0228,"104":0.0057,"105":0.0114,"106":0.0456,"107":0.0057,"108":0.0171,"109":0.58995,"110":0.00855,"111":0.0114,"112":0.0171,"113":0.01995,"114":0.1482,"115":2.07195,"116":1.0944,"117":0.00285,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00285,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00285,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00285,"72":0.00285,"73":0,"74":0,"75":0,"76":0.0057,"77":0.00285,"78":0,"79":0.0057,"80":0,"81":0,"82":0.00285,"83":0,"84":0.0057,"85":0.01425,"86":0.00855,"87":0.00285,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00285,"94":0,"95":0.10545,"96":0,"97":0,"98":0,"99":0.00855,"100":0.28785,"101":0.2679,"102":0.00285,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0.00285,"81":0,"83":0,"84":0.00285,"85":0,"86":0,"87":0,"88":0,"89":0.00285,"90":0.00285,"91":0,"92":0.00285,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0057,"110":0.00285,"111":0,"112":0.00285,"113":0.00285,"114":0.01425,"115":0.44175,"116":0.1254},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00285,"10":0,"11":0,"12":0,"13":0,"14":0.0057,"15":0,"17":0.0057,_:"0","3.1":0,"3.2":0,"5.1":0.01995,"6.1":0,"7.1":0,"9.1":0.0285,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0057,"14.1":0.01425,"15.1":0.0057,"15.2-15.3":0.00285,"15.4":0.0057,"15.5":0.00855,"15.6":0.0456,"16.0":0.0057,"16.1":0.01995,"16.2":0.0171,"16.3":0.0285,"16.4":0.0228,"16.5":0.0912,"16.6":0.11115},G:{"8":0,"17":0.1596,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00228,"8.1-8.4":0.00456,"9.0-9.2":0.00228,"9.3":0.02964,"10.0-10.2":0,"10.3":0.01368,"11.0-11.2":0.02736,"11.3-11.4":0.01596,"12.0-12.1":0.01824,"12.2-12.5":0.32149,"13.0-13.1":0.00684,"13.2":0.00684,"13.3":0.0342,"13.4-13.7":0.04332,"14.0-14.4":0.20292,"14.5-14.8":0.33517,"15.0-15.1":0.13452,"15.2-15.3":0.16416,"15.4":0.25764,"15.5":0.39673,"15.6-15.7":1.56411,"16.0":1.68495,"16.1":1.97908,"16.2":1.12862,"16.3":1.82859,"16.4":0.64069,"16.5":4.61025,"16.6":7.17302},P:{"4":0.10267,"20":0.19507,"21":0.3696,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.11293,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0308,"12.0":0.01027,"13.0":0.0308,"14.0":0.0308,"15.0":0.01027,"16.0":0.07187,"17.0":0.05133,"18.0":0.07187,"19.0":0.11293},I:{"0":0,"3":0,"4":0.0053,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0053,"4.2-4.3":0.01326,"4.4":0,"4.4.3-4.4.4":0.03183},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00926,"9":0.00309,"10":0.00309,"11":0.02161,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":60.885},R:{_:"0"},M:{"0":0.0715},Q:{"13.1":0.00715},O:{"0":0.715},H:{"0":0.33846}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00677,"47":0,"48":0.00677,"49":0,"50":0,"51":0,"52":0.01015,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01692,"69":0.00677,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00338,"77":0,"78":0.03722,"79":0.01692,"80":0,"81":0,"82":0.03046,"83":0,"84":0,"85":0.00338,"86":0,"87":0,"88":0.00677,"89":0,"90":0,"91":0,"92":0,"93":0.01015,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00338,"100":0,"101":0,"102":0.00338,"103":0.00338,"104":0,"105":0,"106":0,"107":0.00338,"108":0,"109":0,"110":0,"111":0.00338,"112":0,"113":0,"114":0.03046,"115":0.09137,"116":0.02369,"117":0.17258,"118":0.01354,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00338,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00338,"46":0,"47":0,"48":0,"49":0.01354,"50":0,"51":0.03046,"52":0,"53":0,"54":0,"55":0,"56":0.00338,"57":0,"58":0,"59":0,"60":0,"61":0.00338,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00338,"70":0,"71":0,"72":0,"73":0.00677,"74":0.03722,"75":0.06768,"76":0.05414,"77":0.05414,"78":0.06091,"79":0.05076,"80":0.11167,"81":0.04738,"83":0.05753,"84":0.06091,"85":0.03722,"86":0.05753,"87":0.0643,"88":0.08798,"89":0.04061,"90":0.26395,"91":0.02707,"92":0.01015,"93":0.16243,"94":0.00677,"95":0.00677,"96":0.02369,"97":0.0643,"98":0.03046,"99":0.03722,"100":0.03384,"101":0.04399,"102":0.05753,"103":0.0203,"104":0.01692,"105":0.06091,"106":0.06768,"107":0.22673,"108":0.06768,"109":0.74448,"110":0.03046,"111":0.0846,"112":0.04399,"113":0.03722,"114":0.31471,"115":0.17597,"116":2.52108,"117":0.58205,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00677,"55":0,"56":0,"57":0,"58":0,"60":0.0203,"62":0.02369,"63":0.00677,"64":0.00677,"65":0.00677,"66":0.01015,"67":0.01015,"68":0.00677,"69":0,"70":0.00677,"71":0,"72":0.00677,"73":0.00338,"74":0.01015,"75":0,"76":0.01015,"77":0.02369,"78":0,"79":0.00677,"80":0.0203,"81":0,"82":0,"83":0.00677,"84":0.00677,"85":0.01354,"86":0.00677,"87":0.00338,"88":0,"89":0,"90":0,"91":0.00677,"92":0.01354,"93":0,"94":0,"95":0.24365,"96":0,"97":0.01692,"98":0,"99":0.00677,"100":0.04399,"101":0.20304,"102":0.1692,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.01015,"18":0.04738,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01354,"89":0.00338,"90":0.07106,"91":0,"92":0.00338,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00338,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00338,"108":0,"109":0.00677,"110":0,"111":0.01692,"112":0.00338,"113":0.00338,"114":0.01692,"115":0.01692,"116":0.3181,"117":0.22673},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00338,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01354,"6.1":0,"7.1":0,"9.1":0.00338,"10.1":0,"11.1":0,"12.1":0.00677,"13.1":0.00338,"14.1":0.01354,"15.1":0.00338,"15.2-15.3":0.00338,"15.4":0.00338,"15.5":0.00677,"15.6":0.03384,"16.0":0.00338,"16.1":0.01692,"16.2":0.01354,"16.3":0.02369,"16.4":0.0203,"16.5":0.03384,"16.6":0.13536,"17.0":0.0203,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00681,"9.0-9.2":0,"9.3":0.02382,"10.0-10.2":0,"10.3":0.01021,"11.0-11.2":0.01361,"11.3-11.4":0.01021,"12.0-12.1":0.00681,"12.2-12.5":0.17696,"13.0-13.1":0,"13.2":0,"13.3":12.93153,"13.4-13.7":0.03063,"14.0-14.4":0.16335,"14.5-14.8":0.31989,"15.0-15.1":0.1157,"15.2-15.3":0.13952,"15.4":0.18717,"15.5":0.34711,"15.6-15.7":1.38503,"16.0":1.52116,"16.1":1.51095,"16.2":0.895,"16.3":1.52456,"16.4":0.42198,"16.5":1.27614,"16.6":9.49106,"17.0":1.36462,"17.1":0},P:{"4":0.06146,"20":0.13317,"21":0.16391,"22":1.53662,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.05122,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02049,"12.0":0,"13.0":0.01024,"14.0":0.02049,"15.0":0.01024,"16.0":0.04098,"17.0":0.03073,"18.0":0.06146,"19.0":0.08195},I:{"0":0,"3":0,"4":0.0039,"2.1":0,"2.2":0.00195,"2.3":0.00195,"4.1":0.00585,"4.2-4.3":0.00585,"4.4":0,"4.4.3-4.4.4":0.02728},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01015,"9":0.01015,"10":0.00677,"11":0.03722,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.6996},R:{_:"0"},M:{"0":0.05293},Q:{"13.1":0},O:{"0":0.4565},H:{"0":0.28186}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LA.js
index 67c69025d8820b..ab762ff7020934 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0.00271,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00271,"41":0.00813,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00271,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00271,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00271,"101":0,"102":0.00271,"103":0,"104":0,"105":0.00271,"106":0,"107":0.00271,"108":0,"109":0,"110":0.00271,"111":0,"112":0.00271,"113":0.00271,"114":0.02169,"115":0.09489,"116":0.20604,"117":0.01084,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00271},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.03524,"38":0,"39":0.00271,"40":0,"41":0.00271,"42":0,"43":0.01084,"44":0.00542,"45":0.00542,"46":0.00271,"47":0.00271,"48":0,"49":0.00271,"50":0,"51":0.00271,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00542,"60":0,"61":0,"62":0.00271,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00542,"70":0.00271,"71":0,"72":0.00271,"73":0,"74":0.00271,"75":0.00271,"76":0,"77":0,"78":0.00271,"79":0.01084,"80":0.00542,"81":0.00271,"83":0.03524,"84":0.00271,"85":0,"86":0.01084,"87":0.01627,"88":0.00542,"89":0.00542,"90":0.00542,"91":0.01084,"92":0.00271,"93":0.00271,"94":0.01627,"95":0.00271,"96":0.00271,"97":0.00813,"98":0.00542,"99":0.02169,"100":0.00542,"101":0.00271,"102":0.00542,"103":0.02982,"104":0.00542,"105":0.00813,"106":0.00542,"107":0.01084,"108":0.01898,"109":0.60184,"110":0.00542,"111":0.01356,"112":0.04067,"113":0.03524,"114":0.17079,"115":2.42092,"116":1.3067,"117":0.00813,"118":0.00542,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00271,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00271,"72":0.00271,"73":0,"74":0,"75":0,"76":0.00271,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00271,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01084,"96":0,"97":0,"98":0,"99":0.00271,"100":0.03795,"101":0.05151,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00271,"13":0,"14":0.00271,"15":0.00271,"16":0,"17":0,"18":0.00813,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00813,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01898,"110":0.00271,"111":0,"112":0.00271,"113":0.01084,"114":0.02982,"115":0.52593,"116":0.18706},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00542,"10":0,"11":0,"12":0,"13":0,"14":0.00542,"15":0,"17":0.00271,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00542,"13.1":0.01084,"14.1":0.03253,"15.1":0,"15.2-15.3":0,"15.4":0.00271,"15.5":0.00271,"15.6":0.06506,"16.0":0.00271,"16.1":0.01356,"16.2":0.00542,"16.3":0.01627,"16.4":0.00813,"16.5":0.05151,"16.6":0.07862},G:{"8":0,"17":0.07377,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00231,"6.0-6.1":0.01614,"7.0-7.1":0.01153,"8.1-8.4":0.02536,"9.0-9.2":0.00461,"9.3":0.05532,"10.0-10.2":0.02536,"10.3":0.06685,"11.0-11.2":0.0461,"11.3-11.4":0.00692,"12.0-12.1":0.02305,"12.2-12.5":0.69846,"13.0-13.1":0.01614,"13.2":0.03919,"13.3":0.02536,"13.4-13.7":0.2236,"14.0-14.4":0.60165,"14.5-14.8":0.69846,"15.0-15.1":0.19363,"15.2-15.3":0.43798,"15.4":0.36422,"15.5":0.61548,"15.6-15.7":3.31713,"16.0":0.94512,"16.1":1.3831,"16.2":1.03502,"16.3":1.68277,"16.4":0.69385,"16.5":4.05939,"16.6":5.65225},P:{"4":0.14316,"20":0.15339,"21":0.36813,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.16362,"8.2":0,"9.2":0.02045,"10.1":0,"11.1-11.2":0.0409,"12.0":0.01023,"13.0":0.01023,"14.0":0.0409,"15.0":0.11249,"16.0":0.03068,"17.0":0.0409,"18.0":0.0409,"19.0":0.08181},I:{"0":0,"3":0,"4":0.02814,"2.1":0.0201,"2.2":0.01608,"2.3":0.02412,"4.1":0.01608,"4.2-4.3":0.03618,"4.4":0,"4.4.3-4.4.4":0.14472},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00528,"8":0.03696,"9":0.00528,"10":0.00528,"11":0.04223,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00729},N:{"10":0.01093,"11":0.01093},L:{"0":63.50649},R:{_:"0"},M:{"0":0.16765},Q:{"13.1":0.10934},O:{"0":1.25371},H:{"0":0.28293}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00265,"40":0.00265,"41":0.00265,"42":0,"43":0.00265,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0053,"101":0,"102":0.00265,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.0106,"111":0,"112":0,"113":0.00265,"114":0.0053,"115":0.04768,"116":0.01325,"117":0.18013,"118":0.01854,"119":0,"120":0,"3.5":0,"3.6":0.00265},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00265,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.04238,"38":0,"39":0.00265,"40":0.00265,"41":0.00265,"42":0.00265,"43":0.00795,"44":0.0053,"45":0.0053,"46":0.00265,"47":0.00265,"48":0,"49":0.00265,"50":0,"51":0.0053,"52":0,"53":0,"54":0,"55":0,"56":0.00265,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00265,"64":0,"65":0.00265,"66":0,"67":0,"68":0.00265,"69":0.0053,"70":0.00265,"71":0,"72":0,"73":0,"74":0.00265,"75":0.00265,"76":0,"77":0,"78":0.0053,"79":0.0053,"80":0.0053,"81":0.00265,"83":0.02914,"84":0.00265,"85":0.00265,"86":0.0053,"87":0.0106,"88":0.00795,"89":0.0053,"90":0.01325,"91":0.00795,"92":0.0053,"93":0.00265,"94":0.01325,"95":0.00265,"96":0.00265,"97":0.00795,"98":0.00265,"99":0.02119,"100":0.0053,"101":0.00265,"102":0.02384,"103":0.04238,"104":0.0053,"105":0.00795,"106":0.0053,"107":0.02119,"108":0.03179,"109":0.55629,"110":0.0053,"111":0.01589,"112":0.01589,"113":0.03974,"114":0.06358,"115":0.09801,"116":2.75496,"117":0.6702,"118":0.00795,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00265,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00265,"70":0,"71":0,"72":0.00795,"73":0,"74":0,"75":0,"76":0,"77":0.00265,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00265,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01325,"96":0,"97":0,"98":0,"99":0,"100":0.00265,"101":0.04768,"102":0.04768,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00265},B:{"12":0.00265,"13":0,"14":0.00265,"15":0.00265,"16":0,"17":0,"18":0.01325,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00795,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00265,"107":0,"108":0.0053,"109":0.0106,"110":0,"111":0,"112":0.01589,"113":0.0053,"114":0.0053,"115":0.01854,"116":0.43179,"117":0.25166},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00795,"10":0,"11":0,"12":0,"13":0.00265,"14":0.00265,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00265,"13.1":0.0053,"14.1":0.01854,"15.1":0.00265,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.03179,"16.0":0,"16.1":0.0053,"16.2":0.00265,"16.3":0.02119,"16.4":0.0053,"16.5":0.01589,"16.6":0.11921,"17.0":0.01854,"17.1":0},G:{"8":0.00231,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00231,"6.0-6.1":0.01157,"7.0-7.1":0.01851,"8.1-8.4":0.03238,"9.0-9.2":0.00231,"9.3":0.08327,"10.0-10.2":0,"10.3":0.07633,"11.0-11.2":0.06014,"11.3-11.4":0.00925,"12.0-12.1":0.03238,"12.2-12.5":0.79803,"13.0-13.1":0.01388,"13.2":0.00463,"13.3":0.04395,"13.4-13.7":0.25445,"14.0-14.4":0.6153,"14.5-14.8":0.60142,"15.0-15.1":0.20356,"15.2-15.3":0.31227,"15.4":0.30302,"15.5":0.49733,"15.6-15.7":3.29854,"16.0":0.83504,"16.1":1.28842,"16.2":0.70319,"16.3":1.32312,"16.4":0.5806,"16.5":1.36475,"16.6":8.26023,"17.0":1.24447,"17.1":0.00463},P:{"4":0.15413,"20":0.1233,"21":0.30825,"22":1.61318,"5.0-5.4":0,"6.2-6.4":0.03083,"7.2-7.4":0.11303,"8.2":0,"9.2":0.02055,"10.1":0,"11.1-11.2":0.03083,"12.0":0.01028,"13.0":0.01028,"14.0":0.02055,"15.0":0.09248,"16.0":0.0411,"17.0":0.0411,"18.0":0.05138,"19.0":0.06165},I:{"0":0,"3":0.0061,"4":0.02745,"2.1":0.0122,"2.2":0.01525,"2.3":0.02135,"4.1":0.0244,"4.2-4.3":0.0427,"4.4":0,"4.4.3-4.4.4":0.13115},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.0031,"8":0.03724,"9":0.00621,"10":0.00621,"11":0.05275,"5.5":0},S:{"2.5":0.00735,_:"3.0-3.1"},J:{"7":0,"10":0.0147},N:{"10":0.0196,"11":0.0098},L:{"0":64.60617},R:{_:"0"},M:{"0":0.09556},Q:{"13.1":0.05881},O:{"0":1.04384},H:{"0":0.18791}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LB.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LB.js
index 0cf0220b03d81d..bf0a89eda3eb3b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LB.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LB.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.003,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00901,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01202,"79":0,"80":0,"81":0,"82":0,"83":0.003,"84":0,"85":0.003,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.003,"100":0,"101":0,"102":0.03004,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.003,"111":0,"112":0,"113":0.00901,"114":0.00601,"115":0.14119,"116":0.25834,"117":0.00901,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01502,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00901,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.02704,"59":0,"60":0.003,"61":0,"62":0,"63":0,"64":0.003,"65":0.00901,"66":0,"67":0.00601,"68":0.003,"69":0,"70":0,"71":0,"72":0,"73":0.00601,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00601,"80":0.003,"81":0.00601,"83":0.003,"84":0.003,"85":0.003,"86":0.00601,"87":0.00901,"88":0.003,"89":0.003,"90":0.003,"91":0.00901,"92":0.003,"93":0.003,"94":0,"95":0.003,"96":0.003,"97":0.003,"98":0.003,"99":0.003,"100":0.003,"101":0,"102":0.003,"103":0.03004,"104":0.003,"105":0.01202,"106":0.00601,"107":0.00601,"108":0.01802,"109":0.79005,"110":0.00601,"111":0.01802,"112":0.03004,"113":0.01802,"114":0.26135,"115":2.68558,"116":1.45093,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.003,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.003,"70":0,"71":0.01502,"72":0.00901,"73":0,"74":0,"75":0,"76":0.003,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01202,"96":0,"97":0,"98":0,"99":0.003,"100":0.10214,"101":0.09913,"102":0.003,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.003,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.003,"90":0,"91":0,"92":0.00601,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.003,"101":0,"102":0,"103":0,"104":0,"105":0.003,"106":0,"107":0,"108":0.003,"109":0.02103,"110":0,"111":0,"112":0.003,"113":0.00601,"114":0.02403,"115":0.56776,"116":0.18024},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.003,"14":0.01802,"15":0.003,"17":0.00901,_:"0","3.1":0,"3.2":0,"5.1":0.0781,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.003,"13.1":0.01802,"14.1":0.03905,"15.1":0.00901,"15.2-15.3":0.00901,"15.4":0.00901,"15.5":0.03304,"15.6":0.12917,"16.0":0.00901,"16.1":0.03004,"16.2":0.02103,"16.3":0.04806,"16.4":0.02403,"16.5":0.21328,"16.6":0.2223},G:{"8":0,"17":0.23161,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0327,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0872,"10.0-10.2":0,"10.3":0.08992,"11.0-11.2":0,"11.3-11.4":0.00817,"12.0-12.1":0.02452,"12.2-12.5":0.47957,"13.0-13.1":0.00272,"13.2":0.00545,"13.3":0.01907,"13.4-13.7":0.13352,"14.0-14.4":0.16894,"14.5-14.8":0.46868,"15.0-15.1":0.08992,"15.2-15.3":0.12262,"15.4":0.13897,"15.5":0.28339,"15.6-15.7":2.18534,"16.0":1.11174,"16.1":1.4578,"16.2":0.74661,"16.3":1.76026,"16.4":0.40873,"16.5":5.65135,"16.6":11.52342},P:{"4":0.1228,"20":0.1228,"21":0.44003,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.17396,"8.2":0,"9.2":0.02047,"10.1":0.01023,"11.1-11.2":0.04093,"12.0":0.01023,"13.0":0.0614,"14.0":0.0614,"15.0":0.0307,"16.0":0.07163,"17.0":0.13303,"18.0":0.05117,"19.0":0.0921},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00731,"4.4":0,"4.4.3-4.4.4":0.12178},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.003,"10":0,"11":0.02103,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":56.44407},R:{_:"0"},M:{"0":0.14692},Q:{"13.1":0.007},O:{"0":0.25885},H:{"0":0.37091}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00629,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00314,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00314,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00314,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00314,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00314,"100":0,"101":0,"102":0.01258,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00314,"112":0,"113":0.00314,"114":0.00314,"115":0.08803,"116":0.03458,"117":0.27353,"118":0.02515,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.03458,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00314,"47":0,"48":0,"49":0.00943,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00314,"57":0,"58":0.01886,"59":0,"60":0.00314,"61":0,"62":0,"63":0,"64":0,"65":0.00314,"66":0.00314,"67":0.00629,"68":0.01258,"69":0.00314,"70":0.00314,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00314,"77":0,"78":0,"79":0.01258,"80":0.00314,"81":0.00629,"83":0.00629,"84":0.00314,"85":0,"86":0.01258,"87":0.00629,"88":0.00314,"89":0.00314,"90":0.00314,"91":0.00943,"92":0,"93":0.00943,"94":0.00314,"95":0.00314,"96":0,"97":0,"98":0.00314,"99":0.00629,"100":0.00314,"101":0,"102":0.00314,"103":0.01886,"104":0.00314,"105":0.00314,"106":0.0503,"107":0.00629,"108":0.03458,"109":0.85517,"110":0.00629,"111":0.00629,"112":0.02201,"113":0.01572,"114":0.06288,"115":0.11318,"116":3.89856,"117":1.05324,"118":0.00314,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00314,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00314,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01258,"73":0.00314,"74":0,"75":0,"76":0,"77":0.01258,"78":0,"79":0.00314,"80":0,"81":0,"82":0,"83":0.00314,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01886,"96":0,"97":0,"98":0,"99":0.00314,"100":0.0283,"101":0.09118,"102":0.09746,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00314,"16":0,"17":0,"18":0.00314,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00314,"90":0,"91":0,"92":0.00943,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00314,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00314,"106":0,"107":0,"108":0,"109":0.02201,"110":0,"111":0.00314,"112":0.00314,"113":0.00314,"114":0.00943,"115":0.01572,"116":0.45902,"117":0.38357},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01258,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.0786,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00314,"13.1":0.01572,"14.1":0.03144,"15.1":0.00943,"15.2-15.3":0.00629,"15.4":0.00314,"15.5":0.05974,"15.6":0.06917,"16.0":0.00314,"16.1":0.02201,"16.2":0.01572,"16.3":0.03458,"16.4":0.00943,"16.5":0.04087,"16.6":0.31126,"17.0":0.02201,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.04782,"8.1-8.4":0,"9.0-9.2":0.00266,"9.3":0.09033,"10.0-10.2":0,"10.3":0.06376,"11.0-11.2":0.00531,"11.3-11.4":0.00531,"12.0-12.1":0.01594,"12.2-12.5":0.55789,"13.0-13.1":0.00531,"13.2":0,"13.3":0.0186,"13.4-13.7":0.05313,"14.0-14.4":0.23378,"14.5-14.8":0.45163,"15.0-15.1":0.08501,"15.2-15.3":0.13815,"15.4":0.11158,"15.5":0.28957,"15.6-15.7":2.30596,"16.0":0.93514,"16.1":1.36286,"16.2":0.56321,"16.3":1.37083,"16.4":0.26832,"16.5":0.86606,"16.6":14.80014,"17.0":1.46115,"17.1":0},P:{"4":0.13316,"20":0.08194,"21":0.23558,"22":4.01514,"5.0-5.4":0.01024,"6.2-6.4":0,"7.2-7.4":0.12291,"8.2":0,"9.2":0.01024,"10.1":0,"11.1-11.2":0.03073,"12.0":0.01024,"13.0":0.04097,"14.0":0.05121,"15.0":0.02049,"16.0":0.06146,"17.0":0.11267,"18.0":0.04097,"19.0":0.09218},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01218,"4.4":0,"4.4.3-4.4.4":0.14013},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01572,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.2122},R:{_:"0"},M:{"0":0.1714},Q:{"13.1":0},O:{"0":0.22625},H:{"0":0.26612}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LC.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LC.js
index 53be4ca19f2766..03599c88d65330 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LC.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LC.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00407,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.01628,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00814,"111":0,"112":0,"113":0,"114":0.00407,"115":0.08142,"116":0.30125,"117":0.00407,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00407,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00407,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00407,"76":0.00814,"77":0,"78":0,"79":0.03257,"80":0,"81":0.01628,"83":0,"84":0,"85":0.00407,"86":0,"87":0.00814,"88":0.00407,"89":0,"90":0.00407,"91":0,"92":0,"93":0.03257,"94":0,"95":0,"96":0.02036,"97":0,"98":0,"99":0.00407,"100":0,"101":0,"102":0,"103":0.12213,"104":0.00814,"105":0.00407,"106":0.00407,"107":0.00407,"108":0.01221,"109":0.25647,"110":0,"111":0.00407,"112":0.00814,"113":0.01221,"114":0.82234,"115":6.27748,"116":3.11024,"117":0.02443,"118":0.04071,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00407,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00407,"96":0,"97":0,"98":0,"99":0.00407,"100":0.10178,"101":0.1547,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00407,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00814,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00407,"105":0,"106":0,"107":0,"108":0.00407,"109":0.00814,"110":0.00407,"111":0,"112":0,"113":0.00407,"114":0.10585,"115":1.44113,"116":0.4071},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.03257,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00407,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00407,"13.1":0.0285,"14.1":0.0285,"15.1":0,"15.2-15.3":0,"15.4":0.00407,"15.5":0.00814,"15.6":0.10992,"16.0":0.01221,"16.1":0.02036,"16.2":0.12213,"16.3":0.04885,"16.4":0.04885,"16.5":0.21576,"16.6":0.17505},G:{"8":0,"17":0.16071,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.27211,"10.0-10.2":0,"10.3":0.00913,"11.0-11.2":0.02557,"11.3-11.4":0,"12.0-12.1":0.01461,"12.2-12.5":0.22645,"13.0-13.1":0,"13.2":0,"13.3":0.00365,"13.4-13.7":0.01826,"14.0-14.4":0.05661,"14.5-14.8":0.1187,"15.0-15.1":0.06757,"15.2-15.3":0.04931,"15.4":0.17532,"15.5":0.06392,"15.6-15.7":1.47741,"16.0":0.61361,"16.1":0.77614,"16.2":0.53691,"16.3":1.27652,"16.4":0.22645,"16.5":3.97566,"16.6":8.11386},P:{"4":0.09387,"20":0.21902,"21":0.51106,"5.0-5.4":0,"6.2-6.4":0.01043,"7.2-7.4":0.39633,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03129,"12.0":0.01043,"13.0":0.01043,"14.0":0.01043,"15.0":0.01043,"16.0":0.04172,"17.0":0.02086,"18.0":0.04172,"19.0":0.07301},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.86234},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00407,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.26079},R:{_:"0"},M:{"0":0.21937},Q:{"13.1":0},O:{"0":0.05336},H:{"0":0.16278}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00406,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00406,"114":0,"115":0.04872,"116":0.02842,"117":0.21924,"118":0.01624,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00406,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00812,"77":0,"78":0.01624,"79":0.01218,"80":0,"81":0.00406,"83":0.00812,"84":0,"85":0,"86":0,"87":0.0203,"88":0.01218,"89":0,"90":0,"91":0,"92":0,"93":0.08526,"94":0.00406,"95":0.00406,"96":0.01624,"97":0,"98":0,"99":0,"100":0,"101":0.00406,"102":0.01218,"103":0.16646,"104":0.00406,"105":0.0609,"106":0.01624,"107":0.00406,"108":0.00406,"109":0.21924,"110":0.00406,"111":0.00406,"112":0.01218,"113":0.00812,"114":0.15428,"115":0.31262,"116":7.64904,"117":1.89196,"118":0.02842,"119":0.0203,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.02842,"73":0,"74":0,"75":0,"76":0,"77":0.0203,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0203,"101":0.09338,"102":0.19082,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00406,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00406,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0203,"110":0.00406,"111":0.00406,"112":0,"113":0.01218,"114":0.03654,"115":0.0812,"116":1.27078,"117":0.79982},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01624,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.0406,"12.1":0.00812,"13.1":0.02842,"14.1":0.01218,"15.1":0.00406,"15.2-15.3":0.00406,"15.4":0.00406,"15.5":0.00812,"15.6":0.40194,"16.0":0.00812,"16.1":0.00406,"16.2":0.01218,"16.3":0.0203,"16.4":0.00812,"16.5":0.04466,"16.6":0.4669,"17.0":0.01624,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00345,"6.0-6.1":0,"7.0-7.1":0.01036,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.2608,"10.0-10.2":0,"10.3":0.00864,"11.0-11.2":0.00864,"11.3-11.4":0.00173,"12.0-12.1":0.00173,"12.2-12.5":0.16408,"13.0-13.1":0.01036,"13.2":0.00345,"13.3":0.00345,"13.4-13.7":0.01036,"14.0-14.4":0.04145,"14.5-14.8":0.08118,"15.0-15.1":0.05354,"15.2-15.3":0.08118,"15.4":0.03109,"15.5":0.03109,"15.6-15.7":1.48362,"16.0":0.45769,"16.1":0.76858,"16.2":0.26253,"16.3":0.94129,"16.4":0.12263,"16.5":0.42488,"16.6":10.1936,"17.0":1.57343,"17.1":0.00173},P:{"4":0.104,"20":0.1872,"21":0.35359,"22":4.77353,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.58239,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0832,"12.0":0,"13.0":0.0312,"14.0":0.0104,"15.0":0.0208,"16.0":0.052,"17.0":0.052,"18.0":0.0312,"19.0":0.104},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.60246},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00406,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00594},N:{"10":0,"11":0},L:{"0":57.80884},R:{_:"0"},M:{"0":0.08316},Q:{"13.1":0},O:{"0":0.09504},H:{"0":0.25306}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LI.js
index 0cec2a849c52c3..fe8aa55d2a153a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LI.js
@@ -1 +1 @@
-module.exports={C:{"2":0.013,"3":0.03901,"4":0.01951,"5":0,"6":0.02601,"7":0,"8":0.0065,"9":0.0065,"10":0,"11":0,"12":0.013,"13":0.013,"14":0.013,"15":0.0065,"16":0.013,"17":0.013,"18":0,"19":0,"20":0.0065,"21":0.0065,"22":0.013,"23":0.0065,"24":0.013,"25":0,"26":0.01951,"27":0.013,"28":0.0065,"29":0.0065,"30":0.013,"31":0.03901,"32":0.01951,"33":0.0065,"34":0.03251,"35":0.013,"36":0.013,"37":0.03251,"38":0.02601,"39":0.04551,"40":0.06502,"41":0.013,"42":0.03251,"43":0.0065,"44":0.0065,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.0065,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.0065,"78":0.0065,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.013,"102":0.03251,"103":0,"104":0,"105":0.013,"106":0,"107":0,"108":0,"109":0,"110":0.0065,"111":0.0065,"112":0.0065,"113":0.03901,"114":0.04551,"115":0.99481,"116":2.83487,"117":0.07802,"118":0,"119":0,"120":0,"3.5":0.01951,"3.6":0.04551},D:{"4":0.01951,"5":0.0065,"6":0,"7":0.013,"8":0,"9":0,"10":0,"11":0.013,"12":0,"13":0.0065,"14":0.013,"15":0.0065,"16":0.013,"17":0.013,"18":0.013,"19":0.03251,"20":0.013,"21":0.03901,"22":0.0065,"23":0.013,"24":0,"25":0.0065,"26":0.02601,"27":0.013,"28":0.02601,"29":0.01951,"30":0.01951,"31":0.06502,"32":0.013,"33":0.013,"34":0,"35":0.0065,"36":0.0065,"37":0.05202,"38":0.03901,"39":0.05852,"40":0.05852,"41":0.04551,"42":0.04551,"43":0.09753,"44":0.18206,"45":0.17555,"46":0.08453,"47":0.07802,"48":0,"49":0.14304,"50":0,"51":0.11053,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.03901,"71":0,"72":0,"73":0.03251,"74":0,"75":0,"76":0,"77":0,"78":0.013,"79":0.15605,"80":0,"81":0,"83":0,"84":0.01951,"85":0.0065,"86":0.11053,"87":0.013,"88":0.013,"89":0.013,"90":0.0065,"91":0,"92":0,"93":0,"94":0,"95":0.0065,"96":0.0065,"97":0,"98":0,"99":0,"100":0.013,"101":0,"102":0.0065,"103":0.02601,"104":0.0065,"105":0,"106":0.0065,"107":0.0065,"108":0.03251,"109":0.34461,"110":0.013,"111":0.0065,"112":0.13654,"113":0.01951,"114":0.39012,"115":8.23803,"116":9.28486,"117":0.0065,"118":0,"119":0},F:{"9":0,"11":0,"12":0.0065,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0.0065,"21":0,"22":0,"23":0,"24":0.0065,"25":0.0065,"26":0.0065,"27":0.0065,"28":0.0065,"29":0,"30":0.03901,"31":0.03901,"32":0.01951,"33":0.0065,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.013,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.03251,"100":0.42263,"101":0.27959,"102":0.0065,"9.5-9.6":0.0065,"10.0-10.1":0.0065,"10.5":0,"10.6":0,"11.1":0.0065,"11.5":0,"11.6":0.0065,"12.1":0.01951},B:{"12":0.07152,"13":0.0065,"14":0.09753,"15":0,"16":0.0065,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.013,"101":0,"102":0.0065,"103":0,"104":0,"105":0.01951,"106":0,"107":0.41613,"108":0,"109":0.04551,"110":0,"111":0,"112":0,"113":0,"114":0.67621,"115":4.31083,"116":1.84007},E:{"4":0.01951,"5":0.013,"6":0.0065,"7":0.013,"8":0.04551,"9":0.13654,"10":0,"11":0,"12":0,"13":0.013,"14":0.14304,"15":0,"17":0,_:"0","3.1":0,"3.2":0.013,"5.1":0.01951,"6.1":0,"7.1":0.0065,"9.1":0.0065,"10.1":0,"11.1":0,"12.1":0,"13.1":0.05202,"14.1":0.55267,"15.1":0.05202,"15.2-15.3":0.02601,"15.4":0.0065,"15.5":0.09753,"15.6":0.43563,"16.0":0.07802,"16.1":0.13654,"16.2":0.05852,"16.3":0.27308,"16.4":0.05202,"16.5":0.6567,"16.6":1.15085},G:{"8":0.04396,"17":0.11894,"3.2":0.01034,"4.0-4.1":0.01034,"4.2-4.3":0.05947,"5.0-5.1":0.03878,"6.0-6.1":0.07498,"7.0-7.1":0.28442,"8.1-8.4":0.5042,"9.0-9.2":0.04654,"9.3":0.09825,"10.0-10.2":0,"10.3":0.0724,"11.0-11.2":0.65158,"11.3-11.4":0.02844,"12.0-12.1":0.25856,"12.2-12.5":0.33096,"13.0-13.1":0,"13.2":0.01034,"13.3":0,"13.4-13.7":0.00776,"14.0-14.4":0.10342,"14.5-14.8":0.28183,"15.0-15.1":0.13445,"15.2-15.3":0.08791,"15.4":0.07757,"15.5":0.02068,"15.6-15.7":0.87911,"16.0":3.13118,"16.1":0.4861,"16.2":0.40853,"16.3":1.57723,"16.4":0.43955,"16.5":5.28759,"16.6":10.27783},P:{"4":0.11504,"20":0,"21":0.03137,"5.0-5.4":0,"6.2-6.4":0.07321,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0.01761,"4":0.40939,"2.1":0.09978,"2.2":0.23037,"2.3":0.32869,"4.1":0.34189,"4.2-4.3":0.67791,"4.4":0,"4.4.3-4.4.4":1.40425},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.05234,"7":0.11121,"8":1.00745,"9":0.16355,"10":0.17663,"11":0.55606,"5.5":0.00654},S:{"2.5":0.06646,_:"3.0-3.1"},J:{"7":0,"10":0.08395},N:{"10":0.23553,"11":0.11777},L:{"0":18.94934},R:{_:"0"},M:{"0":0.55968},Q:{"13.1":0},O:{"0":0.42676},H:{"0":0.21195}};
+module.exports={C:{"2":0.0207,"3":0.04831,"4":0.0138,"5":0.0207,"6":0.0069,"7":0,"8":0.0069,"9":0,"10":0.0069,"11":0.0138,"12":0.0138,"13":0.0069,"14":0.0069,"15":0.0069,"16":0.0069,"17":0.0207,"18":0.0069,"19":0.0138,"20":0.0069,"21":0.0069,"22":0.0069,"23":0.0138,"24":0.0069,"25":0.0069,"26":0.0069,"27":0.0069,"28":0.0069,"29":0.0069,"30":0.0069,"31":0.0138,"32":0.0069,"33":0.0069,"34":0.0069,"35":0.0276,"36":0.0138,"37":0.0138,"38":0.03451,"39":0.03451,"40":0.03451,"41":0.0276,"42":0,"43":0.0069,"44":0,"45":0,"46":0,"47":0,"48":0.0069,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.0069,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0069,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.0069,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0138,"103":0,"104":0,"105":0,"106":0.0069,"107":0,"108":0.0138,"109":0,"110":0,"111":0.25534,"112":0.0069,"113":0.0207,"114":0.03451,"115":0.08971,"116":0.21393,"117":4.51325,"118":0.99374,"119":0,"120":0,"3.5":0.0069,"3.6":0.08971},D:{"4":0.0138,"5":0.0069,"6":0.0069,"7":0.0069,"8":0,"9":0.0069,"10":0.0069,"11":0.0138,"12":0.0069,"13":0,"14":0,"15":0,"16":0,"17":0.0138,"18":0.0069,"19":0.0138,"20":0.0069,"21":0.0138,"22":0.0069,"23":0,"24":0,"25":0.0138,"26":0,"27":0.0138,"28":0.0207,"29":0.0069,"30":0.0138,"31":0.03451,"32":0.0069,"33":0.0207,"34":0.0138,"35":0.0138,"36":0.0276,"37":0.0276,"38":0.06211,"39":0.05521,"40":0.05521,"41":0.08971,"42":0.04831,"43":0.09661,"44":0.15182,"45":0.15872,"46":0.12422,"47":0.06901,"48":0,"49":0.20703,"50":0,"51":0.17943,"52":0,"53":0,"54":0,"55":0,"56":0.0069,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.04831,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.28294,"80":0.0069,"81":0,"83":0,"84":0.0276,"85":0.0069,"86":0,"87":0,"88":0,"89":0,"90":0.0069,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.0069,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.0138,"104":0,"105":0.33815,"106":0.0069,"107":0.35195,"108":0.11732,"109":1.22148,"110":0.15872,"111":0.0069,"112":0.11042,"113":0.0069,"114":0.04831,"115":0.12422,"116":13.41554,"117":4.30622,"118":0.03451,"119":0,"120":0},F:{"9":0,"11":0.0138,"12":0.0207,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0.0207,"21":0,"22":0,"23":0.0069,"24":0.0069,"25":0,"26":0.0069,"27":0.0069,"28":0.0069,"29":0,"30":0.03451,"31":0.04141,"32":0.0207,"33":0.0138,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0069,"69":0.0069,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.0207,"78":0.0069,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0069,"96":0,"97":0,"98":0,"99":0.0069,"100":0.05521,"101":0.33125,"102":0.697,"9.5-9.6":0.0069,"10.0-10.1":0.0138,"10.5":0,"10.6":0,"11.1":0.0069,"11.5":0.0069,"11.6":0.0069,"12.1":0.0276},B:{"12":0.06901,"13":0.0069,"14":0.08281,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0138,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.0138,"106":0,"107":0.31745,"108":0,"109":0.0069,"110":0,"111":0,"112":0,"113":0.0069,"114":0.0138,"115":0.6556,"116":2.91222,"117":2.82251},E:{"4":0.0276,"5":0.0207,"6":0,"7":0.0069,"8":0.0276,"9":0.25534,"10":0,"11":0,"12":0,"13":0.0069,"14":0.11042,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.03451,"6.1":0.0069,"7.1":0.0069,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.12422,"14.1":1.33189,"15.1":0.06211,"15.2-15.3":0.03451,"15.4":0,"15.5":0.04831,"15.6":0.35885,"16.0":0.24844,"16.1":0.17943,"16.2":0.07591,"16.3":0.16562,"16.4":0.04831,"16.5":0.31055,"16.6":1.54582,"17.0":0.06211,"17.1":0},G:{"8":0.02369,"3.2":0.01723,"4.0-4.1":0,"4.2-4.3":0.02369,"5.0-5.1":0.07537,"6.0-6.1":0.04738,"7.0-7.1":0.29072,"8.1-8.4":0.46731,"9.0-9.2":0.01507,"9.3":0.10552,"10.0-10.2":0.01723,"10.3":0.13136,"11.0-11.2":1.05521,"11.3-11.4":0.00646,"12.0-12.1":0.34456,"12.2-12.5":0.27995,"13.0-13.1":0,"13.2":0.01938,"13.3":0.00861,"13.4-13.7":0.00431,"14.0-14.4":0.09691,"14.5-14.8":0.10552,"15.0-15.1":0.04307,"15.2-15.3":0.07537,"15.4":0.28641,"15.5":0.05168,"15.6-15.7":0.94107,"16.0":1.24902,"16.1":0.53622,"16.2":0.34456,"16.3":0.81402,"16.4":0.15505,"16.5":0.20027,"16.6":12.08751,"17.0":1.44499,"17.1":0.00431},P:{"4":0.14549,"20":0,"21":0,"22":3.13834,"5.0-5.4":0,"6.2-6.4":0.15588,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.03118},I:{"0":0,"3":0.04036,"4":0.44968,"2.1":0.08936,"2.2":0.18304,"2.3":0.25943,"4.1":0.3214,"4.2-4.3":0.61398,"4.4":0,"4.4.3-4.4.4":1.43839},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.06255,"7":0.10425,"8":0.95909,"9":0.21545,"10":0.1529,"11":0.38225,"5.5":0.00695},S:{"2.5":0.06508,_:"3.0-3.1"},J:{"7":0,"10":0.09297},N:{"10":0.19562,"11":0.11737},L:{"0":19.79318},R:{_:"0"},M:{"0":0.24172},Q:{"13.1":0.0062},O:{"0":0.27581},H:{"0":0.44009}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LK.js
index 7d3f87c7f2cd93..4e342a3d021c73 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LK.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00429,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00857,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01286,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00429,"109":0.00429,"110":0.00429,"111":0.00429,"112":0.00429,"113":0.00857,"114":0.01286,"115":0.23579,"116":0.37726,"117":0.02144,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00429,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00429,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00429,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00429,"65":0,"66":0,"67":0.00429,"68":0,"69":0,"70":0.00857,"71":0.00429,"72":0,"73":0,"74":0.00429,"75":0,"76":0.00429,"77":0,"78":0.00429,"79":0.00429,"80":0.00429,"81":0.01715,"83":0.00429,"84":0,"85":0.00857,"86":0.00429,"87":0.01286,"88":0.00429,"89":0.00429,"90":0.00857,"91":0.00857,"92":0.00857,"93":0.00429,"94":0.00429,"95":0.00857,"96":0.00429,"97":0.00429,"98":0.00429,"99":0.01286,"100":0.00429,"101":0.00429,"102":0.00429,"103":0.02144,"104":0.00429,"105":0.00429,"106":0.02572,"107":0.00857,"108":0.02144,"109":0.956,"110":0.00857,"111":0.02144,"112":0.02572,"113":0.0343,"114":0.25722,"115":5.25586,"116":2.95803,"117":0.00429,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.03858,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00429,"60":0.00857,"62":0,"63":0.00429,"64":0.00857,"65":0.00429,"66":0.00429,"67":0.00857,"68":0.00429,"69":0.03001,"70":0.0343,"71":0.07717,"72":0.04287,"73":0,"74":0.00857,"75":0,"76":0.00429,"77":0,"78":0,"79":0.00429,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00429,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03858,"96":0,"97":0,"98":0,"99":0.00857,"100":0.11575,"101":0.21864,"102":0.00429,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00857,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01286,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00429,"108":0,"109":0.01286,"110":0.00429,"111":0.00429,"112":0.00429,"113":0.00857,"114":0.09003,"115":5.01579,"116":1.36755},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00429,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00429,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00429,"14.1":0.01286,"15.1":0.02572,"15.2-15.3":0,"15.4":0.00429,"15.5":0.00429,"15.6":0.02144,"16.0":0.00857,"16.1":0.01286,"16.2":0.00857,"16.3":0.01715,"16.4":0.01715,"16.5":0.05144,"16.6":0.04716},G:{"8":0,"17":0.07179,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00479,"5.0-5.1":0,"6.0-6.1":0.00096,"7.0-7.1":0.01053,"8.1-8.4":0.00191,"9.0-9.2":0.00383,"9.3":0.02872,"10.0-10.2":0.00287,"10.3":0.02967,"11.0-11.2":0.00766,"11.3-11.4":0.00957,"12.0-12.1":0.02202,"12.2-12.5":0.43266,"13.0-13.1":0.01914,"13.2":0.00957,"13.3":0.02872,"13.4-13.7":0.06222,"14.0-14.4":0.21729,"14.5-14.8":0.23547,"15.0-15.1":0.13688,"15.2-15.3":0.12731,"15.4":0.11104,"15.5":0.17708,"15.6-15.7":2.06947,"16.0":0.42308,"16.1":0.4786,"16.2":0.28046,"16.3":0.58581,"16.4":0.29099,"16.5":1.5545,"16.6":2.13361},P:{"4":0.40597,"20":0.20298,"21":0.37552,"5.0-5.4":0.01015,"6.2-6.4":0.0203,"7.2-7.4":0.66985,"8.2":0.01015,"9.2":0.0406,"10.1":0.01015,"11.1-11.2":0.11164,"12.0":0.01015,"13.0":0.07104,"14.0":0.0609,"15.0":0.05075,"16.0":0.12179,"17.0":0.10149,"18.0":0.09134,"19.0":0.19283},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.00215,"4.1":0.00108,"4.2-4.3":0.00969,"4.4":0,"4.4.3-4.4.4":0.06566},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00429,"9":0,"10":0,"11":0.02144,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":63.37995},R:{_:"0"},M:{"0":0.1314},Q:{"13.1":0},O:{"0":1.35969},H:{"0":1.28727}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00419,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00839,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01258,"103":0,"104":0,"105":0.00419,"106":0,"107":0,"108":0,"109":0,"110":0.00419,"111":0,"112":0.00419,"113":0.00839,"114":0.00419,"115":0.13001,"116":0.03355,"117":0.40682,"118":0.04613,"119":0.00419,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00419,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00419,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00419,"65":0,"66":0,"67":0.00419,"68":0,"69":0,"70":0.00419,"71":0,"72":0,"73":0,"74":0.00419,"75":0,"76":0,"77":0,"78":0.00419,"79":0.00419,"80":0.00419,"81":0.01678,"83":0.00419,"84":0,"85":0.00839,"86":0.00419,"87":0.00839,"88":0.00419,"89":0.00419,"90":0.00419,"91":0.00419,"92":0.00839,"93":0.00419,"94":0.00419,"95":0.00419,"96":0.00419,"97":0.00419,"98":0.00419,"99":0.01258,"100":0.00419,"101":0.00419,"102":0.00839,"103":0.02097,"104":0.00839,"105":0.00839,"106":0.02097,"107":0.00839,"108":0.02936,"109":0.91849,"110":0.00839,"111":0.01678,"112":0.01678,"113":0.02097,"114":0.07549,"115":0.10066,"116":6.39166,"117":1.34627,"118":0.00419,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.04613,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00419,"55":0,"56":0,"57":0,"58":0.00419,"60":0.00419,"62":0,"63":0.00419,"64":0.00419,"65":0,"66":0.00419,"67":0.00419,"68":0.00419,"69":0.02936,"70":0.02097,"71":0.02516,"72":0.09227,"73":0.02936,"74":0.00419,"75":0,"76":0,"77":0.02516,"78":0,"79":0.00419,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00419,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03775,"96":0,"97":0,"98":0,"99":0,"100":0.01678,"101":0.15098,"102":0.13421,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00839,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01258,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00419,"107":0.00419,"108":0,"109":0.01258,"110":0,"111":0.00419,"112":0.00419,"113":0.00419,"114":0.02097,"115":0.05872,"116":3.65297,"117":2.54995},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00419,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00419,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00419,"13.1":0.00419,"14.1":0.00839,"15.1":0.00419,"15.2-15.3":0,"15.4":0.00419,"15.5":0.00419,"15.6":0.02097,"16.0":0.00839,"16.1":0.00839,"16.2":0.00419,"16.3":0.01258,"16.4":0.01678,"16.5":0.02097,"16.6":0.0713,"17.0":0.00419,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.0009,"7.0-7.1":0.01343,"8.1-8.4":0.00358,"9.0-9.2":0.00358,"9.3":0.02775,"10.0-10.2":0.0009,"10.3":0.02775,"11.0-11.2":0.00716,"11.3-11.4":0.00537,"12.0-12.1":0.01522,"12.2-12.5":0.42155,"13.0-13.1":0.01343,"13.2":0.01164,"13.3":0.02596,"13.4-13.7":0.04923,"14.0-14.4":0.1969,"14.5-14.8":0.21928,"15.0-15.1":0.12441,"15.2-15.3":0.1074,"15.4":0.11009,"15.5":0.16826,"15.6-15.7":1.95737,"16.0":0.33563,"16.1":0.39022,"16.2":0.20585,"16.3":0.44392,"16.4":0.22107,"16.5":0.54237,"16.6":2.80225,"17.0":0.43587,"17.1":0},P:{"4":0.3655,"20":0.18275,"21":0.28428,"22":1.23863,"5.0-5.4":0.02031,"6.2-6.4":0.03046,"7.2-7.4":0.78176,"8.2":0.02031,"9.2":0.04061,"10.1":0.01015,"11.1-11.2":0.10153,"12.0":0.02031,"13.0":0.08122,"14.0":0.06092,"15.0":0.04061,"16.0":0.11168,"17.0":0.09137,"18.0":0.11168,"19.0":0.20305},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0.00271,"4.1":0.00677,"4.2-4.3":0.00406,"4.4":0,"4.4.3-4.4.4":0.06904},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00419,"9":0,"10":0,"11":0.02936,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.66368},R:{_:"0"},M:{"0":0.15096},Q:{"13.1":0},O:{"0":1.29474},H:{"0":1.34121}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LR.js
index 863ad758c3d4dd..9a084b4dfa0da0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00211,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00211,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00211,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00211,"100":0,"101":0,"102":0.00211,"103":0,"104":0.00211,"105":0,"106":0,"107":0,"108":0.01053,"109":0,"110":0,"111":0,"112":0,"113":0.00211,"114":0.00421,"115":0.18743,"116":0.09266,"117":0.00632,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00211,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00211,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00211,"50":0,"51":0,"52":0.00211,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00211,"62":0,"63":0,"64":0.00421,"65":0,"66":0.01264,"67":0.00211,"68":0,"69":0,"70":0,"71":0.00211,"72":0.00211,"73":0,"74":0.00211,"75":0.01474,"76":0.00632,"77":0.00211,"78":0,"79":0.00211,"80":0.00632,"81":0.00421,"83":0.00211,"84":0,"85":0,"86":0.00632,"87":0.01053,"88":0.00211,"89":0.00421,"90":0.01685,"91":0.00211,"92":0.01264,"93":0.00842,"94":0.01264,"95":0.00211,"96":0,"97":0,"98":0,"99":0.00632,"100":0.00632,"101":0.00211,"102":0.00421,"103":0.02317,"104":0.00421,"105":0.00421,"106":0.00211,"107":0.00632,"108":0.00421,"109":0.09477,"110":0.00211,"111":0.00632,"112":0.00842,"113":0.01053,"114":0.14742,"115":0.72868,"116":0.36223,"117":0.00211,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00632,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00211,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00211,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00211,"60":0.02738,"62":0,"63":0.01685,"64":0.01053,"65":0.02317,"66":0.03159,"67":0.01685,"68":0.00632,"69":0.09477,"70":0.06529,"71":0.25272,"72":0.13689,"73":0,"74":0,"75":0,"76":0.00421,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00211,"91":0,"92":0,"93":0,"94":0.00211,"95":0.00842,"96":0,"97":0,"98":0,"99":0.00211,"100":0.01264,"101":0.04633,"102":0.00211,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00842},B:{"12":0.00842,"13":0.01474,"14":0,"15":0.00211,"16":0,"17":0.00211,"18":0.01474,"79":0,"80":0,"81":0,"83":0,"84":0.00211,"85":0.00211,"86":0,"87":0,"88":0,"89":0.00421,"90":0.00421,"91":0,"92":0.01685,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00211,"101":0,"102":0,"103":0.00211,"104":0,"105":0.00211,"106":0.00211,"107":0,"108":0,"109":0.00842,"110":0.00211,"111":0.00211,"112":0.00211,"113":0.00632,"114":0.04423,"115":0.23377,"116":0.0695},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00211,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00211,"12.1":0,"13.1":0.00421,"14.1":0.00632,"15.1":0,"15.2-15.3":0.00211,"15.4":0,"15.5":0,"15.6":0.00421,"16.0":0,"16.1":0.00421,"16.2":0,"16.3":0.00211,"16.4":0.00211,"16.5":0.01053,"16.6":0.01053},G:{"8":0,"17":0.07896,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.06716,"8.1-8.4":0,"9.0-9.2":0.00998,"9.3":0.04629,"10.0-10.2":0,"10.3":0.0245,"11.0-11.2":0,"11.3-11.4":0.01815,"12.0-12.1":0.02904,"12.2-12.5":0.56996,"13.0-13.1":0.05536,"13.2":0.00817,"13.3":0.06898,"13.4-13.7":0.21963,"14.0-14.4":0.55725,"14.5-14.8":1.15262,"15.0-15.1":1.0791,"15.2-15.3":0.17516,"15.4":0.20511,"15.5":0.25231,"15.6-15.7":1.09181,"16.0":0.24686,"16.1":0.24958,"16.2":0.22326,"16.3":0.3231,"16.4":0.35395,"16.5":1.17168,"16.6":0.79685},P:{"4":0.04118,"20":0.07206,"21":0.21617,"5.0-5.4":0.01029,"6.2-6.4":0,"7.2-7.4":0.22646,"8.2":0,"9.2":0.02059,"10.1":0,"11.1-11.2":0.04118,"12.0":0,"13.0":0.01029,"14.0":0.01029,"15.0":0,"16.0":0.08235,"17.0":0.01029,"18.0":0.01029,"19.0":0.05147},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.06159},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01474,"5.5":0},S:{"2.5":0.11052,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":70.96245},R:{_:"0"},M:{"0":0.06315},Q:{"13.1":0},O:{"0":0.83676},H:{"0":11.19535}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.0021,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.0021,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0042,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.01469,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.09446,"116":0.01469,"117":0.11964,"118":0.0105,"119":0.0021,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.0021,"41":0,"42":0,"43":0.0042,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.0021,"57":0,"58":0,"59":0.0021,"60":0,"61":0,"62":0,"63":0,"64":0.0042,"65":0.0063,"66":0.0021,"67":0.0042,"68":0.0021,"69":0,"70":0.0021,"71":0,"72":0.0042,"73":0,"74":0.0021,"75":0.0084,"76":0.0042,"77":0.0042,"78":0,"79":0.0021,"80":0.0084,"81":0.0021,"83":0.0021,"84":0.0063,"85":0.0021,"86":0,"87":0.0021,"88":0.0042,"89":0.04198,"90":0.0042,"91":0,"92":0.0063,"93":0.0105,"94":0.0084,"95":0.0021,"96":0,"97":0,"98":0.0021,"99":0.02729,"100":0,"101":0,"102":0.0042,"103":0.02309,"104":0,"105":0.0063,"106":0.0021,"107":0.0021,"108":0.0063,"109":0.10705,"110":0.0021,"111":0.0042,"112":0.0042,"113":0.0063,"114":0.02939,"115":0.03358,"116":0.77243,"117":0.16582,"118":0.0021,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.0063,"30":0,"31":0.0021,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.0021,"51":0,"52":0,"53":0,"54":0,"55":0.0063,"56":0,"57":0,"58":0.0021,"60":0.02309,"62":0,"63":0.0105,"64":0.0084,"65":0.0105,"66":0.02099,"67":0.01679,"68":0.0105,"69":0.05248,"70":0.02309,"71":0.16582,"72":0.16792,"73":0.03149,"74":0,"75":0,"76":0,"77":0.0021,"78":0,"79":0.0021,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0042,"96":0,"97":0,"98":0.0021,"99":0.0021,"100":0.0021,"101":0.02729,"102":0.04198,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01469},B:{"12":0.0042,"13":0.0042,"14":0.0021,"15":0.0021,"16":0,"17":0.0021,"18":0.02939,"79":0,"80":0,"81":0,"83":0,"84":0.0021,"85":0.0021,"86":0,"87":0,"88":0,"89":0.0021,"90":0.0042,"91":0,"92":0.0063,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0021,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0063,"110":0,"111":0.0021,"112":0.0042,"113":0.0021,"114":0.01679,"115":0.03149,"116":0.22879,"117":0.13224},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.0021,"13":0.0021,"14":0.0063,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.0042,"12.1":0,"13.1":0.0042,"14.1":0.0042,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.0063,"16.0":0,"16.1":0,"16.2":0,"16.3":0.0021,"16.4":0.0084,"16.5":0.0021,"16.6":0.01469,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00087,"6.0-6.1":0,"7.0-7.1":0.0358,"8.1-8.4":0,"9.0-9.2":0.00698,"9.3":0.07421,"10.0-10.2":0,"10.3":0.04715,"11.0-11.2":0.00349,"11.3-11.4":0.13445,"12.0-12.1":0.01746,"12.2-12.5":0.72202,"13.0-13.1":0.13358,"13.2":0.02706,"13.3":0.0227,"13.4-13.7":0.31517,"14.0-14.4":0.56749,"14.5-14.8":0.77615,"15.0-15.1":0.58146,"15.2-15.3":0.17112,"15.4":0.1554,"15.5":0.24795,"15.6-15.7":0.91497,"16.0":0.16763,"16.1":0.21215,"16.2":0.27501,"16.3":0.27676,"16.4":0.24009,"16.5":0.87655,"16.6":1.43618,"17.0":0.24708,"17.1":0},P:{"4":0.03146,"20":0.05243,"21":0.13633,"22":0.51385,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.06292,"8.2":0,"9.2":0.01049,"10.1":0,"11.1-11.2":0.05243,"12.0":0,"13.0":0.01049,"14.0":0.05243,"15.0":0.01049,"16.0":0.08389,"17.0":0.01049,"18.0":0.01049,"19.0":0.11535},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00641,"4.4":0,"4.4.3-4.4.4":0.05927},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02729,"5.5":0},S:{"2.5":0.11061,_:"3.0-3.1"},J:{"7":0,"10":0.0079},N:{"10":0,"11":0},L:{"0":75.02708},R:{_:"0"},M:{"0":0.09481},Q:{"13.1":0.0079},O:{"0":0.83751},H:{"0":8.61714}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LS.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LS.js
index db0e6367988f9e..fcbf98a16c1f8c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LS.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LS.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00337,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00337,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.09439,"116":0.17529,"117":0.00337,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00337,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00337,"44":0,"45":0,"46":0.00337,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00337,"56":0,"57":0,"58":0.00337,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00337,"66":0.00337,"67":0,"68":0.00337,"69":0,"70":0.00674,"71":0,"72":0,"73":0,"74":0,"75":0.00674,"76":0.00337,"77":0.01686,"78":0.00337,"79":0,"80":0,"81":0.04045,"83":0,"84":0.00674,"85":0.00337,"86":0,"87":0,"88":0.00337,"89":0,"90":0.01011,"91":0,"92":0.00337,"93":0,"94":0,"95":0.00674,"96":0,"97":0,"98":0,"99":0.02697,"100":0,"101":0,"102":0.00674,"103":0.05394,"104":0.00337,"105":0.00337,"106":0.00674,"107":0.00337,"108":0.00674,"109":0.60004,"110":0.01686,"111":0.01348,"112":0.03708,"113":0.0236,"114":0.16181,"115":2.34285,"116":1.44953,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00337,"25":0,"26":0.03034,"27":0,"28":0.00337,"29":0,"30":0.00337,"31":0,"32":0.00674,"33":0.00337,"34":0,"35":0.06068,"36":0,"37":0,"38":0.00674,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.02023,"47":0.00337,"48":0,"49":0,"50":0.01348,"51":0.00337,"52":0,"53":0,"54":0.00674,"55":0.00337,"56":0.03034,"57":0.00674,"58":0.00674,"60":0.02023,"62":0,"63":0.03371,"64":0.09776,"65":0.00674,"66":0.01686,"67":0.02697,"68":0.02023,"69":0.19889,"70":0.12136,"71":0.3607,"72":0.12136,"73":0,"74":0.00337,"75":0.00337,"76":0.03708,"77":0,"78":0,"79":0.00337,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03708,"96":0,"97":0,"98":0,"99":0.00674,"100":0.09439,"101":0.28316,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00674},B:{"12":0.00674,"13":0.01011,"14":0,"15":0,"16":0,"17":0.00337,"18":0.01011,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00337,"90":0,"91":0,"92":0.02697,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00337,"99":0,"100":0,"101":0,"102":0,"103":0.00337,"104":0,"105":0.00337,"106":0,"107":0.00674,"108":0.00337,"109":0.01686,"110":0.00674,"111":0.00674,"112":0.00674,"113":0.02023,"114":0.04382,"115":0.86972,"116":0.19552},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0.00337,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00337,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00337,"14.1":0.00337,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00337,"16.0":0,"16.1":0,"16.2":0,"16.3":0.00337,"16.4":0.01011,"16.5":0.01011,"16.6":0.04719},G:{"8":0,"17":0.006,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00057,"5.0-5.1":0.00543,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00114,"9.0-9.2":0,"9.3":0.09225,"10.0-10.2":0.00057,"10.3":0.00743,"11.0-11.2":0.00228,"11.3-11.4":0.00171,"12.0-12.1":0.00171,"12.2-12.5":0.11367,"13.0-13.1":0.00057,"13.2":0.00114,"13.3":0,"13.4-13.7":0.01,"14.0-14.4":0.09939,"14.5-14.8":0.05169,"15.0-15.1":0.12738,"15.2-15.3":0.01399,"15.4":0.02371,"15.5":0.03313,"15.6-15.7":0.65889,"16.0":0.05398,"16.1":0.12052,"16.2":0.07454,"16.3":0.0991,"16.4":0.03113,"16.5":0.41641,"16.6":0.8094},P:{"4":0.30321,"20":0.31332,"21":0.51546,"5.0-5.4":0,"6.2-6.4":0.47503,"7.2-7.4":0.96016,"8.2":0,"9.2":0.03032,"10.1":0.03032,"11.1-11.2":0.04043,"12.0":0.01011,"13.0":0.03032,"14.0":0.02021,"15.0":0.03032,"16.0":0.18193,"17.0":0.07075,"18.0":0.06064,"19.0":0.58621},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00111,"4.2-4.3":0.00223,"4.4":0,"4.4.3-4.4.4":0.07014},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01011,"5.5":0},S:{"2.5":0.05303,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":73.47791},R:{_:"0"},M:{"0":0.0464},Q:{"13.1":0},O:{"0":1.67714},H:{"0":5.63577}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00318,"100":0,"101":0,"102":0.00318,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00318,"113":0.00318,"114":0,"115":0.03175,"116":0.0127,"117":0.15558,"118":0.00953,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00635,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00318,"47":0,"48":0,"49":0.00318,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.03175,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00318,"62":0,"63":0,"64":0,"65":0,"66":0.00318,"67":0,"68":0,"69":0,"70":0.00318,"71":0.00318,"72":0.00318,"73":0,"74":0.00318,"75":0.0127,"76":0,"77":0.00953,"78":0,"79":0.00635,"80":0,"81":0.01905,"83":0.00318,"84":0.00318,"85":0,"86":0,"87":0,"88":0,"89":0.00318,"90":0,"91":0.00953,"92":0.00318,"93":0,"94":0.0127,"95":0.00318,"96":0,"97":0,"98":0.00318,"99":0.02858,"100":0,"101":0,"102":0.00318,"103":0.03175,"104":0.00635,"105":0.00318,"106":0.00318,"107":0,"108":0.00318,"109":0.4445,"110":0.00318,"111":0.00953,"112":0.0381,"113":0.0127,"114":0.04763,"115":0.09843,"116":2.92735,"117":0.60008,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.02858,"27":0,"28":0.00953,"29":0,"30":0.00318,"31":0.00318,"32":0.00635,"33":0,"34":0,"35":0.04763,"36":0,"37":0,"38":0.00635,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0508,"47":0.00318,"48":0,"49":0,"50":0.02223,"51":0.00318,"52":0,"53":0,"54":0,"55":0.00318,"56":0.06985,"57":0.00318,"58":0.00635,"60":0.01588,"62":0,"63":0.02223,"64":0.05715,"65":0.0127,"66":0.01588,"67":0.02858,"68":0.01905,"69":0.17145,"70":0.08255,"71":0.15558,"72":0.3175,"73":0.0381,"74":0.00635,"75":0,"76":0.07303,"77":0.00635,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04128,"96":0,"97":0,"98":0,"99":0.00318,"100":0.00635,"101":0.16828,"102":0.17145,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00635},B:{"12":0.0127,"13":0.00318,"14":0,"15":0.00635,"16":0.00318,"17":0.00318,"18":0.00635,"79":0,"80":0,"81":0,"83":0,"84":0.00318,"85":0,"86":0,"87":0,"88":0,"89":0.00953,"90":0.00635,"91":0,"92":0.0127,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00318,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00318,"109":0.03175,"110":0.00318,"111":0.00318,"112":0.00318,"113":0.00953,"114":0.01588,"115":0.02223,"116":0.4445,"117":0.33655},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00318,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00953,"14.1":0,"15.1":0,"15.2-15.3":0.00318,"15.4":0,"15.5":0,"15.6":0.00318,"16.0":0,"16.1":0,"16.2":0,"16.3":0.00635,"16.4":0.00953,"16.5":0.00635,"16.6":0.0889,"17.0":0.00318,"17.1":0},G:{"8":0.00533,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00376,"6.0-6.1":0,"7.0-7.1":0.0069,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07428,"10.0-10.2":0,"10.3":0.01692,"11.0-11.2":0.00282,"11.3-11.4":0.00094,"12.0-12.1":0,"12.2-12.5":0.14793,"13.0-13.1":0.00063,"13.2":0.00094,"13.3":0.00533,"13.4-13.7":0.01442,"14.0-14.4":0.07835,"14.5-14.8":0.05203,"15.0-15.1":0.17207,"15.2-15.3":0.11941,"15.4":0.03385,"15.5":0.04231,"15.6-15.7":0.73277,"16.0":0.04513,"16.1":0.17426,"16.2":0.04357,"16.3":0.06989,"16.4":0.01786,"16.5":0.12411,"16.6":1.04431,"17.0":0.09747,"17.1":0},P:{"4":0.36173,"20":0.06029,"21":0.39187,"22":1.10527,"5.0-5.4":0,"6.2-6.4":0.19091,"7.2-7.4":0.78374,"8.2":0,"9.2":0.01005,"10.1":0.01005,"11.1-11.2":0.09043,"12.0":0,"13.0":0.0201,"14.0":0.0201,"15.0":0.01005,"16.0":0.19091,"17.0":0.04019,"18.0":0.06029,"19.0":0.27129},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00135,"4.2-4.3":0.00135,"4.4":0,"4.4.3-4.4.4":0.07001},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01588,"5.5":0},S:{"2.5":0.0819,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":75.20503},R:{_:"0"},M:{"0":0.04095},Q:{"13.1":0.34808},O:{"0":0.96233},H:{"0":6.16424}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LT.js
index 82d8dd6616a6ff..3590007165e0f0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0283,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00708,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.01415,"78":0.00708,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00708,"91":0,"92":0,"93":0,"94":0,"95":0.00708,"96":0.00708,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.07076,"103":0.00708,"104":0.00708,"105":0.00708,"106":0,"107":0.00708,"108":0,"109":0.00708,"110":0.00708,"111":0.01415,"112":0,"113":0.02123,"114":0.0283,"115":0.62269,"116":1.32321,"117":0.07784,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00708,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00708,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00708,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00708,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00708,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.04246,"77":0.00708,"78":0,"79":0.03538,"80":0.00708,"81":0.00708,"83":0.00708,"84":0,"85":0.04246,"86":0.00708,"87":0.03538,"88":0.00708,"89":0,"90":0.00708,"91":0.00708,"92":0.00708,"93":0,"94":0.02123,"95":0,"96":0.00708,"97":0.00708,"98":0.00708,"99":0.02123,"100":0.01415,"101":0.00708,"102":0.03538,"103":0.04953,"104":0.02123,"105":0.0283,"106":0.05661,"107":0.0283,"108":0.06368,"109":2.29262,"110":0.04246,"111":0.05661,"112":0.1486,"113":0.2052,"114":2.15818,"115":20.3152,"116":11.49142,"117":0.00708,"118":0.00708,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00708,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0.01415,"67":0,"68":0,"69":0.00708,"70":0,"71":0.00708,"72":0.00708,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.09906,"96":0,"97":0,"98":0,"99":0.04953,"100":1.05432,"101":0.72883,"102":0.00708,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0.0283,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00708,"91":0,"92":0.01415,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00708,"107":0.00708,"108":0.00708,"109":0.05661,"110":0.02123,"111":0.01415,"112":0.07076,"113":0.04246,"114":0.25474,"115":4.34466,"116":1.48596},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00708,"14":0.0283,"15":0,"17":0.01415,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00708,"13.1":0.04246,"14.1":0.04246,"15.1":0.01415,"15.2-15.3":0.00708,"15.4":0.00708,"15.5":0.01415,"15.6":0.09199,"16.0":0.01415,"16.1":0.0283,"16.2":0.03538,"16.3":0.08491,"16.4":0.03538,"16.5":0.24058,"16.6":0.24058},G:{"8":0,"17":0.1842,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00136,"6.0-6.1":0,"7.0-7.1":0.00546,"8.1-8.4":0.00955,"9.0-9.2":0.00136,"9.3":0.0191,"10.0-10.2":0.00273,"10.3":0.07641,"11.0-11.2":0.0191,"11.3-11.4":0.00409,"12.0-12.1":0.00955,"12.2-12.5":0.10506,"13.0-13.1":0.00546,"13.2":0,"13.3":0.00955,"13.4-13.7":0.0232,"14.0-14.4":0.06004,"14.5-14.8":0.10779,"15.0-15.1":0.04503,"15.2-15.3":0.06004,"15.4":0.07641,"15.5":0.13508,"15.6-15.7":0.78592,"16.0":0.64675,"16.1":1.10657,"16.2":0.54169,"16.3":1.0629,"16.4":0.31246,"16.5":2.75072,"16.6":5.46597},P:{"4":0.03113,"20":0.07263,"21":0.2179,"5.0-5.4":0.01038,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01038,"12.0":0,"13.0":0,"14.0":0.02075,"15.0":0,"16.0":0.01038,"17.0":0.03113,"18.0":0.03113,"19.0":0.04151},I:{"0":0,"3":0,"4":0.00862,"2.1":0,"2.2":0.00575,"2.3":0.00575,"4.1":0.00862,"4.2-4.3":0.06037,"4.4":0,"4.4.3-4.4.4":0.07474},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0288,"9":0.0072,"10":0.0072,"11":0.36721,"5.5":0},S:{"2.5":0.00292,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":31.43607},R:{_:"0"},M:{"0":0.15497},Q:{"13.1":0},O:{"0":0.04678},H:{"0":0.31558}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01458,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.02916,"53":0,"54":0,"55":0.01458,"56":0,"57":0,"58":0,"59":0,"60":0.00729,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.02916,"78":0.00729,"79":0,"80":0.00729,"81":0.00729,"82":0,"83":0.00729,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00729,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00729,"101":0,"102":0.04374,"103":0,"104":0.01458,"105":0.01458,"106":0.01458,"107":0.00729,"108":0.01458,"109":0.00729,"110":0.00729,"111":0.01458,"112":0.00729,"113":0.00729,"114":0.00729,"115":0.37908,"116":0.18954,"117":1.61838,"118":0.12393,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00729,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00729,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00729,"64":0.00729,"65":0,"66":0.00729,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00729,"74":0.03645,"75":0,"76":0.02916,"77":0,"78":0.02916,"79":0.05832,"80":0.03645,"81":0.01458,"83":0.00729,"84":0.00729,"85":0.05103,"86":0.02916,"87":0.05103,"88":0.01458,"89":0.00729,"90":0.03645,"91":0.03645,"92":0.01458,"93":0.02916,"94":0.02187,"95":0.01458,"96":0.00729,"97":0.02916,"98":0.05832,"99":0.02187,"100":0.00729,"101":0.00729,"102":0.02916,"103":0.05832,"104":0.01458,"105":0.00729,"106":0.05103,"107":0.03645,"108":0.0729,"109":2.21616,"110":0.05832,"111":0.05832,"112":0.06561,"113":0.05832,"114":0.63423,"115":1.2393,"116":28.68615,"117":6.0507,"118":0.00729,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00729,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00729,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00729,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.03645,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00729,"86":0.00729,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.08019,"96":0,"97":0,"98":0,"99":0.02916,"100":0.22599,"101":0.68526,"102":0.75087,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0.00729,"83":0,"84":0,"85":0.00729,"86":0,"87":0,"88":0.00729,"89":0,"90":0.00729,"91":0,"92":0.05103,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02187,"103":0,"104":0,"105":0,"106":0.00729,"107":0.00729,"108":0.02187,"109":0.06561,"110":0.02187,"111":0.01458,"112":0.01458,"113":0.03645,"114":0.06561,"115":0.21141,"116":3.73977,"117":2.32551},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00729,"10":0,"11":0,"12":0,"13":0,"14":0.03645,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01458,"10.1":0,"11.1":0,"12.1":0.00729,"13.1":0.03645,"14.1":0.05103,"15.1":0.01458,"15.2-15.3":0.00729,"15.4":0.01458,"15.5":0.02187,"15.6":0.10206,"16.0":0.00729,"16.1":0.03645,"16.2":0.02916,"16.3":0.05103,"16.4":0.04374,"16.5":0.10206,"16.6":0.37908,"17.0":0.02916,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00416,"6.0-6.1":0.00277,"7.0-7.1":0.00277,"8.1-8.4":0.00555,"9.0-9.2":0.00277,"9.3":0.01525,"10.0-10.2":0.02219,"10.3":0.08459,"11.0-11.2":0.01941,"11.3-11.4":0.00555,"12.0-12.1":0.00693,"12.2-12.5":0.0624,"13.0-13.1":0.00832,"13.2":0.00277,"13.3":1.14957,"13.4-13.7":0.05131,"14.0-14.4":0.06933,"14.5-14.8":0.09429,"15.0-15.1":0.03744,"15.2-15.3":0.03883,"15.4":0.05824,"15.5":0.11787,"15.6-15.7":0.68641,"16.0":0.48257,"16.1":0.87084,"16.2":0.41046,"16.3":0.74188,"16.4":0.17472,"16.5":0.52278,"16.6":6.94593,"17.0":1.03308,"17.1":0.00277},P:{"4":0.05128,"20":0.09231,"21":0.14359,"22":1.90774,"5.0-5.4":0.01026,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.01026,"15.0":0,"16.0":0.01026,"17.0":0.02051,"18.0":0.01026,"19.0":0.03077},I:{"0":0,"3":0,"4":0.01019,"2.1":0,"2.2":0.00612,"2.3":0.01019,"4.1":0.00815,"4.2-4.3":0.05096,"4.4":0,"4.4.3-4.4.4":0.05504},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.02251,"9":0.0075,"10":0.0075,"11":0.21763,"5.5":0},S:{"2.5":0.00271,_:"3.0-3.1"},J:{"7":0,"10":0.00271},N:{"10":0,"11":0},L:{"0":28.32649},R:{_:"0"},M:{"0":0.14905},Q:{"13.1":0},O:{"0":0.04607},H:{"0":0.2617}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LU.js
index 535ab9842e7909..e8b2af0051ba55 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0.00378,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00378,"30":0,"31":0,"32":0.00755,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01511,"39":0,"40":0.00378,"41":0,"42":0,"43":0,"44":0,"45":0.00755,"46":0,"47":0,"48":0.00378,"49":0,"50":0.00378,"51":0,"52":0.03022,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00378,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00755,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.09443,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00378,"88":0,"89":0.00378,"90":0,"91":0.05666,"92":0,"93":0.00378,"94":0.00378,"95":0,"96":0,"97":0.00378,"98":0,"99":0,"100":0.00378,"101":0,"102":1.32195,"103":0.00755,"104":0.00378,"105":0.00378,"106":0.00755,"107":0.02266,"108":0.00755,"109":0.00378,"110":0.01133,"111":0.01133,"112":0.01133,"113":0.01133,"114":0.05288,"115":0.36259,"116":1.21997,"117":0.0491,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00378},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00378,"40":0,"41":0.00378,"42":0.00378,"43":0.00378,"44":0.00755,"45":0.03399,"46":0.00755,"47":0.00378,"48":0,"49":0.01133,"50":0,"51":0.00755,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00378,"58":0.00378,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00378,"70":0.00378,"71":0,"72":0.08309,"73":0.00378,"74":0.00378,"75":0.00378,"76":0,"77":0.00378,"78":0.00378,"79":0.01511,"80":0.00378,"81":0.00378,"83":0.00378,"84":0.00378,"85":0.00755,"86":0.00755,"87":0.01133,"88":0.00378,"89":0.00755,"90":0.00755,"91":0.00755,"92":0.00378,"93":0.00378,"94":0,"95":0.00378,"96":0.00755,"97":0.01889,"98":0.00755,"99":0.00755,"100":0.00378,"101":0.00755,"102":0.00755,"103":0.03399,"104":0.01511,"105":0.02266,"106":0.03399,"107":0.03777,"108":0.06043,"109":0.31349,"110":0.25684,"111":0.04155,"112":0.11331,"113":0.12086,"114":0.3286,"115":2.68922,"116":1.5599,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00378,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00378,"70":0.01889,"71":0.10576,"72":0.06043,"73":0,"74":0,"75":0,"76":0.01511,"77":0.00378,"78":0,"79":0,"80":0.00378,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00378,"90":0,"91":0.00755,"92":0,"93":0.00755,"94":0,"95":0.00755,"96":0.00378,"97":0.00378,"98":0,"99":0.00755,"100":0.18885,"101":0.17374,"102":0.00755,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00378,"13":0,"14":0.00378,"15":0.00755,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00378,"91":0,"92":0.00755,"93":0,"94":0,"95":0,"96":0.00378,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00378,"104":0.00378,"105":0.00378,"106":0.00755,"107":0.01133,"108":0.01511,"109":0.07932,"110":0.00755,"111":0.00378,"112":0.00755,"113":0.01133,"114":0.13597,"115":1.3295,"116":0.44946},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00378,"9":0.01133,"10":0,"11":0,"12":0,"13":0.00378,"14":0.02266,"15":0.00378,"17":0.00755,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01133,"10.1":0,"11.1":0,"12.1":0.04532,"13.1":0.11709,"14.1":0.10198,"15.1":0.00755,"15.2-15.3":0.00755,"15.4":0.01511,"15.5":0.03022,"15.6":0.24928,"16.0":0.02644,"16.1":0.05288,"16.2":0.04532,"16.3":0.10576,"16.4":0.04532,"16.5":0.37392,"16.6":0.61187},G:{"8":0.00455,"17":0.23219,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.1639,"5.0-5.1":0.00228,"6.0-6.1":0.00455,"7.0-7.1":0.01593,"8.1-8.4":0.02732,"9.0-9.2":0.46894,"9.3":0.04325,"10.0-10.2":0,"10.3":0.03642,"11.0-11.2":0.10016,"11.3-11.4":0.01138,"12.0-12.1":0.02504,"12.2-12.5":0.15252,"13.0-13.1":0.00455,"13.2":0.00228,"13.3":0.01593,"13.4-13.7":0.04325,"14.0-14.4":0.08195,"14.5-14.8":0.20715,"15.0-15.1":0.08423,"15.2-15.3":0.08195,"15.4":0.09333,"15.5":0.22992,"15.6-15.7":1.15641,"16.0":0.70113,"16.1":1.466,"16.2":0.66698,"16.3":1.359,"16.4":0.30959,"16.5":4.76904,"16.6":10.19595},P:{"4":0.1138,"20":0.08277,"21":0.21726,"5.0-5.4":0,"6.2-6.4":0.01035,"7.2-7.4":0.01035,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01035,"12.0":0,"13.0":0.01035,"14.0":0.02069,"15.0":0.01035,"16.0":0.01035,"17.0":0.01035,"18.0":0.03104,"19.0":0.03104},I:{"0":0,"3":0.0539,"4":0.01797,"2.1":0.02777,"2.2":0.08166,"2.3":0.01143,"4.1":0.07023,"4.2-4.3":0.07023,"4.4":0,"4.4.3-4.4.4":0.26459},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00441,"8":0.04407,"9":0.00881,"10":0.00881,"11":0.06169,"5.5":0},S:{"2.5":0.00622,_:"3.0-3.1"},J:{"7":0,"10":0.01245},N:{"10":0.02489,"11":0},L:{"0":49.32484},R:{_:"0"},M:{"0":1.3255},Q:{"13.1":1.13259},O:{"0":2.12204},H:{"0":1.39629}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00428,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00428,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00856,"49":0,"50":0.00428,"51":0,"52":0.02997,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00428,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01285,"69":0,"70":0,"71":0,"72":0.00428,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.05138,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00428,"89":0.00428,"90":0,"91":0.05567,"92":0,"93":0.00428,"94":0,"95":0,"96":0,"97":0.00428,"98":0,"99":0,"100":0,"101":0,"102":1.26319,"103":0.00428,"104":0.00856,"105":0.00856,"106":0,"107":0.00856,"108":0.01713,"109":0.00856,"110":0.01713,"111":0.02569,"112":0.01285,"113":0.02141,"114":0.00856,"115":0.25264,"116":0.10705,"117":1.5929,"118":0.14131,"119":0,"120":0,"3.5":0,"3.6":0.00428},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00428,"40":0.00428,"41":0.00428,"42":0.00428,"43":0.00428,"44":0.00856,"45":0.0471,"46":0.00428,"47":0.00428,"48":0.01713,"49":0.01713,"50":0,"51":0.00856,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00428,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00428,"70":0.00428,"71":0.00428,"72":0.09849,"73":0,"74":0.00856,"75":0,"76":0,"77":0,"78":0,"79":0.01285,"80":0.01285,"81":0,"83":0.00428,"84":0.00428,"85":0.00856,"86":0.02141,"87":0.01285,"88":0.00428,"89":0.01713,"90":0.00428,"91":0.00856,"92":0.00856,"93":0,"94":0.00428,"95":0.00428,"96":0.01285,"97":0.00856,"98":0.00428,"99":0.01285,"100":0.00428,"101":0.00856,"102":0.00428,"103":0.04282,"104":0.00856,"105":0.10277,"106":0.06851,"107":0.08136,"108":0.12418,"109":0.36397,"110":0.34684,"111":0.06423,"112":0.15415,"113":0.0471,"114":0.14559,"115":0.17556,"116":4.31626,"117":1.56721,"118":0.00428,"119":0.00856,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00428,"29":0,"30":0,"31":0.00428,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00428,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00428,"68":0,"69":0.00428,"70":0.00428,"71":0.02569,"72":0.0942,"73":0.02141,"74":0,"75":0,"76":0,"77":0.03854,"78":0.00428,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00856,"90":0,"91":0,"92":0,"93":0,"94":0.00856,"95":0.01713,"96":0.01285,"97":0,"98":0,"99":0,"100":0.05138,"101":0.1199,"102":0.36397,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00428,"13":0,"14":0.00428,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00856,"97":0,"98":0,"99":0,"100":0,"101":0.00428,"102":0,"103":0.00856,"104":0,"105":0,"106":0.01285,"107":0.01285,"108":0.00428,"109":0.05138,"110":0.00856,"111":0.02569,"112":0.00856,"113":0.01285,"114":0.08992,"115":0.09849,"116":1.08763,"117":1.17327},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01285,"10":0,"11":0,"12":0,"13":0.00428,"14":0.03854,"15":0.00428,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00428,"10.1":0,"11.1":0,"12.1":0.06423,"13.1":0.10705,"14.1":0.15843,"15.1":0.00856,"15.2-15.3":0.01285,"15.4":0.02141,"15.5":0.05567,"15.6":0.25692,"16.0":0.05567,"16.1":0.1199,"16.2":0.07279,"16.3":0.23551,"16.4":0.05138,"16.5":0.27405,"16.6":1.10476,"17.0":0.11561,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.13852,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01283,"8.1-8.4":0.02565,"9.0-9.2":0.44891,"9.3":0.03335,"10.0-10.2":0,"10.3":0.04104,"11.0-11.2":0.08978,"11.3-11.4":0.00257,"12.0-12.1":0.02822,"12.2-12.5":0.13596,"13.0-13.1":0.0077,"13.2":0.00513,"13.3":0.01796,"13.4-13.7":0.04617,"14.0-14.4":0.17957,"14.5-14.8":0.45148,"15.0-15.1":0.1103,"15.2-15.3":0.13083,"15.4":0.10774,"15.5":0.27961,"15.6-15.7":1.13896,"16.0":0.73109,"16.1":1.62379,"16.2":0.64131,"16.3":1.24926,"16.4":0.20522,"16.5":0.72596,"16.6":14.85263,"17.0":1.88544,"17.1":0},P:{"4":0.12289,"20":0.10241,"21":0.13313,"22":3.35904,"5.0-5.4":0,"6.2-6.4":0.01024,"7.2-7.4":0.02048,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01024,"14.0":0.01024,"15.0":0,"16.0":0.02048,"17.0":0.01024,"18.0":0.03072,"19.0":0.03072},I:{"0":0,"3":0.05328,"4":0.01724,"2.1":0.02664,"2.2":0.08148,"2.3":0.01254,"4.1":0.06581,"4.2-4.3":0.06738,"4.4":0,"4.4.3-4.4.4":0.24132},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00467,"8":0.04204,"9":0.00934,"10":0.00934,"11":0.0327,"5.5":0},S:{"2.5":0.00572,_:"3.0-3.1"},J:{"7":0,"10":0.00572},N:{"10":0.01144,"11":0.01144},L:{"0":42.75712},R:{_:"0"},M:{"0":1.13216},Q:{"13.1":1.0178},O:{"0":1.81261},H:{"0":1.03938}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LV.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LV.js
index 58aca9753d6b52..08783ad2bf886b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LV.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LV.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0.01835,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01223,"49":0,"50":0,"51":0,"52":0.06115,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00612,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01223,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00612,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00612,"89":0.01223,"90":0.00612,"91":0,"92":0,"93":0.00612,"94":0,"95":0.00612,"96":0,"97":0,"98":0,"99":0.01223,"100":0,"101":0,"102":0.06727,"103":0.00612,"104":0,"105":0.00612,"106":0,"107":0,"108":0.00612,"109":0.00612,"110":0.03058,"111":0.00612,"112":0.01835,"113":0.01835,"114":0.03058,"115":0.72769,"116":1.87119,"117":0.06727,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00612,"39":0,"40":0,"41":0.00612,"42":0,"43":0,"44":0.00612,"45":0.00612,"46":0.00612,"47":0.00612,"48":0,"49":0.01223,"50":0,"51":0.00612,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00612,"72":0.01223,"73":0,"74":0.00612,"75":0,"76":0,"77":0,"78":0,"79":0.06115,"80":0.01223,"81":0.00612,"83":0,"84":0.00612,"85":0.01223,"86":0.01223,"87":0.01835,"88":0.00612,"89":0.00612,"90":0.02446,"91":0.00612,"92":0.04892,"93":0.01223,"94":0.00612,"95":0,"96":0.00612,"97":0.00612,"98":0.00612,"99":0.01223,"100":0.00612,"101":0.39136,"102":0.01223,"103":0.0795,"104":0.00612,"105":0.01223,"106":0.04281,"107":0.01835,"108":0.04892,"109":1.54098,"110":0.05504,"111":0.03669,"112":0.1223,"113":0.0795,"114":2.11579,"115":15.7339,"116":6.14558,"117":0.01223,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0.00612,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00612,"29":0,"30":0,"31":0,"32":0.00612,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00612,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00612,"72":0.00612,"73":0,"74":0,"75":0,"76":0,"77":0.00612,"78":0,"79":0,"80":0,"81":0.00612,"82":0,"83":0,"84":0,"85":0.00612,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.09173,"96":0,"97":0,"98":0.00612,"99":0.06727,"100":0.67877,"101":0.5687,"102":0.01835,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00612,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00612,"107":0.01223,"108":0.00612,"109":0.02446,"110":0.00612,"111":0.00612,"112":0.00612,"113":0.02446,"114":0.2018,"115":3.09419,"116":0.66654},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00612,"10":0,"11":0,"12":0,"13":0,"14":0.03058,"15":0.00612,"17":0.02446,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00612,"10.1":0,"11.1":0,"12.1":0.03669,"13.1":0.03058,"14.1":0.04892,"15.1":0.00612,"15.2-15.3":0.00612,"15.4":0.01835,"15.5":0.03058,"15.6":0.11619,"16.0":0.01223,"16.1":0.08561,"16.2":0.04281,"16.3":0.09784,"16.4":0.04281,"16.5":0.30575,"16.6":0.3241},G:{"8":0,"17":0.28503,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00175,"6.0-6.1":0,"7.0-7.1":0.00699,"8.1-8.4":0.00874,"9.0-9.2":0,"9.3":0.01399,"10.0-10.2":0,"10.3":0.01049,"11.0-11.2":0.02798,"11.3-11.4":0.00175,"12.0-12.1":0.00874,"12.2-12.5":0.11017,"13.0-13.1":0,"13.2":0,"13.3":0.00874,"13.4-13.7":0.02448,"14.0-14.4":0.08743,"14.5-14.8":0.15913,"15.0-15.1":0.06645,"15.2-15.3":0.0682,"15.4":0.07519,"15.5":0.20284,"15.6-15.7":0.8516,"16.0":0.70996,"16.1":1.17335,"16.2":0.68198,"16.3":1.301,"16.4":0.47214,"16.5":3.72115,"16.6":7.39159},P:{"4":0.05095,"20":0.12229,"21":0.3363,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02038,"14.0":0.02038,"15.0":0,"16.0":0.01019,"17.0":0.01019,"18.0":0.02038,"19.0":0.1121},I:{"0":0,"3":0,"4":0.01842,"2.1":0,"2.2":0.00921,"2.3":0.01228,"4.1":0.01228,"4.2-4.3":0.02763,"4.4":0,"4.4.3-4.4.4":0.09516},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01835,"9":0.00612,"10":0.00612,"11":0.03058,"5.5":0},S:{"2.5":0.00389,_:"3.0-3.1"},J:{"7":0,"10":0.00389},N:{"10":0,"11":0},L:{"0":38.39286},R:{_:"0"},M:{"0":0.36131},Q:{"13.1":0},O:{"0":0.06605},H:{"0":0.31631}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0.03486,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.05229,"49":0,"50":0,"51":0,"52":0.04067,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00581,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01743,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.01162,"75":0,"76":0,"77":0,"78":0.00581,"79":0,"80":0,"81":0.00581,"82":0,"83":0,"84":0,"85":0,"86":0.00581,"87":0,"88":0.01162,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00581,"96":0,"97":0,"98":0,"99":0.00581,"100":0,"101":0,"102":0.06391,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00581,"109":0,"110":0.01743,"111":0.01162,"112":0.09296,"113":0.01162,"114":0.01743,"115":0.44156,"116":0.12782,"117":1.95797,"118":0.15687,"119":0.00581,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.01162,"42":0,"43":0.00581,"44":0.00581,"45":0.00581,"46":0.00581,"47":0,"48":0,"49":0.01743,"50":0,"51":0.00581,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.01162,"65":0,"66":0.00581,"67":0,"68":0.01743,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00581,"75":0.01162,"76":0.02324,"77":0.00581,"78":0,"79":0.0581,"80":0.04648,"81":0.00581,"83":0,"84":0,"85":0.02324,"86":0.01162,"87":0.09877,"88":0,"89":0.01743,"90":0.08134,"91":0,"92":0.09877,"93":0.01743,"94":0.01162,"95":0.00581,"96":0.01162,"97":0.00581,"98":0.00581,"99":0.01162,"100":0.24402,"101":0.00581,"102":0.0581,"103":0.16268,"104":0.00581,"105":0.01743,"106":0.04648,"107":0.02324,"108":0.04648,"109":1.55127,"110":0.04648,"111":0.04648,"112":0.05229,"113":0.03486,"114":0.50547,"115":1.05161,"116":15.1641,"117":3.81136,"118":0.00581,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00581,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00581,"71":0,"72":0.00581,"73":0.00581,"74":0,"75":0,"76":0,"77":0.03486,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00581,"86":0,"87":0.00581,"88":0,"89":0,"90":0,"91":0.00581,"92":0,"93":0,"94":0.00581,"95":0.08715,"96":0,"97":0,"98":0,"99":0.01162,"100":0.13363,"101":0.56357,"102":0.48223,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.01162,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00581,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00581,"107":0.01743,"108":0.00581,"109":0.02324,"110":0.01162,"111":0.00581,"112":0.00581,"113":0.00581,"114":0.09877,"115":0.09296,"116":1.69071,"117":1.30144},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00581,"10":0,"11":0,"12":0,"13":0,"14":0.01743,"15":0.01162,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00581,"10.1":0,"11.1":0,"12.1":0,"13.1":0.03486,"14.1":0.03486,"15.1":0.00581,"15.2-15.3":0.01743,"15.4":0.01743,"15.5":0.01743,"15.6":0.09877,"16.0":0.01162,"16.1":0.0581,"16.2":0.03486,"16.3":0.07553,"16.4":0.05229,"16.5":0.10458,"16.6":0.57519,"17.0":0.0581,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00437,"8.1-8.4":0.01747,"9.0-9.2":0.00218,"9.3":0.0131,"10.0-10.2":0,"10.3":0.00873,"11.0-11.2":0.03057,"11.3-11.4":0,"12.0-12.1":0.0131,"12.2-12.5":0.10698,"13.0-13.1":0.00218,"13.2":0.00437,"13.3":2.99987,"13.4-13.7":0.02183,"14.0-14.4":0.08952,"14.5-14.8":0.15502,"15.0-15.1":0.06332,"15.2-15.3":0.06113,"15.4":0.10043,"15.5":0.18121,"15.6-15.7":0.79473,"16.0":0.70084,"16.1":1.06109,"16.2":0.55019,"16.3":1.02179,"16.4":0.22051,"16.5":0.74233,"16.6":10.96023,"17.0":1.73573,"17.1":0.00437},P:{"4":0.03046,"20":0.08121,"21":0.21319,"22":2.96432,"5.0-5.4":0.01015,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01015,"14.0":0.0203,"15.0":0.04061,"16.0":0.0203,"17.0":0.0203,"18.0":0.03046,"19.0":0.10152},I:{"0":0,"3":0.00287,"4":0.02292,"2.1":0.00287,"2.2":0.01146,"2.3":0.01719,"4.1":0.01433,"4.2-4.3":0.03725,"4.4":0,"4.4.3-4.4.4":0.08883},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00581,"8":0.02905,"9":0.00581,"10":0.00581,"11":0.04067,"5.5":0},S:{"2.5":0.00419,_:"3.0-3.1"},J:{"7":0,"10":0.00419},N:{"10":0.01257,"11":0},L:{"0":37.77717},R:{_:"0"},M:{"0":0.3771},Q:{"13.1":0},O:{"0":0.06704},H:{"0":0.34511}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LY.js
index 356a03bc4a8c27..70f1c8801ae52c 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/LY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00148,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00148,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00148,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00148,"109":0,"110":0.00148,"111":0,"112":0.00148,"113":0,"114":0.00148,"115":0.03263,"116":0.05339,"117":0.00297,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00148,"39":0,"40":0,"41":0,"42":0,"43":0.00297,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00148,"50":0,"51":0,"52":0,"53":0,"54":0.00148,"55":0,"56":0,"57":0,"58":0.00593,"59":0,"60":0,"61":0,"62":0,"63":0.00148,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00148,"72":0,"73":0.00148,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00148,"80":0.00148,"81":0.00148,"83":0.00297,"84":0,"85":0,"86":0.00297,"87":0.00297,"88":0.00148,"89":0.00148,"90":0.00148,"91":0.00148,"92":0.00148,"93":0.00297,"94":0,"95":0,"96":0.00148,"97":0.00297,"98":0.00297,"99":0.00297,"100":0,"101":0,"102":0.00742,"103":0.00297,"104":0.00297,"105":0.00148,"106":0.00148,"107":0.00445,"108":0.00593,"109":0.33219,"110":0.00148,"111":0.00148,"112":0.00297,"113":0.00742,"114":0.04597,"115":0.60803,"116":0.38558,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00148,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00297,"60":0.00297,"62":0,"63":0.00297,"64":0.00297,"65":0,"66":0.00148,"67":0.00445,"68":0.00297,"69":0.03114,"70":0.03411,"71":0.10974,"72":0.0697,"73":0.00148,"74":0.00148,"75":0,"76":0.00148,"77":0.00148,"78":0,"79":0.00148,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00148,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01038,"96":0,"97":0,"98":0.00445,"99":0.00297,"100":0.01928,"101":0.04449,"102":0.00148,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00148},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00297,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00297,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00148,"109":0.00593,"110":0.00297,"111":0,"112":0.00148,"113":0.00148,"114":0.01928,"115":0.13792,"116":0.04746},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00148,"15":0,"17":0.00148,_:"0","3.1":0,"3.2":0,"5.1":0.02225,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00148,"14.1":0.00148,"15.1":0,"15.2-15.3":0,"15.4":0.00297,"15.5":0.00148,"15.6":0.00742,"16.0":0.00148,"16.1":0.00148,"16.2":0.00445,"16.3":0.00742,"16.4":0.00297,"16.5":0.00742,"16.6":0.01483},G:{"8":0.00117,"17":0.08651,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00234,"6.0-6.1":0,"7.0-7.1":0.01403,"8.1-8.4":0,"9.0-9.2":0.00234,"9.3":0.17185,"10.0-10.2":0,"10.3":0.09937,"11.0-11.2":0.00585,"11.3-11.4":0.00468,"12.0-12.1":0.01871,"12.2-12.5":0.42671,"13.0-13.1":0.00701,"13.2":0.00351,"13.3":0.18588,"13.4-13.7":0.27239,"14.0-14.4":0.3402,"14.5-14.8":0.28291,"15.0-15.1":0.15782,"15.2-15.3":0.16367,"15.4":0.19406,"15.5":0.26538,"15.6-15.7":0.97032,"16.0":0.68975,"16.1":0.7178,"16.2":0.39047,"16.3":0.78327,"16.4":0.42554,"16.5":2.27266,"16.6":2.72859},P:{"4":0.10201,"20":0.16321,"21":0.31622,"5.0-5.4":0,"6.2-6.4":0.0204,"7.2-7.4":0.27542,"8.2":0,"9.2":0.0204,"10.1":0,"11.1-11.2":0.0408,"12.0":0.0204,"13.0":0.17341,"14.0":0.051,"15.0":0.0306,"16.0":0.12241,"17.0":0.051,"18.0":0.0612,"19.0":0.14281},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00837,"4.4":0,"4.4.3-4.4.4":0.08574},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00297,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.6007},R:{_:"0"},M:{"0":0.03407},Q:{"13.1":0},O:{"0":0.4514},H:{"0":2.37869}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00134,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00134,"111":0,"112":0,"113":0.00134,"114":0.00134,"115":0.0188,"116":0.00403,"117":0.05506,"118":0.00403,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00134,"39":0,"40":0,"41":0,"42":0,"43":0.00134,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02283,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00537,"59":0,"60":0.00134,"61":0,"62":0,"63":0.00134,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00134,"70":0,"71":0,"72":0,"73":0.00134,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00269,"80":0,"81":0.00269,"83":0.00134,"84":0,"85":0,"86":0.0094,"87":0.00134,"88":0.00134,"89":0.00134,"90":0,"91":0.00134,"92":0.00134,"93":0.00134,"94":0,"95":0.00134,"96":0,"97":0,"98":0.00269,"99":0.00269,"100":0,"101":0,"102":0.00806,"103":0.00269,"104":0.00269,"105":0.00134,"106":0.00134,"107":0.00403,"108":0.00537,"109":0.22965,"110":0.00134,"111":0.00537,"112":0.00269,"113":0.00269,"114":0.01074,"115":0.03492,"116":0.61778,"117":0.1437,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00269,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00134,"60":0.00134,"62":0,"63":0.00269,"64":0.00269,"65":0.00134,"66":0.00134,"67":0.00403,"68":0.00269,"69":0.02283,"70":0.01612,"71":0.04432,"72":0.11147,"73":0.02552,"74":0,"75":0,"76":0,"77":0.00806,"78":0,"79":0.00134,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0094,"96":0,"97":0,"98":0.00403,"99":0.00134,"100":0.00269,"101":0.0282,"102":0.03223,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00134,"79":0,"80":0,"81":0,"83":0,"84":0.00134,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00269,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00403,"110":0.00537,"111":0,"112":0,"113":0.00134,"114":0.0094,"115":0.00403,"116":0.10744,"117":0.06446},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00134,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01612,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00134,"15.1":0,"15.2-15.3":0,"15.4":0.00134,"15.5":0.00134,"15.6":0.00806,"16.0":0,"16.1":0.00269,"16.2":0.00134,"16.3":0.00403,"16.4":0.00134,"16.5":0.00269,"16.6":0.01477,"17.0":0.00403,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01555,"8.1-8.4":0,"9.0-9.2":0.00104,"9.3":0.12959,"10.0-10.2":0,"10.3":0.15032,"11.0-11.2":0.00415,"11.3-11.4":0.00415,"12.0-12.1":0.01659,"12.2-12.5":0.32449,"13.0-13.1":0.00726,"13.2":0.01037,"13.3":0.02177,"13.4-13.7":0.04354,"14.0-14.4":0.21875,"14.5-14.8":0.32138,"15.0-15.1":0.11508,"15.2-15.3":0.14825,"15.4":0.20009,"15.5":0.20423,"15.6-15.7":0.79931,"16.0":0.52873,"16.1":0.59819,"16.2":0.34523,"16.3":0.6127,"16.4":0.31102,"16.5":0.78583,"16.6":3.79336,"17.0":0.56709,"17.1":0},P:{"4":0.11185,"20":0.11185,"21":0.20337,"22":1.22022,"5.0-5.4":0,"6.2-6.4":0.02034,"7.2-7.4":0.27455,"8.2":0,"9.2":0.03051,"10.1":0,"11.1-11.2":0.04067,"12.0":0.01017,"13.0":0.06101,"14.0":0.06101,"15.0":0.03051,"16.0":0.11185,"17.0":0.05084,"18.0":0.06101,"19.0":0.15253},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0199,"4.4":0,"4.4.3-4.4.4":0.07562},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00269,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":81.44853},R:{_:"0"},M:{"0":0.06926},Q:{"13.1":0},O:{"0":0.34628},H:{"0":2.51614}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MA.js
index 5b9ac22001f90c..fdadd40b225e97 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.07101,"53":0,"54":0,"55":0.00789,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00395,"65":0.01973,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00395,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00395,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00395,"100":0.00395,"101":0,"102":0.01973,"103":0.00395,"104":0.00395,"105":0.00395,"106":0.00395,"107":0.00395,"108":0.00395,"109":0.01578,"110":0.00789,"111":0.00395,"112":0.00395,"113":0.00789,"114":0.01578,"115":0.27221,"116":0.53652,"117":0.01973,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00395,"39":0,"40":0,"41":0,"42":0,"43":0.00395,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02762,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00789,"57":0,"58":0.03551,"59":0,"60":0,"61":0,"62":0.00395,"63":0.00395,"64":0.00395,"65":0.00395,"66":0,"67":0.18147,"68":0.00789,"69":0.00395,"70":0.00395,"71":0,"72":0.00395,"73":0.00789,"74":0.00395,"75":0.00395,"76":0.00395,"77":0,"78":0.00395,"79":0.03551,"80":0.00395,"81":0.01973,"83":0.01578,"84":0.00395,"85":0.00789,"86":0.00789,"87":0.01973,"88":0.00789,"89":0.00395,"90":0.00395,"91":0.00395,"92":0.00395,"93":0.00395,"94":0.00395,"95":0.00395,"96":0.00789,"97":0.01184,"98":0.00789,"99":0.01184,"100":0.00395,"101":0.00395,"102":0.01578,"103":0.03551,"104":0.01578,"105":0.02367,"106":0.03156,"107":0.03551,"108":0.03945,"109":1.3847,"110":0.02367,"111":0.03156,"112":0.04734,"113":0.05523,"114":0.46551,"115":5.54667,"116":3.00609,"117":0.01578,"118":0.00395,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00395,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00395,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00395,"70":0,"71":0.01578,"72":0.01578,"73":0,"74":0.00395,"75":0,"76":0,"77":0,"78":0,"79":0.00395,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00395,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04734,"96":0,"97":0,"98":0,"99":0.01578,"100":0.32349,"101":0.3156,"102":0.00789,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00395,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01184,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00395,"108":0.00395,"109":0.02367,"110":0.00789,"111":0.00395,"112":0.00395,"113":0.00395,"114":0.0434,"115":0.88763,"116":0.29588},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01184,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.02762,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00395,"13.1":0.01184,"14.1":0.03156,"15.1":0.01184,"15.2-15.3":0.00395,"15.4":0.00395,"15.5":0.01184,"15.6":0.03945,"16.0":0.00395,"16.1":0.00789,"16.2":0.01184,"16.3":0.01973,"16.4":0.01184,"16.5":0.06312,"16.6":0.06707},G:{"8":0.00382,"17":0.10439,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00127,"5.0-5.1":0.00764,"6.0-6.1":0.00127,"7.0-7.1":0.0802,"8.1-8.4":0.00509,"9.0-9.2":0.00382,"9.3":0.07893,"10.0-10.2":0.00127,"10.3":0.05856,"11.0-11.2":0.02673,"11.3-11.4":0.014,"12.0-12.1":0.01273,"12.2-12.5":0.30044,"13.0-13.1":0.00764,"13.2":0.01528,"13.3":0.02546,"13.4-13.7":0.06238,"14.0-14.4":0.18205,"14.5-14.8":0.28644,"15.0-15.1":0.11203,"15.2-15.3":0.13112,"15.4":0.13749,"15.5":0.23933,"15.6-15.7":1.39909,"16.0":0.65562,"16.1":0.78293,"16.2":0.51559,"16.3":0.99044,"16.4":0.2648,"16.5":2.50028,"16.6":3.71478},P:{"4":0.39662,"20":0.13221,"21":0.34577,"22":2.03394,"5.0-5.4":0.04068,"6.2-6.4":0.02034,"7.2-7.4":0.2339,"8.2":0.01017,"9.2":0.03051,"10.1":0,"11.1-11.2":0.04068,"12.0":0.01017,"13.0":0.07119,"14.0":0.04068,"15.0":0.02034,"16.0":0.05085,"17.0":0.07119,"18.0":0.05085,"19.0":0.08136},I:{"0":0,"3":0,"4":0.03221,"2.1":0,"2.2":0,"2.3":0,"4.1":0.03221,"4.2-4.3":0.06442,"4.4":0,"4.4.3-4.4.4":0.51538},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00821,"9":0,"10":0.0041,"11":0.09026,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.37215},R:{_:"0"},M:{"0":0.15743},Q:{"13.1":0},O:{"0":0.15138},H:{"0":0.38408}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.03566,"53":0,"54":0,"55":0.00324,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.01297,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00324,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00324,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00324,"95":0,"96":0,"97":0,"98":0,"99":0.00324,"100":0,"101":0,"102":0.01297,"103":0.00324,"104":0,"105":0.00324,"106":0.00324,"107":0.00324,"108":0.00324,"109":0.00973,"110":0.00324,"111":0.00324,"112":0.00324,"113":0.00648,"114":0.00648,"115":0.11347,"116":0.0389,"117":0.39552,"118":0.0389,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00324,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01945,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00324,"57":0,"58":0.02269,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00324,"67":0.04215,"68":0.00324,"69":0.00324,"70":0.00648,"71":0,"72":0.00648,"73":0.00648,"74":0,"75":0.00324,"76":0.00324,"77":0,"78":0.00324,"79":0.01621,"80":0,"81":0.00973,"83":0.00973,"84":0.00648,"85":0.00648,"86":0.00648,"87":0.01297,"88":0.00648,"89":0.00324,"90":0.01621,"91":0.00648,"92":0.00324,"93":0.00648,"94":0.00324,"95":0.00324,"96":0.00648,"97":0.02269,"98":0.00324,"99":0.00973,"100":0.00324,"101":0.00648,"102":0.00973,"103":0.01945,"104":0.00648,"105":0.01621,"106":0.02594,"107":0.03566,"108":0.03566,"109":0.94342,"110":0.02269,"111":0.02594,"112":0.03242,"113":0.02594,"114":0.10699,"115":0.14589,"116":4.48044,"117":1.19954,"118":0.00324,"119":0.00324,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00324,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00324,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00324,"70":0,"71":0.00324,"72":0.01945,"73":0.00648,"74":0.00324,"75":0,"76":0,"77":0.04215,"78":0,"79":0.00324,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00324,"86":0,"87":0.00324,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00324,"94":0,"95":0.03242,"96":0,"97":0,"98":0,"99":0.00648,"100":0.05187,"101":0.17831,"102":0.23991,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00324,"15":0.00324,"16":0,"17":0,"18":0.00324,"79":0,"80":0,"81":0,"83":0,"84":0.00324,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00973,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00324,"108":0.00324,"109":0.01621,"110":0.00324,"111":0.00324,"112":0,"113":0.00324,"114":0.01297,"115":0.02594,"116":0.47009,"117":0.34689},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.02269,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01297,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00324,"13.1":0.00973,"14.1":0.01621,"15.1":0.01297,"15.2-15.3":0,"15.4":0.00324,"15.5":0.00648,"15.6":0.02594,"16.0":0.00324,"16.1":0.00648,"16.2":0.01621,"16.3":0.01945,"16.4":0.00648,"16.5":0.01945,"16.6":0.07457,"17.0":0.00648,"17.1":0},G:{"8":0.00469,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01251,"6.0-6.1":0,"7.0-7.1":0.05473,"8.1-8.4":0.00156,"9.0-9.2":0,"9.3":0.05004,"10.0-10.2":0.00313,"10.3":0.03284,"11.0-11.2":0.02189,"11.3-11.4":0.00625,"12.0-12.1":0.01095,"12.2-12.5":0.31899,"13.0-13.1":0.00625,"13.2":0.0172,"13.3":0.20797,"13.4-13.7":0.07037,"14.0-14.4":0.23142,"14.5-14.8":0.36121,"15.0-15.1":0.12197,"15.2-15.3":0.14386,"15.4":0.18295,"15.5":0.29553,"15.6-15.7":1.50582,"16.0":0.70991,"16.1":0.85846,"16.2":0.54416,"16.3":1.04297,"16.4":0.2971,"16.5":0.83969,"16.6":6.99118,"17.0":0.58638,"17.1":0},P:{"4":0.25322,"20":0.12154,"21":0.25322,"22":2.75502,"5.0-5.4":0.02026,"6.2-6.4":0.02026,"7.2-7.4":0.23296,"8.2":0.01013,"9.2":0.01013,"10.1":0,"11.1-11.2":0.0709,"12.0":0.01013,"13.0":0.0709,"14.0":0.04051,"15.0":0.02026,"16.0":0.05064,"17.0":0.0709,"18.0":0.05064,"19.0":0.0709},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01301,"4.2-4.3":0.03904,"4.4":0,"4.4.3-4.4.4":0.30361},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00684,"9":0,"10":0,"11":0.05475,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.30642},R:{_:"0"},M:{"0":0.18922},Q:{"13.1":0},O:{"0":0.1284},H:{"0":0.50544}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MC.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MC.js
index 9d5b3f7bbd9e21..734ffe56103569 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MC.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MC.js
@@ -1 +1 @@
-module.exports={C:{"2":0.0182,"3":0.04246,"4":0.0182,"5":0.00607,"6":0.00607,"7":0,"8":0.00607,"9":0.00607,"10":0,"11":0.00607,"12":0.00607,"13":0.00607,"14":0,"15":0,"16":0,"17":0,"18":0.00607,"19":0,"20":0,"21":0.00607,"22":0,"23":0.01213,"24":0.00607,"25":0.00607,"26":0.02426,"27":0.00607,"28":0,"29":0.01213,"30":0.01213,"31":0.0182,"32":0.01213,"33":0.00607,"34":0.01213,"35":0.0182,"36":0.00607,"37":0.0182,"38":0.04246,"39":0.0364,"40":0.05459,"41":0.0182,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.04246,"68":0.0364,"69":0,"70":0,"71":0,"72":0.04853,"73":0,"74":0,"75":0.21231,"76":0,"77":0,"78":0.24871,"79":0,"80":0,"81":0,"82":0.02426,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.12132,"103":0,"104":0.00607,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00607,"113":0.01213,"114":0.00607,"115":0.643,"116":1.18287,"117":0.05459,"118":0,"119":0,"120":0,"3.5":0.04246,"3.6":0.06673},D:{"4":0.00607,"5":0.00607,"6":0.00607,"7":0.01213,"8":0.00607,"9":0,"10":0.00607,"11":0.00607,"12":0,"13":0,"14":0.00607,"15":0.00607,"16":0.00607,"17":0.01213,"18":0.01213,"19":0.0182,"20":0,"21":0.03033,"22":0,"23":0.00607,"24":0,"25":0,"26":0.01213,"27":0.00607,"28":0.01213,"29":0.01213,"30":0.01213,"31":0.02426,"32":0.00607,"33":0.01213,"34":0.00607,"35":0.01213,"36":0.03033,"37":0.03033,"38":0.01213,"39":0.06066,"40":0.0364,"41":0.05459,"42":0.06673,"43":0.10312,"44":0.08492,"45":0.11525,"46":0.09099,"47":0.09099,"48":0,"49":0,"50":0,"51":0.10919,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00607,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00607,"66":0,"67":0,"68":0,"69":0,"70":0.03033,"71":0.04246,"72":0.00607,"73":0,"74":0,"75":0,"76":0.0364,"77":0,"78":0.00607,"79":0.23051,"80":0.00607,"81":0.21231,"83":0.00607,"84":0.00607,"85":0.53381,"86":0.12132,"87":0.68546,"88":0,"89":0.00607,"90":0.00607,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.03033,"99":0,"100":0.01213,"101":0,"102":0.01213,"103":0.83711,"104":0.06673,"105":0,"106":0,"107":0.0364,"108":0.06673,"109":0.40642,"110":0,"111":0.0182,"112":0.46102,"113":0.06673,"114":0.9099,"115":5.02265,"116":4.31899,"117":0,"118":0,"119":0},F:{"9":0,"11":0.00607,"12":0.0182,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0.00607,"21":0,"22":0,"23":0,"24":0.00607,"25":0.00607,"26":0.0182,"27":0,"28":0.00607,"29":0.00607,"30":0.02426,"31":0.02426,"32":0.02426,"33":0.00607,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00607,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0.04246,"66":0,"67":0,"68":0,"69":0.01213,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.02426,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00607,"99":0.01213,"100":2.54772,"101":4.34326,"102":0,"9.5-9.6":0.00607,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.01213,"11.5":0.00607,"11.6":0,"12.1":0.00607},B:{"12":0.02426,"13":0,"14":0.06673,"15":0,"16":0,"17":0,"18":0.0364,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.00607,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01213,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00607,"108":0,"109":0.00607,"110":0,"111":0,"112":0,"113":0,"114":0.12132,"115":1.31632,"116":0.38822},E:{"4":0,"5":0.01213,"6":0.00607,"7":0.00607,"8":0.0182,"9":0.20018,"10":0,"11":0,"12":0,"13":0,"14":0.09706,"15":0.00607,"17":0.01213,_:"0","3.1":0.00607,"3.2":0,"5.1":0.00607,"6.1":0.00607,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.04246,"13.1":0.10919,"14.1":0.50954,"15.1":0.0182,"15.2-15.3":0.06066,"15.4":0.11525,"15.5":0.0364,"15.6":0.5702,"16.0":0.03033,"16.1":0.09706,"16.2":0.07279,"16.3":0.3033,"16.4":0.07886,"16.5":1.28599,"16.6":2.26262},G:{"8":0.02238,"17":0.25735,"3.2":0.01119,"4.0-4.1":0,"4.2-4.3":0.01865,"5.0-5.1":0.04849,"6.0-6.1":0.01119,"7.0-7.1":0.28718,"8.1-8.4":0.4401,"9.0-9.2":0.05222,"9.3":0.13427,"10.0-10.2":0.02238,"10.3":0.08205,"11.0-11.2":0.83544,"11.3-11.4":0.02984,"12.0-12.1":0.20886,"12.2-12.5":0.14919,"13.0-13.1":0.00373,"13.2":0.04849,"13.3":0.01492,"13.4-13.7":0.00746,"14.0-14.4":0.20513,"14.5-14.8":0.65269,"15.0-15.1":0.36924,"15.2-15.3":0.08205,"15.4":0.15292,"15.5":0.36924,"15.6-15.7":2.15201,"16.0":0.77577,"16.1":2.10726,"16.2":1.07041,"16.3":1.72683,"16.4":0.22378,"16.5":11.08081,"16.6":13.62443},P:{"4":0.16972,"20":0,"21":0.11669,"5.0-5.4":0,"6.2-6.4":0.10608,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0.02082,"4":0.40655,"2.1":0.05878,"2.2":0.21185,"2.3":0.25348,"4.1":0.21919,"4.2-4.3":0.4543,"4.4":0,"4.4.3-4.4.4":1.18658},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.03655,"7":0.067,"8":0.6822,"9":0.17055,"10":0.15837,"11":0.31674,"5.5":0},S:{"2.5":0.03934,_:"3.0-3.1"},J:{"7":0,"10":0.12195},N:{"10":0.20886,"11":0.07832},L:{"0":19.18381},R:{_:"0"},M:{"0":0.23211},Q:{"13.1":0.00393},O:{"0":0.19277},H:{"0":0.28678}};
+module.exports={C:{"2":0.02015,"3":0.02686,"4":0.01343,"5":0.00672,"6":0.00672,"7":0.00672,"8":0.00672,"9":0.00672,"10":0,"11":0.00672,"12":0.01343,"13":0.01343,"14":0.00672,"15":0.00672,"16":0.00672,"17":0.02015,"18":0.00672,"19":0,"20":0.00672,"21":0.00672,"22":0.00672,"23":0.01343,"24":0.01343,"25":0.00672,"26":0.00672,"27":0.00672,"28":0,"29":0.02015,"30":0.01343,"31":0.01343,"32":0.01343,"33":0.00672,"34":0.01343,"35":0.01343,"36":0.01343,"37":0.00672,"38":0.02686,"39":0.01343,"40":0.02686,"41":0.02015,"42":0.00672,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00672,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.10074,"68":0.10746,"69":0,"70":0,"71":0,"72":0.10746,"73":0,"74":0,"75":0.49027,"76":0,"77":0.00672,"78":0.30894,"79":0,"80":0,"81":0,"82":0.04701,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01343,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.34923,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00672,"110":0,"111":0,"112":0,"113":0.01343,"114":0,"115":0.2082,"116":0.14775,"117":1.51782,"118":0.1276,"119":0,"120":0,"3.5":0.02015,"3.6":0.03358},D:{"4":0.00672,"5":0,"6":0.00672,"7":0.01343,"8":0,"9":0.00672,"10":0,"11":0.00672,"12":0,"13":0,"14":0.00672,"15":0.00672,"16":0,"17":0.00672,"18":0.00672,"19":0.01343,"20":0,"21":0.02015,"22":0.00672,"23":0.00672,"24":0,"25":0,"26":0.00672,"27":0,"28":0.00672,"29":0,"30":0,"31":0.02015,"32":0.00672,"33":0.01343,"34":0.00672,"35":0,"36":0.02015,"37":0.02686,"38":0.00672,"39":0.02686,"40":0.0403,"41":0.05373,"42":0.03358,"43":0.06044,"44":0.10074,"45":0.06716,"46":0.08731,"47":0.07388,"48":0,"49":0,"50":0,"51":0.10746,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00672,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00672,"66":0,"67":0,"68":0,"69":0,"70":0.04701,"71":0.09402,"72":0.00672,"73":0,"74":0.00672,"75":0,"76":0.10746,"77":0,"78":0.00672,"79":0.52385,"80":0.02015,"81":0.53056,"83":0.00672,"84":0.02015,"85":1.20888,"86":0.0403,"87":1.46409,"88":0,"89":0.2082,"90":0.00672,"91":0.00672,"92":0,"93":0.00672,"94":0,"95":0,"96":0,"97":0,"98":0.04701,"99":0.01343,"100":0.01343,"101":0,"102":0.00672,"103":0.51042,"104":0.05373,"105":0.06716,"106":0.26864,"107":0.17462,"108":0.40296,"109":0.74548,"110":0.1276,"111":0.42982,"112":0.60444,"113":0.05373,"114":0.12089,"115":0.24849,"116":10.06728,"117":2.57894,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0.00672,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00672,"25":0,"26":0.00672,"27":0.00672,"28":0,"29":0,"30":0.01343,"31":0.03358,"32":0.0403,"33":0.00672,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0.09402,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.03358,"78":0.02015,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00672,"93":0,"94":0,"95":0.00672,"96":0,"97":0,"98":0,"99":0.00672,"100":0.00672,"101":6.38692,"102":1.86033,"9.5-9.6":0,"10.0-10.1":0.00672,"10.5":0,"10.6":0,"11.1":0.00672,"11.5":0.00672,"11.6":0,"12.1":0.02015},B:{"12":0.0403,"13":0,"14":0.08059,"15":0,"16":0,"17":0,"18":0.10074,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.01343,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.23506,"110":0,"111":0,"112":0,"113":0,"114":0.10746,"115":0.26864,"116":1.01412,"117":0.69846},E:{"4":0.01343,"5":0.01343,"6":0.00672,"7":0,"8":0.01343,"9":0.14104,"10":0,"11":0,"12":0,"13":0,"14":0.25521,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01343,"6.1":0,"7.1":0.00672,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00672,"13.1":0.14775,"14.1":0.28207,"15.1":0.00672,"15.2-15.3":0.00672,"15.4":0.02686,"15.5":0.03358,"15.6":0.3358,"16.0":0.02686,"16.1":0.22163,"16.2":0.06044,"16.3":0.28879,"16.4":0.09402,"16.5":0.32908,"16.6":2.7267,"17.0":0.16118,"17.1":0},G:{"8":0.01543,"3.2":0.00309,"4.0-4.1":0,"4.2-4.3":0.02778,"5.0-5.1":0.01852,"6.0-6.1":0.0463,"7.0-7.1":0.17284,"8.1-8.4":0.3179,"9.0-9.2":0.02161,"9.3":0.1142,"10.0-10.2":0.04938,"10.3":0.12346,"11.0-11.2":0.70371,"11.3-11.4":0,"12.0-12.1":0.27161,"12.2-12.5":0.14198,"13.0-13.1":0,"13.2":0.02778,"13.3":0.00926,"13.4-13.7":0.00309,"14.0-14.4":0.21914,"14.5-14.8":0.49074,"15.0-15.1":0.21605,"15.2-15.3":0.04012,"15.4":0.1821,"15.5":0.14198,"15.6-15.7":1.61112,"16.0":0.51852,"16.1":1.46297,"16.2":0.87038,"16.3":0.97223,"16.4":0.14506,"16.5":1.0926,"16.6":18.91373,"17.0":1.69754,"17.1":0.00309},P:{"4":0.13349,"20":0.04107,"21":0.01027,"22":1.07821,"5.0-5.4":0,"6.2-6.4":0.09242,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0.01027,"19.0":0.01027},I:{"0":0,"3":0.01809,"4":0.34848,"2.1":0.05547,"2.2":0.20861,"2.3":0.22549,"4.1":0.23634,"4.2-4.3":0.39551,"4.4":0,"4.4.3-4.4.4":0.82719},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.02686,"7":0.05373,"8":0.61116,"9":0.12089,"10":0.09402,"11":0.32237,"5.5":0.00672},S:{"2.5":0.03612,_:"3.0-3.1"},J:{"7":0,"10":0.0821},N:{"10":0.14748,"11":0.1021},L:{"0":18.10616},R:{_:"0"},M:{"0":0.23645},Q:{"13.1":0.00328},O:{"0":0.22988},H:{"0":0.05596}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MD.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MD.js
index 22aad3a878f504..edf24035c5b874 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MD.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MD.js
@@ -1 +1 @@
-module.exports={C:{"38":0.00442,"48":0.01768,"52":0.11931,"57":0.00442,"63":0.00884,"66":0.00884,"68":0.03977,"78":0.0221,"87":0.06187,"91":0.0221,"101":0.00884,"102":0.22095,"103":0.01768,"104":0.00884,"109":0.00884,"111":0.00442,"112":0.00442,"113":0.02651,"114":0.0221,"115":0.70704,"116":1.33454,"117":0.04419,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 58 59 60 61 62 64 65 67 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 88 89 90 92 93 94 95 96 97 98 99 100 105 106 107 108 110 118 119 120 3.5","3.6":0.06629},D:{"31":0.00442,"33":0.00442,"37":0.00442,"38":0.00884,"39":0.00442,"40":0.00442,"41":0.00884,"42":0.00884,"43":0.00884,"44":0.01326,"45":0.01326,"46":0.00884,"47":0.01326,"49":0.06187,"51":0.01768,"53":0.00884,"55":0.00442,"56":0.01768,"57":0.00442,"58":0.00442,"60":0.00442,"63":0.00442,"64":0.00442,"66":0.00442,"67":0.00884,"68":0.00884,"69":0.00884,"70":0.0221,"71":0.00442,"72":0.00884,"73":0.00442,"74":0.01326,"75":0.00884,"76":0.01326,"77":0.00884,"78":0.00884,"79":0.05745,"80":0.03535,"81":0.01326,"83":0.01326,"84":0.01326,"85":0.0221,"86":0.03093,"87":0.01768,"88":0.01768,"89":0.00884,"90":0.02651,"91":0.0221,"92":0.00884,"93":0.00442,"94":0.01326,"95":0.00442,"96":0.00442,"97":0.01326,"98":0.02651,"99":0.01768,"100":0.01768,"101":0.02651,"102":0.10606,"103":0.03535,"104":0.22979,"105":0.14583,"106":0.12815,"107":0.08396,"108":0.83519,"109":4.45877,"110":0.03977,"111":0.06629,"112":0.11048,"113":0.2784,"114":1.03405,"115":14.10545,"116":7.31786,"117":0.0221,"118":0.01326,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 34 35 36 48 50 52 54 59 61 62 65 119"},F:{"82":0.01768,"85":0.06187,"89":0.01326,"93":0.00884,"94":0.00442,"95":0.54796,"99":0.03535,"100":1.40524,"101":1.43618,"102":0.00884,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 84 86 87 88 90 91 92 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6","10.0-10.1":0,"12.1":0.00884},B:{"16":0.00442,"18":0.01326,"90":0.00884,"92":0.00884,"104":0.00884,"105":0.03977,"107":0.00442,"108":0.0221,"109":0.01768,"110":0.02651,"113":0.00442,"114":0.06187,"115":1.64387,"116":0.49051,_:"12 13 14 15 17 79 80 81 83 84 85 86 87 88 89 91 93 94 95 96 97 98 99 100 101 102 103 106 111 112"},E:{"4":0,"9":0.01768,"14":0.00884,"15":0.00442,"17":0.0221,_:"0 5 6 7 8 10 11 12 13 3.1 3.2 6.1 7.1 10.1 11.1","5.1":0.00884,"9.1":0.01326,"12.1":0.00442,"13.1":0.03093,"14.1":0.06629,"15.1":0.00884,"15.2-15.3":0.01326,"15.4":0.05745,"15.5":0.02651,"15.6":0.20769,"16.0":0.04861,"16.1":0.07512,"16.2":0.0707,"16.3":0.10606,"16.4":0.03535,"16.5":0.33584,"16.6":0.2563},G:{"8":0,"17":0.1643,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00245,"6.0-6.1":0,"7.0-7.1":0.01104,"8.1-8.4":0.01226,"9.0-9.2":0.00245,"9.3":0.03311,"10.0-10.2":0,"10.3":0.02697,"11.0-11.2":0.03188,"11.3-11.4":0.00736,"12.0-12.1":0.01349,"12.2-12.5":0.12507,"13.0-13.1":0.00368,"13.2":0.00368,"13.3":0.02452,"13.4-13.7":0.01962,"14.0-14.4":0.07602,"14.5-14.8":0.17779,"15.0-15.1":0.05272,"15.2-15.3":0.07234,"15.4":0.04782,"15.5":0.18269,"15.6-15.7":0.92205,"16.0":0.56034,"16.1":0.83622,"16.2":0.46103,"16.3":0.84726,"16.4":0.18147,"16.5":2.57733,"16.6":4.77334},P:{"4":0.09448,"20":0.08398,"21":0.13647,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.021,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.021,"12.0":0,"13.0":0.04199,"14.0":0.02089,"15.0":0.021,"16.0":0,"17.0":0.021,"18.0":0.0105,"19.0":0.05249},I:{"0":0,"3":0.00145,"4":0.01017,"2.1":0.00145,"2.2":0.00436,"2.3":0.00581,"4.1":0.01017,"4.2-4.3":0.01453,"4.4":0,"4.4.3-4.4.4":0.0581},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00442,"7":0.00442,"8":0.0707,"9":0.00884,"10":0.01326,"11":0.36678,_:"5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00558},N:{"10":0,"11":0},L:{"0":41.83987},R:{_:"0"},M:{"0":0.19534},Q:{"13.1":0},O:{"0":0.06697},H:{"0":0.31702}};
+module.exports={C:{"48":0.05308,"52":0.06941,"60":0.06533,"61":0.02042,"68":0.0245,"69":0.06941,"78":0.01225,"86":0.01633,"87":0.05308,"91":0.00817,"95":0.02858,"97":0.00408,"100":0.01225,"102":0.17557,"103":0.00408,"104":0.04491,"105":0.02858,"111":0.04083,"112":0.00408,"113":0.01225,"114":0.02042,"115":0.36747,"116":0.07758,"117":1.06975,"118":0.09391,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 54 55 56 57 58 59 62 63 64 65 66 67 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 88 89 90 92 93 94 96 98 99 101 106 107 108 109 110 119 120 3.5","3.6":0.04491},D:{"40":0.00408,"41":0.00817,"42":0.00408,"43":0.00817,"44":0.00817,"45":0.00817,"46":0.00817,"47":0.01225,"49":0.05716,"51":0.02858,"53":0.00408,"55":0.00408,"56":0.00408,"58":0.00408,"62":0.00408,"63":0.00817,"64":0.00408,"66":0.00817,"67":0.00817,"68":0.01633,"69":0.01225,"70":0.02042,"71":0.01225,"72":0.01633,"73":0.12657,"74":0.02042,"75":0.1674,"76":0.18374,"77":0.27764,"78":0.01633,"79":0.17557,"80":0.15515,"81":0.06125,"83":0.14699,"84":0.15515,"85":0.1674,"86":0.41238,"87":0.06533,"88":0.02042,"89":0.05716,"90":0.82068,"91":0.10208,"92":0.02858,"93":0.14699,"94":0.01225,"96":0.11024,"97":0.05716,"98":0.11841,"99":0.01633,"100":0.0245,"101":0.13882,"102":0.30623,"103":0.05716,"104":0.20415,"105":0.03675,"106":0.15515,"107":0.20007,"108":0.34706,"109":3.65837,"110":0.06533,"111":0.05716,"112":0.06125,"113":0.08574,"114":0.83293,"115":0.77169,"116":14.30683,"117":3.04184,"118":0.01225,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 48 50 52 54 57 59 60 61 65 95 119 120"},F:{"54":0.00408,"63":0.02858,"67":0.04083,"68":0.02042,"70":0.00817,"71":0.05716,"72":0.03266,"77":0.00817,"79":0.00817,"82":0.01225,"85":0.049,"86":0.01225,"91":0.00817,"95":0.44096,"99":0.01633,"100":0.15924,"101":0.77169,"102":0.76352,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 55 56 57 58 60 62 64 65 66 69 73 74 75 76 78 80 81 83 84 87 88 89 90 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00817,"18":0.06125,"90":0.09391,"92":0.00408,"106":0.01225,"108":0.00817,"109":0.01633,"110":0.01633,"113":0.00817,"114":0.0245,"115":0.0245,"116":0.82477,"117":0.63695,_:"13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 91 93 94 95 96 97 98 99 100 101 102 103 104 105 107 111 112"},E:{"4":0,"9":0.01225,"14":0.00817,_:"0 5 6 7 8 10 11 12 13 15 3.1 3.2 6.1 7.1 10.1 11.1 12.1 17.1","5.1":0.00408,"9.1":0.06533,"13.1":0.0245,"14.1":0.04491,"15.1":0.00408,"15.2-15.3":0.00408,"15.4":0.04491,"15.5":0.01225,"15.6":0.09391,"16.0":0.00817,"16.1":0.03675,"16.2":0.0245,"16.3":0.049,"16.4":0.02042,"16.5":0.13882,"16.6":0.28989,"17.0":0.03675},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00836,"8.1-8.4":0.00836,"9.0-9.2":0,"9.3":0.02175,"10.0-10.2":0,"10.3":0.02007,"11.0-11.2":0.03178,"11.3-11.4":0.00502,"12.0-12.1":0.02844,"12.2-12.5":0.16896,"13.0-13.1":0.00836,"13.2":0.00836,"13.3":5.12236,"13.4-13.7":0.03346,"14.0-14.4":0.08364,"14.5-14.8":0.27101,"15.0-15.1":0.04349,"15.2-15.3":0.05688,"15.4":0.04182,"15.5":0.13216,"15.6-15.7":0.81469,"16.0":0.45502,"16.1":0.62733,"16.2":0.33458,"16.3":0.64239,"16.4":0.12547,"16.5":0.41822,"16.6":6.13613,"17.0":0.97529,"17.1":0.00335},P:{"4":0.01061,"20":0.06369,"21":0.09553,"22":1.78331,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.02123,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01061,"12.0":0,"13.0":0.01061,"14.0":0,"15.0":0,"16.0":0.01061,"17.0":0.02123,"18.0":0.03184,"19.0":0.05307},I:{"0":0,"3":0.06658,"4":0.00156,"2.1":0,"2.2":0.00094,"2.3":0.00125,"4.1":0.00094,"4.2-4.3":0.0025,"4.4":0,"4.4.3-4.4.4":0.00907},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"7":0.00408,"8":0.06125,"9":0.01225,"10":0.00817,"11":0.34706,_:"6 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":41.03142},R:{_:"0"},M:{"0":0.14201},Q:{"13.1":0.00592},O:{"0":0.071},H:{"0":0.23528}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ME.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ME.js
index fe35c1467d1c10..b40fc90347b986 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ME.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ME.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00582,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00291,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00291,"76":0,"77":0,"78":0.00291,"79":0,"80":0.00291,"81":0.00291,"82":0,"83":0,"84":0,"85":0.00291,"86":0,"87":0,"88":0.00291,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00291,"103":0.02037,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00291,"110":0.00291,"111":0.00291,"112":0,"113":0.00291,"114":0.04365,"115":0.10476,"116":0.29973,"117":0.00873,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00291,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00291,"39":0.00291,"40":0.00291,"41":0.00291,"42":0.00291,"43":0.00291,"44":0.00291,"45":0.00291,"46":0.00291,"47":0.00291,"48":0,"49":0.01164,"50":0,"51":0.00291,"52":0,"53":0.00873,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00291,"67":0,"68":0.01746,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00291,"75":0.00291,"76":0.00291,"77":0,"78":0,"79":0.0873,"80":0,"81":0.01455,"83":0.01455,"84":0.00582,"85":0.02328,"86":0.00582,"87":0.02328,"88":0.00291,"89":0.00291,"90":0.00291,"91":0,"92":0.00291,"93":0,"94":0.00873,"95":0.00582,"96":0,"97":0.00873,"98":0,"99":0.02328,"100":0,"101":0.00291,"102":0.00291,"103":0.02037,"104":0.00291,"105":0.00873,"106":0.00873,"107":0.00291,"108":0.01164,"109":0.64602,"110":0.00291,"111":0.00873,"112":0.01746,"113":0.02037,"114":0.25026,"115":3.19227,"116":1.55685,"117":0.00291,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00291,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00582,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00873,"69":0,"70":0.00291,"71":0.00291,"72":0.00582,"73":0,"74":0,"75":0,"76":0,"77":0.00291,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00873,"96":0,"97":0,"98":0.01455,"99":0.00291,"100":0.22407,"101":0.2037,"102":0.00291,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00582,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00873,"108":0,"109":0.00582,"110":0,"111":0.00291,"112":0,"113":0,"114":0.02037,"115":0.30846,"116":0.12804},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00582,"10":0,"11":0,"12":0,"13":0,"14":0.01164,"15":0.00291,"17":0.00873,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00873,"14.1":0.02037,"15.1":0.00291,"15.2-15.3":0.00291,"15.4":0.00582,"15.5":0.00873,"15.6":0.04656,"16.0":0.00291,"16.1":0.01746,"16.2":0.03783,"16.3":0.03783,"16.4":0.01455,"16.5":0.10767,"16.6":0.13095},G:{"8":0.00211,"17":0.11841,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00634,"6.0-6.1":0.00211,"7.0-7.1":0.02537,"8.1-8.4":0.02749,"9.0-9.2":0,"9.3":0.04229,"10.0-10.2":0.00211,"10.3":0.13744,"11.0-11.2":0.0444,"11.3-11.4":0.00423,"12.0-12.1":0.01903,"12.2-12.5":0.26219,"13.0-13.1":0.01057,"13.2":0.00423,"13.3":0.01903,"13.4-13.7":0.04652,"14.0-14.4":0.13744,"14.5-14.8":0.34042,"15.0-15.1":0.10572,"15.2-15.3":0.09092,"15.4":0.12687,"15.5":0.27276,"15.6-15.7":1.42301,"16.0":1.01281,"16.1":1.25174,"16.2":0.70622,"16.3":1.62177,"16.4":0.22202,"16.5":5.19515,"16.6":7.84453},P:{"4":0.2448,"20":0.1632,"21":0.2958,"5.0-5.4":0.0408,"6.2-6.4":0.0204,"7.2-7.4":0.051,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0204,"12.0":0,"13.0":0.0204,"14.0":0.0204,"15.0":0.0102,"16.0":0.33661,"17.0":0.0204,"18.0":0.0306,"19.0":0.051},I:{"0":0,"3":0,"4":0.00738,"2.1":0.00148,"2.2":0.00443,"2.3":0.0059,"4.1":0.12101,"4.2-4.3":0.01181,"4.4":0,"4.4.3-4.4.4":0.05165},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.02037,"9":0.00291,"10":0.00291,"11":0.02037,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00709},N:{"10":0.00709,"11":0.00709},L:{"0":63.1844},R:{_:"0"},M:{"0":0.25524},Q:{"13.1":0},O:{"0":0.03545},H:{"0":0.26178}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00316,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01582,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00633,"76":0,"77":0,"78":0.00633,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00316,"92":0,"93":0,"94":0.00316,"95":0,"96":0,"97":0,"98":0,"99":0.00316,"100":0,"101":0,"102":0.00316,"103":0.0253,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00316,"112":0,"113":0,"114":0.04428,"115":0.06642,"116":0.03479,"117":0.39854,"118":0.03479,"119":0.00316,"120":0,"3.5":0,"3.6":0.00316},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00316,"38":0.00316,"39":0.00316,"40":0.00316,"41":0.00316,"42":0.00316,"43":0.00316,"44":0.00316,"45":0.00633,"46":0.00316,"47":0.00316,"48":0,"49":0.01898,"50":0,"51":0.00316,"52":0,"53":0.01898,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00316,"65":0,"66":0.00316,"67":0,"68":0.02214,"69":0,"70":0.00949,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00316,"77":0,"78":0,"79":0.07591,"80":0,"81":0.01582,"83":0.00949,"84":0.00316,"85":0.01898,"86":0.00316,"87":0.0253,"88":0.00633,"89":0.00633,"90":0,"91":0,"92":0.00633,"93":0,"94":0.00316,"95":0.00633,"96":0.00316,"97":0.00633,"98":0,"99":0.0253,"100":0,"101":0.00316,"102":0,"103":0.02847,"104":0.00316,"105":0.00633,"106":0.01582,"107":0.00949,"108":0.01898,"109":0.83187,"110":0.01582,"111":0.00316,"112":0.01582,"113":0.02214,"114":0.06326,"115":0.17713,"116":4.3428,"117":1.21776,"118":0.00316,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00633,"29":0,"30":0,"31":0.00316,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00949,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.04112,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.01898,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00633,"95":0.01265,"96":0,"97":0,"98":0,"99":0.00633,"100":0.03796,"101":0.37956,"102":0.19294,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00316},B:{"12":0.00316,"13":0,"14":0.00316,"15":0,"16":0,"17":0,"18":0.00316,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01265,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00949,"108":0,"109":0.00633,"110":0,"111":0.00633,"112":0,"113":0,"114":0.00316,"115":0.00633,"116":0.24988,"117":0.19294},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00633,"10":0,"11":0,"12":0,"13":0.00316,"14":0.00633,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00633,"14.1":0.01582,"15.1":0.00316,"15.2-15.3":0.00316,"15.4":0.00633,"15.5":0.00949,"15.6":0.04112,"16.0":0.00316,"16.1":0.0253,"16.2":0.04112,"16.3":0.04112,"16.4":0.01265,"16.5":0.04745,"16.6":0.19927,"17.0":0.01582,"17.1":0},G:{"8":0.00387,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00387,"7.0-7.1":0.02321,"8.1-8.4":0.03289,"9.0-9.2":0.00193,"9.3":0.13541,"10.0-10.2":0.01548,"10.3":0.10059,"11.0-11.2":0.05417,"11.3-11.4":0.00387,"12.0-12.1":0.02902,"12.2-12.5":0.33273,"13.0-13.1":0.00193,"13.2":0.00774,"13.3":0.12574,"13.4-13.7":0.02515,"14.0-14.4":0.14122,"14.5-14.8":0.29984,"15.0-15.1":0.12381,"15.2-15.3":0.1064,"15.4":0.08318,"15.5":0.2805,"15.6-15.7":1.26322,"16.0":0.64612,"16.1":0.85504,"16.2":0.47008,"16.3":1.03882,"16.4":0.15282,"16.5":0.75251,"16.6":11.17162,"17.0":0.82602,"17.1":0.00387},P:{"4":0.25527,"20":0.16337,"21":0.20421,"22":3.68607,"5.0-5.4":0.05105,"6.2-6.4":0.03063,"7.2-7.4":0.03063,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02042,"12.0":0,"13.0":0.03063,"14.0":0.01021,"15.0":0,"16.0":0.05105,"17.0":0.01021,"18.0":0.02042,"19.0":0.11232},I:{"0":0,"3":0.00253,"4":0.0228,"2.1":0.00253,"2.2":0.01267,"2.3":0.02027,"4.1":0.06588,"4.2-4.3":0.03041,"4.4":0,"4.4.3-4.4.4":0.11402},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00316,"8":0.0253,"9":0.00633,"10":0.00633,"11":0.02214,"5.5":0},S:{"2.5":0.00684,_:"3.0-3.1"},J:{"7":0,"10":0.01367},N:{"10":0.01026,"11":0.01026},L:{"0":63.62471},R:{_:"0"},M:{"0":0.27348},Q:{"13.1":0},O:{"0":0.06153},H:{"0":0.26539}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MG.js
index 03eb9ebcde62ff..89db0a8aba47af 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00425,"39":0,"40":0,"41":0,"42":0,"43":0.00425,"44":0,"45":0,"46":0,"47":0,"48":0.0085,"49":0,"50":0,"51":0.0085,"52":0.034,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0085,"69":0,"70":0,"71":0,"72":0.0085,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.05525,"79":0.0085,"80":0.00425,"81":0,"82":0,"83":0,"84":0.00425,"85":0,"86":0,"87":0,"88":0.00425,"89":0.00425,"90":0,"91":0.017,"92":0,"93":0,"94":0.00425,"95":0.00425,"96":0.017,"97":0.00425,"98":0.00425,"99":0.0085,"100":0.00425,"101":0,"102":0.05525,"103":0.0085,"104":0.00425,"105":0.00425,"106":0.00425,"107":0.01275,"108":0.00425,"109":0.017,"110":0.0085,"111":0.0765,"112":0.0255,"113":0.02125,"114":0.07225,"115":0.86275,"116":1.156,"117":0.0425,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02975,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00425,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00425,"41":0,"42":0.00425,"43":0.00425,"44":0,"45":0,"46":0.00425,"47":0,"48":0.00425,"49":0.0085,"50":0.00425,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.0085,"58":0.00425,"59":0,"60":0.00425,"61":0,"62":0.00425,"63":0,"64":0.00425,"65":0,"66":0,"67":0.00425,"68":0.00425,"69":0.00425,"70":0.00425,"71":0,"72":0.017,"73":0.00425,"74":0.0255,"75":0,"76":0.00425,"77":0.00425,"78":0.00425,"79":0.0085,"80":0.00425,"81":0.102,"83":0.00425,"84":0.00425,"85":0,"86":0.0085,"87":0.02125,"88":0.01275,"89":0.017,"90":0.01275,"91":0.00425,"92":0.00425,"93":0.01275,"94":0.00425,"95":0.0255,"96":0.00425,"97":0.0085,"98":0.01275,"99":0.02125,"100":0.01275,"101":0.01275,"102":0.02125,"103":0.034,"104":0.0085,"105":0.02975,"106":0.04675,"107":0.02975,"108":0.0425,"109":2.125,"110":0.017,"111":0.02125,"112":0.0425,"113":0.05525,"114":0.37825,"115":4.3945,"116":2.52875,"117":0.00425,"118":0.00425,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0.00425,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.034,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.01275,"38":0.00425,"39":0,"40":0,"41":0,"42":0.00425,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00425,"51":0.00425,"52":0,"53":0.0425,"54":0,"55":0.00425,"56":0,"57":0,"58":0.0085,"60":0.02975,"62":0,"63":0.017,"64":0.01275,"65":0.01275,"66":0.0085,"67":0.01275,"68":0.01275,"69":0.051,"70":0.051,"71":0.19975,"72":0.14875,"73":0.00425,"74":0.00425,"75":0,"76":0.00425,"77":0,"78":0,"79":0.01275,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.06375,"96":0,"97":0.00425,"98":0.00425,"99":0.0085,"100":0.16575,"101":0.289,"102":0.0085,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.017},B:{"12":0.00425,"13":0,"14":0.0085,"15":0.01275,"16":0,"17":0,"18":0.0085,"79":0,"80":0,"81":0,"83":0,"84":0.00425,"85":0,"86":0,"87":0,"88":0,"89":0.0085,"90":0.00425,"91":0.00425,"92":0.0255,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.017,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00425,"109":0.0765,"110":0.0085,"111":0.00425,"112":0.01275,"113":0.02125,"114":0.06375,"115":0.96475,"116":0.31875},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00425,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00425,"12.1":0,"13.1":0.00425,"14.1":0.017,"15.1":0.00425,"15.2-15.3":0,"15.4":0,"15.5":0.0085,"15.6":0.02975,"16.0":0,"16.1":0.0085,"16.2":0.00425,"16.3":0.0085,"16.4":0.00425,"16.5":0.03825,"16.6":0.07225},G:{"8":0.0061,"17":0.01829,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.0061,"5.0-5.1":0.00559,"6.0-6.1":0,"7.0-7.1":0.04573,"8.1-8.4":0,"9.0-9.2":0.00102,"9.3":0.03252,"10.0-10.2":0,"10.3":0.11839,"11.0-11.2":0.03049,"11.3-11.4":0.00813,"12.0-12.1":0.01677,"12.2-12.5":0.41107,"13.0-13.1":0.00051,"13.2":0.00965,"13.3":0.00864,"13.4-13.7":0.03557,"14.0-14.4":0.11331,"14.5-14.8":0.10874,"15.0-15.1":0.09095,"15.2-15.3":0.06402,"15.4":0.0752,"15.5":0.11738,"15.6-15.7":0.64227,"16.0":0.21545,"16.1":0.27794,"16.2":0.08587,"16.3":0.21341,"16.4":0.08486,"16.5":0.93698,"16.6":1.29979},P:{"4":0.07331,"20":0.04189,"21":0.12568,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.02095,"8.2":0,"9.2":0,"10.1":0.01047,"11.1-11.2":0,"12.0":0,"13.0":0.02095,"14.0":0.04189,"15.0":0.03142,"16.0":0.03142,"17.0":0.02095,"18.0":0.01047,"19.0":0.02095},I:{"0":0,"3":0,"4":0.0057,"2.1":0,"2.2":0,"2.3":0.00285,"4.1":0.01568,"4.2-4.3":0.03279,"4.4":0,"4.4.3-4.4.4":0.23948},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.068,"5.5":0},S:{"2.5":0.8625,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.662},R:{_:"0"},M:{"0":0.4255},Q:{"13.1":0.0115},O:{"0":1.05225},H:{"0":5.19876}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00404,"44":0,"45":0.00404,"46":0,"47":0.00404,"48":0.00404,"49":0,"50":0,"51":0,"52":0.02829,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00404,"59":0,"60":0.00404,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00404,"69":0,"70":0,"71":0,"72":0.00808,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02425,"79":0.02425,"80":0,"81":0,"82":0.00404,"83":0.00404,"84":0,"85":0,"86":0,"87":0,"88":0.00808,"89":0.00404,"90":0,"91":0.01616,"92":0,"93":0,"94":0.12527,"95":0.00404,"96":0.00404,"97":0,"98":0,"99":0.00404,"100":0.00404,"101":0.00404,"102":0.09294,"103":0.00404,"104":0.23438,"105":0.00404,"106":0.00808,"107":0.00808,"108":0.00808,"109":0.02425,"110":0.01212,"111":0.02829,"112":0.00808,"113":0.02425,"114":0.0687,"115":0.53745,"116":0.10103,"117":1.13552,"118":0.08082,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04041,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00404,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00404,"41":0,"42":0.00404,"43":0.01616,"44":0,"45":0,"46":0,"47":0,"48":0.00404,"49":0.00404,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00404,"56":0,"57":0.00808,"58":0.00404,"59":0,"60":0,"61":0.00404,"62":0,"63":0.00404,"64":0.00404,"65":0,"66":0,"67":0,"68":0,"69":0.00404,"70":0.00404,"71":0,"72":0.01212,"73":0.00404,"74":0.00404,"75":0,"76":0,"77":0,"78":0.00404,"79":0.00808,"80":0.00808,"81":0.01212,"83":0.00404,"84":0.00404,"85":0,"86":0.00808,"87":0.00404,"88":0.00808,"89":0.00404,"90":0.00808,"91":0.00404,"92":0.00404,"93":0.00808,"94":0.00404,"95":0.02021,"96":0.01212,"97":0.01212,"98":0.00404,"99":0.01616,"100":0.02021,"101":0.00808,"102":0.01212,"103":0.04445,"104":0.00808,"105":0.01212,"106":0.03637,"107":0.01212,"108":0.03233,"109":2.03262,"110":0.02829,"111":0.02021,"112":0.02425,"113":0.0687,"114":0.15356,"115":0.27075,"116":4.59462,"117":1.28908,"118":0.00404,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0.00404,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.00404,"26":0.00404,"27":0.01212,"28":0.00808,"29":0,"30":0,"31":0,"32":0,"33":0.00404,"34":0,"35":0.00404,"36":0.00404,"37":0.00808,"38":0.00404,"39":0,"40":0,"41":0,"42":0.00404,"43":0,"44":0,"45":0.00404,"46":0,"47":0,"48":0,"49":0,"50":0.00404,"51":0,"52":0,"53":0.02021,"54":0,"55":0,"56":0,"57":0,"58":0.00808,"60":0.05253,"62":0.00808,"63":0.00808,"64":0.00808,"65":0.00404,"66":0.00808,"67":0.00808,"68":0.00808,"69":0.04041,"70":0.04041,"71":0.05253,"72":0.25054,"73":0.05253,"74":0.00404,"75":0,"76":0,"77":0.00808,"78":0,"79":0.00808,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00808,"86":0.00404,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03233,"96":0,"97":0.00404,"98":0,"99":0.00404,"100":0.02425,"101":0.19801,"102":0.2263,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01212},B:{"12":0,"13":0.00404,"14":0.00404,"15":0.01212,"16":0,"17":0,"18":0.00808,"79":0,"80":0,"81":0,"83":0,"84":0.00404,"85":0,"86":0,"87":0,"88":0,"89":0.00404,"90":0.00808,"91":0,"92":0.02021,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00808,"101":0.04445,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00808,"108":0,"109":0.04041,"110":0.00808,"111":0.00404,"112":0.00808,"113":0.00808,"114":0.02425,"115":0.0687,"116":0.76779,"117":0.493},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.04849,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00404,"13.1":0.01212,"14.1":0.01616,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00404,"15.6":0.02425,"16.0":0.00404,"16.1":0.00404,"16.2":0.00404,"16.3":0.01616,"16.4":0.00404,"16.5":0.02021,"16.6":0.08486,"17.0":0.00808,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0.00117,"4.2-4.3":0,"5.0-5.1":0.00292,"6.0-6.1":0,"7.0-7.1":0.01516,"8.1-8.4":0,"9.0-9.2":0.00117,"9.3":0.08573,"10.0-10.2":0,"10.3":0.14288,"11.0-11.2":0.02158,"11.3-11.4":0.00467,"12.0-12.1":0.01575,"12.2-12.5":0.27643,"13.0-13.1":0.00758,"13.2":0.0105,"13.3":1.11271,"13.4-13.7":0.02508,"14.0-14.4":0.08223,"14.5-14.8":0.08573,"15.0-15.1":0.03499,"15.2-15.3":0.04549,"15.4":0.07815,"15.5":0.08748,"15.6-15.7":0.74239,"16.0":0.23036,"16.1":0.20995,"16.2":0.09214,"16.3":0.19828,"16.4":0.2082,"16.5":0.31842,"16.6":1.47196,"17.0":0.18079,"17.1":0.00175},P:{"4":0.05238,"20":0.03143,"21":0.0838,"22":0.67042,"5.0-5.4":0.01048,"6.2-6.4":0,"7.2-7.4":0.03143,"8.2":0,"9.2":0.03143,"10.1":0,"11.1-11.2":0,"12.0":0.02095,"13.0":0,"14.0":0,"15.0":0.01048,"16.0":0.02095,"17.0":0.01048,"18.0":0.01048,"19.0":0.01048},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0081,"4.2-4.3":0.07017,"4.4":0,"4.4.3-4.4.4":0.18084},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01616,"5.5":0},S:{"2.5":1.12029,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.38293},R:{_:"0"},M:{"0":0.35158},Q:{"13.1":0.01192},O:{"0":0.81042},H:{"0":5.1}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MH.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MH.js
index 113b856b5e4660..2dd6f21582fd9e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MH.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MH.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.04747,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.04219,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.02637,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.05274,"113":0.07911,"114":0,"115":0.1213,"116":0.34808,"117":0.01055,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0.03692,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00527,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.04219,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.04747,"74":0,"75":0.00527,"76":0,"77":0,"78":0.04747,"79":0,"80":0.00527,"81":0,"83":0,"84":0,"85":0.00527,"86":0,"87":0.03692,"88":0.00527,"89":0.00527,"90":0,"91":0,"92":0,"93":0.07911,"94":0,"95":0.04219,"96":0.02637,"97":0.10021,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.79637,"104":0,"105":0,"106":0,"107":0.00527,"108":0,"109":3.91331,"110":0,"111":0.02637,"112":0.00527,"113":0.10548,"114":0.07384,"115":8.69155,"116":5.59044,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.06329,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00527,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.02637,"109":0,"110":0,"111":0,"112":0.0211,"113":0.0211,"114":0.10021,"115":1.7035,"116":0.23206},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.02637,"14":0.04219,"15":0.01055,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.03692,"14.1":0.06856,"15.1":0.00527,"15.2-15.3":0,"15.4":0.05274,"15.5":0,"15.6":0.05801,"16.0":0.05274,"16.1":0.06329,"16.2":0.02637,"16.3":0.10548,"16.4":0.01055,"16.5":0.51685,"16.6":0.78055},G:{"8":0,"17":0.05064,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.37308,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.11648,"12.0-12.1":0.01351,"12.2-12.5":0.11479,"13.0-13.1":0,"13.2":0.05064,"13.3":0.01351,"13.4-13.7":0.05233,"14.0-14.4":0.17894,"14.5-14.8":0.19245,"15.0-15.1":0.09116,"15.2-15.3":0.07766,"15.4":0.01351,"15.5":0.02532,"15.6-15.7":1.01458,"16.0":0.82213,"16.1":2.93907,"16.2":2.65715,"16.3":0.98926,"16.4":0.61618,"16.5":4.18493,"16.6":2.29758},P:{"4":0,"20":0.1024,"21":0.18431,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.36863,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02048,"12.0":0,"13.0":0,"14.0":0.06144,"15.0":0,"16.0":0.02048,"17.0":0.0512,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.10548},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":53.10943},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":1.25239},H:{"0":0.0179}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01022,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01022,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00511,"113":0.04088,"114":0,"115":0.03577,"116":0.02044,"117":0.17374,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.02555,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.02044,"74":0,"75":0,"76":0,"77":0,"78":0.00511,"79":0,"80":0.01022,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.01022,"88":0,"89":0.01022,"90":0.00511,"91":0,"92":0,"93":0.0511,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.55188,"104":0,"105":0,"106":0,"107":0.00511,"108":0,"109":1.00156,"110":0,"111":0.00511,"112":0.03066,"113":0.03066,"114":0.01022,"115":0.12264,"116":14.82922,"117":1.92136,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.03066,"102":0.0511,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.02044,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.03577,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.01022,"108":0.01022,"109":0.02044,"110":0,"111":0.02044,"112":0,"113":0.00511,"114":0,"115":0.0511,"116":1.7885,"117":0.53655},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.84315,"14.1":0.06643,"15.1":0,"15.2-15.3":0.00511,"15.4":0.01022,"15.5":0,"15.6":0.01022,"16.0":0,"16.1":0.03066,"16.2":0.12775,"16.3":0.02555,"16.4":0.04088,"16.5":0.06132,"16.6":0.58765,"17.0":0.07665,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.03301,"11.0-11.2":0.01651,"11.3-11.4":0.04952,"12.0-12.1":0,"12.2-12.5":0.08253,"13.0-13.1":0,"13.2":0,"13.3":0.08253,"13.4-13.7":0,"14.0-14.4":0.54471,"14.5-14.8":0.09904,"15.0-15.1":0.13205,"15.2-15.3":0.14856,"15.4":0.11554,"15.5":0.19807,"15.6-15.7":1.58277,"16.0":0.5282,"16.1":2.58781,"16.2":1.23613,"16.3":1.94407,"16.4":0.13205,"16.5":0.49519,"16.6":7.94317,"17.0":0.37964,"17.1":0},P:{"4":0,"20":0.01038,"21":0.02075,"22":1.66012,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.17639,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01038,"12.0":0,"13.0":0,"14.0":0.07263,"15.0":0,"16.0":0,"17.0":0.06225,"18.0":0.02075,"19.0":0.01038},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.29352},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":52.21272},R:{_:"0"},M:{"0":0.27384},Q:{"13.1":0},O:{"0":1.04646},H:{"0":0.15277}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MK.js
index 2f3e2f13b4da51..c1c06a2e91bd38 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MK.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00301,"49":0,"50":0,"51":0.00301,"52":0.04511,"53":0,"54":0,"55":0,"56":0.01203,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00301,"69":0,"70":0,"71":0,"72":0.00301,"73":0,"74":0,"75":0.00301,"76":0,"77":0,"78":0.00301,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00301,"89":0,"90":0,"91":0,"92":0,"93":0.00301,"94":0.00601,"95":0,"96":0,"97":0,"98":0.00301,"99":0.00301,"100":0,"101":0,"102":0.01203,"103":0,"104":0,"105":0,"106":0.00301,"107":0,"108":0,"109":0.00301,"110":0.00301,"111":0,"112":0.00301,"113":0.00301,"114":0.00601,"115":0.19846,"116":0.36685,"117":0.00601,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00301,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00301,"45":0.00301,"46":0,"47":0.00601,"48":0,"49":0.02706,"50":0,"51":0.00301,"52":0,"53":0.00301,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00301,"61":0,"62":0,"63":0,"64":0.00301,"65":0,"66":0,"67":0,"68":0,"69":0.00301,"70":0.00301,"71":0.00301,"72":0,"73":0.01203,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.05413,"80":0,"81":0.02105,"83":0.00902,"84":0,"85":0.00902,"86":0.00301,"87":0.01804,"88":0.00301,"89":0.00301,"90":0.00301,"91":0.00601,"92":0.00301,"93":0.00301,"94":0,"95":0.00601,"96":0.00301,"97":0.00301,"98":0,"99":0.01203,"100":0.00301,"101":0,"102":0.00601,"103":0.00902,"104":0,"105":0.00601,"106":0.00902,"107":0.02105,"108":0.02105,"109":0.92616,"110":0.00902,"111":0.01504,"112":0.00902,"113":0.02105,"114":0.20147,"115":3.41896,"116":1.90343,"117":0.01804,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00902,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00902,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02706,"96":0,"97":0,"98":0,"99":0.00601,"100":0.13832,"101":0.14434,"102":0.00301,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00301,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00601,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00301,"108":0,"109":0.00601,"110":0.00601,"111":0,"112":0,"113":0.00301,"114":0.01804,"115":0.3879,"116":0.11427},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00301,"10":0,"11":0,"12":0,"13":0,"14":0.00601,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00601,"14.1":0.00902,"15.1":0,"15.2-15.3":0,"15.4":0.00301,"15.5":0.00301,"15.6":0.01804,"16.0":0.00301,"16.1":0.00601,"16.2":0.00601,"16.3":0.03909,"16.4":0.01203,"16.5":0.04511,"16.6":0.05713},G:{"8":0,"17":0.17837,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02123,"8.1-8.4":0.00637,"9.0-9.2":0,"9.3":0.05946,"10.0-10.2":0,"10.3":0.02548,"11.0-11.2":0.02548,"11.3-11.4":0.00425,"12.0-12.1":0.00849,"12.2-12.5":0.27181,"13.0-13.1":0,"13.2":0,"13.3":0.00637,"13.4-13.7":0.02336,"14.0-14.4":0.13378,"14.5-14.8":0.35675,"15.0-15.1":0.06795,"15.2-15.3":0.09131,"15.4":0.11255,"15.5":0.19536,"15.6-15.7":1.39726,"16.0":0.79631,"16.1":1.22525,"16.2":0.57122,"16.3":1.25286,"16.4":0.25482,"16.5":5.39367,"16.6":8.72968},P:{"4":0.17208,"20":0.06074,"21":0.21257,"5.0-5.4":0.01012,"6.2-6.4":0.02025,"7.2-7.4":0.01012,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01012,"12.0":0,"13.0":0.01012,"14.0":0.02025,"15.0":0.01012,"16.0":0.03037,"17.0":0.02025,"18.0":0.02025,"19.0":0.04049},I:{"0":0,"3":0,"4":0.00087,"2.1":0,"2.2":0.00035,"2.3":0.00035,"4.1":0.11186,"4.2-4.3":0.00121,"4.4":0,"4.4.3-4.4.4":0.00642},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00902,"9":0.00301,"10":0.00301,"11":0.01804,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.0374},R:{_:"0"},M:{"0":0.13986},Q:{"13.1":0},O:{"0":0.01399},H:{"0":0.21186}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00366,"52":0.04391,"53":0,"54":0,"55":0,"56":0.00732,"57":0,"58":0,"59":0,"60":0,"61":0.00366,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.02927,"68":0.00366,"69":0,"70":0,"71":0,"72":0.00366,"73":0,"74":0,"75":0.01098,"76":0,"77":0,"78":0.00366,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.03293,"91":0,"92":0,"93":0,"94":0.00732,"95":0.00366,"96":0,"97":0,"98":0,"99":0.00366,"100":0,"101":0,"102":0.01098,"103":0.00366,"104":0.00732,"105":0.00732,"106":0,"107":0,"108":0,"109":0.01464,"110":0.00366,"111":0.01464,"112":0.00366,"113":0.00732,"114":0.00366,"115":0.18295,"116":0.02927,"117":0.56715,"118":0.04757,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00366,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00366,"39":0,"40":0,"41":0.00366,"42":0,"43":0.00366,"44":0.00366,"45":0.00366,"46":0.00366,"47":0.00732,"48":0,"49":0.04391,"50":0,"51":0.00366,"52":0,"53":0.00732,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00366,"65":0,"66":0.00366,"67":0,"68":0,"69":0.00732,"70":0.00366,"71":0.00366,"72":0,"73":0.01098,"74":0,"75":0.00366,"76":0.04391,"77":0.04391,"78":0,"79":0.06586,"80":0.00732,"81":0.02195,"83":0.00732,"84":0.02195,"85":0.05489,"86":0.00732,"87":0.04391,"88":0.00366,"89":0.00732,"90":0.0183,"91":0.01098,"92":0.00366,"93":0.05123,"94":0,"95":0.01464,"96":0.00366,"97":0,"98":0,"99":0.02195,"100":0.00366,"101":0,"102":0.0183,"103":0.01098,"104":0.00366,"105":0.00732,"106":0.02561,"107":0.06952,"108":0.03293,"109":1.42335,"110":0.02195,"111":0.03659,"112":0.05854,"113":0.02195,"114":0.0805,"115":0.12075,"116":6.07394,"117":1.57337,"118":0.02927,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01098,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00366,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00732,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0.00366,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.01098,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00366,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00366,"95":0.05854,"96":0,"97":0,"98":0,"99":0.00366,"100":0.03293,"101":0.19759,"102":0.17929,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00366,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00366,"93":0.05123,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00366,"104":0,"105":0.00366,"106":0.00732,"107":0.00732,"108":0.00732,"109":0.00732,"110":0.00366,"111":0,"112":0.00366,"113":0,"114":0.00732,"115":0.0183,"116":0.35126,"117":0.31833},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00366,"10":0,"11":0,"12":0,"13":0,"14":0.00732,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00732,"14.1":0.00732,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00732,"15.6":0.02561,"16.0":0.00366,"16.1":0.01098,"16.2":0.00366,"16.3":0.01098,"16.4":0.00366,"16.5":0.02195,"16.6":0.09879,"17.0":0.00732,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02958,"8.1-8.4":0.01294,"9.0-9.2":0,"9.3":0.04437,"10.0-10.2":0,"10.3":0.02404,"11.0-11.2":0.03698,"11.3-11.4":0.0037,"12.0-12.1":0.01109,"12.2-12.5":0.23851,"13.0-13.1":0,"13.2":0,"13.3":1.51427,"13.4-13.7":0.02958,"14.0-14.4":0.12758,"14.5-14.8":0.29768,"15.0-15.1":0.05177,"15.2-15.3":0.04992,"15.4":0.13497,"15.5":0.14791,"15.6-15.7":1.27576,"16.0":0.58056,"16.1":0.94665,"16.2":0.39012,"16.3":0.81538,"16.4":0.16271,"16.5":0.56392,"16.6":9.66987,"17.0":1.07607,"17.1":0.00185},P:{"4":0.2128,"20":0.05067,"21":0.11146,"22":2.53329,"5.0-5.4":0.01013,"6.2-6.4":0,"7.2-7.4":0.01013,"8.2":0,"9.2":0.01013,"10.1":0,"11.1-11.2":0.01013,"12.0":0,"13.0":0.0304,"14.0":0.01013,"15.0":0.01013,"16.0":0.02027,"17.0":0.02027,"18.0":0.01013,"19.0":0.04053},I:{"0":0,"3":0,"4":0.00312,"2.1":0,"2.2":0.00156,"2.3":0.00234,"4.1":0.10615,"4.2-4.3":0.00546,"4.4":0,"4.4.3-4.4.4":0.02966},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01464,"9":0.00366,"10":0.00366,"11":0.05123,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00634},N:{"10":0.01268,"11":0},L:{"0":63.72068},R:{_:"0"},M:{"0":0.13316},Q:{"13.1":0},O:{"0":0.01902},H:{"0":0.24013}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ML.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ML.js
index 2e5f4ccc83194c..a763ebf9e7c81f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ML.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ML.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.0021,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.07364,"96":0,"97":0,"98":0,"99":0.00631,"100":0,"101":0,"102":0.01683,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00421,"115":0.10099,"116":0.22092,"117":0.00421,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0021,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.01052,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0021,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00631,"66":0,"67":0,"68":0,"69":0.00421,"70":0,"71":0,"72":0.00631,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00421,"80":0.01052,"81":0.00631,"83":0.00842,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00631,"93":0.0021,"94":0,"95":0.0021,"96":0,"97":0,"98":0.0021,"99":0.00631,"100":0,"101":0,"102":0,"103":0.00421,"104":0,"105":0,"106":0.0021,"107":0.00421,"108":0.0021,"109":0.12834,"110":0,"111":0,"112":0.0021,"113":0.00421,"114":0.03366,"115":0.81846,"116":0.53442,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00842,"55":0,"56":0,"57":0,"58":0,"60":0.0021,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00421,"70":0.0021,"71":0.01473,"72":0.00631,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03787,"96":0,"97":0,"98":0,"99":0,"100":0.00842,"101":0.03156,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00421,"16":0,"17":0,"18":0.0021,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00421,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00631,"110":0,"111":0,"112":0.0021,"113":0.0021,"114":0.00842,"115":0.4713,"116":0.30298},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.0021,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01473,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.01262,"16.0":0,"16.1":0,"16.2":0,"16.3":0.01473,"16.4":0.0021,"16.5":0.01052,"16.6":0.00631},G:{"8":0.0015,"17":0.43855,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00449,"6.0-6.1":0,"7.0-7.1":0.00748,"8.1-8.4":0.00299,"9.0-9.2":0,"9.3":0.0449,"10.0-10.2":0.02245,"10.3":0.07933,"11.0-11.2":0.00748,"11.3-11.4":0,"12.0-12.1":0.17063,"12.2-12.5":2.29753,"13.0-13.1":0.03892,"13.2":0,"13.3":0.02395,"13.4-13.7":0.08831,"14.0-14.4":0.52686,"14.5-14.8":0.54931,"15.0-15.1":0.58673,"15.2-15.3":0.11824,"15.4":0.16764,"15.5":0.11375,"15.6-15.7":1.68535,"16.0":0.2754,"16.1":0.5089,"16.2":0.33527,"16.3":1.02079,"16.4":0.50441,"16.5":2.19724,"16.6":3.13871},P:{"4":0.20238,"20":0.12143,"21":0.35416,"5.0-5.4":0.01012,"6.2-6.4":0.01012,"7.2-7.4":0.17202,"8.2":0,"9.2":0.06071,"10.1":0,"11.1-11.2":0.01012,"12.0":0.02024,"13.0":0.03036,"14.0":0.05059,"15.0":0.03036,"16.0":0.06071,"17.0":0.07083,"18.0":0.06071,"19.0":0.13154},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00082,"4.2-4.3":0.00735,"4.4":0,"4.4.3-4.4.4":0.03919},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00421,"5.5":0},S:{"2.5":0.12634,_:"3.0-3.1"},J:{"7":0,"10":0.0079},N:{"10":0,"11":0},L:{"0":76.18241},R:{_:"0"},M:{"0":0.37901},Q:{"13.1":0.03948},O:{"0":0.71854},H:{"0":0.93443}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00187,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.0056,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.05595,"96":0,"97":0,"98":0,"99":0.00187,"100":0,"101":0,"102":0.00746,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00187,"115":0.05036,"116":0.02425,"117":0.17904,"118":0.01492,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.01119,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00373,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00187,"71":0,"72":0.00187,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00373,"80":0.00373,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00373,"93":0,"94":0,"95":0.00187,"96":0,"97":0,"98":0.00187,"99":0.00373,"100":0,"101":0,"102":0,"103":0.00187,"104":0,"105":0,"106":0.00187,"107":0.0056,"108":0.00187,"109":0.08952,"110":0,"111":0,"112":0.00187,"113":0.00187,"114":0.00746,"115":0.00933,"116":0.84112,"117":0.22567,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00187,"33":0,"34":0,"35":0,"36":0,"37":0.00187,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00187,"55":0,"56":0,"57":0,"58":0,"60":0.00187,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00187,"68":0,"69":0.00187,"70":0.00187,"71":0.00746,"72":0.00933,"73":0.00187,"74":0,"75":0,"76":0,"77":0.00746,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01679,"96":0,"97":0,"98":0,"99":0,"100":0.00187,"101":0.01865,"102":0.02798,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.00187,"17":0,"18":0.00187,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00187,"91":0,"92":0.00373,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00187,"106":0,"107":0,"108":0,"109":0.01679,"110":0,"111":0,"112":0.00373,"113":0,"114":0.00187,"115":0.01679,"116":0.2294,"117":0.17904},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00187,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00187,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02052,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00373,"16.0":0,"16.1":0,"16.2":0,"16.3":0.00187,"16.4":0,"16.5":0.00373,"16.6":0.0056,"17.0":0,"17.1":0},G:{"8":0.00174,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00697,"5.0-5.1":0,"6.0-6.1":0.01045,"7.0-7.1":0.05923,"8.1-8.4":0,"9.0-9.2":0.00697,"9.3":0.07665,"10.0-10.2":0.00871,"10.3":0.01394,"11.0-11.2":0.00174,"11.3-11.4":0.00348,"12.0-12.1":0.23519,"12.2-12.5":1.94074,"13.0-13.1":0.03484,"13.2":0.00871,"13.3":0.11672,"13.4-13.7":0.14286,"14.0-14.4":0.80661,"14.5-14.8":0.58362,"15.0-15.1":1.60974,"15.2-15.3":0.10801,"15.4":0.19686,"15.5":0.25435,"15.6-15.7":1.8066,"16.0":0.26655,"16.1":0.36933,"16.2":0.38675,"16.3":0.97211,"16.4":0.40069,"16.5":1.38848,"16.6":4.08531,"17.0":1.4181,"17.1":0},P:{"4":0.19081,"20":0.05021,"21":0.34145,"22":0.92393,"5.0-5.4":0.01004,"6.2-6.4":0,"7.2-7.4":0.17073,"8.2":0,"9.2":0.03013,"10.1":0,"11.1-11.2":0.03013,"12.0":0.01004,"13.0":0.01004,"14.0":0.05021,"15.0":0.02009,"16.0":0.05021,"17.0":0.04017,"18.0":0.03013,"19.0":0.31133},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00034,"4.2-4.3":0.00189,"4.4":0,"4.4.3-4.4.4":0.03642},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00187,"5.5":0},S:{"2.5":0.11389,_:"3.0-3.1"},J:{"7":0,"10":0.00814},N:{"10":0,"11":0},L:{"0":75.87459},R:{_:"0"},M:{"0":0.3254},Q:{"13.1":0.00814},O:{"0":0.51251},H:{"0":0.53912}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MM.js
index af07311e7b6d82..880df73850fac7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00294,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00294,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00294,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00294,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00294,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02352,"103":0,"104":0.00294,"105":0.00294,"106":0.00294,"107":0.00588,"108":0.00294,"109":0.00294,"110":0.00294,"111":0.00588,"112":0.00294,"113":0.00588,"114":0.0147,"115":0.2058,"116":0.51744,"117":0.03822,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00294,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00294,"38":0.00294,"39":0,"40":0,"41":0.00294,"42":0,"43":0,"44":0.00294,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00294,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00294,"68":0,"69":0,"70":0.00294,"71":0.00294,"72":0,"73":0,"74":0.00294,"75":0,"76":0,"77":0,"78":0.00294,"79":0.00588,"80":0.00294,"81":0.00882,"83":0,"84":0.00294,"85":0.00294,"86":0,"87":0.00588,"88":0.00294,"89":0.00882,"90":0.00294,"91":0.00294,"92":0.00294,"93":0,"94":0,"95":0.00294,"96":0.00294,"97":0,"98":0.00294,"99":0.0294,"100":0.00588,"101":0.00294,"102":0.00588,"103":0.00882,"104":0.00294,"105":0.00588,"106":0.00588,"107":0.00588,"108":0.00882,"109":0.26166,"110":0.00588,"111":0.00882,"112":0.01764,"113":0.02352,"114":0.12054,"115":2.5725,"116":1.67874,"117":0.00294,"118":0.00294,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00588,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00882,"71":0.00882,"72":0.00882,"73":0,"74":0,"75":0,"76":0,"77":0.00294,"78":0,"79":0.00294,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00294,"96":0,"97":0,"98":0,"99":0.00294,"100":0.06762,"101":0.07644,"102":0.00882,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00294,"13":0,"14":0,"15":0,"16":0.00294,"17":0,"18":0.01176,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00882,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00294,"109":0.00588,"110":0,"111":0,"112":0.00294,"113":0.00294,"114":0.02352,"115":0.6027,"116":0.20874},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00294,"10":0,"11":0,"12":0,"13":0,"14":0.00588,"15":0.00294,"17":0.00294,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00882,"14.1":0.01764,"15.1":0.0441,"15.2-15.3":0.00294,"15.4":0.00294,"15.5":0.00882,"15.6":0.0441,"16.0":0.00588,"16.1":0.02058,"16.2":0.0147,"16.3":0.04704,"16.4":0.01176,"16.5":0.11466,"16.6":0.15876},G:{"8":0,"17":0.09372,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00375,"5.0-5.1":0.00562,"6.0-6.1":0.00187,"7.0-7.1":0.01125,"8.1-8.4":0.01499,"9.0-9.2":0.00187,"9.3":0.03842,"10.0-10.2":0.00375,"10.3":0.08341,"11.0-11.2":0.01874,"11.3-11.4":0.00656,"12.0-12.1":0.00469,"12.2-12.5":0.27833,"13.0-13.1":0.00187,"13.2":0.00469,"13.3":0.00937,"13.4-13.7":0.04592,"14.0-14.4":0.09465,"14.5-14.8":0.16119,"15.0-15.1":0.06935,"15.2-15.3":0.06373,"15.4":0.10965,"15.5":0.14901,"15.6-15.7":0.98307,"16.0":0.29333,"16.1":0.50419,"16.2":0.28021,"16.3":0.60446,"16.4":0.14901,"16.5":1.71592,"16.6":3.56117},P:{"4":0.14477,"20":0.06204,"21":0.14477,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03102,"8.2":0,"9.2":0.02068,"10.1":0,"11.1-11.2":0.01034,"12.0":0.02068,"13.0":0.03102,"14.0":0.01034,"15.0":0.01034,"16.0":0.02068,"17.0":0.02068,"18.0":0.23784,"19.0":0.03102},I:{"0":0,"3":0,"4":0.00258,"2.1":0,"2.2":0,"2.3":0.01292,"4.1":0.00517,"4.2-4.3":0.01034,"4.4":0,"4.4.3-4.4.4":0.33075},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00784,"9":0,"10":0.00392,"11":0.01176,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":76.03964},R:{_:"0"},M:{"0":0.13414},Q:{"13.1":0.06354},O:{"0":2.13212},H:{"0":0.46788}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00283,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00567,"103":0.00283,"104":0,"105":0.00283,"106":0,"107":0.00283,"108":0.00283,"109":0,"110":0.00283,"111":0.00283,"112":0.00283,"113":0.00283,"114":0.0085,"115":0.09919,"116":0.03968,"117":0.56113,"118":0.10202,"119":0.00283,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00283,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00283,"38":0.00283,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00283,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00283,"71":0.01417,"72":0,"73":0,"74":0.00283,"75":0,"76":0,"77":0,"78":0,"79":0.00567,"80":0.00283,"81":0.00283,"83":0,"84":0,"85":0.0085,"86":0.00283,"87":0.00567,"88":0.00283,"89":0.00567,"90":0.00283,"91":0.00283,"92":0.00567,"93":0,"94":0.00283,"95":0.00283,"96":0.00283,"97":0,"98":0,"99":0.017,"100":0.00567,"101":0,"102":0.00283,"103":0.00567,"104":0.00283,"105":0.00283,"106":0.00567,"107":0.00567,"108":0.00567,"109":0.24089,"110":0.00283,"111":0.00567,"112":0.01134,"113":0.01134,"114":0.04534,"115":0.05668,"116":2.88785,"117":0.90971,"118":0.00567,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00567,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00283,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00283,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00283,"70":0.00283,"71":0,"72":0.01417,"73":0.00283,"74":0,"75":0,"76":0,"77":0.00567,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00283,"96":0,"97":0,"98":0,"99":0,"100":0.01984,"101":0.05101,"102":0.06235,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00283,"13":0,"14":0.00283,"15":0,"16":0,"17":0,"18":0.0085,"79":0,"80":0,"81":0,"83":0,"84":0.01134,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0085,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00567,"110":0,"111":0,"112":0.00567,"113":0,"114":0.00567,"115":0.02551,"116":0.38826,"117":0.2834},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00283,"10":0,"11":0,"12":0,"13":0,"14":0.00567,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00283,"10.1":0,"11.1":0,"12.1":0.00283,"13.1":0.00567,"14.1":0.06235,"15.1":0.00567,"15.2-15.3":0.02551,"15.4":0.00283,"15.5":0.00567,"15.6":0.03684,"16.0":0.00567,"16.1":0.01984,"16.2":0.0085,"16.3":0.03684,"16.4":0.0085,"16.5":0.03401,"16.6":0.19555,"17.0":0.04251,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00378,"5.0-5.1":0.00756,"6.0-6.1":0.00095,"7.0-7.1":0.00378,"8.1-8.4":0.01512,"9.0-9.2":0.00189,"9.3":0.02836,"10.0-10.2":0.00284,"10.3":0.06144,"11.0-11.2":0.03876,"11.3-11.4":0.00473,"12.0-12.1":0.00756,"12.2-12.5":0.24955,"13.0-13.1":0.00189,"13.2":0.00189,"13.3":0.00473,"13.4-13.7":0.03119,"14.0-14.4":0.08507,"14.5-14.8":0.1503,"15.0-15.1":0.04915,"15.2-15.3":0.0794,"15.4":0.08602,"15.5":0.17866,"15.6-15.7":0.98875,"16.0":0.21363,"16.1":0.50666,"16.2":0.26089,"16.3":0.56244,"16.4":0.10303,"16.5":0.40836,"16.6":4.50704,"17.0":0.71651,"17.1":0},P:{"4":0.14521,"20":0.05186,"21":0.09335,"22":1.04756,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.04149,"8.2":0,"9.2":0.01037,"10.1":0.01037,"11.1-11.2":0.02074,"12.0":0,"13.0":0.02074,"14.0":0.01037,"15.0":0,"16.0":0.02074,"17.0":0.03112,"18.0":0.03112,"19.0":0.04149},I:{"0":0,"3":0,"4":0.00451,"2.1":0,"2.2":0,"2.3":0.00226,"4.1":0.00451,"4.2-4.3":0.01804,"4.4":0,"4.4.3-4.4.4":0.34052},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00756,"9":0.00378,"10":0,"11":0.01134,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":77.35961},R:{_:"0"},M:{"0":0.15765},Q:{"13.1":0.06449},O:{"0":1.92049},H:{"0":0.4342}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MN.js
index dbf4a860240430..1401254bbd6ddd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00412,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00412,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00412,"100":0,"101":0,"102":0.00412,"103":0.00412,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00412,"114":0.01648,"115":0.173,"116":0.40366,"117":0.0206,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00412},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00412,"39":0.00412,"40":0,"41":0.00412,"42":0.00412,"43":0.00412,"44":0.00824,"45":0.00412,"46":0.00824,"47":0.00412,"48":0,"49":0.00412,"50":0,"51":0.00412,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00412,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00824,"71":0.00412,"72":0,"73":0,"74":0.00824,"75":0,"76":0,"77":0,"78":0,"79":0.01648,"80":0,"81":0,"83":0.00824,"84":0,"85":0.01236,"86":0.00412,"87":0.00824,"88":0.00824,"89":0.00412,"90":0,"91":0.00412,"92":0.00412,"93":0,"94":0.00412,"95":0.00412,"96":0.00824,"97":0.00412,"98":0.00412,"99":0.0206,"100":0.00412,"101":0.00412,"102":0.01648,"103":0.04119,"104":0.00412,"105":0.00824,"106":0.00824,"107":0.01236,"108":0.00824,"109":1.54463,"110":0.01236,"111":0.02883,"112":0.11121,"113":0.07414,"114":0.37071,"115":5.87369,"116":3.45584,"117":0.00824,"118":0.00412,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00412,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00412,"72":0.00412,"73":0,"74":0,"75":0,"76":0.01648,"77":0.01236,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0206,"96":0,"97":0,"98":0,"99":0.00824,"100":0.346,"101":0.27185,"102":0.01236,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00412,"13":0,"14":0.00412,"15":0,"16":0,"17":0,"18":0.00412,"79":0,"80":0,"81":0,"83":0,"84":0.00412,"85":0,"86":0,"87":0,"88":0,"89":0.00412,"90":0,"91":0,"92":0.00824,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00412,"101":0.00412,"102":0,"103":0,"104":0,"105":0,"106":0.00412,"107":0,"108":0,"109":0.03707,"110":0.00412,"111":0.00824,"112":0.00412,"113":0.0206,"114":0.04943,"115":1.20687,"116":0.42014},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00412,"9":0.01236,"10":0,"11":0.01236,"12":0,"13":0.00412,"14":0.02471,"15":0,"17":0.00412,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00412,"13.1":0.00824,"14.1":0.04943,"15.1":0.01236,"15.2-15.3":0.00824,"15.4":0.00824,"15.5":0.02883,"15.6":0.08238,"16.0":0.01648,"16.1":0.03707,"16.2":0.02883,"16.3":0.07414,"16.4":0.02471,"16.5":0.173,"16.6":0.12769},G:{"8":0.00585,"17":0.28057,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00292,"7.0-7.1":0.02923,"8.1-8.4":0.03215,"9.0-9.2":0,"9.3":0.11398,"10.0-10.2":0,"10.3":0.02046,"11.0-11.2":0.05845,"11.3-11.4":0.01169,"12.0-12.1":0.02338,"12.2-12.5":0.33902,"13.0-13.1":0.00585,"13.2":0.00292,"13.3":0.02046,"13.4-13.7":0.07891,"14.0-14.4":0.23088,"14.5-14.8":0.44715,"15.0-15.1":0.19289,"15.2-15.3":0.25718,"15.4":0.1812,"15.5":0.37701,"15.6-15.7":2.22114,"16.0":1.81783,"16.1":1.96396,"16.2":1.09596,"16.3":2.12762,"16.4":0.58743,"16.5":6.32149,"16.6":10.36338},P:{"4":0.14232,"20":0.17282,"21":0.46762,"5.0-5.4":0.04066,"6.2-6.4":0.01017,"7.2-7.4":0.06099,"8.2":0,"9.2":0.02033,"10.1":0,"11.1-11.2":0.05083,"12.0":0.01017,"13.0":0.05083,"14.0":0.0305,"15.0":0.02033,"16.0":0.04066,"17.0":0.07116,"18.0":0.04066,"19.0":0.12199},I:{"0":0,"3":0.00725,"4":0.02899,"2.1":0.00483,"2.2":0.01449,"2.3":0.01691,"4.1":0.02657,"4.2-4.3":0.04831,"4.4":0,"4.4.3-4.4.4":0.14736},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00442,"8":0.03982,"9":0.00885,"10":0.00885,"11":0.05309,"5.5":0},S:{"2.5":0.00588,_:"3.0-3.1"},J:{"7":0,"10":0.01176},N:{"10":0.0196,"11":0.0098},L:{"0":47.21259},R:{_:"0"},M:{"0":0.19995},Q:{"13.1":0.00588},O:{"0":0.15879},H:{"0":0.37861}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00446,"39":0,"40":0.00446,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00446,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00446,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00446,"113":0.00446,"114":0.00446,"115":0.10697,"116":0.04011,"117":0.46799,"118":0.04011,"119":0,"120":0,"3.5":0,"3.6":0.00446},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00446,"39":0.00446,"40":0.00446,"41":0.00446,"42":0.00446,"43":0.00446,"44":0.00891,"45":0.00446,"46":0.00446,"47":0.00446,"48":0,"49":0,"50":0,"51":0.00891,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00446,"62":0,"63":0.00446,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00891,"71":0,"72":0,"73":0,"74":0.00446,"75":0.00446,"76":0,"77":0.00446,"78":0,"79":0.01337,"80":0,"81":0.00446,"83":0.00446,"84":0,"85":0.00891,"86":0.00446,"87":0.00446,"88":0.00446,"89":0.00446,"90":0.00446,"91":0.00446,"92":0.00446,"93":0,"94":0,"95":0.00446,"96":0,"97":0.00446,"98":0.00446,"99":0.02229,"100":0.00446,"101":0.00446,"102":0.0936,"103":0.03566,"104":0.39222,"105":0.02674,"106":0.00891,"107":0.01337,"108":0.01337,"109":1.37721,"110":0.00891,"111":0.02229,"112":0.05794,"113":0.11143,"114":0.12034,"115":0.28079,"116":9.03434,"117":1.95662,"118":0.02229,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00446,"73":0.00446,"74":0,"75":0,"76":0,"77":0.01783,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00891,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02229,"96":0,"97":0,"98":0,"99":0.00891,"100":0.0624,"101":0.25851,"102":0.30753,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00446,"13":0,"14":0.00446,"15":0,"16":0.00446,"17":0,"18":0.00446,"79":0,"80":0,"81":0,"83":0,"84":0.00446,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01783,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00446,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00446,"108":0.00446,"109":0.0624,"110":0.00891,"111":0.00891,"112":0.01337,"113":0.01783,"114":0.04011,"115":0.04011,"116":1.29253,"117":1.01174},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01337,"10":0,"11":0,"12":0,"13":0,"14":0.01783,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01337,"14.1":0.03566,"15.1":0.00891,"15.2-15.3":0.05794,"15.4":0.01337,"15.5":0.03566,"15.6":0.05794,"16.0":0.01783,"16.1":0.03566,"16.2":0.02229,"16.3":0.0624,"16.4":0.02674,"16.5":0.14708,"16.6":0.28971,"17.0":0.02674,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00316,"6.0-6.1":0,"7.0-7.1":0.00632,"8.1-8.4":0.02211,"9.0-9.2":0,"9.3":0.09161,"10.0-10.2":0,"10.3":0.04107,"11.0-11.2":0.07898,"11.3-11.4":0.03159,"12.0-12.1":0.02843,"12.2-12.5":0.30011,"13.0-13.1":0.00948,"13.2":0.00632,"13.3":0.85927,"13.4-13.7":0.05055,"14.0-14.4":0.2622,"14.5-14.8":0.41384,"15.0-15.1":0.19586,"15.2-15.3":0.19586,"15.4":0.18639,"15.5":0.34434,"15.6-15.7":2.41039,"16.0":1.63009,"16.1":1.85754,"16.2":1.08989,"16.3":1.94916,"16.4":0.34118,"16.5":1.32366,"16.6":15.54904,"17.0":1.85439,"17.1":0},P:{"4":0.1316,"20":0.14172,"21":0.24296,"22":2.99647,"5.0-5.4":0.03037,"6.2-6.4":0.02025,"7.2-7.4":0.07086,"8.2":0,"9.2":0.02025,"10.1":0,"11.1-11.2":0.04049,"12.0":0,"13.0":0.04049,"14.0":0.02025,"15.0":0.02025,"16.0":0.07086,"17.0":0.07086,"18.0":0.04049,"19.0":0.11136},I:{"0":0,"3":0.00354,"4":0.02475,"2.1":0.00354,"2.2":0.01414,"2.3":0.02475,"4.1":0.01591,"4.2-4.3":0.04242,"4.4":0,"4.4.3-4.4.4":0.13434},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00539,"8":0.04847,"9":0.01077,"10":0.01077,"11":0.04847,"5.5":0},S:{"2.5":0.00554,_:"3.0-3.1"},J:{"7":0,"10":0.00554},N:{"10":0.01663,"11":0},L:{"0":42.81664},R:{_:"0"},M:{"0":0.18846},Q:{"13.1":0.01109},O:{"0":0.16075},H:{"0":0.17842}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MO.js
index 59ca0e8b3af40d..4a653327248b87 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.04689,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00521,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0.00521,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.02605,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00521,"101":0,"102":0.00521,"103":0,"104":0.02084,"105":0,"106":0,"107":0,"108":0.00521,"109":0,"110":0,"111":0.00521,"112":0.02084,"113":0.00521,"114":0.00521,"115":0.18756,"116":0.44806,"117":0.01042,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.01042,"23":0,"24":0,"25":0,"26":0.00521,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.07294,"35":0,"36":0,"37":0,"38":0.10941,"39":0,"40":0,"41":0,"42":0,"43":0.00521,"44":0.00521,"45":0,"46":0.00521,"47":0,"48":0,"49":0.04168,"50":0,"51":0,"52":0,"53":0.01042,"54":0,"55":0.03647,"56":0,"57":0,"58":0.01042,"59":0,"60":0.00521,"61":0.05731,"62":0.02605,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.01042,"70":0.01042,"71":0,"72":0,"73":0.00521,"74":0.02084,"75":0.00521,"76":0.00521,"77":0.01042,"78":0.03126,"79":0.31781,"80":0.03647,"81":0.01042,"83":0.03647,"84":0,"85":0.00521,"86":0.03647,"87":0.14588,"88":0,"89":0.03647,"90":0,"91":0.01042,"92":0.01042,"93":0.00521,"94":0.01563,"95":0.01042,"96":0.00521,"97":0.07815,"98":0.04689,"99":0.24487,"100":0.01042,"101":0.02084,"102":0.01563,"103":0.08857,"104":0.01042,"105":0.09899,"106":0.02605,"107":0.03126,"108":0.04689,"109":1.21914,"110":0.01563,"111":0.02605,"112":0.16672,"113":0.16151,"114":0.77108,"115":6.73132,"116":3.86582,"117":0.08336,"118":0.02605,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01563,"29":0,"30":0,"31":0,"32":0.00521,"33":0,"34":0,"35":0,"36":0.03126,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.06773,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00521,"71":0,"72":0.00521,"73":0,"74":0.01042,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02605,"96":0,"97":0,"98":0,"99":0.00521,"100":0.02605,"101":0.03126,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.01563,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00521,"106":0.00521,"107":0,"108":0.00521,"109":0.11462,"110":0,"111":0.03126,"112":0.01563,"113":0.03126,"114":0.05731,"115":1.43796,"116":0.55747},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00521,"10":0,"11":0,"12":0,"13":0.02605,"14":0.17714,"15":0.02605,"17":0.01042,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.03126,"13.1":0.14067,"14.1":0.46369,"15.1":0.05731,"15.2-15.3":0.05731,"15.4":0.08857,"15.5":0.14588,"15.6":0.521,"16.0":0.0521,"16.1":0.08336,"16.2":0.11462,"16.3":0.33865,"16.4":0.17714,"16.5":0.95343,"16.6":1.65678},G:{"8":0,"17":0.08439,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01151,"6.0-6.1":0.13042,"7.0-7.1":0.07288,"8.1-8.4":0.10357,"9.0-9.2":0.04219,"9.3":0.36056,"10.0-10.2":0.03069,"10.3":0.44495,"11.0-11.2":0.11891,"11.3-11.4":0.07288,"12.0-12.1":0.07672,"12.2-12.5":1.51896,"13.0-13.1":0.04219,"13.2":0.01534,"13.3":0.06137,"13.4-13.7":0.15343,"14.0-14.4":0.61372,"14.5-14.8":1.46526,"15.0-15.1":0.35673,"15.2-15.3":0.4296,"15.4":0.4718,"15.5":0.59838,"15.6-15.7":2.8001,"16.0":1.13155,"16.1":1.94089,"16.2":0.95894,"16.3":2.04446,"16.4":0.57536,"16.5":6.61284,"16.6":15.00548},P:{"4":0.98334,"20":0.0442,"21":0.22098,"5.0-5.4":0.09944,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.01105,"10.1":0,"11.1-11.2":0.01105,"12.0":0,"13.0":0.0221,"14.0":0,"15.0":0.01105,"16.0":0,"17.0":0.0442,"18.0":0.03315,"19.0":0.03315},I:{"0":0,"3":0.00221,"4":0.01988,"2.1":0.00663,"2.2":0.00884,"2.3":0.01546,"4.1":0.01546,"4.2-4.3":0.02871,"4.4":0,"4.4.3-4.4.4":0.09719},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.1042,"9":0.02605,"10":0.02605,"11":0.1563,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":29.77629},R:{_:"0"},M:{"0":0.16765},Q:{"13.1":0.15807},O:{"0":0.66581},H:{"0":0.11791}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.03266,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00467,"79":0,"80":0.00467,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.014,"95":0,"96":0,"97":0,"98":0,"99":0.00467,"100":0.00933,"101":0,"102":0.00933,"103":0,"104":0.00467,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00933,"113":0.00467,"114":0.00467,"115":0.11663,"116":0.02333,"117":0.32189,"118":0.03732,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.00467,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00467,"31":0,"32":0,"33":0,"34":0.03266,"35":0,"36":0,"37":0,"38":0.08864,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00467,"45":0.00467,"46":0,"47":0,"48":0,"49":0.03732,"50":0,"51":0,"52":0,"53":0.00933,"54":0,"55":0.014,"56":0,"57":0.00467,"58":0.00933,"59":0.00467,"60":0.00467,"61":0.06531,"62":0.014,"63":0,"64":0,"65":0.00467,"66":0,"67":0,"68":0,"69":0.014,"70":0.00933,"71":0,"72":0,"73":0.00467,"74":0.00933,"75":0.00467,"76":0.00467,"77":0.00467,"78":0.014,"79":0.21459,"80":0.02799,"81":0.014,"83":0.01866,"84":0,"85":0,"86":0.01866,"87":0.07931,"88":0.00467,"89":0.01866,"90":0,"91":0.00467,"92":0.014,"93":0,"94":0.00933,"95":0.00467,"96":0.00467,"97":0.03732,"98":0.02333,"99":0.22859,"100":0.00933,"101":0.00933,"102":0.01866,"103":0.07931,"104":0.00933,"105":0.04665,"106":0.014,"107":0.02799,"108":0.06065,"109":0.86769,"110":0.00933,"111":0.00933,"112":0.11663,"113":0.09797,"114":0.20993,"115":0.28923,"116":7.32405,"117":1.58144,"118":0.03732,"119":0.00467,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00467,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.014,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.04199,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00933,"75":0,"76":0,"77":0.04199,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.014,"96":0,"97":0,"98":0,"99":0,"100":0.00467,"101":0.01866,"102":0.02333,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00467,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00933,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00467,"109":0.06531,"110":0.00467,"111":0.014,"112":0.00467,"113":0.02333,"114":0.014,"115":0.05132,"116":1.1196,"117":0.69042},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00467,"10":0,"11":0,"12":0,"13":0.01866,"14":0.14928,"15":0.02333,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.02333,"13.1":0.07931,"14.1":0.31256,"15.1":0.03266,"15.2-15.3":0.04199,"15.4":0.05132,"15.5":0.1073,"15.6":0.34521,"16.0":0.03732,"16.1":0.07464,"16.2":0.06998,"16.3":0.1866,"16.4":0.08397,"16.5":0.15395,"16.6":1.76804,"17.0":0.04665,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00796,"6.0-6.1":0.05572,"7.0-7.1":0.06368,"8.1-8.4":0.0597,"9.0-9.2":0.02786,"9.3":0.25473,"10.0-10.2":0.02388,"10.3":0.32637,"11.0-11.2":0.09552,"11.3-11.4":0.0398,"12.0-12.1":0.05572,"12.2-12.5":1.06669,"13.0-13.1":0.0398,"13.2":0.01592,"13.3":0.04378,"13.4-13.7":0.12339,"14.0-14.4":0.74031,"14.5-14.8":1.26172,"15.0-15.1":0.47762,"15.2-15.3":0.37812,"15.4":0.34628,"15.5":0.67663,"15.6-15.7":2.38413,"16.0":0.93534,"16.1":1.80302,"16.2":0.99505,"16.3":1.61595,"16.4":0.39404,"16.5":1.206,"16.6":23.02137,"17.0":0.98709,"17.1":0},P:{"4":0.67301,"20":0.13026,"21":0.14111,"22":2.87656,"5.0-5.4":0.05427,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.01085,"10.1":0,"11.1-11.2":0,"12.0":0.01085,"13.0":0.01085,"14.0":0,"15.0":0,"16.0":0.01085,"17.0":0.01085,"18.0":0.01085,"19.0":0.07598},I:{"0":0,"3":0,"4":0.02433,"2.1":0.00187,"2.2":0.00561,"2.3":0.00936,"4.1":0.01123,"4.2-4.3":0.02433,"4.4":0,"4.4.3-4.4.4":0.0786},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.10263,"9":0.03421,"10":0,"11":0.06842,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00534},N:{"10":0,"11":0},L:{"0":33.73391},R:{_:"0"},M:{"0":0.3041},Q:{"13.1":0.1974},O:{"0":0.63487},H:{"0":0.16163}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MP.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MP.js
index 6e59c8c4a6d302..f267033ba19d4d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MP.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MP.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01585,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00528,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.41736,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00528,"115":0.13208,"116":0.31698,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01585,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.02113,"77":0,"78":0,"79":0.01585,"80":0,"81":0,"83":0.01057,"84":0,"85":0,"86":0,"87":0.00528,"88":0,"89":0,"90":0.01585,"91":0.01585,"92":0.01585,"93":0.01585,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.64453,"104":0.01585,"105":0.02113,"106":0.14792,"107":0.00528,"108":0,"109":0.36981,"110":0.02642,"111":0.58113,"112":0.02642,"113":0.12151,"114":1.18868,"115":9.74714,"116":5.90111,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00528,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00528,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00528,"99":0.01585,"100":0.42792,"101":0.32226,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01585,"93":0,"94":0,"95":0,"96":0.00528,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00528,"109":0.04226,"110":0.00528,"111":0,"112":0,"113":0,"114":0.24302,"115":3.25433,"116":0.67094},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.04755,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00528,"13.1":0.01057,"14.1":0.63924,"15.1":0.01057,"15.2-15.3":0.02113,"15.4":0.01057,"15.5":0.01057,"15.6":0.07925,"16.0":0,"16.1":0.05283,"16.2":0.0317,"16.3":0.10038,"16.4":0.05283,"16.5":0.28528,"16.6":0.40679},G:{"8":0,"17":0.02817,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01491,"10.0-10.2":0,"10.3":0.02485,"11.0-11.2":0.08118,"11.3-11.4":0.01325,"12.0-12.1":0,"12.2-12.5":0.15574,"13.0-13.1":0,"13.2":0,"13.3":0.04308,"13.4-13.7":0.01325,"14.0-14.4":1.14487,"14.5-14.8":0.16071,"15.0-15.1":0.34297,"15.2-15.3":0.00331,"15.4":0.03479,"15.5":0.05302,"15.6-15.7":0.45563,"16.0":0.51031,"16.1":0.61634,"16.2":0.25018,"16.3":1.07363,"16.4":1.49447,"16.5":4.00954,"16.6":6.04579},P:{"4":0,"20":0.03086,"21":0.33951,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03086,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03086,"12.0":0,"13.0":0.01029,"14.0":0.01029,"15.0":0,"16.0":0,"17.0":0.13375,"18.0":0.03086,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01057,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":34.02212},R:{_:"0"},M:{"0":0.85849},Q:{"13.1":0},O:{"0":0.03302},H:{"0":0.08485}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01099,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.01649,"88":0.0055,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.0055,"98":0,"99":0,"100":0,"101":0,"102":0.01099,"103":0.21988,"104":0,"105":0,"106":0.01099,"107":0,"108":0,"109":0,"110":0.0055,"111":0,"112":0,"113":0,"114":0,"115":0.12093,"116":0.02749,"117":0.40678,"118":0.02199,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02199,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.0055,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.0055,"80":0,"81":0,"83":0.0055,"84":0,"85":0.0055,"86":0,"87":0.01099,"88":0,"89":0,"90":0,"91":0.01099,"92":0.0055,"93":0.0055,"94":0.01649,"95":0,"96":0.0055,"97":0,"98":0,"99":0,"100":0.0055,"101":0.0055,"102":0,"103":0.06596,"104":0,"105":0.01099,"106":0.15941,"107":0.0055,"108":0.0055,"109":0.44526,"110":0.07146,"111":0.03298,"112":0.01099,"113":0.03848,"114":0.20889,"115":0.71461,"116":15.60598,"117":2.31424,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0055,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.01649,"99":0.0055,"100":0.1759,"101":0.19789,"102":0.17041,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0055,"100":0,"101":0,"102":0.0055,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.03298,"110":0.0055,"111":0.0055,"112":0.0055,"113":0.01099,"114":0.04947,"115":0.32432,"116":2.9299,"117":1.60512},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0055,"14":0.12643,"15":0.0055,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.0055,"13.1":0.03298,"14.1":0.51122,"15.1":0.01099,"15.2-15.3":0.02199,"15.4":0.03298,"15.5":0.0055,"15.6":0.23637,"16.0":0.0055,"16.1":0.09345,"16.2":0.03848,"16.3":0.06047,"16.4":0.01649,"16.5":0.06047,"16.6":0.81356,"17.0":0.01099,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.04648,"11.0-11.2":0.15958,"11.3-11.4":0.0093,"12.0-12.1":0,"12.2-12.5":0.23859,"13.0-13.1":0,"13.2":0,"13.3":0.02324,"13.4-13.7":0.05268,"14.0-14.4":1.49354,"14.5-14.8":0.11,"15.0-15.1":0.52212,"15.2-15.3":0.01704,"15.4":0.02634,"15.5":0.05578,"15.6-15.7":0.3424,"16.0":0.36564,"16.1":0.71114,"16.2":0.2293,"16.3":0.82888,"16.4":0.06662,"16.5":0.66156,"16.6":9.14096,"17.0":0.3331,"17.1":0.0031},P:{"4":0.01025,"20":0.01025,"21":0.04101,"22":7.88482,"5.0-5.4":0.05127,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01025,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0.05127,"19.0":0.01025},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":40.06947},R:{_:"0"},M:{"0":0.70247},Q:{"13.1":0},O:{"0":0.02702},H:{"0":0.03837}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MQ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MQ.js
index d8d97f59a68da0..7f73ec2e810b06 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MQ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MQ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00902,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00451,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00451,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00451,"90":0,"91":0.01804,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03156,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00451,"109":0,"110":0,"111":0,"112":0.00451,"113":0,"114":0.03156,"115":0.42836,"116":1.5015,"117":0.02705,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00902,"80":0,"81":0.00451,"83":0,"84":0,"85":0.00451,"86":0,"87":0.00451,"88":0.0496,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00451,"99":0.00451,"100":0.00451,"101":0,"102":0,"103":0.02255,"104":0.00451,"105":0,"106":0,"107":0.00451,"108":0,"109":0.51854,"110":0,"111":0.00902,"112":0.03156,"113":0.04058,"114":0.36072,"115":6.48845,"116":4.3061,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00451,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00902,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.01353,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.15331,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00451,"96":0,"97":0,"98":0.01353,"99":0.01353,"100":0.23898,"101":0.20741,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00451,"18":0.00451,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00451,"90":0,"91":0,"92":0.00451,"93":0,"94":0,"95":0,"96":0,"97":0.00451,"98":0,"99":0,"100":0,"101":0,"102":0.00902,"103":0,"104":0.01353,"105":0,"106":0,"107":0,"108":0.00902,"109":0.05862,"110":0,"111":0.00451,"112":0.00451,"113":0.00451,"114":0.10822,"115":1.81713,"116":0.66733},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.02255,"15":0,"17":0.00902,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00451,"13.1":0.08116,"14.1":0.08567,"15.1":0.00451,"15.2-15.3":0.01353,"15.4":0.07214,"15.5":0.02705,"15.6":0.23447,"16.0":0.00902,"16.1":0.04509,"16.2":0.0496,"16.3":0.13076,"16.4":0.04509,"16.5":0.5997,"16.6":0.67184},G:{"8":0,"17":1.32023,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.55299,"10.0-10.2":0,"10.3":0.13318,"11.0-11.2":0.0029,"11.3-11.4":0.00579,"12.0-12.1":0.01737,"12.2-12.5":0.13029,"13.0-13.1":0,"13.2":0,"13.3":0.01448,"13.4-13.7":0.02895,"14.0-14.4":0.06949,"14.5-14.8":0.37928,"15.0-15.1":0.0608,"15.2-15.3":0.2403,"15.4":0.30979,"15.5":0.38796,"15.6-15.7":2.01509,"16.0":1.12625,"16.1":2.71284,"16.2":1.07413,"16.3":1.85295,"16.4":0.67749,"16.5":5.56755,"16.6":10.25494},P:{"4":0.01031,"20":0.36098,"21":0.47443,"5.0-5.4":0,"6.2-6.4":0.01031,"7.2-7.4":0.05157,"8.2":0.01031,"9.2":0.01031,"10.1":0,"11.1-11.2":0.02063,"12.0":0.01031,"13.0":0.01031,"14.0":0.02063,"15.0":0.01031,"16.0":0.03094,"17.0":0.01031,"18.0":0.04125,"19.0":0.08251},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.08862},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00451,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":42.77942},R:{_:"0"},M:{"0":0.88954},Q:{"13.1":0},O:{"0":0.01647},H:{"0":0.56144}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00488,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0195,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00488,"79":0,"80":0,"81":0,"82":0.04388,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00488,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00488,"102":0.04388,"103":0,"104":0,"105":0,"106":0,"107":0.00488,"108":0,"109":0,"110":0,"111":0,"112":0.00488,"113":0,"114":0.00975,"115":0.16575,"116":0.05363,"117":1.24313,"118":0.10725,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00488,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00488,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00975,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00975,"80":0,"81":0.00488,"83":0,"84":0,"85":0,"86":0,"87":0.00488,"88":0.01463,"89":0.00488,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.07313,"96":0,"97":0,"98":0.00975,"99":0.00488,"100":0.00488,"101":0,"102":0.00488,"103":0.03413,"104":0.00488,"105":0.00975,"106":0,"107":0.00488,"108":0.00488,"109":0.59963,"110":0.00975,"111":0.00488,"112":0.03413,"113":0.03413,"114":0.10238,"115":0.39975,"116":10.14,"117":2.145,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00488,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.05363,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.08775,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04388,"96":0,"97":0,"98":0,"99":0,"100":0.10725,"101":0.28275,"102":0.49725,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00975,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00488,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.01463,"105":0,"106":0,"107":0,"108":0.00975,"109":0.0585,"110":0.00488,"111":0.00975,"112":0.00975,"113":0.00488,"114":0.02438,"115":0.0585,"116":1.83788,"117":1.27725},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.039,"15":0.00488,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.06338,"14.1":0.08288,"15.1":0.00975,"15.2-15.3":0.039,"15.4":0.19988,"15.5":0.09263,"15.6":0.20963,"16.0":0.01463,"16.1":0.05363,"16.2":0.07313,"16.3":0.19988,"16.4":0.05363,"16.5":0.26325,"16.6":1.09688,"17.0":0.04875,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.18537,"10.0-10.2":0.00883,"10.3":0.08827,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.07356,"13.0-13.1":0.00883,"13.2":0,"13.3":0.00883,"13.4-13.7":0.03531,"14.0-14.4":0.02942,"14.5-14.8":0.33837,"15.0-15.1":0.08239,"15.2-15.3":0.15594,"15.4":0.17948,"15.5":0.19125,"15.6-15.7":1.42703,"16.0":0.98274,"16.1":1.32993,"16.2":0.58258,"16.3":1.35642,"16.4":0.42075,"16.5":1.58592,"16.6":14.51747,"17.0":5.2962,"17.1":0.2295},P:{"4":0.07207,"20":0.32947,"21":0.17503,"22":3.38734,"5.0-5.4":0,"6.2-6.4":0.0103,"7.2-7.4":0.03089,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.05148,"12.0":0,"13.0":0.02059,"14.0":0.03089,"15.0":0.10296,"16.0":0.05148,"17.0":0.0103,"18.0":0.02059,"19.0":0.30888},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.09363},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00488,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":39.7455},R:{_:"0"},M:{"0":0.25625},Q:{"13.1":0},O:{"0":0.04613},H:{"0":0.39301}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MR.js
index 46826398ec3c13..8ee74369769826 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00133,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00133,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00399,"79":0,"80":0,"81":0,"82":0.00266,"83":0,"84":0.00133,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00133,"96":0,"97":0,"98":0,"99":0,"100":0.00133,"101":0,"102":0.00133,"103":0,"104":0.00133,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00133,"111":0,"112":0,"113":0,"114":0.00399,"115":0.06246,"116":0.05715,"117":0.00266,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00133,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00133,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00133,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00133,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.15549,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00133,"66":0,"67":0,"68":0.00133,"69":0.00133,"70":0.00266,"71":0,"72":0,"73":0,"74":0.00133,"75":0,"76":0.00133,"77":0.00266,"78":0,"79":0.00133,"80":0.00133,"81":0.00133,"83":0,"84":0.00133,"85":0.00399,"86":0.00133,"87":0.00133,"88":0.0093,"89":0,"90":0,"91":0,"92":0,"93":0.00133,"94":0,"95":0.01063,"96":0,"97":0,"98":0.00133,"99":0.00133,"100":0,"101":0,"102":0,"103":0.00399,"104":0,"105":0.00266,"106":0.00133,"107":0.00133,"108":0.00266,"109":0.13556,"110":0.00133,"111":0.00133,"112":0.00133,"113":0.01063,"114":0.04386,"115":0.38275,"116":0.21796,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00266,"62":0,"63":0.00133,"64":0,"65":0,"66":0.00133,"67":0.00266,"68":0.00133,"69":0.00532,"70":0.00532,"71":0.01728,"72":0.01196,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00399,"96":0,"97":0,"98":0,"99":0,"100":0.0093,"101":0.02392,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00399,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00133,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.00133,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00133,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00266,"109":0.00797,"110":0.00133,"111":0.00133,"112":0,"113":0,"114":0.01861,"115":0.12626,"116":0.03987},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00266,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.02126,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00133,"14.1":0.00133,"15.1":0,"15.2-15.3":0.00133,"15.4":0.00665,"15.5":0,"15.6":0.00399,"16.0":0,"16.1":0.00133,"16.2":0.00133,"16.3":0.00399,"16.4":0.00133,"16.5":0.00665,"16.6":0.00665},G:{"8":0,"17":0.38488,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01309,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01833,"10.0-10.2":0.01047,"10.3":0.04451,"11.0-11.2":0.00785,"11.3-11.4":0.00524,"12.0-12.1":0.02356,"12.2-12.5":4.15509,"13.0-13.1":0.20422,"13.2":0.34298,"13.3":0.01047,"13.4-13.7":0.78546,"14.0-14.4":3.69691,"14.5-14.8":0.40059,"15.0-15.1":0.29324,"15.2-15.3":0.24349,"15.4":0.24349,"15.5":0.3456,"15.6-15.7":1.56831,"16.0":0.6467,"16.1":1.26721,"16.2":0.68335,"16.3":1.27245,"16.4":1.92176,"16.5":3.62621,"16.6":3.95873},P:{"4":0.12088,"20":0.24177,"21":0.89656,"5.0-5.4":0.01007,"6.2-6.4":0.03022,"7.2-7.4":0.81597,"8.2":0,"9.2":0.13096,"10.1":0.02015,"11.1-11.2":0.08059,"12.0":0.01007,"13.0":0.04029,"14.0":0.05037,"15.0":0.10074,"16.0":0.24177,"17.0":0.06044,"18.0":0.1511,"19.0":0.32236},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00214,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.04779},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0014,"9":0,"10":0,"11":0.02651,"5.5":0},S:{"2.5":0.00867,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.49294},R:{_:"0"},M:{"0":0.14741},Q:{"13.1":0},O:{"0":0.28614},H:{"0":0.58285}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00318,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00159,"113":0.00478,"114":0.00637,"115":0.0589,"116":0.01274,"117":0.10826,"118":0.00637,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00159,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00318,"41":0,"42":0,"43":0.00318,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.07482,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00159,"66":0.00318,"67":0,"68":0.00318,"69":0.00159,"70":0.00796,"71":0,"72":0,"73":0.00159,"74":0.00318,"75":0,"76":0,"77":0.00159,"78":0.00478,"79":0,"80":0,"81":0.00159,"83":0.00159,"84":0,"85":0,"86":0,"87":0.00159,"88":0.00159,"89":0,"90":0,"91":0.00318,"92":0,"93":0.00478,"94":0.00318,"95":0.00796,"96":0,"97":0,"98":0.00318,"99":0.00159,"100":0,"101":0,"102":0,"103":0.00318,"104":0,"105":0,"106":0.00159,"107":0.00159,"108":0.00318,"109":0.16079,"110":0,"111":0.00318,"112":0.00159,"113":0.0207,"114":0.01274,"115":0.0398,"116":0.74028,"117":0.22129,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00159,"60":0.00637,"62":0,"63":0,"64":0.00159,"65":0,"66":0,"67":0.00478,"68":0,"69":0.00637,"70":0.00796,"71":0.00637,"72":0.03184,"73":0.00796,"74":0,"75":0,"76":0,"77":0.00159,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00478,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00478,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.02388,"102":0.02229,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00318,"15":0,"16":0,"17":0,"18":0.00159,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00159,"90":0,"91":0,"92":0.00318,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00159,"109":0.00955,"110":0,"111":0,"112":0,"113":0.00159,"114":0.01751,"115":0.00637,"116":0.12099,"117":0.08756},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00318,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.02229,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00159,"15.1":0,"15.2-15.3":0,"15.4":0.01274,"15.5":0,"15.6":0.00478,"16.0":0.00159,"16.1":0.00159,"16.2":0.00159,"16.3":0.00478,"16.4":0.00159,"16.5":0.00796,"16.6":0.0191,"17.0":0.00159,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01284,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02568,"10.0-10.2":0,"10.3":0.09356,"11.0-11.2":0.01468,"11.3-11.4":0,"12.0-12.1":0.02018,"12.2-12.5":0.55218,"13.0-13.1":0.00917,"13.2":0.00734,"13.3":0.02935,"13.4-13.7":0.17244,"14.0-14.4":1.12821,"14.5-14.8":0.25499,"15.0-15.1":0.34121,"15.2-15.3":0.21097,"15.4":0.21097,"15.5":0.64207,"15.6-15.7":1.51895,"16.0":0.70444,"16.1":1.05299,"16.2":0.51916,"16.3":1.01264,"16.4":1.07684,"16.5":1.75744,"16.6":5.71809,"17.0":1.0585,"17.1":0.0055},P:{"4":0.10081,"20":0.28226,"21":0.49395,"22":2.27821,"5.0-5.4":0.02016,"6.2-6.4":0.04032,"7.2-7.4":0.98789,"8.2":0.01008,"9.2":0.15121,"10.1":0.01008,"11.1-11.2":0.06048,"12.0":0,"13.0":0.04032,"14.0":0.06048,"15.0":0.06048,"16.0":0.27218,"17.0":0.08064,"18.0":0.15121,"19.0":0.51411},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00909,"4.4":0,"4.4.3-4.4.4":0.08479},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00171,"9":0,"10":0,"11":0.02057,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":71.73407},R:{_:"0"},M:{"0":0.14294},Q:{"13.1":0.00841},O:{"0":0.34473},H:{"0":0.70845}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MS.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MS.js
index a73ecd7a61e74d..155fdf0bd40d57 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MS.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MS.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0.1114,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.01114,"59":0,"60":0,"61":0,"62":0.03899,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.09469,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.06127,"104":0,"105":0,"106":0,"107":0,"108":0.02228,"109":0.42332,"110":0,"111":0,"112":0.01114,"113":0,"114":0.48459,"115":10.68326,"116":7.17973,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01114,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":1.08058,"100":0.02228,"101":0.06127,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.01114,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.06127,"110":0.06127,"111":0,"112":0,"113":0,"114":0.28964,"115":4.14965,"116":1.27553},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0.09469,"17":0.03899,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02228,"14.1":0.03899,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.06127,"15.6":0,"16.0":0,"16.1":0,"16.2":0.01114,"16.3":0.20609,"16.4":0,"16.5":0.46231,"16.6":0.56814},G:{"8":0,"17":0.13686,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.05475,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.87718,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.19161,"14.5-14.8":0.02737,"15.0-15.1":0,"15.2-15.3":0.93193,"15.4":0.02737,"15.5":0,"15.6-15.7":1.09616,"16.0":0.35585,"16.1":0.63082,"16.2":0.82243,"16.3":0.84981,"16.4":0.02737,"16.5":2.27445,"16.6":4.1383},P:{"4":0,"20":0,"21":0.13617,"5.0-5.4":0.07332,"6.2-6.4":0,"7.2-7.4":0.09427,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.11522,"14.0":0,"15.0":0,"16.0":0,"17.0":0.09427,"18.0":0.02095,"19.0":0.02095},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":1.80468},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02228,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":51.76694},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.08862,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.01266,"113":0,"114":0,"115":0,"116":0,"117":0.05697,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.15192,"89":0.03165,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.08862,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.01266,"104":0,"105":0.01266,"106":0,"107":0,"108":0,"109":3.15867,"110":0,"111":0.01266,"112":0,"113":0.04431,"114":0.19623,"115":0.49374,"116":17.64804,"117":3.57645,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.05697,"101":0.53805,"102":0.08862,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.10761,"110":0,"111":0,"112":0,"113":0,"114":0.01266,"115":0.10761,"116":4.6209,"117":2.25981},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0.01266,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.12027,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.03165,"15.6":0.07596,"16.0":0,"16.1":0,"16.2":0,"16.3":0.08862,"16.4":0.08862,"16.5":0.08862,"16.6":0.93051,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.14397,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":1.04964,"16.0":0.1808,"16.1":1.51837,"16.2":0.32477,"16.3":0.72319,"16.4":0.03683,"16.5":0.25278,"16.6":9.4735,"17.0":3.00159,"17.1":0.03683},P:{"4":0,"20":0,"21":0.09749,"22":1.68986,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.20582,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.02166,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":4.21615},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":40.85043},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MT.js
index fffb46cff8126b..00caaff61d94e7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00492,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00492,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00984,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00984,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00984,"103":0,"104":0,"105":0,"106":0,"107":0.01477,"108":0,"109":0,"110":0,"111":0.00984,"112":0.00492,"113":0.00492,"114":0.01969,"115":0.19688,"116":0.63986,"117":0.01477,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00492,"40":0,"41":0.00492,"42":0,"43":0.00492,"44":0.00492,"45":0.00984,"46":0.00492,"47":0.00492,"48":0,"49":0.00492,"50":0,"51":0.00492,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00492,"71":0.00492,"72":0,"73":0,"74":0,"75":0,"76":0.00492,"77":0.00984,"78":0,"79":0.02953,"80":0,"81":0.00492,"83":0,"84":0,"85":0.00984,"86":0.00984,"87":0.00984,"88":0.00492,"89":0.00492,"90":0.00492,"91":0,"92":0.00984,"93":0.20672,"94":0.00492,"95":0.00492,"96":0.00492,"97":0,"98":0.00492,"99":0.00492,"100":0.00492,"101":0.00492,"102":0,"103":0.06891,"104":0.00492,"105":0.00492,"106":0.00984,"107":0.01969,"108":0.19688,"109":0.71861,"110":0.00492,"111":0.01969,"112":0.0443,"113":0.05414,"114":1.04839,"115":9.03679,"116":5.36498,"117":0.00492,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01969,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00492,"71":0.01477,"72":0.01477,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00492,"91":0,"92":0,"93":0,"94":0,"95":0.00492,"96":0,"97":0,"98":0,"99":0.01477,"100":0.49712,"101":0.18704,"102":0.00984,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00492,"13":0,"14":0.00492,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00492,"106":0,"107":0.00492,"108":0,"109":0.03445,"110":0.00492,"111":0.00492,"112":0,"113":0.00492,"114":0.09844,"115":1.97372,"116":0.694},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00984,"10":0,"11":0,"12":0,"13":0.00492,"14":0.02953,"15":0.00492,"17":0.01477,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00492,"10.1":0,"11.1":0,"12.1":0.00984,"13.1":0.02953,"14.1":0.07383,"15.1":0.00984,"15.2-15.3":0.01477,"15.4":0.01969,"15.5":0.0443,"15.6":0.18211,"16.0":0.03938,"16.1":0.0886,"16.2":0.04922,"16.3":0.12305,"16.4":0.07875,"16.5":0.39868,"16.6":0.48236},G:{"8":0.0048,"17":0.18222,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01199,"8.1-8.4":0.01439,"9.0-9.2":0,"9.3":0.02877,"10.0-10.2":0,"10.3":0.37163,"11.0-11.2":0.04316,"11.3-11.4":0.02877,"12.0-12.1":0.01439,"12.2-12.5":0.24695,"13.0-13.1":0,"13.2":0,"13.3":0.01678,"13.4-13.7":0.01199,"14.0-14.4":0.12947,"14.5-14.8":0.15105,"15.0-15.1":0.05035,"15.2-15.3":0.0983,"15.4":0.08631,"15.5":0.18461,"15.6-15.7":1.28031,"16.0":0.95424,"16.1":1.52247,"16.2":0.85594,"16.3":1.90608,"16.4":0.23736,"16.5":4.82395,"16.6":10.69804},P:{"4":0.10317,"20":0.08254,"21":0.19603,"5.0-5.4":0,"6.2-6.4":0.01032,"7.2-7.4":0.01032,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01032,"12.0":0.01032,"13.0":0.01032,"14.0":0.01032,"15.0":0,"16.0":0.01032,"17.0":0.02063,"18.0":0.02063,"19.0":0.02063},I:{"0":0,"3":0,"4":0.04194,"2.1":0.01048,"2.2":0.03145,"2.3":0.02621,"4.1":0.03145,"4.2-4.3":0.07339,"4.4":0,"4.4.3-4.4.4":0.27782},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00492,"8":0.03445,"9":0.00492,"10":0.00492,"11":0.03445,"5.5":0},S:{"2.5":0.00508,_:"3.0-3.1"},J:{"7":0,"10":0.00508},N:{"10":0.01523,"11":0},L:{"0":45.2639},R:{_:"0"},M:{"0":0.20312},Q:{"13.1":0},O:{"0":0.24882},H:{"0":0.28845}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0359,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00513,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00513,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00513,"103":0,"104":0,"105":0,"106":0,"107":0.00513,"108":0.00513,"109":0,"110":0,"111":0,"112":0.15384,"113":0.01026,"114":0.00513,"115":0.05641,"116":0.06154,"117":0.61536,"118":0.07692,"119":0,"120":0,"3.5":0,"3.6":0.00513},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00513,"44":0.00513,"45":0.00513,"46":0.00513,"47":0.00513,"48":0,"49":0.00513,"50":0,"51":0.00513,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00513,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.02051,"70":0.00513,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00513,"77":0.01538,"78":0,"79":0.00513,"80":0,"81":0,"83":0,"84":0,"85":0.00513,"86":0.00513,"87":0.01026,"88":0,"89":0.00513,"90":0,"91":0,"92":0.01026,"93":0.16922,"94":0.00513,"95":0.00513,"96":0.00513,"97":0.00513,"98":0,"99":0.00513,"100":0.00513,"101":0,"102":0,"103":0.0359,"104":0.00513,"105":0.00513,"106":0.01026,"107":0.01538,"108":0.27178,"109":0.58972,"110":0.01026,"111":0.01538,"112":0.04102,"113":0.03077,"114":0.15384,"115":0.4205,"116":11.94311,"117":4.37931,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.02051,"29":0,"30":0,"31":0.00513,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00513,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01026,"73":0.00513,"74":0,"75":0,"76":0,"77":0.01538,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00513,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.01026,"100":0.0923,"101":0.23589,"102":0.7333,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00513,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.02051,"108":0,"109":0.03077,"110":0.00513,"111":0,"112":0.00513,"113":0.00513,"114":0.01538,"115":0.04615,"116":1.22046,"117":1.33841},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.01026,"10":0,"11":0,"12":0,"13":0.00513,"14":0.01538,"15":0.00513,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01026,"13.1":0.02564,"14.1":0.08718,"15.1":0.01538,"15.2-15.3":0.01026,"15.4":0.01538,"15.5":0.02051,"15.6":0.14871,"16.0":0.03077,"16.1":0.06154,"16.2":0.04615,"16.3":0.0923,"16.4":0.45639,"16.5":0.21538,"16.6":0.7692,"17.0":0.07179,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01321,"6.0-6.1":0,"7.0-7.1":0.01849,"8.1-8.4":0.01849,"9.0-9.2":0,"9.3":0.02641,"10.0-10.2":0,"10.3":0.19809,"11.0-11.2":0.03698,"11.3-11.4":0.03434,"12.0-12.1":0.01321,"12.2-12.5":0.2245,"13.0-13.1":0,"13.2":0.00792,"13.3":0.00528,"13.4-13.7":0.02113,"14.0-14.4":0.13999,"14.5-14.8":0.22186,"15.0-15.1":0.05547,"15.2-15.3":0.1347,"15.4":0.06075,"15.5":0.19809,"15.6-15.7":1.0697,"16.0":0.81086,"16.1":1.30477,"16.2":0.78709,"16.3":1.25194,"16.4":0.1796,"16.5":0.82142,"16.6":16.11414,"17.0":2.38503,"17.1":0.00528},P:{"4":0.08301,"20":0.08301,"21":0.07263,"22":2.3139,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01038,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01038,"12.0":0.01038,"13.0":0.01038,"14.0":0.01038,"15.0":0.01038,"16.0":0.01038,"17.0":0.01038,"18.0":0.01038,"19.0":0.07263},I:{"0":0,"3":0.00537,"4":0.04298,"2.1":0.02686,"2.2":0.02149,"2.3":0.02686,"4.1":0.03224,"4.2-4.3":0.07522,"4.4":0,"4.4.3-4.4.4":0.24178},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0.00513,"8":0.04615,"9":0.00513,"10":0.00513,"11":0.02564,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00487},N:{"10":0.01462,"11":0},L:{"0":42.48426},R:{_:"0"},M:{"0":0.17052},Q:{"13.1":0},O:{"0":0.17539},H:{"0":0.19372}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MU.js
index 2ff85e2c84c7ee..d660cd79c10f92 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00337,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0101,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00337,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00337,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01683,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00337,"109":0.00337,"110":0,"111":0.00337,"112":0,"113":0,"114":0.03703,"115":0.16157,"116":0.48807,"117":0.01683,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00337,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00337,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00673,"50":0.00337,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00337,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00337,"75":0,"76":0.00337,"77":0,"78":0.0101,"79":0.03703,"80":0.0101,"81":0.03366,"83":0.00673,"84":0,"85":0,"86":0,"87":0.01683,"88":0.0101,"89":0.00673,"90":0.03029,"91":0.00337,"92":0.0101,"93":0.00337,"94":0.00337,"95":0,"96":0.00337,"97":0.00337,"98":0.00337,"99":0.02356,"100":0.00337,"101":0.00337,"102":0.00337,"103":0.02693,"104":0.0202,"105":0.00673,"106":0.02693,"107":0.00673,"108":0.0202,"109":0.58905,"110":0.00337,"111":0.02356,"112":0.02693,"113":0.03029,"114":0.45104,"115":4.2277,"116":2.26868,"117":0.00673,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00673,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.01683,"68":0,"69":0.02693,"70":0.00337,"71":0.05386,"72":0.05722,"73":0,"74":0.01683,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00673,"96":0,"97":0,"98":0,"99":0.00673,"100":0.12118,"101":0.11781,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00337,"18":0.00337,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00337,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0202,"110":0.00337,"111":0.00337,"112":0.00337,"113":0.00337,"114":0.03703,"115":0.90545,"116":0.23562},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00673,"15":0,"17":0.00673,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00673,"13.1":0.01346,"14.1":0.03366,"15.1":0.00673,"15.2-15.3":0.00337,"15.4":0.00673,"15.5":0.0101,"15.6":0.07069,"16.0":0.01683,"16.1":0.0101,"16.2":0.04712,"16.3":0.06059,"16.4":0.02356,"16.5":0.12791,"16.6":0.1481},G:{"8":0,"17":0.16895,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00362,"6.0-6.1":0,"7.0-7.1":0.00724,"8.1-8.4":0.00362,"9.0-9.2":0,"9.3":0.08809,"10.0-10.2":0,"10.3":0.08447,"11.0-11.2":0.00362,"11.3-11.4":0.00362,"12.0-12.1":0.00965,"12.2-12.5":0.21601,"13.0-13.1":0,"13.2":0.00241,"13.3":0.00483,"13.4-13.7":0.01569,"14.0-14.4":0.02655,"14.5-14.8":0.08809,"15.0-15.1":0.04344,"15.2-15.3":0.08085,"15.4":0.03017,"15.5":0.06396,"15.6-15.7":0.91955,"16.0":0.37651,"16.1":0.63838,"16.2":0.4996,"16.3":0.62752,"16.4":0.08689,"16.5":2.29526,"16.6":5.67177},P:{"4":0.16243,"20":0.2944,"21":0.45682,"5.0-5.4":0.01015,"6.2-6.4":0.01015,"7.2-7.4":0.15227,"8.2":0,"9.2":0.01015,"10.1":0,"11.1-11.2":0.06091,"12.0":0.01015,"13.0":0.05076,"14.0":0.07106,"15.0":0.01015,"16.0":0.17258,"17.0":0.06091,"18.0":0.06091,"19.0":0.13197},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01615,"4.2-4.3":0.00606,"4.4":0,"4.4.3-4.4.4":0.07472},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02356,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.52294},R:{_:"0"},M:{"0":0.41794},Q:{"13.1":0.00663},O:{"0":0.76291},H:{"0":0.81648}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00692,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00346,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00346,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00346,"99":0,"100":0,"101":0,"102":0.02423,"103":0,"104":0,"105":0.00346,"106":0,"107":0,"108":0.00692,"109":0,"110":0.00346,"111":0,"112":0,"113":0.00346,"114":0.00692,"115":0.06924,"116":0.03116,"117":0.61624,"118":0.04847,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00346,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00346,"35":0,"36":0,"37":0,"38":0.01731,"39":0,"40":0.01731,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00346,"47":0,"48":0,"49":0.01039,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00346,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00346,"75":0,"76":0,"77":0,"78":0.00346,"79":0.03116,"80":0.00692,"81":0.03808,"83":0.00346,"84":0,"85":0,"86":0,"87":0.02423,"88":0.01039,"89":0.00346,"90":0.00346,"91":0.00346,"92":0.01039,"93":0.00346,"94":0.00346,"95":0,"96":0.00346,"97":0.00346,"98":0.01385,"99":0.01385,"100":0.00346,"101":0.00346,"102":0.00346,"103":0.02423,"104":0.02077,"105":0.00692,"106":0.04154,"107":0.00692,"108":0.01385,"109":0.55046,"110":0.03808,"111":0.01039,"112":0.0277,"113":0.00692,"114":0.09694,"115":0.25273,"116":5.83001,"117":1.30517,"118":0.00692,"119":0.00346,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00692,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00346,"64":0,"65":0.00346,"66":0,"67":0.02077,"68":0,"69":0.04154,"70":0.00692,"71":0.01039,"72":0.11078,"73":0.02077,"74":0.00692,"75":0,"76":0,"77":0.02077,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01731,"96":0,"97":0,"98":0,"99":0,"100":0.02077,"101":0.09694,"102":0.08655,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00346,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01385,"110":0.00346,"111":0,"112":0.00346,"113":0.00346,"114":0.01039,"115":0.03116,"116":0.63701,"117":0.48814},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.00346,"13":0,"14":0.01039,"15":0.00346,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00346,"13.1":0.02423,"14.1":0.0277,"15.1":0,"15.2-15.3":0.00346,"15.4":0.00692,"15.5":0.01039,"15.6":0.06232,"16.0":0.02423,"16.1":0.01039,"16.2":0.04154,"16.3":0.05539,"16.4":0.01731,"16.5":0.0727,"16.6":0.23195,"17.0":0.03116,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00358,"6.0-6.1":0,"7.0-7.1":0.01073,"8.1-8.4":0.00239,"9.0-9.2":0,"9.3":0.09661,"10.0-10.2":0,"10.3":0.06798,"11.0-11.2":0.00119,"11.3-11.4":0.00239,"12.0-12.1":0.01073,"12.2-12.5":0.23853,"13.0-13.1":0.00119,"13.2":0.00358,"13.3":0.00954,"13.4-13.7":0.00716,"14.0-14.4":0.03459,"14.5-14.8":0.07633,"15.0-15.1":0.05844,"15.2-15.3":0.03459,"15.4":0.05248,"15.5":0.05248,"15.6-15.7":0.7633,"16.0":0.25523,"16.1":0.52596,"16.2":0.48541,"16.3":0.44009,"16.4":0.05725,"16.5":0.32202,"16.6":7.04146,"17.0":1.11037,"17.1":0.00239},P:{"4":0.16292,"20":0.29529,"21":0.2342,"22":5.06068,"5.0-5.4":0.01018,"6.2-6.4":0,"7.2-7.4":0.15274,"8.2":0,"9.2":0.01018,"10.1":0,"11.1-11.2":0.06109,"12.0":0.01018,"13.0":0.06109,"14.0":0.07128,"15.0":0.01018,"16.0":0.2342,"17.0":0.08146,"18.0":0.05091,"19.0":0.14255},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00152,"4.2-4.3":0.00457,"4.4":0,"4.4.3-4.4.4":0.0716},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0277,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.83611},R:{_:"0"},M:{"0":0.29421},Q:{"13.1":0.00654},O:{"0":0.80417},H:{"0":0.92846}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MV.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MV.js
index 51620332d5025c..aaee820aec4f47 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MV.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MV.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00281,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00281,"100":0,"101":0,"102":0,"103":0.00281,"104":0,"105":0,"106":0,"107":0.00281,"108":0,"109":0,"110":0.01968,"111":0.00843,"112":0.00562,"113":0.00281,"114":0.00562,"115":0.14336,"116":0.5622,"117":0.01124,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00562,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00281,"71":0,"72":0,"73":0,"74":0.00281,"75":0,"76":0,"77":0,"78":0,"79":0.00281,"80":0.00281,"81":0.00281,"83":0.00843,"84":0,"85":0,"86":0.00562,"87":0,"88":0.00562,"89":0,"90":0.00281,"91":0.00281,"92":0.00281,"93":0.00281,"94":0,"95":0.00281,"96":0,"97":0.00281,"98":0,"99":0.00562,"100":0.00281,"101":0,"102":0,"103":0.00843,"104":0,"105":0.00281,"106":0.00562,"107":0.00562,"108":0.00281,"109":0.19396,"110":0.00281,"111":0.01406,"112":0.01124,"113":0.01687,"114":0.31202,"115":3.36758,"116":1.83277,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00281,"70":0.03092,"71":0.04217,"72":0.01968,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.09276,"101":0.07871,"102":0.00562,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00281,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00281,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.02811,"109":0.00281,"110":0,"111":0,"112":0.00281,"113":0.00562,"114":0.03654,"115":0.42727,"116":0.11244},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00281,"12":0,"13":0,"14":0.00562,"15":0.00281,"17":0.01124,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00843,"13.1":0.00562,"14.1":0.01968,"15.1":0,"15.2-15.3":0.00281,"15.4":0.00281,"15.5":0.00843,"15.6":0.03654,"16.0":0.00843,"16.1":0.0253,"16.2":0.02811,"16.3":0.03092,"16.4":0.01406,"16.5":0.09557,"16.6":0.1265},G:{"8":0,"17":0.77485,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01265,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00949,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0.00633,"12.0-12.1":0,"12.2-12.5":0.14865,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.06642,"14.0-14.4":0.11702,"14.5-14.8":0.29096,"15.0-15.1":0.08539,"15.2-15.3":0.16446,"15.4":0.09488,"15.5":0.20874,"15.6-15.7":1.5244,"16.0":1.34729,"16.1":1.79007,"16.2":0.81597,"16.3":2.07154,"16.4":0.65467,"16.5":7.95409,"16.6":13.46977},P:{"4":0.04062,"20":0.04062,"21":0.12185,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01015,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01015,"14.0":0,"15.0":0.01015,"16.0":0.02031,"17.0":0.02031,"18.0":0.02031,"19.0":0.07108},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.06124},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":54.86926},R:{_:"0"},M:{"0":1.27245},Q:{"13.1":0},O:{"0":0.81955},H:{"0":0.73506}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00578,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00289,"100":0,"101":0,"102":0,"103":0.00289,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00578,"111":0.00578,"112":0,"113":0,"114":0,"115":0.01156,"116":0.104,"117":0.51135,"118":0.02022,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00289,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00289,"71":0,"72":0,"73":0,"74":0.00289,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00289,"83":0.01733,"84":0,"85":0,"86":0,"87":0.00578,"88":0.00578,"89":0,"90":0,"91":0.00289,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00578,"100":0.00289,"101":0,"102":0,"103":0.00867,"104":0,"105":0.00289,"106":0.00867,"107":0.00578,"108":0.00289,"109":0.19356,"110":0.00289,"111":0.00867,"112":0.01445,"113":0.01156,"114":0.11267,"115":0.13289,"116":4.50106,"117":1.08626,"118":0.00289,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00289,"70":0.00289,"71":0.00289,"72":0.06934,"73":0.02022,"74":0,"75":0,"76":0,"77":0.00578,"78":0.00289,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.02889,"101":0.09245,"102":0.08667,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00289,"89":0,"90":0,"91":0,"92":0.00289,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00289,"103":0,"104":0,"105":0,"106":0,"107":0.00289,"108":0.00578,"109":0.00867,"110":0,"111":0,"112":0.00289,"113":0.00289,"114":0.01445,"115":0.02889,"116":0.35535,"117":0.24268},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00289,"12":0,"13":0,"14":0.00578,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00578,"14.1":0.01156,"15.1":0.00867,"15.2-15.3":0.00578,"15.4":0.00578,"15.5":0.00578,"15.6":0.02022,"16.0":0.00578,"16.1":0.02022,"16.2":0.00867,"16.3":0.02311,"16.4":0.01445,"16.5":0.05489,"16.6":0.19645,"17.0":0.03467,"17.1":0.00289},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01551,"6.0-6.1":0,"7.0-7.1":0.0031,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02481,"10.0-10.2":0,"10.3":0.0062,"11.0-11.2":0,"11.3-11.4":0.0062,"12.0-12.1":0,"12.2-12.5":0.13335,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.04652,"14.0-14.4":0.08994,"14.5-14.8":0.22329,"15.0-15.1":0.05892,"15.2-15.3":0.17987,"15.4":0.06823,"15.5":0.18918,"15.6-15.7":1.26842,"16.0":1.31184,"16.1":1.50412,"16.2":0.63886,"16.3":1.52273,"16.4":0.54893,"16.5":1.81114,"16.6":17.07251,"17.0":3.9014,"17.1":0},P:{"4":0.02075,"20":0.04151,"21":0.05189,"22":1.54619,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.02075,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.01038,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01038,"18.0":0.01038,"19.0":0.07264},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.11578},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":55.07909},R:{_:"0"},M:{"0":1.27287},Q:{"13.1":0},O:{"0":1.06665},H:{"0":0.63956}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MW.js
index c717ee7a27ca32..ebc0f71846e464 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00263,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00263,"96":0,"97":0,"98":0.00263,"99":0.00263,"100":0,"101":0.00263,"102":0.00525,"103":0,"104":0,"105":0.00525,"106":0,"107":0.01314,"108":0.00263,"109":0.00788,"110":0.00263,"111":0.00788,"112":0.00263,"113":0.00788,"114":0.00788,"115":0.12084,"116":0.22067,"117":0.01314,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00263,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00263,"36":0,"37":0,"38":0,"39":0,"40":0.00525,"41":0,"42":0,"43":0,"44":0.01314,"45":0,"46":0.00263,"47":0,"48":0,"49":0.00263,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00788,"56":0,"57":0,"58":0.00263,"59":0,"60":0,"61":0.00525,"62":0,"63":0,"64":0.01576,"65":0,"66":0,"67":0,"68":0.00263,"69":0,"70":0.00788,"71":0.00263,"72":0,"73":0,"74":0.00525,"75":0,"76":0,"77":0.00263,"78":0,"79":0.00263,"80":0.00525,"81":0.02364,"83":0.00263,"84":0,"85":0,"86":0,"87":0.00263,"88":0.00263,"89":0,"90":0,"91":0,"92":0.00788,"93":0.00263,"94":0.00525,"95":0.00525,"96":0.00263,"97":0,"98":0,"99":0.00263,"100":0.00263,"101":0,"102":0.00788,"103":0.01576,"104":0.00263,"105":0.00263,"106":0.00525,"107":0.00263,"108":0.00525,"109":0.1944,"110":0.00788,"111":0.00788,"112":0.01051,"113":0.02102,"114":0.10245,"115":1.45799,"116":0.72768,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0.00263,"20":0.00263,"21":0,"22":0,"23":0,"24":0.00263,"25":0,"26":0.01314,"27":0.00263,"28":0.02627,"29":0.00263,"30":0.00788,"31":0,"32":0.01839,"33":0.00525,"34":0,"35":0.03152,"36":0,"37":0.00525,"38":0.00263,"39":0,"40":0,"41":0,"42":0.00788,"43":0.00263,"44":0,"45":0,"46":0.00263,"47":0.00263,"48":0,"49":0,"50":0.00263,"51":0.00263,"52":0,"53":0,"54":0,"55":0.00263,"56":0.00263,"57":0.01051,"58":0.00525,"60":0.0289,"62":0,"63":0.04466,"64":0.01051,"65":0.00788,"66":0.03415,"67":0.0289,"68":0.01051,"69":0.13398,"70":0.11033,"71":0.30736,"72":0.17601,"73":0,"74":0.00263,"75":0.00263,"76":0.00788,"77":0.00525,"78":0,"79":0.00263,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01576,"96":0,"97":0,"98":0,"99":0.00525,"100":0.06305,"101":0.17601,"102":0.00263,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01839},B:{"12":0.00788,"13":0.00263,"14":0.00263,"15":0.00525,"16":0.00263,"17":0.00525,"18":0.02102,"79":0,"80":0,"81":0,"83":0,"84":0.00525,"85":0,"86":0,"87":0,"88":0,"89":0.00263,"90":0.00525,"91":0,"92":0.02364,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00263,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00263,"109":0.03941,"110":0.00263,"111":0.00525,"112":0.00788,"113":0.01051,"114":0.04466,"115":0.53591,"116":0.13135},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00263,"15":0,"17":0.00263,_:"0","3.1":0,"3.2":0,"5.1":0.00525,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00263,"13.1":0.00525,"14.1":0.00263,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00525,"16.0":0,"16.1":0.00263,"16.2":0.00263,"16.3":0.00263,"16.4":0.00263,"16.5":0.00788,"16.6":0.00788},G:{"8":0,"17":0.0202,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00051,"5.0-5.1":0.00051,"6.0-6.1":0.00205,"7.0-7.1":0.01636,"8.1-8.4":0,"9.0-9.2":0.00051,"9.3":0.04269,"10.0-10.2":0.00026,"10.3":0.03553,"11.0-11.2":0.00051,"11.3-11.4":0.00179,"12.0-12.1":0.00358,"12.2-12.5":0.17639,"13.0-13.1":0.00307,"13.2":0.00102,"13.3":0.00639,"13.4-13.7":0.02275,"14.0-14.4":0.06314,"14.5-14.8":0.07644,"15.0-15.1":0.02377,"15.2-15.3":0.02582,"15.4":0.05701,"15.5":0.05675,"15.6-15.7":0.46781,"16.0":0.07158,"16.1":0.08692,"16.2":0.05445,"16.3":0.11043,"16.4":0.10379,"16.5":0.54323,"16.6":0.4806},P:{"4":0.44468,"20":0.07239,"21":0.1758,"5.0-5.4":0.01034,"6.2-6.4":0.01034,"7.2-7.4":0.14478,"8.2":0,"9.2":0.02068,"10.1":0,"11.1-11.2":0.01034,"12.0":0,"13.0":0.03102,"14.0":0.03102,"15.0":0.01034,"16.0":0.03102,"17.0":0.03102,"18.0":0.03102,"19.0":0.06205},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.002,"4.2-4.3":0.01598,"4.4":0,"4.4.3-4.4.4":0.18778},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01051,"5.5":0},S:{"2.5":0.17695,_:"3.0-3.1"},J:{"7":0,"10":0.01475},N:{"10":0,"11":0},L:{"0":74.31743},R:{_:"0"},M:{"0":0.20644},Q:{"13.1":0.02212},O:{"0":3.92244},H:{"0":7.81093}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00311,"86":0,"87":0,"88":0,"89":0.00311,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00311,"100":0,"101":0,"102":0.00934,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00623,"109":0.00311,"110":0.00311,"111":0.00623,"112":0.00311,"113":0.00623,"114":0.00934,"115":0.07474,"116":0.04982,"117":0.48578,"118":0.08719,"119":0.00311,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00311,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00623,"41":0,"42":0,"43":0.00311,"44":0.0218,"45":0,"46":0.00311,"47":0,"48":0,"49":0,"50":0.00311,"51":0,"52":0,"53":0,"54":0,"55":0.00623,"56":0,"57":0,"58":0.00311,"59":0,"60":0,"61":0.00311,"62":0,"63":0,"64":0.01557,"65":0.00311,"66":0,"67":0,"68":0,"69":0,"70":0.00934,"71":0,"72":0,"73":0,"74":0.00623,"75":0.00311,"76":0,"77":0.00311,"78":0,"79":0.00623,"80":0.00934,"81":0.01868,"83":0.00311,"84":0,"85":0.00311,"86":0,"87":0.00311,"88":0.00311,"89":0,"90":0.00311,"91":0.00311,"92":0.00934,"93":0.00311,"94":0.00311,"95":0.00311,"96":0.00311,"97":0,"98":0.00311,"99":0.00934,"100":0.00311,"101":0.00311,"102":0.00934,"103":0.01557,"104":0.00311,"105":0.00623,"106":0.00623,"107":0.00623,"108":0.00623,"109":0.2896,"110":0.01557,"111":0.00934,"112":0.00934,"113":0.02803,"114":0.05294,"115":0.05917,"116":2.6687,"117":1.32034,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00934,"27":0.00311,"28":0.0218,"29":0,"30":0.00311,"31":0,"32":0.01246,"33":0.00311,"34":0,"35":0.01868,"36":0,"37":0.00311,"38":0.00311,"39":0,"40":0,"41":0,"42":0.00623,"43":0.00311,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00311,"52":0,"53":0,"54":0.00623,"55":0,"56":0.00311,"57":0.00623,"58":0.00311,"60":0.0218,"62":0,"63":0.04048,"64":0.00934,"65":0.00311,"66":0.01868,"67":0.02803,"68":0.01557,"69":0.09031,"70":0.07785,"71":0.13079,"72":0.33943,"73":0.06228,"74":0.00311,"75":0.01557,"76":0.00311,"77":0.0436,"78":0.00311,"79":0.00311,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01868,"96":0,"97":0,"98":0,"99":0.00311,"100":0.00311,"101":0.1121,"102":0.14947,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01557},B:{"12":0.00623,"13":0.00311,"14":0,"15":0.00623,"16":0.00311,"17":0.00311,"18":0.01868,"79":0,"80":0,"81":0,"83":0,"84":0.00623,"85":0,"86":0,"87":0,"88":0,"89":0.00311,"90":0.00311,"91":0,"92":0.0218,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00623,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00311,"109":0.02803,"110":0.00311,"111":0.00623,"112":0.00934,"113":0.00623,"114":0.02491,"115":0.04982,"116":0.37368,"117":0.66951},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00311,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00311,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00311,"13.1":0.00623,"14.1":0.00311,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00623,"16.0":0,"16.1":0.00311,"16.2":0.00311,"16.3":0.00311,"16.4":0.00311,"16.5":0.00623,"16.6":0.0218,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00129,"6.0-6.1":0.00283,"7.0-7.1":0.00798,"8.1-8.4":0,"9.0-9.2":0.00077,"9.3":0.0157,"10.0-10.2":0,"10.3":0.02317,"11.0-11.2":0.00051,"11.3-11.4":0.00129,"12.0-12.1":0.00618,"12.2-12.5":0.2098,"13.0-13.1":0.00154,"13.2":0.00026,"13.3":0.00798,"13.4-13.7":0.01467,"14.0-14.4":0.05123,"14.5-14.8":0.05277,"15.0-15.1":0.04016,"15.2-15.3":0.03295,"15.4":0.04737,"15.5":0.05535,"15.6-15.7":0.39514,"16.0":0.08598,"16.1":0.08804,"16.2":0.08083,"16.3":0.10632,"16.4":0.08778,"16.5":0.17814,"16.6":0.70276,"17.0":0.23091,"17.1":0},P:{"4":0.25823,"20":0.08263,"21":0.20658,"22":0.54744,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.13428,"8.2":0,"9.2":0.01033,"10.1":0,"11.1-11.2":0.01033,"12.0":0,"13.0":0.01033,"14.0":0.01033,"15.0":0.01033,"16.0":0.04132,"17.0":0.03099,"18.0":0.04132,"19.0":0.05165},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00806,"4.4":0,"4.4.3-4.4.4":0.1144},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00934,"5.5":0},S:{"2.5":0.0964,_:"3.0-3.1"},J:{"7":0,"10":0.01377},N:{"10":0,"11":0},L:{"0":75.10967},R:{_:"0"},M:{"0":0.21347},Q:{"13.1":0.00689},O:{"0":3.1469},H:{"0":5.95205}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MX.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MX.js
index 848eb1e7b1f291..d6d6420c25e983 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MX.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MX.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0084,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.0042,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.0042,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0084,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.0042,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01681,"103":0,"104":0.01681,"105":0.0042,"106":0,"107":0.0042,"108":0,"109":0,"110":0.0042,"111":0.0042,"112":0.0042,"113":0.0084,"114":0.02101,"115":0.22691,"116":0.52105,"117":0.02101,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.0042,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01681,"50":0,"51":0,"52":0.01261,"53":0,"54":0,"55":0,"56":0.02101,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.0084,"66":0.01681,"67":0.0042,"68":0,"69":0,"70":0.0042,"71":0.0042,"72":0,"73":0,"74":0.0042,"75":0.0042,"76":0.0084,"77":0.0042,"78":0.0042,"79":0.04202,"80":0.0042,"81":0.01261,"83":0.0042,"84":0.0042,"85":0.0042,"86":0.0042,"87":0.02521,"88":0.01681,"89":0.02101,"90":0.0042,"91":0.02521,"92":0.0042,"93":0.0084,"94":0.0042,"95":0.0042,"96":0.0042,"97":0.0084,"98":0.0084,"99":0.02941,"100":0.0084,"101":0.0042,"102":0.0084,"103":0.06723,"104":0.0084,"105":0.0084,"106":0.02101,"107":0.01261,"108":0.02101,"109":1.17656,"110":0.02101,"111":0.02521,"112":0.03782,"113":0.06303,"114":0.45802,"115":6.07189,"116":3.58431,"117":0.0042,"118":0.0042,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0042,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0042,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.0084,"72":0.0084,"73":0,"74":0.0042,"75":0,"76":0,"77":0.0042,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02101,"96":0,"97":0,"98":0,"99":0.01261,"100":0.44121,"101":0.24372,"102":0.0042,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.0042,"13":0,"14":0,"15":0,"16":0,"17":0.0042,"18":0.0042,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0042,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0042,"100":0,"101":0,"102":0.0042,"103":0,"104":0,"105":0,"106":0,"107":0.0042,"108":0.0042,"109":0.03782,"110":0.0042,"111":0.0042,"112":0.0084,"113":0.0084,"114":0.16388,"115":1.37405,"116":0.48743},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0042,"14":0.01261,"15":0.0042,"17":0.0042,_:"0","3.1":0,"3.2":0,"5.1":0.0042,"6.1":0,"7.1":0,"9.1":0.0042,"10.1":0,"11.1":0.0042,"12.1":0.0084,"13.1":0.02941,"14.1":0.04202,"15.1":0.0042,"15.2-15.3":0.0042,"15.4":0.0084,"15.5":0.01681,"15.6":0.09665,"16.0":0.01261,"16.1":0.02941,"16.2":0.02941,"16.3":0.07143,"16.4":0.02941,"16.5":0.2017,"16.6":0.24792},G:{"8":0,"17":0.13485,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.01024,"6.0-6.1":0,"7.0-7.1":0.00854,"8.1-8.4":0,"9.0-9.2":0.03243,"9.3":0.06999,"10.0-10.2":0.00171,"10.3":0.06316,"11.0-11.2":0.00854,"11.3-11.4":0.04097,"12.0-12.1":0.00683,"12.2-12.5":0.25947,"13.0-13.1":0.00683,"13.2":0.00341,"13.3":0.01024,"13.4-13.7":0.03243,"14.0-14.4":0.07852,"14.5-14.8":0.18606,"15.0-15.1":0.06145,"15.2-15.3":0.06657,"15.4":0.06828,"15.5":0.13656,"15.6-15.7":1.15223,"16.0":0.52747,"16.1":0.95764,"16.2":0.50016,"16.3":1.05835,"16.4":0.21508,"16.5":3.30649,"16.6":8.04345},P:{"4":0.10206,"20":0.03062,"21":0.06124,"5.0-5.4":0.01021,"6.2-6.4":0,"7.2-7.4":0.07144,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01021,"12.0":0,"13.0":0.01021,"14.0":0.01021,"15.0":0,"16.0":0.02041,"17.0":0.03062,"18.0":0.01021,"19.0":0.03062},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00501,"4.2-4.3":0.01504,"4.4":0,"4.4.3-4.4.4":0.13037},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0042,"9":0,"10":0,"11":0.03782,"5.5":0},S:{"2.5":0.0058,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":63.26419},R:{_:"0"},M:{"0":0.20873},Q:{"13.1":0},O:{"0":0.05798},H:{"0":0.24152}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00889,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00444,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00444,"67":0,"68":0.00444,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00889,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00444,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02222,"103":0,"104":0.01778,"105":0.00444,"106":0,"107":0.00444,"108":0.00444,"109":0,"110":0.00444,"111":0.00444,"112":0.00444,"113":0.00889,"114":0.00889,"115":0.13332,"116":0.04444,"117":0.61772,"118":0.05777,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00444,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.05777,"50":0,"51":0,"52":0.00889,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00444,"66":0.01778,"67":0.00444,"68":0,"69":0,"70":0.00444,"71":0.00444,"72":0,"73":0,"74":0.00889,"75":0.00444,"76":0.00444,"77":0.00444,"78":0.00444,"79":0.03555,"80":0.01333,"81":0.00889,"83":0.00444,"84":0.00444,"85":0.00444,"86":0.00444,"87":0.02666,"88":0.01333,"89":0.01778,"90":0.00444,"91":0.02666,"92":0.00444,"93":0.00889,"94":0.00444,"95":0.00444,"96":0.00444,"97":0.00889,"98":0.00444,"99":0.02666,"100":0.00444,"101":0.00444,"102":0.00889,"103":0.0711,"104":0.00889,"105":0.00889,"106":0.01778,"107":0.01778,"108":0.02222,"109":1.26654,"110":0.02222,"111":0.02222,"112":0.03111,"113":0.03555,"114":0.15554,"115":0.31108,"116":8.69691,"117":2.27977,"118":0.00889,"119":0.00444,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00444,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01778,"73":0.00444,"74":0.00444,"75":0,"76":0,"77":0.01778,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02666,"96":0,"97":0,"98":0,"99":0.00444,"100":0.10221,"101":0.25775,"102":0.30219,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00444,"13":0,"14":0,"15":0,"16":0,"17":0.00444,"18":0.00444,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00889,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00444,"100":0,"101":0,"102":0.00444,"103":0,"104":0,"105":0,"106":0,"107":0.00444,"108":0.00444,"109":0.04444,"110":0.00444,"111":0.00444,"112":0.00444,"113":0.00889,"114":0.04888,"115":0.04888,"116":1.25321,"117":0.99101},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00444,"14":0.01333,"15":0.00444,_:"0","3.1":0,"3.2":0,"5.1":0.00444,"6.1":0,"7.1":0,"9.1":0.00889,"10.1":0,"11.1":0.00444,"12.1":0.00444,"13.1":0.03111,"14.1":0.04444,"15.1":0.00889,"15.2-15.3":0.00444,"15.4":0.00889,"15.5":0.01778,"15.6":0.10221,"16.0":0.01333,"16.1":0.03111,"16.2":0.02666,"16.3":0.0711,"16.4":0.04,"16.5":0.09332,"16.6":0.43996,"17.0":0.03111,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00653,"6.0-6.1":0,"7.0-7.1":0.0049,"8.1-8.4":0,"9.0-9.2":0.02449,"9.3":0.0555,"10.0-10.2":0.00163,"10.3":0.05387,"11.0-11.2":0.00816,"11.3-11.4":0.03591,"12.0-12.1":0.0049,"12.2-12.5":0.24975,"13.0-13.1":0.00816,"13.2":0.00326,"13.3":0.01959,"13.4-13.7":0.03265,"14.0-14.4":0.07182,"14.5-14.8":0.19425,"15.0-15.1":0.05224,"15.2-15.3":0.05713,"15.4":0.0604,"15.5":0.11427,"15.6-15.7":1.05452,"16.0":0.44238,"16.1":0.76232,"16.2":0.4032,"16.3":0.7966,"16.4":0.15508,"16.5":0.41462,"16.6":9.82694,"17.0":1.2047,"17.1":0.00163},P:{"4":0.10269,"20":0.02054,"21":0.05134,"22":0.84203,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.05134,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01027,"12.0":0,"13.0":0.01027,"14.0":0,"15.0":0,"16.0":0.01027,"17.0":0.02054,"18.0":0.01027,"19.0":0.02054},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0.02293,"2.3":0,"4.1":0.01835,"4.2-4.3":0.01376,"4.4":0,"4.4.3-4.4.4":0.12384},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03555,"5.5":0},S:{"2.5":0.00556,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":62.36039},R:{_:"0"},M:{"0":0.21113},Q:{"13.1":0},O:{"0":0.06112},H:{"0":0.24196}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MY.js
index 999696b4a06c4c..cdc186ca592166 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00435,"35":0,"36":0,"37":0,"38":0,"39":0.00435,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00435,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.0261,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00435,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00435,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01305,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00435,"110":0.00435,"111":0,"112":0.00435,"113":0.0087,"114":0.01305,"115":0.19575,"116":0.4176,"117":0.0174,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00435,"30":0,"31":0,"32":0,"33":0,"34":0.00435,"35":0,"36":0,"37":0,"38":0.0174,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0087,"50":0,"51":0,"52":0,"53":0.01305,"54":0,"55":0.0087,"56":0.00435,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00435,"66":0,"67":0,"68":0,"69":0,"70":0.00435,"71":0.00435,"72":0,"73":0.00435,"74":0.0087,"75":0.0087,"76":0,"77":0,"78":0.01305,"79":0.1044,"80":0.00435,"81":0.02175,"83":0.0087,"84":0.00435,"85":0.0087,"86":0.01305,"87":0.05655,"88":0.0174,"89":0.0087,"90":0.00435,"91":0.03915,"92":0.01305,"93":0.00435,"94":0.00435,"95":0.00435,"96":0.0087,"97":0.0174,"98":0.0087,"99":0.1914,"100":0.0087,"101":0.0087,"102":0.0174,"103":0.0609,"104":0.0087,"105":0.0174,"106":0.0087,"107":0.0174,"108":0.0348,"109":1.18755,"110":0.0174,"111":0.03045,"112":0.04785,"113":0.07395,"114":0.40455,"115":7.06875,"116":3.74535,"117":0.01305,"118":0.0087,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0174,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01305,"37":0.00435,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.02175,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0087,"70":0.0087,"71":0.0348,"72":0.03045,"73":0,"74":0.00435,"75":0,"76":0,"77":0.00435,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0087,"96":0,"97":0,"98":0,"99":0.00435,"100":0.0957,"101":0.08265,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0174,"110":0,"111":0,"112":0.00435,"113":0.00435,"114":0.03045,"115":0.70905,"116":0.21315},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00435,"14":0.03045,"15":0.0087,"17":0.0087,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00435,"13.1":0.02175,"14.1":0.09135,"15.1":0.01305,"15.2-15.3":0.0174,"15.4":0.03915,"15.5":0.06525,"15.6":0.21315,"16.0":0.0174,"16.1":0.0783,"16.2":0.05655,"16.3":0.2001,"16.4":0.04785,"16.5":0.4524,"16.6":0.69165},G:{"8":0,"17":0.10568,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00705,"6.0-6.1":0.00235,"7.0-7.1":0.01644,"8.1-8.4":0.02583,"9.0-9.2":0.00939,"9.3":0.12916,"10.0-10.2":0.00235,"10.3":0.29354,"11.0-11.2":0.00705,"11.3-11.4":0.00939,"12.0-12.1":0.01879,"12.2-12.5":0.36165,"13.0-13.1":0.0047,"13.2":0.0047,"13.3":0.01409,"13.4-13.7":0.05401,"14.0-14.4":0.18552,"14.5-14.8":0.36165,"15.0-15.1":0.15029,"15.2-15.3":0.1362,"15.4":0.22544,"15.5":0.30529,"15.6-15.7":1.78475,"16.0":0.96283,"16.1":1.33622,"16.2":0.92525,"16.3":1.58514,"16.4":0.42036,"16.5":4.76247,"16.6":9.26428},P:{"4":0.50647,"20":0.06331,"21":0.15827,"5.0-5.4":0.07386,"6.2-6.4":0.01055,"7.2-7.4":0.0211,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01055,"12.0":0,"13.0":0.01055,"14.0":0,"15.0":0.01055,"16.0":0.0211,"17.0":0.01055,"18.0":0.0211,"19.0":0.04221},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.07305},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03915,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":53.0914},R:{_:"0"},M:{"0":0.2034},Q:{"13.1":0.0113},O:{"0":0.8136},H:{"0":0.47607}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00425,"35":0,"36":0,"37":0,"38":0,"39":0.00425,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00849,"49":0,"50":0,"51":0,"52":0.00425,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.02124,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00425,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00425,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00849,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00425,"111":0,"112":0.00425,"113":0.00425,"114":0.00425,"115":0.09343,"116":0.03398,"117":0.39922,"118":0.03398,"119":0.00425,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00425,"30":0,"31":0,"32":0,"33":0,"34":0.00425,"35":0,"36":0,"37":0,"38":0.01699,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00849,"50":0,"51":0,"52":0,"53":0.01274,"54":0,"55":0.00849,"56":0.00425,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00425,"66":0,"67":0,"68":0,"69":0,"70":0.00425,"71":0.00425,"72":0.00425,"73":0.00425,"74":0.00849,"75":0.00425,"76":0,"77":0,"78":0.00849,"79":0.08919,"80":0.00425,"81":0.02124,"83":0.00849,"84":0.00425,"85":0.00849,"86":0.01274,"87":0.05521,"88":0.01699,"89":0.00849,"90":0.00425,"91":0.03398,"92":0.01274,"93":0.00425,"94":0.00849,"95":0.00425,"96":0.00425,"97":0.01274,"98":0.00849,"99":0.18262,"100":0.00849,"101":0.00425,"102":0.01274,"103":0.05946,"104":0.00849,"105":0.02124,"106":0.00849,"107":0.01699,"108":0.03398,"109":1.03202,"110":0.01699,"111":0.03398,"112":0.04247,"113":0.05521,"114":0.14865,"115":0.27606,"116":8.36234,"117":2.0598,"118":0.01274,"119":0.00425,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01274,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00849,"37":0.00425,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01699,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00849,"70":0.00425,"71":0.00849,"72":0.05521,"73":0.01274,"74":0.00425,"75":0,"76":0,"77":0.02124,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00849,"96":0,"97":0,"98":0,"99":0,"100":0.02124,"101":0.07645,"102":0.08494,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01274,"110":0,"111":0,"112":0,"113":0.00425,"114":0.00849,"115":0.02124,"116":0.4969,"117":0.37798},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00425,"14":0.02548,"15":0.00849,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00425,"13.1":0.02124,"14.1":0.07645,"15.1":0.01274,"15.2-15.3":0.01274,"15.4":0.02973,"15.5":0.05096,"15.6":0.16988,"16.0":0.01274,"16.1":0.06371,"16.2":0.04247,"16.3":0.14015,"16.4":0.02973,"16.5":0.11042,"16.6":0.94708,"17.0":0.05096,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00488,"6.0-6.1":0,"7.0-7.1":0.01463,"8.1-8.4":0.01707,"9.0-9.2":0.01219,"9.3":0.10484,"10.0-10.2":0,"10.3":0.26087,"11.0-11.2":0.00244,"11.3-11.4":0.00488,"12.0-12.1":0.01463,"12.2-12.5":0.31695,"13.0-13.1":0.00731,"13.2":0,"13.3":0.02438,"13.4-13.7":0.04389,"14.0-14.4":0.16091,"14.5-14.8":0.31939,"15.0-15.1":0.14141,"15.2-15.3":0.12434,"15.4":0.22187,"15.5":0.26331,"15.6-15.7":1.71153,"16.0":1.01424,"16.1":1.23367,"16.2":0.8387,"16.3":1.42628,"16.4":0.38766,"16.5":1.37508,"16.6":12.72435,"17.0":1.37264,"17.1":0},P:{"4":0.40128,"20":0.06336,"21":0.11616,"22":1.58399,"5.0-5.4":0.06336,"6.2-6.4":0.01056,"7.2-7.4":0.03168,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01056,"12.0":0,"13.0":0.01056,"14.0":0,"15.0":0.01056,"16.0":0.02112,"17.0":0.01056,"18.0":0.01056,"19.0":0.03168},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.06274},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03822,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":53.57114},R:{_:"0"},M:{"0":0.1956},Q:{"13.1":0.01151},O:{"0":0.83419},H:{"0":0.51198}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MZ.js
index 620e46f4aa5b0d..7baa4f981ce5ca 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/MZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0.00392,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00392,"51":0,"52":0.00784,"53":0,"54":0.00784,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00784,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00784,"90":0,"91":0.00784,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00392,"101":0,"102":0.02351,"103":0,"104":0.01176,"105":0.00392,"106":0,"107":0.00392,"108":0,"109":0.00392,"110":0,"111":0,"112":0.00784,"113":0.01176,"114":0.00392,"115":0.15676,"116":0.27825,"117":0.01176,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00392,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00392,"41":0,"42":0,"43":0.00392,"44":0,"45":0,"46":0,"47":0.00392,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00784,"56":0.00392,"57":0.00784,"58":0.00784,"59":0,"60":0.0196,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00392,"70":0.01568,"71":0,"72":0,"73":0,"74":0.01176,"75":0,"76":0,"77":0,"78":0.00392,"79":0.00392,"80":0.01568,"81":0.07838,"83":0,"84":0,"85":0.00784,"86":0,"87":0.01568,"88":0.00392,"89":0,"90":0.01568,"91":0.03135,"92":0.02743,"93":0.00392,"94":0.03135,"95":0.01568,"96":0.00392,"97":0.00392,"98":0.00392,"99":0.00392,"100":0.00392,"101":0,"102":0.00784,"103":0.02743,"104":0.0196,"105":0.03135,"106":0.00392,"107":0.00392,"108":0.01176,"109":1.113,"110":0.01176,"111":0.02351,"112":0.01568,"113":0.03919,"114":0.20379,"115":2.59046,"116":1.70085,"117":0.00392,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00392,"27":0,"28":0.00392,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00784,"36":0,"37":0.02351,"38":0.0196,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.05487,"47":0,"48":0,"49":0,"50":0.00392,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00392,"58":0.0196,"60":0.04703,"62":0,"63":0.04703,"64":0.0196,"65":0.02351,"66":0.0196,"67":0.03135,"68":0.01176,"69":0.13325,"70":0.16852,"71":0.29001,"72":0.16852,"73":0,"74":0.01176,"75":0,"76":0.03527,"77":0.00392,"78":0,"79":0.00784,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.07446,"96":0,"97":0,"98":0,"99":0.00784,"100":0.07838,"101":0.29393,"102":0.00392,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00392},B:{"12":0.02351,"13":0.00784,"14":0.00784,"15":0.00392,"16":0,"17":0,"18":0.01568,"79":0,"80":0,"81":0,"83":0,"84":0.00392,"85":0,"86":0,"87":0,"88":0,"89":0.00392,"90":0,"91":0,"92":0.01568,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00392,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00392,"109":0.04311,"110":0.00392,"111":0.00392,"112":0.01568,"113":0.01568,"114":0.05487,"115":0.98759,"116":0.39582},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0196,"14.1":0.00392,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00392,"15.6":0.00784,"16.0":0,"16.1":0.00392,"16.2":0,"16.3":0.01176,"16.4":0.00392,"16.5":0.0196,"16.6":0.0196},G:{"8":0.02009,"17":0.03348,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00149,"6.0-6.1":0,"7.0-7.1":0.0119,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02381,"10.0-10.2":0,"10.3":0.0729,"11.0-11.2":0.00595,"11.3-11.4":0.00446,"12.0-12.1":0.04463,"12.2-12.5":1.008,"13.0-13.1":0.02083,"13.2":0.01562,"13.3":0.03571,"13.4-13.7":0.16812,"14.0-14.4":0.47833,"14.5-14.8":0.48354,"15.0-15.1":0.12646,"15.2-15.3":0.09373,"15.4":0.14878,"15.5":0.2083,"15.6-15.7":1.35987,"16.0":0.14506,"16.1":0.1949,"16.2":0.21425,"16.3":0.45602,"16.4":0.20978,"16.5":0.77441,"16.6":1.07198},P:{"4":0.19634,"20":0.093,"21":0.16534,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.13434,"8.2":0,"9.2":0.02067,"10.1":0.01033,"11.1-11.2":0.02067,"12.0":0,"13.0":0.01033,"14.0":0.02067,"15.0":0.01033,"16.0":0.05167,"17.0":0.05167,"18.0":0.02067,"19.0":0.23768},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00256,"4.2-4.3":0.00298,"4.4":0,"4.4.3-4.4.4":0.23217},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.00784,"10":0,"11":0.01568,"5.5":0},S:{"2.5":0.7358,_:"3.0-3.1"},J:{"7":0,"10":0.00608},N:{"10":0,"11":0},L:{"0":71.21609},R:{_:"0"},M:{"0":0.06689},Q:{"13.1":0.00608},O:{"0":0.23716},H:{"0":5.64196}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0.0039,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.0039,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.0078,"51":0,"52":0.0078,"53":0,"54":0.0078,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0039,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0039,"96":0,"97":0.0039,"98":0,"99":0,"100":0.0039,"101":0,"102":0.0117,"103":0,"104":0.0078,"105":0,"106":0,"107":0.0039,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.0117,"114":0.0039,"115":0.10533,"116":0.02341,"117":0.28087,"118":0.02341,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0039,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.0078,"41":0,"42":0,"43":0.0039,"44":0,"45":0,"46":0,"47":0.0039,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.0078,"56":0,"57":0.0078,"58":0.0039,"59":0,"60":0.02731,"61":0,"62":0,"63":0.0039,"64":0.0039,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.0156,"71":0,"72":0,"73":0,"74":0.0078,"75":0,"76":0,"77":0,"78":0,"79":0.0039,"80":0.0117,"81":0.10533,"83":0.0039,"84":0,"85":0.0078,"86":0,"87":0.02341,"88":0.0078,"89":0.0039,"90":0.03121,"91":0.01951,"92":0.03511,"93":0.0039,"94":0.0156,"95":0.01951,"96":0.0039,"97":0.0039,"98":0,"99":0.0039,"100":0.0039,"101":0.0078,"102":0.0117,"103":0.02731,"104":0.01951,"105":0.0078,"106":0.0039,"107":0.0039,"108":0.0117,"109":0.90893,"110":0.0078,"111":0.0156,"112":0.0156,"113":0.02731,"114":0.08972,"115":0.07022,"116":3.08179,"117":0.79971,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.0039,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.0039,"36":0,"37":0.02341,"38":0.0078,"39":0,"40":0,"41":0,"42":0.0039,"43":0,"44":0,"45":0,"46":0.01951,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.0039,"57":0.0039,"58":0.01951,"60":0.04291,"62":0,"63":0.05461,"64":0.03511,"65":0.0156,"66":0.02341,"67":0.02341,"68":0.0078,"69":0.10143,"70":0.12093,"71":0.10533,"72":0.28087,"73":0.04681,"74":0.0117,"75":0,"76":0.0156,"77":0.01951,"78":0,"79":0.0078,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.05071,"96":0,"97":0,"98":0,"99":0.0039,"100":0.01951,"101":0.15214,"102":0.17164,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.0039},B:{"12":0.0117,"13":0.0078,"14":0.0078,"15":0.0039,"16":0,"17":0,"18":0.0117,"79":0,"80":0,"81":0,"83":0,"84":0.0039,"85":0,"86":0,"87":0,"88":0,"89":0.0039,"90":0.0039,"91":0,"92":0.0156,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.0156,"109":0.02731,"110":0.0039,"111":0,"112":0.0117,"113":0.0078,"114":0.02731,"115":0.03121,"116":0.63976,"117":0.52273},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02341,"14.1":0.0039,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.01951,"16.0":0,"16.1":0,"16.2":0,"16.3":0.0039,"16.4":0.0039,"16.5":0.0039,"16.6":0.03511,"17.0":0.0039,"17.1":0},G:{"8":0.04211,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00148,"6.0-6.1":0.00222,"7.0-7.1":0.00887,"8.1-8.4":0,"9.0-9.2":0.00148,"9.3":0.0096,"10.0-10.2":0,"10.3":0.09604,"11.0-11.2":0.00296,"11.3-11.4":0.00296,"12.0-12.1":0.02512,"12.2-12.5":1.13029,"13.0-13.1":0.01625,"13.2":0.01625,"13.3":0.06132,"13.4-13.7":0.21202,"14.0-14.4":0.51713,"14.5-14.8":0.40336,"15.0-15.1":0.10786,"15.2-15.3":0.12042,"15.4":0.15071,"15.5":0.16991,"15.6-15.7":1.58758,"16.0":0.14997,"16.1":0.15144,"16.2":0.13519,"16.3":0.3546,"16.4":0.15292,"16.5":0.25265,"16.6":1.24111,"17.0":0.22237,"17.1":0},P:{"4":0.15589,"20":0.07275,"21":0.08314,"22":0.46767,"5.0-5.4":0.01039,"6.2-6.4":0,"7.2-7.4":0.13511,"8.2":0,"9.2":0.02079,"10.1":0.01039,"11.1-11.2":0.01039,"12.0":0,"13.0":0.01039,"14.0":0.02079,"15.0":0.06236,"16.0":0.05196,"17.0":0.04157,"18.0":0.01039,"19.0":0.13511},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00151,"4.2-4.3":0.00189,"4.4":0,"4.4.3-4.4.4":0.17412},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.0078,"10":0,"11":0.0156,"5.5":0},S:{"2.5":0.67699,_:"3.0-3.1"},J:{"7":0,"10":0.0061},N:{"10":0,"11":0},L:{"0":76.13624},R:{_:"0"},M:{"0":0.04879},Q:{"13.1":0},O:{"0":0.20127},H:{"0":3.47603}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NA.js
index e083a89af087d3..424be419ccdc8b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00727,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00364,"48":0,"49":0,"50":0,"51":0,"52":0.01091,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00727,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00727,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00364,"111":0,"112":0.00364,"113":0.00727,"114":0.01091,"115":0.24718,"116":0.46892,"117":0.01818,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00364,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00727,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00364,"70":0.00364,"71":0,"72":0,"73":0,"74":0.00727,"75":0,"76":0,"77":0,"78":0.00364,"79":0.00727,"80":0,"81":0.01818,"83":0.00727,"84":0,"85":0,"86":0,"87":0.00364,"88":0.00727,"89":0.00364,"90":0,"91":0.00364,"92":0,"93":0,"94":0,"95":0.00364,"96":0.00364,"97":0,"98":0.00364,"99":0.01091,"100":0,"101":0,"102":0.00364,"103":0.01818,"104":0.00364,"105":0.01818,"106":0.04362,"107":0.00364,"108":0.00364,"109":0.77062,"110":0.01091,"111":0.01091,"112":0.05089,"113":0.02545,"114":0.23628,"115":3.75132,"116":2.14829,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00727,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00727,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00364,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00364,"55":0,"56":0.00364,"57":0,"58":0,"60":0.01454,"62":0,"63":0.00364,"64":0,"65":0,"66":0,"67":0.00364,"68":0.00364,"69":0.05089,"70":0.04362,"71":0.21447,"72":0.34896,"73":0,"74":0.00364,"75":0,"76":0.00364,"77":0.00364,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03999,"96":0,"97":0,"98":0,"99":0.00364,"100":0.12723,"101":0.21083,"102":0.00364,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00364,"13":0.00364,"14":0,"15":0.00364,"16":0.00364,"17":0.00364,"18":0.01454,"79":0,"80":0,"81":0,"83":0,"84":0.00364,"85":0,"86":0,"87":0,"88":0,"89":0.00364,"90":0,"91":0,"92":0.01091,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00364,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00364,"107":0.00364,"108":0.00364,"109":0.0727,"110":0.00364,"111":0.00364,"112":0.08361,"113":0.01091,"114":0.0727,"115":1.52307,"116":0.47255},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00727,"15":0,"17":0.00364,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00364,"13.1":0.01091,"14.1":0.00727,"15.1":0,"15.2-15.3":0.00364,"15.4":0.00364,"15.5":0.01091,"15.6":0.03272,"16.0":0.00364,"16.1":0.01454,"16.2":0.00727,"16.3":0.02181,"16.4":0.01818,"16.5":0.10905,"16.6":0.10178},G:{"8":0,"17":0.07382,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00109,"5.0-5.1":0.01628,"6.0-6.1":0,"7.0-7.1":0.0608,"8.1-8.4":0.02388,"9.0-9.2":0,"9.3":0.1737,"10.0-10.2":0.00109,"10.3":0.05754,"11.0-11.2":0.00217,"11.3-11.4":0.0076,"12.0-12.1":0.00434,"12.2-12.5":0.63185,"13.0-13.1":0.01086,"13.2":0.01411,"13.3":0.01194,"13.4-13.7":0.0304,"14.0-14.4":0.34415,"14.5-14.8":0.19325,"15.0-15.1":0.04777,"15.2-15.3":0.09445,"15.4":0.04234,"15.5":0.09554,"15.6-15.7":1.44826,"16.0":0.28553,"16.1":0.53523,"16.2":0.24101,"16.3":0.57648,"16.4":0.12919,"16.5":1.96394,"16.6":3.73355},P:{"4":0.28658,"20":0.11259,"21":0.42988,"5.0-5.4":0,"6.2-6.4":0.13306,"7.2-7.4":0.47082,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02047,"12.0":0,"13.0":0.04094,"14.0":0.03071,"15.0":0.01024,"16.0":0.03071,"17.0":0.05118,"18.0":0.08188,"19.0":0.174},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00364,"4.2-4.3":0.00818,"4.4":0,"4.4.3-4.4.4":0.13361},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02908,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.97146},R:{_:"0"},M:{"0":0.20368},Q:{"13.1":0},O:{"0":0.46465},H:{"0":2.22961}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00379,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00379,"49":0,"50":0,"51":0,"52":0.01138,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00379,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00759,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00379,"113":0.00379,"114":0.00379,"115":0.16314,"116":0.03794,"117":0.52357,"118":0.04173,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.01138,"41":0,"42":0.00379,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00379,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00759,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00379,"66":0,"67":0,"68":0.00379,"69":0.00759,"70":0.00379,"71":0,"72":0,"73":0.00759,"74":0.00759,"75":0,"76":0,"77":0.00379,"78":0.00379,"79":0,"80":0,"81":0.06829,"83":0,"84":0,"85":0,"86":0,"87":0.00379,"88":0.01518,"89":0.00379,"90":0,"91":0,"92":0,"93":0.00759,"94":0.00379,"95":0.00379,"96":0.00379,"97":0.00379,"98":0,"99":0.01138,"100":0.00379,"101":0.00379,"102":0,"103":0.00759,"104":0.00379,"105":0.00379,"106":0.05691,"107":0.00759,"108":0.02656,"109":0.84986,"110":0.01518,"111":0.01138,"112":0.03415,"113":0.01518,"114":0.0645,"115":0.13279,"116":5.03843,"117":1.48345,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00379,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00379,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.01138,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.01138,"62":0,"63":0,"64":0,"65":0,"66":0.00379,"67":0,"68":0,"69":0.04553,"70":0.01138,"71":0.04173,"72":0.5084,"73":0.07209,"74":0.00379,"75":0,"76":0,"77":0.00759,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04173,"96":0,"97":0,"98":0,"99":0.00379,"100":0.03035,"101":0.14797,"102":0.129,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00379,"13":0,"14":0,"15":0,"16":0.00759,"17":0.00379,"18":0.01897,"79":0,"80":0,"81":0,"83":0,"84":0.00379,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00379,"91":0,"92":0.01138,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00379,"101":0,"102":0,"103":0.00379,"104":0,"105":0,"106":0,"107":0,"108":0.01138,"109":0.07588,"110":0.00379,"111":0.03035,"112":0.09106,"113":0.01518,"114":0.03415,"115":0.03794,"116":1.24443,"117":0.89918},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00759,"14":0.00379,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0.00379,"11.1":0,"12.1":0.00379,"13.1":0.02276,"14.1":0.01897,"15.1":0,"15.2-15.3":0,"15.4":0.00379,"15.5":0.00759,"15.6":0.02656,"16.0":0,"16.1":0.01138,"16.2":0.00759,"16.3":0.03415,"16.4":0.01138,"16.5":0.03035,"16.6":0.24661,"17.0":0.01518,"17.1":0},G:{"8":0.00209,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00209,"5.0-5.1":0.00939,"6.0-6.1":0.01148,"7.0-7.1":0.04799,"8.1-8.4":0.01043,"9.0-9.2":0.00104,"9.3":0.22014,"10.0-10.2":0,"10.3":0.04904,"11.0-11.2":0.00209,"11.3-11.4":0.00522,"12.0-12.1":0.00209,"12.2-12.5":0.65728,"13.0-13.1":0,"13.2":0.00104,"13.3":0.00313,"13.4-13.7":0.01461,"14.0-14.4":0.17319,"14.5-14.8":0.13667,"15.0-15.1":0.05842,"15.2-15.3":0.06677,"15.4":0.03547,"15.5":0.06781,"15.6-15.7":1.82265,"16.0":0.17423,"16.1":0.51435,"16.2":0.17632,"16.3":0.45488,"16.4":0.0772,"16.5":0.43401,"16.6":4.61348,"17.0":0.44862,"17.1":0},P:{"4":0.36788,"20":0.11241,"21":0.20438,"22":2.81023,"5.0-5.4":0.01022,"6.2-6.4":0.02044,"7.2-7.4":0.28613,"8.2":0,"9.2":0,"10.1":0.02044,"11.1-11.2":0.01022,"12.0":0,"13.0":0.03066,"14.0":0.03066,"15.0":0.01022,"16.0":0.03066,"17.0":0.10219,"18.0":0.03066,"19.0":0.17372},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00363,"4.2-4.3":0.00726,"4.4":0,"4.4.3-4.4.4":0.14155},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0645,"5.5":0},S:{"2.5":0.00621,_:"3.0-3.1"},J:{"7":0,"10":0.00621},N:{"10":0,"11":0},L:{"0":66.9657},R:{_:"0"},M:{"0":0.08688},Q:{"13.1":0.01241},O:{"0":0.47166},H:{"0":2.33843}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NC.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NC.js
index ce0ffe65aa30b0..55bcdd868bdb2a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NC.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NC.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.07415,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00494,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00494,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0346,"79":0,"80":0.00989,"81":0,"82":0.01483,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00989,"89":0.00494,"90":0,"91":0.02472,"92":0,"93":0,"94":0.00494,"95":0,"96":0,"97":0.00494,"98":0,"99":0,"100":0.00494,"101":0,"102":0.28175,"103":0.00494,"104":0.00989,"105":0,"106":0.00494,"107":0.00494,"108":0.00494,"109":0,"110":0.01483,"111":0,"112":0.00494,"113":0.01977,"114":0.05932,"115":0.89963,"116":2.23424,"117":0.07415,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00989,"50":0,"51":0,"52":0,"53":0.00494,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00989,"66":0,"67":0.00494,"68":0,"69":0,"70":0.00494,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00989,"77":0.00494,"78":0,"79":0.02472,"80":0,"81":0.05437,"83":0.01483,"84":0.03954,"85":0,"86":0,"87":0.01977,"88":0,"89":0,"90":0.00989,"91":0,"92":0,"93":0,"94":0.01977,"95":0,"96":0.00989,"97":0.02472,"98":0.00494,"99":0.00494,"100":0,"101":0.00494,"102":0,"103":0.07909,"104":0,"105":0,"106":0.00989,"107":0.00989,"108":0.00989,"109":0.92434,"110":0.00494,"111":0.00989,"112":0.03954,"113":0.02472,"114":0.74145,"115":5.42247,"116":3.12892,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00494,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.01977,"91":0,"92":0,"93":0.00494,"94":0,"95":0.00494,"96":0,"97":0,"98":0,"99":0.01977,"100":0.25209,"101":0.26198,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00494,"18":0.01483,"79":0,"80":0,"81":0,"83":0,"84":0.01483,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00494,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00494,"101":0,"102":0,"103":0.00494,"104":0,"105":0.00494,"106":0,"107":0,"108":0.00494,"109":0.04449,"110":0.00989,"111":0.00989,"112":0.00989,"113":0.00989,"114":0.59316,"115":2.52093,"116":1.10723},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.00494,"13":0.00989,"14":0.11863,"15":0.00494,"17":0.00989,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0.04449,"11.1":0.00989,"12.1":0.03954,"13.1":0.12852,"14.1":0.14829,"15.1":0.02472,"15.2-15.3":0.01977,"15.4":0.04449,"15.5":0.04943,"15.6":0.38061,"16.0":0.04943,"16.1":0.08403,"16.2":0.05932,"16.3":0.17301,"16.4":0.07909,"16.5":0.85514,"16.6":1.22586},G:{"8":0,"17":0.09261,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05556,"10.0-10.2":0,"10.3":0.08026,"11.0-11.2":0.00412,"11.3-11.4":0.00823,"12.0-12.1":0.00617,"12.2-12.5":0.32721,"13.0-13.1":0.01029,"13.2":0,"13.3":0.21814,"13.4-13.7":0.04733,"14.0-14.4":0.11524,"14.5-14.8":0.31692,"15.0-15.1":0.19344,"15.2-15.3":0.08026,"15.4":0.27987,"15.5":0.12553,"15.6-15.7":1.23063,"16.0":0.5865,"16.1":1.39526,"16.2":0.30457,"16.3":1.58253,"16.4":0.32309,"16.5":3.44905,"16.6":9.74005},P:{"4":0.04172,"20":0.25032,"21":0.61537,"5.0-5.4":0.01043,"6.2-6.4":0,"7.2-7.4":0.37548,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02086,"12.0":0.01043,"13.0":0.02086,"14.0":0.03129,"15.0":0.02086,"16.0":0.14602,"17.0":0.01043,"18.0":0.03129,"19.0":0.61537},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00244,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.14653},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00989,"5.5":0},S:{"2.5":0.00506,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":46.82731},R:{_:"0"},M:{"0":0.49559},Q:{"13.1":0},O:{"0":0.02529},H:{"0":0.06224}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.05705,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00519,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01037,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02593,"79":0,"80":0.00519,"81":0,"82":0.00519,"83":0.01556,"84":0,"85":0,"86":0,"87":0,"88":0.02593,"89":0.00519,"90":0,"91":0.03112,"92":0,"93":0.00519,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.31116,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00519,"109":0.00519,"110":0,"111":0.00519,"112":0.00519,"113":0.03112,"114":0.00519,"115":0.30079,"116":0.28004,"117":4.29919,"118":0.16077,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00519,"50":0,"51":0,"52":0,"53":0.01037,"54":0,"55":0,"56":0.01037,"57":0,"58":0,"59":0,"60":0,"61":0.00519,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.01556,"76":0.00519,"77":0,"78":0,"79":0.01037,"80":0,"81":0.04149,"83":0,"84":0,"85":0,"86":0.00519,"87":0.00519,"88":0.01037,"89":0,"90":0.00519,"91":0,"92":0.00519,"93":0,"94":0.02074,"95":0.00519,"96":0.01037,"97":0.01037,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.07779,"104":0.00519,"105":0,"106":0,"107":0.02593,"108":0,"109":0.99053,"110":0.00519,"111":0.00519,"112":0.04667,"113":0.02074,"114":0.47193,"115":0.17632,"116":7.41598,"117":2.68116,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00519,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00519,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.02074,"101":0.24374,"102":0.25411,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00519,"18":0.03112,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.02593,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00519,"107":0,"108":0,"109":0.02593,"110":0.01037,"111":0.01037,"112":0.01037,"113":0.00519,"114":0.52379,"115":0.05186,"116":2.01217,"117":1.42096},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00519,"14":0.05705,"15":0.01037,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0.01556,"11.1":0.00519,"12.1":0.02593,"13.1":0.07779,"14.1":0.15558,"15.1":0.01037,"15.2-15.3":0.01037,"15.4":0.02074,"15.5":0.0363,"15.6":0.20225,"16.0":0.05186,"16.1":0.06742,"16.2":0.05186,"16.3":0.10891,"16.4":0.04149,"16.5":0.223,"16.6":1.86177,"17.0":0.01037,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0023,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.0046,"9.3":0.04136,"10.0-10.2":0,"10.3":0.04596,"11.0-11.2":0.0046,"11.3-11.4":0.00689,"12.0-12.1":0,"12.2-12.5":0.34011,"13.0-13.1":0.00919,"13.2":0,"13.3":0.19074,"13.4-13.7":0.0046,"14.0-14.4":0.10111,"14.5-14.8":0.17465,"15.0-15.1":0.41364,"15.2-15.3":0.03677,"15.4":0.14937,"15.5":0.1126,"15.6-15.7":1.20875,"16.0":0.35849,"16.1":1.02262,"16.2":0.32402,"16.3":1.02951,"16.4":0.20223,"16.5":0.65493,"16.6":15.3829,"17.0":0.91461,"17.1":0.0046},P:{"4":0.01033,"20":0.10332,"21":0.21697,"22":4.03982,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.27896,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02066,"12.0":0,"13.0":0.02066,"14.0":0.02066,"15.0":0.02066,"16.0":0.08266,"17.0":0.01033,"18.0":0.031,"19.0":0.36162},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01801,"4.4":0,"4.4.3-4.4.4":0.23868},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01037,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":42.46239},R:{_:"0"},M:{"0":0.52473},Q:{"13.1":0},O:{"0":0.0674},H:{"0":0.0319}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NE.js
index 18debb84a6c43d..96c1b20cd21455 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00203,"98":0,"99":0,"100":0,"101":0,"102":0.00203,"103":0.00203,"104":0.01422,"105":0,"106":0.01016,"107":0,"108":0,"109":0,"110":0,"111":0.00203,"112":0.00203,"113":0.0061,"114":0.01626,"115":0.09957,"116":0.16053,"117":0.00406,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00203,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00203,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00406,"76":0,"77":0.00203,"78":0,"79":0.06096,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00203,"103":0.00203,"104":0,"105":0.00203,"106":0.00203,"107":0,"108":0,"109":0.11582,"110":0,"111":0.00406,"112":0.00406,"113":0.00203,"114":0.05283,"115":0.49581,"116":0.21742,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0.00406,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00813,"27":0,"28":0.00203,"29":0,"30":0.00813,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00813,"38":0,"39":0,"40":0,"41":0,"42":0.00203,"43":0,"44":0,"45":0,"46":0.01219,"47":0,"48":0,"49":0,"50":0.00203,"51":0,"52":0,"53":0,"54":0,"55":0.00406,"56":0,"57":0.0061,"58":0.00203,"60":0.07722,"62":0,"63":0.04064,"64":0.0061,"65":0.00203,"66":0.01422,"67":0.02032,"68":0.00813,"69":0.07112,"70":0.0447,"71":0.14224,"72":0.09754,"73":0,"74":0,"75":0,"76":0.00203,"77":0,"78":0,"79":0.00203,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01422,"96":0,"97":0,"98":0,"99":0,"100":0.0447,"101":0.03658,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00203,"11.5":0,"11.6":0,"12.1":0.00203},B:{"12":0,"13":0,"14":0,"15":0,"16":0.00203,"17":0,"18":0.00203,"79":0,"80":0,"81":0,"83":0,"84":0.00203,"85":0,"86":0,"87":0,"88":0,"89":0.01219,"90":0.00203,"91":0,"92":0.00203,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00203,"104":0,"105":0.01626,"106":0,"107":0,"108":0,"109":0.01626,"110":0,"111":0.00406,"112":0.00406,"113":0.01016,"114":0.05283,"115":0.30886,"116":0.06299},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.01626,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00203,"15.1":1.12776,"15.2-15.3":0.00813,"15.4":0.01219,"15.5":0.00406,"15.6":0.00203,"16.0":0,"16.1":0.00203,"16.2":0,"16.3":0.00203,"16.4":0.00203,"16.5":0.00203,"16.6":0.01016},G:{"8":0,"17":0.06547,"3.2":0,"4.0-4.1":0.00216,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01079,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01295,"10.0-10.2":0,"10.3":0.0705,"11.0-11.2":0.00216,"11.3-11.4":0,"12.0-12.1":0.00072,"12.2-12.5":0.53526,"13.0-13.1":0.00504,"13.2":0.00504,"13.3":0.0036,"13.4-13.7":0.03885,"14.0-14.4":0.15612,"14.5-14.8":1.02806,"15.0-15.1":0.09928,"15.2-15.3":0.08345,"15.4":0.05252,"15.5":0.21367,"15.6-15.7":0.71511,"16.0":0.30216,"16.1":0.26475,"16.2":0.43094,"16.3":0.53382,"16.4":0.37914,"16.5":1.26979,"16.6":0.91296},P:{"4":0.08121,"20":0.07106,"21":0.23347,"5.0-5.4":0.08121,"6.2-6.4":0.01015,"7.2-7.4":0.07106,"8.2":0,"9.2":0.07106,"10.1":0.01015,"11.1-11.2":0.03045,"12.0":0,"13.0":0.14211,"14.0":0.01015,"15.0":0.01015,"16.0":0.0406,"17.0":0.01015,"18.0":0.0203,"19.0":0.06091},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.04813},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03861,"5.5":0},S:{"2.5":0.06374,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":80.46486},R:{_:"0"},M:{"0":0.07171},Q:{"13.1":0.06374},O:{"0":0.81274},H:{"0":4.56387}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00279,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00279,"104":0,"105":0,"106":0.01953,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00279,"114":0.00279,"115":0.0558,"116":0.01674,"117":0.18693,"118":0.00837,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00279,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.06696,"80":0,"81":0,"83":0,"84":0,"85":0.00279,"86":0,"87":0.00279,"88":0,"89":0,"90":0.00279,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00279,"103":0.00279,"104":0,"105":0,"106":0.00279,"107":0,"108":0,"109":0.09486,"110":0,"111":0,"112":0.00279,"113":0.00279,"114":0.01674,"115":0.01953,"116":0.6696,"117":0.10602,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00279,"27":0,"28":0.00279,"29":0,"30":0.00279,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.0279,"38":0,"39":0,"40":0,"41":0,"42":0.00279,"43":0,"44":0,"45":0,"46":0.01674,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00279,"60":0.04185,"62":0,"63":0.03348,"64":0.00279,"65":0,"66":0.01116,"67":0.03069,"68":0.00279,"69":0.06696,"70":0.03069,"71":0.05301,"72":0.24552,"73":0.01395,"74":0,"75":0,"76":0,"77":0.01395,"78":0.00279,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01953,"96":0,"97":0,"98":0,"99":0,"100":0.00837,"101":0.02232,"102":0.03906,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00279},B:{"12":0.00558,"13":0,"14":0,"15":0,"16":0,"17":0.00279,"18":0.00279,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00279,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00558,"103":0,"104":0,"105":0.00837,"106":0,"107":0,"108":0,"109":0.03069,"110":0,"111":0.00279,"112":0.00837,"113":0.01116,"114":0.01116,"115":0.03348,"116":0.1674,"117":0.13113},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01395,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00279,"14.1":0.04464,"15.1":4.15989,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00837,"16.0":0,"16.1":0,"16.2":0.00279,"16.3":0.00558,"16.4":0,"16.5":0,"16.6":0.02232,"17.0":0,"17.1":0},G:{"8":0.0014,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02944,"6.0-6.1":0,"7.0-7.1":0.0021,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00701,"10.0-10.2":0,"10.3":0.08831,"11.0-11.2":0.0007,"11.3-11.4":0,"12.0-12.1":0.00561,"12.2-12.5":1.12555,"13.0-13.1":0.0021,"13.2":0.00911,"13.3":0.00631,"13.4-13.7":0.02663,"14.0-14.4":0.12545,"14.5-14.8":0.92931,"15.0-15.1":0.10933,"15.2-15.3":0.0799,"15.4":0.02873,"15.5":0.07149,"15.6-15.7":0.91319,"16.0":0.28664,"16.1":0.10162,"16.2":0.26001,"16.3":0.35883,"16.4":0.28244,"16.5":0.73027,"16.6":1.17671,"17.0":0.21936,"17.1":0},P:{"4":0.0403,"20":0.06045,"21":0.07053,"22":0.37279,"5.0-5.4":0,"6.2-6.4":0.01008,"7.2-7.4":0.05038,"8.2":0,"9.2":0.05038,"10.1":0,"11.1-11.2":0.02015,"12.0":0,"13.0":0.03023,"14.0":0,"15.0":0,"16.0":0.02015,"17.0":0,"18.0":0.03023,"19.0":0.03023},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.04116},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02232,"5.5":0},S:{"2.5":0.06489,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":80.01709},R:{_:"0"},M:{"0":0.03605},Q:{"13.1":0.03605},O:{"0":0.87962},H:{"0":3.14677}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NF.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NF.js
index 40676005a24303..3d99f1bfb9bdf5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NF.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NF.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.39511,"116":1.08175,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.98202,"110":0,"111":0,"112":0,"113":0.09974,"114":0,"115":3.54063,"116":0.98202,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":1.57276,"116":0.68664},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":1.08175,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.09974,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.49101,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0.19564,"16.5":0.68664,"16.6":0.09974},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":4.86193,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0.60677,"15.4":0.30338,"15.5":0,"15.6-15.7":6.37885,"16.0":0,"16.1":3.34112,"16.2":2.43096,"16.3":3.34112,"16.4":0,"16.5":6.68612,"16.6":10.94128},P:{"4":0,"20":0,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":1.37712,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":40.933},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.04645,"116":0.04645,"117":0.27579,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.50512,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":2.11629,"117":0.36868,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":1.33538,"117":2.66786},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.13934,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0.22934,"16.5":0,"16.6":0.0929,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":3.83209,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0.57455,"15.5":0,"15.6-15.7":4.98647,"16.0":0.76431,"16.1":21.65897,"16.2":0.18976,"16.3":0.95934,"16.4":0,"16.5":0.57455,"16.6":19.16574,"17.0":0,"17.1":0},P:{"4":0,"20":0,"21":0.66737,"22":9.39617,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04645,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":26.20603},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NG.js
index b8fdbe2bf7f919..485f6dfe0e62de 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00157,"44":0,"45":0,"46":0,"47":0.00157,"48":0,"49":0,"50":0,"51":0,"52":0.00157,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00157,"69":0,"70":0,"71":0,"72":0.00157,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00157,"100":0,"101":0.00157,"102":0.00315,"103":0.00157,"104":0,"105":0.00157,"106":0,"107":0.00157,"108":0.00157,"109":0.00157,"110":0.00157,"111":0.00315,"112":0.00315,"113":0.00315,"114":0.00472,"115":0.10696,"116":0.05663,"117":0.00315,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00157,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00157,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00157,"59":0.00157,"60":0,"61":0,"62":0.00157,"63":0.00157,"64":0.00157,"65":0,"66":0,"67":0,"68":0.00157,"69":0,"70":0.00157,"71":0,"72":0.00157,"73":0,"74":0.00157,"75":0.00157,"76":0.00157,"77":0.00157,"78":0,"79":0.00315,"80":0.00315,"81":0.00787,"83":0.00157,"84":0,"85":0.00157,"86":0.00157,"87":0.00315,"88":0.00157,"89":0,"90":0.00157,"91":0.00315,"92":0.00157,"93":0.01101,"94":0.00157,"95":0.00315,"96":0.00157,"97":0.00157,"98":0.00157,"99":0.00157,"100":0.00157,"101":0.00157,"102":0.00315,"103":0.00787,"104":0.00157,"105":0.00629,"106":0.00472,"107":0.00315,"108":0.00472,"109":0.13842,"110":0.00472,"111":0.00629,"112":0.00787,"113":0.00944,"114":0.05977,"115":0.45774,"116":0.22179,"117":0.00157,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.01258,"25":0,"26":0.00787,"27":0.01888,"28":0.01258,"29":0.00157,"30":0.01258,"31":0.00629,"32":0.01416,"33":0.00629,"34":0,"35":0.00157,"36":0.00157,"37":0.00472,"38":0.00629,"39":0.00157,"40":0,"41":0,"42":0.01258,"43":0,"44":0.00157,"45":0.00315,"46":0.00787,"47":0.00472,"48":0,"49":0,"50":0.01258,"51":0.00787,"52":0,"53":0.00157,"54":0.00944,"55":0.00787,"56":0.00157,"57":0.01101,"58":0.02202,"60":0.14,"62":0.00315,"63":0.12741,"64":0.02674,"65":0.01573,"66":0.0991,"67":0.10539,"68":0.06921,"69":0.4892,"70":0.36022,"71":0.68426,"72":0.2564,"73":0.00472,"74":0.0173,"75":0.00944,"76":0.02202,"77":0.00472,"78":0,"79":0.00315,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00472,"96":0,"97":0,"98":0.00157,"99":0.00157,"100":0.0173,"101":0.02674,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01258},B:{"12":0.00157,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00315,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00157,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00157,"110":0.00157,"111":0.00157,"112":0.00157,"113":0.00157,"114":0.00944,"115":0.08022,"116":0.02045},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00157,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00157,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00157,"14.1":0.00315,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00157,"15.6":0.00629,"16.0":0,"16.1":0.00157,"16.2":0.00157,"16.3":0.00315,"16.4":0.00157,"16.5":0.00629,"16.6":0.00472},G:{"8":0.00774,"17":0.03612,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00172,"5.0-5.1":0.00172,"6.0-6.1":0,"7.0-7.1":0.00688,"8.1-8.4":0.00086,"9.0-9.2":0,"9.3":0.01806,"10.0-10.2":0.00172,"10.3":0.0215,"11.0-11.2":0.03182,"11.3-11.4":0.00172,"12.0-12.1":0.02838,"12.2-12.5":0.53149,"13.0-13.1":0.02236,"13.2":0.00602,"13.3":0.03096,"13.4-13.7":0.0774,"14.0-14.4":0.41883,"14.5-14.8":0.3913,"15.0-15.1":0.50483,"15.2-15.3":0.25198,"15.4":0.17458,"15.5":0.26832,"15.6-15.7":1.2582,"16.0":0.46011,"16.1":0.47817,"16.2":0.41625,"16.3":0.69059,"16.4":0.41453,"16.5":1.13607,"16.6":0.90731},P:{"4":0.04111,"20":0.06166,"21":0.14388,"22":0.33914,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.04111,"8.2":0,"9.2":0.03083,"10.1":0,"11.1-11.2":0.02055,"12.0":0,"13.0":0.01028,"14.0":0.01028,"15.0":0.01028,"16.0":0.04111,"17.0":0.02055,"18.0":0.02055,"19.0":0.05138},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00088,"4.2-4.3":0.00352,"4.4":0,"4.4.3-4.4.4":0.06504},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00157,"5.5":0},S:{"2.5":0.04214,_:"3.0-3.1"},J:{"7":0,"10":0.00843},N:{"10":0,"11":0},L:{"0":54.4417},R:{_:"0"},M:{"0":0.2191},Q:{"13.1":0.00843},O:{"0":0.83427},H:{"0":26.89431}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00166,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00166,"69":0,"70":0,"71":0,"72":0.00166,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00166,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00166,"100":0,"101":0.00166,"102":0.00331,"103":0,"104":0,"105":0,"106":0.00166,"107":0.00166,"108":0.00166,"109":0.00166,"110":0.00166,"111":0.00166,"112":0.00331,"113":0.00331,"114":0.00331,"115":0.10102,"116":0.01325,"117":0.0679,"118":0.00662,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00166,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00166,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00166,"60":0,"61":0,"62":0.00166,"63":0.00166,"64":0.00166,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00331,"71":0,"72":0.00166,"73":0,"74":0.00331,"75":0.00166,"76":0.00331,"77":0.00166,"78":0,"79":0.00331,"80":0.00331,"81":0.00828,"83":0,"84":0,"85":0.00166,"86":0.00166,"87":0.00331,"88":0.00166,"89":0.00166,"90":0.00166,"91":0.00166,"92":0.00166,"93":0.04802,"94":0.00166,"95":0.00331,"96":0.00166,"97":0.00166,"98":0,"99":0.00166,"100":0.00166,"101":0.00166,"102":0.00166,"103":0.00662,"104":0.00166,"105":0.00497,"106":0.00331,"107":0.00331,"108":0.00497,"109":0.14076,"110":0.00331,"111":0.00662,"112":0.00662,"113":0.00662,"114":0.02484,"115":0.03146,"116":0.61769,"117":0.13579,"118":0.00166,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.0149,"25":0,"26":0.00828,"27":0.01822,"28":0.01656,"29":0.00166,"30":0.01159,"31":0.00662,"32":0.01656,"33":0.00662,"34":0,"35":0.00166,"36":0.00166,"37":0.00497,"38":0.00828,"39":0.00166,"40":0,"41":0.00166,"42":0.01325,"43":0,"44":0.00166,"45":0.00166,"46":0.00828,"47":0.00497,"48":0,"49":0,"50":0.01159,"51":0.00662,"52":0,"53":0.00166,"54":0.00828,"55":0.00662,"56":0.00331,"57":0.00994,"58":0.02153,"60":0.13745,"62":0.00166,"63":0.1242,"64":0.02484,"65":0.01325,"66":0.09274,"67":0.09936,"68":0.06624,"69":0.3577,"70":0.23018,"71":0.45374,"72":0.91908,"73":0.13579,"74":0.00994,"75":0.00497,"76":0.00994,"77":0.05962,"78":0.00331,"79":0.00166,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00497,"96":0,"97":0,"98":0,"99":0,"100":0.00662,"101":0.02153,"102":0.01822,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01159},B:{"12":0.00166,"13":0,"14":0,"15":0.00166,"16":0,"17":0,"18":0.00331,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00166,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00331,"110":0,"111":0,"112":0.00166,"113":0.00166,"114":0.00497,"115":0.00828,"116":0.06458,"117":0.0414},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00166,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00166,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00166,"14.1":0.00166,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00166,"15.6":0.00497,"16.0":0,"16.1":0.00166,"16.2":0.00166,"16.3":0.00331,"16.4":0.00166,"16.5":0.00331,"16.6":0.00828,"17.0":0.00166,"17.1":0},G:{"8":0.00424,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00085,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00509,"8.1-8.4":0.00085,"9.0-9.2":0,"9.3":0.01782,"10.0-10.2":0.00085,"10.3":0.02631,"11.0-11.2":0.02631,"11.3-11.4":0.0017,"12.0-12.1":0.02546,"12.2-12.5":0.51423,"13.0-13.1":0.02037,"13.2":0.00594,"13.3":0.02715,"13.4-13.7":0.06704,"14.0-14.4":0.36743,"14.5-14.8":0.35216,"15.0-15.1":0.45144,"15.2-15.3":0.23081,"15.4":0.15868,"15.5":0.24015,"15.6-15.7":1.26013,"16.0":0.42344,"16.1":0.43532,"16.2":0.36828,"16.3":0.61861,"16.4":0.35895,"16.5":0.71874,"16.6":1.44003,"17.0":0.28597,"17.1":0},P:{"4":0.04089,"20":0.05111,"21":0.10221,"22":0.39863,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.04089,"8.2":0,"9.2":0.02044,"10.1":0,"11.1-11.2":0.02044,"12.0":0,"13.0":0.01022,"14.0":0.01022,"15.0":0.01022,"16.0":0.03066,"17.0":0.02044,"18.0":0.02044,"19.0":0.04089},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00383,"4.2-4.3":0.00096,"4.4":0,"4.4.3-4.4.4":0.06515},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00166,"5.5":0},S:{"2.5":0.03338,_:"3.0-3.1"},J:{"7":0,"10":0.00834},N:{"10":0,"11":0},L:{"0":55.02002},R:{_:"0"},M:{"0":0.23363},Q:{"13.1":0.00834},O:{"0":0.77599},H:{"0":26.29764}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NI.js
index df94209418b915..20595375b6a998 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00435,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00435,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00435,"111":0.00435,"112":0.00435,"113":0.00435,"114":0.01741,"115":0.22195,"116":0.51354,"117":0.02611,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00435,"39":0,"40":0,"41":0.00435,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00435,"50":0,"51":0,"52":0,"53":0.0087,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00435,"70":0.00435,"71":0,"72":0,"73":0.00435,"74":0,"75":0.00435,"76":0,"77":0,"78":0,"79":0.04352,"80":0,"81":0.00435,"83":0.01306,"84":0,"85":0.00435,"86":0.00435,"87":0.01306,"88":0.01306,"89":0,"90":0,"91":0.45696,"92":0,"93":0.0087,"94":0.00435,"95":0.00435,"96":0.0087,"97":0.0087,"98":0.00435,"99":0.01306,"100":0.00435,"101":0.00435,"102":0.0087,"103":0.05222,"104":0.0087,"105":0.00435,"106":0.01306,"107":0.0087,"108":0.01741,"109":0.61363,"110":0.0087,"111":0.01306,"112":0.01741,"113":0.03482,"114":0.29594,"115":9.66579,"116":2.4937,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00435,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0087,"70":0.00435,"71":0.02176,"72":0.02176,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04352,"96":0,"97":0.00435,"98":0,"99":0.00435,"100":0.37427,"101":0.21325,"102":0.00435,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.0087,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01306,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01306,"110":0.0087,"111":0,"112":0.00435,"113":0.0087,"114":0.05658,"115":1.12717,"116":0.38733},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00435,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00435,"14.1":0.02611,"15.1":0,"15.2-15.3":0,"15.4":0.00435,"15.5":0.00435,"15.6":0.03046,"16.0":0.00435,"16.1":0.0087,"16.2":0.01306,"16.3":0.03046,"16.4":0.01306,"16.5":0.07398,"16.6":0.10445},G:{"8":0,"17":0.10875,"3.2":0,"4.0-4.1":0.00096,"4.2-4.3":0,"5.0-5.1":0.00192,"6.0-6.1":0,"7.0-7.1":0.0154,"8.1-8.4":0,"9.0-9.2":0.00289,"9.3":0.0616,"10.0-10.2":0,"10.3":0.00962,"11.0-11.2":0.00962,"11.3-11.4":0.00289,"12.0-12.1":0.00289,"12.2-12.5":0.19634,"13.0-13.1":0.00289,"13.2":0,"13.3":0.00674,"13.4-13.7":0.01732,"14.0-14.4":0.10394,"14.5-14.8":0.15688,"15.0-15.1":0.05293,"15.2-15.3":0.07988,"15.4":0.06256,"15.5":0.09047,"15.6-15.7":0.89217,"16.0":0.34359,"16.1":0.34359,"16.2":0.27044,"16.3":0.50913,"16.4":0.16843,"16.5":2.01437,"16.6":4.09322},P:{"4":0.26367,"20":0.16226,"21":0.31437,"5.0-5.4":0,"6.2-6.4":0.02028,"7.2-7.4":0.31437,"8.2":0.01014,"9.2":0.03042,"10.1":0,"11.1-11.2":0.11155,"12.0":0,"13.0":0.03042,"14.0":0.02028,"15.0":0.02028,"16.0":0.13183,"17.0":0.04056,"18.0":0.07099,"19.0":0.20282},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01592,"4.4":0,"4.4.3-4.4.4":0.19899},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01741,"5.5":0},S:{"2.5":0.0113,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.59664},R:{_:"0"},M:{"0":0.09602},Q:{"13.1":0},O:{"0":0.1525},H:{"0":0.31014}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00375,"99":0,"100":0,"101":0,"102":0.00375,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00375,"111":0.00375,"112":0.0075,"113":0.0075,"114":0.0075,"115":0.09755,"116":0.03377,"117":0.55154,"118":0.06003,"119":0.00375,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00375,"39":0,"40":0,"41":0.00375,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.09755,"50":0,"51":0,"52":0,"53":0.0075,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00375,"66":0.00375,"67":0,"68":0.00375,"69":0.00375,"70":0.00375,"71":0,"72":0.00375,"73":0.00375,"74":0,"75":0.00375,"76":0.00375,"77":0,"78":0,"79":0.03377,"80":0.00375,"81":0.0075,"83":0.0075,"84":0.00375,"85":0.00375,"86":0.00375,"87":0.01126,"88":0.01126,"89":0.0075,"90":0.05628,"91":0.32642,"92":0.00375,"93":0.0075,"94":0.00375,"95":0.00375,"96":0.0075,"97":0.00375,"98":0.00375,"99":0.01876,"100":0.00375,"101":0.00375,"102":0.0075,"103":0.02626,"104":0.0075,"105":0.03377,"106":0.01501,"107":0.0075,"108":0.0075,"109":0.58156,"110":0.0075,"111":0.01126,"112":0.01501,"113":0.02251,"114":0.07504,"115":0.16884,"116":5.99194,"117":1.3995,"118":0.00375,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00375,"29":0.00375,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.03752,"70":0.00375,"71":0.01126,"72":0.03752,"73":0.0075,"74":0,"75":0,"76":0,"77":0.01126,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.04127,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04127,"96":0,"97":0,"98":0,"99":0.00375,"100":0.07129,"101":0.22137,"102":0.21762,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00375,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.06378,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01126,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.0075,"104":0.00375,"105":0,"106":0,"107":0,"108":0,"109":0.01876,"110":0.00375,"111":0,"112":0.00375,"113":0.00375,"114":0.02626,"115":0.03002,"116":0.79542,"117":0.59657},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00375,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00375,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00375,"14.1":0.06378,"15.1":0,"15.2-15.3":0,"15.4":0.00375,"15.5":0.00375,"15.6":0.03002,"16.0":0.0075,"16.1":0.01126,"16.2":0.0075,"16.3":0.01126,"16.4":0.00375,"16.5":0.04127,"16.6":0.23262,"17.0":0.01501,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00302,"6.0-6.1":0,"7.0-7.1":0.0242,"8.1-8.4":0,"9.0-9.2":0.00504,"9.3":0.04738,"10.0-10.2":0,"10.3":0.01916,"11.0-11.2":0.00504,"11.3-11.4":0.00302,"12.0-12.1":0.00403,"12.2-12.5":0.16635,"13.0-13.1":0.00403,"13.2":0.00403,"13.3":0.96583,"13.4-13.7":0.00907,"14.0-14.4":0.05343,"14.5-14.8":0.0867,"15.0-15.1":0.03932,"15.2-15.3":0.08166,"15.4":0.04033,"15.5":0.0615,"15.6-15.7":0.86199,"16.0":0.32463,"16.1":0.2712,"16.2":0.16635,"16.3":0.35588,"16.4":0.10787,"16.5":0.34984,"16.6":5.15882,"17.0":0.73093,"17.1":0},P:{"4":0.2048,"20":0.13312,"21":0.23551,"22":2.24251,"5.0-5.4":0,"6.2-6.4":0.01024,"7.2-7.4":0.29695,"8.2":0,"9.2":0.03072,"10.1":0,"11.1-11.2":0.09216,"12.0":0,"13.0":0.02048,"14.0":0.03072,"15.0":0.03072,"16.0":0.1024,"17.0":0.04096,"18.0":0.0512,"19.0":0.16384},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01073,"4.2-4.3":0.01073,"4.4":0,"4.4.3-4.4.4":0.18235},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01501,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":70.89942},R:{_:"0"},M:{"0":0.09997},Q:{"13.1":0},O:{"0":0.18744},H:{"0":0.49688}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NL.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NL.js
index 5409fa640de53a..e375c51c5f6611 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NL.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NL.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00463,"39":0,"40":0,"41":0,"42":0,"43":0.00463,"44":0.01389,"45":0.00463,"46":0,"47":0,"48":0.00463,"49":0,"50":0,"51":0,"52":0.00463,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00463,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00926,"79":0,"80":0,"81":0.00926,"82":0,"83":0.00463,"84":0,"85":0,"86":0,"87":0,"88":0.00463,"89":0,"90":0,"91":0.00463,"92":0,"93":0,"94":0,"95":0.00463,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.08799,"103":0.00463,"104":0,"105":0.00463,"106":0.00463,"107":0.00463,"108":0.00463,"109":0.00926,"110":0.00926,"111":0.00463,"112":0.00926,"113":0.02779,"114":0.02316,"115":0.35196,"116":1.15312,"117":0.04168,"118":0.00463,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00463,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00463,"46":0,"47":0.00463,"48":0.04168,"49":0.01389,"50":0,"51":0,"52":0.01389,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00463,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00463,"68":0,"69":0,"70":0,"71":0,"72":0.02316,"73":0,"74":0.00463,"75":0,"76":0.00463,"77":0.00463,"78":0.00463,"79":0.01389,"80":0.00926,"81":0.00463,"83":0.00463,"84":0.00463,"85":0.20376,"86":0.03242,"87":0.01389,"88":0.00463,"89":0.00463,"90":0.00926,"91":0.00463,"92":0.01852,"93":0.01852,"94":0.00463,"95":0.00463,"96":0.00463,"97":0.00463,"98":0.00463,"99":0.00926,"100":0.03242,"101":0.05094,"102":0.03242,"103":0.07873,"104":0.05557,"105":0.01852,"106":0.06483,"107":0.02779,"108":0.08336,"109":0.45384,"110":0.03242,"111":0.03705,"112":0.06483,"113":0.11114,"114":0.6576,"115":6.07124,"116":3.44546,"117":0.00463,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00463,"70":0.00463,"71":0.01852,"72":0.01852,"73":0,"74":0,"75":0,"76":0,"77":0.00463,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01852,"96":0,"97":0,"98":0,"99":0.00926,"100":0.21303,"101":0.1945,"102":0.00463,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00463,"104":0,"105":0,"106":0,"107":0.00463,"108":0.00463,"109":0.05557,"110":0.00926,"111":0.00463,"112":0.00463,"113":0.01852,"114":0.16209,"115":2.61652,"116":0.95862},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00463,"10":0,"11":0,"12":0,"13":0.00463,"14":0.02779,"15":0.00463,"17":0.01389,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00463,"10.1":0,"11.1":0,"12.1":0.01852,"13.1":0.05557,"14.1":0.08336,"15.1":0.01389,"15.2-15.3":0.00926,"15.4":0.02316,"15.5":0.03705,"15.6":0.2686,"16.0":0.03242,"16.1":0.0602,"16.2":0.06947,"16.3":0.18061,"16.4":0.05557,"16.5":0.62519,"16.6":1.05587},G:{"8":0,"17":0.2239,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00295,"8.1-8.4":0,"9.0-9.2":0.05892,"9.3":0.05892,"10.0-10.2":0,"10.3":0.0766,"11.0-11.2":0.00589,"11.3-11.4":0.05008,"12.0-12.1":0.00884,"12.2-12.5":0.40656,"13.0-13.1":0.00295,"13.2":0.00295,"13.3":0.01178,"13.4-13.7":0.02946,"14.0-14.4":0.09427,"14.5-14.8":0.20033,"15.0-15.1":0.08544,"15.2-15.3":0.11195,"15.4":0.11784,"15.5":0.21212,"15.6-15.7":1.76176,"16.0":0.91034,"16.1":1.85898,"16.2":0.83374,"16.3":1.82068,"16.4":0.31818,"16.5":5.92753,"16.6":14.2414},P:{"4":0.0414,"20":0.07245,"21":0.2691,"22":4.91631,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01035,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01035,"14.0":0.01035,"15.0":0.01035,"16.0":0.0207,"17.0":0.0207,"18.0":0.0207,"19.0":0.0414},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0316,"4.2-4.3":0.00527,"4.4":0,"4.4.3-4.4.4":0.09481},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00617,"9":0.0247,"10":0,"11":0.09879,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":39.03593},R:{_:"0"},M:{"0":0.57448},Q:{"13.1":0.01074},O:{"0":0.47784},H:{"0":0.44731}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00495,"39":0,"40":0,"41":0,"42":0,"43":0.00495,"44":0.01484,"45":0.00495,"46":0,"47":0,"48":0.01484,"49":0,"50":0,"51":0,"52":0.00495,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00495,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0099,"79":0,"80":0,"81":0.0099,"82":0,"83":0.00495,"84":0,"85":0,"86":0,"87":0,"88":0.00495,"89":0,"90":0,"91":0.00495,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.08412,"103":0.00495,"104":0.00495,"105":0.00495,"106":0.00495,"107":0.00495,"108":0.00495,"109":0.00495,"110":0.01484,"111":0.00495,"112":0.0099,"113":0.02474,"114":0.0099,"115":0.13854,"116":0.07917,"117":1.2469,"118":0.1138,"119":0.00495,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00495,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00495,"46":0,"47":0.00495,"48":0.03464,"49":0.01484,"50":0,"51":0,"52":0.01484,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00495,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00495,"69":0,"70":0.00495,"71":0.00495,"72":0.02474,"73":0,"74":0.00495,"75":0,"76":0.00495,"77":0.01484,"78":0.0099,"79":0.01484,"80":0.01979,"81":0.00495,"83":0.00495,"84":0.00495,"85":0.16328,"86":0.03958,"87":0.04948,"88":0.00495,"89":0.0099,"90":0.0099,"91":0.00495,"92":0.0099,"93":0.01979,"94":0.00495,"95":0.00495,"96":0.00495,"97":0.00495,"98":0.00495,"99":0.0099,"100":0.03464,"101":0.05938,"102":0.04453,"103":0.08906,"104":0.05443,"105":0.05443,"106":0.06432,"107":0.02474,"108":0.06927,"109":0.44532,"110":0.02474,"111":0.03464,"112":0.05443,"113":0.09401,"114":0.30183,"115":0.35131,"116":9.10927,"117":2.78078,"118":0.00495,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.02969,"73":0.00495,"74":0,"75":0,"76":0,"77":0.02474,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01484,"96":0,"97":0,"98":0,"99":0.00495,"100":0.05938,"101":0.17813,"102":0.28698,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00495,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00495,"104":0,"105":0,"106":0.00495,"107":0.00495,"108":0.00495,"109":0.05938,"110":0.00495,"111":0.00495,"112":0.00495,"113":0.01484,"114":0.04453,"115":0.10886,"116":2.05837,"117":1.78623},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00495,"9":0.00495,"10":0,"11":0,"12":0,"13":0.00495,"14":0.02969,"15":0.0099,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01484,"10.1":0,"11.1":0,"12.1":0.02474,"13.1":0.05443,"14.1":0.09401,"15.1":0.01484,"15.2-15.3":0.01484,"15.4":0.02474,"15.5":0.03464,"15.6":0.26224,"16.0":0.02969,"16.1":0.06432,"16.2":0.06927,"16.3":0.16328,"16.4":0.06927,"16.5":0.20287,"16.6":1.50419,"17.0":0.08906,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00603,"8.1-8.4":0,"9.0-9.2":0.04224,"9.3":0.0513,"10.0-10.2":0,"10.3":0.0694,"11.0-11.2":0.00302,"11.3-11.4":0.02716,"12.0-12.1":0.00603,"12.2-12.5":0.3289,"13.0-13.1":0.00603,"13.2":0.00603,"13.3":0.1207,"13.4-13.7":0.02716,"14.0-14.4":0.08751,"14.5-14.8":0.21726,"15.0-15.1":0.07242,"15.2-15.3":0.10561,"15.4":0.11768,"15.5":0.20217,"15.6-15.7":1.56907,"16.0":0.92636,"16.1":1.71391,"16.2":0.7785,"16.3":1.57812,"16.4":0.24743,"16.5":0.85696,"16.6":18.42152,"17.0":2.18765,"17.1":0.00302},P:{"4":0.02059,"20":0.06177,"21":0.15443,"22":4.49893,"5.0-5.4":0.0103,"6.2-6.4":0,"7.2-7.4":0.0103,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.0103,"14.0":0.0103,"15.0":0.0103,"16.0":0.02059,"17.0":0.02059,"18.0":0.02059,"19.0":0.04118},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0.03685,"2.3":0,"4.1":0.03685,"4.2-4.3":0.01228,"4.4":0,"4.4.3-4.4.4":0.0737},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.02813,"10":0,"11":0.10547,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":36.22443},R:{_:"0"},M:{"0":0.56582},Q:{"13.1":0.00505},O:{"0":0.44458},H:{"0":0.4209}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NO.js
index 4b3a073a428be4..f07dfcc57cec92 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.02752,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01376,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00688,"90":0.00688,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.08945,"103":0.00688,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.01376,"114":0.02064,"115":1.14913,"116":18.87458,"117":1.10096,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01376,"50":0,"51":0.00688,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.06881,"63":0,"64":0.00688,"65":0,"66":0.13074,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.01376,"80":0,"81":0.00688,"83":0,"84":0,"85":2.92443,"86":0.00688,"87":0.01376,"88":0,"89":0.01376,"90":0.01376,"91":0.00688,"92":0.00688,"93":0.00688,"94":0,"95":0,"96":0.00688,"97":0,"98":0.03441,"99":0.02752,"100":0.01376,"101":0.00688,"102":0.00688,"103":0.10322,"104":0.00688,"105":0.01376,"106":0.06881,"107":0.01376,"108":0.03441,"109":0.37846,"110":0.04817,"111":0.04817,"112":0.08257,"113":0.18579,"114":1.46565,"115":8.72511,"116":3.41298,"117":0.00688,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00688,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00688,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01376,"96":0,"97":0,"98":0,"99":0.01376,"100":0.42662,"101":0.24772,"102":0.00688,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.01376,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00688,"109":0.04817,"110":0.00688,"111":0.00688,"112":0.01376,"113":0.02752,"114":0.18579,"115":2.88314,"116":0.67434},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00688,"14":0.03441,"15":0.00688,"17":0.01376,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.02752,"12.1":0.01376,"13.1":0.06881,"14.1":0.1101,"15.1":0.08257,"15.2-15.3":0.01376,"15.4":0.03441,"15.5":0.04817,"15.6":0.27524,"16.0":0.02064,"16.1":0.06881,"16.2":0.08257,"16.3":0.22707,"16.4":0.08945,"16.5":0.578,"16.6":0.98398},G:{"8":0,"17":0.16365,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04546,"10.0-10.2":0,"10.3":0.05455,"11.0-11.2":0.00303,"11.3-11.4":0.24548,"12.0-12.1":0.00909,"12.2-12.5":0.23639,"13.0-13.1":0,"13.2":0,"13.3":0.00909,"13.4-13.7":0.02121,"14.0-14.4":0.05455,"14.5-14.8":0.17881,"15.0-15.1":0.05758,"15.2-15.3":0.08183,"15.4":0.09698,"15.5":0.22426,"15.6-15.7":1.34862,"16.0":0.9213,"16.1":2.0002,"16.2":0.90918,"16.3":1.97292,"16.4":0.20002,"16.5":6.07636,"16.6":15.37123},P:{"4":0.05111,"20":0.03067,"21":0.092,"22":2.04436,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01022,"18.0":0.01022,"19.0":0.01022},I:{"0":0,"3":0,"4":0.00345,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0069,"4.2-4.3":0.0069,"4.4":0,"4.4.3-4.4.4":0.05522},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04817,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":18.21069},R:{_:"0"},M:{"0":0.26512},Q:{"13.1":0},O:{"0":0.02495},H:{"0":0.14469}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.02769,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00692,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.06923,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00692,"109":0.00692,"110":0,"111":0,"112":0.00692,"113":0.02769,"114":0.00692,"115":0.11769,"116":0.06231,"117":22.98436,"118":1.7169,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01385,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.11077,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00692,"79":0.01385,"80":0,"81":0.00692,"83":0,"84":0,"85":1.37768,"86":0.01385,"87":0.01385,"88":0,"89":0.00692,"90":0.01385,"91":0,"92":0,"93":0.04154,"94":0,"95":0,"96":0.00692,"97":0.00692,"98":0.00692,"99":0.00692,"100":0.01385,"101":0.02077,"102":0.01385,"103":0.08308,"104":0.01385,"105":0.01385,"106":0.01385,"107":0.01385,"108":0.02077,"109":0.22846,"110":0.03462,"111":0.02769,"112":0.08308,"113":0.10385,"114":0.24923,"115":0.61615,"116":8.71606,"117":2.7692,"118":0.00692,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00692,"73":0,"74":0,"75":0,"76":0,"77":0.02077,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01385,"96":0,"97":0,"98":0,"99":0.00692,"100":0.11769,"101":0.27,"102":0.51923,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.01385,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02769,"110":0,"111":0,"112":0.01385,"113":0.01385,"114":0.02769,"115":0.09,"116":1.42614,"117":1.36383},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00692,"14":0.03462,"15":0.00692,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.02077,"12.1":0.01385,"13.1":0.05538,"14.1":0.15923,"15.1":0.02077,"15.2-15.3":0.02077,"15.4":0.06923,"15.5":0.06231,"15.6":0.29769,"16.0":0.02769,"16.1":0.10385,"16.2":0.07615,"16.3":0.24923,"16.4":0.15923,"16.5":0.23538,"16.6":1.78613,"17.0":0.13846,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03529,"10.0-10.2":0,"10.3":0.04491,"11.0-11.2":0,"11.3-11.4":0.17644,"12.0-12.1":0.00642,"12.2-12.5":0.1989,"13.0-13.1":0,"13.2":0,"13.3":0.07699,"13.4-13.7":0.00642,"14.0-14.4":0.05133,"14.5-14.8":0.19248,"15.0-15.1":0.0385,"15.2-15.3":0.0802,"15.4":0.08341,"15.5":0.22456,"15.6-15.7":1.29606,"16.0":1.03941,"16.1":1.87672,"16.2":0.83089,"16.3":1.72915,"16.4":0.17003,"16.5":0.74106,"16.6":20.89414,"17.0":1.87993,"17.1":0.00321},P:{"4":0.02059,"20":0.02059,"21":0.05146,"22":1.935,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01029,"18.0":0.01029,"19.0":0.01029},I:{"0":0,"3":0,"4":0.0124,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00207,"4.2-4.3":0.00413,"4.4":0,"4.4.3-4.4.4":0.04755},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03462,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":16.52096},R:{_:"0"},M:{"0":0.2677},Q:{"13.1":0},O:{"0":0.02154},H:{"0":0.14274}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NP.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NP.js
index 4dab3be382ae1c..8a9e512594a1ba 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NP.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NP.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00249,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00249,"112":0,"113":0.00249,"114":0.00249,"115":0.08968,"116":0.20426,"117":0.01495,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00249,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00249,"80":0,"81":0.00249,"83":0,"84":0,"85":0,"86":0,"87":0.00249,"88":0.00249,"89":0,"90":0,"91":0,"92":0.00249,"93":0.00249,"94":0,"95":0,"96":0.00249,"97":0,"98":0.00249,"99":0.00249,"100":0.00249,"101":0,"102":0.00249,"103":0.01246,"104":0.00249,"105":0.00249,"106":0.00747,"107":0.00747,"108":0.00498,"109":0.59037,"110":0.00498,"111":0.00498,"112":0.00747,"113":0.00996,"114":0.0822,"115":2.70274,"116":1.53446,"117":0.00747,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00249,"70":0.00498,"71":0.04982,"72":0.04235,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00498,"96":0,"97":0,"98":0,"99":0,"100":0.02989,"101":0.04982,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00249},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00249,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00747,"110":0,"111":0,"112":0,"113":0.00249,"114":0.02491,"115":0.31387,"116":0.09466},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00249,"15":0,"17":0.00249,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00249,"13.1":0.00249,"14.1":0.00498,"15.1":0,"15.2-15.3":0.00249,"15.4":0.00249,"15.5":0.00249,"15.6":0.01246,"16.0":0,"16.1":0.00249,"16.2":0.00249,"16.3":0.00747,"16.4":0.00498,"16.5":0.03238,"16.6":0.0274},G:{"8":0,"17":0.13549,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00506,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0182,"10.0-10.2":0,"10.3":0.03135,"11.0-11.2":0.00202,"11.3-11.4":0.00202,"12.0-12.1":0.00607,"12.2-12.5":0.36097,"13.0-13.1":0.00202,"13.2":0.00303,"13.3":0.01011,"13.4-13.7":0.03135,"14.0-14.4":0.07988,"14.5-14.8":0.20121,"15.0-15.1":0.02932,"15.2-15.3":0.05056,"15.4":0.04348,"15.5":0.08696,"15.6-15.7":1.52782,"16.0":0.15774,"16.1":0.42063,"16.2":0.17189,"16.3":0.48332,"16.4":0.09606,"16.5":1.89081,"16.6":4.25888},P:{"4":0.08229,"20":0.02057,"21":0.06172,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03086,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01029,"12.0":0,"13.0":0.01029,"14.0":0,"15.0":0.01029,"16.0":0.01029,"17.0":0.05143,"18.0":0.01029,"19.0":0.01029},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.0774},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00249,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":80.81482},R:{_:"0"},M:{"0":0.03755},Q:{"13.1":0},O:{"0":0.96115},H:{"0":0.57583}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0023,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0023,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.0023,"111":0,"112":0,"113":0,"114":0.0023,"115":0.03907,"116":0.00919,"117":0.18154,"118":0.02068,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.0023,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.0023,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.0023,"75":0,"76":0,"77":0,"78":0,"79":0.0023,"80":0,"81":0.0023,"83":0,"84":0,"85":0,"86":0,"87":0.0023,"88":0.0023,"89":0,"90":0,"91":0,"92":0,"93":0.0023,"94":0,"95":0,"96":0.0023,"97":0,"98":0.0023,"99":0.0023,"100":0.0023,"101":0,"102":0.0023,"103":0.00919,"104":0.0023,"105":0.0023,"106":0.0046,"107":0.00689,"108":0.0046,"109":0.46649,"110":0.0023,"111":0.0023,"112":0.00919,"113":0.0046,"114":0.02298,"115":0.03447,"116":2.9897,"117":0.66642,"118":0.00689,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0023,"70":0.0023,"71":0.0046,"72":0.05745,"73":0.01609,"74":0,"75":0,"76":0,"77":0.00689,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0046,"96":0,"97":0,"98":0,"99":0,"100":0.0046,"101":0.03677,"102":0.02987,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0023,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0046,"110":0,"111":0,"112":0,"113":0.0023,"114":0.0023,"115":0.0046,"116":0.19533,"117":0.14018},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0023,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0023,"14.1":0.0046,"15.1":0,"15.2-15.3":0.0023,"15.4":0,"15.5":0.0023,"15.6":0.00919,"16.0":0,"16.1":0.0023,"16.2":0.0023,"16.3":0.00689,"16.4":0.0023,"16.5":0.00919,"16.6":0.03907,"17.0":0.0046,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00598,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01435,"10.0-10.2":0,"10.3":0.05382,"11.0-11.2":0.01076,"11.3-11.4":0.00239,"12.0-12.1":0.00837,"12.2-12.5":0.39226,"13.0-13.1":0.00359,"13.2":0.00359,"13.3":0.04066,"13.4-13.7":0.03468,"14.0-14.4":0.09328,"14.5-14.8":0.20809,"15.0-15.1":0.0287,"15.2-15.3":0.05023,"15.4":0.05262,"15.5":0.09209,"15.6-15.7":1.76277,"16.0":0.15786,"16.1":0.42335,"16.2":0.16982,"16.3":0.42335,"16.4":0.07773,"16.5":0.26908,"16.6":6.64927,"17.0":0.69124,"17.1":0.00239},P:{"4":0.06277,"20":0.02092,"21":0.04184,"22":0.46028,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03138,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01046,"14.0":0,"15.0":0,"16.0":0.01046,"17.0":0.04184,"18.0":0.01046,"19.0":0.01046},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.07298},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0023,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":80.30468},R:{_:"0"},M:{"0":0.04621},Q:{"13.1":0},O:{"0":0.95505},H:{"0":0.52501}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NR.js
index 0e9c6472c8cf4f..ba7610d5812062 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0.03564,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.0297,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.01485,"90":0,"91":0,"92":0,"93":0,"94":0.02079,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02079,"110":0.00594,"111":0,"112":0,"113":0.00594,"114":0.05049,"115":2.96703,"116":1.16424,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0.02079,"67":0,"68":0,"69":0,"70":0,"71":0.05049,"72":0.02079,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00594,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.05643,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00594,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00594,"109":0.02079,"110":0,"111":0,"112":0.01485,"113":0,"114":0.00594,"115":0.83457,"116":0.15444},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.65043,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.10692,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00594,"15.6":0,"16.0":0,"16.1":0.2673,"16.2":0,"16.3":0.00594,"16.4":0.01485,"16.5":0,"16.6":0.03564},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.08512,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.22726,"13.0-13.1":0,"13.2":0,"13.3":0.0281,"13.4-13.7":0.05702,"14.0-14.4":0.0281,"14.5-14.8":0,"15.0-15.1":0.08512,"15.2-15.3":0.05702,"15.4":0.19916,"15.5":0.05702,"15.6-15.7":1.22143,"16.0":0.19916,"16.1":0.68178,"16.2":0.08512,"16.3":1.02226,"16.4":0.53964,"16.5":0.99416,"16.6":2.69821},P:{"4":0.02067,"20":0.07235,"21":0.66144,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.64077,"15.0":0.05168,"16.0":0.32039,"17.0":0,"18.0":0.21704,"19.0":0.10335},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.22572},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.01485,"11":0,"5.5":0},S:{"2.5":0.02109,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":77.44272},R:{_:"0"},M:{"0":0.02109},Q:{"13.1":0},O:{"0":0.59052},H:{"0":1.16472}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0.00813,"117":0,"118":0.03793,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.05418,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00813,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.06773,"110":0,"111":0.02167,"112":0,"113":0,"114":0.01625,"115":0.07585,"116":3.84949,"117":0.47678,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00813,"71":0,"72":0.0298,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01625,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.02167,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.0298,"116":0.83979,"117":0.37113},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.40906,"15.1":0,"15.2-15.3":0.0298,"15.4":0,"15.5":0.01625,"15.6":0,"16.0":0,"16.1":0.01625,"16.2":0,"16.3":0.00813,"16.4":0.17338,"16.5":0,"16.6":0.0596,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.03281,"13.0-13.1":0,"13.2":0,"13.3":0.10095,"13.4-13.7":0.03281,"14.0-14.4":0.06814,"14.5-14.8":0,"15.0-15.1":0.03281,"15.2-15.3":1.28212,"15.4":0.20191,"15.5":0.13629,"15.6-15.7":1.01459,"16.0":0.13629,"16.1":0.5401,"16.2":0.23724,"16.3":1.2165,"16.4":0.60825,"16.5":0.40634,"16.6":18.81785,"17.0":0.20191,"17.1":0},P:{"4":0,"20":0.06069,"21":0.11127,"22":1.04193,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.11127,"12.0":0,"13.0":0,"14.0":0,"15.0":0.06069,"16.0":0.34394,"17.0":0,"18.0":0,"19.0":0.20232},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":63.99801},R:{_:"0"},M:{"0":0.02916},Q:{"13.1":0},O:{"0":0.28435},H:{"0":1.0492}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NU.js
index 4f1d9205fdb865..d67a70f9491b36 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.07981,"116":0.01613,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0.01613,"16.2":0.2564,"16.3":0.01613,"16.4":0,"16.5":0.11207,"16.6":0.20801},G:{"8":0,"17":0.41106,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0.82212,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":0.20075,"16.0":0.20075,"16.1":1.84499,"16.2":0.61181,"16.3":64.89024,"16.4":0,"16.5":7.37041,"16.6":19.24338},P:{"4":0,"20":0,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":3.68368},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0.06096,"118":0.00572,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0.02731,"117":0.02731,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0.00572},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0.02731,"16.3":0.02223,"16.4":0.0108,"16.5":0.01651,"16.6":0.18733,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0.09003,"15.4":0,"15.5":0,"15.6-15.7":0.09003,"16.0":0.18606,"16.1":0.92431,"16.2":0.18606,"16.3":49.75658,"16.4":0,"16.5":0.27609,"16.6":8.04868,"17.0":0.37212,"17.1":0},P:{"4":0,"20":0,"21":0,"22":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":38.93062},R:{_:"0"},M:{"0":0.69301},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NZ.js
index bf152389ece336..d496056b5e66d9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/NZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.08025,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00535,"35":0,"36":0,"37":0.00535,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00535,"49":0,"50":0,"51":0,"52":0.0107,"53":0,"54":0.00535,"55":0,"56":0,"57":0,"58":0,"59":0.01605,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02675,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00535,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00535,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0321,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00535,"109":0.00535,"110":0.00535,"111":0.00535,"112":0.00535,"113":0.01605,"114":0.01605,"115":0.3424,"116":1.07,"117":0.03745,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.0107,"35":0,"36":0,"37":0,"38":0.0535,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0214,"50":0,"51":0,"52":0.00535,"53":0.00535,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.0107,"60":0,"61":0.00535,"62":0,"63":0,"64":0,"65":0.00535,"66":0.06955,"67":0,"68":0.00535,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00535,"75":0.00535,"76":0.0107,"77":0.00535,"78":0.00535,"79":0.05885,"80":0.00535,"81":0.00535,"83":0.0107,"84":0,"85":0.00535,"86":0.00535,"87":0.03745,"88":0.06955,"89":0.01605,"90":0.04815,"91":0.00535,"92":0.0107,"93":0.0428,"94":0.0107,"95":0.00535,"96":0.0107,"97":0.01605,"98":0.0107,"99":0.0321,"100":0.00535,"101":0.00535,"102":0.00535,"103":0.18725,"104":0.0107,"105":0.01605,"106":0.0107,"107":0.03745,"108":0.04815,"109":0.49755,"110":0.03745,"111":0.0535,"112":0.09095,"113":0.1926,"114":1.4338,"115":9.2555,"116":4.42445,"117":0.0107,"118":0.00535,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00535,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01605,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.0107,"72":0.0107,"73":0,"74":0,"75":0,"76":0.00535,"77":0.00535,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0107,"96":0,"97":0,"98":0,"99":0.0107,"100":0.27285,"101":0.12305,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00535,"18":0.00535,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00535,"106":0,"107":0,"108":0.00535,"109":0.02675,"110":0.00535,"111":0.00535,"112":0.00535,"113":0.01605,"114":0.1498,"115":2.6429,"116":0.8453},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.00535,"13":0.02675,"14":0.06955,"15":0.0107,"17":0.01605,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.01605,"12.1":0.02675,"13.1":0.13375,"14.1":0.18725,"15.1":0.02675,"15.2-15.3":0.0214,"15.4":0.0428,"15.5":0.0963,"15.6":0.46545,"16.0":0.04815,"16.1":0.1177,"16.2":0.12305,"16.3":0.3103,"16.4":0.0963,"16.5":0.9309,"16.6":1.43915},G:{"8":0.02209,"17":0.25406,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.02485,"7.0-7.1":0,"8.1-8.4":0.00552,"9.0-9.2":0,"9.3":0.10218,"10.0-10.2":0.00828,"10.3":0.20435,"11.0-11.2":0.46945,"11.3-11.4":0.13807,"12.0-12.1":0.01657,"12.2-12.5":0.74008,"13.0-13.1":0.00828,"13.2":0,"13.3":0.02761,"13.4-13.7":0.05523,"14.0-14.4":0.16845,"14.5-14.8":0.32862,"15.0-15.1":0.13531,"15.2-15.3":0.15464,"15.4":0.16293,"15.5":0.26234,"15.6-15.7":1.9579,"16.0":0.64343,"16.1":1.66518,"16.2":0.7318,"16.3":1.54091,"16.4":0.24301,"16.5":4.90441,"16.6":12.62278},P:{"4":0.21059,"20":0.08424,"21":0.18953,"22":2.4639,"5.0-5.4":0.02106,"6.2-6.4":0,"7.2-7.4":0.01053,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02106,"14.0":0.01053,"15.0":0.01053,"16.0":0.02106,"17.0":0.02106,"18.0":0.01053,"19.0":0.03159},I:{"0":0,"3":0,"4":0.00413,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0248,"4.2-4.3":0.01653,"4.4":0,"4.4.3-4.4.4":0.06199},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01529,"9":0,"10":0,"11":0.09171,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":38.98325},R:{_:"0"},M:{"0":0.36735},Q:{"13.1":0.00465},O:{"0":0.0651},H:{"0":0.22012}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.25281,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00538,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01076,"49":0,"50":0,"51":0,"52":0.01076,"53":0,"54":0.00538,"55":0,"56":0,"57":0,"58":0,"59":0.01614,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02152,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00538,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00538,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03227,"103":0,"104":0.00538,"105":0,"106":0,"107":0,"108":0.00538,"109":0.00538,"110":0.00538,"111":0,"112":0.00538,"113":0.01076,"114":0.00538,"115":0.13985,"116":0.09144,"117":1.14035,"118":0.11296,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00538,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01076,"35":0,"36":0,"37":0,"38":0.05917,"39":0.01076,"40":0.01076,"41":0.01076,"42":0.01076,"43":0.01076,"44":0.01076,"45":0.01076,"46":0.01076,"47":0.00538,"48":0.01076,"49":0.03765,"50":0.00538,"51":0.01076,"52":0.01614,"53":0.01076,"54":0.01076,"55":0.01076,"56":0.01076,"57":0.00538,"58":0.01076,"59":0.02152,"60":0.01076,"61":0.00538,"62":0,"63":0,"64":0,"65":0.00538,"66":0.07531,"67":0,"68":0.00538,"69":0,"70":0.00538,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00538,"77":0,"78":0.00538,"79":0.05379,"80":0.00538,"81":0,"83":0.00538,"84":0,"85":0.00538,"86":0.00538,"87":0.0269,"88":0.04303,"89":0.01614,"90":0.04303,"91":0,"92":0.00538,"93":0.03227,"94":0.01076,"95":0.00538,"96":0.01076,"97":0.00538,"98":0.01076,"99":0.0269,"100":0,"101":0.01076,"102":0.00538,"103":0.16675,"104":0.01614,"105":0.01076,"106":0.01076,"107":0.04303,"108":0.03765,"109":0.50563,"110":0.03227,"111":0.04303,"112":0.04841,"113":0.12372,"114":0.47873,"115":0.64548,"116":11.49492,"117":2.84011,"118":0.01076,"119":0.00538,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00538,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01076,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01076,"73":0,"74":0,"75":0,"76":0,"77":0.03765,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01076,"96":0,"97":0,"98":0,"99":0.00538,"100":0.07531,"101":0.16675,"102":0.22054,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00538,"18":0.00538,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00538,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00538,"104":0,"105":0.00538,"106":0,"107":0,"108":0.00538,"109":0.03765,"110":0,"111":0.00538,"112":0.00538,"113":0.01614,"114":0.03227,"115":0.08606,"116":1.97947,"117":1.42544},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0269,"14":0.07531,"15":0.01076,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.01614,"12.1":0.0269,"13.1":0.11834,"14.1":0.17213,"15.1":0.02152,"15.2-15.3":0.01614,"15.4":0.03765,"15.5":0.08606,"15.6":0.44108,"16.0":0.03765,"16.1":0.13448,"16.2":0.10758,"16.3":0.22592,"16.4":0.08069,"16.5":0.26895,"16.6":2.16236,"17.0":0.07531,"17.1":0},G:{"8":0.01414,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01696,"7.0-7.1":0.00283,"8.1-8.4":0.00283,"9.0-9.2":0,"9.3":0.07917,"10.0-10.2":0.00283,"10.3":0.16964,"11.0-11.2":0.25729,"11.3-11.4":0.14137,"12.0-12.1":0.01696,"12.2-12.5":0.69554,"13.0-13.1":0,"13.2":0,"13.3":0.03676,"13.4-13.7":0.03958,"14.0-14.4":0.14985,"14.5-14.8":0.32515,"15.0-15.1":0.13854,"15.2-15.3":0.14137,"15.4":0.16116,"15.5":0.21206,"15.6-15.7":1.88588,"16.0":0.62768,"16.1":1.50418,"16.2":0.66727,"16.3":1.35998,"16.4":0.17813,"16.5":0.557,"16.6":17.4027,"17.0":1.13945,"17.1":0.00565},P:{"4":0.17786,"20":0.06277,"21":0.14647,"22":2.43772,"5.0-5.4":0.02092,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01046,"12.0":0,"13.0":0.01046,"14.0":0.01046,"15.0":0.01046,"16.0":0.02092,"17.0":0.02092,"18.0":0.01046,"19.0":0.03139},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02441,"4.2-4.3":0.01221,"4.4":0,"4.4.3-4.4.4":0.06103},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01703,"9":0,"10":0,"11":0.08517,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":38.21258},R:{_:"0"},M:{"0":0.40203},Q:{"13.1":0.00924},O:{"0":0.06932},H:{"0":0.23624}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/OM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/OM.js
index 4552d8610e2060..fa2a403e2b8688 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/OM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/OM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00269,"103":0,"104":0,"105":0,"106":0,"107":0.00269,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00269,"114":0.00269,"115":0.03497,"116":0.07801,"117":0.00538,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00269,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00269,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00269,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00269,"57":0,"58":0.00807,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00269,"66":0,"67":0,"68":0.00269,"69":0.00269,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00807,"80":0,"81":0.00807,"83":0.00269,"84":0,"85":0.00269,"86":0.00269,"87":0.00269,"88":0.00538,"89":0.00269,"90":0.00269,"91":0.00269,"92":0.00269,"93":0.00807,"94":0,"95":0.00269,"96":0.00269,"97":0.00269,"98":0.00538,"99":0.02152,"100":0.00269,"101":0.00269,"102":0.00269,"103":0.02959,"104":0,"105":0.00269,"106":0.00538,"107":0.00269,"108":0.01076,"109":0.54338,"110":0.00269,"111":0.00807,"112":0.01345,"113":0.02421,"114":0.13719,"115":2.56895,"116":1.69739,"117":0.01614,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00538,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.01614,"72":0.02152,"73":0,"74":0,"75":0,"76":0.00538,"77":0.00807,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00269,"96":0,"97":0,"98":0,"99":0.00269,"100":0.05918,"101":0.04842,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00269,"93":0,"94":0.00269,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00269,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02152,"110":0.00269,"111":0.00538,"112":0.00269,"113":0.04842,"114":0.03228,"115":0.54338,"116":0.21789},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00538,"15":0.00269,"17":0.00807,_:"0","3.1":0,"3.2":0,"5.1":0.00538,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00538,"14.1":0.01345,"15.1":0,"15.2-15.3":0,"15.4":0.00807,"15.5":0.00807,"15.6":0.02959,"16.0":0.00269,"16.1":0.01345,"16.2":0.01076,"16.3":0.02959,"16.4":0.01076,"16.5":0.06187,"16.6":0.09684},G:{"8":0,"17":0.19231,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00389,"6.0-6.1":0,"7.0-7.1":0.03691,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.08159,"10.0-10.2":0,"10.3":0.03302,"11.0-11.2":0.00389,"11.3-11.4":0,"12.0-12.1":0.00583,"12.2-12.5":0.34771,"13.0-13.1":0.00583,"13.2":0.00583,"13.3":0.0272,"13.4-13.7":0.04662,"14.0-14.4":0.18648,"14.5-14.8":0.23504,"15.0-15.1":0.06799,"15.2-15.3":0.11461,"15.4":0.12821,"15.5":0.22145,"15.6-15.7":1.8551,"16.0":0.66434,"16.1":0.84111,"16.2":0.55167,"16.3":1.13831,"16.4":0.36519,"16.5":3.98409,"16.6":8.26928},P:{"4":0.12291,"20":0.13315,"21":0.28678,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.09218,"8.2":0.01024,"9.2":0,"10.1":0,"11.1-11.2":0.05121,"12.0":0.02048,"13.0":0.06145,"14.0":0.03073,"15.0":0.03073,"16.0":0.0717,"17.0":0.06145,"18.0":0.04097,"19.0":0.09218},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.04548,"4.4":0,"4.4.3-4.4.4":0.18949},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03766,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.5352},R:{_:"0"},M:{"0":0.05848},Q:{"13.1":0},O:{"0":1.73978},H:{"0":0.82356}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01413,"116":0.00565,"117":0.09608,"118":0.00565,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00283,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00283,"49":0.00283,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00283,"57":0,"58":0.01413,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00283,"65":0.00283,"66":0,"67":0,"68":0,"69":0.00283,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00283,"77":0,"78":0,"79":0.0113,"80":0.00283,"81":0.00565,"83":0.00565,"84":0,"85":0.00283,"86":0.00283,"87":0.00848,"88":0.00565,"89":0.00283,"90":0.00283,"91":0.00565,"92":0,"93":0.0113,"94":0,"95":0.00848,"96":0.00283,"97":0.00283,"98":0.00565,"99":0.03109,"100":0.00283,"101":0.00283,"102":0.00283,"103":0.05087,"104":0.00283,"105":0.00565,"106":0.00848,"107":0.00565,"108":0.00848,"109":0.47477,"110":0.00283,"111":0.00565,"112":0.0113,"113":0.01978,"114":0.04239,"115":0.07065,"116":4.08922,"117":0.86193,"118":0.00848,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00283,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.02543,"73":0.00565,"74":0,"75":0,"76":0,"77":0.02261,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00283,"96":0,"97":0,"98":0,"99":0,"100":0.00848,"101":0.03391,"102":0.03956,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00283,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00283,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00283,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01696,"110":0,"111":0.00283,"112":0.00283,"113":0.00565,"114":0.00848,"115":0.01978,"116":0.42955,"117":0.29108},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00848,"15":0.00283,_:"0","3.1":0,"3.2":0,"5.1":0.00283,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00848,"14.1":0.01413,"15.1":0.00283,"15.2-15.3":0.00283,"15.4":0.00565,"15.5":0.00848,"15.6":0.03391,"16.0":0.00283,"16.1":0.01413,"16.2":0.0113,"16.3":0.02826,"16.4":0.0113,"16.5":0.02543,"16.6":0.20065,"17.0":0.01978,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00853,"6.0-6.1":0,"7.0-7.1":0.03839,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07466,"10.0-10.2":0,"10.3":0.03839,"11.0-11.2":0.00427,"11.3-11.4":0,"12.0-12.1":0.00853,"12.2-12.5":0.33915,"13.0-13.1":0.00427,"13.2":0.0064,"13.3":0.02133,"13.4-13.7":0.04479,"14.0-14.4":0.16424,"14.5-14.8":0.26023,"15.0-15.1":0.10025,"15.2-15.3":0.11305,"15.4":0.14505,"15.5":0.28156,"15.6-15.7":1.89628,"16.0":0.66124,"16.1":0.88735,"16.2":0.5162,"16.3":1.03239,"16.4":0.31782,"16.5":1.05586,"16.6":11.88745,"17.0":1.13691,"17.1":0},P:{"4":0.11233,"20":0.09191,"21":0.21446,"22":2.69601,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.10212,"8.2":0,"9.2":0.01021,"10.1":0,"11.1-11.2":0.06127,"12.0":0.02042,"13.0":0.07149,"14.0":0.04085,"15.0":0.04085,"16.0":0.06127,"17.0":0.05106,"18.0":0.05106,"19.0":0.10212},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02231,"4.4":0,"4.4.3-4.4.4":0.14725},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01978,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.38712},R:{_:"0"},M:{"0":0.07174},Q:{"13.1":0},O:{"0":1.09045},H:{"0":0.54335}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PA.js
index ad9cf0fc61e41f..bc6b5e0fe9611e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00401,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.02404,"74":0,"75":0,"76":0,"77":0,"78":0.00401,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.01202,"98":0.01602,"99":0,"100":0,"101":0,"102":0.00401,"103":0,"104":0.00401,"105":0,"106":0.00801,"107":0,"108":0,"109":0,"110":0.00801,"111":0,"112":0.00401,"113":0.00801,"114":0.02404,"115":0.15623,"116":0.42464,"117":0.02003,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00401,"45":0.00401,"46":0,"47":0.00401,"48":0,"49":0.00801,"50":0,"51":0.00401,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.02003,"69":0.00401,"70":0.00401,"71":0,"72":0,"73":0.00801,"74":0.01602,"75":0.00401,"76":0.00401,"77":0.00401,"78":0.00401,"79":0.04006,"80":0.00401,"81":0.01602,"83":0.01202,"84":0,"85":0.00401,"86":0.00401,"87":0.02804,"88":0.00801,"89":0.00801,"90":0,"91":0.01602,"92":0.00801,"93":0.0681,"94":0.00401,"95":0,"96":0.00401,"97":0.00401,"98":0.00801,"99":0.01602,"100":0.00401,"101":0.00401,"102":0.01602,"103":0.06009,"104":0.00801,"105":0.02003,"106":0.04807,"107":0.04407,"108":0.02404,"109":0.52879,"110":0.00801,"111":0.02003,"112":0.04006,"113":0.03205,"114":0.42864,"115":5.56033,"116":3.18076,"117":0.00401,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01202,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00401,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00401,"71":0.00401,"72":0.00401,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00401,"94":0,"95":0.00801,"96":0,"97":0,"98":0,"99":0.03205,"100":0.49274,"101":0.23235,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00401,"16":0.00401,"17":0,"18":0.00801,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01202,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01602,"110":0,"111":0.00401,"112":0.00801,"113":0.00401,"114":0.08813,"115":1.25788,"116":0.42063},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00401,"10":0,"11":0,"12":0.00401,"13":0,"14":0.03205,"15":0.00401,"17":0.00801,_:"0","3.1":0,"3.2":0,"5.1":0.00401,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.03205,"14.1":0.10816,"15.1":0.00401,"15.2-15.3":0.00801,"15.4":0.00801,"15.5":0.01202,"15.6":0.10015,"16.0":0.00401,"16.1":0.03605,"16.2":0.02404,"16.3":0.08813,"16.4":0.0681,"16.5":0.19629,"16.6":0.22434},G:{"8":0,"17":0.11485,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01511,"7.0-7.1":0.05138,"8.1-8.4":0.01209,"9.0-9.2":0.00302,"9.3":0.02418,"10.0-10.2":0,"10.3":0.03324,"11.0-11.2":0.03173,"11.3-11.4":0.00302,"12.0-12.1":0.0272,"12.2-12.5":0.27049,"13.0-13.1":0.03929,"13.2":0,"13.3":0.00604,"13.4-13.7":0.06196,"14.0-14.4":0.06347,"14.5-14.8":0.19191,"15.0-15.1":0.07253,"15.2-15.3":0.06044,"15.4":0.08613,"15.5":0.15867,"15.6-15.7":1.28294,"16.0":0.41858,"16.1":0.75858,"16.2":0.46391,"16.3":0.91272,"16.4":0.16169,"16.5":2.92251,"16.6":6.85143},P:{"4":0.16349,"20":0.15327,"21":0.42916,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.31676,"8.2":0,"9.2":0,"10.1":0.01022,"11.1-11.2":0.03065,"12.0":0,"13.0":0.01022,"14.0":0.01022,"15.0":0.01022,"16.0":0.05109,"17.0":0.08174,"18.0":0.03065,"19.0":0.14305},I:{"0":0,"3":0,"4":0.01815,"2.1":0,"2.2":0.00605,"2.3":0.0121,"4.1":0.01815,"4.2-4.3":0.05446,"4.4":0,"4.4.3-4.4.4":0.13918},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01946,"9":0.00486,"10":0.00486,"11":0.03892,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":62.74272},R:{_:"0"},M:{"0":0.23976},Q:{"13.1":0},O:{"0":0.1019},H:{"0":0.28941}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00402,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.0201,"74":0,"75":0,"76":0,"77":0,"78":0.00402,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.01206,"98":0.01608,"99":0,"100":0,"101":0,"102":0.00804,"103":0,"104":0.00402,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00402,"111":0,"112":0,"113":0.0201,"114":0.0201,"115":0.09246,"116":0.02814,"117":0.3819,"118":0.03618,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00402,"42":0,"43":0.00402,"44":0.00402,"45":0.00402,"46":0,"47":0,"48":0,"49":0.00402,"50":0,"51":0,"52":0,"53":0,"54":0.00402,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01608,"69":0.00402,"70":0.00402,"71":0,"72":0,"73":0.01206,"74":0.00804,"75":0.00804,"76":0.00804,"77":0.00402,"78":0.00402,"79":0.03216,"80":0.02412,"81":0.00804,"83":0.00804,"84":0.00402,"85":0.00402,"86":0.00402,"87":0.01608,"88":0.00804,"89":0.01206,"90":0.00402,"91":0.04422,"92":0,"93":0.0201,"94":0.00402,"95":0.00402,"96":0.00804,"97":0.00402,"98":0.00804,"99":0.01608,"100":0,"101":0.00402,"102":0.00402,"103":0.04422,"104":0.00402,"105":0.00402,"106":0.00804,"107":0.05226,"108":0.01206,"109":0.41004,"110":0.00804,"111":0.01206,"112":0.0402,"113":0.03618,"114":0.1206,"115":0.18492,"116":6.8139,"117":1.96578,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01206,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.01206,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00402,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01206,"73":0,"74":0,"75":0,"76":0,"77":0.01206,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00402,"96":0,"97":0,"98":0.00402,"99":0.01206,"100":0.11658,"101":0.29748,"102":0.32562,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00402,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00402,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02814,"110":0,"111":0.00402,"112":0.00804,"113":0.00804,"114":0.02412,"115":0.03618,"116":1.01706,"117":0.804},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00402,"10":0,"11":0,"12":0.00804,"13":0,"14":0.01206,"15":0.00402,_:"0","3.1":0,"3.2":0,"5.1":0.00402,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00402,"13.1":0.0201,"14.1":0.1005,"15.1":0.00402,"15.2-15.3":0.00804,"15.4":0.00804,"15.5":0.00804,"15.6":0.10854,"16.0":0.00804,"16.1":0.03216,"16.2":0.03216,"16.3":0.0603,"16.4":0.1005,"16.5":0.0603,"16.6":0.3819,"17.0":0.03216,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00653,"6.0-6.1":0.01795,"7.0-7.1":0.0457,"8.1-8.4":0.00979,"9.0-9.2":0,"9.3":0.02122,"10.0-10.2":0,"10.3":0.03917,"11.0-11.2":0.02774,"11.3-11.4":0.00326,"12.0-12.1":0.00653,"12.2-12.5":0.16483,"13.0-13.1":0.02122,"13.2":0,"13.3":0.03427,"13.4-13.7":0.06365,"14.0-14.4":0.06528,"14.5-14.8":0.1991,"15.0-15.1":0.05059,"15.2-15.3":0.06365,"15.4":0.06365,"15.5":0.0816,"15.6-15.7":1.30396,"16.0":0.38352,"16.1":0.70502,"16.2":0.42595,"16.3":0.72787,"16.4":0.15014,"16.5":0.47165,"16.6":9.64346,"17.0":1.22073,"17.1":0},P:{"4":0.14303,"20":0.13281,"21":0.31671,"22":3.32032,"5.0-5.4":0.01022,"6.2-6.4":0,"7.2-7.4":0.34736,"8.2":0,"9.2":0.02043,"10.1":0,"11.1-11.2":0.05108,"12.0":0.01022,"13.0":0.02043,"14.0":0.01022,"15.0":0.02043,"16.0":0.0613,"17.0":0.08173,"18.0":0.02043,"19.0":0.13281},I:{"0":0,"3":0,"4":0.01911,"2.1":0,"2.2":0.01274,"2.3":0.01911,"4.1":0.01911,"4.2-4.3":0.05096,"4.4":0,"4.4.3-4.4.4":0.15926},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.019,"9":0.00475,"10":0.00475,"11":0.02375,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.01196,"11":0},L:{"0":60.91766},R:{_:"0"},M:{"0":0.22724},Q:{"13.1":0.01196},O:{"0":0.19734},H:{"0":0.3227}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PE.js
index 7b16c7faa4bc11..bb6da300ac5403 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00516,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00516,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01032,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00516,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00516,"98":0,"99":0,"100":0,"101":0,"102":0.01032,"103":0,"104":0.00516,"105":0,"106":0,"107":0,"108":0,"109":0.00516,"110":0.01548,"111":0,"112":0.00516,"113":0,"114":0.01032,"115":0.13419,"116":0.40772,"117":0.02064,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.02581,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01032,"50":0,"51":0,"52":0,"53":0.01032,"54":0,"55":0,"56":0.00516,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.01548,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01548,"69":0,"70":0.00516,"71":0,"72":0,"73":0,"74":0.01032,"75":0,"76":0,"77":0,"78":0,"79":0.26321,"80":0.00516,"81":0.02064,"83":0.00516,"84":0,"85":0.00516,"86":0.00516,"87":0.04129,"88":0.01032,"89":0.00516,"90":0.00516,"91":0.04645,"92":0.01032,"93":0.01032,"94":0.01032,"95":0.01548,"96":0.02581,"97":0.01032,"98":0.01032,"99":0.03097,"100":0.01032,"101":0.01032,"102":0.01032,"103":0.04129,"104":0.01548,"105":0.02064,"106":0.03613,"107":0.02064,"108":0.04129,"109":1.68249,"110":0.02581,"111":0.04129,"112":0.06193,"113":0.0929,"114":0.57803,"115":11.18905,"116":6.75575,"117":0.00516,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01032,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00516,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00516,"72":0.00516,"73":0,"74":0.00516,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04129,"96":0,"97":0,"98":0.00516,"99":0.01032,"100":1.08897,"101":0.46965,"102":0.00516,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.01032,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01032,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02064,"110":0.00516,"111":0.00516,"112":0.01032,"113":0.00516,"114":0.04129,"115":1.10445,"116":0.37159},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01032,"15":0,"17":0.00516,_:"0","3.1":0,"3.2":0,"5.1":0.00516,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00516,"14.1":0.02064,"15.1":0.00516,"15.2-15.3":0,"15.4":0.00516,"15.5":0.01032,"15.6":0.03613,"16.0":0.00516,"16.1":0.01548,"16.2":0.01032,"16.3":0.02581,"16.4":0.01032,"16.5":0.07742,"16.6":0.08774},G:{"8":0,"17":0.04398,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00352,"6.0-6.1":0.00117,"7.0-7.1":0.00352,"8.1-8.4":0.00117,"9.0-9.2":0.00528,"9.3":0.0088,"10.0-10.2":0,"10.3":0.00938,"11.0-11.2":0.00997,"11.3-11.4":0.00176,"12.0-12.1":0.00528,"12.2-12.5":0.10028,"13.0-13.1":0.00293,"13.2":0.00293,"13.3":0.00762,"13.4-13.7":0.01818,"14.0-14.4":0.03401,"14.5-14.8":0.09735,"15.0-15.1":0.02639,"15.2-15.3":0.02991,"15.4":0.04574,"15.5":0.08034,"15.6-15.7":0.49144,"16.0":0.22109,"16.1":0.36183,"16.2":0.19529,"16.3":0.40992,"16.4":0.07858,"16.5":1.16995,"16.6":2.39503},P:{"4":0.42541,"20":0.05064,"21":0.11142,"22":0.6685,"5.0-5.4":0.03039,"6.2-6.4":0.01013,"7.2-7.4":0.11142,"8.2":0,"9.2":0.02026,"10.1":0,"11.1-11.2":0.02026,"12.0":0,"13.0":0.06077,"14.0":0.01013,"15.0":0.01013,"16.0":0.03039,"17.0":0.02026,"18.0":0.01013,"19.0":0.04052},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01307,"4.4":0,"4.4.3-4.4.4":0.11241},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00516,"9":0,"10":0,"11":0.02581,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.94807},R:{_:"0"},M:{"0":0.08226},Q:{"13.1":0},O:{"0":0.03871},H:{"0":0.21074}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00552,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00552,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01104,"69":0.00552,"70":0,"71":0,"72":0,"73":0,"74":0.00552,"75":0.00552,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00552,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00552,"98":0,"99":0,"100":0,"101":0,"102":0.00552,"103":0,"104":0.00552,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00552,"111":0,"112":0,"113":0,"114":0.00552,"115":0.07173,"116":0.04966,"117":0.50214,"118":0.05518,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.02207,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01104,"50":0,"51":0.00552,"52":0,"53":0.01655,"54":0,"55":0,"56":0,"57":0,"58":0.00552,"59":0,"60":0,"61":0,"62":0.01104,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01655,"69":0.00552,"70":0.00552,"71":0,"72":0,"73":0.00552,"74":0.01104,"75":0.01104,"76":0,"77":0.00552,"78":0.00552,"79":0.17658,"80":0.01655,"81":0.01655,"83":0.00552,"84":0.01104,"85":0.00552,"86":0.01655,"87":0.03311,"88":0.02207,"89":0.01655,"90":0.00552,"91":0.04966,"92":0.01104,"93":0.01104,"94":0.01104,"95":0.02207,"96":0.02207,"97":0.01104,"98":0.01104,"99":0.02759,"100":0.01104,"101":0.01104,"102":0.01104,"103":0.03863,"104":0.01655,"105":0.02207,"106":0.03863,"107":0.02759,"108":0.03863,"109":1.74921,"110":0.02207,"111":0.03863,"112":0.06622,"113":0.07173,"114":0.22072,"115":0.35315,"116":16.65884,"117":4.39785,"118":0.00552,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00552,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00552,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01104,"73":0.00552,"74":0.00552,"75":0,"76":0,"77":0.01104,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03863,"96":0,"97":0,"98":0,"99":0.01104,"100":0.29797,"101":0.56284,"102":0.68423,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00552,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.00552,"88":0,"89":0,"90":0,"91":0,"92":0.00552,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00552,"109":0.02759,"110":0.00552,"111":0.00552,"112":0.00552,"113":0.00552,"114":0.02207,"115":0.03863,"116":1.00428,"117":0.80011},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01104,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00552,"6.1":0,"7.1":0,"9.1":0.01655,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00552,"14.1":0.01655,"15.1":0.00552,"15.2-15.3":0,"15.4":0.00552,"15.5":0.01104,"15.6":0.03311,"16.0":0.00552,"16.1":0.01655,"16.2":0.00552,"16.3":0.02759,"16.4":0.01104,"16.5":0.04414,"16.6":0.13795,"17.0":0.01655,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00425,"6.0-6.1":0.00061,"7.0-7.1":0.00243,"8.1-8.4":0.00243,"9.0-9.2":0.00121,"9.3":0.01032,"10.0-10.2":0,"10.3":0.01032,"11.0-11.2":0.00971,"11.3-11.4":0.00182,"12.0-12.1":0.00303,"12.2-12.5":0.105,"13.0-13.1":0.00364,"13.2":0.00182,"13.3":0.02731,"13.4-13.7":0.01882,"14.0-14.4":0.02671,"14.5-14.8":0.07769,"15.0-15.1":0.02003,"15.2-15.3":0.02913,"15.4":0.03763,"15.5":0.0789,"15.6-15.7":0.46978,"16.0":0.19605,"16.1":0.30226,"16.2":0.18998,"16.3":0.37935,"16.4":0.05463,"16.5":0.23004,"16.6":3.24478,"17.0":0.47767,"17.1":0},P:{"4":0.22417,"20":0.04076,"21":0.07133,"22":0.70308,"5.0-5.4":0.02038,"6.2-6.4":0.01019,"7.2-7.4":0.06114,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01019,"12.0":0,"13.0":0.04076,"14.0":0.02038,"15.0":0.01019,"16.0":0.03057,"17.0":0.02038,"18.0":0.01019,"19.0":0.03057},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01121,"4.2-4.3":0.00672,"4.4":0,"4.4.3-4.4.4":0.09414},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00828,"9":0,"10":0,"11":0.02483,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":61.84398},R:{_:"0"},M:{"0":0.0986},Q:{"13.1":0},O:{"0":0.02689},H:{"0":0.20792}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PF.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PF.js
index ca89c8532f4e7c..d9531271da58ee 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PF.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PF.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00497,"68":0.01492,"69":0,"70":0,"71":0,"72":0.00497,"73":0,"74":0,"75":0.0199,"76":0,"77":0,"78":0.02984,"79":0,"80":0,"81":0,"82":0.00497,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.10943,"92":0,"93":0,"94":0.01492,"95":0,"96":0,"97":0,"98":0.00497,"99":0,"100":0,"101":0,"102":0.08456,"103":0,"104":0.0199,"105":0.00497,"106":0,"107":0,"108":0.03979,"109":0.00497,"110":0.00497,"111":0,"112":0.00497,"113":0.02487,"114":0.02487,"115":0.81076,"116":1.84038,"117":0.05471,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00995,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00995,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00497,"68":0.15419,"69":0,"70":0.00497,"71":0.00995,"72":0,"73":0,"74":0,"75":0,"76":0.00497,"77":0,"78":0,"79":0.03979,"80":0,"81":0.04477,"83":0,"84":0,"85":0.05969,"86":0.00497,"87":0.06466,"88":0,"89":0.00497,"90":0,"91":0.00497,"92":0.0199,"93":0.00497,"94":0,"95":0,"96":0.00497,"97":0,"98":0,"99":0,"100":0,"101":0.00497,"102":0.01492,"103":0.10445,"104":0.17906,"105":0.00497,"106":0.00497,"107":0,"108":0.01492,"109":0.48745,"110":0.00995,"111":0.01492,"112":0.0199,"113":0.14425,"114":0.29844,"115":6.17273,"116":3.28781,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01492,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0.00497,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00497,"72":0.0199,"73":0,"74":0,"75":0,"76":0,"77":0.00497,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00497,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00995,"96":0,"97":0,"98":0,"99":0.00995,"100":0.4974,"101":0.18404,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00497,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00497,"90":0.00497,"91":0,"92":0.00497,"93":0.00497,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00995,"103":0,"104":0,"105":0.00497,"106":0,"107":0.00995,"108":0.00497,"109":0.05969,"110":0.00497,"111":0,"112":0.00995,"113":0.01492,"114":0.25865,"115":2.14379,"116":0.70133},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.08953,"15":0.05471,"17":0.0199,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00995,"12.1":0.05471,"13.1":0.21886,"14.1":0.20891,"15.1":0.00995,"15.2-15.3":0.03482,"15.4":0.0199,"15.5":0.05471,"15.6":0.35813,"16.0":0.02984,"16.1":0.07461,"16.2":0.09451,"16.3":0.36808,"16.4":0.10943,"16.5":0.70133,"16.6":1.7409},G:{"8":0,"17":0.08024,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01505,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.09278,"10.0-10.2":0.00502,"10.3":0.06018,"11.0-11.2":0,"11.3-11.4":0.00752,"12.0-12.1":0,"12.2-12.5":0.62939,"13.0-13.1":0,"13.2":0.00251,"13.3":0.00752,"13.4-13.7":0.02006,"14.0-14.4":0.12538,"14.5-14.8":0.41374,"15.0-15.1":0.5968,"15.2-15.3":0.27834,"15.4":0.08024,"15.5":0.26078,"15.6-15.7":1.93833,"16.0":1.58477,"16.1":1.79039,"16.2":0.81997,"16.3":2.25177,"16.4":0.31344,"16.5":5.19563,"16.6":8.48552},P:{"4":0.07258,"20":0.12443,"21":0.59105,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.11406,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01037,"12.0":0,"13.0":0.01037,"14.0":0.01037,"15.0":0.02074,"16.0":0.05185,"17.0":0.02074,"18.0":0.03111,"19.0":0.11406},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.1344},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04477,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":42.69828},R:{_:"0"},M:{"0":0.50763},Q:{"13.1":0.02513},O:{"0":0.03518},H:{"0":0.18557}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00482,"64":0,"65":0,"66":0,"67":0.00482,"68":0.00482,"69":0,"70":0,"71":0.00482,"72":0.00963,"73":0,"74":0,"75":0.03372,"76":0,"77":0,"78":0.04335,"79":0,"80":0,"81":0,"82":0.00482,"83":0.00482,"84":0.13488,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.10597,"92":0,"93":0,"94":0.01445,"95":0,"96":0,"97":0,"98":0,"99":0.00963,"100":0,"101":0,"102":0.10116,"103":0,"104":0,"105":0.00482,"106":0,"107":0.01445,"108":0,"109":0,"110":0,"111":0,"112":0.00482,"113":0.00482,"114":0.00963,"115":0.34682,"116":0.1686,"117":2.06168,"118":0.24085,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00482,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.02409,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00963,"72":0,"73":0,"74":0,"75":0.00482,"76":0.00482,"77":0,"78":0,"79":0.04817,"80":0.00482,"81":0.03854,"83":0,"84":0,"85":0.08671,"86":0.00482,"87":0.07707,"88":0.00482,"89":0,"90":0,"91":0.00482,"92":0.01927,"93":0.10597,"94":0.00482,"95":0,"96":0,"97":0,"98":0.00482,"99":0.00482,"100":0,"101":0.00482,"102":0.08189,"103":0.13969,"104":0.08189,"105":0.00963,"106":0.00482,"107":0.00482,"108":0.13488,"109":0.36609,"110":0.00482,"111":0.00482,"112":0.15896,"113":0.04335,"114":0.08671,"115":0.1686,"116":5.70815,"117":1.7293,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00482,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00482,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0.00482,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01927,"73":0.00482,"74":0,"75":0,"76":0,"77":0.03372,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00482,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00963,"96":0,"97":0,"98":0,"99":0.00482,"100":0.12524,"101":0.21677,"102":0.20713,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00482,"16":0,"17":0,"18":0.00963,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.01445,"91":0,"92":0.00482,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00482,"99":0.00482,"100":0,"101":0,"102":0.00482,"103":0,"104":0,"105":0,"106":0.00482,"107":0.00482,"108":0.00482,"109":0.05299,"110":0.00482,"111":0,"112":0.01927,"113":0.00963,"114":0.06744,"115":0.03854,"116":2.72161,"117":1.1609},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00963,"14":0.07226,"15":0.01445,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00482,"12.1":0.03854,"13.1":0.20713,"14.1":0.12043,"15.1":0.02409,"15.2-15.3":0.03854,"15.4":0.01927,"15.5":0.13969,"15.6":0.95377,"16.0":0.03372,"16.1":0.10597,"16.2":0.05299,"16.3":0.26494,"16.4":0.06262,"16.5":0.21195,"16.6":1.88826,"17.0":0.10116,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00599,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.003,"9.0-9.2":0,"9.3":0.07491,"10.0-10.2":0.00599,"10.3":0.05694,"11.0-11.2":0,"11.3-11.4":0.03896,"12.0-12.1":0.003,"12.2-12.5":0.54238,"13.0-13.1":0.003,"13.2":0,"13.3":0.39555,"13.4-13.7":0.01498,"14.0-14.4":0.05694,"14.5-14.8":0.15882,"15.0-15.1":0.38356,"15.2-15.3":6.61049,"15.4":0.1798,"15.5":0.21575,"15.6-15.7":1.6721,"16.0":0.86002,"16.1":1.27056,"16.2":0.63528,"16.3":1.94479,"16.4":0.24872,"16.5":0.91696,"16.6":12.66661,"17.0":0.63228,"17.1":0},P:{"4":0.03092,"20":0.07214,"21":0.3607,"22":3.60696,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.1752,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01031,"12.0":0,"13.0":0,"14.0":0.02061,"15.0":0.02061,"16.0":0.02061,"17.0":0.02061,"18.0":0.03092,"19.0":0.05153},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02141,"4.4":0,"4.4.3-4.4.4":0.1142},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04335,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":40.64268},R:{_:"0"},M:{"0":0.51312},Q:{"13.1":0},O:{"0":0.07775},H:{"0":0.17174}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PG.js
index 5abe09942eb91e..a1198ea14bacfe 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00321,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00321,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0.00321,"81":0,"82":0,"83":0,"84":0.00321,"85":0,"86":0,"87":0,"88":0.00321,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00321,"98":0.00321,"99":0.00321,"100":0,"101":0,"102":0.00321,"103":0,"104":0,"105":0.00321,"106":0,"107":0.00321,"108":0.00321,"109":0.00963,"110":0.00963,"111":0.00321,"112":0.00321,"113":0.04173,"114":0.02568,"115":0.14766,"116":0.27285,"117":0.01284,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00642,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00321,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00963,"64":0.00321,"65":0.00321,"66":0,"67":0.00642,"68":0.00321,"69":0.01284,"70":0.01284,"71":0,"72":0,"73":0.00321,"74":0,"75":0,"76":0,"77":0,"78":0.00642,"79":0.00642,"80":0.00321,"81":0.03531,"83":0.00321,"84":0,"85":0.00321,"86":0.00321,"87":0.00642,"88":0.07062,"89":0,"90":0.01605,"91":0,"92":0.00321,"93":0.00321,"94":0.00321,"95":0.00321,"96":0.00321,"97":0,"98":0,"99":0.01926,"100":0.00321,"101":0,"102":0.00321,"103":0.06099,"104":0.00321,"105":0.00963,"106":0.01926,"107":0.00963,"108":0.02247,"109":0.3852,"110":0.01284,"111":0.01605,"112":0.01284,"113":0.04494,"114":0.16371,"115":2.16675,"116":1.08177,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00321,"38":0,"39":0,"40":0,"41":0,"42":0.00642,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00321,"64":0,"65":0.00321,"66":0.00321,"67":0,"68":0.00321,"69":0.00642,"70":0.04494,"71":0.04173,"72":0.11235,"73":0,"74":0.00321,"75":0.00321,"76":0.00642,"77":0.00321,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00321,"93":0,"94":0,"95":0.00642,"96":0,"97":0,"98":0.00321,"99":0.00321,"100":0.03852,"101":0.05457,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00321},B:{"12":0.00321,"13":0.00321,"14":0.00321,"15":0.00321,"16":0.01926,"17":0.01284,"18":0.02247,"79":0,"80":0.00321,"81":0,"83":0,"84":0.02247,"85":0.00642,"86":0,"87":0,"88":0,"89":0.00963,"90":0.02889,"91":0,"92":0.02247,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00963,"101":0.00321,"102":0.00321,"103":0.00321,"104":0.00321,"105":0.00321,"106":0.00321,"107":0.00642,"108":0.00642,"109":0.01284,"110":0.00963,"111":0.00963,"112":0.01284,"113":0.02568,"114":0.12519,"115":1.00794,"116":0.30174},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0.00642,"11":0,"12":0,"13":0,"14":0.00321,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00321,"13.1":0.00642,"14.1":0.00642,"15.1":0,"15.2-15.3":0.00321,"15.4":0,"15.5":0.00321,"15.6":0.00963,"16.0":0.00321,"16.1":0.00321,"16.2":0.00321,"16.3":0.00642,"16.4":0.00963,"16.5":0.04494,"16.6":0.05457},G:{"8":0,"17":0.00988,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00068,"7.0-7.1":0,"8.1-8.4":0.00068,"9.0-9.2":0.01022,"9.3":0.04803,"10.0-10.2":0,"10.3":0.01397,"11.0-11.2":0.00136,"11.3-11.4":0.01328,"12.0-12.1":0.00613,"12.2-12.5":0.06301,"13.0-13.1":0.00307,"13.2":0,"13.3":0.01669,"13.4-13.7":0.01703,"14.0-14.4":0.0763,"14.5-14.8":0.04019,"15.0-15.1":0.02521,"15.2-15.3":0.07357,"15.4":0.04871,"15.5":0.17031,"15.6-15.7":0.27522,"16.0":0.0855,"16.1":0.18428,"16.2":0.09333,"16.3":0.26296,"16.4":0.0872,"16.5":0.8226,"16.6":0.95714},P:{"4":0.09121,"20":0.21282,"21":0.69927,"5.0-5.4":0.01013,"6.2-6.4":0.02027,"7.2-7.4":0.27363,"8.2":0,"9.2":0.02027,"10.1":0,"11.1-11.2":0.05067,"12.0":0.01013,"13.0":0.06081,"14.0":0.06081,"15.0":0.02027,"16.0":0.21282,"17.0":0.0304,"18.0":0.15201,"19.0":0.28376},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01693,"4.2-4.3":0.06348,"4.4":0,"4.4.3-4.4.4":0.34701},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00361,"11":0.02528,"5.5":0},S:{"2.5":0.03395,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.51447},R:{_:"0"},M:{"0":0.11543},Q:{"13.1":0.01358},O:{"0":1.5617},H:{"0":1.82565}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00331,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00331,"90":0,"91":0,"92":0,"93":0,"94":0.00331,"95":0,"96":0,"97":0.00663,"98":0.00331,"99":0.00331,"100":0.00331,"101":0,"102":0.00331,"103":0.00663,"104":0,"105":0.00331,"106":0,"107":0.00331,"108":0,"109":0.00331,"110":0.00331,"111":0.00331,"112":0,"113":0.00663,"114":0.00331,"115":0.04638,"116":0.03313,"117":0.3578,"118":0.01657,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00663,"41":0,"42":0,"43":0.00331,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00331,"51":0,"52":0,"53":0,"54":0,"55":0.00331,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00331,"65":0.00331,"66":0,"67":0.00331,"68":0.00331,"69":0.00994,"70":0.01325,"71":0.00331,"72":0,"73":0.00331,"74":0.00331,"75":0,"76":0,"77":0,"78":0.00331,"79":0.02982,"80":0.00331,"81":0.00663,"83":0.00331,"84":0.00331,"85":0,"86":0,"87":0.00994,"88":0.0497,"89":0.00331,"90":0.00663,"91":0,"92":0.00331,"93":0.00331,"94":0.00331,"95":0.00663,"96":0.00331,"97":0,"98":0,"99":0.02319,"100":0.00331,"101":0.00331,"102":0.00331,"103":0.05963,"104":0.00331,"105":0.01325,"106":0.00663,"107":0.00994,"108":0.01325,"109":0.38431,"110":0.00994,"111":0.00994,"112":0.02319,"113":0.03313,"114":0.04307,"115":0.09276,"116":3.0082,"117":0.57646,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00663,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00663,"62":0,"63":0,"64":0.00331,"65":0.00663,"66":0.00331,"67":0,"68":0,"69":0.00994,"70":0.00663,"71":0.01325,"72":0.12921,"73":0.02319,"74":0,"75":0,"76":0.00663,"77":0.07951,"78":0.00663,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00994,"96":0,"97":0,"98":0,"99":0,"100":0.00331,"101":0.0762,"102":0.04638,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00331},B:{"12":0.00994,"13":0.00331,"14":0.00331,"15":0,"16":0.00994,"17":0.00331,"18":0.02319,"79":0,"80":0.00331,"81":0,"83":0,"84":0.01988,"85":0.00994,"86":0,"87":0,"88":0,"89":0.00663,"90":0.01657,"91":0,"92":0.02319,"93":0,"94":0,"95":0.00663,"96":0.00331,"97":0,"98":0,"99":0,"100":0.00663,"101":0,"102":0.00331,"103":0.00331,"104":0,"105":0.00331,"106":0.00331,"107":0.0265,"108":0,"109":0.00994,"110":0.00663,"111":0.00663,"112":0.01325,"113":0.04307,"114":0.05963,"115":0.06626,"116":0.68248,"117":0.46051},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00331,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00331,"14.1":0.00663,"15.1":0,"15.2-15.3":0.00663,"15.4":0,"15.5":0.00331,"15.6":0.00663,"16.0":0,"16.1":0,"16.2":0.00331,"16.3":0.00331,"16.4":0.00331,"16.5":0.00994,"16.6":0.06626,"17.0":0.00994,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00107,"7.0-7.1":0,"8.1-8.4":0.00645,"9.0-9.2":0.01343,"9.3":0.06689,"10.0-10.2":0,"10.3":0.02042,"11.0-11.2":0.00806,"11.3-11.4":0.0094,"12.0-12.1":0.00698,"12.2-12.5":0.08247,"13.0-13.1":0.00484,"13.2":0.00134,"13.3":0.00833,"13.4-13.7":0.01424,"14.0-14.4":0.0325,"14.5-14.8":0.03761,"15.0-15.1":0.06178,"15.2-15.3":0.03949,"15.4":0.05802,"15.5":0.15016,"15.6-15.7":0.20415,"16.0":0.10825,"16.1":0.09321,"16.2":0.08381,"16.3":0.10933,"16.4":0.08784,"16.5":0.2525,"16.6":1.02263,"17.0":0.07897,"17.1":0},P:{"4":0.09158,"20":0.20352,"21":0.67161,"22":1.86218,"5.0-5.4":0,"6.2-6.4":0.02035,"7.2-7.4":0.32563,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.09158,"12.0":0,"13.0":0.0407,"14.0":0.0407,"15.0":0.0407,"16.0":0.20352,"17.0":0.0407,"18.0":0.19334,"19.0":0.37651},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01092,"4.2-4.3":0.01819,"4.4":0,"4.4.3-4.4.4":0.32746},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00331,"11":0.00994,"5.5":0},S:{"2.5":0.02006,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.7703},R:{_:"0"},M:{"0":0.10031},Q:{"13.1":0.00669},O:{"0":1.40427},H:{"0":1.58904}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PH.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PH.js
index 98bf43ed923741..992d1ddf10a647 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PH.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PH.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.02951,"57":0,"58":0,"59":0.0059,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.0059,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03541,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.0059,"111":0,"112":0,"113":0.0059,"114":0.0059,"115":0.18886,"116":0.38953,"117":0.0118,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.0059,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.02361,"67":0,"68":0,"69":0.0059,"70":0,"71":0.04131,"72":0,"73":0,"74":0.0059,"75":0.0059,"76":0.0059,"77":0,"78":0.0118,"79":0.03541,"80":0.0059,"81":0.0059,"83":0.02361,"84":0.0059,"85":0.0059,"86":0.0118,"87":0.08263,"88":0.0118,"89":0.0059,"90":0.0118,"91":0.04131,"92":0.0118,"93":0.09443,"94":0.0059,"95":0.0118,"96":0.0059,"97":0.0118,"98":0.0059,"99":0.05902,"100":0.0059,"101":0.0118,"102":0.02361,"103":0.301,"104":0.02361,"105":0.02951,"106":0.02951,"107":0.02951,"108":0.04722,"109":1.56993,"110":0.03541,"111":0.07082,"112":0.11214,"113":0.14755,"114":1.13909,"115":16.31903,"116":7.94409,"117":0.02361,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0118,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.0059,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0059,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0118,"70":0.0059,"71":0.02951,"72":0.01771,"73":0,"74":0.0118,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0059,"96":0,"97":0,"98":0,"99":0.0059,"100":0.42494,"101":0.15935,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.0059,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0118,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.0059,"105":0,"106":0,"107":0,"108":0.0059,"109":0.02361,"110":0.0059,"111":0.0059,"112":0.0059,"113":0.0118,"114":0.07082,"115":2.24866,"116":0.63742},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0059,"14":0.0118,"15":0,"17":0.0059,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.0059,"12.1":0,"13.1":0.0118,"14.1":0.02361,"15.1":0.0059,"15.2-15.3":0.0059,"15.4":0.0059,"15.5":0.0118,"15.6":0.06492,"16.0":0.0059,"16.1":0.02361,"16.2":0.02361,"16.3":0.04722,"16.4":0.01771,"16.5":0.14165,"16.6":0.18886},G:{"8":0,"17":0.05645,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00084,"5.0-5.1":0.01011,"6.0-6.1":0,"7.0-7.1":0.0118,"8.1-8.4":0,"9.0-9.2":0.00253,"9.3":0.11375,"10.0-10.2":0.00253,"10.3":0.05814,"11.0-11.2":0.00758,"11.3-11.4":0.02612,"12.0-12.1":0.00843,"12.2-12.5":0.2772,"13.0-13.1":0.00421,"13.2":0.0059,"13.3":0.01011,"13.4-13.7":0.02949,"14.0-14.4":0.08594,"14.5-14.8":0.14829,"15.0-15.1":0.04634,"15.2-15.3":0.05392,"15.4":0.08089,"15.5":0.11627,"15.6-15.7":0.9521,"16.0":0.33871,"16.1":0.49964,"16.2":0.28142,"16.3":0.5106,"16.4":0.16346,"16.5":1.56128,"16.6":2.95741},P:{"4":0.16276,"20":0.03255,"21":0.0651,"5.0-5.4":0.0217,"6.2-6.4":0.01085,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01085,"18.0":0.01085,"19.0":0.01085},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.12771},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.12394,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":54.3835},R:{_:"0"},M:{"0":0.06967},Q:{"13.1":0.0041},O:{"0":0.39751},H:{"0":0.40349}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.02261,"57":0,"58":0,"59":0.00565,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00565,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03391,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00565,"114":0,"115":0.06217,"116":0.02826,"117":0.47477,"118":0.02826,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00565,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00565,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.03391,"67":0.00565,"68":0.00565,"69":0.00565,"70":0.00565,"71":0,"72":0,"73":0.00565,"74":0,"75":0.00565,"76":0.00565,"77":0,"78":0.0113,"79":0.03391,"80":0.00565,"81":0.00565,"83":0.01696,"84":0.00565,"85":0.00565,"86":0.0113,"87":0.13,"88":0.01696,"89":0.00565,"90":0.0113,"91":0.01696,"92":0.01696,"93":0.10174,"94":0.0113,"95":0.00565,"96":0.0113,"97":0.0113,"98":0.0113,"99":0.05652,"100":0.00565,"101":0.00565,"102":0.02261,"103":0.25999,"104":0.0113,"105":0.02826,"106":0.01696,"107":0.03391,"108":0.04522,"109":1.36778,"110":0.03391,"111":0.03956,"112":0.11869,"113":0.09043,"114":0.25999,"115":0.45781,"116":17.63424,"117":3.59467,"118":0.02826,"119":0.01696,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0113,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00565,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00565,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00565,"68":0,"69":0.0113,"70":0.00565,"71":0.00565,"72":0.04522,"73":0.0113,"74":0.0113,"75":0,"76":0,"77":0.01696,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00565,"96":0,"97":0,"98":0,"99":0,"100":0.12434,"101":0.23738,"102":0.25999,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00565,"18":0.00565,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00565,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00565,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00565,"108":0.00565,"109":0.02826,"110":0.00565,"111":0.00565,"112":0.00565,"113":0.0113,"114":0.02826,"115":0.06217,"116":2.1195,"117":1.47517},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00565,"14":0.00565,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00565,"10.1":0,"11.1":0.00565,"12.1":0,"13.1":0.00565,"14.1":0.02261,"15.1":0.0113,"15.2-15.3":0.00565,"15.4":0.00565,"15.5":0.0113,"15.6":0.05652,"16.0":0.00565,"16.1":0.02261,"16.2":0.01696,"16.3":0.03956,"16.4":0.01696,"16.5":0.04522,"16.6":0.29956,"17.0":0.02826,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00601,"6.0-6.1":0,"7.0-7.1":0.01287,"8.1-8.4":0,"9.0-9.2":0.00515,"9.3":0.10726,"10.0-10.2":0.00172,"10.3":0.05063,"11.0-11.2":0.01287,"11.3-11.4":0.03347,"12.0-12.1":0.00686,"12.2-12.5":0.27889,"13.0-13.1":0.00172,"13.2":0.00343,"13.3":0.0103,"13.4-13.7":0.02746,"14.0-14.4":0.07637,"14.5-14.8":0.13558,"15.0-15.1":0.04376,"15.2-15.3":0.05235,"15.4":0.07466,"15.5":0.10812,"15.6-15.7":0.94908,"16.0":0.30978,"16.1":0.42563,"16.2":0.23169,"16.3":0.43335,"16.4":0.13644,"16.5":0.38615,"16.6":4.07005,"17.0":0.50715,"17.1":0.00086},P:{"4":0.15839,"20":0.02112,"21":0.04224,"22":0.60189,"5.0-5.4":0.01056,"6.2-6.4":0.01056,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01056,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01056,"18.0":0.01056,"19.0":0.01056},I:{"0":0,"3":0,"4":0.042,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.108},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.13,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.3395},R:{_:"0"},M:{"0":0.07826},Q:{"13.1":0.00435},O:{"0":0.39132},H:{"0":0.40341}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PK.js
index 250c415788a981..9409c3b0c0c116 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PK.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0045,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00225,"103":0,"104":0,"105":0.00225,"106":0.00225,"107":0.00225,"108":0.00225,"109":0.00225,"110":0.00225,"111":0.00225,"112":0,"113":0.00225,"114":0.00225,"115":0.0563,"116":0.07882,"117":0.0045,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0.00225,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00225,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00225,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00225,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00225,"65":0.00225,"66":0,"67":0,"68":0.0045,"69":0.00225,"70":0.00225,"71":0.00225,"72":0.00225,"73":0.00225,"74":0.0045,"75":0.0045,"76":0.00225,"77":0.00225,"78":0.00225,"79":0.0045,"80":0.0045,"81":0.0045,"83":0.00225,"84":0.0045,"85":0.09008,"86":0.0045,"87":0.0045,"88":0.00225,"89":0.00225,"90":0.00225,"91":0.00225,"92":0.00225,"93":0.00676,"94":0.00225,"95":0.00676,"96":0.00225,"97":0.00225,"98":0.00225,"99":0.00225,"100":0.00225,"101":0.00225,"102":0.0045,"103":0.01802,"104":0.00225,"105":0.00901,"106":0.02477,"107":0.03153,"108":0.03603,"109":0.71388,"110":0.01802,"111":0.02252,"112":0.02252,"113":0.01126,"114":0.09458,"115":1.75881,"116":1.05168,"117":0.0045,"118":0.00225,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.01576,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00225,"62":0,"63":0,"64":0,"65":0,"66":0.00225,"67":0.00225,"68":0,"69":0.00676,"70":0.01126,"71":0.06531,"72":0.05855,"73":0,"74":0.00225,"75":0,"76":0.00225,"77":0.00225,"78":0,"79":0.00225,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00225,"92":0,"93":0.00225,"94":0,"95":0.02027,"96":0,"97":0,"98":0,"99":0.00225,"100":0.03828,"101":0.0563,"102":0.00225,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00225,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00225,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0045,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00225,"107":0.0045,"108":0.0045,"109":0.00901,"110":0.0045,"111":0.00225,"112":0.00225,"113":0.00225,"114":0.00676,"115":0.15764,"116":0.05405},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00225,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00225,"6.1":0,"7.1":0,"9.1":0.00225,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00225,"14.1":0.0045,"15.1":0.00225,"15.2-15.3":0,"15.4":0,"15.5":0.00225,"15.6":0.00901,"16.0":0,"16.1":0.0045,"16.2":0.0045,"16.3":0.00676,"16.4":0.00225,"16.5":0.01126,"16.6":0.01351},G:{"8":0,"17":0.05195,"3.2":0.00159,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00278,"6.0-6.1":0,"7.0-7.1":0.05631,"8.1-8.4":0.00119,"9.0-9.2":0.00198,"9.3":0.06067,"10.0-10.2":0.00119,"10.3":0.03965,"11.0-11.2":0.00436,"11.3-11.4":0.00555,"12.0-12.1":0.00397,"12.2-12.5":0.22999,"13.0-13.1":0.00119,"13.2":0.00238,"13.3":0.01031,"13.4-13.7":0.01903,"14.0-14.4":0.05988,"14.5-14.8":0.07336,"15.0-15.1":0.02617,"15.2-15.3":0.02538,"15.4":0.02617,"15.5":0.05076,"15.6-15.7":0.69869,"16.0":0.12253,"16.1":0.2173,"16.2":0.09041,"16.3":0.22999,"16.4":0.08684,"16.5":0.61541,"16.6":1.14756},P:{"4":0.13152,"20":0.05059,"21":0.12141,"5.0-5.4":0.01012,"6.2-6.4":0.02023,"7.2-7.4":0.03035,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01012,"12.0":0,"13.0":0.02023,"14.0":0,"15.0":0.01012,"16.0":0.02023,"17.0":0.05059,"18.0":0.02023,"19.0":0.03035},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01137,"4.4":0,"4.4.3-4.4.4":0.12692},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02027,"5.5":0},S:{"2.5":0.07748,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":83.18967},R:{_:"0"},M:{"0":0.06198},Q:{"13.1":0},O:{"0":3.72679},H:{"0":1.30568}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00481,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00241,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00241,"103":0.00241,"104":0,"105":0.00241,"106":0.00481,"107":0.00481,"108":0.00481,"109":0.00481,"110":0.00481,"111":0.00481,"112":0,"113":0.00241,"114":0.00241,"115":0.0409,"116":0.00722,"117":0.09624,"118":0.00962,"119":0,"120":0,"3.5":0,"3.6":0.00241},D:{"4":0.00481,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00241,"44":0,"45":0,"46":0,"47":0,"48":0.00241,"49":0.00241,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00241,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00241,"65":0,"66":0.00241,"67":0,"68":0.00481,"69":0.00241,"70":0.00241,"71":0.00241,"72":0.00241,"73":0.00241,"74":0.00481,"75":0.00241,"76":0.00481,"77":0.00241,"78":0.00481,"79":0.00481,"80":0.00722,"81":0.00722,"83":0.00241,"84":0.00481,"85":0.10586,"86":0.00962,"87":0.00481,"88":0.00241,"89":0.00481,"90":0.00241,"91":0.00481,"92":0.00241,"93":0.00722,"94":0,"95":0.00481,"96":0.00241,"97":0.00481,"98":0.00241,"99":0.00241,"100":0.00241,"101":0.00241,"102":0.00481,"103":0.02165,"104":0.00481,"105":0.01925,"106":0.0409,"107":0.05293,"108":0.06015,"109":0.78195,"110":0.03609,"111":0.03609,"112":0.03609,"113":0.00962,"114":0.03368,"115":0.06015,"116":2.40841,"117":0.64721,"118":0.00481,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00241,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.01684,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00241,"62":0,"63":0.00241,"64":0,"65":0,"66":0,"67":0.00241,"68":0,"69":0.00722,"70":0.00481,"71":0.01203,"72":0.12271,"73":0.03609,"74":0,"75":0,"76":0,"77":0.01203,"78":0.00241,"79":0.00241,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00241,"92":0.00241,"93":0.00241,"94":0.00241,"95":0.01444,"96":0,"97":0,"98":0,"99":0,"100":0.00722,"101":0.04812,"102":0.04812,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00241,"13":0,"14":0,"15":0.00241,"16":0,"17":0,"18":0.00481,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00481,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00241,"107":0.00962,"108":0.00962,"109":0.01203,"110":0.00722,"111":0.00241,"112":0.00241,"113":0.00241,"114":0.00241,"115":0.00481,"116":0.12992,"117":0.08902},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00241,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00241,"6.1":0,"7.1":0,"9.1":0.00481,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00241,"14.1":0.00481,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00241,"15.6":0.00962,"16.0":0,"16.1":0.00481,"16.2":0.00241,"16.3":0.00481,"16.4":0.00241,"16.5":0.00481,"16.6":0.02406,"17.0":0.00241,"17.1":0},G:{"8":0,"3.2":0.00092,"4.0-4.1":0,"4.2-4.3":0.00046,"5.0-5.1":0.00415,"6.0-6.1":0,"7.0-7.1":0.06506,"8.1-8.4":0.00092,"9.0-9.2":0.00369,"9.3":0.06321,"10.0-10.2":0.00092,"10.3":0.04199,"11.0-11.2":0.006,"11.3-11.4":0.00554,"12.0-12.1":0.00508,"12.2-12.5":0.22239,"13.0-13.1":0.00138,"13.2":0.00277,"13.3":0.17902,"13.4-13.7":0.01523,"14.0-14.4":0.0669,"14.5-14.8":0.07059,"15.0-15.1":0.02814,"15.2-15.3":0.02538,"15.4":0.02584,"15.5":0.04891,"15.6-15.7":0.7756,"16.0":0.12873,"16.1":0.23808,"16.2":0.09597,"16.3":0.19794,"16.4":0.07751,"16.5":0.17994,"16.6":1.7136,"17.0":0.26484,"17.1":0},P:{"4":0.14295,"20":0.04084,"21":0.09189,"22":0.71473,"5.0-5.4":0.01021,"6.2-6.4":0.02042,"7.2-7.4":0.02042,"8.2":0,"9.2":0.01021,"10.1":0,"11.1-11.2":0.01021,"12.0":0,"13.0":0.02042,"14.0":0,"15.0":0,"16.0":0.02042,"17.0":0.06126,"18.0":0.02042,"19.0":0.03063},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01315,"4.4":0,"4.4.3-4.4.4":0.13812},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00241,"9":0,"10":0,"11":0.02647,"5.5":0},S:{"2.5":0.07594,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":81.63853},R:{_:"0"},M:{"0":0.06075},Q:{"13.1":0},O:{"0":3.85016},H:{"0":1.40195}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PL.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PL.js
index f44ffcc3f0934c..087962302ecdf3 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PL.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PL.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01813,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00363,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00725,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00363,"88":0,"89":0.00363,"90":0.00363,"91":0.00363,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00363,"100":0,"101":0,"102":0.05439,"103":0.00363,"104":0.00363,"105":0.00363,"106":0.00363,"107":0.00363,"108":0.00363,"109":0.00363,"110":0.00725,"111":0.00725,"112":0.00725,"113":0.01813,"114":0.03263,"115":0.44237,"116":1.27635,"117":0.04351,"118":0.00363,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00363,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00363,"79":0.0979,"80":0,"81":0.00363,"83":0,"84":0,"85":0.01088,"86":0,"87":0.0145,"88":0.00363,"89":0.01088,"90":0.00363,"91":0.00363,"92":0.00363,"93":0,"94":0,"95":0.00363,"96":0,"97":0.00363,"98":0.00363,"99":0.04351,"100":0.00363,"101":0,"102":0.00363,"103":0.01088,"104":0.38798,"105":0.00725,"106":0.01088,"107":0.01088,"108":0.02176,"109":0.39161,"110":0.0145,"111":0.01088,"112":0.01813,"113":0.02901,"114":0.22844,"115":3.4592,"116":2.15022,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00725,"72":0.00725,"73":0.00363,"74":0.00363,"75":0,"76":0.00725,"77":0.01813,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00363,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00363,"94":0,"95":0.06889,"96":0,"97":0.00363,"98":0.00363,"99":0.02176,"100":1.66796,"101":0.76871,"102":0.00725,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00363,"108":0.00363,"109":0.01813,"110":0.00363,"111":0,"112":0.00363,"113":0.00363,"114":0.03989,"115":0.71432,"116":0.24294},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00363,"15":0,"17":0.00725,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00725,"14.1":0.01088,"15.1":0.00363,"15.2-15.3":0,"15.4":0.00363,"15.5":0.00725,"15.6":0.02538,"16.0":0.00725,"16.1":0.0145,"16.2":0.01088,"16.3":0.02176,"16.4":0.01088,"16.5":0.07977,"16.6":0.0834},G:{"8":0,"17":0.20499,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00491,"10.0-10.2":0,"10.3":0.00859,"11.0-11.2":0.00245,"11.3-11.4":0.00123,"12.0-12.1":0,"12.2-12.5":0.04664,"13.0-13.1":0,"13.2":0,"13.3":0.00368,"13.4-13.7":0.00736,"14.0-14.4":0.0356,"14.5-14.8":0.09083,"15.0-15.1":0.02578,"15.2-15.3":0.04051,"15.4":0.04664,"15.5":0.10065,"15.6-15.7":0.69106,"16.0":0.37069,"16.1":0.85677,"16.2":0.37683,"16.3":0.76962,"16.4":0.12275,"16.5":2.42302,"16.6":6.03422},P:{"4":0.01011,"20":0.07079,"21":0.21237,"22":2.40685,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01011,"12.0":0,"13.0":0.01011,"14.0":0.02023,"15.0":0.01011,"16.0":0.02023,"17.0":0.02023,"18.0":0.03034,"19.0":0.04045},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.03363},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00363,"9":0,"10":0,"11":0.00725,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.66071},R:{_:"0"},M:{"0":0.67564},Q:{"13.1":0},O:{"0":0.03824},H:{"0":2.82414}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00385,"49":0,"50":0,"51":0,"52":0.02308,"53":0,"54":0,"55":0,"56":0.00385,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00385,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00385,"88":0,"89":0,"90":0,"91":0.00385,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00385,"99":0.00385,"100":0,"101":0,"102":0.05386,"103":0.00385,"104":0.00385,"105":0.00385,"106":0.00385,"107":0.00385,"108":0.00385,"109":0.00385,"110":0.00385,"111":0.00385,"112":0.00769,"113":0.01154,"114":0.02308,"115":0.23851,"116":0.08079,"117":1.43878,"118":0.13465,"119":0.00385,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00385,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00385,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00385,"79":0.09618,"80":0.00385,"81":0.00385,"83":0,"84":0,"85":0.01154,"86":0.00385,"87":0.01154,"88":0.00385,"89":0.00769,"90":0.00385,"91":0.00385,"92":0.00385,"93":0.01154,"94":0,"95":0.00385,"96":0,"97":0.00385,"98":0.00385,"99":0.02693,"100":0.00385,"101":0,"102":0.00385,"103":0.01154,"104":0.11926,"105":0.00769,"106":0.01539,"107":0.01539,"108":0.02308,"109":0.42702,"110":0.01539,"111":0.01539,"112":0.01924,"113":0.02308,"114":0.09618,"115":0.09618,"116":4.97802,"117":1.65421,"118":0.00385,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00385,"70":0,"71":0,"72":0.01154,"73":0.00769,"74":0,"75":0,"76":0,"77":0.18081,"78":0.00385,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00769,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00385,"92":0,"93":0,"94":0.00385,"95":0.06925,"96":0,"97":0,"98":0,"99":0.01154,"100":0.40778,"101":0.86942,"102":1.63882,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00385,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00385,"107":0.00385,"108":0.00385,"109":0.02308,"110":0.00385,"111":0,"112":0.00385,"113":0.00385,"114":0.01154,"115":0.02693,"116":0.5732,"117":0.5078},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00385,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00385,"14.1":0.01539,"15.1":0,"15.2-15.3":0,"15.4":0.00385,"15.5":0.00385,"15.6":0.02693,"16.0":0.00385,"16.1":0.01154,"16.2":0.00769,"16.3":0.02308,"16.4":0.01154,"16.5":0.03462,"16.6":0.14619,"17.0":0.01924,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00533,"10.0-10.2":0,"10.3":0.00933,"11.0-11.2":0.00133,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.05596,"13.0-13.1":0,"13.2":0,"13.3":0.07861,"13.4-13.7":0.00666,"14.0-14.4":0.03731,"14.5-14.8":0.08793,"15.0-15.1":0.02531,"15.2-15.3":0.03997,"15.4":0.04663,"15.5":0.09859,"15.6-15.7":0.68215,"16.0":0.32909,"16.1":0.77408,"16.2":0.33841,"16.3":0.65284,"16.4":0.0866,"16.5":0.32109,"16.6":7.92604,"17.0":1.56682,"17.1":0.00266},P:{"4":0.01009,"20":0.06052,"21":0.12105,"22":2.36042,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01009,"12.0":0,"13.0":0.01009,"14.0":0.02017,"15.0":0.01009,"16.0":0.02017,"17.0":0.02017,"18.0":0.03026,"19.0":0.04035},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.04385},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00385,"9":0,"10":0,"11":0.00769,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":63.34986},R:{_:"0"},M:{"0":0.63991},Q:{"13.1":0},O:{"0":0.04307},H:{"0":2.67962}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PM.js
index 3440d84cedb1e3..4d959004ca5583 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.272,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.0255,"115":0.30175,"116":0.65875,"117":0.0085,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0255,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.0085,"75":0,"76":0.02125,"77":0,"78":0,"79":0,"80":0.0085,"81":0,"83":0,"84":0,"85":0.00425,"86":0,"87":0.00425,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.04675,"97":0,"98":0.0085,"99":0,"100":0,"101":0,"102":0,"103":0.02975,"104":0,"105":0,"106":0,"107":0,"108":0,"109":1.2325,"110":0.0085,"111":0.04675,"112":0,"113":0.00425,"114":0.952,"115":2.55425,"116":1.05825,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.02975,"100":0.91375,"101":0.05525,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0255,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.0425,"115":0.95625,"116":0.42075},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0255,"15":0,"17":0.18275,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00425,"13.1":0.0085,"14.1":0.0255,"15.1":0.034,"15.2-15.3":0.2295,"15.4":0,"15.5":0.05525,"15.6":0.56525,"16.0":0,"16.1":0.12325,"16.2":0.14025,"16.3":1.411,"16.4":0.221,"16.5":1.853,"16.6":1.6745},G:{"8":0,"17":0.2864,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.02808,"11.0-11.2":0,"11.3-11.4":0.01123,"12.0-12.1":0,"12.2-12.5":3.63333,"13.0-13.1":0.01123,"13.2":0,"13.3":0.12354,"13.4-13.7":0,"14.0-14.4":0.01123,"14.5-14.8":0.03931,"15.0-15.1":1.0389,"15.2-15.3":0.55595,"15.4":0.05054,"15.5":0.34817,"15.6-15.7":4.07696,"16.0":1.41514,"16.1":2.62813,"16.2":1.20175,"16.3":4.66099,"16.4":0.79181,"16.5":13.69657,"16.6":21.55849},P:{"4":0.02155,"20":0,"21":0.26931,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0.09695,"19.0":0.01077},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.8335},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0085,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":23.307},R:{_:"0"},M:{"0":0.10925},Q:{"13.1":0},O:{"0":0},H:{"0":0.22864}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00459,"95":0,"96":0,"97":0,"98":0,"99":0.00919,"100":0,"101":0,"102":0.01837,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.05512,"109":0,"110":0,"111":0.00919,"112":0.03674,"113":0.00459,"114":0,"115":0.04593,"116":0.04593,"117":1.0472,"118":0.09645,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.02756,"77":0.00459,"78":0,"79":0,"80":0.00459,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.02297,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.08727,"104":0,"105":0,"106":0,"107":0,"108":0,"109":1.17581,"110":0,"111":0.07349,"112":0.11023,"113":0,"114":0.23424,"115":0.51442,"116":3.74789,"117":0.77162,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.01837,"100":0.36744,"101":0.17453,"102":1.92906,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00919,"115":0,"116":0.71651,"117":0.49604},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00459,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00459,"14.1":0.07349,"15.1":0.10105,"15.2-15.3":0.43174,"15.4":0.00459,"15.5":0.01837,"15.6":0.5236,"16.0":0.02756,"16.1":0.20209,"16.2":0.15616,"16.3":0.60168,"16.4":0.1975,"16.5":1.29063,"16.6":4.05562,"17.0":0.21587,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.04168,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":1.42754,"13.0-13.1":0,"13.2":0,"13.3":0.04168,"13.4-13.7":0,"14.0-14.4":0.0521,"14.5-14.8":0.0521,"15.0-15.1":0.3647,"15.2-15.3":0.5731,"15.4":0.01042,"15.5":0.18756,"15.6-15.7":3.56885,"16.0":0.85965,"16.1":1.71409,"16.2":1.31292,"16.3":2.35492,"16.4":0.54184,"16.5":2.12047,"16.6":33.92755,"17.0":2.3966,"17.1":0},P:{"4":0.02071,"20":0.02071,"21":0.02071,"22":1.16998,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0.02071,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0.18637,"19.0":0.02071},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.47756},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":25.28864},R:{_:"0"},M:{"0":0.18384},Q:{"13.1":0},O:{"0":0},H:{"0":0.14333}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PN.js
index 771a98b4a71c7e..d784e7cbec5f84 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":28.57,"116":14.29,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0},P:{"4":0,"20":0,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.14},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":32,"117":32,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0,"17.0":0,"17.1":0},P:{"4":0,"20":0,"21":0,"22":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":36},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PR.js
index b58f69d4c042d7..f2d8d8001007fc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00392,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.01569,"74":0,"75":0,"76":0,"77":0,"78":0.00784,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00784,"103":0,"104":0.01177,"105":0,"106":0,"107":0.00392,"108":0,"109":0,"110":0.00392,"111":0.00392,"112":0.00392,"113":0.00392,"114":0.0353,"115":0.1255,"116":0.5177,"117":0.01569,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00784,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.01177,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00392,"75":0,"76":0.00392,"77":0,"78":0,"79":0.01569,"80":0.00392,"81":0.00392,"83":0,"84":0,"85":0.00784,"86":0,"87":0.01961,"88":0,"89":0.00784,"90":0.00392,"91":0.00392,"92":0,"93":0.00392,"94":0.00392,"95":0,"96":0,"97":0,"98":0,"99":0.00392,"100":0,"101":0.00392,"102":0.00392,"103":0.07452,"104":0.00392,"105":0.00392,"106":0.00784,"107":0.00784,"108":0.0353,"109":0.2667,"110":0.00784,"111":0.01177,"112":0.03138,"113":0.06667,"114":0.40397,"115":4.46716,"116":2.82384,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00392,"74":0.00392,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00784,"96":0,"97":0.00392,"98":0,"99":0.00392,"100":0.22748,"101":0.10197,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00392,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00392,"106":0,"107":0.00392,"108":0.00784,"109":0.01961,"110":0.00392,"111":0.00784,"112":0.00784,"113":0.01177,"114":0.10982,"115":1.78059,"116":0.60791},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00392,"10":0,"11":0,"12":0.00392,"13":0.00784,"14":0.02745,"15":0.00784,"17":0.01961,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00784,"13.1":0.03922,"14.1":0.06667,"15.1":0.01961,"15.2-15.3":0.01569,"15.4":0.02745,"15.5":0.0706,"15.6":0.1608,"16.0":0.01569,"16.1":0.08236,"16.2":0.06275,"16.3":0.25101,"16.4":0.06667,"16.5":0.65497,"16.6":0.90206},G:{"8":0,"17":0.33236,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.01494,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03734,"10.0-10.2":0,"10.3":0.03361,"11.0-11.2":0.02241,"11.3-11.4":0.02241,"12.0-12.1":0.00373,"12.2-12.5":0.15684,"13.0-13.1":0.00747,"13.2":0,"13.3":0.00747,"13.4-13.7":0.10083,"14.0-14.4":0.15684,"14.5-14.8":0.37343,"15.0-15.1":0.16058,"15.2-15.3":0.21659,"15.4":0.1419,"15.5":0.34356,"15.6-15.7":1.44892,"16.0":1.3705,"16.1":1.86343,"16.2":1.15018,"16.3":2.43852,"16.4":0.67965,"16.5":7.53589,"16.6":18.69409},P:{"4":0.14334,"20":0.14334,"21":0.34811,"5.0-5.4":0.01024,"6.2-6.4":0.01024,"7.2-7.4":0.03072,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02048,"12.0":0,"13.0":0.03072,"14.0":0.01024,"15.0":0,"16.0":0.08191,"17.0":0.01024,"18.0":0.07167,"19.0":0.06143},I:{"0":0,"3":0,"4":0.01943,"2.1":0,"2.2":0.01295,"2.3":0.01295,"4.1":0.01943,"4.2-4.3":0.04533,"4.4":0,"4.4.3-4.4.4":0.14247},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01177,"9":0,"10":0.00392,"11":0.01961,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":41.77364},R:{_:"0"},M:{"0":0.3039},Q:{"13.1":0},O:{"0":0.01216},H:{"0":0.21291}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00398,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.01991,"74":0,"75":0,"76":0,"77":0,"78":0.00398,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00398,"103":0,"104":0.01991,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00398,"112":0,"113":0.00398,"114":0.02389,"115":0.03583,"116":0.05573,"117":0.7763,"118":0.04379,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00398,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.01194,"66":0,"67":0,"68":0.00398,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00398,"75":0,"76":0.00398,"77":0,"78":0,"79":0.01194,"80":0.03583,"81":0,"83":0.00398,"84":0.00398,"85":0.00398,"86":0,"87":0.01991,"88":0.00398,"89":0.00398,"90":0.00398,"91":0.00398,"92":0,"93":0,"94":0.00398,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00796,"102":0.00398,"103":0.05972,"104":0.00398,"105":0.00796,"106":0.00398,"107":0.00796,"108":0.01194,"109":0.27469,"110":0.00796,"111":0.01592,"112":0.02787,"113":0.04379,"114":0.10749,"115":0.21896,"116":6.40941,"117":1.33364,"118":0.00796,"119":0.00398,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00398,"74":0,"75":0,"76":0,"77":0.01194,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00398,"96":0,"97":0.00398,"98":0,"99":0,"100":0.05573,"101":0.14332,"102":0.16322,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00398,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00398,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00398,"108":0.00796,"109":0.01991,"110":0.00398,"111":0.00796,"112":0.00796,"113":0.00796,"114":0.02787,"115":0.05573,"116":1.4451,"117":1.01117},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00398,"9":0.00398,"10":0,"11":0,"12":0,"13":0.01592,"14":0.02787,"15":0.03981,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00796,"10.1":0,"11.1":0,"12.1":0.00398,"13.1":0.03583,"14.1":0.08758,"15.1":0.01592,"15.2-15.3":0.01194,"15.4":0.02389,"15.5":0.05573,"15.6":0.19507,"16.0":0.01194,"16.1":0.09156,"16.2":0.05573,"16.3":0.2309,"16.4":0.05175,"16.5":0.19905,"16.6":1.05497,"17.0":0.07166,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00374,"8.1-8.4":0.00374,"9.0-9.2":0,"9.3":0.03365,"10.0-10.2":0,"10.3":0.01495,"11.0-11.2":0.02243,"11.3-11.4":0.01869,"12.0-12.1":0.00374,"12.2-12.5":0.09347,"13.0-13.1":0,"13.2":0,"13.3":0.00748,"13.4-13.7":0.09347,"14.0-14.4":0.1645,"14.5-14.8":0.33274,"15.0-15.1":0.12338,"15.2-15.3":0.20937,"15.4":0.12712,"15.5":0.29536,"15.6-15.7":1.2562,"16.0":0.97954,"16.1":1.59642,"16.2":0.93841,"16.3":1.53287,"16.4":0.46734,"16.5":1.43566,"16.6":24.96329,"17.0":2.2993,"17.1":0.00748},P:{"4":0.12248,"20":0.08166,"21":0.24497,"22":2.62318,"5.0-5.4":0.01021,"6.2-6.4":0.02041,"7.2-7.4":0.02041,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03062,"12.0":0,"13.0":0.02041,"14.0":0.01021,"15.0":0,"16.0":0.06124,"17.0":0.02041,"18.0":0.06124,"19.0":0.05103},I:{"0":0,"3":0,"4":0.02803,"2.1":0,"2.2":0.00934,"2.3":0.01869,"4.1":0.02803,"4.2-4.3":0.0654,"4.4":0,"4.4.3-4.4.4":0.17752},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01194,"9":0.00398,"10":0.00398,"11":0.01592,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":41.86905},R:{_:"0"},M:{"0":0.29493},Q:{"13.1":0},O:{"0":0.01806},H:{"0":0.19944}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PS.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PS.js
index f6870989ea83a0..7227fed2c374e8 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PS.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PS.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00262,"109":0,"110":0.00262,"111":0.00262,"112":0,"113":0.00262,"114":0.00262,"115":0.06017,"116":0.13865,"117":0.00523,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00262,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00262,"47":0,"48":0,"49":0.00262,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00262,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00262,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.03662,"78":0.00262,"79":0.01308,"80":0,"81":0.00785,"83":0.00262,"84":0.00262,"85":0,"86":0.00262,"87":0.00523,"88":0.00262,"89":0.00785,"90":0.00262,"91":0,"92":0.00262,"93":0,"94":0,"95":0.01308,"96":0,"97":0,"98":0.00523,"99":0.00523,"100":0.01831,"101":0.00262,"102":0.00262,"103":0.00262,"104":0.00262,"105":0.00523,"106":0.00262,"107":0.00785,"108":0.00523,"109":0.41333,"110":0.00523,"111":0.00523,"112":0.04186,"113":0.01308,"114":0.12557,"115":2.91946,"116":1.69255,"117":0.00262,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00262,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.01308,"72":0.0157,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00523,"96":0,"97":0,"98":0,"99":0.00262,"100":0.06802,"101":0.08894,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00262,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00262,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01046,"110":0,"111":0,"112":0.00262,"113":0.00523,"114":0.02616,"115":0.38194,"116":0.13342},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00262,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00523,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00262,"14.1":0.00523,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00262,"15.6":0.0157,"16.0":0,"16.1":0.01046,"16.2":0.00523,"16.3":0.0157,"16.4":0.00523,"16.5":0.04186,"16.6":0.06017},G:{"8":0,"17":0.12118,"3.2":0.00263,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00263,"6.0-6.1":0,"7.0-7.1":0.02766,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01712,"10.0-10.2":0,"10.3":0.01449,"11.0-11.2":0.00395,"11.3-11.4":0,"12.0-12.1":0.0079,"12.2-12.5":0.12381,"13.0-13.1":0.00263,"13.2":0,"13.3":0.01054,"13.4-13.7":0.01317,"14.0-14.4":0.0843,"14.5-14.8":0.19757,"15.0-15.1":0.04083,"15.2-15.3":0.06717,"15.4":0.07508,"15.5":0.1462,"15.6-15.7":1.31057,"16.0":0.64804,"16.1":0.5914,"16.2":0.39778,"16.3":0.81532,"16.4":0.20021,"16.5":2.53025,"16.6":5.70853},P:{"4":0.07129,"20":0.17314,"21":0.40739,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.06111,"8.2":0.01018,"9.2":0.01018,"10.1":0,"11.1-11.2":0.06111,"12.0":0.02037,"13.0":0.07129,"14.0":0.06111,"15.0":0.03055,"16.0":0.11203,"17.0":0.11203,"18.0":0.08148,"19.0":0.14259},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.15878},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00523,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":73.87159},R:{_:"0"},M:{"0":0.06646},Q:{"13.1":0},O:{"0":0.08861},H:{"0":0.3006}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00292,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00292,"109":0.00292,"110":0,"111":0,"112":0,"113":0.00292,"114":0.00292,"115":0.04383,"116":0.02045,"117":0.1724,"118":0.01169,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00292,"36":0,"37":0,"38":0.00292,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00292,"47":0,"48":0,"49":0.00292,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00292,"59":0,"60":0,"61":0,"62":0,"63":0.00292,"64":0,"65":0,"66":0,"67":0,"68":0.00292,"69":0.01461,"70":0,"71":0,"72":0.00292,"73":0.00292,"74":0.01753,"75":0,"76":0,"77":0.04383,"78":0,"79":0.00877,"80":0,"81":0.00877,"83":0.00292,"84":0.00292,"85":0,"86":0.00292,"87":0.00877,"88":0,"89":0.00584,"90":0.00292,"91":0,"92":0.00292,"93":0,"94":0,"95":0.01169,"96":0.00292,"97":0.00292,"98":0.00584,"99":0.00292,"100":0.01461,"101":0.00292,"102":0.00584,"103":0.00584,"104":0.01169,"105":0.00877,"106":0.00584,"107":0.00877,"108":0.01461,"109":0.58732,"110":0.01461,"111":0.01169,"112":0.03506,"113":0.01461,"114":0.04675,"115":0.07305,"116":4.53202,"117":1.23016,"118":0.00292,"119":0.00292,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00292,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.02338,"73":0.01169,"74":0,"75":0,"76":0,"77":0.00877,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00584,"96":0,"97":0,"98":0,"99":0,"100":0.01169,"101":0.06721,"102":0.06428,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.00292,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00292,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00292,"108":0.00292,"109":0.00584,"110":0.00292,"111":0,"112":0.00292,"113":0.00292,"114":0.00877,"115":0.01461,"116":0.36525,"117":0.24837},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00292,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00584,"6.1":0,"7.1":0,"9.1":0.01753,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00292,"14.1":0.00584,"15.1":0,"15.2-15.3":0,"15.4":0.00292,"15.5":0.00584,"15.6":0.01461,"16.0":0.00292,"16.1":0.01461,"16.2":0.00584,"16.3":0.02045,"16.4":0.00584,"16.5":0.01753,"16.6":0.08182,"17.0":0.01461,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00143,"6.0-6.1":0,"7.0-7.1":0.03587,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04591,"10.0-10.2":0,"10.3":0.01578,"11.0-11.2":0.00287,"11.3-11.4":0,"12.0-12.1":0.01148,"12.2-12.5":0.12483,"13.0-13.1":0.00143,"13.2":0,"13.3":0.16644,"13.4-13.7":0.01435,"14.0-14.4":0.08896,"14.5-14.8":0.23674,"15.0-15.1":0.033,"15.2-15.3":0.06313,"15.4":0.08752,"15.5":0.13057,"15.6-15.7":1.31715,"16.0":0.60836,"16.1":0.57536,"16.2":0.30992,"16.3":0.67723,"16.4":0.12626,"16.5":0.4864,"16.6":7.86989,"17.0":1.08758,"17.1":0.00287},P:{"4":0.07076,"20":0.12131,"21":0.27294,"22":2.71926,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.06065,"8.2":0,"9.2":0.01011,"10.1":0.01011,"11.1-11.2":0.06065,"12.0":0.01011,"13.0":0.06065,"14.0":0.05054,"15.0":0.03033,"16.0":0.10109,"17.0":0.09098,"18.0":0.06065,"19.0":0.13141},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.09922},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00877,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":71.92239},R:{_:"0"},M:{"0":0.09909},Q:{"13.1":0},O:{"0":0.07078},H:{"0":0.28144}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PT.js
index 57a66754019da5..2ec5f1d4fd7670 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.0051,"51":0,"52":0.02038,"53":0,"54":0.0051,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01019,"79":0,"80":0,"81":0,"82":0,"83":0.01019,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.0051,"92":0,"93":0,"94":0,"95":0.0051,"96":0,"97":0.0051,"98":0.0051,"99":0,"100":0,"101":0,"102":0.03058,"103":0.0051,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.0051,"111":0.01529,"112":0.0051,"113":0.01019,"114":0.01529,"115":0.36691,"116":1.23833,"117":0.03567,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01019,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02548,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.0051,"58":0,"59":0,"60":0.01019,"61":0,"62":0.0051,"63":0.0051,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.01529,"80":0.0051,"81":0.0051,"83":0,"84":0,"85":0.01529,"86":0.0051,"87":0.01019,"88":0.02038,"89":0.04077,"90":0.0051,"91":0.02548,"92":0.0051,"93":0.05096,"94":0.01529,"95":0.0051,"96":0.0051,"97":0.0051,"98":0.0051,"99":0.02038,"100":0.0051,"101":0.0051,"102":0.01019,"103":0.06115,"104":0.0051,"105":0.01019,"106":0.02038,"107":0.01529,"108":0.02548,"109":0.60642,"110":0.02038,"111":0.02038,"112":0.05606,"113":0.06625,"114":0.71344,"115":8.89252,"116":5.16734,"117":0.01529,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.03058,"72":0.03058,"73":0.0051,"74":0,"75":0,"76":0,"77":0.0051,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02038,"96":0,"97":0,"98":0,"99":0.02548,"100":1.60524,"101":0.61662,"102":0.01019,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.0051,"14":0.0051,"15":0,"16":0,"17":0,"18":0.0051,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01019,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.0051,"107":0.0051,"108":0.0051,"109":0.05096,"110":0.0051,"111":0.01019,"112":0.0051,"113":0.01019,"114":0.09173,"115":2.36964,"116":0.84084},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0051,"14":0.02038,"15":0.0051,"17":0.02548,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.0051,"12.1":0.0051,"13.1":0.04586,"14.1":0.09173,"15.1":0.02038,"15.2-15.3":0.01019,"15.4":0.02548,"15.5":0.02548,"15.6":0.14269,"16.0":0.02038,"16.1":0.05606,"16.2":0.05606,"16.3":0.15288,"16.4":0.04077,"16.5":0.3822,"16.6":0.43316},G:{"8":0.00211,"17":0.30604,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00211,"8.1-8.4":0.00422,"9.0-9.2":0,"9.3":0.06754,"10.0-10.2":0,"10.3":0.07598,"11.0-11.2":0.00844,"11.3-11.4":0.01689,"12.0-12.1":0.00633,"12.2-12.5":0.39891,"13.0-13.1":0.00211,"13.2":0,"13.3":0.01055,"13.4-13.7":0.06754,"14.0-14.4":0.11608,"14.5-14.8":0.23217,"15.0-15.1":0.08443,"15.2-15.3":0.06332,"15.4":0.08443,"15.5":0.1393,"15.6-15.7":1.40357,"16.0":0.70495,"16.1":1.12497,"16.2":0.52344,"16.3":1.3107,"16.4":0.24061,"16.5":4.33945,"16.6":9.75322},P:{"4":0.07148,"20":0.04084,"21":0.11232,"22":1.87884,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01021,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01021,"12.0":0.01021,"13.0":0.01021,"14.0":0.01021,"15.0":0,"16.0":0.02042,"17.0":0.02042,"18.0":0.01021,"19.0":0.03063},I:{"0":0,"3":0,"4":0.00545,"2.1":0,"2.2":0,"2.3":0.0218,"4.1":0.0109,"4.2-4.3":0.01635,"4.4":0,"4.4.3-4.4.4":0.13079},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00582,"9":0.00582,"10":0,"11":0.06989,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":47.56119},R:{_:"0"},M:{"0":0.33838},Q:{"13.1":0},O:{"0":0.18635},H:{"0":0.38071}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.0058,"51":0,"52":0.0232,"53":0,"54":0.0058,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0116,"79":0,"80":0,"81":0,"82":0,"83":0.0116,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.0058,"92":0,"93":0,"94":0,"95":0.0058,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.029,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.0058,"109":0,"110":0.0058,"111":0.0116,"112":0.0058,"113":0.0058,"114":0.0058,"115":0.1276,"116":0.1276,"117":1.4268,"118":0.1508,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.0058,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0232,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.0058,"58":0,"59":0,"60":0.0116,"61":0,"62":0,"63":0.0116,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.0058,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0058,"79":0.0174,"80":0.0058,"81":0.0058,"83":0.0058,"84":0.0116,"85":0.0174,"86":0.0058,"87":0.0116,"88":0.0116,"89":0.0406,"90":0.0058,"91":0.0406,"92":0.0058,"93":0.0406,"94":0.0058,"95":0.0058,"96":0,"97":0.0058,"98":0,"99":0.029,"100":0.0116,"101":0.0058,"102":0.0058,"103":0.0638,"104":0.0116,"105":0.0232,"106":0.029,"107":0.0232,"108":0.029,"109":0.9164,"110":0.0232,"111":0.0232,"112":0.0406,"113":0.0348,"114":0.1566,"115":0.5104,"116":13.7402,"117":5.51,"118":0.0116,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0058,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.0058,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.0058,"72":0.029,"73":0.0116,"74":0,"75":0,"76":0,"77":0.0232,"78":0,"79":0,"80":0,"81":0,"82":0.0058,"83":0,"84":0,"85":0.0058,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.0058,"95":0.0174,"96":0,"97":0,"98":0,"99":0.0116,"100":0.3828,"101":0.6786,"102":1.943,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.0058,"14":0.0058,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0058,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.0058,"108":0.0058,"109":0.058,"110":0.0058,"111":0.0058,"112":0.0058,"113":0.0116,"114":0.522,"115":0.0696,"116":1.827,"117":1.8792},E:{"4":0,"5":0,"6":0,"7":0,"8":0.0058,"9":0,"10":0,"11":0,"12":0,"13":0.0058,"14":0.0232,"15":0.0058,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.0058,"13.1":0.0406,"14.1":0.0928,"15.1":0.0058,"15.2-15.3":0.0116,"15.4":0.0174,"15.5":0.029,"15.6":0.145,"16.0":0.0232,"16.1":0.058,"16.2":0.0406,"16.3":0.1044,"16.4":0.0464,"16.5":0.1798,"16.6":0.7772,"17.0":0.0696,"17.1":0},G:{"8":0.01583,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00198,"6.0-6.1":0,"7.0-7.1":0.00198,"8.1-8.4":0.00198,"9.0-9.2":0,"9.3":0.07123,"10.0-10.2":0,"10.3":0.06133,"11.0-11.2":0.00791,"11.3-11.4":0.01187,"12.0-12.1":0.00594,"12.2-12.5":0.39768,"13.0-13.1":0,"13.2":0,"13.3":0.14641,"13.4-13.7":0.08508,"14.0-14.4":0.11475,"14.5-14.8":0.18005,"15.0-15.1":0.06529,"15.2-15.3":0.04946,"15.4":0.06529,"15.5":0.12267,"15.6-15.7":1.14359,"16.0":0.54211,"16.1":0.89429,"16.2":0.38977,"16.3":0.83889,"16.4":0.16224,"16.5":0.56784,"16.6":11.55456,"17.0":1.94686,"17.1":0.00791},P:{"4":0.03095,"20":0.02063,"21":0.0619,"22":1.68173,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01032,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01032,"12.0":0.01032,"13.0":0.01032,"14.0":0,"15.0":0,"16.0":0.02063,"17.0":0.01032,"18.0":0.01032,"19.0":0.02063},I:{"0":0,"3":0,"4":0.0052,"2.1":0,"2.2":0,"2.3":0.0208,"4.1":0.0052,"4.2-4.3":0.026,"4.4":0,"4.4.3-4.4.4":0.1144},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00633,"9":0.00633,"10":0,"11":0.05695,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":42.336},R:{_:"0"},M:{"0":0.3024},Q:{"13.1":0.0042},O:{"0":0.1638},H:{"0":0.29822}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PW.js
index ef5cf0b2ae5ba2..7741c410cef600 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00611,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.20777,"116":0.49499,"117":0.01222,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.01222,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02444,"79":0.03056,"80":0,"81":0,"83":0.02444,"84":0,"85":0,"86":0.01222,"87":0.01222,"88":0,"89":0,"90":0,"91":0,"92":0.03667,"93":0,"94":0,"95":0.00611,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.01222,"102":0.01833,"103":0.22,"104":0,"105":0,"106":0.01833,"107":0.01222,"108":0,"109":0.64166,"110":0,"111":0,"112":1.30775,"113":0.06111,"114":0.59277,"115":19.7202,"116":8.36596,"117":0.08555,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.01833,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.04278,"101":0.09167,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00611,"112":0,"113":0,"114":0.03056,"115":1.8883,"116":0.22611},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00611,"12":0.00611,"13":0.00611,"14":0.00611,"15":0,"17":0.01222,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00611,"14.1":0.09167,"15.1":0,"15.2-15.3":0,"15.4":0.01833,"15.5":0.01222,"15.6":0.11,"16.0":0.00611,"16.1":0.48277,"16.2":0,"16.3":0.14055,"16.4":0.00611,"16.5":0.28111,"16.6":0.6661},G:{"8":0,"17":1.50463,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.10082,"10.0-10.2":0,"10.3":0.07989,"11.0-11.2":0.00761,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.07989,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.43941,"14.0-14.4":0.03614,"14.5-14.8":0.14457,"15.0-15.1":0.1731,"15.2-15.3":0.03614,"15.4":0.03614,"15.5":0.31006,"15.6-15.7":0.87881,"16.0":0.47555,"16.1":1.16604,"16.2":0.27392,"16.3":1.59214,"16.4":0.24538,"16.5":3.68074,"16.6":7.76475},P:{"4":0,"20":0.06128,"21":0.10213,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01021,"8.2":0,"9.2":0.02043,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01021,"18.0":0.10213,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.11333},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":41.7488},R:{_:"0"},M:{"0":0.01556},Q:{"13.1":0.01945},O:{"0":0.09334},H:{"0":0.08468}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00513,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00513,"115":0.08718,"116":0.05641,"117":0.89227,"118":0.03077,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00513,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00513,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.03077,"79":0.01538,"80":0,"81":0,"83":0.02564,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.03077,"94":0.00513,"95":0.01026,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.23076,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.3846,"110":0,"111":0.01538,"112":1.23072,"113":0.1282,"114":0.2205,"115":0.07179,"116":14.51737,"117":2.02043,"118":0.00513,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01538,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00513,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00513,"101":0.07692,"102":0.21538,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00513,"108":0,"109":0.00513,"110":0,"111":0.00513,"112":0.01026,"113":0,"114":0.00513,"115":0.02051,"116":0.43588,"117":0.38973},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0.02051,"13":0,"14":0,"15":0.00513,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01026,"14.1":0.03077,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.01026,"15.6":0.02564,"16.0":0.00513,"16.1":0.19999,"16.2":0.01538,"16.3":0.01026,"16.4":0.02564,"16.5":0.0923,"16.6":3.36397,"17.0":0.01538,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.23037,"10.0-10.2":0.09754,"10.3":0,"11.0-11.2":0.0249,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.0083,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.33622,"14.0-14.4":0.0249,"14.5-14.8":0.10792,"15.0-15.1":0.26358,"15.2-15.3":0.0249,"15.4":0.0166,"15.5":0.0249,"15.6-15.7":0.60809,"16.0":0.68904,"16.1":0.48357,"16.2":1.20581,"16.3":0.19716,"16.4":0.2781,"16.5":0.18886,"16.6":13.38224,"17.0":2.4303,"17.1":0},P:{"4":0,"20":0.11169,"21":0.02031,"22":2.36583,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.70061,"8.2":0,"9.2":0.02031,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.02031,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.22974},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.22043},R:{_:"0"},M:{"0":0.05359},Q:{"13.1":0},O:{"0":0.08282},H:{"0":0.17527}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PY.js
index 2a9b602d830df0..9463f4042107a2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/PY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00582,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00582,"46":0,"47":0,"48":0,"49":0,"50":0.00291,"51":0,"52":0.04074,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00291,"70":0,"71":0,"72":0,"73":0.01455,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00291,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00582,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00582,"103":0.00291,"104":0.00291,"105":0,"106":0,"107":0.00291,"108":0,"109":0.00291,"110":0,"111":0,"112":0.00291,"113":0.00582,"114":0.00582,"115":0.15132,"116":0.30555,"117":0.01164,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00291,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00291,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00291,"45":0,"46":0,"47":0.00582,"48":0,"49":0.00873,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00291,"61":0,"62":0,"63":0,"64":0.00582,"65":0.00873,"66":0,"67":0,"68":0.01164,"69":0.00291,"70":0.00291,"71":0.00291,"72":0,"73":0.01455,"74":0.00291,"75":0.00291,"76":0.00291,"77":0.00291,"78":0,"79":0.02619,"80":0.00291,"81":0.00582,"83":0.00873,"84":0.00291,"85":0.00291,"86":0.00291,"87":0.14841,"88":0.00582,"89":0.01164,"90":0.00291,"91":0.05529,"92":0.00291,"93":0.00291,"94":0.00291,"95":0.00291,"96":0.00291,"97":0.00291,"98":0,"99":0.00582,"100":0.00291,"101":0.00291,"102":0.00582,"103":0.01164,"104":0.00582,"105":0.00582,"106":0.00873,"107":0.01164,"108":0.02037,"109":0.57618,"110":0.01164,"111":0.00873,"112":0.02328,"113":0.02037,"114":0.2037,"115":3.02058,"116":1.78383,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.01164,"70":0.00291,"71":0.00582,"72":0.00582,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00873,"96":0,"97":0,"98":0.00291,"99":0.00582,"100":0.21534,"101":0.09603,"102":0.00291,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00291,"13":0,"14":0.00291,"15":0,"16":0,"17":0.00291,"18":0.00291,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00291,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.01455,"102":0.00291,"103":0.00291,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00582,"110":0,"111":0,"112":0.00291,"113":0.00582,"114":0.0291,"115":0.53253,"116":0.22116},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00582,"14":0.00291,"15":0,"17":0.00291,_:"0","3.1":0,"3.2":0,"5.1":0.00873,"6.1":0,"7.1":0,"9.1":0.00291,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00291,"14.1":0.00582,"15.1":0,"15.2-15.3":0,"15.4":0.00873,"15.5":0.00291,"15.6":0.01455,"16.0":0.00291,"16.1":0.01164,"16.2":0.00291,"16.3":0.01455,"16.4":0.00291,"16.5":0.04656,"16.6":0.06111},G:{"8":0,"17":0.04591,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00265,"6.0-6.1":0,"7.0-7.1":0.02825,"8.1-8.4":0.0053,"9.0-9.2":0.00353,"9.3":0.02384,"10.0-10.2":0.00088,"10.3":0.01148,"11.0-11.2":0.02031,"11.3-11.4":0.00353,"12.0-12.1":0.00883,"12.2-12.5":0.17304,"13.0-13.1":0,"13.2":0.00441,"13.3":0.00441,"13.4-13.7":0.02295,"14.0-14.4":0.04591,"14.5-14.8":0.13155,"15.0-15.1":0.01501,"15.2-15.3":0.01942,"15.4":0.02649,"15.5":0.04944,"15.6-15.7":1.13271,"16.0":0.26044,"16.1":0.38757,"16.2":0.19246,"16.3":0.37875,"16.4":0.07681,"16.5":1.67125,"16.6":4.07616},P:{"4":0.39647,"20":0.21348,"21":0.4473,"5.0-5.4":0,"6.2-6.4":0.01017,"7.2-7.4":0.57945,"8.2":0,"9.2":0.05083,"10.1":0.02033,"11.1-11.2":0.08133,"12.0":0.0305,"13.0":0.06099,"14.0":0.08133,"15.0":0.0305,"16.0":0.22365,"17.0":0.30497,"18.0":0.09149,"19.0":0.25415},I:{"0":0,"3":0,"4":0.04825,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00804,"4.2-4.3":0.01608,"4.4":0,"4.4.3-4.4.4":0.17693},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00582,"9":0.00291,"10":0.00291,"11":0.00873,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.816},R:{_:"0"},M:{"0":0.12762},Q:{"13.1":0},O:{"0":0.04963},H:{"0":0.27521}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00616,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00616,"46":0,"47":0.00924,"48":0,"49":0,"50":0.00308,"51":0,"52":0.0462,"53":0,"54":0.00308,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.01232,"74":0,"75":0,"76":0,"77":0,"78":0.00308,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00616,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00308,"103":0.00308,"104":0,"105":0,"106":0,"107":0.00616,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00308,"114":0.00308,"115":0.077,"116":0.02464,"117":0.3234,"118":0.03388,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00308,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00616,"48":0,"49":0.00924,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00308,"56":0,"57":0.00308,"58":0,"59":0,"60":0.00924,"61":0,"62":0,"63":0,"64":0.00616,"65":0.00616,"66":0,"67":0,"68":0.00616,"69":0.00308,"70":0.00308,"71":0.00308,"72":0,"73":0.00616,"74":0,"75":0,"76":0,"77":0.00308,"78":0,"79":0.01848,"80":0.00308,"81":0.00616,"83":0.00308,"84":0,"85":0.00308,"86":0.00616,"87":0.1848,"88":0.00616,"89":0.01232,"90":0.00308,"91":0.0924,"92":0,"93":0.00308,"94":0.00308,"95":0.00308,"96":0.00308,"97":0.00308,"98":0,"99":0.00616,"100":0.00308,"101":0.00308,"102":0.00616,"103":0.01232,"104":0.00308,"105":0.00616,"106":0.00616,"107":0.01232,"108":0.01232,"109":0.64064,"110":0.00616,"111":0.0154,"112":0.01848,"113":0.01232,"114":0.03696,"115":0.154,"116":4.389,"117":1.14268,"118":0.00308,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00308,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00616,"70":0,"71":0,"72":0.01848,"73":0.00616,"74":0,"75":0,"76":0,"77":0.01848,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01232,"96":0,"97":0,"98":0,"99":0.00308,"100":0.07392,"101":0.17556,"102":0.18788,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00308,"13":0.00308,"14":0.00308,"15":0,"16":0,"17":0,"18":0.00308,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00308,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.01232,"102":0.00308,"103":0.00308,"104":0,"105":0,"106":0,"107":0.00308,"108":0,"109":0.00616,"110":0,"111":0,"112":0.00308,"113":0.00308,"114":0.00924,"115":0.01848,"116":0.47124,"117":0.31416},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00616,"14":0.00308,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00308,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00308,"14.1":0.00616,"15.1":0,"15.2-15.3":0,"15.4":0.00924,"15.5":0.00308,"15.6":0.01232,"16.0":0.00308,"16.1":0.00924,"16.2":0.00308,"16.3":0.01232,"16.4":0.00308,"16.5":0.0154,"16.6":0.10164,"17.0":0.00616,"17.1":0},G:{"8":0,"3.2":0.00291,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00194,"6.0-6.1":0.00097,"7.0-7.1":0.02036,"8.1-8.4":0.00679,"9.0-9.2":0.00097,"9.3":0.02715,"10.0-10.2":0,"10.3":0.01261,"11.0-11.2":0.03103,"11.3-11.4":0.00388,"12.0-12.1":0.00776,"12.2-12.5":0.14739,"13.0-13.1":0.00194,"13.2":0.00097,"13.3":0.02133,"13.4-13.7":0.01939,"14.0-14.4":0.04654,"14.5-14.8":0.12509,"15.0-15.1":0.01648,"15.2-15.3":0.02036,"15.4":0.02521,"15.5":0.05624,"15.6-15.7":1.08407,"16.0":0.20751,"16.1":0.32968,"16.2":0.15805,"16.3":0.34326,"16.4":0.20751,"16.5":0.40338,"16.6":5.64919,"17.0":0.50325,"17.1":0},P:{"4":0.447,"20":0.15239,"21":0.2743,"22":2.85472,"5.0-5.4":0.01016,"6.2-6.4":0.02032,"7.2-7.4":0.56891,"8.2":0,"9.2":0.03048,"10.1":0.01016,"11.1-11.2":0.06095,"12.0":0.01016,"13.0":0.06095,"14.0":0.04064,"15.0":0.04064,"16.0":0.2235,"17.0":0.2235,"18.0":0.06095,"19.0":0.13207},I:{"0":0,"3":0,"4":0.01653,"2.1":0,"2.2":0.00827,"2.3":0.04134,"4.1":0.01653,"4.2-4.3":0.01653,"4.4":0,"4.4.3-4.4.4":0.15707},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00924,"9":0.00308,"10":0.00308,"11":0.01232,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":73.37232},R:{_:"0"},M:{"0":0.12456},Q:{"13.1":0},O:{"0":0.04844},H:{"0":0.41274}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/QA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/QA.js
index a8b7a002666533..38483d7b94f021 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/QA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/QA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0.04843,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00255,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00255,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00255,"110":0,"111":0,"112":0,"113":0.00255,"114":0.00255,"115":0.04333,"116":0.10706,"117":0.00255,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00255,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.01529,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0051,"69":0.00255,"70":0,"71":0.00255,"72":0,"73":0,"74":0,"75":0,"76":0.00255,"77":0.00255,"78":0,"79":0.00765,"80":0.00255,"81":0,"83":0,"84":0.00255,"85":0,"86":0.00255,"87":0.0051,"88":0.00255,"89":0,"90":0,"91":0.00255,"92":0,"93":0.00255,"94":0,"95":0.00255,"96":0,"97":0.00255,"98":0.00255,"99":0.00765,"100":0.00255,"101":0.00255,"102":0.00255,"103":0.01529,"104":0.00255,"105":0.0051,"106":0.00255,"107":0.0051,"108":0.0102,"109":0.30843,"110":0.0051,"111":0.0102,"112":0.01784,"113":0.02294,"114":0.15294,"115":2.48528,"116":1.42234,"117":0.00255,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00255,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.01529,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00255,"70":0.00255,"71":0.05098,"72":0.06118,"73":0,"74":0.00255,"75":0,"76":0.0051,"77":0.00765,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00255,"96":0.00255,"97":0,"98":0,"99":0.00255,"100":0.07902,"101":0.05353,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00255,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00255,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0102,"110":0.00255,"111":0.00255,"112":0.00255,"113":0.0051,"114":0.02294,"115":0.53529,"116":0.17588},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0051,"15":0,"17":0.0051,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00255,"13.1":0.00765,"14.1":0.01529,"15.1":0.00255,"15.2-15.3":0.00255,"15.4":0.0051,"15.5":0.01275,"15.6":0.03569,"16.0":0.00255,"16.1":0.01275,"16.2":0.0102,"16.3":0.03059,"16.4":0.0102,"16.5":0.08667,"16.6":0.15294},G:{"8":0,"17":0.42625,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00316,"6.0-6.1":0,"7.0-7.1":0.00947,"8.1-8.4":0,"9.0-9.2":0.00158,"9.3":0.0221,"10.0-10.2":0,"10.3":0.02052,"11.0-11.2":0.01421,"11.3-11.4":0.00158,"12.0-12.1":0.00631,"12.2-12.5":0.14998,"13.0-13.1":0,"13.2":0.00158,"13.3":0.00631,"13.4-13.7":0.01737,"14.0-14.4":0.06157,"14.5-14.8":0.14524,"15.0-15.1":0.07104,"15.2-15.3":0.06946,"15.4":0.07104,"15.5":0.11209,"15.6-15.7":1.19035,"16.0":0.38205,"16.1":0.55413,"16.2":0.28417,"16.3":0.80514,"16.4":0.19102,"16.5":3.14164,"16.6":8.01513},P:{"4":0.04065,"20":0.07114,"21":0.12196,"22":2.13426,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.04065,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01016,"12.0":0,"13.0":0.01016,"14.0":0.01016,"15.0":0,"16.0":0.01016,"17.0":0.02033,"18.0":0.03049,"19.0":0.04065},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.0951},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0051,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.41808},R:{_:"0"},M:{"0":0.11177},Q:{"13.1":0},O:{"0":4.23217},H:{"0":1.31912}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0.06449,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00537,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00269,"103":0,"104":0,"105":0,"106":0,"107":0.01075,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00269,"114":0,"115":0.01612,"116":0.01344,"117":0.11823,"118":0.00806,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00269,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00806,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00269,"69":0.00269,"70":0,"71":0.00269,"72":0,"73":0,"74":0,"75":0,"76":0.00269,"77":0,"78":0,"79":0.00806,"80":0,"81":0,"83":0,"84":0.00269,"85":0,"86":0.00269,"87":0.00537,"88":0.00537,"89":0,"90":0,"91":0.00269,"92":0,"93":0.00269,"94":0,"95":0.00269,"96":0.00269,"97":0.00269,"98":0.00269,"99":0.00537,"100":0.00269,"101":0.00269,"102":0.00269,"103":0.02418,"104":0.00269,"105":0.00269,"106":0.00537,"107":0.00537,"108":0.01881,"109":0.27945,"110":0.00537,"111":0.00806,"112":0.01612,"113":0.01881,"114":0.05374,"115":0.09405,"116":3.54415,"117":0.64757,"118":0.00269,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00269,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.01075,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00537,"70":0.00269,"71":0.00269,"72":0.09942,"73":0.02956,"74":0.00269,"75":0,"76":0,"77":0.05643,"78":0.00269,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00269,"96":0,"97":0,"98":0,"99":0.00269,"100":0.01881,"101":0.07524,"102":0.0833,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00269,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00269,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00269,"104":0.00269,"105":0.00269,"106":0,"107":0,"108":0,"109":0.00806,"110":0.00269,"111":0.00269,"112":0.00269,"113":0.00269,"114":0.00806,"115":0.03224,"116":0.5374,"117":0.28482},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00537,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00806,"14.1":0.01881,"15.1":0.00269,"15.2-15.3":0.00269,"15.4":0.00537,"15.5":0.01075,"15.6":0.05105,"16.0":0.00537,"16.1":0.01612,"16.2":0.01075,"16.3":0.04299,"16.4":0.01881,"16.5":0.04568,"16.6":0.27945,"17.0":0.02687,"17.1":0},G:{"8":0.00322,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00161,"6.0-6.1":0,"7.0-7.1":0.01447,"8.1-8.4":0,"9.0-9.2":0.00482,"9.3":0.02734,"10.0-10.2":0,"10.3":0.02573,"11.0-11.2":0.01286,"11.3-11.4":0,"12.0-12.1":0.00643,"12.2-12.5":0.15116,"13.0-13.1":0.00161,"13.2":0.00322,"13.3":0.01286,"13.4-13.7":0.0193,"14.0-14.4":0.08523,"14.5-14.8":0.15598,"15.0-15.1":0.0595,"15.2-15.3":0.04985,"15.4":0.06432,"15.5":0.09648,"15.6-15.7":1.12404,"16.0":0.39076,"16.1":0.52905,"16.2":0.31196,"16.3":0.66896,"16.4":0.14955,"16.5":0.59177,"16.6":10.03433,"17.0":1.30253,"17.1":0.00322},P:{"4":0.04051,"20":0.06077,"21":0.10128,"22":2.03574,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03038,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01013,"12.0":0,"13.0":0.01013,"14.0":0.02026,"15.0":0,"16.0":0.02026,"17.0":0.02026,"18.0":0.02026,"19.0":0.04051},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.07612},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01075,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.43525},R:{_:"0"},M:{"0":0.10238},Q:{"13.1":0},O:{"0":4.19766},H:{"0":1.5924}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RE.js
index c2d7332e2e0dff..4e68a0899beada 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00442,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00442,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00442,"67":0,"68":0.00442,"69":0,"70":0,"71":0,"72":0.00442,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.03533,"79":0,"80":0,"81":0,"82":0.00442,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00442,"89":0.01766,"90":0,"91":0.03091,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.07507,"103":0.00442,"104":0,"105":0,"106":0,"107":0.00442,"108":0.00883,"109":0.00442,"110":0.00442,"111":0.01766,"112":0.00442,"113":0.00883,"114":0.03974,"115":0.57408,"116":1.81056,"117":0.05741,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00442,"35":0,"36":0,"37":0,"38":0.01325,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00442,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.01766,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01325,"69":0,"70":0,"71":0,"72":0.00442,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.0265,"80":0,"81":0.00442,"83":0.0265,"84":0,"85":0.02208,"86":0.01325,"87":0.0265,"88":0.00442,"89":0.00442,"90":0.00442,"91":0.00442,"92":0,"93":0,"94":0.01766,"95":0,"96":0,"97":0,"98":0,"99":0.00883,"100":0,"101":0.00442,"102":0,"103":0.0839,"104":0.00442,"105":0.00442,"106":0.01325,"107":0.0265,"108":0.00883,"109":0.49018,"110":0.00442,"111":0.00883,"112":0.03091,"113":0.04858,"114":0.48134,"115":5.3257,"116":3.09562,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00442,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00883,"70":0,"71":0.03091,"72":0.03974,"73":0,"74":0,"75":0,"76":0,"77":0.00442,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00883,"96":0,"97":0,"98":0,"99":0.01325,"100":0.38419,"101":0.4416,"102":0.00442,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00442,"18":0.00442,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00883,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00442,"101":0,"102":0,"103":0,"104":0,"105":0.00442,"106":0,"107":0.00442,"108":0.01325,"109":0.02208,"110":0.00442,"111":0.00442,"112":0.00883,"113":0.00883,"114":0.0839,"115":2.3184,"116":0.82579},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0265,"15":0.00442,"17":0.00442,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00883,"13.1":0.14573,"14.1":0.10157,"15.1":0.00883,"15.2-15.3":0.00883,"15.4":0.02208,"15.5":0.04858,"15.6":0.2208,"16.0":0.02208,"16.1":0.03974,"16.2":0.05299,"16.3":0.15014,"16.4":0.07066,"16.5":0.40627,"16.6":0.3312},G:{"8":0.00964,"17":0.19034,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00482,"6.0-6.1":0,"7.0-7.1":0.01446,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04578,"10.0-10.2":0,"10.3":0.1301,"11.0-11.2":0.01205,"11.3-11.4":0.00723,"12.0-12.1":0.01446,"12.2-12.5":0.6722,"13.0-13.1":0,"13.2":0.00482,"13.3":0.01687,"13.4-13.7":0.20961,"14.0-14.4":0.20961,"14.5-14.8":0.58787,"15.0-15.1":0.05541,"15.2-15.3":0.08674,"15.4":0.08674,"15.5":0.19515,"15.6-15.7":1.41668,"16.0":0.71557,"16.1":1.59015,"16.2":0.67461,"16.3":1.78049,"16.4":0.3349,"16.5":4.93429,"16.6":10.08782},P:{"4":0.05096,"20":0.1325,"21":0.31596,"5.0-5.4":0.01019,"6.2-6.4":0,"7.2-7.4":0.04077,"8.2":0,"9.2":0.01019,"10.1":0.01019,"11.1-11.2":0.05096,"12.0":0.01019,"13.0":0.01019,"14.0":0.02038,"15.0":0.02038,"16.0":0.04077,"17.0":0.03058,"18.0":0.05096,"19.0":0.07135},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0035,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.12949},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03533,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":50.20939},R:{_:"0"},M:{"0":0.41322},Q:{"13.1":0},O:{"0":0.04467},H:{"0":0.48108}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00446,"53":0,"54":0,"55":0.00446,"56":0.00446,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00446,"78":0.05354,"79":0,"80":0,"81":0,"82":0.00446,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00446,"89":0.04462,"90":0,"91":0.02231,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.14278,"103":0,"104":0.00446,"105":0,"106":0,"107":0,"108":0,"109":0.00446,"110":0,"111":0.00446,"112":0.00446,"113":0.00892,"114":0.03123,"115":0.23649,"116":0.10263,"117":1.89189,"118":0.16063,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00446,"50":0,"51":0,"52":0,"53":0.00446,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00446,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00446,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.02231,"80":0,"81":0.00892,"83":0.02231,"84":0,"85":0.00892,"86":0,"87":0.00446,"88":0,"89":0,"90":0,"91":0.00446,"92":0,"93":0,"94":0.03123,"95":0,"96":0,"97":0.00446,"98":0,"99":0.00446,"100":0.00446,"101":0,"102":0,"103":0.04908,"104":0,"105":0.03123,"106":0.00446,"107":0.01785,"108":0.00892,"109":0.45066,"110":0.00446,"111":0.00892,"112":0.02677,"113":0.02231,"114":0.11601,"115":0.16063,"116":7.28645,"117":1.92312,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00892,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00446,"77":0.02677,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00446,"96":0,"97":0,"98":0,"99":0.01339,"100":0.09816,"101":0.29449,"102":0.33465,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00446,"16":0,"17":0.00446,"18":0.00446,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00892,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00446,"101":0,"102":0,"103":0,"104":0,"105":0.00446,"106":0.00446,"107":0.00446,"108":0,"109":0.02231,"110":0.00892,"111":0,"112":0.00892,"113":0.00446,"114":0.03123,"115":0.10709,"116":1.81157,"117":1.31183},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.02677,"15":0.00446,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.01339,"13.1":0.12047,"14.1":0.10709,"15.1":0.02231,"15.2-15.3":0.00892,"15.4":0.02677,"15.5":0.06247,"15.6":0.18294,"16.0":0.01785,"16.1":0.03123,"16.2":0.0357,"16.3":0.13386,"16.4":0.0357,"16.5":0.14278,"16.6":0.705,"17.0":0.04462,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00991,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04459,"10.0-10.2":0,"10.3":0.15853,"11.0-11.2":0.00743,"11.3-11.4":0.01486,"12.0-12.1":0.00743,"12.2-12.5":0.93881,"13.0-13.1":0,"13.2":0,"13.3":0.00991,"13.4-13.7":0.07679,"14.0-14.4":0.19074,"14.5-14.8":0.47065,"15.0-15.1":0.06936,"15.2-15.3":0.06936,"15.4":0.07431,"15.5":0.1511,"15.6-15.7":1.27074,"16.0":0.69606,"16.1":1.43423,"16.2":0.50285,"16.3":1.08744,"16.4":0.16596,"16.5":0.73074,"16.6":14.22341,"17.0":2.03121,"17.1":0},P:{"4":0.05138,"20":0.09249,"21":0.25691,"22":3.13435,"5.0-5.4":0.01028,"6.2-6.4":0,"7.2-7.4":0.06166,"8.2":0,"9.2":0.01028,"10.1":0,"11.1-11.2":0.08221,"12.0":0.01028,"13.0":0.01028,"14.0":0.03083,"15.0":0.01028,"16.0":0.02055,"17.0":0.03083,"18.0":0.04111,"19.0":0.06166},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0026,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.12202},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02677,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":49.68042},R:{_:"0"},M:{"0":0.34889},Q:{"13.1":0},O:{"0":0.03877},H:{"0":0.31458}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RO.js
index d7830ab30b4409..a6678dac311921 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00436,"49":0,"50":0,"51":0,"52":0.02614,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00436,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00436,"79":0,"80":0,"81":0,"82":0,"83":0.00436,"84":0,"85":0,"86":0.00436,"87":0,"88":0,"89":0,"90":0,"91":0.00436,"92":0,"93":0,"94":0,"95":0.00436,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0392,"103":0.47916,"104":0.00871,"105":0.00871,"106":0,"107":0,"108":0.02178,"109":0.00436,"110":0.00436,"111":0.00436,"112":0.00436,"113":0.00871,"114":0.01307,"115":0.3267,"116":1.36343,"117":0.02614,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00436,"39":0,"40":0,"41":0.00436,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01742,"50":0,"51":0.00436,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.01742,"59":0,"60":0.19602,"61":0.00436,"62":0,"63":0.00436,"64":0.00436,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00436,"71":0.00436,"72":0,"73":0,"74":0.00436,"75":0.00436,"76":0.00436,"77":0,"78":0,"79":0.02178,"80":0,"81":0.00871,"83":0,"84":0,"85":0.00871,"86":0.00436,"87":0.03485,"88":0.00436,"89":0.00436,"90":0.00436,"91":0.01307,"92":0.00436,"93":0,"94":0.00436,"95":0.00436,"96":0.00436,"97":0.00436,"98":0.00871,"99":0.01742,"100":0.0392,"101":0,"102":0.00436,"103":0.00871,"104":0.00436,"105":0.01307,"106":0.01307,"107":0.00871,"108":0.01742,"109":0.82328,"110":0.02178,"111":0.02178,"112":0.03049,"113":0.04792,"114":0.29621,"115":7.06108,"116":4.69577,"117":0.00436,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00436,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00436,"72":0.00436,"73":0,"74":0,"75":0,"76":0.00436,"77":0.00436,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00871,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03485,"96":0,"97":0,"98":0,"99":0.0392,"100":0.46174,"101":0.29185,"102":0.00436,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00436,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00436,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00436,"108":0.00871,"109":0.01307,"110":0.00436,"111":0.00436,"112":0.00871,"113":0.00436,"114":0.03485,"115":0.71874,"116":0.24829},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00871,"15":0,"17":0.00871,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00436,"13.1":0.01307,"14.1":0.01307,"15.1":0.00436,"15.2-15.3":0.00436,"15.4":0.00436,"15.5":0.00436,"15.6":0.03485,"16.0":0.00436,"16.1":0.01307,"16.2":0.01307,"16.3":0.02614,"16.4":0.01307,"16.5":0.09148,"16.6":0.10454},G:{"8":0,"17":0.24085,"3.2":0.03441,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.13419,"6.0-6.1":0,"7.0-7.1":0.00516,"8.1-8.4":0,"9.0-9.2":0.00172,"9.3":0.02581,"10.0-10.2":0,"10.3":0.03097,"11.0-11.2":0.01548,"11.3-11.4":0.00344,"12.0-12.1":0.0086,"12.2-12.5":0.14795,"13.0-13.1":0.00172,"13.2":0.00172,"13.3":0.0086,"13.4-13.7":0.03957,"14.0-14.4":0.11698,"14.5-14.8":0.23569,"15.0-15.1":0.07225,"15.2-15.3":0.07914,"15.4":0.09634,"15.5":0.15311,"15.6-15.7":1.0821,"16.0":0.62621,"16.1":0.9892,"16.2":0.52815,"16.3":1.03909,"16.4":0.24429,"16.5":3.42522,"16.6":7.80523},P:{"4":0.13211,"20":0.31503,"21":0.2947,"22":2.87588,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01016,"8.2":0,"9.2":0.01016,"10.1":0,"11.1-11.2":0.03049,"12.0":0.01016,"13.0":0.04065,"14.0":0.02032,"15.0":0.01016,"16.0":0.03049,"17.0":0.03049,"18.0":0.03049,"19.0":0.0813},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.03342,"4.2-4.3":0.04297,"4.4":0,"4.4.3-4.4.4":0.20054},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00436,"9":0,"10":0,"11":0.02614,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.18228},R:{_:"0"},M:{"0":0.22012},Q:{"13.1":0},O:{"0":0.03951},H:{"0":0.3206}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00427,"46":0,"47":0,"48":0.0256,"49":0,"50":0,"51":0,"52":0.0256,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00427,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00427,"79":0,"80":0,"81":0,"82":0,"83":0.00427,"84":0,"85":0,"86":0.00853,"87":0,"88":0.00427,"89":0,"90":0,"91":0.00427,"92":0,"93":0,"94":0,"95":0.00427,"96":0,"97":0,"98":0,"99":0.00427,"100":0,"101":0,"102":0.02987,"103":0.18348,"104":0.00427,"105":0.00427,"106":0,"107":0,"108":0.00427,"109":0.00427,"110":0.00427,"111":0.00427,"112":0.00427,"113":0.00853,"114":0.00427,"115":0.18775,"116":0.11094,"117":0.96861,"118":0.06827,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00427,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.0128,"50":0,"51":0.00427,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00427,"60":0.17068,"61":0.00427,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00427,"71":0.00427,"72":0,"73":0,"74":0,"75":0,"76":0.00427,"77":0.00853,"78":0.00427,"79":0.01707,"80":0.00427,"81":0.00853,"83":0,"84":0,"85":0.0128,"86":0.00427,"87":0.0128,"88":0.00427,"89":0,"90":0.00427,"91":0.02134,"92":0.00427,"93":0.00853,"94":0.00427,"95":0,"96":0.00427,"97":0.00427,"98":0.00427,"99":0.0128,"100":0.0256,"101":0,"102":0.0128,"103":0.0128,"104":0.00427,"105":0.0128,"106":0.00853,"107":0.0128,"108":0.01707,"109":0.76806,"110":0.01707,"111":0.0256,"112":0.02987,"113":0.02134,"114":0.07254,"115":0.12801,"116":9.81837,"117":2.06096,"118":0.00427,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00853,"73":0.00427,"74":0,"75":0,"76":0,"77":0.01707,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00853,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.06827,"96":0,"97":0,"98":0,"99":0.02134,"100":0.11948,"101":0.26882,"102":0.42243,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00427,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00427,"109":0.01707,"110":0,"111":0,"112":0.00427,"113":0.00853,"114":0.0128,"115":0.0256,"116":0.49924,"117":0.40963},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00853,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00427,"10.1":0,"11.1":0,"12.1":0.00427,"13.1":0.0128,"14.1":0.0128,"15.1":0.00427,"15.2-15.3":0,"15.4":0.00427,"15.5":0.00427,"15.6":0.02987,"16.0":0.00427,"16.1":0.00853,"16.2":0.0128,"16.3":0.02134,"16.4":0.00853,"16.5":0.02987,"16.6":0.16641,"17.0":0.02134,"17.1":0},G:{"8":0,"3.2":0.02995,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.11794,"6.0-6.1":0,"7.0-7.1":0.00374,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02621,"10.0-10.2":0,"10.3":0.02246,"11.0-11.2":0.02434,"11.3-11.4":0.00187,"12.0-12.1":0.01498,"12.2-12.5":0.15538,"13.0-13.1":0.00187,"13.2":0,"13.3":0.1741,"13.4-13.7":0.05429,"14.0-14.4":0.13292,"14.5-14.8":0.22652,"15.0-15.1":0.08986,"15.2-15.3":0.07488,"15.4":0.08424,"15.5":0.14976,"15.6-15.7":1.1251,"16.0":0.61965,"16.1":0.91543,"16.2":0.49422,"16.3":0.87612,"16.4":0.19095,"16.5":0.59531,"16.6":10.49472,"17.0":1.79343,"17.1":0.00562},P:{"4":0.08101,"20":0.27341,"21":0.17215,"22":2.92648,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01013,"8.2":0,"9.2":0.01013,"10.1":0,"11.1-11.2":0.03038,"12.0":0.01013,"13.0":0.03038,"14.0":0.02025,"15.0":0.01013,"16.0":0.03038,"17.0":0.02025,"18.0":0.03038,"19.0":0.07088},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0277,"4.2-4.3":0.04432,"4.4":0,"4.4.3-4.4.4":0.19944},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00427,"9":0,"10":0,"11":0.0256,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.07458},R:{_:"0"},M:{"0":0.21212},Q:{"13.1":0},O:{"0":0.04013},H:{"0":0.27681}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RS.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RS.js
index 8c28b6feaf0596..7e421555995af7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RS.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RS.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00375,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00375,"49":0,"50":0,"51":0,"52":0.03371,"53":0,"54":0,"55":0,"56":0.00375,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00375,"66":0,"67":0,"68":0.00375,"69":0,"70":0,"71":0,"72":0.00375,"73":0,"74":0,"75":0.00375,"76":0,"77":0,"78":0.00749,"79":0,"80":0.00375,"81":0,"82":0.00375,"83":0.00375,"84":0,"85":0,"86":0,"87":0,"88":0.00749,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00375,"95":0,"96":0,"97":0,"98":0,"99":0.02248,"100":0.00375,"101":0.00375,"102":0.01873,"103":0.00375,"104":0.00375,"105":0.00375,"106":0.00375,"107":0.00375,"108":0.00375,"109":0.00375,"110":0.00375,"111":0.00749,"112":0.01124,"113":0.01498,"114":0.01498,"115":0.60311,"116":0.87282,"117":0.02997,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00375,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00375,"48":0,"49":0.02248,"50":0,"51":0,"52":0,"53":0.00375,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.02248,"69":0,"70":0,"71":0,"72":0.00375,"73":0,"74":0,"75":0.00375,"76":0.00375,"77":0,"78":0.00375,"79":0.07117,"80":0.01124,"81":0.01498,"83":0.00749,"84":0.00375,"85":0.01498,"86":0.00749,"87":0.02622,"88":0.00749,"89":0.00375,"90":0.00375,"91":0.00749,"92":0.00375,"93":0.00375,"94":0.00375,"95":0.01124,"96":0.00749,"97":0.00749,"98":0.00375,"99":0.02248,"100":0.00749,"101":0.00375,"102":0.00749,"103":0.02997,"104":0.02248,"105":0.02997,"106":0.02622,"107":0.02997,"108":0.04121,"109":1.67072,"110":0.01873,"111":0.02997,"112":0.03746,"113":0.05994,"114":0.31841,"115":4.5439,"116":2.345,"117":0.00375,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00375,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00375,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00749,"71":0.00749,"72":0.00375,"73":0,"74":0,"75":0,"76":0.00375,"77":0.00375,"78":0,"79":0.00375,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.01124,"86":0,"87":0,"88":0,"89":0.00375,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.11238,"96":0,"97":0,"98":0,"99":0.01124,"100":0.31466,"101":0.35212,"102":0.00375,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00375,"16":0,"17":0,"18":0.00375,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00375,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00375,"105":0,"106":0,"107":0.00375,"108":0,"109":0.01498,"110":0,"111":0.00375,"112":0,"113":0.00375,"114":0.02997,"115":0.49822,"116":0.15733},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00749,"15":0.00375,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00375,"13.1":0.01873,"14.1":0.01498,"15.1":0.00375,"15.2-15.3":0.00375,"15.4":0.00375,"15.5":0.00375,"15.6":0.02622,"16.0":0.00749,"16.1":0.00749,"16.2":0.00749,"16.3":0.01873,"16.4":0.00749,"16.5":0.07117,"16.6":0.07492},G:{"8":0,"17":0.10185,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00279,"6.0-6.1":0,"7.0-7.1":0.02232,"8.1-8.4":0.01256,"9.0-9.2":0,"9.3":0.04744,"10.0-10.2":0.00558,"10.3":0.06558,"11.0-11.2":0.01953,"11.3-11.4":0.0014,"12.0-12.1":0.00419,"12.2-12.5":0.18836,"13.0-13.1":0.00279,"13.2":0.00419,"13.3":0.00837,"13.4-13.7":0.03209,"14.0-14.4":0.07813,"14.5-14.8":0.24835,"15.0-15.1":0.0572,"15.2-15.3":0.06976,"15.4":0.0893,"15.5":0.17301,"15.6-15.7":1.16084,"16.0":0.53717,"16.1":0.80784,"16.2":0.41578,"16.3":0.86923,"16.4":0.18836,"16.5":2.95651,"16.6":5.77489},P:{"4":0.12184,"20":0.10153,"21":0.21322,"5.0-5.4":0.02031,"6.2-6.4":0,"7.2-7.4":0.01015,"8.2":0,"9.2":0.01015,"10.1":0,"11.1-11.2":0.03046,"12.0":0,"13.0":0.03046,"14.0":0.04061,"15.0":0.01015,"16.0":0.02031,"17.0":0.02031,"18.0":0.03046,"19.0":0.06092},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0615,"4.2-4.3":0.0019,"4.4":0,"4.4.3-4.4.4":0.02282},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00394,"9":0,"10":0,"11":0.07098,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.73158},R:{_:"0"},M:{"0":0.21889},Q:{"13.1":0},O:{"0":0.05003},H:{"0":0.5092}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00792,"49":0,"50":0,"51":0,"52":0.03961,"53":0,"54":0,"55":0,"56":0.00396,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00396,"66":0,"67":0,"68":0.00396,"69":0,"70":0,"71":0,"72":0.00396,"73":0.00396,"74":0,"75":0.00396,"76":0,"77":0.01188,"78":0.00792,"79":0,"80":0.00396,"81":0.00396,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01188,"89":0,"90":0,"91":0.00396,"92":0,"93":0,"94":0.00396,"95":0,"96":0.00396,"97":0,"98":0,"99":0.01584,"100":0.00396,"101":0.00396,"102":0.01981,"103":0.00396,"104":0.00396,"105":0.00396,"106":0.00396,"107":0.00396,"108":0.00396,"109":0.00396,"110":0.00396,"111":0.00396,"112":0.01584,"113":0.01981,"114":0.01584,"115":0.47136,"116":0.06734,"117":1.03778,"118":0.08714,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00396,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00396,"48":0,"49":0.02377,"50":0,"51":0,"52":0,"53":0.00396,"54":0,"55":0.00396,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.03169,"69":0,"70":0.00396,"71":0,"72":0,"73":0,"74":0,"75":0.00396,"76":0.00396,"77":0.00792,"78":0.01188,"79":0.05545,"80":0.01188,"81":0.01584,"83":0.01981,"84":0.00792,"85":0.02773,"86":0.00396,"87":0.03961,"88":0.01188,"89":0.00396,"90":0.00792,"91":0.00396,"92":0.01188,"93":0.00396,"94":0.00396,"95":0.00396,"96":0.00792,"97":0.00792,"98":0.00396,"99":0.01981,"100":0.00792,"101":0.00396,"102":0.00792,"103":0.02773,"104":0.00792,"105":0.03961,"106":0.01981,"107":0.03169,"108":0.03961,"109":1.97258,"110":0.03169,"111":0.03169,"112":0.04753,"113":0.04357,"114":0.0911,"115":0.15448,"116":6.09598,"117":1.6557,"118":0.00792,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00396,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00396,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00396,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00792,"71":0,"72":0.00792,"73":0.00396,"74":0,"75":0,"76":0.00396,"77":0.03565,"78":0,"79":0.00396,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.01188,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00396,"94":0.00792,"95":0.10695,"96":0,"97":0.00396,"98":0,"99":0.00396,"100":0.06734,"101":0.32876,"102":0.35649,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00396,"18":0.00396,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00396,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00396,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00396,"109":0.02377,"110":0.00396,"111":0.00396,"112":0.00396,"113":0.00396,"114":0.00792,"115":0.02377,"116":0.40402,"117":0.32084},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00396,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00396,"13.1":0.02377,"14.1":0.01188,"15.1":0.00396,"15.2-15.3":0,"15.4":0.00396,"15.5":0.00792,"15.6":0.03169,"16.0":0.00396,"16.1":0.00792,"16.2":0.00792,"16.3":0.01188,"16.4":0.00792,"16.5":0.02773,"16.6":0.12675,"17.0":0.01584,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0026,"6.0-6.1":0,"7.0-7.1":0.02859,"8.1-8.4":0.0104,"9.0-9.2":0,"9.3":0.04288,"10.0-10.2":0.0052,"10.3":0.05587,"11.0-11.2":0.02729,"11.3-11.4":0.0078,"12.0-12.1":0.0065,"12.2-12.5":0.15983,"13.0-13.1":0.0039,"13.2":0.01299,"13.3":0.08186,"13.4-13.7":0.04288,"14.0-14.4":0.07666,"14.5-14.8":0.18841,"15.0-15.1":0.05587,"15.2-15.3":0.06757,"15.4":0.07277,"15.5":0.13644,"15.6-15.7":1.06161,"16.0":0.41451,"16.1":0.67699,"16.2":0.33525,"16.3":0.62501,"16.4":0.14164,"16.5":0.40541,"16.6":7.36113,"17.0":0.74586,"17.1":0},P:{"4":0.10162,"20":0.07114,"21":0.1626,"22":2.76415,"5.0-5.4":0.02032,"6.2-6.4":0,"7.2-7.4":0.01016,"8.2":0,"9.2":0.01016,"10.1":0,"11.1-11.2":0.03049,"12.0":0,"13.0":0.02032,"14.0":0.04065,"15.0":0.01016,"16.0":0.02032,"17.0":0.02032,"18.0":0.02032,"19.0":0.05081},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.03641,"4.2-4.3":0.00497,"4.4":0,"4.4.3-4.4.4":0.04635},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00417,"9":0,"10":0,"11":0.07505,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.26746},R:{_:"0"},M:{"0":0.21137},Q:{"13.1":0},O:{"0":0.02416},H:{"0":0.52028}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RU.js
index 49710a36f92c48..b72ff1d280b165 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0.00537,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00537,"49":0,"50":0.01611,"51":0,"52":0.08054,"53":0.00537,"54":0,"55":0,"56":0.00537,"57":0,"58":0,"59":0,"60":0.00537,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01074,"69":0.00537,"70":0.00537,"71":0.00537,"72":0.00537,"73":0.00537,"74":0.00537,"75":0.00537,"76":0.00537,"77":0.00537,"78":0.01611,"79":0.00537,"80":0.00537,"81":0.01074,"82":0.00537,"83":0.00537,"84":0,"85":0,"86":0,"87":0,"88":0.00537,"89":0.00537,"90":0.01074,"91":0.00537,"92":0,"93":0,"94":0.00537,"95":0,"96":0.00537,"97":0,"98":0.00537,"99":0.00537,"100":0,"101":0.00537,"102":0.04295,"103":0.01074,"104":0.00537,"105":0.00537,"106":0.01074,"107":0.00537,"108":0.01074,"109":0.00537,"110":0.01074,"111":0.01074,"112":0.01074,"113":0.01611,"114":0.03221,"115":0.41341,"116":0.61744,"117":0.02148,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00537},D:{"4":0.00537,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.00537,"26":0.00537,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00537,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03758,"50":0,"51":0.01074,"52":0.00537,"53":0.00537,"54":0,"55":0,"56":0.01074,"57":0,"58":0.01074,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00537,"65":0,"66":0,"67":0.00537,"68":0.03758,"69":0.02685,"70":0.02685,"71":0.02685,"72":0.03758,"73":0.01611,"74":0.04295,"75":0.03221,"76":0.03221,"77":0.02685,"78":0.04295,"79":0.15033,"80":0.05906,"81":0.05906,"83":0.04295,"84":0.02685,"85":0.06443,"86":0.08054,"87":0.05369,"88":0.06443,"89":0.05369,"90":0.06443,"91":0.02148,"92":0.00537,"93":0.01074,"94":0.01074,"95":0.01611,"96":0.01074,"97":0.01611,"98":0.02148,"99":0.04295,"100":0.01074,"101":0.02148,"102":0.06443,"103":0.02685,"104":0.01611,"105":0.04832,"106":0.09127,"107":0.03758,"108":0.0859,"109":1.35836,"110":0.03758,"111":0.05906,"112":0.08054,"113":0.4671,"114":1.09528,"115":4.48312,"116":2.16908,"117":0.00537,"118":0.00537,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01611,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00537,"54":0.01074,"55":0.01074,"56":0,"57":0,"58":0,"60":0.00537,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00537,"68":0.00537,"69":0.00537,"70":0,"71":0.00537,"72":0.00537,"73":0.00537,"74":0.00537,"75":0.00537,"76":0.01074,"77":0.01074,"78":0,"79":0.01611,"80":0,"81":0,"82":0.00537,"83":0.00537,"84":0.00537,"85":0.03758,"86":0.01074,"87":0.00537,"88":0,"89":0.00537,"90":0,"91":0,"92":0.00537,"93":0.00537,"94":0.00537,"95":0.46173,"96":0,"97":0.00537,"98":0.00537,"99":0.03758,"100":1.50332,"101":1.09528,"102":0.01611,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00537},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00537,"18":0.01074,"79":0.00537,"80":0.01074,"81":0.01074,"83":0.01074,"84":0.01611,"85":0.00537,"86":0.01074,"87":0.00537,"88":0.00537,"89":0.01074,"90":0.01074,"91":0,"92":0.01074,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00537,"107":0.00537,"108":0.00537,"109":0.03221,"110":0.00537,"111":0.00537,"112":0.00537,"113":0.02148,"114":0.10738,"115":1.24024,"116":0.35972},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00537,"14":0.02148,"15":0.00537,"17":0.00537,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.22013,"10.1":0,"11.1":0,"12.1":0.01074,"13.1":0.02148,"14.1":0.04295,"15.1":0.01074,"15.2-15.3":0.00537,"15.4":0.01074,"15.5":0.01611,"15.6":0.08054,"16.0":0.01074,"16.1":0.04295,"16.2":0.02685,"16.3":0.06443,"16.4":0.12886,"16.5":0.26308,"16.6":0.17181},G:{"8":0,"17":0.22336,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00657,"8.1-8.4":0.00328,"9.0-9.2":0.02628,"9.3":0.07883,"10.0-10.2":0.01971,"10.3":0.06405,"11.0-11.2":0.07226,"11.3-11.4":0.02299,"12.0-12.1":0.03942,"12.2-12.5":0.29562,"13.0-13.1":0.02628,"13.2":0.02299,"13.3":0.05912,"13.4-13.7":0.05912,"14.0-14.4":0.19872,"14.5-14.8":0.37609,"15.0-15.1":0.20365,"15.2-15.3":0.33011,"15.4":0.1396,"15.5":0.19215,"15.6-15.7":1.26951,"16.0":0.96076,"16.1":1.23174,"16.2":0.73083,"16.3":1.24488,"16.4":0.42208,"16.5":3.31912,"16.6":4.77258},P:{"4":0.06081,"20":0.04054,"21":0.10136,"22":0.7095,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03041,"8.2":0,"9.2":0.01014,"10.1":0,"11.1-11.2":0.02027,"12.0":0,"13.0":0.01014,"14.0":0.02027,"15.0":0,"16.0":0.02027,"17.0":0.01014,"18.0":0.01014,"19.0":0.03041},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01954,"4.2-4.3":0.00837,"4.4":0,"4.4.3-4.4.4":0.04745},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00564,"9":0,"10":0,"11":0.10711,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":43.97977},R:{_:"0"},M:{"0":0.18061},Q:{"13.1":0.00463},O:{"0":0.15282},H:{"0":0.66203}};
+module.exports={C:{"2":0,"3":0,"4":0.00563,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.01688,"46":0.00563,"47":0.00563,"48":0.01688,"49":0.00563,"50":0.02251,"51":0.00563,"52":0.06754,"53":0.01688,"54":0,"55":0,"56":0.01126,"57":0,"58":0,"59":0,"60":0.00563,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00563,"68":0.01688,"69":0.01126,"70":0.00563,"71":0.01126,"72":0.01126,"73":0.00563,"74":0.00563,"75":0.01126,"76":0.00563,"77":0.01126,"78":0.01688,"79":0.01688,"80":0.00563,"81":0.01126,"82":0.01126,"83":0.01126,"84":0.00563,"85":0.00563,"86":0,"87":0.00563,"88":0.00563,"89":0.00563,"90":0.00563,"91":0.01126,"92":0,"93":0,"94":0.00563,"95":0.00563,"96":0.00563,"97":0.00563,"98":0.01126,"99":0.00563,"100":0,"101":0.01126,"102":0.05065,"103":0.01126,"104":0.01688,"105":0.01126,"106":0.01126,"107":0.00563,"108":0.02251,"109":0.01688,"110":0.01126,"111":0.01688,"112":0.01688,"113":0.02251,"114":0.0394,"115":0.30954,"116":0.12944,"117":0.66973,"118":0.05065,"119":0,"120":0,"3.5":0,"3.6":0.00563},D:{"4":0.01126,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.00563,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.04502,"50":0,"51":0.02251,"52":0.01126,"53":0.00563,"54":0,"55":0.00563,"56":0.01126,"57":0,"58":0.00563,"59":0,"60":0,"61":0.00563,"62":0,"63":0,"64":0.00563,"65":0,"66":0.00563,"67":0.00563,"68":0.04502,"69":0.02814,"70":0.03377,"71":0.0394,"72":0.05065,"73":0.03377,"74":0.05628,"75":0.09005,"76":0.09005,"77":0.10693,"78":0.09568,"79":0.11256,"80":0.13507,"81":0.13507,"83":0.11256,"84":0.05628,"85":0.11256,"86":0.15196,"87":0.16321,"88":0.1407,"89":0.10693,"90":0.34331,"91":0.06754,"92":0.02814,"93":0.02814,"94":0.02814,"95":0.02814,"96":0.05628,"97":0.06191,"98":0.04502,"99":0.05628,"100":0.06191,"101":0.04502,"102":0.13507,"103":0.10693,"104":0.06754,"105":0.1013,"106":0.16884,"107":0.29828,"108":0.12944,"109":1.49705,"110":0.07879,"111":0.09568,"112":0.09005,"113":0.39396,"114":0.86671,"115":1.20439,"116":5.38037,"117":1.33384,"118":0.00563,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01688,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00563,"54":0.01688,"55":0.01126,"56":0,"57":0,"58":0,"60":0.00563,"62":0.02251,"63":0.02251,"64":0.01126,"65":0.01688,"66":0.01126,"67":0.02251,"68":0.02251,"69":0.00563,"70":0.01688,"71":0.01126,"72":0.02251,"73":0.01688,"74":0.01126,"75":0.01126,"76":0.01126,"77":0.06754,"78":0.00563,"79":0.02814,"80":0.00563,"81":0.00563,"82":0.01126,"83":0.01688,"84":0.00563,"85":0.0394,"86":0.01688,"87":0.01126,"88":0,"89":0.00563,"90":0.01126,"91":0.00563,"92":0.01126,"93":0.00563,"94":0.00563,"95":0.41647,"96":0.02251,"97":0,"98":0.00563,"99":0.0394,"100":0.19698,"101":0.82732,"102":0.77666,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.01126,"18":0.01688,"79":0.00563,"80":0.01126,"81":0.01126,"83":0.01688,"84":0.02251,"85":0.01126,"86":0.01126,"87":0.01688,"88":0.01126,"89":0.01126,"90":0.07879,"91":0.00563,"92":0.01126,"93":0,"94":0.00563,"95":0.00563,"96":0.00563,"97":0.01126,"98":0.00563,"99":0.01126,"100":0.00563,"101":0.00563,"102":0.00563,"103":0.00563,"104":0,"105":0.01126,"106":0.00563,"107":0.01126,"108":0.01126,"109":0.03377,"110":0.01126,"111":0.01688,"112":0.00563,"113":0.02251,"114":0.11819,"115":0.09005,"116":0.73164,"117":0.6022},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00563,"14":0.01688,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.21386,"10.1":0,"11.1":0,"12.1":0.01126,"13.1":0.01688,"14.1":0.03377,"15.1":0.00563,"15.2-15.3":0.00563,"15.4":0.01126,"15.5":0.01126,"15.6":0.06754,"16.0":0.00563,"16.1":0.02814,"16.2":0.01688,"16.3":0.0394,"16.4":0.14633,"16.5":0.20261,"16.6":0.22512,"17.0":0.02814,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.0074,"8.1-8.4":0.00247,"9.0-9.2":0.05429,"9.3":0.06416,"10.0-10.2":0.02221,"10.3":0.06416,"11.0-11.2":0.07403,"11.3-11.4":0.02714,"12.0-12.1":0.04935,"12.2-12.5":0.30105,"13.0-13.1":0.03948,"13.2":0.02961,"13.3":10.84016,"13.4-13.7":0.06909,"14.0-14.4":0.21221,"14.5-14.8":0.32079,"15.0-15.1":0.24182,"15.2-15.3":0.33066,"15.4":0.15052,"15.5":0.15793,"15.6-15.7":1.06107,"16.0":0.69833,"16.1":0.90561,"16.2":0.54781,"16.3":0.83158,"16.4":0.2591,"16.5":0.68106,"16.6":5.51015,"17.0":1.00925,"17.1":0},P:{"4":0.04162,"20":0.03121,"21":0.06243,"22":0.57223,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.0104,"8.2":0,"9.2":0.0104,"10.1":0,"11.1-11.2":0.0104,"12.0":0.0104,"13.0":0.0104,"14.0":0,"15.0":0,"16.0":0.0104,"17.0":0.02081,"18.0":0.0104,"19.0":0.02081},I:{"0":0,"3":0.01738,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00174,"4.2-4.3":0.00348,"4.4":0,"4.4.3-4.4.4":0.03303},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00582,"7":0,"8":0.02326,"9":0.01745,"10":0.01163,"11":0.11631,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":35.60404},R:{_:"0"},M:{"0":0.27981},Q:{"13.1":0.00437},O:{"0":0.14865},H:{"0":0.62915}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RW.js
index e26ada130bfb09..d0e891ac6c9299 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/RW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00406,"45":0,"46":0,"47":0.00406,"48":0,"49":0,"50":0.00406,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00406,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00406,"90":0,"91":0.00406,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01217,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00406,"109":0,"110":0.00406,"111":0,"112":0.00406,"113":0.01623,"114":0.00812,"115":0.17449,"116":0.56812,"117":0.08522,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00406,"35":0,"36":0,"37":0,"38":0.00406,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00406,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00406,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00406,"71":0,"72":0.00406,"73":0,"74":0.00406,"75":0.00406,"76":0.00406,"77":0.00406,"78":0,"79":0.02029,"80":0.01217,"81":0.00812,"83":0,"84":0.00406,"85":0,"86":0.02435,"87":0.00406,"88":0.00406,"89":0.00406,"90":0.00406,"91":0.00406,"92":0,"93":0.01217,"94":0,"95":0.02435,"96":0.00406,"97":0.00406,"98":0.01623,"99":0.01217,"100":0.00406,"101":0.00812,"102":0.00406,"103":0.03652,"104":0.01623,"105":0.03652,"106":0.03246,"107":0.00406,"108":0.01623,"109":0.52348,"110":0.01623,"111":0.03652,"112":0.03652,"113":0.05275,"114":0.47479,"115":6.30207,"116":3.2951,"117":0.01623,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00812,"25":0,"26":0,"27":0,"28":0.00812,"29":0,"30":0.00406,"31":0,"32":0.00406,"33":0.00812,"34":0,"35":0,"36":0,"37":0.00406,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00812,"52":0,"53":0,"54":0,"55":0,"56":0.01623,"57":0.00406,"58":0.00406,"60":0.04464,"62":0,"63":0.02841,"64":0.00406,"65":0,"66":0.01217,"67":0.02841,"68":0.01217,"69":0.14609,"70":0.10957,"71":0.4058,"72":0.17855,"73":0.00406,"74":0,"75":0,"76":0.00406,"77":0.00406,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01217,"96":0,"97":0,"98":0,"99":0.00406,"100":0.12174,"101":0.19884,"102":0.00812,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00406},B:{"12":0.01217,"13":0.00406,"14":0,"15":0,"16":0.00406,"17":0,"18":0.02029,"79":0,"80":0,"81":0,"83":0,"84":0.00406,"85":0,"86":0,"87":0,"88":0,"89":0.00406,"90":0.00406,"91":0,"92":0.02029,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00406,"108":0.00406,"109":0.00812,"110":0.00406,"111":0.00406,"112":0.01623,"113":0.00812,"114":0.07304,"115":0.95363,"116":0.25971},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00406,"14":0.00406,"15":0,"17":0.00406,_:"0","3.1":0,"3.2":0,"5.1":0.00812,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00406,"13.1":0.00812,"14.1":0.02435,"15.1":0,"15.2-15.3":0,"15.4":0.02841,"15.5":0.00406,"15.6":0.05681,"16.0":0.00406,"16.1":0.00812,"16.2":0.01217,"16.3":0.02029,"16.4":0.01217,"16.5":0.06493,"16.6":0.08522},G:{"8":0,"17":0.08469,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00446,"6.0-6.1":0,"7.0-7.1":0.00446,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0624,"10.0-10.2":0,"10.3":0.03566,"11.0-11.2":0.00535,"11.3-11.4":0.00178,"12.0-12.1":0.00178,"12.2-12.5":0.74172,"13.0-13.1":0.00891,"13.2":0.00089,"13.3":0.07756,"13.4-13.7":0.03566,"14.0-14.4":0.10163,"14.5-14.8":0.16403,"15.0-15.1":0.10252,"15.2-15.3":0.09628,"15.4":0.33698,"15.5":0.13194,"15.6-15.7":1.65104,"16.0":0.16314,"16.1":0.36819,"16.2":0.26299,"16.3":0.50637,"16.4":0.14086,"16.5":1.331,"16.6":2.48726},P:{"4":0.08261,"20":0.04131,"21":0.1549,"5.0-5.4":0.03098,"6.2-6.4":0.02065,"7.2-7.4":0.08261,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01033,"12.0":0,"13.0":0.02065,"14.0":0,"15.0":0,"16.0":0.01033,"17.0":0.01033,"18.0":0.02065,"19.0":0.16523},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00376,"4.2-4.3":0.00376,"4.4":0,"4.4.3-4.4.4":0.109},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02029,"5.5":0},S:{"2.5":0.12478,_:"3.0-3.1"},J:{"7":0,"10":0.00594},N:{"10":0,"11":0},L:{"0":59.2279},R:{_:"0"},M:{"0":0.13072},Q:{"13.1":0},O:{"0":0.16043},H:{"0":9.91776}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00409,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00409,"103":0,"104":0,"105":0.00817,"106":0,"107":0,"108":0,"109":0.01226,"110":0,"111":0.03677,"112":0.01226,"113":0.01634,"114":0.00817,"115":0.08987,"116":0.04494,"117":0.55965,"118":0.06128,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00409,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00409,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00409,"60":0,"61":0,"62":0.00409,"63":0,"64":0.00817,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00409,"71":0,"72":0.01226,"73":0,"74":0.00817,"75":0,"76":0,"77":0.00409,"78":0.00409,"79":0.01634,"80":0.04085,"81":0.00409,"83":0,"84":0.00409,"85":0,"86":0,"87":0.00817,"88":0.01634,"89":0.00409,"90":0.00409,"91":0.02043,"92":0.00409,"93":0.00409,"94":0.00409,"95":0.01226,"96":0.00409,"97":0,"98":0.02451,"99":0.00817,"100":0,"101":0.00409,"102":0.00817,"103":0.04085,"104":0.00817,"105":0.01634,"106":0.01634,"107":0.00409,"108":0.01226,"109":0.58416,"110":0.00817,"111":0.03268,"112":0.01634,"113":0.0286,"114":0.17974,"115":0.26144,"116":7.65121,"117":1.80557,"118":0.01226,"119":0.00409,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00409,"25":0,"26":0,"27":0.00409,"28":0.00409,"29":0,"30":0,"31":0.00409,"32":0,"33":0.00409,"34":0,"35":0,"36":0,"37":0.00409,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00409,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.01634,"52":0,"53":0.00409,"54":0,"55":0,"56":0.01226,"57":0.00409,"58":0.00409,"60":0.01634,"62":0,"63":0.02043,"64":0.00817,"65":0,"66":0.01226,"67":0.05311,"68":0.01226,"69":0.10621,"70":0.05719,"71":0.37991,"72":0.45752,"73":0.0817,"74":0,"75":0,"76":0,"77":0.02043,"78":0,"79":0.00817,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01226,"96":0,"97":0,"98":0,"99":0,"100":0.01226,"101":0.12255,"102":0.20834,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00409},B:{"12":0.01634,"13":0.00409,"14":0,"15":0.00409,"16":0.00409,"17":0.00817,"18":0.03677,"79":0,"80":0,"81":0,"83":0,"84":0.00409,"85":0,"86":0,"87":0,"88":0,"89":0.00817,"90":0.00409,"91":0,"92":0.02451,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0286,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00409,"109":0.00409,"110":0.00409,"111":0.00817,"112":0.01634,"113":0.00409,"114":0.03268,"115":0.06945,"116":0.69854,"117":0.58824},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00409,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00817,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00409,"14.1":0.02043,"15.1":0.00409,"15.2-15.3":0,"15.4":0.04494,"15.5":0.00409,"15.6":0.02043,"16.0":0.00409,"16.1":0.00409,"16.2":0.00409,"16.3":0.01226,"16.4":0.01634,"16.5":0.0286,"16.6":0.13889,"17.0":0.02043,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00181,"6.0-6.1":0,"7.0-7.1":0.00633,"8.1-8.4":0.0009,"9.0-9.2":0,"9.3":0.03256,"10.0-10.2":0,"10.3":0.08411,"11.0-11.2":0.00452,"11.3-11.4":0.00271,"12.0-12.1":0.00452,"12.2-12.5":0.88906,"13.0-13.1":0.0199,"13.2":0,"13.3":0.01357,"13.4-13.7":0.05336,"14.0-14.4":0.11125,"14.5-14.8":0.14019,"15.0-15.1":0.06964,"15.2-15.3":0.123,"15.4":0.11758,"15.5":0.15195,"15.6-15.7":1.93097,"16.0":0.18993,"16.1":0.34911,"16.2":0.29213,"16.3":0.46669,"16.4":0.09949,"16.5":0.32107,"16.6":2.96383,"17.0":0.47483,"17.1":0.00181},P:{"4":0.06004,"20":0.02001,"21":0.30019,"22":0.52032,"5.0-5.4":0.03002,"6.2-6.4":0.01001,"7.2-7.4":0.07004,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01001,"12.0":0.01001,"13.0":0,"14.0":0.01001,"15.0":0,"16.0":0.03002,"17.0":0.01001,"18.0":0.02001,"19.0":0.10006},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00062,"4.2-4.3":0.00186,"4.4":0,"4.4.3-4.4.4":0.07429},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04085,"5.5":0},S:{"2.5":0.08873,_:"3.0-3.1"},J:{"7":0,"10":0.00592},N:{"10":0,"11":0},L:{"0":60.25525},R:{_:"0"},M:{"0":0.1183},Q:{"13.1":0},O:{"0":0.16562},H:{"0":9.4863}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SA.js
index e4c7273d4cd1c0..ec5fc924f5cf3b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00186,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00186,"114":0.00186,"115":0.02228,"116":0.06314,"117":0.00186,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00186,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00186,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00186,"69":0,"70":0,"71":0,"72":0.00186,"73":0,"74":0,"75":0.00186,"76":0,"77":0,"78":0,"79":0.00929,"80":0,"81":0.00186,"83":0.00186,"84":0,"85":0.00186,"86":0.00186,"87":0.00186,"88":0.00371,"89":0,"90":0,"91":0.00186,"92":0.00186,"93":0.00371,"94":0,"95":0.00186,"96":0,"97":0.00186,"98":0.00186,"99":0.01671,"100":0.00186,"101":0.00186,"102":0.00186,"103":0.00557,"104":0.00186,"105":0.00371,"106":0.00186,"107":0.00371,"108":0.00371,"109":0.15413,"110":0.00371,"111":0.00371,"112":0.00929,"113":0.00743,"114":0.11142,"115":1.12349,"116":0.70009,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00186,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00186,"71":0.00557,"72":0.00557,"73":0,"74":0.00186,"75":0,"76":0.00186,"77":0.00186,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.02043,"101":0.01114,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.00186,"17":0,"18":0.00186,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00186,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00186,"109":0.00371,"110":0.00186,"111":0.00186,"112":0.00186,"113":0.00371,"114":0.07985,"115":0.29526,"116":0.11142},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00743,"15":0.00186,"17":0.00186,_:"0","3.1":0,"3.2":0,"5.1":0.00371,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00371,"14.1":0.013,"15.1":0.00186,"15.2-15.3":0.00186,"15.4":0.00557,"15.5":0.00743,"15.6":0.03714,"16.0":0.00557,"16.1":0.01671,"16.2":0.013,"16.3":0.03157,"16.4":0.01114,"16.5":0.06871,"16.6":0.11142},G:{"8":0,"17":0.19446,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02083,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05556,"10.0-10.2":0,"10.3":0.05556,"11.0-11.2":0.01389,"11.3-11.4":0,"12.0-12.1":0.02431,"12.2-12.5":0.24654,"13.0-13.1":0.01736,"13.2":0.01389,"13.3":0.04514,"13.4-13.7":0.10417,"14.0-14.4":0.54517,"14.5-14.8":0.73616,"15.0-15.1":0.30905,"15.2-15.3":0.33683,"15.4":0.40627,"15.5":0.65629,"15.6-15.7":2.36126,"16.0":1.63899,"16.1":2.09388,"16.2":1.45148,"16.3":2.68072,"16.4":1.29175,"16.5":7.4831,"16.6":11.93128},P:{"4":0.03068,"20":0.09203,"21":0.2761,"5.0-5.4":0.01023,"6.2-6.4":0,"7.2-7.4":0.08181,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02045,"12.0":0,"13.0":0.02045,"14.0":0.03068,"15.0":0.01023,"16.0":0.05113,"17.0":0.03068,"18.0":0.0409,"19.0":0.08181},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.09671},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.013,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":55.28002},R:{_:"0"},M:{"0":0.06514},Q:{"13.1":0},O:{"0":2.36147},H:{"0":0.40859}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00218,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00435,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01088,"116":0.0087,"117":0.08918,"118":0.01088,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00218,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00218,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00218,"56":0.00218,"57":0,"58":0.00218,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00218,"69":0,"70":0,"71":0,"72":0.00218,"73":0,"74":0.00218,"75":0.00218,"76":0,"77":0,"78":0,"79":0.0087,"80":0.00435,"81":0.00218,"83":0.00218,"84":0,"85":0.00218,"86":0.00218,"87":0.00653,"88":0.00653,"89":0.00218,"90":0.00653,"91":0.00218,"92":0.00218,"93":0.00435,"94":0,"95":0.00218,"96":0.00218,"97":0.00218,"98":0.0087,"99":0.0174,"100":0,"101":0.00218,"102":0.00218,"103":0.0087,"104":0.00218,"105":0.00435,"106":0.0087,"107":0.00653,"108":0.0087,"109":0.19793,"110":0.00218,"111":0.00435,"112":0.0087,"113":0.00653,"114":0.03915,"115":0.0522,"116":2.04668,"117":0.58508,"118":0.00218,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00218,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01088,"73":0.00218,"74":0,"75":0,"76":0,"77":0.01523,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00218,"96":0,"97":0,"98":0,"99":0,"100":0.00653,"101":0.01305,"102":0.0261,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00218,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00218,"91":0,"92":0.00218,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00218,"109":0.00435,"110":0.00218,"111":0.00218,"112":0,"113":0.00218,"114":0.01088,"115":0.08048,"116":0.3132,"117":0.22185},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0087,"15":0.00218,_:"0","3.1":0,"3.2":0,"5.1":0.00435,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00435,"14.1":0.01523,"15.1":0.00218,"15.2-15.3":0.00218,"15.4":0.00435,"15.5":0.0087,"15.6":0.03915,"16.0":0.00653,"16.1":0.02828,"16.2":0.01523,"16.3":0.03045,"16.4":0.01088,"16.5":0.02828,"16.6":0.2088,"17.0":0.01523,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02734,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.05468,"10.0-10.2":0,"10.3":0.06494,"11.0-11.2":0.01367,"11.3-11.4":0,"12.0-12.1":0.02734,"12.2-12.5":0.22899,"13.0-13.1":0.01025,"13.2":0.01367,"13.3":0.16405,"13.4-13.7":0.0957,"14.0-14.4":0.47849,"14.5-14.8":0.66988,"15.0-15.1":0.27,"15.2-15.3":0.30076,"15.4":0.35203,"15.5":0.55026,"15.6-15.7":2.13269,"16.0":1.44571,"16.1":1.76015,"16.2":1.22698,"16.3":2.16686,"16.4":0.89887,"16.5":2.43345,"16.6":17.01022,"17.0":1.51065,"17.1":0},P:{"4":0.03105,"20":0.06211,"21":0.13457,"22":1.81151,"5.0-5.4":0.01035,"6.2-6.4":0,"7.2-7.4":0.05176,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01035,"12.0":0,"13.0":0.01035,"14.0":0.03105,"15.0":0.01035,"16.0":0.03105,"17.0":0.0207,"18.0":0.03105,"19.0":0.06211},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.03011,"4.4":0,"4.4.3-4.4.4":0.09034},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01958,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":55.41073},R:{_:"0"},M:{"0":0.07825},Q:{"13.1":0},O:{"0":2.12058},H:{"0":0.40004}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SB.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SB.js
index 7f524215496192..74c33515ab6757 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SB.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SB.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.0068,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.06456,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.05437,"111":0,"112":0.0034,"113":0,"114":0.0034,"115":0.13252,"116":0.26844,"117":0.04417,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.0068,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.0068,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.25145,"54":0,"55":0,"56":0.0068,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0034,"70":0.01019,"71":0.01019,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0.0034,"81":0.0034,"83":0.0034,"84":0,"85":0,"86":0,"87":0.01019,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.0068,"95":0.0034,"96":0,"97":0,"98":0,"99":0.0034,"100":0,"101":0,"102":0.01019,"103":0.02379,"104":0.01019,"105":0.0034,"106":0.0034,"107":0.0034,"108":0.18349,"109":0.13252,"110":0.02039,"111":0.03738,"112":0.01019,"113":0.03398,"114":0.14272,"115":2.59947,"116":1.62085,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.0034,"64":0,"65":0.0034,"66":0,"67":0,"68":0,"69":0.03398,"70":0.14611,"71":0.06456,"72":0.04757,"73":0,"74":0.01019,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03738,"96":0,"97":0,"98":0.01019,"99":0.0034,"100":0.03738,"101":0.06116,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.0034,"14":0.76455,"15":0.01019,"16":0.0068,"17":0.01359,"18":0.01359,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.01359,"90":0,"91":0,"92":0.02379,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0068,"100":0.0034,"101":0,"102":0,"103":0.0034,"104":0,"105":0.08835,"106":0,"107":0.0034,"108":0.0034,"109":0.08835,"110":0.01699,"111":0.0068,"112":0.01359,"113":0.03398,"114":0.06456,"115":1.17231,"116":0.32281},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0.0034,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0068,"14.1":0.01019,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.31941,"16.0":0.0034,"16.1":0.0034,"16.2":0.0034,"16.3":0,"16.4":0.0068,"16.5":0.03738,"16.6":0.02039},G:{"8":0,"17":0.01415,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00396,"5.0-5.1":0,"6.0-6.1":0.00226,"7.0-7.1":0,"8.1-8.4":0.00226,"9.0-9.2":0,"9.3":0.03226,"10.0-10.2":0,"10.3":0.04811,"11.0-11.2":0,"11.3-11.4":0.00226,"12.0-12.1":0,"12.2-12.5":0.25075,"13.0-13.1":0,"13.2":0,"13.3":0.00623,"13.4-13.7":0.03057,"14.0-14.4":0.03396,"14.5-14.8":0.02377,"15.0-15.1":0.06453,"15.2-15.3":0.37302,"15.4":0.06792,"15.5":0.04811,"15.6-15.7":0.36905,"16.0":0.4449,"16.1":0.17038,"16.2":0.68773,"16.3":0.26264,"16.4":0.11434,"16.5":1.51584,"16.6":1.09301},P:{"4":0.03093,"20":0.68051,"21":0.46398,"5.0-5.4":0,"6.2-6.4":0.01031,"7.2-7.4":0.15466,"8.2":0,"9.2":0.03093,"10.1":0.01031,"11.1-11.2":0.04124,"12.0":0,"13.0":0.02062,"14.0":0.04124,"15.0":0.01031,"16.0":0.16497,"17.0":0.06186,"18.0":0.06186,"19.0":0.12373},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00827,"4.4":0,"4.4.3-4.4.4":0.0827},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.09854,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":71.89614},R:{_:"0"},M:{"0":0.83185},Q:{"13.1":0.19146},O:{"0":3.88198},H:{"0":2.35013}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.05085,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.01017,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00339,"111":0,"112":0,"113":0.00339,"114":0.00339,"115":0.04746,"116":0.02034,"117":0.28476,"118":0.01695,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00339,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.01017,"52":0,"53":0.03051,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00339,"70":0.00339,"71":0,"72":0,"73":0,"74":0.00339,"75":0,"76":0.00339,"77":0.00339,"78":0.00339,"79":0,"80":0,"81":0.00678,"83":0.00339,"84":0,"85":0,"86":0,"87":0.00678,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.01356,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00339,"102":0.00339,"103":0.07119,"104":0.01356,"105":0.00339,"106":0.00678,"107":0,"108":0.15933,"109":0.37968,"110":0.02712,"111":0.01017,"112":0.01017,"113":0.00339,"114":0.05085,"115":0.06441,"116":3.24423,"117":1.28481,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00678,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00339,"34":0,"35":0,"36":0,"37":0.00678,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00339,"64":0,"65":0.00339,"66":0,"67":0,"68":0.00678,"69":0.01695,"70":0.12543,"71":0.00678,"72":0.06441,"73":0.03051,"74":0,"75":0,"76":0,"77":0.03729,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.0678,"102":0.03729,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00339,"13":0,"14":0.53901,"15":0.00678,"16":0.01017,"17":0.01356,"18":0.02034,"79":0,"80":0.01017,"81":0,"83":0,"84":0.00339,"85":0.00678,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01695,"93":0,"94":0.00339,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00339,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00339,"108":0.00339,"109":0.01695,"110":0.01017,"111":0.00339,"112":0.00678,"113":0.02034,"114":0.01356,"115":0.07119,"116":0.88818,"117":0.64071},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00678,"14.1":0.01695,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00339,"15.6":0.22713,"16.0":0.00339,"16.1":0.00339,"16.2":0,"16.3":0.00339,"16.4":0.00339,"16.5":0.01017,"16.6":0.0678,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.01749,"9.3":0.01117,"10.0-10.2":0,"10.3":0.0442,"11.0-11.2":0.00243,"11.3-11.4":0.00243,"12.0-12.1":0,"12.2-12.5":0.22734,"13.0-13.1":0,"13.2":0,"13.3":0.12144,"13.4-13.7":0.0374,"14.0-14.4":0.02235,"14.5-14.8":0.07967,"15.0-15.1":0.02866,"15.2-15.3":0.1501,"15.4":0.02672,"15.5":0,"15.6-15.7":0.25357,"16.0":0.3687,"16.1":0.12144,"16.2":0.38618,"16.3":0.20548,"16.4":0.03983,"16.5":0.12581,"16.6":2.5051,"17.0":0.07724,"17.1":0},P:{"4":0.08305,"20":0.4983,"21":0.69554,"22":1.10041,"5.0-5.4":0.03114,"6.2-6.4":0,"7.2-7.4":0.15572,"8.2":0,"9.2":0.20762,"10.1":0,"11.1-11.2":0.02076,"12.0":0.01038,"13.0":0.01038,"14.0":0.03114,"15.0":0.01038,"16.0":0.15572,"17.0":0.05191,"18.0":0.14534,"19.0":0.10381},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.13746},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.05424,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":72.07271},R:{_:"0"},M:{"0":0.49575},Q:{"13.1":0.00661},O:{"0":4.56751},H:{"0":2.15272}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SC.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SC.js
index 4edd3400aaca6a..3c48cfa13b905d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SC.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SC.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.30055,"51":0,"52":0.30347,"53":0.80537,"54":0,"55":0.01751,"56":0.03793,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00292,"69":0,"70":0,"71":0,"72":0.00292,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00292,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00584,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00292,"101":0,"102":0.15757,"103":0,"104":0,"105":0.04085,"106":0,"107":0,"108":0.02918,"109":0.00292,"110":0,"111":0,"112":0,"113":0.00292,"114":0.00292,"115":0.09046,"116":0.24219,"117":0.00584,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00292},D:{"4":0.00292,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.01751,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.05836,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.01751,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00584,"69":0.00584,"70":0.00584,"71":0.00292,"72":0.178,"73":0.00292,"74":0.00584,"75":0.00875,"76":0.00584,"77":0.00584,"78":0.00875,"79":0.00875,"80":0.01167,"81":0.01167,"83":0.01459,"84":0.00875,"85":0.00584,"86":0.12256,"87":0.01459,"88":0.00875,"89":0.00875,"90":0.01459,"91":0.01751,"92":0.00875,"93":0.00292,"94":0.00584,"95":0.00292,"96":0.00584,"97":0.00292,"98":0.00292,"99":0.02043,"100":0,"101":0.00584,"102":0.00292,"103":0.01751,"104":0.00584,"105":0.00875,"106":0.04377,"107":0.00584,"108":0.00584,"109":0.25387,"110":0.02334,"111":0.00875,"112":0.09338,"113":1.00087,"114":0.80245,"115":1.1672,"116":0.68865,"117":0.00875,"118":0.00584,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00292,"55":0.00292,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00292,"69":0,"70":0,"71":0.01751,"72":0.01751,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.01459,"95":0.00875,"96":0,"97":0,"98":0.00292,"99":0.00292,"100":0.01751,"101":0.0321,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00584,"79":0.00292,"80":0.00292,"81":0.00292,"83":0.00292,"84":0.00292,"85":0.00292,"86":0.00292,"87":0,"88":0.00292,"89":0.00292,"90":0.00292,"91":0,"92":0.00292,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00875,"101":0,"102":0,"103":0,"104":0,"105":0.00292,"106":0.00584,"107":0.00875,"108":0.01459,"109":0,"110":0.01167,"111":0,"112":0.00584,"113":0.01751,"114":0.11672,"115":0.32973,"116":0.10213},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00584,"15":0,"17":0.00292,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.04085,"10.1":0,"11.1":0,"12.1":0.0817,"13.1":0.00584,"14.1":0.02626,"15.1":0.01167,"15.2-15.3":0.00875,"15.4":0.00292,"15.5":0.00292,"15.6":0.02626,"16.0":0.00875,"16.1":0.00584,"16.2":0.01459,"16.3":0.01459,"16.4":0.02626,"16.5":0.03793,"16.6":0.04377},G:{"8":0,"17":0.03354,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00839,"9.3":0.02097,"10.0-10.2":0,"10.3":0.01258,"11.0-11.2":0.02516,"11.3-11.4":0.02097,"12.0-12.1":0.03354,"12.2-12.5":0.70443,"13.0-13.1":0.01258,"13.2":31.04502,"13.3":0.01677,"13.4-13.7":0.12579,"14.0-14.4":0.19707,"14.5-14.8":0.42769,"15.0-15.1":0.15095,"15.2-15.3":0.18869,"15.4":0.20546,"15.5":0.19288,"15.6-15.7":1.14888,"16.0":0.41091,"16.1":0.78829,"16.2":0.26416,"16.3":0.64992,"16.4":0.64572,"16.5":1.86169,"16.6":2.69191},P:{"4":0.04039,"20":0.08078,"21":0.31301,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.13126,"8.2":0,"9.2":0.02019,"10.1":0,"11.1-11.2":0.0101,"12.0":0,"13.0":0.09087,"14.0":0.02019,"15.0":0,"16.0":0.06058,"17.0":0.02019,"18.0":0.03029,"19.0":0.06058},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.06167},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.0271,"10":0,"11":0.01084,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":44.68264},R:{_:"0"},M:{"0":0.29744},Q:{"13.1":0.08498},O:{"0":1.16853},H:{"0":0.29501}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.03896,"51":0,"52":0.08324,"53":0.21075,"54":0,"55":0.00708,"56":0.04073,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00177,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00177,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.06199,"103":0,"104":0.00177,"105":0.01594,"106":0,"107":0,"108":0.00531,"109":0,"110":0,"111":0,"112":0.00177,"113":0,"114":0,"115":0.02657,"116":0.01771,"117":0.15231,"118":0.01063,"119":0,"120":0,"3.5":0,"3.6":0.00177},D:{"4":0.00177,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.01063,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.04073,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00354,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00177,"69":0.00177,"70":0.00177,"71":0.00177,"72":0.10272,"73":0,"74":0.00177,"75":0.00177,"76":0.00177,"77":0.00177,"78":0.00177,"79":0.00354,"80":0.00354,"81":0.00354,"83":0.00354,"84":0.00177,"85":0.00177,"86":0.00708,"87":0.00531,"88":0.00354,"89":0.00177,"90":0.00354,"91":0.00354,"92":0.00177,"93":0,"94":0.00354,"95":0,"96":0.00354,"97":0,"98":0,"99":0.00531,"100":0.00177,"101":0.00354,"102":0.00177,"103":0.00354,"104":0.00354,"105":0.01063,"106":0.01948,"107":0.00708,"108":0.00177,"109":0.08324,"110":0.00886,"111":0.00354,"112":0.03365,"113":0.02479,"114":0.08501,"115":0.0425,"116":0.696,"117":0.21606,"118":0.00708,"119":0.00177,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00177,"69":0.00354,"70":0,"71":0,"72":0.02657,"73":0.00708,"74":0,"75":0,"76":0,"77":0.00177,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00354,"95":0.00354,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.01063,"102":0.01063,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00177,"16":0,"17":0,"18":0.00177,"79":0,"80":0.00177,"81":0.00177,"83":0.00177,"84":0.00177,"85":0.00177,"86":0.00177,"87":0,"88":0,"89":0.00177,"90":0.00177,"91":0,"92":0.00177,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00177,"100":0.00354,"101":0,"102":0,"103":0,"104":0,"105":0.00177,"106":0,"107":0,"108":0.00177,"109":0.00177,"110":0,"111":0,"112":0.00354,"113":0.00708,"114":0.01063,"115":0.00708,"116":0.15585,"117":0.10449},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00354,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01063,"10.1":0,"11.1":0,"12.1":0.05313,"13.1":0.00177,"14.1":0.00886,"15.1":0.00531,"15.2-15.3":0.00531,"15.4":0,"15.5":0,"15.6":0.00708,"16.0":0.00177,"16.1":0.00177,"16.2":0.00177,"16.3":0.01948,"16.4":0.00354,"16.5":0.00708,"16.6":0.03896,"17.0":0.00354,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03025,"10.0-10.2":0,"10.3":0.0121,"11.0-11.2":0.01815,"11.3-11.4":0.01815,"12.0-12.1":0.03025,"12.2-12.5":0.35085,"13.0-13.1":0.01815,"13.2":51.63552,"13.3":0.0121,"13.4-13.7":0.10284,"14.0-14.4":0.22382,"14.5-14.8":0.30246,"15.0-15.1":0.11493,"15.2-15.3":0.15728,"15.4":0.11493,"15.5":0.09679,"15.6-15.7":0.89527,"16.0":0.31456,"16.1":0.60491,"16.2":0.16333,"16.3":0.41134,"16.4":0.3327,"16.5":0.39319,"16.6":3.65973,"17.0":0.3448,"17.1":0},P:{"4":0.05062,"20":0.0405,"21":0.13161,"22":0.99214,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.05062,"8.2":0,"9.2":0.02025,"10.1":0,"11.1-11.2":0.0405,"12.0":0,"13.0":0.0405,"14.0":0.01012,"15.0":0,"16.0":0.0405,"17.0":0.02025,"18.0":0.03037,"19.0":0.07087},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.03531},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0.00266,"7":0,"8":0.00266,"9":0.0186,"10":0,"11":0.02922,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.00823,"11":0},L:{"0":32.84116},R:{_:"0"},M:{"0":0.26333},Q:{"13.1":0.0576},O:{"0":0.89696},H:{"0":0.43628}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SD.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SD.js
index cf524094eda1ec..e65a54835f68f6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SD.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SD.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.00093,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00093,"43":0.00093,"44":0.00187,"45":0,"46":0,"47":0.00093,"48":0.00093,"49":0,"50":0,"51":0,"52":0.01121,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00093,"69":0,"70":0,"71":0,"72":0.00093,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00093,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00187,"86":0,"87":0,"88":0,"89":0.00093,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00093,"100":0,"101":0,"102":0.0056,"103":0,"104":0.00093,"105":0.00093,"106":0.00093,"107":0.00093,"108":0.00093,"109":0.00093,"110":0.0028,"111":0.00467,"112":0.00187,"113":0.00093,"114":0.0028,"115":0.03643,"116":0.0495,"117":0.00187,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00093,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00093,"41":0.00093,"42":0,"43":0.00187,"44":0,"45":0,"46":0.00093,"47":0,"48":0,"49":0,"50":0.00093,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00093,"57":0,"58":0.00467,"59":0,"60":0.00093,"61":0,"62":0,"63":0.00187,"64":0.00187,"65":0,"66":0,"67":0.00093,"68":0.00187,"69":0.00374,"70":0.0056,"71":0.00093,"72":0,"73":0,"74":0.00093,"75":0,"76":0,"77":0,"78":0.00374,"79":0.00187,"80":0.00093,"81":0.00187,"83":0.00187,"84":0,"85":0,"86":0.00187,"87":0.00187,"88":0.0028,"89":0,"90":0.00093,"91":0,"92":0.00093,"93":0,"94":0.00187,"95":0,"96":0.00093,"97":0,"98":0.00093,"99":0.00374,"100":0,"101":0.00093,"102":0.00187,"103":0.00093,"104":0.00187,"105":0.00187,"106":0.00187,"107":0.00467,"108":0.0028,"109":0.06912,"110":0.00187,"111":0.0056,"112":0.00934,"113":0.0028,"114":0.02148,"115":0.14197,"116":0.07285,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00187,"25":0,"26":0.0028,"27":0,"28":0.00467,"29":0,"30":0.0056,"31":0,"32":0,"33":0.0028,"34":0,"35":0,"36":0,"37":0,"38":0.00093,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00093,"60":0.0056,"62":0,"63":0.00374,"64":0.0056,"65":0.00654,"66":0.0056,"67":0.01588,"68":0.00374,"69":0.02055,"70":0.02148,"71":0.03829,"72":0.02895,"73":0.00374,"74":0.0056,"75":0.00093,"76":0.0056,"77":0.00467,"78":0,"79":0.00093,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0028,"96":0,"97":0,"98":0.00093,"99":0.00187,"100":0.02148,"101":0.01961,"102":0.00093,"9.5-9.6":0,"10.0-10.1":0,"10.5":0.00093,"10.6":0.0028,"11.1":0.00093,"11.5":0,"11.6":0,"12.1":0.00747},B:{"12":0.00187,"13":0,"14":0.00093,"15":0,"16":0.00187,"17":0.00187,"18":0.00654,"79":0,"80":0,"81":0,"83":0,"84":0.0028,"85":0,"86":0,"87":0,"88":0,"89":0.00187,"90":0.00093,"91":0,"92":0.0056,"93":0,"94":0,"95":0,"96":0,"97":0.00093,"98":0,"99":0,"100":0.00187,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00187,"109":0.00374,"110":0.00093,"111":0.00093,"112":0.0028,"113":0.01027,"114":0.00747,"115":0.0467,"116":0.01681},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00093,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.06725,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00093,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00093,"16.0":0.00093,"16.1":0,"16.2":0,"16.3":0.00187,"16.4":0.00093,"16.5":0.00093,"16.6":0.00093},G:{"8":0,"17":0.03766,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00164,"5.0-5.1":0.00164,"6.0-6.1":0.00273,"7.0-7.1":0.01146,"8.1-8.4":0.00055,"9.0-9.2":0,"9.3":0.05076,"10.0-10.2":0.00164,"10.3":0.02238,"11.0-11.2":0.00218,"11.3-11.4":0.00218,"12.0-12.1":0.00437,"12.2-12.5":0.27125,"13.0-13.1":0.00218,"13.2":0,"13.3":0.02128,"13.4-13.7":0.03602,"14.0-14.4":0.27561,"14.5-14.8":0.16864,"15.0-15.1":0.17574,"15.2-15.3":0.14627,"15.4":0.1479,"15.5":0.22486,"15.6-15.7":0.60689,"16.0":0.24723,"16.1":0.33783,"16.2":0.33565,"16.3":0.56814,"16.4":0.51684,"16.5":0.68057,"16.6":0.55286},P:{"4":0.34792,"20":0.53211,"21":0.7163,"5.0-5.4":0.02047,"6.2-6.4":0.04093,"7.2-7.4":0.21489,"8.2":0,"9.2":0.04093,"10.1":0,"11.1-11.2":0.10233,"12.0":0.02047,"13.0":0.0921,"14.0":0.13303,"15.0":0.04093,"16.0":0.37862,"17.0":0.10233,"18.0":0.27629,"19.0":0.39908},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02642,"4.4":0,"4.4.3-4.4.4":0.21133},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0028,"5.5":0},S:{"2.5":0.01813,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":73.62488},R:{_:"0"},M:{"0":0.21758},Q:{"13.1":0},O:{"0":1.87666},H:{"0":11.18378}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00087,"46":0,"47":0.00173,"48":0,"49":0.0026,"50":0,"51":0,"52":0.00087,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00087,"67":0,"68":0,"69":0.00087,"70":0,"71":0,"72":0.00173,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00087,"101":0,"102":0.0052,"103":0,"104":0,"105":0.00087,"106":0.00087,"107":0,"108":0,"109":0.00173,"110":0.0026,"111":0.00433,"112":0.00087,"113":0.00087,"114":0.00087,"115":0.02078,"116":0.00779,"117":0.0459,"118":0.00433,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00087,"41":0.00087,"42":0,"43":0.00087,"44":0,"45":0,"46":0.00087,"47":0.00087,"48":0,"49":0,"50":0.00087,"51":0.00173,"52":0,"53":0,"54":0,"55":0.00087,"56":0.00087,"57":0,"58":0.00953,"59":0,"60":0,"61":0,"62":0,"63":0.00087,"64":0,"65":0,"66":0,"67":0,"68":0.00087,"69":0.00087,"70":0.00346,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00087,"78":0.00693,"79":0.0026,"80":0.00173,"81":0.00173,"83":0.00087,"84":0,"85":0.00087,"86":0.00087,"87":0.00173,"88":0.0026,"89":0.00087,"90":0,"91":0.00087,"92":0.00173,"93":0,"94":0,"95":0,"96":0.00087,"97":0.00346,"98":0.00087,"99":0.00346,"100":0.00087,"101":0,"102":0.00087,"103":0.00087,"104":0.00173,"105":0.00087,"106":0.00087,"107":0.00346,"108":0.00173,"109":0.04936,"110":0.00173,"111":0.00606,"112":0.0026,"113":0.00087,"114":0.01039,"115":0.01472,"116":0.14982,"117":0.03464,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00087,"25":0,"26":0,"27":0,"28":0.0026,"29":0.00087,"30":0.00433,"31":0,"32":0.00087,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00087,"39":0,"40":0,"41":0,"42":0.00087,"43":0,"44":0,"45":0,"46":0,"47":0.00087,"48":0,"49":0,"50":0.00087,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00173,"60":0.00606,"62":0,"63":0.0026,"64":0.00346,"65":0.00346,"66":0.0026,"67":0.0052,"68":0.00173,"69":0.01472,"70":0.01126,"71":0.01386,"72":0.06928,"73":0.01039,"74":0.0026,"75":0,"76":0.00173,"77":0.02511,"78":0.00087,"79":0.00173,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0026,"96":0,"97":0,"98":0,"99":0.00087,"100":0.00346,"101":0.01126,"102":0.01126,"9.5-9.6":0,"10.0-10.1":0,"10.5":0.00087,"10.6":0.00173,"11.1":0.00087,"11.5":0,"11.6":0,"12.1":0.00433},B:{"12":0.00087,"13":0,"14":0.00087,"15":0,"16":0.00087,"17":0.00087,"18":0.00346,"79":0,"80":0,"81":0,"83":0,"84":0.00087,"85":0,"86":0,"87":0,"88":0,"89":0.00173,"90":0.00087,"91":0,"92":0.00866,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00087,"101":0,"102":0,"103":0.00087,"104":0,"105":0,"106":0,"107":0,"108":0.00087,"109":0.00173,"110":0.00173,"111":0.00173,"112":0.00087,"113":0.00087,"114":0.0026,"115":0.00346,"116":0.03291,"117":0.01299},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00087,"12":0,"13":0,"14":0.00087,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.05283,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00087,"14.1":0.00087,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00087,"16.0":0,"16.1":0,"16.2":0,"16.3":0.00087,"16.4":0,"16.5":0,"16.6":0.00173,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00709,"5.0-5.1":0,"6.0-6.1":0.00203,"7.0-7.1":0.01469,"8.1-8.4":0.00051,"9.0-9.2":0.00304,"9.3":0.11296,"10.0-10.2":0.00051,"10.3":0.01925,"11.0-11.2":0.0152,"11.3-11.4":0.00203,"12.0-12.1":0.00962,"12.2-12.5":0.22086,"13.0-13.1":0.00253,"13.2":0.00203,"13.3":0.0157,"13.4-13.7":0.03749,"14.0-14.4":0.19705,"14.5-14.8":0.22086,"15.0-15.1":0.08966,"15.2-15.3":0.14842,"15.4":0.11246,"15.5":0.1621,"15.6-15.7":0.58458,"16.0":0.31407,"16.1":0.3784,"16.2":0.2776,"16.3":0.53544,"16.4":0.3627,"16.5":0.30445,"16.6":0.70413,"17.0":0.19553,"17.1":0},P:{"4":0.41517,"20":0.52655,"21":0.35441,"22":1.205,"5.0-5.4":0.03038,"6.2-6.4":0.05063,"7.2-7.4":0.30378,"8.2":0,"9.2":0.28353,"10.1":0.01013,"11.1-11.2":0.05063,"12.0":0.01013,"13.0":0.07088,"14.0":0.15189,"15.0":0.0405,"16.0":0.45567,"17.0":0.14176,"18.0":0.2734,"19.0":0.56706},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00963,"4.2-4.3":0.02247,"4.4":0,"4.4.3-4.4.4":0.21829},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00433,"5.5":0},S:{"2.5":0.00913,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.81685},R:{_:"0"},M:{"0":0.18268},Q:{"13.1":0},O:{"0":1.64412},H:{"0":10.22132}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SE.js
index 6644c0eefc8997..4655c979da783d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00444,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00444,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01331,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00444,"89":0,"90":0,"91":0.00444,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03992,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00444,"109":0,"110":0.00444,"111":0,"112":0.00444,"113":0.00887,"114":0.01331,"115":0.21736,"116":0.63435,"117":0.01774,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00444,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.01331,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00444,"76":0.00444,"77":0.00444,"78":0,"79":0.01774,"80":0.00444,"81":0.00444,"83":0,"84":0,"85":0.00444,"86":0.00887,"87":0.01331,"88":0.00444,"89":0.01774,"90":0.00444,"91":0.00444,"92":0.00444,"93":0.05767,"94":0.00444,"95":0.00444,"96":0.00444,"97":0,"98":0.00444,"99":0.00887,"100":0.01331,"101":0.01331,"102":0.01331,"103":0.15082,"104":0.02218,"105":0.02662,"106":0.00887,"107":0.02218,"108":0.06654,"109":0.51901,"110":0.02662,"111":0.03992,"112":0.06654,"113":0.17744,"114":1.20659,"115":6.81813,"116":3.11851,"117":0.00444,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00444,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00444,"72":0.00444,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00887,"96":0,"97":0,"98":0,"99":0.00444,"100":0.20849,"101":0.09759,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00444,"89":0,"90":0,"91":0,"92":0.00444,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00444,"101":0,"102":0,"103":0.00444,"104":0.00444,"105":0,"106":0.00444,"107":0.00444,"108":0.00887,"109":0.03992,"110":0.00444,"111":0.00444,"112":0.00444,"113":0.01774,"114":0.20406,"115":2.46642,"116":0.74081},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00444,"14":0.03105,"15":0.00444,"17":0.00887,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00444,"10.1":0,"11.1":0.00444,"12.1":0.00444,"13.1":0.03549,"14.1":0.08428,"15.1":0.00887,"15.2-15.3":0.00887,"15.4":0.01774,"15.5":0.03549,"15.6":0.19962,"16.0":0.01774,"16.1":0.0488,"16.2":0.0488,"16.3":0.1597,"16.4":0.0488,"16.5":0.39924,"16.6":0.64766},G:{"8":0,"17":0.2129,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00803,"9.3":0.06025,"10.0-10.2":0,"10.3":0.06427,"11.0-11.2":0,"11.3-11.4":0.02812,"12.0-12.1":0.00803,"12.2-12.5":0.31734,"13.0-13.1":0,"13.2":0,"13.3":0.01205,"13.4-13.7":0.0482,"14.0-14.4":0.14461,"14.5-14.8":0.44186,"15.0-15.1":0.11247,"15.2-15.3":0.18076,"15.4":0.17273,"15.5":0.30529,"15.6-15.7":3.09707,"16.0":0.98415,"16.1":2.45034,"16.2":1.15688,"16.3":2.72751,"16.4":0.29324,"16.5":8.04996,"16.6":19.25725},P:{"4":0.04106,"20":0.08212,"21":0.28742,"22":5.19416,"5.0-5.4":0.01027,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02053,"14.0":0.01027,"15.0":0.01027,"16.0":0.02053,"17.0":0.0308,"18.0":0.01027,"19.0":0.04106},I:{"0":0,"3":0,"4":0.00784,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01175,"4.2-4.3":0.01567,"4.4":0,"4.4.3-4.4.4":0.03918},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01331,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":31.16837},R:{_:"0"},M:{"0":0.47294},Q:{"13.1":0},O:{"0":0.01669},H:{"0":0.18437}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00501,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.00501,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01502,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00501,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03506,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00501,"114":0.00501,"115":0.09014,"116":0.05509,"117":0.76122,"118":0.07512,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00501,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.01502,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00501,"76":0.00501,"77":0,"78":0.00501,"79":0.01002,"80":0.00501,"81":0.00501,"83":0,"84":0,"85":0.00501,"86":0.00501,"87":0.01502,"88":0.00501,"89":0.02504,"90":0.00501,"91":0.01002,"92":0.01002,"93":0.09014,"94":0,"95":0,"96":0.00501,"97":0,"98":0.00501,"99":0.00501,"100":0.01502,"101":0.01002,"102":0.01502,"103":0.20032,"104":0.02003,"105":0.03506,"106":0.01002,"107":0.01502,"108":0.10517,"109":0.54086,"110":0.02003,"111":0.03506,"112":0.04507,"113":0.10517,"114":0.29547,"115":0.99659,"116":11.48835,"117":2.39883,"118":0.00501,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00501,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00501,"73":0,"74":0,"75":0,"76":0,"77":0.02003,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01002,"96":0,"97":0,"98":0,"99":0.00501,"100":0.0601,"101":0.1252,"102":0.22035,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00501,"89":0,"90":0,"91":0,"92":0.00501,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00501,"104":0,"105":0,"106":0.00501,"107":0.00501,"108":0.00501,"109":0.04507,"110":0.01002,"111":0.00501,"112":0.00501,"113":0.01502,"114":0.07512,"115":0.16026,"116":2.34875,"117":1.49739},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00501,"14":0.03506,"15":0.00501,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00501,"12.1":0.00501,"13.1":0.04006,"14.1":0.10517,"15.1":0.01502,"15.2-15.3":0.01502,"15.4":0.02504,"15.5":0.04006,"15.6":0.22536,"16.0":0.02003,"16.1":0.0601,"16.2":0.05509,"16.3":0.16026,"16.4":0.0601,"16.5":0.15525,"16.6":1.1268,"17.0":0.05509,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00785,"9.3":0.06278,"10.0-10.2":0,"10.3":0.05885,"11.0-11.2":0,"11.3-11.4":0.02354,"12.0-12.1":0.00785,"12.2-12.5":0.25503,"13.0-13.1":0.00392,"13.2":0,"13.3":0.01569,"13.4-13.7":0.04316,"14.0-14.4":0.12163,"14.5-14.8":0.43159,"15.0-15.1":0.09024,"15.2-15.3":0.16087,"15.4":0.18833,"15.5":0.29427,"15.6-15.7":2.77787,"16.0":0.98089,"16.1":2.20111,"16.2":0.96912,"16.3":2.10694,"16.4":0.22757,"16.5":0.85141,"16.6":25.14206,"17.0":1.70674,"17.1":0.00785},P:{"4":0.04092,"20":0.06139,"21":0.18416,"22":4.76771,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01023,"14.0":0.01023,"15.0":0.01023,"16.0":0.02046,"17.0":0.02046,"18.0":0.01023,"19.0":0.03069},I:{"0":0,"3":0,"4":0.01,"2.1":0,"2.2":0,"2.3":0,"4.1":0.005,"4.2-4.3":0.005,"4.4":0,"4.4.3-4.4.4":0.05},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01002,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":27.69382},R:{_:"0"},M:{"0":0.4393},Q:{"13.1":0},O:{"0":0.01498},H:{"0":0.15124}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SG.js
index 19151e565ca7c1..8b9cf6bdead1b5 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00333,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.04995,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00666,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00333,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00666,"103":0.00333,"104":0.00333,"105":0.00333,"106":0.00333,"107":0.00333,"108":0.00333,"109":0.00333,"110":0.00333,"111":0.00666,"112":0.00333,"113":0.00666,"114":0.00666,"115":0.11322,"116":0.39627,"117":0.00999,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00666,"35":0,"36":0,"37":0,"38":0.0333,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00666,"48":0,"49":0.00333,"50":0,"51":0,"52":0,"53":0.00666,"54":0,"55":0,"56":0.00333,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00333,"66":0,"67":0.00333,"68":0.00666,"69":0,"70":0,"71":0,"72":0,"73":0.00333,"74":0.00333,"75":0.00333,"76":0,"77":0,"78":0.00666,"79":0.09657,"80":0.00333,"81":0.02331,"83":0.00666,"84":0.00333,"85":0.00999,"86":0.00999,"87":0.04995,"88":0.00333,"89":0.00333,"90":0,"91":0.00333,"92":0.00333,"93":0.00333,"94":0.00333,"95":0.00666,"96":0.00333,"97":0.00333,"98":0.00666,"99":0.02997,"100":0.01665,"101":0.01332,"102":0.01332,"103":0.0333,"104":0.00999,"105":0.03663,"106":0.02664,"107":0.03663,"108":0.03996,"109":0.24642,"110":0.02997,"111":0.0333,"112":0.04995,"113":0.04995,"114":0.80919,"115":3.63969,"116":1.89144,"117":0.00666,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00999,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00333,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01665,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00333,"70":0.00333,"71":0.04662,"72":0.04662,"73":0,"74":0,"75":0,"76":0.00333,"77":0.00333,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00333,"95":0.00999,"96":0,"97":0,"98":0,"99":0.00333,"100":0.06327,"101":0.06327,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00333,"107":0.00333,"108":0.00666,"109":0.01998,"110":0.00333,"111":0.00666,"112":0.00333,"113":0.00666,"114":0.03996,"115":0.64602,"116":0.20313},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00333,"9":0,"10":0,"11":0,"12":0,"13":0.00666,"14":0.02331,"15":0.00333,"17":0.00666,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00333,"13.1":0.02331,"14.1":0.04995,"15.1":0.00666,"15.2-15.3":0.00666,"15.4":0.01998,"15.5":0.0333,"15.6":0.1332,"16.0":0.02664,"16.1":0.04329,"16.2":0.03663,"16.3":0.10656,"16.4":0.0333,"16.5":0.33966,"16.6":0.50949},G:{"8":0,"17":0.14299,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00247,"6.0-6.1":0.00493,"7.0-7.1":0.00986,"8.1-8.4":0.0074,"9.0-9.2":0.01233,"9.3":0.07889,"10.0-10.2":0,"10.3":0.07396,"11.0-11.2":0.01479,"11.3-11.4":0.01233,"12.0-12.1":0.01479,"12.2-12.5":0.30076,"13.0-13.1":0.01479,"13.2":0.00493,"13.3":0.03451,"13.4-13.7":0.04191,"14.0-14.4":0.13806,"14.5-14.8":0.2416,"15.0-15.1":0.09368,"15.2-15.3":0.11094,"15.4":0.14052,"15.5":0.17503,"15.6-15.7":1.26222,"16.0":0.78642,"16.1":1.51368,"16.2":0.74205,"16.3":1.39288,"16.4":0.23913,"16.5":4.72593,"16.6":12.30418},P:{"4":0.51089,"20":0.05213,"21":0.13554,"5.0-5.4":0.04171,"6.2-6.4":0.01043,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.01043,"11.1-11.2":0,"12.0":0.01043,"13.0":0.02085,"14.0":0,"15.0":0,"16.0":0.02085,"17.0":0.01043,"18.0":0.01043,"19.0":0.03128},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":27.22694},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.01047,"10":0,"11":0.06279,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":27.69443},R:{_:"0"},M:{"0":0.44689},Q:{"13.1":0.01334},O:{"0":0.54027},H:{"0":0.69462}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00332,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.03985,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01328,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00332,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00996,"103":0.00332,"104":0.00332,"105":0.00664,"106":0.00996,"107":0.00332,"108":0.00332,"109":0.00664,"110":0.00332,"111":0.00664,"112":0.00332,"113":0.00332,"114":0.00332,"115":0.03985,"116":0.02657,"117":0.43173,"118":0.03653,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00664,"35":0,"36":0,"37":0,"38":0.03321,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00664,"48":0.00332,"49":0.00332,"50":0,"51":0,"52":0,"53":0.00664,"54":0,"55":0,"56":0.00332,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00332,"66":0,"67":0.00332,"68":0.00332,"69":0.00332,"70":0,"71":0,"72":0.00332,"73":0.00332,"74":0,"75":0.00332,"76":0.00332,"77":0,"78":0.00664,"79":0.08967,"80":0.00332,"81":0.01993,"83":0.00664,"84":0.00332,"85":0.00996,"86":0.01328,"87":0.04982,"88":0.00332,"89":0.00332,"90":0,"91":0.00332,"92":0.00332,"93":0,"94":0.00664,"95":0.00332,"96":0.00332,"97":0.00332,"98":0.00664,"99":0.02657,"100":0.01328,"101":0.01328,"102":0.00996,"103":0.03321,"104":0.01328,"105":0.03321,"106":0.03653,"107":0.04982,"108":0.07306,"109":0.24575,"110":0.04982,"111":0.03985,"112":0.04982,"113":0.02657,"114":0.57785,"115":0.15609,"116":4.51656,"117":0.97637,"118":0.00664,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00996,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00332,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01661,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00332,"70":0,"71":0.00332,"72":0.0797,"73":0.01661,"74":0.00332,"75":0,"76":0,"77":0.02325,"78":0.00332,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00332,"92":0,"93":0.00332,"94":0.00664,"95":0.00664,"96":0,"97":0,"98":0,"99":0,"100":0.01328,"101":0.05978,"102":0.0631,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00332,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00332,"106":0.00332,"107":0.01328,"108":0.00996,"109":0.01661,"110":0.00664,"111":0.00664,"112":0.00332,"113":0.00332,"114":0.00996,"115":0.02657,"116":0.49483,"117":0.3321},E:{"4":0,"5":0,"6":0,"7":0,"8":0.00332,"9":0,"10":0,"11":0,"12":0,"13":0.00332,"14":0.01993,"15":0.00332,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01661,"14.1":0.04317,"15.1":0.00664,"15.2-15.3":0.00664,"15.4":0.01661,"15.5":0.02989,"15.6":0.12288,"16.0":0.02325,"16.1":0.03653,"16.2":0.02657,"16.3":0.08635,"16.4":0.02325,"16.5":0.09299,"16.6":0.74058,"17.0":0.02989,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00496,"7.0-7.1":0.00992,"8.1-8.4":0.00744,"9.0-9.2":0.00992,"9.3":0.06448,"10.0-10.2":0,"10.3":0.06448,"11.0-11.2":0.01736,"11.3-11.4":0.01488,"12.0-12.1":0.0124,"12.2-12.5":0.26537,"13.0-13.1":0.00992,"13.2":0,"13.3":0.02728,"13.4-13.7":0.03224,"14.0-14.4":0.12152,"14.5-14.8":0.21577,"15.0-15.1":0.12152,"15.2-15.3":0.10664,"15.4":0.10912,"15.5":0.16121,"15.6-15.7":1.17061,"16.0":0.71923,"16.1":1.32189,"16.2":0.63739,"16.3":1.11108,"16.4":0.16617,"16.5":0.61258,"16.6":16.27441,"17.0":1.16813,"17.1":0},P:{"4":0.50563,"20":0.04128,"21":0.10319,"22":3.07503,"5.0-5.4":0.04128,"6.2-6.4":0.01032,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.02064,"11.1-11.2":0,"12.0":0.01032,"13.0":0.02064,"14.0":0,"15.0":0,"16.0":0.02064,"17.0":0.01032,"18.0":0.01032,"19.0":0.03096},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":27.13321},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00588,"9":0.01175,"10":0,"11":0.05876,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":27.83964},R:{_:"0"},M:{"0":0.47421},Q:{"13.1":0.01336},O:{"0":0.52096},H:{"0":0.71453}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SH.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SH.js
index 162e7376a593a5..bc7c8080d11668 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SH.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SH.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":14.29,"110":0,"111":0,"112":0,"113":0,"114":0,"115":28.57,"116":0,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":57.14,"116":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0},P:{"4":0,"20":0,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":0},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":100,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6-15.7":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0,"17.0":0,"17.1":0},P:{"4":0,"20":0,"21":0,"22":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":0},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SI.js
index e2e97f5604ee3d..863d46b8c470e4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00511,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00511,"51":0,"52":0.05109,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00511,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00511,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00511,"78":0.01533,"79":0,"80":0,"81":0,"82":0,"83":0.00511,"84":0,"85":0,"86":0,"87":0,"88":0.00511,"89":0,"90":0,"91":0.00511,"92":0.01022,"93":0,"94":0,"95":0,"96":0.00511,"97":0.00511,"98":0,"99":0.00511,"100":0.01022,"101":0,"102":0.04598,"103":0.01022,"104":0.01533,"105":0,"106":0,"107":0,"108":0.00511,"109":0.01533,"110":0.01533,"111":0.03065,"112":0.01533,"113":0.07153,"114":0.0562,"115":0.95027,"116":2.51363,"117":0.09196,"118":0.00511,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00511,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00511,"49":0.01533,"50":0,"51":0.03576,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00511,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00511,"79":0.01533,"80":0.00511,"81":0.01022,"83":0.00511,"84":0.00511,"85":0.01022,"86":0.00511,"87":0.01022,"88":0.00511,"89":0.00511,"90":0.01533,"91":0.00511,"92":0.01022,"93":0.01022,"94":0.19925,"95":0.00511,"96":0.00511,"97":0,"98":0.01022,"99":0.01533,"100":0.01022,"101":0,"102":0.01022,"103":0.03065,"104":0.00511,"105":0.03065,"106":0.01533,"107":0.02044,"108":0.01022,"109":1.21083,"110":0.01022,"111":0.01533,"112":0.04598,"113":0.04598,"114":0.7919,"115":8.10287,"116":5.109,"117":0.02044,"118":0.00511,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00511,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01022,"47":0,"48":0,"49":0.00511,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.01533,"70":0,"71":0,"72":0.00511,"73":0,"74":0,"75":0,"76":0.01022,"77":0.00511,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00511,"86":0,"87":0,"88":0,"89":0.00511,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01022,"96":0,"97":0,"98":0,"99":0.02044,"100":0.52623,"101":0.45981,"102":0.00511,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00511},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00511,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00511,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00511,"99":0,"100":0,"101":0.00511,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00511,"108":0.01022,"109":0.07664,"110":0.00511,"111":0.00511,"112":0.00511,"113":0.01022,"114":0.07664,"115":2.0998,"116":0.80211},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00511,"10":0,"11":0,"12":0,"13":0.00511,"14":0.02044,"15":0.00511,"17":0.01533,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01022,"10.1":0,"11.1":0,"12.1":0.00511,"13.1":0.04598,"14.1":0.07153,"15.1":0.01022,"15.2-15.3":0.01022,"15.4":0.01533,"15.5":0.02044,"15.6":0.12262,"16.0":0.02555,"16.1":0.12262,"16.2":0.06642,"16.3":0.10218,"16.4":0.04087,"16.5":0.29121,"16.6":0.32698},G:{"8":0,"17":0.21736,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00174,"8.1-8.4":0.00348,"9.0-9.2":0.00174,"9.3":0.01913,"10.0-10.2":0,"10.3":0.01217,"11.0-11.2":0.01565,"11.3-11.4":0.00869,"12.0-12.1":0.01217,"12.2-12.5":0.14433,"13.0-13.1":0.00522,"13.2":0.00174,"13.3":0.00522,"13.4-13.7":0.02608,"14.0-14.4":0.06434,"14.5-14.8":0.21389,"15.0-15.1":0.06956,"15.2-15.3":0.07303,"15.4":0.12346,"15.5":0.10781,"15.6-15.7":0.98596,"16.0":0.95292,"16.1":1.18072,"16.2":0.61036,"16.3":1.25201,"16.4":0.24866,"16.5":3.62909,"16.6":7.38339},P:{"4":0.08123,"20":0.08123,"21":0.31475,"5.0-5.4":0.01015,"6.2-6.4":0,"7.2-7.4":0.02031,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02031,"12.0":0,"13.0":0.02031,"14.0":0.03046,"15.0":0.01015,"16.0":0.01015,"17.0":0.02031,"18.0":0.02031,"19.0":0.05077},I:{"0":0,"3":0,"4":0.00443,"2.1":0,"2.2":0,"2.3":0.00886,"4.1":0.07534,"4.2-4.3":0.01108,"4.4":0,"4.4.3-4.4.4":0.0554},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01022,"9":0,"10":0,"11":0.02555,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":49.42037},R:{_:"0"},M:{"0":0.56247},Q:{"13.1":0},O:{"0":0.11249},H:{"0":0.27783}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.04198,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00525,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00525,"69":0,"70":0,"71":0,"72":0.00525,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.01049,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01049,"89":0,"90":0,"91":0.00525,"92":0.00525,"93":0,"94":0.00525,"95":0,"96":0,"97":0.00525,"98":0,"99":0.00525,"100":0.00525,"101":0,"102":0.07871,"103":0.01049,"104":0.00525,"105":0,"106":0,"107":0.00525,"108":0.01049,"109":0.01049,"110":0.01574,"111":0.03148,"112":0.01574,"113":0.04722,"114":0.03148,"115":0.51421,"116":0.1784,"117":2.94357,"118":0.20988,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00525,"42":0,"43":0,"44":0.00525,"45":0,"46":0,"47":0,"48":0,"49":0.05247,"50":0,"51":0.03148,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01049,"69":0.00525,"70":0.00525,"71":0.00525,"72":0.00525,"73":0,"74":0.01049,"75":0.00525,"76":0.00525,"77":0.00525,"78":0.01049,"79":0.02624,"80":0.01574,"81":0.01049,"83":0.01049,"84":0.00525,"85":0.01574,"86":0.01049,"87":0.01574,"88":0.01574,"89":0.01049,"90":0.02099,"91":0.00525,"92":0.00525,"93":0.00525,"94":0.07346,"95":0.00525,"96":0.00525,"97":0,"98":0.01574,"99":0.02099,"100":0.01049,"101":0.00525,"102":0.00525,"103":0.03148,"104":0.01574,"105":0.03673,"106":0.01574,"107":0.02099,"108":0.02099,"109":1.26453,"110":0.01049,"111":0.01574,"112":0.03673,"113":0.02624,"114":0.1784,"115":0.31482,"116":11.48568,"117":2.8911,"118":0.01574,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01574,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.01049,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.01049,"70":0,"71":0,"72":0.00525,"73":0,"74":0,"75":0,"76":0.00525,"77":0.01574,"78":0.00525,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00525,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01049,"96":0,"97":0,"98":0,"99":0.01574,"100":0.10494,"101":0.43025,"102":0.5247,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00525,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0.00525,"84":0.00525,"85":0.00525,"86":0,"87":0,"88":0,"89":0.00525,"90":0,"91":0,"92":0.00525,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00525,"108":0.00525,"109":0.06296,"110":0.00525,"111":0.00525,"112":0.00525,"113":0.00525,"114":0.02099,"115":0.06296,"116":1.80497,"117":1.34323},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00525,"14":0.02099,"15":0.00525,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.03673,"10.1":0,"11.1":0,"12.1":0.00525,"13.1":0.03148,"14.1":0.08395,"15.1":0.00525,"15.2-15.3":0.00525,"15.4":0.01049,"15.5":0.01574,"15.6":0.11019,"16.0":0.02099,"16.1":0.08395,"16.2":0.06821,"16.3":0.13118,"16.4":0.03148,"16.5":0.14167,"16.6":0.50896,"17.0":0.03673,"17.1":0},G:{"8":0.00174,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00523,"8.1-8.4":0.00523,"9.0-9.2":0.00523,"9.3":0.04529,"10.0-10.2":0,"10.3":0.03484,"11.0-11.2":0.02265,"11.3-11.4":0.01045,"12.0-12.1":0.0209,"12.2-12.5":0.1533,"13.0-13.1":0.00348,"13.2":0.00348,"13.3":0.01219,"13.4-13.7":0.02961,"14.0-14.4":0.0662,"14.5-14.8":0.19685,"15.0-15.1":0.054,"15.2-15.3":0.05575,"15.4":0.10626,"15.5":0.10626,"15.6-15.7":0.94942,"16.0":0.76999,"16.1":1.00168,"16.2":0.62017,"16.3":0.81179,"16.4":0.16549,"16.5":0.52087,"16.6":9.79031,"17.0":1.71592,"17.1":0},P:{"4":0.08162,"20":0.04081,"21":0.18363,"22":3.18299,"5.0-5.4":0.0102,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.0102,"10.1":0,"11.1-11.2":0.0102,"12.0":0,"13.0":0.0204,"14.0":0.05101,"15.0":0.0102,"16.0":0.03061,"17.0":0.0102,"18.0":0.0204,"19.0":0.03061},I:{"0":0,"3":0,"4":0.00652,"2.1":0,"2.2":0.00326,"2.3":0.00652,"4.1":0.03587,"4.2-4.3":0.00978,"4.4":0,"4.4.3-4.4.4":0.08804},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01049,"9":0,"10":0.00525,"11":0.02624,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.02303},R:{_:"0"},M:{"0":0.71295},Q:{"13.1":0},O:{"0":0.10932},H:{"0":0.22049}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SK.js
index 9804743ca6b287..40c4f494da50f2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SK.js
@@ -1 +1 @@
-module.exports={C:{"34":0.00419,"43":0.00838,"50":0.01257,"52":0.07125,"56":0.02515,"68":0.01676,"78":0.02515,"83":0.00419,"87":0.00419,"88":0.00838,"89":0.00838,"99":0.00838,"101":0.00419,"102":0.0922,"103":0.01257,"104":0.00419,"105":0.00419,"106":0.00838,"107":0.00419,"108":0.01676,"109":0.00838,"110":0.00838,"111":0.01676,"112":0.04191,"113":0.02934,"114":0.05867,"115":1.46685,"116":3.29413,"117":0.11735,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 44 45 46 47 48 49 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 84 85 86 90 91 92 93 94 95 96 97 98 100 118 119 120 3.5 3.6"},D:{"34":0.00838,"38":0.0461,"41":0.00419,"47":0.00838,"49":0.03772,"53":0.02515,"63":0.07963,"68":0.01257,"70":0.00838,"72":0.00838,"74":0.01257,"77":0.00419,"78":0.00419,"79":0.48616,"80":0.00838,"81":0.02096,"83":0.01676,"84":0.00838,"85":0.02515,"86":0.01676,"87":0.06706,"88":0.02934,"89":0.01257,"90":0.01676,"91":0.00838,"92":0.01257,"93":0.07963,"94":0.00419,"95":0.00419,"96":0.00838,"97":0.00419,"98":0.01257,"99":0.01257,"100":0.00838,"101":0.00838,"102":0.01676,"103":0.07544,"104":0.00838,"105":0.01676,"106":0.02096,"107":0.02096,"108":0.0461,"109":2.30924,"110":0.02096,"111":0.10478,"112":0.05448,"113":0.1383,"114":0.91783,"115":13.25194,"116":6.96125,"117":0.00838,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 42 43 44 45 46 48 50 51 52 54 55 56 57 58 59 60 61 62 64 65 66 67 69 71 73 75 76 118 119"},F:{"28":0.02096,"36":0.01257,"46":0.05448,"79":0.00419,"85":0.02934,"89":0.00419,"93":0.00419,"94":0.00419,"95":0.15926,"99":0.04191,"100":1.2573,"101":1.28664,"102":0.02096,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 80 81 82 83 84 86 87 88 90 91 92 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.00419,"92":0.00838,"105":0.01257,"107":0.00419,"108":0.00419,"109":0.10478,"110":0.01257,"111":0.00419,"112":0.01257,"113":0.01257,"114":0.25984,"115":3.42824,"116":1.12319,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95 96 97 98 99 100 101 102 103 104 106"},E:{"4":0,"13":0.00419,"14":0.02934,"15":0.00838,"17":0.02096,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1 11.1","9.1":0.01676,"12.1":0.01676,"13.1":0.04191,"14.1":0.05448,"15.1":0.01676,"15.2-15.3":0.00838,"15.4":0.01676,"15.5":0.03353,"15.6":0.17183,"16.0":0.01257,"16.1":0.0461,"16.2":0.05448,"16.3":0.14249,"16.4":0.06706,"16.5":0.47777,"16.6":0.58255},G:{"8":0,"17":0.1587,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00326,"6.0-6.1":0,"7.0-7.1":0.00326,"8.1-8.4":0.00109,"9.0-9.2":0,"9.3":0.00978,"10.0-10.2":0,"10.3":0.05435,"11.0-11.2":0.00435,"11.3-11.4":0.00761,"12.0-12.1":0.00326,"12.2-12.5":0.11522,"13.0-13.1":0.00217,"13.2":0.01196,"13.3":0.00217,"13.4-13.7":0.0163,"14.0-14.4":0.04891,"14.5-14.8":0.11196,"15.0-15.1":0.03804,"15.2-15.3":0.04783,"15.4":0.06087,"15.5":0.09565,"15.6-15.7":0.77066,"16.0":0.36087,"16.1":0.68696,"16.2":0.30544,"16.3":0.62283,"16.4":0.11304,"16.5":2.14241,"16.6":5.062},P:{"4":0.32956,"20":0.06179,"21":0.16478,"5.0-5.4":0.0206,"6.2-6.4":0.0309,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.01043,"11.1-11.2":0,"12.0":0.01043,"13.0":0.0103,"14.0":0,"15.0":0,"16.0":0.0103,"17.0":0.0103,"18.0":0.0103,"19.0":0.04119},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02869,"4.2-4.3":0.01208,"4.4":0,"4.4.3-4.4.4":0.03473},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.00838,"11":0.05867,_:"6 7 9 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":44.31524},R:{_:"0"},M:{"0":0.27298},Q:{"13.1":0},O:{"0":0.03485},H:{"0":0.55536}};
+module.exports={C:{"34":0.00453,"43":0.00905,"51":0.00453,"52":0.0905,"56":0.0181,"61":0.00453,"68":0.0362,"72":0.00453,"78":0.0181,"79":0.00453,"88":0.00905,"91":0.0181,"99":0.01358,"101":0.00453,"102":0.07693,"103":0.00453,"104":0.00453,"105":0.00905,"108":0.02263,"109":0.01358,"110":0.00905,"111":0.01358,"112":0.02715,"113":0.0362,"114":0.04073,"115":0.91405,"116":0.24888,"117":3.80553,"118":0.4163,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 44 45 46 47 48 49 50 53 54 55 57 58 59 60 62 63 64 65 66 67 69 70 71 73 74 75 76 77 80 81 82 83 84 85 86 87 89 90 92 93 94 95 96 97 98 100 106 107 119 120 3.5 3.6"},D:{"34":0.0181,"38":0.04525,"41":0.00905,"47":0.01358,"49":0.0543,"53":0.04073,"63":0.08598,"67":0.00453,"68":0.01358,"70":0.00453,"72":0.00453,"76":0.00453,"77":0.08145,"78":0.00453,"79":0.362,"80":0.00905,"81":0.0181,"83":0.01358,"84":0.00905,"85":0.0543,"86":0.02263,"87":0.06788,"88":0.0362,"89":0.01358,"90":0.02715,"91":0.02263,"92":0.00905,"93":0.08145,"94":0.00905,"96":0.01358,"97":0.00453,"98":0.00905,"99":0.01358,"100":0.00905,"101":0.00905,"102":0.0181,"103":0.06335,"104":0.02715,"105":0.01358,"106":0.0181,"107":0.0362,"108":0.0362,"109":2.52043,"110":0.02263,"111":0.07693,"112":0.0543,"113":0.04073,"114":0.3258,"115":0.5068,"116":17.37148,"117":5.13135,"118":0.00905,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 42 43 44 45 46 48 50 51 52 54 55 56 57 58 59 60 61 62 64 65 66 69 71 73 74 75 95 119 120"},F:{"28":0.0181,"36":0.00905,"46":0.0543,"77":0.00905,"85":0.02263,"93":0.01358,"95":0.19005,"96":0.00905,"98":0.00453,"99":0.01358,"100":0.2896,"101":1.15388,"102":1.3756,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 80 81 82 83 84 86 87 88 89 90 91 92 94 97 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"83":0.00453,"84":0.03168,"92":0.01358,"105":0.01358,"107":0.02715,"108":0.01358,"109":0.11313,"110":0.00905,"112":0.00905,"113":0.00905,"114":0.0543,"115":0.17195,"116":2.2444,"117":2.10413,_:"12 13 14 15 16 17 18 79 80 81 85 86 87 88 89 90 91 93 94 95 96 97 98 99 100 101 102 103 104 106 111"},E:{"4":0,"13":0.00453,"14":0.03168,"15":0.00453,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1 11.1 17.1","9.1":0.00905,"12.1":0.0181,"13.1":0.04073,"14.1":0.07693,"15.1":0.00905,"15.2-15.3":0.00905,"15.4":0.02263,"15.5":0.02715,"15.6":0.15385,"16.0":0.02263,"16.1":0.0543,"16.2":0.06335,"16.3":0.11313,"16.4":0.0543,"16.5":0.24435,"16.6":0.8326,"17.0":0.0905},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00232,"6.0-6.1":0,"7.0-7.1":0.00232,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00927,"10.0-10.2":0,"10.3":0.04056,"11.0-11.2":0.00579,"11.3-11.4":0.00348,"12.0-12.1":0.00464,"12.2-12.5":0.09966,"13.0-13.1":0.00232,"13.2":0.00811,"13.3":0.24568,"13.4-13.7":0.00695,"14.0-14.4":0.09155,"14.5-14.8":0.10662,"15.0-15.1":0.03593,"15.2-15.3":0.04172,"15.4":0.04404,"15.5":0.09039,"15.6-15.7":0.79152,"16.0":0.3129,"16.1":0.62812,"16.2":0.28509,"16.3":0.54931,"16.4":0.08112,"16.5":0.26307,"16.6":6.60451,"17.0":1.0627,"17.1":0.00116},P:{"4":0.40275,"20":0.04131,"21":0.12392,"22":2.29259,"5.0-5.4":0.03098,"6.2-6.4":0.01033,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0.02064,"11.1-11.2":0,"12.0":0.01032,"13.0":0.02065,"14.0":0,"15.0":0,"16.0":0.03098,"17.0":0.01033,"18.0":0.01032,"19.0":0.03098},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01027,"4.2-4.3":0.01643,"4.4":0,"4.4.3-4.4.4":0.05543},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.00905,"11":0.06335,_:"6 7 9 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":40.38643},R:{_:"0"},M:{"0":0.29565},Q:{"13.1":0},O:{"0":0.03285},H:{"0":0.66347}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SL.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SL.js
index 03f5fa94b4f6d6..d226e23dc21005 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SL.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SL.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00175,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00175,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00175,"110":0,"111":0,"112":0,"113":0.00175,"114":0.00175,"115":0.04886,"116":0.06457,"117":0.02443,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00175,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00175,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.01396,"65":0.00175,"66":0,"67":0.00524,"68":0,"69":0,"70":0.00175,"71":0,"72":0.00175,"73":0,"74":0,"75":0.00175,"76":0.01745,"77":0.00175,"78":0,"79":0.00175,"80":0.00175,"81":0.00175,"83":0.00175,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00175,"90":0.00175,"91":0.00349,"92":0.00175,"93":0.00873,"94":0.00524,"95":0,"96":0,"97":0.00175,"98":0,"99":0.00349,"100":0,"101":0,"102":0.00349,"103":0.01396,"104":0,"105":0.00349,"106":0.00175,"107":0.00698,"108":0.00175,"109":0.04537,"110":0.00349,"111":0.00873,"112":0.00524,"113":0.00873,"114":0.04014,"115":0.52176,"116":0.24256,"117":0.00175,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0.00175,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00524,"25":0,"26":0.00175,"27":0.00175,"28":0.00175,"29":0,"30":0.00175,"31":0,"32":0,"33":0.00175,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00175,"43":0,"44":0,"45":0.00175,"46":0.00524,"47":0.00175,"48":0,"49":0,"50":0.00175,"51":0,"52":0,"53":0,"54":0.00524,"55":0,"56":0,"57":0.00349,"58":0.00175,"60":0.07329,"62":0,"63":0.14833,"64":0.21289,"65":0.00698,"66":0.06282,"67":0.06806,"68":0.01222,"69":0.30014,"70":0.15531,"71":0.3839,"72":0.37692,"73":0,"74":0.00349,"75":0,"76":0.00175,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01047,"96":0,"97":0,"98":0,"99":0.00175,"100":0.01745,"101":0.06282,"102":0.00175,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01745},B:{"12":0.00175,"13":0.00349,"14":0.00349,"15":0.00175,"16":0.00175,"17":0,"18":0.00524,"79":0,"80":0,"81":0,"83":0,"84":0.00175,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00175,"91":0,"92":0.00524,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00175,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00349,"108":0,"109":0.00175,"110":0.00175,"111":0,"112":0.00175,"113":0.00524,"114":0.0192,"115":0.18497,"116":0.0698},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.01047,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00175,"12.1":0,"13.1":0.00175,"14.1":0.00175,"15.1":0,"15.2-15.3":0,"15.4":0.00349,"15.5":0,"15.6":0.00873,"16.0":0,"16.1":0.00175,"16.2":0,"16.3":0.00349,"16.4":0.00175,"16.5":0.00524,"16.6":0.01047},G:{"8":0,"17":0.03732,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00873,"7.0-7.1":0.1191,"8.1-8.4":0,"9.0-9.2":0.09448,"9.3":0.06828,"10.0-10.2":0,"10.3":0.08178,"11.0-11.2":0.00953,"11.3-11.4":0.01985,"12.0-12.1":0.01906,"12.2-12.5":0.50259,"13.0-13.1":0.05876,"13.2":0.00238,"13.3":0.02144,"13.4-13.7":0.06272,"14.0-14.4":0.57802,"14.5-14.8":0.33189,"15.0-15.1":0.17944,"15.2-15.3":0.25566,"15.4":0.15165,"15.5":0.4089,"15.6-15.7":1.37915,"16.0":0.18976,"16.1":0.23899,"16.2":0.24614,"16.3":0.62249,"16.4":0.20485,"16.5":0.88371,"16.6":1.16319},P:{"4":0.27952,"20":0.13976,"21":0.17969,"5.0-5.4":0.00998,"6.2-6.4":0.00998,"7.2-7.4":0.09983,"8.2":0,"9.2":0.00998,"10.1":0,"11.1-11.2":0.04991,"12.0":0,"13.0":0.00998,"14.0":0.03993,"15.0":0.02995,"16.0":0.02995,"17.0":0.01997,"18.0":0.02995,"19.0":0.02995},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00233,"4.2-4.3":0.0031,"4.4":0,"4.4.3-4.4.4":0.069},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00349,"5.5":0},S:{"2.5":0.09906,_:"3.0-3.1"},J:{"7":0,"10":0.00826},N:{"10":0,"11":0},L:{"0":65.57415},R:{_:"0"},M:{"0":0.04953},Q:{"13.1":0},O:{"0":0.68517},H:{"0":17.61569}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0116,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00193,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00193,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00193,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.02127,"116":0.0058,"117":0.09283,"118":0.01354,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00193,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00193,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00193,"58":0.00193,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00387,"65":0.0116,"66":0,"67":0,"68":0,"69":0,"70":0.00193,"71":0,"72":0.00193,"73":0,"74":0.00193,"75":0.00193,"76":0.00387,"77":0.00193,"78":0,"79":0.00774,"80":0.00193,"81":0.00193,"83":0.0058,"84":0,"85":0,"86":0,"87":0.00193,"88":0.00193,"89":0,"90":0,"91":0,"92":0.0116,"93":0.01354,"94":0.00193,"95":0.00193,"96":0,"97":0,"98":0,"99":0.0058,"100":0,"101":0,"102":0.00193,"103":0.01741,"104":0.00967,"105":0.0058,"106":0.00193,"107":0.00774,"108":0.00387,"109":0.04255,"110":0.00193,"111":0.00967,"112":0.0058,"113":0.0058,"114":0.01354,"115":0.01547,"116":0.72525,"117":0.16826,"118":0.00193,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0.00193,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00387,"25":0,"26":0.00387,"27":0.00193,"28":0.00193,"29":0,"30":0.0058,"31":0,"32":0.00193,"33":0.00193,"34":0,"35":0,"36":0,"37":0.00387,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00193,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00193,"54":0.0058,"55":0,"56":0.00193,"57":0.00193,"58":0.00387,"60":0.0851,"62":0,"63":0.1083,"64":0.06382,"65":0.0116,"66":0.07543,"67":0.04448,"68":0.0058,"69":0.24368,"70":0.08123,"71":0.205,"72":0.54732,"73":0.16246,"74":0,"75":0,"76":0,"77":0.02514,"78":0,"79":0.00193,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00387,"96":0,"97":0,"98":0.00193,"99":0,"100":0.00193,"101":0.05028,"102":0.05609,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.02127},B:{"12":0.00193,"13":0.00193,"14":0.00193,"15":0.00193,"16":0.00193,"17":0,"18":0.0058,"79":0,"80":0,"81":0,"83":0,"84":0.00193,"85":0,"86":0,"87":0,"88":0,"89":0.00193,"90":0,"91":0,"92":0.0058,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00193,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00387,"110":0.00193,"111":0.00193,"112":0.00967,"113":0.00193,"114":0.00193,"115":0.00774,"116":0.15085,"117":0.1025},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00387,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00774,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00193,"12.1":0,"13.1":0.00193,"14.1":0.00193,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.01547,"16.0":0,"16.1":0.00193,"16.2":0,"16.3":0.0058,"16.4":0.00193,"16.5":0.00193,"16.6":0.02708,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00502,"7.0-7.1":0.08782,"8.1-8.4":0,"9.0-9.2":0.03346,"9.3":0.11543,"10.0-10.2":0,"10.3":0.2066,"11.0-11.2":0,"11.3-11.4":0.01255,"12.0-12.1":0.0184,"12.2-12.5":0.58801,"13.0-13.1":0.03764,"13.2":0.00167,"13.3":0.01422,"13.4-13.7":0.03848,"14.0-14.4":0.36301,"14.5-14.8":0.58299,"15.0-15.1":0.23002,"15.2-15.3":0.61979,"15.4":0.19907,"15.5":0.36552,"15.6-15.7":1.39349,"16.0":0.18903,"16.1":0.18736,"16.2":0.20576,"16.3":0.44665,"16.4":0.0987,"16.5":0.34879,"16.6":1.63103,"17.0":0.2802,"17.1":0},P:{"4":0.32312,"20":0.10097,"21":0.14136,"22":0.3837,"5.0-5.4":0.05049,"6.2-6.4":0,"7.2-7.4":0.10097,"8.2":0,"9.2":0.03029,"10.1":0.02019,"11.1-11.2":0.03029,"12.0":0,"13.0":0.02019,"14.0":0.0101,"15.0":0.0101,"16.0":0.02019,"17.0":0.02019,"18.0":0.06058,"19.0":0.02019},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0027,"4.2-4.3":0.00946,"4.4":0,"4.4.3-4.4.4":0.12072},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00193,"5.5":0},S:{"2.5":0.12099,_:"3.0-3.1"},J:{"7":0,"10":0.00807},N:{"10":0,"11":0},L:{"0":69.80625},R:{_:"0"},M:{"0":0.10486},Q:{"13.1":0},O:{"0":0.70174},H:{"0":13.36364}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SM.js
index 3f387bd079e7a7..c019e9e748ab5f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00635,"53":0,"54":0,"55":0,"56":0.00635,"57":0,"58":0,"59":0,"60":0,"61":0.00635,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.03173,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.03173,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.18403,"103":0,"104":0,"105":0,"106":0,"107":0.01269,"108":0,"109":0.00635,"110":0,"111":0,"112":0.01269,"113":0.10788,"114":0.00635,"115":1.07247,"116":2.79859,"117":0.10788,"118":0.00635,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01904,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00635,"50":0,"51":0,"52":0,"53":0.01269,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00635,"78":0,"79":0.19038,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.02538,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.01904,"99":0.01269,"100":0.00635,"101":0,"102":0,"103":0.01904,"104":0.00635,"105":0.00635,"106":0,"107":0,"108":0,"109":1.47862,"110":0.09519,"111":0.01269,"112":0.01904,"113":0.05077,"114":0.3998,"115":13.2441,"116":9.58246,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00635,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.05711,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.07615,"101":0.05711,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.03173,"110":0,"111":0,"112":0,"113":0.05077,"114":0.06981,"115":4.36605,"116":0.83133},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01269,"14":0.03808,"15":0,"17":0.00635,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.10788,"13.1":0.19038,"14.1":0.15865,"15.1":0.0825,"15.2-15.3":0.01269,"15.4":0.07615,"15.5":0.00635,"15.6":0.39345,"16.0":0.15865,"16.1":0.165,"16.2":0.07615,"16.3":0.41249,"16.4":0.05077,"16.5":1.1867,"16.6":1.08517},G:{"8":0,"17":0.05936,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03355,"10.0-10.2":0,"10.3":0.02065,"11.0-11.2":0.0542,"11.3-11.4":0.00774,"12.0-12.1":0.00774,"12.2-12.5":1.06079,"13.0-13.1":0,"13.2":0.18067,"13.3":0,"13.4-13.7":0.0129,"14.0-14.4":0.35101,"14.5-14.8":0.13679,"15.0-15.1":0.06711,"15.2-15.3":0.36908,"15.4":0.05936,"15.5":0.05162,"15.6-15.7":0.98852,"16.0":0.26584,"16.1":0.65815,"16.2":0.33037,"16.3":0.96271,"16.4":0.10324,"16.5":3.81212,"16.6":16.23185},P:{"4":0.05094,"20":0.02038,"21":0.10188,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.01019,"15.0":0,"16.0":0.01019,"17.0":0,"18.0":0,"19.0":0.01019},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.14692},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":30.60801},R:{_:"0"},M:{"0":0.20462},Q:{"13.1":0},O:{"0":0},H:{"0":0.00346}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00848,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":38.61006,"103":0,"104":0,"105":0.00848,"106":0.00848,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00848,"113":0.01696,"114":0,"115":0.14419,"116":0.05089,"117":1.62854,"118":0.11027,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00848,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00848,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.01696,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00848,"100":0,"101":0,"102":0,"103":0.01696,"104":0,"105":0.01696,"106":0,"107":0.00848,"108":0,"109":0.65311,"110":0.10178,"111":0.00848,"112":0.01696,"113":0.00848,"114":0.02545,"115":0.07634,"116":19.86484,"117":7.59139,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00848,"100":0.00848,"101":0.02545,"102":0.10178,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00848,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.00848,"116":0.40714,"117":0.36473},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00848,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00848,"13.1":0.06786,"14.1":0.19509,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.05937,"15.6":0.0933,"16.0":0,"16.1":0.07634,"16.2":0.05089,"16.3":0.14419,"16.4":0.02545,"16.5":0.2375,"16.6":0.61919,"17.0":0.04241,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.02223,"9.0-9.2":0.00123,"9.3":0.00123,"10.0-10.2":0,"10.3":0.00123,"11.0-11.2":0.01482,"11.3-11.4":0,"12.0-12.1":0.00123,"12.2-12.5":0.27167,"13.0-13.1":0,"13.2":0,"13.3":0.0037,"13.4-13.7":0,"14.0-14.4":0.02099,"14.5-14.8":0.14077,"15.0-15.1":0.29143,"15.2-15.3":0.00494,"15.4":0,"15.5":0.03828,"15.6-15.7":0.51,"16.0":0.13583,"16.1":0.31365,"16.2":0.27908,"16.3":0.18893,"16.4":0.07656,"16.5":0.1383,"16.6":9.07866,"17.0":0.65447,"17.1":0},P:{"4":0,"20":0,"21":0.01015,"22":1.0757,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.01015},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.04},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":13.86015},R:{_:"0"},M:{"0":0.0167},Q:{"13.1":0.00152},O:{"0":0.00304},H:{"0":0.0115}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SN.js
index cfba61474d9b13..4f05196afc81c1 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00421,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00632,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00842,"79":0,"80":0.00421,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00421,"96":0,"97":0,"98":0,"99":0.00211,"100":0,"101":0,"102":0.00211,"103":0.00211,"104":0,"105":0,"106":0.00211,"107":0.00211,"108":0.00211,"109":0,"110":0.00211,"111":0,"112":0.00211,"113":0.00211,"114":0.00211,"115":0.09477,"116":0.18743,"117":0.00632,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00421,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00211,"64":0,"65":0.00211,"66":0,"67":0,"68":0.00211,"69":0,"70":0,"71":0,"72":0.00211,"73":0,"74":0,"75":0.00211,"76":0.00211,"77":0.00211,"78":0,"79":0.00842,"80":0,"81":0.01264,"83":0.00211,"84":0,"85":0.00211,"86":0.00211,"87":0.00842,"88":0.00211,"89":0,"90":0,"91":0.00421,"92":0,"93":0.00842,"94":0,"95":0.00421,"96":0.00211,"97":0.00211,"98":0.00211,"99":0.00421,"100":0,"101":0,"102":0.01474,"103":0.03159,"104":0.00211,"105":0.00842,"106":0.00211,"107":0.00211,"108":0.00421,"109":0.26114,"110":0.00211,"111":0.00632,"112":0.00632,"113":0.01264,"114":0.0716,"115":1.13303,"116":0.7371,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0.00211,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00211,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00211,"60":0.00211,"62":0,"63":0,"64":0.00211,"65":0,"66":0,"67":0.00211,"68":0.00421,"69":0.00211,"70":0,"71":0.01053,"72":0.00632,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00211,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00632,"96":0,"97":0,"98":0,"99":0.00211,"100":0.01895,"101":0.05265,"102":0.00211,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.01474,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00211,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00211,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00211,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00211,"107":0,"108":0.00211,"109":0.00842,"110":0.00211,"111":0.00211,"112":0.00211,"113":0.00211,"114":0.01474,"115":0.38961,"116":0.14953},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00211,"15":0,"17":0.00211,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00842,"14.1":0.00842,"15.1":0.00211,"15.2-15.3":0,"15.4":0,"15.5":0.00211,"15.6":0.01685,"16.0":0.00211,"16.1":0.00211,"16.2":0.00632,"16.3":0.00632,"16.4":0.00421,"16.5":0.02738,"16.6":0.02106},G:{"8":0.00247,"17":0.17276,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01481,"8.1-8.4":0.00247,"9.0-9.2":0.00494,"9.3":0.10119,"10.0-10.2":0,"10.3":0.08145,"11.0-11.2":0.0074,"11.3-11.4":0,"12.0-12.1":0.17523,"12.2-12.5":1.14024,"13.0-13.1":0.01234,"13.2":0.00494,"13.3":0.08391,"13.4-13.7":0.16042,"14.0-14.4":0.79224,"14.5-14.8":1.08101,"15.0-15.1":0.4097,"15.2-15.3":0.348,"15.4":0.2394,"15.5":0.56765,"15.6-15.7":4.32402,"16.0":0.69846,"16.1":1.22662,"16.2":0.65157,"16.3":1.47343,"16.4":0.47387,"16.5":4.00071,"16.6":6.41693},P:{"4":0.30693,"20":0.18416,"21":0.22508,"5.0-5.4":0,"6.2-6.4":0.01023,"7.2-7.4":0.4297,"8.2":0,"9.2":0,"10.1":0.01023,"11.1-11.2":0.04092,"12.0":0.01023,"13.0":0.02046,"14.0":0.04092,"15.0":0.02046,"16.0":0.10231,"17.0":0.04092,"18.0":0.03069,"19.0":0.07162},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00071,"4.2-4.3":0.00377,"4.4":0,"4.4.3-4.4.4":0.06922},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00211,"5.5":0},S:{"2.5":0.01579,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.28015},R:{_:"0"},M:{"0":0.08683},Q:{"13.1":0},O:{"0":0.06315},H:{"0":0.42599}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00235,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00235,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00704,"79":0,"80":0.00469,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00704,"96":0,"97":0,"98":0,"99":0.00235,"100":0,"101":0,"102":0.00235,"103":0,"104":0,"105":0,"106":0,"107":0.00235,"108":0,"109":0,"110":0.00235,"111":0,"112":0.00235,"113":0.00235,"114":0.00235,"115":0.05865,"116":0.01877,"117":0.21583,"118":0.01642,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00469,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00469,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00235,"69":0,"70":0.00235,"71":0,"72":0,"73":0,"74":0,"75":0.00235,"76":0,"77":0,"78":0.00938,"79":0.01173,"80":0.00938,"81":0.01408,"83":0.00235,"84":0,"85":0,"86":0.00469,"87":0.01173,"88":0.00469,"89":0,"90":0,"91":0.00469,"92":0.00235,"93":0.01173,"94":0.00235,"95":0.00704,"96":0,"97":0.00235,"98":0.00469,"99":0.00235,"100":0,"101":0,"102":0.02815,"103":0.04457,"104":0.00469,"105":0.01173,"106":0.00235,"107":0.00469,"108":0.00469,"109":0.30263,"110":0.00704,"111":0.01173,"112":0.01173,"113":0.01642,"114":0.02346,"115":0.04223,"116":1.75246,"117":0.42463,"118":0.00235,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00235,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0.00235,"65":0,"66":0,"67":0.00235,"68":0.00469,"69":0.00235,"70":0,"71":0.00469,"72":0.00938,"73":0.00235,"74":0,"75":0,"76":0,"77":0.00235,"78":0,"79":0.00235,"80":0,"81":0,"82":0.00235,"83":0,"84":0,"85":0.00469,"86":0.00235,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00938,"96":0,"97":0,"98":0,"99":0,"100":0.00938,"101":0.04692,"102":0.06569,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00235,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00235,"16":0,"17":0,"18":0.00469,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00235,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00235,"101":0.00235,"102":0,"103":0,"104":0,"105":0,"106":0.00235,"107":0,"108":0,"109":0.01173,"110":0.00235,"111":0,"112":0.00235,"113":0,"114":0.00704,"115":0.01877,"116":0.37301,"117":0.26275},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00235,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0.00235,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01173,"14.1":0.00938,"15.1":0.00235,"15.2-15.3":0,"15.4":0.00235,"15.5":0,"15.6":0.01642,"16.0":0,"16.1":0.00235,"16.2":0.00469,"16.3":0.00469,"16.4":0.00235,"16.5":0.01877,"16.6":0.03754,"17.0":0.00469,"17.1":0},G:{"8":0.0023,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.04604,"8.1-8.4":0,"9.0-9.2":0.01381,"9.3":0.11281,"10.0-10.2":0,"10.3":0.12432,"11.0-11.2":0.0046,"11.3-11.4":0.0046,"12.0-12.1":0.1082,"12.2-12.5":1.30996,"13.0-13.1":0.01842,"13.2":0.00691,"13.3":0.24403,"13.4-13.7":0.13353,"14.0-14.4":0.8334,"14.5-14.8":1.10737,"15.0-15.1":0.40749,"15.2-15.3":0.33382,"15.4":0.22101,"15.5":0.44893,"15.6-15.7":4.58601,"16.0":0.65843,"16.1":0.84261,"16.2":0.48116,"16.3":1.00837,"16.4":0.36145,"16.5":1.09585,"16.6":6.92276,"17.0":1.30536,"17.1":0},P:{"4":0.33787,"20":0.19453,"21":0.18429,"22":1.38219,"5.0-5.4":0,"6.2-6.4":0.01024,"7.2-7.4":0.60407,"8.2":0,"9.2":0.02048,"10.1":0,"11.1-11.2":0.04095,"12.0":0.01024,"13.0":0.03072,"14.0":0.03072,"15.0":0.02048,"16.0":0.10238,"17.0":0.05119,"18.0":0.05119,"19.0":0.08191},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00101,"4.2-4.3":0.00262,"4.4":0,"4.4.3-4.4.4":0.07564},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0.01531,_:"3.0-3.1"},J:{"7":0,"10":0.00765},N:{"10":0,"11":0.00765},L:{"0":68.26032},R:{_:"0"},M:{"0":0.09185},Q:{"13.1":0},O:{"0":0.05358},H:{"0":0.25362}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SO.js
index d8555e3e3e6240..d5bbd49c87a644 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00424,"67":0,"68":0.00212,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00212,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00212,"107":0,"108":0,"109":0,"110":0.00212,"111":0.00212,"112":0,"113":0.00212,"114":0,"115":0.0318,"116":0.19504,"117":0.0106,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00212,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00212,"57":0,"58":0.00212,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00636,"65":0.00212,"66":0,"67":0,"68":0.00424,"69":0.00212,"70":0.00424,"71":0,"72":0.00212,"73":0.00212,"74":0.00636,"75":0,"76":0,"77":0.00424,"78":0.00212,"79":0.02968,"80":0.00212,"81":0.01484,"83":0.00424,"84":0.00212,"85":0,"86":0,"87":0.06148,"88":0.01696,"89":0,"90":0,"91":0.00212,"92":0,"93":0.12296,"94":0.00212,"95":0.00212,"96":0.01272,"97":0.00424,"98":0.00212,"99":0.02756,"100":0,"101":0.00212,"102":0.00424,"103":0.00848,"104":0.01696,"105":0.00636,"106":0.05088,"107":0.00848,"108":0.01484,"109":0.16324,"110":0.00424,"111":0.0106,"112":0.01484,"113":0.01696,"114":0.15264,"115":1.65148,"116":0.99428,"117":0.00212,"118":0.00212,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00212,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00212,"60":0,"62":0,"63":0.00424,"64":0.00636,"65":0,"66":0,"67":0,"68":0,"69":0.00636,"70":0.01272,"71":0.1272,"72":0.15476,"73":0,"74":0,"75":0,"76":0.00212,"77":0.00212,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00212,"96":0,"97":0,"98":0,"99":0.00636,"100":0.04452,"101":0.053,"102":0.00212,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.0318,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00636,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00212,"107":0.00212,"108":0.00212,"109":0.00424,"110":0.00212,"111":0.00636,"112":0.00212,"113":0.00424,"114":0.053,"115":0.29892,"116":0.1166},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00636,"15":0,"17":0.00212,_:"0","3.1":0,"3.2":0,"5.1":0.00424,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00212,"12.1":0,"13.1":0.00212,"14.1":0.00848,"15.1":0,"15.2-15.3":0.00212,"15.4":0.0106,"15.5":0.00848,"15.6":0.02332,"16.0":0,"16.1":0.00848,"16.2":0.00636,"16.3":0.00848,"16.4":0.00212,"16.5":0.01908,"16.6":0.02544},G:{"8":0,"17":0.19338,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00946,"8.1-8.4":0,"9.0-9.2":0.0021,"9.3":0.06201,"10.0-10.2":0,"10.3":0.01471,"11.0-11.2":0.00525,"11.3-11.4":0.0021,"12.0-12.1":0.03994,"12.2-12.5":0.40567,"13.0-13.1":0.04729,"13.2":0.0021,"13.3":0.03258,"13.4-13.7":0.10299,"14.0-14.4":0.40672,"14.5-14.8":0.39726,"15.0-15.1":0.07147,"15.2-15.3":0.09879,"15.4":0.23226,"15.5":0.20178,"15.6-15.7":1.01417,"16.0":0.57067,"16.1":0.50866,"16.2":0.44035,"16.3":0.64529,"16.4":0.54545,"16.5":2.26166,"16.6":2.18704},P:{"4":0.15179,"20":0.27321,"21":0.52619,"22":1.66964,"5.0-5.4":0.03036,"6.2-6.4":0.08095,"7.2-7.4":0.91071,"8.2":0,"9.2":0.02024,"10.1":0,"11.1-11.2":0.0506,"12.0":0.01012,"13.0":0.03036,"14.0":0.0506,"15.0":0.06071,"16.0":0.14167,"17.0":0.08095,"18.0":0.09107,"19.0":0.41488},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00211,"4.4":0,"4.4.3-4.4.4":0.22605},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00212,"5.5":0},S:{"2.5":0.00788,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.1512},R:{_:"0"},M:{"0":0.06304},Q:{"13.1":0},O:{"0":1.85968},H:{"0":1.90237}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.0023,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.0023,"115":0.00918,"116":0.02066,"117":0.21114,"118":0.02754,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.0023,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00459,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.0023,"61":0,"62":0,"63":0.0023,"64":0.00689,"65":0.00459,"66":0,"67":0,"68":0.00689,"69":0.0023,"70":0.00459,"71":0,"72":0,"73":0.00918,"74":0.00689,"75":0,"76":0,"77":0.00689,"78":0.00459,"79":0.03213,"80":0.0023,"81":0.01148,"83":0.00918,"84":0,"85":0,"86":0.00459,"87":0.05049,"88":0.0459,"89":0,"90":0,"91":0.00459,"92":0.0023,"93":0.08721,"94":0.00459,"95":0.0023,"96":0.01836,"97":0,"98":0.00689,"99":0.02525,"100":0.0023,"101":0,"102":0.0023,"103":0.01377,"104":0.00918,"105":0.01148,"106":0.0459,"107":0.00918,"108":0.02525,"109":0.24098,"110":0.01377,"111":0.01377,"112":0.00918,"113":0.01377,"114":0.07344,"115":0.07803,"116":2.46024,"117":0.71834,"118":0.0023,"119":0.0023,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.0023,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.0023,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00689,"70":0.00689,"71":0.03443,"72":0.16295,"73":0.06656,"74":0,"75":0,"76":0,"77":0.04361,"78":0.00689,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0023,"96":0,"97":0,"98":0,"99":0,"100":0.02525,"101":0.05967,"102":0.06656,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00918,"79":0,"80":0,"81":0,"83":0,"84":0.0023,"85":0,"86":0,"87":0,"88":0,"89":0.0023,"90":0,"91":0,"92":0.00459,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0023,"101":0,"102":0,"103":0,"104":0,"105":0.0023,"106":0,"107":0.0023,"108":0.00459,"109":0.00459,"110":0,"111":0.00689,"112":0.00689,"113":0.0023,"114":0.01836,"115":0.00918,"116":0.24786,"117":0.15836},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00459,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00459,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0023,"14.1":0.00918,"15.1":0,"15.2-15.3":0.0023,"15.4":0,"15.5":0,"15.6":0.03672,"16.0":0,"16.1":0.0023,"16.2":0.0023,"16.3":0.00459,"16.4":0.00459,"16.5":0.01377,"16.6":0.05279,"17.0":0.0023,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00313,"6.0-6.1":0,"7.0-7.1":0.00938,"8.1-8.4":0,"9.0-9.2":0.00104,"9.3":0.09489,"10.0-10.2":0,"10.3":0.0365,"11.0-11.2":0,"11.3-11.4":0.00104,"12.0-12.1":0.01668,"12.2-12.5":0.32221,"13.0-13.1":0.00417,"13.2":0.00209,"13.3":0.01981,"13.4-13.7":0.11887,"14.0-14.4":0.30657,"14.5-14.8":0.45464,"15.0-15.1":0.17518,"15.2-15.3":0.08968,"15.4":0.122,"15.5":0.16893,"15.6-15.7":1.13973,"16.0":0.48488,"16.1":0.38686,"16.2":0.34202,"16.3":0.53493,"16.4":0.36496,"16.5":1.14181,"16.6":3.07091,"17.0":0.91658,"17.1":0},P:{"4":0.11213,"20":0.19368,"21":0.43832,"22":1.88579,"5.0-5.4":0.02039,"6.2-6.4":0.06116,"7.2-7.4":0.65238,"8.2":0,"9.2":0.01019,"10.1":0,"11.1-11.2":0.04077,"12.0":0,"13.0":0.03058,"14.0":0.06116,"15.0":0.03058,"16.0":0.12232,"17.0":0.09174,"18.0":0.09174,"19.0":0.40774},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00602,"4.4":0,"4.4.3-4.4.4":0.27972},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00459,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":73.93231},R:{_:"0"},M:{"0":0.07705},Q:{"13.1":0},O:{"0":2.1497},H:{"0":1.59022}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SR.js
index 395a1a99fbae79..aa635a40e03e13 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00324,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00324,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00324,"106":0,"107":0,"108":0,"109":0.00324,"110":0.01946,"111":0,"112":0,"113":0,"114":0.00649,"115":0.2335,"116":1.13181,"117":0.03567,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00973,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00324,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00324,"77":0,"78":0,"79":0.00649,"80":0,"81":0.00649,"83":0.01297,"84":0,"85":0,"86":0,"87":0.01297,"88":0,"89":0,"90":0,"91":0.00324,"92":0,"93":0.00324,"94":0.00324,"95":0.00324,"96":0,"97":0,"98":0.09405,"99":0.00649,"100":0.00324,"101":0,"102":0.00324,"103":0.04865,"104":0.00324,"105":0.00649,"106":0,"107":0,"108":0.00649,"109":0.347,"110":0.00324,"111":0.01946,"112":0.01622,"113":0.12972,"114":0.22701,"115":3.3338,"116":1.71879,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00324,"72":0.00324,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00324,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00973,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.20107,"101":0.15242,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00324,"18":0.00324,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00324,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00649,"110":0,"111":0.01622,"112":0,"113":0.00324,"114":0.04216,"115":0.77508,"116":0.22052},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01622,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01622,"14.1":0.04216,"15.1":0.00324,"15.2-15.3":0,"15.4":0.01297,"15.5":0.00649,"15.6":0.11999,"16.0":0,"16.1":0.02919,"16.2":0.01622,"16.3":0.01946,"16.4":0.00649,"16.5":0.07459,"16.6":0.18809},G:{"8":0,"17":0.28174,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00411,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.07403,"10.0-10.2":0,"10.3":4.88627,"11.0-11.2":0,"11.3-11.4":0.00823,"12.0-12.1":0,"12.2-12.5":0.24472,"13.0-13.1":0.00617,"13.2":0,"13.3":0.00823,"13.4-13.7":0.01645,"14.0-14.4":0.17892,"14.5-14.8":0.31465,"15.0-15.1":0.01851,"15.2-15.3":0.04113,"15.4":0.07403,"15.5":0.05347,"15.6-15.7":2.42668,"16.0":0.41336,"16.1":0.67659,"16.2":0.6149,"16.3":0.66837,"16.4":0.26735,"16.5":2.81742,"16.6":6.46156},P:{"4":0.49378,"20":0.18517,"21":0.98757,"5.0-5.4":0,"6.2-6.4":0.01029,"7.2-7.4":0.62752,"8.2":0,"9.2":0.01029,"10.1":0,"11.1-11.2":0.04115,"12.0":0.02057,"13.0":0.14402,"14.0":0.06172,"15.0":0.02057,"16.0":0.17488,"17.0":0.18517,"18.0":0.07201,"19.0":0.20574},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.06512,"4.4":0,"4.4.3-4.4.4":0.25324},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.11675,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.75482},R:{_:"0"},M:{"0":0.0946},Q:{"13.1":0.02027},O:{"0":0.32434},H:{"0":0.15353}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00314,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.02201,"111":0.00314,"112":0,"113":0,"114":0,"115":0.30811,"116":0.03458,"117":0.67596,"118":0.02201,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00314,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00314,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00314,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.00314,"77":0,"78":0,"79":0.00629,"80":0,"81":0.00629,"83":0.01572,"84":0,"85":0,"86":0,"87":0.00314,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00314,"94":0,"95":0.00314,"96":0.00314,"97":0.00629,"98":0.00943,"99":0,"100":0,"101":0,"102":0.00314,"103":0.0786,"104":0,"105":0.00314,"106":0,"107":0.00314,"108":0.00314,"109":0.49675,"110":0.00314,"111":0.02201,"112":0.02515,"113":0.04402,"114":0.05345,"115":0.14777,"116":3.93314,"117":0.76085,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01258,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00314,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0283,"101":0.13205,"102":0.09118,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00314,"18":0.00629,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00314,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00314,"105":0,"106":0,"107":0,"108":0,"109":0.01572,"110":0,"111":0.03144,"112":0,"113":0,"114":0.00629,"115":0.01886,"116":0.66338,"117":0.40558},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01258,"15":0.00314,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01886,"14.1":0.0283,"15.1":0,"15.2-15.3":0.00314,"15.4":0.00314,"15.5":0.00314,"15.6":0.07546,"16.0":0.00629,"16.1":0.01258,"16.2":0.00629,"16.3":0.01258,"16.4":0.00943,"16.5":0.04087,"16.6":0.32069,"17.0":0.01572,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00757,"8.1-8.4":0,"9.0-9.2":0.00189,"9.3":0.00757,"10.0-10.2":0,"10.3":3.25972,"11.0-11.2":0.00189,"11.3-11.4":0.00378,"12.0-12.1":0.00189,"12.2-12.5":0.29703,"13.0-13.1":0,"13.2":0,"13.3":0.00757,"13.4-13.7":0.0227,"14.0-14.4":0.09838,"14.5-14.8":0.37838,"15.0-15.1":0.01703,"15.2-15.3":0.02649,"15.4":0.08135,"15.5":0.04919,"15.6-15.7":2.31189,"16.0":0.33108,"16.1":1.43216,"16.2":0.61108,"16.3":0.74351,"16.4":0.12297,"16.5":0.48622,"16.6":7.45972,"17.0":0.96297,"17.1":0},P:{"4":0.47227,"20":0.16427,"21":0.81107,"22":5.11283,"5.0-5.4":0.01027,"6.2-6.4":0.01027,"7.2-7.4":0.63654,"8.2":0,"9.2":0.01027,"10.1":0,"11.1-11.2":0.0308,"12.0":0.01027,"13.0":0.11293,"14.0":0.0616,"15.0":0.01027,"16.0":0.19507,"17.0":0.26693,"18.0":0.07187,"19.0":0.154},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.03041,"4.2-4.3":0.06081,"4.4":0,"4.4.3-4.4.4":0.30406},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.08803,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":59.92431},R:{_:"0"},M:{"0":0.06856},Q:{"13.1":0.04799},O:{"0":0.67189},H:{"0":0.17525}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ST.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ST.js
index 1811c1cdcbd9ae..f26cfde71bdf15 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ST.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ST.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01571,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00524,"69":0,"70":0,"71":0,"72":0.01047,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.05761,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.02619,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01047,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.01047,"113":0,"114":0,"115":0.0419,"116":0.30898,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.0419,"43":0.0419,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00524,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.01047,"64":0.02095,"65":0,"66":0.00524,"67":0,"68":0,"69":0.01047,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.01047,"76":0,"77":0.00524,"78":0,"79":0.15711,"80":0,"81":0.02619,"83":0,"84":0,"85":0,"86":0,"87":0.02095,"88":0,"89":3.43547,"90":0,"91":0,"92":0,"93":0,"94":0.12569,"95":0,"96":0.00524,"97":0,"98":0,"99":0,"100":0.31422,"101":0,"102":0.20948,"103":0.03142,"104":0,"105":0,"106":0.00524,"107":0.05237,"108":0,"109":4.19484,"110":0,"111":0.0419,"112":0.05761,"113":0.05237,"114":0.20948,"115":5.27366,"116":2.89082,"117":0.01571,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0.01047,"67":0,"68":0,"69":0,"70":0.01047,"71":0.02619,"72":0.0995,"73":0,"74":0.01047,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03666,"96":0,"97":0,"98":0,"99":0,"100":0.10998,"101":0.37183,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00524},B:{"12":0.00524,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.02619,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00524,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.01571,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.01047,"108":0,"109":0.0419,"110":0.00524,"111":0,"112":0,"113":0.00524,"114":0.5237,"115":2.33047,"116":0.92695},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00524,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00524,"12.1":0,"13.1":0.01047,"14.1":0.04713,"15.1":0,"15.2-15.3":0.02619,"15.4":0,"15.5":0,"15.6":0.01047,"16.0":0,"16.1":0,"16.2":0,"16.3":0.02619,"16.4":0,"16.5":0.17806,"16.6":0.06284},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.50773,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01042,"10.0-10.2":0,"10.3":0.03056,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.04028,"12.2-12.5":0.25421,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.04098,"14.5-14.8":0.0507,"15.0-15.1":0.01042,"15.2-15.3":0.02084,"15.4":0.09168,"15.5":0,"15.6-15.7":0.78208,"16.0":0.04028,"16.1":0.13197,"16.2":0.80222,"16.3":0.49731,"16.4":0.0507,"16.5":1.38079,"16.6":2.20385},P:{"4":0.07166,"20":0.07166,"21":0.36851,"5.0-5.4":0.02047,"6.2-6.4":0.03071,"7.2-7.4":0.13307,"8.2":0,"9.2":0.13307,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0.02047,"18.0":0,"19.0":0.10237},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.05184,"4.2-4.3":0.11963,"4.4":0,"4.4.3-4.4.4":0.39278},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.07332,"5.5":0},S:{"2.5":0.04763,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":60.89278},R:{_:"0"},M:{"0":0.02382},Q:{"13.1":0},O:{"0":3.41507},H:{"0":0.32467}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0.03859,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.02894,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.08683,"51":0,"52":0.07236,"53":0,"54":0.06754,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00965,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.05306,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.00482,"105":0.00482,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00482,"115":0,"116":0.03859,"117":0.36662,"118":0.00482,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00482,"43":0.01447,"44":0,"45":0,"46":0,"47":0.03859,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.0193,"56":0.00965,"57":0.06754,"58":0.00482,"59":0,"60":0.21226,"61":0.00482,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00482,"69":0,"70":0.00965,"71":0,"72":0,"73":0.02894,"74":0,"75":0,"76":0.00965,"77":0,"78":0,"79":0.14472,"80":0,"81":0.03377,"83":0,"84":0,"85":0,"86":0,"87":0.00965,"88":0.02894,"89":3.80131,"90":0,"91":0,"92":0,"93":0.00965,"94":0.02412,"95":0,"96":0.00482,"97":0,"98":0,"99":0.00482,"100":0.02412,"101":0.0193,"102":0.00965,"103":0.00965,"104":0.00482,"105":0,"106":0,"107":0,"108":0,"109":1.65463,"110":0,"111":0.08683,"112":0.00965,"113":0.00965,"114":0.06754,"115":0.14472,"116":5.63443,"117":1.77523,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00482,"70":0,"71":0,"72":0.04342,"73":0,"74":0.04824,"75":0,"76":0,"77":0,"78":0,"79":0.0193,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02412,"96":0.00965,"97":0.00482,"98":0,"99":0,"100":0.02412,"101":0.05306,"102":0.21226,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.03377,"13":0.08201,"14":0.08201,"15":0.03377,"16":0,"17":0,"18":0.01447,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.02412,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00482,"106":0,"107":0,"108":0,"109":0.07718,"110":0.00965,"111":0.00482,"112":0,"113":0.00482,"114":0.00965,"115":0.03859,"116":1.37484,"117":1.56298},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00482,"14.1":0.00482,"15.1":0.00482,"15.2-15.3":0.09166,"15.4":0,"15.5":0,"15.6":0.00482,"16.0":0,"16.1":0.00965,"16.2":0.00482,"16.3":0.02894,"16.4":0.01447,"16.5":0.0193,"16.6":0.45828,"17.0":0.05306,"17.1":0.02412},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.03202,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.21551,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.0431,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.06465,"13.0-13.1":0.01047,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.01047,"14.5-14.8":0.01047,"15.0-15.1":0.01047,"15.2-15.3":0,"15.4":0.41993,"15.5":0.0862,"15.6-15.7":1.15142,"16.0":0.0431,"16.1":0.0862,"16.2":0.16132,"16.3":0.26907,"16.4":0.0431,"16.5":0.25861,"16.6":2.65873,"17.0":0.23706,"17.1":0},P:{"4":0.14145,"20":0.15156,"21":0.02021,"22":0.71737,"5.0-5.4":0,"6.2-6.4":0.05052,"7.2-7.4":0.22228,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.06062,"12.0":0.0101,"13.0":0.05052,"14.0":0.02021,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.03031},I:{"0":0,"3":0,"4":0.11264,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02816,"4.2-4.3":1.08415,"4.4":0,"4.4.3-4.4.4":1.16863},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.07718,"10":0,"11":0.11095,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.41028},R:{_:"0"},M:{"0":0.08282},Q:{"13.1":0},O:{"0":3.5145},H:{"0":0.18621}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SV.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SV.js
index 2421466d568d07..6a562972e114c9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SV.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SV.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00407,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00407,"52":0.00814,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01221,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.01221,"85":0,"86":0,"87":0,"88":0.00407,"89":0,"90":0,"91":0.01221,"92":0,"93":0,"94":0,"95":0,"96":0.00407,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03664,"103":0.00407,"104":0.0285,"105":0,"106":0,"107":0,"108":0,"109":0.00814,"110":0,"111":0.00407,"112":0.00407,"113":0.00814,"114":0.04478,"115":0.26054,"116":0.71243,"117":0.03257,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00407,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02036,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00814,"66":0,"67":0.00407,"68":0,"69":0.00407,"70":0.00407,"71":0,"72":0,"73":0.00407,"74":0.00407,"75":0.00407,"76":0.00407,"77":0,"78":0.00407,"79":0.06107,"80":0.00407,"81":0.00407,"83":0.00407,"84":0.00407,"85":0,"86":0,"87":0.02036,"88":0.02443,"89":0,"90":0,"91":0.01628,"92":0.00814,"93":0.01628,"94":0.00407,"95":0,"96":0.00407,"97":0.00814,"98":0.00407,"99":0.01221,"100":0.01221,"101":0.00814,"102":0.00814,"103":0.04071,"104":0.00407,"105":0.00407,"106":0.01221,"107":0.01221,"108":0.01628,"109":0.95669,"110":0.01628,"111":0.01628,"112":0.0285,"113":0.07328,"114":0.32975,"115":5.97623,"116":3.90816,"117":0.00407,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00407,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00407,"70":0,"71":0.00814,"72":0.01628,"73":0,"74":0,"75":0,"76":0.00407,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0285,"96":0,"97":0,"98":0,"99":0.00407,"100":0.4071,"101":0.2809,"102":0.00814,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00814,"16":0,"17":0,"18":0.00814,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.02036,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00407,"106":0.01221,"107":0.00407,"108":0,"109":0.01628,"110":0.00407,"111":0.00407,"112":0.00407,"113":0.00407,"114":0.05292,"115":1.10324,"116":0.41524},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00407,"15":0.00407,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00407,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00407,"13.1":0.01628,"14.1":0.01221,"15.1":0,"15.2-15.3":0.00407,"15.4":0.00407,"15.5":0.00407,"15.6":0.03664,"16.0":0.00407,"16.1":0.02036,"16.2":0.00814,"16.3":0.02036,"16.4":0.01221,"16.5":0.08549,"16.6":0.0977},G:{"8":0,"17":0.09022,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00446,"6.0-6.1":0.01671,"7.0-7.1":0.00557,"8.1-8.4":0,"9.0-9.2":0.00111,"9.3":0.01559,"10.0-10.2":0,"10.3":0.02896,"11.0-11.2":0.00334,"11.3-11.4":0.00223,"12.0-12.1":0.00111,"12.2-12.5":0.17486,"13.0-13.1":0.00111,"13.2":0,"13.3":0.00446,"13.4-13.7":0.02562,"14.0-14.4":0.09022,"14.5-14.8":0.12697,"15.0-15.1":0.02339,"15.2-15.3":0.02896,"15.4":0.05903,"15.5":0.07017,"15.6-15.7":0.9378,"16.0":0.21941,"16.1":0.47113,"16.2":0.20828,"16.3":0.6382,"16.4":0.12586,"16.5":2.66305,"16.6":5.09221},P:{"4":0.13143,"20":0.14154,"21":0.26286,"5.0-5.4":0.01011,"6.2-6.4":0,"7.2-7.4":0.31341,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.03033,"12.0":0.01011,"13.0":0.11121,"14.0":0.02022,"15.0":0.03033,"16.0":0.07077,"17.0":0.02022,"18.0":0.03033,"19.0":0.07077},I:{"0":0,"3":0,"4":0.04358,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.02179,"4.4":0,"4.4.3-4.4.4":0.14163},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01628,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.01149},R:{_:"0"},M:{"0":0.26088},Q:{"13.1":0},O:{"0":0.11265},H:{"0":0.32557}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.0044,"52":0.00879,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01319,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00879,"92":0,"93":0,"94":0,"95":0,"96":0.0044,"97":0,"98":0,"99":0,"100":0.0044,"101":0,"102":0.03956,"103":0.01319,"104":0.03516,"105":0,"106":0,"107":0,"108":0.0044,"109":0.00879,"110":0,"111":0.0044,"112":0,"113":0.0044,"114":0.03516,"115":0.1802,"116":0.04835,"117":0.83505,"118":0.07472,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.02198,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.0044,"66":0,"67":0.01758,"68":0,"69":0,"70":0.0044,"71":0,"72":0,"73":0,"74":0.0044,"75":0.0044,"76":0.02198,"77":0.02198,"78":0.00879,"79":0.05274,"80":0.0044,"81":0.00879,"83":0.0044,"84":0.0044,"85":0,"86":0.01319,"87":0.02637,"88":0.00879,"89":0,"90":0.01319,"91":0.01758,"92":0.00879,"93":0.02198,"94":0.00879,"95":0.0044,"96":0.0044,"97":0.00879,"98":0.0044,"99":0.01319,"100":0.01319,"101":0.00879,"102":0.00879,"103":0.06153,"104":0.0044,"105":0.00879,"106":0.02637,"107":0.05274,"108":0.01758,"109":1.0548,"110":0.03956,"111":0.01758,"112":0.02637,"113":0.05274,"114":0.12306,"115":0.19338,"116":9.04052,"117":2.38649,"118":0.0044,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0044,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0044,"70":0,"71":0.0044,"72":0.01758,"73":0.00879,"74":0,"75":0,"76":0,"77":0.02637,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.01319,"95":0.03956,"96":0,"97":0,"98":0,"99":0.0044,"100":0.11867,"101":0.29886,"102":0.33842,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.0044,"15":0.01758,"16":0,"17":0,"18":0.0044,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.0044,"91":0,"92":0.01319,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00879,"107":0.0044,"108":0.0044,"109":0.01758,"110":0.0044,"111":0.0044,"112":0.0044,"113":0.01319,"114":0.02198,"115":0.04835,"116":1.01085,"117":0.81308},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00879,"15":0.0044,_:"0","3.1":0,"3.2":0,"5.1":0.0044,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.0044,"13.1":0.00879,"14.1":0.02637,"15.1":0.0044,"15.2-15.3":0.0044,"15.4":0.0044,"15.5":0.0044,"15.6":0.03956,"16.0":0.0044,"16.1":0.01319,"16.2":0.00879,"16.3":0.02198,"16.4":0.01319,"16.5":0.03516,"16.6":0.19338,"17.0":0.01758,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0101,"6.0-6.1":0.02425,"7.0-7.1":0.00606,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.01414,"10.0-10.2":0,"10.3":0.0202,"11.0-11.2":0.00202,"11.3-11.4":0,"12.0-12.1":0.00202,"12.2-12.5":0.19094,"13.0-13.1":0.00303,"13.2":0,"13.3":0.29297,"13.4-13.7":0.0202,"14.0-14.4":0.10001,"14.5-14.8":0.12022,"15.0-15.1":0.0202,"15.2-15.3":0.03334,"15.4":0.07173,"15.5":0.06365,"15.6-15.7":0.87285,"16.0":0.21518,"16.1":0.35358,"16.2":0.16467,"16.3":0.47279,"16.4":0.09496,"16.5":0.30206,"16.6":5.66544,"17.0":0.82234,"17.1":0.00202},P:{"4":0.09239,"20":0.10266,"21":0.15399,"22":2.03263,"5.0-5.4":0.01027,"6.2-6.4":0,"7.2-7.4":0.11292,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0308,"12.0":0.01027,"13.0":0.11292,"14.0":0.01027,"15.0":0.01027,"16.0":0.05133,"17.0":0.02053,"18.0":0.0308,"19.0":0.08213},I:{"0":0,"3":0,"4":0.06182,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.20092},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00879,"5.5":0},S:{"2.5":0.00561,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.24891},R:{_:"0"},M:{"0":0.25223},Q:{"13.1":0},O:{"0":0.10089},H:{"0":0.42452}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SY.js
index 55dd69f34bbca7..ab40a7432d2800 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01132,"53":0,"54":0,"55":0.00162,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00162,"69":0,"70":0,"71":0,"72":0.00162,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0.00162,"84":0.00162,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00162,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00162,"103":0,"104":0,"105":0.00162,"106":0.00162,"107":0.00162,"108":0.00162,"109":0.00162,"110":0.00162,"111":0.00162,"112":0.00323,"113":0.00485,"114":0.00323,"115":0.09379,"116":0.08894,"117":0.00323,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00323,"39":0,"40":0.00162,"41":0,"42":0,"43":0.00162,"44":0,"45":0,"46":0.00323,"47":0.00162,"48":0,"49":0.00485,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00485,"59":0,"60":0.00162,"61":0,"62":0.00162,"63":0.00162,"64":0.00323,"65":0,"66":0.00162,"67":0,"68":0.00162,"69":0.00323,"70":0.00323,"71":0.00162,"72":0.00162,"73":0,"74":0.00162,"75":0,"76":0.00162,"77":0.00162,"78":0.00162,"79":0.00647,"80":0.00162,"81":0.01617,"83":0.00323,"84":0.00162,"85":0.00162,"86":0.00162,"87":0.00485,"88":0.00323,"89":0.00162,"90":0.00162,"91":0.00323,"92":0.00323,"93":0.00162,"94":0.00162,"95":0.00647,"96":0.00162,"97":0.00162,"98":0.00162,"99":0.00647,"100":0.00323,"101":0.00162,"102":0.00323,"103":0.00485,"104":0.00162,"105":0.00323,"106":0.00485,"107":0.00485,"108":0.00485,"109":0.37029,"110":0.00323,"111":0.00485,"112":0.0097,"113":0.0097,"114":0.06306,"115":0.61446,"116":0.33634,"117":0,"118":0.00162,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00162,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00485,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00162,"60":0.00162,"62":0,"63":0.01132,"64":0,"65":0,"66":0.00162,"67":0,"68":0.00162,"69":0.00323,"70":0.00485,"71":0.02426,"72":0.01132,"73":0.00162,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00162,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00162,"86":0,"87":0,"88":0,"89":0.00162,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01779,"96":0,"97":0,"98":0,"99":0.00162,"100":0.02102,"101":0.03234,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00162},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00323,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00323,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00162,"109":0.0097,"110":0,"111":0.00162,"112":0.00162,"113":0.00162,"114":0.00647,"115":0.12289,"116":0.04043},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00162,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.25387,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00162,"13.1":0,"14.1":0.00323,"15.1":0,"15.2-15.3":0,"15.4":0.00162,"15.5":0.00162,"15.6":0.00323,"16.0":0,"16.1":0.00162,"16.2":0,"16.3":0.00647,"16.4":0.00162,"16.5":0.00809,"16.6":0.00162},G:{"8":0,"17":0.01857,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00301,"5.0-5.1":0.00301,"6.0-6.1":0,"7.0-7.1":0.02811,"8.1-8.4":0,"9.0-9.2":0.00201,"9.3":0.0788,"10.0-10.2":0.00251,"10.3":0.03513,"11.0-11.2":0.00452,"11.3-11.4":0.01907,"12.0-12.1":0.03764,"12.2-12.5":0.393,"13.0-13.1":0.00703,"13.2":0.00251,"13.3":0.02811,"13.4-13.7":0.07428,"14.0-14.4":0.15308,"14.5-14.8":0.28408,"15.0-15.1":0.11745,"15.2-15.3":0.11594,"15.4":0.12698,"15.5":0.13853,"15.6-15.7":0.50443,"16.0":0.25497,"16.1":0.24795,"16.2":0.20277,"16.3":0.41258,"16.4":0.23138,"16.5":0.93909,"16.6":0.5511},P:{"4":1.30142,"20":0.2623,"21":0.50443,"5.0-5.4":0.07062,"6.2-6.4":0.18159,"7.2-7.4":0.24212,"8.2":0.07062,"9.2":0.29257,"10.1":0.0908,"11.1-11.2":0.13115,"12.0":0.06053,"13.0":0.23204,"14.0":0.30266,"15.0":0.08071,"16.0":0.31274,"17.0":0.39345,"18.0":0.13115,"19.0":0.28248},I:{"0":0,"3":0,"4":0.00119,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00597,"4.2-4.3":0.0197,"4.4":0,"4.4.3-4.4.4":0.14032},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00485,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":82.24599},R:{_:"0"},M:{"0":0.08383},Q:{"13.1":0},O:{"0":1.2826},H:{"0":1.38888}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.00154,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00461,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00154,"69":0,"70":0,"71":0,"72":0.00154,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00154,"85":0,"86":0,"87":0,"88":0.00154,"89":0.00154,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00154,"98":0,"99":0.00154,"100":0,"101":0,"102":0.00154,"103":0.00154,"104":0,"105":0.00154,"106":0,"107":0,"108":0,"109":0.00154,"110":0.00154,"111":0,"112":0.00154,"113":0.00307,"114":0.00154,"115":0.0599,"116":0.00768,"117":0.08755,"118":0.00614,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00154,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00307,"39":0,"40":0.00154,"41":0,"42":0,"43":0.00154,"44":0,"45":0,"46":0.00154,"47":0,"48":0,"49":0.00461,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00922,"59":0,"60":0.00154,"61":0,"62":0,"63":0.00154,"64":0,"65":0,"66":0.00154,"67":0,"68":0.00154,"69":0.00154,"70":0.00307,"71":0.00154,"72":0,"73":0.00154,"74":0,"75":0,"76":0,"77":0.00154,"78":0.00154,"79":0.00768,"80":0.00307,"81":0.00768,"83":0.00154,"84":0.00154,"85":0.00154,"86":0.00154,"87":0.00307,"88":0.00307,"89":0.00307,"90":0.00154,"91":0.00154,"92":0.00154,"93":0.00154,"94":0.00154,"95":0.00307,"96":0.00307,"97":0.00154,"98":0.00154,"99":0.00461,"100":0.00154,"101":0,"102":0.00307,"103":0.00307,"104":0.00154,"105":0.00154,"106":0.00307,"107":0.00307,"108":0.00768,"109":0.2857,"110":0.00154,"111":0.00307,"112":0.00461,"113":0.00768,"114":0.01997,"115":0.02304,"116":0.71578,"117":0.16435,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00154,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00307,"48":0,"49":0,"50":0,"51":0.00154,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00154,"60":0.00154,"62":0.00154,"63":0.00461,"64":0.00154,"65":0,"66":0,"67":0,"68":0,"69":0.00307,"70":0.00614,"71":0.00461,"72":0.01843,"73":0.00614,"74":0,"75":0,"76":0,"77":0.00922,"78":0,"79":0.00614,"80":0,"81":0,"82":0,"83":0,"84":0.00154,"85":0.00154,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01382,"96":0,"97":0,"98":0,"99":0,"100":0.00307,"101":0.03379,"102":0.02765,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00154},B:{"12":0.00154,"13":0,"14":0,"15":0,"16":0,"17":0.00154,"18":0.00307,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00614,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00614,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01536,"110":0,"111":0,"112":0,"113":0.00154,"114":0.00307,"115":0.00614,"116":0.09984,"117":0.06912},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00154,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.2089,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00307,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00154,"15.6":0.00461,"16.0":0,"16.1":0.00154,"16.2":0,"16.3":0.00768,"16.4":0.00154,"16.5":0.00307,"16.6":0.00461,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00154,"5.0-5.1":0.00257,"6.0-6.1":0.00051,"7.0-7.1":0.04633,"8.1-8.4":0.00051,"9.0-9.2":0.00257,"9.3":0.07001,"10.0-10.2":0.00154,"10.3":0.02419,"11.0-11.2":0.0036,"11.3-11.4":0.01184,"12.0-12.1":0.02574,"12.2-12.5":0.44784,"13.0-13.1":0.00824,"13.2":0.00206,"13.3":0.05662,"13.4-13.7":0.07721,"14.0-14.4":0.16266,"14.5-14.8":0.26767,"15.0-15.1":0.12097,"15.2-15.3":0.157,"15.4":0.122,"15.5":0.14671,"15.6-15.7":0.52248,"16.0":0.23679,"16.1":0.25944,"16.2":0.18531,"16.3":0.36084,"16.4":0.20436,"16.5":0.47821,"16.6":0.98061,"17.0":0.14516,"17.1":0},P:{"4":1.499,"20":0.19115,"21":0.45272,"22":0.99598,"5.0-5.4":0.06036,"6.2-6.4":0.17103,"7.2-7.4":0.23139,"8.2":0.04024,"9.2":0.21127,"10.1":0.07042,"11.1-11.2":0.12072,"12.0":0.0503,"13.0":0.20121,"14.0":0.26157,"15.0":0.07042,"16.0":0.21127,"17.0":0.35211,"18.0":0.18109,"19.0":0.28169},I:{"0":0,"3":0,"4":0.00215,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00573,"4.2-4.3":0.02149,"4.4":0,"4.4.3-4.4.4":0.1275},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00307,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":83.16762},R:{_:"0"},M:{"0":0.06771},Q:{"13.1":0},O:{"0":1.058},H:{"0":1.25005}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SZ.js
index cc23c08e6b7deb..33eb72f459b276 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/SZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00229,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00229,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00229,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00229,"99":0,"100":0,"101":0,"102":0.00457,"103":0,"104":0,"105":0.00229,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00229,"114":0.00457,"115":0.06855,"116":0.1531,"117":0.00229,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00229,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00229,"56":0.00229,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.01143,"71":0,"72":0,"73":0,"74":0.00229,"75":0,"76":0,"77":0,"78":0.00229,"79":0,"80":0,"81":0.01143,"83":0,"84":0,"85":0,"86":0,"87":0.00229,"88":0.00229,"89":0.00229,"90":0.00229,"91":0.00457,"92":0,"93":0,"94":0,"95":0.07769,"96":0,"97":0,"98":0,"99":0.00457,"100":0,"101":0,"102":0.00229,"103":0.016,"104":0.00457,"105":0,"106":0.00457,"107":0.00457,"108":0.00914,"109":0.2445,"110":0,"111":0.00229,"112":0.00457,"113":0.01828,"114":0.07541,"115":1.17906,"116":0.63752,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0.00229,"24":0.00229,"25":0.00914,"26":0.02514,"27":0,"28":0.01371,"29":0,"30":0.00229,"31":0.00686,"32":0.02742,"33":0,"34":0,"35":0.15081,"36":0.00229,"37":0,"38":0.00914,"39":0,"40":0.00229,"41":0.00229,"42":0,"43":0,"44":0.02057,"45":0.00229,"46":0.00686,"47":0.00229,"48":0,"49":0,"50":0.01828,"51":0.00457,"52":0,"53":0,"54":0.00457,"55":0.00457,"56":0.016,"57":0.00914,"58":0.016,"60":0.04799,"62":0,"63":0.08455,"64":0.02742,"65":0.02742,"66":0.02971,"67":0.04113,"68":0.08683,"69":0.28106,"70":0.21708,"71":0.56897,"72":0.34504,"73":0.00229,"74":0.01828,"75":0.03199,"76":0.03428,"77":0.00686,"78":0,"79":0.00229,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00229,"95":0.04799,"96":0,"97":0,"98":0,"99":0.00229,"100":0.0457,"101":0.06398,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.016},B:{"12":0.00229,"13":0.00229,"14":0,"15":0.00229,"16":0.00229,"17":0,"18":0.00457,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00229,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00229,"108":0.00229,"109":0.00457,"110":0,"111":0.00229,"112":0.00229,"113":0.00457,"114":0.01143,"115":0.44558,"116":0.13482},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00229,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00457,"15.1":0.00229,"15.2-15.3":0,"15.4":0.00457,"15.5":0,"15.6":0.00229,"16.0":0,"16.1":0,"16.2":0,"16.3":0.00914,"16.4":0.00229,"16.5":0.00914,"16.6":0.00914},G:{"8":0,"17":0.02289,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00233,"6.0-6.1":0,"7.0-7.1":0.00427,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00659,"10.0-10.2":0.00194,"10.3":0.01591,"11.0-11.2":0.00155,"11.3-11.4":0,"12.0-12.1":0.00078,"12.2-12.5":0.19746,"13.0-13.1":0,"13.2":0,"13.3":0.00466,"13.4-13.7":0.01009,"14.0-14.4":0.08185,"14.5-14.8":0.08302,"15.0-15.1":0.06129,"15.2-15.3":0.14548,"15.4":0.04461,"15.5":0.02832,"15.6-15.7":0.55087,"16.0":0.24983,"16.1":0.20134,"16.2":0.12375,"16.3":0.46125,"16.4":0.15401,"16.5":0.64785,"16.6":0.77665},P:{"4":0.26322,"20":0.2126,"21":0.68841,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":1.43756,"8.2":0,"9.2":0.01012,"10.1":0.01012,"11.1-11.2":0.10124,"12.0":0,"13.0":0.02025,"14.0":0.03037,"15.0":0.01012,"16.0":0.09111,"17.0":0.02025,"18.0":0.02025,"19.0":0.18223},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00288,"4.4":0,"4.4.3-4.4.4":0.06768},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00229,"5.5":0},S:{"2.5":0.05401,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":68.25065},R:{_:"0"},M:{"0":0.43204},Q:{"13.1":0},O:{"0":0.86408},H:{"0":13.2934}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00208,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00208,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00208,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00208,"103":0,"104":0,"105":0,"106":0.01245,"107":0,"108":0,"109":0.00208,"110":0,"111":0,"112":0,"113":0.00208,"114":0.00208,"115":0.02075,"116":0.01245,"117":0.06433,"118":0.00623,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00208,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00208,"66":0,"67":0,"68":0,"69":0,"70":0.01453,"71":0,"72":0.00208,"73":0,"74":0.00208,"75":0,"76":0,"77":0,"78":0,"79":0.00208,"80":0,"81":0.01038,"83":0.00208,"84":0,"85":0,"86":0.00208,"87":0,"88":0.00208,"89":0.00208,"90":0.00415,"91":0,"92":0,"93":0,"94":0.00208,"95":0.01038,"96":0,"97":0,"98":0,"99":0.01038,"100":0,"101":0,"102":0,"103":0.02283,"104":0.00208,"105":0,"106":0.00623,"107":0.00208,"108":0.0083,"109":0.22825,"110":0,"111":0.00208,"112":0.00208,"113":0.0083,"114":0.0332,"115":0.02075,"116":1.26783,"117":0.249,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00208,"25":0.00623,"26":0.0166,"27":0,"28":0.02075,"29":0,"30":0.00208,"31":0,"32":0.01038,"33":0,"34":0,"35":0.1245,"36":0.00208,"37":0,"38":0.01038,"39":0,"40":0,"41":0.00208,"42":0.00208,"43":0,"44":0.09545,"45":0,"46":0.00208,"47":0.00623,"48":0,"49":0,"50":0.01868,"51":0.00415,"52":0,"53":0,"54":0.00415,"55":0.00208,"56":0.01038,"57":0.00623,"58":0.02075,"60":0.02698,"62":0,"63":0.12865,"64":0.01868,"65":0.01245,"66":0.01245,"67":0.0249,"68":0.0747,"69":0.2656,"70":0.11205,"71":0.16393,"72":0.80718,"73":0.08508,"74":0.00415,"75":0.00208,"76":0.00208,"77":0.03943,"78":0.0083,"79":0.00208,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01038,"96":0,"97":0.00208,"98":0,"99":0,"100":0.00415,"101":0.04358,"102":0.0332,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.01245},B:{"12":0.00415,"13":0,"14":0.00208,"15":0,"16":0,"17":0.00208,"18":0.00415,"79":0,"80":0,"81":0,"83":0,"84":0.00208,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00415,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00208,"110":0.00208,"111":0,"112":0,"113":0.00208,"114":0.0083,"115":0.0166,"116":0.2573,"117":0.11205},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00208,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00208,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00208,"12.1":0,"13.1":0.00208,"14.1":0.00208,"15.1":0,"15.2-15.3":0,"15.4":0.00208,"15.5":0.00208,"15.6":0.00415,"16.0":0,"16.1":0.00208,"16.2":0.00208,"16.3":0.00415,"16.4":0,"16.5":0.00208,"16.6":0.01453,"17.0":0.00208,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00548,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00352,"10.0-10.2":0,"10.3":0.00509,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0.00196,"12.2-12.5":0.17735,"13.0-13.1":0,"13.2":0,"13.3":0.03719,"13.4-13.7":0.01175,"14.0-14.4":0.06969,"14.5-14.8":0.13311,"15.0-15.1":0.04307,"15.2-15.3":0.24665,"15.4":0.04072,"15.5":0.02388,"15.6-15.7":0.35196,"16.0":0.20397,"16.1":0.1429,"16.2":0.166,"16.3":0.36527,"16.4":0.0509,"16.5":0.49407,"16.6":1.21052,"17.0":0.1014,"17.1":0},P:{"4":0.26677,"20":0.06156,"21":0.26677,"22":0.94397,"5.0-5.4":0,"6.2-6.4":0.01026,"7.2-7.4":1.221,"8.2":0,"9.2":0.02052,"10.1":0,"11.1-11.2":0.08208,"12.0":0,"13.0":0.02052,"14.0":0.01026,"15.0":0.03078,"16.0":0.0513,"17.0":0.02052,"18.0":0.01026,"19.0":0.08208},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01296,"4.4":0,"4.4.3-4.4.4":0.05949},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00208,"5.5":0},S:{"2.5":0.05548,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":70.03658},R:{_:"0"},M:{"0":0.1902},Q:{"13.1":0},O:{"0":0.84798},H:{"0":14.19545}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TC.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TC.js
index 4246e3eb078d37..5473c8643bbd92 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TC.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TC.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00477,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.65294,"105":0,"106":0,"107":0,"108":0.00477,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":1.09141,"116":0.37175,"117":0.00477,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.01906,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00477,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.04289,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.05243,"76":0.00477,"77":0,"78":0,"79":0.07626,"80":0,"81":0.00477,"83":0.0286,"84":0,"85":0,"86":0,"87":0.10485,"88":0.00953,"89":0,"90":0,"91":0.00477,"92":0.00477,"93":0.0143,"94":0.00477,"95":0.00477,"96":0,"97":0.01906,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.50996,"104":0,"105":0.00477,"106":0,"107":0,"108":0,"109":0.45754,"110":0.24783,"111":0,"112":0.02383,"113":0.17158,"114":1.51082,"115":6.15291,"116":2.24002,"117":0.0143,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00953,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.02383,"72":0.0143,"73":0,"74":0,"75":0,"76":0.00477,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04289,"96":0,"97":0,"98":0,"99":0,"100":0.10009,"101":0.08102,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.0286,"16":0,"17":0,"18":0.04289,"79":0,"80":0,"81":0,"83":0.00477,"84":0.00477,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00477,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.02383,"110":0.04766,"111":0.00953,"112":0,"113":0.00477,"114":0.12392,"115":3.29331,"116":0.54332},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0143,"15":0.0143,"17":0.00953,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00477,"13.1":0.10962,"14.1":0.06196,"15.1":0.03336,"15.2-15.3":0.06672,"15.4":0.0143,"15.5":0.0143,"15.6":0.30502,"16.0":0.00953,"16.1":0.12392,"16.2":0.09055,"16.3":0.27166,"16.4":0.12392,"16.5":0.59575,"16.6":0.94843},G:{"8":0,"17":0.32215,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.23795,"11.0-11.2":0.01464,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.17938,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.34778,"14.5-14.8":0.26724,"15.0-15.1":0.0842,"15.2-15.3":0.02196,"15.4":0.08054,"15.5":0.29287,"15.6-15.7":1.31058,"16.0":0.57841,"16.1":3.80726,"16.2":1.77184,"16.3":2.2807,"16.4":0.49787,"16.5":8.52973,"16.6":15.97219},P:{"4":0.02091,"20":0.01045,"21":0.12543,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.07317,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.04181,"12.0":0,"13.0":0.1777,"14.0":0.01045,"15.0":0.01045,"16.0":0.02091,"17.0":0.03136,"18.0":0,"19.0":0.04181},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":1.05992},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00477,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":33.82463},R:{_:"0"},M:{"0":1.44982},Q:{"13.1":0},O:{"0":0.05234},H:{"0":0.12884}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00493,"114":0,"115":0.83385,"116":0.00987,"117":0.37005,"118":0.00493,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.0148,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0.0296,"77":0,"78":0,"79":0.06414,"80":0.00493,"81":0,"83":0.02467,"84":0,"85":0,"86":0,"87":0,"88":0.0148,"89":0,"90":0,"91":0,"92":0,"93":0.07894,"94":0.00987,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.12828,"104":0,"105":0.00987,"106":0.00987,"107":0.00493,"108":0,"109":0.31084,"110":0.00493,"111":0,"112":0.03454,"113":0.07894,"114":0.09375,"115":0.53781,"116":7.79079,"117":1.32725,"118":0.0296,"119":0.00987,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.02467,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03454,"96":0,"97":0,"98":0,"99":0,"100":0.0296,"101":0.09868,"102":0.04934,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.0296,"16":0,"17":0,"18":0.08881,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00493,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00493,"109":0.0148,"110":0,"111":0,"112":0.00493,"113":0,"114":0.03947,"115":0.56741,"116":3.62156,"117":2.56568},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00987,"15":0.07894,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.04934,"14.1":0.06414,"15.1":0.00493,"15.2-15.3":0.09868,"15.4":0.13815,"15.5":0.01974,"15.6":0.14802,"16.0":0.00987,"16.1":0.57234,"16.2":0.04441,"16.3":0.37498,"16.4":0.07894,"16.5":0.35525,"16.6":1.91439,"17.0":0.05427,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0.00678,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.20008,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.12548,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.02713,"14.0-14.4":0.078,"14.5-14.8":0.37982,"15.0-15.1":0.04748,"15.2-15.3":0.09156,"15.4":0.05087,"15.5":0.11869,"15.6-15.7":1.0818,"16.0":0.86816,"16.1":3.77106,"16.2":0.80711,"16.3":1.89909,"16.4":0.30182,"16.5":0.72912,"16.6":21.25628,"17.0":1.86857,"17.1":0},P:{"4":0.02097,"20":0.05243,"21":0.02097,"22":2.83107,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.06291,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0.01049,"15.0":0,"16.0":0.01049,"17.0":0.10485,"18.0":0,"19.0":0.04194},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":36.52731},R:{_:"0"},M:{"0":0.43061},Q:{"13.1":0},O:{"0":0.04559},H:{"0":0.07194}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TD.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TD.js
index 68898a1d4a54d3..f1807941875c92 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TD.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TD.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00121,"102":0.00121,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00121,"111":0,"112":0,"113":0,"114":0.00362,"115":0.06146,"116":0.06146,"117":0.00121,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00241,"56":0,"57":0,"58":0,"59":0,"60":0.00121,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00723,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0.00121,"81":0.00241,"83":0,"84":0,"85":0,"86":0.00121,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00482,"95":0,"96":0.00121,"97":0,"98":0.00121,"99":0.01205,"100":0,"101":0.00603,"102":0.00121,"103":0,"104":0,"105":0.00121,"106":0,"107":0,"108":0.00121,"109":0.02169,"110":0,"111":0.00121,"112":0,"113":0.00121,"114":0.01567,"115":0.15183,"116":0.10002,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00241,"62":0,"63":0.00121,"64":0.00121,"65":0.00241,"66":0.00241,"67":0.00482,"68":0.00241,"69":0.04579,"70":0.00482,"71":0.01326,"72":0.01928,"73":0.00121,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00241,"101":0.00844,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00121,"15":0,"16":0,"17":0.00121,"18":0.00241,"79":0,"80":0,"81":0,"83":0,"84":0.00362,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00241,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00362,"110":0.00241,"111":0,"112":0.00121,"113":0.00121,"114":0.01085,"115":0.10966,"116":0.04941},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00482,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00603,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0.00121,"16.6":0},G:{"8":0.00106,"17":0.05217,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.00106,"11.0-11.2":0,"11.3-11.4":0.11552,"12.0-12.1":0.00373,"12.2-12.5":0.38116,"13.0-13.1":0.43174,"13.2":0,"13.3":0.00958,"13.4-13.7":0.00266,"14.0-14.4":0.27416,"14.5-14.8":0.19324,"15.0-15.1":0.11712,"15.2-15.3":0.10807,"15.4":0.27203,"15.5":0.36945,"15.6-15.7":0.45356,"16.0":0.10966,"16.1":0.22252,"16.2":0.13468,"16.3":0.30131,"16.4":0.55205,"16.5":0.6154,"16.6":0.60155},P:{"4":0.10063,"20":0.18114,"21":0.21133,"5.0-5.4":0.01006,"6.2-6.4":0,"7.2-7.4":0.20126,"8.2":0,"9.2":0.07044,"10.1":0,"11.1-11.2":0.10063,"12.0":0,"13.0":0.03019,"14.0":0.03019,"15.0":0.02013,"16.0":0.22139,"17.0":0.04025,"18.0":0.16101,"19.0":0.43271},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.02482},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0.04398,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":88.94835},R:{_:"0"},M:{"0":0.03518},Q:{"13.1":0.01759},O:{"0":0.11434},H:{"0":1.93176}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00245,"94":0,"95":0.00245,"96":0.00245,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00123,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00123,"111":0,"112":0,"113":0,"114":0.0135,"115":0.03068,"116":0.00368,"117":0.0773,"118":0.00614,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00368,"56":0,"57":0,"58":0.00123,"59":0,"60":0.00245,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.00123,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00123,"95":0,"96":0,"97":0,"98":0,"99":0.00614,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00368,"106":0,"107":0,"108":0,"109":0.00982,"110":0,"111":0,"112":0,"113":0,"114":0.00245,"115":0.00614,"116":0.19509,"117":0.07485,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00123,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00123,"62":0,"63":0.00736,"64":0,"65":0,"66":0.03313,"67":0.00491,"68":0,"69":0.02331,"70":0.00123,"71":0.00982,"72":0.00859,"73":0.00491,"74":0.00123,"75":0,"76":0,"77":0.00123,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00368,"102":0.00491,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00491,"14":0,"15":0,"16":0,"17":0.00123,"18":0.00123,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00123,"90":0,"91":0,"92":0.00123,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01227,"110":0,"111":0.00491,"112":0,"113":0.00245,"114":0.00123,"115":0.00368,"116":0.06012,"117":0.04663},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00245,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0.00123,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00122,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00122,"10.0-10.2":0,"10.3":0.00427,"11.0-11.2":0.00061,"11.3-11.4":0.2345,"12.0-12.1":0.01099,"12.2-12.5":0.37251,"13.0-13.1":0.20336,"13.2":0,"13.3":0.00122,"13.4-13.7":0.02015,"14.0-14.4":0.26076,"14.5-14.8":0.18565,"15.0-15.1":0.2516,"15.2-15.3":0.0574,"15.4":0.24183,"15.5":0.36091,"15.6-15.7":0.60396,"16.0":0.1887,"16.1":0.18748,"16.2":0.21618,"16.3":0.44457,"16.4":0.39328,"16.5":0.55755,"16.6":1.0864,"17.0":0.18809,"17.1":0},P:{"4":0.12032,"20":0.21055,"21":0.16042,"22":0.44116,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.2306,"8.2":0,"9.2":0.25066,"10.1":0,"11.1-11.2":0.05013,"12.0":0,"13.0":0.10026,"14.0":0.06016,"15.0":0.01003,"16.0":0.25066,"17.0":0.04011,"18.0":0.09024,"19.0":0.43113},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00062,"4.4":0,"4.4.3-4.4.4":0.01061},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0.07018,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":88.33675},R:{_:"0"},M:{"0":0.14037},Q:{"13.1":0.01755},O:{"0":0.0965},H:{"0":1.50333}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TG.js
index cb8484fbea5b68..5aa19575217fa9 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01516,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00379,"69":0,"70":0,"71":0,"72":0.00379,"73":0.00379,"74":0,"75":0.00379,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00379,"93":0,"94":0,"95":0.00379,"96":0,"97":0.00379,"98":0.00379,"99":0,"100":0.00379,"101":0,"102":0.01895,"103":0.00379,"104":0,"105":0,"106":0.00379,"107":0,"108":0.01516,"109":0.00379,"110":0.00758,"111":0.03789,"112":0.01137,"113":0.03031,"114":0.02273,"115":0.77675,"116":1.12533,"117":0.02652,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00379,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00379,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0.00379,"34":0,"35":0.00379,"36":0,"37":0,"38":0,"39":0,"40":0.01895,"41":0,"42":0.00379,"43":0.00379,"44":0,"45":0,"46":0,"47":0.01516,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00379,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00379,"65":0.00379,"66":0,"67":0,"68":0,"69":0.00379,"70":0.01137,"71":0.00379,"72":0.00379,"73":0,"74":0,"75":0.04926,"76":0.01137,"77":0.00379,"78":0.00758,"79":0.02652,"80":0.00758,"81":0.17429,"83":0,"84":0.00379,"85":0.00379,"86":0.00379,"87":0.01516,"88":0.00379,"89":0.00379,"90":0.00379,"91":0.00758,"92":0,"93":0.04168,"94":0.00379,"95":0.01137,"96":0.09094,"97":0.00379,"98":0.00379,"99":0.00379,"100":0,"101":0,"102":0.12504,"103":0.01895,"104":0.00379,"105":0.00758,"106":0.02273,"107":0.00379,"108":0.0341,"109":1.75052,"110":0.00758,"111":0.00758,"112":0.02273,"113":0.01516,"114":0.11367,"115":2.90237,"116":1.78083,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0.00379,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00379,"37":0.00758,"38":0,"39":0,"40":0,"41":0,"42":0.01516,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.0341,"62":0,"63":0.00758,"64":0.00379,"65":0,"66":0.01137,"67":0.02652,"68":0.00379,"69":0.05305,"70":0.0341,"71":0.36374,"72":0.23113,"73":0,"74":0,"75":0,"76":0.00379,"77":0.00379,"78":0,"79":0.01137,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0.00379,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00379,"93":0,"94":0,"95":0.07957,"96":0,"97":0,"98":0,"99":0.00379,"100":0.11746,"101":0.35238,"102":0.00758,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.00379,"11.5":0,"11.6":0,"12.1":0.00758},B:{"12":0.00758,"13":0,"14":0.00379,"15":0.01137,"16":0,"17":0.00379,"18":0.00758,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00379,"86":0,"87":0,"88":0,"89":0.00379,"90":0,"91":0,"92":0.00758,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00379,"101":0,"102":0,"103":0,"104":0.00379,"105":0,"106":0,"107":0,"108":0,"109":0.03031,"110":0.00379,"111":0,"112":0,"113":0.00379,"114":0.05684,"115":1.2049,"116":0.45089},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.01516,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00379,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.02273,"16.0":0,"16.1":0.00379,"16.2":0,"16.3":0.00379,"16.4":0.00758,"16.5":0.03789,"16.6":0.02652},G:{"8":0.00184,"17":0.08808,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00184,"6.0-6.1":0.10277,"7.0-7.1":0.08625,"8.1-8.4":0,"9.0-9.2":0.02386,"9.3":0.49915,"10.0-10.2":0,"10.3":0.07157,"11.0-11.2":0.01652,"11.3-11.4":0.00459,"12.0-12.1":0.05322,"12.2-12.5":1.73784,"13.0-13.1":0.00184,"13.2":0.01468,"13.3":0.01285,"13.4-13.7":0.23948,"14.0-14.4":0.11469,"14.5-14.8":0.55328,"15.0-15.1":0.10827,"15.2-15.3":0.10827,"15.4":0.03395,"15.5":0.35693,"15.6-15.7":1.85437,"16.0":0.07065,"16.1":0.23306,"16.2":0.14038,"16.3":0.22755,"16.4":0.25233,"16.5":0.8368,"16.6":1.32494},P:{"4":0.07399,"20":0.01057,"21":0.07399,"5.0-5.4":0.01057,"6.2-6.4":0,"7.2-7.4":0.01057,"8.2":0,"9.2":0.01057,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02114,"14.0":0,"15.0":0,"16.0":0.01057,"17.0":0.01057,"18.0":0,"19.0":0.01057},I:{"0":0,"3":0,"4":0.00068,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00339,"4.2-4.3":0.0129,"4.4":0,"4.4.3-4.4.4":0.27396},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01516,"5.5":0},S:{"2.5":0.0559,_:"3.0-3.1"},J:{"7":0,"10":0.00621},N:{"10":0,"11":0},L:{"0":71.0486},R:{_:"0"},M:{"0":0.14906},Q:{"13.1":0.04348},O:{"0":0.44098},H:{"0":3.64571}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00741,"53":0,"54":0,"55":0,"56":0,"57":0.0037,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.0037,"73":0,"74":0,"75":0,"76":0.01482,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01111,"103":0.00741,"104":0,"105":0,"106":0,"107":0,"108":0.00741,"109":0.0037,"110":0.0037,"111":0.05926,"112":0.0037,"113":0.0037,"114":0.01482,"115":0.40374,"116":0.06297,"117":1.10009,"118":0.11112,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0037,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.0037,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.01482,"41":0,"42":0.0037,"43":0.0037,"44":0,"45":0,"46":0,"47":0.0889,"48":0,"49":0.0037,"50":0.0037,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.0037,"64":0,"65":0.0037,"66":0,"67":0,"68":0,"69":0,"70":0.0037,"71":0,"72":0,"73":0.0037,"74":0,"75":0.01852,"76":0.01482,"77":0.0037,"78":0.0037,"79":0.01852,"80":0.00741,"81":0.10371,"83":0,"84":0,"85":0.0037,"86":0.0037,"87":0.0037,"88":0.0037,"89":0,"90":0.00741,"91":0.0037,"92":0.01111,"93":0.05186,"94":0.0037,"95":0.03334,"96":0.00741,"97":0.0037,"98":0,"99":0.0037,"100":0,"101":0.00741,"102":0.02222,"103":0.02222,"104":0.0037,"105":0.01482,"106":0.01111,"107":0.01111,"108":0.02593,"109":1.46678,"110":0.00741,"111":0.00741,"112":0.01111,"113":0.00741,"114":0.03334,"115":0.05926,"116":3.75215,"117":1.03342,"118":0.0037,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.0037,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.01852,"62":0,"63":0.0037,"64":0,"65":0.0037,"66":0.01852,"67":0.01852,"68":0.0037,"69":0.02593,"70":0.01482,"71":0.05556,"72":0.27039,"73":0.07038,"74":0,"75":0,"76":0,"77":0.01482,"78":0.0037,"79":0.00741,"80":0,"81":0,"82":0,"83":0.0037,"84":0,"85":0,"86":0,"87":0.11482,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04074,"96":0,"97":0,"98":0,"99":0,"100":0.02222,"101":0.32595,"102":0.21113,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.0037},B:{"12":0.00741,"13":0,"14":0.0037,"15":0.01111,"16":0,"17":0,"18":0.01111,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.02222,"91":0,"92":0.03704,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.03334,"110":0,"111":0.0037,"112":0.0037,"113":0,"114":0.02593,"115":0.03704,"116":0.88896,"117":0.62227},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.02593,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01111,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.01482,"16.0":0.0037,"16.1":0,"16.2":0,"16.3":0.0037,"16.4":0.01111,"16.5":0.00741,"16.6":0.05926,"17.0":0,"17.1":0},G:{"8":0.00241,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.02251,"7.0-7.1":0.0611,"8.1-8.4":0.09648,"9.0-9.2":0.00161,"9.3":0.09487,"10.0-10.2":0.00161,"10.3":0.04904,"11.0-11.2":0.01045,"11.3-11.4":0.01688,"12.0-12.1":0.07477,"12.2-12.5":1.48338,"13.0-13.1":0.00402,"13.2":0.00322,"13.3":0.0201,"13.4-13.7":0.18251,"14.0-14.4":0.14633,"14.5-14.8":0.27899,"15.0-15.1":0.13588,"15.2-15.3":0.21467,"15.4":0.02653,"15.5":0.19939,"15.6-15.7":1.78327,"16.0":0.04985,"16.1":0.14954,"16.2":0.08201,"16.3":0.13186,"16.4":0.49526,"16.5":0.31758,"16.6":1.50187,"17.0":0.33527,"17.1":0},P:{"4":0.11467,"20":0.01042,"21":0.05212,"22":0.38571,"5.0-5.4":0.01042,"6.2-6.4":0,"7.2-7.4":0.01042,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02085,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01042,"18.0":0.01042,"19.0":0.01042},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00397,"4.2-4.3":0.01589,"4.4":0,"4.4.3-4.4.4":0.61718},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0037,"5.5":0},S:{"2.5":0.01259,_:"3.0-3.1"},J:{"7":0,"10":0.0063},N:{"10":0,"11":0},L:{"0":74.70218},R:{_:"0"},M:{"0":0.06926},Q:{"13.1":0.02518},O:{"0":0.38406},H:{"0":2.34849}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TH.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TH.js
index afad633d976682..6e70a91fc16641 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TH.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TH.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00675,"53":0.00337,"54":0,"55":0.00675,"56":0.0911,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00337,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00337,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00337,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00337,"114":0.00675,"115":0.09785,"116":0.23618,"117":0.00675,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.00337,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.02362,"38":0.00337,"39":0,"40":0,"41":0,"42":0,"43":0.00337,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01012,"50":0,"51":0,"52":0,"53":0.00337,"54":0,"55":0,"56":0.00337,"57":0,"58":0,"59":0,"60":0,"61":0.00337,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00675,"69":0.00337,"70":0.00337,"71":0.00337,"72":0.00337,"73":0.00337,"74":0.01012,"75":0.07085,"76":0,"77":0,"78":0.00337,"79":0.05398,"80":0.00337,"81":0.00337,"83":0.00675,"84":0.00337,"85":0.00675,"86":0.00337,"87":0.0135,"88":0.00675,"89":0.00337,"90":0.00337,"91":0.0135,"92":0.00337,"93":0,"94":0.00337,"95":0.00337,"96":0.00337,"97":0.00337,"98":0.00337,"99":0.02362,"100":0.00337,"101":0.01012,"102":0.00675,"103":0.01687,"104":0.00675,"105":0.01012,"106":0.0135,"107":0.01012,"108":0.0135,"109":0.90761,"110":0.0135,"111":0.0135,"112":0.02024,"113":0.03037,"114":0.17882,"115":3.789,"116":2.38879,"117":0.00337,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00337,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00337,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00337,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00337,"72":0.00337,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00675,"96":0,"97":0,"98":0,"99":0,"100":0.05398,"101":0.06411,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00337,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00337,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00337,"109":0.01687,"110":0.00337,"111":0.00337,"112":0.00337,"113":0.00675,"114":0.03037,"115":0.6613,"116":0.23618},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01012,"15":0.00337,"17":0.01012,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00337,"10.1":0,"11.1":0,"12.1":0.00337,"13.1":0.01012,"14.1":0.03037,"15.1":0.0135,"15.2-15.3":0.00337,"15.4":0.0135,"15.5":0.02024,"15.6":0.06748,"16.0":0.00675,"16.1":0.05398,"16.2":0.03374,"16.3":0.09785,"16.4":0.02699,"16.5":0.2598,"16.6":0.45212},G:{"8":0,"17":0.11179,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00532,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0346,"10.0-10.2":0,"10.3":0.03992,"11.0-11.2":0.00266,"11.3-11.4":0.00798,"12.0-12.1":0.00798,"12.2-12.5":0.38327,"13.0-13.1":0.00798,"13.2":0.14373,"13.3":0.02395,"13.4-13.7":0.04791,"14.0-14.4":0.20494,"14.5-14.8":0.41521,"15.0-15.1":0.13042,"15.2-15.3":0.14373,"15.4":0.173,"15.5":0.26084,"15.6-15.7":2.67756,"16.0":1.23764,"16.1":1.49847,"16.2":0.77984,"16.3":1.75665,"16.4":0.5057,"16.5":5.42431,"16.6":10.56649},P:{"4":0.23986,"20":0.11471,"21":0.30243,"22":1.971,"5.0-5.4":0.02086,"6.2-6.4":0,"7.2-7.4":0.08343,"8.2":0,"9.2":0.01043,"10.1":0,"11.1-11.2":0.03129,"12.0":0,"13.0":0.02086,"14.0":0.02086,"15.0":0.01043,"16.0":0.04171,"17.0":0.04171,"18.0":0.05214,"19.0":0.073},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01405,"4.4":0,"4.4.3-4.4.4":0.0562},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.08772,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.87768},R:{_:"0"},M:{"0":0.09276},Q:{"13.1":0},O:{"0":0.17228},H:{"0":0.22583}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00352,"53":0.00352,"54":0,"55":0.01408,"56":0.21114,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00352,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00352,"103":0,"104":0,"105":0.00352,"106":0.00352,"107":0,"108":0,"109":0,"110":0.00352,"111":0.00352,"112":0,"113":0.00352,"114":0.00352,"115":0.05982,"116":0.0176,"117":0.26744,"118":0.02815,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.00352,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.0176,"38":0.00352,"39":0,"40":0,"41":0.00352,"42":0,"43":0.00352,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01056,"50":0,"51":0,"52":0,"53":0.00704,"54":0,"55":0,"56":0.00352,"57":0,"58":0,"59":0.02463,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01056,"69":0.00352,"70":0.00352,"71":0.00352,"72":0.00352,"73":0.00704,"74":0.00704,"75":0.01408,"76":0,"77":0,"78":0.00352,"79":0.08446,"80":0.00704,"81":0.00352,"83":0.00704,"84":0.00352,"85":0.00704,"86":0.00704,"87":0.02111,"88":0.00704,"89":0.00704,"90":0.00352,"91":0.01408,"92":0.00352,"93":0.00352,"94":0.00352,"95":0.00352,"96":0.00352,"97":0.00352,"98":0.00352,"99":0.02463,"100":0.00352,"101":0.01056,"102":0.01056,"103":0.0176,"104":0.00704,"105":0.01056,"106":0.01408,"107":0.01056,"108":0.0176,"109":0.90086,"110":0.01056,"111":0.0176,"112":0.02111,"113":0.02815,"114":0.05982,"115":0.08094,"116":5.09199,"117":1.41464,"118":0.00352,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00352,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.01408,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00352,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00352,"73":0,"74":0,"75":0,"76":0,"77":0.01056,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00704,"96":0,"97":0,"98":0,"99":0,"100":0.01056,"101":0.04927,"102":0.0563,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00704,"79":0,"80":0,"81":0,"83":0,"84":0.00352,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00352,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01408,"110":0.00352,"111":0.00352,"112":0.00352,"113":0.00352,"114":0.0176,"115":0.01408,"116":0.51026,"117":0.42932},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00352,"14":0.01056,"15":0.00352,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00704,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01056,"14.1":0.03519,"15.1":0.01408,"15.2-15.3":0.00352,"15.4":0.01408,"15.5":0.0176,"15.6":0.07038,"16.0":0.00704,"16.1":0.05279,"16.2":0.02815,"16.3":0.07742,"16.4":0.0176,"16.5":0.22522,"16.6":0.69324,"17.0":0.09501,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00542,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02979,"10.0-10.2":0,"10.3":0.04333,"11.0-11.2":0,"11.3-11.4":0.00542,"12.0-12.1":0.00812,"12.2-12.5":0.42247,"13.0-13.1":0.00812,"13.2":0.20311,"13.3":0.04604,"13.4-13.7":0.04333,"14.0-14.4":0.21124,"14.5-14.8":0.41164,"15.0-15.1":0.12187,"15.2-15.3":0.12999,"15.4":0.15978,"15.5":0.24915,"15.6-15.7":2.69732,"16.0":1.04264,"16.1":1.29991,"16.2":0.65267,"16.3":1.38928,"16.4":0.34935,"16.5":1.13743,"16.6":13.88471,"17.0":2.20173,"17.1":0.00271},P:{"4":0.33116,"20":0.09314,"21":0.19663,"22":2.10078,"5.0-5.4":0.0207,"6.2-6.4":0,"7.2-7.4":0.13453,"8.2":0,"9.2":0.01035,"10.1":0,"11.1-11.2":0.06209,"12.0":0,"13.0":0.0207,"14.0":0.0207,"15.0":0.0207,"16.0":0.04139,"17.0":0.04139,"18.0":0.03105,"19.0":0.08279},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0.0224,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.07279},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.14076,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":56.36807},R:{_:"0"},M:{"0":0.12314},Q:{"13.1":0},O:{"0":0.16851},H:{"0":0.31293}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TJ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TJ.js
index dda29feb6fc2d7..ec75c2c4219c35 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TJ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TJ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.0046,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00691,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.01611,"89":0,"90":0,"91":0.0023,"92":0,"93":0.0023,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00921,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.0023,"112":0,"113":0.0023,"114":0.0023,"115":0.05064,"116":0.07597,"117":0.0023,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0046,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.0023,"45":0,"46":0,"47":0,"48":0,"49":0.02532,"50":0.0023,"51":0,"52":0,"53":0.0023,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.0023,"62":0,"63":0.0023,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.0046,"72":0,"73":0,"74":0.0023,"75":0,"76":0.0023,"77":0,"78":0.0023,"79":0.01381,"80":0,"81":0.0023,"83":0.0023,"84":0,"85":0.0023,"86":0.0023,"87":0.00691,"88":0.0023,"89":0.0046,"90":0.01611,"91":0.01842,"92":0.0046,"93":0.0023,"94":0.0023,"95":0.0023,"96":0.0046,"97":0.0023,"98":0.00921,"99":0.00921,"100":0.0046,"101":0,"102":0.01381,"103":0.01151,"104":0.01381,"105":0.0023,"106":0.14963,"107":0.10819,"108":0.08748,"109":0.60312,"110":0.03453,"111":0.0023,"112":0.04144,"113":0.01842,"114":0.08517,"115":1.00597,"116":0.60543,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0023,"29":0,"30":0,"31":0,"32":0.0023,"33":0.0023,"34":0,"35":0,"36":0,"37":0.00691,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00691,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.0046,"64":0.0046,"65":0,"66":0.0023,"67":0.0023,"68":0,"69":0.01842,"70":0.02532,"71":0.05525,"72":0.03453,"73":0,"74":0.0023,"75":0,"76":0.0023,"77":0.00691,"78":0,"79":0.00921,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.0023,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.05064,"96":0,"97":0.0023,"98":0,"99":0.01381,"100":0.05755,"101":0.1174,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.0023,"16":0.0046,"17":0,"18":0.0023,"79":0,"80":0,"81":0,"83":0,"84":0.0023,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.0023,"91":0,"92":0.00691,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.04834,"110":0.01611,"111":0,"112":0,"113":0,"114":0.01842,"115":0.30617,"116":0.16344},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0023,"14":0.0023,"15":0.0023,"17":0.03913,_:"0","3.1":0,"3.2":0,"5.1":0.08517,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.0023,"15.1":0.0023,"15.2-15.3":0.00921,"15.4":0.0046,"15.5":0,"15.6":0.01381,"16.0":0,"16.1":0.0046,"16.2":0.01842,"16.3":0.06215,"16.4":0.0023,"16.5":0.03453,"16.6":0.01842},G:{"8":0,"17":0.17772,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.0103,"5.0-5.1":0.00129,"6.0-6.1":0.00773,"7.0-7.1":0.00386,"8.1-8.4":0,"9.0-9.2":0.00386,"9.3":0.06568,"10.0-10.2":0,"10.3":0.04379,"11.0-11.2":0.00773,"11.3-11.4":0,"12.0-12.1":0.00515,"12.2-12.5":0.33869,"13.0-13.1":0.00386,"13.2":0.0103,"13.3":0.03348,"13.4-13.7":0.02704,"14.0-14.4":0.16999,"14.5-14.8":0.2537,"15.0-15.1":0.10302,"15.2-15.3":0.26271,"15.4":0.18544,"15.5":0.24211,"15.6-15.7":1.13585,"16.0":0.4224,"16.1":1.56212,"16.2":0.8139,"16.3":1.05858,"16.4":0.67868,"16.5":2.62198,"16.6":2.63229},P:{"4":0.60289,"20":0.23111,"21":0.48231,"5.0-5.4":0.05024,"6.2-6.4":0.10048,"7.2-7.4":0.30144,"8.2":0.01005,"9.2":0.09043,"10.1":0.03014,"11.1-11.2":0.07034,"12.0":0.01005,"13.0":0.08038,"14.0":0.12058,"15.0":0.18087,"16.0":0.21101,"17.0":0.04019,"18.0":0.10048,"19.0":0.2914},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00457,"4.2-4.3":0.016,"4.4":0,"4.4.3-4.4.4":0.06627},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04604,"5.5":0},S:{"2.5":0.03849,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":69.64442},R:{_:"0"},M:{"0":0.10777},Q:{"13.1":0.03849},O:{"0":1.97069},H:{"0":1.55963}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00533,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.04264,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00267,"112":0,"113":0,"114":0,"115":0.04264,"116":0.00533,"117":0.07196,"118":0.00533,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00267,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00533,"45":0,"46":0,"47":0,"48":0,"49":0.02132,"50":0.00267,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00267,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00267,"70":0.00267,"71":0.00533,"72":0,"73":0.00267,"74":0,"75":0,"76":0.00267,"77":0,"78":0,"79":0.01333,"80":0,"81":0.008,"83":0.00267,"84":0,"85":0,"86":0.00267,"87":0.00267,"88":0.00533,"89":0.00267,"90":0.01066,"91":0.00267,"92":0.00267,"93":0,"94":0.00267,"95":0,"96":0.00267,"97":0.45039,"98":0.19988,"99":0.00267,"100":0.008,"101":0,"102":0.00533,"103":0.01066,"104":0,"105":0.09861,"106":0.06929,"107":0.12792,"108":0.09328,"109":0.60762,"110":0.00267,"111":0.02665,"112":0.31714,"113":0.01066,"114":0.02399,"115":0.02399,"116":1.74025,"117":0.26384,"118":0.00267,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00267,"29":0.00267,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00267,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00267,"62":0,"63":0.00267,"64":0.00533,"65":0,"66":0,"67":0.00267,"68":0,"69":0.01866,"70":0.008,"71":0.02399,"72":0.06396,"73":0.01066,"74":0,"75":0,"76":0,"77":0.01333,"78":0,"79":0.008,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.03731,"96":0,"97":0,"98":0,"99":0.00267,"100":0.00533,"101":0.0613,"102":0.07462,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.00267,"17":0,"18":0.00533,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00267,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.18122,"106":0,"107":0,"108":0,"109":0.00533,"110":0.01866,"111":0,"112":0.00267,"113":0.00267,"114":0.01333,"115":0.01066,"116":0.14391,"117":0.09061},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01066,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.06663,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0.00533,"15.1":0,"15.2-15.3":0.008,"15.4":0.00267,"15.5":0.00267,"15.6":0.01066,"16.0":0,"16.1":0.00267,"16.2":0.00267,"16.3":0.03198,"16.4":0.00267,"16.5":0.01066,"16.6":0.09061,"17.0":0.02932,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00404,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00538,"9.3":0.04576,"10.0-10.2":0,"10.3":0.02423,"11.0-11.2":0.01077,"11.3-11.4":0.00808,"12.0-12.1":0.02692,"12.2-12.5":0.34323,"13.0-13.1":0.00404,"13.2":0.00269,"13.3":2.95181,"13.4-13.7":0.03096,"14.0-14.4":0.15345,"14.5-14.8":0.19248,"15.0-15.1":0.1171,"15.2-15.3":0.1696,"15.4":0.09691,"15.5":0.19383,"15.6-15.7":1.09835,"16.0":0.51149,"16.1":0.97182,"16.2":0.53841,"16.3":0.64339,"16.4":0.80761,"16.5":0.77261,"16.6":3.04468,"17.0":0.65147,"17.1":0},P:{"4":0.33691,"20":0.28586,"21":0.35732,"22":1.06176,"5.0-5.4":0.05105,"6.2-6.4":0.09188,"7.2-7.4":0.33691,"8.2":0,"9.2":0.06126,"10.1":0.01021,"11.1-11.2":0.06126,"12.0":0.03063,"13.0":0.04084,"14.0":0.06126,"15.0":0.38795,"16.0":0.25523,"17.0":0.05105,"18.0":0.2246,"19.0":0.30628},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01003,"4.2-4.3":0.01505,"4.4":0,"4.4.3-4.4.4":0.08025},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02932,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":69.30356},R:{_:"0"},M:{"0":0.04401},Q:{"13.1":0.02201},O:{"0":1.3203},H:{"0":1.32636}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TK.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TK.js
index dff7f9b2324e13..999618153e1523 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TK.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TK.js
@@ -1 +1 @@
-module.exports={C:{"116":0.32379,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 117 118 119 120 3.5 3.6"},D:{"100":0.97136,"113":0.32379,"115":8.41394,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 101 102 103 104 105 106 107 108 109 110 111 112 114 116 117 118 119"},F:{_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"116":0.32379,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 17 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 14.1 15.5 15.6 16.0 16.1 16.3 16.4 16.6","15.1":2.58805,"15.2-15.3":3.23562,"15.4":0.32379,"16.2":0.32379,"16.5":0.97136},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":22.23937,"15.2-15.3":8.06398,"15.4":0,"15.5":0.64299,"15.6-15.7":0,"16.0":0,"16.1":0.96744,"16.2":0,"16.3":4.83721,"16.4":0.64299,"16.5":3.22087,"16.6":18.3755},P:{"4":0.07399,"20":0.01057,"21":0.98054,"5.0-5.4":0.01057,"6.2-6.4":0,"7.2-7.4":0.01057,"8.2":0,"9.2":0.01057,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02114,"14.0":0,"15.0":0,"16.0":0.98054,"17.0":0.01057,"18.0":0,"19.0":0.01057},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{_:"6 7 8 9 10 11 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":16.38837},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 3.5 3.6"},D:{"91":0.71912,"117":4.31719,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 83 84 85 86 87 88 89 90 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 118 119 120"},F:{_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"116":1.43825,_:"12 13 14 15 16 17 18 79 80 81 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 117"},E:{"4":0,_:"0 5 6 7 8 9 10 11 12 13 14 15 3.1 3.2 5.1 6.1 7.1 9.1 10.1 11.1 12.1 13.1 14.1 15.4 15.5 15.6 16.0 16.1 16.2 16.3 16.4 16.5 17.0 17.1","15.1":2.15737,"15.2-15.3":11.51088,"16.6":0.71912},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0.70962,"15.2-15.3":8.51107,"15.4":0,"15.5":0,"15.6-15.7":0,"16.0":0,"16.1":2.12885,"16.2":0,"16.3":0,"16.4":0,"16.5":1.41923,"16.6":21.27985,"17.0":9.22069,"17.1":0},P:{"4":0.11467,"20":0.01042,"21":0.73274,"22":2.93095,"5.0-5.4":0.01042,"6.2-6.4":0,"7.2-7.4":0.01042,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02085,"14.0":0,"15.0":0,"16.0":0,"17.0":0.01042,"18.0":0.01042,"19.0":0.01042},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{_:"6 7 8 9 10 11 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":28.59944},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TL.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TL.js
index 1fb8aaed9a33e4..ec61eaf51d58c6 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TL.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TL.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00437,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.03062,"37":0.00875,"38":0,"39":0.01312,"40":0.00437,"41":0.01312,"42":0,"43":0.01312,"44":0.01312,"45":0,"46":0,"47":0.00437,"48":0.03062,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.02624,"57":0.00437,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.03499,"68":0.00437,"69":0,"70":0,"71":0,"72":0.0175,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02187,"79":0.13559,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00875,"90":0,"91":0.00437,"92":0,"93":0.00437,"94":0,"95":0.03062,"96":0,"97":0,"98":0,"99":0.00875,"100":0.00875,"101":0.00437,"102":0.03499,"103":0.00437,"104":0.00437,"105":0.00875,"106":0.00875,"107":0.00437,"108":0.00437,"109":0.00875,"110":0.00437,"111":0.00875,"112":0.02187,"113":0.23182,"114":0.07436,"115":1.29908,"116":1.26409,"117":0.08748,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00437,"29":0,"30":0,"31":0,"32":0,"33":0.00437,"34":0.00437,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0.00875,"43":0.01312,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00875,"50":0.00437,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.06561,"59":0,"60":0,"61":0.00437,"62":0.00437,"63":0.01312,"64":0.00437,"65":0.00875,"66":0,"67":0.00437,"68":0.03499,"69":0,"70":0.00437,"71":0,"72":0.00437,"73":0,"74":0.0175,"75":0,"76":0,"77":0,"78":0.00437,"79":0,"80":0.02187,"81":0.00437,"83":0.01312,"84":0.00437,"85":0.01312,"86":0.00437,"87":0.05249,"88":0.00437,"89":0.00437,"90":0,"91":0.00437,"92":0.00437,"93":0.00437,"94":0,"95":0.00875,"96":0,"97":0.00437,"98":0.00437,"99":0.01312,"100":0.00875,"101":0.00437,"102":0.02624,"103":0.08311,"104":0.00437,"105":0.00875,"106":0.01312,"107":0.01312,"108":0.00875,"109":1.2947,"110":0.0175,"111":0.03937,"112":0.03499,"113":0.06561,"114":0.50301,"115":5.57685,"116":2.75125,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.04374,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00437,"55":0,"56":0.01312,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0.00875,"65":0,"66":0.00437,"67":0.00437,"68":0,"69":0.01312,"70":0.0175,"71":0.08748,"72":0.03062,"73":0,"74":0.00437,"75":0.01312,"76":0.00437,"77":0,"78":0,"79":0.00437,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00437,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.04374,"96":0,"97":0,"98":0,"99":0.00875,"100":0.05686,"101":0.17059,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00437},B:{"12":0.02187,"13":0.00875,"14":0.00437,"15":0.00875,"16":0.00437,"17":0.0175,"18":0.02624,"79":0,"80":0,"81":0,"83":0,"84":0.00437,"85":0.00437,"86":0,"87":0,"88":0,"89":0,"90":0.00875,"91":0,"92":0.02187,"93":0,"94":0,"95":0,"96":0.00437,"97":0,"98":0.00437,"99":0,"100":0.02624,"101":0.00437,"102":0,"103":0.00437,"104":0,"105":0.01312,"106":0.00437,"107":0.00875,"108":0.02624,"109":0.06998,"110":0.01312,"111":0.05686,"112":0.0175,"113":0.02624,"114":0.25807,"115":2.15638,"116":0.40241},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00875,"12":0,"13":0.00437,"14":0.00875,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00437,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00875,"12.1":0.00875,"13.1":0.03937,"14.1":0.03937,"15.1":0.03937,"15.2-15.3":0.02187,"15.4":0.02187,"15.5":0.00437,"15.6":0.05686,"16.0":0,"16.1":0.00437,"16.2":0.01312,"16.3":0.04374,"16.4":0.0175,"16.5":0.06124,"16.6":0.03499},G:{"8":0,"17":0.01843,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00388,"9.3":0.01455,"10.0-10.2":0,"10.3":0.01067,"11.0-11.2":0.00873,"11.3-11.4":0.00679,"12.0-12.1":0.01746,"12.2-12.5":0.45504,"13.0-13.1":0.03396,"13.2":0.00291,"13.3":0.04851,"13.4-13.7":0.12225,"14.0-14.4":0.38906,"14.5-14.8":1.49124,"15.0-15.1":0.1989,"15.2-15.3":0.20666,"15.4":0.11061,"15.5":0.22606,"15.6-15.7":0.78103,"16.0":0.20957,"16.1":0.49967,"16.2":0.35219,"16.3":1.23607,"16.4":1.13905,"16.5":0.82372,"16.6":1.29525},P:{"4":0.05953,"20":0.0893,"21":0.1786,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.11907,"8.2":0,"9.2":0.01984,"10.1":0,"11.1-11.2":0.03969,"12.0":0,"13.0":0.00992,"14.0":0.03969,"15.0":0.01984,"16.0":0.07938,"17.0":0.00992,"18.0":0.04961,"19.0":0.09922},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00631,"4.4":0,"4.4.3-4.4.4":0.03994},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02187,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.91799},R:{_:"0"},M:{"0":0.09002},Q:{"13.1":0.04501},O:{"0":0.52884},H:{"0":0.78297}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00383,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00383,"37":0.01532,"38":0.00766,"39":0,"40":0.01149,"41":0.00383,"42":0,"43":0,"44":0.01149,"45":0,"46":0,"47":0.01149,"48":0.01532,"49":0,"50":0,"51":0,"52":0.00383,"53":0,"54":0,"55":0,"56":0.01532,"57":0.00383,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00766,"64":0,"65":0.00383,"66":0,"67":0.00766,"68":0,"69":0,"70":0,"71":0,"72":0.00766,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.02298,"79":0.10341,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00383,"86":0,"87":0,"88":0.00383,"89":0,"90":0,"91":0,"92":0.00766,"93":0.00383,"94":0,"95":0.03064,"96":0.00383,"97":0,"98":0,"99":0.00766,"100":0.00383,"101":0.00383,"102":0.03447,"103":0.00383,"104":0,"105":0.01149,"106":0.01149,"107":0.01915,"108":0.00383,"109":0.00383,"110":0.00383,"111":0.00766,"112":0.01532,"113":0.11873,"114":0.02681,"115":0.54003,"116":0.19916,"117":1.12602,"118":0.15703,"119":0.00766,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00383,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0.00383,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00383,"41":0,"42":0,"43":0.00766,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00383,"54":0,"55":0,"56":0,"57":0,"58":0.02298,"59":0.00383,"60":0,"61":0.00766,"62":0.00383,"63":0,"64":0,"65":0.00766,"66":0,"67":0.00383,"68":0.01532,"69":0,"70":0.00383,"71":0,"72":0.00383,"73":0,"74":0.00766,"75":0,"76":0,"77":0,"78":0.00383,"79":0.00766,"80":0.01915,"81":0,"83":0,"84":0.00383,"85":0.00766,"86":0.00383,"87":0.0383,"88":0.01149,"89":0,"90":0.00766,"91":0.00383,"92":0,"93":0,"94":0,"95":0.00766,"96":0,"97":0.01149,"98":0.00383,"99":0.00383,"100":0.00766,"101":0.01915,"102":0.00383,"103":0.04213,"104":0.00766,"105":0.00383,"106":0,"107":0.14554,"108":0.00766,"109":0.76217,"110":0.01149,"111":0.01915,"112":0.01915,"113":0.03064,"114":0.17235,"115":0.22597,"116":5.46924,"117":1.03793,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.06128,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00383,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00383,"64":0.00766,"65":0,"66":0,"67":0,"68":0.00383,"69":0.00383,"70":0.01532,"71":0.03064,"72":0.05362,"73":0.01532,"74":0,"75":0,"76":0,"77":0.00383,"78":0.00383,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01915,"96":0,"97":0,"98":0.00383,"99":0.00383,"100":0.00383,"101":0.1532,"102":0.10724,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00383},B:{"12":0.01532,"13":0.00383,"14":0.00766,"15":0.00766,"16":0.01149,"17":0.00766,"18":0.03447,"79":0,"80":0,"81":0,"83":0,"84":0.00766,"85":0.00383,"86":0,"87":0,"88":0,"89":0.00383,"90":0.01149,"91":0,"92":0.01532,"93":0,"94":0,"95":0,"96":0.00383,"97":0.00383,"98":0,"99":0,"100":0.01532,"101":0,"102":0,"103":0.00766,"104":0.00766,"105":0.00383,"106":0,"107":0,"108":0.02298,"109":0.01532,"110":0.00766,"111":0.02681,"112":0.01149,"113":0.02298,"114":0.10724,"115":0.22214,"116":1.17198,"117":0.59365},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01149,"12":0,"13":0.00383,"14":0.01532,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00383,"13.1":0.02681,"14.1":0.04213,"15.1":0.01532,"15.2-15.3":0.04979,"15.4":0.01532,"15.5":0.00383,"15.6":0.03447,"16.0":0,"16.1":0.01149,"16.2":0.02298,"16.3":0.03064,"16.4":0.01149,"16.5":0.03447,"16.6":0.02681,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.013,"10.0-10.2":0,"10.3":0.00928,"11.0-11.2":0.00093,"11.3-11.4":0,"12.0-12.1":0.00743,"12.2-12.5":0.68049,"13.0-13.1":0.01764,"13.2":0.0065,"13.3":0.02507,"13.4-13.7":0.1309,"14.0-14.4":0.50596,"14.5-14.8":1.17623,"15.0-15.1":0.17639,"15.2-15.3":0.17546,"15.4":0.20238,"15.5":0.36949,"15.6-15.7":0.7464,"16.0":0.22652,"16.1":0.42519,"16.2":0.28965,"16.3":0.82902,"16.4":0.71576,"16.5":0.51153,"16.6":1.69425,"17.0":0.13833,"17.1":0},P:{"4":0.0609,"20":0.10149,"21":0.13194,"22":0.43642,"5.0-5.4":0.13194,"6.2-6.4":0.01015,"7.2-7.4":0.14209,"8.2":0,"9.2":0.01015,"10.1":0,"11.1-11.2":0.03045,"12.0":0,"13.0":0.0203,"14.0":0.03045,"15.0":0.0203,"16.0":0.11164,"17.0":0.03045,"18.0":0.03045,"19.0":0.10149},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.05915},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0.00383,"10":0,"11":0.04979,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":71.80678},R:{_:"0"},M:{"0":0.12957},Q:{"13.1":0.00617},O:{"0":0.77742},H:{"0":1.19164}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TM.js
index 69e1b21f3a01d2..04abe813758d9e 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.0093,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.0031,"67":0,"68":0.0217,"69":0.0031,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.0062,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.3348,"92":0.0031,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.0031,"115":0.0124,"116":0.0248,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.0093,"51":0,"52":0.0062,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.0031,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.0062,"70":0,"71":0.0062,"72":0,"73":0.0031,"74":0,"75":0,"76":0,"77":0.0062,"78":0,"79":0.0031,"80":0.0124,"81":0.0341,"83":0.0062,"84":0,"85":0,"86":0.0093,"87":0.0062,"88":0.0031,"89":0.0031,"90":0.0031,"91":0.0031,"92":0,"93":0,"94":0,"95":0.0031,"96":0.0062,"97":0.0031,"98":0.0031,"99":0.0279,"100":0.0341,"101":0.0031,"102":0.0682,"103":0.0031,"104":0,"105":0.0062,"106":0.0372,"107":0.0992,"108":0.0465,"109":1.6988,"110":0.0031,"111":0,"112":0.0248,"113":0.0062,"114":0.1178,"115":2.6071,"116":2.3715,"117":0.0403,"118":0.0186,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0.0031,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.0155,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0.0062,"67":0,"68":0.0062,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.0031,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.0155,"91":0,"92":0.0031,"93":0.0155,"94":0,"95":0.0031,"96":0,"97":0,"98":0,"99":0.0248,"100":0.031,"101":0.0496,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.0031,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0527,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0062,"100":0.0124,"101":0,"102":0,"103":0,"104":0.0062,"105":0,"106":0,"107":0.0031,"108":0,"109":0,"110":0.0155,"111":0,"112":0,"113":0,"114":0.0434,"115":0.0279,"116":0.0062},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0.0217,"15.2-15.3":0,"15.4":0,"15.5":0.0031,"15.6":0.0124,"16.0":0,"16.1":0.0031,"16.2":0.0031,"16.3":0,"16.4":0,"16.5":0.062,"16.6":0.0527},G:{"8":0,"17":0.08773,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01815,"8.1-8.4":0.00605,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.16942,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.00605,"14.0-14.4":0.0121,"14.5-14.8":0.01815,"15.0-15.1":0.08168,"15.2-15.3":0.98929,"15.4":0.21329,"15.5":0.21329,"15.6-15.7":1.66091,"16.0":2.31893,"16.1":0.50826,"16.2":0.95903,"16.3":2.35069,"16.4":0.24505,"16.5":1.85,"16.6":3.41712},P:{"4":0.14344,"20":0.32787,"21":0.22541,"5.0-5.4":0.01025,"6.2-6.4":0,"7.2-7.4":0.05123,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.07172,"14.0":0.01025,"15.0":0.02049,"16.0":0.06148,"17.0":0.09221,"18.0":0.56353,"19.0":0.12295},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00111,"4.4":0,"4.4.3-4.4.4":0.01819},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":68.3364},R:{_:"0"},M:{"0":0.1035},Q:{"13.1":0},O:{"0":0.414},H:{"0":0.36582}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00485,"45":0,"46":0,"47":0,"48":0.00243,"49":0,"50":0,"51":0,"52":0.00243,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00728,"69":0.00243,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00243,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00243,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.13591,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00243,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0.00243,"117":0.02912,"118":0.00243,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00243,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00485,"74":0.00243,"75":0.00243,"76":0.00485,"77":0.00485,"78":0.00243,"79":0.00728,"80":0.00243,"81":0.00485,"83":0.00728,"84":0.00485,"85":0.00243,"86":0.00485,"87":0,"88":0.00243,"89":0.04611,"90":0.00243,"91":0.00243,"92":0,"93":0.00728,"94":0.00728,"95":0,"96":0.00243,"97":0,"98":0.00485,"99":0.00485,"100":0.01699,"101":0.00485,"102":0.00728,"103":0.00243,"104":0.00243,"105":0.01456,"106":0.01456,"107":0.05097,"108":0.05825,"109":1.13098,"110":0.00485,"111":0.00971,"112":0.00728,"113":0.00728,"114":0.02427,"115":0.08737,"116":2.14304,"117":0.59219,"118":0.00728,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00243,"54":0,"55":0,"56":0,"57":0,"58":0.00243,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00243,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00728,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00243,"85":0,"86":0,"87":0,"88":0,"89":0.00243,"90":0,"91":0.00243,"92":0,"93":0.00485,"94":0.00485,"95":0,"96":0,"97":0.01456,"98":0,"99":0.00243,"100":0.00485,"101":0.00485,"102":0.01456,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.00485,"85":0.00243,"86":0,"87":0,"88":0.00243,"89":0,"90":0.00485,"91":0,"92":0.02184,"93":0,"94":0,"95":0,"96":0.00243,"97":0.00243,"98":0,"99":0.00243,"100":0.02427,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00243,"110":0,"111":0.00243,"112":0.00971,"113":0,"114":0.00485,"115":0.00485,"116":0.07281,"117":0.05825},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00243,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00485,"16.0":0,"16.1":0.00243,"16.2":0,"16.3":0.00485,"16.4":0,"16.5":0.0267,"16.6":0.16989,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0.00414,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.26195,"13.0-13.1":0.00725,"13.2":0.00725,"13.3":0.01553,"13.4-13.7":0.01553,"14.0-14.4":0.02278,"14.5-14.8":0.03003,"15.0-15.1":0.06833,"15.2-15.3":0.17912,"15.4":0.08697,"15.5":0.11389,"15.6-15.7":1.19792,"16.0":0.23606,"16.1":2.00344,"16.2":0.21329,"16.3":0.82519,"16.4":0.06109,"16.5":0.3075,"16.6":3.38772,"17.0":1.20103,"17.1":0.00725},P:{"4":0.11076,"20":0.30208,"21":0.29201,"22":2.07426,"5.0-5.4":0.02014,"6.2-6.4":0,"7.2-7.4":0.12083,"8.2":0,"9.2":0.05035,"10.1":0.01007,"11.1-11.2":0.02014,"12.0":0.07048,"13.0":0.07048,"14.0":0.02014,"15.0":0.08055,"16.0":0.12083,"17.0":0.22152,"18.0":0.48332,"19.0":0.45312},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00015,"4.2-4.3":0.00092,"4.4":0,"4.4.3-4.4.4":0.00378},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":76.17538},R:{_:"0"},M:{"0":0.06058},Q:{"13.1":0},O:{"0":0.60584},H:{"0":0.31546}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TN.js
index 93eeb0a926b7bb..ba7130c8bc6357 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01092,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00273,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00546,"103":0,"104":0.00273,"105":0.00273,"106":0,"107":0,"108":0,"109":0,"110":0.00273,"111":0,"112":0.00273,"113":0.00273,"114":0.00273,"115":0.09555,"116":0.15015,"117":0.00546,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01911,"50":0,"51":0,"52":0,"53":0.00273,"54":0,"55":0,"56":0.00273,"57":0,"58":0.00546,"59":0,"60":0,"61":0,"62":0,"63":0.00273,"64":0,"65":0.00273,"66":0,"67":0.00546,"68":0.00273,"69":0,"70":0.00546,"71":0,"72":0,"73":0.00273,"74":0.00273,"75":0,"76":0.00273,"77":0.00273,"78":0.00273,"79":0.01092,"80":0.00273,"81":0.00819,"83":0.00273,"84":0,"85":0.00819,"86":0.00273,"87":0.00819,"88":0.00273,"89":0.00273,"90":0.00273,"91":0.01092,"92":0.00273,"93":0,"94":0.00273,"95":0.00546,"96":0.00273,"97":0.00273,"98":0.00546,"99":0.00819,"100":0.00273,"101":0.00273,"102":0.00546,"103":0.01092,"104":0.00273,"105":0.01638,"106":0.01365,"107":0.01365,"108":0.01638,"109":1.1193,"110":0.00546,"111":0.01092,"112":0.01638,"113":0.03003,"114":0.1638,"115":2.20857,"116":1.48239,"117":0.00273,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00273,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00273,"70":0.00546,"71":0.00546,"72":0.00819,"73":0,"74":0.00273,"75":0,"76":0,"77":0,"78":0,"79":0.00546,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00273,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0273,"96":0,"97":0,"98":0,"99":0.00546,"100":0.31941,"101":0.15561,"102":0.00273,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00273,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00273,"109":0.01092,"110":0.00273,"111":0.00273,"112":0.00273,"113":0.00819,"114":0.01911,"115":0.34671,"116":0.13104},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00546,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00273,"14.1":0.00546,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.01092,"16.0":0.00273,"16.1":0.00273,"16.2":0.00546,"16.3":0.00819,"16.4":0.00273,"16.5":0.01638,"16.6":0.01638},G:{"8":0,"17":0.06013,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00237,"6.0-6.1":0,"7.0-7.1":0.04114,"8.1-8.4":0,"9.0-9.2":0.00237,"9.3":0.03719,"10.0-10.2":0.00158,"10.3":0.04747,"11.0-11.2":0.00316,"11.3-11.4":0.00316,"12.0-12.1":0.00633,"12.2-12.5":0.379,"13.0-13.1":0.0633,"13.2":0.00396,"13.3":0.01582,"13.4-13.7":0.02848,"14.0-14.4":0.17644,"14.5-14.8":0.20572,"15.0-15.1":0.04826,"15.2-15.3":0.06646,"15.4":0.08862,"15.5":0.11868,"15.6-15.7":0.93286,"16.0":0.32915,"16.1":0.53883,"16.2":0.26585,"16.3":0.52696,"16.4":0.14559,"16.5":1.54922,"16.6":2.21702},P:{"4":0.13397,"20":0.08244,"21":0.1855,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.24733,"8.2":0,"9.2":0.01031,"10.1":0,"11.1-11.2":0.02061,"12.0":0.01031,"13.0":0.02061,"14.0":0.02061,"15.0":0.01031,"16.0":0.04122,"17.0":0.07214,"18.0":0.03092,"19.0":0.05153},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.03207,"4.4":0,"4.4.3-4.4.4":0.14434},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01911,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":81.96011},R:{_:"0"},M:{"0":0.06543},Q:{"13.1":0},O:{"0":0.10905},H:{"0":0.24778}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00346,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.02422,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.00346,"76":0,"77":0,"78":0.00692,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0346,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01038,"103":0.00346,"104":0.00346,"105":0.00692,"106":0.00346,"107":0,"108":0,"109":0,"110":0.00346,"111":0,"112":0.00346,"113":0.00346,"114":0.00346,"115":0.10726,"116":0.02076,"117":0.25258,"118":0.02076,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03114,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00346,"57":0,"58":0.01038,"59":0,"60":0,"61":0,"62":0,"63":0.00346,"64":0,"65":0.00692,"66":0,"67":0.00346,"68":0,"69":0,"70":0.01038,"71":0.00346,"72":0.01038,"73":0.00346,"74":0.00346,"75":0,"76":0.00346,"77":0.00346,"78":0.00346,"79":0.0173,"80":0.01038,"81":0.0173,"83":0.00346,"84":0.00692,"85":0.02076,"86":0.00692,"87":0.02768,"88":0.00346,"89":0.02076,"90":0.02768,"91":0.02076,"92":0.00692,"93":0,"94":0.00346,"95":0.00692,"96":0.00346,"97":0.00346,"98":0.01038,"99":0.02076,"100":0.01384,"101":0.00346,"102":0.01384,"103":0.0173,"104":0.00692,"105":0.01384,"106":0.0519,"107":0.02076,"108":0.10034,"109":1.80612,"110":0.0173,"111":0.0173,"112":0.0346,"113":0.02768,"114":0.07266,"115":0.15224,"116":4.4461,"117":1.18332,"118":0.00346,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0.00346,"65":0,"66":0,"67":0,"68":0,"69":0.02422,"70":0.0173,"71":0,"72":0.0173,"73":0.00346,"74":0.00346,"75":0,"76":0,"77":0.00692,"78":0,"79":0.00346,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00346,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0346,"96":0,"97":0,"98":0,"99":0.00346,"100":0.11072,"101":0.23528,"102":0.30448,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00346,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.02422,"91":0,"92":0.00692,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00346,"108":0.00346,"109":0.02076,"110":0.00346,"111":0,"112":0.00346,"113":0.00346,"114":0.01038,"115":0.0173,"116":0.48094,"117":0.35638},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00692,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00346,"14.1":0.00346,"15.1":0,"15.2-15.3":0,"15.4":0.00346,"15.5":0.00346,"15.6":0.0173,"16.0":0.00346,"16.1":0.00346,"16.2":0.00346,"16.3":0.00692,"16.4":0,"16.5":0.00692,"16.6":0.04152,"17.0":0.00346,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00507,"6.0-6.1":0.00254,"7.0-7.1":0.03634,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.0431,"10.0-10.2":0.00169,"10.3":0.03465,"11.0-11.2":0.00423,"11.3-11.4":0.00254,"12.0-12.1":0.00676,"12.2-12.5":0.20618,"13.0-13.1":0.00254,"13.2":0.00169,"13.3":1.18218,"13.4-13.7":0.03127,"14.0-14.4":0.08619,"14.5-14.8":0.22731,"15.0-15.1":0.05831,"15.2-15.3":0.05239,"15.4":0.05493,"15.5":0.09126,"15.6-15.7":0.82896,"16.0":0.24759,"16.1":0.46898,"16.2":0.26787,"16.3":0.38955,"16.4":0.10647,"16.5":0.35491,"16.6":3.18234,"17.0":0.39209,"17.1":0},P:{"4":0.20413,"20":0.06124,"21":0.12248,"22":1.09208,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.26537,"8.2":0,"9.2":0.01021,"10.1":0,"11.1-11.2":0.02041,"12.0":0.01021,"13.0":0.03062,"14.0":0.02041,"15.0":0.01021,"16.0":0.04083,"17.0":0.05103,"18.0":0.02041,"19.0":0.05103},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01472,"4.4":0,"4.4.3-4.4.4":0.14718},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03114,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":76.86668},R:{_:"0"},M:{"0":0.07194},Q:{"13.1":0},O:{"0":0.1308},H:{"0":0.3715}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TO.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TO.js
index 6cf7c75ff3ea92..7562d7da478254 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TO.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TO.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00457,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.03653,"112":0,"113":0,"114":0,"115":0.16894,"116":0.38354,"117":0.0137,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00457,"69":0,"70":0,"71":0.00457,"72":0,"73":0,"74":0.00457,"75":0,"76":0.00457,"77":0,"78":0,"79":0,"80":0.00913,"81":0,"83":0,"84":0.0274,"85":0,"86":0,"87":0.04109,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.01826,"94":0.00913,"95":0,"96":0,"97":0,"98":0,"99":0.0137,"100":0,"101":0,"102":0.52052,"103":0.04109,"104":0.00913,"105":0.00913,"106":0,"107":0.00913,"108":0.0137,"109":0.67577,"110":0.00457,"111":0.0137,"112":0.01826,"113":0.13241,"114":0.33332,"115":7.64805,"116":3.97242,"117":0.00913,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00457,"96":0,"97":0,"98":0,"99":0.00913,"100":0.0274,"101":0.04566,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.08219,"17":0,"18":0.00457,"79":0,"80":0,"81":0,"83":0,"84":0.0137,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0274,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.0137,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.0137,"110":0.02283,"111":0.00457,"112":0,"113":0.04109,"114":0.10502,"115":2.89028,"116":0.78992},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00913,"14":0.00913,"15":0.00457,"17":0.00457,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00913,"13.1":0.0274,"14.1":0.03196,"15.1":0,"15.2-15.3":0.00457,"15.4":0.00457,"15.5":0.02283,"15.6":0.03196,"16.0":0,"16.1":0.04566,"16.2":0.00913,"16.3":0.03653,"16.4":0.0274,"16.5":0.13698,"16.6":0.11872},G:{"8":0,"17":0.00523,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.05492,"11.0-11.2":0,"11.3-11.4":0.01046,"12.0-12.1":0.11638,"12.2-12.5":0.28113,"13.0-13.1":0,"13.2":0.017,"13.3":0.05492,"13.4-13.7":0.10461,"14.0-14.4":0.56226,"14.5-14.8":0.55834,"15.0-15.1":0.06669,"15.2-15.3":0.18829,"15.4":0.05492,"15.5":0.14383,"15.6-15.7":1.862,"16.0":0.20398,"16.1":0.58057,"16.2":0.59103,"16.3":0.96108,"16.4":0.46419,"16.5":3.66255,"16.6":2.53018},P:{"4":0.0205,"20":0.30754,"21":0.29728,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.10251,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0205,"12.0":0,"13.0":0,"14.0":0.01025,"15.0":0,"16.0":0.22553,"17.0":0,"18.0":0.041,"19.0":0.10251},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.169,"4.4":0,"4.4.3-4.4.4":0.06145},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.04109,"11":0.0274,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.66039},R:{_:"0"},M:{"0":0.04891},Q:{"13.1":0},O:{"0":0.16302},H:{"0":0.01029}};
+module.exports={C:{"2":0,"3":0,"4":0.00467,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.0187,"112":0,"113":0,"114":0.05609,"115":0.02337,"116":0.0187,"117":0.26174,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00467,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.0187,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.02337,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00467,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.04674,"104":0,"105":0.01402,"106":0,"107":0.02337,"108":0,"109":0.72914,"110":0,"111":0,"112":0.0187,"113":0.02337,"114":0.15892,"115":0.43936,"116":8.46461,"117":1.276,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.0187,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00467,"100":0,"101":0.00935,"102":0.02337,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00935,"14":0,"15":0.00467,"16":0,"17":0.01402,"18":0.0187,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.11685,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00467,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00467,"102":0,"103":0,"104":0,"105":0,"106":0.00467,"107":0,"108":0.01402,"109":0.02337,"110":0,"111":0.00935,"112":0.00467,"113":0.00467,"114":0.06076,"115":0.40664,"116":2.70157,"117":1.83688},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.03272,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01402,"14.1":0.05141,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.01402,"15.6":0.07946,"16.0":0,"16.1":0.06076,"16.2":0.00467,"16.3":0.0187,"16.4":0.03272,"16.5":0.13555,"16.6":0.30381,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.09445,"10.0-10.2":0,"10.3":0.01692,"11.0-11.2":0.09445,"11.3-11.4":0.00564,"12.0-12.1":0,"12.2-12.5":0.30169,"13.0-13.1":0,"13.2":0,"13.3":0.01692,"13.4-13.7":0.03383,"14.0-14.4":0.67105,"14.5-14.8":0.41165,"15.0-15.1":0.15085,"15.2-15.3":0.25235,"15.4":0.11137,"15.5":0.29041,"15.6-15.7":2.95487,"16.0":0.2016,"16.1":0.36795,"16.2":0.22838,"16.3":1.11654,"16.4":0.30733,"16.5":1.14473,"16.6":5.12168,"17.0":0.15648,"17.1":0},P:{"4":0,"20":0.09434,"21":0.29351,"22":0.5975,"5.0-5.4":0.03145,"6.2-6.4":0,"7.2-7.4":0.23061,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.05241,"12.0":0,"13.0":0.02096,"14.0":0.02096,"15.0":0.04193,"16.0":0.07338,"17.0":0.02096,"18.0":0.06289,"19.0":0.10482},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.1509,"4.4":0,"4.4.3-4.4.4":0.17606},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00935,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":63.1096},R:{_:"0"},M:{"0":0.03196},Q:{"13.1":0.00533},O:{"0":0.56988},H:{"0":0.07059}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TR.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TR.js
index 82e2985644e05f..f7161871da9611 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TR.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TR.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00249,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00249,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0.00249,"114":0.00249,"115":0.05976,"116":0.08715,"117":0.00249,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00249,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00498,"35":0,"36":0,"37":0,"38":0.01992,"39":0,"40":0,"41":0,"42":0,"43":0.00249,"44":0,"45":0,"46":0,"47":0.00498,"48":0,"49":0.00747,"50":0,"51":0,"52":0,"53":0.00498,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00249,"66":0,"67":0,"68":0.01245,"69":0,"70":0.00249,"71":0.00249,"72":0,"73":0.00498,"74":0,"75":0.00249,"76":0,"77":0,"78":0.00249,"79":0.0747,"80":0.00249,"81":0.00498,"83":0.01494,"84":0.00249,"85":0.00498,"86":0.00249,"87":0.01743,"88":0.00249,"89":0.00249,"90":0.00249,"91":0.00249,"92":0.00249,"93":0,"94":0.00249,"95":0.00249,"96":0.0249,"97":0.00249,"98":0.00249,"99":0.0249,"100":0.00249,"101":0.00249,"102":0.00249,"103":0.00996,"104":0.00498,"105":0.00498,"106":0.00996,"107":0.00996,"108":0.01245,"109":0.95616,"110":0.00747,"111":0.00996,"112":0.01743,"113":0.01494,"114":0.09711,"115":1.91481,"116":0.98853,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00498,"29":0,"30":0,"31":0.00249,"32":0.00249,"33":0,"34":0,"35":0,"36":0.00249,"37":0,"38":0,"39":0,"40":0.00747,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.03237,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00249,"70":0.00249,"71":0.02241,"72":0.0249,"73":0,"74":0,"75":0,"76":0.00249,"77":0.00498,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01992,"96":0,"97":0,"98":0,"99":0.00498,"100":0.15687,"101":0.11454,"102":0.00249,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00249,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00249,"93":0,"94":0,"95":0,"96":0,"97":0.00249,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00249,"108":0.00249,"109":0.02988,"110":0.00249,"111":0.00249,"112":0.00249,"113":0.00249,"114":0.01494,"115":0.36603,"116":0.11703},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00249,"14":0.00498,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00249,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00498,"14.1":0.00747,"15.1":0,"15.2-15.3":0,"15.4":0.00249,"15.5":0.00249,"15.6":0.02241,"16.0":0.00249,"16.1":0.00747,"16.2":0.00498,"16.3":0.01245,"16.4":0.00498,"16.5":0.03237,"16.6":0.04731},G:{"8":0,"17":0.08052,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01703,"8.1-8.4":0.00465,"9.0-9.2":0.0031,"9.3":0.04026,"10.0-10.2":0.0031,"10.3":0.08981,"11.0-11.2":0.00465,"11.3-11.4":0.00619,"12.0-12.1":0.01239,"12.2-12.5":1.13035,"13.0-13.1":0.00929,"13.2":0.00465,"13.3":0.02787,"13.4-13.7":0.07742,"14.0-14.4":0.15949,"14.5-14.8":0.39949,"15.0-15.1":0.05884,"15.2-15.3":0.07278,"15.4":0.08207,"15.5":0.13471,"15.6-15.7":2.83518,"16.0":0.27872,"16.1":0.60544,"16.2":0.28181,"16.3":0.68595,"16.4":0.1951,"16.5":2.61685,"16.6":5.54648},P:{"4":0.50575,"20":0.13418,"21":0.41286,"22":2.312,"5.0-5.4":0.03096,"6.2-6.4":0.01032,"7.2-7.4":0.15482,"8.2":0,"9.2":0.02064,"10.1":0,"11.1-11.2":0.02064,"12.0":0.01032,"13.0":0.06193,"14.0":0.03096,"15.0":0.01032,"16.0":0.05161,"17.0":0.13418,"18.0":0.04129,"19.0":0.08257},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0071,"4.2-4.3":0.01183,"4.4":0,"4.4.3-4.4.4":0.04353},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00498,"9":0,"10":0,"11":0.0498,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":70.29972},R:{_:"0"},M:{"0":0.12016},Q:{"13.1":0},O:{"0":0.09763},H:{"0":0.71811}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.00923,"49":0,"50":0,"51":0,"52":0.00231,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00231,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.03461,"116":0.00692,"117":0.08075,"118":0.00923,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00461,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01154,"35":0,"36":0,"37":0,"38":0.01615,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00692,"48":0,"49":0.00923,"50":0,"51":0,"52":0,"53":0.00461,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01154,"69":0,"70":0,"71":0,"72":0,"73":0.00461,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.05998,"80":0.00231,"81":0.00231,"83":0.01384,"84":0.00231,"85":0.00692,"86":0.00231,"87":0.01615,"88":0.00231,"89":0.00231,"90":0.00231,"91":0.00231,"92":0.00231,"93":0,"94":0.00231,"95":0.00231,"96":0.00692,"97":0.00231,"98":0.00231,"99":0.01846,"100":0.00231,"101":0.00231,"102":0.00231,"103":0.00923,"104":0.00461,"105":0.00461,"106":0.01154,"107":0.00923,"108":0.01154,"109":0.76362,"110":0.00692,"111":0.01154,"112":0.01384,"113":0.00923,"114":0.0323,"115":0.07844,"116":1.9102,"117":0.60674,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00461,"29":0,"30":0,"31":0.00231,"32":0.00231,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00692,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.02538,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00231,"70":0.00231,"71":0.00231,"72":0.03922,"73":0.01384,"74":0,"75":0,"76":0,"77":0.02076,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01384,"96":0,"97":0,"98":0,"99":0.00231,"100":0.0323,"101":0.09228,"102":0.15226,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00231,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00231,"93":0,"94":0,"95":0,"96":0.00231,"97":0.00231,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00231,"108":0.00231,"109":0.02076,"110":0.00231,"111":0,"112":0.00231,"113":0.00231,"114":0.00461,"115":0.00692,"116":0.21224,"117":0.1638},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00231,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00231,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00461,"14.1":0.00692,"15.1":0,"15.2-15.3":0,"15.4":0.00231,"15.5":0.00231,"15.6":0.01846,"16.0":0.00231,"16.1":0.00461,"16.2":0.00461,"16.3":0.00923,"16.4":0.00461,"16.5":0.01154,"16.6":0.06229,"17.0":0.00461,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01861,"8.1-8.4":0,"9.0-9.2":0.00155,"9.3":0.03102,"10.0-10.2":0.00155,"10.3":0.06979,"11.0-11.2":0.0062,"11.3-11.4":0.00775,"12.0-12.1":0.01241,"12.2-12.5":1.04999,"13.0-13.1":0.00931,"13.2":0.0031,"13.3":0.08065,"13.4-13.7":0.06824,"14.0-14.4":0.14734,"14.5-14.8":0.35827,"15.0-15.1":0.05273,"15.2-15.3":0.06824,"15.4":0.06979,"15.5":0.11942,"15.6-15.7":2.75603,"16.0":0.23574,"16.1":0.52112,"16.2":0.23264,"16.3":0.54593,"16.4":0.13959,"16.5":0.47769,"16.6":7.37475,"17.0":0.83751,"17.1":0},P:{"4":0.458,"20":0.11196,"21":0.29516,"22":2.44268,"5.0-5.4":0.03053,"6.2-6.4":0.01018,"7.2-7.4":0.14249,"8.2":0,"9.2":0.02036,"10.1":0,"11.1-11.2":0.02036,"12.0":0.01018,"13.0":0.06107,"14.0":0.03053,"15.0":0.01018,"16.0":0.04071,"17.0":0.12213,"18.0":0.03053,"19.0":0.08142},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00261,"4.2-4.3":0.00958,"4.4":0,"4.4.3-4.4.4":0.03703},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.03691,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":71.98823},R:{_:"0"},M:{"0":0.1077},Q:{"13.1":0},O:{"0":0.1154},H:{"0":0.76474}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TT.js
index 7c77d26652e13b..c6bc4c02caaf10 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.01164,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00388,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00388,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00776,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00388,"109":0,"110":0.00388,"111":0,"112":0,"113":0,"114":0.0194,"115":0.11252,"116":0.39188,"117":0.01164,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00388,"50":0,"51":0,"52":0,"53":0.00388,"54":0,"55":0,"56":0.00388,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00388,"68":0.03104,"69":0.00388,"70":0.00388,"71":0,"72":0,"73":0.00388,"74":0.00776,"75":0.00388,"76":0.00776,"77":0.00388,"78":0,"79":0.0194,"80":0.00388,"81":0.00776,"83":0.00388,"84":0,"85":0.00388,"86":0,"87":0.01164,"88":0.00388,"89":0,"90":0,"91":0.01164,"92":0.00388,"93":0.0388,"94":0,"95":0.00776,"96":0.00388,"97":0.01164,"98":0.00776,"99":0.00776,"100":0.00388,"101":0.00388,"102":0,"103":0.18624,"104":0,"105":0.00388,"106":0.00388,"107":0.00388,"108":0.00776,"109":0.41128,"110":0.01164,"111":0.01164,"112":0.03492,"113":0.03104,"114":0.43456,"115":5.33888,"116":2.6578,"117":0.00776,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0194,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00776,"72":0.00776,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00388,"96":0,"97":0,"98":0,"99":0.00388,"100":0.2328,"101":0.13192,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00388,"79":0,"80":0,"81":0,"83":0,"84":0.00388,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00388,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01552,"110":0.00388,"111":0.00776,"112":0,"113":0.01164,"114":0.06596,"115":1.34248,"116":0.42292},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01552,"15":0.00388,"17":0.01552,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00388,"13.1":0.05044,"14.1":0.03104,"15.1":0.00388,"15.2-15.3":0.00388,"15.4":0.00776,"15.5":0.04268,"15.6":0.097,"16.0":0.03492,"16.1":0.0194,"16.2":0.04656,"16.3":0.05432,"16.4":0.07372,"16.5":0.32592,"16.6":0.23668},G:{"8":0,"17":0.40926,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.03394,"6.0-6.1":0,"7.0-7.1":0.01198,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.08385,"10.0-10.2":0.002,"10.3":0.06987,"11.0-11.2":0.01397,"11.3-11.4":0,"12.0-12.1":0.00399,"12.2-12.5":0.44719,"13.0-13.1":0,"13.2":0,"13.3":0.00399,"13.4-13.7":0.01597,"14.0-14.4":0.06388,"14.5-14.8":0.21162,"15.0-15.1":0.02995,"15.2-15.3":0.06788,"15.4":0.08385,"15.5":0.1637,"15.6-15.7":1.70292,"16.0":0.78259,"16.1":0.81253,"16.2":0.52306,"16.3":1.01217,"16.4":0.16969,"16.5":4.03471,"16.6":9.19539},P:{"4":0.45459,"20":0.06343,"21":0.45459,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.23258,"8.2":0,"9.2":0.01057,"10.1":0,"11.1-11.2":0.01057,"12.0":0,"13.0":0.02114,"14.0":0.02114,"15.0":0.02114,"16.0":0.03172,"17.0":0.08457,"18.0":0.03172,"19.0":0.06343},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.06331,"4.2-4.3":0.26906,"4.4":0,"4.4.3-4.4.4":0.50647},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00388,"11":0.00776,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":56.28388},R:{_:"0"},M:{"0":0.20808},Q:{"13.1":0},O:{"0":0.03672},H:{"0":0.24335}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.08207,"49":0,"50":0,"51":0,"52":0.00391,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00391,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00391,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00391,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00782,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00391,"111":0,"112":0,"113":0,"114":0.00782,"115":0.03908,"116":0.02736,"117":0.49241,"118":0.03517,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00391,"48":0,"49":0.00782,"50":0,"51":0,"52":0,"53":0.00782,"54":0,"55":0,"56":0.00391,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00391,"67":0.00391,"68":0.01954,"69":0.00782,"70":0.00391,"71":0,"72":0,"73":0.00391,"74":0.00391,"75":0.00782,"76":0.01172,"77":0.00391,"78":0.00391,"79":0.03517,"80":0.00391,"81":0.00782,"83":0.00391,"84":0.00391,"85":0,"86":0,"87":0.00782,"88":0,"89":0,"90":0,"91":0.00782,"92":0.00391,"93":0.01954,"94":0,"95":0.00782,"96":0,"97":0.00782,"98":0,"99":0.00391,"100":0.00391,"101":0.00391,"102":0,"103":0.18758,"104":0.00391,"105":0.00391,"106":0.00391,"107":0.00391,"108":0.01172,"109":0.36735,"110":0.02345,"111":0.00782,"112":0.01954,"113":0.03517,"114":0.08207,"115":0.1954,"116":6.58889,"117":1.37952,"118":0.00391,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01563,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00782,"73":0.00391,"74":0,"75":0,"76":0,"77":0.03126,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00391,"96":0,"97":0,"98":0,"99":0,"100":0.04299,"101":0.18758,"102":0.16023,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00391,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00782,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01954,"110":0,"111":0.00782,"112":0.00391,"113":0.00391,"114":0.01172,"115":0.05471,"116":1.27401,"117":0.78942},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00391,"14":0.01172,"15":0.00782,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00391,"10.1":0,"11.1":0,"12.1":0.00391,"13.1":0.05471,"14.1":0.03126,"15.1":0,"15.2-15.3":0.00391,"15.4":0.01172,"15.5":0.02736,"15.6":0.10552,"16.0":0.01563,"16.1":0.01563,"16.2":0.01954,"16.3":0.05471,"16.4":0.04299,"16.5":0.06253,"16.6":0.55494,"17.0":0.03517,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02934,"6.0-6.1":0,"7.0-7.1":0.03178,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.08556,"10.0-10.2":0,"10.3":0.10023,"11.0-11.2":0.00733,"11.3-11.4":0.00244,"12.0-12.1":0,"12.2-12.5":0.36181,"13.0-13.1":0,"13.2":0,"13.3":0.00244,"13.4-13.7":0.01956,"14.0-14.4":0.31536,"14.5-14.8":0.20291,"15.0-15.1":0.06845,"15.2-15.3":0.05134,"15.4":0.04645,"15.5":0.1589,"15.6-15.7":1.69169,"16.0":0.81896,"16.1":0.96075,"16.2":0.41803,"16.3":0.83851,"16.4":0.18335,"16.5":0.80429,"16.6":15.46482,"17.0":1.49368,"17.1":0},P:{"4":0.36801,"20":0.09463,"21":0.28389,"22":4.48969,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.30492,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01051,"12.0":0,"13.0":0.04206,"14.0":0.02103,"15.0":0.01051,"16.0":0.03154,"17.0":0.05257,"18.0":0.02103,"19.0":0.06309},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.03672,"4.2-4.3":0.24477,"4.4":0,"4.4.3-4.4.4":0.46506},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00391,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0.00609},N:{"10":0,"11":0},L:{"0":52.31206},R:{_:"0"},M:{"0":0.24977},Q:{"13.1":0},O:{"0":0.06092},H:{"0":0.34605}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TV.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TV.js
index b299d7f76987fe..744b149fcbab85 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TV.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TV.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.02799,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0.6825,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.02799,"99":0,"100":0,"101":0,"102":0,"103":0.02799,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.17009,"110":0,"111":0.08612,"112":0,"113":0.11411,"114":0.05598,"115":1.53509,"116":0.42629,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.17009,"115":0.25621,"116":0.02799},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.05598,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.62652,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0.02799},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.08775,"15.6-15.7":0,"16.0":0.96469,"16.1":0.26298,"16.2":0.08775,"16.3":0,"16.4":0,"16.5":0.87695,"16.6":0.26298},P:{"4":0,"20":0.26231,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0.13116,"17.0":0,"18.0":0,"19.0":0.40356},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":91.66459},R:{_:"0"},M:{"0":0.1334},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0.00887,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.01774,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00887,"109":0.03438,"110":0,"111":0,"112":0,"113":0,"114":0.02551,"115":0,"116":0.41588,"117":0.00887,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00887,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00887,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.02551,"115":0.04325,"116":0.27725,"117":0.21626},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.02551,"15.6":0.01774,"16.0":0,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0,"16.6":0,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0.04762,"15.4":0,"15.5":0,"15.6-15.7":0.04762,"16.0":0.04762,"16.1":0,"16.2":0,"16.3":0.28548,"16.4":0,"16.5":0.19036,"16.6":0.38061,"17.0":0.14274,"17.1":0},P:{"4":0,"20":0,"21":0,"22":0.08002,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":97.5379},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0.08002},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TW.js
index e5b132aed17a63..b1a713b6e52904 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.01519,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00506,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00506,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00506,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00506,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00506,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00506,"113":0.00506,"114":0.01012,"115":0.16198,"116":0.29866,"117":0.01012,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00506,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00506,"31":0,"32":0,"33":0.01012,"34":0.01519,"35":0.01012,"36":0,"37":0,"38":0.05062,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.03543,"50":0,"51":0,"52":0,"53":0.04556,"54":0,"55":0,"56":0.01519,"57":0,"58":0,"59":0,"60":0,"61":0.02531,"62":0.00506,"63":0,"64":0.00506,"65":0.00506,"66":0.00506,"67":0.01012,"68":0.00506,"69":0.00506,"70":0.00506,"71":0.00506,"72":0.00506,"73":0.01012,"74":0.01519,"75":0.00506,"76":0.00506,"77":0.00506,"78":0.00506,"79":0.32397,"80":0.01012,"81":0.02025,"83":0.01012,"84":0,"85":0.00506,"86":0.01012,"87":0.08099,"88":0.00506,"89":0.01012,"90":0.00506,"91":0.01012,"92":0.00506,"93":0.00506,"94":0.00506,"95":0.01012,"96":0.01012,"97":0.02025,"98":0.00506,"99":0.02531,"100":0.00506,"101":0.01519,"102":0.01519,"103":0.06074,"104":0.01012,"105":0.01519,"106":0.02025,"107":0.01519,"108":0.0405,"109":2.36902,"110":0.01519,"111":0.02025,"112":0.04556,"113":0.06581,"114":0.46064,"115":8.11945,"116":4.39888,"117":0.01012,"118":0.00506,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.01519,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01012,"37":0.00506,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.05568,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00506,"96":0,"97":0,"98":0,"99":0,"100":0.01519,"101":0.03543,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00506,"18":0.00506,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00506,"108":0.00506,"109":0.06074,"110":0.00506,"111":0.00506,"112":0.00506,"113":0.01012,"114":0.05568,"115":1.57428,"116":0.51126},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.03037,"14":0.08605,"15":0.01519,"17":0.00506,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.02025,"13.1":0.07087,"14.1":0.24298,"15.1":0.02531,"15.2-15.3":0.02025,"15.4":0.08099,"15.5":0.14174,"15.6":0.4657,"16.0":0.02025,"16.1":0.10124,"16.2":0.09618,"16.3":0.27841,"16.4":0.08605,"16.5":0.76436,"16.6":1.1187},G:{"8":0,"17":0.04681,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.03121,"6.0-6.1":0.0156,"7.0-7.1":0.13264,"8.1-8.4":0.05072,"9.0-9.2":0.0156,"9.3":0.23017,"10.0-10.2":0.0117,"10.3":0.31209,"11.0-11.2":0.02341,"11.3-11.4":0.03511,"12.0-12.1":0.06242,"12.2-12.5":0.88557,"13.0-13.1":0.03511,"13.2":0.0156,"13.3":0.06242,"13.4-13.7":0.13654,"14.0-14.4":0.80754,"14.5-14.8":1.17425,"15.0-15.1":0.53056,"15.2-15.3":0.51495,"15.4":0.69051,"15.5":0.86216,"15.6-15.7":3.28869,"16.0":1.74772,"16.1":2.74252,"16.2":1.54876,"16.3":2.89077,"16.4":1.02601,"16.5":6.9948,"16.6":12.07412},P:{"4":0.71786,"20":0.21753,"21":0.43506,"22":2.11006,"5.0-5.4":0.09789,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.03263,"10.1":0.01088,"11.1-11.2":0.03263,"12.0":0.01088,"13.0":0.07614,"14.0":0.03263,"15.0":0.03263,"16.0":0.05438,"17.0":0.07614,"18.0":0.07614,"19.0":0.11964},I:{"0":0,"3":0,"4":0.01904,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00952,"4.4":0,"4.4.3-4.4.4":0.05712},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.06074,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":30.80254},R:{_:"0"},M:{"0":0.07407},Q:{"13.1":0.00988},O:{"0":0.08888},H:{"0":0.1496}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00867,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00433,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00433,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00433,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00433,"115":0.06934,"116":0.01734,"117":0.24704,"118":0.01734,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00433,"31":0,"32":0,"33":0,"34":0.00867,"35":0,"36":0,"37":0,"38":0.03034,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.026,"50":0,"51":0,"52":0,"53":0.026,"54":0,"55":0,"56":0.00867,"57":0,"58":0,"59":0,"60":0,"61":0.01734,"62":0.00433,"63":0,"64":0,"65":0.00433,"66":0.00433,"67":0.00433,"68":0.00433,"69":0.00433,"70":0.00433,"71":0.00433,"72":0.00433,"73":0.00433,"74":0.00867,"75":0.00433,"76":0.00433,"77":0.02167,"78":0.00433,"79":0.2167,"80":0.00433,"81":0.013,"83":0.00867,"84":0,"85":0.00433,"86":0.00867,"87":0.05201,"88":0.00433,"89":0.00867,"90":0.00433,"91":0.00433,"92":0.00433,"93":0.00433,"94":0.00433,"95":0.00433,"96":0.00867,"97":0.013,"98":0.00433,"99":0.01734,"100":0.00433,"101":0.00867,"102":0.013,"103":0.03901,"104":0.00433,"105":0.00867,"106":0.013,"107":0.013,"108":0.026,"109":1.59058,"110":0.00867,"111":0.01734,"112":0.026,"113":0.03901,"114":0.09535,"115":0.2037,"116":7.79253,"117":1.7076,"118":0.00867,"119":0.00433,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00867,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00433,"37":0.00433,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.03901,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00867,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00433,"96":0,"97":0,"98":0,"99":0,"100":0.00433,"101":0.026,"102":0.01734,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00433,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00433,"109":0.04334,"110":0.00433,"111":0.00433,"112":0.00433,"113":0.00867,"114":0.013,"115":0.03467,"116":0.94915,"117":0.59376},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01734,"14":0.05634,"15":0.00867,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.013,"13.1":0.04767,"14.1":0.15602,"15.1":0.01734,"15.2-15.3":0.013,"15.4":0.05201,"15.5":0.09101,"15.6":0.29471,"16.0":0.013,"16.1":0.06501,"16.2":0.05634,"16.3":0.16469,"16.4":0.04767,"16.5":0.16036,"16.6":1.2872,"17.0":0.026,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02113,"6.0-6.1":0.01268,"7.0-7.1":0.09298,"8.1-8.4":0.02959,"9.0-9.2":0.00423,"9.3":0.14793,"10.0-10.2":0.00845,"10.3":0.22401,"11.0-11.2":0.01691,"11.3-11.4":0.02536,"12.0-12.1":0.05072,"12.2-12.5":0.63821,"13.0-13.1":0.02959,"13.2":0.01268,"13.3":0.04649,"13.4-13.7":0.09721,"14.0-14.4":0.71007,"14.5-14.8":1.04397,"15.0-15.1":0.5241,"15.2-15.3":0.50296,"15.4":0.65512,"15.5":0.83686,"15.6-15.7":2.92903,"16.0":1.88083,"16.1":2.83604,"16.2":1.60188,"16.3":2.76419,"16.4":0.8749,"16.5":2.40493,"16.6":19.97485,"17.0":0.99325,"17.1":0},P:{"4":0.53018,"20":0.15148,"21":0.2705,"22":2.26136,"5.0-5.4":0.07574,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0.02164,"10.1":0,"11.1-11.2":0.03246,"12.0":0.01082,"13.0":0.0541,"14.0":0.02164,"15.0":0.02164,"16.0":0.04328,"17.0":0.06492,"18.0":0.0541,"19.0":0.09738},I:{"0":0,"3":0,"4":0.0069,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0138,"4.4":0,"4.4.3-4.4.4":0.0483},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.04334,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":34.91011},R:{_:"0"},M:{"0":0.07932},Q:{"13.1":0.00567},O:{"0":0.08499},H:{"0":0.19311}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TZ.js
index 378c22fe43d4ed..799908d6c93932 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/TZ.js
@@ -1 +1 @@
-module.exports={C:{"34":0.0018,"35":0.00361,"43":0.0018,"44":0.0018,"52":0.00902,"72":0.00541,"78":0.00902,"91":0.00541,"94":0.0018,"95":0.0018,"101":0.00361,"102":0.03245,"104":0.0018,"107":0.0018,"108":0.00361,"110":0.00541,"111":0.00361,"112":0.00541,"113":0.01262,"114":0.02885,"115":0.55713,"116":0.72481,"117":0.0595,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 36 37 38 39 40 41 42 45 46 47 48 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 92 93 96 97 98 99 100 103 105 106 109 118 119 120 3.5 3.6"},D:{"33":0.0018,"49":0.0018,"50":0.0018,"55":0.0018,"58":0.00361,"63":0.00361,"64":0.00361,"68":0.00541,"69":0.0018,"70":0.00541,"71":0.0018,"72":0.00361,"73":0.00361,"74":0.01262,"76":0.00361,"77":0.00721,"78":0.0018,"79":0.01983,"80":0.00902,"81":0.00361,"83":0.01983,"84":0.00721,"85":0.00361,"86":0.0018,"87":0.01983,"88":0.01082,"89":0.00721,"90":0.03065,"91":0.00721,"92":0.00541,"93":0.00541,"94":0.3011,"95":0.00902,"96":0.00361,"97":0.00541,"98":0.01442,"99":0.22177,"100":0.00361,"101":0.00361,"102":0.03426,"103":0.04688,"104":0.00541,"105":0.00902,"106":0.01442,"107":0.01442,"108":0.01803,"109":1.09082,"110":0.01442,"111":0.02885,"112":0.04508,"113":0.09015,"114":0.34798,"115":4.59044,"116":2.66123,"117":0.00541,"118":0.0018,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 51 52 53 54 56 57 59 60 61 62 65 66 67 75 119"},F:{"42":0.0018,"76":0.01623,"79":0.01442,"95":0.03426,"99":0.01623,"100":0.11539,"101":0.29569,"102":0.01082,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 77 78 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00721,"13":0.01983,"14":0.0018,"15":0.00361,"16":0.01082,"17":0.00361,"18":0.03786,"84":0.00361,"89":0.00902,"90":0.00721,"92":0.01983,"95":0.0018,"100":0.00361,"102":0.0018,"105":0.0018,"108":0.0018,"109":0.00902,"110":0.00541,"111":0.00721,"112":0.01262,"113":0.01442,"114":0.08294,"115":1.03853,"116":0.31372,_:"79 80 81 83 85 86 87 88 91 93 94 96 97 98 99 101 103 104 106 107"},E:{"4":0,"13":0.00361,"14":0.00541,"17":0.0018,_:"0 5 6 7 8 9 10 11 12 15 3.1 3.2 6.1 7.1 9.1 10.1","5.1":0.00902,"11.1":0.0018,"12.1":0.00902,"13.1":0.02705,"14.1":0.02705,"15.1":0.00361,"15.2-15.3":0.02885,"15.4":0.00541,"15.5":0.00721,"15.6":0.05048,"16.0":0.0018,"16.1":0.01442,"16.2":0.00902,"16.3":0.01623,"16.4":0.02705,"16.5":0.07753,"16.6":0.07212},G:{"8":0,"17":0.03678,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00051,"5.0-5.1":0.00153,"6.0-6.1":0,"7.0-7.1":0.00511,"8.1-8.4":0,"9.0-9.2":0.00153,"9.3":0.02554,"10.0-10.2":0.00204,"10.3":0.01532,"11.0-11.2":0.00153,"11.3-11.4":0.00306,"12.0-12.1":0.00766,"12.2-12.5":0.45871,"13.0-13.1":0.00664,"13.2":0.00204,"13.3":0.01737,"13.4-13.7":0.04138,"14.0-14.4":0.12719,"14.5-14.8":0.16857,"15.0-15.1":0.07867,"15.2-15.3":0.0848,"15.4":0.07254,"15.5":0.09808,"15.6-15.7":0.73149,"16.0":0.16091,"16.1":0.24723,"16.2":0.22885,"16.3":0.33867,"16.4":0.22272,"16.5":0.86277,"16.6":1.05688},P:{"4":0.14831,"20":0.13772,"21":0.22247,"5.0-5.4":0.05024,"6.2-6.4":0.10048,"7.2-7.4":0.26484,"8.2":0.01005,"9.2":0.08475,"10.1":0.03014,"11.1-11.2":0.06356,"12.0":0.01005,"13.0":0.02119,"14.0":0.01059,"15.0":0.01059,"16.0":0.08475,"17.0":0.05297,"18.0":0.03178,"19.0":0.15891},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00148,"4.2-4.3":0.00197,"4.4":0,"4.4.3-4.4.4":0.06212},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"11":0.03786,_:"6 7 8 9 10 5.5"},S:{"2.5":1.40971,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0.03278,"11":0},L:{"0":61.54629},R:{_:"0"},M:{"0":0.11474},Q:{"13.1":0},O:{"0":0.59831},H:{"0":13.99804}};
+module.exports={C:{"34":0.00191,"43":0.00191,"47":0.00191,"52":0.00574,"56":0.00191,"59":0.00191,"72":0.00383,"78":0.0134,"91":0.00574,"96":0.00191,"99":0.00383,"101":0.00191,"102":0.02297,"104":0.00383,"107":0.00191,"111":0.00383,"112":0.00383,"113":0.00957,"114":0.0134,"115":0.43256,"116":0.07465,"117":0.94934,"118":0.10527,"119":0.00766,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 44 45 46 48 49 50 51 53 54 55 57 58 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 92 93 94 95 97 98 100 103 105 106 108 109 110 120 3.5 3.6"},D:{"11":0.00957,"33":0.00191,"49":0.00191,"55":0.00191,"63":0.00383,"64":0.00191,"68":0.00574,"70":0.00383,"71":0.00191,"72":0.00191,"73":0.00191,"74":0.01148,"75":0.00191,"76":0.00191,"77":0.00766,"79":0.00957,"80":0.00766,"81":0.00383,"83":0.00957,"84":0.0134,"85":0.00191,"87":0.0134,"88":0.00766,"89":0.01148,"90":0.0134,"91":0.00383,"92":0.00383,"93":0.00574,"94":0.356,"95":0.01723,"96":0.00383,"97":0.00766,"98":0.01914,"99":0.3139,"101":0.00383,"102":0.01914,"103":0.04211,"104":0.00574,"105":0.00766,"106":0.00766,"107":0.01148,"108":0.01531,"109":0.98188,"110":0.02105,"111":0.02871,"112":0.06508,"113":0.04594,"114":0.13781,"115":0.16269,"116":6.00613,"117":1.54651,"118":0.00957,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 50 51 52 53 54 56 57 58 59 60 61 62 65 66 67 69 78 86 100 119 120"},F:{"38":0.00191,"42":0.00383,"75":0.00383,"77":0.00574,"79":0.0134,"82":0.00383,"86":0.00191,"95":0.03445,"98":0.00383,"99":0.00383,"100":0.01148,"101":0.20863,"102":0.21054,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 76 78 80 81 83 84 85 87 88 89 90 91 92 93 94 96 97 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00957,"13":0.00766,"14":0.00191,"15":0.00383,"16":0.00574,"17":0.00383,"18":0.04785,"84":0.00191,"89":0.00383,"90":0.00766,"92":0.02105,"100":0.00191,"103":0.00191,"108":0.00383,"109":0.01148,"110":0.00383,"111":0.00191,"112":0.0134,"113":0.01148,"114":0.02871,"115":0.0689,"116":0.76369,"117":0.52444,_:"79 80 81 83 85 86 87 88 91 93 94 95 96 97 98 99 101 102 104 105 106 107"},E:{"4":0,"13":0.00574,"14":0.00766,_:"0 5 6 7 8 9 10 11 12 15 3.1 3.2 6.1 7.1 9.1 10.1 17.1","5.1":0.00766,"11.1":0.00383,"12.1":0.00383,"13.1":0.01723,"14.1":0.01723,"15.1":0.00383,"15.2-15.3":0.00383,"15.4":0.00383,"15.5":0.00574,"15.6":0.05551,"16.0":0.00766,"16.1":0.00957,"16.2":0.00766,"16.3":0.0268,"16.4":0.01914,"16.5":0.02488,"16.6":0.10527,"17.0":0.00766},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00103,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00412,"8.1-8.4":0.00257,"9.0-9.2":0.00618,"9.3":0.0103,"10.0-10.2":0.00154,"10.3":0.02317,"11.0-11.2":0.00309,"11.3-11.4":0.00103,"12.0-12.1":0.01133,"12.2-12.5":0.50043,"13.0-13.1":0.00618,"13.2":0.0381,"13.3":0.01802,"13.4-13.7":0.05303,"14.0-14.4":0.13695,"14.5-14.8":0.20285,"15.0-15.1":0.07002,"15.2-15.3":0.07156,"15.4":0.06899,"15.5":0.08238,"15.6-15.7":0.68268,"16.0":0.16887,"16.1":0.18123,"16.2":0.15085,"16.3":0.28625,"16.4":0.16887,"16.5":0.35988,"16.6":1.50438,"17.0":0.29449,"17.1":0},P:{"4":0.18825,"20":0.07321,"21":0.11504,"22":0.80531,"5.0-5.4":0.02092,"6.2-6.4":0.02092,"7.2-7.4":0.09413,"8.2":0,"9.2":0.05229,"10.1":0.01021,"11.1-11.2":0.05229,"12.0":0.03063,"13.0":0.01046,"14.0":0.06126,"15.0":0.01046,"16.0":0.08367,"17.0":0.04183,"18.0":0.03138,"19.0":0.14642},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00412,"4.4":0,"4.4.3-4.4.4":0.08483},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"11":0.02871,_:"6 7 8 9 10 5.5"},S:{"2.5":1.27759,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.5403},R:{_:"0"},M:{"0":0.08086},Q:{"13.1":0},O:{"0":0.61454},H:{"0":11.39875}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UA.js
index aab00d804dde0e..f44ee080f00c38 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.02208,"15":0.0552,"16":0.03312,"17":0.01104,"18":0.02208,"19":0.01104,"20":0.01104,"21":0.01104,"22":0.02208,"23":0.02208,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.07728,"49":0,"50":0.0276,"51":0,"52":0.12144,"53":0.01656,"54":0,"55":0.00552,"56":0.01656,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01104,"69":0,"70":0,"71":0,"72":0.00552,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00552,"79":0,"80":0.00552,"81":0.00552,"82":0,"83":0.01104,"84":0,"85":0,"86":0,"87":0,"88":0.00552,"89":0,"90":0,"91":0.00552,"92":0,"93":0,"94":0,"95":0.00552,"96":0,"97":0,"98":0.00552,"99":0.00552,"100":0,"101":0.00552,"102":0.12696,"103":0.01104,"104":0.00552,"105":0.00552,"106":0.01656,"107":0.01656,"108":0.01104,"109":0.00552,"110":0.01656,"111":0.02208,"112":0.01104,"113":0.0276,"114":0.02208,"115":0.67344,"116":0.98808,"117":0.03312,"118":0.00552,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0.04968,"23":0.04416,"24":0.08832,"25":0,"26":0,"27":0,"28":0.03312,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00552,"39":0,"40":0,"41":0.00552,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.04416,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00552,"58":0,"59":0,"60":0,"61":0.01104,"62":0,"63":0.00552,"64":0.00552,"65":0,"66":0,"67":0,"68":0.01104,"69":0.00552,"70":0.00552,"71":0.01104,"72":0.01104,"73":0.00552,"74":0.01104,"75":0.00552,"76":0.00552,"77":0.00552,"78":0.01104,"79":0.0276,"80":0.01656,"81":0.02208,"83":0.01104,"84":0.01104,"85":0.03864,"86":0.0276,"87":0.02208,"88":0.01656,"89":0.01656,"90":0.02208,"91":0.01104,"92":0.00552,"93":0.01104,"94":0.00552,"95":0.01656,"96":0.01104,"97":0.02208,"98":0.01656,"99":0.07728,"100":0.01656,"101":0.01656,"102":0.0828,"103":0.03312,"104":0.02208,"105":0.04416,"106":0.0828,"107":0.04968,"108":0.09384,"109":2.52264,"110":0.04416,"111":0.06072,"112":0.09936,"113":0.12144,"114":0.65688,"115":8.66088,"116":4.54848,"117":0.01104,"118":0.01104,"119":0},F:{"9":0,"11":0,"12":0.04416,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.01104,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00552,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00552,"62":0.00552,"63":0,"64":0.00552,"65":0,"66":0,"67":0,"68":0,"69":0.00552,"70":0.00552,"71":0.02208,"72":0.02208,"73":0,"74":0,"75":0,"76":0.01104,"77":0.01104,"78":0,"79":0.0276,"80":0.00552,"81":0,"82":0.01104,"83":0.01656,"84":0.01104,"85":0.07176,"86":0.01656,"87":0.01656,"88":0.01104,"89":0.00552,"90":0.00552,"91":0,"92":0.00552,"93":0.00552,"94":0.01104,"95":0.65136,"96":0.00552,"97":0.00552,"98":0.01656,"99":0.04416,"100":1.22544,"101":1.7112,"102":0.02208,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0.03312,"11.5":0.04416,"11.6":0.02208,"12.1":0.0828},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00552,"79":0,"80":0,"81":0,"83":0,"84":0.00552,"85":0.00552,"86":0,"87":0,"88":0,"89":0,"90":0.00552,"91":0,"92":0.00552,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00552,"108":0.00552,"109":0.03312,"110":0.00552,"111":0.13248,"112":0.00552,"113":0.00552,"114":0.0276,"115":0.81144,"116":0.23184},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00552,"14":0.01656,"15":0.00552,"17":0.01656,_:"0","3.1":0,"3.2":0,"5.1":0.01104,"6.1":0,"7.1":0,"9.1":0.04416,"10.1":0,"11.1":0,"12.1":0.00552,"13.1":0.0552,"14.1":0.07728,"15.1":0.01104,"15.2-15.3":0.00552,"15.4":0.01104,"15.5":0.02208,"15.6":0.09936,"16.0":0.01104,"16.1":0.03864,"16.2":0.0276,"16.3":0.06072,"16.4":0.03312,"16.5":0.26496,"16.6":0.24288},G:{"8":0.00163,"17":0.24018,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00327,"5.0-5.1":0.00163,"6.0-6.1":0.00327,"7.0-7.1":0.02124,"8.1-8.4":0.0098,"9.0-9.2":0.01144,"9.3":0.06372,"10.0-10.2":0.00817,"10.3":0.03921,"11.0-11.2":0.02614,"11.3-11.4":0.02451,"12.0-12.1":0.01144,"12.2-12.5":0.21731,"13.0-13.1":0.00654,"13.2":0.01307,"13.3":0.04411,"13.4-13.7":0.04738,"14.0-14.4":0.11601,"14.5-14.8":0.22384,"15.0-15.1":0.10293,"15.2-15.3":0.0915,"15.4":0.09313,"15.5":0.14541,"15.6-15.7":1.34141,"16.0":0.9117,"16.1":1.05058,"16.2":0.58003,"16.3":1.11104,"16.4":0.30063,"16.5":3.19913,"16.6":6.26755},P:{"4":0.0423,"20":0.05287,"21":0.13746,"22":1.06799,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03172,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01057,"12.0":0,"13.0":0.01057,"14.0":0,"15.0":0,"16.0":0.02115,"17.0":0.02115,"18.0":0.02115,"19.0":0.02115},I:{"0":0,"3":0,"4":0.00496,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00745,"4.2-4.3":0.02234,"4.4":0,"4.4.3-4.4.4":0.07942},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.01656,"9":0.12696,"10":0.03864,"11":0.09384,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":46.98544},R:{_:"0"},M:{"0":0.20608},Q:{"13.1":0},O:{"0":0.28672},H:{"0":1.07307}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00575,"46":0.00575,"47":0,"48":0.60417,"49":0,"50":0.01151,"51":0.00575,"52":0.12659,"53":0.01151,"54":0,"55":0.00575,"56":0.01151,"57":0.00575,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01151,"69":0,"70":0.00575,"71":0,"72":0.00575,"73":0,"74":0.00575,"75":0,"76":0,"77":0,"78":0.01151,"79":0,"80":0.00575,"81":0.00575,"82":0,"83":0.01151,"84":0.00575,"85":0.02877,"86":0,"87":0.01151,"88":0.00575,"89":0,"90":0,"91":0.00575,"92":0,"93":0.05754,"94":0.01151,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.01151,"101":0.01151,"102":0.11508,"103":0.01151,"104":0.01151,"105":0.00575,"106":0.01151,"107":0.01726,"108":0.02302,"109":0.00575,"110":0.01726,"111":0.03452,"112":0.01151,"113":0.02302,"114":0.02302,"115":0.47183,"116":0.20139,"117":0.99544,"118":0.08631,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00575,"39":0,"40":0,"41":0.00575,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00575,"48":0.00575,"49":0.05754,"50":0,"51":0.00575,"52":0,"53":0,"54":0,"55":0,"56":0.01151,"57":0.00575,"58":0.00575,"59":0,"60":0.00575,"61":0.01726,"62":0,"63":0.00575,"64":0,"65":0.00575,"66":0,"67":0.00575,"68":0.01726,"69":0.00575,"70":0.00575,"71":0.01151,"72":0.00575,"73":0.01151,"74":0.02302,"75":0.11508,"76":0.02877,"77":0.02302,"78":0.05754,"79":0.03452,"80":0.09782,"81":0.05179,"83":0.02877,"84":0.01726,"85":0.06329,"86":0.0748,"87":0.09206,"88":0.12083,"89":0.02302,"90":0.24742,"91":0.09782,"92":0.06905,"93":0.01726,"94":0.01151,"95":0.01726,"96":0.12659,"97":0.04028,"98":0.03452,"99":0.06905,"100":0.03452,"101":0.03452,"102":0.11508,"103":0.10933,"104":0.04028,"105":0.08631,"106":0.17262,"107":0.19564,"108":0.17837,"109":2.56053,"110":0.08631,"111":0.08056,"112":0.09782,"113":0.06905,"114":0.22441,"115":0.3625,"116":11.03617,"117":3.3028,"118":0.00575,"119":0.00575,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.02877,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00575,"47":0,"48":0.00575,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00575,"55":0,"56":0,"57":0,"58":0,"60":0.01151,"62":0.00575,"63":0.01726,"64":0.00575,"65":0.06329,"66":0,"67":0.00575,"68":0,"69":0.00575,"70":0.01726,"71":0.00575,"72":0.02877,"73":0.02302,"74":0,"75":0,"76":0.01151,"77":0.12083,"78":0,"79":0.02302,"80":0.02877,"81":0.02302,"82":0.00575,"83":0.01151,"84":0.01151,"85":0.06329,"86":0.02302,"87":0.01151,"88":0.00575,"89":0.00575,"90":0.00575,"91":0,"92":0.00575,"93":0.00575,"94":0.01726,"95":0.63869,"96":0.00575,"97":0,"98":0.01151,"99":0.02877,"100":0.16687,"101":1.1508,"102":1.27739,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.02302},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.01151,"18":0.00575,"79":0,"80":0,"81":0,"83":0.02302,"84":0,"85":0.00575,"86":0,"87":0.00575,"88":0,"89":0,"90":0.02302,"91":0,"92":0.00575,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.02302,"103":0.00575,"104":0.00575,"105":0,"106":0.00575,"107":0.02302,"108":0.00575,"109":0.04028,"110":0.00575,"111":0.12659,"112":0.00575,"113":0.00575,"114":0.00575,"115":0.02302,"116":0.51786,"117":0.37976},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01726,"15":0.00575,_:"0","3.1":0,"3.2":0,"5.1":0.01151,"6.1":0,"7.1":0,"9.1":0.04028,"10.1":0,"11.1":0,"12.1":0.00575,"13.1":0.01726,"14.1":0.06329,"15.1":0.01151,"15.2-15.3":0.00575,"15.4":0.01151,"15.5":0.02877,"15.6":0.0748,"16.0":0.00575,"16.1":0.02877,"16.2":0.01726,"16.3":0.04028,"16.4":0.02302,"16.5":0.0748,"16.6":0.4258,"17.0":0.05179,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00443,"5.0-5.1":0.00222,"6.0-6.1":0,"7.0-7.1":0.00887,"8.1-8.4":0.00665,"9.0-9.2":0.0133,"9.3":0.04878,"10.0-10.2":0,"10.3":0.03326,"11.0-11.2":0.02439,"11.3-11.4":0.01996,"12.0-12.1":0.01109,"12.2-12.5":0.19957,"13.0-13.1":0.00665,"13.2":0.00887,"13.3":7.19342,"13.4-13.7":0.051,"14.0-14.4":0.11753,"14.5-14.8":0.21509,"15.0-15.1":0.10866,"15.2-15.3":0.0887,"15.4":0.08205,"15.5":0.11087,"15.6-15.7":1.27282,"16.0":0.6475,"16.1":0.81381,"16.2":0.4568,"16.3":0.7362,"16.4":0.16853,"16.5":0.46567,"16.6":7.54822,"17.0":1.53891,"17.1":0.00443},P:{"4":0.05308,"20":0.04246,"21":0.06369,"22":0.92351,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.02123,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01062,"14.0":0.01062,"15.0":0,"16.0":0.01062,"17.0":0.01062,"18.0":0.02123,"19.0":0.02123},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00461,"4.2-4.3":0.02306,"4.4":0,"4.4.3-4.4.4":0.08534},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00575,"9":0.00575,"10":0,"11":0.11508,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":39.39489},R:{_:"0"},M:{"0":0.3142},Q:{"13.1":0},O:{"0":0.30571},H:{"0":1.01702}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UG.js
index 4599dbfc4c4529..72130806b3510a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00248,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00248,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00248,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00248,"92":0,"93":0.00248,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01242,"103":0,"104":0.00248,"105":0.00248,"106":0,"107":0,"108":0.00248,"109":0.00248,"110":0.00248,"111":0.00497,"112":0.00248,"113":0.02484,"114":0.01739,"115":0.15898,"116":0.31795,"117":0.03478,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00248,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00248,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00248,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00497,"65":0,"66":0,"67":0,"68":0.00497,"69":0,"70":0.00497,"71":0,"72":0.00497,"73":0,"74":0.00248,"75":0.00248,"76":0.00248,"77":0,"78":0.00248,"79":0.00248,"80":0.00248,"81":0.00497,"83":0.00248,"84":0,"85":0,"86":0,"87":0.00745,"88":0.00497,"89":0.00248,"90":0,"91":0,"92":0.00248,"93":0.00497,"94":0.00248,"95":0.00994,"96":0.00248,"97":0.00248,"98":0.00248,"99":0.00248,"100":0.00248,"101":0,"102":0.00497,"103":0.01242,"104":0.00994,"105":0.00248,"106":0.00248,"107":0.00497,"108":0.00745,"109":0.25585,"110":0.00497,"111":0.00497,"112":0.00994,"113":0.02484,"114":0.12172,"115":1.43327,"116":0.7601,"117":0.00248,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00497,"25":0,"26":0,"27":0,"28":0.00248,"29":0,"30":0,"31":0,"32":0.00248,"33":0,"34":0,"35":0,"36":0,"37":0.04223,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00497,"55":0,"56":0,"57":0.00745,"58":0.00497,"60":0.03229,"62":0,"63":0.04968,"64":0.01739,"65":0.00745,"66":0.03726,"67":0.02981,"68":0.01987,"69":0.21611,"70":0.13662,"71":0.30056,"72":0.18878,"73":0.00248,"74":0.11426,"75":0.00248,"76":0.00994,"77":0.00248,"78":0,"79":0.00248,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.01242,"96":0,"97":0,"98":0,"99":0.00497,"100":0.04223,"101":0.07949,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00497},B:{"12":0.00248,"13":0.00248,"14":0.00248,"15":0,"16":0,"17":0,"18":0.00994,"79":0,"80":0,"81":0,"83":0,"84":0.00248,"85":0,"86":0,"87":0,"88":0,"89":0.00248,"90":0.00248,"91":0,"92":0.00745,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00248,"109":0.00497,"110":0,"111":0.00248,"112":0.00497,"113":0.00497,"114":0.02732,"115":0.27821,"116":0.08446},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00248,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00497,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00497,"14.1":0.00745,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00248,"15.6":0.00745,"16.0":0,"16.1":0.00248,"16.2":0.00497,"16.3":0.00248,"16.4":0.00248,"16.5":0.01739,"16.6":0.00994},G:{"8":0,"17":0.06745,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00055,"5.0-5.1":0.00166,"6.0-6.1":0,"7.0-7.1":0.11722,"8.1-8.4":0,"9.0-9.2":0.00055,"9.3":0.047,"10.0-10.2":0,"10.3":0.04202,"11.0-11.2":0.00221,"11.3-11.4":0.00111,"12.0-12.1":0.01106,"12.2-12.5":0.42021,"13.0-13.1":0.00608,"13.2":0.00166,"13.3":0.01659,"13.4-13.7":0.01825,"14.0-14.4":0.1515,"14.5-14.8":0.16587,"15.0-15.1":0.11998,"15.2-15.3":0.12274,"15.4":0.11445,"15.5":0.11058,"15.6-15.7":0.84428,"16.0":0.21453,"16.1":0.28309,"16.2":0.19628,"16.3":0.3146,"16.4":0.19628,"16.5":0.94104,"16.6":0.99965},P:{"4":0.09092,"20":0.12123,"21":0.23236,"5.0-5.4":0.02021,"6.2-6.4":0,"7.2-7.4":0.11113,"8.2":0,"9.2":0.09092,"10.1":0,"11.1-11.2":0.03031,"12.0":0.04041,"13.0":0.0101,"14.0":0.02021,"15.0":0.03031,"16.0":0.06062,"17.0":0.03031,"18.0":0.03031,"19.0":0.11113},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00205,"4.2-4.3":0.00616,"4.4":0,"4.4.3-4.4.4":0.07911},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01987,"5.5":0},S:{"2.5":0.40586,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.30307},R:{_:"0"},M:{"0":0.1428},Q:{"13.1":0},O:{"0":0.57122},H:{"0":14.65827}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00246,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00246,"57":0,"58":0,"59":0,"60":0.00246,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00246,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00246,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00985,"103":0,"104":0.00246,"105":0.00246,"106":0.00246,"107":0,"108":0,"109":0,"110":0.00246,"111":0.00246,"112":0.00246,"113":0.00493,"114":0.00493,"115":0.09113,"116":0.03941,"117":0.2931,"118":0.0468,"119":0.00246,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00246,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00246,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00246,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00246,"65":0,"66":0,"67":0,"68":0.00246,"69":0.00246,"70":0.00246,"71":0.00739,"72":0.00493,"73":0,"74":0.00246,"75":0,"76":0.00246,"77":0,"78":0.00246,"79":0.00246,"80":0.00246,"81":0.00739,"83":0.00246,"84":0,"85":0,"86":0.00246,"87":0.00493,"88":0.00246,"89":0.00246,"90":0,"91":0.00246,"92":0.00246,"93":0.00246,"94":0.00246,"95":0.00739,"96":0.00246,"97":0.00739,"98":0.00246,"99":0.00246,"100":0.00246,"101":0,"102":0.00246,"103":0.01232,"104":0.00246,"105":0.00493,"106":0.00493,"107":0.00246,"108":0.00493,"109":0.27093,"110":0.00246,"111":0.00493,"112":0.00985,"113":0.00985,"114":0.0468,"115":0.04926,"116":1.7044,"117":0.41378,"118":0.00246,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00246,"25":0,"26":0,"27":0,"28":0.00246,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.05419,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00246,"48":0,"49":0,"50":0.00246,"51":0,"52":0,"53":0,"54":0.00246,"55":0,"56":0,"57":0.00985,"58":0.00493,"60":0.02463,"62":0,"63":0.04433,"64":0.0197,"65":0.00739,"66":0.02709,"67":0.0197,"68":0.01478,"69":0.17734,"70":0.11084,"71":0.15763,"72":0.39162,"73":0.07389,"74":0.06158,"75":0.00246,"76":0.00739,"77":0.03448,"78":0.00246,"79":0.00246,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00739,"96":0,"97":0,"98":0,"99":0.00246,"100":0.00246,"101":0.0468,"102":0.06158,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00739},B:{"12":0.00246,"13":0,"14":0.00246,"15":0.00246,"16":0,"17":0,"18":0.00985,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00246,"91":0,"92":0.00493,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00246,"110":0,"111":0.00246,"112":0.00246,"113":0.00246,"114":0.00985,"115":0.01724,"116":0.20936,"117":0.11822},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00246,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00493,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00493,"14.1":0.00739,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00246,"15.6":0.00493,"16.0":0,"16.1":0.00246,"16.2":0.00246,"16.3":0.00985,"16.4":0,"16.5":0.00739,"16.6":0.0197,"17.0":0.00246,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00198,"6.0-6.1":0.00148,"7.0-7.1":0.04052,"8.1-8.4":0,"9.0-9.2":0.00198,"9.3":0.04743,"10.0-10.2":0,"10.3":0.03656,"11.0-11.2":0.00296,"11.3-11.4":0.00148,"12.0-12.1":0.00791,"12.2-12.5":0.32165,"13.0-13.1":0.00593,"13.2":0.00346,"13.3":0.00988,"13.4-13.7":0.01927,"14.0-14.4":0.15119,"14.5-14.8":0.20604,"15.0-15.1":0.08597,"15.2-15.3":0.08993,"15.4":0.0583,"15.5":0.08647,"15.6-15.7":0.77968,"16.0":0.18776,"16.1":0.22531,"16.2":0.14872,"16.3":0.26829,"16.4":0.14477,"16.5":0.39182,"16.6":1.28316,"17.0":0.29942,"17.1":0},P:{"4":0.08274,"20":0.0724,"21":0.13446,"22":0.55851,"5.0-5.4":0.01034,"6.2-6.4":0,"7.2-7.4":0.11377,"8.2":0,"9.2":0.12411,"10.1":0,"11.1-11.2":0.03103,"12.0":0.04137,"13.0":0.01034,"14.0":0.02069,"15.0":0.02069,"16.0":0.04137,"17.0":0.04137,"18.0":0.02069,"19.0":0.09308},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00187,"4.2-4.3":0.00467,"4.4":0,"4.4.3-4.4.4":0.07563},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00493,"5.5":0},S:{"2.5":0.41454,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":68.04054},R:{_:"0"},M:{"0":0.15074},Q:{"13.1":0},O:{"0":0.54266},H:{"0":14.9347}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/US.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/US.js
index 3a2d20903ac463..20d72213fb7dde 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/US.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/US.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0.00678,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02034,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00678,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00678,"45":0,"46":0,"47":0,"48":0.00678,"49":0,"50":0,"51":0,"52":0.02034,"53":0.00678,"54":0,"55":0,"56":0.00678,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00678,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0678,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00678,"90":0.00678,"91":0.00678,"92":0,"93":0,"94":0.02712,"95":0,"96":0,"97":0,"98":0,"99":0.00678,"100":0,"101":0,"102":0.08136,"103":0.00678,"104":0.00678,"105":0.00678,"106":0,"107":0.00678,"108":0.01356,"109":0.00678,"110":0.00678,"111":0.00678,"112":0.14238,"113":0.02034,"114":0.0339,"115":0.43392,"116":1.15938,"117":0.04068,"118":0,"119":0,"120":0,"3.5":0,"3.6":0.00678},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00678,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00678,"48":0.02712,"49":0.02034,"50":0,"51":0.00678,"52":0,"53":0,"54":0,"55":0,"56":0.09492,"57":0,"58":0,"59":0.00678,"60":0,"61":0.00678,"62":0.00678,"63":0.00678,"64":0,"65":0.01356,"66":0.02034,"67":0.00678,"68":0.07458,"69":0.05424,"70":0.0339,"71":0.04068,"72":0.05424,"73":0.02034,"74":0.0678,"75":0.0678,"76":0.21696,"77":0.04746,"78":0.06102,"79":0.25764,"80":0.16272,"81":0.1017,"83":0.2034,"84":0.06102,"85":0.11526,"86":0.1356,"87":0.12882,"88":0.08136,"89":0.0678,"90":0.08814,"91":0.0678,"92":0.02712,"93":0.25086,"94":0.02034,"95":0.01356,"96":0.02034,"97":0.02034,"98":0.02712,"99":0.02712,"100":0.02712,"101":0.04746,"102":0.04746,"103":0.33222,"104":0.04746,"105":0.05424,"106":0.0339,"107":0.21018,"108":0.29154,"109":0.75258,"110":0.27798,"111":0.53562,"112":0.339,"113":0.33222,"114":3.30186,"115":12.56334,"116":3.8646,"117":0.02034,"118":0.00678,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00678,"54":0.00678,"55":0.00678,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00678,"72":0.00678,"73":0,"74":0,"75":0,"76":0.00678,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00678,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02034,"96":0,"97":0.18306,"98":0.00678,"99":0.04746,"100":1.0848,"101":0.4407,"102":0.00678,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00678,"13":0,"14":0,"15":0.00678,"16":0,"17":0.00678,"18":0.00678,"79":0.00678,"80":0.01356,"81":0.01356,"83":0.01356,"84":0.01356,"85":0.00678,"86":0.01356,"87":0.01356,"88":0.00678,"89":0.00678,"90":0.00678,"91":0,"92":0.00678,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.0339,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00678,"108":0.00678,"109":0.05424,"110":0.00678,"111":0.18984,"112":0.19662,"113":0.02034,"114":1.19328,"115":2.9493,"116":0.92208},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00678,"10":0,"11":0,"12":0.00678,"13":0.02712,"14":0.17628,"15":0.02712,"17":0.04068,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.32544,"10.1":0,"11.1":0.00678,"12.1":0.04746,"13.1":0.22374,"14.1":0.4068,"15.1":0.0678,"15.2-15.3":0.06102,"15.4":0.11526,"15.5":0.2034,"15.6":0.92208,"16.0":0.36612,"16.1":0.3051,"16.2":0.32544,"16.3":0.69834,"16.4":0.339,"16.5":1.85094,"16.6":2.60352},G:{"8":0,"17":0.20849,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00587,"5.0-5.1":0,"6.0-6.1":0.01175,"7.0-7.1":0.00294,"8.1-8.4":0.00294,"9.0-9.2":0.02056,"9.3":0.04405,"10.0-10.2":0,"10.3":0.04992,"11.0-11.2":0.02643,"11.3-11.4":0.02643,"12.0-12.1":0.01762,"12.2-12.5":0.23492,"13.0-13.1":0.00881,"13.2":0.00881,"13.3":0.02643,"13.4-13.7":0.05873,"14.0-14.4":0.15857,"14.5-14.8":0.29071,"15.0-15.1":0.10278,"15.2-15.3":0.14389,"15.4":0.14682,"15.5":0.25254,"15.6-15.7":1.56808,"16.0":0.72825,"16.1":1.83236,"16.2":0.8692,"16.3":1.72665,"16.4":0.2819,"16.5":5.84064,"16.6":14.63538},P:{"4":0.02145,"20":0.04289,"21":0.07506,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01072,"14.0":0,"15.0":0,"16.0":0.02145,"17.0":0.01072,"18.0":0.01072,"19.0":0.02145},I:{"0":0,"3":0.02873,"4":0.03694,"2.1":0.01642,"2.2":0.04515,"2.3":0.01231,"4.1":0.02463,"4.2-4.3":0.13544,"4.4":0,"4.4.3-4.4.4":0.13955},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00801,"9":0.01603,"10":0,"11":0.0641,"5.5":0},S:{"2.5":0.00322,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0.0161},L:{"0":21.89476},R:{_:"0"},M:{"0":0.27048},Q:{"13.1":0.02254},O:{"0":0.06118},H:{"0":0.18901}};
+module.exports={C:{"2":0,"3":0,"4":0.00689,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02066,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00689,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0.00689,"45":0,"46":0,"47":0,"48":0.02066,"49":0,"50":0.00689,"51":0,"52":0.02066,"53":0.00689,"54":0.00689,"55":0,"56":0.00689,"57":0.00689,"58":0,"59":0.00689,"60":0,"61":0,"62":0,"63":0.00689,"64":0,"65":0.00689,"66":0,"67":0,"68":0.00689,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00689,"78":0.06198,"79":0,"80":0,"81":0,"82":0,"83":0.00689,"84":0,"85":0,"86":0,"87":0,"88":0.00689,"89":0.00689,"90":0,"91":0.00689,"92":0,"93":0,"94":0.01377,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00689,"102":0.08264,"103":0,"104":0,"105":0.00689,"106":0,"107":0,"108":0.00689,"109":0.00689,"110":0.00689,"111":0.01377,"112":0.14463,"113":0.01377,"114":0.02066,"115":0.18595,"116":0.12397,"117":1.29476,"118":0.08953,"119":0,"120":0,"3.5":0,"3.6":0.00689},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.00689,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00689,"48":0.02066,"49":0.02755,"50":0,"51":0.00689,"52":0,"53":0,"54":0,"55":0,"56":0.06887,"57":0,"58":0.01377,"59":0,"60":0,"61":0,"62":0.00689,"63":0.00689,"64":0,"65":0.02755,"66":0.01377,"67":0.00689,"68":0.06198,"69":0.0551,"70":0.04821,"71":0.04132,"72":0.06198,"73":0.02066,"74":0.07576,"75":0.06887,"76":0.24105,"77":0.0551,"78":0.06887,"79":0.28237,"80":0.12397,"81":0.10331,"83":0.2135,"84":0.06887,"85":0.14463,"86":0.14463,"87":0.13085,"88":0.10331,"89":0.07576,"90":0.10331,"91":0.07576,"92":0.02066,"93":0.26171,"94":0.01377,"95":0.01377,"96":0.02066,"97":0.02066,"98":0.02755,"99":0.02755,"100":0.03444,"101":0.04132,"102":0.04132,"103":0.35124,"104":0.04821,"105":0.04821,"106":0.03444,"107":0.3168,"108":0.38567,"109":0.80578,"110":0.37879,"111":0.68181,"112":0.43388,"113":0.18595,"114":1.39117,"115":2.62395,"116":13.26436,"117":3.00273,"118":0.02066,"119":0.02755,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00689,"54":0.00689,"55":0.01377,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00689,"73":0.00689,"74":0,"75":0,"76":0.00689,"77":0.02066,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00689,"86":0,"87":0,"88":0,"89":0.01377,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02066,"96":0,"97":0.28925,"98":0.00689,"99":0.04132,"100":0.43388,"101":0.77823,"102":0.57851,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00689,"13":0,"14":0,"15":0.00689,"16":0,"17":0,"18":0.00689,"79":0.00689,"80":0.01377,"81":0.01377,"83":0.02066,"84":0.02066,"85":0.00689,"86":0.01377,"87":0.01377,"88":0.00689,"89":0.01377,"90":0.01377,"91":0,"92":0.00689,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.03444,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00689,"108":0.00689,"109":0.0551,"110":0.00689,"111":0.29614,"112":0.29614,"113":0.01377,"114":0.33746,"115":0.15151,"116":2.5964,"117":1.46693},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0.00689,"10":0,"11":0,"12":0.00689,"13":0.02755,"14":0.15151,"15":0.02755,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.41322,"10.1":0,"11.1":0.00689,"12.1":0.04132,"13.1":0.22727,"14.1":0.39945,"15.1":0.06887,"15.2-15.3":0.06198,"15.4":0.11019,"15.5":0.17906,"15.6":0.9022,"16.0":0.12397,"16.1":0.27548,"16.2":0.27548,"16.3":0.61294,"16.4":0.35124,"16.5":0.75068,"16.6":3.98069,"17.0":0.12397,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.0143,"7.0-7.1":0.00572,"8.1-8.4":0.00286,"9.0-9.2":0.0143,"9.3":0.04004,"10.0-10.2":0,"10.3":0.05148,"11.0-11.2":0.0286,"11.3-11.4":0.02288,"12.0-12.1":0.01716,"12.2-12.5":0.22308,"13.0-13.1":0.00858,"13.2":0.00858,"13.3":0.0286,"13.4-13.7":0.05148,"14.0-14.4":0.14872,"14.5-14.8":0.25168,"15.0-15.1":0.09724,"15.2-15.3":0.1287,"15.4":0.13156,"15.5":0.21164,"15.6-15.7":1.38994,"16.0":0.61489,"16.1":1.49576,"16.2":0.70355,"16.3":1.28984,"16.4":0.19734,"16.5":0.69497,"16.6":19.25892,"17.0":1.15828,"17.1":0.00572},P:{"4":0.0215,"20":0.0215,"21":0.05374,"22":0.8491,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01075,"14.0":0,"15.0":0,"16.0":0.0215,"17.0":0.01075,"18.0":0.01075,"19.0":0.0215},I:{"0":0,"3":0.03104,"4":0.03991,"2.1":0.0133,"2.2":0.04435,"2.3":0.0133,"4.1":0.02217,"4.2-4.3":0.13748,"4.4":0,"4.4.3-4.4.4":0.13305},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00814,"9":0.01628,"10":0,"11":0.06511,"5.5":0},S:{"2.5":0.00311,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0.01868},L:{"0":21.4041},R:{_:"0"},M:{"0":0.29574},Q:{"13.1":0.01245},O:{"0":0.05292},H:{"0":0.18862}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UY.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UY.js
index 48bd9ff4c3ea93..398f60dc71b547 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UY.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UY.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.02819,"53":0,"54":0,"55":0,"56":0,"57":0.01879,"58":0,"59":0,"60":0,"61":0,"62":0.0047,"63":0,"64":0,"65":0,"66":0.0094,"67":0,"68":0.0047,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0094,"79":0,"80":0,"81":0,"82":0,"83":0.0094,"84":0,"85":0,"86":0,"87":0,"88":0.0094,"89":0,"90":0,"91":0.0094,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0094,"101":0,"102":0.03758,"103":0,"104":0.0047,"105":0.0047,"106":0.0047,"107":0,"108":0.0047,"109":0.0047,"110":0.0094,"111":0.0047,"112":0.0094,"113":0.02349,"114":0.02349,"115":0.31946,"116":0.71879,"117":0.04698,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.01409,"39":0,"40":0,"41":0,"42":0,"43":0.0047,"44":0,"45":0,"46":0,"47":0.0047,"48":0,"49":0.03289,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.0047,"56":0.0047,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.0047,"63":0.0047,"64":0,"65":0.01879,"66":0,"67":0,"68":0.01409,"69":0.0094,"70":0.0047,"71":0.0094,"72":0.0047,"73":0.02819,"74":0.03289,"75":0.0094,"76":0.0094,"77":0.0047,"78":0.0047,"79":0.03758,"80":0.04698,"81":0.0094,"83":0.02819,"84":0.0047,"85":0.0094,"86":0.21141,"87":0.0094,"88":0.0094,"89":0.0047,"90":0.0094,"91":0.01409,"92":0.0047,"93":0.02819,"94":0.01879,"95":0.0047,"96":0.01879,"97":0.0047,"98":0.0094,"99":0.0094,"100":0.0047,"101":0.0094,"102":0.0094,"103":0.06107,"104":0.0047,"105":0.01879,"106":0.02819,"107":0.01879,"108":0.05168,"109":1.37651,"110":0.01879,"111":0.03289,"112":0.04228,"113":0.07987,"114":0.48389,"115":7.95841,"116":4.86243,"117":0.0047,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.0094,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.0047,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.0047,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.0047,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02819,"96":0,"97":0,"98":0,"99":0.0094,"100":0.96779,"101":0.37584,"102":0.0047,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.0047,"15":0,"16":0,"17":0,"18":0.0047,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0094,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.0047,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01879,"110":0,"111":0.0047,"112":0,"113":0.0094,"114":0.07047,"115":1.13692,"116":0.4698},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.0047,"14":0.01409,"15":0.0047,"17":0.0047,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.0047,"13.1":0.03758,"14.1":0.02349,"15.1":0.02349,"15.2-15.3":0.0047,"15.4":0.0094,"15.5":0.01879,"15.6":0.05168,"16.0":0.0047,"16.1":0.01879,"16.2":0.0094,"16.3":0.03758,"16.4":0.03289,"16.5":0.13154,"16.6":0.12215},G:{"8":0,"17":0.06776,"3.2":0.00234,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.03855,"6.0-6.1":0.00234,"7.0-7.1":0.03271,"8.1-8.4":0.00117,"9.0-9.2":0,"9.3":0.01869,"10.0-10.2":0,"10.3":0.03154,"11.0-11.2":0.0222,"11.3-11.4":0.00584,"12.0-12.1":0.0035,"12.2-12.5":0.20328,"13.0-13.1":0.00234,"13.2":0,"13.3":0.00467,"13.4-13.7":0.01636,"14.0-14.4":0.05024,"14.5-14.8":0.17874,"15.0-15.1":0.02921,"15.2-15.3":0.03037,"15.4":0.10398,"15.5":0.14486,"15.6-15.7":1.17176,"16.0":0.31076,"16.1":0.54791,"16.2":0.34931,"16.3":0.70096,"16.4":0.12267,"16.5":2.06431,"16.6":5.41371},P:{"4":0.03059,"20":0.05098,"21":0.20392,"22":1.25413,"5.0-5.4":0.0102,"6.2-6.4":0,"7.2-7.4":0.13255,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0102,"12.0":0.0102,"13.0":0.0102,"14.0":0,"15.0":0.0102,"16.0":0.04078,"17.0":0.04078,"18.0":0.0102,"19.0":0.04078},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02562,"4.2-4.3":0.01281,"4.4":0,"4.4.3-4.4.4":0.20493},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0047,"9":0,"10":0,"11":0.02349,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":63.62263},R:{_:"0"},M:{"0":0.22268},Q:{"13.1":0},O:{"0":0.04242},H:{"0":0.15059}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0.00499,"51":0,"52":0.01497,"53":0,"54":0,"55":0,"56":0,"57":0.00499,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00499,"66":0.00998,"67":0,"68":0.00499,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00499,"75":0,"76":0,"77":0,"78":0.00499,"79":0,"80":0,"81":0,"82":0,"83":0.00499,"84":0,"85":0,"86":0.00499,"87":0,"88":0.00998,"89":0,"90":0,"91":0.00499,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00499,"101":0,"102":0.02995,"103":0,"104":0.00499,"105":0.01996,"106":0.00499,"107":0.00998,"108":0,"109":0.00499,"110":0.00499,"111":0.00499,"112":0.00499,"113":0.01996,"114":0.01996,"115":0.16969,"116":0.06488,"117":0.67379,"118":0.10481,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.05989,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00499,"48":0,"49":0.03494,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00499,"56":0.00499,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00499,"63":0.00499,"64":0,"65":0.00499,"66":0,"67":0,"68":0.00998,"69":0,"70":0.00499,"71":0.00998,"72":0.00499,"73":0.01996,"74":0.02496,"75":0.01996,"76":0.02496,"77":0.00998,"78":0.00499,"79":0.02496,"80":0.05989,"81":0.00499,"83":0.01497,"84":0.00499,"85":0.00998,"86":0.18467,"87":0.00998,"88":0.00998,"89":0.00998,"90":0.01996,"91":0.02995,"92":0.00499,"93":0.02496,"94":0.00998,"95":0.00499,"96":0.01996,"97":0.00499,"98":0.00998,"99":0.00998,"100":0.00499,"101":0.00998,"102":0.00998,"103":0.05989,"104":0.00499,"105":0.01996,"106":0.03494,"107":0.01497,"108":0.03993,"109":1.40746,"110":0.01497,"111":0.01996,"112":0.02995,"113":0.03993,"114":0.1647,"115":0.33939,"116":11.18483,"117":3.78817,"118":0.00499,"119":0.00499,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00998,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00499,"73":0,"74":0,"75":0,"76":0,"77":0.00998,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00499,"86":0,"87":0,"88":0,"89":0.00998,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02995,"96":0,"97":0,"98":0,"99":0.00998,"100":0.24955,"101":0.52905,"102":0.89339,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00499,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00499,"90":0,"91":0,"92":0.00998,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00499,"104":0,"105":0,"106":0,"107":0,"108":0.00499,"109":0.07487,"110":0,"111":0,"112":0.00499,"113":0.00499,"114":0.01996,"115":0.03993,"116":0.90836,"117":0.87842},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01497,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.01497,"10.1":0,"11.1":0,"12.1":0.00499,"13.1":0.02496,"14.1":0.01996,"15.1":0.01996,"15.2-15.3":0,"15.4":0.00998,"15.5":0.01497,"15.6":0.03494,"16.0":0.00499,"16.1":0.01497,"16.2":0.00998,"16.3":0.03494,"16.4":0.02995,"16.5":0.0549,"16.6":0.2246,"17.0":0.01497,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.02993,"6.0-6.1":0,"7.0-7.1":0.01822,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03124,"10.0-10.2":0,"10.3":0.02213,"11.0-11.2":0.01692,"11.3-11.4":0.00521,"12.0-12.1":0.0039,"12.2-12.5":0.15488,"13.0-13.1":0.0026,"13.2":0.0026,"13.3":0.12624,"13.4-13.7":0.01822,"14.0-14.4":0.05206,"14.5-14.8":0.14577,"15.0-15.1":0.01822,"15.2-15.3":0.02213,"15.4":0.09891,"15.5":0.13405,"15.6-15.7":1.04379,"16.0":0.40997,"16.1":0.51929,"16.2":0.31886,"16.3":0.58697,"16.4":0.0846,"16.5":0.37352,"16.6":7.7412,"17.0":0.7913,"17.1":0.0026},P:{"4":0.03135,"20":0.03135,"21":0.16721,"22":1.18095,"5.0-5.4":0.01045,"6.2-6.4":0,"7.2-7.4":0.14631,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01045,"12.0":0,"13.0":0.01045,"14.0":0,"15.0":0,"16.0":0.03135,"17.0":0.0209,"18.0":0.01045,"19.0":0.0418},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01851,"4.2-4.3":0.06477,"4.4":0,"4.4.3-4.4.4":0.16656},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00499,"9":0,"10":0,"11":0.02995,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":60.15025},R:{_:"0"},M:{"0":0.20537},Q:{"13.1":0},O:{"0":0.02004},H:{"0":0.16123}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UZ.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UZ.js
index 7744046aff23ed..dc4dfcb34e79bc 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UZ.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/UZ.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.01222,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0.00917,"65":0,"66":0,"67":0.00917,"68":0.00306,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00306,"86":0.00306,"87":0,"88":0,"89":0.00306,"90":0,"91":0.00306,"92":0,"93":0,"94":0.00306,"95":0,"96":0,"97":0,"98":0,"99":0.00306,"100":0,"101":0,"102":0.02139,"103":0,"104":0,"105":0.00306,"106":0,"107":0.01222,"108":0.00611,"109":0.00306,"110":0.00917,"111":0.00611,"112":0,"113":0.00306,"114":0.00306,"115":0.07943,"116":0.16803,"117":0.00306,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00306,"36":0,"37":0,"38":0,"39":0,"40":0.00306,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00306,"47":0,"48":0,"49":0.01222,"50":0,"51":0,"52":0,"53":0.00306,"54":0,"55":0,"56":0.00611,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00917,"67":0,"68":0,"69":0.00306,"70":0,"71":0.00306,"72":0.00611,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00611,"80":0,"81":0.00306,"83":0.00917,"84":0.00306,"85":0.00306,"86":0.00917,"87":0.02139,"88":0.00306,"89":0.00611,"90":0.00306,"91":0.00306,"92":0.00306,"93":0.00611,"94":0.00306,"95":0.00306,"96":0.00306,"97":0.00306,"98":0.00611,"99":0.00306,"100":0.00917,"101":0.00306,"102":0.01833,"103":0.01528,"104":0.00306,"105":0.00917,"106":0.0611,"107":0.01222,"108":0.04277,"109":0.79736,"110":0.00917,"111":0.01222,"112":0.02139,"113":0.02139,"114":0.15886,"115":2.91753,"116":1.7108,"117":0.00306,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0.00306,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00917,"54":0,"55":0.00306,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00306,"70":0,"71":0.00917,"72":0.00917,"73":0,"74":0.00306,"75":0,"76":0.00306,"77":0.00306,"78":0,"79":0.01222,"80":0,"81":0,"82":0,"83":0,"84":0.00306,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00611,"93":0,"94":0.00917,"95":0.02139,"96":0.00306,"97":0.00306,"98":0.00917,"99":0.01528,"100":0.03972,"101":0.07027,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.01222,"79":0,"80":0,"81":0,"83":0,"84":0.00306,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00917,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00611,"107":0.00306,"108":0.00306,"109":0.03666,"110":0,"111":0.00611,"112":0.00611,"113":0.00611,"114":0.01528,"115":0.40326,"116":0.14053},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00306,"15":0,"17":0.00306,_:"0","3.1":0,"3.2":0,"5.1":0.03972,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00611,"14.1":0.00611,"15.1":0.00306,"15.2-15.3":0.00306,"15.4":0,"15.5":0.01222,"15.6":0.02139,"16.0":0,"16.1":0.01222,"16.2":0.00611,"16.3":0.0275,"16.4":0.00917,"16.5":0.05499,"16.6":0.05499},G:{"8":0,"17":0.16814,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00309,"6.0-6.1":0,"7.0-7.1":0.03198,"8.1-8.4":0.00516,"9.0-9.2":0.00722,"9.3":0.04642,"10.0-10.2":0,"10.3":0.03198,"11.0-11.2":0.02476,"11.3-11.4":0.00206,"12.0-12.1":0.00619,"12.2-12.5":0.35278,"13.0-13.1":0.00206,"13.2":0.00309,"13.3":0.02682,"13.4-13.7":0.0165,"14.0-14.4":0.07324,"14.5-14.8":0.12791,"15.0-15.1":0.06189,"15.2-15.3":0.05777,"15.4":0.07014,"15.5":0.08768,"15.6-15.7":1.09651,"16.0":0.50442,"16.1":0.54258,"16.2":0.30017,"16.3":0.58384,"16.4":0.24447,"16.5":2.06718,"16.6":3.75991},P:{"4":0.42748,"20":0.22392,"21":0.54961,"5.0-5.4":0.01018,"6.2-6.4":0.05089,"7.2-7.4":0.31552,"8.2":0,"9.2":0.02036,"10.1":0,"11.1-11.2":0.05089,"12.0":0.02036,"13.0":0.05089,"14.0":0.03053,"15.0":0.04071,"16.0":0.08142,"17.0":0.0916,"18.0":0.10178,"19.0":0.20356},I:{"0":0,"3":0,"4":0.00128,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00385,"4.2-4.3":0.0167,"4.4":0,"4.4.3-4.4.4":0.06038},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00733,"9":0,"10":0,"11":0.04399,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":64.61835},R:{_:"0"},M:{"0":0.15279},Q:{"13.1":0.00695},O:{"0":4.799},H:{"0":0.56546}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00688,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00344,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00688,"73":0,"74":0.00688,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.03094,"85":0.00344,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00344,"102":0.02063,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00344,"110":0.00344,"111":0,"112":0.00344,"113":0.00344,"114":0,"115":0.04126,"116":0.02063,"117":0.16159,"118":0.01031,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00344,"47":0,"48":0,"49":0.01031,"50":0,"51":0.02063,"52":0,"53":0.00344,"54":0,"55":0,"56":0.00688,"57":0,"58":0,"59":0,"60":0,"61":0.02063,"62":0,"63":0,"64":0,"65":0,"66":0.00344,"67":0.05157,"68":0,"69":0.00688,"70":0,"71":0.02407,"72":0.01375,"73":0.00344,"74":0.02063,"75":0,"76":0.01031,"77":0.05157,"78":0.03438,"79":0.11689,"80":0.07907,"81":0.05845,"83":0.06876,"84":0.01719,"85":0.02407,"86":0.04126,"87":0.07907,"88":0.0275,"89":0.0722,"90":0.18909,"91":0.00344,"92":0.00688,"93":0.00344,"94":0.00344,"95":0.03782,"96":0.01719,"97":0.00688,"98":0.00344,"99":0.00688,"100":0.01375,"101":0.01719,"102":0.01375,"103":0.0275,"104":0.08939,"105":0.12377,"106":0.06532,"107":0.07564,"108":0.0722,"109":0.81824,"110":0.01719,"111":0.03094,"112":0.03782,"113":0.02063,"114":0.11689,"115":0.06876,"116":3.15265,"117":0.8595,"118":0.00344,"119":0.00344,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00688,"54":0.02407,"55":0,"56":0.00344,"57":0,"58":0,"60":0.02407,"62":0.00344,"63":0.0722,"64":0,"65":0.06188,"66":0,"67":0.01719,"68":0.01719,"69":0,"70":0,"71":0,"72":0.01375,"73":0.08595,"74":0.08939,"75":0.00344,"76":0,"77":0.01719,"78":0,"79":0.00688,"80":0,"81":0,"82":0.00344,"83":0,"84":0,"85":0,"86":0,"87":0.00344,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00688,"95":0.03094,"96":0,"97":0,"98":0,"99":0.04126,"100":0.01375,"101":0.04813,"102":0.04469,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0.01375,"17":0,"18":0.04813,"79":0,"80":0,"81":0,"83":0,"84":0.00344,"85":0.00688,"86":0,"87":0.03782,"88":0,"89":0.00344,"90":0.08939,"91":0.00688,"92":0.00688,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.01375,"103":0,"104":0,"105":0.00688,"106":0,"107":0.00688,"108":0,"109":0.0275,"110":0.01375,"111":0.06532,"112":0.01375,"113":0.01719,"114":0.01031,"115":0.08595,"116":0.31286,"117":0.22003},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00344,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.19597,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00344,"13.1":0.00344,"14.1":0.00688,"15.1":0.00344,"15.2-15.3":0,"15.4":0,"15.5":0.00688,"15.6":0.01375,"16.0":0,"16.1":0.00688,"16.2":0.00344,"16.3":0.02063,"16.4":0.00688,"16.5":0.01031,"16.6":0.05845,"17.0":0.00688,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.01662,"8.1-8.4":0,"9.0-9.2":0.00831,"9.3":0.01454,"10.0-10.2":0,"10.3":0.01869,"11.0-11.2":0.01038,"11.3-11.4":0,"12.0-12.1":0.00415,"12.2-12.5":0.21184,"13.0-13.1":0.00208,"13.2":0,"13.3":12.59639,"13.4-13.7":0.01869,"14.0-14.4":0.04154,"14.5-14.8":0.07685,"15.0-15.1":0.05192,"15.2-15.3":0.04777,"15.4":0.04569,"15.5":0.09346,"15.6-15.7":0.71653,"16.0":0.30115,"16.1":0.35307,"16.2":0.21392,"16.3":0.46523,"16.4":0.20146,"16.5":0.38215,"16.6":3.82773,"17.0":0.94291,"17.1":0},P:{"4":0.32281,"20":0.16141,"21":0.3329,"22":1.73511,"5.0-5.4":0.01009,"6.2-6.4":0.05044,"7.2-7.4":0.21184,"8.2":0,"9.2":0.02018,"10.1":0,"11.1-11.2":0.05044,"12.0":0.01009,"13.0":0.07061,"14.0":0.03026,"15.0":0.02018,"16.0":0.06053,"17.0":0.07061,"18.0":0.06053,"19.0":0.15132},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00387,"4.2-4.3":0.0116,"4.4":0,"4.4.3-4.4.4":0.04485},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.00352,"9":0,"10":0,"11":0.14079,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":54.88901},R:{_:"0"},M:{"0":0.07218},Q:{"13.1":0.00656},O:{"0":3.76003},H:{"0":0.3976}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VA.js
index baf2316b2ed48f..67f680fdaa1aa2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.0385,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00963,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.04813,"95":0,"96":0.21177,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.15402,"103":0,"104":0,"105":0.00963,"106":0,"107":0,"108":0,"109":0.0385,"110":0,"111":0,"112":0,"113":0,"114":0,"115":2.85892,"116":5.5542,"117":0.35616,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.10589,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00963,"89":0,"90":0,"91":0,"92":0,"93":0.62569,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.04813,"104":0,"105":0,"106":0,"107":0,"108":0,"109":1.4439,"110":0.17327,"111":0.01925,"112":0.01925,"113":0.08663,"114":0.99148,"115":32.62251,"116":24.89284,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00963,"100":0,"101":0.00963,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.24065,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.56793,"115":11.76297,"116":6.07401},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0385,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.08663,"12.1":0,"13.1":0.11551,"14.1":0.06738,"15.1":0.08663,"15.2-15.3":0,"15.4":0,"15.5":0.02888,"15.6":0.13476,"16.0":0,"16.1":0,"16.2":0.34654,"16.3":0,"16.4":0.09626,"16.5":0.47167,"16.6":1.7038},G:{"8":0,"17":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.43702,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0.09367,"15.0-15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.01566,"15.6-15.7":0.03132,"16.0":0.01566,"16.1":0.17168,"16.2":0.18734,"16.3":0.09367,"16.4":0,"16.5":1.38878,"16.6":0.57738},P:{"4":0,"20":0,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02888,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":4.42253},R:{_:"0"},M:{"0":0.04376},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.00962,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0.00962,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00962,"92":0,"93":0.02885,"94":0,"95":0,"96":0.06731,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.09615,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.49998,"116":0.09615,"117":8.49966,"118":0.71151,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.01923,"67":0.04808,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00962,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0.06731,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.75959,"94":0,"95":0,"96":0.00962,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00962,"103":0.09615,"104":0,"105":0,"106":0.01923,"107":0.00962,"108":0,"109":1.36533,"110":0.00962,"111":0.00962,"112":0,"113":0.00962,"114":0.73074,"115":0.3846,"116":45.86355,"117":13.42254,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.9615,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.00962,"102":0.00962,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.11538,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.43268,"110":0.00962,"111":0,"112":0,"113":0,"114":0,"115":0.02885,"116":7.20164,"117":7.0478},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00962,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.25961,"12.1":0.00962,"13.1":0.17307,"14.1":0.10577,"15.1":0.00962,"15.2-15.3":0,"15.4":0.05769,"15.5":0.00962,"15.6":0.3173,"16.0":0.01923,"16.1":0.05769,"16.2":0.07692,"16.3":0.25961,"16.4":0.06731,"16.5":0.08654,"16.6":1.95185,"17.0":0.02885,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.07007,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.05009,"14.0-14.4":0.01013,"14.5-14.8":0,"15.0-15.1":0,"15.2-15.3":0.01013,"15.4":0.01013,"15.5":0.01998,"15.6-15.7":0.17026,"16.0":0.08021,"16.1":0.19024,"16.2":0.06022,"16.3":0.1303,"16.4":0.05009,"16.5":0.01998,"16.6":1.81265,"17.0":0.12017,"17.1":0},P:{"4":0,"20":0,"21":0.03014,"22":0.18084,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02885,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":4.39139},R:{_:"0"},M:{"0":0.07431},Q:{"13.1":0},O:{"0":0},H:{"0":0.03791}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VC.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VC.js
index 1f651ca51c18ab..dde783f2f54852 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VC.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VC.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0.00379,"115":0.19708,"116":0.47754,"117":0.02653,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.01516,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00379,"50":0.00379,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00758,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00379,"71":0,"72":0,"73":0,"74":0.03032,"75":0,"76":0.01137,"77":0,"78":0,"79":0.00758,"80":0,"81":0.00758,"83":0.08717,"84":0,"85":0,"86":0,"87":0.02274,"88":0.01895,"89":0,"90":0,"91":0.00379,"92":0,"93":0.0379,"94":0,"95":0.10612,"96":0,"97":0,"98":0,"99":0.00379,"100":0,"101":0,"102":0,"103":0.12507,"104":0.01516,"105":0.01895,"106":0.00758,"107":0,"108":0.00758,"109":0.34489,"110":0,"111":0.01516,"112":0.01516,"113":0.03411,"114":0.50786,"115":3.83548,"116":1.38714,"117":0.03411,"118":0.00758,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00379,"72":0.01137,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00758,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00379,"96":0,"97":0,"98":0,"99":0,"100":0.07201,"101":0.10991,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00379,"79":0,"80":0,"81":0,"83":0,"84":0.02274,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00758,"108":0,"109":0.00379,"110":0,"111":0.00379,"112":0.01137,"113":0.00379,"114":0.12886,"115":1.58422,"116":0.41311},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00379,"14":0.00758,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00379,"13.1":0.04927,"14.1":0.02653,"15.1":0.00379,"15.2-15.3":0.00379,"15.4":0.00379,"15.5":0,"15.6":0.08338,"16.0":0.00379,"16.1":0.01137,"16.2":0.00758,"16.3":0.10233,"16.4":0.00758,"16.5":0.16676,"16.6":0.33731},G:{"8":0,"17":0.40603,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00346,"6.0-6.1":0,"7.0-7.1":0.00346,"8.1-8.4":0.02246,"9.0-9.2":0,"9.3":0.05356,"10.0-10.2":0,"10.3":0.03628,"11.0-11.2":0.01555,"11.3-11.4":0.03628,"12.0-12.1":0.00173,"12.2-12.5":0.2298,"13.0-13.1":0,"13.2":0,"13.3":0.00173,"13.4-13.7":0.00864,"14.0-14.4":0.02246,"14.5-14.8":0.08812,"15.0-15.1":0.01037,"15.2-15.3":0.00864,"15.4":0.02073,"15.5":1.4168,"15.6-15.7":2.44139,"16.0":0.45614,"16.1":1.45136,"16.2":0.30582,"16.3":0.44577,"16.4":0.07257,"16.5":3.31912,"16.6":6.39979},P:{"4":0.19624,"20":0.11992,"21":1.02481,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.30526,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.14173,"12.0":0,"13.0":0.03271,"14.0":0.05451,"15.0":0.0109,"16.0":0.05451,"17.0":0.11992,"18.0":0.04361,"19.0":0.11992},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.23632,"4.2-4.3":0.07463,"4.4":0,"4.4.3-4.4.4":0.4602},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00379,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":61.84082},R:{_:"0"},M:{"0":0.05589},Q:{"13.1":0},O:{"0":0.26082},H:{"0":0.26457}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0.00863,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00431,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00431,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00431,"110":0,"111":0,"112":0.00431,"113":0,"114":0,"115":0.06901,"116":0.13802,"117":0.74184,"118":0.05176,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0.01294,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.00431,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00431,"72":0,"73":0,"74":0.00431,"75":0.00863,"76":0.01294,"77":0,"78":0,"79":0.03019,"80":0,"81":0.00431,"83":0.09489,"84":0,"85":0,"86":0,"87":0.02157,"88":0.02157,"89":0,"90":0,"91":0.00863,"92":0,"93":0.0345,"94":0,"95":0.00863,"96":0,"97":0,"98":0,"99":0.00431,"100":0.01294,"101":0,"102":0.00431,"103":0.10351,"104":0,"105":0.00863,"106":0.01725,"107":0,"108":0.01294,"109":0.44424,"110":0.00863,"111":0.01294,"112":0.05607,"113":0.01294,"114":0.23722,"115":0.34504,"116":6.25385,"117":1.71226,"118":0.09057,"119":0.00431,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00431,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.01725,"73":0,"74":0,"75":0,"76":0,"77":0.01294,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00431,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.03019,"101":0.04744,"102":0.05176,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00431,"79":0,"80":0,"81":0,"83":0,"84":0.00431,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00431,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01294,"110":0,"111":0.00863,"112":0.00431,"113":0,"114":0.02157,"115":0.0647,"116":1.18176,"117":0.97905},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.02157,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00431,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02588,"14.1":0.02588,"15.1":0,"15.2-15.3":0.00863,"15.4":0.00431,"15.5":0.00863,"15.6":0.37523,"16.0":0.01294,"16.1":0.03882,"16.2":0.00863,"16.3":0.02588,"16.4":0.16821,"16.5":0.03882,"16.6":0.52187,"17.0":0.08626,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0334,"6.0-6.1":0,"7.0-7.1":0.00167,"8.1-8.4":0.02338,"9.0-9.2":0,"9.3":0.02171,"10.0-10.2":0,"10.3":0.04341,"11.0-11.2":0.01837,"11.3-11.4":0.01002,"12.0-12.1":0.01002,"12.2-12.5":0.13525,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.01169,"14.0-14.4":0.03173,"14.5-14.8":0.08182,"15.0-15.1":0.05343,"15.2-15.3":0.02672,"15.4":0.00501,"15.5":1.27736,"15.6-15.7":1.27235,"16.0":0.17365,"16.1":0.59276,"16.2":0.21039,"16.3":0.89332,"16.4":0.07848,"16.5":0.51261,"16.6":9.44915,"17.0":1.2423,"17.1":0},P:{"4":0.14134,"20":0.10873,"21":0.34792,"22":3.64231,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.41316,"8.2":0,"9.2":0.02175,"10.1":0.01087,"11.1-11.2":0.08698,"12.0":0,"13.0":0.04349,"14.0":0,"15.0":0,"16.0":0.02175,"17.0":0.13047,"18.0":0.02175,"19.0":0.06524},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.16241,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.64965},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00863,"11":0.00431,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":60.56651},R:{_:"0"},M:{"0":0.1308},Q:{"13.1":0},O:{"0":0.13649},H:{"0":0.09153}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VE.js
index 6518c119422f4d..688414be3dfdda 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0.00972,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0.07292,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00486,"41":0,"42":0,"43":0,"44":0,"45":0.00486,"46":0,"47":0.00486,"48":0,"49":0,"50":0,"51":0,"52":0.30138,"53":0,"54":0,"55":0,"56":0.00486,"57":0.00486,"58":0.00486,"59":0,"60":0.01944,"61":0.01944,"62":0.00486,"63":0.00486,"64":0,"65":0.00486,"66":0.00972,"67":0.00486,"68":0.01944,"69":0,"70":0.00486,"71":0,"72":0.00486,"73":0,"74":0,"75":0.00486,"76":0,"77":0,"78":0.01944,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00486,"85":0,"86":0,"87":0,"88":0.00972,"89":0.00486,"90":0,"91":0.01458,"92":0,"93":0.00486,"94":0,"95":0.00486,"96":0,"97":0,"98":0,"99":0.00972,"100":0.00972,"101":0.00486,"102":0.04861,"103":0.00486,"104":0.00486,"105":0.00972,"106":0.00486,"107":0.00486,"108":0.00486,"109":0.00972,"110":0.00972,"111":0.00972,"112":0.01458,"113":0.03403,"114":0.02917,"115":1.00623,"116":0.82151,"117":0.02917,"118":0.00486,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00486,"47":0.00486,"48":0.00486,"49":0.17014,"50":0,"51":0,"52":0,"53":0.00486,"54":0,"55":0,"56":0.00486,"57":0,"58":0,"59":0.00486,"60":0,"61":0,"62":0,"63":0.00486,"64":0.00486,"65":0.00972,"66":0.00972,"67":0.00486,"68":0.00486,"69":0.00486,"70":0.00486,"71":0.00972,"72":0.00486,"73":0.01944,"74":0.00972,"75":0.00972,"76":0.01944,"77":0.00486,"78":0.00486,"79":0.02917,"80":0.00972,"81":0.01458,"83":0.02431,"84":0.00486,"85":0.01944,"86":0.00972,"87":0.02917,"88":0.01458,"89":0.00972,"90":0.02431,"91":0.01944,"92":0.00972,"93":0.02431,"94":0.00972,"95":0.00486,"96":0.01944,"97":0.02917,"98":0.02431,"99":0.01458,"100":0.01944,"101":0.02431,"102":0.03889,"103":0.06805,"104":0.01458,"105":0.02917,"106":0.02917,"107":0.03403,"108":0.09722,"109":4.25824,"110":0.02431,"111":0.02917,"112":0.0875,"113":0.14583,"114":0.34027,"115":4.9728,"116":2.83396,"117":0.00486,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00972,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00486,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00486,"70":0.00972,"71":0.03889,"72":0.02431,"73":0,"74":0,"75":0,"76":0,"77":0.00486,"78":0,"79":0.01458,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00486,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00486,"95":0.20416,"96":0,"97":0,"98":0,"99":0.01944,"100":0.62707,"101":0.38402,"102":0.01944,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0.00486,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00486,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01944,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00486,"108":0.00486,"109":0.07292,"110":0.00486,"111":0.00486,"112":0.00486,"113":0.00972,"114":0.04375,"115":0.91387,"116":0.31597},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00486,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01458,"14.1":0.02431,"15.1":0.00486,"15.2-15.3":0.00486,"15.4":0.00486,"15.5":0.00972,"15.6":0.03889,"16.0":0.00486,"16.1":0.00972,"16.2":0.00972,"16.3":0.01944,"16.4":0.00972,"16.5":0.05833,"16.6":0.05833},G:{"8":0.00046,"17":0.03425,"3.2":0,"4.0-4.1":0.00046,"4.2-4.3":0,"5.0-5.1":0.0037,"6.0-6.1":0.00231,"7.0-7.1":0.02823,"8.1-8.4":0.00555,"9.0-9.2":0.00694,"9.3":0.05878,"10.0-10.2":0.00046,"10.3":0.17171,"11.0-11.2":0.01342,"11.3-11.4":0.00602,"12.0-12.1":0.00787,"12.2-12.5":0.13839,"13.0-13.1":0.01342,"13.2":0.00231,"13.3":0.00787,"13.4-13.7":0.02036,"14.0-14.4":0.02962,"14.5-14.8":0.07405,"15.0-15.1":0.01944,"15.2-15.3":0.01574,"15.4":0.04952,"15.5":0.03471,"15.6-15.7":0.50633,"16.0":0.1407,"16.1":0.23095,"16.2":0.11987,"16.3":0.26196,"16.4":0.06156,"16.5":0.82614,"16.6":1.73328},P:{"4":0.0826,"20":0.03097,"21":0.09292,"5.0-5.4":0,"6.2-6.4":0.07227,"7.2-7.4":0.0826,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01032,"12.0":0,"13.0":0.02065,"14.0":0.01032,"15.0":0,"16.0":0.02065,"17.0":0.0413,"18.0":0.01032,"19.0":0.0413},I:{"0":0,"3":0,"4":0.00313,"2.1":0,"2.2":0,"2.3":0,"4.1":0.01878,"4.2-4.3":0.02191,"4.4":0,"4.4.3-4.4.4":0.59464},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0.0054,"9":0.0054,"10":0,"11":0.03781,"5.5":0},S:{"2.5":0.00514,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":72.15375},R:{_:"0"},M:{"0":0.13875},Q:{"13.1":0},O:{"0":0.05653},H:{"0":0.4622}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0.00461,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00461,"50":0,"51":0,"52":0.19379,"53":0,"54":0,"55":0,"56":0.00461,"57":0.00461,"58":0,"59":0,"60":0.00461,"61":0.01846,"62":0.00461,"63":0,"64":0,"65":0.00461,"66":0.00461,"67":0.00461,"68":0.01846,"69":0,"70":0.00461,"71":0,"72":0.00461,"73":0,"74":0,"75":0.00923,"76":0,"77":0,"78":0.01384,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00923,"89":0,"90":0.00461,"91":0.00923,"92":0,"93":0,"94":0,"95":0,"96":0.00461,"97":0,"98":0,"99":0.00461,"100":0.00461,"101":0,"102":0.02307,"103":0.00461,"104":0.00461,"105":0.00461,"106":0.00461,"107":0.00461,"108":0.00461,"109":0.01384,"110":0.00461,"111":0.00461,"112":0.01384,"113":0.01384,"114":0.00923,"115":0.51215,"116":0.05998,"117":0.56291,"118":0.05075,"119":0.00923,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00461,"47":0.00461,"48":0,"49":0.06921,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00923,"57":0.00461,"58":0,"59":0.00461,"60":0,"61":0.00923,"62":0,"63":0.00461,"64":0.00461,"65":0.00461,"66":0.0323,"67":0.00461,"68":0.01384,"69":0.01384,"70":0.00461,"71":0.00923,"72":0.00461,"73":0.00461,"74":0.00923,"75":0.00923,"76":0.01384,"77":0.00461,"78":0.00461,"79":0.02307,"80":0.02307,"81":0.02307,"83":0.02768,"84":0.00923,"85":0.0323,"86":0.01384,"87":0.0323,"88":0.02307,"89":0.00461,"90":0.01384,"91":0.02307,"92":0.01384,"93":0.01846,"94":0.01384,"95":0.00461,"96":0.01846,"97":0.02307,"98":0.02768,"99":0.01384,"100":0.01384,"101":0.01846,"102":0.02307,"103":0.05998,"104":0.01846,"105":0.02768,"106":0.0323,"107":0.04614,"108":0.07382,"109":3.79271,"110":0.01384,"111":0.03691,"112":0.05537,"113":0.09228,"114":0.21686,"115":0.13842,"116":5.60601,"117":1.58722,"118":0.00461,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00461,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00461,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.00461,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00461,"70":0.00461,"71":0.00461,"72":0.03691,"73":0.01384,"74":0,"75":0,"76":0,"77":0.02307,"78":0,"79":0.01384,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00461,"86":0,"87":0,"88":0,"89":0.00461,"90":0,"91":0,"92":0,"93":0,"94":0.00461,"95":0.17533,"96":0,"97":0,"98":0.00461,"99":0.00923,"100":0.12919,"101":0.32298,"102":0.37835,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.0646,"18":0.00461,"79":0,"80":0,"81":0.00461,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01384,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00923,"108":0.00461,"109":0.0646,"110":0,"111":0.00461,"112":0.00461,"113":0.00461,"114":0.01384,"115":0.02768,"116":0.61366,"117":0.48908},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00461,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00461,"6.1":0,"7.1":0,"9.1":0.03691,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00461,"14.1":0.01384,"15.1":0,"15.2-15.3":0,"15.4":0.00461,"15.5":0.00461,"15.6":0.01846,"16.0":0,"16.1":0.00923,"16.2":0.00461,"16.3":0.00923,"16.4":0.00461,"16.5":0.01846,"16.6":0.05998,"17.0":0.00461,"17.1":0},G:{"8":0.00093,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00326,"6.0-6.1":0.00093,"7.0-7.1":0.01535,"8.1-8.4":0.00465,"9.0-9.2":0.00279,"9.3":0.05069,"10.0-10.2":0.00047,"10.3":0.04278,"11.0-11.2":0.01256,"11.3-11.4":0.00837,"12.0-12.1":0.00558,"12.2-12.5":0.13346,"13.0-13.1":0.02558,"13.2":0.00186,"13.3":0.08277,"13.4-13.7":0.01581,"14.0-14.4":0.03395,"14.5-14.8":0.07161,"15.0-15.1":0.01721,"15.2-15.3":0.03255,"15.4":0.05487,"15.5":0.03581,"15.6-15.7":0.46362,"16.0":0.13393,"16.1":0.19298,"16.2":0.11951,"16.3":0.20461,"16.4":0.07347,"16.5":0.12788,"16.6":2.18885,"17.0":0.41619,"17.1":0},P:{"4":0.12409,"20":0.02068,"21":0.06205,"22":0.5791,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.08273,"8.2":0,"9.2":0.01034,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.02068,"14.0":0.01034,"15.0":0,"16.0":0.03102,"17.0":0.04136,"18.0":0.01034,"19.0":0.04136},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.02362,"4.2-4.3":0.03247,"4.4":0,"4.4.3-4.4.4":0.49299},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02768,"5.5":0},S:{"2.5":0.01077,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":74.98551},R:{_:"0"},M:{"0":0.13465},Q:{"13.1":0},O:{"0":0.04847},H:{"0":0.46402}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VG.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VG.js
index ba1646d84d0443..200ec70d75f4d2 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VG.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VG.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.02837,"76":0,"77":0,"78":0.00709,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.03191,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00355,"111":0,"112":0.00355,"113":0,"114":0,"115":0.11702,"116":0.52481,"117":0.02837,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01064,"50":0,"51":0,"52":0,"53":0.00355,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00355,"73":0,"74":0,"75":0.14184,"76":0.00709,"77":0,"78":0.00355,"79":0,"80":0,"81":0.06028,"83":0.00355,"84":0,"85":0,"86":0,"87":0.01418,"88":0,"89":0,"90":0,"91":0,"92":0.00709,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00355,"101":0,"102":0,"103":0.03191,"104":0,"105":0,"106":0.00355,"107":0,"108":0.00355,"109":0.20567,"110":0,"111":0.01064,"112":0.02837,"113":0.01418,"114":0.63828,"115":3.38643,"116":1.73399,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.01773,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00709,"72":0.00709,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00355,"96":0,"97":0,"98":0.02837,"99":0,"100":0.08865,"101":0.06028,"102":0.00355,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00355,"108":0,"109":0.01773,"110":0,"111":0,"112":0,"113":0,"114":0.03901,"115":1.47868,"116":0.45743},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00355,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00355,"6.1":0,"7.1":0,"9.1":0.00355,"10.1":0,"11.1":0,"12.1":0.00355,"13.1":0.00709,"14.1":0.11347,"15.1":0.00355,"15.2-15.3":0.00355,"15.4":0.01064,"15.5":0.03901,"15.6":0.07801,"16.0":0.00709,"16.1":0.03546,"16.2":0.95033,"16.3":0.26595,"16.4":0.01064,"16.5":0.58154,"16.6":0.37588},G:{"8":0,"17":0.19045,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.17259,"10.0-10.2":0,"10.3":0.08927,"11.0-11.2":0.01488,"11.3-11.4":0.11605,"12.0-12.1":0,"12.2-12.5":0.16069,"13.0-13.1":0,"13.2":0,"13.3":0.00893,"13.4-13.7":0,"14.0-14.4":0.06844,"14.5-14.8":0.13391,"15.0-15.1":0.05654,"15.2-15.3":0.02678,"15.4":0.10415,"15.5":0.35114,"15.6-15.7":2.26752,"16.0":1.77057,"16.1":1.03854,"16.2":0.63384,"16.3":2.01161,"16.4":0.18747,"16.5":6.70735,"16.6":13.63787},P:{"4":0.43686,"20":0.22883,"21":0.58248,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.27044,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0104,"12.0":0,"13.0":0,"14.0":0.0312,"15.0":0.0104,"16.0":0.0312,"17.0":0.0104,"18.0":0.0208,"19.0":0.09361},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.27304},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00355,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":49.33149},R:{_:"0"},M:{"0":0.23234},Q:{"13.1":0},O:{"0":0.41306},H:{"0":0.28718}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0.01143,"76":0,"77":0,"78":0.01524,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00381,"95":0,"96":0,"97":0,"98":0,"99":0.03049,"100":0,"101":0,"102":0.0343,"103":0.00381,"104":0.00762,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0.00381,"112":0,"113":0,"114":0.00381,"115":0.04192,"116":0.09528,"117":0.55641,"118":0.01143,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0.00381,"63":0.00381,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00381,"73":0,"74":0,"75":0.20198,"76":0.00762,"77":0.00381,"78":0,"79":0.00381,"80":0,"81":0,"83":0,"84":0,"85":0.00762,"86":0,"87":0.01143,"88":0,"89":0,"90":0,"91":0,"92":0.00381,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.01524,"99":0,"100":0,"101":0,"102":0.00381,"103":0.08765,"104":0.00762,"105":0.19055,"106":0,"107":0.54878,"108":0.27058,"109":0.22104,"110":0.00762,"111":0.52973,"112":0.20579,"113":0.00762,"114":0.31631,"115":0.35442,"116":4.39408,"117":0.99467,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0.01524,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.0343,"73":0.00762,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.15625,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00381,"100":0.01143,"101":0.05335,"102":0.06479,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.00762,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.00381,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.01143,"110":0.29345,"111":0,"112":0.00381,"113":0.00762,"114":0.01524,"115":0.08003,"116":1.13568,"117":0.83842},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00381,"14":0.01906,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02287,"14.1":0.04573,"15.1":0.00762,"15.2-15.3":0.02668,"15.4":0.01906,"15.5":0.01143,"15.6":0.11433,"16.0":0,"16.1":0.04954,"16.2":0.02668,"16.3":0.05335,"16.4":0.00762,"16.5":0.16387,"16.6":1.36053,"17.0":0.01143,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.0136,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00816,"9.3":0.32378,"10.0-10.2":0,"10.3":0.04353,"11.0-11.2":0.02177,"11.3-11.4":0.0789,"12.0-12.1":0.0136,"12.2-12.5":0.09795,"13.0-13.1":0,"13.2":0.00816,"13.3":0.01905,"13.4-13.7":0.05442,"14.0-14.4":0.06258,"14.5-14.8":0.117,"15.0-15.1":0.02721,"15.2-15.3":0.0517,"15.4":0.06258,"15.5":0.06258,"15.6-15.7":1.07201,"16.0":1.36042,"16.1":1.18357,"16.2":0.58226,"16.3":1.62162,"16.4":0.16325,"16.5":0.43261,"16.6":18.02289,"17.0":1.19717,"17.1":0.00816},P:{"4":0.24477,"20":0.12239,"21":0.65272,"22":3.78375,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.8057,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.0102,"12.0":0,"13.0":0.0408,"14.0":0,"15.0":0.0408,"16.0":0,"17.0":0.0306,"18.0":0,"19.0":0.06119},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.21198},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":49.19946},R:{_:"0"},M:{"0":0.43942},Q:{"13.1":0.00619},O:{"0":0.64985},H:{"0":0.22266}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VI.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VI.js
index 07efb4f633db14..d2e6c4f36d01a4 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VI.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VI.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00492,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0295,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.05409,"107":0,"108":0,"109":0.00492,"110":0,"111":0,"112":0,"113":0.00492,"114":0.01475,"115":0.21635,"116":1.87338,"117":0.01967,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00492,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.00492,"74":0,"75":0,"76":0.04425,"77":0,"78":0,"79":0,"80":0.00492,"81":0,"83":0.00983,"84":0,"85":0,"86":0,"87":0,"88":0.00983,"89":0,"90":0,"91":0,"92":0,"93":0.059,"94":0,"95":0.00983,"96":0,"97":0,"98":0,"99":0.00492,"100":0,"101":0.00492,"102":0.00492,"103":0.04425,"104":0.00492,"105":0.16718,"106":0.00492,"107":0.01475,"108":0.02459,"109":0.27535,"110":0.01967,"111":0.059,"112":0.06392,"113":0.04917,"114":0.91948,"115":4.82358,"116":1.99139,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00492,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00492,"96":0,"97":0.00492,"98":0,"99":0,"100":0.13276,"101":0.059,"102":0.00492,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0.00492,"97":0,"98":0,"99":0,"100":0.00492,"101":0,"102":0,"103":0,"104":0.00983,"105":0,"106":0,"107":0,"108":0.00983,"109":0.059,"110":0,"111":0.00492,"112":0.00492,"113":0.00983,"114":0.10326,"115":4.00244,"116":1.30301},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00492,"14":0.01475,"15":0,"17":0.01475,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.01475,"12.1":0.00983,"13.1":0.00983,"14.1":0.47203,"15.1":0.00983,"15.2-15.3":0.00983,"15.4":0.05409,"15.5":0.62938,"15.6":0.39828,"16.0":0.06884,"16.1":0.16718,"16.2":0.059,"16.3":0.4622,"16.4":0.08359,"16.5":2.15365,"16.6":1.42101},G:{"8":0,"17":1.47877,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.17832,"9.3":0,"10.0-10.2":0.0087,"10.3":0.05654,"11.0-11.2":0.0261,"11.3-11.4":0.03045,"12.0-12.1":0,"12.2-12.5":0.20442,"13.0-13.1":0,"13.2":0.00435,"13.3":0,"13.4-13.7":0.06089,"14.0-14.4":0.04784,"14.5-14.8":0.25661,"15.0-15.1":0.14353,"15.2-15.3":0.10438,"15.4":0.11743,"15.5":0.40884,"15.6-15.7":2.21815,"16.0":1.10473,"16.1":2.27469,"16.2":0.82202,"16.3":4.20579,"16.4":0.24356,"16.5":9.2597,"16.6":20.21562},P:{"4":0.05201,"20":0.22883,"21":0.13522,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.0104,"14.0":0,"15.0":0,"16.0":0.06241,"17.0":0.20803,"18.0":0.0104,"19.0":0.04161},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.66888},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01967,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":28.40428},R:{_:"0"},M:{"0":0.46764},Q:{"13.1":0},O:{"0":0},H:{"0":0.02406}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.03245,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00541,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00541,"103":0,"104":0,"105":0,"106":0.04868,"107":0.00541,"108":0,"109":0,"110":0,"111":0.01082,"112":0,"113":0,"114":0.00541,"115":0.03786,"116":0.43813,"117":2.92086,"118":0.20554,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00541,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0.01082,"74":0,"75":0,"76":0.02164,"77":0,"78":0,"79":0,"80":0.00541,"81":0,"83":0.01623,"84":0,"85":0,"86":0,"87":0.00541,"88":0.01623,"89":0.00541,"90":0.00541,"91":0,"92":0,"93":0.04868,"94":0.01082,"95":0.01623,"96":0,"97":0.00541,"98":0,"99":0.00541,"100":0,"101":0.01623,"102":0,"103":0.12441,"104":0,"105":0.11359,"106":0,"107":0,"108":0.03786,"109":0.29209,"110":0.01623,"111":0.09736,"112":0.12441,"113":0.02705,"114":0.54631,"115":0.51386,"116":6.35558,"117":1.59566,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00541,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.03786,"101":0.05409,"102":0.12982,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0.01623,"105":0,"106":0,"107":0,"108":0,"109":0.04327,"110":0,"111":0,"112":0,"113":0.01082,"114":0.03786,"115":0.119,"116":3.52126,"117":2.73155},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.01082,"14":0.01623,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.18932,"14.1":0.16768,"15.1":0.01623,"15.2-15.3":0.00541,"15.4":0.01082,"15.5":0.05409,"15.6":0.35699,"16.0":0.07573,"16.1":0.05409,"16.2":0.04327,"16.3":0.51386,"16.4":0.06491,"16.5":3.01281,"16.6":2.59091,"17.0":0.04868,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00802,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.12025,"11.0-11.2":0.01202,"11.3-11.4":0.01603,"12.0-12.1":0,"12.2-12.5":0.10421,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.06012,"14.0-14.4":0.02004,"14.5-14.8":0.19239,"15.0-15.1":0.03207,"15.2-15.3":0.08016,"15.4":0.06413,"15.5":0.3447,"15.6-15.7":0.84573,"16.0":0.9299,"16.1":2.38888,"16.2":0.6373,"16.3":3.87191,"16.4":0.12826,"16.5":0.91787,"16.6":27.27972,"17.0":1.51109,"17.1":0.01603},P:{"4":0.02076,"20":0.01038,"21":0.3425,"22":2.13806,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.01038,"14.0":0,"15.0":0,"16.0":0.05189,"17.0":0.31137,"18.0":0.01038,"19.0":0.01038},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.70694},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.02164,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":26.64841},R:{_:"0"},M:{"0":0.51419},Q:{"13.1":0},O:{"0":0},H:{"0":0.0565}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VN.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VN.js
index ed00858401d3e1..17e947571fa759 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VN.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VN.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01208,"116":0.02684,"117":0.00134,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00134,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00134,"50":0,"51":0,"52":0.00134,"53":0.00134,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00134,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00671,"80":0,"81":0.00134,"83":0.00134,"84":0.00134,"85":0.00268,"86":0.00134,"87":0.00268,"88":0,"89":0,"90":0,"91":0.00134,"92":0.00134,"93":0,"94":0,"95":0,"96":0.00134,"97":0,"98":0,"99":0.00134,"100":0.00268,"101":0.00134,"102":0.00134,"103":0.00268,"104":0.00134,"105":0.00268,"106":0.00268,"107":0.00268,"108":0.00403,"109":0.1087,"110":0.00268,"111":0.00403,"112":0.00537,"113":0.00403,"114":0.02281,"115":0.54485,"116":0.31269,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00134,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00134,"37":0.00268,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00134,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00134,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00268,"72":0.00268,"73":0,"74":0,"75":0,"76":0,"77":0.00134,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00134,"96":0,"97":0,"98":0,"99":0,"100":0.0161,"101":0.01208,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00134,"110":0,"111":0,"112":0,"113":0.00134,"114":0.00403,"115":0.07113,"116":0.02281},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00134,"14":0.00403,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00268,"14.1":0.00939,"15.1":0.00134,"15.2-15.3":0.00134,"15.4":0.00268,"15.5":0.00403,"15.6":0.01745,"16.0":0.00134,"16.1":0.00403,"16.2":0.00268,"16.3":0.00939,"16.4":0.00268,"16.5":0.0161,"16.6":0.02952},G:{"8":0.0034,"17":0.13617,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00681,"8.1-8.4":0,"9.0-9.2":0.0034,"9.3":0.05106,"10.0-10.2":0.01362,"10.3":0.11575,"11.0-11.2":0.02723,"11.3-11.4":0.03745,"12.0-12.1":0.05787,"12.2-12.5":1.08257,"13.0-13.1":0.02723,"13.2":0.01702,"13.3":0.09872,"13.4-13.7":0.32341,"14.0-14.4":0.93278,"14.5-14.8":1.86896,"15.0-15.1":0.46639,"15.2-15.3":0.60256,"15.4":0.60256,"15.5":0.90554,"15.6-15.7":5.95752,"16.0":1.23576,"16.1":2.30812,"16.2":1.24938,"16.3":2.37961,"16.4":0.69107,"16.5":4.23154,"16.6":8.58224},P:{"4":0.22505,"20":0.09206,"21":0.21482,"22":1.96404,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.05115,"8.2":0,"9.2":0.01023,"10.1":0,"11.1-11.2":0.03069,"12.0":0.01023,"13.0":0.02046,"14.0":0.03069,"15.0":0.02046,"16.0":0.04092,"17.0":0.05115,"18.0":0.04092,"19.0":0.07161},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.02403},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00268,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":55.57233},R:{_:"0"},M:{"0":0.07792},Q:{"13.1":0},O:{"0":2.20779},H:{"0":0.40164}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00158,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.00946,"116":0.00315,"117":0.041,"118":0.00315,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0.00315,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.01104,"50":0,"51":0,"52":0.00158,"53":0.00158,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00315,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0.00158,"75":0.00158,"76":0,"77":0.00158,"78":0,"79":0.01577,"80":0.00158,"81":0.00315,"83":0.00158,"84":0.00315,"85":0.00315,"86":0.00946,"87":0.00473,"88":0.00158,"89":0.00158,"90":0.00315,"91":0.00946,"92":0.00158,"93":0,"94":0,"95":0.00158,"96":0.00158,"97":0.00158,"98":0,"99":0.00158,"100":0.00158,"101":0.00158,"102":0.00315,"103":0.00473,"104":0.00789,"105":0.00315,"106":0.00473,"107":0.00631,"108":0.00789,"109":0.14666,"110":0.00473,"111":0.00631,"112":0.00789,"113":0.00473,"114":0.01262,"115":0.01577,"116":0.88627,"117":0.22867,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0.00158,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0.00158,"37":0.00315,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0.00158,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00158,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00631,"73":0.00158,"74":0,"75":0,"76":0,"77":0.00946,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00158,"96":0,"97":0,"98":0,"99":0,"100":0.00315,"101":0.01262,"102":0.01262,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00158,"91":0.00631,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00158,"108":0.00158,"109":0.00158,"110":0,"111":0,"112":0,"113":0,"114":0.00158,"115":0.00315,"116":0.07885,"117":0.05835},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00158,"14":0.00473,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0.00158,"10.1":0,"11.1":0.00158,"12.1":0,"13.1":0.00315,"14.1":0.01104,"15.1":0.00158,"15.2-15.3":0.00158,"15.4":0.00315,"15.5":0.00473,"15.6":0.0205,"16.0":0.00158,"16.1":0.00473,"16.2":0.00315,"16.3":0.00946,"16.4":0.00315,"16.5":0.00631,"16.6":0.0552,"17.0":0.00315,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00969,"8.1-8.4":0.00646,"9.0-9.2":0.00969,"9.3":0.08723,"10.0-10.2":0.01292,"10.3":0.126,"11.0-11.2":0.02908,"11.3-11.4":0.04846,"12.0-12.1":0.05169,"12.2-12.5":1.04031,"13.0-13.1":0.02585,"13.2":0.01615,"13.3":0.54923,"13.4-13.7":0.294,"14.0-14.4":0.83031,"14.5-14.8":1.61861,"15.0-15.1":0.40708,"15.2-15.3":0.53308,"15.4":0.53308,"15.5":0.77538,"15.6-15.7":5.43092,"16.0":1.02092,"16.1":1.94169,"16.2":1.03708,"16.3":1.94492,"16.4":0.54277,"16.5":1.34077,"16.6":11.02661,"17.0":0.70754,"17.1":0},P:{"4":0.26598,"20":0.08184,"21":0.16368,"22":2.046,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.05115,"8.2":0,"9.2":0.01023,"10.1":0,"11.1-11.2":0.03069,"12.0":0.01023,"13.0":0.02046,"14.0":0.03069,"15.0":0.02046,"16.0":0.04092,"17.0":0.05115,"18.0":0.04092,"19.0":0.07161},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.03631},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00315,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":55.7412},R:{_:"0"},M:{"0":0.10108},Q:{"13.1":0.00842},O:{"0":2.51005},H:{"0":0.45454}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VU.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VU.js
index ba46c7455f9376..4ecd1d2958fadd 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VU.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/VU.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00333,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00333,"100":0,"101":0,"102":0.00333,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.01,"113":0.01,"114":0.04334,"115":0.22338,"116":0.48676,"117":0.00667,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00333,"41":0,"42":0.00333,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00667,"59":0,"60":0.00333,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01,"69":0.00333,"70":0.00333,"71":0.00333,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00333,"79":0.00333,"80":0,"81":0.29006,"83":0,"84":0,"85":0,"86":0,"87":0.02,"88":0.03001,"89":0,"90":0,"91":0,"92":0.00333,"93":0,"94":0.00333,"95":0,"96":0,"97":0,"98":0.00667,"99":0,"100":0,"101":0,"102":0,"103":0.01667,"104":0,"105":0,"106":0.02,"107":0.00667,"108":0.00667,"109":0.38008,"110":0.01667,"111":0.00333,"112":0.26339,"113":0.02,"114":0.31673,"115":3.354,"116":1.63033,"117":0,"118":0.00333,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00667,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00333,"69":0,"70":0.00667,"71":0,"72":0.01,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.00333,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00333,"99":0.00333,"100":0.02667,"101":0.1467,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0.00333,"16":0.01,"17":0,"18":0.01667,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.01,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00667,"101":0,"102":0.00333,"103":0,"104":0,"105":0.00333,"106":0,"107":0,"108":0.04001,"109":0.01,"110":0.02667,"111":0.00333,"112":0.01334,"113":0.01334,"114":0.05334,"115":0.62346,"116":0.17337},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.01667,"14.1":0.03334,"15.1":0,"15.2-15.3":0.00333,"15.4":0.00667,"15.5":0,"15.6":0.04334,"16.0":0.00667,"16.1":0.02667,"16.2":0,"16.3":0.02,"16.4":0.02334,"16.5":0.1467,"16.6":0.21004},G:{"8":0,"17":0.00285,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.03708,"10.0-10.2":0.00285,"10.3":0.01141,"11.0-11.2":0.0057,"11.3-11.4":0.00856,"12.0-12.1":0.00856,"12.2-12.5":0.18767,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.00856,"14.0-14.4":0.15972,"14.5-14.8":0.1369,"15.0-15.1":0.08842,"15.2-15.3":0.14261,"15.4":0.06845,"15.5":0.05419,"15.6-15.7":0.27609,"16.0":0.10838,"16.1":0.68053,"16.2":0.12264,"16.3":0.34169,"16.4":0.06275,"16.5":1.54303,"16.6":1.64799},P:{"4":0.03045,"20":0.1421,"21":0.19285,"5.0-5.4":0,"6.2-6.4":0.01015,"7.2-7.4":0.21315,"8.2":0,"9.2":0,"10.1":0.8526,"11.1-11.2":0.01015,"12.0":0,"13.0":0,"14.0":0.03045,"15.0":0.11165,"16.0":0.09135,"17.0":0.1015,"18.0":0.15225,"19.0":0.49735},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.15335},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00667,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":79.91502},R:{_:"0"},M:{"0":0.05999},Q:{"13.1":0},O:{"0":0.19998},H:{"0":0.20195}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0.00303,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00303,"110":0,"111":0,"112":0.02723,"113":0.00303,"114":0,"115":0.22695,"116":0.03934,"117":0.3722,"118":0.04842,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00303,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0.0121,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.00303,"68":0.00303,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00303,"79":0,"80":0,"81":0.00605,"83":0.00303,"84":0,"85":0,"86":0,"87":0.02118,"88":0.04539,"89":0,"90":0,"91":0.00605,"92":0,"93":0.00303,"94":0.00303,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00303,"101":0,"102":0.00303,"103":0.00605,"104":0,"105":0.00303,"106":0.00303,"107":0,"108":0.00605,"109":0.11499,"110":0.02118,"111":0.01513,"112":0.22998,"113":0.01513,"114":0.12104,"115":0.21182,"116":3.45267,"117":0.72624,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.00303,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0.00303,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00303,"69":0,"70":0,"71":0.00303,"72":0.00605,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0.03329,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00908,"96":0,"97":0,"98":0,"99":0,"100":0.00605,"101":0.03631,"102":0.05144,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00605,"14":0,"15":0,"16":0.00303,"17":0.00605,"18":0.00908,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0.00303,"90":0.00303,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.01816,"101":0,"102":0,"103":0.00303,"104":0,"105":0,"106":0,"107":0.00303,"108":0.02421,"109":0.00605,"110":0,"111":0.00303,"112":0.00303,"113":0.05447,"114":0.03026,"115":0.02421,"116":0.4418,"117":0.36009},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.01513,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00908,"14.1":0.05447,"15.1":0,"15.2-15.3":0,"15.4":0.0121,"15.5":0.04842,"15.6":0.03026,"16.0":0,"16.1":0.00303,"16.2":0.00605,"16.3":0.02421,"16.4":0.00908,"16.5":0.00605,"16.6":0.10894,"17.0":0.02421,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02006,"10.0-10.2":0,"10.3":0.02865,"11.0-11.2":0.00573,"11.3-11.4":0.02579,"12.0-12.1":0.00287,"12.2-12.5":0.23668,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.08367,"14.5-14.8":0.08367,"15.0-15.1":0.05158,"15.2-15.3":0.03782,"15.4":0.15301,"15.5":0.06934,"15.6-15.7":0.54958,"16.0":0.13582,"16.1":0.31232,"16.2":0.20229,"16.3":0.2831,"16.4":0.03782,"16.5":0.32665,"16.6":2.74673,"17.0":0.18224,"17.1":0},P:{"4":0.08146,"20":0.10182,"21":0.05091,"22":1.68004,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.23419,"8.2":0,"9.2":0,"10.1":0.20364,"11.1-11.2":0.05091,"12.0":0,"13.0":0.01018,"14.0":0.08146,"15.0":0.04073,"16.0":0.16291,"17.0":0.02036,"18.0":0.08146,"19.0":0.25455},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.15355},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00908,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":81.68476},R:{_:"0"},M:{"0":0.26501},Q:{"13.1":0},O:{"0":0.25106},H:{"0":0.2509}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/WF.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/WF.js
index 03681d855a364d..977ebe119df320 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/WF.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/WF.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.02879,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.0096,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.03838,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.0096,"91":0.0096,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.04606,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.05565,"110":0,"111":0,"112":0.0096,"113":0,"114":0.0096,"115":0.14009,"116":0.72154,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0.03838,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.0096,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.01919,"106":0,"107":0,"108":0,"109":0.0096,"110":0.05565,"111":0,"112":0,"113":0.0096,"114":0.3934,"115":0.61792,"116":0.15928,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.0096,"96":0,"97":0,"98":0,"99":0,"100":0.0096,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.02879,"109":0.0096,"110":0,"111":0,"112":0,"113":0,"114":0.03838,"115":0.13049,"116":0.02879},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0.04606,"15.2-15.3":0.06525,"15.4":0,"15.5":0,"15.6":0.02879,"16.0":0,"16.1":0.05565,"16.2":0.0096,"16.3":0.05565,"16.4":0.01919,"16.5":0.13049,"16.6":0.19766},G:{"8":0,"17":0.05711,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0.17296,"14.0-14.4":0.17296,"14.5-14.8":0.34592,"15.0-15.1":0.92191,"15.2-15.3":0.74895,"15.4":0.05711,"15.5":0,"15.6-15.7":0.28881,"16.0":0.57599,"16.1":1.15361,"16.2":0.74895,"16.3":1.15361,"16.4":0.80769,"16.5":4.72868,"16.6":4.38275},P:{"4":0,"20":0,"21":0.24356,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.10148,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0.15222,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.63934},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":47.93399},R:{_:"0"},M:{"0":0.09697},Q:{"13.1":0},O:{"0":0.04849},H:{"0":23.12002}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0.10076,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.56953,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.07448,"92":0.10076,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.81487,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.86744,"116":0.10076,"117":1.3844,"118":0.12267,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.02629,"100":0,"101":0,"102":0,"103":0.02629,"104":0,"105":0.04819,"106":0,"107":0,"108":0,"109":6.5014,"110":0.02629,"111":0,"112":0,"113":0,"114":0.02629,"115":0.71848,"116":3.4347,"117":0.46877,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0.04819,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0.02629,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0.02629,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.04819,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.02629,"116":1.97583,"117":0.12267},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.02629,"14.1":0.04819,"15.1":0.04819,"15.2-15.3":0.12267,"15.4":0.07448,"15.5":0,"15.6":0.10076,"16.0":0.07448,"16.1":0,"16.2":0,"16.3":0,"16.4":0,"16.5":0.22343,"16.6":0.31981,"17.0":0.02629,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.15658,"14.5-14.8":0.07757,"15.0-15.1":0.46831,"15.2-15.3":0.54588,"15.4":0.07757,"15.5":0,"15.6-15.7":0,"16.0":0,"16.1":1.40493,"16.2":0.78004,"16.3":1.95225,"16.4":0,"16.5":2.1864,"16.6":6.24604,"17.0":0.46831,"17.1":0},P:{"4":0,"20":0.06029,"21":0.7335,"22":2.8938,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.06029},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":57.26833},R:{_:"0"},M:{"0":0},Q:{"13.1":0},O:{"0":0},H:{"0":2.36195}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/WS.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/WS.js
index aad4b8662c65c6..689b523a3f390d 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/WS.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/WS.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.0103,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00343,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.02746,"111":0,"112":0,"113":0,"114":0,"115":0.05834,"116":0.20592,"117":0.00686,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00686,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.00686,"70":0,"71":0.00343,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00343,"79":0.00686,"80":0.00343,"81":0.01373,"83":0,"84":0,"85":0,"86":0,"87":0.04462,"88":0.01716,"89":0,"90":0,"91":0.03089,"92":0.00686,"93":0.05148,"94":0.01373,"95":0.02059,"96":0,"97":0,"98":0.00686,"99":0.01716,"100":0.00343,"101":0,"102":0,"103":0.04805,"104":0,"105":0.00343,"106":0,"107":0.01716,"108":0.0103,"109":0.30888,"110":0,"111":0.04118,"112":0.04805,"113":0.0103,"114":0.38095,"115":3.38738,"116":1.46203,"117":0.0103,"118":0.04805,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.03432,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0.00343,"65":0,"66":0,"67":0,"68":0,"69":0.05834,"70":0.01373,"71":0.0103,"72":0.01373,"73":0,"74":0,"75":0.00343,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.01716,"101":0.03089,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00343,"15":0.00686,"16":0.00343,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0.00343,"85":0,"86":0,"87":0,"88":0,"89":0.0103,"90":0,"91":0,"92":0.0103,"93":0,"94":0.00343,"95":0.00343,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0.00343,"104":0.00343,"105":0,"106":0.00686,"107":0,"108":0.0103,"109":0.07207,"110":0.00343,"111":0.00343,"112":0.00686,"113":0.02746,"114":0.06178,"115":1.03646,"116":0.2677},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00343,"14.1":0.05491,"15.1":0.00686,"15.2-15.3":0.0103,"15.4":0.00343,"15.5":0.05148,"15.6":0.54569,"16.0":0,"16.1":0.02402,"16.2":0.0103,"16.3":0.02746,"16.4":0.01716,"16.5":0.10639,"16.6":0.18876},G:{"8":0,"17":0.05022,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0.00901,"9.3":0.01932,"10.0-10.2":0,"10.3":0.1159,"11.0-11.2":0.20347,"11.3-11.4":0.00901,"12.0-12.1":0.00644,"12.2-12.5":0.40823,"13.0-13.1":0,"13.2":0,"13.3":0.02189,"13.4-13.7":0.13264,"14.0-14.4":0.13522,"14.5-14.8":0.20476,"15.0-15.1":0.11204,"15.2-15.3":0.27687,"15.4":0.13135,"15.5":0.22665,"15.6-15.7":3.12029,"16.0":0.41467,"16.1":0.7379,"16.2":0.73532,"16.3":0.63745,"16.4":0.39535,"16.5":2.57041,"16.6":2.19953},P:{"4":0.03059,"20":0.21416,"21":1.38697,"5.0-5.4":0.0102,"6.2-6.4":0,"7.2-7.4":0.23456,"8.2":0,"9.2":0.03059,"10.1":0,"11.1-11.2":0.05099,"12.0":0,"13.0":0.05099,"14.0":0.0102,"15.0":0.04079,"16.0":2.02946,"17.0":0.03059,"18.0":0.06119,"19.0":0.15297},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.12266},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00686,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":68.10914},R:{_:"0"},M:{"0":0.04598},Q:{"13.1":0.02627},O:{"0":0.24302},H:{"0":0.96381}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0.00307,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.00307,"107":0,"108":0,"109":0,"110":0.01227,"111":0,"112":0,"113":0.00307,"114":0,"115":0.03988,"116":0.00614,"117":0.14726,"118":0.02148,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.01227,"69":0.00307,"70":0.00614,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.01534,"80":0,"81":0.00614,"83":0,"84":0,"85":0,"86":0,"87":0.00307,"88":0.02148,"89":0,"90":0,"91":0.00307,"92":0.00307,"93":0.12579,"94":0,"95":0.00614,"96":0.00614,"97":0,"98":0,"99":0.00307,"100":0,"101":0.00307,"102":0,"103":0.03068,"104":0,"105":0.00614,"106":0.00307,"107":0.00307,"108":0.0092,"109":0.52156,"110":0.01227,"111":0.00307,"112":0,"113":0.03375,"114":0.19942,"115":0.20556,"116":3.2122,"117":0.65655,"118":0.0092,"119":0.0092,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0.02454,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.07056,"70":0.00614,"71":0,"72":0.01534,"73":0.02148,"74":0,"75":0,"76":0,"77":0.00307,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0092,"101":0.01534,"102":0.01534,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0.00307,"14":0,"15":0.00307,"16":0.0092,"17":0,"18":0.0092,"79":0,"80":0,"81":0,"83":0,"84":0.00307,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.0092,"93":0,"94":0.00614,"95":0,"96":0,"97":0,"98":0.00307,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00307,"109":0.09511,"110":0,"111":0.00307,"112":0.00614,"113":0.01534,"114":0.01841,"115":0.09818,"116":0.65655,"117":0.47247},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00307,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00307,"12.1":0.00307,"13.1":0.0092,"14.1":0.00307,"15.1":0.00614,"15.2-15.3":0,"15.4":0.00614,"15.5":0.03682,"15.6":0.77927,"16.0":0,"16.1":0.00614,"16.2":0,"16.3":0.0092,"16.4":0.00307,"16.5":0.03375,"16.6":0.30373,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00344,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.031,"10.0-10.2":0,"10.3":0.11024,"11.0-11.2":0.17397,"11.3-11.4":0.00344,"12.0-12.1":0.01722,"12.2-12.5":0.48574,"13.0-13.1":0.00344,"13.2":0.01206,"13.3":0,"13.4-13.7":0.06029,"14.0-14.4":0.1378,"14.5-14.8":0.30144,"15.0-15.1":0.12402,"15.2-15.3":0.04823,"15.4":0.11541,"15.5":0.37895,"15.6-15.7":4.21323,"16.0":0.37206,"16.1":1.24881,"16.2":0.86642,"16.3":0.64766,"16.4":0.91292,"16.5":1.18163,"16.6":5.52233,"17.0":0.18258,"17.1":0},P:{"4":0.07131,"20":0.20373,"21":2.26144,"22":4.37008,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.16299,"8.2":0.02037,"9.2":0.01019,"10.1":0,"11.1-11.2":0.04075,"12.0":0,"13.0":0.03056,"14.0":0.06112,"15.0":0.02037,"16.0":0.81493,"17.0":0.01019,"18.0":0.09168,"19.0":0.17317},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00988,"4.4":0,"4.4.3-4.4.4":0.11853},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00307,"5.5":0},S:{"2.5":0.01386,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":60.84102},R:{_:"0"},M:{"0":0.0208},Q:{"13.1":0},O:{"0":0.15944},H:{"0":1.91633}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/YE.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/YE.js
index a6c6d18b0114f2..a6707fd8d7fb14 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/YE.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/YE.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0.00221,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00221,"64":0,"65":0,"66":0,"67":0,"68":0.00663,"69":0.00221,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0.00221,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.16361,"103":0.00221,"104":0,"105":0,"106":0.00221,"107":0,"108":0,"109":0,"110":0.00221,"111":0,"112":0,"113":0.00221,"114":0.00663,"115":0.05749,"116":0.11055,"117":0.00221,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00221,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00221,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00221,"58":0.00884,"59":0,"60":0,"61":0,"62":0,"63":0.00221,"64":0,"65":0,"66":0,"67":0.00221,"68":0.00221,"69":0,"70":0,"71":0,"72":0,"73":0.00442,"74":0,"75":0,"76":0,"77":0,"78":0.00221,"79":0.03095,"80":0.00442,"81":0,"83":0,"84":0.00221,"85":0,"86":0,"87":0.00884,"88":0.00221,"89":0.00221,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00663,"100":0.00221,"101":0,"102":0,"103":0,"104":0.00221,"105":0,"106":0.00442,"107":0.01548,"108":0,"109":0.19457,"110":0.00221,"111":0.00221,"112":0.01327,"113":0.01106,"114":0.08402,"115":0.59034,"116":0.33386,"117":0.00221,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00221,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00442,"72":0,"73":0,"74":0,"75":0.00663,"76":0.00221,"77":0.00442,"78":0,"79":0.01106,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00221,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.01327,"101":0.00442,"102":0.00221,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.06191},B:{"12":0,"13":0,"14":0,"15":0.00221,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00442,"106":0,"107":0,"108":0,"109":0,"110":0.00221,"111":0.00221,"112":0.00442,"113":0,"114":0.0199,"115":0.33386,"116":0.05306},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.02432,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00663,"16.0":0,"16.1":0,"16.2":0.00884,"16.3":0.00884,"16.4":0,"16.5":0.01106,"16.6":0.01106},G:{"8":0,"17":0.0296,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.07435,"5.0-5.1":0,"6.0-6.1":0.00217,"7.0-7.1":0.23677,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.00217,"10.0-10.2":0,"10.3":0.00072,"11.0-11.2":0,"11.3-11.4":0.00722,"12.0-12.1":0.00433,"12.2-12.5":0.29741,"13.0-13.1":0.01083,"13.2":0.00217,"13.3":0.01083,"13.4-13.7":0.24038,"14.0-14.4":0.12199,"14.5-14.8":0.18046,"15.0-15.1":0.05125,"15.2-15.3":0.09817,"15.4":0.08013,"15.5":0.22883,"15.6-15.7":0.51902,"16.0":0.18624,"16.1":0.32917,"16.2":0.43456,"16.3":0.35155,"16.4":0.27503,"16.5":1.23221,"16.6":2.21106},P:{"4":0.10117,"20":0.17199,"21":0.29339,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03035,"8.2":0,"9.2":0.02023,"10.1":0,"11.1-11.2":0.04047,"12.0":0,"13.0":0.03035,"14.0":0.11129,"15.0":0.01012,"16.0":0.14164,"17.0":0.20234,"18.0":0.04047,"19.0":0.04047},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00365,"4.2-4.3":0.01095,"4.4":0,"4.4.3-4.4.4":0.07424},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00221,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":66.30299},R:{_:"0"},M:{"0":0.20251},Q:{"13.1":0},O:{"0":13.48276},H:{"0":2.19011}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0.00216,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00216,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00216,"103":0.00216,"104":0,"105":0,"106":0.00216,"107":0,"108":0,"109":0,"110":0.00433,"111":0.00216,"112":0,"113":0,"114":0.00216,"115":0.06922,"116":0.00433,"117":0.08003,"118":0.01298,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0.00216,"58":0.00649,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0.01298,"68":0.00216,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00216,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0.00216,"87":0.00649,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0.00216,"99":0.00216,"100":0.00216,"101":0,"102":0,"103":0.00433,"104":0,"105":0.00216,"106":0,"107":0.01298,"108":0.00216,"109":0.19467,"110":0,"111":0,"112":0.00649,"113":0.00649,"114":0.01298,"115":0.02812,"116":0.87602,"117":0.15357,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00216,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0.00216,"71":0.00216,"72":0.00216,"73":0,"74":0,"75":0.00649,"76":0,"77":0.01947,"78":0,"79":0.00649,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00433,"101":0.00216,"102":0.00433,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.1168},B:{"12":0.00216,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00433,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0.00433,"106":0,"107":0,"108":0,"109":0,"110":0,"111":0,"112":0.00216,"113":0,"114":0.00865,"115":0.03028,"116":0.20332,"117":0.16006},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.01947,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00433,"14.1":0,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0,"15.6":0.00433,"16.0":0,"16.1":0.00433,"16.2":0,"16.3":0.00216,"16.4":0,"16.5":0,"16.6":0.02596,"17.0":0,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.04563,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.29661,"8.1-8.4":0,"9.0-9.2":0.00067,"9.3":0.00268,"10.0-10.2":0,"10.3":0.00201,"11.0-11.2":0.00067,"11.3-11.4":0.00738,"12.0-12.1":0.00336,"12.2-12.5":0.33621,"13.0-13.1":0,"13.2":0.00067,"13.3":0.02215,"13.4-13.7":0.04496,"14.0-14.4":0.13757,"14.5-14.8":0.11274,"15.0-15.1":0.12415,"15.2-15.3":0.04429,"15.4":0.12146,"15.5":0.05234,"15.6-15.7":0.63013,"16.0":0.29661,"16.1":0.23689,"16.2":0.25165,"16.3":0.23957,"16.4":0.22414,"16.5":0.61671,"16.6":2.66415,"17.0":0.15703,"17.1":0},P:{"4":0.09231,"20":0.06154,"21":0.2564,"22":2.07174,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.01026,"8.2":0,"9.2":0.01026,"10.1":0,"11.1-11.2":0.11282,"12.0":0,"13.0":0.02051,"14.0":0.13333,"15.0":0.01026,"16.0":0.15384,"17.0":0.17435,"18.0":0.02051,"19.0":0.06154},I:{"0":0,"3":0,"4":0.00343,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00343,"4.2-4.3":0.01116,"4.4":0,"4.4.3-4.4.4":0.05063},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":62.74652},R:{_:"0"},M:{"0":0.18809},Q:{"13.1":0},O:{"0":16.31663},H:{"0":3.29429}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/YT.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/YT.js
index fdb70e325ae4e2..b961ddd5370a74 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/YT.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/YT.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0.00394,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.01181,"92":0,"93":0.03937,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00787,"103":0,"104":0.06693,"105":0.01181,"106":0,"107":0,"108":0,"109":0.00394,"110":0,"111":0,"112":0,"113":0.00394,"114":0.01181,"115":0.40157,"116":1.03149,"117":0.00787,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0.00394,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0.01575,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.0315,"48":0,"49":0.00787,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00394,"64":0,"65":0,"66":0,"67":0.00394,"68":0,"69":0,"70":0,"71":0,"72":0.00394,"73":0,"74":0,"75":0,"76":0.01181,"77":0,"78":0,"79":0.04331,"80":0,"81":0.01575,"83":0.00394,"84":0,"85":0.00787,"86":0,"87":0.00394,"88":0.01575,"89":0,"90":0.00394,"91":0.00394,"92":0.00394,"93":0,"94":0.00394,"95":0,"96":0,"97":0.02756,"98":0,"99":0.00394,"100":0,"101":0.00787,"102":0.01575,"103":0.05512,"104":0,"105":0.0748,"106":0.01969,"107":0,"108":0.02756,"109":0.28346,"110":0.01181,"111":0,"112":0.01969,"113":0.00394,"114":0.51575,"115":3.98031,"116":2.5,"117":0.00787,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0.00787,"72":0.00394,"73":0,"74":0,"75":0,"76":0.00787,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00394,"100":0.08661,"101":0.27165,"102":0.00394,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0.00394,"15":0,"16":0,"17":0.00394,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00394,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00394,"93":0,"94":0,"95":0,"96":0.09055,"97":0,"98":0,"99":0,"100":0.00394,"101":0,"102":0.00394,"103":0,"104":0,"105":0.00394,"106":0,"107":0,"108":0.01969,"109":0.0315,"110":0.00394,"111":0.00787,"112":0.00394,"113":0.04331,"114":0.09055,"115":2.18504,"116":1.42126},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.02362,"15":0,"17":0.00394,_:"0","3.1":0,"3.2":0,"5.1":0.00394,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00394,"12.1":0.00394,"13.1":0.00787,"14.1":0.00787,"15.1":0.00394,"15.2-15.3":0,"15.4":0.01181,"15.5":0.03543,"15.6":0.08661,"16.0":0.01575,"16.1":0.01575,"16.2":0.01181,"16.3":0.02756,"16.4":0.02756,"16.5":0.16929,"16.6":0.46457},G:{"8":0,"17":0.12308,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.02462,"8.1-8.4":0,"9.0-9.2":0.01136,"9.3":0.00757,"10.0-10.2":0,"10.3":0.00757,"11.0-11.2":0.01136,"11.3-11.4":0,"12.0-12.1":0.00379,"12.2-12.5":0.07953,"13.0-13.1":0,"13.2":0,"13.3":0.0284,"13.4-13.7":0.03219,"14.0-14.4":0.0568,"14.5-14.8":0.08899,"15.0-15.1":0.05112,"15.2-15.3":0.15905,"15.4":0.03219,"15.5":0.28402,"15.6-15.7":1.26862,"16.0":0.48851,"16.1":1.08874,"16.2":0.61538,"16.3":1.40495,"16.4":0.86721,"16.5":4.20539,"16.6":7.98475},P:{"4":0.04078,"20":0.06117,"21":0.32622,"5.0-5.4":0.03058,"6.2-6.4":0,"7.2-7.4":0.21408,"8.2":0,"9.2":0.03058,"10.1":0.06117,"11.1-11.2":0.13253,"12.0":0.04078,"13.0":0.07136,"14.0":0.02039,"15.0":0.01019,"16.0":0.06117,"17.0":0.02039,"18.0":0.03058,"19.0":0.11214},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0.10756},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00787,"5.5":0},S:{"2.5":0.01819,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":60.49199},R:{_:"0"},M:{"0":0.43047},Q:{"13.1":0},O:{"0":0.03032},H:{"0":0.20664}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00935,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.0187,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0.00467,"94":0,"95":0,"96":0.00467,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.0187,"103":0,"104":0.00467,"105":0,"106":0,"107":0,"108":0.00467,"109":0,"110":0.00935,"111":0,"112":0.00467,"113":0.00467,"114":0,"115":0.1262,"116":0.07946,"117":2.63146,"118":0.19163,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0.00467,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0.00935,"62":0,"63":0.00467,"64":0,"65":0,"66":0,"67":0,"68":0.00467,"69":0.00467,"70":0.00935,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0.00935,"80":0,"81":0.0187,"83":0.00467,"84":0,"85":0.00467,"86":0,"87":0.02337,"88":0.02804,"89":0,"90":0.00467,"91":0.00467,"92":0.00467,"93":0,"94":0.00935,"95":0,"96":0,"97":0.00467,"98":0,"99":0,"100":0.00467,"101":0,"102":0,"103":0.02804,"104":0,"105":0.00935,"106":0.02804,"107":0,"108":0.00467,"109":0.57023,"110":0.00467,"111":0,"112":0.01402,"113":0.02804,"114":0.13555,"115":0.14022,"116":6.95491,"117":1.83221,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0.02804,"70":0.00467,"71":0.00935,"72":0.00467,"73":0,"74":0,"75":0,"76":0,"77":0.00467,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00935,"96":0,"97":0,"98":0,"99":0.00467,"100":0.00935,"101":0.17294,"102":0.16826,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0.00467,"86":0,"87":0,"88":0,"89":0.00467,"90":0,"91":0,"92":0.00467,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.02337,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00935,"110":0.00467,"111":0,"112":0.00935,"113":0.00935,"114":0.04674,"115":0.06076,"116":3.68779,"117":1.57046},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00935,"15":0.01402,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.06076,"14.1":0.06544,"15.1":0.01402,"15.2-15.3":0,"15.4":0.00467,"15.5":0.02337,"15.6":0.45338,"16.0":0.00935,"16.1":0.04207,"16.2":0.02337,"16.3":0.07946,"16.4":0.00935,"16.5":0.16359,"16.6":0.73382,"17.0":0.22903,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0.00338,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0.0575,"11.0-11.2":0.0372,"11.3-11.4":0.00338,"12.0-12.1":0,"12.2-12.5":0.26719,"13.0-13.1":0.01184,"13.2":0,"13.3":0.02875,"13.4-13.7":0.04228,"14.0-14.4":0.02029,"14.5-14.8":0.33145,"15.0-15.1":0.04228,"15.2-15.3":0.10654,"15.4":0.06595,"15.5":0.14374,"15.6-15.7":1.08907,"16.0":0.39064,"16.1":0.52931,"16.2":0.48873,"16.3":1.05186,"16.4":0.23337,"16.5":2.52142,"16.6":8.28299,"17.0":0.969,"17.1":0.00338},P:{"4":0.01015,"20":0.12179,"21":0.22327,"22":2.6387,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.28417,"8.2":0.0203,"9.2":0.0203,"10.1":0.10149,"11.1-11.2":0.27402,"12.0":0.06089,"13.0":0.10149,"14.0":0.03045,"15.0":0,"16.0":0.15223,"17.0":0.01015,"18.0":0.08119,"19.0":0.23342},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.01324,"4.4":0,"4.4.3-4.4.4":0.07284},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00935,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":53.56256},R:{_:"0"},M:{"0":1.02259},Q:{"13.1":0.01065},O:{"0":0.01598},H:{"0":0.60508}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZA.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZA.js
index fa7dd59b571be4..a5489a0e667a07 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZA.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZA.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00204,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00204,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00204,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00204,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00204,"95":0,"96":0,"97":0,"98":0.00204,"99":0.00204,"100":0,"101":0,"102":0.00204,"103":0,"104":0.00204,"105":0,"106":0.00204,"107":0,"108":0.00204,"109":0.00204,"110":0.00204,"111":0.00204,"112":0.00407,"113":0.00407,"114":0.00407,"115":0.04681,"116":0.13431,"117":0.00611,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00204,"50":0.00204,"51":0,"52":0,"53":0,"54":0,"55":0.00204,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00204,"67":0,"68":0,"69":0,"70":0.00204,"71":0,"72":0,"73":0,"74":0.00204,"75":0,"76":0.00204,"77":0,"78":0.00204,"79":0.00407,"80":0,"81":0.01221,"83":0.00204,"84":0,"85":0,"86":0.00204,"87":0.00204,"88":0.00407,"89":0,"90":0,"91":0,"92":0,"93":0.07326,"94":0.00204,"95":0,"96":0,"97":0,"98":0,"99":0.00814,"100":0.00204,"101":0.00204,"102":0.00204,"103":0.00611,"104":0.00204,"105":0,"106":0.00611,"107":0.00204,"108":0.00407,"109":0.14856,"110":0.00204,"111":0.01018,"112":0.00611,"113":0.01018,"114":0.07937,"115":1.18844,"116":0.64917,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00204,"27":0,"28":0.00407,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00407,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0.00204,"55":0,"56":0.00204,"57":0.00204,"58":0.00204,"60":0.00611,"62":0,"63":0.00814,"64":0.00407,"65":0.00814,"66":0.00611,"67":0.01221,"68":0.00407,"69":0.08954,"70":0.0407,"71":0.12821,"72":0.09361,"73":0,"74":0.00204,"75":0,"76":0.00407,"77":0.00204,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00407,"96":0,"97":0,"98":0,"99":0.00204,"100":0.03663,"101":0.03663,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00204},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00204,"18":0.00204,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00204,"93":0,"94":0,"95":0.00204,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00611,"110":0.00204,"111":0.00204,"112":0.00407,"113":0.00407,"114":0.02646,"115":0.3663,"116":0.116},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00204,"14":0.00204,"15":0,"17":0.00204,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0.00204,"13.1":0.00611,"14.1":0.00814,"15.1":0.00204,"15.2-15.3":0.00204,"15.4":0.00204,"15.5":0.00407,"15.6":0.02442,"16.0":0.00204,"16.1":0.00814,"16.2":0.00611,"16.3":0.01832,"16.4":0.00611,"16.5":0.05291,"16.6":0.07326},G:{"8":0,"17":0.09748,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00145,"6.0-6.1":0.00436,"7.0-7.1":0.00582,"8.1-8.4":0.00436,"9.0-9.2":0.00436,"9.3":0.04947,"10.0-10.2":0,"10.3":0.03492,"11.0-11.2":0.00436,"11.3-11.4":0.00436,"12.0-12.1":0.00291,"12.2-12.5":0.32591,"13.0-13.1":0.00873,"13.2":0.00145,"13.3":0.01018,"13.4-13.7":0.04219,"14.0-14.4":0.10767,"14.5-14.8":0.25316,"15.0-15.1":0.05674,"15.2-15.3":0.08439,"15.4":0.09603,"15.5":0.18769,"15.6-15.7":1.32838,"16.0":0.37538,"16.1":0.77404,"16.2":0.35501,"16.3":0.81332,"16.4":0.18769,"16.5":2.93174,"16.6":6.38873},P:{"4":0.19271,"20":0.26371,"21":0.55784,"22":6.16671,"5.0-5.4":0.02029,"6.2-6.4":0,"7.2-7.4":0.36513,"8.2":0,"9.2":0.01014,"10.1":0.01014,"11.1-11.2":0.05071,"12.0":0.02029,"13.0":0.06086,"14.0":0.05071,"15.0":0.03043,"16.0":0.09128,"17.0":0.08114,"18.0":0.071,"19.0":0.19271},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00664,"4.4":0,"4.4.3-4.4.4":0.0415},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01221,"5.5":0},S:{"2.5":0.00797,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.06032},R:{_:"0"},M:{"0":0.46994},Q:{"13.1":0.00797},O:{"0":0.51773},H:{"0":2.96351}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.00201,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0.00201,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00201,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00403,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.00201,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00201,"103":0,"104":0.00201,"105":0,"106":0,"107":0,"108":0,"109":0,"110":0.00201,"111":0.00201,"112":0.00201,"113":0.00403,"114":0.00201,"115":0.01812,"116":0.01409,"117":0.1389,"118":0.01208,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0.00201,"50":0.00201,"51":0,"52":0,"53":0,"54":0,"55":0.00201,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0.00403,"67":0,"68":0,"69":0,"70":0.00201,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0.00201,"79":0.00201,"80":0,"81":0.01007,"83":0.00201,"84":0,"85":0.00201,"86":0.00201,"87":0.00201,"88":0.00403,"89":0,"90":0,"91":0.00201,"92":0,"93":0.08857,"94":0.00201,"95":0,"96":0,"97":0,"98":0.00201,"99":0.00805,"100":0.00201,"101":0.00201,"102":0.00201,"103":0.00604,"104":0.00201,"105":0.00201,"106":0.00403,"107":0.00201,"108":0.00403,"109":0.13286,"110":0.00201,"111":0.00403,"112":0.00403,"113":0.00805,"114":0.02416,"115":0.0463,"116":1.41917,"117":0.3563,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00201,"27":0,"28":0.00403,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0.00201,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0.00201,"52":0,"53":0,"54":0.00201,"55":0,"56":0.00201,"57":0.00201,"58":0.00201,"60":0.00604,"62":0,"63":0.00805,"64":0.00403,"65":0.00604,"66":0.00604,"67":0.01007,"68":0.00201,"69":0.07851,"70":0.02617,"71":0.02617,"72":0.1852,"73":0.03825,"74":0.00201,"75":0,"76":0.00201,"77":0.02214,"78":0.00201,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.00403,"96":0,"97":0,"98":0,"99":0,"100":0.00604,"101":0.0302,"102":0.02818,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00201},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0.00201,"18":0.00201,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0.00201,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.00604,"110":0.00201,"111":0.00201,"112":0.00403,"113":0.00201,"114":0.00805,"115":0.01409,"116":0.26572,"117":0.16909},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00403,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0.00201,"12.1":0.00201,"13.1":0.00604,"14.1":0.00604,"15.1":0.00201,"15.2-15.3":0.00201,"15.4":0.00201,"15.5":0.00403,"15.6":0.02214,"16.0":0.00403,"16.1":0.00604,"16.2":0.00604,"16.3":0.0161,"16.4":0.00604,"16.5":0.0161,"16.6":0.1087,"17.0":0.00604,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00144,"6.0-6.1":0,"7.0-7.1":0.00287,"8.1-8.4":0.00575,"9.0-9.2":0.01149,"9.3":0.05314,"10.0-10.2":0,"10.3":0.03304,"11.0-11.2":0.00144,"11.3-11.4":0.00575,"12.0-12.1":0.00144,"12.2-12.5":0.32748,"13.0-13.1":0.01005,"13.2":0.00287,"13.3":0.02154,"13.4-13.7":0.04165,"14.0-14.4":0.09336,"14.5-14.8":0.2255,"15.0-15.1":0.05745,"15.2-15.3":0.08187,"15.4":0.09192,"15.5":0.16949,"15.6-15.7":1.27545,"16.0":0.34759,"16.1":0.65065,"16.2":0.2887,"16.3":0.69805,"16.4":0.15656,"16.5":0.50559,"16.6":8.391,"17.0":0.65496,"17.1":0.00144},P:{"4":0.1519,"20":0.19241,"21":0.37469,"22":6.46085,"5.0-5.4":0.01013,"6.2-6.4":0.01013,"7.2-7.4":0.36456,"8.2":0,"9.2":0.01013,"10.1":0.01013,"11.1-11.2":0.05063,"12.0":0.02025,"13.0":0.04051,"14.0":0.04051,"15.0":0.03038,"16.0":0.08101,"17.0":0.08101,"18.0":0.06076,"19.0":0.19241},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00663,"4.4":0,"4.4.3-4.4.4":0.04142},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01007,"5.5":0},S:{"2.5":0.00799,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.46044},R:{_:"0"},M:{"0":0.48721},Q:{"13.1":0.00799},O:{"0":0.51916},H:{"0":2.98682}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZM.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZM.js
index 833b0f91640400..48c253ea439a71 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZM.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZM.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.00422,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.00211,"109":0,"110":0,"111":0,"112":0.00211,"113":0.00211,"114":0.00422,"115":0.03796,"116":0.07382,"117":0.00211,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00211,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00211,"41":0,"42":0,"43":0.00211,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00211,"56":0,"57":0,"58":0.00211,"59":0.00211,"60":0,"61":0,"62":0,"63":0,"64":0.00211,"65":0,"66":0,"67":0,"68":0.00211,"69":0,"70":0.00211,"71":0,"72":0,"73":0.00211,"74":0.00211,"75":0,"76":0,"77":0.00211,"78":0.00211,"79":0.00211,"80":0.00211,"81":0.00633,"83":0,"84":0,"85":0,"86":0,"87":0.00422,"88":0.00211,"89":0,"90":0.00211,"91":0,"92":0.00422,"93":0.00211,"94":0.00422,"95":0.00422,"96":0,"97":0,"98":0,"99":0.00211,"100":0,"101":0,"102":0.00844,"103":0.00633,"104":0.00211,"105":0.00422,"106":0.00422,"107":0.00211,"108":0.00211,"109":0.15185,"110":0.00211,"111":0.00633,"112":0.00422,"113":0.00633,"114":0.07171,"115":0.67488,"116":0.36908,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00211,"25":0,"26":0.00211,"27":0.00211,"28":0.00422,"29":0,"30":0.00422,"31":0,"32":0.00211,"33":0.00211,"34":0,"35":0.02109,"36":0,"37":0.04218,"38":0,"39":0,"40":0,"41":0,"42":0.00422,"43":0,"44":0,"45":0,"46":0.00211,"47":0.00422,"48":0,"49":0,"50":0.00211,"51":0.00422,"52":0,"53":0,"54":0.00211,"55":0.00211,"56":0.00211,"57":0.00211,"58":0.00633,"60":0.19403,"62":0,"63":0.06538,"64":0.01898,"65":0.00844,"66":0.05694,"67":0.07171,"68":0.03796,"69":0.29737,"70":0.32479,"71":0.82884,"72":0.38173,"73":0,"74":0.00211,"75":0.00422,"76":0.01898,"77":0.00422,"78":0,"79":0.00422,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00211,"86":0,"87":0,"88":0,"89":0,"90":0.00211,"91":0,"92":0,"93":0,"94":0,"95":0.01898,"96":0,"97":0,"98":0.00211,"99":0.00422,"100":0.03585,"101":0.09491,"102":0.00211,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00633},B:{"12":0.00211,"13":0.00211,"14":0.00211,"15":0.00211,"16":0.00211,"17":0.00211,"18":0.00844,"79":0,"80":0,"81":0,"83":0,"84":0.00211,"85":0,"86":0,"87":0,"88":0,"89":0.00211,"90":0.00211,"91":0,"92":0.01055,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00211,"101":0,"102":0,"103":0.00211,"104":0,"105":0,"106":0,"107":0.00211,"108":0,"109":0.00422,"110":0.00211,"111":0.00211,"112":0.00633,"113":0.00422,"114":0.01687,"115":0.23832,"116":0.06749},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0,_:"0","3.1":0,"3.2":0,"5.1":0.00211,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00211,"14.1":0.00633,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00211,"15.6":0.00633,"16.0":0,"16.1":0,"16.2":0,"16.3":0.00211,"16.4":0.00211,"16.5":0.01055,"16.6":0.00844},G:{"8":0,"17":0.03557,"3.2":0.00155,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00155,"6.0-6.1":0.00232,"7.0-7.1":0.02242,"8.1-8.4":0,"9.0-9.2":0.00077,"9.3":0.04253,"10.0-10.2":0.00155,"10.3":0.0464,"11.0-11.2":0.00464,"11.3-11.4":0.00387,"12.0-12.1":0.02784,"12.2-12.5":1.54652,"13.0-13.1":0.02088,"13.2":0.00155,"13.3":0.02629,"13.4-13.7":0.04485,"14.0-14.4":0.22656,"14.5-14.8":0.1879,"15.0-15.1":0.15852,"15.2-15.3":0.15233,"15.4":0.11212,"15.5":0.20646,"15.6-15.7":1.55966,"16.0":0.19795,"16.1":0.29384,"16.2":0.17166,"16.3":0.34487,"16.4":0.22347,"16.5":1.07406,"16.6":0.98977},P:{"4":0.14277,"20":0.08158,"21":0.16316,"5.0-5.4":0.0204,"6.2-6.4":0.0102,"7.2-7.4":0.09178,"8.2":0,"9.2":0.04079,"10.1":0,"11.1-11.2":0.0204,"12.0":0.0102,"13.0":0.03059,"14.0":0.0102,"15.0":0.0102,"16.0":0.05099,"17.0":0.03059,"18.0":0.0204,"19.0":0.04079},I:{"0":0,"3":0,"4":0.00138,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00138,"4.2-4.3":0.00231,"4.4":0,"4.4.3-4.4.4":0.16602},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01898,"5.5":0},S:{"2.5":0.02367,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":65.54932},R:{_:"0"},M:{"0":0.07891},Q:{"13.1":0.00789},O:{"0":1.47562},H:{"0":15.94245}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0.00237,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00237,"100":0,"101":0,"102":0.00475,"103":0.00237,"104":0,"105":0.00237,"106":0,"107":0,"108":0.00237,"109":0.00237,"110":0,"111":0.00237,"112":0,"113":0.00237,"114":0.00237,"115":0.0261,"116":0.01424,"117":0.12102,"118":0.01424,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00237,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00237,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0.00237,"59":0.00237,"60":0,"61":0,"62":0,"63":0,"64":0.00237,"65":0,"66":0,"67":0,"68":0.00237,"69":0,"70":0.00237,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0.00237,"78":0.00237,"79":0.00237,"80":0.00237,"81":0.00712,"83":0.00237,"84":0,"85":0,"86":0,"87":0.00237,"88":0.00237,"89":0,"90":0.00237,"91":0,"92":0.00237,"93":0.00237,"94":0.00475,"95":0.00475,"96":0,"97":0.00237,"98":0.00237,"99":0.00237,"100":0,"101":0,"102":0.00475,"103":0.00712,"104":0.00237,"105":0.00237,"106":0.00475,"107":0.00237,"108":0.00475,"109":0.19696,"110":0.00475,"111":0.00475,"112":0.00712,"113":0.00712,"114":0.03085,"115":0.0356,"116":1.19125,"117":0.43426,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0.00237,"25":0,"26":0.00237,"27":0.00237,"28":0.00475,"29":0,"30":0.00475,"31":0,"32":0.00237,"33":0.00237,"34":0,"35":0.01661,"36":0,"37":0.03797,"38":0,"39":0,"40":0,"41":0,"42":0.00475,"43":0,"44":0,"45":0,"46":0.00237,"47":0.00475,"48":0,"49":0,"50":0.00475,"51":0.00237,"52":0,"53":0,"54":0.00237,"55":0.00237,"56":0.00712,"57":0.00237,"58":0.00712,"60":0.18509,"62":0,"63":0.0617,"64":0.01661,"65":0.00949,"66":0.04746,"67":0.05695,"68":0.03085,"69":0.22544,"70":0.22781,"71":0.41053,"72":0.96581,"73":0.15662,"74":0.00237,"75":0.00237,"76":0.00949,"77":0.0261,"78":0.00475,"79":0.00475,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02136,"96":0,"97":0,"98":0,"99":0.00237,"100":0.00237,"101":0.06644,"102":0.06882,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.00475},B:{"12":0.00475,"13":0.00237,"14":0,"15":0.00237,"16":0.00237,"17":0.00237,"18":0.01187,"79":0,"80":0,"81":0,"83":0,"84":0.00237,"85":0,"86":0,"87":0,"88":0,"89":0.00237,"90":0.00475,"91":0,"92":0.01187,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00237,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00237,"108":0,"109":0.00949,"110":0.00237,"111":0.00237,"112":0.00475,"113":0.00475,"114":0.00949,"115":0.01898,"116":0.23967,"117":0.22781},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.00237,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0.00237,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00237,"14.1":0.00475,"15.1":0,"15.2-15.3":0,"15.4":0,"15.5":0.00237,"15.6":0.00475,"16.0":0,"16.1":0,"16.2":0,"16.3":0.00237,"16.4":0.00237,"16.5":0.00712,"16.6":0.01661,"17.0":0.00237,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00445,"6.0-6.1":0,"7.0-7.1":0.01336,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.02821,"10.0-10.2":0.00148,"10.3":0.03266,"11.0-11.2":0.00594,"11.3-11.4":0.00297,"12.0-12.1":0.02969,"12.2-12.5":1.42905,"13.0-13.1":0.01782,"13.2":0,"13.3":0.01336,"13.4-13.7":0.0386,"14.0-14.4":0.1752,"14.5-14.8":0.14699,"15.0-15.1":0.13808,"15.2-15.3":0.12175,"15.4":0.11507,"15.5":0.15664,"15.6-15.7":1.70298,"16.0":0.18188,"16.1":0.18708,"16.2":0.15218,"16.3":0.29991,"16.4":0.1455,"16.5":0.4907,"16.6":1.44018,"17.0":0.2769,"17.1":0},P:{"4":0.11208,"20":0.07132,"21":0.15283,"22":0.64189,"5.0-5.4":0.01019,"6.2-6.4":0,"7.2-7.4":0.0917,"8.2":0,"9.2":0.05094,"10.1":0,"11.1-11.2":0.01019,"12.0":0,"13.0":0.01019,"14.0":0.02038,"15.0":0.01019,"16.0":0.05094,"17.0":0.03057,"18.0":0.02038,"19.0":0.05094},I:{"0":0,"3":0,"4":0.00097,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00097,"4.2-4.3":0.00145,"4.4":0,"4.4.3-4.4.4":0.1656},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.01661,"5.5":0},S:{"2.5":0.01525,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":67.27704},R:{_:"0"},M:{"0":0.09152},Q:{"13.1":0.01525},O:{"0":1.22795},H:{"0":14.04436}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZW.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZW.js
index 79bfd58d3e6a71..57a075a9cb8ad7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZW.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/ZW.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0.00313,"48":0.00313,"49":0,"50":0,"51":0,"52":0.00313,"53":0,"54":0,"55":0,"56":0,"57":0.00625,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0.00313,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.00625,"88":0.00625,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0.00625,"100":0,"101":0,"102":0.00625,"103":0,"104":0,"105":0.00313,"106":0.00938,"107":0.01563,"108":0.00625,"109":0.00313,"110":0.00313,"111":0.00313,"112":0.00625,"113":0.00625,"114":0.07188,"115":0.24063,"116":0.35938,"117":0.01875,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.00938,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.00313,"41":0.00313,"42":0,"43":0,"44":0,"45":0,"46":0.00313,"47":0,"48":0,"49":0.00313,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.00313,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.00625,"64":0.00313,"65":0,"66":0,"67":0.00313,"68":0.00313,"69":0.00313,"70":0.00625,"71":0,"72":0,"73":0,"74":0.00938,"75":0,"76":0.00313,"77":0.00313,"78":0.00313,"79":0.00625,"80":0.00313,"81":0.0125,"83":0.00313,"84":0.00313,"85":0.00313,"86":0.00313,"87":0.00625,"88":0.00625,"89":0.00313,"90":0.00313,"91":0.00625,"92":0.00313,"93":0.00625,"94":0.01875,"95":0.00625,"96":0,"97":0.00938,"98":0.00625,"99":0.0125,"100":0.00625,"101":0.00313,"102":0.01563,"103":0.01563,"104":0.00938,"105":0.00625,"106":0.02188,"107":0.0125,"108":0.01563,"109":0.45313,"110":0.00938,"111":0.01563,"112":0.03438,"113":0.0375,"114":0.275,"115":2.71875,"116":1.22813,"117":0.00625,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.00625,"27":0,"28":0.01563,"29":0,"30":0,"31":0,"32":0.00313,"33":0,"34":0,"35":0.00625,"36":0,"37":0.00625,"38":0.00313,"39":0,"40":0,"41":0,"42":0.00938,"43":0,"44":0,"45":0,"46":0.00938,"47":0.00313,"48":0,"49":0,"50":0.02188,"51":0.00313,"52":0,"53":0,"54":0.00625,"55":0.00313,"56":0.00313,"57":0.00625,"58":0.03125,"60":0.075,"62":0,"63":0.08125,"64":0.025,"65":0.025,"66":0.04063,"67":0.0375,"68":0.02813,"69":0.34688,"70":0.16875,"71":0.5125,"72":0.27188,"73":0,"74":0.00313,"75":0.00313,"76":0.00938,"77":0.00625,"78":0,"79":0.00313,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.00313,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0.00313,"92":0,"93":0.00313,"94":0,"95":0.01563,"96":0,"97":0,"98":0,"99":0.01563,"100":0.10938,"101":0.1875,"102":0.00625,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0.00313,"11.1":0.00313,"11.5":0,"11.6":0,"12.1":0.12813},B:{"12":0.00625,"13":0.00313,"14":0.03125,"15":0.00313,"16":0.00313,"17":0.00313,"18":0.03125,"79":0,"80":0,"81":0,"83":0,"84":0.00625,"85":0.00313,"86":0,"87":0,"88":0,"89":0.00625,"90":0.00938,"91":0,"92":0.01563,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.00625,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0.00313,"108":0.00313,"109":0.01563,"110":0.00313,"111":0.00625,"112":0.00938,"113":0.00938,"114":0.06563,"115":0.76563,"116":0.19063},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0.00313,"14":0.00313,"15":0.00625,"17":0.00313,_:"0","3.1":0,"3.2":0,"5.1":0.00938,"6.1":0,"7.1":0,"9.1":0.00313,"10.1":0,"11.1":0,"12.1":0,"13.1":0.00313,"14.1":0.03438,"15.1":0,"15.2-15.3":0,"15.4":0.00625,"15.5":0.00625,"15.6":0.04063,"16.0":0,"16.1":0.00938,"16.2":0.00625,"16.3":0.0125,"16.4":0.00625,"16.5":0.04688,"16.6":0.075},G:{"8":0,"17":0.08658,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00412,"5.0-5.1":0.00206,"6.0-6.1":0,"7.0-7.1":0.00825,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.04123,"10.0-10.2":0,"10.3":0.03504,"11.0-11.2":0.00412,"11.3-11.4":0.00309,"12.0-12.1":0.01237,"12.2-12.5":0.37209,"13.0-13.1":0.00309,"13.2":0.00412,"13.3":0.0134,"13.4-13.7":0.05257,"14.0-14.4":0.13193,"14.5-14.8":0.19068,"15.0-15.1":0.15152,"15.2-15.3":0.12472,"15.4":0.11338,"15.5":0.19171,"15.6-15.7":1.20079,"16.0":0.40507,"16.1":0.65348,"16.2":0.36487,"16.3":0.6844,"16.4":0.27211,"16.5":2.2717,"16.6":2.89838},P:{"4":0.33593,"20":0.1018,"21":0.22395,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.13234,"8.2":0,"9.2":0.02036,"10.1":0.02036,"11.1-11.2":0.03054,"12.0":0,"13.0":0.03054,"14.0":0.02036,"15.0":0.01018,"16.0":0.07126,"17.0":0.04072,"18.0":0.04072,"19.0":0.16288},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.00266,"4.4":0,"4.4.3-4.4.4":0.14921},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.00446,"11":0.02679,"5.5":0},S:{"2.5":0.00688,_:"3.0-3.1"},J:{"7":0,"10":0.00688},N:{"10":0,"11":0},L:{"0":64.78375},R:{_:"0"},M:{"0":0.33},Q:{"13.1":0.055},O:{"0":1.25125},H:{"0":8.22062}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0.0033,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0.0033,"49":0,"50":0,"51":0,"52":0.0033,"53":0,"54":0,"55":0,"56":0,"57":0.0033,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0.0033,"88":0.0033,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0.0033,"95":0,"96":0,"97":0.0033,"98":0,"99":0.0033,"100":0,"101":0,"102":0.00991,"103":0,"104":0,"105":0,"106":0.03962,"107":0,"108":0.0033,"109":0.0033,"110":0.0033,"111":0.0033,"112":0.0033,"113":0.0033,"114":0.0066,"115":0.09246,"116":0.03962,"117":0.36982,"118":0.03962,"119":0.0033,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0.0066,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0.0066,"41":0.0033,"42":0,"43":0,"44":0,"45":0,"46":0.0033,"47":0,"48":0,"49":0.0033,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0.0033,"56":0.0033,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0.0066,"64":0.00991,"65":0,"66":0,"67":0.0033,"68":0,"69":0.0033,"70":0.00991,"71":0.0033,"72":0,"73":0,"74":0.0066,"75":0,"76":0.0066,"77":0.0033,"78":0.0033,"79":0.02311,"80":0.0033,"81":0.0066,"83":0.0033,"84":0.0033,"85":0.0033,"86":0.0033,"87":0.0066,"88":0.0033,"89":0,"90":0.0033,"91":0.0033,"92":0.0033,"93":0.0033,"94":0.00991,"95":0.0066,"96":0.0066,"97":0.0066,"98":0.0066,"99":0.0066,"100":0.0033,"101":0.0066,"102":0.01321,"103":0.02642,"104":0.00991,"105":0.00991,"106":0.01981,"107":0.0066,"108":0.01321,"109":0.56794,"110":0.0066,"111":0.01321,"112":0.02972,"113":0.01981,"114":0.11887,"115":0.10897,"116":3.60248,"117":0.80899,"118":0.0033,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0.0033,"27":0,"28":0.00991,"29":0,"30":0,"31":0,"32":0.0066,"33":0,"34":0,"35":0.01321,"36":0.01981,"37":0.0033,"38":0.0066,"39":0,"40":0,"41":0,"42":0.02311,"43":0,"44":0,"45":0.0033,"46":0.00991,"47":0.0033,"48":0,"49":0,"50":0.02311,"51":0.0033,"52":0,"53":0,"54":0.0033,"55":0,"56":0,"57":0.0033,"58":0.06274,"60":0.07264,"62":0,"63":0.12878,"64":0.01981,"65":0.03302,"66":0.03302,"67":0.03632,"68":0.01651,"69":0.26086,"70":0.13868,"71":0.28067,"72":0.67691,"73":0.12878,"74":0,"75":0,"76":0.0033,"77":0.03302,"78":0.0033,"79":0.0066,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0.0066,"86":0.0033,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0.02972,"96":0,"97":0,"98":0.0033,"99":0.0033,"100":0.01651,"101":0.1717,"102":0.19812,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0.09576},B:{"12":0.00991,"13":0.0033,"14":0.02642,"15":0.0033,"16":0.0066,"17":0.0066,"18":0.03962,"79":0,"80":0,"81":0,"83":0,"84":0.0066,"85":0,"86":0,"87":0,"88":0,"89":0.0066,"90":0.0066,"91":0,"92":0.02642,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0.0066,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0.0033,"107":0.0033,"108":0.0033,"109":0.01321,"110":0.0033,"111":0.0033,"112":0.00991,"113":0.00991,"114":0.04623,"115":0.06934,"116":0.667,"117":0.46888},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0.0066,"15":0.0066,_:"0","3.1":0,"3.2":0,"5.1":0.0066,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0.0066,"14.1":0.05283,"15.1":0.0066,"15.2-15.3":0.0033,"15.4":0.0033,"15.5":0.0066,"15.6":0.05944,"16.0":0,"16.1":0.01321,"16.2":0.0033,"16.3":0.01321,"16.4":0.00991,"16.5":0.02642,"16.6":0.15189,"17.0":0.01321,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00235,"5.0-5.1":0.0047,"6.0-6.1":0,"7.0-7.1":0.00392,"8.1-8.4":0,"9.0-9.2":0,"9.3":0.06114,"10.0-10.2":0.00078,"10.3":0.02744,"11.0-11.2":0.00235,"11.3-11.4":0.00392,"12.0-12.1":0.00627,"12.2-12.5":0.27279,"13.0-13.1":0.00157,"13.2":0.00314,"13.3":0.01568,"13.4-13.7":0.03763,"14.0-14.4":0.08544,"14.5-14.8":0.17088,"15.0-15.1":0.10112,"15.2-15.3":0.09171,"15.4":0.07682,"15.5":0.13169,"15.6-15.7":0.88577,"16.0":0.29473,"16.1":0.41388,"16.2":0.26887,"16.3":0.45778,"16.4":0.19126,"16.5":0.52205,"16.6":3.1676,"17.0":0.45699,"17.1":0},P:{"4":0.14442,"20":0.09284,"21":0.17537,"22":1.05219,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.1341,"8.2":0,"9.2":0.01032,"10.1":0.01032,"11.1-11.2":0.02063,"12.0":0.02063,"13.0":0.01032,"14.0":0.01032,"15.0":0.01032,"16.0":0.05158,"17.0":0.02063,"18.0":0.04126,"19.0":0.11347},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00296,"4.2-4.3":0.00296,"4.4":0,"4.4.3-4.4.4":0.1272},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0.0039,"11":0.03902,"5.5":0},S:{"2.5":0.0134,_:"3.0-3.1"},J:{"7":0,"10":0.0067},N:{"10":0,"11":0},L:{"0":65.83168},R:{_:"0"},M:{"0":0.10717},Q:{"13.1":0.06698},O:{"0":1.39988},H:{"0":8.86504}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-af.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-af.js
index cd672f548c55b0..800d806d71484f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-af.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-af.js
@@ -1 +1 @@
-module.exports={C:{"34":0.0047,"43":0.00235,"47":0.00235,"50":0.00235,"52":0.02587,"53":0.00706,"60":0.00235,"65":0.00235,"72":0.0047,"77":0.0047,"78":0.00941,"91":0.00235,"95":0.00235,"99":0.0047,"102":0.02352,"104":0.0047,"105":0.0047,"106":0.00235,"107":0.00235,"108":0.0047,"109":0.0047,"110":0.00706,"111":0.0047,"112":0.00941,"113":0.01176,"114":0.02117,"115":0.48922,"116":0.66091,"117":0.03293,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 44 45 46 48 49 51 54 55 56 57 58 59 61 62 63 64 66 67 68 69 70 71 73 74 75 76 79 80 81 82 83 84 85 86 87 88 89 90 92 93 94 96 97 98 100 101 103 118 119 120 3.5 3.6"},D:{"11":0.00235,"31":0.0047,"38":0.0047,"43":0.01646,"47":0.0047,"49":0.01646,"50":0.0047,"56":0.0047,"58":0.01882,"59":0.00235,"62":0.00235,"63":0.00706,"64":0.0047,"65":0.0047,"66":0.0047,"67":0.02117,"68":0.00706,"69":0.0047,"70":0.00941,"71":0.0047,"72":0.00706,"73":0.0047,"74":0.00941,"75":0.00706,"76":0.00941,"77":0.00706,"78":0.0047,"79":0.04704,"80":0.00941,"81":0.01646,"83":0.01176,"84":0.0047,"85":0.00941,"86":0.01411,"87":0.02587,"88":0.01646,"89":0.00706,"90":0.00941,"91":0.01411,"92":0.00941,"93":0.12701,"94":0.01646,"95":0.01411,"96":0.00706,"97":0.00706,"98":0.01882,"99":0.02587,"100":0.00941,"101":0.00706,"102":0.02587,"103":0.0541,"104":0.01411,"105":0.02352,"106":0.02352,"107":0.02587,"108":0.04234,"109":1.86514,"110":0.02117,"111":0.04234,"112":0.05174,"113":0.07056,"114":0.45864,"115":6.11285,"116":3.4692,"117":0.00941,"118":0.00235,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 35 36 37 39 40 41 42 44 45 46 48 51 52 53 54 55 57 60 61 119"},F:{"28":0.0047,"46":0.00235,"73":0.00235,"74":0.0047,"76":0.00706,"77":0.00235,"79":0.01411,"82":0.00235,"84":0.00235,"85":0.0047,"95":0.05645,"98":0.00235,"99":0.01882,"100":0.20462,"101":0.30106,"102":0.00706,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 75 78 80 81 83 86 87 88 89 90 91 92 93 94 96 97 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00706,"13":0.00235,"14":0.00235,"15":0.00235,"16":0.00235,"17":0.0047,"18":0.01882,"84":0.0047,"89":0.0047,"90":0.0047,"92":0.02117,"95":0.00235,"100":0.00235,"106":0.00235,"107":0.0047,"108":0.0047,"109":0.04234,"110":0.00706,"111":0.00706,"112":0.01646,"113":0.01646,"114":0.09408,"115":1.54056,"116":0.5292,_:"79 80 81 83 85 86 87 88 91 93 94 96 97 98 99 101 102 103 104 105"},E:{"4":0,"13":0.0047,"14":0.01411,"15":0.00235,"17":0.0047,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 9.1 10.1","5.1":0.03293,"11.1":0.00235,"12.1":0.0047,"13.1":0.02587,"14.1":0.03058,"15.1":0.01176,"15.2-15.3":0.00706,"15.4":0.00941,"15.5":0.01176,"15.6":0.07291,"16.0":0.00706,"16.1":0.02117,"16.2":0.01882,"16.3":0.04469,"16.4":0.02352,"16.5":0.12936,"16.6":0.15994},G:{"8":0.00269,"17":0.0646,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00179,"6.0-6.1":0.00179,"7.0-7.1":0.02512,"8.1-8.4":0.00179,"9.0-9.2":0.00179,"9.3":0.04038,"10.0-10.2":0.0009,"10.3":0.04397,"11.0-11.2":0.01256,"11.3-11.4":0.00628,"12.0-12.1":0.02602,"12.2-12.5":0.46658,"13.0-13.1":0.01256,"13.2":0.05204,"13.3":0.01974,"13.4-13.7":0.05563,"14.0-14.4":0.20637,"14.5-14.8":0.24675,"15.0-15.1":0.17317,"15.2-15.3":0.11664,"15.4":0.10139,"15.5":0.16869,"15.6-15.7":1.13055,"16.0":0.30597,"16.1":0.4585,"16.2":0.2611,"16.3":0.54464,"16.4":0.22073,"16.5":1.54688,"16.6":2.65231},P:{"4":0.17345,"20":0.14284,"21":0.31629,"22":2.44872,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.19386,"8.2":0,"9.2":0.02041,"10.1":0,"11.1-11.2":0.03061,"12.0":0.0102,"13.0":0.04081,"14.0":0.04081,"15.0":0.02041,"16.0":0.07142,"17.0":0.05101,"18.0":0.05101,"19.0":0.11223},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00208,"4.2-4.3":0.00728,"4.4":0,"4.4.3-4.4.4":0.06711},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.00503,"11":0.06788,_:"6 7 9 10 5.5"},S:{"2.5":0.07647,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":58.6146},R:{_:"0"},M:{"0":0.25235},Q:{"13.1":0},O:{"0":0.55058},H:{"0":8.60799}};
+module.exports={C:{"34":0.00493,"43":0.00246,"52":0.02463,"53":0.00246,"57":0.00246,"65":0.00246,"72":0.00246,"77":0.00493,"78":0.00985,"91":0.00246,"92":0.00246,"94":0.00246,"95":0.00246,"99":0.00493,"102":0.02217,"104":0.00493,"105":0.00493,"106":0.00493,"107":0.00246,"108":0.00493,"109":0.00493,"110":0.00739,"111":0.00493,"112":0.00493,"113":0.00739,"114":0.00985,"115":0.34975,"116":0.05911,"117":0.71427,"118":0.07882,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 44 45 46 47 48 49 50 51 54 55 56 58 59 60 61 62 63 64 66 67 68 69 70 71 73 74 75 76 79 80 81 82 83 84 85 86 87 88 89 90 93 96 97 98 100 101 103 119 120 3.5 3.6"},D:{"11":0.00493,"38":0.00246,"43":0.01478,"47":0.00493,"49":0.01724,"50":0.00493,"56":0.00493,"58":0.00985,"60":0.00246,"62":0.00246,"63":0.00493,"64":0.00493,"65":0.00246,"66":0.00493,"67":0.00985,"68":0.00739,"69":0.00493,"70":0.00985,"71":0.00246,"72":0.00985,"73":0.00493,"74":0.00985,"75":0.00739,"76":0.00985,"77":0.00739,"78":0.00493,"79":0.05665,"80":0.01232,"81":0.0197,"83":0.01232,"84":0.00739,"85":0.01478,"86":0.0197,"87":0.03448,"88":0.01724,"89":0.00739,"90":0.02217,"91":0.01724,"92":0.00985,"93":0.16995,"94":0.01724,"95":0.01478,"96":0.00985,"97":0.01232,"98":0.0197,"99":0.02709,"100":0.00985,"101":0.00985,"102":0.02956,"103":0.04926,"104":0.01478,"105":0.02217,"106":0.02709,"107":0.04187,"108":0.06896,"109":1.91621,"110":0.02217,"111":0.03202,"112":0.04433,"113":0.0468,"114":0.1601,"115":0.23152,"116":7.69441,"117":2.07385,"118":0.00985,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 44 45 46 48 51 52 53 54 55 57 59 61 119 120"},F:{"28":0.00493,"46":0.00246,"72":0.00246,"73":0.00493,"76":0.00246,"77":0.01478,"79":0.01232,"82":0.00246,"85":0.00493,"94":0.00246,"95":0.05665,"98":0.00246,"99":0.00985,"100":0.04433,"101":0.22906,"102":0.25615,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 74 75 78 80 81 83 84 86 87 88 89 90 91 92 93 96 97 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00739,"13":0.00246,"14":0.00246,"15":0.00246,"16":0.00246,"17":0.00493,"18":0.02217,"84":0.00493,"89":0.00493,"90":0.00985,"92":0.02217,"100":0.00493,"107":0.00493,"108":0.00493,"109":0.0468,"110":0.00739,"111":0.00739,"112":0.01232,"113":0.01232,"114":0.03941,"115":0.06896,"116":1.20441,"117":0.88914,_:"79 80 81 83 85 86 87 88 91 93 94 95 96 97 98 99 101 102 103 104 105 106"},E:{"4":0,"13":0.00493,"14":0.01478,_:"0 5 6 7 8 9 10 11 12 15 3.1 3.2 6.1 7.1 9.1 10.1 17.1","5.1":0.02709,"11.1":0.00493,"12.1":0.00493,"13.1":0.02709,"14.1":0.02463,"15.1":0.02709,"15.2-15.3":0.00493,"15.4":0.00739,"15.5":0.00985,"15.6":0.0665,"16.0":0.00739,"16.1":0.01724,"16.2":0.01724,"16.3":0.03941,"16.4":0.01478,"16.5":0.0468,"16.6":0.23645,"17.0":0.0197},G:{"8":0.00273,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00182,"6.0-6.1":0,"7.0-7.1":0.02183,"8.1-8.4":0.00182,"9.0-9.2":0.00364,"9.3":0.03821,"10.0-10.2":0.00091,"10.3":0.04276,"11.0-11.2":0.01001,"11.3-11.4":0.00728,"12.0-12.1":0.02547,"12.2-12.5":0.49033,"13.0-13.1":0.01092,"13.2":0.10371,"13.3":0.13646,"13.4-13.7":0.05458,"14.0-14.4":0.19923,"14.5-14.8":0.24198,"15.0-15.1":0.1692,"15.2-15.3":0.11371,"15.4":0.09643,"15.5":0.16284,"15.6-15.7":1.17716,"16.0":0.28565,"16.1":0.3939,"16.2":0.2247,"16.3":0.46395,"16.4":0.18467,"16.5":0.46213,"16.6":3.45505,"17.0":0.4312,"17.1":0},P:{"4":0.13505,"20":0.11427,"21":0.20776,"22":2.50357,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.19738,"8.2":0,"9.2":0.02078,"10.1":0.01032,"11.1-11.2":0.03116,"12.0":0.02063,"13.0":0.02078,"14.0":0.02078,"15.0":0.02078,"16.0":0.06233,"17.0":0.05194,"18.0":0.04155,"19.0":0.11427},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00164,"4.2-4.3":0.00781,"4.4":0,"4.4.3-4.4.4":0.05838},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.0079,"9":0.00263,"10":0.00263,"11":0.06319,_:"6 7 5.5"},S:{"2.5":0.07537,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":59.23129},R:{_:"0"},M:{"0":0.24872},Q:{"13.1":0},O:{"0":0.52759},H:{"0":7.8491}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-an.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-an.js
index c03eed9538e88f..ff65e9d14b602f 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-an.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-an.js
@@ -1 +1 @@
-module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.30629,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.39063,"109":1.14526,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.43502,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.64809,"109":1.00321,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.0222,"116":0.00444,"117":0,"118":0,"119":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":1.33614,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0.01332,"116":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"17":0.364,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0.16868,"15.2-15.3":0.17756,"15.4":0.05771,"15.5":0.34624,"15.6":1.74009,"16.0":0.10654,"16.1":0.87448,"16.2":1.55809,"16.3":1.56253,"16.4":0.27078,"16.5":3.50237,"16.6":3.36032},G:{"8":0,"17":1.16453,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0.03065,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0,"14.5-14.8":0,"15.0-15.1":0.31412,"15.2-15.3":2.57422,"15.4":0.09194,"15.5":0.15323,"15.6-15.7":2.39035,"16.0":3.70811,"16.1":7.68436,"16.2":4.31335,"16.3":5.41659,"16.4":0.54396,"16.5":15.27678,"16.6":32.95158},P:{"4":0,"20":0,"21":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.66176},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":1.98064},R:{_:"0"},M:{"0":0.63395},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
+module.exports={C:{"2":0,"3":0,"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0.14933,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.05247,"109":0.43992,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0,"118":0,"119":0,"120":0,"3.5":0,"3.6":0},D:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"59":0,"60":0,"61":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0.12915,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0.2018,"109":0.1453,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0.04036,"117":0,"118":0,"119":0,"120":0},F:{"9":0,"11":0,"12":0,"15":0,"16":0,"17":0,"18":0,"19":0,"20":0,"21":0,"22":0,"23":0,"24":0,"25":0,"26":0,"27":0,"28":0,"29":0,"30":0,"31":0,"32":0,"33":0,"34":0,"35":0,"36":0,"37":0,"38":0,"39":0,"40":0,"41":0,"42":0,"43":0,"44":0,"45":0,"46":0,"47":0,"48":0,"49":0,"50":0,"51":0,"52":0,"53":0,"54":0,"55":0,"56":0,"57":0,"58":0,"60":0,"62":0,"63":0,"64":0,"65":0,"66":0,"67":0,"68":0,"69":0,"70":0,"71":0,"72":0,"73":0,"74":0,"75":0,"76":0,"77":0,"78":0,"79":0,"80":0,"81":0,"82":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"9.5-9.6":0,"10.0-10.1":0,"10.5":0,"10.6":0,"11.1":0,"11.5":0,"11.6":0,"12.1":0},B:{"12":0,"13":0,"14":0,"15":0,"16":0,"17":0,"18":0,"79":0,"80":0,"81":0,"83":0,"84":0,"85":0,"86":0,"87":0,"88":0,"89":0,"90":0,"91":0,"92":0,"93":0,"94":0,"95":0,"96":0,"97":0,"98":0,"99":0,"100":0,"101":0,"102":0,"103":0,"104":0,"105":0,"106":0,"107":0,"108":0,"109":0.3471,"110":0,"111":0,"112":0,"113":0,"114":0,"115":0,"116":0,"117":0},E:{"4":0,"5":0,"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"12":0,"13":0,"14":0,"15":0,_:"0","3.1":0,"3.2":0,"5.1":0,"6.1":0,"7.1":0,"9.1":0,"10.1":0,"11.1":0,"12.1":0,"13.1":0,"14.1":0,"15.1":0.2018,"15.2-15.3":0.27848,"15.4":0.04036,"15.5":0.0565,"15.6":1.13412,"16.0":0.02825,"16.1":0.70226,"16.2":0.39553,"16.3":0.64576,"16.4":0.23812,"16.5":1.19869,"16.6":8.24555,"17.0":0.85563,"17.1":0},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0,"7.0-7.1":0,"8.1-8.4":0,"9.0-9.2":0,"9.3":0,"10.0-10.2":0,"10.3":0,"11.0-11.2":0,"11.3-11.4":0,"12.0-12.1":0,"12.2-12.5":0,"13.0-13.1":0,"13.2":0,"13.3":0,"13.4-13.7":0,"14.0-14.4":0.01691,"14.5-14.8":0,"15.0-15.1":0.37191,"15.2-15.3":2.03706,"15.4":0.01691,"15.5":0.18596,"15.6-15.7":1.00585,"16.0":3.27114,"16.1":5.55333,"16.2":2.73863,"16.3":4.17556,"16.4":0.63394,"16.5":2.28219,"16.6":53.59762,"17.0":6.70287,"17.1":0.01691},P:{"4":0,"20":0,"21":0,"22":0,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0,"12.0":0,"13.0":0,"14.0":0,"15.0":0,"16.0":0,"17.0":0,"18.0":0,"19.0":0.30416},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0,"4.4":0,"4.4.3-4.4.4":0},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"6":0,"7":0,"8":0,"9":0,"10":0,"11":0,"5.5":0},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":0.42121},R:{_:"0"},M:{"0":0.19085},Q:{"13.1":0},O:{"0":0},H:{"0":0}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-as.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-as.js
index 3292db12cf667d..bd3fa3b97f78c7 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-as.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-as.js
@@ -1 +1 @@
-module.exports={C:{"34":0.00583,"36":0.00583,"43":0.0175,"52":0.05834,"56":0.00875,"72":0.07293,"78":0.00583,"83":0.01459,"88":0.00583,"102":0.0175,"103":0.00292,"107":0.00292,"108":0.00583,"109":0.00583,"110":0.00583,"111":0.00583,"112":0.00583,"113":0.01459,"114":0.01459,"115":0.37921,"116":0.62424,"117":0.02625,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 37 38 39 40 41 42 44 45 46 47 48 49 50 51 53 54 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 84 85 86 87 89 90 91 92 93 94 95 96 97 98 99 100 101 104 105 106 118 119 120 3.5 3.6"},D:{"11":0.00292,"34":0.00583,"35":0.00583,"38":0.02334,"47":0.00292,"48":0.00875,"49":0.02334,"50":0.02917,"53":0.01459,"55":0.00583,"56":0.00583,"57":0.00583,"61":0.00875,"62":0.00292,"63":0.00583,"65":0.00583,"66":0.00875,"67":0.00292,"68":0.00875,"69":0.09918,"70":0.04959,"71":0.00875,"72":0.00583,"73":0.05251,"74":0.04376,"75":0.035,"76":0.00583,"77":0.01167,"78":0.02334,"79":0.14293,"80":0.0175,"81":0.02042,"83":0.03792,"84":0.00875,"85":0.02042,"86":0.06417,"87":0.05542,"88":0.01167,"89":0.0175,"90":0.02334,"91":0.02625,"92":0.03792,"93":0.01167,"94":0.035,"95":0.02042,"96":0.02042,"97":0.03209,"98":0.11668,"99":0.06126,"100":0.035,"101":0.02334,"102":0.02334,"103":0.07001,"104":0.02334,"105":0.02917,"106":0.035,"107":0.04376,"108":0.07293,"109":2.36277,"110":0.03792,"111":0.07876,"112":0.10501,"113":0.12835,"114":0.7555,"115":9.09229,"116":4.9764,"117":0.0175,"118":0.00583,_:"4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 36 37 39 40 41 42 43 44 45 46 51 52 54 58 59 60 64 119"},F:{"28":0.00875,"36":0.00583,"46":0.02625,"95":0.03209,"99":0.00583,"100":0.15168,"101":0.15752,"102":0.00292,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00292,"18":0.01167,"92":0.01459,"106":0.00292,"107":0.00875,"108":0.01459,"109":0.08168,"110":0.0175,"111":0.0175,"112":0.0175,"113":0.04667,"114":0.10793,"115":1.99523,"116":0.64466,_:"12 13 14 15 16 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95 96 97 98 99 100 101 102 103 104 105"},E:{"4":0,"13":0.00875,"14":0.03792,"15":0.00583,"17":0.00875,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1 11.1","5.1":0.00875,"9.1":0.00292,"12.1":0.00875,"13.1":0.035,"14.1":0.09334,"15.1":0.01459,"15.2-15.3":0.01167,"15.4":0.03209,"15.5":0.05251,"15.6":0.19252,"16.0":0.01459,"16.1":0.05834,"16.2":0.04959,"16.3":0.13418,"16.4":0.04376,"16.5":0.35879,"16.6":0.53381},G:{"8":0,"17":0.06705,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00568,"5.0-5.1":0.00455,"6.0-6.1":0.00341,"7.0-7.1":0.01591,"8.1-8.4":0.00568,"9.0-9.2":0.00682,"9.3":0.03523,"10.0-10.2":0.00568,"10.3":0.06364,"11.0-11.2":0.02273,"11.3-11.4":0.0125,"12.0-12.1":0.01932,"12.2-12.5":0.29319,"13.0-13.1":0.01136,"13.2":0.01364,"13.3":0.02273,"13.4-13.7":0.08296,"14.0-14.4":0.21137,"14.5-14.8":0.34433,"15.0-15.1":0.12614,"15.2-15.3":0.1341,"15.4":0.16478,"15.5":0.20342,"15.6-15.7":1.23755,"16.0":0.41706,"16.1":0.6898,"16.2":0.39888,"16.3":0.7648,"16.4":0.25342,"16.5":1.93303,"16.6":3.78878},P:{"4":0.1991,"20":0.10479,"21":0.2515,"5.0-5.4":0.02096,"6.2-6.4":0,"7.2-7.4":0.0524,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02096,"12.0":0,"13.0":0.02096,"14.0":0.03144,"15.0":0.01048,"16.0":0.04192,"17.0":0.0524,"18.0":0.04192,"19.0":0.07335},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.12455,"4.2-4.3":0.04152,"4.4":0,"4.4.3-4.4.4":0.43591},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.02849,"9":0.05699,"11":0.89755,_:"6 7 10 5.5"},S:{"2.5":0.12039,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":53.14092},R:{_:"0"},M:{"0":0.1558},Q:{"13.1":0.38951},O:{"0":2.19542},H:{"0":1.24038}};
+module.exports={C:{"34":0.00604,"36":0.00604,"43":0.00604,"48":0.00604,"52":0.06038,"54":0.00604,"56":0.01811,"72":0.02717,"78":0.00604,"83":0.00604,"88":0.00604,"102":0.0151,"105":0.00302,"106":0.00302,"107":0.00302,"108":0.00604,"109":0.00302,"110":0.00604,"111":0.00604,"112":0.00302,"113":0.01208,"114":0.00604,"115":0.2385,"116":0.05736,"117":0.69739,"118":0.06642,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 37 38 39 40 41 42 44 45 46 47 49 50 51 53 55 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 84 85 86 87 89 90 91 92 93 94 95 96 97 98 99 100 101 103 104 119 120 3.5 3.6"},D:{"34":0.00906,"35":0.00302,"38":0.02415,"47":0.00302,"48":0.00906,"49":0.02717,"50":0.0151,"53":0.0151,"55":0.00906,"56":0.00604,"57":0.00302,"58":0.00302,"59":0.00302,"61":0.00604,"62":0.00302,"63":0.00604,"65":0.00302,"66":0.00906,"67":0.00302,"68":0.01208,"69":0.09057,"70":0.14189,"71":0.00906,"72":0.00604,"73":0.07246,"74":0.01208,"75":0.02113,"76":0.00604,"77":0.01811,"78":0.02415,"79":0.14793,"80":0.02113,"81":0.02415,"83":0.03925,"84":0.01208,"85":0.02415,"86":0.05434,"87":0.06642,"88":0.01811,"89":0.02113,"90":0.03019,"91":0.03019,"92":0.03019,"93":0.01208,"94":0.03321,"95":0.01208,"96":0.0151,"97":0.03019,"98":0.12378,"99":0.06038,"100":0.03321,"101":0.02415,"102":0.02415,"103":0.06944,"104":0.02415,"105":0.03019,"106":0.03925,"107":0.0483,"108":0.06944,"109":2.24312,"110":0.03623,"111":0.07849,"112":0.08453,"113":0.09963,"114":0.32001,"115":0.38945,"116":11.76806,"117":2.92239,"118":0.01811,"119":0.00302,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 36 37 39 40 41 42 43 44 45 46 51 52 54 60 64 120"},F:{"28":0.00906,"36":0.00604,"46":0.02415,"77":0.00604,"95":0.02717,"99":0.00302,"100":0.03321,"101":0.13586,"102":0.15699,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"17":0.00302,"18":0.0151,"90":0.00302,"92":0.01208,"106":0.00302,"107":0.00906,"108":0.01208,"109":0.0634,"110":0.01208,"111":0.01208,"112":0.0151,"113":0.03623,"114":0.0483,"115":0.08151,"116":1.56988,"117":1.11703,_:"12 13 14 15 16 79 80 81 83 84 85 86 87 88 89 91 93 94 95 96 97 98 99 100 101 102 103 104 105"},E:{"4":0,"13":0.00906,"14":0.03623,"15":0.00604,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1 11.1 17.1","5.1":0.00906,"9.1":0.02113,"12.1":0.00604,"13.1":0.03623,"14.1":0.08755,"15.1":0.0151,"15.2-15.3":0.01208,"15.4":0.03019,"15.5":0.0483,"15.6":0.18114,"16.0":0.0151,"16.1":0.05736,"16.2":0.04529,"16.3":0.12076,"16.4":0.03925,"16.5":0.12982,"16.6":0.87249,"17.0":0.04529},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00485,"5.0-5.1":0.00485,"6.0-6.1":0.00242,"7.0-7.1":0.01575,"8.1-8.4":0.00485,"9.0-9.2":0.01212,"9.3":0.0315,"10.0-10.2":0.00363,"10.3":0.06179,"11.0-11.2":0.0206,"11.3-11.4":0.01333,"12.0-12.1":0.01696,"12.2-12.5":0.27017,"13.0-13.1":0.00848,"13.2":0.01454,"13.3":0.10661,"13.4-13.7":0.07269,"14.0-14.4":0.19748,"14.5-14.8":0.29803,"15.0-15.1":0.12115,"15.2-15.3":0.126,"15.4":0.15871,"15.5":0.19263,"15.6-15.7":1.14609,"16.0":0.41797,"16.1":0.66633,"16.2":0.37799,"16.3":0.69177,"16.4":0.21202,"16.5":0.57547,"16.6":5.64323,"17.0":0.51732,"17.1":0},P:{"4":0.19818,"20":0.08345,"21":0.16689,"22":1.87754,"5.0-5.4":0.02086,"6.2-6.4":0,"7.2-7.4":0.05215,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02086,"12.0":0,"13.0":0.02086,"14.0":0.02086,"15.0":0.01043,"16.0":0.04172,"17.0":0.05215,"18.0":0.04172,"19.0":0.07302},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0,"4.2-4.3":0.0641,"4.4":0,"4.4.3-4.4.4":0.64098},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.01348,"9":0.09435,"11":0.84919,_:"6 7 10 5.5"},S:{"2.5":0.12566,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":51.89047},R:{_:"0"},M:{"0":0.16754},Q:{"13.1":0.38396},O:{"0":2.00355},H:{"0":1.20948}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-eu.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-eu.js
index b725b8f456083b..d4a6573578cb9a 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-eu.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-eu.js
@@ -1 +1 @@
-module.exports={C:{"45":0.00915,"48":0.01373,"50":0.01373,"52":0.06863,"53":0.0183,"56":0.00915,"59":0.01373,"68":0.00458,"78":0.04118,"83":0.00458,"87":0.01373,"88":0.00458,"89":0.00915,"90":0.01373,"91":0.00915,"102":0.2196,"103":0.08693,"104":0.00458,"105":0.01373,"106":0.00915,"107":0.01373,"108":0.0183,"109":0.01373,"110":0.01373,"111":0.03203,"112":0.0183,"113":0.0549,"114":0.05033,"115":1.02023,"116":3.0378,"117":0.11438,_:"2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 46 47 49 51 54 55 57 58 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 84 85 86 92 93 94 95 96 97 98 99 100 101 118 119 120 3.5 3.6"},D:{"34":0.00458,"38":0.01373,"43":0.00458,"47":0.00458,"48":0.00458,"49":0.04575,"52":0.00915,"56":0.0183,"58":0.00458,"60":0.04118,"63":0.00915,"66":0.06405,"68":0.00915,"69":0.00458,"70":0.00915,"71":0.00915,"72":0.00915,"73":0.00458,"74":0.0183,"75":0.01373,"76":0.01373,"77":0.00915,"78":0.0366,"79":0.13268,"80":0.02288,"81":0.02745,"83":0.02745,"84":0.00915,"85":0.13268,"86":0.03203,"87":0.04575,"88":0.02745,"89":0.02288,"90":0.0183,"91":0.0366,"92":0.02288,"93":0.05948,"94":0.05033,"95":0.0183,"96":0.03203,"97":0.00915,"98":0.01373,"99":0.0366,"100":0.02288,"101":0.03203,"102":0.0366,"103":0.15555,"104":0.11895,"105":0.05033,"106":0.1098,"107":0.06863,"108":0.10523,"109":1.6287,"110":0.06863,"111":0.12353,"112":0.1647,"113":0.23333,"114":1.56923,"115":13.03875,"116":6.9723,"117":0.01373,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 44 45 46 50 51 53 54 55 57 59 61 62 64 65 67 118 119"},F:{"28":0.00458,"31":0.01373,"40":0.01373,"46":0.01373,"76":0.00915,"85":0.00915,"95":0.11438,"99":0.03203,"100":1.12088,"101":0.77775,"102":0.01373,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 32 33 34 35 36 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 77 78 79 80 81 82 83 84 86 87 88 89 90 91 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00458,"17":0.00915,"18":0.00458,"90":0.01373,"92":0.00915,"103":0.00458,"106":0.00458,"107":0.01373,"108":0.0183,"109":0.10065,"110":0.0183,"111":0.02745,"112":0.03203,"113":0.0366,"114":0.28365,"115":4.56128,"116":1.49145,_:"12 13 14 16 79 80 81 83 84 85 86 87 88 89 91 93 94 95 96 97 98 99 100 101 102 104 105"},E:{"4":0,"13":0.00915,"14":0.0549,"15":0.00915,"17":0.02288,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.0366,"11.1":0.01373,"12.1":0.02288,"13.1":0.10523,"14.1":0.1647,"15.1":0.02745,"15.2-15.3":0.0183,"15.4":0.04118,"15.5":0.06405,"15.6":0.40718,"16.0":0.05033,"16.1":0.10065,"16.2":0.1098,"16.3":0.27908,"16.4":0.10523,"16.5":0.86925,"16.6":1.30388},G:{"8":0,"17":0.13244,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00331,"6.0-6.1":0,"7.0-7.1":0.00993,"8.1-8.4":0.00166,"9.0-9.2":0.00828,"9.3":0.0596,"10.0-10.2":0.00166,"10.3":0.0596,"11.0-11.2":0.02483,"11.3-11.4":0.03973,"12.0-12.1":0.00993,"12.2-12.5":0.28474,"13.0-13.1":0.00497,"13.2":0.00331,"13.3":0.01324,"13.4-13.7":0.03476,"14.0-14.4":0.08939,"14.5-14.8":0.19203,"15.0-15.1":0.06953,"15.2-15.3":0.07946,"15.4":0.07946,"15.5":0.13575,"15.6-15.7":1.20517,"16.0":0.5463,"16.1":1.04956,"16.2":0.48505,"16.3":1.02638,"16.4":0.19369,"16.5":3.25131,"16.6":7.45119},P:{"4":0.0633,"20":0.1055,"21":0.26376,"22":3.0385,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.19386,"8.2":0,"9.2":0.02041,"10.1":0,"11.1-11.2":0.01055,"12.0":0.0102,"13.0":0.0211,"14.0":0.01055,"15.0":0.02041,"16.0":0.01055,"17.0":0.03165,"18.0":0.0211,"19.0":0.05275},I:{"0":0,"3":0,"4":0.00513,"2.1":0,"2.2":0,"2.3":0,"4.1":0.0359,"4.2-4.3":0.02821,"4.4":0,"4.4.3-4.4.4":0.07181},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.01415,"9":0.01415,"11":0.12267,_:"6 7 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":33.12368},R:{_:"0"},M:{"0":0.47198},Q:{"13.1":0},O:{"0":0.1736},H:{"0":0.55469}};
+module.exports={C:{"12":0.00482,"45":0.01928,"48":0.02891,"50":0.0241,"52":0.06747,"53":0.03373,"56":0.00964,"59":0.01446,"68":0.00482,"78":0.03373,"83":0.00482,"87":0.00482,"88":0.00482,"91":0.00964,"102":0.2024,"103":0.09638,"104":0.00964,"105":0.00964,"106":0.00964,"107":0.00964,"108":0.01446,"109":0.01446,"110":0.00964,"111":0.00964,"112":0.01446,"113":0.02891,"114":0.0241,"115":0.54937,"116":0.17348,"117":3.2962,"118":0.30842,_:"2 3 4 5 6 7 8 9 10 11 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 46 47 49 51 54 55 57 58 60 61 62 63 64 65 66 67 69 70 71 72 73 74 75 76 77 79 80 81 82 84 85 86 89 90 92 93 94 95 96 97 98 99 100 101 119 120 3.5 3.6"},D:{"34":0.00482,"38":0.00964,"43":0.00482,"47":0.00482,"48":0.00482,"49":0.03855,"51":0.00482,"52":0.00964,"56":0.00964,"60":0.04337,"63":0.00964,"66":0.05301,"68":0.00964,"69":0.00482,"70":0.00964,"71":0.00964,"72":0.00964,"73":0.00964,"74":0.01928,"75":0.01928,"76":0.01928,"77":0.01928,"78":0.03855,"79":0.11084,"80":0.02891,"81":0.03373,"83":0.0241,"84":0.01446,"85":0.08674,"86":0.03855,"87":0.06747,"88":0.02891,"89":0.02891,"90":0.05301,"91":0.05301,"92":0.0241,"93":0.07229,"94":0.04337,"95":0.01446,"96":0.03855,"97":0.01446,"98":0.01446,"99":0.02891,"100":0.02891,"101":0.03373,"102":0.04819,"103":0.16385,"104":0.05301,"105":0.06265,"106":0.10602,"107":0.09156,"108":0.11084,"109":1.57581,"110":0.06747,"111":0.08674,"112":0.13011,"113":0.13493,"114":0.52527,"115":0.84814,"116":17.47369,"117":4.94429,"118":0.00964,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 44 45 46 50 53 54 55 57 58 59 61 62 64 65 67 119 120"},F:{"31":0.00964,"36":0.00482,"40":0.00964,"46":0.01446,"76":0.00964,"77":0.00482,"85":0.00964,"95":0.10602,"99":0.01928,"100":0.24577,"101":0.67948,"102":1.25294,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 33 34 35 37 38 39 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 78 79 80 81 82 83 84 86 87 88 89 90 91 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.00482,"17":0.00964,"18":0.00482,"90":0.01928,"92":0.00964,"103":0.00482,"106":0.00482,"107":0.01446,"108":0.01446,"109":0.09638,"110":0.01446,"111":0.01928,"112":0.01928,"113":0.0241,"114":0.1012,"115":0.21204,"116":3.23837,"117":2.66009,_:"12 13 14 16 79 80 81 83 84 85 86 87 88 89 91 93 94 95 96 97 98 99 100 101 102 104 105"},E:{"4":0,"13":0.00964,"14":0.05783,"15":0.00964,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1 17.1","9.1":0.02891,"11.1":0.01446,"12.1":0.0241,"13.1":0.09156,"14.1":0.16867,"15.1":0.0241,"15.2-15.3":0.01928,"15.4":0.04337,"15.5":0.06265,"15.6":0.3807,"16.0":0.04819,"16.1":0.1012,"16.2":0.1012,"16.3":0.24095,"16.4":0.11084,"16.5":0.34215,"16.6":1.92278,"17.0":0.12048},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00337,"6.0-6.1":0,"7.0-7.1":0.00843,"8.1-8.4":0,"9.0-9.2":0.01011,"9.3":0.05224,"10.0-10.2":0,"10.3":0.05392,"11.0-11.2":0.02359,"11.3-11.4":0.02865,"12.0-12.1":0.00843,"12.2-12.5":0.2477,"13.0-13.1":0.00506,"13.2":0.00337,"13.3":0.48865,"13.4-13.7":0.03033,"14.0-14.4":0.08425,"14.5-14.8":0.18535,"15.0-15.1":0.06066,"15.2-15.3":0.07414,"15.4":0.07414,"15.5":0.13312,"15.6-15.7":1.06829,"16.0":0.50382,"16.1":0.90148,"16.2":0.4162,"16.3":0.81386,"16.4":0.14154,"16.5":0.46001,"16.6":9.63318,"17.0":1.11379,"17.1":0.00337},P:{"4":0.04264,"20":0.07461,"21":0.15989,"22":2.94188,"5.0-5.4":0.02086,"6.2-6.4":0,"7.2-7.4":0.05215,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01066,"12.0":0,"13.0":0.01066,"14.0":0.02086,"15.0":0.01043,"16.0":0.01066,"17.0":0.02132,"18.0":0.02132,"19.0":0.0533},I:{"0":0,"3":0.02176,"4":0.00484,"2.1":0,"2.2":0.00242,"2.3":0,"4.1":0.00967,"4.2-4.3":0.00967,"4.4":0,"4.4.3-4.4.4":0.06045},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.01496,"9":0.01496,"11":0.11466,_:"6 7 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":31.10672},R:{_:"0"},M:{"0":0.45593},Q:{"13.1":0},O:{"0":0.15543},H:{"0":0.51993}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-na.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-na.js
index 4ec7ec9b562ed7..919ff4040c4b1b 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-na.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-na.js
@@ -1 +1 @@
-module.exports={C:{"4":0.0065,"11":0.02601,"44":0.01301,"48":0.0065,"52":0.02601,"78":0.09755,"91":0.0065,"94":0.03902,"102":0.11055,"108":0.01301,"109":0.01301,"110":0.01301,"111":0.01301,"112":0.18859,"113":0.02601,"114":0.04552,"115":0.61779,"116":1.56722,"117":0.05202,_:"2 3 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 45 46 47 49 50 51 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 89 90 92 93 95 96 97 98 99 100 101 103 104 105 106 107 118 119 120 3.5 3.6"},D:{"48":0.03902,"49":0.03902,"51":0.0065,"56":0.13006,"62":0.0065,"63":0.0065,"65":0.01951,"66":0.02601,"67":0.0065,"68":0.10405,"69":0.07804,"70":0.04552,"71":0.05202,"72":0.07153,"73":0.02601,"74":0.09104,"75":0.09104,"76":0.28613,"77":0.06503,"78":0.07804,"79":0.35116,"80":0.2146,"81":0.13656,"83":0.29264,"84":0.08454,"85":0.15607,"86":0.18208,"87":0.16908,"88":0.11705,"89":0.08454,"90":0.11705,"91":0.09755,"92":0.03902,"93":0.33816,"94":0.02601,"95":0.01951,"96":0.02601,"97":0.02601,"98":0.03252,"99":0.03252,"100":0.03902,"101":0.06503,"102":0.06503,"103":0.46822,"104":0.06503,"105":0.07804,"106":0.04552,"107":0.28613,"108":0.39668,"109":1.17054,"110":0.37717,"111":0.71533,"112":0.46171,"113":0.46171,"114":4.5456,"115":18.14337,"116":5.88522,"117":0.02601,"118":0.0065,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 50 52 53 54 55 57 58 59 60 61 64 119"},F:{"53":0.0065,"54":0.01301,"55":0.01301,"95":0.03252,"97":0.24711,"98":0.0065,"99":0.06503,"100":1.5087,"101":0.62429,"102":0.0065,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 96 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.0065,"17":0.0065,"18":0.01301,"79":0.0065,"80":0.01301,"81":0.01301,"83":0.01951,"84":0.01951,"85":0.01301,"86":0.01951,"87":0.01301,"88":0.01301,"89":0.01301,"90":0.01301,"92":0.01301,"99":0.04552,"107":0.0065,"108":0.0065,"109":0.08454,"110":0.01301,"111":0.25362,"112":0.26012,"113":0.02601,"114":1.58023,"115":4.28548,"116":1.35262,_:"12 13 14 16 91 93 94 95 96 97 98 100 101 102 103 104 105 106"},E:{"4":0,"9":0.0065,"13":0.03902,"14":0.24061,"15":0.03902,"17":0.05202,_:"0 5 6 7 8 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1","9.1":0.4292,"11.1":0.0065,"12.1":0.06503,"13.1":0.31214,"14.1":0.56576,"15.1":0.09104,"15.2-15.3":0.08454,"15.4":0.15607,"15.5":0.27963,"15.6":1.28109,"16.0":0.48773,"16.1":0.4227,"16.2":0.44871,"16.3":0.96244,"16.4":0.46171,"16.5":2.57519,"16.6":3.64168},G:{"8":0,"17":0.12493,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00174,"5.0-5.1":0,"6.0-6.1":0.00521,"7.0-7.1":0.00521,"8.1-8.4":0.00174,"9.0-9.2":0.01041,"9.3":0.03123,"10.0-10.2":0,"10.3":0.0347,"11.0-11.2":0.01735,"11.3-11.4":0.01562,"12.0-12.1":0.01041,"12.2-12.5":0.15964,"13.0-13.1":0.00521,"13.2":0.00521,"13.3":0.01562,"13.4-13.7":0.0347,"14.0-14.4":0.0937,"14.5-14.8":0.17699,"15.0-15.1":0.06247,"15.2-15.3":0.08329,"15.4":0.08676,"15.5":0.14923,"15.6-15.7":0.9613,"16.0":0.43553,"16.1":1.0845,"16.2":0.51535,"16.3":1.02724,"16.4":0.16831,"16.5":3.43222,"16.6":8.57882},P:{"4":0.01121,"20":0.04484,"21":0.08967,"22":1.06487,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.19386,"8.2":0,"9.2":0.02041,"10.1":0,"11.1-11.2":0.01055,"12.0":0.0102,"13.0":0.0211,"14.0":0.01055,"15.0":0.02041,"16.0":0.01055,"17.0":0.01121,"18.0":0.01121,"19.0":0.02242},I:{"0":0,"3":0.00574,"4":0.00766,"2.1":0.00287,"2.2":0.00861,"2.3":0.00191,"4.1":0.00479,"4.2-4.3":0.02584,"4.4":0,"4.4.3-4.4.4":0.0335},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.01445,"9":0.02168,"11":0.09393,_:"6 7 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":16.06545},R:{_:"0"},M:{"0":0.28326},Q:{"13.1":0.02098},O:{"0":0.06644},H:{"0":0.19533}};
+module.exports={C:{"4":0.0066,"11":0.01981,"44":0.01321,"48":0.02642,"52":0.03302,"53":0.0066,"59":0.0066,"78":0.07925,"89":0.01321,"91":0.0066,"94":0.01321,"102":0.11227,"108":0.01321,"109":0.01321,"110":0.01321,"111":0.01321,"112":0.19152,"113":0.01981,"114":0.01981,"115":0.26416,"116":0.1651,"117":1.73025,"118":0.12548,_:"2 3 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 45 46 47 49 50 51 54 55 56 57 58 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 83 84 85 86 87 88 90 92 93 95 96 97 98 99 100 101 103 104 105 106 107 119 120 3.5 3.6"},D:{"48":0.03962,"49":0.04623,"51":0.0066,"56":0.09246,"58":0.01321,"60":0.0066,"62":0.0066,"63":0.0066,"65":0.03302,"66":0.02642,"67":0.0066,"68":0.07925,"69":0.07264,"70":0.05944,"71":0.05944,"72":0.08585,"73":0.02642,"74":0.09906,"75":0.09246,"76":0.31699,"77":0.07264,"78":0.09246,"79":0.37643,"80":0.1651,"81":0.13868,"83":0.29718,"84":0.09246,"85":0.19152,"86":0.19152,"87":0.17831,"88":0.13868,"89":0.09906,"90":0.13868,"91":0.10566,"92":0.03302,"93":0.34341,"94":0.01981,"95":0.01981,"96":0.02642,"97":0.03302,"98":0.03962,"99":0.03302,"100":0.04623,"101":0.05944,"102":0.05944,"103":0.48209,"104":0.07264,"105":0.07264,"106":0.05283,"107":0.41605,"108":0.51511,"109":1.22174,"110":0.4953,"111":0.89814,"112":0.57455,"113":0.25756,"114":1.86233,"115":3.51333,"116":19.20443,"117":4.38506,"118":0.03302,"119":0.03302,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 50 52 53 54 55 57 59 61 64 120"},F:{"53":0.01321,"54":0.01321,"55":0.01321,"76":0.0066,"89":0.01981,"95":0.03302,"97":0.37643,"98":0.0066,"99":0.05283,"100":0.58115,"101":1.06324,"102":0.79908,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 77 78 79 80 81 82 83 84 85 86 87 88 90 91 92 93 94 96 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.0066,"18":0.0066,"79":0.0066,"80":0.01981,"81":0.01981,"83":0.02642,"84":0.01981,"85":0.01321,"86":0.01981,"87":0.01981,"88":0.01321,"89":0.01321,"90":0.01321,"92":0.01321,"99":0.04623,"108":0.0066,"109":0.07925,"110":0.01321,"111":0.38303,"112":0.38303,"113":0.01321,"114":0.44247,"115":0.20472,"116":3.6322,"117":2.1529,_:"13 14 15 16 17 91 93 94 95 96 97 98 100 101 102 103 104 105 106 107"},E:{"4":0,"9":0.0066,"13":0.03962,"14":0.20472,"15":0.03962,_:"0 5 6 7 8 10 11 12 3.1 3.2 5.1 6.1 7.1 10.1 17.1","9.1":0.54153,"11.1":0.0066,"12.1":0.05944,"13.1":0.31699,"14.1":0.54153,"15.1":0.09246,"15.2-15.3":0.07925,"15.4":0.15189,"15.5":0.24435,"15.6":1.23495,"16.0":0.1651,"16.1":0.36982,"16.2":0.36982,"16.3":0.8321,"16.4":0.46888,"16.5":1.01702,"16.6":5.50113,"17.0":0.17831},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0,"6.0-6.1":0.00674,"7.0-7.1":0.00337,"8.1-8.4":0.00169,"9.0-9.2":0.00843,"9.3":0.02866,"10.0-10.2":0,"10.3":0.0354,"11.0-11.2":0.01686,"11.3-11.4":0.01349,"12.0-12.1":0.01011,"12.2-12.5":0.15002,"13.0-13.1":0.00506,"13.2":0.00506,"13.3":0.01854,"13.4-13.7":0.03203,"14.0-14.4":0.08597,"14.5-14.8":0.15676,"15.0-15.1":0.05731,"15.2-15.3":0.07585,"15.4":0.07585,"15.5":0.12811,"15.6-15.7":0.85125,"16.0":0.36578,"16.1":0.88159,"16.2":0.41467,"16.3":0.7636,"16.4":0.11631,"16.5":0.40624,"16.6":11.17919,"17.0":0.75517,"17.1":0.00337},P:{"4":0.01113,"20":0.03338,"21":0.06677,"22":1.04604,"5.0-5.4":0.02086,"6.2-6.4":0,"7.2-7.4":0.05215,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01066,"12.0":0,"13.0":0.01066,"14.0":0.02086,"15.0":0.01043,"16.0":0.01066,"17.0":0.01113,"18.0":0.01113,"19.0":0.02226},I:{"0":0,"3":0.00611,"4":0.00815,"2.1":0.00306,"2.2":0.00917,"2.3":0.00204,"4.1":0.00407,"4.2-4.3":0.0275,"4.4":0,"4.4.3-4.4.4":0.03157},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.00784,"9":0.02353,"11":0.09411,_:"6 7 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":15.69797},R:{_:"0"},M:{"0":0.30895},Q:{"13.1":0.01019},O:{"0":0.06111},H:{"0":0.19606}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-oc.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-oc.js
index 8cf3b72208995a..13df5df4b86b38 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-oc.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-oc.js
@@ -1 +1 @@
-module.exports={C:{"11":0.02618,"34":0.00524,"48":0.00524,"52":0.01571,"54":0.01571,"59":0.00524,"78":0.03141,"83":0.00524,"102":0.07329,"103":0.01047,"108":0.00524,"109":0.01047,"110":0.01047,"111":0.01047,"112":0.00524,"113":0.02094,"114":0.05759,"115":0.60726,"116":1.65426,"117":0.04712,_:"2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 55 56 57 58 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 104 105 106 107 118 119 120 3.5 3.6"},D:{"25":0.02094,"26":0.01047,"34":0.02618,"38":0.089,"44":0.00524,"47":0.00524,"49":0.02618,"52":0.01047,"56":0.00524,"59":0.03141,"65":0.01047,"66":0.04712,"67":0.00524,"68":0.01047,"69":0.00524,"72":0.00524,"74":0.01571,"75":0.01047,"76":0.01047,"78":0.01047,"79":0.11517,"80":0.01047,"81":0.04188,"83":0.01571,"85":0.02094,"86":0.03665,"87":0.06806,"88":0.05235,"89":0.01047,"90":0.02094,"91":0.02618,"92":0.01571,"93":0.05759,"94":0.01571,"95":0.01047,"96":0.02094,"97":0.02618,"98":0.02094,"99":0.04188,"100":0.03141,"101":0.05235,"102":0.03665,"103":0.28269,"104":0.06282,"105":0.03141,"106":0.04712,"107":0.07853,"108":0.1047,"109":0.93183,"110":0.089,"111":0.12041,"112":0.21464,"113":0.36122,"114":2.45522,"115":17.03469,"116":8.11425,"117":0.03141,"118":0.01047,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 45 46 48 50 51 53 54 55 57 58 60 61 62 63 64 70 71 73 77 84 119"},F:{"28":0.00524,"46":0.04188,"89":0.01047,"95":0.01571,"99":0.02618,"100":0.54444,"101":0.24081,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 90 91 92 93 94 96 97 98 102 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"18":0.00524,"92":0.01047,"104":0.01047,"105":0.01047,"107":0.01047,"108":0.01571,"109":0.07329,"110":0.01571,"111":0.01571,"112":0.03665,"113":0.04188,"114":0.35598,"115":4.93137,"116":1.56527,_:"12 13 14 15 16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95 96 97 98 99 100 101 102 103 106"},E:{"4":0,"9":0.01047,"13":0.03141,"14":0.15182,"15":0.03141,"17":0.03141,_:"0 5 6 7 8 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1","11.1":0.01047,"12.1":0.05235,"13.1":0.21987,"14.1":0.43974,"15.1":0.06282,"15.2-15.3":0.06282,"15.4":0.10994,"15.5":0.18323,"15.6":0.99989,"16.0":0.089,"16.1":0.26699,"16.2":0.24605,"16.3":0.70149,"16.4":0.24605,"16.5":2.04689,"16.6":2.95254},G:{"8":0.00467,"17":0.13999,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.007,"6.0-6.1":0.01167,"7.0-7.1":0.00933,"8.1-8.4":0.014,"9.0-9.2":0.00467,"9.3":0.10033,"10.0-10.2":0.00467,"10.3":0.13766,"11.0-11.2":0.12599,"11.3-11.4":0.05833,"12.0-12.1":0.03033,"12.2-12.5":0.57862,"13.0-13.1":0.007,"13.2":0.00467,"13.3":0.02566,"13.4-13.7":0.056,"14.0-14.4":0.16099,"14.5-14.8":0.31031,"15.0-15.1":0.10732,"15.2-15.3":0.12599,"15.4":0.14699,"15.5":0.22165,"15.6-15.7":1.62853,"16.0":0.64628,"16.1":1.54454,"16.2":0.70928,"16.3":1.43255,"16.4":0.25198,"16.5":4.22766,"16.6":10.48515},P:{"4":0.22581,"20":0.10753,"21":0.26883,"5.0-5.4":0.03226,"6.2-6.4":0,"7.2-7.4":0.0524,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02096,"12.0":0,"13.0":0.02151,"14.0":0.01075,"15.0":0.01075,"16.0":0.03226,"17.0":0.02151,"18.0":0.03226,"19.0":0.06452},I:{"0":0,"3":0,"4":0.00729,"2.1":0,"2.2":0.00313,"2.3":0.00521,"4.1":0.00521,"4.2-4.3":0.01042,"4.4":0,"4.4.3-4.4.4":0.03543},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.06965,"9":0.04643,"10":0.01161,"11":0.1393,_:"6 7 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":20.60695},R:{_:"0"},M:{"0":0.40018},Q:{"13.1":0.00953},O:{"0":0.07146},H:{"0":0.1759}};
+module.exports={C:{"11":0.07274,"34":0.0052,"48":0.0052,"52":0.02078,"54":0.01039,"59":0.0052,"78":0.03118,"83":0.0052,"87":0.0052,"102":0.05716,"103":0.0052,"108":0.0052,"109":0.01039,"110":0.0052,"111":0.01039,"113":0.01559,"114":0.02598,"115":0.24941,"116":0.15588,"117":1.76144,"118":0.15068,_:"2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 38 39 40 41 42 43 44 45 46 47 49 50 51 53 55 56 57 58 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 79 80 81 82 84 85 86 88 89 90 91 92 93 94 95 96 97 98 99 100 101 104 105 106 107 112 119 120 3.5 3.6"},D:{"25":0.02078,"26":0.01039,"34":0.02598,"38":0.08314,"39":0.0052,"40":0.0052,"41":0.0052,"42":0.0052,"43":0.01039,"44":0.01039,"45":0.01039,"46":0.01039,"47":0.01039,"48":0.0052,"49":0.03118,"50":0.0052,"51":0.01039,"52":0.01559,"53":0.01039,"55":0.01039,"56":0.01039,"57":0.0052,"58":0.0052,"59":0.03118,"60":0.01039,"65":0.0052,"66":0.04676,"67":0.02598,"68":0.01039,"69":0.17147,"70":0.0052,"74":0.01039,"75":0.01039,"76":0.0052,"78":0.01039,"79":0.10392,"80":0.01039,"81":0.03637,"83":0.01039,"85":0.02598,"86":0.03118,"87":0.06755,"88":0.04676,"89":0.01559,"90":0.02078,"91":0.01559,"92":0.01559,"93":0.10912,"94":0.01559,"95":0.0052,"96":0.01559,"97":0.01559,"98":0.02078,"99":0.03637,"100":0.02598,"101":0.04676,"102":0.03637,"103":0.24421,"104":0.05196,"105":0.03118,"106":0.04676,"107":0.07794,"108":0.10392,"109":0.87812,"110":0.27019,"111":0.08833,"112":0.16108,"113":0.22343,"114":0.76381,"115":1.31978,"116":20.83076,"117":4.98296,"118":0.02598,"119":0.0052,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 27 28 29 30 31 32 33 35 36 37 54 61 62 63 64 71 72 73 77 84 120"},F:{"28":0.0052,"46":0.03637,"95":0.01559,"99":0.01559,"100":0.17147,"101":0.32735,"102":0.43646,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"15":0.01559,"18":0.0052,"85":0.0052,"92":0.0052,"105":0.0052,"107":0.01039,"108":0.01559,"109":0.07274,"110":0.01039,"111":0.01559,"112":0.02078,"113":0.03118,"114":0.09872,"115":0.22343,"116":3.58004,"117":2.49408,_:"12 13 14 16 17 79 80 81 83 84 86 87 88 89 90 91 93 94 95 96 97 98 99 100 101 102 103 104 106"},E:{"4":0,"9":0.01039,"13":0.03118,"14":0.15068,"15":0.03118,_:"0 5 6 7 8 10 11 12 3.1 3.2 5.1 6.1 7.1 9.1 10.1 17.1","11.1":0.01039,"12.1":0.05196,"13.1":0.19225,"14.1":0.3949,"15.1":0.05716,"15.2-15.3":0.06235,"15.4":0.10392,"15.5":0.16627,"15.6":0.93008,"16.0":0.08314,"16.1":0.24941,"16.2":0.21304,"16.3":0.54558,"16.4":0.19745,"16.5":0.57156,"16.6":4.43219,"17.0":0.15068},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00727,"6.0-6.1":0.01212,"7.0-7.1":0.00727,"8.1-8.4":0.01212,"9.0-9.2":0.00727,"9.3":0.08487,"10.0-10.2":0.00242,"10.3":0.12852,"11.0-11.2":0.08487,"11.3-11.4":0.0582,"12.0-12.1":0.0291,"12.2-12.5":0.52861,"13.0-13.1":0.00485,"13.2":0.00485,"13.3":0.02667,"13.4-13.7":0.05335,"14.0-14.4":0.15034,"14.5-14.8":0.29098,"15.0-15.1":0.09942,"15.2-15.3":0.11397,"15.4":0.14549,"15.5":0.20126,"15.6-15.7":1.56886,"16.0":0.65955,"16.1":1.37973,"16.2":0.6547,"16.3":1.21969,"16.4":0.19641,"16.5":0.63531,"16.6":14.67265,"17.0":0.94083,"17.1":0},P:{"4":0.21482,"20":0.07519,"21":0.17186,"22":2.58862,"5.0-5.4":0.03222,"6.2-6.4":0,"7.2-7.4":0.05215,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.01066,"12.0":0,"13.0":0.02148,"14.0":0.01074,"15.0":0.01043,"16.0":0.02148,"17.0":0.02148,"18.0":0.02148,"19.0":0.05371},I:{"0":0,"3":0,"4":0.00747,"2.1":0.00427,"2.2":0.00427,"2.3":0.00534,"4.1":0.00427,"4.2-4.3":0.00961,"4.4":0,"4.4.3-4.4.4":0.03203},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.06153,"9":0.04923,"11":0.12306,_:"6 7 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":20.4107},R:{_:"0"},M:{"0":0.40354},Q:{"13.1":0.00961},O:{"0":0.07206},H:{"0":0.19102}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-sa.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-sa.js
index 5374e9cde5af8a..c85ef97360ace0 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-sa.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-sa.js
@@ -1 +1 @@
-module.exports={C:{"7":0.05102,"27":0.00425,"42":0.03402,"45":0.03402,"50":0.0978,"52":0.14457,"54":0.11055,"66":0.00425,"68":0.00425,"73":0.00425,"78":0.01276,"86":0.00425,"88":0.01276,"91":0.03402,"99":0.00425,"102":0.03827,"103":0.00425,"104":0.00425,"105":0.00425,"106":0.00425,"107":0.00425,"108":0.0085,"109":0.0085,"110":0.0085,"111":0.0085,"112":0.0085,"113":0.02126,"114":0.03402,"115":0.5315,"116":1.01198,"117":0.04252,_:"2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 28 29 30 31 32 33 34 35 36 37 38 39 40 41 43 44 46 47 48 49 51 53 55 56 57 58 59 60 61 62 63 64 65 67 69 70 71 72 74 75 76 77 79 80 81 82 83 84 85 87 89 90 92 93 94 95 96 97 98 100 101 118 119 120 3.5 3.6"},D:{"38":0.01701,"47":0.05102,"49":0.05528,"51":0.0085,"53":0.00425,"55":0.05528,"57":0.11055,"60":0.31465,"62":0.0085,"63":0.00425,"65":0.00425,"66":0.01276,"68":0.01276,"70":0.00425,"71":0.00425,"72":0.00425,"73":0.0085,"74":0.0085,"75":0.01276,"76":0.0085,"77":0.01276,"78":0.0085,"79":0.14882,"80":0.01276,"81":0.02976,"83":0.01276,"84":0.0085,"85":0.02551,"86":0.02126,"87":0.05102,"88":0.02551,"89":0.01276,"90":0.01701,"91":0.38268,"92":0.01701,"93":0.01276,"94":0.01276,"95":0.01276,"96":0.01701,"97":0.01701,"98":0.01276,"99":0.02126,"100":0.01701,"101":0.01701,"102":0.02126,"103":0.08929,"104":0.02126,"105":0.04252,"106":0.04252,"107":0.05953,"108":0.07654,"109":3.21026,"110":0.04677,"111":0.06378,"112":0.10205,"113":0.12756,"114":0.84615,"115":14.84373,"116":8.8314,"117":0.01276,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 48 50 52 54 56 58 59 61 64 67 69 118 119"},F:{"28":0.01276,"85":0.00425,"95":0.08929,"99":0.02551,"100":2.20679,"101":0.82914,"102":0.01276,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 86 87 88 89 90 91 92 93 94 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.05102,"13":0.10205,"14":0.1063,"15":0.07654,"18":0.0085,"92":0.01701,"107":0.00425,"108":0.00425,"109":0.05528,"110":0.0085,"111":0.0085,"112":0.0085,"113":0.01276,"114":0.12331,"115":2.15576,"116":0.80363,_:"16 17 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95 96 97 98 99 100 101 102 103 104 105 106"},E:{"4":0,"14":0.01701,"17":0.00425,_:"0 5 6 7 8 9 10 11 12 13 15 3.1 3.2 6.1 7.1 10.1 11.1 12.1","5.1":0.01701,"9.1":0.01276,"13.1":0.02551,"14.1":0.03827,"15.1":0.00425,"15.2-15.3":0.00425,"15.4":0.01276,"15.5":0.01276,"15.6":0.07654,"16.0":0.0085,"16.1":0.02551,"16.2":0.01701,"16.3":0.05528,"16.4":0.02551,"16.5":0.17433,"16.6":0.19134},G:{"8":0.00068,"17":0.04586,"3.2":0.00068,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.00548,"6.0-6.1":0,"7.0-7.1":0.00479,"8.1-8.4":0.00274,"9.0-9.2":0.00274,"9.3":0.01916,"10.0-10.2":0.00205,"10.3":0.02601,"11.0-11.2":0.0089,"11.3-11.4":0.01848,"12.0-12.1":0.00684,"12.2-12.5":0.09855,"13.0-13.1":0.00342,"13.2":0.00205,"13.3":0.00548,"13.4-13.7":0.01437,"14.0-14.4":0.03217,"14.5-14.8":0.08487,"15.0-15.1":0.01916,"15.2-15.3":0.02875,"15.4":0.03011,"15.5":0.0527,"15.6-15.7":0.65771,"16.0":0.20943,"16.1":0.37916,"16.2":0.17384,"16.3":0.40791,"16.4":0.06707,"16.5":1.25109,"16.6":3.17906},P:{"4":0.15564,"20":0.08301,"21":0.16601,"22":1.75349,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.21789,"8.2":0,"9.2":0.02041,"10.1":0,"11.1-11.2":0.02075,"12.0":0.0102,"13.0":0.02075,"14.0":0.01055,"15.0":0.02041,"16.0":0.0415,"17.0":0.07263,"18.0":0.02075,"19.0":0.05188},I:{"0":0,"3":0,"4":0,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00635,"4.2-4.3":0.00212,"4.4":0,"4.4.3-4.4.4":0.03177},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.00861,"9":0.10758,"11":0.24098,_:"6 7 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":48.94621},R:{_:"0"},M:{"0":0.12648},Q:{"13.1":0},O:{"0":0.06324},H:{"0":0.23948}};
+module.exports={C:{"7":0.06306,"42":0.04504,"45":0.03153,"50":0.13062,"52":0.16214,"54":0.14413,"68":0.0045,"75":0.0045,"78":0.01351,"88":0.01351,"89":0.0045,"90":0.0045,"91":0.03153,"102":0.03153,"103":0.0045,"105":0.0045,"107":0.0045,"108":0.0045,"109":0.00901,"110":0.00901,"111":0.00901,"112":0.00901,"113":0.01351,"114":0.01802,"115":0.31078,"116":0.08107,"117":1.09898,"118":0.1126,_:"2 3 4 5 6 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 43 44 46 47 48 49 51 53 55 56 57 58 59 60 61 62 63 64 65 66 67 69 70 71 72 73 74 76 77 79 80 81 82 83 84 85 86 87 92 93 94 95 96 97 98 99 100 101 104 106 119 120 3.5 3.6"},D:{"38":0.01351,"47":0.06756,"49":0.03153,"51":0.00901,"55":0.06756,"57":0.14413,"60":0.41887,"62":0.01351,"66":0.00901,"68":0.01351,"69":0.00901,"70":0.0045,"71":0.0045,"72":0.0045,"73":0.0045,"74":0.00901,"75":0.01802,"76":0.01351,"77":0.01351,"78":0.00901,"79":0.1171,"80":0.02252,"81":0.03153,"83":0.01351,"84":0.00901,"85":0.02702,"86":0.02702,"87":0.05855,"88":0.02702,"89":0.01802,"90":0.02702,"91":0.46391,"92":0.02702,"93":0.01351,"94":0.01351,"95":0.00901,"96":0.01802,"97":0.01802,"98":0.01351,"99":0.02252,"100":0.02252,"101":0.01802,"102":0.03603,"103":0.08107,"104":0.02252,"105":0.04054,"106":0.04954,"107":0.07206,"108":0.08107,"109":3.0447,"110":0.04054,"111":0.05855,"112":0.08558,"113":0.10359,"114":0.25222,"115":0.40986,"116":19.43026,"117":6.03536,"118":0.01802,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 39 40 41 42 43 44 45 46 48 50 52 53 54 56 58 59 61 63 64 65 67 119 120"},F:{"28":0.00901,"36":0.0045,"77":0.0045,"85":0.0045,"94":0.0045,"95":0.08107,"99":0.01351,"100":0.52246,"101":0.98187,"102":1.53136,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 80 81 82 83 84 86 87 88 89 90 91 92 93 96 97 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.06756,"13":0.13512,"14":0.13512,"15":0.09008,"17":0.00901,"18":0.0045,"92":0.01802,"107":0.00901,"108":0.00901,"109":0.05855,"110":0.00901,"111":0.00901,"112":0.00901,"113":0.00901,"114":0.04054,"115":0.05405,"116":1.63946,"117":1.59892,_:"16 79 80 81 83 84 85 86 87 88 89 90 91 93 94 95 96 97 98 99 100 101 102 103 104 105 106"},E:{"4":0,"14":0.01351,_:"0 5 6 7 8 9 10 11 12 13 15 3.1 3.2 6.1 7.1 10.1 11.1 12.1 17.1","5.1":0.01802,"9.1":0.02252,"13.1":0.02252,"14.1":0.03603,"15.1":0.0045,"15.2-15.3":0.0045,"15.4":0.00901,"15.5":0.01351,"15.6":0.07657,"16.0":0.00901,"16.1":0.02252,"16.2":0.01802,"16.3":0.04504,"16.4":0.02252,"16.5":0.07206,"16.6":0.32429,"17.0":0.03153},G:{"8":0,"3.2":0.00072,"4.0-4.1":0,"4.2-4.3":0,"5.0-5.1":0.0043,"6.0-6.1":0,"7.0-7.1":0.00287,"8.1-8.4":0.00072,"9.0-9.2":0.00072,"9.3":0.01648,"10.0-10.2":0,"10.3":0.01719,"11.0-11.2":0.02006,"11.3-11.4":0.01504,"12.0-12.1":0.01361,"12.2-12.5":0.08524,"13.0-13.1":0.00287,"13.2":0.00287,"13.3":0.12679,"13.4-13.7":0.01146,"14.0-14.4":0.03009,"14.5-14.8":0.07808,"15.0-15.1":0.01719,"15.2-15.3":0.02507,"15.4":0.02722,"15.5":0.04728,"15.6-15.7":0.6146,"16.0":0.18767,"16.1":0.33308,"16.2":0.15043,"16.3":0.32521,"16.4":0.04943,"16.5":0.17048,"16.6":4.15604,"17.0":0.51718,"17.1":0.00143},P:{"4":0.11473,"20":0.05215,"21":0.1043,"22":1.73141,"5.0-5.4":0.03222,"6.2-6.4":0,"7.2-7.4":0.15645,"8.2":0,"9.2":0,"10.1":0,"11.1-11.2":0.02086,"12.0":0,"13.0":0.02086,"14.0":0.01074,"15.0":0.01043,"16.0":0.03129,"17.0":0.06258,"18.0":0.01043,"19.0":0.04172},I:{"0":0,"3":0,"4":0.00564,"2.1":0,"2.2":0,"2.3":0,"4.1":0.00705,"4.2-4.3":0.00282,"4.4":0,"4.4.3-4.4.4":0.03946},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.00918,"9":0.14685,"11":0.33041,_:"6 7 10 5.5"},S:{"2.5":0,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":46.75432},R:{_:"0"},M:{"0":0.1319},Q:{"13.1":0},O:{"0":0.06046},H:{"0":0.23935}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-ww.js b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-ww.js
index a8ef2798709a8e..7d6cfde21201ae 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-ww.js
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/data/regions/alt-ww.js
@@ -1 +1 @@
-module.exports={C:{"11":0.0088,"43":0.0088,"44":0.0044,"48":0.0044,"50":0.0088,"52":0.05279,"53":0.0044,"54":0.0044,"56":0.0088,"59":0.0044,"72":0.03079,"78":0.03959,"83":0.0088,"88":0.0044,"90":0.0044,"91":0.0088,"94":0.0132,"102":0.11877,"103":0.0176,"105":0.0044,"106":0.0044,"107":0.0044,"108":0.0088,"109":0.0088,"110":0.0088,"111":0.0132,"112":0.06599,"113":0.02639,"114":0.03079,"115":0.58067,"116":1.39008,"117":0.05279,_:"2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 45 46 47 49 51 55 57 58 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 84 85 86 87 89 92 93 95 96 97 98 99 100 101 104 118 119 120 3.5 3.6"},D:{"34":0.0044,"38":0.0132,"47":0.0044,"48":0.0176,"49":0.03079,"50":0.0132,"53":0.0088,"55":0.0044,"56":0.04839,"57":0.0044,"60":0.022,"61":0.0044,"62":0.0044,"63":0.0088,"65":0.0088,"66":0.02639,"67":0.0044,"68":0.03959,"69":0.06599,"70":0.03959,"71":0.022,"72":0.02639,"73":0.03079,"74":0.04839,"75":0.04839,"76":0.09678,"77":0.02639,"78":0.03959,"79":0.20235,"80":0.07918,"81":0.05719,"83":0.11437,"84":0.03079,"85":0.08358,"86":0.09238,"87":0.08798,"88":0.04839,"89":0.03959,"90":0.04839,"91":0.06159,"92":0.03519,"93":0.12757,"94":0.03079,"95":0.0176,"96":0.02639,"97":0.02639,"98":0.06159,"99":0.04399,"100":0.03519,"101":0.03519,"102":0.03959,"103":0.21115,"104":0.05279,"105":0.04839,"106":0.05279,"107":0.12317,"108":0.18036,"109":1.83878,"110":0.14957,"111":0.28594,"112":0.22875,"113":0.25514,"114":2.10712,"115":12.80989,"116":5.7231,"117":0.0176,"118":0.0044,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 51 52 54 58 59 64 119"},F:{"28":0.0044,"46":0.0132,"85":0.0044,"95":0.05719,"97":0.07918,"99":0.03079,"100":0.83581,"101":0.46629,"102":0.0088,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 54 55 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 86 87 88 89 90 91 92 93 94 96 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.0044,"13":0.0044,"14":0.0044,"15":0.0044,"17":0.0044,"18":0.0088,"80":0.0044,"81":0.0044,"83":0.0044,"84":0.0088,"85":0.0044,"86":0.0088,"87":0.0044,"88":0.0044,"89":0.0044,"90":0.0088,"92":0.0132,"99":0.0176,"107":0.0088,"108":0.0132,"109":0.08358,"110":0.0132,"111":0.09238,"112":0.09678,"113":0.03519,"114":0.60706,"115":3.20687,"116":1.03377,_:"16 79 91 93 94 95 96 97 98 100 101 102 103 104 105 106"},E:{"4":0,"13":0.0176,"14":0.10558,"15":0.0176,"17":0.02639,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1","5.1":0.0088,"9.1":0.14077,"11.1":0.0044,"12.1":0.03079,"13.1":0.13637,"14.1":0.25514,"15.1":0.03959,"15.2-15.3":0.03519,"15.4":0.07038,"15.5":0.12317,"15.6":0.57627,"16.0":0.17156,"16.1":0.18036,"16.2":0.18476,"16.3":0.4223,"16.4":0.18916,"16.5":1.15254,"16.6":1.65402},G:{"8":0,"17":0.09652,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.0028,"5.0-5.1":0.0042,"6.0-6.1":0.0028,"7.0-7.1":0.01259,"8.1-8.4":0.0042,"9.0-9.2":0.00839,"9.3":0.03917,"10.0-10.2":0.0028,"10.3":0.05455,"11.0-11.2":0.02238,"11.3-11.4":0.01958,"12.0-12.1":0.01539,"12.2-12.5":0.25738,"13.0-13.1":0.00699,"13.2":0.01119,"13.3":0.01818,"13.4-13.7":0.05735,"14.0-14.4":0.14967,"14.5-14.8":0.25738,"15.0-15.1":0.09652,"15.2-15.3":0.10631,"15.4":0.1203,"15.5":0.17066,"15.6-15.7":1.13864,"16.0":0.43783,"16.1":0.86307,"16.2":0.44063,"16.3":0.87986,"16.4":0.21122,"16.5":2.6032,"16.6":5.87084},P:{"4":0.11595,"20":0.08432,"21":0.21081,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.04216,"8.2":0,"9.2":0.02036,"10.1":0.02036,"11.1-11.2":0.01054,"12.0":0,"13.0":0.02108,"14.0":0.02108,"15.0":0.01018,"16.0":0.03162,"17.0":0.03162,"18.0":0.03162,"19.0":0.0527},I:{"0":0,"3":0,"4":0.01369,"2.1":0,"2.2":0.00685,"2.3":0,"4.1":0.02739,"4.2-4.3":0.04793,"4.4":0,"4.4.3-4.4.4":0.21225},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.02687,"9":0.05374,"11":0.41648,_:"6 7 10 5.5"},S:{"2.5":0.05602,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":37.54862},R:{_:"0"},M:{"0":0.26329},Q:{"13.1":0.17366},O:{"0":1.00276},H:{"0":1.08194}};
+module.exports={C:{"11":0.00907,"43":0.00454,"44":0.00454,"45":0.00454,"48":0.01814,"50":0.00907,"52":0.05442,"53":0.00907,"54":0.00907,"56":0.01361,"59":0.00454,"72":0.01361,"78":0.03628,"83":0.00454,"88":0.00454,"89":0.00454,"91":0.00454,"94":0.00454,"102":0.11791,"103":0.02268,"105":0.00454,"106":0.00454,"107":0.00454,"108":0.00907,"109":0.00907,"110":0.00907,"111":0.00907,"112":0.06349,"113":0.01814,"114":0.01814,"115":0.31745,"116":0.11338,"117":1.56458,"118":0.13605,_:"2 3 4 5 6 7 8 9 10 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 46 47 49 51 55 57 58 60 61 62 63 64 65 66 67 68 69 70 71 73 74 75 76 77 79 80 81 82 84 85 86 87 90 92 93 95 96 97 98 99 100 101 104 119 120 3.5 3.6"},D:{"34":0.00454,"38":0.01361,"47":0.00907,"48":0.01814,"49":0.03628,"50":0.00907,"51":0.00454,"53":0.00907,"55":0.00907,"56":0.03175,"57":0.00907,"58":0.00907,"60":0.02721,"61":0.00454,"62":0.00454,"63":0.00454,"65":0.01361,"66":0.02268,"67":0.00454,"68":0.03175,"69":0.06349,"70":0.0771,"71":0.02268,"72":0.03175,"73":0.04082,"74":0.04082,"75":0.04082,"76":0.10431,"77":0.03628,"78":0.04535,"79":0.20408,"80":0.06803,"81":0.06349,"83":0.11338,"84":0.03628,"85":0.08617,"86":0.0907,"87":0.09977,"88":0.05896,"89":0.04535,"90":0.06803,"91":0.07256,"92":0.02721,"93":0.13152,"94":0.02721,"95":0.01361,"96":0.02268,"97":0.02721,"98":0.06803,"99":0.04535,"100":0.03175,"101":0.03628,"102":0.04082,"103":0.21768,"104":0.04535,"105":0.04989,"106":0.05442,"107":0.17233,"108":0.21315,"109":1.78679,"110":0.18594,"111":0.32652,"112":0.24489,"113":0.15419,"114":0.82991,"115":1.44213,"116":15.36912,"117":3.86382,"118":0.02268,"119":0.01361,_:"4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 35 36 37 39 40 41 42 43 44 45 46 52 54 59 64 120"},F:{"28":0.00454,"46":0.01361,"54":0.00454,"55":0.00454,"77":0.00454,"85":0.00454,"89":0.00454,"95":0.05442,"97":0.11791,"99":0.02268,"100":0.26303,"101":0.58048,"102":0.64397,_:"9 11 12 15 16 17 18 19 20 21 22 23 24 25 26 27 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 47 48 49 50 51 52 53 56 57 58 60 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 78 79 80 81 82 83 84 86 87 88 90 91 92 93 94 96 98 9.5-9.6 10.5 10.6 11.1 11.5 11.6 12.1","10.0-10.1":0},B:{"12":0.00454,"13":0.00454,"14":0.00454,"15":0.00454,"17":0.00454,"18":0.01361,"80":0.00907,"81":0.00907,"83":0.00907,"84":0.00907,"85":0.00454,"86":0.00907,"87":0.00454,"88":0.00454,"89":0.00454,"90":0.00907,"92":0.01361,"99":0.01361,"107":0.00907,"108":0.00907,"109":0.07256,"110":0.01361,"111":0.12698,"112":0.12698,"113":0.02721,"114":0.17687,"115":0.14512,"116":2.54867,"117":1.76865,_:"16 79 91 93 94 95 96 97 98 100 101 102 103 104 105 106"},E:{"4":0,"13":0.01814,"14":0.0907,"15":0.01814,_:"0 5 6 7 8 9 10 11 12 3.1 3.2 6.1 7.1 10.1 17.1","5.1":0.00907,"9.1":0.1814,"11.1":0.00454,"12.1":0.02721,"13.1":0.13152,"14.1":0.24036,"15.1":0.04082,"15.2-15.3":0.03628,"15.4":0.06803,"15.5":0.10884,"15.6":0.5442,"16.0":0.06803,"16.1":0.15873,"16.2":0.15419,"16.3":0.3628,"16.4":0.18594,"16.5":0.44443,"16.6":2.50332,"17.0":0.09977},G:{"8":0,"3.2":0,"4.0-4.1":0,"4.2-4.3":0.00286,"5.0-5.1":0.00286,"6.0-6.1":0.00286,"7.0-7.1":0.01,"8.1-8.4":0.00286,"9.0-9.2":0.01,"9.3":0.03427,"10.0-10.2":0.00143,"10.3":0.05141,"11.0-11.2":0.02142,"11.3-11.4":0.01571,"12.0-12.1":0.01428,"12.2-12.5":0.23848,"13.0-13.1":0.00714,"13.2":0.01285,"13.3":0.15566,"13.4-13.7":0.04998,"14.0-14.4":0.13566,"14.5-14.8":0.22563,"15.0-15.1":0.08997,"15.2-15.3":0.09853,"15.4":0.11281,"15.5":0.15708,"15.6-15.7":1.03961,"16.0":0.41127,"16.1":0.76114,"16.2":0.387,"16.3":0.72259,"16.4":0.16422,"16.5":0.48982,"16.6":7.98414,"17.0":0.70402,"17.1":0.00143},P:{"4":0.10707,"20":0.06424,"21":0.1392,"22":1.87381,"5.0-5.4":0,"6.2-6.4":0,"7.2-7.4":0.03212,"8.2":0,"9.2":0.01032,"10.1":0.01032,"11.1-11.2":0.01071,"12.0":0.02063,"13.0":0.02141,"14.0":0.01071,"15.0":0.01032,"16.0":0.02141,"17.0":0.03212,"18.0":0.02141,"19.0":0.05354},I:{"0":0,"3":0,"4":0.01565,"2.1":0,"2.2":0.01565,"2.3":0,"4.1":0.01565,"4.2-4.3":0.05476,"4.4":0,"4.4.3-4.4.4":0.24253},K:{_:"0 10 11 12 11.1 11.5 12.1"},A:{"8":0.02598,"9":0.06496,"11":0.38976,_:"6 7 10 5.5"},S:{"2.5":0.05464,_:"3.0-3.1"},J:{"7":0,"10":0},N:{"10":0,"11":0},L:{"0":36.38025},R:{_:"0"},M:{"0":0.27866},Q:{"13.1":0.16392},O:{"0":0.89063},H:{"0":1.02942}};
diff --git a/tools/node_modules/eslint/node_modules/caniuse-lite/package.json b/tools/node_modules/eslint/node_modules/caniuse-lite/package.json
index 233d75fae0125f..af7c3a5c569cea 100644
--- a/tools/node_modules/eslint/node_modules/caniuse-lite/package.json
+++ b/tools/node_modules/eslint/node_modules/caniuse-lite/package.json
@@ -1,6 +1,6 @@
 {
   "name": "caniuse-lite",
-  "version": "1.0.30001532",
+  "version": "1.0.30001547",
   "description": "A smaller version of caniuse-db, with only the essentials!",
   "main": "dist/unpacker/index.js",
   "files": [
diff --git a/tools/node_modules/eslint/node_modules/convert-source-map/index.js b/tools/node_modules/eslint/node_modules/convert-source-map/index.js
index dc602d7c6dc278..2e8e916e79d66c 100644
--- a/tools/node_modules/eslint/node_modules/convert-source-map/index.js
+++ b/tools/node_modules/eslint/node_modules/convert-source-map/index.js
@@ -1,17 +1,17 @@
 'use strict';
-var fs = require('fs');
-var path = require('path');
 
 Object.defineProperty(exports, 'commentRegex', {
   get: function getCommentRegex () {
-    return /^\s*\/(?:\/|\*)[@#]\s+sourceMappingURL=data:(?:application|text)\/json;(?:charset[:=]\S+?;)?base64,(?:.*)$/mg;
+    // Groups: 1: media type, 2: MIME type, 3: charset, 4: encoding, 5: data.
+    return /^\s*?\/[\/\*][@#]\s+?sourceMappingURL=data:(((?:application|text)\/json)(?:;charset=([^;,]+?)?)?)?(?:;(base64))?,(.*?)$/mg;
   }
 });
 
+
 Object.defineProperty(exports, 'mapFileCommentRegex', {
   get: function getMapFileCommentRegex () {
     // Matches sourceMappingURL in either // or /* comment styles.
-    return /(?:\/\/[@#][ \t]+sourceMappingURL=([^\s'"`]+?)[ \t]*$)|(?:\/\*[@#][ \t]+sourceMappingURL=([^\*]+?)[ \t]*(?:\*\/){1}[ \t]*$)/mg;
+    return /(?:\/\/[@#][ \t]+?sourceMappingURL=([^\s'"`]+?)[ \t]*?$)|(?:\/\*[@#][ \t]+sourceMappingURL=([^*]+?)[ \t]*?(?:\*\/){1}[ \t]*?$)/mg;
   }
 });
 
@@ -45,29 +45,43 @@ function stripComment(sm) {
   return sm.split(',').pop();
 }
 
-function readFromFileMap(sm, dir) {
-  // NOTE: this will only work on the server since it attempts to read the map file
-
+function readFromFileMap(sm, read) {
   var r = exports.mapFileCommentRegex.exec(sm);
-
   // for some odd reason //# .. captures in 1 and /* .. */ in 2
   var filename = r[1] || r[2];
-  var filepath = path.resolve(dir, filename);
 
   try {
-    return fs.readFileSync(filepath, 'utf8');
+    var sm = read(filename);
+    if (sm != null && typeof sm.catch === 'function') {
+      return sm.catch(throwError);
+    } else {
+      return sm;
+    }
   } catch (e) {
-    throw new Error('An error occurred while trying to read the map file at ' + filepath + '\n' + e);
+    throwError(e);
+  }
+
+  function throwError(e) {
+    throw new Error('An error occurred while trying to read the map file at ' + filename + '\n' + e.stack);
   }
 }
 
 function Converter (sm, opts) {
   opts = opts || {};
 
-  if (opts.isFileComment) sm = readFromFileMap(sm, opts.commentFileDir);
-  if (opts.hasComment) sm = stripComment(sm);
-  if (opts.isEncoded) sm = decodeBase64(sm);
-  if (opts.isJSON || opts.isEncoded) sm = JSON.parse(sm);
+  if (opts.hasComment) {
+    sm = stripComment(sm);
+  }
+
+  if (opts.encoding === 'base64') {
+    sm = decodeBase64(sm);
+  } else if (opts.encoding === 'uri') {
+    sm = decodeURIComponent(sm);
+  }
+
+  if (opts.isJSON || opts.encoding) {
+    sm = JSON.parse(sm);
+  }
 
   this.sourcemap = sm;
 }
@@ -104,10 +118,22 @@ function encodeBase64WithBtoa() {
   return btoa(unescape(encodeURIComponent(json)));
 }
 
+Converter.prototype.toURI = function () {
+  var json = this.toJSON();
+  return encodeURIComponent(json);
+};
+
 Converter.prototype.toComment = function (options) {
-  var base64 = this.toBase64();
-  var data = 'sourceMappingURL=data:application/json;charset=utf-8;base64,' + base64;
-  return options && options.multiline ? '/*# ' + data + ' */' : '//# ' + data;
+  var encoding, content, data;
+  if (options != null && options.encoding === 'uri') {
+    encoding = '';
+    content = this.toURI();
+  } else {
+    encoding = ';base64';
+    content = this.toBase64();
+  }
+  data = 'sourceMappingURL=data:application/json;charset=utf-8' + encoding + ',' + content;
+  return options != null && options.multiline ? '/*# ' + data + ' */' : '//# ' + data;
 };
 
 // returns copy instead of original
@@ -137,20 +163,42 @@ exports.fromJSON = function (json) {
   return new Converter(json, { isJSON: true });
 };
 
+exports.fromURI = function (uri) {
+  return new Converter(uri, { encoding: 'uri' });
+};
+
 exports.fromBase64 = function (base64) {
-  return new Converter(base64, { isEncoded: true });
+  return new Converter(base64, { encoding: 'base64' });
 };
 
 exports.fromComment = function (comment) {
+  var m, encoding;
   comment = comment
     .replace(/^\/\*/g, '//')
     .replace(/\*\/$/g, '');
-
-  return new Converter(comment, { isEncoded: true, hasComment: true });
+  m = exports.commentRegex.exec(comment);
+  encoding = m && m[4] || 'uri';
+  return new Converter(comment, { encoding: encoding, hasComment: true });
 };
 
-exports.fromMapFileComment = function (comment, dir) {
-  return new Converter(comment, { commentFileDir: dir, isFileComment: true, isJSON: true });
+function makeConverter(sm) {
+  return new Converter(sm, { isJSON: true });
+}
+
+exports.fromMapFileComment = function (comment, read) {
+  if (typeof read === 'string') {
+    throw new Error(
+      'String directory paths are no longer supported with `fromMapFileComment`\n' +
+      'Please review the Upgrading documentation at https://github.com/thlorenz/convert-source-map#upgrading'
+    )
+  }
+
+  var sm = readFromFileMap(comment, read);
+  if (sm != null && typeof sm.then === 'function') {
+    return sm.then(makeConverter);
+  } else {
+    return makeConverter(sm);
+  }
 };
 
 // Finds last sourcemap comment in file or returns null if none was found
@@ -160,9 +208,15 @@ exports.fromSource = function (content) {
 };
 
 // Finds last sourcemap comment in file or returns null if none was found
-exports.fromMapFileSource = function (content, dir) {
+exports.fromMapFileSource = function (content, read) {
+  if (typeof read === 'string') {
+    throw new Error(
+      'String directory paths are no longer supported with `fromMapFileSource`\n' +
+      'Please review the Upgrading documentation at https://github.com/thlorenz/convert-source-map#upgrading'
+    )
+  }
   var m = content.match(exports.mapFileCommentRegex);
-  return m ? exports.fromMapFileComment(m.pop(), dir) : null;
+  return m ? exports.fromMapFileComment(m.pop(), read) : null;
 };
 
 exports.removeComments = function (src) {
diff --git a/tools/node_modules/eslint/node_modules/convert-source-map/package.json b/tools/node_modules/eslint/node_modules/convert-source-map/package.json
index 0d796cacdf903e..c38f29f7200dc8 100644
--- a/tools/node_modules/eslint/node_modules/convert-source-map/package.json
+++ b/tools/node_modules/eslint/node_modules/convert-source-map/package.json
@@ -1,6 +1,6 @@
 {
   "name": "convert-source-map",
-  "version": "1.9.0",
+  "version": "2.0.0",
   "description": "Converts a source-map from/to  different formats and allows adding/changing properties.",
   "main": "index.js",
   "scripts": {
@@ -30,12 +30,9 @@
   },
   "license": "MIT",
   "engine": {
-    "node": ">=0.6"
+    "node": ">=4"
   },
   "files": [
     "index.js"
-  ],
-  "browser": {
-    "fs": false
-  }
+  ]
 }
diff --git a/tools/node_modules/eslint/node_modules/electron-to-chromium/full-chromium-versions.js b/tools/node_modules/eslint/node_modules/electron-to-chromium/full-chromium-versions.js
index 48fe85d8cd9500..2520f20f794b54 100644
--- a/tools/node_modules/eslint/node_modules/electron-to-chromium/full-chromium-versions.js
+++ b/tools/node_modules/eslint/node_modules/electron-to-chromium/full-chromium-versions.js
@@ -2303,7 +2303,11 @@ module.exports = {
 		"22.3.20",
 		"22.3.21",
 		"22.3.22",
-		"22.3.23"
+		"22.3.23",
+		"22.3.24",
+		"22.3.25",
+		"22.3.26",
+		"22.3.27"
 	],
 	"110.0.5415.0": [
 		"23.0.0-alpha.1",
@@ -2505,7 +2509,12 @@ module.exports = {
 		"24.7.1",
 		"24.8.0",
 		"24.8.1",
-		"24.8.2"
+		"24.8.2",
+		"24.8.3",
+		"24.8.4",
+		"24.8.5",
+		"24.8.6",
+		"24.8.7"
 	],
 	"114.0.5694.0": [
 		"25.0.0-alpha.1",
@@ -2614,7 +2623,12 @@ module.exports = {
 		"25.5.0",
 		"25.6.0",
 		"25.7.0",
-		"25.8.0"
+		"25.8.0",
+		"25.8.1",
+		"25.8.2",
+		"25.8.3",
+		"25.8.4",
+		"25.9.0"
 	],
 	"116.0.5791.0": [
 		"26.0.0-alpha.1",
@@ -2704,6 +2718,17 @@ module.exports = {
 	"116.0.5845.179": [
 		"26.2.0"
 	],
+	"116.0.5845.188": [
+		"26.2.1"
+	],
+	"116.0.5845.190": [
+		"26.2.2",
+		"26.2.3",
+		"26.2.4"
+	],
+	"116.0.5845.228": [
+		"26.3.0"
+	],
 	"118.0.5949.0": [
 		"27.0.0-alpha.1",
 		"27.0.0-alpha.2",
@@ -2724,6 +2749,21 @@ module.exports = {
 		"28.0.0-nightly.20230830",
 		"28.0.0-nightly.20230831"
 	],
+	"118.0.5993.5": [
+		"27.0.0-beta.1",
+		"27.0.0-beta.2",
+		"27.0.0-beta.3"
+	],
+	"118.0.5993.11": [
+		"27.0.0-beta.4"
+	],
+	"118.0.5993.18": [
+		"27.0.0-beta.5",
+		"27.0.0-beta.6",
+		"27.0.0-beta.7",
+		"27.0.0-beta.8",
+		"27.0.0-beta.9"
+	],
 	"116.0.5829.0": [
 		"27.0.0-nightly.20230614"
 	],
@@ -2774,11 +2814,46 @@ module.exports = {
 		"27.0.0-nightly.20230814",
 		"27.0.0-nightly.20230815"
 	],
+	"118.0.5993.54": [
+		"27.0.0"
+	],
 	"118.0.5991.0": [
 		"28.0.0-nightly.20230906"
 	],
 	"118.0.5993.0": [
 		"28.0.0-nightly.20230907",
-		"28.0.0-nightly.20230908"
+		"28.0.0-nightly.20230908",
+		"28.0.0-nightly.20230911",
+		"28.0.0-nightly.20230912",
+		"28.0.0-nightly.20230913",
+		"28.0.0-nightly.20230914",
+		"28.0.0-nightly.20230915"
+	],
+	"119.0.6006.0": [
+		"28.0.0-nightly.20230919"
+	],
+	"119.0.6017.0": [
+		"28.0.0-nightly.20230920"
+	],
+	"119.0.6019.2": [
+		"28.0.0-nightly.20230921",
+		"28.0.0-nightly.20230925",
+		"28.0.0-nightly.20230926",
+		"28.0.0-nightly.20230927",
+		"28.0.0-nightly.20230928"
+	],
+	"119.0.6029.0": [
+		"28.0.0-nightly.20230929",
+		"28.0.0-nightly.20231002"
+	],
+	"119.0.6043.0": [
+		"28.0.0-nightly.20231003",
+		"28.0.0-nightly.20231004",
+		"28.0.0-nightly.20231005"
+	],
+	"119.0.6045.0": [
+		"28.0.0-nightly.20231006",
+		"28.0.0-nightly.20231009",
+		"28.0.0-nightly.20231010"
 	]
 };
\ No newline at end of file
diff --git a/tools/node_modules/eslint/node_modules/electron-to-chromium/full-chromium-versions.json b/tools/node_modules/eslint/node_modules/electron-to-chromium/full-chromium-versions.json
index 5d8bc167f19db4..ec680a2ca90b02 100644
--- a/tools/node_modules/eslint/node_modules/electron-to-chromium/full-chromium-versions.json
+++ b/tools/node_modules/eslint/node_modules/electron-to-chromium/full-chromium-versions.json
@@ -1 +1 @@
-{"39.0.2171.65":["0.20.0","0.20.1","0.20.2","0.20.3","0.20.4","0.20.5","0.20.6","0.20.7","0.20.8"],"40.0.2214.91":["0.21.0","0.21.1","0.21.2"],"41.0.2272.76":["0.21.3","0.22.1","0.22.2","0.22.3","0.23.0","0.24.0"],"42.0.2311.107":["0.25.0","0.25.1","0.25.2","0.25.3","0.26.0","0.26.1","0.27.0","0.27.1"],"43.0.2357.65":["0.27.2","0.27.3","0.28.0","0.28.1","0.28.2","0.28.3","0.29.1","0.29.2"],"44.0.2403.125":["0.30.4","0.31.0"],"45.0.2454.85":["0.31.2","0.32.2","0.32.3","0.33.0","0.33.1","0.33.2","0.33.3","0.33.4","0.33.6","0.33.7","0.33.8","0.33.9","0.34.0","0.34.1","0.34.2","0.34.3","0.34.4","0.35.1","0.35.2","0.35.3","0.35.4","0.35.5"],"47.0.2526.73":["0.36.0","0.36.2","0.36.3","0.36.4"],"47.0.2526.110":["0.36.5","0.36.6","0.36.7","0.36.8","0.36.9","0.36.10","0.36.11","0.36.12"],"49.0.2623.75":["0.37.0","0.37.1","0.37.3","0.37.4","0.37.5","0.37.6","0.37.7","0.37.8","1.0.0","1.0.1","1.0.2"],"50.0.2661.102":["1.1.0","1.1.1","1.1.2","1.1.3"],"51.0.2704.63":["1.2.0","1.2.1"],"51.0.2704.84":["1.2.2","1.2.3"],"51.0.2704.103":["1.2.4","1.2.5"],"51.0.2704.106":["1.2.6","1.2.7","1.2.8"],"52.0.2743.82":["1.3.0","1.3.1","1.3.2","1.3.3","1.3.4","1.3.5","1.3.6","1.3.7","1.3.9","1.3.10","1.3.13","1.3.14","1.3.15"],"53.0.2785.113":["1.4.0","1.4.1","1.4.2","1.4.3","1.4.4","1.4.5"],"53.0.2785.143":["1.4.6","1.4.7","1.4.8","1.4.10","1.4.11","1.4.13","1.4.14","1.4.15","1.4.16"],"54.0.2840.51":["1.4.12"],"54.0.2840.101":["1.5.0","1.5.1"],"56.0.2924.87":["1.6.0","1.6.1","1.6.2","1.6.3","1.6.4","1.6.5","1.6.6","1.6.7","1.6.8","1.6.9","1.6.10","1.6.11","1.6.12","1.6.13","1.6.14","1.6.15","1.6.16","1.6.17","1.6.18"],"58.0.3029.110":["1.7.0","1.7.1","1.7.2","1.7.3","1.7.4","1.7.5","1.7.6","1.7.7","1.7.8","1.7.9","1.7.10","1.7.11","1.7.12","1.7.13","1.7.14","1.7.15","1.7.16"],"59.0.3071.115":["1.8.0","1.8.1","1.8.2-beta.1","1.8.2-beta.2","1.8.2-beta.3","1.8.2-beta.4","1.8.2-beta.5","1.8.2","1.8.3","1.8.4","1.8.5","1.8.6","1.8.7","1.8.8"],"61.0.3163.100":["2.0.0-beta.1","2.0.0-beta.2","2.0.0-beta.3","2.0.0-beta.4","2.0.0-beta.5","2.0.0-beta.6","2.0.0-beta.7","2.0.0-beta.8","2.0.0","2.0.1","2.0.2","2.0.3","2.0.4","2.0.5","2.0.6","2.0.7","2.0.8-nightly.20180819","2.0.8-nightly.20180820","2.0.8","2.0.9","2.0.10","2.0.11","2.0.12","2.0.13","2.0.14","2.0.15","2.0.16","2.0.17","2.0.18","2.1.0-unsupported.20180809"],"66.0.3359.181":["3.0.0-beta.1","3.0.0-beta.2","3.0.0-beta.3","3.0.0-beta.4","3.0.0-beta.5","3.0.0-beta.6","3.0.0-beta.7","3.0.0-beta.8","3.0.0-beta.9","3.0.0-beta.10","3.0.0-beta.11","3.0.0-beta.12","3.0.0-beta.13","3.0.0-nightly.20180818","3.0.0-nightly.20180821","3.0.0-nightly.20180823","3.0.0-nightly.20180904","3.0.0","3.0.1","3.0.2","3.0.3","3.0.4","3.0.5","3.0.6","3.0.7","3.0.8","3.0.9","3.0.10","3.0.11","3.0.12","3.0.13","3.0.14","3.0.15","3.0.16","3.1.0-beta.1","3.1.0-beta.2","3.1.0-beta.3","3.1.0-beta.4","3.1.0-beta.5","3.1.0","3.1.1","3.1.2","3.1.3","3.1.4","3.1.5","3.1.6","3.1.7","3.1.8","3.1.9","3.1.10","3.1.11","3.1.12","3.1.13","4.0.0-nightly.20180817","4.0.0-nightly.20180819","4.0.0-nightly.20180821"],"69.0.3497.106":["4.0.0-beta.1","4.0.0-beta.2","4.0.0-beta.3","4.0.0-beta.4","4.0.0-beta.5","4.0.0-beta.6","4.0.0-beta.7","4.0.0-beta.8","4.0.0-beta.9","4.0.0-beta.10","4.0.0-beta.11","4.0.0-nightly.20181010","4.0.0","4.0.1","4.0.2","4.0.3","4.0.4","4.0.5","4.0.6"],"67.0.3396.99":["4.0.0-nightly.20180929"],"68.0.3440.128":["4.0.0-nightly.20181006"],"69.0.3497.128":["4.0.7","4.0.8","4.1.0","4.1.1","4.1.2","4.1.3","4.1.4","4.1.5","4.2.0","4.2.1","4.2.2","4.2.3","4.2.4","4.2.5","4.2.6","4.2.7","4.2.8","4.2.9","4.2.10","4.2.11","4.2.12"],"72.0.3626.52":["5.0.0-beta.1","5.0.0-beta.2","6.0.0-nightly.20190123"],"73.0.3683.27":["5.0.0-beta.3"],"73.0.3683.54":["5.0.0-beta.4"],"73.0.3683.61":["5.0.0-beta.5"],"73.0.3683.84":["5.0.0-beta.6"],"73.0.3683.94":["5.0.0-beta.7"],"73.0.3683.104":["5.0.0-beta.8"],"73.0.3683.117":["5.0.0-beta.9"],"70.0.3538.110":["5.0.0-nightly.20190107"],"71.0.3578.98":["5.0.0-nightly.20190121","5.0.0-nightly.20190122"],"73.0.3683.119":["5.0.0"],"73.0.3683.121":["5.0.1","5.0.2","5.0.3","5.0.4","5.0.5","5.0.6","5.0.7","5.0.8","5.0.9","5.0.10","5.0.11","5.0.12","5.0.13"],"76.0.3774.1":["6.0.0-beta.1"],"76.0.3783.1":["6.0.0-beta.2","6.0.0-beta.3","6.0.0-beta.4"],"76.0.3805.4":["6.0.0-beta.5"],"76.0.3809.3":["6.0.0-beta.6"],"76.0.3809.22":["6.0.0-beta.7"],"76.0.3809.26":["6.0.0-beta.8","6.0.0-beta.9"],"76.0.3809.37":["6.0.0-beta.10"],"76.0.3809.42":["6.0.0-beta.11"],"76.0.3809.54":["6.0.0-beta.12"],"76.0.3809.60":["6.0.0-beta.13"],"76.0.3809.68":["6.0.0-beta.14"],"76.0.3809.74":["6.0.0-beta.15"],"72.0.3626.107":["6.0.0-nightly.20190212"],"72.0.3626.110":["6.0.0-nightly.20190213"],"74.0.3724.8":["6.0.0-nightly.20190311"],"76.0.3809.88":["6.0.0"],"76.0.3809.102":["6.0.1"],"76.0.3809.110":["6.0.2"],"76.0.3809.126":["6.0.3"],"76.0.3809.131":["6.0.4"],"76.0.3809.136":["6.0.5"],"76.0.3809.138":["6.0.6"],"76.0.3809.139":["6.0.7"],"76.0.3809.146":["6.0.8","6.0.9","6.0.10","6.0.11","6.0.12","6.1.0","6.1.1","6.1.2","6.1.3","6.1.4","6.1.5","6.1.6","6.1.7","6.1.8","6.1.9","6.1.10","6.1.11","6.1.12"],"78.0.3866.0":["7.0.0-beta.1","7.0.0-beta.2","7.0.0-beta.3","7.0.0-nightly.20190727","7.0.0-nightly.20190728","7.0.0-nightly.20190729","7.0.0-nightly.20190730","7.0.0-nightly.20190731","8.0.0-nightly.20190801","8.0.0-nightly.20190802"],"78.0.3896.6":["7.0.0-beta.4"],"78.0.3905.1":["7.0.0-beta.5","7.0.0-beta.6","7.0.0-beta.7","7.0.0"],"76.0.3784.0":["7.0.0-nightly.20190521"],"76.0.3806.0":["7.0.0-nightly.20190529","7.0.0-nightly.20190530","7.0.0-nightly.20190531","7.0.0-nightly.20190602","7.0.0-nightly.20190603"],"77.0.3814.0":["7.0.0-nightly.20190604"],"77.0.3815.0":["7.0.0-nightly.20190605","7.0.0-nightly.20190606","7.0.0-nightly.20190607","7.0.0-nightly.20190608","7.0.0-nightly.20190609","7.0.0-nightly.20190611","7.0.0-nightly.20190612","7.0.0-nightly.20190613","7.0.0-nightly.20190615","7.0.0-nightly.20190616","7.0.0-nightly.20190618","7.0.0-nightly.20190619","7.0.0-nightly.20190622","7.0.0-nightly.20190623","7.0.0-nightly.20190624","7.0.0-nightly.20190627","7.0.0-nightly.20190629","7.0.0-nightly.20190630","7.0.0-nightly.20190701","7.0.0-nightly.20190702"],"77.0.3843.0":["7.0.0-nightly.20190704","7.0.0-nightly.20190705"],"77.0.3848.0":["7.0.0-nightly.20190719","7.0.0-nightly.20190720","7.0.0-nightly.20190721"],"77.0.3864.0":["7.0.0-nightly.20190726"],"78.0.3904.92":["7.0.1"],"78.0.3904.94":["7.1.0"],"78.0.3904.99":["7.1.1"],"78.0.3904.113":["7.1.2"],"78.0.3904.126":["7.1.3"],"78.0.3904.130":["7.1.4","7.1.5","7.1.6","7.1.7","7.1.8","7.1.9","7.1.10","7.1.11","7.1.12","7.1.13","7.1.14","7.2.0","7.2.1","7.2.2","7.2.3","7.2.4","7.3.0","7.3.1","7.3.2","7.3.3"],"79.0.3931.0":["8.0.0-beta.1","8.0.0-beta.2","8.0.0-nightly.20191019","8.0.0-nightly.20191020","8.0.0-nightly.20191021","8.0.0-nightly.20191023"],"80.0.3955.0":["8.0.0-beta.3","8.0.0-beta.4"],"80.0.3987.14":["8.0.0-beta.5"],"80.0.3987.51":["8.0.0-beta.6"],"80.0.3987.59":["8.0.0-beta.7"],"80.0.3987.75":["8.0.0-beta.8","8.0.0-beta.9"],"78.0.3871.0":["8.0.0-nightly.20190803","8.0.0-nightly.20190806","8.0.0-nightly.20190807","8.0.0-nightly.20190808","8.0.0-nightly.20190809","8.0.0-nightly.20190810","8.0.0-nightly.20190811","8.0.0-nightly.20190812","8.0.0-nightly.20190813","8.0.0-nightly.20190814","8.0.0-nightly.20190815"],"78.0.3881.0":["8.0.0-nightly.20190816","8.0.0-nightly.20190817","8.0.0-nightly.20190818","8.0.0-nightly.20190819","8.0.0-nightly.20190820"],"78.0.3892.0":["8.0.0-nightly.20190824","8.0.0-nightly.20190825","8.0.0-nightly.20190827","8.0.0-nightly.20190828","8.0.0-nightly.20190830","8.0.0-nightly.20190901","8.0.0-nightly.20190902","8.0.0-nightly.20190907","8.0.0-nightly.20190909","8.0.0-nightly.20190910","8.0.0-nightly.20190911","8.0.0-nightly.20190912","8.0.0-nightly.20190913","8.0.0-nightly.20190914","8.0.0-nightly.20190915","8.0.0-nightly.20190917"],"79.0.3915.0":["8.0.0-nightly.20190919","8.0.0-nightly.20190920"],"79.0.3919.0":["8.0.0-nightly.20190922","8.0.0-nightly.20190923","8.0.0-nightly.20190924","8.0.0-nightly.20190926","8.0.0-nightly.20190928","8.0.0-nightly.20190929","8.0.0-nightly.20190930","8.0.0-nightly.20191001","8.0.0-nightly.20191004","8.0.0-nightly.20191005","8.0.0-nightly.20191006","8.0.0-nightly.20191009","8.0.0-nightly.20191011","8.0.0-nightly.20191012","8.0.0-nightly.20191017"],"80.0.3952.0":["8.0.0-nightly.20191101","8.0.0-nightly.20191103","8.0.0-nightly.20191105"],"80.0.3987.86":["8.0.0","8.0.1","8.0.2"],"80.0.3987.134":["8.0.3"],"80.0.3987.137":["8.1.0"],"80.0.3987.141":["8.1.1"],"80.0.3987.158":["8.2.0"],"80.0.3987.163":["8.2.1","8.2.2","8.2.3","8.5.3","8.5.4","8.5.5"],"80.0.3987.165":["8.2.4","8.2.5","8.3.0","8.3.1","8.3.2","8.3.3","8.3.4","8.4.0","8.4.1","8.5.0","8.5.1","8.5.2"],"82.0.4048.0":["9.0.0-beta.1","9.0.0-beta.2","9.0.0-beta.3","9.0.0-beta.4","9.0.0-beta.5"],"82.0.4058.2":["9.0.0-beta.6","9.0.0-beta.7","9.0.0-beta.9"],"82.0.4085.10":["9.0.0-beta.10"],"82.0.4085.14":["9.0.0-beta.11","9.0.0-beta.12","9.0.0-beta.13"],"82.0.4085.27":["9.0.0-beta.14"],"83.0.4102.3":["9.0.0-beta.15","9.0.0-beta.16"],"83.0.4103.14":["9.0.0-beta.17"],"83.0.4103.16":["9.0.0-beta.18"],"83.0.4103.24":["9.0.0-beta.19"],"83.0.4103.26":["9.0.0-beta.20","9.0.0-beta.21"],"83.0.4103.34":["9.0.0-beta.22"],"83.0.4103.44":["9.0.0-beta.23"],"83.0.4103.45":["9.0.0-beta.24"],"80.0.3954.0":["9.0.0-nightly.20191121","9.0.0-nightly.20191122","9.0.0-nightly.20191123","9.0.0-nightly.20191124","9.0.0-nightly.20191126","9.0.0-nightly.20191128","9.0.0-nightly.20191129","9.0.0-nightly.20191130","9.0.0-nightly.20191201","9.0.0-nightly.20191202","9.0.0-nightly.20191203","9.0.0-nightly.20191204","9.0.0-nightly.20191205","9.0.0-nightly.20191210"],"81.0.3994.0":["9.0.0-nightly.20191220","9.0.0-nightly.20191221","9.0.0-nightly.20191222","9.0.0-nightly.20191223","9.0.0-nightly.20191224","9.0.0-nightly.20191225","9.0.0-nightly.20191226","9.0.0-nightly.20191228","9.0.0-nightly.20191229","9.0.0-nightly.20191230","9.0.0-nightly.20191231","9.0.0-nightly.20200101","9.0.0-nightly.20200103","9.0.0-nightly.20200104","9.0.0-nightly.20200105","9.0.0-nightly.20200106","9.0.0-nightly.20200108","9.0.0-nightly.20200109","9.0.0-nightly.20200110","9.0.0-nightly.20200111","9.0.0-nightly.20200113","9.0.0-nightly.20200115","9.0.0-nightly.20200116","9.0.0-nightly.20200117"],"81.0.4030.0":["9.0.0-nightly.20200119","9.0.0-nightly.20200121"],"83.0.4103.64":["9.0.0"],"83.0.4103.94":["9.0.1","9.0.2"],"83.0.4103.100":["9.0.3"],"83.0.4103.104":["9.0.4"],"83.0.4103.119":["9.0.5"],"83.0.4103.122":["9.1.0","9.1.1","9.1.2","9.2.0","9.2.1","9.3.0","9.3.1","9.3.2","9.3.3","9.3.4","9.3.5","9.4.0","9.4.1","9.4.2","9.4.3","9.4.4"],"84.0.4129.0":["10.0.0-beta.1","10.0.0-beta.2","10.0.0-nightly.20200501","10.0.0-nightly.20200504","10.0.0-nightly.20200505","10.0.0-nightly.20200506","10.0.0-nightly.20200507","10.0.0-nightly.20200508","10.0.0-nightly.20200511","10.0.0-nightly.20200512","10.0.0-nightly.20200513","10.0.0-nightly.20200514","10.0.0-nightly.20200515","10.0.0-nightly.20200518","10.0.0-nightly.20200519","10.0.0-nightly.20200520","10.0.0-nightly.20200521","11.0.0-nightly.20200525","11.0.0-nightly.20200526"],"85.0.4161.2":["10.0.0-beta.3","10.0.0-beta.4"],"85.0.4181.1":["10.0.0-beta.8","10.0.0-beta.9"],"85.0.4183.19":["10.0.0-beta.10"],"85.0.4183.20":["10.0.0-beta.11"],"85.0.4183.26":["10.0.0-beta.12"],"85.0.4183.39":["10.0.0-beta.13","10.0.0-beta.14","10.0.0-beta.15","10.0.0-beta.17","10.0.0-beta.19","10.0.0-beta.20","10.0.0-beta.21"],"85.0.4183.70":["10.0.0-beta.23"],"85.0.4183.78":["10.0.0-beta.24"],"85.0.4183.80":["10.0.0-beta.25"],"82.0.4050.0":["10.0.0-nightly.20200209","10.0.0-nightly.20200210","10.0.0-nightly.20200211","10.0.0-nightly.20200216","10.0.0-nightly.20200217","10.0.0-nightly.20200218","10.0.0-nightly.20200221","10.0.0-nightly.20200222","10.0.0-nightly.20200223","10.0.0-nightly.20200226","10.0.0-nightly.20200303"],"82.0.4076.0":["10.0.0-nightly.20200304","10.0.0-nightly.20200305","10.0.0-nightly.20200306","10.0.0-nightly.20200309","10.0.0-nightly.20200310"],"82.0.4083.0":["10.0.0-nightly.20200311"],"83.0.4086.0":["10.0.0-nightly.20200316"],"83.0.4087.0":["10.0.0-nightly.20200317","10.0.0-nightly.20200318","10.0.0-nightly.20200320","10.0.0-nightly.20200323","10.0.0-nightly.20200324","10.0.0-nightly.20200325","10.0.0-nightly.20200326","10.0.0-nightly.20200327","10.0.0-nightly.20200330","10.0.0-nightly.20200331","10.0.0-nightly.20200401","10.0.0-nightly.20200402","10.0.0-nightly.20200403","10.0.0-nightly.20200406"],"83.0.4095.0":["10.0.0-nightly.20200408","10.0.0-nightly.20200410","10.0.0-nightly.20200413"],"84.0.4114.0":["10.0.0-nightly.20200414"],"84.0.4115.0":["10.0.0-nightly.20200415","10.0.0-nightly.20200416","10.0.0-nightly.20200417"],"84.0.4121.0":["10.0.0-nightly.20200422","10.0.0-nightly.20200423"],"84.0.4125.0":["10.0.0-nightly.20200427","10.0.0-nightly.20200428","10.0.0-nightly.20200429","10.0.0-nightly.20200430"],"85.0.4183.84":["10.0.0"],"85.0.4183.86":["10.0.1"],"85.0.4183.87":["10.1.0"],"85.0.4183.93":["10.1.1"],"85.0.4183.98":["10.1.2"],"85.0.4183.121":["10.1.3","10.1.4","10.1.5","10.1.6","10.1.7","10.2.0","10.3.0","10.3.1","10.3.2","10.4.0","10.4.1","10.4.2","10.4.3","10.4.4","10.4.5","10.4.6","10.4.7"],"86.0.4234.0":["11.0.0-beta.1","11.0.0-beta.3","11.0.0-beta.4","11.0.0-beta.5","11.0.0-beta.6","11.0.0-beta.7","11.0.0-nightly.20200822","11.0.0-nightly.20200824","11.0.0-nightly.20200825","11.0.0-nightly.20200826","12.0.0-nightly.20200827","12.0.0-nightly.20200831","12.0.0-nightly.20200902","12.0.0-nightly.20200903","12.0.0-nightly.20200907","12.0.0-nightly.20200910","12.0.0-nightly.20200911","12.0.0-nightly.20200914"],"87.0.4251.1":["11.0.0-beta.8","11.0.0-beta.9","11.0.0-beta.11"],"87.0.4280.11":["11.0.0-beta.12","11.0.0-beta.13"],"87.0.4280.27":["11.0.0-beta.16","11.0.0-beta.17","11.0.0-beta.18","11.0.0-beta.19"],"87.0.4280.40":["11.0.0-beta.20"],"87.0.4280.47":["11.0.0-beta.22","11.0.0-beta.23"],"85.0.4156.0":["11.0.0-nightly.20200529"],"85.0.4162.0":["11.0.0-nightly.20200602","11.0.0-nightly.20200603","11.0.0-nightly.20200604","11.0.0-nightly.20200609","11.0.0-nightly.20200610","11.0.0-nightly.20200611","11.0.0-nightly.20200615","11.0.0-nightly.20200616","11.0.0-nightly.20200617","11.0.0-nightly.20200618","11.0.0-nightly.20200619"],"85.0.4179.0":["11.0.0-nightly.20200701","11.0.0-nightly.20200702","11.0.0-nightly.20200703","11.0.0-nightly.20200706","11.0.0-nightly.20200707","11.0.0-nightly.20200708","11.0.0-nightly.20200709"],"86.0.4203.0":["11.0.0-nightly.20200716","11.0.0-nightly.20200717","11.0.0-nightly.20200720","11.0.0-nightly.20200721"],"86.0.4209.0":["11.0.0-nightly.20200723","11.0.0-nightly.20200724","11.0.0-nightly.20200729","11.0.0-nightly.20200730","11.0.0-nightly.20200731","11.0.0-nightly.20200803","11.0.0-nightly.20200804","11.0.0-nightly.20200805","11.0.0-nightly.20200811","11.0.0-nightly.20200812"],"87.0.4280.60":["11.0.0","11.0.1"],"87.0.4280.67":["11.0.2","11.0.3","11.0.4"],"87.0.4280.88":["11.0.5","11.1.0","11.1.1"],"87.0.4280.141":["11.2.0","11.2.1","11.2.2","11.2.3","11.3.0","11.4.0","11.4.1","11.4.2","11.4.3","11.4.4","11.4.5","11.4.6","11.4.7","11.4.8","11.4.9","11.4.10","11.4.11","11.4.12","11.5.0"],"89.0.4328.0":["12.0.0-beta.1","12.0.0-beta.3","12.0.0-beta.4","12.0.0-beta.5","12.0.0-beta.6","12.0.0-beta.7","12.0.0-beta.8","12.0.0-beta.9","12.0.0-beta.10","12.0.0-beta.11","12.0.0-beta.12","12.0.0-beta.14","13.0.0-nightly.20201119","13.0.0-nightly.20201123","13.0.0-nightly.20201124","13.0.0-nightly.20201126","13.0.0-nightly.20201127","13.0.0-nightly.20201130","13.0.0-nightly.20201201","13.0.0-nightly.20201202","13.0.0-nightly.20201203","13.0.0-nightly.20201204","13.0.0-nightly.20201207","13.0.0-nightly.20201208","13.0.0-nightly.20201209","13.0.0-nightly.20201210","13.0.0-nightly.20201211","13.0.0-nightly.20201214"],"89.0.4348.1":["12.0.0-beta.16","12.0.0-beta.18","12.0.0-beta.19","12.0.0-beta.20"],"89.0.4388.2":["12.0.0-beta.21","12.0.0-beta.22","12.0.0-beta.23","12.0.0-beta.24","12.0.0-beta.25","12.0.0-beta.26"],"89.0.4389.23":["12.0.0-beta.27","12.0.0-beta.28","12.0.0-beta.29"],"89.0.4389.58":["12.0.0-beta.30","12.0.0-beta.31"],"87.0.4268.0":["12.0.0-nightly.20201002","12.0.0-nightly.20201007","12.0.0-nightly.20201009","12.0.0-nightly.20201012","12.0.0-nightly.20201013","12.0.0-nightly.20201014","12.0.0-nightly.20201015"],"88.0.4292.0":["12.0.0-nightly.20201023","12.0.0-nightly.20201026"],"88.0.4306.0":["12.0.0-nightly.20201030","12.0.0-nightly.20201102","12.0.0-nightly.20201103","12.0.0-nightly.20201104","12.0.0-nightly.20201105","12.0.0-nightly.20201106","12.0.0-nightly.20201111","12.0.0-nightly.20201112"],"88.0.4324.0":["12.0.0-nightly.20201116"],"89.0.4389.69":["12.0.0"],"89.0.4389.82":["12.0.1"],"89.0.4389.90":["12.0.2"],"89.0.4389.114":["12.0.3","12.0.4"],"89.0.4389.128":["12.0.5","12.0.6","12.0.7","12.0.8","12.0.9","12.0.10","12.0.11","12.0.12","12.0.13","12.0.14","12.0.15","12.0.16","12.0.17","12.0.18","12.1.0","12.1.1","12.1.2","12.2.0","12.2.1","12.2.2","12.2.3"],"90.0.4402.0":["13.0.0-beta.2","13.0.0-beta.3","13.0.0-nightly.20210210","13.0.0-nightly.20210211","13.0.0-nightly.20210212","13.0.0-nightly.20210216","13.0.0-nightly.20210217","13.0.0-nightly.20210218","13.0.0-nightly.20210219","13.0.0-nightly.20210222","13.0.0-nightly.20210225","13.0.0-nightly.20210226","13.0.0-nightly.20210301","13.0.0-nightly.20210302","13.0.0-nightly.20210303","14.0.0-nightly.20210304"],"90.0.4415.0":["13.0.0-beta.4","13.0.0-beta.5","13.0.0-beta.6","13.0.0-beta.7","13.0.0-beta.8","13.0.0-beta.9","13.0.0-beta.10","13.0.0-beta.11","13.0.0-beta.12","13.0.0-beta.13","14.0.0-nightly.20210305","14.0.0-nightly.20210308","14.0.0-nightly.20210309","14.0.0-nightly.20210311","14.0.0-nightly.20210315","14.0.0-nightly.20210316","14.0.0-nightly.20210317","14.0.0-nightly.20210318","14.0.0-nightly.20210319","14.0.0-nightly.20210323","14.0.0-nightly.20210324","14.0.0-nightly.20210325","14.0.0-nightly.20210326","14.0.0-nightly.20210329","14.0.0-nightly.20210330"],"91.0.4448.0":["13.0.0-beta.14","13.0.0-beta.16","13.0.0-beta.17","13.0.0-beta.18","13.0.0-beta.20","14.0.0-nightly.20210331","14.0.0-nightly.20210401","14.0.0-nightly.20210402","14.0.0-nightly.20210406","14.0.0-nightly.20210407","14.0.0-nightly.20210408","14.0.0-nightly.20210409","14.0.0-nightly.20210413"],"91.0.4472.33":["13.0.0-beta.21","13.0.0-beta.22","13.0.0-beta.23"],"91.0.4472.38":["13.0.0-beta.24","13.0.0-beta.25","13.0.0-beta.26","13.0.0-beta.27","13.0.0-beta.28"],"89.0.4349.0":["13.0.0-nightly.20201215","13.0.0-nightly.20201216","13.0.0-nightly.20201221","13.0.0-nightly.20201222"],"89.0.4359.0":["13.0.0-nightly.20201223","13.0.0-nightly.20210104","13.0.0-nightly.20210108","13.0.0-nightly.20210111"],"89.0.4386.0":["13.0.0-nightly.20210113","13.0.0-nightly.20210114","13.0.0-nightly.20210118","13.0.0-nightly.20210122","13.0.0-nightly.20210125"],"89.0.4389.0":["13.0.0-nightly.20210127","13.0.0-nightly.20210128","13.0.0-nightly.20210129","13.0.0-nightly.20210201","13.0.0-nightly.20210202","13.0.0-nightly.20210203","13.0.0-nightly.20210205","13.0.0-nightly.20210208","13.0.0-nightly.20210209"],"91.0.4472.69":["13.0.0","13.0.1"],"91.0.4472.77":["13.1.0","13.1.1","13.1.2"],"91.0.4472.106":["13.1.3","13.1.4"],"91.0.4472.124":["13.1.5","13.1.6","13.1.7"],"91.0.4472.164":["13.1.8","13.1.9","13.2.0","13.2.1","13.2.2","13.2.3","13.3.0","13.4.0","13.5.0","13.5.1","13.5.2","13.6.0","13.6.1","13.6.2","13.6.3","13.6.6","13.6.7","13.6.8","13.6.9"],"92.0.4511.0":["14.0.0-beta.1","14.0.0-beta.2","14.0.0-beta.3","14.0.0-nightly.20210520","14.0.0-nightly.20210523","14.0.0-nightly.20210524","15.0.0-nightly.20210527","15.0.0-nightly.20210528","15.0.0-nightly.20210531","15.0.0-nightly.20210601","15.0.0-nightly.20210602"],"93.0.4536.0":["14.0.0-beta.5","14.0.0-beta.6","14.0.0-beta.7","14.0.0-beta.8","15.0.0-nightly.20210609","15.0.0-nightly.20210610","15.0.0-nightly.20210611","15.0.0-nightly.20210614","15.0.0-nightly.20210615","15.0.0-nightly.20210616"],"93.0.4539.0":["14.0.0-beta.9","14.0.0-beta.10","15.0.0-nightly.20210617","15.0.0-nightly.20210618","15.0.0-nightly.20210621","15.0.0-nightly.20210622"],"93.0.4557.4":["14.0.0-beta.11","14.0.0-beta.12"],"93.0.4566.0":["14.0.0-beta.13","14.0.0-beta.14","14.0.0-beta.15","14.0.0-beta.16","14.0.0-beta.17","15.0.0-alpha.1","15.0.0-alpha.2","15.0.0-nightly.20210706","15.0.0-nightly.20210707","15.0.0-nightly.20210708","15.0.0-nightly.20210709","15.0.0-nightly.20210712","15.0.0-nightly.20210713","15.0.0-nightly.20210714","15.0.0-nightly.20210715","15.0.0-nightly.20210716","15.0.0-nightly.20210719","15.0.0-nightly.20210720","15.0.0-nightly.20210721","16.0.0-nightly.20210722","16.0.0-nightly.20210723","16.0.0-nightly.20210726"],"93.0.4577.15":["14.0.0-beta.18","14.0.0-beta.19","14.0.0-beta.20","14.0.0-beta.21"],"93.0.4577.25":["14.0.0-beta.22","14.0.0-beta.23"],"93.0.4577.51":["14.0.0-beta.24","14.0.0-beta.25"],"92.0.4475.0":["14.0.0-nightly.20210426","14.0.0-nightly.20210427"],"92.0.4488.0":["14.0.0-nightly.20210430","14.0.0-nightly.20210503"],"92.0.4496.0":["14.0.0-nightly.20210505"],"92.0.4498.0":["14.0.0-nightly.20210506"],"92.0.4499.0":["14.0.0-nightly.20210507","14.0.0-nightly.20210510","14.0.0-nightly.20210511","14.0.0-nightly.20210512","14.0.0-nightly.20210513"],"92.0.4505.0":["14.0.0-nightly.20210514","14.0.0-nightly.20210517","14.0.0-nightly.20210518","14.0.0-nightly.20210519"],"93.0.4577.58":["14.0.0"],"93.0.4577.63":["14.0.1"],"93.0.4577.82":["14.0.2","14.1.0","14.1.1","14.2.0","14.2.1","14.2.2","14.2.3","14.2.4","14.2.5","14.2.6","14.2.7","14.2.8","14.2.9"],"94.0.4584.0":["15.0.0-alpha.3","15.0.0-alpha.4","15.0.0-alpha.5","15.0.0-alpha.6","16.0.0-nightly.20210727","16.0.0-nightly.20210728","16.0.0-nightly.20210729","16.0.0-nightly.20210730","16.0.0-nightly.20210802","16.0.0-nightly.20210803","16.0.0-nightly.20210804","16.0.0-nightly.20210805","16.0.0-nightly.20210806","16.0.0-nightly.20210809","16.0.0-nightly.20210810","16.0.0-nightly.20210811"],"94.0.4590.2":["15.0.0-alpha.7","15.0.0-alpha.8","15.0.0-alpha.9","16.0.0-nightly.20210812","16.0.0-nightly.20210813","16.0.0-nightly.20210816","16.0.0-nightly.20210817","16.0.0-nightly.20210818","16.0.0-nightly.20210819","16.0.0-nightly.20210820","16.0.0-nightly.20210823"],"94.0.4606.12":["15.0.0-alpha.10"],"94.0.4606.20":["15.0.0-beta.1","15.0.0-beta.2"],"94.0.4606.31":["15.0.0-beta.3","15.0.0-beta.4","15.0.0-beta.5","15.0.0-beta.6","15.0.0-beta.7"],"93.0.4530.0":["15.0.0-nightly.20210603","15.0.0-nightly.20210604"],"93.0.4535.0":["15.0.0-nightly.20210608"],"93.0.4550.0":["15.0.0-nightly.20210623","15.0.0-nightly.20210624"],"93.0.4552.0":["15.0.0-nightly.20210625","15.0.0-nightly.20210628","15.0.0-nightly.20210629"],"93.0.4558.0":["15.0.0-nightly.20210630","15.0.0-nightly.20210701","15.0.0-nightly.20210702","15.0.0-nightly.20210705"],"94.0.4606.51":["15.0.0"],"94.0.4606.61":["15.1.0","15.1.1"],"94.0.4606.71":["15.1.2"],"94.0.4606.81":["15.2.0","15.3.0","15.3.1","15.3.2","15.3.3","15.3.4","15.3.5","15.3.6","15.3.7","15.4.0","15.4.1","15.4.2","15.5.0","15.5.1","15.5.2","15.5.3","15.5.4","15.5.5","15.5.6","15.5.7"],"95.0.4629.0":["16.0.0-alpha.1","16.0.0-alpha.2","16.0.0-alpha.3","16.0.0-alpha.4","16.0.0-alpha.5","16.0.0-alpha.6","16.0.0-alpha.7","16.0.0-nightly.20210902","16.0.0-nightly.20210903","16.0.0-nightly.20210906","16.0.0-nightly.20210907","16.0.0-nightly.20210908","16.0.0-nightly.20210909","16.0.0-nightly.20210910","16.0.0-nightly.20210913","16.0.0-nightly.20210914","16.0.0-nightly.20210915","16.0.0-nightly.20210916","16.0.0-nightly.20210917","16.0.0-nightly.20210920","16.0.0-nightly.20210921","16.0.0-nightly.20210922","17.0.0-nightly.20210923","17.0.0-nightly.20210924","17.0.0-nightly.20210927","17.0.0-nightly.20210928","17.0.0-nightly.20210929","17.0.0-nightly.20210930","17.0.0-nightly.20211001","17.0.0-nightly.20211004","17.0.0-nightly.20211005"],"96.0.4647.0":["16.0.0-alpha.8","16.0.0-alpha.9","16.0.0-beta.1","16.0.0-beta.2","16.0.0-beta.3","17.0.0-nightly.20211006","17.0.0-nightly.20211007","17.0.0-nightly.20211008","17.0.0-nightly.20211011","17.0.0-nightly.20211012","17.0.0-nightly.20211013","17.0.0-nightly.20211014","17.0.0-nightly.20211015","17.0.0-nightly.20211018","17.0.0-nightly.20211019","17.0.0-nightly.20211020","17.0.0-nightly.20211021"],"96.0.4664.18":["16.0.0-beta.4","16.0.0-beta.5"],"96.0.4664.27":["16.0.0-beta.6","16.0.0-beta.7"],"96.0.4664.35":["16.0.0-beta.8","16.0.0-beta.9"],"95.0.4612.5":["16.0.0-nightly.20210824","16.0.0-nightly.20210825","16.0.0-nightly.20210826","16.0.0-nightly.20210827","16.0.0-nightly.20210830","16.0.0-nightly.20210831","16.0.0-nightly.20210901"],"96.0.4664.45":["16.0.0","16.0.1"],"96.0.4664.55":["16.0.2","16.0.3","16.0.4","16.0.5"],"96.0.4664.110":["16.0.6","16.0.7","16.0.8"],"96.0.4664.174":["16.0.9","16.0.10","16.1.0","16.1.1","16.2.0","16.2.1","16.2.2","16.2.3","16.2.4","16.2.5","16.2.6","16.2.7","16.2.8"],"96.0.4664.4":["17.0.0-alpha.1","17.0.0-alpha.2","17.0.0-alpha.3","17.0.0-nightly.20211022","17.0.0-nightly.20211025","17.0.0-nightly.20211026","17.0.0-nightly.20211027","17.0.0-nightly.20211028","17.0.0-nightly.20211029","17.0.0-nightly.20211101","17.0.0-nightly.20211102","17.0.0-nightly.20211103","17.0.0-nightly.20211104","17.0.0-nightly.20211105","17.0.0-nightly.20211108","17.0.0-nightly.20211109","17.0.0-nightly.20211110","17.0.0-nightly.20211111","17.0.0-nightly.20211112","17.0.0-nightly.20211115","17.0.0-nightly.20211116","17.0.0-nightly.20211117","18.0.0-nightly.20211118","18.0.0-nightly.20211119","18.0.0-nightly.20211122","18.0.0-nightly.20211123"],"98.0.4706.0":["17.0.0-alpha.4","17.0.0-alpha.5","17.0.0-alpha.6","17.0.0-beta.1","17.0.0-beta.2","18.0.0-nightly.20211124","18.0.0-nightly.20211125","18.0.0-nightly.20211126","18.0.0-nightly.20211129","18.0.0-nightly.20211130","18.0.0-nightly.20211201","18.0.0-nightly.20211202","18.0.0-nightly.20211203","18.0.0-nightly.20211206","18.0.0-nightly.20211207","18.0.0-nightly.20211208","18.0.0-nightly.20211209","18.0.0-nightly.20211210","18.0.0-nightly.20211213","18.0.0-nightly.20211214","18.0.0-nightly.20211215","18.0.0-nightly.20211216","18.0.0-nightly.20211217","18.0.0-nightly.20211220","18.0.0-nightly.20211221","18.0.0-nightly.20211222","18.0.0-nightly.20211223","18.0.0-nightly.20211228","18.0.0-nightly.20211229","18.0.0-nightly.20211231","18.0.0-nightly.20220103","18.0.0-nightly.20220104","18.0.0-nightly.20220105","18.0.0-nightly.20220106","18.0.0-nightly.20220107","18.0.0-nightly.20220110"],"98.0.4758.9":["17.0.0-beta.3"],"98.0.4758.11":["17.0.0-beta.4","17.0.0-beta.5","17.0.0-beta.6","17.0.0-beta.7","17.0.0-beta.8","17.0.0-beta.9"],"98.0.4758.74":["17.0.0"],"98.0.4758.82":["17.0.1"],"98.0.4758.102":["17.1.0"],"98.0.4758.109":["17.1.1","17.1.2","17.2.0"],"98.0.4758.141":["17.3.0","17.3.1","17.4.0","17.4.1","17.4.2","17.4.3","17.4.4","17.4.5","17.4.6","17.4.7","17.4.8","17.4.9","17.4.10","17.4.11"],"99.0.4767.0":["18.0.0-alpha.1","18.0.0-alpha.2","18.0.0-alpha.3","18.0.0-alpha.4","18.0.0-alpha.5","18.0.0-nightly.20220111","18.0.0-nightly.20220112","18.0.0-nightly.20220113","18.0.0-nightly.20220114","18.0.0-nightly.20220117","18.0.0-nightly.20220118","18.0.0-nightly.20220119","18.0.0-nightly.20220121","18.0.0-nightly.20220124","18.0.0-nightly.20220125","18.0.0-nightly.20220127","18.0.0-nightly.20220128","18.0.0-nightly.20220131","18.0.0-nightly.20220201","19.0.0-nightly.20220202","19.0.0-nightly.20220203","19.0.0-nightly.20220204","19.0.0-nightly.20220207","19.0.0-nightly.20220208","19.0.0-nightly.20220209"],"100.0.4894.0":["18.0.0-beta.1","18.0.0-beta.2","18.0.0-beta.3","18.0.0-beta.4","18.0.0-beta.5","18.0.0-beta.6","19.0.0-nightly.20220308","19.0.0-nightly.20220309","19.0.0-nightly.20220310","19.0.0-nightly.20220311","19.0.0-nightly.20220314","19.0.0-nightly.20220315","19.0.0-nightly.20220316","19.0.0-nightly.20220317","19.0.0-nightly.20220318","19.0.0-nightly.20220321","19.0.0-nightly.20220322","19.0.0-nightly.20220323","19.0.0-nightly.20220324"],"100.0.4896.56":["18.0.0"],"100.0.4896.60":["18.0.1","18.0.2"],"100.0.4896.75":["18.0.3","18.0.4"],"100.0.4896.127":["18.1.0"],"100.0.4896.143":["18.2.0","18.2.1","18.2.2","18.2.3"],"100.0.4896.160":["18.2.4","18.3.0","18.3.1","18.3.2","18.3.3","18.3.4","18.3.5","18.3.6","18.3.7","18.3.8","18.3.9","18.3.11","18.3.12","18.3.13","18.3.14","18.3.15"],"102.0.4962.3":["19.0.0-alpha.1","19.0.0-nightly.20220328","19.0.0-nightly.20220329","20.0.0-nightly.20220330"],"102.0.4971.0":["19.0.0-alpha.2","19.0.0-alpha.3","20.0.0-nightly.20220411"],"102.0.4989.0":["19.0.0-alpha.4","19.0.0-alpha.5","20.0.0-nightly.20220414","20.0.0-nightly.20220415","20.0.0-nightly.20220418","20.0.0-nightly.20220419","20.0.0-nightly.20220420","20.0.0-nightly.20220421"],"102.0.4999.0":["19.0.0-beta.1","19.0.0-beta.2","19.0.0-beta.3","20.0.0-nightly.20220425","20.0.0-nightly.20220426","20.0.0-nightly.20220427","20.0.0-nightly.20220428","20.0.0-nightly.20220429","20.0.0-nightly.20220502","20.0.0-nightly.20220503","20.0.0-nightly.20220504","20.0.0-nightly.20220505","20.0.0-nightly.20220506","20.0.0-nightly.20220509","20.0.0-nightly.20220511","20.0.0-nightly.20220512","20.0.0-nightly.20220513","20.0.0-nightly.20220516","20.0.0-nightly.20220517"],"102.0.5005.27":["19.0.0-beta.4"],"102.0.5005.40":["19.0.0-beta.5","19.0.0-beta.6","19.0.0-beta.7"],"102.0.5005.49":["19.0.0-beta.8"],"102.0.4961.0":["19.0.0-nightly.20220325"],"102.0.5005.61":["19.0.0","19.0.1"],"102.0.5005.63":["19.0.2","19.0.3","19.0.4"],"102.0.5005.115":["19.0.5","19.0.6"],"102.0.5005.134":["19.0.7"],"102.0.5005.148":["19.0.8"],"102.0.5005.167":["19.0.9","19.0.10","19.0.11","19.0.12","19.0.13","19.0.14","19.0.15","19.0.16","19.0.17","19.1.0","19.1.1","19.1.2","19.1.3","19.1.4","19.1.5","19.1.6","19.1.7","19.1.8","19.1.9"],"103.0.5044.0":["20.0.0-alpha.1","20.0.0-nightly.20220518","20.0.0-nightly.20220519","20.0.0-nightly.20220520","20.0.0-nightly.20220523","20.0.0-nightly.20220524","21.0.0-nightly.20220526","21.0.0-nightly.20220527","21.0.0-nightly.20220530","21.0.0-nightly.20220531"],"104.0.5073.0":["20.0.0-alpha.2","20.0.0-alpha.3","20.0.0-alpha.4","20.0.0-alpha.5","20.0.0-alpha.6","20.0.0-alpha.7","20.0.0-beta.1","20.0.0-beta.2","20.0.0-beta.3","20.0.0-beta.4","20.0.0-beta.5","20.0.0-beta.6","20.0.0-beta.7","20.0.0-beta.8","21.0.0-nightly.20220602","21.0.0-nightly.20220603","21.0.0-nightly.20220606","21.0.0-nightly.20220607","21.0.0-nightly.20220608","21.0.0-nightly.20220609","21.0.0-nightly.20220610","21.0.0-nightly.20220613","21.0.0-nightly.20220614","21.0.0-nightly.20220615","21.0.0-nightly.20220616","21.0.0-nightly.20220617","21.0.0-nightly.20220620","21.0.0-nightly.20220621","21.0.0-nightly.20220622","21.0.0-nightly.20220623","21.0.0-nightly.20220624","21.0.0-nightly.20220627"],"104.0.5112.39":["20.0.0-beta.9"],"104.0.5112.48":["20.0.0-beta.10","20.0.0-beta.11","20.0.0-beta.12"],"104.0.5112.57":["20.0.0-beta.13"],"104.0.5112.65":["20.0.0"],"104.0.5112.81":["20.0.1","20.0.2","20.0.3"],"104.0.5112.102":["20.1.0","20.1.1"],"104.0.5112.114":["20.1.2","20.1.3","20.1.4"],"104.0.5112.124":["20.2.0","20.3.0","20.3.1","20.3.2","20.3.3","20.3.4","20.3.5","20.3.6","20.3.7","20.3.8","20.3.9","20.3.10","20.3.11","20.3.12"],"105.0.5187.0":["21.0.0-alpha.1","21.0.0-alpha.2","21.0.0-alpha.3","21.0.0-alpha.4","21.0.0-alpha.5","21.0.0-nightly.20220720","21.0.0-nightly.20220721","21.0.0-nightly.20220722","21.0.0-nightly.20220725","21.0.0-nightly.20220726","21.0.0-nightly.20220727","21.0.0-nightly.20220728","21.0.0-nightly.20220801","21.0.0-nightly.20220802","22.0.0-nightly.20220808","22.0.0-nightly.20220809","22.0.0-nightly.20220810","22.0.0-nightly.20220811","22.0.0-nightly.20220812","22.0.0-nightly.20220815","22.0.0-nightly.20220816","22.0.0-nightly.20220817"],"106.0.5216.0":["21.0.0-alpha.6","21.0.0-beta.1","21.0.0-beta.2","21.0.0-beta.3","21.0.0-beta.4","21.0.0-beta.5","22.0.0-nightly.20220822","22.0.0-nightly.20220823","22.0.0-nightly.20220824","22.0.0-nightly.20220825","22.0.0-nightly.20220829","22.0.0-nightly.20220830","22.0.0-nightly.20220831","22.0.0-nightly.20220901","22.0.0-nightly.20220902","22.0.0-nightly.20220905"],"106.0.5249.40":["21.0.0-beta.6","21.0.0-beta.7","21.0.0-beta.8"],"105.0.5129.0":["21.0.0-nightly.20220628","21.0.0-nightly.20220629","21.0.0-nightly.20220630","21.0.0-nightly.20220701","21.0.0-nightly.20220704","21.0.0-nightly.20220705","21.0.0-nightly.20220706","21.0.0-nightly.20220707","21.0.0-nightly.20220708","21.0.0-nightly.20220711","21.0.0-nightly.20220712","21.0.0-nightly.20220713"],"105.0.5173.0":["21.0.0-nightly.20220715","21.0.0-nightly.20220718","21.0.0-nightly.20220719"],"106.0.5249.51":["21.0.0"],"106.0.5249.61":["21.0.1"],"106.0.5249.91":["21.1.0"],"106.0.5249.103":["21.1.1"],"106.0.5249.119":["21.2.0"],"106.0.5249.165":["21.2.1"],"106.0.5249.168":["21.2.2","21.2.3"],"106.0.5249.181":["21.3.0","21.3.1"],"106.0.5249.199":["21.3.3","21.3.4","21.3.5","21.4.0","21.4.1","21.4.2","21.4.3","21.4.4"],"107.0.5286.0":["22.0.0-alpha.1","22.0.0-nightly.20220909","22.0.0-nightly.20220912","22.0.0-nightly.20220913","22.0.0-nightly.20220914","22.0.0-nightly.20220915","22.0.0-nightly.20220916","22.0.0-nightly.20220919","22.0.0-nightly.20220920","22.0.0-nightly.20220921","22.0.0-nightly.20220922","22.0.0-nightly.20220923","22.0.0-nightly.20220926","22.0.0-nightly.20220927","22.0.0-nightly.20220928","23.0.0-nightly.20220929","23.0.0-nightly.20220930","23.0.0-nightly.20221003"],"108.0.5329.0":["22.0.0-alpha.3","22.0.0-alpha.4","22.0.0-alpha.5","22.0.0-alpha.6","23.0.0-nightly.20221004","23.0.0-nightly.20221005","23.0.0-nightly.20221006","23.0.0-nightly.20221007","23.0.0-nightly.20221010","23.0.0-nightly.20221011","23.0.0-nightly.20221012","23.0.0-nightly.20221013","23.0.0-nightly.20221014","23.0.0-nightly.20221017"],"108.0.5355.0":["22.0.0-alpha.7","23.0.0-nightly.20221018","23.0.0-nightly.20221019","23.0.0-nightly.20221020","23.0.0-nightly.20221021","23.0.0-nightly.20221024","23.0.0-nightly.20221026"],"108.0.5359.10":["22.0.0-alpha.8","22.0.0-beta.1","22.0.0-beta.2","22.0.0-beta.3"],"108.0.5359.29":["22.0.0-beta.4"],"108.0.5359.40":["22.0.0-beta.5","22.0.0-beta.6"],"108.0.5359.48":["22.0.0-beta.7","22.0.0-beta.8"],"107.0.5274.0":["22.0.0-nightly.20220908"],"108.0.5359.62":["22.0.0"],"108.0.5359.125":["22.0.1"],"108.0.5359.179":["22.0.2","22.0.3","22.1.0"],"108.0.5359.215":["22.2.0","22.2.1","22.3.0","22.3.1","22.3.2","22.3.3","22.3.4","22.3.5","22.3.6","22.3.7","22.3.8","22.3.9","22.3.10","22.3.11","22.3.12","22.3.13","22.3.14","22.3.15","22.3.16","22.3.17","22.3.18","22.3.20","22.3.21","22.3.22","22.3.23"],"110.0.5415.0":["23.0.0-alpha.1","23.0.0-nightly.20221118","23.0.0-nightly.20221121","23.0.0-nightly.20221122","23.0.0-nightly.20221123","23.0.0-nightly.20221124","23.0.0-nightly.20221125","23.0.0-nightly.20221128","23.0.0-nightly.20221129","23.0.0-nightly.20221130","24.0.0-nightly.20221201","24.0.0-nightly.20221202","24.0.0-nightly.20221205"],"110.0.5451.0":["23.0.0-alpha.2","23.0.0-alpha.3","24.0.0-nightly.20221206","24.0.0-nightly.20221207","24.0.0-nightly.20221208","24.0.0-nightly.20221213","24.0.0-nightly.20221214","24.0.0-nightly.20221215","24.0.0-nightly.20221216"],"110.0.5478.5":["23.0.0-beta.1","23.0.0-beta.2","23.0.0-beta.3"],"110.0.5481.30":["23.0.0-beta.4"],"110.0.5481.38":["23.0.0-beta.5"],"110.0.5481.52":["23.0.0-beta.6","23.0.0-beta.8"],"109.0.5382.0":["23.0.0-nightly.20221027","23.0.0-nightly.20221028","23.0.0-nightly.20221031","23.0.0-nightly.20221101","23.0.0-nightly.20221102","23.0.0-nightly.20221103","23.0.0-nightly.20221104","23.0.0-nightly.20221107","23.0.0-nightly.20221108","23.0.0-nightly.20221109","23.0.0-nightly.20221110","23.0.0-nightly.20221111","23.0.0-nightly.20221114","23.0.0-nightly.20221115","23.0.0-nightly.20221116","23.0.0-nightly.20221117"],"110.0.5481.77":["23.0.0"],"110.0.5481.100":["23.1.0"],"110.0.5481.104":["23.1.1"],"110.0.5481.177":["23.1.2"],"110.0.5481.179":["23.1.3"],"110.0.5481.192":["23.1.4","23.2.0"],"110.0.5481.208":["23.2.1","23.2.2","23.2.3","23.2.4","23.3.0","23.3.1","23.3.2","23.3.3","23.3.4","23.3.5","23.3.6","23.3.7","23.3.8","23.3.9","23.3.10","23.3.11","23.3.12","23.3.13"],"111.0.5560.0":["24.0.0-alpha.1","24.0.0-alpha.2","24.0.0-alpha.3","24.0.0-alpha.4","24.0.0-alpha.5","24.0.0-alpha.6","24.0.0-alpha.7","24.0.0-nightly.20230203","24.0.0-nightly.20230206","24.0.0-nightly.20230207","24.0.0-nightly.20230208","24.0.0-nightly.20230209","25.0.0-nightly.20230210","25.0.0-nightly.20230214","25.0.0-nightly.20230215","25.0.0-nightly.20230216","25.0.0-nightly.20230217","25.0.0-nightly.20230220","25.0.0-nightly.20230221","25.0.0-nightly.20230222","25.0.0-nightly.20230223","25.0.0-nightly.20230224","25.0.0-nightly.20230227","25.0.0-nightly.20230228","25.0.0-nightly.20230301","25.0.0-nightly.20230302","25.0.0-nightly.20230303","25.0.0-nightly.20230306","25.0.0-nightly.20230307","25.0.0-nightly.20230308","25.0.0-nightly.20230309","25.0.0-nightly.20230310"],"111.0.5563.50":["24.0.0-beta.1","24.0.0-beta.2"],"112.0.5615.20":["24.0.0-beta.3","24.0.0-beta.4"],"112.0.5615.29":["24.0.0-beta.5"],"112.0.5615.39":["24.0.0-beta.6","24.0.0-beta.7"],"111.0.5518.0":["24.0.0-nightly.20230109","24.0.0-nightly.20230110","24.0.0-nightly.20230111","24.0.0-nightly.20230112","24.0.0-nightly.20230113","24.0.0-nightly.20230116","24.0.0-nightly.20230117","24.0.0-nightly.20230118","24.0.0-nightly.20230119","24.0.0-nightly.20230120","24.0.0-nightly.20230123","24.0.0-nightly.20230124","24.0.0-nightly.20230125","24.0.0-nightly.20230126","24.0.0-nightly.20230127","24.0.0-nightly.20230131","24.0.0-nightly.20230201","24.0.0-nightly.20230202"],"112.0.5615.49":["24.0.0"],"112.0.5615.50":["24.1.0","24.1.1"],"112.0.5615.87":["24.1.2"],"112.0.5615.165":["24.1.3","24.2.0","24.3.0"],"112.0.5615.183":["24.3.1"],"112.0.5615.204":["24.4.0","24.4.1","24.5.0","24.5.1","24.6.0","24.6.1","24.6.2","24.6.3","24.6.4","24.6.5","24.7.0","24.7.1","24.8.0","24.8.1","24.8.2"],"114.0.5694.0":["25.0.0-alpha.1","25.0.0-alpha.2","25.0.0-nightly.20230405","26.0.0-nightly.20230406","26.0.0-nightly.20230407","26.0.0-nightly.20230410","26.0.0-nightly.20230411"],"114.0.5710.0":["25.0.0-alpha.3","25.0.0-alpha.4","26.0.0-nightly.20230413","26.0.0-nightly.20230414","26.0.0-nightly.20230417"],"114.0.5719.0":["25.0.0-alpha.5","25.0.0-alpha.6","25.0.0-beta.1","25.0.0-beta.2","25.0.0-beta.3","26.0.0-nightly.20230421","26.0.0-nightly.20230424","26.0.0-nightly.20230425","26.0.0-nightly.20230426","26.0.0-nightly.20230427","26.0.0-nightly.20230428","26.0.0-nightly.20230501","26.0.0-nightly.20230502","26.0.0-nightly.20230503","26.0.0-nightly.20230504","26.0.0-nightly.20230505","26.0.0-nightly.20230508","26.0.0-nightly.20230509","26.0.0-nightly.20230510"],"114.0.5735.16":["25.0.0-beta.4","25.0.0-beta.5","25.0.0-beta.6","25.0.0-beta.7"],"114.0.5735.35":["25.0.0-beta.8"],"114.0.5735.45":["25.0.0-beta.9","25.0.0","25.0.1"],"113.0.5636.0":["25.0.0-nightly.20230314"],"113.0.5651.0":["25.0.0-nightly.20230315"],"113.0.5653.0":["25.0.0-nightly.20230317"],"113.0.5660.0":["25.0.0-nightly.20230320"],"113.0.5664.0":["25.0.0-nightly.20230321"],"113.0.5666.0":["25.0.0-nightly.20230322"],"113.0.5668.0":["25.0.0-nightly.20230323"],"113.0.5670.0":["25.0.0-nightly.20230324","25.0.0-nightly.20230327","25.0.0-nightly.20230328","25.0.0-nightly.20230329","25.0.0-nightly.20230330"],"114.0.5684.0":["25.0.0-nightly.20230331","25.0.0-nightly.20230403"],"114.0.5692.0":["25.0.0-nightly.20230404"],"114.0.5735.106":["25.1.0","25.1.1"],"114.0.5735.134":["25.2.0"],"114.0.5735.199":["25.3.0"],"114.0.5735.243":["25.3.1"],"114.0.5735.248":["25.3.2","25.4.0"],"114.0.5735.289":["25.5.0","25.6.0","25.7.0","25.8.0"],"116.0.5791.0":["26.0.0-alpha.1","26.0.0-alpha.2","26.0.0-alpha.3","26.0.0-alpha.4","26.0.0-alpha.5","26.0.0-nightly.20230526","26.0.0-nightly.20230529","26.0.0-nightly.20230530","26.0.0-nightly.20230531","27.0.0-nightly.20230601","27.0.0-nightly.20230602","27.0.0-nightly.20230605","27.0.0-nightly.20230606","27.0.0-nightly.20230607","27.0.0-nightly.20230609"],"116.0.5815.0":["26.0.0-alpha.6","27.0.0-nightly.20230612","27.0.0-nightly.20230613"],"116.0.5831.0":["26.0.0-alpha.7","27.0.0-nightly.20230615"],"116.0.5845.0":["26.0.0-alpha.8","26.0.0-beta.1","27.0.0-nightly.20230622","27.0.0-nightly.20230623","27.0.0-nightly.20230626","27.0.0-nightly.20230627","27.0.0-nightly.20230628","27.0.0-nightly.20230629","27.0.0-nightly.20230630"],"116.0.5845.14":["26.0.0-beta.2","26.0.0-beta.3","26.0.0-beta.4","26.0.0-beta.5","26.0.0-beta.6","26.0.0-beta.7"],"116.0.5845.42":["26.0.0-beta.8","26.0.0-beta.9"],"116.0.5845.49":["26.0.0-beta.10","26.0.0-beta.11"],"116.0.5845.62":["26.0.0-beta.12"],"114.0.5708.0":["26.0.0-nightly.20230412"],"114.0.5715.0":["26.0.0-nightly.20230418"],"115.0.5760.0":["26.0.0-nightly.20230511","26.0.0-nightly.20230512","26.0.0-nightly.20230515","26.0.0-nightly.20230516","26.0.0-nightly.20230517","26.0.0-nightly.20230518","26.0.0-nightly.20230519","26.0.0-nightly.20230522","26.0.0-nightly.20230523"],"115.0.5786.0":["26.0.0-nightly.20230524"],"115.0.5790.0":["26.0.0-nightly.20230525"],"116.0.5845.82":["26.0.0"],"116.0.5845.97":["26.1.0"],"116.0.5845.179":["26.2.0"],"118.0.5949.0":["27.0.0-alpha.1","27.0.0-alpha.2","27.0.0-alpha.3","27.0.0-alpha.4","27.0.0-alpha.5","27.0.0-alpha.6","27.0.0-nightly.20230816","28.0.0-nightly.20230817","28.0.0-nightly.20230818","28.0.0-nightly.20230821","28.0.0-nightly.20230822","28.0.0-nightly.20230823","28.0.0-nightly.20230824","28.0.0-nightly.20230825","28.0.0-nightly.20230828","28.0.0-nightly.20230829","28.0.0-nightly.20230830","28.0.0-nightly.20230831"],"116.0.5829.0":["27.0.0-nightly.20230614"],"116.0.5833.0":["27.0.0-nightly.20230616","27.0.0-nightly.20230619","27.0.0-nightly.20230620","27.0.0-nightly.20230621"],"117.0.5852.0":["27.0.0-nightly.20230703","27.0.0-nightly.20230704","27.0.0-nightly.20230705","27.0.0-nightly.20230706","27.0.0-nightly.20230707","27.0.0-nightly.20230710","27.0.0-nightly.20230711","27.0.0-nightly.20230712","27.0.0-nightly.20230713","27.0.0-nightly.20230714"],"117.0.5884.1":["27.0.0-nightly.20230717","27.0.0-nightly.20230718"],"117.0.5892.0":["27.0.0-nightly.20230719"],"117.0.5897.0":["27.0.0-nightly.20230720","27.0.0-nightly.20230721","27.0.0-nightly.20230724","27.0.0-nightly.20230725","27.0.0-nightly.20230726","27.0.0-nightly.20230727","27.0.0-nightly.20230728","27.0.0-nightly.20230731"],"117.0.5911.0":["27.0.0-nightly.20230801","27.0.0-nightly.20230802","27.0.0-nightly.20230803"],"117.0.5921.0":["27.0.0-nightly.20230804","27.0.0-nightly.20230807","27.0.0-nightly.20230808","27.0.0-nightly.20230814","27.0.0-nightly.20230815"],"118.0.5991.0":["28.0.0-nightly.20230906"],"118.0.5993.0":["28.0.0-nightly.20230907","28.0.0-nightly.20230908"]}
\ No newline at end of file
+{"39.0.2171.65":["0.20.0","0.20.1","0.20.2","0.20.3","0.20.4","0.20.5","0.20.6","0.20.7","0.20.8"],"40.0.2214.91":["0.21.0","0.21.1","0.21.2"],"41.0.2272.76":["0.21.3","0.22.1","0.22.2","0.22.3","0.23.0","0.24.0"],"42.0.2311.107":["0.25.0","0.25.1","0.25.2","0.25.3","0.26.0","0.26.1","0.27.0","0.27.1"],"43.0.2357.65":["0.27.2","0.27.3","0.28.0","0.28.1","0.28.2","0.28.3","0.29.1","0.29.2"],"44.0.2403.125":["0.30.4","0.31.0"],"45.0.2454.85":["0.31.2","0.32.2","0.32.3","0.33.0","0.33.1","0.33.2","0.33.3","0.33.4","0.33.6","0.33.7","0.33.8","0.33.9","0.34.0","0.34.1","0.34.2","0.34.3","0.34.4","0.35.1","0.35.2","0.35.3","0.35.4","0.35.5"],"47.0.2526.73":["0.36.0","0.36.2","0.36.3","0.36.4"],"47.0.2526.110":["0.36.5","0.36.6","0.36.7","0.36.8","0.36.9","0.36.10","0.36.11","0.36.12"],"49.0.2623.75":["0.37.0","0.37.1","0.37.3","0.37.4","0.37.5","0.37.6","0.37.7","0.37.8","1.0.0","1.0.1","1.0.2"],"50.0.2661.102":["1.1.0","1.1.1","1.1.2","1.1.3"],"51.0.2704.63":["1.2.0","1.2.1"],"51.0.2704.84":["1.2.2","1.2.3"],"51.0.2704.103":["1.2.4","1.2.5"],"51.0.2704.106":["1.2.6","1.2.7","1.2.8"],"52.0.2743.82":["1.3.0","1.3.1","1.3.2","1.3.3","1.3.4","1.3.5","1.3.6","1.3.7","1.3.9","1.3.10","1.3.13","1.3.14","1.3.15"],"53.0.2785.113":["1.4.0","1.4.1","1.4.2","1.4.3","1.4.4","1.4.5"],"53.0.2785.143":["1.4.6","1.4.7","1.4.8","1.4.10","1.4.11","1.4.13","1.4.14","1.4.15","1.4.16"],"54.0.2840.51":["1.4.12"],"54.0.2840.101":["1.5.0","1.5.1"],"56.0.2924.87":["1.6.0","1.6.1","1.6.2","1.6.3","1.6.4","1.6.5","1.6.6","1.6.7","1.6.8","1.6.9","1.6.10","1.6.11","1.6.12","1.6.13","1.6.14","1.6.15","1.6.16","1.6.17","1.6.18"],"58.0.3029.110":["1.7.0","1.7.1","1.7.2","1.7.3","1.7.4","1.7.5","1.7.6","1.7.7","1.7.8","1.7.9","1.7.10","1.7.11","1.7.12","1.7.13","1.7.14","1.7.15","1.7.16"],"59.0.3071.115":["1.8.0","1.8.1","1.8.2-beta.1","1.8.2-beta.2","1.8.2-beta.3","1.8.2-beta.4","1.8.2-beta.5","1.8.2","1.8.3","1.8.4","1.8.5","1.8.6","1.8.7","1.8.8"],"61.0.3163.100":["2.0.0-beta.1","2.0.0-beta.2","2.0.0-beta.3","2.0.0-beta.4","2.0.0-beta.5","2.0.0-beta.6","2.0.0-beta.7","2.0.0-beta.8","2.0.0","2.0.1","2.0.2","2.0.3","2.0.4","2.0.5","2.0.6","2.0.7","2.0.8-nightly.20180819","2.0.8-nightly.20180820","2.0.8","2.0.9","2.0.10","2.0.11","2.0.12","2.0.13","2.0.14","2.0.15","2.0.16","2.0.17","2.0.18","2.1.0-unsupported.20180809"],"66.0.3359.181":["3.0.0-beta.1","3.0.0-beta.2","3.0.0-beta.3","3.0.0-beta.4","3.0.0-beta.5","3.0.0-beta.6","3.0.0-beta.7","3.0.0-beta.8","3.0.0-beta.9","3.0.0-beta.10","3.0.0-beta.11","3.0.0-beta.12","3.0.0-beta.13","3.0.0-nightly.20180818","3.0.0-nightly.20180821","3.0.0-nightly.20180823","3.0.0-nightly.20180904","3.0.0","3.0.1","3.0.2","3.0.3","3.0.4","3.0.5","3.0.6","3.0.7","3.0.8","3.0.9","3.0.10","3.0.11","3.0.12","3.0.13","3.0.14","3.0.15","3.0.16","3.1.0-beta.1","3.1.0-beta.2","3.1.0-beta.3","3.1.0-beta.4","3.1.0-beta.5","3.1.0","3.1.1","3.1.2","3.1.3","3.1.4","3.1.5","3.1.6","3.1.7","3.1.8","3.1.9","3.1.10","3.1.11","3.1.12","3.1.13","4.0.0-nightly.20180817","4.0.0-nightly.20180819","4.0.0-nightly.20180821"],"69.0.3497.106":["4.0.0-beta.1","4.0.0-beta.2","4.0.0-beta.3","4.0.0-beta.4","4.0.0-beta.5","4.0.0-beta.6","4.0.0-beta.7","4.0.0-beta.8","4.0.0-beta.9","4.0.0-beta.10","4.0.0-beta.11","4.0.0-nightly.20181010","4.0.0","4.0.1","4.0.2","4.0.3","4.0.4","4.0.5","4.0.6"],"67.0.3396.99":["4.0.0-nightly.20180929"],"68.0.3440.128":["4.0.0-nightly.20181006"],"69.0.3497.128":["4.0.7","4.0.8","4.1.0","4.1.1","4.1.2","4.1.3","4.1.4","4.1.5","4.2.0","4.2.1","4.2.2","4.2.3","4.2.4","4.2.5","4.2.6","4.2.7","4.2.8","4.2.9","4.2.10","4.2.11","4.2.12"],"72.0.3626.52":["5.0.0-beta.1","5.0.0-beta.2","6.0.0-nightly.20190123"],"73.0.3683.27":["5.0.0-beta.3"],"73.0.3683.54":["5.0.0-beta.4"],"73.0.3683.61":["5.0.0-beta.5"],"73.0.3683.84":["5.0.0-beta.6"],"73.0.3683.94":["5.0.0-beta.7"],"73.0.3683.104":["5.0.0-beta.8"],"73.0.3683.117":["5.0.0-beta.9"],"70.0.3538.110":["5.0.0-nightly.20190107"],"71.0.3578.98":["5.0.0-nightly.20190121","5.0.0-nightly.20190122"],"73.0.3683.119":["5.0.0"],"73.0.3683.121":["5.0.1","5.0.2","5.0.3","5.0.4","5.0.5","5.0.6","5.0.7","5.0.8","5.0.9","5.0.10","5.0.11","5.0.12","5.0.13"],"76.0.3774.1":["6.0.0-beta.1"],"76.0.3783.1":["6.0.0-beta.2","6.0.0-beta.3","6.0.0-beta.4"],"76.0.3805.4":["6.0.0-beta.5"],"76.0.3809.3":["6.0.0-beta.6"],"76.0.3809.22":["6.0.0-beta.7"],"76.0.3809.26":["6.0.0-beta.8","6.0.0-beta.9"],"76.0.3809.37":["6.0.0-beta.10"],"76.0.3809.42":["6.0.0-beta.11"],"76.0.3809.54":["6.0.0-beta.12"],"76.0.3809.60":["6.0.0-beta.13"],"76.0.3809.68":["6.0.0-beta.14"],"76.0.3809.74":["6.0.0-beta.15"],"72.0.3626.107":["6.0.0-nightly.20190212"],"72.0.3626.110":["6.0.0-nightly.20190213"],"74.0.3724.8":["6.0.0-nightly.20190311"],"76.0.3809.88":["6.0.0"],"76.0.3809.102":["6.0.1"],"76.0.3809.110":["6.0.2"],"76.0.3809.126":["6.0.3"],"76.0.3809.131":["6.0.4"],"76.0.3809.136":["6.0.5"],"76.0.3809.138":["6.0.6"],"76.0.3809.139":["6.0.7"],"76.0.3809.146":["6.0.8","6.0.9","6.0.10","6.0.11","6.0.12","6.1.0","6.1.1","6.1.2","6.1.3","6.1.4","6.1.5","6.1.6","6.1.7","6.1.8","6.1.9","6.1.10","6.1.11","6.1.12"],"78.0.3866.0":["7.0.0-beta.1","7.0.0-beta.2","7.0.0-beta.3","7.0.0-nightly.20190727","7.0.0-nightly.20190728","7.0.0-nightly.20190729","7.0.0-nightly.20190730","7.0.0-nightly.20190731","8.0.0-nightly.20190801","8.0.0-nightly.20190802"],"78.0.3896.6":["7.0.0-beta.4"],"78.0.3905.1":["7.0.0-beta.5","7.0.0-beta.6","7.0.0-beta.7","7.0.0"],"76.0.3784.0":["7.0.0-nightly.20190521"],"76.0.3806.0":["7.0.0-nightly.20190529","7.0.0-nightly.20190530","7.0.0-nightly.20190531","7.0.0-nightly.20190602","7.0.0-nightly.20190603"],"77.0.3814.0":["7.0.0-nightly.20190604"],"77.0.3815.0":["7.0.0-nightly.20190605","7.0.0-nightly.20190606","7.0.0-nightly.20190607","7.0.0-nightly.20190608","7.0.0-nightly.20190609","7.0.0-nightly.20190611","7.0.0-nightly.20190612","7.0.0-nightly.20190613","7.0.0-nightly.20190615","7.0.0-nightly.20190616","7.0.0-nightly.20190618","7.0.0-nightly.20190619","7.0.0-nightly.20190622","7.0.0-nightly.20190623","7.0.0-nightly.20190624","7.0.0-nightly.20190627","7.0.0-nightly.20190629","7.0.0-nightly.20190630","7.0.0-nightly.20190701","7.0.0-nightly.20190702"],"77.0.3843.0":["7.0.0-nightly.20190704","7.0.0-nightly.20190705"],"77.0.3848.0":["7.0.0-nightly.20190719","7.0.0-nightly.20190720","7.0.0-nightly.20190721"],"77.0.3864.0":["7.0.0-nightly.20190726"],"78.0.3904.92":["7.0.1"],"78.0.3904.94":["7.1.0"],"78.0.3904.99":["7.1.1"],"78.0.3904.113":["7.1.2"],"78.0.3904.126":["7.1.3"],"78.0.3904.130":["7.1.4","7.1.5","7.1.6","7.1.7","7.1.8","7.1.9","7.1.10","7.1.11","7.1.12","7.1.13","7.1.14","7.2.0","7.2.1","7.2.2","7.2.3","7.2.4","7.3.0","7.3.1","7.3.2","7.3.3"],"79.0.3931.0":["8.0.0-beta.1","8.0.0-beta.2","8.0.0-nightly.20191019","8.0.0-nightly.20191020","8.0.0-nightly.20191021","8.0.0-nightly.20191023"],"80.0.3955.0":["8.0.0-beta.3","8.0.0-beta.4"],"80.0.3987.14":["8.0.0-beta.5"],"80.0.3987.51":["8.0.0-beta.6"],"80.0.3987.59":["8.0.0-beta.7"],"80.0.3987.75":["8.0.0-beta.8","8.0.0-beta.9"],"78.0.3871.0":["8.0.0-nightly.20190803","8.0.0-nightly.20190806","8.0.0-nightly.20190807","8.0.0-nightly.20190808","8.0.0-nightly.20190809","8.0.0-nightly.20190810","8.0.0-nightly.20190811","8.0.0-nightly.20190812","8.0.0-nightly.20190813","8.0.0-nightly.20190814","8.0.0-nightly.20190815"],"78.0.3881.0":["8.0.0-nightly.20190816","8.0.0-nightly.20190817","8.0.0-nightly.20190818","8.0.0-nightly.20190819","8.0.0-nightly.20190820"],"78.0.3892.0":["8.0.0-nightly.20190824","8.0.0-nightly.20190825","8.0.0-nightly.20190827","8.0.0-nightly.20190828","8.0.0-nightly.20190830","8.0.0-nightly.20190901","8.0.0-nightly.20190902","8.0.0-nightly.20190907","8.0.0-nightly.20190909","8.0.0-nightly.20190910","8.0.0-nightly.20190911","8.0.0-nightly.20190912","8.0.0-nightly.20190913","8.0.0-nightly.20190914","8.0.0-nightly.20190915","8.0.0-nightly.20190917"],"79.0.3915.0":["8.0.0-nightly.20190919","8.0.0-nightly.20190920"],"79.0.3919.0":["8.0.0-nightly.20190922","8.0.0-nightly.20190923","8.0.0-nightly.20190924","8.0.0-nightly.20190926","8.0.0-nightly.20190928","8.0.0-nightly.20190929","8.0.0-nightly.20190930","8.0.0-nightly.20191001","8.0.0-nightly.20191004","8.0.0-nightly.20191005","8.0.0-nightly.20191006","8.0.0-nightly.20191009","8.0.0-nightly.20191011","8.0.0-nightly.20191012","8.0.0-nightly.20191017"],"80.0.3952.0":["8.0.0-nightly.20191101","8.0.0-nightly.20191103","8.0.0-nightly.20191105"],"80.0.3987.86":["8.0.0","8.0.1","8.0.2"],"80.0.3987.134":["8.0.3"],"80.0.3987.137":["8.1.0"],"80.0.3987.141":["8.1.1"],"80.0.3987.158":["8.2.0"],"80.0.3987.163":["8.2.1","8.2.2","8.2.3","8.5.3","8.5.4","8.5.5"],"80.0.3987.165":["8.2.4","8.2.5","8.3.0","8.3.1","8.3.2","8.3.3","8.3.4","8.4.0","8.4.1","8.5.0","8.5.1","8.5.2"],"82.0.4048.0":["9.0.0-beta.1","9.0.0-beta.2","9.0.0-beta.3","9.0.0-beta.4","9.0.0-beta.5"],"82.0.4058.2":["9.0.0-beta.6","9.0.0-beta.7","9.0.0-beta.9"],"82.0.4085.10":["9.0.0-beta.10"],"82.0.4085.14":["9.0.0-beta.11","9.0.0-beta.12","9.0.0-beta.13"],"82.0.4085.27":["9.0.0-beta.14"],"83.0.4102.3":["9.0.0-beta.15","9.0.0-beta.16"],"83.0.4103.14":["9.0.0-beta.17"],"83.0.4103.16":["9.0.0-beta.18"],"83.0.4103.24":["9.0.0-beta.19"],"83.0.4103.26":["9.0.0-beta.20","9.0.0-beta.21"],"83.0.4103.34":["9.0.0-beta.22"],"83.0.4103.44":["9.0.0-beta.23"],"83.0.4103.45":["9.0.0-beta.24"],"80.0.3954.0":["9.0.0-nightly.20191121","9.0.0-nightly.20191122","9.0.0-nightly.20191123","9.0.0-nightly.20191124","9.0.0-nightly.20191126","9.0.0-nightly.20191128","9.0.0-nightly.20191129","9.0.0-nightly.20191130","9.0.0-nightly.20191201","9.0.0-nightly.20191202","9.0.0-nightly.20191203","9.0.0-nightly.20191204","9.0.0-nightly.20191205","9.0.0-nightly.20191210"],"81.0.3994.0":["9.0.0-nightly.20191220","9.0.0-nightly.20191221","9.0.0-nightly.20191222","9.0.0-nightly.20191223","9.0.0-nightly.20191224","9.0.0-nightly.20191225","9.0.0-nightly.20191226","9.0.0-nightly.20191228","9.0.0-nightly.20191229","9.0.0-nightly.20191230","9.0.0-nightly.20191231","9.0.0-nightly.20200101","9.0.0-nightly.20200103","9.0.0-nightly.20200104","9.0.0-nightly.20200105","9.0.0-nightly.20200106","9.0.0-nightly.20200108","9.0.0-nightly.20200109","9.0.0-nightly.20200110","9.0.0-nightly.20200111","9.0.0-nightly.20200113","9.0.0-nightly.20200115","9.0.0-nightly.20200116","9.0.0-nightly.20200117"],"81.0.4030.0":["9.0.0-nightly.20200119","9.0.0-nightly.20200121"],"83.0.4103.64":["9.0.0"],"83.0.4103.94":["9.0.1","9.0.2"],"83.0.4103.100":["9.0.3"],"83.0.4103.104":["9.0.4"],"83.0.4103.119":["9.0.5"],"83.0.4103.122":["9.1.0","9.1.1","9.1.2","9.2.0","9.2.1","9.3.0","9.3.1","9.3.2","9.3.3","9.3.4","9.3.5","9.4.0","9.4.1","9.4.2","9.4.3","9.4.4"],"84.0.4129.0":["10.0.0-beta.1","10.0.0-beta.2","10.0.0-nightly.20200501","10.0.0-nightly.20200504","10.0.0-nightly.20200505","10.0.0-nightly.20200506","10.0.0-nightly.20200507","10.0.0-nightly.20200508","10.0.0-nightly.20200511","10.0.0-nightly.20200512","10.0.0-nightly.20200513","10.0.0-nightly.20200514","10.0.0-nightly.20200515","10.0.0-nightly.20200518","10.0.0-nightly.20200519","10.0.0-nightly.20200520","10.0.0-nightly.20200521","11.0.0-nightly.20200525","11.0.0-nightly.20200526"],"85.0.4161.2":["10.0.0-beta.3","10.0.0-beta.4"],"85.0.4181.1":["10.0.0-beta.8","10.0.0-beta.9"],"85.0.4183.19":["10.0.0-beta.10"],"85.0.4183.20":["10.0.0-beta.11"],"85.0.4183.26":["10.0.0-beta.12"],"85.0.4183.39":["10.0.0-beta.13","10.0.0-beta.14","10.0.0-beta.15","10.0.0-beta.17","10.0.0-beta.19","10.0.0-beta.20","10.0.0-beta.21"],"85.0.4183.70":["10.0.0-beta.23"],"85.0.4183.78":["10.0.0-beta.24"],"85.0.4183.80":["10.0.0-beta.25"],"82.0.4050.0":["10.0.0-nightly.20200209","10.0.0-nightly.20200210","10.0.0-nightly.20200211","10.0.0-nightly.20200216","10.0.0-nightly.20200217","10.0.0-nightly.20200218","10.0.0-nightly.20200221","10.0.0-nightly.20200222","10.0.0-nightly.20200223","10.0.0-nightly.20200226","10.0.0-nightly.20200303"],"82.0.4076.0":["10.0.0-nightly.20200304","10.0.0-nightly.20200305","10.0.0-nightly.20200306","10.0.0-nightly.20200309","10.0.0-nightly.20200310"],"82.0.4083.0":["10.0.0-nightly.20200311"],"83.0.4086.0":["10.0.0-nightly.20200316"],"83.0.4087.0":["10.0.0-nightly.20200317","10.0.0-nightly.20200318","10.0.0-nightly.20200320","10.0.0-nightly.20200323","10.0.0-nightly.20200324","10.0.0-nightly.20200325","10.0.0-nightly.20200326","10.0.0-nightly.20200327","10.0.0-nightly.20200330","10.0.0-nightly.20200331","10.0.0-nightly.20200401","10.0.0-nightly.20200402","10.0.0-nightly.20200403","10.0.0-nightly.20200406"],"83.0.4095.0":["10.0.0-nightly.20200408","10.0.0-nightly.20200410","10.0.0-nightly.20200413"],"84.0.4114.0":["10.0.0-nightly.20200414"],"84.0.4115.0":["10.0.0-nightly.20200415","10.0.0-nightly.20200416","10.0.0-nightly.20200417"],"84.0.4121.0":["10.0.0-nightly.20200422","10.0.0-nightly.20200423"],"84.0.4125.0":["10.0.0-nightly.20200427","10.0.0-nightly.20200428","10.0.0-nightly.20200429","10.0.0-nightly.20200430"],"85.0.4183.84":["10.0.0"],"85.0.4183.86":["10.0.1"],"85.0.4183.87":["10.1.0"],"85.0.4183.93":["10.1.1"],"85.0.4183.98":["10.1.2"],"85.0.4183.121":["10.1.3","10.1.4","10.1.5","10.1.6","10.1.7","10.2.0","10.3.0","10.3.1","10.3.2","10.4.0","10.4.1","10.4.2","10.4.3","10.4.4","10.4.5","10.4.6","10.4.7"],"86.0.4234.0":["11.0.0-beta.1","11.0.0-beta.3","11.0.0-beta.4","11.0.0-beta.5","11.0.0-beta.6","11.0.0-beta.7","11.0.0-nightly.20200822","11.0.0-nightly.20200824","11.0.0-nightly.20200825","11.0.0-nightly.20200826","12.0.0-nightly.20200827","12.0.0-nightly.20200831","12.0.0-nightly.20200902","12.0.0-nightly.20200903","12.0.0-nightly.20200907","12.0.0-nightly.20200910","12.0.0-nightly.20200911","12.0.0-nightly.20200914"],"87.0.4251.1":["11.0.0-beta.8","11.0.0-beta.9","11.0.0-beta.11"],"87.0.4280.11":["11.0.0-beta.12","11.0.0-beta.13"],"87.0.4280.27":["11.0.0-beta.16","11.0.0-beta.17","11.0.0-beta.18","11.0.0-beta.19"],"87.0.4280.40":["11.0.0-beta.20"],"87.0.4280.47":["11.0.0-beta.22","11.0.0-beta.23"],"85.0.4156.0":["11.0.0-nightly.20200529"],"85.0.4162.0":["11.0.0-nightly.20200602","11.0.0-nightly.20200603","11.0.0-nightly.20200604","11.0.0-nightly.20200609","11.0.0-nightly.20200610","11.0.0-nightly.20200611","11.0.0-nightly.20200615","11.0.0-nightly.20200616","11.0.0-nightly.20200617","11.0.0-nightly.20200618","11.0.0-nightly.20200619"],"85.0.4179.0":["11.0.0-nightly.20200701","11.0.0-nightly.20200702","11.0.0-nightly.20200703","11.0.0-nightly.20200706","11.0.0-nightly.20200707","11.0.0-nightly.20200708","11.0.0-nightly.20200709"],"86.0.4203.0":["11.0.0-nightly.20200716","11.0.0-nightly.20200717","11.0.0-nightly.20200720","11.0.0-nightly.20200721"],"86.0.4209.0":["11.0.0-nightly.20200723","11.0.0-nightly.20200724","11.0.0-nightly.20200729","11.0.0-nightly.20200730","11.0.0-nightly.20200731","11.0.0-nightly.20200803","11.0.0-nightly.20200804","11.0.0-nightly.20200805","11.0.0-nightly.20200811","11.0.0-nightly.20200812"],"87.0.4280.60":["11.0.0","11.0.1"],"87.0.4280.67":["11.0.2","11.0.3","11.0.4"],"87.0.4280.88":["11.0.5","11.1.0","11.1.1"],"87.0.4280.141":["11.2.0","11.2.1","11.2.2","11.2.3","11.3.0","11.4.0","11.4.1","11.4.2","11.4.3","11.4.4","11.4.5","11.4.6","11.4.7","11.4.8","11.4.9","11.4.10","11.4.11","11.4.12","11.5.0"],"89.0.4328.0":["12.0.0-beta.1","12.0.0-beta.3","12.0.0-beta.4","12.0.0-beta.5","12.0.0-beta.6","12.0.0-beta.7","12.0.0-beta.8","12.0.0-beta.9","12.0.0-beta.10","12.0.0-beta.11","12.0.0-beta.12","12.0.0-beta.14","13.0.0-nightly.20201119","13.0.0-nightly.20201123","13.0.0-nightly.20201124","13.0.0-nightly.20201126","13.0.0-nightly.20201127","13.0.0-nightly.20201130","13.0.0-nightly.20201201","13.0.0-nightly.20201202","13.0.0-nightly.20201203","13.0.0-nightly.20201204","13.0.0-nightly.20201207","13.0.0-nightly.20201208","13.0.0-nightly.20201209","13.0.0-nightly.20201210","13.0.0-nightly.20201211","13.0.0-nightly.20201214"],"89.0.4348.1":["12.0.0-beta.16","12.0.0-beta.18","12.0.0-beta.19","12.0.0-beta.20"],"89.0.4388.2":["12.0.0-beta.21","12.0.0-beta.22","12.0.0-beta.23","12.0.0-beta.24","12.0.0-beta.25","12.0.0-beta.26"],"89.0.4389.23":["12.0.0-beta.27","12.0.0-beta.28","12.0.0-beta.29"],"89.0.4389.58":["12.0.0-beta.30","12.0.0-beta.31"],"87.0.4268.0":["12.0.0-nightly.20201002","12.0.0-nightly.20201007","12.0.0-nightly.20201009","12.0.0-nightly.20201012","12.0.0-nightly.20201013","12.0.0-nightly.20201014","12.0.0-nightly.20201015"],"88.0.4292.0":["12.0.0-nightly.20201023","12.0.0-nightly.20201026"],"88.0.4306.0":["12.0.0-nightly.20201030","12.0.0-nightly.20201102","12.0.0-nightly.20201103","12.0.0-nightly.20201104","12.0.0-nightly.20201105","12.0.0-nightly.20201106","12.0.0-nightly.20201111","12.0.0-nightly.20201112"],"88.0.4324.0":["12.0.0-nightly.20201116"],"89.0.4389.69":["12.0.0"],"89.0.4389.82":["12.0.1"],"89.0.4389.90":["12.0.2"],"89.0.4389.114":["12.0.3","12.0.4"],"89.0.4389.128":["12.0.5","12.0.6","12.0.7","12.0.8","12.0.9","12.0.10","12.0.11","12.0.12","12.0.13","12.0.14","12.0.15","12.0.16","12.0.17","12.0.18","12.1.0","12.1.1","12.1.2","12.2.0","12.2.1","12.2.2","12.2.3"],"90.0.4402.0":["13.0.0-beta.2","13.0.0-beta.3","13.0.0-nightly.20210210","13.0.0-nightly.20210211","13.0.0-nightly.20210212","13.0.0-nightly.20210216","13.0.0-nightly.20210217","13.0.0-nightly.20210218","13.0.0-nightly.20210219","13.0.0-nightly.20210222","13.0.0-nightly.20210225","13.0.0-nightly.20210226","13.0.0-nightly.20210301","13.0.0-nightly.20210302","13.0.0-nightly.20210303","14.0.0-nightly.20210304"],"90.0.4415.0":["13.0.0-beta.4","13.0.0-beta.5","13.0.0-beta.6","13.0.0-beta.7","13.0.0-beta.8","13.0.0-beta.9","13.0.0-beta.10","13.0.0-beta.11","13.0.0-beta.12","13.0.0-beta.13","14.0.0-nightly.20210305","14.0.0-nightly.20210308","14.0.0-nightly.20210309","14.0.0-nightly.20210311","14.0.0-nightly.20210315","14.0.0-nightly.20210316","14.0.0-nightly.20210317","14.0.0-nightly.20210318","14.0.0-nightly.20210319","14.0.0-nightly.20210323","14.0.0-nightly.20210324","14.0.0-nightly.20210325","14.0.0-nightly.20210326","14.0.0-nightly.20210329","14.0.0-nightly.20210330"],"91.0.4448.0":["13.0.0-beta.14","13.0.0-beta.16","13.0.0-beta.17","13.0.0-beta.18","13.0.0-beta.20","14.0.0-nightly.20210331","14.0.0-nightly.20210401","14.0.0-nightly.20210402","14.0.0-nightly.20210406","14.0.0-nightly.20210407","14.0.0-nightly.20210408","14.0.0-nightly.20210409","14.0.0-nightly.20210413"],"91.0.4472.33":["13.0.0-beta.21","13.0.0-beta.22","13.0.0-beta.23"],"91.0.4472.38":["13.0.0-beta.24","13.0.0-beta.25","13.0.0-beta.26","13.0.0-beta.27","13.0.0-beta.28"],"89.0.4349.0":["13.0.0-nightly.20201215","13.0.0-nightly.20201216","13.0.0-nightly.20201221","13.0.0-nightly.20201222"],"89.0.4359.0":["13.0.0-nightly.20201223","13.0.0-nightly.20210104","13.0.0-nightly.20210108","13.0.0-nightly.20210111"],"89.0.4386.0":["13.0.0-nightly.20210113","13.0.0-nightly.20210114","13.0.0-nightly.20210118","13.0.0-nightly.20210122","13.0.0-nightly.20210125"],"89.0.4389.0":["13.0.0-nightly.20210127","13.0.0-nightly.20210128","13.0.0-nightly.20210129","13.0.0-nightly.20210201","13.0.0-nightly.20210202","13.0.0-nightly.20210203","13.0.0-nightly.20210205","13.0.0-nightly.20210208","13.0.0-nightly.20210209"],"91.0.4472.69":["13.0.0","13.0.1"],"91.0.4472.77":["13.1.0","13.1.1","13.1.2"],"91.0.4472.106":["13.1.3","13.1.4"],"91.0.4472.124":["13.1.5","13.1.6","13.1.7"],"91.0.4472.164":["13.1.8","13.1.9","13.2.0","13.2.1","13.2.2","13.2.3","13.3.0","13.4.0","13.5.0","13.5.1","13.5.2","13.6.0","13.6.1","13.6.2","13.6.3","13.6.6","13.6.7","13.6.8","13.6.9"],"92.0.4511.0":["14.0.0-beta.1","14.0.0-beta.2","14.0.0-beta.3","14.0.0-nightly.20210520","14.0.0-nightly.20210523","14.0.0-nightly.20210524","15.0.0-nightly.20210527","15.0.0-nightly.20210528","15.0.0-nightly.20210531","15.0.0-nightly.20210601","15.0.0-nightly.20210602"],"93.0.4536.0":["14.0.0-beta.5","14.0.0-beta.6","14.0.0-beta.7","14.0.0-beta.8","15.0.0-nightly.20210609","15.0.0-nightly.20210610","15.0.0-nightly.20210611","15.0.0-nightly.20210614","15.0.0-nightly.20210615","15.0.0-nightly.20210616"],"93.0.4539.0":["14.0.0-beta.9","14.0.0-beta.10","15.0.0-nightly.20210617","15.0.0-nightly.20210618","15.0.0-nightly.20210621","15.0.0-nightly.20210622"],"93.0.4557.4":["14.0.0-beta.11","14.0.0-beta.12"],"93.0.4566.0":["14.0.0-beta.13","14.0.0-beta.14","14.0.0-beta.15","14.0.0-beta.16","14.0.0-beta.17","15.0.0-alpha.1","15.0.0-alpha.2","15.0.0-nightly.20210706","15.0.0-nightly.20210707","15.0.0-nightly.20210708","15.0.0-nightly.20210709","15.0.0-nightly.20210712","15.0.0-nightly.20210713","15.0.0-nightly.20210714","15.0.0-nightly.20210715","15.0.0-nightly.20210716","15.0.0-nightly.20210719","15.0.0-nightly.20210720","15.0.0-nightly.20210721","16.0.0-nightly.20210722","16.0.0-nightly.20210723","16.0.0-nightly.20210726"],"93.0.4577.15":["14.0.0-beta.18","14.0.0-beta.19","14.0.0-beta.20","14.0.0-beta.21"],"93.0.4577.25":["14.0.0-beta.22","14.0.0-beta.23"],"93.0.4577.51":["14.0.0-beta.24","14.0.0-beta.25"],"92.0.4475.0":["14.0.0-nightly.20210426","14.0.0-nightly.20210427"],"92.0.4488.0":["14.0.0-nightly.20210430","14.0.0-nightly.20210503"],"92.0.4496.0":["14.0.0-nightly.20210505"],"92.0.4498.0":["14.0.0-nightly.20210506"],"92.0.4499.0":["14.0.0-nightly.20210507","14.0.0-nightly.20210510","14.0.0-nightly.20210511","14.0.0-nightly.20210512","14.0.0-nightly.20210513"],"92.0.4505.0":["14.0.0-nightly.20210514","14.0.0-nightly.20210517","14.0.0-nightly.20210518","14.0.0-nightly.20210519"],"93.0.4577.58":["14.0.0"],"93.0.4577.63":["14.0.1"],"93.0.4577.82":["14.0.2","14.1.0","14.1.1","14.2.0","14.2.1","14.2.2","14.2.3","14.2.4","14.2.5","14.2.6","14.2.7","14.2.8","14.2.9"],"94.0.4584.0":["15.0.0-alpha.3","15.0.0-alpha.4","15.0.0-alpha.5","15.0.0-alpha.6","16.0.0-nightly.20210727","16.0.0-nightly.20210728","16.0.0-nightly.20210729","16.0.0-nightly.20210730","16.0.0-nightly.20210802","16.0.0-nightly.20210803","16.0.0-nightly.20210804","16.0.0-nightly.20210805","16.0.0-nightly.20210806","16.0.0-nightly.20210809","16.0.0-nightly.20210810","16.0.0-nightly.20210811"],"94.0.4590.2":["15.0.0-alpha.7","15.0.0-alpha.8","15.0.0-alpha.9","16.0.0-nightly.20210812","16.0.0-nightly.20210813","16.0.0-nightly.20210816","16.0.0-nightly.20210817","16.0.0-nightly.20210818","16.0.0-nightly.20210819","16.0.0-nightly.20210820","16.0.0-nightly.20210823"],"94.0.4606.12":["15.0.0-alpha.10"],"94.0.4606.20":["15.0.0-beta.1","15.0.0-beta.2"],"94.0.4606.31":["15.0.0-beta.3","15.0.0-beta.4","15.0.0-beta.5","15.0.0-beta.6","15.0.0-beta.7"],"93.0.4530.0":["15.0.0-nightly.20210603","15.0.0-nightly.20210604"],"93.0.4535.0":["15.0.0-nightly.20210608"],"93.0.4550.0":["15.0.0-nightly.20210623","15.0.0-nightly.20210624"],"93.0.4552.0":["15.0.0-nightly.20210625","15.0.0-nightly.20210628","15.0.0-nightly.20210629"],"93.0.4558.0":["15.0.0-nightly.20210630","15.0.0-nightly.20210701","15.0.0-nightly.20210702","15.0.0-nightly.20210705"],"94.0.4606.51":["15.0.0"],"94.0.4606.61":["15.1.0","15.1.1"],"94.0.4606.71":["15.1.2"],"94.0.4606.81":["15.2.0","15.3.0","15.3.1","15.3.2","15.3.3","15.3.4","15.3.5","15.3.6","15.3.7","15.4.0","15.4.1","15.4.2","15.5.0","15.5.1","15.5.2","15.5.3","15.5.4","15.5.5","15.5.6","15.5.7"],"95.0.4629.0":["16.0.0-alpha.1","16.0.0-alpha.2","16.0.0-alpha.3","16.0.0-alpha.4","16.0.0-alpha.5","16.0.0-alpha.6","16.0.0-alpha.7","16.0.0-nightly.20210902","16.0.0-nightly.20210903","16.0.0-nightly.20210906","16.0.0-nightly.20210907","16.0.0-nightly.20210908","16.0.0-nightly.20210909","16.0.0-nightly.20210910","16.0.0-nightly.20210913","16.0.0-nightly.20210914","16.0.0-nightly.20210915","16.0.0-nightly.20210916","16.0.0-nightly.20210917","16.0.0-nightly.20210920","16.0.0-nightly.20210921","16.0.0-nightly.20210922","17.0.0-nightly.20210923","17.0.0-nightly.20210924","17.0.0-nightly.20210927","17.0.0-nightly.20210928","17.0.0-nightly.20210929","17.0.0-nightly.20210930","17.0.0-nightly.20211001","17.0.0-nightly.20211004","17.0.0-nightly.20211005"],"96.0.4647.0":["16.0.0-alpha.8","16.0.0-alpha.9","16.0.0-beta.1","16.0.0-beta.2","16.0.0-beta.3","17.0.0-nightly.20211006","17.0.0-nightly.20211007","17.0.0-nightly.20211008","17.0.0-nightly.20211011","17.0.0-nightly.20211012","17.0.0-nightly.20211013","17.0.0-nightly.20211014","17.0.0-nightly.20211015","17.0.0-nightly.20211018","17.0.0-nightly.20211019","17.0.0-nightly.20211020","17.0.0-nightly.20211021"],"96.0.4664.18":["16.0.0-beta.4","16.0.0-beta.5"],"96.0.4664.27":["16.0.0-beta.6","16.0.0-beta.7"],"96.0.4664.35":["16.0.0-beta.8","16.0.0-beta.9"],"95.0.4612.5":["16.0.0-nightly.20210824","16.0.0-nightly.20210825","16.0.0-nightly.20210826","16.0.0-nightly.20210827","16.0.0-nightly.20210830","16.0.0-nightly.20210831","16.0.0-nightly.20210901"],"96.0.4664.45":["16.0.0","16.0.1"],"96.0.4664.55":["16.0.2","16.0.3","16.0.4","16.0.5"],"96.0.4664.110":["16.0.6","16.0.7","16.0.8"],"96.0.4664.174":["16.0.9","16.0.10","16.1.0","16.1.1","16.2.0","16.2.1","16.2.2","16.2.3","16.2.4","16.2.5","16.2.6","16.2.7","16.2.8"],"96.0.4664.4":["17.0.0-alpha.1","17.0.0-alpha.2","17.0.0-alpha.3","17.0.0-nightly.20211022","17.0.0-nightly.20211025","17.0.0-nightly.20211026","17.0.0-nightly.20211027","17.0.0-nightly.20211028","17.0.0-nightly.20211029","17.0.0-nightly.20211101","17.0.0-nightly.20211102","17.0.0-nightly.20211103","17.0.0-nightly.20211104","17.0.0-nightly.20211105","17.0.0-nightly.20211108","17.0.0-nightly.20211109","17.0.0-nightly.20211110","17.0.0-nightly.20211111","17.0.0-nightly.20211112","17.0.0-nightly.20211115","17.0.0-nightly.20211116","17.0.0-nightly.20211117","18.0.0-nightly.20211118","18.0.0-nightly.20211119","18.0.0-nightly.20211122","18.0.0-nightly.20211123"],"98.0.4706.0":["17.0.0-alpha.4","17.0.0-alpha.5","17.0.0-alpha.6","17.0.0-beta.1","17.0.0-beta.2","18.0.0-nightly.20211124","18.0.0-nightly.20211125","18.0.0-nightly.20211126","18.0.0-nightly.20211129","18.0.0-nightly.20211130","18.0.0-nightly.20211201","18.0.0-nightly.20211202","18.0.0-nightly.20211203","18.0.0-nightly.20211206","18.0.0-nightly.20211207","18.0.0-nightly.20211208","18.0.0-nightly.20211209","18.0.0-nightly.20211210","18.0.0-nightly.20211213","18.0.0-nightly.20211214","18.0.0-nightly.20211215","18.0.0-nightly.20211216","18.0.0-nightly.20211217","18.0.0-nightly.20211220","18.0.0-nightly.20211221","18.0.0-nightly.20211222","18.0.0-nightly.20211223","18.0.0-nightly.20211228","18.0.0-nightly.20211229","18.0.0-nightly.20211231","18.0.0-nightly.20220103","18.0.0-nightly.20220104","18.0.0-nightly.20220105","18.0.0-nightly.20220106","18.0.0-nightly.20220107","18.0.0-nightly.20220110"],"98.0.4758.9":["17.0.0-beta.3"],"98.0.4758.11":["17.0.0-beta.4","17.0.0-beta.5","17.0.0-beta.6","17.0.0-beta.7","17.0.0-beta.8","17.0.0-beta.9"],"98.0.4758.74":["17.0.0"],"98.0.4758.82":["17.0.1"],"98.0.4758.102":["17.1.0"],"98.0.4758.109":["17.1.1","17.1.2","17.2.0"],"98.0.4758.141":["17.3.0","17.3.1","17.4.0","17.4.1","17.4.2","17.4.3","17.4.4","17.4.5","17.4.6","17.4.7","17.4.8","17.4.9","17.4.10","17.4.11"],"99.0.4767.0":["18.0.0-alpha.1","18.0.0-alpha.2","18.0.0-alpha.3","18.0.0-alpha.4","18.0.0-alpha.5","18.0.0-nightly.20220111","18.0.0-nightly.20220112","18.0.0-nightly.20220113","18.0.0-nightly.20220114","18.0.0-nightly.20220117","18.0.0-nightly.20220118","18.0.0-nightly.20220119","18.0.0-nightly.20220121","18.0.0-nightly.20220124","18.0.0-nightly.20220125","18.0.0-nightly.20220127","18.0.0-nightly.20220128","18.0.0-nightly.20220131","18.0.0-nightly.20220201","19.0.0-nightly.20220202","19.0.0-nightly.20220203","19.0.0-nightly.20220204","19.0.0-nightly.20220207","19.0.0-nightly.20220208","19.0.0-nightly.20220209"],"100.0.4894.0":["18.0.0-beta.1","18.0.0-beta.2","18.0.0-beta.3","18.0.0-beta.4","18.0.0-beta.5","18.0.0-beta.6","19.0.0-nightly.20220308","19.0.0-nightly.20220309","19.0.0-nightly.20220310","19.0.0-nightly.20220311","19.0.0-nightly.20220314","19.0.0-nightly.20220315","19.0.0-nightly.20220316","19.0.0-nightly.20220317","19.0.0-nightly.20220318","19.0.0-nightly.20220321","19.0.0-nightly.20220322","19.0.0-nightly.20220323","19.0.0-nightly.20220324"],"100.0.4896.56":["18.0.0"],"100.0.4896.60":["18.0.1","18.0.2"],"100.0.4896.75":["18.0.3","18.0.4"],"100.0.4896.127":["18.1.0"],"100.0.4896.143":["18.2.0","18.2.1","18.2.2","18.2.3"],"100.0.4896.160":["18.2.4","18.3.0","18.3.1","18.3.2","18.3.3","18.3.4","18.3.5","18.3.6","18.3.7","18.3.8","18.3.9","18.3.11","18.3.12","18.3.13","18.3.14","18.3.15"],"102.0.4962.3":["19.0.0-alpha.1","19.0.0-nightly.20220328","19.0.0-nightly.20220329","20.0.0-nightly.20220330"],"102.0.4971.0":["19.0.0-alpha.2","19.0.0-alpha.3","20.0.0-nightly.20220411"],"102.0.4989.0":["19.0.0-alpha.4","19.0.0-alpha.5","20.0.0-nightly.20220414","20.0.0-nightly.20220415","20.0.0-nightly.20220418","20.0.0-nightly.20220419","20.0.0-nightly.20220420","20.0.0-nightly.20220421"],"102.0.4999.0":["19.0.0-beta.1","19.0.0-beta.2","19.0.0-beta.3","20.0.0-nightly.20220425","20.0.0-nightly.20220426","20.0.0-nightly.20220427","20.0.0-nightly.20220428","20.0.0-nightly.20220429","20.0.0-nightly.20220502","20.0.0-nightly.20220503","20.0.0-nightly.20220504","20.0.0-nightly.20220505","20.0.0-nightly.20220506","20.0.0-nightly.20220509","20.0.0-nightly.20220511","20.0.0-nightly.20220512","20.0.0-nightly.20220513","20.0.0-nightly.20220516","20.0.0-nightly.20220517"],"102.0.5005.27":["19.0.0-beta.4"],"102.0.5005.40":["19.0.0-beta.5","19.0.0-beta.6","19.0.0-beta.7"],"102.0.5005.49":["19.0.0-beta.8"],"102.0.4961.0":["19.0.0-nightly.20220325"],"102.0.5005.61":["19.0.0","19.0.1"],"102.0.5005.63":["19.0.2","19.0.3","19.0.4"],"102.0.5005.115":["19.0.5","19.0.6"],"102.0.5005.134":["19.0.7"],"102.0.5005.148":["19.0.8"],"102.0.5005.167":["19.0.9","19.0.10","19.0.11","19.0.12","19.0.13","19.0.14","19.0.15","19.0.16","19.0.17","19.1.0","19.1.1","19.1.2","19.1.3","19.1.4","19.1.5","19.1.6","19.1.7","19.1.8","19.1.9"],"103.0.5044.0":["20.0.0-alpha.1","20.0.0-nightly.20220518","20.0.0-nightly.20220519","20.0.0-nightly.20220520","20.0.0-nightly.20220523","20.0.0-nightly.20220524","21.0.0-nightly.20220526","21.0.0-nightly.20220527","21.0.0-nightly.20220530","21.0.0-nightly.20220531"],"104.0.5073.0":["20.0.0-alpha.2","20.0.0-alpha.3","20.0.0-alpha.4","20.0.0-alpha.5","20.0.0-alpha.6","20.0.0-alpha.7","20.0.0-beta.1","20.0.0-beta.2","20.0.0-beta.3","20.0.0-beta.4","20.0.0-beta.5","20.0.0-beta.6","20.0.0-beta.7","20.0.0-beta.8","21.0.0-nightly.20220602","21.0.0-nightly.20220603","21.0.0-nightly.20220606","21.0.0-nightly.20220607","21.0.0-nightly.20220608","21.0.0-nightly.20220609","21.0.0-nightly.20220610","21.0.0-nightly.20220613","21.0.0-nightly.20220614","21.0.0-nightly.20220615","21.0.0-nightly.20220616","21.0.0-nightly.20220617","21.0.0-nightly.20220620","21.0.0-nightly.20220621","21.0.0-nightly.20220622","21.0.0-nightly.20220623","21.0.0-nightly.20220624","21.0.0-nightly.20220627"],"104.0.5112.39":["20.0.0-beta.9"],"104.0.5112.48":["20.0.0-beta.10","20.0.0-beta.11","20.0.0-beta.12"],"104.0.5112.57":["20.0.0-beta.13"],"104.0.5112.65":["20.0.0"],"104.0.5112.81":["20.0.1","20.0.2","20.0.3"],"104.0.5112.102":["20.1.0","20.1.1"],"104.0.5112.114":["20.1.2","20.1.3","20.1.4"],"104.0.5112.124":["20.2.0","20.3.0","20.3.1","20.3.2","20.3.3","20.3.4","20.3.5","20.3.6","20.3.7","20.3.8","20.3.9","20.3.10","20.3.11","20.3.12"],"105.0.5187.0":["21.0.0-alpha.1","21.0.0-alpha.2","21.0.0-alpha.3","21.0.0-alpha.4","21.0.0-alpha.5","21.0.0-nightly.20220720","21.0.0-nightly.20220721","21.0.0-nightly.20220722","21.0.0-nightly.20220725","21.0.0-nightly.20220726","21.0.0-nightly.20220727","21.0.0-nightly.20220728","21.0.0-nightly.20220801","21.0.0-nightly.20220802","22.0.0-nightly.20220808","22.0.0-nightly.20220809","22.0.0-nightly.20220810","22.0.0-nightly.20220811","22.0.0-nightly.20220812","22.0.0-nightly.20220815","22.0.0-nightly.20220816","22.0.0-nightly.20220817"],"106.0.5216.0":["21.0.0-alpha.6","21.0.0-beta.1","21.0.0-beta.2","21.0.0-beta.3","21.0.0-beta.4","21.0.0-beta.5","22.0.0-nightly.20220822","22.0.0-nightly.20220823","22.0.0-nightly.20220824","22.0.0-nightly.20220825","22.0.0-nightly.20220829","22.0.0-nightly.20220830","22.0.0-nightly.20220831","22.0.0-nightly.20220901","22.0.0-nightly.20220902","22.0.0-nightly.20220905"],"106.0.5249.40":["21.0.0-beta.6","21.0.0-beta.7","21.0.0-beta.8"],"105.0.5129.0":["21.0.0-nightly.20220628","21.0.0-nightly.20220629","21.0.0-nightly.20220630","21.0.0-nightly.20220701","21.0.0-nightly.20220704","21.0.0-nightly.20220705","21.0.0-nightly.20220706","21.0.0-nightly.20220707","21.0.0-nightly.20220708","21.0.0-nightly.20220711","21.0.0-nightly.20220712","21.0.0-nightly.20220713"],"105.0.5173.0":["21.0.0-nightly.20220715","21.0.0-nightly.20220718","21.0.0-nightly.20220719"],"106.0.5249.51":["21.0.0"],"106.0.5249.61":["21.0.1"],"106.0.5249.91":["21.1.0"],"106.0.5249.103":["21.1.1"],"106.0.5249.119":["21.2.0"],"106.0.5249.165":["21.2.1"],"106.0.5249.168":["21.2.2","21.2.3"],"106.0.5249.181":["21.3.0","21.3.1"],"106.0.5249.199":["21.3.3","21.3.4","21.3.5","21.4.0","21.4.1","21.4.2","21.4.3","21.4.4"],"107.0.5286.0":["22.0.0-alpha.1","22.0.0-nightly.20220909","22.0.0-nightly.20220912","22.0.0-nightly.20220913","22.0.0-nightly.20220914","22.0.0-nightly.20220915","22.0.0-nightly.20220916","22.0.0-nightly.20220919","22.0.0-nightly.20220920","22.0.0-nightly.20220921","22.0.0-nightly.20220922","22.0.0-nightly.20220923","22.0.0-nightly.20220926","22.0.0-nightly.20220927","22.0.0-nightly.20220928","23.0.0-nightly.20220929","23.0.0-nightly.20220930","23.0.0-nightly.20221003"],"108.0.5329.0":["22.0.0-alpha.3","22.0.0-alpha.4","22.0.0-alpha.5","22.0.0-alpha.6","23.0.0-nightly.20221004","23.0.0-nightly.20221005","23.0.0-nightly.20221006","23.0.0-nightly.20221007","23.0.0-nightly.20221010","23.0.0-nightly.20221011","23.0.0-nightly.20221012","23.0.0-nightly.20221013","23.0.0-nightly.20221014","23.0.0-nightly.20221017"],"108.0.5355.0":["22.0.0-alpha.7","23.0.0-nightly.20221018","23.0.0-nightly.20221019","23.0.0-nightly.20221020","23.0.0-nightly.20221021","23.0.0-nightly.20221024","23.0.0-nightly.20221026"],"108.0.5359.10":["22.0.0-alpha.8","22.0.0-beta.1","22.0.0-beta.2","22.0.0-beta.3"],"108.0.5359.29":["22.0.0-beta.4"],"108.0.5359.40":["22.0.0-beta.5","22.0.0-beta.6"],"108.0.5359.48":["22.0.0-beta.7","22.0.0-beta.8"],"107.0.5274.0":["22.0.0-nightly.20220908"],"108.0.5359.62":["22.0.0"],"108.0.5359.125":["22.0.1"],"108.0.5359.179":["22.0.2","22.0.3","22.1.0"],"108.0.5359.215":["22.2.0","22.2.1","22.3.0","22.3.1","22.3.2","22.3.3","22.3.4","22.3.5","22.3.6","22.3.7","22.3.8","22.3.9","22.3.10","22.3.11","22.3.12","22.3.13","22.3.14","22.3.15","22.3.16","22.3.17","22.3.18","22.3.20","22.3.21","22.3.22","22.3.23","22.3.24","22.3.25","22.3.26","22.3.27"],"110.0.5415.0":["23.0.0-alpha.1","23.0.0-nightly.20221118","23.0.0-nightly.20221121","23.0.0-nightly.20221122","23.0.0-nightly.20221123","23.0.0-nightly.20221124","23.0.0-nightly.20221125","23.0.0-nightly.20221128","23.0.0-nightly.20221129","23.0.0-nightly.20221130","24.0.0-nightly.20221201","24.0.0-nightly.20221202","24.0.0-nightly.20221205"],"110.0.5451.0":["23.0.0-alpha.2","23.0.0-alpha.3","24.0.0-nightly.20221206","24.0.0-nightly.20221207","24.0.0-nightly.20221208","24.0.0-nightly.20221213","24.0.0-nightly.20221214","24.0.0-nightly.20221215","24.0.0-nightly.20221216"],"110.0.5478.5":["23.0.0-beta.1","23.0.0-beta.2","23.0.0-beta.3"],"110.0.5481.30":["23.0.0-beta.4"],"110.0.5481.38":["23.0.0-beta.5"],"110.0.5481.52":["23.0.0-beta.6","23.0.0-beta.8"],"109.0.5382.0":["23.0.0-nightly.20221027","23.0.0-nightly.20221028","23.0.0-nightly.20221031","23.0.0-nightly.20221101","23.0.0-nightly.20221102","23.0.0-nightly.20221103","23.0.0-nightly.20221104","23.0.0-nightly.20221107","23.0.0-nightly.20221108","23.0.0-nightly.20221109","23.0.0-nightly.20221110","23.0.0-nightly.20221111","23.0.0-nightly.20221114","23.0.0-nightly.20221115","23.0.0-nightly.20221116","23.0.0-nightly.20221117"],"110.0.5481.77":["23.0.0"],"110.0.5481.100":["23.1.0"],"110.0.5481.104":["23.1.1"],"110.0.5481.177":["23.1.2"],"110.0.5481.179":["23.1.3"],"110.0.5481.192":["23.1.4","23.2.0"],"110.0.5481.208":["23.2.1","23.2.2","23.2.3","23.2.4","23.3.0","23.3.1","23.3.2","23.3.3","23.3.4","23.3.5","23.3.6","23.3.7","23.3.8","23.3.9","23.3.10","23.3.11","23.3.12","23.3.13"],"111.0.5560.0":["24.0.0-alpha.1","24.0.0-alpha.2","24.0.0-alpha.3","24.0.0-alpha.4","24.0.0-alpha.5","24.0.0-alpha.6","24.0.0-alpha.7","24.0.0-nightly.20230203","24.0.0-nightly.20230206","24.0.0-nightly.20230207","24.0.0-nightly.20230208","24.0.0-nightly.20230209","25.0.0-nightly.20230210","25.0.0-nightly.20230214","25.0.0-nightly.20230215","25.0.0-nightly.20230216","25.0.0-nightly.20230217","25.0.0-nightly.20230220","25.0.0-nightly.20230221","25.0.0-nightly.20230222","25.0.0-nightly.20230223","25.0.0-nightly.20230224","25.0.0-nightly.20230227","25.0.0-nightly.20230228","25.0.0-nightly.20230301","25.0.0-nightly.20230302","25.0.0-nightly.20230303","25.0.0-nightly.20230306","25.0.0-nightly.20230307","25.0.0-nightly.20230308","25.0.0-nightly.20230309","25.0.0-nightly.20230310"],"111.0.5563.50":["24.0.0-beta.1","24.0.0-beta.2"],"112.0.5615.20":["24.0.0-beta.3","24.0.0-beta.4"],"112.0.5615.29":["24.0.0-beta.5"],"112.0.5615.39":["24.0.0-beta.6","24.0.0-beta.7"],"111.0.5518.0":["24.0.0-nightly.20230109","24.0.0-nightly.20230110","24.0.0-nightly.20230111","24.0.0-nightly.20230112","24.0.0-nightly.20230113","24.0.0-nightly.20230116","24.0.0-nightly.20230117","24.0.0-nightly.20230118","24.0.0-nightly.20230119","24.0.0-nightly.20230120","24.0.0-nightly.20230123","24.0.0-nightly.20230124","24.0.0-nightly.20230125","24.0.0-nightly.20230126","24.0.0-nightly.20230127","24.0.0-nightly.20230131","24.0.0-nightly.20230201","24.0.0-nightly.20230202"],"112.0.5615.49":["24.0.0"],"112.0.5615.50":["24.1.0","24.1.1"],"112.0.5615.87":["24.1.2"],"112.0.5615.165":["24.1.3","24.2.0","24.3.0"],"112.0.5615.183":["24.3.1"],"112.0.5615.204":["24.4.0","24.4.1","24.5.0","24.5.1","24.6.0","24.6.1","24.6.2","24.6.3","24.6.4","24.6.5","24.7.0","24.7.1","24.8.0","24.8.1","24.8.2","24.8.3","24.8.4","24.8.5","24.8.6","24.8.7"],"114.0.5694.0":["25.0.0-alpha.1","25.0.0-alpha.2","25.0.0-nightly.20230405","26.0.0-nightly.20230406","26.0.0-nightly.20230407","26.0.0-nightly.20230410","26.0.0-nightly.20230411"],"114.0.5710.0":["25.0.0-alpha.3","25.0.0-alpha.4","26.0.0-nightly.20230413","26.0.0-nightly.20230414","26.0.0-nightly.20230417"],"114.0.5719.0":["25.0.0-alpha.5","25.0.0-alpha.6","25.0.0-beta.1","25.0.0-beta.2","25.0.0-beta.3","26.0.0-nightly.20230421","26.0.0-nightly.20230424","26.0.0-nightly.20230425","26.0.0-nightly.20230426","26.0.0-nightly.20230427","26.0.0-nightly.20230428","26.0.0-nightly.20230501","26.0.0-nightly.20230502","26.0.0-nightly.20230503","26.0.0-nightly.20230504","26.0.0-nightly.20230505","26.0.0-nightly.20230508","26.0.0-nightly.20230509","26.0.0-nightly.20230510"],"114.0.5735.16":["25.0.0-beta.4","25.0.0-beta.5","25.0.0-beta.6","25.0.0-beta.7"],"114.0.5735.35":["25.0.0-beta.8"],"114.0.5735.45":["25.0.0-beta.9","25.0.0","25.0.1"],"113.0.5636.0":["25.0.0-nightly.20230314"],"113.0.5651.0":["25.0.0-nightly.20230315"],"113.0.5653.0":["25.0.0-nightly.20230317"],"113.0.5660.0":["25.0.0-nightly.20230320"],"113.0.5664.0":["25.0.0-nightly.20230321"],"113.0.5666.0":["25.0.0-nightly.20230322"],"113.0.5668.0":["25.0.0-nightly.20230323"],"113.0.5670.0":["25.0.0-nightly.20230324","25.0.0-nightly.20230327","25.0.0-nightly.20230328","25.0.0-nightly.20230329","25.0.0-nightly.20230330"],"114.0.5684.0":["25.0.0-nightly.20230331","25.0.0-nightly.20230403"],"114.0.5692.0":["25.0.0-nightly.20230404"],"114.0.5735.106":["25.1.0","25.1.1"],"114.0.5735.134":["25.2.0"],"114.0.5735.199":["25.3.0"],"114.0.5735.243":["25.3.1"],"114.0.5735.248":["25.3.2","25.4.0"],"114.0.5735.289":["25.5.0","25.6.0","25.7.0","25.8.0","25.8.1","25.8.2","25.8.3","25.8.4","25.9.0"],"116.0.5791.0":["26.0.0-alpha.1","26.0.0-alpha.2","26.0.0-alpha.3","26.0.0-alpha.4","26.0.0-alpha.5","26.0.0-nightly.20230526","26.0.0-nightly.20230529","26.0.0-nightly.20230530","26.0.0-nightly.20230531","27.0.0-nightly.20230601","27.0.0-nightly.20230602","27.0.0-nightly.20230605","27.0.0-nightly.20230606","27.0.0-nightly.20230607","27.0.0-nightly.20230609"],"116.0.5815.0":["26.0.0-alpha.6","27.0.0-nightly.20230612","27.0.0-nightly.20230613"],"116.0.5831.0":["26.0.0-alpha.7","27.0.0-nightly.20230615"],"116.0.5845.0":["26.0.0-alpha.8","26.0.0-beta.1","27.0.0-nightly.20230622","27.0.0-nightly.20230623","27.0.0-nightly.20230626","27.0.0-nightly.20230627","27.0.0-nightly.20230628","27.0.0-nightly.20230629","27.0.0-nightly.20230630"],"116.0.5845.14":["26.0.0-beta.2","26.0.0-beta.3","26.0.0-beta.4","26.0.0-beta.5","26.0.0-beta.6","26.0.0-beta.7"],"116.0.5845.42":["26.0.0-beta.8","26.0.0-beta.9"],"116.0.5845.49":["26.0.0-beta.10","26.0.0-beta.11"],"116.0.5845.62":["26.0.0-beta.12"],"114.0.5708.0":["26.0.0-nightly.20230412"],"114.0.5715.0":["26.0.0-nightly.20230418"],"115.0.5760.0":["26.0.0-nightly.20230511","26.0.0-nightly.20230512","26.0.0-nightly.20230515","26.0.0-nightly.20230516","26.0.0-nightly.20230517","26.0.0-nightly.20230518","26.0.0-nightly.20230519","26.0.0-nightly.20230522","26.0.0-nightly.20230523"],"115.0.5786.0":["26.0.0-nightly.20230524"],"115.0.5790.0":["26.0.0-nightly.20230525"],"116.0.5845.82":["26.0.0"],"116.0.5845.97":["26.1.0"],"116.0.5845.179":["26.2.0"],"116.0.5845.188":["26.2.1"],"116.0.5845.190":["26.2.2","26.2.3","26.2.4"],"116.0.5845.228":["26.3.0"],"118.0.5949.0":["27.0.0-alpha.1","27.0.0-alpha.2","27.0.0-alpha.3","27.0.0-alpha.4","27.0.0-alpha.5","27.0.0-alpha.6","27.0.0-nightly.20230816","28.0.0-nightly.20230817","28.0.0-nightly.20230818","28.0.0-nightly.20230821","28.0.0-nightly.20230822","28.0.0-nightly.20230823","28.0.0-nightly.20230824","28.0.0-nightly.20230825","28.0.0-nightly.20230828","28.0.0-nightly.20230829","28.0.0-nightly.20230830","28.0.0-nightly.20230831"],"118.0.5993.5":["27.0.0-beta.1","27.0.0-beta.2","27.0.0-beta.3"],"118.0.5993.11":["27.0.0-beta.4"],"118.0.5993.18":["27.0.0-beta.5","27.0.0-beta.6","27.0.0-beta.7","27.0.0-beta.8","27.0.0-beta.9"],"116.0.5829.0":["27.0.0-nightly.20230614"],"116.0.5833.0":["27.0.0-nightly.20230616","27.0.0-nightly.20230619","27.0.0-nightly.20230620","27.0.0-nightly.20230621"],"117.0.5852.0":["27.0.0-nightly.20230703","27.0.0-nightly.20230704","27.0.0-nightly.20230705","27.0.0-nightly.20230706","27.0.0-nightly.20230707","27.0.0-nightly.20230710","27.0.0-nightly.20230711","27.0.0-nightly.20230712","27.0.0-nightly.20230713","27.0.0-nightly.20230714"],"117.0.5884.1":["27.0.0-nightly.20230717","27.0.0-nightly.20230718"],"117.0.5892.0":["27.0.0-nightly.20230719"],"117.0.5897.0":["27.0.0-nightly.20230720","27.0.0-nightly.20230721","27.0.0-nightly.20230724","27.0.0-nightly.20230725","27.0.0-nightly.20230726","27.0.0-nightly.20230727","27.0.0-nightly.20230728","27.0.0-nightly.20230731"],"117.0.5911.0":["27.0.0-nightly.20230801","27.0.0-nightly.20230802","27.0.0-nightly.20230803"],"117.0.5921.0":["27.0.0-nightly.20230804","27.0.0-nightly.20230807","27.0.0-nightly.20230808","27.0.0-nightly.20230814","27.0.0-nightly.20230815"],"118.0.5993.54":["27.0.0"],"118.0.5991.0":["28.0.0-nightly.20230906"],"118.0.5993.0":["28.0.0-nightly.20230907","28.0.0-nightly.20230908","28.0.0-nightly.20230911","28.0.0-nightly.20230912","28.0.0-nightly.20230913","28.0.0-nightly.20230914","28.0.0-nightly.20230915"],"119.0.6006.0":["28.0.0-nightly.20230919"],"119.0.6017.0":["28.0.0-nightly.20230920"],"119.0.6019.2":["28.0.0-nightly.20230921","28.0.0-nightly.20230925","28.0.0-nightly.20230926","28.0.0-nightly.20230927","28.0.0-nightly.20230928"],"119.0.6029.0":["28.0.0-nightly.20230929","28.0.0-nightly.20231002"],"119.0.6043.0":["28.0.0-nightly.20231003","28.0.0-nightly.20231004","28.0.0-nightly.20231005"],"119.0.6045.0":["28.0.0-nightly.20231006","28.0.0-nightly.20231009","28.0.0-nightly.20231010"]}
\ No newline at end of file
diff --git a/tools/node_modules/eslint/node_modules/electron-to-chromium/full-versions.js b/tools/node_modules/eslint/node_modules/electron-to-chromium/full-versions.js
index b898a4023cc7fc..04e5b3066cbf2d 100644
--- a/tools/node_modules/eslint/node_modules/electron-to-chromium/full-versions.js
+++ b/tools/node_modules/eslint/node_modules/electron-to-chromium/full-versions.js
@@ -1688,6 +1688,10 @@ module.exports = {
 	"22.3.21": "108.0.5359.215",
 	"22.3.22": "108.0.5359.215",
 	"22.3.23": "108.0.5359.215",
+	"22.3.24": "108.0.5359.215",
+	"22.3.25": "108.0.5359.215",
+	"22.3.26": "108.0.5359.215",
+	"22.3.27": "108.0.5359.215",
 	"23.0.0-alpha.1": "110.0.5415.0",
 	"23.0.0-alpha.2": "110.0.5451.0",
 	"23.0.0-alpha.3": "110.0.5451.0",
@@ -1837,6 +1841,11 @@ module.exports = {
 	"24.8.0": "112.0.5615.204",
 	"24.8.1": "112.0.5615.204",
 	"24.8.2": "112.0.5615.204",
+	"24.8.3": "112.0.5615.204",
+	"24.8.4": "112.0.5615.204",
+	"24.8.5": "112.0.5615.204",
+	"24.8.6": "112.0.5615.204",
+	"24.8.7": "112.0.5615.204",
 	"25.0.0-alpha.1": "114.0.5694.0",
 	"25.0.0-alpha.2": "114.0.5694.0",
 	"25.0.0-alpha.3": "114.0.5710.0",
@@ -1901,6 +1910,11 @@ module.exports = {
 	"25.6.0": "114.0.5735.289",
 	"25.7.0": "114.0.5735.289",
 	"25.8.0": "114.0.5735.289",
+	"25.8.1": "114.0.5735.289",
+	"25.8.2": "114.0.5735.289",
+	"25.8.3": "114.0.5735.289",
+	"25.8.4": "114.0.5735.289",
+	"25.9.0": "114.0.5735.289",
 	"26.0.0-alpha.1": "116.0.5791.0",
 	"26.0.0-alpha.2": "116.0.5791.0",
 	"26.0.0-alpha.3": "116.0.5791.0",
@@ -1962,12 +1976,26 @@ module.exports = {
 	"26.0.0": "116.0.5845.82",
 	"26.1.0": "116.0.5845.97",
 	"26.2.0": "116.0.5845.179",
+	"26.2.1": "116.0.5845.188",
+	"26.2.2": "116.0.5845.190",
+	"26.2.3": "116.0.5845.190",
+	"26.2.4": "116.0.5845.190",
+	"26.3.0": "116.0.5845.228",
 	"27.0.0-alpha.1": "118.0.5949.0",
 	"27.0.0-alpha.2": "118.0.5949.0",
 	"27.0.0-alpha.3": "118.0.5949.0",
 	"27.0.0-alpha.4": "118.0.5949.0",
 	"27.0.0-alpha.5": "118.0.5949.0",
 	"27.0.0-alpha.6": "118.0.5949.0",
+	"27.0.0-beta.1": "118.0.5993.5",
+	"27.0.0-beta.2": "118.0.5993.5",
+	"27.0.0-beta.3": "118.0.5993.5",
+	"27.0.0-beta.4": "118.0.5993.11",
+	"27.0.0-beta.5": "118.0.5993.18",
+	"27.0.0-beta.6": "118.0.5993.18",
+	"27.0.0-beta.7": "118.0.5993.18",
+	"27.0.0-beta.8": "118.0.5993.18",
+	"27.0.0-beta.9": "118.0.5993.18",
 	"27.0.0-nightly.20230601": "116.0.5791.0",
 	"27.0.0-nightly.20230602": "116.0.5791.0",
 	"27.0.0-nightly.20230605": "116.0.5791.0",
@@ -2019,6 +2047,7 @@ module.exports = {
 	"27.0.0-nightly.20230814": "117.0.5921.0",
 	"27.0.0-nightly.20230815": "117.0.5921.0",
 	"27.0.0-nightly.20230816": "118.0.5949.0",
+	"27.0.0": "118.0.5993.54",
 	"28.0.0-nightly.20230817": "118.0.5949.0",
 	"28.0.0-nightly.20230818": "118.0.5949.0",
 	"28.0.0-nightly.20230821": "118.0.5949.0",
@@ -2032,5 +2061,25 @@ module.exports = {
 	"28.0.0-nightly.20230831": "118.0.5949.0",
 	"28.0.0-nightly.20230906": "118.0.5991.0",
 	"28.0.0-nightly.20230907": "118.0.5993.0",
-	"28.0.0-nightly.20230908": "118.0.5993.0"
+	"28.0.0-nightly.20230908": "118.0.5993.0",
+	"28.0.0-nightly.20230911": "118.0.5993.0",
+	"28.0.0-nightly.20230912": "118.0.5993.0",
+	"28.0.0-nightly.20230913": "118.0.5993.0",
+	"28.0.0-nightly.20230914": "118.0.5993.0",
+	"28.0.0-nightly.20230915": "118.0.5993.0",
+	"28.0.0-nightly.20230919": "119.0.6006.0",
+	"28.0.0-nightly.20230920": "119.0.6017.0",
+	"28.0.0-nightly.20230921": "119.0.6019.2",
+	"28.0.0-nightly.20230925": "119.0.6019.2",
+	"28.0.0-nightly.20230926": "119.0.6019.2",
+	"28.0.0-nightly.20230927": "119.0.6019.2",
+	"28.0.0-nightly.20230928": "119.0.6019.2",
+	"28.0.0-nightly.20230929": "119.0.6029.0",
+	"28.0.0-nightly.20231002": "119.0.6029.0",
+	"28.0.0-nightly.20231003": "119.0.6043.0",
+	"28.0.0-nightly.20231004": "119.0.6043.0",
+	"28.0.0-nightly.20231005": "119.0.6043.0",
+	"28.0.0-nightly.20231006": "119.0.6045.0",
+	"28.0.0-nightly.20231009": "119.0.6045.0",
+	"28.0.0-nightly.20231010": "119.0.6045.0"
 };
\ No newline at end of file
diff --git a/tools/node_modules/eslint/node_modules/electron-to-chromium/full-versions.json b/tools/node_modules/eslint/node_modules/electron-to-chromium/full-versions.json
index 0eec59c6e002ab..8ab3c302f7726b 100644
--- a/tools/node_modules/eslint/node_modules/electron-to-chromium/full-versions.json
+++ b/tools/node_modules/eslint/node_modules/electron-to-chromium/full-versions.json
@@ -1 +1 @@
-{"0.20.0":"39.0.2171.65","0.20.1":"39.0.2171.65","0.20.2":"39.0.2171.65","0.20.3":"39.0.2171.65","0.20.4":"39.0.2171.65","0.20.5":"39.0.2171.65","0.20.6":"39.0.2171.65","0.20.7":"39.0.2171.65","0.20.8":"39.0.2171.65","0.21.0":"40.0.2214.91","0.21.1":"40.0.2214.91","0.21.2":"40.0.2214.91","0.21.3":"41.0.2272.76","0.22.1":"41.0.2272.76","0.22.2":"41.0.2272.76","0.22.3":"41.0.2272.76","0.23.0":"41.0.2272.76","0.24.0":"41.0.2272.76","0.25.0":"42.0.2311.107","0.25.1":"42.0.2311.107","0.25.2":"42.0.2311.107","0.25.3":"42.0.2311.107","0.26.0":"42.0.2311.107","0.26.1":"42.0.2311.107","0.27.0":"42.0.2311.107","0.27.1":"42.0.2311.107","0.27.2":"43.0.2357.65","0.27.3":"43.0.2357.65","0.28.0":"43.0.2357.65","0.28.1":"43.0.2357.65","0.28.2":"43.0.2357.65","0.28.3":"43.0.2357.65","0.29.1":"43.0.2357.65","0.29.2":"43.0.2357.65","0.30.4":"44.0.2403.125","0.31.0":"44.0.2403.125","0.31.2":"45.0.2454.85","0.32.2":"45.0.2454.85","0.32.3":"45.0.2454.85","0.33.0":"45.0.2454.85","0.33.1":"45.0.2454.85","0.33.2":"45.0.2454.85","0.33.3":"45.0.2454.85","0.33.4":"45.0.2454.85","0.33.6":"45.0.2454.85","0.33.7":"45.0.2454.85","0.33.8":"45.0.2454.85","0.33.9":"45.0.2454.85","0.34.0":"45.0.2454.85","0.34.1":"45.0.2454.85","0.34.2":"45.0.2454.85","0.34.3":"45.0.2454.85","0.34.4":"45.0.2454.85","0.35.1":"45.0.2454.85","0.35.2":"45.0.2454.85","0.35.3":"45.0.2454.85","0.35.4":"45.0.2454.85","0.35.5":"45.0.2454.85","0.36.0":"47.0.2526.73","0.36.2":"47.0.2526.73","0.36.3":"47.0.2526.73","0.36.4":"47.0.2526.73","0.36.5":"47.0.2526.110","0.36.6":"47.0.2526.110","0.36.7":"47.0.2526.110","0.36.8":"47.0.2526.110","0.36.9":"47.0.2526.110","0.36.10":"47.0.2526.110","0.36.11":"47.0.2526.110","0.36.12":"47.0.2526.110","0.37.0":"49.0.2623.75","0.37.1":"49.0.2623.75","0.37.3":"49.0.2623.75","0.37.4":"49.0.2623.75","0.37.5":"49.0.2623.75","0.37.6":"49.0.2623.75","0.37.7":"49.0.2623.75","0.37.8":"49.0.2623.75","1.0.0":"49.0.2623.75","1.0.1":"49.0.2623.75","1.0.2":"49.0.2623.75","1.1.0":"50.0.2661.102","1.1.1":"50.0.2661.102","1.1.2":"50.0.2661.102","1.1.3":"50.0.2661.102","1.2.0":"51.0.2704.63","1.2.1":"51.0.2704.63","1.2.2":"51.0.2704.84","1.2.3":"51.0.2704.84","1.2.4":"51.0.2704.103","1.2.5":"51.0.2704.103","1.2.6":"51.0.2704.106","1.2.7":"51.0.2704.106","1.2.8":"51.0.2704.106","1.3.0":"52.0.2743.82","1.3.1":"52.0.2743.82","1.3.2":"52.0.2743.82","1.3.3":"52.0.2743.82","1.3.4":"52.0.2743.82","1.3.5":"52.0.2743.82","1.3.6":"52.0.2743.82","1.3.7":"52.0.2743.82","1.3.9":"52.0.2743.82","1.3.10":"52.0.2743.82","1.3.13":"52.0.2743.82","1.3.14":"52.0.2743.82","1.3.15":"52.0.2743.82","1.4.0":"53.0.2785.113","1.4.1":"53.0.2785.113","1.4.2":"53.0.2785.113","1.4.3":"53.0.2785.113","1.4.4":"53.0.2785.113","1.4.5":"53.0.2785.113","1.4.6":"53.0.2785.143","1.4.7":"53.0.2785.143","1.4.8":"53.0.2785.143","1.4.10":"53.0.2785.143","1.4.11":"53.0.2785.143","1.4.12":"54.0.2840.51","1.4.13":"53.0.2785.143","1.4.14":"53.0.2785.143","1.4.15":"53.0.2785.143","1.4.16":"53.0.2785.143","1.5.0":"54.0.2840.101","1.5.1":"54.0.2840.101","1.6.0":"56.0.2924.87","1.6.1":"56.0.2924.87","1.6.2":"56.0.2924.87","1.6.3":"56.0.2924.87","1.6.4":"56.0.2924.87","1.6.5":"56.0.2924.87","1.6.6":"56.0.2924.87","1.6.7":"56.0.2924.87","1.6.8":"56.0.2924.87","1.6.9":"56.0.2924.87","1.6.10":"56.0.2924.87","1.6.11":"56.0.2924.87","1.6.12":"56.0.2924.87","1.6.13":"56.0.2924.87","1.6.14":"56.0.2924.87","1.6.15":"56.0.2924.87","1.6.16":"56.0.2924.87","1.6.17":"56.0.2924.87","1.6.18":"56.0.2924.87","1.7.0":"58.0.3029.110","1.7.1":"58.0.3029.110","1.7.2":"58.0.3029.110","1.7.3":"58.0.3029.110","1.7.4":"58.0.3029.110","1.7.5":"58.0.3029.110","1.7.6":"58.0.3029.110","1.7.7":"58.0.3029.110","1.7.8":"58.0.3029.110","1.7.9":"58.0.3029.110","1.7.10":"58.0.3029.110","1.7.11":"58.0.3029.110","1.7.12":"58.0.3029.110","1.7.13":"58.0.3029.110","1.7.14":"58.0.3029.110","1.7.15":"58.0.3029.110","1.7.16":"58.0.3029.110","1.8.0":"59.0.3071.115","1.8.1":"59.0.3071.115","1.8.2-beta.1":"59.0.3071.115","1.8.2-beta.2":"59.0.3071.115","1.8.2-beta.3":"59.0.3071.115","1.8.2-beta.4":"59.0.3071.115","1.8.2-beta.5":"59.0.3071.115","1.8.2":"59.0.3071.115","1.8.3":"59.0.3071.115","1.8.4":"59.0.3071.115","1.8.5":"59.0.3071.115","1.8.6":"59.0.3071.115","1.8.7":"59.0.3071.115","1.8.8":"59.0.3071.115","2.0.0-beta.1":"61.0.3163.100","2.0.0-beta.2":"61.0.3163.100","2.0.0-beta.3":"61.0.3163.100","2.0.0-beta.4":"61.0.3163.100","2.0.0-beta.5":"61.0.3163.100","2.0.0-beta.6":"61.0.3163.100","2.0.0-beta.7":"61.0.3163.100","2.0.0-beta.8":"61.0.3163.100","2.0.0":"61.0.3163.100","2.0.1":"61.0.3163.100","2.0.2":"61.0.3163.100","2.0.3":"61.0.3163.100","2.0.4":"61.0.3163.100","2.0.5":"61.0.3163.100","2.0.6":"61.0.3163.100","2.0.7":"61.0.3163.100","2.0.8-nightly.20180819":"61.0.3163.100","2.0.8-nightly.20180820":"61.0.3163.100","2.0.8":"61.0.3163.100","2.0.9":"61.0.3163.100","2.0.10":"61.0.3163.100","2.0.11":"61.0.3163.100","2.0.12":"61.0.3163.100","2.0.13":"61.0.3163.100","2.0.14":"61.0.3163.100","2.0.15":"61.0.3163.100","2.0.16":"61.0.3163.100","2.0.17":"61.0.3163.100","2.0.18":"61.0.3163.100","2.1.0-unsupported.20180809":"61.0.3163.100","3.0.0-beta.1":"66.0.3359.181","3.0.0-beta.2":"66.0.3359.181","3.0.0-beta.3":"66.0.3359.181","3.0.0-beta.4":"66.0.3359.181","3.0.0-beta.5":"66.0.3359.181","3.0.0-beta.6":"66.0.3359.181","3.0.0-beta.7":"66.0.3359.181","3.0.0-beta.8":"66.0.3359.181","3.0.0-beta.9":"66.0.3359.181","3.0.0-beta.10":"66.0.3359.181","3.0.0-beta.11":"66.0.3359.181","3.0.0-beta.12":"66.0.3359.181","3.0.0-beta.13":"66.0.3359.181","3.0.0-nightly.20180818":"66.0.3359.181","3.0.0-nightly.20180821":"66.0.3359.181","3.0.0-nightly.20180823":"66.0.3359.181","3.0.0-nightly.20180904":"66.0.3359.181","3.0.0":"66.0.3359.181","3.0.1":"66.0.3359.181","3.0.2":"66.0.3359.181","3.0.3":"66.0.3359.181","3.0.4":"66.0.3359.181","3.0.5":"66.0.3359.181","3.0.6":"66.0.3359.181","3.0.7":"66.0.3359.181","3.0.8":"66.0.3359.181","3.0.9":"66.0.3359.181","3.0.10":"66.0.3359.181","3.0.11":"66.0.3359.181","3.0.12":"66.0.3359.181","3.0.13":"66.0.3359.181","3.0.14":"66.0.3359.181","3.0.15":"66.0.3359.181","3.0.16":"66.0.3359.181","3.1.0-beta.1":"66.0.3359.181","3.1.0-beta.2":"66.0.3359.181","3.1.0-beta.3":"66.0.3359.181","3.1.0-beta.4":"66.0.3359.181","3.1.0-beta.5":"66.0.3359.181","3.1.0":"66.0.3359.181","3.1.1":"66.0.3359.181","3.1.2":"66.0.3359.181","3.1.3":"66.0.3359.181","3.1.4":"66.0.3359.181","3.1.5":"66.0.3359.181","3.1.6":"66.0.3359.181","3.1.7":"66.0.3359.181","3.1.8":"66.0.3359.181","3.1.9":"66.0.3359.181","3.1.10":"66.0.3359.181","3.1.11":"66.0.3359.181","3.1.12":"66.0.3359.181","3.1.13":"66.0.3359.181","4.0.0-beta.1":"69.0.3497.106","4.0.0-beta.2":"69.0.3497.106","4.0.0-beta.3":"69.0.3497.106","4.0.0-beta.4":"69.0.3497.106","4.0.0-beta.5":"69.0.3497.106","4.0.0-beta.6":"69.0.3497.106","4.0.0-beta.7":"69.0.3497.106","4.0.0-beta.8":"69.0.3497.106","4.0.0-beta.9":"69.0.3497.106","4.0.0-beta.10":"69.0.3497.106","4.0.0-beta.11":"69.0.3497.106","4.0.0-nightly.20180817":"66.0.3359.181","4.0.0-nightly.20180819":"66.0.3359.181","4.0.0-nightly.20180821":"66.0.3359.181","4.0.0-nightly.20180929":"67.0.3396.99","4.0.0-nightly.20181006":"68.0.3440.128","4.0.0-nightly.20181010":"69.0.3497.106","4.0.0":"69.0.3497.106","4.0.1":"69.0.3497.106","4.0.2":"69.0.3497.106","4.0.3":"69.0.3497.106","4.0.4":"69.0.3497.106","4.0.5":"69.0.3497.106","4.0.6":"69.0.3497.106","4.0.7":"69.0.3497.128","4.0.8":"69.0.3497.128","4.1.0":"69.0.3497.128","4.1.1":"69.0.3497.128","4.1.2":"69.0.3497.128","4.1.3":"69.0.3497.128","4.1.4":"69.0.3497.128","4.1.5":"69.0.3497.128","4.2.0":"69.0.3497.128","4.2.1":"69.0.3497.128","4.2.2":"69.0.3497.128","4.2.3":"69.0.3497.128","4.2.4":"69.0.3497.128","4.2.5":"69.0.3497.128","4.2.6":"69.0.3497.128","4.2.7":"69.0.3497.128","4.2.8":"69.0.3497.128","4.2.9":"69.0.3497.128","4.2.10":"69.0.3497.128","4.2.11":"69.0.3497.128","4.2.12":"69.0.3497.128","5.0.0-beta.1":"72.0.3626.52","5.0.0-beta.2":"72.0.3626.52","5.0.0-beta.3":"73.0.3683.27","5.0.0-beta.4":"73.0.3683.54","5.0.0-beta.5":"73.0.3683.61","5.0.0-beta.6":"73.0.3683.84","5.0.0-beta.7":"73.0.3683.94","5.0.0-beta.8":"73.0.3683.104","5.0.0-beta.9":"73.0.3683.117","5.0.0-nightly.20190107":"70.0.3538.110","5.0.0-nightly.20190121":"71.0.3578.98","5.0.0-nightly.20190122":"71.0.3578.98","5.0.0":"73.0.3683.119","5.0.1":"73.0.3683.121","5.0.2":"73.0.3683.121","5.0.3":"73.0.3683.121","5.0.4":"73.0.3683.121","5.0.5":"73.0.3683.121","5.0.6":"73.0.3683.121","5.0.7":"73.0.3683.121","5.0.8":"73.0.3683.121","5.0.9":"73.0.3683.121","5.0.10":"73.0.3683.121","5.0.11":"73.0.3683.121","5.0.12":"73.0.3683.121","5.0.13":"73.0.3683.121","6.0.0-beta.1":"76.0.3774.1","6.0.0-beta.2":"76.0.3783.1","6.0.0-beta.3":"76.0.3783.1","6.0.0-beta.4":"76.0.3783.1","6.0.0-beta.5":"76.0.3805.4","6.0.0-beta.6":"76.0.3809.3","6.0.0-beta.7":"76.0.3809.22","6.0.0-beta.8":"76.0.3809.26","6.0.0-beta.9":"76.0.3809.26","6.0.0-beta.10":"76.0.3809.37","6.0.0-beta.11":"76.0.3809.42","6.0.0-beta.12":"76.0.3809.54","6.0.0-beta.13":"76.0.3809.60","6.0.0-beta.14":"76.0.3809.68","6.0.0-beta.15":"76.0.3809.74","6.0.0-nightly.20190123":"72.0.3626.52","6.0.0-nightly.20190212":"72.0.3626.107","6.0.0-nightly.20190213":"72.0.3626.110","6.0.0-nightly.20190311":"74.0.3724.8","6.0.0":"76.0.3809.88","6.0.1":"76.0.3809.102","6.0.2":"76.0.3809.110","6.0.3":"76.0.3809.126","6.0.4":"76.0.3809.131","6.0.5":"76.0.3809.136","6.0.6":"76.0.3809.138","6.0.7":"76.0.3809.139","6.0.8":"76.0.3809.146","6.0.9":"76.0.3809.146","6.0.10":"76.0.3809.146","6.0.11":"76.0.3809.146","6.0.12":"76.0.3809.146","6.1.0":"76.0.3809.146","6.1.1":"76.0.3809.146","6.1.2":"76.0.3809.146","6.1.3":"76.0.3809.146","6.1.4":"76.0.3809.146","6.1.5":"76.0.3809.146","6.1.6":"76.0.3809.146","6.1.7":"76.0.3809.146","6.1.8":"76.0.3809.146","6.1.9":"76.0.3809.146","6.1.10":"76.0.3809.146","6.1.11":"76.0.3809.146","6.1.12":"76.0.3809.146","7.0.0-beta.1":"78.0.3866.0","7.0.0-beta.2":"78.0.3866.0","7.0.0-beta.3":"78.0.3866.0","7.0.0-beta.4":"78.0.3896.6","7.0.0-beta.5":"78.0.3905.1","7.0.0-beta.6":"78.0.3905.1","7.0.0-beta.7":"78.0.3905.1","7.0.0-nightly.20190521":"76.0.3784.0","7.0.0-nightly.20190529":"76.0.3806.0","7.0.0-nightly.20190530":"76.0.3806.0","7.0.0-nightly.20190531":"76.0.3806.0","7.0.0-nightly.20190602":"76.0.3806.0","7.0.0-nightly.20190603":"76.0.3806.0","7.0.0-nightly.20190604":"77.0.3814.0","7.0.0-nightly.20190605":"77.0.3815.0","7.0.0-nightly.20190606":"77.0.3815.0","7.0.0-nightly.20190607":"77.0.3815.0","7.0.0-nightly.20190608":"77.0.3815.0","7.0.0-nightly.20190609":"77.0.3815.0","7.0.0-nightly.20190611":"77.0.3815.0","7.0.0-nightly.20190612":"77.0.3815.0","7.0.0-nightly.20190613":"77.0.3815.0","7.0.0-nightly.20190615":"77.0.3815.0","7.0.0-nightly.20190616":"77.0.3815.0","7.0.0-nightly.20190618":"77.0.3815.0","7.0.0-nightly.20190619":"77.0.3815.0","7.0.0-nightly.20190622":"77.0.3815.0","7.0.0-nightly.20190623":"77.0.3815.0","7.0.0-nightly.20190624":"77.0.3815.0","7.0.0-nightly.20190627":"77.0.3815.0","7.0.0-nightly.20190629":"77.0.3815.0","7.0.0-nightly.20190630":"77.0.3815.0","7.0.0-nightly.20190701":"77.0.3815.0","7.0.0-nightly.20190702":"77.0.3815.0","7.0.0-nightly.20190704":"77.0.3843.0","7.0.0-nightly.20190705":"77.0.3843.0","7.0.0-nightly.20190719":"77.0.3848.0","7.0.0-nightly.20190720":"77.0.3848.0","7.0.0-nightly.20190721":"77.0.3848.0","7.0.0-nightly.20190726":"77.0.3864.0","7.0.0-nightly.20190727":"78.0.3866.0","7.0.0-nightly.20190728":"78.0.3866.0","7.0.0-nightly.20190729":"78.0.3866.0","7.0.0-nightly.20190730":"78.0.3866.0","7.0.0-nightly.20190731":"78.0.3866.0","7.0.0":"78.0.3905.1","7.0.1":"78.0.3904.92","7.1.0":"78.0.3904.94","7.1.1":"78.0.3904.99","7.1.2":"78.0.3904.113","7.1.3":"78.0.3904.126","7.1.4":"78.0.3904.130","7.1.5":"78.0.3904.130","7.1.6":"78.0.3904.130","7.1.7":"78.0.3904.130","7.1.8":"78.0.3904.130","7.1.9":"78.0.3904.130","7.1.10":"78.0.3904.130","7.1.11":"78.0.3904.130","7.1.12":"78.0.3904.130","7.1.13":"78.0.3904.130","7.1.14":"78.0.3904.130","7.2.0":"78.0.3904.130","7.2.1":"78.0.3904.130","7.2.2":"78.0.3904.130","7.2.3":"78.0.3904.130","7.2.4":"78.0.3904.130","7.3.0":"78.0.3904.130","7.3.1":"78.0.3904.130","7.3.2":"78.0.3904.130","7.3.3":"78.0.3904.130","8.0.0-beta.1":"79.0.3931.0","8.0.0-beta.2":"79.0.3931.0","8.0.0-beta.3":"80.0.3955.0","8.0.0-beta.4":"80.0.3955.0","8.0.0-beta.5":"80.0.3987.14","8.0.0-beta.6":"80.0.3987.51","8.0.0-beta.7":"80.0.3987.59","8.0.0-beta.8":"80.0.3987.75","8.0.0-beta.9":"80.0.3987.75","8.0.0-nightly.20190801":"78.0.3866.0","8.0.0-nightly.20190802":"78.0.3866.0","8.0.0-nightly.20190803":"78.0.3871.0","8.0.0-nightly.20190806":"78.0.3871.0","8.0.0-nightly.20190807":"78.0.3871.0","8.0.0-nightly.20190808":"78.0.3871.0","8.0.0-nightly.20190809":"78.0.3871.0","8.0.0-nightly.20190810":"78.0.3871.0","8.0.0-nightly.20190811":"78.0.3871.0","8.0.0-nightly.20190812":"78.0.3871.0","8.0.0-nightly.20190813":"78.0.3871.0","8.0.0-nightly.20190814":"78.0.3871.0","8.0.0-nightly.20190815":"78.0.3871.0","8.0.0-nightly.20190816":"78.0.3881.0","8.0.0-nightly.20190817":"78.0.3881.0","8.0.0-nightly.20190818":"78.0.3881.0","8.0.0-nightly.20190819":"78.0.3881.0","8.0.0-nightly.20190820":"78.0.3881.0","8.0.0-nightly.20190824":"78.0.3892.0","8.0.0-nightly.20190825":"78.0.3892.0","8.0.0-nightly.20190827":"78.0.3892.0","8.0.0-nightly.20190828":"78.0.3892.0","8.0.0-nightly.20190830":"78.0.3892.0","8.0.0-nightly.20190901":"78.0.3892.0","8.0.0-nightly.20190902":"78.0.3892.0","8.0.0-nightly.20190907":"78.0.3892.0","8.0.0-nightly.20190909":"78.0.3892.0","8.0.0-nightly.20190910":"78.0.3892.0","8.0.0-nightly.20190911":"78.0.3892.0","8.0.0-nightly.20190912":"78.0.3892.0","8.0.0-nightly.20190913":"78.0.3892.0","8.0.0-nightly.20190914":"78.0.3892.0","8.0.0-nightly.20190915":"78.0.3892.0","8.0.0-nightly.20190917":"78.0.3892.0","8.0.0-nightly.20190919":"79.0.3915.0","8.0.0-nightly.20190920":"79.0.3915.0","8.0.0-nightly.20190922":"79.0.3919.0","8.0.0-nightly.20190923":"79.0.3919.0","8.0.0-nightly.20190924":"79.0.3919.0","8.0.0-nightly.20190926":"79.0.3919.0","8.0.0-nightly.20190928":"79.0.3919.0","8.0.0-nightly.20190929":"79.0.3919.0","8.0.0-nightly.20190930":"79.0.3919.0","8.0.0-nightly.20191001":"79.0.3919.0","8.0.0-nightly.20191004":"79.0.3919.0","8.0.0-nightly.20191005":"79.0.3919.0","8.0.0-nightly.20191006":"79.0.3919.0","8.0.0-nightly.20191009":"79.0.3919.0","8.0.0-nightly.20191011":"79.0.3919.0","8.0.0-nightly.20191012":"79.0.3919.0","8.0.0-nightly.20191017":"79.0.3919.0","8.0.0-nightly.20191019":"79.0.3931.0","8.0.0-nightly.20191020":"79.0.3931.0","8.0.0-nightly.20191021":"79.0.3931.0","8.0.0-nightly.20191023":"79.0.3931.0","8.0.0-nightly.20191101":"80.0.3952.0","8.0.0-nightly.20191103":"80.0.3952.0","8.0.0-nightly.20191105":"80.0.3952.0","8.0.0":"80.0.3987.86","8.0.1":"80.0.3987.86","8.0.2":"80.0.3987.86","8.0.3":"80.0.3987.134","8.1.0":"80.0.3987.137","8.1.1":"80.0.3987.141","8.2.0":"80.0.3987.158","8.2.1":"80.0.3987.163","8.2.2":"80.0.3987.163","8.2.3":"80.0.3987.163","8.2.4":"80.0.3987.165","8.2.5":"80.0.3987.165","8.3.0":"80.0.3987.165","8.3.1":"80.0.3987.165","8.3.2":"80.0.3987.165","8.3.3":"80.0.3987.165","8.3.4":"80.0.3987.165","8.4.0":"80.0.3987.165","8.4.1":"80.0.3987.165","8.5.0":"80.0.3987.165","8.5.1":"80.0.3987.165","8.5.2":"80.0.3987.165","8.5.3":"80.0.3987.163","8.5.4":"80.0.3987.163","8.5.5":"80.0.3987.163","9.0.0-beta.1":"82.0.4048.0","9.0.0-beta.2":"82.0.4048.0","9.0.0-beta.3":"82.0.4048.0","9.0.0-beta.4":"82.0.4048.0","9.0.0-beta.5":"82.0.4048.0","9.0.0-beta.6":"82.0.4058.2","9.0.0-beta.7":"82.0.4058.2","9.0.0-beta.9":"82.0.4058.2","9.0.0-beta.10":"82.0.4085.10","9.0.0-beta.11":"82.0.4085.14","9.0.0-beta.12":"82.0.4085.14","9.0.0-beta.13":"82.0.4085.14","9.0.0-beta.14":"82.0.4085.27","9.0.0-beta.15":"83.0.4102.3","9.0.0-beta.16":"83.0.4102.3","9.0.0-beta.17":"83.0.4103.14","9.0.0-beta.18":"83.0.4103.16","9.0.0-beta.19":"83.0.4103.24","9.0.0-beta.20":"83.0.4103.26","9.0.0-beta.21":"83.0.4103.26","9.0.0-beta.22":"83.0.4103.34","9.0.0-beta.23":"83.0.4103.44","9.0.0-beta.24":"83.0.4103.45","9.0.0-nightly.20191121":"80.0.3954.0","9.0.0-nightly.20191122":"80.0.3954.0","9.0.0-nightly.20191123":"80.0.3954.0","9.0.0-nightly.20191124":"80.0.3954.0","9.0.0-nightly.20191126":"80.0.3954.0","9.0.0-nightly.20191128":"80.0.3954.0","9.0.0-nightly.20191129":"80.0.3954.0","9.0.0-nightly.20191130":"80.0.3954.0","9.0.0-nightly.20191201":"80.0.3954.0","9.0.0-nightly.20191202":"80.0.3954.0","9.0.0-nightly.20191203":"80.0.3954.0","9.0.0-nightly.20191204":"80.0.3954.0","9.0.0-nightly.20191205":"80.0.3954.0","9.0.0-nightly.20191210":"80.0.3954.0","9.0.0-nightly.20191220":"81.0.3994.0","9.0.0-nightly.20191221":"81.0.3994.0","9.0.0-nightly.20191222":"81.0.3994.0","9.0.0-nightly.20191223":"81.0.3994.0","9.0.0-nightly.20191224":"81.0.3994.0","9.0.0-nightly.20191225":"81.0.3994.0","9.0.0-nightly.20191226":"81.0.3994.0","9.0.0-nightly.20191228":"81.0.3994.0","9.0.0-nightly.20191229":"81.0.3994.0","9.0.0-nightly.20191230":"81.0.3994.0","9.0.0-nightly.20191231":"81.0.3994.0","9.0.0-nightly.20200101":"81.0.3994.0","9.0.0-nightly.20200103":"81.0.3994.0","9.0.0-nightly.20200104":"81.0.3994.0","9.0.0-nightly.20200105":"81.0.3994.0","9.0.0-nightly.20200106":"81.0.3994.0","9.0.0-nightly.20200108":"81.0.3994.0","9.0.0-nightly.20200109":"81.0.3994.0","9.0.0-nightly.20200110":"81.0.3994.0","9.0.0-nightly.20200111":"81.0.3994.0","9.0.0-nightly.20200113":"81.0.3994.0","9.0.0-nightly.20200115":"81.0.3994.0","9.0.0-nightly.20200116":"81.0.3994.0","9.0.0-nightly.20200117":"81.0.3994.0","9.0.0-nightly.20200119":"81.0.4030.0","9.0.0-nightly.20200121":"81.0.4030.0","9.0.0":"83.0.4103.64","9.0.1":"83.0.4103.94","9.0.2":"83.0.4103.94","9.0.3":"83.0.4103.100","9.0.4":"83.0.4103.104","9.0.5":"83.0.4103.119","9.1.0":"83.0.4103.122","9.1.1":"83.0.4103.122","9.1.2":"83.0.4103.122","9.2.0":"83.0.4103.122","9.2.1":"83.0.4103.122","9.3.0":"83.0.4103.122","9.3.1":"83.0.4103.122","9.3.2":"83.0.4103.122","9.3.3":"83.0.4103.122","9.3.4":"83.0.4103.122","9.3.5":"83.0.4103.122","9.4.0":"83.0.4103.122","9.4.1":"83.0.4103.122","9.4.2":"83.0.4103.122","9.4.3":"83.0.4103.122","9.4.4":"83.0.4103.122","10.0.0-beta.1":"84.0.4129.0","10.0.0-beta.2":"84.0.4129.0","10.0.0-beta.3":"85.0.4161.2","10.0.0-beta.4":"85.0.4161.2","10.0.0-beta.8":"85.0.4181.1","10.0.0-beta.9":"85.0.4181.1","10.0.0-beta.10":"85.0.4183.19","10.0.0-beta.11":"85.0.4183.20","10.0.0-beta.12":"85.0.4183.26","10.0.0-beta.13":"85.0.4183.39","10.0.0-beta.14":"85.0.4183.39","10.0.0-beta.15":"85.0.4183.39","10.0.0-beta.17":"85.0.4183.39","10.0.0-beta.19":"85.0.4183.39","10.0.0-beta.20":"85.0.4183.39","10.0.0-beta.21":"85.0.4183.39","10.0.0-beta.23":"85.0.4183.70","10.0.0-beta.24":"85.0.4183.78","10.0.0-beta.25":"85.0.4183.80","10.0.0-nightly.20200209":"82.0.4050.0","10.0.0-nightly.20200210":"82.0.4050.0","10.0.0-nightly.20200211":"82.0.4050.0","10.0.0-nightly.20200216":"82.0.4050.0","10.0.0-nightly.20200217":"82.0.4050.0","10.0.0-nightly.20200218":"82.0.4050.0","10.0.0-nightly.20200221":"82.0.4050.0","10.0.0-nightly.20200222":"82.0.4050.0","10.0.0-nightly.20200223":"82.0.4050.0","10.0.0-nightly.20200226":"82.0.4050.0","10.0.0-nightly.20200303":"82.0.4050.0","10.0.0-nightly.20200304":"82.0.4076.0","10.0.0-nightly.20200305":"82.0.4076.0","10.0.0-nightly.20200306":"82.0.4076.0","10.0.0-nightly.20200309":"82.0.4076.0","10.0.0-nightly.20200310":"82.0.4076.0","10.0.0-nightly.20200311":"82.0.4083.0","10.0.0-nightly.20200316":"83.0.4086.0","10.0.0-nightly.20200317":"83.0.4087.0","10.0.0-nightly.20200318":"83.0.4087.0","10.0.0-nightly.20200320":"83.0.4087.0","10.0.0-nightly.20200323":"83.0.4087.0","10.0.0-nightly.20200324":"83.0.4087.0","10.0.0-nightly.20200325":"83.0.4087.0","10.0.0-nightly.20200326":"83.0.4087.0","10.0.0-nightly.20200327":"83.0.4087.0","10.0.0-nightly.20200330":"83.0.4087.0","10.0.0-nightly.20200331":"83.0.4087.0","10.0.0-nightly.20200401":"83.0.4087.0","10.0.0-nightly.20200402":"83.0.4087.0","10.0.0-nightly.20200403":"83.0.4087.0","10.0.0-nightly.20200406":"83.0.4087.0","10.0.0-nightly.20200408":"83.0.4095.0","10.0.0-nightly.20200410":"83.0.4095.0","10.0.0-nightly.20200413":"83.0.4095.0","10.0.0-nightly.20200414":"84.0.4114.0","10.0.0-nightly.20200415":"84.0.4115.0","10.0.0-nightly.20200416":"84.0.4115.0","10.0.0-nightly.20200417":"84.0.4115.0","10.0.0-nightly.20200422":"84.0.4121.0","10.0.0-nightly.20200423":"84.0.4121.0","10.0.0-nightly.20200427":"84.0.4125.0","10.0.0-nightly.20200428":"84.0.4125.0","10.0.0-nightly.20200429":"84.0.4125.0","10.0.0-nightly.20200430":"84.0.4125.0","10.0.0-nightly.20200501":"84.0.4129.0","10.0.0-nightly.20200504":"84.0.4129.0","10.0.0-nightly.20200505":"84.0.4129.0","10.0.0-nightly.20200506":"84.0.4129.0","10.0.0-nightly.20200507":"84.0.4129.0","10.0.0-nightly.20200508":"84.0.4129.0","10.0.0-nightly.20200511":"84.0.4129.0","10.0.0-nightly.20200512":"84.0.4129.0","10.0.0-nightly.20200513":"84.0.4129.0","10.0.0-nightly.20200514":"84.0.4129.0","10.0.0-nightly.20200515":"84.0.4129.0","10.0.0-nightly.20200518":"84.0.4129.0","10.0.0-nightly.20200519":"84.0.4129.0","10.0.0-nightly.20200520":"84.0.4129.0","10.0.0-nightly.20200521":"84.0.4129.0","10.0.0":"85.0.4183.84","10.0.1":"85.0.4183.86","10.1.0":"85.0.4183.87","10.1.1":"85.0.4183.93","10.1.2":"85.0.4183.98","10.1.3":"85.0.4183.121","10.1.4":"85.0.4183.121","10.1.5":"85.0.4183.121","10.1.6":"85.0.4183.121","10.1.7":"85.0.4183.121","10.2.0":"85.0.4183.121","10.3.0":"85.0.4183.121","10.3.1":"85.0.4183.121","10.3.2":"85.0.4183.121","10.4.0":"85.0.4183.121","10.4.1":"85.0.4183.121","10.4.2":"85.0.4183.121","10.4.3":"85.0.4183.121","10.4.4":"85.0.4183.121","10.4.5":"85.0.4183.121","10.4.6":"85.0.4183.121","10.4.7":"85.0.4183.121","11.0.0-beta.1":"86.0.4234.0","11.0.0-beta.3":"86.0.4234.0","11.0.0-beta.4":"86.0.4234.0","11.0.0-beta.5":"86.0.4234.0","11.0.0-beta.6":"86.0.4234.0","11.0.0-beta.7":"86.0.4234.0","11.0.0-beta.8":"87.0.4251.1","11.0.0-beta.9":"87.0.4251.1","11.0.0-beta.11":"87.0.4251.1","11.0.0-beta.12":"87.0.4280.11","11.0.0-beta.13":"87.0.4280.11","11.0.0-beta.16":"87.0.4280.27","11.0.0-beta.17":"87.0.4280.27","11.0.0-beta.18":"87.0.4280.27","11.0.0-beta.19":"87.0.4280.27","11.0.0-beta.20":"87.0.4280.40","11.0.0-beta.22":"87.0.4280.47","11.0.0-beta.23":"87.0.4280.47","11.0.0-nightly.20200525":"84.0.4129.0","11.0.0-nightly.20200526":"84.0.4129.0","11.0.0-nightly.20200529":"85.0.4156.0","11.0.0-nightly.20200602":"85.0.4162.0","11.0.0-nightly.20200603":"85.0.4162.0","11.0.0-nightly.20200604":"85.0.4162.0","11.0.0-nightly.20200609":"85.0.4162.0","11.0.0-nightly.20200610":"85.0.4162.0","11.0.0-nightly.20200611":"85.0.4162.0","11.0.0-nightly.20200615":"85.0.4162.0","11.0.0-nightly.20200616":"85.0.4162.0","11.0.0-nightly.20200617":"85.0.4162.0","11.0.0-nightly.20200618":"85.0.4162.0","11.0.0-nightly.20200619":"85.0.4162.0","11.0.0-nightly.20200701":"85.0.4179.0","11.0.0-nightly.20200702":"85.0.4179.0","11.0.0-nightly.20200703":"85.0.4179.0","11.0.0-nightly.20200706":"85.0.4179.0","11.0.0-nightly.20200707":"85.0.4179.0","11.0.0-nightly.20200708":"85.0.4179.0","11.0.0-nightly.20200709":"85.0.4179.0","11.0.0-nightly.20200716":"86.0.4203.0","11.0.0-nightly.20200717":"86.0.4203.0","11.0.0-nightly.20200720":"86.0.4203.0","11.0.0-nightly.20200721":"86.0.4203.0","11.0.0-nightly.20200723":"86.0.4209.0","11.0.0-nightly.20200724":"86.0.4209.0","11.0.0-nightly.20200729":"86.0.4209.0","11.0.0-nightly.20200730":"86.0.4209.0","11.0.0-nightly.20200731":"86.0.4209.0","11.0.0-nightly.20200803":"86.0.4209.0","11.0.0-nightly.20200804":"86.0.4209.0","11.0.0-nightly.20200805":"86.0.4209.0","11.0.0-nightly.20200811":"86.0.4209.0","11.0.0-nightly.20200812":"86.0.4209.0","11.0.0-nightly.20200822":"86.0.4234.0","11.0.0-nightly.20200824":"86.0.4234.0","11.0.0-nightly.20200825":"86.0.4234.0","11.0.0-nightly.20200826":"86.0.4234.0","11.0.0":"87.0.4280.60","11.0.1":"87.0.4280.60","11.0.2":"87.0.4280.67","11.0.3":"87.0.4280.67","11.0.4":"87.0.4280.67","11.0.5":"87.0.4280.88","11.1.0":"87.0.4280.88","11.1.1":"87.0.4280.88","11.2.0":"87.0.4280.141","11.2.1":"87.0.4280.141","11.2.2":"87.0.4280.141","11.2.3":"87.0.4280.141","11.3.0":"87.0.4280.141","11.4.0":"87.0.4280.141","11.4.1":"87.0.4280.141","11.4.2":"87.0.4280.141","11.4.3":"87.0.4280.141","11.4.4":"87.0.4280.141","11.4.5":"87.0.4280.141","11.4.6":"87.0.4280.141","11.4.7":"87.0.4280.141","11.4.8":"87.0.4280.141","11.4.9":"87.0.4280.141","11.4.10":"87.0.4280.141","11.4.11":"87.0.4280.141","11.4.12":"87.0.4280.141","11.5.0":"87.0.4280.141","12.0.0-beta.1":"89.0.4328.0","12.0.0-beta.3":"89.0.4328.0","12.0.0-beta.4":"89.0.4328.0","12.0.0-beta.5":"89.0.4328.0","12.0.0-beta.6":"89.0.4328.0","12.0.0-beta.7":"89.0.4328.0","12.0.0-beta.8":"89.0.4328.0","12.0.0-beta.9":"89.0.4328.0","12.0.0-beta.10":"89.0.4328.0","12.0.0-beta.11":"89.0.4328.0","12.0.0-beta.12":"89.0.4328.0","12.0.0-beta.14":"89.0.4328.0","12.0.0-beta.16":"89.0.4348.1","12.0.0-beta.18":"89.0.4348.1","12.0.0-beta.19":"89.0.4348.1","12.0.0-beta.20":"89.0.4348.1","12.0.0-beta.21":"89.0.4388.2","12.0.0-beta.22":"89.0.4388.2","12.0.0-beta.23":"89.0.4388.2","12.0.0-beta.24":"89.0.4388.2","12.0.0-beta.25":"89.0.4388.2","12.0.0-beta.26":"89.0.4388.2","12.0.0-beta.27":"89.0.4389.23","12.0.0-beta.28":"89.0.4389.23","12.0.0-beta.29":"89.0.4389.23","12.0.0-beta.30":"89.0.4389.58","12.0.0-beta.31":"89.0.4389.58","12.0.0-nightly.20200827":"86.0.4234.0","12.0.0-nightly.20200831":"86.0.4234.0","12.0.0-nightly.20200902":"86.0.4234.0","12.0.0-nightly.20200903":"86.0.4234.0","12.0.0-nightly.20200907":"86.0.4234.0","12.0.0-nightly.20200910":"86.0.4234.0","12.0.0-nightly.20200911":"86.0.4234.0","12.0.0-nightly.20200914":"86.0.4234.0","12.0.0-nightly.20201002":"87.0.4268.0","12.0.0-nightly.20201007":"87.0.4268.0","12.0.0-nightly.20201009":"87.0.4268.0","12.0.0-nightly.20201012":"87.0.4268.0","12.0.0-nightly.20201013":"87.0.4268.0","12.0.0-nightly.20201014":"87.0.4268.0","12.0.0-nightly.20201015":"87.0.4268.0","12.0.0-nightly.20201023":"88.0.4292.0","12.0.0-nightly.20201026":"88.0.4292.0","12.0.0-nightly.20201030":"88.0.4306.0","12.0.0-nightly.20201102":"88.0.4306.0","12.0.0-nightly.20201103":"88.0.4306.0","12.0.0-nightly.20201104":"88.0.4306.0","12.0.0-nightly.20201105":"88.0.4306.0","12.0.0-nightly.20201106":"88.0.4306.0","12.0.0-nightly.20201111":"88.0.4306.0","12.0.0-nightly.20201112":"88.0.4306.0","12.0.0-nightly.20201116":"88.0.4324.0","12.0.0":"89.0.4389.69","12.0.1":"89.0.4389.82","12.0.2":"89.0.4389.90","12.0.3":"89.0.4389.114","12.0.4":"89.0.4389.114","12.0.5":"89.0.4389.128","12.0.6":"89.0.4389.128","12.0.7":"89.0.4389.128","12.0.8":"89.0.4389.128","12.0.9":"89.0.4389.128","12.0.10":"89.0.4389.128","12.0.11":"89.0.4389.128","12.0.12":"89.0.4389.128","12.0.13":"89.0.4389.128","12.0.14":"89.0.4389.128","12.0.15":"89.0.4389.128","12.0.16":"89.0.4389.128","12.0.17":"89.0.4389.128","12.0.18":"89.0.4389.128","12.1.0":"89.0.4389.128","12.1.1":"89.0.4389.128","12.1.2":"89.0.4389.128","12.2.0":"89.0.4389.128","12.2.1":"89.0.4389.128","12.2.2":"89.0.4389.128","12.2.3":"89.0.4389.128","13.0.0-beta.2":"90.0.4402.0","13.0.0-beta.3":"90.0.4402.0","13.0.0-beta.4":"90.0.4415.0","13.0.0-beta.5":"90.0.4415.0","13.0.0-beta.6":"90.0.4415.0","13.0.0-beta.7":"90.0.4415.0","13.0.0-beta.8":"90.0.4415.0","13.0.0-beta.9":"90.0.4415.0","13.0.0-beta.10":"90.0.4415.0","13.0.0-beta.11":"90.0.4415.0","13.0.0-beta.12":"90.0.4415.0","13.0.0-beta.13":"90.0.4415.0","13.0.0-beta.14":"91.0.4448.0","13.0.0-beta.16":"91.0.4448.0","13.0.0-beta.17":"91.0.4448.0","13.0.0-beta.18":"91.0.4448.0","13.0.0-beta.20":"91.0.4448.0","13.0.0-beta.21":"91.0.4472.33","13.0.0-beta.22":"91.0.4472.33","13.0.0-beta.23":"91.0.4472.33","13.0.0-beta.24":"91.0.4472.38","13.0.0-beta.25":"91.0.4472.38","13.0.0-beta.26":"91.0.4472.38","13.0.0-beta.27":"91.0.4472.38","13.0.0-beta.28":"91.0.4472.38","13.0.0-nightly.20201119":"89.0.4328.0","13.0.0-nightly.20201123":"89.0.4328.0","13.0.0-nightly.20201124":"89.0.4328.0","13.0.0-nightly.20201126":"89.0.4328.0","13.0.0-nightly.20201127":"89.0.4328.0","13.0.0-nightly.20201130":"89.0.4328.0","13.0.0-nightly.20201201":"89.0.4328.0","13.0.0-nightly.20201202":"89.0.4328.0","13.0.0-nightly.20201203":"89.0.4328.0","13.0.0-nightly.20201204":"89.0.4328.0","13.0.0-nightly.20201207":"89.0.4328.0","13.0.0-nightly.20201208":"89.0.4328.0","13.0.0-nightly.20201209":"89.0.4328.0","13.0.0-nightly.20201210":"89.0.4328.0","13.0.0-nightly.20201211":"89.0.4328.0","13.0.0-nightly.20201214":"89.0.4328.0","13.0.0-nightly.20201215":"89.0.4349.0","13.0.0-nightly.20201216":"89.0.4349.0","13.0.0-nightly.20201221":"89.0.4349.0","13.0.0-nightly.20201222":"89.0.4349.0","13.0.0-nightly.20201223":"89.0.4359.0","13.0.0-nightly.20210104":"89.0.4359.0","13.0.0-nightly.20210108":"89.0.4359.0","13.0.0-nightly.20210111":"89.0.4359.0","13.0.0-nightly.20210113":"89.0.4386.0","13.0.0-nightly.20210114":"89.0.4386.0","13.0.0-nightly.20210118":"89.0.4386.0","13.0.0-nightly.20210122":"89.0.4386.0","13.0.0-nightly.20210125":"89.0.4386.0","13.0.0-nightly.20210127":"89.0.4389.0","13.0.0-nightly.20210128":"89.0.4389.0","13.0.0-nightly.20210129":"89.0.4389.0","13.0.0-nightly.20210201":"89.0.4389.0","13.0.0-nightly.20210202":"89.0.4389.0","13.0.0-nightly.20210203":"89.0.4389.0","13.0.0-nightly.20210205":"89.0.4389.0","13.0.0-nightly.20210208":"89.0.4389.0","13.0.0-nightly.20210209":"89.0.4389.0","13.0.0-nightly.20210210":"90.0.4402.0","13.0.0-nightly.20210211":"90.0.4402.0","13.0.0-nightly.20210212":"90.0.4402.0","13.0.0-nightly.20210216":"90.0.4402.0","13.0.0-nightly.20210217":"90.0.4402.0","13.0.0-nightly.20210218":"90.0.4402.0","13.0.0-nightly.20210219":"90.0.4402.0","13.0.0-nightly.20210222":"90.0.4402.0","13.0.0-nightly.20210225":"90.0.4402.0","13.0.0-nightly.20210226":"90.0.4402.0","13.0.0-nightly.20210301":"90.0.4402.0","13.0.0-nightly.20210302":"90.0.4402.0","13.0.0-nightly.20210303":"90.0.4402.0","13.0.0":"91.0.4472.69","13.0.1":"91.0.4472.69","13.1.0":"91.0.4472.77","13.1.1":"91.0.4472.77","13.1.2":"91.0.4472.77","13.1.3":"91.0.4472.106","13.1.4":"91.0.4472.106","13.1.5":"91.0.4472.124","13.1.6":"91.0.4472.124","13.1.7":"91.0.4472.124","13.1.8":"91.0.4472.164","13.1.9":"91.0.4472.164","13.2.0":"91.0.4472.164","13.2.1":"91.0.4472.164","13.2.2":"91.0.4472.164","13.2.3":"91.0.4472.164","13.3.0":"91.0.4472.164","13.4.0":"91.0.4472.164","13.5.0":"91.0.4472.164","13.5.1":"91.0.4472.164","13.5.2":"91.0.4472.164","13.6.0":"91.0.4472.164","13.6.1":"91.0.4472.164","13.6.2":"91.0.4472.164","13.6.3":"91.0.4472.164","13.6.6":"91.0.4472.164","13.6.7":"91.0.4472.164","13.6.8":"91.0.4472.164","13.6.9":"91.0.4472.164","14.0.0-beta.1":"92.0.4511.0","14.0.0-beta.2":"92.0.4511.0","14.0.0-beta.3":"92.0.4511.0","14.0.0-beta.5":"93.0.4536.0","14.0.0-beta.6":"93.0.4536.0","14.0.0-beta.7":"93.0.4536.0","14.0.0-beta.8":"93.0.4536.0","14.0.0-beta.9":"93.0.4539.0","14.0.0-beta.10":"93.0.4539.0","14.0.0-beta.11":"93.0.4557.4","14.0.0-beta.12":"93.0.4557.4","14.0.0-beta.13":"93.0.4566.0","14.0.0-beta.14":"93.0.4566.0","14.0.0-beta.15":"93.0.4566.0","14.0.0-beta.16":"93.0.4566.0","14.0.0-beta.17":"93.0.4566.0","14.0.0-beta.18":"93.0.4577.15","14.0.0-beta.19":"93.0.4577.15","14.0.0-beta.20":"93.0.4577.15","14.0.0-beta.21":"93.0.4577.15","14.0.0-beta.22":"93.0.4577.25","14.0.0-beta.23":"93.0.4577.25","14.0.0-beta.24":"93.0.4577.51","14.0.0-beta.25":"93.0.4577.51","14.0.0-nightly.20210304":"90.0.4402.0","14.0.0-nightly.20210305":"90.0.4415.0","14.0.0-nightly.20210308":"90.0.4415.0","14.0.0-nightly.20210309":"90.0.4415.0","14.0.0-nightly.20210311":"90.0.4415.0","14.0.0-nightly.20210315":"90.0.4415.0","14.0.0-nightly.20210316":"90.0.4415.0","14.0.0-nightly.20210317":"90.0.4415.0","14.0.0-nightly.20210318":"90.0.4415.0","14.0.0-nightly.20210319":"90.0.4415.0","14.0.0-nightly.20210323":"90.0.4415.0","14.0.0-nightly.20210324":"90.0.4415.0","14.0.0-nightly.20210325":"90.0.4415.0","14.0.0-nightly.20210326":"90.0.4415.0","14.0.0-nightly.20210329":"90.0.4415.0","14.0.0-nightly.20210330":"90.0.4415.0","14.0.0-nightly.20210331":"91.0.4448.0","14.0.0-nightly.20210401":"91.0.4448.0","14.0.0-nightly.20210402":"91.0.4448.0","14.0.0-nightly.20210406":"91.0.4448.0","14.0.0-nightly.20210407":"91.0.4448.0","14.0.0-nightly.20210408":"91.0.4448.0","14.0.0-nightly.20210409":"91.0.4448.0","14.0.0-nightly.20210413":"91.0.4448.0","14.0.0-nightly.20210426":"92.0.4475.0","14.0.0-nightly.20210427":"92.0.4475.0","14.0.0-nightly.20210430":"92.0.4488.0","14.0.0-nightly.20210503":"92.0.4488.0","14.0.0-nightly.20210505":"92.0.4496.0","14.0.0-nightly.20210506":"92.0.4498.0","14.0.0-nightly.20210507":"92.0.4499.0","14.0.0-nightly.20210510":"92.0.4499.0","14.0.0-nightly.20210511":"92.0.4499.0","14.0.0-nightly.20210512":"92.0.4499.0","14.0.0-nightly.20210513":"92.0.4499.0","14.0.0-nightly.20210514":"92.0.4505.0","14.0.0-nightly.20210517":"92.0.4505.0","14.0.0-nightly.20210518":"92.0.4505.0","14.0.0-nightly.20210519":"92.0.4505.0","14.0.0-nightly.20210520":"92.0.4511.0","14.0.0-nightly.20210523":"92.0.4511.0","14.0.0-nightly.20210524":"92.0.4511.0","14.0.0":"93.0.4577.58","14.0.1":"93.0.4577.63","14.0.2":"93.0.4577.82","14.1.0":"93.0.4577.82","14.1.1":"93.0.4577.82","14.2.0":"93.0.4577.82","14.2.1":"93.0.4577.82","14.2.2":"93.0.4577.82","14.2.3":"93.0.4577.82","14.2.4":"93.0.4577.82","14.2.5":"93.0.4577.82","14.2.6":"93.0.4577.82","14.2.7":"93.0.4577.82","14.2.8":"93.0.4577.82","14.2.9":"93.0.4577.82","15.0.0-alpha.1":"93.0.4566.0","15.0.0-alpha.2":"93.0.4566.0","15.0.0-alpha.3":"94.0.4584.0","15.0.0-alpha.4":"94.0.4584.0","15.0.0-alpha.5":"94.0.4584.0","15.0.0-alpha.6":"94.0.4584.0","15.0.0-alpha.7":"94.0.4590.2","15.0.0-alpha.8":"94.0.4590.2","15.0.0-alpha.9":"94.0.4590.2","15.0.0-alpha.10":"94.0.4606.12","15.0.0-beta.1":"94.0.4606.20","15.0.0-beta.2":"94.0.4606.20","15.0.0-beta.3":"94.0.4606.31","15.0.0-beta.4":"94.0.4606.31","15.0.0-beta.5":"94.0.4606.31","15.0.0-beta.6":"94.0.4606.31","15.0.0-beta.7":"94.0.4606.31","15.0.0-nightly.20210527":"92.0.4511.0","15.0.0-nightly.20210528":"92.0.4511.0","15.0.0-nightly.20210531":"92.0.4511.0","15.0.0-nightly.20210601":"92.0.4511.0","15.0.0-nightly.20210602":"92.0.4511.0","15.0.0-nightly.20210603":"93.0.4530.0","15.0.0-nightly.20210604":"93.0.4530.0","15.0.0-nightly.20210608":"93.0.4535.0","15.0.0-nightly.20210609":"93.0.4536.0","15.0.0-nightly.20210610":"93.0.4536.0","15.0.0-nightly.20210611":"93.0.4536.0","15.0.0-nightly.20210614":"93.0.4536.0","15.0.0-nightly.20210615":"93.0.4536.0","15.0.0-nightly.20210616":"93.0.4536.0","15.0.0-nightly.20210617":"93.0.4539.0","15.0.0-nightly.20210618":"93.0.4539.0","15.0.0-nightly.20210621":"93.0.4539.0","15.0.0-nightly.20210622":"93.0.4539.0","15.0.0-nightly.20210623":"93.0.4550.0","15.0.0-nightly.20210624":"93.0.4550.0","15.0.0-nightly.20210625":"93.0.4552.0","15.0.0-nightly.20210628":"93.0.4552.0","15.0.0-nightly.20210629":"93.0.4552.0","15.0.0-nightly.20210630":"93.0.4558.0","15.0.0-nightly.20210701":"93.0.4558.0","15.0.0-nightly.20210702":"93.0.4558.0","15.0.0-nightly.20210705":"93.0.4558.0","15.0.0-nightly.20210706":"93.0.4566.0","15.0.0-nightly.20210707":"93.0.4566.0","15.0.0-nightly.20210708":"93.0.4566.0","15.0.0-nightly.20210709":"93.0.4566.0","15.0.0-nightly.20210712":"93.0.4566.0","15.0.0-nightly.20210713":"93.0.4566.0","15.0.0-nightly.20210714":"93.0.4566.0","15.0.0-nightly.20210715":"93.0.4566.0","15.0.0-nightly.20210716":"93.0.4566.0","15.0.0-nightly.20210719":"93.0.4566.0","15.0.0-nightly.20210720":"93.0.4566.0","15.0.0-nightly.20210721":"93.0.4566.0","15.0.0":"94.0.4606.51","15.1.0":"94.0.4606.61","15.1.1":"94.0.4606.61","15.1.2":"94.0.4606.71","15.2.0":"94.0.4606.81","15.3.0":"94.0.4606.81","15.3.1":"94.0.4606.81","15.3.2":"94.0.4606.81","15.3.3":"94.0.4606.81","15.3.4":"94.0.4606.81","15.3.5":"94.0.4606.81","15.3.6":"94.0.4606.81","15.3.7":"94.0.4606.81","15.4.0":"94.0.4606.81","15.4.1":"94.0.4606.81","15.4.2":"94.0.4606.81","15.5.0":"94.0.4606.81","15.5.1":"94.0.4606.81","15.5.2":"94.0.4606.81","15.5.3":"94.0.4606.81","15.5.4":"94.0.4606.81","15.5.5":"94.0.4606.81","15.5.6":"94.0.4606.81","15.5.7":"94.0.4606.81","16.0.0-alpha.1":"95.0.4629.0","16.0.0-alpha.2":"95.0.4629.0","16.0.0-alpha.3":"95.0.4629.0","16.0.0-alpha.4":"95.0.4629.0","16.0.0-alpha.5":"95.0.4629.0","16.0.0-alpha.6":"95.0.4629.0","16.0.0-alpha.7":"95.0.4629.0","16.0.0-alpha.8":"96.0.4647.0","16.0.0-alpha.9":"96.0.4647.0","16.0.0-beta.1":"96.0.4647.0","16.0.0-beta.2":"96.0.4647.0","16.0.0-beta.3":"96.0.4647.0","16.0.0-beta.4":"96.0.4664.18","16.0.0-beta.5":"96.0.4664.18","16.0.0-beta.6":"96.0.4664.27","16.0.0-beta.7":"96.0.4664.27","16.0.0-beta.8":"96.0.4664.35","16.0.0-beta.9":"96.0.4664.35","16.0.0-nightly.20210722":"93.0.4566.0","16.0.0-nightly.20210723":"93.0.4566.0","16.0.0-nightly.20210726":"93.0.4566.0","16.0.0-nightly.20210727":"94.0.4584.0","16.0.0-nightly.20210728":"94.0.4584.0","16.0.0-nightly.20210729":"94.0.4584.0","16.0.0-nightly.20210730":"94.0.4584.0","16.0.0-nightly.20210802":"94.0.4584.0","16.0.0-nightly.20210803":"94.0.4584.0","16.0.0-nightly.20210804":"94.0.4584.0","16.0.0-nightly.20210805":"94.0.4584.0","16.0.0-nightly.20210806":"94.0.4584.0","16.0.0-nightly.20210809":"94.0.4584.0","16.0.0-nightly.20210810":"94.0.4584.0","16.0.0-nightly.20210811":"94.0.4584.0","16.0.0-nightly.20210812":"94.0.4590.2","16.0.0-nightly.20210813":"94.0.4590.2","16.0.0-nightly.20210816":"94.0.4590.2","16.0.0-nightly.20210817":"94.0.4590.2","16.0.0-nightly.20210818":"94.0.4590.2","16.0.0-nightly.20210819":"94.0.4590.2","16.0.0-nightly.20210820":"94.0.4590.2","16.0.0-nightly.20210823":"94.0.4590.2","16.0.0-nightly.20210824":"95.0.4612.5","16.0.0-nightly.20210825":"95.0.4612.5","16.0.0-nightly.20210826":"95.0.4612.5","16.0.0-nightly.20210827":"95.0.4612.5","16.0.0-nightly.20210830":"95.0.4612.5","16.0.0-nightly.20210831":"95.0.4612.5","16.0.0-nightly.20210901":"95.0.4612.5","16.0.0-nightly.20210902":"95.0.4629.0","16.0.0-nightly.20210903":"95.0.4629.0","16.0.0-nightly.20210906":"95.0.4629.0","16.0.0-nightly.20210907":"95.0.4629.0","16.0.0-nightly.20210908":"95.0.4629.0","16.0.0-nightly.20210909":"95.0.4629.0","16.0.0-nightly.20210910":"95.0.4629.0","16.0.0-nightly.20210913":"95.0.4629.0","16.0.0-nightly.20210914":"95.0.4629.0","16.0.0-nightly.20210915":"95.0.4629.0","16.0.0-nightly.20210916":"95.0.4629.0","16.0.0-nightly.20210917":"95.0.4629.0","16.0.0-nightly.20210920":"95.0.4629.0","16.0.0-nightly.20210921":"95.0.4629.0","16.0.0-nightly.20210922":"95.0.4629.0","16.0.0":"96.0.4664.45","16.0.1":"96.0.4664.45","16.0.2":"96.0.4664.55","16.0.3":"96.0.4664.55","16.0.4":"96.0.4664.55","16.0.5":"96.0.4664.55","16.0.6":"96.0.4664.110","16.0.7":"96.0.4664.110","16.0.8":"96.0.4664.110","16.0.9":"96.0.4664.174","16.0.10":"96.0.4664.174","16.1.0":"96.0.4664.174","16.1.1":"96.0.4664.174","16.2.0":"96.0.4664.174","16.2.1":"96.0.4664.174","16.2.2":"96.0.4664.174","16.2.3":"96.0.4664.174","16.2.4":"96.0.4664.174","16.2.5":"96.0.4664.174","16.2.6":"96.0.4664.174","16.2.7":"96.0.4664.174","16.2.8":"96.0.4664.174","17.0.0-alpha.1":"96.0.4664.4","17.0.0-alpha.2":"96.0.4664.4","17.0.0-alpha.3":"96.0.4664.4","17.0.0-alpha.4":"98.0.4706.0","17.0.0-alpha.5":"98.0.4706.0","17.0.0-alpha.6":"98.0.4706.0","17.0.0-beta.1":"98.0.4706.0","17.0.0-beta.2":"98.0.4706.0","17.0.0-beta.3":"98.0.4758.9","17.0.0-beta.4":"98.0.4758.11","17.0.0-beta.5":"98.0.4758.11","17.0.0-beta.6":"98.0.4758.11","17.0.0-beta.7":"98.0.4758.11","17.0.0-beta.8":"98.0.4758.11","17.0.0-beta.9":"98.0.4758.11","17.0.0-nightly.20210923":"95.0.4629.0","17.0.0-nightly.20210924":"95.0.4629.0","17.0.0-nightly.20210927":"95.0.4629.0","17.0.0-nightly.20210928":"95.0.4629.0","17.0.0-nightly.20210929":"95.0.4629.0","17.0.0-nightly.20210930":"95.0.4629.0","17.0.0-nightly.20211001":"95.0.4629.0","17.0.0-nightly.20211004":"95.0.4629.0","17.0.0-nightly.20211005":"95.0.4629.0","17.0.0-nightly.20211006":"96.0.4647.0","17.0.0-nightly.20211007":"96.0.4647.0","17.0.0-nightly.20211008":"96.0.4647.0","17.0.0-nightly.20211011":"96.0.4647.0","17.0.0-nightly.20211012":"96.0.4647.0","17.0.0-nightly.20211013":"96.0.4647.0","17.0.0-nightly.20211014":"96.0.4647.0","17.0.0-nightly.20211015":"96.0.4647.0","17.0.0-nightly.20211018":"96.0.4647.0","17.0.0-nightly.20211019":"96.0.4647.0","17.0.0-nightly.20211020":"96.0.4647.0","17.0.0-nightly.20211021":"96.0.4647.0","17.0.0-nightly.20211022":"96.0.4664.4","17.0.0-nightly.20211025":"96.0.4664.4","17.0.0-nightly.20211026":"96.0.4664.4","17.0.0-nightly.20211027":"96.0.4664.4","17.0.0-nightly.20211028":"96.0.4664.4","17.0.0-nightly.20211029":"96.0.4664.4","17.0.0-nightly.20211101":"96.0.4664.4","17.0.0-nightly.20211102":"96.0.4664.4","17.0.0-nightly.20211103":"96.0.4664.4","17.0.0-nightly.20211104":"96.0.4664.4","17.0.0-nightly.20211105":"96.0.4664.4","17.0.0-nightly.20211108":"96.0.4664.4","17.0.0-nightly.20211109":"96.0.4664.4","17.0.0-nightly.20211110":"96.0.4664.4","17.0.0-nightly.20211111":"96.0.4664.4","17.0.0-nightly.20211112":"96.0.4664.4","17.0.0-nightly.20211115":"96.0.4664.4","17.0.0-nightly.20211116":"96.0.4664.4","17.0.0-nightly.20211117":"96.0.4664.4","17.0.0":"98.0.4758.74","17.0.1":"98.0.4758.82","17.1.0":"98.0.4758.102","17.1.1":"98.0.4758.109","17.1.2":"98.0.4758.109","17.2.0":"98.0.4758.109","17.3.0":"98.0.4758.141","17.3.1":"98.0.4758.141","17.4.0":"98.0.4758.141","17.4.1":"98.0.4758.141","17.4.2":"98.0.4758.141","17.4.3":"98.0.4758.141","17.4.4":"98.0.4758.141","17.4.5":"98.0.4758.141","17.4.6":"98.0.4758.141","17.4.7":"98.0.4758.141","17.4.8":"98.0.4758.141","17.4.9":"98.0.4758.141","17.4.10":"98.0.4758.141","17.4.11":"98.0.4758.141","18.0.0-alpha.1":"99.0.4767.0","18.0.0-alpha.2":"99.0.4767.0","18.0.0-alpha.3":"99.0.4767.0","18.0.0-alpha.4":"99.0.4767.0","18.0.0-alpha.5":"99.0.4767.0","18.0.0-beta.1":"100.0.4894.0","18.0.0-beta.2":"100.0.4894.0","18.0.0-beta.3":"100.0.4894.0","18.0.0-beta.4":"100.0.4894.0","18.0.0-beta.5":"100.0.4894.0","18.0.0-beta.6":"100.0.4894.0","18.0.0-nightly.20211118":"96.0.4664.4","18.0.0-nightly.20211119":"96.0.4664.4","18.0.0-nightly.20211122":"96.0.4664.4","18.0.0-nightly.20211123":"96.0.4664.4","18.0.0-nightly.20211124":"98.0.4706.0","18.0.0-nightly.20211125":"98.0.4706.0","18.0.0-nightly.20211126":"98.0.4706.0","18.0.0-nightly.20211129":"98.0.4706.0","18.0.0-nightly.20211130":"98.0.4706.0","18.0.0-nightly.20211201":"98.0.4706.0","18.0.0-nightly.20211202":"98.0.4706.0","18.0.0-nightly.20211203":"98.0.4706.0","18.0.0-nightly.20211206":"98.0.4706.0","18.0.0-nightly.20211207":"98.0.4706.0","18.0.0-nightly.20211208":"98.0.4706.0","18.0.0-nightly.20211209":"98.0.4706.0","18.0.0-nightly.20211210":"98.0.4706.0","18.0.0-nightly.20211213":"98.0.4706.0","18.0.0-nightly.20211214":"98.0.4706.0","18.0.0-nightly.20211215":"98.0.4706.0","18.0.0-nightly.20211216":"98.0.4706.0","18.0.0-nightly.20211217":"98.0.4706.0","18.0.0-nightly.20211220":"98.0.4706.0","18.0.0-nightly.20211221":"98.0.4706.0","18.0.0-nightly.20211222":"98.0.4706.0","18.0.0-nightly.20211223":"98.0.4706.0","18.0.0-nightly.20211228":"98.0.4706.0","18.0.0-nightly.20211229":"98.0.4706.0","18.0.0-nightly.20211231":"98.0.4706.0","18.0.0-nightly.20220103":"98.0.4706.0","18.0.0-nightly.20220104":"98.0.4706.0","18.0.0-nightly.20220105":"98.0.4706.0","18.0.0-nightly.20220106":"98.0.4706.0","18.0.0-nightly.20220107":"98.0.4706.0","18.0.0-nightly.20220110":"98.0.4706.0","18.0.0-nightly.20220111":"99.0.4767.0","18.0.0-nightly.20220112":"99.0.4767.0","18.0.0-nightly.20220113":"99.0.4767.0","18.0.0-nightly.20220114":"99.0.4767.0","18.0.0-nightly.20220117":"99.0.4767.0","18.0.0-nightly.20220118":"99.0.4767.0","18.0.0-nightly.20220119":"99.0.4767.0","18.0.0-nightly.20220121":"99.0.4767.0","18.0.0-nightly.20220124":"99.0.4767.0","18.0.0-nightly.20220125":"99.0.4767.0","18.0.0-nightly.20220127":"99.0.4767.0","18.0.0-nightly.20220128":"99.0.4767.0","18.0.0-nightly.20220131":"99.0.4767.0","18.0.0-nightly.20220201":"99.0.4767.0","18.0.0":"100.0.4896.56","18.0.1":"100.0.4896.60","18.0.2":"100.0.4896.60","18.0.3":"100.0.4896.75","18.0.4":"100.0.4896.75","18.1.0":"100.0.4896.127","18.2.0":"100.0.4896.143","18.2.1":"100.0.4896.143","18.2.2":"100.0.4896.143","18.2.3":"100.0.4896.143","18.2.4":"100.0.4896.160","18.3.0":"100.0.4896.160","18.3.1":"100.0.4896.160","18.3.2":"100.0.4896.160","18.3.3":"100.0.4896.160","18.3.4":"100.0.4896.160","18.3.5":"100.0.4896.160","18.3.6":"100.0.4896.160","18.3.7":"100.0.4896.160","18.3.8":"100.0.4896.160","18.3.9":"100.0.4896.160","18.3.11":"100.0.4896.160","18.3.12":"100.0.4896.160","18.3.13":"100.0.4896.160","18.3.14":"100.0.4896.160","18.3.15":"100.0.4896.160","19.0.0-alpha.1":"102.0.4962.3","19.0.0-alpha.2":"102.0.4971.0","19.0.0-alpha.3":"102.0.4971.0","19.0.0-alpha.4":"102.0.4989.0","19.0.0-alpha.5":"102.0.4989.0","19.0.0-beta.1":"102.0.4999.0","19.0.0-beta.2":"102.0.4999.0","19.0.0-beta.3":"102.0.4999.0","19.0.0-beta.4":"102.0.5005.27","19.0.0-beta.5":"102.0.5005.40","19.0.0-beta.6":"102.0.5005.40","19.0.0-beta.7":"102.0.5005.40","19.0.0-beta.8":"102.0.5005.49","19.0.0-nightly.20220202":"99.0.4767.0","19.0.0-nightly.20220203":"99.0.4767.0","19.0.0-nightly.20220204":"99.0.4767.0","19.0.0-nightly.20220207":"99.0.4767.0","19.0.0-nightly.20220208":"99.0.4767.0","19.0.0-nightly.20220209":"99.0.4767.0","19.0.0-nightly.20220308":"100.0.4894.0","19.0.0-nightly.20220309":"100.0.4894.0","19.0.0-nightly.20220310":"100.0.4894.0","19.0.0-nightly.20220311":"100.0.4894.0","19.0.0-nightly.20220314":"100.0.4894.0","19.0.0-nightly.20220315":"100.0.4894.0","19.0.0-nightly.20220316":"100.0.4894.0","19.0.0-nightly.20220317":"100.0.4894.0","19.0.0-nightly.20220318":"100.0.4894.0","19.0.0-nightly.20220321":"100.0.4894.0","19.0.0-nightly.20220322":"100.0.4894.0","19.0.0-nightly.20220323":"100.0.4894.0","19.0.0-nightly.20220324":"100.0.4894.0","19.0.0-nightly.20220325":"102.0.4961.0","19.0.0-nightly.20220328":"102.0.4962.3","19.0.0-nightly.20220329":"102.0.4962.3","19.0.0":"102.0.5005.61","19.0.1":"102.0.5005.61","19.0.2":"102.0.5005.63","19.0.3":"102.0.5005.63","19.0.4":"102.0.5005.63","19.0.5":"102.0.5005.115","19.0.6":"102.0.5005.115","19.0.7":"102.0.5005.134","19.0.8":"102.0.5005.148","19.0.9":"102.0.5005.167","19.0.10":"102.0.5005.167","19.0.11":"102.0.5005.167","19.0.12":"102.0.5005.167","19.0.13":"102.0.5005.167","19.0.14":"102.0.5005.167","19.0.15":"102.0.5005.167","19.0.16":"102.0.5005.167","19.0.17":"102.0.5005.167","19.1.0":"102.0.5005.167","19.1.1":"102.0.5005.167","19.1.2":"102.0.5005.167","19.1.3":"102.0.5005.167","19.1.4":"102.0.5005.167","19.1.5":"102.0.5005.167","19.1.6":"102.0.5005.167","19.1.7":"102.0.5005.167","19.1.8":"102.0.5005.167","19.1.9":"102.0.5005.167","20.0.0-alpha.1":"103.0.5044.0","20.0.0-alpha.2":"104.0.5073.0","20.0.0-alpha.3":"104.0.5073.0","20.0.0-alpha.4":"104.0.5073.0","20.0.0-alpha.5":"104.0.5073.0","20.0.0-alpha.6":"104.0.5073.0","20.0.0-alpha.7":"104.0.5073.0","20.0.0-beta.1":"104.0.5073.0","20.0.0-beta.2":"104.0.5073.0","20.0.0-beta.3":"104.0.5073.0","20.0.0-beta.4":"104.0.5073.0","20.0.0-beta.5":"104.0.5073.0","20.0.0-beta.6":"104.0.5073.0","20.0.0-beta.7":"104.0.5073.0","20.0.0-beta.8":"104.0.5073.0","20.0.0-beta.9":"104.0.5112.39","20.0.0-beta.10":"104.0.5112.48","20.0.0-beta.11":"104.0.5112.48","20.0.0-beta.12":"104.0.5112.48","20.0.0-beta.13":"104.0.5112.57","20.0.0-nightly.20220330":"102.0.4962.3","20.0.0-nightly.20220411":"102.0.4971.0","20.0.0-nightly.20220414":"102.0.4989.0","20.0.0-nightly.20220415":"102.0.4989.0","20.0.0-nightly.20220418":"102.0.4989.0","20.0.0-nightly.20220419":"102.0.4989.0","20.0.0-nightly.20220420":"102.0.4989.0","20.0.0-nightly.20220421":"102.0.4989.0","20.0.0-nightly.20220425":"102.0.4999.0","20.0.0-nightly.20220426":"102.0.4999.0","20.0.0-nightly.20220427":"102.0.4999.0","20.0.0-nightly.20220428":"102.0.4999.0","20.0.0-nightly.20220429":"102.0.4999.0","20.0.0-nightly.20220502":"102.0.4999.0","20.0.0-nightly.20220503":"102.0.4999.0","20.0.0-nightly.20220504":"102.0.4999.0","20.0.0-nightly.20220505":"102.0.4999.0","20.0.0-nightly.20220506":"102.0.4999.0","20.0.0-nightly.20220509":"102.0.4999.0","20.0.0-nightly.20220511":"102.0.4999.0","20.0.0-nightly.20220512":"102.0.4999.0","20.0.0-nightly.20220513":"102.0.4999.0","20.0.0-nightly.20220516":"102.0.4999.0","20.0.0-nightly.20220517":"102.0.4999.0","20.0.0-nightly.20220518":"103.0.5044.0","20.0.0-nightly.20220519":"103.0.5044.0","20.0.0-nightly.20220520":"103.0.5044.0","20.0.0-nightly.20220523":"103.0.5044.0","20.0.0-nightly.20220524":"103.0.5044.0","20.0.0":"104.0.5112.65","20.0.1":"104.0.5112.81","20.0.2":"104.0.5112.81","20.0.3":"104.0.5112.81","20.1.0":"104.0.5112.102","20.1.1":"104.0.5112.102","20.1.2":"104.0.5112.114","20.1.3":"104.0.5112.114","20.1.4":"104.0.5112.114","20.2.0":"104.0.5112.124","20.3.0":"104.0.5112.124","20.3.1":"104.0.5112.124","20.3.2":"104.0.5112.124","20.3.3":"104.0.5112.124","20.3.4":"104.0.5112.124","20.3.5":"104.0.5112.124","20.3.6":"104.0.5112.124","20.3.7":"104.0.5112.124","20.3.8":"104.0.5112.124","20.3.9":"104.0.5112.124","20.3.10":"104.0.5112.124","20.3.11":"104.0.5112.124","20.3.12":"104.0.5112.124","21.0.0-alpha.1":"105.0.5187.0","21.0.0-alpha.2":"105.0.5187.0","21.0.0-alpha.3":"105.0.5187.0","21.0.0-alpha.4":"105.0.5187.0","21.0.0-alpha.5":"105.0.5187.0","21.0.0-alpha.6":"106.0.5216.0","21.0.0-beta.1":"106.0.5216.0","21.0.0-beta.2":"106.0.5216.0","21.0.0-beta.3":"106.0.5216.0","21.0.0-beta.4":"106.0.5216.0","21.0.0-beta.5":"106.0.5216.0","21.0.0-beta.6":"106.0.5249.40","21.0.0-beta.7":"106.0.5249.40","21.0.0-beta.8":"106.0.5249.40","21.0.0-nightly.20220526":"103.0.5044.0","21.0.0-nightly.20220527":"103.0.5044.0","21.0.0-nightly.20220530":"103.0.5044.0","21.0.0-nightly.20220531":"103.0.5044.0","21.0.0-nightly.20220602":"104.0.5073.0","21.0.0-nightly.20220603":"104.0.5073.0","21.0.0-nightly.20220606":"104.0.5073.0","21.0.0-nightly.20220607":"104.0.5073.0","21.0.0-nightly.20220608":"104.0.5073.0","21.0.0-nightly.20220609":"104.0.5073.0","21.0.0-nightly.20220610":"104.0.5073.0","21.0.0-nightly.20220613":"104.0.5073.0","21.0.0-nightly.20220614":"104.0.5073.0","21.0.0-nightly.20220615":"104.0.5073.0","21.0.0-nightly.20220616":"104.0.5073.0","21.0.0-nightly.20220617":"104.0.5073.0","21.0.0-nightly.20220620":"104.0.5073.0","21.0.0-nightly.20220621":"104.0.5073.0","21.0.0-nightly.20220622":"104.0.5073.0","21.0.0-nightly.20220623":"104.0.5073.0","21.0.0-nightly.20220624":"104.0.5073.0","21.0.0-nightly.20220627":"104.0.5073.0","21.0.0-nightly.20220628":"105.0.5129.0","21.0.0-nightly.20220629":"105.0.5129.0","21.0.0-nightly.20220630":"105.0.5129.0","21.0.0-nightly.20220701":"105.0.5129.0","21.0.0-nightly.20220704":"105.0.5129.0","21.0.0-nightly.20220705":"105.0.5129.0","21.0.0-nightly.20220706":"105.0.5129.0","21.0.0-nightly.20220707":"105.0.5129.0","21.0.0-nightly.20220708":"105.0.5129.0","21.0.0-nightly.20220711":"105.0.5129.0","21.0.0-nightly.20220712":"105.0.5129.0","21.0.0-nightly.20220713":"105.0.5129.0","21.0.0-nightly.20220715":"105.0.5173.0","21.0.0-nightly.20220718":"105.0.5173.0","21.0.0-nightly.20220719":"105.0.5173.0","21.0.0-nightly.20220720":"105.0.5187.0","21.0.0-nightly.20220721":"105.0.5187.0","21.0.0-nightly.20220722":"105.0.5187.0","21.0.0-nightly.20220725":"105.0.5187.0","21.0.0-nightly.20220726":"105.0.5187.0","21.0.0-nightly.20220727":"105.0.5187.0","21.0.0-nightly.20220728":"105.0.5187.0","21.0.0-nightly.20220801":"105.0.5187.0","21.0.0-nightly.20220802":"105.0.5187.0","21.0.0":"106.0.5249.51","21.0.1":"106.0.5249.61","21.1.0":"106.0.5249.91","21.1.1":"106.0.5249.103","21.2.0":"106.0.5249.119","21.2.1":"106.0.5249.165","21.2.2":"106.0.5249.168","21.2.3":"106.0.5249.168","21.3.0":"106.0.5249.181","21.3.1":"106.0.5249.181","21.3.3":"106.0.5249.199","21.3.4":"106.0.5249.199","21.3.5":"106.0.5249.199","21.4.0":"106.0.5249.199","21.4.1":"106.0.5249.199","21.4.2":"106.0.5249.199","21.4.3":"106.0.5249.199","21.4.4":"106.0.5249.199","22.0.0-alpha.1":"107.0.5286.0","22.0.0-alpha.3":"108.0.5329.0","22.0.0-alpha.4":"108.0.5329.0","22.0.0-alpha.5":"108.0.5329.0","22.0.0-alpha.6":"108.0.5329.0","22.0.0-alpha.7":"108.0.5355.0","22.0.0-alpha.8":"108.0.5359.10","22.0.0-beta.1":"108.0.5359.10","22.0.0-beta.2":"108.0.5359.10","22.0.0-beta.3":"108.0.5359.10","22.0.0-beta.4":"108.0.5359.29","22.0.0-beta.5":"108.0.5359.40","22.0.0-beta.6":"108.0.5359.40","22.0.0-beta.7":"108.0.5359.48","22.0.0-beta.8":"108.0.5359.48","22.0.0-nightly.20220808":"105.0.5187.0","22.0.0-nightly.20220809":"105.0.5187.0","22.0.0-nightly.20220810":"105.0.5187.0","22.0.0-nightly.20220811":"105.0.5187.0","22.0.0-nightly.20220812":"105.0.5187.0","22.0.0-nightly.20220815":"105.0.5187.0","22.0.0-nightly.20220816":"105.0.5187.0","22.0.0-nightly.20220817":"105.0.5187.0","22.0.0-nightly.20220822":"106.0.5216.0","22.0.0-nightly.20220823":"106.0.5216.0","22.0.0-nightly.20220824":"106.0.5216.0","22.0.0-nightly.20220825":"106.0.5216.0","22.0.0-nightly.20220829":"106.0.5216.0","22.0.0-nightly.20220830":"106.0.5216.0","22.0.0-nightly.20220831":"106.0.5216.0","22.0.0-nightly.20220901":"106.0.5216.0","22.0.0-nightly.20220902":"106.0.5216.0","22.0.0-nightly.20220905":"106.0.5216.0","22.0.0-nightly.20220908":"107.0.5274.0","22.0.0-nightly.20220909":"107.0.5286.0","22.0.0-nightly.20220912":"107.0.5286.0","22.0.0-nightly.20220913":"107.0.5286.0","22.0.0-nightly.20220914":"107.0.5286.0","22.0.0-nightly.20220915":"107.0.5286.0","22.0.0-nightly.20220916":"107.0.5286.0","22.0.0-nightly.20220919":"107.0.5286.0","22.0.0-nightly.20220920":"107.0.5286.0","22.0.0-nightly.20220921":"107.0.5286.0","22.0.0-nightly.20220922":"107.0.5286.0","22.0.0-nightly.20220923":"107.0.5286.0","22.0.0-nightly.20220926":"107.0.5286.0","22.0.0-nightly.20220927":"107.0.5286.0","22.0.0-nightly.20220928":"107.0.5286.0","22.0.0":"108.0.5359.62","22.0.1":"108.0.5359.125","22.0.2":"108.0.5359.179","22.0.3":"108.0.5359.179","22.1.0":"108.0.5359.179","22.2.0":"108.0.5359.215","22.2.1":"108.0.5359.215","22.3.0":"108.0.5359.215","22.3.1":"108.0.5359.215","22.3.2":"108.0.5359.215","22.3.3":"108.0.5359.215","22.3.4":"108.0.5359.215","22.3.5":"108.0.5359.215","22.3.6":"108.0.5359.215","22.3.7":"108.0.5359.215","22.3.8":"108.0.5359.215","22.3.9":"108.0.5359.215","22.3.10":"108.0.5359.215","22.3.11":"108.0.5359.215","22.3.12":"108.0.5359.215","22.3.13":"108.0.5359.215","22.3.14":"108.0.5359.215","22.3.15":"108.0.5359.215","22.3.16":"108.0.5359.215","22.3.17":"108.0.5359.215","22.3.18":"108.0.5359.215","22.3.20":"108.0.5359.215","22.3.21":"108.0.5359.215","22.3.22":"108.0.5359.215","22.3.23":"108.0.5359.215","23.0.0-alpha.1":"110.0.5415.0","23.0.0-alpha.2":"110.0.5451.0","23.0.0-alpha.3":"110.0.5451.0","23.0.0-beta.1":"110.0.5478.5","23.0.0-beta.2":"110.0.5478.5","23.0.0-beta.3":"110.0.5478.5","23.0.0-beta.4":"110.0.5481.30","23.0.0-beta.5":"110.0.5481.38","23.0.0-beta.6":"110.0.5481.52","23.0.0-beta.8":"110.0.5481.52","23.0.0-nightly.20220929":"107.0.5286.0","23.0.0-nightly.20220930":"107.0.5286.0","23.0.0-nightly.20221003":"107.0.5286.0","23.0.0-nightly.20221004":"108.0.5329.0","23.0.0-nightly.20221005":"108.0.5329.0","23.0.0-nightly.20221006":"108.0.5329.0","23.0.0-nightly.20221007":"108.0.5329.0","23.0.0-nightly.20221010":"108.0.5329.0","23.0.0-nightly.20221011":"108.0.5329.0","23.0.0-nightly.20221012":"108.0.5329.0","23.0.0-nightly.20221013":"108.0.5329.0","23.0.0-nightly.20221014":"108.0.5329.0","23.0.0-nightly.20221017":"108.0.5329.0","23.0.0-nightly.20221018":"108.0.5355.0","23.0.0-nightly.20221019":"108.0.5355.0","23.0.0-nightly.20221020":"108.0.5355.0","23.0.0-nightly.20221021":"108.0.5355.0","23.0.0-nightly.20221024":"108.0.5355.0","23.0.0-nightly.20221026":"108.0.5355.0","23.0.0-nightly.20221027":"109.0.5382.0","23.0.0-nightly.20221028":"109.0.5382.0","23.0.0-nightly.20221031":"109.0.5382.0","23.0.0-nightly.20221101":"109.0.5382.0","23.0.0-nightly.20221102":"109.0.5382.0","23.0.0-nightly.20221103":"109.0.5382.0","23.0.0-nightly.20221104":"109.0.5382.0","23.0.0-nightly.20221107":"109.0.5382.0","23.0.0-nightly.20221108":"109.0.5382.0","23.0.0-nightly.20221109":"109.0.5382.0","23.0.0-nightly.20221110":"109.0.5382.0","23.0.0-nightly.20221111":"109.0.5382.0","23.0.0-nightly.20221114":"109.0.5382.0","23.0.0-nightly.20221115":"109.0.5382.0","23.0.0-nightly.20221116":"109.0.5382.0","23.0.0-nightly.20221117":"109.0.5382.0","23.0.0-nightly.20221118":"110.0.5415.0","23.0.0-nightly.20221121":"110.0.5415.0","23.0.0-nightly.20221122":"110.0.5415.0","23.0.0-nightly.20221123":"110.0.5415.0","23.0.0-nightly.20221124":"110.0.5415.0","23.0.0-nightly.20221125":"110.0.5415.0","23.0.0-nightly.20221128":"110.0.5415.0","23.0.0-nightly.20221129":"110.0.5415.0","23.0.0-nightly.20221130":"110.0.5415.0","23.0.0":"110.0.5481.77","23.1.0":"110.0.5481.100","23.1.1":"110.0.5481.104","23.1.2":"110.0.5481.177","23.1.3":"110.0.5481.179","23.1.4":"110.0.5481.192","23.2.0":"110.0.5481.192","23.2.1":"110.0.5481.208","23.2.2":"110.0.5481.208","23.2.3":"110.0.5481.208","23.2.4":"110.0.5481.208","23.3.0":"110.0.5481.208","23.3.1":"110.0.5481.208","23.3.2":"110.0.5481.208","23.3.3":"110.0.5481.208","23.3.4":"110.0.5481.208","23.3.5":"110.0.5481.208","23.3.6":"110.0.5481.208","23.3.7":"110.0.5481.208","23.3.8":"110.0.5481.208","23.3.9":"110.0.5481.208","23.3.10":"110.0.5481.208","23.3.11":"110.0.5481.208","23.3.12":"110.0.5481.208","23.3.13":"110.0.5481.208","24.0.0-alpha.1":"111.0.5560.0","24.0.0-alpha.2":"111.0.5560.0","24.0.0-alpha.3":"111.0.5560.0","24.0.0-alpha.4":"111.0.5560.0","24.0.0-alpha.5":"111.0.5560.0","24.0.0-alpha.6":"111.0.5560.0","24.0.0-alpha.7":"111.0.5560.0","24.0.0-beta.1":"111.0.5563.50","24.0.0-beta.2":"111.0.5563.50","24.0.0-beta.3":"112.0.5615.20","24.0.0-beta.4":"112.0.5615.20","24.0.0-beta.5":"112.0.5615.29","24.0.0-beta.6":"112.0.5615.39","24.0.0-beta.7":"112.0.5615.39","24.0.0-nightly.20221201":"110.0.5415.0","24.0.0-nightly.20221202":"110.0.5415.0","24.0.0-nightly.20221205":"110.0.5415.0","24.0.0-nightly.20221206":"110.0.5451.0","24.0.0-nightly.20221207":"110.0.5451.0","24.0.0-nightly.20221208":"110.0.5451.0","24.0.0-nightly.20221213":"110.0.5451.0","24.0.0-nightly.20221214":"110.0.5451.0","24.0.0-nightly.20221215":"110.0.5451.0","24.0.0-nightly.20221216":"110.0.5451.0","24.0.0-nightly.20230109":"111.0.5518.0","24.0.0-nightly.20230110":"111.0.5518.0","24.0.0-nightly.20230111":"111.0.5518.0","24.0.0-nightly.20230112":"111.0.5518.0","24.0.0-nightly.20230113":"111.0.5518.0","24.0.0-nightly.20230116":"111.0.5518.0","24.0.0-nightly.20230117":"111.0.5518.0","24.0.0-nightly.20230118":"111.0.5518.0","24.0.0-nightly.20230119":"111.0.5518.0","24.0.0-nightly.20230120":"111.0.5518.0","24.0.0-nightly.20230123":"111.0.5518.0","24.0.0-nightly.20230124":"111.0.5518.0","24.0.0-nightly.20230125":"111.0.5518.0","24.0.0-nightly.20230126":"111.0.5518.0","24.0.0-nightly.20230127":"111.0.5518.0","24.0.0-nightly.20230131":"111.0.5518.0","24.0.0-nightly.20230201":"111.0.5518.0","24.0.0-nightly.20230202":"111.0.5518.0","24.0.0-nightly.20230203":"111.0.5560.0","24.0.0-nightly.20230206":"111.0.5560.0","24.0.0-nightly.20230207":"111.0.5560.0","24.0.0-nightly.20230208":"111.0.5560.0","24.0.0-nightly.20230209":"111.0.5560.0","24.0.0":"112.0.5615.49","24.1.0":"112.0.5615.50","24.1.1":"112.0.5615.50","24.1.2":"112.0.5615.87","24.1.3":"112.0.5615.165","24.2.0":"112.0.5615.165","24.3.0":"112.0.5615.165","24.3.1":"112.0.5615.183","24.4.0":"112.0.5615.204","24.4.1":"112.0.5615.204","24.5.0":"112.0.5615.204","24.5.1":"112.0.5615.204","24.6.0":"112.0.5615.204","24.6.1":"112.0.5615.204","24.6.2":"112.0.5615.204","24.6.3":"112.0.5615.204","24.6.4":"112.0.5615.204","24.6.5":"112.0.5615.204","24.7.0":"112.0.5615.204","24.7.1":"112.0.5615.204","24.8.0":"112.0.5615.204","24.8.1":"112.0.5615.204","24.8.2":"112.0.5615.204","25.0.0-alpha.1":"114.0.5694.0","25.0.0-alpha.2":"114.0.5694.0","25.0.0-alpha.3":"114.0.5710.0","25.0.0-alpha.4":"114.0.5710.0","25.0.0-alpha.5":"114.0.5719.0","25.0.0-alpha.6":"114.0.5719.0","25.0.0-beta.1":"114.0.5719.0","25.0.0-beta.2":"114.0.5719.0","25.0.0-beta.3":"114.0.5719.0","25.0.0-beta.4":"114.0.5735.16","25.0.0-beta.5":"114.0.5735.16","25.0.0-beta.6":"114.0.5735.16","25.0.0-beta.7":"114.0.5735.16","25.0.0-beta.8":"114.0.5735.35","25.0.0-beta.9":"114.0.5735.45","25.0.0-nightly.20230210":"111.0.5560.0","25.0.0-nightly.20230214":"111.0.5560.0","25.0.0-nightly.20230215":"111.0.5560.0","25.0.0-nightly.20230216":"111.0.5560.0","25.0.0-nightly.20230217":"111.0.5560.0","25.0.0-nightly.20230220":"111.0.5560.0","25.0.0-nightly.20230221":"111.0.5560.0","25.0.0-nightly.20230222":"111.0.5560.0","25.0.0-nightly.20230223":"111.0.5560.0","25.0.0-nightly.20230224":"111.0.5560.0","25.0.0-nightly.20230227":"111.0.5560.0","25.0.0-nightly.20230228":"111.0.5560.0","25.0.0-nightly.20230301":"111.0.5560.0","25.0.0-nightly.20230302":"111.0.5560.0","25.0.0-nightly.20230303":"111.0.5560.0","25.0.0-nightly.20230306":"111.0.5560.0","25.0.0-nightly.20230307":"111.0.5560.0","25.0.0-nightly.20230308":"111.0.5560.0","25.0.0-nightly.20230309":"111.0.5560.0","25.0.0-nightly.20230310":"111.0.5560.0","25.0.0-nightly.20230314":"113.0.5636.0","25.0.0-nightly.20230315":"113.0.5651.0","25.0.0-nightly.20230317":"113.0.5653.0","25.0.0-nightly.20230320":"113.0.5660.0","25.0.0-nightly.20230321":"113.0.5664.0","25.0.0-nightly.20230322":"113.0.5666.0","25.0.0-nightly.20230323":"113.0.5668.0","25.0.0-nightly.20230324":"113.0.5670.0","25.0.0-nightly.20230327":"113.0.5670.0","25.0.0-nightly.20230328":"113.0.5670.0","25.0.0-nightly.20230329":"113.0.5670.0","25.0.0-nightly.20230330":"113.0.5670.0","25.0.0-nightly.20230331":"114.0.5684.0","25.0.0-nightly.20230403":"114.0.5684.0","25.0.0-nightly.20230404":"114.0.5692.0","25.0.0-nightly.20230405":"114.0.5694.0","25.0.0":"114.0.5735.45","25.0.1":"114.0.5735.45","25.1.0":"114.0.5735.106","25.1.1":"114.0.5735.106","25.2.0":"114.0.5735.134","25.3.0":"114.0.5735.199","25.3.1":"114.0.5735.243","25.3.2":"114.0.5735.248","25.4.0":"114.0.5735.248","25.5.0":"114.0.5735.289","25.6.0":"114.0.5735.289","25.7.0":"114.0.5735.289","25.8.0":"114.0.5735.289","26.0.0-alpha.1":"116.0.5791.0","26.0.0-alpha.2":"116.0.5791.0","26.0.0-alpha.3":"116.0.5791.0","26.0.0-alpha.4":"116.0.5791.0","26.0.0-alpha.5":"116.0.5791.0","26.0.0-alpha.6":"116.0.5815.0","26.0.0-alpha.7":"116.0.5831.0","26.0.0-alpha.8":"116.0.5845.0","26.0.0-beta.1":"116.0.5845.0","26.0.0-beta.2":"116.0.5845.14","26.0.0-beta.3":"116.0.5845.14","26.0.0-beta.4":"116.0.5845.14","26.0.0-beta.5":"116.0.5845.14","26.0.0-beta.6":"116.0.5845.14","26.0.0-beta.7":"116.0.5845.14","26.0.0-beta.8":"116.0.5845.42","26.0.0-beta.9":"116.0.5845.42","26.0.0-beta.10":"116.0.5845.49","26.0.0-beta.11":"116.0.5845.49","26.0.0-beta.12":"116.0.5845.62","26.0.0-nightly.20230406":"114.0.5694.0","26.0.0-nightly.20230407":"114.0.5694.0","26.0.0-nightly.20230410":"114.0.5694.0","26.0.0-nightly.20230411":"114.0.5694.0","26.0.0-nightly.20230412":"114.0.5708.0","26.0.0-nightly.20230413":"114.0.5710.0","26.0.0-nightly.20230414":"114.0.5710.0","26.0.0-nightly.20230417":"114.0.5710.0","26.0.0-nightly.20230418":"114.0.5715.0","26.0.0-nightly.20230421":"114.0.5719.0","26.0.0-nightly.20230424":"114.0.5719.0","26.0.0-nightly.20230425":"114.0.5719.0","26.0.0-nightly.20230426":"114.0.5719.0","26.0.0-nightly.20230427":"114.0.5719.0","26.0.0-nightly.20230428":"114.0.5719.0","26.0.0-nightly.20230501":"114.0.5719.0","26.0.0-nightly.20230502":"114.0.5719.0","26.0.0-nightly.20230503":"114.0.5719.0","26.0.0-nightly.20230504":"114.0.5719.0","26.0.0-nightly.20230505":"114.0.5719.0","26.0.0-nightly.20230508":"114.0.5719.0","26.0.0-nightly.20230509":"114.0.5719.0","26.0.0-nightly.20230510":"114.0.5719.0","26.0.0-nightly.20230511":"115.0.5760.0","26.0.0-nightly.20230512":"115.0.5760.0","26.0.0-nightly.20230515":"115.0.5760.0","26.0.0-nightly.20230516":"115.0.5760.0","26.0.0-nightly.20230517":"115.0.5760.0","26.0.0-nightly.20230518":"115.0.5760.0","26.0.0-nightly.20230519":"115.0.5760.0","26.0.0-nightly.20230522":"115.0.5760.0","26.0.0-nightly.20230523":"115.0.5760.0","26.0.0-nightly.20230524":"115.0.5786.0","26.0.0-nightly.20230525":"115.0.5790.0","26.0.0-nightly.20230526":"116.0.5791.0","26.0.0-nightly.20230529":"116.0.5791.0","26.0.0-nightly.20230530":"116.0.5791.0","26.0.0-nightly.20230531":"116.0.5791.0","26.0.0":"116.0.5845.82","26.1.0":"116.0.5845.97","26.2.0":"116.0.5845.179","27.0.0-alpha.1":"118.0.5949.0","27.0.0-alpha.2":"118.0.5949.0","27.0.0-alpha.3":"118.0.5949.0","27.0.0-alpha.4":"118.0.5949.0","27.0.0-alpha.5":"118.0.5949.0","27.0.0-alpha.6":"118.0.5949.0","27.0.0-nightly.20230601":"116.0.5791.0","27.0.0-nightly.20230602":"116.0.5791.0","27.0.0-nightly.20230605":"116.0.5791.0","27.0.0-nightly.20230606":"116.0.5791.0","27.0.0-nightly.20230607":"116.0.5791.0","27.0.0-nightly.20230609":"116.0.5791.0","27.0.0-nightly.20230612":"116.0.5815.0","27.0.0-nightly.20230613":"116.0.5815.0","27.0.0-nightly.20230614":"116.0.5829.0","27.0.0-nightly.20230615":"116.0.5831.0","27.0.0-nightly.20230616":"116.0.5833.0","27.0.0-nightly.20230619":"116.0.5833.0","27.0.0-nightly.20230620":"116.0.5833.0","27.0.0-nightly.20230621":"116.0.5833.0","27.0.0-nightly.20230622":"116.0.5845.0","27.0.0-nightly.20230623":"116.0.5845.0","27.0.0-nightly.20230626":"116.0.5845.0","27.0.0-nightly.20230627":"116.0.5845.0","27.0.0-nightly.20230628":"116.0.5845.0","27.0.0-nightly.20230629":"116.0.5845.0","27.0.0-nightly.20230630":"116.0.5845.0","27.0.0-nightly.20230703":"117.0.5852.0","27.0.0-nightly.20230704":"117.0.5852.0","27.0.0-nightly.20230705":"117.0.5852.0","27.0.0-nightly.20230706":"117.0.5852.0","27.0.0-nightly.20230707":"117.0.5852.0","27.0.0-nightly.20230710":"117.0.5852.0","27.0.0-nightly.20230711":"117.0.5852.0","27.0.0-nightly.20230712":"117.0.5852.0","27.0.0-nightly.20230713":"117.0.5852.0","27.0.0-nightly.20230714":"117.0.5852.0","27.0.0-nightly.20230717":"117.0.5884.1","27.0.0-nightly.20230718":"117.0.5884.1","27.0.0-nightly.20230719":"117.0.5892.0","27.0.0-nightly.20230720":"117.0.5897.0","27.0.0-nightly.20230721":"117.0.5897.0","27.0.0-nightly.20230724":"117.0.5897.0","27.0.0-nightly.20230725":"117.0.5897.0","27.0.0-nightly.20230726":"117.0.5897.0","27.0.0-nightly.20230727":"117.0.5897.0","27.0.0-nightly.20230728":"117.0.5897.0","27.0.0-nightly.20230731":"117.0.5897.0","27.0.0-nightly.20230801":"117.0.5911.0","27.0.0-nightly.20230802":"117.0.5911.0","27.0.0-nightly.20230803":"117.0.5911.0","27.0.0-nightly.20230804":"117.0.5921.0","27.0.0-nightly.20230807":"117.0.5921.0","27.0.0-nightly.20230808":"117.0.5921.0","27.0.0-nightly.20230814":"117.0.5921.0","27.0.0-nightly.20230815":"117.0.5921.0","27.0.0-nightly.20230816":"118.0.5949.0","28.0.0-nightly.20230817":"118.0.5949.0","28.0.0-nightly.20230818":"118.0.5949.0","28.0.0-nightly.20230821":"118.0.5949.0","28.0.0-nightly.20230822":"118.0.5949.0","28.0.0-nightly.20230823":"118.0.5949.0","28.0.0-nightly.20230824":"118.0.5949.0","28.0.0-nightly.20230825":"118.0.5949.0","28.0.0-nightly.20230828":"118.0.5949.0","28.0.0-nightly.20230829":"118.0.5949.0","28.0.0-nightly.20230830":"118.0.5949.0","28.0.0-nightly.20230831":"118.0.5949.0","28.0.0-nightly.20230906":"118.0.5991.0","28.0.0-nightly.20230907":"118.0.5993.0","28.0.0-nightly.20230908":"118.0.5993.0"}
\ No newline at end of file
+{"0.20.0":"39.0.2171.65","0.20.1":"39.0.2171.65","0.20.2":"39.0.2171.65","0.20.3":"39.0.2171.65","0.20.4":"39.0.2171.65","0.20.5":"39.0.2171.65","0.20.6":"39.0.2171.65","0.20.7":"39.0.2171.65","0.20.8":"39.0.2171.65","0.21.0":"40.0.2214.91","0.21.1":"40.0.2214.91","0.21.2":"40.0.2214.91","0.21.3":"41.0.2272.76","0.22.1":"41.0.2272.76","0.22.2":"41.0.2272.76","0.22.3":"41.0.2272.76","0.23.0":"41.0.2272.76","0.24.0":"41.0.2272.76","0.25.0":"42.0.2311.107","0.25.1":"42.0.2311.107","0.25.2":"42.0.2311.107","0.25.3":"42.0.2311.107","0.26.0":"42.0.2311.107","0.26.1":"42.0.2311.107","0.27.0":"42.0.2311.107","0.27.1":"42.0.2311.107","0.27.2":"43.0.2357.65","0.27.3":"43.0.2357.65","0.28.0":"43.0.2357.65","0.28.1":"43.0.2357.65","0.28.2":"43.0.2357.65","0.28.3":"43.0.2357.65","0.29.1":"43.0.2357.65","0.29.2":"43.0.2357.65","0.30.4":"44.0.2403.125","0.31.0":"44.0.2403.125","0.31.2":"45.0.2454.85","0.32.2":"45.0.2454.85","0.32.3":"45.0.2454.85","0.33.0":"45.0.2454.85","0.33.1":"45.0.2454.85","0.33.2":"45.0.2454.85","0.33.3":"45.0.2454.85","0.33.4":"45.0.2454.85","0.33.6":"45.0.2454.85","0.33.7":"45.0.2454.85","0.33.8":"45.0.2454.85","0.33.9":"45.0.2454.85","0.34.0":"45.0.2454.85","0.34.1":"45.0.2454.85","0.34.2":"45.0.2454.85","0.34.3":"45.0.2454.85","0.34.4":"45.0.2454.85","0.35.1":"45.0.2454.85","0.35.2":"45.0.2454.85","0.35.3":"45.0.2454.85","0.35.4":"45.0.2454.85","0.35.5":"45.0.2454.85","0.36.0":"47.0.2526.73","0.36.2":"47.0.2526.73","0.36.3":"47.0.2526.73","0.36.4":"47.0.2526.73","0.36.5":"47.0.2526.110","0.36.6":"47.0.2526.110","0.36.7":"47.0.2526.110","0.36.8":"47.0.2526.110","0.36.9":"47.0.2526.110","0.36.10":"47.0.2526.110","0.36.11":"47.0.2526.110","0.36.12":"47.0.2526.110","0.37.0":"49.0.2623.75","0.37.1":"49.0.2623.75","0.37.3":"49.0.2623.75","0.37.4":"49.0.2623.75","0.37.5":"49.0.2623.75","0.37.6":"49.0.2623.75","0.37.7":"49.0.2623.75","0.37.8":"49.0.2623.75","1.0.0":"49.0.2623.75","1.0.1":"49.0.2623.75","1.0.2":"49.0.2623.75","1.1.0":"50.0.2661.102","1.1.1":"50.0.2661.102","1.1.2":"50.0.2661.102","1.1.3":"50.0.2661.102","1.2.0":"51.0.2704.63","1.2.1":"51.0.2704.63","1.2.2":"51.0.2704.84","1.2.3":"51.0.2704.84","1.2.4":"51.0.2704.103","1.2.5":"51.0.2704.103","1.2.6":"51.0.2704.106","1.2.7":"51.0.2704.106","1.2.8":"51.0.2704.106","1.3.0":"52.0.2743.82","1.3.1":"52.0.2743.82","1.3.2":"52.0.2743.82","1.3.3":"52.0.2743.82","1.3.4":"52.0.2743.82","1.3.5":"52.0.2743.82","1.3.6":"52.0.2743.82","1.3.7":"52.0.2743.82","1.3.9":"52.0.2743.82","1.3.10":"52.0.2743.82","1.3.13":"52.0.2743.82","1.3.14":"52.0.2743.82","1.3.15":"52.0.2743.82","1.4.0":"53.0.2785.113","1.4.1":"53.0.2785.113","1.4.2":"53.0.2785.113","1.4.3":"53.0.2785.113","1.4.4":"53.0.2785.113","1.4.5":"53.0.2785.113","1.4.6":"53.0.2785.143","1.4.7":"53.0.2785.143","1.4.8":"53.0.2785.143","1.4.10":"53.0.2785.143","1.4.11":"53.0.2785.143","1.4.12":"54.0.2840.51","1.4.13":"53.0.2785.143","1.4.14":"53.0.2785.143","1.4.15":"53.0.2785.143","1.4.16":"53.0.2785.143","1.5.0":"54.0.2840.101","1.5.1":"54.0.2840.101","1.6.0":"56.0.2924.87","1.6.1":"56.0.2924.87","1.6.2":"56.0.2924.87","1.6.3":"56.0.2924.87","1.6.4":"56.0.2924.87","1.6.5":"56.0.2924.87","1.6.6":"56.0.2924.87","1.6.7":"56.0.2924.87","1.6.8":"56.0.2924.87","1.6.9":"56.0.2924.87","1.6.10":"56.0.2924.87","1.6.11":"56.0.2924.87","1.6.12":"56.0.2924.87","1.6.13":"56.0.2924.87","1.6.14":"56.0.2924.87","1.6.15":"56.0.2924.87","1.6.16":"56.0.2924.87","1.6.17":"56.0.2924.87","1.6.18":"56.0.2924.87","1.7.0":"58.0.3029.110","1.7.1":"58.0.3029.110","1.7.2":"58.0.3029.110","1.7.3":"58.0.3029.110","1.7.4":"58.0.3029.110","1.7.5":"58.0.3029.110","1.7.6":"58.0.3029.110","1.7.7":"58.0.3029.110","1.7.8":"58.0.3029.110","1.7.9":"58.0.3029.110","1.7.10":"58.0.3029.110","1.7.11":"58.0.3029.110","1.7.12":"58.0.3029.110","1.7.13":"58.0.3029.110","1.7.14":"58.0.3029.110","1.7.15":"58.0.3029.110","1.7.16":"58.0.3029.110","1.8.0":"59.0.3071.115","1.8.1":"59.0.3071.115","1.8.2-beta.1":"59.0.3071.115","1.8.2-beta.2":"59.0.3071.115","1.8.2-beta.3":"59.0.3071.115","1.8.2-beta.4":"59.0.3071.115","1.8.2-beta.5":"59.0.3071.115","1.8.2":"59.0.3071.115","1.8.3":"59.0.3071.115","1.8.4":"59.0.3071.115","1.8.5":"59.0.3071.115","1.8.6":"59.0.3071.115","1.8.7":"59.0.3071.115","1.8.8":"59.0.3071.115","2.0.0-beta.1":"61.0.3163.100","2.0.0-beta.2":"61.0.3163.100","2.0.0-beta.3":"61.0.3163.100","2.0.0-beta.4":"61.0.3163.100","2.0.0-beta.5":"61.0.3163.100","2.0.0-beta.6":"61.0.3163.100","2.0.0-beta.7":"61.0.3163.100","2.0.0-beta.8":"61.0.3163.100","2.0.0":"61.0.3163.100","2.0.1":"61.0.3163.100","2.0.2":"61.0.3163.100","2.0.3":"61.0.3163.100","2.0.4":"61.0.3163.100","2.0.5":"61.0.3163.100","2.0.6":"61.0.3163.100","2.0.7":"61.0.3163.100","2.0.8-nightly.20180819":"61.0.3163.100","2.0.8-nightly.20180820":"61.0.3163.100","2.0.8":"61.0.3163.100","2.0.9":"61.0.3163.100","2.0.10":"61.0.3163.100","2.0.11":"61.0.3163.100","2.0.12":"61.0.3163.100","2.0.13":"61.0.3163.100","2.0.14":"61.0.3163.100","2.0.15":"61.0.3163.100","2.0.16":"61.0.3163.100","2.0.17":"61.0.3163.100","2.0.18":"61.0.3163.100","2.1.0-unsupported.20180809":"61.0.3163.100","3.0.0-beta.1":"66.0.3359.181","3.0.0-beta.2":"66.0.3359.181","3.0.0-beta.3":"66.0.3359.181","3.0.0-beta.4":"66.0.3359.181","3.0.0-beta.5":"66.0.3359.181","3.0.0-beta.6":"66.0.3359.181","3.0.0-beta.7":"66.0.3359.181","3.0.0-beta.8":"66.0.3359.181","3.0.0-beta.9":"66.0.3359.181","3.0.0-beta.10":"66.0.3359.181","3.0.0-beta.11":"66.0.3359.181","3.0.0-beta.12":"66.0.3359.181","3.0.0-beta.13":"66.0.3359.181","3.0.0-nightly.20180818":"66.0.3359.181","3.0.0-nightly.20180821":"66.0.3359.181","3.0.0-nightly.20180823":"66.0.3359.181","3.0.0-nightly.20180904":"66.0.3359.181","3.0.0":"66.0.3359.181","3.0.1":"66.0.3359.181","3.0.2":"66.0.3359.181","3.0.3":"66.0.3359.181","3.0.4":"66.0.3359.181","3.0.5":"66.0.3359.181","3.0.6":"66.0.3359.181","3.0.7":"66.0.3359.181","3.0.8":"66.0.3359.181","3.0.9":"66.0.3359.181","3.0.10":"66.0.3359.181","3.0.11":"66.0.3359.181","3.0.12":"66.0.3359.181","3.0.13":"66.0.3359.181","3.0.14":"66.0.3359.181","3.0.15":"66.0.3359.181","3.0.16":"66.0.3359.181","3.1.0-beta.1":"66.0.3359.181","3.1.0-beta.2":"66.0.3359.181","3.1.0-beta.3":"66.0.3359.181","3.1.0-beta.4":"66.0.3359.181","3.1.0-beta.5":"66.0.3359.181","3.1.0":"66.0.3359.181","3.1.1":"66.0.3359.181","3.1.2":"66.0.3359.181","3.1.3":"66.0.3359.181","3.1.4":"66.0.3359.181","3.1.5":"66.0.3359.181","3.1.6":"66.0.3359.181","3.1.7":"66.0.3359.181","3.1.8":"66.0.3359.181","3.1.9":"66.0.3359.181","3.1.10":"66.0.3359.181","3.1.11":"66.0.3359.181","3.1.12":"66.0.3359.181","3.1.13":"66.0.3359.181","4.0.0-beta.1":"69.0.3497.106","4.0.0-beta.2":"69.0.3497.106","4.0.0-beta.3":"69.0.3497.106","4.0.0-beta.4":"69.0.3497.106","4.0.0-beta.5":"69.0.3497.106","4.0.0-beta.6":"69.0.3497.106","4.0.0-beta.7":"69.0.3497.106","4.0.0-beta.8":"69.0.3497.106","4.0.0-beta.9":"69.0.3497.106","4.0.0-beta.10":"69.0.3497.106","4.0.0-beta.11":"69.0.3497.106","4.0.0-nightly.20180817":"66.0.3359.181","4.0.0-nightly.20180819":"66.0.3359.181","4.0.0-nightly.20180821":"66.0.3359.181","4.0.0-nightly.20180929":"67.0.3396.99","4.0.0-nightly.20181006":"68.0.3440.128","4.0.0-nightly.20181010":"69.0.3497.106","4.0.0":"69.0.3497.106","4.0.1":"69.0.3497.106","4.0.2":"69.0.3497.106","4.0.3":"69.0.3497.106","4.0.4":"69.0.3497.106","4.0.5":"69.0.3497.106","4.0.6":"69.0.3497.106","4.0.7":"69.0.3497.128","4.0.8":"69.0.3497.128","4.1.0":"69.0.3497.128","4.1.1":"69.0.3497.128","4.1.2":"69.0.3497.128","4.1.3":"69.0.3497.128","4.1.4":"69.0.3497.128","4.1.5":"69.0.3497.128","4.2.0":"69.0.3497.128","4.2.1":"69.0.3497.128","4.2.2":"69.0.3497.128","4.2.3":"69.0.3497.128","4.2.4":"69.0.3497.128","4.2.5":"69.0.3497.128","4.2.6":"69.0.3497.128","4.2.7":"69.0.3497.128","4.2.8":"69.0.3497.128","4.2.9":"69.0.3497.128","4.2.10":"69.0.3497.128","4.2.11":"69.0.3497.128","4.2.12":"69.0.3497.128","5.0.0-beta.1":"72.0.3626.52","5.0.0-beta.2":"72.0.3626.52","5.0.0-beta.3":"73.0.3683.27","5.0.0-beta.4":"73.0.3683.54","5.0.0-beta.5":"73.0.3683.61","5.0.0-beta.6":"73.0.3683.84","5.0.0-beta.7":"73.0.3683.94","5.0.0-beta.8":"73.0.3683.104","5.0.0-beta.9":"73.0.3683.117","5.0.0-nightly.20190107":"70.0.3538.110","5.0.0-nightly.20190121":"71.0.3578.98","5.0.0-nightly.20190122":"71.0.3578.98","5.0.0":"73.0.3683.119","5.0.1":"73.0.3683.121","5.0.2":"73.0.3683.121","5.0.3":"73.0.3683.121","5.0.4":"73.0.3683.121","5.0.5":"73.0.3683.121","5.0.6":"73.0.3683.121","5.0.7":"73.0.3683.121","5.0.8":"73.0.3683.121","5.0.9":"73.0.3683.121","5.0.10":"73.0.3683.121","5.0.11":"73.0.3683.121","5.0.12":"73.0.3683.121","5.0.13":"73.0.3683.121","6.0.0-beta.1":"76.0.3774.1","6.0.0-beta.2":"76.0.3783.1","6.0.0-beta.3":"76.0.3783.1","6.0.0-beta.4":"76.0.3783.1","6.0.0-beta.5":"76.0.3805.4","6.0.0-beta.6":"76.0.3809.3","6.0.0-beta.7":"76.0.3809.22","6.0.0-beta.8":"76.0.3809.26","6.0.0-beta.9":"76.0.3809.26","6.0.0-beta.10":"76.0.3809.37","6.0.0-beta.11":"76.0.3809.42","6.0.0-beta.12":"76.0.3809.54","6.0.0-beta.13":"76.0.3809.60","6.0.0-beta.14":"76.0.3809.68","6.0.0-beta.15":"76.0.3809.74","6.0.0-nightly.20190123":"72.0.3626.52","6.0.0-nightly.20190212":"72.0.3626.107","6.0.0-nightly.20190213":"72.0.3626.110","6.0.0-nightly.20190311":"74.0.3724.8","6.0.0":"76.0.3809.88","6.0.1":"76.0.3809.102","6.0.2":"76.0.3809.110","6.0.3":"76.0.3809.126","6.0.4":"76.0.3809.131","6.0.5":"76.0.3809.136","6.0.6":"76.0.3809.138","6.0.7":"76.0.3809.139","6.0.8":"76.0.3809.146","6.0.9":"76.0.3809.146","6.0.10":"76.0.3809.146","6.0.11":"76.0.3809.146","6.0.12":"76.0.3809.146","6.1.0":"76.0.3809.146","6.1.1":"76.0.3809.146","6.1.2":"76.0.3809.146","6.1.3":"76.0.3809.146","6.1.4":"76.0.3809.146","6.1.5":"76.0.3809.146","6.1.6":"76.0.3809.146","6.1.7":"76.0.3809.146","6.1.8":"76.0.3809.146","6.1.9":"76.0.3809.146","6.1.10":"76.0.3809.146","6.1.11":"76.0.3809.146","6.1.12":"76.0.3809.146","7.0.0-beta.1":"78.0.3866.0","7.0.0-beta.2":"78.0.3866.0","7.0.0-beta.3":"78.0.3866.0","7.0.0-beta.4":"78.0.3896.6","7.0.0-beta.5":"78.0.3905.1","7.0.0-beta.6":"78.0.3905.1","7.0.0-beta.7":"78.0.3905.1","7.0.0-nightly.20190521":"76.0.3784.0","7.0.0-nightly.20190529":"76.0.3806.0","7.0.0-nightly.20190530":"76.0.3806.0","7.0.0-nightly.20190531":"76.0.3806.0","7.0.0-nightly.20190602":"76.0.3806.0","7.0.0-nightly.20190603":"76.0.3806.0","7.0.0-nightly.20190604":"77.0.3814.0","7.0.0-nightly.20190605":"77.0.3815.0","7.0.0-nightly.20190606":"77.0.3815.0","7.0.0-nightly.20190607":"77.0.3815.0","7.0.0-nightly.20190608":"77.0.3815.0","7.0.0-nightly.20190609":"77.0.3815.0","7.0.0-nightly.20190611":"77.0.3815.0","7.0.0-nightly.20190612":"77.0.3815.0","7.0.0-nightly.20190613":"77.0.3815.0","7.0.0-nightly.20190615":"77.0.3815.0","7.0.0-nightly.20190616":"77.0.3815.0","7.0.0-nightly.20190618":"77.0.3815.0","7.0.0-nightly.20190619":"77.0.3815.0","7.0.0-nightly.20190622":"77.0.3815.0","7.0.0-nightly.20190623":"77.0.3815.0","7.0.0-nightly.20190624":"77.0.3815.0","7.0.0-nightly.20190627":"77.0.3815.0","7.0.0-nightly.20190629":"77.0.3815.0","7.0.0-nightly.20190630":"77.0.3815.0","7.0.0-nightly.20190701":"77.0.3815.0","7.0.0-nightly.20190702":"77.0.3815.0","7.0.0-nightly.20190704":"77.0.3843.0","7.0.0-nightly.20190705":"77.0.3843.0","7.0.0-nightly.20190719":"77.0.3848.0","7.0.0-nightly.20190720":"77.0.3848.0","7.0.0-nightly.20190721":"77.0.3848.0","7.0.0-nightly.20190726":"77.0.3864.0","7.0.0-nightly.20190727":"78.0.3866.0","7.0.0-nightly.20190728":"78.0.3866.0","7.0.0-nightly.20190729":"78.0.3866.0","7.0.0-nightly.20190730":"78.0.3866.0","7.0.0-nightly.20190731":"78.0.3866.0","7.0.0":"78.0.3905.1","7.0.1":"78.0.3904.92","7.1.0":"78.0.3904.94","7.1.1":"78.0.3904.99","7.1.2":"78.0.3904.113","7.1.3":"78.0.3904.126","7.1.4":"78.0.3904.130","7.1.5":"78.0.3904.130","7.1.6":"78.0.3904.130","7.1.7":"78.0.3904.130","7.1.8":"78.0.3904.130","7.1.9":"78.0.3904.130","7.1.10":"78.0.3904.130","7.1.11":"78.0.3904.130","7.1.12":"78.0.3904.130","7.1.13":"78.0.3904.130","7.1.14":"78.0.3904.130","7.2.0":"78.0.3904.130","7.2.1":"78.0.3904.130","7.2.2":"78.0.3904.130","7.2.3":"78.0.3904.130","7.2.4":"78.0.3904.130","7.3.0":"78.0.3904.130","7.3.1":"78.0.3904.130","7.3.2":"78.0.3904.130","7.3.3":"78.0.3904.130","8.0.0-beta.1":"79.0.3931.0","8.0.0-beta.2":"79.0.3931.0","8.0.0-beta.3":"80.0.3955.0","8.0.0-beta.4":"80.0.3955.0","8.0.0-beta.5":"80.0.3987.14","8.0.0-beta.6":"80.0.3987.51","8.0.0-beta.7":"80.0.3987.59","8.0.0-beta.8":"80.0.3987.75","8.0.0-beta.9":"80.0.3987.75","8.0.0-nightly.20190801":"78.0.3866.0","8.0.0-nightly.20190802":"78.0.3866.0","8.0.0-nightly.20190803":"78.0.3871.0","8.0.0-nightly.20190806":"78.0.3871.0","8.0.0-nightly.20190807":"78.0.3871.0","8.0.0-nightly.20190808":"78.0.3871.0","8.0.0-nightly.20190809":"78.0.3871.0","8.0.0-nightly.20190810":"78.0.3871.0","8.0.0-nightly.20190811":"78.0.3871.0","8.0.0-nightly.20190812":"78.0.3871.0","8.0.0-nightly.20190813":"78.0.3871.0","8.0.0-nightly.20190814":"78.0.3871.0","8.0.0-nightly.20190815":"78.0.3871.0","8.0.0-nightly.20190816":"78.0.3881.0","8.0.0-nightly.20190817":"78.0.3881.0","8.0.0-nightly.20190818":"78.0.3881.0","8.0.0-nightly.20190819":"78.0.3881.0","8.0.0-nightly.20190820":"78.0.3881.0","8.0.0-nightly.20190824":"78.0.3892.0","8.0.0-nightly.20190825":"78.0.3892.0","8.0.0-nightly.20190827":"78.0.3892.0","8.0.0-nightly.20190828":"78.0.3892.0","8.0.0-nightly.20190830":"78.0.3892.0","8.0.0-nightly.20190901":"78.0.3892.0","8.0.0-nightly.20190902":"78.0.3892.0","8.0.0-nightly.20190907":"78.0.3892.0","8.0.0-nightly.20190909":"78.0.3892.0","8.0.0-nightly.20190910":"78.0.3892.0","8.0.0-nightly.20190911":"78.0.3892.0","8.0.0-nightly.20190912":"78.0.3892.0","8.0.0-nightly.20190913":"78.0.3892.0","8.0.0-nightly.20190914":"78.0.3892.0","8.0.0-nightly.20190915":"78.0.3892.0","8.0.0-nightly.20190917":"78.0.3892.0","8.0.0-nightly.20190919":"79.0.3915.0","8.0.0-nightly.20190920":"79.0.3915.0","8.0.0-nightly.20190922":"79.0.3919.0","8.0.0-nightly.20190923":"79.0.3919.0","8.0.0-nightly.20190924":"79.0.3919.0","8.0.0-nightly.20190926":"79.0.3919.0","8.0.0-nightly.20190928":"79.0.3919.0","8.0.0-nightly.20190929":"79.0.3919.0","8.0.0-nightly.20190930":"79.0.3919.0","8.0.0-nightly.20191001":"79.0.3919.0","8.0.0-nightly.20191004":"79.0.3919.0","8.0.0-nightly.20191005":"79.0.3919.0","8.0.0-nightly.20191006":"79.0.3919.0","8.0.0-nightly.20191009":"79.0.3919.0","8.0.0-nightly.20191011":"79.0.3919.0","8.0.0-nightly.20191012":"79.0.3919.0","8.0.0-nightly.20191017":"79.0.3919.0","8.0.0-nightly.20191019":"79.0.3931.0","8.0.0-nightly.20191020":"79.0.3931.0","8.0.0-nightly.20191021":"79.0.3931.0","8.0.0-nightly.20191023":"79.0.3931.0","8.0.0-nightly.20191101":"80.0.3952.0","8.0.0-nightly.20191103":"80.0.3952.0","8.0.0-nightly.20191105":"80.0.3952.0","8.0.0":"80.0.3987.86","8.0.1":"80.0.3987.86","8.0.2":"80.0.3987.86","8.0.3":"80.0.3987.134","8.1.0":"80.0.3987.137","8.1.1":"80.0.3987.141","8.2.0":"80.0.3987.158","8.2.1":"80.0.3987.163","8.2.2":"80.0.3987.163","8.2.3":"80.0.3987.163","8.2.4":"80.0.3987.165","8.2.5":"80.0.3987.165","8.3.0":"80.0.3987.165","8.3.1":"80.0.3987.165","8.3.2":"80.0.3987.165","8.3.3":"80.0.3987.165","8.3.4":"80.0.3987.165","8.4.0":"80.0.3987.165","8.4.1":"80.0.3987.165","8.5.0":"80.0.3987.165","8.5.1":"80.0.3987.165","8.5.2":"80.0.3987.165","8.5.3":"80.0.3987.163","8.5.4":"80.0.3987.163","8.5.5":"80.0.3987.163","9.0.0-beta.1":"82.0.4048.0","9.0.0-beta.2":"82.0.4048.0","9.0.0-beta.3":"82.0.4048.0","9.0.0-beta.4":"82.0.4048.0","9.0.0-beta.5":"82.0.4048.0","9.0.0-beta.6":"82.0.4058.2","9.0.0-beta.7":"82.0.4058.2","9.0.0-beta.9":"82.0.4058.2","9.0.0-beta.10":"82.0.4085.10","9.0.0-beta.11":"82.0.4085.14","9.0.0-beta.12":"82.0.4085.14","9.0.0-beta.13":"82.0.4085.14","9.0.0-beta.14":"82.0.4085.27","9.0.0-beta.15":"83.0.4102.3","9.0.0-beta.16":"83.0.4102.3","9.0.0-beta.17":"83.0.4103.14","9.0.0-beta.18":"83.0.4103.16","9.0.0-beta.19":"83.0.4103.24","9.0.0-beta.20":"83.0.4103.26","9.0.0-beta.21":"83.0.4103.26","9.0.0-beta.22":"83.0.4103.34","9.0.0-beta.23":"83.0.4103.44","9.0.0-beta.24":"83.0.4103.45","9.0.0-nightly.20191121":"80.0.3954.0","9.0.0-nightly.20191122":"80.0.3954.0","9.0.0-nightly.20191123":"80.0.3954.0","9.0.0-nightly.20191124":"80.0.3954.0","9.0.0-nightly.20191126":"80.0.3954.0","9.0.0-nightly.20191128":"80.0.3954.0","9.0.0-nightly.20191129":"80.0.3954.0","9.0.0-nightly.20191130":"80.0.3954.0","9.0.0-nightly.20191201":"80.0.3954.0","9.0.0-nightly.20191202":"80.0.3954.0","9.0.0-nightly.20191203":"80.0.3954.0","9.0.0-nightly.20191204":"80.0.3954.0","9.0.0-nightly.20191205":"80.0.3954.0","9.0.0-nightly.20191210":"80.0.3954.0","9.0.0-nightly.20191220":"81.0.3994.0","9.0.0-nightly.20191221":"81.0.3994.0","9.0.0-nightly.20191222":"81.0.3994.0","9.0.0-nightly.20191223":"81.0.3994.0","9.0.0-nightly.20191224":"81.0.3994.0","9.0.0-nightly.20191225":"81.0.3994.0","9.0.0-nightly.20191226":"81.0.3994.0","9.0.0-nightly.20191228":"81.0.3994.0","9.0.0-nightly.20191229":"81.0.3994.0","9.0.0-nightly.20191230":"81.0.3994.0","9.0.0-nightly.20191231":"81.0.3994.0","9.0.0-nightly.20200101":"81.0.3994.0","9.0.0-nightly.20200103":"81.0.3994.0","9.0.0-nightly.20200104":"81.0.3994.0","9.0.0-nightly.20200105":"81.0.3994.0","9.0.0-nightly.20200106":"81.0.3994.0","9.0.0-nightly.20200108":"81.0.3994.0","9.0.0-nightly.20200109":"81.0.3994.0","9.0.0-nightly.20200110":"81.0.3994.0","9.0.0-nightly.20200111":"81.0.3994.0","9.0.0-nightly.20200113":"81.0.3994.0","9.0.0-nightly.20200115":"81.0.3994.0","9.0.0-nightly.20200116":"81.0.3994.0","9.0.0-nightly.20200117":"81.0.3994.0","9.0.0-nightly.20200119":"81.0.4030.0","9.0.0-nightly.20200121":"81.0.4030.0","9.0.0":"83.0.4103.64","9.0.1":"83.0.4103.94","9.0.2":"83.0.4103.94","9.0.3":"83.0.4103.100","9.0.4":"83.0.4103.104","9.0.5":"83.0.4103.119","9.1.0":"83.0.4103.122","9.1.1":"83.0.4103.122","9.1.2":"83.0.4103.122","9.2.0":"83.0.4103.122","9.2.1":"83.0.4103.122","9.3.0":"83.0.4103.122","9.3.1":"83.0.4103.122","9.3.2":"83.0.4103.122","9.3.3":"83.0.4103.122","9.3.4":"83.0.4103.122","9.3.5":"83.0.4103.122","9.4.0":"83.0.4103.122","9.4.1":"83.0.4103.122","9.4.2":"83.0.4103.122","9.4.3":"83.0.4103.122","9.4.4":"83.0.4103.122","10.0.0-beta.1":"84.0.4129.0","10.0.0-beta.2":"84.0.4129.0","10.0.0-beta.3":"85.0.4161.2","10.0.0-beta.4":"85.0.4161.2","10.0.0-beta.8":"85.0.4181.1","10.0.0-beta.9":"85.0.4181.1","10.0.0-beta.10":"85.0.4183.19","10.0.0-beta.11":"85.0.4183.20","10.0.0-beta.12":"85.0.4183.26","10.0.0-beta.13":"85.0.4183.39","10.0.0-beta.14":"85.0.4183.39","10.0.0-beta.15":"85.0.4183.39","10.0.0-beta.17":"85.0.4183.39","10.0.0-beta.19":"85.0.4183.39","10.0.0-beta.20":"85.0.4183.39","10.0.0-beta.21":"85.0.4183.39","10.0.0-beta.23":"85.0.4183.70","10.0.0-beta.24":"85.0.4183.78","10.0.0-beta.25":"85.0.4183.80","10.0.0-nightly.20200209":"82.0.4050.0","10.0.0-nightly.20200210":"82.0.4050.0","10.0.0-nightly.20200211":"82.0.4050.0","10.0.0-nightly.20200216":"82.0.4050.0","10.0.0-nightly.20200217":"82.0.4050.0","10.0.0-nightly.20200218":"82.0.4050.0","10.0.0-nightly.20200221":"82.0.4050.0","10.0.0-nightly.20200222":"82.0.4050.0","10.0.0-nightly.20200223":"82.0.4050.0","10.0.0-nightly.20200226":"82.0.4050.0","10.0.0-nightly.20200303":"82.0.4050.0","10.0.0-nightly.20200304":"82.0.4076.0","10.0.0-nightly.20200305":"82.0.4076.0","10.0.0-nightly.20200306":"82.0.4076.0","10.0.0-nightly.20200309":"82.0.4076.0","10.0.0-nightly.20200310":"82.0.4076.0","10.0.0-nightly.20200311":"82.0.4083.0","10.0.0-nightly.20200316":"83.0.4086.0","10.0.0-nightly.20200317":"83.0.4087.0","10.0.0-nightly.20200318":"83.0.4087.0","10.0.0-nightly.20200320":"83.0.4087.0","10.0.0-nightly.20200323":"83.0.4087.0","10.0.0-nightly.20200324":"83.0.4087.0","10.0.0-nightly.20200325":"83.0.4087.0","10.0.0-nightly.20200326":"83.0.4087.0","10.0.0-nightly.20200327":"83.0.4087.0","10.0.0-nightly.20200330":"83.0.4087.0","10.0.0-nightly.20200331":"83.0.4087.0","10.0.0-nightly.20200401":"83.0.4087.0","10.0.0-nightly.20200402":"83.0.4087.0","10.0.0-nightly.20200403":"83.0.4087.0","10.0.0-nightly.20200406":"83.0.4087.0","10.0.0-nightly.20200408":"83.0.4095.0","10.0.0-nightly.20200410":"83.0.4095.0","10.0.0-nightly.20200413":"83.0.4095.0","10.0.0-nightly.20200414":"84.0.4114.0","10.0.0-nightly.20200415":"84.0.4115.0","10.0.0-nightly.20200416":"84.0.4115.0","10.0.0-nightly.20200417":"84.0.4115.0","10.0.0-nightly.20200422":"84.0.4121.0","10.0.0-nightly.20200423":"84.0.4121.0","10.0.0-nightly.20200427":"84.0.4125.0","10.0.0-nightly.20200428":"84.0.4125.0","10.0.0-nightly.20200429":"84.0.4125.0","10.0.0-nightly.20200430":"84.0.4125.0","10.0.0-nightly.20200501":"84.0.4129.0","10.0.0-nightly.20200504":"84.0.4129.0","10.0.0-nightly.20200505":"84.0.4129.0","10.0.0-nightly.20200506":"84.0.4129.0","10.0.0-nightly.20200507":"84.0.4129.0","10.0.0-nightly.20200508":"84.0.4129.0","10.0.0-nightly.20200511":"84.0.4129.0","10.0.0-nightly.20200512":"84.0.4129.0","10.0.0-nightly.20200513":"84.0.4129.0","10.0.0-nightly.20200514":"84.0.4129.0","10.0.0-nightly.20200515":"84.0.4129.0","10.0.0-nightly.20200518":"84.0.4129.0","10.0.0-nightly.20200519":"84.0.4129.0","10.0.0-nightly.20200520":"84.0.4129.0","10.0.0-nightly.20200521":"84.0.4129.0","10.0.0":"85.0.4183.84","10.0.1":"85.0.4183.86","10.1.0":"85.0.4183.87","10.1.1":"85.0.4183.93","10.1.2":"85.0.4183.98","10.1.3":"85.0.4183.121","10.1.4":"85.0.4183.121","10.1.5":"85.0.4183.121","10.1.6":"85.0.4183.121","10.1.7":"85.0.4183.121","10.2.0":"85.0.4183.121","10.3.0":"85.0.4183.121","10.3.1":"85.0.4183.121","10.3.2":"85.0.4183.121","10.4.0":"85.0.4183.121","10.4.1":"85.0.4183.121","10.4.2":"85.0.4183.121","10.4.3":"85.0.4183.121","10.4.4":"85.0.4183.121","10.4.5":"85.0.4183.121","10.4.6":"85.0.4183.121","10.4.7":"85.0.4183.121","11.0.0-beta.1":"86.0.4234.0","11.0.0-beta.3":"86.0.4234.0","11.0.0-beta.4":"86.0.4234.0","11.0.0-beta.5":"86.0.4234.0","11.0.0-beta.6":"86.0.4234.0","11.0.0-beta.7":"86.0.4234.0","11.0.0-beta.8":"87.0.4251.1","11.0.0-beta.9":"87.0.4251.1","11.0.0-beta.11":"87.0.4251.1","11.0.0-beta.12":"87.0.4280.11","11.0.0-beta.13":"87.0.4280.11","11.0.0-beta.16":"87.0.4280.27","11.0.0-beta.17":"87.0.4280.27","11.0.0-beta.18":"87.0.4280.27","11.0.0-beta.19":"87.0.4280.27","11.0.0-beta.20":"87.0.4280.40","11.0.0-beta.22":"87.0.4280.47","11.0.0-beta.23":"87.0.4280.47","11.0.0-nightly.20200525":"84.0.4129.0","11.0.0-nightly.20200526":"84.0.4129.0","11.0.0-nightly.20200529":"85.0.4156.0","11.0.0-nightly.20200602":"85.0.4162.0","11.0.0-nightly.20200603":"85.0.4162.0","11.0.0-nightly.20200604":"85.0.4162.0","11.0.0-nightly.20200609":"85.0.4162.0","11.0.0-nightly.20200610":"85.0.4162.0","11.0.0-nightly.20200611":"85.0.4162.0","11.0.0-nightly.20200615":"85.0.4162.0","11.0.0-nightly.20200616":"85.0.4162.0","11.0.0-nightly.20200617":"85.0.4162.0","11.0.0-nightly.20200618":"85.0.4162.0","11.0.0-nightly.20200619":"85.0.4162.0","11.0.0-nightly.20200701":"85.0.4179.0","11.0.0-nightly.20200702":"85.0.4179.0","11.0.0-nightly.20200703":"85.0.4179.0","11.0.0-nightly.20200706":"85.0.4179.0","11.0.0-nightly.20200707":"85.0.4179.0","11.0.0-nightly.20200708":"85.0.4179.0","11.0.0-nightly.20200709":"85.0.4179.0","11.0.0-nightly.20200716":"86.0.4203.0","11.0.0-nightly.20200717":"86.0.4203.0","11.0.0-nightly.20200720":"86.0.4203.0","11.0.0-nightly.20200721":"86.0.4203.0","11.0.0-nightly.20200723":"86.0.4209.0","11.0.0-nightly.20200724":"86.0.4209.0","11.0.0-nightly.20200729":"86.0.4209.0","11.0.0-nightly.20200730":"86.0.4209.0","11.0.0-nightly.20200731":"86.0.4209.0","11.0.0-nightly.20200803":"86.0.4209.0","11.0.0-nightly.20200804":"86.0.4209.0","11.0.0-nightly.20200805":"86.0.4209.0","11.0.0-nightly.20200811":"86.0.4209.0","11.0.0-nightly.20200812":"86.0.4209.0","11.0.0-nightly.20200822":"86.0.4234.0","11.0.0-nightly.20200824":"86.0.4234.0","11.0.0-nightly.20200825":"86.0.4234.0","11.0.0-nightly.20200826":"86.0.4234.0","11.0.0":"87.0.4280.60","11.0.1":"87.0.4280.60","11.0.2":"87.0.4280.67","11.0.3":"87.0.4280.67","11.0.4":"87.0.4280.67","11.0.5":"87.0.4280.88","11.1.0":"87.0.4280.88","11.1.1":"87.0.4280.88","11.2.0":"87.0.4280.141","11.2.1":"87.0.4280.141","11.2.2":"87.0.4280.141","11.2.3":"87.0.4280.141","11.3.0":"87.0.4280.141","11.4.0":"87.0.4280.141","11.4.1":"87.0.4280.141","11.4.2":"87.0.4280.141","11.4.3":"87.0.4280.141","11.4.4":"87.0.4280.141","11.4.5":"87.0.4280.141","11.4.6":"87.0.4280.141","11.4.7":"87.0.4280.141","11.4.8":"87.0.4280.141","11.4.9":"87.0.4280.141","11.4.10":"87.0.4280.141","11.4.11":"87.0.4280.141","11.4.12":"87.0.4280.141","11.5.0":"87.0.4280.141","12.0.0-beta.1":"89.0.4328.0","12.0.0-beta.3":"89.0.4328.0","12.0.0-beta.4":"89.0.4328.0","12.0.0-beta.5":"89.0.4328.0","12.0.0-beta.6":"89.0.4328.0","12.0.0-beta.7":"89.0.4328.0","12.0.0-beta.8":"89.0.4328.0","12.0.0-beta.9":"89.0.4328.0","12.0.0-beta.10":"89.0.4328.0","12.0.0-beta.11":"89.0.4328.0","12.0.0-beta.12":"89.0.4328.0","12.0.0-beta.14":"89.0.4328.0","12.0.0-beta.16":"89.0.4348.1","12.0.0-beta.18":"89.0.4348.1","12.0.0-beta.19":"89.0.4348.1","12.0.0-beta.20":"89.0.4348.1","12.0.0-beta.21":"89.0.4388.2","12.0.0-beta.22":"89.0.4388.2","12.0.0-beta.23":"89.0.4388.2","12.0.0-beta.24":"89.0.4388.2","12.0.0-beta.25":"89.0.4388.2","12.0.0-beta.26":"89.0.4388.2","12.0.0-beta.27":"89.0.4389.23","12.0.0-beta.28":"89.0.4389.23","12.0.0-beta.29":"89.0.4389.23","12.0.0-beta.30":"89.0.4389.58","12.0.0-beta.31":"89.0.4389.58","12.0.0-nightly.20200827":"86.0.4234.0","12.0.0-nightly.20200831":"86.0.4234.0","12.0.0-nightly.20200902":"86.0.4234.0","12.0.0-nightly.20200903":"86.0.4234.0","12.0.0-nightly.20200907":"86.0.4234.0","12.0.0-nightly.20200910":"86.0.4234.0","12.0.0-nightly.20200911":"86.0.4234.0","12.0.0-nightly.20200914":"86.0.4234.0","12.0.0-nightly.20201002":"87.0.4268.0","12.0.0-nightly.20201007":"87.0.4268.0","12.0.0-nightly.20201009":"87.0.4268.0","12.0.0-nightly.20201012":"87.0.4268.0","12.0.0-nightly.20201013":"87.0.4268.0","12.0.0-nightly.20201014":"87.0.4268.0","12.0.0-nightly.20201015":"87.0.4268.0","12.0.0-nightly.20201023":"88.0.4292.0","12.0.0-nightly.20201026":"88.0.4292.0","12.0.0-nightly.20201030":"88.0.4306.0","12.0.0-nightly.20201102":"88.0.4306.0","12.0.0-nightly.20201103":"88.0.4306.0","12.0.0-nightly.20201104":"88.0.4306.0","12.0.0-nightly.20201105":"88.0.4306.0","12.0.0-nightly.20201106":"88.0.4306.0","12.0.0-nightly.20201111":"88.0.4306.0","12.0.0-nightly.20201112":"88.0.4306.0","12.0.0-nightly.20201116":"88.0.4324.0","12.0.0":"89.0.4389.69","12.0.1":"89.0.4389.82","12.0.2":"89.0.4389.90","12.0.3":"89.0.4389.114","12.0.4":"89.0.4389.114","12.0.5":"89.0.4389.128","12.0.6":"89.0.4389.128","12.0.7":"89.0.4389.128","12.0.8":"89.0.4389.128","12.0.9":"89.0.4389.128","12.0.10":"89.0.4389.128","12.0.11":"89.0.4389.128","12.0.12":"89.0.4389.128","12.0.13":"89.0.4389.128","12.0.14":"89.0.4389.128","12.0.15":"89.0.4389.128","12.0.16":"89.0.4389.128","12.0.17":"89.0.4389.128","12.0.18":"89.0.4389.128","12.1.0":"89.0.4389.128","12.1.1":"89.0.4389.128","12.1.2":"89.0.4389.128","12.2.0":"89.0.4389.128","12.2.1":"89.0.4389.128","12.2.2":"89.0.4389.128","12.2.3":"89.0.4389.128","13.0.0-beta.2":"90.0.4402.0","13.0.0-beta.3":"90.0.4402.0","13.0.0-beta.4":"90.0.4415.0","13.0.0-beta.5":"90.0.4415.0","13.0.0-beta.6":"90.0.4415.0","13.0.0-beta.7":"90.0.4415.0","13.0.0-beta.8":"90.0.4415.0","13.0.0-beta.9":"90.0.4415.0","13.0.0-beta.10":"90.0.4415.0","13.0.0-beta.11":"90.0.4415.0","13.0.0-beta.12":"90.0.4415.0","13.0.0-beta.13":"90.0.4415.0","13.0.0-beta.14":"91.0.4448.0","13.0.0-beta.16":"91.0.4448.0","13.0.0-beta.17":"91.0.4448.0","13.0.0-beta.18":"91.0.4448.0","13.0.0-beta.20":"91.0.4448.0","13.0.0-beta.21":"91.0.4472.33","13.0.0-beta.22":"91.0.4472.33","13.0.0-beta.23":"91.0.4472.33","13.0.0-beta.24":"91.0.4472.38","13.0.0-beta.25":"91.0.4472.38","13.0.0-beta.26":"91.0.4472.38","13.0.0-beta.27":"91.0.4472.38","13.0.0-beta.28":"91.0.4472.38","13.0.0-nightly.20201119":"89.0.4328.0","13.0.0-nightly.20201123":"89.0.4328.0","13.0.0-nightly.20201124":"89.0.4328.0","13.0.0-nightly.20201126":"89.0.4328.0","13.0.0-nightly.20201127":"89.0.4328.0","13.0.0-nightly.20201130":"89.0.4328.0","13.0.0-nightly.20201201":"89.0.4328.0","13.0.0-nightly.20201202":"89.0.4328.0","13.0.0-nightly.20201203":"89.0.4328.0","13.0.0-nightly.20201204":"89.0.4328.0","13.0.0-nightly.20201207":"89.0.4328.0","13.0.0-nightly.20201208":"89.0.4328.0","13.0.0-nightly.20201209":"89.0.4328.0","13.0.0-nightly.20201210":"89.0.4328.0","13.0.0-nightly.20201211":"89.0.4328.0","13.0.0-nightly.20201214":"89.0.4328.0","13.0.0-nightly.20201215":"89.0.4349.0","13.0.0-nightly.20201216":"89.0.4349.0","13.0.0-nightly.20201221":"89.0.4349.0","13.0.0-nightly.20201222":"89.0.4349.0","13.0.0-nightly.20201223":"89.0.4359.0","13.0.0-nightly.20210104":"89.0.4359.0","13.0.0-nightly.20210108":"89.0.4359.0","13.0.0-nightly.20210111":"89.0.4359.0","13.0.0-nightly.20210113":"89.0.4386.0","13.0.0-nightly.20210114":"89.0.4386.0","13.0.0-nightly.20210118":"89.0.4386.0","13.0.0-nightly.20210122":"89.0.4386.0","13.0.0-nightly.20210125":"89.0.4386.0","13.0.0-nightly.20210127":"89.0.4389.0","13.0.0-nightly.20210128":"89.0.4389.0","13.0.0-nightly.20210129":"89.0.4389.0","13.0.0-nightly.20210201":"89.0.4389.0","13.0.0-nightly.20210202":"89.0.4389.0","13.0.0-nightly.20210203":"89.0.4389.0","13.0.0-nightly.20210205":"89.0.4389.0","13.0.0-nightly.20210208":"89.0.4389.0","13.0.0-nightly.20210209":"89.0.4389.0","13.0.0-nightly.20210210":"90.0.4402.0","13.0.0-nightly.20210211":"90.0.4402.0","13.0.0-nightly.20210212":"90.0.4402.0","13.0.0-nightly.20210216":"90.0.4402.0","13.0.0-nightly.20210217":"90.0.4402.0","13.0.0-nightly.20210218":"90.0.4402.0","13.0.0-nightly.20210219":"90.0.4402.0","13.0.0-nightly.20210222":"90.0.4402.0","13.0.0-nightly.20210225":"90.0.4402.0","13.0.0-nightly.20210226":"90.0.4402.0","13.0.0-nightly.20210301":"90.0.4402.0","13.0.0-nightly.20210302":"90.0.4402.0","13.0.0-nightly.20210303":"90.0.4402.0","13.0.0":"91.0.4472.69","13.0.1":"91.0.4472.69","13.1.0":"91.0.4472.77","13.1.1":"91.0.4472.77","13.1.2":"91.0.4472.77","13.1.3":"91.0.4472.106","13.1.4":"91.0.4472.106","13.1.5":"91.0.4472.124","13.1.6":"91.0.4472.124","13.1.7":"91.0.4472.124","13.1.8":"91.0.4472.164","13.1.9":"91.0.4472.164","13.2.0":"91.0.4472.164","13.2.1":"91.0.4472.164","13.2.2":"91.0.4472.164","13.2.3":"91.0.4472.164","13.3.0":"91.0.4472.164","13.4.0":"91.0.4472.164","13.5.0":"91.0.4472.164","13.5.1":"91.0.4472.164","13.5.2":"91.0.4472.164","13.6.0":"91.0.4472.164","13.6.1":"91.0.4472.164","13.6.2":"91.0.4472.164","13.6.3":"91.0.4472.164","13.6.6":"91.0.4472.164","13.6.7":"91.0.4472.164","13.6.8":"91.0.4472.164","13.6.9":"91.0.4472.164","14.0.0-beta.1":"92.0.4511.0","14.0.0-beta.2":"92.0.4511.0","14.0.0-beta.3":"92.0.4511.0","14.0.0-beta.5":"93.0.4536.0","14.0.0-beta.6":"93.0.4536.0","14.0.0-beta.7":"93.0.4536.0","14.0.0-beta.8":"93.0.4536.0","14.0.0-beta.9":"93.0.4539.0","14.0.0-beta.10":"93.0.4539.0","14.0.0-beta.11":"93.0.4557.4","14.0.0-beta.12":"93.0.4557.4","14.0.0-beta.13":"93.0.4566.0","14.0.0-beta.14":"93.0.4566.0","14.0.0-beta.15":"93.0.4566.0","14.0.0-beta.16":"93.0.4566.0","14.0.0-beta.17":"93.0.4566.0","14.0.0-beta.18":"93.0.4577.15","14.0.0-beta.19":"93.0.4577.15","14.0.0-beta.20":"93.0.4577.15","14.0.0-beta.21":"93.0.4577.15","14.0.0-beta.22":"93.0.4577.25","14.0.0-beta.23":"93.0.4577.25","14.0.0-beta.24":"93.0.4577.51","14.0.0-beta.25":"93.0.4577.51","14.0.0-nightly.20210304":"90.0.4402.0","14.0.0-nightly.20210305":"90.0.4415.0","14.0.0-nightly.20210308":"90.0.4415.0","14.0.0-nightly.20210309":"90.0.4415.0","14.0.0-nightly.20210311":"90.0.4415.0","14.0.0-nightly.20210315":"90.0.4415.0","14.0.0-nightly.20210316":"90.0.4415.0","14.0.0-nightly.20210317":"90.0.4415.0","14.0.0-nightly.20210318":"90.0.4415.0","14.0.0-nightly.20210319":"90.0.4415.0","14.0.0-nightly.20210323":"90.0.4415.0","14.0.0-nightly.20210324":"90.0.4415.0","14.0.0-nightly.20210325":"90.0.4415.0","14.0.0-nightly.20210326":"90.0.4415.0","14.0.0-nightly.20210329":"90.0.4415.0","14.0.0-nightly.20210330":"90.0.4415.0","14.0.0-nightly.20210331":"91.0.4448.0","14.0.0-nightly.20210401":"91.0.4448.0","14.0.0-nightly.20210402":"91.0.4448.0","14.0.0-nightly.20210406":"91.0.4448.0","14.0.0-nightly.20210407":"91.0.4448.0","14.0.0-nightly.20210408":"91.0.4448.0","14.0.0-nightly.20210409":"91.0.4448.0","14.0.0-nightly.20210413":"91.0.4448.0","14.0.0-nightly.20210426":"92.0.4475.0","14.0.0-nightly.20210427":"92.0.4475.0","14.0.0-nightly.20210430":"92.0.4488.0","14.0.0-nightly.20210503":"92.0.4488.0","14.0.0-nightly.20210505":"92.0.4496.0","14.0.0-nightly.20210506":"92.0.4498.0","14.0.0-nightly.20210507":"92.0.4499.0","14.0.0-nightly.20210510":"92.0.4499.0","14.0.0-nightly.20210511":"92.0.4499.0","14.0.0-nightly.20210512":"92.0.4499.0","14.0.0-nightly.20210513":"92.0.4499.0","14.0.0-nightly.20210514":"92.0.4505.0","14.0.0-nightly.20210517":"92.0.4505.0","14.0.0-nightly.20210518":"92.0.4505.0","14.0.0-nightly.20210519":"92.0.4505.0","14.0.0-nightly.20210520":"92.0.4511.0","14.0.0-nightly.20210523":"92.0.4511.0","14.0.0-nightly.20210524":"92.0.4511.0","14.0.0":"93.0.4577.58","14.0.1":"93.0.4577.63","14.0.2":"93.0.4577.82","14.1.0":"93.0.4577.82","14.1.1":"93.0.4577.82","14.2.0":"93.0.4577.82","14.2.1":"93.0.4577.82","14.2.2":"93.0.4577.82","14.2.3":"93.0.4577.82","14.2.4":"93.0.4577.82","14.2.5":"93.0.4577.82","14.2.6":"93.0.4577.82","14.2.7":"93.0.4577.82","14.2.8":"93.0.4577.82","14.2.9":"93.0.4577.82","15.0.0-alpha.1":"93.0.4566.0","15.0.0-alpha.2":"93.0.4566.0","15.0.0-alpha.3":"94.0.4584.0","15.0.0-alpha.4":"94.0.4584.0","15.0.0-alpha.5":"94.0.4584.0","15.0.0-alpha.6":"94.0.4584.0","15.0.0-alpha.7":"94.0.4590.2","15.0.0-alpha.8":"94.0.4590.2","15.0.0-alpha.9":"94.0.4590.2","15.0.0-alpha.10":"94.0.4606.12","15.0.0-beta.1":"94.0.4606.20","15.0.0-beta.2":"94.0.4606.20","15.0.0-beta.3":"94.0.4606.31","15.0.0-beta.4":"94.0.4606.31","15.0.0-beta.5":"94.0.4606.31","15.0.0-beta.6":"94.0.4606.31","15.0.0-beta.7":"94.0.4606.31","15.0.0-nightly.20210527":"92.0.4511.0","15.0.0-nightly.20210528":"92.0.4511.0","15.0.0-nightly.20210531":"92.0.4511.0","15.0.0-nightly.20210601":"92.0.4511.0","15.0.0-nightly.20210602":"92.0.4511.0","15.0.0-nightly.20210603":"93.0.4530.0","15.0.0-nightly.20210604":"93.0.4530.0","15.0.0-nightly.20210608":"93.0.4535.0","15.0.0-nightly.20210609":"93.0.4536.0","15.0.0-nightly.20210610":"93.0.4536.0","15.0.0-nightly.20210611":"93.0.4536.0","15.0.0-nightly.20210614":"93.0.4536.0","15.0.0-nightly.20210615":"93.0.4536.0","15.0.0-nightly.20210616":"93.0.4536.0","15.0.0-nightly.20210617":"93.0.4539.0","15.0.0-nightly.20210618":"93.0.4539.0","15.0.0-nightly.20210621":"93.0.4539.0","15.0.0-nightly.20210622":"93.0.4539.0","15.0.0-nightly.20210623":"93.0.4550.0","15.0.0-nightly.20210624":"93.0.4550.0","15.0.0-nightly.20210625":"93.0.4552.0","15.0.0-nightly.20210628":"93.0.4552.0","15.0.0-nightly.20210629":"93.0.4552.0","15.0.0-nightly.20210630":"93.0.4558.0","15.0.0-nightly.20210701":"93.0.4558.0","15.0.0-nightly.20210702":"93.0.4558.0","15.0.0-nightly.20210705":"93.0.4558.0","15.0.0-nightly.20210706":"93.0.4566.0","15.0.0-nightly.20210707":"93.0.4566.0","15.0.0-nightly.20210708":"93.0.4566.0","15.0.0-nightly.20210709":"93.0.4566.0","15.0.0-nightly.20210712":"93.0.4566.0","15.0.0-nightly.20210713":"93.0.4566.0","15.0.0-nightly.20210714":"93.0.4566.0","15.0.0-nightly.20210715":"93.0.4566.0","15.0.0-nightly.20210716":"93.0.4566.0","15.0.0-nightly.20210719":"93.0.4566.0","15.0.0-nightly.20210720":"93.0.4566.0","15.0.0-nightly.20210721":"93.0.4566.0","15.0.0":"94.0.4606.51","15.1.0":"94.0.4606.61","15.1.1":"94.0.4606.61","15.1.2":"94.0.4606.71","15.2.0":"94.0.4606.81","15.3.0":"94.0.4606.81","15.3.1":"94.0.4606.81","15.3.2":"94.0.4606.81","15.3.3":"94.0.4606.81","15.3.4":"94.0.4606.81","15.3.5":"94.0.4606.81","15.3.6":"94.0.4606.81","15.3.7":"94.0.4606.81","15.4.0":"94.0.4606.81","15.4.1":"94.0.4606.81","15.4.2":"94.0.4606.81","15.5.0":"94.0.4606.81","15.5.1":"94.0.4606.81","15.5.2":"94.0.4606.81","15.5.3":"94.0.4606.81","15.5.4":"94.0.4606.81","15.5.5":"94.0.4606.81","15.5.6":"94.0.4606.81","15.5.7":"94.0.4606.81","16.0.0-alpha.1":"95.0.4629.0","16.0.0-alpha.2":"95.0.4629.0","16.0.0-alpha.3":"95.0.4629.0","16.0.0-alpha.4":"95.0.4629.0","16.0.0-alpha.5":"95.0.4629.0","16.0.0-alpha.6":"95.0.4629.0","16.0.0-alpha.7":"95.0.4629.0","16.0.0-alpha.8":"96.0.4647.0","16.0.0-alpha.9":"96.0.4647.0","16.0.0-beta.1":"96.0.4647.0","16.0.0-beta.2":"96.0.4647.0","16.0.0-beta.3":"96.0.4647.0","16.0.0-beta.4":"96.0.4664.18","16.0.0-beta.5":"96.0.4664.18","16.0.0-beta.6":"96.0.4664.27","16.0.0-beta.7":"96.0.4664.27","16.0.0-beta.8":"96.0.4664.35","16.0.0-beta.9":"96.0.4664.35","16.0.0-nightly.20210722":"93.0.4566.0","16.0.0-nightly.20210723":"93.0.4566.0","16.0.0-nightly.20210726":"93.0.4566.0","16.0.0-nightly.20210727":"94.0.4584.0","16.0.0-nightly.20210728":"94.0.4584.0","16.0.0-nightly.20210729":"94.0.4584.0","16.0.0-nightly.20210730":"94.0.4584.0","16.0.0-nightly.20210802":"94.0.4584.0","16.0.0-nightly.20210803":"94.0.4584.0","16.0.0-nightly.20210804":"94.0.4584.0","16.0.0-nightly.20210805":"94.0.4584.0","16.0.0-nightly.20210806":"94.0.4584.0","16.0.0-nightly.20210809":"94.0.4584.0","16.0.0-nightly.20210810":"94.0.4584.0","16.0.0-nightly.20210811":"94.0.4584.0","16.0.0-nightly.20210812":"94.0.4590.2","16.0.0-nightly.20210813":"94.0.4590.2","16.0.0-nightly.20210816":"94.0.4590.2","16.0.0-nightly.20210817":"94.0.4590.2","16.0.0-nightly.20210818":"94.0.4590.2","16.0.0-nightly.20210819":"94.0.4590.2","16.0.0-nightly.20210820":"94.0.4590.2","16.0.0-nightly.20210823":"94.0.4590.2","16.0.0-nightly.20210824":"95.0.4612.5","16.0.0-nightly.20210825":"95.0.4612.5","16.0.0-nightly.20210826":"95.0.4612.5","16.0.0-nightly.20210827":"95.0.4612.5","16.0.0-nightly.20210830":"95.0.4612.5","16.0.0-nightly.20210831":"95.0.4612.5","16.0.0-nightly.20210901":"95.0.4612.5","16.0.0-nightly.20210902":"95.0.4629.0","16.0.0-nightly.20210903":"95.0.4629.0","16.0.0-nightly.20210906":"95.0.4629.0","16.0.0-nightly.20210907":"95.0.4629.0","16.0.0-nightly.20210908":"95.0.4629.0","16.0.0-nightly.20210909":"95.0.4629.0","16.0.0-nightly.20210910":"95.0.4629.0","16.0.0-nightly.20210913":"95.0.4629.0","16.0.0-nightly.20210914":"95.0.4629.0","16.0.0-nightly.20210915":"95.0.4629.0","16.0.0-nightly.20210916":"95.0.4629.0","16.0.0-nightly.20210917":"95.0.4629.0","16.0.0-nightly.20210920":"95.0.4629.0","16.0.0-nightly.20210921":"95.0.4629.0","16.0.0-nightly.20210922":"95.0.4629.0","16.0.0":"96.0.4664.45","16.0.1":"96.0.4664.45","16.0.2":"96.0.4664.55","16.0.3":"96.0.4664.55","16.0.4":"96.0.4664.55","16.0.5":"96.0.4664.55","16.0.6":"96.0.4664.110","16.0.7":"96.0.4664.110","16.0.8":"96.0.4664.110","16.0.9":"96.0.4664.174","16.0.10":"96.0.4664.174","16.1.0":"96.0.4664.174","16.1.1":"96.0.4664.174","16.2.0":"96.0.4664.174","16.2.1":"96.0.4664.174","16.2.2":"96.0.4664.174","16.2.3":"96.0.4664.174","16.2.4":"96.0.4664.174","16.2.5":"96.0.4664.174","16.2.6":"96.0.4664.174","16.2.7":"96.0.4664.174","16.2.8":"96.0.4664.174","17.0.0-alpha.1":"96.0.4664.4","17.0.0-alpha.2":"96.0.4664.4","17.0.0-alpha.3":"96.0.4664.4","17.0.0-alpha.4":"98.0.4706.0","17.0.0-alpha.5":"98.0.4706.0","17.0.0-alpha.6":"98.0.4706.0","17.0.0-beta.1":"98.0.4706.0","17.0.0-beta.2":"98.0.4706.0","17.0.0-beta.3":"98.0.4758.9","17.0.0-beta.4":"98.0.4758.11","17.0.0-beta.5":"98.0.4758.11","17.0.0-beta.6":"98.0.4758.11","17.0.0-beta.7":"98.0.4758.11","17.0.0-beta.8":"98.0.4758.11","17.0.0-beta.9":"98.0.4758.11","17.0.0-nightly.20210923":"95.0.4629.0","17.0.0-nightly.20210924":"95.0.4629.0","17.0.0-nightly.20210927":"95.0.4629.0","17.0.0-nightly.20210928":"95.0.4629.0","17.0.0-nightly.20210929":"95.0.4629.0","17.0.0-nightly.20210930":"95.0.4629.0","17.0.0-nightly.20211001":"95.0.4629.0","17.0.0-nightly.20211004":"95.0.4629.0","17.0.0-nightly.20211005":"95.0.4629.0","17.0.0-nightly.20211006":"96.0.4647.0","17.0.0-nightly.20211007":"96.0.4647.0","17.0.0-nightly.20211008":"96.0.4647.0","17.0.0-nightly.20211011":"96.0.4647.0","17.0.0-nightly.20211012":"96.0.4647.0","17.0.0-nightly.20211013":"96.0.4647.0","17.0.0-nightly.20211014":"96.0.4647.0","17.0.0-nightly.20211015":"96.0.4647.0","17.0.0-nightly.20211018":"96.0.4647.0","17.0.0-nightly.20211019":"96.0.4647.0","17.0.0-nightly.20211020":"96.0.4647.0","17.0.0-nightly.20211021":"96.0.4647.0","17.0.0-nightly.20211022":"96.0.4664.4","17.0.0-nightly.20211025":"96.0.4664.4","17.0.0-nightly.20211026":"96.0.4664.4","17.0.0-nightly.20211027":"96.0.4664.4","17.0.0-nightly.20211028":"96.0.4664.4","17.0.0-nightly.20211029":"96.0.4664.4","17.0.0-nightly.20211101":"96.0.4664.4","17.0.0-nightly.20211102":"96.0.4664.4","17.0.0-nightly.20211103":"96.0.4664.4","17.0.0-nightly.20211104":"96.0.4664.4","17.0.0-nightly.20211105":"96.0.4664.4","17.0.0-nightly.20211108":"96.0.4664.4","17.0.0-nightly.20211109":"96.0.4664.4","17.0.0-nightly.20211110":"96.0.4664.4","17.0.0-nightly.20211111":"96.0.4664.4","17.0.0-nightly.20211112":"96.0.4664.4","17.0.0-nightly.20211115":"96.0.4664.4","17.0.0-nightly.20211116":"96.0.4664.4","17.0.0-nightly.20211117":"96.0.4664.4","17.0.0":"98.0.4758.74","17.0.1":"98.0.4758.82","17.1.0":"98.0.4758.102","17.1.1":"98.0.4758.109","17.1.2":"98.0.4758.109","17.2.0":"98.0.4758.109","17.3.0":"98.0.4758.141","17.3.1":"98.0.4758.141","17.4.0":"98.0.4758.141","17.4.1":"98.0.4758.141","17.4.2":"98.0.4758.141","17.4.3":"98.0.4758.141","17.4.4":"98.0.4758.141","17.4.5":"98.0.4758.141","17.4.6":"98.0.4758.141","17.4.7":"98.0.4758.141","17.4.8":"98.0.4758.141","17.4.9":"98.0.4758.141","17.4.10":"98.0.4758.141","17.4.11":"98.0.4758.141","18.0.0-alpha.1":"99.0.4767.0","18.0.0-alpha.2":"99.0.4767.0","18.0.0-alpha.3":"99.0.4767.0","18.0.0-alpha.4":"99.0.4767.0","18.0.0-alpha.5":"99.0.4767.0","18.0.0-beta.1":"100.0.4894.0","18.0.0-beta.2":"100.0.4894.0","18.0.0-beta.3":"100.0.4894.0","18.0.0-beta.4":"100.0.4894.0","18.0.0-beta.5":"100.0.4894.0","18.0.0-beta.6":"100.0.4894.0","18.0.0-nightly.20211118":"96.0.4664.4","18.0.0-nightly.20211119":"96.0.4664.4","18.0.0-nightly.20211122":"96.0.4664.4","18.0.0-nightly.20211123":"96.0.4664.4","18.0.0-nightly.20211124":"98.0.4706.0","18.0.0-nightly.20211125":"98.0.4706.0","18.0.0-nightly.20211126":"98.0.4706.0","18.0.0-nightly.20211129":"98.0.4706.0","18.0.0-nightly.20211130":"98.0.4706.0","18.0.0-nightly.20211201":"98.0.4706.0","18.0.0-nightly.20211202":"98.0.4706.0","18.0.0-nightly.20211203":"98.0.4706.0","18.0.0-nightly.20211206":"98.0.4706.0","18.0.0-nightly.20211207":"98.0.4706.0","18.0.0-nightly.20211208":"98.0.4706.0","18.0.0-nightly.20211209":"98.0.4706.0","18.0.0-nightly.20211210":"98.0.4706.0","18.0.0-nightly.20211213":"98.0.4706.0","18.0.0-nightly.20211214":"98.0.4706.0","18.0.0-nightly.20211215":"98.0.4706.0","18.0.0-nightly.20211216":"98.0.4706.0","18.0.0-nightly.20211217":"98.0.4706.0","18.0.0-nightly.20211220":"98.0.4706.0","18.0.0-nightly.20211221":"98.0.4706.0","18.0.0-nightly.20211222":"98.0.4706.0","18.0.0-nightly.20211223":"98.0.4706.0","18.0.0-nightly.20211228":"98.0.4706.0","18.0.0-nightly.20211229":"98.0.4706.0","18.0.0-nightly.20211231":"98.0.4706.0","18.0.0-nightly.20220103":"98.0.4706.0","18.0.0-nightly.20220104":"98.0.4706.0","18.0.0-nightly.20220105":"98.0.4706.0","18.0.0-nightly.20220106":"98.0.4706.0","18.0.0-nightly.20220107":"98.0.4706.0","18.0.0-nightly.20220110":"98.0.4706.0","18.0.0-nightly.20220111":"99.0.4767.0","18.0.0-nightly.20220112":"99.0.4767.0","18.0.0-nightly.20220113":"99.0.4767.0","18.0.0-nightly.20220114":"99.0.4767.0","18.0.0-nightly.20220117":"99.0.4767.0","18.0.0-nightly.20220118":"99.0.4767.0","18.0.0-nightly.20220119":"99.0.4767.0","18.0.0-nightly.20220121":"99.0.4767.0","18.0.0-nightly.20220124":"99.0.4767.0","18.0.0-nightly.20220125":"99.0.4767.0","18.0.0-nightly.20220127":"99.0.4767.0","18.0.0-nightly.20220128":"99.0.4767.0","18.0.0-nightly.20220131":"99.0.4767.0","18.0.0-nightly.20220201":"99.0.4767.0","18.0.0":"100.0.4896.56","18.0.1":"100.0.4896.60","18.0.2":"100.0.4896.60","18.0.3":"100.0.4896.75","18.0.4":"100.0.4896.75","18.1.0":"100.0.4896.127","18.2.0":"100.0.4896.143","18.2.1":"100.0.4896.143","18.2.2":"100.0.4896.143","18.2.3":"100.0.4896.143","18.2.4":"100.0.4896.160","18.3.0":"100.0.4896.160","18.3.1":"100.0.4896.160","18.3.2":"100.0.4896.160","18.3.3":"100.0.4896.160","18.3.4":"100.0.4896.160","18.3.5":"100.0.4896.160","18.3.6":"100.0.4896.160","18.3.7":"100.0.4896.160","18.3.8":"100.0.4896.160","18.3.9":"100.0.4896.160","18.3.11":"100.0.4896.160","18.3.12":"100.0.4896.160","18.3.13":"100.0.4896.160","18.3.14":"100.0.4896.160","18.3.15":"100.0.4896.160","19.0.0-alpha.1":"102.0.4962.3","19.0.0-alpha.2":"102.0.4971.0","19.0.0-alpha.3":"102.0.4971.0","19.0.0-alpha.4":"102.0.4989.0","19.0.0-alpha.5":"102.0.4989.0","19.0.0-beta.1":"102.0.4999.0","19.0.0-beta.2":"102.0.4999.0","19.0.0-beta.3":"102.0.4999.0","19.0.0-beta.4":"102.0.5005.27","19.0.0-beta.5":"102.0.5005.40","19.0.0-beta.6":"102.0.5005.40","19.0.0-beta.7":"102.0.5005.40","19.0.0-beta.8":"102.0.5005.49","19.0.0-nightly.20220202":"99.0.4767.0","19.0.0-nightly.20220203":"99.0.4767.0","19.0.0-nightly.20220204":"99.0.4767.0","19.0.0-nightly.20220207":"99.0.4767.0","19.0.0-nightly.20220208":"99.0.4767.0","19.0.0-nightly.20220209":"99.0.4767.0","19.0.0-nightly.20220308":"100.0.4894.0","19.0.0-nightly.20220309":"100.0.4894.0","19.0.0-nightly.20220310":"100.0.4894.0","19.0.0-nightly.20220311":"100.0.4894.0","19.0.0-nightly.20220314":"100.0.4894.0","19.0.0-nightly.20220315":"100.0.4894.0","19.0.0-nightly.20220316":"100.0.4894.0","19.0.0-nightly.20220317":"100.0.4894.0","19.0.0-nightly.20220318":"100.0.4894.0","19.0.0-nightly.20220321":"100.0.4894.0","19.0.0-nightly.20220322":"100.0.4894.0","19.0.0-nightly.20220323":"100.0.4894.0","19.0.0-nightly.20220324":"100.0.4894.0","19.0.0-nightly.20220325":"102.0.4961.0","19.0.0-nightly.20220328":"102.0.4962.3","19.0.0-nightly.20220329":"102.0.4962.3","19.0.0":"102.0.5005.61","19.0.1":"102.0.5005.61","19.0.2":"102.0.5005.63","19.0.3":"102.0.5005.63","19.0.4":"102.0.5005.63","19.0.5":"102.0.5005.115","19.0.6":"102.0.5005.115","19.0.7":"102.0.5005.134","19.0.8":"102.0.5005.148","19.0.9":"102.0.5005.167","19.0.10":"102.0.5005.167","19.0.11":"102.0.5005.167","19.0.12":"102.0.5005.167","19.0.13":"102.0.5005.167","19.0.14":"102.0.5005.167","19.0.15":"102.0.5005.167","19.0.16":"102.0.5005.167","19.0.17":"102.0.5005.167","19.1.0":"102.0.5005.167","19.1.1":"102.0.5005.167","19.1.2":"102.0.5005.167","19.1.3":"102.0.5005.167","19.1.4":"102.0.5005.167","19.1.5":"102.0.5005.167","19.1.6":"102.0.5005.167","19.1.7":"102.0.5005.167","19.1.8":"102.0.5005.167","19.1.9":"102.0.5005.167","20.0.0-alpha.1":"103.0.5044.0","20.0.0-alpha.2":"104.0.5073.0","20.0.0-alpha.3":"104.0.5073.0","20.0.0-alpha.4":"104.0.5073.0","20.0.0-alpha.5":"104.0.5073.0","20.0.0-alpha.6":"104.0.5073.0","20.0.0-alpha.7":"104.0.5073.0","20.0.0-beta.1":"104.0.5073.0","20.0.0-beta.2":"104.0.5073.0","20.0.0-beta.3":"104.0.5073.0","20.0.0-beta.4":"104.0.5073.0","20.0.0-beta.5":"104.0.5073.0","20.0.0-beta.6":"104.0.5073.0","20.0.0-beta.7":"104.0.5073.0","20.0.0-beta.8":"104.0.5073.0","20.0.0-beta.9":"104.0.5112.39","20.0.0-beta.10":"104.0.5112.48","20.0.0-beta.11":"104.0.5112.48","20.0.0-beta.12":"104.0.5112.48","20.0.0-beta.13":"104.0.5112.57","20.0.0-nightly.20220330":"102.0.4962.3","20.0.0-nightly.20220411":"102.0.4971.0","20.0.0-nightly.20220414":"102.0.4989.0","20.0.0-nightly.20220415":"102.0.4989.0","20.0.0-nightly.20220418":"102.0.4989.0","20.0.0-nightly.20220419":"102.0.4989.0","20.0.0-nightly.20220420":"102.0.4989.0","20.0.0-nightly.20220421":"102.0.4989.0","20.0.0-nightly.20220425":"102.0.4999.0","20.0.0-nightly.20220426":"102.0.4999.0","20.0.0-nightly.20220427":"102.0.4999.0","20.0.0-nightly.20220428":"102.0.4999.0","20.0.0-nightly.20220429":"102.0.4999.0","20.0.0-nightly.20220502":"102.0.4999.0","20.0.0-nightly.20220503":"102.0.4999.0","20.0.0-nightly.20220504":"102.0.4999.0","20.0.0-nightly.20220505":"102.0.4999.0","20.0.0-nightly.20220506":"102.0.4999.0","20.0.0-nightly.20220509":"102.0.4999.0","20.0.0-nightly.20220511":"102.0.4999.0","20.0.0-nightly.20220512":"102.0.4999.0","20.0.0-nightly.20220513":"102.0.4999.0","20.0.0-nightly.20220516":"102.0.4999.0","20.0.0-nightly.20220517":"102.0.4999.0","20.0.0-nightly.20220518":"103.0.5044.0","20.0.0-nightly.20220519":"103.0.5044.0","20.0.0-nightly.20220520":"103.0.5044.0","20.0.0-nightly.20220523":"103.0.5044.0","20.0.0-nightly.20220524":"103.0.5044.0","20.0.0":"104.0.5112.65","20.0.1":"104.0.5112.81","20.0.2":"104.0.5112.81","20.0.3":"104.0.5112.81","20.1.0":"104.0.5112.102","20.1.1":"104.0.5112.102","20.1.2":"104.0.5112.114","20.1.3":"104.0.5112.114","20.1.4":"104.0.5112.114","20.2.0":"104.0.5112.124","20.3.0":"104.0.5112.124","20.3.1":"104.0.5112.124","20.3.2":"104.0.5112.124","20.3.3":"104.0.5112.124","20.3.4":"104.0.5112.124","20.3.5":"104.0.5112.124","20.3.6":"104.0.5112.124","20.3.7":"104.0.5112.124","20.3.8":"104.0.5112.124","20.3.9":"104.0.5112.124","20.3.10":"104.0.5112.124","20.3.11":"104.0.5112.124","20.3.12":"104.0.5112.124","21.0.0-alpha.1":"105.0.5187.0","21.0.0-alpha.2":"105.0.5187.0","21.0.0-alpha.3":"105.0.5187.0","21.0.0-alpha.4":"105.0.5187.0","21.0.0-alpha.5":"105.0.5187.0","21.0.0-alpha.6":"106.0.5216.0","21.0.0-beta.1":"106.0.5216.0","21.0.0-beta.2":"106.0.5216.0","21.0.0-beta.3":"106.0.5216.0","21.0.0-beta.4":"106.0.5216.0","21.0.0-beta.5":"106.0.5216.0","21.0.0-beta.6":"106.0.5249.40","21.0.0-beta.7":"106.0.5249.40","21.0.0-beta.8":"106.0.5249.40","21.0.0-nightly.20220526":"103.0.5044.0","21.0.0-nightly.20220527":"103.0.5044.0","21.0.0-nightly.20220530":"103.0.5044.0","21.0.0-nightly.20220531":"103.0.5044.0","21.0.0-nightly.20220602":"104.0.5073.0","21.0.0-nightly.20220603":"104.0.5073.0","21.0.0-nightly.20220606":"104.0.5073.0","21.0.0-nightly.20220607":"104.0.5073.0","21.0.0-nightly.20220608":"104.0.5073.0","21.0.0-nightly.20220609":"104.0.5073.0","21.0.0-nightly.20220610":"104.0.5073.0","21.0.0-nightly.20220613":"104.0.5073.0","21.0.0-nightly.20220614":"104.0.5073.0","21.0.0-nightly.20220615":"104.0.5073.0","21.0.0-nightly.20220616":"104.0.5073.0","21.0.0-nightly.20220617":"104.0.5073.0","21.0.0-nightly.20220620":"104.0.5073.0","21.0.0-nightly.20220621":"104.0.5073.0","21.0.0-nightly.20220622":"104.0.5073.0","21.0.0-nightly.20220623":"104.0.5073.0","21.0.0-nightly.20220624":"104.0.5073.0","21.0.0-nightly.20220627":"104.0.5073.0","21.0.0-nightly.20220628":"105.0.5129.0","21.0.0-nightly.20220629":"105.0.5129.0","21.0.0-nightly.20220630":"105.0.5129.0","21.0.0-nightly.20220701":"105.0.5129.0","21.0.0-nightly.20220704":"105.0.5129.0","21.0.0-nightly.20220705":"105.0.5129.0","21.0.0-nightly.20220706":"105.0.5129.0","21.0.0-nightly.20220707":"105.0.5129.0","21.0.0-nightly.20220708":"105.0.5129.0","21.0.0-nightly.20220711":"105.0.5129.0","21.0.0-nightly.20220712":"105.0.5129.0","21.0.0-nightly.20220713":"105.0.5129.0","21.0.0-nightly.20220715":"105.0.5173.0","21.0.0-nightly.20220718":"105.0.5173.0","21.0.0-nightly.20220719":"105.0.5173.0","21.0.0-nightly.20220720":"105.0.5187.0","21.0.0-nightly.20220721":"105.0.5187.0","21.0.0-nightly.20220722":"105.0.5187.0","21.0.0-nightly.20220725":"105.0.5187.0","21.0.0-nightly.20220726":"105.0.5187.0","21.0.0-nightly.20220727":"105.0.5187.0","21.0.0-nightly.20220728":"105.0.5187.0","21.0.0-nightly.20220801":"105.0.5187.0","21.0.0-nightly.20220802":"105.0.5187.0","21.0.0":"106.0.5249.51","21.0.1":"106.0.5249.61","21.1.0":"106.0.5249.91","21.1.1":"106.0.5249.103","21.2.0":"106.0.5249.119","21.2.1":"106.0.5249.165","21.2.2":"106.0.5249.168","21.2.3":"106.0.5249.168","21.3.0":"106.0.5249.181","21.3.1":"106.0.5249.181","21.3.3":"106.0.5249.199","21.3.4":"106.0.5249.199","21.3.5":"106.0.5249.199","21.4.0":"106.0.5249.199","21.4.1":"106.0.5249.199","21.4.2":"106.0.5249.199","21.4.3":"106.0.5249.199","21.4.4":"106.0.5249.199","22.0.0-alpha.1":"107.0.5286.0","22.0.0-alpha.3":"108.0.5329.0","22.0.0-alpha.4":"108.0.5329.0","22.0.0-alpha.5":"108.0.5329.0","22.0.0-alpha.6":"108.0.5329.0","22.0.0-alpha.7":"108.0.5355.0","22.0.0-alpha.8":"108.0.5359.10","22.0.0-beta.1":"108.0.5359.10","22.0.0-beta.2":"108.0.5359.10","22.0.0-beta.3":"108.0.5359.10","22.0.0-beta.4":"108.0.5359.29","22.0.0-beta.5":"108.0.5359.40","22.0.0-beta.6":"108.0.5359.40","22.0.0-beta.7":"108.0.5359.48","22.0.0-beta.8":"108.0.5359.48","22.0.0-nightly.20220808":"105.0.5187.0","22.0.0-nightly.20220809":"105.0.5187.0","22.0.0-nightly.20220810":"105.0.5187.0","22.0.0-nightly.20220811":"105.0.5187.0","22.0.0-nightly.20220812":"105.0.5187.0","22.0.0-nightly.20220815":"105.0.5187.0","22.0.0-nightly.20220816":"105.0.5187.0","22.0.0-nightly.20220817":"105.0.5187.0","22.0.0-nightly.20220822":"106.0.5216.0","22.0.0-nightly.20220823":"106.0.5216.0","22.0.0-nightly.20220824":"106.0.5216.0","22.0.0-nightly.20220825":"106.0.5216.0","22.0.0-nightly.20220829":"106.0.5216.0","22.0.0-nightly.20220830":"106.0.5216.0","22.0.0-nightly.20220831":"106.0.5216.0","22.0.0-nightly.20220901":"106.0.5216.0","22.0.0-nightly.20220902":"106.0.5216.0","22.0.0-nightly.20220905":"106.0.5216.0","22.0.0-nightly.20220908":"107.0.5274.0","22.0.0-nightly.20220909":"107.0.5286.0","22.0.0-nightly.20220912":"107.0.5286.0","22.0.0-nightly.20220913":"107.0.5286.0","22.0.0-nightly.20220914":"107.0.5286.0","22.0.0-nightly.20220915":"107.0.5286.0","22.0.0-nightly.20220916":"107.0.5286.0","22.0.0-nightly.20220919":"107.0.5286.0","22.0.0-nightly.20220920":"107.0.5286.0","22.0.0-nightly.20220921":"107.0.5286.0","22.0.0-nightly.20220922":"107.0.5286.0","22.0.0-nightly.20220923":"107.0.5286.0","22.0.0-nightly.20220926":"107.0.5286.0","22.0.0-nightly.20220927":"107.0.5286.0","22.0.0-nightly.20220928":"107.0.5286.0","22.0.0":"108.0.5359.62","22.0.1":"108.0.5359.125","22.0.2":"108.0.5359.179","22.0.3":"108.0.5359.179","22.1.0":"108.0.5359.179","22.2.0":"108.0.5359.215","22.2.1":"108.0.5359.215","22.3.0":"108.0.5359.215","22.3.1":"108.0.5359.215","22.3.2":"108.0.5359.215","22.3.3":"108.0.5359.215","22.3.4":"108.0.5359.215","22.3.5":"108.0.5359.215","22.3.6":"108.0.5359.215","22.3.7":"108.0.5359.215","22.3.8":"108.0.5359.215","22.3.9":"108.0.5359.215","22.3.10":"108.0.5359.215","22.3.11":"108.0.5359.215","22.3.12":"108.0.5359.215","22.3.13":"108.0.5359.215","22.3.14":"108.0.5359.215","22.3.15":"108.0.5359.215","22.3.16":"108.0.5359.215","22.3.17":"108.0.5359.215","22.3.18":"108.0.5359.215","22.3.20":"108.0.5359.215","22.3.21":"108.0.5359.215","22.3.22":"108.0.5359.215","22.3.23":"108.0.5359.215","22.3.24":"108.0.5359.215","22.3.25":"108.0.5359.215","22.3.26":"108.0.5359.215","22.3.27":"108.0.5359.215","23.0.0-alpha.1":"110.0.5415.0","23.0.0-alpha.2":"110.0.5451.0","23.0.0-alpha.3":"110.0.5451.0","23.0.0-beta.1":"110.0.5478.5","23.0.0-beta.2":"110.0.5478.5","23.0.0-beta.3":"110.0.5478.5","23.0.0-beta.4":"110.0.5481.30","23.0.0-beta.5":"110.0.5481.38","23.0.0-beta.6":"110.0.5481.52","23.0.0-beta.8":"110.0.5481.52","23.0.0-nightly.20220929":"107.0.5286.0","23.0.0-nightly.20220930":"107.0.5286.0","23.0.0-nightly.20221003":"107.0.5286.0","23.0.0-nightly.20221004":"108.0.5329.0","23.0.0-nightly.20221005":"108.0.5329.0","23.0.0-nightly.20221006":"108.0.5329.0","23.0.0-nightly.20221007":"108.0.5329.0","23.0.0-nightly.20221010":"108.0.5329.0","23.0.0-nightly.20221011":"108.0.5329.0","23.0.0-nightly.20221012":"108.0.5329.0","23.0.0-nightly.20221013":"108.0.5329.0","23.0.0-nightly.20221014":"108.0.5329.0","23.0.0-nightly.20221017":"108.0.5329.0","23.0.0-nightly.20221018":"108.0.5355.0","23.0.0-nightly.20221019":"108.0.5355.0","23.0.0-nightly.20221020":"108.0.5355.0","23.0.0-nightly.20221021":"108.0.5355.0","23.0.0-nightly.20221024":"108.0.5355.0","23.0.0-nightly.20221026":"108.0.5355.0","23.0.0-nightly.20221027":"109.0.5382.0","23.0.0-nightly.20221028":"109.0.5382.0","23.0.0-nightly.20221031":"109.0.5382.0","23.0.0-nightly.20221101":"109.0.5382.0","23.0.0-nightly.20221102":"109.0.5382.0","23.0.0-nightly.20221103":"109.0.5382.0","23.0.0-nightly.20221104":"109.0.5382.0","23.0.0-nightly.20221107":"109.0.5382.0","23.0.0-nightly.20221108":"109.0.5382.0","23.0.0-nightly.20221109":"109.0.5382.0","23.0.0-nightly.20221110":"109.0.5382.0","23.0.0-nightly.20221111":"109.0.5382.0","23.0.0-nightly.20221114":"109.0.5382.0","23.0.0-nightly.20221115":"109.0.5382.0","23.0.0-nightly.20221116":"109.0.5382.0","23.0.0-nightly.20221117":"109.0.5382.0","23.0.0-nightly.20221118":"110.0.5415.0","23.0.0-nightly.20221121":"110.0.5415.0","23.0.0-nightly.20221122":"110.0.5415.0","23.0.0-nightly.20221123":"110.0.5415.0","23.0.0-nightly.20221124":"110.0.5415.0","23.0.0-nightly.20221125":"110.0.5415.0","23.0.0-nightly.20221128":"110.0.5415.0","23.0.0-nightly.20221129":"110.0.5415.0","23.0.0-nightly.20221130":"110.0.5415.0","23.0.0":"110.0.5481.77","23.1.0":"110.0.5481.100","23.1.1":"110.0.5481.104","23.1.2":"110.0.5481.177","23.1.3":"110.0.5481.179","23.1.4":"110.0.5481.192","23.2.0":"110.0.5481.192","23.2.1":"110.0.5481.208","23.2.2":"110.0.5481.208","23.2.3":"110.0.5481.208","23.2.4":"110.0.5481.208","23.3.0":"110.0.5481.208","23.3.1":"110.0.5481.208","23.3.2":"110.0.5481.208","23.3.3":"110.0.5481.208","23.3.4":"110.0.5481.208","23.3.5":"110.0.5481.208","23.3.6":"110.0.5481.208","23.3.7":"110.0.5481.208","23.3.8":"110.0.5481.208","23.3.9":"110.0.5481.208","23.3.10":"110.0.5481.208","23.3.11":"110.0.5481.208","23.3.12":"110.0.5481.208","23.3.13":"110.0.5481.208","24.0.0-alpha.1":"111.0.5560.0","24.0.0-alpha.2":"111.0.5560.0","24.0.0-alpha.3":"111.0.5560.0","24.0.0-alpha.4":"111.0.5560.0","24.0.0-alpha.5":"111.0.5560.0","24.0.0-alpha.6":"111.0.5560.0","24.0.0-alpha.7":"111.0.5560.0","24.0.0-beta.1":"111.0.5563.50","24.0.0-beta.2":"111.0.5563.50","24.0.0-beta.3":"112.0.5615.20","24.0.0-beta.4":"112.0.5615.20","24.0.0-beta.5":"112.0.5615.29","24.0.0-beta.6":"112.0.5615.39","24.0.0-beta.7":"112.0.5615.39","24.0.0-nightly.20221201":"110.0.5415.0","24.0.0-nightly.20221202":"110.0.5415.0","24.0.0-nightly.20221205":"110.0.5415.0","24.0.0-nightly.20221206":"110.0.5451.0","24.0.0-nightly.20221207":"110.0.5451.0","24.0.0-nightly.20221208":"110.0.5451.0","24.0.0-nightly.20221213":"110.0.5451.0","24.0.0-nightly.20221214":"110.0.5451.0","24.0.0-nightly.20221215":"110.0.5451.0","24.0.0-nightly.20221216":"110.0.5451.0","24.0.0-nightly.20230109":"111.0.5518.0","24.0.0-nightly.20230110":"111.0.5518.0","24.0.0-nightly.20230111":"111.0.5518.0","24.0.0-nightly.20230112":"111.0.5518.0","24.0.0-nightly.20230113":"111.0.5518.0","24.0.0-nightly.20230116":"111.0.5518.0","24.0.0-nightly.20230117":"111.0.5518.0","24.0.0-nightly.20230118":"111.0.5518.0","24.0.0-nightly.20230119":"111.0.5518.0","24.0.0-nightly.20230120":"111.0.5518.0","24.0.0-nightly.20230123":"111.0.5518.0","24.0.0-nightly.20230124":"111.0.5518.0","24.0.0-nightly.20230125":"111.0.5518.0","24.0.0-nightly.20230126":"111.0.5518.0","24.0.0-nightly.20230127":"111.0.5518.0","24.0.0-nightly.20230131":"111.0.5518.0","24.0.0-nightly.20230201":"111.0.5518.0","24.0.0-nightly.20230202":"111.0.5518.0","24.0.0-nightly.20230203":"111.0.5560.0","24.0.0-nightly.20230206":"111.0.5560.0","24.0.0-nightly.20230207":"111.0.5560.0","24.0.0-nightly.20230208":"111.0.5560.0","24.0.0-nightly.20230209":"111.0.5560.0","24.0.0":"112.0.5615.49","24.1.0":"112.0.5615.50","24.1.1":"112.0.5615.50","24.1.2":"112.0.5615.87","24.1.3":"112.0.5615.165","24.2.0":"112.0.5615.165","24.3.0":"112.0.5615.165","24.3.1":"112.0.5615.183","24.4.0":"112.0.5615.204","24.4.1":"112.0.5615.204","24.5.0":"112.0.5615.204","24.5.1":"112.0.5615.204","24.6.0":"112.0.5615.204","24.6.1":"112.0.5615.204","24.6.2":"112.0.5615.204","24.6.3":"112.0.5615.204","24.6.4":"112.0.5615.204","24.6.5":"112.0.5615.204","24.7.0":"112.0.5615.204","24.7.1":"112.0.5615.204","24.8.0":"112.0.5615.204","24.8.1":"112.0.5615.204","24.8.2":"112.0.5615.204","24.8.3":"112.0.5615.204","24.8.4":"112.0.5615.204","24.8.5":"112.0.5615.204","24.8.6":"112.0.5615.204","24.8.7":"112.0.5615.204","25.0.0-alpha.1":"114.0.5694.0","25.0.0-alpha.2":"114.0.5694.0","25.0.0-alpha.3":"114.0.5710.0","25.0.0-alpha.4":"114.0.5710.0","25.0.0-alpha.5":"114.0.5719.0","25.0.0-alpha.6":"114.0.5719.0","25.0.0-beta.1":"114.0.5719.0","25.0.0-beta.2":"114.0.5719.0","25.0.0-beta.3":"114.0.5719.0","25.0.0-beta.4":"114.0.5735.16","25.0.0-beta.5":"114.0.5735.16","25.0.0-beta.6":"114.0.5735.16","25.0.0-beta.7":"114.0.5735.16","25.0.0-beta.8":"114.0.5735.35","25.0.0-beta.9":"114.0.5735.45","25.0.0-nightly.20230210":"111.0.5560.0","25.0.0-nightly.20230214":"111.0.5560.0","25.0.0-nightly.20230215":"111.0.5560.0","25.0.0-nightly.20230216":"111.0.5560.0","25.0.0-nightly.20230217":"111.0.5560.0","25.0.0-nightly.20230220":"111.0.5560.0","25.0.0-nightly.20230221":"111.0.5560.0","25.0.0-nightly.20230222":"111.0.5560.0","25.0.0-nightly.20230223":"111.0.5560.0","25.0.0-nightly.20230224":"111.0.5560.0","25.0.0-nightly.20230227":"111.0.5560.0","25.0.0-nightly.20230228":"111.0.5560.0","25.0.0-nightly.20230301":"111.0.5560.0","25.0.0-nightly.20230302":"111.0.5560.0","25.0.0-nightly.20230303":"111.0.5560.0","25.0.0-nightly.20230306":"111.0.5560.0","25.0.0-nightly.20230307":"111.0.5560.0","25.0.0-nightly.20230308":"111.0.5560.0","25.0.0-nightly.20230309":"111.0.5560.0","25.0.0-nightly.20230310":"111.0.5560.0","25.0.0-nightly.20230314":"113.0.5636.0","25.0.0-nightly.20230315":"113.0.5651.0","25.0.0-nightly.20230317":"113.0.5653.0","25.0.0-nightly.20230320":"113.0.5660.0","25.0.0-nightly.20230321":"113.0.5664.0","25.0.0-nightly.20230322":"113.0.5666.0","25.0.0-nightly.20230323":"113.0.5668.0","25.0.0-nightly.20230324":"113.0.5670.0","25.0.0-nightly.20230327":"113.0.5670.0","25.0.0-nightly.20230328":"113.0.5670.0","25.0.0-nightly.20230329":"113.0.5670.0","25.0.0-nightly.20230330":"113.0.5670.0","25.0.0-nightly.20230331":"114.0.5684.0","25.0.0-nightly.20230403":"114.0.5684.0","25.0.0-nightly.20230404":"114.0.5692.0","25.0.0-nightly.20230405":"114.0.5694.0","25.0.0":"114.0.5735.45","25.0.1":"114.0.5735.45","25.1.0":"114.0.5735.106","25.1.1":"114.0.5735.106","25.2.0":"114.0.5735.134","25.3.0":"114.0.5735.199","25.3.1":"114.0.5735.243","25.3.2":"114.0.5735.248","25.4.0":"114.0.5735.248","25.5.0":"114.0.5735.289","25.6.0":"114.0.5735.289","25.7.0":"114.0.5735.289","25.8.0":"114.0.5735.289","25.8.1":"114.0.5735.289","25.8.2":"114.0.5735.289","25.8.3":"114.0.5735.289","25.8.4":"114.0.5735.289","25.9.0":"114.0.5735.289","26.0.0-alpha.1":"116.0.5791.0","26.0.0-alpha.2":"116.0.5791.0","26.0.0-alpha.3":"116.0.5791.0","26.0.0-alpha.4":"116.0.5791.0","26.0.0-alpha.5":"116.0.5791.0","26.0.0-alpha.6":"116.0.5815.0","26.0.0-alpha.7":"116.0.5831.0","26.0.0-alpha.8":"116.0.5845.0","26.0.0-beta.1":"116.0.5845.0","26.0.0-beta.2":"116.0.5845.14","26.0.0-beta.3":"116.0.5845.14","26.0.0-beta.4":"116.0.5845.14","26.0.0-beta.5":"116.0.5845.14","26.0.0-beta.6":"116.0.5845.14","26.0.0-beta.7":"116.0.5845.14","26.0.0-beta.8":"116.0.5845.42","26.0.0-beta.9":"116.0.5845.42","26.0.0-beta.10":"116.0.5845.49","26.0.0-beta.11":"116.0.5845.49","26.0.0-beta.12":"116.0.5845.62","26.0.0-nightly.20230406":"114.0.5694.0","26.0.0-nightly.20230407":"114.0.5694.0","26.0.0-nightly.20230410":"114.0.5694.0","26.0.0-nightly.20230411":"114.0.5694.0","26.0.0-nightly.20230412":"114.0.5708.0","26.0.0-nightly.20230413":"114.0.5710.0","26.0.0-nightly.20230414":"114.0.5710.0","26.0.0-nightly.20230417":"114.0.5710.0","26.0.0-nightly.20230418":"114.0.5715.0","26.0.0-nightly.20230421":"114.0.5719.0","26.0.0-nightly.20230424":"114.0.5719.0","26.0.0-nightly.20230425":"114.0.5719.0","26.0.0-nightly.20230426":"114.0.5719.0","26.0.0-nightly.20230427":"114.0.5719.0","26.0.0-nightly.20230428":"114.0.5719.0","26.0.0-nightly.20230501":"114.0.5719.0","26.0.0-nightly.20230502":"114.0.5719.0","26.0.0-nightly.20230503":"114.0.5719.0","26.0.0-nightly.20230504":"114.0.5719.0","26.0.0-nightly.20230505":"114.0.5719.0","26.0.0-nightly.20230508":"114.0.5719.0","26.0.0-nightly.20230509":"114.0.5719.0","26.0.0-nightly.20230510":"114.0.5719.0","26.0.0-nightly.20230511":"115.0.5760.0","26.0.0-nightly.20230512":"115.0.5760.0","26.0.0-nightly.20230515":"115.0.5760.0","26.0.0-nightly.20230516":"115.0.5760.0","26.0.0-nightly.20230517":"115.0.5760.0","26.0.0-nightly.20230518":"115.0.5760.0","26.0.0-nightly.20230519":"115.0.5760.0","26.0.0-nightly.20230522":"115.0.5760.0","26.0.0-nightly.20230523":"115.0.5760.0","26.0.0-nightly.20230524":"115.0.5786.0","26.0.0-nightly.20230525":"115.0.5790.0","26.0.0-nightly.20230526":"116.0.5791.0","26.0.0-nightly.20230529":"116.0.5791.0","26.0.0-nightly.20230530":"116.0.5791.0","26.0.0-nightly.20230531":"116.0.5791.0","26.0.0":"116.0.5845.82","26.1.0":"116.0.5845.97","26.2.0":"116.0.5845.179","26.2.1":"116.0.5845.188","26.2.2":"116.0.5845.190","26.2.3":"116.0.5845.190","26.2.4":"116.0.5845.190","26.3.0":"116.0.5845.228","27.0.0-alpha.1":"118.0.5949.0","27.0.0-alpha.2":"118.0.5949.0","27.0.0-alpha.3":"118.0.5949.0","27.0.0-alpha.4":"118.0.5949.0","27.0.0-alpha.5":"118.0.5949.0","27.0.0-alpha.6":"118.0.5949.0","27.0.0-beta.1":"118.0.5993.5","27.0.0-beta.2":"118.0.5993.5","27.0.0-beta.3":"118.0.5993.5","27.0.0-beta.4":"118.0.5993.11","27.0.0-beta.5":"118.0.5993.18","27.0.0-beta.6":"118.0.5993.18","27.0.0-beta.7":"118.0.5993.18","27.0.0-beta.8":"118.0.5993.18","27.0.0-beta.9":"118.0.5993.18","27.0.0-nightly.20230601":"116.0.5791.0","27.0.0-nightly.20230602":"116.0.5791.0","27.0.0-nightly.20230605":"116.0.5791.0","27.0.0-nightly.20230606":"116.0.5791.0","27.0.0-nightly.20230607":"116.0.5791.0","27.0.0-nightly.20230609":"116.0.5791.0","27.0.0-nightly.20230612":"116.0.5815.0","27.0.0-nightly.20230613":"116.0.5815.0","27.0.0-nightly.20230614":"116.0.5829.0","27.0.0-nightly.20230615":"116.0.5831.0","27.0.0-nightly.20230616":"116.0.5833.0","27.0.0-nightly.20230619":"116.0.5833.0","27.0.0-nightly.20230620":"116.0.5833.0","27.0.0-nightly.20230621":"116.0.5833.0","27.0.0-nightly.20230622":"116.0.5845.0","27.0.0-nightly.20230623":"116.0.5845.0","27.0.0-nightly.20230626":"116.0.5845.0","27.0.0-nightly.20230627":"116.0.5845.0","27.0.0-nightly.20230628":"116.0.5845.0","27.0.0-nightly.20230629":"116.0.5845.0","27.0.0-nightly.20230630":"116.0.5845.0","27.0.0-nightly.20230703":"117.0.5852.0","27.0.0-nightly.20230704":"117.0.5852.0","27.0.0-nightly.20230705":"117.0.5852.0","27.0.0-nightly.20230706":"117.0.5852.0","27.0.0-nightly.20230707":"117.0.5852.0","27.0.0-nightly.20230710":"117.0.5852.0","27.0.0-nightly.20230711":"117.0.5852.0","27.0.0-nightly.20230712":"117.0.5852.0","27.0.0-nightly.20230713":"117.0.5852.0","27.0.0-nightly.20230714":"117.0.5852.0","27.0.0-nightly.20230717":"117.0.5884.1","27.0.0-nightly.20230718":"117.0.5884.1","27.0.0-nightly.20230719":"117.0.5892.0","27.0.0-nightly.20230720":"117.0.5897.0","27.0.0-nightly.20230721":"117.0.5897.0","27.0.0-nightly.20230724":"117.0.5897.0","27.0.0-nightly.20230725":"117.0.5897.0","27.0.0-nightly.20230726":"117.0.5897.0","27.0.0-nightly.20230727":"117.0.5897.0","27.0.0-nightly.20230728":"117.0.5897.0","27.0.0-nightly.20230731":"117.0.5897.0","27.0.0-nightly.20230801":"117.0.5911.0","27.0.0-nightly.20230802":"117.0.5911.0","27.0.0-nightly.20230803":"117.0.5911.0","27.0.0-nightly.20230804":"117.0.5921.0","27.0.0-nightly.20230807":"117.0.5921.0","27.0.0-nightly.20230808":"117.0.5921.0","27.0.0-nightly.20230814":"117.0.5921.0","27.0.0-nightly.20230815":"117.0.5921.0","27.0.0-nightly.20230816":"118.0.5949.0","27.0.0":"118.0.5993.54","28.0.0-nightly.20230817":"118.0.5949.0","28.0.0-nightly.20230818":"118.0.5949.0","28.0.0-nightly.20230821":"118.0.5949.0","28.0.0-nightly.20230822":"118.0.5949.0","28.0.0-nightly.20230823":"118.0.5949.0","28.0.0-nightly.20230824":"118.0.5949.0","28.0.0-nightly.20230825":"118.0.5949.0","28.0.0-nightly.20230828":"118.0.5949.0","28.0.0-nightly.20230829":"118.0.5949.0","28.0.0-nightly.20230830":"118.0.5949.0","28.0.0-nightly.20230831":"118.0.5949.0","28.0.0-nightly.20230906":"118.0.5991.0","28.0.0-nightly.20230907":"118.0.5993.0","28.0.0-nightly.20230908":"118.0.5993.0","28.0.0-nightly.20230911":"118.0.5993.0","28.0.0-nightly.20230912":"118.0.5993.0","28.0.0-nightly.20230913":"118.0.5993.0","28.0.0-nightly.20230914":"118.0.5993.0","28.0.0-nightly.20230915":"118.0.5993.0","28.0.0-nightly.20230919":"119.0.6006.0","28.0.0-nightly.20230920":"119.0.6017.0","28.0.0-nightly.20230921":"119.0.6019.2","28.0.0-nightly.20230925":"119.0.6019.2","28.0.0-nightly.20230926":"119.0.6019.2","28.0.0-nightly.20230927":"119.0.6019.2","28.0.0-nightly.20230928":"119.0.6019.2","28.0.0-nightly.20230929":"119.0.6029.0","28.0.0-nightly.20231002":"119.0.6029.0","28.0.0-nightly.20231003":"119.0.6043.0","28.0.0-nightly.20231004":"119.0.6043.0","28.0.0-nightly.20231005":"119.0.6043.0","28.0.0-nightly.20231006":"119.0.6045.0","28.0.0-nightly.20231009":"119.0.6045.0","28.0.0-nightly.20231010":"119.0.6045.0"}
\ No newline at end of file
diff --git a/tools/node_modules/eslint/node_modules/electron-to-chromium/package.json b/tools/node_modules/eslint/node_modules/electron-to-chromium/package.json
index a49c26dd4af7c2..db0151ad980727 100644
--- a/tools/node_modules/eslint/node_modules/electron-to-chromium/package.json
+++ b/tools/node_modules/eslint/node_modules/electron-to-chromium/package.json
@@ -1,6 +1,6 @@
 {
   "name": "electron-to-chromium",
-  "version": "1.4.513",
+  "version": "1.4.549",
   "description": "Provides a list of electron-to-chromium version mappings",
   "main": "index.js",
   "files": [
diff --git a/tools/node_modules/eslint/node_modules/electron-to-chromium/versions.js b/tools/node_modules/eslint/node_modules/electron-to-chromium/versions.js
index d642569301a28c..242ef583b8d2ce 100644
--- a/tools/node_modules/eslint/node_modules/electron-to-chromium/versions.js
+++ b/tools/node_modules/eslint/node_modules/electron-to-chromium/versions.js
@@ -130,8 +130,10 @@ module.exports = {
 	"25.6": "114",
 	"25.7": "114",
 	"25.8": "114",
+	"25.9": "114",
 	"26.0": "116",
 	"26.1": "116",
 	"26.2": "116",
+	"26.3": "116",
 	"27.0": "118"
 };
\ No newline at end of file
diff --git a/tools/node_modules/eslint/node_modules/electron-to-chromium/versions.json b/tools/node_modules/eslint/node_modules/electron-to-chromium/versions.json
index b9e7537946816d..4a3b66325bf102 100644
--- a/tools/node_modules/eslint/node_modules/electron-to-chromium/versions.json
+++ b/tools/node_modules/eslint/node_modules/electron-to-chromium/versions.json
@@ -1 +1 @@
-{"0.20":"39","0.21":"41","0.22":"41","0.23":"41","0.24":"41","0.25":"42","0.26":"42","0.27":"43","0.28":"43","0.29":"43","0.30":"44","0.31":"45","0.32":"45","0.33":"45","0.34":"45","0.35":"45","0.36":"47","0.37":"49","1.0":"49","1.1":"50","1.2":"51","1.3":"52","1.4":"53","1.5":"54","1.6":"56","1.7":"58","1.8":"59","2.0":"61","2.1":"61","3.0":"66","3.1":"66","4.0":"69","4.1":"69","4.2":"69","5.0":"73","6.0":"76","6.1":"76","7.0":"78","7.1":"78","7.2":"78","7.3":"78","8.0":"80","8.1":"80","8.2":"80","8.3":"80","8.4":"80","8.5":"80","9.0":"83","9.1":"83","9.2":"83","9.3":"83","9.4":"83","10.0":"85","10.1":"85","10.2":"85","10.3":"85","10.4":"85","11.0":"87","11.1":"87","11.2":"87","11.3":"87","11.4":"87","11.5":"87","12.0":"89","12.1":"89","12.2":"89","13.0":"91","13.1":"91","13.2":"91","13.3":"91","13.4":"91","13.5":"91","13.6":"91","14.0":"93","14.1":"93","14.2":"93","15.0":"94","15.1":"94","15.2":"94","15.3":"94","15.4":"94","15.5":"94","16.0":"96","16.1":"96","16.2":"96","17.0":"98","17.1":"98","17.2":"98","17.3":"98","17.4":"98","18.0":"100","18.1":"100","18.2":"100","18.3":"100","19.0":"102","19.1":"102","20.0":"104","20.1":"104","20.2":"104","20.3":"104","21.0":"106","21.1":"106","21.2":"106","21.3":"106","21.4":"106","22.0":"108","22.1":"108","22.2":"108","22.3":"108","23.0":"110","23.1":"110","23.2":"110","23.3":"110","24.0":"112","24.1":"112","24.2":"112","24.3":"112","24.4":"112","24.5":"112","24.6":"112","24.7":"112","24.8":"112","25.0":"114","25.1":"114","25.2":"114","25.3":"114","25.4":"114","25.5":"114","25.6":"114","25.7":"114","25.8":"114","26.0":"116","26.1":"116","26.2":"116","27.0":"118"}
\ No newline at end of file
+{"0.20":"39","0.21":"41","0.22":"41","0.23":"41","0.24":"41","0.25":"42","0.26":"42","0.27":"43","0.28":"43","0.29":"43","0.30":"44","0.31":"45","0.32":"45","0.33":"45","0.34":"45","0.35":"45","0.36":"47","0.37":"49","1.0":"49","1.1":"50","1.2":"51","1.3":"52","1.4":"53","1.5":"54","1.6":"56","1.7":"58","1.8":"59","2.0":"61","2.1":"61","3.0":"66","3.1":"66","4.0":"69","4.1":"69","4.2":"69","5.0":"73","6.0":"76","6.1":"76","7.0":"78","7.1":"78","7.2":"78","7.3":"78","8.0":"80","8.1":"80","8.2":"80","8.3":"80","8.4":"80","8.5":"80","9.0":"83","9.1":"83","9.2":"83","9.3":"83","9.4":"83","10.0":"85","10.1":"85","10.2":"85","10.3":"85","10.4":"85","11.0":"87","11.1":"87","11.2":"87","11.3":"87","11.4":"87","11.5":"87","12.0":"89","12.1":"89","12.2":"89","13.0":"91","13.1":"91","13.2":"91","13.3":"91","13.4":"91","13.5":"91","13.6":"91","14.0":"93","14.1":"93","14.2":"93","15.0":"94","15.1":"94","15.2":"94","15.3":"94","15.4":"94","15.5":"94","16.0":"96","16.1":"96","16.2":"96","17.0":"98","17.1":"98","17.2":"98","17.3":"98","17.4":"98","18.0":"100","18.1":"100","18.2":"100","18.3":"100","19.0":"102","19.1":"102","20.0":"104","20.1":"104","20.2":"104","20.3":"104","21.0":"106","21.1":"106","21.2":"106","21.3":"106","21.4":"106","22.0":"108","22.1":"108","22.2":"108","22.3":"108","23.0":"110","23.1":"110","23.2":"110","23.3":"110","24.0":"112","24.1":"112","24.2":"112","24.3":"112","24.4":"112","24.5":"112","24.6":"112","24.7":"112","24.8":"112","25.0":"114","25.1":"114","25.2":"114","25.3":"114","25.4":"114","25.5":"114","25.6":"114","25.7":"114","25.8":"114","25.9":"114","26.0":"116","26.1":"116","26.2":"116","26.3":"116","27.0":"118"}
\ No newline at end of file
diff --git a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/iterateJsdoc.js b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/iterateJsdoc.js
index e05326790e8580..e1e5d21e8a7c4d 100644
--- a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/iterateJsdoc.js
+++ b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/iterateJsdoc.js
@@ -680,7 +680,11 @@ const getBasicUtils = (context, {
  */
 const getUtils = (node, jsdoc, jsdocNode, settings, report, context, iteratingAll, ruleConfig, indent) => {
   const ancestors = /** @type {import('eslint').Rule.Node[]} */context.getAncestors();
-  const sourceCode = context.getSourceCode();
+
+  // istanbul ignore next -- Fallback to deprecated method
+  const {
+    sourceCode = context.getSourceCode()
+  } = context;
   const utils = /** @type {Utils} */getBasicUtils(context, settings);
   const {
     tagNamePreference,
@@ -1844,7 +1848,10 @@ const iterateAllJsdocs = (iterator, ruleConfig, contexts, additiveCommentContext
    * @returns {void}
    */
   const callIterator = (context, node, jsdocNodes, state, lastCall) => {
-    const sourceCode = context.getSourceCode();
+    // istanbul ignore next -- Fallback to deprecated method
+    const {
+      sourceCode = context.getSourceCode()
+    } = context;
     const {
       lines
     } = sourceCode;
@@ -1908,7 +1915,10 @@ const iterateAllJsdocs = (iterator, ruleConfig, contexts, additiveCommentContext
   return {
     // @ts-expect-error ESLint accepts
     create(context) {
-      const sourceCode = context.getSourceCode();
+      // istanbul ignore next -- Fallback to deprecated method
+      const {
+        sourceCode = context.getSourceCode()
+      } = context;
       settings = getSettings(context);
       if (!settings) {
         return {};
@@ -1967,7 +1977,10 @@ const iterateAllJsdocs = (iterator, ruleConfig, contexts, additiveCommentContext
 const checkFile = (iterator, ruleConfig) => {
   return {
     create(context) {
-      const sourceCode = context.getSourceCode();
+      // istanbul ignore next -- Fallback to deprecated method
+      const {
+        sourceCode = context.getSourceCode()
+      } = context;
       const settings = getSettings(context);
       if (!settings) {
         return {};
@@ -2057,7 +2070,11 @@ function iterateJsdoc(iterator, ruleConfig) {
           return iterateAllJsdocs(iterator, ruleConfig, hasObjectAny ? /** @type {ContextObject[]} */contexts : null, ruleConfig.matchContext).create(context);
         }
       }
-      const sourceCode = context.getSourceCode();
+
+      // istanbul ignore next -- Fallback to deprecated method
+      const {
+        sourceCode = context.getSourceCode()
+      } = context;
       const {
         lines
       } = sourceCode;
diff --git a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/informativeDocs.js b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/informativeDocs.js
index 3a9425ca4e41e7..23f7c810338b77 100644
--- a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/informativeDocs.js
+++ b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/informativeDocs.js
@@ -65,8 +65,9 @@ var _default = (0, _iterateJsdoc.default)(({
   report,
   utils
 }) => {
-  const {
+  const /** @type {{aliases: {[key: string]: string[]}, excludedTags: string[], uselessWords: string[]}} */{
     aliases = defaultAliases,
+    excludedTags = [],
     uselessWords = defaultUselessWords
   } = context.options[0] || {};
   const nodeNames = getNamesFromNode(node);
@@ -89,6 +90,9 @@ var _default = (0, _iterateJsdoc.default)(({
   } = utils.getDescription();
   let descriptionReported = false;
   for (const tag of jsdoc.tags) {
+    if (excludedTags.includes(tag.tag)) {
+      continue;
+    }
     if (descriptionIsRedundant(tag.description, tag.name)) {
       utils.reportJSDoc('This tag description only repeats the name it describes.', tag);
     }
@@ -109,6 +113,16 @@ var _default = (0, _iterateJsdoc.default)(({
       additionalProperties: false,
       properties: {
         aliases: {
+          patternProperties: {
+            '.*': {
+              items: {
+                type: 'string'
+              },
+              type: 'array'
+            }
+          }
+        },
+        excludedTags: {
           items: {
             type: 'string'
           },
diff --git a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireDescriptionCompleteSentence.js b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireDescriptionCompleteSentence.js
index c2912f496bc7f8..2cf64b37d7731f 100644
--- a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireDescriptionCompleteSentence.js
+++ b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireDescriptionCompleteSentence.js
@@ -29,7 +29,7 @@ const extractParagraphs = text => {
 const extractSentences = (text, abbreviationsRegex) => {
   const txt = text
   // Remove all {} tags.
-  .replaceAll(/\{[\s\S]*?\}\s*/gu, '')
+  .replaceAll(/(?<!^)\{[\s\S]*?\}\s*/gu, '')
 
   // Remove custom abbreviations
   .replace(abbreviationsRegex, '');
diff --git a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireJsdoc.js b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireJsdoc.js
index 483f9ef2e6bcab..9944c57fcdf771 100644
--- a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireJsdoc.js
+++ b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireJsdoc.js
@@ -235,7 +235,10 @@ const getOptions = (context, settings) => {
 /** @type {import('eslint').Rule.RuleModule} */
 var _default = {
   create(context) {
-    const sourceCode = context.getSourceCode();
+    // istanbul ignore next -- Fallback to deprecated method
+    const {
+      sourceCode = context.getSourceCode()
+    } = context;
     const settings = (0, _iterateJsdoc.getSettings)(context);
     if (!settings) {
       return {};
diff --git a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireReturns.js b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireReturns.js
index 2e5ff041eb3d9f..e20e125ebcff05 100644
--- a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireReturns.js
+++ b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/dist/rules/requireReturns.js
@@ -4,6 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = void 0;
+var _exportParser = _interopRequireDefault(require("../exportParser.js"));
 var _iterateJsdoc = _interopRequireDefault(require("../iterateJsdoc.js"));
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 /**
@@ -36,14 +37,18 @@ var _default = (0, _iterateJsdoc.default)(({
   info: {
     comment
   },
+  node,
   report,
+  settings,
   utils,
   context
 }) => {
   const {
     contexts,
+    enableFixer = false,
     forceRequireReturn = false,
-    forceReturnsWithAsync = false
+    forceReturnsWithAsync = false,
+    publicOnly = false
   } = context.options[0] || {};
 
   // A preflight check. We do not need to run a deep check
@@ -81,6 +86,23 @@ var _default = (0, _iterateJsdoc.default)(({
     if (!missingReturnTag) {
       return false;
     }
+    if (publicOnly) {
+      /** @type {import('./requireJsdoc.js').RequireJsdocOpts} */
+      const opt = {
+        ancestorsOnly: Boolean((publicOnly === null || publicOnly === void 0 ? void 0 : publicOnly.ancestorsOnly) ?? false),
+        esm: Boolean((publicOnly === null || publicOnly === void 0 ? void 0 : publicOnly.esm) ?? true),
+        initModuleExports: Boolean((publicOnly === null || publicOnly === void 0 ? void 0 : publicOnly.cjs) ?? true),
+        initWindow: Boolean((publicOnly === null || publicOnly === void 0 ? void 0 : publicOnly.window) ?? false)
+      };
+      // istanbul ignore next -- Fallback to deprecated method
+      const {
+        sourceCode = context.getSourceCode()
+      } = context;
+      const exported = _exportParser.default.isUncommentedExport( /** @type {import('eslint').Rule.Node} */node, sourceCode, opt, settings);
+      if (!exported) {
+        return false;
+      }
+    }
     if ((forceRequireReturn || forceRequireReturnContext) && (iteratingFunction || utils.isVirtualFunction())) {
       return true;
     }
@@ -91,7 +113,9 @@ var _default = (0, _iterateJsdoc.default)(({
     return iteratingFunction && utils.hasValueOrExecutorHasNonEmptyResolveValue(forceReturnsWithAsync);
   };
   if (shouldReport()) {
-    report(`Missing JSDoc @${tagName} declaration.`);
+    utils.reportJSDoc(`Missing JSDoc @${tagName} declaration.`, null, enableFixer ? () => {
+      utils.addTag(tagName);
+    } : null);
   }
 }, {
   contextDefaults: true,
@@ -100,6 +124,7 @@ var _default = (0, _iterateJsdoc.default)(({
       description: 'Requires that returns are documented.',
       url: 'https://github.com/gajus/eslint-plugin-jsdoc/blob/main/docs/rules/require-returns.md#repos-sticky-header'
     },
+    fixable: 'code',
     schema: [{
       additionalProperties: false,
       properties: {
@@ -133,6 +158,9 @@ var _default = (0, _iterateJsdoc.default)(({
           },
           type: 'array'
         },
+        enableFixer: {
+          type: 'boolean'
+        },
         exemptedBy: {
           items: {
             type: 'string'
@@ -146,6 +174,30 @@ var _default = (0, _iterateJsdoc.default)(({
         forceReturnsWithAsync: {
           default: false,
           type: 'boolean'
+        },
+        publicOnly: {
+          oneOf: [{
+            default: false,
+            type: 'boolean'
+          }, {
+            additionalProperties: false,
+            default: {},
+            properties: {
+              ancestorsOnly: {
+                type: 'boolean'
+              },
+              cjs: {
+                type: 'boolean'
+              },
+              esm: {
+                type: 'boolean'
+              },
+              window: {
+                type: 'boolean'
+              }
+            },
+            type: 'object'
+          }]
         }
       },
       type: 'object'
diff --git a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/package.json b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/package.json
index 0aaebb1f516e16..b703633a830ba6 100644
--- a/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/package.json
+++ b/tools/node_modules/eslint/node_modules/eslint-plugin-jsdoc/package.json
@@ -140,5 +140,5 @@
     "test-cov": "cross-env TIMING=1 nyc --reporter text npm run test-no-cov",
     "test-index": "npm run test-no-cov -- test/rules/index.js"
   },
-  "version": "46.5.1"
+  "version": "46.8.2"
 }
diff --git a/tools/node_modules/eslint/node_modules/flat-cache/package.json b/tools/node_modules/eslint/node_modules/flat-cache/package.json
index 050b057f5d78e8..938668256e9712 100644
--- a/tools/node_modules/eslint/node_modules/flat-cache/package.json
+++ b/tools/node_modules/eslint/node_modules/flat-cache/package.json
@@ -1,6 +1,6 @@
 {
   "name": "flat-cache",
-  "version": "3.1.0",
+  "version": "3.1.1",
   "description": "A stupidly simple key/value storage using files to persist some data",
   "repository": "jaredwray/flat-cache",
   "license": "MIT",
@@ -29,19 +29,9 @@
     "autofix": "npm run eslint-fix",
     "check": "npm run eslint",
     "verify": "npm run eslint && npm run test:cache",
-    "install-hooks": "prepush install && changelogx install-hook && precommit install",
-    "changelog": "changelogx -f markdown -o ./changelog.md",
-    "do-changelog": "npm run changelog && git add ./changelog.md && git commit -m 'DOC: Generate changelog' --no-verify",
-    "pre-v": "npm run verify",
-    "post-v": "npm run do-changelog && git push --no-verify && git push --tags --no-verify",
-    "bump-major": "npm run pre-v && npm version major -m 'BLD: Release v%s' && npm run post-v",
-    "bump-minor": "npm run pre-v && npm version minor -m 'BLD: Release v%s' && npm run post-v",
-    "bump-patch": "npm run pre-v && npm version patch -m 'BLD: Release v%s' && npm run post-v",
     "test:cache": "c8 mocha -R spec test/specs",
     "test:ci:cache": "c8 --reporter=lcov mocha -R spec test/specs",
-    "test": "npm run verify --silent",
-    "cover": "istanbul cover test/runner.js html text-summary",
-    "watch": "watch-run -i -p 'test/specs/**/*.js' istanbul cover test/runner.js html text-summary"
+    "test": "npm run verify --silent"
   },
   "keywords": [
     "json cache",
@@ -51,35 +41,20 @@
     "key value",
     "cache"
   ],
-  "changelogx": {
-    "ignoreRegExp": [
-      "BLD: Release",
-      "DOC: Generate Changelog",
-      "Generated Changelog"
-    ],
-    "issueIDRegExp": "#(\\d+)",
-    "commitURL": "https://github.com/royriojas/flat-cache/commit/{0}",
-    "authorURL": "https://github.com/{0}",
-    "issueIDURL": "https://github.com/royriojas/flat-cache/issues/{0}",
-    "projectName": "flat-cache"
-  },
   "devDependencies": {
     "c8": "^8.0.1",
-    "chai": "^4.3.7",
-    "changelogx": "^5.0.6",
+    "chai": "^4.3.10",
     "eslint": "^7.13.0",
     "eslint-config-prettier": "^6.15.0",
     "eslint-plugin-mocha": "^8.0.0",
     "eslint-plugin-prettier": "^3.1.4",
     "glob-expand": "^0.2.1",
     "mocha": "^10.2.0",
-    "precommit": "^1.2.2",
-    "prepush": "^3.1.11",
     "prettier": "^2.1.2",
-    "watch-run": "^1.2.5"
+    "write": "^2.0.0"
   },
   "dependencies": {
-    "flatted": "^3.2.7",
+    "flatted": "^3.2.9",
     "keyv": "^4.5.3",
     "rimraf": "^3.0.2"
   }
diff --git a/tools/node_modules/eslint/node_modules/flatted/package.json b/tools/node_modules/eslint/node_modules/flatted/package.json
index b72ae944cc47a7..96faef75fa390f 100644
--- a/tools/node_modules/eslint/node_modules/flatted/package.json
+++ b/tools/node_modules/eslint/node_modules/flatted/package.json
@@ -1,6 +1,6 @@
 {
   "name": "flatted",
-  "version": "3.2.7",
+  "version": "3.2.9",
   "description": "A super light and fast circular JSON parser.",
   "unpkg": "min.js",
   "types": "types.d.ts",
@@ -15,6 +15,7 @@
     "size": "cat index.js | wc -c;cat min.js | wc -c;gzip -c9 min.js | wc -c;cat min.js | brotli | wc -c; cat es.js | brotli | wc -c; cat esm.js | brotli | wc -c",
     "test": "c8 node test/index.js",
     "test:php": "php php/test.php",
+    "test:py": "python python/test.py",
     "coverage": "mkdir -p ./coverage; c8 report --reporter=text-lcov > ./coverage/lcov.info"
   },
   "repository": {
diff --git a/tools/node_modules/eslint/node_modules/flatted/php/flatted.php b/tools/node_modules/eslint/node_modules/flatted/php/flatted.php
index 30585bf9455db1..22659f6a01746c 100644
--- a/tools/node_modules/eslint/node_modules/flatted/php/flatted.php
+++ b/tools/node_modules/eslint/node_modules/flatted/php/flatted.php
@@ -19,6 +19,7 @@
  */
 
 class FlattedString {
+  public $value = '';
   public function __construct($value) {
     $this->value = $value;
   }
@@ -148,7 +149,6 @@ private static function wrap($value) {
       foreach ($keys as $key) {
         $value->$key = self::wrap($value->$key);
       }
-      return $value;
     }
     return $value;
   }
diff --git a/tools/node_modules/eslint/node_modules/flatted/python/flatted.py b/tools/node_modules/eslint/node_modules/flatted/python/flatted.py
new file mode 100644
index 00000000000000..56bb08ecf67a87
--- /dev/null
+++ b/tools/node_modules/eslint/node_modules/flatted/python/flatted.py
@@ -0,0 +1,149 @@
+# ISC License
+#
+# Copyright (c) 2018-2021, Andrea Giammarchi, @WebReflection
+#
+# Permission to use, copy, modify, and/or distribute this software for any
+# purpose with or without fee is hereby granted, provided that the above
+# copyright notice and this permission notice appear in all copies.
+#
+# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+# REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+# AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+# INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+# LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
+# OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+# PERFORMANCE OF THIS SOFTWARE.
+
+import json as _json
+
+class _Known:
+    def __init__(self):
+        self.key = []
+        self.value = []
+
+class _String:
+    def __init__(self, value):
+        self.value = value
+
+
+def _array_keys(value):
+    keys = []
+    i = 0
+    for _ in value:
+        keys.append(i)
+        i += 1
+    return keys
+
+def _object_keys(value):
+    keys = []
+    for key in value:
+        keys.append(key)
+    return keys
+
+def _is_array(value):
+    return isinstance(value, list) or isinstance(value, tuple)
+
+def _is_object(value):
+    return isinstance(value, dict)
+
+def _is_string(value):
+    return isinstance(value, str)
+
+def _index(known, input, value):
+    input.append(value)
+    index = str(len(input) - 1)
+    known.key.append(value)
+    known.value.append(index)
+    return index
+
+def _loop(keys, input, known, output):
+    for key in keys:
+        value = output[key]
+        if isinstance(value, _String):
+            _ref(key, input[int(value.value)], input, known, output)
+
+    return output
+
+def _ref(key, value, input, known, output):
+    if _is_array(value) and not value in known:
+        known.append(value)
+        value = _loop(_array_keys(value), input, known, value)
+    elif _is_object(value) and not value in known:
+        known.append(value)
+        value = _loop(_object_keys(value), input, known, value)
+
+    output[key] = value
+
+def _relate(known, input, value):
+    if _is_string(value) or _is_array(value) or _is_object(value):
+        try:
+            return known.value[known.key.index(value)]
+        except:
+            return _index(known, input, value)
+
+    return value
+
+def _transform(known, input, value):
+    if _is_array(value):
+        output = []
+        for val in value:
+            output.append(_relate(known, input, val))
+        return output
+
+    if _is_object(value):
+        obj = {}
+        for key in value:
+            obj[key] = _relate(known, input, value[key])
+        return obj
+
+    return value
+
+def _wrap(value):
+    if _is_string(value):
+        return _String(value)
+
+    if _is_array(value):
+        i = 0
+        for val in value:
+            value[i] = _wrap(val)
+            i += 1
+
+    elif _is_object(value):
+        for key in value:
+            value[key] = _wrap(value[key])
+
+    return value
+
+def parse(value, *args, **kwargs):
+    json = _json.loads(value, *args, **kwargs)
+    wrapped = []
+    for value in json:
+        wrapped.append(_wrap(value))
+
+    input = []
+    for value in wrapped:
+        if isinstance(value, _String):
+            input.append(value.value)
+        else:
+            input.append(value)
+
+    value = input[0]
+
+    if _is_array(value):
+        return _loop(_array_keys(value), input, [value], value)
+
+    if _is_object(value):
+        return _loop(_object_keys(value), input, [value], value)
+
+    return value
+
+
+def stringify(value, *args, **kwargs):
+    known = _Known()
+    input = []
+    output = []
+    i = int(_index(known, input, value))
+    while i < len(input):
+        output.append(_transform(known, input, input[i]))
+        i += 1
+    return _json.dumps(output, *args, **kwargs)
diff --git a/tools/node_modules/eslint/node_modules/flatted/python/test.py b/tools/node_modules/eslint/node_modules/flatted/python/test.py
new file mode 100644
index 00000000000000..740739e5efab95
--- /dev/null
+++ b/tools/node_modules/eslint/node_modules/flatted/python/test.py
@@ -0,0 +1,63 @@
+from flatted import stringify as _stringify, parse
+
+def stringify(value):
+    return _stringify(value, separators=(',', ':'))
+
+assert stringify([None, None]) == '[[null,null]]'
+
+a = []
+o = {}
+
+assert stringify(a) == '[[]]'
+assert stringify(o) == '[{}]'
+
+a.append(a)
+o['o'] = o
+
+assert stringify(a) == '[["0"]]'
+assert stringify(o) == '[{"o":"0"}]'
+
+b = parse(stringify(a))
+assert isinstance(b, list) and b[0] == b
+
+a.append(1)
+a.append('two')
+a.append(True)
+o['one'] = 1
+o['two'] = 'two'
+o['three'] = True
+
+assert stringify(a) == '[["0",1,"1",true],"two"]'
+assert stringify(o) == '[{"o":"0","one":1,"two":"1","three":true},"two"]'
+
+a.append(o)
+o['a'] = a
+
+assert stringify(a) == '[["0",1,"1",true,"2"],"two",{"o":"2","one":1,"two":"1","three":true,"a":"0"}]'
+assert stringify(o) == '[{"o":"0","one":1,"two":"1","three":true,"a":"2"},"two",["2",1,"1",true,"0"]]'
+
+a.append({'test': 'OK'})
+a.append([1, 2, 3])
+
+o['test'] = {'test': 'OK'}
+o['array'] = [1, 2, 3]
+
+assert stringify(a) == '[["0",1,"1",true,"2","3","4"],"two",{"o":"2","one":1,"two":"1","three":true,"a":"0","test":"3","array":"4"},{"test":"5"},[1,2,3],"OK"]'
+assert stringify(o) == '[{"o":"0","one":1,"two":"1","three":true,"a":"2","test":"3","array":"4"},"two",["2",1,"1",true,"0","3","4"],{"test":"5"},[1,2,3],"OK"]'
+
+a2 = parse(stringify(a));
+o2 = parse(stringify(o));
+
+assert a2[0] == a2
+assert o2['o'] == o2
+
+assert a2[1] == 1 and a2[2] == 'two' and a2[3] == True and isinstance(a2[4], dict)
+assert a2[4] == a2[4]['o'] and a2 == a2[4]['o']['a']
+
+str = parse('[{"prop":"1","a":"2","b":"3"},{"value":123},["4","5"],{"e":"6","t":"7","p":4},{},{"b":"8"},"f",{"a":"9"},["10"],"sup",{"a":1,"d":2,"c":"7","z":"11","h":1},{"g":2,"a":"7","b":"12","f":6},{"r":4,"u":"7","c":5}]')
+assert str['b']['t']['a'] == 'sup' and str['a'][1]['b'][0]['c'] == str['b']['t']
+
+oo = parse('[{"a":"1","b":"0","c":"2"},{"aa":"3"},{"ca":"4","cb":"5","cc":"6","cd":"7","ce":"8","cf":"9"},{"aaa":"10"},{"caa":"4"},{"cba":"5"},{"cca":"2"},{"cda":"4"},"value2","value3","value1"]');
+assert oo['a']['aa']['aaa'] == 'value1' and oo == oo['b'] and oo['c']['ca']['caa'] == oo['c']['ca']
+
+print('OK')
diff --git a/tools/node_modules/eslint/node_modules/globals/globals.json b/tools/node_modules/eslint/node_modules/globals/globals.json
index 76af3e3b7af94f..96d98d72b19b3c 100644
--- a/tools/node_modules/eslint/node_modules/globals/globals.json
+++ b/tools/node_modules/eslint/node_modules/globals/globals.json
@@ -659,6 +659,7 @@
 		"MediaStream": false,
 		"MediaStreamAudioDestinationNode": false,
 		"MediaStreamAudioSourceNode": false,
+		"MediaStreamConstraints": false,
 		"MediaStreamEvent": false,
 		"MediaStreamTrack": false,
 		"MediaStreamTrackEvent": false,
@@ -1045,6 +1046,7 @@
 		"TextTrackCueList": false,
 		"TextTrackList": false,
 		"TimeRanges": false,
+		"ToggleEvent": false,
 		"toolbar": false,
 		"top": false,
 		"Touch": false,
diff --git a/tools/node_modules/eslint/node_modules/globals/package.json b/tools/node_modules/eslint/node_modules/globals/package.json
index 2eb5e446e302ef..a13be946e8c379 100644
--- a/tools/node_modules/eslint/node_modules/globals/package.json
+++ b/tools/node_modules/eslint/node_modules/globals/package.json
@@ -1,6 +1,6 @@
 {
 	"name": "globals",
-	"version": "13.21.0",
+	"version": "13.23.0",
 	"description": "Global identifiers from different JavaScript environments",
 	"license": "MIT",
 	"repository": "sindresorhus/globals",
diff --git a/tools/node_modules/eslint/node_modules/keyv/package.json b/tools/node_modules/eslint/node_modules/keyv/package.json
index 0356c9bee0e9f3..a830461131e125 100644
--- a/tools/node_modules/eslint/node_modules/keyv/package.json
+++ b/tools/node_modules/eslint/node_modules/keyv/package.json
@@ -1,6 +1,6 @@
 {
 	"name": "keyv",
-	"version": "4.5.3",
+	"version": "4.5.4",
 	"description": "Simple key-value storage with support for multiple backends",
 	"main": "src/index.js",
 	"scripts": {
@@ -41,11 +41,11 @@
 	},
 	"devDependencies": {
 		"@keyv/test-suite": "*",
-		"eslint": "^8.42.0",
+		"eslint": "^8.51.0",
 		"eslint-plugin-promise": "^6.1.1",
 		"pify": "^5.0.0",
-		"timekeeper": "^2.2.0",
-		"tsd": "^0.28.1"
+		"timekeeper": "^2.3.1",
+		"tsd": "^0.29.0"
 	},
 	"tsd": {
 		"directory": "test"
diff --git a/tools/node_modules/eslint/node_modules/keyv/src/index.js b/tools/node_modules/eslint/node_modules/keyv/src/index.js
index 7d9d2337a3363b..ac539bd981fc3a 100644
--- a/tools/node_modules/eslint/node_modules/keyv/src/index.js
+++ b/tools/node_modules/eslint/node_modules/keyv/src/index.js
@@ -153,27 +153,22 @@ class Keyv extends EventEmitter {
 				}
 
 				if (isArray) {
-					const result = [];
-
-					for (let row of data) {
+					return data.map((row, index) => {
 						if ((typeof row === 'string')) {
 							row = this.opts.deserialize(row);
 						}
 
 						if (row === undefined || row === null) {
-							result.push(undefined);
-							continue;
+							return undefined;
 						}
 
 						if (typeof row.expires === 'number' && Date.now() > row.expires) {
-							this.delete(key).then(() => undefined);
-							result.push(undefined);
-						} else {
-							result.push((options && options.raw) ? row : row.value);
+							this.delete(key[index]).then(() => undefined);
+							return undefined;
 						}
-					}
 
-					return result;
+						return (options && options.raw) ? row : row.value;
+					});
 				}
 
 				if (typeof data.expires === 'number' && Date.now() > data.expires) {
diff --git a/tools/node_modules/eslint/node_modules/spdx-license-ids/deprecated.json b/tools/node_modules/eslint/node_modules/spdx-license-ids/deprecated.json
index 278531e40c613d..a877dc3efd8bd2 100644
--- a/tools/node_modules/eslint/node_modules/spdx-license-ids/deprecated.json
+++ b/tools/node_modules/eslint/node_modules/spdx-license-ids/deprecated.json
@@ -7,18 +7,24 @@
 	"GFDL-1.2",
 	"GFDL-1.3",
 	"GPL-1.0",
+	"GPL-1.0+",
 	"GPL-2.0",
+	"GPL-2.0+",
 	"GPL-2.0-with-GCC-exception",
 	"GPL-2.0-with-autoconf-exception",
 	"GPL-2.0-with-bison-exception",
 	"GPL-2.0-with-classpath-exception",
 	"GPL-2.0-with-font-exception",
 	"GPL-3.0",
+	"GPL-3.0+",
 	"GPL-3.0-with-GCC-exception",
 	"GPL-3.0-with-autoconf-exception",
 	"LGPL-2.0",
+	"LGPL-2.0+",
 	"LGPL-2.1",
+	"LGPL-2.1+",
 	"LGPL-3.0",
+	"LGPL-3.0+",
 	"Nunit",
 	"StandardML-NJ",
 	"bzip2-1.0.5",
diff --git a/tools/node_modules/eslint/node_modules/spdx-license-ids/index.json b/tools/node_modules/eslint/node_modules/spdx-license-ids/index.json
index 04c03126d98eb8..a7b98b24b6273e 100644
--- a/tools/node_modules/eslint/node_modules/spdx-license-ids/index.json
+++ b/tools/node_modules/eslint/node_modules/spdx-license-ids/index.json
@@ -22,10 +22,13 @@
 	"APSL-1.1",
 	"APSL-1.2",
 	"APSL-2.0",
+	"ASWF-Digital-Assets-1.0",
+	"ASWF-Digital-Assets-1.1",
 	"Abstyles",
 	"AdaCore-doc",
 	"Adobe-2006",
 	"Adobe-Glyph",
+	"Adobe-Utopia",
 	"Afmparse",
 	"Aladdin",
 	"Apache-1.0",
@@ -44,6 +47,7 @@
 	"BSD-3-Clause",
 	"BSD-3-Clause-Attribution",
 	"BSD-3-Clause-Clear",
+	"BSD-3-Clause-HP",
 	"BSD-3-Clause-LBNL",
 	"BSD-3-Clause-Modification",
 	"BSD-3-Clause-No-Military-License",
@@ -51,6 +55,8 @@
 	"BSD-3-Clause-No-Nuclear-License-2014",
 	"BSD-3-Clause-No-Nuclear-Warranty",
 	"BSD-3-Clause-Open-MPI",
+	"BSD-3-Clause-Sun",
+	"BSD-3-Clause-flex",
 	"BSD-4-Clause",
 	"BSD-4-Clause-Shortened",
 	"BSD-4-Clause-UC",
@@ -58,8 +64,10 @@
 	"BSD-4.3TAHOE",
 	"BSD-Advertising-Acknowledgement",
 	"BSD-Attribution-HPND-disclaimer",
+	"BSD-Inferno-Nettverk",
 	"BSD-Protection",
 	"BSD-Source-Code",
+	"BSD-Systemics",
 	"BSL-1.0",
 	"BUSL-1.1",
 	"Baekmuk",
@@ -71,6 +79,7 @@
 	"Bitstream-Charter",
 	"Bitstream-Vera",
 	"BlueOak-1.0.0",
+	"Boehm-GC",
 	"Borceux",
 	"Brian-Gladman-3-Clause",
 	"C-UDA-1.0",
@@ -125,6 +134,7 @@
 	"CC-BY-SA-3.0",
 	"CC-BY-SA-3.0-AT",
 	"CC-BY-SA-3.0-DE",
+	"CC-BY-SA-3.0-IGO",
 	"CC-BY-SA-4.0",
 	"CC-PDDC",
 	"CC0-1.0",
@@ -161,11 +171,13 @@
 	"Community-Spec-1.0",
 	"Condor-1.1",
 	"Cornell-Lossless-JPEG",
+	"Cronyx",
 	"Crossword",
 	"CrystalStacker",
 	"Cube",
 	"D-FSL-1.0",
 	"DL-DE-BY-2.0",
+	"DL-DE-ZERO-2.0",
 	"DOC",
 	"DRL-1.0",
 	"DSDP",
@@ -185,6 +197,7 @@
 	"Entessa",
 	"ErlPL-1.1",
 	"Eurosym",
+	"FBM",
 	"FDK-AAC",
 	"FSFAP",
 	"FSFUL",
@@ -192,9 +205,11 @@
 	"FSFULLRWD",
 	"FTL",
 	"Fair",
+	"Ferguson-Twofish",
 	"Frameworx-1.0",
 	"FreeBSD-DOC",
 	"FreeImage",
+	"Furuseth",
 	"GD",
 	"GFDL-1.1-invariants-only",
 	"GFDL-1.1-invariants-or-later",
@@ -227,9 +242,17 @@
 	"Glulxe",
 	"Graphics-Gems",
 	"HP-1986",
+	"HP-1989",
 	"HPND",
+	"HPND-DEC",
 	"HPND-Markus-Kuhn",
+	"HPND-Pbmplus",
+	"HPND-UC",
+	"HPND-doc",
+	"HPND-doc-sell",
 	"HPND-export-US",
+	"HPND-export-US-modify",
+	"HPND-sell-regexpr",
 	"HPND-sell-variant",
 	"HPND-sell-variant-MIT-disclaimer",
 	"HTMLTIDY",
@@ -246,6 +269,7 @@
 	"ImageMagick",
 	"Imlib2",
 	"Info-ZIP",
+	"Inner-Net-2.0",
 	"Intel",
 	"Intel-ACPI",
 	"Interbase-1.0",
@@ -254,6 +278,7 @@
 	"JSON",
 	"Jam",
 	"JasPer-2.0",
+	"Kastrup",
 	"Kazlib",
 	"Knuth-CTAN",
 	"LAL-1.2",
@@ -276,23 +301,32 @@
 	"LZMA-SDK-9.11-to-9.20",
 	"LZMA-SDK-9.22",
 	"Latex2e",
+	"Latex2e-translated-notice",
 	"Leptonica",
 	"LiLiQ-P-1.1",
 	"LiLiQ-R-1.1",
 	"LiLiQ-Rplus-1.1",
 	"Libpng",
 	"Linux-OpenIB",
+	"Linux-man-pages-1-para",
 	"Linux-man-pages-copyleft",
+	"Linux-man-pages-copyleft-2-para",
+	"Linux-man-pages-copyleft-var",
+	"Lucida-Bitmap-Fonts",
 	"MIT",
 	"MIT-0",
 	"MIT-CMU",
+	"MIT-Festival",
 	"MIT-Modern-Variant",
 	"MIT-Wu",
 	"MIT-advertising",
 	"MIT-enna",
 	"MIT-feh",
 	"MIT-open-group",
+	"MIT-testregex",
 	"MITNFA",
+	"MMIXware",
+	"MPEG-SSG",
 	"MPL-1.0",
 	"MPL-1.1",
 	"MPL-2.0",
@@ -303,6 +337,7 @@
 	"MTLL",
 	"MakeIndex",
 	"Martin-Birgmeier",
+	"McPhee-slideshow",
 	"Minpack",
 	"MirOS",
 	"Motosoto",
@@ -319,6 +354,7 @@
 	"NICTA-1.0",
 	"NIST-PD",
 	"NIST-PD-fallback",
+	"NIST-Software",
 	"NLOD-1.0",
 	"NLOD-2.0",
 	"NLPL",
@@ -370,8 +406,10 @@
 	"OLDAP-2.6",
 	"OLDAP-2.7",
 	"OLDAP-2.8",
+	"OLFL-1.3",
 	"OML",
 	"OPL-1.0",
+	"OPL-UK-3.0",
 	"OPUBL-1.0",
 	"OSET-PL-2.1",
 	"OSL-1.0",
@@ -381,6 +419,7 @@
 	"OSL-3.0",
 	"OpenPBS-2.3",
 	"OpenSSL",
+	"PADL",
 	"PDDL-1.0",
 	"PHP-3.0",
 	"PHP-3.01",
@@ -409,10 +448,13 @@
 	"SGI-B-1.0",
 	"SGI-B-1.1",
 	"SGI-B-2.0",
+	"SGI-OpenGL",
+	"SGP4",
 	"SHL-0.5",
 	"SHL-0.51",
 	"SISSL",
 	"SISSL-1.2",
+	"SL",
 	"SMLNJ",
 	"SMPPL",
 	"SNIA",
@@ -427,6 +469,7 @@
 	"Sendmail-8.23",
 	"SimPL-2.0",
 	"Sleepycat",
+	"Soundex",
 	"Spencer-86",
 	"Spencer-94",
 	"Spencer-99",
@@ -442,14 +485,18 @@
 	"TPDL",
 	"TPL-1.0",
 	"TTWL",
+	"TTYP0",
 	"TU-Berlin-1.0",
 	"TU-Berlin-2.0",
+	"TermReadKey",
 	"UCAR",
 	"UCL-1.0",
 	"UPL-1.0",
+	"URT-RLE",
 	"Unicode-DFS-2015",
 	"Unicode-DFS-2016",
 	"Unicode-TOU",
+	"UnixCrypt",
 	"Unlicense",
 	"VOSTROM",
 	"VSL-1.0",
@@ -459,12 +506,15 @@
 	"W3C-20150513",
 	"WTFPL",
 	"Watcom-1.0",
+	"Widget-Workshop",
 	"Wsuipa",
 	"X11",
 	"X11-distribute-modifications-variant",
 	"XFree86-1.1",
 	"XSkat",
+	"Xdebug-1.03",
 	"Xerox",
+	"Xfig",
 	"Xnet",
 	"YPL-1.0",
 	"YPL-1.1",
@@ -472,20 +522,24 @@
 	"ZPL-2.0",
 	"ZPL-2.1",
 	"Zed",
+	"Zeeff",
 	"Zend-2.0",
 	"Zimbra-1.3",
 	"Zimbra-1.4",
 	"Zlib",
 	"blessing",
 	"bzip2-1.0.6",
+	"check-cvs",
 	"checkmk",
 	"copyleft-next-0.3.0",
 	"copyleft-next-0.3.1",
 	"curl",
 	"diffmark",
+	"dtoa",
 	"dvipdfm",
 	"eGenix",
 	"etalab-2.0",
+	"fwlw",
 	"gSOAP-1.3b",
 	"gnuplot",
 	"iMatix",
@@ -493,12 +547,20 @@
 	"libselinux-1.0",
 	"libtiff",
 	"libutil-David-Nugent",
+	"lsof",
+	"magaz",
+	"metamail",
 	"mpi-permissive",
 	"mpich2",
 	"mplus",
+	"pnmstitch",
 	"psfrag",
 	"psutils",
+	"python-ldap",
 	"snprintf",
+	"ssh-keyscan",
+	"swrule",
+	"ulem",
 	"w3m",
 	"xinetd",
 	"xlock",
diff --git a/tools/node_modules/eslint/node_modules/spdx-license-ids/package.json b/tools/node_modules/eslint/node_modules/spdx-license-ids/package.json
index ea060776d9cf76..196b02705769a9 100644
--- a/tools/node_modules/eslint/node_modules/spdx-license-ids/package.json
+++ b/tools/node_modules/eslint/node_modules/spdx-license-ids/package.json
@@ -1,6 +1,6 @@
 {
 	"name": "spdx-license-ids",
-	"version": "3.0.13",
+	"version": "3.0.16",
 	"description": "A list of SPDX license identifiers",
 	"repository": "jslicense/spdx-license-ids",
 	"author": "Shinnosuke Watanabe (https://github.com/shinnn)",
@@ -28,10 +28,10 @@
 	],
 	"devDependencies": {
 		"@shinnn/eslint-config": "^7.0.0",
-		"eslint": "^8.2.0",
+		"eslint": "^8.49.0",
 		"eslint-formatter-codeframe": "^7.32.1",
 		"rmfr": "^2.0.0",
-		"tape": "^5.3.1"
+		"tape": "^5.6.6"
 	},
 	"eslintConfig": {
 		"extends": "@shinnn"
diff --git a/tools/node_modules/eslint/node_modules/update-browserslist-db/check-npm-version.js b/tools/node_modules/eslint/node_modules/update-browserslist-db/check-npm-version.js
index 25e1c92d36abf3..5a37592b9a1fa7 100644
--- a/tools/node_modules/eslint/node_modules/update-browserslist-db/check-npm-version.js
+++ b/tools/node_modules/eslint/node_modules/update-browserslist-db/check-npm-version.js
@@ -7,7 +7,7 @@ try {
     process.stderr.write(
       pico.red(
         'Update npm or call ' +
-          pico.yellow('npx browserslist@latest --update-db') +
+          pico.yellow('npx update-browserslist-db@latest') +
           '\n'
       )
     )
diff --git a/tools/node_modules/eslint/node_modules/update-browserslist-db/index.js b/tools/node_modules/eslint/node_modules/update-browserslist-db/index.js
index 464f74da43382b..7fc0d3a4ed7b35 100644
--- a/tools/node_modules/eslint/node_modules/update-browserslist-db/index.js
+++ b/tools/node_modules/eslint/node_modules/update-browserslist-db/index.js
@@ -1,10 +1,10 @@
-let { writeFileSync, readFileSync, existsSync } = require('fs')
+let { existsSync, readFileSync, writeFileSync } = require('fs')
 let { execSync } = require('child_process')
 let { join } = require('path')
 let escalade = require('escalade/sync')
 let pico = require('picocolors')
 
-const { detectIndent, detectEOL } = require('./utils')
+const { detectEOL, detectIndent } = require('./utils')
 
 function BrowserslistUpdateError(message) {
   this.name = 'BrowserslistUpdateError'
@@ -40,16 +40,16 @@ function detectLockfile() {
   let lockfilePnpm = join(packageDir, 'pnpm-lock.yaml')
 
   if (existsSync(lockfilePnpm)) {
-    return { mode: 'pnpm', file: lockfilePnpm }
+    return { file: lockfilePnpm, mode: 'pnpm' }
   } else if (existsSync(lockfileNpm)) {
-    return { mode: 'npm', file: lockfileNpm }
+    return { file: lockfileNpm, mode: 'npm' }
   } else if (existsSync(lockfileYarn)) {
-    let lock = { mode: 'yarn', file: lockfileYarn }
+    let lock = { file: lockfileYarn, mode: 'yarn' }
     lock.content = readFileSync(lock.file).toString()
     lock.version = /# yarn lockfile v1/.test(lock.content) ? 1 : 2
     return lock
   } else if (existsSync(lockfileShrinkwrap)) {
-    return { mode: 'npm', file: lockfileShrinkwrap }
+    return { file: lockfileShrinkwrap, mode: 'npm' }
   }
   throw new BrowserslistUpdateError(
     'No lockfile found. Run "npm install", "yarn install" or "pnpm install"'
@@ -59,11 +59,11 @@ function detectLockfile() {
 function getLatestInfo(lock) {
   if (lock.mode === 'yarn') {
     if (lock.version === 1) {
-      return JSON.parse(execSync('yarn info caniuse-lite --json').toString())
+      return JSON.parse(execSync('yarnpkg info caniuse-lite --json').toString())
         .data
     } else {
       return JSON.parse(
-        execSync('yarn npm info caniuse-lite --json').toString()
+        execSync('yarnpkg npm info caniuse-lite --json').toString()
       )
     }
   }
@@ -209,10 +209,10 @@ function updatePackageManually(print, lock, latest) {
   )
   writeFileSync(lock.file, lockfileData.content)
 
-  let install = lock.mode === 'yarn' ? 'yarn add -W' : lock.mode + ' install'
+  let install = lock.mode === 'yarn' ? 'yarnpkg add -W' : lock.mode + ' install'
   print(
     'Installing new caniuse-lite version\n' +
-      pico.yellow('$ ' + install + ' caniuse-lite') +
+      pico.yellow('$ ' + install.replace('yarnpkg', 'yarn') + ' caniuse-lite') +
       '\n'
   )
   try {
@@ -232,17 +232,22 @@ function updatePackageManually(print, lock, latest) {
     process.exit(1)
   } /* c8 ignore end */
 
-  let del = lock.mode === 'yarn' ? 'yarn remove -W' : lock.mode + ' uninstall'
+  let del =
+    lock.mode === 'yarn' ? 'yarnpkg remove -W' : lock.mode + ' uninstall'
   print(
     'Cleaning package.json dependencies from caniuse-lite\n' +
-      pico.yellow('$ ' + del + ' caniuse-lite') +
+      pico.yellow('$ ' + del.replace('yarnpkg', 'yarn') + ' caniuse-lite') +
       '\n'
   )
   execSync(del + ' caniuse-lite')
 }
 
 function updateWith(print, cmd) {
-  print('Updating caniuse-lite version\n' + pico.yellow('$ ' + cmd) + '\n')
+  print(
+    'Updating caniuse-lite version\n' +
+      pico.yellow('$ ' + cmd.replace('yarnpkg', 'yarn')) +
+      '\n'
+  )
   try {
     execSync(cmd)
   } catch (e) /* c8 ignore start */ {
@@ -277,7 +282,7 @@ module.exports = function updateDB(print = defaultPrint) {
   print('Latest version:     ' + pico.bold(pico.green(latest.version)) + '\n')
 
   if (lock.mode === 'yarn' && lock.version !== 1) {
-    updateWith(print, 'yarn up -R caniuse-lite')
+    updateWith(print, 'yarnpkg up -R caniuse-lite')
   } else if (lock.mode === 'pnpm') {
     updateWith(print, 'pnpm up caniuse-lite')
   } else {
diff --git a/tools/node_modules/eslint/node_modules/update-browserslist-db/package.json b/tools/node_modules/eslint/node_modules/update-browserslist-db/package.json
index 0ed71fa87e20a1..f1997a18443c0b 100644
--- a/tools/node_modules/eslint/node_modules/update-browserslist-db/package.json
+++ b/tools/node_modules/eslint/node_modules/update-browserslist-db/package.json
@@ -1,6 +1,6 @@
 {
   "name": "update-browserslist-db",
-  "version": "1.0.11",
+  "version": "1.0.13",
   "description": "CLI tool to update caniuse-lite to refresh target browsers from Browserslist config",
   "keywords": [
     "caniuse",
diff --git a/tools/node_modules/eslint/package.json b/tools/node_modules/eslint/package.json
index a4055c72df1863..2d2c2a85883ea5 100644
--- a/tools/node_modules/eslint/package.json
+++ b/tools/node_modules/eslint/package.json
@@ -1,6 +1,6 @@
 {
   "name": "eslint",
-  "version": "8.49.0",
+  "version": "8.51.0",
   "author": "Nicholas C. Zakas <nicholas+npm@nczconsulting.com>",
   "description": "An AST-based pattern checker for JavaScript.",
   "bin": {
@@ -63,7 +63,7 @@
     "@eslint-community/eslint-utils": "^4.2.0",
     "@eslint-community/regexpp": "^4.6.1",
     "@eslint/eslintrc": "^2.1.2",
-    "@eslint/js": "8.49.0",
+    "@eslint/js": "8.51.0",
     "@humanwhocodes/config-array": "^0.11.11",
     "@humanwhocodes/module-importer": "^1.0.1",
     "@nodelib/fs.walk": "^1.2.8",
diff --git a/tools/osx-notarize.sh b/tools/osx-notarize.sh
index 31c92c2ca426f3..beea7041793cdf 100755
--- a/tools/osx-notarize.sh
+++ b/tools/osx-notarize.sh
@@ -1,34 +1,87 @@
 #!/bin/sh
 
-# Uses gon, from https://github.com/mitchellh/gon, to notarize a generated node-<version>.pkg file
-# with Apple for installation on macOS Catalina and later as validated by Gatekeeper.
+# Notarize a generated node-<version>.pkg file as an Apple requirement for installation on macOS Catalina and later, as validated by Gatekeeper.
+# Uses gon (Xcode version < 13.0) or notarytool (Xcode >= 13.0).
 
-set -e
-
-gon_version="0.2.2"
-gon_exe="${HOME}/.gon/gon_${gon_version}"
+version() {
+  echo "$@" | awk -F. '{ printf("%d%03d%03d%03d\n", $1,$2,$3,$4); }' || echo "0"
+}
 
+xcode_version=$(xcodebuild -version | awk '/Xcode/ {print $2}')
+xcode_version_result=$(version "$xcode_version")
+xcode_version_threshold=$(version "13.0")
 pkgid="$1"
 
-[ -z "$pkgid" ] && \
-  echo "Usage: $0 <pkgid>" \
+if [ -z "$pkgid" ]; then
+  echo "Usage: $0 <pkgid>"
   exit 1
+fi
 
 # shellcheck disable=SC2154
-[ -z "$NOTARIZATION_ID" ] && \
-  echo "No NOTARIZATION_ID environment var. Skipping notarization." \
+if [ -z "$NOTARIZATION_ID" ]; then
+  echo "No NOTARIZATION_ID environment variable. Skipping notarization."
   exit 0
+fi
 
-set -x
-
-mkdir -p "${HOME}/.gon/"
+if [ -z "$NOTARIZATION_PASSWORD" ]; then
+  echo "No NOTARIZATION_PASSWORD environment variable. Skipping notarization."
+  exit 0
+fi
 
-if [ ! -f "${gon_exe}" ]; then
-  curl -sL "https://github.com/mitchellh/gon/releases/download/v${gon_version}/gon_${gon_version}_macos.zip" -o "${gon_exe}.zip"
-  (cd "${HOME}/.gon/" && rm -f gon && unzip "${gon_exe}.zip" && mv gon "${gon_exe}")
+if [ -z "$NOTARIZATION_TEAM_ID" ]; then
+  echo "No NOTARIZATION_TEAM_ID environment variable. Skipping notarization."
+  exit 0
 fi
 
-sed -e "s/{{appleid}}/${NOTARIZATION_ID}/" -e "s/{{pkgid}}/${pkgid}/" tools/osx-gon-config.json.tmpl \
-  > gon-config.json
+# TODO(@ulisesGascon): remove support for gon
+# when https://github.com/nodejs/build/issues/3385#issuecomment-1729281269 is ready
+if [ "$xcode_version_result" -lt "$xcode_version_threshold" ]; then
+  echo "Notarization process is done with gon."
+  set -x
+
+  gon_version="0.2.2"
+  gon_exe="${HOME}/.gon/gon_${gon_version}"
 
-"${gon_exe}" -log-level=info gon-config.json
+  mkdir -p "${HOME}/.gon/"
+
+  if [ ! -f "${gon_exe}" ]; then
+    curl -sL "https://github.com/mitchellh/gon/releases/download/v${gon_version}/gon_${gon_version}_macos.zip" -o "${gon_exe}.zip"
+    (cd "${HOME}/.gon/" && rm -f gon && unzip "${gon_exe}.zip" && mv gon "${gon_exe}")
+  fi
+
+  sed -e "s/{{appleid}}/${NOTARIZATION_ID}/" -e "s/{{pkgid}}/${pkgid}/" tools/osx-gon-config.json.tmpl \
+    > gon-config.json
+
+  "${gon_exe}" -log-level=info gon-config.json
+
+else
+  echo "Notarization process is done with Notarytool."
+
+  if ! command -v xcrun notarytool > /dev/null
+  then
+      echo "Notarytool is not present in the system. Notarization has failed."
+      exit 1
+  fi
+
+  # Submit the package for notarization
+  # TODO(@ulisesGascon): refactor to use --keychain-profile
+  # when https://github.com/nodejs/build/issues/3385#issuecomment-1729281269 is ready
+  notarization_output=$(
+    xcrun notarytool submit \
+      --apple-id "$NOTARIZATION_ID" \
+      --password "$NOTARIZATION_PASSWORD" \
+      --team-id "$NOTARIZATION_TEAM_ID" \
+      --wait \
+      "node-$pkgid.pkg" 2>&1
+  )
+
+  if [ $? -eq 0 ]; then
+    # Extract the operation ID from the output
+    operation_id=$(echo "$notarization_output" | awk '/RequestUUID/ {print $NF}')
+    echo "Notarization submitted. Operation ID: $operation_id"
+    exit 0
+  else
+    echo "Notarization failed. Error: $notarization_output"
+    exit 1
+  fi
+fi
diff --git a/tools/snapshot/node_mksnapshot.cc b/tools/snapshot/node_mksnapshot.cc
index a9df251700ea06..841a8ca743bcaa 100644
--- a/tools/snapshot/node_mksnapshot.cc
+++ b/tools/snapshot/node_mksnapshot.cc
@@ -50,8 +50,6 @@ int main(int argc, char* argv[]) {
   setvbuf(stderr, nullptr, _IONBF, 0);
 #endif  // _WIN32
 
-  v8::V8::SetFlagsFromString("--random_seed=42");
-  v8::V8::SetFlagsFromString("--harmony-import-assertions");
   return BuildSnapshot(argc, argv);
 }
 
@@ -65,7 +63,8 @@ int BuildSnapshot(int argc, char* argv[]) {
 
   std::unique_ptr<node::InitializationResult> result =
       node::InitializeOncePerProcess(
-          std::vector<std::string>(argv, argv + argc));
+          std::vector<std::string>(argv, argv + argc),
+          node::ProcessInitializationFlags::kGeneratePredictableSnapshot);
 
   CHECK(!result->early_return());
   CHECK_EQ(result->exit_code(), 0);
diff --git a/tools/v8_gypfiles/features.gypi b/tools/v8_gypfiles/features.gypi
index 3a7f355ef8021b..aa946a2774177f 100644
--- a/tools/v8_gypfiles/features.gypi
+++ b/tools/v8_gypfiles/features.gypi
@@ -280,6 +280,10 @@
     # Sets -DV8_USE_ZLIB
     'v8_use_zlib%': 1,
 
+    # Whether custom embedder snapshots may extend (= allocate new objects in)
+    # ReadOnlySpace.
+    'v8_enable_extensible_ro_snapshot%': 1,
+
     # Variables from v8.gni
 
     # Enable ECMAScript Internationalization API. Enabling this feature will
@@ -460,6 +464,9 @@
       ['v8_use_zlib==1', {
         'defines': ['V8_USE_ZLIB',],
       }],
+      ['v8_enable_extensible_ro_snapshot==1', {
+        'defines': ['V8_ENABLE_EXTENSIBLE_RO_SNAPSHOT',],
+      }],
       ['v8_enable_precise_zone_stats==1', {
         'defines': ['V8_ENABLE_PRECISE_ZONE_STATS',],
       }],
diff --git a/tools/v8_gypfiles/inspector.gypi b/tools/v8_gypfiles/inspector.gypi
index 28cdaa8319340d..2f227f6fc2b4b0 100644
--- a/tools/v8_gypfiles/inspector.gypi
+++ b/tools/v8_gypfiles/inspector.gypi
@@ -62,15 +62,12 @@
       '<(V8_ROOT)/src/inspector/string-util.cc',
       '<(V8_ROOT)/src/inspector/string-util.h',
       '<(V8_ROOT)/src/inspector/test-interface.cc',
-      '<(V8_ROOT)/src/inspector/test-interface.h',
-      '<(V8_ROOT)/src/inspector/v8-console.cc',
-      '<(V8_ROOT)/src/inspector/v8-console.h',
       '<(V8_ROOT)/src/inspector/v8-console-agent-impl.cc',
       '<(V8_ROOT)/src/inspector/v8-console-agent-impl.h',
       '<(V8_ROOT)/src/inspector/v8-console-message.cc',
       '<(V8_ROOT)/src/inspector/v8-console-message.h',
-      '<(V8_ROOT)/src/inspector/v8-debugger.cc',
-      '<(V8_ROOT)/src/inspector/v8-debugger.h',
+      '<(V8_ROOT)/src/inspector/v8-console.cc',
+      '<(V8_ROOT)/src/inspector/v8-console.h',
       '<(V8_ROOT)/src/inspector/v8-debugger-agent-impl.cc',
       '<(V8_ROOT)/src/inspector/v8-debugger-agent-impl.h',
       '<(V8_ROOT)/src/inspector/v8-debugger-barrier.cc',
@@ -79,6 +76,10 @@
       '<(V8_ROOT)/src/inspector/v8-debugger-id.h',
       '<(V8_ROOT)/src/inspector/v8-debugger-script.cc',
       '<(V8_ROOT)/src/inspector/v8-debugger-script.h',
+      '<(V8_ROOT)/src/inspector/v8-debugger.cc',
+      '<(V8_ROOT)/src/inspector/v8-debugger.h',
+      '<(V8_ROOT)/src/inspector/v8-deep-serializer.cc',
+      '<(V8_ROOT)/src/inspector/v8-deep-serializer.h',
       '<(V8_ROOT)/src/inspector/v8-heap-profiler-agent-impl.cc',
       '<(V8_ROOT)/src/inspector/v8-heap-profiler-agent-impl.h',
       '<(V8_ROOT)/src/inspector/v8-inspector-impl.cc',
@@ -93,12 +94,12 @@
       '<(V8_ROOT)/src/inspector/v8-runtime-agent-impl.h',
       '<(V8_ROOT)/src/inspector/v8-schema-agent-impl.cc',
       '<(V8_ROOT)/src/inspector/v8-schema-agent-impl.h',
+      '<(V8_ROOT)/src/inspector/v8-serialization-duplicate-tracker.cc',
+      '<(V8_ROOT)/src/inspector/v8-serialization-duplicate-tracker.h',
       '<(V8_ROOT)/src/inspector/v8-stack-trace-impl.cc',
       '<(V8_ROOT)/src/inspector/v8-stack-trace-impl.h',
       '<(V8_ROOT)/src/inspector/v8-value-utils.cc',
       '<(V8_ROOT)/src/inspector/v8-value-utils.h',
-      '<(V8_ROOT)/src/inspector/v8-webdriver-serializer.cc',
-      '<(V8_ROOT)/src/inspector/v8-webdriver-serializer.h',
       '<(V8_ROOT)/src/inspector/value-mirror.cc',
       '<(V8_ROOT)/src/inspector/value-mirror.h',
       # Flat merge `third_party/inspector_protocol:inspector_string_conversions`
diff --git a/tools/v8_gypfiles/toolchain.gypi b/tools/v8_gypfiles/toolchain.gypi
index 26c6866fa96636..bcecdb21aeb368 100644
--- a/tools/v8_gypfiles/toolchain.gypi
+++ b/tools/v8_gypfiles/toolchain.gypi
@@ -140,6 +140,12 @@
         'cflags!': [ '-Wall', '-Wextra' ],
         'cflags': [ '-Wno-return-type' ],
       }],
+      ['clang or OS!="win"', {
+        'cflags': [ '-Wno-invalid-offsetof' ],
+        'xcode_settings': {
+          'WARNING_CFLAGS': ['-Wno-invalid-offsetof']
+        },
+      }],
       ['v8_target_arch=="arm"', {
         'defines': [
           'V8_TARGET_ARCH_ARM',
diff --git a/tools/v8_gypfiles/v8.gyp b/tools/v8_gypfiles/v8.gyp
index 109d0ea1aa2e51..45323919348805 100644
--- a/tools/v8_gypfiles/v8.gyp
+++ b/tools/v8_gypfiles/v8.gyp
@@ -468,6 +468,7 @@
       'direct_dependent_settings': {
         'sources': [
           '<(V8_ROOT)/include/v8-platform.h',
+          '<(V8_ROOT)/include/v8-source-location.h',
           '<(V8_ROOT)/include/v8config.h',
         ],
       },
@@ -541,6 +542,11 @@
           '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_header_set.\\"v8_internal_headers\\".*?sources = ")',
         ],
         'conditions': [
+          ['v8_enable_snapshot_compression==1', {
+            'sources': [
+              '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_header_set.\\"v8_internal_headers\\".*?v8_enable_snapshot_compression.*?sources \\+= ")',
+            ],
+          }],
           ['v8_enable_maglev==1', {
             'sources': [
               '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_header_set.\\"v8_internal_headers\\".*?v8_enable_maglev.*?sources \\+= ")',
@@ -568,11 +574,6 @@
               '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_header_set.\\"v8_internal_headers\\".*?v8_enable_i18n_support.*?sources \\+= ")',
             ],
           }],
-          ['v8_enable_snapshot_compression==1', {
-            'sources': [
-              '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_header_set.\\"v8_internal_headers\\".*?v8_enable_snapshot_compression.*?sources \\+= ")',
-            ],
-          }],
           ['v8_control_flow_integrity==0', {
             'sources': [
               '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_header_set.\\"v8_internal_headers\\".*?!v8_control_flow_integrity.*?sources \\+= ")',
@@ -602,12 +603,12 @@
                 'conditions': [
                   ['OS=="linux" or OS=="mac" or OS=="ios" or OS=="freebsd"', {
                     'sources': [
-                      '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_header_set.\\"v8_internal_headers\\".*?v8_enable_i18n_support.*?v8_current_cpu == \\"x64\\".*?v8_enable_webassembly.*?is_linux.*?sources \\+= ")',
+                      '<(V8_ROOT)/src/trap-handler/handler-inside-posix.h',
                     ],
                   }],
                   ['OS=="win"', {
                     'sources': [
-                      '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_header_set.\\"v8_internal_headers\\".*?v8_enable_i18n_support.*?v8_current_cpu == \\"x64\\".*?v8_enable_webassembly.*?is_win.*?sources \\+= ")',
+                      '<(V8_ROOT)/src/trap-handler/handler-inside-win.h',
                     ],
                   }],
                 ],
@@ -631,12 +632,12 @@
               }],
               ['v8_enable_webassembly==1', {
                 'conditions': [
-                  ['OS=="mac" or (_toolset=="host" and host_arch=="x64" and OS=="linux")', {
+                  ['((_toolset=="host" and host_arch=="arm64" or _toolset=="target" and target_arch=="arm64") and (OS=="linux" or OS=="mac")) or ((_toolset=="host" and host_arch=="x64" or _toolset=="target" and target_arch=="x64") and (OS=="linux" or OS=="mac"))', {
                     'sources': [
                       '<(V8_ROOT)/src/trap-handler/handler-inside-posix.h',
                     ],
                   }],
-                  ['_toolset=="host" and host_arch=="x64" and (OS=="linux" or OS=="mac" or OS=="win")', {
+                  ['(_toolset=="host" and host_arch=="x64" or _toolset=="target" and target_arch=="x64") and (OS=="linux" or OS=="mac" or OS=="win")', {
                     'sources': [
                       '<(V8_ROOT)/src/trap-handler/trap-handler-simulator.h',
                     ],
@@ -874,13 +875,6 @@
         '<@(inspector_all_sources)',
       ],
       'conditions': [
-        ['v8_enable_third_party_heap==1', {
-          # TODO(targos): add values from v8_third_party_heap_files to sources
-        }, {
-          'sources': [
-            '<(V8_ROOT)/src/heap/third-party/heap-api-stub.cc',
-          ],
-        }],
         ['v8_enable_snapshot_compression==1', {
           'sources': [
             '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "\\"v8_base_without_compiler.*?v8_enable_snapshot_compression.*?sources \\+= ")',
@@ -908,6 +902,13 @@
             '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "\\"v8_base_without_compiler.*?v8_enable_webassembly.*?sources \\+= ")',
           ],
         }],
+        ['v8_enable_third_party_heap==1', {
+          # TODO(targos): add values from v8_third_party_heap_files to sources
+        }, {
+          'sources': [
+            '<(V8_ROOT)/src/heap/third-party/heap-api-stub.cc',
+          ],
+        }],
         ['v8_enable_heap_snapshot_verify==1', {
           'sources': [
             '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "\\"v8_base_without_compiler.*?v8_enable_heap_snapshot_verify.*?sources \\+= ")',
@@ -932,12 +933,14 @@
               'conditions': [
                 ['OS=="linux" or OS=="mac" or OS=="ios" or OS=="freebsd"', {
                   'sources': [
-                    '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "\\"v8_base_without_compiler.*?v8_enable_wasm_gdb_remote_debugging.*?v8_current_cpu == \\"x64\\".*?v8_enable_webassembly.*?is_linux.*?sources \\+= ")',
+                    '<(V8_ROOT)/src/trap-handler/handler-inside-posix.cc',
+                    '<(V8_ROOT)/src/trap-handler/handler-outside-posix.cc',
                   ],
                 }],
                 ['OS=="win"', {
                   'sources': [
-                    '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "\\"v8_base_without_compiler.*?v8_enable_wasm_gdb_remote_debugging.*?v8_current_cpu == \\"x64\\".*?v8_enable_webassembly.*?is_win.*?sources \\+= ")',
+                    '<(V8_ROOT)/src/trap-handler/handler-inside-win.cc',
+                    '<(V8_ROOT)/src/trap-handler/handler-outside-win.cc',
                   ],
                 }],
               ],
@@ -956,21 +959,19 @@
           'conditions': [
             ['v8_enable_webassembly==1', {
               'conditions': [
-                ['OS=="mac" or OS=="ios" or '
-                 '(_toolset=="host" and host_arch=="x64" and (host_os=="linux" or host_os=="mac"))', {
+                ['((_toolset=="host" and host_arch=="arm64" or _toolset=="target" and target_arch=="arm64") and (OS=="linux" or OS=="mac" or OS=="ios")) or ((_toolset=="host" and host_arch=="x64" or _toolset=="target" and target_arch=="x64") and (OS=="linux" or OS=="mac"))', {
                   'sources': [
                     '<(V8_ROOT)/src/trap-handler/handler-inside-posix.cc',
                     '<(V8_ROOT)/src/trap-handler/handler-outside-posix.cc',
                   ],
                 }],
-                ['_toolset=="host" and host_arch=="x64" and OS=="win"', {
+                ['(_toolset=="host" and host_arch=="x64" or _toolset=="target" and target_arch=="x64") and OS=="win"', {
                   'sources': [
                     '<(V8_ROOT)/src/trap-handler/handler-inside-win.cc',
                     '<(V8_ROOT)/src/trap-handler/handler-outside-win.cc',
                   ],
                 }],
-                ['_toolset=="host" and host_arch=="x64" and '
-                 '(host_os=="linux" or host_os=="mac" or OS=="win")', {
+                ['(_toolset=="host" and host_arch=="x64" or _toolset=="target" and target_arch=="x64") and (OS=="linux" or OS=="mac" or OS=="win")', {
                   'sources': [
                     '<(V8_ROOT)/src/trap-handler/handler-outside-simulator.cc',
                   ],
@@ -1264,6 +1265,7 @@
           'sources': [
             '<(V8_ROOT)/src/base/debug/stack_trace_win.cc',
             '<(V8_ROOT)/src/base/platform/platform-win32.cc',
+            '<(V8_ROOT)/src/base/platform/platform-win32.h',
             '<(V8_ROOT)/src/base/win32-headers.h',
           ],
           'defines': ['_CRT_RAND_S'], # for rand_s()
@@ -1419,6 +1421,8 @@
         '<(V8_ROOT)/src/libplatform/default-job.h',
         '<(V8_ROOT)/src/libplatform/default-platform.cc',
         '<(V8_ROOT)/src/libplatform/default-platform.h',
+        '<(V8_ROOT)/src/libplatform/default-thread-isolated-allocator.cc',
+        '<(V8_ROOT)/src/libplatform/default-thread-isolated-allocator.h',
         '<(V8_ROOT)/src/libplatform/default-worker-threads-task-runner.cc',
         '<(V8_ROOT)/src/libplatform/default-worker-threads-task-runner.h',
         '<(V8_ROOT)/src/libplatform/delayed-task-queue.cc',
@@ -1452,7 +1456,6 @@
             '<(V8_ROOT)/src/libplatform/tracing/trace-writer.h',
           ],
           'sources': [
-            '<(V8_ROOT)/src/libplatform/tracing/trace-event-listener.cc',
             '<(V8_ROOT)/src/libplatform/tracing/trace-event-listener.h',
           ],
           'dependencies': [
@@ -1717,9 +1720,7 @@
       'toolsets': ['host', 'target'],
       'direct_dependent_settings': {
         'sources': [
-          '<(V8_ROOT)/src/heap/base/active-system-pages.cc',
-          '<(V8_ROOT)/src/heap/base/stack.cc',
-          '<(V8_ROOT)/src/heap/base/worklist.cc',
+          '<!@pymod_do_main(GN-scraper "<(V8_ROOT)/BUILD.gn"  "v8_source_set.\\"v8_heap_base.*?sources = ")',
         ],
         'conditions': [
           ['enable_lto=="true"', {
@@ -1863,10 +1864,20 @@
           '<(V8_ROOT)/src/objects/allocation-site-inl.h',
           '<(V8_ROOT)/src/objects/cell.h',
           '<(V8_ROOT)/src/objects/cell-inl.h',
+          '<(V8_ROOT)/src/objects/dependent-code.h',
+          '<(V8_ROOT)/src/objects/dependent-code-inl.h',
+          '<(V8_ROOT)/src/objects/bytecode-array.h',
+          '<(V8_ROOT)/src/objects/bytecode-array-inl.h',
+          '<(V8_ROOT)/src/objects/abstract-code.h',
+          '<(V8_ROOT)/src/objects/abstract-code-inl.h',
+          '<(V8_ROOT)/src/objects/instruction-stream.h',
+          '<(V8_ROOT)/src/objects/instruction-stream-inl.h',
           '<(V8_ROOT)/src/objects/code.h',
           '<(V8_ROOT)/src/objects/code-inl.h',
           '<(V8_ROOT)/src/objects/data-handler.h',
           '<(V8_ROOT)/src/objects/data-handler-inl.h',
+          '<(V8_ROOT)/src/objects/deoptimization-data.h',
+          '<(V8_ROOT)/src/objects/deoptimization-data-inl.h',
           '<(V8_ROOT)/src/objects/descriptor-array.h',
           '<(V8_ROOT)/src/objects/descriptor-array-inl.h',
           '<(V8_ROOT)/src/objects/feedback-cell.h',
@@ -1878,6 +1889,8 @@
           '<(V8_ROOT)/src/objects/heap-object.h',
           '<(V8_ROOT)/src/objects/heap-object-inl.h',
           '<(V8_ROOT)/src/objects/instance-type.h',
+          '<(V8_ROOT)/src/objects/instance-type-checker.h',
+          '<(V8_ROOT)/src/objects/instance-type-inl.h',
           '<(V8_ROOT)/src/objects/js-array-buffer.h',
           '<(V8_ROOT)/src/objects/js-array-buffer-inl.h',
           '<(V8_ROOT)/src/objects/js-array.h',
@@ -1890,6 +1903,9 @@
           '<(V8_ROOT)/src/objects/js-objects-inl.h',
           '<(V8_ROOT)/src/objects/js-promise.h',
           '<(V8_ROOT)/src/objects/js-promise-inl.h',
+          '<(V8_ROOT)/src/objects/js-raw-json.cc',
+          '<(V8_ROOT)/src/objects/js-raw-json.h',
+          '<(V8_ROOT)/src/objects/js-raw-json-inl.h',
           '<(V8_ROOT)/src/objects/js-regexp.cc',
           '<(V8_ROOT)/src/objects/js-regexp.h',
           '<(V8_ROOT)/src/objects/js-regexp-inl.h',
@@ -1898,6 +1914,8 @@
           '<(V8_ROOT)/src/objects/map.cc',
           '<(V8_ROOT)/src/objects/map.h',
           '<(V8_ROOT)/src/objects/map-inl.h',
+          '<(V8_ROOT)/src/objects/megadom-handler.h',
+          '<(V8_ROOT)/src/objects/megadom-handler-inl.h',
           '<(V8_ROOT)/src/objects/name.h',
           '<(V8_ROOT)/src/objects/name-inl.h',
           '<(V8_ROOT)/src/objects/objects.h',
@@ -1920,6 +1938,7 @@
           '<(V8_ROOT)/src/objects/string-inl.h',
           '<(V8_ROOT)/src/objects/struct.h',
           '<(V8_ROOT)/src/objects/struct-inl.h',
+          '<(V8_ROOT)/src/objects/tagged.h',
         ],
       },
       'actions': [
diff --git a/tsconfig.json b/tsconfig.json
index f42ed9ad0eac67..3f5a3067ced063 100644
--- a/tsconfig.json
+++ b/tsconfig.json
@@ -2,22 +2,6 @@
   "include": ["lib", "doc"],
   "exclude": ["src", "tools", "out"],
   "files": [
-    "./typings/internalBinding/async_wrap.d.ts",
-    "./typings/internalBinding/blob.d.ts",
-    "./typings/internalBinding/config.d.ts",
-    "./typings/internalBinding/constants.d.ts",
-    "./typings/internalBinding/fs.d.ts",
-    "./typings/internalBinding/http_parser.d.ts",
-    "./typings/internalBinding/messaging.d.ts",
-    "./typings/internalBinding/options.d.ts",
-    "./typings/internalBinding/os.d.ts",
-    "./typings/internalBinding/serdes.d.ts",
-    "./typings/internalBinding/symbols.d.ts",
-    "./typings/internalBinding/timers.d.ts",
-    "./typings/internalBinding/types.d.ts",
-    "./typings/internalBinding/url.d.ts",
-    "./typings/internalBinding/util.d.ts",
-    "./typings/internalBinding/worker.d.ts",
     "./typings/globals.d.ts",
     "./typings/primordials.d.ts"
   ],
@@ -25,7 +9,7 @@
     "allowJs": true,
     "checkJs": false,
     "noEmit": true,
-    "lib": ["ESNext"],
+    "lib": ["ESNext", "DOM"],
     "target": "ESNext",
     "module": "CommonJS",
     "baseUrl": ".",
diff --git a/typings/globals.d.ts b/typings/globals.d.ts
index 182284aa342718..d72bf937bb75c9 100644
--- a/typings/globals.d.ts
+++ b/typings/globals.d.ts
@@ -1,3 +1,20 @@
+import {AsyncWrapBinding} from "./internalBinding/async_wrap";
+import {BlobBinding} from "./internalBinding/blob";
+import {ConfigBinding} from "./internalBinding/config";
+import {ConstantsBinding} from "./internalBinding/constants";
+import {HttpParserBinding} from "./internalBinding/http_parser";
+import {FsBinding} from "./internalBinding/fs";
+import {MessagingBinding} from "./internalBinding/messaging";
+import {OptionsBinding} from "./internalBinding/options";
+import {OSBinding} from "./internalBinding/os";
+import {SerdesBinding} from "./internalBinding/serdes";
+import {SymbolsBinding} from "./internalBinding/symbols";
+import {TimersBinding} from "./internalBinding/timers";
+import {TypesBinding} from "./internalBinding/types";
+import {URLBinding} from "./internalBinding/url";
+import {UtilBinding} from "./internalBinding/util";
+import {WorkerBinding} from "./internalBinding/worker";
+
 declare type TypedArray =
   | Uint8Array
   | Uint8ClampedArray
@@ -10,3 +27,34 @@ declare type TypedArray =
   | Float64Array
   | BigUint64Array
   | BigInt64Array;
+
+interface InternalBindingMap {
+  async_wrap: AsyncWrapBinding;
+  blob: BlobBinding;
+  config: ConfigBinding;
+  constants: ConstantsBinding;
+  fs: FsBinding;
+  http_parser: HttpParserBinding;
+  messaging: MessagingBinding;
+  options: OptionsBinding;
+  os: OSBinding;
+  serdes: SerdesBinding;
+  symbols: SymbolsBinding;
+  timers: TimersBinding;
+  types: TypesBinding;
+  url: URLBinding;
+  util: UtilBinding;
+  worker: WorkerBinding;
+}
+
+type InternalBindingKeys = keyof InternalBindingMap;
+
+declare function internalBinding<T extends InternalBindingKeys>(binding: T): InternalBindingMap[T]
+
+declare global {
+  namespace NodeJS {
+    interface Global {
+      internalBinding<T extends InternalBindingKeys>(binding: T): InternalBindingMap[T]
+    }
+  }
+}
diff --git a/typings/internalBinding/async_wrap.d.ts b/typings/internalBinding/async_wrap.d.ts
index bfbda3d7ed890b..a8b583c56967bb 100644
--- a/typings/internalBinding/async_wrap.d.ts
+++ b/typings/internalBinding/async_wrap.d.ts
@@ -72,7 +72,7 @@ declare namespace InternalAsyncWrapBinding {
   }
 }
 
-declare function InternalBinding(binding: 'async_wrap'): {
+export interface AsyncWrapBinding {
   setupHooks(): {
     init: (
       asyncId: number,
@@ -129,4 +129,4 @@ declare function InternalBinding(binding: 'async_wrap'): {
     kDefaultTriggerAsyncId: 3;
   };
   Providers: InternalAsyncWrapBinding.Providers;
-};
+}
diff --git a/typings/internalBinding/blob.d.ts b/typings/internalBinding/blob.d.ts
index 41813d0a619607..5396c863bb5e59 100644
--- a/typings/internalBinding/blob.d.ts
+++ b/typings/internalBinding/blob.d.ts
@@ -10,10 +10,10 @@ declare namespace InternalBlobBinding {
   }
 }
 
-declare function InternalBinding(binding: 'blob'): {
+export interface BlobBinding {
   createBlob(sources: Array<Uint8Array | InternalBlobBinding.BlobHandle>, length: number): InternalBlobBinding.BlobHandle;
   FixedSizeBlobCopyJob: typeof InternalBlobBinding.FixedSizeBlobCopyJob;
   getDataObject(id: string): [handle: InternalBlobBinding.BlobHandle | undefined, length: number, type: string] | undefined;
   storeDataObject(id: string, handle: InternalBlobBinding.BlobHandle, size: number, type: string): void;
   revokeDataObject(id: string): void;
-};
+}
diff --git a/typings/internalBinding/config.d.ts b/typings/internalBinding/config.d.ts
index d9f34e1131ced5..7c93e34238915e 100644
--- a/typings/internalBinding/config.d.ts
+++ b/typings/internalBinding/config.d.ts
@@ -1,4 +1,4 @@
-declare function InternalBinding(binding: 'config'): {
+export interface ConfigBinding {
   isDebugBuild: boolean;
   hasOpenSSL: boolean;
   fipsMode: boolean;
@@ -9,4 +9,4 @@ declare function InternalBinding(binding: 'config'): {
   noBrowserGlobals: boolean;
   bits: number;
   hasDtrace: boolean;
-};
+}
diff --git a/typings/internalBinding/constants.d.ts b/typings/internalBinding/constants.d.ts
index 68fead278cc64e..89d2a53aae2118 100644
--- a/typings/internalBinding/constants.d.ts
+++ b/typings/internalBinding/constants.d.ts
@@ -1,4 +1,4 @@
-declare function InternalBinding(binding: 'constants'): {
+export interface ConstantsBinding {
   os: {
     UV_UDP_REUSEADDR: 4;
     dlopen: {
@@ -186,6 +186,8 @@ declare function InternalBinding(binding: 'constants'): {
     COPYFILE_FICLONE: 2;
     UV_FS_COPYFILE_FICLONE_FORCE: 4;
     COPYFILE_FICLONE_FORCE: 4;
+    EXTENSIONLESS_FORMAT_JAVASCRIPT: 0;
+    EXTENSIONLESS_FORMAT_WASM: 1;
   };
   crypto: {
     OPENSSL_VERSION_NUMBER: 269488319;
@@ -382,4 +384,4 @@ declare function InternalBinding(binding: 'constants'): {
     TRACE_EVENT_PHASE_LEAVE_CONTEXT: 41;
     TRACE_EVENT_PHASE_LINK_IDS: 61;
   };
-};
+}
diff --git a/typings/internalBinding/fs.d.ts b/typings/internalBinding/fs.d.ts
index 4576913bf1366b..c4dd973293ab22 100644
--- a/typings/internalBinding/fs.d.ts
+++ b/typings/internalBinding/fs.d.ts
@@ -1,3 +1,5 @@
+import { ConstantsBinding } from './constants';
+
 declare namespace InternalFSBinding {
   class FSReqCallback<ResultType = unknown> {
     constructor(bigint?: boolean);
@@ -59,7 +61,7 @@ declare namespace InternalFSBinding {
   function access(path: StringOrBuffer, mode: number, usePromises: typeof kUsePromises): Promise<void>;
 
   function chmod(path: string, mode: number, req: FSReqCallback): void;
-  function chmod(path: string, mode: number, req: undefined, ctx: FSSyncContext): void;
+  function chmod(path: string, mode: number): void;
   function chmod(path: string, mode: number, usePromises: typeof kUsePromises): Promise<void>;
 
   function chown(path: string, uid: number, gid: number, req: FSReqCallback): void;
@@ -74,7 +76,7 @@ declare namespace InternalFSBinding {
   function copyFile(src: StringOrBuffer, dest: StringOrBuffer, mode: number, usePromises: typeof kUsePromises): Promise<void>;
 
   function fchmod(fd: number, mode: number, req: FSReqCallback): void;
-  function fchmod(fd: number, mode: number, req: undefined, ctx: FSSyncContext): void;
+  function fchmod(fd: number, mode: number): void;
   function fchmod(fd: number, mode: number, usePromises: typeof kUsePromises): Promise<void>;
 
   function fchown(fd: number, uid: number, gid: number, req: FSReqCallback): void;
@@ -84,6 +86,7 @@ declare namespace InternalFSBinding {
   function fdatasync(fd: number, req: FSReqCallback): void;
   function fdatasync(fd: number, req: undefined, ctx: FSSyncContext): void;
   function fdatasync(fd: number, usePromises: typeof kUsePromises): Promise<void>;
+  function fdatasync(fd: number): void;
 
   function fstat(fd: number, useBigint: boolean, req: FSReqCallback<Float64Array | BigUint64Array>): void;
   function fstat(fd: number, useBigint: true, req: FSReqCallback<BigUint64Array>): void;
@@ -104,12 +107,12 @@ declare namespace InternalFSBinding {
   function ftruncate(fd: number, len: number, usePromises: typeof kUsePromises): Promise<void>;
 
   function futimes(fd: number, atime: number, mtime: number, req: FSReqCallback): void;
-  function futimes(fd: number, atime: number, mtime: number, req: undefined, ctx: FSSyncContext): void;
+  function futimes(fd: number, atime: number, mtime: number): void;
   function futimes(fd: number, atime: number, mtime: number, usePromises: typeof kUsePromises): Promise<void>;
 
   function internalModuleReadJSON(path: string): [] | [string, boolean];
   function internalModuleStat(path: string): number;
-  
+
   function lchown(path: string, uid: number, gid: number, req: FSReqCallback): void;
   function lchown(path: string, uid: number, gid: number, req: undefined, ctx: FSSyncContext): void;
   function lchown(path: string, uid: number, gid: number, usePromises: typeof kUsePromises): Promise<void>;
@@ -129,7 +132,7 @@ declare namespace InternalFSBinding {
   function lstat(path: StringOrBuffer, useBigint: false, usePromises: typeof kUsePromises): Promise<Float64Array>;
 
   function lutimes(path: string, atime: number, mtime: number, req: FSReqCallback): void;
-  function lutimes(path: string, atime: number, mtime: number, req: undefined, ctx: FSSyncContext): void;
+  function lutimes(path: string, atime: number, mtime: number): void;
   function lutimes(path: string, atime: number, mtime: number, usePromises: typeof kUsePromises): Promise<void>;
 
   function mkdtemp(prefix: string, encoding: unknown, req: FSReqCallback<string>): void;
@@ -163,8 +166,8 @@ declare namespace InternalFSBinding {
   function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: true, req: FSReqCallback<[string[], number[]]>): void;
   function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: false, req: FSReqCallback<string[]>): void;
   function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: boolean, req: undefined, ctx: FSSyncContext): string[] | [string[], number[]];
-  function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: true, req: undefined, ctx: FSSyncContext): [string[], number[]];
-  function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: false, req: undefined, ctx: FSSyncContext): string[];
+  function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: true): [string[], number[]];
+  function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: false): string[];
   function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: boolean, usePromises: typeof kUsePromises): Promise<string[] | [string[], number[]]>;
   function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: true, usePromises: typeof kUsePromises): Promise<[string[], number[]]>;
   function readdir(path: StringOrBuffer, encoding: unknown, withFileTypes: false, usePromises: typeof kUsePromises): Promise<string[]>;
@@ -198,13 +201,13 @@ declare namespace InternalFSBinding {
   function symlink(target: StringOrBuffer, path: StringOrBuffer, type: number, req: FSReqCallback): void;
   function symlink(target: StringOrBuffer, path: StringOrBuffer, type: number, req: undefined, ctx: FSSyncContext): void;
   function symlink(target: StringOrBuffer, path: StringOrBuffer, type: number, usePromises: typeof kUsePromises): Promise<void>;
-  
+
   function unlink(path: string, req: FSReqCallback): void;
-  function unlink(path: string, req: undefined, ctx: FSSyncContext): void;
+  function unlink(path: string): void;
   function unlink(path: string, usePromises: typeof kUsePromises): Promise<void>;
 
   function utimes(path: string, atime: number, mtime: number, req: FSReqCallback): void;
-  function utimes(path: string, atime: number, mtime: number, req: undefined, ctx: FSSyncContext): void;
+  function utimes(path: string, atime: number, mtime: number): void;
   function utimes(path: string, atime: number, mtime: number, usePromises: typeof kUsePromises): Promise<void>;
 
   function writeBuffer(fd: number, buffer: ArrayBufferView, offset: number, length: number, position: number | null, req: FSReqCallback<number>): void;
@@ -218,9 +221,11 @@ declare namespace InternalFSBinding {
   function writeString(fd: number, value: string, pos: unknown, encoding: unknown, req: FSReqCallback<number>): void;
   function writeString(fd: number, value: string, pos: unknown, encoding: unknown, req: undefined, ctx: FSSyncContext): number;
   function writeString(fd: number, value: string, pos: unknown, encoding: unknown, usePromises: typeof kUsePromises): Promise<number>;
+
+  function getFormatOfExtensionlessFile(url: string): ConstantsBinding['fs'];
 }
 
-declare function InternalBinding(binding: 'fs'): {
+export interface FsBinding {
   FSReqCallback: typeof InternalFSBinding.FSReqCallback;
 
   FileHandle: typeof InternalFSBinding.FileHandle;
@@ -269,4 +274,6 @@ declare function InternalBinding(binding: 'fs'): {
   writeBuffer: typeof InternalFSBinding.writeBuffer;
   writeBuffers: typeof InternalFSBinding.writeBuffers;
   writeString: typeof InternalFSBinding.writeString;
-};
+
+  getFormatOfExtensionlessFile: typeof InternalFSBinding.getFormatOfExtensionlessFile;
+}
diff --git a/typings/internalBinding/http_parser.d.ts b/typings/internalBinding/http_parser.d.ts
index bd9a22e55b12e5..5ab5651b637176 100644
--- a/typings/internalBinding/http_parser.d.ts
+++ b/typings/internalBinding/http_parser.d.ts
@@ -39,7 +39,7 @@ declare namespace InternalHttpParserBinding {
   }
 }
 
-declare function InternalBinding(binding: 'http_parser'): {
+export interface HttpParserBinding {
   methods: string[];
   HTTPParser: typeof InternalHttpParserBinding.HTTPParser;
-};
+}
diff --git a/typings/internalBinding/messaging.d.ts b/typings/internalBinding/messaging.d.ts
index ca5be84848408d..93a1a050887503 100644
--- a/typings/internalBinding/messaging.d.ts
+++ b/typings/internalBinding/messaging.d.ts
@@ -17,7 +17,7 @@ declare namespace InternalMessagingBinding {
 }
 
 
-declare function InternalBinding(binding: 'messaging'): {
+export interface MessagingBinding {
   DOMException: typeof import('internal/per_context/domexception').DOMException;
   MessageChannel: typeof InternalMessagingBinding.MessageChannel;
   MessagePort: typeof InternalMessagingBinding.MessagePort;
@@ -29,4 +29,4 @@ declare function InternalBinding(binding: 'messaging'): {
   moveMessagePortToContext(port: typeof InternalMessagingBinding.MessagePort, context: any): typeof InternalMessagingBinding.MessagePort;
   setDeserializerCreateObjectFunction(func: (deserializeInfo: string) => any): void;
   broadcastChannel(name: string): typeof InternalMessagingBinding.MessagePort;
-};
+}
diff --git a/typings/internalBinding/options.d.ts b/typings/internalBinding/options.d.ts
index ded726f9d71127..8248997d463654 100644
--- a/typings/internalBinding/options.d.ts
+++ b/typings/internalBinding/options.d.ts
@@ -1,4 +1,4 @@
-declare function InternalBinding(binding: 'options'): {
+export interface OptionsBinding {
   getOptions(): {
     options: Map<
       string,
@@ -32,4 +32,4 @@ declare function InternalBinding(binding: 'options'): {
     kHostPort: 6;
     kStringList: 7;
   };
-};
+}
diff --git a/typings/internalBinding/os.d.ts b/typings/internalBinding/os.d.ts
index 161d9fd4b46836..91e907ef3c1205 100644
--- a/typings/internalBinding/os.d.ts
+++ b/typings/internalBinding/os.d.ts
@@ -2,7 +2,7 @@ declare namespace InternalOSBinding {
   type OSContext = {};
 }
 
-declare function InternalBinding(binding: 'os'): {
+export interface OSBinding {
   getHostname(ctx: InternalOSBinding.OSContext): string | undefined;
   getLoadAvg(array: Float64Array): void;
   getUptime(): number;
@@ -22,4 +22,4 @@ declare function InternalBinding(binding: 'os'): {
   getPriority(pid: number, ctx: InternalOSBinding.OSContext): number | undefined;
   getOSInformation(ctx: InternalOSBinding.OSContext): [sysname: string, version: string, release: string];
   isBigEndian: boolean;
-};
+}
diff --git a/typings/internalBinding/serdes.d.ts b/typings/internalBinding/serdes.d.ts
index b3577c658d2a9f..20b010151cb74a 100644
--- a/typings/internalBinding/serdes.d.ts
+++ b/typings/internalBinding/serdes.d.ts
@@ -30,7 +30,7 @@ declare namespace InternalSerdesBinding {
   }
 }
 
-declare function InternalBinding(binding: 'serdes'): {
+export interface SerdesBinding {
   Serializer: typeof InternalSerdesBinding.Serializer;
   Deserializer: typeof InternalSerdesBinding.Deserializer;
-};
+}
diff --git a/typings/internalBinding/symbols.d.ts b/typings/internalBinding/symbols.d.ts
index ac85f9e67e8aa2..96310970d5cdee 100644
--- a/typings/internalBinding/symbols.d.ts
+++ b/typings/internalBinding/symbols.d.ts
@@ -10,7 +10,7 @@ export const owner_symbol: unique symbol;
 export const onpskexchange_symbol: unique symbol;
 export const trigger_async_id_symbol: unique symbol;
 
-declare function InternalBinding(binding: 'symbols'): {
+export interface SymbolsBinding {
   async_id_symbol: typeof async_id_symbol;
   handle_onclose_symbol: typeof handle_onclose_symbol;
   no_message_symbol: typeof no_message_symbol;
@@ -22,4 +22,4 @@ declare function InternalBinding(binding: 'symbols'): {
   owner_symbol: typeof owner_symbol;
   onpskexchange_symbol: typeof onpskexchange_symbol;
   trigger_async_id_symbol: typeof trigger_async_id_symbol;
-};
+}
diff --git a/typings/internalBinding/timers.d.ts b/typings/internalBinding/timers.d.ts
index fd6d40ecfee5cc..e03deeeca24008 100644
--- a/typings/internalBinding/timers.d.ts
+++ b/typings/internalBinding/timers.d.ts
@@ -1,8 +1,8 @@
-declare function InternalBinding(binding: 'timers'): {
+export interface TimersBinding {
   getLibuvNow(): number;
   setupTimers(immediateCallback: () => void, timersCallback: (now: number) => void): void;
   scheduleTimer(msecs: number): void;
   toggleTimerRef(value: boolean): void;
   toggleImmediateRef(value: boolean): void;
   immediateInfo: Uint32Array;
-};
+}
diff --git a/typings/internalBinding/types.d.ts b/typings/internalBinding/types.d.ts
index c8efea84b69e9d..0c0d3ec81b5aae 100644
--- a/typings/internalBinding/types.d.ts
+++ b/typings/internalBinding/types.d.ts
@@ -1,4 +1,4 @@
-declare function InternalBinding(binding: 'types'): {
+export interface TypesBinding {
   isAsyncFunction(value: unknown): value is (...args: unknown[]) => Promise<unknown>;
   isGeneratorFunction(value: unknown): value is GeneratorFunction;
   isAnyArrayBuffer(value: unknown): value is (ArrayBuffer | SharedArrayBuffer);
@@ -23,4 +23,4 @@ declare function InternalBinding(binding: 'types'): {
   isNumberObject: (value: unknown) => value is Number;
   isBooleanObject: (value: unknown) => value is Boolean,
   isBigIntObject: (value: unknown) => value is BigInt;
-};
+}
diff --git a/typings/internalBinding/url.d.ts b/typings/internalBinding/url.d.ts
index 4c8ae2ab1508f0..03d5f6d750f358 100644
--- a/typings/internalBinding/url.d.ts
+++ b/typings/internalBinding/url.d.ts
@@ -1,6 +1,6 @@
 import type { urlUpdateActions } from 'internal/url'
 
-declare function InternalBinding(binding: 'url'): {
+export interface URLBinding {
   urlComponents: Uint32Array;
 
   domainToASCII(input: string): string;
@@ -9,4 +9,4 @@ declare function InternalBinding(binding: 'url'): {
   format(input: string, fragment?: boolean, unicode?: boolean, search?: boolean, auth?: boolean): string;
   parse(input: string, base?: string): string | false;
   update(input: string, actionType: typeof urlUpdateActions, value: string): string | false;
-};
+}
diff --git a/typings/internalBinding/util.d.ts b/typings/internalBinding/util.d.ts
index 002f8eb26d93e6..1ac9d3a39bbb31 100644
--- a/typings/internalBinding/util.d.ts
+++ b/typings/internalBinding/util.d.ts
@@ -7,7 +7,7 @@ declare namespace InternalUtilBinding {
   }
 }
 
-declare function InternalBinding(binding: 'util'): {
+export interface UtilBinding {
   // PER_ISOLATE_PRIVATE_SYMBOL_PROPERTIES, defined in src/env_properties.h
   arrow_message_private_symbol: 1;
   contextify_context_private_symbol: 2;
@@ -44,4 +44,4 @@ declare function InternalBinding(binding: 'util'): {
   WeakReference: typeof InternalUtilBinding.WeakReference;
   guessHandleType(fd: number): 'TCP' | 'TTY' | 'UDP' | 'FILE' | 'PIPE' | 'UNKNOWN';
   toUSVString(str: string, start: number): string;
-};
+}
diff --git a/typings/internalBinding/worker.d.ts b/typings/internalBinding/worker.d.ts
index 52bfc53c29dc0a..10cb5fc5db6e32 100644
--- a/typings/internalBinding/worker.d.ts
+++ b/typings/internalBinding/worker.d.ts
@@ -1,3 +1,5 @@
+import { InternalMessagingBinding } from './messaging';
+
 declare namespace InternalWorkerBinding {
   class Worker {
     constructor(
@@ -18,7 +20,7 @@ declare namespace InternalWorkerBinding {
   }
 }
 
-declare function InternalBinding(binding: 'worker'): {
+export interface WorkerBinding {
   Worker: typeof InternalWorkerBinding.Worker;
   getEnvMessagePort(): InternalMessagingBinding.MessagePort;
   threadId: number;
@@ -30,4 +32,4 @@ declare function InternalBinding(binding: 'worker'): {
   kCodeRangeSizeMb: number;
   kStackSizeMb: number;
   kTotalResourceLimitCount: number;
-};
+}
diff --git a/typings/primordials.d.ts b/typings/primordials.d.ts
index 8590812f4155e4..ffce093458f2b5 100644
--- a/typings/primordials.d.ts
+++ b/typings/primordials.d.ts
@@ -203,7 +203,6 @@ declare namespace primordials {
   export const DatePrototypeToTimeString: UncurryThis<typeof Date.prototype.toTimeString>
   export const DatePrototypeToISOString: UncurryThis<typeof Date.prototype.toISOString>
   export const DatePrototypeToUTCString: UncurryThis<typeof Date.prototype.toUTCString>
-  export const DatePrototypeToGMTString: UncurryThis<typeof Date.prototype.toGMTString>
   export const DatePrototypeGetDate: UncurryThis<typeof Date.prototype.getDate>
   export const DatePrototypeSetDate: UncurryThis<typeof Date.prototype.setDate>
   export const DatePrototypeGetDay: UncurryThis<typeof Date.prototype.getDay>
@@ -238,8 +237,6 @@ declare namespace primordials {
   export const DatePrototypeGetUTCSeconds: UncurryThis<typeof Date.prototype.getUTCSeconds>
   export const DatePrototypeSetUTCSeconds: UncurryThis<typeof Date.prototype.setUTCSeconds>
   export const DatePrototypeValueOf: UncurryThis<typeof Date.prototype.valueOf>
-  export const DatePrototypeGetYear: UncurryThis<typeof Date.prototype.getYear>
-  export const DatePrototypeSetYear: UncurryThis<typeof Date.prototype.setYear>
   export const DatePrototypeToJSON: UncurryThis<typeof Date.prototype.toJSON>
   export const DatePrototypeToLocaleString: UncurryThis<typeof Date.prototype.toLocaleString>
   export const DatePrototypeToLocaleDateString: UncurryThis<typeof Date.prototype.toLocaleDateString>
@@ -247,8 +244,8 @@ declare namespace primordials {
   export const DatePrototypeSymbolToPrimitive: UncurryMethod<typeof Date.prototype, typeof Symbol.toPrimitive>;
   export import Error = globalThis.Error;
   export const ErrorPrototype: typeof Error.prototype
+  // @ts-ignore
   export const ErrorCaptureStackTrace: typeof Error.captureStackTrace
-  export const ErrorStackTraceLimit: typeof Error.stackTraceLimit
   export const ErrorPrototypeToString: UncurryThis<typeof Error.prototype.toString>
   export import EvalError = globalThis.EvalError;
   export const EvalErrorPrototype: typeof EvalError.prototype
@@ -332,11 +329,7 @@ declare namespace primordials {
   export const ObjectEntries: typeof Object.entries
   export const ObjectFromEntries: typeof Object.fromEntries
   export const ObjectValues: typeof Object.values
-  export const ObjectPrototype__defineGetter__: UncurryThis<typeof Object.prototype.__defineGetter__>
-  export const ObjectPrototype__defineSetter__: UncurryThis<typeof Object.prototype.__defineSetter__>
   export const ObjectPrototypeHasOwnProperty: UncurryThis<typeof Object.prototype.hasOwnProperty>
-  export const ObjectPrototype__lookupGetter__: UncurryThis<typeof Object.prototype.__lookupGetter__>
-  export const ObjectPrototype__lookupSetter__: UncurryThis<typeof Object.prototype.__lookupSetter__>
   export const ObjectPrototypeIsPrototypeOf: UncurryThis<typeof Object.prototype.isPrototypeOf>
   export const ObjectPrototypePropertyIsEnumerable: UncurryThis<typeof Object.prototype.propertyIsEnumerable>
   export const ObjectPrototypeToString: UncurryThis<typeof Object.prototype.toString>
@@ -434,8 +427,8 @@ declare namespace primordials {
   export const SymbolFor: typeof Symbol.for
   export const SymbolKeyFor: typeof Symbol.keyFor
   export const SymbolAsyncIterator: typeof Symbol.asyncIterator
-  export const SymbolDispose: typeof Symbol // TODO(MoLow): use typeof Symbol.dispose when it's available
-  export const SymbolAsyncDispose: typeof Symbol // TODO(MoLow): use typeof Symbol.asyncDispose when it's available
+  export const SymbolDispose: typeof Symbol.dispose
+  export const SymbolAsyncDispose: typeof Symbol.asyncDispose
   export const SymbolHasInstance: typeof Symbol.hasInstance
   export const SymbolIsConcatSpreadable: typeof Symbol.isConcatSpreadable
   export const SymbolIterator: typeof Symbol.iterator
diff --git a/vcbuild.bat b/vcbuild.bat
index 89f990b1999d52..69d0ab9fb9a6f7 100644
--- a/vcbuild.bat
+++ b/vcbuild.bat
@@ -84,7 +84,6 @@ if /i "%1"=="ia32"          set target_arch=x86&goto arg-ok
 if /i "%1"=="x86"           set target_arch=x86&goto arg-ok
 if /i "%1"=="x64"           set target_arch=x64&goto arg-ok
 if /i "%1"=="arm64"         set target_arch=arm64&goto arg-ok
-if /i "%1"=="vs2019"        set target_env=vs2019&goto arg-ok
 if /i "%1"=="vs2022"        set target_env=vs2022&goto arg-ok
 if /i "%1"=="noprojgen"     set noprojgen=1&goto arg-ok
 if /i "%1"=="projgen"       set projgen=1&goto arg-ok
@@ -178,7 +177,6 @@ if defined package set stage_package=1
 set "node_exe=%config%\node.exe"
 set "node_gyp_exe="%node_exe%" deps\npm\node_modules\node-gyp\bin\node-gyp"
 set "npm_exe="%~dp0%node_exe%" %~dp0deps\npm\bin\npm-cli.js"
-if "%target_env%"=="vs2019" set "node_gyp_exe=%node_gyp_exe% --msvs_version=2019"
 if "%target_env%"=="vs2022" set "node_gyp_exe=%node_gyp_exe% --msvs_version=2022"
 
 :: skip building if the only argument received was lint
@@ -248,14 +246,14 @@ if %target_arch%==%msvs_host_arch% set vcvarsall_arg=%target_arch%
 
 @rem Look for Visual Studio 2022
 :vs-set-2022
-if defined target_env if "%target_env%" NEQ "vs2022" goto vs-set-2019
+if defined target_env if "%target_env%" NEQ "vs2022" goto msbuild-not-found
 echo Looking for Visual Studio 2022
 @rem VCINSTALLDIR may be set if run from a VS Command Prompt and needs to be
 @rem cleared first as vswhere_usability_wrapper.cmd doesn't when it fails to
 @rem detect the version searched for
 if not defined target_env set "VCINSTALLDIR="
-call tools\msvs\vswhere_usability_wrapper.cmd "[17.0,18.0)" %target_arch% "prerelease"
-if "_%VCINSTALLDIR%_" == "__" goto vs-set-2019
+call tools\msvs\vswhere_usability_wrapper.cmd "[17.6,18.0)" %target_arch% "prerelease"
+if "_%VCINSTALLDIR%_" == "__" goto msbuild-not-found
 @rem check if VS2022 is already setup, and for the requested arch
 if "_%VisualStudioVersion%_" == "_17.0_" if "_%VSCMD_ARG_TGT_ARCH%_"=="_%target_arch%_" goto found_vs2022
 @rem need to clear VSINSTALLDIR for vcvarsall to work as expected
@@ -265,7 +263,7 @@ set "VSCMD_START_DIR=%CD%"
 set vcvars_call="%VCINSTALLDIR%\Auxiliary\Build\vcvarsall.bat" %vcvarsall_arg%
 echo calling: %vcvars_call%
 call %vcvars_call%
-if errorlevel 1 goto vs-set-2019
+if errorlevel 1 goto msbuild-not-found
 if defined DEBUG_HELPER @ECHO ON
 :found_vs2022
 echo Found MSVS version %VisualStudioVersion%
@@ -273,33 +271,6 @@ set GYP_MSVS_VERSION=2022
 set PLATFORM_TOOLSET=v143
 goto msbuild-found
 
-@rem Look for Visual Studio 2019
-:vs-set-2019
-if defined target_env if "%target_env%" NEQ "vs2019" goto msbuild-not-found
-echo Looking for Visual Studio 2019
-@rem VCINSTALLDIR may be set if run from a VS Command Prompt and needs to be
-@rem cleared first as vswhere_usability_wrapper.cmd doesn't when it fails to
-@rem detect the version searched for
-if not defined target_env set "VCINSTALLDIR="
-call tools\msvs\vswhere_usability_wrapper.cmd "[16.0,17.0)" %target_arch% "prerelease"
-if "_%VCINSTALLDIR%_" == "__" goto msbuild-not-found
-@rem check if VS2019 is already setup, and for the requested arch
-if "_%VisualStudioVersion%_" == "_16.0_" if "_%VSCMD_ARG_TGT_ARCH%_"=="_%target_arch%_" goto found_vs2019
-@rem need to clear VSINSTALLDIR for vcvarsall to work as expected
-set "VSINSTALLDIR="
-@rem prevent VsDevCmd.bat from changing the current working directory
-set "VSCMD_START_DIR=%CD%"
-set vcvars_call="%VCINSTALLDIR%\Auxiliary\Build\vcvarsall.bat" %vcvarsall_arg%
-echo calling: %vcvars_call%
-call %vcvars_call%
-if errorlevel 1 goto msbuild-not-found
-if defined DEBUG_HELPER @ECHO ON
-:found_vs2019
-echo Found MSVS version %VisualStudioVersion%
-set GYP_MSVS_VERSION=2019
-set PLATFORM_TOOLSET=v142
-goto msbuild-found
-
 :msbuild-not-found
 echo Failed to find a suitable Visual Studio installation.
 echo Try to run in a "Developer Command Prompt" or consult
@@ -760,7 +731,7 @@ set exit_code=1
 goto exit
 
 :help
-echo vcbuild.bat [debug/release] [msi] [doc] [test/test-all/test-addons/test-doc/test-js-native-api/test-node-api/test-internet/test-tick-processor/test-known-issues/test-node-inspect/test-check-deopts/test-npm/test-v8/test-v8-intl/test-v8-benchmarks/test-v8-all] [ignore-flaky] [static/dll] [noprojgen] [projgen] [small-icu/full-icu/without-intl] [nobuild] [nosnapshot] [nonpm] [nocorepack] [ltcg] [licensetf] [sign] [ia32/x86/x64/arm64] [vs2019/vs2022] [download-all] [enable-vtune] [lint/lint-ci/lint-js/lint-md/lint-yaml] [lint-md-build] [package] [build-release] [upload] [no-NODE-OPTIONS] [link-module path-to-module] [debug-http2] [debug-nghttp2] [clean] [cctest] [no-cctest] [openssl-no-asm]
+echo vcbuild.bat [debug/release] [msi] [doc] [test/test-all/test-addons/test-doc/test-js-native-api/test-node-api/test-internet/test-tick-processor/test-known-issues/test-node-inspect/test-check-deopts/test-npm/test-v8/test-v8-intl/test-v8-benchmarks/test-v8-all] [ignore-flaky] [static/dll] [noprojgen] [projgen] [small-icu/full-icu/without-intl] [nobuild] [nosnapshot] [nonpm] [nocorepack] [ltcg] [licensetf] [sign] [ia32/x86/x64/arm64] [vs2022] [download-all] [enable-vtune] [lint/lint-ci/lint-js/lint-md/lint-yaml] [lint-md-build] [package] [build-release] [upload] [no-NODE-OPTIONS] [link-module path-to-module] [debug-http2] [debug-nghttp2] [clean] [cctest] [no-cctest] [openssl-no-asm]
 echo Examples:
 echo   vcbuild.bat                          : builds release build
 echo   vcbuild.bat debug                    : builds debug build